diff --git a/.babelrc b/.babelrc
index 6c335cd5..43349505 100644
--- a/.babelrc
+++ b/.babelrc
@@ -4,6 +4,7 @@
         "@babel/preset-typescript"
     ],
     "plugins": [
-        "@babel/plugin-transform-runtime"
+        "@babel/plugin-transform-runtime",
+        "@babel/plugin-proposal-class-properties"
     ]
 }
diff --git a/.eslintrc.js b/.eslintrc.js
index 8646d3ae..71613a54 100644
--- a/.eslintrc.js
+++ b/.eslintrc.js
@@ -1,24 +1,47 @@
 module.exports = {
-    "env": {
-        "browser": true,
-        "es2021": true
+    'env': {
+        'browser': true,
+        'es2021': true
     },
-    "extends": [
-        "eslint:recommended",
-        "plugin:@typescript-eslint/recommended"
+    'extends': [
+        'eslint:recommended',
+        'plugin:@typescript-eslint/recommended'
     ],
-    "parser": "@typescript-eslint/parser",
-    "parserOptions": {
-        "ecmaVersion": 12,
-        "sourceType": "module"
+    'parser': '@typescript-eslint/parser',
+    'parserOptions': {
+        'ecmaVersion': 12,
+        'sourceType': 'module'
     },
-    "plugins": [
-        "@typescript-eslint"
+    'plugins': [
+        '@typescript-eslint'
     ],
-    "ignorePatterns": ["**/*.js"],
-    "rules": {
-        "@typescript-eslint/no-explicit-any": "off",
+    'ignorePatterns': ['**/*.js'],
+    'rules': {
+        '@typescript-eslint/no-explicit-any': 'off',
         "@typescript-eslint/no-non-null-assertion": "off",
         "prefer-arrow-callback": "error",
+        'indent': [
+            'error',
+            4,
+            {
+                'SwitchCase': 1,
+            }
+        ],
+        'linebreak-style': [
+            'error',
+            'unix'
+        ],
+        'quotes': [
+            'error',
+            'single'
+        ],
+        'semi': [
+            'error',
+            'always'
+        ],
+        'prefer-arrow-callback': 'error',
+        '@typescript-eslint/no-non-null-assertion': 'off',
+        'camelcase': 'error',
+        '@typescript-eslint/ban-ts-comment': 'off',
     }
 };
diff --git a/.gitignore b/.gitignore
index 0527d98d..f578d6ff 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,3 +1,5 @@
+.DS_Store
+
 # Logs
 logs
 *.log
diff --git a/README.md b/README.md
index 46cbc627..0b6ef835 100644
--- a/README.md
+++ b/README.md
@@ -14,7 +14,6 @@ npm install
 npm run watch
 ```
 
-Before committing your changes, run `npm install && npm run build-prod` to build
-a production bundle. GitHub Actions will fail if the production bundle in your
-commit is not up-to-date. If the CI is failing, make sure that you run
-`npm install` before building as the dependencies might've changed.
+To launch a local server with hot reloading, replace the second command with `npm run serve`.
+
+Before committing your changes, run `npm install && npm run build-prod` to build a production bundle. GitHub Actions will fail if the production bundle in your commit is not up-to-date. If the CI is failing, make sure that you run `npm install` before building as the dependencies might've changed.
diff --git a/dist/306.js b/dist/306.js
deleted file mode 100755
index 68f78e53..00000000
--- a/dist/306.js
+++ /dev/null
@@ -1,2 +0,0 @@
-(self.webpackChunk_spcl_sdfv=self.webpackChunk_spcl_sdfv||[]).push([[306],{3725:(A,C,I)=>{"use strict";I.r(C),I.d(C,{MemoryOpButton:()=>a,AutoSuperSectionMemoryOpAnalysis:()=>w});var Q=I(2137),E=I(5991),B=I(7329),g=I(6610),e=I(379),i=I(6070),n=I(7608),t=I(7757),h=I.n(t),k=I(4286),s=I(1318);function D(A){var C=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(A){return!1}}();return function(){var I,Q=(0,n.Z)(A);if(C){var E=(0,n.Z)(this).constructor;I=Reflect.construct(Q,arguments,E)}else I=Q.apply(this,arguments);return(0,i.Z)(this,I)}}var a=function(A){(0,e.Z)(I,A);var C=D(I);function I(A,Q,E){var e;(0,g.Z)(this,I),(e=C.call(this,A)).supersection_all_vec_analyses=Q;var i="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAAAXNSR0IArs4c6QAAAARnQU1BAACxjwv8YQUAAAK1UExURQAAAAMDAwAEAAQEBAcHBwABCggICAsLCwwMDA8PDwAQAQIUBAMWBQUZCAYbCAkeCxAQEBMTExQUFBcXFxgYGBwcHB8fHwAFIgMJKQYMLwkQNg0UPAkgDAwjDg0kDw8pEQ8pEhItFRIuFRc1Ghg2Gxo6HRo7Hhw+ICAgICMjIyQkJCcnJygoKCsrKywsLC8vLzAwMDMzMzQ0NDc3Nzg4ODs7Ozw8PD8/Pw8XQxIbSRghVRokWx0nYh8qaB4sfTg9VCEtbR9DIx1MIh5NIx9PJAB/DiFGJSFTJiFUJyNbKThFOSVhLCViLCdnLidpLydqLyhtLyhvMCN/LSV9LyR/LiV+Lyd5MCd6MCd8MChxMClxMShzMCh2MCh3MSh5MDZ/Pjd+Pz9OQT9EXEBAQEdHR0hISExMTE9PT1BQUFNTU1RUVFhYWFtbW1xcXF9fX2BgYGNjY2RkZGhoaGtra2xsbG9vb3BwcHNzc3R0dHd3d3h4eHt7e3x8fH5+fn9/fx8ugiEwiCM0lCU3nic6qCc7rSg8sig9tik+uwAm/w8y9x895Ro67R076x486BI09hc38hQ19Bg48Cg/wCg/xCU/1yM/3SM/3yQ/2SE+4ydAyyhAyCdA0CZA0zZMxzZN1A+DHBKDHhWEIReEIxiDJBmDJRqDJh2DKB6DKR+CKiGBKyCCKyGBLCOALSOALjaEP4KCgoODg4aGhoeHh4qKiouLi46Ojo+Pj5OTk5aWlpeXl5ubm56enp+fn6KioqOjo6ampqenp6urq66urq+vr7a2tre3t7q6uru7u76+vr+/v8bGxsfHx8vLy87Ozs/Pz9LS0tPT09bW1tfX19ra2tvb297e3t/f3+Li4uPj4+bm5ufn5+rq6uvr6+7u7u/v7/Ly8vPz8/b29vf39/r6+vv7+/7+/v///xprvVsAAAAJcEhZcwAADsMAAA7DAcdvqGQAAAAYdEVYdFNvZnR3YXJlAHBhaW50Lm5ldCA0LjEuNWRHWFIAAB7SSURBVHja7d39f5X3XcfxlEDsvVnJWihrtZ3tINYSXS1jzIqbF4oTtQpM0OFN1hG7legssbqSjTKbEucNuplmU1GpE5k3tSuZHbHbOKLEjmOVDOVYYjmcfP8O27Vjbfl8z7lOznV9bz7f1/vHjZLk9Dyv12Ms5NNlGGPWdfESMAYQxgDCGEAYAwhjAGEMIIwBhDGAMAYQxhhAGAMIYwBhDCCMAYQxgDAGEMYAwhhAGAMIYwwgjAGEMYAwBhDGAMIYQBgDCGMAYQwgjDGAMAYQxgDCGEAYAwhjAGEMIIwBhDGAMAYQxhhAGAMIYwBhDCCMAYQxgDAGEMYAwhhAGGMAYQwgjAGEMYAwBhDGAMIYQBgDCGMAYQwgjDGAMAYQxgDCGEAYAwhjAGEMIIwBhDGAMMYAwhhAGAMIYwBhDCCMAYQxgDAGEMYAwhhAGGMAYQwgjAGEMYAwBhDGAMIYQBgDCGMAYQwgvASMAYQxgDAGEMYAwhhAGAMIYwBhDCCMAaS0DXaFv0HeDwwgAGEAAQgDCEAYQADCAAIQBhCAqN38KEAAwqw+TnbNAAQgzAbk7WpfO4AApHMfx1968U4ABCBMBrL6pRdvACAAYdaAdHVVAAIQZguI1oQABCCd+vjyqy9fBSAAYZf4uLDq1ZdvACAAYZcAOXbx9asABCDMFpCurjsbAAEIswWkq2saIABhr/Nx/vrXvID9DYAUCGTJDT63BCBFADn6uldwGiAFArnhMZ+7ASBFBGTp615BfQkBCECKC4jChAAEIMUFRGFCAAKQDoD84yWv4TMAAQh71ce5Ky55DfvqAAEIewXIHuHPyqcAAhBmC4i6hAAEIIUGRFtCAAKQQgPyUkJeBAhAmJnfbfmOnVGAAITNn11sAdI7BxCAAGS39Zs+RwECEAKy2ApEU0IAApCiA6IqIQAByIJ8nF7cBMjlNYAAJG0gu5r+1bMRgAAk7YBc1hRITw0gACEgCSQEIAApPiCKEgIQgCwAyIdb/gCMBwECkGR9nGr9E2K6ZwECkFSB7MzxM5SGAQIQAqI+IQABSCkB0ZIQgACklIBoSQhAANIukDU5f5Lr/QABSII+Tub+WcdVgACEgNg3BBCAEBDdCQEIQMoKiIqEAAQgbfn4V1HCor9fJP7nzwEEIGkBWS36+KnsvYt0niQCCEDa8XFcDMXVWZZdKf43MwABCAHZ/hKQTToTAhCAFBIQrQkBCEAKCYjWhAAEIPl9HGsSEFtCKgABSCI+LqwSA7L1VSDbxIQMAAQgSQfk2uybu0phQgACkIICojMhAAFIUQFRmRCAACSnj/PXtwiILSF3NgACEP1Ajop5uDl77a4Rf800QACiPyBLxYBsfh2QHWJC+hsAAQgBUZkQgACkuIAoTAhAAJILyBdyBURfQgACkDw+5JPPlwQky94nJqSvDhCAaAayRwzDrdmlu0n8lVMAAUh6ATksANmiKyEAAUihAdGWEIAApNCAaEsIQADSGshvthEQW0KeBAhAlPo4K558XvRXFiCfFxPSOwcQgOgEsltMwu2ZbbeIv34UIABJKSCHrECOKEoIQABSdEBUJQQgAGnh47/bDYg1IS8ABCD6gOwSc/C2rNneKv4zIwABiDofpy8TA3KwKZAnxIT01AACkDQCsiFrvtu0JAQgACk+IIoSAhCAlBAQPQkBCECa+Ti1sIBYEzILEIBoArJT9LExa70NYkKGAQIQTQER3+VX5vCRHRQT0j0LEIAQED0JAQhASgmIloQABCB2IB/oICBZ9m5RyAMAAYgSHyc7CYj1ok4VIADRAWSNGJBNuYFsFBMyBBCAEBAtCQEIQMoKiIqEAAQgpQVEQ0IAAhALkO/tOCC2hAwCBCDR+zje9ORzZwmZAQhAYgeyWgzI9jaBbIo9IQABSIkBiT8hAAFIiQGJPyEAAYjk48sFBcSWkBMAAUjEPi6sEgPy8wsAcq+YkAGAACRiIMfEx/612UJ2lfh7VQACEG0B2bogINuiTghAAFJuQCJPCEAAUm5ArAlpAAQgcQI5Kj7y35JlhSZkGiAAidLH+aU5Tz7n3Q4xIf0NgABET0Buzha+a+JNCEAAUnZAok4IQABSekBiTghAAPJ6H+feVHhAbAlZWQcIQGIDsqetk895J5+GngIIQGILyBViQA53CGSLmJC+OkAAQkBiTghAAOIgIPEmBCAAeS2Qj5YUEFtCngYIQCLycVY++fzXBQD5afk09BxAABIPkN3iY/72rIjdIv7eowABSOwBOVQIkCNRJgQgAHETkEgTAhCAuAlIpAkBCEAuAvnVUgNiS8hDAAFIFD5Oyyef/7wwIJbT0DWAACQGILvEB/yGrLjdJn6EEYAAJN6AHCwQSIQJAQhAnAUkxoQABCCv+PjP8gNiTcgZgAAkdCA7RR8/mhW7t4kJGQYIQAL3caqAg2s5dlBMSPcsQAASY0A2Fg0k2xBZQgACEIcBiS8hAAGIy4BElxCAAKSgk8+dJaQKEICEC2RNASefOzsNPQQQgBCQJkfZqgABCAGJLiEAAYjjgMSVEIAAZP7tTgNiS8h9AAFIkD6OF3byubOEzAAEICECWS0GZHuJQDaJCRkECEAISGQJAUjyQNwHJKaEACRxIF4CElFCAJI2ENvJ5+0lA/kJ+TQ0QAASGJBj4qP82qzsyaehKwABSAwB2Vo6kG2RJAQgaQPxFZBoEgKQlIH4C0g0CQFI0kD+yVtAbAl5FiAACcbH+aViQLY4AfJ+MSH9DYAAJBQgR8WH+M2Zm10jfvRpgAAk7IBsdgRkRwwJAUjCQPwGJI6EACRZIPP/5zcgcSQEIOkC2SM+wL8zc7dvFz+DKYAAJAAf564QA3LYIZAtYkL66gABSKgBuTVzuZuCTwhAEgUSQkBiSAhAUgUSQkAiSAhA0gQyf/bbAgiILSHXzQEEIH6B7C755HNnp6FHAQIQvwFZLAbkkHMgR8SE9M4BBCAEJIKEACRFIOEEJPiEACRJIL8eTEBsCXkYIADx5uO0fPL5L70A+Zx8GroGEID4ArJLfGhvyPzsNvGzGQEIQMIKyEFPQJ4IOSEASRBIWAEJOyEASQ5IaAEJOyEASQ/Ir4g+3pNlgSVkGCAA8eDjlOODaws/DT0LEIC4B7JTDMhGn0CyDcEmBCCJAQkxICEnBCCpAQkxIAEnBCBpAZn/9xADYk3I8wABiFsga8SA/LhvINmPiEKGAAIQpz5OhhkQ61G2KkAA4j8gmwIAsjHMhAAkJSABByTUhAAkKSDhBiTUhAAkISCeTj53lpAZgADEFZDVXk4+590mMSGDAAEIAQk2IQBJCEjYAQkzIQBJBkjwAQkyIQBJBcj8he8OPCC2hNwFEIA4AHLM48nnvJNPQ1cAApDyA7JKDMjWoIBsExMyABCAEJAwEwKQNIDEEZAAEwKQRIDEERBbQr4KEICU6uO8fPL5fcEB+bnATkMDJA0gR8UH881ZeLtG/EynAQIQ9wHZHCCQHWElBCBJAIknIKElBCAJAIkpIKElBCApAPmHiAJiS8gXAQKQknycu0IMyN8ECuRnxIT01QECkHKA7BEfybdmoe4m8fOdAghAXAbkcLBAtgSUEIDoBxJbQIJKCEC0A5n/39gCYk3IiwABSPFAdouP4+/KQt53iJ/zKEAAUriPs4vFgBwKGsgRMSG9cwABiJuA3J6FvVtCSQhAdAOJMyABJQQgyoHEGZBwEgIQ1UBsJ58PBQ9ETsjlNYAApEggu8QH8YYs/MmnoUcAApDyA3IwAiBPiAnpqQEEIAQknIQARDGQmAMSSkIAohnIh0Uf78myiBPyEYAApCAfpwI+uJZjfyGfhp4FCECKAbJTDMjGWIBkG0TgwwABCAF5eQcDSAhA9AKJPSBBJAQgWoHEH5AgEgIQtUDWRB+QLPth76ehAaIUyPzJ+AOS2Y6yVQECkHICsikyIBt9JwQgOoEoCYj/hABEKRAdAfGfEICoBDL/L0oCYkvIcwABSCdAVosBuTdCIO8VEzIIEIB04OO4+Ni9OsvUJGQGIAApOiDbowSyyWtCAKIQiKqAeE4IQPQBmb+gKSCeEwIQhUBiOfmcd/Jp6ApAALKwgKwSA7I1WiDbxIQMAAQgBMR3QgCiDYi+gHhNCEDUAdEXEJ8JAYgyIPPnr1cXEFtC7mgABCDtAjka1cnnvJNPQ08DBCDtBmSpGJDNkQPZISakvwEQgBAQnwkBiCogWgPiLyEA0QXkC0oDYkvIlwACkDZ8nJNPPv+tAiA/K5+GrgMEIPmB7BEfs7dmGnaT+LVNAQQgnQbksAogW7wkBCCagGgOiKeEAEQPEN0B8ZQQgCgC8huqA2JLyChAAJLLx9nFkZ58zrvPiwnpnQMIQPIA2S0+YG/P9OwW9wkBiBYg+gOSZUfcJwQgaoDoD4iPhABECZD5r+sPiDUhLwAEIK2A7BIfrj+U6dpbxa9yBCAAaeHj9GViQA4qA/KEmJCeGkAAspCAbMi07TbHCQGICiCpBMR9QgCiA0gqAXGeEIBoAGI5+awwILaElHYaGiAqgOxUcPI57zaID4NhgACkzYBcqdJHdtBpQgCiAUhKAXGcEIDEDyStgDhOCEAUAPlAUgHJsneLQj4EEICIPk6mFZDMdpStChCASEDWiAHZpBjIRjEhQwABCAFxnBCARA8kvYC4TAhAIgeSZEBsCfkaQADyRiDyyeefVA5ko6vT0ACJG8j8cfFRenWWJZmQGYAAJE9AtqsHsslRQgASNZBkA+IsIQCJG0iqAXGWEIDEDGT+n5MNiC0hJwACkIs+LqwSA/L+JIDcKyZkACAAuQjkmPgQvTZLY1eJX30FIABpHpCtiQDZ5iIhAIkYSNoBcZMQgEQLZP582gGxJqQBEIC8DOSo+AB9S5bO5NPQ0wAByMsBWSoGZHNCQHaICelvAAQgtoDcnGUkxAmQ2mihWxkBkJXFfslnCEj8CWlSkIGukhcckGJXaOkJiKeENAFSAUhHmy7Vx7k3ERBrQt5cd/K/Qe4GSAe7s9yA7FF+8jnv5NPQU06AzACkg1XKDcgVYkAOJwdki5iQvroLINKfPAEk5wYMAdGQkKZAZgBCQBJPSJfxlxDNQEoOyEcJSIuEPOUEyAxAggzIWfnk8+eSBPJ38mnoOSf/T/oHAbKg3V1uQHaLH/T2LM3dIr4ao06AVAGyoM34CMihRIEcKTMhrb4XawggC9ggAdGSkFZAqgAhICknpOV38w4BJLSA7CIguRLykBMgVYAEFpDTl4kBOZgwEPk0dE/Nyd8HGQZImxvyEZANWcq7TXxNRpwAme0GSHurEhA9CcnxNwqHAUJAkk1IDiClJUQpkHID8h9iQLp+6Rc6nN+/SLK5w8/+F39MfFV6zrgAUlpCdAIpOSA7S/q0/Z6kurKkr2rYCZAzPeIH/8E/7XATXoFMdPrp/7L4qnQ/X6qPU10AaWPdsy6AmBHxg697LO2tL+mZ5SUgSoF0/q8jF5CamJAlB5L2sX9JOY8sPwHRCqTjfx/5fi4WCdEeEK1AOv4Xkg8ICQkjICe7AOL4DxVz/mTFh8SPvTZhIOt8BGQNQFz/qWJOIHO9YkLGk/VxYElp3/3jJSB6gXSYkLw/m3eUhOQIyEi0AVEMZMgJEBKiOyCKgXSWkNw/3Z2EeA/I9wNkQfugEyCWhPxxkj4+6SMgx7sA4v7v5+S/D/KU+LFXJAlkrfhaPFxuQFYDxMPf8MwPpN4nJmQiQR/jYkCK+klMXgKiGkgnCWnjwtQUCWkakNGYA6IbyKATICREcUB0A+kgIe3cKCQh3gIyf+F7ANLB7nYCpP5mMSGTifmYEANyXbkBOdYFkE5WcQHETIsfe3liQFaIr8JUuQFZBZCONuAESKOfhFgCUtxJIxHI1ws9v7vn+giAFHxyuOYCCAnxExAX39QVHJBAjta3B4SEeAkIQGIBQkIeuzH+gACkPCCNATEhY8n4mBQD0l8HCEC+sYr4AF2WDJDl4tc/bQACkFeWdkIsAWkABCAkREtAAFImEEtCHk3Cx2dUBAQgpQI5IT5Eb0gCyDLxa3/WAAQg39qgmJB9CfgYW1LodzEARCeQmWQTsqzY74MDiE4gySZES0AAUjKQVBOiJSAAKRmIJSF7lfv4hJaAAKRsIF9LMiE3FP4jZQCiFIgZSjAh+5YU/RNlAKIWSDXBhOgJCEBKB5JgQhQFBCDlA0kvIYoCApDygZgPiQm5R62PvWJA7jMAAYi42W5RyP60AlIFCEAsGxbfMeuTCsiQAQhASIi2gADEBZCkEqIrIABxAsSSEI2noeWTz9EGBCBOgJgR8V2zTiGQ9eJXOmwAApAmq/UkkhA5IN2zAAEICVEYEIA4ApJIQtQFBCCOgFgS8k5lQH5AW0AA4grIC/Jp6HFVPg7IJ5/PAAQgLTcqPlzXqgKyTvwaRwxAANJyc/oTYglIDSAAISE6AwIQd0AsCXmcgAAEIPaE6DkNLZ98fsgABCC5Vu8TEzKhxMe4GJDeOYAAJOemVCdEDsioAQhASIjWgADEJRDVCdEZEIA4BWJJyJ8o8PFpnQEBiFMg5ktqT0OvEL+ypw1AANLGGv1iQiaj9zEhBqSvDhCAtLVppQmRAzJlAAIQEqI4IABxDERpQtQGBCCugTTuEBMyFrWPSTEgK+sAAUjbq4gP22VRA1kufk3TBiAAaX8D6hIiB6S/ARCAkBDdAQGIeyDqEqI5IADxAERbQjQHBCAegFhOQ++L1MeYfPK5ARCALHAzqo6yLRO/mooBCEBIiDUgBiAAISHqAwIQL0AsCXkkQh+P6g4IQPwAeU5NQuSDaycAApCONiQmZG90PvaJARk0AAFIR6sqSYgckBmAAISEpBAQgPgCoiMh6gMCEF9ALAn5WFQ+9qoPCEC8AbGcht4ff0CqAAFIARsW313row/IkAEIQEhIGgEBiD8g0SckhYAAxCMQS0L+gIAABCAv7yPiO2xdJD7uEQPygAEIQAparUdMyIEofOwXfXTPAgQghW0k4oSsFz/3YQMQgJCQZAICEK9AIk5IIgEBiF8gtcvFhIwH7+NAIgEBiF8gltPQa4MHsk78vEcMQABS6OZ6o0yIHJCeGkAAQkJSCghAfAOJMiHpBAQgvoFYEvKOoIG8M5mAAMQ7kBfl09ATAfsYl08+vwAQgJSwKfFxvCJgIGvFz3jUAAQgJaweW0IsAZkDCEBISGIBAUgAQCwJ+VSgPh5PKSAACQCI+WJUp6Hlk89PGoAApKQ1+sWETAbpY0IMSF8dIAAp7XeejighckCmDEAAYkhIagEBSBBAIkpIYgEBSBhALAn5w+B8fDaxgAAkDCDmq5GchlZ98hkg4QIxA2JCxgLzMSkGpL8BEICUDKQSRUKSCwhAQgESRULSCwhAggESQ0LSCwhAggFi7hITsi8gH2NiQO5oAAQgDoDMBH+UbZn4GVYMQADiAIgZDDwhckAGDEAA4gRI6AlJMSAACQhI4AlJMiAACQlI2AlJMiAACQmI5TT03iB87NN/8hkgoQOpBpwQ+eDaDEAA4g5IwAlJNCAACQtIuAlJNCAACQuIJSEf9+7jkUQDApDAgDwvn4beH2ZAngMIQNwCMcPiO3G9Zx97xYAMGYAAxDGQ2SATIgekChCAuAYSZELSDQhAggMSYkLSDQhAggNiSYjP09D3iAG53wAEIB6A1HrEhBzw5mN/KiefARIFEDMSWELWi5/PsAEIQLwACSwhSQcEIAECCSwhSQcEICECsSTkk158/H7SAQFIiEDMw+JDe60XIOvEz+VBAxCAeAMy1ysmZNyDjwNiQHpqAAGIPyBmNJiEyAEZMQABiEcgwSQk9YAAJEwgwSQk9YAAJFAgc9eJCZlw7GNcDMjlNYAAxC8QMyU+ulc4BrJW/CxGDUAA4hlIvS+AhMgB6Z0DCEB8AwkiIQQEIMECCSAhBAQg4QKxJORGh0DeQUAAEi4Qy2noSWc+JuSTzy8CBCAhADHT4gN8uTMgK8SPP2UAApAggHhOiCUgdYAAJAwgnhNCQAASOBBLQj7jxMenCAhAAgdinvV4Glo++fyMAQhAggFiBsSEjDnwMSkGpL8BEIAEBKTiLSFyQKYNQAASEBBvCSEgAIkCiK+EEBCARAHEkpBPlOxjjIAAJA4gfk5Dp3nyGSARAjGDYkL2eQjIgAEIQIID4iMhBAQg0QDxkBACApCIgLhPCAEBSERAzH1iQvaW5mOfGJC7DEAAEiSQquOEyAfXZgACkDCBmCGnCZEDMmgAApBAgbhNCAEBSGRAnCaEgAAkOiBVh6ehCQhAogNiOQ29vgQfe8WADBmAACRgILPOEiIHpAoQgIQMxFlCCAhAogTiKiEEBCBRArEk5F0F+/g4AQFInEDOyKehDxTqY7988vm/AAKQ0IGYETEh6woFsl78GMMGIAAJHkit/IRYAjILEICED8RBQggIQCIGUnpCfo+AACRiIOahkk9Dyyeff80ABCBRAJnrFRMyXpCPA2JAemoAAUgcQMxoqQmRAzJiAAKQSICUmhACApDYgZSaEAICkOiBWBLy6QJ8/C4BAUj0QMzT4mN+RQFA1oq/88MGIACJCEi9T0zIRMc+xsWA9M4BBCAxATFTJSVEDsioAQhAogJSUkIICEB0ACkpIQQEIEqA1FeKCZnsyMeEGJDrCAhAogNipsWH/fKOgKwQf88peAAkPiCN/sITIgekrw4PgMQHpISEEBCAKAJSeEIICEA0AbEkZOGnoW8kIADRBKQhn4YeW6CPSU4+A0QVEFMpNCHLxd9tGhsAiRWIKTIhBAQg6oAUmRACAhB1QCwJeXQBPv6IgABEH5AThR1lk08+fwUZAIkZiBkUE7KvbR9jYkAGgAGQuIHMFJQQOSAVYAAkbiAFJYSAAEQpkGISQkAAohSIJSHtnYaWTz5/HywAEj+QagEJ4eQzQNQCMUMdJ0QOyCAqAKIBSOcJISAAUQyk44QQEICoBtJpQggIQFQDMQ+ICbknp4+9YkDuwwRAtACZ7RaF7O8kIFVMAEQLEDMsvsfXdxCQIUgARA+QThJCQACiHkgHCSEgAEkAyOxCT0Pvl08+ExCAqAJiRsSErGsJZL34zw0DAiC6gNQWlhBLQGYBARBdQBaYEAICkESALCghBAQgqQCxJOSdTYG8i4AAJBUgL8inoceb+Dggn3z+HzgARB8QMyrmYG0TIOvEf2IEDQDRCGSu3YRYAlJDA0A0Amk7IQQEIEkBsSTkcYuP3yEgAEkKiHmyrdPQ8snn38ICQLQCqfeJCZkQfYyLAenl5DNA1AIxU20kRA7IKBQAohdIGwkhIABJD0gbCSEgAEkQiCUhn8158pmAAEQ3EMtp6OWXAFkh/rqngQAQ3UAa/WJCJnMFpK8OBIDoBpIzIXJApnAAEO1AciWEgAAkVSC5EkJAAJIskMadYkLGXuNjUgzISgICkASAmIqYh2WvAbJc/BXTKABICkDMQIuEyAHpb6AAIEkAaZUQAgKQpIG0SAgBAUjiQCpNL+osIyAASRuI5TT0vm/4GBMDMgABgKQDZKZJQuSAVCAAkHSANEkIAQEIQJokhIAABCC2hDzy2G8TEIAAxJjnxFAs+TPRR9e/AQAgaQExQ135N8j7HyCpAam2AWSG9z9AUgPSRkIICEASBFIlIAABSJPdT0AAAhD7ZrvzAeHkM0CSBGKGc/kY4s0PkDSB5EsIAQFIokByJYSAACRZIHkSQkAAkiwQ82BLHw/w1gdIukBqPS18dM/y1gdIukDMSAsgw7zzAZIykBYJISAASRtIi4QQEIAkDqR2eRMfPQQEIIkDMaNNgIzwvgdI6kDmeu0BqfG+B0jqQJokhIAABCD2hBAQgACkSUIICEAA8tJeFE9Dc/IZIAB5ZVMikFHe9AAByMur9xEQgACkvYQQEIAAxJ4QAgIQgFzcM5e8lE/xlgcIQL65Rv8bXsk+Tj4DBCDf2vQbXskp3vEAAYg1IQQEIABpkhACUgiQRVf63CKAlJWQlQSkECDBDSDFJISTzwAByBsTcufFl7G/wfsdIAB5wyoEBCAAabIBAgIQgLROyFd4twMEINaEcPIZIABpkpAKb3aAAMSaEAICEIBYdoKAAAQgTTbYdRdvdYAAxLYZTj4DBCBNxl+0BQhAGEAAwgACEAYQgDCAAIQBBCAMIAABCGMAYQwgjAGEMYAwBhDGAMIYQBgDCGMAYYwBhDGAMAYQxgDCGEAYAwhjAGEMIIwBhDGA8BIwBhDGAMIYQBgDCGMAYQwgjAGEMYAwBhDGGEAYAwhjAGEMIIwBhDGAMAYQxgDCGEAYAwhjDCCMAYQxgDAGEMYAwhhAGAMIYwBhDCCMMYAwBhDGAMIYQBgDCGMAYQwgjAGEMYAwBhDGGEAYAwhjAGEMIIwBhDGAMAYQxgDCGEAYYwBhDCCMAYQxgDAGEMYAwhhAGAMIYwBhDCCMMYAwBhDGAMIYQBgDCGMAYQwgjAGEMYAwxgDCGEAYAwhjAGEMIIwBhDGAMAYQxgDCGEAYYwBhDCCMAYQxgDAGEMaC3P8DyOC3M08QuDcAAAAASUVORK5CYII=";e._display_image={1:i,"-1":i};var n={},t=s.Vw.majority([1]);e.setButtonImage(e._display_image[t]),e.dataparams=[Q,E];var h=new k.Layout(e.button_subwindow);h.setRect("Title",new k.Pos(0,0),new k.Pos(100,10),new k.RU_DataViewText);var D=new k.RU_DataViewBarGraph({type:"bar",yAxes:[{type:"linear",display:!0,position:"left",id:"axis-1"}]}).setDataAnalysisFunction((function(A){var C=[],I=[],E=[];null!=A&&(C=A.data.map((function(A){return A.data.write_stall})),I=A.data.map((function(A){return A.data.load_ins})),E=A.data.map((function(A){return A.data.store_ins})));var g=k.RU_DataViewBarGraph.colorList().slice(0,C.length+1),e=[],i=Q.repcount;if(all_analyses_global){var n=C.length/i;C=s.tV.createChunks(C,n,s.Vw.sumArray),I=s.tV.createChunks(I,n,s.Vw.sumArray),E=s.tV.createChunks(E,n,s.Vw.sumArray)}return e.push({label:"Cycles stalled on writes",yAxisID:"axis-1",data:C[0],backgroundColor:g[0]}),e.push({label:"Load ins",yAxisID:"axis-1",data:I[0],backgroundColor:g[1]}),e.push({label:"Store ins",yAxisID:"axis-1",data:E[0],backgroundColor:g[2]}),{labels:(0,B.Z)(Array(C[0].length).keys()),datasets:e}})).linkMouse(h._layout_clickable).changeGraphOptions((function(A){A.options.title.text="Memory operations per thread",A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).scaleLabel={labelString:"Operations",display:!0},A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).ticks.beginAtZero=!0,A.options.scales.xAxes=[{scaleLabel:{labelString:"Thread",display:!0}}]}));return h.setRect("Graph",new k.Pos(0,10),new k.Pos(70,50),D),n.Title=new k.DataBlock({fontsize:32,text:"Memory operations",color:"black",align:"center"},"Text"),n.Graph=Q,h.setDataBinding(n),e.button_subwindow.setLayout(h),e.setOnEnterHover((function(A){e.color="#FF0000",e.button_subwindow_state="open"})),e.setOnLeaveHover((function(A){e.color="orange",e.is_locked_open||(e.button_subwindow_state="collapsed")})),e.setOnClick((function(A,C){e.is_locked_open=!e.is_locked_open})),e.setDefaultDblClick(),e}return I}(k.Button),o=function(){function A(C,I,Q,E){(0,g.Z)(this,A),this.section=C,this.critical_path_analysis=E,this.for_node=I,this.for_state=Q,this.analysis_result=null,65535!=Q&&65535!=Q&&s.tV.assert("for_node defined",null!=this.for_node&&NaN!=new Number(this.for_node))}return(0,E.Z)(A,[{key:"judgement",value:function(){var A=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null;return null==A&&(A=this.analysis_result),-1}},{key:"analyze",value:function(){s.tV.assert("Not available over old interface",!1)}}]),A}(),S=function(A){(0,e.Z)(B,A);var C,I=D(B);function B(A,C,Q,E,e){var i;return(0,g.Z)(this,B),(i=I.call(this,C,Q,E,e,null)).communicator=A,i}return(0,E.Z)(B,[{key:"analyze",value:(C=(0,Q.Z)(h().mark((function A(){var C,I,Q,E;return h().wrap((function(A){for(;;)switch(A.prev=A.next){case 0:return C=this.section.toSection(this.for_node,this.for_state),A.next=3,C;case 3:if(void 0!==(C=A.sent)){A.next=6;break}return A.abrupt("return",void 0);case 6:return A.next=8,this.communicator.runAnalysis("MemoryOpAnalysis",[new Number(C.unified_id),new Number(C.supersection_id)]).get();case 8:return I=A.sent,Q=I,E=new k.DataBlock(Q,"MemoryOp"),this.analysis_result=E,E.judgement=this.judgement(),A.abrupt("return",E);case 14:case"end":return A.stop()}}),A,this)}))),function(){return C.apply(this,arguments)})}]),B}(o);function w(A,C,I,Q,E){return C instanceof LazySuperSection?new S(A,C,I,Q):(s.tV.assert("Do not use",!1),new o(C,I,Q,E))}}}]);
-//# sourceMappingURL=306.js.map
\ No newline at end of file
diff --git a/dist/306.js.map b/dist/306.js.map
deleted file mode 100755
index e66bcfc3..00000000
--- a/dist/306.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack://@spcl/sdfv/./renderer_dir/memop_button.js"],"names":["MemoryOpButton","ctx","supersection_all_vec_analyses","path_analysis","baseimgstr","_display_image","databinding","majority","MathHelper","setButtonImage","dataparams","layout","Layout","button_subwindow","setRect","Pos","RU_DataViewText","thread_graph","RU_DataViewBarGraph","type","yAxes","display","position","id","setDataAnalysisFunction","x","write_stall","load_ins","store_ins","data","map","colors","slice","length","datasets","repcount","all_analyses_global","chunksize","ObjectHelper","push","label","yAxisID","backgroundColor","labels","Array","keys","linkMouse","_layout_clickable","changeGraphOptions","options","title","text","scales","find","scaleLabel","labelString","ticks","beginAtZero","xAxes","DataBlock","fontsize","color","align","setDataBinding","setLayout","setOnEnterHover","p","button_subwindow_state","setOnLeaveHover","is_locked_open","setOnClick","mb","setDefaultDblClick","Button","SuperSectionMemoryOpAnalysis","section","nodeid","stateid","critical_path_analysis","this","for_node","for_state","analysis_result","undefined","NaN","Number","analysis","LazySuperSectionMemoryOpAnalysis","communicator","toSection","runAnalysis","unified_id","supersection_id","get","tmp","ret","judgement","AutoSuperSectionMemoryOpAnalysis","LazySuperSection"],"mappings":"+tBAKMA,E,oCACF,WAAYC,EAAKC,EAA+BC,GAAe,uBAC3D,cAAMF,IAEDC,8BAAgCA,EAErC,IAAME,EAAa,65WACnB,EAAKC,eAAiB,CAClB,EAAKD,EACL,KAAMA,GAGV,IAAIE,EAAc,GAKdC,EAAWC,cADE,CAAC,IAElB,EAAKC,eAAe,EAAKJ,eAAeE,IAExC,EAAKG,WAAa,CAACR,EAA+BC,GAElD,IAAIQ,EAAS,IAAIC,SAAO,EAAKC,kBAC7BF,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,GAAI,IAAIA,MAAI,IAAK,IAAK,IAAIC,mBAG7D,IAAIC,EAAe,IAAIC,sBAAoB,CACvCC,KAAM,MACNC,MAAO,CAAC,CACJD,KAAM,SACNE,SAAS,EACTC,SAAU,OACVC,GAAI,aAGTC,yBAAwB,SAAAC,GAEvB,IAAIC,EAAc,GACdC,EAAW,GACXC,EAAY,GACP,MAALH,IACAC,EAAcD,EAAEI,KAAKC,KAAI,SAAAL,GAAC,OAAIA,EAAEI,KAAKH,eACrCC,EAAWF,EAAEI,KAAKC,KAAI,SAAAL,GAAC,OAAIA,EAAEI,KAAKF,YAClCC,EAAYH,EAAEI,KAAKC,KAAI,SAAAL,GAAC,OAAIA,EAAEI,KAAKD,cAIvC,IAAIG,EAASb,kCAAgCc,MAAM,EAAGN,EAAYO,OAAS,GAEvEC,EAAW,GAGXC,EAAWjC,EAA8BiC,SAC7C,GAAGC,oBAAqB,CAEpB,IAAIC,EAAYX,EAAYO,OAASE,EAErCT,EAAcY,kBAA0BZ,EAAaW,EAAW7B,eAChEmB,EAAWW,kBAA0BX,EAAUU,EAAW7B,eAC1DoB,EAAYU,kBAA0BV,EAAWS,EAAW7B,eAchE,OATA0B,EAASK,KAAK,CAAEC,MAAO,2BAA4BC,QAAS,SAAUZ,KAAMH,EAAY,GAAIgB,gBAAiBX,EAAO,KACpHG,EAASK,KAAK,CAAEC,MAAO,WAAYC,QAAS,SAAUZ,KAAMF,EAAS,GAAIe,gBAAiBX,EAAO,KACjGG,EAASK,KAAK,CAAEC,MAAO,YAAaC,QAAS,SAAUZ,KAAMD,EAAU,GAAIc,gBAAiBX,EAAO,KAEnF,CACZY,QAAQ,OAAIC,MAAMlB,EAAY,GAAGO,QAAQY,QACzC,SAAYX,MAIjBY,UAAUnC,EAAOoC,mBAAmBC,oBAAmB,SAAAvB,GACtDA,EAAEwB,QAAQC,MAAMC,KAAO,+BACvB1B,EAAEwB,QAAQG,OAAOhC,MAAMiC,MAAK,SAAA5B,GAAC,MAAY,UAARA,EAAEF,MAAgB+B,WAAa,CAAEC,YAAa,aAAclC,SAAS,GACtGI,EAAEwB,QAAQG,OAAOhC,MAAMiC,MAAK,SAAA5B,GAAC,MAAY,UAARA,EAAEF,MAAgBiC,MAAMC,aAAc,EACvEhC,EAAEwB,QAAQG,OAAOM,MAAQ,CAAC,CAAEJ,WAAY,CAAEC,YAAa,SAAUlC,SAAS,QA7EnB,OAgF3DV,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,IAAK,IAAIA,MAAI,GAAI,IAAKE,GAIzDX,EAAW,MAAY,IAAIqD,YAAU,CAAEC,SAAU,GAAIT,KAAM,oBAAqBU,MAAO,QAASC,MAAO,UAAY,QACnHxD,EAAW,MAAYJ,EAEvBS,EAAOoD,eAAezD,GACtB,EAAKO,iBAAiBmD,UAAUrD,GAEhC,EAAKsD,iBAAgB,SAAAC,GAAO,EAAKL,MAAQ,UAAW,EAAKM,uBAAyB,UAClF,EAAKC,iBAAgB,SAAAF,GAAO,EAAKL,MAAQ,SAAe,EAAKQ,iBAAgB,EAAKF,uBAAyB,gBAC3G,EAAKG,YAAW,SAACJ,EAAGK,GAAS,EAAKF,gBAAkB,EAAKA,kBAEzD,EAAKG,qBA9FsD,E,UADtCC,UAsGvBC,E,WACF,WAAYC,EAASC,EAAQC,EAASC,IAAwB,eAC1DC,KAAKJ,QAAUA,EACfI,KAAKD,uBAAyBA,EAC9BC,KAAKC,SAAWJ,EAChBG,KAAKE,UAAYJ,EACjBE,KAAKG,gBAAkB,KAEP,OAAXL,GAAgC,OAAXA,GACtBvC,YAAoB,mBAAqC6C,MAAjBJ,KAAKC,UAAsDI,KAA7B,IAAIC,OAAON,KAAKC,W,wCAG9F,WAA2B,IAAjBM,EAAiB,uDAAN,KAIjB,OAHgB,MAAZA,IAAkBA,EAAWP,KAAKG,kBAG9B,I,qBAGZ,WACI5C,YAAoB,oCAAoC,O,KAI1DiD,E,sCAEF,WAAYC,EAAcb,EAASC,EAAQC,EAASC,GAAwB,6BACxE,cAAMH,EAASC,EAAQC,EAASC,EAAwB,OACnDU,aAAeA,EAFoD,E,2DAK5E,iGAIQb,EAAUI,KAAKJ,QAAQc,UAAUV,KAAKC,SAAUD,KAAKE,WAJ7D,SAKoBN,EALpB,eAMmBQ,KADfR,EALJ,sDAOeQ,GAPf,uBASoBJ,KAAKS,aAAaE,YAAY,mBAAoB,CAAC,IAAIL,OAAOV,EAAQgB,YAAa,IAAIN,OAAOV,EAAQiB,mBAAmBC,MAT7I,cASQC,EATR,OAWQjE,EAAOiE,EAEPC,EAAM,IAAIpC,YAAU9B,EAAM,YAC9BkD,KAAKG,gBAAkBa,EACvBA,EAAIC,UAAYjB,KAAKiB,YAfzB,kBAgBWD,GAhBX,iD,kDAP2CrB,GA2B/C,SAASuB,EAAiCT,EAAcb,EAASC,EAAQC,EAASC,GAC9E,OAAGH,aAAmBuB,iBACX,IAAIX,EAAiCC,EAAcb,EAASC,EAAQC,IAG3EvC,YAAoB,cAAc,GAC3B,IAAIoC,EAA6BC,EAASC,EAAQC,EAASC","file":"306.js","sourcesContent":["// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport { Button, Layout, Pos, RU_DataViewText, RU_DataViewFormLayout, RU_DataViewNumberBlock, RU_DataViewBarGraph, DataBlock } from \"./renderer_util.js\";\nimport { MathHelper, ObjectHelper } from \"./datahelper.js\";\n\n\nclass MemoryOpButton extends Button {\n    constructor(ctx, supersection_all_vec_analyses, path_analysis) {\n        super(ctx);\n\n        this.supersection_all_vec_analyses = supersection_all_vec_analyses;\n\n        const baseimgstr = \"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAAAXNSR0IArs4c6QAAAARnQU1BAACxjwv8YQUAAAK1UExURQAAAAMDAwAEAAQEBAcHBwABCggICAsLCwwMDA8PDwAQAQIUBAMWBQUZCAYbCAkeCxAQEBMTExQUFBcXFxgYGBwcHB8fHwAFIgMJKQYMLwkQNg0UPAkgDAwjDg0kDw8pEQ8pEhItFRIuFRc1Ghg2Gxo6HRo7Hhw+ICAgICMjIyQkJCcnJygoKCsrKywsLC8vLzAwMDMzMzQ0NDc3Nzg4ODs7Ozw8PD8/Pw8XQxIbSRghVRokWx0nYh8qaB4sfTg9VCEtbR9DIx1MIh5NIx9PJAB/DiFGJSFTJiFUJyNbKThFOSVhLCViLCdnLidpLydqLyhtLyhvMCN/LSV9LyR/LiV+Lyd5MCd6MCd8MChxMClxMShzMCh2MCh3MSh5MDZ/Pjd+Pz9OQT9EXEBAQEdHR0hISExMTE9PT1BQUFNTU1RUVFhYWFtbW1xcXF9fX2BgYGNjY2RkZGhoaGtra2xsbG9vb3BwcHNzc3R0dHd3d3h4eHt7e3x8fH5+fn9/fx8ugiEwiCM0lCU3nic6qCc7rSg8sig9tik+uwAm/w8y9x895Ro67R076x486BI09hc38hQ19Bg48Cg/wCg/xCU/1yM/3SM/3yQ/2SE+4ydAyyhAyCdA0CZA0zZMxzZN1A+DHBKDHhWEIReEIxiDJBmDJRqDJh2DKB6DKR+CKiGBKyCCKyGBLCOALSOALjaEP4KCgoODg4aGhoeHh4qKiouLi46Ojo+Pj5OTk5aWlpeXl5ubm56enp+fn6KioqOjo6ampqenp6urq66urq+vr7a2tre3t7q6uru7u76+vr+/v8bGxsfHx8vLy87Ozs/Pz9LS0tPT09bW1tfX19ra2tvb297e3t/f3+Li4uPj4+bm5ufn5+rq6uvr6+7u7u/v7/Ly8vPz8/b29vf39/r6+vv7+/7+/v///xprvVsAAAAJcEhZcwAADsMAAA7DAcdvqGQAAAAYdEVYdFNvZnR3YXJlAHBhaW50Lm5ldCA0LjEuNWRHWFIAAB7SSURBVHja7d39f5X3XcfxlEDsvVnJWihrtZ3tINYSXS1jzIqbF4oTtQpM0OFN1hG7legssbqSjTKbEucNuplmU1GpE5k3tSuZHbHbOKLEjmOVDOVYYjmcfP8O27Vjbfl8z7lOznV9bz7f1/vHjZLk9Dyv12Ms5NNlGGPWdfESMAYQxgDCGEAYAwhjAGEMIIwBhDGAMAYQxhhAGAMIYwBhDCCMAYQxgDAGEMYAwhhAGAMIYwwgjAGEMYAwBhDGAMIYQBgDCGMAYQwgjDGAMAYQxgDCGEAYAwhjAGEMIIwBhDGAMAYQxhhAGAMIYwBhDCCMAYQxgDAGEMYAwhhAGGMAYQwgjAGEMYAwBhDGAMIYQBgDCGMAYQwgjDGAMAYQxgDCGEAYAwhjAGEMIIwBhDGAMMYAwhhAGAMIYwBhDCCMAYQxgDAGEMYAwhhAGGMAYQwgjAGEMYAwBhDGAMIYQBgDCGMAYQwgvASMAYQxgDAGEMYAwhhAGAMIYwBhDCCMAaS0DXaFv0HeDwwgAGEAAQgDCEAYQADCAAIQBhCAqN38KEAAwqw+TnbNAAQgzAbk7WpfO4AApHMfx1968U4ABCBMBrL6pRdvACAAYdaAdHVVAAIQZguI1oQABCCd+vjyqy9fBSAAYZf4uLDq1ZdvACAAYZcAOXbx9asABCDMFpCurjsbAAEIswWkq2saIABhr/Nx/vrXvID9DYAUCGTJDT63BCBFADn6uldwGiAFArnhMZ+7ASBFBGTp615BfQkBCECKC4jChAAEIMUFRGFCAAKQDoD84yWv4TMAAQh71ce5Ky55DfvqAAEIewXIHuHPyqcAAhBmC4i6hAAEIIUGRFtCAAKQQgPyUkJeBAhAmJnfbfmOnVGAAITNn11sAdI7BxCAAGS39Zs+RwECEAKy2ApEU0IAApCiA6IqIQAByIJ8nF7cBMjlNYAAJG0gu5r+1bMRgAAk7YBc1hRITw0gACEgCSQEIAApPiCKEgIQgCwAyIdb/gCMBwECkGR9nGr9E2K6ZwECkFSB7MzxM5SGAQIQAqI+IQABSCkB0ZIQgACklIBoSQhAANIukDU5f5Lr/QABSII+Tub+WcdVgACEgNg3BBCAEBDdCQEIQMoKiIqEAAQgbfn4V1HCor9fJP7nzwEEIGkBWS36+KnsvYt0niQCCEDa8XFcDMXVWZZdKf43MwABCAHZ/hKQTToTAhCAFBIQrQkBCEAKCYjWhAAEIPl9HGsSEFtCKgABSCI+LqwSA7L1VSDbxIQMAAQgSQfk2uybu0phQgACkIICojMhAAFIUQFRmRCAACSnj/PXtwiILSF3NgACEP1Ajop5uDl77a4Rf800QACiPyBLxYBsfh2QHWJC+hsAAQgBUZkQgACkuIAoTAhAAJILyBdyBURfQgACkDw+5JPPlwQky94nJqSvDhCAaAayRwzDrdmlu0n8lVMAAUh6ATksANmiKyEAAUihAdGWEIAApNCAaEsIQADSGshvthEQW0KeBAhAlPo4K558XvRXFiCfFxPSOwcQgOgEsltMwu2ZbbeIv34UIABJKSCHrECOKEoIQABSdEBUJQQgAGnh47/bDYg1IS8ABCD6gOwSc/C2rNneKv4zIwABiDofpy8TA3KwKZAnxIT01AACkDQCsiFrvtu0JAQgACk+IIoSAhCAlBAQPQkBCECa+Ti1sIBYEzILEIBoArJT9LExa70NYkKGAQIQTQER3+VX5vCRHRQT0j0LEIAQED0JAQhASgmIloQABCB2IB/oICBZ9m5RyAMAAYgSHyc7CYj1ok4VIADRAWSNGJBNuYFsFBMyBBCAEBAtCQEIQMoKiIqEAAQgpQVEQ0IAAhALkO/tOCC2hAwCBCDR+zje9ORzZwmZAQhAYgeyWgzI9jaBbIo9IQABSIkBiT8hAAFIiQGJPyEAAYjk48sFBcSWkBMAAUjEPi6sEgPy8wsAcq+YkAGAACRiIMfEx/612UJ2lfh7VQACEG0B2bogINuiTghAAFJuQCJPCEAAUm5ArAlpAAQgcQI5Kj7y35JlhSZkGiAAidLH+aU5Tz7n3Q4xIf0NgABET0Buzha+a+JNCEAAUnZAok4IQABSekBiTghAAPJ6H+feVHhAbAlZWQcIQGIDsqetk895J5+GngIIQGILyBViQA53CGSLmJC+OkAAQkBiTghAAOIgIPEmBCAAeS2Qj5YUEFtCngYIQCLycVY++fzXBQD5afk09BxAABIPkN3iY/72rIjdIv7eowABSOwBOVQIkCNRJgQgAHETkEgTAhCAuAlIpAkBCEAuAvnVUgNiS8hDAAFIFD5Oyyef/7wwIJbT0DWAACQGILvEB/yGrLjdJn6EEYAAJN6AHCwQSIQJAQhAnAUkxoQABCCv+PjP8gNiTcgZgAAkdCA7RR8/mhW7t4kJGQYIQAL3caqAg2s5dlBMSPcsQAASY0A2Fg0k2xBZQgACEIcBiS8hAAGIy4BElxCAAKSgk8+dJaQKEICEC2RNASefOzsNPQQQgBCQJkfZqgABCAGJLiEAAYjjgMSVEIAAZP7tTgNiS8h9AAFIkD6OF3byubOEzAAEICECWS0GZHuJQDaJCRkECEAISGQJAUjyQNwHJKaEACRxIF4CElFCAJI2ENvJ5+0lA/kJ+TQ0QAASGJBj4qP82qzsyaehKwABSAwB2Vo6kG2RJAQgaQPxFZBoEgKQlIH4C0g0CQFI0kD+yVtAbAl5FiAACcbH+aViQLY4AfJ+MSH9DYAAJBQgR8WH+M2Zm10jfvRpgAAk7IBsdgRkRwwJAUjCQPwGJI6EACRZIPP/5zcgcSQEIOkC2SM+wL8zc7dvFz+DKYAAJAAf564QA3LYIZAtYkL66gABSKgBuTVzuZuCTwhAEgUSQkBiSAhAUgUSQkAiSAhA0gQyf/bbAgiILSHXzQEEIH6B7C755HNnp6FHAQIQvwFZLAbkkHMgR8SE9M4BBCAEJIKEACRFIOEEJPiEACRJIL8eTEBsCXkYIADx5uO0fPL5L70A+Zx8GroGEID4ArJLfGhvyPzsNvGzGQEIQMIKyEFPQJ4IOSEASRBIWAEJOyEASQ5IaAEJOyEASQ/Ir4g+3pNlgSVkGCAA8eDjlOODaws/DT0LEIC4B7JTDMhGn0CyDcEmBCCJAQkxICEnBCCpAQkxIAEnBCBpAZn/9xADYk3I8wABiFsga8SA/LhvINmPiEKGAAIQpz5OhhkQ61G2KkAA4j8gmwIAsjHMhAAkJSABByTUhAAkKSDhBiTUhAAkISCeTj53lpAZgADEFZDVXk4+590mMSGDAAEIAQk2IQBJCEjYAQkzIQBJBkjwAQkyIQBJBcj8he8OPCC2hNwFEIA4AHLM48nnvJNPQ1cAApDyA7JKDMjWoIBsExMyABCAEJAwEwKQNIDEEZAAEwKQRIDEERBbQr4KEICU6uO8fPL5fcEB+bnATkMDJA0gR8UH881ZeLtG/EynAQIQ9wHZHCCQHWElBCBJAIknIKElBCAJAIkpIKElBCApAPmHiAJiS8gXAQKQknycu0IMyN8ECuRnxIT01QECkHKA7BEfybdmoe4m8fOdAghAXAbkcLBAtgSUEIDoBxJbQIJKCEC0A5n/39gCYk3IiwABSPFAdouP4+/KQt53iJ/zKEAAUriPs4vFgBwKGsgRMSG9cwABiJuA3J6FvVtCSQhAdAOJMyABJQQgyoHEGZBwEgIQ1UBsJ58PBQ9ETsjlNYAApEggu8QH8YYs/MmnoUcAApDyA3IwAiBPiAnpqQEEIAQknIQARDGQmAMSSkIAohnIh0Uf78myiBPyEYAApCAfpwI+uJZjfyGfhp4FCECKAbJTDMjGWIBkG0TgwwABCAF5eQcDSAhA9AKJPSBBJAQgWoHEH5AgEgIQtUDWRB+QLPth76ehAaIUyPzJ+AOS2Y6yVQECkHICsikyIBt9JwQgOoEoCYj/hABEKRAdAfGfEICoBDL/L0oCYkvIcwABSCdAVosBuTdCIO8VEzIIEIB04OO4+Ni9OsvUJGQGIAApOiDbowSyyWtCAKIQiKqAeE4IQPQBmb+gKSCeEwIQhUBiOfmcd/Jp6ApAALKwgKwSA7I1WiDbxIQMAAQgBMR3QgCiDYi+gHhNCEDUAdEXEJ8JAYgyIPPnr1cXEFtC7mgABCDtAjka1cnnvJNPQ08DBCDtBmSpGJDNkQPZISakvwEQgBAQnwkBiCogWgPiLyEA0QXkC0oDYkvIlwACkDZ8nJNPPv+tAiA/K5+GrgMEIPmB7BEfs7dmGnaT+LVNAQQgnQbksAogW7wkBCCagGgOiKeEAEQPEN0B8ZQQgCgC8huqA2JLyChAAJLLx9nFkZ58zrvPiwnpnQMIQPIA2S0+YG/P9OwW9wkBiBYg+gOSZUfcJwQgaoDoD4iPhABECZD5r+sPiDUhLwAEIK2A7BIfrj+U6dpbxa9yBCAAaeHj9GViQA4qA/KEmJCeGkAAspCAbMi07TbHCQGICiCpBMR9QgCiA0gqAXGeEIBoAGI5+awwILaElHYaGiAqgOxUcPI57zaID4NhgACkzYBcqdJHdtBpQgCiAUhKAXGcEIDEDyStgDhOCEAUAPlAUgHJsneLQj4EEICIPk6mFZDMdpStChCASEDWiAHZpBjIRjEhQwABCAFxnBCARA8kvYC4TAhAIgeSZEBsCfkaQADyRiDyyeefVA5ko6vT0ACJG8j8cfFRenWWJZmQGYAAJE9AtqsHsslRQgASNZBkA+IsIQCJG0iqAXGWEIDEDGT+n5MNiC0hJwACkIs+LqwSA/L+JIDcKyZkACAAuQjkmPgQvTZLY1eJX30FIABpHpCtiQDZ5iIhAIkYSNoBcZMQgEQLZP582gGxJqQBEIC8DOSo+AB9S5bO5NPQ0wAByMsBWSoGZHNCQHaICelvAAQgtoDcnGUkxAmQ2mihWxkBkJXFfslnCEj8CWlSkIGukhcckGJXaOkJiKeENAFSAUhHmy7Vx7k3ERBrQt5cd/K/Qe4GSAe7s9yA7FF+8jnv5NPQU06AzACkg1XKDcgVYkAOJwdki5iQvroLINKfPAEk5wYMAdGQkKZAZgBCQBJPSJfxlxDNQEoOyEcJSIuEPOUEyAxAggzIWfnk8+eSBPJ38mnoOSf/T/oHAbKg3V1uQHaLH/T2LM3dIr4ao06AVAGyoM34CMihRIEcKTMhrb4XawggC9ggAdGSkFZAqgAhICknpOV38w4BJLSA7CIguRLykBMgVYAEFpDTl4kBOZgwEPk0dE/Nyd8HGQZImxvyEZANWcq7TXxNRpwAme0GSHurEhA9CcnxNwqHAUJAkk1IDiClJUQpkHID8h9iQLp+6Rc6nN+/SLK5w8/+F39MfFV6zrgAUlpCdAIpOSA7S/q0/Z6kurKkr2rYCZAzPeIH/8E/7XATXoFMdPrp/7L4qnQ/X6qPU10AaWPdsy6AmBHxg697LO2tL+mZ5SUgSoF0/q8jF5CamJAlB5L2sX9JOY8sPwHRCqTjfx/5fi4WCdEeEK1AOv4Xkg8ICQkjICe7AOL4DxVz/mTFh8SPvTZhIOt8BGQNQFz/qWJOIHO9YkLGk/VxYElp3/3jJSB6gXSYkLw/m3eUhOQIyEi0AVEMZMgJEBKiOyCKgXSWkNw/3Z2EeA/I9wNkQfugEyCWhPxxkj4+6SMgx7sA4v7v5+S/D/KU+LFXJAlkrfhaPFxuQFYDxMPf8MwPpN4nJmQiQR/jYkCK+klMXgKiGkgnCWnjwtQUCWkakNGYA6IbyKATICREcUB0A+kgIe3cKCQh3gIyf+F7ANLB7nYCpP5mMSGTifmYEANyXbkBOdYFkE5WcQHETIsfe3liQFaIr8JUuQFZBZCONuAESKOfhFgCUtxJIxHI1ws9v7vn+giAFHxyuOYCCAnxExAX39QVHJBAjta3B4SEeAkIQGIBQkIeuzH+gACkPCCNATEhY8n4mBQD0l8HCEC+sYr4AF2WDJDl4tc/bQACkFeWdkIsAWkABCAkREtAAFImEEtCHk3Cx2dUBAQgpQI5IT5Eb0gCyDLxa3/WAAQg39qgmJB9CfgYW1LodzEARCeQmWQTsqzY74MDiE4gySZES0AAUjKQVBOiJSAAKRmIJSF7lfv4hJaAAKRsIF9LMiE3FP4jZQCiFIgZSjAh+5YU/RNlAKIWSDXBhOgJCEBKB5JgQhQFBCDlA0kvIYoCApDygZgPiQm5R62PvWJA7jMAAYi42W5RyP60AlIFCEAsGxbfMeuTCsiQAQhASIi2gADEBZCkEqIrIABxAsSSEI2noeWTz9EGBCBOgJgR8V2zTiGQ9eJXOmwAApAmq/UkkhA5IN2zAAEICVEYEIA4ApJIQtQFBCCOgFgS8k5lQH5AW0AA4grIC/Jp6HFVPg7IJ5/PAAQgLTcqPlzXqgKyTvwaRwxAANJyc/oTYglIDSAAISE6AwIQd0AsCXmcgAAEIPaE6DkNLZ98fsgABCC5Vu8TEzKhxMe4GJDeOYAAJOemVCdEDsioAQhASIjWgADEJRDVCdEZEIA4BWJJyJ8o8PFpnQEBiFMg5ktqT0OvEL+ypw1AANLGGv1iQiaj9zEhBqSvDhCAtLVppQmRAzJlAAIQEqI4IABxDERpQtQGBCCugTTuEBMyFrWPSTEgK+sAAUjbq4gP22VRA1kufk3TBiAAaX8D6hIiB6S/ARCAkBDdAQGIeyDqEqI5IADxAERbQjQHBCAegFhOQ++L1MeYfPK5ARCALHAzqo6yLRO/mooBCEBIiDUgBiAAISHqAwIQL0AsCXkkQh+P6g4IQPwAeU5NQuSDaycAApCONiQmZG90PvaJARk0AAFIR6sqSYgckBmAAISEpBAQgPgCoiMh6gMCEF9ALAn5WFQ+9qoPCEC8AbGcht4ff0CqAAFIARsW313row/IkAEIQEhIGgEBiD8g0SckhYAAxCMQS0L+gIAABCAv7yPiO2xdJD7uEQPygAEIQAparUdMyIEofOwXfXTPAgQghW0k4oSsFz/3YQMQgJCQZAICEK9AIk5IIgEBiF8gtcvFhIwH7+NAIgEBiF8gltPQa4MHsk78vEcMQABS6OZ6o0yIHJCeGkAAQkJSCghAfAOJMiHpBAQgvoFYEvKOoIG8M5mAAMQ7kBfl09ATAfsYl08+vwAQgJSwKfFxvCJgIGvFz3jUAAQgJaweW0IsAZkDCEBISGIBAUgAQCwJ+VSgPh5PKSAACQCI+WJUp6Hlk89PGoAApKQ1+sWETAbpY0IMSF8dIAAp7XeejighckCmDEAAYkhIagEBSBBAIkpIYgEBSBhALAn5w+B8fDaxgAAkDCDmq5GchlZ98hkg4QIxA2JCxgLzMSkGpL8BEICUDKQSRUKSCwhAQgESRULSCwhAggESQ0LSCwhAggFi7hITsi8gH2NiQO5oAAQgDoDMBH+UbZn4GVYMQADiAIgZDDwhckAGDEAA4gRI6AlJMSAACQhI4AlJMiAACQlI2AlJMiAACQmI5TT03iB87NN/8hkgoQOpBpwQ+eDaDEAA4g5IwAlJNCAACQtIuAlJNCAACQuIJSEf9+7jkUQDApDAgDwvn4beH2ZAngMIQNwCMcPiO3G9Zx97xYAMGYAAxDGQ2SATIgekChCAuAYSZELSDQhAggMSYkLSDQhAggNiSYjP09D3iAG53wAEIB6A1HrEhBzw5mN/KiefARIFEDMSWELWi5/PsAEIQLwACSwhSQcEIAECCSwhSQcEICECsSTkk158/H7SAQFIiEDMw+JDe60XIOvEz+VBAxCAeAMy1ysmZNyDjwNiQHpqAAGIPyBmNJiEyAEZMQABiEcgwSQk9YAAJEwgwSQk9YAAJFAgc9eJCZlw7GNcDMjlNYAAxC8QMyU+ulc4BrJW/CxGDUAA4hlIvS+AhMgB6Z0DCEB8AwkiIQQEIMECCSAhBAQg4QKxJORGh0DeQUAAEi4Qy2noSWc+JuSTzy8CBCAhADHT4gN8uTMgK8SPP2UAApAggHhOiCUgdYAAJAwgnhNCQAASOBBLQj7jxMenCAhAAgdinvV4Glo++fyMAQhAggFiBsSEjDnwMSkGpL8BEIAEBKTiLSFyQKYNQAASEBBvCSEgAIkCiK+EEBCARAHEkpBPlOxjjIAAJA4gfk5Dp3nyGSARAjGDYkL2eQjIgAEIQIID4iMhBAQg0QDxkBACApCIgLhPCAEBSERAzH1iQvaW5mOfGJC7DEAAEiSQquOEyAfXZgACkDCBmCGnCZEDMmgAApBAgbhNCAEBSGRAnCaEgAAkOiBVh6ehCQhAogNiOQ29vgQfe8WADBmAACRgILPOEiIHpAoQgIQMxFlCCAhAogTiKiEEBCBRArEk5F0F+/g4AQFInEDOyKehDxTqY7988vm/AAKQ0IGYETEh6woFsl78GMMGIAAJHkit/IRYAjILEICED8RBQggIQCIGUnpCfo+AACRiIOahkk9Dyyeff80ABCBRAJnrFRMyXpCPA2JAemoAAUgcQMxoqQmRAzJiAAKQSICUmhACApDYgZSaEAICkOiBWBLy6QJ8/C4BAUj0QMzT4mN+RQFA1oq/88MGIACJCEi9T0zIRMc+xsWA9M4BBCAxATFTJSVEDsioAQhAogJSUkIICEB0ACkpIQQEIEqA1FeKCZnsyMeEGJDrCAhAogNipsWH/fKOgKwQf88peAAkPiCN/sITIgekrw4PgMQHpISEEBCAKAJSeEIICEA0AbEkZOGnoW8kIADRBKQhn4YeW6CPSU4+A0QVEFMpNCHLxd9tGhsAiRWIKTIhBAQg6oAUmRACAhB1QCwJeXQBPv6IgABEH5AThR1lk08+fwUZAIkZiBkUE7KvbR9jYkAGgAGQuIHMFJQQOSAVYAAkbiAFJYSAAEQpkGISQkAAohSIJSHtnYaWTz5/HywAEj+QagEJ4eQzQNQCMUMdJ0QOyCAqAKIBSOcJISAAUQyk44QQEICoBtJpQggIQFQDMQ+ICbknp4+9YkDuwwRAtACZ7RaF7O8kIFVMAEQLEDMsvsfXdxCQIUgARA+QThJCQACiHkgHCSEgAEkAyOxCT0Pvl08+ExCAqAJiRsSErGsJZL34zw0DAiC6gNQWlhBLQGYBARBdQBaYEAICkESALCghBAQgqQCxJOSdTYG8i4AAJBUgL8inoceb+Dggn3z+HzgARB8QMyrmYG0TIOvEf2IEDQDRCGSu3YRYAlJDA0A0Amk7IQQEIEkBsSTkcYuP3yEgAEkKiHmyrdPQ8snn38ICQLQCqfeJCZkQfYyLAenl5DNA1AIxU20kRA7IKBQAohdIGwkhIABJD0gbCSEgAEkQiCUhn8158pmAAEQ3EMtp6OWXAFkh/rqngQAQ3UAa/WJCJnMFpK8OBIDoBpIzIXJApnAAEO1AciWEgAAkVSC5EkJAAJIskMadYkLGXuNjUgzISgICkASAmIqYh2WvAbJc/BXTKABICkDMQIuEyAHpb6AAIEkAaZUQAgKQpIG0SAgBAUjiQCpNL+osIyAASRuI5TT0vm/4GBMDMgABgKQDZKZJQuSAVCAAkHSANEkIAQEIQJokhIAABCC2hDzy2G8TEIAAxJjnxFAs+TPRR9e/AQAgaQExQ135N8j7HyCpAam2AWSG9z9AUgPSRkIICEASBFIlIAABSJPdT0AAAhD7ZrvzAeHkM0CSBGKGc/kY4s0PkDSB5EsIAQFIokByJYSAACRZIHkSQkAAkiwQ82BLHw/w1gdIukBqPS18dM/y1gdIukDMSAsgw7zzAZIykBYJISAASRtIi4QQEIAkDqR2eRMfPQQEIIkDMaNNgIzwvgdI6kDmeu0BqfG+B0jqQJokhIAABCD2hBAQgACkSUIICEAA8tJeFE9Dc/IZIAB5ZVMikFHe9AAByMur9xEQgACkvYQQEIAAxJ4QAgIQgFzcM5e8lE/xlgcIQL65Rv8bXsk+Tj4DBCDf2vQbXskp3vEAAYg1IQQEIABpkhACUgiQRVf63CKAlJWQlQSkECDBDSDFJISTzwAByBsTcufFl7G/wfsdIAB5wyoEBCAAabIBAgIQgLROyFd4twMEINaEcPIZIABpkpAKb3aAAMSaEAICEIBYdoKAAAQgTTbYdRdvdYAAxLYZTj4DBCBNxl+0BQhAGEAAwgACEAYQgDCAAIQBBCAMIAABCGMAYQwgjAGEMYAwBhDGAMIYQBgDCGMAYYwBhDGAMAYQxgDCGEAYAwhjAGEMIIwBhDGA8BIwBhDGAMIYQBgDCGMAYQwgjAGEMYAwBhDGGEAYAwhjAGEMIIwBhDGAMAYQxgDCGEAYAwhjDCCMAYQxgDAGEMYAwhhAGAMIYwBhDCCMMYAwBhDGAMIYQBgDCGMAYQwgjAGEMYAwBhDGGEAYAwhjAGEMIIwBhDGAMAYQxgDCGEAYYwBhDCCMAYQxgDAGEMYAwhhAGAMIYwBhDCCMMYAwBhDGAMIYQBgDCGMAYQwgjAGEMYAwxgDCGEAYAwhjAGEMIIwBhDGAMAYQxgDCGEAYYwBhDCCMAYQxgDAGEMaC3P8DyOC3M08QuDcAAAAASUVORK5CYII=\";\n        this._display_image = {\n            \"1\": baseimgstr,\n            \"-1\": baseimgstr\n        };\n\n        let databinding = {};\n\n        // This is not really easy to judge because of machine-dependent measures\n        // TODO: Find a way to create a judgement value\n        let judgements = [1];\n        let majority = MathHelper.majority(judgements);\n        this.setButtonImage(this._display_image[majority]);\n\n        this.dataparams = [supersection_all_vec_analyses, path_analysis]; // Fill in parameters\n\n        let layout = new Layout(this.button_subwindow);\n        layout.setRect(\"Title\", new Pos(0, 0), new Pos(100, 10), new RU_DataViewText());\n\n        \n        let thread_graph = new RU_DataViewBarGraph({\n            type: 'bar',\n            yAxes: [{\n                type: \"linear\",\n                display: true,\n                position: 'left',\n                id: 'axis-1'\n            }\n            ]\n        }).setDataAnalysisFunction(x => {\n            \n            let write_stall = [];\n            let load_ins = [];\n            let store_ins = [];\n            if (x != null) {\n                write_stall = x.data.map(x => x.data.write_stall);\n                load_ins = x.data.map(x => x.data.load_ins);\n                store_ins = x.data.map(x => x.data.store_ins);\n            }\n\n\n            let colors = RU_DataViewBarGraph.colorList().slice(0, write_stall.length + 1);\n\n            let datasets = [];\n            // So now we have a mapping of thread -> cycles.\n\n            let repcount = supersection_all_vec_analyses.repcount;\n            if(all_analyses_global) {\n                // We need to group and add\n                let chunksize = write_stall.length / repcount;\n\n                write_stall = ObjectHelper.createChunks(write_stall, chunksize, MathHelper.sumArray);\n                load_ins = ObjectHelper.createChunks(load_ins, chunksize, MathHelper.sumArray);\n                store_ins = ObjectHelper.createChunks(store_ins, chunksize, MathHelper.sumArray);\n            }\n\n\n            // All runs should be identical, so we take the first element from each set\n            datasets.push({ label: \"Cycles stalled on writes\", yAxisID: \"axis-1\", data: write_stall[0], backgroundColor: colors[0] });\n            datasets.push({ label: \"Load ins\", yAxisID: \"axis-1\", data: load_ins[0], backgroundColor: colors[1] });\n            datasets.push({ label: \"Store ins\", yAxisID: \"axis-1\", data: store_ins[0], backgroundColor: colors[2] });\n\n            let chartData = {\n                labels: [...Array(write_stall[0].length).keys()],\n                \"datasets\": datasets,\n\n            };\n            return chartData;\n        }).linkMouse(layout._layout_clickable).changeGraphOptions(x => {\n            x.options.title.text = \"Memory operations per thread\";\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').scaleLabel = { labelString: \"Operations\", display: true };\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').ticks.beginAtZero = true;\n            x.options.scales.xAxes = [{ scaleLabel: { labelString: \"Thread\", display: true } }];\n        });\n\n        layout.setRect(\"Graph\", new Pos(0, 10), new Pos(70, 50), thread_graph);\n\n        \n\n        databinding[\"Title\"] = new DataBlock({ fontsize: 32, text: \"Memory operations\", color: \"black\", align: \"center\" }, \"Text\");\n        databinding['Graph'] = supersection_all_vec_analyses;\n\n        layout.setDataBinding(databinding);\n        this.button_subwindow.setLayout(layout);\n\n        this.setOnEnterHover(p => { this.color = \"#FF0000\"; this.button_subwindow_state = 'open'; })\n        this.setOnLeaveHover(p => { this.color = \"orange\"; if (!this.is_locked_open) this.button_subwindow_state = 'collapsed'; })\n        this.setOnClick((p, mb) => { this.is_locked_open = !this.is_locked_open; });\n\n        this.setDefaultDblClick();\n    }\n\n\n\n}\n// Specialized version of the class in datahelper\nclass SuperSectionMemoryOpAnalysis {\n    constructor(section, nodeid, stateid, critical_path_analysis) {\n        this.section = section;\n        this.critical_path_analysis = critical_path_analysis;\n        this.for_node = nodeid;\n        this.for_state = stateid;\n        this.analysis_result = null;\n\n        if(!(stateid == 0xFFFF || stateid == 65535))\n            ObjectHelper.assert(\"for_node defined\", this.for_node != undefined && new Number(this.for_node) != NaN);\n    }\n\n    judgement(analysis = null) {\n        if (analysis == null) analysis = this.analysis_result;\n\n        // TODO: Find a good judgement variable\n        return -1;\n    }\n\n    analyze() {\n        ObjectHelper.assert(\"Not available over old interface\", false);\n    }\n}\n\nclass LazySuperSectionMemoryOpAnalysis extends SuperSectionMemoryOpAnalysis {\n\n    constructor(communicator, section, nodeid, stateid, critical_path_analysis) {\n        super(section, nodeid, stateid, critical_path_analysis, null);\n        this.communicator = communicator;\n    }\n\n    async analyze() {\n        // We differ from the eager analysis here: We let the python/sql-side do the hard work\n\n        // Project to a section from the supersection.\n        let section = this.section.toSection(this.for_node, this.for_state);\n        section = await section;\n        if(section === undefined) {\n            return undefined;\n        }\n        let tmp = await this.communicator.runAnalysis(\"MemoryOpAnalysis\", [new Number(section.unified_id), new Number(section.supersection_id)]).get();\n\n        let data = tmp;\n\n        let ret = new DataBlock(data, \"MemoryOp\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nfunction AutoSuperSectionMemoryOpAnalysis(communicator, section, nodeid, stateid, critical_path_analysis) {\n    if(section instanceof LazySuperSection) {\n        return new LazySuperSectionMemoryOpAnalysis(communicator, section, nodeid, stateid);\n    }\n    else {\n        ObjectHelper.assert(\"Do not use\", false);\n        return new SuperSectionMemoryOpAnalysis(section, nodeid, stateid, critical_path_analysis);\n    }\n}\n\nexport { MemoryOpButton, AutoSuperSectionMemoryOpAnalysis };"],"sourceRoot":""}
\ No newline at end of file
diff --git a/dist/626.js b/dist/626.js
deleted file mode 100755
index 2a7c650e..00000000
--- a/dist/626.js
+++ /dev/null
@@ -1,2 +0,0 @@
-(self.webpackChunk_spcl_sdfv=self.webpackChunk_spcl_sdfv||[]).push([[626],{6626:(A,g,Q)=>{"use strict";Q.r(g),Q.d(g,{MemoryButton:()=>o});var I=Q(7329),E=Q(6610),C=Q(3349),B=Q(379),t=Q(6070),e=Q(7608),a=Q(4286),n=Q(1318);function i(A,g){var Q;if("undefined"==typeof Symbol||null==A[Symbol.iterator]){if(Array.isArray(A)||(Q=function(A,g){if(A){if("string"==typeof A)return r(A,g);var Q=Object.prototype.toString.call(A).slice(8,-1);return"Object"===Q&&A.constructor&&(Q=A.constructor.name),"Map"===Q||"Set"===Q?Array.from(A):"Arguments"===Q||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(Q)?r(A,g):void 0}}(A))||g&&A&&"number"==typeof A.length){Q&&(A=Q);var I=0,E=function(){};return{s:E,n:function(){return I>=A.length?{done:!0}:{done:!1,value:A[I++]}},e:function(A){throw A},f:E}}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 C,B=!0,t=!1;return{s:function(){Q=A[Symbol.iterator]()},n:function(){var A=Q.next();return B=A.done,A},e:function(A){t=!0,C=A},f:function(){try{B||null==Q.return||Q.return()}finally{if(t)throw C}}}}function r(A,g){(null==g||g>A.length)&&(g=A.length);for(var Q=0,I=new Array(g);Q<g;Q++)I[Q]=A[Q];return I}var o=function(A){(0,B.Z)(o,A);var g,Q,r=(g=o,Q=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(A){return!1}}(),function(){var A,I=(0,e.Z)(g);if(Q){var E=(0,e.Z)(this).constructor;A=Reflect.construct(I,arguments,E)}else A=I.apply(this,arguments);return(0,t.Z)(this,A)});function o(A,g,Q){var B;(0,E.Z)(this,o),B=r.call(this,A),n.tV.assert("Valid bandwidth",Q>0),B.Memory_Target_Bandwidth=new Number(Q),B._display_image={1:"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwQAADsEBuJFr7QAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAAcJQTFRFz8/Pmpqa1//cz//V0//Z1f/b3f/h4v/m5//qxv/Nyf/QzfnS7P/umfqmxP/Lw8PD7//xuv/Dvf/F8f/z8//1t//A9P/1s/+9r/+6rP+3rf23qP+zg4ODpf+xg4ODov+u/P/9AAAAAAQAAAgBAAwBABACABQCABgDABwDACAEACQEACgFACwFADAGADQGADgHADwHAEAIAEQIAEgJAEwJAE4JAFAKAFQKAFgLAFwLAGAMAGQMAGgNAGwNAHAOAHQPAHgPAHwQAIAQAIMQAIcRAIsRAI8SAJMTAJcTAJsUAJ8UAKMVAKcVAKsWAK8WALMXALcXALsYAL8YAMMZAMQZAMcZAMsaAM8aANMbANcbANscAN8cAOMdAOcdAOseAO8eAPMfAPcfAPsgAP8hAv0iBPsjCPcmCvUoDPMpEO8sEu0uGuU0HOM1HuE3It06JiYmJv9CKNc+LNNBOMdKPMNNP79QR7dWSf9gS7NZV6diW6NlXaFmZZlsZ5dub490cY11c4t3d4d6eYV7fYF+f39/f4F/f7OFf72Hf9iKf/qOf/+PgICAhJ+IkO2ckpKSnp6env+qpNirvb++v7+/zs7O////Ovgw2AAAACF0Uk5T7fDw8fHx8fHx8vLy8vPz9PT19fX19vb3+Pr6+/z8/f7+BMEvSwAAE5tJREFUeNrt3fmDVWUdx3EHlMUMhUAwJJph2BfZIhRCtogtliFAFpmRa7bntJfZim1MmaXn/00TUZbLfO+959xznue83j+n3GnOq7mfp+E+jxWSuvaY/wokQCRAJEAkQCRAJEAkQCRAJEAkASIBIgEiASIBIlXSqtvzAZG6tGS6M70EEOmhzZ/udDrTqwCRHtbtzkdN9/s2CxDlPUCmOx/X59ssQJRziz/x8aGQlYBI9zTvUx8fvc1aAIj0wAD5lMgiQKS7rZ7u3CdkJSDSgwOk77dZgKgVA6Tft1mAqCUDpL+3WYCoLQOkr7dZgKg1A6Sft1mAqEUDpPe3WYCoTQOk57dZgKhVA6TXt1mAKMOWzeqj0/nVlwFRO5sT8DE9108QGSBdfaywQWSAdO12AYgMkK4/QJYCIgOkq4/HC0BkgHTzsbwARAZINx+rC0BkgAw60AFRKwfIE4DIAClhgAAiAwQQtaXlJQ8QQJRTT5Q9QACRAQKIDJD+BgggMkAAkQFy5wfIHEBkgHT1sawARAZIaQMEEBkggMgA6W+AACIDBBDl3nsVDRBAlEMrqhoggCiD5lY2QABR+i2drmyAAKJ2DPTVBSAyQMoeIICoFQNkHiAyQLr6WFwAIgOk/AECiAwQQGSAAKL29YWqBwggMkAAUZ49V/kAAUTp9mT1AwQQJdszQxgggMgAAUQGCCAyQO7/ATIfEBkgXX0sKQCRAdLNx6oCEBkgVQ4QQGSAAKK8empoAwQQGSCAKKtWDm+AAKLkWjjEAQKIDBBAZIAAIgOk9AECiDIcIAsAkQHS1ceiAhAZIN18rCwAkQEylAECiBJq0dAHCCBKpwXDHyCAyAABRAYIIDJASh8ggMgAAUQGCCAyQACRAdL1B8hTgMgA6epjYQGIDJChDhBAZIAAoqRbUt8AAUSNb36NAwQQGSCAKOFW1TlAAJEBAogMEEDU1gHyXAGIDJA6BgggSn6APAOIDJCuPp4sAJEBUs8AAUQGCCBKscUNGCCAqKnNa8IAAUQGCCBKr9WNGCCAyAABRAYIIGrZAFlRACIDpNYBAohSHSBLAZEB0tXH3AIQGSA1DxBAZIAAooRa1qQBAoga1pxGDRBAZIAAIgMEEBkggMgAebwARAZINx/LC0BkgHTzsboARAZIMwY6IEpsgDwBiAyQxgwQQGSAAKLmt7yRAwQQNaMnmjlAAJEBAogMEEBkgACi1g6QOYDIAOnqY1kBiAyQhg0QQGSAACIDBBAl2bPTTR4ggCiBgb66AETtbEWzBwggqrW5DR8ggKjOljZ9gAAiAwQQGSCAKMsBMg8QGSBdfSwuAJEB0tQBAogMEEBkgACilHomjQECiAwQQNS0nktkgACiOnoylQECiAwQQGSAACIDBBC1ZIDMB0QGSFcfSwpANHDvPZvpAFlVAKJBm397+nZ6rzqtAQJI2m/lm3PWk+kAASTZPv48wpruzOi7pxIbIICk2so7T9r0IgMEkB57emTk+S+V2jsN62+37/4v8fTf/9KkV/bvEOtkBkieQEZG827NqXueqKNNem3vPOobszC5AQJIgq2/eN8ztS8RIAkOEEDSa+v1+x+qmzvSABIZICsLQAAZpN1TDz5WNzalACTFAQJIah28+bDn6sp484GEBsgCQAAZoLGTXZ6sc2NNBxIaIE08swYkoXl+oeuz9Y2mA0lzgACSUluuPeLp2t9sIIkOEEASatfUo56umzubDGRRogMEkHQ6cPPRz9fk5uYCWZDqAAEkmXl+YtYn7MraxgJJdoAAkkjrJmZ/xDrnxxoKJN0BAkgix1dXO5FONBNIwgMEkEQ6EwLSOdBEICkPEEASafxyCMjNXQ0EkvIAASSZN1mvhoRMbW4ckKQHCCDJtG0qJOTquoYBCQ2QpwABZND2xmbIhbFGAQkNkIUFIIAM3OGYkJONApL4AAEkpU7HhBxsEJDUBwggSR1lXYwdZe1uDJAlqQ8QQNI6yroeO8ra0hAg85MfIICk1dbYUda19c0Akv4AASSx9sRmyMU1TQCyKv0BAkhqHYoJOdUAIDkMkDyBPJYxkNFTMSGHagfyuYCPzucLQGbtg/dL7t2cgYxdiAnZU8/Le/OTb8J/Ij7e+Oes38wPAHl/puxyBjK6/lrsKGtrPS/vzrfgd9+OvMjfzP69fB8QQHprS+wo69X1NQL58/cjL/FnM4AAUn67b4aEXBqvD8hPIy/wB7cAAaSKDsZmyOnagPw68vLe+P0MIIBU0omYkMM1AXm7rAECCCD9HWVNxITsrQXIn75X1gABBJD+Whf7FIepF+oA8pPSBggggPTZ5uBR1obhA/lleQMEEED6bVfsKOvysI+yZt5+vbwBAgggffe12Aw5M+SXVeoAAQSQ/jseE3JkuK8qNEB+eAsQQCo/yjofE/LiMF/Ugcgr+s4fZgABpPLWXon9Fdztw3tJ20LL6K0ZQAAZxlHWZOwoa+PQyIZ+kfLnM4AAMpR2xo6yXhnWUVboI4R/dAsQQIbUvtgMOTucT5MrfYAAAsiAHYsJOTqM17K99AECCCCDHmWdiwnZN4Rff7le+gABBJBBGw8eZe2o/JWcK3+AAALIwG26ERJyY1PFr+NgBQMEEECG9da/c2W8Aa/irRlAABl2L8VmyLkqj7KqGSCAAFJGR2NCjtc9QH58CxBA6jjKOhsTsr/eAfLdP84AAkgtR1mvxI6ydtY5QF7/7QwggNTTxtgdn5PV3PEZGyC/mAEEkLp64bXYUdbapAYIIICU1YuxGTJRwVHW4coGCCCAlNaRmJATpf/BO6sbIIAAUl5nYkIOlPzHrn+1ugECyEe5/qCko6zLsaOsXeUeMUf+4u/0v/7b7zfT9QcVfEntBBL83/LOVKlHWZEBMv3FlJ+m/ICMtBTI6LbYp8ldLfFihMgAmV5dAAJIE9obmyEXxob6Q+t2AQggzehwTMjJoQ6QOYAA0pROx4QcHOIAWVYAAkhjjrIuxo6ydhsggLTzKOt67ChriwECSCvbGjvKuj7wUVYbBgggGbYnNkMurhnwzznaggECSI4digk5NdifsqvTggECSJadjAk5NMifseFGGwYIIFk2diEmZE/Ff0T6AwSQTI+yrsWOsrYZIIC0si3BOz77PcpqywABJNd2xz5N7lJ/nybXmgECSLa9HJshp6sbIPMAAaTBnYgJOVzVAFlcAAJIk4+yJmJC9hoggLSydVdDQF57wQABpJVtDh5lbejtJ9PFFg0QQLJuV+wo63JPR1nH2jRAAMm7/bEZcqbkX4XMZ4AAknnHY0KOhP+FGydbNUAAyf0o63xMyEvRf9+ldg0QQHJvbfCOz+0GCCDtPMqajB1lbTRAAGllO2JHWa8EjrLaN0AAaUH7YjPk7KyfJhcbIPMBASStjsWEfL2UAbKkAASQxI6yzsWE7Bt8gHT+UQACSGqNB4+ydgw8QDp/BQSQ9NoUuxjhxqbu/4o1odtHTr8DCCAJtj12lHVlfLD/T/7qOCCAJNlLsRlyrttRVuhihde2jgICSJodjQk53uU9Wug35/ePApLEl4TDQ46yzsaE7B9ggIwCUkUu8RzOUdYrsaOsnf0PkA//k2+W/c10iadroIfUhthR1uTm/gbI1Nb//2fL/l66BhqQYfXCa7GjrLV9DZA7vzEPCCDJ9mJshkyM9TFAPrn2EBBA0u1ITMiJ3gfI3V8GBgSQhDsTE3Kg5wFy90Y3QABJ+SjrUuwoa9fdf2JzLwMEEEASb33sKGtqc0+Hw5+5dx0QQJJuW+zT5K7duRjhZE8DBBBAkm9vbIZcGAv/Ctc9V0oDAkjiHY4J+eht05YeBwgggGTQ6ZiQg70PEEAAyaA1F2NHWbt7HiCAAJLFUdb12MUIPZ13AQJINm2NHWX1c/8OIIBk0J6yfDzwF6wAASSHDpXj4/IaQADJspNl+Jh68GNQAAEki0JXOfdxASgggGRylHWt/AECCCD5tGWq9AECCCAZtftm2QMEEEBy6uWyBwgggGTViZIHCCCA5HWUNVHuAAEEkLxad7VPH5Pd7jQEBJCc2tznUdaeUUAAaUM7+zrKOjYKCCDtaH8fPi6NAQJIWzpe3gABBJAMj7LOlzZAAKki1x/U3NorZQ0Q1x8kkQt0ej3KulHSAHGBThKNeOR7bMfNcgYIIIDk2b5yBggggGTasTIGCCCAZHuUdS7m4+IYIIC0sfHQUdaNDaOAANLKNkYuRtg1CgggLW377EdZR0cBAaS1zXrXwYUxQABpcd8acIAAAkjWfWXAAQIIIHn/UtaAAwQQQPLuzGADBBBA8m7bYAMEEEAy7/xAAwQQQDJvw2QXH0dGAQFEo199uI9vjgECiD5s/8P+//TzUR+AAJL9z5AHhZwaHwUEEH3cpvt+831ybw//MCCA5N/uz3xk76sH144CAojuPc16+eTEtasTZw/tXNPbPwgIIAIEEAECiAABRIAAAggggAACCCCAAAIIIIAAAggggDTyS/KcApIREBfoZJQLdMrPFWw55Qo2QAQIIAIEEAECiAABBBBAAAEEEEAAAQQQQAABBBBAAAFEgAAiQAARIIAIEEAECCCAAAIIIIAAAggggAACCCCAAAIIIAIEEAECiAABRIAAAggggAACCCCAAAIIIIAAAggggAAiQKrL9QcZ5fqDBHKBTn25QCeBRjyngAACCCCAAAIIIIAAAggggAACCCCAACJAABEggAgQQAQIIIAAAggggAACCCCAAAIIIIAAAgggAgQQAQKIAAFEgAAiQAABBBBAAAEEEEAAAQQQQAABBBBAABEggAgQQAQIIAIEEEAAASTyJXlOAckIiAt0MsoFOuXnCraccgUbIAIEEAECiAABRIAAAggggAACCCCAAAIIIIAAAggggAAiQAARIIAIEEAECCACBBBAAAEEEEAAAQQQQAABBBBAAAEEEAECiAABRIAAIkAAAQQQQAABBBBAAAEEEEAAAQQQQAARINXl+oOMcv1BArlAp75coJNAI55TQAABBBBAAAEEEEAAAQQQQAABBBBAABEggAgQQAQIIAIEEEAAAQQQQAABBBBAAAEEEEAAAQQQAQKIAAFEgAAiQAARIIAAAggggAACCCCAAAIIIIAAAggggAgQQAQIIAIEEAECCCCAABL5kjyngGQExAU6gADyiFzBBggggAACCCCAAAKIAAFEgAAiQAARIIAAAggggAACCCCAAAIIIIAAAggggOgzvVn2b55+AAggOVX29/J9QAABBBBAAAEEEAECiAABRIAAIkAAESCAAAIIIIAAAggggAACCCCAAAIIIIAIEEAECCACBBABkhYQ1x9klL9RmEAu0Kkvfyc9gUY8p4AAAggggAACCCCAAAIIIIAAAggggAAiQAARIIAIEEAECCCAAAIIIIAAAggggAACCCCAAAIIIPq0EUAAESCACBBABAggAgQQQAABBBBAAAEEEEAAAQQQQAABBBABktiX5DmtrccAKT0fXp1R7/rw6tJz/UFGzbj+ABABAogAAUSAACJAAAEEEEAAAQQQQAABBBBAAAEEEEAAESCACBBABAggAgQQAQIIIIAAAggggAACCCCAAAIIIIAAAogAAUSAACJAABEggAACCCCAAAIIIIAAAggggAACCCCACJDqcv1BRrn+IIFcoFNfLtBJoBHPaW25gg0QAQKIAAFEgAAiQAABBBBAAAEEEEAAAQQQQAABBBBAABEggAgQQAQIIAIEEAECCCCAAAIIIIAAAggggAACCCCAAAKIAAFEgAAiQAARIIAAAggggAACCCCAAFLll+Q5rS2fzVt+Pt09o3y6e/m5HySj3A8CiAABRIAAIkAAESCAAAIIIIAAAggggAACCCCAAAIIIIAIEEAECCACBBABAogAAQQQQAABBBBAAAEEEEAAAQQQQAABRIAAIkAAESCACBBAAAEEEEAAAQQQQAABBBBAAAEEEEAESIW5/iCjXH+QQC7QqS8X6CTQiOe0tlzBBogAAUSAACJAABEggAACCCCAAAIIIIAAAggggAACCCCACBBABAggAgQQAQKIAAEEEEAAAQQQQAABBBBAAAEEEEAAAUSAACJAABEggAgQQAABBJDYl+Q5rS2frFh+Pps3o3w2b/n5dPeM8unugAgQQAQIIAIEEAECCCCAAAIIIIAAAggggAACCCCAAAKIAAFEgAAiQAARIIAIEEAAAQQQQAABBBBAAAEEEEAAAQQQQAQIIAIEEAECiAABBBBAAAEEEEAAAQQQQAABBBBAAAFEgFSY6w8yyvUHCeQCnfpygU4CjXhOa8sVbIAIEEAECCACBBABAggggAACCCCAAAIIIIAAAggggAACiAABRIAAIkAAESCACBBAAAEEEEAAAQQQQAABBBBAAAEEkKb39MjI81/S8Ht+ZORpQKQ2BYgEiASIBIgEiASIBIgEiASIBIgkQCRAJEAkQCRAJEAkQCRAJEAkQCQBIgEiASIBIgEiASIBIgEiASIJEAkQCRAJEAkQCRAJEAkQCRAJEEmASIBIgEiASIBIgEiASIBIgEgCRAJEAkQCRAJEAkQCRAJEAkQCRBIgEiASIBIgEiASIBIgEiASIJIAkQCRAJEAkQCRAJEAkQCRAJEAkQSIBIgEiASIBIgEiASIBIgEiCRAJEAkQCRAJEAkQCRAJEAkQCRAJAEiASIBIgEiASIBIgEiASIBIrW8/wGZ0JDqvSQHhgAAAABJRU5ErkJggg==","-1":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwgAADsIBFShKgAAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAAlJQTFRF8Q0N8dbW/8bG/8DA/7u7/729/7W1/7Ky/7Cw/6ys/6mp9q+v/6am/6Ojz8/P/6Cg/56e/5qampqa/9fX/9ra/5eX/8/P/9PT/9XV/93d/9/f/+Li/+Xl/+fn+e7u/8bG/8nJ/8zM/+jo/+zsqysr/5WV/8TE/+7uw8PD/5GR/8HB/+/v+pSU+/j4/7q6/729//Hx//Pz/4yM/7e3//T0yCkpyYyM/4uL/7Oz/6+v/4iI/6ys/4WF/6iog4OD/YWF/6Wlg4ODhIOD/Sgo/4ODwICA0YCA4ycn/6KiAAAABAAACAAADAAAEAAAFAAAGAAAHAAAIAAAJAAAKAAALAAAMAAANAAAOAAAPAAAQAAARAAASAAATAAAUAAAVAAAWAAAXAAAYAAAZAAAaAAAbAAAcAAAdAAAeAAAfAAAgAAAgICAgX19gwAAg3t7hXl5hwAAh3d3iXV1iwAAi3NzjXFxjwAAj29vkW1tkpKSkwAAlWlplwAAl2dnmWVlmwAAnWFhnwAAn19foV1dowAAo4GBpVlZpwAAp1dXqVVVqwAAq1NTrVFRrwAAr09PswAAs0tLtwAAt0dHuwAAu0NDvwAAvz8/v7+/wT4+wwAAxTo6xwAAxzg4ywAAyzQ0zLCwzTIyzs7OzwAAzzAw0wAA0yws1wAA2SYm2wAA3wAA3yAg4ERE4wAA5Roa5ZiY5wAA5xgY6RYW6wAA6xQU7RIS7wAA7xAQ8Q4O8wAA8wwM9wAA9wgI+QAA+QYG+wAA+wQE+4KC/QIC/wAA/yYm/39//56e////55zYuAAAAEl0Uk5T3+Dh4uPj5ebn6Onq6uvt7e7v8PDw8fHx8fHx8fHx8vLy8vLy8/Pz8/T09PT19fX19fX29vb39/f3+Pn6+/v8/Pz9/f39/v7+/oME4UMAACOBSURBVHja7d3/f1fVfcDxTjurGaIGEYFkYFgSNRvfZIuG6OiWbtxPAggRDIkRQogsimWzZZPR0VhWOtp0szR1LEs3U2qTLh2WyZamM673Xu//NTCofMmX+/mc9/l6X6+ffPgQH+RzP8+cc+6384WMiBbsC3wERAChvG2764v3Xqtq5bXq0+vVX//Hquv/8ot3bQMIFa8tv33vg3MY0jSJFyu58V/VP3jv3VsAQoFXc1/90igWxVJ/Xw1AKLjqlrVULmMeJy3L6gBCIdR0z1YhGXc62XpPE0DI22of0ELjdiYP1AKEfGt1s24btyhpXg0Q8mVSVdVmDsdNSNqqmgBCbrdtmXkbtyhZtg0g5Ghrmy3i+BxJ81qAkHOtTx3Q4f9AApAQq9nqjo7PB5IagJALOlpcw/GZkZYagBA6QjICEHRgBCAFqNYHHZ8ZqQMImazBGx2fGmkACJkaPFo94zFHpLUWIMTg4fcwAhAGD7vDyFqAkK7We63jUyPrAEI62hgAjzkiTwOEhGtqDoTHjZlWI0BIrjVt4ej41MhqgJBMj6Sh8Zgjsh4gpN66IHnMEdkEEIKHT6e0AMLkCiIACaNVwfOYI7IKIFR+jxaCh2tEAOJJqwvDw62TvgDxosa2IvH4hEhbI0AoZ9uLxuMTItsBQnlqSIvow5G74QHieg8XlMcckYcBQou1ua24POaWIpsBQgv2TLF5fELkGYDQ/K1K8WH7qghA3G0HPG4Q2QEQur11DB8u3KAFEBbnLNYB4lsb4XEHkY0AoblqmV3NO8+qBQhxbtetM74Aca1Gho9FBpFGgBS8BngsSuRJgBQ6rn0sJWQnQIrbCqZXOaZZjwKE1Tk5slYHCKtzDweROoCwOqdFiGwCSMHajo+yhDwLkEL1MT7KnWZtBghnr2gRIo8CpCBxa2JlQp4CSCHi4mClQnYAJPw2ML1y+XwvQCz3GDyUiDwGkKB7Ch9uL0QAYrVnExfnLQvn4l/3WYAE287ELRYtK6u+dFfTIn/hpru+VLWyxS0qeu/vBYjFXLg6+AmMJ6ru3lLm333L3VVPOAIlSbcAJMBqbH+5rtt4SHUfjtUPOaAkWQOQ4FqV2LXRsmyD3KnqZa12lSSPACSwnkws4qjX8Rt3Tb1FJNpu7wWInZ5OLOFou1/new8a72+zhETXU1QAKczp3Wsjx8oNBn62DSutjCSaTvcCpBg+krR1hcEfcEWreSN6TvcCxEKmL38kaX2T8R+yqd60ES1CABK6Dys67BjRIQQgxjN5eTBJt9ZZ/WHrtpo0knwMEHyUoaOlzoEfuLbFnBF5IQAxPOsw9mVJ0vXO/NTrDf7UTQDx2Udi6nvS3OjUD97YbMpI0gQQfCzFY5WDP7ypLUllhQAkOB9Ja52jP39da+KdEIAYLDUyt9rm8CewzchJrRQgnL9agMdG5z+FTfqJSJ7LAkg4PixullxWj2knIigEIKbSff3cFx5G1uty19QBEoYPn3hcb51mImJCAGImvffvJmmDd5+IZiJSQgDiv48k1fA43ceLvPznYx+ICD0fAhATaX1+MHlax185NXEa9SmdRJLtAPEknc+fJ6163nljBIjeF3cnGwHixzmbROPsarWmv7QhINlajYOIxIt7AaK9msTHtbkpIFpv9U1WA8T9tN1gonU7ZHNAdC7RkkaAuJ6uC+hJWpsFAkTjHikpQBxP1wXCRPNdV0aBZNkmXR/TToA4naYLIEmb7j1eDQPJNrdp+qSeBYjD6dkfx8R9JaaBaLtuqHiZCCA607O/mom9Ky0A0XVRJGkAiKNt0HPAN2WBAtG0EklqAFKcE7xJujYLFoimy4YpQJxMx4zByPTKHhA9ZzVUTmUBRFsbE9fm0z4AyRoSpxbqANHVikTD9Ko2Cx5IVqthmlX5DlQA8WcBonnDY1eAaJlmVXzPCUA0JX+HSdKQFQRIti5xZqEOED1tTzyeXlkHouHmrEqHX4D4sdI0Or2yD0TDNKvCy0cA0VFj4vX0ygUg2Xrxz7AGIIEu0JO0LiscEPmdIlKAONIzskdWw75JPgARf1Sgorc4AEQ+4SsgenZv9QGI9L0IySqAhDfBMr48dwiI9FI9BYgDyf7a0/PWK1+ACD+uXsFgDBDpZM/wJk9lhQYi/E6x5EmAWK7R8gENDYj0L5xGgAS0AKn8HrtwgGSPJDaXIQCRTfQMb7I6A0iWrRH9TJ8BiMVqRY9lbQaQ69VZ/FQB4uoEK0k3ZwCZa4vkRfUUINYSfIjQyuVzV4GIPj1Q3iv3ACLYZsGjuDMDyM0J3naSbAaIndrC8eEcEEkhbQCxktxzcLbnVy4CEZxlJesA4vcKPc0A4sjnCxCx5O7BSjYDROsSr4y3iwFEKrmN1qxe/3AYiOBVpvw3vgPEuQmAzevnbgPJVifGJ1kAEUrsHhOL9185D0Tuvqzcd5wAxLH5sb37d30AInf3e9IEEJNJXQKx9vyHJ0DktiRqA4jBHhY6bLaeH/QHiNgzhskKgHi3Qrf0/LlXQMSeU08BYiyhp97s32DiAxCpm07yvWoRIO4MIA7cYOIFEKmbTlKAGGq7wQMGELlfSNsBYiSh9zQkdQDJmdAl9Ty3LABEPZlTvObfT+0vEKlFXwoQA8nc/+DQCSwPgAidyspxSxZAHJkQpxlAXPzUAaLao4mp6TBAxJchSw8hAHHiV5ljCxAPgAgtQ1KAaE7kMRDXFiA+AJFZhiz59C1AXBhA0gwgjn70AFFL5AEF5xYgfgCpNTGEAMT+bzH3FiB+AJF5OCQFiMYk3vRTxhsEAHJrEu/JWGIIAYj1ASTNAOLu5w8Q6wPIWoBU3FrtQwhALP8Cy/dUAkAWaFOieQgBiN1TWG4uQPwBIrEMSR4DiLMDSJoBxOmDAJDKE9garJzXKANE1zpwsVf1AaTyBJ4DacsA4vZhAEjFNQn86toMEOUE3tm3yObQAKm4ZvXjsjEDiHoCG9+1AsTF1WGaAcT1IwEQe7+3XLxH0Usg6nctLvxGS4BY+7VV7pb2AFkw9VfrpwARbn0S8gTLMyACv62eBIhrh6QBIGI1aPt1BRBb0940A4hLv6/WAESyVp1XbwFSduovJ2sDiFO/sVozgDj1GysFiEtz3mQLQETbkuhZpgPEygDizk5SoQBR33kqBYg7S/Q0A4hzv7TWAsSVCa+rjxF6DUT54cJWgLjyyyrNAOLJUQGIhSW649cIfQWi5bAAhAEkFCBajgtAzC/R3X3O1nMgqk/fzrcJHkDKr6UAA4iXQJSHkBaAOHAYvBhA/ASiOoSkABGoJinAAOInEOXfXTUAsT7D8mMA8RSI6hDSAhDrv6XSDCAeHZwAgTxeXf3cl/X1Z4q/pP78T77sQV9Z7KdMvjLvn3muuvpx2wdf8U0Bd86xAgRSHemsfVrxTMlA5EODi/4Mgwv9sWrfh5AWgCjWq+jjajtAdNYsPMcCSJmdVQRyPAKIzrYJz7EAYnaGNbMHIHprlZ1jAcTsDOtMBBC91SWicyyAmJ1hdQLE7WX67XMsgJTXFTUfIxFAdLdKbQjZChCFXlQcQA4DxPUhJAWItu9NKOd4PQfSDBBrQMbUgJyKAKK/RqU5VrIeIBW3R3GG9QJAfJtjAaSc+tR8jEUAMZHam/cBUnnn1ID0A8SDIeTW92MBpIxKV5V8THcAxExqj+w0A6TCuopxFd1/ILVycyyAlNFxNSDdAPFjjrUNIDZO8l4pAcRUW5WO1DKA2DjJ69MMy3cgdWJzLIAYu5O3GyCezLEAUlknlXxMRQAxV73SIqQJIJU0qgTkJEAM1qQ0x6oCSAW1zyoB6QKIN3OsNoAYvwri1wzLfyD1QosQgOTuWIFmWP4DUZpjAaSShotzDisAIEpzrJs2sQ8QyHJN3xmlG7Fm2gsBZLk7XwOlt5s0OwTk3XeEe1PPV6ZTaQB5OyoEkDelD+a7FX+vVsjMsewDeedV6fR8ZY4oATlaDCDix/IdO3MsgJTfUCFe9wOQuUVILUDK7ZKKj8kIIKaBrFQ5YA8ApNzLhEoDyGmAGAeyQWQRApCcHVAC8hJAjAORWYQAJGdK72uY7QCIeSBtADEIROlW3vEIIOaB3C9xQy9AcvZ2MV4YFxIQpRfI3QOQ8lJ6a/UhgFgAorQI2QqQstqttEbfCxDfgKQAKavuAt3qHgyQeoAYAzKgAuQ8QKwAWZMAxBSQMypABgBiBYjKHCupA0g5Kb0S6wBAvAPy6cuxAJIvlc1tp0sAsQNE5ZmQFoCU0V6VAWQsAogdIMvUV+kAydXBQt2pGAyQDQlAzABRuhPrKEAsAVFZhABE7vsS1BuxAAKQ8jurAqQDIB4CSWoAkr+LCj4mIoDYAvKQwnG7DyD5m1L4oIcBYg3IaoVVej1AcldSmWENAsQaEPVFCEDypPROrF4fgSy+n+85gADk5npUgOzzj8f+kSV+ppH9AAHI5/WrAGn3jUfpxNIbPcyeKAEEIJ92QsHHZd987BvP95z9Ph+APKFwnncLQPJ2XgHIqGc+Xsp7X+b0Sx4AqVI4cncDJG8jCh/zOb98HMm/j9bsEfeB3K1w5O4FSN7eU/iYT3jlo7wnJwecB7JF4ULIg24A8WH7A5XrhP1ejR+KP5xD2x+or9Lr3QAinoYNdFROYvX4tP4od5/S2dvWIcud+zaonsZiC7Yc7VIB4tHGB/vKf27yf08N3twfAaSIQJSeJ/TnMkhpPFYtSSvtY4D4C0RlA+hpfwaQE7HFUk3fhhaA6AeicqeJP1vn7J8NEchKgOgHovLArT/XCUfiEIFUAUQ/kGMKB/6CLz564yCBfAkg+oEcVzjwQ74AGQ8TyF0KZxy2ASRfKhvcnvTER08cJpAmhUvpdwEkX8MFeJ5wOFAgKud5vwgQ/cvXI3742DMLkHnvVgSIZiCebC41EAMEIDaAHPQDyAWAAAQgC9Y+AxCAVNxo8EC6YoDcWRVA8jWpcOD3sQTxFshKgOgH4scGt6cBAhCAuHofFkAA4ngTAAFI5U0FD+QqQOapHiD5UjnwflwGiQGywN8JIAABCEAAAhCAAIQ1CEAAoqNJgACEs1hcB+EsFtdBKuoMQLgOApCFewUgAAHIwh0ECEAAwvMgAMl4HqSieKKQ50HsnOPxBAjPpM8TTxQC5NN4qwlA7ADx5K0m0dsAAYgNIJ68F8v2q3kBYi75LdiK8GZFpY1KAwXixpsVPdjEswjv5o0O2QWSaNrE0/9383qwDXQh3u4ejdkVomcb6ADe7u4BkELsDxJ1zYYIxP/9QTwA0qdw3P3ZYSo6FSKQKoDoB1KMPQqj9vcCBLISIPqBFGSX22h/+fukz56+ZZ/0H1WeJiAtANEPpCD7pFdyJuvwrf8D8WOpDCQFiH4gu1SAdHoEpOxbsgYigABE7aH0Hp+ARH+hdhUUIMUEovJQer9XQMoaQwaioIHUA8TEbRgn/AISHc777NTM4ch9IFsULqQ/CBATdyue8wxItD/fm6wn9kceALlb4cjdC5C8nS/GlcIbdZxa+pr67KmOyAcgCtcJ47sBkrcTCh/z5ci/upa6L2usa/4/6ByQJxRuxdoCkLz1F+VCyKeVDi82z5o4XIo8AaJ6Egsg2u818WSXwjvqXeg9Dhd6F/5DACkmkE4VIL2Rpz0/cOH2xcjshYHnF/sjACkmkJIKkMHI3zq6XzkzMnn9Fq3pyZEzr3R3LPHfA6SYQJSuFA5Hxck1IKsVLoPUAyR/FxWATADEGpCHFI7bfQDJ31mVOVYHQGwBUZhhJTUAyd+gCpAugHgI5MZrVgCSK5WHbuOjAAFI4ECUtgc4DRBLQDYkADEDROmZwjGAWAKyLAaIGSDRtMJHPV0CiB0grQpHrQUg5aT0VrUDALEDRGEJEi8DSDkp7XI5ABDvgCR1ACknpQ1mzgPECpA16mt0gOSsWwXIFECsAKmPAWIKyG6ltwbuBYgNIGkQQDzY/uB6V1SAHCoKkDelD+a7toBsdQaIeMu1HHqlLcpOFQXIcpe+CI0KS5D4nnCBVGs59CdVgIwXBUi1S1+E+xWOWNIEEIN3Y812AMR8bQJLEIDk7YDSKv0lgJgvBYhBIO1KQE4DxHgqdyoCpPwuqQCZBIjxVqocsAcAUm5DSkNIJ0B8mmEltQAptyNKQI4CxMslCEByp/RurPhtgBhuRQIQo0CiqypAZtoBYjaVZ0HiZoCU37DSENINEI+WIKsBUn7HlICcBIjRmmRmWADJX5cSkCmAGE3lVneAVHapcFZJSBdAfJlhxW0AqaRR5ljeAFGaYcVVAKmkk8yxvAGiNMP67FZegJRVb8x5LF+ApEJLEICU0R41IGcAYqy6BCDmgai9HCu+UgKIqbYqHallAKms48yxPAGiNMNKtgHExpWQIsyxHAFSKzbDAkg5lZRux4qnOwBiphal49QMkEo7pzaE9APEhxnWWoBUWp8akDGAGGm93AwLICZP9MYvAMT5AQQg9k70hv8COSeAKL0w7taTvAAxe6L3ajtA9Ncci53kBYjZE73xYYD4NcMCiNETvfEIQLS3KpE7yQuQcjurOIR0AsTtASSpAYhKinf0hn413QEgavcp3j7DYvuDMmufVgMysydoIA5sf9CqdoBanAPiyQY6UnOs40EDsb+BzrZEdIbFFmym51hXgj7Ta38LNrUb3e+YYQHE9Bwr7JeQ2geSys6wAGJ8jjVRAog+IJuEZ1gAMT7HinsBog9IKjzDAoj5OdYoQLQBeSwRnmEBxPwcKz4IEF1AFAeQO2dYALEwxxoBiCYgineZzDPDAoiFOVbAb2+wDERxAJlnhgWQChpSBTIOEC1A1ikOIEkdQCR6MeZElpNAVAeQeWZYAKmkSwwhLgJRHkAaACLTUYYQF4HoGEAAUkm7ZhhC3AOiOoDErQBxZpke6rO3NoGoDiC3vg8LIHaX6VPtAJEF8lSiY4YFEEvL9HgQILJAlAeQjQCR6xVlIDPPA0QSyA49AwhAKmu38jI9PgcQQSBrVX3cvHEnQNQ7pwwkyG1vrQFRnWDFycMAkeygOpAxgIgBWa88gCwwwwJIpY2rC+kDiBQQ9QFkE0Bk61MHcnkXQGSAPK1tAAFIpbVfVhdyGiAiQDYo+7j9haMAUe+YOpDwni20A0R5gnX7K90B4sQNWXE80Q4QdSCb1AeQ1gwg4p0SGELeAIgykM3qPuZ7Ugogqu0TADK7HyCqQNrUD0OaAURDwwJCxksAUQOyTmAAeRggjl4sjONjAFEDkmodQACi0pgAkJn9AFEBskNgAFnnNBDPtj+4uUMSQ8hER0BAjG9/IHAGa9EBhA10VCpNSAgJ6bZe0xvorBXwseBdJqECqTb3feiTABLSPVmmt2ATWIAsPoAAxPoti3E8/QJAKutZiQHkSYDoq1dkCLnUAZBKaki0DyAAcWEIiYcAUkG1Ej4WPYUFEOV6RIAE8xYgo0AkFiBLDSAAUW1EBMj0PoDYWIAsOYAAxInL6XE83g6Q8lqXmBhAAOLIEBLIw1PmgGwQ8ZGsAojuDsgAiQ8BxPgCZOkBBCDqDcsAmd4LEMMLkBwDCEDU65yVETJWAkje1ieGBhCACHRKaJJ1EiA5a5LxkdQCxES7rgoJ6QeIyQVIsj0DiJH6hYDMvgyQPO00NsECiEilS0JCZroAsnQ7hCZYmwBiqm4hIPH0foCYOYGVcwABiEz/KCXkcidAFu9pIR/JCoCYa9+slJD39gBksZ4U8rHQfiAA0dMbUkD8fjhEO5AGKR9JE0CMnuq9IibkYjtAFuoRMR/PZADx8lTvtc6XADJ/a6R85FyhA0SwETkhZwAyb3ViPnLchAUQ6VuyZuSEnADIPG2R87EjA4jxjskBiQcAousGk7ImWACRvJ4+LijkEEBu72O5AWQdQGz04qwcEE9vy9IIZKeYj7yXQADi7sWQa0IOAUSTj2QzQOzUMRkXfB1S7f78Kk42ZgCxVI8kEB/3Z9MEZEsq56OcFTpApBsSFTJUAojs9Y+cjxGGDWS5xS/I7iuiQoZ9uy9Ly/YHa0R9PJN5BsTjDXTm6SVRIPHFXX4B0bGBziOSPsqcYLEFm3inZIV4dve7hi3YGkR9JBsAYhdI+3uyQqY6Cw3k739f1semDCB2gUT7Z2WFXO4qMJBv/Er0s0x2ZgCxDSR6RRZIPN1TWCDf/FD2o0wzgNgHEl0QFuLRRXXZA/kPH8l+kMkjAHEByPNXhIX4c1Fd9Dj+02+EfTybAcQFINHL0kDiMx2FA/Lav0p/iGkGEDeARGfEhVx6oWBA/voX0h9hsgYgrgDpmBAXMt1XKCDf/VDcx1MZQFwBEr0wLS4kHuooDJDXfyz+6ZXxlC1AvFyGeDHNkjmAf/O+/IeXZgBxCYjow1P+TLNEjt/3PpT/6JI6gLgFpHRBgxDnp1kCR++rP9HwuSXrM4C4BSTaPaVDyKX9gQP521/q8PF0BhDXgEQHZnQImekPGsj3P9ThY2cGEPeARH2xls51BAvkqz/V8omlGUBcBKLheuEnTewPFMg3PtDyeSU1AHETSGlUj5CZY6UAgbz2w4/0+GjIAOImkGjPlB4h8fiLwQH5xvt6PiqFBTpAvLyiPncL/BsdQQF5/V9+o8nHsxlA3AUS9cxqEhJP9gQE5K0PNH1KyccZQFwGEh2JtTW0OxAgf/ljbZ9RmgHEbSDRCX1CrvSXQgDy/V9p+4TKfokJQMx3Xp+Q+FK390C++Qt9H0/OrZ4BYrX2ixqFxMP7vAby9Z9q/GzUTvACxNjJ3gmdQmZO7PIWyOs/+kinj6czgPgAJOq8olNIfPlIyU8g3/sfnR+L6glegJira1qrkHiir+QfkO+8r/UzUblDESCm657VKyS+1OsZEM08pHwAxFAv6xYSj/d6BORbmnmI+WD7g3CEuEAkz/YHb7761s91fxTKF9AdAiLecieBRAOx/sYPWV6L5NlA57e+EPvjgy3YwhISTw602/wZc2zBtinR/ymkGUD8AxINmhASXz2+x10g27amBnyUtc8zQNzppBEh8cyZTjeB1LUmJn7+pCkDiJdATAmJ45HD7c4BWZUa4SHrAyBGKxkTEl899YJLQBqbDfEQ9gGQUMeQa431dzgCZL0pHeI+ABLmSv1G02e6S9aB1LYY5JFuzgDiNRAzZ3tveqjqTLdNIHVbzekQvf4BEHtCZs0SiadOdtkB0lRvUocWHwAJ866TO410txsGYlqH4P1XACmekDieeftopzEgK1pN69DkAyB27n6fjq00efqlDu1ANqxMzevQ5QMgduq6GltqdvzUob2afqq9h37v/jYbOMSeHwSIK3VOxhabOj9wQPb8b+nAwPkpiz+RyPPnAHGoPaOx3abHTh/tkphw7eo6enpsxu4PI/H+EoC4Vcdw7EATw4O9+yo9wdXe2Ts4POHATyHw/iuAuHdj1qnYlS6PnjvR39PZnhtGT/+Jc6OXHfnbJ+mGDCDhAbFwyXDJadfk6IWhk4NHDh08eHDf3mvNrb2vd+3fHDoyeHLowujktFt/aR2XBwHiyAURx75rPqbr9BVAXOjFy3zDHT19BRAn2neJ77ibp68A4sjJrLN8yxWW5zUZQMIG4uBS3R8fO/V/mwDiwH0nLEScXH4AxJmr6hf5tlfgY30GkGIAcemaoT/Lj7oMIEUBEkWHuSJSno8dhr5NAHGk/RN868vw8VQGkGIB4XxvOdOrNRlAigYkil6+ynffgZtLggey3Fcg0fMjfPtzDB+PZIUCUpANdPKdzXqFi4YOXBx0C0gxtmDLvVZ/DwOL+tiUAaTIQKIOLoksNr3akAGk2ECi6KUrSFjAxzPmv54Aca/dQ1iYd/iozQACkOv1TOLhDh8brXw9AeLmSuQNTmfdyqNtcwYQgNz0MO44Km6aXa2z9fUEiLPXRI7NIMPwnYkA8apOLqzPDR+rMoAAZL76OeNr5dwuQHxp18miL9b/tCkDCEAWmWe9XWgf//EHGUAAsviV9eI+SvXBt9/JAAKQJc9nFfNBkV//8LVXAQKQHO0p4s0nP/natWMJEIDk6kDRTvn+/O8+OZYAAUjODhaJyM/funEsAQKQ3HUX5e6T97/z2bEECEDKqHe8WDwAAhCI3Np/feeWYwkQgEDkpgsf33/tVYAARJHIaKiTq+++dvuxBAhAKqhrOMBbtH721jzHEiAAqah9p8J6WuSjf//beY8lQABSYbsHw9l359f//LUFjiVAAFJx7UfCeMvcBz94fcFjCRCAqNRz3vfFyG9+9u3XFjmWAAGI4n2Mx3y+G/6/f/j1xY8lQACifpfWOT8X7B/99FtLHkuAAERiwX70knc8fvmDv8pxLAHC9gcyvTjk0S6Hyf/957/lO5jvAkS85VExa+8964ORJP3j3/ldf75NbMGGEaM6Wmr8+jYBBCPoAEjRjFxxUEdzjY/fJoAEumYfHHMJR7psm6ffJoCEewmx79xVN4aOtR5/mwAScqWu42MMHQAByGIDSe/J0VkrNtqqmvz/NgGkEMv2rmPDV43iaF4dyLcJIIWp88jQJRM20gdqA/o2AaRYQ8mBvpNv6zsHfOUPm0L7NgGkgO3uHjgzJns5cXrszED37qg6AwhAAmnvwb7BsxenFGVMXTw72Hfw+Rv/T4AAJLhTwZ09/SfOj7xXnpSp90bOnejv6Szd+j8DCEDCbdferp6+Y8eHhkeuNTp5rTk0U9f/cfT6vxweOn6sr6dr766F/hcAAQgtEkAAQgABCAEEIAQQgBBAAAIQgAAEIAABCEAAAhCAAAQgAAEIQABCAAEIASSclvM9tdZygIjHy6sD6k3pg8nLq9n+IKTEjyXbHwAEIAABCEAAAhACCEAIIAAhgACEAAIQAghAAAIQgAAEIAABCEAAAhCAAAQgAAEIQAggACGAAIQAAhACCEAIIAABCEAAAhCAAAQgAAEIQAACEIAABCAAIYAAhAACEAIIQAggAAEIQAACEIAABCAAAcjnsf1BQLH9gQexgY692EDHg9iCzV5swQYQAghACCAAIYAAhAACEIAABCAAAQhAAAIQgAAEIAABCEAAAhACCEAIIAAhgACEAAIQAghAAAIQgAAEIAABCEAAAhCAAAQgAAEIQAggACGAAIQAAhACCEAAAhCAAAQgAAEIQACiMd7Nay/ezSsfb3cPKN7uLh/7gwQU+4MAhAACEAIIQAggACGAAAQgAAEIQAACEIAABCAAAQhAAAIQgACEAAIQAghACCAAIYAAhAACEIAABCAAAQhAAAIQgAAEIAABCEAAAhACCEAIIAAhgACEAAIQgAAEIAABCEAAAhCAAAQgAAEIQAACEAKIxtj+IKDY/sCD2EDHXmyg40FswWYvtmADCAEEIAQQgBBAAEIAAQhAAAIQgAAEIAABCEAAAhCAAAQgAAEIAQQgBBCAEEAAQgABCAEEIAABCEAAAhCAAAQgAAEIQAACEIAABCAEEIAQQABCAAEIAQQgAAEIQHLFmxXtxZsV5ePdvAHFu3nl4+3uAcXb3QFCAAEIAQQgBBCAEEAAAhCAAAQgAAEIQAACEIAABCAAAQhAAEIAAQgBBCAEEIAQQABCAAEIQAACEIAABCAAAQhAAAIQgAAEIAABCAEEIAQQgBBAAEIAAQhAAAIQgAAEIAABCEAAAhCAAAQgAAEIAURjbH8QUGx/4EFsoGMvNtDxILZgsxdbsAGEAAIQAghACCAAIYAABCAAAQhAAAIQgAAEIAABCEAAAhCAAIQAAhACCEAIIAAhgACEAAIQgAAEIAABCEAAAhCAAAQgAAEIQADieo9XVz/3ZTLfc9XVjwOEqEgBhAggRAAhAggRQIgAQgQQIoAQAYQIIEQEECKAEAGECCBEACECCBFAiABCBBAigBARQIgAQgQQIoAQAYQIIEQAIQIIEUCICCBEACECCBFAiABCBBAigBABhAggRAAhIoAQAYQIIEQAIQIIEUCIAEIEECKAEBFAiABCBBAigBABhAggRAAhAggRQIgAQkQAIQIIEUCIAEIEECKAEAGECCBEACEigBABhAggRAAhAggRQIgAQgQQIoAQAYSIAEIEECKAEAGECCBEACECCBFAiABCRAAhAggRQIgAQgQQIoAQAYQIIEQAIQIIEQGECCBEACECCBFAiABCBBAigBABhKjg/T8gQhtNiqIiFAAAAABJRU5ErkJggg=="};var t={},e=g.data.map((function(A){return A.judgement})),s=n.Vw.majority(e);B.setButtonImage(B._display_image[s]),B.dataparams=[g,Q],g.repcount;var w=new a.Layout(B.button_subwindow);w.setRect("Title",new a.Pos(0,0),new a.Pos(100,10),new a.RU_DataViewText),w.setRect("PercentBandwidth",new a.Pos(70,60),new a.Pos(30,20),(new a.RU_DataViewNumberBlock).setTitle("PercentBandwidth").setOptions({display_title:!1,text_align:"left",draw_bar:["left"],padding:{left:10}}).setDataAnalysisFunction((function(A){var g=A,Q=g.data.map((function(A){return A.data.expected_bandwidth})),I=g.data[0].data.Memory_Target_Bandwidth,E=void 0;return toplevel_use_mean?E=Math.round(100*n.Vw.mean(Q)/I):toplevel_use_median?E=Math.round(100*n.Vw.median(Q)/I):n.tV.assert("Undefined mode",!1),n.tV.assert("is number",E instanceof Number||"number"==typeof E),E})).setColorScaling((function(A){return 100-A})));var d=(0,C.Z)(B);return n.tV.assert("Valid bandwidth",B.Memory_Target_Bandwidth>0),w.setRect("Bandwidth",new a.Pos(0,60),new a.Pos(70,20),(new a.RU_DataViewFormLayout).setTitle("Bandwidth").setDataAnalysisFunction((function(A){var Q=A,I=Q.data.map((function(A){return A.data.expected_bandwidth})),E=Q.data.map((function(A){return A.data.datasize})),C=Q.data.map((function(A){return A.data.input_datasize})),B=Q.data.map((function(A){return A.data.bytes_from_l3})).map((function(A){return n.Vw.sum(A)})),t=Q.data.map((function(A){return A.data.bytes_from_mem})).map((function(A){return n.Vw.sum(A)})),e=g.repcount;if(all_analyses_global){var a=E.length/e;E=n.tV.createChunks(E,a,n.Vw.sum),C=n.tV.createChunks(C,a,n.Vw.sum),E=n.tV.createChunks(E,a,n.Vw.sum),B=n.tV.createChunks(B,a,n.Vw.sum),t=n.tV.createChunks(t,a,n.Vw.sum)}var i={};return toplevel_use_mean?i={title:"Bandwidth",value:n.tV.valueToSensibleString(n.Vw.mean(I),"programmer","B/c")}:toplevel_use_median?i={title:"Bandwidth",value:n.tV.valueToSensibleString(n.Vw.median(I),"programmer","B/c")}:n.tV.assert("Undefined mode",!1),{fontsize:16,rows:[i,{title:"Target Bandwidth",value:n.tV.valueToSensibleString(d.Memory_Target_Bandwidth,"programmer","B/c")},{title:"Bytes processed (SA)",value:n.tV.valueToSensibleString(n.Vw.median(E),"programmer","B")},{title:"Bytes imported into scope (SA)",value:n.tV.valueToSensibleString(n.Vw.median(C),"programmer","B")},{title:"Bytes requested from L3",value:n.tV.valueToSensibleString(n.Vw.median(B),"programmer","B")},{title:"Bytes requested from memory",value:n.tV.valueToSensibleString(n.Vw.median(t),"programmer","B")}],padding:{left:10,right:10,top:0,bottom:0},rawdata:A}}))),w.setRect("Graph",new a.Pos(0,10),new a.Pos(70,50),new a.RU_DataViewBarGraph({type:"horizontalBar",xAxes:[{type:"linear",display:!0,position:"bottom",id:"data-axis",gridLines:{display:!1},ticks:{beginAtZero:!0},scaleLabel:{labelString:"Misses",display:!0}},{type:"linear",display:!1,ticks:{max:1,min:-1},id:"corr-axis",position:"top",gridLines:{display:!1},scaleLabel:{labelString:"Correlation",display:!0}}],yAxes:[{display:!1,position:"left",id:"thread-axis",gridLines:{display:!0},scaleLabel:{labelString:"Thread",display:!0}}]}).setDataAnalysisFunction((function(A){if(null!=A){for(var g=A.data.map((function(A){return A.data.L2_TCM})),Q=A.data.map((function(A){return A.data.L3_TCM})),E=A.data.map((function(A){return A.data.TOT_CYC})),C=(A.data.map((function(A){return A.data.mem_bandwidth})),A.data.map((function(A){return A.data.l3_bandwidth})),a.RU_DataViewBarGraph.colorList().slice(0,g[0].length+1+2)),B=[],t=function(A){var Q,I=[],E=i(g[0]);try{for(E.s();!(Q=E.n()).done;)Q.value,I.push([])}catch(A){E.e(A)}finally{E.f()}var C,B=i(A);try{for(B.s();!(C=B.n()).done;)for(var t=C.value,e=t[0],a=t[1],n=0;n<e.length;++n)I[n].push([e[n],a[n]])}catch(A){B.e(A)}finally{B.f()}return I},e=t(n.Vw.zip(g,E)).map((function(A){return n.Vw.sample_corr(A[0],A[1])})),r=t(n.Vw.zip(Q,E)).map((function(A){return n.Vw.sample_corr(A[0],A[1])})),o=(n.Vw.mean(e),n.Vw.mean(r),0),s=0,w=[g,Q];s<w.length;s++){var d=w[s],l="[Unknown]";d==g&&(l="L2_TCM"),d==Q&&(l="L3_TCM");var u=0;toplevel_use_mean?u=n.Vw.zip2d(d).map((function(A){return n.Vw.mean(A)})):toplevel_use_median?u=n.Vw.zip2d(d).map((function(A){return n.Vw.median(A)})):n.tV.assert("Undefined mode",!1),B.push({label:l,xAxisID:"data-axis",yAxisID:"thread-axis",data:u,backgroundColor:C[o]}),o++}return C[o],C[o+1],display_memory_correlation&&(B.push({label:"L2 corr.",xAxisID:"corr-axis",data:e,backgroundColor:C[o],hidden:!0}),B.push({label:"L3 corr.",xAxisID:"corr-axis",data:r,backgroundColor:C[o+1],hidden:!0})),{labels:(0,I.Z)(Array(g[0].length).keys()).map((function(A){return"Thread "+A.toString()})),datasets:B}}})).linkMouse(B.button_subwindow).changeGraphOptions((function(A){A.options.title.text="Cache misses (mean over all runs)",A.options.title.display=!1,A.options.legend={position:"top",display:!0}}))),t.PercentBandwidth=g,t.Title=new a.DataBlock({fontsize:32,text:"Memory performance",color:"black",align:"center"},"Text"),t.Graph=g,t.Bandwidth=g,w.setDataBinding(t),B.button_subwindow.setLayout(w),B.setOnEnterHover((function(A){B.color="#FF0000",B.button_subwindow_state="open"})),B.setOnLeaveHover((function(A){B.color="orange",B.is_locked_open||(B.button_subwindow_state="collapsed")})),B.setOnClick((function(A,g){B.is_locked_open=!B.is_locked_open})),B.setDefaultDblClick(),B}return o}(a.Button)}}]);
-//# sourceMappingURL=626.js.map
\ No newline at end of file
diff --git a/dist/626.js.map b/dist/626.js.map
deleted file mode 100755
index 9ad1c27b..00000000
--- a/dist/626.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack://@spcl/sdfv/./renderer_dir/memory_button.js"],"names":["MemoryButton","ctx","all_mem_analyses","target_bw","ObjectHelper","Memory_Target_Bandwidth","Number","_display_image","databinding","judgements","data","map","x","judgement","majority","MathHelper","setButtonImage","dataparams","repcount","layout","Layout","button_subwindow","setRect","Pos","RU_DataViewText","RU_DataViewNumberBlock","setTitle","setOptions","display_title","text_align","draw_bar","padding","left","setDataAnalysisFunction","d","expected_bandwidth","ret","undefined","toplevel_use_mean","Math","round","toplevel_use_median","setColorScaling","transthis","RU_DataViewFormLayout","datasize","input_datasize","bytes_from_l3","bytes_from_mem","all_analyses_global","chunksize","length","val","title","value","fontsize","rows","right","top","bottom","rawdata","RU_DataViewBarGraph","type","xAxes","display","position","id","gridLines","ticks","beginAtZero","scaleLabel","labelString","max","min","yAxes","l2misses","L2_TCM","l3misses","L3_TCM","tot_cyc","TOT_CYC","colors","mem_bandwidth","l3_bandwidth","slice","datasets","thread_group_func","z1","thread_grouped_z1","push","run_tuple","l2ms_per_thread","cycs_per_thread","i","l2corr","l3corr","tcm","labelstr","tmp","label","xAxisID","yAxisID","backgroundColor","display_memory_correlation","hidden","labels","Array","keys","toString","linkMouse","changeGraphOptions","options","text","legend","DataBlock","color","align","setDataBinding","setLayout","setOnEnterHover","p","button_subwindow_state","setOnLeaveHover","is_locked_open","setOnClick","mb","setDefaultDblClick","Button"],"mappings":"quCAMMA,E,wcACF,WAAYC,EAAKC,EAAkBC,GAAW,sBAC1C,cAAMF,GAENG,YAAoB,kBAAmBD,EAAY,GACnD,EAAKE,wBAA0B,IAAIC,OAAOH,GAE1C,EAAKI,eAAiB,CAClB,EAAK,i5OACL,KAAM,07ZAGV,IAAIC,EAAc,GAEdC,EAAaP,EAAiBQ,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEC,aAC9CC,EAAWC,cAAoBN,GACnC,EAAKO,eAAe,EAAKT,eAAeO,IAExC,EAAKG,WAAa,CAACf,EAAkBC,GAEtBD,EAAiBgB,SAAhC,IAGIC,EAAS,IAAIC,SAAO,EAAKC,kBAC7BF,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,GAAI,IAAIA,MAAI,IAAK,IAAK,IAAIC,mBAC7DL,EAAOG,QAAQ,mBAAoB,IAAIC,MAAI,GAAI,IAAK,IAAIA,MAAI,GAAI,KAAK,IAAIE,0BAAyBC,SAAS,oBAAoBC,WAAW,CACtIC,eAAe,EACfC,WAAY,OACZC,SAAU,CAAC,QACXC,QAAS,CAAEC,KAAM,MAClBC,yBAAwB,SAAAC,GACvB,IAAItB,EAAIsB,EAEJC,EAAqBvB,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKyB,sBAC5ChC,EAAYS,EAAEF,KAAK,GAAGA,KAAKL,wBAE3B+B,OAAMC,EAUV,OARGC,kBACCF,EAAMG,KAAKC,MAA4C,IAAtCzB,UAAgBoB,GAA6BhC,GAC1DsC,oBACJL,EAAMG,KAAKC,MAA8C,IAAxCzB,YAAkBoB,GAA6BhC,GAC/DC,YAAoB,kBAAkB,GAE3CA,YAAoB,YAAagC,aAAe9B,QAAwB,iBAAP8B,GAE1DA,KACRM,iBAAgB,SAAA9B,GAAC,OAAI,IAAMA,MAC9B,IAAI+B,GAAY,UA/C0B,OAgD1CvC,YAAoB,kBAAmB,EAAKC,wBAA0B,GACtEc,EAAOG,QAAQ,YAAa,IAAIC,MAAI,EAAG,IAAK,IAAIA,MAAI,GAAI,KAAK,IAAIqB,yBAAwBlB,SAAS,aAAaO,yBAAwB,SAAAC,GACnI,IAAItB,EAAIsB,EAEJC,EAAqBvB,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKyB,sBAC5CU,EAAWjC,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKmC,YAClCC,EAAiBlC,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKoC,kBAExCC,EAAgBnC,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKqC,iBAAepC,KAAI,SAAAC,GAAC,OAAIG,SAAeH,MAC9EoC,EAAiBpC,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKsC,kBAAgBrC,KAAI,SAAAC,GAAC,OAAIG,SAAeH,MAIhFM,EAAWhB,EAAiBgB,SAChC,GAAG+B,oBAAqB,CACpB,IAAIC,EAAYL,EAASM,OAASjC,EAClC2B,EAAWzC,kBAA0ByC,EAAUK,EAAWnC,UAC1D+B,EAAiB1C,kBAA0B0C,EAAgBI,EAAWnC,UACtE8B,EAAWzC,kBAA0ByC,EAAUK,EAAWnC,UAE1DgC,EAAgB3C,kBAA0B2C,EAAeG,EAAWnC,UACpEiC,EAAiB5C,kBAA0B4C,EAAgBE,EAAWnC,UAG1E,IAAIqC,EAAM,GASV,OAPGd,kBACCc,EAAM,CAAEC,MAAO,YAAaC,MAAOlD,2BAAmCW,UAAgBoB,GAAqB,aAAc,QAErHM,oBACJW,EAAM,CAAEC,MAAO,YAAaC,MAAOlD,2BAAmCW,YAAkBoB,GAAqB,aAAc,QAE1H/B,YAAoB,kBAAkB,GACpC,CACHmD,SAAU,GACVC,KAAM,CACFJ,EACA,CAAEC,MAAO,mBAAoBC,MAAOlD,2BAAmCuC,EAAUtC,wBAAyB,aAAc,QACxH,CAAEgD,MAAO,uBAAwBC,MAAOlD,2BAAmCW,YAAkB8B,GAAW,aAAc,MACtH,CAAEQ,MAAO,iCAAkCC,MAAOlD,2BAAmCW,YAAkB+B,GAAiB,aAAc,MACtI,CAAEO,MAAO,0BAA2BC,MAAOlD,2BAAmCW,YAAkBgC,GAAgB,aAAc,MAC9H,CAAEM,MAAO,8BAA+BC,MAAOlD,2BAAmCW,YAAkBiC,GAAiB,aAAc,OAGvIjB,QAAS,CAACC,KAAM,GAAIyB,MAAO,GAAIC,IAAK,EAAGC,OAAQ,GAC/CC,QAAS1B,OAIjBf,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,IAAK,IAAIA,MAAI,GAAI,IAAK,IAAIsC,sBACzD,CACIC,KAAM,gBACNC,MAAO,CAAC,CACJD,KAAM,SACNE,SAAS,EACTC,SAAU,SACVC,GAAI,YACJC,UAAW,CACPH,SAAS,GAEbI,MAAO,CACHC,aAAa,GAEjBC,WAAY,CAAEC,YAAa,SAAUP,SAAS,IAC/C,CACCF,KAAM,SACNE,SAAS,EACTI,MAAO,CACHI,IAAK,EACLC,KAAM,GAEVP,GAAI,YACJD,SAAU,MACVE,UAAW,CACPH,SAAS,GAEbM,WAAY,CAAEC,YAAa,cAAeP,SAAS,KAGvDU,MAAO,CAAC,CACJV,SAAS,EACTC,SAAU,OACVC,GAAI,cACJC,UAAW,CACPH,SAAS,GAEbM,WAAY,CAAEC,YAAa,SAAUP,SAAS,OAGvD/B,yBAAwB,SAAArB,GACvB,GAAS,MAALA,EAAJ,CAyCA,IAxCA,IAAI+D,EAAW/D,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKkE,UAClCC,EAAWjE,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKoE,UAClCC,EAAUnE,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKsE,WAIjCC,GAHSrE,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKwE,iBACxBtE,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKyE,gBAEtBtB,kCAAgCuB,MAAM,EAAGT,EAAS,GAAGxB,OAAS,EAAI,IAE3EkC,EAAW,GAEXC,EAAoB,SAAAC,GACpB,IAD0B,EACtBC,EAAoB,GADE,IAEbb,EAAS,IAFI,IAE1B,2BAA0B,QACtBa,EAAkBC,KAAK,IAHD,wCAKLF,GALK,IAK1B,2BAII,IAJqB,IAAjBG,EAAiB,QACjBC,EAAkBD,EAAU,GAC5BE,EAAkBF,EAAU,GAExBG,EAAI,EAAGA,EAAIF,EAAgBxC,SAAU0C,EACzCL,EAAkBK,GAAGJ,KAAK,CAACE,EAAgBE,GAAID,EAAgBC,KAV7C,8BAa1B,OAAOL,GAOPM,EAHoBR,EADfvE,SAAe4D,EAAUI,IAIHpE,KAAI,SAAAC,GAAC,OAAIG,iBAAuBH,EAAE,GAAIA,EAAE,OAGnEmF,EADoBT,EAAkBvE,SAAe8D,EAAUE,IACpCpE,KAAI,SAAAC,GAAC,OAAIG,iBAAuBH,EAAE,GAAIA,EAAE,OAMnEiF,GAHc9E,UAAgB+E,GAChB/E,UAAgBgF,GAE1B,GACR,MAAgB,CAACpB,EAAUE,GAA3B,eAAsC,CAAjC,IAAImB,EAAG,KACJC,EAAW,YACZD,GAAOrB,IAAUsB,EAAW,UAC5BD,GAAOnB,IAAUoB,EAAW,UAE/B,IAAIC,EAAM,EAEP5D,kBACC4D,EAAMnF,WAAiBiF,GAAKrF,KAAI,SAAAC,GAAC,OAAIG,UAAgBH,MACjD6B,oBACJyD,EAAMnF,WAAiBiF,GAAKrF,KAAI,SAAAC,GAAC,OAAIG,YAAkBH,MACtDR,YAAoB,kBAAkB,GAE3CiF,EAASI,KAAK,CAAEU,MAAOF,EAAUG,QAAS,YAAaC,QAAS,cAAe3F,KAAMwF,EAAKI,gBAAiBrB,EAAOY,KAClHA,IAiBJ,OAdeZ,EAAOY,GACPZ,EAAOY,EAAI,GAEvBU,6BACClB,EAASI,KAAK,CAAEU,MAAO,WAAYC,QAAS,YAAyC1F,KAAMoF,EAAQQ,gBAAiBrB,EAAOY,GAAIW,QAAQ,IACvInB,EAASI,KAAK,CAAEU,MAAO,WAAYC,QAAS,YAAyC1F,KAAMqF,EAAQO,gBAAiBrB,EAAOY,EAAI,GAAIW,QAAQ,KAG/H,CACZC,QAAQ,OAAKC,MAAM/B,EAAS,GAAGxB,QAAQwD,QAAShG,KAAI,SAAAC,GAAC,MAAI,UAAYA,EAAEgG,cACvE,SAAYvB,OAKjBwB,UAAU,EAAKxF,kBAAkByF,oBAAmB,SAAAlG,GACnDA,EAAEmG,QAAQ1D,MAAM2D,KAAO,oCACvBpG,EAAEmG,QAAQ1D,MAAMW,SAAU,EAC1BpD,EAAEmG,QAAQE,OAAS,CACfhD,SAAU,MACVD,SAAS,OAKjBxD,EAAW,iBAAuBN,EAClCM,EAAW,MAAY,IAAI0G,YAAU,CAAE3D,SAAU,GAAIyD,KAAM,qBAAsBG,MAAO,QAASC,MAAO,UAAY,QACpH5G,EAAW,MAAYN,EACvBM,EAAW,UAAgBN,EAE3BiB,EAAOkG,eAAe7G,GAGtB,EAAKa,iBAAiBiG,UAAUnG,GAEhC,EAAKoG,iBAAgB,SAAAC,GAAO,EAAKL,MAAQ,UAAW,EAAKM,uBAAyB,UAClF,EAAKC,iBAAgB,SAAAF,GAAO,EAAKL,MAAQ,SAAe,EAAKQ,iBAAgB,EAAKF,uBAAyB,gBAC3G,EAAKG,YAAW,SAACJ,EAAGK,GAAS,EAAKF,gBAAkB,EAAKA,kBAEzD,EAAKG,qBA3OqC,E,UADvBC","file":"626.js","sourcesContent":["// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport { Button, Layout, Pos, RU_DataViewText, RU_DataViewFormLayout, RU_DataViewNumberBlock, RU_DataViewBarGraph, DataBlock } from \"./renderer_util.js\";\nimport { MathHelper, ObjectHelper } from \"./datahelper.js\";\n\n\n\nclass MemoryButton extends Button {\n    constructor(ctx, all_mem_analyses, target_bw) {\n        super(ctx);\n\n        ObjectHelper.assert(\"Valid bandwidth\", target_bw > 0.0);\n        this.Memory_Target_Bandwidth = new Number(target_bw);\n\n        this._display_image = {\n            \"1\": \"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwQAADsEBuJFr7QAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAAcJQTFRFz8/Pmpqa1//cz//V0//Z1f/b3f/h4v/m5//qxv/Nyf/QzfnS7P/umfqmxP/Lw8PD7//xuv/Dvf/F8f/z8//1t//A9P/1s/+9r/+6rP+3rf23qP+zg4ODpf+xg4ODov+u/P/9AAAAAAQAAAgBAAwBABACABQCABgDABwDACAEACQEACgFACwFADAGADQGADgHADwHAEAIAEQIAEgJAEwJAE4JAFAKAFQKAFgLAFwLAGAMAGQMAGgNAGwNAHAOAHQPAHgPAHwQAIAQAIMQAIcRAIsRAI8SAJMTAJcTAJsUAJ8UAKMVAKcVAKsWAK8WALMXALcXALsYAL8YAMMZAMQZAMcZAMsaAM8aANMbANcbANscAN8cAOMdAOcdAOseAO8eAPMfAPcfAPsgAP8hAv0iBPsjCPcmCvUoDPMpEO8sEu0uGuU0HOM1HuE3It06JiYmJv9CKNc+LNNBOMdKPMNNP79QR7dWSf9gS7NZV6diW6NlXaFmZZlsZ5dub490cY11c4t3d4d6eYV7fYF+f39/f4F/f7OFf72Hf9iKf/qOf/+PgICAhJ+IkO2ckpKSnp6env+qpNirvb++v7+/zs7O////Ovgw2AAAACF0Uk5T7fDw8fHx8fHx8vLy8vPz9PT19fX19vb3+Pr6+/z8/f7+BMEvSwAAE5tJREFUeNrt3fmDVWUdx3EHlMUMhUAwJJph2BfZIhRCtogtliFAFpmRa7bntJfZim1MmaXn/00TUZbLfO+959xznue83j+n3GnOq7mfp+E+jxWSuvaY/wokQCRAJEAkQCRAJEAkQCRAJEAkASIBIgEiASIBIlXSqtvzAZG6tGS6M70EEOmhzZ/udDrTqwCRHtbtzkdN9/s2CxDlPUCmOx/X59ssQJRziz/x8aGQlYBI9zTvUx8fvc1aAIj0wAD5lMgiQKS7rZ7u3CdkJSDSgwOk77dZgKgVA6Tft1mAqCUDpL+3WYCoLQOkr7dZgKg1A6Sft1mAqEUDpPe3WYCoTQOk57dZgKhVA6TXt1mAKMOWzeqj0/nVlwFRO5sT8DE9108QGSBdfaywQWSAdO12AYgMkK4/QJYCIgOkq4/HC0BkgHTzsbwARAZINx+rC0BkgAw60AFRKwfIE4DIAClhgAAiAwQQtaXlJQ8QQJRTT5Q9QACRAQKIDJD+BgggMkAAkQFy5wfIHEBkgHT1sawARAZIaQMEEBkggMgA6W+AACIDBBDl3nsVDRBAlEMrqhoggCiD5lY2QABR+i2drmyAAKJ2DPTVBSAyQMoeIICoFQNkHiAyQLr6WFwAIgOk/AECiAwQQGSAAKL29YWqBwggMkAAUZ49V/kAAUTp9mT1AwQQJdszQxgggMgAAUQGCCAyQO7/ATIfEBkgXX0sKQCRAdLNx6oCEBkgVQ4QQGSAAKK8empoAwQQGSCAKKtWDm+AAKLkWjjEAQKIDBBAZIAAIgOk9AECiDIcIAsAkQHS1ceiAhAZIN18rCwAkQEylAECiBJq0dAHCCBKpwXDHyCAyAABRAYIIDJASh8ggMgAAUQGCCAyQACRAdL1B8hTgMgA6epjYQGIDJChDhBAZIAAoqRbUt8AAUSNb36NAwQQGSCAKOFW1TlAAJEBAogMEEDU1gHyXAGIDJA6BgggSn6APAOIDJCuPp4sAJEBUs8AAUQGCCBKscUNGCCAqKnNa8IAAUQGCCBKr9WNGCCAyAABRAYIIGrZAFlRACIDpNYBAohSHSBLAZEB0tXH3AIQGSA1DxBAZIAAooRa1qQBAoga1pxGDRBAZIAAIgMEEBkggMgAebwARAZINx/LC0BkgHTzsboARAZIMwY6IEpsgDwBiAyQxgwQQGSAAKLmt7yRAwQQNaMnmjlAAJEBAogMEEBkgACi1g6QOYDIAOnqY1kBiAyQhg0QQGSAACIDBBAl2bPTTR4ggCiBgb66AETtbEWzBwggqrW5DR8ggKjOljZ9gAAiAwQQGSCAKMsBMg8QGSBdfSwuAJEB0tQBAogMEEBkgACilHomjQECiAwQQNS0nktkgACiOnoylQECiAwQQGSAACIDBBC1ZIDMB0QGSFcfSwpANHDvPZvpAFlVAKJBm397+nZ6rzqtAQJI2m/lm3PWk+kAASTZPv48wpruzOi7pxIbIICk2so7T9r0IgMEkB57emTk+S+V2jsN62+37/4v8fTf/9KkV/bvEOtkBkieQEZG827NqXueqKNNem3vPOobszC5AQJIgq2/eN8ztS8RIAkOEEDSa+v1+x+qmzvSABIZICsLQAAZpN1TDz5WNzalACTFAQJIah28+bDn6sp484GEBsgCQAAZoLGTXZ6sc2NNBxIaIE08swYkoXl+oeuz9Y2mA0lzgACSUluuPeLp2t9sIIkOEEASatfUo56umzubDGRRogMEkHQ6cPPRz9fk5uYCWZDqAAEkmXl+YtYn7MraxgJJdoAAkkjrJmZ/xDrnxxoKJN0BAkgix1dXO5FONBNIwgMEkEQ6EwLSOdBEICkPEEASafxyCMjNXQ0EkvIAASSZN1mvhoRMbW4ckKQHCCDJtG0qJOTquoYBCQ2QpwABZND2xmbIhbFGAQkNkIUFIIAM3OGYkJONApL4AAEkpU7HhBxsEJDUBwggSR1lXYwdZe1uDJAlqQ8QQNI6yroeO8ra0hAg85MfIICk1dbYUda19c0Akv4AASSx9sRmyMU1TQCyKv0BAkhqHYoJOdUAIDkMkDyBPJYxkNFTMSGHagfyuYCPzucLQGbtg/dL7t2cgYxdiAnZU8/Le/OTb8J/Ij7e+Oes38wPAHl/puxyBjK6/lrsKGtrPS/vzrfgd9+OvMjfzP69fB8QQHprS+wo69X1NQL58/cjL/FnM4AAUn67b4aEXBqvD8hPIy/wB7cAAaSKDsZmyOnagPw68vLe+P0MIIBU0omYkMM1AXm7rAECCCD9HWVNxITsrQXIn75X1gABBJD+Whf7FIepF+oA8pPSBggggPTZ5uBR1obhA/lleQMEEED6bVfsKOvysI+yZt5+vbwBAgggffe12Aw5M+SXVeoAAQSQ/jseE3JkuK8qNEB+eAsQQCo/yjofE/LiMF/Ugcgr+s4fZgABpPLWXon9Fdztw3tJ20LL6K0ZQAAZxlHWZOwoa+PQyIZ+kfLnM4AAMpR2xo6yXhnWUVboI4R/dAsQQIbUvtgMOTucT5MrfYAAAsiAHYsJOTqM17K99AECCCCDHmWdiwnZN4Rff7le+gABBJBBGw8eZe2o/JWcK3+AAALIwG26ERJyY1PFr+NgBQMEEECG9da/c2W8Aa/irRlAABl2L8VmyLkqj7KqGSCAAFJGR2NCjtc9QH58CxBA6jjKOhsTsr/eAfLdP84AAkgtR1mvxI6ydtY5QF7/7QwggNTTxtgdn5PV3PEZGyC/mAEEkLp64bXYUdbapAYIIICU1YuxGTJRwVHW4coGCCCAlNaRmJATpf/BO6sbIIAAUl5nYkIOlPzHrn+1ugECyEe5/qCko6zLsaOsXeUeMUf+4u/0v/7b7zfT9QcVfEntBBL83/LOVKlHWZEBMv3FlJ+m/ICMtBTI6LbYp8ldLfFihMgAmV5dAAJIE9obmyEXxob6Q+t2AQggzehwTMjJoQ6QOYAA0pROx4QcHOIAWVYAAkhjjrIuxo6ydhsggLTzKOt67ChriwECSCvbGjvKuj7wUVYbBgggGbYnNkMurhnwzznaggECSI4digk5NdifsqvTggECSJadjAk5NMifseFGGwYIIFk2diEmZE/Ff0T6AwSQTI+yrsWOsrYZIIC0si3BOz77PcpqywABJNd2xz5N7lJ/nybXmgECSLa9HJshp6sbIPMAAaTBnYgJOVzVAFlcAAJIk4+yJmJC9hoggLSydVdDQF57wQABpJVtDh5lbejtJ9PFFg0QQLJuV+wo63JPR1nH2jRAAMm7/bEZcqbkX4XMZ4AAknnHY0KOhP+FGydbNUAAyf0o63xMyEvRf9+ldg0QQHJvbfCOz+0GCCDtPMqajB1lbTRAAGllO2JHWa8EjrLaN0AAaUH7YjPk7KyfJhcbIPMBASStjsWEfL2UAbKkAASQxI6yzsWE7Bt8gHT+UQACSGqNB4+ydgw8QDp/BQSQ9NoUuxjhxqbu/4o1odtHTr8DCCAJtj12lHVlfLD/T/7qOCCAJNlLsRlyrttRVuhihde2jgICSJodjQk53uU9Wug35/ePApLEl4TDQ46yzsaE7B9ggIwCUkUu8RzOUdYrsaOsnf0PkA//k2+W/c10iadroIfUhthR1uTm/gbI1Nb//2fL/l66BhqQYfXCa7GjrLV9DZA7vzEPCCDJ9mJshkyM9TFAPrn2EBBA0u1ITMiJ3gfI3V8GBgSQhDsTE3Kg5wFy90Y3QABJ+SjrUuwoa9fdf2JzLwMEEEASb33sKGtqc0+Hw5+5dx0QQJJuW+zT5K7duRjhZE8DBBBAkm9vbIZcGAv/Ctc9V0oDAkjiHY4J+eht05YeBwgggGTQ6ZiQg70PEEAAyaA1F2NHWbt7HiCAAJLFUdb12MUIPZ13AQJINm2NHWX1c/8OIIBk0J6yfDzwF6wAASSHDpXj4/IaQADJspNl+Jh68GNQAAEki0JXOfdxASgggGRylHWt/AECCCD5tGWq9AECCCAZtftm2QMEEEBy6uWyBwgggGTViZIHCCCA5HWUNVHuAAEEkLxad7VPH5Pd7jQEBJCc2tznUdaeUUAAaUM7+zrKOjYKCCDtaH8fPi6NAQJIWzpe3gABBJAMj7LOlzZAAKki1x/U3NorZQ0Q1x8kkQt0ej3KulHSAHGBThKNeOR7bMfNcgYIIIDk2b5yBggggGTasTIGCCCAZHuUdS7m4+IYIIC0sfHQUdaNDaOAANLKNkYuRtg1CgggLW377EdZR0cBAaS1zXrXwYUxQABpcd8acIAAAkjWfWXAAQIIIHn/UtaAAwQQQPLuzGADBBBA8m7bYAMEEEAy7/xAAwQQQDJvw2QXH0dGAQFEo199uI9vjgECiD5s/8P+//TzUR+AAJL9z5AHhZwaHwUEEH3cpvt+831ybw//MCCA5N/uz3xk76sH144CAojuPc16+eTEtasTZw/tXNPbPwgIIAIEEAECiAABRIAAAggggAACCCCAAAIIIIAAAggggDTyS/KcApIREBfoZJQLdMrPFWw55Qo2QAQIIAIEEAECiAABBBBAAAEEEEAAAQQQQAABBBBAAAFEgAAiQAARIIAIEEAECCCAAAIIIIAAAggggAACCCCAAAIIIAIEEAECiAABRIAAAggggAACCCCAAAIIIIAAAggggAAiQKrL9QcZ5fqDBHKBTn25QCeBRjyngAACCCCAAAIIIIAAAggggAACCCCAACJAABEggAgQQAQIIIAAAggggAACCCCAAAIIIIAAAgggAgQQAQKIAAFEgAAiQAABBBBAAAEEEEAAAQQQQAABBBBAABEggAgQQAQIIAIEEEAAASTyJXlOAckIiAt0MsoFOuXnCraccgUbIAIEEAECiAABRIAAAggggAACCCCAAAIIIIAAAggggAAiQAARIIAIEEAECCACBBBAAAEEEEAAAQQQQAABBBBAAAEEEAECiAABRIAAIkAAAQQQQAABBBBAAAEEEEAAAQQQQAARINXl+oOMcv1BArlAp75coJNAI55TQAABBBBAAAEEEEAAAQQQQAABBBBAABEggAgQQAQIIAIEEEAAAQQQQAABBBBAAAEEEEAAAQQQAQKIAAFEgAAiQAARIIAAAggggAACCCCAAAIIIIAAAggggAgQQAQIIAIEEAECCCCAABL5kjyngGQExAU6gADyiFzBBggggAACCCCAAAKIAAFEgAAiQAARIIAAAggggAACCCCAAAIIIIAAAggggOgzvVn2b55+AAggOVX29/J9QAABBBBAAAEEEAECiAABRIAAIkAAESCAAAIIIIAAAggggAACCCCAAAIIIIAIEEAECCACBBABkhYQ1x9klL9RmEAu0Kkvfyc9gUY8p4AAAggggAACCCCAAAIIIIAAAggggAAiQAARIIAIEEAECCCAAAIIIIAAAggggAACCCCAAAIIIPq0EUAAESCACBBABAggAgQQQAABBBBAAAEEEEAAAQQQQAABBBABktiX5DmtrccAKT0fXp1R7/rw6tJz/UFGzbj+ABABAogAAUSAACJAAAEEEEAAAQQQQAABBBBAAAEEEEAAESCACBBABAggAgQQAQIIIIAAAggggAACCCCAAAIIIIAAAogAAUSAACJAABEggAACCCCAAAIIIIAAAggggAACCCCACJDqcv1BRrn+IIFcoFNfLtBJoBHPaW25gg0QAQKIAAFEgAAiQAABBBBAAAEEEEAAAQQQQAABBBBAABEggAgQQAQIIAIEEAECCCCAAAIIIIAAAggggAACCCCAAAKIAAFEgAAiQAARIIAAAggggAACCCCAAFLll+Q5rS2fzVt+Pt09o3y6e/m5HySj3A8CiAABRIAAIkAAESCAAAIIIIAAAggggAACCCCAAAIIIIAIEEAECCACBBABAogAAQQQQAABBBBAAAEEEEAAAQQQQAABRIAAIkAAESCACBBAAAEEEEAAAQQQQAABBBBAAAEEEEAESIW5/iCjXH+QQC7QqS8X6CTQiOe0tlzBBogAAUSAACJAABEggAACCCCAAAIIIIAAAggggAACCCCACBBABAggAgQQAQKIAAEEEEAAAQQQQAABBBBAAAEEEEAAAUSAACJAABEggAgQQAABBJDYl+Q5rS2frFh+Pps3o3w2b/n5dPeM8unugAgQQAQIIAIEEAECCCCAAAIIIIAAAggggAACCCCAAAKIAAFEgAAiQAARIIAIEEAAAQQQQAABBBBAAAEEEEAAAQQQQAQIIAIEEAECiAABBBBAAAEEEEAAAQQQQAABBBBAAAFEgFSY6w8yyvUHCeQCnfpygU4CjXhOa8sVbIAIEEAECCACBBABAggggAACCCCAAAIIIIAAAggggAACiAABRIAAIkAAESCACBBAAAEEEEAAAQQQQAABBBBAAAEEkKb39MjI81/S8Ht+ZORpQKQ2BYgEiASIBIgEiASIBIgEiASIBIgkQCRAJEAkQCRAJEAkQCRAJEAkQCQBIgEiASIBIgEiASIBIgEiASIJEAkQCRAJEAkQCRAJEAkQCRAJEEmASIBIgEiASIBIgEiASIBIgEgCRAJEAkQCRAJEAkQCRAJEAkQCRBIgEiASIBIgEiASIBIgEiASIJIAkQCRAJEAkQCRAJEAkQCRAJEAkQSIBIgEiASIBIgEiASIBIgEiCRAJEAkQCRAJEAkQCRAJEAkQCRAJAEiASIBIgEiASIBIgEiASIBIrW8/wGZ0JDqvSQHhgAAAABJRU5ErkJggg==\",\n            \"-1\": \"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwgAADsIBFShKgAAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAAlJQTFRF8Q0N8dbW/8bG/8DA/7u7/729/7W1/7Ky/7Cw/6ys/6mp9q+v/6am/6Ojz8/P/6Cg/56e/5qampqa/9fX/9ra/5eX/8/P/9PT/9XV/93d/9/f/+Li/+Xl/+fn+e7u/8bG/8nJ/8zM/+jo/+zsqysr/5WV/8TE/+7uw8PD/5GR/8HB/+/v+pSU+/j4/7q6/729//Hx//Pz/4yM/7e3//T0yCkpyYyM/4uL/7Oz/6+v/4iI/6ys/4WF/6iog4OD/YWF/6Wlg4ODhIOD/Sgo/4ODwICA0YCA4ycn/6KiAAAABAAACAAADAAAEAAAFAAAGAAAHAAAIAAAJAAAKAAALAAAMAAANAAAOAAAPAAAQAAARAAASAAATAAAUAAAVAAAWAAAXAAAYAAAZAAAaAAAbAAAcAAAdAAAeAAAfAAAgAAAgICAgX19gwAAg3t7hXl5hwAAh3d3iXV1iwAAi3NzjXFxjwAAj29vkW1tkpKSkwAAlWlplwAAl2dnmWVlmwAAnWFhnwAAn19foV1dowAAo4GBpVlZpwAAp1dXqVVVqwAAq1NTrVFRrwAAr09PswAAs0tLtwAAt0dHuwAAu0NDvwAAvz8/v7+/wT4+wwAAxTo6xwAAxzg4ywAAyzQ0zLCwzTIyzs7OzwAAzzAw0wAA0yws1wAA2SYm2wAA3wAA3yAg4ERE4wAA5Roa5ZiY5wAA5xgY6RYW6wAA6xQU7RIS7wAA7xAQ8Q4O8wAA8wwM9wAA9wgI+QAA+QYG+wAA+wQE+4KC/QIC/wAA/yYm/39//56e////55zYuAAAAEl0Uk5T3+Dh4uPj5ebn6Onq6uvt7e7v8PDw8fHx8fHx8fHx8vLy8vLy8/Pz8/T09PT19fX19fX29vb39/f3+Pn6+/v8/Pz9/f39/v7+/oME4UMAACOBSURBVHja7d3/f1fVfcDxTjurGaIGEYFkYFgSNRvfZIuG6OiWbtxPAggRDIkRQogsimWzZZPR0VhWOtp0szR1LEs3U2qTLh2WyZamM673Xu//NTCofMmX+/mc9/l6X6+ffPgQH+RzP8+cc+6384WMiBbsC3wERAChvG2764v3Xqtq5bXq0+vVX//Hquv/8ot3bQMIFa8tv33vg3MY0jSJFyu58V/VP3jv3VsAQoFXc1/90igWxVJ/Xw1AKLjqlrVULmMeJy3L6gBCIdR0z1YhGXc62XpPE0DI22of0ELjdiYP1AKEfGt1s24btyhpXg0Q8mVSVdVmDsdNSNqqmgBCbrdtmXkbtyhZtg0g5Ghrmy3i+BxJ81qAkHOtTx3Q4f9AApAQq9nqjo7PB5IagJALOlpcw/GZkZYagBA6QjICEHRgBCAFqNYHHZ8ZqQMImazBGx2fGmkACJkaPFo94zFHpLUWIMTg4fcwAhAGD7vDyFqAkK7We63jUyPrAEI62hgAjzkiTwOEhGtqDoTHjZlWI0BIrjVt4ej41MhqgJBMj6Sh8Zgjsh4gpN66IHnMEdkEEIKHT6e0AMLkCiIACaNVwfOYI7IKIFR+jxaCh2tEAOJJqwvDw62TvgDxosa2IvH4hEhbI0AoZ9uLxuMTItsBQnlqSIvow5G74QHieg8XlMcckYcBQou1ua24POaWIpsBQgv2TLF5fELkGYDQ/K1K8WH7qghA3G0HPG4Q2QEQur11DB8u3KAFEBbnLNYB4lsb4XEHkY0AoblqmV3NO8+qBQhxbtetM74Aca1Gho9FBpFGgBS8BngsSuRJgBQ6rn0sJWQnQIrbCqZXOaZZjwKE1Tk5slYHCKtzDweROoCwOqdFiGwCSMHajo+yhDwLkEL1MT7KnWZtBghnr2gRIo8CpCBxa2JlQp4CSCHi4mClQnYAJPw2ML1y+XwvQCz3GDyUiDwGkKB7Ch9uL0QAYrVnExfnLQvn4l/3WYAE287ELRYtK6u+dFfTIn/hpru+VLWyxS0qeu/vBYjFXLg6+AmMJ6ru3lLm333L3VVPOAIlSbcAJMBqbH+5rtt4SHUfjtUPOaAkWQOQ4FqV2LXRsmyD3KnqZa12lSSPACSwnkws4qjX8Rt3Tb1FJNpu7wWInZ5OLOFou1/new8a72+zhETXU1QAKczp3Wsjx8oNBn62DSutjCSaTvcCpBg+krR1hcEfcEWreSN6TvcCxEKmL38kaX2T8R+yqd60ES1CABK6Dys67BjRIQQgxjN5eTBJt9ZZ/WHrtpo0knwMEHyUoaOlzoEfuLbFnBF5IQAxPOsw9mVJ0vXO/NTrDf7UTQDx2Udi6nvS3OjUD97YbMpI0gQQfCzFY5WDP7ypLUllhQAkOB9Ja52jP39da+KdEIAYLDUyt9rm8CewzchJrRQgnL9agMdG5z+FTfqJSJ7LAkg4PixullxWj2knIigEIKbSff3cFx5G1uty19QBEoYPn3hcb51mImJCAGImvffvJmmDd5+IZiJSQgDiv48k1fA43ceLvPznYx+ICD0fAhATaX1+MHlax185NXEa9SmdRJLtAPEknc+fJ6163nljBIjeF3cnGwHixzmbROPsarWmv7QhINlajYOIxIt7AaK9msTHtbkpIFpv9U1WA8T9tN1gonU7ZHNAdC7RkkaAuJ6uC+hJWpsFAkTjHikpQBxP1wXCRPNdV0aBZNkmXR/TToA4naYLIEmb7j1eDQPJNrdp+qSeBYjD6dkfx8R9JaaBaLtuqHiZCCA607O/mom9Ky0A0XVRJGkAiKNt0HPAN2WBAtG0EklqAFKcE7xJujYLFoimy4YpQJxMx4zByPTKHhA9ZzVUTmUBRFsbE9fm0z4AyRoSpxbqANHVikTD9Ko2Cx5IVqthmlX5DlQA8WcBonnDY1eAaJlmVXzPCUA0JX+HSdKQFQRIti5xZqEOED1tTzyeXlkHouHmrEqHX4D4sdI0Or2yD0TDNKvCy0cA0VFj4vX0ygUg2Xrxz7AGIIEu0JO0LiscEPmdIlKAONIzskdWw75JPgARf1Sgorc4AEQ+4SsgenZv9QGI9L0IySqAhDfBMr48dwiI9FI9BYgDyf7a0/PWK1+ACD+uXsFgDBDpZM/wJk9lhQYi/E6x5EmAWK7R8gENDYj0L5xGgAS0AKn8HrtwgGSPJDaXIQCRTfQMb7I6A0iWrRH9TJ8BiMVqRY9lbQaQ69VZ/FQB4uoEK0k3ZwCZa4vkRfUUINYSfIjQyuVzV4GIPj1Q3iv3ACLYZsGjuDMDyM0J3naSbAaIndrC8eEcEEkhbQCxktxzcLbnVy4CEZxlJesA4vcKPc0A4sjnCxCx5O7BSjYDROsSr4y3iwFEKrmN1qxe/3AYiOBVpvw3vgPEuQmAzevnbgPJVifGJ1kAEUrsHhOL9185D0Tuvqzcd5wAxLH5sb37d30AInf3e9IEEJNJXQKx9vyHJ0DktiRqA4jBHhY6bLaeH/QHiNgzhskKgHi3Qrf0/LlXQMSeU08BYiyhp97s32DiAxCpm07yvWoRIO4MIA7cYOIFEKmbTlKAGGq7wQMGELlfSNsBYiSh9zQkdQDJmdAl9Ty3LABEPZlTvObfT+0vEKlFXwoQA8nc/+DQCSwPgAidyspxSxZAHJkQpxlAXPzUAaLao4mp6TBAxJchSw8hAHHiV5ljCxAPgAgtQ1KAaE7kMRDXFiA+AJFZhiz59C1AXBhA0gwgjn70AFFL5AEF5xYgfgCpNTGEAMT+bzH3FiB+AJF5OCQFiMYk3vRTxhsEAHJrEu/JWGIIAYj1ASTNAOLu5w8Q6wPIWoBU3FrtQwhALP8Cy/dUAkAWaFOieQgBiN1TWG4uQPwBIrEMSR4DiLMDSJoBxOmDAJDKE9garJzXKANE1zpwsVf1AaTyBJ4DacsA4vZhAEjFNQn86toMEOUE3tm3yObQAKm4ZvXjsjEDiHoCG9+1AsTF1WGaAcT1IwEQe7+3XLxH0Usg6nctLvxGS4BY+7VV7pb2AFkw9VfrpwARbn0S8gTLMyACv62eBIhrh6QBIGI1aPt1BRBb0940A4hLv6/WAESyVp1XbwFSduovJ2sDiFO/sVozgDj1GysFiEtz3mQLQETbkuhZpgPEygDizk5SoQBR33kqBYg7S/Q0A4hzv7TWAsSVCa+rjxF6DUT54cJWgLjyyyrNAOLJUQGIhSW649cIfQWi5bAAhAEkFCBajgtAzC/R3X3O1nMgqk/fzrcJHkDKr6UAA4iXQJSHkBaAOHAYvBhA/ASiOoSkABGoJinAAOInEOXfXTUAsT7D8mMA8RSI6hDSAhDrv6XSDCAeHZwAgTxeXf3cl/X1Z4q/pP78T77sQV9Z7KdMvjLvn3muuvpx2wdf8U0Bd86xAgRSHemsfVrxTMlA5EODi/4Mgwv9sWrfh5AWgCjWq+jjajtAdNYsPMcCSJmdVQRyPAKIzrYJz7EAYnaGNbMHIHprlZ1jAcTsDOtMBBC91SWicyyAmJ1hdQLE7WX67XMsgJTXFTUfIxFAdLdKbQjZChCFXlQcQA4DxPUhJAWItu9NKOd4PQfSDBBrQMbUgJyKAKK/RqU5VrIeIBW3R3GG9QJAfJtjAaSc+tR8jEUAMZHam/cBUnnn1ID0A8SDIeTW92MBpIxKV5V8THcAxExqj+w0A6TCuopxFd1/ILVycyyAlNFxNSDdAPFjjrUNIDZO8l4pAcRUW5WO1DKA2DjJ69MMy3cgdWJzLIAYu5O3GyCezLEAUlknlXxMRQAxV73SIqQJIJU0qgTkJEAM1qQ0x6oCSAW1zyoB6QKIN3OsNoAYvwri1wzLfyD1QosQgOTuWIFmWP4DUZpjAaSShotzDisAIEpzrJs2sQ8QyHJN3xmlG7Fm2gsBZLk7XwOlt5s0OwTk3XeEe1PPV6ZTaQB5OyoEkDelD+a7FX+vVsjMsewDeedV6fR8ZY4oATlaDCDix/IdO3MsgJTfUCFe9wOQuUVILUDK7ZKKj8kIIKaBrFQ5YA8ApNzLhEoDyGmAGAeyQWQRApCcHVAC8hJAjAORWYQAJGdK72uY7QCIeSBtADEIROlW3vEIIOaB3C9xQy9AcvZ2MV4YFxIQpRfI3QOQ8lJ6a/UhgFgAorQI2QqQstqttEbfCxDfgKQAKavuAt3qHgyQeoAYAzKgAuQ8QKwAWZMAxBSQMypABgBiBYjKHCupA0g5Kb0S6wBAvAPy6cuxAJIvlc1tp0sAsQNE5ZmQFoCU0V6VAWQsAogdIMvUV+kAydXBQt2pGAyQDQlAzABRuhPrKEAsAVFZhABE7vsS1BuxAAKQ8jurAqQDIB4CSWoAkr+LCj4mIoDYAvKQwnG7DyD5m1L4oIcBYg3IaoVVej1AcldSmWENAsQaEPVFCEDypPROrF4fgSy+n+85gADk5npUgOzzj8f+kSV+ppH9AAHI5/WrAGn3jUfpxNIbPcyeKAEEIJ92QsHHZd987BvP95z9Ph+APKFwnncLQPJ2XgHIqGc+Xsp7X+b0Sx4AqVI4cncDJG8jCh/zOb98HMm/j9bsEfeB3K1w5O4FSN7eU/iYT3jlo7wnJwecB7JF4ULIg24A8WH7A5XrhP1ejR+KP5xD2x+or9Lr3QAinoYNdFROYvX4tP4od5/S2dvWIcud+zaonsZiC7Yc7VIB4tHGB/vKf27yf08N3twfAaSIQJSeJ/TnMkhpPFYtSSvtY4D4C0RlA+hpfwaQE7HFUk3fhhaA6AeicqeJP1vn7J8NEchKgOgHovLArT/XCUfiEIFUAUQ/kGMKB/6CLz564yCBfAkg+oEcVzjwQ74AGQ8TyF0KZxy2ASRfKhvcnvTER08cJpAmhUvpdwEkX8MFeJ5wOFAgKud5vwgQ/cvXI3742DMLkHnvVgSIZiCebC41EAMEIDaAHPQDyAWAAAQgC9Y+AxCAVNxo8EC6YoDcWRVA8jWpcOD3sQTxFshKgOgH4scGt6cBAhCAuHofFkAA4ngTAAFI5U0FD+QqQOapHiD5UjnwflwGiQGywN8JIAABCEAAAhCAAIQ1CEAAoqNJgACEs1hcB+EsFtdBKuoMQLgOApCFewUgAAHIwh0ECEAAwvMgAMl4HqSieKKQ50HsnOPxBAjPpM8TTxQC5NN4qwlA7ADx5K0m0dsAAYgNIJ68F8v2q3kBYi75LdiK8GZFpY1KAwXixpsVPdjEswjv5o0O2QWSaNrE0/9383qwDXQh3u4ejdkVomcb6ADe7u4BkELsDxJ1zYYIxP/9QTwA0qdw3P3ZYSo6FSKQKoDoB1KMPQqj9vcCBLISIPqBFGSX22h/+fukz56+ZZ/0H1WeJiAtANEPpCD7pFdyJuvwrf8D8WOpDCQFiH4gu1SAdHoEpOxbsgYigABE7aH0Hp+ARH+hdhUUIMUEovJQer9XQMoaQwaioIHUA8TEbRgn/AISHc777NTM4ch9IFsULqQ/CBATdyue8wxItD/fm6wn9kceALlb4cjdC5C8nS/GlcIbdZxa+pr67KmOyAcgCtcJ47sBkrcTCh/z5ci/upa6L2usa/4/6ByQJxRuxdoCkLz1F+VCyKeVDi82z5o4XIo8AaJ6Egsg2u818WSXwjvqXeg9Dhd6F/5DACkmkE4VIL2Rpz0/cOH2xcjshYHnF/sjACkmkJIKkMHI3zq6XzkzMnn9Fq3pyZEzr3R3LPHfA6SYQJSuFA5Hxck1IKsVLoPUAyR/FxWATADEGpCHFI7bfQDJ31mVOVYHQGwBUZhhJTUAyd+gCpAugHgI5MZrVgCSK5WHbuOjAAFI4ECUtgc4DRBLQDYkADEDROmZwjGAWAKyLAaIGSDRtMJHPV0CiB0grQpHrQUg5aT0VrUDALEDRGEJEi8DSDkp7XI5ABDvgCR1ACknpQ1mzgPECpA16mt0gOSsWwXIFECsAKmPAWIKyG6ltwbuBYgNIGkQQDzY/uB6V1SAHCoKkDelD+a7toBsdQaIeMu1HHqlLcpOFQXIcpe+CI0KS5D4nnCBVGs59CdVgIwXBUi1S1+E+xWOWNIEEIN3Y812AMR8bQJLEIDk7YDSKv0lgJgvBYhBIO1KQE4DxHgqdyoCpPwuqQCZBIjxVqocsAcAUm5DSkNIJ0B8mmEltQAptyNKQI4CxMslCEByp/RurPhtgBhuRQIQo0CiqypAZtoBYjaVZ0HiZoCU37DSENINEI+WIKsBUn7HlICcBIjRmmRmWADJX5cSkCmAGE3lVneAVHapcFZJSBdAfJlhxW0AqaRR5ljeAFGaYcVVAKmkk8yxvAGiNMP67FZegJRVb8x5LF+ApEJLEICU0R41IGcAYqy6BCDmgai9HCu+UgKIqbYqHallAKms48yxPAGiNMNKtgHExpWQIsyxHAFSKzbDAkg5lZRux4qnOwBiphal49QMkEo7pzaE9APEhxnWWoBUWp8akDGAGGm93AwLICZP9MYvAMT5AQQg9k70hv8COSeAKL0w7taTvAAxe6L3ajtA9Ncci53kBYjZE73xYYD4NcMCiNETvfEIQLS3KpE7yQuQcjurOIR0AsTtASSpAYhKinf0hn413QEgavcp3j7DYvuDMmufVgMysydoIA5sf9CqdoBanAPiyQY6UnOs40EDsb+BzrZEdIbFFmym51hXgj7Ta38LNrUb3e+YYQHE9Bwr7JeQ2geSys6wAGJ8jjVRAog+IJuEZ1gAMT7HinsBog9IKjzDAoj5OdYoQLQBeSwRnmEBxPwcKz4IEF1AFAeQO2dYALEwxxoBiCYgineZzDPDAoiFOVbAb2+wDERxAJlnhgWQChpSBTIOEC1A1ikOIEkdQCR6MeZElpNAVAeQeWZYAKmkSwwhLgJRHkAaACLTUYYQF4HoGEAAUkm7ZhhC3AOiOoDErQBxZpke6rO3NoGoDiC3vg8LIHaX6VPtAJEF8lSiY4YFEEvL9HgQILJAlAeQjQCR6xVlIDPPA0QSyA49AwhAKmu38jI9PgcQQSBrVX3cvHEnQNQ7pwwkyG1vrQFRnWDFycMAkeygOpAxgIgBWa88gCwwwwJIpY2rC+kDiBQQ9QFkE0Bk61MHcnkXQGSAPK1tAAFIpbVfVhdyGiAiQDYo+7j9haMAUe+YOpDwni20A0R5gnX7K90B4sQNWXE80Q4QdSCb1AeQ1gwg4p0SGELeAIgykM3qPuZ7Ugogqu0TADK7HyCqQNrUD0OaAURDwwJCxksAUQOyTmAAeRggjl4sjONjAFEDkmodQACi0pgAkJn9AFEBskNgAFnnNBDPtj+4uUMSQ8hER0BAjG9/IHAGa9EBhA10VCpNSAgJ6bZe0xvorBXwseBdJqECqTb3feiTABLSPVmmt2ATWIAsPoAAxPoti3E8/QJAKutZiQHkSYDoq1dkCLnUAZBKaki0DyAAcWEIiYcAUkG1Ej4WPYUFEOV6RIAE8xYgo0AkFiBLDSAAUW1EBMj0PoDYWIAsOYAAxInL6XE83g6Q8lqXmBhAAOLIEBLIw1PmgGwQ8ZGsAojuDsgAiQ8BxPgCZOkBBCDqDcsAmd4LEMMLkBwDCEDU65yVETJWAkje1ieGBhCACHRKaJJ1EiA5a5LxkdQCxES7rgoJ6QeIyQVIsj0DiJH6hYDMvgyQPO00NsECiEilS0JCZroAsnQ7hCZYmwBiqm4hIPH0foCYOYGVcwABiEz/KCXkcidAFu9pIR/JCoCYa9+slJD39gBksZ4U8rHQfiAA0dMbUkD8fjhEO5AGKR9JE0CMnuq9IibkYjtAFuoRMR/PZADx8lTvtc6XADJ/a6R85FyhA0SwETkhZwAyb3ViPnLchAUQ6VuyZuSEnADIPG2R87EjA4jxjskBiQcAousGk7ImWACRvJ4+LijkEEBu72O5AWQdQGz04qwcEE9vy9IIZKeYj7yXQADi7sWQa0IOAUSTj2QzQOzUMRkXfB1S7f78Kk42ZgCxVI8kEB/3Z9MEZEsq56OcFTpApBsSFTJUAojs9Y+cjxGGDWS5xS/I7iuiQoZ9uy9Ly/YHa0R9PJN5BsTjDXTm6SVRIPHFXX4B0bGBziOSPsqcYLEFm3inZIV4dve7hi3YGkR9JBsAYhdI+3uyQqY6Cw3k739f1semDCB2gUT7Z2WFXO4qMJBv/Er0s0x2ZgCxDSR6RRZIPN1TWCDf/FD2o0wzgNgHEl0QFuLRRXXZA/kPH8l+kMkjAHEByPNXhIX4c1Fd9Dj+02+EfTybAcQFINHL0kDiMx2FA/Lav0p/iGkGEDeARGfEhVx6oWBA/voX0h9hsgYgrgDpmBAXMt1XKCDf/VDcx1MZQFwBEr0wLS4kHuooDJDXfyz+6ZXxlC1AvFyGeDHNkjmAf/O+/IeXZgBxCYjow1P+TLNEjt/3PpT/6JI6gLgFpHRBgxDnp1kCR++rP9HwuSXrM4C4BSTaPaVDyKX9gQP521/q8PF0BhDXgEQHZnQImekPGsj3P9ThY2cGEPeARH2xls51BAvkqz/V8omlGUBcBKLheuEnTewPFMg3PtDyeSU1AHETSGlUj5CZY6UAgbz2w4/0+GjIAOImkGjPlB4h8fiLwQH5xvt6PiqFBTpAvLyiPncL/BsdQQF5/V9+o8nHsxlA3AUS9cxqEhJP9gQE5K0PNH1KyccZQFwGEh2JtTW0OxAgf/ljbZ9RmgHEbSDRCX1CrvSXQgDy/V9p+4TKfokJQMx3Xp+Q+FK390C++Qt9H0/OrZ4BYrX2ixqFxMP7vAby9Z9q/GzUTvACxNjJ3gmdQmZO7PIWyOs/+kinj6czgPgAJOq8olNIfPlIyU8g3/sfnR+L6glegJira1qrkHiir+QfkO+8r/UzUblDESCm657VKyS+1OsZEM08pHwAxFAv6xYSj/d6BORbmnmI+WD7g3CEuEAkz/YHb7761s91fxTKF9AdAiLecieBRAOx/sYPWV6L5NlA57e+EPvjgy3YwhISTw602/wZc2zBtinR/ymkGUD8AxINmhASXz2+x10g27amBnyUtc8zQNzppBEh8cyZTjeB1LUmJn7+pCkDiJdATAmJ45HD7c4BWZUa4SHrAyBGKxkTEl899YJLQBqbDfEQ9gGQUMeQa431dzgCZL0pHeI+ABLmSv1G02e6S9aB1LYY5JFuzgDiNRAzZ3tveqjqTLdNIHVbzekQvf4BEHtCZs0SiadOdtkB0lRvUocWHwAJ866TO410txsGYlqH4P1XACmekDieeftopzEgK1pN69DkAyB27n6fjq00efqlDu1ANqxMzevQ5QMgduq6GltqdvzUob2afqq9h37v/jYbOMSeHwSIK3VOxhabOj9wQPb8b+nAwPkpiz+RyPPnAHGoPaOx3abHTh/tkphw7eo6enpsxu4PI/H+EoC4Vcdw7EATw4O9+yo9wdXe2Ts4POHATyHw/iuAuHdj1qnYlS6PnjvR39PZnhtGT/+Jc6OXHfnbJ+mGDCDhAbFwyXDJadfk6IWhk4NHDh08eHDf3mvNrb2vd+3fHDoyeHLowujktFt/aR2XBwHiyAURx75rPqbr9BVAXOjFy3zDHT19BRAn2neJ77ibp68A4sjJrLN8yxWW5zUZQMIG4uBS3R8fO/V/mwDiwH0nLEScXH4AxJmr6hf5tlfgY30GkGIAcemaoT/Lj7oMIEUBEkWHuSJSno8dhr5NAHGk/RN868vw8VQGkGIB4XxvOdOrNRlAigYkil6+ynffgZtLggey3Fcg0fMjfPtzDB+PZIUCUpANdPKdzXqFi4YOXBx0C0gxtmDLvVZ/DwOL+tiUAaTIQKIOLoksNr3akAGk2ECi6KUrSFjAxzPmv54Aca/dQ1iYd/iozQACkOv1TOLhDh8brXw9AeLmSuQNTmfdyqNtcwYQgNz0MO44Km6aXa2z9fUEiLPXRI7NIMPwnYkA8apOLqzPDR+rMoAAZL76OeNr5dwuQHxp18miL9b/tCkDCEAWmWe9XWgf//EHGUAAsviV9eI+SvXBt9/JAAKQJc9nFfNBkV//8LVXAQKQHO0p4s0nP/natWMJEIDk6kDRTvn+/O8+OZYAAUjODhaJyM/funEsAQKQ3HUX5e6T97/z2bEECEDKqHe8WDwAAhCI3Np/feeWYwkQgEDkpgsf33/tVYAARJHIaKiTq+++dvuxBAhAKqhrOMBbtH721jzHEiAAqah9p8J6WuSjf//beY8lQABSYbsHw9l359f//LUFjiVAAFJx7UfCeMvcBz94fcFjCRCAqNRz3vfFyG9+9u3XFjmWAAGI4n2Mx3y+G/6/f/j1xY8lQACifpfWOT8X7B/99FtLHkuAAERiwX70knc8fvmDv8pxLAHC9gcyvTjk0S6Hyf/957/lO5jvAkS85VExa+8964ORJP3j3/ldf75NbMGGEaM6Wmr8+jYBBCPoAEjRjFxxUEdzjY/fJoAEumYfHHMJR7psm6ffJoCEewmx79xVN4aOtR5/mwAScqWu42MMHQAByGIDSe/J0VkrNtqqmvz/NgGkEMv2rmPDV43iaF4dyLcJIIWp88jQJRM20gdqA/o2AaRYQ8mBvpNv6zsHfOUPm0L7NgGkgO3uHjgzJns5cXrszED37qg6AwhAAmnvwb7BsxenFGVMXTw72Hfw+Rv/T4AAJLhTwZ09/SfOj7xXnpSp90bOnejv6Szd+j8DCEDCbdferp6+Y8eHhkeuNTp5rTk0U9f/cfT6vxweOn6sr6dr766F/hcAAQgtEkAAQgABCAEEIAQQgBBAAAIQgAAEIAABCEAAAhCAAAQgAAEIQABCAAEIASSclvM9tdZygIjHy6sD6k3pg8nLq9n+IKTEjyXbHwAEIAABCEAAAhACCEAIIAAhgACEAAIQAghAAAIQgAAEIAABCEAAAhCAAAQgAAEIQAggACGAAIQAAhACCEAIIAABCEAAAhCAAAQgAAEIQAACEIAABCAAIYAAhAACEAIIQAggAAEIQAACEIAABCAAAcjnsf1BQLH9gQexgY692EDHg9iCzV5swQYQAghACCAAIYAAhAACEIAABCAAAQhAAAIQgAAEIAABCEAAAhACCEAIIAAhgACEAAIQAghAAAIQgAAEIAABCEAAAhCAAAQgAAEIQAggACGAAIQAAhACCEAAAhCAAAQgAAEIQACiMd7Nay/ezSsfb3cPKN7uLh/7gwQU+4MAhAACEAIIQAggACGAAAQgAAEIQAACEIAABCAAAQhAAAIQgACEAAIQAghACCAAIYAAhAACEIAABCAAAQhAAAIQgAAEIAABCEAAAhACCEAIIAAhgACEAAIQgAAEIAABCEAAAhCAAAQgAAEIQAACEAKIxtj+IKDY/sCD2EDHXmyg40FswWYvtmADCAEEIAQQgBBAAEIAAQhAAAIQgAAEIAABCEAAAhCAAAQgAAEIAQQgBBCAEEAAQgABCAEEIAABCEAAAhCAAAQgAAEIQAACEIAABCAEEIAQQABCAAEIAQQgAAEIQHLFmxXtxZsV5ePdvAHFu3nl4+3uAcXb3QFCAAEIAQQgBBCAEEAAAhCAAAQgAAEIQAACEIAABCAAAQhAAEIAAQgBBCAEEIAQQABCAAEIQAACEIAABCAAAQhAAAIQgAAEIAABCAEEIAQQgBBAAEIAAQhAAAIQgAAEIAABCEAAAhCAAAQgAAEIAURjbH8QUGx/4EFsoGMvNtDxILZgsxdbsAGEAAIQAghACCAAIYAABCAAAQhAAAIQgAAEIAABCEAAAhCAAIQAAhACCEAIIAAhgACEAAIQgAAEIAABCEAAAhCAAAQgAAEIQADieo9XVz/3ZTLfc9XVjwOEqEgBhAggRAAhAggRQIgAQgQQIoAQAYQIIEQEECKAEAGECCBEACECCBFAiABCBBAigBARQIgAQgQQIoAQAYQIIEQAIQIIEUCICCBEACECCBFAiABCBBAigBABhAggRAAhIoAQAYQIIEQAIQIIEUCIAEIEECKAEBFAiABCBBAigBABhAggRAAhAggRQIgAQkQAIQIIEUCIAEIEECKAEAGECCBEACEigBABhAggRAAhAggRQIgAQgQQIoAQAYSIAEIEECKAEAGECCBEACECCBFAiABCRAAhAggRQIgAQgQQIoAQAYQIIEQAIQIIEQGECCBEACECCBFAiABCBBAigBABhKjg/T8gQhtNiqIiFAAAAABJRU5ErkJggg==\"\n        };\n\n        let databinding = {};\n\n        let judgements = all_mem_analyses.data.map(x => x.judgement);\n        let majority = MathHelper.majority(judgements);\n        this.setButtonImage(this._display_image[majority]);\n\n        this.dataparams = [all_mem_analyses, target_bw];\n\n        let repcount = all_mem_analyses.repcount;\n\n\n        let layout = new Layout(this.button_subwindow);\n        layout.setRect(\"Title\", new Pos(0, 0), new Pos(100, 10), new RU_DataViewText());\n        layout.setRect(\"PercentBandwidth\", new Pos(70, 60), new Pos(30, 20), new RU_DataViewNumberBlock().setTitle(\"PercentBandwidth\").setOptions({\n            display_title: false,\n            text_align: \"left\",\n            draw_bar: [\"left\"],\n            padding: { left: 10 },\n        }).setDataAnalysisFunction(d => {\n            let x = d;\n          \n            let expected_bandwidth = x.data.map(x => x.data.expected_bandwidth);\n            let target_bw = x.data[0].data.Memory_Target_Bandwidth;\n\n            let ret = undefined;\n\n            if(toplevel_use_mean)\n                ret = Math.round(MathHelper.mean(expected_bandwidth) * 100. / target_bw);\n            else if(toplevel_use_median)\n                ret = Math.round(MathHelper.median(expected_bandwidth) * 100. / target_bw);\n            else ObjectHelper.assert(\"Undefined mode\", false);\n\n            ObjectHelper.assert(\"is number\", ret instanceof Number || typeof ret == \"number\");\n\n            return ret;\n        }).setColorScaling(x => 100 - x));\n        let transthis = this;\n        ObjectHelper.assert(\"Valid bandwidth\", this.Memory_Target_Bandwidth > 0.0);\n        layout.setRect(\"Bandwidth\", new Pos(0, 60), new Pos(70, 20), new RU_DataViewFormLayout().setTitle(\"Bandwidth\").setDataAnalysisFunction(d => {\n            let x = d;\n\n            let expected_bandwidth = x.data.map(x => x.data.expected_bandwidth);\n            let datasize = x.data.map(x => x.data.datasize);\n            let input_datasize = x.data.map(x => x.data.input_datasize);\n\n            let bytes_from_l3 = x.data.map(x => x.data.bytes_from_l3).map(x => MathHelper.sum(x));\n            let bytes_from_mem = x.data.map(x => x.data.bytes_from_mem).map(x => MathHelper.sum(x));\n\n\n            // Differentiate between global and local analysis here\n            let repcount = all_mem_analyses.repcount;\n            if(all_analyses_global) {\n                let chunksize = datasize.length / repcount;\n                datasize = ObjectHelper.createChunks(datasize, chunksize, MathHelper.sum);\n                input_datasize = ObjectHelper.createChunks(input_datasize, chunksize, MathHelper.sum);\n                datasize = ObjectHelper.createChunks(datasize, chunksize, MathHelper.sum);\n\n                bytes_from_l3 = ObjectHelper.createChunks(bytes_from_l3, chunksize, MathHelper.sum);\n                bytes_from_mem = ObjectHelper.createChunks(bytes_from_mem, chunksize, MathHelper.sum);\n            }\n\n            let val = {};\n\n            if(toplevel_use_mean) {\n                val = { title: \"Bandwidth\", value: ObjectHelper.valueToSensibleString(MathHelper.mean(expected_bandwidth), \"programmer\", \"B/c\") };\n            }\n            else if(toplevel_use_median) {\n                val = { title: \"Bandwidth\", value: ObjectHelper.valueToSensibleString(MathHelper.median(expected_bandwidth), \"programmer\", \"B/c\") };\n            }\n            else ObjectHelper.assert(\"Undefined mode\", false);\n            return {\n                fontsize: 16,\n                rows: [\n                    val,\n                    { title: \"Target Bandwidth\", value: ObjectHelper.valueToSensibleString(transthis.Memory_Target_Bandwidth, \"programmer\", \"B/c\") },\n                    { title: \"Bytes processed (SA)\", value: ObjectHelper.valueToSensibleString(MathHelper.median(datasize), \"programmer\", \"B\")},\n                    { title: \"Bytes imported into scope (SA)\", value: ObjectHelper.valueToSensibleString(MathHelper.median(input_datasize), \"programmer\", \"B\")},\n                    { title: \"Bytes requested from L3\", value: ObjectHelper.valueToSensibleString(MathHelper.median(bytes_from_l3), \"programmer\", \"B\")},\n                    { title: \"Bytes requested from memory\", value: ObjectHelper.valueToSensibleString(MathHelper.median(bytes_from_mem), \"programmer\", \"B\")},\n                    \n                ],\n                padding: {left: 10, right: 10, top: 0, bottom: 0 },\n                rawdata: d\n            };\n        }));\n\n        layout.setRect(\"Graph\", new Pos(0, 10), new Pos(70, 50), new RU_DataViewBarGraph(\n            {\n                type: \"horizontalBar\",\n                xAxes: [{\n                    type: 'linear',\n                    display: true,\n                    position: 'bottom',\n                    id: 'data-axis',\n                    gridLines: {\n                        display: false\n                    },\n                    ticks: { \n                        beginAtZero: true\n                    },\n                    scaleLabel: { labelString: \"Misses\", display: true }\n                }, {\n                    type: 'linear',\n                    display: false,\n                    ticks: {\n                        max: 1,\n                        min: -1,\n                    },\n                    id: 'corr-axis',\n                    position: 'top',\n                    gridLines: {\n                        display: false\n                    },\n                    scaleLabel: { labelString: \"Correlation\", display: true }\n                }\n            ],\n                yAxes: [{\n                    display: false,\n                    position: 'left',\n                    id: 'thread-axis',\n                    gridLines: {\n                        display: true\n                    },\n                    scaleLabel: { labelString: \"Thread\", display: true }\n                }\n            ],\n        }).setDataAnalysisFunction(x => {\n            if (x == null) return ;\n            let l2misses = x.data.map(x => x.data.L2_TCM);\n            let l3misses = x.data.map(x => x.data.L3_TCM);\n            let tot_cyc = x.data.map(x => x.data.TOT_CYC);\n            let bw_mem = x.data.map(x => x.data.mem_bandwidth);\n            let bw_l3 = x.data.map(x => x.data.l3_bandwidth);\n\n            let colors = RU_DataViewBarGraph.colorList().slice(0, l2misses[0].length + 1 + 2);\n\n            let datasets = [];\n\n            let thread_group_func = z1 => {\n                let thread_grouped_z1 = [];\n                for(let x of l2misses[0]) {\n                    thread_grouped_z1.push([]);\n                }\n                for(let run_tuple of z1) {\n                    let l2ms_per_thread = run_tuple[0];\n                    let cycs_per_thread = run_tuple[1];\n\n                    for(let i = 0; i < l2ms_per_thread.length; ++i) {\n                        thread_grouped_z1[i].push([l2ms_per_thread[i], cycs_per_thread[i]]);\n                    }\n                }\n                return thread_grouped_z1;\n            };\n\n            let z1 = MathHelper.zip(l2misses, tot_cyc);\n            let thread_grouped_z1 = thread_group_func(z1);\n\n\n            let l2corr = thread_grouped_z1.map(x => MathHelper.sample_corr(x[0], x[1]));\n            \n            let thread_grouped_z2 = thread_group_func(MathHelper.zip(l3misses, tot_cyc));\n            let l3corr = thread_grouped_z2.map(x => MathHelper.sample_corr(x[0], x[1]));\n\n            // Now we average the correlations\n            let avg_l2_corr = MathHelper.mean(l2corr);\n            let avg_l3_corr = MathHelper.mean(l3corr);\n\n            let i = 0;\n            for (let tcm of [l2misses, l3misses]) {\n                let labelstr = \"[Unknown]\";\n                if(tcm == l2misses) labelstr = \"L2_TCM\";\n                if(tcm == l3misses) labelstr = \"L3_TCM\";\n\n                let tmp = 0;\n\n                if(toplevel_use_mean)\n                    tmp = MathHelper.zip2d(tcm).map(x => MathHelper.mean(x));\n                else if(toplevel_use_median)\n                    tmp = MathHelper.zip2d(tcm).map(x => MathHelper.median(x));\n                else ObjectHelper.assert(\"Undefined mode\", false);\n\n                datasets.push({ label: labelstr, xAxisID: \"data-axis\", yAxisID: \"thread-axis\", data: tmp, backgroundColor: colors[i] });\n                i++;\n            }\n\n            let rho_col1 = colors[i];\n            let rho_col2 = colors[i + 1];\n\n            if(display_memory_correlation) {\n                datasets.push({ label: \"L2 corr.\", xAxisID: \"corr-axis\",/* yAxisID: \"corr-y-axis\",*/ data: l2corr, backgroundColor: colors[i], hidden: true });\n                datasets.push({ label: \"L3 corr.\", xAxisID: \"corr-axis\", /*yAxisID: \"corr-y-axis\",*/ data: l3corr, backgroundColor: colors[i + 1], hidden: true });\n            }\n\n            let chartData = {\n                labels: [...(Array(l2misses[0].length).keys())].map(x => \"Thread \" + x.toString()),\n                \"datasets\": datasets,\n\n            };\n\n            return chartData;\n        }).linkMouse(this.button_subwindow).changeGraphOptions(x => {\n            x.options.title.text = \"Cache misses (mean over all runs)\";\n            x.options.title.display = false;\n            x.options.legend = {\n                position: 'top',\n                display: true\n            };\n        }));\n\n        \n        databinding[\"PercentBandwidth\"] = all_mem_analyses;\n        databinding[\"Title\"] = new DataBlock({ fontsize: 32, text: \"Memory performance\", color: \"black\", align: \"center\" }, \"Text\");\n        databinding['Graph'] = all_mem_analyses;\n        databinding['Bandwidth'] = all_mem_analyses;\n\n        layout.setDataBinding(databinding);\n\n\n        this.button_subwindow.setLayout(layout);\n\n        this.setOnEnterHover(p => { this.color = \"#FF0000\"; this.button_subwindow_state = 'open'; })\n        this.setOnLeaveHover(p => { this.color = \"orange\"; if (!this.is_locked_open) this.button_subwindow_state = 'collapsed'; })\n        this.setOnClick((p, mb) => { this.is_locked_open = !this.is_locked_open; });\n\n        this.setDefaultDblClick();\n    }\n\n\n\n}\n\nexport { MemoryButton };"],"sourceRoot":""}
\ No newline at end of file
diff --git a/dist/641.js b/dist/641.js
deleted file mode 100755
index fdba63cd..00000000
--- a/dist/641.js
+++ /dev/null
@@ -1,2 +0,0 @@
-(self.webpackChunk_spcl_sdfv=self.webpackChunk_spcl_sdfv||[]).push([[641],{1641:(A,t,a)=>{"use strict";a.r(t),a.d(t,{VectorizationButton:()=>U,AutoSuperSectionVectorizationAnalysis:()=>T,SuperSectionVectorizationAnalysis:()=>M});var e=a(2137),n=a(5991),r=a(7329),o=a(6610),p=a(379),s=a(6070),u=a(7608),i=a(7757),l=a.n(i),d=a(4286),m=a(1318);function c(A){var t=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(A){return!1}}();return function(){var a,e=(0,u.Z)(A);if(t){var n=(0,u.Z)(this).constructor;a=Reflect.construct(e,arguments,n)}else a=e.apply(this,arguments);return(0,s.Z)(this,a)}}var U=function(A){(0,p.Z)(a,A);var t=c(a);function a(A,e,n){var p;(0,o.Z)(this,a),(p=t.call(this,A)).supersection_all_vec_analyses=e,p._display_image={1:"null","-1":"null"},p._display_image={1:"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAAAAAD+G1m0AAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwQAADsEBuJFr7QAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAWH1JREFUGBnswYlbVGeCL/7vqR2KpVjFHS131Gg0UYmJiSbGLGoSs4eJ3dmm2+5M0ku6e/o+czPzzH5n7p3uSXeSzh7jvlIsggoIiKwqiFIYFll+f8j3J1pQp+ocKMk8WO976v18QEVRxgUqijIuUFGUcYGKoowLVBRlXKCiKOMCFUUZF6goyrhARVHGBSqKMi5QUZRxgYqijAtUFGVcoKIo4wIVRRkXqCjKuEBFUcYFKooyLlBRlHGBiqKMC1QUZVygoijjAhVFGReoKMq4QEVRxgUqijIuUFGUcYGKoowLVBRlXKCiKOMCFUUZF6iYGOzqGmDCGw4OMtGBSrQbNYFfvvLKL872M6FdO/W3f/WbsnPfM6GBSpSuHbOzMm5adoKJrP2lnMzMzOy8HZ1MZKAS6fs9yXaMWF7ORBbciVtSXr/KBAYqkQ7NwAjN+fb3TGjfeTBCc77Vz8QFKhEuPu7GiKR5NUxs7S/YMUKb9fYwExao6F15IQ0jbJuKh5ngKnJcGOGefpoJC1R0+t7GbZ4vmfCGnsvELfanWpmoQCVs+KezcduuS1SCr9gxQkvf3cMEBSphp6fbMcKZXkqFPDXXiVtmvzfAxAQqY1q3OHGLb0cvFbL//TTcYk8+zcQEKqM6X/NqGOF49iqVEcEdabhFe/4SExKohPS9koNbbNNPUrmtYZuGW1Je6mUiApXbBn6X5sAtrj09VEKOOTSMsOX9dT8TEKjcVl5gwy3eR69SGXX12RTc4pldwQQEKrd07dRw29zDVMJaHrHjtpfamXhAZUT3sxm4zf7WIBWdvVm4LeOlXiYcULmp770kO25xLa6iotfxMm7Tsj+4wUQDKjcdnIaQjA8GqUSocGi4xZ5VxkQDKuTFbW7clry9l0qknleycIvm2nWJCQZU2PViGkIWFlOJdvlpO27LeqGHiQVUeMyBUe8OUzE4kILbNO8HA0wooHLhCYR4t3VQMep8xYbb7AtKmVDAhHd9WxJu02aepGKmIt2BkGeuMZGAia7npz4NtzmeG6Ripn+HDyHpT3/PBAImurJ8J0IWl1Ixd3E7QhwpH9xg4gAT3LUXEaLZ3+2jMo7DSRpC/AEmDjCx9b+QjRD3hitUxtPxrBshnue6mDDAxFbusyNk5iEq4yvPtiEk96f9TBRgQmt70o4Q7fleKuMb2OZBiD3lDBMFmMj6dqdpuE2bcZLKRMqXI0Rz/KiLCQJMYMO/moNRjh8FqUxk8G+SbQiZc5gJAkxgtWkOjEqqpTKxjk1uhGgPX2ViABNX8E27hpDsFweoxBDIw6i0H19nQgAT15EZGKVtb6MSS99zSQhxZJUwIYAJ6+qTDoxyHKYSW7Efo+wvXWEiABNV7xtZGOVeUUsltr6fahg1/UcDTABgoqpItSNEy/r9EJU7UJPmQIjmq2YCABPU1SI7Rrm39VK5E/2vZ2OU+5VOWh+YoA7Mwpj5x6jcmY4nNYTYco/S+sDE1LkRY7Q3vqdyh/Z6MGZ7By0PTEjdu1MwyplVSeVOVa3SMCprVw+tDkxIgRwHRvmKeqjcqcEPnBpC7MkVtDowEXW+oGHM5g4qd65rtR1jXminxYEJaHB3HsakfU1lMvbNxJic/bQ4MAGdy7RjzLJTVCbj2ot2jNlykdYGJp6u110I++UglUk57tUwKuXJIC0NTDwnZtgwyj2tjsrkdD7vxih7ajEtDUw4Xc8gLLtogMoklWVoGPNsG60MTDQDr+YgbPs1KpPV+5gHY9JeGqCFgYnmXJYLYzIOUZm8o/MwRpt+ihYGJpjePQjTtl+iMnnf79YwxvN4B60LTDAlCxDmCFD5IcrT7RhlS3lvmJYFJpbBV5IxJunBIJUfIvisF2ErK2lZYGI5NRdhM76j8sOU5SHM++QQrQpMKMGdqQh7uZvKD9P7tBNj7Lk1tCowoZR5bBhlSztB5Yc6kIuwpLev06LARHL1NQ1jPM91Uvmh2l9EmG16GS0KTCQHZiDMV0blhztp1zDG8+NBWhOYQK5vQphzcw+VH+58tgthS8ppTWDiGPh1JsJmHqDyPzDwZg7C0rf10pLAxHFumQdhL3dS+Z/oeELDGHvyWVoSmDgO2xBmP0nlf+YbJ3Te6qYVgQnj4k6Eefx1VP5nyhdBZ/ZJWhGYKIZezUFY1p4BKv8z3/81dFwvDdCCwETRmA6dzVep/E9VQW9eOS0ITBA3fpGEsNSvGS9DwUFaRM/WNISl7eym9YAJ4myBA2ELSxgHg+2N5yr+9q8+KDld10crODIXYfbkCloPmCAOuKHzTg/vsq7ibz/eNC0rIz01JSXNl7Vp7yXKL7gLOtqPgrQcMDFcewZhNk8l76rrZ4+9tjDXa8cYR96zR9opvUMeDWH5x2g5YEIYemsGwpIe6uZd1HuqKNMFA8fWQD91+jv6KZvKmXaEOZ/up9WACaEx242wGYd491w78uj0NLsGI8+01y4ypOPQx1sXbvtLoJdSuf5WEsK0GeW0GjAhBGzQefoa75aBqh/Nho47LTfFgVGZz7dxRH/Fy9PtgOZa+PMeSuWsDzopu67RYsBE0P4CdBzf8m75/t0sJ0I0x/J//rdPTtWV/ulf/3m5Dbe4N17kTQdyEJL8fj9l0v+QA2GaJ0CLARPBoRyEafmlvDv6y56f7tQQsvqP5zmqvtCBETbPi20cOLrZhRDnPecolX0zoGMr6qK1gAmg5xk7wmy7u3hXdP1isRshrnVfX6fOwHf3OjAiY1fd381NwijbtDJK5dKz0Ms/QmsBE8DJmdCxn+LdMFy23oUxa88wStlq3OL25yFMSz5OuRyEnuOhPloKaH1d27wIc+W08C7o/eVitw0hno0XadCwCSNsKR6E2WeWUy6V2Q6Eab4yWgpofWVuG8KyXhjm1Ov/+UyM8TzfSxMNqxyI5lxRQ7kEd3mh497VSSsBLa/rdegtq+DUG/qd145R2qYbNFW6GtHcm5spmdJp0NG8J2gloOUdy4feXw1w6hUvwRjHmoscxzeIlvyLfkrm+mM26NheH6CFgFY3tN2NMM1zjFOvbbOGMevOcDy9qzRESq2gdL5Mgd6yCloIaHU1szSEORdVc8q1PpKEMUtqOL7v3Ijka6B0ypZCL2vXIK0DtLjet9Kh4327h1Pt4gt2DaOWV3ACw6sRwZbXTul0vwE9d3YjrQO0uKoZTuhknOZU697qxhj7R5zQRxr0PI8NUT4lNujZymgdoMUddWsIsz/UwynW/SOfDWM2XeeETqdDL28vJVSX4YSOtruLlgFa29WXoJf5JafaiVwHxiyp5cSaZ0JvSYAS6n02HXrzS2kZoLUdmg29paWcYs1PIcz2T4zh2kLoraunjAKzoWf7mpYBWlrfNi/0dn/PqRXc7kPYmmrG0OmH3pv9lNH3TyPC0120CtDSqtOgo7lOcmr1ve+BzseMpXUWdLSj/CF623oZX996oDfzF8O0CNDKrr/lgY4ju5pT60SuhjB7BWM5nY4wzVnGH+DilozNzYyr4tnQS57XQosAraxynh06qS9d55S6vNMJnU39jOVTF8Jcc85x0npLnvEg47dDjKeGB6Fn91bSIkAr2++A3rQAp1TPDh90FtUwpn+HTkphCyer653ZAHxFQcbT8G8RaU8/rQG0sM5nNOhtCXJKlSfbofMhY/tX6GT+TT8np/fI4z4XAF9RkHFV59Cgt/oMrQG0sP0zoef5jFOq81Xoef6DMbWsgs70Sk7GQEvlO3OcGOErCjKuerekQC93P60BtK7r6z3QyznIKXUoG3qZ+xnTN0nQyW/mJLS/McuDEF9RkPF1cBb0tG39tATQuipdNuitqeJU6nnWCb1HBhjTR06E2Z4Y5h0ZvFhXvPezx7I9NoT4ioKMrys7EGHWaVoCaFnf/wSRftbPqVQ8ExG+ZkzD99kQlvYVYxjsuNTWXFvxwVMbZrk16PiKgoyzvQ7o+XZ/TysALatyGSJVcipdeyQJEeoY02Xo5R/jhBr3P5PjhilfUZBxdiJFg44jq4pWAFrWgXToeWY2ciqVeO3QW9PLmBqgd+8ZTuhQQabbBlO+oiDj7NwKJ3Q01zFaAWhVN55BhKzXbnAKXX0NEbT/Zmz7oPejbk5o73SEOTLnLMh0I8RXFGSc9fw0CRFeuUYLAK3qVD4izCvnVNqfhwj2o4ztI+gd58T2TkdY+kvF//FgHkJ8RUHGW2UqIsw/RgsALarvlQxE2PE9p9DAdg8iLB1kTF0PIkyzV3Ji3+YBvnn5ywof3VN8trGfw+/NRYivKMh4a8nRoJf6zCDlB1pUXZYTeo5vOJUaZiKC9o+M7ct0hDl89ZxYwzcff7z3xPHyupZ+3hLwI8RXFGS8DT2ehAg5DZQfaFHFDg16Occ4lUqzEcH5B8b2z3aEpa66yEkK+BHiKwoy7g7ORoTUXw1QeqA1de1GpBVnOYV63kpDhOwzjO3voTPtp4OcpIAfIb6iIOOu+l5EcK+qp/RAawosQgTtzW5OofMFHkTYOsiYhhZDJ7+CkxXwI8RXFGTc3XgTEbSUYkoPtKYvUhBBK+FUOpVqQ4T9jC2gQefJICcr4EeIryjI+DtpRwT7d5QeaEndWzTo2dx1nEpHNURqYmyfawjTPuOkBfwI8RUFGX9VeQ5EeLaTsgMtKZCLCM61vZxC/T9GpEV9jO0P0HF8y0kL+BHiKwoy/lo3eBFh3jHKDrSirue8iJDzBafShQ2IYPs3xnZ9NXRmFnPSAn6E+IqCjL+h32QhQtoTA5QcaEWVWQ5EWFjMqXR2FSI4/8jY6jTorK7mpAX8CPEVBSmA+lmIYE9touRAKzqiIdKua5xKZcsQIekLxrYXeltbOGkBP0J8RUEKYHCrhgiOCkoOtKCuVxDlO06p435ESC1lbB9B7zdDnLSAHyG+oiBF8G0mItj39FBuoAUVL0IEzXOCU+rAbERYO8yY+h+CjnaWkxfwI8RXFKQIShYjgnZvNeUGWtBf0hHBMfcMp9TXuYjw74ztUBbCNGcLJy/gR4ivKEgRXCtCpKxjlBtoPdcfdCCC58FmTqXhnemI8BFj+39JCPM+3M/JC/gR4isKUgjHEMn5DeUGWs+ZNERK+WCQUyno90DPfpSx/YOGsGlf8wcI+BHiKwpSCJV2RNoepNRAy+ndk4RIGec4pa7m2qCXdoaxfQgdfzF/gIAfIb6iIIXQMM2FCPNKKTXQcmoKnIhg39jDKdWZgQgzWxlT4yLorKrnDxDwI8RXFKQQLq9NR4TMl/spM9ByjrsRKelPnFqdPkTYNsSYvoLeq4OM0FddUXOdsQT8CPEVBSmE4ffzEMGRfoEyAy3nWxsizTnEqXUtxwa9zxnbn6CjHWCEy+8ULCp4uZUxBPwI8RUFKYbqBYigOSsoM9BqOnYiyppqTq3gLCf0jjGm64UI01KKqTdUlAsg6a3rnFjAjxBfUZBi6NuBKO/2U2Kg1Ryagyhv9nFqDT2WBL3LjOmME2H2eWeo15StAUjadpETC/gR4isKUhBf2hBp/TlKDLSY/q2piGQ7wan2cSr0uhjTlxrCXOsvUK80BTel/GqAEwv4EeIrClIQR3IQadZRSgy0mAa3DRHs6Wc41T7LgN51xvRf0PE8206d7t1u3JReyRgCfoT4ioIUxOkCRHJ/TomBFlOiIVLyikZOta9yoNfNWAYLoeP9hyHqVC104KasRsYQ8CPEVxSkIJq3IJL2+HXKC7SW7jcQJeOn/Zxqh+ZAZ9EQYzmUDp30BuqdTNcAuDb3M4aAHyG+oiAFMfQBosyqpLxAa6lciigzKjnlSpdC50PG9J8uhGnrblDvO4zI+JyxBPwI8RUFKYqzGiJlvtVHaYHWcigNUbZc55Q7vw46HzKWngINYckfUe/68xixOMBYAn6E+IqCFEWz144InnkNlBZoLV/aEcn1KafejTeg8yFj+Rp6OV9Tr2wRRrxyjbEE/AjxFQUpiv7HUxHB5j1FaYGW0r0dUTL28i44Cp0PGUNxAfTmH6PO8Ms5GHGYMQX8CPEVBSmMAzMR5TClBVpK+TxEWVDMu6AsScOYRYOcUPUqG/TuOU2d1mw3AHt6BWMK+BHiKwpSGGeWIsornZQVaCUDu7MR5f4a3gW1810I6+BE6ldriPBgM3VOY0TyykbGFPAjxFcUpDB6XkCUhScpK9BKmvPciPLWdd4FfT9JR1gxJ3B6HaK8M8ywnr/GiNzfDjGmgB8hvqIgxbEXUdI/p6xAK6n22BDlBO+K2lkaxnzO8TXe70KUg9SpWIqbbI91M7aAHyG+oiDFcTRZQwTno/2UFGglxYhmq+RdMfScF2O29HM859driHaIOvtScVPqV7wDAT9CfEVBiqN8ug2Rci9QUqCFXH8TUWxJ9bw7ihdhTHI5x1G5zgGDgwy7+qQNNxWU8w4E/AjxFQUpjrp7nYiUUUZJgRZyZhWiJPsv8u7o+5nbhhDbRzRXs9oBQHP6cpwIe2eYowbeyQWg2d+7wTsQ8CPEVxSkOC495UaklL/uoZxACzk8A1GyXx/gXdKxOQmj7qmlmZJluElLmr32gTSEPdrBUXU5LgDOrFreiYAfIb6iIMUx/L+SEMl9Tz3lBFrIZ25EmX2Sd03rZoyy319Hg+5PVmi4yfPk2ZbzjyBsTQ1D+n7m1ABMe2eAdyLgR4ivKEiB1KQgki2znHICraP3MURbXMu758hsjNlYyyg1GzHCmV50keQ3PoyZc5AhJxbhJvv2a7wjAT9CfEVBCqQty4ZIjiOUE2gdZ2Yi2s4+3j3d7zg0jFr0H/XUOf1PizBCy9jexZuan9Iwyv3wNd7SulHDTSn7eWcCfoT4ioIUyOAmF6LsHqCUQMsYeDcLUbQveTdd/8lMjPEUfnuhnyOGW/f9ca0dI2zzftHPW0p9ToTYkp87VtvYULn/cQ9u0t7u5p0J+BHiKwpSJF/lIMqaekoJtIyWNV5E8R7gXXX96Fa3hjHO+/78xTef/3lTMm5z5u4M9PG2vnfmuDDKkbt208aF6Rjhe7qTdyjgR4ivKEiRnFiAKAtOUEqgZVRnOhBlTgnvspZ1ToRpNrvdbtNwmy1991WOGX47E2M0u91uwy07OninAn6E+IqCFEnNGkTJfmGYMgIto9SlIcqaGt5tV95fnqzBhDbnx9U3qNP3+zwPonlevsQ7FvAjxFcUpEh6dyOKe0Y7ZQRaxhEYPNHGu66/4sstWR4b9GyuzLnbj3cx0uDh52aluxCmOXN2XuadC/gR4isKUiiHEc19njICreL6bhj8dpjx0P72HA/0PHm7Tw/QqKf8xWkIc+T8tJuTEPAjxFcUpFBKbIjiLKOMQKs4uxoGZxkf/Q2n3n14zcol/nz/4uWr171TUt9Hc9erTvxk84Z7Fs2ZPXfh+p9X3+BkBPwI8RUFKZSqaQ5Esu/poYRAqziSjyiao4lxM9xUVVFy4tiJwKkztX2cSH9LXWXxkcNHTtYOcHICfoT4ioIUSuPqJESy3V9LCYFW8WkqoiRN76ClBfwI8RUFKZS+d9IQSZsRoIRAi+jf5ECU7F3DtLSAHyG+oiDFEshClKQDlBBoEReyEC3/CK0t4EeIryhIsVTnIdoXlBBoEafSEW15Fa0t4EeIryhIsbTORrSnr1I+oDX07fEi2os9tLaAHyG+oiDFMrjVhijzSigf0Bou3O9GtL20uIAfIb6iIAXzqRtRcv5qgNIBraFyuh1RnEdocQE/QnxFQQpmXy6iJM1uo3RAazjuRBRbRiktLuBHiK8oSMEUL0AUzVlL6YDWsB/RnMtqaHEBP0J8RUEKpmoNDMooHdAS+l5FNPdDTbS4gB8hvqIgBdOyBQbv9lM2oCXUrka0pD19tLiAHyG+oiAFM/BzGGxqoGxASyhegGgpJbS6gB8hvqIgRVMMgxWVlA1oCd/mIVpaNa0u4EeIryhI0Zy2I9qsY5QNaAUDW1MRLaOZVhfwI8RXFKRo6pJtiOL9hrIBreBimgNRtPX9tLqAHyG+oiBF07IwGVHsf6FsQCuotyOa579peQE/QnxFQYrmykMZiLath5IBreCUDdGyv6LlBfwI8RUFKZrh9/MQbV4tJQNawI33NUTLP0Kr6309CyHJG85TOJX5iDajlJIBLaBps4ZoyytoccEP5rkR4pjx7nWK5sJiRMv+ST/lAlpA1UoN0Tacp+X01daNOnX4i81pDg2j7CmFf9l74ODxmrpbai8z/vq3I1rq2lbKBbSAk3kw+HEfLadi3fr169etW3/T8jkZbkTQ0qbNnOVfu/6WdbsGGH+fIZprZj3lAlrAPhcMDtN69uPOtTL+vnYgiuY6TbmAFvCVBoNiWs9+3LlWxt/BDETTiikXUH69zyCaLbmC1rMPd66V8Vc8BwZ7BikVUH61SxDNOfMcreeQ96aUVN9E0tNSUrwp3nuuM/5Or4DB5hZKBZRfyVxES17dROvpqaqprq5p7opw7VqXXntzXc1NlyiA8w/AYE0VpQJKb+idPERL39pOJd4uPgmDBScpFVB6V9b6EC3rF4NU4m3wVzDI+ZZSAaXXMt2NaNPKqcRfGQw8f6ZUQOnVuzREm1lDJf6qYfRQH2UCSu8sjPJbqMTfBRhNa6BMQOmVwOjRG1Tir83nRLSsCsoElN3g+zDQ/kRFAFcWpCBa+vs3KBFQdq2PwyDpcyoCGHw5G9G8j7RSIqDsatfDIHsfFREcnIVo7qV1lAgou1PLYJB/nIoISv2IZs+qoERA2R2dCYOCU1REULscBs5iSgSU3bepMFh3jooIru+C0WFKBJTdJxoMtjRTEcJXMNpHiYCSG3gCRnv6qQhhL4xe66E8QMm1+GF0nIoYDtphcP95ygOUXNVsGJVREcMxLwxWnKY8QMkF8mB0looYSqfZEG3BScoDlNuNPVmIpjnrqIjhzEI7os3cR3mAcrv0UBqieWY2URFD7b0ORMvcNUxpgHJrWpaMaKkrL1ERQ9MmJ6Ilzb1KaYByq53mRLTMTZ1UxHB5uwvRtJTLlAYot9NuDdGm/XSQihgGfuWGQVIjpQHKrRRGM09QEUWZBwbuakoDlNtxGOWfoiKKs8kwcJdTGqDUhvbAaOE5KqI474WB84MBygKU2qXHYLSsmYoo2lJh4NhxmbIApVa/AUY7+qiIojNDQzTHw42UBSi1ypUw+gsVYQw+4kE0++oaygKU2okFMPqCijg+TUc027xTlAUotX3TYeD4hoo4vs1DNC3jBGUBSu0vqTBIPUBFHEfyYeA+SFmAUvsvOwzyjlMRR+kSGH1LWYAy698II38ZFXFUrYLRl5QFKLOWXBitPEtFHA3rYfRcDyUByuxcFow21FERx6VNMFpeT0mAMjvlg9GjzVTEMfAGjBZWUBKgxAZ/kwajZ9qpCOQAjOYcpyRAiXXsTIHRrwapCOQIjPLeHKIcQIm1PpIEoxIqIjkBo4y1VykHUGINa9wwqqQiklIbDJLnXqYcQIlVL3TCqJqKSE55bYjmSG2lHECJncq2waieikjO5joQTXNcoBxAiZ10wEhrpiKSc/NdMDpHOYASO6rBwO5poyKShhUeGJ2mHECJHYSRO7udikhaNiTDqIxyACW2F0Yp/k4qIrn0WAqMPhimFEB59b0Go4zVQSoi6Xw2DUa7rlAKoLwa74dR7mvDVEQy+EEGjLa1UQqgvKpWwmjmfipiKcuC0UMNlAIor9LFMMo/RkUsZ3JgtLaaUgDldSQfRgtLqYilLg9GyyooBVBee6fDaNkZKmJpngGj/GJKAZTW8K4sGK2qpyKWy7NhlHuYUgCl1bUoBUb3tVIRy8AjMEr5jlIApdWZ64TRy/1UBPNHDQaOLykFUFqXvRqMvqYimj+7YPQXSgGUVosLJvZSEc1nXhh9QimA0jrvhIn9VETzdQaMnuqnDEBpVTth4iAV0eybBqMlbZQBKK0KB4xsR6iI5vBsGC1ooAxAaQUcMNBSTlIRzQk/jPKrKQNQVjfet8PAlltGRTSlS2A0+xRlAMrq0nY7DOyzK6iIpmIFjKafpAxAWTVvscHAsfAsFdFUrYFR7s8HKQFQVvUbbDBwrDhHRTR162GUubWTEgBlVb1Sg4FzbT0V0TRuglH6hsuUACirigUaDFwPNFIRTdtjMPIub6UEQFmVzNRg4N7SSkU0HU/ByJPfSAmAsjqeBSPPk5eoiGZgD4ycOfWUACirw8kw8jzbQUU4R2Fk856jBEBZ7dNglPTqNSrCOQET2llKAJTVtzCR/LdDVIQTgJkKSgCU1dcw4S2jIp4ymCmlBEBZfQkTKZVUxFMJM8WUACipwRdgIrWKinjOwMwxSgCUVMdamEirpSKeaocGo58PUXygpFpXwUT6BSriqUt3wOjpKxQfKKmG5TDha6EinoY8F4wea6P4QElVL4GJjEtUxNM0LwlGD12g+EBJVSyAicxOKuJpWZwMo/W1FB8oqZJ8GGm5XVTE07YyBUb3nqX4QEkdmw0jx6xuKuK5dF8ajFacovhASR2cASPPlmEq4ml/wAejxSUUHyinobemwcj7JyoCurI5A0bzT1B8oJy6NufAKO0TKgK6+kQWjGYfpvhAOV19IAtGGZ9TEVDXzhwYTd9P8YFyurLWB6Psr6gIaOi9aTDK/pbiA+XUviINRnnfUhHR8TwYpX1B8YFyurQwBUYz91MRUfEMGCV9QvGBcmqbkwSjOYeoiKhsFowcH1F8oJxact0wmneMiogq5sBI+wPFB8qpKd0BowUnqYjobD5MPDxE4YFyuuC2wWhxCRURnZsPE3OuUnignBrsMFFQTkVE5xfAxKx2Cg+UUx3MrDxNRURNi2BiZhuFB8qpBmZWVVERUesSmJjRTOGBcqqCmbXnqIjo8jKYmH6BwgPldBpm1p2nIqLO5TCRV0fhgXI6BTMPNFIR0eB2mMitofBAOZXBzEOtVIT0CUzknKXwQDkFYGbzZSpC+hQmsispPFBOJ2HmsU4qQvoLTGSVU3iglIZ/DTPbuqgI6TOYyCyh8EApdb0EM28PURHSZzCR8bthig6UUudzMLOfipg+hwlfUZCiA6XUvgNmDlIR0xcajNJfukbRgVJqewJmDlER01cOGKU910nRgVJqfhRmDlMR0zduGKU+3UHRgVK68DDMHKEipr3JMEp5/BJFB0qpfiPMHKUipn2pMPI+0kbRgVI6tx5mjlER0/50GCVvbKHoQClVrYGZ41TEdDATRknrmig6UEpnVsHMCSpiOpwDI8/qCxQdKKXKFTBTTEVMR/Ng5C6op+hAKVUsh5kAFTEdnwkj16Jaig6UUvlSmCmhIqaTs2HkzK+h6EAplS2GmVIqYirOh5FjRhVFB0qpdCHMlFERU4kfRvacMxQdKKWAHybs5VTEVLYQRnZfJUUHSunkPBhpngoqYjq1BEa2lFMUHSilE3NhZEuppCKmigIYaZ5yig6U0rHZMLL7zlAR0+kVMNKcpRQdKKWjM2HkyDpLRUxnV8GErYSiA6V0ZDqMHNOqqIipeg3MBCg6UEqHpsHIObOGiphq7oOZYooOlNLBbBi55pyjIqZz98PMSYoOlNL+TBi58mupiKl2HcycoOhAKX3ng5F7fh0VMdWuh5njFB0opb1pMHIvqKMiproNMHOUogOl9E0KjNwL66mIqa4QZo5QdKCUvk6GkXtRPRUx1T8AM4cpOlBKX7ph5Fl8noqY6h+AmUMUHSilL5ww8iw5T0VM5zfCzCGKDpTSZ3YYeZaepyKmhgdh5iBFB0rpLxqMPMsaqIip4UGYOUDRgVL6FCY8BQ1UxNTwEMzsp+hAKX0KE0krLlAR04VNMPPWMAUHSukTmEhacYGKmBofhplt3RQcKKWPYSJp5QUqYmp8BGa2XqPgQCl9DBNJ9zRSEVPTZph5tJOCA6X0MUwkr2qkIqamLTCzuYOCA6X0Z5hIvreJipiaH4WZhy9TcKCMhp6CieQ1TVTE1PwYzDx0kYIDZRQsgInktU1UxNTyGMxsbKXgQBl1LYOJ5LXNVMTUshVmHmim4EAZdS2DCe/9zVTE1Po4zGxopOBAGQULYMK7roWKmNq2wcz6CxQcKKPuApjwrm+hIqa2J2Bm/QUKDpRR93KY8K5rpvgGr10bZsJp3QYz95+n4EAZBQtgIumeCxTZjc6L56vKP3jl1d+fOvc9E8uFh2FmdTUFB8roylKYcM2tobCunfhq2/SMtFRvclJSckr6A19fZCI5ew/MLC6h4EAZdSyBCef0aoqpu/LIKwtyku0Y48jdeah6iAnj9HKYWXiSggNl1L4YJhw5VRTR9fJXM10wcCz6XR91ei/10rIqC2BmwQkKDpRR+2KYcORWUzxXDz2ck2LXYOTOfrmVIe37/7Q5f/PHJ3toTZUFMOM/QcGBMmpfDBOOadUUTf/p12chTHOn56U6MCrjuWaO6C1/Mc8OaK4Fe76nJVUWwIz/OAUHyujyYphw5FVTMNd/nulAiOa451//47PTF0598u//stKuYYRrXTPJwXeyEZL8Xh+t6PQKmPEfp+BAGXUsgQlnXjWF0lfy7DSnhpDVf2zgqIb/W4ARmuvpBvbsmeNEiKOghlZUfS/MLC6h4EAZXV0KE+75dRTJtfcWuRDiWre3h3rnNiVhhPfx8ndnuDHKllNKK2p4EGbuOUvBgTLqWgYTyfc2URxDpetcGHN/FaN0f7QII2zJboRpqSdpRZe3w8yGRgoOlFF3AUx4N7RSGNf/ZoHbhpCkjZdoVLkII+w2hDn8p2lF7Tth5oFmCg6U0fXlMJHyQCtF0fP2dIxJerGfZv6PB9Fc68/TijqegZkHmik4UEbXl8OEd0MLBdHzM7cNo2wPD9BU7UZES3r6Iq2o/RmYKWyi4EAZdRfAhHdDK8XQ/+5cjHGsucRxHLIjivf3g7Si9p0wU9hEwYEy6i6ACW9hK4Vw47fTEba+iuMZWmdDpLRqWlL7TpgpbKLgQBl1F8CEt7CVIhj8IMuJMUvOcXw1KxApo5WW1L4TZgqbKDhQRt0FMOEtbKUITi5G2IrTnMi/IIJ78w1aUvtOmClsouBAGXUXwIS3sJUCaNuAMMefOaGPbNDL+JzW1L4DZgqbKDhQRt0FMOEtbGX8XX7Kg7CHr3NCp9Ohl3+Y1nR5B8wUNlFwoIyCBTDhLWxl3PW9laRhlLa0lhNrnQW9lZW0pss7YKawiYIDZRQsgAlvYSvjbu90hNn/mTEEF0PvwSZaU/sOmClsouBAGQULYMJb2Mp4u/iQB2FrahjD5Xzo/WSY1tS+A2YKmyg4UEbBApjwFrYyzq686kSY9gljqc+BjuMk79hAx8Wmhtq6842t7TcovPYdMFPYRMGBMgoWwIS3sJVx9l0SdOwVjOWEC2G21EremRunv92YnprivSklJe3+Tw7XDFBol3fATGETBQfKKFgAE97CVsZX/WYNOo/0M5aPbAhLWnqed6K7/I2VeU6MsaXPvffHx6t6KK7L22GmsImCA2XUVQAT3sJWxtWV9W7oLDrHmP4NOumPX2JsA2dfm6bBwJb/5tl+iurydpgpbKLgQBl1LYMJb2Er46nv5w4NOh8ytn+BTs7vBhlT0wvTvA6YcKXmPnFkgGK6vANmCpsoOFBGXQUw4S1sZTydWgI9z38ypoZ7oDPzHGP5PvB0OkbYkzNyp2V6HdBzz/3ZNQrp8g6YKWyi4EAZBQtgwlvYynj6yg29rAOM6TM3dLb0MIZrP3bbAM2VXviHj7/cu/erT/+4MSvFhTDbqx0UUfsOmClsouBAGQULYMJb2Mo4at9qg97mQcb0n3aEOT5mDO3PZdkAJC39bRdDeqv2LHEhLGN7CwXUvgNmCpsoOFBGwQKY8Ba2Mn763shChG8YU/8KDWFZezmxKy97AaQ9dujcIMP6qvc/5tYwKmlHK8XTvgNmCpsoOFBGwQKY8Ba2Mn5qfA5EqGNMrdBbXMIJ9e7GTbZt5xmtYYMLYTvaKJz2HTBT2ETBgTIKFsCEt7CVcTP4nlOD3tpexnQYehtqOaG90wEkv3aZRp270jHGt72TomnfATOFTRQcKKNgAUx4C1sZN1VrEEH7iLF9Cr13ejiR9vvsgG9nB81cejnJhlHuN4MUTPsOmClsouBAGQULYMJb2Mq42ZeLCPZjjOnGo9A7yYl0ve4E8EwbzV3Z6MEY934Kpn0HzBQ2UXCgjIIFMOEtbGW8DG33IMLSQcZUNw1hmv00J3Jyug3OnBKO5/hshD11iWJp3wEzhU0UHCijYAFMeAtbGS8tsxFB+0fG9mkKwhwZ5zmB3ucBJC2u5Xh6XnBgTNaLfRRK+w6YKWyi4EAZBQtgwlvYyngpz0EE5x8Y2z/aEJZ27yVO4EQ+AO/K/93L8RzLxBh78hkKpX0HzBQ2UXCgjIIFMOEtbGWc9LyVhgjZVYzt76Ezbc8gx3djuw+AM2/1Oyc7aO7qqzaE/aSHImnfATOFTRQcKKNgAUx4N7QyTuqXeRDh8UHGNLgYOvkVnECr14HbtMcbaK7Co2HMkgqKpH0HzGxoouBAGXUtgwnv+mbGSXmKDRH2M7ZiDTpPdnMC9XYNIckPlQzQTM/DSRiTfpAiubwDZjY0UnCgjK4tgwnv+mbGyWENkZoZ2+cawrTPOZGzCLMVVNLUt3kY4/iCIrn0NMxsaKTgQBldWwYT3vXNjI/rRYi0qJ+x/QE6zr2cSDn0vqSpygKEPdlNgbRtg5kNjRQcKKPLi2HCvbCO8VGzBhFs/8bYrq+GzqxiTuQk9J79nmbq1yDMX02BND4MM/fWUHCgjFoXwoRzRjXjo2wZIrj+m7HVatC5t5oTGPgF9ArqaKatEGGzSymQug0ws6KSggNl1OiHCUfuGcbHyYWIkPQlY9sLvcdbOYEb70FvYQXNDLyOsBnHKJDqNTCztIyCA2V0wQ8TjtyzjI9DcxFhdSNj+2/o/XaYEwlAb9k5mtqHsNy/HqA4zq6CmaVlFBwoo0Y/TDhyzzI+9k5HhH9lbP0PQUer4oTO2DWE7eymqYMIy3y4k+I4sxJmlpVTcKCMWhbAhCOvivHxeRYi/DtjO5CJMM3Zygk1pjoQ9hXNHUZY+v3tFMeZlTBTcIqCA2XUthAmnNOrGRdDT6UiwkeM7f8lIcy7+QYnNPT2dIzSFpTT3BGEZTx4heI4ew/MrDhNwYEyurQYJlxzahgXwXw39OzHGNs/aAjL+4YxBF/x4hbNk/PLPpo7jLDsJ65RHDVrYWZ1NQUHyqhzKUx4CuoZF9dybNBLr2JsH0LHH2AsHUVO3KS5ny4d5DgOIGz6L4cpjgsPw8z6CxQcKKOry2Ai+d4LjIurGYgwq5UxNS6CzqrzjOna4d2F9726/0QHxzP8I4TNLqVAWh+HmQeaKThQRteWwYT3vmbGxdUMRHhimDF9Bb1XBxmhs6ysKshoN5rPX+cE2goRNv8MBXLxSZjZ2ELBgTK6tgwmktc2My6u5dqg9zlj+xN0tIOMcP7F+fOXPF8xzMk5swJh23spkLYnYOaBZgoOlNG1ZTCRvKaJcRGc5YTeccZ0fQPCtNRi6vU/mQIgadtFTs6RuRiT9A1F0rYNZgqbKDhQRleXwUTyvU2Mi6HHkqDXzpjOOBBmn3+Weud9uClp20VOytCzGRgz+yRF0vo4zKy/QMGBMgoWwETy6ibGx8dp0OtiTF9qCHNtuECd4f/lxU0pvx7gpFyc5sKY165SJC1bYaawiYIDZTT8FEwkrWpkfHyWCb3rjOm/oJP0XDt1Wja7cVP6aU5OtROjNEeAQml+FGY2tlBwoJT+DBNJ9zQyPr7OgV6QsQwUQsf7D0PUObvAjpuyGjkpvXvsGOVcc5VCaX4UZh5so+BAKX0ME0krLjA+Ds2BzqJhxnIoDTrpF6h3Ik0D4Nrcz0k5vVTDqNmHKZamLTCz6RIFB0rpY5hIWn6B8VG2FDofMqb/dCFMWz9Ave8wIuMLTs6+JIxyvtJDsTRuhplH2ik4UEqfwISnoIHxcX49dD5kLI0FGsKSP6Le9V0YsaSEk9LxtA0h9jmlFEzjwzCzuYOCA6X0CUx4ljUwPgbehM6HjOXP0Mv9mnqlCzHi1S5Oxo3duQixpb7fR8Fc2AQzj3ZScKCUPoUJz9LzjJOj0PmQMRQvg57/OHWGXszGTdphTkp9sh0hSVu+p2gaHoKZrdcoOFBKn9lg5FlynnFSlqRhzKJBTujsKg16q85QpyXLBcCRUcnJGPylXUPIrnYKp+FBmHk8SMGBUvrCCSP34nrGSd0CN8I6OJHaVRoivBqkTiVGpOwKcjJOr0KIc24ZxXN+I8y8NUTBgVL60g0j98J6xkn/T9MRVswJVKxFlAPU+f4djMgr52QM7vIgJOP9GxRP/QMws4+iA6X0dTKM3AvqGS/1szSM+Zzju3CfC1EOU6diCW5yPtXLSeh7N8+G22a/008B1RfCzH6KDpTStykwcvvrGC/Du1IwZnMfx1O/XkO0I9T5LhU35R7gZJRkO3GLM+cnXRRR3QaYOUDRgVL6Lh1Grvl1jJvAYoxJKuU4Tt1nh8EhhnU+oeGmlzs4CReetOO2nLd7KKTa9TBzgKIDpbQvA0auebWMm/53PTaE2D6iuepVDgCO9LzpLoS9M8xRA2/lALAll3ASup5Jx235P+uhmGrXwcxBig6U0oEsGLnyaxk/HY8mY9Q952gmsBQ3ObLXbd3sQ9iWdo6qzXYBSN7SxTvXsycVt7gyfn6dgjq3DmYOUXSglA7lwsg19xzj6OIWjLKtraXB+f+7XMNN0964dPXCZoTdc4Yh3W86NQBzSjgJJ7LtuGXur29QVOfug5nDFB0opSPTYeSafY7xdHQuxmw8xyjVD2CEd/6vukl+m4Exebv7eUvPT+fiptSift651u24xfF0YIDCqrkPZo5QdKCUjs6EkXNWDePp+k/cNoxa9B911Kn8p0UY4Xr02DBvatmuYZTN978HeVPXG+kY8XgT71z3gx6McK5rocCq18LMUYoOlNLx2TByzqxhXPXsmYUx7vVf1/dyxGDj3j+ssWOE69VLvK08w4lRzvyiQHXVoZ25DgB2Txnv3LUfJ9lwk33XJYqs6l6YOUbRgVI6mQ8j5/RqxlfP8W1uDWOca//0+def/emhJNxiS9u69wpD+g8+7MKYpBmrVqY6MCL3lT7escE9uRoAW+pzFym0M/fAzHGKDpRS8XwYOXKrGG+t65zQ0UYgxL2tiTr7M6GjabjthW7eucOzMML92DWK7fQKmDlO0YFSKlkAI3vmWcbdtV+tSNZg5Eh/vqSbejf+bkYSonlebeeda304GYA99a0uCq5iGcycoOhAKZUthpEt7TTjb6Dy68dzPDboaO7MuTv2XWaUoWMvzvW5EKa5pu3q4J279CJucua93kXRlS+GmZMUHSil8qUwsiVXUAgd78xNgo5jxl+d+p4m+k69NA1hjpyffc8717ndg5uy3him8EoXwEwxRQdKqWI5jDTXKYphoPH00d3337Ns4YJlax584r1T9X0cR8+5wM+2PrBq8dw5+YsfeP/cAO/c1Vd8ADx5H/RSfIF5MKEFKDpQSqdXwoStjOII1pwuCxSXVzVcGuKEBtrqz5QcO3o8UD/ISeh5ywbA/cj+AUqgeC5M2EsoOlBKZ1fDTCkTRu8r2QBsCwI0M9DU2NJLgZyYBSPNVUrRgVKquQ9mSpgout/NsgHp204N0UTf329+ZMcpCuTYdBhpSeUUHSilug0wE2CC6H/TpQGupy7QVNVyDTn/+/+jOI7kwsiWcoqiA6V0/kGYOcnE0P/6DA3wvtZOc8W5wMwTFMihLBjZ0isoOlBKjY/AzAkmhIHfp9mBaa9d4TgOeID8CgrkgA9G9qzTFB0opZbHYOY4E8LRLA3A7m6O5ysAi+ookH2pMHLknaXoQCldfAJmjjEBDJzY6gJy/6ab47nxHICCNgpkrxdGztnVFB0opfYdMHOE1jf0d1kuYMZbvRxX3VIAOwcokG88MHL5z1F0oJQ6d8HMYVrf0Vk2aPb3+zm+k3MAfEaRfOWEkXtZPUUHSqnrJZg5RMtr2eaGbe77vRzfwCtZgO0riuQLG4w8qxooOlBKw7+GmYO0urbNSbBN/9kgJ9A2OwnwfEeRfA4TSfc3UXSgnE7CzH5aXMuzbs2W8naQEznnsgF5xymSz2AieWMLRQfKKQAzbw/R0rqezwBS/O93cHwDje/gpoXlFMlnMOHd3EbRgXIqhZknumhl3btTAOSsf+Xvy245VV4Wrbzk/ZWZuGl1FUXyF5hIefwSRQfK6RTMbO2khfX9PNsOwOWbkX/bvHyjOTNSnbjpoQsUyacwkbq9g6ID5VQJM4920LoGfjEfd+6pSxTJpzCRvquTogPldBZmNl+mdZV4MAm/GKBIPoEJ3ytdFB0op2qY2dRGy7qw1YZJKKFIBrfDRMZvBik6UE61MPNgM62q/WkNk3GGIrm6AiYyAxQeKKfzMFPYSIvq2ZqCSamnSNoLYCKrjMID5dRg12C07jwt6ozXjkmwuZopkralMJFdQeGBcmr02GC09hyt6cb7mBRX1mWKpHkxTOScofBAOTWnO2G06iytqf0ZTIpv+w2KpGEhTOTWUHignFqnuWG0opLWdHk7JmXGPgql1g8T0+ooPFBOF+ckwWhpGa2p733fpOxoolCq5sHE9AYKD5TT5cUpMFpUTIvqr52UIMVSORcmZjRTeKCcrqxKh9H8Y1REVD4bJma2UXignK5uyITRnMNURBSYCROz2ik8UE7BLTkwmrGPioiOT4eJOZ0UHiin4XfyYDTtGyoCGnpvGkw8PEjhgZI6PBNGWV9QEVDXzhyY+C+KD5TU8TkwSv8LFQFdfSILRtofKT5QUiXzYJTyZyoCurI5A0aOP1F8oKQqFsDI8+gwFfG0P+CDkecTig+UVNViGDlmdlMRz6X70mCU8hnFB0qqbhlMZHdREU/bPSkw8n1F8YGSalwJE5mdVMTTsjgZRrnfUXygpC6uhomMdiriacz3wGjWIYoPlFT/LpjwtVERT8MMN4zmH6f4QFl9ARO+ZiriqctwwGhJKcUHyuormEhvoCKecx4bjFZWUnygrL6BibRaKuKpgpn7qik+UFbf2WCUWk1FPJUw80A9xQfK6qALRilnqIinHGYeaab4QFkdTYdRyikq4gnAzOOXKD5QVsXTYOQtoSKeEzCz4yrFB8qqPF+DQfIHg1SEcxRm/maY4gNldXqJBoOk5zupiGZgD8wcpwRAWdWstsHA8/RlKqLpeApmApQAKKvzG2wwcD/aSkU0bY/BTBklAMqqebMNBq4HGqmIpnETzFRSAqCsLj1th4Hz3joqoqnbACPNVUUJgLLqfNEOA8fSaiqiOXsvjByZdZQAKKuh3zlgYM8/TUU0FStg5Mm/QAmA0ip3wMA2rZyKaEoWwyhlZSslAErrjAMGWnoxFdEcnw8j38bLlAAorVonjNzHqIjm0CwYZT15lRIApdXohInDVESzbxqMpr0/SAmA0rrohokDVETzdQaMZhRTBqC0rqTbYfQdFdF85oXRnErKAJTWtVkeGH1LRTR/dsJo/jnKAJTW4FPpMHp1kIpg/qjBaFETZQDK64scGBV2UBHL0CMwsaydMgDl9d0MGN3XQkUsV+bAxPZBygCU19F8GK2qpyKWtpkw8SmlAMqrdBGMCqqoiKVhOoxsX1AKoLzOroTRonIqYqmeBqPkbykFUF4N98Fo/kkqYqnIhlHOIUoBlNeljTCac5iKUIZ/nwmj/GJKAZTX4G4YTd9LRSjXXkyH0fJKSgGU2D4YZT0/SEUkHU+mwmh9LaUASuwQjNIWX6UikrZNXhhtaaIUQIkds8HAndNORSSNa5JgtKOdUgAlFkjSEM3uaaMikvolbhj9apBSACVWkWuHURMVkVTPcsKolHIAJVbtd8KolopIKtNtMDpNOYASO7/aDaMzVERS6tRgdI5yACXW/FASjMqoiOQkTNgaKQdQYu3bvTD6zRAVgRyFkSuzjXIAJTb46zQY7bpCRSCHYJSyqINyAGV2ygejbW1UxDH8FowyN1yjHECZncuC0UMNVMRxZQuM8t4ephxAmTXnwmhtDRVxtGyE0ZzjlMT/3x58/0V5J/oC/zzPVBjaIEWKJXZN05R1E00xplhii6YYE00xzc2mnOye3b35Ifd17n297p6759y9Z7Mla4rRqCgqCggCKsUKggUsIDAw8I98DmVmnjIMY5JhZp7n+b7foJG1FyDcghoKyaPpIYSbXUODAI1scLkdYaZVUEgeNfci3L1naRCgoe3MQJicQxSSx9HZCLexhwYBGtreAoRJ2UsheeyfgnDf0ihAQyubiTDSLgrJ49tchJH20ChAQ6u5D+G+oZA8/pqOMI4SGgVoaE2/RLh/Ukga/Usd0JNyjtIoQENrXY5wa3opJItr6Qgjz6qhUYCG1v8+wi24SCFZNKchjO2hRhoFaGyHEG7WaQrJosmDMPblzTQK0NjKEW5qJYVkUZuCMI4XrtEoQGOrcUnQKyilkCwq3Ajj/B+DNArQ2BpyHdCbtK2PQnLwfeJCGFctDQM0tvPzUqCXsegKheTQttKJMO4zNAzQ2NqWZEDPPbWFQnK4sNSBMKmtNAzQ2DrWZEPPnn6WQnJouN8OPXtOBw0DNLbBf81HGPk0heRQO1OGXsaqARoGaHA1RQhXTSE5VORK0Mv/nsYBGlzTdIQ7RiE5HEpBmLsO0ThAg2ubjXAf+Skkhf0ywtx9gsYBGpx/JcKtvEwhKexGuF+co3GARvcPCWEeO0chGQxsRritPhoHaHS7PAiz6CSFZND6EMLtp4GARnewAGHmVFBIBvV3I4x8mAYCGt3xeQhTdJBCMqiYCT3JWUEDAY2u8ZcIk7GLQjIoKYKeY8pJGghodLe3I4zjKwpJwP9KDvTcD56ngYCGdwThvqSQBNpnpUEv7bnLNBDQ8KoRbnkvhcRrzXRAL/OzfhoIaHiNDgl60y5SSLzzCDfpBI0ENLzmIjf0Ck9RSLxTCJd/hkYCGt61X3ihl1tOIfGOI9zSbhoJaHiDvy6EnvcDH4VE83+GMNKfaSig8VXPgF7aklYKida2GmHSdtJQQOM7fzf03LPPUki0s0sRpmAfDQU0vv6N0LNl1FFItLr7EGZeBQ0FNIFdMnQkRyWFRCufjjCLG2kooAmUeBDmCIVEO+BFmDdv01BAE6iYhjDvD1JIsO9sCFNKYwFNoP5BCXrL2igk2E6EkStpLKAJtDwrQe/hBgqJ1bcWerLnFI0FNIH+f5GhN7+SQmJdnAe9lNkXaCygGVTL0JtSQiGx6u6CXtaTV2gsoBmcsUMv+xsKiXW4AHr5/zJAYwHNoDXdBh3X8kEKieTblg29qbU0GNAM+panQUfKa6eQSJfme6A3u5kGA5rC7gLoZV2gkEhNaTboPe+nwYCmcGwW9DJOUUikOrsEHdc3NBrQFBoWQs/z+SCFBKpAmEn7aTSgKXRvhl7KhmsUEmfwY4SZe5xGA5rDXui5Hm+mkDitzyLMI400GtAcDjuh47i7gULiNCxGmHdv02hAc6gptkFLzjlOIXEq5yHMMRoOaA7nf+GCjusQhcQpKYCe7SQNBzQH34ce6O2lkDhfe6Bj81yg4YAmUZMJvc29FBLmSxt0Mtf00nBAk7iYJ0FnYSOFROl5EnqFJTQe0CT8T9igM+sYhURpKoTe7FoaD2gW3+dCp2A3hUSpyoXe+i4aD2gW5XOhk/FcH4XE6PswCzrSdzQg0CzOPgIdm7uNQmJcWuKBjnM/DQg0i/73oCc3UUiMhqkOaElTKmlAoGkctUGvmkJiHHdJ0JIXN9GAQNOozbBB55M+CglxSIKO7YNuGhBoGufvSYXO080UEqH/bejZK2lEoGn4PsiGzsJTFBLh7GLouZpoRKB5VBdAp+gYhUSomAcdu/cyjQg0j5tPQSdtP4VE2J0Pncw1AzQi0ET+Cr1vKCTA4FMu6EwvpSGBJrLHC511vRTi73KODJ1FDTQk0ETKZ0FnbhOF+GtKh962fhoSaCJNS6Az5RiF+KtMhV4pjQk0Ed8O6Ex6zUch3rrfc0HLll9NYwLNpFKCVsr0FgrxduZBB7TcD5ylMYFm0uCSoSE56ynEW3WhDK30X/XSmEAzuTQjFTqVFOLtcKoErexaGhRoJv1v5kJnh49CnP0AHanwEg0KNJWqu6Cz5AyF+Op9CTruVQM0KNBUutZAZ3YFhfg6fTd0Ju+lUYHmskuGlncPhfgqnQqd+2poVKC5lBVCy/kVhbjyb5wEnW2dNCrQXBoegs7y2xTi6UpBCrSkwzQs0Fx6fgWdopMU4umcDC3JXkPDAk2mVoJWzif9FOKoBjruWedoWKDJNKfboZG2+BKF+On/FDre7b00LNBk+tdlQ8OeV08hfs4/AZ3iGhoXaDZlM6AhuY5TiJ/js6AlreimcYFmc/0F6JRSiJ99adByfUMDA01nD3S2dlGIm69t0LrrKA0MNJ2jXhkaC+soxMuNFdBZeoYGBppO/d0OaEw9SCFeyqdA51M/DQw0ne73UqCR/hWTSH9Hh5+m5duSDQ3JUUcjA83nRAY0bI/1MAkMtF9taaqr/Ozll393/NSlQZrSxaluaKRMaaGRgebTOgla3kYm3PXDr8yclJaa4nY5nS63J2fzJZrRSRla+dv9NDLQfPzrMqCR9ls/E+pmVcmLM3JSbQix567Zf9JP0zkCnTknaWigCR2cBg33kotMoFuVm70OhLHN+tduKvxtl9oGaHA3t0FL3uSjoYEm1PAwNGyTTzBhOvYvzfbYJIRzejc1M+DKD88UF01dcfg2Da1qAbRS9tHYQBPyvwsNyX2ICdJ74rUiKCR3VkGGA0He9VUDHNJduSnfBkiOGe910cj25kJDmlFFYwPNqNwhQWPrABOi68NsOwJk56J//1vl6ea6si//uMguYZgzt5pk//YcBKR+1EsD+5sNGvLWmzQ20IwaprugcX8DE6CnfF2eXULAor9cYND5/3c3hkmOlWfY9V6xAwH2BadpXLeWSdCwVdDgQDO6vTUDGlNKGH8dH811IsD1yA+9VGt8MgXDPM9U7ihwIUjOraRxVedDw5F9jgYHmlJlHjTSn+1nnPkrH3EhaO7/PU2drr/NxTA51QWFlHGMhtW7PRMaGSv9NDjQlG4tg4Y9o5nx1fmrmS4ZAYuqOIbaORhmk6Gwz6qjYZ2Z7YLGrKM0OtCc/umGhlzLuOraPhlB0sN1HNNf3NBzPnKWhlWdJkNNeqWLRgea04FCaEi/6mEc3f7ALiFoXh3Hdn0p9FLWtNGwSqFlO0jDA82pfjG0Hmxg/PTsmIqQ+8sZyUEbdDyf+2lUXa9DwzGjjoYHmpP/YxkaBUcZN72fTEaIbScjGvylDVoZp2lYJ+6FRupbXTQ80KROumSo2b9nvPR/mmlHkLywh5E13Aut7FYa1t5CaGSdoPGBJtW5Jh0a63sYH4O/mY0Q6YFzHM//gYbrqT4aVf9KD9Qcy7pofKBZHS2GxswaxkdtHhTurzmuv8pQ835Nw7rohUbW1zQB0Kw6V0Mjb7uf8XB5hQuKZ3wcV10W1KaX0qgGP/dA4+4qmgBoWnvSoOaZeYlx0P2WW0LInCaO71Ix1O6vpVFdWOKExvZemgBoWhV3QUOuZxzsngyF9G+M4tZcqL16i0ZVmSNDzVZBMwBN69ab0DrKiXdpqRuKRXWM4sp0qJXQsPY7oeaefYZmAJpXlU2C2rabnGjXNjug8p+MpikXKvajvHP+jrbzp0+dPFl3sqGlj4nW/RI0sj/w0QxA82pOtUFtbiUn2h4XVKRdjOawAwo5vZZ36Gbl9ytyPC7nqLSl3x5rZ0KVz4LG1EaaAmhe/i15UMvczQnWuEyCyuO9jOZLGYqUBWd5J7pO7Htp7uR0u4QA2ZU7e+MPR+p6mCj+9dlQc2/00xRAE6tbAI0VvZxQ1xa7oDKnnlH9ESqZb3czusGmt4okjMGd/+5VJkhzhgNqRaU0B9DE/FugUXiCE6l7h02CyheManARVHKPMbr2t3M9doxFsqU9/u11JkS1DI0t12kOoJmVTZKhkrm1mxPo+Fyouf+DUZV7oFLcyGj81ZsLMEROm/HojrLKE3W1lYe3FqUgwO7deoUJcPtdqEn2cpoEaGYN9zug4ixs4AT61gW1nAOMaqcLCunpHkZzNNMOOD2ZT+w8cqafo24dWJVlR4B7xXXGX80CqDlzztEkQDPzfZIKFcl5jBPn8jMS1J4aYFT/YYPC+RWjGNj/hF2CNPPxj25Qreu3BRJGyZ41Vxl3+zOglr+9nyYBmlpjjgy1N25zovRszYbG94zKd68ERe5ejm/g80I7kLW66lIftfqOrkSA5H7rNuNsYJMMtRXXaBagqfU/7Yba/EpOlFMeG9SkM4yqBWrzKzm+6kk2QF51kWOosEsImLybcVY/G2q272gaoLmVToda9recIH0f2iSoPdTLqA5AbckZjqvzdacEe9FRjqVzbSYCXI+1Ma787+ZB7a4KmgZobtdfhpp9WTcnRt0iaEhfMrp/QG2Hj+MqmQLAXvhJH8dybBqCnK9fZzw1z0yFirTtJk0DNLlSaHhrOTF+yIWG7TCj8i2HWgXH1bvYhiGSd/VljqFzHULc+xlPdTLU5GqaB2hydUUOqKRuv82JMLDGBY35A4zqdC4UsvsUx3U6DSMcmWsPtTPcdwiRN1xn/Pg/hpp7yS2aB2hynVvSoeKYdYoToXkKNKT/zej+lgqFq/ACx9P/mQtB3hd6GGafHSHTDjN+GhZDLX8XTQQ0u+p8qDkPcSJU5ULD8V+M7t8kKLybezie5qccCJLdpxnmUDpCcl/1M24OFEBt7VWaCGh23SudUNviY+x1b8+ARu5pRvc/oVJUxnE1PmiH4t3b1DuaixDP9GuMl8GNKVBI7v00E9D09uZCbV4VY69pnhsazw0wqktzoTK7geOqm2ODYkY59SqLJQTJ7hbGy4VpULEVn6CZgKZ37RWoZb8wyJg77pGhsZ/R7ZGgstbHcVUXy1Dk7Kfe8akSQuRGxon/sxyopL7bTTMBze+YW4bCmdvCmDsoQauZ0f1dgsL+HcdXO8sGRf5B6lUWS1A0Mk7O3ZsChS2vnqYCmt+5IhdU7DWMtc4t0JrjY1R9j0LFU8LxNT1kh2JmBfXKJ0sIkc4xTiocEhQpK/w0FdD8Bj4rhIq8vYsxVv8ANGx/ZHQXXFCZXc3xdb7phGJxPfXKJiHEkdHK+Oh+Q4LK3HKaC2gBnescUEizqxljxxdAw/kXRncKakvPMYrKNAkBkv2TPuqVehDimdHO+CifCxX5rW6aC2gF+zKgYtvNGCubBY2UbxndLqh92MsoOh91IMC+6BrD7JUQkrPZz/j4ayoUkvM4TQa0gqsvQkV6voOxdWAqNBZdYHT/H2rHGVXbSx4Zw3JevMhw30Mx5QDjo+NRGxRpm27SZEBLKHfIUBR8MMCY2lMAjT8yurOPQiHZmhjdle+fn3XXzPkbDlzhGL6BYn4d46L/Mw9UCqtoNqAl3FzsgsJVcJGxNPhiNjT+ndH9PQMKR8ZV3omuxrr6lkGOpXsDFJv7GRf18+xQyKv6aDagNZQUQyG7jjOWOu9Og8aXjO6PTiiynvfzZzo9D0Fy4THGx5EMCYrigzQd0BpubZShsu0mY+jWNBfUbIcZ3RdQKS7hz3WwCEHO128yLnyboba5naYDWkRpugTFlCOMoRu5EtQyTzGq/jlQmV/Dn6l7uQdB6acZH8dmQUWqoPmAFtHwoAOK1JcGGTsdXmgUtzKqo1Db2EWt/vZ+/iinPDYEeDf4GBe+1VlQpN51nuYDWsTA5x6oTG9k7LRnQWPlIKPaCbXd1PDXbHvkjaM+3rneHQiSVl1gfDTJUJm8Y4DmA1rFrSdcUGS/42PMXM+CxteMqv8pqDhKqVG2MNebO/MP/bxjZdMRYMs+wvjo+wRqq2/RhEDL+KEQCvf0RsbMjRwJakcY1YUsKOTcKqr5VnoApDzTyjvVscqFUbacd7oYH6fuh0rWPpoRaBkdL0LtCGPmVqEdalcZVRVUHPc1Uu1MJoakrGjjHbr2tBsBnvU+xsleN1TuP0kzAq3jiEeGYvN1xsrgc6lQu8modkLF9XQLVQb+4MGQtN/5eWfaNqfZMEJybu9knHRvkKGQ/jBIMwKto2meC4qpBxkzO71Q62RU/wmV1M/6qNKyzIUhWad4Z9pXp2OUK3/TdcZL+VQo3I/coCmB1jHwu2woHM/0MVb2FEDtFqO5uBgqabVUOznLjiE5rbwTV394zCVh1OR3fIyXrmc9UBTvozmBFtL5rAOKnDrGypGZUJkzyGh2pkMlq4VqZRkSgLQ1fo7Pf/1Kc92hjQUOjMpaU+Vj3NSm2xFi23yb5gRayZ5cKFJf72SM1N4HlS8Y1Z8cUMhLBqi2B8OmlHAcPY21FZ+ufXJRjg0jJLf3yV0tjJ+e96GQc47RpEArad8MhW3SccbI+Ueg8gWjOb9AgiL971S7+QKGPXCSkV16bUphfo43w2PHCMk19+MbjKfyWVC43+ykSYGWUpFhQ4jtLT9jw78dKl8wioGVUCv4gWrlszBsu4+RlUyBhj3/qVOMp4FX0hFin3yaZgVayq0VHijmVjJGjshQfMEo/u6A2txjVBl4KQeA5CjnOHYX2YfZZAkjnLNf+GqQcVQ/BYrM9YM0K9BaaqZDkfl8H2OjrsCBkDl+jqvufglqD9ZT5VK2E4B7ThPHUf30ggUL5s+Znp/pwjDZUzBvU0lNL+Pk9qsZUKxrpWmB1uLfloUQW3o9Y6P5l6lQXON4GhZK0NjaTZVaCUOyd/g4jv6L9UNO152oKCvd//2aPAzLmP/r+n7GRU2eA0Gyp5TmBVpMy2oobO/dZkz4P8uG4ijHUf0AdA5SpesdDJtSzzt37VUZozI2djAO+t+BwjmtgeYFWk25S0aQNKOKsXFjmYyQnYzs7EMO6JRSpXoOhjjX9vNH6C5/OgXDHJM2VfRzwlXMgyLv80GaF2g1nSszEOLazRj5zouQp3oYSeNihCmlyg/pGDK5hD/OuVU2jHAU/b6bE8y/PgMhKWu7aWKg5bQ8B8WKNsZG3SKEuCsZQdWDMsIcoOLmaglDNrfzR6pJtWGELf21dk6s+hwJIdOP0MxA69mXJSEo51UfY2LwU7uEAPkvHNuphTYA9qwp011QvDvIoP538wDYUiv5Y/k/KUZA/uZ2TqSut1KgeKebZgZaz+U1NgTZMxoZG+3LUhB0XwPHUj4fQxx5S9avzYbiqSsMOp3rBOB59hZ/NN9mJwIcr7ZzAlUV2BBkzzxJUwMtqDoVQZLtw17GRutyCQHyAw0Mc+ZPd0sYMnl7e+fF5VDcV8uAjtfsEoBplfwJyosljJLS3/Rxwgy85UDIpG29NDXQgro3TULIgirGSPkCCUFL6qlz6lEMS3u67DbJ3dkIyX+9lyO63izAkKw3+vgTnHtMRtCUX/s4UarmI8S2qp3mBlpR61oJQa6vGSODFQ+7JATM+VMjVU78rzkY5nquicMurZMRJGd97uOQjm0ZGCKvucSfYvAPdgRJ9kpOkL6VGQjJ2keTAy3pcLqMAHlZC2Pl8oYUBLkWf1t7tu1G1+3O62d3/XmRjGGu165wVLXXgSD7lI0lRw7vXjXJDsCVU8ef5lyKhCDp+UucGKcy7AjZeoMmB1pSx4upCMrYdIuxcvn1HCcU9qzCmTPvKkrBCDlzxb7rDOgvfTYVIfa0/DynjCHyU6UD/Gl6l7gQkraHE6LrHRlBzuw6mh1oTSfzECTZjzNmbm/MRiSulc1UaXwMY3Dt5U/2Dy8UK29xIhydjBDvuj6aHWhN/m15CJK23GDM9J18uzgF4exZLx/vpsbll/IkaDlyf9vDn2xXHhSFvxlk7HW/7EaQtPEGTQ+0qMubZAQVlzCGbh3dMqcgXYJCcuXM2FhyjXrXSjfMyLZLCHJMev5AH3+6/cVQpN3dytg7XIwgefJRmh9oVRUuCQG2ZV2MJX/9R/c4ZYTYC7ee6OFYfDWvZNkQIHu3XuXPcfguKCRHI2OuY7ETQe7tnTQ/0Ko6X/MiKPM3/Yypgdb6ik82rHr26WdXrvu4rPa8j5H0nKmrPLJj5VNPLHu77FQvf5bKuVCrYaz1f+qQEOB6/BotALSsKyvsCHDOPsWYG+i4fKnlUlu7n1H52i6ev9DFn6v2HqhVMNaqFiCkYA+tALSufbkIkNwlTHqDp4/s/vbAiU5GVL8QaocZY4ObUhDy+m1aAWhdHa8hZHULk9y1Tx+enp1WeN+b1d2MoPEBqH3gY2xVFyHIOf0ELQG0sNpUGwIyn+9nUjv/jIRRkzZ1c2yNi6C2oo0xdX1FCoK8O3ppCaCF9W7LQ4DdW8tkdvWJVAQ4vJ/5OKa6e6C2tp0xVeaREeBa2UVrAK2s4wUHAuxbrjN5dX8AhTT3BMdUNQ9qHw0wli5vQMicY7QI0NIOZUkISC1h8iqfDrVdHNPRWVArY0x9lYaQjwdoEaCldW53IMC25hqT1r50qG3q41hKp0GtkrHUttSOgIz112kVoLVdfTwFATmv9jJZfStD7f6LHMu+IigkRy1j6NbrqQhwPNtCywAtbv8UBMiuWiarndBY0MixfJ8PhcN7ljFUliYhwLuP1gFanO/9DBkBr3YwSX0rQe2+8xzD4KoMKLyv9DB2brwoI0DafovWAVrdtfWpCMjZxyT1vQMq0sZejqE9zwnF1ErGzuC2AgS4H71KCwEt7+rjNoyyr7jG5FSSBRXHXo7lnFuCYnUXY+eM14GA6WW0ElA4NAMB3q23mZSOz4ZCXnOZY6myQ+Hdx9jpes+GUVLm9j5aCSj0vO+SMEJOqWJSur4FIa7FFziW7vdtUKxpZewcyZcwyr66jZYCCuzYkI5R8uZ2JqVyBDk2tHJMDQ/ICJIcxxk7Nzc6McqWXUdrAQXy0goXRhXuZVI6V+jGsMkb91/h2MomIyTnlR7GTP87kxFQ8Kaf1gIKQ/bnIuDRa0xGg29OxhDpyfOMwP+yhCBpw03GzmmXjIBXO2kxoDCk50OHhBGpL99gMurd4sKQ2b8d5JgGf12EIPv6VsbOja0yRrkXnKTVgMKw66szMEJOP8Sk1LrGIQFZC/88wLHUFbgR4F56kTFUUoBRzscrBmg1oDDi8gqMklZdZFJqe8gGSI5Jb3Qw3PkVMoIKf2AMtT8tY1TO97QeUBh1ZKqEEVnrbjMpXXxeBmCb/OLBmosDVOsqX5WBANec3/sYO12vZ2KE5NreSesBhVGd76bKGOGuYHI696RbxhA55+HfX6fi6hteO0ZJmSuP9TGGKtJsGOFZcY0WBAoBN5d7MEJe3szk1PJ0CobZUrOX/uWfe0orT9afrj74zePpNoySHFvbGUttL8gYtfwyrQgUglrWyBiR+noPk9PVj+5JlzBCTp00dd4Dv3jonikZMgImbzrayVjybcnFqLsO05JAIeSIV8aI4g8HmZz81evy0t02hJOc6Y/sucrYqs7GCNm14zYtCRRCun+VjhGuyY1MVv2Nn/6iQIKezTP/45uMsdbnnBiR+fxNWhMoKG6sy8Sod7qYtPrOV+9/ZUFxTlaa2253ZeZPm7volR9KKxt9jLGubS4Jw1xr22hRoKBybgVGTSphUus6se+bNbOLvFmFz+86WNnQxYnwXR5GSHlltCpQUCvPsWOYc9UVJrvBWzc6Om4McKK0PerCMCntd/20KlBQ6357koRhWZs7aW0dr9kwYtKL3bQsUNDoWWPHMMlRRmvbn4pRmzpoXaCg1bYJozZeppXdXC9jmPu+OloYKOi0POZNG+KZd4RWdvJhb3paWlr2c1WDtDBQ0Gt5Y+GiRQvv/7CdVjZw4q2HH1i4cHsLLQ0UwvS0tDQ3N/tocd3Nzc0tvbQ2UBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISI/hsxidvOs75EsAAAAABJRU5ErkJggg==","-1":"data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEAYABgAAD/2wBDACYaHSEdGCYhHyErKCYtOV8+OTQ0OXVTWEVfinmRj4h5hYOYq9u6mKLPpIOFvv/Bz+Lp9fj1lLf////u/9vw9ez/2wBDASgrKzkyOXA+PnDsnYWd7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Oz/wAARCAMgAyADASIAAhEBAxEB/8QAGgABAAMBAQEAAAAAAAAAAAAAAAQFBgMCAf/EADwQAQABAwEFBQYEBgICAgMAAAABAgMEEQUSISJBEzFCUXEGMjNhcrEUI1LBNDVigZGhFZIkglPwJaLR/8QAGQEBAAMBAQAAAAAAAAAAAAAAAAIDBAEF/8QAHREBAQEBAQEBAQEBAAAAAAAAAAECEQMiQTEhEv/aAAwDAQACEQMRAD8AuwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB8mYiNZnSCJiY1idYB9AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB8mYjSJmI17gfQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHi7dos25uVzpTD1MxEazwhnNr585FybVufyqZ6dQcMzNu5N+aoqqinupiJ6LzZFi5Zxt67MzVXpOkz3QqtjYX4i92tcfl0f7lpAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGf23avWsntYrq3K+7j3NA5ZNijJsVWq+6e6fKQU+x9ozFUY9+rWJ92qei9Y6/Zrxr9VuqJiqmWg2RnfibXZ1zHaUR/mAWIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAI2fl04mPNc+9PCmPmCDtvO7Oj8Paq5p96fJSWLVV+9TbojWap0eblyq7cmuudapnWZXuwsTctzkVxzVcKfQFji2KcaxTap6Rx+cuwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAqtt4fa2e3ojno7/nCisXq7F2m5ROk0y2MxExpMaxLLbTxZxcqqI9yrjSDR4eTRlWIuUzGvWPKXdltl5k4uRGs/l1cKmoiYmNYnWJB9AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB8mYiNZnSIZfamXOXkzMTyU8KVptzM7K12FE81fvfKGeBIwcarKyabcd3fMtZRTTRTFNMaUxGkQr9iYsWcbtao57n2WQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACHtTF/FYsxEa108aUwBipiYnTrC/2Hmdra7Cueaj3fnCBtnE/D5O/THJXxj5ShWLtVi9TconSaZ1Bshyxr9ORYpu0d1Ud3k6gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPF67TZtVXK/dpjV7Um3svux6J+dWn2BU5N6q/fruVTxql22bizlZdNMxyRxq9ERpdi40WMSK5jnucfSAWERERpHCIfQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABF2jjRlYtVGnNHGn1ZSY0mYno2rM7Zxuwy5qp925xjToDpsTM7G/wBjXPJX/qWiYqmZpqiY74avZ2TGVi01680cKvUEoAAAAAAAAAAAAcJy7MZHY73N59NfJ3Ou3Nn9ABwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABzv3abFmu7V3UxqyF65VevVXKp1mqdVzt/K0inHpn51KMEnAx5ycui3011n0ayIiI0iNIhU7Ax921XfmONXCPRbgAAAAAAAAAAPkzpGsvNy5Tat1V1zpTTxlnc/at3ImaLc7lv5dQW2VtbHx5mmJm5VHSn/+q25tzIqnkoopj0QsPEuZl7ct+szPRocbZeLYpjW3FyrrNXEFNG2MymZneidekws8LbFq/MUXY7OuevSUu7hY16nSuzR6xGks/tLZ9WFXvU61Wqp4T5fKQaauum3TNVdUUxHWUWnamHVc3Iu8fPSdGdvZl+9ZotV1zNNPRHBtYnWNY7n1G2dvfgbW936JIAAAAAAAAAAAAAAAAAACDtfH/EYdWka1Uc0Jz5MaxpIMUsti5XY5PZ1TyXOHpKNtHH/DZddERpTrrT6I8TNMxMd8A2oi7OyfxWJRXM80cKvVKAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WhabPzt7Szenj3U1T1+SrEJeNXp5zc5WmFbs/O3tLN6ePdTVPX5LJdL15m8XF5QB1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAebldNu3VXVOlNMay9KrbuT2ePFmmeavjPoCjybtV+/XcqnWZl4opmuuKY75l5WOxLHa5sVz3W43v7g0OPaixYotR3Uxo6AAAAAAAAAA+TMRGs8IfVTtzMm1bixRPNX73ygEHa20Jybk2rc/lUz06/NX26KrtymimNaqp0h5W/s/j716u/VHCiNI9ZBb4WJRiWIopjm8VXnKQADhm2ab+Lct1daZ0+Uu6Pn3exwrtfXdmI9ZBkZjSdHu1RNy5TTHfMvCdse12mfRP6OYGmop3KKaY6Ro9AAAAPNVdNEa1VRT6zoh5O1MbH1iKu0q8qe7/IJwy93aN/JyaKt+aIieEUzo01EzNFMz3zAPQAAAAAAAAAAAAAKf2gsb1qi9EcaeE+ihbHKtdvjXLX6oY+qmaappnvgFpsHI3MmbMzwrjh6tCxlqubdymuOk6tfYuRes0XI8Uag6AAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQABabPzt7Szenj3U1T1+SrEpeIennNzlaYVuz87e0s3p491NU9fksl0vXmbxcXlAHUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABlNp5H4jMrqj3Y4Q0O0r/4fCuVdZjdj1lk5nWdZAaPYdjs8TtJ77k6/wBmeopmuuKY75bCzbi1Zotx4Y0B0AAAAAAAAAB8qqimmap7ojWWQy79WRkV3Kus/wCGj2tc7PAuad9XCGWAanZNnsdn2461RvT/AHZrHo7S/bo/VVENjTEU0xEd0RpAPoACr2/dijEptda6v9QtGd2/d3sum30op+4Ktd+ztrhdu/8AqpGp2Tai1gW+HGrjIJoACo2zTl1XaIx4uzRu8dzXTXitwGYp2ftC7OkxX/7TLxmbPuYduiq5Ma1dIapT+0PwbXrP7ApLPxaPWGxt/Dp9IY6z8Wj1hsbfw6fSAegAAAAAAAAAAAAAGY2zZ7LOqnpXzNOqdv2d/HouxHuTpMgz6/2Bkb1mqxVPGmdYUCXsy/8Ah823VPdM6T/cGrAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPlUxTTNUzpERrIKL2gv71yixHhjWVO75l6b+VcuVdZ4ejgCdsezN3Pon9HM1Cn9n7Olu5dmO/hErgAAAAAAAAAAFXt+uacOin9VX7M60e36dcKmryr/AGlnAT9i2+02hRM91MTLTqH2dpib16rTjFMaL4AABkM27N7Lu16661Tp6NRm3Ys4l2uZ00pnT1ZDvB6t0TcuU0R3zOjZW6Iot00R3UxozGyLc3M+3p4eZqQfJmKY1qmIjzl8pqprjWmqKo84nVUe0F+aabdmmZjXml99n6auyuVzM6TOkQC4AAU/tD8G16z+y4U/tD8G16z+wKSz8Wj1hsbfw6fSGOs/Fo9YbG38On0gHoAAAAAAAAAAAAABxy7cXcW5RPdNLsAxUxMTMT3wROkxMdEnadrsc67TppEzrHoig12Bei/h2648tJ9YSFN7P3taLlmZ7uMR91yAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEPal7sMG5VHfVy/5TFH7Q3ombdmOnGQUoOmPb7XIt248VUQDU7Otdlg2qNNJ01/ykvlNMU0xTHdEaPoAAAAAAAAAAI20bM38K5REazprDJTGk6Nszu2NnzZudtapmbdXf8pB79na4i/donvqpiY/sv2OxcivGv03aO+Onm0eNtTGv0RM1xbq601AnPkzERMzOkR3yjXdo4tqmZm9TPyp4zKkz9p3cz8q1TNFvy6z6g9bW2j+Jq7G1P5VM8Z/VKsW2Lsau5j1XLs7tcxy0quumaKppqjSYBb+ztHPdueUbv8A9/wvWd2Jl28e5XRdq3aa47/mnbS2napx5os171dXDh0gFRtG/wDic2uqOMa6UtFs+x+Hw7duY0q01n1Uex8ScjJ7SuOSjjPznyaUAABT+0PwbXrP7LhT+0PwbXrP7ApLPxaPWGxt/Dp9IY6z8Wj1hsbfw6fSAegAAAAAAAAAAAAAAAUXtDZiLlu9HijSf7KZptt2u0wZqiONE6syCXsu92Gdbqnumd2f7rvPzuz1tWZ5+tXkoLFqdYrnhp3JKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGV2td7XPuTHdE7vD5NPer7OzXXrpu0zLHV1b9dVU9Z1B5T9i2+0z6ZnupjVAXns7b5btye/hEAugAAAAAAAAAAAHyYiYmJjWJ6PoCqyti2rnNYns6vKe5Aq2LlRPCKZ/vDSAM9a2HkVVfmVU0x/la4mzcfF0qpjer/VKYAIOdsy1lzv+5c846pwDOV7EyaZ5Zpq9J0e7GxL1VcdtMUU9eOrQAOdmzRYtRbt06Uw6AAAAp/aH4Nr1n9lwp/aH4Nr1n9gUln4tHrDY2/h0+kMdZ+LR6w2Nv4dPpAPQAAAAAAAAAAAAAAAOeRR2mPco011pngytqxO9M190T3ea+z87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIO2bvZ4FenfVMQy689ornLatx38ZlRgNPsW3ubPomY41TMsxEazo2GJRFvFtUx0pgHYAAAAAAAAAAAAAAAAAAAAAAAAFbtm9kWaLU481azM67oLJT+0Mx2VqNeOsoMZe0pjh2v+JR7tGXeq3rlF2qfnEyDla+LR6w2Fr4VH0wyP4a/wD/AA3P+spFu7tG3TFNPbxEd0cQakZn8ZtHzuf4lpKJmaKZq79I1B6AAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAM1tyvez5iJ4UxEK5Iz6+0zbtUd29OiODri0TcybdEeKqIbCIiIiI7oZbZNG/tC3EdJ1/wANUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHi9O7ZrqjpTMvaLtKrcwL1Xy/cGUqq3qpq85fABabAo1zJr/TTLRKX2dp4Xq+vCF0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAARr97Xlp7uspSdQ9PSYnasNlV0XNoRRpExETMT81+ymy6t3PtfOqIatdJx5m93d7QB1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAVm3a93C3f1Ss1N7RVclmnXjrMyCiABodgUaYlVX6qlqr9iU7uz6fqmVgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnapczftV9lVG7OkTKIs9vU6Zu95xCsXSceZvd3e10x6+zv0VxOm7OrY0zvUxMd0xqxTY41UV41uqP0w6g6gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAM97QV65VFH6aWhZjbdUVbQq06REAgARxnQGt2dTu4NmJ/TqkuWNGmNaj+iPs6gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tUXtFTO/Zq6TEwpl97RRrZsz5TP7KF1AavZlW9s+zPy/dlGm2JVvbPpjX3ZmAWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADJ7TnXaF75VTDWMfl1b+VdqnrVMg4vVuNblMfN5dMeNci3H9UA19qNLNEf0w9gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQVe36dcOmryq0Z1pduRrs+fqhmgGg9nqtce7HlVDPrv2dq4XqPPSQXYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPNc7tFVXlGrHXZ1uVT82wvfBr+mfsxszrOoPiRg072bZietcfdHStmRrn2fqgGsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAIW141wK/lpLLNZtKNcC99LJgLf2en8+5H9Ov8AuFQtNgVaZtUedEwDRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5ZMxTjXZn9Msc12fOmFdn5MiAm7JjXaFv1QlhsP8AmVHpP2BpgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9FiC6TjzN7u72gDqAAAADhmRvYd6J/RM/wCmQbHK/hb30VfZjgFjsOdNoR86ZVybsidM+36g1IAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIu0uGBe9P3ZNq9qcNn3vSPuygCw2H/Mafpn7K9ZbC/j4+mQaQAAAAAAAAAAAAAAAAAAAAAAAAAAAAABX5+d2etqzPP1q8jPzuz1tWZ5+tXkqVetfkbPDw79aAFTaAAAAAtcDB3NLt6Obw0z0Sk6h6ekxO0wMHc0u3o5vDTPRYguk48ze7u9oA6gAAAAAA55H8Nd+ifsx1XvT6tjf+Bc+mfsx1fv1eoPiXsudNoWfqREnZv8wsfXANaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACHtbhs296R94ZVqdsTEbNvfPT7ssAstg/x3/rKtWewf43+0g0YAAAAAAAAAAAAAAAAAAAAAAAAAAACvz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7QB1AAAAAAAAB4vfBufTP2Y6v36vVsb3wa/pljrnxKvWQeUnZ38wsfXCM7YfDKtfUDYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgba/l1frDMNPtr+XV+sMwAs9gz/5unylWLLYUf8AnxP9Mg0gAAAAAAAAAAAAAAAAK3O2tax9aLfPc/1ALCqqmiNa6opjzmdEO5tXDtzpNyZ9IZ6/k38q5rXXVVM90J2NsS9cpiq7XFuJ6aayCfTtrFmrSd6I89E61ftXqd61XFUfJUXdg8NbV7WfKqFb/wCTs7I460Vx/iQa0UWTtuarFMWY3bkxzT5eiupzsmm5v9tXr86ga4ccO7N/Ft3ao0mqOLsAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAeL3CzX9M/Zjq/fq9ZbC/Gti5H9M/Zj6+FdUfMHl1xp0yLc/NydMeNb9ER5g2QAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIG2v5dX6wzDT7a/l1frDMALPYP8AGf2lWLPYP8Z/aQaMAAAAAAAAAAAAAAETaOZTh48zE/mVcKYBE2vtHsYmxZnnmOaY6fJQcZnzkqqmuqaqp1mU3ZGL+JzI3o1oo5p/YFlsfZ3Y0xfvR+ZVHLHlC2ABA2vixkYlVUR+ZbjWJ+8J7lk1xbxrtc90UzP+gY59piZqiI6vk8Z1SdnW+1zbVM92vEGpsW+ysUUfphDz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7QB1AAAAAAAAAAAAB4u/Cr+mWOufEq9ZbG78Kv6ZY658Sr1kHl1xf4m39Tk64v8Tb+oGxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABA21/Lq/WGYafbX8ur9YZgBZ7B/jP7SrFnsH+N/tINGAAAAAAAAAAAAAAy21cqcnLmY92nhS0Odd7HDu19YjgyMzrOoDR7Csxbw+0mOa5P+meopmuummO+qdGwsW4s2LduPBTEA6AAK/blzcwKo141zELBRe0V3W5atRPdEzMApkzBqrs71ynhVVGkT5fNysWd7mq7ukeaSr1r8jZ4eHfrQAqbQAAAADPsXrFm3VVGkV/5hKTqHp6TE7UjZd7HnM3bnGrwT01XzFUzNMxMTpMNbg3vxGJbuT3zHFdJx5m93d7UgB1AAAAAAAAAAAAAAB4u/Cr+mWOufEq9ZbG78Kv6ZY658Sr1kHl1xf4m39Tk64v8Tb+oGxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABX7b/l9XrDMtPtr+XV+sMwAsthfx8fTKtWewf43+0g0YAAAAAAAAAAAAAK3btUU4MR1mr9pZtofaCmZxKJ6RX+zPAlbMtdrn2qekTr/ji1jPez9veyq6/wBFP3aEAABnM/8A8jPuXJ92md2I9Fnn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpno87fpicKKusVxCzU/tDd0tW7XnO8uk48ze7u9qhaPYNUzhzT0ipnGp2TZmzg0RMaVVcZdQTQAAAAAAAAAAAAAAAc7/wLn0z9mOr9+r1bK98Gv6ZY658Sr1kHl0x/j0erm64v8Tb+oGxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABD2v/Lb3pH3hlWr2rx2de9I+8MoAstg/x3/rKtWWwv46PpkGkAAAAAAAAAAAAABB2xb7TZ9f9PMy7aV0xXRNNUaxMaSyedi14uRNFUcO+J84BY+znxL/AKR+69ZbZOVTi5cVVzpRVGktRTVFURNMxMT3TAPqvz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7XyZimJmZ0iOMsptHJnKy6q+6I4RCz21n7uuNanj4pj7KvCw7mXdimmNKetXk6g67Lwqsq/EzH5dPGqWniIiNIjSIcsbHt41qLduOEd8+bsAAAAAAAAAAAAAAAADxe+Dc+mfsx1fv1esthf8AgXPpn7MfX79XqDy7YfHKtfU4pOzv5hY+uAa0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEXafHAven7sm1u0I1wrsfJkgFjsKf8A8hH0yrlhsP8AmNP0z9gaYAAAAAAAAAAAAABHzMO1l2925HGO6qO+EgBlsrZmRjcd3fo86X3Eu5NmmYpuVUU/pXGfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7RA2pn04tqaKJ/Nq7vk9bRzqcO1w0m5PdHkqsLBu7QvTfvzMUa8Znq6g44ODdzrs1VaxRrrVVLSWbNFi1Fu3Tu0w+27dFqiKKKYimPJ7AEHa2RXjYm9bq0qmqIh92Tdu3sTtLtW9M1cATQAAAAAAAAAAAAAAAc8j+HufTP2Y6r3p9Wwyf4a79E/Zj575B8Sdm/wAwsfXCMlbMjXaFn6oBrAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAccqnexbsf0yx7ZX/gXPpn7MaAn7Fnd2jRr5TCAmbJnTaFr1BqgAAAAAAAAAAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9FiC6TjzN7u72iLnZlGHZmqrjVPu0+bvdri1bqrnupjVk8vJryr83K57+6PJ1B3xpt5WVN3Mu6Rrqvac/Copimm9TER3RESygDWf8AI4n/AM9P+JP+RxP/AJ6f8SyYC021m0ZFVFFqrepp119Vvsunc2fZj5fuykRrOjZY9MUY9umOlMA6AAAAAAAAAAAAAAAA5Zf8Je+ir7Mc12fO7hXpj9MwyICZsmNc+18pQ1hsSne2hTr0iZBpgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAebka26ojrEsbcjSuqPm2jHZMaZFyPKoHJK2bOmfZ+qPuiu2HVNOXamOlcfcGwAAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoPNyim5RNFXdMaSgf8Nh/pr/7LEBXf8Nh/pr/7H/DYf6a/+yxAV3/DYf6a/wDsf8Nh/pr/AOyxAQKdj4dNUVRTVw86k8AAAAAAAAAAAAAAAAARNqVRTgXfnGjKNPtmdNn1esMwAs9gxrnTPlTKsW3s9H/lXJ/o/eAaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABktoxpn3/rlrWW2vTu7QufPiCE6WJ0v25/qhzeqJ0rpnykGzjjGsPrxZnWzbn+mPs9gAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAAAAAAAAAAAAAAAAAAFdt2dNnz9UM00HtBOmNbjzlnwF17Oxz3avlopV97OxpYvT51QC4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAZzb1Mxnb3nTDRqL2ip/MtV+caApgAbDFmKsW1Mfoj7OyLsyrewLU69NP9pQAAAAAACvz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7QB1AAAAAAAAAAAAAAAAAAAAAAAAAAAABTe0VXJYp+c/solv7Q1a37dP6YVADSbCo3cHe61SzbV7Kp3dn2Y+U/cEsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABUe0NOti1PlMrdA21Rv7PrmI40zEgzAANLsOrXZ8RrxiqViqPZ6rXHuU+UwtwAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9FiC6TjzN7u72gDqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADNbdq1z5jyphXJm1qt7aF2fKdEMBscamKMa3TH6YZLHo7S/RREazM6NjTG7TER3RGgPoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADhm0dph3af6dXd5rp3qKqfOJgGLHu9Tu3a6fKdHgF17O1816jziJ/+/5XjNbCq0z4jXhNMtKAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAc786WLk+VM/YGSyq5ryrtU9ap+7k+1TrVM+cvgJeyqd7PtfKrVq2d2BbmrMmvpTTLRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAye07fZ592NNNaplFWu37W7lU3P1UqoErZlW7n2fnVENYxlmrcu0VeU6tjRVv0U1ecag9K/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABF2lc7PBuzrprGiUrNvV7uFFH6qvsDOAAvfZ6jS3drmOMzEQuUHY1vs9n0T1q1mf8pwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKr2gt72LRX+ir7s81m0rXbYN2nTWYjWP7MmAv52hMYVui3PPNOkz5KexZ3uaru6R5pKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFJ7RV/Bt+srtmdt3N/PqiO6mIgFe+0xNVURHfL4kbPt9rm2qZ7t6NQanGoijHt0xGmlMOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA+VUxVTNM90xpLK1Y25kXIrjhTVMRC7z87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPkzpGssjmXO1y7tfnVOjUZlzssS7XPSlkJnWdZAWvs/Z3smq70op0/yqmj2Da3MOa+tdX2BZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFZt67uYcUfrq+zOLb2gu72TRa6URr/AJVIPtNM1VRTHfM6Nhi2+yxrdGmmlLNbKs9tnW6Z7onen+zVAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAHO9et2aJruVRTEefUHQUWVtyuZmnGpimP1TxQIu5mVXy1Xa5n9OoNXFVMzpFUTMdNX1k7ljNsxvV03aY8+KXg7YuWppov89Hdr1gGhEW/n2LFim7NWsVRrTEdVdTt7W5zWdKPXiC7Hi3cpu26a6J1pqjWHsAAAAAAAAAAAAAAAAAAAAB8mdI1l9RtoXexwrtfDu0j+4M1n3e2zLtcd01Tp6I4+xE1TER3yC89n7GlFy9Md/CJ+65cMKzFjFt24jSdNZ9XcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABX5+d2etqzPP1q8jPzuz1tWZ5+tXkqVetfkbPDw79aAFTaAAAAA8Z1u7YiimuN3fjVKTqHp6TE7XG9f46UT3dWpxLvb4tu5+qGPaD2fvb1iu1M8aZ1iPkuk48ze7u9q2AdQAAAAAAAAAeL12izaquVzpTTGsg45uZbxLW9VOtU+7T5szk5V3KuTVcqmfKOkPuZlV5V+blXd0jyecWxVk5FFqnxTx9ATNlbN/FT2t3WLUf/ALNDbt0WqIpt0xTTHSC1bptW6bdEaU0xpD2D5PHvUm2tn0UUfiLNO7p78R91455FNNWPcir3ZpnX/AMdNUzERMzMR3Pj7PfOjriW+2ybdv8AVVoDUYNE28O1RPSlIfIjSNIfQAAB8mYiNZ4Q4V52LROlV+iJ9QSBGp2hiVTpGRRrPzSKaoqjWmYmJ6wD6AAAAAAAAAAAAAApvaG9pbt2onv4zC5ZXal/t82uYnWInSPQENO2Rj9vm06xrTTzSgtHsLH7LFm5Mc1yf9AswAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9DbWP22HNcRzUcdfksXyqmKqZpqjWJjSYXSceZvd3e1ik3ZOR+HzaJmdKauWfRxzLE4+TXbnpLjE6Tq6g2oj4F/8RiW7mvHTSfVIAAAAAAAAAUG3cvfuxYoq5afe9V5euRas13J7qY1Y65XNdyqqeMzIPK89n8fSmvImO/lp/dRtbs+z2GFao00nd1n1kEkABD2rd7LZ92fON3/KYpvaG7pbtWo8UzVIKJZbCtdpm70xwojVWr/2ftbtiu5Me9OkSC3AAR8zLt4lnfr7592POUhmtt35u5s0a8tHCIB9mvN2pXM0a7kT3R3Qk29g6x+bf4/0xqh7O2lcxaotzpVbmeMT0aamYqpiqJ1iY1gFDlbErt0b1iubmnSY4q61kXse5vUV1U1Q2DL7Yt02toVxTGkTpILrZufTmW9J4Xae+PP5pzH4l+rHyKLlM6aTx+bX0zFVMVR3TGoPoAAAAAAAAAAAI2fe7DDuV9dNIZKZ17117QX+aixE93NKlB1xbNWRkUW6Y1mZa+3RFu3TRT3UxpCm2Bje9kVR/TT+67AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoKjb2Lv24yKY408KtI6eagbS5RTct1UVxrTVGksjlWKsfIrt1RpMSCz9n8iKa67FU6b3GPVesbj3arN+i5T30zq19q5TdtU3Ke6qNQewAAAAAAAQNtVzRs+qI8UxEsw0HtDOmLb+r9mfB2w7c3cu1REa61Q2DN7Ct7+fFWnuUzLSAAAMzty5FzPmInWKIiGlqmKaZme6I1Y6/X2l+5X+qqZ/2Dm1uz7XY4VqjTjpqy+Lb7bJt2/1VaNhEREREd0A+jjlZNvFtdpcnh3REdXjDzbWZE9nrEx3xIJLN7Zxq7eXVc3ZmivjEtI+TEVRpVETHlIMhj49y/epooomZmWttU7lqij9NMQ+00U0e7TFPpGj0AzO3J12jXHlEfZpLldNuiquqdKaY1lkcu9N/JuXJ8Ug5UUzVVFMd8tnbp3bdNM98REM9sXDm9kdtXHJRx9ZaMAAAAAAAAAAB8qqiimaqp0iOMy+qzbmT2WN2VPvXO/0BRZd6cjIruT1nhHk8WrdV27TRTGs1To8LjYOLvXJyKo4U8KfUFzjWYx7FFqnwxx+cuoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/aGb2Wtq1PP1nyWCLm4lOTRrHC5HdPn8nNd5/izyuZr6UY9V0VW65prjSqO+HlQ9UAcAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAABUbexd+3GRTHGnhV6ea3ea6KblFVFUa01RpIMWv8AYOVv2ZsVTxo40+ipz8WrEyaqJjl76Z84ecO/VjZNFyOk8Qa8eaKqa6YqpnWmY1iXoAAAAAAFbt2jewddONNWrNtjk2e3x67Wum9GjIXKJt1zTVGkxILf2c+Jf9I/des97P3Yoyq7c+Onh/ZoQAcsi/bxrU3LtWkR/sHDal/sMG5OvNVG7H92VSs7MuZt7eq4UR7tPlCKCx2Ha7TOiZ7qI3mlUns7TTpeq8UaR/ZdVVU0UzVVOkRxmQUXtBd1vUWonhTGsx80nYFncxqrkxxqnh6Ke9VVmZ1UxGs11cIhqce1FixRajupjQHQAHi7cps26rlc6U096vr23jU+5TVV/pYXrVN61Vbr92rvQp2NiT0q/wAgp8/aV3M5Ijct/pjr6veDsm7kaV3OS35+abk7Dt9nrjVVRXHSqe9W2s7LxK93fnlnjTV3A09m1RZtxbtxpTD2h4G0LeZTpHLcjvpTAAAAAAAAAAAfO6NZZbamT+Jy6qonlp4U+i62xlfh8WaaZ56+EfKGZB7tW6rt2mimNZqnRrcWxTjY9FqnpHGfOVVsHE78muPlTr912AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACLm4lOTRrHC5HdPn8lLXRVbrmmuNKo74aRFzcSnJo1jhcjunz+SGs9/2NPj7f8APzr+KMeq6Krdc01xpVHfDyqegAtcDB3NLt6Obw0z0dk6h6ekxO0wMHc0u3o5vDTPRYguk48ze7u9oA6gAAAAAAg7Ww4ysaaqY/Mo4x82XmNJ0ltmd21h9je7aiOSvv8AlIJmwsuLlmceqeajjHotmPxb9WPfpuUzpMS1tq5TetU3KJ1pqjWAewAAAAAFXtTZn4jW9Z0i51j9S0AYz8yxcieNFdM8Oi3x9u6URF+3NVX6qVrfxbGRH5tuJnz6oVWw8aZ5aqoj/IOd3b1vd/KtVTV/VPBXaZe1L+s61f6iFxa2Ni25iaoqqmPOeCfRRRbp3aKYpjyiAQbGyrFrHqt1RvV1RpNXl6KDLxbuLdmi5TMeU+bXvF21bvU7tyiKo+cAy+z86rCuzVu71M98JGftarKt9lbomime/jrqsa9i4tXu71M+ur1j7IxrNUVzE1zHn3AjbFwJp0ybscfBE/dcvkRpGkPoA+TMRGszpEKu9tuzbrmmiibkR110BaiJhZ9nMiYo1iqO+mUsBn9v2Ny/RdiOFccfWGgVHtDH5FqfnP7Ao7VyuzciuidKo7mrwsmMrGouR36c0eUsivfZ2v8ALu0ce+JBcgAAAAAAAPkzpGs9z6rNtZfYY/ZUTpXc+wKjamV+KyqpieSnhS5YmPVk5FNunrPGfJw75aXY+H+Hx+0qj8yv/UAnWrdNq3TbojSmmNIewAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABFzcSnJo1jhcjunz+SlroqormiqJiqO+Gkc6rFuu7Tcqoia6e6UNZ60eXvcTl/iFgYO5pdvRzeGmeixBKTire7u9oA6gAAAAAAAAOWRYpyLNVqvuq/wBOoDHZNivGvVW640mFpsLM0qnGrnhPGn1Ttq4MZdnepj82ju+fyZqJqtXInjFVMg2gjYGVTl41Nce9HCqPmkgAAAAAAAAAAAAAAAAibUmadnXpp79I+7KNlftxes126u6qNGSyLFePfm1cjSYkEnY81RtC3u/39GoVuyMXGt2u1tV9pXPfM9PksgFL7RVxu2aOvGfsuZmIiZmdIjvll9q5UZOXM0zyU8IBCaD2ftTTj3K5j3quEqbDxa8u9FuiPWfKGrs2qbNmm3R3UxoDoAAAAAAADxduU2rdVyudKaY1lk8zIqysiq7V1nhHyWe3czWfw1E8I41eqsw8avKvxbojh1nygE3Y2D29ztrkfl0d3zlonOxaosWqbdEaRTDoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAApNt4Hfk2o7/AH4/ddvlURVTNMxrExpIMts3MnEyInwVcKoammqKqYqpnWJjWJZ/N2RdovTNima7c8Y06LPZNGRbxpt5FOm7PLr3gnAAAAAAAAAAAAAAAAIudhW8y3pVwrj3akoBmruz83FqmbcVVRHHWl9jaudb4V1a6edMNI8zTTV71MT6wDNXsvOzYijmmPKmHrF2PkXqvzY7Knrr3tJEREaRGkPoOGLi2sW3u26ePWesu4AAAAAAAIm0cuMTHmrXnq4UwlqLauHmZGVNUUTVRHu6eQKqIrv3tIiaq65afZ2HTh2IjT8yfelH2Vs38NHa3oibk90eSzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB//Z"};var s={},u=e.data.map((function(A){return A.judgement})),i=m.Vw.majority(u);p.setButtonImage(p._display_image[i]),p.dataparams=[e,n];var l=new d.Layout(p.button_subwindow);l.setRect("Title",new d.Pos(0,0),new d.Pos(100,10),new d.RU_DataViewText);var c=(new d.RU_DataViewSuggestedActionBlock).setDataAnalysisFunction((function(A){var t=[];return A.data,-1==i&&t.push("JudgementNegative"),t})).linkMouse(l._layout_clickable);c.setHint("JudgementNegative","Vectorization"),l.setRect("SuggestedAction",new d.Pos(70,70),new d.Pos(30,20),c);var U=new d.RU_DataViewBarGraph({type:"bar",yAxes:[{type:"linear",display:!0,position:"left",id:"axis-1"}]}).setDataAnalysisFunction((function(A){var t=[],a=[],n=[],o=[],p=[],s=[],u=[],i=[];null!=A&&(t=A.data.map((function(A){return A.data.sp_ops_scalar})),a=A.data.map((function(A){return A.data.sp_ops_128b})),n=A.data.map((function(A){return A.data.sp_ops_256b})),o=A.data.map((function(A){return A.data.sp_ops_512b})),p=A.data.map((function(A){return A.data.dp_ops_scalar})),s=A.data.map((function(A){return A.data.dp_ops_128b})),u=A.data.map((function(A){return A.data.dp_ops_256b})),i=A.data.map((function(A){return A.data.dp_ops_512b})));var l=d.RU_DataViewBarGraph.colorList(),c=[],U=e.repcount;if(all_analyses_global){var M=t.length/U;t=ObjectHelper.createChunks(t,M,m.Vw.sumArray),a=ObjectHelper.createChunks(a,M,m.Vw.sumArray),n=ObjectHelper.createChunks(n,M,m.Vw.sumArray),o=ObjectHelper.createChunks(o,M,m.Vw.sumArray),p=ObjectHelper.createChunks(p,M,m.Vw.sumArray),s=ObjectHelper.createChunks(s,M,m.Vw.sumArray),u=ObjectHelper.createChunks(u,M,m.Vw.sumArray),i=ObjectHelper.createChunks(i,M,m.Vw.sumArray)}return c.push({label:"SP_1",yAxisID:"axis-1",data:t[0],backgroundColor:l[0]}),c.push({label:"SP_4",yAxisID:"axis-1",data:a[0],backgroundColor:l[1]}),c.push({label:"SP_8",yAxisID:"axis-1",data:n[0],backgroundColor:l[2]}),c.push({label:"SP_16",yAxisID:"axis-1",data:o[0],backgroundColor:l[4]}),c.push({label:"DP_1",yAxisID:"axis-1",data:p[0],backgroundColor:l[5]}),c.push({label:"DP_2",yAxisID:"axis-1",data:s[0],backgroundColor:l[6]}),c.push({label:"DP_4",yAxisID:"axis-1",data:u[0],backgroundColor:l[7]}),c.push({label:"DP_8",yAxisID:"axis-1",data:i[0],backgroundColor:l[8]}),{labels:(0,r.Z)(Array(t[0].length).keys()),datasets:c}})).linkMouse(l._layout_clickable).changeGraphOptions((function(A){A.options.title.text="FLINS per thread",A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).scaleLabel={labelString:"Instructions",display:!0},A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).ticks.beginAtZero=!0,A.options.scales.xAxes=[{scaleLabel:{labelString:"Thread",display:!0}}]}));return l.setRect("Graph",new d.Pos(0,10),new d.Pos(70,50),U),l.setRect("FLOP/C",new d.Pos(70,20),new d.Pos(30,20),(new d.RU_DataViewNumberBlock).setTitle("FLOP/C").setOptions({draw_bar:["left"],padding:{left:10},display_title:!0,text_align:"center"}).setDataAnalysisFunction((function(A){A.data[0].data.sp_flops_per_cycle_parallel;var t=A.data[0].data.dp_flops_per_cycle_parallel;return Math.round(100*t/(target_dp_flops_per_cycle_per_thread*A.data[0].data.sp_flops_per_cycle.length))})).setColorScaling((function(A){return 100-A}))),s.Title=new d.DataBlock({fontsize:32,text:"Vectorization",color:"black",align:"center"},"Text"),s.Graph=e,s.SuggestedAction=e,s["FLOP/C"]=e,l.setDataBinding(s),p.button_subwindow.setLayout(l),p.setOnEnterHover((function(A){p.color="#FF0000",p.button_subwindow_state="open"})),p.setOnLeaveHover((function(A){p.color="orange",p.is_locked_open||(p.button_subwindow_state="collapsed")})),p.setOnClick((function(A,t){p.is_locked_open=!p.is_locked_open})),p.setDefaultDblClick(),p}return a}(d.Button),M=function(){function A(t,a,e,n){(0,o.Z)(this,A),this.section=t,this.critical_path_analysis=n,this.for_node=a,this.for_state=e,this.analysis_result=null,65535!=e&&65535!=e&&ObjectHelper.assert("for_node defined",null!=this.for_node&&NaN!=new Number(this.for_node))}return(0,n.Z)(A,[{key:"judgement",value:function(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null;return null==t&&(t=this.analysis_result.data),A.sjudgement(t)}},{key:"analyze",value:function(){var A=this.section;if(ObjectHelper.assert("section is SuperSection",A instanceof SuperSection),null==(A=A.toSection(this.for_node,this.for_state)))return null;if(null==A._entries)return null;var t={},a=Number(A.get_max_thread_num()),e=Number(A.get_min_thread_num());if(null!=a&&null!=e){for(var n,r,o=[],p=[],s=[],u=[],i=[],l=[],c=[],U=[],M=[],V=[],T=[],O=e;O<a+1;O++){var z=A.select_thread(O),q=z.select_event("-2147483589");T.push(m.Vw.sum(q));var K=z.select_event("-2147483545",!0),B=z.select_event("1073741861");s.push(m.Vw.sum(B)),B=z.select_event("1073741862"),u.push(m.Vw.sum(B)),B=z.select_event("1073741863"),i.push(m.Vw.sum(B)),B=z.select_event("1073741864"),l.push(m.Vw.sum(B));var R=m.Vw.sum(K);o.push(R);var f=z.select_event("-2147483544",!0),g=z.select_event("1073741857");c.push(m.Vw.sum(g)),g=z.select_event("1073741858"),U.push(m.Vw.sum(g)),g=z.select_event("1073741859"),M.push(m.Vw.sum(g)),g=z.select_event("1073741860"),V.push(m.Vw.sum(g));var j=m.Vw.sum(f);p.push(j)}0==o.length&&(o=m.Vw.sum(s)+m.Vw.sum(u)+m.Vw.sum(i)+m.Vw.sum(l)),0==p.length&&(p=m.Vw.sum(c)+m.Vw.sum(U)+m.Vw.sum(M)+m.Vw.sum(V)),ObjectHelper.logObject("sp_ops",o),ObjectHelper.logObject("dp_ops",p);var G=function(A){return m.Vw.zip2d(A).map((function(A){return m.Vw.sum(A)}))};n=G([s.map((function(A){return 1*A})),u.map((function(A){return 4*A})),i.map((function(A){return 8*A})),l.map((function(A){return 16*A}))]),r=G([c.map((function(A){return 1*A})),U.map((function(A){return 2*A})),M.map((function(A){return 4*A})),V.map((function(A){return 8*A}))]),ObjectHelper.logObject("sp_flops",n),ObjectHelper.logObject("dp_flops",r),t.sp_flops=n,t.dp_flops=r,ObjectHelper.logObject("tot_cycles",T),t.sp_flops_per_cycle=m.Vw.zip(t.sp_flops,T).map((function(A){return A[0]/A[1]})),t.dp_flops_per_cycle=m.Vw.zip(t.dp_flops,T).map((function(A){return A[0]/A[1]}));var b=m.Vw.median(max_func_obj(this.critical_path_analysis.data.critical_paths,(function(A){return A.thread_num}),(function(A){return A.value})));if(t.sp_flops_per_cycle_parallel=m.Vw.sum(t.sp_flops)/b,t.dp_flops_per_cycle_parallel=m.Vw.sum(t.dp_flops)/b,t.sp_ops=o,t.dp_ops=p,t.sp_ops_scalar=s,t.sp_ops_128b=u,t.sp_ops_256b=i,t.sp_ops_512b=l,t.dp_ops_scalar=c,t.dp_ops_128b=U,t.dp_ops_256b=M,t.dp_ops_512b=V,ObjectHelper.logObject("data",t),0!=o.length){var Z=new d.DataBlock(t,"vectorized");return this.analysis_result=Z,Z.judgement=this.judgement(),Z}}}}],[{key:"sjudgement",value:function(A){var t=m.Vw.sum(A.sp_ops_128b)+m.Vw.sum(A.sp_ops_256b)+m.Vw.sum(A.sp_ops_512b),a=m.Vw.sum(A.dp_ops_128b)+m.Vw.sum(A.dp_ops_256b)+m.Vw.sum(A.dp_ops_512b);return m.Vw.sum(A.sp_ops_scalar)+m.Vw.sum(A.dp_ops_scalar)<t+a?1:-1}}]),A}(),V=function(A){(0,p.Z)(r,A);var t,a=c(r);function r(A,t,e,n,p){var s;return(0,o.Z)(this,r),(s=a.call(this,t,e,n,p,null)).communicator=A,s}return(0,n.Z)(r,[{key:"analyze",value:(t=(0,e.Z)(l().mark((function A(){var t,a,e,n;return l().wrap((function(A){for(;;)switch(A.prev=A.next){case 0:return t=this.section.toSection(this.for_node,this.for_state),A.next=3,t;case 3:if(void 0!==(t=A.sent)){A.next=6;break}return A.abrupt("return",void 0);case 6:return A.next=8,this.communicator.runAnalysis("VectorizationAnalysis",[new Number(t.unified_id),new Number(t.supersection_id)]).get();case 8:return a=A.sent,e=a,n=new d.DataBlock(e,"vectorization"),this.analysis_result=n,n.judgement=this.judgement(),A.abrupt("return",n);case 14:case"end":return A.stop()}}),A,this)}))),function(){return t.apply(this,arguments)})}]),r}(M);function T(A,t,a,e,n){return t instanceof LazySuperSection?new V(A,t,a,e):new M(t,a,e,n)}}}]);
-//# sourceMappingURL=641.js.map
\ No newline at end of file
diff --git a/dist/641.js.map b/dist/641.js.map
deleted file mode 100755
index 47b4cc4d..00000000
--- a/dist/641.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack://@spcl/sdfv/./renderer_dir/vectorization_button.js"],"names":["VectorizationButton","ctx","supersection_all_vec_analyses","path_analysis","_display_image","databinding","judgements","data","map","x","judgement","majority","MathHelper","setButtonImage","dataparams","layout","Layout","button_subwindow","setRect","Pos","RU_DataViewText","suggested_action","RU_DataViewSuggestedActionBlock","setDataAnalysisFunction","returnarr","push","linkMouse","_layout_clickable","setHint","thread_graph","RU_DataViewBarGraph","type","yAxes","display","position","id","sp_s1","sp_p4","sp_p8","sp_p16","dp_s1","dp_p2","dp_p4","dp_p8","sp_ops_scalar","sp_ops_128b","sp_ops_256b","sp_ops_512b","dp_ops_scalar","dp_ops_128b","dp_ops_256b","dp_ops_512b","colors","datasets","repcount","all_analyses_global","chunksize","length","ObjectHelper","createChunks","label","yAxisID","backgroundColor","labels","Array","keys","changeGraphOptions","options","title","text","scales","find","scaleLabel","labelString","ticks","beginAtZero","xAxes","RU_DataViewNumberBlock","setTitle","setOptions","draw_bar","padding","left","display_title","text_align","sp_flops_per_cycle_parallel","dp_flop_per_c","dp_flops_per_cycle_parallel","Math","round","target_dp_flops_per_cycle_per_thread","sp_flops_per_cycle","setColorScaling","DataBlock","fontsize","color","align","setDataBinding","setLayout","setOnEnterHover","p","button_subwindow_state","setOnLeaveHover","is_locked_open","setOnClick","mb","setDefaultDblClick","Button","SuperSectionVectorizationAnalysis","section","nodeid","stateid","critical_path_analysis","this","for_node","for_state","analysis_result","assert","undefined","NaN","Number","analysis","sjudgement","SuperSection","toSection","max_thread_num","get_max_thread_num","min_thread_num","get_min_thread_num","sp_flops","dp_flops","sp_ops","dp_ops","sp_ops_scalar_single","sp_ops_128b_single","sp_ops_256b_single","sp_ops_512b_single","sp_ops_scalar_double","sp_ops_128b_double","sp_ops_256b_double","sp_ops_512b_double","tot_cycles","t","ts","select_thread","tc","select_event","t_sp","tmp_single","t_sp_sum","t_dp","tmp_double","t_dp_sum","logObject","flop_each_thread","dp_flops_per_cycle","crit_path","max_func_obj","critical_paths","thread_num","value","ret","sp_vec_op_count","dp_vec_op_count","LazySuperSectionVectorizationAnalysis","communicator","runAnalysis","unified_id","supersection_id","get","tmp","AutoSuperSectionVectorizationAnalysis","LazySuperSection"],"mappings":"ixBAMMA,E,oCACF,WAAYC,EAAKC,EAA+BC,GAAe,uBAC3D,cAAMF,IAEDC,8BAAgCA,EAErC,EAAKE,eAAiB,CAClB,EAAK,OACL,KAAM,QAGV,EAAKA,eAAiB,CAClB,EAAK,qs7BACL,KAAM,m+lBAGV,IAAIC,EAAc,GAEdC,EAAaJ,EAA8BK,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEC,aAC3DC,EAAWC,cAAoBN,GACnC,EAAKO,eAAe,EAAKT,eAAeO,IAExC,EAAKG,WAAa,CAACZ,EAA+BC,GAElD,IAAIY,EAAS,IAAIC,SAAO,EAAKC,kBAC7BF,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,GAAI,IAAIA,MAAI,IAAK,IAAK,IAAIC,mBAE7D,IAAIC,GAAmB,IAAIC,mCAAkCC,yBAAwB,SAAAd,GAEjF,IAAIe,EAAY,GAUhB,OATWf,EAAEF,MAGG,GAAbI,GAECa,EAAUC,KAAK,qBAIZD,KACRE,UAAUX,EAAOY,mBACpBN,EAAiBO,QAAQ,oBAAqB,iBAE9Cb,EAAOG,QAAQ,kBAAmB,IAAIC,MAAI,GAAI,IAAK,IAAIA,MAAI,GAAI,IAAKE,GAEpE,IAAIQ,EAAe,IAAIC,sBAAoB,CACvCC,KAAM,MACNC,MAAO,CAAC,CACJD,KAAM,SACNE,SAAS,EACTC,SAAU,OACVC,GAAI,aAGTZ,yBAAwB,SAAAd,GAEvB,IAAI2B,EAAQ,GACRC,EAAQ,GACRC,EAAQ,GACRC,EAAS,GAETC,EAAQ,GACRC,EAAQ,GACRC,EAAQ,GACRC,EAAQ,GACH,MAALlC,IACA2B,EAAQ3B,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKqC,iBAC/BP,EAAQ5B,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKsC,eAC/BP,EAAQ7B,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKuC,eAC/BP,EAAS9B,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKwC,eAEhCP,EAAQ/B,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAKyC,iBAC/BP,EAAQhC,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAK0C,eAC/BP,EAAQjC,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAK2C,eAC/BP,EAAQlC,EAAEF,KAAKC,KAAI,SAAAC,GAAC,OAAIA,EAAEF,KAAK4C,gBAGnC,IAAIC,EAAStB,kCAETuB,EAAW,GAGXC,EAAWpD,EAA8BoD,SAC7C,GAAGC,oBAAqB,CAEpB,IAAIC,EAAYpB,EAAMqB,OAASH,EAC/BlB,EAAQsB,aAAaC,aAAavB,EAAOoB,EAAW5C,eACpDyB,EAAQqB,aAAaC,aAAatB,EAAOmB,EAAW5C,eACpD0B,EAAQoB,aAAaC,aAAarB,EAAOkB,EAAW5C,eACpD2B,EAASmB,aAAaC,aAAapB,EAAQiB,EAAW5C,eAGtD4B,EAAQkB,aAAaC,aAAanB,EAAOgB,EAAW5C,eACpD6B,EAAQiB,aAAaC,aAAalB,EAAOe,EAAW5C,eACpD8B,EAAQgB,aAAaC,aAAajB,EAAOc,EAAW5C,eACpD+B,EAAQe,aAAaC,aAAahB,EAAOa,EAAW5C,eAuBxD,OAhBAyC,EAAS5B,KAAK,CAAEmC,MAAO,OAAQC,QAAS,SAAUtD,KAAM6B,EAAM,GAAI0B,gBAAiBV,EAAO,KAC1FC,EAAS5B,KAAK,CAAEmC,MAAO,OAAQC,QAAS,SAAUtD,KAAM8B,EAAM,GAAIyB,gBAAiBV,EAAO,KAC1FC,EAAS5B,KAAK,CAAEmC,MAAO,OAAQC,QAAS,SAAUtD,KAAM+B,EAAM,GAAIwB,gBAAiBV,EAAO,KAC1FC,EAAS5B,KAAK,CAAEmC,MAAO,QAASC,QAAS,SAAUtD,KAAMgC,EAAO,GAAIuB,gBAAiBV,EAAO,KAE5FC,EAAS5B,KAAK,CAAEmC,MAAO,OAAQC,QAAS,SAAUtD,KAAMiC,EAAM,GAAIsB,gBAAiBV,EAAO,KAC1FC,EAAS5B,KAAK,CAAEmC,MAAO,OAAQC,QAAS,SAAUtD,KAAMkC,EAAM,GAAIqB,gBAAiBV,EAAO,KAC1FC,EAAS5B,KAAK,CAAEmC,MAAO,OAAQC,QAAS,SAAUtD,KAAMmC,EAAM,GAAIoB,gBAAiBV,EAAO,KAC1FC,EAAS5B,KAAK,CAAEmC,MAAO,OAAQC,QAAS,SAAUtD,KAAMoC,EAAM,GAAImB,gBAAiBV,EAAO,KAE1E,CACZW,QAAQ,OAAIC,MAAM5B,EAAM,GAAGqB,QAAQQ,QACnC,SAAYZ,MAKjB3B,UAAUX,EAAOY,mBAAmBuC,oBAAmB,SAAAzD,GACtDA,EAAE0D,QAAQC,MAAMC,KAAO,mBACvB5D,EAAE0D,QAAQG,OAAOtC,MAAMuC,MAAK,SAAA9D,GAAC,MAAY,UAARA,EAAE0B,MAAgBqC,WAAa,CAAEC,YAAa,eAAgBxC,SAAS,GACxGxB,EAAE0D,QAAQG,OAAOtC,MAAMuC,MAAK,SAAA9D,GAAC,MAAY,UAARA,EAAE0B,MAAgBuC,MAAMC,aAAc,EACvElE,EAAE0D,QAAQG,OAAOM,MAAQ,CAAC,CAAEJ,WAAY,CAAEC,YAAa,SAAUxC,SAAS,QA1HnB,OA6H3DlB,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,IAAK,IAAIA,MAAI,GAAI,IAAKU,GAEzDd,EAAOG,QAAQ,SAAU,IAAIC,MAAI,GAAI,IAAK,IAAIA,MAAI,GAAI,KAAK,IAAI0D,0BAAyBC,SAAS,UAAUC,WAAW,CAClHC,SAAU,CAAC,QACXC,QAAS,CAAEC,KAAM,IACjBC,eAAe,EACfC,WAAY,WACb7D,yBAAwB,SAAAd,GAEHA,EAAEF,KAAK,GAAGA,KAAK8E,4BAAnC,IACIC,EAAgB7E,EAAEF,KAAK,GAAGA,KAAKgF,4BAEnC,OAAOC,KAAKC,MAAsB,IAAhBH,GAAyBI,qCAAuCjF,EAAEF,KAAK,GAAGA,KAAKoF,mBAAmBlC,YACrHmC,iBAAgB,SAAAnF,GAAC,OAAI,IAAMA,MAG9BJ,EAAW,MAAY,IAAIwF,YAAU,CAAEC,SAAU,GAAIzB,KAAM,gBAAiB0B,MAAO,QAASC,MAAO,UAAY,QAC/G3F,EAAW,MAAYH,EACvBG,EAAW,gBAAsBH,EACjCG,EAAY,UAAYH,EAExBa,EAAOkF,eAAe5F,GACtB,EAAKY,iBAAiBiF,UAAUnF,GAEhC,EAAKoF,iBAAgB,SAAAC,GAAO,EAAKL,MAAQ,UAAW,EAAKM,uBAAyB,UAClF,EAAKC,iBAAgB,SAAAF,GAAO,EAAKL,MAAQ,SAAe,EAAKQ,iBAAgB,EAAKF,uBAAyB,gBAC3G,EAAKG,YAAW,SAACJ,EAAGK,GAAS,EAAKF,gBAAkB,EAAKA,kBAEzD,EAAKG,qBAzJsD,E,UADjCC,UAsK5BC,E,WACF,WAAYC,EAASC,EAAQC,EAASC,IAAwB,eAC1DC,KAAKJ,QAAUA,EACfI,KAAKD,uBAAyBA,EAC9BC,KAAKC,SAAWJ,EAChBG,KAAKE,UAAYJ,EACjBE,KAAKG,gBAAkB,KAEP,OAAXL,GAAgC,OAAXA,GACtBrD,aAAa2D,OAAO,mBAAqCC,MAAjBL,KAAKC,UAAsDK,KAA7B,IAAIC,OAAOP,KAAKC,W,wCAG9F,WAA2B,IAAjBO,EAAiB,uDAAN,KAGjB,OAFgB,MAAZA,IAAkBA,EAAWR,KAAKG,gBAAgB7G,MAE/CqG,EAAkCc,WAAWD,K,qBAsBxD,WACI,IAAIZ,EAAUI,KAAKJ,QAKnB,GAHAnD,aAAa2D,OAAO,0BAA2BR,aAAmBc,cAGpDL,OADdT,EAAUA,EAAQe,UAAUX,KAAKC,SAAUD,KAAKE,YAE5C,OAAO,KAEX,GAA0BG,MAAvBT,EAAO,SACN,OAAO,KAGX,IAEItG,EAAO,GAEPsH,EAAiBL,OAAOX,EAAQiB,sBAChCC,EAAiBP,OAAOX,EAAQmB,sBAEpC,GAAqBV,MAAlBO,GAAiDP,MAAlBS,EAAlC,CAyBA,IAlBA,IAIIE,EACAC,EALAC,EAAS,GACTC,EAAS,GAKTC,EAAuB,GACvBC,EAAqB,GACrBC,EAAqB,GACrBC,EAAqB,GAErBC,EAAuB,GACvBC,EAAqB,GACrBC,EAAqB,GACrBC,EAAqB,GAErBC,EAAa,GAERC,EAAIf,EAAgBe,EAAIjB,EAAiB,EAAGiB,IAAK,CACtD,IAAIC,EAAKlC,EAAQmC,cAAcF,GAC3BG,EAAKF,EAAGG,aAAa,eACzBL,EAAWpH,KAAKb,SAAeqI,IAC/B,IAAIE,EAAOJ,EAAGG,aAAa,eAAe,GACtCE,EAAaL,EAAGG,aAAa,cAAeb,EAAqB5G,KAAKb,SAAewI,IACzFA,EAAaL,EAAGG,aAAa,cAAeZ,EAAmB7G,KAAKb,SAAewI,IACnFA,EAAaL,EAAGG,aAAa,cAAeX,EAAmB9G,KAAKb,SAAewI,IACnFA,EAAaL,EAAGG,aAAa,cAAeV,EAAmB/G,KAAKb,SAAewI,IAEnF,IAAIC,EAAWzI,SAAeuI,GAC9BhB,EAAO1G,KAAK4H,GAIZ,IAAIC,EAAOP,EAAGG,aAAa,eAAe,GACtCK,EAAaR,EAAGG,aAAa,cAAeT,EAAqBhH,KAAKb,SAAe2I,IACzFA,EAAaR,EAAGG,aAAa,cAAeR,EAAmBjH,KAAKb,SAAe2I,IACnFA,EAAaR,EAAGG,aAAa,cAAeP,EAAmBlH,KAAKb,SAAe2I,IACnFA,EAAaR,EAAGG,aAAa,cAAeN,EAAmBnH,KAAKb,SAAe2I,IACnF,IAAIC,EAAW5I,SAAe0I,GAC9BlB,EAAO3G,KAAK+H,GAGI,GAAjBrB,EAAO1E,SACN0E,EAASvH,SAAeyH,GAAwBzH,SAAe0H,GAAsB1H,SAAe2H,GAAsB3H,SAAe4H,IACzH,GAAjBJ,EAAO3E,SACN2E,EAASxH,SAAe6H,GAAwB7H,SAAe8H,GAAsB9H,SAAe+H,GAAsB/H,SAAegI,IAE7IlF,aAAa+F,UAAU,SAAUtB,GACjCzE,aAAa+F,UAAU,SAAUrB,GAMjC,IAAIsB,EAAmB,SAAAjJ,GAMnB,OAHaG,WAAiBH,GAEVD,KAAI,SAAAC,GAAC,OAAIG,SAAeH,OAGhDwH,EAAWyB,EAAiB,CAACrB,EAAqB7H,KAAI,SAAAC,GAAC,OAAQ,EAAJA,KAAQ6H,EAAmB9H,KAAI,SAAAC,GAAC,OAAQ,EAAJA,KAAQ8H,EAAmB/H,KAAI,SAAAC,GAAC,OAAQ,EAAJA,KAAQ+H,EAAmBhI,KAAI,SAAAC,GAAC,OAAQ,GAAJA,OACvKyH,EAAWwB,EAAiB,CAACjB,EAAqBjI,KAAI,SAAAC,GAAC,OAAQ,EAAJA,KAAQiI,EAAmBlI,KAAI,SAAAC,GAAC,OAAQ,EAAJA,KAAQkI,EAAmBnI,KAAI,SAAAC,GAAC,OAAQ,EAAJA,KAAQmI,EAAmBpI,KAAI,SAAAC,GAAC,OAAQ,EAAJA,OAEvKiD,aAAa+F,UAAU,WAAYxB,GACnCvE,aAAa+F,UAAU,WAAYvB,GAEnC3H,EAAK0H,SAAWA,EAChB1H,EAAK2H,SAAWA,EAEhBxE,aAAa+F,UAAU,aAAcZ,GAErCtI,EAAKoF,mBAAqB/E,SAAeL,EAAK0H,SAAUY,GAAYrI,KAAI,SAAAC,GAAC,OAAIA,EAAE,GAAKA,EAAE,MACtFF,EAAKoJ,mBAAqB/I,SAAeL,EAAK2H,SAAUW,GAAYrI,KAAI,SAAAC,GAAC,OAAIA,EAAE,GAAKA,EAAE,MAGtF,IAAImJ,EAAYhJ,YAAkBiJ,aAAa5C,KAAKD,uBAAuBzG,KAAKuJ,gBAAgB,SAAArJ,GAAC,OAAIA,EAAEsJ,cAAY,SAAAtJ,GAAC,OAAIA,EAAEuJ,UAmB1H,GAlBAzJ,EAAK8E,4BAA8BzE,SAAeL,EAAK0H,UAAY2B,EACnErJ,EAAKgF,4BAA8B3E,SAAeL,EAAK2H,UAAY0B,EAEnErJ,EAAK4H,OAASA,EACd5H,EAAK6H,OAASA,EAEd7H,EAAKqC,cAAgByF,EACrB9H,EAAKsC,YAAcyF,EACnB/H,EAAKuC,YAAcyF,EACnBhI,EAAKwC,YAAcyF,EAEnBjI,EAAKyC,cAAgByF,EACrBlI,EAAK0C,YAAcyF,EACnBnI,EAAK2C,YAAcyF,EACnBpI,EAAK4C,YAAcyF,EAEnBlF,aAAa+F,UAAU,OAAQlJ,GAEX,GAAjB4H,EAAO1E,OAAV,CAIA,IAAIwG,EAAM,IAAIpE,YAAUtF,EAAM,cAG9B,OAFA0G,KAAKG,gBAAkB6C,EACvBA,EAAIvJ,UAAYuG,KAAKvG,YACduJ,O,yBArJX,SAAkBxC,GAOd,IAAIyC,EAAkBtJ,SAAe6G,EAAS5E,aAAejC,SAAe6G,EAAS3E,aAAelC,SAAe6G,EAAS1E,aACxHoH,EAAkBvJ,SAAe6G,EAASxE,aAAerC,SAAe6G,EAASvE,aAAetC,SAAe6G,EAAStE,aAK5H,OAHyBvC,SAAe6G,EAAS7E,eACxBhC,SAAe6G,EAASzE,eAEJkH,EAAkBC,EACpD,GAEC,M,KAyIdC,E,sCAEF,WAAYC,EAAcxD,EAASC,EAAQC,EAASC,GAAwB,6BACxE,cAAMH,EAASC,EAAQC,EAASC,EAAwB,OACnDqD,aAAeA,EAFoD,E,2DAK5E,iGAGQxD,EAAUI,KAAKJ,QAAQe,UAAUX,KAAKC,SAAUD,KAAKE,WAH7D,SAIoBN,EAJpB,eAKmBS,KADfT,EAJJ,sDAMeS,GANf,uBAQoBL,KAAKoD,aAAaC,YAAY,wBAAyB,CAAC,IAAI9C,OAAOX,EAAQ0D,YAAa,IAAI/C,OAAOX,EAAQ2D,mBAAmBC,MARlJ,cAQQC,EARR,OAUQnK,EAAOmK,EAEPT,EAAM,IAAIpE,YAAUtF,EAAM,iBAC9B0G,KAAKG,gBAAkB6C,EACvBA,EAAIvJ,UAAYuG,KAAKvG,YAdzB,kBAeWuJ,GAfX,iD,kDAPgDrD,GA0BpD,SAAS+D,EAAsCN,EAAcxD,EAASC,EAAQC,EAASC,GACnF,OAAGH,aAAmB+D,iBACX,IAAIR,EAAsCC,EAAcxD,EAASC,EAAQC,GAGzE,IAAIH,EAAkCC,EAASC,EAAQC,EAASC","file":"641.js","sourcesContent":["// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport { Button, Layout, Pos, RU_DataViewText, RU_DataViewSuggestedActionBlock, RU_DataViewNumberBlock, RU_DataViewBarGraph, DataBlock } from \"./renderer_util.js\";\nimport { MathHelper } from \"./datahelper.js\";\n\n\n\nclass VectorizationButton extends Button {\n    constructor(ctx, supersection_all_vec_analyses, path_analysis) {\n        super(ctx);\n\n        this.supersection_all_vec_analyses = supersection_all_vec_analyses;\n\n        this._display_image = {\n            \"1\": \"null\",\n            \"-1\": \"null\"\n        };\n\n        this._display_image = {\n            \"1\": \"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAAAAAD+G1m0AAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwQAADsEBuJFr7QAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAWH1JREFUGBnswYlbVGeCL/7vqR2KpVjFHS131Gg0UYmJiSbGLGoSs4eJ3dmm2+5M0ku6e/o+czPzzH5n7p3uSXeSzh7jvlIsggoIiKwqiFIYFll+f8j3J1pQp+ocKMk8WO976v18QEVRxgUqijIuUFGUcYGKoowLVBRlXKCiKOMCFUUZF6goyrhARVHGBSqKMi5QUZRxgYqijAtUFGVcoKIo4wIVRRkXqCjKuEBFUcYFKooyLlBRlHGBiqKMC1QUZVygoijjAhVFGReoKMq4QEVRxgUqijIuUFGUcYGKoowLVBRlXKCiKOMCFUUZF6iYGOzqGmDCGw4OMtGBSrQbNYFfvvLKL872M6FdO/W3f/WbsnPfM6GBSpSuHbOzMm5adoKJrP2lnMzMzOy8HZ1MZKAS6fs9yXaMWF7ORBbciVtSXr/KBAYqkQ7NwAjN+fb3TGjfeTBCc77Vz8QFKhEuPu7GiKR5NUxs7S/YMUKb9fYwExao6F15IQ0jbJuKh5ngKnJcGOGefpoJC1R0+t7GbZ4vmfCGnsvELfanWpmoQCVs+KezcduuS1SCr9gxQkvf3cMEBSphp6fbMcKZXkqFPDXXiVtmvzfAxAQqY1q3OHGLb0cvFbL//TTcYk8+zcQEKqM6X/NqGOF49iqVEcEdabhFe/4SExKohPS9koNbbNNPUrmtYZuGW1Je6mUiApXbBn6X5sAtrj09VEKOOTSMsOX9dT8TEKjcVl5gwy3eR69SGXX12RTc4pldwQQEKrd07dRw29zDVMJaHrHjtpfamXhAZUT3sxm4zf7WIBWdvVm4LeOlXiYcULmp770kO25xLa6iotfxMm7Tsj+4wUQDKjcdnIaQjA8GqUSocGi4xZ5VxkQDKuTFbW7clry9l0qknleycIvm2nWJCQZU2PViGkIWFlOJdvlpO27LeqGHiQVUeMyBUe8OUzE4kILbNO8HA0wooHLhCYR4t3VQMep8xYbb7AtKmVDAhHd9WxJu02aepGKmIt2BkGeuMZGAia7npz4NtzmeG6Ripn+HDyHpT3/PBAImurJ8J0IWl1Ixd3E7QhwpH9xg4gAT3LUXEaLZ3+2jMo7DSRpC/AEmDjCx9b+QjRD3hitUxtPxrBshnue6mDDAxFbusyNk5iEq4yvPtiEk96f9TBRgQmt70o4Q7fleKuMb2OZBiD3lDBMFmMj6dqdpuE2bcZLKRMqXI0Rz/KiLCQJMYMO/moNRjh8FqUxk8G+SbQiZc5gJAkxgtWkOjEqqpTKxjk1uhGgPX2ViABNX8E27hpDsFweoxBDIw6i0H19nQgAT15EZGKVtb6MSS99zSQhxZJUwIYAJ6+qTDoxyHKYSW7Efo+wvXWEiABNV7xtZGOVeUUsltr6fahg1/UcDTABgoqpItSNEy/r9EJU7UJPmQIjmq2YCABPU1SI7Rrm39VK5E/2vZ2OU+5VOWh+YoA7Mwpj5x6jcmY4nNYTYco/S+sDE1LkRY7Q3vqdyh/Z6MGZ7By0PTEjdu1MwyplVSeVOVa3SMCprVw+tDkxIgRwHRvmKeqjcqcEPnBpC7MkVtDowEXW+oGHM5g4qd65rtR1jXminxYEJaHB3HsakfU1lMvbNxJic/bQ4MAGdy7RjzLJTVCbj2ot2jNlykdYGJp6u110I++UglUk57tUwKuXJIC0NTDwnZtgwyj2tjsrkdD7vxih7ajEtDUw4Xc8gLLtogMoklWVoGPNsG60MTDQDr+YgbPs1KpPV+5gHY9JeGqCFgYnmXJYLYzIOUZm8o/MwRpt+ihYGJpjePQjTtl+iMnnf79YwxvN4B60LTDAlCxDmCFD5IcrT7RhlS3lvmJYFJpbBV5IxJunBIJUfIvisF2ErK2lZYGI5NRdhM76j8sOU5SHM++QQrQpMKMGdqQh7uZvKD9P7tBNj7Lk1tCowoZR5bBhlSztB5Yc6kIuwpLev06LARHL1NQ1jPM91Uvmh2l9EmG16GS0KTCQHZiDMV0blhztp1zDG8+NBWhOYQK5vQphzcw+VH+58tgthS8ppTWDiGPh1JsJmHqDyPzDwZg7C0rf10pLAxHFumQdhL3dS+Z/oeELDGHvyWVoSmDgO2xBmP0nlf+YbJ3Te6qYVgQnj4k6Eefx1VP5nyhdBZ/ZJWhGYKIZezUFY1p4BKv8z3/81dFwvDdCCwETRmA6dzVep/E9VQW9eOS0ITBA3fpGEsNSvGS9DwUFaRM/WNISl7eym9YAJ4myBA2ELSxgHg+2N5yr+9q8+KDld10crODIXYfbkCloPmCAOuKHzTg/vsq7ibz/eNC0rIz01JSXNl7Vp7yXKL7gLOtqPgrQcMDFcewZhNk8l76rrZ4+9tjDXa8cYR96zR9opvUMeDWH5x2g5YEIYemsGwpIe6uZd1HuqKNMFA8fWQD91+jv6KZvKmXaEOZ/up9WACaEx242wGYd491w78uj0NLsGI8+01y4ypOPQx1sXbvtLoJdSuf5WEsK0GeW0GjAhBGzQefoa75aBqh/Nho47LTfFgVGZz7dxRH/Fy9PtgOZa+PMeSuWsDzopu67RYsBE0P4CdBzf8m75/t0sJ0I0x/J//rdPTtWV/ulf/3m5Dbe4N17kTQdyEJL8fj9l0v+QA2GaJ0CLARPBoRyEafmlvDv6y56f7tQQsvqP5zmqvtCBETbPi20cOLrZhRDnPecolX0zoGMr6qK1gAmg5xk7wmy7u3hXdP1isRshrnVfX6fOwHf3OjAiY1fd381NwijbtDJK5dKz0Ms/QmsBE8DJmdCxn+LdMFy23oUxa88wStlq3OL25yFMSz5OuRyEnuOhPloKaH1d27wIc+W08C7o/eVitw0hno0XadCwCSNsKR6E2WeWUy6V2Q6Eab4yWgpofWVuG8KyXhjm1Ov/+UyM8TzfSxMNqxyI5lxRQ7kEd3mh497VSSsBLa/rdegtq+DUG/qd145R2qYbNFW6GtHcm5spmdJp0NG8J2gloOUdy4feXw1w6hUvwRjHmoscxzeIlvyLfkrm+mM26NheH6CFgFY3tN2NMM1zjFOvbbOGMevOcDy9qzRESq2gdL5Mgd6yCloIaHU1szSEORdVc8q1PpKEMUtqOL7v3Ijka6B0ypZCL2vXIK0DtLjet9Kh4327h1Pt4gt2DaOWV3ACw6sRwZbXTul0vwE9d3YjrQO0uKoZTuhknOZU697qxhj7R5zQRxr0PI8NUT4lNujZymgdoMUddWsIsz/UwynW/SOfDWM2XeeETqdDL28vJVSX4YSOtruLlgFa29WXoJf5JafaiVwHxiyp5cSaZ0JvSYAS6n02HXrzS2kZoLUdmg29paWcYs1PIcz2T4zh2kLoraunjAKzoWf7mpYBWlrfNi/0dn/PqRXc7kPYmmrG0OmH3pv9lNH3TyPC0120CtDSqtOgo7lOcmr1ve+BzseMpXUWdLSj/CF623oZX996oDfzF8O0CNDKrr/lgY4ju5pT60SuhjB7BWM5nY4wzVnGH+DilozNzYyr4tnQS57XQosAraxynh06qS9d55S6vNMJnU39jOVTF8Jcc85x0npLnvEg47dDjKeGB6Fn91bSIkAr2++A3rQAp1TPDh90FtUwpn+HTkphCyer653ZAHxFQcbT8G8RaU8/rQG0sM5nNOhtCXJKlSfbofMhY/tX6GT+TT8np/fI4z4XAF9RkHFV59Cgt/oMrQG0sP0zoef5jFOq81Xoef6DMbWsgs70Sk7GQEvlO3OcGOErCjKuerekQC93P60BtK7r6z3QyznIKXUoG3qZ+xnTN0nQyW/mJLS/McuDEF9RkPF1cBb0tG39tATQuipdNuitqeJU6nnWCb1HBhjTR06E2Z4Y5h0ZvFhXvPezx7I9NoT4ioKMrys7EGHWaVoCaFnf/wSRftbPqVQ8ExG+ZkzD99kQlvYVYxjsuNTWXFvxwVMbZrk16PiKgoyzvQ7o+XZ/TysALatyGSJVcipdeyQJEeoY02Xo5R/jhBr3P5PjhilfUZBxdiJFg44jq4pWAFrWgXToeWY2ciqVeO3QW9PLmBqgd+8ZTuhQQabbBlO+oiDj7NwKJ3Q01zFaAWhVN55BhKzXbnAKXX0NEbT/Zmz7oPejbk5o73SEOTLnLMh0I8RXFGSc9fw0CRFeuUYLAK3qVD4izCvnVNqfhwj2o4ztI+gd58T2TkdY+kvF//FgHkJ8RUHGW2UqIsw/RgsALarvlQxE2PE9p9DAdg8iLB1kTF0PIkyzV3Ji3+YBvnn5ywof3VN8trGfw+/NRYivKMh4a8nRoJf6zCDlB1pUXZYTeo5vOJUaZiKC9o+M7ct0hDl89ZxYwzcff7z3xPHyupZ+3hLwI8RXFGS8DT2ehAg5DZQfaFHFDg16Occ4lUqzEcH5B8b2z3aEpa66yEkK+BHiKwoy7g7ORoTUXw1QeqA1de1GpBVnOYV63kpDhOwzjO3voTPtp4OcpIAfIb6iIOOu+l5EcK+qp/RAawosQgTtzW5OofMFHkTYOsiYhhZDJ7+CkxXwI8RXFGTc3XgTEbSUYkoPtKYvUhBBK+FUOpVqQ4T9jC2gQefJICcr4EeIryjI+DtpRwT7d5QeaEndWzTo2dx1nEpHNURqYmyfawjTPuOkBfwI8RUFGX9VeQ5EeLaTsgMtKZCLCM61vZxC/T9GpEV9jO0P0HF8y0kL+BHiKwoy/lo3eBFh3jHKDrSirue8iJDzBafShQ2IYPs3xnZ9NXRmFnPSAn6E+IqCjL+h32QhQtoTA5QcaEWVWQ5EWFjMqXR2FSI4/8jY6jTorK7mpAX8CPEVBSmA+lmIYE9touRAKzqiIdKua5xKZcsQIekLxrYXeltbOGkBP0J8RUEKYHCrhgiOCkoOtKCuVxDlO06p435ESC1lbB9B7zdDnLSAHyG+oiBF8G0mItj39FBuoAUVL0IEzXOCU+rAbERYO8yY+h+CjnaWkxfwI8RXFKQIShYjgnZvNeUGWtBf0hHBMfcMp9TXuYjw74ztUBbCNGcLJy/gR4ivKEgRXCtCpKxjlBtoPdcfdCCC58FmTqXhnemI8BFj+39JCPM+3M/JC/gR4isKUgjHEMn5DeUGWs+ZNERK+WCQUyno90DPfpSx/YOGsGlf8wcI+BHiKwpSCJV2RNoepNRAy+ndk4RIGec4pa7m2qCXdoaxfQgdfzF/gIAfIb6iIIXQMM2FCPNKKTXQcmoKnIhg39jDKdWZgQgzWxlT4yLorKrnDxDwI8RXFKQQLq9NR4TMl/spM9ByjrsRKelPnFqdPkTYNsSYvoLeq4OM0FddUXOdsQT8CPEVBSmE4ffzEMGRfoEyAy3nWxsizTnEqXUtxwa9zxnbn6CjHWCEy+8ULCp4uZUxBPwI8RUFKYbqBYigOSsoM9BqOnYiyppqTq3gLCf0jjGm64UI01KKqTdUlAsg6a3rnFjAjxBfUZBi6NuBKO/2U2Kg1Ryagyhv9nFqDT2WBL3LjOmME2H2eWeo15StAUjadpETC/gR4isKUhBf2hBp/TlKDLSY/q2piGQ7wan2cSr0uhjTlxrCXOsvUK80BTel/GqAEwv4EeIrClIQR3IQadZRSgy0mAa3DRHs6Wc41T7LgN51xvRf0PE8206d7t1u3JReyRgCfoT4ioIUxOkCRHJ/TomBFlOiIVLyikZOta9yoNfNWAYLoeP9hyHqVC104KasRsYQ8CPEVxSkIJq3IJL2+HXKC7SW7jcQJeOn/Zxqh+ZAZ9EQYzmUDp30BuqdTNcAuDb3M4aAHyG+oiAFMfQBosyqpLxAa6lciigzKjnlSpdC50PG9J8uhGnrblDvO4zI+JyxBPwI8RUFKYqzGiJlvtVHaYHWcigNUbZc55Q7vw46HzKWngINYckfUe/68xixOMBYAn6E+IqCFEWz144InnkNlBZoLV/aEcn1KafejTeg8yFj+Rp6OV9Tr2wRRrxyjbEE/AjxFQUpiv7HUxHB5j1FaYGW0r0dUTL28i44Cp0PGUNxAfTmH6PO8Ms5GHGYMQX8CPEVBSmMAzMR5TClBVpK+TxEWVDMu6AsScOYRYOcUPUqG/TuOU2d1mw3AHt6BWMK+BHiKwpSGGeWIsornZQVaCUDu7MR5f4a3gW1810I6+BE6ldriPBgM3VOY0TyykbGFPAjxFcUpDB6XkCUhScpK9BKmvPciPLWdd4FfT9JR1gxJ3B6HaK8M8ywnr/GiNzfDjGmgB8hvqIgxbEXUdI/p6xAK6n22BDlBO+K2lkaxnzO8TXe70KUg9SpWIqbbI91M7aAHyG+oiDFcTRZQwTno/2UFGglxYhmq+RdMfScF2O29HM859driHaIOvtScVPqV7wDAT9CfEVBiqN8ug2Rci9QUqCFXH8TUWxJ9bw7ihdhTHI5x1G5zgGDgwy7+qQNNxWU8w4E/AjxFQUpjrp7nYiUUUZJgRZyZhWiJPsv8u7o+5nbhhDbRzRXs9oBQHP6cpwIe2eYowbeyQWg2d+7wTsQ8CPEVxSkOC495UaklL/uoZxACzk8A1GyXx/gXdKxOQmj7qmlmZJluElLmr32gTSEPdrBUXU5LgDOrFreiYAfIb6iIMUx/L+SEMl9Tz3lBFrIZ25EmX2Sd03rZoyy319Hg+5PVmi4yfPk2ZbzjyBsTQ1D+n7m1ABMe2eAdyLgR4ivKEiB1KQgki2znHICraP3MURbXMu758hsjNlYyyg1GzHCmV50keQ3PoyZc5AhJxbhJvv2a7wjAT9CfEVBCqQty4ZIjiOUE2gdZ2Yi2s4+3j3d7zg0jFr0H/XUOf1PizBCy9jexZuan9Iwyv3wNd7SulHDTSn7eWcCfoT4ioIUyOAmF6LsHqCUQMsYeDcLUbQveTdd/8lMjPEUfnuhnyOGW/f9ca0dI2zzftHPW0p9ToTYkp87VtvYULn/cQ9u0t7u5p0J+BHiKwpSJF/lIMqaekoJtIyWNV5E8R7gXXX96Fa3hjHO+/78xTef/3lTMm5z5u4M9PG2vnfmuDDKkbt208aF6Rjhe7qTdyjgR4ivKEiRnFiAKAtOUEqgZVRnOhBlTgnvspZ1ToRpNrvdbtNwmy1991WOGX47E2M0u91uwy07OninAn6E+IqCFEnNGkTJfmGYMgIto9SlIcqaGt5tV95fnqzBhDbnx9U3qNP3+zwPonlevsQ7FvAjxFcUpEh6dyOKe0Y7ZQRaxhEYPNHGu66/4sstWR4b9GyuzLnbj3cx0uDh52aluxCmOXN2XuadC/gR4isKUiiHEc19njICreL6bhj8dpjx0P72HA/0PHm7Tw/QqKf8xWkIc+T8tJuTEPAjxFcUpFBKbIjiLKOMQKs4uxoGZxkf/Q2n3n14zcol/nz/4uWr171TUt9Hc9erTvxk84Z7Fs2ZPXfh+p9X3+BkBPwI8RUFKZSqaQ5Esu/poYRAqziSjyiao4lxM9xUVVFy4tiJwKkztX2cSH9LXWXxkcNHTtYOcHICfoT4ioIUSuPqJESy3V9LCYFW8WkqoiRN76ClBfwI8RUFKZS+d9IQSZsRoIRAi+jf5ECU7F3DtLSAHyG+oiDFEshClKQDlBBoEReyEC3/CK0t4EeIryhIsVTnIdoXlBBoEafSEW15Fa0t4EeIryhIsbTORrSnr1I+oDX07fEi2os9tLaAHyG+oiDFMrjVhijzSigf0Bou3O9GtL20uIAfIb6iIAXzqRtRcv5qgNIBraFyuh1RnEdocQE/QnxFQQpmXy6iJM1uo3RAazjuRBRbRiktLuBHiK8oSMEUL0AUzVlL6YDWsB/RnMtqaHEBP0J8RUEKpmoNDMooHdAS+l5FNPdDTbS4gB8hvqIgBdOyBQbv9lM2oCXUrka0pD19tLiAHyG+oiAFM/BzGGxqoGxASyhegGgpJbS6gB8hvqIgRVMMgxWVlA1oCd/mIVpaNa0u4EeIryhI0Zy2I9qsY5QNaAUDW1MRLaOZVhfwI8RXFKRo6pJtiOL9hrIBreBimgNRtPX9tLqAHyG+oiBF07IwGVHsf6FsQCuotyOa579peQE/QnxFQYrmykMZiLath5IBreCUDdGyv6LlBfwI8RUFKZrh9/MQbV4tJQNawI33NUTLP0Kr6309CyHJG85TOJX5iDajlJIBLaBps4ZoyytoccEP5rkR4pjx7nWK5sJiRMv+ST/lAlpA1UoN0Tacp+X01daNOnX4i81pDg2j7CmFf9l74ODxmrpbai8z/vq3I1rq2lbKBbSAk3kw+HEfLadi3fr169etW3/T8jkZbkTQ0qbNnOVfu/6WdbsGGH+fIZprZj3lAlrAPhcMDtN69uPOtTL+vnYgiuY6TbmAFvCVBoNiWs9+3LlWxt/BDETTiikXUH69zyCaLbmC1rMPd66V8Vc8BwZ7BikVUH61SxDNOfMcreeQ96aUVN9E0tNSUrwp3nuuM/5Or4DB5hZKBZRfyVxES17dROvpqaqprq5p7opw7VqXXntzXc1NlyiA8w/AYE0VpQJKb+idPERL39pOJd4uPgmDBScpFVB6V9b6EC3rF4NU4m3wVzDI+ZZSAaXXMt2NaNPKqcRfGQw8f6ZUQOnVuzREm1lDJf6qYfRQH2UCSu8sjPJbqMTfBRhNa6BMQOmVwOjRG1Tir83nRLSsCsoElN3g+zDQ/kRFAFcWpCBa+vs3KBFQdq2PwyDpcyoCGHw5G9G8j7RSIqDsatfDIHsfFREcnIVo7qV1lAgou1PLYJB/nIoISv2IZs+qoERA2R2dCYOCU1REULscBs5iSgSU3bepMFh3jooIru+C0WFKBJTdJxoMtjRTEcJXMNpHiYCSG3gCRnv6qQhhL4xe66E8QMm1+GF0nIoYDtphcP95ygOUXNVsGJVREcMxLwxWnKY8QMkF8mB0looYSqfZEG3BScoDlNuNPVmIpjnrqIjhzEI7os3cR3mAcrv0UBqieWY2URFD7b0ORMvcNUxpgHJrWpaMaKkrL1ERQ9MmJ6Ilzb1KaYByq53mRLTMTZ1UxHB5uwvRtJTLlAYot9NuDdGm/XSQihgGfuWGQVIjpQHKrRRGM09QEUWZBwbuakoDlNtxGOWfoiKKs8kwcJdTGqDUhvbAaOE5KqI474WB84MBygKU2qXHYLSsmYoo2lJh4NhxmbIApVa/AUY7+qiIojNDQzTHw42UBSi1ypUw+gsVYQw+4kE0++oaygKU2okFMPqCijg+TUc027xTlAUotX3TYeD4hoo4vs1DNC3jBGUBSu0vqTBIPUBFHEfyYeA+SFmAUvsvOwzyjlMRR+kSGH1LWYAy698II38ZFXFUrYLRl5QFKLOWXBitPEtFHA3rYfRcDyUByuxcFow21FERx6VNMFpeT0mAMjvlg9GjzVTEMfAGjBZWUBKgxAZ/kwajZ9qpCOQAjOYcpyRAiXXsTIHRrwapCOQIjPLeHKIcQIm1PpIEoxIqIjkBo4y1VykHUGINa9wwqqQiklIbDJLnXqYcQIlVL3TCqJqKSE55bYjmSG2lHECJncq2waieikjO5joQTXNcoBxAiZ10wEhrpiKSc/NdMDpHOYASO6rBwO5poyKShhUeGJ2mHECJHYSRO7udikhaNiTDqIxyACW2F0Yp/k4qIrn0WAqMPhimFEB59b0Go4zVQSoi6Xw2DUa7rlAKoLwa74dR7mvDVEQy+EEGjLa1UQqgvKpWwmjmfipiKcuC0UMNlAIor9LFMMo/RkUsZ3JgtLaaUgDldSQfRgtLqYilLg9GyyooBVBee6fDaNkZKmJpngGj/GJKAZTW8K4sGK2qpyKWy7NhlHuYUgCl1bUoBUb3tVIRy8AjMEr5jlIApdWZ64TRy/1UBPNHDQaOLykFUFqXvRqMvqYimj+7YPQXSgGUVosLJvZSEc1nXhh9QimA0jrvhIn9VETzdQaMnuqnDEBpVTth4iAV0eybBqMlbZQBKK0KB4xsR6iI5vBsGC1ooAxAaQUcMNBSTlIRzQk/jPKrKQNQVjfet8PAlltGRTSlS2A0+xRlAMrq0nY7DOyzK6iIpmIFjKafpAxAWTVvscHAsfAsFdFUrYFR7s8HKQFQVvUbbDBwrDhHRTR162GUubWTEgBlVb1Sg4FzbT0V0TRuglH6hsuUACirigUaDFwPNFIRTdtjMPIub6UEQFmVzNRg4N7SSkU0HU/ByJPfSAmAsjqeBSPPk5eoiGZgD4ycOfWUACirw8kw8jzbQUU4R2Fk856jBEBZ7dNglPTqNSrCOQET2llKAJTVtzCR/LdDVIQTgJkKSgCU1dcw4S2jIp4ymCmlBEBZfQkTKZVUxFMJM8WUACipwRdgIrWKinjOwMwxSgCUVMdamEirpSKeaocGo58PUXygpFpXwUT6BSriqUt3wOjpKxQfKKmG5TDha6EinoY8F4wea6P4QElVL4GJjEtUxNM0LwlGD12g+EBJVSyAicxOKuJpWZwMo/W1FB8oqZJ8GGm5XVTE07YyBUb3nqX4QEkdmw0jx6xuKuK5dF8ajFacovhASR2cASPPlmEq4ml/wAejxSUUHyinobemwcj7JyoCurI5A0bzT1B8oJy6NufAKO0TKgK6+kQWjGYfpvhAOV19IAtGGZ9TEVDXzhwYTd9P8YFyurLWB6Psr6gIaOi9aTDK/pbiA+XUviINRnnfUhHR8TwYpX1B8YFyurQwBUYz91MRUfEMGCV9QvGBcmqbkwSjOYeoiKhsFowcH1F8oJxact0wmneMiogq5sBI+wPFB8qpKd0BowUnqYjobD5MPDxE4YFyuuC2wWhxCRURnZsPE3OuUnignBrsMFFQTkVE5xfAxKx2Cg+UUx3MrDxNRURNi2BiZhuFB8qpBmZWVVERUesSmJjRTOGBcqqCmbXnqIjo8jKYmH6BwgPldBpm1p2nIqLO5TCRV0fhgXI6BTMPNFIR0eB2mMitofBAOZXBzEOtVIT0CUzknKXwQDkFYGbzZSpC+hQmsispPFBOJ2HmsU4qQvoLTGSVU3iglIZ/DTPbuqgI6TOYyCyh8EApdb0EM28PURHSZzCR8bthig6UUudzMLOfipg+hwlfUZCiA6XUvgNmDlIR0xcajNJfukbRgVJqewJmDlER01cOGKU910nRgVJqfhRmDlMR0zduGKU+3UHRgVK68DDMHKEipr3JMEp5/BJFB0qpfiPMHKUipn2pMPI+0kbRgVI6tx5mjlER0/50GCVvbKHoQClVrYGZ41TEdDATRknrmig6UEpnVsHMCSpiOpwDI8/qCxQdKKXKFTBTTEVMR/Ng5C6op+hAKVUsh5kAFTEdnwkj16Jaig6UUvlSmCmhIqaTs2HkzK+h6EAplS2GmVIqYirOh5FjRhVFB0qpdCHMlFERU4kfRvacMxQdKKWAHybs5VTEVLYQRnZfJUUHSunkPBhpngoqYjq1BEa2lFMUHSilE3NhZEuppCKmigIYaZ5yig6U0rHZMLL7zlAR0+kVMNKcpRQdKKWjM2HkyDpLRUxnV8GErYSiA6V0ZDqMHNOqqIipeg3MBCg6UEqHpsHIObOGiphq7oOZYooOlNLBbBi55pyjIqZz98PMSYoOlNL+TBi58mupiKl2HcycoOhAKX3ng5F7fh0VMdWuh5njFB0opb1pMHIvqKMiproNMHOUogOl9E0KjNwL66mIqa4QZo5QdKCUvk6GkXtRPRUx1T8AM4cpOlBKX7ph5Fl8noqY6h+AmUMUHSilL5ww8iw5T0VM5zfCzCGKDpTSZ3YYeZaepyKmhgdh5iBFB0rpLxqMPMsaqIip4UGYOUDRgVL6FCY8BQ1UxNTwEMzsp+hAKX0KE0krLlAR04VNMPPWMAUHSukTmEhacYGKmBofhplt3RQcKKWPYSJp5QUqYmp8BGa2XqPgQCl9DBNJ9zRSEVPTZph5tJOCA6X0MUwkr2qkIqamLTCzuYOCA6X0Z5hIvreJipiaH4WZhy9TcKCMhp6CieQ1TVTE1PwYzDx0kYIDZRQsgInktU1UxNTyGMxsbKXgQBl1LYOJ5LXNVMTUshVmHmim4EAZdS2DCe/9zVTE1Po4zGxopOBAGQULYMK7roWKmNq2wcz6CxQcKKPuApjwrm+hIqa2J2Bm/QUKDpRR93KY8K5rpvgGr10bZsJp3QYz95+n4EAZBQtgIumeCxTZjc6L56vKP3jl1d+fOvc9E8uFh2FmdTUFB8roylKYcM2tobCunfhq2/SMtFRvclJSckr6A19fZCI5ew/MLC6h4EAZdSyBCef0aoqpu/LIKwtyku0Y48jdeah6iAnj9HKYWXiSggNl1L4YJhw5VRTR9fJXM10wcCz6XR91ei/10rIqC2BmwQkKDpRR+2KYcORWUzxXDz2ck2LXYOTOfrmVIe37/7Q5f/PHJ3toTZUFMOM/QcGBMmpfDBOOadUUTf/p12chTHOn56U6MCrjuWaO6C1/Mc8OaK4Fe76nJVUWwIz/OAUHyujyYphw5FVTMNd/nulAiOa451//47PTF0598u//stKuYYRrXTPJwXeyEZL8Xh+t6PQKmPEfp+BAGXUsgQlnXjWF0lfy7DSnhpDVf2zgqIb/W4ARmuvpBvbsmeNEiKOghlZUfS/MLC6h4EAZXV0KE+75dRTJtfcWuRDiWre3h3rnNiVhhPfx8ndnuDHKllNKK2p4EGbuOUvBgTLqWgYTyfc2URxDpetcGHN/FaN0f7QII2zJboRpqSdpRZe3w8yGRgoOlFF3AUx4N7RSGNf/ZoHbhpCkjZdoVLkII+w2hDn8p2lF7Tth5oFmCg6U0fXlMJHyQCtF0fP2dIxJerGfZv6PB9Fc68/TijqegZkHmik4UEbXl8OEd0MLBdHzM7cNo2wPD9BU7UZES3r6Iq2o/RmYKWyi4EAZdRfAhHdDK8XQ/+5cjHGsucRxHLIjivf3g7Si9p0wU9hEwYEy6i6ACW9hK4Vw47fTEba+iuMZWmdDpLRqWlL7TpgpbKLgQBl1F8CEt7CVIhj8IMuJMUvOcXw1KxApo5WW1L4TZgqbKDhQRt0FMOEtbKUITi5G2IrTnMi/IIJ78w1aUvtOmClsouBAGXUXwIS3sJUCaNuAMMefOaGPbNDL+JzW1L4DZgqbKDhQRt0FMOEtbGX8XX7Kg7CHr3NCp9Ohl3+Y1nR5B8wUNlFwoIyCBTDhLWxl3PW9laRhlLa0lhNrnQW9lZW0pss7YKawiYIDZRQsgAlvYSvjbu90hNn/mTEEF0PvwSZaU/sOmClsouBAGQULYMJb2Mp4u/iQB2FrahjD5Xzo/WSY1tS+A2YKmyg4UEbBApjwFrYyzq686kSY9gljqc+BjuMk79hAx8Wmhtq6842t7TcovPYdMFPYRMGBMgoWwIS3sJVx9l0SdOwVjOWEC2G21EremRunv92YnprivSklJe3+Tw7XDFBol3fATGETBQfKKFgAE97CVsZX/WYNOo/0M5aPbAhLWnqed6K7/I2VeU6MsaXPvffHx6t6KK7L22GmsImCA2XUVQAT3sJWxtWV9W7oLDrHmP4NOumPX2JsA2dfm6bBwJb/5tl+iurydpgpbKLgQBl1LYMJb2Er46nv5w4NOh8ytn+BTs7vBhlT0wvTvA6YcKXmPnFkgGK6vANmCpsoOFBGXQUw4S1sZTydWgI9z38ypoZ7oDPzHGP5PvB0OkbYkzNyp2V6HdBzz/3ZNQrp8g6YKWyi4EAZBQtgwlvYynj6yg29rAOM6TM3dLb0MIZrP3bbAM2VXviHj7/cu/erT/+4MSvFhTDbqx0UUfsOmClsouBAGQULYMJb2Mo4at9qg97mQcb0n3aEOT5mDO3PZdkAJC39bRdDeqv2LHEhLGN7CwXUvgNmCpsoOFBGwQKY8Ba2Mn763shChG8YU/8KDWFZezmxKy97AaQ9dujcIMP6qvc/5tYwKmlHK8XTvgNmCpsoOFBGwQKY8Ba2Mn5qfA5EqGNMrdBbXMIJ9e7GTbZt5xmtYYMLYTvaKJz2HTBT2ETBgTIKFsCEt7CVcTP4nlOD3tpexnQYehtqOaG90wEkv3aZRp270jHGt72TomnfATOFTRQcKKNgAUx4C1sZN1VrEEH7iLF9Cr13ejiR9vvsgG9nB81cejnJhlHuN4MUTPsOmClsouBAGQULYMJb2Mq42ZeLCPZjjOnGo9A7yYl0ve4E8EwbzV3Z6MEY934Kpn0HzBQ2UXCgjIIFMOEtbGW8DG33IMLSQcZUNw1hmv00J3Jyug3OnBKO5/hshD11iWJp3wEzhU0UHCijYAFMeAtbGS8tsxFB+0fG9mkKwhwZ5zmB3ucBJC2u5Xh6XnBgTNaLfRRK+w6YKWyi4EAZBQtgwlvYyngpz0EE5x8Y2z/aEJZ27yVO4EQ+AO/K/93L8RzLxBh78hkKpX0HzBQ2UXCgjIIFMOEtbGWc9LyVhgjZVYzt76Ezbc8gx3djuw+AM2/1Oyc7aO7qqzaE/aSHImnfATOFTRQcKKNgAUx4N7QyTuqXeRDh8UHGNLgYOvkVnECr14HbtMcbaK7Co2HMkgqKpH0HzGxoouBAGXUtgwnv+mbGSXmKDRH2M7ZiDTpPdnMC9XYNIckPlQzQTM/DSRiTfpAiubwDZjY0UnCgjK4tgwnv+mbGyWENkZoZ2+cawrTPOZGzCLMVVNLUt3kY4/iCIrn0NMxsaKTgQBldWwYT3vXNjI/rRYi0qJ+x/QE6zr2cSDn0vqSpygKEPdlNgbRtg5kNjRQcKKPLi2HCvbCO8VGzBhFs/8bYrq+GzqxiTuQk9J79nmbq1yDMX02BND4MM/fWUHCgjFoXwoRzRjXjo2wZIrj+m7HVatC5t5oTGPgF9ArqaKatEGGzSymQug0ws6KSggNl1OiHCUfuGcbHyYWIkPQlY9sLvcdbOYEb70FvYQXNDLyOsBnHKJDqNTCztIyCA2V0wQ8TjtyzjI9DcxFhdSNj+2/o/XaYEwlAb9k5mtqHsNy/HqA4zq6CmaVlFBwoo0Y/TDhyzzI+9k5HhH9lbP0PQUer4oTO2DWE7eymqYMIy3y4k+I4sxJmlpVTcKCMWhbAhCOvivHxeRYi/DtjO5CJMM3Zygk1pjoQ9hXNHUZY+v3tFMeZlTBTcIqCA2XUthAmnNOrGRdDT6UiwkeM7f8lIcy7+QYnNPT2dIzSFpTT3BGEZTx4heI4ew/MrDhNwYEyurQYJlxzahgXwXw39OzHGNs/aAjL+4YxBF/x4hbNk/PLPpo7jLDsJ65RHDVrYWZ1NQUHyqhzKUx4CuoZF9dybNBLr2JsH0LHH2AsHUVO3KS5ny4d5DgOIGz6L4cpjgsPw8z6CxQcKKOry2Ai+d4LjIurGYgwq5UxNS6CzqrzjOna4d2F9726/0QHxzP8I4TNLqVAWh+HmQeaKThQRteWwYT3vmbGxdUMRHhimDF9Bb1XBxmhs6ysKshoN5rPX+cE2goRNv8MBXLxSZjZ2ELBgTK6tgwmktc2My6u5dqg9zlj+xN0tIOMcP7F+fOXPF8xzMk5swJh23spkLYnYOaBZgoOlNG1ZTCRvKaJcRGc5YTeccZ0fQPCtNRi6vU/mQIgadtFTs6RuRiT9A1F0rYNZgqbKDhQRleXwUTyvU2Mi6HHkqDXzpjOOBBmn3+Weud9uClp20VOytCzGRgz+yRF0vo4zKy/QMGBMgoWwETy6ibGx8dp0OtiTF9qCHNtuECd4f/lxU0pvx7gpFyc5sKY165SJC1bYaawiYIDZTT8FEwkrWpkfHyWCb3rjOm/oJP0XDt1Wja7cVP6aU5OtROjNEeAQml+FGY2tlBwoJT+DBNJ9zQyPr7OgV6QsQwUQsf7D0PUObvAjpuyGjkpvXvsGOVcc5VCaX4UZh5so+BAKX0ME0krLjA+Ds2BzqJhxnIoDTrpF6h3Ik0D4Nrcz0k5vVTDqNmHKZamLTCz6RIFB0rpY5hIWn6B8VG2FDofMqb/dCFMWz9Ave8wIuMLTs6+JIxyvtJDsTRuhplH2ik4UEqfwISnoIHxcX49dD5kLI0FGsKSP6Le9V0YsaSEk9LxtA0h9jmlFEzjwzCzuYOCA6X0CUx4ljUwPgbehM6HjOXP0Mv9mnqlCzHi1S5Oxo3duQixpb7fR8Fc2AQzj3ZScKCUPoUJz9LzjJOj0PmQMRQvg57/OHWGXszGTdphTkp9sh0hSVu+p2gaHoKZrdcoOFBKn9lg5FlynnFSlqRhzKJBTujsKg16q85QpyXLBcCRUcnJGPylXUPIrnYKp+FBmHk8SMGBUvrCCSP34nrGSd0CN8I6OJHaVRoivBqkTiVGpOwKcjJOr0KIc24ZxXN+I8y8NUTBgVL60g0j98J6xkn/T9MRVswJVKxFlAPU+f4djMgr52QM7vIgJOP9GxRP/QMws4+iA6X0dTKM3AvqGS/1szSM+Zzju3CfC1EOU6diCW5yPtXLSeh7N8+G22a/008B1RfCzH6KDpTStykwcvvrGC/Du1IwZnMfx1O/XkO0I9T5LhU35R7gZJRkO3GLM+cnXRRR3QaYOUDRgVL6Lh1Grvl1jJvAYoxJKuU4Tt1nh8EhhnU+oeGmlzs4CReetOO2nLd7KKTa9TBzgKIDpbQvA0auebWMm/53PTaE2D6iuepVDgCO9LzpLoS9M8xRA2/lALAll3ASup5Jx235P+uhmGrXwcxBig6U0oEsGLnyaxk/HY8mY9Q952gmsBQ3ObLXbd3sQ9iWdo6qzXYBSN7SxTvXsycVt7gyfn6dgjq3DmYOUXSglA7lwsg19xzj6OIWjLKtraXB+f+7XMNN0964dPXCZoTdc4Yh3W86NQBzSjgJJ7LtuGXur29QVOfug5nDFB0opSPTYeSafY7xdHQuxmw8xyjVD2CEd/6vukl+m4Exebv7eUvPT+fiptSift651u24xfF0YIDCqrkPZo5QdKCUjs6EkXNWDePp+k/cNoxa9B911Kn8p0UY4Xr02DBvatmuYZTN978HeVPXG+kY8XgT71z3gx6McK5rocCq18LMUYoOlNLx2TByzqxhXPXsmYUx7vVf1/dyxGDj3j+ssWOE69VLvK08w4lRzvyiQHXVoZ25DgB2Txnv3LUfJ9lwk33XJYqs6l6YOUbRgVI6mQ8j5/RqxlfP8W1uDWOca//0+def/emhJNxiS9u69wpD+g8+7MKYpBmrVqY6MCL3lT7escE9uRoAW+pzFym0M/fAzHGKDpRS8XwYOXKrGG+t65zQ0UYgxL2tiTr7M6GjabjthW7eucOzMML92DWK7fQKmDlO0YFSKlkAI3vmWcbdtV+tSNZg5Eh/vqSbejf+bkYSonlebeeda304GYA99a0uCq5iGcycoOhAKZUthpEt7TTjb6Dy68dzPDboaO7MuTv2XWaUoWMvzvW5EKa5pu3q4J279CJucua93kXRlS+GmZMUHSil8qUwsiVXUAgd78xNgo5jxl+d+p4m+k69NA1hjpyffc8717ndg5uy3him8EoXwEwxRQdKqWI5jDTXKYphoPH00d3337Ns4YJlax584r1T9X0cR8+5wM+2PrBq8dw5+YsfeP/cAO/c1Vd8ADx5H/RSfIF5MKEFKDpQSqdXwoStjOII1pwuCxSXVzVcGuKEBtrqz5QcO3o8UD/ISeh5ywbA/cj+AUqgeC5M2EsoOlBKZ1fDTCkTRu8r2QBsCwI0M9DU2NJLgZyYBSPNVUrRgVKquQ9mSpgout/NsgHp204N0UTf329+ZMcpCuTYdBhpSeUUHSilug0wE2CC6H/TpQGupy7QVNVyDTn/+/+jOI7kwsiWcoqiA6V0/kGYOcnE0P/6DA3wvtZOc8W5wMwTFMihLBjZ0isoOlBKjY/AzAkmhIHfp9mBaa9d4TgOeID8CgrkgA9G9qzTFB0opZbHYOY4E8LRLA3A7m6O5ysAi+ookH2pMHLknaXoQCldfAJmjjEBDJzY6gJy/6ab47nxHICCNgpkrxdGztnVFB0opfYdMHOE1jf0d1kuYMZbvRxX3VIAOwcokG88MHL5z1F0oJQ6d8HMYVrf0Vk2aPb3+zm+k3MAfEaRfOWEkXtZPUUHSqnrJZg5RMtr2eaGbe77vRzfwCtZgO0riuQLG4w8qxooOlBKw7+GmYO0urbNSbBN/9kgJ9A2OwnwfEeRfA4TSfc3UXSgnE7CzH5aXMuzbs2W8naQEznnsgF5xymSz2AieWMLRQfKKQAzbw/R0rqezwBS/O93cHwDje/gpoXlFMlnMOHd3EbRgXIqhZknumhl3btTAOSsf+Xvy245VV4Wrbzk/ZWZuGl1FUXyF5hIefwSRQfK6RTMbO2khfX9PNsOwOWbkX/bvHyjOTNSnbjpoQsUyacwkbq9g6ID5VQJM4920LoGfjEfd+6pSxTJpzCRvquTogPldBZmNl+mdZV4MAm/GKBIPoEJ3ytdFB0op2qY2dRGy7qw1YZJKKFIBrfDRMZvBik6UE61MPNgM62q/WkNk3GGIrm6AiYyAxQeKKfzMFPYSIvq2ZqCSamnSNoLYCKrjMID5dRg12C07jwt6ozXjkmwuZopkralMJFdQeGBcmr02GC09hyt6cb7mBRX1mWKpHkxTOScofBAOTWnO2G06iytqf0ZTIpv+w2KpGEhTOTWUHignFqnuWG0opLWdHk7JmXGPgql1g8T0+ooPFBOF+ckwWhpGa2p733fpOxoolCq5sHE9AYKD5TT5cUpMFpUTIvqr52UIMVSORcmZjRTeKCcrqxKh9H8Y1REVD4bJma2UXignK5uyITRnMNURBSYCROz2ik8UE7BLTkwmrGPioiOT4eJOZ0UHiin4XfyYDTtGyoCGnpvGkw8PEjhgZI6PBNGWV9QEVDXzhyY+C+KD5TU8TkwSv8LFQFdfSILRtofKT5QUiXzYJTyZyoCurI5A0aOP1F8oKQqFsDI8+gwFfG0P+CDkecTig+UVNViGDlmdlMRz6X70mCU8hnFB0qqbhlMZHdREU/bPSkw8n1F8YGSalwJE5mdVMTTsjgZRrnfUXygpC6uhomMdiriacz3wGjWIYoPlFT/LpjwtVERT8MMN4zmH6f4QFl9ARO+ZiriqctwwGhJKcUHyuormEhvoCKecx4bjFZWUnygrL6BibRaKuKpgpn7qik+UFbf2WCUWk1FPJUw80A9xQfK6qALRilnqIinHGYeaab4QFkdTYdRyikq4gnAzOOXKD5QVsXTYOQtoSKeEzCz4yrFB8qqPF+DQfIHg1SEcxRm/maY4gNldXqJBoOk5zupiGZgD8wcpwRAWdWstsHA8/RlKqLpeApmApQAKKvzG2wwcD/aSkU0bY/BTBklAMqqebMNBq4HGqmIpnETzFRSAqCsLj1th4Hz3joqoqnbACPNVUUJgLLqfNEOA8fSaiqiOXsvjByZdZQAKKuh3zlgYM8/TUU0FStg5Mm/QAmA0ip3wMA2rZyKaEoWwyhlZSslAErrjAMGWnoxFdEcnw8j38bLlAAorVonjNzHqIjm0CwYZT15lRIApdXohInDVESzbxqMpr0/SAmA0rrohokDVETzdQaMZhRTBqC0rqTbYfQdFdF85oXRnErKAJTWtVkeGH1LRTR/dsJo/jnKAJTW4FPpMHp1kIpg/qjBaFETZQDK64scGBV2UBHL0CMwsaydMgDl9d0MGN3XQkUsV+bAxPZBygCU19F8GK2qpyKWtpkw8SmlAMqrdBGMCqqoiKVhOoxsX1AKoLzOroTRonIqYqmeBqPkbykFUF4N98Fo/kkqYqnIhlHOIUoBlNeljTCac5iKUIZ/nwmj/GJKAZTX4G4YTd9LRSjXXkyH0fJKSgGU2D4YZT0/SEUkHU+mwmh9LaUASuwQjNIWX6UikrZNXhhtaaIUQIkds8HAndNORSSNa5JgtKOdUgAlFkjSEM3uaaMikvolbhj9apBSACVWkWuHURMVkVTPcsKolHIAJVbtd8KolopIKtNtMDpNOYASO7/aDaMzVERS6tRgdI5yACXW/FASjMqoiOQkTNgaKQdQYu3bvTD6zRAVgRyFkSuzjXIAJTb46zQY7bpCRSCHYJSyqINyAGV2ygejbW1UxDH8FowyN1yjHECZncuC0UMNVMRxZQuM8t4ephxAmTXnwmhtDRVxtGyE0ZzjlMT/3x58/0V5J/oC/zzPVBjaIEWKJXZN05R1E00xplhii6YYE00xzc2mnOye3b35Ifd17n297p6759y9Z7Mla4rRqCgqCggCKsUKggUsIDAw8I98DmVmnjIMY5JhZp7n+b7foJG1FyDcghoKyaPpIYSbXUODAI1scLkdYaZVUEgeNfci3L1naRCgoe3MQJicQxSSx9HZCLexhwYBGtreAoRJ2UsheeyfgnDf0ihAQyubiTDSLgrJ49tchJH20ChAQ6u5D+G+oZA8/pqOMI4SGgVoaE2/RLh/Ukga/Usd0JNyjtIoQENrXY5wa3opJItr6Qgjz6qhUYCG1v8+wi24SCFZNKchjO2hRhoFaGyHEG7WaQrJosmDMPblzTQK0NjKEW5qJYVkUZuCMI4XrtEoQGOrcUnQKyilkCwq3Ajj/B+DNArQ2BpyHdCbtK2PQnLwfeJCGFctDQM0tvPzUqCXsegKheTQttKJMO4zNAzQ2NqWZEDPPbWFQnK4sNSBMKmtNAzQ2DrWZEPPnn6WQnJouN8OPXtOBw0DNLbBf81HGPk0heRQO1OGXsaqARoGaHA1RQhXTSE5VORK0Mv/nsYBGlzTdIQ7RiE5HEpBmLsO0ThAg2ubjXAf+Skkhf0ywtx9gsYBGpx/JcKtvEwhKexGuF+co3GARvcPCWEeO0chGQxsRritPhoHaHS7PAiz6CSFZND6EMLtp4GARnewAGHmVFBIBvV3I4x8mAYCGt3xeQhTdJBCMqiYCT3JWUEDAY2u8ZcIk7GLQjIoKYKeY8pJGghodLe3I4zjKwpJwP9KDvTcD56ngYCGdwThvqSQBNpnpUEv7bnLNBDQ8KoRbnkvhcRrzXRAL/OzfhoIaHiNDgl60y5SSLzzCDfpBI0ENLzmIjf0Ck9RSLxTCJd/hkYCGt61X3ihl1tOIfGOI9zSbhoJaHiDvy6EnvcDH4VE83+GMNKfaSig8VXPgF7aklYKida2GmHSdtJQQOM7fzf03LPPUki0s0sRpmAfDQU0vv6N0LNl1FFItLr7EGZeBQ0FNIFdMnQkRyWFRCufjjCLG2kooAmUeBDmCIVEO+BFmDdv01BAE6iYhjDvD1JIsO9sCFNKYwFNoP5BCXrL2igk2E6EkStpLKAJtDwrQe/hBgqJ1bcWerLnFI0FNIH+f5GhN7+SQmJdnAe9lNkXaCygGVTL0JtSQiGx6u6CXtaTV2gsoBmcsUMv+xsKiXW4AHr5/zJAYwHNoDXdBh3X8kEKieTblg29qbU0GNAM+panQUfKa6eQSJfme6A3u5kGA5rC7gLoZV2gkEhNaTboPe+nwYCmcGwW9DJOUUikOrsEHdc3NBrQFBoWQs/z+SCFBKpAmEn7aTSgKXRvhl7KhmsUEmfwY4SZe5xGA5rDXui5Hm+mkDitzyLMI400GtAcDjuh47i7gULiNCxGmHdv02hAc6gptkFLzjlOIXEq5yHMMRoOaA7nf+GCjusQhcQpKYCe7SQNBzQH34ce6O2lkDhfe6Bj81yg4YAmUZMJvc29FBLmSxt0Mtf00nBAk7iYJ0FnYSOFROl5EnqFJTQe0CT8T9igM+sYhURpKoTe7FoaD2gW3+dCp2A3hUSpyoXe+i4aD2gW5XOhk/FcH4XE6PswCzrSdzQg0CzOPgIdm7uNQmJcWuKBjnM/DQg0i/73oCc3UUiMhqkOaElTKmlAoGkctUGvmkJiHHdJ0JIXN9GAQNOozbBB55M+CglxSIKO7YNuGhBoGufvSYXO080UEqH/bejZK2lEoGn4PsiGzsJTFBLh7GLouZpoRKB5VBdAp+gYhUSomAcdu/cyjQg0j5tPQSdtP4VE2J0Pncw1AzQi0ET+Cr1vKCTA4FMu6EwvpSGBJrLHC511vRTi73KODJ1FDTQk0ETKZ0FnbhOF+GtKh962fhoSaCJNS6Az5RiF+KtMhV4pjQk0Ed8O6Ex6zUch3rrfc0HLll9NYwLNpFKCVsr0FgrxduZBB7TcD5ylMYFm0uCSoSE56ynEW3WhDK30X/XSmEAzuTQjFTqVFOLtcKoErexaGhRoJv1v5kJnh49CnP0AHanwEg0KNJWqu6Cz5AyF+Op9CTruVQM0KNBUutZAZ3YFhfg6fTd0Ju+lUYHmskuGlncPhfgqnQqd+2poVKC5lBVCy/kVhbjyb5wEnW2dNCrQXBoegs7y2xTi6UpBCrSkwzQs0Fx6fgWdopMU4umcDC3JXkPDAk2mVoJWzif9FOKoBjruWedoWKDJNKfboZG2+BKF+On/FDre7b00LNBk+tdlQ8OeV08hfs4/AZ3iGhoXaDZlM6AhuY5TiJ/js6AlreimcYFmc/0F6JRSiJ99adByfUMDA01nD3S2dlGIm69t0LrrKA0MNJ2jXhkaC+soxMuNFdBZeoYGBppO/d0OaEw9SCFeyqdA51M/DQw0ne73UqCR/hWTSH9Hh5+m5duSDQ3JUUcjA83nRAY0bI/1MAkMtF9taaqr/Ozll393/NSlQZrSxaluaKRMaaGRgebTOgla3kYm3PXDr8yclJaa4nY5nS63J2fzJZrRSRla+dv9NDLQfPzrMqCR9ls/E+pmVcmLM3JSbQix567Zf9JP0zkCnTknaWigCR2cBg33kotMoFuVm70OhLHN+tduKvxtl9oGaHA3t0FL3uSjoYEm1PAwNGyTTzBhOvYvzfbYJIRzejc1M+DKD88UF01dcfg2Da1qAbRS9tHYQBPyvwsNyX2ICdJ74rUiKCR3VkGGA0He9VUDHNJduSnfBkiOGe910cj25kJDmlFFYwPNqNwhQWPrABOi68NsOwJk56J//1vl6ea6si//uMguYZgzt5pk//YcBKR+1EsD+5sNGvLWmzQ20IwaprugcX8DE6CnfF2eXULAor9cYND5/3c3hkmOlWfY9V6xAwH2BadpXLeWSdCwVdDgQDO6vTUDGlNKGH8dH811IsD1yA+9VGt8MgXDPM9U7ihwIUjOraRxVedDw5F9jgYHmlJlHjTSn+1nnPkrH3EhaO7/PU2drr/NxTA51QWFlHGMhtW7PRMaGSv9NDjQlG4tg4Y9o5nx1fmrmS4ZAYuqOIbaORhmk6Gwz6qjYZ2Z7YLGrKM0OtCc/umGhlzLuOraPhlB0sN1HNNf3NBzPnKWhlWdJkNNeqWLRgea04FCaEi/6mEc3f7ALiFoXh3Hdn0p9FLWtNGwSqFlO0jDA82pfjG0Hmxg/PTsmIqQ+8sZyUEbdDyf+2lUXa9DwzGjjoYHmpP/YxkaBUcZN72fTEaIbScjGvylDVoZp2lYJ+6FRupbXTQ80KROumSo2b9nvPR/mmlHkLywh5E13Aut7FYa1t5CaGSdoPGBJtW5Jh0a63sYH4O/mY0Q6YFzHM//gYbrqT4aVf9KD9Qcy7pofKBZHS2GxswaxkdtHhTurzmuv8pQ835Nw7rohUbW1zQB0Kw6V0Mjb7uf8XB5hQuKZ3wcV10W1KaX0qgGP/dA4+4qmgBoWnvSoOaZeYlx0P2WW0LInCaO71Ix1O6vpVFdWOKExvZemgBoWhV3QUOuZxzsngyF9G+M4tZcqL16i0ZVmSNDzVZBMwBN69ab0DrKiXdpqRuKRXWM4sp0qJXQsPY7oeaefYZmAJpXlU2C2rabnGjXNjug8p+MpikXKvajvHP+jrbzp0+dPFl3sqGlj4nW/RI0sj/w0QxA82pOtUFtbiUn2h4XVKRdjOawAwo5vZZ36Gbl9ytyPC7nqLSl3x5rZ0KVz4LG1EaaAmhe/i15UMvczQnWuEyCyuO9jOZLGYqUBWd5J7pO7Htp7uR0u4QA2ZU7e+MPR+p6mCj+9dlQc2/00xRAE6tbAI0VvZxQ1xa7oDKnnlH9ESqZb3czusGmt4okjMGd/+5VJkhzhgNqRaU0B9DE/FugUXiCE6l7h02CyheManARVHKPMbr2t3M9doxFsqU9/u11JkS1DI0t12kOoJmVTZKhkrm1mxPo+Fyouf+DUZV7oFLcyGj81ZsLMEROm/HojrLKE3W1lYe3FqUgwO7deoUJcPtdqEn2cpoEaGYN9zug4ixs4AT61gW1nAOMaqcLCunpHkZzNNMOOD2ZT+w8cqafo24dWJVlR4B7xXXGX80CqDlzztEkQDPzfZIKFcl5jBPn8jMS1J4aYFT/YYPC+RWjGNj/hF2CNPPxj25Qreu3BRJGyZ41Vxl3+zOglr+9nyYBmlpjjgy1N25zovRszYbG94zKd68ERe5ejm/g80I7kLW66lIftfqOrkSA5H7rNuNsYJMMtRXXaBagqfU/7Yba/EpOlFMeG9SkM4yqBWrzKzm+6kk2QF51kWOosEsImLybcVY/G2q272gaoLmVToda9recIH0f2iSoPdTLqA5AbckZjqvzdacEe9FRjqVzbSYCXI+1Ma787+ZB7a4KmgZobtdfhpp9WTcnRt0iaEhfMrp/QG2Hj+MqmQLAXvhJH8dybBqCnK9fZzw1z0yFirTtJk0DNLlSaHhrOTF+yIWG7TCj8i2HWgXH1bvYhiGSd/VljqFzHULc+xlPdTLU5GqaB2hydUUOqKRuv82JMLDGBY35A4zqdC4UsvsUx3U6DSMcmWsPtTPcdwiRN1xn/Pg/hpp7yS2aB2hynVvSoeKYdYoToXkKNKT/zej+lgqFq/ACx9P/mQtB3hd6GGafHSHTDjN+GhZDLX8XTQQ0u+p8qDkPcSJU5ULD8V+M7t8kKLybezie5qccCJLdpxnmUDpCcl/1M24OFEBt7VWaCGh23SudUNviY+x1b8+ARu5pRvc/oVJUxnE1PmiH4t3b1DuaixDP9GuMl8GNKVBI7v00E9D09uZCbV4VY69pnhsazw0wqktzoTK7geOqm2ODYkY59SqLJQTJ7hbGy4VpULEVn6CZgKZ37RWoZb8wyJg77pGhsZ/R7ZGgstbHcVUXy1Dk7Kfe8akSQuRGxon/sxyopL7bTTMBze+YW4bCmdvCmDsoQauZ0f1dgsL+HcdXO8sGRf5B6lUWS1A0Mk7O3ZsChS2vnqYCmt+5IhdU7DWMtc4t0JrjY1R9j0LFU8LxNT1kh2JmBfXKJ0sIkc4xTiocEhQpK/w0FdD8Bj4rhIq8vYsxVv8ANGx/ZHQXXFCZXc3xdb7phGJxPfXKJiHEkdHK+Oh+Q4LK3HKaC2gBnescUEizqxljxxdAw/kXRncKakvPMYrKNAkBkv2TPuqVehDimdHO+CifCxX5rW6aC2gF+zKgYtvNGCubBY2UbxndLqh92MsoOh91IMC+6BrD7JUQkrPZz/j4ayoUkvM4TQa0gqsvQkV6voOxdWAqNBZdYHT/H2rHGVXbSx4Zw3JevMhw30Mx5QDjo+NRGxRpm27SZEBLKHfIUBR8MMCY2lMAjT8yurOPQiHZmhjdle+fn3XXzPkbDlzhGL6BYn4d46L/Mw9UCqtoNqAl3FzsgsJVcJGxNPhiNjT+ndH9PQMKR8ZV3omuxrr6lkGOpXsDFJv7GRf18+xQyKv6aDagNZQUQyG7jjOWOu9Og8aXjO6PTiiynvfzZzo9D0Fy4THGx5EMCYrigzQd0BpubZShsu0mY+jWNBfUbIcZ3RdQKS7hz3WwCEHO128yLnyboba5naYDWkRpugTFlCOMoRu5EtQyTzGq/jlQmV/Dn6l7uQdB6acZH8dmQUWqoPmAFtHwoAOK1JcGGTsdXmgUtzKqo1Db2EWt/vZ+/iinPDYEeDf4GBe+1VlQpN51nuYDWsTA5x6oTG9k7LRnQWPlIKPaCbXd1PDXbHvkjaM+3rneHQiSVl1gfDTJUJm8Y4DmA1rFrSdcUGS/42PMXM+CxteMqv8pqDhKqVG2MNebO/MP/bxjZdMRYMs+wvjo+wRqq2/RhEDL+KEQCvf0RsbMjRwJakcY1YUsKOTcKqr5VnoApDzTyjvVscqFUbacd7oYH6fuh0rWPpoRaBkdL0LtCGPmVqEdalcZVRVUHPc1Uu1MJoakrGjjHbr2tBsBnvU+xsleN1TuP0kzAq3jiEeGYvN1xsrgc6lQu8modkLF9XQLVQb+4MGQtN/5eWfaNqfZMEJybu9knHRvkKGQ/jBIMwKto2meC4qpBxkzO71Q62RU/wmV1M/6qNKyzIUhWad4Z9pXp2OUK3/TdcZL+VQo3I/coCmB1jHwu2woHM/0MVb2FEDtFqO5uBgqabVUOznLjiE5rbwTV394zCVh1OR3fIyXrmc9UBTvozmBFtL5rAOKnDrGypGZUJkzyGh2pkMlq4VqZRkSgLQ1fo7Pf/1Kc92hjQUOjMpaU+Vj3NSm2xFi23yb5gRayZ5cKFJf72SM1N4HlS8Y1Z8cUMhLBqi2B8OmlHAcPY21FZ+ufXJRjg0jJLf3yV0tjJ+e96GQc47RpEArad8MhW3SccbI+Ueg8gWjOb9AgiL971S7+QKGPXCSkV16bUphfo43w2PHCMk19+MbjKfyWVC43+ykSYGWUpFhQ4jtLT9jw78dKl8wioGVUCv4gWrlszBsu4+RlUyBhj3/qVOMp4FX0hFin3yaZgVayq0VHijmVjJGjshQfMEo/u6A2txjVBl4KQeA5CjnOHYX2YfZZAkjnLNf+GqQcVQ/BYrM9YM0K9BaaqZDkfl8H2OjrsCBkDl+jqvufglqD9ZT5VK2E4B7ThPHUf30ggUL5s+Znp/pwjDZUzBvU0lNL+Pk9qsZUKxrpWmB1uLfloUQW3o9Y6P5l6lQXON4GhZK0NjaTZVaCUOyd/g4jv6L9UNO152oKCvd//2aPAzLmP/r+n7GRU2eA0Gyp5TmBVpMy2oobO/dZkz4P8uG4ijHUf0AdA5SpesdDJtSzzt37VUZozI2djAO+t+BwjmtgeYFWk25S0aQNKOKsXFjmYyQnYzs7EMO6JRSpXoOhjjX9vNH6C5/OgXDHJM2VfRzwlXMgyLv80GaF2g1nSszEOLazRj5zouQp3oYSeNihCmlyg/pGDK5hD/OuVU2jHAU/b6bE8y/PgMhKWu7aWKg5bQ8B8WKNsZG3SKEuCsZQdWDMsIcoOLmaglDNrfzR6pJtWGELf21dk6s+hwJIdOP0MxA69mXJSEo51UfY2LwU7uEAPkvHNuphTYA9qwp011QvDvIoP538wDYUiv5Y/k/KUZA/uZ2TqSut1KgeKebZgZaz+U1NgTZMxoZG+3LUhB0XwPHUj4fQxx5S9avzYbiqSsMOp3rBOB59hZ/NN9mJwIcr7ZzAlUV2BBkzzxJUwMtqDoVQZLtw17GRutyCQHyAw0Mc+ZPd0sYMnl7e+fF5VDcV8uAjtfsEoBplfwJyosljJLS3/Rxwgy85UDIpG29NDXQgro3TULIgirGSPkCCUFL6qlz6lEMS3u67DbJ3dkIyX+9lyO63izAkKw3+vgTnHtMRtCUX/s4UarmI8S2qp3mBlpR61oJQa6vGSODFQ+7JATM+VMjVU78rzkY5nquicMurZMRJGd97uOQjm0ZGCKvucSfYvAPdgRJ9kpOkL6VGQjJ2keTAy3pcLqMAHlZC2Pl8oYUBLkWf1t7tu1G1+3O62d3/XmRjGGu165wVLXXgSD7lI0lRw7vXjXJDsCVU8ef5lyKhCDp+UucGKcy7AjZeoMmB1pSx4upCMrYdIuxcvn1HCcU9qzCmTPvKkrBCDlzxb7rDOgvfTYVIfa0/DynjCHyU6UD/Gl6l7gQkraHE6LrHRlBzuw6mh1oTSfzECTZjzNmbm/MRiSulc1UaXwMY3Dt5U/2Dy8UK29xIhydjBDvuj6aHWhN/m15CJK23GDM9J18uzgF4exZLx/vpsbll/IkaDlyf9vDn2xXHhSFvxlk7HW/7EaQtPEGTQ+0qMubZAQVlzCGbh3dMqcgXYJCcuXM2FhyjXrXSjfMyLZLCHJMev5AH3+6/cVQpN3dytg7XIwgefJRmh9oVRUuCQG2ZV2MJX/9R/c4ZYTYC7ee6OFYfDWvZNkQIHu3XuXPcfguKCRHI2OuY7ETQe7tnTQ/0Ko6X/MiKPM3/Yypgdb6ik82rHr26WdXrvu4rPa8j5H0nKmrPLJj5VNPLHu77FQvf5bKuVCrYaz1f+qQEOB6/BotALSsKyvsCHDOPsWYG+i4fKnlUlu7n1H52i6ev9DFn6v2HqhVMNaqFiCkYA+tALSufbkIkNwlTHqDp4/s/vbAiU5GVL8QaocZY4ObUhDy+m1aAWhdHa8hZHULk9y1Tx+enp1WeN+b1d2MoPEBqH3gY2xVFyHIOf0ELQG0sNpUGwIyn+9nUjv/jIRRkzZ1c2yNi6C2oo0xdX1FCoK8O3ppCaCF9W7LQ4DdW8tkdvWJVAQ4vJ/5OKa6e6C2tp0xVeaREeBa2UVrAK2s4wUHAuxbrjN5dX8AhTT3BMdUNQ9qHw0wli5vQMicY7QI0NIOZUkISC1h8iqfDrVdHNPRWVArY0x9lYaQjwdoEaCldW53IMC25hqT1r50qG3q41hKp0GtkrHUttSOgIz112kVoLVdfTwFATmv9jJZfStD7f6LHMu+IigkRy1j6NbrqQhwPNtCywAtbv8UBMiuWiarndBY0MixfJ8PhcN7ljFUliYhwLuP1gFanO/9DBkBr3YwSX0rQe2+8xzD4KoMKLyv9DB2brwoI0DafovWAVrdtfWpCMjZxyT1vQMq0sZejqE9zwnF1ErGzuC2AgS4H71KCwEt7+rjNoyyr7jG5FSSBRXHXo7lnFuCYnUXY+eM14GA6WW0ElA4NAMB3q23mZSOz4ZCXnOZY6myQ+Hdx9jpes+GUVLm9j5aCSj0vO+SMEJOqWJSur4FIa7FFziW7vdtUKxpZewcyZcwyr66jZYCCuzYkI5R8uZ2JqVyBDk2tHJMDQ/ICJIcxxk7Nzc6McqWXUdrAQXy0goXRhXuZVI6V+jGsMkb91/h2MomIyTnlR7GTP87kxFQ8Kaf1gIKQ/bnIuDRa0xGg29OxhDpyfOMwP+yhCBpw03GzmmXjIBXO2kxoDCk50OHhBGpL99gMurd4sKQ2b8d5JgGf12EIPv6VsbOja0yRrkXnKTVgMKw66szMEJOP8Sk1LrGIQFZC/88wLHUFbgR4F56kTFUUoBRzscrBmg1oDDi8gqMklZdZFJqe8gGSI5Jb3Qw3PkVMoIKf2AMtT8tY1TO97QeUBh1ZKqEEVnrbjMpXXxeBmCb/OLBmosDVOsqX5WBANec3/sYO12vZ2KE5NreSesBhVGd76bKGOGuYHI696RbxhA55+HfX6fi6hteO0ZJmSuP9TGGKtJsGOFZcY0WBAoBN5d7MEJe3szk1PJ0CobZUrOX/uWfe0orT9afrj74zePpNoySHFvbGUttL8gYtfwyrQgUglrWyBiR+noPk9PVj+5JlzBCTp00dd4Dv3jonikZMgImbzrayVjybcnFqLsO05JAIeSIV8aI4g8HmZz81evy0t02hJOc6Y/sucrYqs7GCNm14zYtCRRCun+VjhGuyY1MVv2Nn/6iQIKezTP/45uMsdbnnBiR+fxNWhMoKG6sy8Sod7qYtPrOV+9/ZUFxTlaa2253ZeZPm7volR9KKxt9jLGubS4Jw1xr22hRoKBybgVGTSphUus6se+bNbOLvFmFz+86WNnQxYnwXR5GSHlltCpQUCvPsWOYc9UVJrvBWzc6Om4McKK0PerCMCntd/20KlBQ6357koRhWZs7aW0dr9kwYtKL3bQsUNDoWWPHMMlRRmvbn4pRmzpoXaCg1bYJozZeppXdXC9jmPu+OloYKOi0POZNG+KZd4RWdvJhb3paWlr2c1WDtDBQ0Gt5Y+GiRQvv/7CdVjZw4q2HH1i4cHsLLQ0UwvS0tDQ3N/tocd3Nzc0tvbQ2UBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISIQEEQIgIFQYgIFAQhIlAQhIhAQRAiAgVBiAgUBCEiUBCEiEBBECICBUGICBQEISJQEISI/hsxidvOs75EsAAAAABJRU5ErkJggg==\",\n            \"-1\": \"data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEAYABgAAD/2wBDACYaHSEdGCYhHyErKCYtOV8+OTQ0OXVTWEVfinmRj4h5hYOYq9u6mKLPpIOFvv/Bz+Lp9fj1lLf////u/9vw9ez/2wBDASgrKzkyOXA+PnDsnYWd7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Oz/wAARCAMgAyADASIAAhEBAxEB/8QAGgABAAMBAQEAAAAAAAAAAAAAAAQFBgMCAf/EADwQAQABAwEFBQYEBgICAgMAAAABAgMEEQUSISJBEzFCUXEGMjNhcrEUI1LBNDVigZGhFZIkglPwJaLR/8QAGQEBAAMBAQAAAAAAAAAAAAAAAAIDBAEF/8QAHREBAQEBAQEBAQEBAAAAAAAAAAECEQMiQTEhEv/aAAwDAQACEQMRAD8AuwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB8mYiNZnSCJiY1idYB9AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB8mYjSJmI17gfQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHi7dos25uVzpTD1MxEazwhnNr585FybVufyqZ6dQcMzNu5N+aoqqinupiJ6LzZFi5Zxt67MzVXpOkz3QqtjYX4i92tcfl0f7lpAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGf23avWsntYrq3K+7j3NA5ZNijJsVWq+6e6fKQU+x9ozFUY9+rWJ92qei9Y6/Zrxr9VuqJiqmWg2RnfibXZ1zHaUR/mAWIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAI2fl04mPNc+9PCmPmCDtvO7Oj8Paq5p96fJSWLVV+9TbojWap0eblyq7cmuudapnWZXuwsTctzkVxzVcKfQFji2KcaxTap6Rx+cuwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAqtt4fa2e3ojno7/nCisXq7F2m5ROk0y2MxExpMaxLLbTxZxcqqI9yrjSDR4eTRlWIuUzGvWPKXdltl5k4uRGs/l1cKmoiYmNYnWJB9AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB8mYiNZnSIZfamXOXkzMTyU8KVptzM7K12FE81fvfKGeBIwcarKyabcd3fMtZRTTRTFNMaUxGkQr9iYsWcbtao57n2WQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACHtTF/FYsxEa108aUwBipiYnTrC/2Hmdra7Cueaj3fnCBtnE/D5O/THJXxj5ShWLtVi9TconSaZ1Bshyxr9ORYpu0d1Ud3k6gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPF67TZtVXK/dpjV7Um3svux6J+dWn2BU5N6q/fruVTxql22bizlZdNMxyRxq9ERpdi40WMSK5jnucfSAWERERpHCIfQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABF2jjRlYtVGnNHGn1ZSY0mYno2rM7Zxuwy5qp925xjToDpsTM7G/wBjXPJX/qWiYqmZpqiY74avZ2TGVi01680cKvUEoAAAAAAAAAAAAcJy7MZHY73N59NfJ3Ou3Nn9ABwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABzv3abFmu7V3UxqyF65VevVXKp1mqdVzt/K0inHpn51KMEnAx5ycui3011n0ayIiI0iNIhU7Ax921XfmONXCPRbgAAAAAAAAAAPkzpGsvNy5Tat1V1zpTTxlnc/at3ImaLc7lv5dQW2VtbHx5mmJm5VHSn/+q25tzIqnkoopj0QsPEuZl7ct+szPRocbZeLYpjW3FyrrNXEFNG2MymZneidekws8LbFq/MUXY7OuevSUu7hY16nSuzR6xGks/tLZ9WFXvU61Wqp4T5fKQaauum3TNVdUUxHWUWnamHVc3Iu8fPSdGdvZl+9ZotV1zNNPRHBtYnWNY7n1G2dvfgbW936JIAAAAAAAAAAAAAAAAAACDtfH/EYdWka1Uc0Jz5MaxpIMUsti5XY5PZ1TyXOHpKNtHH/DZddERpTrrT6I8TNMxMd8A2oi7OyfxWJRXM80cKvVKAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WhabPzt7Szenj3U1T1+SrEJeNXp5zc5WmFbs/O3tLN6ePdTVPX5LJdL15m8XF5QB1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAebldNu3VXVOlNMay9KrbuT2ePFmmeavjPoCjybtV+/XcqnWZl4opmuuKY75l5WOxLHa5sVz3W43v7g0OPaixYotR3Uxo6AAAAAAAAAA+TMRGs8IfVTtzMm1bixRPNX73ygEHa20Jybk2rc/lUz06/NX26KrtymimNaqp0h5W/s/j716u/VHCiNI9ZBb4WJRiWIopjm8VXnKQADhm2ab+Lct1daZ0+Uu6Pn3exwrtfXdmI9ZBkZjSdHu1RNy5TTHfMvCdse12mfRP6OYGmop3KKaY6Ro9AAAAPNVdNEa1VRT6zoh5O1MbH1iKu0q8qe7/IJwy93aN/JyaKt+aIieEUzo01EzNFMz3zAPQAAAAAAAAAAAAAKf2gsb1qi9EcaeE+ihbHKtdvjXLX6oY+qmaappnvgFpsHI3MmbMzwrjh6tCxlqubdymuOk6tfYuRes0XI8Uag6AAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQABabPzt7Szenj3U1T1+SrEpeIennNzlaYVuz87e0s3p491NU9fksl0vXmbxcXlAHUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABlNp5H4jMrqj3Y4Q0O0r/4fCuVdZjdj1lk5nWdZAaPYdjs8TtJ77k6/wBmeopmuuKY75bCzbi1Zotx4Y0B0AAAAAAAAAB8qqimmap7ojWWQy79WRkV3Kus/wCGj2tc7PAuad9XCGWAanZNnsdn2461RvT/AHZrHo7S/bo/VVENjTEU0xEd0RpAPoACr2/dijEptda6v9QtGd2/d3sum30op+4Ktd+ztrhdu/8AqpGp2Tai1gW+HGrjIJoACo2zTl1XaIx4uzRu8dzXTXitwGYp2ftC7OkxX/7TLxmbPuYduiq5Ma1dIapT+0PwbXrP7ApLPxaPWGxt/Dp9IY6z8Wj1hsbfw6fSAegAAAAAAAAAAAAAGY2zZ7LOqnpXzNOqdv2d/HouxHuTpMgz6/2Bkb1mqxVPGmdYUCXsy/8Ah823VPdM6T/cGrAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPlUxTTNUzpERrIKL2gv71yixHhjWVO75l6b+VcuVdZ4ejgCdsezN3Pon9HM1Cn9n7Olu5dmO/hErgAAAAAAAAAAFXt+uacOin9VX7M60e36dcKmryr/AGlnAT9i2+02hRM91MTLTqH2dpib16rTjFMaL4AABkM27N7Lu16661Tp6NRm3Ys4l2uZ00pnT1ZDvB6t0TcuU0R3zOjZW6Iot00R3UxozGyLc3M+3p4eZqQfJmKY1qmIjzl8pqprjWmqKo84nVUe0F+aabdmmZjXml99n6auyuVzM6TOkQC4AAU/tD8G16z+y4U/tD8G16z+wKSz8Wj1hsbfw6fSGOs/Fo9YbG38On0gHoAAAAAAAAAAAAABxy7cXcW5RPdNLsAxUxMTMT3wROkxMdEnadrsc67TppEzrHoig12Bei/h2648tJ9YSFN7P3taLlmZ7uMR91yAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEPal7sMG5VHfVy/5TFH7Q3ombdmOnGQUoOmPb7XIt248VUQDU7Otdlg2qNNJ01/ykvlNMU0xTHdEaPoAAAAAAAAAAI20bM38K5REazprDJTGk6Nszu2NnzZudtapmbdXf8pB79na4i/donvqpiY/sv2OxcivGv03aO+Onm0eNtTGv0RM1xbq601AnPkzERMzOkR3yjXdo4tqmZm9TPyp4zKkz9p3cz8q1TNFvy6z6g9bW2j+Jq7G1P5VM8Z/VKsW2Lsau5j1XLs7tcxy0quumaKppqjSYBb+ztHPdueUbv8A9/wvWd2Jl28e5XRdq3aa47/mnbS2napx5os171dXDh0gFRtG/wDic2uqOMa6UtFs+x+Hw7duY0q01n1Uex8ScjJ7SuOSjjPznyaUAABT+0PwbXrP7LhT+0PwbXrP7ApLPxaPWGxt/Dp9IY6z8Wj1hsbfw6fSAegAAAAAAAAAAAAAAAUXtDZiLlu9HijSf7KZptt2u0wZqiONE6syCXsu92Gdbqnumd2f7rvPzuz1tWZ5+tXkoLFqdYrnhp3JKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGV2td7XPuTHdE7vD5NPer7OzXXrpu0zLHV1b9dVU9Z1B5T9i2+0z6ZnupjVAXns7b5btye/hEAugAAAAAAAAAAAHyYiYmJjWJ6PoCqyti2rnNYns6vKe5Aq2LlRPCKZ/vDSAM9a2HkVVfmVU0x/la4mzcfF0qpjer/VKYAIOdsy1lzv+5c846pwDOV7EyaZ5Zpq9J0e7GxL1VcdtMUU9eOrQAOdmzRYtRbt06Uw6AAAAp/aH4Nr1n9lwp/aH4Nr1n9gUln4tHrDY2/h0+kMdZ+LR6w2Nv4dPpAPQAAAAAAAAAAAAAAAOeRR2mPco011pngytqxO9M190T3ea+z87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIO2bvZ4FenfVMQy689ornLatx38ZlRgNPsW3ubPomY41TMsxEazo2GJRFvFtUx0pgHYAAAAAAAAAAAAAAAAAAAAAAAAFbtm9kWaLU481azM67oLJT+0Mx2VqNeOsoMZe0pjh2v+JR7tGXeq3rlF2qfnEyDla+LR6w2Fr4VH0wyP4a/wD/AA3P+spFu7tG3TFNPbxEd0cQakZn8ZtHzuf4lpKJmaKZq79I1B6AAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAM1tyvez5iJ4UxEK5Iz6+0zbtUd29OiODri0TcybdEeKqIbCIiIiI7oZbZNG/tC3EdJ1/wANUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHi9O7ZrqjpTMvaLtKrcwL1Xy/cGUqq3qpq85fABabAo1zJr/TTLRKX2dp4Xq+vCF0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAARr97Xlp7uspSdQ9PSYnasNlV0XNoRRpExETMT81+ymy6t3PtfOqIatdJx5m93d7QB1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAVm3a93C3f1Ss1N7RVclmnXjrMyCiABodgUaYlVX6qlqr9iU7uz6fqmVgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnapczftV9lVG7OkTKIs9vU6Zu95xCsXSceZvd3e10x6+zv0VxOm7OrY0zvUxMd0xqxTY41UV41uqP0w6g6gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAM97QV65VFH6aWhZjbdUVbQq06REAgARxnQGt2dTu4NmJ/TqkuWNGmNaj+iPs6gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tUXtFTO/Zq6TEwpl97RRrZsz5TP7KF1AavZlW9s+zPy/dlGm2JVvbPpjX3ZmAWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADJ7TnXaF75VTDWMfl1b+VdqnrVMg4vVuNblMfN5dMeNci3H9UA19qNLNEf0w9gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQVe36dcOmryq0Z1pduRrs+fqhmgGg9nqtce7HlVDPrv2dq4XqPPSQXYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPNc7tFVXlGrHXZ1uVT82wvfBr+mfsxszrOoPiRg072bZietcfdHStmRrn2fqgGsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAIW141wK/lpLLNZtKNcC99LJgLf2en8+5H9Ov8AuFQtNgVaZtUedEwDRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5ZMxTjXZn9Msc12fOmFdn5MiAm7JjXaFv1QlhsP8AmVHpP2BpgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9FiC6TjzN7u72gDqAAAADhmRvYd6J/RM/wCmQbHK/hb30VfZjgFjsOdNoR86ZVybsidM+36g1IAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIu0uGBe9P3ZNq9qcNn3vSPuygCw2H/Mafpn7K9ZbC/j4+mQaQAAAAAAAAAAAAAAAAAAAAAAAAAAAAABX5+d2etqzPP1q8jPzuz1tWZ5+tXkqVetfkbPDw79aAFTaAAAAAtcDB3NLt6Obw0z0Sk6h6ekxO0wMHc0u3o5vDTPRYguk48ze7u9oA6gAAAAAA55H8Nd+ifsx1XvT6tjf+Bc+mfsx1fv1eoPiXsudNoWfqREnZv8wsfXANaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACHtbhs296R94ZVqdsTEbNvfPT7ssAstg/x3/rKtWewf43+0g0YAAAAAAAAAAAAAAAAAAAAAAAAAAACvz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7QB1AAAAAAAAB4vfBufTP2Y6v36vVsb3wa/pljrnxKvWQeUnZ38wsfXCM7YfDKtfUDYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgba/l1frDMNPtr+XV+sMwAs9gz/5unylWLLYUf8AnxP9Mg0gAAAAAAAAAAAAAAAAK3O2tax9aLfPc/1ALCqqmiNa6opjzmdEO5tXDtzpNyZ9IZ6/k38q5rXXVVM90J2NsS9cpiq7XFuJ6aayCfTtrFmrSd6I89E61ftXqd61XFUfJUXdg8NbV7WfKqFb/wCTs7I460Vx/iQa0UWTtuarFMWY3bkxzT5eiupzsmm5v9tXr86ga4ccO7N/Ft3ao0mqOLsAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAeL3CzX9M/Zjq/fq9ZbC/Gti5H9M/Zj6+FdUfMHl1xp0yLc/NydMeNb9ER5g2QAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIG2v5dX6wzDT7a/l1frDMALPYP8AGf2lWLPYP8Z/aQaMAAAAAAAAAAAAAAETaOZTh48zE/mVcKYBE2vtHsYmxZnnmOaY6fJQcZnzkqqmuqaqp1mU3ZGL+JzI3o1oo5p/YFlsfZ3Y0xfvR+ZVHLHlC2ABA2vixkYlVUR+ZbjWJ+8J7lk1xbxrtc90UzP+gY59piZqiI6vk8Z1SdnW+1zbVM92vEGpsW+ysUUfphDz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7QB1AAAAAAAAAAAAB4u/Cr+mWOufEq9ZbG78Kv6ZY658Sr1kHl1xf4m39Tk64v8Tb+oGxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABA21/Lq/WGYafbX8ur9YZgBZ7B/jP7SrFnsH+N/tINGAAAAAAAAAAAAAAy21cqcnLmY92nhS0Odd7HDu19YjgyMzrOoDR7Csxbw+0mOa5P+meopmuummO+qdGwsW4s2LduPBTEA6AAK/blzcwKo141zELBRe0V3W5atRPdEzMApkzBqrs71ynhVVGkT5fNysWd7mq7ukeaSr1r8jZ4eHfrQAqbQAAAADPsXrFm3VVGkV/5hKTqHp6TE7UjZd7HnM3bnGrwT01XzFUzNMxMTpMNbg3vxGJbuT3zHFdJx5m93d7UgB1AAAAAAAAAAAAAAB4u/Cr+mWOufEq9ZbG78Kv6ZY658Sr1kHl1xf4m39Tk64v8Tb+oGxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABX7b/l9XrDMtPtr+XV+sMwAsthfx8fTKtWewf43+0g0YAAAAAAAAAAAAAK3btUU4MR1mr9pZtofaCmZxKJ6RX+zPAlbMtdrn2qekTr/ji1jPez9veyq6/wBFP3aEAABnM/8A8jPuXJ92md2I9Fnn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpno87fpicKKusVxCzU/tDd0tW7XnO8uk48ze7u9qhaPYNUzhzT0ipnGp2TZmzg0RMaVVcZdQTQAAAAAAAAAAAAAAAc7/wLn0z9mOr9+r1bK98Gv6ZY658Sr1kHl0x/j0erm64v8Tb+oGxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABD2v/Lb3pH3hlWr2rx2de9I+8MoAstg/x3/rKtWWwv46PpkGkAAAAAAAAAAAAABB2xb7TZ9f9PMy7aV0xXRNNUaxMaSyedi14uRNFUcO+J84BY+znxL/AKR+69ZbZOVTi5cVVzpRVGktRTVFURNMxMT3TAPqvz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7XyZimJmZ0iOMsptHJnKy6q+6I4RCz21n7uuNanj4pj7KvCw7mXdimmNKetXk6g67Lwqsq/EzH5dPGqWniIiNIjSIcsbHt41qLduOEd8+bsAAAAAAAAAAAAAAAADxe+Dc+mfsx1fv1esthf8AgXPpn7MfX79XqDy7YfHKtfU4pOzv5hY+uAa0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEXafHAven7sm1u0I1wrsfJkgFjsKf8A8hH0yrlhsP8AmNP0z9gaYAAAAAAAAAAAAABHzMO1l2925HGO6qO+EgBlsrZmRjcd3fo86X3Eu5NmmYpuVUU/pXGfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7RA2pn04tqaKJ/Nq7vk9bRzqcO1w0m5PdHkqsLBu7QvTfvzMUa8Znq6g44ODdzrs1VaxRrrVVLSWbNFi1Fu3Tu0w+27dFqiKKKYimPJ7AEHa2RXjYm9bq0qmqIh92Tdu3sTtLtW9M1cATQAAAAAAAAAAAAAAAc8j+HufTP2Y6r3p9Wwyf4a79E/Zj575B8Sdm/wAwsfXCMlbMjXaFn6oBrAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAccqnexbsf0yx7ZX/gXPpn7MaAn7Fnd2jRr5TCAmbJnTaFr1BqgAAAAAAAAAAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9FiC6TjzN7u72iLnZlGHZmqrjVPu0+bvdri1bqrnupjVk8vJryr83K57+6PJ1B3xpt5WVN3Mu6Rrqvac/Copimm9TER3RESygDWf8AI4n/AM9P+JP+RxP/AJ6f8SyYC021m0ZFVFFqrepp119Vvsunc2fZj5fuykRrOjZY9MUY9umOlMA6AAAAAAAAAAAAAAAA5Zf8Je+ir7Mc12fO7hXpj9MwyICZsmNc+18pQ1hsSne2hTr0iZBpgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAebka26ojrEsbcjSuqPm2jHZMaZFyPKoHJK2bOmfZ+qPuiu2HVNOXamOlcfcGwAAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoPNyim5RNFXdMaSgf8Nh/pr/7LEBXf8Nh/pr/7H/DYf6a/+yxAV3/DYf6a/wDsf8Nh/pr/AOyxAQKdj4dNUVRTVw86k8AAAAAAAAAAAAAAAAARNqVRTgXfnGjKNPtmdNn1esMwAs9gxrnTPlTKsW3s9H/lXJ/o/eAaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABktoxpn3/rlrWW2vTu7QufPiCE6WJ0v25/qhzeqJ0rpnykGzjjGsPrxZnWzbn+mPs9gAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAAAAAAAAAAAAAAAAAAFdt2dNnz9UM00HtBOmNbjzlnwF17Oxz3avlopV97OxpYvT51QC4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAZzb1Mxnb3nTDRqL2ip/MtV+caApgAbDFmKsW1Mfoj7OyLsyrewLU69NP9pQAAAAAACvz87s9bVmefrV5Gfndnraszz9avJUq9a/I2eHh360AKm0AAAABa4GDuaXb0c3hpnolJ1D09JidpgYO5pdvRzeGmeixBdJx5m93d7QB1AAAAAAAAAAAAAAAAAAAAAAAAAAAABTe0VXJYp+c/solv7Q1a37dP6YVADSbCo3cHe61SzbV7Kp3dn2Y+U/cEsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABUe0NOti1PlMrdA21Rv7PrmI40zEgzAANLsOrXZ8RrxiqViqPZ6rXHuU+UwtwAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9FiC6TjzN7u72gDqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADNbdq1z5jyphXJm1qt7aF2fKdEMBscamKMa3TH6YZLHo7S/RREazM6NjTG7TER3RGgPoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADhm0dph3af6dXd5rp3qKqfOJgGLHu9Tu3a6fKdHgF17O1816jziJ/+/5XjNbCq0z4jXhNMtKAAAr8/O7PW1Znn61eRn53Z62rM8/WryVKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAc786WLk+VM/YGSyq5ryrtU9ap+7k+1TrVM+cvgJeyqd7PtfKrVq2d2BbmrMmvpTTLRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAye07fZ592NNNaplFWu37W7lU3P1UqoErZlW7n2fnVENYxlmrcu0VeU6tjRVv0U1ecag9K/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABF2lc7PBuzrprGiUrNvV7uFFH6qvsDOAAvfZ6jS3drmOMzEQuUHY1vs9n0T1q1mf8pwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKr2gt72LRX+ir7s81m0rXbYN2nTWYjWP7MmAv52hMYVui3PPNOkz5KexZ3uaru6R5pKvWvyNnh4d+tACptAAAAAWuBg7ml29HN4aZ6JSdQ9PSYnaYGDuaXb0c3hpnosQXSceZvd3e0AdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFJ7RV/Bt+srtmdt3N/PqiO6mIgFe+0xNVURHfL4kbPt9rm2qZ7t6NQanGoijHt0xGmlMOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA+VUxVTNM90xpLK1Y25kXIrjhTVMRC7z87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPkzpGssjmXO1y7tfnVOjUZlzssS7XPSlkJnWdZAWvs/Z3smq70op0/yqmj2Da3MOa+tdX2BZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFZt67uYcUfrq+zOLb2gu72TRa6URr/AJVIPtNM1VRTHfM6Nhi2+yxrdGmmlLNbKs9tnW6Z7onen+zVAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/Pzuz1tWZ5+tXkZ+d2etqzPP1q8lSr1r8jZ4eHfrQAqbQAAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAAAAAAAAAHO9et2aJruVRTEefUHQUWVtyuZmnGpimP1TxQIu5mVXy1Xa5n9OoNXFVMzpFUTMdNX1k7ljNsxvV03aY8+KXg7YuWppov89Hdr1gGhEW/n2LFim7NWsVRrTEdVdTt7W5zWdKPXiC7Hi3cpu26a6J1pqjWHsAAAAAAAAAAAAAAAAAAAAB8mdI1l9RtoXexwrtfDu0j+4M1n3e2zLtcd01Tp6I4+xE1TER3yC89n7GlFy9Md/CJ+65cMKzFjFt24jSdNZ9XcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABX5+d2etqzPP1q8jPzuz1tWZ5+tXkqVetfkbPDw79aAFTaAAAAA8Z1u7YiimuN3fjVKTqHp6TE7XG9f46UT3dWpxLvb4tu5+qGPaD2fvb1iu1M8aZ1iPkuk48ze7u9q2AdQAAAAAAAAAeL12izaquVzpTTGsg45uZbxLW9VOtU+7T5szk5V3KuTVcqmfKOkPuZlV5V+blXd0jyecWxVk5FFqnxTx9ATNlbN/FT2t3WLUf/ALNDbt0WqIpt0xTTHSC1bptW6bdEaU0xpD2D5PHvUm2tn0UUfiLNO7p78R91455FNNWPcir3ZpnX/AMdNUzERMzMR3Pj7PfOjriW+2ybdv8AVVoDUYNE28O1RPSlIfIjSNIfQAAB8mYiNZ4Q4V52LROlV+iJ9QSBGp2hiVTpGRRrPzSKaoqjWmYmJ6wD6AAAAAAAAAAAAAApvaG9pbt2onv4zC5ZXal/t82uYnWInSPQENO2Rj9vm06xrTTzSgtHsLH7LFm5Mc1yf9AswAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFfn53Z62rM8/WryM/O7PW1Znn61eSpV61+Rs8PDv1oAVNoAAAAC1wMHc0u3o5vDTPRKTqHp6TE7TAwdzS7ejm8NM9DbWP22HNcRzUcdfksXyqmKqZpqjWJjSYXSceZvd3e1ik3ZOR+HzaJmdKauWfRxzLE4+TXbnpLjE6Tq6g2oj4F/8RiW7mvHTSfVIAAAAAAAAAUG3cvfuxYoq5afe9V5euRas13J7qY1Y65XNdyqqeMzIPK89n8fSmvImO/lp/dRtbs+z2GFao00nd1n1kEkABD2rd7LZ92fON3/KYpvaG7pbtWo8UzVIKJZbCtdpm70xwojVWr/2ftbtiu5Me9OkSC3AAR8zLt4lnfr7592POUhmtt35u5s0a8tHCIB9mvN2pXM0a7kT3R3Qk29g6x+bf4/0xqh7O2lcxaotzpVbmeMT0aamYqpiqJ1iY1gFDlbErt0b1iubmnSY4q61kXse5vUV1U1Q2DL7Yt02toVxTGkTpILrZufTmW9J4Xae+PP5pzH4l+rHyKLlM6aTx+bX0zFVMVR3TGoPoAAAAAAAAAAAI2fe7DDuV9dNIZKZ17117QX+aixE93NKlB1xbNWRkUW6Y1mZa+3RFu3TRT3UxpCm2Bje9kVR/TT+67AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAV+fndnraszz9avIz87s9bVmefrV5KlXrX5Gzw8O/WgBU2gAAAALXAwdzS7ejm8NM9EpOoenpMTtMDB3NLt6Obw0z0WILpOPM3u7vaAOoKjb2Lv24yKY408KtI6eagbS5RTct1UVxrTVGksjlWKsfIrt1RpMSCz9n8iKa67FU6b3GPVesbj3arN+i5T30zq19q5TdtU3Ke6qNQewAAAAAAAQNtVzRs+qI8UxEsw0HtDOmLb+r9mfB2w7c3cu1REa61Q2DN7Ct7+fFWnuUzLSAAAMzty5FzPmInWKIiGlqmKaZme6I1Y6/X2l+5X+qqZ/2Dm1uz7XY4VqjTjpqy+Lb7bJt2/1VaNhEREREd0A+jjlZNvFtdpcnh3REdXjDzbWZE9nrEx3xIJLN7Zxq7eXVc3ZmivjEtI+TEVRpVETHlIMhj49y/epooomZmWttU7lqij9NMQ+00U0e7TFPpGj0AzO3J12jXHlEfZpLldNuiquqdKaY1lkcu9N/JuXJ8Ug5UUzVVFMd8tnbp3bdNM98REM9sXDm9kdtXHJRx9ZaMAAAAAAAAAAB8qqiimaqp0iOMy+qzbmT2WN2VPvXO/0BRZd6cjIruT1nhHk8WrdV27TRTGs1To8LjYOLvXJyKo4U8KfUFzjWYx7FFqnwxx+cuoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK/aGb2Wtq1PP1nyWCLm4lOTRrHC5HdPn8nNd5/izyuZr6UY9V0VW65prjSqO+HlQ9UAcAAAFrgYO5pdvRzeGmeiUnUPT0mJ2mBg7ml29HN4aZ6LEF0nHmb3d3tAHUAABUbexd+3GRTHGnhV6ea3ea6KblFVFUa01RpIMWv8AYOVv2ZsVTxo40+ipz8WrEyaqJjl76Z84ecO/VjZNFyOk8Qa8eaKqa6YqpnWmY1iXoAAAAAAFbt2jewddONNWrNtjk2e3x67Wum9GjIXKJt1zTVGkxILf2c+Jf9I/des97P3Yoyq7c+Onh/ZoQAcsi/bxrU3LtWkR/sHDal/sMG5OvNVG7H92VSs7MuZt7eq4UR7tPlCKCx2Ha7TOiZ7qI3mlUns7TTpeq8UaR/ZdVVU0UzVVOkRxmQUXtBd1vUWonhTGsx80nYFncxqrkxxqnh6Ke9VVmZ1UxGs11cIhqce1FixRajupjQHQAHi7cps26rlc6U096vr23jU+5TVV/pYXrVN61Vbr92rvQp2NiT0q/wAgp8/aV3M5Ijct/pjr6veDsm7kaV3OS35+abk7Dt9nrjVVRXHSqe9W2s7LxK93fnlnjTV3A09m1RZtxbtxpTD2h4G0LeZTpHLcjvpTAAAAAAAAAAAfO6NZZbamT+Jy6qonlp4U+i62xlfh8WaaZ56+EfKGZB7tW6rt2mimNZqnRrcWxTjY9FqnpHGfOVVsHE78muPlTr912AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACLm4lOTRrHC5HdPn8lLXRVbrmmuNKo74aRFzcSnJo1jhcjunz+SGs9/2NPj7f8APzr+KMeq6Krdc01xpVHfDyqegAtcDB3NLt6Obw0z0dk6h6ekxO0wMHc0u3o5vDTPRYguk48ze7u9oA6gAAAAAAg7Ww4ysaaqY/Mo4x82XmNJ0ltmd21h9je7aiOSvv8AlIJmwsuLlmceqeajjHotmPxb9WPfpuUzpMS1tq5TetU3KJ1pqjWAewAAAAAFXtTZn4jW9Z0i51j9S0AYz8yxcieNFdM8Oi3x9u6URF+3NVX6qVrfxbGRH5tuJnz6oVWw8aZ5aqoj/IOd3b1vd/KtVTV/VPBXaZe1L+s61f6iFxa2Ni25iaoqqmPOeCfRRRbp3aKYpjyiAQbGyrFrHqt1RvV1RpNXl6KDLxbuLdmi5TMeU+bXvF21bvU7tyiKo+cAy+z86rCuzVu71M98JGftarKt9lbomime/jrqsa9i4tXu71M+ur1j7IxrNUVzE1zHn3AjbFwJp0ybscfBE/dcvkRpGkPoA+TMRGszpEKu9tuzbrmmiibkR110BaiJhZ9nMiYo1iqO+mUsBn9v2Ny/RdiOFccfWGgVHtDH5FqfnP7Ao7VyuzciuidKo7mrwsmMrGouR36c0eUsivfZ2v8ALu0ce+JBcgAAAAAAAPkzpGs9z6rNtZfYY/ZUTpXc+wKjamV+KyqpieSnhS5YmPVk5FNunrPGfJw75aXY+H+Hx+0qj8yv/UAnWrdNq3TbojSmmNIewAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABFzcSnJo1jhcjunz+SlroqormiqJiqO+Gkc6rFuu7Tcqoia6e6UNZ60eXvcTl/iFgYO5pdvRzeGmeixBKTire7u9oA6gAAAAAAAAOWRYpyLNVqvuq/wBOoDHZNivGvVW640mFpsLM0qnGrnhPGn1Ttq4MZdnepj82ju+fyZqJqtXInjFVMg2gjYGVTl41Nce9HCqPmkgAAAAAAAAAAAAAAAAibUmadnXpp79I+7KNlftxes126u6qNGSyLFePfm1cjSYkEnY81RtC3u/39GoVuyMXGt2u1tV9pXPfM9PksgFL7RVxu2aOvGfsuZmIiZmdIjvll9q5UZOXM0zyU8IBCaD2ftTTj3K5j3quEqbDxa8u9FuiPWfKGrs2qbNmm3R3UxoDoAAAAAAADxduU2rdVyudKaY1lk8zIqysiq7V1nhHyWe3czWfw1E8I41eqsw8avKvxbojh1nygE3Y2D29ztrkfl0d3zlonOxaosWqbdEaRTDoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAApNt4Hfk2o7/AH4/ddvlURVTNMxrExpIMts3MnEyInwVcKoammqKqYqpnWJjWJZ/N2RdovTNima7c8Y06LPZNGRbxpt5FOm7PLr3gnAAAAAAAAAAAAAAAAIudhW8y3pVwrj3akoBmruz83FqmbcVVRHHWl9jaudb4V1a6edMNI8zTTV71MT6wDNXsvOzYijmmPKmHrF2PkXqvzY7Knrr3tJEREaRGkPoOGLi2sW3u26ePWesu4AAAAAAAIm0cuMTHmrXnq4UwlqLauHmZGVNUUTVRHu6eQKqIrv3tIiaq65afZ2HTh2IjT8yfelH2Vs38NHa3oibk90eSzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB//Z\"\n        };\n\n        let databinding = {};\n\n        let judgements = supersection_all_vec_analyses.data.map(x => x.judgement);\n        let majority = MathHelper.majority(judgements);\n        this.setButtonImage(this._display_image[majority]);\n\n        this.dataparams = [supersection_all_vec_analyses, path_analysis]; // Fill in parameters\n\n        let layout = new Layout(this.button_subwindow);\n        layout.setRect(\"Title\", new Pos(0, 0), new Pos(100, 10), new RU_DataViewText());\n\n        let suggested_action = new RU_DataViewSuggestedActionBlock().setDataAnalysisFunction(x => {\n            \n            let returnarr = [];\n            let data = x.data;\n\n            // We reuse the judgement here.\n            if(majority == -1) {\n\n                returnarr.push(\"JudgementNegative\");\n            }\n\n            \n            return returnarr;\n        }).linkMouse(layout._layout_clickable);\n        suggested_action.setHint(\"JudgementNegative\", \"Vectorization\");\n\n        layout.setRect(\"SuggestedAction\", new Pos(70, 70), new Pos(30, 20), suggested_action);\n        \n        let thread_graph = new RU_DataViewBarGraph({\n            type: 'bar',\n            yAxes: [{\n                type: \"linear\",\n                display: true,\n                position: 'left',\n                id: 'axis-1'\n            }\n            ]\n        }).setDataAnalysisFunction(x => {\n            \n            let sp_s1 = [];\n            let sp_p4 = [];\n            let sp_p8 = [];\n            let sp_p16 = [];\n\n            let dp_s1 = [];\n            let dp_p2 = [];\n            let dp_p4 = [];\n            let dp_p8 = [];\n            if (x != null) {\n                sp_s1 = x.data.map(x => x.data.sp_ops_scalar);\n                sp_p4 = x.data.map(x => x.data.sp_ops_128b);\n                sp_p8 = x.data.map(x => x.data.sp_ops_256b);\n                sp_p16 = x.data.map(x => x.data.sp_ops_512b);\n\n                dp_s1 = x.data.map(x => x.data.dp_ops_scalar);\n                dp_p2 = x.data.map(x => x.data.dp_ops_128b);\n                dp_p4 = x.data.map(x => x.data.dp_ops_256b);\n                dp_p8 = x.data.map(x => x.data.dp_ops_512b);\n            }\n\n            let colors = RU_DataViewBarGraph.colorList();\n\n            let datasets = [];\n            // So now we have a mapping of thread -> cycles.\n\n            let repcount = supersection_all_vec_analyses.repcount;\n            if(all_analyses_global) {\n                // We need to group and add\n                let chunksize = sp_s1.length / repcount;\n                sp_s1 = ObjectHelper.createChunks(sp_s1, chunksize, MathHelper.sumArray);\n                sp_p4 = ObjectHelper.createChunks(sp_p4, chunksize, MathHelper.sumArray);\n                sp_p8 = ObjectHelper.createChunks(sp_p8, chunksize, MathHelper.sumArray);\n                sp_p16 = ObjectHelper.createChunks(sp_p16, chunksize, MathHelper.sumArray);\n\n\n                dp_s1 = ObjectHelper.createChunks(dp_s1, chunksize, MathHelper.sumArray);\n                dp_p2 = ObjectHelper.createChunks(dp_p2, chunksize, MathHelper.sumArray);\n                dp_p4 = ObjectHelper.createChunks(dp_p4, chunksize, MathHelper.sumArray);\n                dp_p8 = ObjectHelper.createChunks(dp_p8, chunksize, MathHelper.sumArray);\n\n            }\n\n\n            // We don't really care about runs (since they should all be identical, or we'll have a problem anyways)\n            // Therefore, we only take the first element from each set\n            datasets.push({ label: \"SP_1\", yAxisID: \"axis-1\", data: sp_s1[0], backgroundColor: colors[0] });\n            datasets.push({ label: \"SP_4\", yAxisID: \"axis-1\", data: sp_p4[0], backgroundColor: colors[1] });\n            datasets.push({ label: \"SP_8\", yAxisID: \"axis-1\", data: sp_p8[0], backgroundColor: colors[2] });\n            datasets.push({ label: \"SP_16\", yAxisID: \"axis-1\", data: sp_p16[0], backgroundColor: colors[4] });\n\n            datasets.push({ label: \"DP_1\", yAxisID: \"axis-1\", data: dp_s1[0], backgroundColor: colors[5] });\n            datasets.push({ label: \"DP_2\", yAxisID: \"axis-1\", data: dp_p2[0], backgroundColor: colors[6] });\n            datasets.push({ label: \"DP_4\", yAxisID: \"axis-1\", data: dp_p4[0], backgroundColor: colors[7] });\n            datasets.push({ label: \"DP_8\", yAxisID: \"axis-1\", data: dp_p8[0], backgroundColor: colors[8] });\n\n            let chartData = {\n                labels: [...Array(sp_s1[0].length).keys()],\n                \"datasets\": datasets,\n\n            };\n\n            return chartData;\n        }).linkMouse(layout._layout_clickable).changeGraphOptions(x => {\n            x.options.title.text = \"FLINS per thread\";\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').scaleLabel = { labelString: \"Instructions\", display: true };\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').ticks.beginAtZero = true;\n            x.options.scales.xAxes = [{ scaleLabel: { labelString: \"Thread\", display: true } }];\n        });\n\n        layout.setRect(\"Graph\", new Pos(0, 10), new Pos(70, 50), thread_graph);\n\n        layout.setRect(\"FLOP/C\", new Pos(70, 20), new Pos(30, 20), new RU_DataViewNumberBlock().setTitle(\"FLOP/C\").setOptions({\n            draw_bar: [\"left\"],\n            padding: { left: 10 },\n            display_title: true,\n            text_align: \"center\",\n        }).setDataAnalysisFunction(x => {\n            // Select an arbitrary run, i.e. 0 (all should be identical)\n            let sp_flop_per_c = x.data[0].data.sp_flops_per_cycle_parallel;\n            let dp_flop_per_c = x.data[0].data.dp_flops_per_cycle_parallel;\n            \n            return Math.round(dp_flop_per_c * 100.0 / (target_dp_flops_per_cycle_per_thread * x.data[0].data.sp_flops_per_cycle.length));\n        }).setColorScaling(x => 100 - x));\n        \n\n        databinding[\"Title\"] = new DataBlock({ fontsize: 32, text: \"Vectorization\", color: \"black\", align: \"center\" }, \"Text\");\n        databinding['Graph'] = supersection_all_vec_analyses;\n        databinding['SuggestedAction'] = supersection_all_vec_analyses;\n        databinding['FLOP/C'] = supersection_all_vec_analyses;\n\n        layout.setDataBinding(databinding);\n        this.button_subwindow.setLayout(layout);\n\n        this.setOnEnterHover(p => { this.color = \"#FF0000\"; this.button_subwindow_state = 'open'; })\n        this.setOnLeaveHover(p => { this.color = \"orange\"; if (!this.is_locked_open) this.button_subwindow_state = 'collapsed'; })\n        this.setOnClick((p, mb) => { this.is_locked_open = !this.is_locked_open; });\n\n        this.setDefaultDblClick();\n    }\n\n\n\n}\n\n// Old counters: ['PAPI_VEC_SP', 'PAPI_VEC_DP', 'PAPI_SP_OPS', 'PAPI_DP_OPS']\n// New counters (Split out): VEC_SP: ['0x40000025' (SCALAR_SINGLE), '0x40000026' (128B_PACKED_SINGLE), '0x40000027' (256B_PACKED_SINGLE), '0x40000028' (512B_PACKED_SINGLE)], ['0x40000025', '0x40000026', '0x40000027', '0x40000028']\n// New counters (Split out): VEC_DP: ['0x40000021' (SCALAR_DOUBLE), '0x40000022' (128B_PACKED_DOUBLE), '0x40000023' (256B_PACKED_DOUBLE), '0x40000024' (512B_PACKED_DOUBLE)], ['0x40000021', '0x40000022', '0x40000023', '0x40000024']\n// Merged: ['0x40000025', '0x40000026', '0x40000027', '0x40000028', '0x40000021', '0x40000022', '0x40000023', '0x40000024']\n\nclass SuperSectionVectorizationAnalysis {\n    constructor(section, nodeid, stateid, critical_path_analysis) {\n        this.section = section;\n        this.critical_path_analysis = critical_path_analysis;\n        this.for_node = nodeid;\n        this.for_state = stateid;\n        this.analysis_result = null;\n\n        if(!(stateid == 0xFFFF || stateid == 65535))\n            ObjectHelper.assert(\"for_node defined\", this.for_node != undefined && new Number(this.for_node) != NaN);\n    }\n\n    judgement(analysis = null) {\n        if (analysis == null) analysis = this.analysis_result.data;\n\n        return SuperSectionVectorizationAnalysis.sjudgement(analysis);\n    }\n\n    static sjudgement(analysis) {\n\n        // What's a good definition for vectorized operation?\n        // Let's just take that the amount of vector instructions must exceed the amount of scalar operations.\n        // Rationale: Even vectorized segments might have some scalar elements, and one vector instruction does not imply complete and good vectorization.\n        // With # vec ops > # scalar ops, we get an approximation that works everywhere except in very large and diverse sections and very small sections.\n\n        let sp_vec_op_count = MathHelper.sum(analysis.sp_ops_128b) + MathHelper.sum(analysis.sp_ops_256b) + MathHelper.sum(analysis.sp_ops_512b);\n        let dp_vec_op_count = MathHelper.sum(analysis.dp_ops_128b) + MathHelper.sum(analysis.dp_ops_256b) + MathHelper.sum(analysis.dp_ops_512b);\n\n        let sp_scalar_op_count = MathHelper.sum(analysis.sp_ops_scalar);\n        let dp_scalar_op_count = MathHelper.sum(analysis.dp_ops_scalar);\n\n        if(sp_scalar_op_count + dp_scalar_op_count < sp_vec_op_count + dp_vec_op_count)\n            return 1;\n        else\n            return -1;\n    }\n\n    analyze() {\n        let section = this.section;\n\n        ObjectHelper.assert(\"section is SuperSection\", section instanceof SuperSection);\n\n        section = section.toSection(this.for_node, this.for_state);\n        if(section == undefined) {\n            return null;\n        }\n        if(section['_entries'] == undefined) {\n            return null;\n        }\n\n        let b_print_analysis = false;   // Set to true to debug.\n\n        let data = {};\n\n        let max_thread_num = Number(section.get_max_thread_num());\n        let min_thread_num = Number(section.get_min_thread_num());\n\n        if(max_thread_num == undefined || min_thread_num == undefined) {\n            // We got one of those cases where we have an empty section - usually due to empty tasklets or empty states\n            return undefined;\n        }\n        if (b_print_analysis)\n            console.log(\"max_thread_num: \" + max_thread_num);\n        \n        let sp_ops = [];\n        let dp_ops = [];\n\n\n        let sp_flops = [];\n        let dp_flops = [];\n        let sp_ops_scalar_single = [];\n        let sp_ops_128b_single = [];\n        let sp_ops_256b_single = [];\n        let sp_ops_512b_single = [];\n\n        let sp_ops_scalar_double = [];\n        let sp_ops_128b_double = [];\n        let sp_ops_256b_double = [];\n        let sp_ops_512b_double = [];\n\n        let tot_cycles = [];\n\n        for (let t = min_thread_num; t < max_thread_num + 1; t++) {\n            let ts = section.select_thread(t);\n            let tc = ts.select_event('-2147483589'); // PAPI_TOT_CYC\n            tot_cycles.push(MathHelper.sum(tc));\n            let t_sp = ts.select_event('-2147483545', true); // PAPI_SP_OPS\n            let tmp_single = ts.select_event('1073741861'); sp_ops_scalar_single.push(MathHelper.sum(tmp_single));\n            tmp_single = ts.select_event('1073741862'); sp_ops_128b_single.push(MathHelper.sum(tmp_single));\n            tmp_single = ts.select_event('1073741863'); sp_ops_256b_single.push(MathHelper.sum(tmp_single));\n            tmp_single = ts.select_event('1073741864'); sp_ops_512b_single.push(MathHelper.sum(tmp_single));\n\n            let t_sp_sum = MathHelper.sum(t_sp);\n            sp_ops.push(t_sp_sum);\n\n            // =====================================\n\n            let t_dp = ts.select_event('-2147483544', true); // PAPI_DP_OPS\n            let tmp_double = ts.select_event('1073741857'); sp_ops_scalar_double.push(MathHelper.sum(tmp_double));\n            tmp_double = ts.select_event('1073741858'); sp_ops_128b_double.push(MathHelper.sum(tmp_double));\n            tmp_double = ts.select_event('1073741859'); sp_ops_256b_double.push(MathHelper.sum(tmp_double));\n            tmp_double = ts.select_event('1073741860'); sp_ops_512b_double.push(MathHelper.sum(tmp_double));\n            let t_dp_sum = MathHelper.sum(t_dp);\n            dp_ops.push(t_dp_sum);\n        }\n\n        if(sp_ops.length == 0)\n            sp_ops = MathHelper.sum(sp_ops_scalar_single) + MathHelper.sum(sp_ops_128b_single) + MathHelper.sum(sp_ops_256b_single) + MathHelper.sum(sp_ops_512b_single);\n        if(dp_ops.length == 0) \n            dp_ops = MathHelper.sum(sp_ops_scalar_double) + MathHelper.sum(sp_ops_128b_double) + MathHelper.sum(sp_ops_256b_double) + MathHelper.sum(sp_ops_512b_double);\n\n        ObjectHelper.logObject(\"sp_ops\", sp_ops);\n        ObjectHelper.logObject(\"dp_ops\", dp_ops);\n\n        // This is in _FL_oating point _OP_eration_S_. Nothing with time.\n        //sp_flops = MathHelper.sum(sp_ops_scalar_single) * 1 + MathHelper.sum(sp_ops_128b_single) * 4 + MathHelper.sum(sp_ops_256b_single) * 8 + MathHelper.sum(sp_ops_512b_single) * 16;\n        //dp_flops = MathHelper.sum(sp_ops_scalar_double) * 1 + MathHelper.sum(sp_ops_128b_double) * 2 + MathHelper.sum(sp_ops_256b_double) * 4 + MathHelper.sum(sp_ops_512b_double) * 8;\n\n        let flop_each_thread = x => {\n            // We have in x: [[scalar_t1, scalar_t2, ...], [packed1_t1, packed1_t2, ...], ...]\n            // We want to add these inner arrays together.\n            let zipped = MathHelper.zip2d(x);\n            // Now we can map each element of zipped to its sum to get flop per thread\n            let summed = zipped.map(x => MathHelper.sum(x));\n            return summed;\n        };\n        sp_flops = flop_each_thread([sp_ops_scalar_single.map(x => x * 1), sp_ops_128b_single.map(x => x * 4), sp_ops_256b_single.map(x => x * 8), sp_ops_512b_single.map(x => x * 16)]);\n        dp_flops = flop_each_thread([sp_ops_scalar_double.map(x => x * 1), sp_ops_128b_double.map(x => x * 2), sp_ops_256b_double.map(x => x * 4), sp_ops_512b_double.map(x => x * 8)]);\n\n        ObjectHelper.logObject(\"sp_flops\", sp_flops);\n        ObjectHelper.logObject(\"dp_flops\", dp_flops);\n\n        data.sp_flops = sp_flops; // Number of floating point operations\n        data.dp_flops = dp_flops;\n\n        ObjectHelper.logObject(\"tot_cycles\", tot_cycles);\n\n        data.sp_flops_per_cycle = MathHelper.zip(data.sp_flops, tot_cycles).map(x => x[0] / x[1]); // FLOPC (Flops per Cycle)\n        data.dp_flops_per_cycle = MathHelper.zip(data.dp_flops, tot_cycles).map(x => x[0] / x[1]);\n\n        // Get the median of all critical paths for the maximum amount of threads\n        let crit_path = MathHelper.median(max_func_obj(this.critical_path_analysis.data.critical_paths, x => x.thread_num, x => x.value));\n        data.sp_flops_per_cycle_parallel = MathHelper.sum(data.sp_flops) / crit_path; // FLOPC (Flops per Cycle) added over all threads\n        data.dp_flops_per_cycle_parallel = MathHelper.sum(data.dp_flops) / crit_path;\n\n        data.sp_ops = sp_ops; // Number of instructions\n        data.dp_ops = dp_ops;\n\n        data.sp_ops_scalar = sp_ops_scalar_single;\n        data.sp_ops_128b = sp_ops_128b_single;\n        data.sp_ops_256b = sp_ops_256b_single;\n        data.sp_ops_512b = sp_ops_512b_single;\n\n        data.dp_ops_scalar = sp_ops_scalar_double;\n        data.dp_ops_128b = sp_ops_128b_double;\n        data.dp_ops_256b = sp_ops_256b_double;\n        data.dp_ops_512b = sp_ops_512b_double;\n\n        ObjectHelper.logObject(\"data\", data);\n\n        if(sp_ops.length == 0) {\n            return undefined;\n        }\n        \n        let ret = new DataBlock(data, \"vectorized\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nclass LazySuperSectionVectorizationAnalysis extends SuperSectionVectorizationAnalysis {\n\n    constructor(communicator, section, nodeid, stateid, critical_path_analysis) {\n        super(section, nodeid, stateid, critical_path_analysis, null);\n        this.communicator = communicator;\n    }\n\n    async analyze() {\n        // We differ from the eager analysis here: We let the python/sql-side do the hard work\n\n        let section = this.section.toSection(this.for_node, this.for_state);\n        section = await section;\n        if(section === undefined) {\n            return undefined;\n        }\n        let tmp = await this.communicator.runAnalysis(\"VectorizationAnalysis\", [new Number(section.unified_id), new Number(section.supersection_id)]).get();\n\n        let data = tmp;\n\n        let ret = new DataBlock(data, \"vectorization\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nfunction AutoSuperSectionVectorizationAnalysis(communicator, section, nodeid, stateid, critical_path_analysis) {\n    if(section instanceof LazySuperSection) {\n        return new LazySuperSectionVectorizationAnalysis(communicator, section, nodeid, stateid);\n    }\n    else {\n        return new SuperSectionVectorizationAnalysis(section, nodeid, stateid, critical_path_analysis);\n    }\n}\n\n\nexport { VectorizationButton, AutoSuperSectionVectorizationAnalysis, SuperSectionVectorizationAnalysis};"],"sourceRoot":""}
\ No newline at end of file
diff --git a/dist/689.js b/dist/689.js
deleted file mode 100755
index 243b065a..00000000
--- a/dist/689.js
+++ /dev/null
@@ -1,2 +0,0 @@
-(self.webpackChunk_spcl_sdfv=self.webpackChunk_spcl_sdfv||[]).push([[689],{689:(A,o,t)=>{"use strict";t.r(o),t.d(o,{CacheOpButton:()=>c,AutoSuperSectionCacheOpAnalysis:()=>M});var a=t(2137),e=t(5991),i=t(7329),g=t(6610),s=t(379),B=t(6070),n=t(7608),r=t(7757),Q=t.n(r),C=t(4286),Y=t(1318);function h(A){var o=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(A){return!1}}();return function(){var t,a=(0,n.Z)(A);if(o){var e=(0,n.Z)(this).constructor;t=Reflect.construct(a,arguments,e)}else t=a.apply(this,arguments);return(0,B.Z)(this,t)}}var c=function(A){(0,s.Z)(t,A);var o=h(t);function t(A,a,e){var s;(0,g.Z)(this,t),(s=o.call(this,A)).supersection_all_vec_analyses=a;var B="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAAAXNSR0IArs4c6QAAAARnQU1BAACxjwv8YQUAAADwUExURQAm/wQp/wgs/wsv/www/xAz/xQ3/xc5/xg6/xw9/yBB/yRE/yhI/yxL/zBO/zRS/zhV/zxZ/0Bc/0Rf/0hj/0xm/1Bq/1Rt/1hw/1x0/2B3/2R7/2h+/2yB/26C/3CF/3SI/3iM/3yP/32Q/3+S/4CS/4OV/4eY/4uc/4+f/5Oj/5Sk/5em/5up/5+t/6Ow/6e0/6i1/6u3/625/6+6/7O+/7S+/7fB/7fC/7vF/7/I/8PL/8fP/8vS/83U/8/W/9PZ/9fc/9ne/9vg/97i/+Ln/+To/+bq/+rs/+zu/+/x//L0//b4//r6//z8//7+/+ZC6M8AAAAJcEhZcwAADsMAAA7DAcdvqGQAAAAYdEVYdFNvZnR3YXJlAHBhaW50Lm5ldCA0LjEuNWRHWFIAACuASURBVBgZ7cELQyLLuh7gtzuNaRFviKCMBp3DOEIUjcEYwQlyxEDo7v3+/3+T2Wedvfe6DDP2paqrqr/nAYUQG4FCiI1AIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AUYb1Yvo0uu53/+6o+V2j/l2A74L6d43md0fdv+tfj56mizVFGUChy/LleTTofzpp7m4jg+1Gs9PtX4+eXpYUuoBCtfXs4fr8eNdHYfxG6/z64duaQjVQqBK9Pg4v2ns1KFPba/eGj68RhSqgKF48G120tqBN2LoYzWKK4oGiUIvHr51dD2XY7XwdLygKBYqCrF+G5wc1lCw4OBtO1xQFAUUBZsOTHRhk+2TwLaHIDxT5RE/9owAGCpqfH9cU+YAiu8Xd+R6Mtns2eqPIDhSZJC+DTggrbLWvX2KKTECR3uLmOIBV/NbwjSI9UKQTP180YKWd86eYIh1QpLC4OQ5gMb91s6BIARQfFD9fNOCAxsVzTPFBoPiI95vjAM4Ijm/eKT4CFL/0PjiEcw4H7xS/BIqfW90ewVGHwxXFz4HiJ1a3Rx4c5h3drih+AhSbrG+PPDjPO7pdUWwCih+K7to+KsI7ul1R/BAofuCp46NSvOPHhOKvQPFn7/1tVFB4uaD4M1D8QTI+9lBVrfuY4g9A8TuLyxCVtnUxp/gdUPxDfN+EwOEopvgHUPzm9WIL4j/UzmcUvwHFd8ndAcTv7N/GFN+BguvrbYg/Ca/WFAQr771Xg/gB//yNlQdW3OzEg9jAa7+w4sBKe2xC/NTBOGGVgdUV3zYgfmlnGLO6wKpaXYUQH1L7vGRVgdW07PkQH+Z/emM1gVW07PkQqXjdJasIrJ5lz4dIze8tWT1g1az7AUQmfm/FqgGrZd2vQWRW669ZLWCVxFc1iFxq/TWrBKyOeBBC5BYOYlYHWBXxIIQoRDiIWRVgRdxtQxRm+44VAVbCtwOIQh28sBLAClh2IQrXXbICQOfFXwMIBYKrmM4DXfewA6FI/Z6uA932egSh0OGMbgNdtjrzIJTyPi3pMtBdybAGoVzta0x3gc56akBosTOms0BHrboQ2nSWdBTopvstCI1qI7oJdNHiGEKz5oIuAt2TDAMI7fzrhO4BnfN6AFGK/RmdAzom7nsQJfEuYzoGdMu0AVGixoRuAV2yPoco2dmaLgEdMt6GKN32Ix0COiP6BGGETxGdAbri2w6EIXa+0RWgG5KvHoQxvKuEbgCd8N6EMMrhgk4AXfBQgzBM7Z4uAO0XfYIw0Mma9gOt91KHMFJ9SuuBlkuuPAhDeZcJLQfabXEIYbD9N9oNtNp9DcJowYhWAy2WXEAY71NCi4H2WjYhLLD/TnuB1noJIawQPtNaoK2GHoQlvGvaCrRTdAphkU5EO4FWetuDsMrunFYCbfRYg7BM8EgbgfZJ+hAW+pzQPqB1Vi0IK7VWtA5om1kdwlL1GW0DWmYcQFgrGNMyoF0GHoTFvAHtAtokOYew3HlCm4AWidoQ1mtHtAhoj+U+hAP2l7QHaI15HcIJ9TmtAdpiEkA4IpjQFqAlRh6EM7wRLQHaoQ/hlD7tANogOYVwzGlCG4AWWDchnNOMaAHQfMsGhIMaS5oPNN6yAeGkxpLGA0333oBwVGNO04GGm4cQzgrnNBxotnkI4bBwTrOBRpuFEE6rTWk00GTTAMJxwZQmAw02DSCcFzzTYKC5ngKICvAeaC7QWA8e3BY2mp1ufzB6nnw3X3wX8bto8d188t3zaNDvdpqNEG7zHmgs0FQPHpy0td+5GD5OFiumsFpMxoNee68GJ3lDmgo01L0HtwT7nYvh42vEXNaz8aDX3gvgmAENBZrpwYM7djtX4wULtRhfdXbhkCHNBBrpwYMTtlq90SymIvFs1GttwQneA40EmujJg/W8g954SQ2W496BB+t5DzQRaKBpALvVWleTiBpFk6tWDXbznmgg0DzTABarn97MWIrZzWkdFgumNA9onFkAW/lH13OWan595MNWwZTGAU0zD2Gn+tljRANEj2c7sFNtTtOAhpmHsJB/dD2nQd6GLR8WCuc0DGiW9xDWCU7HEY0Tj08DWCec0yygUZYNWMbvjGMaKh6fBrBMY0mjgCZZNmAVv30X0Wjx+NSHVRpLmgQ0yLoBi/jtu4gWiO7aPizSiGgQ0BxJE/bYv4lojWh0AHs0E5oDNMcpbFE7n9Eyr70t2OKU5gCN0YclmvcxLRTfH8ESfRoDNMUIVggv32itxWUIK4xoCtAQEw8WOH5MaLXk8RgW8CY0BGiGeQDj+Z9e6YD5Jx/GC+Y0A2iEZR2mq31e0hHL/hZMV1/SCKAJon0YbmcQ0yHxzQ4Mtx/RBKABkjbMdjBO6JpxE2ZrJzQAaIBzGK09pZO+tWG0cxoALN8AJmvN6KxZGyYbsHxg6cYezNWc0GmzJszljVk6sGyzAMZqTui8SRPGCmYsG1iyVR2m2huzEp73YKr6iiUDy5W0YKi9MStjvAdDtRKWCyxXH2YK71gpoxBm+sxygaV6hJH8zxErJvrsw0hjlgos01sNJjpZsIIWJzBRMGeZwBJFezDQ3pQVNd2HgXYjlggs0SnME94mrK5RCPN0WCKwPEMYx79cs9Kizz6M879ZHrA0Lx5M03xj5S2OYZr/wfKAZVmGMEztluK7+y2YZc3ygCVJmjBM553iP6y6MMkeSwSW5AJm2R5T/NNTHebosURgOe5hlrM1xe9EPQ+mGLNEYCkWNZikMaH4k5ddGGLNEoFlSA5hEO8ipviLpO/BBPssE1iGKxikPqX4oVkDBrhkmcASvHgwx8maYoPoDOV7YplA/aI6jBHcUfzEeAsl8yKWCdTvE4xxsKD4qfcjlOuApQK1e4ApvM8Jxa9ceyjTJUsF6vZegyHqU4oPmDVQomeWCtQsacIQp2uKD4nOUBo/ZqlAzb7CDN6Q4sNGAUrSZLlAvb55MML2C0UKszrK8YXlArWKdmCE5pIilXULpZiwXKBWn2CEi4Qirb4H/fyY5QJ1GsMEwQNFBk81aNdkyUCN1tswQGNOkcliD7p9ZclAjc5hgE5EkVHchWYvLBmozxQG6FPkcO1BpyBhyUBt4gZK591R5PIQQKMWywZq00fpgglFTi8h9PnKsoG6vHooW31OkdtbA9q8sGygJskByra/pCjA6hCa1Fg6UJMhynYcURQiOYEebZYO1GMRoGTnCUVRLqHFgKUD9ThGubxrigLdetBgxtKBWtyjXN4DRaEePChXY/lAHVZbKJX3QFGwpwCqdVg+UIcuShU8UBRuGkCxG5YP1OAJpQqmFApMA6g1Z/lA9ZIGyhRMKZR4DaFSSAOA6g1RpvCFQpF5CIVOaABQuVUNJQrnFMrMt6HODQ0AKneGEoVzCoWWDSjzRgOAqr16+ICgefHlu7P9AEUK5xRKLRtQpE4TgKod4ZcOr2cJ/+HbxRaKEs4pFFuGUKNLE4CKPeAXDgfv/KNkvI9ChHMK5eYhlBjRBKBa8Q5+5nDwzh9IhjXkF7xQaDAPocKCJgDV+orNDgfv3GR5jLyCKYUW0wDFq9MIoFLLABscDt75M0kH+QRTCk2mAQr3iUYAlerihw4H7/yVv3WQh/dAoc2zh6Ld0wigSt/wA4eDd37E306QnfdAodGDh4It+UELqgSqdIA/Oxy886OSBrLyHii0ekCxGvyoDlUCFbrDHx0O3plGFCKjawrNrlGoM37QAndUCFQn3sbvHA7emda7j0zOKbQ7R5Hu+UEjbMdUB1RngH86HLwzi6/I4jih0C45RoFW/KAuMKA6oDJxiN8cDt6Z0d/2kN5+RFGCaB+F2eNHbQNhTGVAZQb4u8PBO3N48ZBWfUlRimUdRenxg+b4bkBlQFXiEDgcvDOnLlIK5hQlmQcoyJgfdIPvwpiqgKpcHQ7emd+bh1S8CUVpJh6KseYHneDvrqgKqEj8f1mMT0jljqJEdyjEHj8qxN/V1lQENN3SRwp9ilL1UYRLftAcv+lTEdB4PXxch6JkHRTgiR80xG9qa6oBGm/p46MaEUXJol3k5kX8oDb+U59qgObr4YOCOUXp3gLkdcCPquE/BUsqAZpv6eNjHigM8Ii8LvlBM/xTj0qAFviCD7mgMML/7J42m81Gvb6FbJ74QQP8k7+kCqAF1jV8QDOhMM9isfg2mTyNRqOrL1963e5ps9ncrddDbObH/KA2/qVHFUAbfMGvbS8p7PK+WMwmk+fRaPT1y5eLbrfbbDZ36/WwyQ9KAvyLv6QCoA3WNfyK90JRNS/4vR4VAK3wBb8ypKicr/g9f8XigVZYb+HnTimqp4U/uGLxQDsM8FP1NUXlJAH+IIxZONAOcYif8KYU1fOCP7ll4UBLDPATnykq6Av+pMHCgZaIQ2x0kFBUUBN/9siigbYYYJNgQVFBsY8/a7JooC2SHWxwR1FFE/zVjAUDrTHCj51QVNIX/NUJCwZaI9nBj9TXFJXUxF957ywWaI8RfsCbUlRS5OEHeiwWaI9kB391QVFNT/iR2pqFAi1yj79oxBTVdIkfumahQJvs4c8mFBV1gB/aTlgk0CZj/MkZRUVFHn7sjkUCrbKHP9heU1TUEzY4YJFAq4zxB2OKquphk1cWCLTLPn6nQ1FZe9jkggUCyxb9L6Ywwb/U3imqao2NtmIWByxVdNf2MWYKTfzTLUVl3WGzexYHLE901/bx3R5TmOAfmhTVdYTNmiwOWJLoru3jP42ZQhO/8d8oKivx8BMLFgYsQ3TX9vEvuwk/boLfXFJU17/jZy5ZGFC76K7t449GTOEYfxeuKarrv+NnwoRFAfWK7to+/mIn4cfN8He3FBV2ip8asyigRtFd28cPjZhCG8BeQlFdcYCfOmZRQF2iu7aPTXYSftwMwJSiwsb4Oe+dBQG1iO7aPn5mxBTaOKGoslP8Qp8FAdWL7to+fiGM+XGz/7KgqLA3H7+wzYKAikV3bR8fMGAK/5Oiylr4pScWA1Qpumv7+Jgw5sf9jaLCxvi1DosBKhPdtX183IBCfMRyG7/mRywEqEZ01/aRShhTiF+LdvERdywEqEB01/aR2hWF+KWkiQ9psxBg0aK7to8samsK8QvrFj7GX7MIYKGiu7aPrL5QiJ+b1fFRtywCWJzoru0jh9qaQvxEfO3jw45YBLAgi7u2j5y+ULhtORpPJtPFYhEzvXgQIgVvxQKABfj363aIAtRWFG5r4p+Cer3ebDY73e6nL1++3IxGD5PJZLFYRPyR+Ok8RDq3LABYgCMUpEfhtgk+wq/X64fNZrvb/fTl7867LR+pHbEAYH4rDwXxlxRua0Ebb8X8wPxuUZgehdtm0OeW+YH5HaEw/pLCbW1oc8T8wNzeUaAehdum0OeduYG5DVAg/43CbQfQZsDcwNwOUaQuhdvG0OaQuYF5vaNQ3huF05IdaPPOvMC8blCsLoXbBtDmhnmBeR2jWN4bhdPiGnQ5Zl5gTnGAgp1SuO0zdAli5gTm9IzCzSictvShyzNzAnO6QOHaFG77BF0umBOYUwPFm1E47RW6NJgTmM8CCrQp3HYMXRbMB8znBirMKJz2CF1umA+YzzFUaFI4LQmhyTHzAXOJAygxoXDaJTQJYuYC5vIMNZoUTnuDLs/MBczlAopMKJzWhCYXzAXMpQFFmhROu4cmDeYC5rGAMk8ULotr0GTBPMA8bqDMHoXTzqHJDfMA8ziGOmMKl82gyTHzAHNIAqizR+G0fegRJMwBzOEFKo0pXHYDTV6YA5jDACrtJRQOW/vQY8AcwBw6UGpE4bI29OgwBzCHEErtJBQOu4MeIXMAs1tAsRGFwyIfeiyYHZjdHRTbSSgc1oYed8wOzO4cqo0oHHYHPc6ZHZjdHlSrxxTuinxoscfswMwiqDegcFgbekTMDMzsCeqFMYW7xtDjiZmBmfWhwYDCXXEALfrMDMzsCBqEMYW7TqHFETMDMwugwzWFu8bQImBmYFYzaPFfKdwV+dBixqzArIbQ4ojCYUfQYsiswKxOoMU1hcOuocUJswKz2oEWcwqHzaHFDrMCM1pDizqF0+rQYs2MwIxeoMUZhdPOoMULMwIzGkKLRwqnPUKLITMCMzqHDn5E4bTIhw7nzAjM6AA6HFE47gg6HDAjMKMadLimcNw1dKgxIzCbBbSYUzhuDi0WzAbM5hE61CmcV4cOj8wGzOYrdDilcN4pdPjKbMBsOtDhhsJ5N9Chw2zAbHahw4zCeTPosMtswExiDxrUKCqgBg28mJmAmcygQ4uiAlrQYcZMwExG0OGKogKuoMOImYCZXECHCUUFTKDDBTMBM2lBAy+iqIDIgwYtZgJmsgUNDigq4QAahMwEzCKCDj2KSuhBh4hZgFm8QocxRSWMocMrswCzeIQOS4pKWEKHR2YBZjGEBlsUFbEFDYbMAsziAhq0KCqiBQ0umAWYRRsa9CgqogcN2swCzGIPGowoKmIEDfaYBZhFDRrMKCpiBg1qzALMYA0dYoqKiKHDmhmAGcygwS5FZexCgxkzADN4gAYdisroQIMHZgBmcA0Nrigq4woaXDMDMINzaDCmqIwxNDhnBmAGx9BgQVEZC2hwzAzADHahXkBRIQHU22UGYAY+1NunqJA9qOczAzC9JTToUFRIGxosmR6Y3gs0uKCokB40eGF6YHrP0GBIUSEDaPDM9MD0RtDgkaJCxtBgxPTA9AbQ4JWiQmbQYMD0wPT60CCiqJA1NOgzPTC9T1Bvi6JSalDvE9MD0zuBevsUlbIH9U6YHpheE+p1KCqlDfWaTA9MbxfqXVBUSg/q7TI9ML1tqDekqJQB1NtmemB60OCRolLG0IDpgamtocGEolIm0GDN1MDUFtBgQVEpC2iwYGpgalNosKKolBU0mDI1MLUnaEBRMdDgiamBqY2gXkhRMSHUGzE1MLVrqNegqJgG1LtmamBqfajXpKiYJtTrMzUwtS7U61BUTAfqdZkamFoX6nUpKqYL9bpMDUytC/X6FBXTh3pdpgam1oV6A4qKGUC9LlMDU+tCvRFFxYygXpepgakdQb1niop5hnpHTA1MrQn1JhQVM4F6TaYGptaEehOKiplAvSZTA1NrQr0JRcVMoF6TqYGpNaHehKJiJlCvydTA1BpQb05RMXOo12BqYGp1qLegqJgF1KszNTC1OtRbUFTMAurVmRqYWh3qLSgqZgH16kwNTK0O9RYUFbOAenWmBqYWQL2IomIiqBcwNTA1aEBROdCAqYGpQQOKyoEGTA1MDRpQVA40YGpgatCAonKgAVMDUwugXkRRMRHUC5gamFod6i0oKmYB9epMDUytDvUWFBWzgHp1pgamVod6C4qKWUC9OlMDU6tDvQVFxSygXp2pgak1oN6comLmUK/B1MDUmlBvQlExE6jXZGpgak2oN6GomAnUazI1MLUm1JtQVMwE6jWZGphaE+pNKCpmAvWaTA1M7QjqPVNUzDPUO2JqYGpdqDeiqJgR1OsyNTC1LtQbUFTMAOp1mRqYWhfq9Skqpg/1ukwNTK0L9boUFdOFel2mBqbWhXodiorpQL0uUwNT60O9JkXFNKFen6mBqV1DvQZFxTSg3jVTA1MbQb2QomJCqDdiamBqT9CAomKgwRNTA1ObQoMVRaWsoMGUqYGpLaDBgqJSFtBgwdTA1NbQYEJRKRNosGZqYHrQ4JGiUsbQgOmB6W1DvSFFpQyg3jbTA9NrQL0LikrpQb0G0wPTa0K9DkWltKFek+mB6XWg3j5FpexBvQ7TA9PrQr0tikqpQb0u0wPT60ODiKJC1tCgz/TA9K6hwStFhcygwTXTA9MbQYNHigoZQ4MR0wPTe4IGQ4oKGUCDJ6YHpjeFBhcUFdKDBi9MD0xvCQ06FBXShgZLpgdm4EO9fYoK2YN6PjMAM2hAvYCiQgKo12AGYAYtaLCgqIwFNGgxAzCDc2gwpqiMMTQ4ZwZgBtfQ4IqiMq6gwTUzADN4gAYdisroQIMHZgBm8A0a7FJUxi40+MYMwAxW0CGmqIgYOqyZAZhFDRrMKCpiBg1qzALMYg8ajCgqYgQN9pgFmEUbGvQoKqIHDdrMAsyiBw1aFBXRggY9ZgFmMYQGWxQVsQUNhswCzOIROiwpKmEJHR6ZBZjFK3QYU1TCGDq8Mgswiwg69CgqoQcdImYBZrIFDQ4oKuEAGoTMBMykBQ28iKICIg8atJgJmMkFdJhQVMAEOlwwEzCTEXS4oqiAK+gwYiZgJjPo0KKogBZ0mDETMJMYOtQoKqAGHWJmAmazCx1mFM6bQYddZgNm04EONxTOu4EOHWYDZvMVOpxSOO8UOnxlNmA2Y+hQp3BeHTqMmQ2YzQJazCkcN4cWC2YDZhRAh2sKx11Dh4AZgRkdQIcjCscdQYcDZgRmdAYd/IjCaZEPHc6YEZjREFo8UjjtEVoMmRGY0RRanFM47QxaTJkRmNEaWuxQOG0HWqyZEZjVNrR4o3DYG7TYZlZgVifQYkjhsCG0OGFWYFYDaNGicFgLWgyYFZjVN2jhxxTOin1o8Y1ZgVklAbQYUzhrDC2ChFmBmTWhxSmFs06hRZOZgZl9hhZBTOGoOIAWn5kZmNkj9BhTOGoMPR6ZGZjZGnqcUjjqFHqsmRmY3S60CGIKJ8UBtNhldmB2Z9BjTOGkMfQ4Y3ZgdiPocUrhpFPoMWJ2YHZv0MOPKBwU+dDjjdmBOWxBjzsKB91Bjy3mAObQhh5tCge1oUebOYA5XEMPP6JwTuRDj2vmAObwAk1GFM4ZQZMX5gDmEPvQ44DCOQfQw4+ZA5hHC5q8UjjmFZq0mAeYxxCa9Cgc04MmQ+YB5vEGTbZiCqfEW9DkjXmAuexAk3sKp9xDkx3mAuZyDk2OKJxyBE3OmQuYyxN0WVA4ZAFdnpgLmEvsQ5NLCodcQhM/Zi5gPi1oEiYUzkhCaNJiPmA+N9DlkcIZj9DlhvmA+SygyzGFM46hy4L5gDk1oMucwhFz6NJgTmBOF9DlE4UjPkGXC+YE5vQMXfwlhROWPnR5Zk5gTnEAXfoUTuhDlyBmTmBex9BlK6ZwQLwFXY6ZF5jXDbS5oXDADbS5YV5gXu/QZofCATvQ5p15gbkdQpsxhfXG0OaQuYG5DaBNk8J6TWgzYG5gbu/Q5xuF5b5Bn3fmBuZ3CG3aFJZrQ5tD5gfmN4Q+MwqrzaDPkPmB+a08aNOmsFob2ngr5gcW4Aj6zCgsNoM+RywAWIBb6NOksFgT+tyyAGABVh70mVBYawJ9vBULABbhCPo0KazVhD5HLAJYhFto9ExhqWdodMsigEVYedBnj8JSe9DHW7EIYCGOoNGYwkpjaHTEQoCFuIVGexRW2oNGtywEWIiVB43uKCw0gkbeioUAi3EMjbZjCutEITQ6ZjHAYjxCpz6FdT5Dp0cWAyxGEkIj/53CMgsfGoUJiwEW5BI6nVJY5gQ6XbIgYEEW0OqFwipTaLVgQcCitKDTAYVV9qFTi0UBi3IPre4oLDKCVvcsCliUeAs6bccU1ohC6LQVsyhgYS6gVZ/CGp+h1QULAxZmDq38dwpLLHxoNWdhwOIcQqtjCkscQ6tDFgcszgh63VNY4R56jVgcsDhxDVptrSgssNqCVrWYxQELdA69uhQW6EKvcxYILNAMmj1RGO8Jms1YILBI+9CrHlEYLqpDr30WCSzSLTTrURiuB81uWSSwSHEIvbwXCqO9eNArjFkksFBX0Gw3oTBYsgvNrlgosFBrH5pdURisD838NQsFFuscmnkzCmPNPGh2zmKBxXrzoFkjojBU1IBm3huLBRasDd3OKAx1Dt3aLBhYsBdoN6Yw0iO0e2HBwKIdQLetdwoDrbag2wGLBhZtDO2OKAx0DO3GLBpYtGQH2l1TGGcI7XYSFg0s3BDaeTMKw8x9aDdk4cDCxTVo14gojJLsQbtazMKBxfsM/c4ojHIB/T6zeGDxlj70G1EYZAz9/CWLByrwCfoFMwpjzAPo94kKgAq8edCvvqYwRNSAft4bFQBV6KIELQpDdFCCLlUAVVj6KEGfwghfUQJ/SRVAJXoogfdEYYBnDyXoUQlQiaWPEtQWFKVbbKEE/pJKgGr0UIa9mKJk8T7K0KMaoBqrGsrQpShZF2WoragGqEgfpRhQlOoapehTEVCRdQ1l8B4oSvTgoQy1NRUBVemjFMELRWleApSiT1VAVdYhShG+UZTkLUQpwjVVAZUZoByNFUUpVg2UY0BlQGXiEOU4TChKkByiHGFMZUB1BijJCUUJTlCSAdUB1Ym3UZJLCu0uUZLtmOqACt2hLLcUmt2iLHdUCFTpACXxHii0evBQkgOqBKr0grJ4TxQaTTyU5YUqgUp1UZZgSqHNNEBZulQKVGoZoCzBlEKTlwBlCZZUClTrCqUJXim0mIcozRXVAtWK6yhNOKfQYB6iNPWYaoGK3aM84ZxCueU2ynNPxUDVDlGe7SWFYssGynNI1UDVZh7K01hSKLVsoDzejKqByn1CiRpLCoWWDZToE5UDlVvWUKJwTqHMsoES1ZZUDlTvK8oUzikUmW+jTF+pHqhevIMyhVMKJeYhyrQTUz1QgzFKFUwpFHgJUaoxNQB16KBUwTNF4aYBStWhDqAOyxpK5T1QFGwSoFS1d+oAajFCubwHikI9eCjXLbUA9WiiXN41RYFuPZSrST1APRY+SnaeUBTlEiXz59QD1OQaZTuOKAqRnKBsV9QE1CTZR9n2lxQFWB2ibHsJNQF1mXkoW31OkdtbA2XzXqgLqM0lShdMKHJ6CVG6HrUBtYkbKJ13R5HLQ4DS1SNqA+ozgQH6FDlceyjfI/UBNTqDAToRRUZxFwY4pUagRuttGGD3jSKTxT4MsLWiRqBOY5ggeKTI4HkLJhhRJ1CrTzDC54Qira8eTNChVqBW0Q6M0FpTpBJ1YITtNbUC9frmwQj1GUUK8wbM8Ey9QM2uYIZgRPFh4wBmuKBmoGbJIQxxFlN8SHIBQ+wl1AzUbVGDIRozig+Y78EQ/it1A7W7gym8a4pfGvowxZDagfqdwBjNd4qfWh3DGMfUD9RvXYcxag8UP/G4BWNsragfWIKpB3OcRhQbROcwyCNLAJbhEgapTyl+aNaAQc5ZBrAMyT4M4l3EFH+R9D0YpBGzDGAp3gKYpDGh+JOXXZjEm7EUYDluYZazNcXvRD0PRhmwHGBJPsEs22OKf3qqwywnLAlYkmQfhum8U/yHVReG2Y1YErAs7yEMU7ul+O5+C4apvbEsYGmePZim+cbKWxzDOE8sDVieaxjHv1yz0qLPPozTZ3nAEnVgnvA2YXWNQpjnmCUCSxTtwkB7U1bUdB8G2olYIrBM8wAmOlmwghYnMFHwyjKBpXqEkfzPESsm+uzDSA8sFViuzzBTeMdKGYUw0yXLBZYracFQe2NWxngPhjpKWC6wZKs6TLU3ZiU878FU9RVLBpZtFsBYzQmdN2nCWMGMZQNLN/ZgruaETps1YS5vzNKB5RvAZK0ZnTVrw2QDlg80wDmM1p7SSd/aMNo5DQAaIGnDbAfjhK4ZN2G2dkIDgCaI9mG4nUFMh8Q3OzDcfkQTgEZY1mG62uclHbHsb8F09SWNAJphHsB4/qdXOmD+yYfxgjnNABpi4sECx48JrZY8HsMC3oSGAE0xghXCyzdaa3EZwgojmgI0Rh+WaN7HtFB8fwRL9GkM0BynsEXtfEbLvPa2YItTmgM0R9KEPfZvIlojGh3AHs2E5gANsm7AIn77LqIForu2D4s0IhoENMmyAav47buIRovHpz6s0ljSJKBRlg1Yxu+MYxoqHp8GsEx9SaOAZpmHsE5wOo5onHh8GsA64ZxmAQ0zD2Eh/+h6ToO8DVs+LBTOaRjQNPMa7FQ/e4xogOjxbAd2Cr7RNKBxpgFs5R9dz1mq+fWRD1sFUxoHNM80gMXqpzczlmJ2c1qHxbwJzQMa6MmD3Wqtq0lEjaLJVasGu3kPNBBoogcP1vMOeuMlNViOewcerOc90ESgkR48OGGr1RvNYioSz0a91hbcMKSRQDMN4ZDdztX4/7FQi/FVZxcOGdBMoKEGcIk3YDHWs/Gg194L4JgBDQWaaujBGcGY+awWk/Gg196rwU0Dmgo01oMHR4TfmF38b40QbvOGNBZorgcPTmgsmN3yEK7zHmgu0GBPARzQjJjdfAeu8x5oMNBk0wDW6ybMblqD64IJTQYabVqD5a6Yw50H1wVTGg002zyEzbw75nAF54XfaDbQcPMQ9tqaMrukC+eFcxoONN28AVvtzJld1ITz6nOaDjTesgE7HS6Z3aIB5zWWNB5ovmUDNupEzO4lhPMaS5oPtMC6CftcModxAOc1I1oAtEFyCst4N8xh4MF5pwltANqhD6sET8wuOYf7+rQDaImRB3uEM2YXHcN53oiWAG0xCWCLvSWzW+7DecGEtgCtMa/DDq2I2b1uw3n1Oa0B2mO5DxucJczuOYDz9pe0B2iRqA3zXTOHWw/Oa0e0CGiT5ByGCx6Yw2e47zyhTUC7DDyYLJwyu/gEzvMGtAtomXEAczXemN3qEM4LxrQMaJtZHaY6XDO7eQPOq89oG9A6qxbMdJowu2kI5x2taB3QPslnmOgLc7j34bzLhPYBbTQOYBpvxBy+wnnBA20EWmm+C8PcM7vkE5y380orgXaKOjDKgNlFR3DecUQ7gbb66sEcX5nd+y6c16etQGs9b8EU+wkzm4VwXe2J1gLt9b4PM3jfmNljANftvtFeoMXiLozQY2ZDD647iWgx0Gq3AcrnrZhRcgHXeQNaDbTbfA+l6zCjqA3XNWa0G2i55AJle2Q2ywO47jym5UDrPW+jVLWEmczrcNzWI60H2m/VRplazGRSg+OOV7Qf6IKbAOXpMYuRB7f5Q7oAdMJ8D6W5YQZf4Li9VzoBdENy6aEkE6aWnMJxFwndALpiso1yTJjW+hBu236mK0BnrDsoxYQpvTXgts6azgAdMtpCCSZM5yWE07ZGdAjoktUp9LtjKg8BnHa6oktAtzzVods507iG0+qPdAvomOjCg157TOHf4DKvF9ExoHO+7UEr72/8uHkN7tp7oXNA9yTXPnRaMYVnD47yrxK6B3TR4gga/R+mcQM3Ned0Eeim0Ra0mTCVcziodks3gY5anUKXO6aStOCczjsdBTrrqQE9ekwnasAtO2M6C3RXMqxBh0OmtAjhkNrXmO4CXbY686BewLSmHlzhfVrSZaDbXo+g3oRpjeCIwxndBrruYQeqtZnaZ7igfk/Xgc6LvwZQy1swtTasF1zFdB5YAcsu1OoxtWgPlusuWQFgJXw7gErejKktQ9js4IWVAFbE3TYU2o2Z2rcA1tq+Y0WAVREPQqhzwfQeYKlwELMqwOqIByFU8R6Z3hVsFA5iVgdYJfFVDYoEM6Z3CuvU+mtWCVgt634NamwvmVp8CLvU+mtWC1g1634AJQ5ipraswyJ+b8WqAatn2fOhwgnTew1gC7+3ZPWAVbTs+VDgC9N78mAFr7tkFYHVtOz5KN490xvAAv6nN1YTWFWrqxBF81+Y3ieYrvZ5yaoCqyu+baBg4TtTS45gtJ1hzOoCK+2xiWLtRUxt3YC5DsYJqwysuNmJhyIdJ0xtvgUzee0XVhxYee+9Ggp0yfQmHgzkn7+x8kDB9fU2ijNiercwTni1piAovkvuDlAUb8L0LmCW/duY4jtQ/Ob1YgvF2HpjaskxzFE7n1H8BhT/EN83UYjGmqlFuzDE4Sim+AdQ/M7iMkQBjhKmtghhgK2LOcXvgOIPkvGxh9zOmN6Lj7K17mOKPwDFn733t5HXkOndoVTh5YLiz0DxA08dH7l4T0zvC0rjHT8mFH8Fih+K7to+cgjmTO8EpfCOblcUPwSKTda3Rx4yqy+ZWrQP7byj2xXFJqD4idXtkYeMDhOmttyGVt7R7YriJ0Dxc6vbI2TTZXqzAPocDlcUPweKX3ofHCKLK6Y39qDH4eCd4pdA8RHvN8cBUhszva9QLzi+eaf4CFB8UPx80UA6wTem14VajYvnmOKDQJHC4uY4QArhkqklh1DGb90sKFIARTrx80UDH7YfMbXVDpTYOX+KKdIBRXqLm+MAH9NhevMARfNbwzeK9ECRSfIy6IT4gM9M79lDgbba1y8xRSagyG5xd76HX7ljejcoyO7Z6I0iO1DkEz31jwL8hD9lemfILWh+flxT5AOKAsyGJzvYJFwwtaSFPLZPBt8SivxAUZD1y/D8oIYf2I2YWtRAJsHB2XC6pigIKAq1ePza2fXwR62Eqb1tIaXdztfxgqJQoChePBtdtLbwLz2mN/XwUWHrYjSLKYoHClWi18fhRXuvhu9umd4Iv1Lba/eGj68RhSqgUG09e7j+bzOmd4kN/Ebr/Prh25pCNVCYq43f2W40O93+9ejpZUmhCyjMFf9bt9vtX4+epos1RRlAIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AIcRGoBBio/8PfAVYSVK3V9sAAAAASUVORK5CYII=";s._display_image={1:B,"-1":B};var n={},r=Y.Vw.majority([1]);s.setButtonImage(s._display_image[r]),s.dataparams=[a,e];var Q=new C.Layout(s.button_subwindow);Q.setRect("Title",new C.Pos(0,0),new C.Pos(100,10),new C.RU_DataViewText);var h=new C.RU_DataViewBarGraph({type:"bar",yAxes:[{type:"linear",display:!0,position:"left",id:"axis-1"}]}).setDataAnalysisFunction((function(A){var o=[],t=[],e=[],g=[];null!=A&&(o=A.data.map((function(A){return A.data.cache_snoop})),t=A.data.map((function(A){return A.data.cache_shr2ex})),e=A.data.map((function(A){return A.data.cache_cln2ex})),g=A.data.map((function(A){return A.data.cache_intervention})));var s=C.RU_DataViewBarGraph.colorList().slice(0,o.length+1),B=[],n=a.repcount;if(all_analyses_global){var r=o.length/n;o=Y.tV.createChunks(o,r,Y.Vw.sumArray),t=Y.tV.createChunks(t,r,Y.Vw.sumArray),e=Y.tV.createChunks(e,r,Y.Vw.sumArray),g=Y.tV.createChunks(g,r,Y.Vw.sumArray)}return B.push({label:"Snoop",yAxisID:"axis-1",data:o[0],backgroundColor:s[0]}),B.push({label:"Shared to Exclusive",yAxisID:"axis-1",data:t[0],backgroundColor:s[1]}),B.push({label:"Clean to Exclusive",yAxisID:"axis-1",data:e[0],backgroundColor:s[2]}),B.push({label:"Intervention",yAxisID:"axis-1",data:g[0],backgroundColor:s[4]}),{labels:(0,i.Z)(Array(o[0].length).keys()),datasets:B}})).linkMouse(Q._layout_clickable).changeGraphOptions((function(A){A.options.title.text="Cache operations per thread",A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).scaleLabel={labelString:"Operations",display:!0},A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).ticks.beginAtZero=!0,A.options.scales.xAxes=[{scaleLabel:{labelString:"Thread",display:!0}}]}));return Q.setRect("Graph",new C.Pos(0,10),new C.Pos(70,50),h),n.Title=new C.DataBlock({fontsize:32,text:"Cache operations",color:"black",align:"center"},"Text"),n.Graph=a,Q.setDataBinding(n),s.button_subwindow.setLayout(Q),s.setOnEnterHover((function(A){s.color="#FF0000",s.button_subwindow_state="open"})),s.setOnLeaveHover((function(A){s.color="orange",s.is_locked_open||(s.button_subwindow_state="collapsed")})),s.setOnClick((function(A,o){s.is_locked_open=!s.is_locked_open})),s.setDefaultDblClick(),s}return t}(C.Button),m=function(){function A(o,t,a,e){(0,g.Z)(this,A),this.section=o,this.critical_path_analysis=e,this.for_node=t,this.for_state=a,this.analysis_result=null,65535!=a&&65535!=a&&Y.tV.assert("for_node defined",null!=this.for_node&&NaN!=new Number(this.for_node))}return(0,e.Z)(A,[{key:"judgement",value:function(){var A=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null;return null==A&&(A=this.analysis_result),-1}},{key:"analyze",value:function(){Y.tV.assert("Not available over old interface",!1)}}]),A}(),D=function(A){(0,s.Z)(i,A);var o,t=h(i);function i(A,o,a,e,s){var B;return(0,g.Z)(this,i),(B=t.call(this,o,a,e,s,null)).communicator=A,B}return(0,e.Z)(i,[{key:"analyze",value:(o=(0,a.Z)(Q().mark((function A(){var o,t,a,e;return Q().wrap((function(A){for(;;)switch(A.prev=A.next){case 0:return o=this.section.toSection(this.for_node,this.for_state),A.next=3,o;case 3:if(void 0!==(o=A.sent)){A.next=6;break}return A.abrupt("return",void 0);case 6:return A.next=8,this.communicator.runAnalysis("CacheOpAnalysis",[new Number(o.unified_id),new Number(o.supersection_id)]).get();case 8:return t=A.sent,a=t,e=new C.DataBlock(a,"CacheOp"),this.analysis_result=e,e.judgement=this.judgement(),A.abrupt("return",e);case 14:case"end":return A.stop()}}),A,this)}))),function(){return o.apply(this,arguments)})}]),i}(m);function M(A,o,t,a,e){return o instanceof LazySuperSection?new D(A,o,t,a):new m(o,t,a,e)}}}]);
-//# sourceMappingURL=689.js.map
\ No newline at end of file
diff --git a/dist/689.js.map b/dist/689.js.map
deleted file mode 100755
index c284035c..00000000
--- a/dist/689.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack://@spcl/sdfv/./renderer_dir/cache_button.js"],"names":["CacheOpButton","ctx","supersection_all_vec_analyses","path_analysis","baseimgstr","_display_image","databinding","majority","MathHelper","setButtonImage","dataparams","layout","Layout","button_subwindow","setRect","Pos","RU_DataViewText","thread_graph","RU_DataViewBarGraph","type","yAxes","display","position","id","setDataAnalysisFunction","x","cache_snoop","cache_shr2ex","cache_cln2ex","cache_intervention","data","map","colors","slice","length","datasets","repcount","all_analyses_global","chunksize","ObjectHelper","push","label","yAxisID","backgroundColor","labels","Array","keys","linkMouse","_layout_clickable","changeGraphOptions","options","title","text","scales","find","scaleLabel","labelString","ticks","beginAtZero","xAxes","DataBlock","fontsize","color","align","setDataBinding","setLayout","setOnEnterHover","p","button_subwindow_state","setOnLeaveHover","is_locked_open","setOnClick","mb","setDefaultDblClick","Button","SuperSectionCacheOpAnalysis","section","nodeid","stateid","critical_path_analysis","this","for_node","for_state","analysis_result","undefined","NaN","Number","analysis","LazySuperSectionCacheOpAnalysis","communicator","toSection","runAnalysis","unified_id","supersection_id","get","tmp","ret","judgement","AutoSuperSectionCacheOpAnalysis","LazySuperSection"],"mappings":"4tBAKMA,E,oCACF,WAAYC,EAAKC,EAA+BC,GAAe,uBAC3D,cAAMF,IAEDC,8BAAgCA,EAErC,IAAME,EAAa,yieACnB,EAAKC,eAAiB,CAClB,EAAKD,EACL,KAAMA,GAGV,IAAIE,EAAc,GAIdC,EAAWC,cADE,CAAC,IAElB,EAAKC,eAAe,EAAKJ,eAAeE,IAExC,EAAKG,WAAa,CAACR,EAA+BC,GAElD,IAAIQ,EAAS,IAAIC,SAAO,EAAKC,kBAC7BF,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,GAAI,IAAIA,MAAI,IAAK,IAAK,IAAIC,mBAG7D,IAAIC,EAAe,IAAIC,sBAAoB,CACvCC,KAAM,MACNC,MAAO,CAAC,CACJD,KAAM,SACNE,SAAS,EACTC,SAAU,OACVC,GAAI,aAGTC,yBAAwB,SAAAC,GAEvB,IAAIC,EAAc,GACdC,EAAe,GACfC,EAAe,GACfC,EAAqB,GAChB,MAALJ,IACAC,EAAcD,EAAEK,KAAKC,KAAI,SAAAN,GAAC,OAAIA,EAAEK,KAAKJ,eACrCC,EAAeF,EAAEK,KAAKC,KAAI,SAAAN,GAAC,OAAIA,EAAEK,KAAKH,gBACtCC,EAAeH,EAAEK,KAAKC,KAAI,SAAAN,GAAC,OAAIA,EAAEK,KAAKF,gBACtCC,EAAqBJ,EAAEK,KAAKC,KAAI,SAAAN,GAAC,OAAIA,EAAEK,KAAKD,uBAIhD,IAAIG,EAASd,kCAAgCe,MAAM,EAAGP,EAAYQ,OAAS,GAEvEC,EAAW,GAGXC,EAAWlC,EAA8BkC,SAC7C,GAAGC,oBAAqB,CAEpB,IAAIC,EAAYZ,EAAYQ,OAASE,EAErCV,EAAca,kBAA0Bb,EAAaY,EAAW9B,eAChEmB,EAAeY,kBAA0BZ,EAAcW,EAAW9B,eAClEoB,EAAeW,kBAA0BX,EAAcU,EAAW9B,eAClEqB,EAAqBU,kBAA0BV,EAAoBS,EAAW9B,eAelF,OAXA2B,EAASK,KAAK,CAAEC,MAAO,QAASC,QAAS,SAAUZ,KAAMJ,EAAY,GAAIiB,gBAAiBX,EAAO,KACjGG,EAASK,KAAK,CAAEC,MAAO,sBAAuBC,QAAS,SAAUZ,KAAMH,EAAa,GAAIgB,gBAAiBX,EAAO,KAChHG,EAASK,KAAK,CAAEC,MAAO,qBAAsBC,QAAS,SAAUZ,KAAMF,EAAa,GAAIe,gBAAiBX,EAAO,KAC/GG,EAASK,KAAK,CAAEC,MAAO,eAAgBC,QAAS,SAAUZ,KAAMD,EAAmB,GAAIc,gBAAiBX,EAAO,KAE/F,CACZY,QAAQ,OAAIC,MAAMnB,EAAY,GAAGQ,QAAQY,QACzC,SAAYX,MAKjBY,UAAUpC,EAAOqC,mBAAmBC,oBAAmB,SAAAxB,GACtDA,EAAEyB,QAAQC,MAAMC,KAAO,8BACvB3B,EAAEyB,QAAQG,OAAOjC,MAAMkC,MAAK,SAAA7B,GAAC,MAAY,UAARA,EAAEF,MAAgBgC,WAAa,CAAEC,YAAa,aAAcnC,SAAS,GACtGI,EAAEyB,QAAQG,OAAOjC,MAAMkC,MAAK,SAAA7B,GAAC,MAAY,UAARA,EAAEF,MAAgBkC,MAAMC,aAAc,EACvEjC,EAAEyB,QAAQG,OAAOM,MAAQ,CAAC,CAAEJ,WAAY,CAAEC,YAAa,SAAUnC,SAAS,QAhFnB,OAmF3DV,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,IAAK,IAAIA,MAAI,GAAI,IAAKE,GAIzDX,EAAW,MAAY,IAAIsD,YAAU,CAAEC,SAAU,GAAIT,KAAM,mBAAoBU,MAAO,QAASC,MAAO,UAAY,QAClHzD,EAAW,MAAYJ,EAEvBS,EAAOqD,eAAe1D,GACtB,EAAKO,iBAAiBoD,UAAUtD,GAEhC,EAAKuD,iBAAgB,SAAAC,GAAO,EAAKL,MAAQ,UAAW,EAAKM,uBAAyB,UAClF,EAAKC,iBAAgB,SAAAF,GAAO,EAAKL,MAAQ,SAAe,EAAKQ,iBAAgB,EAAKF,uBAAyB,gBAC3G,EAAKG,YAAW,SAACJ,EAAGK,GAAS,EAAKF,gBAAkB,EAAKA,kBAEzD,EAAKG,qBAjGsD,E,UADvCC,UAyGtBC,E,WACF,WAAYC,EAASC,EAAQC,EAASC,IAAwB,eAC1DC,KAAKJ,QAAUA,EACfI,KAAKD,uBAAyBA,EAC9BC,KAAKC,SAAWJ,EAChBG,KAAKE,UAAYJ,EACjBE,KAAKG,gBAAkB,KAEP,OAAXL,GAAgC,OAAXA,GACtBvC,YAAoB,mBAAqC6C,MAAjBJ,KAAKC,UAAsDI,KAA7B,IAAIC,OAAON,KAAKC,W,wCAG9F,WAA2B,IAAjBM,EAAiB,uDAAN,KAIjB,OAHgB,MAAZA,IAAkBA,EAAWP,KAAKG,kBAG9B,I,qBAGZ,WACI5C,YAAoB,oCAAoC,O,KAI1DiD,E,sCAEF,WAAYC,EAAcb,EAASC,EAAQC,EAASC,GAAwB,6BACxE,cAAMH,EAASC,EAAQC,EAASC,EAAwB,OACnDU,aAAeA,EAFoD,E,2DAK5E,iGAEQb,EAAUI,KAAKJ,QAAQc,UAAUV,KAAKC,SAAUD,KAAKE,WAF7D,SAGoBN,EAHpB,eAImBQ,KADfR,EAHJ,sDAKeQ,GALf,uBAOoBJ,KAAKS,aAAaE,YAAY,kBAAmB,CAAC,IAAIL,OAAOV,EAAQgB,YAAa,IAAIN,OAAOV,EAAQiB,mBAAmBC,MAP5I,cAOQC,EAPR,OASQjE,EAAOiE,EAEPC,EAAM,IAAIpC,YAAU9B,EAAM,WAC9BkD,KAAKG,gBAAkBa,EACvBA,EAAIC,UAAYjB,KAAKiB,YAbzB,kBAcWD,GAdX,iD,kDAP0CrB,GAyB9C,SAASuB,EAAgCT,EAAcb,EAASC,EAAQC,EAASC,GAC7E,OAAGH,aAAmBuB,iBACX,IAAIX,EAAgCC,EAAcb,EAASC,EAAQC,GAGnE,IAAIH,EAA4BC,EAASC,EAAQC,EAASC","file":"689.js","sourcesContent":["// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport { Button, Layout, Pos, RU_DataViewText, RU_DataViewFormLayout, RU_DataViewNumberBlock, RU_DataViewBarGraph, DataBlock } from \"./renderer_util.js\";\nimport { MathHelper, ObjectHelper } from \"./datahelper.js\";\n\n\nclass CacheOpButton extends Button {\n    constructor(ctx, supersection_all_vec_analyses, path_analysis) {\n        super(ctx);\n\n        this.supersection_all_vec_analyses = supersection_all_vec_analyses;\n\n        const baseimgstr = \"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAAAXNSR0IArs4c6QAAAARnQU1BAACxjwv8YQUAAADwUExURQAm/wQp/wgs/wsv/www/xAz/xQ3/xc5/xg6/xw9/yBB/yRE/yhI/yxL/zBO/zRS/zhV/zxZ/0Bc/0Rf/0hj/0xm/1Bq/1Rt/1hw/1x0/2B3/2R7/2h+/2yB/26C/3CF/3SI/3iM/3yP/32Q/3+S/4CS/4OV/4eY/4uc/4+f/5Oj/5Sk/5em/5up/5+t/6Ow/6e0/6i1/6u3/625/6+6/7O+/7S+/7fB/7fC/7vF/7/I/8PL/8fP/8vS/83U/8/W/9PZ/9fc/9ne/9vg/97i/+Ln/+To/+bq/+rs/+zu/+/x//L0//b4//r6//z8//7+/+ZC6M8AAAAJcEhZcwAADsMAAA7DAcdvqGQAAAAYdEVYdFNvZnR3YXJlAHBhaW50Lm5ldCA0LjEuNWRHWFIAACuASURBVBgZ7cELQyLLuh7gtzuNaRFviKCMBp3DOEIUjcEYwQlyxEDo7v3+/3+T2Wedvfe6DDP2paqrqr/nAYUQG4FCiI1AIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AUYb1Yvo0uu53/+6o+V2j/l2A74L6d43md0fdv+tfj56mizVFGUChy/LleTTofzpp7m4jg+1Gs9PtX4+eXpYUuoBCtfXs4fr8eNdHYfxG6/z64duaQjVQqBK9Pg4v2ns1KFPba/eGj68RhSqgKF48G120tqBN2LoYzWKK4oGiUIvHr51dD2XY7XwdLygKBYqCrF+G5wc1lCw4OBtO1xQFAUUBZsOTHRhk+2TwLaHIDxT5RE/9owAGCpqfH9cU+YAiu8Xd+R6Mtns2eqPIDhSZJC+DTggrbLWvX2KKTECR3uLmOIBV/NbwjSI9UKQTP180YKWd86eYIh1QpLC4OQ5gMb91s6BIARQfFD9fNOCAxsVzTPFBoPiI95vjAM4Ijm/eKT4CFL/0PjiEcw4H7xS/BIqfW90ewVGHwxXFz4HiJ1a3Rx4c5h3drih+AhSbrG+PPDjPO7pdUWwCih+K7to+KsI7ul1R/BAofuCp46NSvOPHhOKvQPFn7/1tVFB4uaD4M1D8QTI+9lBVrfuY4g9A8TuLyxCVtnUxp/gdUPxDfN+EwOEopvgHUPzm9WIL4j/UzmcUvwHFd8ndAcTv7N/GFN+BguvrbYg/Ca/WFAQr771Xg/gB//yNlQdW3OzEg9jAa7+w4sBKe2xC/NTBOGGVgdUV3zYgfmlnGLO6wKpaXYUQH1L7vGRVgdW07PkQH+Z/emM1gVW07PkQqXjdJasIrJ5lz4dIze8tWT1g1az7AUQmfm/FqgGrZd2vQWRW669ZLWCVxFc1iFxq/TWrBKyOeBBC5BYOYlYHWBXxIIQoRDiIWRVgRdxtQxRm+44VAVbCtwOIQh28sBLAClh2IQrXXbICQOfFXwMIBYKrmM4DXfewA6FI/Z6uA932egSh0OGMbgNdtjrzIJTyPi3pMtBdybAGoVzta0x3gc56akBosTOms0BHrboQ2nSWdBTopvstCI1qI7oJdNHiGEKz5oIuAt2TDAMI7fzrhO4BnfN6AFGK/RmdAzom7nsQJfEuYzoGdMu0AVGixoRuAV2yPoco2dmaLgEdMt6GKN32Ix0COiP6BGGETxGdAbri2w6EIXa+0RWgG5KvHoQxvKuEbgCd8N6EMMrhgk4AXfBQgzBM7Z4uAO0XfYIw0Mma9gOt91KHMFJ9SuuBlkuuPAhDeZcJLQfabXEIYbD9N9oNtNp9DcJowYhWAy2WXEAY71NCi4H2WjYhLLD/TnuB1noJIawQPtNaoK2GHoQlvGvaCrRTdAphkU5EO4FWetuDsMrunFYCbfRYg7BM8EgbgfZJ+hAW+pzQPqB1Vi0IK7VWtA5om1kdwlL1GW0DWmYcQFgrGNMyoF0GHoTFvAHtAtokOYew3HlCm4AWidoQ1mtHtAhoj+U+hAP2l7QHaI15HcIJ9TmtAdpiEkA4IpjQFqAlRh6EM7wRLQHaoQ/hlD7tANogOYVwzGlCG4AWWDchnNOMaAHQfMsGhIMaS5oPNN6yAeGkxpLGA0333oBwVGNO04GGm4cQzgrnNBxotnkI4bBwTrOBRpuFEE6rTWk00GTTAMJxwZQmAw02DSCcFzzTYKC5ngKICvAeaC7QWA8e3BY2mp1ufzB6nnw3X3wX8bto8d188t3zaNDvdpqNEG7zHmgs0FQPHpy0td+5GD5OFiumsFpMxoNee68GJ3lDmgo01L0HtwT7nYvh42vEXNaz8aDX3gvgmAENBZrpwYM7djtX4wULtRhfdXbhkCHNBBrpwYMTtlq90SymIvFs1GttwQneA40EmujJg/W8g954SQ2W496BB+t5DzQRaKBpALvVWleTiBpFk6tWDXbznmgg0DzTABarn97MWIrZzWkdFgumNA9onFkAW/lH13OWan595MNWwZTGAU0zD2Gn+tljRANEj2c7sFNtTtOAhpmHsJB/dD2nQd6GLR8WCuc0DGiW9xDWCU7HEY0Tj08DWCec0yygUZYNWMbvjGMaKh6fBrBMY0mjgCZZNmAVv30X0Wjx+NSHVRpLmgQ0yLoBi/jtu4gWiO7aPizSiGgQ0BxJE/bYv4lojWh0AHs0E5oDNMcpbFE7n9Eyr70t2OKU5gCN0YclmvcxLRTfH8ESfRoDNMUIVggv32itxWUIK4xoCtAQEw8WOH5MaLXk8RgW8CY0BGiGeQDj+Z9e6YD5Jx/GC+Y0A2iEZR2mq31e0hHL/hZMV1/SCKAJon0YbmcQ0yHxzQ4Mtx/RBKABkjbMdjBO6JpxE2ZrJzQAaIBzGK09pZO+tWG0cxoALN8AJmvN6KxZGyYbsHxg6cYezNWc0GmzJszljVk6sGyzAMZqTui8SRPGCmYsG1iyVR2m2huzEp73YKr6iiUDy5W0YKi9MStjvAdDtRKWCyxXH2YK71gpoxBm+sxygaV6hJH8zxErJvrsw0hjlgos01sNJjpZsIIWJzBRMGeZwBJFezDQ3pQVNd2HgXYjlggs0SnME94mrK5RCPN0WCKwPEMYx79cs9Kizz6M879ZHrA0Lx5M03xj5S2OYZr/wfKAZVmGMEztluK7+y2YZc3ygCVJmjBM553iP6y6MMkeSwSW5AJm2R5T/NNTHebosURgOe5hlrM1xe9EPQ+mGLNEYCkWNZikMaH4k5ddGGLNEoFlSA5hEO8ipviLpO/BBPssE1iGKxikPqX4oVkDBrhkmcASvHgwx8maYoPoDOV7YplA/aI6jBHcUfzEeAsl8yKWCdTvE4xxsKD4qfcjlOuApQK1e4ApvM8Jxa9ceyjTJUsF6vZegyHqU4oPmDVQomeWCtQsacIQp2uKD4nOUBo/ZqlAzb7CDN6Q4sNGAUrSZLlAvb55MML2C0UKszrK8YXlArWKdmCE5pIilXULpZiwXKBWn2CEi4Qirb4H/fyY5QJ1GsMEwQNFBk81aNdkyUCN1tswQGNOkcliD7p9ZclAjc5hgE5EkVHchWYvLBmozxQG6FPkcO1BpyBhyUBt4gZK591R5PIQQKMWywZq00fpgglFTi8h9PnKsoG6vHooW31OkdtbA9q8sGygJskByra/pCjA6hCa1Fg6UJMhynYcURQiOYEebZYO1GMRoGTnCUVRLqHFgKUD9ThGubxrigLdetBgxtKBWtyjXN4DRaEePChXY/lAHVZbKJX3QFGwpwCqdVg+UIcuShU8UBRuGkCxG5YP1OAJpQqmFApMA6g1Z/lA9ZIGyhRMKZR4DaFSSAOA6g1RpvCFQpF5CIVOaABQuVUNJQrnFMrMt6HODQ0AKneGEoVzCoWWDSjzRgOAqr16+ICgefHlu7P9AEUK5xRKLRtQpE4TgKod4ZcOr2cJ/+HbxRaKEs4pFFuGUKNLE4CKPeAXDgfv/KNkvI9ChHMK5eYhlBjRBKBa8Q5+5nDwzh9IhjXkF7xQaDAPocKCJgDV+orNDgfv3GR5jLyCKYUW0wDFq9MIoFLLABscDt75M0kH+QRTCk2mAQr3iUYAlerihw4H7/yVv3WQh/dAoc2zh6Ld0wigSt/wA4eDd37E306QnfdAodGDh4It+UELqgSqdIA/Oxy886OSBrLyHii0ekCxGvyoDlUCFbrDHx0O3plGFCKjawrNrlGoM37QAndUCFQn3sbvHA7emda7j0zOKbQ7R5Hu+UEjbMdUB1RngH86HLwzi6/I4jih0C45RoFW/KAuMKA6oDJxiN8cDt6Z0d/2kN5+RFGCaB+F2eNHbQNhTGVAZQb4u8PBO3N48ZBWfUlRimUdRenxg+b4bkBlQFXiEDgcvDOnLlIK5hQlmQcoyJgfdIPvwpiqgKpcHQ7emd+bh1S8CUVpJh6KseYHneDvrqgKqEj8f1mMT0jljqJEdyjEHj8qxN/V1lQENN3SRwp9ilL1UYRLftAcv+lTEdB4PXxch6JkHRTgiR80xG9qa6oBGm/p46MaEUXJol3k5kX8oDb+U59qgObr4YOCOUXp3gLkdcCPquE/BUsqAZpv6eNjHigM8Ii8LvlBM/xTj0qAFviCD7mgMML/7J42m81Gvb6FbJ74QQP8k7+kCqAF1jV8QDOhMM9isfg2mTyNRqOrL1963e5ps9ncrddDbObH/KA2/qVHFUAbfMGvbS8p7PK+WMwmk+fRaPT1y5eLbrfbbDZ36/WwyQ9KAvyLv6QCoA3WNfyK90JRNS/4vR4VAK3wBb8ypKicr/g9f8XigVZYb+HnTimqp4U/uGLxQDsM8FP1NUXlJAH+IIxZONAOcYif8KYU1fOCP7ll4UBLDPATnykq6Av+pMHCgZaIQ2x0kFBUUBN/9siigbYYYJNgQVFBsY8/a7JooC2SHWxwR1FFE/zVjAUDrTHCj51QVNIX/NUJCwZaI9nBj9TXFJXUxF957ywWaI8RfsCbUlRS5OEHeiwWaI9kB391QVFNT/iR2pqFAi1yj79oxBTVdIkfumahQJvs4c8mFBV1gB/aTlgk0CZj/MkZRUVFHn7sjkUCrbKHP9heU1TUEzY4YJFAq4zxB2OKquphk1cWCLTLPn6nQ1FZe9jkggUCyxb9L6Ywwb/U3imqao2NtmIWByxVdNf2MWYKTfzTLUVl3WGzexYHLE901/bx3R5TmOAfmhTVdYTNmiwOWJLoru3jP42ZQhO/8d8oKivx8BMLFgYsQ3TX9vEvuwk/boLfXFJU17/jZy5ZGFC76K7t449GTOEYfxeuKarrv+NnwoRFAfWK7to+/mIn4cfN8He3FBV2ip8asyigRtFd28cPjZhCG8BeQlFdcYCfOmZRQF2iu7aPTXYSftwMwJSiwsb4Oe+dBQG1iO7aPn5mxBTaOKGoslP8Qp8FAdWL7to+fiGM+XGz/7KgqLA3H7+wzYKAikV3bR8fMGAK/5Oiylr4pScWA1Qpumv7+Jgw5sf9jaLCxvi1DosBKhPdtX183IBCfMRyG7/mRywEqEZ01/aRShhTiF+LdvERdywEqEB01/aR2hWF+KWkiQ9psxBg0aK7to8samsK8QvrFj7GX7MIYKGiu7aPrL5QiJ+b1fFRtywCWJzoru0jh9qaQvxEfO3jw45YBLAgi7u2j5y+ULhtORpPJtPFYhEzvXgQIgVvxQKABfj363aIAtRWFG5r4p+Cer3ebDY73e6nL1++3IxGD5PJZLFYRPyR+Ok8RDq3LABYgCMUpEfhtgk+wq/X64fNZrvb/fTl7867LR+pHbEAYH4rDwXxlxRua0Ebb8X8wPxuUZgehdtm0OeW+YH5HaEw/pLCbW1oc8T8wNzeUaAehdum0OeduYG5DVAg/43CbQfQZsDcwNwOUaQuhdvG0OaQuYF5vaNQ3huF05IdaPPOvMC8blCsLoXbBtDmhnmBeR2jWN4bhdPiGnQ5Zl5gTnGAgp1SuO0zdAli5gTm9IzCzSictvShyzNzAnO6QOHaFG77BF0umBOYUwPFm1E47RW6NJgTmM8CCrQp3HYMXRbMB8znBirMKJz2CF1umA+YzzFUaFI4LQmhyTHzAXOJAygxoXDaJTQJYuYC5vIMNZoUTnuDLs/MBczlAopMKJzWhCYXzAXMpQFFmhROu4cmDeYC5rGAMk8ULotr0GTBPMA8bqDMHoXTzqHJDfMA8ziGOmMKl82gyTHzAHNIAqizR+G0fegRJMwBzOEFKo0pXHYDTV6YA5jDACrtJRQOW/vQY8AcwBw6UGpE4bI29OgwBzCHEErtJBQOu4MeIXMAs1tAsRGFwyIfeiyYHZjdHRTbSSgc1oYed8wOzO4cqo0oHHYHPc6ZHZjdHlSrxxTuinxoscfswMwiqDegcFgbekTMDMzsCeqFMYW7xtDjiZmBmfWhwYDCXXEALfrMDMzsCBqEMYW7TqHFETMDMwugwzWFu8bQImBmYFYzaPFfKdwV+dBixqzArIbQ4ojCYUfQYsiswKxOoMU1hcOuocUJswKz2oEWcwqHzaHFDrMCM1pDizqF0+rQYs2MwIxeoMUZhdPOoMULMwIzGkKLRwqnPUKLITMCMzqHDn5E4bTIhw7nzAjM6AA6HFE47gg6HDAjMKMadLimcNw1dKgxIzCbBbSYUzhuDi0WzAbM5hE61CmcV4cOj8wGzOYrdDilcN4pdPjKbMBsOtDhhsJ5N9Chw2zAbHahw4zCeTPosMtswExiDxrUKCqgBg28mJmAmcygQ4uiAlrQYcZMwExG0OGKogKuoMOImYCZXECHCUUFTKDDBTMBM2lBAy+iqIDIgwYtZgJmsgUNDigq4QAahMwEzCKCDj2KSuhBh4hZgFm8QocxRSWMocMrswCzeIQOS4pKWEKHR2YBZjGEBlsUFbEFDYbMAsziAhq0KCqiBQ0umAWYRRsa9CgqogcN2swCzGIPGowoKmIEDfaYBZhFDRrMKCpiBg1qzALMYA0dYoqKiKHDmhmAGcygwS5FZexCgxkzADN4gAYdisroQIMHZgBmcA0Nrigq4woaXDMDMINzaDCmqIwxNDhnBmAGx9BgQVEZC2hwzAzADHahXkBRIQHU22UGYAY+1NunqJA9qOczAzC9JTToUFRIGxosmR6Y3gs0uKCokB40eGF6YHrP0GBIUSEDaPDM9MD0RtDgkaJCxtBgxPTA9AbQ4JWiQmbQYMD0wPT60CCiqJA1NOgzPTC9T1Bvi6JSalDvE9MD0zuBevsUlbIH9U6YHpheE+p1KCqlDfWaTA9MbxfqXVBUSg/q7TI9ML1tqDekqJQB1NtmemB60OCRolLG0IDpgamtocGEolIm0GDN1MDUFtBgQVEpC2iwYGpgalNosKKolBU0mDI1MLUnaEBRMdDgiamBqY2gXkhRMSHUGzE1MLVrqNegqJgG1LtmamBqfajXpKiYJtTrMzUwtS7U61BUTAfqdZkamFoX6nUpKqYL9bpMDUytC/X6FBXTh3pdpgam1oV6A4qKGUC9LlMDU+tCvRFFxYygXpepgakdQb1niop5hnpHTA1MrQn1JhQVM4F6TaYGptaEehOKiplAvSZTA1NrQr0JRcVMoF6TqYGpNaHehKJiJlCvydTA1BpQb05RMXOo12BqYGp1qLegqJgF1KszNTC1OtRbUFTMAurVmRqYWh3qLSgqZgH16kwNTK0O9RYUFbOAenWmBqYWQL2IomIiqBcwNTA1aEBROdCAqYGpQQOKyoEGTA1MDRpQVA40YGpgatCAonKgAVMDUwugXkRRMRHUC5gamFod6i0oKmYB9epMDUytDvUWFBWzgHp1pgamVod6C4qKWUC9OlMDU6tDvQVFxSygXp2pgak1oN6comLmUK/B1MDUmlBvQlExE6jXZGpgak2oN6GomAnUazI1MLUm1JtQVMwE6jWZGphaE+pNKCpmAvWaTA1M7QjqPVNUzDPUO2JqYGpdqDeiqJgR1OsyNTC1LtQbUFTMAOp1mRqYWhfq9Skqpg/1ukwNTK0L9boUFdOFel2mBqbWhXodiorpQL0uUwNT60O9JkXFNKFen6mBqV1DvQZFxTSg3jVTA1MbQb2QomJCqDdiamBqT9CAomKgwRNTA1ObQoMVRaWsoMGUqYGpLaDBgqJSFtBgwdTA1NbQYEJRKRNosGZqYHrQ4JGiUsbQgOmB6W1DvSFFpQyg3jbTA9NrQL0LikrpQb0G0wPTa0K9DkWltKFek+mB6XWg3j5FpexBvQ7TA9PrQr0tikqpQb0u0wPT60ODiKJC1tCgz/TA9K6hwStFhcygwTXTA9MbQYNHigoZQ4MR0wPTe4IGQ4oKGUCDJ6YHpjeFBhcUFdKDBi9MD0xvCQ06FBXShgZLpgdm4EO9fYoK2YN6PjMAM2hAvYCiQgKo12AGYAYtaLCgqIwFNGgxAzCDc2gwpqiMMTQ4ZwZgBtfQ4IqiMq6gwTUzADN4gAYdisroQIMHZgBm8A0a7FJUxi40+MYMwAxW0CGmqIgYOqyZAZhFDRrMKCpiBg1qzALMYg8ajCgqYgQN9pgFmEUbGvQoKqIHDdrMAsyiBw1aFBXRggY9ZgFmMYQGWxQVsQUNhswCzOIROiwpKmEJHR6ZBZjFK3QYU1TCGDq8Mgswiwg69CgqoQcdImYBZrIFDQ4oKuEAGoTMBMykBQ28iKICIg8atJgJmMkFdJhQVMAEOlwwEzCTEXS4oqiAK+gwYiZgJjPo0KKogBZ0mDETMJMYOtQoKqAGHWJmAmazCx1mFM6bQYddZgNm04EONxTOu4EOHWYDZvMVOpxSOO8UOnxlNmA2Y+hQp3BeHTqMmQ2YzQJazCkcN4cWC2YDZhRAh2sKx11Dh4AZgRkdQIcjCscdQYcDZgRmdAYd/IjCaZEPHc6YEZjREFo8UjjtEVoMmRGY0RRanFM47QxaTJkRmNEaWuxQOG0HWqyZEZjVNrR4o3DYG7TYZlZgVifQYkjhsCG0OGFWYFYDaNGicFgLWgyYFZjVN2jhxxTOin1o8Y1ZgVklAbQYUzhrDC2ChFmBmTWhxSmFs06hRZOZgZl9hhZBTOGoOIAWn5kZmNkj9BhTOGoMPR6ZGZjZGnqcUjjqFHqsmRmY3S60CGIKJ8UBtNhldmB2Z9BjTOGkMfQ4Y3ZgdiPocUrhpFPoMWJ2YHZv0MOPKBwU+dDjjdmBOWxBjzsKB91Bjy3mAObQhh5tCge1oUebOYA5XEMPP6JwTuRDj2vmAObwAk1GFM4ZQZMX5gDmEPvQ44DCOQfQw4+ZA5hHC5q8UjjmFZq0mAeYxxCa9Cgc04MmQ+YB5vEGTbZiCqfEW9DkjXmAuexAk3sKp9xDkx3mAuZyDk2OKJxyBE3OmQuYyxN0WVA4ZAFdnpgLmEvsQ5NLCodcQhM/Zi5gPi1oEiYUzkhCaNJiPmA+N9DlkcIZj9DlhvmA+SygyzGFM46hy4L5gDk1oMucwhFz6NJgTmBOF9DlE4UjPkGXC+YE5vQMXfwlhROWPnR5Zk5gTnEAXfoUTuhDlyBmTmBex9BlK6ZwQLwFXY6ZF5jXDbS5oXDADbS5YV5gXu/QZofCATvQ5p15gbkdQpsxhfXG0OaQuYG5DaBNk8J6TWgzYG5gbu/Q5xuF5b5Bn3fmBuZ3CG3aFJZrQ5tD5gfmN4Q+MwqrzaDPkPmB+a08aNOmsFob2ngr5gcW4Aj6zCgsNoM+RywAWIBb6NOksFgT+tyyAGABVh70mVBYawJ9vBULABbhCPo0KazVhD5HLAJYhFto9ExhqWdodMsigEVYedBnj8JSe9DHW7EIYCGOoNGYwkpjaHTEQoCFuIVGexRW2oNGtywEWIiVB43uKCw0gkbeioUAi3EMjbZjCutEITQ6ZjHAYjxCpz6FdT5Dp0cWAyxGEkIj/53CMgsfGoUJiwEW5BI6nVJY5gQ6XbIgYEEW0OqFwipTaLVgQcCitKDTAYVV9qFTi0UBi3IPre4oLDKCVvcsCliUeAs6bccU1ohC6LQVsyhgYS6gVZ/CGp+h1QULAxZmDq38dwpLLHxoNWdhwOIcQqtjCkscQ6tDFgcszgh63VNY4R56jVgcsDhxDVptrSgssNqCVrWYxQELdA69uhQW6EKvcxYILNAMmj1RGO8Jms1YILBI+9CrHlEYLqpDr30WCSzSLTTrURiuB81uWSSwSHEIvbwXCqO9eNArjFkksFBX0Gw3oTBYsgvNrlgosFBrH5pdURisD838NQsFFuscmnkzCmPNPGh2zmKBxXrzoFkjojBU1IBm3huLBRasDd3OKAx1Dt3aLBhYsBdoN6Yw0iO0e2HBwKIdQLetdwoDrbag2wGLBhZtDO2OKAx0DO3GLBpYtGQH2l1TGGcI7XYSFg0s3BDaeTMKw8x9aDdk4cDCxTVo14gojJLsQbtazMKBxfsM/c4ojHIB/T6zeGDxlj70G1EYZAz9/CWLByrwCfoFMwpjzAPo94kKgAq8edCvvqYwRNSAft4bFQBV6KIELQpDdFCCLlUAVVj6KEGfwghfUQJ/SRVAJXoogfdEYYBnDyXoUQlQiaWPEtQWFKVbbKEE/pJKgGr0UIa9mKJk8T7K0KMaoBqrGsrQpShZF2WoragGqEgfpRhQlOoapehTEVCRdQ1l8B4oSvTgoQy1NRUBVemjFMELRWleApSiT1VAVdYhShG+UZTkLUQpwjVVAZUZoByNFUUpVg2UY0BlQGXiEOU4TChKkByiHGFMZUB1BijJCUUJTlCSAdUB1Ym3UZJLCu0uUZLtmOqACt2hLLcUmt2iLHdUCFTpACXxHii0evBQkgOqBKr0grJ4TxQaTTyU5YUqgUp1UZZgSqHNNEBZulQKVGoZoCzBlEKTlwBlCZZUClTrCqUJXim0mIcozRXVAtWK6yhNOKfQYB6iNPWYaoGK3aM84ZxCueU2ynNPxUDVDlGe7SWFYssGynNI1UDVZh7K01hSKLVsoDzejKqByn1CiRpLCoWWDZToE5UDlVvWUKJwTqHMsoES1ZZUDlTvK8oUzikUmW+jTF+pHqhevIMyhVMKJeYhyrQTUz1QgzFKFUwpFHgJUaoxNQB16KBUwTNF4aYBStWhDqAOyxpK5T1QFGwSoFS1d+oAajFCubwHikI9eCjXLbUA9WiiXN41RYFuPZSrST1APRY+SnaeUBTlEiXz59QD1OQaZTuOKAqRnKBsV9QE1CTZR9n2lxQFWB2ibHsJNQF1mXkoW31OkdtbA2XzXqgLqM0lShdMKHJ6CVG6HrUBtYkbKJ13R5HLQ4DS1SNqA+ozgQH6FDlceyjfI/UBNTqDAToRRUZxFwY4pUagRuttGGD3jSKTxT4MsLWiRqBOY5ggeKTI4HkLJhhRJ1CrTzDC54Qira8eTNChVqBW0Q6M0FpTpBJ1YITtNbUC9frmwQj1GUUK8wbM8Ey9QM2uYIZgRPFh4wBmuKBmoGbJIQxxFlN8SHIBQ+wl1AzUbVGDIRozig+Y78EQ/it1A7W7gym8a4pfGvowxZDagfqdwBjNd4qfWh3DGMfUD9RvXYcxag8UP/G4BWNsragfWIKpB3OcRhQbROcwyCNLAJbhEgapTyl+aNaAQc5ZBrAMyT4M4l3EFH+R9D0YpBGzDGAp3gKYpDGh+JOXXZjEm7EUYDluYZazNcXvRD0PRhmwHGBJPsEs22OKf3qqwywnLAlYkmQfhum8U/yHVReG2Y1YErAs7yEMU7ul+O5+C4apvbEsYGmePZim+cbKWxzDOE8sDVieaxjHv1yz0qLPPozTZ3nAEnVgnvA2YXWNQpjnmCUCSxTtwkB7U1bUdB8G2olYIrBM8wAmOlmwghYnMFHwyjKBpXqEkfzPESsm+uzDSA8sFViuzzBTeMdKGYUw0yXLBZYracFQe2NWxngPhjpKWC6wZKs6TLU3ZiU878FU9RVLBpZtFsBYzQmdN2nCWMGMZQNLN/ZgruaETps1YS5vzNKB5RvAZK0ZnTVrw2QDlg80wDmM1p7SSd/aMNo5DQAaIGnDbAfjhK4ZN2G2dkIDgCaI9mG4nUFMh8Q3OzDcfkQTgEZY1mG62uclHbHsb8F09SWNAJphHsB4/qdXOmD+yYfxgjnNABpi4sECx48JrZY8HsMC3oSGAE0xghXCyzdaa3EZwgojmgI0Rh+WaN7HtFB8fwRL9GkM0BynsEXtfEbLvPa2YItTmgM0R9KEPfZvIlojGh3AHs2E5gANsm7AIn77LqIForu2D4s0IhoENMmyAav47buIRovHpz6s0ljSJKBRlg1Yxu+MYxoqHp8GsEx9SaOAZpmHsE5wOo5onHh8GsA64ZxmAQ0zD2Eh/+h6ToO8DVs+LBTOaRjQNPMa7FQ/e4xogOjxbAd2Cr7RNKBxpgFs5R9dz1mq+fWRD1sFUxoHNM80gMXqpzczlmJ2c1qHxbwJzQMa6MmD3Wqtq0lEjaLJVasGu3kPNBBoogcP1vMOeuMlNViOewcerOc90ESgkR48OGGr1RvNYioSz0a91hbcMKSRQDMN4ZDdztX4/7FQi/FVZxcOGdBMoKEGcIk3YDHWs/Gg194L4JgBDQWaaujBGcGY+awWk/Gg196rwU0Dmgo01oMHR4TfmF38b40QbvOGNBZorgcPTmgsmN3yEK7zHmgu0GBPARzQjJjdfAeu8x5oMNBk0wDW6ybMblqD64IJTQYabVqD5a6Yw50H1wVTGg002zyEzbw75nAF54XfaDbQcPMQ9tqaMrukC+eFcxoONN28AVvtzJld1ITz6nOaDjTesgE7HS6Z3aIB5zWWNB5ovmUDNupEzO4lhPMaS5oPtMC6CftcModxAOc1I1oAtEFyCst4N8xh4MF5pwltANqhD6sET8wuOYf7+rQDaImRB3uEM2YXHcN53oiWAG0xCWCLvSWzW+7DecGEtgCtMa/DDq2I2b1uw3n1Oa0B2mO5DxucJczuOYDz9pe0B2iRqA3zXTOHWw/Oa0e0CGiT5ByGCx6Yw2e47zyhTUC7DDyYLJwyu/gEzvMGtAtomXEAczXemN3qEM4LxrQMaJtZHaY6XDO7eQPOq89oG9A6qxbMdJowu2kI5x2taB3QPslnmOgLc7j34bzLhPYBbTQOYBpvxBy+wnnBA20EWmm+C8PcM7vkE5y380orgXaKOjDKgNlFR3DecUQ7gbb66sEcX5nd+y6c16etQGs9b8EU+wkzm4VwXe2J1gLt9b4PM3jfmNljANftvtFeoMXiLozQY2ZDD647iWgx0Gq3AcrnrZhRcgHXeQNaDbTbfA+l6zCjqA3XNWa0G2i55AJle2Q2ywO47jym5UDrPW+jVLWEmczrcNzWI60H2m/VRplazGRSg+OOV7Qf6IKbAOXpMYuRB7f5Q7oAdMJ8D6W5YQZf4Li9VzoBdENy6aEkE6aWnMJxFwndALpiso1yTJjW+hBu236mK0BnrDsoxYQpvTXgts6azgAdMtpCCSZM5yWE07ZGdAjoktUp9LtjKg8BnHa6oktAtzzVods507iG0+qPdAvomOjCg157TOHf4DKvF9ExoHO+7UEr72/8uHkN7tp7oXNA9yTXPnRaMYVnD47yrxK6B3TR4gga/R+mcQM3Ned0Eeim0Ra0mTCVcziodks3gY5anUKXO6aStOCczjsdBTrrqQE9ekwnasAtO2M6C3RXMqxBh0OmtAjhkNrXmO4CXbY686BewLSmHlzhfVrSZaDbXo+g3oRpjeCIwxndBrruYQeqtZnaZ7igfk/Xgc6LvwZQy1swtTasF1zFdB5YAcsu1OoxtWgPlusuWQFgJXw7gErejKktQ9js4IWVAFbE3TYU2o2Z2rcA1tq+Y0WAVREPQqhzwfQeYKlwELMqwOqIByFU8R6Z3hVsFA5iVgdYJfFVDYoEM6Z3CuvU+mtWCVgt634NamwvmVp8CLvU+mtWC1g1634AJQ5ipraswyJ+b8WqAatn2fOhwgnTew1gC7+3ZPWAVbTs+VDgC9N78mAFr7tkFYHVtOz5KN490xvAAv6nN1YTWFWrqxBF81+Y3ieYrvZ5yaoCqyu+baBg4TtTS45gtJ1hzOoCK+2xiWLtRUxt3YC5DsYJqwysuNmJhyIdJ0xtvgUzee0XVhxYee+9Ggp0yfQmHgzkn7+x8kDB9fU2ijNiercwTni1piAovkvuDlAUb8L0LmCW/duY4jtQ/Ob1YgvF2HpjaskxzFE7n1H8BhT/EN83UYjGmqlFuzDE4Sim+AdQ/M7iMkQBjhKmtghhgK2LOcXvgOIPkvGxh9zOmN6Lj7K17mOKPwDFn733t5HXkOndoVTh5YLiz0DxA08dH7l4T0zvC0rjHT8mFH8Fih+K7to+cgjmTO8EpfCOblcUPwSKTda3Rx4yqy+ZWrQP7byj2xXFJqD4idXtkYeMDhOmttyGVt7R7YriJ0Dxc6vbI2TTZXqzAPocDlcUPweKX3ofHCKLK6Y39qDH4eCd4pdA8RHvN8cBUhszva9QLzi+eaf4CFB8UPx80UA6wTem14VajYvnmOKDQJHC4uY4QArhkqklh1DGb90sKFIARTrx80UDH7YfMbXVDpTYOX+KKdIBRXqLm+MAH9NhevMARfNbwzeK9ECRSfIy6IT4gM9M79lDgbba1y8xRSagyG5xd76HX7ljejcoyO7Z6I0iO1DkEz31jwL8hD9lemfILWh+flxT5AOKAsyGJzvYJFwwtaSFPLZPBt8SivxAUZD1y/D8oIYf2I2YWtRAJsHB2XC6pigIKAq1ePza2fXwR62Eqb1tIaXdztfxgqJQoChePBtdtLbwLz2mN/XwUWHrYjSLKYoHClWi18fhRXuvhu9umd4Iv1Lba/eGj68RhSqgUG09e7j+bzOmd4kN/Ebr/Prh25pCNVCYq43f2W40O93+9ejpZUmhCyjMFf9bt9vtX4+epos1RRlAIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AIcRGoBBiI1AIsREohNgIFEJsBAohNgKFEBuBQoiNQCHERqAQYiNQCLERKITYCBRCbAQKITYChRAbgUKIjUAhxEagEGIjUAixESiE2AgUQmwECiE2AoUQG4FCiI1AIcRGoBBio/8PfAVYSVK3V9sAAAAASUVORK5CYII=\";\n        this._display_image = {\n            \"1\": baseimgstr,\n            \"-1\": baseimgstr\n        };\n\n        let databinding = {};\n\n        // TODO: Since the results are hard to analyze, try to find a better way to visualze\n        let judgements = [1];\n        let majority = MathHelper.majority(judgements);\n        this.setButtonImage(this._display_image[majority]);\n\n        this.dataparams = [supersection_all_vec_analyses, path_analysis]; // Fill in parameters\n\n        let layout = new Layout(this.button_subwindow);\n        layout.setRect(\"Title\", new Pos(0, 0), new Pos(100, 10), new RU_DataViewText());\n\n        \n        let thread_graph = new RU_DataViewBarGraph({\n            type: 'bar',\n            yAxes: [{\n                type: \"linear\",\n                display: true,\n                position: 'left',\n                id: 'axis-1'\n            }\n            ]\n        }).setDataAnalysisFunction(x => {\n            \n            let cache_snoop = [];\n            let cache_shr2ex = [];\n            let cache_cln2ex = [];\n            let cache_intervention = [];\n            if (x != null) {\n                cache_snoop = x.data.map(x => x.data.cache_snoop);\n                cache_shr2ex = x.data.map(x => x.data.cache_shr2ex);\n                cache_cln2ex = x.data.map(x => x.data.cache_cln2ex);\n                cache_intervention = x.data.map(x => x.data.cache_intervention);\n            }\n\n\n            let colors = RU_DataViewBarGraph.colorList().slice(0, cache_snoop.length + 1);\n\n            let datasets = [];\n            // mapping of thread -> cycles.\n\n            let repcount = supersection_all_vec_analyses.repcount;\n            if(all_analyses_global) {\n                // We need to group and add\n                let chunksize = cache_snoop.length / repcount;\n\n                cache_snoop = ObjectHelper.createChunks(cache_snoop, chunksize, MathHelper.sumArray);\n                cache_shr2ex = ObjectHelper.createChunks(cache_shr2ex, chunksize, MathHelper.sumArray);\n                cache_cln2ex = ObjectHelper.createChunks(cache_cln2ex, chunksize, MathHelper.sumArray);\n                cache_intervention = ObjectHelper.createChunks(cache_intervention, chunksize, MathHelper.sumArray);\n            }\n\n            // We only take the first element from each set since they should all be equivalent\n            datasets.push({ label: \"Snoop\", yAxisID: \"axis-1\", data: cache_snoop[0], backgroundColor: colors[0] });\n            datasets.push({ label: \"Shared to Exclusive\", yAxisID: \"axis-1\", data: cache_shr2ex[0], backgroundColor: colors[1] });\n            datasets.push({ label: \"Clean to Exclusive\", yAxisID: \"axis-1\", data: cache_cln2ex[0], backgroundColor: colors[2] });\n            datasets.push({ label: \"Intervention\", yAxisID: \"axis-1\", data: cache_intervention[0], backgroundColor: colors[4] });\n\n            let chartData = {\n                labels: [...Array(cache_snoop[0].length).keys()],\n                \"datasets\": datasets,\n\n            };\n\n            return chartData;\n        }).linkMouse(layout._layout_clickable).changeGraphOptions(x => {\n            x.options.title.text = \"Cache operations per thread\";\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').scaleLabel = { labelString: \"Operations\", display: true };\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').ticks.beginAtZero = true;\n            x.options.scales.xAxes = [{ scaleLabel: { labelString: \"Thread\", display: true } }];\n        });\n\n        layout.setRect(\"Graph\", new Pos(0, 10), new Pos(70, 50), thread_graph);\n\n        \n\n        databinding[\"Title\"] = new DataBlock({ fontsize: 32, text: \"Cache operations\", color: \"black\", align: \"center\" }, \"Text\");\n        databinding['Graph'] = supersection_all_vec_analyses;\n\n        layout.setDataBinding(databinding);\n        this.button_subwindow.setLayout(layout);\n\n        this.setOnEnterHover(p => { this.color = \"#FF0000\"; this.button_subwindow_state = 'open'; })\n        this.setOnLeaveHover(p => { this.color = \"orange\"; if (!this.is_locked_open) this.button_subwindow_state = 'collapsed'; })\n        this.setOnClick((p, mb) => { this.is_locked_open = !this.is_locked_open; });\n\n        this.setDefaultDblClick();\n    }\n\n\n\n}\n// Specialized version of class in datahelper.\nclass SuperSectionCacheOpAnalysis {\n    constructor(section, nodeid, stateid, critical_path_analysis) {\n        this.section = section;\n        this.critical_path_analysis = critical_path_analysis;\n        this.for_node = nodeid;\n        this.for_state = stateid;\n        this.analysis_result = null;\n\n        if(!(stateid == 0xFFFF || stateid == 65535))\n            ObjectHelper.assert(\"for_node defined\", this.for_node != undefined && new Number(this.for_node) != NaN);\n    }\n\n    judgement(analysis = null) {\n        if (analysis == null) analysis = this.analysis_result;\n\n        // TODO: Find a good judgement variable\n        return -1;\n    }\n\n    analyze() {\n        ObjectHelper.assert(\"Not available over old interface\", false);\n    }\n}\n\nclass LazySuperSectionCacheOpAnalysis extends SuperSectionCacheOpAnalysis {\n\n    constructor(communicator, section, nodeid, stateid, critical_path_analysis) {\n        super(section, nodeid, stateid, critical_path_analysis, null);\n        this.communicator = communicator;\n    }\n\n    async analyze() {\n        // We differ from the eager analysis here: We let the python/sql-side do the hard work\n        let section = this.section.toSection(this.for_node, this.for_state);\n        section = await section;\n        if(section === undefined) {\n            return undefined;\n        }\n        let tmp = await this.communicator.runAnalysis(\"CacheOpAnalysis\", [new Number(section.unified_id), new Number(section.supersection_id)]).get();\n\n        let data = tmp;\n\n        let ret = new DataBlock(data, \"CacheOp\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nfunction AutoSuperSectionCacheOpAnalysis(communicator, section, nodeid, stateid, critical_path_analysis) {\n    if(section instanceof LazySuperSection) {\n        return new LazySuperSectionCacheOpAnalysis(communicator, section, nodeid, stateid);\n    }\n    else {\n        return new SuperSectionCacheOpAnalysis(section, nodeid, stateid, critical_path_analysis);\n    }\n}\n\nexport { CacheOpButton, AutoSuperSectionCacheOpAnalysis };"],"sourceRoot":""}
\ No newline at end of file
diff --git a/dist/764.js b/dist/764.js
deleted file mode 100755
index 7c72183a..00000000
--- a/dist/764.js
+++ /dev/null
@@ -1,2 +0,0 @@
-(self.webpackChunk_spcl_sdfv=self.webpackChunk_spcl_sdfv||[]).push([[764],{6764:(A,e,g)=>{"use strict";g.r(e),g.d(e,{ParallelizationButton:()=>i});var t=g(7329),B=g(6610),n=g(379),I=g(6070),C=g(7608),Q=g(4286),a=g(1318);function E(A,e){(null==e||e>A.length)&&(e=A.length);for(var g=0,t=new Array(e);g<e;g++)t[g]=A[g];return t}var i=function(A){(0,n.Z)(r,A);var e,g,i=(e=r,g=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(A){return!1}}(),function(){var A,t=(0,C.Z)(e);if(g){var B=(0,C.Z)(this).constructor;A=Reflect.construct(t,arguments,B)}else A=t.apply(this,arguments);return(0,I.Z)(this,A)});function r(A,e,g,n,I){var C;(0,B.Z)(this,r),(C=i.call(this,A)).communicator=I,C._display_image={1:"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwgAADsIBFShKgAAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAAMNQTFRFu/+e5f/a3f/P5//d6P/f2//M7//o8f/s8//u0//B8//v7v/oyv+z+v/4wv+ovv+iAAAAAQQAAwwABRQABxgACSAACiQACygADjAADzQAETwAE0AAFEQAFUgAGVQAGlgAG1wAHGAAHWQAIXAAInQAI3gAJHwAJoAAKo8AKzomK5MALZcALpsAMqsANK8ANbMAOsMAO8cAQNcAROcASPMASvsATP8AZv8mf39/f/9Jh51/np6eo/h/pf9/sf+Ruv+e////oCuj7wAAABB0Uk5T7vDx8fHy8vLz9PT19/r7/mNEw4kAAAskSURBVHja7d1bU1NXHMbhlSoMd/0WHW96AVrpgVI/v5Ta4jhy7fmEpyqICuloOyqFxCT7sNZ/7ee5dSTZG3+YDJn1jq4kYJJv3AIQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBA3AIQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCmZwfwDW+O8rxqOeWXKJAQjjazfGoF5ZcopdYIBAQCCAQEAgIBAQCAgGBgECgMufdgsJsr47n/0vj73I81fFRtJs7unZRIMFdvPr9OMhTHR9G6+P6ZS+xwrt8feQmlNKHQBSiD4FEK2RbIR30sb1AHwIp0oZCOuhjIwlEIbTah0AUog+BRCxkSyEt9rG1YB8CKdamQlrsYzMJRCG03odAFKIPgUQtZEchLfSx06APgRRtXSEt9LGeBKIQOulDIArRh0AiF3JDIQ36uNGwD4EU75JCGvRxKQlEIXTWh0AUog+BRC/kpkIW6ONmC30IJIQ1hSzQx1oSiELotA+BKEQfAqmhkF2FzNHHbkt9CCSMVYXM0cdqEohC6LwPgShEHwKppZAVhczQx0qLfQgk2PdeIT3fI4EoxB0SiO+/+yOQYfwLWHYPplhu++eHQKJx5OK0Hx/bSSADZxxhSh+LDBwIRCH6EIhC9NFBHwIJWYj3IWe+/+igD4GEZBzhrD42kkBQSK99CEQh+hBIjYU4+v3LPrY66kMgYRlH+LKPzSQQFNJ7HwJRiD4EUmshjn5PTQdyBFIz4wgtDBwIRCH6EIhC9CEQThcy6KPfmw/kCKR2Qx5HaGXgQCAK0YdAFKIPgXB2IYM8+r2dgRyBDMHa0hD7WEsCYTbHx/oQCJMDuXesD4Ew0f798aD62O2pD4HU4vXD8ZD6WE0CYS4vh1NIj30IRCH6EMhACnk0jD5WeuxDIDV5sTeIPnr9rahAarK3pw+BMOBCeh8QEkhlhTyt+/qW+/7UmUAq8+Rl1f+BbCeB0MiDigvpZOBAIArRh0D4XMirSvv4q/8+BFKj+wd1vv/4MQmEFozvHNTYx0YSCAopqg+BKEQfAhlgIXffVtXHVqY+BFKr41tva+pjMwkEhRTXh0AUog+BDLSQ2++r6GMnYx8CqdnRrfc19LGeBEIn3scvJHMfAlGIPgQy4EJuH4Xu40bmPgRSu3d3jiL3cSkJhE4dxi2kgD4EohB9CGTghdwNefR7PwM5AiG9iTiO0NvAgUDYj1dIIX0IRCH6EAj7D0Id/d7fQI5A+OhVpHGEXgcOBMIHgeZDCupDIArRh0D4WMjjGH2sFNSHQIbk+V6IPkZJIGQRYD6ksD4EohB9CIRPhTwr+/ktF9aHQIbmcdHjCP0P5AiEk0qeD8kxACIQohRSYB8CGWIhhQ7sZBnIEQinlDmwk2cgRyCcUuQ4QraBA4EQoJBC+xCIQvQhEE4VUtbATr6BHIFwpqLGEbIOHAiEwgspuA+BKEQfAuHMQsoY2Mk7kCMQJipiYCf7wIFAmKSA+ZDC+xCIQvQhECYWkvfo9/wDOQJhqrc5Cyli4EAgTJNxPiRAHwIhWyER+hAI6TDP0e9lDOQIhK86yFFIMQMHAuFrMsyHBOlDIGQpJEofAuHfQvo9+r2cgRyBMJO/+yykqIEDgTCLHudDAvUhEHovJFIfAuFzIU/66WMlUB8C4bNne730MUoCIaQe5kOC9SEQei0kWh8C4WQhz7v9+svB+hAIJz3qdByhvIEcgTCfLudDShwAEQilFBKwD4FwupDXHfXxZ7w+BMJp9zo5+n20/VMSCBXoZByh2IEDgVBAIUH7EAhnF/Km5T5+j9mHQJhQSKtHv4+2fk0CoSKtjiMUPXAgEDIXErgPgdB5IZH7EAiTC7nTytHvZQ/kCISFtTKOUPzAgUDIWEjwPgRCp4VE70MgTC+k2dHv5Q/kCIRGGg3shBg4EAhNNJgPqaAPgdBZITX0IRC+XshiR7/HGMgRCI0tNLATZuBAIDS1wHxIJX0IhE4KqaUPgTBbIfMd/R5nIEcgtGKugZ1QAwcCoQ1zzIdU1IdAaL2QmvoQCLMXMtvR77EGcgRCa57uzdTHKAmEQZphPqSyPgRCq4XU1odAmK+QF9P/fLmyPgTCfB5OHUeIN5AjENo1bT4k4gCIQOirkAr7EAjzF7I/oY9r9fUhEOZ39+Ds9x8/J4HA2fMhUQdABEIfhVTah0BYrJDD//Vxtc4+BMJihdw+cfT7aOu3JBD45MQ4QuiBA4HQcSEV9yEQFi/k3X99/FFvHwJh8ULeXP3w0cTRzi9JIHDKt1d2RvEHDgRCZ9Z3ztXdh0BoWEjdfQiEZn5IAoHBEggIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEEAgIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEEAgIBAQCAgGBgEBAICAQEAgIBBAIzOj8AK7x3IUsj+oSBRLD0pJLxEssEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgQACAYGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgEEAgIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEEAgIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAIIBAQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAoFy/QOsBSVilqJCrgAAAABJRU5ErkJggg==","-1":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwgAADsIBFShKgAAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAATtQTFRF/9fX/9ra/8/P/9PT/9XV/93d/9/f/+Li/+Xl/+fn/8bG/8nJ/8zM/+jo/+zs/8TE/+7u/8HB/+/v/7q6/729//Hx//Pz/7e3//T0/7Oz/6+v/6ys/6io/6Wl//v7/6KiAAAABAAACAAADAAAEAAAFAAAGAAAHAAAIAAAJAAAKAAALAAAMAAANAAAOAAAPAAAQAAARAAASAAATAAAUAAAVAAAWAAAXAAAYAAAZAAAbAAAcAAAdAAAfAAAf39/gAAAgX9/gwAAhX9/hwAAjwAAkwAAlwAAmwAAnp6enwAAowAApwAAqwAArwAAswAAtwAAuwAAvwAAwwAAxwAAywAAzwAA0H9/0wAA1wAA2wAA3H9/3wAA4wAA5wAA6wAA7wAA8wAA9wAA+wAA/wAA/yYm/39//5GR/56e////5nk5bgAAACB0Uk5T8PDx8fHx8fHx8fLy8vLy8/P09PX19fX29vf4+vv8/f4cWDP+AAAPB0lEQVR42u3d7VIUVwKAYSYYNeqqSUxiTDa6+fQjyt7ElCNTVKQoKkipC0KqckkiuopiEMHw4Zi5k/29lYvIP/dsuVlLFBhnYKb7nO7n+ZMIJt1nhneaPpwzVH7uA7bzjocABAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCAgEEAgIBARCDJpNgcB21qvVdYHA1hYGQxhcEAhsZWY09PWF0RmBwGarU+HFP8LUaqGHWfnZU81OPP/Py9fYflcQeEMjvPy30BAIvG6t9iqQ2ppAYKP5enj1h1CfFwi8MjcWNv4xjM25SYfNN+h9hb9RdwWhY83w5kdCUyDwp0Z1cyDVhkDgheVa2PzBUFsWCPT13b4ctvpwuHxbIPB4Imz9iTDxuIjjNYtFRzZNYG14sS3iVJYrCJ1ohu0/V8ipLIHQgbVqq0CqawKhzO7XQ6tPh/p9gVBed8ZD678Qxu+4SccNel95btRdQWhXCN35OwKhiBrP2wnkeUMglNFKra2LQ6itCITyuTXU5jdPYeiWQCibuRtt31yEG0XaPmUWi3a0MYG14VW3QFNZriC0odnR5FSR1pwIhLd7Wu0skOpTgVAei5c6/OlGuLQoEMri5kjHP/0LIzcFQjk8md7BT8fD9JNijN4sFm/R0QTWhpfeYkxluYLQ2rMdrq4KzwRC8a1d3GkgF9cEQtE9qO94eW6oPxAIxXb3yi6Wr4crd92k4wa90DfqriC0uAaEfP97gRCztrZItQwk/e1TAmE7S7VdXwBCbUkgFNPscBe+QQrDswKhiB5OduUGIkw+TPphMIvF1nY5gbXhNTjpqSxXELbU7NoEVNrbpwTCVtar3Qukui4QimVhsIs/wQiDCwKhSGZGu/oTvjA6IxCKY3Wqyz8BD1OrqT4WZrHYpGsTWBteiFOdynIF4U3PerCCKtntUwLhDTveItUykFS3TwmE183Xe7IEN9TnBUL67o31aIl6GLvnJh036AW7UXcFYaNmD7c4JbnmRCBs0Kj2MpBqQyCkbLnW0z2yobbsHiRC//4jj6MeOJXaEN85caDXe8gr96YT++LZU4LXxT9+z+OoXyQ3xG/e6/l7LISJR2O+xSJJn2aRdBh1D0KSjp7J5DCpTWUJhP/Zf76STSDVNYGQnP6BvRkdKdQXBEJqzh7K7FBh9I5ASMvJjzM8WJgQCEn5+OtMD5fSW/YKhL5DZ7M9Xkpv2SsQ9v4962W2obYiEBJROb8v82OGoXmBkIbTR3M4aBibEwgp+OxELocNVwVCAj74LqcDJ7LmRCDldiCjFSZbBFJ9KhAit+dCfvsdwqVFgRC1yrmDOR49jNwUCDH76liuhw/TjwVCvI6fzPkEwohAiNbhs7mfQvxTWQIprX0DlfwDiX77lEDKqv/C3gjOItTvC4QYnT4cxWmE8bsCIT4nj0dyIuG6QIjOsa+jOZW4t08JpJQOfh/PucS9fUogZZT9FqmWhdSWBEJEKuf2R3U+YXhWIMTj2w8iO6Ew+VAgxOLE59GdUhgTCJF4/3SEJxXtmhOBlM17FyoxBhLr9imBlEz/QJy/EibW7VMCKZd8t0i1LGRkRiDk7cuPoj21MPWrQMjXJ6ciPrnwg0DIVQRbpFoW8kwg5GjvQNxPd7i4JhDye66j2CLVspD6A4GQl9NHoj/FcOWeQMjHXz9N4CTDNYGQiw+/SeI0Y1tzIpCSOHi+kkYg1YZAyNy7F/oTOdNQWxYIGaucO5DMuYbLtwVCtr75MKGTDRO/CIQsffrXpE43/CgQMnT0TGInHNFUlkCKb/+FSmqBVNcFQkb6B95N7pzD4IJAyMa5QwmedBidEQhZ+NtHSZ52mFoVCL338ZeJnngYEgg995ezyZ56aAiEHts70J9uILUVgdDbZ/f8voTPPgzNC4Re+u5o0qcfxuYEQu98fiLxAYSrAqFnPvg2+SHkv+ZEIIV1ILkVJlsEkvv2KYEU1Z4L/QUYRagtCoQeqHx/sBDjCCO3BUL3ffVhQQYSJh4LhG47frIwQwkjAqHLjpwt0GByncoSSBHtK8AE1oZAqmsCoYv6o38T3g4Lqd8XCN1z5nDBBhTG/ykQuuXkJ4UbUviHQOiSj74u4KBCEAhdcehcEUcVnjcEQhekvEWqZSG1JYGwa5Xv9xd0ZGH4lkDYrW/fL+zQwo2HAmF3Pvu8wIMLYwJhV97/rtDDy2PNiUAK5L1CrTDZIpDqU4GwY/0Dewo+wnBpUSDsUFG2SLUsZOSmQNiZL4+VYJBh+leBsBPHT5VimOEHgbADh8+UZKDhmUDo2N6BsjyT4eKaQOjQnoJtkWpZSP2BQOjMsSMlGmy4ck8gdORIqUYbrgmEjr5igvEKhO00npctkOy2TwkkfUu1ULYhZ7d9SiDJmx0O5Rt0GJ4VCO34ZTKUcdhh8heB0IYfQznHHX4UCG/XDGUdeTbbpwSStvVqeQOprguE1hYGQ3kHHwYXBEIrM6OhzMMPozMCYXurU6HcD0CYWhUI2xoKZX8EwpBA2E4jeAxCQyBsba0mkL5QWxMIW5mv6+NFIfV5gbDZ3Jg+/ixkbE4gbHJVHy8LuSoQ3tTUx6tCmgLhdY2qQF4FUm0IhI2WTWC9VkhtWSC8cvuyPl4v5PJtgfDSowl9vFnIxCOB8H+j+thcyKhA+JMJrC0LaQqEF9ZMYG0ZSHVNIPT13bfCZJtC6vcFwp1xfWxXyPgdgZSeCawWhUwIpPRfA/rI+NERSEpK9ya8HQbSg7fsFUhCVqwweUshtRWBlNcte9DfWsjQLYGU1dwNfby9kBtzAikpW6TaKuSqQMrJCpM2C2kKpIyeWmHSZiDVpwIpn8VL+mi3kEuLAimbmyP6aL+QkZsCKZcn0/ropJDpJwIpFVtsOyzkskDKxARWx4U0BVIetkh1HkjXtk8JJHoPbJHaQSH1BwIph7tX9LGTQq7cFUgpXNfHzgq5LpBSPM/6yPWRE0jcbJHaeSBd2T4lkKgt2SK1i0JqSwIpttlhfeymkOFZgRTZw0l97K6QyYcCKTC/ZW3XhYwJpLisMOlCIU2BFNW6FSZdCKS6LpBiWhjURzcKGVwQSBHN+C0gXSpkdEYgxbM6pY9uFTK1KpDC8R5xXSxkSCBF80wf3SzkmUCKZe2iQLoZyMU1gRSJLVLdLmTn26cEEp97tkh1vZAr9wRSGNf00f1CrgmkKKww6UkhTYEUQ8MKk54EUm0IpAiWbZHqUSG1ZYGk77Y3UexZIZdvCyR1j/ya5x4WMvFIIImzQrGnhYwKJG0msHpcSFMgKfMmvL0OpPO37BVIPBasMOl5IfUFgaTqjhuQLG5D7ggkUSawMilkQiCJPnP6iPFxFkgkvAlvVoF09pa9AonDihUmmRVSWxFIaubtQc+wkKF5gaRlzpuMZlrI2JxAknJVH9kWclUgKbHCJPNCmgJJx1MrTDIPpPpUIKlYvKSP7Au5tCiQNNwc0UcehYzcFEgKHk/rI59Cph8LJAGuH/ldQwQSPxNYORbSFEjsbJHKM5B2tk8JJE/3bZHKtZD6fYHE7O64PvItZPyuQCJ2XR95F3JdIBE/O/qI/zkQSG5skYohkLdtnxJIXpZskYqikNqSQGI0O6yPOAoZnhVIfB5O6iOWQiYfCiQ6thBGVMiYQGJjhUlUhTQFEhdbpOIKpMX2KYHkwBap2ArZfvuUQLI3Y4l7dIWMzGzzmT0enKz99lOodP0JziW5SqU4z8pPvw0KJA6DPfh//uv3PEbyxdniPy2+xYIWBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCAgEEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAICAQQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQEAggEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCAgEEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAICAQQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQEAggEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQSMueEozxwBe5HNUQBZKGU4aIb7FAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBgXgIQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQEAggEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCAvEQgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEIjYfwEbSxIkomzDdAAAAABJRU5ErkJggg=="},C.setButtonImage(C._display_image[n.judgement]);var o={},l=new Q.Layout(C.button_subwindow);l.setRect("Title",new Q.Pos(0,0),new Q.Pos(100,10),new Q.RU_DataViewText),l.setRect("PathInfo",new Q.Pos(0,20),new Q.Pos(70,30),(new Q.RU_DataViewFormLayout).setTitle("PathInfo").setDataAnalysisFunction((function(A){var e=A,g=e.data.efficiency,t=(0,Q.max_func)(g,(function(A){return A.thread_num})),B=0;toplevel_use_mean?B=a.Vw.mean(e.data.critical_paths.find((function(A){return 1==A.thread_num})).value):toplevel_use_median?B=a.Vw.median(e.data.critical_paths.find((function(A){return 1==A.thread_num})).value):a.tV.assert("Undefined mode",!1);var n=0;toplevel_use_mean?n=a.Vw.mean(e.data.critical_paths.find((function(A){return A.thread_num==t})).value):toplevel_use_median?n=a.Vw.median(e.data.critical_paths.find((function(A){return A.thread_num==t})).value):a.tV.assert("Undefined mode",!1);var I="unknown",C="unknown";return toplevel_use_mean?(I="mean",C="mean"):toplevel_use_median&&(I="median",C="median"),{fontsize:16,rows:[{title:"Threads",value:t},{title:"Serial Path ("+I+")",value:a.tV.valueToSensibleString(B)+" cycles"},{title:"Critical Path ("+C+")",value:a.tV.valueToSensibleString(n)+" cycles"}],padding:{left:10,right:10,top:0,bottom:0},rawdata:A}}))),l.setRect("Imbalance",new Q.Pos(70,50),new Q.Pos(30,20),(new Q.RU_DataViewNumberBlock).setTitle("Imbalance").setDataAnalysisFunction((function(A){var e=100*A.data.balance_max;return Math.round(e)})).setColorScaling((function(A){return Math.min(Math.pow(A,2)/10,100)})));var s=(new Q.RU_DataViewSuggestedActionBlock).setDataAnalysisFunction((function(A){var e=[],g=A.data.speedup,t=(0,Q.max_func)(g,(function(A){return A.thread_num})),B=(0,Q.min_func)(g,(function(A){return A.thread_num})),n=0;return toplevel_use_mean?a.Vw.mean(g.find((function(A){return A.thread_num==B})).value):toplevel_use_median?a.Vw.median(g.find((function(A){return A.thread_num==B})).value):a.tV.assert("Unknown mode",!1),toplevel_use_mean?n=a.Vw.mean(g.find((function(A){return A.thread_num==t})).value):toplevel_use_median?n=a.Vw.median(g.find((function(A){return A.thread_num==t})).value):a.tV.assert("Unknown mode",!1),Math.abs(n-1)<.1&&e.push("SpeedupHigherThanOne"),e})).linkMouse(l._layout_clickable);s.setHint("SpeedupHigherThanOne","MapTiling"),l.setRect("SuggestedAction",new Q.Pos(70,70),new Q.Pos(30,20),s),l.setRect("Efficiency",new Q.Pos(70,20),new Q.Pos(30,20),(new Q.RU_DataViewNumberBlock).setTitle("Efficiency").setOptions({draw_bar:["left"],padding:{left:10},display_title:!0,text_align:"center"}).setDataAnalysisFunction((function(A){var e=A.data.efficiency,g=(0,Q.max_func)(e,(function(A){return A.thread_num})),t=0;return toplevel_use_mean?t=a.Vw.mean(e.find((function(A){return A.thread_num==g})).value):toplevel_use_median?t=a.Vw.median(e.find((function(A){return A.thread_num==g})).value):a.tV.assert("Unknown mode",!1),Math.round(100*t)})).setColorScaling((function(A){return 100-A})).setInformationFilePath("optimization_hints/efficiency.html"));var u=new Q.RU_DataViewBarGraph({type:"bar",yAxes:[{type:"linear",display:!0,position:"left",id:"axis-1"}]}).setDataAnalysisFunction((function(A){var e=[];null!=A&&(e=A.data.map((function(A){return A.data.cycles_per_thread})));var B=Q.RU_DataViewBarGraph.colorList().slice(0,e.length+1),n=[];if(all_analyses_global){var I=Math.round(e.length/g.repcount);e=a.tV.createChunks(e,I,a.Vw.sumArray)}var C,i=0,r=function(A,e){var g;if("undefined"==typeof Symbol||null==A[Symbol.iterator]){if(Array.isArray(A)||(g=function(A,e){if(A){if("string"==typeof A)return E(A,e);var g=Object.prototype.toString.call(A).slice(8,-1);return"Object"===g&&A.constructor&&(g=A.constructor.name),"Map"===g||"Set"===g?Array.from(A):"Arguments"===g||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(g)?E(A,e):void 0}}(A))||e&&A&&"number"==typeof A.length){g&&(A=g);var t=0,B=function(){};return{s:B,n:function(){return t>=A.length?{done:!0}:{done:!1,value:A[t++]}},e:function(A){throw A},f:B}}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 n,I=!0,C=!1;return{s:function(){g=A[Symbol.iterator]()},n:function(){var A=g.next();return I=A.done,A},e:function(A){C=!0,n=A},f:function(){try{I||null==g.return||g.return()}finally{if(C)throw n}}}}(e);try{for(r.s();!(C=r.n()).done;){var o=C.value;n.push({label:"run "+i.toString(),yAxisID:"axis-1",data:o,backgroundColor:B[i]}),i++}}catch(A){r.e(A)}finally{r.f()}return{labels:(0,t.Z)(Array(e[0].length).keys()),datasets:n}})).linkMouse(l._layout_clickable).changeGraphOptions((function(A){A.options.title.text="PAPI_TOT_CYC per thread",A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).scaleLabel={labelString:"Cycles",display:!0},A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).ticks.beginAtZero=!0,A.options.scales.xAxes=[{scaleLabel:{labelString:"Thread",display:!0}}]})),c=new Q.RU_DataViewBarGraph({type:"line",yAxes:[{type:"linear",display:!0,position:"left",id:"axis-1"},{type:"linear",display:!0,position:"right",id:"axis-2"}]}).setDataAnalysisFunction((function(A){var e=[];null!=A&&(e=A.data.critical_paths);var g=[];null!=A&&(g=A.data.speedup);var t=[];null!=A&&(t=A.data.efficiency);var B=Q.RU_DataViewBarGraph.colorList().slice(0,4),n=[],I=0;toplevel_use_mean?I=e.map((function(A){return a.Vw.mean(A.value)})):toplevel_use_median?I=e.map((function(A){return a.Vw.median(A.value)})):a.tV.assert("Unknown mode",!1),n.push({label:"Critical path",fill:!1,yAxisID:"axis-1",data:I,backgroundColor:B[0],borderColor:B[0]});var C=void 0;return toplevel_use_mean?C=function(A){return a.Vw.mean(A)}:toplevel_use_median?C=function(A){return a.Vw.median(A)}:a.tV.assert("undefined mode",!1),n.push({label:"Speedup",fill:!1,yAxisID:"axis-2",data:g.map((function(A){return C(A.value)})),backgroundColor:B[1],borderColor:B[1]}),n.push({label:"Efficiency",fill:!1,yAxisID:"axis-2",data:t.map((function(A){return C(A.value)})),backgroundColor:B[2],borderColor:B[2]}),{labels:e.map((function(A){return A.thread_num})),datasets:n}})).linkMouse(l._layout_clickable).changeGraphOptions((function(A){A.options.title.text="Parallel efficiency",A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).scaleLabel={labelString:"Cycles",display:!0},A.options.scales.yAxes.find((function(A){return"axis-1"==A.id})).ticks.beginAtZero=!0,A.options.scales.yAxes.find((function(A){return"axis-2"==A.id})).scaleLabel={labelString:"Relative Perf.",display:!0},A.options.scales.yAxes.find((function(A){return"axis-2"==A.id})).ticks.beginAtZero=!0,A.options.scales.xAxes=[{scaleLabel:{labelString:"OMP_NUM_THREADS",display:!0}}]})).setInformationFilePath("optimization_hints/efficiency.html");return l.setMultiviewRect("Graph",new Q.Pos(0,50),new Q.Pos(70,50),[u,c]),o.Imbalance=e,o.SuggestedAction=n,o.Efficiency=n,o.Title=new Q.DataBlock({fontsize:32,text:"Parallelization results",color:"black",align:"center"},"Text"),o.Graph=[g,n],o.PathInfo=n,C.dataparams=[e,g,n],l.setDataBinding(o),C.button_subwindow.setLayout(l),C.setOnEnterHover((function(A){C.color="#00FF00",C.button_subwindow_state="open"})),C.setOnLeaveHover((function(A){C.color="orange",C.is_locked_open||(C.button_subwindow_state="collapsed")})),C.setOnClick((function(A,e){C.is_locked_open=!C.is_locked_open})),C.setDefaultDblClick(),C}return r}(Q.Button)}}]);
-//# sourceMappingURL=764.js.map
\ No newline at end of file
diff --git a/dist/764.js.map b/dist/764.js.map
deleted file mode 100755
index d2babd19..00000000
--- a/dist/764.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack://@spcl/sdfv/./renderer_dir/parallelization_button.js"],"names":["ParallelizationButton","ctx","targetsection_analysis","all_analyses","critical_path_analysis","communicator","_display_image","setButtonImage","judgement","databinding","layout","Layout","button_subwindow","setRect","Pos","RU_DataViewText","RU_DataViewFormLayout","setTitle","setDataAnalysisFunction","d","x","efficiencies","data","efficiency","target_thread_num","max_func","y","thread_num","path_1_thread","toplevel_use_mean","MathHelper","critical_paths","find","value","toplevel_use_median","ObjectHelper","path_max_thread","descstr_1","descstr_max","fontsize","rows","title","padding","left","right","top","bottom","rawdata","RU_DataViewNumberBlock","balance_max","Math","round","setColorScaling","min","pow","suggested_action","RU_DataViewSuggestedActionBlock","returnarr","speedup","max_thread_num","min_thread_num","min_func","max_speedup","abs","push","linkMouse","_layout_clickable","setHint","setOptions","draw_bar","display_title","text_align","setInformationFilePath","thread_graph","RU_DataViewBarGraph","type","yAxes","display","position","id","tcs","map","cycles_per_thread","colors","slice","length","datasets","all_analyses_global","chunksize","repcount","i","tc","label","toString","yAxisID","backgroundColor","labels","Array","keys","changeGraphOptions","options","text","scales","scaleLabel","labelString","ticks","beginAtZero","xAxes","efficiency_graph","graphcp","cp","fill","borderColor","agg_func","undefined","sp","setMultiviewRect","DataBlock","color","align","dataparams","setDataBinding","setLayout","setOnEnterHover","p","button_subwindow_state","setOnLeaveHover","is_locked_open","setOnClick","mb","setDefaultDblClick","Button"],"mappings":"0UAMMA,E,wcACF,WAAYC,EAAKC,EAAwBC,EAAcC,EAAwBC,GAAc,uBACzF,cAAMJ,IACDI,aAAeA,EAEpB,EAAKC,eAAiB,CAClB,EAAK,6tIACL,KAAM,ksLAGV,EAAKC,eAAe,EAAKD,eAAeF,EAAuBI,YAE/D,IAAIC,EAAc,GAEdC,EAAS,IAAIC,SAAO,EAAKC,kBAC7BF,EAAOG,QAAQ,QAAS,IAAIC,MAAI,EAAG,GAAI,IAAIA,MAAI,IAAK,IAAK,IAAIC,mBAC7DL,EAAOG,QAAQ,WAAY,IAAIC,MAAI,EAAG,IAAK,IAAIA,MAAI,GAAI,KAAK,IAAIE,yBAAwBC,SAAS,YAAYC,yBAAwB,SAAAC,GACjI,IAAIC,EAAID,EAEJE,EAAeD,EAAEE,KAAKC,WACtBC,GAAoBC,cAASJ,GAAc,SAAAK,GAAC,OAAIA,EAAEC,cAElDC,EAAgB,EACjBC,kBACCD,EAAgBE,UAAgBV,EAAEE,KAAKS,eAAeC,MAAK,SAAAZ,GAAC,OAAoB,GAAhBA,EAAEO,cAAiBM,OAC/EC,oBACJN,EAAgBE,YAAkBV,EAAEE,KAAKS,eAAeC,MAAK,SAAAZ,GAAC,OAAoB,GAAhBA,EAAEO,cAAiBM,OACpFE,YAAoB,kBAAkB,GAE3C,IAAIC,EAAkB,EACnBP,kBACCO,EAAkBN,UAAgBV,EAAEE,KAAKS,eAAeC,MAAK,SAAAZ,GAAC,OAAIA,EAAEO,YAAcH,KAAmBS,OACjGC,oBACJE,EAAkBN,YAAkBV,EAAEE,KAAKS,eAAeC,MAAK,SAAAZ,GAAC,OAAIA,EAAEO,YAAcH,KAAmBS,OACtGE,YAAoB,kBAAkB,GAE3C,IAAIE,EAAY,UACZC,EAAc,UAUlB,OATGT,mBACCQ,EAAY,OACZC,EAAc,QAEVJ,sBACJG,EAAY,SACZC,EAAc,UAGX,CACHC,SAAU,GACVC,KAAM,CACF,CAAEC,MAAO,UAAWR,MAAOT,GAC3B,CAAEiB,MAAO,gBAAkBJ,EAAY,IAAKJ,MAAOE,2BAAmCP,GAAiB,WACvG,CAAEa,MAAO,kBAAoBH,EAAc,IAAKL,MAAOE,2BAAmCC,GAAmB,YAEjHM,QAAS,CAACC,KAAM,GAAIC,MAAO,GAAIC,IAAK,EAAGC,OAAQ,GAC/CC,QAAS5B,OAGjBT,EAAOG,QAAQ,YAAa,IAAIC,MAAI,GAAI,IAAK,IAAIA,MAAI,GAAI,KAAK,IAAIkC,0BAAyB/B,SAAS,aAAaC,yBAAwB,SAAAE,GACrI,IAAI6B,EAAmC,IAArB7B,EAAEE,KAAK2B,YAEzB,OADQC,KAAKC,MAAMF,MAEpBG,iBAAgB,SAAAhC,GAAC,OAAI8B,KAAKG,IAAIH,KAAKI,IAAIlC,EAAG,GAAM,GAAI,SAEvD,IAAImC,GAAmB,IAAIC,mCAAkCtC,yBAAwB,SAAAE,GAEjF,IAAIqC,EAAY,GAGZC,EAFOtC,EAAEE,KAEMoC,QACfC,GAAiBlC,cAASiC,GAAS,SAAAhC,GAAC,OAAIA,EAAEC,cAC1CiC,GAAiBC,cAASH,GAAS,SAAAhC,GAAC,OAAIA,EAAEC,cAE1CmC,EAAc,EAoBlB,OAlBGjC,kBACeC,UAAgB4B,EAAQ1B,MAAK,SAAAN,GAAC,OAAIA,EAAEC,YAAciC,KAAgB3B,OAC5EC,oBACUJ,YAAkB4B,EAAQ1B,MAAK,SAAAN,GAAC,OAAIA,EAAEC,YAAciC,KAAgB3B,OACjFE,YAAoB,gBAAgB,GAEtCN,kBACCiC,EAAchC,UAAgB4B,EAAQ1B,MAAK,SAAAN,GAAC,OAAIA,EAAEC,YAAcgC,KAAgB1B,OAC5EC,oBACJ4B,EAAchC,YAAkB4B,EAAQ1B,MAAK,SAAAN,GAAC,OAAIA,EAAEC,YAAcgC,KAAgB1B,OACjFE,YAAoB,gBAAgB,GAGtCe,KAAKa,IAAID,EAAc,GAAO,IAC7BL,EAAUO,KAAK,wBAIZP,KACRQ,UAAUvD,EAAOwD,mBACpBX,EAAiBY,QAAQ,uBAAwB,aAEjDzD,EAAOG,QAAQ,kBAAmB,IAAIC,MAAI,GAAI,IAAK,IAAIA,MAAI,GAAI,IAAKyC,GAEpE7C,EAAOG,QAAQ,aAAc,IAAIC,MAAI,GAAI,IAAK,IAAIA,MAAI,GAAI,KAAK,IAAIkC,0BAAyB/B,SAAS,cAAcmD,WAAW,CAC1HC,SAAU,CAAC,QACX3B,QAAS,CAAEC,KAAM,IACjB2B,eAAe,EACfC,WAAY,WACbrD,yBAAwB,SAAAE,GACvB,IAAIC,EAAeD,EAAEE,KAAKC,WACtBC,GAAoBC,cAASJ,GAAc,SAAAK,GAAC,OAAIA,EAAEC,cAElDJ,EAAa,EAQjB,OANGM,kBACCN,EAAaO,UAAgBT,EAAaW,MAAK,SAAAN,GAAC,OAAIA,EAAEC,YAAcH,KAAmBS,OACnFC,oBACJX,EAAaO,YAAkBT,EAAaW,MAAK,SAAAN,GAAC,OAAIA,EAAEC,YAAcH,KAAmBS,OACxFE,YAAoB,gBAAgB,GAElCe,KAAKC,MAAM,IAAO5B,MAC1B6B,iBAAgB,SAAAhC,GAAC,OAAI,IAAMA,KAAGoD,uBAAuB,uCAExD,IAAIC,EAAe,IAAIC,sBAAoB,CACvCC,KAAM,MACNC,MAAO,CAAC,CACJD,KAAM,SACNE,SAAS,EACTC,SAAU,OACVC,GAAI,aAGT7D,yBAAwB,SAAAE,GACvB,IAAI4D,EAAM,GACD,MAAL5D,IACA4D,EAAM5D,EAAEE,KAAK2D,KAAI,SAAA7D,GAAC,OAAIA,EAAEE,KAAK4D,sBAGjC,IAAIC,EAAST,kCAAgCU,MAAM,EAAGJ,EAAIK,OAAS,GAE/DC,EAAW,GAGf,GAAGC,oBAAqB,CACpB,IAAIC,EAAYtC,KAAKC,MAAM6B,EAAIK,OAASlF,EAAasF,UAGrDT,EAAM7C,kBAA0B6C,EAAKQ,EAAW1D,eAGpD,IAlB4B,EAkBxB4D,EAAI,EAlBoB,E,w5BAAA,CAmBbV,GAnBa,IAmB5B,2BAAoB,KAAXW,EAAW,QAChBL,EAAStB,KAAK,CAAE4B,MAAO,OAASF,EAAEG,WAAYC,QAAS,SAAUxE,KAAMqE,EAAII,gBAAiBZ,EAAOO,KACnGA,KArBwB,8BA8B5B,MANgB,CACZM,QAAQ,OAAIC,MAAMjB,EAAI,GAAGK,QAAQa,QACjC,SAAYZ,MAKjBrB,UAAUvD,EAAOwD,mBAAmBiC,oBAAmB,SAAA/E,GACtDA,EAAEgF,QAAQ3D,MAAM4D,KAAO,0BACvBjF,EAAEgF,QAAQE,OAAO1B,MAAM5C,MAAK,SAAAZ,GAAC,MAAY,UAARA,EAAE2D,MAAgBwB,WAAa,CAAEC,YAAa,SAAU3B,SAAS,GAClGzD,EAAEgF,QAAQE,OAAO1B,MAAM5C,MAAK,SAAAZ,GAAC,MAAY,UAARA,EAAE2D,MAAgB0B,MAAMC,aAAc,EACvEtF,EAAEgF,QAAQE,OAAOK,MAAQ,CAAC,CAAEJ,WAAY,CAAEC,YAAa,SAAU3B,SAAS,QAG1E+B,EAAmB,IAAIlC,sBAAoB,CAC3CC,KAAM,OACNC,MAAO,CAAC,CACJD,KAAM,SACNE,SAAS,EACTC,SAAU,OACVC,GAAI,UACL,CACCJ,KAAM,SACNE,SAAS,EACTC,SAAU,QACVC,GAAI,aAGT7D,yBAAwB,SAAAE,GACvB,IAAIW,EAAiB,GACZ,MAALX,IACAW,EAAiBX,EAAEE,KAAKS,gBAG5B,IAAI2B,EAAU,GACL,MAALtC,IACAsC,EAAUtC,EAAEE,KAAKoC,SAGrB,IAAInC,EAAa,GACR,MAALH,IACAG,EAAaH,EAAEE,KAAKC,YAGxB,IAAI4D,EAAST,kCAAgCU,MAAM,EAAG,GAElDE,EAAW,GAEXuB,EAAU,EACXhF,kBACCgF,EAAU9E,EAAekD,KAAI,SAAA6B,GAAE,OAAIhF,UAAgBgF,EAAG7E,UAElDC,oBACJ2E,EAAU9E,EAAekD,KAAI,SAAA6B,GAAE,OAAIhF,YAAkBgF,EAAG7E,UAEvDE,YAAoB,gBAAgB,GAIzCmD,EAAStB,KAAK,CAAE4B,MAAO,gBAAiBmB,MAAM,EAAOjB,QAAS,SAAUxE,KAAMuF,EAASd,gBAAiBZ,EAAO,GAAI6B,YAAa7B,EAAO,KAEvI,IAAI8B,OAAWC,EAmBf,OAlBGrF,kBACCoF,EAAW,SAAA7F,GAAC,OAAIU,UAAgBV,IAC5Bc,oBACJ+E,EAAW,SAAA7F,GAAC,OAAIU,YAAkBV,IAElCe,YAAoB,kBAAkB,GAG1CmD,EAAStB,KAAK,CAAE4B,MAAO,UAAWmB,MAAM,EAAOjB,QAAS,SAAUxE,KAAMoC,EAAQuB,KAAI,SAAAkC,GAAE,OAAIF,EAASE,EAAGlF,UAAS8D,gBAAiBZ,EAAO,GAAI6B,YAAa7B,EAAO,KAE/JG,EAAStB,KAAK,CAAE4B,MAAO,aAAcmB,MAAM,EAAOjB,QAAS,SAAUxE,KAAMC,EAAW0D,KAAI,SAAAkC,GAAE,OAAIF,EAASE,EAAGlF,UAAS8D,gBAAiBZ,EAAO,GAAI6B,YAAa7B,EAAO,KAErJ,CACZa,OAAQjE,EAAekD,KAAI,SAAA7D,GAAC,OAAIA,EAAEO,cAClC,SAAY2D,MAKjBrB,UAAUvD,EAAOwD,mBAAmBiC,oBAAmB,SAAA/E,GACtDA,EAAEgF,QAAQ3D,MAAM4D,KAAO,sBACvBjF,EAAEgF,QAAQE,OAAO1B,MAAM5C,MAAK,SAAAZ,GAAC,MAAY,UAARA,EAAE2D,MAAgBwB,WAAa,CAAEC,YAAa,SAAU3B,SAAS,GAClGzD,EAAEgF,QAAQE,OAAO1B,MAAM5C,MAAK,SAAAZ,GAAC,MAAY,UAARA,EAAE2D,MAAgB0B,MAAMC,aAAc,EACvEtF,EAAEgF,QAAQE,OAAO1B,MAAM5C,MAAK,SAAAZ,GAAC,MAAY,UAARA,EAAE2D,MAAgBwB,WAAa,CAAEC,YAAa,iBAAkB3B,SAAS,GAC1GzD,EAAEgF,QAAQE,OAAO1B,MAAM5C,MAAK,SAAAZ,GAAC,MAAY,UAARA,EAAE2D,MAAgB0B,MAAMC,aAAc,EACvEtF,EAAEgF,QAAQE,OAAOK,MAAQ,CAAC,CAAEJ,WAAY,CAAEC,YAAa,kBAAmB3B,SAAS,QACpFL,uBAAuB,sCA/O+D,OAkPzF9D,EAAO0G,iBAAiB,QAAS,IAAItG,MAAI,EAAG,IAAK,IAAIA,MAAI,GAAI,IAAK,CAAC2D,EAAcmC,IAEjFnG,EAAW,UAAgBP,EAC3BO,EAAW,gBAAsBL,EACjCK,EAAW,WAAiBL,EAC5BK,EAAW,MAAY,IAAI4G,YAAU,CAAE9E,SAAU,GAAI8D,KAAM,0BAA2BiB,MAAO,QAASC,MAAO,UAAY,QAEzH9G,EAAW,MAAY,CAACN,EAAcC,GACtCK,EAAW,SAAeL,EAE1B,EAAKoH,WAAa,CAACtH,EAAwBC,EAAcC,GACzDM,EAAO+G,eAAehH,GAGtB,EAAKG,iBAAiB8G,UAAUhH,GAEhC,EAAKiH,iBAAgB,SAAAC,GAAO,EAAKN,MAAQ,UAAW,EAAKO,uBAAyB,UAClF,EAAKC,iBAAgB,SAAAF,GAAO,EAAKN,MAAQ,SAAe,EAAKS,iBAAgB,EAAKF,uBAAyB,gBAC3G,EAAKG,YAAW,SAACJ,EAAGK,GAAS,EAAKF,gBAAkB,EAAKA,kBAEzD,EAAKG,qBAtQoF,E,UAD7DC","file":"764.js","sourcesContent":["// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport { Button, Layout, Pos, max_func, max_func_obj, min_func, DataBlock,\n    RU_DataViewText, RU_DataViewSuggestedActionBlock, RU_DataViewNumberBlock, RU_DataViewBarGraph, RU_DataViewFormLayout, } from \"./renderer_util.js\";\nimport { MathHelper, ObjectHelper } from \"./datahelper.js\";\n\n\nclass ParallelizationButton extends Button {\n    constructor(ctx, targetsection_analysis, all_analyses, critical_path_analysis, communicator) {\n        super(ctx);\n        this.communicator = communicator;\n\n        this._display_image = {\n            \"1\": \"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwgAADsIBFShKgAAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAAMNQTFRFu/+e5f/a3f/P5//d6P/f2//M7//o8f/s8//u0//B8//v7v/oyv+z+v/4wv+ovv+iAAAAAQQAAwwABRQABxgACSAACiQACygADjAADzQAETwAE0AAFEQAFUgAGVQAGlgAG1wAHGAAHWQAIXAAInQAI3gAJHwAJoAAKo8AKzomK5MALZcALpsAMqsANK8ANbMAOsMAO8cAQNcAROcASPMASvsATP8AZv8mf39/f/9Jh51/np6eo/h/pf9/sf+Ruv+e////oCuj7wAAABB0Uk5T7vDx8fHy8vLz9PT19/r7/mNEw4kAAAskSURBVHja7d1bU1NXHMbhlSoMd/0WHW96AVrpgVI/v5Ta4jhy7fmEpyqICuloOyqFxCT7sNZ/7ee5dSTZG3+YDJn1jq4kYJJv3AIQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBA3AIQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCmZwfwDW+O8rxqOeWXKJAQjjazfGoF5ZcopdYIBAQCCAQEAgIBAQCAgGBgECgMufdgsJsr47n/0vj73I81fFRtJs7unZRIMFdvPr9OMhTHR9G6+P6ZS+xwrt8feQmlNKHQBSiD4FEK2RbIR30sb1AHwIp0oZCOuhjIwlEIbTah0AUog+BRCxkSyEt9rG1YB8CKdamQlrsYzMJRCG03odAFKIPgUQtZEchLfSx06APgRRtXSEt9LGeBKIQOulDIArRh0AiF3JDIQ36uNGwD4EU75JCGvRxKQlEIXTWh0AUog+BRC/kpkIW6ONmC30IJIQ1hSzQx1oSiELotA+BKEQfAqmhkF2FzNHHbkt9CCSMVYXM0cdqEohC6LwPgShEHwKppZAVhczQx0qLfQgk2PdeIT3fI4EoxB0SiO+/+yOQYfwLWHYPplhu++eHQKJx5OK0Hx/bSSADZxxhSh+LDBwIRCH6EIhC9NFBHwIJWYj3IWe+/+igD4GEZBzhrD42kkBQSK99CEQh+hBIjYU4+v3LPrY66kMgYRlH+LKPzSQQFNJ7HwJRiD4EUmshjn5PTQdyBFIz4wgtDBwIRCH6EIhC9CEQThcy6KPfmw/kCKR2Qx5HaGXgQCAK0YdAFKIPgXB2IYM8+r2dgRyBDMHa0hD7WEsCYTbHx/oQCJMDuXesD4Ew0f798aD62O2pD4HU4vXD8ZD6WE0CYS4vh1NIj30IRCH6EMhACnk0jD5WeuxDIDV5sTeIPnr9rahAarK3pw+BMOBCeh8QEkhlhTyt+/qW+/7UmUAq8+Rl1f+BbCeB0MiDigvpZOBAIArRh0D4XMirSvv4q/8+BFKj+wd1vv/4MQmEFozvHNTYx0YSCAopqg+BKEQfAhlgIXffVtXHVqY+BFKr41tva+pjMwkEhRTXh0AUog+BDLSQ2++r6GMnYx8CqdnRrfc19LGeBEIn3scvJHMfAlGIPgQy4EJuH4Xu40bmPgRSu3d3jiL3cSkJhE4dxi2kgD4EohB9CGTghdwNefR7PwM5AiG9iTiO0NvAgUDYj1dIIX0IRCH6EAj7D0Id/d7fQI5A+OhVpHGEXgcOBMIHgeZDCupDIArRh0D4WMjjGH2sFNSHQIbk+V6IPkZJIGQRYD6ksD4EohB9CIRPhTwr+/ktF9aHQIbmcdHjCP0P5AiEk0qeD8kxACIQohRSYB8CGWIhhQ7sZBnIEQinlDmwk2cgRyCcUuQ4QraBA4EQoJBC+xCIQvQhEE4VUtbATr6BHIFwpqLGEbIOHAiEwgspuA+BKEQfAuHMQsoY2Mk7kCMQJipiYCf7wIFAmKSA+ZDC+xCIQvQhECYWkvfo9/wDOQJhqrc5Cyli4EAgTJNxPiRAHwIhWyER+hAI6TDP0e9lDOQIhK86yFFIMQMHAuFrMsyHBOlDIGQpJEofAuHfQvo9+r2cgRyBMJO/+yykqIEDgTCLHudDAvUhEHovJFIfAuFzIU/66WMlUB8C4bNne730MUoCIaQe5kOC9SEQei0kWh8C4WQhz7v9+svB+hAIJz3qdByhvIEcgTCfLudDShwAEQilFBKwD4FwupDXHfXxZ7w+BMJp9zo5+n20/VMSCBXoZByh2IEDgVBAIUH7EAhnF/Km5T5+j9mHQJhQSKtHv4+2fk0CoSKtjiMUPXAgEDIXErgPgdB5IZH7EAiTC7nTytHvZQ/kCISFtTKOUPzAgUDIWEjwPgRCp4VE70MgTC+k2dHv5Q/kCIRGGg3shBg4EAhNNJgPqaAPgdBZITX0IRC+XshiR7/HGMgRCI0tNLATZuBAIDS1wHxIJX0IhE4KqaUPgTBbIfMd/R5nIEcgtGKugZ1QAwcCoQ1zzIdU1IdAaL2QmvoQCLMXMtvR77EGcgRCa57uzdTHKAmEQZphPqSyPgRCq4XU1odAmK+QF9P/fLmyPgTCfB5OHUeIN5AjENo1bT4k4gCIQOirkAr7EAjzF7I/oY9r9fUhEOZ39+Ds9x8/J4HA2fMhUQdABEIfhVTah0BYrJDD//Vxtc4+BMJihdw+cfT7aOu3JBD45MQ4QuiBA4HQcSEV9yEQFi/k3X99/FFvHwJh8ULeXP3w0cTRzi9JIHDKt1d2RvEHDgRCZ9Z3ztXdh0BoWEjdfQiEZn5IAoHBEggIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEEAgIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEEAgIBAQCAgGBgEBAICAQEAgIBBAIzOj8AK7x3IUsj+oSBRLD0pJLxEssEAgIBAQCAgGBgEBAIIBAQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQACBgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgQACAYGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgEEAgIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEEAgIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAIIBAQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAoFy/QOsBSVilqJCrgAAAABJRU5ErkJggg==\",\n            \"-1\": \"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAyAAAAMgCAMAAADsrvZaAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwgAADsIBFShKgAAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMS41ZEdYUgAAATtQTFRF/9fX/9ra/8/P/9PT/9XV/93d/9/f/+Li/+Xl/+fn/8bG/8nJ/8zM/+jo/+zs/8TE/+7u/8HB/+/v/7q6/729//Hx//Pz/7e3//T0/7Oz/6+v/6ys/6io/6Wl//v7/6KiAAAABAAACAAADAAAEAAAFAAAGAAAHAAAIAAAJAAAKAAALAAAMAAANAAAOAAAPAAAQAAARAAASAAATAAAUAAAVAAAWAAAXAAAYAAAZAAAbAAAcAAAdAAAfAAAf39/gAAAgX9/gwAAhX9/hwAAjwAAkwAAlwAAmwAAnp6enwAAowAApwAAqwAArwAAswAAtwAAuwAAvwAAwwAAxwAAywAAzwAA0H9/0wAA1wAA2wAA3H9/3wAA4wAA5wAA6wAA7wAA8wAA9wAA+wAA/wAA/yYm/39//5GR/56e////5nk5bgAAACB0Uk5T8PDx8fHx8fHx8fLy8vLy8/P09PX19fX29vf4+vv8/f4cWDP+AAAPB0lEQVR42u3d7VIUVwKAYSYYNeqqSUxiTDa6+fQjyt7ElCNTVKQoKkipC0KqckkiuopiEMHw4Zi5k/29lYvIP/dsuVlLFBhnYKb7nO7n+ZMIJt1nhneaPpwzVH7uA7bzjocABAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBAQCCAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCAgEEAgIBARCDJpNgcB21qvVdYHA1hYGQxhcEAhsZWY09PWF0RmBwGarU+HFP8LUaqGHWfnZU81OPP/Py9fYflcQeEMjvPy30BAIvG6t9iqQ2ppAYKP5enj1h1CfFwi8MjcWNv4xjM25SYfNN+h9hb9RdwWhY83w5kdCUyDwp0Z1cyDVhkDgheVa2PzBUFsWCPT13b4ctvpwuHxbIPB4Imz9iTDxuIjjNYtFRzZNYG14sS3iVJYrCJ1ohu0/V8ipLIHQgbVqq0CqawKhzO7XQ6tPh/p9gVBed8ZD678Qxu+4SccNel95btRdQWhXCN35OwKhiBrP2wnkeUMglNFKra2LQ6itCITyuTXU5jdPYeiWQCibuRtt31yEG0XaPmUWi3a0MYG14VW3QFNZriC0odnR5FSR1pwIhLd7Wu0skOpTgVAei5c6/OlGuLQoEMri5kjHP/0LIzcFQjk8md7BT8fD9JNijN4sFm/R0QTWhpfeYkxluYLQ2rMdrq4KzwRC8a1d3GkgF9cEQtE9qO94eW6oPxAIxXb3yi6Wr4crd92k4wa90DfqriC0uAaEfP97gRCztrZItQwk/e1TAmE7S7VdXwBCbUkgFNPscBe+QQrDswKhiB5OduUGIkw+TPphMIvF1nY5gbXhNTjpqSxXELbU7NoEVNrbpwTCVtar3Qukui4QimVhsIs/wQiDCwKhSGZGu/oTvjA6IxCKY3Wqyz8BD1OrqT4WZrHYpGsTWBteiFOdynIF4U3PerCCKtntUwLhDTveItUykFS3TwmE183Xe7IEN9TnBUL67o31aIl6GLvnJh036AW7UXcFYaNmD7c4JbnmRCBs0Kj2MpBqQyCkbLnW0z2yobbsHiRC//4jj6MeOJXaEN85caDXe8gr96YT++LZU4LXxT9+z+OoXyQ3xG/e6/l7LISJR2O+xSJJn2aRdBh1D0KSjp7J5DCpTWUJhP/Zf76STSDVNYGQnP6BvRkdKdQXBEJqzh7K7FBh9I5ASMvJjzM8WJgQCEn5+OtMD5fSW/YKhL5DZ7M9Xkpv2SsQ9v4962W2obYiEBJROb8v82OGoXmBkIbTR3M4aBibEwgp+OxELocNVwVCAj74LqcDJ7LmRCDldiCjFSZbBFJ9KhAit+dCfvsdwqVFgRC1yrmDOR49jNwUCDH76liuhw/TjwVCvI6fzPkEwohAiNbhs7mfQvxTWQIprX0DlfwDiX77lEDKqv/C3gjOItTvC4QYnT4cxWmE8bsCIT4nj0dyIuG6QIjOsa+jOZW4t08JpJQOfh/PucS9fUogZZT9FqmWhdSWBEJEKuf2R3U+YXhWIMTj2w8iO6Ew+VAgxOLE59GdUhgTCJF4/3SEJxXtmhOBlM17FyoxBhLr9imBlEz/QJy/EibW7VMCKZd8t0i1LGRkRiDk7cuPoj21MPWrQMjXJ6ciPrnwg0DIVQRbpFoW8kwg5GjvQNxPd7i4JhDye66j2CLVspD6A4GQl9NHoj/FcOWeQMjHXz9N4CTDNYGQiw+/SeI0Y1tzIpCSOHi+kkYg1YZAyNy7F/oTOdNQWxYIGaucO5DMuYbLtwVCtr75MKGTDRO/CIQsffrXpE43/CgQMnT0TGInHNFUlkCKb/+FSmqBVNcFQkb6B95N7pzD4IJAyMa5QwmedBidEQhZ+NtHSZ52mFoVCL338ZeJnngYEgg995ezyZ56aAiEHts70J9uILUVgdDbZ/f8voTPPgzNC4Re+u5o0qcfxuYEQu98fiLxAYSrAqFnPvg2+SHkv+ZEIIV1ILkVJlsEkvv2KYEU1Z4L/QUYRagtCoQeqHx/sBDjCCO3BUL3ffVhQQYSJh4LhG47frIwQwkjAqHLjpwt0GByncoSSBHtK8AE1oZAqmsCoYv6o38T3g4Lqd8XCN1z5nDBBhTG/ykQuuXkJ4UbUviHQOiSj74u4KBCEAhdcehcEUcVnjcEQhekvEWqZSG1JYGwa5Xv9xd0ZGH4lkDYrW/fL+zQwo2HAmF3Pvu8wIMLYwJhV97/rtDDy2PNiUAK5L1CrTDZIpDqU4GwY/0Dewo+wnBpUSDsUFG2SLUsZOSmQNiZL4+VYJBh+leBsBPHT5VimOEHgbADh8+UZKDhmUDo2N6BsjyT4eKaQOjQnoJtkWpZSP2BQOjMsSMlGmy4ck8gdORIqUYbrgmEjr5igvEKhO00npctkOy2TwkkfUu1ULYhZ7d9SiDJmx0O5Rt0GJ4VCO34ZTKUcdhh8heB0IYfQznHHX4UCG/XDGUdeTbbpwSStvVqeQOprguE1hYGQ3kHHwYXBEIrM6OhzMMPozMCYXurU6HcD0CYWhUI2xoKZX8EwpBA2E4jeAxCQyBsba0mkL5QWxMIW5mv6+NFIfV5gbDZ3Jg+/ixkbE4gbHJVHy8LuSoQ3tTUx6tCmgLhdY2qQF4FUm0IhI2WTWC9VkhtWSC8cvuyPl4v5PJtgfDSowl9vFnIxCOB8H+j+thcyKhA+JMJrC0LaQqEF9ZMYG0ZSHVNIPT13bfCZJtC6vcFwp1xfWxXyPgdgZSeCawWhUwIpPRfA/rI+NERSEpK9ya8HQbSg7fsFUhCVqwweUshtRWBlNcte9DfWsjQLYGU1dwNfby9kBtzAikpW6TaKuSqQMrJCpM2C2kKpIyeWmHSZiDVpwIpn8VL+mi3kEuLAimbmyP6aL+QkZsCKZcn0/ropJDpJwIpFVtsOyzkskDKxARWx4U0BVIetkh1HkjXtk8JJHoPbJHaQSH1BwIph7tX9LGTQq7cFUgpXNfHzgq5LpBSPM/6yPWRE0jcbJHaeSBd2T4lkKgt2SK1i0JqSwIpttlhfeymkOFZgRTZw0l97K6QyYcCKTC/ZW3XhYwJpLisMOlCIU2BFNW6FSZdCKS6LpBiWhjURzcKGVwQSBHN+C0gXSpkdEYgxbM6pY9uFTK1KpDC8R5xXSxkSCBF80wf3SzkmUCKZe2iQLoZyMU1gRSJLVLdLmTn26cEEp97tkh1vZAr9wRSGNf00f1CrgmkKKww6UkhTYEUQ8MKk54EUm0IpAiWbZHqUSG1ZYGk77Y3UexZIZdvCyR1j/ya5x4WMvFIIImzQrGnhYwKJG0msHpcSFMgKfMmvL0OpPO37BVIPBasMOl5IfUFgaTqjhuQLG5D7ggkUSawMilkQiCJPnP6iPFxFkgkvAlvVoF09pa9AonDihUmmRVSWxFIaubtQc+wkKF5gaRlzpuMZlrI2JxAknJVH9kWclUgKbHCJPNCmgJJx1MrTDIPpPpUIKlYvKSP7Au5tCiQNNwc0UcehYzcFEgKHk/rI59Cph8LJAGuH/ldQwQSPxNYORbSFEjsbJHKM5B2tk8JJE/3bZHKtZD6fYHE7O64PvItZPyuQCJ2XR95F3JdIBE/O/qI/zkQSG5skYohkLdtnxJIXpZskYqikNqSQGI0O6yPOAoZnhVIfB5O6iOWQiYfCiQ6thBGVMiYQGJjhUlUhTQFEhdbpOIKpMX2KYHkwBap2ArZfvuUQLI3Y4l7dIWMzGzzmT0enKz99lOodP0JziW5SqU4z8pPvw0KJA6DPfh//uv3PEbyxdniPy2+xYIWBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCAgEEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAICAQQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQEAggEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCAgEEAgIBgYBAQCAgEBAICAQEAggEBAICAYGAQEAgIBAQCAgEBAIIBAQCAgGBgEBAICAQEAgIBBAICAQEAgIBgYBAQCAgEBAICAQQCAgEBAICAYGAQEAgIBAQCCAQEAgIBAQCAgGBgEBAICAQEAggEBAICAQEAgIBgYBAQCAgEEAgIBAQCAgEBAICAYGAQEAgIBBAICAQEAgIBAQCAgGBgEBAICAQQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQEAggEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQSMueEozxwBe5HNUQBZKGU4aIb7FAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBgXgIQCAgEBAICAQEAgIBgYBAQCCAQEAgIBAQCAgEBAICAYGAQEAggEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEBAICAQEAgIBBAICAYGAQEAgIBAQCAgEBAICAQQCAgGBgEBAICAQEAgIBAQCAvEQgEBAICAQEAgIBAQCAgGBgEAAgYBAQCAgEBAICAQEAgIBgYBAAIGAQEAgIBAQCAgEBAICAYEAAgGBgEBAICAQEAgIBAQCAgGBAAIBgYBAQCAgEIjYfwEbSxIkomzDdAAAAABJRU5ErkJggg==\"\n        };\n\n        this.setButtonImage(this._display_image[critical_path_analysis.judgement]);\n\n        let databinding = {};\n\n        let layout = new Layout(this.button_subwindow);\n        layout.setRect(\"Title\", new Pos(0, 0), new Pos(100, 10), new RU_DataViewText());\n        layout.setRect(\"PathInfo\", new Pos(0, 20), new Pos(70, 30), new RU_DataViewFormLayout().setTitle(\"PathInfo\").setDataAnalysisFunction(d => {\n            let x = d;\n\n            let efficiencies = x.data.efficiency;\n            let target_thread_num = max_func(efficiencies, y => y.thread_num);\n\n            let path_1_thread = 0;\n            if(toplevel_use_mean)\n                path_1_thread = MathHelper.mean(x.data.critical_paths.find(x => x.thread_num == 1).value);\n            else if(toplevel_use_median)\n                path_1_thread = MathHelper.median(x.data.critical_paths.find(x => x.thread_num == 1).value);\n            else ObjectHelper.assert(\"Undefined mode\", false);\n\n            let path_max_thread = 0;\n            if(toplevel_use_mean)\n                path_max_thread = MathHelper.mean(x.data.critical_paths.find(x => x.thread_num == target_thread_num).value);\n            else if(toplevel_use_median)\n                path_max_thread = MathHelper.median(x.data.critical_paths.find(x => x.thread_num == target_thread_num).value);\n            else ObjectHelper.assert(\"Undefined mode\", false);\n            \n            let descstr_1 = \"unknown\";\n            let descstr_max = \"unknown\";\n            if(toplevel_use_mean) {\n                descstr_1 = \"mean\";\n                descstr_max = \"mean\";\n            }\n            else if(toplevel_use_median) {\n                descstr_1 = \"median\";\n                descstr_max = \"median\";\n            }\n\n            return {\n                fontsize: 16,\n                rows: [\n                    { title: \"Threads\", value: target_thread_num },\n                    { title: \"Serial Path (\" + descstr_1 + \")\", value: ObjectHelper.valueToSensibleString(path_1_thread) + \" cycles\" },\n                    { title: \"Critical Path (\" + descstr_max + \")\", value: ObjectHelper.valueToSensibleString(path_max_thread) + \" cycles\" }\n                ],\n                padding: {left: 10, right: 10, top: 0, bottom: 0 },\n                rawdata: d\n            };\n        }));\n        layout.setRect(\"Imbalance\", new Pos(70, 50), new Pos(30, 20), new RU_DataViewNumberBlock().setTitle(\"Imbalance\").setDataAnalysisFunction(x => {\n            let balance_max = x.data.balance_max * 100.0;\n            let p = Math.round(balance_max);\n            return p;\n        }).setColorScaling(x => Math.min(Math.pow(x, 2.) / 10, 100.)));\n\n        let suggested_action = new RU_DataViewSuggestedActionBlock().setDataAnalysisFunction(x => {\n            \n            let returnarr = [];\n            let data = x.data;\n\n            let speedup = data.speedup;\n            let max_thread_num = max_func(speedup, y => y.thread_num);\n            let min_thread_num = min_func(speedup, y => y.thread_num);\n            \n            let max_speedup = 0;\n            let min_speedup = 0;\n            if(toplevel_use_mean)\n                min_speedup = MathHelper.mean(speedup.find(y => y.thread_num == min_thread_num).value);\n            else if(toplevel_use_median)\n                min_speedup = MathHelper.median(speedup.find(y => y.thread_num == min_thread_num).value);\n            else ObjectHelper.assert(\"Unknown mode\", false);\n            \n            if(toplevel_use_mean)\n                max_speedup = MathHelper.mean(speedup.find(y => y.thread_num == max_thread_num).value);\n            else if(toplevel_use_median)\n                max_speedup = MathHelper.median(speedup.find(y => y.thread_num == max_thread_num).value);\n            else ObjectHelper.assert(\"Unknown mode\", false);\n\n\n            if(Math.abs(max_speedup - 1.0) < 0.1) {\n                returnarr.push(\"SpeedupHigherThanOne\");\n            }\n\n            \n            return returnarr;\n        }).linkMouse(layout._layout_clickable);\n        suggested_action.setHint(\"SpeedupHigherThanOne\", \"MapTiling\");\n\n        layout.setRect(\"SuggestedAction\", new Pos(70, 70), new Pos(30, 20), suggested_action);\n\n        layout.setRect(\"Efficiency\", new Pos(70, 20), new Pos(30, 20), new RU_DataViewNumberBlock().setTitle(\"Efficiency\").setOptions({\n            draw_bar: [\"left\"],\n            padding: { left: 10 },\n            display_title: true,\n            text_align: \"center\",\n        }).setDataAnalysisFunction(x => {\n            let efficiencies = x.data.efficiency;\n            let target_thread_num = max_func(efficiencies, y => y.thread_num);\n            \n            let efficiency = 0;\n            \n            if(toplevel_use_mean)\n                efficiency = MathHelper.mean(efficiencies.find(y => y.thread_num == target_thread_num).value);\n            else if(toplevel_use_median)\n                efficiency = MathHelper.median(efficiencies.find(y => y.thread_num == target_thread_num).value);\n            else ObjectHelper.assert(\"Unknown mode\", false);\n\n            return Math.round(100. * efficiency);\n        }).setColorScaling(x => 100 - x).setInformationFilePath(\"optimization_hints/efficiency.html\"));\n\n        let thread_graph = new RU_DataViewBarGraph({\n            type: 'bar',\n            yAxes: [{\n                type: \"linear\",\n                display: true,\n                position: 'left',\n                id: 'axis-1'\n            }\n            ]\n        }).setDataAnalysisFunction(x => {\n            let tcs = [];\n            if (x != null) {\n                tcs = x.data.map(x => x.data.cycles_per_thread);\n            }\n\n            let colors = RU_DataViewBarGraph.colorList().slice(0, tcs.length + 1);\n\n            let datasets = [];\n            // So now we have a mapping of thread -> cycles.\n            \n            if(all_analyses_global) {\n                let chunksize = Math.round(tcs.length / all_analyses.repcount);\n\n                // Just reset and it should be fine already\n                tcs = ObjectHelper.createChunks(tcs, chunksize, MathHelper.sumArray);\n            }\n\n            let i = 0;\n            for (let tc of tcs) {\n                datasets.push({ label: \"run \" + i.toString(), yAxisID: \"axis-1\", data: tc, backgroundColor: colors[i] });\n                i++;\n            }\n\n            let chartData = {\n                labels: [...Array(tcs[0].length).keys()],\n                \"datasets\": datasets,\n\n            };\n\n            return chartData;\n        }).linkMouse(layout._layout_clickable).changeGraphOptions(x => {\n            x.options.title.text = \"PAPI_TOT_CYC per thread\";\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').scaleLabel = { labelString: \"Cycles\", display: true };\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').ticks.beginAtZero = true;\n            x.options.scales.xAxes = [{ scaleLabel: { labelString: \"Thread\", display: true } }];\n        });\n\n        let efficiency_graph = new RU_DataViewBarGraph({\n            type: 'line',\n            yAxes: [{\n                type: \"linear\",\n                display: true,\n                position: 'left',\n                id: 'axis-1'\n            }, {\n                type: \"linear\",\n                display: true,\n                position: 'right',\n                id: 'axis-2'\n            }\n            ]\n        }).setDataAnalysisFunction(x => {\n            let critical_paths = [];\n            if (x != null) {\n                critical_paths = x.data.critical_paths;\n            }\n\n            let speedup = [];\n            if (x != null) {\n                speedup = x.data.speedup;\n            }\n\n            let efficiency = [];\n            if (x != null) {\n                efficiency = x.data.efficiency;\n            }\n\n            let colors = RU_DataViewBarGraph.colorList().slice(0, 4);\n\n            let datasets = [];\n\n            let graphcp = 0;\n            if(toplevel_use_mean) {\n                graphcp = critical_paths.map(cp => MathHelper.mean(cp.value));\n            }\n            else if(toplevel_use_median) {\n                graphcp = critical_paths.map(cp => MathHelper.median(cp.value));\n            }\n            else ObjectHelper.assert(\"Unknown mode\", false);\n\n            let i = 0;\n            // Add the critical paths\n            datasets.push({ label: \"Critical path\", fill: false, yAxisID: \"axis-1\", data: graphcp, backgroundColor: colors[0], borderColor: colors[0] });\n            \n            let agg_func = undefined;\n            if(toplevel_use_mean)\n                agg_func = x => MathHelper.mean(x);\n            else if(toplevel_use_median)\n                agg_func = x => MathHelper.median(x);\n            else\n                ObjectHelper.assert(\"undefined mode\", false);\n\n            // Add the speedup\n            datasets.push({ label: \"Speedup\", fill: false, yAxisID: \"axis-2\", data: speedup.map(sp => agg_func(sp.value)), backgroundColor: colors[1], borderColor: colors[1] });\n\n            datasets.push({ label: \"Efficiency\", fill: false, yAxisID: \"axis-2\", data: efficiency.map(sp => agg_func(sp.value)), backgroundColor: colors[2], borderColor: colors[2] });\n\n            let chartData = {\n                labels: critical_paths.map(x => x.thread_num),\n                \"datasets\": datasets,\n\n            };\n\n            return chartData;\n        }).linkMouse(layout._layout_clickable).changeGraphOptions(x => {\n            x.options.title.text = \"Parallel efficiency\";\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').scaleLabel = { labelString: \"Cycles\", display: true };\n            x.options.scales.yAxes.find(x => x.id == 'axis-1').ticks.beginAtZero = true;\n            x.options.scales.yAxes.find(x => x.id == 'axis-2').scaleLabel = { labelString: \"Relative Perf.\", display: true };\n            x.options.scales.yAxes.find(x => x.id == 'axis-2').ticks.beginAtZero = true;\n            x.options.scales.xAxes = [{ scaleLabel: { labelString: \"OMP_NUM_THREADS\", display: true } }];\n        }).setInformationFilePath(\"optimization_hints/efficiency.html\");\n\n\n        layout.setMultiviewRect(\"Graph\", new Pos(0, 50), new Pos(70, 50), [thread_graph, efficiency_graph]);\n\n        databinding[\"Imbalance\"] = targetsection_analysis;\n        databinding[\"SuggestedAction\"] = critical_path_analysis;\n        databinding[\"Efficiency\"] = critical_path_analysis;\n        databinding[\"Title\"] = new DataBlock({ fontsize: 32, text: \"Parallelization results\", color: \"black\", align: \"center\" }, \"Text\");\n\n        databinding['Graph'] = [all_analyses, critical_path_analysis];\n        databinding['PathInfo'] = critical_path_analysis;\n\n        this.dataparams = [targetsection_analysis, all_analyses, critical_path_analysis];\n        layout.setDataBinding(databinding);\n\n\n        this.button_subwindow.setLayout(layout);\n\n        this.setOnEnterHover(p => { this.color = \"#00FF00\"; this.button_subwindow_state = 'open'; })\n        this.setOnLeaveHover(p => { this.color = \"orange\"; if (!this.is_locked_open) this.button_subwindow_state = 'collapsed'; })\n        this.setOnClick((p, mb) => { this.is_locked_open = !this.is_locked_open; });\n\n        this.setDefaultDblClick();\n    }\n}\n\nexport { ParallelizationButton };"],"sourceRoot":""}
\ No newline at end of file
diff --git a/dist/main.js b/dist/main.js
deleted file mode 100755
index af66fdc6..00000000
--- a/dist/main.js
+++ /dev/null
@@ -1,3 +0,0 @@
-/*! For license information please see main.js.LICENSE.txt */
-(()=>{var __webpack_modules__={676:(e,t,n)=>{"use strict";function r(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}n.d(t,{Z:()=>r})},3349:(e,t,n)=>{"use strict";function r(e){if(void 0===e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return e}n.d(t,{Z:()=>r})},2137:(e,t,n)=>{"use strict";function r(e,t,n,r,i,a,o){try{var s=e[a](o),u=s.value}catch(e){return void n(e)}s.done?t(u):Promise.resolve(u).then(r,i)}function i(e){return function(){var t=this,n=arguments;return new Promise((function(i,a){var o=e.apply(t,n);function s(e){r(o,i,a,s,u,"next",e)}function u(e){r(o,i,a,s,u,"throw",e)}s(void 0)}))}}n.d(t,{Z:()=>i})},6610:(e,t,n)=>{"use strict";function r(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}n.d(t,{Z:()=>r})},3894:(e,t,n)=>{"use strict";n.d(t,{Z:()=>a});var r=n(4665);function i(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}function a(e,t,n){return(a=i()?Reflect.construct:function(e,t,n){var i=[null];i.push.apply(i,t);var a=new(Function.bind.apply(e,i));return n&&(0,r.Z)(a,n.prototype),a}).apply(null,arguments)}},5991:(e,t,n)=>{"use strict";function r(e,t){for(var n=0;n<t.length;n++){var r=t[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(e,r.key,r)}}function i(e,t,n){return t&&r(e.prototype,t),n&&r(e,n),e}n.d(t,{Z:()=>i})},6156:(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.d(t,{Z:()=>r})},6213:(e,t,n)=>{"use strict";n.d(t,{Z:()=>i});var r=n(7608);function i(e,t,n){return(i="undefined"!=typeof Reflect&&Reflect.get?Reflect.get:function(e,t,n){var i=function(e,t){for(;!Object.prototype.hasOwnProperty.call(e,t)&&null!==(e=(0,r.Z)(e)););return e}(e,t);if(i){var a=Object.getOwnPropertyDescriptor(i,t);return a.get?a.get.call(n):a.value}})(e,t,n||e)}},7608:(e,t,n)=>{"use strict";function r(e){return(r=Object.setPrototypeOf?Object.getPrototypeOf:function(e){return e.__proto__||Object.getPrototypeOf(e)})(e)}n.d(t,{Z:()=>r})},379:(e,t,n)=>{"use strict";n.d(t,{Z:()=>i});var r=n(4665);function i(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),t&&(0,r.Z)(e,t)}},6070:(e,t,n)=>{"use strict";n.d(t,{Z:()=>a});var r=n(484),i=n(3349);function a(e,t){return!t||"object"!==(0,r.Z)(t)&&"function"!=typeof t?(0,i.Z)(e):t}},4665:(e,t,n)=>{"use strict";function r(e,t){return(r=Object.setPrototypeOf||function(e,t){return e.__proto__=t,e})(e,t)}n.d(t,{Z:()=>r})},4699:(e,t,n)=>{"use strict";n.d(t,{Z:()=>i});var r=n(2961);function i(e,t){return function(e){if(Array.isArray(e))return e}(e)||function(e,t){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(e)){var n=[],r=!0,i=!1,a=void 0;try{for(var o,s=e[Symbol.iterator]();!(r=(o=s.next()).done)&&(n.push(o.value),!t||n.length!==t);r=!0);}catch(e){i=!0,a=e}finally{try{r||null==s.return||s.return()}finally{if(i)throw a}}return n}}(e,t)||(0,r.Z)(e,t)||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.")}()}},2465:(e,t,n)=>{"use strict";function r(e,t){return t||(t=e.slice(0)),Object.freeze(Object.defineProperties(e,{raw:{value:Object.freeze(t)}}))}n.d(t,{Z:()=>r})},7329:(e,t,n)=>{"use strict";n.d(t,{Z:()=>a});var r=n(676),i=n(2961);function a(e){return function(e){if(Array.isArray(e))return(0,r.Z)(e)}(e)||function(e){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(e))return Array.from(e)}(e)||(0,i.Z)(e)||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.")}()}},484:(e,t,n)=>{"use strict";function r(e){return(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)}n.d(t,{Z:()=>r})},2961:(e,t,n)=>{"use strict";n.d(t,{Z:()=>i});var r=n(676);function i(e,t){if(e){if("string"==typeof e)return(0,r.Z)(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?(0,r.Z)(e,t):void 0}}},7757:(e,t,n)=>{e.exports=n(5666)},1318:(e,t,n)=>{"use strict";n.d(t,{Vw:()=>p,tV:()=>h});var r=n(484),i=n(7329),a=n(2137),o=n(6610),s=n(5991),u=n(7757),l=n.n(u),c=n(4286);function f(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return d(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?d(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function d(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var p=function(){function e(){(0,o.Z)(this,e)}return(0,s.Z)(e,null,[{key:"stdev",value:function(e){return Math.sqrt(this.var(e))}},{key:"normalizedToHexByte",value:function(e){h.assert("Input is normalized",e>=0&&e<=255);var t=(255*e).toString(16).toUpperCase();return h.assert("Correct Length",1==t.length||2==t.length),2==t.length?t:"0"+t}},{key:"majority",value:function(e){h.assert("array valid",null!=e&&null!=e.length);var t,n={},r=f(e);try{for(r.s();!(t=r.n()).done;){var i=t.value;null==n[i]&&(n[i]=0),n[i]++}}catch(e){r.e(e)}finally{r.f()}for(var a=[],o=0,s=Object.keys(n);o<s.length;o++){var u=s[o],l=n[u];a.push([u,l])}return h.assert("a sensible",a.length>0),(0,c.max_func_obj)(a,(function(e){return e[1]}),(function(e){return e[0]}))}},{key:"corr",value:function(e,t){return this.cov(e,t)/(this.stdev(e)*this.stdev(t))}},{key:"sample_corr",value:function(e,t){var n=this.mean(e),r=this.mean(t);return this.sum(this.zip(e,t).map((function(e){return(e[0]-n)*(e[1]-r)})))/Math.sqrt(this.sum(e.map((function(e){return(e-n)*(e-n)})))*this.sum(t.map((function(e){return(e-r)*(e-r)}))))}},{key:"cov",value:function(e,t){for(var n=e.length,r=0;r<n;++r)for(var i=r+1;i<n;++i)e[r],e[i],t[r],t[i];return tmp/(n*n)}},{key:"var",value:function(e){var t=this.mean(e);return e.reduce((function(e,n){return e+Math.pow(n-t,2)}),0)/e.length}},{key:"mean",value:function(e){return 0!=e.length?this.sum(e)/e.length:0}},{key:"median",value:function(e){if(0!=e.length){var t=e.map((function(e){return new Number(e)}));t.sort((function(e,t){return e-t}));var n=t.length/2,r=t[n=Math.floor(n)];return r=new Number(r),h.assert("is_number",r instanceof Number),r}return 0}},{key:"sum",value:function(e){return h.assert("Input valid",null!=e&&null!=e),e.reduce((function(e,t){return Number(e)+Number(t)}),0)}},{key:"sumArray",value:function(e){var t,n=null,r=f(e);try{for(r.s();!(t=r.n()).done;){var i=t.value;if(null==n)n=i;else for(var a=0;a<n.length;++a)n[a]=n[a]+i[a]}}catch(e){r.e(e)}finally{r.f()}return n}},{key:"zip2d",value:function(e){if(e==[])return[];for(var t=[],n=e.length,r=e[0].length,i=0;i<r;++i){for(var a=[],o=0;o<n;++o)a.push(e[o][i]);t.push(a)}return t}},{key:"zip",value:function(e,t){for(var n=[],r=0;r<e.length;++r)n.push([e[r],t[r]]);return n}},{key:"unique",value:function(e){return e.filter((function(e,t,n){return n.indexOf(e)==t}))}}]),e}(),h=function(){function e(){(0,o.Z)(this,e)}var t,n,u;return(0,s.Z)(e,null,[{key:"createChunks",value:function(t,n){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:void 0;e.assert("chunksize valid",!isNaN(n)&&0!=n&&null!=n);var i=[];void 0===r&&(r=function(e){return e});for(var a=0;a<t.length;a+=n){var o=t.slice(a,a+n);i.push(r(o))}return i}},{key:"toUnicodeSuperscript",value:function(e){var t=["⁰","¹","²","³","⁴","⁵","⁶","⁷","⁸","⁹"],n="";0==(e=new Number(e))&&(n=t[0]);for(var r=parseInt(e.toFixed(0));r>0;r=~~(r/10))n=t[Math.round(r)%10]+n;return n}},{key:"toUnicodeSubscript",value:function(e){var t=["₀","₁","₂","₃","₄","₅","₆","₇","₈","₉"],n="";0==(e=new Number(e))&&(n=t[0]);for(var r=parseInt(e.toFixed(0));r>0;r=~~(r/10))n=t[Math.round(r)%10]+n;return n}},{key:"valueToSensibleString",value:function(t){var n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"scientific",r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"",i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:4;t=new Number(t);var a=0,o={0:"",1:"Ki",2:"Mi",3:"Gi",4:"Ti",5:"Pi"},s="";if("programmer"==n){for(;t>=1024;)t/=1024,++a;s=t.toFixed(i-1),s+=" "+o[a]+r}else if("scientific"==n){for(;t>=10;)t/=10,++a;s=t.toFixed(i-1),a.toString(),s+=" ⋅ 10"+e.toUnicodeSuperscript(a)}else if("fraction"==n){for(var u=1e-5,l=new Number(t),c=1;Math.abs(Math.round(l)-l)>u;)l*=10,c*=10;var f=function(e,t){if(e=Math.abs(Math.round(e)),(t=Math.abs(Math.round(t)))>e){var n=e;e=t,t=n}for(;e>=0&&t>=0;){if(0==t)return e;if(0==(e%=t))return t;t%=e}return 1},d=f(l,c);l/=d,c/=d;var p=e.toUnicodeSuperscript(l.toString()),h=e.toUnicodeSubscript(c.toString());s=p+"/"+h}else e.assert("unknown mode",!1);return s}},{key:"modifyingMapRecursive",value:function(t,n,r){if(!(null==t||null==t||t instanceof String||"string"==typeof t))if(t instanceof Array){var i,a=f(t);try{for(a.s();!(i=a.n()).done;){var o=i.value;e.modifyingMapRecursive(o,n,r)}}catch(e){a.e(e)}finally{a.f()}}else{var s=e.listKeys(t);if(null!=s){var u,l=f(s);try{for(l.s();!(u=l.n()).done;){var c=u.value;c==n?t[c]=r(t[c]):e.modifyingMapRecursive(t[c],n,r)}}catch(e){l.e(e)}finally{l.f()}}}}},{key:"valueFromPromise",value:(u=(0,a.Z)(l().mark((function e(t){var n;return l().wrap((function(e){for(;;)switch(e.prev=e.next){case 0:if(null==t.then){e.next=7;break}return e.next=3,t;case 3:return n=e.sent,e.abrupt("return",n);case 7:return e.abrupt("return",t);case 8:case"end":return e.stop()}}),e)}))),function(e){return u.apply(this,arguments)})},{key:"valueFromPromiseFull",value:(n=(0,a.Z)(l().mark((function t(n){var r;return l().wrap((function(t){for(;;)switch(t.prev=t.next){case 0:if(null==n.then){t.next=9;break}return t.next=3,n;case 3:return r=t.sent,t.next=6,e.valueFromPromiseFull(r);case 6:return t.abrupt("return",t.sent);case 9:return t.abrupt("return",n);case 10:case"end":return t.stop()}}),t)}))),function(e){return n.apply(this,arguments)})},{key:"waitArray",value:(t=(0,a.Z)(l().mark((function t(n){var r;return l().wrap((function(t){for(;;)switch(t.prev=t.next){case 0:r=0;case 1:if(!(r<n.length)){t.next=8;break}return t.next=4,e.valueFromPromise(n[r]);case 4:n[r]=t.sent;case 5:++r,t.next=1;break;case 8:return t.abrupt("return",n);case 9:case"end":return t.stop()}}),t)}))),function(e){return t.apply(this,arguments)})},{key:"arraysEqual",value:function(e,t){if(this.assert("1 is array",e instanceof Array),this.assert("2 is array",t instanceof Array),e.length!=t.length)return!1;for(var n=0;n<e.length;++n)if(e[n]!=t[n])return!1;return!0}},{key:"listKeys",value:function(e){for(var t=[],n=0,r=Object.keys(e);n<r.length;n++){var i=r[n];t.push(i)}return t}},{key:"merge",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(0==e.length)return[];var n,r=this.listKeys(e[0]),a={},o=f(r);try{for(o.s();!(n=o.n()).done;){var s=n.value;a[s]=void 0}}catch(e){o.e(e)}finally{o.f()}var u,l=f(e);try{for(l.s();!(u=l.n()).done;){var c,d=u.value,p=f(r);try{for(p.s();!(c=p.n()).done;){var h=c.value,m=d[h];if(m instanceof Array){var v;null==a[h]&&(a[h]=[]),(v=a[h]).push.apply(v,(0,i.Z)(m))}else{if(null==a[h]&&(a[h]=m),a[h]!=m&&(console.log("Different elements for key "+h+": "+a[h]+" vs "+m),null!=t[h])){a[h]=t[h](a[h],m);continue}this.assert("Same primitive values",a[h]==m)}}}catch(e){p.e(e)}finally{p.f()}}}catch(e){l.e(e)}finally{l.f()}return a}},{key:"mergeRecursive",value:function(t,n){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};if(null==t||null==t)return n;if(null==n||null==n)return t;if("string"==typeof t)return t;if(("array"==typeof t||t instanceof Array)&&("array"==typeof n||n instanceof Array))return n.every((function(e){return t.includes(e)}))?t:[].concat((0,i.Z)(t),(0,i.Z)(n));var a,o=t,s=e.listKeys(n),u=f(s);try{for(u.s();!(a=u.n()).done;){var l=a.value,c=n[l];if(null==r[l]){var d=o[l];o[l]=null==d?c:e.mergeRecursive(o[l],c)}else{var p=r[l];o[l]=p(o[l],c,r)}}}catch(e){u.e(e)}finally{u.f()}return o}},{key:"flatten",value:function(e){return[].concat.apply([],e)}},{key:"logObject",value:function(e,t){return null==t&&(t=e,e="(anon)"),console.log(e+": "+JSON.stringify(t))}},{key:"groupBy",value:function(t,n){var r,i={},a=f(t);try{for(a.s();!(r=a.n()).done;){var o=r.value;e.assert("key not undefined",void 0!==n(o)),e.listKeys(i).includes(n(o))?i[n(o)].push(o):i[n(o)]=[o]}}catch(e){a.e(e)}finally{a.f()}return Object.values(i)}},{key:"assert",value:function(e,t){if(!t)throw console.log('Assertion "'+e+'" failed'),console.trace(),window.alert("Assertion failed. Check console"),new Error}},{key:"stringify_circular",value:function(e){var t;return JSON.stringify(e,(t=new WeakSet,function(e,n){if("object"===(0,r.Z)(n)&&null!==n){if(t.has(n))return;t.add(n)}return n}))}}]),e}()},4286:(__unused_webpack_module,__webpack_exports__,__webpack_require__)=>{"use strict";__webpack_require__.r(__webpack_exports__),__webpack_require__.d(__webpack_exports__,{CanvasDrawManager:()=>CanvasDrawManager,Bracket:()=>Bracket,Button:()=>Button,Layout:()=>Layout,Pos:()=>Pos,min_func:()=>min_func,max_func:()=>max_func,max_func_obj:()=>max_func_obj,RU_DataView:()=>RU_DataView,RU_DataViewBarGraph:()=>RU_DataViewBarGraph,RU_DataViewFormLayout:()=>RU_DataViewFormLayout,RU_DataViewNumberBlock:()=>RU_DataViewNumberBlock,RU_DataViewSuggestedActionBlock:()=>RU_DataViewSuggestedActionBlock,RU_DataViewText:()=>RU_DataViewText,createImageDownload:()=>createImageDownload,DataBlock:()=>DataBlock});var _babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_9__=__webpack_require__(3349),_babel_runtime_helpers_get__WEBPACK_IMPORTED_MODULE_10__=__webpack_require__(6213),_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__=__webpack_require__(379),_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_1__=__webpack_require__(6070),_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__=__webpack_require__(7608),_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__=__webpack_require__(6610),_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__=__webpack_require__(5991),_babel_runtime_helpers_construct__WEBPACK_IMPORTED_MODULE_4__=__webpack_require__(3894),_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_5__=__webpack_require__(7329),_datahelper_js__WEBPACK_IMPORTED_MODULE_2__=__webpack_require__(1318),_windowing_js__WEBPACK_IMPORTED_MODULE_3__=__webpack_require__(2238);function _createSuper(e){var t=_isNativeReflectConstruct();return function(){var n,r=(0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__.Z)(e);if(t){var i=(0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__.Z)(this).constructor;n=Reflect.construct(r,arguments,i)}else n=r.apply(this,arguments);return(0,_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_1__.Z)(this,n)}}function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}function _createForOfIteratorHelper(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=_unsupportedIterableToArray(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function _unsupportedIterableToArray(e,t){if(e){if("string"==typeof e)return _arrayLikeToArray(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?_arrayLikeToArray(e,t):void 0}}function _arrayLikeToArray(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}function render_button_to_graphic(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"canvas_element",n=(e.constructor.name,document.createElement("canvas")),r=n.getContext("2d");n.width=e.button_subwindow.targetwidth,n.height=e.button_subwindow.targetheight;var i=(0,_babel_runtime_helpers_construct__WEBPACK_IMPORTED_MODULE_4__.Z)(e.constructor,[r].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_5__.Z)(e.dataparams)));i.button_subwindow_state="open",i.is_locked_open=!0,i.setFullyOpen();var a=new Bracket(r);a.setupEventListeners(),a.addButton(i),a.drawEx(new Pos(-20,0),new Pos(0,0),0,0,!0);var o=n.toDataURL("image/jpeg");return"canvas_element"===t?n:o}function createImageDownload(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"",n=document.createElement("canvas"),r=n.getContext("2d"),i=700,a=500,o=0,s=0;n.height=Object.entries(e).length*a;var u=Object.entries(e)[0][1];n.width=(1+u.buttons.length)*i,r.save(),r.fillStyle="white",r.fillRect(0,0,n.width,n.height),r.restore();for(var l=0,c=Object.entries(e);l<c.length;l++){var f=c[l],d=f[0],p=f[1];r.save(),r.textBaseline="middle",r.textAlign="center",r.font="60px Arial";var h=new Number(d),m=h>>16&65535,v=65535&h;r.fillText("Affected node "+m.toString()+"|"+v.toString(),i/2,o+a/2),r.restore();var y,g=i,_=_createForOfIteratorHelper(p.buttons);try{for(_.s();!(y=_.n()).done;){var b=y.value,x=render_button_to_graphic(b);r.drawImage(x,g,o),g+=i}}catch(e){_.e(e)}finally{_.f()}s=Math.max(s,g),o+=a,g=0}var w=n.toDataURL("image/jpeg"),E=document.createElement("a");E.setAttribute("href",w),E.setAttribute("download",t+"buttons.jpg"),E.style.display="none",document.body.appendChild(E),E.click(),document.body.removeChild(E)}function max_func(e,t){null==e&&console.trace("undefined parameter"),_datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("Array is non-empty",e.length>0);var n,r=t(e[0]),i=_createForOfIteratorHelper(e);try{for(i.s();!(n=i.n()).done;){var a=n.value,o=t(a);o>r&&(r=o)}}catch(e){i.e(e)}finally{i.f()}return r}function max_func_obj(e,t,n){if(0==e.length)return null;var r,i=n(e[0]),a=t(e[0]),o=_createForOfIteratorHelper(e);try{for(o.s();!(r=o.n()).done;){var s=r.value,u=t(s);u>a&&(a=u,i=n(s))}}catch(e){o.e(e)}finally{o.f()}return i}function min_func(e,t){var n,r=t(e[0]),i=_createForOfIteratorHelper(e);try{for(i.s();!(n=i.n()).done;){var a=n.value,o=t(a);o<r&&(r=o)}}catch(e){i.e(e)}finally{i.f()}return r}var Pos=function(){function e(t,n){(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,e),this.x=t,this.y=n}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(e,[{key:"toString",value:function(){return"("+this.x+", "+this.y+")"}},{key:"minus",value:function(t){return new e(this.x-t.x,this.y-t.y)}},{key:"plus",value:function(t){return new e(this.x+t.x,this.y+t.y)}},{key:"times",value:function(t){return new e(this.x*t.x,this.y*t.y)}},{key:"multiply",value:function(t){return new e(this.x*t,this.y*t)}},{key:"dist",value:function(){return Math.sqrt(this.x*this.x+this.y*this.y)}},{key:"inRect",value:function(e,t){return!(this.x<e.x||this.y<e.y||this.x>t.x||this.y>t.y)}}]),e}(),Clickable=function(){function e(){(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,e),this.children=Array(),this.onEnterHover=function(){return!1},this.onLeaveHover=function(){return!1},this.onClick=function(){return!1},this.onDoubleClick=function(){return!1},this.onMouseMove=function(){return!1},this.clickable_state="not_hovered",this.enable_func=function(){return!0}}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(e,[{key:"destroy",value:function(){this.children=[]}},{key:"addChild",value:function(e){this.children.push(e)}},{key:"addVIPChild",value:function(e){this.children.unshift(e)}},{key:"setEnableFunc",value:function(e){this.enable_func=e}},{key:"onUpdateDoubleClick",value:function(e,t){if(!this.enable_func())return!1;if(this.is_inside(e)&&this.onDoubleClick())return!0;var n,r=_createForOfIteratorHelper(this.children);try{for(r.s();!(n=r.n()).done;)if(n.value.onUpdateDoubleClick(e,t))return!0}catch(e){r.e(e)}finally{r.f()}return!1}},{key:"onUpdateClick",value:function(e,t){if(!this.enable_func())return!1;if(this.is_inside(e)&&this.onClick())return!0;var n,r=_createForOfIteratorHelper(this.children);try{for(r.s();!(n=r.n()).done;)if(n.value.onUpdateClick(e,t))return!0}catch(e){r.e(e)}finally{r.f()}return!1}},{key:"onUpdateMove",value:function(e){if(!this.enable_func())return!1;if(this.is_inside(e)){if(this.onMouseMove(e),"not_hovered"==this.clickable_state&&(this.clickable_state="hovered",this.onEnterHover(e)))return!0}else if("hovered"==this.clickable_state&&(this.clickable_state="not_hovered",this.onLeaveHover()))return!0;var t,n=_createForOfIteratorHelper(this.children);try{for(n.s();!(t=n.n()).done;)if(t.value.onUpdateMove(e))return!0}catch(e){n.e(e)}finally{n.f()}return!1}},{key:"is_inside",value:function(e){return console.log("Abstract function called (is_inside)"),!1}},{key:"setOnEnterHover",value:function(e){this.onEnterHover=e}},{key:"setOnLeaveHover",value:function(e){this.onLeaveHover=e}},{key:"setOnClick",value:function(e){this.onClick=e}},{key:"setOnDoubleClick",value:function(e){this.onDoubleClick=e}},{key:"setOnMouseMove",value:function(e){this.onMouseMove=e}}]),e}(),SubWindow=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(e,r,i,a,o){var s;return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),(s=t.call(this)).ctx=e,s.topleft=new Pos(r,i),s.targetwidth=a,s.targetheight=o,s._sizetrans=0,s.subwindow_trans_change=10,s.subwindow_popped_out=!1,s.layout=null,s.background_color="white",s}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"setLayout",value:function(e){return this.layout=e,this}},{key:"width",value:function(){return this.targetwidth*this._sizetrans/100}},{key:"height",value:function(){return this.targetheight*this._sizetrans/100}},{key:"draw",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;null!=e&&(this.topleft=e);var r=this.ctx;n&&(r=n),r.save(),r.beginPath(),r.strokeStyle="black",r.lineWidth=2;var i=r.fillStyle;r.fillStyle=this.background_color,r.rect(this.topleft.x,this.topleft.y,this.width(),this.height()),r.fill(),r.stroke(),r.fillStyle=i,"open"==t?(this._sizetrans+=this.subwindow_trans_change,this._sizetrans>100&&(this._sizetrans=100)):"collapsed"==t&&(this._sizetrans-=this.subwindow_trans_change,this._sizetrans<0&&(this._sizetrans=0)),null!=this.layout&&0!=this._sizetrans&&this.layout.draw(r),r.restore()}},{key:"is_inside",value:function(e){var t=e.minus(this.topleft);return!(t.x<0||t.y<0||t.x>this.width()||this.height())}}]),n}(Clickable),Button=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(e){var r;return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),(r=t.call(this)).ctx=e,r.state=0,r.update=0,r.color="orange",r.button_subwindow_state="collapsed",r.button_subwindow=new SubWindow(e,0,0,600,400),r.addChild(r.button_subwindow),r.is_locked_open=!1,r.topleft=new Pos(0,0),r.size=new Pos(0,0),r.button_image=null,r}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"setDefaultDblClick",value:function(){var e=this;this.setOnDoubleClick((function(t){var n=new _windowing_js__WEBPACK_IMPORTED_MODULE_3__.a(window);return n.setSenderData({className:e.constructor.name,dataParams:e.dataparams}),n.open("renderer_dir/subwindow.html","_blank")||(console.log("Failed to open subwindow"),alert("failed to open subwindow")),!0}))}},{key:"setFullyOpen",value:function(){this.button_subwindow_state="open",this.button_subwindow._sizetrans=100,this.is_locked_open=!0}},{key:"setButtonImage",value:function(e){var t=this,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:100;if(null==e)return this;this.button_image=new Image,this.button_image.src=e,this.button_image.onload=function(){var e=document.createElement("canvas"),r=e.getContext("2d");e.width=n,e.height=n,r.drawImage(t.button_image,0,0,n,n),t.button_image.src=e.toDataURL()}}},{key:"is_inside",value:function(e){var t=e.minus(this.topleft);return!(t.x<0||t.y<0||t.x>this.size.x||t.y>this.size.y)}},{key:"draw",value:function(e,t){this.update++;var n=new Date,r=this.ctx;if(this.topleft=e,this.size=t,this.button_subwindow.draw(e,this.button_subwindow_state),r.save(),r.beginPath(),null==this.button_image){if(0==this.state){var i=2*Math.PI/1e3,a=t.x/2,o=n.getMilliseconds(),s=Math.cos(i*o)*a,u=Math.sin(i*o)*a,l=r.createLinearGradient(e.x+a+s,e.y+a+u,e.x+a-s,e.y+a-u);l.addColorStop(0,this.color),l.addColorStop(1,"white"),r.fillStyle=l}r.strokeStyle="#000000",r.lineWidth=2,r.rect(e.x,e.y,t.x,t.y),r.stroke(),0==this.state&&r.fill()}else r.drawImage(this.button_image,e.x,e.y,t.x,t.y),r.strokeStyle="#000000",r.lineWidth=2,r.rect(e.x,e.y,t.x,t.y),r.stroke();r.restore(),e=null,t=null,n=null}}]),n}(Clickable),Layout=function(){function e(t){var n=this;(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,e),this.parent=t,this._layout={},this.databinding=null;var r=this;this._layout_clickable=new(function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),t.apply(this,arguments)}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"is_inside",value:function(e){for(var t=0,n=Object.keys(r._layout);t<n.length;t++){var i=n[t],a=r._layout[i],o=new Pos(r.parent.width()*a.size.x/100,r.parent.height()*a.size.y/100),s=r.parent.topleft.plus(a.topleft.times(new Pos(r.parent.width()/100,r.parent.height()/100)));if(s.x<e.x&&e.x<s.x+o.x&&s.y<e.y&&e.y<s.y+o.y)return this._tmp_hovered=i,this._mouse_pos=e,!0}return delete this._tmp_hovered,!1}}]),n}(Clickable)),this._layout_clickable.setOnClick((function(){var e=n._layout_clickable._tmp_hovered,t=n._layout[e],r=new Pos(n.parent.width()*t.size.x/100,n.parent.height()*t.size.y/100),i=n.parent.topleft.plus(t.topleft.times(new Pos(n.parent.width()/100,n.parent.height()/100))),a=n._layout_clickable._mouse_pos,o=n.getCurrentDataView(e);if(null!=o.information_button_pos&&o.information_button_pos.x<a.x&&o.information_button_pos.y<a.y&&o.information_button_pos.x+o.information_button_size.x>a.x&&o.information_button_pos.y+o.information_button_size.y>a.y)return console.log("Information Button clicked!"),o.showOptimizationHints(),!0;var s=i.x+r.x-20,u=i.x+r.x,l=i.y,c=i.y+20;return!!(t.is_multiview&&s<a.x&&a.x<u&&l<a.y&&a.y<c)&&(t.multiview_selector=(t.multiview_selector+1)%t.dataviews.length,!0)})),this._layout_clickable.setOnMouseMove((function(e){var t=n._layout_clickable._tmp_hovered;if(t)return n.getCurrentDataView(t).mouseInside(e),!0})),this._layout_clickable.setOnDoubleClick((function(){var e=n._layout_clickable._tmp_hovered,t=n._layout[e],r=new Pos(n.parent.width()*t.size.x/100,n.parent.height()*t.size.y/100),i=n.parent.topleft.plus(t.topleft.times(new Pos(n.parent.width()/100,n.parent.height()/100))),a=n._layout_clickable._mouse_pos,o=i.x+r.x-20,s=i.x+r.x,u=i.y,l=i.y+20;return t.is_multiview?!(o<a.x&&a.x<s&&u<a.y&&a.y<l||(t.dataviews[t.multiview_selector].openSettingsWindow(),0)):(t.dataview.openSettingsWindow(),!0)})),t.addVIPChild(this._layout_clickable)}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(e,[{key:"setEventHandlers",value:function(e,t,n){this._layout_clickable.setOnClick(e),this._layout_clickable.setOnEnterHover(t),this._layout_clickable.setOnLeaveHover(n)}},{key:"getCurrentDataView",value:function(e){var t=this._layout[e];return t.is_multiview?t.dataviews[t.multiview_selector]:t.dataview}},{key:"getLayoutObject",value:function(){for(var e={},t=0,n=Object.keys(this._layout);t<n.length;t++){var r=n[t];"dataview"!=r&&"dataviews"!=r&&(e[r]=this._layout[r])}return this._layout}},{key:"setRect",value:function(e,t,n,r){this._layout[e]={},this._layout[e].topleft=t,this._layout[e].size=n,this._layout[e].dataview=r}},{key:"setMultiviewRect",value:function(e,t,n,r){var i=this;if(r.length<1)alert("You cannot set a multiview with no contents!");else{this._layout[e]={},this._layout[e].topleft=t,this._layout[e].size=n,this._layout[e].dataviews=r,this._layout[e].is_multiview=!0,this._layout[e].multiview_selector=r.length-1;for(var a=function(t){var n=r[t];n instanceof RU_DataViewBarGraph&&n.dvbg_clickable.setEnableFunc((function(){return i._layout[e].multiview_selector==t}))},o=0;o<r.length;++o)a(o)}}},{key:"setDataBinding",value:function(e){this.databinding=e}},{key:"draw",value:function(e){for(var t=this.databinding,n=0,r=Object.keys(this._layout);n<r.length;n++){var i=r[n],a=this._layout[i],o=new Pos(this.parent.width()*a.size.x/100,this.parent.height()*a.size.y/100),s=this.parent.topleft.plus(a.topleft.times(new Pos(this.parent.width()/100,this.parent.height()/100))),u=null;null==(u=a.is_multiview?a.dataviews[a.multiview_selector]:a.dataview)&&console.log("Undefined dv for key "+i),u.setRect(s,o),a.is_multiview?(u.draw(e,t[i][a.multiview_selector],this.parent._sizetrans/100),e.save(),e.beginPath(),e.fillStyle="lime",e.rect(s.x+o.x-20,s.y,20,20),e.fill(),e.restore()):u.draw(e,t[i],this.parent._sizetrans/100)}}}]),e}(),DataBlock=function(){function e(t,n){(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,e),this.setData(t,n)}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(e,[{key:"setData",value:function(e,t){return this.data=e,this.datatype=t,this}}]),e}(),RU_DataView=function(){function RU_DataView(){(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,RU_DataView),this.topleft=null,this.size=null,this.analyze=function(e){return e},this.color_scaling_func=function(e){return e},this.update_data=!0,this.information_html_string="",this.information_overlay_age=0,this.information_overlay_alpha=0,this.information_overlay_timer=null,this.information_button_pos=null,this.information_button_size=null,this.optimization_hint_path="error"}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(RU_DataView,[{key:"setInformationFilePath",value:function(e){return this.optimization_hint_path=e,this}},{key:"showOptimizationHints",value:function(){console.log("Opening "+this.optimization_hint_path);var e=window.open(this.optimization_hint_path,"","width=800,height=600");return _datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("win valid",null!=e),this}},{key:"mouseInside",value:function(e){var t=this;_datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("pos valid",e),_datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("topleft valid",this.topleft),_datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("size valid",this.size);var n=e.minus(this.topleft.plus(new Pos(this.size.x/2,0))).dist();if(n<=30?(this.information_overlay_age=-1,window.clearTimeout(this.information_overlay_timer),this.information_overlay_timer=window.setTimeout((function(){return t.information_overlay_age=0}),3e3)):this.information_overlay_age=0,n<=10)this.information_overlay_alpha=1;else{var r=n/10;this.information_overlay_alpha=1/r}}},{key:"drawOverlay",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:1;this.information_overlay_age>=0&&(++this.information_overlay_age,this.information_overlay_age>1&&(this.information_overlay_alpha-=.05,this.information_overlay_alpha<0&&(this.information_overlay_alpha=0),this.information_overlay_age=0));var n=.9;n*=this.information_overlay_alpha;var r=1;r*=this.information_overlay_alpha;var i="🛈",a=18;e.save(),e.beginPath(),e.textAlign="center",e.textBaseline="top",e.font=Math.round(a*t)+"px sans-serif";var o=e.measureText(i).width,s=o;e.fillStyle="rgba(128, 128, 128, "+n+")",e.strokeStyle="rgba(128, 128, 128, "+r+")",this.information_button_pos=new Pos(this.topleft.x+(this.size.x-o)*t/2-o,this.topleft.y),this.information_button_size=new Pos(3*o,1.1*s),e.rect(this.information_button_pos.x,this.information_button_pos.y,this.information_button_size.x,this.information_button_size.y),e.fill(),e.stroke(),e.beginPath(),n=3*this.information_overlay_alpha,e.fillStyle="rgba(0, 0, 255, "+n+")";var u=this.topleft.x+this.size.x*t/2;e.fillText(i,u,this.topleft.y),e.restore()}},{key:"getSettingsDict",value:function(){return{analysis_func:{type:"code",value:this.analyze.toString(),description:"#TODO"}}}},{key:"setSettingsDict",value:function setSettingsDict(dict){var func=eval(dict.analysis_func.value.toString());_datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("Object type function",func instanceof Function),this.setDataAnalysisFunction(func),this.update_data=!0}},{key:"setInformationHTMLString",value:function(e){return this.information_html_string=e,this}},{key:"getInformationHTMLString",value:function(){return this.information_html_string}},{key:"openSettingsWindow",value:function(){var e=this,t=new _windowing_js__WEBPACK_IMPORTED_MODULE_3__.a(window);t.setCallback((function(n){"ClientOpened"==n.type?t.reply(n.source,n.origin,{type:"settings-data",data:e.getSettingsDict()}):"save-settings"==n.type?(e.setSettingsDict(n.data),console.log("Applied new settings")):console.log("Undefined operation reached! "+JSON.stringify(n))})),t.open("DataViewSettings.html","_blank")||alert("Failed to open child window...")}},{key:"setTitle",value:function(e){return this}},{key:"draw",value:function(e,t,n){console.log("Abstract function called")}},{key:"getSendableObject",value:function(){return this}},{key:"fromSendableObject",value:function(e){return console.log("Abstract function fromSendableObject() called"),this}},{key:"setDataAnalysisFunction",value:function(e){return this.analyze=e,this}},{key:"setRect",value:function(e,t){return this.topleft=e,this.size=t,this}},{key:"drawRect",value:function(e){e.beginPath(),e.rect(this.topleft.x,this.topleft.y,this.size.x,this.size.y),e.stroke()}}]),RU_DataView}(),RU_DataViewText=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),t.call(this)}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"fromSendableObject",value:function(e){return this}},{key:"draw",value:function(e,t,n){if(0!=n){e.save(),e.beginPath(),e.font=Math.round(n*t.data.fontsize).toString()+"px sans-serif",e.fillStyle=t.data.color,e.textAlign=t.data.align;var r=e.measureText("M").width;e.fillText(t.data.text,this.topleft.x+this.size.x/2,this.topleft.y+r),e.restore()}}}]),n}(RU_DataView),RU_DataViewBarGraph=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){var e,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null;(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n);var i="bar",a=void 0,o=void 0;(e=t.call(this)).dvbg_chart_data=null,null!=r&&(null!=r.type&&(i=r.type),null!=r.xAxes&&(a=r.xAxes),null!=r.yAxes&&(o=r.yAxes)),e.dvbg_canvas_scaler=document.createElement("div"),e.dvbg_canvas=document.createElement("canvas"),e.dvbg_ctx=e.dvbg_canvas.getContext("2d"),e.dvbg_canvas_scaler.appendChild(e.dvbg_canvas),document.body.appendChild(e.dvbg_canvas_scaler);var s={type:i,data:e.analyze(null),options:{responsive:!0,title:{display:!0,text:"Chart test..."},tooltips:{mode:"index",intersect:!0},scales:{}}};null!=a&&(s.options.scales.xAxes=a),null!=o&&(s.options.scales.yAxes=o),e.dvbg_chart=new Chart(e.dvbg_ctx,s),e.dvbg_canvas_scaler.style.visibility="hidden",e.dvbg_canvas_scaler.style.position="fixed";var u=(0,_babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_9__.Z)(e);return e.dvbg_clickable=new(function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),t.call(this)}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"is_inside",value:function(e){return null!=u.topleft&&u.topleft.x<e.x&&e.x<u.topleft.x+u.size.x&&u.topleft.y<e.y&&e.y<u.topleft.y+u.size.y}},{key:"onUpdateMove",value:function(e){if(!this.enable_func())return!1;if(!this.is_inside(e))return!1;var t=u.dvbg_canvas.getBoundingClientRect(),n=new MouseEvent("mousemove",{offsetX:e.x,offsetY:e.y,clientX:t.left+e.x-u.topleft.x,clientY:t.top+e.y-u.topleft.y});u.dvbg_canvas.dispatchEvent(n)}},{key:"onUpdateClick",value:function(e){if(!this.enable_func())return!1;if(!this.is_inside(e))return!1;var t=u.dvbg_canvas.getBoundingClientRect(),n=new MouseEvent("click",{offsetX:e.x,offsetY:e.y,clientX:t.left+e.x-u.topleft.x,clientY:t.top+e.y-u.topleft.y});u.dvbg_canvas.dispatchEvent(n)}}]),n}(Clickable)),e}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"getSettingsDict",value:function(){var e=(0,_babel_runtime_helpers_get__WEBPACK_IMPORTED_MODULE_10__.Z)((0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__.Z)(n.prototype),"getSettingsDict",this).call(this),t=this.dvbg_chart.options.scales.xAxes,r=this.dvbg_chart.options.scales.yAxes,i=t.some((function(e){return null==e||e.display})),a=r.some((function(e){return null==e||e.display})),o=this.dvbg_chart.options.legend.display;return e.graph_general_options={type:"group",value:{display_horizonal_axis:{type:"bool",value:i,description:"Display the horizontal axes"},display_vertical_axis:{type:"bool",value:a,description:"Display the vertical axes"},display_legend:{type:"bool",value:o,description:"Display the legend"}},description:"General graph display options"},e}},{key:"setSettingsDict",value:function(e){(0,_babel_runtime_helpers_get__WEBPACK_IMPORTED_MODULE_10__.Z)((0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__.Z)(n.prototype),"setSettingsDict",this).call(this,e);var t=e.graph_general_options.value,r=t.display_horizonal_axis.value,i=t.display_vertical_axis.value,a=t.display_legend.value;this.dvbg_chart.options.scales.xAxes.forEach((function(e){return e.display=r})),this.dvbg_chart.options.scales.yAxes.forEach((function(e){return e.display=i})),this.dvbg_chart.options.legend.display=a,this.dvbg_chart.update()}},{key:"getSendableObject",value:function(){var e={};return e.chartsettings=this.dvbg_chart.options,e.analyze=this.analyze.toString(),e}},{key:"fromSendableObject",value:function(e){return this.setDataAnalysisFunction(new Function(e.analyze)),this}},{key:"linkMouse",value:function(e){return e.addChild(this.dvbg_clickable),this}},{key:"changeGraphOptions",value:function(e){return e(this.dvbg_chart),this}},{key:"draw",value:function(e,t,n){if(0!=n){var r=this.prev_scale!=n;if(this.prev_scale=n,this.dvbg_canvas_scaler.style.height=Math.max(this.size.y*n,1)+"px",this.dvbg_canvas_scaler.style.width=Math.max(this.size.x*n,1)+"px",this.update_data){this.dvbg_chart_data=this.analyze(t);var i=JSON.parse(JSON.stringify(this.dvbg_chart_data));this.dvbg_chart.data=i,this.update_data=!1,this.dvbg_chart.update()}t==this.dvbg_cached_data||(this.dvbg_cached_data=t,this.dvbg_chart.update()),r&&this.dvbg_chart.resize(),e.save(),e.beginPath(),e.drawImage(this.dvbg_canvas,this.topleft.x,this.topleft.y,this.size.x,this.size.y),e.restore()}}}],[{key:"colorList",value:function(){var e=new Array;return e.push("rgba(255, 0, 0, 0.7)"),e.push("rgba(0, 128, 0, 0.7)"),e.push("rgba(0, 0, 255, 0.7)"),e.push("rgba(232, 173, 170, 0.7)"),e.push("rgba(0, 255, 255, 0.7)"),e.push("rgba(0, 0, 0, 0.7)"),e.push("rgba(16, 255, 255, 0.7)"),e.push("rgba(0, 255, 0, 0.7)"),e.push("rgba(255, 0, 255, 0.7)"),e.push("rgba(0, 0, 128, 0.7)"),e.push("rgba(128, 0, 128, 0.7)"),e.push("rgba(128, 128, 128, 0.7)"),e}}]),n}(RU_DataView),RU_DataViewNumberBlock=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){var e;return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),(e=t.call(this)).opt={display_title:!0,text_align:"center",draw_bar:void 0,padding:void 0},e.dvnb_cached_data=void 0,e}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"setTitle",value:function(e){return this.title=e,this}},{key:"setOptions",value:function(e){return this.opt=e,this}},{key:"setStringFormatter",value:function(e){this.stringformatter=e}},{key:"setColorScaling",value:function(e){return this.color_scaling_func=e,this}},{key:"draw",value:function(e,t,r){if(this.update_data&&(this.dvnb_cached_data=this.analyze(t),this.update_data=!1),0!=r){e.save(),e.beginPath(),e.textAlign="center",e.font=Math.round(16*r).toString()+"px sans-serif";var i=e.measureText("M").width,a=this.topleft.x+this.size.x/2,o=this.topleft.y+i;this.opt.display_title&&e.fillText(this.title,a,o);var s=this.dvnb_cached_data;e.beginPath(),e.textAlign=this.opt.text_align,e.font="bold "+(50*r).toString()+"px sans-serif",e.fillStyle=n.percent2color(this.color_scaling_func(s)),i=e.measureText("M").width,e.textBaseline="middle";var u=0;if(this.opt.padding&&this.opt.padding.left&&(u=this.opt.padding.left),"center"==this.opt.text_align?e.fillText(String(s)+"%",a+u,this.topleft.y+this.size.y/2):"left"==this.opt.text_align&&e.fillText(String(s)+"%",this.topleft.x+u,this.topleft.y+this.size.y/2),this.opt.draw_bar){var l,c=_createForOfIteratorHelper(this.opt.draw_bar);try{for(c.s();!(l=c.n()).done;)"left"==(a=l.value)?(e.beginPath(),e.strokeStyle="black",e.lineWidth=3,e.moveTo(this.topleft.x,this.topleft.y),e.lineTo(this.topleft.x,this.topleft.y+this.size.y*r),e.stroke()):console.log("#TODO: Implement this other DataViewNumberBlock bar: "+a)}catch(e){c.e(e)}finally{c.f()}}this.drawOverlay(e,r),e.restore()}}}],[{key:"percent2color",value:function(e){var t=2*Math.floor(2.55*e);return"#"+(e<=50?65280+65536*t:16711680+256*Math.round(255-t)).toString(16).padStart(6,"0")}}]),n}(RU_DataView),RU_DataViewSuggestedActionBlock=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){var e;(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),(e=t.call(this)).opt={};var r=(0,_babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_9__.Z)(e);return e.dvsa_clickable=new(function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),t.call(this)}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"is_inside",value:function(e){return null!=r.topleft&&r.topleft.x<e.x&&e.x<r.topleft.x+r.size.x&&r.topleft.y<e.y&&e.y<r.topleft.y+r.size.y}},{key:"getButtonIndex",value:function(e){var t=r.topleft.x,n=r.topleft.y,i=r.size.x,a=r.size.y,o=(r.heightpadding,e.x-t),s=e.y-n;if(o<0||o>i)return-1;if(s<0||s>a)return-1;var u=r.textheight+r.heightpadding;return Math.floor(s/u)}},{key:"onUpdateMove",value:function(e){if(!this.enable_func())return!1;if(!this.is_inside(e))return r.dvsa_button_hovered=-1,!1;var t=this.getButtonIndex(e);return r.buttonHovered(t),!0}},{key:"onUpdateClick",value:function(e){return!!this.enable_func()&&!!this.is_inside(e)}}]),n}(Clickable)),e.hints={},e.dvsab_cached_data=[],e.heightpadding=20,e}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"buttonHovered",value:function(e){this.dvsa_button_hovered=e}},{key:"setTitle",value:function(e){return this.title=e,this}},{key:"setHint",value:function(e,t){return this.hints[e]=t,this}},{key:"setOptions",value:function(e){return this.opt=e,this}},{key:"setStringFormatter",value:function(e){this.stringformatter=e}},{key:"linkMouse",value:function(e){return e.addChild(this.dvsa_clickable),this}},{key:"draw",value:function(e,t,n){if(this.update_data&&(this.dvsab_cached_data=this.analyze(t),_datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("Data evaluated to undefined",null!=this.dvsab_cached_data),this.update_data=!1),0!=n){e.save(),e.textAlign="center",e.textBaseline="middle",e.strokeStyle="black",e.lineWidth=3,e.font=Math.round(12*n).toString()+"px sans-serif";var r=e.measureText("M").width;this.textheight=r;var i,a=this.topleft.x+this.size.x/2,o=this.topleft.y+r,s=0,u=_createForOfIteratorHelper(this.dvsab_cached_data);try{for(u.s();!(i=u.n()).done;){var l=i.value,c=this.hints[l];e.beginPath(),s==this.dvsa_button_hovered?e.strokeStyle="red":e.strokeStyle="black",e.fillText(c,a,o),e.ellipse(a,o,this.size.x/2,(r+this.heightpadding/2)/2,0,0,2*Math.PI),e.stroke(),o+=(r+this.heightpadding)*n,++s}}catch(e){u.e(e)}finally{u.f()}this.drawOverlay(e,n),e.restore()}}}]),n}(RU_DataView),RU_DataViewFormLayout=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(){return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),t.call(this)}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"draw",value:function(e,t,n){if(0!=n){e.save(),e.beginPath();var r=this.analyze(t),i=r.fontsize,a=r.rows,o=r.padding,s=Math.round(i*n);e.font=s+"px sans-serif",max_func(a.map((function(e){return e.title})),(function(t){return e.measureText(t+": ").width}));var u,l=e.measureText("M").width,c=(max_func(a.map((function(e){return e.val})),(function(t){return e.measureText(t).width})),0),f=_createForOfIteratorHelper(a);try{for(f.s();!(u=f.n()).done;){var d=u.value,p=d.title,h=d.value;e.beginPath(),e.textAlign="left",e.fillText(p,this.topleft.x+o.left*n,this.topleft.y+o.top+(c+1)*(l+10)),e.beginPath(),e.textAlign="right",e.fillText(h,this.topleft.x+(this.size.x-o.right)*n,this.topleft.y+o.top+(c+1)*(l+10)),c++}}catch(e){f.e(e)}finally{f.f()}e.restore()}}}]),n}(RU_DataView),Bracket=function(e){(0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_8__.Z)(n,e);var t=_createSuper(n);function n(e){var r;return(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,n),(r=t.call(this)).ctx=e,r.buttons=[],r.start=new Pos(0,0),r.end=new Pos(0,0),r.offset=0,r.startoffset=0,r.listeners=[],r.button_alpha=1,r.bracket_alpha=1,r}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(n,[{key:"hide",value:function(){this.button_alpha=0,this.bracket_alpha=0}},{key:"show",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:1;this.button_alpha=e,this.bracket_alpha=e}},{key:"setupEventListeners",value:function(){var e=this,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0,n=(this.ctx.canvas,function(e){return e}),r=function(e){return e};null!=window.get_zoom&&(n=function(e){return e/window.get_zoom()},r=function(e){return e/window.get_zoom()}),null!=t&&(n=function(e){return t.mapPixelToCoordsX(e)},r=function(e){return t.mapPixelToCoordsY(e)});var i=function(t){e.onUpdateMove(new Pos(n(t.offsetX),r(t.offsetY)))},a=function(t){e.onUpdateClick(new Pos(n(t.offsetX),r(t.offsetY)),t.button)},o=function(t){e.onUpdateDoubleClick(new Pos(n(t.offsetX),r(t.offsetY)),t.button)};this.listeners.push(["mousemove",i]),this.listeners.push(["click",a]),this.listeners.push(["dblclick",o]);var s,u=this.ctx,l=_createForOfIteratorHelper(this.listeners);try{for(l.s();!(s=l.n()).done;){var c,f=s.value;(c=u.canvas).addEventListener.apply(c,(0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_5__.Z)(f))}}catch(e){l.e(e)}finally{l.f()}}},{key:"destroy",value:function(){(0,_babel_runtime_helpers_get__WEBPACK_IMPORTED_MODULE_10__.Z)((0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__.Z)(n.prototype),"destroy",this).call(this);var e,t=_createForOfIteratorHelper(this.listeners);try{for(t.s();!(e=t.n()).done;){var r,i=e.value;(r=this.ctx.canvas).removeEventListener.apply(r,(0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_5__.Z)(i))}}catch(e){t.e(e)}finally{t.f()}this.buttons=null,this.start=null,this.end=null,this.ctx=null}},{key:"drawEx",value:function(e,t,n,r,i,a){this.start=e,this.end=t,this.offset=n,this.startoffset=r,this.animate=i,this.updatefunc=a,this.draw()}},{key:"is_inside_buttons",value:function(e){if(0==this.button_alpha)return!1;var t,n=0,r=0,i=_createForOfIteratorHelper(this.buttons);try{for(i.s();!(t=i.n()).done;){var a=t.value;null==a?console.log("Undefined button!"):null==a.topleft&&console.log("Undefined topleft"),n=Math.max(a.topleft.x+a.size.x,n),r=Math.max(a.topleft.y+a.size.y,r)}}catch(e){i.e(e)}finally{i.f()}return!!e.inRect(this.start,new Pos(n,r))}},{key:"bracket_clicked",value:function(){0==this.button_alpha?this.button_alpha=1:this.button_alpha=0}},{key:"is_inside_bracket",value:function(e){return!(e.x<this.start.x+this.startoffset-5||e.x>this.start.x+this.offset+5||(e.y<this.start.y-5||e.y>this.end.y+5)&&(console.log("outside y"),1))}},{key:"is_inside",value:function(e){return this.is_inside_buttons(e)}},{key:"onUpdateClick",value:function(e,t){return this.is_inside_bracket(e,t)?(this.bracket_clicked(),!0):0!=this.button_alpha&&(0,_babel_runtime_helpers_get__WEBPACK_IMPORTED_MODULE_10__.Z)((0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__.Z)(n.prototype),"onUpdateClick",this).call(this,e,t)}},{key:"onUpdateDoubleClick",value:function(e,t){return this.is_inside_bracket(e,t)?(this.bracket_clicked(),!0):0!=this.button_alpha&&(0,_babel_runtime_helpers_get__WEBPACK_IMPORTED_MODULE_10__.Z)((0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_0__.Z)(n.prototype),"onUpdateDoubleClick",this).call(this,e,t)}},{key:"draw",value:function(){var e=this,t=this.start,n=this.end,r=this.offset,i=this.startoffset,a=this.ctx;this.animate&&null==this.updatefunc&&a.clearRect(0,0,a.canvas.width,a.canvas.height),a.save(),a.beginPath(),a.lineWidth=5,a.strokeStyle="rgba(0,0,255,"+this.bracket_alpha.toString()+")",a.moveTo(t.x+i,t.y),a.lineTo(t.x+r,t.y),a.stroke(),a.lineTo(t.x+r,n.y),a.stroke(),a.lineTo(n.x+i,n.y),a.stroke(),a.restore();var o=a.globalAlpha;if(a.globalAlpha=this.button_alpha,this.button_alpha>0&&this.drawButtons(new Pos(t.x+r+20,t.y)),a.globalAlpha=o,this.animate){var s=this;window.requestAnimationFrame((function(){null==e.updatefunc?s.draw():e.updatefunc()}))}}},{key:"drawButtons",value:function(e){var t=e.x,n=e.y;e=null;var r,i,a=0,o=_createForOfIteratorHelper(this.buttons);try{for(o.s();!(i=o.n()).done;){r=i.value;new Pos(t,n);var s,u=new Pos(t,n+a);"open"==r.button_subwindow_state&&(a-=35),s=u,r.draw(s,new Pos(30,30),this.ctx),t+=40}}catch(e){o.e(e)}finally{o.f()}}},{key:"addButton",value:function(e){this.buttons.push(e),this.addChild(e)}}]),n}(Clickable),_canvas_manager_counter=0,CanvasDrawManager=function(){function e(t,n){(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_6__.Z)(this,e),this.ctx=t,this.anim_id=null,this.drawables=[],this.ref_global_state=n,this.indices=[],this.request_scale=!1,this.scale_factor={x:1,y:1},this.last_scale_factor={x:1,y:1},this._destroying=!1,this.scale_origin={x:0,y:0},this.contention=0,this._svg=document.createElementNS("http://www.w3.org/2000/svg","svg"),this.user_transform=this._svg.createSVGMatrix(),this.addCtxTransformTracking()}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_7__.Z)(e,[{key:"svgPoint",value:function(e,t){var n=this._svg.createSVGPoint();return n.x=e,n.y=t,n}},{key:"applyUserTransform",value:function(){var e=this.user_transform;this.ctx.setTransform(e.a,e.b,e.c,e.d,e.e,e.f)}},{key:"translation",get:function(){return{x:this.user_transform.e,y:this.user_transform.f}}},{key:"addCtxTransformTracking",value:function(){var e=this,t=document.createElementNS("http://www.w3.org/2000/svg","svg");this.ctx._custom_transform_matrix=t.createSVGMatrix();var n=function(){console.assert(!isNaN(e.ctx._custom_transform_matrix.f))},r=this.ctx,i=r.scale;r.scale=function(e,t){return r._custom_transform_matrix=r._custom_transform_matrix.scaleNonUniform(e,t),n(),i.call(r,e,t)};var a=r.translate;r.translate=function(e,t){return r._custom_transform_matrix=r._custom_transform_matrix.translate(e,t),n(),a.call(r,e,t)};var o=r.rotate;r.rotate=function(e){return r._custom_transform_matrix=r._custom_transform_matrix.rotate(180*e/Math.PI),n(),o.call(r,e)};var s=r.scale;r.transform=function(e,i,a,o,u,l){var c=t.createSVGMatrix();return c.a=e,c.b=i,c.c=a,c.d=o,c.e=u,c.f=l,r._custom_transform_matrix=r._custom_transform_matrix.multiply(c),n(),s.call(r,e,i,a,o,u,l)};var u=r.setTransform;r.setTransform=function(e,t,i,a,o,s){return r._custom_transform_matrix.a=e,r._custom_transform_matrix.b=t,r._custom_transform_matrix.c=i,r._custom_transform_matrix.d=a,r._custom_transform_matrix.e=o,r._custom_transform_matrix.f=s,n(),u.call(r,e,t,i,a,o,s)},r.custom_inverseTransformMultiply=function(e,i){var a=t.createSVGPoint();return a.x=e,a.y=i,n(),a.matrixTransform(r._custom_transform_matrix.inverse())}}},{key:"destroy",value:function(){this._destroying=!0,this.clearDrawables()}},{key:"addDrawable",value:function(t){this.drawables.push(t),this.indices.push({c:e.counter(),d:t})}},{key:"removeDrawable",value:function(e){this.drawables=this.drawables.filter((function(t){return t!=e}))}},{key:"clearDrawables",value:function(){var e,t=_createForOfIteratorHelper(this.drawables);try{for(t.s();!(e=t.n()).done;)e.value.destroy()}catch(e){t.e(e)}finally{t.f()}this.drawables=[],this.indices=[]}},{key:"scale",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0,n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0;if(this.request_scale||Math.abs(e)<1e-4||this.contention>0)console.log("Blocking potential race");else{this.contention++,this.request_scale=!0,this.scale_origin.x=t,this.scale_origin.y=n,this.scale_factor.x+=e,this.scale_factor.y+=e,this.scale_factor.x=Math.max(.001,this.scale_factor.x),this.scale_factor.y=Math.max(.001,this.scale_factor.y);var r=e<0?.9:1.1,i=this.svgPoint(this.scale_origin.x,this.scale_origin.y).matrixTransform(this.user_transform.inverse());this.user_transform=this.user_transform.translate(i.x,i.y),this.user_transform=this.user_transform.scale(r,r,1,0,0,0),this.user_transform=this.user_transform.translate(-i.x,-i.y),this.contention--}}},{key:"translate",value:function(e,t){this.user_transform=this.user_transform.translate(e/this.user_transform.a,t/this.user_transform.d)}},{key:"mapPixelToCoordsX",value:function(e){return this.svgPoint(e,0).matrixTransform(this.user_transform.inverse()).x}},{key:"mapPixelToCoordsY",value:function(e){return this.svgPoint(0,e).matrixTransform(this.user_transform.inverse()).y}},{key:"getScale",value:function(){return _datahelper_js__WEBPACK_IMPORTED_MODULE_2__.tV.assert("Uniform scale",this.scale_factor.x==this.scale_factor.y),this.noJitter(this.scale_factor.x)}},{key:"getLastScale",value:function(){return this.noJitter(this.last_scale_factor.x)}},{key:"noJitter",value:function(e){return e=parseFloat(e.toFixed(3)),Math.round(100*e)/100}},{key:"draw",value:function(){if(!(this._destroying||this.contention>0)){this.contention+=1;var e=this.ctx;e.save(),e.setTransform(1,0,0,1,0,0),e.clearRect(0,0,e.canvas.width,e.canvas.height),e.restore(),this.request_scale&&1==this.contention?(this.mapPixelToCoordsX(this.scale_origin.x),this.mapPixelToCoordsY(this.scale_origin.y),this.applyUserTransform(),this.request_scale=!1):(this.mapPixelToCoordsX(this.scale_origin.x),this.mapPixelToCoordsY(this.scale_origin.y)),this.applyUserTransform(),this.ref_global_state.drawSDFG();var t,n=_createForOfIteratorHelper(this.drawables);try{for(n.s();!(t=n.n()).done;)t.value.draw()}catch(e){n.e(e)}finally{n.f()}this.contention-=1}}},{key:"draw_async",value:function(){var e=this;this.anim_id=window.requestAnimationFrame((function(){return e.draw()}))}}],[{key:"counter",value:function(){return _canvas_manager_counter++}}]),e}()},2238:(e,t,n)=>{"use strict";n.d(t,{a:()=>u});var r=n(6610),i=n(5991),a=n(1318);function o(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return s(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?s(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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,u=!1;return{s:function(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){u=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(u)throw a}}}}function s(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var u=function(){function e(t){var n=this;(0,r.Z)(this,e),this.parent=t,this.window=null,this.message_userdef=null,this._msg_func=function(e){return n.message(e)},this.parent.addEventListener("message",this._msg_func)}return(0,i.Z)(e,[{key:"open",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"",n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"",r=arguments.length>3&&void 0!==arguments[3]&&arguments[3];return this.window=parent.open(e,t,n+"width=800,height=600",r),this.window,this.window}},{key:"setCallback",value:function(e){this.message_userdef=e}},{key:"passMessage",value:function(e){return this.window.postMessage(e,"*")}},{key:"reply",value:function(e,t,n){return e!=this.window&&null!=this.window&&console.log("We do not talk to strangers"),this.passMessage(n)}},{key:"setSenderData",value:function(e){this.window_data=e}},{key:"destroy",value:function(){this.parent.removeEventListener("message",this._msg_func)}},{key:"serialize_dataview",value:function(e){return e.getSendableObject()}},{key:"serialize_array",value:function(e){var t,n=[],r=o(e);try{for(r.s();!(t=r.n()).done;){var i=t.value;n.push(this.serialize(i))}}catch(e){r.e(e)}finally{r.f()}return n}},{key:"serialize_function",value:function(e){return e.toString()}},{key:"serialize_default",value:function(e){if(null==e)return"";var t,n={},r=o(a.tV.listKeys(e));try{for(r.s();!(t=r.n()).done;){var i=t.value,s=e[i];n[i]=this.serialize(s)}}catch(e){r.e(e)}finally{r.f()}return n}},{key:"serialize",value:function(e){return e instanceof RU_DataView?this.serialize_dataview(e):e instanceof Array?this.serialize_array(e):e instanceof Object?this.serialize_default(e):"function"==typeof e?this.serialize_function(e):e}},{key:"message",value:function(e){var t=e.data;if(e.source==this.window)if("ClientOpened"==t.type)if(null==this.message_userdef){var n={type:"DisplayData",data:this.window_data};this.reply(e.source,e.origin,n)}else this.message_userdef(t);else"close"==t.type?(console.log("Parent received close message"),this.window.close(),this.destroy()):null!=this.message_userdef?this.message_userdef(t):console.log("Unknown type "+JSON.stringify(t))}}]),e}()},1154:(__unused_webpack_module,__webpack_exports__,__webpack_require__)=>{"use strict";__webpack_require__.d(__webpack_exports__,{C:()=>DIODE});var _babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_9__=__webpack_require__(484),_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__=__webpack_require__(7329),_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_0__=__webpack_require__(6156),_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_2__=__webpack_require__(6610),_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_5__=__webpack_require__(5991),_main__WEBPACK_IMPORTED_MODULE_1__=__webpack_require__(4316),_diode_appearance__WEBPACK_IMPORTED_MODULE_4__=__webpack_require__(816),_utils_sdfg_sdfg_parser__WEBPACK_IMPORTED_MODULE_7__=__webpack_require__(728),_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__=__webpack_require__(9018),_table__WEBPACK_IMPORTED_MODULE_6__=__webpack_require__(982),_diode_settings__WEBPACK_IMPORTED_MODULE_3__=__webpack_require__(5490),_diode_project__WEBPACK_IMPORTED_MODULE_11__=__webpack_require__(2992);function ownKeys(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);t&&(r=r.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),n.push.apply(n,r)}return n}function _objectSpread(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{};t%2?ownKeys(Object(n),!0).forEach((function(t){(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_0__.Z)(e,t,n[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(n)):ownKeys(Object(n)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(n,t))}))}return e}function _createForOfIteratorHelper(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=_unsupportedIterableToArray(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function _unsupportedIterableToArray(e,t){if(e){if("string"==typeof e)return _arrayLikeToArray(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?_arrayLikeToArray(e,t):void 0}}function _arrayLikeToArray(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var $=globalThis.$,DIODE=function(){function DIODE(){(0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_2__.Z)(this,DIODE),this._settings=new _diode_settings__WEBPACK_IMPORTED_MODULE_3__.y,this._debouncing={},this._background_projects=[],this._current_project=null,this._stale_data_button=null,this._shortcut_functions={},this._creation_counter=0,this._client_id=localStorage.getItem("diode_client_id"),null==this._client_id&&(this._client_id=this.getPseudorandom(),localStorage.setItem("diode_client_id",this._client_id)),this._appearance=new _diode_appearance__WEBPACK_IMPORTED_MODULE_4__.u(localStorage.getItem("DIODE/Appearance")),this._appearance.setOnChange((function(e){localStorage.setItem("DIODE/Appearance",JSON.stringify(e.toStorable()))}))}return(0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_5__.Z)(DIODE,[{key:"setupEvents",value:function(){var e=this;this.goldenlayout.eventHub.on(this.project().eventString("-req-show_stale_data_button"),(function(t){e.__impl_showStaleDataButton()})),this.goldenlayout.eventHub.on(this.project().eventString("-req-remove_stale_data_button"),(function(t){e.__impl_removeStaleDataButton()})),this.goldenlayout.eventHub.on(this.project().eventString("-req-show_loading"),(function(t){e.__impl_showIndeterminateLoading()})),this.goldenlayout.eventHub.on(this.project().eventString("-req-hide_loading"),(function(t){e.__impl_hideIndeterminateLoading()})),window.addEventListener("contextmenu",(function(t){console.log("contextmenu requested on",t.target),e.hint(t)}))}},{key:"getRunConfigs",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0,t=localStorage.getItem("diode_run_configs");if(t=null!=t?JSON.parse(t):[{"Configuration name":"default",Host:"localhost","Use SSH":!0,"SSH Key":this.pubSSH(),"SSH Key override":"",Instrumentation:"off","Number of threads":"[0]"}],null!=e){var n=t.filter((function(t){return t["Configuration name"]==e}));if(0!=n.length)return n[0];console.error("Could not find a configuration with that name",e)}return t}},{key:"addToRunConfigs",value:function(e){delete e["SSH Key"];var t,n=this.getRunConfigs(),r=0,i=_createForOfIteratorHelper(n);try{for(i.s();!(t=i.n()).done;){if(t.value["Configuration name"]==e["Configuration name"]){n[r]=e;break}++r}}catch(e){i.e(e)}finally{i.f()}r>=n.length&&n.push(e),n.sort((function(e,t){return e["Configuration name"].localeCompare(t["Configuration name"])})),localStorage.setItem("diode_run_configs",JSON.stringify(n))}},{key:"setCurrentRunConfig",value:function(e){sessionStorage.setItem("diode_current_run_config",e)}},{key:"getCurrentRunConfigName",value:function(){var e=sessionStorage.getItem("diode_current_run_config");return null==e?"default":e}},{key:"getCurrentRunConfig",value:function(){return this.getRunConfigs(this.getCurrentRunConfigName())}},{key:"applyCurrentRunConfig",value:function(){var e=this,t=this.getCurrentRunConfig(),n={};if(n=_objectSpread(_objectSpread({},n),{"execution/general/host":t.Host}),t["Use SSH"]){var r=/\S/.test(t["SSH Key override"])?" -i "+t["SSH Key override"]+" ":" ";n=_objectSpread(_objectSpread({},n),{"execution/general/execcmd":"ssh -oBatchMode=yes"+r+"${host} ${command}","execution/general/copycmd_r2l":"scp -B"+r+" ${host}:${srcfile} ${dstfile}","execution/general/copycmd_l2r":"scp -B"+r+" ${srcfile} ${host}:${dstfile}"})}else n=_objectSpread(_objectSpread({},n),{"execution/general/execcmd":"${command}","execution/general/copycmd_r2l":"cp ${srcfile} ${dstfile}","execution/general/copycmd_l2r":"cp ${srcfile} ${dstfile}"});return new Promise((function(r,i){var a=_objectSpread({client_id:e.getClientID()},n);(0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v1.0/preferences/set",a,(function(e){4===e.readyState&&200===e.status?r(t):0===e.status||(e.status+"_").startsWith("2")||i()}))}))}},{key:"pubSSH",value:function(){var e=localStorage.getItem("diode_pubSSH");if(null!=e)return e;(0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v1.0/getPubSSH/",void 0,(function(e){if(4===e.readyState&&200===e.status){var t=JSON.parse(e.response);if(null==t.error){var n=t.pubkey;localStorage.setItem("diode_pubSSH",n)}else alert(t.error)}}),"GET")}},{key:"hint",value:function(e){var t=function(e,t){var n=JSON.parse(e);$(t).w2overlay("<div><h2>Help for category "+n.type+"</h2>"+n.name+"</div>")},n=e.target,r=n.getAttribute("data-hint");if(null!=r)t(r,n),e.stopPropagation(),e.preventDefault(),console.log("Got hint data",r);else{if(!e.composed)return;var i,a=_createForOfIteratorHelper(e.composedPath());try{for(a.s();!(i=a.n()).done;){var o=i.value;if(null!=(r=null!=o.getAttribute?o.getAttribute("data-hint"):null)){t(r,o),e.stopPropagation(),e.preventDefault();break}}}catch(e){a.e(e)}finally{a.f()}}}},{key:"openUploader",value:function(){var e=this,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"";w2popup.open({title:"Upload a code file",body:'\n<div class="w2ui-centered upload_flexbox">\n    <label for="file-select" style="flex-grow: 1">\n        <div class="diode_uploader" id=\'upload_box\'>\n            <div class="uploader_text">\n                Drop file here or click to select a file\n            </div>\n        </div>\n    </label>\n    <input id="file-select" type="file"  accept=".py,.m,.sdfg" style="position:absolute;"/>\n</div>\n',buttons:"",showMax:!0});var n=$("#upload_box");if(0==n.length)throw"Error: Element not available";n=n[0];var r=function(n){"code-python"==t&&e.newFile(n)};(0,_main__WEBPACK_IMPORTED_MODULE_1__.Wj)(n,(function(e,t){console.log("upload mime",e),r(t),w2popup.close()}),null,{readMode:"text"});var i=$("#file-select");if(0==i.length)throw"Error: Element not available";(i=i[0]).style.opacity=0,i.addEventListener("change",(function(e){var t=i.files[0],n=new FileReader;n.onload=function(e){r(e.target.result),w2popup.close()},n.readAsText(t)}))}},{key:"getClientID",value:function(){return this._client_id}},{key:"initEnums",value:function(){this.getEnum("ScheduleType"),this.getEnum("StorageType"),this.getEnum("AccessType"),this.getEnum("Language")}},{key:"closeAll",value:function(){this.goldenlayout.root&&(this.goldenlayout.root.getItemsByFilter((function(e){return"component"==e.config.type})).forEach((function(e){return e.close()})),this.project().clearClosedWindowsList())}},{key:"addContentItem",value:function(e){if(e.componentName){var t=this.project()._closed_windows;this.project().setClosedWindowsList(t.filter((function(t){return t[0]!=e.componentName})))}var n=this.goldenlayout.root;if(n)if(0===n.contentItems.length)n.addChild({type:"row",content:[]}),this.addContentItem(e);else if(this.goldenlayout.isSubWindow)this.goldenlayout.eventHub.emit("create-window-in-main",JSON.stringify(e));else{var r,i=_createForOfIteratorHelper(n.contentItems);try{for(i.s();!(r=i.n()).done;){var a=r.value;if("stack"!=a.config.type)return void a.addChild(e)}}catch(e){i.e(e)}finally{i.f()}var o=n.contentItems[0].contentItems.map((function(e){return e.config}));n.contentItems[0].remove();var s,u=_createForOfIteratorHelper(o);try{for(u.s();!(s=u.n()).done;){var l=s.value;this.addContentItem(l)}}catch(e){u.e(e)}finally{u.f()}this.addContentItem(e)}}},{key:"newFile",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"";this.closeAll(),this.createNewProject();var t=this.getPseudorandom();"{"==e[0]&&1==e.split("\n").length&&(e=JSON.stringify(JSON.parse(e),null,2));var n={title:"Source Code",type:"component",componentName:"CodeInComponent",componentState:{created:t,code_content:e}};this.addContentItem(n),this.gatherProjectElementsAndCompile(this,{},{sdfg_over_code:!0})}},{key:"open_diode_settings",value:function(){var e={title:"Settings",type:"component",componentName:"SettingsComponent",componentState:{created:this.getPseudorandom()}};this.addContentItem(e)}},{key:"open_runqueue",value:function(){var e={title:"Run Queue",type:"component",componentName:"RunqueueComponent",componentState:{created:this.getPseudorandom()}};this.addContentItem(e)}},{key:"getEnum",value:function(e){var t=localStorage.getItem("Enumeration:"+e);return null==t||null==t?((0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v1.0/getEnum/"+e,void 0,(function(t){if(4===t.readyState&&200===t.status){console.log(e,t.response);var n=JSON.parse(t.response);"Language"==e&&n.enum.push("NoCode"),localStorage.setItem("Enumeration:"+e,JSON.stringify(n))}}),"GET"),null):JSON.parse(t).enum}},{key:"renderProperties",value:function(e,t,n,r){var i=this,a=arguments.length>4&&void 0!==arguments[4]?arguments[4]:void 0;if(null!=n){if(!Array.isArray(n)){var o=n,s=Object.keys(n).filter((function(e){return!e.startsWith("_meta_")})),u=(s=s.filter((function(e){return Object.keys(n).includes("_meta_"+e)}))).map((function(e){var r=JSON.parse(JSON.stringify(n["_meta_"+e]));return r.name=e,r.value=n[e],{property:r,category:r.category,element:o,data:t.data}}));n=u}if("string"==typeof e){var l=e;e={propertyChanged:function(e,t,n){i.project().request(["property-changed-"+l],(function(e){}),{timeout:200,params:{element:e,name:t,value:n,type:a?a.type:a}}),a&&"transformation"===a.type||i.refreshSDFG()},applyTransformation:function(){i.project().request(["apply-adv-transformation-"+l],(function(e){}),{timeout:200,params:null==a?void 0:a.apply_params})},locateTransformation:function(e,t,n){i.project().request(["locate-transformation-"+a.sdfg_name],(function(e){}),{timeout:200,params:JSON.stringify([e,t,n])})},project:function(){return i.project()}}}var c,f=new _table__WEBPACK_IMPORTED_MODULE_6__.i,d=f,p=null,h={},m=_createForOfIteratorHelper(n);try{for(m.s();!(c=m.n()).done;){var v=c.value,y=v.category;null==h[y]&&(h[y]=[]),h[y].push(v)}}catch(e){m.e(e)}finally{m.f()}DIODE.debugDevMode()||delete h["(Debug)"];for(var g=0,_=Object.entries(h);g<_.length;g++){var b=_[g],x=b[0],w=b[1].sort((function(e,t){return e.property.name.localeCompare(t.property.name)}));d=f;var E=document.createElement("span");E.innerText=x;var N=d.addRow(E);N.childNodes[0].colSpan="2",p=new _table__WEBPACK_IMPORTED_MODULE_6__.F(d,N);var S,M=_createForOfIteratorHelper(w);try{for(M.s();!(S=M.n()).done;){var k=S.value,O=document.createElement("span"),C=k.property;O.innerText=C.name,O.title=C.desc;var A=diode.getMatchingInput(e,C,k),T=d.addRow(O,A);null!=p&&p.addContentRow(T)}}catch(e){M.e(e)}finally{M.f()}}if(f.setCSSClass("diode_property_table"),a&&"transformation"==a.type){var I=document.createElement("span");I.classList="",I.innerText=a.opt_name,r.appendChild(I);var D=document.createElement("span");D.innerText="location_on",D.classList="material-icons",D.style="cursor: pointer;",D.addEventListener("click",(function(){e.locateTransformation(a.opt_name,a.pos,a.apply_params[0].affects)})),r.appendChild(D)}if(f.createIn(r),a&&"transformation"==a.type){var P=document.createElement("button");P.innerText="Apply advanced transformation",P.addEventListener("click",(function(e){P.disabled=!0,i.project().request(["apply-adv-transformation-"+a.sdfg_name],(function(e){}),{params:JSON.stringify(a.apply_params)})})),r.appendChild(P)}}else console.warn("renderProperties as nothing to render")}},{key:"create_visual_access_representation",value:function create_visual_access_representation(elems,data){var __access_indices=elems[0],__ranges=elems[1],__user_input=elems[2],__additional_defines={Min:"(...x) => Math.min(...x)",int_ceil:"(a,b) => Math.ceil(a/b)"},_iterator7=_createForOfIteratorHelper(__user_input),_step7;try{for(_iterator7.s();!(_step7=_iterator7.n()).done;){var x=_step7.value,_r=window.prompt("Enter a value for symbol "+x);if(null==_r)break;__additional_defines[x]=_r}}catch(e){_iterator7.e(e)}finally{_iterator7.f()}console.log("data",data),"Array"!=data.type&&console.warn("Non-Array accessed",data);var __mem_dims=data.attributes.shape;console.assert(null!=__mem_dims);var __eval_func=function __eval_func(){var __defs=Object.keys(__additional_defines).map((function(e){return"let "+e+" = "+__additional_defines[e]})).join(";")+";";__mem_dims=__mem_dims.map((function(x){return eval(__defs+x)}))};__eval_func();var __tbl_container=document.createElement("div"),__tbl_hor=document.createElement("div");__tbl_hor.classList="flex_row",__tbl_hor.style="flex-wrap: nowrap; justify-content: flex-start;";var __axis_x_info=document.createElement("div");__axis_x_info.classList="flex_row",__axis_x_info.style="justify-content: space-between;";for(var __i=0;__i<2;++__i){var __tmp=document.createElement("div");try{__tmp.innerText=0==__i?"0":__mem_dims[1]}catch(e){__tmp.innerText=0==__i?"Start":"End"}__axis_x_info.appendChild(__tmp)}var __axis_y_info=document.createElement("div");__axis_y_info.classList="flex_column",__axis_y_info.style="justify-content: space-between;";for(var _i2=0;_i2<2;++_i2){var _tmp=document.createElement("div");try{_tmp.innerText=0==_i2?"0":__mem_dims[0]}catch(e){_tmp.innerText=0==_i2?"Start":"End"}__axis_y_info.appendChild(_tmp)}var __tbl_vert=document.createElement("div");__tbl_vert.classList="flex_col",null!=data&&(__tbl_vert.appendChild(__axis_x_info),__tbl_hor.appendChild(__axis_y_info));var __size=10;__mem_dims.some((function(e){return e>128}))&&(__size=5),__mem_dims.length<2&&__mem_dims.push(1),console.log("access indices",__access_indices),console.log("ranges",__ranges);var __fixed_rngs=__ranges.map((function(e){return e})).sort((function(e,t){return e.depth-t.depth})).slice(1).reverse(),__var_rng=__ranges[0],__rng_inputs=[],__create_func=function(){return null},__main=function(e){return null!=e.main?e.main:e};return function(){var input_cont=document.createElement("div"),__defs=Object.keys(__additional_defines).map((function(e){return"let "+e+" = "+__additional_defines[e]})).join(";")+";",__global_slider=document.createElement("input");__global_slider.type="range",__global_slider.min="0",__global_slider.value="0",__global_slider.step="1",input_cont.appendChild(__global_slider);var __total_rng_count=1,__locked_range=!1;input_cont.classList="flex_column";var _iterator8=_createForOfIteratorHelper(__fixed_rngs),_step8;try{for(_iterator8.s();!(_step8=_iterator8.n()).done;){var __r=_step8.value,_lbl2=document.createElement("label"),_in2=document.createElement("input");_in2.type="number",_in2.min="0",_in2.step="1",_in2.addEventListener("change",(function(e){var t,n=0,r=1,i=_createForOfIteratorHelper(__rng_inputs.map((function(e){return e})).reverse());try{for(i.s();!(t=i.n()).done;){var a=t.value,o=parseInt(a.max)-parseInt(a.min)+1,s=a.value;n+=parseInt(s)*r,r*=parseInt(o)}}catch(e){i.e(e)}finally{i.f()}__global_slider.value=n,__create_func()}));try{_in2.min=eval(__defs+__main(__r.val.start))}catch(e){console.warn("Got error when resolving expression",e)}try{_in2.max=eval(__defs+__main(__r.val.end))}catch(e){console.warn("Got error when resolving expression",e)}try{_in2.value=eval(__defs+__main(__r.val.start))}catch(e){console.warn("Got error when resolving expression",e)}__defs+="let "+__r.var+" = "+__main(__r.val.start)+";",_lbl2.innerText="Range iterator "+__r.var+" over ["+__main(__r.val.start)+", "+__main(__r.val.end)+"] in steps of "+__main(__r.val.step),_in2.setAttribute("data-rname",__r.var),_lbl2.appendChild(_in2),__rng_inputs.push(_in2),input_cont.appendChild(_lbl2),0==__total_rng_count&&(__total_rng_count=1);var __e_size=function(__x){return eval(__defs+"("+__main(__x.val.end)+" - "+__main(__x.val.start)+"+1) / "+__main(__x.val.step))}(__r);0==__e_size||__locked_range?__locked_range=!0:__total_rng_count*=__e_size}}catch(e){_iterator8.e(e)}finally{_iterator8.f()}console.log("__total_rng_count",__total_rng_count),__global_slider.max=__total_rng_count-1,__global_slider.addEventListener("input",(function(e){var t,n=parseInt(__global_slider.value),r=_createForOfIteratorHelper(__rng_inputs.map((function(e){return e})).reverse());try{for(r.s();!(t=r.n()).done;){var i=t.value,a=parseInt(i.max)-parseInt(i.min)+1,o=n%a;i.value=o,n=Math.floor(n/a)}}catch(e){r.e(e)}finally{r.f()}}));var r=__var_rng,_lbl=document.createElement("label"),_in=document.createElement("span");__global_slider.addEventListener("input",(function(e){__create_func()})),_in.innerText="(whole range)",_lbl.innerText="Range iterator "+r.var+" over ["+__main(r.val.start)+", "+__main(r.val.end)+"] in steps of "+__main(r.val.step),_lbl.appendChild(_in),input_cont.appendChild(_lbl),__tbl_container.appendChild(input_cont)}(),__create_func=function __create_func(){__tbl_vert.innerHTML="",__tbl_vert.appendChild(__axis_x_info);var __all_fixed={};Object.assign(__all_fixed,__additional_defines);var _iterator11=_createForOfIteratorHelper(__rng_inputs),_step11;try{for(_iterator11.s();!(_step11=_iterator11.n()).done;){var i=_step11.value,rname=i.getAttribute("data-rname"),val=i.value;__all_fixed[rname]=val}}catch(e){_iterator11.e(e)}finally{_iterator11.f()}var __defstring=Object.keys(__all_fixed).map((function(e){return"let "+e+" = "+__all_fixed[e]+";"})).join(""),__ellision_thresh_y=64,__ellision_thresh_x=128,__mark_cells={};(function(){for(var feval=function feval(x){return eval(__defstring+x)},__it=__var_rng.var,__r_s=__main(__var_rng.val.start),__r_e=__main(__var_rng.val.end),__r_step=__main(__var_rng.val.step),_loop=function(e){var t=__access_indices.map((function(e,t){return[e,t]})).sort((function(e,t){return e[1]-t[1]})).map((function(e){return e[0]}));t=t.map((function(t){return feval("let "+__it+" = "+e+";"+t.var)})),null==__mark_cells[t[1]]&&(__mark_cells[t[1]]=[]),__mark_cells[t[1]].push(t[0])},__x=feval(__r_s);__x<=feval(__r_e);__x+=feval(__r_step))_loop(__x)})();for(var __dim_2=0;__dim_2<__mem_dims[0];++__dim_2)if(__mem_dims[0]>__ellision_thresh_y&&__dim_2>__ellision_thresh_y/2&&__dim_2<__mem_dims[0]-__ellision_thresh_y/2){if(__dim_2-1==__ellision_thresh_y/2){var _row=document.createElement("div");_row.classList="flex_row",_row.style="justify-content: flex-start;flex-wrap: nowrap;",_row.innerText="...",__tbl_vert.appendChild(_row)}}else{var __row=document.createElement("div");__row.classList="flex_row",__row.style="justify-content: flex-start;flex-wrap: nowrap;";for(var _i3=0;_i3<__mem_dims[1];++_i3)if(__mem_dims[1]>__ellision_thresh_x&&_i3>__ellision_thresh_x/2&&_i3<__mem_dims[1]-__ellision_thresh_x/2){if(_i3-1==__ellision_thresh_x/2){var _cell=document.createElement("div");_cell.style="line-height: 1px;",_cell.innerText="...",__row.appendChild(_cell)}}else{var __set_marking=!1,_tmp2=__mark_cells[__dim_2];null!=_tmp2&&_tmp2.includes(_i3)&&(__set_marking=!0);var __cell=document.createElement("div"),__colorstr="background: white;";__set_marking&&(__colorstr="background: red;"),__cell.style="min-width: "+__size+"px; min-height: "+__size+"px;border: 1px solid darkgray;"+__colorstr,__row.appendChild(__cell)}__tbl_vert.appendChild(__row)}__tbl_hor.appendChild(__tbl_vert)},__tbl_container.appendChild(__tbl_hor),__create_func(),__tbl_container}},{key:"create_visual_range_representation",value:function create_visual_range_representation(__starts,__ends,__steps,__tiles){var __mayfail=!(arguments.length>4&&void 0!==arguments[4])||arguments[4],__data=arguments.length>5&&void 0!==arguments[5]?arguments[5]:null,__obj_to_arr=function(e){return e instanceof Array?e:[e]};__starts=__obj_to_arr(__starts),__ends=__obj_to_arr(__ends),__steps=__obj_to_arr(__steps),__tiles=__obj_to_arr(__tiles);for(var __symbols={},__e_starts=[],__e_ends=[],__e_steps=[],__e_tiles=[],__e_sizes=[],__r_it=0;__r_it<__starts.length;++__r_it){for(var __start=__starts[__r_it],__end=__ends[__r_it],__step=__steps[__r_it],__tile=__tiles[__r_it],__e_start=null,__e_end=null,_e_step=null,_e_tile=null,_mem_dims=[];;){var __failed=!1,__symbol_setter=Object.entries(__symbols).map((function(e){return"let "+e[0]+"="+e[1]+";"})).join("");try{var Min=function(){return Math.min.apply(Math,arguments)},int_ceil=function(e,t){return Math.ceil(e/t)};if(__e_start=eval(__symbol_setter+__start),__e_end=eval(__symbol_setter+__end)+1,_e_step=eval(__symbol_setter+__step),_e_tile=eval(__symbol_setter+__tile),null!=__data){var __shapedims=__data.attributes.shape.length;_mem_dims=[];for(var __s=0;__s<__shapedims;++__s)_mem_dims.push(eval(__symbol_setter+__data.attributes.shape[__s]))}}catch(e){if(!(e instanceof ReferenceError))throw e;if(__mayfail){__failed=!0;break}var __sym_name=e.message.split(" ")[0],__ret=window.prompt("Enter a value for Symbol `"+__sym_name+"`");if(null==__ret)throw e;__symbols[__sym_name]=parseInt(__ret),__failed=!0}if(!__failed)break}var _e_size=__e_end-__e_start;__e_starts.push(__e_start),__e_ends.push(__e_end),__e_steps.push(_e_step),__e_tiles.push(_e_tile),__e_sizes.push(_e_size)}var __tbl_container=document.createElement("div"),__tbl_hor=document.createElement("div");__tbl_hor.classList="flex_row",__tbl_hor.style="flex-wrap: nowrap;";var __axis_x_info=document.createElement("div");__axis_x_info.classList="flex_row",__axis_x_info.style="justify-content: space-between;";for(var __i=0;__i<2;++__i){var __tmp=document.createElement("div");try{__tmp.innerText=0==__i?"0":__mem_dims[1]}catch(e){__tmp.innerText=0==__i?"Start":"End"}__axis_x_info.appendChild(__tmp)}var __axis_y_info=document.createElement("div");__axis_y_info.classList="flex_column",__axis_y_info.style="justify-content: space-between;";for(var _i4=0;_i4<2;++_i4){var _tmp3=document.createElement("div");try{_tmp3.innerText=0==_i4?"0":__mem_dims[0]}catch(e){_tmp3.innerText=0==_i4?"Start":"End"}__axis_y_info.appendChild(_tmp3)}null!=__data&&(__tbl_container.appendChild(__axis_x_info),__tbl_hor.appendChild(__axis_y_info));var __row=document.createElement("div");__row.classList="flex_row",__row.style="justify-content: flex-start;flex-wrap: nowrap;";var __size=10,__e_size=__e_sizes[0],__e_step=__e_steps[0],__e_tile=__e_tiles[0];__e_size>512&&(__size=5);for(var _i5=0;_i5<__e_size;++_i5){var __cell=document.createElement("div"),__colorstr="background: white;";Math.floor(_i5/__e_step)%2==0?_i5%__e_step<__e_tile&&(__colorstr="background: SpringGreen;"):_i5%__e_step<__e_tile&&(__colorstr="background: Darkorange;"),__cell.style="min-width: "+__size+"px; min-height: "+__size+"px;border: 1px solid black;"+__colorstr,__row.appendChild(__cell)}return __tbl_hor.appendChild(__row),__tbl_container.appendChild(__tbl_hor),__tbl_container}},{key:"getMatchingInput",value:function getMatchingInput(transthis,x,node){var _this5=this,create_language_input=function(e,t){null==e&&(e=x.value),null==t&&(t=function(e){transthis.propertyChanged(node,x.name,e.value)});var n=_this5.getEnum("Language"),r=e;return n.includes(r)||(r="Language."+r),_main__WEBPACK_IMPORTED_MODULE_1__.qu.createSelectInput("prop_"+x.name,t,n,r)},__resolve_initials=function __resolve_initials(__initials,__syms){delete window.i,__initials=__initials.filter((function(e){return isNaN(e.var)}));for(var __merger=function(e,t){var n,r=e.map((function(e){return e})),i=_createForOfIteratorHelper(t);try{var a=function(){var e=n.value;if(r.filter((function(t){return t==e||null!=t.var&&JSON.stringify(t.var)==JSON.stringify(e.var)})).length>0)return"continue";r.push(e)};for(i.s();!(n=i.n()).done;)a()}catch(e){i.e(e)}finally{i.f()}return r},__needed_defs=[],__placeholder_defines=[],__user_input_needed=[];;){var __retry=!1,__placeholder_def_str=__placeholder_defines.map((function(e){return"let "+e+" = 1"})).join(";");__placeholder_def_str+=";let Min = (...e) => Math.min(...e); let int_ceil = (a, b) => Math.ceil(a/b);";var _iterator13=_createForOfIteratorHelper(__initials),_step13;try{for(_iterator13.s();!(_step13=_iterator13.n()).done;){var __i=_step13.value;try{var __test=eval(__placeholder_def_str+__i.var)}catch(e){if(!(e instanceof ReferenceError))throw e;var _ret2=function(){var t=e.message.split(" ")[0],n=__syms.filter((function(e){return e.var==t&&null!=e.val}));if(n.length>0){__placeholder_defines.push(t),__needed_defs=__merger(__needed_defs,[n[0]]);for(var r=0;r<__syms.length&&JSON.stringify(__syms[r])!=JSON.stringify(n[0]);++r);var i=function(e){return null!=e.main?e.main:e};if(null!=n[0].val&&null!=n[0].val.start){var a=__resolve_initials([{var:i(n[0].val.start),val:null}],__syms.slice(r));__needed_defs=__merger(__needed_defs,a[1]),__user_input_needed=__merger(__user_input_needed,a[2]),a=__resolve_initials([{var:i(n[0].val.end),val:null}],__syms.slice(r)),__needed_defs=__merger(__needed_defs,a[1]),__user_input_needed=__merger(__user_input_needed,a[2]),a=__resolve_initials([{var:i(n[0].val.step),val:null}],__syms.slice(r)),__needed_defs=__merger(__needed_defs,a[1]),__user_input_needed=__merger(__user_input_needed,a[2]),a=__resolve_initials([{var:i(n[0].val.tile),val:null}],__syms.slice(r)),__needed_defs=__merger(__needed_defs,a[1]),__user_input_needed=__merger(__user_input_needed,a[2])}else{var o=__resolve_initials([{var:i(n[0].val),val:null}],__syms.slice(r));console.log("rec",o),__needed_defs=__merger(__needed_defs,o[1]),__user_input_needed=__merger(__user_input_needed,o[2])}}else __user_input_needed.push(t),__placeholder_defines.push(t);return __retry=!0,"break"}();if("break"===_ret2)break}if(__retry)break}}catch(e){_iterator13.e(e)}finally{_iterator13.f()}if(!__retry)break}return[__initials,__needed_defs,__user_input_needed]},create_index_subset_input=function(e,t,n){var r=document.createElement("div");if(void 0===n.data)return $(r);var i,a="[",o=_createForOfIteratorHelper(t.value.indices);try{for(o.s();!(i=o.n()).done;)a+=i.value+", "}catch(e){o.e(e)}finally{o.f()}a=a.slice(0,-2)+"]",r.innerText=a+"  ";var s=document.createElement("button");return s.style.float="right",s.innerText="Edit",r.appendChild(s),s.addEventListener("click",(function(r){_this5.project().request(["sdfg_object"],(function(r){for(var i=r.sdfg_object,a=[],o=0,s=Object.values(i);o<s.length;o++){var u=s[o],l=_utils_sdfg_sdfg_parser__WEBPACK_IMPORTED_MODULE_7__.E8.lookup_symbols(u,n.state_id,n.node_id,null);a=[].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__.Z)(a),(0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__.Z)(l)),console.log("syms",a)}var c,f=[],d=_createForOfIteratorHelper(a);try{for(d.s();!(c=d.n()).done;){var p=c.value;if(null!=p.val)break;f.push(p)}}catch(e){d.e(e)}finally{d.f()}var h=__resolve_initials(f,a);console.log("newelems",h);for(var m=n.data().props.filter((function(e){return"data"==e.name}))[0],v=[],y=0,g=Object.values(i);y<g.length;y++){var _=g[y];v.push(_.attributes._arrays[m.value])}(v=v.filter((function(e){return null!=e}))).length>0&&(m=v[0]);var b=document.createElement("div"),x=document.createElement("div"),w=document.createElement("input");w.type="text",w.value=JSON.stringify(t.value);var E=_this5.create_visual_access_representation(h,m),N=document.createElement("button");N.innerText="Apply changes",N.addEventListener("click",(function(r){e.propertyChanged(n,t.name,JSON.parse(w.value)),w2popup.close()})),x.appendChild(w),x.appendChild(E),b.appendChild(x),w2popup.open({title:"Data access / Indices property",body:b,buttons:N,width:1280,height:800})}),{})})),$(r)},create_range_input=function(e,t,n){var r=null;if(null!=n.data){var i=n.data().props.filter((function(e){return"data"==e.name}));i.length>0&&(r=i[0])}var a,o=document.createElement("div"),s=t.value.ranges,u=document.createElement("div"),l="[",c=_createForOfIteratorHelper(s);try{for(c.s();!(a=c.n()).done;){var f=a.value;l+=f.start+".."+f.end,1!=f.step?(l+=":"+f.step,1!=f.tile&&(l+=":"+f.tile)):1!=f.tile&&(l+="::"+f.tile),l+=", "}}catch(e){c.e(e)}finally{c.f()}l=l.slice(0,-2)+"]",o.innerText=l+"  ";var d=document.createElement("button");d.style.float="right",d.innerText="Edit",o.appendChild(d);var p,h=document.createElement("div"),m=[],v=_createForOfIteratorHelper(s);try{for(v.s();!(p=v.n()).done;){var y=p.value,g=document.createElement("div");g.classList="flex_row",g.style="flex-wrap: nowrap;","string"!=typeof y.start&&(y.start=y.start.main),"string"!=typeof y.end&&(y.end=y.end.main),"string"!=typeof y.step&&(y.step=y.step.main),"string"!=typeof y.tile&&(y.tile=y.tile.main),function(){for(var e=[],t=0;t<4;++t){var n=document.createElement("label"),i=document.createElement("input");switch(i.style="width:100px;",i.type="text",t){case 0:i.value=y.start,n.textContent="Start";break;case 1:i.value=y.end,n.textContent="End";break;case 2:i.value=y.step,n.textContent="Step";break;case 3:i.value=y.tile,n.textContent="Tile"}e.push(i),n.appendChild(i),g.appendChild(n)}m.push(e);var a=document.createElement("div");a.style="min-width: 200px; min-height: 1rem;flex-grow: 1;display: flex;",a.addEventListener("click",(function(){if(null!=r)_this5.project().request(["sdfg_object"],(function(t){t="object"===(0,_babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_9__.Z)(t.sdfg_object)?t.sdfg_object:JSON.parse(t.sdfg_object),console.log("got sdfg object",t);for(var n=[],i=0,o=Object.values(t);i<o.length;i++){var s=o[i];n.push(s.attributes._arrays[r.value])}(n=n.filter((function(e){return null!=e}))).length>0&&(r=n[0]);var u=_this5.create_visual_range_representation.apply(_this5,(0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__.Z)(e.map((function(e){return e.value}))).concat([!1,r]));a.innerHTML="",a.appendChild(u)}),{});else{var t=_this5.create_visual_range_representation.apply(_this5,(0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__.Z)(e.map((function(e){return e.value}))).concat([!1,r]));a.innerHTML="",a.appendChild(t)}})),a.innerText="Click here for visual representation",g.appendChild(a)}(),h.appendChild(g)}}catch(e){v.e(e)}finally{v.f()}u.appendChild(h);var _=document.createElement("button");return _.innerText="Apply",_.addEventListener("click",(function(){var r,i={ranges:[],type:t.value.type},a=_createForOfIteratorHelper(m);try{for(a.s();!(r=a.n()).done;){var o=r.value;i.ranges.push({start:o[0].value,end:o[1].value,step:o[2].value,tile:o[3].value})}}catch(e){a.e(e)}finally{a.f()}e.propertyChanged(n,t.name,i),w2popup.close()})),d.onclick=function(){w2popup.open({title:"Range property",body:u,buttons:_,width:1280,height:800})},$(o)},elem=document.createElement("div");if("bool"==x.metatype){var val=x.value;"string"==typeof val&&(val="True"==val),elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createToggleSwitch("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.checked)}),val)}else if("str"==x.metatype||"float"==x.metatype||"LambdaProperty"==x.metatype||"Property"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createTextInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),x.value);else if("tuple"==x.metatype||"dict"==x.metatype||"list"==x.metatype||"set"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createTextInput("prop_"+x.name,(function(e){var t=e.value;try{t=JSON.parse(e.value)}catch(n){t=e.value}transthis.propertyChanged(node,x.name,t)}),JSON.stringify(x.value));else if("Range"==x.metatype)elem=create_range_input(transthis,x,node);else if("DataProperty"==x.metatype){elem=document.createElement("span"),elem.innerText=x.value,elem=$(elem);var cb=function(e){var t=node.sdfg.attributes._arrays,n=Object.keys(t),r=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createComboboxInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),n,x.value);elem[0].parentNode.replaceChild(r[0],elem[0])};this.project().request(["sdfg_object"],cb,{on_timeout:cb,timeout:300})}else if("LibraryImplementationProperty"==x.metatype)elem=document.createElement("span"),elem.innerText=x.value,elem=$(elem),$.getJSON("/dace/api/v1.0/getLibImpl/"+node.element.classpath,(function(e){var t=function(t){var n=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createComboboxInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),e,x.value),r=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createButton("prop_"+x.name+"_expand",(function(e){(0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v1.0/expand/",{sdfg:node.sdfg,nodeid:[node.sdfg.sdfg_list_id,node.element.parent_id,node.element.id]},(function(e){if(4===e.readyState&&200===e.status){var t=(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.a)(e.response);void 0!==t.error&&_this5.handleErrors(_this5,t),_this5.project().request(["append-history"],(function(e){}),{params:{new_sdfg:t.sdfg,item_name:"Expand "+node.element.label}})}}))}),"Expand");elem[0].parentNode.replaceChild(n[0],elem[0]),n[0].parentNode.appendChild(r[0])};_this5.project().request(["sdfg_object"],t,{on_timeout:t,timeout:300})}));else{if("CodeProperty"==x.metatype||"CodeBlock"==x.metatype){var codeelem=null,langelem=null,onchange=function(e){transthis.propertyChanged(node,x.name,{string_data:codeelem[0].value,language:langelem[0].value})};return null==x.value&&(x.value={},x.value.language="NoCode",x.value.string_data=""),codeelem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createLongTextInput("prop_"+x.name,onchange,x.value.string_data),elem.appendChild(codeelem[0]),langelem=create_language_input(x.value.language,onchange),elem.appendChild(langelem[0]),elem.classList.add("flex_column"),elem}if("int"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createIntInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,parseInt(e.value))}),x.value);else if("ScheduleType"==x.metatype){var schedule_types=this.getEnum("ScheduleType"),qualified=x.value;schedule_types.includes(qualified)||(qualified="ScheduleType."+qualified),elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createSelectInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),schedule_types,qualified)}else if("AllocationLifetime"==x.metatype){var types=this.getEnum("AllocationLifetime"),_qualified=x.value;types.includes(_qualified)||(_qualified="AllocationLifetime."+_qualified),elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createSelectInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),types,_qualified)}else if("AccessType"==x.metatype){var access_types=this.getEnum("AccessType"),_qualified2=x.value;access_types.includes(_qualified2)||(_qualified2="AccessType."+_qualified2),elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createSelectInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),access_types,_qualified2)}else if("Language"==x.metatype)elem=create_language_input();else{if("None"==x.metatype)return console.log("Property with type 'None' ignored",x),elem;if("object"==x.metatype&&"identity"==x.name)return elem;if("OrderedDiGraph"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createTextInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),x.value);else if("DebugInfo"==x.metatype){var info_obj=x.value;"string"==typeof info_obj&&(info_obj=JSON.parse(info_obj)),elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createCodeReference("prop_"+x.name,(function(e){transthis.project().request(["highlight-code"],(function(e){}),{params:info_obj})}),info_obj)}else if("ListProperty"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createTextInput("prop_"+x.name,(function(e){var t=e.value;try{t=JSON.parse(e.value)}catch(n){t=e.value}transthis.propertyChanged(node,x.name,t)}),JSON.stringify(x.value));else if("StorageType"==x.metatype){var storage_types=this.getEnum("StorageType"),_qualified3=x.value;storage_types.includes(_qualified3)||(_qualified3="StorageType."+_qualified3),elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createSelectInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),storage_types,_qualified3)}else if("InstrumentationType"==x.metatype){var _storage_types=this.getEnum("InstrumentationType"),_qualified4=x.value;_storage_types.includes(_qualified4)||(_qualified4="InstrumentationType."+_qualified4),elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createSelectInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),_storage_types,_qualified4)}else if("typeclass"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createTextInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),x.value);else if("hosttype"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createHostInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),DIODE.getHostList(),x.value);else if("selectinput"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createSelectInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),x.options,x.value);else if("combobox"==x.metatype)elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createComboboxInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,e.value)}),x.options,x.value);else{if("font"==x.metatype)return console.warn("Ignoring property type ",x.metatype),elem;if("SDFGReferenceProperty"==x.metatype)return elem;if("SubsetProperty"==x.metatype)elem=null==x.value?_main__WEBPACK_IMPORTED_MODULE_1__.qu.createTextInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,JSON.parse(e.value))}),JSON.stringify(x.value)):"subsets.Indices"==x.value.type||"Indices"==x.value.type?create_index_subset_input(transthis,x,node):create_range_input(transthis,x,node);else{if("SymbolicProperty"!=x.metatype)return console.log("Unimplemented property type: ",x),elem;elem=_main__WEBPACK_IMPORTED_MODULE_1__.qu.createTextInput("prop_"+x.name,(function(e){transthis.propertyChanged(node,x.name,JSON.parse(e.value))}),JSON.stringify(x.value))}}}}return elem[0]}},{key:"renderPropertiesInWindow",value:function(e,t,n,r){var i=this,a={transthis:"string"==typeof e?e:e.created,node:t,params:n,options:r};this.replaceOrCreate(["display-properties"],"PropWinComponent",a,(function(){var e={type:"component",componentName:"PropWinComponent",componentState:{created:i.getPseudorandom(),params:a}};i.addContentItem(e)}))}},{key:"showStaleDataButton",value:function(){this.project().request(["show_stale_data_button"],(function(e){}),{})}},{key:"removeStaleDataButton",value:function(){this.project().request(["remove_stale_data_button"],(function(e){}),{})}},{key:"refreshSDFG",value:function(){this.gatherProjectElementsAndCompile(diode,{},{sdfg_over_code:!0})}},{key:"__impl_showStaleDataButton",value:function(){var e=this;if(DIODE.recompileOnPropertyChange())this.gatherProjectElementsAndCompile(this,{},{sdfg_over_code:!0});else if(null==this._stale_data_button){var t=document.createElement("div");t.classList="stale_data_button",t.innerHTML="Stale project data. Click here or press <span class='key_combo'>Alt-R</span> to synchronize",t.addEventListener("click",(function(t){e.gatherProjectElementsAndCompile(diode,{},{sdfg_over_code:!0})})),document.body.appendChild(t),this._stale_data_button=t}}},{key:"__impl_removeStaleDataButton",value:function(){null!=this._stale_data_button&&(this._stale_data_button.parentNode.removeChild(this._stale_data_button),this._stale_data_button=null)}},{key:"showIndeterminateLoading",value:function(){this.project().request(["show_loading"],(function(e){}),{})}},{key:"hideIndeterminateLoading",value:function(){this.project().request(["hide_loading"],(function(e){}),{})}},{key:"__impl_showIndeterminateLoading",value:function(){$("#loading_indicator").show()}},{key:"__impl_hideIndeterminateLoading",value:function(){$("#loading_indicator").hide()}},{key:"groupSDFGs",value:function(){this.generic_group((function(e){return"component"==e.config.type&&"SDFGComponent"==e.componentName}))}},{key:"groupCodeOuts",value:function(){this.generic_group((function(e){return"component"==e.config.type&&"CodeOutComponent"==e.componentName}))}},{key:"groupOptGraph",value:function(){this.generic_group((function(e){return"component"==e.config.type&&"OptGraphComponent"==e.componentName}))}},{key:"groupSDFGsAndCodeOutsTogether",value:function(){var e,t=this,n=this.goldenlayout.root.getItemsByFilter((function(e){return"component"==e.config.type&&"SDFGComponent"==e.componentName})),r=[],i=_createForOfIteratorHelper(n);try{for(i.s();!(e=i.n()).done;){var a=e.value;r.push(a.config.componentState.sdfg_name)}}catch(e){i.e(e)}finally{i.f()}for(var o=function(){var e=u[s];t.generic_group((function(t){return"component"==t.config.type&&("SDFGComponent"==t.componentName||"CodeOutComponent"==t.componentName)&&t.config.componentState.sdfg_name==e}))},s=0,u=r;s<u.length;s++)o();(n=this.goldenlayout.root.getItemsByFilter((function(e){return"component"==e.config.type&&"SDFGComponent"==e.componentName}))).forEach((function(e){return e.parent.setActiveContentItem(e)}))}},{key:"groupLikeDIODE1",value:function(){this.goldenlayout.eventHub.emit("enter-programmatic-destroy","");var e=DIODE.filterComponentTreeByCname(this.goldenlayout.root,"CodeInComponent"),t=DIODE.filterComponentTreeByCname(this.goldenlayout.root,"AvailableTransformationsComponent"),n=DIODE.filterComponentTreeByCname(this.goldenlayout.root,"TransformationHistoryComponent"),r=DIODE.filterComponentTreeByCname(this.goldenlayout.root,"SDFGComponent"),i=DIODE.filterComponentTreeByCname(this.goldenlayout.root,"CodeOutComponent"),a=DIODE.filterComponentTreeByCname(this.goldenlayout.root,"PropWinComponent");if(0==a.length){var o=this.getPseudorandom();a.push({config:{type:"component",componentName:"PropWinComponent",componentState:{created:o}}})}for(var s=0,u=[e,i,t,n,r,a];s<u.length;s++){var l,c=_createForOfIteratorHelper(u[s]);try{for(c.s();!(l=c.n()).done;){var f=l.value;null!=f.componentName&&f.remove()}}catch(e){c.e(e)}finally{c.f()}}var d,p=_createForOfIteratorHelper((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__.Z)(this.goldenlayout.root.contentItems));try{for(p.s();!(d=p.n()).done;){var h=d.value;this.goldenlayout.root.removeChild(h)}}catch(e){p.e(e)}finally{p.f()}var m=this.goldenlayout.createContentItem({type:"stack",content:[]}),v=this.goldenlayout.createContentItem({type:"stack",content:[]}),y=this.goldenlayout.createContentItem({type:"stack",content:[]}),g=this.goldenlayout.createContentItem({type:"stack",content:[]}),_=this.goldenlayout.createContentItem({type:"stack",content:[]}),b=this.goldenlayout.createContentItem({type:"row",content:[]}),x=this.goldenlayout.createContentItem({type:"row",content:[]}),w=this.goldenlayout.createContentItem({type:"column",content:[]});this.goldenlayout.root.addChild(w),w.addChild(b),w.addChild(x),b.addChild(m),b.addChild(v),b.addChild(y),x.addChild(g),x.addChild(_),r.forEach((function(e){return y.addChild(e.config)})),a.forEach((function(e){return _.addChild(e.config)})),i.forEach((function(e){return g.addChild(e.config)})),t.forEach((function(e){return v.addChild(e.config)})),n.forEach((function(e){return v.addChild(e.config)})),e.forEach((function(e){return m.addChild(e.config)}));for(var E=0,N=[v,m,y,_];E<N.length;E++){var S=N[E];0==S.contentItems.length&&S.remove()}this.goldenlayout.eventHub.emit("leave-programmatic-destroy","")}},{key:"generic_group",value:function(e){this.goldenlayout.eventHub.emit("enter-programmatic-destroy","");var t=this.goldenlayout.root.getItemsByFilter(e);0==t.length&&console.warn("Cannot group, no elements found");var n,r=this.goldenlayout.createContentItem({type:"stack",contents:[]}),i=_createForOfIteratorHelper(t);try{for(i.s();!(n=i.n()).done;){var a=n.value,o=a.config;a.parent.removeChild(a),r.addChild(o)}}catch(e){i.e(e)}finally{i.f()}this.addContentItem(r),this.goldenlayout.eventHub.emit("leave-programmatic-destroy","")}},{key:"addKeyShortcut",value:function(e,t){var n=!(arguments.length>2&&void 0!==arguments[2])||arguments[2],r=arguments.length>3&&void 0!==arguments[3]&&arguments[3],i=(0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__.Z)(e),a={alt:n,ctrl:r,func:t,state:0,expect:i.slice(1)};void 0===this._shortcut_functions[i[0]]?this._shortcut_functions[i[0]]=[a]:this._shortcut_functions[i[0]].push(a)}},{key:"onKeyUp",value:function(e){if(0==e.altKey&&"Alt"==e.key)for(var t=0,n=Object.values(this._shortcut_functions);t<n.length;t++){var r,i=_createForOfIteratorHelper(n[t]);try{for(i.s();!(r=i.n()).done;)r.value.state=0}catch(e){i.e(e)}finally{i.f()}}}},{key:"onKeyDown",value:function(e){for(var t=0,n=Object.values(this._shortcut_functions);t<n.length;t++){var r,i=_createForOfIteratorHelper(n[t]);try{for(i.s();!(r=i.n()).done;){var a=r.value;if(0!=e.altKey){if(a.state>0&&a.expect[a.state-1]==e.key&&(a.state+=1,a.state>a.expect.length))return a.func(),e.stopPropagation(),e.preventDefault(),void this.onKeyUp({altKey:!1,key:"Alt"})}else a.state=0}}catch(e){i.e(e)}finally{i.f()}}var o=this._shortcut_functions[e.key];if(void 0!==o){var s,u=0,l=_createForOfIteratorHelper(o);try{for(l.s();!(s=l.n()).done;){var c=s.value;if(c.alt==e.altKey&&c.ctrl==e.ctrlKey){if(c.expect.length>0){c.state+=1,console.log("dict value: ",this._shortcut_functions[e.key][u]),++u;continue}c.func(),e.stopPropagation(),e.preventDefault(),this.onKeyUp({altKey:!1,key:"Alt"})}++u}}catch(e){l.e(e)}finally{l.f()}}}},{key:"createNewProject",value:function(){this._current_project=new _diode_project__WEBPACK_IMPORTED_MODULE_11__.T(this),this._current_project.clearTransformationHistory(),sessionStorage.clear(),window.sessionStorage.setItem("diode_project",this._current_project._project_id),this.setupEvents()}},{key:"getProject",value:function(){var e=window.sessionStorage.getItem("diode_project");this._current_project=new _diode_project__WEBPACK_IMPORTED_MODULE_11__.T(this,e),null!=e&&null!=e||(window.sessionStorage.setItem("diode_project",this.getCurrentProject()._project_id),this.setupEvents())}},{key:"project",value:function(){return this.getCurrentProject()}},{key:"getCurrentProject",value:function(){return this._current_project}},{key:"setLayout",value:function(e){this.goldenlayout=e}},{key:"settings",value:function(){return this._settings}},{key:"getPseudorandom",value:function(){var e=(new Date).getTime().toString()+Math.random().toFixed(10).toString()+this._creation_counter.toString();return++this._creation_counter,console.assert(void 0!==e,"Millis well-defined"),e}},{key:"multiple_SDFGs_available",value:function(e){for(var t="string"==typeof e?(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.a)(e):e,n=0,r=Object.keys(t.compounds);n<r.length;n++){var i=r[n],a=t.compounds[i];this.SDFG_available(a,i)}}},{key:"SDFG_available",value:function(e){var t=this,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"sdfg",r=function(){return t.getPseudorandom()};e.sdfg_name=n;var i=function(){var i={title:n,type:"component",componentName:"SDFGComponent",componentState:{created:r(),sdfg_data:e,sdfg_name:n}};t.addContentItem(i)};this.replaceOrCreate(["new-sdfg"],"SDFGComponent",JSON.stringify(e),i);var a=function(){var i={title:"Generated Code",type:"component",componentName:"CodeOutComponent",componentState:{created:r(),code:e,sdfg_name:n}};t.addContentItem(i)};null!=e.generated_code&&(console.log("requesting using ID",this.project()),this.replaceOrCreate(["new-codeout"],"CodeOutComponent",e,a))}},{key:"Error_available",value:function(e){var t=this;this.replaceOrCreate(["new-error"],"ErrorComponent",e,(function(){var n={title:"Error",type:"component",componentName:"ErrorComponent",componentState:{error:e}};t.addContentItem(n)}))}},{key:"OptGraph_available",value:function(e){var t=this,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"";"string"!=typeof e&&(e=JSON.stringify(e));var r=this.getPseudorandom(),i=function(){var i={type:"column",content:[{title:""==n?"Transformations":"Transformations for `"+n+"`",type:"component",componentName:"AvailableTransformationsComponent",componentState:{created:r,for_sdfg:n,optgraph_data:e}}]};t.addContentItem(i)};this.replaceOrCreate(["new-optgraph-"+n],"AvailableTransformationsComponent",e,i);var a=function(){var e={type:"column",content:[{title:"History",type:"component",componentName:"TransformationHistoryComponent",componentState:{created:r,for_sdfg:n}}]};t.addContentItem(e)};this.replaceOrCreate(["new-history-"+n],"TransformationHistoryComponent",e,a)}},{key:"OptGraphs_available",value:function(e){var t=e;"string"==typeof t&&(t=JSON.parse(e));for(var n=0,r=Object.keys(t);n<r.length;n++){var i=r[n],a=t[i];this.OptGraph_available(a,i)}}},{key:"gatherProjectElementsAndCompile",value:function(e){var t=this,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{},i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,a=arguments.length>4&&void 0!==arguments[4]?arguments[4]:void 0,o=n.code,s=n.sdfg_props,u=n.optpath,l=[];void 0===o&&(r.sdfg_over_code&&l.push("sdfg_object"),l.push("input_code")),void 0===u&&l.push("optpath");var c=function(n){if(null!=o&&(n.input_code=o),null!=s&&(n.sdfg_props=s),null!=u&&(n.optpath=u),null!=r.collect_cb&&r.collect_cb(n),!0!==r.dry_run){var l=null!=n.sdfg_object,c=n.input_code;if(!l&&"{"==c[0]){var f=(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.a)(c);n.sdfg_object={},n.sdfg_object[f.attributes.name]=c,l=!0}if(l&&"string"==typeof(c=n.sdfg_object)&&(c=(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.a)(c)),e.project().request(["clear-errors"],(function(){})),!0===r.run){var d={};r.perfmodes&&(d.perfmodes=r.perfmodes),d.repetitions=5,d.code_is_sdfg=l,d.runnercode=n.input_code,t.compile_and_run(e,r.term_id,c,n.optpath,n.sdfg_props,d,i,a)}else{var p=function(e){t.replaceOrCreate(["extend-optgraph"],"AvailableTransformationsComponent",e,(function(n){t.OptGraphs_available(e)}))};!0===r.no_optgraph&&(p=void 0),t.compile(e,c,n.optpath,n.sdfg_props,{optpath_cb:p,code_is_sdfg:l},i,a)}}};e.project().request(l,c,{timeout:500,on_timeout:c})}},{key:"compile",value:function(e,t){var n=this,r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:void 0,i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,a=arguments.length>4&&void 0!==arguments[4]?arguments[4]:{},o=arguments.length>5&&void 0!==arguments[5]?arguments[5]:void 0,s=arguments.length>6&&void 0!==arguments[6]?arguments[6]:void 0,u={};!0===a.code_is_sdfg?(u={sdfg:(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.n)(t)}).code=a.runnercode:u={code:t},null!=r&&(u.optpath=r),null!=i&&(u.sdfg_props=i),u.client_id=this.getClientID();var l="1.0";(0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v"+l+"/compile/dace",u,(function(t){if(4===t.readyState&&200===t.status){var r=(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.a)(t.response);if(null!=r.error)n.handleErrors(e,r),void 0!==s&&s();else{n.removeStaleDataButton();var i=(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.a)(t.response);n.multiple_SDFGs_available(t.response),void 0===a.optpath_cb?n.OptGraphs_available(i.compounds):a.optpath_cb(i.compounds),void 0!==o&&o()}}}))}},{key:"handleErrors",value:function(e,t){var n=t.error;if("traceback"in t&&(n+="\n\n"+t.traceback),this.Error_available(n),"string"!=typeof n){var r,i=_createForOfIteratorHelper(n);try{for(i.s();!(r=i.n()).done;){var a=r.value;"SyntaxError"===a.type?e.project().request(["new_error"],(function(e){}),{params:a,timeout:100}):console.warn("Error: ",a)}}catch(e){i.e(e)}finally{i.f()}}else console.warn("Error: ",n)}},{key:"ui_compile_and_run",value:function(e){var t=this.getPseudorandom(),n="terminal_"+t,r={title:"Terminal",type:"component",componentName:"TerminalComponent",componentState:{created:t}};this.addContentItem(r),this.gatherProjectElementsAndCompile(this,{},{run:!0,term_id:n,sdfg_over_code:!0})}},{key:"load_perfdata",value:function(){var e=this;this.showIndeterminateLoading();var t={client_id:this.getClientID()};(0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v1.0/perfdata/get/",t,(function(t){if(4===t.readyState&&200===t.status){var n=JSON.parse(t.response);console.log("Got result",n);var r=function(){e.hideIndeterminateLoading()};e.project().request(["draw-perfinfo"],(function(e){r()}),{params:n,on_timeout:r})}}))}},{key:"show_exec_times",value:function(){this.addContentItem({type:"component",componentName:"PerfTimesComponent",componentState:{},title:"Execution times"})}},{key:"show_run_options",value:function(e){this.addContentItem({type:"component",componentName:"RunConfigComponent",title:"Run Configuration"})}},{key:"show_inst_options",value:function(e){this.addContentItem({type:"component",componentName:"InstControlComponent",title:"Instrumentation control"})}},{key:"show_roofline",value:function(e){this.addContentItem({type:"component",componentName:"RooflineComponent",title:"Roofline"})}},{key:"compile_and_run",value:function(e,t,n){var r=this,i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,a=arguments.length>4&&void 0!==arguments[4]?arguments[4]:void 0,o=arguments.length>5&&void 0!==arguments[5]?arguments[5]:{},s=arguments.length>6&&void 0!==arguments[6]?arguments[6]:void 0,u=arguments.length>7&&void 0!==arguments[7]?arguments[7]:void 0,l={};!0===o.code_is_sdfg?(l={sdfg:(0,_utils_sdfg_json_serializer__WEBPACK_IMPORTED_MODULE_10__.n)(n)}).code=o.runnercode:l={code:n},null!=i&&(l.optpath=i),null!=a&&(l.sdfg_props=a),this.applyCurrentRunConfig().then((function(n){var i=r.getClientID();if(l.client_id=i,"off"==n.Instrumentation)l.perfmodes=void 0;else if("minimal"==n.Instrumentation)l.perfmodes=["default"];else{if("full"!=n.Instrumentation)return alert("Error! Check console"),console.error("Unknown instrumentation mode",n.Instrumentation),void(void 0!==u&&u());l.perfmodes=["default","vectorize","memop","cacheop"]}var a=n["Number of threads"];"string"==typeof a&&(a=JSON.parse(a)),l.corecounts=a.map((function(e){return parseInt(e)})),l.repetitions=5,(0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v1.0/run/",l,(function(n){if(4===n.readyState&&200===n.status){var a=n.response;"string"==typeof a&&(a=JSON.parse(a)),a.error?(r.display_current_execution_status(e,t,i),void 0!==u&&u()):void 0!==s&&s()}}))}))}},{key:"display_current_execution_status",value:function(e,t,n){var r=this,i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,a={};a.client_id=n,a.perf_mode=i;var o="1.0";(0,_main__WEBPACK_IMPORTED_MODULE_1__.LS)("/dace/api/v"+o+"/run/status/",a,(function(e){if(4===e.readyState&&200===e.status){e.response.endsWith(" 0")?r.toast("Execution ended","Run ended successfully","info"):r.toast("Execution ended","Run failed","error");var n=e.response.substr(e.seenBytes);r.goldenlayout.eventHub.emit(t,n),e.seenBytes=e.responseText.length}if(3===e.readyState){var i=e.response.substr(e.seenBytes);r.goldenlayout.eventHub.emit(t,i),e.seenBytes=e.responseText.length}}))}},{key:"toast",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"info",r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:1e4,i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:void 0,a=arguments.length>5&&void 0!==arguments[5]?arguments[5]:void 0,o=VanillaToasts.create({title:e,text:t,type:n,icon:i,timeout:r,callback:a});VanillaToasts.setTimeout(o.id,1.1*r)}},{key:"optimize",value:function(e,t){void 0===t&&(t=[]);var n=this;e.project().request(["input_code","sdfg_object"],(function(r){var i=!0;null!=r.sdfg_object?(i=!1,r=r.sdfg_object,r=JSON.parse(r)):r=r.input_code,function(r,i,a){var o;o=r;n.compile(e,o,t,undefined,{optpath_cb:function(e){n.replaceOrCreate(["extend-optgraph"],"AvailableTransformationsComponent",e,(function(t){n.OptGraphs_available(e)}))},code_is_sdfg:!a})}(r,0,i)}))}},{key:"replaceOrCreate",value:function(e,t,n,r){var i=null;this.goldenlayout.root&&(i=this.goldenlayout.root.getItemsByFilter((function(e){return"component"==e.config.type&&e.componentName==t}))),i&&i.length>0?this.getCurrentProject().request(e,(function(e,t){}),{timeout:null,params:n,timeout_id:null}):r(n)}},{key:"debounce",value:function(e,t,n){if(void 0===this._debouncing)return t;var r=this;return function(){void 0!==r._debouncing[e]&&clearTimeout(r._debouncing[e]),r._debouncing[e]=setTimeout(t,n)}}}],[{key:"getHostList",value:function(){var e=localStorage.getItem("diode_host_list");return null==e?["localhost"]:JSON.parse(e)}},{key:"setHostList",value:function(e){localStorage.setItem("diode_host_list",JSON.stringify(e))}},{key:"hash",value:function(e){return btoa(crypto.subtle.digest("SHA-256",Uint8Array.from(e)))}},{key:"filterComponentTree",value:function(e){var t,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:function(e){return e},r=[],i=_createForOfIteratorHelper(e.contentItems);try{for(i.s();!(t=i.n()).done;){var a=t.value;r.push.apply(r,(0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_8__.Z)(this.filterComponentTree(a,n)))}}catch(e){i.e(e)}finally{i.f()}return r.filter(n)}},{key:"filterComponentTreeByCname",value:function(e,t){return e.getItemsByFilter((function(e){return"component"==e.config.type&&e.componentName==t}))}},{key:"editorTheme",value:function(){var e=localStorage.getItem("diode_ace_editor_theme");return null===e?"github":e}},{key:"themeString",value:function(){return"ace/theme/"+DIODE.editorTheme()}},{key:"loadTheme",value:function(){return $.getScript("external_lib/ace/theme-"+DIODE.editorTheme()+".js")}},{key:"setTheme",value:function(e){localStorage.setItem("diode_ace_editor_theme",e)}},{key:"recompileOnPropertyChange",value:function(){return"true"==localStorage.getItem("diode_recompile_on_prop_change")}},{key:"setRecompileOnPropertyChange",value:function(e){e?localStorage.setItem("diode_recompile_on_prop_change","true"):localStorage.setItem("diode_recompile_on_prop_change","false")}},{key:"setDebugDevMode",value:function(e){e?localStorage.setItem("diode_DebugDevMode","true"):localStorage.setItem("diode_DebugDevMode","false")}},{key:"debugDevMode",value:function(){return"true"===localStorage.getItem("diode_DebugDevMode")}}]),DIODE}()},816:(e,t,n)=>{"use strict";n.d(t,{u:()=>a});var r=n(6610),i=n(5991),a=function(){function e(t){(0,r.Z)(this,e),null===t&&((t={}).style=e.default()),"string"==typeof t&&(t=JSON.parse(t)),this._change_callback=null,this._config=t,this.insertStylesheet(t.style),this._constructor_values={},null!=t.vals&&(this._constructor_values=t.vals)}return(0,i.Z)(e,[{key:"setOnChange",value:function(e){this._change_callback=e}},{key:"setChanged",value:function(){null!=this._change_callback&&this._change_callback(this)}},{key:"apply",value:function(){this.insertStylesheet(this.getCSS())}},{key:"insertStylesheet",value:function(e){var t=document.getElementById("appearance-stylesheet"),n=!0;null!=t&&null!=t||(n=!1,(t=document.createElement("style")).id="appearance-stylesheet",t.type="text/css"),t.innerText=e,n||document.head.appendChild(t),this.setChanged()}},{key:"setValue",value:function(e,t){return this._constructor_values[e]=t,this}},{key:"setFont",value:function(t){var n=e.font(t);return this._constructor_values["font-family"]=n,this}},{key:"toString",value:function(){return JSON.stringify(this._config)}},{key:"getCSS",value:function(){for(var e="",t=0,n=Object.entries(this._constructor_values);t<n.length;t++){var r=n[t];e+=r[0]+": "+r[1]+";"}var i=".diode_appearance { ";return i+=e,i+="}",i+=".lm_content { ",(i+=e)+"}"}},{key:"toStorable",value:function(){return{style:this.getCSS(),vals:this._constructor_values}}},{key:"setFromAceEditorTheme",value:function(t){var n=e.getClassProperties("ace-"+t),r=n["background-color"],i=n.background;r&&this.setValue("background-color",r),i&&this.setValue("background",i+" !important"),this.setValue("color",n.color),this.insertStylesheet(this.getCSS())}}],[{key:"getClassProperties",value:function(e){var t=document.createElement("div");t.classList=e,t.style="width: 0; height: 0;",document.body.appendChild(t);var n=JSON.parse(JSON.stringify(window.getComputedStyle(t)));return document.body.removeChild(t),n}},{key:"fonts",value:function(){return["Georgia","Palatino","Times","Arial","ArialBlack","ComicSans","Impact","Lucida","Tahoma","Trebuchet","Verdana","Courier","LucidaConsole"]}},{key:"font",value:function(e){switch(e){case"Georgia":return"Georgia, serif";case"Palatino":return'"Palatino Linotype", "Book Antiqua", Palatino, serif';case"Times":return'"Times New Roman", Times, serif';case"Arial":return"Arial, Helvetica, sans-serif";case"ArialBlack":return'"Arial Black", Gadget, sans-serif';case"ComicSans":return'"Comic Sans MS", cursive, sans-serif';case"Impact":return"Impact, Charcoal, sans-serif";case"Lucida":return'"Lucida Sans Unicode", "Lucida Grande", sans-serif';case"Tahoma":return"Tahoma, Geneva, sans-serif";case"Trebuchet":return'"Trebuchet MS", Helvetica, sans-serif';case"Verdana":return"Verdana, Geneva, sans-serif";case"Courier":return'"Courier New", Courier, monospace';case"LucidaConsole":return'"Lucida Console", Monaco, monospace';default:throw"Unknown font (not websafe?)"}}},{key:"default",value:function(){return"\n        .diode_appearance {\n            font-family: "+e.font("Arial")+"\n        }\n        "}}]),e}()},2992:(e,t,n)=>{"use strict";n.d(t,{T:()=>u});var r=n(7329),i=n(6610),a=n(5991);function o(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return s(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?s(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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,u=!1;return{s:function(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){u=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(u)throw a}}}}function s(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var u=function(){function e(t){var n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:void 0;(0,i.Z)(this,e),this._diode=t,this._project_id=null==n?t.getPseudorandom():n,this.setup(),this._callback=null,this._rcvbuf={},this._waiter={},this._listeners={},this._closed_windows=[],this._blob=null}return(0,a.Z)(e,[{key:"clearTransformationHistory",value:function(){sessionStorage.removeItem("transformation_snapshots")}},{key:"getTransformationSnapshots",value:function(){var e=sessionStorage.getItem("transformation_snapshots");return null==e?[]:JSON.parse(e)}},{key:"getTransformationHistory",value:function(){return this.getTransformationSnapshots().map((function(e){return e[0]}))}},{key:"discardTransformationsAfter",value:function(e){var t=this.getTransformationSnapshots();sessionStorage.setItem("transformation_snapshots",JSON.stringify(t.slice(0,e))),this.request(["update-tfh"],(function(e){return e}),{})}},{key:"saveSnapshot",value:function(e,t){var n=this.getTransformationSnapshots();n.push([t,e]),sessionStorage.setItem("transformation_snapshots",JSON.stringify(n))}},{key:"reopenClosedWindow",value:function(e){var t=this.getConfigForClosedWindow(e,!0);this._diode.addContentItem(t),this._diode.goldenlayout.eventHub.emit("window-reopened-"+e)}},{key:"getConfigForClosedWindow",value:function(e){var t,n=!(arguments.length>1&&void 0!==arguments[1])||arguments[1],r=this.getClosedWindowsList(),i=[],a=[],s=o(r);try{for(s.s();!(t=s.n()).done;){var u=t.value,l=u[0],c=u[1];c.created===e?(a.push([l,c]),n||i.push([l,c])):i.push([l,c])}}catch(e){s.e(e)}finally{s.f()}this.setClosedWindowsList(i),console.assert(1===a.length,"Expected only 1 match!");var f=a[0],d={type:"component",componentName:f[0],componentState:f[1]};return d}},{key:"setClosedWindowsList",value:function(e){this._closed_windows=e,sessionStorage.setItem(this._project_id+"-closed-window-list",JSON.stringify(this._closed_windows))}},{key:"clearClosedWindowsList",value:function(){this._closed_windows=[],sessionStorage.setItem(this._project_id+"-closed-window-list",JSON.stringify(this._closed_windows))}},{key:"addToClosedWindowsList",value:function(e,t){this._closed_windows=this.getClosedWindowsList(),this._closed_windows.push([e,t]);try{sessionStorage.setItem(this._project_id+"-closed-window-list",JSON.stringify(this._closed_windows))}catch(e){console.error("Error when adding to closed windows list!",e),sessionStorage.clear()}}},{key:"getClosedWindowsList",value:function(){var e=sessionStorage.getItem(this._project_id+"-closed-window-list");return"string"==typeof e&&(e=JSON.parse(e)),null===e?[]:e}},{key:"eventString",value:function(e){return console.assert(null!=this._project_id,"project id valid"),this._project_id+e}},{key:"startListening",value:function(e,t){var n=this._diode.goldenlayout.eventHub,r=this,i=[this.eventString(e),function(n){var i=r._rcvbuf[t][e];i instanceof Array?r._rcvbuf[t][e].push(n):i instanceof Object?Object.assign(r._rcvbuf[t][e],n):r._rcvbuf[t][e]=n},this];n.on.apply(n,i),this._listeners[t].push(i)}},{key:"stopListening",value:function(e){var t,n=this._diode.goldenlayout.eventHub,i=o(this._listeners[e]);try{for(i.s();!(t=i.n()).done;){var a=t.value;n.unbind.apply(n,(0,r.Z)(a))}}catch(e){i.e(e)}finally{i.f()}delete this._listeners[e]}},{key:"setup",value:function(){}},{key:"createblob",value:function(e){var t=new Blob([e],{type:"text/plain"});return null!==this._blob&&window.URL.revokeObjectURL(this._blob),this._blob=window.URL.createObjectURL(t),this._blob}},{key:"save",value:function(){var e=this;this.request(["sdfg_object"],(function(t){var n=t.sdfg_object,r=null;"string"!=typeof n?(r=Object.keys(t.sdfg_object)[0],n=stringify_sdfg(Object.values(t.sdfg_object)[0])):r=parse_sdfg(n).attributes.name,r+=".sdfg";var i=document.createElement("a");i.setAttribute("download",r),i.href=e.createblob(n),document.body.appendChild(i),window.requestAnimationFrame((function(){var e=new MouseEvent("click");i.dispatchEvent(e),document.body.removeChild(i)}))}))}},{key:"request",value:function(t,n){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{},i=new e(this._diode,this._project_id);return i.__impl_request(t,n,r)}},{key:"__impl_request",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};this._callback=t;var r=n.params,i="id"+this._diode.getPseudorandom();this._rcvbuf[i]={},this._listeners[i]=[];var a,s=o(e);try{for(s.s();!(a=s.n()).done;){var u=a.value;this.startListening(u,i),this._diode.goldenlayout.eventHub.emit(this.eventString("-req-"+u),r,this)}}catch(e){s.e(e)}finally{s.f()}var l=this,c=100,f=n.timeout;this._waiter[i]=setInterval((function(){var t,r=!1,a=o(e);try{for(a.s();!(t=a.n()).done;)if(!(t.value in l._rcvbuf[i])){r=!0;break}}catch(e){a.e(e)}finally{a.f()}if(!r){clearInterval(l._waiter[i]),l.stopListening(i),l._waiter[i]=null;var s=l._rcvbuf[i];return delete l._rcvbuf[i],l._callback(s,n.timeout_id)}null!==f&&(f-=c)<=0&&(clearInterval(l._waiter[i]),l.stopListening(i),null!=n.on_timeout&&n.on_timeout(l._rcvbuf[i]),l._waiter[i]=null,delete l._rcvbuf[i])}),c)}}],[{key:"load",value:function(t,n){var r=e.getProjectData(n),i=new e(t,r.project_id);return t.goldenlayout.destroy(),sessionStorage.setItem("savedState",JSON.stringify(r.data)),sessionStorage.setItem("diode_project",i._project_id),sessionStorage.setItem("transformation_snapshots",JSON.stringify(r.snapshots)),window.location.reload(),i}},{key:"getProjectData",value:function(e){var t=localStorage.getItem("project_"+e);if(null==t)throw"Project must exist";return JSON.parse(t)}},{key:"getSavedProjects",value:function(){var e=localStorage.getItem("saved_projects");return null==e?[]:JSON.parse(e)}}]),e}()},5490:(e,t,n)=>{"use strict";n.d(t,{y:()=>a});var r=n(6610),i=n(5991),a=function(){function e(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};(0,r.Z)(this,e),this.settings_values=t,this.changed={}}return(0,i.Z)(e,[{key:"load",value:function(){this.settings_values=window.localStorage.getItem("DIODE/Settings/confirmed"),this.changed=window.localStorage.getItem("DIODE/Settings/changed")}},{key:"store",value:function(){window.localStorage.setItem("DIODE/Settings/confirmed",this.settings_values),window.localStorage.setItem("DIODE/Settings/changed",this.changed)}},{key:"change",value:function(e,t){this.changed[e.join("/")]=t}},{key:"hasChanged",value:function(){return this.changed!={}}},{key:"changedValues",value:function(){return this.changed}},{key:"clearChanged",value:function(){this.changed={}}},{key:"values",value:function(){return this.settings_values}}]),e}()},982:(e,t,n)=>{"use strict";n.d(t,{F:()=>s,i:()=>u});var r=n(6610),i=n(5991);function a(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return o(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?o(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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,s=!0,u=!1;return{s:function(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return s=e.done,e},e:function(e){u=!0,a=e},f:function(){try{s||null==n.return||n.return()}finally{if(u)throw a}}}}function o(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var s=function(){function e(t,n){var i=this;(0,r.Z)(this,e),this._table=t,this._title_row=n,this._cat_rows=[],this._title_row.classList.add("diode_property_header"),this._title_row.addEventListener("click",(function(e){var t,n=a(i._cat_rows);try{for(n.s();!(t=n.n()).done;){var r=t.value;"none"==r.style.display?(r.style.display=null,i._title_row.classList.remove("collapsed")):(r.style.display="none",i._title_row.classList.add("collapsed"))}}catch(e){n.e(e)}finally{n.f()}}))}return(0,i.Z)(e,[{key:"addContentRow",value:function(e){this._cat_rows.push(e)}}]),e}(),u=function(){function e(){(0,r.Z)(this,e),this.init()}return(0,i.Z)(e,[{key:"init",value:function(){this._table=document.createElement("table"),this._thead=document.createElement("thead"),this._tbody=document.createElement("tbody"),this._table.appendChild(this._thead),this._table.appendChild(this._tbody),this._is_collapsed=!1}},{key:"createIn",value:function(e){e.appendChild(this._table)}},{key:"setHeaders",value:function(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];this._columns=t,this._thead.innerHTML="";var r,i=document.createElement("tr"),o=a(this._columns);try{for(o.s();!(r=o.n()).done;){var s=r.value,u=document.createElement("th");"string"==typeof s?u.innerText=s:u.appendChild(s),i.appendChild(u)}}catch(e){o.e(e)}finally{o.f()}return this._thead.appendChild(i),i}},{key:"addRow",value:function(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];for(var r=t,i=document.createElement("tr"),a=0,o=r;a<o.length;a++){var s=o[a],u=document.createElement("td");"string"==typeof s?u.innerText=s:u.appendChild(s),i.appendChild(u)}return this._tbody.appendChild(i),i}},{key:"collapseVertically",value:function(){this._table.style.display="none",this._is_collapsed=!0}},{key:"expandVertically",value:function(){this._table.style.display=null,this._is_collapsed=!1}},{key:"toggleVertically",value:function(){this._is_collapsed?this.expandVertically():this.collapseVertically()}},{key:"setCSSClass",value:function(e){this._table.classList=e}}]),e}()},4316:(e,t,n)=>{"use strict";n.d(t,{qu:()=>Ue,LS:()=>Be,Wj:()=>Le});var r=n(6610),i=n(5991),a=n(1154),o=n(6156),s=n(7329),u=n(4699),l=n(379),c=n(6070),f=n(7608),d=n(982),p=n(5490);function h(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return m(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?m(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function m(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var v=function(){function e(t){var n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;(0,r.Z)(this,e),this._label=t,this._prev=null,this._data=n,this._children=[],this._on_activate=null,this._representative=null}return(0,i.Z)(e,[{key:"label",value:function(){return this._label}},{key:"setPathLabel",value:function(e){this._path_label=e}},{key:"pathLabel",value:function(){return void 0===this._path_label?this.label():this._path_label}},{key:"data",value:function(){return this._data}},{key:"children",value:function(){return this._children}},{key:"parent",value:function(){return this._prev}},{key:"getChild",value:function(e){var t,n=h(this.children());try{for(n.s();!(t=n.n()).done;){var r=t.value;if(e(r))return r;var i=r.getChild(e);if(null!=i)return i}}catch(e){n.e(e)}finally{n.f()}return null}},{key:"clearChildren",value:function(){this._children=[]}},{key:"head",value:function(){for(var e=this;null!=e._prev;)e=e._prev;return e}},{key:"allLabelsInTree",value:function(){return this.head().asPreOrderArray((function(e){return e.pathLabel()}))}},{key:"asPreOrderArray",value:function(){var e,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:function(e){return e},n=[t(this)],r=h(this.children());try{for(r.s();!(e=r.n()).done;){var i=e.value;n.push.apply(n,(0,s.Z)(i.asPreOrderArray(t)))}}catch(e){r.e(e)}finally{r.f()}return n}},{key:"path",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0,t=[];void 0===e&&(e=function(e){return{name:e.pathLabel(),params:e.data()}});for(var n=this;null!=n._prev;){var r=e(n);" <virtual>"!=r.name&&(t=[r].concat((0,s.Z)(t))),n=n._prev}return t}},{key:"addNode",value:function(t){var n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{},i=new e(t,n);return i._prev=this,null!=r.LabelConflictSameLevel&&(i=r.LabelConflictSameLevel(i,this.children().map((function(e){return e.label()})))),null!=r.LabelConflictGlobal&&(i=r.LabelConflictGlobal(i,this.allLabelsInTree())),i._prev=this,this._children.push(i),i}},{key:"setHandler",value:function(e,t){"activate"==e?this._on_activate=t:console.assert(!1,"type "+e+" is unknown")}},{key:"setRepresentative",value:function(e){this._representative=e}},{key:"representative",value:function(){return this._representative}},{key:"activate",value:function(e){null!=this._on_activate&&this._on_activate(this,e)}}]),e}(),y=function(){function e(t){(0,r.Z)(this,e),this._tree=t,this._debouncing=null}return(0,i.Z)(e,[{key:"setDebouncing",value:function(e){this._debouncing=e}},{key:"create_html_in",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0,n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:void 0,r=void 0===n?this._tree:n,i=document.createElement("li"),a=document.createElement("span");a.innerText=r.label(),i.append(a);var o=document.createElement("ul");o.classList.add("tree_view"),o.classList.add("collapsed_sublist");var s=function(){o.classList.toggle("collapsed_sublist"),r.activate(1)},u=function(){r.activate(2)},l=s,c=s;null!=this._debouncing&&(l=this._debouncing.debounce("treeview-click",s,100),c=this._debouncing.debounce("treeview-click",u,10)),i.addEventListener("click",l),i.addEventListener("mouseenter",(function(){r.activate(0)})),i.addEventListener("mouseleave",(function(){r.activate(-1)})),i.addEventListener("dblclick",c),r.setRepresentative(i),o.append(i);var f=r.children();if(0==f.length);else{var d,p=h(f);try{for(p.s();!(d=p.n()).done;){var m=d.value;this.create_html_in(o,t+1,m)}}catch(e){p.e(e)}finally{p.f()}}e.append(o)}}]),e}(),g=n(2992);function _(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return b(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?b(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function b(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var x=function(){function e(t,n,i){(0,r.Z)(this,e),this.diode=t,this.container=n,this.initial_state=i,this.created=i.created,null==this.created&&(this.created=this.diode.getPseudorandom(),this.saveToState({created:this.created})),this._project=null,null!=i.project_id&&null!=i.project_id&&"null"!=i.project_id&&(this._project=new g.T(this.diode,i.project_id)),this._event_listeners=[],this._event_listeners_closed=[],this._no_user_destroy=!1}return(0,i.Z)(e,[{key:"project",value:function(){return console.assert(null!=this._project,"Project invalid"),this._project}},{key:"on",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]&&arguments[2],r=this.diode.goldenlayout.eventHub,i=[e,t];r.on.apply(r,i),this._event_listeners.push(i),n&&this.closed_on(e,(function(e){return t(e)}))}},{key:"closed_on",value:function(e,t){var n=[e,t];this._event_listeners_closed.push(n)}},{key:"removeClosedWindowEvents",value:function(){var e,t=this.diode.goldenlayout.eventHub,n=_(this._event_listeners_closed);try{for(n.s();!(e=n.n()).done;){var r=e.value;t.unbind.apply(t,(0,s.Z)(r))}}catch(e){n.e(e)}finally{n.f()}this._event_listeners_closed=[]}},{key:"destroy",value:function(){console.log("destroying",this);var e,t=this.diode.goldenlayout.eventHub,n=_(this._event_listeners);try{for(n.s();!(e=n.n()).done;){var r=e.value;t.unbind.apply(t,(0,s.Z)(r))}}catch(e){n.e(e)}finally{n.f()}this._event_listeners=[]}},{key:"close",value:function(){console.log("closing",this),this.project().addToClosedWindowsList(this.container._config.componentName,this.getState());var e,t=this.diode.goldenlayout.eventHub,n=_(this._event_listeners_closed);try{for(n.s();!(e=n.n()).done;){var r=e.value;t.on.apply(t,(0,s.Z)(r))}}catch(e){n.e(e)}finally{n.f()}}},{key:"setupEvents",value:function(e){var t=this;null==this._project&&(this._project=e),this.container.extendState({project_id:this._project.eventString("")}),this.on("destroy-"+this.getState().created,(function(e){t._no_user_destroy||t.close(),t.destroy()})),this.on("enter-programmatic-destroy",(function(e){t._no_user_destroy=!0,console.log("Entering programmatic reordering",t)})),this.on("leave-programmatic-destroy",(function(e){t._no_user_destroy=!1,console.log("Leaving programmatic reordering",t)})),this.closed_on("window-reopened-"+this.getState().created,(function(e){t.removeClosedWindowEvents()}))}},{key:"getState",value:function(){return this.container.getState()}},{key:"saveToState",value:function(e){this.container.extendState(e)}},{key:"resetState",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};this.container.setState(e)}},{key:"saveToPersistentState",value:function(e,t){localStorage.setItem(e,t)}},{key:"getPersistentState",value:function(e){return localStorage.getItem(e)}}]),e}();function w(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);t&&(r=r.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),n.push.apply(n,r)}return n}function E(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{};t%2?w(Object(n),!0).forEach((function(t){(0,o.Z)(e,t,n[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(n)):w(Object(n)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(n,t))}))}return e}function N(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return S(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?S(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function S(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var M=globalThis.$,k=function(e){(0,l.Z)(h,e);var t,n,o=(t=h,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function h(e,t,n){return(0,r.Z)(this,h),o.call(this,e,t,n)}return(0,i.Z)(h,[{key:"settings_change_callback",value:function(e,t,n){console.assert(void 0!==n,"Undefined value"),console.log("Setting changed",t,n),this.diode.settings().change(t,n),this.set_settings()}},{key:"link_togglable_onclick",value:function(e,t){var n="collapsed_container";e.on("click",(function(){t.hasClass(n)?t.removeClass(n):t.addClass(n)}))}},{key:"parse_settings2",value:function(e){var t=this,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:void 0,r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:[],i=!1;void 0===n&&(n=new v("Settings",null),i=!0);var o=[],l=[];Object.entries(e).forEach((function(e){var t=(0,u.Z)(e,2),n=t[0],r=t[1],i=r.meta;r.value,"dict"==i.type?o.push([n,r]):l.push([n,r])}));var c={},f=new d.i,p=JSON.parse(JSON.stringify(l));p=p.map((function(e){var t=e[0],n=(e=e[1]).meta;return n.value=e.value,n.name=n.title,n.category="General",n.key=t,n}));var h,m=f,g=null,_={},b=N(p);try{for(b.s();!(h=b.n()).done;){var x=h.value,w=x.category;null==_[w]&&(_[w]=[]),_[w].push(x)}}catch(e){b.e(e)}finally{b.f()}a.C.debugDevMode()||delete _["(Debug)"];for(var S={propertyChanged:function(e,n,r){console.log("PropertyChanged",e,n,r),t.settings_change_callback(void 0,e,r)}},k=0,O=Object.entries(_);k<O.length;k++){var C=O[k],A=C[0],T=C[1].sort((function(e,t){return e.name.localeCompare(t.name)}));m=f;var I=document.createElement("span");I.innerText=A;var D=m.addRow(I);D.childNodes[0].colSpan="2",g=new d.F(m,D);var P,j=N(T);try{for(j.s();!(P=j.n()).done;){var R=P.value;c[r]=R.value;var L=diode.getMatchingInput(S,R,[].concat((0,s.Z)(r),[R.key])),B=m.addRow(R.name,L);null!=g&&g.addContentRow(B)}}catch(e){j.e(e)}finally{j.f()}}f.setCSSClass("diode_property_table"),n.setHandler("activate",(function(e,t){if(1==t){var n=e.representative();e.head().asPreOrderArray((function(e){return e.representative()})).forEach((function(e){return e.classList.remove("selected")})),n.classList.add("selected");var r=M("#diode_settings_props_container")[0];r.innerHTML="",f.createIn(r)}}));var U,q=N(o=o.sort((function(e,t){return e[1].meta.title.localeCompare(t[1].meta.title)})));try{var z=function(){var e=U.value,i=e[0];e=e[1];var a=r.concat(i),o=n.addNode(e.meta.title,null);setTimeout((function(){return o.representative().title=e.meta.description}),500),console.log("Setting path",a);var s=t.parse_settings2(e.value,o,a);c=E(E({},c),s)};for(q.s();!(U=q.n()).done;)z()}catch(e){q.e(e)}finally{q.f()}if(i){var F=new y(n);F.create_html_in(M("#diode_settings_container")[0])}return c}},{key:"get_settings",value:function(){var e=this;Be("/dace/api/v1.0/preferences/get",{client_id:this.diode.getClientID()},(function(t){if(4===t.readyState&&200===t.status){var n=e.parse_settings2(JSON.parse(t.response));e.diode._settings=new p.y(n)}}))}},{key:"set_settings",value:function(){if(this.diode.settings().hasChanged()){var e=this.diode.settings().changedValues();this.saveToState({changed:e,confirmed:this.diode.settings().values()});var t=this,n=this.diode.getClientID(),r=e;r.client_id=n,this.diode.debounce("settings-changed",(function(){var e=this;Be("/dace/api/v1.0/preferences/set",r,(function(n){4===n.readyState&&200===n.status&&(t.diode.settings().clearChanged(),e.diode.toast("Settings changed","The changed settings were applied at remote server","info",3e3))}))}),1e3)()}}}]),h}(x),O=n(816);var C=function(e){(0,l.Z)(s,e);var t,n,o=(t=s,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function s(e,t,n){var i;return(0,r.Z)(this,s),(i=o.call(this,e,t,n))._settings_container=null,i._editor_themes=i.getThemes(),i}return(0,i.Z)(s,[{key:"getThemes",value:function(){var e=this;Be("/dace/api/v1.0/diode/themes",void 0,(function(t){4===t.readyState&&200===t.status&&(e._editor_themes=JSON.parse(t.response),console.log("Got editor themes",e._editor_themes),e.create())}),"GET")}},{key:"themeNames",value:function(){return this._editor_themes.map((function(e){return e.substr("theme-".length).slice(0,-3)}))}},{key:"setContainer",value:function(e){this._settings_container=e}},{key:"create",value:function(){var e=this,t=Ue.createContainer(void 0),n=Ue.createLabel(void 0,"editor theme","Sets the ace editor theme"),r=this.themeNames(),i=Ue.createSelectInput(void 0,(function(t){var n=t.value;a.C.setTheme(n),a.C.loadTheme().then((function(t){e.diode._appearance.setFromAceEditorTheme(n)}))}),r,a.C.editorTheme());t.append(n),t.append(i),this._settings_container.append(t);var o=Ue.createContainer(void 0),s=Ue.createLabel(void 0,"Compile on property change","When false, the program is not recompiled after a property change"),u=Ue.createToggleSwitch(void 0,(function(e){var t=e.checked;a.C.setRecompileOnPropertyChange(t)}),a.C.recompileOnPropertyChange());o.append(s),o.append(u),this._settings_container.append(o);var l=Ue.createContainer(void 0),c=Ue.createLabel(void 0,"DaCe Debug mode","When true, the program shows elements primarily useful for debugging and developing DaCe/DIODE."),f=Ue.createToggleSwitch(void 0,(function(e){var t=e.checked;a.C.setDebugDevMode(t)}),a.C.debugDevMode());l.append(c),l.append(f),this._settings_container.append(l);var d=Ue.createContainer(void 0),p=Ue.createLabel(void 0,"UI Font","Select the font used in the UI (does not affect code panes and SDFG renderers)"),h=O.u.getClassProperties("diode_appearance").fontFamily,m=Ue.createSelectInput(void 0,(function(t){var n=t.value;e.diode._appearance.setFont(n),e.diode._appearance.apply()}),O.u.fonts(),h);d.append(p),d.append(m),this._settings_container.append(d)}}]),s}(x),A=n(6213);function T(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return I(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?I(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function I(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var D=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n)).editor=null,i._terminal_identifer=null,i._markers=[],i}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this,r=this.diode.goldenlayout.eventHub;this.on(this._project.eventString("-req-input_code"),(function(e){setTimeout((function(){return r.emit(n._project.eventString("input_code"),t.getState().code_content)}),1),n.editor.clearSelection()}),!0),this.on(this.project().eventString("-req-new_error"),(function(e){setTimeout((function(){return r.emit(n._project.eventString("new_error"),"ok")}),1),t.highlight_error(e)})),this.on(this.project().eventString("-req-highlight-code"),(function(e){setTimeout((function(){return r.emit(n._project.eventString("highlight-code"),"ok")}),1),t.highlight_code(e)})),this.on(this.project().eventString("-req-set-inputcode"),(function(e){setTimeout((function(){return r.emit(n._project.eventString("set-inputcode"),"ok")}),1),t.editor.setValue(e),t.editor.clearSelection()})),this.on(this.project().eventString("-req-clear-errors"),(function(e){setTimeout((function(){return r.emit(n._project.eventString("clear-errors"),"ok")}),1),t.clearErrors()}))}},{key:"highlight_code",value:function(e){var t=this,n=e.start_col,r=e.end_col;r<=n&&(r=2e3);var i=new ace.Range(e.start_line-1,n,e.end_line-1,r),a="chm_"+this.diode.getPseudorandom(),o=this.editor.session.addMarker(i,"code_highlight "+a);this.editor.resize(!0),this.editor.scrollToLine(e.start_line,!0,!0,(function(){})),this.editor.gotoLine(e.start_line,10,!0),setTimeout((function(){t.editor.getSession().removeMarker(o)}),5e3)}},{key:"clearErrors",value:function(){var e,t=T(this._markers);try{for(t.s();!(e=t.n()).done;){var n=e.value;this.editor.getSession().removeMarker(n)}}catch(e){t.e(e)}finally{t.f()}this._markers=[]}},{key:"highlight_error",value:function(e){if("SyntaxError"==e.type){var t=parseInt(e.line),n=(parseInt(e.offset),e.text);t-=1;var r=this.editor.session.getLine(t).indexOf(n.substring(0,n.length-1)),i=new ace.Range(t,r,t,r+n.length-1),a="sem_"+this.diode.getPseudorandom(),o=this.editor.session.addMarker(i,"syntax_error_highlight "+a);this._markers.push(o)}else console.log("Untreated error type",e)}},{key:"terminal_identifier",value:function(){return this._terminal_identifer}},{key:"compile",value:function(e){var t,n=T(this._markers);try{for(n.s();!(t=n.n()).done;){var r=t.value;this.editor.getSession().removeMarker(r)}}catch(e){n.e(e)}finally{n.f()}this._markers=[],this.diode.compile(this,e)}},{key:"setEditorReference",value:function(e){var t=this;this.editor=e,this.container.getElement()[0].addEventListener("resize",(function(e){t.editor.resize()}))}},{key:"compile_and_run",value:function(e){var t=this.diode.getPseudorandom(),n="terminal_"+t,r={title:"Terminal",type:"component",componentName:"TerminalComponent",componentState:{created:t}};this.diode.addContentItem(r),console.log("Server emitting to ",n),this._terminal_identifer=n,this.diode.gatherProjectElementsAndCompile(this,{},{run:!0,term_id:n})}}]),o}(x);function P(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var j=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){return(0,r.Z)(this,o),a.call(this,e,t,n)}return(0,i.Z)(o,[{key:"setEditorReference",value:function(e){this.editor=e}},{key:"append",value:function(e){var t=this.editor.getSession();t.insert({row:t.getLength(),column:0},e);var n,r=t.getValue(),i=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return P(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?P(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}((0,s.Z)(r.matchAll(/~#~#([^\n]+)/gm)));try{for(i.s();!(n=i.n()).done;){var a=n.value;console.log("Got match",a);var o=a[1];o=o.replace(/\'/g,""),(o=JSON.parse(o)).sort((function(e,t){return e-t}));var u=o[Math.floor(o.length/2)];console.log("Got median execution time",u),this.project().request(["new-time"],(function(){}),{params:{time:u}})}}catch(e){i.e(e)}finally{i.f()}this.container.extendState({current_value:r}),this.editor.clearSelection()}}]),o}(x);function R(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var L=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n)).editor=null,i}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this,r=this.diode.goldenlayout.eventHub;this.on(this._project.eventString("-req-new-codeout"),(function(e){if(e.sdfg_name==t.getState().sdfg_name){setTimeout((function(e){return r.emit(n.project().eventString("new-codeout"),"ok")}),1);var i=e;t.setCode(i)}}))}},{key:"cleanCode",value:function(e){return e.replace(/\s*\/\/\/\/\_\_DACE:[^\n]*/gm,"")}},{key:"setCode",value:function(e){var t=e;if("string"==typeof e&&(e=JSON.parse(e)),"string"==typeof e.generated_code)this.editor.setValue(this.cleanCode(e.generated_code)),this.editor.clearSelection();else{this.editor.setValue(""),this.editor.clearSelection();var n,r=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return R(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?R(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(e.generated_code);try{for(r.s();!(n=r.n()).done;){var i=n.value;e.generated_code.length>1&&(i="\n\n\n#########  NEXT CODE FILE ############\n\n\n"+i);var a=this.editor.getSession();a.insert({row:a.getLength(),column:0},this.cleanCode(i)),this.editor.clearSelection()}}catch(e){r.e(e)}finally{r.f()}}this.saveToState({code:t})}},{key:"setEditorReference",value:function(e){var t=this;this.editor=e,this.container.getElement()[0].addEventListener("resize",(function(e){t.editor.resize()}))}}]),o}(x),B=n(728),U=n(6310),q=n(9018),z=n(3371),F=n(8560);function H(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return Z(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?Z(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function Z(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var W=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n))._message_handler=function(e){return alert(e)},i.renderer_pane=null,i._analysis_values={},console.log("state",n),i}return(0,i.Z)(o,[{key:"saveToState",value:function(e){for(var t={},n=["sdfg_data","sdfg"],r=0,i=Object.entries(e);r<i.length;r++){var a=i[r];t[a[0]]=n.includes(a[0])&&"string"!=typeof a[1]?JSON.stringify(a[1]):a[1]}(0,A.Z)((0,f.Z)(o.prototype),"saveToState",this).call(this,t),console.assert(null==this.getState().sdfg)}},{key:"resetState",value:function(e){for(var t={},n=["sdfg_data","sdfg"],r=0,i=Object.entries(e);r<i.length;r++){var a=i[r];t[a[0]]=n.includes(a[0])&&"string"!=typeof a[1]?JSON.stringify(a[1]):a[1]}(0,A.Z)((0,f.Z)(o.prototype),"resetState",this).call(this,t),console.assert(null==this.getState().sdfg)}},{key:"getState",value:function(){for(var e=(0,A.Z)((0,f.Z)(o.prototype),"getState",this).call(this),t={},n=["sdfg_data","sdfg"],r=0,i=Object.entries(e);r<i.length;r++){var a=i[r];t[a[0]]="string"==typeof a[1]&&n.includes(a[0])?JSON.parse(a[1]):a[1]}return t}},{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this,r=this.diode.goldenlayout.eventHub;this.on(this._project.eventString("-req-new-sdfg"),(function(e){"string"==typeof e&&(e=(0,q.a)(e)),e.sdfg_name===t.getState().sdfg_name&&(setTimeout((function(){return r.emit(t.project().eventString("new-sdfg"),"ok")}),1),t.create_renderer_pane(e,!0))})),this.on(this._project.eventString("-req-sdfg-msg"),(function(e){var i=t.message_handler_filter(e);void 0===i&&(i="ok"),setTimeout((function(){return r.emit(n._project.eventString("sdfg-msg"),i)}),1)})),this.on(this._project.eventString("-req-sdfg_props"),(function(e){null!=e&&t.discardInvalidated(e);var i=t.getChangedSDFGPropertiesFromState(),a={};a[t.getState().sdfg_name]=i,setTimeout((function(){return r.emit(n._project.eventString("sdfg_props"),a)}),1)}),!0),this.on(this.project().eventString("-req-property-changed-"+this.getState().created),(function(e){setTimeout((function(){return r.emit(t.project().eventString("property-changed-"+t.getState().created),"ok")}),1),"symbol-properties"==e.type?t.symbolPropertyChanged(e.element,e.name,e.value):t.propertyChanged(e.element,e.name,e.value)}),!0),this.on(this.project().eventString("-req-delete-data-symbol-"+this.getState().created),(function(e){setTimeout((function(){return r.emit(t.project().eventString("delete-data-symbol-"+t.getState().created),"ok")}),1),t.removeDataSymbol(e)})),this.on(this.project().eventString("-req-add-data-symbol-"+this.getState().created),(function(e){setTimeout((function(){return r.emit(t.project().eventString("add-data-symbol-"+t.getState().created),"ok")}),1),t.addDataSymbol(e.type,e.name)})),this.on(this.project().eventString("-req-draw-perfinfo"),(function(e){setTimeout((function(){return r.emit(n._project.eventString("draw-perfinfo"),"ok")}),1),t._analysis_values=e.map((function(e){return{forProgram:e[0],AnalysisName:e[1],runopts:e[2],forUnifiedID:e[3],forSuperSection:e[4],forSection:e[5],data:JSON.parse(e[6])}})),t.renderer_pane.drawAllPerfInfo()})),this.on(this.project().eventString("-req-sdfg_object"),(function(e){var n=t.getSDFGDataFromState(),i="SDFG"==n.type?n:n.sdfg,a={};a[t.getState().sdfg_name]=i,setTimeout((function(){return r.emit(t.project().eventString("sdfg_object"),a)}),1)}),!0)}},{key:"removeDataSymbol",value:function(e){for(var t=this.getSDFGDataFromState().sdfg,n=!1,r=0,i=Object.keys(t.attributes._arrays);r<i.length;r++){var a=i[r];if(a==e){delete t.attributes._arrays[a],n=!0;break}}n||console.error("Did not find symbol "+name+" in SDFG, this is a fatal error");var o=this.getState();"SDFG"==o.type?console.error("Defensive programming no longer allowed; change input"):o.sdfg_data.sdfg=t,this.resetState(o),this.diode.refreshSDFG()}},{key:"addDataSymbol",value:function(e,t){if(""!=t){var n="";"Scalar"==e?n="Scalar":"Array"==e&&(n="Array");for(var r={type:n,attributes:{dtype:"int32"}},i=this.getSDFGDataFromState().sdfg,a=!1,o=0,s=Object.keys(i.attributes._arrays);o<s.length;o++)if(s[o]==t){a=!0;break}if(a)this.diode.toast("Cannot add symbol","A symbol with name "+t+" does already exist.","error",3e3);else{i.attributes._arrays[t]=r;var u=this.getState();"SDFG"==u.type?console.error("Defensive programming no longer allowed; change input"):u.sdfg_data.sdfg=i,this.resetState(u),this.diode.refreshSDFG()}}else alert("Invalid symbol name. Enter a symbol name in the input field")}},{key:"analysisProvider",value:function(e,t){var n=null;if(null!=t&&(n=parseInt(t.stateid)<<16|parseInt(t.nodeid)),console.log("analysisProvider",e,t),"getstates"==e)return this._analysis_values.map((function(e){return e.forUnifiedID>>16&65535}));if("getnodes"==e)return this._analysis_values.map((function(e){return 65535&e.forUnifiedID}));if("all_vec_analyses"==e)return this._analysis_values.filter((function(e){return"VectorizationAnalysis"==e.AnalysisName})).filter((function(e){return e.forUnifiedID==n}));if("CriticalPathAnalysis"==e)return this._analysis_values.filter((function(e){return"CriticalPathAnalysis"==e.AnalysisName})).filter((function(e){return e.forUnifiedID==n}));if("ParallelizationAnalysis"==e)return this._analysis_values.filter((function(e){return"ThreadAnalysis"==e.AnalysisName})).filter((function(e){return e.forUnifiedID==n}));if("MemoryAnalysis"==e)return this._analysis_values.filter((function(e){return"MemoryAnalysis"==e.AnalysisName})).filter((function(e){return e.forUnifiedID==n}));if("MemOpAnalysis"==e)return this._analysis_values.filter((function(e){return"MemoryOpAnalysis"==e.AnalysisName})).filter((function(e){return e.forUnifiedID==n}));if("CacheOpAnalysis"==e)return this._analysis_values.filter((function(e){return"CacheOpAnalysis"==e.AnalysisName})).filter((function(e){return e.forUnifiedID==n}));if("defaultRun"==e)return function(e){var t=e.map((function(e){var t=[];return e.runopts.replace(/OMP_NUM_THREADS=(\d+)/gm,(function(e,n){return t.push(n)})),t})),n=Math.max.apply(Math,(0,s.Z)(t.map((function(e){return parseInt(e)}))));return e.filter((function(e){return e.runopts=="# ;export OMP_NUM_THREADS="+n+"; Running in multirun config"}))};throw"#TODO"}},{key:"message_handler_filter",value:function(e){if((e=JSON.parse(e)).sdfg_name==this.getState().sdfg_name&&("clear-highlights"==e.type&&(this.highlighted_elements&&this.highlighted_elements.forEach((function(e){e&&(e.highlighted=!1)})),this.highlighted_elements=[],this.renderer_pane.draw_async()),"highlight-elements"==e.type)){this.highlighted_elements&&this.highlighted_elements.forEach((function(e){e&&(e.highlighted=!1)})),this.highlighted_elements=[];var t,n=H(e.elements);try{for(n.s();!(t=n.n()).done;){var r=t.value,i=r[0],a=r[1],o=r[2],s=null,u=null;if(void 0!==(u=i>=0?this.renderer_pane.sdfg_list[i]:this.renderer_pane.graph)){if(-1==a)s=u.node(o);else{var l=u.node(a);if(void 0===l)continue;s=l.data.graph.node(o)}void 0!==s&&this.highlighted_elements.push(s)}}}catch(e){n.e(e)}finally{n.f()}this.highlighted_elements.forEach((function(e){e&&(e.highlighted=!0)})),this.renderer_pane.draw_async()}}},{key:"has_component",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;if(t||(t=this.diode.goldenlayout.root),"componentName"in t&&t.componentName===e)return t;if("contentItems"in t){var n,r=H(t.contentItems);try{for(r.s();!(n=r.n()).done;){var i=n.value,a=this.has_component(e,i);if(a)return a}}catch(e){r.e(e)}finally{r.f()}}return null}},{key:"render_free_variables",value:function(e){var t=this,n=this.getSDFGDataFromState();"SDFG"!=n.type&&(n=n.sdfg),this.diode.replaceOrCreate(["render-free-vars"],"PropWinComponent",{data:n,calling_context:this.created},(function(){console.log("Calling recreation function"),t.diode.addContentItem({type:"component",componentName:"PropWinComponent",componentState:{}}),setTimeout((function(){return t.render_free_variables(e)}),1)}))}},{key:"merge_properties",value:function(e,t,n,r){var i,a=B.f4.getAttributeNames(e),o=B.f4.getAttributeNames(n),s={},u=H(a);try{for(u.s();!(i=u.n()).done;){var l=i.value,c=B.f4.getMetaFor(e,l);if(c.indirected)s["_meta_"+l]=c,s[l]=e.attributes[l];else{var f=JSON.parse(JSON.stringify(c));f.category=e.type+" - "+f.category,s["_meta_"+t+l]=f,s[t+l]=e.attributes[l]}}}catch(e){u.e(e)}finally{u.f()}var d,p=H(o);try{for(p.s();!(d=p.n()).done;){var h=d.value,m=B.f4.getMetaFor(n,h);if(!m.indirected){var v=JSON.parse(JSON.stringify(m));v.category=n.type+" - "+v.category,v._noderef=n.node_id,s["_meta_"+r+h]=v,s[r+h]=n.attributes[h]}}}catch(e){p.e(e)}finally{p.f()}var y=JSON.parse(JSON.stringify(e));return y.attributes=s,y}},{key:"getSDFGPropertiesFromState",value:function(){return this.getSDFGDataFromState().sdfg_props}},{key:"getSDFGDataFromState",value:function(){var e=this.getState(),t=null;for("string"==typeof(t=null!=e.sdfg?e:e.sdfg_data)&&(t=JSON.parse(t));"string"==typeof t.sdfg;)t.sdfg=(0,q.a)(t.sdfg);return t}},{key:"renderProperties",value:function(e){var t=e.data;this.diode.renderPropertiesInWindow(this,e,t)}},{key:"getSDFGElementReference",value:function(e,t){return null!=e&&e.constructor==Object?this.getEdgeReference(e,t):this.getNodeReference(e,t)}},{key:"getEdgeReference",value:function(e,t){var n=this.getSDFGDataFromState().sdfg;if(null==t){var r,i=H(n.edges);try{for(i.s();!(r=i.n()).done;){var a=r.value;if(a.src==e.src&&a.dst==e.dst)return[a.attributes.data,n]}}catch(e){i.e(e)}finally{i.f()}}var o,s=H(n.nodes);try{for(s.s();!(o=s.n()).done;){var u=o.value;if(u.id==t){var l,c=H(u.edges);try{for(c.s();!(l=c.n()).done;){var f=l.value;if(f.src==e.src&&f.dst==e.dst)return[f.attributes.data,n]}}catch(e){c.e(e)}finally{c.f()}break}}}catch(e){s.e(e)}finally{s.f()}}},{key:"getNodeReference",value:function(e,t){var n,r=this.getSDFGDataFromState().sdfg,i=H(r.nodes);try{for(i.s();!(n=i.n()).done;){var a=n.value;if(a.id==t){if(null==e)return[a,r];var o,s=H(a.nodes);try{for(s.s();!(o=s.n()).done;){var u=o.value;if(u.id==e)return[u,r]}}catch(e){s.e(e)}finally{s.f()}break}}}catch(e){i.e(e)}finally{i.f()}}},{key:"symbolPropertyChanged",value:function(e,t,n){console.log("symbolPropertyChanged",t,n);for(var r=this.getSDFGDataFromState().sdfg,i=!1,a=e.data(),o=0,s=Object.keys(r.attributes._arrays);o<s.length;o++){var u=s[o];if(u==a[0]){r.attributes._arrays[u].attributes[t]=n,i=!0;break}}i||console.error("Did not find symbol "+t+" in SDFG, this is a fatal error");var l=this.getState();"SDFG"==l.type?console.error("Defensive programming no longer allowed; change input"):l.sdfg_data.sdfg=r,this.resetState(l),this.diode.refreshSDFG()}},{key:"propertyChanged",value:function(e,t,n){e.element.attributes[t]=n;var r=this.renderer_pane.sdfg,i=this.getState();"SDFG"==i.type?i=r:i.sdfg_data.sdfg=r,this.resetState(i),this.diode.refreshSDFG()}},{key:"create_renderer_pane",value:function(){var e=this,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0;null==t&&(t=this.getState().sdfg_data);var n=t;n="string"==typeof n?(0,q.a)(t):"sdfg"in t?t:{sdfg:t},console.assert(void 0===n.sdfg_props);var r=this.getState();if(console.assert(null!=r.sdfg_data),delete r.sdfg_data,this.resetState(r),this.saveToState({sdfg_data:n}),null!==this.renderer_pane)this.renderer_pane.set_sdfg(n.sdfg);else{var i=new F.U(n.sdfg,this.container.getElement()[0],(function(t,n,r,i,a,o,s){return e.on_renderer_mouse_event(t,n,r,i,a,o,s)}),null,!1,"white");this.renderer_pane=i}this.render_free_variables(!0)}},{key:"on_renderer_mouse_event",value:function(e,t,n,r,i,a,o){var s=this,u=r.states,l=r.nodes,c=r.edges,f=r.isedges,d=r.connectors,p=u.length+l.length+c.length+f.length+d.length,h=null;if(a.length>0?h=a[0]:p=0,"click"!==e&&"doubleclick"!==e&&"mousedown"!==e&&"contextmenu"!==e&&"wheel"!==e||this.contextmenu&&(this.contextmenu.destroy(),this.contextmenu=null),0==p&&"click"===e)return this.highlighted_elements&&this.highlighted_elements.forEach((function(e){e&&(e.stroke_color=null)})),this.render_free_variables(!1),!0;if(0==p&&"contextmenu"===e){var m=new z.x;return m.addOption("SDFG Properties",(function(e){s.render_free_variables(!0)})),m.show(t.x,t.y),this.contextmenu=m,!1}l.length+c.length+f.length===0&&u.length;var v=null,y=null;if(u.length>0&&(v=u[0].id),f.length>0&&(y=f[0].id),l.length>0?y=l[0].id:c.length>0&&(y=c[0].id),"contextmenu"===e){var g={x:t.x,y:t.y},_=i.sdfg.attributes.name,b=new z.x,x=h?h.sdfg:null,w=null;return h instanceof State?w=h.data.state:h instanceof SDFGNode?(w=h.data.node).type.endsWith("Exit")&&(w=x.nodes[h.parent_id].nodes[w.scope_entry]):w=null,w&&"is_collapsed"in w.attributes&&b.addOption(w.attributes.is_collapsed?"Expand":"Collapse",(function(e){w.attributes.is_collapsed=!w.attributes.is_collapsed,s.renderer_pane.relayout(),s.renderer_pane.draw_async()})),b.addOption("Show transformations",(function(e){console.log("'Show transformations' was clicked"),s.project().request(["highlight-transformations-"+_],(function(e){}),{params:{state_id:v,node_id:y}})})),b.addOption("Apply transformation ▶",(function(e){console.log("'Apply transformation' was clicked"),s.project().request(["get-transformations-"+_],(function(e){console.log("get-transformations response: ",e);var t,n=Object.values(e)[0],r=new z.x,i=H(n);try{var a=function(){var e=t.value;r.addOption(e.opt_name,(function(t){s.project().request(["apply-transformation-"+_],(function(e){}),{params:e.id_name})}))};for(i.s();!(t=i.n()).done;)a()}catch(e){i.e(e)}finally{i.f()}r.show(g.x+b.width(),g.y)}),{params:{state_id:v,node_id:y}}),e.preventDefault(),e.stopPropagation()})),b.addOption("Show Source Code",(function(e){console.log("go to source code")})),b.addOption("Show Generated Code",(function(e){console.log("go to generated code")})),b.addOption("Properties",(function(e){console.log("Force-open property pane")})),b.show(g.x,g.y),this.contextmenu=b,!1}return"click"!==e||(this.highlighted_elements&&this.highlighted_elements.forEach((function(e){e&&(e.stroke_color=null)})),this.highlighted_elements=a,setTimeout((function(){console.log("sdfg",h.sdfg),h instanceof Edge&&null!==h.parent_id&&h.sdfg.nodes[v].edges[h.id].dst;var e=function(e){var t=[];e.forEach((function(e){var n,r=e.attributes,i=H(Object.keys(r).filter((function(e){return!e.startsWith("_meta_")})));try{for(i.s();!(n=i.n()).done;){var a=n.value,o=r[a],s=r["_meta_"+a];if(null!=s){var u=JSON.parse(JSON.stringify(s));u.value=o,u.name=a,t.push({property:u,element:e,sdfg:h.sdfg,category:e.type+" - "+u.category})}}}catch(e){i.e(e)}finally{i.f()}})),s.renderProperties({data:t})};if(h instanceof Edge)e([h.data]);else if(h instanceof SDFGNode){var t=h.data.node;t.parent_id=h.parent_id;var n=h.sdfg.nodes[h.parent_id];if(t.type.endsWith("Entry")){var r=(0,U.GS)(n.nodes,t),a=i.sdfg_list[h.sdfg.sdfg_list_id].node(h.parent_id).data.graph.node(r.id);s.highlighted_elements.push(a),e([t,r])}else if(t.type.endsWith("Exit")){var o=parseInt(t.scope_entry),u=n.nodes[o],l=i.sdfg_list[h.sdfg.sdfg_list_id].node(h.parent_id).data.graph.node(u.id);s.highlighted_elements.push(l),e([u,t])}else"AccessNode"===t.type?e([t,h.sdfg.attributes._arrays[t.attributes.data]]):e([t])}else h instanceof State&&e([h.data.state]);s.highlighted_elements.forEach((function(e){e&&(e.stroke_color="red")})),i.draw_async()}),0)),!1}}]),o}(x);function G(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var J=globalThis.$,$=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n))._html_container=null,i.container.setTitle("Properties"),i}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this.diode.goldenlayout.eventHub;this.on(this.project().eventString("-req-display-properties"),(function(e){setTimeout((function(){return n.emit(t.project().eventString("display-properties"),"ok")}),1),t.getHTMLContainer().innerHTML="";var r=e.params;"string"==typeof r&&(r=JSON.parse(r)),t.diode.renderProperties(e.transthis,e.node,r,t.getHTMLContainer(),e.options)})),this.on(this.project().eventString("-req-render-free-vars"),(function(e){setTimeout((function(){return n.emit(t.project().eventString("render-free-vars"),"ok")}),1),t.renderDataSymbols(e.calling_context,e.data)}))}},{key:"renderDataSymbolProperties",value:function(e,t){var n={data:function(){return t}};this.diode.renderPropertiesInWindow(e,n,t[1].attributes,{backaction:function(){},type:"symbol-properties"})}},{key:"removeDataSymbol",value:function(e,t){this.project().request(["delete-data-symbol-"+e],(function(e){}),{params:t})}},{key:"addDataSymbol",value:function(e,t,n){this.project().request(["add-data-symbol-"+e],(function(e){}),{params:{name:n,type:t}})}},{key:"renderDataSymbols",value:function(e,t){var n=this;if(null!=t){var r=new d.i;r.setHeaders("Symbol","Type","Dimensions","Controls");var i=[].concat((0,s.Z)(Object.keys(t.attributes.symbols)),["SwitchToArrays"],(0,s.Z)(Object.entries(t.attributes._arrays))),a=e;console.assert(null!=a&&"string"==typeof a);var o,u=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return G(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?G(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(i);try{var l=function(){var e=o.value;if("SwitchToArrays"==e)return r.addRow("Arrays").childNodes.forEach((function(e){e.colSpan=4,e.style="text-align:center;"})),"continue";if("null"==e[0]||null==e[1]||"string"==typeof e||e instanceof String)return"continue";var t=document.createElement("button");t.addEventListener("click",(function(t){n.renderDataSymbolProperties(a,e)})),t.innerText="Edit";var i=document.createElement("button");i.addEventListener("click",(function(t){n.removeDataSymbol(a,e[0])})),i.innerText="Delete";var s=document.createElement("div");s.appendChild(t),s.appendChild(i),r.addRow(e[0],e[1].type,e[1].attributes.dtype+"["+e[1].attributes.shape+"]",s)};for(u.s();!(o=u.n()).done;)l()}catch(e){u.e(e)}finally{u.f()}r.addRow("Add data symbols").childNodes.forEach((function(e){e.colSpan=4,e.style="text-align:center;"}));var c=document.createElement("input");c.type="text",c.placeholder="Symbol name";var f=document.createElement("button");f.innerText="Add Scalar",f.addEventListener("click",(function(){n.addDataSymbol(a,"Scalar",c.value)}));var p=document.createElement("button");p.addEventListener("click",(function(){n.addDataSymbol(a,"Array",c.value)})),p.innerText="Add Array";var h=document.createElement("div");h.appendChild(f),h.appendChild(p),r.addRow(c,h).childNodes.forEach((function(e){e.colSpan=2,e.style="text-align:center;"}));var m=document.createElement("div"),v=document.createElement("button");v.addEventListener("click",(function(){Be("/dace/api/v1.0/expand/",{sdfg:t},(function(e){if(4===e.readyState&&200===e.status){var t=(0,q.a)(e.response);void 0!==t.error&&n.diode.handleErrors(n,t),n.project().request(["append-history"],(function(e){}),{params:{new_sdfg:t.sdfg,item_name:"Expand library nodes"}})}}))})),v.innerText="Expand all library nodes",m.appendChild(v),r.addRow(m),this.getHTMLContainer().innerHTML="",r.setCSSClass("free_symbol_table"),r.createIn(this.getHTMLContainer())}else console.warn("Data has not been set - creating empty window")}},{key:"getHTMLContainer",value:function(){return J(this.container.getElement()).children(".sdfgpropdiv")[0]}},{key:"createFromState",value:function(){this.getHTMLContainer().setAttribute("data-hint",'{"type": "DIODE", "name": "Property_Window"}');var e=this.getState();if(null!=e.params&&null!=e.params.params){var t=e.params;this.diode.renderProperties(t.transthis,t.node,JSON.parse(t.params),this.getHTMLContainer())}}}]),o}(x);function V(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var K=globalThis.$,Y=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){return(0,r.Z)(this,o),a.call(this,e,t,n)}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e),this.diode.goldenlayout.eventHub,this._autorefresher=null}},{key:"destroy",value:function(){clearInterval(this._autorefresher),(0,A.Z)((0,f.Z)(o.prototype),"destroy",this).call(this)}},{key:"refreshUI",value:function(e){var t=this;"string"==typeof e&&(e=JSON.parse(e)),null==e.elements&&(e.elements=[]);var n=K(this.container.getElement())[0];n.innerHTML="";var r=document.createElement("div");K(r).css("overflow","auto"),K(r).width("100%"),K(r).height("100%");var i=document.createElement("table"),a=document.createElement("thead"),o=document.createElement("tr");["position","clientID","state","options"].map((function(e){var t=document.createElement("th");return t.innerText=e,t})).forEach((function(e){return o.appendChild(e)})),a.appendChild(o),i.appendChild(a);var s,u=document.createElement("tbody"),l=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return V(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?V(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(e.elements);try{var c=function(){var e=s.value,n=e.options;"string"==typeof n||(null==n?null!=e.output&&"orphan"==e.type&&((n=document.createElement("button")).onclick=function(n){t.diode.addContentItem({type:"component",componentName:"TerminalComponent",componentState:{current_value:e.output},title:"Output"})},n.innerText="Output"):(null==n.type&&(n=n.perfopts),n=n.mode+", coresets "+n.core_counts));var r=[e.index,e.client_id,e.state,n],i=document.createElement("tr");r.map((function(e){var t=document.createElement("td");return"string"==typeof e||"number"==typeof e?t.innerText=e:t.appendChild(e),t})).forEach((function(e){return i.appendChild(e)})),u.appendChild(i)};for(l.s();!(s=l.n()).done;)c()}catch(e){l.e(e)}finally{l.f()}i.appendChild(u),r.appendChild(i),n.appendChild(r),K(i).DataTable()}},{key:"create",value:function(){var e=this;this._autorefresher=setInterval((function(t){e.getCurrentQueue()}),2e3),K(this.container.getElement()).css("overflow","auto"),this.refreshUI({})}},{key:"getCurrentQueue",value:function(){var e=this;Be("/dace/api/v1.0/dispatcher/list/",{},(function(t){4===t.readyState&&200===t.status&&e.refreshUI(t.response)}))}}]),o}(x);function X(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var Q=globalThis.$,ee=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){return(0,r.Z)(this,o),a.call(this,e,t,n)}return(0,i.Z)(o,[{key:"create",value:function(){var e=this,t='<svg width="50" height="50" version="1.1" viewBox="0 0 13.2 13.2" xmlns="http://www.w3.org/2000/svg"><g transform="translate(0 -284)"><g fill="none" stroke="#008000" stroke-width="2.65"><path d="m6.61 285v10.6"/><path d="m1.32 290h10.6"/></g></g></svg>';t="data:image/svg+xml;base64,"+btoa(t),this.container.setTitle("Start Page");var n=Q(this.container.getElement())[0],r=document.createElement("h1");r.id="startpage_header",r.innerText="DIODE",n.appendChild(r);var i=document.createElement("div");i.id="startpage_container",i.classList="flex_row",i.style="width: 100%;height:100%;";var a=document.createElement("div");a.id="startpage_recent";var o=document.createElement("div");o.innerText="New",o.classList="startpage_title",a.appendChild(o),a.appendChild(this.createStartpageListElement("Create a new Project",null,null,t,(function(t){e.container.close(),e.diode.openUploader("code-python")})));var s=document.createElement("div");s.innerText="Recent",s.classList="startpage_title",a.appendChild(s);var u=document.createElement("div");u.id="additional_resources";var l=document.createElement("div");l.innerText="Resources",l.classList="startpage_title",u.appendChild(l);var c,f=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return X(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?X(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(g.T.getSavedProjects());try{var d=function(){var t=c.value;console.log("p",t);var n=g.T.getProjectData(t);a.appendChild(e.createStartpageListElement(t,n.last_saved,n.description,void 0,(function(n){g.T.load(e.diode,t)})))};for(f.s();!(c=f.n()).done;)d()}catch(e){f.e(e)}finally{f.f()}var p='\n        <svg xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://creativecommons.org/ns#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:svg="http://www.w3.org/2000/svg" xmlns="http://www.w3.org/2000/svg" xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd" xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape" id="svg13" height="60.891094" width="57.565113" version="1.0" viewBox="0 0 143.91279 152.22773" inkscape:version="0.92.3 (2405546, 2018-03-11)">\n          \n          <metadata id="metadata17">\n            \n          </metadata>\n          <defs id="defs3">\n            <pattern y="0" x="0" height="6" width="6" patternUnits="userSpaceOnUse" id="EMFhbasepattern"/>\n          </defs>\n          <path id="path5" d="m 0,0 h 71.95639 c 39.75591,0 71.95639,34.079345 71.95639,76.11387 0,42.05451 -32.20048,76.11387 -71.95639,76.11387 H 0 Z" style="fill:#0070c0;fill-opacity:1;fill-rule:evenodd;stroke:none"/>\n          <path id="path7" d="M 76.913385,27.183525 115.29013,75.154451 76.913385,123.12538 Z" style="fill:#ffffff;fill-opacity:1;fill-rule:evenodd;stroke:none"/>\n          <path id="path9" d="M 28.622652,27.183525 66.999394,50.049666 V 100.27923 L 28.622652,123.12538 Z" style="fill:#ffffff;fill-opacity:1;fill-rule:evenodd;stroke:none"/>\n          <path id="path11" d="m 67.079345,75.234403 h 9.93398" style="fill:none;stroke:#ffffff;stroke-width:3.99757719px;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:8;stroke-dasharray:none;stroke-opacity:1"/>\n        </svg>';p="data:image/svg+xml;base64,"+btoa(p),u.appendChild(this.createStartpageListElement("Visit DaCe on GitHub",null,null,"external_lib/GitHub-Mark.png",(function(e){window.open("https://github.com/spcl/dace","_blank")}))),u.appendChild(this.createStartpageListElement("Visit project page",null,null,p,(function(e){window.open("https://spcl.inf.ethz.ch/Research/DAPP/","_blank")}))),i.appendChild(a),i.appendChild(u),n.appendChild(i)}},{key:"createStartpageListElement",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:function(e){return e},a='<svg width="50" height="50" version="1.1" viewBox="0 0 13.229 13.229" xmlns="http://www.w3.org/2000/svg"><g transform="translate(0 -283.77)" fill="none" stroke="#000" stroke-linecap="round" stroke-width=".68792"><path d="m3.3994 287.29v6.9099l6.5603-3.7876-6.5644-3.7899z" stroke-linejoin="round"/><g><path d="m3.3191 290.39h-2.6127"/><path d="m12.624 290.41h-2.6647v-3.3585"/><path d="m9.9597 290.41v2.9962"/></g></g></svg>';null==r&&(r="data:image/svg+xml;base64,"+btoa(a));var o=document.createElement("div");o.classList="startpage_list_element";var s=document.createElement("div");s.classList="flex_row";var u=document.createElement("img");u.src=r,u.width="50",u.height="50",s.appendChild(u);var l=document.createElement("div");l.classList="flex_column";var c=document.createElement("span");c.innerText=e;var f=document.createElement("span");f.innerText=n,l.appendChild(c),null!=n?l.appendChild(f):(c.style.fontSize="1.2rem",l.style.justifyContent="center"),s.appendChild(l);var d=document.createElement("div");d.classList="flex_column";var p=document.createElement("span");p.innerText=t;var h=document.createElement("span");return null!=p&&(d.appendChild(p),d.appendChild(h)),s.appendChild(d),o.appendChild(s),o.addEventListener("click",i),o}}]),o}(x);function te(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return ne(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?ne(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function ne(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var re=globalThis.$,ie=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){return(0,r.Z)(this,o),a.call(this,e,t,n)}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this.diode.goldenlayout.eventHub;this.on(this.project().eventString("-req-update-tfh"),(function(e){var r=t.project().getTransformationHistory();t.create(r),setTimeout((function(){return n.emit(t.project().eventString("update-tfh"),"ok")}),1)}))}},{key:"create",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[],t=this.container.getElement();re(t).css("overflow","auto"),re(t)[0].setAttribute("data-hint",'{"type": "DIODE_Element", "name": "TransformationHistory"}'),(t=re(t)[0]).innerHTML="";var n=document.createElement("div");n.classList="transformation_history_base";var r=document.createElement("div");r.classList="transformation_history_list",this._history_scroll_div=r,n.appendChild(r),t.innerHTML="",t.appendChild(n);var i,a=0,o=te(e);try{for(o.s();!(i=o.n()).done;){var s=i.value;this.addElementToHistory(s,a),++a}}catch(e){o.e(e)}finally{o.f()}}},{key:"addElementToHistory",value:function(e,t){var n=this,r=this._history_scroll_div,i=document.createElement("div");i.classList="transformation_history_list_element";var a=document.createElement("div");a.classList="transformation_history_list_element_title",a.innerText=Object.values(e)[0][0].name;var o=document.createElement("div");o.classList="flex_row transformation_history_list_element_control";var s=document.createElement("div");s.classList="revert-button",s.title="revert",s.innerHTML="<i class='material-icons'>undo</i>",re(s).hover((function(){i.classList.add("revert-hovered")}),(function(){i.classList.remove("revert-hovered")})),s.addEventListener("click",(function(e){var r=n.project().getTransformationSnapshots()[t];n.diode.multiple_SDFGs_available({compounds:r[1]}),n.project().discardTransformationsAfter(t),n.diode.gatherProjectElementsAndCompile(n,{},{sdfg_over_code:!0})})),o.appendChild(s),i.appendChild(a),i.appendChild(o),r.appendChild(i)}}]),o}(x);function ae(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return oe(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?oe(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function oe(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var se=globalThis.$,ue=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;(0,r.Z)(this,o),(i=a.call(this,e,t,n))._tree_view=null,i._current_root=null;var s=i.container.getElement();return se(s).css("overflow","auto"),i.operation_running=!1,i}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this,r=this.diode.goldenlayout.eventHub;this.on(this._project.eventString("-req-extend-optgraph"),(function(e){var i=e;"string"==typeof i&&JSON.parse(e);var a=i[t.getState().for_sdfg];void 0!==a&&(setTimeout((function(){return r.emit(n._project.eventString("extend-optgraph"),"ok")}),1),t.create(a))})),this.on(this._project.eventString("-req-optpath"),(function(e){var i={};i[t.getState().for_sdfg]=[],setTimeout((function(){return r.emit(n._project.eventString("optpath"),i)}),1)}));var i=this.getState().for_sdfg;this.on(this._project.eventString("-req-new-optgraph-"+i),(function(e){var a=JSON.parse(e);void 0!==a.matching_opts&&(setTimeout((function(){return r.emit(n._project.eventString("new-optgraph-"+i),"ok")}),1),t.create(a))})),this.on(this.project().eventString("-req-highlight-transformations-"+i),(function(e){t.getTransformations(e).forEach((function(e){return t.highlightTransformation(e)}))})),this.on(this.project().eventString("-req-get-transformations-"+i),(function(e){var a=t.getTransformations(e);setTimeout((function(){return r.emit(n._project.eventString("get-transformations-"+i),a)}),1)})),this.on(this.project().eventString("-req-apply-transformation-"+i),(function(e){for(var n=t.getState().optstruct,r=0,i=Object.values(n);r<i.length;r++){var a,o=ae(i[r]);try{for(o.s();!(a=o.n()).done;){var s=a.value;void 0!==s&&s.id_name==e&&s.representative.dispatchEvent(new Event("click"))}}catch(e){o.e(e)}finally{o.f()}}})),this.on(this.project().eventString("-req-locate-transformation-"+i),(function(e){t.locateTransformation.apply(t,(0,s.Z)(JSON.parse(e)))})),this.on(this.project().eventString("-req-apply-adv-transformation-"+i),(function(e){var n=JSON.parse(e);t.applyTransformation.apply(t,(0,s.Z)(n))})),this.on(this.project().eventString("-req-append-history"),(function(e){t.appendHistoryItem(e.new_sdfg,e.item_name)})),this.on(this.project().eventString("-req-property-changed-"+this.getState().created),(function(e){t.propertyChanged(e.element,e.name,e.value),setTimeout((function(){return r.emit(t.project().eventString("property-changed-"+t.getState().created),"ok")}),1)}))}},{key:"getTransformations",value:function(e){for(var t=[],n="s"+e.state_id+"_"+e.node_id,r=this.getState().optstruct,i=0,a=Object.values(r);i<a.length;i++){var o,s=ae(a[i]);try{for(s.s();!(o=s.n()).done;){var u=o.value;void 0!==u&&u.affects.includes(n)&&t.push(u)}}catch(e){s.e(e)}finally{s.f()}}return t}},{key:"highlightTransformation",value:function(e){for(var t=e.representative,n=t.parentNode;n;)n.classList.remove("at_collapse"),n=n.previousElementSibling;se(t).css("color","red"),setTimeout((function(e){se(t).css("color","")}),5e3)}},{key:"propertyChanged",value:function(e,t,n){return this.propertyChanged2(e,t,n)}},{key:"propertyChanged2",value:function(e,t,n){e.element[t]=n}},{key:"renderProperties",value:function(e,t,n){var r=e.opt_params,i={data:function(){return e.opt_params}};this.diode.renderPropertiesInWindow(this,i,r,{type:"transformation",sdfg_name:this.getState().for_sdfg,opt_name:e.opt_name,pos:t,apply_params:n})}},{key:"sendHighlightRequest",value:function(e){this._project.request(["sdfg-msg"],(function(e){}),{params:JSON.stringify({type:"highlight-elements",sdfg_name:this.getState().for_sdfg,elements:e}),timeout:1e3})}},{key:"sendClearHighlightRequest",value:function(){this._project.request(["sdfg-msg"],(function(e){}),{params:JSON.stringify({sdfg_name:this.getState().for_sdfg,type:"clear-highlights"}),timeout:1e3})}},{key:"addNodes",value:function(e){var t,n=this,r={},i=ae(e);try{for(i.s();!(t=i.n()).done;){var a=t.value;void 0===r[a.opt_name]&&(r[a.opt_name]=[]),r[a.opt_name].push(a)}}catch(e){i.e(e)}finally{i.f()}for(var o=[],s=0,u=Object.entries(r);s<u.length;s++){var l=u[s],c=l[0],f=l[1];o.push([c,f])}var d,p=ae(o.sort((function(e,t){return e[0].localeCompare(t[0])})));try{for(p.s();!(d=p.n()).done;){var h=d.value,m=h[0],v=h[1],y=0,g=void 0;v.length>1&&function(){(g=document.createElement("div")).classList="flex_column";var e=document.createElement("div"),t=document.createElement("span");t.innerText=m,e.classList="at_group_header",e.appendChild(t),e.addEventListener("click",(function(t){e.classList.toggle("at_collapse")})),g.appendChild(e),n._transformation_list.appendChild(g)}();var _,b=ae(v);try{for(b.s();!(_=b.n()).done;){var x=_.value;this.addNode(x,y,g),++y}}catch(e){b.e(e)}finally{b.f()}}}catch(e){p.e(e)}finally{p.f()}var w=this.getState();w.optstruct=r,this.saveToState(w)}},{key:"locateTransformation",value:function(e,t,n){var r=this;console.log("locateTransformation",arguments),this.sendHighlightRequest(n);var i=this.getState(),a=i.optstruct[e][t].representative;se(a).css("background","green"),setTimeout((function(){r.sendClearHighlightRequest(),se(a).css("background","")}),1e3)}},{key:"applyTransformation",value:function(e,t,n){var r=this;if(!this.operation_running){this.operation_running=!0;var i=this.getState().optstruct,a={},o=JSON.parse(JSON.stringify(i[e.opt_name][t]));a[this.getState().for_sdfg]=[{name:n,params:{props:o.opt_params}}];var s=function(e){r.diode.gatherProjectElementsAndCompile(r,{optpath:a},{sdfg_over_code:!0},(function(){r.project().saveSnapshot(e.sdfg_object,a),r.project().request(["update-tfh"],(function(e){r.operation_running=!1}),{on_timeout:function(){r.operation_running=!1}})}),(function(){r.operation_running=!1}))};this.project().request(["sdfg_object"],(function(e){console.log("Got snapshot",e),"string"==typeof e.sdfg_object&&(e.sdfg_object=JSON.parse(e.sdfg_object)),setTimeout(s,10,e)}),{})}}},{key:"appendHistoryItem",value:function(e,t){var n=this;if(!this.operation_running){this.operation_running=!0;var r={};r[this.getState().for_sdfg]=[{name:t,params:{}}];var i=function(){n.diode.gatherProjectElementsAndCompile(n,{code:(0,q.n)(e)},{})};this.project().request(["sdfg_object"],(function(e){console.log("Got snapshot",e),"string"==typeof e.sdfg_object&&(e.sdfg_object=JSON.parse(e.sdfg_object)),n.project().saveSnapshot(e.sdfg_object,r),n.project().request(["update-tfh"],(function(e){n.operation_running=!1}),{on_timeout:function(){n.operation_running=!1}}),setTimeout(i,10)}),{})}}},{key:"addNode",value:function(e){var t=this,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0,r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:void 0,i=e.opt_name;0!=n&&(i+="$"+n),e.id_name=i;var a=void 0===r?this._transformation_list:r,o=document.createElement("div");o.classList="flex_row at_element";var s=document.createElement("div");s.innerText=i,s.addEventListener("mouseenter",(function(n){t.sendHighlightRequest(e.affects)})),s.addEventListener("mouseleave",(function(e){t.sendClearHighlightRequest()})),s.addEventListener("click",(function(r){t.applyTransformation(e,n,i)})),s.setAttribute("data-hint",'{"type": "transformation", "name": "'+e.opt_name+'"}'),e.representative=s;var u=document.createElement("div"),l=document.createElement("b");l.classList="",l.innerText="...",l.addEventListener("click",(function(r){t.renderProperties(e,n,[e,n,i])})),u.appendChild(l),o.appendChild(s),o.appendChild(u),a.appendChild(o)}},{key:"create",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0;if(null!=e){var t=this.getState();Object.assign(t,e),this.resetState(t)}var n=this.getState();"string"==typeof n&&(n=JSON.parse(n));var r=void 0;if(null!=n.matching_opts)r=n.matching_opts;else if(null!=n.optgraph_data){var i=JSON.parse(n.optgraph_data);r=i.matching_opts}var a=this.container.getElement()[0];a.innerHTML="";var o=document.createElement("div");o.classList="at_container";var s=document.createElement("div");this._transformation_list=s,o.appendChild(s),a.appendChild(o),null!=r&&this.addNodes(r)}}]),o}(x);function le(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var ce=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n)).editor=null,i}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this,r=this.diode.goldenlayout.eventHub;this.on(this._project.eventString("-req-new-error"),(function(e){setTimeout((function(e){return r.emit(n.project().eventString("new-error"),"ok")}),1);var i=e;t.setError(i)}))}},{key:"setError",value:function(e){console.log("error",e);var t="";if("string"==typeof e)this.editor.setValue(e);else if(Array.isArray(e)){var n,r=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return le(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?le(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(e);try{for(r.s();!(n=r.n()).done;){var i=n.value;null!=i.msg&&(t+=i.msg),console.log("Error element",i)}}catch(e){r.e(e)}finally{r.f()}this.editor.setValue(t)}this.saveToState({error:e})}},{key:"setEditorReference",value:function(e){var t=this;this.editor=e,this.container.getElement()[0].addEventListener("resize",(function(e){t.editor.resize()}))}}]),o}(x);var fe=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n))._settings_container=null,i}return(0,i.Z)(o,[{key:"create",value:function(){var e=this,t=this.container.getElement()[0],n=document.createElement("div"),r=document.createElement("div"),i={"Configuration name":"",Host:"localhost","Use SSH":!0,"SSH Key":this.diode.pubSSH(),"SSH Key override":"",Instrumentation:"off","Number of threads":"[0]"},a=[],o=null;o={propertyChanged:function(t,n,s){if("Configuration name"==n&&e.diode.getRunConfigs().map((function(e){return e["Configuration name"]})).includes(s)){for(var u=e.diode.getRunConfigs(s),l=function(){var e=f[c],t=u[e];a.find((function(t){return t.name==e})).value=t},c=0,f=Object.keys(u);c<f.length;c++)l();return i=u,r.innerHTML="",void e.diode.renderProperties(o,t,a,r,{})}i[n]=s}},(a=[{name:"Configuration name",type:"combobox",value:i["Configuration name"],options:this.diode.getRunConfigs().map((function(e){return e["Configuration name"]})),desc:"Name of this configuration"},{name:"Host",type:"hosttype",value:i.Host,desc:"Host executing the programs"}]).forEach((function(e){return e.category="General"}));var u=[{name:"Use SSH",type:"bool",value:i["Use SSH"],desc:"Use SSH. Mandatory for remote hosts, optional for localhost."},{name:"SSH Key",type:"str",value:i["SSH Key"],desc:"Public SSH key (id_rsa.pub) to add to remote authorized_keys. This key must not be password-protected!"},{name:"SSH Key override",type:"str",value:i["SSH Key override"],desc:"Override the identity key file (ssh option -i) with this value if your password-free key is not id_rsa"}];u.forEach((function(e){return e.category="Remote"}));var l=[{name:"Instrumentation",type:"selectinput",value:i.Instrumentation,options:["off","minimal","full"],desc:"Set instrumentation mode (CPU only)"},{name:"Number of threads",type:"list",value:i["Number of threads"],desc:"Sets the number of OpenMP threads.If multiple numbers are specified, the program is executed once for every number of threads specified. Specify 0 to use system default"}];l.forEach((function(e){return e.category="Profiling"})),a=[].concat((0,s.Z)(a),u,l);var c={data:function(){return a}};this.diode.renderProperties(o,c,a,r,{}),n.appendChild(r),t.appendChild(n);var f=document.createElement("button");f.innerText="Save",f.addEventListener("click",(function(t){e.diode.addToRunConfigs(i)})),t.appendChild(f)}}]),o}(x);var de=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n))._chart=null,i}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=this.diode.goldenlayout.eventHub,r=this;this.on(this.project().eventString("-req-new-time"),(function(e){setTimeout((function(e){return n.emit(r.project().eventString("new-time"),"ok")}),1),t.addTime(e.time)}))}},{key:"create",value:function(){var e=this.container.getElement()[0];e.innerHTML="";var t=document.createElement("canvas");e.appendChild(t);var n=this.getState();void 0===n.runtimes&&(n.runtimes=[]),console.log("Execution times loaded",n.runtimes);for(var r=[],i=0;i<n.runtimes.length;++i)r.push(i);this._chart=new Chart(t.getContext("2d"),{type:"bar",data:{labels:r,datasets:[{label:"Exec. times in s",backgroundColor:"blue",data:n.runtimes.map((function(e){return e}))}]},options:{responsive:!0,scales:{yAxes:[{display:!0,ticks:{beginAtZero:!0}}],xAxes:[{display:!0,ticks:{autoSkip:!0}}]},legend:{position:"top"},title:{display:!0,text:"Execution times"}}}),this._chart.update()}},{key:"addTime",value:function(e){var t=this.getState();void 0===t.runtimes&&(t.runtimes=[]),t.runtimes.push(e),this.resetState(t),this.create()}}]),o}(x);function pe(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var he=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){return(0,r.Z)(this,o),a.call(this,e,t,n)}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){var t=this;(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e);var n=!1;this._update_timeout=setInterval((function(){Be("/dace/api/v1.0/dispatcher/list/",{},(function(e){if(4===e.readyState&&200===e.status){var r,i=!0,a=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return pe(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?pe(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(JSON.parse(e.response).elements);try{for(a.s();!(r=a.n()).done;){var o=r.value.options;"string"==typeof o&&(console.log("o is ",o),"endgroup"==o&&(i=!1,n=!0))}}catch(e){a.e(e)}finally{a.f()}n&&i&&(n=!1,t.diode.load_perfdata())}}))}),2e3)}},{key:"close",value:function(){clearInterval(this._update_timeout),this._update_timeout=null,(0,A.Z)((0,f.Z)(o.prototype),"close",this).call(this)}},{key:"destroy",value:function(){(0,A.Z)((0,f.Z)(o.prototype),"destroy",this).call(this)}},{key:"create",value:function(){var e=this,t=this.container.getElement()[0];t.innerHTML="<h2>Instrumentation control</h2><p>Do not close this window while instrumented programs are running</p>";var n=document.createElement("a");n.innerText="Download perfdata database",n.href=base_url+"/dace/api/v1.0/perfdata/download/"+this.diode.getClientID()+"/",n.download="perfdata.sqlite3";var r=document.createElement("a");r.innerText="Download CAN",r.href=base_url+"/dace/api/v1.0/can/download/"+this.diode.getClientID()+"/",r.download="current.sqlite3";var i=document.createElement("button");i.innerText="Delete remote database",i.addEventListener("click",(function(){Be("/dace/api/v1.0/perfdata/reset/",{client_id:e.diode.getClientID()},(function(e){}))}));var a=document.createElement("button");a.innerText="Delete remote CAN",a.addEventListener("click",(function(){Be("/dace/api/v1.0/can/reset/",{client_id:e.diode.getClientID()},(function(e){}))}));var o=document.createElement("button");o.innerText="Display instrumentation results",o.addEventListener("click",(function(){e.diode.load_perfdata()}));var s=document.createElement("button");s.innerText="Show roofline",s.addEventListener("click",(function(){e.diode.show_roofline()}));var u=document.createElement("div");u.classList="flex_column",u.appendChild(n),u.appendChild(r),u.appendChild(i),u.appendChild(a),u.appendChild(o),u.appendChild(s),t.appendChild(u)}}]),o}(x),me=n(1318);function ve(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return ye(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?ye(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function ye(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var ge=0;function _e(e,t,n,r){var i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:"hard",a=function(){return e.canvas.width},o=function(){return e.canvas.height};e.save(),"soft"===i?e.setLineDash([15,15]):e.setLineDash([]),e.beginPath(),e.strokeStyle="black",e.lineWidth=3;var s=o()-t.top-t.bottom,u=s/n.steps,l=n.inv_step_value_func(r),c=o()-t.bottom-u*l;e.moveTo(t.left,c),e.lineTo(a()-t.right,c),e.stroke(),e.beginPath(),e.font="25px Arial",e.fillStyle="black",e.textAlign="right",e.textBaseline="bottom",e.fillText(r.toString()+" FLOP/c",a()-t.right,c),e.restore()}function be(e){return e.step_value_func((e.steps-0)*e.value_per_step)}function xe(e,t,n,r){var i=function(){return e.canvas.height},a=(i()-n.top-n.bottom)/t.steps,o=t.inv_step_value_func(r);return i()-n.bottom-a*o}function we(e,t,n,r){var i=(e.canvas.width-n.left-n.right)/t.steps,a=t.inv_step_value_func(r);return n.left+i*a}function Ee(e,t,n,r,i){var a=function(){return e.canvas.height};e.save(),e.strokeStyle="black",e.lineWidth=3;var o,s=(a()-t.top-t.bottom)/r.steps,u=(e.canvas.width-t.left-t.right)/n.steps,l=be(r),c=be(n),f=i*c;f=Math.min(f,l),o=Math.min(f/i,c);var d=r.inv_step_value_func(n.step_value_func(0)*i),p=a()-t.bottom-s*d,h=r.inv_step_value_func(f),m=a()-t.bottom-s*h,v=n.inv_step_value_func(o),y=t.left+u*v;e.moveTo(t.left,p),e.lineTo(y,m),e.stroke(),e.translate(y,-m+t.top+t.bottom);var g=Math.atan2(m-p,y-t.left);e.rotate(g),e.font="25px Arial",e.fillStyle="black",e.textAlign="right",e.textBaseline="bottom",e.fillText(i.toString()+" B/c",0,0),e.restore()}var Ne=[],Se=[],Me=[];function ke(e,t){e.clearRect(0,0,e.canvas.width,e.canvas.height),t.drawAxes(),t.drawComputeBounds(),t.drawBandwidthBounds(),t.connectDots(),t.drawDots()}function Oe(e,t,n,r,i,a){var o=arguments.length>6&&void 0!==arguments[6]?arguments[6]:5;e.save();var s=we(e,t,r,a),u=xe(e,n,r,i),l=o;e.fillStyle="red",e.fillRect(s-l,u-l,2*l,2*l),e.restore()}function Ce(e,t,n,r,i,a,o){var s=we(e,t,r,a),u=xe(e,n,r,i);Ne.push({x:s,y:u,floppercyc:i,flopperbyte:a,highlight:!1,id:o})}function Ae(e,t,n,r){var i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:void 0,a=20,o=t-r,s=t+r,u=n-a,l=u-r;e.save(),e.fillStyle="cyan",e.moveTo(t,n),e.beginPath(),e.lineTo(t-a,u),e.lineTo(o,u),e.lineTo(o,l),e.lineTo(s,l),e.lineTo(s,u),e.lineTo(t+a,u),e.lineTo(t,n),e.closePath(),e.stroke(),e.fill(),e.fillStyle="black",e.font="40px Arial",e.textBaseline="top",void 0!==i&&e.fillText("id: "+i,o+a,l+a),e.restore()}var Te=function(){function e(t,n,i,a){(0,r.Z)(this,e),this.ctx=t,this.margin=n,this.xoptions=i,this.yoptions=a}return(0,i.Z)(e,[{key:"drawAxes",value:function(){var e=this.ctx,t=this.margin,n=function(){return e.canvas.height};e.strokeStyle="black",e.lineWidth=2,e.beginPath(),e.moveTo(t().left,n()-t().bottom),e.lineTo(t().left,t().top),e.stroke(),e.closePath(),e.beginPath(),e.moveTo(t().left,n()-t().bottom),e.lineTo(e.canvas.width-t().right,n()-t().bottom),e.stroke(),e.closePath(),function(e,t,n){var r=function(){return e.canvas.width},i=function(){return e.canvas.height},a=n.steps,o=n.step_value_func,s=(r()-t.left-t.right)/a,u=t.left,l=i()-t.bottom;e.save();for(var c=1;c<a;++c){var f=o(c),d=u+c*s;e.beginPath(),e.strokeStyle="black",e.lineWidth=2,e.setLineDash([]),e.moveTo(d,l-5),e.lineTo(d,l+5),e.stroke(),e.beginPath(),e.strokeStyle="gray",e.setLineDash([5,15]),e.lineWidth=1,e.moveTo(d,t.top),e.lineTo(d,i()-t.bottom),e.stroke(),e.beginPath(),e.strokeStyle="black",e.setLineDash([]),e.lineWidth=1,e.font="30px Arial",e.textAlign="center",e.textBaseline="top",f<1&&(f=me.tV.valueToSensibleString(f,"fraction")),e.fillText(f.toString(),d,l+5)}e.beginPath(),e.strokeStyle="black",e.setLineDash([]),e.lineWidth=1,e.font="40px Arial",e.textAlign="center",e.textBaseline="top",e.fillText("Operational intensity [FLOP/byte]",t.left+(r()-t.left-t.right)/2,i()-t.bottom/2),e.restore()}(e,t(),this.xoptions),function(e,t,n){var r=function(){return e.canvas.height},i=n.steps,a=n.step_value_func,o=(r()-t.top-t.bottom)/i,s=t.left,u=r()-t.bottom;e.save();for(var l=1;l<i;++l){var c=a(l),f=u-l*o;e.beginPath(),e.strokeStyle="black",e.lineWidth=2,e.setLineDash([]),e.moveTo(s-5,f),e.lineTo(s+5,f),e.stroke(),e.beginPath(),e.strokeStyle="gray",e.setLineDash([5,15]),e.lineWidth=1,e.moveTo(t.left,f),e.lineTo(e.canvas.width-t.right,f),e.stroke(),e.beginPath(),e.strokeStyle="black",e.setLineDash([]),e.lineWidth=1,e.font="30px Arial",e.textAlign="right",e.textBaseline="middle",c<1&&(c=me.tV.valueToSensibleString(c,"fraction")),e.fillText(c.toString(),s-5,f)}r(),t.bottom,t.top,t.top,e.beginPath(),e.strokeStyle="black",e.setLineDash([]),e.lineWidth=1,e.font="40px Arial",e.textAlign="center",e.textBaseline="middle",e.translate(t.left,0),e.rotate(Math.PI/-2),e.fillText("Performance [FLOP/c]",-r()/2,-t.left/2),e.translate(-t.left,0),e.restore()}(e,t(),this.yoptions)}},{key:"drawDots",value:function(){var e,t=[],n=ve(Ne);try{for(n.s();!(e=n.n()).done;){var r=e.value;Oe(this.ctx,this.xoptions,this.yoptions,this.margin(),r.floppercyc,r.flopperbyte,r.highlight?10:5),r.highlight&&t.push(r)}}catch(e){n.e(e)}finally{n.f()}for(var i=0,a=t;i<a.length;i++){var o=a[i];o.x=we(this.ctx,this.xoptions,this.margin(),o.flopperbyte),o.y=xe(this.ctx,this.yoptions,this.margin(),o.floppercyc),Ae(this.ctx,o.x,o.y,200,o.id)}}},{key:"drawComputeBounds",value:function(){var e,t=0,n=ve(Se);try{for(n.s();!(e=n.n()).done;){var r=e.value;_e(this.ctx,this.margin(),this.yoptions,r,0==t?"hard":"soft"),++t}}catch(e){n.e(e)}finally{n.f()}}},{key:"drawBandwidthBounds",value:function(){var e,t=ve(Me);try{for(t.s();!(e=t.n()).done;){var n=e.value;Ee(this.ctx,this.margin(),this.xoptions,this.yoptions,n)}}catch(e){t.e(e)}finally{t.f()}}},{key:"connectDots",value:function(){var e=void 0;this.ctx.beginPath();var t,n=ve(Ne);try{for(n.s();!(t=n.n()).done;){var r=t.value,i=r.x,a=r.y;void 0===e?this.ctx.moveTo(i,a):(this.ctx.lineTo(i,a),this.ctx.stroke()),e=i}}catch(e){n.e(e)}finally{n.f()}}}]),e}();var Ie=function(e){(0,l.Z)(o,e);var t,n,a=(t=o,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,f.Z)(t);if(n){var i=(0,f.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,c.Z)(this,e)});function o(e,t,n){var i;return(0,r.Z)(this,o),(i=a.call(this,e,t,n))._proc_func=null,i}return(0,i.Z)(o,[{key:"setupEvents",value:function(e){(0,A.Z)((0,f.Z)(o.prototype),"setupEvents",this).call(this,e),this.diode.goldenlayout.eventHub}},{key:"create",value:function(){var e=this,t=this.container.getElement()[0];t.style.width="100%",t.style.height="100%";var n=document.createElement("canvas");n.width=1920,n.height=1080;var r=function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0,t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:void 0;null==e&&(e=document.getElementById("myCanvas"));var n=e.getContext("2d"),r=function(){return{top:100,bottom:100,left:200,right:100}},i={steps:20,value_per_step:1,step_value_func:function(e){return Math.pow(2,-6+e)},inv_step_value_func:function(e){return 6+Math.log2(e)}},a={steps:15,value_per_step:1,step_value_func:function(e){return Math.pow(2,-8+e)},inv_step_value_func:function(e){return 8+Math.log2(e)}},o=new Te(n,r,i,a);e.addEventListener("mousemove",(function(t){var s,u=e.getBoundingClientRect(),l=(t.clientX-u.left)/(u.right-u.left)*e.width,c=(t.clientY-u.top)/(u.bottom-u.top)*e.height,f=function(e){return e*e},d=ve(Ne);try{for(d.s();!(s=d.n()).done;){var p=s.value;p.x=we(n,i,r(),p.flopperbyte),p.y=xe(n,a,r(),p.floppercyc),f(p.x-l)+f(p.y-c)<=f(15)?p.highlight=!0:p.highlight=!1}}catch(e){d.e(e)}finally{d.f()}ke(n,o)})),e.addEventListener("click",(function(t){var n,r=e.getBoundingClientRect(),i=(t.clientX-r.left)/(r.right-r.left)*e.width,a=(t.clientY-r.top)/(r.bottom-r.top)*e.height,o=function(e){return e*e},s=ve(Ne);try{for(s.s();!(n=s.n()).done;){var u=n.value;if(o(u.x-i)+o(u.y-a)<=o(15))return void ge.send(JSON.stringify({msg_type:"roofline",command:"select-program",programID:u.id}))}}catch(e){s.e(e)}finally{s.f()}})),_e(n,r(),a,8),Ee(n,r(),i,a,8),Se.push(64,8),Me.push(8),Ce(n,i,a,r(),1,1,1),Ce(n,i,a,r(),2,3,2),Ce(n,i,a,r(),4,6,3),Ce(n,i,a,r(),7,7,4),Ce(n,i,a,r(),8,8,5),ke(n,o);var s=function(e){if("roofline-data"==e.msg_type){Ne=[];var t,o=ve(e.data);try{for(o.s();!(t=o.n()).done;){var s=t.value,u=s.ProgramID,l=s.FLOP_C,c=(s.INPUT_B_C,s.PROC_B_C,l/s.MEM_B_C);Ce(n,i,a,r(),l,c,u)}}catch(e){o.e(e)}finally{o.f()}}},u=function(){(ge=new WebSocket("ws://localhost:8024/")).onopen=function(e){ge.send(JSON.stringify({msg_type:"roofline",command:"connected"}))},ge.onmessage=function(e){msg=JSON.parse(e.data),s(msg)},ge.onclose=function(e){console.log("ERROR: Connection closed!")},ge.onerror=function(e){console.log("ERROR: There was an error with the connection.")}};return null==t?u():t(s),function(){return ke(n,o)}}(n,(function(t){e._proc_func=t})),i=function(){console.log("Resizing"),n.width=parseInt(t.style.width)-20,n.height=parseInt(t.style.height)-20,r()};t.addEventListener("resize",i),window.ResizeObserver?new ResizeObserver(i).observe(t):console.warn("ResizeObserver not available"),t.appendChild(n),Be("/dace/api/v1.0/perfdata/roofline/",{client_id:this.diode.getClientID()},(function(t){4===t.readyState&&200===t.status&&e._proc_func(JSON.parse(t.response))}))}}]),o}(x);function De(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return Pe(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?Pe(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function Pe(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var je="//"+window.location.host;globalThis.base_url=je;var Re=globalThis.$;function Le(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:{readMode:"text",condition:function(e){return!0}},i=function(t){r.condition(e)&&(t.stopPropagation(),t.preventDefault())},a=function(t){r.condition(e)&&(t.stopPropagation(),t.preventDefault())},o=function(n){if(r.condition(e)){var i=Array.from(n.dataTransfer.files);if(1!==i.length)throw i.length>1?(n.stopPropagation(),n.preventDefault(),alert("Cannot handle more than 1 input file at this point"),"Previous alert caused here"):(alert("Can only drop files at this point - everything else is user-agent-specific!"),"Previous alert caused here");n.stopPropagation(),n.preventDefault();var a=i[0],o=a.type,s=new FileReader;if(s.onload=function(e){t(o,e.target.result)},"text"==r.readMode)s.readAsText(a);else{if("binary"!=r.readMode)throw"Unimplemented read mode "+r.readMode;s.readAsArrayBuffer(a)}}};e.addEventListener("dragenter",i,!1),e.addEventListener("dragover",a,!1),e.addEventListener("drop",o,!1)}function Be(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"POST",i=new XMLHttpRequest,a=je+e;if(i.open(r,a,!0),i.setRequestHeader("Content-Type","application/json"),i.onreadystatechange=function(){n(i)},i.onerror=function(e){console.warn("Connection error",e),alert("Connection error")},null!=t){var o=JSON.stringify(t);i.send(o)}else i.send()}!function(){var e=new a.C;window.diode=e,e.initEnums(),e.pubSSH(!0),Re("#toolbar").w2toolbar({name:"toolbar",items:[{type:"menu",id:"file-menu",caption:"File",icon:"material-icons-outlined gmat-folder",items:[{text:"Start",icon:"material-icons-outlined gmat-new_folder",id:"start"},{text:"Open",icon:"material-icons-outlined gmat-open",id:"open-file"},{text:"Save",icon:"material-icons-outlined gmat-save",id:"save"}]},{type:"break",id:"break0"},{type:"menu",id:"settings-menu",caption:"Settings",icon:"material-icons-outlined gmat-settings",items:[{text:"DACE settings",icon:"material-icons-outlined gmat-settings-cloud",id:"diode-settings"},{text:"DIODE settings",icon:"material-icons-outlined gmat-settings-application",id:"diode-settings"},{text:"Run Configurations",icon:"material-icons-outlined gmat-playlist_play",id:"runoptions"},{text:"Runqueue",icon:"material-icons-outlined gmat-view_list",id:"runqueue"},{text:"Perfdata",id:"perfdata"},{text:"Perftimes",id:"perftimes"}]},{type:"menu",icon:"material-icons-outlined gmat-build",id:"compile-menu",caption:"Compile",items:[{text:"Compile",id:"compile",icon:"material-icons-outlined gmat-gavel"},{text:"Run",id:"run",icon:"material-icons-outlined gmat-play"},{text:"Discard changes and compile source",id:"compile-clean",icon:"material-icons-outlined gmat-clear"}]},{type:"menu-radio",id:"runconfig",text:function(t){var n="string"==typeof t.selected?t.selected:t.selected(),r=this.get("runconfig:"+n);return"Config: "+(null==r?e.getCurrentRunConfigName():r.text)},selected:function(t){return e.getCurrentRunConfigName()},items:[{id:"default",text:"default"}]},{type:"menu",id:"transformation-menu",caption:"Transformations",items:[{text:"History",id:"history"},{text:"Available Transformations",id:"available"}]},{type:"menu",id:"group-menu",caption:"Group",icon:"material-icons-outlined gmat-apps",items:[{text:"Group default",id:"group-diode1"}]},{type:"menu",id:"closed-windows",caption:"Closed windows",icon:"material-icons-outlined gmat-reopen",items:[]}],onClick:function(t){if("file-menu:open-file"===t.target&&e.openUploader("code-python"),"file-menu:start"===t.target&&(e.closeAll(),e.addContentItem({type:"component",componentName:"StartPageComponent",componentState:{}})),"file-menu:save"===t.target&&e.project().save(),"settings-menu:diode-settings"==t.target&&e.open_diode_settings(),"settings-menu:runqueue"==t.target&&e.open_runqueue(),"settings-menu:perfdata"==t.target&&e.show_inst_options(),"settings-menu:perftimes"==t.target&&e.show_exec_times(),"group-menu:group-sdfgs"==t.target&&(e.groupOptGraph(),e.groupSDFGsAndCodeOutsTogether()),"group-menu:group-diode1"==t.target&&e.groupLikeDIODE1(),"runconfig"==t.target){var n=this.get(t.target),r=e.getRunConfigs();n.items=[];var i,a=De(r);try{for(a.s();!(i=a.n()).done;){var o=i.value["Configuration name"];n.items.push({id:o,text:o})}}catch(e){a.e(e)}finally{a.f()}}if(t.target.startsWith("runconfig:")){var s=t.target.substr("runconfig:".length);e.setCurrentRunConfig(s)}if("transformation-menu:history"==t.target&&e.addContentItem({type:"component",componentName:"TransformationHistoryComponent",title:"Transformation History",componentState:{}}),"transformation-menu:available"==t.target&&e.addContentItem({type:"component",componentName:"AvailableTransformationsComponent",componentState:{}}),"compile-menu:compile"==t.target&&e.gatherProjectElementsAndCompile(e,{},{sdfg_over_code:!0}),"compile-menu:compile-clean"==t.target&&(e.project().request(["clear-errors"],(function(){})),e.project().discardTransformationsAfter(0),e.project().request(["input_code"],(function(t){e.compile(e,t.input_code)}),{timeout:300,on_timeout:function(){return alert("No input code found, open a new file")}})),"settings-menu:runoptions"==t.target&&e.show_run_options(e),"compile-menu:run"==t.target&&e.ui_compile_and_run(e),"closed-windows"==t.target){var u=this.get(t.target);u.items=[],u.items.push({text:"Clear all",id:"clear-closed-windows",icon:"material-icons-outlined gmat-clear"});var l,c=De(e.project().getClosedWindowsList());try{for(c.s();!(l=c.n()).done;){var f=l.value,d=f[0];u.items.push({text:d,id:"open-closed-"+f[1].created})}}catch(e){c.e(e)}finally{c.f()}this.refresh()}if("closed-windows:clear-closed-windows"==t.target&&e.project().clearClosedWindowsList(),t.target.startsWith("closed-windows:open-closed-")){var p=t.target;p=p.substr("closed-windows:open-closed-".length),e.project().reopenClosedWindow(p)}}});var t=sessionStorage.getItem("savedState"),n=null;(n=null!==t?new GoldenLayout(JSON.parse(t),Re("#diode_gl_container")):new GoldenLayout({content:[{type:"row",content:[{type:"component",componentName:"StartPageComponent",componentState:{}}]}]},Re("#diode_gl_container"))).on("stateChanged",e.debounce("stateChanged",(function(){if(n.isInitialised&&n.openPopouts.every((function(e){return e.isInitialised}))&&!n.isSubWindow){var e=n.toConfig(),t=JSON.stringify(e);sessionStorage.setItem("savedState",t)}}),500)),n.isSubWindow||n.eventHub.on("create-window-in-main",(function(t){var n=JSON.parse(t);e.addContentItem(n)})),n.registerComponent("testComponent",(function(e,t){e.getElement().html("<h2>"+t.label+"</h2>")})),n.registerComponent("SettingsComponent",(function(t,n){var r=new k(e,t,n);Re(t.getElement()).load("settings_view.html",(function(){r.get_settings()}))})),n.registerComponent("PerfTimesComponent",(function(t,n){var r=new de(e,t,n);r.setupEvents(e.getCurrentProject()),r.create()})),n.registerComponent("InstControlComponent",(function(t,n){var r=new he(e,t,n);r.setupEvents(e.getCurrentProject()),r.create()})),n.registerComponent("RooflineComponent",(function(t,n){var r=new Ie(e,t,n);r.setupEvents(e.getCurrentProject()),r.create()})),n.registerComponent("SDFGComponent",(function(t,n){var r=new W(e,t,n);r.create_renderer_pane(n.sdfg_data),r.setupEvents(e.getCurrentProject())})),n.registerComponent("TransformationHistoryComponent",(function(t,n){var r=new ie(e,t,n);r.setupEvents(e.getCurrentProject());var i=r.project().getTransformationHistory();r.create(i)})),n.registerComponent("AvailableTransformationsComponent",(function(t,n){var r=new ue(e,t,n);r.setupEvents(e.getCurrentProject()),r.create()})),n.registerComponent("CodeInComponent",(function(t,n){var r=new D(e,t,n),i="code_in_"+r.created,o=Re(t.getElement()),s=Re("<div id='"+i+"' style='height: 100%; width: 100%; overflow-y:auto'></div>");o.append(s),o.hide().show(0),function(){var o=s;o.attr("id",i),o.text(n.code_content),o.hide().show(0);var u=ace.edit(s[0]);u.setTheme(a.C.themeString()),u.session.setMode("ace/mode/python"),u.getSession().on("change",(function(){t.extendState({code_content:u.getValue()})})),Le(s[0],(function(e,t){console.log("File dropped",e,t),u.setValue(t),u.clearSelection()})),u.resize(),u.commands.addCommand({name:"Compile",bindKey:{win:"Ctrl-P",mac:"Command-P"},exec:function(e){alert("Compile pressed"),r.compile(e.getValue())},readOnly:!0}),u.commands.addCommand({name:"Compile and Run",bindKey:{win:"Alt-R",mac:"Alt-R"},exec:function(e){alert("Compile & Run pressed"),r.compile_and_run(e.getValue())},readOnly:!0}),r.setEditorReference(u),r.setupEvents(e.getCurrentProject())}()})),n.registerComponent("CodeOutComponent",(function(t,n){var r=new L(e,t,n),i="code_out_"+r.created,o=Re(t.getElement()),s=Re("<div id='"+i+"' style='height: 100%; width: 100%; overflow:auto'></div>");o.append(s),o.hide().show(0),function(){var t=s;t.attr("id",i),t.hide().show(0);var n=ace.edit(s[0]);n.setTheme(a.C.themeString()),n.session.setMode("ace/mode/c_cpp"),n.setReadOnly(!0),r.setEditorReference(n),r.setupEvents(e.getCurrentProject());var o=r.getState().code;r.setCode(o),n.resize()}()})),n.registerComponent("ErrorComponent",(function(t,n){var r=new ce(e,t,n),i="error_"+r.created,o=Re(t.getElement()),s=Re("<div id='"+i+"' style='height: 100%; width: 100%; overflow:auto'></div>");o.append(s),o.hide().show(0),function(){var t=s;t.attr("id",i),t.hide().show(0);var n=ace.edit(s[0]);n.setTheme(a.C.themeString()),n.session.setMode("ace/mode/python"),r.setEditorReference(n),r.setupEvents(e.getCurrentProject());var o=r.getState().error;r.setError(o),n.resize()}()})),n.registerComponent("TerminalComponent",(function(t,r){var i=new j(e,t,r),o="terminal_"+i.created,s=Re(t.getElement()),u=Re("<div id='"+o+"' style='height: 100%; width: 100%; overflow:auto'></div>");s.append(u),s.hide().show(0),u.hide().show(0);var l=ace.edit(u[0]);l.setTheme(a.C.themeString()),l.session.setMode("ace/mode/sh"),l.setReadOnly(!0);var c=i.getState().current_value;void 0!==c&&l.setValue(c),l.clearSelection(),i.setEditorReference(l),console.log("Client listening to",o),n.eventHub.on(o,(function(e){i.append(e)})),i.setupEvents(e.getCurrentProject())})),n.registerComponent("DIODESettingsComponent",(function(t,n){var r=new C(e,t,n),i="diode_settings"+r.created,a=Re(t.getElement()),o=Re("<div id='"+i+"' style='height: 100%; width: 100%; overflow:auto'></div>");o.append("<h1>DIODE settings</h1>"),r.setContainer(o),a.append(o)})),n.registerComponent("RunConfigComponent",(function(t,n){var r=new fe(e,t,n);r.setupEvents(e.getCurrentProject()),r.create()})),n.registerComponent("PropWinComponent",(function(t,n){var r=new $(e,t,n),i=document.createElement("div");i.classList.add("sdfgpropdiv"),i.style="width: 100%; height: 100%",Re(t.getElement()).append(i),r.setupEvents(e.getCurrentProject()),r.createFromState()})),n.registerComponent("StartPageComponent",(function(t,n){var r=new ee(e,t,n);r.setupEvents(e.getCurrentProject()),r.create()})),n.registerComponent("RunqueueComponent",(function(t,n){var r=new Y(e,t,n);r.setupEvents(e.getCurrentProject()),r.create()})),n.on("itemDestroyed",(function(e){if(void 0!==e.config.componentState){var t=e.config.componentState.created;n.eventHub.emit("destroy-"+t),console.log("itemDestroyed",e)}})),e.setLayout(n),e.getProject(),n.init(),window.addEventListener("resize",(function(e){n.updateSize()})),document.body.addEventListener("keydown",(function(t){e.onKeyDown(t)})),document.body.addEventListener("keyup",(function(t){e.onKeyUp(t)})),e.addKeyShortcut("gg",(function(){e.groupOptGraph(),e.groupSDFGsAndCodeOutsTogether()})),e.addKeyShortcut("gd",(function(){e.groupLikeDIODE1()})),e.addKeyShortcut("0",(function(){e.open_diode_settings()})),e.addKeyShortcut("r",(function(){e.gatherProjectElementsAndCompile(e,{},{sdfg_over_code:!0})})),e.addKeyShortcut("s",(function(){e.project().save()}),!1,!0),e.setupEvents(),Le(Re("#diode_gl_container")[0].firstChild,(function(t,n){console.log("File dropped",t,n);var r={type:"component",componentName:"CodeInComponent",componentState:{code_content:n}};e.addContentItem(r)}),void 0,{readMode:"text",condition:function(e){return 0==e.childNodes.length}})}();var Ue=function(){function e(){(0,r.Z)(this,e)}return(0,i.Z)(e,null,[{key:"createContainer",value:function(e){var t=document.createElement("div");return t.id=e,t.classList="settings_key_value",Re(t)}},{key:"createHostInput",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:["localhost"],r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"localhost",i=document.createElement("input");i.type="list",i.id=e;var a=document.getElementById("hosttype-dlist");a||((a=document.createElement("datalist")).id="hosttype-dlist",document.body.appendChild(a)),Re(i).attr("list","hosttype-dlist"),a.innerHTML="";var o,s=De(n);try{for(s.s();!(o=s.n()).done;){var u=o.value;a.innerHTML+='<option value="'+u+'">'}}catch(e){s.e(e)}finally{s.f()}return i.value=r,i.onchange=function(){t(i)},Re(i)}},{key:"createComboboxInput",value:function(e,t,n,r){var i=document.createElement("div"),a=document.createElement("input");a.type="list",a.id=e,a.onfocus=function(){var e=a.value;a.onblur=function(){a.value=e},a.value=""};var o=document.createElement("datalist");o.id=e+"-dlist",i.appendChild(o),Re(a).attr("list",e+"-dlist"),o.innerHTML="";var s,u=De(n);try{for(u.s();!(s=u.n()).done;){var l=s.value;o.innerHTML+='<option value="'+l+'">'}}catch(e){u.e(e)}finally{u.f()}return a.value=r,a.onchange=function(){a.onblur=null,t(a)},i.appendChild(a),Re(i)}},{key:"createCodeReference",value:function(e,t,n){var r=document.createElement("span");if(r.id=e,r.addEventListener("click",(function(e){t(e)})),r.classList.add("code_ref"),null==n||null==n.filename)r.innerText="N/A",r.title="The DebugInfo for this element is not defined";else{var i=n.filename.split("/"),a=i[i.length-1];r.innerText=a+":"+n.start_line,r.title=n.filename}return Re(r)}},{key:"createLabel",value:function(e,t,n){var r=document.createElement("span");return r.id=e,r.innerHTML=t,r.title=n,r.classList="title",Re(r)}},{key:"createToggleSwitch",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]&&arguments[2],r=!1,i=document.createElement("input");if(i.onchange=function(){t(i)},i.type="checkbox",i.id=e,i.checked=n,!r){var a=document.createElement("label");return a.classList="switch",Re(a).append(i),Re(a).append(Re('<span class="slider round"></span>')),Re(a)}return Re(i)}},{key:"createTextInput",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"",r=document.createElement("input");return r.onchange=function(){t(r)},r.type="text",r.id=e,r.value=n,Re(r)}},{key:"createLongTextInput",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"",r=document.createElement("textarea");return r.onchange=function(){t(r.innerHTML)},r.id=e,r.innerHTML=n,Re(r)}},{key:"createSelectInput",value:function(e,t,n){var r,i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"",a=document.createElement("select"),o=De(n);try{for(o.s();!(r=o.n()).done;){var s=r.value,u=document.createElement("option");u.innerText=s,a.append(u)}}catch(e){o.e(e)}finally{o.f()}return a.oninput=function(){t(a)},a.id=e,a.value=i,Re(a)}},{key:"createIntInput",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0,r=document.createElement("input");return r.oninput=function(){t(r)},r.type="number",r.step=1,r.id=e,r.value=n,Re(r)}},{key:"createFloatInput",value:function(e,t){var n=document.createElement("input");return n.oninput=function(){t(n)},n.type="number",n.id=e,Re(n)}},{key:"createButton",value:function(e,t,n){var r=document.createElement("button");return r.onclick=function(){t(r)},r.innerHTML=n,Re(r)}}]),e}()},3216:(e,t,n)=>{"use strict";n.d(t,{F:()=>a});var r=n(6610),i=n(5991),a=function(){function e(t,n){(0,r.Z)(this,e),this.overlay_manager=t,this.symbol_resolver=this.overlay_manager.symbol_resolver,this.renderer=n,this.vscode="undefined"!=typeof vscode&&vscode,this.badness_scale_center=5}return(0,i.Z)(e,[{key:"draw",value:function(){}},{key:"on_mouse_event",value:function(e,t,n,r,i,a){return!1}},{key:"refresh",value:function(){}}]),e}()},4707:(e,t,n)=>{"use strict";n.d(t,{n:()=>f});var r=n(6610),i=n(5991),a=n(379),o=n(6070),s=n(7608),u=n(5994),l=n(3216),c=n(1538);var f=function(e){(0,a.Z)(f,e);var t,n,l=(t=f,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,s.Z)(t);if(n){var i=(0,s.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,o.Z)(this,e)});function f(e,t){var n;return(0,r.Z)(this,f),(n=l.call(this,e,t)).refresh(),n}return(0,i.Z)(f,[{key:"clear_cached_volume_values",value:function(){this.renderer.for_all_elements(0,0,0,0,(function(e,t,n,r){n.data&&void 0!==n.data.volume&&(n.data.volume=void 0)}))}},{key:"calculate_volume_edge",value:function(e,t,n){var r=void 0;e.data&&e.data.attributes&&void 0!==(r=e.data.attributes.volume)&&(r=(r=r.replace(/\*\*/g,"^")).replace(/ceiling/g,"ceil"));var i=void 0;return void 0!==r&&(i=this.symbol_resolver.parse_symbol_expression(r,t)),e.data.volume=i,void 0!==i&&i>0&&n.push(i),i}},{key:"calculate_volume_graph",value:function(e,t,n){var r=this;e.nodes().forEach((function(i){var a=e.node(i).data.graph;a&&(a.edges().forEach((function(e){var i=a.edge(e);i instanceof Edge&&r.calculate_volume_edge(i,t,n)})),a.nodes().forEach((function(e){var i=a.node(e);if(i instanceof u.gE){var o={},s=i.data.node.attributes.symbol_mapping;Object.keys(s).forEach((function(e){o[e]=r.symbol_resolver.parse_symbol_expression(s[e],t)})),Object.keys(t).forEach((function(e){e in o||(o[e]=t[e])})),r.calculate_volume_graph(i.data.graph,o,n)}})))}))}},{key:"recalculate_volume_values",value:function(e){this.badness_scale_center=5;var t=[0];switch(this.calculate_volume_graph(e,this.symbol_resolver.symbol_value_map,t),this.overlay_manager.badness_scale_method){case"mean":this.badness_scale_center=(0,c.J69)(t);break;case"median":default:this.badness_scale_center=(0,c.C2o)(t)}}},{key:"refresh",value:function(){this.clear_cached_volume_values(),this.recalculate_volume_values(this.renderer.graph),this.renderer.draw_async()}},{key:"shade_edge",value:function(e,t){var n=e.data.volume;if(void 0!==n){if(n<=0)return;var r=1/(2*this.badness_scale_center)*n;r<0&&(r=0),r>1&&(r=1);var i=(0,u.jD)(r);e.shade(this.renderer,t,i)}}},{key:"recursively_shade_sdfg",value:function(e,t,n,r){var i=this;e.nodes().forEach((function(a){var o=e.node(a);if((!t.lod||!(n>=STATE_LOD||o.width/n<STATE_LOD))&&(!t.lod||o.intersect(r.x,r.y,r.w,r.h))){var s=o.data.graph;s&&!o.data.state.attributes.is_collapsed&&(s.nodes().forEach((function(e){var a=s.node(e);t.lod&&!a.intersect(r.x,r.y,r.w,r.h)||a.data.node.attributes.is_collapsed||t.lod&&n>=NODE_LOD||a instanceof u.gE&&i.recursively_shade_sdfg(a.data.graph,t,n,r)})),s.edges().forEach((function(e){var n=s.edge(e);t.lod&&!n.intersect(r.x,r.y,r.w,r.h)||i.shade_edge(n,t)})))}}))}},{key:"draw",value:function(){this.recursively_shade_sdfg(this.renderer.graph,this.renderer.ctx,this.renderer.canvas_manager.points_per_pixel(),this.renderer.visible_rect)}},{key:"on_mouse_event",value:function(e,t,n,r,i,a){if("click"===e&&!a&&void 0!==i&&i instanceof Edge&&void 0===i.data.volume&&i.data.attributes.volume){var o=this;this.symbol_resolver.parse_symbol_expression(i.data.attributes.volume,o.symbol_resolver.symbol_value_map,!0,(function(){o.clear_cached_volume_values(),o.recalculate_volume_values(o.renderer.graph)}))}return!1}}]),f}(l.F)},8934:(e,t,n)=>{"use strict";n.d(t,{P:()=>f});var r=n(6610),i=n(5991),a=n(379),o=n(6070),s=n(7608),u=n(5994),l=n(3216),c=n(1538);var f=function(e){(0,a.Z)(f,e);var t,n,l=(t=f,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,s.Z)(t);if(n){var i=(0,s.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,o.Z)(this,e)});function f(e,t){var n;return(0,r.Z)(this,f),(n=l.call(this,e,t)).criterium="mean",n.runtime_map={},n.badness_scale_center=0,n}return(0,i.Z)(f,[{key:"get_element_uuid",value:function(e){return e instanceof u.ZM?e.sdfg.sdfg_list_id+"/"+e.id+"/-1/"+-1:e instanceof u.gE?e.data.node.attributes.sdfg.sdfg_list_id+"/-1/-1/"+-1:e instanceof u.u7?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.data.node.scope_entry+"/"+-1:e instanceof u.zO?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.id+"/"+-1:"-1/-1/-1/-1"}},{key:"refresh",value:function(){this.badness_scale_center=5;for(var e=[0],t=0,n=Object.keys(this.runtime_map);t<n.length;t++){var r=n[t];"0/-1/-1/-1"!==r&&e.push(this.runtime_map[r][this.criterium])}switch(this.overlay_manager.badness_scale_method){case"mean":this.badness_scale_center=(0,c.J69)(e);break;case"median":default:this.badness_scale_center=(0,c.C2o)(e)}this.renderer.draw_async()}},{key:"pretty_print_micros",value:function(e){var t="µs",n=e;if(e>1e3){t="ms";var r=e/1e3;n=r,r>1e3&&(t="s",n=r/1e3)}return(n=Math.round(100*(n+Number.EPSILON))/100).toString()+" "+t}},{key:"shade_node",value:function(e,t){var n=this,r=this.runtime_map[this.get_element_uuid(e)];if(void 0!==r){this.renderer.mousepos&&e.intersect(this.renderer.mousepos.x,this.renderer.mousepos.y)&&(r.min===r.max?this.renderer.tooltip=function(){n.renderer.tooltip_container.innerText=n.pretty_print_micros(r.min)}:this.renderer.tooltip=function(){n.renderer.tooltip_container.innerText="Min: "+n.pretty_print_micros(r.min)+"\nMax: "+n.pretty_print_micros(r.max)+"\nMean: "+n.pretty_print_micros(r.mean)+"\nMedian: "+n.pretty_print_micros(r.med)+"\nCount: "+r.count});var i=r[this.criterium],a=1/(2*this.badness_scale_center)*i;a<0&&(a=0),a>1&&(a=1);var o=(0,u.jD)(a);e.shade(this.renderer,t,o)}}},{key:"recursively_shade_sdfg",value:function(e,t,n,r){var i=this;e.nodes().forEach((function(a){var o=e.node(a);if(!t.lod||o.intersect(r.x,r.y,r.w,r.h))if(t.lod&&(n>=STATE_LOD||o.width/n<=STATE_LOD)||o.data.state.attributes.is_collapsed)i.shade_node(o,t);else{var s=o.data.graph;s&&s.nodes().forEach((function(e){var a=s.node(e);t.lod&&!a.intersect(r.x,r.y,r.w,r.h)||(a.data.node.attributes.is_collapsed||t.lod&&n>=NODE_LOD?i.shade_node(a,t):a instanceof u.gE?i.recursively_shade_sdfg(a.data.graph,t,n,r):i.shade_node(a,t))}))}}))}},{key:"draw",value:function(){this.recursively_shade_sdfg(this.renderer.graph,this.renderer.ctx,this.renderer.canvas_manager.points_per_pixel(),this.renderer.visible_rect)}}]),f}(l.F)},1699:(e,t,n)=>{"use strict";n.d(t,{C:()=>f});var r=n(6610),i=n(5991),a=n(379),o=n(6070),s=n(7608),u=n(5994),l=n(3216),c=n(1538);var f=function(e){(0,a.Z)(f,e);var t,n,l=(t=f,n=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,r=(0,s.Z)(t);if(n){var i=(0,s.Z)(this).constructor;e=Reflect.construct(r,arguments,i)}else e=r.apply(this,arguments);return(0,o.Z)(this,e)});function f(e,t){var n;return(0,r.Z)(this,f),(n=l.call(this,e,t)).flops_map={},n.vscode&&vscode.postMessage({type:"dace.get_flops"}),n}return(0,i.Z)(f,[{key:"get_element_uuid",value:function(e){return e instanceof u.ZM?e.sdfg.sdfg_list_id+"/"+e.id+"/-1/"+-1:e instanceof u.gE?e.data.node.attributes.sdfg.sdfg_list_id+"/-1/-1/"+-1:e instanceof u.u7?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.data.node.scope_entry+"/"+-1:e instanceof u.zO?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.id+"/"+-1:"-1/-1/-1/-1"}},{key:"clear_cached_flops_values",value:function(){this.renderer.for_all_elements(0,0,0,0,(function(e,t,n,r){n.data&&(void 0!==n.data.flops&&(n.data.flops=void 0),void 0!==n.data.flops_string&&(n.data.flops_string=void 0))}))}},{key:"calculate_flops_node",value:function(e,t,n){var r=this.flops_map[this.get_element_uuid(e)],i=void 0;return void 0!==r&&(i=this.symbol_resolver.parse_symbol_expression(r,t)),e.data.flops_string=r,e.data.flops=i,void 0!==i&&i>0&&n.push(i),i}},{key:"calculate_flops_graph",value:function(e,t,n){var r=this;e.nodes().forEach((function(i){var a=e.node(i);r.calculate_flops_node(a,t,n);var o=a.data.graph;o&&o.nodes().forEach((function(e){var i=o.node(e);if(i instanceof u.gE){var a={},s=i.data.node.attributes.symbol_mapping;Object.keys(s).forEach((function(e){a[e]=r.symbol_resolver.parse_symbol_expression(s[e],t)})),Object.keys(t).forEach((function(e){e in a||(a[e]=t[e])})),r.calculate_flops_node(i,a,n),r.calculate_flops_graph(i.data.graph,a,n)}else r.calculate_flops_node(i,t,n)}))}))}},{key:"recalculate_flops_values",value:function(e){this.badness_scale_center=5;var t=[0];switch(this.calculate_flops_graph(e,this.symbol_resolver.symbol_value_map,t),this.overlay_manager.badness_scale_method){case"mean":this.badness_scale_center=(0,c.J69)(t);break;case"median":default:this.badness_scale_center=(0,c.C2o)(t)}}},{key:"update_flops_map",value:function(e){this.flops_map=e,this.refresh()}},{key:"refresh",value:function(){this.clear_cached_flops_values(),this.recalculate_flops_values(this.renderer.graph),this.renderer.draw_async()}},{key:"shade_node",value:function(e,t){var n=this,r=e.data.flops,i=e.data.flops_string;if(void 0!==i&&this.renderer.mousepos&&e.intersect(this.renderer.mousepos.x,this.renderer.mousepos.y)&&(isNaN(i)&&void 0!==r?this.renderer.tooltip=function(){n.renderer.tooltip_container.innerText="FLOPS: "+i+" ("+r+")"}:this.renderer.tooltip=function(){n.renderer.tooltip_container.innerText="FLOPS: "+i}),void 0===r)return void 0!==i?void e.shade(this.renderer,t,"gray"):void 0;if(!(r<=0)){var a=1/(2*this.badness_scale_center)*r;a<0&&(a=0),a>1&&(a=1);var o=(0,u.jD)(a);e.shade(this.renderer,t,o)}}},{key:"recursively_shade_sdfg",value:function(e,t,n,r){var i=this;e.nodes().forEach((function(a){var o=e.node(a);if(!t.lod||o.intersect(r.x,r.y,r.w,r.h))if(t.lod&&(n>=STATE_LOD||o.width/n<=STATE_LOD)||o.data.state.attributes.is_collapsed)i.shade_node(o,t);else{var s=o.data.graph;s&&s.nodes().forEach((function(e){var a=s.node(e);t.lod&&!a.intersect(r.x,r.y,r.w,r.h)||(a.data.node.attributes.is_collapsed||t.lod&&n>=NODE_LOD?i.shade_node(a,t):a instanceof u.gE?i.recursively_shade_sdfg(a.data.graph,t,n,r):i.shade_node(a,t))}))}}))}},{key:"draw",value:function(){this.recursively_shade_sdfg(this.renderer.graph,this.renderer.ctx,this.renderer.canvas_manager.points_per_pixel(),this.renderer.visible_rect)}},{key:"on_mouse_event",value:function(e,t,n,r,i,a){if(!("click"!==e||a||null==i||i instanceof Edge||void 0!==i.data.flops)){var o=this.flops_map[this.get_element_uuid(i)];if(o){var s=this;this.symbol_resolver.parse_symbol_expression(o,s.symbol_resolver.symbol_value_map,!0,(function(){s.clear_cached_flops_values(),s.recalculate_flops_values(s.renderer.graph)}))}}return!1}}]),f}(l.F)},8560:(e,t,n)=>{"use strict";n.d(t,{U:()=>D});var r=n(6610),i=n(5991),a=n(681),o=n.n(a),s=n(1138),u=n(6310),l=n(5096),c=n(4194),f=n(3371),d=n(5994);function p(e){var t={width:0,height:0};return e.nodes().forEach((function(n){var r=e.node(n).x+e.node(n).width/2,i=e.node(n).y+e.node(n).height/2;r>t.width&&(t.width=r),i>t.height&&(t.height=i)})),t}function h(e){var t={x1:null,y1:null,x2:null,y2:null};return e.forEach((function(e){var n=e.topleft();(null===t.x1||n.x<t.x1)&&(t.x1=n.x),(null===t.y1||n.y<t.y1)&&(t.y1=n.y);var r=e.x+e.width/2,i=e.y+e.height/2;(null===t.x2||r>t.x2)&&(t.x2=r),(null===t.y2||i>t.y2)&&(t.y2=i)})),{x:t.x1,y:t.y1,width:t.x2-t.x1,height:t.y2-t.y1}}function m(e){var t={};return t.x1=e.points[0].x,t.y1=e.points[0].y,t.x2=e.points[0].x,t.y2=e.points[0].y,e.points.forEach((function(e){t.x1=e.x<t.x1?e.x:t.x1,t.y1=e.y<t.y1?e.y:t.y1,t.x2=e.x>t.x2?e.x:t.x2,t.y2=e.y>t.y2?e.y:t.y2})),(t={x:t.x1,y:t.y1,width:t.x2-t.x1,height:t.y2-t.y1}).width<=5&&(t.width=10,t.x-=5),t.height<=5&&(t.height=10,t.y-=5),t}function v(e){var t=m(e);e.x=t.x+t.width/2,e.y=t.y+t.height/2,e.width=t.width,e.height=t.height}function y(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var g,_=0,b=function(){function e(t,n,i){(0,r.Z)(this,e),this.ctx=t,this.ctx.lod=!0,this.canvas=i,this.anim_id=null,this.prev_time=null,this.drawables=[],this.renderer=n,this.indices=[],this.animation_start=null,this.animation_end=null,this.animation_target=null,this.animation=null,this.request_scale=!1,this.scalef=1,this._destroying=!1,this.scale_origin={x:0,y:0},this.contention=0,this._svg=document.createElementNS("http://www.w3.org/2000/svg","svg"),this.user_transform=this._svg.createSVGMatrix(),this.addCtxTransformTracking()}return(0,i.Z)(e,[{key:"stopAnimation",value:function(){this.animation_start=null,this.animation_end=null,this.animation=null,this.animation_target=null}},{key:"alreadyAnimatingTo",value:function(e){if(this.animation_target){var t=!0;return t&=this.animation_target.a==e.a,t&=this.animation_target.b==e.b,t&=this.animation_target.c==e.c,t&=this.animation_target.d==e.d,(t&=this.animation_target.e==e.e)&this.animation_target.f==e.f}return!1}},{key:"animateTo",value:function(e){if(this.alreadyAnimatingTo(e))return this.stopAnimation(),void(this.user_transform=e);this.stopAnimation(),this.animation=function(e,t){function n(e){var t=[Math.sqrt(e.a*e.a+e.b*e.b),Math.sqrt(e.c*e.c+e.d*e.d)];e.a*e.d-e.b*e.c<0&&(e.a<e.d?t[0]=-t[0]:t[1]=-t[1]);var n=e.a/(t[0]||1),r=e.b/(t[0]||1),i=e.c/(t[1]||1),a=e.d/(t[1]||1),o=n*n-r*i,s=n*r-r*a,u=n*i-r*n,l=n*a-r*r,c=180*Math.atan2(e.b,e.a)/Math.PI;return{translate:[e.e,e.f],scale:t,skew11:o,skew12:s,skew21:u,skew22:l,angle:c}}var r=n(e),i=n(t);return function(e){return t=function(e,t,n){function r(e,t){return(t-e)*n+e}var i=e.angle||360,a=t.angle||360,o=e.scale;return(e.scale[0]<0&&t.scale[1]<0||e.scale[1]<0&&t.scale[0]<0)&&(o=[-o[0],-o[1]],i+=i<0?180:-180),Math.abs(i-a)>180&&(i>a?i-=360:a-=360),{translate:[r(e.translate[0],t.translate[0]),r(e.translate[1],t.translate[1])],scale:[r(o[0],t.scale[0]),r(o[1],t.scale[1])],skew11:r(e.skew11,t.skew11),skew12:r(e.skew12,t.skew12),skew21:r(e.skew21,t.skew21),skew22:r(e.skew22,t.skew22),angle:r(i,a)}}(r,i,e),(n=document.createElementNS("http://www.w3.org/2000/svg","svg").createSVGMatrix()).a=t.skew11,n.b=t.skew12,n.c=t.skew21,n.d=t.skew22,n.e=t.translate[0]*t.skew11+t.translate[1]*t.skew21,n.f=t.translate[0]*t.skew12+t.translate[1]*t.skew22,n.rotate(0,0,t.angle*Math.PI/180).scale(t.scale[0],t.scale[1]);var t,n}}(this.user_transform,e),this.animation_target=e}},{key:"svgPoint",value:function(e,t){var n=this._svg.createSVGPoint();return n.x=e,n.y=t,n}},{key:"applyUserTransform",value:function(){var e=this.user_transform;this.ctx.setTransform(e.a,e.b,e.c,e.d,e.e,e.f)}},{key:"translation",get:function(){return{x:this.user_transform.e,y:this.user_transform.f}}},{key:"addCtxTransformTracking",value:function(){var e=this,t=document.createElementNS("http://www.w3.org/2000/svg","svg");this.ctx._custom_transform_matrix=t.createSVGMatrix();var n=function(){console.assert(!isNaN(e.ctx._custom_transform_matrix.f))},r=this.ctx,i=r.scale;r.scale=function(e,t){return r._custom_transform_matrix=r._custom_transform_matrix.scaleNonUniform(e,t),n(),i.call(r,e,t)};var a=r.translate;r.translate=function(e,t){return r._custom_transform_matrix=r._custom_transform_matrix.translate(e,t),n(),a.call(r,e,t)};var o=r.rotate;r.rotate=function(e){return r._custom_transform_matrix=r._custom_transform_matrix.rotate(180*e/Math.PI),n(),o.call(r,e)};var s=r.scale;r.transform=function(e,i,a,o,u,l){var c=t.createSVGMatrix();return c.a=e,c.b=i,c.c=a,c.d=o,c.e=u,c.f=l,r._custom_transform_matrix=r._custom_transform_matrix.multiply(c),n(),s.call(r,e,i,a,o,u,l)};var u=r.setTransform;r.setTransform=function(e,t,i,a,o,s){return r._custom_transform_matrix.a=e,r._custom_transform_matrix.b=t,r._custom_transform_matrix.c=i,r._custom_transform_matrix.d=a,r._custom_transform_matrix.e=o,r._custom_transform_matrix.f=s,n(),u.call(r,e,t,i,a,o,s)},r.custom_inverseTransformMultiply=function(e,i){var a=t.createSVGPoint();return a.x=e,a.y=i,n(),a.matrixTransform(r._custom_transform_matrix.inverse())}}},{key:"destroy",value:function(){this._destroying=!0,this.clearDrawables()}},{key:"addDrawable",value:function(t){this.drawables.push(t),this.indices.push({c:e.counter(),d:t})}},{key:"removeDrawable",value:function(e){this.drawables=this.drawables.filter((function(t){return t!=e}))}},{key:"clearDrawables",value:function(){var e,t=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return y(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?y(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(this.drawables);try{for(t.s();!(e=t.n()).done;)e.value.destroy()}catch(e){t.e(e)}finally{t.f()}this.drawables=[],this.indices=[]}},{key:"isBlank",value:function(){var e=this.canvas.getContext("2d"),t=e.getImageData(0,0,1,1).data;return 0==t[0]&&0==t[1]&&0==t[2]&&255==t[3]&&!new Uint32Array(e.getImageData(0,0,this.canvas.width,this.canvas.height).data.buffer).some((function(e){return 4278190080!==e}))}},{key:"scale",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0,n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0;if(this.stopAnimation(),!(this.request_scale||this.contention>0)){this.contention++,this.request_scale=!0,this.isBlank()&&(this.renderer.bgcolor="black",this.renderer.zoom_to_view(null,!1),e=.01),this.scale_origin.x=t,this.scale_origin.y=n;var r=e,i=this.svgPoint(this.scale_origin.x,this.scale_origin.y).matrixTransform(this.user_transform.inverse());this.user_transform=this.user_transform.translate(i.x,i.y),this.user_transform=this.user_transform.scale(r,r,1,0,0,0),this.scalef*=r,this.user_transform=this.user_transform.translate(-i.x,-i.y),this.contention--}}},{key:"set_view",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],n=this.canvas.width,r=this.canvas.height;if(0!=n&&0!=r){var i=1,a=0,o=0;e.width>e.height?(i=n/e.width,a=-e.x,o=-e.y-e.height/2+r/i/2,e.height*i>r&&(i=r/e.height,a=-e.x-e.width/2+n/i/2,o=-e.y)):(i=r/e.height,a=-e.x-e.width/2+n/i/2,o=-e.y,e.width*i>n&&(i=n/e.width,a=-e.x,o=-e.y-e.height/2+r/i/2));var s=this._svg.createSVGMatrix().scale(i,i,1,0,0,0).translate(a,o);t&&null!==this.prev_time?this.animateTo(s):(this.stopAnimation(),this.user_transform=s),this.scale_origin={x:0,y:0},this.scalef=1}}},{key:"translate",value:function(e,t){this.stopAnimation(),this.user_transform=this.user_transform.translate(e/this.user_transform.a,t/this.user_transform.d)}},{key:"translate_element",value:function(e,t,n,r,i,a,o){var l=!(arguments.length>7&&void 0!==arguments[7])||arguments[7],c=arguments.length>8&&void 0!==arguments[8]&&arguments[8],f=arguments.length>9&&void 0!==arguments[9]?arguments[9]:void 0;this.stopAnimation();var p=[],h=[],m=i[e.sdfg.sdfg_list_id],y=null;r===m||!e.data.state&&"InterstateEdge"!=e.data.type?null!==e.parent_id&&m&&(y=m.node(e.parent_id)).data.state&&(m=y.data.graph):y=a[e.sdfg.sdfg_list_id],!m||e instanceof d.kS||(m.outEdges(e.id).forEach((function(e){p.push(m.edge(e))})),m.inEdges(e.id).forEach((function(e){h.push(m.edge(e))})));var g=n.x-t.x,_=n.y-t.y,b=-1;if(e instanceof d.kS)if(c)b=-2;else if(f&&f.length>0)b=-3;else if(o)if(void 0===o.edge_point){var x=null;e.points.forEach((function(t,n){if(0!=n&&n!=e.points.length-1){var r=t.x-o.cx,i=t.y-o.cy,a=r*r+i*i;(null===x||a<x)&&(x=a,b=n)}})),o.edge_point=b}else b=o.edge_point;if(y){var w=y.x-y.width/2,E=w+y.width,N=y.y-y.height/2,S=N+y.height,M=e.height/2,k=e.width/2;e instanceof d.kS&&(M=k=0);var O=w+k,C=N+M,A=E-k,T=S-M;if(e instanceof d.kS){if(b>0){var I=e.points[b].x+g,D=e.points[b].y+_;I<=O||n.x<=w?g=O-e.points[b].x:(I>=A||n.x>=E)&&(g=A-e.points[b].x),D<=C||n.y<=N?_=C-e.points[b].y:(D>=T||n.y>=S)&&(_=T-e.points[b].y)}}else{var P=e.x+g,j=e.y+_;P<=O||n.x<=w?g=O-e.x:(P>=A||n.x>=E)&&(g=A-e.x),j<=C||n.y<=N?_=C-e.y:(j>=T||n.y>=S)&&(_=T-e.y)}}if(e instanceof d.kS){var R;if(l&&((R=(0,u.Wp)(e))||(R=(0,u._T)(e))),b>0){if(e.points[b].x+=g,e.points[b].y+=_,v(e),l){if(!R.points){R.points=Array(e.points.length);for(var L=0;L<e.points.length;L++)R.points[L]={dx:0,dy:0}}R.points[b].dx+=g,R.points[b].dy+=_}}else if(-2==b){for(var B=1;B<e.points.length-1;B++)e.points[B].x+=g,e.points[B].y+=_;if(l)for(var U=1;U<e.points.length-1;U++)R.points[U].dx+=g,R.points[U].dy+=_}else if(-3==b)for(var q=1;q<e.points.length-1;q++)e.points[q].x+=f[q].dx,e.points[q].y+=f[q].dy}else{if(H(e),l){var z=(0,u.Wp)(e);z||(z=(0,u._T)(e)),z.dx+=g,z.dy+=_,e instanceof EntryNode&&e.data.node.attributes.is_collapsed&&(z.scope_dx||(z.scope_dx=0,z.scope_dy=0),z.scope_dx+=g,z.scope_dy+=_)}if(e.data.state&&!e.data.state.attributes.is_collapsed){var F=e.data.graph;F.nodes().forEach((function(e){H(F.node(e))})),F.edges().forEach((function(e){var t=F.edge(e);t.x+=g,t.y+=_,t.points.forEach((function(e){e.x+=g,e.y+=_})),v(t)}))}p.forEach((function(t){var n=t.points.length-1,r=!1;if(null!==t.src_connector)for(var i=0;i<e.out_connectors.length;i++)if(e.out_connectors[i].data.name===t.src_connector){t.points[0]=(0,s.intersectRect)(e.out_connectors[i],t.points[1]),r=!0;break}if(r||(t.points[0].x+=g,t.points[0].y+=_),null!==t.dst_connector){var a,o,u,l=null===(a=y)||void 0===a||null===(o=a.data)||void 0===o||null===(u=o.state)||void 0===u?void 0:u.edges[t.id],c=m.node(null==l?void 0:l.dst);if(c)for(var f=0;f<c.in_connectors.length;f++)if(c.in_connectors[f].data.name===t.dst_connector){t.points[n]=(0,s.intersectRect)(c.in_connectors[f],t.points[n-1]);break}}v(t)})),h.forEach((function(t){var n=t.points.length-1,r=!1;if(null!==t.dst_connector)for(var i=0;i<e.in_connectors.length;i++)if(e.in_connectors[i].data.name===t.dst_connector){t.points[n]=(0,s.intersectRect)(e.in_connectors[i],t.points[n-1]),r=!0;break}if(r||(t.points[n].x+=g,t.points[n].y+=_),null!==t.src_connector){var a,o,u,l=null===(a=y)||void 0===a||null===(o=a.data)||void 0===o||null===(u=o.state)||void 0===u?void 0:u.edges[t.id],c=m.node(null==l?void 0:l.src);if(c)for(var f=0;f<c.out_connectors.length;f++)if(c.out_connectors[f].data.name===t.src_connector){t.points[0]=(0,s.intersectRect)(c.out_connectors[f],t.points[1]);break}}v(t)}))}function H(e){e.x+=g,e.y+=_,e.data.node&&"NestedSDFG"===e.data.node.type&&Z(e.data.graph),e.in_connectors&&e.in_connectors.forEach((function(e){e.x+=g,e.y+=_})),e.out_connectors&&e.out_connectors.forEach((function(e){e.x+=g,e.y+=_}))}function Z(e){e.nodes().forEach((function(t){var n=e.node(t);n.x+=g,n.y+=_;var r=n.data.graph;r&&(r.nodes().forEach((function(e){H(r.node(e))})),r.edges().forEach((function(e){var t=r.edge(e);t.x+=g,t.y+=_,t.points.forEach((function(e){e.x+=g,e.y+=_})),v(t)})))})),e.edges().forEach((function(t){var n=e.edge(t);n.x+=g,n.y+=_,n.points.forEach((function(e){e.x+=g,e.y+=_})),v(n)}))}}},{key:"mapPixelToCoordsX",value:function(e){return this.svgPoint(e,0).matrixTransform(this.user_transform.inverse()).x}},{key:"mapPixelToCoordsY",value:function(e){return this.svgPoint(0,e).matrixTransform(this.user_transform.inverse()).y}},{key:"noJitter",value:function(e){return e=parseFloat(e.toFixed(3)),Math.round(100*e)/100}},{key:"points_per_pixel",value:function(){var e=this.mapPixelToCoordsX(0);return(this.mapPixelToCoordsX(this.canvas.width)-e)/this.canvas.width}},{key:"animation_step",value:function(e){if(null!==this.animation){if(null===this.animation_start&&(this.animation_start=e,this.animation_end=e+1e3),e>=this.animation_end)return this.user_transform=this.animation(1),void this.stopAnimation();var t,n=this.animation_start,r=this.animation_end;this.user_transform=this.animation((t=(e-n)/(r-n),1-Math.pow(1-t,3)))}}},{key:"draw_now",value:function(e){if(!this._destroying){var t=e-this.prev_time;if(this.prev_time||(t=null),this.prev_time=e,!(this.contention>0)){this.contention+=1;var n=this.ctx;n.save(),n.setTransform(1,0,0,1,0,0),n.clearRect(0,0,n.canvas.width,n.canvas.height),n.fillStyle=this.renderer.bgcolor,n.fillRect(0,0,n.canvas.width,n.canvas.height),n.restore(),this.animation_step(e),this.applyUserTransform(),this.request_scale&&(this.request_scale=1!==this.contention),this.renderer.draw(t),this.contention-=1,null!==this.animation_end&&e<this.animation_end&&this.draw_async()}}}},{key:"draw_async",value:function(){var e=this;this.anim_id=window.requestAnimationFrame((function(t){return e.draw_now(t)}))}}],[{key:"counter",value:function(){return _++}}]),e}(),x=n(2465),w=n(8934),E=n(1699),N=n(4707),S=n(400),M=n(1762),k=function(){function e(t){var n=this;(0,r.Z)(this,e),this.renderer=t,this.sdfg=this.renderer.sdfg,this.vscode="undefined"!=typeof vscode&&vscode,this.symbol_value_map={},Object.keys(this.sdfg.attributes.symbols).forEach((function(e){void 0!==n.sdfg.attributes.constants_prop&&Object.keys(n.sdfg.attributes.constants_prop).includes(e)&&"Scalar"===n.sdfg.attributes.constants_prop[e][0].type?n.symbol_value_map[e]=n.sdfg.attributes.constants_prop[e][1]:n.symbol_value_map[e]=void 0})),this.symbols_to_define=[],this.init_overlay_popup_dialogue()}return(0,i.Z)(e,[{key:"symbol_value_changed",value:function(e,t){e in this.symbol_value_map&&(this.symbol_value_map[e]=t)}},{key:"parse_symbol_expression",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]&&arguments[2],r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,i=void 0;try{var a=(0,S.Qc)(e);if(n)this.recursive_find_undefined_symbol(a,t),this.prompt_define_symbol(t,r);else try{var o=a.evaluate(t);i=void 0!==o&&!isNaN(o)&&Number.isInteger(+o)?+o:void 0}catch(e){i=void 0}return i}catch(e){console.error(e)}finally{return i}}},{key:"prompt_define_symbol",value:function(e){var t=this,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:void 0;if(this.symbols_to_define.length>0){var r=this.symbols_to_define.pop(),i=this;this.popup_dialogue._show(r,e,(function(){t.vscode&&vscode.postMessage({type:"analysis.define_symbol",symbol:r,definition:e[r]}),void 0!==n&&n(),i.prompt_define_symbol(e,n)}))}}},{key:"recursive_find_undefined_symbol",value:function(e,t){var n=this;e.forEach((function(e,r,i){switch(e.type){case"SymbolNode":e.name in t&&void 0===t[e.name]&&!n.symbols_to_define.includes(e.name)&&n.symbols_to_define.push(e.name);break;case"OperatorNode":case"ParenthesisNode":n.recursive_find_undefined_symbol(e,t)}}))}},{key:"init_overlay_popup_dialogue",value:function(){var e=(0,l.az)("div","",["sdfv_modal_background"],document.body);e._show=function(){this.style.display="block"},e._hide=function(){this.style.display="none"};var t=(0,l.az)("div","sdfv_overlay_dialogue",["sdfv_modal"],e);t.addEventListener("click",(function(e){e.stopPropagation()})),t.style.display="none",this.popup_dialogue=t;var n=(0,l.az)("div","",["sdfv_modal_title_bar"],this.popup_dialogue);this.popup_dialogue._title=(0,l.az)("span","",["sdfv_modal_title"],n);var r=(0,l.az)("div","",["modal_close"],n);r.innerHTML=(0,M.v)(g||(g=(0,x.Z)(['<i class="material-icons">close</i>']))),r.addEventListener("click",(function(){t._hide()}));var i=(0,l.az)("div","",["sdfv_modal_content_box"],this.popup_dialogue);function a(){if(t._map&&t._symbol){var e=t._input.value;if(e&&!isNaN(e)&&Number.isInteger(+e)&&e>0)return t._map[t._symbol]=e,t._hide(),void(t._callback&&t._callback())}t._input.setCustomValidity("Invalid, not an integer")}this.popup_dialogue._content=(0,l.az)("div","",["sdfv_modal_content"],i),this.popup_dialogue._input=(0,l.az)("input","symbol_input",["sdfv_modal_input_text"],this.popup_dialogue._content),this.popup_dialogue._input.addEventListener("keypress",(function(e){13===e.which&&a()}));var o=(0,l.az)("div","",["sdfv_modal_footer_bar"],this.popup_dialogue),s=(0,l.az)("div","",["button","sdfv_modal_confirm_button"],o);s.addEventListener("click",(function(e){a()})),(0,l.az)("span","",[],s).innerText="Confirm",(0,l.az)("div","",["clearfix"],o),this.popup_dialogue._show=function(n,r,i){this.style.display="block",t._title.innerText="Define symbol "+n,t._symbol=n,t._map=r,t._callback=i,e._show()},this.popup_dialogue._hide=function(){this.style.display="none",t._title.innerText="",t._input.value="",t._input.setCustomValidity(""),e._hide()},e.addEventListener("click",(function(e){t._hide()}))}}]),e}(),O=function(){function e(t){(0,r.Z)(this,e),this.renderer=t,this.badness_scale_method="median",this.overlays=[],this.symbol_resolver=new k(this.renderer)}return(0,i.Z)(e,[{key:"register_overlay",value:function(e){switch(e){case N.n:case E.C:case w.P:this.overlays.push(new e(this,this.renderer));break;default:this.overlays.push(e)}this.renderer.draw_async()}},{key:"deregister_overlay",value:function(e){this.overlays=this.overlays.filter((function(t){return!(t instanceof e)})),this.renderer.draw_async()}},{key:"is_overlay_active",value:function(e){return this.overlays.filter((function(t){return t instanceof e})).length>0}},{key:"get_overlay",value:function(e){var t=void 0;return this.overlays.forEach((function(n){n instanceof e&&(t=n)})),t}},{key:"symbol_value_changed",value:function(e,t){this.symbol_resolver.symbol_value_changed(e,t),this.overlays.forEach((function(e){e.refresh()}))}},{key:"update_badness_scale_method",value:function(e){this.badness_scale_method=e,this.overlays.forEach((function(e){e.refresh()}))}},{key:"draw",value:function(){this.overlays.forEach((function(e){e.draw()}))}},{key:"refresh",value:function(){this.overlays.forEach((function(e){e.refresh()}))}},{key:"on_mouse_event",value:function(e,t,n,r,i,a){this.overlays.forEach((function(o){o.on_mouse_event(e,t,n,r,i,a)}))}}]),e}(),C=n(6323);function A(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return T(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?T(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function T(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}function I(e,t,n,r){switch(e){case"SDFGState":return t instanceof d.gE||null===t;case"Edge":return t instanceof SDFGNode||t instanceof State;case"LibraryNode":return t instanceof State&&n;default:return t instanceof State}}var D=function(){function e(t,n){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null,a=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null,o=arguments.length>4&&void 0!==arguments[4]&&arguments[4],s=arguments.length>5&&void 0!==arguments[5]?arguments[5]:null,u=arguments.length>6&&void 0!==arguments[6]?arguments[6]:null;(0,r.Z)(this,e),this.sdfg=t,this.sdfg_list={},this.state_parent_list={},this.container=n,this.ctx=null,this.canvas=null,this.last_visible_elements=null,this.last_hovered_elements=null,this.last_clicked_elements=null,this.last_dragged_element=null,this.tooltip=null,this.tooltip_container=null,this.menu=null,this.toolbar=null,this.panmode_btn=null,this.movemode_btn=null,this.selectmode_btn=null,this.addmode_btns=null,this.add_type=null,this.add_mode_lib=null,this.addmode_divs=null,this.mode_selected_bg_color="#CCCCCC",this.mouse_follow_svgs=null,this.mouse_follow_element=null,this.all_memlet_trees_sdfg=[],this.inclusive_ranges=!1,this.omit_access_nodes=!1,this.mouse_mode="pan",this.box_select_rect=null,this.mousepos=null,this.realmousepos=null,this.dragging=!1,this.drag_start=null,this.drag_second_start=null,this.external_mouse_handler=i,this.ctrl_key_selection=!1,this.shift_key_movement=!1,this.add_uuid=null,this.add_position=null,this.add_edge_start=null,this.selected_elements=[];try{this.overlay_manager=new O(this)}catch(e){this.overlay_manager=null}this.in_vscode=!1;try{vscode,vscode&&(this.in_vscode=!0)}catch(e){}this.debug_draw=o,this.init_elements(a,s,u),this.relayout(),this.all_memlet_trees_sdfg=(0,c.KV)(this.sdfg),this.update_fast_memlet_lookup()}return(0,i.Z)(e,[{key:"destroy",value:function(){try{this.menu&&this.menu.destroy(),this.canvas_manager.destroy(),this.container.removeChild(this.canvas),this.container.removeChild(this.toolbar),this.container.removeChild(this.tooltip_container)}catch(e){}}},{key:"view_settings",value:function(){return{inclusive_ranges:this.inclusive_ranges}}},{key:"update_toggle_buttons",value:function(){this.canvas.style.cursor="default",this.interaction_info_box.style.display="none",this.interaction_info_text.innerHTML="",this.panmode_btn.style="padding-bottom: 0px; user-select: none",this.movemode_btn.style="padding-bottom: 0px; user-select: none",this.selectmode_btn.style="padding-bottom: 0px; user-select: none",this.mouse_follow_element.innerHTML=null;var e,t=A(this.addmode_btns);try{for(t.s();!(e=t.n()).done;){var n=e.value;n.getAttribute("type")==this.add_type?(n.style="user-select: none; background: "+this.mode_selected_bg_color,this.mouse_follow_element.innerHTML=this.mouse_follow_svgs[this.add_type]):n.style="user-select: none;"}}catch(e){t.e(e)}finally{t.f()}switch(this.mouse_mode){case"move":this.movemode_btn.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color,this.interaction_info_box.style.display="block",this.interaction_info_text.innerHTML="Middle Mouse: Pan view<br>Right Click: Reset position";break;case"select":this.selectmode_btn.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color,this.interaction_info_box.style.display="block",this.canvas.style.cursor="crosshair",this.ctrl_key_selection?this.interaction_info_text.innerHTML="Middle Mouse: Pan view":this.interaction_info_text.innerHTML="Shift: Add to selection<br>Ctrl: Remove from selection<br>Middle Mouse: Pan view";break;case"add":this.interaction_info_box.style.display="block","Edge"===this.add_type?this.add_edge_start?this.interaction_info_text.innerHTML="Left Click: Select second element (to)<br>Middle Mouse: Pan view<br>Right Click / Esc: Abort":this.interaction_info_text.innerHTML="Left Click: Select first element (from)<br>Middle Mouse: Pan view<br>Right Click / Esc: Abort":this.interaction_info_text.innerHTML="Left Click: Place element<br>Ctrl + Left Click: Place and stay in Add Mode<br>Middle Mouse: Pan view<br>Right Click / Esc: Abort";break;case"pan":default:this.panmode_btn.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color}}},{key:"init_elements",value:function(e,t,n){var r,i=this;this.canvas=document.createElement("canvas"),this.canvas.classList.add("sdfg_canvas"),this.canvas.style.backgroundColor=t||"inherit",this.container.append(this.canvas),this.debug_draw&&(this.dbg_info_box=document.createElement("div"),this.dbg_info_box.style.position="absolute",this.dbg_info_box.style.bottom=".5rem",this.dbg_info_box.style.right=".5rem",this.dbg_info_box.style.backgroundColor="black",this.dbg_info_box.style.padding=".3rem",this.dbg_mouse_coords=document.createElement("span"),this.dbg_mouse_coords.style.color="white",this.dbg_mouse_coords.style.fontSize="1rem",this.dbg_mouse_coords.innerText="x: N/A / y: N/A",this.dbg_info_box.appendChild(this.dbg_mouse_coords),this.container.appendChild(this.dbg_info_box)),this.interaction_info_box=document.createElement("div"),this.interaction_info_box.style.position="absolute",this.interaction_info_box.style.bottom=".5rem",this.interaction_info_box.style.left=".5rem",this.interaction_info_box.style.backgroundColor="rgba(0, 0, 0, 0.5)",this.interaction_info_box.style.borderRadius="5px",this.interaction_info_box.style.padding=".3rem",this.interaction_info_box.style.display="none",this.interaction_info_text=document.createElement("span"),this.interaction_info_text.style.color="#eeeeee",this.interaction_info_text.innerHTML="",this.interaction_info_box.appendChild(this.interaction_info_text),this.container.appendChild(this.interaction_info_box),this.toolbar=document.createElement("div"),this.toolbar.style="position:absolute; top:10px; left: 10px;";try{f.x,(r=document.createElement("button")).className="button",r.innerHTML='<i class="material-icons">menu</i>',r.style="padding-bottom: 0px; user-select: none";var a=this;r.onclick=function(){var e=this;if(a.menu&&a.menu.visible())a.menu.destroy();else{var t=this.getBoundingClientRect(),n=new f.x;n.addOption("Save view as PNG",(function(e){return a.save_as_png()})),a.has_pdf()&&(n.addOption("Save view as PDF",(function(e){return a.save_as_pdf()})),n.addOption("Save all as PDF",(function(e){return a.save_as_pdf(!0)}))),n.addCheckableOption("Inclusive ranges",a.inclusive_ranges,(function(e,t){a.inclusive_ranges=t})),n.addCheckableOption("Adaptive content hiding",a.ctx.lod,(function(e,t){a.ctx.lod=t})),this.in_vscode||n.addOption("Overlays",(function(){if(a.overlays_menu&&a.overlays_menu.visible())a.overlays_menu.destroy();else{var t=n._cmenu_elem.getBoundingClientRect(),r=new f.x;r.addCheckableOption("Memory volume analysis",a.overlay_manager.is_overlay_active(N.n),(function(t,n){n?a.overlay_manager.register_overlay(N.n):a.overlay_manager.deregister_overlay(N.n),a.draw_async(),e.in_vscode&&refresh_analysis_pane()})),a.overlays_menu=r,a.overlays_menu.show(t.left,t.top)}})),n.addCheckableOption("Hide Access Nodes",a.omit_access_nodes,(function(e,t){a.omit_access_nodes=t,a.relayout(),a.draw_async()})),n.addOption("Reset positions",(function(){return a.reset_positions()})),a.menu=n,a.menu.show(t.left,t.bottom)}},r.title="Menu",this.toolbar.appendChild(r)}catch(e){}if((r=document.createElement("button")).className="button",r.innerHTML='<i class="material-icons">filter_center_focus</i>',r.style="padding-bottom: 0px; user-select: none",r.onclick=function(){return i.zoom_to_view()},r.title="Zoom to fit SDFG",this.toolbar.appendChild(r),(r=document.createElement("button")).className="button",r.innerHTML='<i class="material-icons">unfold_less</i>',r.style="padding-bottom: 0px; user-select: none",r.onclick=function(){return i.collapse_all()},r.title="Collapse all elements",this.toolbar.appendChild(r),(r=document.createElement("button")).className="button",r.innerHTML='<i class="material-icons">unfold_more</i>',r.style="padding-bottom: 0px; user-select: none",r.onclick=function(){return i.expand_all()},r.title="Expand all elements",this.toolbar.appendChild(r),n){this.panmode_btn=n.pan,this.movemode_btn=n.move,this.selectmode_btn=n.select,this.addmode_btns=n.add_btns;var o,s=A(this.addmode_btns);try{var u=function(){var e=o.value;"LibraryNode"===e.getAttribute("type")?e.onclick=function(){i.show_select_library_node_dialog((function(){i.mouse_mode="add",i.add_type="LibraryNode",i.add_edge_start=null,i.update_toggle_buttons()}))}:e.onclick=function(){daemon_connected?(i.mouse_mode="add",i.add_type=e.getAttribute("type"),i.add_mode_lib=null,i.add_edge_start=null,i.update_toggle_buttons()):i.show_no_daemon_dialog()}};for(s.s();!(o=s.n()).done;)u()}catch(e){s.e(e)}finally{s.f()}this.mode_selected_bg_color="#22A4FE"}else{this.addmode_btns=[];var l=document.createElement("button");l.className="button",l.innerHTML='<i class="material-icons">pan_tool</i>',l.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color,l.title="Pan mode",this.panmode_btn=l,this.toolbar.appendChild(l);var c=document.createElement("button");c.className="button",c.innerHTML='<i class="material-icons">open_with</i>',c.style="padding-bottom: 0px; user-select: none",c.title="Object moving mode",this.movemode_btn=c,this.toolbar.appendChild(c);var d=document.createElement("button");d.className="button",d.innerHTML='<i class="material-icons">border_style</i>',d.style="padding-bottom: 0px; user-select: none",d.title="Select mode",this.selectmode_btn=d,this.toolbar.appendChild(d)}if(this.panmode_btn.onclick=function(){i.mouse_mode="pan",i.add_type=null,i.add_mode_lib=null,i.add_edge_start=null,i.update_toggle_buttons()},this.movemode_btn.onclick=function(e,t){i.shift_key_movement&&!1===t?i.mouse_mode="pan":i.mouse_mode="move",i.add_type=null,i.add_mode_lib=null,i.add_edge_start=null,i.shift_key_movement=t,i.update_toggle_buttons()},this.selectmode_btn.onclick=function(e,t){i.ctrl_key_selection&&!1===t?i.mouse_mode="pan":i.mouse_mode="select",i.add_type=null,i.add_mode_lib=null,i.add_edge_start=null,i.ctrl_key_selection=t,i.update_toggle_buttons()},document.addEventListener("keydown",(function(e){return i.on_key_event(e)})),document.addEventListener("keyup",(function(e){return i.on_key_event(e)})),this.in_vscode){var p=document.createElement("button");p.id="exit-preview-button",p.className="button hidden",p.innerHTML='<i class="material-icons">close</i>',p.style="padding-bottom: 0px; user-select: none",p.onclick=function(){p.className="button hidden",window.viewing_history_state=!1,vscode&&(vscode.postMessage({type:"sdfv.get_current_sdfg",prevent_refreshes:!0}),vscode.postMessage({type:"transformation_history.refresh",reset_active:!0}))},p.title="Exit preview",this.toolbar.appendChild(p)}this.container.append(this.toolbar),this.tooltip_container=document.createElement("div"),this.tooltip_container.innerHTML="",this.tooltip_container.className="sdfvtooltip",this.tooltip_container.onmouseover=function(){return i.tooltip_container.style.display="none"},this.container.appendChild(this.tooltip_container),this.error_popover_container=document.createElement("div"),this.error_popover_container.innerHTML="",this.error_popover_container.className="invalid_popup",this.error_popover_text=document.createElement("div");var h=document.createElement("button"),m=this;h.onclick=function(){m.sdfg.error=void 0,m.error_popover_text.innerText="",m.error_popover_container.style.display="none"},h.style.float="right",h.style.cursor="pointer",h.style.color="white",h.innerHTML='<i class="material-icons">close</i>',this.error_popover_container.appendChild(h),this.error_popover_container.appendChild(this.error_popover_text),this.container.appendChild(this.error_popover_container),this.ctx=this.canvas.getContext("2d"),this.canvas_manager=new b(this.ctx,this,this.canvas),null!==e&&(this.canvas_manager.user_transform=e),new MutationObserver((function(e){i.onresize(),i.draw_async()})).observe(this.container,{attributes:!0}),this.bgcolor=t||window.getComputedStyle(this.canvas).backgroundColor,this.relayout(),this.set_mouse_handlers(),null===e&&this.zoom_to_view();var v=document.createElement("div");v.style="position: absolute; top: 0px; left: 0px; user-select: none; pointer-events: none;",this.container.appendChild(v),this.mouse_follow_element=v,this.mouse_follow_svgs={Map:'<svg width="8rem" height="2rem" viewBox="0 0 800 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="10" x2="190" y1="190" y2="10"/>\n                <line x1="190" x2="600" y1="10" y2="10"/>\n                <line x1="600" x2="790" y1="10" y2="190"/>\n                <line x1="790" x2="10" y1="190" y2="190"/>\n            </svg>',Consume:'<svg width="8rem" height="2rem" viewBox="0 0 800 200" stroke="black" stroke-width="10" stroke-dasharray="60,25" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="10"x2="190" y1="190" y2="10"/>\n                <line x1="190" x2="600" y1="10" y2="10"/>\n                <line x1="600" x2="790" y1="10" y2="190"/>\n                <line x1="790" x2="10" y1="190" y2="190"/>\n            </svg>',Tasklet:'<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="10" x2="70" y1="130" y2="190"/>\n                <line x1="70" x2="330" y1="190" y2="190"/>\n                <line x1="330" x2="390" y1="190" y2="130"/>\n                <line x1="390" x2="390" y1="130" y2="70"/>\n                <line x1="390" x2="330" y1="70" y2="10"/>\n                <line x1="330" x2="70" y1="10" y2="10"/>\n                <line x1="70" x2="10" y1="10" y2="70"/>\n                <line x1="10" x2="10" y1="70" y2="130"/>\n            </svg>',NestedSDFG:'<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="40" x2="80" y1="120" y2="160"/>\n                <line x1="80" x2="320" y1="160" y2="160"/>\n                <line x1="320" x2="360" y1="160" y2="120"/>\n                <line x1="360" x2="360" y1="120" y2="80"/>\n                <line x1="360" x2="320" y1="80" y2="40"/>\n                <line x1="320" x2="80" y1="40" y2="40"/>\n                <line x1="80" x2="40" y1="40" y2="80"/>\n                <line x1="40" x2="40" y1="80" y2="120"/>\n                \n                <line x1="10" x2="70" y1="130" y2="190"/>\n                <line x1="70" x2="330" y1="190" y2="190"/>\n                <line x1="330" x2="390" y1="190" y2="130"/>\n                <line x1="390" x2="390" y1="130" y2="70"/>\n                <line x1="390" x2="330" y1="70" y2="10"/>\n                <line x1="330" x2="70" y1="10" y2="10"/>\n                <line x1="70" x2="10" y1="10" y2="70"/>\n                <line x1="10" x2="10" y1="70" y2="130"/>\n            </svg>',LibraryNode:'<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                        <line x1="10" x2="10" y1="10" y2="190"/>\n                        <line x1="10" x2="390" y1="190" y2="190"/>\n                        <line x1="390" x2="390" y1="190" y2="55"/>\n                        <line x1="390" x2="345" y1="55" y2="10"/>\n                        <line x1="345" x2="10" y1="10" y2="10"/>\n                        <line x1="345" x2="345" y1="10" y2="55"/>\n                        <line x1="345" x2="390" y1="55" y2="55"/>\n            </svg>',AccessNode:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <circle cx="100" cy="100" r="90" fill="none"/>\n            </svg>',Stream:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <circle cx="100" cy="100" r="90" fill="none" stroke-dasharray="60,25"/>\n            </svg>',SDFGState:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <rect x="20" y="20" width="160" height="160" style="fill:#deebf7;" />\n            </svg>',Connector:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <circle cx="100" cy="100" r="40" fill="none"/>\n            </svg>',Edge:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <defs>\n                    <marker id="arrowhead" markerWidth="10" markerHeight="7"  refX="0" refY="3.5" orient="auto">\n                        <polygon points="0 0, 10 3.5, 0 7" />\n                    </marker>\n                </defs>\n                <line x1="20" y1="20" x2="180" y2="180" marker-end="url(#arrowhead)" />\n            </svg>'},this.update_toggle_buttons(),this.draw_async()}},{key:"draw_async",value:function(){this.canvas_manager.draw_async()}},{key:"send_new_sdfg_to_vscode",value:function(){}},{key:"add_node_to_graph",value:function(){}},{key:"remove_graph_nodes",value:function(){}},{key:"update_new_element",value:function(){}},{key:"show_no_daemon_dialog",value:function(){}},{key:"show_select_library_node_dialog",value:function(){}},{key:"set_sdfg",value:function(e){if(this.sdfg=e,this.relayout(),this.draw_async(),1==this.selected_elements.length){var t=(0,u.FK)(this.selected_elements[0]);(0,C.e)((0,u.sC)(this.graph,t).element)}}},{key:"set_mouse_handlers",value:function(){for(var e=this,t=this.canvas,n=function(){return t.getBoundingClientRect()},r=function(t){return e.canvas_manager.mapPixelToCoordsX(t.clientX-n().left)},i=function(t){return e.canvas_manager.mapPixelToCoordsY(t.clientY-n().top)},a=function(){var n=s[o];t.addEventListener(n,(function(t){e.on_mouse_event(t,r,i,n)||e.in_vscode||(t.stopPropagation(),t.preventDefault())}))},o=0,s=["mousedown","mousemove","mouseup","touchstart","touchmove","touchend","wheel","click","dblclick","contextmenu"];o<s.length;o++)a()}},{key:"onresize",value:function(){this.canvas.style.width="99%",this.canvas.style.height="99%",this.canvas.width=this.canvas.offsetWidth,this.canvas.height=this.canvas.offsetHeight}},{key:"update_fast_memlet_lookup",value:function(){this.all_memlet_trees=[];var e,t=A(this.all_memlet_trees_sdfg);try{for(t.s();!(e=t.n()).done;){var n,r=e.value,i=new Set,a=A(r);try{for(a.s();!(n=a.n()).done;){var o=n.value;i.add(o.attributes.data.edge)}}catch(e){a.e(e)}finally{a.f()}this.all_memlet_trees.push(i)}}catch(e){t.e(e)}finally{t.f()}}},{key:"relayout",value:function(){this.sdfg_list={},this.graph=P(this.ctx,this.sdfg,this.sdfg_list,this.state_parent_list,this.omit_access_nodes),this.onresize(),this.update_fast_memlet_lookup(),this.translate_moved_elements(),null!==this.overlay_manager&&this.overlay_manager.refresh();try{vscode&&outline(this,this.graph)}catch(e){}return this.graph}},{key:"translate_moved_elements",value:function(){var e=this;(0,c.LY)(this.graph,(function(t,n){var r,i=0,a=0;t instanceof Node&&function e(t){if(t.data.node.scope_entry){var r=n.node(t.data.node.scope_entry),o=(0,u.Wp)(r);o&&Number.isFinite(o.scope_dx)&&Number.isFinite(o.scope_dy)&&(i+=o.scope_dx,a+=o.scope_dy),r&&e(r)}}(t);var o=i,s=a,l=(0,u.Wp)(t);return l&&(o+=l.dx,s+=l.dy),(o||s)&&e.canvas_manager.translate_element(t,{x:t.x,y:t.y},{x:t.x+o,y:t.y+s},e.graph,e.sdfg_list,e.state_parent_list,void 0,!1),n.inEdges(t.id).forEach((function(e){})),null===(r=n.inEdges(t.id))||void 0===r||r.forEach((function(t){var r,o=n.edge(t),s=(0,u.Wp)(o);if(i||a){(r=[]).push({dx:0,dy:0});for(var l=1;l<o.points.length-1;l++)r.push({dx:i,dy:a}),null!=s&&s.points&&(r[l].dx+=s.points[l].dx,r[l].dx+=s.points[l].dy);r.push({dx:0,dy:0})}else null!=s&&s.points&&(r=s.points);r&&e.canvas_manager.translate_element(o,{x:0,y:0},{x:0,y:0},e.graph,e.sdfg_list,e.state_parent_list,void 0,!1,!1,r)})),!0}))}},{key:"zoom_to_view",value:function(){var e=this,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null,n=!(arguments.length>1&&void 0!==arguments[1])||arguments[1];t&&0!=t.length||(t=this.graph.nodes().map((function(t){return e.graph.node(t)})));var r=h(t);this.canvas_manager.set_view(r,n),this.draw_async()}},{key:"collapse_all",value:function(){this.for_all_sdfg_elements((function(e,t,n){"is_collapsed"in n.attributes&&!n.type.endsWith("Exit")&&(n.attributes.is_collapsed=!0)})),this.send_new_sdfg_to_vscode(),this.relayout(),this.draw_async()}},{key:"expand_all",value:function(){this.for_all_sdfg_elements((function(e,t,n){"is_collapsed"in n.attributes&&!n.type.endsWith("Exit")&&(n.attributes.is_collapsed=!1)})),this.send_new_sdfg_to_vscode(),this.relayout(),this.draw_async()}},{key:"reset_positions",value:function(){this.for_all_sdfg_elements((function(e,t,n){(0,u.lU)(n)})),this.send_new_sdfg_to_vscode(),this.relayout(),this.draw_async()}},{key:"save",value:function(e,t){var n=document.createElement("a");n.setAttribute("download",e),n.href=t,document.body.appendChild(n),window.requestAnimationFrame((function(){var e=new MouseEvent("click");n.dispatchEvent(e),document.body.removeChild(n)}))}},{key:"save_as_png",value:function(){this.save("sdfg.png",this.canvas.toDataURL("image/png"))}},{key:"has_pdf",value:function(){try{return blobStream,canvas2pdf.PdfContext,!0}catch(e){return!1}}},{key:"save_as_pdf",value:function(){var e,t=this,n=arguments.length>0&&void 0!==arguments[0]&&arguments[0],r=blobStream(),i=this.canvas_manager.mapPixelToCoordsX(0),a=this.canvas_manager.mapPixelToCoordsY(0);if(n){var o=this.graph.nodes().map((function(e){return t.graph.node(e)})),s=h(o);e=[s.width,s.height]}else{var u=this.canvas_manager.mapPixelToCoordsX(this.canvas.width),l=this.canvas_manager.mapPixelToCoordsY(this.canvas.height),c=u-i,f=l-a;e=[c,f]}var d=new canvas2pdf.PdfContext(r,{size:e}),p=this.ctx;this.ctx=d,this.ctx.lod=!n,this.ctx.pdf=!0,n||this.ctx.translate(-i,-a),this.draw_async(),d.stream.on("finish",(function(){t.save("sdfg.pdf",d.stream.toBlobURL("application/pdf")),t.ctx=p,t.draw_async()}))}},{key:"debug_draw_grid",value:function(e,t,n,r){for(var i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:100,a=Math.floor(e/i)*i,o=Math.ceil(n/i)*i,s=Math.floor(t/i)*i,u=Math.ceil(r/i)*i,l=a;l<=o;l+=i)this.ctx.moveTo(l,s),this.ctx.lineTo(l,u);for(l=s;l<=u;l+=i)this.ctx.moveTo(a,l),this.ctx.lineTo(o,l);this.ctx.strokeStyle="yellow",this.ctx.stroke(),this.ctx.beginPath(),this.ctx.arc(0,0,10,0,2*Math.PI,!1),this.ctx.fillStyle="red",this.ctx.fill(),this.ctx.strokeStyle="red",this.ctx.stroke()}},{key:"draw",value:function(e){var t=this.ctx,n=this.graph,r=this.canvas_manager.mapPixelToCoordsX(0),i=this.canvas_manager.mapPixelToCoordsY(0),a=this.canvas_manager.mapPixelToCoordsX(this.canvas.width),o=this.canvas_manager.mapPixelToCoordsY(this.canvas.height),s=a-r,u=o-i;if(this.visible_rect={x:r,y:i,w:s,h:u},this.on_pre_draw(),(0,d.tl)(this,t,n,this.mousepos,this.debug_draw),this.box_select_rect){this.ctx.beginPath();var l=this.ctx.lineWidth;this.ctx.lineWidth=this.canvas_manager.points_per_pixel(),this.ctx.strokeStyle="grey",this.ctx.rect(this.box_select_rect.x_start,this.box_select_rect.y_start,this.box_select_rect.x_end-this.box_select_rect.x_start,this.box_select_rect.y_end-this.box_select_rect.y_start),this.ctx.stroke(),this.ctx.lineWidth=l}this.debug_draw&&(this.debug_draw_grid(r,i,a,o,100),this.mousepos?this.dbg_mouse_coords.innerText="x: "+Math.floor(this.mousepos.x)+" / y: "+Math.floor(this.mousepos.y):this.dbg_mouse_coords.innerText="x: N/A / y: N/A"),this.on_post_draw()}},{key:"on_pre_draw",value:function(){}},{key:"on_post_draw",value:function(){null!==this.overlay_manager&&this.overlay_manager.draw();try{this.ctx.end()}catch(e){}if(this.tooltip){var e=this.canvas.getBoundingClientRect(),t={x:this.realmousepos.x-e.x,y:this.realmousepos.y-e.y};this.tooltip_container.style="",this.tooltip_container.innerHTML="",this.tooltip_container.style.display="block",this.tooltip(this.tooltip_container),this.tooltip_container.style.top=t.y+"px",this.tooltip_container.style.left=t.x+20+"px"}else this.tooltip_container.style.display="none";if(this.sdfg.error){var n=this.sdfg.error,r="",i=-1,a=-1;if(void 0!==n.isedge_id)r="isedge",a=n.isedge_id;else{if(void 0===n.state_id)return;i=n.state_id,void 0!==n.node_id?(r="node",a=n.node_id):void 0!==n.edge_id?(r="edge",a=n.edge_id):r="state"}var o=find_graph_element(this.graph,r,n.sdfg_id,i,a);o&&(this.zoom_to_view([o]),this.error_popover_container.style.display="block",this.error_popover_container.style.bottom="5%",this.error_popover_container.style.left="5%",this.error_popover_text.innerText=n.message)}else this.error_popover_container.style.display="none"}},{key:"visible_elements",value:function(){var e=this.canvas_manager.mapPixelToCoordsX(0),t=this.canvas_manager.mapPixelToCoordsY(0),n=this.canvas_manager.mapPixelToCoordsX(this.canvas.width)-e,r=this.canvas_manager.mapPixelToCoordsY(this.canvas.height)-t,i=[];return this.do_for_intersected_elements(e,t,n,r,(function(e,t,n){var r=t.state?Number(t.state):-1,a="other";"nodes"===e?a="node":"states"===e?a="state":"edges"===e?a="edge":"isedges"===e?a="isedge":"connectors"===e&&(a="connector"),i.push({type:a,sdfg_id:Number(t.sdfg_id),state_id:r,id:Number(t.id)})})),i}},{key:"elements_in_rect",value:function(e,t,n,r){var i={states:[],nodes:[],connectors:[],edges:[],isedges:[]};return this.do_for_intersected_elements(e,t,n,r,(function(e,t,n){t.obj=n,i[e].push(t)})),i}},{key:"do_for_intersected_elements",value:function(e,t,n,r,i){!function a(o,s,u){o.nodes().forEach((function(l){var c=o.node(l);if(c&&c.intersect(e,t,n,r)){if(i("states",{sdfg:s,sdfg_id:u,id:l},c),c.data.state.attributes.is_collapsed)return;var f=c.data.graph;if(!f)return;f.nodes().forEach((function(o){var c=f.node(o);c.intersect(e,t,n,r)&&(i("nodes",{sdfg:s,sdfg_id:u,state:l,id:o},c),"NestedSDFG"===c.data.node.type&&a(c.data.graph,c.data.node.attributes.sdfg.attributes.name,c.data.node.attributes.sdfg.sdfg_list_id)),c.in_connectors.forEach((function(a,c){a.intersect(e,t,n,r)&&i("connectors",{sdfg:s,sdfg_id:u,state:l,node:o,connector:c,conntype:"in"},a)})),c.out_connectors.forEach((function(a,c){a.intersect(e,t,n,r)&&i("connectors",{sdfg:s,sdfg_id:u,state:l,node:o,connector:c,conntype:"out"},a)}))})),f.edges().forEach((function(a){var o=f.edge(a);o.intersect(e,t,n,r)&&i("edges",{sdfg:s,sdfg_id:u,state:l,id:o.id},o)}))}})),o.edges().forEach((function(a){var l=o.edge(a);l.intersect(e,t,n,r)&&i("isedges",{sdfg:s,sdfg_id:u,id:l.id},l)}))}(this.graph,this.sdfg.attributes.name,this.sdfg.sdfg_list_id)}},{key:"for_all_sdfg_elements",value:function(e){!function t(n){n.nodes.forEach((function(r,i){e("states",{sdfg:n,id:i},r),r.nodes.forEach((function(r,a){e("nodes",{sdfg:n,state:i,id:a},r),"NestedSDFG"===r.type&&t(r.attributes.sdfg)})),r.edges.forEach((function(t,r){e("edges",{sdfg:n,state:i,id:r},t)}))})),n.edges.forEach((function(t,r){e("isedges",{sdfg:n,id:r},t)}))}(this.sdfg)}},{key:"for_all_elements",value:function(e,t,n,r,i){!function a(o,s){o.nodes().forEach((function(u){var l=o.node(u);if(l&&(i("states",{sdfg:s,id:u,graph:o},l,l.intersect(e,t,n,r)),!l.data.state.attributes.is_collapsed)){var c=l.data.graph;c&&(c.nodes().forEach((function(o){var l=c.node(o);i("nodes",{sdfg:s,state:u,id:o,graph:c},l,l.intersect(e,t,n,r)),"NestedSDFG"===l.data.node.type&&a(l.data.graph,l.data.node.attributes.sdfg.attributes.name),l.in_connectors.forEach((function(a,l){i("connectors",{sdfg:s,state:u,node:o,connector:l,conntype:"in",graph:c},a,a.intersect(e,t,n,r))})),l.out_connectors.forEach((function(a,l){i("connectors",{sdfg:s,state:u,node:o,connector:l,conntype:"out",graph:c},a,a.intersect(e,t,n,r))}))})),c.edges().forEach((function(a){var o=c.edge(a);i("edges",{sdfg:s,state:u,id:o.id,graph:c},o,o.intersect(e,t,n,r))})))}})),o.edges().forEach((function(a){var u=o.edge(a);i("isedges",{sdfg:s,id:u.id,graph:o},u,u.intersect(e,t,n,r))}))}(this.graph,this.sdfg.attributes.name)}},{key:"get_nested_memlet_tree",value:function(e){var t,n=A(this.all_memlet_trees);try{for(n.s();!(t=n.n()).done;){var r=t.value;if(r.has(e))return r}}catch(e){n.e(e)}finally{n.f()}return[]}},{key:"find_elements_under_cursor",value:function(e,t){for(var n=this.elements_in_rect(e,t,0,0),r=n.states,i=n.nodes,a=n.edges,o=n.isedges,s=n.connectors,u=r.length+i.length+a.length+o.length+s.length,l=null,c=-1,f=0,d=[r,o,i,a];f<d.length;f++)for(var p=d[f],h=0;h<p.length;h++){var m=p[h].obj.width*p[h].obj.height;(c<0||m<c)&&(c=m,l=p[h].obj)}return{total_elements:u,elements:n,foreground_elem:l}}},{key:"on_key_event",value:function(e){if(e.target===document.body){if(this.ctrl_key_selection&&!e.ctrlKey&&this.selectmode_btn.onclick(e,!1),this.shift_key_movement&&!e.shiftKey&&this.movemode_btn.onclick(e,!1),"pan"===this.mouse_mode)return"Escape"===e.key?this.selected_elements.length>0&&(this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=[],this.draw_async()):"Delete"===e.key&&"keyup"===e.type&&(this.selected_elements.length>0&&this.remove_graph_nodes(this.selected_elements),this.selected_elements=[]),e.ctrlKey&&!e.shiftKey&&this.selectmode_btn.onclick(e,!0),e.shiftKey&&!e.ctrlKey&&this.movemode_btn.onclick(e,!0),!0;"Escape"!==e.key||e.ctrlKey||e.shiftKey||this.panmode_btn.onclick()}}},{key:"on_mouse_event",value:function(e,t,n){var r=this,i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"other";(this.ctrl_key_selection||this.shift_key_movement)&&this.on_key_event(e);var a=!1,o=!1,s=!1;if("mousedown"===i||"touchstart"===i)this.drag_start=e;else if("mouseup"===i)this.drag_start=null,this.last_dragged_element=null;else if("touchend"===i)0==e.touches.length?this.drag_start=null:this.drag_start=e;else if("mousemove"===i){var l=this.mousepos;if(this.mousepos={x:t(e),y:n(e)},this.realmousepos={x:e.clientX,y:e.clientY},this.drag_start&&1&e.buttons){if(this.dragging=!0,"move"===this.mouse_mode){if(this.last_dragged_element){this.canvas.style.cursor="grabbing",this.drag_start.cx=t(this.drag_start),this.drag_start.cy=n(this.drag_start);var f=[this.last_dragged_element];this.selected_elements.includes(this.last_dragged_element)&&this.selected_elements.length>1&&(f=this.selected_elements.filter((function(e){if(e instanceof d.wR)return!1;var t=e.sdfg.sdfg_list_id,n=r.state_parent_list[t];if(n&&r.selected_elements.includes(n))return!1;var i=r.sdfg_list[t].node(e.parent_id);return!i||!r.selected_elements.includes(i)})));var p,h=f.length>1,m=A(f);try{for(m.s();!(p=m.n()).done;){var v=p.value;this.canvas_manager.translate_element(v,l,this.mousepos,this.graph,this.sdfg_list,this.state_parent_list,this.drag_start,!0,h)}}catch(e){m.e(e)}finally{m.f()}return a=!0,this.draw_async(),!1}var y=this.find_elements_under_cursor(this.mousepos.x,this.mousepos.y);return!y.foreground_elem||(this.last_dragged_element=y.foreground_elem,this.canvas.style.cursor="grabbing",!1)}"select"===this.mouse_mode?(this.box_select_rect={x_start:t(this.drag_start),y_start:n(this.drag_start),x_end:this.mousepos.x,y_end:this.mousepos.y},a=!0):(this.canvas_manager.translate(e.movementX,e.movementY),a=!0)}else if(this.drag_start&&4&e.buttons)this.dragging=!0,this.canvas_manager.translate(e.movementX,e.movementY),a=!0,o=!0;else if(this.drag_start=null,this.last_dragged_element=null,1&e.buttons||4&e.buttons)return!0}else if("touchmove"===i)if(this.drag_start.touches.length!=e.touches.length)this.drag_start=e;else{if(1==e.touches.length)return this.canvas_manager.translate(e.touches[0].clientX-this.drag_start.touches[0].clientX,e.touches[0].clientY-this.drag_start.touches[0].clientY),this.drag_start=e,a=!0,this.draw_async(),!1;if(2==e.touches.length){var g=this.drag_start.touches[0],_=this.drag_start.touches[1],b=g.clientX,x=_.clientX,w=g.clientY,E=_.clientY,N=[(b+x)/2,(w+E)/2],S=Math.sqrt(Math.pow(b-x,2)+Math.pow(w-E,2));b=e.touches[0].clientX,x=e.touches[1].clientX,w=e.touches[0].clientY,E=e.touches[1].clientY;var M=Math.sqrt(Math.pow(b-x,2)+Math.pow(w-E,2)),k=[(b+x)/2,(w+E)/2];return this.canvas_manager.translate(k[0]-N[0],k[1]-N[1]),this.canvas_manager.scale(M/S,k[0],k[1]),this.drag_start=e,a=!0,this.draw_async(),!1}}else if("wheel"===i){var O=this.canvas.getBoundingClientRect(),C=e.clientX-O.x,T=e.clientY-O.y;this.canvas_manager.scale(e.deltaY>0?.9:1.1,C,T),a=!0,o=!0}if(!this.mousepos)return!0;var D=this.find_elements_under_cursor(this.mousepos.x,this.mousepos.y),P=D.elements,j=D.total_elements,R=D.foreground_elem;if("add"==this.mouse_mode){var L=this.mouse_follow_element;I(this.add_type,R,this.add_mode_lib,this.mousepos)?L.firstElementChild.setAttribute("stroke","green"):L.firstElementChild.setAttribute("stroke","red"),L.style.left=e.layerX-L.firstElementChild.clientWidth/2+"px",L.style.top=e.layerY-L.firstElementChild.clientHeight/2+"px"}if("select"===this.mouse_mode?this.canvas.style.cursor="crosshair":j>0?"move"===this.mouse_mode&&this.drag_start?this.canvas.style.cursor="grabbing":"move"===this.mouse_mode?this.canvas.style.cursor="grab":R.data.state&&R.data.state.attributes.is_collapsed||R.data.node&&R.data.node.attributes.is_collapsed?this.canvas.style.cursor="alias":this.canvas.style.cursor="pointer":this.canvas.style.cursor="auto",this.tooltip=null,this.last_hovered_elements=P,this.for_all_elements(this.mousepos.x,this.mousepos.y,0,0,(function(e,t,n,r){n.hovered=!1,n.highlighted=!1})),this.for_all_elements(this.mousepos.x,this.mousepos.y,0,0,(function(e,t,n,i){if(i&&n instanceof d.kS&&null!=n.parent_id&&r.get_nested_memlet_tree(n).forEach((function(e){e!=n&&void 0!==e&&(e.highlighted=!0)})),i&&n instanceof AccessNode&&(0,c.LY)(r.sdfg_list[n.sdfg.sdfg_list_id],(function(e){return e instanceof State||(e instanceof AccessNode&&e.data.node.label===n.data.node.label&&(e.highlighted=!0),!1)})),i&&n instanceof d.wR){var a=t.graph.node(n.parent_id).data.graph;a&&(0,c.LY)(a,(function(e){return e instanceof State||(e instanceof AccessNode&&e.data.node.label===n.label()&&(e.highlighted=!0),!1)}))}i&&(n.hovered=!0)})),"add"===this.mouse_mode&&"Edge"===this.add_type&&this.add_edge_start&&(this.add_edge_start.highlighted=!0),"mousemove"===i&&(a=!0),"dblclick"===i){var B=R?R.sdfg:null,U=null;R instanceof State?U=R.data.state:R instanceof SDFGNode?(U=R.data.node).type.endsWith("Exit")&&(U=B.nodes[R.parent_id].nodes[U.scope_entry]):U=null,U&&"is_collapsed"in U.attributes&&(U.attributes.is_collapsed=!U.attributes.is_collapsed,this.send_new_sdfg_to_vscode(),this.relayout(),a=!0,o=!0)}var q=!1;if("click"===i)if(this.dragging){if(this.dragging=!1,q=!0,o=!0,this.box_select_rect){var z=[],F=Math.min(this.box_select_rect.x_start,this.box_select_rect.x_end),H=Math.max(this.box_select_rect.x_start,this.box_select_rect.x_end),Z=Math.min(this.box_select_rect.y_start,this.box_select_rect.y_end),W=Math.max(this.box_select_rect.y_start,this.box_select_rect.y_end),G=H-F,J=W-Z;this.do_for_intersected_elements(F,Z,G,J,(function(e,t,n){n.contained_in(F,Z,G,J)&&z.push(n)})),e.shiftKey&&!this.ctrl_key_selection?z.forEach((function(e){r.selected_elements.includes(e)||r.selected_elements.push(e)})):e.ctrlKey&&!this.ctrl_key_selection?z.forEach((function(e){r.selected_elements.includes(e)&&(r.selected_elements=r.selected_elements.filter((function(t){return t.selected=!1,t!==e})))})):(this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=z),this.box_select_rect=null,a=!0,o=!0,s=!0}"move"===this.mouse_mode&&this.send_new_sdfg_to_vscode()}else{if("add"===this.mouse_mode&&I(this.add_type,R,this.add_mode_lib,this.mousepos)){if("Edge"===this.add_type)if(this.add_edge_start){var $=this.add_edge_start;this.add_edge_start=void 0,this.add_node_to_graph(this.add_type,(0,u.FK)(R),(0,u.FK)($))}else this.add_edge_start=R,this.update_toggle_buttons();else"LibraryNode"===this.add_type?(this.add_position=this.mousepos,this.add_node_to_graph(this.add_type+"|"+this.add_mode_lib,(0,u.FK)(R))):(this.add_position=this.mousepos,this.add_node_to_graph(this.add_type,(0,u.FK)(R)));e.ctrlKey||"Edge"===this.add_type&&this.add_edge_start||this.panmode_btn.onclick()}R?e.ctrlKey?(this.selected_elements.includes(R)?(R.selected=!1,this.selected_elements=this.selected_elements.filter((function(e){return e!==R}))):this.selected_elements.push(R),s=!0):e.shiftKey||(this.selected_elements.length>1&&(s=!0),this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=[R]):(this.selected_elements.length>1&&(s=!0),this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=[]),a=!0,o=!0}if(this.selected_elements.forEach((function(e){e.selected=!0})),"contextmenu"===i)if("move"==this.mouse_mode){var V=[R];this.selected_elements.includes(R)&&(V=this.selected_elements);var K,Y=!1,X=!1,Q=A(V);try{for(Q.s();!(K=Q.n()).done;){var ee=K.value,te=(0,u.Wp)(ee);if(ee&&!(ee instanceof d.wR)&&te){if(ee instanceof d.kS){if(!te.points)continue;for(var ne=new Array(ee.points.length),re=1;re<ee.points.length-1;re++)ne[re]={dx:-te.points[re].dx,dy:-te.points[re].dy},te.points[re].dx=0,te.points[re].dy=0;this.canvas_manager.translate_element(ee,{x:0,y:0},{x:0,y:0},this.graph,this.sdfg_list,this.state_parent_list,void 0,!1,!1,ne),Y=!0}else{var ie=void 0,ae=void 0;if(!te.dx&&!te.dy)continue;ie=ee.x-te.dx,ae=ee.y-te.dy,te.dx=0,te.dy=0,this.canvas_manager.translate_element(ee,{x:ee.x,y:ee.y},{x:ie,y:ae},this.graph,this.sdfg_list,this.state_parent_list,void 0,!1,!1,void 0),Y=!0}ee instanceof EntryNode&&(te.scope_dx=0,te.scope_dy=0,ee.data.node.attributes.is_collapsed||(X=!0))}}}catch(e){Q.e(e)}finally{Q.f()}X&&this.relayout(),this.draw_async(),Y&&this.send_new_sdfg_to_vscode()}else"add"==this.mouse_mode&&this.panmode_btn.onclick();var oe=t(e),se=n(e);if(this.external_mouse_handler&&(a|=this.external_mouse_handler(i,e,{x:oe,y:se},P,this,this.selected_elements,q)),null!==this.overlay_manager&&(a|=this.overlay_manager.on_mouse_event(i,e,{x:oe,y:se},P,R,q)),a&&this.draw_async(),o)try{vscode&&vscode_handle_event("on_renderer_selection_changed",{multi_selection_changed:s})}catch(e){}return!1}}]),e}();function P(e,t,n,r,i){var a=4*LINEHEIGHT,c=new(o().graphlib.Graph);c.setGraph({}),c.setDefaultEdgeLabel((function(e,t){return{}})),t.nodes.forEach((function(f){var h={};h.label=f.id;var v=null;f.attributes.is_collapsed?(h.width=e.measureText(h.label).width,h.height=LINEHEIGHT):(v=function(e,t,n,r,i,a){var c=new(o().graphlib.Graph)({multigraph:!0}),f={ranksep:30};t.nodes.length>=1e3&&(f.ranker="longest-path"),c.setGraph(f),c.setDefaultEdgeLabel((function(e,t){return{}}));var h=t.scope_dict[-1];void 0===h&&(h=Object.keys(t.nodes));var v=new Set,y=new Map;function g(o){if(a&&"AccessNode"==o.type)y.set(o.id.toString(),{node:o,src:null,dsts:[]});else{var s=null;o.attributes.layout={},o.attributes.layout.in_connectors=o.attributes.in_connectors,"is_collapsed"in o.attributes&&o.attributes.is_collapsed&&"NestedSDFG"!==o.type?o.attributes.layout.out_connectors=(0,u.GS)(t.nodes,o).attributes.out_connectors:o.attributes.layout.out_connectors=o.attributes.out_connectors;var l=function(e,t,n){var r=n.measureText(t.label).width,i=2*LINEHEIGHT*Object.keys(t.attributes.layout.in_connectors).length-LINEHEIGHT,a=2*LINEHEIGHT*Object.keys(t.attributes.layout.out_connectors).length-LINEHEIGHT,o=Math.max(r,i,a),s=2*LINEHEIGHT,u={width:o,height:s+=4*LINEHEIGHT};return"AccessNode"===t.type?(u.height-=4*LINEHEIGHT,u.width+=u.height):t.type.endsWith("Entry")||t.type.endsWith("Exit")?(u.width+=2*u.height,u.height/=1.75):"Tasklet"===t.type||"LibraryNode"===t.type?(u.width+=u.height/3*2,u.height/=1.75):"Reduce"===t.type&&(u.height-=4*LINEHEIGHT,u.width*=2,u.height=u.width/3),u}(0,o,e);if(o.attributes.layout.width=l.width,o.attributes.layout.height=l.height,o.attributes.layout.label=o.label,"NestedSDFG"===o.type){var f=p(s=P(e,o.attributes.sdfg,r,i,a));o.attributes.layout.width=f.width+2*LINEHEIGHT,o.attributes.layout.height=f.height+2*LINEHEIGHT}var h=new d.LF[o.type]({node:o,graph:s},o.id,n,t.id);"NestedSDFG"===o.type&&(i[o.attributes.sdfg.sdfg_list_id]=h);var m,_=0,b=A(Array.isArray(o.attributes.layout.in_connectors)?o.attributes.layout.in_connectors:Object.keys(o.attributes.layout.in_connectors));try{for(b.s();!(m=b.n()).done;){var x=m.value,w=new d.wR({name:x},_,n,o.id);h.in_connectors.push(w),_+=1}}catch(e){b.e(e)}finally{b.f()}_=0;var E,N=A(Array.isArray(o.attributes.layout.out_connectors)?o.attributes.layout.out_connectors:Object.keys(o.attributes.layout.out_connectors));try{for(N.s();!(E=N.n()).done;){var S=E.value,M=new d.wR({name:S},_,n,o.id);h.out_connectors.push(M),_+=1}}catch(e){N.e(e)}finally{N.f()}if(c.setNode(o.id,h),v.add(o.id.toString()),o.id in t.scope_dict){if(o.attributes.is_collapsed)return;t.scope_dict[o.id].forEach((function(e){g(t.nodes[e])}))}}}return h.forEach((function(e){g(t.nodes[e])})),t.edges.forEach((function(e,r){if(!function(e){var t=y.get(e.src),n=y.get(e.dst);if(t&&n)t.dsts=n.dsts,e.attributes.data.attributes.shortcut=!1;else{if(t)return t.dsts.push(e),e.attributes.data.attributes.shortcut=!1,!0;if(n)return n.src=e,e.attributes.data.attributes.shortcut=!1,!0}return!(a||!e.attributes.data.attributes.shortcut)}(e)&&(e=(0,u.RI)(e,v,t))){var i=new d.kS(e.attributes.data,r,n,t.id);e.attributes.data.edge=i,i.src_connector=e.src_connector,i.dst_connector=e.dst_connector,c.setEdge(e.src,e.dst,i,r)}})),y.forEach((function(e){e.src&&e.dsts.forEach((function(r){var i=r.attributes.data.edge;r.attributes.data.edge=null;var a=(0,l.p$)(r);r.attributes.data.edge=i,a.src=e.src.src,a.src_connector=e.src.src_connector,a.dst_connector=r.dst_connector,a.attributes.data.attributes.shortcut=!0;var o=(0,u.RI)(a,v,t);if(o){var s,f=A(c.outEdges(o.src));try{for(f.s();!(s=f.n()).done;){var p=s.value;if(p.w==r.dst&&t.edges[p.name].dst_connector==r.dst_connector)return}}catch(e){f.e(e)}finally{f.f()}t.edges.push(a);var h=t.edges.length-1,m=new d.kS((0,l.p$)(o.attributes.data),h,n,t.id);m.src_connector=o.src_connector,m.dst_connector=o.dst_connector,m.data.attributes.shortcut=!0,c.setEdge(o.src,o.dst,m,h)}}))})),o().layout(c),t.nodes.forEach((function(e,t){var n=c.node(t);if(n&&!(a&&n instanceof AccessNode)){var r=n.topleft();"NestedSDFG"===e.type&&(0,d.LC)(e.attributes.sdfg,n.data.graph,{x:r.x+LINEHEIGHT,y:r.y+LINEHEIGHT});var i,o=LINEHEIGHT,s=(LINEHEIGHT+o)*Object.keys(e.attributes.layout.in_connectors).length-o,u=(LINEHEIGHT+o)*Object.keys(e.attributes.layout.out_connectors).length-o,l=n.x-s/2+LINEHEIGHT/2,f=n.x-u/2+LINEHEIGHT/2,p=A(n.in_connectors);try{for(p.s();!(i=p.n()).done;){var h=i.value;h.width=LINEHEIGHT,h.height=LINEHEIGHT,h.x=l,l+=LINEHEIGHT+o,h.y=r.y}}catch(e){p.e(e)}finally{p.f()}var m,v=A(n.out_connectors);try{for(v.s();!(m=v.n()).done;){var y=m.value;y.width=LINEHEIGHT,y.height=LINEHEIGHT,y.x=f,f+=LINEHEIGHT+o,y.y=r.y+n.height}}catch(e){v.e(e)}finally{v.f()}}})),t.edges.forEach((function(e,n){if(e=(0,u.RI)(e,v,t)){var r=c.edge(e.src,e.dst,n);if(!(!r||a&&!1===r.data.attributes.shortcut||!a&&r.data.attributes.shortcut)){var i=null,o=null;if(e.src_connector){for(var l=c.node(e.src),f=-1,d=0;d<l.out_connectors.length;d++)if(l.out_connectors[d].data.name==e.src_connector){f=d;break}f>=0&&(r.points[0].x=l.out_connectors[f].x,r.points[0].y=l.out_connectors[f].y,i=l.out_connectors[f])}if(e.dst_connector){for(var p=c.node(e.dst),h=-1,y=0;y<p.in_connectors.length;y++)if(p.in_connectors[y].data.name==e.dst_connector){h=y;break}h>=0&&(r.points[r.points.length-1].x=p.in_connectors[h].x,r.points[r.points.length-1].y=p.in_connectors[h].y,o=p.in_connectors[h])}var g=r.points.length-1;null!==i&&(r.points[0]=(0,s.intersectRect)(i,r.points[g])),null!==o&&(r.points[g]=(0,s.intersectRect)(o,r.points[0])),3==r.points.length&&r.points[0].x==r.points[g].x&&(r.points=[r.points[0],r.points[g]]);var _=m(r);_.x+=_.width/2,_.y+=_.height/2,e.width=_.width,e.height=_.height,e.x=_.x,e.y=_.y,r.width=_.width,r.height=_.height,r.x=_.x,r.y=_.y}}})),c}(e,f,t,n,r,i),h=p(v)),h.width+=2*a,h.height+=2*a,c.setNode(f.id,new State({state:f,layout:h,graph:v},f.id,t))})),t.edges.forEach((function(e,n){c.setEdge(e.src,e.dst,new d.kS(e.attributes.data,n,t))})),o().layout(c),t.nodes.forEach((function(e){var t=c.node(e.id);e.attributes.layout={},e.attributes.layout.x=t.x,e.attributes.layout.y=t.y,e.attributes.layout.width=t.width,e.attributes.layout.height=t.height})),t.edges.forEach((function(e){var t=c.edge(e.src,e.dst),n=m(t);n.x+=n.width/2,n.y+=n.height/2,t.x=n.x,t.y=n.y,t.width=n.width,t.height=n.height,e.attributes.layout={},e.attributes.layout.width=n.width,e.attributes.layout.height=n.height,e.attributes.layout.x=n.x,e.attributes.layout.y=n.y,e.attributes.layout.points=t.points})),t.nodes.forEach((function(e,t){if(!e.attributes.is_collapsed){var n=c.node(t),r=n.topleft();(0,d.hY)(e,n,{x:r.x+a,y:r.y+a})}}));var f=p(c);return c.width=f.width,c.height=f.height,n[t.sdfg_list_id]=c,c}},5994:(e,t,n)=>{"use strict";n.d(t,{ZM:()=>h,zO:()=>m,kS:()=>v,wR:()=>y,u7:()=>E,gE:()=>A,tl:()=>T,LC:()=>I,hY:()=>D,jD:()=>z,LF:()=>F});var r=n(6213),i=n(379),a=n(6070),o=n(7608),s=n(6610),u=n(5991),l=n(9590),c=n(6310);function f(e){var t=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}();return function(){var n,r=(0,o.Z)(e);if(t){var i=(0,o.Z)(this).constructor;n=Reflect.construct(r,arguments,i)}else n=r.apply(this,arguments);return(0,a.Z)(this,n)}}var d=function(){function e(t,n,r){var i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null;(0,s.Z)(this,e),this.data=t,this.id=n,this.parent_id=i,this.sdfg=r,this.in_connectors=[],this.out_connectors=[],this.selected=!1,this.highlighted=!1,this.hovered=!1,this.set_layout()}return(0,u.Z)(e,[{key:"set_layout",value:function(){this.width=this.data.layout.width,this.height=this.data.layout.height}},{key:"draw",value:function(e,t,n){}},{key:"shade",value:function(e,t,n){}},{key:"debug_draw",value:function(e,t){e.debug_draw&&(t.beginPath(),t.arc(this.x,this.y,1,0,2*Math.PI,!1),t.fillStyle="red",t.fill(),t.strokeStyle="red",t.stroke(),t.strokeRect(this.x-this.width/2,this.y-this.height/2,this.width,this.height))}},{key:"attributes",value:function(){return this.data.attributes}},{key:"type",value:function(){return this.data.type}},{key:"label",value:function(){return this.data.label}},{key:"long_label",value:function(){return this.label()}},{key:"tooltip",value:function(e){e.className="sdfvtooltip"}},{key:"topleft",value:function(){return{x:this.x-this.width/2,y:this.y-this.height/2}}},{key:"strokeStyle",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0;return this.selected?this.hovered?this.getCssProperty(e,"--color-selected-hovered"):this.highlighted?this.getCssProperty(e,"--color-selected-highlighted"):this.getCssProperty(e,"--color-selected"):this.hovered?this.getCssProperty(e,"--color-hovered"):this.highlighted?this.getCssProperty(e,"--color-highlighted"):this.getCssProperty(e,"--color-default")}},{key:"intersect",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0,r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;return 0==n||0==r?e>=this.x-this.width/2&&e<=this.x+this.width/2&&t>=this.y-this.height/2&&t<=this.y+this.height/2:e<=this.x+this.width/2&&e+n>=this.x-this.width/2&&t<=this.y+this.height/2&&t+r>=this.y-this.height/2}},{key:"contained_in",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0,r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;if(0===n||0===r)return!1;var i=e,a=e+n,o=t,s=t+r,u=this.x-this.width/2,l=this.x+this.width/2,c=this.y-this.height/2,f=this.y+this.height/2;return i<=u&&a>=l&&o<=c&&s>=f}},{key:"getCssProperty",value:function(e,t){return window.getComputedStyle(e.canvas).getPropertyValue(t).trim()}}]),e}(),p=function(e){(0,i.Z)(n,e);var t=f(n);function n(e){return(0,s.Z)(this,n),t.call(this,e,-1,e)}return(0,u.Z)(n,[{key:"set_layout",value:function(){}},{key:"label",value:function(){return this.data.attributes.name}}]),n}(d),h=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,n){var r=this.topleft(),i=e.visible_rect,a={x:Math.max(r.x,i.x),y:Math.max(r.y,i.y),x2:Math.min(r.x+this.width,i.x+i.w),y2:Math.min(r.y+this.height,i.y+i.h)};a.w=a.x2-a.x,a.h=a.y2-a.y,t.lod||(a={x:r.x,y:r.y,w:this.width,h:this.height}),t.fillStyle=this.getCssProperty(e,"--state-background-color"),t.fillRect(a.x,a.y,a.w,a.h),t.fillStyle=this.getCssProperty(e,"--state-foreground-color"),i.x<=r.x&&i.y<=r.y+LINEHEIGHT&&t.fillText(this.label(),r.x,r.y+LINEHEIGHT),!(this.selected||this.highlighted||this.hovered)||a.x!==r.x&&a.y!==r.y&&a.x2!==r.x+this.width&&a.y2!==r.y+this.height||(t.strokeStyle=this.strokeStyle(e),t.strokeRect(a.x,a.y,a.w,a.h)),this.data.state.attributes.is_collapsed&&(t.beginPath(),t.moveTo(this.x,this.y-LINEHEIGHT),t.lineTo(this.x,this.y+LINEHEIGHT),t.stroke(),t.beginPath(),t.moveTo(this.x-LINEHEIGHT,this.y),t.lineTo(this.x+LINEHEIGHT,this.y),t.stroke()),t.strokeStyle="black"}},{key:"simple_draw",value:function(e,t,n){var r=this,i=this.topleft();t.fillStyle=this.getCssProperty(e,"--state-background-color"),t.fillRect(i.x,i.y,this.width,this.height),t.fillStyle=this.getCssProperty(e,"--state-text-color"),n&&this.intersect(n.x,n.y)&&(e.tooltip=function(e){return r.tooltip(e)})}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=r,t.fillStyle=n;var o=this.topleft();t.fillRect(o.x,o.y,this.width,this.height),t.fillStyle=i,t.globalAlpha=a}},{key:"tooltip",value:function(e){e.innerText="State: "+this.label()}},{key:"attributes",value:function(){return this.data.state.attributes}},{key:"label",value:function(){return this.data.state.label}},{key:"type",value:function(){return this.data.state.type}}]),n}(d),m=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"--node-foreground-color",i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:"--node-background-color",a=this.topleft();t.fillStyle=this.getCssProperty(e,i),t.fillRect(a.x,a.y,this.width,this.height),t.strokeStyle=this.strokeStyle(e),t.strokeRect(a.x,a.y,this.width,this.height),t.fillStyle=this.getCssProperty(e,r);var o=t.measureText(this.label()).width;t.fillText(this.label(),this.x-o/2,this.y+LINEHEIGHT/4)}},{key:"simple_draw",value:function(e,t,n){var r=this.topleft();t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.fillRect(r.x,r.y,this.width,this.height),t.fillStyle=this.getCssProperty(e,"--node-foreground-color")}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=r,t.fillStyle=n;var o=this.topleft();t.fillRect(o.x,o.y,this.width,this.height),t.fillStyle=i,t.globalAlpha=a}},{key:"label",value:function(){return this.data.node.label}},{key:"attributes",value:function(){return this.data.node.attributes}},{key:"type",value:function(){return this.data.node.type}},{key:"set_layout",value:function(){this.width=this.data.node.attributes.layout.width,this.height=this.data.node.attributes.layout.height}}]),n}(d),v=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"create_arrow_line",value:function(e){if(e.beginPath(),e.moveTo(this.points[0].x,this.points[0].y),2===this.points.length)e.lineTo(this.points[1].x,this.points[1].y);else{var t;for(t=1;t<this.points.length-2;t++){var n=(this.points[t].x+this.points[t+1].x)/2,r=(this.points[t].y+this.points[t+1].y)/2;e.quadraticCurveTo(this.points[t].x,this.points[t].y,n,r)}e.quadraticCurveTo(this.points[t].x,this.points[t].y,this.points[t+1].x,this.points[t+1].y)}}},{key:"draw",value:function(e,t,n){var r=this,i=this;this.create_arrow_line(t);var a=this.strokeStyle(e);if(this.hovered&&(e.tooltip=function(t){return r.tooltip(t,e)}),null==this.parent_id&&a===this.getCssProperty(e,"--color-default")&&(a=this.getCssProperty(e,"--interstate-edge-color")),t.fillStyle=t.strokeStyle=a,null!=this.parent_id&&null!=this.data.attributes.wcr?t.setLineDash([2,2]):t.setLineDash([1,0]),t.stroke(),t.setLineDash([1,0]),!(i.points.length<2)){var o;if(this.selected&&"move"===e.mouse_mode)for(o=1;o<this.points.length-1;o++)t.strokeRect(this.points[o].x-5,this.points[o].y-5,8,8);B(t,i.points[i.points.length-2],i.points[i.points.length-1],3)}}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6";this.create_arrow_line(t);var i=t.strokeStyle,a=t.fillStyle,o=t.lineCap,s=t.lineWidth,u=t.globalAlpha;t.globalAlpha=r,t.lineWidth=s+1,t.fillStyle=n,t.strokeStyle=n,t.lineCap="round",t.stroke(),this.points.length<2||(B(t,this.points[this.points.length-2],this.points[this.points.length-1],3,0,2),t.strokeStyle=i,t.fillStyle=a,t.lineCap=o,t.lineWidth=s,t.globalAlpha=u)}},{key:"tooltip",value:function(e,t){(0,r.Z)((0,o.Z)(n.prototype),"tooltip",this).call(this,e);var i=t.view_settings(),a=this.attributes();if(void 0!==a.subset){if(null===a.subset)return void(e.style.display="none");var s=a.data;s+=(0,l.Ev)(a.subset,i),a.other_subset&&(s+=" -> "+(0,l.Ev)(a.other_subset,i)),a.wcr&&(s+="<br /><b>CR: "+(0,l.Ev)(a.wcr,i)+"</b>");var u=null;u=a.volume?(0,l.Ev)(a.volume,i):(0,l.Ev)(a.num_accesses,i),a.dynamic?u=0==u||-1==u?"<b>Dynamic (unbounded)</b>":"<b>Dynamic</b> (up to "+u+")":-1==u&&(u="<b>Dynamic (unbounded)</b>"),s+='<br /><font style="font-size: 14px">Volume: '+u+"</font>",e.innerHTML=s}else e.classList.add("sdfvtooltip--interstate-edge"),e.innerText=this.label(),this.label()||(e.style.display="none")}},{key:"set_layout",value:function(){}},{key:"label",value:function(){return void 0!==this.data.attributes.subset?"":(0,r.Z)((0,o.Z)(n.prototype),"label",this).call(this)}},{key:"intersect",value:function(e,t){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0,a=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;if(!(0,r.Z)((0,o.Z)(n.prototype),"intersect",this).call(this,e,t,i,a))return!1;if(0==i||0==a){for(var s=0;s<this.points.length-1;s++){var u=q({x:e,y:t},this.points[s],this.points[s+1]);if(u<=5)return!0}return!1}return!0}}]),n}(d),y=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,n){var r,i=this,a=this.data.name.startsWith("IN_")||this.data.name.startsWith("OUT_"),o=this.topleft();if(t.beginPath(),L(t,o.x,o.y,this.width,this.height),t.closePath(),t.strokeStyle=this.strokeStyle(e),a){var s=this.data.name;s=s.startsWith("IN_")?s.substring(3):s.substring(4),t.lineWidth=.4,t.stroke(),t.lineWidth=1,r=this.getCssProperty(e,"--connector-scoped-color")}else t.stroke(),r=this.getCssProperty(e,"--connector-unscoped-color");t.pdf&&(r=r.substr(0,7)),t.fillStyle=r,t.pdf&&(t.beginPath(),L(t,o.x,o.y,this.width,this.height),t.closePath()),t.fill(),this.strokeStyle(e)!==this.getCssProperty(e,"--color-default")&&(e.tooltip=function(e){return i.tooltip(e)})}},{key:"attributes",value:function(){return{}}},{key:"set_layout",value:function(){}},{key:"label",value:function(){return this.data.name}},{key:"tooltip",value:function(e){(0,r.Z)((0,o.Z)(n.prototype),"tooltip",this).call(this,e),e.classList.add("sdfvtooltip--connector"),e.innerText=this.label()}}]),n}(d),g=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,n){var r=this.topleft();t.beginPath(),L(t,r.x,r.y,this.width,this.height),t.closePath(),t.strokeStyle=this.strokeStyle(e);var i=this.sdfg.attributes._arrays[this.data.node.attributes.data];i&&"Stream"===i.type?t.setLineDash([5,3]):t.setLineDash([1,0]),i&&!1===i.attributes.transient?t.lineWidth=3:t.lineWidth=1,t.stroke(),t.lineWidth=1,t.setLineDash([1,0]),i&&"View"===i.type?t.fillStyle=this.getCssProperty(e,"--connector-unscoped-color"):t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&(t.beginPath(),L(t,r.x,r.y,this.width,this.height),t.closePath()),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var a=t.measureText(this.label());t.fillText(this.label(),this.x-a.width/2,this.y+LINEHEIGHT/4)}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=r,t.fillStyle=n;var o=this.topleft();t.beginPath(),L(t,o.x,o.y,this.width,this.height),t.closePath(),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),n}(m),_=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,n){var r,i=this;r=this.data.node.attributes.is_collapsed?function(){return j(t,i.x,i.y,i.width,i.height)}:function(){return U(t,i.topleft(),i,i.scopeend())},t.strokeStyle=this.strokeStyle(e),this.data.node.type.startsWith("Consume")?t.setLineDash([5,3]):t.setLineDash([1,0]),r(),t.stroke(),t.setLineDash([1,0]),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&r(),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var a=this.far_label();P(t,e,a,this.close_label(e),this.x,this.y,this.width,this.height,SCOPE_LOD)}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=r,t.fillStyle=n,this.data.node.attributes.is_collapsed?j(t,this.x,this.y,this.width,this.height):U(t,this.topleft(),this,this.scopeend()),t.fill(),t.fillStyle=i,t.globalAlpha=a}},{key:"far_label",value:function(){var e=this.attributes().label;if(this.scopeend()){var t=this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];if(void 0!==t)e=t.attributes.label;else{var n=(e=this.data.node.label).indexOf("[");n>0&&(e=e.substring(0,n))}}return e}},{key:"close_label",value:function(e){if(!e.inclusive_ranges)return this.label();var t=this.far_label(),n=this.attributes();if(this.scopeend()){var r=this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];if(void 0===r)return this.label();n=r.attributes}if(t+=" [",this instanceof N||this instanceof S)t+=n.pe_index+"=0.."+(n.num_pes-1).toString();else{for(var i=0;i<n.params.length;++i)t+=n.params[i]+"=",t+=(0,l.Pn)(n.range.ranges[i],e.view_settings())+", ";t=t.substring(0,t.length-2)}return t+"]"}}]),n}(m),b=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"scopeend",value:function(){return!1}}]),n}(_),x=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"scopeend",value:function(){return!0}}]),n}(_),w=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"stroketype",value:function(e){e.setLineDash([1,0])}}]),n}(b),E=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"stroketype",value:function(e){e.setLineDash([1,0])}}]),n}(x),N=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"stroketype",value:function(e){e.setLineDash([5,3])}}]),n}(b),S=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"stroketype",value:function(e){e.setLineDash([5,3])}}]),n}(x),M=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"stroketype",value:function(e){e.setLineDash([10,3])}}]),n}(b),k=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"stroketype",value:function(e){e.setLineDash([10,3])}}]),n}(x),O=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,n){var r=this.topleft();R(t,r,this.width,this.height),t.strokeStyle=this.strokeStyle(e),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&R(t,r,this.width,this.height),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var i=e.canvas_manager.points_per_pixel();if(!t.lod||i<TASKLET_LOD){for(var a=this.attributes().code.string_data.split("\n"),o=0,s=0,u=0;u<a.length;u++)a[u].length>s&&(o=u,s=a[u].length);var l=t.font;t.font="10px courier new";var c=t.measureText(a[o]),f=a.length*LINEHEIGHT*1.05,d=c.width,p=f/(.5*this.height),h=d/(.9*this.width),m=Math.min(10/p,10/h),v=m/4;t.font=m+"px courier new";for(var y=this.y+v-(a.length-1)/2*m*1.05,g=0;g<a.length;g++)t.fillText(a[g],this.x-.9*this.width/2,y+g*m*1.05);t.font=l}else{var _=t.measureText(this.label());t.fillText(this.label(),this.x-_.width/2,this.y+LINEHEIGHT/2)}}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=r,t.fillStyle=n,R(t,this.topleft(),this.width,this.height),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),n}(m),C=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,n){var r=this,i=this.topleft(),a=function(){t.beginPath(),t.moveTo(i.x,i.y),t.lineTo(i.x+r.width/2,i.y+r.height),t.lineTo(i.x+r.width,i.y),t.lineTo(i.x,i.y),t.closePath()};t.strokeStyle=this.strokeStyle(e),a(),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&a(),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var o=this.label().substring(4,this.label().indexOf(","));P(t,e,o,this.label(),this.x,this.y-.2*this.height,this.width,this.height,SCOPE_LOD)}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=r,t.fillStyle=n;var o=this.topleft();t.beginPath(),t.moveTo(o.x,o.y),t.lineTo(o.x+this.width/2,o.y+this.height),t.lineTo(o.x+this.width,o.y),t.lineTo(o.x,o.y),t.closePath(),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),n}(m),A=function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"draw",value:function(e,t,i){if(this.data.node.attributes.is_collapsed){var a=this.topleft();R(t,a,this.width,this.height),t.strokeStyle=this.strokeStyle(e),t.stroke(),R(t,{x:a.x+2.5,y:a.y+2.5},this.width-5,this.height-5),t.strokeStyle=this.strokeStyle(e),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&R(t,{x:a.x+2.5,y:a.y+2.5},this.width-5,this.height-5),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var s=this.data.node.attributes.label,u=t.measureText(s);t.fillText(s,this.x-u.width/2,this.y+LINEHEIGHT/4)}else(0,r.Z)((0,o.Z)(n.prototype),"draw",this).call(this,e,t,i,"--nested-sdfg-foreground-color","--nested-sdfg-background-color"),T(e,t,this.data.graph,i)}},{key:"shade",value:function(e,t,i){var a=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6";if(this.data.node.attributes.is_collapsed){var s=t.fillStyle,u=t.globalAlpha;t.globalAlpha=a,t.fillStyle=i,R(t,this.topleft(),this.width,this.height),t.fill(),t.fillStyle=s,t.globalAlpha=u}else(0,r.Z)((0,o.Z)(n.prototype),"shade",this).call(this,e,t,i,a)}},{key:"set_layout",value:function(){if(this.data.node.attributes.is_collapsed){var e=this.data.node.attributes.label.length*LINEHEIGHT*.8,t=2*LINEHEIGHT*Object.keys(this.data.node.attributes.in_connectors).length-LINEHEIGHT,n=2*LINEHEIGHT*Object.keys(this.data.node.attributes.out_connectors).length-LINEHEIGHT,r=Math.max(e,t,n),i=2*LINEHEIGHT,a={width:r,height:i+=4*LINEHEIGHT};a.width+=a.height/3*2,a.height/=1.75,this.width=a.width,this.height=a.height}else this.width=this.data.node.attributes.layout.width,this.height=this.data.node.attributes.layout.height}},{key:"label",value:function(){return""}}]),n}(m);function T(e,t,n,r){var i=e.canvas_manager.points_per_pixel(),a=n;(!t.lod||i<EDGE_LOD)&&a.edges().forEach((function(n){var i=a.edge(n);i.draw(e,t,r),i.debug_draw(e,t)}));var o=e.visible_rect;a.nodes().forEach((function(n){var s=a.node(n);if(t.lod&&(i>=STATE_LOD||s.width/i<STATE_LOD))return s.simple_draw(e,t,r),void s.debug_draw(e,t);if(!t.lod||s.intersect(o.x,o.y,o.w,o.h)){s.draw(e,t,r),s.debug_draw(e,t);var u=s.data.graph;if(!s.data.state.attributes.is_collapsed&&u){if(u.nodes().forEach((function(n){var a=u.node(n);if(!t.lod||a.intersect(o.x,o.y,o.w,o.h)){if(t.lod&&i>=NODE_LOD)return a.simple_draw(e,t,r),void a.debug_draw(e,t);a.draw(e,t,r),a.debug_draw(e,t),a.in_connectors.forEach((function(n){n.draw(e,t,r),n.debug_draw(e,t)})),a.out_connectors.forEach((function(n){n.draw(e,t,r),n.debug_draw(e,t)}))}})),t.lod&&i>=EDGE_LOD)return;u.edges().forEach((function(n){var i=u.edge(n);t.lod&&!i.intersect(o.x,o.y,o.w,o.h)||(i.draw(e,t,r),i.debug_draw(e,t))}))}}}))}function I(e,t,n){e.nodes.forEach((function(e,r){var i=t.node(r);i.x+=n.x,i.y+=n.y,e.attributes.is_collapsed||D(e,i,n)})),e.edges.forEach((function(e,r){var i=t.edge(e.src,e.dst);i.x+=n.x,i.y+=n.y,i.points.forEach((function(e){e.x+=n.x,e.y+=n.y}))}))}function D(e,t,n){var r=new Set;e.nodes.forEach((function(e,i){var a=t.data.graph.node(i);a&&(r.add(i.toString()),a.x+=n.x,a.y+=n.y,a.in_connectors.forEach((function(e){e.x+=n.x,e.y+=n.y})),a.out_connectors.forEach((function(e){e.x+=n.x,e.y+=n.y})),"NestedSDFG"===a.data.node.type&&I(a.data.node.attributes.sdfg,a.data.graph,n))})),e.edges.forEach((function(i,a){if(i=(0,c.RI)(i,r,e)){var o=t.data.graph.edge(i.src,i.dst,a);o&&(o.x+=n.x,o.y+=n.y,o.points.forEach((function(e){e.x+=n.x,e.y+=n.y})))}}))}function P(e,t,n,r,i,a,o,s,u){var l=arguments.length>9&&void 0!==arguments[9]?arguments[9]:50,c=arguments.length>10&&void 0!==arguments[10]?arguments[10]:16,f=t.canvas_manager.points_per_pixel(),d=r,p=Math.min(f*c,l),h=LINEHEIGHT/2,m=e.font;e.lod&&f>=u&&(e.font=p+"px sans-serif",d=n,h=p/2-s/6);var v=e.measureText(d),y=v.width;e.lod&&f>=u&&y>o&&(p/=y/o,e.font=p+"px sans-serif",h=p/2-s/6,y=o),e.fillText(d,i-y/2,a+h),e.lod&&f>=u&&(e.font=m)}function j(e,t,n,r,i,a){var o={x:t-r/2,y:n-i/2},s=i/3;e.beginPath(),e.moveTo(o.x,n),e.lineTo(o.x+s,o.y),e.lineTo(o.x+r-s,o.y),e.lineTo(o.x+r,n),e.lineTo(o.x+r-s,o.y+i),e.lineTo(o.x+s,o.y+i),e.lineTo(o.x,n),e.closePath()}function R(e,t,n,r){var i=r/3;e.beginPath(),e.moveTo(t.x,t.y+i),e.lineTo(t.x+i,t.y),e.lineTo(t.x+n-i,t.y),e.lineTo(t.x+n,t.y+i),e.lineTo(t.x+n,t.y+2*i),e.lineTo(t.x+n-i,t.y+r),e.lineTo(t.x+i,t.y+r),e.lineTo(t.x,t.y+2*i),e.lineTo(t.x,t.y+1*i),e.closePath()}function L(e,t,n,r,i){var a=.5522848,o=r/2*a,s=i/2*a,u=t+r,l=n+i,c=t+r/2,f=n+i/2;e.moveTo(t,f),e.bezierCurveTo(t,f-s,c-o,n,c,n),e.bezierCurveTo(c+o,n,u,f-s,u,f),e.bezierCurveTo(u,f+s,c+o,l,c,l),e.bezierCurveTo(c-o,l,t,f+s,t,f)}function B(e,t,n,r){var i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:0,a=arguments.length>5&&void 0!==arguments[5]?arguments[5]:0;e.save();var o=n.x-t.x,s=n.y-t.y;e.translate(n.x,n.y),e.rotate(Math.atan2(s,o)),e.beginPath(),e.moveTo(0+a+i,0),e.lineTo(-2*r-a-i,-(r+a)),e.lineTo(-2*r-a-i,r+a),e.closePath(),e.fill(),e.restore()}function U(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]&&arguments[3];e.beginPath(),r?(e.moveTo(t.x,t.y),e.lineTo(t.x+n.width,t.y),e.lineTo(t.x+n.width-n.height,t.y+n.height),e.lineTo(t.x+n.height,t.y+n.height),e.lineTo(t.x,t.y)):(e.moveTo(t.x,t.y+n.height),e.lineTo(t.x+n.width,t.y+n.height),e.lineTo(t.x+n.width-n.height,t.y),e.lineTo(t.x+n.height,t.y),e.lineTo(t.x,t.y+n.height)),e.closePath()}function q(e,t,n){var r=n.x-t.x,i=n.y-t.y,a=i*e.x-r*e.y+n.x*t.y-n.y*t.x;return Math.abs(a)/Math.sqrt(i*i+r*r)}function z(e){return e<0&&(e=0),e>1&&(e=1),"hsl("+(120*(1-e)).toString(10)+",100%,50%)"}var F={SDFGElement:d,SDFG:p,State:h,SDFGNode:m,Edge:v,Connector:y,AccessNode:g,ScopeNode:_,EntryNode:b,ExitNode:x,MapEntry:w,MapExit:E,ConsumeEntry:N,ConsumeExit:S,Tasklet:O,Reduce:C,PipelineEntry:M,PipelineExit:k,NestedSDFG:A,LibraryNode:function(e){(0,i.Z)(n,e);var t=f(n);function n(){return(0,s.Z)(this,n),t.apply(this,arguments)}return(0,u.Z)(n,[{key:"_path",value:function(e){var t=this.height/6,n=this.topleft();e.beginPath(),e.moveTo(n.x,n.y),e.lineTo(n.x+this.width-t,n.y),e.lineTo(n.x+this.width,n.y+t),e.lineTo(n.x+this.width,n.y+this.height),e.lineTo(n.x,n.y+this.height),e.closePath()}},{key:"_path2",value:function(e){var t=this.height/6,n=this.topleft();e.beginPath(),e.moveTo(n.x+this.width-t,n.y),e.lineTo(n.x+this.width-t,n.y+t),e.lineTo(n.x+this.width,n.y+t)}},{key:"draw",value:function(e,t,n){t.fillStyle=this.getCssProperty(e,"--node-background-color"),this._path(t),t.fill(),t.strokeStyle=this.strokeStyle(e),this._path(t),t.stroke(),this._path2(t),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var r=t.measureText(this.label()).width;t.fillText(this.label(),this.x-r/2,this.y+LINEHEIGHT/4)}},{key:"shade",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=r,t.fillStyle=n,this._path(t),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),n}(m)};Object.assign(globalThis,F)},6323:(e,t,n)=>{"use strict";n.d(t,{e:()=>$,l:()=>T});var r,i,a=n(2465),o=n(9018),s=n(1538),u=n(8560),l=n(3216),c=n(9590),f=n(4194),d=n(1762);function p(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var h={on_init_menu:function(){var e=document.getElementById("sidebar"),t=document.getElementById("dragbar"),n=function(t){document.selection?document.selection.empty():window.getSelection().removeAllRanges(),e.style.width=Math.max(t.view.innerWidth-t.pageX,20)+"px"};t.addEventListener("mousedown",(function(){document.addEventListener("mousemove",n),document.addEventListener("mouseup",(function(){document.removeEventListener("mousemove",n)}))}))},on_sidebar_set_title:m,on_sidebar_show:y,sidebar_get_contents:v,on_close_menu:function(){document.getElementById("sidebar").style.display="none"},on_outline:function(e,t){m("SDFG Outline");var n=v();n.innerHTML="";var o=document.createElement("div");o.className="context_menu_option",o.innerHTML=(0,d.v)(r||(r=(0,a.Z)(['<i class="material-icons" style="font-size: inherit">filter_center_focus</i> SDFG ',""])),e.sdfg.attributes.name),o.onclick=function(){return e.zoom_to_view()},n.appendChild(o);var s=[n];(0,f.LY)(t,(function(t,n){if(t.type().endsWith("Exit")&&t.data.node.scope_entry>=0)return s.push(null),!0;var r=document.createElement("div");r.className="context_menu_option";var o=t.attributes().is_collapsed;o=void 0!==o&&o;var u=t.type();return t.type().endsWith("Entry")&&void 0!==t.sdfg.nodes[t.parent_id].scope_dict[t.id]&&(u=u.slice(0,-5)),r.innerHTML=(0,d.v)(i||(i=(0,a.Z)([""," ","",""])),u,t.label(),o?" (collapsed)":""),r.onclick=function(r){var i=[t];if(t.type().endsWith("Entry")){var a=t.sdfg.nodes[t.parent_id];if(void 0!==a.scope_dict[t.id]){var o,s=function(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return p(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?p(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}(a.scope_dict[t.id]);try{for(s.s();!(o=s.n()).done;){var u=o.value;i.push(n.node(u))}}catch(e){s.e(e)}finally{s.f()}}}e.zoom_to_view(i),r||(r=window.event),r.cancelBubble=!0,r.stopPropagation&&r.stopPropagation()},s.push(r),!o&&void 0}),(function(e,t){var n=s.pop();n&&s[s.length-1].appendChild(n)})),y()},on_fill_info:function(e){var t=v(),n="";if(e instanceof Edge&&"Memlet"===e.data.type){var r=e.sdfg.nodes[e.parent_id].edges[e.id];n+="<h4>Connectors: "+r.src_connector+" &rarr; "+r.dst_connector+"</h4>"}n+="<hr />";for(var i=0,a=Object.entries(e.attributes());i<a.length;i++){var o=a[i];"layout"===o[0]||"sdfg"===o[0]||"_arrays"===o[0]||o[0].startsWith("_meta_")||"position"==o[0]||(n+="<b>"+o[0]+"</b>:&nbsp;&nbsp;",n+=(0,c.Ev)(o[1],T.daceRenderer.view_settings())+"</p>")}if(e instanceof AccessNode){var s=e.sdfg.attributes._arrays[e.attributes().data];n+="<br /><h4>"+s.type+" properties:</h4>";for(var u=0,l=Object.entries(s.attributes);u<l.length;u++){var f=l[u];"layout"===f[0]||"sdfg"===f[0]||f[0].startsWith("_meta_")||(n+="<b>"+f[0]+"</b>:&nbsp;&nbsp;",n+=(0,c.Ev)(f[1],T.daceRenderer.view_settings())+"</p>")}}t.innerHTML=n}};function m(e){document.getElementById("sidebar-header").innerText=e}function v(){return document.getElementById("sidebar-contents")}function y(){document.getElementById("sidebar").style.display="flex"}var g,_=n(5994),b=n(5096),x=n(6310),w=n(8934),E=n(4707),N=n(1699);function S(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return M(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?M(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function M(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var k,O=globalThis.$,C=null,A=null,T=(0,b._W)(globalThis,{daceRenderer:null,daceUIHandlers:h,daceInitSDFV:D,daceParseSDFG:o.a,daceStringifySDFG:o.n,daceFindInGraph:z,daceSDFGPropertyToString:c.Ev,daceSDFGRangeElemToString:c.Pn,daceGetUUIDGraphElement:x.FK,daceFindGraphElementByUUID:x.sC,daceTraverseSDFGScopes:f.LY,daceSDFGTypeclassToString:c.oi,daceStringToSDFGTypeclass:c.K5,daceSDFGRenderer:u.U,daceSDFGElements:_.LF,daceGenericSDFGOverlay:l.F,daceMemoryVolumeOverlay:E.n,daceRuntimeMicroSecondsOverlay:w.P,daceStaticFlopsOverlay:N.C,daceMouseEvent:F});if(document.currentScript.hasAttribute("data-sdfg-json"))D((0,o.a)(document.currentScript.getAttribute("data-sdfg-json")));else{var I=function(e){var t=window.location.href;e=e.replace(/[\[\]]/g,"\\$&");var n=new RegExp("[?&]"+e+"(=([^&#]*)|&|#|$)").exec(t);return n?n[2]?decodeURIComponent(n[2].replace(/\+/g," ")):"":null}("url");I?function(e){var t=new XMLHttpRequest;t.responseType="text",t.onload=function(){if(200==t.status){var e=(0,o.a)(t.response);T.daceRenderer&&T.daceRenderer.destroy(),D(e)}else alert("Failed to load SDFG from URL"),D(null)},t.onerror=function(){alert("Failed to load SDFG from URL: "+t.status),D(null)},t.open("GET",e+(/\?/.test(e)?"&":"?")+(new Date).getTime(),!0),t.send()}(I):D(null)}function D(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,n=arguments.length>2&&void 0!==arguments[2]&&arguments[2];O("#sdfg-file-input").change((function(e){e.target.files.length<1||(C=e.target.files[0],j())})),O("#menuclose").click((function(){return G()})),O("#reload").click((function(){j()})),O("#instrumentation-report-file-input").change((function(e){e.target.files.length<1||(A=e.target.files[0],L())})),O("#outline").click((function(){T.daceRenderer&&setTimeout((function(){return J(T.daceRenderer,T.daceRenderer.graph)}),1)})),O("#search-btn").click((function(){T.daceRenderer&&setTimeout((function(){z(T.daceRenderer,T.daceRenderer.graph,O("#search").val(),O("#search-case")[0].checked)}),1)})),O("#search").on("keydown",(function(e){"Enter"!=e.key&&13!=e.which||(P(),e.preventDefault())}));var r=null,i=document.getElementById("pan-btn"),a=document.getElementById("move-btn"),o=document.getElementById("select-btn"),s=[];s.push(document.getElementById("elem_map")),s.push(document.getElementById("elem_consume")),s.push(document.getElementById("elem_tasklet")),s.push(document.getElementById("elem_nested_sdfg")),s.push(document.getElementById("elem_access_node")),s.push(document.getElementById("elem_stream")),s.push(document.getElementById("elem_state")),i&&(r={pan:i,move:a,select:o,add_btns:s}),null!==e&&(T.daceRenderer=new u.U(e,document.getElementById("contents"),F,t,n,null,r))}function P(){T.daceRenderer&&setTimeout((function(){z(T.daceRenderer,T.daceRenderer.graph,O("#search").val(),O("#search-case")[0].checked)}),1)}function j(){C&&((k=new FileReader).onload=R,k.readAsText(C))}function R(){var e,t=(0,o.a)(k.result);null===(e=T.daceRenderer)||void 0===e||e.destroy(),T.daceRenderer=new u.U(t,document.getElementById("contents"),F),G()}function L(){A&&((k=new FileReader).onload=B,k.readAsText(A))}function B(){!function(e){var t,n={};if(e.traceEvents&&null!==(t=T.daceRenderer)&&void 0!==t&&t.sdfg){var r,i=S(e.traceEvents);try{for(i.s();!(r=i.n()).done;){var a=r.value;if("X"===a.ph){var o=a.args.sdfg_id+"/";void 0!==a.args.state_id?(o+=a.args.state_id+"/",void 0!==a.args.id?o+=a.args.id+"/-1":o+="-1/-1"):o+="-1/-1/-1",void 0!==n[o]?n[o].push(a.dur):n[o]=[a.dur]}}}catch(e){i.e(e)}finally{i.f()}for(var u in n){var l=n[u],c=U(l),f={min:c[0],max:c[1],mean:(0,s.J69)(l),med:(0,s.C2o)(l),count:l.length};n[u]=f}var d=T.daceRenderer;if(d.overlay_manager){d.overlay_manager.is_overlay_active(w.P)||d.overlay_manager.register_overlay(w.P);var p=d.overlay_manager.get_overlay(w.P);p&&(p.runtime_map=n,p.refresh())}}}(JSON.parse(k.result))}function U(e){var t=-Number.MAX_VALUE,n=Number.MAX_VALUE;return e.forEach((function(e){e>t&&(t=e),e<n&&(n=e)})),[n,t]}function q(e,t,n,r){var i,a=S(e.nodes());try{for(a.s();!(i=a.n()).done;){var o=i.value,s=e.node(o),u=s.label();r||(u=u.toLowerCase()),-1!==u.indexOf(t)&&n.push(s),s.data.graph&&q(s.data.graph,t,n,r)}}catch(e){a.e(e)}finally{a.f()}var l,c=S(e.edges());try{for(c.s();!(l=c.n()).done;){var f=l.value,d=e.edge(f),p=d.label();void 0!==p&&(r||(p=p.toLowerCase()),-1!==p.indexOf(t)&&n.push(d))}}catch(e){c.e(e)}finally{c.f()}}function z(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]&&arguments[3];H('Search Results for "'+n+'"');var i=[];r||(n=n.toLowerCase()),q(t,n,i,r),i.length>0&&e.zoom_to_view(i);var o=W();o.innerHTML="";for(var s=function(){var t=l[u],n=document.createElement("div");n.className="context_menu_option",n.innerHTML=(0,d.v)(g||(g=(0,a.Z)([""," ",""])),t.type(),t.label()),n.onclick=function(){e.zoom_to_view([t])},n.onmouseenter=function(){t.highlighted||(t.highlighted=!0,e.draw_async())},n.onmouseleave=function(){t.highlighted&&(t.highlighted=!1,e.draw_async())},o.appendChild(n)},u=0,l=i;u<l.length;u++)s();Z()}function F(e,t,n,r,i,a,o){var s;("click"===e&&!o||"dblclick"===e)&&(i.menu&&i.menu.destroy(),null!==(s=0===a.length?new SDFG(i.sdfg):1===a.length?a[0]:null)?(H(s.type()+" "+s.label()),$(s)):(G(),H("Multiple elements selected")),Z())}function H(e){return T.daceUIHandlers.on_sidebar_set_title(e)}function Z(){return T.daceUIHandlers.on_sidebar_show()}function W(){return T.daceUIHandlers.sidebar_get_contents()}function G(){return T.daceUIHandlers.on_close_menu()}function J(e,t){return T.daceUIHandlers.on_outline(e,t)}function $(e){return T.daceUIHandlers.on_fill_info(e)}O("document").ready((function(){T.daceUIHandlers.on_init_menu()}))},3371:(e,t,n)=>{"use strict";n.d(t,{x:()=>d});var r,i=n(2465),a=n(7329),o=n(6610),s=n(5991),u=n(1762);function l(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return c(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?c(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){s=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(s)throw a}}}}function c(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var f=globalThis.$,d=function(){function e(){var t=this,n=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null;(0,o.Z)(this,e),this._html_content=n,this._click_close_handlers=[],this._=setTimeout((function(){t._click_close_handlers=[["click",function(e){t.destroy()}],["contextmenu",function(e){t.destroy()}]];var e,n=l(t._click_close_handlers);try{for(n.s();!(e=n.n()).done;){var r,i=e.value;(r=window).addEventListener.apply(r,(0,a.Z)(i))}}catch(e){n.e(e)}finally{n.f()}}),30),this._options=[],this._cmenu_elem=null}return(0,s.Z)(e,[{key:"width",value:function(){return this._cmenu_elem.offsetWidth}},{key:"visible",value:function(){return null!=this._cmenu_elem}},{key:"addOption",value:function(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;this._options.push({name:e,func:t,onhover:n})}},{key:"addCheckableOption",value:function(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null;this._options.push({name:e,checkbox:!0,checked:t,func:n,onhover:r})}},{key:"destroy",value:function(){if(this._cmenu_elem){document.body.removeChild(this._cmenu_elem);var e,t=l(this._click_close_handlers);try{for(t.s();!(e=t.n()).done;){var n,r=e.value;(n=window).removeEventListener.apply(n,(0,a.Z)(r))}}catch(e){t.e(e)}finally{t.f()}this._cmenu_elem=null}}},{key:"show",value:function(e,t){var n=document.createElement("div");if(n.id="contextmenu",f(n).css("left",e+"px"),f(n).css("top",t+"px"),n.classList.add("context_menu"),null==this._html_content){var a,o=l(this._options);try{var s=function(){var e=a.value,t=document.createElement("div");if(t.addEventListener("click",e.func),t.classList.add("context_menu_option"),e.checkbox){var o=document.createElement("span");o.classList=e.checked?"checkmark_checked":"checkmark",t.appendChild(o),t.innerHTML+=(0,u.v)(r||(r=(0,i.Z)(["",""])),e.name),t.addEventListener("click",(function(t){e.checked=!e.checked,e.func(t,e.checked)}))}else t.innerText=e.name,t.addEventListener("click",e.func);n.appendChild(t)};for(o.s();!(a=o.n()).done;)s()}catch(e){o.e(e)}finally{o.f()}}else n.innerHTML=this._html_content;this._cmenu_elem=n,document.body.appendChild(n)}}]),e}()},1762:(e,t,n)=>{"use strict";function r(e){var t=new Map([["&","&amp;"],["<","&lt;"],[">","&gt;"],['"',"&quot;"],["'","&#039;"]]);return"".concat(e).replace(/[&<>"']/g,(function(e){return t.get(e)}))}function i(e){for(var t=arguments.length,n=new Array(t>1?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return 1===e.length?e[0]:e.reduce((function(e,t,i){return"".concat(e).concat(r(String(n[i-1]))).concat(t)}))}n.d(t,{v:()=>i})},9590:(e,t,n)=>{"use strict";n.d(t,{Pn:()=>o,Ev:()=>s,K5:()=>u,oi:()=>l});var r=n(400);function i(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return a(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?a(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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 o,s=!0,u=!1;return{s:function(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return s=e.done,e},e:function(e){u=!0,o=e},f:function(){try{s||null==n.return||n.return()}finally{if(u)throw o}}}}function a(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}function o(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,n="";if(e.start==e.end&&1==e.step&&1==e.tile)n+=s(e.start,t);else{if(t&&t.inclusive_ranges)n+=s(e.start,t)+".."+s(e.end,t);else{var i=s(e.end,t)+" + 1";try{i=(0,r.og)(i).toString()}catch(e){}n+=s(e.start,t)+":"+i}1!=e.step?(n+=":"+s(e.step,t),1!=e.tile&&(n+=":"+s(e.tile,t))):1!=e.tile&&(n+="::"+s(e.tile,t))}return n}function s(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;if(null===e)return e;if("boolean"==typeof e)return e?"True":"False";if("Indices"===e.type||"subsets.Indices"===e.type){var n,r=e.indices,a="[",u=i(r);try{for(u.s();!(n=u.n()).done;){var l=n.value;a+=s(l,t)+", "}}catch(e){u.e(e)}finally{u.f()}return a.slice(0,-2)+"]"}if("Range"===e.type||"subsets.Range"===e.type){var c,f=e.ranges,d="[",p=i(f);try{for(p.s();!(c=p.n()).done;){var h=c.value;d+=o(h,t)+", "}}catch(e){p.e(e)}finally{p.f()}return d.slice(0,-2)+"]"}if(void 0!==e.language)return""!==e.string_data&&void 0!==e.string_data&&null!==e.string_data?'<pre class="code"><code>'+e.string_data.trim()+'</code></pre><div class="clearfix"></div>':"";if(void 0!==e.approx&&void 0!==e.main)return e.main;if(e.constructor==Object)return'<pre class="code"><code>'+JSON.stringify(e,void 0,4)+'</code></pre><div class="clearfix"></div>';if(e.constructor==Array){var m,v="[ ",y=!0,g=i(e);try{for(g.s();!(m=g.n()).done;){var _=m.value;y||(v+=", "),v+=s(_,t),y=!1}}catch(e){g.e(e)}finally{g.f()}return v+" ]"}return e}function u(e){if(e.replace(/\s+/g,""),""===e||"null"===e)return null;if(e.endsWith(")"))if(e.startsWith("vector(")){var t=e.substring(7,e.length-1);if(t){var n=t.lastIndexOf(",");if(n){var r=u(t.substring(0,n)),i=t.substring(n);if(r&&i)return{type:"vector",dtype:r,elements:i}}}}else if(e.startsWith("pointer(")){var a=e.substring(8,e.length-1);if(a)return{type:"pointer",dtype:u(a)}}else if(e.startsWith("opaque(")){var o=e.substring(7,e.length-1);if(o)return{type:"opaque",name:o}}else if(e.startsWith("callback(")){var s=e.substring(9,e.length-1);if(s){var l=s.lastIndexOf(",");if(l){var c=s.substring(0,l);if(c.startsWith("[")&&c.endsWith("]")){var f=c.substring(1,c.length-1).split(","),d=u(s.substring(l)),p=[];if(f&&f.forEach((function(e){p.push(u(e))})),p&&d)return{type:"callback",arguments:p,returntype:d}}}}}return e}function l(e){if(null==e)return"null";if(e.constructor===Object){if(void 0!==e.type)switch(e.type){case"vector":if(void 0!==e.elements&&void 0!==e.dtype)return"vector("+l(e.dtype)+", "+e.elements+")";break;case"pointer":if(void 0!==e.dtype)return"pointer("+l(e.dtype)+")";break;case"opaque":if(void 0!==e.name)return"opaque("+e.name+")";break;case"callback":if(void 0!==e.arguments){for(var t="callback([",n=0;n<e.arguments.length;n++)t+=l(e.arguments[n]),n<e.arguments.length-1&&(t+=", ");return t+="], ",void 0!==e.returntype?t+=l(e.returntype):t+="None",t+")"}}return s(e)}return e}},9018:(e,t,n)=>{"use strict";n.d(t,{a:()=>i,n:()=>a});var r=n(484);function i(e){return JSON.parse(e,o)}function a(e){return JSON.stringify(e,(function(t,n){return s(0,n,e)}))}function o(e,t){return"sdfg"==e&&t&&"string"==typeof t&&"{"===t[0]?JSON.parse(t,o):t}function s(e,t,n){return!t||(i=t,"object"!==(0,r.Z)(i)||null===i||i instanceof Array||i instanceof Date)||t===n||!("type"in t)||"SDFG"!==t.type?t:JSON.stringify(t,(function(e,n){return s(0,n,t)}));var i}},728:(e,t,n)=>{"use strict";n.d(t,{E8:()=>u,f4:()=>f});var r=n(7329),i=n(6610),a=n(5991);function o(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return s(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?s(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,i=function(){};return{s:i,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},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,u=!1;return{s:function(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return o=e.done,e},e:function(e){u=!0,a=e},f:function(){try{o||null==n.return||n.return()}finally{if(u)throw a}}}}function s(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}var u=function(){function e(t){(0,i.Z)(this,e),this._sdfg=t}return(0,a.Z)(e,[{key:"getStates",value:function(){return this._sdfg.nodes.map((function(e){return new l(e)}))}}],[{key:"lookup_symbols",value:function(t,n,i,a){var s=arguments.length>4&&void 0!==arguments[4]?arguments[4]:0,u=t.nodes[n],l=[];if(i.constructor==Object){var c,f=u.edges.filter((function(e){return e.dst==i.dst&&e.src==i.src})),d=o(f);try{for(d.s();!(c=d.n()).done;){var p=c.value,h=p.attributes.data.attributes.subset;if("subsets.Indices"==h.type){var m,v=h.indices.map((function(e){return e})).reverse(),y=o(v);try{for(y.s();!(m=y.n()).done;){var g=m.value;s+=1,l.push({var:g,val:null,depth:s})}}catch(e){y.e(e)}finally{y.f()}}else h.type;t.nodes[n].nodes[p.src];var _=e.lookup_symbols(t,n,p.src,a,s+1);l=[].concat((0,r.Z)(l),(0,r.Z)(_))}}catch(e){d.e(e)}finally{d.f()}}else{var b=u.nodes[i];try{!function(){var e=b.attributes.range.ranges.map((function(e){return e})),t=b.attributes.params.map((function(e){return e}));console.assert(e.length==t.length,"Ranges and params should have the same count of elements"),e.reverse(),t.reverse();for(var n=function(n){var r=l.filter((function(e){return e.var==t[n]}));0==r.length?(s+=1,l.push({var:t[n],val:e[n],depth:s})):JSON.stringify(r[0].val)!=JSON.stringify(e[n])&&console.warn("Colliding definitions for var "+t[n],r[0].val,e[n])},r=0;r<e.length;++r)n(r)}()}catch(N){}var x,w=u.edges.filter((function(e){return e.dst==i})),E=o(w);try{for(E.s();!(x=E.n()).done;){var N=x.value,S=e.lookup_symbols(t,n,N,a,s+1);l=[].concat((0,r.Z)(l),(0,r.Z)(S))}}catch(e){E.e(e)}finally{E.f()}}return l}}]),e}(),l=function(){function e(t){(0,i.Z)(this,e),this._sdfg_state=t}return(0,a.Z)(e,[{key:"getNodes",value:function(){return this._sdfg_state.nodes.map((function(e){return new c(e)}))}}]),e}(),c=function(){function e(t){(0,i.Z)(this,e),this._node=t}return(0,a.Z)(e,[{key:"isNodeType",value:function(e){return this._node.attributes.type===e}}]),e}(),f=function(){function e(){(0,i.Z)(this,e)}return(0,a.Z)(e,null,[{key:"getMetaFor",value:function(e,t){return e.attributes["_meta_"+t]}},{key:"getAttributeNames",value:function(e){var t=Object.keys(e.attributes);return t.filter((function(e){return t.includes("_meta_"+e)}))}}]),e}()},6310:(e,t,n)=>{"use strict";function r(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return i(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?i(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,a=function(){};return{s:a,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},e:function(e){throw e},f:a}}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 o,s=!0,u=!1;return{s:function(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return s=e.done,e},e:function(e){u=!0,o=e},f:function(){try{s||null==n.return||n.return()}finally{if(u)throw o}}}}function i(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}n.d(t,{GS:()=>s,FK:()=>u,RI:()=>l,sC:()=>c,_T:()=>f,Wp:()=>d,lU:()=>p});var a=n(5994).LF.NestedSDFG;function o(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:void 0;if(e.node(0).sdfg.sdfg_list_id===t)return{graph:e,node:n};var i,s={graph:void 0,node:void 0},u=r(e.nodes());try{for(u.s();!(i=u.n()).done;){var l=i.value,c=e.node(l);if(void 0!==c.data.graph&&null!==c.data.graph){var f,d=r(c.data.graph.nodes());try{for(d.s();!(f=d.n()).done;){var p=f.value,h=c.data.graph.node(p);if(h instanceof a){var m=o(h.data.graph,t,h);if(void 0!==m.graph)return m}}}catch(e){d.e(e)}finally{d.f()}}}}catch(e){u.e(e)}finally{u.f()}return s}function s(e,t){var n,i=r(e);try{for(i.s();!(n=i.n()).done;){var a=n.value;if(a.type.endsWith("Exit")&&parseInt(a.scope_entry)==t.id)return a}}catch(e){i.e(e)}finally{i.f()}return console.warn("Did not find corresponding exit"),null}function u(e){if(e instanceof State)return e.sdfg.sdfg_list_id+"/"+e.id+"/-1/"+-1;if(e instanceof SDFGNode)return e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.id+"/"+-1;if(e instanceof Edge){var t=-1;return null!==e.parent_id&&void 0!==e.parent_id&&(t=e.parent_id),e.sdfg.sdfg_list_id+"/"+t+"/-1/"+e.id}return"-1/-1/-1/-1"}function l(e,t,n){if(!t.has(e.dst))return null;if(t.has(e.src))return e;var r=n.nodes[e.src].scope_entry;if(!t.has(r))return null;var i=Object.assign({},e);return i.src=r,i}function c(e,t){var n=t.split("/"),r=Number(n[0]),i=Number(n[1]),a=Number(n[2]),s=Number(n[3]),u={parent:void 0,element:void 0},l=e;if(r>0){var c=o(l,r);if(void 0===c.graph)throw new Error;u={parent:l=c.graph,element:c.node}}var f=void 0;return-1!==i&&void 0!==l&&(f=l.node(i),u={parent:l,element:f}),-1!==a&&void 0!==f&&null!==f.data.graph?u={parent:f.data.graph,element:f.data.graph.node(a)}:-1!==s&&void 0!==f&&null!==f.data.graph?u={parent:f.data.graph,element:f.data.graph.edge(s)}:-1!==s&&void 0===f&&(u={parent:l,element:l.edge(s)}),u}function f(e){var t;if(e instanceof Edge||"MultiConnectorEdge"===e.type){var n=void 0;e.points&&(n=Array(e.points.length)),t={points:n,scope_dx:0,scope_dy:0};for(var r=0;e.points&&r<e.points.length;r++)t.points[r]={dx:0,dy:0}}else t={dx:0,dy:0,scope_dx:0,scope_dy:0};return function(e,t){e instanceof State?e.data.state.attributes.position=t:e instanceof SDFGNode?e.data.node.attributes.position=t:e instanceof Edge?e.data.attributes.position=t:"MultiConnectorEdge"===e.type?e.attributes.data.attributes.position=t:e.attributes&&(e.attributes.position=t)}(e,t),t}function d(e){var t,n,r;return e instanceof State?e.data.state.attributes.position:e instanceof SDFGNode?e.data.node.attributes.position:e instanceof Edge?e.data.attributes.position:"MultiConnectorEdge"===(null==e?void 0:e.type)?null==e||null===(t=e.attributes)||void 0===t||null===(n=t.data)||void 0===n||null===(r=n.attributes)||void 0===r?void 0:r.position:null!=e&&e.attributes?e.attributes.position:void 0}function p(e){e instanceof State&&delete e.data.state.attributes.position,e instanceof SDFGNode&&delete e.data.node.attributes.position,e instanceof Edge&&delete e.data.attributes.position,"MultiConnectorEdge"===(null==e?void 0:e.type)&&delete e.attributes.data.attributes.position,null!=e&&e.attributes&&delete e.attributes.position}},4194:(e,t,n)=>{"use strict";function r(e,t){var n;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(n=function(e,t){if(e){if("string"==typeof e)return i(e,t);var n=Object.prototype.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?i(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){n&&(e=n);var r=0,a=function(){};return{s:a,n:function(){return r>=e.length?{done:!0}:{done:!1,value:e[r++]}},e:function(e){throw e},f:a}}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 o,s=!0,u=!1;return{s:function(){n=e[Symbol.iterator]()},n:function(){var e=n.next();return s=e.done,e},e:function(e){u=!0,o=e},f:function(){try{s||null==n.return||n.return()}finally{if(u)throw o}}}}function i(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}function a(e,t){var n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;function i(e,a){var o=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;null===o&&(o=new Set);var s,u=r(a);try{for(u.s();!(s=u.n()).done;){var l=s.value,c=e.node(l);if(void 0!==c&&!o.has(c.id.toString())){var f=t(c,e);if(!1!==f){if(c.type().endsWith("Entry")){var d=c.sdfg.nodes[c.parent_id];void 0!==d.scope_dict[c.id]&&i(e,d.scope_dict[c.id],o)}if(c.data.graph){var p=c.data.state;void 0!==p&&void 0!==p.scope_dict[-1]?i(c.data.graph,p.scope_dict[-1]):i(c.data.graph,c.data.graph.nodes())}}n&&n(c,e),o.add(c.id.toString())}}}catch(e){u.e(e)}finally{u.f()}}i(e,e.nodes())}function o(e,t,n){var r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:[];if(r.includes(n)||n.attributes.data.attributes.shortcut)return[];r.push(n);var i=[];function a(e){return t.nodes[e.src]}function s(e){return t.nodes[e.dst]}function u(t){if("AccessNode"==t.type){var n=e.attributes._arrays[t.attributes.data];return n&&"View"===n.type}return!1}var l=!1,c=!1;if((n.src_connector&&a(n).type.endsWith("Entry")||n.dst_connector&&s(n).type.endsWith("Entry")&&n.dst_connector.startsWith("IN_")||"NestedSDFG"==s(n).type||u(s(n)))&&(l=!0),(n.src_connector&&a(n).type.endsWith("Exit")||n.dst_connector&&s(n).type.endsWith("Exit")||"NestedSDFG"==a(n).type||u(a(n)))&&(c=!0),i.push(n),l==c&&!1===c)return i;function f(e){var n=[];if(l){var d=s(e);if("NestedSDFG"==d.type){var p=e.dst_connector,h=d.attributes.sdfg;h.nodes.forEach((function(e){e.edges.forEach((function(t){var n=e.nodes[t.src];"AccessNode"==n.type&&n.attributes.data===p&&(i=i.concat(o(h,e,t,r)))}))}))}if(u(d))t.edges.forEach((function(e){e.src==d.id&&(n.push(e),e.attributes.data.attributes.shortcut||i.push(e))}));else{if(!d.type.endsWith("Entry")||!e.dst_connector||!e.dst_connector.startsWith("IN_"))return;if(d.attributes.is_collapsed)return;var m=e.dst_connector.substring(3);t.edges.forEach((function(e){e.src==d.id&&e.src_connector=="OUT_"+m&&(n.push(e),e.attributes.data.attributes.shortcut||i.push(e))}))}}if(c){var v=a(e);if("NestedSDFG"==v.type){var y=e.src_connector,g=v.attributes.sdfg;g.nodes.forEach((function(e){e.edges.forEach((function(t){var n=e.nodes[t.dst];"AccessNode"==n.type&&n.attributes.data==y&&(i=i.concat(o(g,e,t,r)))}))}))}if(u(v))t.edges.forEach((function(e){e.dst==v.id&&(n.push(e),i.push(e))}));else{if(!v.type.endsWith("Exit")||!e.src_connector)return;var _=e.src_connector.substring(4);t.edges.forEach((function(e){e.dst==v.id&&e.dst_connector=="IN_"+_&&(n.push(e),i.push(e))}))}}for(var b=0,x=n;b<x.length;b++)f(x[b])}return f(n),i}function s(e){var t=[],n=[];return e.nodes.forEach((function(r){r.edges.forEach((function(i){var a=o(e,r,i,n);a.length>1&&t.push(a)})),r.nodes.forEach((function(e){if("NestedSDFG"==e.type){var n=s(e.attributes.sdfg);t=t.concat(n)}}))})),t}function u(e){var t=[];return s(e).forEach((function(e){var n,i=!1,a=r(t);try{var o=function(){var t,a=n.value,o=r(e);try{for(o.s();!(t=o.n()).done;){var s=t.value;if(a.has(s)){e.forEach((function(e){return a.add(e)})),i=!0;break}}}catch(e){o.e(e)}finally{o.f()}if(i)return"break"};for(a.s();!(n=a.n()).done&&"break"!==o(););}catch(e){a.e(e)}finally{a.f()}i||t.push(new Set(e))})),t}n.d(t,{LY:()=>a,KV:()=>u})},5096:(e,t,n)=>{"use strict";n.d(t,{p$:()=>o,az:()=>s,_W:()=>u});var r=n(4699),i=n(7329),a=n(484);function o(e){return"object"!==(0,a.Z)(e)||null===e?e:Array.isArray(e)?e.map((function(e){return o(e)})):Object.fromEntries(o((0,i.Z)(Object.entries(e))))}function s(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"",n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:[],r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,i=document.createElement(e);return""!==t&&(i.id=t),n!==[]&&n.forEach((function(e){i.classList.contains(e)||i.classList.add(e)})),r&&r.appendChild(i),i}function u(e,t){for(var n=e,i=0,a=Object.entries(t);i<a.length;i++){var o=(0,r.Z)(a[i],2),s=o[0],u=o[1];s in e||(n[s]=u)}return n}},1977:function(e,t){var n;!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 n=Math.abs(e),r=Math.abs(t);return 0===e?Math.log(r):0===t?Math.log(n):n<3e3&&r<3e3?.5*Math.log(e*e+t*t):Math.log(e/Math.cos(Math.atan2(t,e)))}function u(e,t){if(!(this instanceof u))return new u(e,t);var n=function(e,t){var n={re:0,im:0};if(null==e)n.re=n.im=0;else if(void 0!==t)n.re=e,n.im=t;else switch(typeof e){case"object":if("im"in e&&"re"in e)n.re=e.re,n.im=e.im;else if("abs"in e&&"arg"in e){if(!Number.isFinite(e.abs)&&Number.isFinite(e.arg))return u.INFINITY;n.re=e.abs*Math.cos(e.arg),n.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;n.re=e.r*Math.cos(e.phi),n.im=e.r*Math.sin(e.phi)}else 2===e.length?(n.re=e[0],n.im=e[1]):o();break;case"string":n.im=n.re=0;var r=e.match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g),i=1,a=0;null===r&&o();for(var s=0;s<r.length;s++){var l=r[s];" "===l||"\t"===l||"\n"===l||("+"===l?i++:"-"===l?a++:"i"===l||"I"===l?(i+a===0&&o()," "===r[s+1]||isNaN(r[s+1])?n.im+=parseFloat((a%2?"-":"")+"1"):(n.im+=parseFloat((a%2?"-":"")+r[s+1]),s++),i=a=0):((i+a===0||isNaN(l))&&o(),"i"===r[s+1]||"I"===r[s+1]?(n.im+=parseFloat((a%2?"-":"")+l),s++):n.re+=parseFloat((a%2?"-":"")+l),i=a=0))}i+a>0&&o();break;case"number":n.im=0,n.re=e;break;default:o()}return isNaN(n.re)||isNaN(n.im),n}(e,t);this.re=n.re,this.im=n.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 n=new u(e,t);return this.isInfinite()&&n.isInfinite()?u.NAN:this.isInfinite()||n.isInfinite()?u.INFINITY:new u(this.re+n.re,this.im+n.im)},sub:function(e,t){var n=new u(e,t);return this.isInfinite()&&n.isInfinite()?u.NAN:this.isInfinite()||n.isInfinite()?u.INFINITY:new u(this.re-n.re,this.im-n.im)},mul:function(e,t){var n=new u(e,t);return this.isInfinite()&&n.isZero()||this.isZero()&&n.isInfinite()?u.NAN:this.isInfinite()||n.isInfinite()?u.INFINITY:0===n.im&&0===this.im?new u(this.re*n.re,0):new u(this.re*n.re-this.im*n.im,this.re*n.im+this.im*n.re)},div:function(e,t){var n=new u(e,t);if(this.isZero()&&n.isZero()||this.isInfinite()&&n.isInfinite())return u.NAN;if(this.isInfinite()||n.isZero())return u.INFINITY;if(this.isZero()||n.isInfinite())return u.ZERO;e=this.re,t=this.im;var r,i,a=n.re,o=n.im;return 0===o?new u(e/a,t/a):Math.abs(a)<Math.abs(o)?new u((e*(i=a/o)+t)/(r=a*i+o),(t*i-e)/r):new u((e+t*(i=o/a))/(r=o*i+a),(t-e*i)/r)},pow:function(e,t){var n=new u(e,t);if(e=this.re,t=this.im,n.isZero())return u.ONE;if(0===n.im){if(0===t)return new u(Math.pow(e,n.re),0);if(0===e)switch((n.re%4+4)%4){case 0:return new u(Math.pow(t,n.re),0);case 1:return new u(0,Math.pow(t,n.re));case 2:return new u(-Math.pow(t,n.re),0);case 3:return new u(0,-Math.pow(t,n.re))}}if(0===e&&0===t&&n.re>0&&n.im>=0)return u.ZERO;var r=Math.atan2(t,e),i=s(e,t);return e=Math.exp(n.re*i-n.im*r),t=n.im*i+n.re*r,new u(e*Math.cos(t),e*Math.sin(t))},sqrt:function(){var e,t,n=this.re,r=this.im,i=this.abs();if(n>=0){if(0===r)return new u(Math.sqrt(n),0);e=.5*Math.sqrt(2*(i+n))}else e=Math.abs(r)/Math.sqrt(2*(i-n));return t=n<=0?.5*Math.sqrt(2*(i-n)):Math.abs(r)/Math.sqrt(2*(i+n)),new u(e,r<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(e<-t||e>t)return Math.cos(e)-1;var n=e*e;return n*(n*(1/24+n*(-1/720+n*(1/40320+n*(-1/3628800+n*(1/4790014600+n*(-1/87178291200+n*(1/20922789888e3)))))))-.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,n=Math.abs(e),r=Math.abs(t),n<3e3&&r<3e3?Math.sqrt(n*n+r*r):(n<r?(n=r,r=e/t):r=t/e,n*Math.sqrt(1+r*r));var e,t,n,r},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,n=Math.cos(e)+i(t);return new u(Math.sin(e)/n,a(t)/n)},cot:function(){var e=2*this.re,t=2*this.im,n=Math.cos(e)-i(t);return new u(-Math.sin(e)/n,a(t)/n)},sec:function(){var e=this.re,t=this.im,n=.5*i(2*t)+.5*Math.cos(2*e);return new u(Math.cos(e)*i(t)/n,Math.sin(e)*a(t)/n)},csc:function(){var e=this.re,t=this.im,n=.5*i(2*t)-.5*Math.cos(2*e);return new u(Math.sin(e)*i(t)/n,-Math.cos(e)*a(t)/n)},asin:function(){var e=this.re,t=this.im,n=new u(t*t-e*e+1,-2*e*t).sqrt(),r=new u(n.re-t,n.im+e).log();return new u(r.im,-r.re)},acos:function(){var e=this.re,t=this.im,n=new u(t*t-e*e+1,-2*e*t).sqrt(),r=new u(n.re-t,n.im+e).log();return new u(Math.PI/2-r.im,r.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 n=e*e+(1-t)*(1-t),r=new u((1-t*t-e*e)/n,-2*e/n).log();return new u(-.5*r.im,.5*r.re)},acot:function(){var e=this.re,t=this.im;if(0===t)return new u(Math.atan2(1,e),0);var n=e*e+t*t;return 0!==n?new u(e/n,-t/n).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 n=e*e+t*t;return 0!==n?new u(e/n,-t/n).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 n=e*e+t*t;return 0!==n?new u(e/n,-t/n).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,n=i(e)+Math.cos(t);return new u(a(e)/n,Math.sin(t)/n)},coth:function(){var e=2*this.re,t=2*this.im,n=i(e)-Math.cos(t);return new u(a(e)/n,-Math.sin(t)/n)},csch:function(){var e=this.re,t=this.im,n=Math.cos(2*t)-i(2*e);return new u(-2*a(e)*Math.cos(t)/n,2*i(e)*Math.sin(t)/n)},sech:function(){var e=this.re,t=this.im,n=Math.cos(2*t)+i(2*e);return new u(2*i(e)*Math.cos(t)/n,-2*a(e)*Math.sin(t)/n)},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,n=e>1&&0===t,r=1-e,i=1+e,a=r*r+t*t,o=0!==a?new u((i*r-t*t)/a,(t*r+i*t)/a):new u(-1!==e?e/0:0,0!==t?t/0:0),l=o.re;return o.re=s(o.re,o.im)/2,o.im=Math.atan2(o.im,l)/2,n&&(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 n=e*e+t*t;return 0!==n?new u(e/n,-t/n).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 n=e*e+t*t;return 0!==n?new u(e/n,-t/n).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 n=e*e+t*t;return 0!==n?new u(e/n,-t/n).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,n=e*e+t*t;return new u(e/n,-t/n)},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 n=new u(e,t);return Math.abs(n.re-this.re)<=u.EPSILON&&Math.abs(n.im-this.im)<=u.EPSILON},clone:function(){return new u(this.re,this.im)},toString:function(){var e=this.re,t=this.im,n="";return this.isNaN()?"NaN":this.isInfinite()?"Infinity":0===t?n+e:(0!==e?(n+=e,n+=" ",t<0?(t=-t,n+="-"):n+="+",n+=" "):t<0&&(t=-t,n+="-"),1!==t&&(n+=t),n+"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-16,void 0===(n=function(){return u}.apply(t,[]))||(e.exports=n)}()},681:(e,t,n)=>{e.exports={graphlib:n(574),layout:n(8123),debug:n(7570),util:{time:n(1138).time,notime:n(1138).notime},version:n(8177)}},2188:(e,t,n)=>{"use strict";var r=n(8436),i=n(4079);e.exports={run:function(e){var t="greedy"===e.graph().acyclicer?i(e,function(e){return function(t){return e.edge(t).weight}}(e)):function(e){var t=[],n={},i={};return r.forEach(e.nodes(),(function a(o){r.has(i,o)||(i[o]=!0,n[o]=!0,r.forEach(e.outEdges(o),(function(e){r.has(n,e.w)?t.push(e):a(e.w)})),delete n[o])})),t}(e);r.forEach(t,(function(t){var n=e.edge(t);e.removeEdge(t),n.forwardName=t.name,n.reversed=!0,e.setEdge(t.w,t.v,n,r.uniqueId("rev"))}))},undo:function(e){r.forEach(e.edges(),(function(t){var n=e.edge(t);if(n.reversed){e.removeEdge(t);var r=n.forwardName;delete n.reversed,delete n.forwardName,e.setEdge(t.w,t.v,n,r)}}))}}},1133:(e,t,n)=>{var r=n(8436),i=n(1138);function a(e,t,n,r,a,o){var s={width:0,height:0,rank:o,borderType:t},u=a[t][o-1],l=i.addDummyNode(e,"border",s,n);a[t][o]=l,e.setParent(l,r),u&&e.setEdge(u,l,{weight:1})}e.exports=function(e){r.forEach(e.children(),(function t(n){var i=e.children(n),o=e.node(n);if(i.length&&r.forEach(i,t),r.has(o,"minRank")){o.borderLeft=[],o.borderRight=[];for(var s=o.minRank,u=o.maxRank+1;s<u;++s)a(e,"borderLeft","_bl",n,o,s),a(e,"borderRight","_br",n,o,s)}}))}},3258:(e,t,n)=>{"use strict";var r=n(8436);function i(e){r.forEach(e.nodes(),(function(t){a(e.node(t))})),r.forEach(e.edges(),(function(t){a(e.edge(t))}))}function a(e){var t=e.width;e.width=e.height,e.height=t}function o(e){e.y=-e.y}function s(e){var t=e.x;e.x=e.y,e.y=t}e.exports={adjust:function(e){var t=e.graph().rankdir.toLowerCase();"lr"!==t&&"rl"!==t||i(e)},undo:function(e){var t=e.graph().rankdir.toLowerCase();"bt"!==t&&"rl"!==t||function(e){r.forEach(e.nodes(),(function(t){o(e.node(t))})),r.forEach(e.edges(),(function(t){var n=e.edge(t);r.forEach(n.points,o),r.has(n,"y")&&o(n)}))}(e),"lr"!==t&&"rl"!==t||(function(e){r.forEach(e.nodes(),(function(t){s(e.node(t))})),r.forEach(e.edges(),(function(t){var n=e.edge(t);r.forEach(n.points,s),r.has(n,"x")&&s(n)}))}(e),i(e))}}},7822:e=>{function t(){var e={};e._next=e._prev=e,this._sentinel=e}function n(e){e._prev._next=e._next,e._next._prev=e._prev,delete e._next,delete e._prev}function r(e,t){if("_next"!==e&&"_prev"!==e)return t}e.exports=t,t.prototype.dequeue=function(){var e=this._sentinel,t=e._prev;if(t!==e)return n(t),t},t.prototype.enqueue=function(e){var t=this._sentinel;e._prev&&e._next&&n(e),e._next=t._next,t._next._prev=e,t._next=e,e._prev=t},t.prototype.toString=function(){for(var e=[],t=this._sentinel,n=t._prev;n!==t;)e.push(JSON.stringify(n,r)),n=n._prev;return"["+e.join(", ")+"]"}},7570:(e,t,n)=>{var r=n(8436),i=n(1138),a=n(574).Graph;e.exports={debugOrdering:function(e){var t=i.buildLayerMatrix(e),n=new a({compound:!0,multigraph:!0}).setGraph({});return r.forEach(e.nodes(),(function(t){n.setNode(t,{label:t}),n.setParent(t,"layer"+e.node(t).rank)})),r.forEach(e.edges(),(function(e){n.setEdge(e.v,e.w,{},e.name)})),r.forEach(t,(function(e,t){var i="layer"+t;n.setNode(i,{rank:"same"}),r.reduce(e,(function(e,t){return n.setEdge(e,t,{style:"invis"}),t}))})),n}}},574:(e,t,n)=>{var r;try{r=n(8282)}catch(e){}r||(r=window.graphlib),e.exports=r},4079:(e,t,n)=>{var r=n(8436),i=n(574).Graph,a=n(7822);e.exports=function(e,t){if(e.nodeCount()<=1)return[];var n=function(e,t){var n=new i,o=0,s=0;r.forEach(e.nodes(),(function(e){n.setNode(e,{v:e,in:0,out:0})})),r.forEach(e.edges(),(function(e){var r=n.edge(e.v,e.w)||0,i=t(e),a=r+i;n.setEdge(e.v,e.w,a),s=Math.max(s,n.node(e.v).out+=i),o=Math.max(o,n.node(e.w).in+=i)}));var l=r.range(s+o+3).map((function(){return new a})),c=o+1;return r.forEach(n.nodes(),(function(e){u(l,c,n.node(e))})),{graph:n,buckets:l,zeroIdx:c}}(e,t||o),l=function(e,t,n){for(var r,i=[],a=t[t.length-1],o=t[0];e.nodeCount();){for(;r=o.dequeue();)s(e,t,n,r);for(;r=a.dequeue();)s(e,t,n,r);if(e.nodeCount())for(var u=t.length-2;u>0;--u)if(r=t[u].dequeue()){i=i.concat(s(e,t,n,r,!0));break}}return i}(n.graph,n.buckets,n.zeroIdx);return r.flatten(r.map(l,(function(t){return e.outEdges(t.v,t.w)})),!0)};var o=r.constant(1);function s(e,t,n,i,a){var o=a?[]:void 0;return r.forEach(e.inEdges(i.v),(function(r){var i=e.edge(r),s=e.node(r.v);a&&o.push({v:r.v,w:r.w}),s.out-=i,u(t,n,s)})),r.forEach(e.outEdges(i.v),(function(r){var i=e.edge(r),a=r.w,o=e.node(a);o.in-=i,u(t,n,o)})),e.removeNode(i.v),o}function u(e,t,n){n.out?n.in?e[n.out-n.in+t].enqueue(n):e[e.length-1].enqueue(n):e[0].enqueue(n)}},8123:(e,t,n)=>{"use strict";var r=n(8436),i=n(2188),a=n(5995),o=n(8093),s=n(1138).normalizeRanks,u=n(4219),l=n(1138).removeEmptyRanks,c=n(2981),f=n(1133),d=n(3258),p=n(3408),h=n(7873),m=n(1138),v=n(574).Graph;e.exports=function(e,t){var n=t&&t.debugTiming?m.time:m.notime;n("layout",(function(){var t=n("  buildLayoutGraph",(function(){return function(e){var t=new v({multigraph:!0,compound:!0}),n=M(e.graph());return t.setGraph(r.merge({},g,S(n,y),r.pick(n,_))),r.forEach(e.nodes(),(function(n){var i=M(e.node(n));t.setNode(n,r.defaults(S(i,b),x)),t.setParent(n,e.parent(n))})),r.forEach(e.edges(),(function(n){var i=M(e.edge(n));t.setEdge(n,r.merge({},E,S(i,w),r.pick(i,N)))})),t}(e)}));n("  runLayout",(function(){!function(e,t){t("    makeSpaceForEdgeLabels",(function(){!function(e){var t=e.graph();t.ranksep/=2,r.forEach(e.edges(),(function(n){var r=e.edge(n);r.minlen*=2,"c"!==r.labelpos.toLowerCase()&&("TB"===t.rankdir||"BT"===t.rankdir?r.width+=r.labeloffset:r.height+=r.labeloffset)}))}(e)})),t("    removeSelfEdges",(function(){!function(e){r.forEach(e.edges(),(function(t){if(t.v===t.w){var n=e.node(t.v);n.selfEdges||(n.selfEdges=[]),n.selfEdges.push({e:t,label:e.edge(t)}),e.removeEdge(t)}}))}(e)})),t("    acyclic",(function(){i.run(e)})),t("    nestingGraph.run",(function(){c.run(e)})),t("    rank",(function(){o(m.asNonCompoundGraph(e))})),t("    injectEdgeLabelProxies",(function(){!function(e){r.forEach(e.edges(),(function(t){var n=e.edge(t);if(n.width&&n.height){var r=e.node(t.v),i={rank:(e.node(t.w).rank-r.rank)/2+r.rank,e:t};m.addDummyNode(e,"edge-proxy",i,"_ep")}}))}(e)})),t("    removeEmptyRanks",(function(){l(e)})),t("    nestingGraph.cleanup",(function(){c.cleanup(e)})),t("    normalizeRanks",(function(){s(e)})),t("    assignRankMinMax",(function(){!function(e){var t=0;r.forEach(e.nodes(),(function(n){var i=e.node(n);i.borderTop&&(i.minRank=e.node(i.borderTop).rank,i.maxRank=e.node(i.borderBottom).rank,t=r.max(t,i.maxRank))})),e.graph().maxRank=t}(e)})),t("    removeEdgeLabelProxies",(function(){!function(e){r.forEach(e.nodes(),(function(t){var n=e.node(t);"edge-proxy"===n.dummy&&(e.edge(n.e).labelRank=n.rank,e.removeNode(t))}))}(e)})),t("    normalize.run",(function(){a.run(e)})),t("    parentDummyChains",(function(){u(e)})),t("    addBorderSegments",(function(){f(e)})),t("    order",(function(){p(e)})),t("    insertSelfEdges",(function(){!function(e){var t=m.buildLayerMatrix(e);r.forEach(t,(function(t){var n=0;r.forEach(t,(function(t,i){var a=e.node(t);a.order=i+n,r.forEach(a.selfEdges,(function(t){m.addDummyNode(e,"selfedge",{width:t.label.width,height:t.label.height,rank:a.rank,order:i+ ++n,e:t.e,label:t.label},"_se")})),delete a.selfEdges}))}))}(e)})),t("    adjustCoordinateSystem",(function(){d.adjust(e)})),t("    position",(function(){h(e)})),t("    positionSelfEdges",(function(){!function(e){r.forEach(e.nodes(),(function(t){var n=e.node(t);if("selfedge"===n.dummy){var r=e.node(n.e.v),i=r.x+r.width/2,a=r.y,o=n.x-i,s=r.height/2;e.setEdge(n.e,n.label),e.removeNode(t),n.label.points=[{x:i+2*o/3,y:a-s},{x:i+5*o/6,y:a-s},{x:i+o,y:a},{x:i+5*o/6,y:a+s},{x:i+2*o/3,y:a+s}],n.label.x=n.x,n.label.y=n.y}}))}(e)})),t("    removeBorderNodes",(function(){!function(e){r.forEach(e.nodes(),(function(t){if(e.children(t).length){var n=e.node(t),i=e.node(n.borderTop),a=e.node(n.borderBottom),o=e.node(r.last(n.borderLeft)),s=e.node(r.last(n.borderRight));n.width=Math.abs(s.x-o.x),n.height=Math.abs(a.y-i.y),n.x=o.x+n.width/2,n.y=i.y+n.height/2}})),r.forEach(e.nodes(),(function(t){"border"===e.node(t).dummy&&e.removeNode(t)}))}(e)})),t("    normalize.undo",(function(){a.undo(e)})),t("    fixupEdgeLabelCoords",(function(){!function(e){r.forEach(e.edges(),(function(t){var n=e.edge(t);if(r.has(n,"x"))switch("l"!==n.labelpos&&"r"!==n.labelpos||(n.width-=n.labeloffset),n.labelpos){case"l":n.x-=n.width/2+n.labeloffset;break;case"r":n.x+=n.width/2+n.labeloffset}}))}(e)})),t("    undoCoordinateSystem",(function(){d.undo(e)})),t("    translateGraph",(function(){!function(e){var t=Number.POSITIVE_INFINITY,n=0,i=Number.POSITIVE_INFINITY,a=0,o=e.graph(),s=o.marginx||0,u=o.marginy||0;function l(e){var r=e.x,o=e.y,s=e.width,u=e.height;t=Math.min(t,r-s/2),n=Math.max(n,r+s/2),i=Math.min(i,o-u/2),a=Math.max(a,o+u/2)}r.forEach(e.nodes(),(function(t){l(e.node(t))})),r.forEach(e.edges(),(function(t){var n=e.edge(t);r.has(n,"x")&&l(n)})),t-=s,i-=u,r.forEach(e.nodes(),(function(n){var r=e.node(n);r.x-=t,r.y-=i})),r.forEach(e.edges(),(function(n){var a=e.edge(n);r.forEach(a.points,(function(e){e.x-=t,e.y-=i})),r.has(a,"x")&&(a.x-=t),r.has(a,"y")&&(a.y-=i)})),o.width=n-t+s,o.height=a-i+u}(e)})),t("    assignNodeIntersects",(function(){!function(e){r.forEach(e.edges(),(function(t){var n,r,i=e.edge(t),a=e.node(t.v),o=e.node(t.w);i.points?(n=i.points[0],r=i.points[i.points.length-1]):(i.points=[],n=o,r=a),i.points.unshift(m.intersectRect(a,n)),i.points.push(m.intersectRect(o,r))}))}(e)})),t("    reversePoints",(function(){!function(e){r.forEach(e.edges(),(function(t){var n=e.edge(t);n.reversed&&n.points.reverse()}))}(e)})),t("    acyclic.undo",(function(){i.undo(e)}))}(t,n)})),n("  updateInputGraph",(function(){!function(e,t){r.forEach(e.nodes(),(function(n){var r=e.node(n),i=t.node(n);r&&(r.x=i.x,r.y=i.y,t.children(n).length&&(r.width=i.width,r.height=i.height))})),r.forEach(e.edges(),(function(n){var i=e.edge(n),a=t.edge(n);i.points=a.points,r.has(a,"x")&&(i.x=a.x,i.y=a.y)})),e.graph().width=t.graph().width,e.graph().height=t.graph().height}(e,t)}))}))};var y=["nodesep","edgesep","ranksep","marginx","marginy"],g={ranksep:50,edgesep:20,nodesep:50,rankdir:"tb"},_=["acyclicer","ranker","rankdir","align"],b=["width","height"],x={width:0,height:0},w=["minlen","weight","width","height","labeloffset"],E={minlen:1,weight:1,width:0,height:0,labeloffset:10,labelpos:"r"},N=["labelpos"];function S(e,t){return r.mapValues(r.pick(e,t),Number)}function M(e){var t={};return r.forEach(e,(function(e,n){t[n.toLowerCase()]=e})),t}},8436:(e,t,n)=>{var r;try{r={cloneDeep:n(361),constant:n(5703),defaults:n(1747),each:n(6073),filter:n(3105),find:n(3311),flatten:n(5564),forEach:n(4486),forIn:n(2620),has:n(8721),isUndefined:n(2353),last:n(928),map:n(5161),mapValues:n(6604),max:n(6162),merge:n(3857),min:n(3632),minBy:n(2762),now:n(7771),pick:n(9722),range:n(6026),reduce:n(4061),sortBy:n(9734),uniqueId:n(3955),values:n(2628),zipObject:n(7287)}}catch(e){}r||(r=window._),e.exports=r},2981:(e,t,n)=>{var r=n(8436),i=n(1138);function a(e,t,n,o,s,u,l){var c=e.children(l);if(c.length){var f=i.addBorderNode(e,"_bt"),d=i.addBorderNode(e,"_bb"),p=e.node(l);e.setParent(f,l),p.borderTop=f,e.setParent(d,l),p.borderBottom=d,r.forEach(c,(function(r){a(e,t,n,o,s,u,r);var i=e.node(r),c=i.borderTop?i.borderTop:r,p=i.borderBottom?i.borderBottom:r,h=i.borderTop?o:2*o,m=c!==p?1:s-u[l]+1;e.setEdge(f,c,{weight:h,minlen:m,nestingEdge:!0}),e.setEdge(p,d,{weight:h,minlen:m,nestingEdge:!0})})),e.parent(l)||e.setEdge(t,f,{weight:0,minlen:s+u[l]})}else l!==t&&e.setEdge(t,l,{weight:0,minlen:n})}e.exports={run:function(e){var t=i.addDummyNode(e,"root",{},"_root"),n=function(e){var t={};function n(i,a){var o=e.children(i);o&&o.length&&r.forEach(o,(function(e){n(e,a+1)})),t[i]=a}return r.forEach(e.children(),(function(e){n(e,1)})),t}(e),o=r.max(r.values(n))-1,s=2*o+1;e.graph().nestingRoot=t,r.forEach(e.edges(),(function(t){e.edge(t).minlen*=s}));var u=function(e){return r.reduce(e.edges(),(function(t,n){return t+e.edge(n).weight}),0)}(e)+1;r.forEach(e.children(),(function(r){a(e,t,s,u,o,n,r)})),e.graph().nodeRankFactor=s},cleanup:function(e){var t=e.graph();e.removeNode(t.nestingRoot),delete t.nestingRoot,r.forEach(e.edges(),(function(t){e.edge(t).nestingEdge&&e.removeEdge(t)}))}}},5995:(e,t,n)=>{"use strict";var r=n(8436),i=n(1138);e.exports={run:function(e){e.graph().dummyChains=[],r.forEach(e.edges(),(function(t){!function(e,t){var n,r,a,o=t.v,s=e.node(o).rank,u=t.w,l=e.node(u).rank,c=t.name,f=e.edge(t),d=f.labelRank;if(l!==s+1){for(e.removeEdge(t),a=0,++s;s<l;++a,++s)f.points=[],r={width:0,height:0,edgeLabel:f,edgeObj:t,rank:s},n=i.addDummyNode(e,"edge",r,"_d"),s===d&&(r.width=f.width,r.height=f.height,r.dummy="edge-label",r.labelpos=f.labelpos),e.setEdge(o,n,{weight:f.weight},c),0===a&&e.graph().dummyChains.push(n),o=n;e.setEdge(o,u,{weight:f.weight},c)}}(e,t)}))},undo:function(e){r.forEach(e.graph().dummyChains,(function(t){var n,r=e.node(t),i=r.edgeLabel;for(e.setEdge(r.edgeObj,i);r.dummy;)n=e.successors(t)[0],e.removeNode(t),i.points.push({x:r.x,y:r.y}),"edge-label"===r.dummy&&(i.x=r.x,i.y=r.y,i.width=r.width,i.height=r.height),t=n,r=e.node(t)}))}}},5093:(e,t,n)=>{var r=n(8436);e.exports=function(e,t,n){var i,a={};r.forEach(n,(function(n){for(var r,o,s=e.parent(n);s;){if((r=e.parent(s))?(o=a[r],a[r]=s):(o=i,i=s),o&&o!==s)return void t.setEdge(o,s);s=r}}))}},5439:(e,t,n)=>{var r=n(8436);e.exports=function(e,t){return r.map(t,(function(t){var n=e.inEdges(t);if(n.length){var i=r.reduce(n,(function(t,n){var r=e.edge(n),i=e.node(n.v);return{sum:t.sum+r.weight*i.order,weight:t.weight+r.weight}}),{sum:0,weight:0});return{v:t,barycenter:i.sum/i.weight,weight:i.weight}}return{v:t}}))}},3128:(e,t,n)=>{var r=n(8436),i=n(574).Graph;e.exports=function(e,t,n){var a=function(e){for(var t;e.hasNode(t=r.uniqueId("_root")););return t}(e),o=new i({compound:!0}).setGraph({root:a}).setDefaultNodeLabel((function(t){return e.node(t)}));return r.forEach(e.nodes(),(function(i){var s=e.node(i),u=e.parent(i);(s.rank===t||s.minRank<=t&&t<=s.maxRank)&&(o.setNode(i),o.setParent(i,u||a),r.forEach(e[n](i),(function(t){var n=t.v===i?t.w:t.v,a=o.edge(n,i),s=r.isUndefined(a)?0:a.weight;o.setEdge(n,i,{weight:e.edge(t).weight+s})})),r.has(s,"minRank")&&o.setNode(i,{borderLeft:s.borderLeft[t],borderRight:s.borderRight[t]}))})),o}},6630:(e,t,n)=>{"use strict";var r=n(8436);function i(e,t,n){for(var i=r.zipObject(n,r.map(n,(function(e,t){return t}))),a=r.flatten(r.map(t,(function(t){return r.sortBy(r.map(e.outEdges(t),(function(t){return{pos:i[t.w],weight:e.edge(t).weight}})),"pos")})),!0),o=1;o<n.length;)o<<=1;var s=2*o-1;o-=1;var u=r.map(new Array(s),(function(){return 0})),l=0;return r.forEach(a.forEach((function(e){var t=e.pos+o;u[t]+=e.weight;for(var n=0;t>0;)t%2&&(n+=u[t+1]),u[t=t-1>>1]+=e.weight;l+=e.weight*n}))),l}e.exports=function(e,t){for(var n=0,r=1;r<t.length;++r)n+=i(e,t[r-1],t[r]);return n}},3408:(e,t,n)=>{"use strict";var r=n(8436),i=n(2588),a=n(6630),o=n(1026),s=n(3128),u=n(5093),l=n(574).Graph,c=n(1138);function f(e,t,n){return r.map(t,(function(t){return s(e,t,n)}))}function d(e,t){var n=new l;r.forEach(e,(function(e){var i=e.graph().root,a=o(e,i,n,t);r.forEach(a.vs,(function(t,n){e.node(t).order=n})),u(e,n,a.vs)}))}function p(e,t){r.forEach(t,(function(t){r.forEach(t,(function(t,n){e.node(t).order=n}))}))}e.exports=function(e){var t=c.maxRank(e),n=f(e,r.range(1,t+1),"inEdges"),o=f(e,r.range(t-1,-1,-1),"outEdges"),s=i(e);p(e,s);for(var u,l=Number.POSITIVE_INFINITY,h=0,m=0;m<4;++h,++m){d(h%2?n:o,h%4>=2),s=c.buildLayerMatrix(e);var v=a(e,s);v<l&&(m=0,u=r.cloneDeep(s),l=v)}p(e,u)}},2588:(e,t,n)=>{"use strict";var r=n(8436);e.exports=function(e){var t={},n=r.filter(e.nodes(),(function(t){return!e.children(t).length})),i=r.max(r.map(n,(function(t){return e.node(t).rank}))),a=r.map(r.range(i+1),(function(){return[]})),o=r.sortBy(n,(function(t){return e.node(t).rank}));return r.forEach(o,(function n(i){if(!r.has(t,i)){t[i]=!0;var o=e.node(i);a[o.rank].push(i),r.forEach(e.successors(i),n)}})),a}},9567:(e,t,n)=>{"use strict";var r=n(8436);e.exports=function(e,t){var n={};return r.forEach(e,(function(e,t){var i=n[e.v]={indegree:0,in:[],out:[],vs:[e.v],i:t};r.isUndefined(e.barycenter)||(i.barycenter=e.barycenter,i.weight=e.weight)})),r.forEach(t.edges(),(function(e){var t=n[e.v],i=n[e.w];r.isUndefined(t)||r.isUndefined(i)||(i.indegree++,t.out.push(n[e.w]))})),function(e){var t=[];function n(e){return function(t){var n,i,a,o;t.merged||(r.isUndefined(t.barycenter)||r.isUndefined(e.barycenter)||t.barycenter>=e.barycenter)&&(i=t,a=0,o=0,(n=e).weight&&(a+=n.barycenter*n.weight,o+=n.weight),i.weight&&(a+=i.barycenter*i.weight,o+=i.weight),n.vs=i.vs.concat(n.vs),n.barycenter=a/o,n.weight=o,n.i=Math.min(i.i,n.i),i.merged=!0)}}function i(t){return function(n){n.in.push(t),0==--n.indegree&&e.push(n)}}for(;e.length;){var a=e.pop();t.push(a),r.forEach(a.in.reverse(),n(a)),r.forEach(a.out,i(a))}return r.map(r.filter(t,(function(e){return!e.merged})),(function(e){return r.pick(e,["vs","i","barycenter","weight"])}))}(r.filter(n,(function(e){return!e.indegree})))}},1026:(e,t,n)=>{var r=n(8436),i=n(5439),a=n(9567),o=n(7304);e.exports=function e(t,n,s,u){var l=t.children(n),c=t.node(n),f=c?c.borderLeft:void 0,d=c?c.borderRight:void 0,p={};f&&(l=r.filter(l,(function(e){return e!==f&&e!==d})));var h=i(t,l);r.forEach(h,(function(n){if(t.children(n.v).length){var i=e(t,n.v,s,u);p[n.v]=i,r.has(i,"barycenter")&&(a=n,o=i,r.isUndefined(a.barycenter)?(a.barycenter=o.barycenter,a.weight=o.weight):(a.barycenter=(a.barycenter*a.weight+o.barycenter*o.weight)/(a.weight+o.weight),a.weight+=o.weight))}var a,o}));var m=a(h,s);!function(e,t){r.forEach(e,(function(e){e.vs=r.flatten(e.vs.map((function(e){return t[e]?t[e].vs:e})),!0)}))}(m,p);var v=o(m,u);if(f&&(v.vs=r.flatten([f,v.vs,d],!0),t.predecessors(f).length)){var y=t.node(t.predecessors(f)[0]),g=t.node(t.predecessors(d)[0]);r.has(v,"barycenter")||(v.barycenter=0,v.weight=0),v.barycenter=(v.barycenter*v.weight+y.order+g.order)/(v.weight+2),v.weight+=2}return v}},7304:(e,t,n)=>{var r=n(8436),i=n(1138);function a(e,t,n){for(var i;t.length&&(i=r.last(t)).i<=n;)t.pop(),e.push(i.vs),n++;return n}e.exports=function(e,t){var n,o=i.partition(e,(function(e){return r.has(e,"barycenter")})),s=o.lhs,u=r.sortBy(o.rhs,(function(e){return-e.i})),l=[],c=0,f=0,d=0;s.sort((n=!!t,function(e,t){return e.barycenter<t.barycenter?-1:e.barycenter>t.barycenter?1:n?t.i-e.i:e.i-t.i})),d=a(l,u,d),r.forEach(s,(function(e){d+=e.vs.length,l.push(e.vs),c+=e.barycenter*e.weight,f+=e.weight,d=a(l,u,d)}));var p={vs:r.flatten(l,!0)};return f&&(p.barycenter=c/f,p.weight=f),p}},4219:(e,t,n)=>{var r=n(8436);e.exports=function(e){var t=function(e){var t={},n=0;return r.forEach(e.children(),(function i(a){var o=n;r.forEach(e.children(a),i),t[a]={low:o,lim:n++}})),t}(e);r.forEach(e.graph().dummyChains,(function(n){for(var r=e.node(n),i=r.edgeObj,a=function(e,t,n,r){var i,a,o=[],s=[],u=Math.min(t[n].low,t[r].low),l=Math.max(t[n].lim,t[r].lim);i=n;do{i=e.parent(i),o.push(i)}while(i&&(t[i].low>u||l>t[i].lim));for(a=i,i=r;(i=e.parent(i))!==a;)s.push(i);return{path:o.concat(s.reverse()),lca:a}}(e,t,i.v,i.w),o=a.path,s=a.lca,u=0,l=o[u],c=!0;n!==i.w;){if(r=e.node(n),c){for(;(l=o[u])!==s&&e.node(l).maxRank<r.rank;)u++;l===s&&(c=!1)}if(!c){for(;u<o.length-1&&e.node(l=o[u+1]).minRank<=r.rank;)u++;l=o[u]}e.setParent(n,l),n=e.successors(n)[0]}}))}},3573:(e,t,n)=>{"use strict";var r=n(8436),i=n(574).Graph,a=n(1138);function o(e,t){var n={};return r.reduce(t,(function(t,i){var a=0,o=0,s=t.length,l=r.last(i);return r.forEach(i,(function(t,c){var f=function(e,t){if(e.node(t).dummy)return r.find(e.predecessors(t),(function(t){return e.node(t).dummy}))}(e,t),d=f?e.node(f).order:s;(f||t===l)&&(r.forEach(i.slice(o,c+1),(function(t){r.forEach(e.predecessors(t),(function(r){var i=e.node(r),o=i.order;!(o<a||d<o)||i.dummy&&e.node(t).dummy||u(n,r,t)}))})),o=c+1,a=d)})),i})),n}function s(e,t){var n={};function i(t,i,a,o,s){var l;r.forEach(r.range(i,a),(function(i){l=t[i],e.node(l).dummy&&r.forEach(e.predecessors(l),(function(t){var r=e.node(t);r.dummy&&(r.order<o||r.order>s)&&u(n,t,l)}))}))}return r.reduce(t,(function(t,n){var a,o=-1,s=0;return r.forEach(n,(function(r,u){if("border"===e.node(r).dummy){var l=e.predecessors(r);l.length&&(a=e.node(l[0]).order,i(n,s,u,o,a),s=u,o=a)}i(n,s,n.length,a,t.length)})),n})),n}function u(e,t,n){if(t>n){var r=t;t=n,n=r}var i=e[t];i||(e[t]=i={}),i[n]=!0}function l(e,t,n){if(t>n){var i=t;t=n,n=i}return r.has(e[t],n)}function c(e,t,n,i){var a={},o={},s={};return r.forEach(t,(function(e){r.forEach(e,(function(e,t){a[e]=e,o[e]=e,s[e]=t}))})),r.forEach(t,(function(e){var t=-1;r.forEach(e,(function(e){var u=i(e);if(u.length)for(var c=((u=r.sortBy(u,(function(e){return s[e]}))).length-1)/2,f=Math.floor(c),d=Math.ceil(c);f<=d;++f){var p=u[f];o[e]===e&&t<s[p]&&!l(n,e,p)&&(o[p]=e,o[e]=a[e]=a[p],t=s[p])}}))})),{root:a,align:o}}function f(e,t,n,a,o){var s={},u=function(e,t,n,a){var o=new i,s=e.graph(),u=function(e,t,n){return function(i,a,o){var s,u=i.node(a),l=i.node(o),c=0;if(c+=u.width/2,r.has(u,"labelpos"))switch(u.labelpos.toLowerCase()){case"l":s=-u.width/2;break;case"r":s=u.width/2}if(s&&(c+=n?s:-s),s=0,c+=(u.dummy?t:e)/2,c+=(l.dummy?t:e)/2,c+=l.width/2,r.has(l,"labelpos"))switch(l.labelpos.toLowerCase()){case"l":s=l.width/2;break;case"r":s=-l.width/2}return s&&(c+=n?s:-s),s=0,c}}(s.nodesep,s.edgesep,a);return r.forEach(t,(function(t){var i;r.forEach(t,(function(t){var r=n[t];if(o.setNode(r),i){var a=n[i],s=o.edge(a,r);o.setEdge(a,r,Math.max(u(e,t,i),s||0))}i=t}))})),o}(e,t,n,o),l=o?"borderLeft":"borderRight";function c(e,t){for(var n=u.nodes(),r=n.pop(),i={};r;)i[r]?e(r):(i[r]=!0,n.push(r),n=n.concat(t(r))),r=n.pop()}return c((function(e){s[e]=u.inEdges(e).reduce((function(e,t){return Math.max(e,s[t.v]+u.edge(t))}),0)}),u.predecessors.bind(u)),c((function(t){var n=u.outEdges(t).reduce((function(e,t){return Math.min(e,s[t.w]-u.edge(t))}),Number.POSITIVE_INFINITY),r=e.node(t);n!==Number.POSITIVE_INFINITY&&r.borderType!==l&&(s[t]=Math.max(s[t],n))}),u.successors.bind(u)),r.forEach(a,(function(e){s[e]=s[n[e]]})),s}function d(e,t){return r.minBy(r.values(t),(function(t){var n=Number.NEGATIVE_INFINITY,i=Number.POSITIVE_INFINITY;return r.forIn(t,(function(t,r){var a=function(e,t){return e.node(t).width}(e,r)/2;n=Math.max(t+a,n),i=Math.min(t-a,i)})),n-i}))}function p(e,t){var n=r.values(t),i=r.min(n),a=r.max(n);r.forEach(["u","d"],(function(n){r.forEach(["l","r"],(function(o){var s,u=n+o,l=e[u];if(l!==t){var c=r.values(l);(s="l"===o?i-r.min(c):a-r.max(c))&&(e[u]=r.mapValues(l,(function(e){return e+s})))}}))}))}function h(e,t){return r.mapValues(e.ul,(function(n,i){if(t)return e[t.toLowerCase()][i];var a=r.sortBy(r.map(e,i));return(a[1]+a[2])/2}))}e.exports={positionX:function(e){var t,n=a.buildLayerMatrix(e),i=r.merge(o(e,n),s(e,n)),u={};r.forEach(["u","d"],(function(a){t="u"===a?n:r.values(n).reverse(),r.forEach(["l","r"],(function(n){"r"===n&&(t=r.map(t,(function(e){return r.values(e).reverse()})));var o=("u"===a?e.predecessors:e.successors).bind(e),s=c(0,t,i,o),l=f(e,t,s.root,s.align,"r"===n);"r"===n&&(l=r.mapValues(l,(function(e){return-e}))),u[a+n]=l}))}));var l=d(e,u);return p(u,l),h(u,e.graph().align)},findType1Conflicts:o,findType2Conflicts:s,addConflict:u,hasConflict:l,verticalAlignment:c,horizontalCompaction:f,alignCoordinates:p,findSmallestWidthAlignment:d,balance:h}},7873:(e,t,n)=>{"use strict";var r=n(8436),i=n(1138),a=n(3573).positionX;e.exports=function(e){(function(e){var t=i.buildLayerMatrix(e),n=e.graph().ranksep,a=0;r.forEach(t,(function(t){var i=r.max(r.map(t,(function(t){return e.node(t).height})));r.forEach(t,(function(t){e.node(t).y=a+i/2})),a+=i+n}))})(e=i.asNonCompoundGraph(e)),r.forEach(a(e),(function(t,n){e.node(n).x=t}))}},300:(e,t,n)=>{"use strict";var r=n(8436),i=n(574).Graph,a=n(6681).slack;function o(e,t){return r.forEach(e.nodes(),(function n(i){r.forEach(t.nodeEdges(i),(function(r){var o=r.v,s=i===o?r.w:o;e.hasNode(s)||a(t,r)||(e.setNode(s,{}),e.setEdge(i,s,{}),n(s))}))})),e.nodeCount()}function s(e,t){return r.minBy(t.edges(),(function(n){if(e.hasNode(n.v)!==e.hasNode(n.w))return a(t,n)}))}function u(e,t,n){r.forEach(e.nodes(),(function(e){t.node(e).rank+=n}))}e.exports=function(e){var t,n,r=new i({directed:!1}),l=e.nodes()[0],c=e.nodeCount();for(r.setNode(l,{});o(r,e)<c;)t=s(r,e),n=r.hasNode(t.v)?a(e,t):-a(e,t),u(r,e,n);return r}},8093:(e,t,n)=>{"use strict";var r=n(6681).longestPath,i=n(300),a=n(2472);e.exports=function(e){switch(e.graph().ranker){case"network-simplex":s(e);break;case"tight-tree":!function(e){r(e),i(e)}(e);break;case"longest-path":o(e);break;default:s(e)}};var o=r;function s(e){a(e)}},2472:(e,t,n)=>{"use strict";var r=n(8436),i=n(300),a=n(6681).slack,o=n(6681).longestPath,s=n(574).alg.preorder,u=n(574).alg.postorder,l=n(1138).simplify;function c(e){e=l(e),o(e);var t,n=i(e);for(p(n),f(n,e);t=m(n);)y(n,e,t,v(n,e,t))}function f(e,t){var n=u(e,e.nodes());n=n.slice(0,n.length-1),r.forEach(n,(function(n){!function(e,t,n){var r=e.node(n).parent;e.edge(n,r).cutvalue=d(e,t,n)}(e,t,n)}))}function d(e,t,n){var i=e.node(n).parent,a=!0,o=t.edge(n,i),s=0;return o||(a=!1,o=t.edge(i,n)),s=o.weight,r.forEach(t.nodeEdges(n),(function(r){var o,u,l=r.v===n,c=l?r.w:r.v;if(c!==i){var f=l===a,d=t.edge(r).weight;if(s+=f?d:-d,o=n,u=c,e.hasEdge(o,u)){var p=e.edge(n,c).cutvalue;s+=f?-p:p}}})),s}function p(e,t){arguments.length<2&&(t=e.nodes()[0]),h(e,{},1,t)}function h(e,t,n,i,a){var o=n,s=e.node(i);return t[i]=!0,r.forEach(e.neighbors(i),(function(a){r.has(t,a)||(n=h(e,t,n,a,i))})),s.low=o,s.lim=n++,a?s.parent=a:delete s.parent,n}function m(e){return r.find(e.edges(),(function(t){return e.edge(t).cutvalue<0}))}function v(e,t,n){var i=n.v,o=n.w;t.hasEdge(i,o)||(i=n.w,o=n.v);var s=e.node(i),u=e.node(o),l=s,c=!1;s.lim>u.lim&&(l=u,c=!0);var f=r.filter(t.edges(),(function(t){return c===g(0,e.node(t.v),l)&&c!==g(0,e.node(t.w),l)}));return r.minBy(f,(function(e){return a(t,e)}))}function y(e,t,n,i){var a=n.v,o=n.w;e.removeEdge(a,o),e.setEdge(i.v,i.w,{}),p(e),f(e,t),function(e,t){var n=r.find(e.nodes(),(function(e){return!t.node(e).parent})),i=s(e,n);i=i.slice(1),r.forEach(i,(function(n){var r=e.node(n).parent,i=t.edge(n,r),a=!1;i||(i=t.edge(r,n),a=!0),t.node(n).rank=t.node(r).rank+(a?i.minlen:-i.minlen)}))}(e,t)}function g(e,t,n){return n.low<=t.lim&&t.lim<=n.lim}e.exports=c,c.initLowLimValues=p,c.initCutValues=f,c.calcCutValue=d,c.leaveEdge=m,c.enterEdge=v,c.exchangeEdges=y},6681:(e,t,n)=>{"use strict";var r=n(8436);e.exports={longestPath:function(e){var t={};r.forEach(e.sources(),(function n(i){var a=e.node(i);if(r.has(t,i))return a.rank;t[i]=!0;var o=r.min(r.map(e.outEdges(i),(function(t){return n(t.w)-e.edge(t).minlen})));return o!==Number.POSITIVE_INFINITY&&null!=o||(o=0),a.rank=o}))},slack:function(e,t){return e.node(t.w).rank-e.node(t.v).rank-e.edge(t).minlen}}},1138:(e,t,n)=>{"use strict";var r=n(8436),i=n(574).Graph;function a(e,t,n,i){var a;do{a=r.uniqueId(i)}while(e.hasNode(a));return n.dummy=t,e.setNode(a,n),a}function o(e){return r.max(r.map(e.nodes(),(function(t){var n=e.node(t).rank;if(!r.isUndefined(n))return n})))}e.exports={addDummyNode:a,simplify:function(e){var t=(new i).setGraph(e.graph());return r.forEach(e.nodes(),(function(n){t.setNode(n,e.node(n))})),r.forEach(e.edges(),(function(n){var r=t.edge(n.v,n.w)||{weight:0,minlen:1},i=e.edge(n);t.setEdge(n.v,n.w,{weight:r.weight+i.weight,minlen:Math.max(r.minlen,i.minlen)})})),t},asNonCompoundGraph:function(e){var t=new i({multigraph:e.isMultigraph()}).setGraph(e.graph());return r.forEach(e.nodes(),(function(n){e.children(n).length||t.setNode(n,e.node(n))})),r.forEach(e.edges(),(function(n){t.setEdge(n,e.edge(n))})),t},successorWeights:function(e){var t=r.map(e.nodes(),(function(t){var n={};return r.forEach(e.outEdges(t),(function(t){n[t.w]=(n[t.w]||0)+e.edge(t).weight})),n}));return r.zipObject(e.nodes(),t)},predecessorWeights:function(e){var t=r.map(e.nodes(),(function(t){var n={};return r.forEach(e.inEdges(t),(function(t){n[t.v]=(n[t.v]||0)+e.edge(t).weight})),n}));return r.zipObject(e.nodes(),t)},intersectRect:function(e,t){var n,r,i=e.x,a=e.y,o=t.x-i,s=t.y-a,u=e.width/2,l=e.height/2;if(!o&&!s)throw new Error("Not possible to find intersection inside of the rectangle");return Math.abs(s)*u>Math.abs(o)*l?(s<0&&(l=-l),n=l*o/s,r=l):(o<0&&(u=-u),n=u,r=u*s/o),{x:i+n,y:a+r}},buildLayerMatrix:function(e){var t=r.map(r.range(o(e)+1),(function(){return[]}));return r.forEach(e.nodes(),(function(n){var i=e.node(n),a=i.rank;r.isUndefined(a)||(t[a][i.order]=n)})),t},normalizeRanks:function(e){var t=r.min(r.map(e.nodes(),(function(t){return e.node(t).rank})));r.forEach(e.nodes(),(function(n){var i=e.node(n);r.has(i,"rank")&&(i.rank-=t)}))},removeEmptyRanks:function(e){var t=r.min(r.map(e.nodes(),(function(t){return e.node(t).rank}))),n=[];r.forEach(e.nodes(),(function(r){var i=e.node(r).rank-t;n[i]||(n[i]=[]),n[i].push(r)}));var i=0,a=e.graph().nodeRankFactor;r.forEach(n,(function(t,n){r.isUndefined(t)&&n%a!=0?--i:i&&r.forEach(t,(function(t){e.node(t).rank+=i}))}))},addBorderNode:function(e,t,n,r){var i={width:0,height:0};return arguments.length>=4&&(i.rank=n,i.order=r),a(e,"border",i,t)},maxRank:o,partition:function(e,t){var n={lhs:[],rhs:[]};return r.forEach(e,(function(e){t(e)?n.lhs.push(e):n.rhs.push(e)})),n},time:function(e,t){var n=r.now();try{return t()}finally{console.log(e+" time: "+(r.now()-n)+"ms")}},notime:function(e,t){return t()}}},8177:e=>{e.exports="0.8.5"},3776:function(e,t,n){var r;!function(i){"use strict";var a,o,s,u=9e15,l=1e9,c="0123456789abcdef",f="2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058",d="3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789",p={precision:20,rounding:4,modulo:1,toExpNeg:-7,toExpPos:21,minE:-u,maxE:u,crypto:!1},h=!0,m="[DecimalError] ",v=m+"Invalid argument: ",y=m+"Precision limit exceeded",g=m+"crypto unavailable",_=Math.floor,b=Math.pow,x=/^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,w=/^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,E=/^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,N=/^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,S=1e7,M=f.length-1,k=d.length-1,O={name:"[object Decimal]"};function C(e){var t,n,r,i=e.length-1,a="",o=e[0];if(i>0){for(a+=o,t=1;t<i;t++)(n=7-(r=e[t]+"").length)&&(a+=q(n)),a+=r;(n=7-(r=(o=e[t])+"").length)&&(a+=q(n))}else if(0===o)return"0";for(;o%10==0;)o/=10;return a+o}function A(e,t,n){if(e!==~~e||e<t||e>n)throw Error(v+e)}function T(e,t,n,r){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=b(10,7-t),s=e[i]%a|0,null==r?t<3?(0==t?s=s/100|0:1==t&&(s=s/10|0),o=n<4&&99999==s||n>3&&49999==s||5e4==s||0==s):o=(n<4&&s+1==a||n>3&&s+1==a/2)&&(e[i+1]/a/100|0)==b(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=(r||n<4)&&9999==s||!r&&n>3&&4999==s):o=((r||n<4)&&s+1==a||!r&&n>3&&s+1==a/2)&&(e[i+1]/a/1e3|0)==b(10,t-3)-1,o}function I(e,t,n){for(var r,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++)),r=0;r<a.length;r++)a[r]>n-1&&(void 0===a[r+1]&&(a[r+1]=0),a[r+1]+=a[r]/n|0,a[r]%=n)}return a.reverse()}O.absoluteValue=O.abs=function(){var e=new this.constructor(this);return e.s<0&&(e.s=1),P(e)},O.ceil=function(){return P(new this.constructor(this),this.e+1,2)},O.comparedTo=O.cmp=function(e){var t,n,r,i,a=this,o=a.d,s=(e=new a.constructor(e)).d,u=a.s,l=e.s;if(!o||!s)return u&&l?u!==l?u:o===s?0:!o^u<0?1:-1:NaN;if(!o[0]||!s[0])return o[0]?u:s[0]?-l:0;if(u!==l)return u;if(a.e!==e.e)return a.e>e.e^u<0?1:-1;for(t=0,n=(r=o.length)<(i=s.length)?r:i;t<n;++t)if(o[t]!==s[t])return o[t]>s[t]^u<0?1:-1;return r===i?0:r>i^u<0?1:-1},O.cosine=O.cos=function(){var e,t,n=this,r=n.constructor;return n.d?n.d[0]?(e=r.precision,t=r.rounding,r.precision=e+Math.max(n.e,n.sd())+7,r.rounding=1,n=function(e,t){var n,r,i=t.d.length;i<32?r=(1/K(4,n=Math.ceil(i/3))).toString():(n=16,r="2.3283064365386962890625e-10"),e.precision+=n,t=V(e,1,t.times(r),new e(1));for(var a=n;a--;){var o=t.times(t);t=o.times(o).minus(o).times(8).plus(1)}return e.precision-=n,t}(r,Y(r,n)),r.precision=e,r.rounding=t,P(2==s||3==s?n.neg():n,e,t,!0)):new r(1):new r(NaN)},O.cubeRoot=O.cbrt=function(){var e,t,n,r,i,a,o,s,u,l,c=this,f=c.constructor;if(!c.isFinite()||c.isZero())return new f(c);for(h=!1,(a=c.s*b(c.s*c,1/3))&&Math.abs(a)!=1/0?r=new f(a.toString()):(n=C(c.d),(a=((e=c.e)-n.length+1)%3)&&(n+=1==a||-2==a?"0":"00"),a=b(n,1/3),e=_((e+1)/3)-(e%3==(e<0?-1:2)),(r=new f(n=a==1/0?"5e"+e:(n=a.toExponential()).slice(0,n.indexOf("e")+1)+e)).s=c.s),o=(e=f.precision)+3;;)if(l=(u=(s=r).times(s).times(s)).plus(c),r=D(l.plus(c).times(s),l.plus(u),o+2,1),C(s.d).slice(0,o)===(n=C(r.d)).slice(0,o)){if("9999"!=(n=n.slice(o-3,o+1))&&(i||"4999"!=n)){+n&&(+n.slice(1)||"5"!=n.charAt(0))||(P(r,e+1,1),t=!r.times(r).times(r).eq(c));break}if(!i&&(P(s,e+1,0),s.times(s).times(s).eq(c))){r=s;break}o+=4,i=1}return h=!0,P(r,e,f.rounding,t)},O.decimalPlaces=O.dp=function(){var e,t=this.d,n=NaN;if(t){if(n=7*((e=t.length-1)-_(this.e/7)),e=t[e])for(;e%10==0;e/=10)n--;n<0&&(n=0)}return n},O.dividedBy=O.div=function(e){return D(this,new this.constructor(e))},O.dividedToIntegerBy=O.divToInt=function(e){var t=this.constructor;return P(D(this,new t(e),0,1,1),t.precision,t.rounding)},O.equals=O.eq=function(e){return 0===this.cmp(e)},O.floor=function(){return P(new this.constructor(this),this.e+1,3)},O.greaterThan=O.gt=function(e){return this.cmp(e)>0},O.greaterThanOrEqualTo=O.gte=function(e){var t=this.cmp(e);return 1==t||0===t},O.hyperbolicCosine=O.cosh=function(){var e,t,n,r,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;n=o.precision,r=o.rounding,o.precision=n+Math.max(a.e,a.sd())+4,o.rounding=1,(i=a.d.length)<32?t=(1/K(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,l=e,c=new o(8);l--;)u=a.times(a),a=s.minus(u.times(c.minus(u.times(c))));return P(a,o.precision=n,o.rounding=r,!0)},O.hyperbolicSine=O.sinh=function(){var e,t,n,r,i=this,a=i.constructor;if(!i.isFinite()||i.isZero())return new a(i);if(t=a.precision,n=a.rounding,a.precision=t+Math.max(i.e,i.sd())+4,a.rounding=1,(r=i.d.length)<3)i=V(a,2,i,i,!0);else{e=(e=1.4*Math.sqrt(r))>16?16:0|e,i=V(a,2,i=i.times(1/K(5,e)),i,!0);for(var o,s=new a(5),u=new a(16),l=new a(20);e--;)o=i.times(i),i=i.times(s.plus(o.times(u.times(o).plus(l))))}return a.precision=t,a.rounding=n,P(i,t,n,!0)},O.hyperbolicTangent=O.tanh=function(){var e,t,n=this,r=n.constructor;return n.isFinite()?n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+7,r.rounding=1,D(n.sinh(),n.cosh(),r.precision=e,r.rounding=t)):new r(n.s)},O.inverseCosine=O.acos=function(){var e,t=this,n=t.constructor,r=t.abs().cmp(1),i=n.precision,a=n.rounding;return-1!==r?0===r?t.isNeg()?B(n,i,a):new n(0):new n(NaN):t.isZero()?B(n,i+4,a).times(.5):(n.precision=i+6,n.rounding=1,t=t.asin(),e=B(n,i+4,a).times(.5),n.precision=i,n.rounding=a,e.minus(t))},O.inverseHyperbolicCosine=O.acosh=function(){var e,t,n=this,r=n.constructor;return n.lte(1)?new r(n.eq(1)?0:NaN):n.isFinite()?(e=r.precision,t=r.rounding,r.precision=e+Math.max(Math.abs(n.e),n.sd())+4,r.rounding=1,h=!1,n=n.times(n).minus(1).sqrt().plus(n),h=!0,r.precision=e,r.rounding=t,n.ln()):new r(n)},O.inverseHyperbolicSine=O.asinh=function(){var e,t,n=this,r=n.constructor;return!n.isFinite()||n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+2*Math.max(Math.abs(n.e),n.sd())+6,r.rounding=1,h=!1,n=n.times(n).plus(1).sqrt().plus(n),h=!0,r.precision=e,r.rounding=t,n.ln())},O.inverseHyperbolicTangent=O.atanh=function(){var e,t,n,r,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,r=i.sd(),Math.max(r,e)<2*-i.e-1?P(new a(i),e,t,!0):(a.precision=n=r-i.e,i=D(i.plus(1),new a(1).minus(i),n+e,1),a.precision=e+4,a.rounding=1,i=i.ln(),a.precision=e,a.rounding=t,i.times(.5))):new a(NaN)},O.inverseSine=O.asin=function(){var e,t,n,r,i=this,a=i.constructor;return i.isZero()?new a(i):(t=i.abs().cmp(1),n=a.precision,r=a.rounding,-1!==t?0===t?((e=B(a,n+4,r).times(.5)).s=i.s,e):new a(NaN):(a.precision=n+6,a.rounding=1,i=i.div(new a(1).minus(i.times(i)).sqrt().plus(1)).atan(),a.precision=n,a.rounding=r,i.times(2)))},O.inverseTangent=O.atan=function(){var e,t,n,r,i,a,o,s,u,l=this,c=l.constructor,f=c.precision,d=c.rounding;if(l.isFinite()){if(l.isZero())return new c(l);if(l.abs().eq(1)&&f+4<=k)return(o=B(c,f+4,d).times(.25)).s=l.s,o}else{if(!l.s)return new c(NaN);if(f+4<=k)return(o=B(c,f+4,d).times(.5)).s=l.s,o}for(c.precision=s=f+10,c.rounding=1,e=n=Math.min(28,s/7+2|0);e;--e)l=l.div(l.times(l).plus(1).sqrt().plus(1));for(h=!1,t=Math.ceil(s/7),r=1,u=l.times(l),o=new c(l),i=l;-1!==e;)if(i=i.times(u),a=o.minus(i.div(r+=2)),i=i.times(u),void 0!==(o=a.plus(i.div(r+=2))).d[t])for(e=t;o.d[e]===a.d[e]&&e--;);return n&&(o=o.times(2<<n-1)),h=!0,P(o,c.precision=f,c.rounding=d,!0)},O.isFinite=function(){return!!this.d},O.isInteger=O.isInt=function(){return!!this.d&&_(this.e/7)>this.d.length-2},O.isNaN=function(){return!this.s},O.isNegative=O.isNeg=function(){return this.s<0},O.isPositive=O.isPos=function(){return this.s>0},O.isZero=function(){return!!this.d&&0===this.d[0]},O.lessThan=O.lt=function(e){return this.cmp(e)<0},O.lessThanOrEqualTo=O.lte=function(e){return this.cmp(e)<1},O.logarithm=O.log=function(e){var t,n,r,i,a,o,s,u,l=this,c=l.constructor,f=c.precision,d=c.rounding;if(null==e)e=new c(10),t=!0;else{if(n=(e=new c(e)).d,e.s<0||!n||!n[0]||e.eq(1))return new c(NaN);t=e.eq(10)}if(n=l.d,l.s<0||!n||!n[0]||l.eq(1))return new c(n&&!n[0]?-1/0:1!=l.s?NaN:n?0:1/0);if(t)if(n.length>1)a=!0;else{for(i=n[0];i%10==0;)i/=10;a=1!==i}if(h=!1,o=W(l,s=f+5),r=t?L(c,s+10):W(e,s),T((u=D(o,r,s,1)).d,i=f,d))do{if(o=W(l,s+=10),r=t?L(c,s+10):W(e,s),u=D(o,r,s,1),!a){+C(u.d).slice(i+1,i+15)+1==1e14&&(u=P(u,f+1,0));break}}while(T(u.d,i+=10,d));return h=!0,P(u,f,d)},O.minus=O.sub=function(e){var t,n,r,i,a,o,s,u,l,c,f,d,p=this,m=p.constructor;if(e=new m(e),!p.d||!e.d)return p.s&&e.s?p.d?e.s=-e.s:e=new m(e.d||p.s!==e.s?p:NaN):e=new m(NaN),e;if(p.s!=e.s)return e.s=-e.s,p.plus(e);if(l=p.d,d=e.d,s=m.precision,u=m.rounding,!l[0]||!d[0]){if(d[0])e.s=-e.s;else{if(!l[0])return new m(3===u?-0:0);e=new m(p)}return h?P(e,s,u):e}if(n=_(e.e/7),c=_(p.e/7),l=l.slice(),a=c-n){for((f=a<0)?(t=l,a=-a,o=d.length):(t=d,n=c,o=l.length),a>(r=Math.max(Math.ceil(s/7),o)+2)&&(a=r,t.length=1),t.reverse(),r=a;r--;)t.push(0);t.reverse()}else{for((f=(r=l.length)<(o=d.length))&&(o=r),r=0;r<o;r++)if(l[r]!=d[r]){f=l[r]<d[r];break}a=0}for(f&&(t=l,l=d,d=t,e.s=-e.s),o=l.length,r=d.length-o;r>0;--r)l[o++]=0;for(r=d.length;r>a;){if(l[--r]<d[r]){for(i=r;i&&0===l[--i];)l[i]=S-1;--l[i],l[r]+=S}l[r]-=d[r]}for(;0===l[--o];)l.pop();for(;0===l[0];l.shift())--n;return l[0]?(e.d=l,e.e=R(l,n),h?P(e,s,u):e):new m(3===u?-0:0)},O.modulo=O.mod=function(e){var t,n=this,r=n.constructor;return e=new r(e),!n.d||!e.s||e.d&&!e.d[0]?new r(NaN):!e.d||n.d&&!n.d[0]?P(new r(n),r.precision,r.rounding):(h=!1,9==r.modulo?(t=D(n,e.abs(),0,3,1)).s*=e.s:t=D(n,e,0,r.modulo,1),t=t.times(e),h=!0,n.minus(t))},O.naturalExponential=O.exp=function(){return Z(this)},O.naturalLogarithm=O.ln=function(){return W(this)},O.negated=O.neg=function(){var e=new this.constructor(this);return e.s=-e.s,P(e)},O.plus=O.add=function(e){var t,n,r,i,a,o,s,u,l,c,f=this,d=f.constructor;if(e=new d(e),!f.d||!e.d)return f.s&&e.s?f.d||(e=new d(e.d||f.s===e.s?f:NaN)):e=new d(NaN),e;if(f.s!=e.s)return e.s=-e.s,f.minus(e);if(l=f.d,c=e.d,s=d.precision,u=d.rounding,!l[0]||!c[0])return c[0]||(e=new d(f)),h?P(e,s,u):e;if(a=_(f.e/7),r=_(e.e/7),l=l.slice(),i=a-r){for(i<0?(n=l,i=-i,o=c.length):(n=c,r=a,o=l.length),i>(o=(a=Math.ceil(s/7))>o?a+1:o+1)&&(i=o,n.length=1),n.reverse();i--;)n.push(0);n.reverse()}for((o=l.length)-(i=c.length)<0&&(i=o,n=c,c=l,l=n),t=0;i;)t=(l[--i]=l[i]+c[i]+t)/S|0,l[i]%=S;for(t&&(l.unshift(t),++r),o=l.length;0==l[--o];)l.pop();return e.d=l,e.e=R(l,r),h?P(e,s,u):e},O.precision=O.sd=function(e){var t,n=this;if(void 0!==e&&e!==!!e&&1!==e&&0!==e)throw Error(v+e);return n.d?(t=U(n.d),e&&n.e+1>t&&(t=n.e+1)):t=NaN,t},O.round=function(){var e=this,t=e.constructor;return P(new t(e),e.e+1,t.rounding)},O.sine=O.sin=function(){var e,t,n=this,r=n.constructor;return n.isFinite()?n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+Math.max(n.e,n.sd())+7,r.rounding=1,n=function(e,t){var n,r=t.d.length;if(r<3)return V(e,2,t,t);n=(n=1.4*Math.sqrt(r))>16?16:0|n,t=V(e,2,t=t.times(1/K(5,n)),t);for(var i,a=new e(5),o=new e(16),s=new e(20);n--;)i=t.times(t),t=t.times(a.plus(i.times(o.times(i).minus(s))));return t}(r,Y(r,n)),r.precision=e,r.rounding=t,P(s>2?n.neg():n,e,t,!0)):new r(NaN)},O.squareRoot=O.sqrt=function(){var e,t,n,r,i,a,o=this,s=o.d,u=o.e,l=o.s,c=o.constructor;if(1!==l||!s||!s[0])return new c(!l||l<0&&(!s||s[0])?NaN:s?o:1/0);for(h=!1,0==(l=Math.sqrt(+o))||l==1/0?(((t=C(s)).length+u)%2==0&&(t+="0"),l=Math.sqrt(t),u=_((u+1)/2)-(u<0||u%2),r=new c(t=l==1/0?"5e"+u:(t=l.toExponential()).slice(0,t.indexOf("e")+1)+u)):r=new c(l.toString()),n=(u=c.precision)+3;;)if(r=(a=r).plus(D(o,a,n+2,1)).times(.5),C(a.d).slice(0,n)===(t=C(r.d)).slice(0,n)){if("9999"!=(t=t.slice(n-3,n+1))&&(i||"4999"!=t)){+t&&(+t.slice(1)||"5"!=t.charAt(0))||(P(r,u+1,1),e=!r.times(r).eq(o));break}if(!i&&(P(a,u+1,0),a.times(a).eq(o))){r=a;break}n+=4,i=1}return h=!0,P(r,u,c.rounding,e)},O.tangent=O.tan=function(){var e,t,n=this,r=n.constructor;return n.isFinite()?n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+10,r.rounding=1,(n=n.sin()).s=1,n=D(n,new r(1).minus(n.times(n)).sqrt(),e+10,0),r.precision=e,r.rounding=t,P(2==s||4==s?n.neg():n,e,t,!0)):new r(NaN)},O.times=O.mul=function(e){var t,n,r,i,a,o,s,u,l,c=this,f=c.constructor,d=c.d,p=(e=new f(e)).d;if(e.s*=c.s,!(d&&d[0]&&p&&p[0]))return new f(!e.s||d&&!d[0]&&!p||p&&!p[0]&&!d?NaN:d&&p?0*e.s:e.s/0);for(n=_(c.e/7)+_(e.e/7),(u=d.length)<(l=p.length)&&(a=d,d=p,p=a,o=u,u=l,l=o),a=[],r=o=u+l;r--;)a.push(0);for(r=l;--r>=0;){for(t=0,i=u+r;i>r;)s=a[i]+p[r]*d[i-r-1]+t,a[i--]=s%S|0,t=s/S|0;a[i]=(a[i]+t)%S|0}for(;!a[--o];)a.pop();return t?++n:a.shift(),e.d=a,e.e=R(a,n),h?P(e,f.precision,f.rounding):e},O.toBinary=function(e,t){return X(this,2,e,t)},O.toDecimalPlaces=O.toDP=function(e,t){var n=this,r=n.constructor;return n=new r(n),void 0===e?n:(A(e,0,l),void 0===t?t=r.rounding:A(t,0,8),P(n,e+n.e+1,t))},O.toExponential=function(e,t){var n,r=this,i=r.constructor;return void 0===e?n=j(r,!0):(A(e,0,l),void 0===t?t=i.rounding:A(t,0,8),n=j(r=P(new i(r),e+1,t),!0,e+1)),r.isNeg()&&!r.isZero()?"-"+n:n},O.toFixed=function(e,t){var n,r,i=this,a=i.constructor;return void 0===e?n=j(i):(A(e,0,l),void 0===t?t=a.rounding:A(t,0,8),n=j(r=P(new a(i),e+i.e+1,t),!1,e+r.e+1)),i.isNeg()&&!i.isZero()?"-"+n:n},O.toFraction=function(e){var t,n,r,i,a,o,s,u,l,c,f,d,p=this,m=p.d,y=p.constructor;if(!m)return new y(p);if(l=n=new y(1),r=u=new y(0),o=(a=(t=new y(r)).e=U(m)-p.e-1)%7,t.d[0]=b(10,o<0?7+o:o),null==e)e=a>0?t:l;else{if(!(s=new y(e)).isInt()||s.lt(l))throw Error(v+s);e=s.gt(t)?a>0?t:l:s}for(h=!1,s=new y(C(m)),c=y.precision,y.precision=a=7*m.length*2;f=D(s,t,0,1,1),1!=(i=n.plus(f.times(r))).cmp(e);)n=r,r=i,i=l,l=u.plus(f.times(i)),u=i,i=t,t=s.minus(f.times(i)),s=i;return i=D(e.minus(n),r,0,1,1),u=u.plus(i.times(l)),n=n.plus(i.times(r)),u.s=l.s=p.s,d=D(l,r,a,1).minus(p).abs().cmp(D(u,n,a,1).minus(p).abs())<1?[l,r]:[u,n],y.precision=c,h=!0,d},O.toHexadecimal=O.toHex=function(e,t){return X(this,16,e,t)},O.toNearest=function(e,t){var n=this,r=n.constructor;if(n=new r(n),null==e){if(!n.d)return n;e=new r(1),t=r.rounding}else{if(e=new r(e),void 0===t?t=r.rounding:A(t,0,8),!n.d)return e.s?n:e;if(!e.d)return e.s&&(e.s=n.s),e}return e.d[0]?(h=!1,n=D(n,e,0,t,1).times(e),h=!0,P(n)):(e.s=n.s,n=e),n},O.toNumber=function(){return+this},O.toOctal=function(e,t){return X(this,8,e,t)},O.toPower=O.pow=function(e){var t,n,r,i,a,o,s=this,u=s.constructor,l=+(e=new u(e));if(!(s.d&&e.d&&s.d[0]&&e.d[0]))return new u(b(+s,l));if((s=new u(s)).eq(1))return s;if(r=u.precision,a=u.rounding,e.eq(1))return P(s,r,a);if((t=_(e.e/7))>=e.d.length-1&&(n=l<0?-l:l)<=9007199254740991)return i=z(u,s,n,r),e.s<0?new u(1).div(i):P(i,r,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!=(n=b(+s,l))&&isFinite(n)?new u(n+"").e:_(l*(Math.log("0."+C(s.d))/Math.LN10+s.e+1)))>u.maxE+1||t<u.minE-1?new u(t>0?o/0:0):(h=!1,u.rounding=s.s=1,n=Math.min(12,(t+"").length),(i=Z(e.times(W(s,r+n)),r)).d&&T((i=P(i,r+5,1)).d,r,a)&&(t=r+10,+C((i=P(Z(e.times(W(s,t+n)),t),t+5,1)).d).slice(r+1,r+15)+1==1e14&&(i=P(i,r+1,0))),i.s=o,h=!0,u.rounding=a,P(i,r,a))},O.toPrecision=function(e,t){var n,r=this,i=r.constructor;return void 0===e?n=j(r,r.e<=i.toExpNeg||r.e>=i.toExpPos):(A(e,1,l),void 0===t?t=i.rounding:A(t,0,8),n=j(r=P(new i(r),e,t),e<=r.e||r.e<=i.toExpNeg,e)),r.isNeg()&&!r.isZero()?"-"+n:n},O.toSignificantDigits=O.toSD=function(e,t){var n=this.constructor;return void 0===e?(e=n.precision,t=n.rounding):(A(e,1,l),void 0===t?t=n.rounding:A(t,0,8)),P(new n(this),e,t)},O.toString=function(){var e=this,t=e.constructor,n=j(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()&&!e.isZero()?"-"+n:n},O.truncated=O.trunc=function(){return P(new this.constructor(this),this.e+1,1)},O.valueOf=O.toJSON=function(){var e=this,t=e.constructor,n=j(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()?"-"+n:n};var D=function(){function e(e,t,n){var r,i=0,a=e.length;for(e=e.slice();a--;)r=e[a]*t+i,e[a]=r%n|0,i=r/n|0;return i&&e.unshift(i),e}function t(e,t,n,r){var i,a;if(n!=r)a=n>r?1:-1;else for(i=a=0;i<n;i++)if(e[i]!=t[i]){a=e[i]>t[i]?1:-1;break}return a}function n(e,t,n,r){for(var i=0;n--;)e[n]-=i,i=e[n]<t[n]?1:0,e[n]=i*r+e[n]-t[n];for(;!e[0]&&e.length>1;)e.shift()}return function(r,i,a,s,u,l){var c,f,d,p,h,m,v,y,g,b,x,w,E,N,M,k,O,C,A,T,I=r.constructor,D=r.s==i.s?1:-1,j=r.d,R=i.d;if(!(j&&j[0]&&R&&R[0]))return new I(r.s&&i.s&&(j?!R||j[0]!=R[0]:R)?j&&0==j[0]||!R?0*D:D/0:NaN);for(l?(h=1,f=r.e-i.e):(l=S,h=7,f=_(r.e/h)-_(i.e/h)),A=R.length,O=j.length,b=(g=new I(D)).d=[],d=0;R[d]==(j[d]||0);d++);if(R[d]>(j[d]||0)&&f--,null==a?(N=a=I.precision,s=I.rounding):N=u?a+(r.e-i.e)+1:a,N<0)b.push(1),m=!0;else{if(N=N/h+2|0,d=0,1==A){for(p=0,R=R[0],N++;(d<O||p)&&N--;d++)M=p*l+(j[d]||0),b[d]=M/R|0,p=M%R|0;m=p||d<O}else{for((p=l/(R[0]+1)|0)>1&&(R=e(R,p,l),j=e(j,p,l),A=R.length,O=j.length),k=A,w=(x=j.slice(0,A)).length;w<A;)x[w++]=0;(T=R.slice()).unshift(0),C=R[0],R[1]>=l/2&&++C;do{p=0,(c=t(R,x,A,w))<0?(E=x[0],A!=w&&(E=E*l+(x[1]||0)),(p=E/C|0)>1?(p>=l&&(p=l-1),1==(c=t(v=e(R,p,l),x,y=v.length,w=x.length))&&(p--,n(v,A<y?T:R,y,l))):(0==p&&(c=p=1),v=R.slice()),(y=v.length)<w&&v.unshift(0),n(x,v,w,l),-1==c&&(c=t(R,x,A,w=x.length))<1&&(p++,n(x,A<w?T:R,w,l)),w=x.length):0===c&&(p++,x=[0]),b[d++]=p,c&&x[0]?x[w++]=j[k]||0:(x=[j[k]],w=1)}while((k++<O||void 0!==x[0])&&N--);m=void 0!==x[0]}b[0]||b.shift()}if(1==h)g.e=f,o=m;else{for(d=1,p=b[0];p>=10;p/=10)d++;g.e=d+f*h-1,P(g,u?a+g.e+1:a,s,m)}return g}}();function P(e,t,n,r){var i,a,o,s,u,l,c,f,d,p=e.constructor;e:if(null!=t){if(!(f=e.d))return e;for(i=1,s=f[0];s>=10;s/=10)i++;if((a=t-i)<0)a+=7,o=t,u=(c=f[d=0])/b(10,i-o-1)%10|0;else if((d=Math.ceil((a+1)/7))>=(s=f.length)){if(!r)break e;for(;s++<=d;)f.push(0);c=u=0,i=1,o=(a%=7)-7+1}else{for(c=s=f[d],i=1;s>=10;s/=10)i++;u=(o=(a%=7)-7+i)<0?0:c/b(10,i-o-1)%10|0}if(r=r||t<0||void 0!==f[d+1]||(o<0?c:c%b(10,i-o-1)),l=n<4?(u||r)&&(0==n||n==(e.s<0?3:2)):u>5||5==u&&(4==n||r||6==n&&(a>0?o>0?c/b(10,i-o):0:f[d-1])%10&1||n==(e.s<0?8:7)),t<1||!f[0])return f.length=0,l?(t-=e.e+1,f[0]=b(10,(7-t%7)%7),e.e=-t||0):f[0]=e.e=0,e;if(0==a?(f.length=d,s=1,d--):(f.length=d+1,s=b(10,7-a),f[d]=o>0?(c/b(10,i-o)%b(10,o)|0)*s:0),l)for(;;){if(0==d){for(a=1,o=f[0];o>=10;o/=10)a++;for(o=f[0]+=s,s=1;o>=10;o/=10)s++;a!=s&&(e.e++,f[0]==S&&(f[0]=1));break}if(f[d]+=s,f[d]!=S)break;f[d--]=0,s=1}for(a=f.length;0===f[--a];)f.pop()}return h&&(e.e>p.maxE?(e.d=null,e.e=NaN):e.e<p.minE&&(e.e=0,e.d=[0])),e}function j(e,t,n){if(!e.isFinite())return G(e);var r,i=e.e,a=C(e.d),o=a.length;return t?(n&&(r=n-o)>0?a=a.charAt(0)+"."+a.slice(1)+q(r):o>1&&(a=a.charAt(0)+"."+a.slice(1)),a=a+(e.e<0?"e":"e+")+e.e):i<0?(a="0."+q(-i-1)+a,n&&(r=n-o)>0&&(a+=q(r))):i>=o?(a+=q(i+1-o),n&&(r=n-i-1)>0&&(a=a+"."+q(r))):((r=i+1)<o&&(a=a.slice(0,r)+"."+a.slice(r)),n&&(r=n-o)>0&&(i+1===o&&(a+="."),a+=q(r))),a}function R(e,t){var n=e[0];for(t*=7;n>=10;n/=10)t++;return t}function L(e,t,n){if(t>M)throw h=!0,n&&(e.precision=n),Error(y);return P(new e(f),t,1,!0)}function B(e,t,n){if(t>k)throw Error(y);return P(new e(d),t,n,!0)}function U(e){var t=e.length-1,n=7*t+1;if(t=e[t]){for(;t%10==0;t/=10)n--;for(t=e[0];t>=10;t/=10)n++}return n}function q(e){for(var t="";e--;)t+="0";return t}function z(e,t,n,r){var i,a=new e(1),o=Math.ceil(r/7+4);for(h=!1;;){if(n%2&&Q((a=a.times(t)).d,o)&&(i=!0),0===(n=_(n/2))){n=a.d.length-1,i&&0===a.d[n]&&++a.d[n];break}Q((t=t.times(t)).d,o)}return h=!0,a}function F(e){return 1&e.d[e.d.length-1]}function H(e,t,n){for(var r,i=new e(t[0]),a=0;++a<t.length;){if(!(r=new e(t[a])).s){i=r;break}i[n](r)&&(i=r)}return i}function Z(e,t){var n,r,i,a,o,s,u,l=0,c=0,f=0,d=e.constructor,p=d.rounding,m=d.precision;if(!e.d||!e.d[0]||e.e>17)return new d(e.d?e.d[0]?e.s<0?0:1/0:1:e.s?e.s<0?0:e:NaN);for(null==t?(h=!1,u=m):u=t,s=new d(.03125);e.e>-2;)e=e.times(s),f+=5;for(u+=r=Math.log(b(2,f))/Math.LN10*2+5|0,n=a=o=new d(1),d.precision=u;;){if(a=P(a.times(e),u,1),n=n.times(++c),C((s=o.plus(D(a,n,u,1))).d).slice(0,u)===C(o.d).slice(0,u)){for(i=f;i--;)o=P(o.times(o),u,1);if(null!=t)return d.precision=m,o;if(!(l<3&&T(o.d,u-r,p,l)))return P(o,d.precision=m,p,h=!0);d.precision=u+=10,n=a=s=new d(1),c=0,l++}o=s}}function W(e,t){var n,r,i,a,o,s,u,l,c,f,d,p=1,m=e,v=m.d,y=m.constructor,g=y.rounding,_=y.precision;if(m.s<0||!v||!v[0]||!m.e&&1==v[0]&&1==v.length)return new y(v&&!v[0]?-1/0:1!=m.s?NaN:v?0:m);if(null==t?(h=!1,c=_):c=t,y.precision=c+=10,r=(n=C(v)).charAt(0),!(Math.abs(a=m.e)<15e14))return l=L(y,c+2,_).times(a+""),m=W(new y(r+"."+n.slice(1)),c-10).plus(l),y.precision=_,null==t?P(m,_,g,h=!0):m;for(;r<7&&1!=r||1==r&&n.charAt(1)>3;)r=(n=C((m=m.times(e)).d)).charAt(0),p++;for(a=m.e,r>1?(m=new y("0."+n),a++):m=new y(r+"."+n.slice(1)),f=m,u=o=m=D(m.minus(1),m.plus(1),c,1),d=P(m.times(m),c,1),i=3;;){if(o=P(o.times(d),c,1),C((l=u.plus(D(o,new y(i),c,1))).d).slice(0,c)===C(u.d).slice(0,c)){if(u=u.times(2),0!==a&&(u=u.plus(L(y,c+2,_).times(a+""))),u=D(u,new y(p),c,1),null!=t)return y.precision=_,u;if(!T(u.d,c-10,g,s))return P(u,y.precision=_,g,h=!0);y.precision=c+=10,l=o=m=D(f.minus(1),f.plus(1),c,1),d=P(m.times(m),c,1),i=s=1}u=l,i+=2}}function G(e){return String(e.s*e.s/0)}function J(e,t){var n,r,i;for((n=t.indexOf("."))>-1&&(t=t.replace(".","")),(r=t.search(/e/i))>0?(n<0&&(n=r),n+=+t.slice(r+1),t=t.substring(0,r)):n<0&&(n=t.length),r=0;48===t.charCodeAt(r);r++);for(i=t.length;48===t.charCodeAt(i-1);--i);if(t=t.slice(r,i)){if(i-=r,e.e=n=n-r-1,e.d=[],r=(n+1)%7,n<0&&(r+=7),r<i){for(r&&e.d.push(+t.slice(0,r)),i-=7;r<i;)e.d.push(+t.slice(r,r+=7));r=7-(t=t.slice(r)).length}else r-=i;for(;r--;)t+="0";e.d.push(+t),h&&(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 $(e,t){var n,r,i,o,s,u,l,c,f;if("Infinity"===t||"NaN"===t)return+t||(e.s=NaN),e.e=NaN,e.d=null,e;if(w.test(t))n=16,t=t.toLowerCase();else if(x.test(t))n=2;else{if(!E.test(t))throw Error(v+t);n=8}for((o=t.search(/p/i))>0?(l=+t.slice(o+1),t=t.substring(2,o)):t=t.slice(2),s=(o=t.indexOf("."))>=0,r=e.constructor,s&&(o=(u=(t=t.replace(".","")).length)-o,i=z(r,new r(n),o,2*o)),o=f=(c=I(t,n,S)).length-1;0===c[o];--o)c.pop();return o<0?new r(0*e.s):(e.e=R(c,f),e.d=c,h=!1,s&&(e=D(e,i,4*u)),l&&(e=e.times(Math.abs(l)<54?b(2,l):a.pow(2,l))),h=!0,e)}function V(e,t,n,r,i){var a,o,s,u,l=e.precision,c=Math.ceil(l/7);for(h=!1,u=n.times(n),s=new e(r);;){if(o=D(s.times(u),new e(t++*t++),l,1),s=i?r.plus(o):r.minus(o),r=D(o.times(u),new e(t++*t++),l,1),void 0!==(o=s.plus(r)).d[c]){for(a=c;o.d[a]===s.d[a]&&a--;);if(-1==a)break}a=s,s=r,r=o,o=a}return h=!0,o.d.length=c+1,o}function K(e,t){for(var n=e;--t;)n*=e;return n}function Y(e,t){var n,r=t.s<0,i=B(e,e.precision,1),a=i.times(.5);if((t=t.abs()).lte(a))return s=r?4:1,t;if((n=t.divToInt(i)).isZero())s=r?3:2;else{if((t=t.minus(n.times(i))).lte(a))return s=F(n)?r?2:3:r?4:1,t;s=F(n)?r?1:4:r?3:2}return t.minus(i).abs()}function X(e,t,n,r){var i,a,s,u,f,d,p,h,m,v=e.constructor,y=void 0!==n;if(y?(A(n,1,l),void 0===r?r=v.rounding:A(r,0,8)):(n=v.precision,r=v.rounding),e.isFinite()){for(y?(i=2,16==t?n=4*n-3:8==t&&(n=3*n-2)):i=t,(s=(p=j(e)).indexOf("."))>=0&&(p=p.replace(".",""),(m=new v(1)).e=p.length-s,m.d=I(j(m),10,i),m.e=m.d.length),a=f=(h=I(p,10,i)).length;0==h[--f];)h.pop();if(h[0]){if(s<0?a--:((e=new v(e)).d=h,e.e=a,h=(e=D(e,m,n,r,0,i)).d,a=e.e,d=o),s=h[n],u=i/2,d=d||void 0!==h[n+1],d=r<4?(void 0!==s||d)&&(0===r||r===(e.s<0?3:2)):s>u||s===u&&(4===r||d||6===r&&1&h[n-1]||r===(e.s<0?8:7)),h.length=n,d)for(;++h[--n]>i-1;)h[n]=0,n||(++a,h.unshift(1));for(f=h.length;!h[f-1];--f);for(s=0,p="";s<f;s++)p+=c.charAt(h[s]);if(y){if(f>1)if(16==t||8==t){for(s=16==t?4:3,--f;f%s;f++)p+="0";for(f=(h=I(p,i,t)).length;!h[f-1];--f);for(s=1,p="1.";s<f;s++)p+=c.charAt(h[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=y?"0p+0":"0";p=(16==t?"0x":2==t?"0b":8==t?"0o":"")+p}else p=G(e);return e.s<0?"-"+p:p}function Q(e,t){if(e.length>t)return e.length=t,!0}function ee(e){return new this(e).abs()}function te(e){return new this(e).acos()}function ne(e){return new this(e).acosh()}function re(e,t){return new this(e).plus(t)}function ie(e){return new this(e).asin()}function ae(e){return new this(e).asinh()}function oe(e){return new this(e).atan()}function se(e){return new this(e).atanh()}function ue(e,t){e=new this(e),t=new this(t);var n,r=this.precision,i=this.rounding,a=r+4;return e.s&&t.s?e.d||t.d?!t.d||e.isZero()?(n=t.s<0?B(this,r,i):new this(0)).s=e.s:!e.d||t.isZero()?(n=B(this,a,1).times(.5)).s=e.s:t.s<0?(this.precision=a,this.rounding=1,n=this.atan(D(e,t,a,1)),t=B(this,a,1),this.precision=r,this.rounding=i,n=e.s<0?n.minus(t):n.plus(t)):n=this.atan(D(e,t,a,1)):(n=B(this,a,1).times(t.s>0?.25:.75)).s=e.s:n=new this(NaN),n}function le(e){return new this(e).cbrt()}function ce(e){return P(e=new this(e),e.e+1,2)}function fe(e){if(!e||"object"!=typeof e)throw Error(m+"Object expected");var t,n,r,i=!0===e.defaults,a=["precision",1,l,"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(n=a[t],i&&(this[n]=p[n]),void 0!==(r=e[n])){if(!(_(r)===r&&r>=a[t+1]&&r<=a[t+2]))throw Error(v+n+": "+r);this[n]=r}if(n="crypto",i&&(this[n]=p[n]),void 0!==(r=e[n])){if(!0!==r&&!1!==r&&0!==r&&1!==r)throw Error(v+n+": "+r);if(r){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw Error(g);this[n]=!0}else this[n]=!1}return this}function de(e){return new this(e).cos()}function pe(e){return new this(e).cosh()}function he(e,t){return new this(e).div(t)}function me(e){return new this(e).exp()}function ve(e){return P(e=new this(e),e.e+1,3)}function ye(){var e,t,n=new this(0);for(h=!1,e=0;e<arguments.length;)if((t=new this(arguments[e++])).d)n.d&&(n=n.plus(t.times(t)));else{if(t.s)return h=!0,new this(1/0);n=t}return h=!0,n.sqrt()}function ge(e){return e instanceof a||e&&"[object Decimal]"===e.name||!1}function _e(e){return new this(e).ln()}function be(e,t){return new this(e).log(t)}function xe(e){return new this(e).log(2)}function we(e){return new this(e).log(10)}function Ee(){return H(this,arguments,"lt")}function Ne(){return H(this,arguments,"gt")}function Se(e,t){return new this(e).mod(t)}function Me(e,t){return new this(e).mul(t)}function ke(e,t){return new this(e).pow(t)}function Oe(e){var t,n,r,i,a=0,o=new this(1),s=[];if(void 0===e?e=this.precision:A(e,1,l),r=Math.ceil(e/7),this.crypto)if(crypto.getRandomValues)for(t=crypto.getRandomValues(new Uint32Array(r));a<r;)(i=t[a])>=429e7?t[a]=crypto.getRandomValues(new Uint32Array(1))[0]:s[a++]=i%1e7;else{if(!crypto.randomBytes)throw Error(g);for(t=crypto.randomBytes(r*=4);a<r;)(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=r/4}else for(;a<r;)s[a++]=1e7*Math.random()|0;for(e%=7,(r=s[--a])&&e&&(i=b(10,7-e),s[a]=(r/i|0)*i);0===s[a];a--)s.pop();if(a<0)n=0,s=[0];else{for(n=-1;0===s[0];n-=7)s.shift();for(r=1,i=s[0];i>=10;i/=10)r++;r<7&&(n-=7-r)}return o.e=n,o.d=s,o}function Ce(e){return P(e=new this(e),e.e+1,this.rounding)}function Ae(e){return(e=new this(e)).d?e.d[0]?e.s:0*e.s:e.s||NaN}function Te(e){return new this(e).sin()}function Ie(e){return new this(e).sinh()}function De(e){return new this(e).sqrt()}function Pe(e,t){return new this(e).sub(t)}function je(e){return new this(e).tan()}function Re(e){return new this(e).tanh()}function Le(e){return P(e=new this(e),e.e+1,1)}(a=function e(t){var n,r,i;function a(e){var t,n,r,i=this;if(!(i instanceof a))return new a(e);if(i.constructor=a,e instanceof a)return i.s=e.s,void(h?!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"==(r=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,n=e;n>=10;n/=10)t++;return void(h?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)):J(i,e.toString())}if("string"!==r)throw Error(v+e);return 45===(n=e.charCodeAt(0))?(e=e.slice(1),i.s=-1):(43===n&&(e=e.slice(1)),i.s=1),N.test(e)?J(i,e):$(i,e)}if(a.prototype=O,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=fe,a.clone=e,a.isDecimal=ge,a.abs=ee,a.acos=te,a.acosh=ne,a.add=re,a.asin=ie,a.asinh=ae,a.atan=oe,a.atanh=se,a.atan2=ue,a.cbrt=le,a.ceil=ce,a.cos=de,a.cosh=pe,a.div=he,a.exp=me,a.floor=ve,a.hypot=ye,a.ln=_e,a.log=be,a.log10=we,a.log2=xe,a.max=Ee,a.min=Ne,a.mod=Se,a.mul=Me,a.pow=ke,a.random=Oe,a.round=Ce,a.sign=Ae,a.sin=Te,a.sinh=Ie,a.sqrt=De,a.sub=Pe,a.tan=je,a.tanh=Re,a.trunc=Le,void 0===t&&(t={}),t&&!0!==t.defaults)for(i=["precision","rounding","toExpNeg","toExpPos","maxE","minE","modulo","crypto"],n=0;n<i.length;)t.hasOwnProperty(r=i[n++])||(t[r]=this[r]);return a.config(t),a}(p)).default=a.Decimal=a,f=new a(f),d=new a(d),void 0===(r=function(){return a}.call(t,n,t,e))||(e.exports=r)}()},7928:e=>{"use strict";var t=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e},n={"{":"\\{","}":"\\}","\\":"\\textbackslash{}","#":"\\#",$:"\\$","%":"\\%","&":"\\&","^":"\\textasciicircum{}",_:"\\_","~":"\\textasciitilde{}"},r={"–":"\\--","—":"\\---"," ":"~","\t":"\\qquad{}","\r\n":"\\newline{}","\n":"\\newline{}"},i=function(e,n){return t({},e,n)};e.exports=function(e){for(var a=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},o=a.preserveFormatting,s=void 0!==o&&o,u=a.escapeMapFn,l=void 0===u?i:u,c=String(e),f="",d=l(t({},n),s?t({},r):{}),p=Object.keys(d),h=function(){var e=!1;p.forEach((function(t,n){e||c.length>=t.length&&c.slice(0,t.length)===t&&(f+=d[p[n]],c=c.slice(t.length,c.length),e=!0)})),e||(f+=c.slice(0,1),c=c.slice(1,c.length))};c;)h();return f}},5628:function(e,t){var n;!function(r){"use strict";var i={s:1,n:0,d:1};function a(e){function t(){var t=Error.apply(this,arguments);t.name=this.name=e,this.stack=t.stack,this.message=t.message}function n(){}return n.prototype=Error.prototype,t.prototype=new n,t}var o=d.DivisionByZero=a("DivisionByZero"),s=d.InvalidParameter=a("InvalidParameter");function u(e,t){return isNaN(e=parseInt(e,10))&&l(),e*t}function l(){throw new s}var c=function(e,t){var n,r=0,a=1,s=1,c=0,f=0,d=0,p=1,h=1,m=0,v=1,y=1,g=1,_=1e7;if(null==e);else if(void 0!==t)s=(r=e)*(a=t);else switch(typeof e){case"object":"d"in e&&"n"in e?(r=e.n,a=e.d,"s"in e&&(r*=e.s)):0 in e?(r=e[0],1 in e&&(a=e[1])):l(),s=r*a;break;case"number":if(e<0&&(s=e,e=-e),e%1==0)r=e;else if(e>0){for(e>=1&&(e/=h=Math.pow(10,Math.floor(1+Math.log(e)/Math.LN10)));v<=_&&g<=_;){if(e===(n=(m+y)/(v+g))){v+g<=_?(r=m+y,a=v+g):g>v?(r=y,a=g):(r=m,a=v);break}e>n?(m+=y,v+=g):(y+=m,g+=v),v>_?(r=y,a=g):(r=m,a=v)}r*=h}else(isNaN(e)||isNaN(t))&&(a=r=NaN);break;case"string":if(null===(v=e.match(/\d+|./g))&&l(),"-"===v[m]?(s=-1,m++):"+"===v[m]&&m++,v.length===m+1?f=u(v[m++],s):"."===v[m+1]||"."===v[m]?("."!==v[m]&&(c=u(v[m++],s)),(1+ ++m===v.length||"("===v[m+1]&&")"===v[m+3]||"'"===v[m+1]&&"'"===v[m+3])&&(f=u(v[m],s),p=Math.pow(10,v[m].length),m++),("("===v[m]&&")"===v[m+2]||"'"===v[m]&&"'"===v[m+2])&&(d=u(v[m+1],s),h=Math.pow(10,v[m+1].length)-1,m+=3)):"/"===v[m+1]||":"===v[m+1]?(f=u(v[m],s),p=u(v[m+2],1),m+=3):"/"===v[m+3]&&" "===v[m+1]&&(c=u(v[m],s),f=u(v[m+2],s),p=u(v[m+4],1),m+=5),v.length<=m){s=r=d+(a=p*h)*c+h*f;break}default:l()}if(0===a)throw new o;i.s=s<0?-1:1,i.n=Math.abs(r),i.d=Math.abs(a)};function f(e,t){if(!e)return t;if(!t)return e;for(;;){if(!(e%=t))return t;if(!(t%=e))return e}}function d(e,t){if(!(this instanceof d))return new d(e,t);c(e,t),e=d.REDUCE?f(i.d,i.n):1,this.s=i.s,this.n=i.n/e,this.d=i.d/e}d.REDUCE=1,d.prototype={s:1,n:0,d:1,abs:function(){return new d(this.n,this.d)},neg:function(){return new d(-this.s*this.n,this.d)},add:function(e,t){return c(e,t),new d(this.s*this.n*i.d+i.s*this.d*i.n,this.d*i.d)},sub:function(e,t){return c(e,t),new d(this.s*this.n*i.d-i.s*this.d*i.n,this.d*i.d)},mul:function(e,t){return c(e,t),new d(this.s*i.s*this.n*i.n,this.d*i.d)},div:function(e,t){return c(e,t),new d(this.s*i.s*this.n*i.d,this.d*i.n)},clone:function(){return new d(this)},mod:function(e,t){return isNaN(this.n)||isNaN(this.d)?new d(NaN):void 0===e?new d(this.s*this.n%this.d,1):(c(e,t),0===i.n&&0===this.d&&d(0,0),new d(this.s*(i.d*this.n)%(i.n*this.d),i.d*this.d))},gcd:function(e,t){return c(e,t),new d(f(i.n,this.n)*f(i.d,this.d),i.d*this.d)},lcm:function(e,t){return c(e,t),0===i.n&&0===this.n?new d:new d(i.n*this.n,f(i.n,this.n)*f(i.d,this.d))},ceil:function(e){return e=Math.pow(10,e||0),isNaN(this.n)||isNaN(this.d)?new d(NaN):new d(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 d(NaN):new d(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 d(NaN):new d(Math.round(e*this.s*this.n/this.d),e)},inverse:function(){return new d(this.s*this.d,this.n)},pow:function(e){return e<0?new d(Math.pow(this.s*this.d,-e),Math.pow(this.n,-e)):new d(Math.pow(this.s*this.n,e),Math.pow(this.d,e))},equals:function(e,t){return c(e,t),this.s*this.n*i.d==i.s*i.n*this.d},compare:function(e,t){c(e,t);var n=this.s*this.n*i.d-i.s*i.n*this.d;return(0<n)-(n<0)},simplify:function(e){if(isNaN(this.n)||isNaN(this.d))return this;var t=this.abs().toContinued();function n(e){return 1===e.length?new d(e[0]):n(e.slice(1)).inverse().add(e[0])}e=e||.001;for(var r=0;r<t.length;r++){var i=n(t.slice(0,r+1));if(i.sub(this.abs()).abs().valueOf()<e)return i.mul(this.s)}return this},divisible:function(e,t){return c(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,n="",r=this.n,i=this.d;return this.s<0&&(n+="-"),1===i?n+=r:(e&&(t=Math.floor(r/i))>0&&(n+=t,n+=" ",r%=i),n+=r,n+="/",n+=i),n},toLatex:function(e){var t,n="",r=this.n,i=this.d;return this.s<0&&(n+="-"),1===i?n+=r:(e&&(t=Math.floor(r/i))>0&&(n+=t,r%=i),n+="\\frac{",n+=r,n+="}{",n+=i,n+="}"),n},toContinued:function(){var e,t=this.n,n=this.d,r=[];if(isNaN(t)||isNaN(n))return r;do{r.push(Math.floor(t/n)),e=t%n,t=n,n=e}while(1!==t);return r},toString:function(e){var t,n=this.n,r=this.d;if(isNaN(n)||isNaN(r))return"NaN";d.REDUCE||(n/=t=f(n,r),r/=t),e=e||15;var i=function(e,t){for(;t%2==0;t/=2);for(;t%5==0;t/=5);if(1===t)return 0;for(var n=10%t,r=1;1!==n;r++)if(n=10*n%t,r>2e3)return 0;return r}(0,r),a=function(e,t,n){for(var r=1,i=function(e,t,n){for(var r=1;t>0;e=e*e%n,t>>=1)1&t&&(r=r*e%n);return r}(10,n,t),a=0;a<300;a++){if(r===i)return a;r=10*r%t,i=10*i%t}return 0}(0,r,i),o=-1===this.s?"-":"";if(o+=n/r|0,n%=r,(n*=10)&&(o+="."),i){for(var s=a;s--;)o+=n/r|0,n%=r,n*=10;for(o+="(",s=i;s--;)o+=n/r|0,n%=r,n*=10;o+=")"}else for(s=e;n&&s--;)o+=n/r|0,n%=r,n*=10;return o}},void 0===(n=function(){return d}.apply(t,[]))||(e.exports=n)}()},8282:(e,t,n)=>{var r=n(2354);e.exports={Graph:r.Graph,json:n(8974),alg:n(2440),version:r.version}},2842:(e,t,n)=>{var r=n(9126);e.exports=function(e){var t,n={},i=[];function a(i){r.has(n,i)||(n[i]=!0,t.push(i),r.each(e.successors(i),a),r.each(e.predecessors(i),a))}return r.each(e.nodes(),(function(e){t=[],a(e),t.length&&i.push(t)})),i}},3984:(e,t,n)=>{var r=n(9126);function i(e,t,n,a,o,s){r.has(a,t)||(a[t]=!0,n||s.push(t),r.each(o(t),(function(t){i(e,t,n,a,o,s)})),n&&s.push(t))}e.exports=function(e,t,n){r.isArray(t)||(t=[t]);var a=(e.isDirected()?e.successors:e.neighbors).bind(e),o=[],s={};return r.each(t,(function(t){if(!e.hasNode(t))throw new Error("Graph does not have node: "+t);i(e,t,"post"===n,s,a,o)})),o}},4847:(e,t,n)=>{var r=n(3763),i=n(9126);e.exports=function(e,t,n){return i.transform(e.nodes(),(function(i,a){i[a]=r(e,a,t,n)}),{})}},3763:(e,t,n)=>{var r=n(9126),i=n(9675);e.exports=function(e,t,n,r){return function(e,t,n,r){var a,o,s={},u=new i,l=function(e){var t=e.v!==a?e.v:e.w,r=s[t],i=n(e),l=o.distance+i;if(i<0)throw new Error("dijkstra does not allow negative edge weights. Bad edge: "+e+" Weight: "+i);l<r.distance&&(r.distance=l,r.predecessor=a,u.decrease(t,l))};for(e.nodes().forEach((function(e){var n=e===t?0:Number.POSITIVE_INFINITY;s[e]={distance:n},u.add(e,n)}));u.size()>0&&(a=u.removeMin(),(o=s[a]).distance!==Number.POSITIVE_INFINITY);)r(a).forEach(l);return s}(e,String(t),n||a,r||function(t){return e.outEdges(t)})};var a=r.constant(1)},9096:(e,t,n)=>{var r=n(9126),i=n(5023);e.exports=function(e){return r.filter(i(e),(function(t){return t.length>1||1===t.length&&e.hasEdge(t[0],t[0])}))}},8924:(e,t,n)=>{var r=n(9126);e.exports=function(e,t,n){return function(e,t,n){var r={},i=e.nodes();return i.forEach((function(e){r[e]={},r[e][e]={distance:0},i.forEach((function(t){e!==t&&(r[e][t]={distance:Number.POSITIVE_INFINITY})})),n(e).forEach((function(n){var i=n.v===e?n.w:n.v,a=t(n);r[e][i]={distance:a,predecessor:e}}))})),i.forEach((function(e){var t=r[e];i.forEach((function(n){var a=r[n];i.forEach((function(n){var r=a[e],i=t[n],o=a[n],s=r.distance+i.distance;s<o.distance&&(o.distance=s,o.predecessor=i.predecessor)}))}))})),r}(e,t||i,n||function(t){return e.outEdges(t)})};var i=r.constant(1)},2440:(e,t,n)=>{e.exports={components:n(2842),dijkstra:n(3763),dijkstraAll:n(4847),findCycles:n(9096),floydWarshall:n(8924),isAcyclic:n(2707),postorder:n(8828),preorder:n(2648),prim:n(514),tarjan:n(5023),topsort:n(2166)}},2707:(e,t,n)=>{var r=n(2166);e.exports=function(e){try{r(e)}catch(e){if(e instanceof r.CycleException)return!1;throw e}return!0}},8828:(e,t,n)=>{var r=n(3984);e.exports=function(e,t){return r(e,t,"post")}},2648:(e,t,n)=>{var r=n(3984);e.exports=function(e,t){return r(e,t,"pre")}},514:(e,t,n)=>{var r=n(9126),i=n(771),a=n(9675);e.exports=function(e,t){var n,o=new i,s={},u=new a;function l(e){var r=e.v===n?e.w:e.v,i=u.priority(r);if(void 0!==i){var a=t(e);a<i&&(s[r]=n,u.decrease(r,a))}}if(0===e.nodeCount())return o;r.each(e.nodes(),(function(e){u.add(e,Number.POSITIVE_INFINITY),o.setNode(e)})),u.decrease(e.nodes()[0],0);for(var c=!1;u.size()>0;){if(n=u.removeMin(),r.has(s,n))o.setEdge(n,s[n]);else{if(c)throw new Error("Input graph is not connected: "+e);c=!0}e.nodeEdges(n).forEach(l)}return o}},5023:(e,t,n)=>{var r=n(9126);e.exports=function(e){var t=0,n=[],i={},a=[];function o(s){var u=i[s]={onStack:!0,lowlink:t,index:t++};if(n.push(s),e.successors(s).forEach((function(e){r.has(i,e)?i[e].onStack&&(u.lowlink=Math.min(u.lowlink,i[e].index)):(o(e),u.lowlink=Math.min(u.lowlink,i[e].lowlink))})),u.lowlink===u.index){var l,c=[];do{l=n.pop(),i[l].onStack=!1,c.push(l)}while(s!==l);a.push(c)}}return e.nodes().forEach((function(e){r.has(i,e)||o(e)})),a}},2166:(e,t,n)=>{var r=n(9126);function i(e){var t={},n={},i=[];if(r.each(e.sinks(),(function o(s){if(r.has(n,s))throw new a;r.has(t,s)||(n[s]=!0,t[s]=!0,r.each(e.predecessors(s),o),delete n[s],i.push(s))})),r.size(t)!==e.nodeCount())throw new a;return i}function a(){}e.exports=i,i.CycleException=a,a.prototype=new Error},9675:(e,t,n)=>{var r=n(9126);function i(){this._arr=[],this._keyIndices={}}e.exports=i,i.prototype.size=function(){return this._arr.length},i.prototype.keys=function(){return this._arr.map((function(e){return e.key}))},i.prototype.has=function(e){return r.has(this._keyIndices,e)},i.prototype.priority=function(e){var t=this._keyIndices[e];if(void 0!==t)return this._arr[t].priority},i.prototype.min=function(){if(0===this.size())throw new Error("Queue underflow");return this._arr[0].key},i.prototype.add=function(e,t){var n=this._keyIndices;if(e=String(e),!r.has(n,e)){var i=this._arr,a=i.length;return n[e]=a,i.push({key:e,priority:t}),this._decrease(a),!0}return!1},i.prototype.removeMin=function(){this._swap(0,this._arr.length-1);var e=this._arr.pop();return delete this._keyIndices[e.key],this._heapify(0),e.key},i.prototype.decrease=function(e,t){var n=this._keyIndices[e];if(t>this._arr[n].priority)throw new Error("New priority is greater than current priority. Key: "+e+" Old: "+this._arr[n].priority+" New: "+t);this._arr[n].priority=t,this._decrease(n)},i.prototype._heapify=function(e){var t=this._arr,n=2*e,r=n+1,i=e;n<t.length&&(i=t[n].priority<t[i].priority?n:i,r<t.length&&(i=t[r].priority<t[i].priority?r:i),i!==e&&(this._swap(e,i),this._heapify(i)))},i.prototype._decrease=function(e){for(var t,n=this._arr,r=n[e].priority;0!==e&&!(n[t=e>>1].priority<r);)this._swap(e,t),e=t},i.prototype._swap=function(e,t){var n=this._arr,r=this._keyIndices,i=n[e],a=n[t];n[e]=a,n[t]=i,r[a.key]=e,r[i.key]=t}},771:(e,t,n)=>{"use strict";var r=n(9126);e.exports=a;var i="\0";function a(e){this._isDirected=!r.has(e,"directed")||e.directed,this._isMultigraph=!!r.has(e,"multigraph")&&e.multigraph,this._isCompound=!!r.has(e,"compound")&&e.compound,this._label=void 0,this._defaultNodeLabelFn=r.constant(void 0),this._defaultEdgeLabelFn=r.constant(void 0),this._nodes={},this._isCompound&&(this._parent={},this._children={},this._children["\0"]={}),this._in={},this._preds={},this._out={},this._sucs={},this._edgeObjs={},this._edgeLabels={}}function o(e,t){e[t]?e[t]++:e[t]=1}function s(e,t){--e[t]||delete e[t]}function u(e,t,n,i){var a=""+t,o=""+n;if(!e&&a>o){var s=a;a=o,o=s}return a+"
"+o+"
"+(r.isUndefined(i)?"\0":i)}function l(e,t,n,r){var i=""+t,a=""+n;if(!e&&i>a){var o=i;i=a,a=o}var s={v:i,w:a};return r&&(s.name=r),s}function c(e,t){return u(e,t.v,t.w,t.name)}a.prototype._nodeCount=0,a.prototype._edgeCount=0,a.prototype.isDirected=function(){return this._isDirected},a.prototype.isMultigraph=function(){return this._isMultigraph},a.prototype.isCompound=function(){return this._isCompound},a.prototype.setGraph=function(e){return this._label=e,this},a.prototype.graph=function(){return this._label},a.prototype.setDefaultNodeLabel=function(e){return r.isFunction(e)||(e=r.constant(e)),this._defaultNodeLabelFn=e,this},a.prototype.nodeCount=function(){return this._nodeCount},a.prototype.nodes=function(){return r.keys(this._nodes)},a.prototype.sources=function(){var e=this;return r.filter(this.nodes(),(function(t){return r.isEmpty(e._in[t])}))},a.prototype.sinks=function(){var e=this;return r.filter(this.nodes(),(function(t){return r.isEmpty(e._out[t])}))},a.prototype.setNodes=function(e,t){var n=arguments,i=this;return r.each(e,(function(e){n.length>1?i.setNode(e,t):i.setNode(e)})),this},a.prototype.setNode=function(e,t){return r.has(this._nodes,e)?(arguments.length>1&&(this._nodes[e]=t),this):(this._nodes[e]=arguments.length>1?t:this._defaultNodeLabelFn(e),this._isCompound&&(this._parent[e]=i,this._children[e]={},this._children["\0"][e]=!0),this._in[e]={},this._preds[e]={},this._out[e]={},this._sucs[e]={},++this._nodeCount,this)},a.prototype.node=function(e){return this._nodes[e]},a.prototype.hasNode=function(e){return r.has(this._nodes,e)},a.prototype.removeNode=function(e){var t=this;if(r.has(this._nodes,e)){var n=function(e){t.removeEdge(t._edgeObjs[e])};delete this._nodes[e],this._isCompound&&(this._removeFromParentsChildList(e),delete this._parent[e],r.each(this.children(e),(function(e){t.setParent(e)})),delete this._children[e]),r.each(r.keys(this._in[e]),n),delete this._in[e],delete this._preds[e],r.each(r.keys(this._out[e]),n),delete this._out[e],delete this._sucs[e],--this._nodeCount}return this},a.prototype.setParent=function(e,t){if(!this._isCompound)throw new Error("Cannot set parent in a non-compound graph");if(r.isUndefined(t))t=i;else{for(var n=t+="";!r.isUndefined(n);n=this.parent(n))if(n===e)throw new Error("Setting "+t+" as parent of "+e+" would create a cycle");this.setNode(t)}return this.setNode(e),this._removeFromParentsChildList(e),this._parent[e]=t,this._children[t][e]=!0,this},a.prototype._removeFromParentsChildList=function(e){delete this._children[this._parent[e]][e]},a.prototype.parent=function(e){if(this._isCompound){var t=this._parent[e];if(t!==i)return t}},a.prototype.children=function(e){if(r.isUndefined(e)&&(e=i),this._isCompound){var t=this._children[e];if(t)return r.keys(t)}else{if(e===i)return this.nodes();if(this.hasNode(e))return[]}},a.prototype.predecessors=function(e){var t=this._preds[e];if(t)return r.keys(t)},a.prototype.successors=function(e){var t=this._sucs[e];if(t)return r.keys(t)},a.prototype.neighbors=function(e){var t=this.predecessors(e);if(t)return r.union(t,this.successors(e))},a.prototype.isLeaf=function(e){return 0===(this.isDirected()?this.successors(e):this.neighbors(e)).length},a.prototype.filterNodes=function(e){var t=new this.constructor({directed:this._isDirected,multigraph:this._isMultigraph,compound:this._isCompound});t.setGraph(this.graph());var n=this;r.each(this._nodes,(function(n,r){e(r)&&t.setNode(r,n)})),r.each(this._edgeObjs,(function(e){t.hasNode(e.v)&&t.hasNode(e.w)&&t.setEdge(e,n.edge(e))}));var i={};function a(e){var r=n.parent(e);return void 0===r||t.hasNode(r)?(i[e]=r,r):r in i?i[r]:a(r)}return this._isCompound&&r.each(t.nodes(),(function(e){t.setParent(e,a(e))})),t},a.prototype.setDefaultEdgeLabel=function(e){return r.isFunction(e)||(e=r.constant(e)),this._defaultEdgeLabelFn=e,this},a.prototype.edgeCount=function(){return this._edgeCount},a.prototype.edges=function(){return r.values(this._edgeObjs)},a.prototype.setPath=function(e,t){var n=this,i=arguments;return r.reduce(e,(function(e,r){return i.length>1?n.setEdge(e,r,t):n.setEdge(e,r),r})),this},a.prototype.setEdge=function(){var e,t,n,i,a=!1,s=arguments[0];"object"==typeof s&&null!==s&&"v"in s?(e=s.v,t=s.w,n=s.name,2===arguments.length&&(i=arguments[1],a=!0)):(e=s,t=arguments[1],n=arguments[3],arguments.length>2&&(i=arguments[2],a=!0)),e=""+e,t=""+t,r.isUndefined(n)||(n=""+n);var c=u(this._isDirected,e,t,n);if(r.has(this._edgeLabels,c))return a&&(this._edgeLabels[c]=i),this;if(!r.isUndefined(n)&&!this._isMultigraph)throw new Error("Cannot set a named edge when isMultigraph = false");this.setNode(e),this.setNode(t),this._edgeLabels[c]=a?i:this._defaultEdgeLabelFn(e,t,n);var f=l(this._isDirected,e,t,n);return e=f.v,t=f.w,Object.freeze(f),this._edgeObjs[c]=f,o(this._preds[t],e),o(this._sucs[e],t),this._in[t][c]=f,this._out[e][c]=f,this._edgeCount++,this},a.prototype.edge=function(e,t,n){var r=1===arguments.length?c(this._isDirected,arguments[0]):u(this._isDirected,e,t,n);return this._edgeLabels[r]},a.prototype.hasEdge=function(e,t,n){var i=1===arguments.length?c(this._isDirected,arguments[0]):u(this._isDirected,e,t,n);return r.has(this._edgeLabels,i)},a.prototype.removeEdge=function(e,t,n){var r=1===arguments.length?c(this._isDirected,arguments[0]):u(this._isDirected,e,t,n),i=this._edgeObjs[r];return i&&(e=i.v,t=i.w,delete this._edgeLabels[r],delete this._edgeObjs[r],s(this._preds[t],e),s(this._sucs[e],t),delete this._in[t][r],delete this._out[e][r],this._edgeCount--),this},a.prototype.inEdges=function(e,t){var n=this._in[e];if(n){var i=r.values(n);return t?r.filter(i,(function(e){return e.v===t})):i}},a.prototype.outEdges=function(e,t){var n=this._out[e];if(n){var i=r.values(n);return t?r.filter(i,(function(e){return e.w===t})):i}},a.prototype.nodeEdges=function(e,t){var n=this.inEdges(e,t);if(n)return n.concat(this.outEdges(e,t))}},2354:(e,t,n)=>{e.exports={Graph:n(771),version:n(9631)}},8974:(e,t,n)=>{var r=n(9126),i=n(771);function a(e){return r.map(e.nodes(),(function(t){var n=e.node(t),i=e.parent(t),a={v:t};return r.isUndefined(n)||(a.value=n),r.isUndefined(i)||(a.parent=i),a}))}function o(e){return r.map(e.edges(),(function(t){var n=e.edge(t),i={v:t.v,w:t.w};return r.isUndefined(t.name)||(i.name=t.name),r.isUndefined(n)||(i.value=n),i}))}e.exports={write:function(e){var t={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:a(e),edges:o(e)};return r.isUndefined(e.graph())||(t.value=r.clone(e.graph())),t},read:function(e){var t=new i(e.options).setGraph(e.value);return r.each(e.nodes,(function(e){t.setNode(e.v,e.value),e.parent&&t.setParent(e.v,e.parent)})),r.each(e.edges,(function(e){t.setEdge({v:e.v,w:e.w,name:e.name},e.value)})),t}}},9126:(e,t,n)=>{var r;try{r={clone:n(6678),constant:n(5703),each:n(6073),filter:n(3105),has:n(8721),isArray:n(1469),isEmpty:n(1609),isFunction:n(3560),isUndefined:n(2353),keys:n(3674),map:n(5161),reduce:n(4061),size:n(4238),transform:n(8718),union:n(3386),values:n(2628)}}catch(e){}r||(r=window._),e.exports=r},9631:e=>{e.exports="2.1.8"},3228:e=>{e.exports=function e(t,n){"use strict";var r,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,l=/^0/,c=function(t){return e.insensitive&&(""+t).toLowerCase()||""+t},f=c(t).replace(o,"")||"",d=c(n).replace(o,"")||"",p=f.replace(a,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),h=d.replace(a,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),m=parseInt(f.match(u),16)||1!==p.length&&f.match(s)&&Date.parse(f),v=parseInt(d.match(u),16)||m&&d.match(s)&&Date.parse(d)||null;if(v){if(m<v)return-1;if(m>v)return 1}for(var y=0,g=Math.max(p.length,h.length);y<g;y++){if(r=!(p[y]||"").match(l)&&parseFloat(p[y])||p[y]||0,i=!(h[y]||"").match(l)&&parseFloat(h[y])||h[y]||0,isNaN(r)!==isNaN(i))return isNaN(r)?1:-1;if(typeof r!=typeof i&&(r+="",i+=""),r<i)return-1;if(r>i)return 1}return 0}},8552:(e,t,n)=>{var r=n(852)(n(5639),"DataView");e.exports=r},1989:(e,t,n)=>{var r=n(1789),i=n(401),a=n(7667),o=n(1327),s=n(1866);function u(e){var t=-1,n=null==e?0:e.length;for(this.clear();++t<n;){var r=e[t];this.set(r[0],r[1])}}u.prototype.clear=r,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,e.exports=u},8407:(e,t,n)=>{var r=n(7040),i=n(4125),a=n(2117),o=n(7518),s=n(4705);function u(e){var t=-1,n=null==e?0:e.length;for(this.clear();++t<n;){var r=e[t];this.set(r[0],r[1])}}u.prototype.clear=r,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,e.exports=u},7071:(e,t,n)=>{var r=n(852)(n(5639),"Map");e.exports=r},3369:(e,t,n)=>{var r=n(4785),i=n(1285),a=n(6e3),o=n(9916),s=n(5265);function u(e){var t=-1,n=null==e?0:e.length;for(this.clear();++t<n;){var r=e[t];this.set(r[0],r[1])}}u.prototype.clear=r,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,e.exports=u},3818:(e,t,n)=>{var r=n(852)(n(5639),"Promise");e.exports=r},8525:(e,t,n)=>{var r=n(852)(n(5639),"Set");e.exports=r},8668:(e,t,n)=>{var r=n(3369),i=n(619),a=n(2385);function o(e){var t=-1,n=null==e?0:e.length;for(this.__data__=new r;++t<n;)this.add(e[t])}o.prototype.add=o.prototype.push=i,o.prototype.has=a,e.exports=o},6384:(e,t,n)=>{var r=n(8407),i=n(7465),a=n(3779),o=n(7599),s=n(4758),u=n(4309);function l(e){var t=this.__data__=new r(e);this.size=t.size}l.prototype.clear=i,l.prototype.delete=a,l.prototype.get=o,l.prototype.has=s,l.prototype.set=u,e.exports=l},2705:(e,t,n)=>{var r=n(5639).Symbol;e.exports=r},1149:(e,t,n)=>{var r=n(5639).Uint8Array;e.exports=r},577:(e,t,n)=>{var r=n(852)(n(5639),"WeakMap");e.exports=r},6874:e=>{e.exports=function(e,t,n){switch(n.length){case 0:return e.call(t);case 1:return e.call(t,n[0]);case 2:return e.call(t,n[0],n[1]);case 3:return e.call(t,n[0],n[1],n[2])}return e.apply(t,n)}},7412:e=>{e.exports=function(e,t){for(var n=-1,r=null==e?0:e.length;++n<r&&!1!==t(e[n],n,e););return e}},4963:e=>{e.exports=function(e,t){for(var n=-1,r=null==e?0:e.length,i=0,a=[];++n<r;){var o=e[n];t(o,n,e)&&(a[i++]=o)}return a}},7443:(e,t,n)=>{var r=n(2118);e.exports=function(e,t){return!(null==e||!e.length)&&r(e,t,0)>-1}},1196:e=>{e.exports=function(e,t,n){for(var r=-1,i=null==e?0:e.length;++r<i;)if(n(t,e[r]))return!0;return!1}},4636:(e,t,n)=>{var r=n(2545),i=n(5694),a=n(1469),o=n(4144),s=n(5776),u=n(6719),l=Object.prototype.hasOwnProperty;e.exports=function(e,t){var n=a(e),c=!n&&i(e),f=!n&&!c&&o(e),d=!n&&!c&&!f&&u(e),p=n||c||f||d,h=p?r(e.length,String):[],m=h.length;for(var v in e)!t&&!l.call(e,v)||p&&("length"==v||f&&("offset"==v||"parent"==v)||d&&("buffer"==v||"byteLength"==v||"byteOffset"==v)||s(v,m))||h.push(v);return h}},9932:e=>{e.exports=function(e,t){for(var n=-1,r=null==e?0:e.length,i=Array(r);++n<r;)i[n]=t(e[n],n,e);return i}},2488:e=>{e.exports=function(e,t){for(var n=-1,r=t.length,i=e.length;++n<r;)e[i+n]=t[n];return e}},2663:e=>{e.exports=function(e,t,n,r){var i=-1,a=null==e?0:e.length;for(r&&a&&(n=e[++i]);++i<a;)n=t(n,e[i],i,e);return n}},2908:e=>{e.exports=function(e,t){for(var n=-1,r=null==e?0:e.length;++n<r;)if(t(e[n],n,e))return!0;return!1}},8983:(e,t,n)=>{var r=n(371)("length");e.exports=r},6556:(e,t,n)=>{var r=n(9465),i=n(7813);e.exports=function(e,t,n){(void 0!==n&&!i(e[t],n)||void 0===n&&!(t in e))&&r(e,t,n)}},4865:(e,t,n)=>{var r=n(9465),i=n(7813),a=Object.prototype.hasOwnProperty;e.exports=function(e,t,n){var o=e[t];a.call(e,t)&&i(o,n)&&(void 0!==n||t in e)||r(e,t,n)}},8470:(e,t,n)=>{var r=n(7813);e.exports=function(e,t){for(var n=e.length;n--;)if(r(e[n][0],t))return n;return-1}},4037:(e,t,n)=>{var r=n(8363),i=n(3674);e.exports=function(e,t){return e&&r(t,i(t),e)}},3886:(e,t,n)=>{var r=n(8363),i=n(1704);e.exports=function(e,t){return e&&r(t,i(t),e)}},9465:(e,t,n)=>{var r=n(8777);e.exports=function(e,t,n){"__proto__"==t&&r?r(e,t,{configurable:!0,enumerable:!0,value:n,writable:!0}):e[t]=n}},5990:(e,t,n)=>{var r=n(6384),i=n(7412),a=n(4865),o=n(4037),s=n(3886),u=n(4626),l=n(278),c=n(8805),f=n(1911),d=n(8234),p=n(6904),h=n(4160),m=n(3824),v=n(9148),y=n(8517),g=n(1469),_=n(4144),b=n(6688),x=n(3218),w=n(2928),E=n(3674),N=n(1704),S="[object Arguments]",M="[object Function]",k="[object Object]",O={};O[S]=O["[object Array]"]=O["[object ArrayBuffer]"]=O["[object DataView]"]=O["[object Boolean]"]=O["[object Date]"]=O["[object Float32Array]"]=O["[object Float64Array]"]=O["[object Int8Array]"]=O["[object Int16Array]"]=O["[object Int32Array]"]=O["[object Map]"]=O["[object Number]"]=O[k]=O["[object RegExp]"]=O["[object Set]"]=O["[object String]"]=O["[object Symbol]"]=O["[object Uint8Array]"]=O["[object Uint8ClampedArray]"]=O["[object Uint16Array]"]=O["[object Uint32Array]"]=!0,O["[object Error]"]=O[M]=O["[object WeakMap]"]=!1,e.exports=function e(t,n,C,A,T,I){var D,P=1&n,j=2&n,R=4&n;if(C&&(D=T?C(t,A,T,I):C(t)),void 0!==D)return D;if(!x(t))return t;var L=g(t);if(L){if(D=m(t),!P)return l(t,D)}else{var B=h(t),U=B==M||"[object GeneratorFunction]"==B;if(_(t))return u(t,P);if(B==k||B==S||U&&!T){if(D=j||U?{}:y(t),!P)return j?f(t,s(D,t)):c(t,o(D,t))}else{if(!O[B])return T?t:{};D=v(t,B,P)}}I||(I=new r);var q=I.get(t);if(q)return q;I.set(t,D),w(t)?t.forEach((function(r){D.add(e(r,n,C,r,t,I))})):b(t)&&t.forEach((function(r,i){D.set(i,e(r,n,C,i,t,I))}));var z=L?void 0:(R?j?p:d:j?N:E)(t);return i(z||t,(function(r,i){z&&(r=t[i=r]),a(D,i,e(r,n,C,i,t,I))})),D}},3118:(e,t,n)=>{var r=n(3218),i=Object.create,a=function(){function e(){}return function(t){if(!r(t))return{};if(i)return i(t);e.prototype=t;var n=new e;return e.prototype=void 0,n}}();e.exports=a},9881:(e,t,n)=>{var r=n(7816),i=n(9291)(r);e.exports=i},6029:(e,t,n)=>{var r=n(3448);e.exports=function(e,t,n){for(var i=-1,a=e.length;++i<a;){var o=e[i],s=t(o);if(null!=s&&(void 0===u?s==s&&!r(s):n(s,u)))var u=s,l=o}return l}},760:(e,t,n)=>{var r=n(9881);e.exports=function(e,t){var n=[];return r(e,(function(e,r,i){t(e,r,i)&&n.push(e)})),n}},1848:e=>{e.exports=function(e,t,n,r){for(var i=e.length,a=n+(r?1:-1);r?a--:++a<i;)if(t(e[a],a,e))return a;return-1}},1078:(e,t,n)=>{var r=n(2488),i=n(7285);e.exports=function e(t,n,a,o,s){var u=-1,l=t.length;for(a||(a=i),s||(s=[]);++u<l;){var c=t[u];n>0&&a(c)?n>1?e(c,n-1,a,o,s):r(s,c):o||(s[s.length]=c)}return s}},8483:(e,t,n)=>{var r=n(5063)();e.exports=r},7816:(e,t,n)=>{var r=n(8483),i=n(3674);e.exports=function(e,t){return e&&r(e,t,i)}},7786:(e,t,n)=>{var r=n(1811),i=n(327);e.exports=function(e,t){for(var n=0,a=(t=r(t,e)).length;null!=e&&n<a;)e=e[i(t[n++])];return n&&n==a?e:void 0}},8866:(e,t,n)=>{var r=n(2488),i=n(1469);e.exports=function(e,t,n){var a=t(e);return i(e)?a:r(a,n(e))}},4239:(e,t,n)=>{var r=n(2705),i=n(9607),a=n(2333),o=r?r.toStringTag:void 0;e.exports=function(e){return null==e?void 0===e?"[object Undefined]":"[object Null]":o&&o in Object(e)?i(e):a(e)}},3325:e=>{e.exports=function(e,t){return e>t}},8565:e=>{var t=Object.prototype.hasOwnProperty;e.exports=function(e,n){return null!=e&&t.call(e,n)}},13:e=>{e.exports=function(e,t){return null!=e&&t in Object(e)}},2118:(e,t,n)=>{var r=n(1848),i=n(2722),a=n(2351);e.exports=function(e,t,n){return t==t?a(e,t,n):r(e,i,n)}},9454:(e,t,n)=>{var r=n(4239),i=n(7005);e.exports=function(e){return i(e)&&"[object Arguments]"==r(e)}},939:(e,t,n)=>{var r=n(2492),i=n(7005);e.exports=function e(t,n,a,o,s){return t===n||(null==t||null==n||!i(t)&&!i(n)?t!=t&&n!=n:r(t,n,a,o,e,s))}},2492:(e,t,n)=>{var r=n(6384),i=n(7114),a=n(8351),o=n(6096),s=n(4160),u=n(1469),l=n(4144),c=n(6719),f="[object Arguments]",d="[object Array]",p="[object Object]",h=Object.prototype.hasOwnProperty;e.exports=function(e,t,n,m,v,y){var g=u(e),_=u(t),b=g?d:s(e),x=_?d:s(t),w=(b=b==f?p:b)==p,E=(x=x==f?p:x)==p,N=b==x;if(N&&l(e)){if(!l(t))return!1;g=!0,w=!1}if(N&&!w)return y||(y=new r),g||c(e)?i(e,t,n,m,v,y):a(e,t,b,n,m,v,y);if(!(1&n)){var S=w&&h.call(e,"__wrapped__"),M=E&&h.call(t,"__wrapped__");if(S||M){var k=S?e.value():e,O=M?t.value():t;return y||(y=new r),v(k,O,n,m,y)}}return!!N&&(y||(y=new r),o(e,t,n,m,v,y))}},5588:(e,t,n)=>{var r=n(4160),i=n(7005);e.exports=function(e){return i(e)&&"[object Map]"==r(e)}},2958:(e,t,n)=>{var r=n(6384),i=n(939);e.exports=function(e,t,n,a){var o=n.length,s=o,u=!a;if(null==e)return!s;for(e=Object(e);o--;){var l=n[o];if(u&&l[2]?l[1]!==e[l[0]]:!(l[0]in e))return!1}for(;++o<s;){var c=(l=n[o])[0],f=e[c],d=l[1];if(u&&l[2]){if(void 0===f&&!(c in e))return!1}else{var p=new r;if(a)var h=a(f,d,c,e,t,p);if(!(void 0===h?i(d,f,3,a,p):h))return!1}}return!0}},2722:e=>{e.exports=function(e){return e!=e}},8458:(e,t,n)=>{var r=n(3560),i=n(5346),a=n(3218),o=n(346),s=/^\[object .+?Constructor\]$/,u=Function.prototype,l=Object.prototype,c=u.toString,f=l.hasOwnProperty,d=RegExp("^"+c.call(f).replace(/[\\^$.*+?()[\]{}|]/g,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$");e.exports=function(e){return!(!a(e)||i(e))&&(r(e)?d:s).test(o(e))}},9221:(e,t,n)=>{var r=n(4160),i=n(7005);e.exports=function(e){return i(e)&&"[object Set]"==r(e)}},8749:(e,t,n)=>{var r=n(4239),i=n(1780),a=n(7005),o={};o["[object Float32Array]"]=o["[object Float64Array]"]=o["[object Int8Array]"]=o["[object Int16Array]"]=o["[object Int32Array]"]=o["[object Uint8Array]"]=o["[object Uint8ClampedArray]"]=o["[object Uint16Array]"]=o["[object Uint32Array]"]=!0,o["[object Arguments]"]=o["[object Array]"]=o["[object ArrayBuffer]"]=o["[object Boolean]"]=o["[object DataView]"]=o["[object Date]"]=o["[object Error]"]=o["[object Function]"]=o["[object Map]"]=o["[object Number]"]=o["[object Object]"]=o["[object RegExp]"]=o["[object Set]"]=o["[object String]"]=o["[object WeakMap]"]=!1,e.exports=function(e){return a(e)&&i(e.length)&&!!o[r(e)]}},7206:(e,t,n)=>{var r=n(1573),i=n(6432),a=n(6557),o=n(1469),s=n(9601);e.exports=function(e){return"function"==typeof e?e:null==e?a:"object"==typeof e?o(e)?i(e[0],e[1]):r(e):s(e)}},280:(e,t,n)=>{var r=n(5726),i=n(6916),a=Object.prototype.hasOwnProperty;e.exports=function(e){if(!r(e))return i(e);var t=[];for(var n in Object(e))a.call(e,n)&&"constructor"!=n&&t.push(n);return t}},313:(e,t,n)=>{var r=n(3218),i=n(5726),a=n(3498),o=Object.prototype.hasOwnProperty;e.exports=function(e){if(!r(e))return a(e);var t=i(e),n=[];for(var s in e)("constructor"!=s||!t&&o.call(e,s))&&n.push(s);return n}},433:e=>{e.exports=function(e,t){return e<t}},9199:(e,t,n)=>{var r=n(9881),i=n(8612);e.exports=function(e,t){var n=-1,a=i(e)?Array(e.length):[];return r(e,(function(e,r,i){a[++n]=t(e,r,i)})),a}},1573:(e,t,n)=>{var r=n(2958),i=n(1499),a=n(2634);e.exports=function(e){var t=i(e);return 1==t.length&&t[0][2]?a(t[0][0],t[0][1]):function(n){return n===e||r(n,e,t)}}},6432:(e,t,n)=>{var r=n(939),i=n(7361),a=n(9095),o=n(5403),s=n(9162),u=n(2634),l=n(327);e.exports=function(e,t){return o(e)&&s(t)?u(l(e),t):function(n){var o=i(n,e);return void 0===o&&o===t?a(n,e):r(t,o,3)}}},2980:(e,t,n)=>{var r=n(6384),i=n(6556),a=n(8483),o=n(9783),s=n(3218),u=n(1704),l=n(6390);e.exports=function e(t,n,c,f,d){t!==n&&a(n,(function(a,u){if(d||(d=new r),s(a))o(t,n,u,c,e,f,d);else{var p=f?f(l(t,u),a,u+"",t,n,d):void 0;void 0===p&&(p=a),i(t,u,p)}}),u)}},9783:(e,t,n)=>{var r=n(6556),i=n(4626),a=n(7133),o=n(278),s=n(8517),u=n(5694),l=n(1469),c=n(9246),f=n(4144),d=n(3560),p=n(3218),h=n(8630),m=n(6719),v=n(6390),y=n(3678);e.exports=function(e,t,n,g,_,b,x){var w=v(e,n),E=v(t,n),N=x.get(E);if(N)r(e,n,N);else{var S=b?b(w,E,n+"",e,t,x):void 0,M=void 0===S;if(M){var k=l(E),O=!k&&f(E),C=!k&&!O&&m(E);S=E,k||O||C?l(w)?S=w:c(w)?S=o(w):O?(M=!1,S=i(E,!0)):C?(M=!1,S=a(E,!0)):S=[]:h(E)||u(E)?(S=w,u(w)?S=y(w):p(w)&&!d(w)||(S=s(E))):M=!1}M&&(x.set(E,S),_(S,E,g,b,x),x.delete(E)),r(e,n,S)}}},9556:(e,t,n)=>{var r=n(9932),i=n(7786),a=n(7206),o=n(9199),s=n(1131),u=n(1717),l=n(5022),c=n(6557),f=n(1469);e.exports=function(e,t,n){t=t.length?r(t,(function(e){return f(e)?function(t){return i(t,1===e.length?e[0]:e)}:e})):[c];var d=-1;t=r(t,u(a));var p=o(e,(function(e,n,i){return{criteria:r(t,(function(t){return t(e)})),index:++d,value:e}}));return s(p,(function(e,t){return l(e,t,n)}))}},5970:(e,t,n)=>{var r=n(3012),i=n(9095);e.exports=function(e,t){return r(e,t,(function(t,n){return i(e,n)}))}},3012:(e,t,n)=>{var r=n(7786),i=n(611),a=n(1811);e.exports=function(e,t,n){for(var o=-1,s=t.length,u={};++o<s;){var l=t[o],c=r(e,l);n(c,l)&&i(u,a(l,e),c)}return u}},371:e=>{e.exports=function(e){return function(t){return null==t?void 0:t[e]}}},9152:(e,t,n)=>{var r=n(7786);e.exports=function(e){return function(t){return r(t,e)}}},98:e=>{var t=Math.ceil,n=Math.max;e.exports=function(e,r,i,a){for(var o=-1,s=n(t((r-e)/(i||1)),0),u=Array(s);s--;)u[a?s:++o]=e,e+=i;return u}},107:e=>{e.exports=function(e,t,n,r,i){return i(e,(function(e,i,a){n=r?(r=!1,e):t(n,e,i,a)})),n}},5976:(e,t,n)=>{var r=n(6557),i=n(5357),a=n(61);e.exports=function(e,t){return a(i(e,t,r),e+"")}},611:(e,t,n)=>{var r=n(4865),i=n(1811),a=n(5776),o=n(3218),s=n(327);e.exports=function(e,t,n,u){if(!o(e))return e;for(var l=-1,c=(t=i(t,e)).length,f=c-1,d=e;null!=d&&++l<c;){var p=s(t[l]),h=n;if("__proto__"===p||"constructor"===p||"prototype"===p)return e;if(l!=f){var m=d[p];void 0===(h=u?u(m,p,d):void 0)&&(h=o(m)?m:a(t[l+1])?[]:{})}r(d,p,h),d=d[p]}return e}},6560:(e,t,n)=>{var r=n(5703),i=n(8777),a=n(6557),o=i?function(e,t){return i(e,"toString",{configurable:!0,enumerable:!1,value:r(t),writable:!0})}:a;e.exports=o},1131:e=>{e.exports=function(e,t){var n=e.length;for(e.sort(t);n--;)e[n]=e[n].value;return e}},2545:e=>{e.exports=function(e,t){for(var n=-1,r=Array(e);++n<e;)r[n]=t(n);return r}},531:(e,t,n)=>{var r=n(2705),i=n(9932),a=n(1469),o=n(3448),s=r?r.prototype:void 0,u=s?s.toString:void 0;e.exports=function e(t){if("string"==typeof t)return t;if(a(t))return i(t,e)+"";if(o(t))return u?u.call(t):"";var n=t+"";return"0"==n&&1/t==-1/0?"-0":n}},7561:(e,t,n)=>{var r=n(7990),i=/^\s+/;e.exports=function(e){return e?e.slice(0,r(e)+1).replace(i,""):e}},1717:e=>{e.exports=function(e){return function(t){return e(t)}}},5652:(e,t,n)=>{var r=n(8668),i=n(7443),a=n(1196),o=n(4757),s=n(3593),u=n(1814);e.exports=function(e,t,n){var l=-1,c=i,f=e.length,d=!0,p=[],h=p;if(n)d=!1,c=a;else if(f>=200){var m=t?null:s(e);if(m)return u(m);d=!1,c=o,h=new r}else h=t?[]:p;e:for(;++l<f;){var v=e[l],y=t?t(v):v;if(v=n||0!==v?v:0,d&&y==y){for(var g=h.length;g--;)if(h[g]===y)continue e;t&&h.push(y),p.push(v)}else c(h,y,n)||(h!==p&&h.push(y),p.push(v))}return p}},7415:(e,t,n)=>{var r=n(9932);e.exports=function(e,t){return r(t,(function(t){return e[t]}))}},1757:e=>{e.exports=function(e,t,n){for(var r=-1,i=e.length,a=t.length,o={};++r<i;){var s=r<a?t[r]:void 0;n(o,e[r],s)}return o}},4757:e=>{e.exports=function(e,t){return e.has(t)}},4290:(e,t,n)=>{var r=n(6557);e.exports=function(e){return"function"==typeof e?e:r}},1811:(e,t,n)=>{var r=n(1469),i=n(5403),a=n(5514),o=n(9833);e.exports=function(e,t){return r(e)?e:i(e,t)?[e]:a(o(e))}},4318:(e,t,n)=>{var r=n(1149);e.exports=function(e){var t=new e.constructor(e.byteLength);return new r(t).set(new r(e)),t}},4626:(e,t,n)=>{e=n.nmd(e);var r=n(5639),i=t&&!t.nodeType&&t,a=i&&e&&!e.nodeType&&e,o=a&&a.exports===i?r.Buffer:void 0,s=o?o.allocUnsafe:void 0;e.exports=function(e,t){if(t)return e.slice();var n=e.length,r=s?s(n):new e.constructor(n);return e.copy(r),r}},7157:(e,t,n)=>{var r=n(4318);e.exports=function(e,t){var n=t?r(e.buffer):e.buffer;return new e.constructor(n,e.byteOffset,e.byteLength)}},3147:e=>{var t=/\w*$/;e.exports=function(e){var n=new e.constructor(e.source,t.exec(e));return n.lastIndex=e.lastIndex,n}},419:(e,t,n)=>{var r=n(2705),i=r?r.prototype:void 0,a=i?i.valueOf:void 0;e.exports=function(e){return a?Object(a.call(e)):{}}},7133:(e,t,n)=>{var r=n(4318);e.exports=function(e,t){var n=t?r(e.buffer):e.buffer;return new e.constructor(n,e.byteOffset,e.length)}},6393:(e,t,n)=>{var r=n(3448);e.exports=function(e,t){if(e!==t){var n=void 0!==e,i=null===e,a=e==e,o=r(e),s=void 0!==t,u=null===t,l=t==t,c=r(t);if(!u&&!c&&!o&&e>t||o&&s&&l&&!u&&!c||i&&s&&l||!n&&l||!a)return 1;if(!i&&!o&&!c&&e<t||c&&n&&a&&!i&&!o||u&&n&&a||!s&&a||!l)return-1}return 0}},5022:(e,t,n)=>{var r=n(6393);e.exports=function(e,t,n){for(var i=-1,a=e.criteria,o=t.criteria,s=a.length,u=n.length;++i<s;){var l=r(a[i],o[i]);if(l)return i>=u?l:l*("desc"==n[i]?-1:1)}return e.index-t.index}},278:e=>{e.exports=function(e,t){var n=-1,r=e.length;for(t||(t=Array(r));++n<r;)t[n]=e[n];return t}},8363:(e,t,n)=>{var r=n(4865),i=n(9465);e.exports=function(e,t,n,a){var o=!n;n||(n={});for(var s=-1,u=t.length;++s<u;){var l=t[s],c=a?a(n[l],e[l],l,n,e):void 0;void 0===c&&(c=e[l]),o?i(n,l,c):r(n,l,c)}return n}},8805:(e,t,n)=>{var r=n(8363),i=n(9551);e.exports=function(e,t){return r(e,i(e),t)}},1911:(e,t,n)=>{var r=n(8363),i=n(1442);e.exports=function(e,t){return r(e,i(e),t)}},4429:(e,t,n)=>{var r=n(5639)["__core-js_shared__"];e.exports=r},1463:(e,t,n)=>{var r=n(5976),i=n(6612);e.exports=function(e){return r((function(t,n){var r=-1,a=n.length,o=a>1?n[a-1]:void 0,s=a>2?n[2]:void 0;for(o=e.length>3&&"function"==typeof o?(a--,o):void 0,s&&i(n[0],n[1],s)&&(o=a<3?void 0:o,a=1),t=Object(t);++r<a;){var u=n[r];u&&e(t,u,r,o)}return t}))}},9291:(e,t,n)=>{var r=n(8612);e.exports=function(e,t){return function(n,i){if(null==n)return n;if(!r(n))return e(n,i);for(var a=n.length,o=t?a:-1,s=Object(n);(t?o--:++o<a)&&!1!==i(s[o],o,s););return n}}},5063:e=>{e.exports=function(e){return function(t,n,r){for(var i=-1,a=Object(t),o=r(t),s=o.length;s--;){var u=o[e?s:++i];if(!1===n(a[u],u,a))break}return t}}},7740:(e,t,n)=>{var r=n(7206),i=n(8612),a=n(3674);e.exports=function(e){return function(t,n,o){var s=Object(t);if(!i(t)){var u=r(n,3);t=a(t),n=function(e){return u(s[e],e,s)}}var l=e(t,n,o);return l>-1?s[u?t[l]:l]:void 0}}},7445:(e,t,n)=>{var r=n(98),i=n(6612),a=n(8601);e.exports=function(e){return function(t,n,o){return o&&"number"!=typeof o&&i(t,n,o)&&(n=o=void 0),t=a(t),void 0===n?(n=t,t=0):n=a(n),o=void 0===o?t<n?1:-1:a(o),r(t,n,o,e)}}},3593:(e,t,n)=>{var r=n(8525),i=n(308),a=n(1814),o=r&&1/a(new r([,-0]))[1]==1/0?function(e){return new r(e)}:i;e.exports=o},8777:(e,t,n)=>{var r=n(852),i=function(){try{var e=r(Object,"defineProperty");return e({},"",{}),e}catch(e){}}();e.exports=i},7114:(e,t,n)=>{var r=n(8668),i=n(2908),a=n(4757);e.exports=function(e,t,n,o,s,u){var l=1&n,c=e.length,f=t.length;if(c!=f&&!(l&&f>c))return!1;var d=u.get(e),p=u.get(t);if(d&&p)return d==t&&p==e;var h=-1,m=!0,v=2&n?new r:void 0;for(u.set(e,t),u.set(t,e);++h<c;){var y=e[h],g=t[h];if(o)var _=l?o(g,y,h,t,e,u):o(y,g,h,e,t,u);if(void 0!==_){if(_)continue;m=!1;break}if(v){if(!i(t,(function(e,t){if(!a(v,t)&&(y===e||s(y,e,n,o,u)))return v.push(t)}))){m=!1;break}}else if(y!==g&&!s(y,g,n,o,u)){m=!1;break}}return u.delete(e),u.delete(t),m}},8351:(e,t,n)=>{var r=n(2705),i=n(1149),a=n(7813),o=n(7114),s=n(8776),u=n(1814),l=r?r.prototype:void 0,c=l?l.valueOf:void 0;e.exports=function(e,t,n,r,l,f,d){switch(n){case"[object DataView]":if(e.byteLength!=t.byteLength||e.byteOffset!=t.byteOffset)return!1;e=e.buffer,t=t.buffer;case"[object ArrayBuffer]":return!(e.byteLength!=t.byteLength||!f(new i(e),new i(t)));case"[object Boolean]":case"[object Date]":case"[object Number]":return a(+e,+t);case"[object Error]":return e.name==t.name&&e.message==t.message;case"[object RegExp]":case"[object String]":return e==t+"";case"[object Map]":var p=s;case"[object Set]":var h=1&r;if(p||(p=u),e.size!=t.size&&!h)return!1;var m=d.get(e);if(m)return m==t;r|=2,d.set(e,t);var v=o(p(e),p(t),r,l,f,d);return d.delete(e),v;case"[object Symbol]":if(c)return c.call(e)==c.call(t)}return!1}},6096:(e,t,n)=>{var r=n(8234),i=Object.prototype.hasOwnProperty;e.exports=function(e,t,n,a,o,s){var u=1&n,l=r(e),c=l.length;if(c!=r(t).length&&!u)return!1;for(var f=c;f--;){var d=l[f];if(!(u?d in t:i.call(t,d)))return!1}var p=s.get(e),h=s.get(t);if(p&&h)return p==t&&h==e;var m=!0;s.set(e,t),s.set(t,e);for(var v=u;++f<c;){var y=e[d=l[f]],g=t[d];if(a)var _=u?a(g,y,d,t,e,s):a(y,g,d,e,t,s);if(!(void 0===_?y===g||o(y,g,n,a,s):_)){m=!1;break}v||(v="constructor"==d)}if(m&&!v){var b=e.constructor,x=t.constructor;b==x||!("constructor"in e)||!("constructor"in t)||"function"==typeof b&&b instanceof b&&"function"==typeof x&&x instanceof x||(m=!1)}return s.delete(e),s.delete(t),m}},9021:(e,t,n)=>{var r=n(5564),i=n(5357),a=n(61);e.exports=function(e){return a(i(e,void 0,r),e+"")}},1957:(e,t,n)=>{var r="object"==typeof n.g&&n.g&&n.g.Object===Object&&n.g;e.exports=r},8234:(e,t,n)=>{var r=n(8866),i=n(9551),a=n(3674);e.exports=function(e){return r(e,a,i)}},6904:(e,t,n)=>{var r=n(8866),i=n(1442),a=n(1704);e.exports=function(e){return r(e,a,i)}},5050:(e,t,n)=>{var r=n(7019);e.exports=function(e,t){var n=e.__data__;return r(t)?n["string"==typeof t?"string":"hash"]:n.map}},1499:(e,t,n)=>{var r=n(9162),i=n(3674);e.exports=function(e){for(var t=i(e),n=t.length;n--;){var a=t[n],o=e[a];t[n]=[a,o,r(o)]}return t}},852:(e,t,n)=>{var r=n(8458),i=n(7801);e.exports=function(e,t){var n=i(e,t);return r(n)?n:void 0}},5924:(e,t,n)=>{var r=n(5569)(Object.getPrototypeOf,Object);e.exports=r},9607:(e,t,n)=>{var r=n(2705),i=Object.prototype,a=i.hasOwnProperty,o=i.toString,s=r?r.toStringTag:void 0;e.exports=function(e){var t=a.call(e,s),n=e[s];try{e[s]=void 0;var r=!0}catch(e){}var i=o.call(e);return r&&(t?e[s]=n:delete e[s]),i}},9551:(e,t,n)=>{var r=n(4963),i=n(479),a=Object.prototype.propertyIsEnumerable,o=Object.getOwnPropertySymbols,s=o?function(e){return null==e?[]:(e=Object(e),r(o(e),(function(t){return a.call(e,t)})))}:i;e.exports=s},1442:(e,t,n)=>{var r=n(2488),i=n(5924),a=n(9551),o=n(479),s=Object.getOwnPropertySymbols?function(e){for(var t=[];e;)r(t,a(e)),e=i(e);return t}:o;e.exports=s},4160:(e,t,n)=>{var r=n(8552),i=n(7071),a=n(3818),o=n(8525),s=n(577),u=n(4239),l=n(346),c="[object Map]",f="[object Promise]",d="[object Set]",p="[object WeakMap]",h="[object DataView]",m=l(r),v=l(i),y=l(a),g=l(o),_=l(s),b=u;(r&&b(new r(new ArrayBuffer(1)))!=h||i&&b(new i)!=c||a&&b(a.resolve())!=f||o&&b(new o)!=d||s&&b(new s)!=p)&&(b=function(e){var t=u(e),n="[object Object]"==t?e.constructor:void 0,r=n?l(n):"";if(r)switch(r){case m:return h;case v:return c;case y:return f;case g:return d;case _:return p}return t}),e.exports=b},7801:e=>{e.exports=function(e,t){return null==e?void 0:e[t]}},222:(e,t,n)=>{var r=n(1811),i=n(5694),a=n(1469),o=n(5776),s=n(1780),u=n(327);e.exports=function(e,t,n){for(var l=-1,c=(t=r(t,e)).length,f=!1;++l<c;){var d=u(t[l]);if(!(f=null!=e&&n(e,d)))break;e=e[d]}return f||++l!=c?f:!!(c=null==e?0:e.length)&&s(c)&&o(d,c)&&(a(e)||i(e))}},2689:e=>{var t=RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");e.exports=function(e){return t.test(e)}},1789:(e,t,n)=>{var r=n(4536);e.exports=function(){this.__data__=r?r(null):{},this.size=0}},401:e=>{e.exports=function(e){var t=this.has(e)&&delete this.__data__[e];return this.size-=t?1:0,t}},7667:(e,t,n)=>{var r=n(4536),i=Object.prototype.hasOwnProperty;e.exports=function(e){var t=this.__data__;if(r){var n=t[e];return"__lodash_hash_undefined__"===n?void 0:n}return i.call(t,e)?t[e]:void 0}},1327:(e,t,n)=>{var r=n(4536),i=Object.prototype.hasOwnProperty;e.exports=function(e){var t=this.__data__;return r?void 0!==t[e]:i.call(t,e)}},1866:(e,t,n)=>{var r=n(4536);e.exports=function(e,t){var n=this.__data__;return this.size+=this.has(e)?0:1,n[e]=r&&void 0===t?"__lodash_hash_undefined__":t,this}},3824:e=>{var t=Object.prototype.hasOwnProperty;e.exports=function(e){var n=e.length,r=new e.constructor(n);return n&&"string"==typeof e[0]&&t.call(e,"index")&&(r.index=e.index,r.input=e.input),r}},9148:(e,t,n)=>{var r=n(4318),i=n(7157),a=n(3147),o=n(419),s=n(7133);e.exports=function(e,t,n){var u=e.constructor;switch(t){case"[object ArrayBuffer]":return r(e);case"[object Boolean]":case"[object Date]":return new u(+e);case"[object DataView]":return i(e,n);case"[object Float32Array]":case"[object Float64Array]":case"[object Int8Array]":case"[object Int16Array]":case"[object Int32Array]":case"[object Uint8Array]":case"[object Uint8ClampedArray]":case"[object Uint16Array]":case"[object Uint32Array]":return s(e,n);case"[object Map]":return new u;case"[object Number]":case"[object String]":return new u(e);case"[object RegExp]":return a(e);case"[object Set]":return new u;case"[object Symbol]":return o(e)}}},8517:(e,t,n)=>{var r=n(3118),i=n(5924),a=n(5726);e.exports=function(e){return"function"!=typeof e.constructor||a(e)?{}:r(i(e))}},7285:(e,t,n)=>{var r=n(2705),i=n(5694),a=n(1469),o=r?r.isConcatSpreadable:void 0;e.exports=function(e){return a(e)||i(e)||!!(o&&e&&e[o])}},5776:e=>{var t=/^(?:0|[1-9]\d*)$/;e.exports=function(e,n){var r=typeof e;return!!(n=null==n?9007199254740991:n)&&("number"==r||"symbol"!=r&&t.test(e))&&e>-1&&e%1==0&&e<n}},6612:(e,t,n)=>{var r=n(7813),i=n(8612),a=n(5776),o=n(3218);e.exports=function(e,t,n){if(!o(n))return!1;var s=typeof t;return!!("number"==s?i(n)&&a(t,n.length):"string"==s&&t in n)&&r(n[t],e)}},5403:(e,t,n)=>{var r=n(1469),i=n(3448),a=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,o=/^\w*$/;e.exports=function(e,t){if(r(e))return!1;var n=typeof e;return!("number"!=n&&"symbol"!=n&&"boolean"!=n&&null!=e&&!i(e))||o.test(e)||!a.test(e)||null!=t&&e in Object(t)}},7019:e=>{e.exports=function(e){var t=typeof e;return"string"==t||"number"==t||"symbol"==t||"boolean"==t?"__proto__"!==e:null===e}},5346:(e,t,n)=>{var r,i=n(4429),a=(r=/[^.]+$/.exec(i&&i.keys&&i.keys.IE_PROTO||""))?"Symbol(src)_1."+r:"";e.exports=function(e){return!!a&&a in e}},5726:e=>{var t=Object.prototype;e.exports=function(e){var n=e&&e.constructor;return e===("function"==typeof n&&n.prototype||t)}},9162:(e,t,n)=>{var r=n(3218);e.exports=function(e){return e==e&&!r(e)}},7040:e=>{e.exports=function(){this.__data__=[],this.size=0}},4125:(e,t,n)=>{var r=n(8470),i=Array.prototype.splice;e.exports=function(e){var t=this.__data__,n=r(t,e);return!(n<0||(n==t.length-1?t.pop():i.call(t,n,1),--this.size,0))}},2117:(e,t,n)=>{var r=n(8470);e.exports=function(e){var t=this.__data__,n=r(t,e);return n<0?void 0:t[n][1]}},7518:(e,t,n)=>{var r=n(8470);e.exports=function(e){return r(this.__data__,e)>-1}},4705:(e,t,n)=>{var r=n(8470);e.exports=function(e,t){var n=this.__data__,i=r(n,e);return i<0?(++this.size,n.push([e,t])):n[i][1]=t,this}},4785:(e,t,n)=>{var r=n(1989),i=n(8407),a=n(7071);e.exports=function(){this.size=0,this.__data__={hash:new r,map:new(a||i),string:new r}}},1285:(e,t,n)=>{var r=n(5050);e.exports=function(e){var t=r(this,e).delete(e);return this.size-=t?1:0,t}},6e3:(e,t,n)=>{var r=n(5050);e.exports=function(e){return r(this,e).get(e)}},9916:(e,t,n)=>{var r=n(5050);e.exports=function(e){return r(this,e).has(e)}},5265:(e,t,n)=>{var r=n(5050);e.exports=function(e,t){var n=r(this,e),i=n.size;return n.set(e,t),this.size+=n.size==i?0:1,this}},8776:e=>{e.exports=function(e){var t=-1,n=Array(e.size);return e.forEach((function(e,r){n[++t]=[r,e]})),n}},2634:e=>{e.exports=function(e,t){return function(n){return null!=n&&n[e]===t&&(void 0!==t||e in Object(n))}}},4523:(e,t,n)=>{var r=n(8306);e.exports=function(e){var t=r(e,(function(e){return 500===n.size&&n.clear(),e})),n=t.cache;return t}},4536:(e,t,n)=>{var r=n(852)(Object,"create");e.exports=r},6916:(e,t,n)=>{var r=n(5569)(Object.keys,Object);e.exports=r},3498:e=>{e.exports=function(e){var t=[];if(null!=e)for(var n in Object(e))t.push(n);return t}},1167:(e,t,n)=>{e=n.nmd(e);var r=n(1957),i=t&&!t.nodeType&&t,a=i&&e&&!e.nodeType&&e,o=a&&a.exports===i&&r.process,s=function(){try{return a&&a.require&&a.require("util").types||o&&o.binding&&o.binding("util")}catch(e){}}();e.exports=s},2333:e=>{var t=Object.prototype.toString;e.exports=function(e){return t.call(e)}},5569:e=>{e.exports=function(e,t){return function(n){return e(t(n))}}},5357:(e,t,n)=>{var r=n(6874),i=Math.max;e.exports=function(e,t,n){return t=i(void 0===t?e.length-1:t,0),function(){for(var a=arguments,o=-1,s=i(a.length-t,0),u=Array(s);++o<s;)u[o]=a[t+o];o=-1;for(var l=Array(t+1);++o<t;)l[o]=a[o];return l[t]=n(u),r(e,this,l)}}},5639:(e,t,n)=>{var r=n(1957),i="object"==typeof self&&self&&self.Object===Object&&self,a=r||i||Function("return this")();e.exports=a},6390:e=>{e.exports=function(e,t){if(("constructor"!==t||"function"!=typeof e[t])&&"__proto__"!=t)return e[t]}},619:e=>{e.exports=function(e){return this.__data__.set(e,"__lodash_hash_undefined__"),this}},2385:e=>{e.exports=function(e){return this.__data__.has(e)}},1814:e=>{e.exports=function(e){var t=-1,n=Array(e.size);return e.forEach((function(e){n[++t]=e})),n}},61:(e,t,n)=>{var r=n(6560),i=n(1275)(r);e.exports=i},1275:e=>{var t=Date.now;e.exports=function(e){var n=0,r=0;return function(){var i=t(),a=16-(i-r);if(r=i,a>0){if(++n>=800)return arguments[0]}else n=0;return e.apply(void 0,arguments)}}},7465:(e,t,n)=>{var r=n(8407);e.exports=function(){this.__data__=new r,this.size=0}},3779:e=>{e.exports=function(e){var t=this.__data__,n=t.delete(e);return this.size=t.size,n}},7599:e=>{e.exports=function(e){return this.__data__.get(e)}},4758:e=>{e.exports=function(e){return this.__data__.has(e)}},4309:(e,t,n)=>{var r=n(8407),i=n(7071),a=n(3369);e.exports=function(e,t){var n=this.__data__;if(n instanceof r){var o=n.__data__;if(!i||o.length<199)return o.push([e,t]),this.size=++n.size,this;n=this.__data__=new a(o)}return n.set(e,t),this.size=n.size,this}},2351:e=>{e.exports=function(e,t,n){for(var r=n-1,i=e.length;++r<i;)if(e[r]===t)return r;return-1}},8016:(e,t,n)=>{var r=n(8983),i=n(2689),a=n(1903);e.exports=function(e){return i(e)?a(e):r(e)}},5514:(e,t,n)=>{var r=n(4523),i=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g,a=/\\(\\)?/g,o=r((function(e){var t=[];return 46===e.charCodeAt(0)&&t.push(""),e.replace(i,(function(e,n,r,i){t.push(r?i.replace(a,"$1"):n||e)})),t}));e.exports=o},327:(e,t,n)=>{var r=n(3448);e.exports=function(e){if("string"==typeof e||r(e))return e;var t=e+"";return"0"==t&&1/e==-1/0?"-0":t}},346:e=>{var t=Function.prototype.toString;e.exports=function(e){if(null!=e){try{return t.call(e)}catch(e){}try{return e+""}catch(e){}}return""}},7990:e=>{var t=/\s/;e.exports=function(e){for(var n=e.length;n--&&t.test(e.charAt(n)););return n}},1903:e=>{var t="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",n="\\ud83c[\\udffb-\\udfff]",r="[^\\ud800-\\udfff]",i="(?:\\ud83c[\\udde6-\\uddff]){2}",a="[\\ud800-\\udbff][\\udc00-\\udfff]",o="(?:"+t+"|"+n+")?",s="[\\ufe0e\\ufe0f]?",u=s+o+"(?:\\u200d(?:"+[r,i,a].join("|")+")"+s+o+")*",l="(?:"+[r+t+"?",t,i,a,"[\\ud800-\\udfff]"].join("|")+")",c=RegExp(n+"(?="+n+")|"+l+u,"g");e.exports=function(e){for(var t=c.lastIndex=0;c.test(e);)++t;return t}},6678:(e,t,n)=>{var r=n(5990);e.exports=function(e){return r(e,4)}},361:(e,t,n)=>{var r=n(5990);e.exports=function(e){return r(e,5)}},5703:e=>{e.exports=function(e){return function(){return e}}},1747:(e,t,n)=>{var r=n(5976),i=n(7813),a=n(6612),o=n(1704),s=Object.prototype,u=s.hasOwnProperty,l=r((function(e,t){e=Object(e);var n=-1,r=t.length,l=r>2?t[2]:void 0;for(l&&a(t[0],t[1],l)&&(r=1);++n<r;)for(var c=t[n],f=o(c),d=-1,p=f.length;++d<p;){var h=f[d],m=e[h];(void 0===m||i(m,s[h])&&!u.call(e,h))&&(e[h]=c[h])}return e}));e.exports=l},6073:(e,t,n)=>{e.exports=n(4486)},7813:e=>{e.exports=function(e,t){return e===t||e!=e&&t!=t}},3105:(e,t,n)=>{var r=n(4963),i=n(760),a=n(7206),o=n(1469);e.exports=function(e,t){return(o(e)?r:i)(e,a(t,3))}},3311:(e,t,n)=>{var r=n(7740)(n(998));e.exports=r},998:(e,t,n)=>{var r=n(1848),i=n(7206),a=n(554),o=Math.max;e.exports=function(e,t,n){var s=null==e?0:e.length;if(!s)return-1;var u=null==n?0:a(n);return u<0&&(u=o(s+u,0)),r(e,i(t,3),u)}},5564:(e,t,n)=>{var r=n(1078);e.exports=function(e){return null!=e&&e.length?r(e,1):[]}},4486:(e,t,n)=>{var r=n(7412),i=n(9881),a=n(4290),o=n(1469);e.exports=function(e,t){return(o(e)?r:i)(e,a(t))}},2620:(e,t,n)=>{var r=n(8483),i=n(4290),a=n(1704);e.exports=function(e,t){return null==e?e:r(e,i(t),a)}},7361:(e,t,n)=>{var r=n(7786);e.exports=function(e,t,n){var i=null==e?void 0:r(e,t);return void 0===i?n:i}},8721:(e,t,n)=>{var r=n(8565),i=n(222);e.exports=function(e,t){return null!=e&&i(e,t,r)}},9095:(e,t,n)=>{var r=n(13),i=n(222);e.exports=function(e,t){return null!=e&&i(e,t,r)}},6557:e=>{e.exports=function(e){return e}},5694:(e,t,n)=>{var r=n(9454),i=n(7005),a=Object.prototype,o=a.hasOwnProperty,s=a.propertyIsEnumerable,u=r(function(){return arguments}())?r:function(e){return i(e)&&o.call(e,"callee")&&!s.call(e,"callee")};e.exports=u},1469:e=>{var t=Array.isArray;e.exports=t},8612:(e,t,n)=>{var r=n(3560),i=n(1780);e.exports=function(e){return null!=e&&i(e.length)&&!r(e)}},9246:(e,t,n)=>{var r=n(8612),i=n(7005);e.exports=function(e){return i(e)&&r(e)}},4144:(e,t,n)=>{e=n.nmd(e);var r=n(5639),i=n(5062),a=t&&!t.nodeType&&t,o=a&&e&&!e.nodeType&&e,s=o&&o.exports===a?r.Buffer:void 0,u=(s?s.isBuffer:void 0)||i;e.exports=u},1609:(e,t,n)=>{var r=n(280),i=n(4160),a=n(5694),o=n(1469),s=n(8612),u=n(4144),l=n(5726),c=n(6719),f=Object.prototype.hasOwnProperty;e.exports=function(e){if(null==e)return!0;if(s(e)&&(o(e)||"string"==typeof e||"function"==typeof e.splice||u(e)||c(e)||a(e)))return!e.length;var t=i(e);if("[object Map]"==t||"[object Set]"==t)return!e.size;if(l(e))return!r(e).length;for(var n in e)if(f.call(e,n))return!1;return!0}},3560:(e,t,n)=>{var r=n(4239),i=n(3218);e.exports=function(e){if(!i(e))return!1;var t=r(e);return"[object Function]"==t||"[object GeneratorFunction]"==t||"[object AsyncFunction]"==t||"[object Proxy]"==t}},1780:e=>{e.exports=function(e){return"number"==typeof e&&e>-1&&e%1==0&&e<=9007199254740991}},6688:(e,t,n)=>{var r=n(5588),i=n(1717),a=n(1167),o=a&&a.isMap,s=o?i(o):r;e.exports=s},3218:e=>{e.exports=function(e){var t=typeof e;return null!=e&&("object"==t||"function"==t)}},7005:e=>{e.exports=function(e){return null!=e&&"object"==typeof e}},8630:(e,t,n)=>{var r=n(4239),i=n(5924),a=n(7005),o=Function.prototype,s=Object.prototype,u=o.toString,l=s.hasOwnProperty,c=u.call(Object);e.exports=function(e){if(!a(e)||"[object Object]"!=r(e))return!1;var t=i(e);if(null===t)return!0;var n=l.call(t,"constructor")&&t.constructor;return"function"==typeof n&&n instanceof n&&u.call(n)==c}},2928:(e,t,n)=>{var r=n(9221),i=n(1717),a=n(1167),o=a&&a.isSet,s=o?i(o):r;e.exports=s},7037:(e,t,n)=>{var r=n(4239),i=n(1469),a=n(7005);e.exports=function(e){return"string"==typeof e||!i(e)&&a(e)&&"[object String]"==r(e)}},3448:(e,t,n)=>{var r=n(4239),i=n(7005);e.exports=function(e){return"symbol"==typeof e||i(e)&&"[object Symbol]"==r(e)}},6719:(e,t,n)=>{var r=n(8749),i=n(1717),a=n(1167),o=a&&a.isTypedArray,s=o?i(o):r;e.exports=s},2353:e=>{e.exports=function(e){return void 0===e}},3674:(e,t,n)=>{var r=n(4636),i=n(280),a=n(8612);e.exports=function(e){return a(e)?r(e):i(e)}},1704:(e,t,n)=>{var r=n(4636),i=n(313),a=n(8612);e.exports=function(e){return a(e)?r(e,!0):i(e)}},928:e=>{e.exports=function(e){var t=null==e?0:e.length;return t?e[t-1]:void 0}},5161:(e,t,n)=>{var r=n(9932),i=n(7206),a=n(9199),o=n(1469);e.exports=function(e,t){return(o(e)?r:a)(e,i(t,3))}},6604:(e,t,n)=>{var r=n(9465),i=n(7816),a=n(7206);e.exports=function(e,t){var n={};return t=a(t,3),i(e,(function(e,i,a){r(n,i,t(e,i,a))})),n}},6162:(e,t,n)=>{var r=n(6029),i=n(3325),a=n(6557);e.exports=function(e){return e&&e.length?r(e,a,i):void 0}},8306:(e,t,n)=>{var r=n(3369);function i(e,t){if("function"!=typeof e||null!=t&&"function"!=typeof t)throw new TypeError("Expected a function");var n=function(){var r=arguments,i=t?t.apply(this,r):r[0],a=n.cache;if(a.has(i))return a.get(i);var o=e.apply(this,r);return n.cache=a.set(i,o)||a,o};return n.cache=new(i.Cache||r),n}i.Cache=r,e.exports=i},3857:(e,t,n)=>{var r=n(2980),i=n(1463)((function(e,t,n){r(e,t,n)}));e.exports=i},3632:(e,t,n)=>{var r=n(6029),i=n(433),a=n(6557);e.exports=function(e){return e&&e.length?r(e,a,i):void 0}},2762:(e,t,n)=>{var r=n(6029),i=n(7206),a=n(433);e.exports=function(e,t){return e&&e.length?r(e,i(t,2),a):void 0}},308:e=>{e.exports=function(){}},7771:(e,t,n)=>{var r=n(5639);e.exports=function(){return r.Date.now()}},9722:(e,t,n)=>{var r=n(5970),i=n(9021)((function(e,t){return null==e?{}:r(e,t)}));e.exports=i},9601:(e,t,n)=>{var r=n(371),i=n(9152),a=n(5403),o=n(327);e.exports=function(e){return a(e)?r(o(e)):i(e)}},6026:(e,t,n)=>{var r=n(7445)();e.exports=r},4061:(e,t,n)=>{var r=n(2663),i=n(9881),a=n(7206),o=n(107),s=n(1469);e.exports=function(e,t,n){var u=s(e)?r:o,l=arguments.length<3;return u(e,a(t,4),n,l,i)}},4238:(e,t,n)=>{var r=n(280),i=n(4160),a=n(8612),o=n(7037),s=n(8016);e.exports=function(e){if(null==e)return 0;if(a(e))return o(e)?s(e):e.length;var t=i(e);return"[object Map]"==t||"[object Set]"==t?e.size:r(e).length}},9734:(e,t,n)=>{var r=n(1078),i=n(9556),a=n(5976),o=n(6612),s=a((function(e,t){if(null==e)return[];var n=t.length;return n>1&&o(e,t[0],t[1])?t=[]:n>2&&o(t[0],t[1],t[2])&&(t=[t[0]]),i(e,r(t,1),[])}));e.exports=s},479:e=>{e.exports=function(){return[]}},5062:e=>{e.exports=function(){return!1}},8601:(e,t,n)=>{var r=n(4841);e.exports=function(e){return e?Infinity===(e=r(e))||e===-1/0?17976931348623157e292*(e<0?-1:1):e==e?e:0:0===e?e:0}},554:(e,t,n)=>{var r=n(8601);e.exports=function(e){var t=r(e),n=t%1;return t==t?n?t-n:t:0}},4841:(e,t,n)=>{var r=n(7561),i=n(3218),a=n(3448),o=/^[-+]0x[0-9a-f]+$/i,s=/^0b[01]+$/i,u=/^0o[0-7]+$/i,l=parseInt;e.exports=function(e){if("number"==typeof e)return e;if(a(e))return NaN;if(i(e)){var t="function"==typeof e.valueOf?e.valueOf():e;e=i(t)?t+"":t}if("string"!=typeof e)return 0===e?e:+e;e=r(e);var n=s.test(e);return n||u.test(e)?l(e.slice(2),n?2:8):o.test(e)?NaN:+e}},3678:(e,t,n)=>{var r=n(8363),i=n(1704);e.exports=function(e){return r(e,i(e))}},9833:(e,t,n)=>{var r=n(531);e.exports=function(e){return null==e?"":r(e)}},8718:(e,t,n)=>{var r=n(7412),i=n(3118),a=n(7816),o=n(7206),s=n(5924),u=n(1469),l=n(4144),c=n(3560),f=n(3218),d=n(6719);e.exports=function(e,t,n){var p=u(e),h=p||l(e)||d(e);if(t=o(t,4),null==n){var m=e&&e.constructor;n=h?p?new m:[]:f(e)&&c(m)?i(s(e)):{}}return(h?r:a)(e,(function(e,r,i){return t(n,e,r,i)})),n}},3386:(e,t,n)=>{var r=n(1078),i=n(5976),a=n(5652),o=n(9246),s=i((function(e){return a(r(e,1,o,!0))}));e.exports=s},3955:(e,t,n)=>{var r=n(9833),i=0;e.exports=function(e){var t=++i;return r(e)+t}},2628:(e,t,n)=>{var r=n(7415),i=n(3674);e.exports=function(e){return null==e?[]:r(e,i(e))}},7287:(e,t,n)=>{var r=n(4865),i=n(1757);e.exports=function(e,t){return i(e||[],t||[],r)}},2191:(e,t,n)=>{"use strict";n.d(t,{v:()=>a});var r={epsilon:1e-12,matrix:"Matrix",number:"number",precision:64,predictable:!1,randomSeed:null};function i(){return(i=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e}).apply(this,arguments)}var a=function(e){if(e)throw new Error("The global config is readonly. \nPlease create a mathjs instance if you want to change the default configuration. \nExample:\n\n  import { create, all } from 'mathjs';\n  const mathjs = create(all);\n  mathjs.config({ number: 'BigNumber' });\n");return Object.freeze(r)};i(a,r,{MATRIX_OPTIONS:["Matrix","Array"],NUMBER_OPTIONS:["number","BigNumber","Fraction"]})},400:(e,t,n)=>{"use strict";n.d(t,{Qc:()=>En,og:()=>Cn});var r=n(2191),i=n(5542),a={end:!0},o=n(5254),s=n(8794),u=["mathWithTransform"],l=(0,s.d5)("Node",u,(e=>{var{mathWithTransform:t}=e;function n(){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator")}return n.prototype.evaluate=function(e){return this.compile().evaluate(e)},n.prototype.type="Node",n.prototype.isNode=!0,n.prototype.comment="",n.prototype.compile=function(){var e=this._compile(t,{}),n={};return{evaluate:function(t){var r=t||{};return function(e){for(var t in e)if((0,o.nr)(e,t)&&t in a)throw new Error('Scope contains an illegal symbol, "'+t+'" is a reserved keyword')}(r),e(r,n,null)}}},n.prototype._compile=function(e,t){throw new Error("Method _compile should be implemented by type "+this.type)},n.prototype.forEach=function(e){throw new Error("Cannot run forEach on a Node interface")},n.prototype.map=function(e){throw new Error("Cannot run map on a Node interface")},n.prototype._ifNode=function(e){if(!(0,i.UG)(e))throw new TypeError("Callback function must return a Node");return e},n.prototype.traverse=function(e){e(this,null,null),function e(t,n){t.forEach((function(t,r,i){n(t,r,i),e(t,n)}))}(this,e)},n.prototype.transform=function(e){return function t(n,r,i){var a=e(n,r,i);return a!==n?a:n.map(t)}(this,null,null)},n.prototype.filter=function(e){var t=[];return this.traverse((function(n,r,i){e(n,r,i)&&t.push(n)})),t},n.prototype.clone=function(){throw new Error("Cannot clone a Node interface")},n.prototype.cloneDeep=function(){return this.map((function(e){return e.cloneDeep()}))},n.prototype.equals=function(e){return!!e&&(0,o.J5)(this,e)},n.prototype.toString=function(e){var t=this._getCustomString(e);return void 0!==t?t:this._toString(e)},n.prototype.toJSON=function(){throw new Error("Cannot serialize object: toJSON not implemented by "+this.type)},n.prototype.toHTML=function(e){var t=this._getCustomString(e);return void 0!==t?t:this.toHTML(e)},n.prototype._toString=function(){throw new Error("_toString not implemented for "+this.type)},n.prototype.toTex=function(e){var t=this._getCustomString(e);return void 0!==t?t:this._toTex(e)},n.prototype._toTex=function(e){throw new Error("_toTex not implemented for "+this.type)},n.prototype._getCustomString=function(e){if(e&&"object"==typeof e)switch(typeof e.handler){case"object":case"undefined":return;case"function":return e.handler(this,e);default:throw new TypeError("Object or function expected as callback")}},n.prototype.getIdentifier=function(){return this.type},n.prototype.getContent=function(){return this},n}),{isClass:!0,isNode:!0}),c=n(4444),f=["Node"],d=(0,s.d5)("ArrayNode",f,(e=>{var{Node:t}=e;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(this.items=e||[],!Array.isArray(this.items)||!this.items.every(i.UG))throw new TypeError("Array containing Nodes expected")}return n.prototype=new t,n.prototype.type="ArrayNode",n.prototype.isArrayNode=!0,n.prototype._compile=function(e,t){var n=(0,c.UI)(this.items,(function(n){return n._compile(e,t)}));if("Array"!==e.config.matrix){var r=e.matrix;return function(e,t,i){return r((0,c.UI)(n,(function(n){return n(e,t,i)})))}}return function(e,t,r){return(0,c.UI)(n,(function(n){return n(e,t,r)}))}},n.prototype.forEach=function(e){for(var t=0;t<this.items.length;t++)e(this.items[t],"items["+t+"]",this)},n.prototype.map=function(e){for(var t=[],r=0;r<this.items.length;r++)t[r]=this._ifNode(e(this.items[r],"items["+r+"]",this));return new n(t)},n.prototype.clone=function(){return new n(this.items.slice(0))},n.prototype._toString=function(e){return"["+this.items.map((function(t){return t.toString(e)})).join(", ")+"]"},n.prototype.toJSON=function(){return{mathjs:"ArrayNode",items:this.items}},n.fromJSON=function(e){return new n(e.items)},n.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>'},n.prototype._toTex=function(e){var t="\\begin{bmatrix}";return this.items.forEach((function(n){n.items?t+=n.items.map((function(t){return t.toTex(e)})).join("&"):t+=n.toTex(e),t+="\\\\"})),t+="\\end{bmatrix}"},n}),{isClass:!0,isNode:!0}),p=["ResultSet","Node"],h=(0,s.d5)("BlockNode",p,(e=>{var{ResultSet:t,Node:n}=e;function r(e){if(!(this instanceof r))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,n=!e||void 0===e.visible||e.visible;if(!(0,i.UG)(t))throw new TypeError('Property "node" must be a Node');if("boolean"!=typeof n)throw new TypeError('Property "visible" must be a boolean');return{node:t,visible:n}}))}return r.prototype=new n,r.prototype.type="BlockNode",r.prototype.isBlockNode=!0,r.prototype._compile=function(e,n){var r=(0,c.UI)(this.blocks,(function(t){return{evaluate:t.node._compile(e,n),visible:t.visible}}));return function(e,n,i){var a=[];return(0,c.Ed)(r,(function(t){var r=t.evaluate(e,n,i);t.visible&&a.push(r)})),new t(a)}},r.prototype.forEach=function(e){for(var t=0;t<this.blocks.length;t++)e(this.blocks[t].node,"blocks["+t+"].node",this)},r.prototype.map=function(e){for(var t=[],n=0;n<this.blocks.length;n++){var i=this.blocks[n],a=this._ifNode(e(i.node,"blocks["+n+"].node",this));t[n]={node:a,visible:i.visible}}return new r(t)},r.prototype.clone=function(){return new r(this.blocks.map((function(e){return{node:e.node,visible:e.visible}})))},r.prototype._toString=function(e){return this.blocks.map((function(t){return t.node.toString(e)+(t.visible?"":";")})).join("\n")},r.prototype.toJSON=function(){return{mathjs:"BlockNode",blocks:this.blocks}},r.fromJSON=function(e){return new r(e.blocks)},r.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>')},r.prototype._toTex=function(e){return this.blocks.map((function(t){return t.node.toTex(e)+(t.visible?"":";")})).join("\\;\\;\n")},r}),{isClass:!0,isNode:!0}),m=n(3014),v=n(7928),y={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{?}"},g={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"},_={abs:{1:"\\left|${args[0]}\\right|"},add:{2:"\\left(${args[0]}".concat(g.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(g.dotDivide,"${args[1]}\\right)")},dotMultiply:{2:"\\left(${args[0]}".concat(g.dotMultiply,"${args[1]}\\right)")},dotPow:{2:"\\left(${args[0]}".concat(g.dotPow,"${args[1]}\\right)")},exp:{1:"\\exp\\left(${args[0]}\\right)"},expm1:"\\left(e".concat(g.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(g.mod,"${args[1]}\\right)")},multiply:{2:"\\left(${args[0]}".concat(g.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(g.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(g.subtract,"${args[1]}\\right)")},unaryMinus:{1:"".concat(g.unaryMinus,"\\left(${args[0]}\\right)")},unaryPlus:{1:"".concat(g.unaryPlus,"\\left(${args[0]}\\right)")},bitAnd:{2:"\\left(${args[0]}".concat(g.bitAnd,"${args[1]}\\right)")},bitNot:{1:g.bitNot+"\\left(${args[0]}\\right)"},bitOr:{2:"\\left(${args[0]}".concat(g.bitOr,"${args[1]}\\right)")},bitXor:{2:"\\left(${args[0]}".concat(g.bitXor,"${args[1]}\\right)")},leftShift:{2:"\\left(${args[0]}".concat(g.leftShift,"${args[1]}\\right)")},rightArithShift:{2:"\\left(${args[0]}".concat(g.rightArithShift,"${args[1]}\\right)")},rightLogShift:{2:"\\left(${args[0]}".concat(g.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(g.and,"${args[1]}\\right)")},not:{1:g.not+"\\left(${args[0]}\\right)"},or:{2:"\\left(${args[0]}".concat(g.or,"${args[1]}\\right)")},xor:{2:"\\left(${args[0]}".concat(g.xor,"${args[1]}\\right)")},cross:{2:"\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)"},ctranspose:{1:"\\left(${args[0]}\\right)".concat(g.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(g.pow,"{\\frac{1}{2}}")},trace:{1:"\\mathrm{tr}\\left(${args[0]}\\right)"},transpose:{1:"\\left(${args[0]}\\right)".concat(g.transpose)},combinations:{2:"\\binom{${args[0]}}{${args[1]}}"},combinationsWithRep:{2:"\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)"},factorial:{1:"\\left(${args[0]}\\right)".concat(g.factorial)},gamma:{1:"\\Gamma\\left(${args[0]}\\right)"},equal:{2:"\\left(${args[0]}".concat(g.equal,"${args[1]}\\right)")},larger:{2:"\\left(${args[0]}".concat(g.larger,"${args[1]}\\right)")},largerEq:{2:"\\left(${args[0]}".concat(g.largerEq,"${args[1]}\\right)")},smaller:{2:"\\left(${args[0]}".concat(g.smaller,"${args[1]}\\right)")},smallerEq:{2:"\\left(${args[0]}".concat(g.smallerEq,"${args[1]}\\right)")},unequal:{2:"\\left(${args[0]}".concat(g.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(g.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(y.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)"}},b={deg:"^\\circ"};function x(e){return v(e,{preserveFormatting:!0})}function w(e,t){return(t=void 0!==t&&t)?(0,o.nr)(b,e)?b[e]:"\\mathrm{"+x(e)+"}":(0,o.nr)(y,e)?y[e]:x(e)}var E=["Node"],N=(0,s.d5)("ConstantNode",E,(e=>{var{Node:t}=e;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.value=e}return n.prototype=new t,n.prototype.type="ConstantNode",n.prototype.isConstantNode=!0,n.prototype._compile=function(e,t){var n=this.value;return function(){return n}},n.prototype.forEach=function(e){},n.prototype.map=function(e){return this.clone()},n.prototype.clone=function(){return new n(this.value)},n.prototype._toString=function(e){return(0,m.WU)(this.value,e)},n.prototype.toHTML=function(e){var t=this._toString(e);switch((0,i.kM)(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>"}},n.prototype.toJSON=function(){return{mathjs:"ConstantNode",value:this.value}},n.fromJSON=function(e){return new n(e.value)},n.prototype._toTex=function(e){var t=this._toString(e);switch((0,i.kM)(this.value)){case"string":return"\\mathtt{"+x(t)+"}";case"number":case"BigNumber":if(!isFinite(this.value))return this.value.valueOf()<0?"-\\infty":"\\infty";var n=t.toLowerCase().indexOf("e");return-1!==n?t.substring(0,n)+"\\cdot10^{"+t.substring(n+1)+"}":t;case"Fraction":return this.value.toLatex();default:return t}},n}),{isClass:!0,isNode:!0}),S=n(3068),M=["Node"],k=(0,s.d5)("ObjectNode",M,(e=>{var{Node:t}=e;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(this.properties=e||{},e&&("object"!=typeof e||!Object.keys(e).every((function(t){return(0,i.UG)(e[t])}))))throw new TypeError("Object containing Nodes expected")}return n.prototype=new t,n.prototype.type="ObjectNode",n.prototype.isObjectNode=!0,n.prototype._compile=function(e,t){var n={};for(var r in this.properties)if((0,o.nr)(this.properties,r)){var i=(0,m.Pz)(r),a=JSON.parse(i);if(!(0,S.pp)(this.properties,a))throw new Error('No access to property "'+a+'"');n[a]=this.properties[r]._compile(e,t)}return function(e,t,r){var i={};for(var a in n)(0,o.nr)(n,a)&&(i[a]=n[a](e,t,r));return i}},n.prototype.forEach=function(e){for(var t in this.properties)(0,o.nr)(this.properties,t)&&e(this.properties[t],"properties["+(0,m.Pz)(t)+"]",this)},n.prototype.map=function(e){var t={};for(var r in this.properties)(0,o.nr)(this.properties,r)&&(t[r]=this._ifNode(e(this.properties[r],"properties["+(0,m.Pz)(r)+"]",this)));return new n(t)},n.prototype.clone=function(){var e={};for(var t in this.properties)(0,o.nr)(this.properties,t)&&(e[t]=this.properties[t]);return new n(e)},n.prototype._toString=function(e){var t=[];for(var n in this.properties)(0,o.nr)(this.properties,n)&&t.push((0,m.Pz)(n)+": "+this.properties[n].toString(e));return"{"+t.join(", ")+"}"},n.prototype.toJSON=function(){return{mathjs:"ObjectNode",properties:this.properties}},n.fromJSON=function(e){return new n(e.properties)},n.prototype.toHTML=function(e){var t=[];for(var n in this.properties)(0,o.nr)(this.properties,n)&&t.push('<span class="math-symbol math-property">'+(0,m.YU)(n)+'</span><span class="math-operator math-assignment-operator math-property-assignment-operator math-binary-operator">:</span>'+this.properties[n].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>'},n.prototype._toTex=function(e){var t=[];for(var n in this.properties)(0,o.nr)(this.properties,n)&&t.push("\\mathbf{"+n+":} & "+this.properties[n].toTex(e)+"\\\\");return"\\left\\{\\begin{array}{ll}".concat(t.join("\n"),"\\end{array}\\right\\}")},n}),{isClass:!0,isNode:!0}),O=["Node"],C=(0,s.d5)("ParenthesisNode",O,(e=>{var{Node:t}=e;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(e))throw new TypeError('Node expected for parameter "content"');this.content=e}return n.prototype=new t,n.prototype.type="ParenthesisNode",n.prototype.isParenthesisNode=!0,n.prototype._compile=function(e,t){return this.content._compile(e,t)},n.prototype.getContent=function(){return this.content.getContent()},n.prototype.forEach=function(e){e(this.content,"content",this)},n.prototype.map=function(e){return new n(e(this.content,"content",this))},n.prototype.clone=function(){return new n(this.content)},n.prototype._toString=function(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?"("+this.content.toString(e)+")":this.content.toString(e)},n.prototype.toJSON=function(){return{mathjs:"ParenthesisNode",content:this.content}},n.fromJSON=function(e){return new n(e.content)},n.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)},n.prototype._toTex=function(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?"\\left(".concat(this.content.toTex(e),"\\right)"):this.content.toTex(e)},n}),{isClass:!0,isNode:!0}),A=[{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 T(e,t){var n=e;"keep"!==t&&(n=e.getContent());for(var r=n.getIdentifier(),i=0;i<A.length;i++)if(r in A[i])return i;return null}function I(e,t){var n=e;"keep"!==t&&(n=e.getContent());var r=n.getIdentifier(),i=T(n,t);if(null===i)return null;var a=A[i][r];if((0,o.nr)(a,"associativity")){if("left"===a.associativity)return"left";if("right"===a.associativity)return"right";throw Error("'"+r+"' has the invalid associativity '"+a.associativity+"'.")}return null}function D(e,t,n){var r="keep"!==n?e.getContent():e,i="keep"!==n?e.getContent():t,a=r.getIdentifier(),s=i.getIdentifier(),u=T(r,n);if(null===u)return null;var l=A[u][a];if((0,o.nr)(l,"associativeWith")&&l.associativeWith instanceof Array){for(var c=0;c<l.associativeWith.length;c++)if(l.associativeWith[c]===s)return!0;return!1}return null}var P=["Node"],j=(0,s.d5)("RelationalNode",P,(e=>{var{Node:t}=e;function n(e,t){if(!(this instanceof n))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 n.prototype=new t,n.prototype.type="RelationalNode",n.prototype.isRelationalNode=!0,n.prototype._compile=function(e,t){var n=this,r=this.params.map((n=>n._compile(e,t)));return function(t,i,a){for(var o,s=r[0](t,i,a),u=0;u<n.conditionals.length;u++)if(o=s,s=r[u+1](t,i,a),!(0,S.YF)(e,n.conditionals[u])(o,s))return!1;return!0}},n.prototype.forEach=function(e){this.params.forEach(((t,n)=>e(t,"params["+n+"]",this)),this)},n.prototype.map=function(e){return new n(this.conditionals.slice(),this.params.map(((t,n)=>this._ifNode(e(t,"params["+n+"]",this))),this))},n.prototype.clone=function(){return new n(this.conditionals,this.params)},n.prototype._toString=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",n=T(this,t),r=this.params.map((function(r,i){var a=T(r,t);return"all"===t||null!==a&&a<=n?"("+r.toString(e)+")":r.toString(e)})),i={equal:"==",unequal:"!=",smaller:"<",larger:">",smallerEq:"<=",largerEq:">="},a=r[0],o=0;o<this.conditionals.length;o++)a+=" "+i[this.conditionals[o]]+" "+r[o+1];return a},n.prototype.toJSON=function(){return{mathjs:"RelationalNode",conditionals:this.conditionals,params:this.params}},n.fromJSON=function(e){return new n(e.conditionals,e.params)},n.prototype.toHTML=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",n=T(this,t),r=this.params.map((function(r,i){var a=T(r,t);return"all"===t||null!==a&&a<=n?'<span class="math-parenthesis math-round-parenthesis">(</span>'+r.toHTML(e)+'<span class="math-parenthesis math-round-parenthesis">)</span>':r.toHTML(e)})),i={equal:"==",unequal:"!=",smaller:"<",larger:">",smallerEq:"<=",largerEq:">="},a=r[0],o=0;o<this.conditionals.length;o++)a+='<span class="math-operator math-binary-operator math-explicit-binary-operator">'+(0,m.YU)(i[this.conditionals[o]])+"</span>"+r[o+1];return a},n.prototype._toTex=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",n=T(this,t),r=this.params.map((function(r,i){var a=T(r,t);return"all"===t||null!==a&&a<=n?"\\left("+r.toTex(e)+"\right)":r.toTex(e)})),i=r[0],a=0;a<this.conditionals.length;a++)i+=g[this.conditionals[a]]+r[a+1];return i},n}),{isClass:!0,isNode:!0}),R=["?on","math"],L=(0,s.d5)("Chain",R,(e=>{var{on:t,math:n}=e;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");(0,i.qg)(e)?this.value=e.value:this.value=e}function a(e,t){(0,o.Vo)(r.prototype,e,(function(){var e=t();if("function"==typeof e)return s(e)}))}function s(e){return function(){for(var t=[this.value],n=0;n<arguments.length;n++)t[n+1]=arguments[n];return new r(e.apply(e,t))}}r.prototype.type="Chain",r.prototype.isChain=!0,r.prototype.done=function(){return this.value},r.prototype.valueOf=function(){return this.value},r.prototype.toString=function(){return(0,m.WU)(this.value)},r.prototype.toJSON=function(){return{mathjs:"Chain",value:this.value}},r.fromJSON=function(e){return new r(e.value)},r.createProxy=function(e,t){if("string"==typeof e)!function(e,t){"function"==typeof t&&(r.prototype[e]=s(t))}(e,t);else{var n=function(t){(0,o.nr)(e,t)&&void 0===u[t]&&a(t,(()=>e[t]))};for(var i in e)n(i)}};var u={expression:!0,docs:!0,type:!0,classes:!0,json:!0,error:!0,isChain:!0};return r.createProxy(n),t&&t("import",(function(e,t,n){n||a(e,t)})),r}),{isClass:!0}),B=["classes"],U=(0,s.d5)("reviver",B,(e=>{var{classes:t}=e;return function(e,n){var r=t[n&&n.mathjs];return r&&"function"==typeof r.fromJSON?r.fromJSON(n):n}})),q=["Node"],z=(0,s.d5)("ConditionalNode",q,(e=>{var{Node:t}=e;function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(e))throw new TypeError("Parameter condition must be a Node");if(!(0,i.UG)(t))throw new TypeError("Parameter trueExpr must be a Node");if(!(0,i.UG)(r))throw new TypeError("Parameter falseExpr must be a Node");this.condition=e,this.trueExpr=t,this.falseExpr=r}return n.prototype=new t,n.prototype.type="ConditionalNode",n.prototype.isConditionalNode=!0,n.prototype._compile=function(e,t){var n=this.condition._compile(e,t),r=this.trueExpr._compile(e,t),a=this.falseExpr._compile(e,t);return function(e,t,o){return function(e){if("number"==typeof e||"boolean"==typeof e||"string"==typeof e)return!!e;if(e){if((0,i.l9)(e))return!e.isZero();if((0,i.Mc)(e))return!(!e.re&&!e.im);if((0,i.wr)(e))return!!e.value}if(null==e)return!1;throw new TypeError('Unsupported type of condition "'+(0,i.kM)(e)+'"')}(n(e,t,o))?r(e,t,o):a(e,t,o)}},n.prototype.forEach=function(e){e(this.condition,"condition",this),e(this.trueExpr,"trueExpr",this),e(this.falseExpr,"falseExpr",this)},n.prototype.map=function(e){return new n(this._ifNode(e(this.condition,"condition",this)),this._ifNode(e(this.trueExpr,"trueExpr",this)),this._ifNode(e(this.falseExpr,"falseExpr",this)))},n.prototype.clone=function(){return new n(this.condition,this.trueExpr,this.falseExpr)},n.prototype._toString=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",n=T(this,t),r=this.condition.toString(e),i=T(this.condition,t);("all"===t||"OperatorNode"===this.condition.type||null!==i&&i<=n)&&(r="("+r+")");var a=this.trueExpr.toString(e),o=T(this.trueExpr,t);("all"===t||"OperatorNode"===this.trueExpr.type||null!==o&&o<=n)&&(a="("+a+")");var s=this.falseExpr.toString(e),u=T(this.falseExpr,t);return("all"===t||"OperatorNode"===this.falseExpr.type||null!==u&&u<=n)&&(s="("+s+")"),r+" ? "+a+" : "+s},n.prototype.toJSON=function(){return{mathjs:"ConditionalNode",condition:this.condition,trueExpr:this.trueExpr,falseExpr:this.falseExpr}},n.fromJSON=function(e){return new n(e.condition,e.trueExpr,e.falseExpr)},n.prototype.toHTML=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",n=T(this,t),r=this.condition.toHTML(e),i=T(this.condition,t);("all"===t||"OperatorNode"===this.condition.type||null!==i&&i<=n)&&(r='<span class="math-parenthesis math-round-parenthesis">(</span>'+r+'<span class="math-parenthesis math-round-parenthesis">)</span>');var a=this.trueExpr.toHTML(e),o=T(this.trueExpr,t);("all"===t||"OperatorNode"===this.trueExpr.type||null!==o&&o<=n)&&(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=T(this.falseExpr,t);return("all"===t||"OperatorNode"===this.falseExpr.type||null!==u&&u<=n)&&(s='<span class="math-parenthesis math-round-parenthesis">(</span>'+s+'<span class="math-parenthesis math-round-parenthesis">)</span>'),r+'<span class="math-operator math-conditional-operator">?</span>'+a+'<span class="math-operator math-conditional-operator">:</span>'+s},n.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}"},n}),{isClass:!0,isNode:!0}),F=["Node"],H=(0,s.d5)("OperatorNode",F,(e=>{var{Node:t}=e;function n(e,t,r,a){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 "op"');if("string"!=typeof t)throw new TypeError('string expected for parameter "fn"');if(!Array.isArray(r)||!r.every(i.UG))throw new TypeError('Array containing Nodes expected for parameter "args"');this.implicit=!0===a,this.op=e,this.fn=t,this.args=r||[]}function r(e,t,n,r,i){var a,o=T(e,t),s=I(e,t);if("all"===t||r.length>2&&"OperatorNode:add"!==e.getIdentifier()&&"OperatorNode:multiply"!==e.getIdentifier())return r.map((function(e){switch(e.getContent().type){case"ArrayNode":case"ConstantNode":case"SymbolNode":case"ParenthesisNode":return!1;default:return!0}}));switch(r.length){case 0:a=[];break;case 1:var u=T(r[0],t);if(i&&null!==u){var l,c;if("keep"===t?(l=r[0].getIdentifier(),c=e.getIdentifier()):(l=r[0].getContent().getIdentifier(),c=e.getContent().getIdentifier()),!1===A[o][c].latexLeftParens){a=[!1];break}if(!1===A[u][l].latexParens){a=[!1];break}}if(null===u){a=[!1];break}if(u<=o){a=[!0];break}a=[!1];break;case 2:var f,d,p=T(r[0],t),h=D(e,r[0],t);f=null!==p&&(p===o&&"right"===s&&!h||p<o);var m,v,y,g=T(r[1],t),_=D(e,r[1],t);d=null!==g&&(g===o&&"left"===s&&!_||g<o),i&&("keep"===t?(m=e.getIdentifier(),v=e.args[0].getIdentifier(),y=e.args[1].getIdentifier()):(m=e.getContent().getIdentifier(),v=e.args[0].getContent().getIdentifier(),y=e.args[1].getContent().getIdentifier()),null!==p&&(!1===A[o][m].latexLeftParens&&(f=!1),!1===A[p][v].latexParens&&(f=!1)),null!==g&&(!1===A[o][m].latexRightParens&&(d=!1),!1===A[g][y].latexParens&&(d=!1))),a=[f,d];break;default:"OperatorNode:add"!==e.getIdentifier()&&"OperatorNode:multiply"!==e.getIdentifier()||(a=r.map((function(n){var r=T(n,t),i=D(e,n,t),a=I(n,t);return null!==r&&(o===r&&s===a&&!i||r<o)})))}return r.length>=2&&"OperatorNode:multiply"===e.getIdentifier()&&e.implicit&&"auto"===t&&"hide"===n&&(a=r.map((function(e,t){var n="ParenthesisNode"===e.getIdentifier();return!(!a[t]&&!n)}))),a}return n.prototype=new t,n.prototype.type="OperatorNode",n.prototype.isOperatorNode=!0,n.prototype._compile=function(e,t){if("string"!=typeof this.fn||!(0,S.OJ)(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 n=(0,S.YF)(e,this.fn),r=(0,c.UI)(this.args,(function(n){return n._compile(e,t)}));if(1===r.length){var i=r[0];return function(e,t,r){return n(i(e,t,r))}}if(2===r.length){var a=r[0],o=r[1];return function(e,t,r){return n(a(e,t,r),o(e,t,r))}}return function(e,t,i){return n.apply(null,(0,c.UI)(r,(function(n){return n(e,t,i)})))}},n.prototype.forEach=function(e){for(var t=0;t<this.args.length;t++)e(this.args[t],"args["+t+"]",this)},n.prototype.map=function(e){for(var t=[],r=0;r<this.args.length;r++)t[r]=this._ifNode(e(this.args[r],"args["+r+"]",this));return new n(this.op,this.fn,t,this.implicit)},n.prototype.clone=function(){return new n(this.op,this.fn,this.args.slice(0),this.implicit)},n.prototype.isUnary=function(){return 1===this.args.length},n.prototype.isBinary=function(){return 2===this.args.length},n.prototype._toString=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",n=e&&e.implicit?e.implicit:"hide",i=this.args,a=r(this,t,n,i,!1);if(1===i.length){var o=I(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 l=i[0].toString(e),c=i[1].toString(e);return a[0]&&(l="("+l+")"),a[1]&&(c="("+c+")"),this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===n?l+" "+c:l+" "+this.op+" "+c}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){var f=i.map((function(t,n){return t=t.toString(e),a[n]&&(t="("+t+")"),t}));return this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===n?f.join(" "):f.join(" "+this.op+" ")}return this.fn+"("+this.args.join(", ")+")"},n.prototype.toJSON=function(){return{mathjs:"OperatorNode",op:this.op,fn:this.fn,args:this.args,implicit:this.implicit}},n.fromJSON=function(e){return new n(e.op,e.fn,e.args,e.implicit)},n.prototype.toHTML=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",n=e&&e.implicit?e.implicit:"hide",i=this.args,a=r(this,t,n,i,!1);if(1===i.length){var o=I(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">'+(0,m.YU)(this.op)+"</span>"+s:s+'<span class="math-operator math-unary-operator math-righthand-unary-operator">'+(0,m.YU)(this.op)+"</span>"}if(2===i.length){var u=i[0].toHTML(e),l=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]&&(l='<span class="math-parenthesis math-round-parenthesis">(</span>'+l+'<span class="math-parenthesis math-round-parenthesis">)</span>'),this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===n?u+'<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>'+l:u+'<span class="math-operator math-binary-operator math-explicit-binary-operator">'+(0,m.YU)(this.op)+"</span>"+l}var c=i.map((function(t,n){return t=t.toHTML(e),a[n]&&(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"===n?c.join('<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>'):c.join('<span class="math-operator math-binary-operator math-explicit-binary-operator">'+(0,m.YU)(this.op)+"</span>"):'<span class="math-function">'+(0,m.YU)(this.fn)+'</span><span class="math-paranthesis math-round-parenthesis">(</span>'+c.join('<span class="math-separator">,</span>')+'<span class="math-paranthesis math-round-parenthesis">)</span>'},n.prototype._toTex=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",n=e&&e.implicit?e.implicit:"hide",i=this.args,a=r(this,t,n,i,!0),o=g[this.fn];if(o=void 0===o?this.op:o,1===i.length){var s=I(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 l=i[0],c=l.toTex(e);a[0]&&(c="\\left(".concat(c,"\\right)"));var f,d=i[1].toTex(e);switch(a[1]&&(d="\\left(".concat(d,"\\right)")),f="keep"===t?l.getIdentifier():l.getContent().getIdentifier(),this.getIdentifier()){case"OperatorNode:divide":return o+"{"+c+"}{"+d+"}";case"OperatorNode:pow":switch(c="{"+c+"}",d="{"+d+"}",f){case"ConditionalNode":case"OperatorNode:divide":c="\\left(".concat(c,"\\right)")}break;case"OperatorNode:multiply":if(this.implicit&&"hide"===n)return c+"~"+d}return c+o+d}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){var p=i.map((function(t,n){return t=t.toTex(e),a[n]&&(t="\\left(".concat(t,"\\right)")),t}));return"OperatorNode:multiply"===this.getIdentifier()&&this.implicit?p.join("~"):p.join(o)}return"\\mathrm{"+this.fn+"}\\left("+i.map((function(t){return t.toTex(e)})).join(",")+"\\right)"},n.prototype.getIdentifier=function(){return this.type+":"+this.fn},n}),{isClass:!0,isNode:!0}),Z=["Node"],W=(0,s.d5)("RangeNode",Z,(e=>{var{Node:t}=e;function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(e))throw new TypeError("Node expected");if(!(0,i.UG)(t))throw new TypeError("Node expected");if(r&&!(0,i.UG)(r))throw new TypeError("Node expected");if(arguments.length>3)throw new Error("Too many arguments");this.start=e,this.end=t,this.step=r||null}function r(e,t){var n=T(e,t),r={},i=T(e.start,t);if(r.start=null!==i&&i<=n||"all"===t,e.step){var a=T(e.step,t);r.step=null!==a&&a<=n||"all"===t}var o=T(e.end,t);return r.end=null!==o&&o<=n||"all"===t,r}return n.prototype=new t,n.prototype.type="RangeNode",n.prototype.isRangeNode=!0,n.prototype.needsEnd=function(){return this.filter((function(e){return(0,i.FG)(e)&&"end"===e.name})).length>0},n.prototype._compile=function(e,t){var n=e.range,r=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 n(r(e,t,o),i(e,t,o),a(e,t,o))}}return function(e,t,a){return n(r(e,t,a),i(e,t,a))}},n.prototype.forEach=function(e){e(this.start,"start",this),e(this.end,"end",this),this.step&&e(this.step,"step",this)},n.prototype.map=function(e){return new n(this._ifNode(e(this.start,"start",this)),this._ifNode(e(this.end,"end",this)),this.step&&this._ifNode(e(this.step,"step",this)))},n.prototype.clone=function(){return new n(this.start,this.end,this.step&&this.step)},n.prototype._toString=function(e){var t,n=r(this,e&&e.parenthesis?e.parenthesis:"keep"),i=this.start.toString(e);if(n.start&&(i="("+i+")"),t=i,this.step){var a=this.step.toString(e);n.step&&(a="("+a+")"),t+=":"+a}var o=this.end.toString(e);return n.end&&(o="("+o+")"),t+":"+o},n.prototype.toJSON=function(){return{mathjs:"RangeNode",start:this.start,end:this.end,step:this.step}},n.fromJSON=function(e){return new n(e.start,e.end,e.step)},n.prototype.toHTML=function(e){var t,n=r(this,e&&e.parenthesis?e.parenthesis:"keep"),i=this.start.toHTML(e);if(n.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);n.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 n.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},n.prototype._toTex=function(e){var t=r(this,e&&e.parenthesis?e.parenthesis:"keep"),n=this.start.toTex(e);if(t.start&&(n="\\left(".concat(n,"\\right)")),this.step){var i=this.step.toTex(e);t.step&&(i="\\left(".concat(i,"\\right)")),n+=":"+i}var a=this.end.toTex(e);return t.end&&(a="\\left(".concat(a,"\\right)")),n+":"+a},n}),{isClass:!0,isNode:!0}),G=["typed","Node"],J=(0,s.d5)("FunctionAssignmentNode",G,(e=>{var{typed:t,Node:n}=e;function r(e,t,n){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 "name"');if(!Array.isArray(t))throw new TypeError('Array containing strings or objects expected for parameter "params"');if(!(0,i.UG)(n))throw new TypeError('Node expected for parameter "expr"');if(e in a)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=n}function o(e,t){var n=T(e,t),r=T(e.expr,t);return"all"===t||null!==r&&r<=n}return r.prototype=new n,r.prototype.type="FunctionAssignmentNode",r.prototype.isFunctionAssignmentNode=!0,r.prototype._compile=function(e,n){var r=Object.create(n);(0,c.Ed)(this.params,(function(e){r[e]=!0}));var i=this.expr._compile(e,r),a=this.name,o=this.params,s=(0,c.v_)(this.types,","),u=a+"("+(0,c.v_)(this.params,", ")+")";return function(e,n,r){var l={};l[s]=function(){for(var t=Object.create(n),a=0;a<o.length;a++)t[o[a]]=arguments[a];return i(e,t,r)};var c=t(a,l);return c.syntax=u,(0,S.nI)(e,a,c),c}},r.prototype.forEach=function(e){e(this.expr,"expr",this)},r.prototype.map=function(e){var t=this._ifNode(e(this.expr,"expr",this));return new r(this.name,this.params.slice(0),t)},r.prototype.clone=function(){return new r(this.name,this.params.slice(0),this.expr)},r.prototype._toString=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",n=this.expr.toString(e);return o(this,t)&&(n="("+n+")"),this.name+"("+this.params.join(", ")+") = "+n},r.prototype.toJSON=function(){var e=this.types;return{mathjs:"FunctionAssignmentNode",name:this.name,params:this.params.map((function(t,n){return{name:t,type:e[n]}})),expr:this.expr}},r.fromJSON=function(e){return new r(e.name,e.params,e.expr)},r.prototype.toHTML=function(e){for(var t=e&&e.parenthesis?e.parenthesis:"keep",n=[],r=0;r<this.params.length;r++)n.push('<span class="math-symbol math-parameter">'+(0,m.YU)(this.params[r])+"</span>");var i=this.expr.toHTML(e);return o(this,t)&&(i='<span class="math-parenthesis math-round-parenthesis">(</span>'+i+'<span class="math-parenthesis math-round-parenthesis">)</span>'),'<span class="math-function">'+(0,m.YU)(this.name)+'</span><span class="math-parenthesis math-round-parenthesis">(</span>'+n.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>'+i},r.prototype._toTex=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",n=this.expr.toTex(e);return o(this,t)&&(n="\\left(".concat(n,"\\right)")),"\\mathrm{"+this.name+"}\\left("+this.params.map(w).join(",")+"\\right):="+n},r}),{isClass:!0,isNode:!0}),$="chain",V=["typed","Chain"],K=(0,s.d5)($,V,(e=>{var{typed:t,Chain:n}=e;return t($,{"":function(){return new n},any:function(e){return new n(e)}})})),Y=n(1647);function X(e){return e&&e.isIndexError?new Y.c(e.index+1,e.min+1,void 0!==e.max?e.max+1:void 0):e}function Q(e){var{subset:t}=e;return function(e,n){try{if(Array.isArray(e))return t(e,n);if(e&&"function"==typeof e.subset)return e.subset(n);if("string"==typeof e)return t(e,n);if("object"==typeof e){if(!n.isObjectProperty())throw new TypeError("Cannot apply a numeric index as object property");return(0,S.YF)(e,n.getObjectProperty())}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw X(e)}}}var ee=["subset","Node"],te=(0,s.d5)("AccessorNode",ee,(e=>{var{subset:t,Node:n}=e,r=Q({subset:t});function a(e,t){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(e))throw new TypeError('Node expected for parameter "object"');if(!(0,i.Cl)(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 o(e){return!((0,i.Yz)(e)||(0,i.j0)(e)||(0,i.nu)(e)||(0,i.VO)(e)||(0,i.Lr)(e)||(0,i.Ig)(e)||(0,i.FG)(e))}return a.prototype=new n,a.prototype.type="AccessorNode",a.prototype.isAccessorNode=!0,a.prototype._compile=function(e,t){var n=this.object._compile(e,t),i=this.index._compile(e,t);if(this.index.isObjectProperty()){var a=this.index.getObjectProperty();return function(e,t,r){return(0,S.YF)(n(e,t,r),a)}}return function(e,t,a){var o=n(e,t,a),s=i(e,t,o);return r(o,s)}},a.prototype.forEach=function(e){e(this.object,"object",this),e(this.index,"index",this)},a.prototype.map=function(e){return new a(this._ifNode(e(this.object,"object",this)),this._ifNode(e(this.index,"index",this)))},a.prototype.clone=function(){return new a(this.object,this.index)},a.prototype._toString=function(e){var t=this.object.toString(e);return o(this.object)&&(t="("+t+")"),t+this.index.toString(e)},a.prototype.toHTML=function(e){var t=this.object.toHTML(e);return o(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)},a.prototype._toTex=function(e){var t=this.object.toTex(e);return o(this.object)&&(t="\\left(' + object + '\\right)"),t+this.index.toTex(e)},a.prototype.toJSON=function(){return{mathjs:"AccessorNode",object:this.object,index:this.index}},a.fromJSON=function(e){return new a(e.object,e.index)},a}),{isClass:!0,isNode:!0}),ne=["Range","Node","size"],re=(0,s.d5)("IndexNode",ne,(e=>{var{Range:t,Node:n,size:r}=e;function a(e,t){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");if(this.dimensions=e,this.dotNotation=t||!1,!Array.isArray(e)||!e.every(i.UG))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 o(e,n,r){return new t((0,i.l9)(e)?e.toNumber():e,(0,i.l9)(n)?n.toNumber():n,(0,i.l9)(r)?r.toNumber():r)}return a.prototype=new n,a.prototype.type="IndexNode",a.prototype.isIndexNode=!0,a.prototype._compile=function(e,t){var n=(0,c.UI)(this.dimensions,(function(n,a){if((0,i.ex)(n)){if(n.needsEnd()){var s=Object.create(t);s.end=!0;var u=n.start._compile(e,s),l=n.end._compile(e,s),c=n.step?n.step._compile(e,s):function(){return 1};return function(e,t,n){var i=r(n).valueOf(),s=Object.create(t);return s.end=i[a],o(u(e,s,n),l(e,s,n),c(e,s,n))}}var f=n.start._compile(e,t),d=n.end._compile(e,t),p=n.step?n.step._compile(e,t):function(){return 1};return function(e,t,n){return o(f(e,t,n),d(e,t,n),p(e,t,n))}}if((0,i.FG)(n)&&"end"===n.name){var h=Object.create(t);h.end=!0;var m=n._compile(e,h);return function(e,t,n){var i=r(n).valueOf(),o=Object.create(t);return o.end=i[a],m(e,o,n)}}var v=n._compile(e,t);return function(e,t,n){return v(e,t,n)}})),a=(0,S.YF)(e,"index");return function(e,t,r){var i=(0,c.UI)(n,(function(n){return n(e,t,r)}));return a(...i)}},a.prototype.forEach=function(e){for(var t=0;t<this.dimensions.length;t++)e(this.dimensions[t],"dimensions["+t+"]",this)},a.prototype.map=function(e){for(var t=[],n=0;n<this.dimensions.length;n++)t[n]=this._ifNode(e(this.dimensions[n],"dimensions["+n+"]",this));return new a(t,this.dotNotation)},a.prototype.clone=function(){return new a(this.dimensions.slice(0),this.dotNotation)},a.prototype.isObjectProperty=function(){return 1===this.dimensions.length&&(0,i.nu)(this.dimensions[0])&&"string"==typeof this.dimensions[0].value},a.prototype.getObjectProperty=function(){return this.isObjectProperty()?this.dimensions[0].value:null},a.prototype._toString=function(e){return this.dotNotation?"."+this.getObjectProperty():"["+this.dimensions.join(", ")+"]"},a.prototype.toJSON=function(){return{mathjs:"IndexNode",dimensions:this.dimensions,dotNotation:this.dotNotation}},a.fromJSON=function(e){return new a(e.dimensions,e.dotNotation)},a.prototype.toHTML=function(e){for(var t=[],n=0;n<this.dimensions.length;n++)t[n]=this.dimensions[n].toHTML();return this.dotNotation?'<span class="math-operator math-accessor-operator">.</span><span class="math-symbol math-property">'+(0,m.YU)(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>'},a.prototype._toTex=function(e){var t=this.dimensions.map((function(t){return t.toTex(e)}));return this.dotNotation?"."+this.getObjectProperty():"_{"+t.join(",")+"}"},a}),{isClass:!0,isNode:!0}),ie=["subset","?matrix","Node"],ae=(0,s.d5)("AssignmentNode",ie,(e=>{var{subset:t,matrix:n,Node:r}=e,a=Q({subset:t}),o=function(e){var{subset:t,matrix:n}=e;return function(e,r,i){try{if(Array.isArray(e))return n(e).subset(r,i).valueOf();if(e&&"function"==typeof e.subset)return e.subset(r,i);if("string"==typeof e)return t(e,r,i);if("object"==typeof e){if(!r.isObjectProperty())throw TypeError("Cannot apply a numeric index as object property");return(0,S.nI)(e,r.getObjectProperty(),i),e}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw X(e)}}}({subset:t,matrix:n});function s(e,t,n){if(!(this instanceof s))throw new SyntaxError("Constructor must be called with the new operator");if(this.object=e,this.index=n?t:null,this.value=n||t,!(0,i.FG)(e)&&!(0,i.Yz)(e))throw new TypeError('SymbolNode or AccessorNode expected as "object"');if((0,i.FG)(e)&&"end"===e.name)throw new Error('Cannot assign to symbol "end"');if(this.index&&!(0,i.Cl)(this.index))throw new TypeError('IndexNode expected as "index"');if(!(0,i.UG)(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 n=T(e,t),r=T(e.value,t);return"all"===t||null!==r&&r<=n}return s.prototype=new r,s.prototype.type="AssignmentNode",s.prototype.isAssignmentNode=!0,s.prototype._compile=function(e,t){var n=this.object._compile(e,t),r=this.index?this.index._compile(e,t):null,s=this.value._compile(e,t),u=this.object.name;if(this.index){if(this.index.isObjectProperty()){var l=this.index.getObjectProperty();return function(e,t,r){var i=n(e,t,r),a=s(e,t,r);return(0,S.nI)(i,l,a)}}if((0,i.FG)(this.object))return function(e,t,i){var a=n(e,t,i),l=s(e,t,i),c=r(e,t,a);return(0,S.nI)(e,u,o(a,c,l)),l};var c=this.object.object._compile(e,t);if(this.object.index.isObjectProperty()){var f=this.object.index.getObjectProperty();return function(e,t,n){var i=c(e,t,n),a=(0,S.YF)(i,f),u=r(e,t,a),l=s(e,t,n);return(0,S.nI)(i,f,o(a,u,l)),l}}var d=this.object.index._compile(e,t);return function(e,t,n){var i=c(e,t,n),u=d(e,t,i),l=a(i,u),f=r(e,t,l),p=s(e,t,n);return o(i,u,o(l,f,p)),p}}if(!(0,i.FG)(this.object))throw new TypeError("SymbolNode expected as object");return function(e,t,n){return(0,S.nI)(e,u,s(e,t,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),n=this.index?this.index.toString(e):"",r=this.value.toString(e);return u(this,e&&e.parenthesis)&&(r="("+r+")"),t+n+" = "+r},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),n=this.index?this.index.toHTML(e):"",r=this.value.toHTML(e);return u(this,e&&e.parenthesis)&&(r='<span class="math-paranthesis math-round-parenthesis">(</span>'+r+'<span class="math-paranthesis math-round-parenthesis">)</span>'),t+n+'<span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>'+r},s.prototype._toTex=function(e){var t=this.object.toTex(e),n=this.index?this.index.toTex(e):"",r=this.value.toTex(e);return u(this,e&&e.parenthesis)&&(r="\\left(".concat(r,"\\right)")),t+n+":="+r},s}),{isClass:!0,isNode:!0}),oe=["math","?Unit","Node"],se=(0,s.d5)("SymbolNode",oe,(e=>{var{math:t,Unit:n,Node:r}=e;function i(e){return!!n&&n.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 r,a.prototype.type="SymbolNode",a.prototype.isSymbolNode=!0,a.prototype._compile=function(e,t){var r=this.name;if(!0===t[r])return function(e,t,n){return t[r]};if(r in e)return function(t,n,i){return r in t?(0,S.YF)(t,r):(0,S.YF)(e,r)};var a=i(r);return function(e,t,i){return r in e?(0,S.YF)(e,r):a?new n(null,r):function(e){throw new Error("Undefined symbol "+e)}(r)}},a.prototype.forEach=function(e){},a.prototype.map=function(e){return this.clone()},a.prototype.clone=function(){return new a(this.name)},a.prototype._toString=function(e){return this.name},a.prototype.toHTML=function(e){var t=(0,m.YU)(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 n=!1;void 0===t[this.name]&&i(this.name)&&(n=!0);var r=w(this.name,n);return"\\"===r[0]?r:" "+r},a}),{isClass:!0,isNode:!0});function ue(){return(ue=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e}).apply(this,arguments)}var le=["math","Node","SymbolNode"],ce=(0,s.d5)("FunctionNode",le,(e=>{var{math:t,Node:n,SymbolNode:r}=e;function a(e,t){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");if("string"==typeof e&&(e=new r(e)),!(0,i.UG)(e))throw new TypeError('Node expected as parameter "fn"');if(!Array.isArray(t)||!t.every(i.UG))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")}})}a.prototype=new n,a.prototype.type="FunctionNode",a.prototype.isFunctionNode=!0,a.prototype._compile=function(e,t){if(!(this instanceof a))throw new TypeError("No valid FunctionNode");var n=(0,c.UI)(this.args,(function(n){return n._compile(e,t)}));if((0,i.FG)(this.fn)){var r=this.fn.name,o=r in e?(0,S.YF)(e,r):void 0;if("function"==typeof o&&!0===o.rawArgs){var s=this.args;return function(t,n,i){return(r in t?(0,S.YF)(t,r):o)(s,e,ue({},t,n))}}if(1===n.length){var u=n[0];return function(e,t,n){return(r in e?(0,S.YF)(e,r):o)(u(e,t,n))}}if(2===n.length){var l=n[0],f=n[1];return function(e,t,n){return(r in e?(0,S.YF)(e,r):o)(l(e,t,n),f(e,t,n))}}return function(e,t,i){return(r in e?(0,S.YF)(e,r):o).apply(null,(0,c.UI)(n,(function(n){return n(e,t,i)})))}}if((0,i.Yz)(this.fn)&&(0,i.Cl)(this.fn.index)&&this.fn.index.isObjectProperty()){var d=this.fn.object._compile(e,t),p=this.fn.index.getObjectProperty(),h=this.args;return function(t,r,i){var a=d(t,r,i);return(0,S.np)(a,p),a[p]&&a[p].rawArgs?a[p](h,e,ue({},t,r)):a[p].apply(a,(0,c.UI)(n,(function(e){return e(t,r,i)})))}}var m=this.fn._compile(e,t),v=this.args;return function(t,r,i){var a=m(t,r,i);return a&&a.rawArgs?a(v,e,ue({},t,r)):a.apply(a,(0,c.UI)(n,(function(e){return e(t,r,i)})))}},a.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)},a.prototype.map=function(e){for(var t=this._ifNode(e(this.fn,"fn",this)),n=[],r=0;r<this.args.length;r++)n[r]=this._ifNode(e(this.args[r],"args["+r+"]",this));return new a(t,n)},a.prototype.clone=function(){return new a(this.fn,this.args.slice(0))};var s=a.prototype.toString;function u(e,t,n){for(var r,a="",o=/\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi,s=0;null!==(r=o.exec(e));)if(a+=e.substring(s,r.index),s=r.index,"$$"===r[0])a+="$",s++;else{s+=r[0].length;var u=t[r[1]];if(!u)throw new ReferenceError("Template: Property "+r[1]+" does not exist.");if(void 0===r[2])switch(typeof u){case"string":a+=u;break;case"object":if((0,i.UG)(u))a+=u.toTex(n);else{if(!Array.isArray(u))throw new TypeError("Template: "+r[1]+" has to be a Node, String or array of Nodes");a+=u.map((function(e,t){if((0,i.UG)(e))return e.toTex(n);throw new TypeError("Template: "+r[1]+"["+t+"] is not a Node.")})).join(",")}break;default:throw new TypeError("Template: "+r[1]+" has to be a Node, String or array of Nodes")}else{if(!(0,i.UG)(u[r[2]]&&u[r[2]]))throw new TypeError("Template: "+r[1]+"["+r[2]+"] is not a Node.");a+=u[r[2]].toTex(n)}}return a+e.slice(s)}a.prototype.toString=function(e){var t,n=this.fn.toString(e);return e&&"object"==typeof e.handler&&(0,o.nr)(e.handler,n)&&(t=e.handler[n](this,e)),void 0!==t?t:s.call(this,e)},a.prototype._toString=function(e){var t=this.args.map((function(t){return t.toString(e)}));return((0,i.l7)(this.fn)?"("+this.fn.toString(e)+")":this.fn.toString(e))+"("+t.join(", ")+")"},a.prototype.toJSON=function(){return{mathjs:"FunctionNode",fn:this.fn,args:this.args}},a.fromJSON=function(e){return new a(e.fn,e.args)},a.prototype.toHTML=function(e){var t=this.args.map((function(t){return t.toHTML(e)}));return'<span class="math-function">'+(0,m.YU)(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 l=a.prototype.toTex;return a.prototype.toTex=function(e){var t;return e&&"object"==typeof e.handler&&(0,o.nr)(e.handler,this.name)&&(t=e.handler[this.name](this,e)),void 0!==t?t:l.call(this,e)},a.prototype._toTex=function(e){var n,r,i=this.args.map((function(t){return t.toTex(e)}));switch(_[this.name]&&(n=_[this.name]),!t[this.name]||"function"!=typeof t[this.name].toTex&&"object"!=typeof t[this.name].toTex&&"string"!=typeof t[this.name].toTex||(n=t[this.name].toTex),typeof n){case"function":r=n(this,e);break;case"string":r=u(n,this,e);break;case"object":switch(typeof n[i.length]){case"function":r=n[i.length](this,e);break;case"string":r=u(n[i.length],this,e)}}return void 0!==r?r:u("\\mathrm{${name}}\\left(${args}\\right)",this,e)},a.prototype.getIdentifier=function(){return this.type+":"+this.name},a}),{isClass:!0,isNode:!0}),fe=n(4344);function de(){return(de=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e}).apply(this,arguments)}var pe="parse",he=["typed","numeric","config","AccessorNode","ArrayNode","AssignmentNode","BlockNode","ConditionalNode","ConstantNode","FunctionAssignmentNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","RangeNode","RelationalNode","SymbolNode"],me=(0,s.d5)(pe,he,(e=>{var{typed:t,numeric:n,config:r,AccessorNode:a,ArrayNode:s,AssignmentNode:u,BlockNode:l,ConditionalNode:c,ConstantNode:f,FunctionAssignmentNode:d,FunctionNode:p,IndexNode:h,ObjectNode:m,OperatorNode:v,ParenthesisNode:y,RangeNode:g,RelationalNode:_,SymbolNode:b}=e,x=t(pe,{string:function(e){return R(e,{})},"Array | Matrix":function(e){return w(e,{})},"string, Object":function(e,t){return R(e,void 0!==t.nodes?t.nodes:{})},"Array | Matrix, Object":w});function w(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},n=void 0!==t.nodes?t.nodes:{};return(0,fe.Fh)(e,(function(e){if("string"!=typeof e)throw new TypeError("String expected");return R(e,n)}))}var E={",":!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},N={mod:!0,to:!0,in:!0,and:!0,xor:!0,or:!0,not:!0},S={true:!0,false:!1,null:null,undefined:void 0},M=["NaN","Infinity"];function k(e,t){return e.expression.substr(e.index,t)}function O(e){return k(e,1)}function C(e){e.index++}function A(e){return e.expression.charAt(e.index-1)}function T(e){return e.expression.charAt(e.index+1)}function I(e){for(e.tokenType=0,e.token="",e.comment="";x.isWhitespace(O(e),e.nestingLevel);)C(e);if("#"===O(e))for(;"\n"!==O(e)&&""!==O(e);)e.comment+=O(e),C(e);if(""!==O(e)){if("\n"===O(e)&&!e.nestingLevel)return e.tokenType=1,e.token=O(e),void C(e);var t=O(e),n=k(e,2),r=k(e,3);if(3===r.length&&E[r])return e.tokenType=1,e.token=r,C(e),C(e),void C(e);if(2===n.length&&E[n])return e.tokenType=1,e.token=n,C(e),void C(e);if(E[t])return e.tokenType=1,e.token=t,void C(e);if(x.isDigitDot(t)){e.tokenType=2;var i=k(e,2);if("0b"===i||"0o"===i||"0x"===i){for(e.token+=O(e),C(e),e.token+=O(e),C(e);x.isHexDigit(O(e));)e.token+=O(e),C(e);if("."===O(e))for(e.token+=".",C(e);x.isHexDigit(O(e));)e.token+=O(e),C(e);else if("i"===O(e))for(e.token+="i",C(e);x.isDigit(O(e));)e.token+=O(e),C(e);return}if("."===O(e))e.token+=O(e),C(e),x.isDigit(O(e))||(e.tokenType=1);else{for(;x.isDigit(O(e));)e.token+=O(e),C(e);x.isDecimalMark(O(e),T(e))&&(e.token+=O(e),C(e))}for(;x.isDigit(O(e));)e.token+=O(e),C(e);if("E"===O(e)||"e"===O(e))if(x.isDigit(T(e))||"-"===T(e)||"+"===T(e)){if(e.token+=O(e),C(e),"+"!==O(e)&&"-"!==O(e)||(e.token+=O(e),C(e)),!x.isDigit(O(e)))throw re(e,'Digit expected, got "'+O(e)+'"');for(;x.isDigit(O(e));)e.token+=O(e),C(e);if(x.isDecimalMark(O(e),T(e)))throw re(e,'Digit expected, got "'+O(e)+'"')}else if("."===T(e))throw C(e),re(e,'Digit expected, got "'+O(e)+'"')}else{if(!x.isAlpha(O(e),A(e),T(e))){for(e.tokenType=4;""!==O(e);)e.token+=O(e),C(e);throw re(e,'Syntax error in part "'+e.token+'"')}for(;x.isAlpha(O(e),A(e),T(e))||x.isDigit(O(e));)e.token+=O(e),C(e);(0,o.nr)(N,e.token)?e.tokenType=1:e.tokenType=3}}else e.tokenType=1}function D(e){do{I(e)}while("\n"===e.token)}function P(e){e.nestingLevel++}function j(e){e.nestingLevel--}function R(e,t){var n={extraNodes:{},expression:"",comment:"",index:0,token:"",tokenType:0,nestingLevel:0,conditionalLevel:null};de(n,{expression:e,extraNodes:t}),I(n);var r=function(e){var t,n,r=[];for(""!==e.token&&"\n"!==e.token&&";"!==e.token&&((t=L(e)).comment=e.comment);"\n"===e.token||";"===e.token;)0===r.length&&t&&(n=";"!==e.token,r.push({node:t,visible:n})),I(e),"\n"!==e.token&&";"!==e.token&&""!==e.token&&((t=L(e)).comment=e.comment,n=";"!==e.token,r.push({node:t,visible:n}));return r.length>0?new l(r):(t||((t=new f(void 0)).comment=e.comment),t)}(n);if(""!==n.token)throw 1===n.tokenType?ie(n,"Unexpected operator "+n.token):re(n,'Unexpected part "'+n.token+'"');return r}function L(e){var t,n,r,a,o=function(e){for(var t=function(e){for(var t=B(e);"or"===e.token;)D(e),t=new v("or","or",[t,B(e)]);return t}(e);"?"===e.token;){var n=e.conditionalLevel;e.conditionalLevel=e.nestingLevel,D(e);var r=t,i=L(e);if(":"!==e.token)throw re(e,"False part of conditional expression expected");e.conditionalLevel=null,D(e);var a=L(e);t=new c(r,i,a),e.conditionalLevel=n}return t}(e);if("="===e.token){if((0,i.FG)(o))return t=o.name,D(e),r=L(e),new u(new b(t),r);if((0,i.Yz)(o))return D(e),r=L(e),new u(o.object,o.index,r);if((0,i.VO)(o)&&(0,i.FG)(o.fn)&&(a=!0,n=[],t=o.name,o.args.forEach((function(e,t){(0,i.FG)(e)?n[t]=e.name:a=!1})),a))return D(e),r=L(e),new d(t,n,r);throw re(e,"Invalid left hand side of assignment operator =")}return o}function B(e){for(var t=U(e);"xor"===e.token;)D(e),t=new v("xor","xor",[t,U(e)]);return t}function U(e){for(var t=q(e);"and"===e.token;)D(e),t=new v("and","and",[t,q(e)]);return t}function q(e){for(var t=z(e);"|"===e.token;)D(e),t=new v("|","bitOr",[t,z(e)]);return t}function z(e){for(var t=F(e);"^|"===e.token;)D(e),t=new v("^|","bitXor",[t,F(e)]);return t}function F(e){for(var t=H(e);"&"===e.token;)D(e),t=new v("&","bitAnd",[t,H(e)]);return t}function H(e){for(var t=[Z(e)],n=[],r={"==":"equal","!=":"unequal","<":"smaller",">":"larger","<=":"smallerEq",">=":"largerEq"};(0,o.nr)(r,e.token);){var i={name:e.token,fn:r[e.token]};n.push(i),D(e),t.push(Z(e))}return 1===t.length?t[0]:2===t.length?new v(n[0].name,n[0].fn,t):new _(n.map((e=>e.fn)),t)}function Z(e){var t,n,r,i;t=W(e);for(var a={"<<":"leftShift",">>":"rightArithShift",">>>":"rightLogShift"};(0,o.nr)(a,e.token);)r=a[n=e.token],D(e),i=[t,W(e)],t=new v(n,r,i);return t}function W(e){var t,n,r,i;t=G(e);for(var a={to:"to",in:"to"};(0,o.nr)(a,e.token);)r=a[n=e.token],D(e),"in"===n&&""===e.token?t=new v("*","multiply",[t,new b("in")],!0):(i=[t,G(e)],t=new v(n,r,i));return t}function G(e){var t,n=[];if(t=":"===e.token?new f(1):J(e),":"===e.token&&e.conditionalLevel!==e.nestingLevel){for(n.push(t);":"===e.token&&n.length<3;)D(e),")"===e.token||"]"===e.token||","===e.token||""===e.token?n.push(new b("end")):n.push(J(e));t=3===n.length?new g(n[0],n[2],n[1]):new g(n[0],n[1])}return t}function J(e){var t,n,r,i;t=$(e);for(var a={"+":"add","-":"subtract"};(0,o.nr)(a,e.token);)r=a[n=e.token],D(e),i=[t,$(e)],t=new v(n,r,i);return t}function $(e){var t,n,r,i;n=t=V(e);for(var a={"*":"multiply",".*":"dotMultiply","/":"divide","./":"dotDivide","%":"mod",mod:"mod"};(0,o.nr)(a,e.token);)i=a[r=e.token],D(e),n=V(e),t=new v(r,i,[t,n]);return t}function V(e){var t,n;for(n=t=K(e);3===e.tokenType||"in"===e.token&&(0,i.nu)(t)||!(2!==e.tokenType||(0,i.nu)(n)||(0,i.bV)(n)&&"!"!==n.op)||"("===e.token;)n=K(e),t=new v("*","multiply",[t,n],!0);return t}function K(e){for(var t=Y(e),n=t,r=[];"/"===e.token&&(0,i.nu)(n);){if(r.push(de({},e)),D(e),2!==e.tokenType){de(e,r.pop());break}if(r.push(de({},e)),D(e),3!==e.tokenType&&"("!==e.token){r.pop(),de(e,r.pop());break}de(e,r.pop()),r.pop(),n=Y(e),t=new v("/","divide",[t,n])}return t}function Y(e){var t,i,a,u={"-":"unaryMinus","+":"unaryPlus","~":"bitNot",not:"not"};return(0,o.nr)(u,e.token)?(a=u[e.token],t=e.token,D(e),i=[Y(e)],new v(t,a,i)):function(e){var t,i,a,u;return t=function(e){var t,i,a;t=function(e){var t=[];if(3===e.tokenType&&(0,o.nr)(e.extraNodes,e.token)){var i=e.extraNodes[e.token];if(I(e),"("===e.token){if(t=[],P(e),I(e),")"!==e.token)for(t.push(L(e));","===e.token;)I(e),t.push(L(e));if(")"!==e.token)throw re(e,"Parenthesis ) expected");j(e),I(e)}return new i(t)}return function(e){var t;return 3===e.tokenType||1===e.tokenType&&e.token in N?(t=e.token,I(e),X(e,(0,o.nr)(S,t)?new f(S[t]):-1!==M.indexOf(t)?new f(n(t,"number")):new b(t))):function(e){var t;return'"'===e.token?(t=Q(e),X(e,new f(t))):function(e){var t;return"'"===e.token?(t=ee(e),X(e,new f(t))):function(e){var t,i,a,o;if("["===e.token){if(P(e),I(e),"]"!==e.token){var u=te(e);if(";"===e.token){for(a=1,i=[u];";"===e.token;)I(e),i[a]=te(e),a++;if("]"!==e.token)throw re(e,"End of matrix ] expected");j(e),I(e),o=i[0].items.length;for(var l=1;l<a;l++)if(i[l].items.length!==o)throw ie(e,"Column dimensions mismatch ("+i[l].items.length+" !== "+o+")");t=new s(i)}else{if("]"!==e.token)throw re(e,"End of matrix ] expected");j(e),I(e),t=u}}else j(e),I(e),t=new s([]);return X(e,t)}return function(e){if("{"===e.token){var t;P(e);var i={};do{if(I(e),"}"!==e.token){if('"'===e.token)t=Q(e);else if("'"===e.token)t=ee(e);else{if(!(3===e.tokenType||1===e.tokenType&&e.token in N))throw re(e,"Symbol or string expected as object key");t=e.token,I(e)}if(":"!==e.token)throw re(e,"Colon : expected after object key");I(e),i[t]=L(e)}}while(","===e.token);if("}"!==e.token)throw re(e,"Comma , or bracket } expected after object value");j(e),I(e);var a=new m(i);return X(e,a)}return function(e){var t;return 2===e.tokenType?(t=e.token,I(e),new f(n(t,r.number))):function(e){var t;if("("===e.token){if(P(e),I(e),t=L(e),")"!==e.token)throw re(e,"Parenthesis ) expected");return j(e),I(e),X(e,t=new y(t))}return function(e){throw""===e.token?re(e,"Unexpected end of expression"):re(e,"Value expected")}(e)}(e)}(e)}(e)}(e)}(e)}(e)}(e)}(e);for(var u={"!":"factorial","'":"ctranspose"};(0,o.nr)(u,e.token);)a=u[i=e.token],I(e),t=X(e,t=new v(i,a,[t]));return t}(e),("^"===e.token||".^"===e.token)&&(a="^"===(i=e.token)?"pow":"dotPow",D(e),u=[t,Y(e)],t=new v(i,a,u)),t}(e)}function X(e,t,n){for(var r;!("("!==e.token&&"["!==e.token&&"."!==e.token||n&&-1===n.indexOf(e.token));)if(r=[],"("===e.token){if(!(0,i.FG)(t)&&!(0,i.Yz)(t))return t;if(P(e),I(e),")"!==e.token)for(r.push(L(e));","===e.token;)I(e),r.push(L(e));if(")"!==e.token)throw re(e,"Parenthesis ) expected");j(e),I(e),t=new p(t,r)}else if("["===e.token){if(P(e),I(e),"]"!==e.token)for(r.push(L(e));","===e.token;)I(e),r.push(L(e));if("]"!==e.token)throw re(e,"Parenthesis ] expected");j(e),I(e),t=new a(t,new h(r))}else{if(I(e),3!==e.tokenType)throw re(e,"Property name expected after dot");r.push(new f(e.token)),I(e),t=new a(t,new h(r,!0))}return t}function Q(e){for(var t="";""!==O(e)&&'"'!==O(e);)"\\"===O(e)&&(t+=O(e),C(e)),t+=O(e),C(e);if(I(e),'"'!==e.token)throw re(e,'End of string " expected');return I(e),JSON.parse('"'+t+'"')}function ee(e){for(var t="";""!==O(e)&&"'"!==O(e);)"\\"===O(e)&&(t+=O(e),C(e)),t+=O(e),C(e);if(I(e),"'"!==e.token)throw re(e,"End of string ' expected");return I(e),JSON.parse('"'+t+'"')}function te(e){for(var t=[L(e)],n=1;","===e.token;)I(e),t[n]=L(e),n++;return new s(t)}function ne(e){return e.index-e.token.length+1}function re(e,t){var n=ne(e),r=new SyntaxError(t+" (char "+n+")");return r.char=n,r}function ie(e,t){var n=ne(e),r=new SyntaxError(t+" (char "+n+")");return r.char=n,r}return x.isAlpha=function(e,t,n){return x.isValidLatinOrGreek(e)||x.isValidMathSymbol(e,n)||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})),ve="evaluate",ye=["typed","parse"],ge=(0,s.d5)(ve,ye,(e=>{var{typed:t,parse:n}=e;return t(ve,{string:function(e){return n(e).compile().evaluate({})},"string, Object":function(e,t){return n(e).compile().evaluate(t)},"Array | Matrix":function(e){var t={};return(0,fe.Fh)(e,(function(e){return n(e).compile().evaluate(t)}))},"Array | Matrix, Object":function(e,t){return(0,fe.Fh)(e,(function(e){return n(e).compile().evaluate(t)}))}})})),_e=["parse"],be=(0,s.d5)("Help",_e,(e=>{var{parse:t}=e;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!e)throw new Error('Argument "doc" missing');this.doc=e}return n.prototype.type="Help",n.prototype.isHelp=!0,n.prototype.toString=function(){var e=this.doc||{},n="\n";if(e.name&&(n+="Name: "+e.name+"\n\n"),e.category&&(n+="Category: "+e.category+"\n\n"),e.description&&(n+="Description:\n    "+e.description+"\n\n"),e.syntax&&(n+="Syntax:\n    "+e.syntax.join("\n    ")+"\n\n"),e.examples){n+="Examples:\n";for(var r={},a=0;a<e.examples.length;a++){var o=e.examples[a];n+="    "+o+"\n";var s=void 0;try{s=t(o).compile().evaluate(r)}catch(e){s=e}void 0===s||(0,i.x1)(s)||(n+="        "+(0,m.WU)(s,{precision:14})+"\n")}n+="\n"}return e.seealso&&e.seealso.length&&(n+="See also: "+e.seealso.join(", ")+"\n"),n},n.prototype.toJSON=function(){var e=(0,o.d9)(this.doc);return e.mathjs="Help",e},n.fromJSON=function(e){var t={};return Object.keys(e).filter((e=>"mathjs"!==e)).forEach((n=>{t[n]=e[n]})),new n(t)},n.prototype.valueOf=n.prototype.toString,n}),{isClass:!0}),xe=["parse"],we=(0,s.d5)("Parser",xe,(e=>{var{parse:t}=e;function n(){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.scope={}}return n.prototype.type="Parser",n.prototype.isParser=!0,n.prototype.evaluate=function(e){return t(e).compile().evaluate(this.scope)},n.prototype.get=function(e){return e in this.scope?(0,S.YF)(this.scope,e):void 0},n.prototype.getAll=function(){return(0,o.l7)({},this.scope)},n.prototype.set=function(e,t){return(0,S.nI)(this.scope,e,t)},n.prototype.remove=function(e){delete this.scope[e]},n.prototype.clear=function(){for(var e in this.scope)(0,o.nr)(this.scope,e)&&delete this.scope[e]},n}),{isClass:!0}),Ee={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"]},Ne={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"]},Se={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(num,den)"],description:"Create a fraction from a number or from a numerator and denominator.",examples:["fraction(0.125)","fraction(1, 3) + fraction(2, 5)"],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:Ne,E:Ne,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:Ee,PI:Ee,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"]},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:["derivative","parse","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"]},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, 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"]},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:["forEach([1, 2, 3], function(val) { console.log(val) })"],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"]},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"]},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 a matrix or string. Indexes are one-based. Both the ranges lower-bound and upper-bound are included.",examples:["d = [1, 2; 3, 4]","e = []","e[1, 1:2] = [5, 6]","e[2, :] = [7, 8]","f = d * e","f[2, 1]","f[:, 1]"],seealso:["concat","det","diag","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 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:[]},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"]},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"]}},Me="help",ke=["typed","mathWithTransform","Help"],Oe=(0,s.d5)(Me,ke,(e=>{var{typed:t,mathWithTransform:n,Help:r}=e;return t(Me,{any:function(e){var t,i=e;if("string"!=typeof e)for(t in n)if((0,o.nr)(n,t)&&e===n[t]){i=t;break}var a=(0,S.YF)(Se,i);if(!a){var s="function"==typeof i?i.name:i;throw new Error('No documentation found on "'+s+'"')}return new r(a)}})})),Ce="compile",Ae=["typed","parse"],Te=(0,s.d5)(Ce,Ae,(e=>{var{typed:t,parse:n}=e;return t(Ce,{string:function(e){return n(e).compile()},"Array | Matrix":function(e){return(0,fe.Fh)(e,(function(e){return n(e).compile()}))}})})),Ie=["FunctionNode","OperatorNode","SymbolNode"],De=(0,s.d5)("simplifyUtil",Ie,(e=>{var{FunctionNode:t,OperatorNode:n,SymbolNode:r}=e,a={add:!0,multiply:!0},s={add:!0,multiply:!0};function u(e,t){if(!(0,i.bV)(e))return!1;var n=e.fn.toString();return t&&(0,o.nr)(t,n)&&(0,o.nr)(t[n],"associative")?t[n].associative:s[n]||!1}function l(e){var t,n=[];return u(e)?(t=e.op,function e(r){for(var a=0;a<r.args.length;a++){var o=r.args[a];(0,i.bV)(o)&&t===o.op?e(o):n.push(o)}}(e),n):e.args}function c(e){return(0,i.bV)(e)?function(t){try{return new n(e.op,e.fn,t,e.implicit)}catch(e){return console.error(e),[]}}:function(n){return new t(new r(e.name),n)}}return{createMakeNodeFunction:c,isCommutative:function(e,t){if(!(0,i.bV)(e))return!0;var n=e.fn.toString();return t&&(0,o.nr)(t,n)&&(0,o.nr)(t[n],"commutative")?t[n].commutative:a[n]||!1},isAssociative:u,flatten:function e(t){if(!t.args||0===t.args.length)return t;t.args=l(t);for(var n=0;n<t.args.length;n++)e(t.args[n])},allChildren:l,unflattenr:function e(t){if(t.args&&0!==t.args.length){for(var n=c(t),r=t.args.length,i=0;i<r;i++)e(t.args[i]);if(r>2&&u(t)){for(var a=t.args.pop();t.args.length>0;)a=n([t.args.pop(),a]);t.args=a.args}}},unflattenl:function e(t){if(t.args&&0!==t.args.length){for(var n=c(t),r=t.args.length,i=0;i<r;i++)e(t.args[i]);if(r>2&&u(t)){for(var a=t.args.shift();t.args.length>0;)a=n([a,t.args.shift()]);t.args=a.args}}}}})),Pe=["equal","isZero","add","subtract","multiply","divide","pow","ConstantNode","OperatorNode","FunctionNode","ParenthesisNode"],je=(0,s.d5)("simplifyCore",Pe,(e=>{var{equal:t,isZero:n,add:r,subtract:a,multiply:o,divide:s,pow:u,ConstantNode:l,OperatorNode:c,FunctionNode:f,ParenthesisNode:d}=e,p=new l(0),h=new l(1);return function e(m){if((0,i.bV)(m)&&m.isUnary()){var v=e(m.args[0]);if("+"===m.op)return v;if("-"===m.op){if((0,i.bV)(v)){if(v.isUnary()&&"-"===v.op)return v.args[0];if(v.isBinary()&&"subtract"===v.fn)return new c("-","subtract",[v.args[1],v.args[0]])}return new c(m.op,m.fn,[v])}}else if((0,i.bV)(m)&&m.isBinary()){var y=e(m.args[0]),g=e(m.args[1]);if("+"===m.op){if((0,i.nu)(y)){if(n(y.value))return g;if((0,i.nu)(g))return new l(r(y.value,g.value))}return(0,i.nu)(g)&&n(g.value)?y:(0,i.bV)(g)&&g.isUnary()&&"-"===g.op?new c("-","subtract",[y,g.args[0]]):new c(m.op,m.fn,g?[y,g]:[y])}if("-"===m.op){if((0,i.nu)(y)&&g){if((0,i.nu)(g))return new l(a(y.value,g.value));if(n(y.value))return new c("-","unaryMinus",[g])}if("subtract"===m.fn)return(0,i.nu)(g)&&n(g.value)?y:(0,i.bV)(g)&&g.isUnary()&&"-"===g.op?e(new c("+","add",[y,g.args[0]])):new c(m.op,m.fn,[y,g])}else{if("*"===m.op){if((0,i.nu)(y)){if(n(y.value))return p;if(t(y.value,1))return g;if((0,i.nu)(g))return new l(o(y.value,g.value))}if((0,i.nu)(g)){if(n(g.value))return p;if(t(g.value,1))return y;if((0,i.bV)(y)&&y.isBinary()&&y.op===m.op){var _=y.args[0];if((0,i.nu)(_)){var b=new l(o(_.value,g.value));return new c(m.op,m.fn,[b,y.args[1]],m.implicit)}}return new c(m.op,m.fn,[g,y],m.implicit)}return new c(m.op,m.fn,[y,g],m.implicit)}if("/"===m.op){if((0,i.nu)(y)){if(n(y.value))return p;if((0,i.nu)(g)&&(t(g.value,1)||t(g.value,2)||t(g.value,4)))return new l(s(y.value,g.value))}return new c(m.op,m.fn,[y,g])}if("^"===m.op){if((0,i.nu)(g)){if(n(g.value))return h;if(t(g.value,1))return y;if((0,i.nu)(y))return new l(u(y.value,g.value));if((0,i.bV)(y)&&y.isBinary()&&"^"===y.op){var x=y.args[1];if((0,i.nu)(x))return new c(m.op,m.fn,[y.args[0],new l(o(x.value,g.value))])}}return new c(m.op,m.fn,[y,g])}}}else{if((0,i.Ig)(m)){var w=e(m.content);return(0,i.Ig)(w)||(0,i.FG)(w)||(0,i.nu)(w)?w:new d(w)}if((0,i.VO)(m)){var E=m.args.map(e).map((function(e){return(0,i.Ig)(e)?e.content:e}));return new f(e(m.fn),E)}}return m}})),Re=n(5180),Le=["typed","config","mathWithTransform","?fraction","?bignumber","ConstantNode","OperatorNode","FunctionNode","SymbolNode"],Be=(0,s.d5)("simplifyConstant",Le,(e=>{var{typed:t,config:n,mathWithTransform:r,fraction:a,bignumber:o,ConstantNode:s,OperatorNode:u,FunctionNode:l,SymbolNode:c}=e,{isCommutative:f,isAssociative:d,allChildren:p,createMakeNodeFunction:h}=De({FunctionNode:l,OperatorNode:u,SymbolNode:c});function m(e,t,n){try{return g(r[e].apply(null,t),n)}catch(a){return t=t.map((function(e){return(0,i.yQ)(e)?e.valueOf():e})),g(r[e].apply(null,t),n)}}var v=t({Fraction:function(e){var t,n=e.s*e.n;return t=n<0?new u("-","unaryMinus",[new s(-n)]):new s(n),1===e.d?t:new u("/","divide",[t,new s(e.d)])},number:function(e){return e<0?_(new s(-e)):new s(e)},BigNumber:function(e){return e<0?_(new s(-e)):new s(e)},Complex:function(e){throw new Error("Cannot convert Complex number to Node")}});function y(e,t){if(t&&!1!==t.exactFractions&&isFinite(e)&&a){var n=a(e),r=t&&"number"==typeof t.fractionsLimit?t.fractionsLimit:1/0;if(n.valueOf()===e&&n.n<r&&n.d<r)return n}return e}var g=t({"string, Object":function(e,t){return"BigNumber"===n.number?(void 0===o&&(0,Re.R3)(),o(e)):"Fraction"===n.number?(void 0===a&&(0,Re.nG)(),a(e)):y(parseFloat(e),t)},"Fraction, Object":function(e,t){return e},"BigNumber, Object":function(e,t){return e},"number, Object":function(e,t){return y(e,t)},"Complex, Object":function(e,t){return 0!==e.im?e:y(e.re,t)}});function _(e){return new u("-","unaryMinus",[e])}function b(e,t,n,r){return t.reduce((function(t,a){if((0,i.UG)(t)||(0,i.UG)(a))(0,i.UG)(t)?(0,i.UG)(a)||(a=v(a)):t=v(t);else{try{return m(e,[t,a],r)}catch(e){}t=v(t),a=v(a)}return n([t,a])}))}function x(e,t){switch(e.type){case"SymbolNode":return e;case"ConstantNode":return"number"!=typeof e.value&&isNaN(e.value)?e:g(e.value,t);case"FunctionNode":if(r[e.name]&&r[e.name].rawArgs)return e;if(-1===["add","multiply"].indexOf(e.name)){var n=e.args.map((e=>x(e,t)));if(!n.some(i.UG))try{return m(e.name,n,t)}catch(e){}return n=n.map((function(e){return(0,i.UG)(e)?e:v(e)})),new l(e.name,n)}case"OperatorNode":var a,o,s=e.fn.toString(),u=h(e);if((0,i.bV)(e)&&e.isUnary())a=[x(e.args[0],t)],o=(0,i.UG)(a[0])?u(a):m(s,a,t);else if(d(e))if(a=(a=p(e)).map((e=>x(e,t))),f(s)){for(var c=[],y=[],_=0;_<a.length;_++)(0,i.UG)(a[_])?y.push(a[_]):c.push(a[_]);c.length>1?(o=b(s,c,u,t),y.unshift(o),o=b(s,y,u,t)):o=b(s,a,u,t)}else o=b(s,a,u,t);else o=b(s,a=e.args.map((e=>x(e,t))),u,t);return o;case"ParenthesisNode":return x(e.content,t);case"AccessorNode":case"ArrayNode":case"AssignmentNode":case"BlockNode":case"FunctionAssignmentNode":case"IndexNode":case"ObjectNode":case"RangeNode":case"ConditionalNode":default:throw new Error("Unimplemented node type in simplifyConstant: ".concat(e.type))}}return function(e,t){var n=x(e,t);return(0,i.UG)(n)?n:v(n)}})),Ue=["parse","FunctionNode","OperatorNode","ParenthesisNode"],qe=(0,s.d5)("resolve",Ue,(e=>{var{parse:t,FunctionNode:n,OperatorNode:r,ParenthesisNode:a}=e;return function e(o,s){if(!s)return o;if((0,i.FG)(o)){var u=s[o.name];if((0,i.UG)(u))return e(u,s);if("number"==typeof u)return t(String(u))}else{if((0,i.bV)(o)){var l=o.args.map((function(t){return e(t,s)}));return new r(o.op,o.fn,l,o.implicit)}if((0,i.Ig)(o))return new a(e(o.content,s));if((0,i.VO)(o)){var c=o.args.map((function(t){return e(t,s)}));return new n(o.name,c)}}return o}})),ze=["config","typed","parse","add","subtract","multiply","divide","pow","isZero","equal","?fraction","?bignumber","mathWithTransform","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode","SymbolNode"],Fe=(0,s.d5)("simplify",ze,(e=>{var{config:t,typed:n,parse:r,add:a,subtract:s,multiply:u,divide:l,pow:c,isZero:f,equal:d,fraction:p,bignumber:h,mathWithTransform:m,ConstantNode:v,FunctionNode:y,OperatorNode:g,ParenthesisNode:_,SymbolNode:b}=e,x=Be({typed:n,config:t,mathWithTransform:m,fraction:p,bignumber:h,ConstantNode:v,OperatorNode:g,FunctionNode:y,SymbolNode:b}),w=je({equal:d,isZero:f,add:a,subtract:s,multiply:u,divide:l,pow:c,ConstantNode:v,OperatorNode:g,FunctionNode:y,ParenthesisNode:_}),E=qe({parse:r,FunctionNode:y,OperatorNode:g,ParenthesisNode:_}),{isCommutative:N,isAssociative:S,flatten:M,unflattenr:k,unflattenl:O,createMakeNodeFunction:C}=De({FunctionNode:y,OperatorNode:g,SymbolNode:b}),A=n("simplify",{string:function(e){return this(r(e),this.rules,{},{})},"string, Object":function(e,t){return this(r(e),this.rules,t,{})},"string, Object, Object":function(e,t,n){return this(r(e),this.rules,t,n)},"string, Array":function(e,t){return this(r(e),t,{},{})},"string, Array, Object":function(e,t,n){return this(r(e),t,n,{})},"string, Array, Object, Object":function(e,t,n,i){return this(r(e),t,n,i)},"Node, Object":function(e,t){return this(e,this.rules,t,{})},"Node, Object, Object":function(e,t,n){return this(e,this.rules,t,n)},Node:function(e){return this(e,this.rules,{},{})},"Node, Array":function(e,t){return this(e,t,{},{})},"Node, Array, Object":function(e,t,n){return this(e,t,n,{})},"Node, Array, Object, Object":function(e,t,n,i){t=function(e){for(var t=[],n=0;n<e.length;n++){var i=e[n],a=void 0,o=typeof i;switch(o){case"string":var s=i.split("->");if(2!==s.length)throw SyntaxError("Could not parse rule: "+i);i={l:s[0],r:s[1]};case"object":if(a={l:T(r(i.l)),r:T(r(i.r))},i.context&&(a.evaluate=i.context),i.evaluate&&(a.evaluate=r(i.evaluate)),S(a.l)){var u=C(a.l),l=new b("_p"+D++);a.expanded={},a.expanded.l=u([a.l.clone(),l]),M(a.expanded.l),k(a.expanded.l),a.expanded.r=u([a.r,l])}break;case"function":a=i;break;default:throw TypeError("Unsupported type of rule: "+o)}t.push(a)}return t}(t);for(var a=E(e,n),o={},s=(a=T(a)).toString({parenthesis:"all"});!o[s];){o[s]=!0,D=0;for(var u=0;u<t.length;u++)"function"==typeof t[u]?a=t[u](a,i):(M(a),a=P(a,t[u])),O(a);s=a.toString({parenthesis:"all"})}return a}});function T(e){return e.transform((function(e,t,n){return(0,i.Ig)(e)?T(e.content):e}))}A.simplifyCore=w,A.resolve=E;var I={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};A.rules=[w,{l:"log(e)",r:"1"},{l:"n-n1",r:"n+-n1"},{l:"-(c*v)",r:"(-c) * v"},{l:"-v",r:"(-1) * v"},{l:"n/n1^n2",r:"n*n1^-n2"},{l:"n/n1",r:"n*n1^-1"},{l:"(n ^ n1) ^ n2",r:"n ^ (n1 * n2)"},{l:"n*n",r:"n^2"},{l:"n * n^n1",r:"n^(n1+1)"},{l:"n^n1 * n^n2",r:"n^(n1+n2)"},{l:"n+n",r:"2*n"},{l:"n+-n",r:"0"},{l:"n1*n2 + n2",r:"(n1+1)*n2"},{l:"n1*n3 + n2*n3",r:"(n1+n2)*n3"},{l:"n1 + -1 * (n2 + n3)",r:"n1 + -1 * n2 + -1 * n3"},x,{l:"(-n)*n1",r:"-(n*n1)"},{l:"c+v",r:"v+c",context:{add:{commutative:!1}}},{l:"v*c",r:"c*v",context:{multiply:{commutative:!1}}},{l:"n+-n1",r:"n-n1"},{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:"n-(n1+n2)",r:"n-n1-n2"},{l:"1*n",r:"n"},{l:"n1/(n2/n3)",r:"(n1*n3)/n2"}];var D=0;var P=n("applyRule",{"Node, Object":function(e,t){var n=e;if(n instanceof g||n instanceof y){if(n.args)for(var r=0;r<n.args.length;r++)n.args[r]=P(n.args[r],t)}else n instanceof _&&n.content&&(n.content=P(n.content,t));var i=t.r,a=L(t.l,n)[0];if(!a&&t.expanded&&(i=t.expanded.r,a=L(t.expanded.l,n)[0]),a){var s=n.implicit;n=i.clone(),s&&"implicit"in i&&(n.implicit=!0),n=n.transform((function(e){return e.isSymbolNode&&(0,o.nr)(a.placeholders,e.name)?a.placeholders[e.name].clone():e}))}return n}});function j(e,t){var n={placeholders:{}};if(!e.placeholders&&!t.placeholders)return n;if(!e.placeholders)return t;if(!t.placeholders)return e;for(var r in e.placeholders)if((0,o.nr)(e.placeholders,r)&&(n.placeholders[r]=e.placeholders[r],(0,o.nr)(t.placeholders,r)&&!B(e.placeholders[r],t.placeholders[r])))return null;for(var i in t.placeholders)(0,o.nr)(t.placeholders,i)&&(n.placeholders[i]=t.placeholders[i]);return n}function R(e,t){var n,r=[];if(0===e.length||0===t.length)return r;for(var i=0;i<e.length;i++)for(var a=0;a<t.length;a++)(n=j(e[i],t[a]))&&r.push(n);return r}function L(e,t,n){var r=[{placeholders:{}}];if(e instanceof g&&t instanceof g||e instanceof y&&t instanceof y){if(e instanceof g){if(e.op!==t.op||e.fn!==t.fn)return[]}else if(e instanceof y&&e.name!==t.name)return[];if(!(1===t.args.length&&1===e.args.length||!S(t)&&t.args.length===e.args.length||n)){if(t.args.length>=2&&2===e.args.length){for(var a=function(e,t){var n,r,i=[],a=C(e);if(N(e,t))for(var o=0;o<e.args.length;o++)(r=e.args.slice(0)).splice(o,1),n=1===r.length?r[0]:a(r),i.push(a([e.args[o],n]));else n=1===(r=e.args.slice(1)).length?r[0]:a(r),i.push(a([e.args[0],n]));return i}(t,e.context),o=[],s=0;s<a.length;s++){var u=L(e,a[s],!0);o=o.concat(u)}return o}if(e.args.length>2)throw Error("Unexpected non-binary associative function: "+e.toString());return[]}for(var l=[],c=0;c<e.args.length;c++){var f=L(e.args[c],t.args[c]);if(0===f.length)return[];l.push(f)}r=function(e){if(0===e.length)return e;for(var t=e.reduce(R),n=[],r={},i=0;i<t.length;i++){var a=JSON.stringify(t[i]);r[a]||(r[a]=!0,n.push(t[i]))}return n}(l)}else if(e instanceof b){if(0===e.name.length)throw new Error("Symbol in rule has 0 length...!?");if(I[e.name]){if(e.name!==t.name)return[]}else if("n"===e.name[0]||"_p"===e.name.substring(0,2))r[0].placeholders[e.name]=t;else if("v"===e.name[0]){if((0,i.nu)(t))return[];r[0].placeholders[e.name]=t}else{if("c"!==e.name[0])throw new Error("Invalid symbol in rule: "+e.name);if(!(t instanceof v))return[];r[0].placeholders[e.name]=t}}else{if(!(e instanceof v))return[];if(!d(e.value,t.value))return[]}return r}function B(e,t){if(e instanceof v&&t instanceof v){if(!d(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 y&&t instanceof y))return!1;if(e instanceof g){if(e.op!==t.op||e.fn!==t.fn)return!1}else if(e instanceof y&&e.name!==t.name)return!1;if(e.args.length!==t.args.length)return!1;for(var n=0;n<e.args.length;n++)if(!B(e.args[n],t.args[n]))return!1}return!0}return A})),He=n(9139),Ze="rationalize",We=["config","typed","equal","isZero","add","subtract","multiply","divide","pow","parse","simplify","?bignumber","?fraction","mathWithTransform","ConstantNode","OperatorNode","FunctionNode","SymbolNode","ParenthesisNode"],Ge=(0,s.d5)(Ze,We,(e=>{var{config:t,typed:n,equal:r,isZero:i,add:a,subtract:o,multiply:s,divide:u,pow:l,parse:c,simplify:f,fraction:d,bignumber:p,mathWithTransform:h,ConstantNode:m,OperatorNode:v,FunctionNode:y,SymbolNode:g,ParenthesisNode:_}=e,b=Be({typed:n,config:t,mathWithTransform:h,fraction:d,bignumber:p,ConstantNode:m,OperatorNode:v,FunctionNode:y,SymbolNode:g}),x=je({equal:r,isZero:i,add:a,subtract:o,multiply:s,divide:u,pow:l,ConstantNode:m,OperatorNode:v,FunctionNode:y,ParenthesisNode:_});return n(Ze,{string:function(e){return this(c(e),{},!1)},"string, boolean":function(e,t){return this(c(e),{},t)},"string, Object":function(e,t){return this(c(e),t,!1)},"string, Object, boolean":function(e,t,n){return this(c(e),t,n)},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,n){var r=function(){var e=[x,{l:"n+n",r:"2*n"},{l:"n+-n",r:"0"},b,{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)"}],n=[{l:"(n1/(n2/n3))",r:"((n1*n3)/n2)"},{l:"(n1/n2/n3)",r:"(n1/(n2*n3))"}],r={};return r.firstRules=e.concat(t,n),r.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)"}],r.sucDivRules=n,r.firstRulesAgain=e.concat(t),r.finalRules=[x,{l:"n*-n",r:"-n^2"},{l:"n*n",r:"n^2"},b,{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))"}],r}(),i=function(e,t,n,r){var i=[],a=f(e,r,t,{exactFractions:!1}),o="+-*"+((n=!!n)?"/":"");!function e(t){var n=t.type;if("FunctionNode"===n)throw new Error("There is an unsolved function call");if("OperatorNode"===n)if("^"===t.op){if("ConstantNode"!==t.args[1].type||!(0,He.U)(parseFloat(t.args[1].value)))throw new Error("There is a non-integer exponent");e(t.args[0])}else{if(-1===o.indexOf(t.op))throw new Error("Operator "+t.op+" invalid in polynomial expression");for(var r=0;r<t.args.length;r++)e(t.args[r])}else if("SymbolNode"===n){var a=t.name;-1===i.indexOf(a)&&i.push(a)}else if("ParenthesisNode"===n)e(t.content);else if("ConstantNode"!==n)throw new Error("type "+n+" is not allowed in polynomial expression")}(a);var s={};return s.expression=a,s.variables=i,s}(e,t,!0,r.firstRules),a=i.variables.length;if(e=i.expression,a>=1){var o,s;e=w(e);var u,l=!0,c=!1;for(e=f(e,r.firstRules,{},{exactFractions:!1});s=l?r.distrDivRules:r.sucDivRules,l=!l,(u=(e=f(e,s)).toString())!==o;)c=!0,o=u;c&&(e=f(e,r.firstRulesAgain,{},{exactFractions:!1})),e=f(e,r.finalRules,{},{exactFractions:!1})}var d=[],p={};return"OperatorNode"===e.type&&e.isBinary()&&"/"===e.op?(1===a&&(e.args[0]=E(e.args[0],d),e.args[1]=E(e.args[1])),n&&(p.numerator=e.args[0],p.denominator=e.args[1])):(1===a&&(e=E(e,d)),n&&(p.numerator=e,p.denominator=null)),n?(p.coefficients=d,p.variables=i.variables,p.expression=e,p):e}});function w(e,t,n){var r=e.type,i=arguments.length>1;if("OperatorNode"===r&&e.isBinary()){var a,o=!1;if("^"===e.op&&("ParenthesisNode"!==e.args[0].type&&"OperatorNode"!==e.args[0].type||"ConstantNode"!==e.args[1].type||(o=(a=parseFloat(e.args[1].value))>=2&&(0,He.U)(a))),o){if(a>2){var s=e.args[0],u=new v("^","pow",[e.args[0].cloneDeep(),new m(a-1)]);e=new v("*","multiply",[s,u])}else e=new v("*","multiply",[e.args[0],e.args[0].cloneDeep()]);i&&("content"===n?t.content=e:t.args[n]=e)}}if("ParenthesisNode"===r)w(e.content,e,"content");else if("ConstantNode"!==r&&"SymbolNode"!==r)for(var l=0;l<e.args.length;l++)w(e.args[l],e,l);if(!i)return e}function E(e,t){void 0===t&&(t=[]),t[0]=0;var n=0,r="";!function e(i,a,o){var s=i.type;if("FunctionNode"===s)throw new Error("There is an unsolved function call");if("OperatorNode"===s){if(-1==="+-*^".indexOf(i.op))throw new Error("Operator "+i.op+" invalid");if(null!==a){if(("unaryMinus"===i.fn||"pow"===i.fn)&&"add"!==a.fn&&"subtract"!==a.fn&&"multiply"!==a.fn)throw new Error("Invalid "+i.op+" placing");if(("subtract"===i.fn||"add"===i.fn||"multiply"===i.fn)&&"add"!==a.fn&&"subtract"!==a.fn)throw new Error("Invalid "+i.op+" placing");if(("subtract"===i.fn||"add"===i.fn||"unaryMinus"===i.fn)&&0!==o.noFil)throw new Error("Invalid "+i.op+" placing")}"^"!==i.op&&"*"!==i.op||(o.fire=i.op);for(var u=0;u<i.args.length;u++)"unaryMinus"===i.fn&&(o.oper="-"),"+"!==i.op&&"subtract"!==i.fn||(o.fire="",o.cte=1,o.oper=0===u?"+":i.op),o.noFil=u,e(i.args[u],i,o)}else if("SymbolNode"===s){if(i.name!==r&&""!==r)throw new Error("There is more than one variable");if(r=i.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 l=parseFloat(i.value);if(null===a)return void(t[0]=l);if("^"===a.op){if(1!==o.noFil)throw new Error("Constant cannot be powered");if(!(0,He.U)(l)||l<=0)throw new Error("Non-integer exponent is not allowed");for(var c=n+1;c<l;c++)t[c]=0;return l>n&&(t[l]=0),t[l]+=o.cte*("+"===o.oper?1:-1),void(n=Math.max(l,n))}o.cte=l,""===o.fire&&(t[0]+=o.cte*("+"===o.oper?1:-1))}}(e,null,{cte:1,oper:"+",fire:""});for(var i,a=!0,o=n=t.length-1;o>=0;o--)if(0!==t[o]){var s=new m(a?t[o]:Math.abs(t[o])),u=t[o]<0?"-":"+";if(o>0){var l=new g(r);if(o>1){var c=new m(o);l=new v("^","pow",[l,c])}s=-1===t[o]&&a?new v("-","unaryMinus",[l]):1===Math.abs(t[o])?l:new v("*","multiply",[s,l])}i=a?s:"+"===u?new v("+","add",[i,s]):new v("-","subtract",[i,s]),a=!1}return a?new m(0):i}})),Je="parser",$e=["typed","Parser"],Ve=(0,s.d5)(Je,$e,(e=>{var{typed:t,Parser:n}=e;return t(Je,{"":function(){return new n}})})),Ke=["typed","config","parse","simplify","equal","isZero","numeric","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode","SymbolNode"],Ye=(0,s.d5)("derivative",Ke,(e=>{var{typed:t,config:n,parse:r,simplify:a,equal:o,isZero:s,numeric:u,ConstantNode:l,FunctionNode:c,OperatorNode:f,ParenthesisNode:d,SymbolNode:p}=e,h=t("derivative",{"Node, SymbolNode, Object":function(e,t,n){var r={};v(r,e,t.name);var i=y(e,r);return n.simplify?a(i):i},"Node, SymbolNode":function(e,t){return this(e,t,{simplify:!0})},"string, SymbolNode":function(e,t){return this(r(e),t)},"string, SymbolNode, Object":function(e,t,n){return this(r(e),t,n)},"string, string":function(e,t){return this(r(e),r(t))},"string, string, Object":function(e,t,n){return this(r(e),r(t),n)},"Node, string":function(e,t){return this(e,r(t))},"Node, string, Object":function(e,t,n){return this(e,r(t),n)}});h._simplify=!0,h.toTex=function(e){return m.apply(null,e.args)};var m=t("_derivTex",{"Node, SymbolNode":function(e,t){return(0,i.nu)(e)&&"string"===(0,i.kM)(e.value)?m(r(e.value).toString(),t.toString(),1):m(e.toString(),t.toString(),1)},"Node, ConstantNode":function(e,t){if("string"===(0,i.kM)(t.value))return m(e,r(t.value));throw new Error("The second parameter to 'derivative' is a non-string constant")},"Node, SymbolNode, ConstantNode":function(e,t,n){return m(e.toString(),t.name,n.value)},"string, string, number":function(e,t,n){return(1===n?"{d\\over d"+t+"}":"{d^{"+n+"}\\over d"+t+"^{"+n+"}}")+"\\left[".concat(e,"\\right]")}}),v=t("constTag",{"Object, ConstantNode, string":function(e,t){return e[t]=!0,!0},"Object, SymbolNode, string":function(e,t,n){return t.name!==n&&(e[t]=!0,!0)},"Object, ParenthesisNode, string":function(e,t,n){return v(e,t.content,n)},"Object, FunctionAssignmentNode, string":function(e,t,n){return-1===t.params.indexOf(n)?(e[t]=!0,!0):v(e,t.expr,n)},"Object, FunctionNode | OperatorNode, string":function(e,t,n){if(t.args.length>0){for(var r=v(e,t.args[0],n),i=1;i<t.args.length;++i)r=v(e,t.args[i],n)&&r;if(r)return e[t]=!0,!0}return!1}}),y=t("_derivative",{"ConstantNode, Object":function(e){return g(0)},"SymbolNode, Object":function(e,t){return void 0!==t[e]?g(0):g(1)},"ParenthesisNode, Object":function(e,t){return new d(y(e.content,t))},"FunctionAssignmentNode, Object":function(e,t){return void 0!==t[e]?g(0):y(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){for(var t=0;t<e.args.length;++t)e.args[t]=g(0);throw e.compile().evaluate(),new Error("Expected TypeError, but none found")}}(e),void 0!==t[e])return g(0);var n,r,i,a,o=e.args[0],s=!1,u=!1;switch(e.name){case"cbrt":s=!0,r=new f("*","multiply",[g(3),new f("^","pow",[o,new f("/","divide",[g(2),g(3)])])]);break;case"sqrt":case"nthRoot":if(1===e.args.length)s=!0,r=new f("*","multiply",[g(2),new c("sqrt",[o])]);else if(2===e.args.length)return t[n=new f("/","divide",[g(1),e.args[1]])]=t[e.args[1]],y(new f("^","pow",[o,n]),t);break;case"log10":n=g(10);case"log":if(n||1!==e.args.length){if(1===e.args.length&&n||2===e.args.length&&void 0!==t[e.args[1]])r=new f("*","multiply",[o.clone(),new c("log",[n||e.args[1]])]),s=!0;else if(2===e.args.length)return y(new f("/","divide",[new c("log",[o]),new c("log",[e.args[1]])]),t)}else r=o.clone(),s=!0;break;case"pow":return t[n]=t[e.args[1]],y(new f("^","pow",[o,e.args[1]]),t);case"exp":r=new c("exp",[o.clone()]);break;case"sin":r=new c("cos",[o.clone()]);break;case"cos":r=new f("-","unaryMinus",[new c("sin",[o.clone()])]);break;case"tan":r=new f("^","pow",[new c("sec",[o.clone()]),g(2)]);break;case"sec":r=new f("*","multiply",[e,new c("tan",[o.clone()])]);break;case"csc":u=!0,r=new f("*","multiply",[e,new c("cot",[o.clone()])]);break;case"cot":u=!0,r=new f("^","pow",[new c("csc",[o.clone()]),g(2)]);break;case"asin":s=!0,r=new c("sqrt",[new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])])]);break;case"acos":s=!0,u=!0,r=new c("sqrt",[new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])])]);break;case"atan":s=!0,r=new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)]);break;case"asec":s=!0,r=new f("*","multiply",[new c("abs",[o.clone()]),new c("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),g(2)]),g(1)])])]);break;case"acsc":s=!0,u=!0,r=new f("*","multiply",[new c("abs",[o.clone()]),new c("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),g(2)]),g(1)])])]);break;case"acot":s=!0,u=!0,r=new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)]);break;case"sinh":r=new c("cosh",[o.clone()]);break;case"cosh":r=new c("sinh",[o.clone()]);break;case"tanh":r=new f("^","pow",[new c("sech",[o.clone()]),g(2)]);break;case"sech":u=!0,r=new f("*","multiply",[e,new c("tanh",[o.clone()])]);break;case"csch":u=!0,r=new f("*","multiply",[e,new c("coth",[o.clone()])]);break;case"coth":u=!0,r=new f("^","pow",[new c("csch",[o.clone()]),g(2)]);break;case"asinh":s=!0,r=new c("sqrt",[new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)])]);break;case"acosh":s=!0,r=new c("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),g(2)]),g(1)])]);break;case"atanh":s=!0,r=new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])]);break;case"asech":s=!0,u=!0,r=new f("*","multiply",[o.clone(),new c("sqrt",[new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])])])]);break;case"acsch":s=!0,u=!0,r=new f("*","multiply",[new c("abs",[o.clone()]),new c("sqrt",[new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)])])]);break;case"acoth":s=!0,u=!0,r=new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])]);break;case"abs":r=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=y(o,t);return u&&(l=new f("-","unaryMinus",[l])),new f(i,a,[l,r])},"OperatorNode, Object":function(e,t){if(void 0!==t[e])return g(0);if("+"===e.op)return new f(e.op,e.fn,e.args.map((function(e){return y(e,t)})));if("-"===e.op){if(e.isUnary())return new f(e.op,e.fn,[y(e.args[0],t)]);if(e.isBinary())return new f(e.op,e.fn,[y(e.args[0],t),y(e.args[1],t)])}if("*"===e.op){var n=e.args.filter((function(e){return void 0!==t[e]}));if(n.length>0){var r=e.args.filter((function(e){return void 0===t[e]})),a=1===r.length?r[0]:new f("*","multiply",r),u=n.concat(y(a,t));return new f("*","multiply",u)}return new f("+","add",e.args.map((function(n){return new f("*","multiply",e.args.map((function(e){return e===n?y(e,t):e.clone()})))})))}if("/"===e.op&&e.isBinary()){var l=e.args[0],d=e.args[1];return void 0!==t[d]?new f("/","divide",[y(l,t),d]):void 0!==t[l]?new f("*","multiply",[new f("-","unaryMinus",[l]),new f("/","divide",[y(d,t),new f("^","pow",[d.clone(),g(2)])])]):new f("/","divide",[new f("-","subtract",[new f("*","multiply",[y(l,t),d.clone()]),new f("*","multiply",[l.clone(),y(d,t)])]),new f("^","pow",[d.clone(),g(2)])])}if("^"===e.op&&e.isBinary()){var p=e.args[0],h=e.args[1];if(void 0!==t[p])return(0,i.nu)(p)&&(s(p.value)||o(p.value,1))?g(0):new f("*","multiply",[e,new f("*","multiply",[new c("log",[p.clone()]),y(h.clone(),t)])]);if(void 0!==t[h]){if((0,i.nu)(h)){if(s(h.value))return g(0);if(o(h.value,1))return y(p,t)}var m=new f("^","pow",[p.clone(),new f("-","subtract",[h,g(1)])]);return new f("*","multiply",[h.clone(),new f("*","multiply",[y(p,t),m])])}return new f("*","multiply",[new f("^","pow",[p.clone(),h.clone()]),new f("+","add",[new f("*","multiply",[y(p,t),new f("/","divide",[h.clone(),p.clone()])]),new f("*","multiply",[y(h,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 g(e,t){return new l(u(e,t||n.number))}return h})),Xe=n(7773),Qe=["typed","isInteger"],et=(0,s.d5)("apply",Qe,(e=>{var{typed:t,isInteger:n}=e,r=(0,Xe.j)({typed:t,isInteger:n});return t("apply",{"...any":function(e){var t=e[1];(0,i.hj)(t)?e[1]=t-1:(0,i.l9)(t)&&(e[1]=t.minus(1));try{return r.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),tt=n(77);function nt(e,t,n){var r=e.filter((function(e){return(0,i.FG)(e)&&!(e.name in t)&&!(e.name in n)}))[0];if(!r)throw new Error('No undefined variable found in inline expression "'+e+'"');var a=r.name,o=Object.create(n),s=e.compile();return function(e){return o[a]=e,s.evaluate(o)}}var rt=["typed"],it=(0,s.d5)("filter",rt,(e=>{var{typed:t}=e;function n(e,t,n){var a,o;return e[0]&&(a=e[0].compile().evaluate(n)),e[1]&&(o=(0,i.FG)(e[1])||(0,i.l7)(e[1])?e[1].compile().evaluate(n):nt(e[1],t,n)),r(a,o)}n.rawArgs=!0;var r=t("filter",{"Array, function":at,"Matrix, function":function(e,t){return e.create(at(e.toArray(),t))},"Array, RegExp":c.U_,"Matrix, RegExp":function(e,t){return e.create((0,c.U_)(e.toArray(),t))}});return n}),{isTransformFunction:!0});function at(e,t){var n=(0,tt.oV)(t);return(0,c.hX)(e,(function(e,r,i){return 1===n?t(e):2===n?t(e,[r+1]):t(e,[r+1],i)}))}var ot=["typed"],st=(0,s.d5)("map",ot,(e=>{var{typed:t}=e;function n(e,t,n){var a,o;return e[0]&&(a=e[0].compile().evaluate(n)),e[1]&&(o=(0,i.FG)(e[1])||(0,i.l7)(e[1])?e[1].compile().evaluate(n):nt(e[1],t,n)),r(a,o)}n.rawArgs=!0;var r=t("map",{"Array, function":function(e,t){return ut(e,t,e)},"Matrix, function":function(e,t){return e.create(ut(e.valueOf(),t,e))}});return n}),{isTransformFunction:!0});function ut(e,t,n){var r=(0,tt.oV)(t);return function e(i,a){return Array.isArray(i)?(0,c.UI)(i,(function(t,n){return e(t,a.concat(n+1))})):1===r?t(i):2===r?t(i,a):t(i,a,n)}(e,[])}var lt=["typed"],ct=(0,s.d5)("forEach",lt,(e=>{var{typed:t}=e;function n(e,t,n){var a,o;return e[0]&&(a=e[0].compile().evaluate(n)),e[1]&&(o=(0,i.FG)(e[1])||(0,i.l7)(e[1])?e[1].compile().evaluate(n):nt(e[1],t,n)),r(a,o)}n.rawArgs=!0;var r=t("forEach",{"Array | Matrix, function":function(e,t){var n=(0,tt.oV)(t);!function r(i,a){Array.isArray(i)?(0,c.Ed)(i,(function(e,t){r(e,a.concat(t+1))})):1===n?t(i):2===n?t(i,a):t(i,a,e)}(e.valueOf(),[])}});return n}),{isTransformFunction:!0}),ft=n(7238),dt=["typed","matrix"],pt=(0,s.d5)("subset",dt,(e=>{var{typed:t,matrix:n}=e,r=(0,ft.q)({typed:t,matrix:n});return t("subset",{"...any":function(e){try{return r.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),ht=["Index"],mt=(0,s.d5)("index",ht,(e=>{var{Index:t}=e;return function(){for(var e=[],n=0,r=arguments.length;n<r;n++){var a=arguments[n];if((0,i.bR)(a))a.start--,a.end-=a.step>0?0:2;else if(a&&!0===a.isSet)a=a.map((function(e){return e-1}));else if((0,i.kJ)(a)||(0,i.SW)(a))a=a.map((function(e){return e-1}));else if((0,i.hj)(a))a--;else if((0,i.l9)(a))a=a.toNumber()-1;else if("string"!=typeof a)throw new TypeError("Dimension must be an Array, Matrix, number, string, or Range");e[n]=a}var o=new t;return t.apply(o,e),o}}),{isTransformFunction:!0}),vt=n(7592),yt=["typed","matrix","isInteger"],gt=(0,s.d5)("concat",yt,(e=>{var{typed:t,matrix:n,isInteger:r}=e,a=(0,vt.k)({typed:t,matrix:n,isInteger:r});return t("concat",{"...any":function(e){var t=e.length-1,n=e[t];(0,i.hj)(n)?e[t]=n-1:(0,i.l9)(n)&&(e[t]=n.minus(1));try{return a.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),_t=n(8911);function bt(e){if(2===e.length&&(0,i.uZ)(e[0])){var t=(e=e.slice())[1];(0,i.hj)(t)?e[1]=t-1:(0,i.l9)(t)&&(e[1]=t.minus(1))}return e}var xt=["typed","config","numeric","larger"],wt=(0,s.d5)("max",xt,(e=>{var{typed:t,config:n,numeric:r,larger:i}=e,a=(0,_t.J)({typed:t,config:n,numeric:r,larger:i});return t("max",{"...any":function(e){e=bt(e);try{return a.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Et=n(3685),Nt=["typed","config","numeric","smaller"],St=(0,s.d5)("min",Nt,(e=>{var{typed:t,config:n,numeric:r,smaller:i}=e,a=(0,Et.D)({typed:t,config:n,numeric:r,smaller:i});return t("min",{"...any":function(e){e=bt(e);try{return a.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Mt=n(7726),kt=["typed","config","add","numeric"],Ot=(0,s.d5)("sum",kt,(e=>{var{typed:t,config:n,add:r,numeric:i}=e,a=(0,Mt.O)({typed:t,config:n,add:r,numeric:i});return t("sum",{"...any":function(e){e=bt(e);try{return a.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Ct=n(7797),At=["typed","Index","matrix","range"],Tt=(0,s.d5)("column",At,(e=>{var{typed:t,Index:n,matrix:r,range:a}=e,o=(0,Ct.w)({typed:t,Index:n,matrix:r,range:a});return t("column",{"...any":function(e){var t=e.length-1,n=e[t];(0,i.hj)(n)&&(e[t]=n-1);try{return o.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),It=n(1598),Dt=["typed","config","?matrix","?bignumber","smaller","smallerEq","larger","largerEq"],Pt=(0,s.d5)("range",Dt,(e=>{var{typed:t,config:n,matrix:r,bignumber:i,smaller:a,smallerEq:o,larger:s,largerEq:u}=e,l=(0,It.M)({typed:t,config:n,matrix:r,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),l.apply(null,e)}})}),{isTransformFunction:!0}),jt=n(6012),Rt="diff",Lt=["typed","matrix","subtract","number","bignumber"],Bt=(0,s.d5)(Rt,Lt,(e=>{var{typed:t,matrix:n,subtract:r,number:i,bignumber:a}=e,o=(0,jt.J)({typed:t,matrix:n,subtract:r,number:i,bignumber:a});return t(Rt,{"...any":function(e){e=bt(e);try{return o.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Ut=n(2349),qt=["typed","Index","matrix","range"],zt=(0,s.d5)("row",qt,(e=>{var{typed:t,Index:n,matrix:r,range:a}=e,o=(0,Ut.v)({typed:t,Index:n,matrix:r,range:a});return t("row",{"...any":function(e){var t=e.length-1,n=e[t];(0,i.hj)(n)&&(e[t]=n-1);try{return o.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Ft=n(8980),Ht=["typed","add","divide"],Zt=(0,s.d5)("mean",Ht,(e=>{var{typed:t,add:n,divide:r}=e,i=(0,Ft.Q)({typed:t,add:n,divide:r});return t("mean",{"...any":function(e){e=bt(e);try{return i.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Wt=n(7359),Gt="variance",Jt=["typed","add","subtract","multiply","divide","apply","isNaN"],$t=(0,s.d5)(Gt,Jt,(e=>{var{typed:t,add:n,subtract:r,multiply:i,divide:a,apply:o,isNaN:s}=e,u=(0,Wt.F)({typed:t,add:n,subtract:r,multiply:i,divide:a,apply:o,isNaN:s});return t(Gt,{"...any":function(e){e=bt(e);try{return u.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Vt=n(4723),Kt=["typed","sqrt","variance"],Yt=(0,s.d5)("std",Kt,(e=>{var{typed:t,sqrt:n,variance:r}=e,i=(0,Vt.X)({typed:t,sqrt:n,variance:r});return t("std",{"...any":function(e){e=bt(e);try{return i.apply(null,e)}catch(e){throw X(e)}}})}),{isTransformFunction:!0}),Xt=n(1538);function Qt(){return(Qt=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e}).apply(this,arguments)}var en={},tn={},nn={},rn=l({mathWithTransform:tn}),an=d({Node:rn}),on=h({Node:rn,ResultSet:Xt.Z0z}),sn=N({Node:rn}),un=k({Node:rn}),ln=C({Node:rn}),cn=j({Node:rn}),fn=L({math:en}),dn=U({classes:nn}),pn=z({Node:rn}),hn=H({Node:rn}),mn=W({Node:rn}),vn=J({Node:rn,typed:Xt.Gzl}),yn=K({Chain:fn,typed:Xt.Gzl}),gn=te({Node:rn,subset:Xt.P9L}),_n=re({Node:rn,Range:Xt.e6w,size:Xt.dpJ}),bn=ae({matrix:Xt.pIu,Node:rn,subset:Xt.P9L}),xn=se({Unit:Xt.fbc,Node:rn,math:en}),wn=ce({Node:rn,SymbolNode:xn,math:en}),En=me({AccessorNode:gn,ArrayNode:an,AssignmentNode:bn,BlockNode:on,ConditionalNode:pn,ConstantNode:sn,FunctionAssignmentNode:vn,FunctionNode:wn,IndexNode:_n,ObjectNode:un,OperatorNode:hn,ParenthesisNode:ln,RangeNode:mn,RelationalNode:cn,SymbolNode:xn,config:r.v,numeric:Xt.uRn,typed:Xt.Gzl}),Nn=ge({parse:En,typed:Xt.Gzl}),Sn=be({parse:En}),Mn=we({parse:En}),kn=Oe({Help:Sn,mathWithTransform:tn,typed:Xt.Gzl}),On=Te({parse:En,typed:Xt.Gzl}),Cn=Fe({bignumber:Xt.edS,fraction:Xt.Pj$,ConstantNode:sn,FunctionNode:wn,OperatorNode:hn,ParenthesisNode:ln,SymbolNode:xn,add:Xt.IHx,config:r.v,divide:Xt.csF,equal:Xt.DgJ,isZero:Xt.Fr9,mathWithTransform:tn,multiply:Xt.JpY,parse:En,pow:Xt.sQ3,subtract:Xt.$XF,typed:Xt.Gzl}),An=Ge({bignumber:Xt.edS,fraction:Xt.Pj$,ConstantNode:sn,FunctionNode:wn,OperatorNode:hn,ParenthesisNode:ln,SymbolNode:xn,add:Xt.IHx,config:r.v,divide:Xt.csF,equal:Xt.DgJ,isZero:Xt.Fr9,mathWithTransform:tn,multiply:Xt.JpY,parse:En,pow:Xt.sQ3,simplify:Cn,subtract:Xt.$XF,typed:Xt.Gzl}),Tn=Ve({Parser:Mn,typed:Xt.Gzl}),In=Ye({ConstantNode:sn,FunctionNode:wn,OperatorNode:hn,ParenthesisNode:ln,SymbolNode:xn,config:r.v,equal:Xt.DgJ,isZero:Xt.Fr9,numeric:Xt.uRn,parse:En,simplify:Cn,typed:Xt.Gzl});Qt(en,{reviver:dn,false:Xt.WJv,null:Xt.OSG,true:Xt.wcc,replacer:Xt.PHU,i:Xt.i,LN10:Xt.cw7,LOG10E:Xt.doM,NaN:Xt.xOA,pi:Xt.pi,SQRT1_2:Xt.PNl,tau:Xt.BZ_,efimovFactor:Xt.dvW,fineStructure:Xt.Oyo,sackurTetrode:Xt.KO_,weakMixingAngle:Xt.Uud,e:Xt.e,Infinity:Xt.OvO,LOG2E:Xt.wwJ,PI:Xt.pi,version:Xt.i83,E:Xt.e,phi:Xt.Skb,typed:Xt.Gzl,isInteger:Xt.UaK,isNumeric:Xt.kEn,isPositive:Xt.xPR,isNaN:Xt.i2d,equalScalar:Xt.kuq,number:Xt.Rxh,boolean:Xt.O72,complex:Xt.PYB,splitUnit:Xt.jLI,unaryPlus:Xt.uKN,apply:Xt.nnj,cube:Xt.kOm,expm1:Xt.t$B,log10:Xt.mvw,multiplyScalar:Xt.cfl,sign:Xt.Xxe,square:Xt.h62,bitNot:Xt.Pfe,arg:Xt.R91,im:Xt.im,not:Xt.ffD,filter:Xt.hXT,forEach:Xt.Ed_,map:Xt.UID,erf:Xt.qNN,format:Xt.WUZ,oct:Xt.jfK,print:Xt.S0v,isPrime:Xt.e47,acos:Xt.Khb,acot:Xt.C6L,acsc:Xt.rcO,asec:Xt.PUJ,asin:Xt.ZRM,atan:Xt.z4N,atanh:Xt.C80,cosh:Xt.f9Y,coth:Xt.h6M,csch:Xt.RhL,sech:Xt.Fbd,sinh:Xt.R_K,tanh:Xt.AEp,chain:yn,combinations:Xt.BjO,pickRandom:Xt.sDj,randomInt:Xt.Iyf,LN2:Xt.bZs,clone:Xt.d9v,hasNumericValue:Xt.Hdk,typeOf:Xt.kM2,string:Xt.Z_8,fraction:Xt.Pj$,unaryMinus:Xt.T8F,addScalar:Xt.scv,exp:Xt.Qqt,log2:Xt.k3Q,sqrt:Xt._b3,conj:Xt.ruJ,getMatrixDataType:Xt.mOi,mode:Xt.xJM,bin:Xt.Ly_,acosh:Xt.__u,acsch:Xt.KLC,asinh:Xt.VfV,cos:Xt.mCk,csc:Xt.QBQ,sin:Xt.O$l,combinationsWithRep:Xt.d4C,random:Xt.MXc,SQRT2:Xt.vNo,isNegative:Xt.nMy,matrix:Xt.pIu,cbrt:Xt.eKn,gcd:Xt.thl,mod:Xt.wQq,nthRoot:Xt.C7f,xgcd:Xt.NpV,bitAnd:Xt.hx9,bitXor:Xt.nNS,or:Xt.or,concat:Xt.zoF,diag:Xt.Ka3,identity:Xt.yRu,ones:Xt.iUs,reshape:Xt.XLQ,size:Xt.dpJ,subset:Xt.P9L,zeros:Xt.lls,hex:Xt.$v1,round:Xt.NMM,leftShift:Xt.w57,rightLogShift:Xt.LdX,compare:Xt.quX,compareText:Xt.cdM,smaller:Xt.Nyh,larger:Xt.TWx,unequal:Xt.KPr,sparse:Xt.rVs,acoth:Xt.trc,atan2:Xt.fvJ,sec:Xt.BEc,add:Xt.IHx,dot:Xt.AKD,composition:Xt.ift,isZero:Xt.Fr9,abs:Xt.WnP,floor:Xt.GWj,multiply:Xt.JpY,dotMultiply:Xt.iOk,re:Xt.re,flatten:Xt.xHg,resize:Xt.SIr,squeeze:Xt.L9e,to:Xt.to,pow:Xt.sQ3,dotPow:Xt.qgo,rightArithShift:Xt.nq0,compareNatural:Xt.rn1,equalText:Xt.eZD,largerEq:Xt.Cr4,partitionSelect:Xt.JeQ,asech:Xt.lo8,tan:Xt.ORZ,setDifference:Xt.TVT,setIntersect:Xt.ff9,setMultiplicity:Xt.oNG,setSize:Xt.yk3,trace:Xt.g49,quantileSeq:Xt.pAO,gamma:Xt.yiU,bignumber:Xt.edS,lcm:Xt.uqG,bitOr:Xt.wKT,kron:Xt.JvE,transpose:Xt.p4s,numeric:Xt.uRn,and:Xt.xDy,smallerEq:Xt.Sq_,sort:Xt.DYV,min:Xt.VV$,cot:Xt.oHe,setDistinct:Xt.Z41,setPowerset:Xt.ljT,index:Xt.KzB,sum:Xt.Smz,factorial:Xt.bLN,permutations:Xt.DW7,ceil:Xt.mDi,subtract:Xt.$XF,cross:Xt.kCc,range:Xt.w6H,row:Xt.O7B,prod:Xt.WVs,equal:Xt.DgJ,max:Xt.Fp7,setCartesian:Xt.$ZK,setSymDifference:Xt.V4s,fix:Xt.zG0,column:Xt.$QP,diff:Xt.Hgg,ctranspose:Xt.NZC,deepEqual:Xt.vZr,setIsSubset:Xt.TT1,xor:Xt.dlQ,divideScalar:Xt.QgA,nthRoots:Xt.$$R,lsolve:Xt.wtJ,lsolveAll:Xt.ER9,setUnion:Xt.uyX,lup:Xt.xly,slu:Xt.cEy,det:Xt.Q8I,distance:Xt.TE$,stirlingS2:Xt.bAb,catalan:Xt.tjo,count:Xt.QXW,log:Xt.cM7,dotDivide:Xt.yVo,usolveAll:Xt.bJ2,hypot:Xt._mT,qr:Xt.qr,inv:Xt.JBn,expm:Xt.Ege,divide:Xt.csF,mean:Xt.J69,variance:Xt.CAK,kldivergence:Xt.mYz,bellNumbers:Xt.O7j,log1p:Xt.Krr,createUnit:Xt.JP7,eigs:Xt.Gq_,intersect:Xt.wfr,std:Xt.qoR,atomicMass:Xt.uzo,bohrMagneton:Xt.Cl$,boltzmann:Xt.Rhk,conductanceQuantum:Xt.xk2,deuteronMass:Xt.dEt,electronMass:Xt._G2,faraday:Xt.Am2,firstRadiation:Xt.Vvs,gravitationConstant:Xt.H9q,hartreeEnergy:Xt.HQL,klitzing:Xt.$$$,magneticConstant:Xt.$nU,molarMass:Xt.ak$,molarPlanckConstant:Xt.kEb,neutronMass:Xt.li8,planckCharge:Xt.JaK,planckLength:Xt.gil,planckTemperature:Xt.XAT,protonMass:Xt.CxM,reducedPlanckConstant:Xt.vAu,secondRadiation:Xt.ahj,stefanBoltzmann:Xt.yO5,vacuumImpedance:Xt.tnB,usolve:Xt.LDk,norm:Xt.KOy,lusolve:Xt.DU,sqrtm:Xt.jXX,multinomial:Xt.SJ_,avogadro:Xt._vz,classicalElectronRadius:Xt._fe,electricConstant:Xt.dXo,fermiCoupling:Xt.cIy,gravity:Xt.QXX,loschmidt:Xt.PUn,molarMassC12:Xt.esS,nuclearMagneton:Xt._A2,planckMass:Xt.kc5,quantumOfCirculation:Xt.TYM,speedOfLight:Xt.bl5,wienDisplacement:Xt.bGh,rotationMatrix:Xt.k8z,median:Xt.C2o,bohrRadius:Xt.tUn,elementaryCharge:Xt.iMQ,inverseConductanceQuantum:Xt.WSk,molarVolume:Xt.n4B,planckTime:Xt.oTb,thomsonCrossSection:Xt.bej,rotate:Xt.U1s,parse:En,evaluate:Nn,mad:Xt.UFs,coulomb:Xt.JPg,magneticFluxQuantum:Xt.oLv,rydberg:Xt.rMB,unit:Xt.bfT,help:kn,gasConstant:Xt.eOQ,compile:On,simplify:Cn,rationalize:An,parser:Tn,planckConstant:Xt.whQ,derivative:In,config:r.v}),Qt(tn,en,{apply:et({isInteger:Xt.UaK,typed:Xt.Gzl}),filter:it({typed:Xt.Gzl}),map:st({typed:Xt.Gzl}),forEach:ct({typed:Xt.Gzl}),subset:pt({matrix:Xt.pIu,typed:Xt.Gzl}),index:mt({Index:Xt.gmE}),concat:gt({isInteger:Xt.UaK,matrix:Xt.pIu,typed:Xt.Gzl}),max:wt({config:r.v,larger:Xt.TWx,numeric:Xt.uRn,typed:Xt.Gzl}),min:St({config:r.v,numeric:Xt.uRn,smaller:Xt.Nyh,typed:Xt.Gzl}),sum:Ot({add:Xt.IHx,config:r.v,numeric:Xt.uRn,typed:Xt.Gzl}),column:Tt({Index:Xt.gmE,matrix:Xt.pIu,range:Xt.w6H,typed:Xt.Gzl}),range:Pt({bignumber:Xt.edS,matrix:Xt.pIu,config:r.v,larger:Xt.TWx,largerEq:Xt.Cr4,smaller:Xt.Nyh,smallerEq:Xt.Sq_,typed:Xt.Gzl}),diff:Bt({bignumber:Xt.edS,matrix:Xt.pIu,number:Xt.Rxh,subtract:Xt.$XF,typed:Xt.Gzl}),row:zt({Index:Xt.gmE,matrix:Xt.pIu,range:Xt.w6H,typed:Xt.Gzl}),mean:Zt({add:Xt.IHx,divide:Xt.csF,typed:Xt.Gzl}),variance:$t({add:Xt.IHx,apply:Xt.nnj,divide:Xt.csF,isNaN:Xt.i2d,multiply:Xt.JpY,subtract:Xt.$XF,typed:Xt.Gzl}),std:Yt({sqrt:Xt._b3,typed:Xt.Gzl,variance:Xt.CAK})}),Qt(nn,{ResultSet:Xt.Z0z,Complex:Xt.Zz9,Range:Xt.e6w,Node:rn,ArrayNode:an,BlockNode:on,ConstantNode:sn,ObjectNode:un,ParenthesisNode:ln,RelationalNode:cn,Chain:fn,BigNumber:Xt.O$v,Matrix:Xt.y3G,ConditionalNode:pn,OperatorNode:hn,Fraction:Xt.iAi,RangeNode:mn,DenseMatrix:Xt.JfM,FunctionAssignmentNode:vn,SparseMatrix:Xt.A7i,ImmutableDenseMatrix:Xt.MUK,FibonacciHeap:Xt.Q3n,AccessorNode:gn,IndexNode:_n,Index:Xt.gmE,AssignmentNode:bn,Spa:Xt.HJh,Unit:Xt.fbc,SymbolNode:xn,FunctionNode:wn,Help:Sn,Parser:Mn}),fn.createProxy(en)},1538:(e,t,n)=>{"use strict";n.d(t,{O$v:()=>Jp,Zz9:()=>Fp,JfM:()=>dh,Q3n:()=>av,iAi:()=>sh,MUK:()=>iv,gmE:()=>Av,cw7:()=>Yp,bZs:()=>om,doM:()=>Xp,wwJ:()=>ch,y3G:()=>$p,e6w:()=>Hp,Z0z:()=>zp,PNl:()=>th,vNo:()=>Cm,HJh:()=>Ny,A7i:()=>Tm,fbc:()=>Gy,OvO:()=>lh,xOA:()=>Qp,WJv:()=>Zp,OSG:()=>Wp,wcc:()=>Gp,WnP:()=>hv,Khb:()=>Zh,__u:()=>xm,C6L:()=>Wh,trc:()=>sv,rcO:()=>Gh,KLC:()=>wm,IHx:()=>cv,scv:()=>pm,xDy:()=>Gv,nnj:()=>Sh,R91:()=>Dh,PUJ:()=>Jh,lo8:()=>Tv,ZRM:()=>$h,VfV:()=>Em,z4N:()=>Vh,fvJ:()=>uv,C80:()=>Kh,uzo:()=>Yy,_vz:()=>Sg,O7j:()=>Zy,edS:()=>qv,Ly_:()=>bm,hx9:()=>Bm,Pfe:()=>Ih,wKT:()=>Fv,nNS:()=>Um,Cl$:()=>Xy,tUn:()=>Ug,Rhk:()=>Qy,O72:()=>xh,tjo:()=>Ty,eKn:()=>Dm,mDi:()=>ry,_fe:()=>Mg,d9v:()=>sm,$QP:()=>hy,BjO:()=>rm,d4C:()=>km,quX:()=>Qm,rn1:()=>Mv,cdM:()=>ev,PYB:()=>wh,ift:()=>dv,zoF:()=>zm,xk2:()=>eg,ruJ:()=>ym,mCk:()=>Nm,f9Y:()=>Yh,oHe:()=>Kv,h6M:()=>Xh,JPg:()=>Jg,QXW:()=>Iy,JP7:()=>Jy,kCc:()=>ay,QBQ:()=>Sm,RhL:()=>Qh,NZC:()=>vy,kOm:()=>Mh,vZr:()=>yy,Q8I:()=>Oy,dEt:()=>tg,Ka3:()=>Fm,Hgg:()=>my,TE$:()=>Cy,csF:()=>qy,QgA:()=>by,AKD:()=>fv,yVo:()=>Py,iOk:()=>yv,qgo:()=>Nv,e:()=>uh,dvW:()=>rh,Gq_:()=>$y,dXo:()=>kg,_G2:()=>ng,iMQ:()=>qg,DgJ:()=>ly,kuq:()=>_h,eZD:()=>kv,qNN:()=>Uh,Qqt:()=>hm,Ege:()=>Uy,t$B:()=>kh,bLN:()=>ty,Am2:()=>rg,cIy:()=>Og,hXT:()=>Rh,Oyo:()=>ih,Vvs:()=>ig,zG0:()=>py,xHg:()=>_v,GWj:()=>mv,Ed_:()=>Lh,WUZ:()=>qh,Pj$:()=>fm,yiU:()=>Uv,eOQ:()=>Yg,thl:()=>Pm,mOi:()=>gm,H9q:()=>ag,QXX:()=>Cg,HQL:()=>og,Hdk:()=>um,$v1:()=>Vm,_mT:()=>Ry,i:()=>Kp,yRu:()=>Hm,im:()=>Ph,KzB:()=>Qv,wfr:()=>Vy,JBn:()=>By,WSk:()=>zg,UaK:()=>mh,i2d:()=>gh,nMy:()=>Am,kEn:()=>vh,xPR:()=>yh,e47:()=>Hh,Fr9:()=>pv,mYz:()=>Hy,$$$:()=>sg,JvE:()=>Hv,TWx:()=>nv,Cr4:()=>Ov,uqG:()=>zv,w57:()=>Ym,cM7:()=>Dy,mvw:()=>Oh,Krr:()=>Wy,k3Q:()=>mm,PUn:()=>Ag,wtJ:()=>wy,ER9:()=>Ey,xly:()=>My,DU:()=>wg,UFs:()=>Gg,$nU:()=>ug,oLv:()=>$g,UID:()=>Bh,pIu:()=>Im,Fp7:()=>cy,J69:()=>zy,C2o:()=>Bg,VV$:()=>Vv,wQq:()=>jm,xJM:()=>_m,ak$:()=>lg,esS:()=>Tg,kEb:()=>cg,n4B:()=>Fg,SJ_:()=>Ng,JpY:()=>vv,cfl:()=>Ch,li8:()=>fg,KOy:()=>xg,ffD:()=>jh,C7f:()=>Rm,$$R:()=>xy,_A2:()=>Ig,Rxh:()=>bh,uRn:()=>Wv,jfK:()=>zh,iUs:()=>Zm,or:()=>qm,JeQ:()=>Cv,DW7:()=>ny,Skb:()=>ph,pi:()=>eh,sDj:()=>im,JaK:()=>dg,whQ:()=>Xg,gil:()=>pg,kc5:()=>Dg,XAT:()=>hg,oTb:()=>Hg,sQ3:()=>Ev,S0v:()=>Fh,WVs:()=>uy,CxM:()=>mg,qr:()=>Ly,pAO:()=>Bv,TYM:()=>Pg,MXc:()=>Om,Iyf:()=>am,w6H:()=>oy,re:()=>gv,vAu:()=>vg,PHU:()=>Vp,XLQ:()=>Wm,SIr:()=>bv,nq0:()=>Sv,LdX:()=>Xm,U1s:()=>Wg,k8z:()=>Lg,NMM:()=>Km,O7B:()=>sy,rMB:()=>Vg,KO_:()=>ah,BEc:()=>lv,Fbd:()=>em,ahj:()=>yg,$ZK:()=>fy,TVT:()=>Dv,Z41:()=>Yv,ff9:()=>Pv,TT1:()=>gy,oNG:()=>jv,ljT:()=>Xv,yk3:()=>Rv,V4s:()=>dy,uyX:()=>Sy,Xxe:()=>Ah,O$l:()=>Mm,R_K:()=>tm,dpJ:()=>Gm,cEy:()=>ky,Nyh:()=>tv,Sq_:()=>Jv,DYV:()=>$v,rVs:()=>ov,bl5:()=>jg,jLI:()=>Eh,_b3:()=>vm,jXX:()=>Eg,h62:()=>Th,L9e:()=>xv,qoR:()=>Ky,yO5:()=>gg,bAb:()=>Ay,Z_8:()=>cm,P9L:()=>Jm,$XF:()=>iy,Smz:()=>ey,ORZ:()=>Iv,AEp:()=>nm,BZ_:()=>nh,bej:()=>Zg,to:()=>wv,g49:()=>Lv,p4s:()=>Zv,kM2:()=>lm,Gzl:()=>hh,T8F:()=>dm,uKN:()=>Nh,KPr:()=>rv,bfT:()=>Kg,LDk:()=>bg,bJ2:()=>jy,tnB:()=>_g,CAK:()=>Fy,i83:()=>fh,Uud:()=>oh,bGh:()=>Rg,NpV:()=>Lm,dlQ:()=>_y,lls:()=>$m});var r=n(2191),i=n(8794),a=[],o=(0,i.d5)("ResultSet",a,(()=>{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}),s=n(1977),u=n(9139),l=n(5542),c=[],f=(0,i.d5)("Complex",c,(()=>(s.prototype.type="Complex",s.prototype.isComplex=!0,s.prototype.toJSON=function(){return{mathjs:"Complex",re:this.re,im:this.im}},s.prototype.toPolar=function(){return{r:this.abs(),phi:this.arg()}},s.prototype.format=function(e){var t=this.im,n=this.re,r=(0,u.WU)(this.re,e),i=(0,u.WU)(this.im,e),a=(0,l.hj)(e)?e:e?e.precision:null;if(null!==a){var o=Math.pow(10,-a);Math.abs(n/t)<o&&(n=0),Math.abs(t/n)<o&&(t=0)}return 0===t?r:0===n?1===t?"i":-1===t?"-i":i+"i":t<0?-1===t?r+" - i":r+" - "+i.substring(1)+"i":1===t?r+" + i":r+" + "+i+"i"},s.fromPolar=function(e){switch(arguments.length){case 1:var t=arguments[0];if("object"==typeof t)return s(t);throw new TypeError("Input has to be an object with r and phi keys.");case 2:var n=arguments[0],r=arguments[1];if((0,l.hj)(n)){if((0,l.wr)(r)&&r.hasBase("ANGLE")&&(r=r.toNumber("rad")),(0,l.hj)(r))return new s({r:n,phi:r});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")}},s.prototype.valueOf=s.prototype.toString,s.fromJSON=function(e){return new s(e)},s.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},s)),{isClass:!0}),d=[],p=(0,i.d5)("Range",d,(()=>{function e(t,n,r){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator");var i=null!=t,a=null!=n,o=null!=r;if(i)if((0,l.l9)(t))t=t.toNumber();else if("number"!=typeof t)throw new TypeError("Parameter start must be a number");if(a)if((0,l.l9)(n))n=n.toNumber();else if("number"!=typeof n)throw new TypeError("Parameter end must be a number");if(o)if((0,l.l9)(r))r=r.toNumber();else if("number"!=typeof r)throw new TypeError("Parameter step must be a number");this.start=i?parseFloat(t):0,this.end=a?parseFloat(n):0,this.step=o?parseFloat(r):1}return e.prototype.type="Range",e.prototype.isRange=!0,e.parse=function(t){if("string"!=typeof t)return null;var n=t.split(":").map((function(e){return parseFloat(e)}));if(n.some((function(e){return isNaN(e)})))return null;switch(n.length){case 2:return new e(n[0],n[1]);case 3:return new e(n[0],n[2],n[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,n=this.step,r=this.end-t;return(0,u.Xx)(n)===(0,u.Xx)(r)?e=Math.ceil(r/n):0===r&&(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,n=this.step,r=this.end,i=0;if(n>0)for(;t<r;)e(t,[i],this),t+=n,i++;else if(n<0)for(;t>r;)e(t,[i],this),t+=n,i++},e.prototype.map=function(e){var t=[];return this.forEach((function(n,r,i){t[r[0]]=e(n,r,i)})),t},e.prototype.toArray=function(){var e=[];return this.forEach((function(t,n){e[n[0]]=t})),e},e.prototype.valueOf=function(){return this.toArray()},e.prototype.format=function(e){var t=(0,u.WU)(this.start,e);return 1!==this.step&&(t+=":"+(0,u.WU)(this.step,e)),t+":"+(0,u.WU)(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}),h=n(77),m=(0,h.HP)((function(e){return new e(1).exp()}),{hasher:_}),v=(0,h.HP)((function(e){return new e(1).plus(new e(5).sqrt()).div(2)}),{hasher:_}),y=(0,h.HP)((function(e){return e.acos(-1)}),{hasher:_}),g=(0,h.HP)((function(e){return y(e).times(2)}),{hasher:_});function _(e){return e[0].precision}var b=Math.PI,x=2*Math.PI,w=Math.E,E=(0,i.d5)("true",[],(()=>!0)),N=(0,i.d5)("false",[],(()=>!1)),S=(0,i.d5)("null",[],(()=>null)),M=q("Infinity",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(1/0):1/0})),k=q("NaN",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(NaN):NaN})),O=q("pi",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?y(n):b})),C=q("tau",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?g(n):x})),A=q("e",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?m(n):w})),T=q("phi",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?v(n):1.618033988749895})),I=q("LN2",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(2).ln():Math.LN2})),D=q("LN10",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(10).ln():Math.LN10})),P=q("LOG2E",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(1).div(new n(2).ln()):Math.LOG2E})),j=q("LOG10E",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(1).div(new n(10).ln()):Math.LOG10E})),R=q("SQRT1_2",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n("0.5").sqrt():Math.SQRT1_2})),L=q("SQRT2",["config","?BigNumber"],(e=>{var{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(2).sqrt():Math.SQRT2})),B=q("i",["Complex"],(e=>{var{Complex:t}=e;return t.I})),U=(0,i.d5)("version",[],(()=>"9.3.0"));function q(e,t,n){return(0,i.d5)(e,t,n,{recreateOnConfigChange:!0})}var z=n(3776),F=["?on","config"],H=(0,i.d5)("BigNumber",F,(e=>{var{on:t,config:n}=e,r=z.clone({precision:n.precision,modulo:9});return r.prototype.type="BigNumber",r.prototype.isBigNumber=!0,r.prototype.toJSON=function(){return{mathjs:"BigNumber",value:this.toString()}},r.fromJSON=function(e){return new r(e.value)},t&&t("config",(function(e,t){e.precision!==t.precision&&r.config({precision:e.precision})})),r}),{isClass:!0}),Z=[],W=(0,i.d5)("Matrix",Z,(()=>{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,n){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,n){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.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}),G=[],J=(0,i.d5)("replacer",G,(()=>function(e,t){return"number"!=typeof t||isFinite(t)&&!isNaN(t)?t:{mathjs:"number",value:String(t)}})),$=Ze("speedOfLight","299792458","m s^-1"),V=Ze("gravitationConstant","6.67430e-11","m^3 kg^-1 s^-2"),K=Ze("planckConstant","6.62607015e-34","J s"),Y=Ze("reducedPlanckConstant","1.0545718176461565e-34","J s"),X=Ze("magneticConstant","1.25663706212e-6","N A^-2"),Q=Ze("electricConstant","8.8541878128e-12","F m^-1"),ee=Ze("vacuumImpedance","376.730313667","ohm"),te=Ze("coulomb","8.987551792261171e9","N m^2 C^-2"),ne=Ze("elementaryCharge","1.602176634e-19","C"),re=Ze("bohrMagneton","9.2740100783e-24","J T^-1"),ie=Ze("conductanceQuantum","7.748091729863649e-5","S"),ae=Ze("inverseConductanceQuantum","12906.403729652257","ohm"),oe=Ze("magneticFluxQuantum","2.0678338484619295e-15","Wb"),se=Ze("nuclearMagneton","5.0507837461e-27","J T^-1"),ue=Ze("klitzing","25812.807459304513","ohm"),le=Ze("bohrRadius","5.29177210903e-11","m"),ce=Ze("classicalElectronRadius","2.8179403262e-15","m"),fe=Ze("electronMass","9.1093837015e-31","kg"),de=Ze("fermiCoupling","1.1663787e-5","GeV^-2"),pe=We("fineStructure",.0072973525693),he=Ze("hartreeEnergy","4.3597447222071e-18","J"),me=Ze("protonMass","1.67262192369e-27","kg"),ve=Ze("deuteronMass","3.3435830926e-27","kg"),ye=Ze("neutronMass","1.6749271613e-27","kg"),ge=Ze("quantumOfCirculation","3.6369475516e-4","m^2 s^-1"),_e=Ze("rydberg","10973731.568160","m^-1"),be=Ze("thomsonCrossSection","6.6524587321e-29","m^2"),xe=We("weakMixingAngle",.2229),we=We("efimovFactor",22.7),Ee=Ze("atomicMass","1.66053906660e-27","kg"),Ne=Ze("avogadro","6.02214076e23","mol^-1"),Se=Ze("boltzmann","1.380649e-23","J K^-1"),Me=Ze("faraday","96485.33212331001","C mol^-1"),ke=Ze("firstRadiation","3.7417718521927573e-16","W m^2"),Oe=Ze("loschmidt","2.686780111798444e25","m^-3"),Ce=Ze("gasConstant","8.31446261815324","J K^-1 mol^-1"),Ae=Ze("molarPlanckConstant","3.990312712893431e-10","J s mol^-1"),Te=Ze("molarVolume","0.022413969545014137","m^3 mol^-1"),Ie=We("sackurTetrode",-1.16487052358),De=Ze("secondRadiation","0.014387768775039337","m K"),Pe=Ze("stefanBoltzmann","5.67037441918443e-8","W m^-2 K^-4"),je=Ze("wienDisplacement","2.897771955e-3","m K"),Re=Ze("molarMass","0.99999999965e-3","kg mol^-1"),Le=Ze("molarMassC12","11.9999999958e-3","kg mol^-1"),Be=Ze("gravity","9.80665","m s^-2"),Ue=Ze("planckLength","1.616255e-35","m"),qe=Ze("planckMass","2.176435e-8","kg"),ze=Ze("planckTime","5.391245e-44","s"),Fe=Ze("planckCharge","1.87554603778e-18","C"),He=Ze("planckTemperature","1.416785e+32","K");function Ze(e,t,n){return(0,i.d5)(e,["config","Unit","BigNumber"],(e=>{var{config:r,Unit:i,BigNumber:a}=e,o=new i("BigNumber"===r.number?new a(t):parseFloat(t),n);return o.fixPrefix=!0,o}))}function We(e,t){return(0,i.d5)(e,["config","BigNumber"],(e=>{var{config:n,BigNumber:r}=e;return"BigNumber"===n.number?new r(t):t}))}var Ge=n(5628),Je=[],$e=(0,i.d5)("Fraction",Je,(()=>(Ge.prototype.type="Fraction",Ge.prototype.isFraction=!0,Ge.prototype.toJSON=function(){return{mathjs:"Fraction",n:this.s*this.n,d:this.d}},Ge.fromJSON=function(e){return new Ge(e)},Ge)),{isClass:!0}),Ve=n(4444),Ke=n(3014),Ye=n(5254),Xe=n(4961),Qe=["Matrix"],et=(0,i.d5)("DenseMatrix",Qe,(e=>{var{Matrix:t}=e;function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!(0,l.HD)(t))throw new Error("Invalid datatype: "+t);if((0,l.SW)(e))"DenseMatrix"===e.type?(this._data=(0,Ye.d9)(e._data),this._size=(0,Ye.d9)(e._size),this._datatype=t||e._datatype):(this._data=e.toArray(),this._size=e.size(),this._datatype=t||e._datatype);else if(e&&(0,l.kJ)(e.data)&&(0,l.kJ)(e.size))this._data=e.data,this._size=e.size,(0,Ve.Gu)(this._data,this._size),this._datatype=t||e.datatype;else if((0,l.kJ)(e))this._data=f(e),this._size=(0,Ve.aJ)(this._data),(0,Ve.Gu)(this._data,this._size),this._datatype=t;else{if(e)throw new TypeError("Unsupported type of data ("+(0,l.kM)(e)+")");this._data=[],this._size=[0],this._datatype=t}}function r(e,t){if(!(0,l.dh)(t))throw new TypeError("Invalid index");if(t.isScalar())return e.get(t.min());var r=t.size();if(r.length!==e._size.length)throw new Xe.m(r.length,e._size.length);for(var a=t.min(),o=t.max(),s=0,u=e._size.length;s<u;s++)(0,Ve.Ls)(a[s],e._size[s]),(0,Ve.Ls)(o[s],e._size[s]);return new n(i(e._data,t,r.length,0),e._datatype)}function i(e,t,n,r){var a=r===n-1,o=t.dimension(r);return a?o.map((function(t){return(0,Ve.Ls)(t,e.length),e[t]})).valueOf():o.map((function(a){return(0,Ve.Ls)(a,e.length),i(e[a],t,n,r+1)})).valueOf()}function a(e,t,n,r){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");var i,a=t.size(),s=t.isScalar();if((0,l.SW)(n)?(i=n.size(),n=n.valueOf()):i=(0,Ve.aJ)(n),s){if(0!==i.length)throw new TypeError("Scalar expected");e.set(t.min(),n,r)}else{if(a.length<e._size.length)throw new Xe.m(a.length,e._size.length,"<");if(i.length<a.length){for(var u=0,f=0;1===a[u]&&1===i[u];)u++;for(;1===a[u];)f++,u++;n=(0,Ve.f4)(n,a.length,f,i)}if(!(0,Ye.J5)(a,i))throw new Xe.m(a,i,">");c(e,t.max().map((function(e){return e+1})),r);var d=a.length;o(e._data,t,n,d,0)}return e}function o(e,t,n,r,i){var a=i===r-1,s=t.dimension(i);a?s.forEach((function(t,r){(0,Ve.Ls)(t),e[t]=n[r[0]]})):s.forEach((function(a,s){(0,Ve.Ls)(a),o(e[a],t,n[s[0]],r,i+1)}))}function s(e,t,n){if(0===t.length){for(var r=e._data;(0,l.kJ)(r);)r=r[0];return r}return e._size=t.slice(0),e._data=(0,Ve.SI)(e._data,e._size,n),e}function c(e,t,n){for(var r=e._size.slice(0),i=!1;r.length<t.length;)r.push(0),i=!0;for(var a=0,o=t.length;a<o;a++)t[a]>r[a]&&(r[a]=t[a],i=!0);i&&s(e,r,n)}function f(e){for(var t=0,n=e.length;t<n;t++){var r=e[t];(0,l.kJ)(r)?e[t]=f(r):r&&!0===r.isMatrix&&(e[t]=f(r.valueOf()))}return e}return n.prototype=new t,n.prototype.createDenseMatrix=function(e,t){return new n(e,t)},n.prototype.type="DenseMatrix",n.prototype.isDenseMatrix=!0,n.prototype.getDataType=function(){return(0,Ve.$q)(this._data,l.kM)},n.prototype.storage=function(){return"dense"},n.prototype.datatype=function(){return this._datatype},n.prototype.create=function(e,t){return new n(e,t)},n.prototype.subset=function(e,t,n){switch(arguments.length){case 1:return r(this,e);case 2:case 3:return a(this,e,t,n);default:throw new SyntaxError("Wrong number of arguments")}},n.prototype.get=function(e){if(!(0,l.kJ)(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Xe.m(e.length,this._size.length);for(var t=0;t<e.length;t++)(0,Ve.Ls)(e[t],this._size[t]);for(var n=this._data,r=0,i=e.length;r<i;r++){var a=e[r];(0,Ve.Ls)(a,n.length),n=n[a]}return n},n.prototype.set=function(e,t,n){if(!(0,l.kJ)(e))throw new TypeError("Array expected");if(e.length<this._size.length)throw new Xe.m(e.length,this._size.length,"<");var r,i,a;c(this,e.map((function(e){return e+1})),n);var o=this._data;for(r=0,i=e.length-1;r<i;r++)a=e[r],(0,Ve.Ls)(a,o.length),o=o[a];return a=e[e.length-1],(0,Ve.Ls)(a,o.length),o[a]=t,this},n.prototype.resize=function(e,t,n){if(!(0,l.uZ)(e))throw new TypeError("Array or Matrix expected");var r=e.valueOf().map((e=>Array.isArray(e)&&1===e.length?e[0]:e));return s(n?this.clone():this,r,t)},n.prototype.reshape=function(e,t){var n=t?this.clone():this;n._data=(0,Ve.XL)(n._data,e);var r=n._size.reduce(((e,t)=>e*t));return n._size=(0,Ve.eu)(e,r),n},n.prototype.clone=function(){return new n({data:(0,Ye.d9)(this._data),size:(0,Ye.d9)(this._size),datatype:this._datatype})},n.prototype.size=function(){return this._size.slice(0)},n.prototype.map=function(e){var t=this,r=function n(r,i){return(0,l.kJ)(r)?r.map((function(e,t){return n(e,i.concat(t))})):e(r,i,t)}(this._data,[]);return new n(r,void 0!==this._datatype?(0,Ve.$q)(r,l.kM):void 0)},n.prototype.forEach=function(e){var t=this;!function n(r,i){(0,l.kJ)(r)?r.forEach((function(e,t){n(e,i.concat(t))})):e(r,i,t)}(this._data,[])},n.prototype.toArray=function(){return(0,Ye.d9)(this._data)},n.prototype.valueOf=function(){return this._data},n.prototype.format=function(e){return(0,Ke.WU)(this._data,e)},n.prototype.toString=function(){return(0,Ke.WU)(this._data)},n.prototype.toJSON=function(){return{mathjs:"DenseMatrix",data:this._data,size:this._size,datatype:this._datatype}},n.prototype.diagonal=function(e){if(e){if((0,l.l9)(e)&&(e=e.toNumber()),!(0,l.hj)(e)||!(0,u.U)(e))throw new TypeError("The parameter k must be an integer number")}else e=0;for(var t=e>0?e:0,r=e<0?-e:0,i=this._size[0],a=this._size[1],o=Math.min(i-r,a-t),s=[],c=0;c<o;c++)s[c]=this._data[c+r][c+t];return new n({data:s,size:[o],datatype:this._datatype})},n.diagonal=function(e,t,r,i){if(!(0,l.kJ)(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((0,l.l9)(e)&&(e=e.toNumber()),!(0,l.hj)(e)||!(0,u.U)(e)||e<1)throw new Error("Size values must be positive integers");return e})),r){if((0,l.l9)(r)&&(r=r.toNumber()),!(0,l.hj)(r)||!(0,u.U)(r))throw new TypeError("The parameter k must be an integer number")}else r=0;var a,o=r>0?r:0,s=r<0?-r:0,c=e[0],f=e[1],d=Math.min(c-s,f-o);if((0,l.kJ)(t)){if(t.length!==d)throw new Error("Invalid value array length");a=function(e){return t[e]}}else if((0,l.SW)(t)){var p=t.size();if(1!==p.length||p[0]!==d)throw new Error("Invalid matrix length");a=function(e){return t.get([e])}}else a=function(){return t};i||(i=(0,l.l9)(a(0))?a(0).mul(0):0);var h=[];if(e.length>0){h=(0,Ve.SI)(h,e,i);for(var m=0;m<d;m++)h[m+s][m+o]=a(m)}return new n({data:h,size:[c,f]})},n.fromJSON=function(e){return new n(e)},n.prototype.swapRows=function(e,t){if(!((0,l.hj)(e)&&(0,u.U)(e)&&(0,l.hj)(t)&&(0,u.U)(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(0,Ve.Ls)(e,this._size[0]),(0,Ve.Ls)(t,this._size[0]),n._swapRows(e,t,this._data),this},n._swapRows=function(e,t,n){var r=n[e];n[e]=n[t],n[t]=r},n}),{isClass:!0}),tt=n(2287),nt=function(){return nt=tt.create,tt},rt=["?BigNumber","?Complex","?DenseMatrix","?Fraction"],it=(0,i.d5)("typed",rt,(function(e){var{BigNumber:t,Complex:n,DenseMatrix:r,Fraction:i}=e,a=nt();return a.types=[{name:"number",test:l.hj},{name:"Complex",test:l.Mc},{name:"BigNumber",test:l.l9},{name:"Fraction",test:l.yQ},{name:"Unit",test:l.wr},{name:"string",test:l.HD},{name:"Chain",test:l.qg},{name:"Array",test:l.kJ},{name:"Matrix",test:l.SW},{name:"DenseMatrix",test:l.jH},{name:"SparseMatrix",test:l.sA},{name:"Range",test:l.bR},{name:"Index",test:l.dh},{name:"boolean",test:l.jn},{name:"ResultSet",test:l.cB},{name:"Help",test:l.x1},{name:"function",test:l.mf},{name:"Date",test:l.J_},{name:"RegExp",test:l.Kj},{name:"null",test:l.Ft},{name:"undefined",test:l.o8},{name:"AccessorNode",test:l.Yz},{name:"ArrayNode",test:l.j0},{name:"AssignmentNode",test:l.Bp},{name:"BlockNode",test:l.zh},{name:"ConditionalNode",test:l.tS},{name:"ConstantNode",test:l.nu},{name:"FunctionNode",test:l.VO},{name:"FunctionAssignmentNode",test:l.l7},{name:"IndexNode",test:l.Cl},{name:"Node",test:l.UG},{name:"ObjectNode",test:l.Lr},{name:"OperatorNode",test:l.bV},{name:"ParenthesisNode",test:l.Ig},{name:"RangeNode",test:l.ex},{name:"SymbolNode",test:l.FG},{name:"Object",test:l.Kn}],a.conversions=[{from:"number",to:"BigNumber",convert:function(e){if(t||at(e),(0,u.nz)(e)>15)throw new TypeError("Cannot implicitly convert a number with >15 significant digits to BigNumber (value: "+e+"). Use function bignumber(x) to convert to BigNumber.");return new t(e)}},{from:"number",to:"Complex",convert:function(e){return n||ot(e),new n(e,0)}},{from:"number",to:"string",convert:function(e){return e+""}},{from:"BigNumber",to:"Complex",convert:function(e){return n||ot(e),new n(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 n||ot(e),new n(e.valueOf(),0)}},{from:"number",to:"Fraction",convert:function(e){i||st(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||at(e);try{return new t(e)}catch(t){throw new Error('Cannot convert "'+e+'" to BigNumber')}}},{from:"string",to:"Fraction",convert:function(e){i||st(e);try{return new i(e)}catch(t){throw new Error('Cannot convert "'+e+'" to Fraction')}}},{from:"string",to:"Complex",convert:function(e){n||ot(e);try{return new n(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||at(e),new t(+e)}},{from:"boolean",to:"Fraction",convert:function(e){return i||st(e),new i(+e)}},{from:"boolean",to:"string",convert:function(e){return String(e)}},{from:"Array",to:"Matrix",convert:function(e){return r||function(){throw new Error("Cannot convert array into a Matrix: no class 'DenseMatrix' provided")}(),new r(e)}},{from:"Matrix",to:"Array",convert:function(e){return e.valueOf()}}],a}));function at(e){throw new Error("Cannot convert value ".concat(e," into a BigNumber: no class 'BigNumber' provided"))}function ot(e){throw new Error("Cannot convert value ".concat(e," into a Complex number: no class 'Complex' provided"))}function st(e){throw new Error("Cannot convert value ".concat(e," into a Fraction, no class 'Fraction' provided."))}var ut=n(4344),lt="isInteger",ct=["typed"],ft=(0,i.d5)(lt,ct,(e=>{var{typed:t}=e;return t(lt,{number:u.U,BigNumber:function(e){return e.isInt()},Fraction:function(e){return 1===e.d&&isFinite(e.n)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),dt="isNumeric",pt=["typed"],ht=(0,i.d5)(dt,pt,(e=>{var{typed:t}=e;return t(dt,{"number | BigNumber | Fraction | boolean":function(){return!0},"Complex | Unit | string | null | undefined | Node":function(){return!1},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),mt="number";function vt(e){return e<0}function yt(e){return e>0}function gt(e){return 0===e}function _t(e){return Number.isNaN(e)}vt.signature=mt,yt.signature=mt,gt.signature=mt,_t.signature=mt;var bt="isPositive",xt=["typed"],wt=(0,i.d5)(bt,xt,(e=>{var{typed:t}=e;return t(bt,{number:yt,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(0,ut.Fh)(e,this)}})})),Et="isNaN",Nt=["typed"],St=(0,i.d5)(Et,Nt,(e=>{var{typed:t}=e;return t(Et,{number:_t,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(0,ut.Fh)(e,Number.isNaN)}})}));function Mt(e,t,n){if(null==n)return e.eq(t);if(e.eq(t))return!0;if(e.isNaN()||t.isNaN())return!1;if(e.isFinite()&&t.isFinite()){var r=e.minus(t).abs();if(r.isZero())return!0;var i=e.constructor.max(e.abs(),t.abs());return r.lte(i.times(n))}return!1}var kt="equalScalar",Ot=["typed","config"],Ct=(0,i.d5)(kt,Ot,(e=>{var{typed:t,config:n}=e;return t(kt,{"boolean, boolean":function(e,t){return e===t},"number, number":function(e,t){return(0,u.RI)(e,t,n.epsilon)},"BigNumber, BigNumber":function(e,t){return e.eq(t)||Mt(e,t,n.epsilon)},"Fraction, Fraction":function(e,t){return e.equals(t)},"Complex, Complex":function(e,t){return function(e,t,n){return(0,u.RI)(e.re,t.re,n)&&(0,u.RI)(e.im,t.im,n)}(e,t,n.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)}})})),At=((0,i.d5)(kt,["typed","config"],(e=>{var{typed:t,config:n}=e;return t(kt,{"number, number":function(e,t){return(0,u.RI)(e,t,n.epsilon)}})})),["typed"]),Tt=(0,i.d5)("number",At,(e=>{var{typed:t}=e,n=t("number",{"":function(){return 0},number:function(e){return e},string:function(e){if("NaN"===e)return NaN;var t,n,r=(n=(t=e).match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/))?{input:t,radix:{"0b":2,"0o":8,"0x":16}[n[1]],integerPart:n[2],fractionalPart:n[3]}:null;if(r)return function(e){for(var t=parseInt(e.integerPart,e.radix),n=0,r=0;r<e.fractionalPart.length;r++)n+=parseInt(e.fractionalPart[r],e.radix)/Math.pow(e.radix,r+1);var i=t+n;if(isNaN(i))throw new SyntaxError('String "'+e.input+'" is no valid number');return i}(r);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>2**i-1)throw new SyntaxError('String "'.concat(e,'" is out of range'));o>=2**(i-1)&&(o-=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(0,ut.Fh)(e,this)}});return n.fromJSON=function(e){return parseFloat(e.value)},n})),It="boolean",Dt=["typed"],Pt=(0,i.d5)(It,Dt,(e=>{var{typed:t}=e;return t(It,{"":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 n=Number(e);if(""!==e&&!isNaN(n))return!!n;throw new Error('Cannot convert "'+e+'" to a boolean')},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),jt=["typed","Complex"],Rt=(0,i.d5)("complex",jt,(e=>{var{typed:t,Complex:n}=e;return t("complex",{"":function(){return n.ZERO},number:function(e){return new n(e,0)},"number, number":function(e,t){return new n(e,t)},"BigNumber, BigNumber":function(e,t){return new n(e.toNumber(),t.toNumber())},Fraction:function(e){return new n(e.valueOf(),0)},Complex:function(e){return e.clone()},string:function(e){return n(e)},null:function(e){return n(0)},Object:function(e){if("re"in e&&"im"in e)return new n(e.re,e.im);if("r"in e&&"phi"in e||"abs"in e&&"arg"in e)return new n(e);throw new Error("Expected object with properties (re and im) or (r and phi) or (abs and arg)")},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Lt="splitUnit",Bt=["typed"],Ut=(0,i.d5)(Lt,Bt,(e=>{var{typed:t}=e;return t(Lt,{"Unit, Array":function(e,t){return e.splitUnit(t)}})})),qt="number",zt="number, number";function Ft(e){return Math.abs(e)}function Ht(e,t){return e+t}function Zt(e,t){return e*t}function Wt(e){return-e}function Gt(e){return e}function Jt(e){return(0,u.eK)(e)}function $t(e){return Math.ceil(e)}function Vt(e){return e*e*e}function Kt(e){return Math.exp(e)}function Yt(e){return(0,u.t$)(e)}function Xt(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Parameters in function gcd must be integer numbers");for(var n;0!==t;)n=e%t,e=t,t=n;return e<0?-e:e}function Qt(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Parameters in function lcm must be integer numbers");if(0===e||0===t)return 0;for(var n,r=e*t;0!==t;)t=e%(n=t),e=n;return Math.abs(r/e)}function en(e){return Math.log(e)}function tn(e){return(0,u.mv)(e)}function nn(e){return(0,u.k3)(e)}function rn(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 an(e,t){var n=t<0;if(n&&(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 n?1/0:0;if(!isFinite(e))return n?0:e;var r=Math.pow(Math.abs(e),1/t);return r=e<0?-r:r,n?1/r:r}function on(e){return(0,u.Xx)(e)}function sn(e){return e*e}function un(e,t){var n,r,i,a=0,o=1,s=1,l=0;if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Parameters in function xgcd must be integer numbers");for(;t;)i=e-(r=Math.floor(e/t))*t,n=a,a=o-r*a,o=n,n=s,s=l-r*s,l=n,e=t,t=i;return e<0?[-e,-o,-l]:[e,e?o:0,l]}function ln(e,t){return e*e<1&&t===1/0||e*e>1&&t===-1/0?0:Math.pow(e,t)}function cn(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;return parseFloat((0,u.FH)(e,t))}Ft.signature=qt,Ht.signature=zt,Zt.signature=zt,Wt.signature=qt,Gt.signature=qt,Jt.signature=qt,$t.signature=qt,Vt.signature=qt,Kt.signature=qt,Yt.signature=qt,Xt.signature=zt,Qt.signature=zt,en.signature=qt,tn.signature=qt,nn.signature=qt,rn.signature=zt,an.signature=zt,on.signature=qt,sn.signature=qt,un.signature=zt,ln.signature=zt,cn.signature=zt;var fn="unaryPlus",dn=["typed","config","BigNumber"],pn=(0,i.d5)(fn,dn,(e=>{var{typed:t,config:n,BigNumber:r}=e;return t(fn,{number:Gt,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(0,ut.Fh)(e,this,!0)},"boolean | string":function(e){return"BigNumber"===n.number?new r(+e):+e}})})),hn="cube",mn=["typed"],vn=(0,i.d5)(hn,mn,(e=>{var{typed:t}=e;return t(hn,{number:Vt,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(0,ut.Fh)(e,this,!0)},Unit:function(e){return e.pow(3)}})})),yn="expm1",gn=["typed","Complex"],_n=(0,i.d5)(yn,gn,(e=>{var{typed:t,Complex:n}=e;return t(yn,{number:Yt,Complex:function(e){var t=Math.exp(e.re);return new n(t*Math.cos(e.im)-1,t*Math.sin(e.im))},BigNumber:function(e){return e.exp().minus(1)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),bn="log10",xn=["typed","config","Complex"],wn=(0,i.d5)(bn,xn,(e=>{var{typed:t,config:n,Complex:r}=e;return t(bn,{number:function(e){return e>=0||n.predictable?tn(e):new r(e,0).log().div(Math.LN10)},Complex:function(e){return new r(e).log().div(Math.LN10)},BigNumber:function(e){return!e.isNegative()||n.predictable?e.log():new r(e.toNumber(),0).log().div(Math.LN10)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),En=["typed"],Nn=(0,i.d5)("multiplyScalar",En,(e=>{var{typed:t}=e;return t("multiplyScalar",{"number, number":Zt,"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 n=t.clone();return n.value=null===n.value?n._normalize(e):this(n.value,e),n},"Unit, number | Fraction | BigNumber | Complex":function(e,t){var n=e.clone();return n.value=null===n.value?n._normalize(t):this(n.value,t),n},"Unit, Unit":function(e,t){return e.multiply(t)}})})),Sn="sign",Mn=["typed","BigNumber","Fraction","complex"],kn=(0,i.d5)(Sn,Mn,(e=>{var{typed:t,BigNumber:n,complex:r,Fraction:i}=e;return t(Sn,{number:on,Complex:function(e){return 0===e.im?r(on(e.re)):e.sign()},BigNumber:function(e){return new n(e.cmp(0))},Fraction:function(e){return new i(e.s,1)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},Unit:function(e){return this(e.value)}})})),On="square",Cn=["typed"],An=(0,i.d5)(On,Cn,(e=>{var{typed:t}=e;return t(On,{number:sn,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(0,ut.Fh)(e,this,!0)},Unit:function(e){return e.pow(2)}})}));function Tn(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitAnd");var n=e.constructor;if(e.isNaN()||t.isNaN())return new n(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 n(0);if(!e.isFinite())return t.isNegative()?e:e.isNegative()?new n(0):t;if(!t.isFinite())return e.isNegative()?t:t.isNegative()?new n(0):e}return Pn(e,t,(function(e,t){return e&t}))}function In(e){if(e.isFinite()&&!e.isInteger())throw new Error("Integer expected in function bitNot");var t=e.constructor,n=t.precision;t.config({precision:1e9});var r=e.plus(new t(1));return r.s=-r.s||null,t.config({precision:n}),r}function Dn(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitOr");var n=e.constructor;if(e.isNaN()||t.isNaN())return new n(NaN);var r=new n(-1);return e.isZero()||t.eq(r)||e.eq(t)?t:t.isZero()||e.eq(r)?e:e.isFinite()&&t.isFinite()?Pn(e,t,(function(e,t){return e|t})):!e.isFinite()&&!e.isNegative()&&t.isNegative()||e.isNegative()&&!t.isNegative()&&!t.isFinite()?r:e.isNegative()&&t.isNegative()?e.isFinite()?e:t:e.isFinite()?t:e}function Pn(e,t,n){var r,i,a,o,s,u=e.constructor,l=+(e.s<0),c=+(t.s<0);if(l){r=jn(In(e));for(var f=0;f<r.length;++f)r[f]^=1}else r=jn(e);if(c){i=jn(In(t));for(var d=0;d<i.length;++d)i[d]^=1}else i=jn(t);r.length<=i.length?(a=r,o=i,s=l):(a=i,o=r,s=c);var p=a.length,h=o.length,m=1^n(l,c),v=new u(1^m),y=new u(1),g=new u(2),_=u.precision;for(u.config({precision:1e9});p>0;)n(a[--p],o[--h])===m&&(v=v.plus(y)),y=y.times(g);for(;h>0;)n(s,o[--h])===m&&(v=v.plus(y)),y=y.times(g);return u.config({precision:_}),0===m&&(v.s=-v.s),v}function jn(e){for(var t=e.d,n=t[0]+"",r=1;r<t.length;++r){for(var i=t[r]+"",a=7-i.length;a--;)i="0"+i;n+=i}for(var o=n.length;"0"===n.charAt(o);)o--;var s=e.e,u=n.slice(0,o+1||1),l=u.length;if(s>0)if(++s>l)for(s-=l;s--;)u+="0";else s<l&&(u=u.slice(0,s)+"."+u.slice(s));for(var c=[0],f=0;f<u.length;){for(var d=c.length;d--;)c[d]*=10;c[0]+=parseInt(u.charAt(f++));for(var p=0;p<c.length;++p)c[p]>1&&(null!==c[p+1]&&void 0!==c[p+1]||(c[p+1]=0),c[p+1]+=c[p]>>1,c[p]&=1)}return c.reverse()}function Rn(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitXor");var n=e.constructor;if(e.isNaN()||t.isNaN())return new n(NaN);if(e.isZero())return t;if(t.isZero())return e;if(e.eq(t))return new n(0);var r=new n(-1);return e.eq(r)?In(t):t.eq(r)?In(e):e.isFinite()&&t.isFinite()?Pn(e,t,(function(e,t){return e^t})):e.isFinite()||t.isFinite()?new n(e.isNegative()===t.isNegative()?1/0:-1/0):r}function Ln(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function leftShift");var n=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new n(NaN):e.isZero()||t.isZero()?e:e.isFinite()||t.isFinite()?t.lt(55)?e.times(Math.pow(2,t.toNumber())+""):e.times(new n(2).pow(t)):new n(NaN)}function Bn(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function rightArithShift");var n=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new n(NaN):e.isZero()||t.isZero()?e:t.isFinite()?t.lt(55)?e.div(Math.pow(2,t.toNumber())+"").floor():e.div(new n(2).pow(t)).floor():e.isNegative()?new n(-1):e.isFinite()?new n(0):new n(NaN)}var Un="number, number";function qn(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function bitAnd");return e&t}function zn(e){if(!(0,u.U)(e))throw new Error("Integer expected in function bitNot");return~e}function Fn(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function bitOr");return e|t}function Hn(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function bitXor");return e^t}function Zn(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function leftShift");return e<<t}function Wn(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function rightArithShift");return e>>t}function Gn(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function rightLogShift");return e>>>t}qn.signature=Un,zn.signature="number",Fn.signature=Un,Hn.signature=Un,Zn.signature=Un,Wn.signature=Un,Gn.signature=Un;var Jn="bitNot",$n=["typed"],Vn=(0,i.d5)(Jn,$n,(e=>{var{typed:t}=e;return t(Jn,{number:zn,BigNumber:In,"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Kn=["typed"],Yn=(0,i.d5)("arg",Kn,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this)}})})),Xn=["typed"],Qn=(0,i.d5)("im",Xn,(e=>{var{typed:t}=e;return t("im",{number:function(e){return 0},BigNumber:function(e){return e.mul(0)},Complex:function(e){return e.im},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),er="number, number";function tr(e){return!e}function nr(e,t){return!(!e&&!t)}function rr(e,t){return!!e!=!!t}function ir(e,t){return!(!e||!t)}tr.signature="number",nr.signature=er,rr.signature=er,ir.signature=er;var ar=["typed"],or=(0,i.d5)("not",ar,(e=>{var{typed:t}=e;return t("not",{number:tr,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(0,ut.Fh)(e,this)}})})),sr=["typed"],ur=(0,i.d5)("filter",sr,(e=>{var{typed:t}=e;return t("filter",{"Array, function":lr,"Matrix, function":function(e,t){return e.create(lr(e.toArray(),t))},"Array, RegExp":Ve.U_,"Matrix, RegExp":function(e,t){return e.create((0,Ve.U_)(e.toArray(),t))}})}));function lr(e,t){var n=(0,h.oV)(t);return(0,Ve.hX)(e,(function(e,r,i){return 1===n?t(e):2===n?t(e,[r]):t(e,[r],i)}))}var cr="forEach",fr=["typed"],dr=(0,i.d5)(cr,fr,(e=>{var{typed:t}=e;return t(cr,{"Array, function":pr,"Matrix, function":function(e,t){return e.forEach(t)}})}));function pr(e,t){var n=(0,h.oV)(t);!function r(i,a){Array.isArray(i)?(0,Ve.Ed)(i,(function(e,t){r(e,a.concat(t))})):1===n?t(i):2===n?t(i,a):t(i,a,e)}(e,[])}var hr=["typed"],mr=(0,i.d5)("map",hr,(e=>{var{typed:t}=e;return t("map",{"Array, function":vr,"Matrix, function":function(e,t){return e.map(t)}})}));function vr(e,t){var n=(0,h.oV)(t);return function r(i,a){return Array.isArray(i)?i.map((function(e,t){return r(e,a.concat(t))})):1===n?t(i):2===n?t(i,a):t(i,a,e)}(e,[])}var yr=["typed"],gr=(0,i.d5)("erf",yr,(e=>{var{typed:t}=e;return t("name",{number:function(e){var t=Math.abs(e);return t>=Er?(0,u.Xx)(e):t<=_r?(0,u.Xx)(e)*function(e){var t,n=e*e,r=xr[0][4]*n,i=n;for(t=0;t<3;t+=1)r=(r+xr[0][t])*n,i=(i+wr[0][t])*n;return e*(r+xr[0][3])/(i+wr[0][3])}(t):t<=4?(0,u.Xx)(e)*(1-function(e){var t,n=xr[1][8]*e,r=e;for(t=0;t<7;t+=1)n=(n+xr[1][t])*e,r=(r+wr[1][t])*e;var i=(n+xr[1][7])/(r+wr[1][7]),a=parseInt(16*e)/16,o=(e-a)*(e+a);return Math.exp(-a*a)*Math.exp(-o)*i}(t)):(0,u.Xx)(e)*(1-function(e){var t,n=1/(e*e),r=xr[2][5]*n,i=n;for(t=0;t<4;t+=1)r=(r+xr[2][t])*n,i=(i+wr[2][t])*n;var a=n*(r+xr[2][4])/(i+wr[2][4]);a=(br-a)/e;var o=(e-(n=parseInt(16*e)/16))*(e+n);return Math.exp(-n*n)*Math.exp(-o)*a}(t))},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),_r=.46875,br=.5641895835477563,xr=[[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]],wr=[[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]],Er=Math.pow(2,53),Nr="format",Sr=["typed"],Mr=(0,i.d5)(Nr,Sr,(e=>{var{typed:t}=e;return t(Nr,{any:Ke.WU,"any, Object | function | number":Ke.WU})})),kr=(0,i.d5)("oct",["typed","format"],(e=>{var{typed:t,format:n}=e;return t("oct",{"number | BigNumber":function(e){return n(e,{notation:"oct"})},"number | BigNumber, number":function(e,t){return n(e,{notation:"oct",wordSize:t})}})})),Or="print",Cr=["typed"],Ar=(0,i.d5)(Or,Cr,(e=>{var{typed:t}=e;return t(Or,{"string, Object | Array":Tr,"string, Object | Array, number | Object":Tr})}));function Tr(e,t,n){return e.replace(/\$([\w.]+)/g,(function(e,r){for(var i=r.split("."),a=t[i.shift()];i.length&&void 0!==a;){var o=i.shift();a=o?a[o]:a+"."}return void 0!==a?(0,l.HD)(a)?a:(0,Ke.WU)(a,n):e}))}var Ir="isPrime",Dr=["typed"],Pr=(0,i.d5)(Ir,Dr,(e=>{var{typed:t}=e;return t(Ir,{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;for(var t=5;e.gte(t*t);t+=6)if(e.mod(t).eq(0)||e.mod(t+2).eq(0))return!1;return!0},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),jr="acos",Rr=["typed","config","Complex"],Lr=(0,i.d5)(jr,Rr,(e=>{var{typed:t,config:n,Complex:r}=e;return t(jr,{number:function(e){return e>=-1&&e<=1||n.predictable?Math.acos(e):new r(e,0).acos()},Complex:function(e){return e.acos()},BigNumber:function(e){return e.acos()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Br="number";function Ur(e){return(0,u.__)(e)}function qr(e){return Math.atan(1/e)}function zr(e){return isFinite(e)?(Math.log((e+1)/e)+Math.log(e/(e-1)))/2:0}function Fr(e){return Math.asin(1/e)}function Hr(e){var t=1/e;return Math.log(t+Math.sqrt(t*t+1))}function Zr(e){return Math.acos(1/e)}function Wr(e){var t=1/e,n=Math.sqrt(t*t-1);return Math.log(n+t)}function Gr(e){return(0,u.Vf)(e)}function Jr(e){return(0,u.C8)(e)}function $r(e){return 1/Math.tan(e)}function Vr(e){var t=Math.exp(2*e);return(t+1)/(t-1)}function Kr(e){return 1/Math.sin(e)}function Yr(e){return 0===e?Number.POSITIVE_INFINITY:Math.abs(2/(Math.exp(e)-Math.exp(-e)))*(0,u.Xx)(e)}function Xr(e){return 1/Math.cos(e)}function Qr(e){return 2/(Math.exp(e)+Math.exp(-e))}function ei(e){return(0,u.R_)(e)}Ur.signature=Br,qr.signature=Br,zr.signature=Br,Fr.signature=Br,Hr.signature=Br,Zr.signature=Br,Wr.signature=Br,Gr.signature=Br,Jr.signature=Br,$r.signature=Br,Vr.signature=Br,Kr.signature=Br,Yr.signature=Br,Xr.signature=Br,Qr.signature=Br,ei.signature=Br;var ti="acot",ni=["typed","BigNumber"],ri=(0,i.d5)(ti,ni,(e=>{var{typed:t,BigNumber:n}=e;return t(ti,{number:qr,Complex:function(e){return e.acot()},BigNumber:function(e){return new n(1).div(e).atan()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ii="acsc",ai=["typed","config","Complex","BigNumber"],oi=(0,i.d5)(ii,ai,(e=>{var{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(ii,{number:function(e){return e<=-1||e>=1||n.predictable?Fr(e):new r(e,0).acsc()},Complex:function(e){return e.acsc()},BigNumber:function(e){return new i(1).div(e).asin()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),si="asec",ui=["typed","config","Complex","BigNumber"],li=(0,i.d5)(si,ui,(e=>{var{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(si,{number:function(e){return e<=-1||e>=1||n.predictable?Zr(e):new r(e,0).asec()},Complex:function(e){return e.asec()},BigNumber:function(e){return new i(1).div(e).acos()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ci="asin",fi=["typed","config","Complex"],di=(0,i.d5)(ci,fi,(e=>{var{typed:t,config:n,Complex:r}=e;return t(ci,{number:function(e){return e>=-1&&e<=1||n.predictable?Math.asin(e):new r(e,0).asin()},Complex:function(e){return e.asin()},BigNumber:function(e){return e.asin()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)}})})),pi=["typed"],hi=(0,i.d5)("atan",pi,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this,!0)}})})),mi="atanh",vi=["typed","config","Complex"],yi=(0,i.d5)(mi,vi,(e=>{var{typed:t,config:n,Complex:r}=e;return t(mi,{number:function(e){return e<=1&&e>=-1||n.predictable?Jr(e):new r(e,0).atanh()},Complex:function(e){return e.atanh()},BigNumber:function(e){return e.atanh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)}})})),gi="cosh",_i=["typed"],bi=(0,i.d5)(gi,_i,(e=>{var{typed:t}=e;return t(gi,{number:u.f9,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(0,ut.Fh)(e,this)}})})),xi="coth",wi=["typed","BigNumber"],Ei=(0,i.d5)(xi,wi,(e=>{var{typed:t,BigNumber:n}=e;return t(xi,{number:Vr,Complex:function(e){return e.coth()},BigNumber:function(e){return new n(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(0,ut.Fh)(e,this)}})})),Ni="csch",Si=["typed","BigNumber"],Mi=(0,i.d5)(Ni,Si,(e=>{var{typed:t,BigNumber:n}=e;return t(Ni,{number:Yr,Complex:function(e){return e.csch()},BigNumber:function(e){return new n(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(0,ut.Fh)(e,this)}})})),ki="sech",Oi=["typed","BigNumber"],Ci=(0,i.d5)(ki,Oi,(e=>{var{typed:t,BigNumber:n}=e;return t(ki,{number:Qr,Complex:function(e){return e.sech()},BigNumber:function(e){return new n(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(0,ut.Fh)(e,this)}})})),Ai="sinh",Ti=["typed"],Ii=(0,i.d5)(Ai,Ti,(e=>{var{typed:t}=e;return t(Ai,{number:ei,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(0,ut.Fh)(e,this,!0)}})})),Di=["typed"],Pi=(0,i.d5)("tanh",Di,(e=>{var{typed:t}=e;return t("tanh",{number:u.AE,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(0,ut.Fh)(e,this,!0)}})}));function ji(e,t){if(t<e)return 1;if(t===e)return t;var n=t+e>>1;return ji(e,n)*ji(n+1,t)}function Ri(e,t){if(!(0,u.U)(e)||e<0)throw new TypeError("Positive integer value expected in function combinations");if(!(0,u.U)(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");var n=e-t;return t<n?ji(n+1,e)/ji(1,t):ji(t+1,e)/ji(1,n)}Ri.signature="number, number";var Li="combinations",Bi=["typed"],Ui=(0,i.d5)(Li,Bi,(e=>{var{typed:t}=e;return t(Li,{"number, number":Ri,"BigNumber, BigNumber":function(e,t){var n,r,i=e.constructor,a=e.minus(t),o=new i(1);if(!qi(e)||!qi(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(n=o,t.lt(a))for(r=o;r.lte(a);r=r.plus(o))n=n.times(t.plus(r)).dividedBy(r);else for(r=o;r.lte(t);r=r.plus(o))n=n.times(a.plus(r)).dividedBy(r);return n}})}));function qi(e){return e.isInteger()&&e.gte(0)}var zi=n(6377),Fi=zi(Date.now());function Hi(e){var t,n;return t=null===(n=e)?Fi:zi(String(n)),function(){return t()}}var Zi=["typed","config","?on"],Wi=(0,i.d5)("pickRandom",Zi,(e=>{var{typed:t,config:n,on:r}=e,i=Hi(n.randomSeed);return r&&r("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Hi(e.randomSeed))})),t({"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,n){return a(e,{number:n,weights:t})},"Array | Matrix, number, Array | Matrix":function(e,t,n){return a(e,{number:t,weights:n})}});function a(e,t){var{number:n,weights:r,elementWise:a=!0}=t,o=void 0===n;o&&(n=1);var s=(0,l.SW)(e)?e.create:(0,l.SW)(r)?r.create:null;e=e.valueOf(),r&&(r=r.valueOf()),!0===a&&(e=(0,Ve.xH)(e),r=(0,Ve.xH)(r));var u=0;if(void 0!==r){if(r.length!==e.length)throw new Error("Weights must have the same length as possibles");for(var c=0,f=r.length;c<f;c++){if(!(0,l.hj)(r[c])||r[c]<0)throw new Error("Weights must be an array of positive numbers");u+=r[c]}}for(var d,p=e.length,h=[];h.length<n;){if(void 0===r)d=e[Math.floor(i()*p)];else for(var m=i()*u,v=0,y=e.length;v<y;v++)if((m-=r[v])<0){d=e[v];break}h.push(d)}return o?h[0]:s?s(h):h}}));function Gi(e,t){var n=[];if((e=e.slice(0)).length>1)for(var r=0,i=e.shift();r<i;r++)n.push(Gi(e,t));else for(var a=0,o=e.shift();a<o;a++)n.push(t());return n}var Ji="randomInt",$i=["typed","config","?on"],Vi=(0,i.d5)(Ji,$i,(e=>{var{typed:t,config:n,on:r}=e,i=Hi(n.randomSeed);return r&&r("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Hi(e.randomSeed))})),t(Ji,{"":()=>o(0,1),number:e=>o(0,e),"number, number":(e,t)=>o(e,t),"Array | Matrix":e=>a(e,0,1),"Array | Matrix, number":(e,t)=>a(e,0,t),"Array | Matrix, number, number":(e,t,n)=>a(e,t,n)});function a(e,t,n){var r=Gi(e.valueOf(),(()=>o(t,n)));return(0,l.SW)(e)?e.create(r):r}function o(e,t){return Math.floor(e+i()*(t-e))}})),Ki="clone",Yi=["typed"],Xi=(0,i.d5)(Ki,Yi,(e=>{var{typed:t}=e;return t(Ki,{any:Ye.d9})})),Qi="hasNumericValue",ea=["typed","isNumeric"],ta=(0,i.d5)(Qi,ea,(e=>{var{typed:t,isNumeric:n}=e;return t(Qi,{string:function(e){return e.trim().length>0&&!isNaN(Number(e))},any:function(e){return n(e)}})})),na="typeOf",ra=["typed"],ia=(0,i.d5)(na,ra,(e=>{var{typed:t}=e;return t(na,{any:l.kM})})),aa="string",oa=["typed"],sa=(0,i.d5)(aa,oa,(e=>{var{typed:t}=e;return t(aa,{"":function(){return""},number:u.WU,null:function(e){return"null"},boolean:function(e){return e+""},string:function(e){return e},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)},any:function(e){return String(e)}})})),ua=["typed","Fraction"],la=(0,i.d5)("fraction",ua,(e=>{var{typed:t,Fraction:n}=e;return t("fraction",{number:function(e){if(!isFinite(e)||isNaN(e))throw new Error(e+" cannot be represented as a fraction");return new n(e)},string:function(e){return new n(e)},"number, number":function(e,t){return new n(e,t)},null:function(e){return new n(0)},BigNumber:function(e){return new n(e.toString())},Fraction:function(e){return e},Object:function(e){return new n(e)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ca="unaryMinus",fa=["typed"],da=(0,i.d5)(ca,fa,(e=>{var{typed:t}=e;return t(ca,{number:Wt,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(0,ut.Fh)(e,this,!0)}})})),pa="addScalar",ha=["typed"],ma=(0,i.d5)(pa,ha,(e=>{var{typed:t}=e;return t(pa,{"number, number":Ht,"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 n=e.clone();return n.value=this(n.value,t.value),n.fixPrefix=!1,n}})})),va=["typed"],ya=(0,i.d5)("exp",va,(e=>{var{typed:t}=e;return t("exp",{number:Kt,Complex:function(e){return e.exp()},BigNumber:function(e){return e.exp()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ga="log2",_a=["typed","config","Complex"],ba=(0,i.d5)(ga,_a,(e=>{var{typed:t,config:n,Complex:r}=e;return t(ga,{number:function(e){return e>=0||n.predictable?nn(e):i(new r(e,0))},Complex:i,BigNumber:function(e){return!e.isNegative()||n.predictable?e.log(2):i(new r(e.toNumber(),0))},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}});function i(e){var t=Math.sqrt(e.re*e.re+e.im*e.im);return new r(Math.log2?Math.log2(t):Math.log(t)/Math.LN2,Math.atan2(e.im,e.re)/Math.LN2)}})),xa=["config","typed","Complex"],wa=(0,i.d5)("sqrt",xa,(e=>{var{config:t,typed:n,Complex:r}=e;return n("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(0,ut.Fh)(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 r(e,0).sqrt()}})),Ea="conj",Na=["typed"],Sa=(0,i.d5)(Ea,Na,(e=>{var{typed:t}=e;return t(Ea,{number:function(e){return e},BigNumber:function(e){return e},Complex:function(e){return e.conjugate()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Ma="getMatrixDataType",ka=["typed"],Oa=(0,i.d5)(Ma,ka,(e=>{var{typed:t}=e;return t(Ma,{Array:function(e){return(0,Ve.$q)(e,l.kM)},Matrix:function(e){return e.getDataType()}})})),Ca="mode",Aa=["typed","isNaN","isNumeric"],Ta=(0,i.d5)(Ca,Aa,(e=>{var{typed:t,isNaN:n,isNumeric:r}=e;return t(Ca,{"Array | Matrix":i,"...":function(e){return i(e)}});function i(e){if(0===(e=(0,Ve.xH)(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(r(s)&&n(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}})),Ia=(0,i.d5)("bin",["typed","format"],(e=>{var{typed:t,format:n}=e;return t("bin",{"number | BigNumber":function(e){return n(e,{notation:"bin"})},"number | BigNumber, number":function(e,t){return n(e,{notation:"bin",wordSize:t})}})})),Da="acosh",Pa=["typed","config","Complex"],ja=(0,i.d5)(Da,Pa,(e=>{var{typed:t,config:n,Complex:r}=e;return t(Da,{number:function(e){return e>=1||n.predictable?Ur(e):e<=-1?new r(Math.log(Math.sqrt(e*e-1)-e),Math.PI):new r(e,0).acosh()},Complex:function(e){return e.acosh()},BigNumber:function(e){return e.acosh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Ra="acsch",La=["typed","BigNumber"],Ba=(0,i.d5)(Ra,La,(e=>{var{typed:t,BigNumber:n}=e;return t(Ra,{number:Hr,Complex:function(e){return e.acsch()},BigNumber:function(e){return new n(1).div(e).asinh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Ua=["typed"],qa=(0,i.d5)("asinh",Ua,(e=>{var{typed:t}=e;return t("asinh",{number:Gr,Complex:function(e){return e.asinh()},BigNumber:function(e){return e.asinh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)}})})),za=["typed"],Fa=(0,i.d5)("cos",za,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this)}})})),Ha=["typed","BigNumber"],Za=(0,i.d5)("csc",Ha,(e=>{var{typed:t,BigNumber:n}=e;return t("csc",{number:Kr,Complex:function(e){return e.csc()},BigNumber:function(e){return new n(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(0,ut.Fh)(e,this)}})})),Wa=["typed"],Ga=(0,i.d5)("sin",Wa,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this,!0)}})})),Ja="combinationsWithRep",$a=["typed"],Va=(0,i.d5)(Ja,$a,(e=>{var{typed:t}=e;return t(Ja,{"number, number":function(e,t){if(!(0,u.U)(e)||e<0)throw new TypeError("Positive integer value expected in function combinationsWithRep");if(!(0,u.U)(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?ji(e,e+t-1)/ji(1,t):ji(t+1,e+t-1)/ji(1,e-1)},"BigNumber, BigNumber":function(e,t){var n,r,i=new(0,e.constructor)(1),a=e.minus(i);if(!Ka(e)||!Ka(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(n=i,t.lt(a))for(r=i;r.lte(a);r=r.plus(i))n=n.times(t.plus(r)).dividedBy(r);else for(r=i;r.lte(t);r=r.plus(i))n=n.times(a.plus(r)).dividedBy(r);return n}})}));function Ka(e){return e.isInteger()&&e.gte(0)}var Ya="random",Xa=["typed","config","?on"],Qa=(0,i.d5)(Ya,Xa,(e=>{var{typed:t,config:n,on:r}=e,i=Hi(n.randomSeed);return r&&r("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Hi(e.randomSeed))})),t(Ya,{"":()=>o(0,1),number:e=>o(0,e),"number, number":(e,t)=>o(e,t),"Array | Matrix":e=>a(e,0,1),"Array | Matrix, number":(e,t)=>a(e,0,t),"Array | Matrix, number, number":(e,t,n)=>a(e,t,n)});function a(e,t,n){var r=Gi(e.valueOf(),(()=>o(t,n)));return(0,l.SW)(e)?e.create(r):r}function o(e,t){return e+i()*(t-e)}})),eo="isNegative",to=["typed"],no=(0,i.d5)(eo,to,(e=>{var{typed:t}=e;return t(eo,{number:vt,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(0,ut.Fh)(e,this)}})})),ro=["typed","equalScalar","Matrix"],io=(0,i.d5)("SparseMatrix",ro,(e=>{var{typed:t,equalScalar:n,Matrix:r}=e;function i(e,t){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!(0,l.HD)(t))throw new Error("Invalid datatype: "+t);if((0,l.SW)(e))!function(e,t,n){"SparseMatrix"===t.type?(e._values=t._values?(0,Ye.d9)(t._values):void 0,e._index=(0,Ye.d9)(t._index),e._ptr=(0,Ye.d9)(t._ptr),e._size=(0,Ye.d9)(t._size),e._datatype=n||t._datatype):a(e,t.valueOf(),n||t._datatype)}(this,e,t);else if(e&&(0,l.kJ)(e.index)&&(0,l.kJ)(e.ptr)&&(0,l.kJ)(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((0,l.kJ)(e))a(this,e,t);else{if(e)throw new TypeError("Unsupported type of data ("+(0,l.kM)(e)+")");this._values=[],this._index=[],this._ptr=[0],this._size=[0,0],this._datatype=t}}function a(e,r,i){e._values=[],e._index=[],e._ptr=[],e._datatype=i;var a=r.length,o=0,s=n,u=0;if((0,l.HD)(i)&&(s=t.find(n,[i,i])||n,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 d=r[f];if((0,l.kJ)(d)){if(0===c&&o<d.length&&(o=d.length),c<d.length){var p=d[c];s(p,u)||(e._values.push(p),e._index.push(f))}}else 0===c&&o<1&&(o=1),s(d,u)||(e._values.push(d),e._index.push(f))}c++}while(c<o)}e._ptr.push(e._index.length),e._size=[a,o]}function o(e,t){if(!(0,l.dh)(t))throw new TypeError("Invalid index");if(t.isScalar())return e.get(t.min());var n,r,a,o,s=t.size();if(s.length!==e._size.length)throw new Xe.m(s.length,e._size.length);var u=t.min(),c=t.max();for(n=0,r=e._size.length;n<r;n++)(0,Ve.Ls)(u[n],e._size[n]),(0,Ve.Ls)(c[n],e._size[n]);var f=e._values,d=e._index,p=e._ptr,h=t.dimension(0),m=t.dimension(1),v=[],y=[];h.forEach((function(e,t){y[e]=t[0],v[e]=!0}));var g=f?[]:void 0,_=[],b=[];return m.forEach((function(e){for(b.push(_.length),a=p[e],o=p[e+1];a<o;a++)n=d[a],!0===v[n]&&(_.push(y[n]),g&&g.push(f[a]))})),b.push(_.length),new i({values:g,index:_,ptr:b,size:s,datatype:e._datatype})}function s(e,t,n,r){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");var i,a=t.size(),o=t.isScalar();if((0,l.SW)(n)?(i=n.size(),n=n.toArray()):i=(0,Ve.aJ)(n),o){if(0!==i.length)throw new TypeError("Scalar expected");e.set(t.min(),n,r)}else{if(1!==a.length&&2!==a.length)throw new Xe.m(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++;n=(0,Ve.f4)(n,a.length,u,i)}if(!(0,Ye.J5)(a,i))throw new Xe.m(a,i,">");for(var c=t.min()[0],f=t.min()[1],d=i[0],p=i[1],h=0;h<d;h++)for(var m=0;m<p;m++){var v=n[h][m];e.set([h+c,m+f],v,r)}}return e}function c(e,t,n,r){if(n-t==0)return n;for(var i=t;i<n;i++)if(r[i]===e)return i;return t}function f(e,t,n,r,i,a,o){i.splice(e,0,r),a.splice(e,0,t);for(var s=n+1;s<o.length;s++)o[s]++}function d(e,r,i,a){var o=a||0,s=n,u=0;(0,l.HD)(e._datatype)&&(s=t.find(n,[e._datatype,e._datatype])||n,u=t.convert(0,e._datatype),o=t.convert(o,e._datatype));var c,f,d,p=!s(o,u),h=e._size[0],m=e._size[1];if(i>m){for(f=m;f<i;f++)if(e._ptr[f]=e._values.length,p)for(c=0;c<h;c++)e._values.push(o),e._index.push(c);e._ptr[i]=e._values.length}else i<m&&(e._ptr.splice(i+1,m-i),e._values.splice(e._ptr[i],e._values.length),e._index.splice(e._ptr[i],e._index.length));if(m=i,r>h){if(p){var v=0;for(f=0;f<m;f++){e._ptr[f]=e._ptr[f]+v,d=e._ptr[f+1]+v;var y=0;for(c=h;c<r;c++,y++)e._values.splice(d+y,0,o),e._index.splice(d+y,0,c),v++}e._ptr[m]=e._values.length}}else if(r<h){var g=0;for(f=0;f<m;f++){e._ptr[f]=e._ptr[f]-g;var _=e._ptr[f],b=e._ptr[f+1]-g;for(d=_;d<b;d++)(c=e._index[d])>r-1&&(e._values.splice(d,1),e._index.splice(d,1),g++)}e._ptr[f]=e._values.length}return e._size[0]=r,e._size[1]=i,e}function p(e,t,n,r,i){var a,o,s=r[0],u=r[1],l=[];for(a=0;a<s;a++)for(l[a]=[],o=0;o<u;o++)l[a][o]=0;for(o=0;o<u;o++)for(var c=n[o],f=n[o+1],d=c;d<f;d++)l[a=t[d]][o]=e?i?(0,Ye.d9)(e[d]):e[d]:1;return l}return i.prototype=new r,i.prototype.createSparseMatrix=function(e,t){return new i(e,t)},i.prototype.type="SparseMatrix",i.prototype.isSparseMatrix=!0,i.prototype.getDataType=function(){return(0,Ve.$q)(this._values,l.kM)},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,n){if(!this._values)throw new Error("Cannot invoke subset on a Pattern only matrix");switch(arguments.length){case 1:return o(this,e);case 2:case 3:return s(this,e,t,n);default:throw new SyntaxError("Wrong number of arguments")}},i.prototype.get=function(e){if(!(0,l.kJ)(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Xe.m(e.length,this._size.length);if(!this._values)throw new Error("Cannot invoke get on a Pattern only matrix");var t=e[0],n=e[1];(0,Ve.Ls)(t,this._size[0]),(0,Ve.Ls)(n,this._size[1]);var r=c(t,this._ptr[n],this._ptr[n+1],this._index);return r<this._ptr[n+1]&&this._index[r]===t?this._values[r]:0},i.prototype.set=function(e,r,i){if(!(0,l.kJ)(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Xe.m(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],p=n,h=0;(0,l.HD)(this._datatype)&&(p=t.find(n,[this._datatype,this._datatype])||n,h=t.convert(0,this._datatype)),(a>s-1||o>u-1)&&(d(this,Math.max(a+1,s),Math.max(o+1,u),i),s=this._size[0],u=this._size[1]),(0,Ve.Ls)(a,s),(0,Ve.Ls)(o,u);var m=c(a,this._ptr[o],this._ptr[o+1],this._index);return m<this._ptr[o+1]&&this._index[m]===a?p(r,h)?function(e,t,n,r,i){n.splice(e,1),r.splice(e,1);for(var a=t+1;a<i.length;a++)i[a]--}(m,o,this._values,this._index,this._ptr):this._values[m]=r:f(m,a,o,r,this._values,this._index,this._ptr),this},i.prototype.resize=function(e,t,n){if(!(0,l.uZ)(e))throw new TypeError("Array or Matrix expected");var r=e.valueOf().map((e=>Array.isArray(e)&&1===e.length?e[0]:e));if(2!==r.length)throw new Error("Only two dimensions matrix are supported");return r.forEach((function(e){if(!(0,l.hj)(e)||!(0,u.U)(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+(0,Ke.WU)(r)+")")})),d(n?this.clone():this,r[0],r[1],t)},i.prototype.reshape=function(e,t){if(!(0,l.kJ)(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(!(0,l.hj)(t)||!(0,u.U)(t)||t<=-2||0===t)throw new TypeError("Invalid size, must contain positive integers or -1 (size: "+(0,Ke.WU)(e)+")")}));var n=this._size[0]*this._size[1];if(n!==(e=(0,Ve.eu)(e,n))[0]*e[1])throw new Error("Reshaping sparse matrix will result in the wrong number of elements");var r=t?this.clone():this;if(this._size[0]===e[0]&&this._size[1]===e[1])return r;for(var i=[],a=0;a<r._ptr.length;a++)for(var o=0;o<r._ptr[a+1]-r._ptr[a];o++)i.push(a);for(var s=r._values.slice(),d=r._index.slice(),p=0;p<r._index.length;p++){var h=d[p],m=i[p],v=h*r._size[1]+m;i[p]=v%e[1],d[p]=Math.floor(v/e[1])}r._values.length=0,r._index.length=0,r._ptr.length=e[1]+1,r._size=e.slice();for(var y=0;y<r._ptr.length;y++)r._ptr[y]=0;for(var g=0;g<s.length;g++){var _=d[g],b=i[g],x=s[g];f(c(_,r._ptr[b],r._ptr[b+1],r._index),_,b,x,r._values,r._index,r._ptr)}return r},i.prototype.clone=function(){return new i({values:this._values?(0,Ye.d9)(this._values):void 0,index:(0,Ye.d9)(this._index),ptr:(0,Ye.d9)(this._ptr),size:(0,Ye.d9)(this._size),datatype:this._datatype})},i.prototype.size=function(){return this._size.slice(0)},i.prototype.map=function(e,r){if(!this._values)throw new Error("Cannot invoke map on a Pattern only matrix");var a=this;return function(e,r,a,o,s,u,c){var f=[],d=[],p=[],h=n,m=0;(0,l.HD)(e._datatype)&&(h=t.find(n,[e._datatype,e._datatype])||n,m=t.convert(0,e._datatype));for(var v=function(e,t,n){e=u(e,t,n),h(e,m)||(f.push(e),d.push(t))},y=0;y<=s;y++){p.push(f.length);var g=e._ptr[y],_=e._ptr[y+1];if(c)for(var b=g;b<_;b++){var x=e._index[b];x>=0&&x<=a&&v(e._values[b],x-0,y-0)}else{for(var w={},E=g;E<_;E++)w[e._index[E]]=e._values[E];for(var N=0;N<=a;N++)v(N in w?w[N]:0,N-0,y-0)}}return p.push(f.length),new i({values:f,index:d,ptr:p,size:[a-0+1,s-0+1]})}(this,0,this._size[0]-1,0,this._size[1]-1,(function(t,n,r){return e(t,[n,r],a)}),r)},i.prototype.forEach=function(e,t){if(!this._values)throw new Error("Cannot invoke forEach on a Pattern only matrix");for(var n=this._size[0],r=this._size[1],i=0;i<r;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 l={},c=a;c<o;c++)l[this._index[c]]=this._values[c];for(var f=0;f<n;f++)e(f in l?l[f]:0,[f,i],this)}}},i.prototype.toArray=function(){return p(this._values,this._index,this._ptr,this._size,!0)},i.prototype.valueOf=function(){return p(this._values,this._index,this._ptr,this._size,!1)},i.prototype.format=function(e){for(var t=this._size[0],n=this._size[1],r=this.density(),i="Sparse Matrix ["+(0,Ke.WU)(t,e)+" x "+(0,Ke.WU)(n,e)+"] density: "+(0,Ke.WU)(r,e)+"\n",a=0;a<n;a++)for(var o=this._ptr[a],s=this._ptr[a+1],u=o;u<s;u++){var l=this._index[u];i+="\n    ("+(0,Ke.WU)(l,e)+", "+(0,Ke.WU)(a,e)+") ==> "+(this._values?(0,Ke.WU)(this._values[u],e):"X")}return i},i.prototype.toString=function(){return(0,Ke.WU)(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((0,l.l9)(e)&&(e=e.toNumber()),!(0,l.hj)(e)||!(0,u.U)(e))throw new TypeError("The parameter k must be an integer number")}else e=0;var t=e>0?e:0,n=e<0?-e:0,r=this._size[0],a=this._size[1],o=Math.min(r-n,a-t),s=[],c=[],f=[];f[0]=0;for(var d=t;d<a&&s.length<o;d++)for(var p=this._ptr[d],h=this._ptr[d+1],m=p;m<h;m++){var v=this._index[m];if(v===d-t+n){s.push(this._values[m]),c[s.length-1]=v-n;break}}return f.push(s.length),new i({values:s,index:c,ptr:f,size:[o,1]})},i.fromJSON=function(e){return new i(e)},i.diagonal=function(e,r,a,o,s){if(!(0,l.kJ)(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((0,l.l9)(e)&&(e=e.toNumber()),!(0,l.hj)(e)||!(0,u.U)(e)||e<1)throw new Error("Size values must be positive integers");return e})),a){if((0,l.l9)(a)&&(a=a.toNumber()),!(0,l.hj)(a)||!(0,u.U)(a))throw new TypeError("The parameter k must be an integer number")}else a=0;var c=n,f=0;(0,l.HD)(s)&&(c=t.find(n,[s,s])||n,f=t.convert(0,s));var d,p=a>0?a:0,h=a<0?-a:0,m=e[0],v=e[1],y=Math.min(m-h,v-p);if((0,l.kJ)(r)){if(r.length!==y)throw new Error("Invalid value array length");d=function(e){return r[e]}}else if((0,l.SW)(r)){var g=r.size();if(1!==g.length||g[0]!==y)throw new Error("Invalid matrix length");d=function(e){return r.get([e])}}else d=function(){return r};for(var _=[],b=[],x=[],w=0;w<v;w++){x.push(_.length);var E=w-p;if(E>=0&&E<y){var N=d(E);c(N,f)||(b.push(E+h),_.push(N))}}return x.push(_.length),new i({values:_,index:b,ptr:x,size:[m,v]})},i.prototype.swapRows=function(e,t){if(!((0,l.hj)(e)&&(0,u.U)(e)&&(0,l.hj)(t)&&(0,u.U)(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(0,Ve.Ls)(e,this._size[0]),(0,Ve.Ls)(t,this._size[0]),i._swapRows(e,t,this._size[1],this._values,this._index,this._ptr),this},i._forEachRow=function(e,t,n,r,i){for(var a=r[e],o=r[e+1],s=a;s<o;s++)i(n[s],t[s])},i._swapRows=function(e,t,n,r,i,a){for(var o=0;o<n;o++){var s=a[o],u=a[o+1],l=c(e,s,u,i),f=c(t,s,u,i);if(l<u&&f<u&&i[l]===e&&i[f]===t){if(r){var d=r[l];r[l]=r[f],r[f]=d}}else if(l<u&&i[l]===e&&(f>=u||i[f]!==t)){var p=r?r[l]:void 0;i.splice(f,0,t),r&&r.splice(f,0,p),i.splice(f<=l?l+1:l,1),r&&r.splice(f<=l?l+1:l,1)}else if(f<u&&i[f]===t&&(l>=u||i[l]!==e)){var h=r?r[f]:void 0;i.splice(l,0,e),r&&r.splice(l,0,h),i.splice(l<=f?f+1:f,1),r&&r.splice(l<=f?f+1:f,1)}}},i}),{isClass:!0}),ao="matrix",oo=["typed","Matrix","DenseMatrix","SparseMatrix"],so=(0,i.d5)(ao,oo,(e=>{var{typed:t,Matrix:n,DenseMatrix:r,SparseMatrix:i}=e;return t(ao,{"":function(){return a([])},string:function(e){return a([],e)},"string, string":function(e,t){return a([],e,t)},Array:function(e){return a(e)},Matrix:function(e){return a(e,e.storage())},"Array | Matrix, string":a,"Array | Matrix, string, string":a});function a(e,t,n){if("dense"===t||"default"===t||void 0===t)return new r(e,n);if("sparse"===t)return new i(e,n);throw new TypeError("Unknown matrix type "+JSON.stringify(t)+".")}})),uo="cbrt",lo=["config","typed","isNegative","unaryMinus","matrix","Complex","BigNumber","Fraction"],co=(0,i.d5)(uo,lo,(e=>{var{config:t,typed:n,isNegative:r,unaryMinus:i,matrix:a,Complex:o,BigNumber:s,Fraction:u}=e;return n(uo,{number:Jt,Complex:c,"Complex, boolean":c,BigNumber:function(e){return e.cbrt()},Unit:function(e){if(e.value&&(0,l.Mc)(e.value)){var t=e.clone();return t.value=1,(t=t.pow(1/3)).value=c(e.value),t}var n,a=r(e.value);a&&(e.value=i(e.value)),n=(0,l.l9)(e.value)?new s(1).div(3):(0,l.yQ)(e.value)?new u(1,3):1/3;var o=e.pow(n);return a&&(o.value=i(o.value)),o},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)}});function c(e,n){var r=e.arg()/3,i=e.abs(),s=new o(Jt(i),0).mul(new o(0,r).exp());if(n){var u=[s,new o(Jt(i),0).mul(new o(0,r+2*Math.PI/3).exp()),new o(Jt(i),0).mul(new o(0,r-2*Math.PI/3).exp())];return"Array"===t.matrix?u:a(u)}return s}})),fo=["typed"],po=(0,i.d5)("algorithm01",fo,(e=>{var{typed:t}=e;return function(e,n,r,i){var a=e._data,o=e._size,s=e._datatype,u=n._values,l=n._index,c=n._ptr,f=n._size,d=n._datatype;if(o.length!==f.length)throw new Xe.m(o.length,f.length);if(o[0]!==f[0]||o[1]!==f[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+f+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var p,h,m=o[0],v=o[1],y="string"==typeof s&&s===d?s:void 0,g=y?t.find(r,[y,y]):r,_=[];for(p=0;p<m;p++)_[p]=[];var b=[],x=[];for(h=0;h<v;h++){for(var w=h+1,E=c[h],N=c[h+1],S=E;S<N;S++)b[p=l[S]]=i?g(u[S],a[p][h]):g(a[p][h],u[S]),x[p]=w;for(p=0;p<m;p++)x[p]===w?_[p][h]=b[p]:_[p][h]=a[p][h]}return e.createDenseMatrix({data:_,size:[m,v],datatype:y})}})),ho=["typed","equalScalar"],mo=(0,i.d5)("algorithm04",ho,(e=>{var{typed:t,equalScalar:n}=e;return function(e,r,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,l=e._datatype,c=r._values,f=r._index,d=r._ptr,p=r._size,h=r._datatype;if(u.length!==p.length)throw new Xe.m(u.length,p.length);if(u[0]!==p[0]||u[1]!==p[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+p+")");var m,v=u[0],y=u[1],g=n,_=0,b=i;"string"==typeof l&&l===h&&(m=l,g=t.find(n,[m,m]),_=t.convert(0,m),b=t.find(i,[m,m]));var x,w,E,N,S,M=a&&c?[]:void 0,k=[],O=[],C=a&&c?[]:void 0,A=a&&c?[]:void 0,T=[],I=[];for(w=0;w<y;w++){O[w]=k.length;var D=w+1;for(N=s[w],S=s[w+1],E=N;E<S;E++)x=o[E],k.push(x),T[x]=D,C&&(C[x]=a[E]);for(N=d[w],S=d[w+1],E=N;E<S;E++)if(T[x=f[E]]===D){if(C){var P=b(C[x],c[E]);g(P,_)?T[x]=null:C[x]=P}}else k.push(x),I[x]=D,A&&(A[x]=c[E]);if(C&&A)for(E=O[w];E<k.length;)T[x=k[E]]===D?(M[E]=C[x],E++):I[x]===D?(M[E]=A[x],E++):k.splice(E,1)}return O[y]=k.length,e.createSparseMatrix({values:M,index:k,ptr:O,size:[v,y],datatype:m})}})),vo=["typed","DenseMatrix"],yo=(0,i.d5)("algorithm10",vo,(e=>{var{typed:t,DenseMatrix:n}=e;return function(e,r,i,a){var o=e._values,s=e._index,u=e._ptr,l=e._size,c=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var f,d=l[0],p=l[1],h=i;"string"==typeof c&&(f=c,r=t.convert(r,f),h=t.find(i,[f,f]));for(var m=[],v=[],y=[],g=0;g<p;g++){for(var _=g+1,b=u[g],x=u[g+1],w=b;w<x;w++){var E=s[w];v[E]=o[w],y[E]=_}for(var N=0;N<d;N++)0===g&&(m[N]=[]),y[N]===_?m[N][g]=a?h(r,v[N]):h(v[N],r):m[N][g]=r}return new n({data:m,size:[d,p],datatype:f})}})),go=["typed"],_o=(0,i.d5)("algorithm13",go,(e=>{var{typed:t}=e;return function(e,r,i){var a,o=e._data,s=e._size,u=e._datatype,l=r._data,c=r._size,f=r._datatype,d=[];if(s.length!==c.length)throw new Xe.m(s.length,c.length);for(var p=0;p<s.length;p++){if(s[p]!==c[p])throw new RangeError("Dimension mismatch. Matrix A ("+s+") must match Matrix B ("+c+")");d[p]=s[p]}var h=i;"string"==typeof u&&u===f&&(a=u,h=t.find(i,[a,a]));var m=d.length>0?n(h,0,d,d[0],o,l):[];return e.createDenseMatrix({data:m,size:d,datatype:a})};function n(e,t,r,i,a,o){var s=[];if(t===r.length-1)for(var u=0;u<i;u++)s[u]=e(a[u],o[u]);else for(var l=0;l<i;l++)s[l]=n(e,t+1,r,r[t+1],a[l],o[l]);return s}})),bo=["typed"],xo=(0,i.d5)("algorithm14",bo,(e=>{var{typed:t}=e;return function(e,r,i,a){var o,s=e._data,u=e._size,l=e._datatype,c=i;"string"==typeof l&&(o=l,r=t.convert(r,o),c=t.find(i,[o,o]));var f=u.length>0?n(c,0,u,u[0],s,r,a):[];return e.createDenseMatrix({data:f,size:(0,Ye.d9)(u),datatype:o})};function n(e,t,r,i,a,o,s){var u=[];if(t===r.length-1)for(var l=0;l<i;l++)u[l]=s?e(o,a[l]):e(a[l],o);else for(var c=0;c<i;c++)u[c]=n(e,t+1,r,r[t+1],a[c],o,s);return u}})),wo=["typed","matrix","equalScalar","BigNumber","DenseMatrix"],Eo=(0,i.d5)("gcd",wo,(e=>{var{typed:t,matrix:n,equalScalar:r,BigNumber:i,DenseMatrix:a}=e,o=po({typed:t}),s=mo({typed:t,equalScalar:r}),u=yo({typed:t,DenseMatrix:a}),l=_o({typed:t}),c=xo({typed:t});return t("gcd",{"number, number":Xt,"BigNumber, BigNumber":function(e,t){if(!e.isInt()||!t.isInt())throw new Error("Parameters in function gcd must be integer numbers");for(var n=new i(0);!t.isZero();){var r=e.mod(t);e=t,t=r}return e.lt(n)?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 l(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, number | BigNumber":function(e,t){return u(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return c(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return u(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return c(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return c(n(e),t,this,!1).valueOf()},"number | BigNumber, Array":function(e,t){return c(n(t),e,this,!0).valueOf()},"Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber":function(e,t,n){for(var r=this(e,t),i=0;i<n.length;i++)r=this(r,n[i]);return r}})})),No=["typed","equalScalar"],So=(0,i.d5)("algorithm02",No,(e=>{var{typed:t,equalScalar:n}=e;return function(e,r,i,a){var o=e._data,s=e._size,u=e._datatype,l=r._values,c=r._index,f=r._ptr,d=r._size,p=r._datatype;if(s.length!==d.length)throw new Xe.m(s.length,d.length);if(s[0]!==d[0]||s[1]!==d[1])throw new RangeError("Dimension mismatch. Matrix A ("+s+") must match Matrix B ("+d+")");if(!l)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var h,m=s[0],v=s[1],y=n,g=0,_=i;"string"==typeof u&&u===p&&(h=u,y=t.find(n,[h,h]),g=t.convert(0,h),_=t.find(i,[h,h]));for(var b=[],x=[],w=[],E=0;E<v;E++){w[E]=x.length;for(var N=f[E],S=f[E+1],M=N;M<S;M++){var k=c[M],O=a?_(l[M],o[k][E]):_(o[k][E],l[M]);y(O,g)||(x.push(k),b.push(O))}}return w[v]=x.length,r.createSparseMatrix({values:b,index:x,ptr:w,size:[m,v],datatype:h})}})),Mo=["typed"],ko=(0,i.d5)("algorithm03",Mo,(e=>{var{typed:t}=e;return function(e,n,r,i){var a=e._data,o=e._size,s=e._datatype,u=n._values,l=n._index,c=n._ptr,f=n._size,d=n._datatype;if(o.length!==f.length)throw new Xe.m(o.length,f.length);if(o[0]!==f[0]||o[1]!==f[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+f+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var p,h=o[0],m=o[1],v=0,y=r;"string"==typeof s&&s===d&&(p=s,v=t.convert(0,p),y=t.find(r,[p,p]));for(var g=[],_=0;_<h;_++)g[_]=[];for(var b=[],x=[],w=0;w<m;w++){for(var E=w+1,N=c[w],S=c[w+1],M=N;M<S;M++){var k=l[M];b[k]=i?y(u[M],a[k][w]):y(a[k][w],u[M]),x[k]=E}for(var O=0;O<h;O++)x[O]===E?g[O][w]=b[O]:g[O][w]=i?y(v,a[O][w]):y(a[O][w],v)}return e.createDenseMatrix({data:g,size:[h,m],datatype:p})}})),Oo=["typed","equalScalar"],Co=(0,i.d5)("algorithm05",Oo,(e=>{var{typed:t,equalScalar:n}=e;return function(e,r,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,l=e._datatype,c=r._values,f=r._index,d=r._ptr,p=r._size,h=r._datatype;if(u.length!==p.length)throw new Xe.m(u.length,p.length);if(u[0]!==p[0]||u[1]!==p[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+p+")");var m,v=u[0],y=u[1],g=n,_=0,b=i;"string"==typeof l&&l===h&&(m=l,g=t.find(n,[m,m]),_=t.convert(0,m),b=t.find(i,[m,m]));var x,w,E,N,S=a&&c?[]:void 0,M=[],k=[],O=S?[]:void 0,C=S?[]:void 0,A=[],T=[];for(w=0;w<y;w++){k[w]=M.length;var I=w+1;for(E=s[w],N=s[w+1];E<N;E++)x=o[E],M.push(x),A[x]=I,O&&(O[x]=a[E]);for(E=d[w],N=d[w+1];E<N;E++)A[x=f[E]]!==I&&M.push(x),T[x]=I,C&&(C[x]=c[E]);if(S)for(E=k[w];E<M.length;){var D=A[x=M[E]],P=T[x];if(D===I||P===I){var j=b(D===I?O[x]:_,P===I?C[x]:_);g(j,_)?M.splice(E,1):(S.push(j),E++)}}}return k[y]=M.length,e.createSparseMatrix({values:S,index:M,ptr:k,size:[v,y],datatype:m})}})),Ao=["typed","equalScalar"],To=(0,i.d5)("algorithm11",Ao,(e=>{var{typed:t,equalScalar:n}=e;return function(e,r,i,a){var o=e._values,s=e._index,u=e._ptr,l=e._size,c=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var f,d=l[0],p=l[1],h=n,m=0,v=i;"string"==typeof c&&(f=c,h=t.find(n,[f,f]),m=t.convert(0,f),r=t.convert(r,f),v=t.find(i,[f,f]));for(var y=[],g=[],_=[],b=0;b<p;b++){_[b]=g.length;for(var x=u[b],w=u[b+1],E=x;E<w;E++){var N=s[E],S=a?v(r,o[E]):v(o[E],r);h(S,m)||(g.push(N),y.push(S))}}return _[p]=g.length,e.createSparseMatrix({values:y,index:g,ptr:_,size:[d,p],datatype:f})}})),Io=["typed","DenseMatrix"],Do=(0,i.d5)("algorithm12",Io,(e=>{var{typed:t,DenseMatrix:n}=e;return function(e,r,i,a){var o=e._values,s=e._index,u=e._ptr,l=e._size,c=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var f,d=l[0],p=l[1],h=i;"string"==typeof c&&(f=c,r=t.convert(r,f),h=t.find(i,[f,f]));for(var m=[],v=[],y=[],g=0;g<p;g++){for(var _=g+1,b=u[g],x=u[g+1],w=b;w<x;w++){var E=s[w];v[E]=o[w],y[E]=_}for(var N=0;N<d;N++)0===g&&(m[N]=[]),y[N]===_?m[N][g]=a?h(r,v[N]):h(v[N],r):m[N][g]=a?h(r,0):h(0,r)}return new n({data:m,size:[d,p],datatype:f})}})),Po=["typed","matrix","equalScalar","DenseMatrix"],jo=(0,i.d5)("mod",Po,(e=>{var{typed:t,matrix:n,equalScalar:r,DenseMatrix:i}=e,a=So({typed:t,equalScalar:r}),o=ko({typed:t}),s=Co({typed:t,equalScalar:r}),u=To({typed:t,equalScalar:r}),l=Do({typed:t,DenseMatrix:i}),c=_o({typed:t}),f=xo({typed:t});return t("mod",{"number, number":rn,"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 c(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 u(e,t,this,!1)},"DenseMatrix, any":function(e,t){return f(e,t,this,!1)},"any, SparseMatrix":function(e,t){return l(t,e,this,!0)},"any, DenseMatrix":function(e,t){return f(t,e,this,!0)},"Array, any":function(e,t){return f(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return f(n(t),e,this,!0).valueOf()}})})),Ro=["typed","equalScalar"],Lo=(0,i.d5)("algorithm06",Ro,(e=>{var{typed:t,equalScalar:n}=e;return function(e,r,i){var a=e._values,o=e._size,s=e._datatype,u=r._values,l=r._size,c=r._datatype;if(o.length!==l.length)throw new Xe.m(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+")");var f,d=o[0],p=o[1],h=n,m=0,v=i;"string"==typeof s&&s===c&&(f=s,h=t.find(n,[f,f]),m=t.convert(0,f),v=t.find(i,[f,f]));for(var y=a&&u?[]:void 0,g=[],_=[],b=y?[]:void 0,x=[],w=[],E=0;E<p;E++){_[E]=g.length;var N=E+1;if((0,ut.U6)(e,E,x,b,w,N,g,v),(0,ut.U6)(r,E,x,b,w,N,g,v),b)for(var S=_[E];S<g.length;){var M=g[S];if(w[M]===N){var k=b[M];h(k,m)?g.splice(S,1):(y.push(k),S++)}else g.splice(S,1)}else for(var O=_[E];O<g.length;)w[g[O]]!==N?g.splice(O,1):O++}return _[p]=g.length,e.createSparseMatrix({values:y,index:g,ptr:_,size:[d,p],datatype:f})}})),Bo="nthRoot",Uo=["typed","matrix","equalScalar","BigNumber"],qo=(0,i.d5)(Bo,Uo,(e=>{var{typed:t,matrix:n,equalScalar:r,BigNumber:i}=e,a=po({typed:t}),o=So({typed:t,equalScalar:r}),s=Lo({typed:t,equalScalar:r}),u=To({typed:t,equalScalar:r}),l=_o({typed:t}),c=xo({typed:t}),f="Complex number not supported in function nthRoot. Use nthRoots instead.";return t(Bo,{number:function(e){return an(e,2)},"number, number":an,BigNumber:function(e){return d(e,new i(2))},Complex:function(e){throw new Error(f)},"Complex, number":function(e,t){throw new Error(f)},"BigNumber, BigNumber":d,"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 l(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, number | BigNumber":function(e,t){return u(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return c(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 c(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(n(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,n(t)).valueOf()}});function d(e,t){var n=i.precision,r=i.clone({precision:n+2}),a=new i(0),o=new r(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 r(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(n))}})),zo="xgcd",Fo=["typed","config","matrix","BigNumber"],Ho=(0,i.d5)(zo,Fo,(e=>{var{typed:t,config:n,matrix:r,BigNumber:i}=e;return t(zo,{"number, number":function(e,t){var i=un(e,t);return"Array"===n.matrix?i:r(i)},"BigNumber, BigNumber":function(e,t){var a,o,s,u,l=new i(0),c=new i(1),f=l,d=c,p=c,h=l;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=f,f=d.minus(o.times(f)),d=a,a=p,p=h.minus(o.times(p)),h=a,e=t,t=s;return u=e.lt(l)?[e.neg(),d.neg(),h.neg()]:[e,e.isZero()?0:d,h],"Array"===n.matrix?u:r(u)}})})),Zo="bitAnd",Wo=["typed","matrix","equalScalar"],Go=(0,i.d5)(Zo,Wo,(e=>{var{typed:t,matrix:n,equalScalar:r}=e,i=So({typed:t,equalScalar:r}),a=Lo({typed:t,equalScalar:r}),o=To({typed:t,equalScalar:r}),s=_o({typed:t}),u=xo({typed:t});return t(Zo,{"number, number":qn,"BigNumber, BigNumber":Tn,"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(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 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(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return u(n(t),e,this,!0).valueOf()}})})),Jo=["typed","DenseMatrix"],$o=(0,i.d5)("algorithm07",Jo,(e=>{var{typed:t,DenseMatrix:n}=e;return function(e,i,a){var o=e._size,s=e._datatype,u=i._size,l=i._datatype;if(o.length!==u.length)throw new Xe.m(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 c,f,d,p=o[0],h=o[1],m=0,v=a;"string"==typeof s&&s===l&&(c=s,m=t.convert(0,c),v=t.find(a,[c,c]));var y=[];for(f=0;f<p;f++)y[f]=[];var g=[],_=[],b=[],x=[];for(d=0;d<h;d++){var w=d+1;for(r(e,d,b,g,w),r(i,d,x,_,w),f=0;f<p;f++){var E=b[f]===w?g[f]:m,N=x[f]===w?_[f]:m;y[f][d]=v(E,N)}}return new n({data:y,size:[p,h],datatype:c})};function r(e,t,n,r,i){for(var a=e._values,o=e._index,s=e._ptr,u=s[t],l=s[t+1];u<l;u++){var c=o[u];n[c]=i,r[c]=a[u]}}})),Vo="bitXor",Ko=["typed","matrix","DenseMatrix"],Yo=(0,i.d5)(Vo,Ko,(e=>{var{typed:t,matrix:n,DenseMatrix:r}=e,i=ko({typed:t}),a=$o({typed:t,DenseMatrix:r}),o=Do({typed:t,DenseMatrix:r}),s=_o({typed:t}),u=xo({typed:t});return t(Vo,{"number, number":Hn,"BigNumber, BigNumber":Rn,"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(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 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(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return u(n(t),e,this,!0).valueOf()}})})),Xo=["typed","matrix","equalScalar","DenseMatrix"],Qo=(0,i.d5)("or",Xo,(e=>{var{typed:t,matrix:n,equalScalar:r,DenseMatrix:i}=e,a=ko({typed:t}),o=Co({typed:t,equalScalar:r}),s=Do({typed:t,DenseMatrix:i}),u=_o({typed:t}),l=xo({typed:t});return t("or",{"number, number":nr,"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(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 l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(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()}})})),es="diag",ts=["typed","matrix","DenseMatrix","SparseMatrix"],ns=(0,i.d5)(es,ts,(e=>{var{typed:t,matrix:n,DenseMatrix:r,SparseMatrix:i}=e;return t(es,{Array:function(e){return a(e,0,(0,Ve.aJ)(e),null)},"Array, number":function(e,t){return a(e,t,(0,Ve.aJ)(e),null)},"Array, BigNumber":function(e,t){return a(e,t.toNumber(),(0,Ve.aJ)(e),null)},"Array, string":function(e,t){return a(e,0,(0,Ve.aJ)(e),t)},"Array, number, string":function(e,t,n){return a(e,t,(0,Ve.aJ)(e),n)},"Array, BigNumber, string":function(e,t,n){return a(e,t.toNumber(),(0,Ve.aJ)(e),n)},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,n){return a(e,t,e.size(),n)},"Matrix, BigNumber, string":function(e,t,n){return a(e,t.toNumber(),e.size(),n)}});function a(e,t,a,o){if(!(0,u.U)(t))throw new TypeError("Second parameter in function diag must be an integer");var s=t>0?t:0,c=t<0?-t:0;switch(a.length){case 1:return function(e,t,n,a,o,s){var u=[a+o,a+s];if(n&&"sparse"!==n&&"dense"!==n)throw new TypeError("Unknown matrix type ".concat(n,'"'));var l="sparse"===n?i.diagonal(u,e,t):r.diagonal(u,e,t);return null!==n?l:l.valueOf()}(e,t,o,a[0],c,s);case 2:return function(e,t,r,i,a,o){if((0,l.SW)(e)){var s=e.diagonal(t);return null!==r?r!==s.storage()?n(s,r):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!==r?n(c):c}(e,t,o,a,c,s)}throw new RangeError("Matrix for function diag must be 2 dimensional")}})),rs="identity",is=["typed","config","matrix","BigNumber","DenseMatrix","SparseMatrix"],as=(0,i.d5)(rs,is,(e=>{var{typed:t,config:n,matrix:r,BigNumber:i,DenseMatrix:a,SparseMatrix:o}=e;return t(rs,{"":function(){return"Matrix"===n.matrix?r([]):[]},string:function(e){return r(e)},"number | BigNumber":function(e){return c(e,e,"Matrix"===n.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"===n.matrix?"dense":void 0)},"number | BigNumber, number | BigNumber, string":function(e,t,n){return c(e,t,n)},Array:function(e){return s(e)},"Array, string":function(e,t){return s(e,t)},Matrix:function(e){return s(e.valueOf(),e.storage())},"Matrix, string":function(e,t){return s(e.valueOf(),t)}});function s(e,t){switch(e.length){case 0:return t?r(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,n){var r=(0,l.l9)(e)||(0,l.l9)(t)?i:null;if((0,l.l9)(e)&&(e=e.toNumber()),(0,l.l9)(t)&&(t=t.toNumber()),!(0,u.U)(e)||e<1)throw new Error("Parameters in function identity must be positive integers");if(!(0,u.U)(t)||t<1)throw new Error("Parameters in function identity must be positive integers");var s=r?new i(1):1,c=r?new r(0):0,f=[e,t];if(n){if("sparse"===n)return o.diagonal(f,s,0,c);if("dense"===n)return a.diagonal(f,s,0,c);throw new TypeError('Unknown matrix type "'.concat(n,'"'))}for(var d=(0,Ve.SI)([],f,c),p=e<t?e:t,h=0;h<p;h++)d[h][h]=s;return d}})),os=["typed","config","matrix","BigNumber"],ss=(0,i.d5)("ones",os,(e=>{var{typed:t,config:n,matrix:r,BigNumber:i}=e;return t("ones",{"":function(){return"Array"===n.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"===n.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 n=function(e){var t=!1;return e.forEach((function(e,n,r){(0,l.l9)(e)&&(t=!0,r[n]=e.toNumber())})),t}(e)?new i(1):1;if(function(e){e.forEach((function(e){if("number"!=typeof e||!(0,u.U)(e)||e<0)throw new Error("Parameters in function ones must be positive integers")}))}(e),t){var a=r(t);return e.length>0?a.resize(e,n):a}var o=[];return e.length>0?(0,Ve.SI)(o,e,n):o}})),us="reshape",ls=["typed","isInteger","matrix"],cs=(0,i.d5)(us,ls,(e=>{var{typed:t,isInteger:n}=e;return t(us,{"Matrix, Array":function(e,t){return e.reshape(t)},"Array, Array":function(e,t){return t.forEach((function(e){if(!n(e))throw new TypeError("Invalid size for dimension: "+e)})),(0,Ve.XL)(e,t)}})})),fs=n(5180),ds="size",ps=["typed","config","?matrix"],hs=(0,i.d5)(ds,ps,(e=>{var{typed:t,config:n,matrix:r}=e;return t(ds,{Matrix:function(e){return e.create(e.size())},Array:Ve.aJ,string:function(e){return"Array"===n.matrix?[e.length]:r([e.length])},"number | Complex | BigNumber | Unit | boolean | null":function(e){return"Array"===n.matrix?[]:r?r([]):(0,fs.kX)()}})})),ms="zeros",vs=["typed","config","matrix","BigNumber"],ys=(0,i.d5)(ms,vs,(e=>{var{typed:t,config:n,matrix:r,BigNumber:i}=e;return t(ms,{"":function(){return"Array"===n.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"===n.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 n=function(e){var t=!1;return e.forEach((function(e,n,r){(0,l.l9)(e)&&(t=!0,r[n]=e.toNumber())})),t}(e)?new i(0):0;if(function(e){e.forEach((function(e){if("number"!=typeof e||!(0,u.U)(e)||e<0)throw new Error("Parameters in function zeros must be positive integers")}))}(e),t){var a=r(t);return e.length>0?a.resize(e,n):a}var o=[];return e.length>0?(0,Ve.SI)(o,e,n):o}})),gs=(0,i.d5)("hex",["typed","format"],(e=>{var{typed:t,format:n}=e;return t("hex",{"number | BigNumber":function(e){return n(e,{notation:"hex"})},"number | BigNumber, number":function(e,t){return n(e,{notation:"hex",wordSize:t})}})}));function _s(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);t&&(r=r.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),n.push.apply(n,r)}return n}function bs(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{};t%2?_s(Object(n),!0).forEach((function(t){xs(e,t,n[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(n)):_s(Object(n)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(n,t))}))}return e}function xs(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}var ws="Number of decimals in function round must be an integer",Es="round",Ns=["typed","matrix","equalScalar","zeros","BigNumber","DenseMatrix"],Ss=(0,i.d5)(Es,Ns,(e=>{var{typed:t,matrix:n,equalScalar:r,zeros:i,BigNumber:a,DenseMatrix:o}=e,s=To({typed:t,equalScalar:r}),u=Do({typed:t,DenseMatrix:o}),l=xo({typed:t});return t(Es,bs(bs({},Ms),{},{Complex:function(e){return e.round()},"Complex, number":function(e,t){if(t%1)throw new TypeError(ws);return e.round(t)},"Complex, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(ws);var n=t.toNumber();return e.round(n)},"number, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(ws);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(ws);return e.toDecimalPlaces(t.toNumber())},Fraction:function(e){return e.round()},"Fraction, number":function(e,t){if(t%1)throw new TypeError(ws);return e.round(t)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},"SparseMatrix, number | BigNumber":function(e,t){return s(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return l(e,t,this,!1)},"number | Complex | BigNumber, SparseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):u(t,e,this,!0)},"number | Complex | BigNumber, DenseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):l(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return l(n(e),t,this,!1).valueOf()},"number | Complex | BigNumber, Array":function(e,t){return l(n(t),e,this,!0).valueOf()}}))})),Ms={number:cn,"number, number":function(e,t){if(!(0,u.U)(t))throw new TypeError(ws);if(t<0||t>15)throw new Error("Number of decimals in function round must be in te range of 0-15");return cn(e,t)}},ks=["typed","equalScalar"],Os=(0,i.d5)("algorithm08",ks,(e=>{var{typed:t,equalScalar:n}=e;return function(e,r,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,l=e._datatype,c=r._values,f=r._index,d=r._ptr,p=r._size,h=r._datatype;if(u.length!==p.length)throw new Xe.m(u.length,p.length);if(u[0]!==p[0]||u[1]!==p[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+p+")");if(!a||!c)throw new Error("Cannot perform operation on Pattern Sparse Matrices");var m,v=u[0],y=u[1],g=n,_=0,b=i;"string"==typeof l&&l===h&&(m=l,g=t.find(n,[m,m]),_=t.convert(0,m),b=t.find(i,[m,m]));for(var x,w,E,N,S=[],M=[],k=[],O=[],C=[],A=0;A<y;A++){k[A]=M.length;var T=A+1;for(w=s[A],E=s[A+1],x=w;x<E;x++)C[N=o[x]]=T,O[N]=a[x],M.push(N);for(w=d[A],E=d[A+1],x=w;x<E;x++)C[N=f[x]]===T&&(O[N]=b(O[N],c[x]));for(x=k[A];x<M.length;){var I=O[N=M[x]];g(I,_)?M.splice(x,1):(S.push(I),x++)}}return k[y]=M.length,e.createSparseMatrix({values:S,index:M,ptr:k,size:[v,y],datatype:m})}})),Cs="leftShift",As=["typed","matrix","equalScalar","zeros","DenseMatrix"],Ts=(0,i.d5)(Cs,As,(e=>{var{typed:t,matrix:n,equalScalar:r,zeros:i,DenseMatrix:a}=e,o=po({typed:t}),s=So({typed:t,equalScalar:r}),u=Os({typed:t,equalScalar:r}),l=yo({typed:t,DenseMatrix:a}),c=To({typed:t,equalScalar:r}),f=_o({typed:t}),d=xo({typed:t});return t(Cs,{"number, number":Zn,"BigNumber, BigNumber":Ln,"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 f(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, number | BigNumber":function(e,t){return r(t,0)?e.clone():c(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return r(t,0)?e.clone():d(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):l(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):d(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(n(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,n(t)).valueOf()}})})),Is="rightLogShift",Ds=["typed","matrix","equalScalar","zeros","DenseMatrix"],Ps=(0,i.d5)(Is,Ds,(e=>{var{typed:t,matrix:n,equalScalar:r,zeros:i,DenseMatrix:a}=e,o=po({typed:t}),s=So({typed:t,equalScalar:r}),u=Os({typed:t,equalScalar:r}),l=yo({typed:t,DenseMatrix:a}),c=To({typed:t,equalScalar:r}),f=_o({typed:t}),d=xo({typed:t});return t(Is,{"number, number":Gn,"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 f(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, number | BigNumber":function(e,t){return r(t,0)?e.clone():c(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return r(t,0)?e.clone():d(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):l(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):d(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(n(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,n(t)).valueOf()}})})),js="compare",Rs=["typed","config","matrix","equalScalar","BigNumber","Fraction","DenseMatrix"],Ls=(0,i.d5)(js,Rs,(e=>{var{typed:t,config:n,equalScalar:r,matrix:i,BigNumber:a,Fraction:o,DenseMatrix:s}=e,l=ko({typed:t}),c=Co({typed:t,equalScalar:r}),f=Do({typed:t,DenseMatrix:s}),d=_o({typed:t}),p=xo({typed:t});return t(js,{"boolean, boolean":function(e,t){return e===t?0:e>t?1:-1},"number, number":function(e,t){return(0,u.RI)(e,t,n.epsilon)?0:e>t?1:-1},"BigNumber, BigNumber":function(e,t){return Mt(e,t,n.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 l(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return l(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return d(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()}})})),Bs="compareText",Us=["typed","matrix"],qs=(0,i.d5)(Bs,Us,(e=>{var{typed:t,matrix:n}=e,r=_o({typed:t}),i=xo({typed:t});return t(Bs,{"any, any":Ke.cd,"DenseMatrix, DenseMatrix":function(e,t){return r(e,t,Ke.cd)},"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))},"DenseMatrix, any":function(e,t){return i(e,t,Ke.cd,!1)},"any, DenseMatrix":function(e,t){return i(t,e,Ke.cd,!0)},"Array, any":function(e,t){return i(n(e),t,Ke.cd,!1).valueOf()},"any, Array":function(e,t){return i(n(t),e,Ke.cd,!0).valueOf()}})})),zs="smaller",Fs=["typed","config","matrix","DenseMatrix"],Hs=(0,i.d5)(zs,Fs,(e=>{var{typed:t,config:n,matrix:r,DenseMatrix:i}=e,a=ko({typed:t}),o=$o({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),l=_o({typed:t}),c=xo({typed:t});return t(zs,{"boolean, boolean":function(e,t){return e<t},"number, number":function(e,t){return e<t&&!(0,u.RI)(e,t,n.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lt(t)&&!Mt(e,t,n.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 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 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()}})})),Zs="larger",Ws=["typed","config","matrix","DenseMatrix"],Gs=(0,i.d5)(Zs,Ws,(e=>{var{typed:t,config:n,matrix:r,DenseMatrix:i}=e,a=ko({typed:t}),o=$o({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),l=_o({typed:t}),c=xo({typed:t});return t(Zs,{"boolean, boolean":function(e,t){return e>t},"number, number":function(e,t){return e>t&&!(0,u.RI)(e,t,n.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gt(t)&&!Mt(e,t,n.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 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 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()}})})),Js="unequal",$s=["typed","config","equalScalar","matrix","DenseMatrix"],Vs=(0,i.d5)(Js,$s,(e=>{var{typed:t,config:n,equalScalar:r,matrix:i,DenseMatrix:a}=e,o=ko({typed:t}),s=$o({typed:t,DenseMatrix:a}),u=Do({typed:t,DenseMatrix:a}),l=_o({typed:t}),c=xo({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 s(e,t,f)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,f,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,f,!1)},"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,f)},"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 u(e,t,f,!1)},"DenseMatrix, any":function(e,t){return c(e,t,f,!1)},"any, SparseMatrix":function(e,t){return u(t,e,f,!0)},"any, DenseMatrix":function(e,t){return c(t,e,f,!0)},"Array, any":function(e,t){return c(i(e),t,f,!1).valueOf()},"any, Array":function(e,t){return c(i(t),e,f,!0).valueOf()}});function f(e,t){return!r(e,t)}})),Ks=((0,i.d5)(Js,["typed","equalScalar"],(e=>{var{typed:t,equalScalar:n}=e;return t(Js,{"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)}})})),["smaller","DenseMatrix"]),Ys=(0,i.d5)("ImmutableDenseMatrix",Ks,(e=>{var{smaller:t,DenseMatrix:n}=e;function r(e,t){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!(0,l.HD)(t))throw new Error("Invalid datatype: "+t);if((0,l.SW)(e)||(0,l.kJ)(e)){var i=new n(e,t);this._data=i._data,this._size=i._size,this._datatype=i._datatype,this._min=null,this._max=null}else if(e&&(0,l.kJ)(e.data)&&(0,l.kJ)(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 ("+(0,l.kM)(e)+")");this._data=[],this._size=[0],this._datatype=t,this._min=null,this._max=null}}return r.prototype=new n,r.prototype.type="ImmutableDenseMatrix",r.prototype.isImmutableDenseMatrix=!0,r.prototype.subset=function(e){switch(arguments.length){case 1:var t=n.prototype.subset.call(this,e);return(0,l.SW)(t)?new r({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")}},r.prototype.set=function(){throw new Error("Cannot invoke set on an Immutable Matrix instance")},r.prototype.resize=function(){throw new Error("Cannot invoke resize on an Immutable Matrix instance")},r.prototype.reshape=function(){throw new Error("Cannot invoke reshape on an Immutable Matrix instance")},r.prototype.clone=function(){return new r({data:(0,Ye.d9)(this._data),size:(0,Ye.d9)(this._size),datatype:this._datatype})},r.prototype.toJSON=function(){return{mathjs:"ImmutableDenseMatrix",data:this._data,size:this._size,datatype:this._datatype}},r.fromJSON=function(e){return new r(e)},r.prototype.swapRows=function(){throw new Error("Cannot invoke swapRows on an Immutable Matrix instance")},r.prototype.min=function(){if(null===this._min){var e=null;this.forEach((function(n){(null===e||t(n,e))&&(e=n)})),this._min=null!==e?e:void 0}return this._min},r.prototype.max=function(){if(null===this._max){var e=null;this.forEach((function(n){(null===e||t(e,n))&&(e=n)})),this._max=null!==e?e:void 0}return this._max},r}),{isClass:!0}),Xs=["smaller","larger"],Qs=(0,i.d5)("FibonacciHeap",Xs,(e=>{var{smaller:t,larger:n}=e,r=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,n){t.left.right=t.right,t.right.left=t.left,n.degree--,n.child===t&&(n.child=t.right),0===n.degree&&(n.child=null),t.left=e,t.right=e.right,e.right=t,t.right.left=t,t.parent=null,t.mark=!1}function o(e,t){var n=t.parent;n&&(t.mark?(a(e,t,n),o(n)):t.mark=!0)}i.prototype.type="FibonacciHeap",i.prototype.isFibonacciHeap=!0,i.prototype.insert=function(e,n){var r={key:e,value:n,degree:0};if(this._minimum){var i=this._minimum;r.left=i,r.right=i.right,i.right=r,r.right.left=r,t(e,i.key)&&(this._minimum=r)}else r.left=r,r.right=r,this._minimum=r;return this._size++,r},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,o=e.child;a>0;){var u=o.right;o.left.right=o.right,o.right.left=o.left,o.left=i,o.right=i.right,i.right=o,o.right.left=o,o.parent=null,o=u,a--}return e.left.right=e.right,e.right.left=e.left,i=e===e.right?null:function(e,i){var a,o=Math.floor(Math.log(i)*r)+1,u=new Array(o),l=0,c=e;if(c)for(l++,c=c.right;c!==e;)l++,c=c.right;for(;l>0;){for(var f=c.degree,d=c.right;a=u[f];){if(n(c.key,a.key)){var p=a;a=c,c=p}s(a,c),u[f]=null,f++}u[f]=c,c=d,l--}e=null;for(var h=0;h<o;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,n,r){n.key=-1;var i=n.parent;return i&&t(n.key,i.key)&&(a(e,n,i),o(e,i)),t(n.key,e.key)&&(e=n),e}(this._minimum,e),this.extractMinimum()};var s=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}),eu="sparse",tu=["typed","SparseMatrix"],nu=(0,i.d5)(eu,tu,(e=>{var{typed:t,SparseMatrix:n}=e;return t(eu,{"":function(){return new n([])},string:function(e){return new n([],e)},"Array | Matrix":function(e){return new n(e)},"Array | Matrix, string":function(e,t){return new n(e,t)}})})),ru="acoth",iu=["typed","config","Complex","BigNumber"],au=(0,i.d5)(ru,iu,(e=>{var{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(ru,{number:function(e){return e>=1||e<=-1||n.predictable?zr(e):new r(e,0).acoth()},Complex:function(e){return e.acoth()},BigNumber:function(e){return new i(1).div(e).atanh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ou=["typed","equalScalar"],su=(0,i.d5)("algorithm09",ou,(e=>{var{typed:t,equalScalar:n}=e;return function(e,r,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,l=e._datatype,c=r._values,f=r._index,d=r._ptr,p=r._size,h=r._datatype;if(u.length!==p.length)throw new Xe.m(u.length,p.length);if(u[0]!==p[0]||u[1]!==p[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+p+")");var m,v=u[0],y=u[1],g=n,_=0,b=i;"string"==typeof l&&l===h&&(m=l,g=t.find(n,[m,m]),_=t.convert(0,m),b=t.find(i,[m,m]));var x,w,E,N,S,M=a&&c?[]:void 0,k=[],O=[],C=M?[]:void 0,A=[];for(w=0;w<y;w++){O[w]=k.length;var T=w+1;if(C)for(N=d[w],S=d[w+1],E=N;E<S;E++)A[x=f[E]]=T,C[x]=c[E];for(N=s[w],S=s[w+1],E=N;E<S;E++)if(x=o[E],C){var I=A[x]===T?C[x]:_,D=b(a[E],I);g(D,_)||(k.push(x),M.push(D))}else k.push(x)}return O[y]=k.length,e.createSparseMatrix({values:M,index:k,ptr:O,size:[v,y],datatype:m})}})),uu="atan2",lu=["typed","matrix","equalScalar","BigNumber","DenseMatrix"],cu=(0,i.d5)(uu,lu,(e=>{var{typed:t,matrix:n,equalScalar:r,BigNumber:i,DenseMatrix:a}=e,o=So({typed:t,equalScalar:r}),s=ko({typed:t}),u=su({typed:t,equalScalar:r}),l=To({typed:t,equalScalar:r}),c=Do({typed:t,DenseMatrix:a}),f=_o({typed:t}),d=xo({typed:t});return t(uu,{"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 f(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, number | BigNumber":function(e,t){return l(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return d(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return c(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return d(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return d(n(e),t,this,!1).valueOf()},"number | BigNumber, Array":function(e,t){return d(n(t),e,this,!0).valueOf()}})})),fu=["typed","BigNumber"],du=(0,i.d5)("sec",fu,(e=>{var{typed:t,BigNumber:n}=e;return t("sec",{number:Xr,Complex:function(e){return e.sec()},BigNumber:function(e){return new n(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(0,ut.Fh)(e,this)}})})),pu=["typed","matrix","addScalar","equalScalar","DenseMatrix","SparseMatrix"],hu=(0,i.d5)("add",pu,(e=>{var{typed:t,matrix:n,addScalar:r,equalScalar:i,DenseMatrix:a,SparseMatrix:o}=e,s=po({typed:t}),u=mo({typed:t,equalScalar:i}),l=yo({typed:t,DenseMatrix:a}),c=_o({typed:t}),f=xo({typed:t});return t("add",(0,Ye.l7)({"DenseMatrix, DenseMatrix":function(e,t){return c(e,t,r)},"DenseMatrix, SparseMatrix":function(e,t){return s(e,t,r,!1)},"SparseMatrix, DenseMatrix":function(e,t){return s(t,e,r,!0)},"SparseMatrix, SparseMatrix":function(e,t){return u(e,t,r)},"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))},"DenseMatrix, any":function(e,t){return f(e,t,r,!1)},"SparseMatrix, any":function(e,t){return l(e,t,r,!1)},"any, DenseMatrix":function(e,t){return f(t,e,r,!0)},"any, SparseMatrix":function(e,t){return l(t,e,r,!0)},"Array, any":function(e,t){return f(n(e),t,r,!1).valueOf()},"any, Array":function(e,t){return f(n(t),e,r,!0).valueOf()},"any, any":r,"any, any, ...any":function(e,t,n){for(var r=this(e,t),i=0;i<n.length;i++)r=this(r,n[i]);return r}},r.signatures))})),mu=["typed","addScalar","multiplyScalar","conj","size"],vu=(0,i.d5)("dot",mu,(e=>{var{typed:t,addScalar:n,multiplyScalar:r,conj:i,size:a}=e;return t("dot",{"Array | DenseMatrix, Array | DenseMatrix":function(e,a){var u=o(e,a),c=(0,l.SW)(e)?e._data:e,f=(0,l.SW)(e)?e._datatype:void 0,d=(0,l.SW)(a)?a._data:a,p=(0,l.SW)(a)?a._datatype:void 0,h=2===s(e).length,m=2===s(a).length,v=n,y=r;if(f&&p&&f===p&&"string"==typeof f){var g=f;v=t.find(n,[g,g]),y=t.find(r,[g,g])}if(!h&&!m){for(var _=y(i(c[0]),d[0]),b=1;b<u;b++)_=v(_,y(i(c[b]),d[b]));return _}if(!h&&m){for(var x=y(i(c[0]),d[0][0]),w=1;w<u;w++)x=v(x,y(i(c[w]),d[w][0]));return x}if(h&&!m){for(var E=y(i(c[0][0]),d[0]),N=1;N<u;N++)E=v(E,y(i(c[N][0]),d[N]));return E}if(h&&m){for(var S=y(i(c[0][0]),d[0][0]),M=1;M<u;M++)S=v(S,y(i(c[M][0]),d[M][0]));return S}},"SparseMatrix, SparseMatrix":function(e,t){o(e,t);for(var i=e._index,a=e._values,s=t._index,u=t._values,l=0,c=n,f=r,d=0,p=0;d<i.length&&p<s.length;){var h=i[d],m=s[p];h<m?d++:h>m?p++:h===m&&(l=c(l,f(a[d],u[p])),d++,p++)}return l}});function o(e,t){var n,r,i=s(e),a=s(t);if(1===i.length)n=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(", ")+")");n=i[0]}if(1===a.length)r=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(", ")+")");r=a[0]}if(n!==r)throw new RangeError("Vectors must have equal length ("+n+" != "+r+")");if(0===n)throw new RangeError("Cannot calculate the dot product of empty vectors");return n}function s(e){return(0,l.SW)(e)?e.size():a(e)}})),yu="composition",gu=["typed","addScalar","combinations","isNegative","isPositive","isInteger","larger"],_u=(0,i.d5)(yu,gu,(e=>{var{typed:t,addScalar:n,combinations:r,isPositive:i,isNegative:a,isInteger:o,larger:s}=e;return t(yu,{"number | BigNumber, number | BigNumber":function(e,t){if(!(o(e)&&i(e)&&o(t)&&i(t)))throw new TypeError("Positive integer value expected in function composition");if(s(t,e))throw new TypeError("k must be less than or equal to n in function composition");return r(n(e,-1),n(t,-1))}})})),bu="isZero",xu=["typed"],wu=(0,i.d5)(bu,xu,(e=>{var{typed:t}=e;return t(bu,{number:gt,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(0,ut.Fh)(e,this)}})})),Eu=["typed"],Nu=(0,i.d5)("abs",Eu,(e=>{var{typed:t}=e;return t("abs",{number:Ft,Complex:function(e){return e.abs()},BigNumber:function(e){return e.abs()},Fraction:function(e){return e.abs()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},Unit:function(e){return e.abs()}})})),Su=["typed","config","round","matrix","equalScalar"],Mu=(0,i.d5)("floor",Su,(e=>{var{typed:t,config:n,round:r,matrix:i,equalScalar:a}=e,o=To({typed:t,equalScalar:a}),s=xo({typed:t});return t("floor",{number:function(e){return(0,u.RI)(e,r(e),n.epsilon)?r(e):Math.floor(e)},"number, number":function(e,t){if((0,u.RI)(e,r(e,t),n.epsilon))return r(e,t);var[i,a]="".concat(e,"e").split("e"),o=Math.floor(Number("".concat(i,"e").concat(Number(a)+t)));return[i,a]="".concat(o,"e").split("e"),Number("".concat(i,"e").concat(Number(a)-t))},Complex:function(e){return e.floor()},"Complex, number":function(e,t){return e.floor(t)},BigNumber:function(e){return Mt(e,r(e),n.epsilon)?r(e):e.floor()},"BigNumber, BigNumber":function(e,t){return Mt(e,r(e,t),n.epsilon)?r(e,t):e.toDecimalPlaces(t.toNumber(),z.ROUND_FLOOR)},Fraction:function(e){return e.floor()},"Fraction, number":function(e,t){return e.floor(t)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},"Array | Matrix, number":function(e,t){return(0,ut.Fh)(e,(e=>this(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()}})})),ku="multiply",Ou=["typed","matrix","addScalar","multiplyScalar","equalScalar","dot"],Cu=(0,i.d5)(ku,Ou,(e=>{var{typed:t,matrix:n,addScalar:r,multiplyScalar:i,equalScalar:a,dot:o}=e,s=To({typed:t,equalScalar:a}),u=xo({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)")}}var f=t("_multiplyMatrixVector",{"DenseMatrix, any":function(e,n){var a,o=e._data,s=e._size,u=e._datatype,l=n._data,c=n._datatype,f=s[0],d=s[1],p=r,h=i;u&&c&&u===c&&"string"==typeof u&&(a=u,p=t.find(r,[a,a]),h=t.find(i,[a,a]));for(var m=[],v=0;v<f;v++){for(var y=o[v],g=h(y[0],l[0]),_=1;_<d;_++)g=p(g,h(y[_],l[_]));m[v]=g}return e.createDenseMatrix({data:m,size:[f],datatype:a})},"SparseMatrix, any":function(e,n){var o=e._values,s=e._index,u=e._ptr,l=e._datatype;if(!o)throw new Error("Cannot multiply Pattern only Matrix times Dense Matrix");var c,f=n._data,d=n._datatype,p=e._size[0],h=n._size[0],m=[],v=[],y=[],g=r,_=i,b=a,x=0;l&&d&&l===d&&"string"==typeof l&&(c=l,g=t.find(r,[c,c]),_=t.find(i,[c,c]),b=t.find(a,[c,c]),x=t.convert(0,c));var w=[],E=[];y[0]=0;for(var N=0;N<h;N++){var S=f[N];if(!b(S,x))for(var M=u[N],k=u[N+1],O=M;O<k;O++){var C=s[O];E[C]?w[C]=g(w[C],_(S,o[O])):(E[C]=!0,v.push(C),w[C]=_(S,o[O]))}}for(var A=v.length,T=0;T<A;T++){var I=v[T];m[T]=w[I]}return y[1]=v.length,e.createSparseMatrix({values:m,index:v,ptr:y,size:[p,1],datatype:c})}}),d=t("_multiplyMatrixMatrix",{"DenseMatrix, DenseMatrix":function(e,n){var a,o=e._data,s=e._size,u=e._datatype,l=n._data,c=n._size,f=n._datatype,d=s[0],p=s[1],h=c[1],m=r,v=i;u&&f&&u===f&&"string"==typeof u&&(a=u,m=t.find(r,[a,a]),v=t.find(i,[a,a]));for(var y=[],g=0;g<d;g++){var _=o[g];y[g]=[];for(var b=0;b<h;b++){for(var x=v(_[0],l[0][b]),w=1;w<p;w++)x=m(x,v(_[w],l[w][b]));y[g][b]=x}}return e.createDenseMatrix({data:y,size:[d,h],datatype:a})},"DenseMatrix, SparseMatrix":function(e,n){var o=e._data,s=e._size,u=e._datatype,l=n._values,c=n._index,f=n._ptr,d=n._size,p=n._datatype;if(!l)throw new Error("Cannot multiply Dense Matrix times Pattern only Matrix");var h,m=s[0],v=d[1],y=r,g=i,_=a,b=0;u&&p&&u===p&&"string"==typeof u&&(h=u,y=t.find(r,[h,h]),g=t.find(i,[h,h]),_=t.find(a,[h,h]),b=t.convert(0,h));for(var x=[],w=[],E=[],N=n.createSparseMatrix({values:x,index:w,ptr:E,size:[m,v],datatype:h}),S=0;S<v;S++){E[S]=w.length;var M=f[S],k=f[S+1];if(k>M)for(var O=0,C=0;C<m;C++){for(var A=C+1,T=void 0,I=M;I<k;I++){var D=c[I];O!==A?(T=g(o[C][D],l[I]),O=A):T=y(T,g(o[C][D],l[I]))}O!==A||_(T,b)||(w.push(C),x.push(T))}}return E[v]=w.length,N},"SparseMatrix, DenseMatrix":function(e,n){var o=e._values,s=e._index,u=e._ptr,l=e._datatype;if(!o)throw new Error("Cannot multiply Pattern only Matrix times Dense Matrix");var c,f=n._data,d=n._datatype,p=e._size[0],h=n._size[0],m=n._size[1],v=r,y=i,g=a,_=0;l&&d&&l===d&&"string"==typeof l&&(c=l,v=t.find(r,[c,c]),y=t.find(i,[c,c]),g=t.find(a,[c,c]),_=t.convert(0,c));for(var b=[],x=[],w=[],E=e.createSparseMatrix({values:b,index:x,ptr:w,size:[p,m],datatype:c}),N=[],S=[],M=0;M<m;M++){w[M]=x.length;for(var k=M+1,O=0;O<h;O++){var C=f[O][M];if(!g(C,_))for(var A=u[O],T=u[O+1],I=A;I<T;I++){var D=s[I];S[D]!==k?(S[D]=k,x.push(D),N[D]=y(C,o[I])):N[D]=v(N[D],y(C,o[I]))}}for(var P=w[M],j=x.length,R=P;R<j;R++){var L=x[R];b[R]=N[L]}}return w[m]=x.length,E},"SparseMatrix, SparseMatrix":function(e,n){var a,o=e._values,s=e._index,u=e._ptr,l=e._datatype,c=n._values,f=n._index,d=n._ptr,p=n._datatype,h=e._size[0],m=n._size[1],v=o&&c,y=r,g=i;l&&p&&l===p&&"string"==typeof l&&(a=l,y=t.find(r,[a,a]),g=t.find(i,[a,a]));for(var _,b,x,w,E,N,S,M,k=v?[]:void 0,O=[],C=[],A=e.createSparseMatrix({values:k,index:O,ptr:C,size:[h,m],datatype:a}),T=v?[]:void 0,I=[],D=0;D<m;D++){C[D]=O.length;var P=D+1;for(E=d[D],N=d[D+1],w=E;w<N;w++)if(M=f[w],v)for(b=u[M],x=u[M+1],_=b;_<x;_++)I[S=s[_]]!==P?(I[S]=P,O.push(S),T[S]=g(c[w],o[_])):T[S]=y(T[S],g(c[w],o[_]));else for(b=u[M],x=u[M+1],_=b;_<x;_++)I[S=s[_]]!==P&&(I[S]=P,O.push(S));if(v)for(var j=C[D],R=O.length,L=j;L<R;L++){var B=O[L];k[L]=T[B]}}return C[m]=O.length,A}});return t(ku,(0,Ye.l7)({"Array, Array":function(e,t){c((0,Ve.aJ)(e),(0,Ve.aJ)(t));var r=this(n(e),n(t));return(0,l.SW)(r)?r.valueOf():r},"Matrix, Matrix":function(e,n){var a=e.size(),s=n.size();return c(a,s),1===a.length?1===s.length?function(e,t,n){if(0===n)throw new Error("Cannot multiply two empty vectors");return o(e,t)}(e,n,a[0]):function(e,n){if("dense"!==n.storage())throw new Error("Support for SparseMatrix not implemented");return function(e,n){var a,o=e._data,s=e._size,u=e._datatype,l=n._data,c=n._size,f=n._datatype,d=s[0],p=c[1],h=r,m=i;u&&f&&u===f&&"string"==typeof u&&(a=u,h=t.find(r,[a,a]),m=t.find(i,[a,a]));for(var v=[],y=0;y<p;y++){for(var g=m(o[0],l[0][y]),_=1;_<d;_++)g=h(g,m(o[_],l[_][y]));v[y]=g}return e.createDenseMatrix({data:v,size:[p],datatype:a})}(e,n)}(e,n):1===s.length?f(e,n):d(e,n)},"Matrix, Array":function(e,t){return this(e,n(t))},"Array, Matrix":function(e,t){return this(n(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(n(e),t,i,!1).valueOf()},"any, Array":function(e,t){return u(n(t),e,i,!0).valueOf()},"any, any":i,"any, any, ...any":function(e,t,n){for(var r=this(e,t),i=0;i<n.length;i++)r=this(r,n[i]);return r}},i.signatures))})),Au="dotMultiply",Tu=["typed","matrix","equalScalar","multiplyScalar"],Iu=(0,i.d5)(Au,Tu,(e=>{var{typed:t,matrix:n,equalScalar:r,multiplyScalar:i}=e,a=So({typed:t,equalScalar:r}),o=su({typed:t,equalScalar:r}),s=To({typed:t,equalScalar:r}),u=_o({typed:t}),l=xo({typed:t});return t(Au,{"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(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,i,!1)},"DenseMatrix, any":function(e,t){return l(e,t,i,!1)},"any, SparseMatrix":function(e,t){return s(t,e,i,!0)},"any, DenseMatrix":function(e,t){return l(t,e,i,!0)},"Array, any":function(e,t){return l(n(e),t,i,!1).valueOf()},"any, Array":function(e,t){return l(n(t),e,i,!0).valueOf()}})})),Du=["typed"],Pu=(0,i.d5)("re",Du,(e=>{var{typed:t}=e;return t("re",{number:function(e){return e},BigNumber:function(e){return e},Complex:function(e){return e.re},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ju="flatten",Ru=["typed","matrix"],Lu=(0,i.d5)(ju,Ru,(e=>{var{typed:t,matrix:n}=e;return t(ju,{Array:function(e){return(0,Ve.xH)((0,Ye.d9)(e))},Matrix:function(e){var t=(0,Ve.xH)((0,Ye.d9)(e.toArray()));return n(t)}})}));function Bu(e,t,n,r){if(!(this instanceof Bu))throw new SyntaxError("Constructor must be called with the new operator");this.fn=e,this.count=t,this.min=n,this.max=r,this.message="Wrong number of arguments in function "+e+" ("+t+" provided, "+n+(null!=r?"-"+r:"")+" expected)",this.stack=(new Error).stack}Bu.prototype=new Error,Bu.prototype.constructor=Error,Bu.prototype.name="ArgumentsError",Bu.prototype.isArgumentsError=!0;var Uu=["config","matrix"],qu=(0,i.d5)("resize",Uu,(e=>{var{config:t,matrix:n}=e;return function(e,i,a){if(2!==arguments.length&&3!==arguments.length)throw new Bu("resize",arguments.length,2,3);if((0,l.SW)(i)&&(i=i.valueOf()),(0,l.l9)(i[0])&&(i=i.map((function(e){return(0,l.l9)(e)?e.toNumber():e}))),(0,l.SW)(e))return e.resize(i,a,!0);if("string"==typeof e)return r(e,i,a);var o=!Array.isArray(e)&&"Array"!==t.matrix;if(0===i.length){for(;Array.isArray(e);)e=e[0];return(0,Ye.d9)(e)}Array.isArray(e)||(e=[e]),e=(0,Ye.d9)(e);var s=(0,Ve.SI)(e,i,a);return o?n(s):s};function r(e,t,n){if(void 0!==n){if("string"!=typeof n||1!==n.length)throw new TypeError("Single character expected as defaultValue")}else n=" ";if(1!==t.length)throw new Xe.m(t.length,1);var r=t[0];if("number"!=typeof r||!(0,u.U)(r))throw new TypeError("Invalid size, must contain positive integers (size: "+(0,Ke.WU)(t)+")");if(e.length>r)return e.substring(0,r);if(e.length<r){for(var i=e,a=0,o=r-e.length;a<o;a++)i+=n;return i}return e}})),zu="squeeze",Fu=["typed","matrix"],Hu=(0,i.d5)(zu,Fu,(e=>{var{typed:t,matrix:n}=e;return t(zu,{Array:function(e){return(0,Ve.L9)((0,Ye.d9)(e))},Matrix:function(e){var t=(0,Ve.L9)(e.toArray());return Array.isArray(t)?n(t):t},any:function(e){return(0,Ye.d9)(e)}})})),Zu=["typed","matrix"],Wu=(0,i.d5)("to",Zu,(e=>{var{typed:t,matrix:n}=e,r=_o({typed:t}),i=xo({typed:t});return t("to",{"Unit, Unit | string":function(e,t){return e.to(t)},"Matrix, Matrix":function(e,t){return r(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))},"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(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return i(n(t),e,this,!0).valueOf()}})})),Gu=["typed","config","identity","multiply","matrix","fraction","number","Complex"],Ju=(0,i.d5)("pow",Gu,(e=>{var{typed:t,config:n,identity:r,multiply:i,matrix:a,number:o,fraction:s,Complex:l}=e;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||n.predictable?e.pow(t):new l(e.toNumber(),0).pow(t.toNumber(),0)},"Fraction, Fraction":function(e,t){if(1!==t.d){if(n.predictable)throw new Error("Function pow does not support non-integer exponents for fractions.");return c(e.valueOf(),t.valueOf())}return e.pow(t)},"Array, number":f,"Array, BigNumber":function(e,t){return f(e,t.toNumber())},"Matrix, number":d,"Matrix, BigNumber":function(e,t){return d(e,t.toNumber())},"Unit, number | BigNumber":function(e,t){return e.pow(t)}});function c(e,t){if(n.predictable&&!(0,u.U)(t)&&e<0)try{var r=s(t),i=o(r);if((t===i||Math.abs((t-i)/t)<1e-14)&&r.d%2==1)return(r.n%2==0?1:-1)*Math.pow(-e,t)}catch(e){}return n.predictable&&(e<-1&&t===1/0||e>-1&&e<0&&t===-1/0)?NaN:(0,u.U)(t)||e>=0||n.predictable?ln(e,t):e*e<1&&t===1/0||e*e>1&&t===-1/0?0:new l(e,0).pow(t,0)}function f(e,t){if(!(0,u.U)(t)||t<0)throw new TypeError("For A^b, b must be a positive integer (value is "+t+")");var n=(0,Ve.aJ)(e);if(2!==n.length)throw new Error("For A^b, A must be 2 dimensional (A has "+n.length+" dimensions)");if(n[0]!==n[1])throw new Error("For A^b, A must be square (size is "+n[0]+"x"+n[1]+")");for(var a=r(n[0]).valueOf(),o=e;t>=1;)1==(1&t)&&(a=i(o,a)),t>>=1,o=i(o,o);return a}function d(e,t){return a(f(e.valueOf(),t))}})),$u="dotPow",Vu=["typed","equalScalar","matrix","pow","DenseMatrix"],Ku=(0,i.d5)($u,Vu,(e=>{var{typed:t,equalScalar:n,matrix:r,pow:i,DenseMatrix:a}=e,o=ko({typed:t}),s=$o({typed:t,DenseMatrix:a}),u=To({typed:t,equalScalar:n}),l=Do({typed:t,DenseMatrix:a}),c=_o({typed:t}),f=xo({typed:t});return t($u,{"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 c(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 u(e,t,this,!1)},"DenseMatrix, any":function(e,t){return f(e,t,this,!1)},"any, SparseMatrix":function(e,t){return l(t,e,this,!0)},"any, DenseMatrix":function(e,t){return f(t,e,this,!0)},"Array, any":function(e,t){return f(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return f(r(t),e,this,!0).valueOf()}})})),Yu="rightArithShift",Xu=["typed","matrix","equalScalar","zeros","DenseMatrix"],Qu=(0,i.d5)(Yu,Xu,(e=>{var{typed:t,matrix:n,equalScalar:r,zeros:i,DenseMatrix:a}=e,o=po({typed:t}),s=So({typed:t,equalScalar:r}),u=Os({typed:t,equalScalar:r}),l=yo({typed:t,DenseMatrix:a}),c=To({typed:t,equalScalar:r}),f=_o({typed:t}),d=xo({typed:t});return t(Yu,{"number, number":Wn,"BigNumber, BigNumber":Bn,"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 f(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, number | BigNumber":function(e,t){return r(t,0)?e.clone():c(e,t,this,!1)},"DenseMatrix, number | BigNumber":function(e,t){return r(t,0)?e.clone():d(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):l(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return r(e,0)?i(t.size(),t.storage()):d(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return this(n(e),t).valueOf()},"number | BigNumber, Array":function(e,t){return this(e,n(t)).valueOf()}})})),el=n(3228),tl="compareNatural",nl=["typed","compare"],rl=(0,i.d5)(tl,nl,(e=>{var{typed:t,compare:n}=e,r=n.signatures["boolean,boolean"];return t(tl,{"any, any":function(e,t){var o,s=(0,l.kM)(e),u=(0,l.kM)(t);if(!("number"!==s&&"BigNumber"!==s&&"Fraction"!==s||"number"!==u&&"BigNumber"!==u&&"Fraction"!==u))return"0"!==(o=n(e,t)).toString()?o>0?1:-1:el(s,u);if("Array"===s||"Matrix"===s||"Array"===u||"Matrix"===u)return 0!==(o=i(this,e,t))?o:el(s,u);if(s!==u)return el(s,u);if("Complex"===s)return 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}(e,t);if("Unit"===s)return e.equalBase(t)?this(e.value,t.value):a(this,e.formatUnits(),t.formatUnits());if("boolean"===s)return r(e,t);if("string"===s)return el(e,t);if("Object"===s)return function(e,t,n){var r=Object.keys(t),i=Object.keys(n);r.sort(el),i.sort(el);var o=a(e,r,i);if(0!==o)return o;for(var s=0;s<r.length;s++){var u=e(t[r[s]],n[i[s]]);if(0!==u)return u}return 0}(this,e,t);if("null"===s)return 0;if("undefined"===s)return 0;throw new TypeError('Unsupported type of value "'+s+'"')}});function i(e,t,n){return(0,l.sA)(t)&&(0,l.sA)(n)?a(e,t.toJSON().values,n.toJSON().values):(0,l.sA)(t)?i(e,t.toArray(),n):(0,l.sA)(n)?i(e,t,n.toArray()):(0,l.jH)(t)?i(e,t.toJSON().data,n):(0,l.jH)(n)?i(e,t,n.toJSON().data):Array.isArray(t)?Array.isArray(n)?a(e,t,n):i(e,t,[n]):i(e,[t],n)}function a(e,t,n){for(var r=0,i=Math.min(t.length,n.length);r<i;r++){var a=e(t[r],n[r]);if(0!==a)return a}return t.length>n.length?1:t.length<n.length?-1:0}})),il="equalText",al=["typed","compareText","isZero"],ol=(0,i.d5)(il,al,(e=>{var{typed:t,compareText:n,isZero:r}=e;return t(il,{"any, any":function(e,t){return r(n(e,t))}})})),sl="largerEq",ul=["typed","config","matrix","DenseMatrix"],ll=(0,i.d5)(sl,ul,(e=>{var{typed:t,config:n,matrix:r,DenseMatrix:i}=e,a=ko({typed:t}),o=$o({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),l=_o({typed:t}),c=xo({typed:t});return t(sl,{"boolean, boolean":function(e,t){return e>=t},"number, number":function(e,t){return e>=t||(0,u.RI)(e,t,n.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gte(t)||Mt(e,t,n.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 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 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()}})})),cl="partitionSelect",fl=["typed","isNumeric","isNaN","compare"],dl=(0,i.d5)(cl,fl,(e=>{var{typed:t,isNumeric:n,isNaN:r,compare:i}=e,a=i,o=(e,t)=>-i(e,t);return t(cl,{"Array | Matrix, number":function(e,t){return s(e,t,a)},"Array | Matrix, number, string":function(e,t,n){if("asc"===n)return s(e,t,a);if("desc"===n)return s(e,t,o);throw new Error('Compare string must be "asc" or "desc"')},"Array | Matrix, number, function":s});function s(e,t,n){if(!(0,u.U)(t)||t<0)throw new Error("k must be a non-negative integer");if((0,l.SW)(e)){if(e.size().length>1)throw new Error("Only one dimensional matrices supported");return c(e.valueOf(),t,n)}if(Array.isArray(e))return c(e,t,n)}function c(e,t,i){if(t>=e.length)throw new Error("k out of bounds");for(var a=0;a<e.length;a++)if(n(e[a])&&r(e[a]))return e[a];for(var o=0,s=e.length-1;o<s;){for(var u=o,l=s,c=e[Math.floor(Math.random()*(s-o+1))+o];u<l;)if(i(e[u],c)>=0){var f=e[l];e[l]=e[u],e[u]=f,--l}else++u;i(e[u],c)>0&&--u,t<=u?s=u:o=u+1}return e[t]}})),pl=["ImmutableDenseMatrix"],hl=(0,i.d5)("Index",pl,(e=>{var{ImmutableDenseMatrix:t}=e;function n(e){if(!(this instanceof n))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((0,l.bR)(a))this._dimensions.push(a),this._isScalar=!1;else if(Array.isArray(a)||(0,l.SW)(a)){var o=r(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(r([a]));else{if("string"!=typeof a)throw new TypeError("Dimension must be an Array, Matrix, number, string, or Range");this._dimensions.push(a)}}}function r(e){for(var n=0,r=e.length;n<r;n++)if("number"!=typeof e[n]||!(0,u.U)(e[n]))throw new TypeError("Index parameters must be positive integer numbers");return new t(e)}return n.prototype.type="Index",n.prototype.isIndex=!0,n.prototype.clone=function(){var e=new n;return e._dimensions=(0,Ye.d9)(this._dimensions),e._isScalar=this._isScalar,e},n.create=function(e){var t=new n;return n.apply(t,e),t},n.prototype.size=function(){for(var e=[],t=0,n=this._dimensions.length;t<n;t++){var r=this._dimensions[t];e[t]="string"==typeof r?1:r.size()[0]}return e},n.prototype.max=function(){for(var e=[],t=0,n=this._dimensions.length;t<n;t++){var r=this._dimensions[t];e[t]="string"==typeof r?r:r.max()}return e},n.prototype.min=function(){for(var e=[],t=0,n=this._dimensions.length;t<n;t++){var r=this._dimensions[t];e[t]="string"==typeof r?r:r.min()}return e},n.prototype.forEach=function(e){for(var t=0,n=this._dimensions.length;t<n;t++)e(this._dimensions[t],t,this)},n.prototype.dimension=function(e){return this._dimensions[e]||null},n.prototype.isObjectProperty=function(){return 1===this._dimensions.length&&"string"==typeof this._dimensions[0]},n.prototype.getObjectProperty=function(){return this.isObjectProperty()?this._dimensions[0]:null},n.prototype.isScalar=function(){return this._isScalar},n.prototype.toArray=function(){for(var e=[],t=0,n=this._dimensions.length;t<n;t++){var r=this._dimensions[t];e.push("string"==typeof r?r:r.toArray())}return e},n.prototype.valueOf=n.prototype.toArray,n.prototype.toString=function(){for(var e=[],t=0,n=this._dimensions.length;t<n;t++){var r=this._dimensions[t];"string"==typeof r?e.push(JSON.stringify(r)):e.push(r.toString())}return"["+e.join(", ")+"]"},n.prototype.toJSON=function(){return{mathjs:"Index",dimensions:this._dimensions}},n.fromJSON=function(e){return n.create(e.dimensions)},n}),{isClass:!0}),ml="asech",vl=["typed","config","Complex","BigNumber"],yl=(0,i.d5)(ml,vl,(e=>{var{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(ml,{number:function(e){if(e<=1&&e>=-1||n.predictable){var t=1/e;if(t>0||n.predictable)return Wr(e);var i=Math.sqrt(t*t-1);return new r(Math.log(i-t),Math.PI)}return new r(e,0).asech()},Complex:function(e){return e.asech()},BigNumber:function(e){return new i(1).div(e).acosh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),gl=["typed"],_l=(0,i.d5)("tan",gl,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this,!0)}})})),bl="setDifference",xl=["typed","size","subset","compareNatural","Index","DenseMatrix"],wl=(0,i.d5)(bl,xl,(e=>{var{typed:t,size:n,subset:r,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(bl,{"Array | Matrix, Array | Matrix":function(e,t){var s;if(0===r(n(e),new a(0)))s=[];else{if(0===r(n(t),new a(0)))return(0,Ve.xH)(e.toArray());var u,l=(0,Ve.yV)((0,Ve.xH)(Array.isArray(e)?e:e.toArray()).sort(i)),c=(0,Ve.yV)((0,Ve.xH)(Array.isArray(t)?t:t.toArray()).sort(i));s=[];for(var f=0;f<l.length;f++){u=!1;for(var d=0;d<c.length;d++)if(0===i(l[f].value,c[d].value)&&l[f].identifier===c[d].identifier){u=!0;break}u||s.push(l[f])}}return Array.isArray(e)&&Array.isArray(t)?(0,Ve.D$)(s):new o((0,Ve.D$)(s))}})})),El="setIntersect",Nl=["typed","size","subset","compareNatural","Index","DenseMatrix"],Sl=(0,i.d5)(El,Nl,(e=>{var{typed:t,size:n,subset:r,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(El,{"Array | Matrix, Array | Matrix":function(e,t){var s;if(0===r(n(e),new a(0))||0===r(n(t),new a(0)))s=[];else{var u=(0,Ve.yV)((0,Ve.xH)(Array.isArray(e)?e:e.toArray()).sort(i)),l=(0,Ve.yV)((0,Ve.xH)(Array.isArray(t)?t:t.toArray()).sort(i));s=[];for(var c=0;c<u.length;c++)for(var f=0;f<l.length;f++)if(0===i(u[c].value,l[f].value)&&u[c].identifier===l[f].identifier){s.push(u[c]);break}}return Array.isArray(e)&&Array.isArray(t)?(0,Ve.D$)(s):new o((0,Ve.D$)(s))}})})),Ml="setMultiplicity",kl=["typed","size","subset","compareNatural","Index"],Ol=(0,i.d5)(Ml,kl,(e=>{var{typed:t,size:n,subset:r,compareNatural:i,Index:a}=e;return t(Ml,{"number | BigNumber | Fraction | Complex, Array | Matrix":function(e,t){if(0===r(n(t),new a(0)))return 0;for(var o=(0,Ve.xH)(Array.isArray(t)?t:t.toArray()),s=0,u=0;u<o.length;u++)0===i(o[u],e)&&s++;return s}})})),Cl="setSize",Al=["typed","compareNatural"],Tl=(0,i.d5)(Cl,Al,(e=>{var{typed:t,compareNatural:n}=e;return t(Cl,{"Array | Matrix":function(e){return Array.isArray(e)?(0,Ve.xH)(e).length:(0,Ve.xH)(e.toArray()).length},"Array | Matrix, boolean":function(e,t){if(!1===t||0===e.length)return Array.isArray(e)?(0,Ve.xH)(e).length:(0,Ve.xH)(e.toArray()).length;for(var r=(0,Ve.xH)(Array.isArray(e)?e:e.toArray()).sort(n),i=1,a=1;a<r.length;a++)0!==n(r[a],r[a-1])&&i++;return i}})})),Il=["typed","matrix","add"],Dl=(0,i.d5)("trace",Il,(e=>{var{typed:t,matrix:n,add:r}=e;return t("trace",{Array:function(e){return i(n(e))},SparseMatrix:function(e){var t=e._values,n=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 l=0;l<s;l++)for(var c=i[l],f=i[l+1],d=c;d<f;d++){var p=n[d];if(p===l){u=r(u,t[d]);break}if(p>l)break}return u}throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(a)+")")},DenseMatrix:i,any:Ye.d9});function i(e){var t=e._size,n=e._data;switch(t.length){case 1:if(1===t[0])return(0,Ye.d9)(n[0]);throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");case 2:var i=t[0];if(i===t[1]){for(var a=0,o=0;o<i;o++)a=r(a,n[o][o]);return a}throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+(0,Ke.WU)(t)+")")}}})),Pl=["typed","add","multiply","partitionSelect","compare"],jl=(0,i.d5)("quantileSeq",Pl,(e=>{var{typed:t,add:n,multiply:r,partitionSelect:i,compare:a}=e;function o(e,t,o){var u=(0,Ve.xH)(e),c=u.length;if(0===c)throw new Error("Cannot calculate quantile of an empty sequence");if((0,l.hj)(t)){var f=t*(c-1),d=f%1;if(0===d){var p=o?u[f]:i(u,f);return s(p),p}var h,m,v=Math.floor(f);if(o)h=u[v],m=u[v+1];else{m=i(u,v+1),h=u[v];for(var y=0;y<v;++y)a(u[y],h)>0&&(h=u[y])}return s(h),s(m),n(r(h,1-d),r(m,d))}var g=t.times(c-1);if(g.isInteger()){g=g.toNumber();var _=o?u[g]:i(u,g);return s(_),_}var b,x,w=g.floor(),E=g.minus(w),N=w.toNumber();if(o)b=u[N],x=u[N+1];else{x=i(u,N+1),b=u[N];for(var S=0;S<N;++S)a(u[S],b)>0&&(b=u[S])}s(b),s(x);var M=new E.constructor(1);return n(r(b,M.minus(E)),r(x,E))}var s=t({"number | BigNumber | Unit":function(e){return e}});return function(e,t,n){var r,i,a;if(arguments.length<2||arguments.length>3)throw new SyntaxError("Function quantileSeq requires two or three parameters");if((0,l.uZ)(e)){if("boolean"==typeof(n=n||!1)){if(i=e.valueOf(),(0,l.hj)(t)){if(t<0)throw new Error("N/prob must be non-negative");if(t<=1)return o(i,t,n);if(t>1){if(!(0,u.U)(t))throw new Error("N must be a positive integer");var s=t+1;r=new Array(t);for(var c=0;c<t;)r[c]=o(i,++c/s,n);return r}}if((0,l.l9)(t)){var f=t.constructor;if(t.isNegative())throw new Error("N/prob must be non-negative");if(a=new f(1),t.lte(a))return new f(o(i,t,n));if(t.gt(a)){if(!t.isInteger())throw new Error("N must be a positive integer");var d=t.toNumber();if(d>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 p=new f(d+1);r=new Array(d);for(var h=0;h<d;)r[h]=new f(o(i,new f(++h).div(p),n));return r}}if(Array.isArray(t)){r=new Array(t.length);for(var m=0;m<r.length;++m){var v=t[m];if((0,l.hj)(v)){if(v<0||v>1)throw new Error("Probability must be between 0 and 1, inclusive")}else{if(!(0,l.l9)(v))throw new TypeError("Unexpected type of argument in function quantileSeq");if(a=new v.constructor(1),v.isNegative()||v.gt(a))throw new Error("Probability must be between 0 and 1, inclusive")}r[m]=o(i,v,n)}return r}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")}}));function Rl(e){var t;if((0,u.U)(e))return e<=0?isFinite(e)?1/0:NaN:e>171?1/0:ji(1,e-1);if(e<.5)return Math.PI/(Math.sin(Math.PI*e)*Rl(1-e));if(e>=171.35)return 1/0;if(e>85){var n=e*e,r=n*e,i=r*e,a=i*e;return Math.sqrt(2*Math.PI/e)*Math.pow(e/Math.E,e)*(1+1/(12*e)+1/(288*n)-139/(51840*r)-571/(2488320*i)+163879/(209018880*a)+5246819/(75246796800*a*e))}--e,t=Bl[0];for(var o=1;o<Bl.length;++o)t+=Bl[o]/(e+o);var s=e+Ll+.5;return Math.sqrt(2*Math.PI)*Math.pow(s,e+.5)*Math.exp(-s)*t}Rl.signature="number";var Ll=4.7421875,Bl=[.9999999999999971,57.15623566586292,-59.59796035547549,14.136097974741746,-.4919138160976202,3399464998481189e-20,4652362892704858e-20,-9837447530487956e-20,.0001580887032249125,-.00021026444172410488,.00021743961811521265,-.0001643181065367639,8441822398385275e-20,-26190838401581408e-21,36899182659531625e-22],Ul="gamma",ql=["typed","config","multiplyScalar","pow","BigNumber","Complex"],zl=(0,i.d5)(Ul,ql,(e=>{var{typed:t,config:n,multiplyScalar:r,pow:i,BigNumber:a,Complex:o}=e;return t(Ul,{number:Rl,Complex:function(e){if(0===e.im)return this(e.re);e=new o(e.re-1,e.im);for(var t=new o(Bl[0],0),n=1;n<Bl.length;++n){var a=e.re+n,s=a*a+e.im*e.im;0!==s?(t.re+=Bl[n]*a/s,t.im+=-Bl[n]*e.im/s):t.re=Bl[n]<0?-1/0:1/0}var u=new o(e.re+Ll+.5,e.im),l=Math.sqrt(2*Math.PI);e.re+=.5;var c=i(u,e);0===c.im?c.re*=l:(0===c.re||(c.re*=l),c.im*=l);var f=Math.exp(-u.re);return u.re=f*Math.cos(-u.im),u.im=f*Math.sin(-u.im),r(r(c,u),t)},BigNumber:function(e){if(e.isInteger())return e.isNegative()||e.isZero()?new a(1/0):s(e.minus(1));if(!e.isFinite())return new a(e.isNegative()?NaN:1/0);throw new Error("Integer BigNumber expected")},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}});function s(e){if(e<8)return new a([1,1,2,6,24,120,720,5040][e]);var t=n.precision+(0|Math.log(e.toNumber())),r=a.clone({precision:t});if(e%2==1)return e.times(s(new a(e-1)));for(var i=e,o=new r(e),u=e.toNumber();i>2;)u+=i-=2,o=o.times(u);return new a(o.toPrecision(a.precision))}})),Fl=["typed","BigNumber"],Hl=(0,i.d5)("bignumber",Fl,(e=>{var{typed:t,BigNumber:n}=e;return t("bignumber",{"":function(){return new n(0)},number:function(e){return new n(e+"")},string:function(e){var t=e.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);if(t){var r=t[2],i=n(t[1]),a=new n(2).pow(Number(r));if(i.gt(a.sub(1)))throw new SyntaxError('String "'.concat(e,'" is out of range'));var o=new n(2).pow(Number(r)-1);return i.gte(o)?i.sub(a):i}return new n(e)},BigNumber:function(e){return e},Fraction:function(e){return new n(e.n).div(e.d).times(e.s)},null:function(e){return new n(0)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Zl=["typed","matrix","equalScalar"],Wl=(0,i.d5)("lcm",Zl,(e=>{var{typed:t,matrix:n,equalScalar:r}=e,i=So({typed:t,equalScalar:r}),a=Lo({typed:t,equalScalar:r}),o=To({typed:t,equalScalar:r}),s=_o({typed:t}),u=xo({typed:t});return t("lcm",{"number, number":Qt,"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;for(var n=e.times(t);!t.isZero();){var r=t;t=e.mod(r),e=r}return n.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(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, 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(n(e),t,this,!1).valueOf()},"number | BigNumber, Array":function(e,t){return u(n(t),e,this,!0).valueOf()},"Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber":function(e,t,n){for(var r=this(e,t),i=0;i<n.length;i++)r=this(r,n[i]);return r}})})),Gl="bitOr",Jl=["typed","matrix","equalScalar","DenseMatrix"],$l=(0,i.d5)(Gl,Jl,(e=>{var{typed:t,matrix:n,equalScalar:r,DenseMatrix:i}=e,a=po({typed:t}),o=mo({typed:t,equalScalar:r}),s=yo({typed:t,DenseMatrix:i}),u=_o({typed:t}),l=xo({typed:t});return t(Gl,{"number, number":Fn,"BigNumber, BigNumber":Dn,"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 l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(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()}})})),Vl="kron",Kl=["typed","matrix","multiplyScalar"],Yl=(0,i.d5)(Vl,Kl,(e=>{var{typed:t,matrix:n,multiplyScalar:r}=e;return t(Vl,{"Matrix, Matrix":function(e,t){return n(i(e.toArray(),t.toArray()))},"Matrix, Array":function(e,t){return n(i(e.toArray(),t))},"Array, Matrix":function(e,t){return n(i(e,t.toArray()))},"Array, Array":i});function i(e,t){if(1===(0,Ve.aJ)(e).length&&(e=[e]),1===(0,Ve.aJ)(t).length&&(t=[t]),(0,Ve.aJ)(e).length>2||(0,Ve.aJ)(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 n=[],i=[];return e.map((function(e){return t.map((function(t){return i=[],n.push(i),e.map((function(e){return t.map((function(t){return i.push(r(e,t))}))}))}))}))&&n}})),Xl=["typed","matrix"],Ql=(0,i.d5)("transpose",Xl,(e=>{var{typed:t,matrix:n}=e;return t("transpose",{Array:function(e){return this(n(e)).valueOf()},Matrix:function(e){var t,n=e.size();switch(n.length){case 1:t=e.clone();break;case 2:var r=n[0],i=n[1];if(0===i)throw new RangeError("Cannot transpose a 2D matrix with no columns (size: "+(0,Ke.WU)(n)+")");switch(e.storage()){case"dense":t=function(e,t,n){for(var r,i=e._data,a=[],o=0;o<n;o++){r=a[o]=[];for(var s=0;s<t;s++)r[s]=(0,Ye.d9)(i[s][o])}return e.createDenseMatrix({data:a,size:[n,t],datatype:e._datatype})}(e,r,i);break;case"sparse":t=function(e,t,n){for(var r,i,a,o=e._values,s=e._index,u=e._ptr,l=o?[]:void 0,c=[],f=[],d=[],p=0;p<t;p++)d[p]=0;for(r=0,i=s.length;r<i;r++)d[s[r]]++;for(var h=0,m=0;m<t;m++)f.push(h),h+=d[m],d[m]=f[m];for(f.push(h),a=0;a<n;a++)for(var v=u[a],y=u[a+1],g=v;g<y;g++){var _=d[s[g]]++;c[_]=a,o&&(l[_]=(0,Ye.d9)(o[g]))}return e.createSparseMatrix({values:l,index:c,ptr:f,size:[n,t],datatype:e._datatype})}(e,r,i)}break;default:throw new RangeError("Matrix must be a vector or two dimensional (size: "+(0,Ke.WU)(this._size)+")")}return t},any:function(e){return(0,Ye.d9)(e)}})})),ec=["number","?bignumber","?fraction"],tc=(0,i.d5)("numeric",ec,(e=>{var{number:t,bignumber:n,fraction:r}=e,i={string:!0,number:!0,BigNumber:!0,Fraction:!0},a={number:e=>t(e),BigNumber:n?e=>n(e):fs.R3,Fraction:r?e=>r(e):fs.nG};return function(e,t){var n=(0,l.kM)(e);if(!(n in i))throw new TypeError("Cannot convert "+e+' of type "'+n+'"; 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===n?e:a[t](e)}})),nc=["typed","matrix","equalScalar","zeros","not"],rc=(0,i.d5)("and",nc,(e=>{var{typed:t,matrix:n,equalScalar:r,zeros:i,not:a}=e,o=So({typed:t,equalScalar:r}),s=Lo({typed:t,equalScalar:r}),u=To({typed:t,equalScalar:r}),l=_o({typed:t}),c=xo({typed:t});return t("and",{"number, number":ir,"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 l(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 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()):c(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()):c(t,e,this,!0)},"Array, any":function(e,t){return this(n(e),t).valueOf()},"any, Array":function(e,t){return this(e,n(t)).valueOf()}})})),ic="smallerEq",ac=["typed","config","matrix","DenseMatrix"],oc=(0,i.d5)(ic,ac,(e=>{var{typed:t,config:n,matrix:r,DenseMatrix:i}=e,a=ko({typed:t}),o=$o({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),l=_o({typed:t}),c=xo({typed:t});return t(ic,{"boolean, boolean":function(e,t){return e<=t},"number, number":function(e,t){return e<=t||(0,u.RI)(e,t,n.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lte(t)||Mt(e,t,n.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 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 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()}})})),sc="sort",uc=["typed","matrix","compare","compareNatural"],lc=(0,i.d5)(sc,uc,(e=>{var{typed:t,matrix:n,compare:r,compareNatural:i}=e,a=r,o=(e,t)=>-r(e,t);return t(sc,{Array:function(e){return u(e),e.sort(a)},Matrix:function(e){return l(e),n(e.toArray().sort(a),e.storage())},"Array, function":function(e,t){return u(e),e.sort(t)},"Matrix, function":function(e,t){return l(e),n(e.toArray().sort(t),e.storage())},"Array, string":function(e,t){return u(e),e.sort(s(t))},"Matrix, string":function(e,t){return l(e),n(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!==(0,Ve.aJ)(e).length)throw new Error("One dimensional array expected")}function l(e){if(1!==e.size().length)throw new Error("One dimensional matrix expected")}})),cc=["typed","BigNumber"],fc=(0,i.d5)("cot",cc,(e=>{var{typed:t,BigNumber:n}=e;return t("cot",{number:$r,Complex:function(e){return e.cot()},BigNumber:function(e){return new n(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(0,ut.Fh)(e,this)}})})),dc="setDistinct",pc=["typed","size","subset","compareNatural","Index","DenseMatrix"],hc=(0,i.d5)(dc,pc,(e=>{var{typed:t,size:n,subset:r,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(dc,{"Array | Matrix":function(e){var t;if(0===r(n(e),new a(0)))t=[];else{var s=(0,Ve.xH)(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)}})})),mc="setPowerset",vc=["typed","size","subset","compareNatural","Index"],yc=(0,i.d5)(mc,vc,(e=>{var{typed:t,size:n,subset:r,compareNatural:i,Index:a}=e;return t(mc,{"Array | Matrix":function(e){if(0===r(n(e),new a(0)))return[];for(var t=(0,Ve.xH)(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=[],n=e.length-1;n>0;n--)for(var r=0;r<n;r++)e[r].length>e[r+1].length&&(t=e[r],e[r]=e[r+1],e[r+1]=t);return e}(s)}});function o(e,t){for(var n=[],r=0;r<t.length;r++)"1"===t[r]&&n.push(e[r]);return n}})),gc="index",_c=["typed","Index"],bc=(0,i.d5)(gc,_c,(e=>{var{typed:t,Index:n}=e;return t(gc,{"...number | string | BigNumber | Range | Array | Matrix":function(e){var t=e.map((function(e){return(0,l.l9)(e)?e.toNumber():Array.isArray(e)||(0,l.SW)(e)?e.map((function(e){return(0,l.l9)(e)?e.toNumber():e})):e})),r=new n;return n.apply(r,t),r}})})),xc="factorial",wc=["typed","gamma"],Ec=(0,i.d5)(xc,wc,(e=>{var{typed:t,gamma:n}=e;return t(xc,{number:function(e){if(e<0)throw new Error("Value must be non-negative");return n(e+1)},BigNumber:function(e){if(e.isNegative())throw new Error("Value must be non-negative");return n(e.plus(1))},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Nc="permutations",Sc=["typed","factorial"],Mc=(0,i.d5)(Nc,Sc,(e=>{var{typed:t,factorial:n}=e;return t(Nc,{"number | BigNumber":n,"number, number":function(e,t){if(!(0,u.U)(e)||e<0)throw new TypeError("Positive integer value expected in function permutations");if(!(0,u.U)(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 ji(e-t+1,e)},"BigNumber, BigNumber":function(e,t){var n,r;if(!kc(e)||!kc(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(n=e.mul(0).add(1),r=e.minus(t).plus(1);r.lte(e);r=r.plus(1))n=n.times(r);return n}})}));function kc(e){return e.isInteger()&&e.gte(0)}var Oc=["typed","config","round","matrix","equalScalar"],Cc=(0,i.d5)("ceil",Oc,(e=>{var{typed:t,config:n,round:r,matrix:i,equalScalar:a}=e,o=To({typed:t,equalScalar:a}),s=xo({typed:t});return t("ceil",{number:function(e){return(0,u.RI)(e,r(e),n.epsilon)?r(e):$t(e)},"number, number":function(e,t){if((0,u.RI)(e,r(e,t),n.epsilon))return r(e,t);var[i,a]="".concat(e,"e").split("e"),o=Math.ceil(Number("".concat(i,"e").concat(Number(a)+t)));return[i,a]="".concat(o,"e").split("e"),Number("".concat(i,"e").concat(Number(a)-t))},Complex:function(e){return e.ceil()},"Complex, number":function(e,t){return e.ceil(t)},BigNumber:function(e){return Mt(e,r(e),n.epsilon)?r(e):e.ceil()},"BigNumber, BigNumber":function(e,t){return Mt(e,r(e,t),n.epsilon)?r(e,t):e.toDecimalPlaces(t.toNumber(),z.ROUND_CEIL)},Fraction:function(e){return e.ceil()},"Fraction, number":function(e,t){return e.ceil(t)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},"Array | Matrix, number":function(e,t){return(0,ut.Fh)(e,(e=>this(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()}})})),Ac="subtract",Tc=["typed","matrix","equalScalar","addScalar","unaryMinus","DenseMatrix"],Ic=(0,i.d5)(Ac,Tc,(e=>{var{typed:t,matrix:n,equalScalar:r,addScalar:i,unaryMinus:a,DenseMatrix:o}=e,s=po({typed:t}),u=ko({typed:t}),l=Co({typed:t,equalScalar:r}),c=yo({typed:t,DenseMatrix:o}),f=_o({typed:t}),d=xo({typed:t});return t(Ac,{"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 n=e.clone();return n.value=this(n.value,t.value),n.fixPrefix=!1,n},"SparseMatrix, SparseMatrix":function(e,t){return Dc(e,t),l(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return Dc(e,t),u(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return Dc(e,t),s(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return Dc(e,t),f(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 c(e,a(t),i)},"DenseMatrix, any":function(e,t){return d(e,t,this)},"any, SparseMatrix":function(e,t){return c(t,e,this,!0)},"any, DenseMatrix":function(e,t){return d(t,e,this,!0)},"Array, any":function(e,t){return d(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return d(n(t),e,this,!0).valueOf()}})}));function Dc(e,t){var n=e.size(),r=t.size();if(n.length!==r.length)throw new Xe.m(n.length,r.length)}var Pc="cross",jc=["typed","matrix","subtract","multiply"],Rc=(0,i.d5)(Pc,jc,(e=>{var{typed:t,matrix:n,subtract:r,multiply:i}=e;return t(Pc,{"Matrix, Matrix":function(e,t){return n(a(e.toArray(),t.toArray()))},"Matrix, Array":function(e,t){return n(a(e.toArray(),t))},"Array, Matrix":function(e,t){return n(a(e,t.toArray()))},"Array, Array":a});function a(e,t){var n=Math.max((0,Ve.aJ)(e).length,(0,Ve.aJ)(t).length);e=(0,Ve.L9)(e),t=(0,Ve.L9)(t);var a=(0,Ve.aJ)(e),o=(0,Ve.aJ)(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=[r(i(e[1],t[2]),i(e[2],t[1])),r(i(e[2],t[0]),i(e[0],t[2])),r(i(e[0],t[1]),i(e[1],t[0]))];return n>1?[s]:s}})),Lc=n(7635),Bc="prod",Uc=["typed","config","multiplyScalar","numeric"],qc=(0,i.d5)(Bc,Uc,(e=>{var{typed:t,config:n,multiplyScalar:r,numeric:i}=e;return t(Bc,{"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((0,ut.Et)(e,(function(e){try{t=void 0===t?e:r(t,e)}catch(t){throw(0,Lc.x)(t,"prod",e)}})),"string"==typeof t&&(t=i(t,n.number)),void 0===t)throw new Error("Cannot calculate prod of an empty array");return t}})),zc="equal",Fc=["typed","matrix","equalScalar","DenseMatrix"],Hc=(0,i.d5)(zc,Fc,(e=>{var{typed:t,matrix:n,equalScalar:r,DenseMatrix:i}=e,a=ko({typed:t}),o=$o({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),u=_o({typed:t}),l=xo({typed:t});return t(zc,{"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)},"SparseMatrix, SparseMatrix":function(e,t){return o(e,t,r)},"SparseMatrix, DenseMatrix":function(e,t){return a(t,e,r,!0)},"DenseMatrix, SparseMatrix":function(e,t){return a(e,t,r,!1)},"DenseMatrix, DenseMatrix":function(e,t){return u(e,t,r)},"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,r,!1)},"DenseMatrix, any":function(e,t){return l(e,t,r,!1)},"any, SparseMatrix":function(e,t){return s(t,e,r,!0)},"any, DenseMatrix":function(e,t){return l(t,e,r,!0)},"Array, any":function(e,t){return l(n(e),t,r,!1).valueOf()},"any, Array":function(e,t){return l(n(t),e,r,!0).valueOf()}})})),Zc=((0,i.d5)(zc,["typed","equalScalar"],(e=>{var{typed:t,equalScalar:n}=e;return t(zc,{"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)}})})),"setCartesian"),Wc=["typed","size","subset","compareNatural","Index","DenseMatrix"],Gc=(0,i.d5)(Zc,Wc,(e=>{var{typed:t,size:n,subset:r,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(Zc,{"Array | Matrix, Array | Matrix":function(e,t){var s=[];if(0!==r(n(e),new a(0))&&0!==r(n(t),new a(0))){var u=(0,Ve.xH)(Array.isArray(e)?e:e.toArray()).sort(i),l=(0,Ve.xH)(Array.isArray(t)?t:t.toArray()).sort(i);s=[];for(var c=0;c<u.length;c++)for(var f=0;f<l.length;f++)s.push([u[c],l[f]])}return Array.isArray(e)&&Array.isArray(t)?s:new o(s)}})})),Jc="setSymDifference",$c=["typed","size","concat","subset","setDifference","Index"],Vc=(0,i.d5)(Jc,$c,(e=>{var{typed:t,size:n,concat:r,subset:i,setDifference:a,Index:o}=e;return t(Jc,{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(n(e),new o(0)))return(0,Ve.xH)(t);if(0===i(n(t),new o(0)))return(0,Ve.xH)(e);var s=(0,Ve.xH)(e),u=(0,Ve.xH)(t);return r(a(s,u),a(u,s))}})})),Kc=["typed","Complex","matrix","ceil","floor"],Yc=(0,i.d5)("fix",Kc,(e=>{var{typed:t,Complex:n,matrix:r,ceil:i,floor:a}=e,o=xo({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 n(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 n(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(0,ut.Fh)(e,this,!0)},"Array | Matrix, number | BigNumber":function(e,t){return(0,ut.Fh)(e,(e=>this(e,t)),!0)},"number | Complex | BigNumber, Array":function(e,t){return o(r(t),e,this,!0).valueOf()}})})),Xc="ctranspose",Qc=["typed","transpose","conj"],ef=(0,i.d5)(Xc,Qc,(e=>{var{typed:t,transpose:n,conj:r}=e;return t(Xc,{any:function(e){return r(n(e))}})})),tf="deepEqual",nf=["typed","equal"],rf=(0,i.d5)(tf,nf,(e=>{var{typed:t,equal:n}=e;return t(tf,{"any, any":function(e,t){return r(e.valueOf(),t.valueOf())}});function r(e,t){if(Array.isArray(e)){if(Array.isArray(t)){var i=e.length;if(i!==t.length)return!1;for(var a=0;a<i;a++)if(!r(e[a],t[a]))return!1;return!0}return!1}return!Array.isArray(t)&&n(e,t)}})),af="setIsSubset",of=["typed","size","subset","compareNatural","Index"],sf=(0,i.d5)(af,of,(e=>{var{typed:t,size:n,subset:r,compareNatural:i,Index:a}=e;return t(af,{"Array | Matrix, Array | Matrix":function(e,t){if(0===r(n(e),new a(0)))return!0;if(0===r(n(t),new a(0)))return!1;for(var o,s=(0,Ve.yV)((0,Ve.xH)(Array.isArray(e)?e:e.toArray()).sort(i)),u=(0,Ve.yV)((0,Ve.xH)(Array.isArray(t)?t:t.toArray()).sort(i)),l=0;l<s.length;l++){o=!1;for(var c=0;c<u.length;c++)if(0===i(s[l].value,u[c].value)&&s[l].identifier===u[c].identifier){o=!0;break}if(!1===o)return!1}return!0}})})),uf=["typed","matrix","DenseMatrix"],lf=(0,i.d5)("xor",uf,(e=>{var{typed:t,matrix:n,DenseMatrix:r}=e,i=ko({typed:t}),a=$o({typed:t,DenseMatrix:r}),o=Do({typed:t,DenseMatrix:r}),s=_o({typed:t}),u=xo({typed:t});return t("xor",{"number, number":rr,"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(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 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(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return u(n(t),e,this,!0).valueOf()}})})),cf="divideScalar",ff=["typed","numeric"],df=(0,i.d5)(cf,ff,(e=>{var{typed:t,numeric:n}=e;return t(cf,{"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 r=e.clone(),i=n(1,(0,l.kM)(t));return r.value=this(null===r.value?r._normalize(i):r.value,t),r},"number | Fraction | BigNumber, Unit":function(e,t){var r=t.clone();r=r.pow(-1);var i=n(1,(0,l.kM)(e));return r.value=this(e,null===t.value?t._normalize(i):t.value),r},"Unit, Unit":function(e,t){return e.divide(t)}})})),pf="nthRoots",hf=["config","typed","divideScalar","Complex"],mf=(0,i.d5)(pf,hf,(e=>{var{typed:t,config:n,divideScalar:r,Complex:i}=e,a=[function(e){return new i(e,0)},function(e){return new i(0,e)},function(e){return new i(-e,0)},function(e){return new i(0,-e)}];function o(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 i(0,0)];var n,r="number"==typeof e;(r||0===e.re||0===e.im)&&(n=r?2*+(e<0):0===e.im?2*+(e.re<0):2*+(e.im<0)+1);for(var o=e.arg(),s=e.abs(),u=[],l=Math.pow(s,1/t),c=0;c<t;c++){var f=(n+4*c)/t;f!==Math.round(f)?u.push(new i({r:l,phi:(o+2*Math.PI*c)/t})):u.push(a[f%4](l))}return u}return t(pf,{Complex:function(e){return o(e,2)},"Complex, number":o})}));function vf(e){var{DenseMatrix:t}=e;return function(e,n,r){var i=e.size();if(2!==i.length)throw new RangeError("Matrix must be two dimensional (size: "+(0,Ke.WU)(i)+")");var a=i[0];if(a!==i[1])throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(i)+")");var o=[];if((0,l.SW)(n)){var s=n.size(),u=n._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:n._datatype})}if(2===s.length){if(s[0]!==a||1!==s[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");if((0,l.jH)(n)){if(r){o=[];for(var f=0;f<a;f++)o[f]=[u[f][0]];return new t({data:o,size:[a,1],datatype:n._datatype})}return n}if((0,l.sA)(n)){for(var d=0;d<a;d++)o[d]=[0];for(var p=n._values,h=n._index,m=n._ptr,v=m[1],y=m[0];y<v;y++)o[h[y]][0]=p[y];return new t({data:o,size:[a,1],datatype:n._datatype})}}throw new RangeError("Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.")}if((0,l.kJ)(n)){var g=(0,Ve.aJ)(n);if(1===g.length){if(g[0]!==a)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(var _=0;_<a;_++)o[_]=[n[_]];return new t({data:o,size:[a,1]})}if(2===g.length){if(g[0]!==a||1!==g[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(var b=0;b<a;b++)o[b]=[n[b][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 yf="lsolve",gf=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],_f=(0,i.d5)(yf,gf,(e=>{var{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(yf,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var n=(t=u(e,t,!0))._data,l=e._size[0],c=e._size[1],f=e._values,d=e._index,p=e._ptr,h=[],m=0;m<c;m++){var v=n[m][0]||0;if(o(v,0))h[m]=[0];else{for(var y=0,g=[],_=[],b=p[m],x=p[m+1],w=b;w<x;w++){var E=d[w];E===m?y=f[w]:E>m&&(g.push(f[w]),_.push(E))}if(o(y,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var N=r(v,y),S=0,M=_.length;S<M;S++){var k=_[S];n[k]=[a(n[k][0]||0,i(N,g[S]))]}h[m]=[N]}}return new s({data:h,size:[l,1]})}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return l(e,t)},"Array, Array | Matrix":function(e,t){return l(n(e),t).valueOf()}});function l(e,t){for(var n=(t=u(e,t,!0))._data,l=e._size[0],c=e._size[1],f=[],d=e._data,p=0;p<c;p++){var h=n[p][0]||0,m=void 0;if(o(h,0))m=0;else{var v=d[p][p];if(o(v,0))throw new Error("Linear system cannot be solved since matrix is singular");m=r(h,v);for(var y=p+1;y<l;y++)n[y]=[a(n[y][0]||0,i(m,d[y][p]))]}f[p]=[m]}return new s({data:f,size:[l,1]})}})),bf="lsolveAll",xf=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],wf=(0,i.d5)(bf,xf,(e=>{var{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(bf,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var n=[u(e,t,!0)._data.map((e=>e[0]))],l=e._size[0],c=e._size[1],f=e._values,d=e._index,p=e._ptr,h=0;h<c;h++)for(var m=n.length,v=0;v<m;v++){for(var y=n[v],g=[],_=[],b=p[h],x=p[h+1],w=0,E=b;E<x;E++){var N=d[E];N===h?w=f[E]:N>h&&(g.push(f[E]),_.push(N))}if(o(w,0))if(o(y[h],0)){if(0===v){var S=[...y];S[h]=1;for(var M=0,k=_.length;M<k;M++){var O=_[M];S[O]=a(S[O],g[M])}n.push(S)}}else{if(0===v)return[];n.splice(v,1),v-=1,m-=1}else{y[h]=r(y[h],w);for(var C=0,A=_.length;C<A;C++){var T=_[C];y[T]=a(y[T],i(y[h],g[C]))}}}return n.map((e=>new s({data:e.map((e=>[e])),size:[l,1]})))}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return l(e,t)},"Array, Array | Matrix":function(e,t){return l(n(e),t).map((e=>e.valueOf()))}});function l(e,t){for(var n=[u(e,t,!0)._data.map((e=>e[0]))],l=e._data,c=e._size[0],f=e._size[1],d=0;d<f;d++)for(var p=n.length,h=0;h<p;h++){var m=n[h];if(o(l[d][d],0))if(o(m[d],0)){if(0===h){var v=[...m];v[d]=1;for(var y=d+1;y<f;y++)v[y]=a(v[y],l[y][d]);n.push(v)}}else{if(0===h)return[];n.splice(h,1),h-=1,p-=1}else{m[d]=r(m[d],l[d][d]);for(var g=d+1;g<f;g++)m[g]=a(m[g],i(m[d],l[g][d]))}}return n.map((e=>new s({data:e.map((e=>[e])),size:[c,1]})))}})),Ef=["addScalar","equalScalar","FibonacciHeap"],Nf=(0,i.d5)("Spa",Ef,(e=>{var{addScalar:t,equalScalar:n,FibonacciHeap:r}=e;function i(){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");this._values=[],this._heap=new r}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 n=this._heap.insert(e,t);this._values[e]=n}},i.prototype.get=function(e){var t=this._values[e];return t?t.value:0},i.prototype.accumulate=function(e,n){var r=this._values[e];r?r.value=t(r.value,n):(r=this._heap.insert(e,n),this._values[e]=r)},i.prototype.forEach=function(e,t,r){var i=this._heap,a=this._values,o=[],s=i.extractMinimum();for(s&&o.push(s);s&&s.key<=t;)s.key>=e&&(n(s.value,0)||r(s.key,s.value,this)),(s=i.extractMinimum())&&o.push(s);for(var u=0;u<o.length;u++){var l=o[u];a[(s=i.insert(l.key,l.value)).key]=s}},i.prototype.swap=function(e,t){var n=this._values[e],r=this._values[t];if(!n&&r)n=this._heap.insert(e,r.value),this._heap.remove(r),this._values[e]=n,this._values[t]=void 0;else if(n&&!r)r=this._heap.insert(t,n.value),this._heap.remove(n),this._values[t]=r,this._values[e]=void 0;else if(n&&r){var i=n.value;n.value=r.value,r.value=i}},i}),{isClass:!0}),Sf="setUnion",Mf=["typed","size","concat","subset","setIntersect","setSymDifference","Index"],kf=(0,i.d5)(Sf,Mf,(e=>{var{typed:t,size:n,concat:r,subset:i,setIntersect:a,setSymDifference:o,Index:s}=e;return t(Sf,{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(n(e),new s(0)))return(0,Ve.xH)(t);if(0===i(n(t),new s(0)))return(0,Ve.xH)(e);var u=(0,Ve.xH)(e),l=(0,Ve.xH)(t);return r(o(u,l),a(u,l))}})})),Of=["typed","matrix","abs","addScalar","divideScalar","multiplyScalar","subtract","larger","equalScalar","unaryMinus","DenseMatrix","SparseMatrix","Spa"],Cf=(0,i.d5)("lup",Of,(e=>{var{typed:t,matrix:n,abs:r,addScalar:i,divideScalar:a,multiplyScalar:o,subtract:s,larger:u,equalScalar:l,unaryMinus:c,DenseMatrix:f,SparseMatrix:d,Spa:p}=e;return t("lup",{DenseMatrix:function(e){return h(e)},SparseMatrix:function(e){return function(e){var t,n,i,s=e._size[0],f=e._size[1],h=Math.min(s,f),m=e._values,v=e._index,y=e._ptr,g=[],_=[],b=[],x=[s,h],w=[],E=[],N=[],S=[h,f],M=[],k=[];for(t=0;t<s;t++)M[t]=t,k[t]=t;var O=function(){var e=new p;n<s&&(b.push(g.length),g.push(1),_.push(n)),N.push(w.length);var f=y[n],h=y[n+1];for(i=f;i<h;i++)t=v[i],e.set(M[t],m[i]);n>0&&e.forEach(0,n-1,(function(t,n){d._forEachRow(t,g,_,b,(function(r,i){r>t&&e.accumulate(r,c(o(i,n)))}))}));var O,C,A,T,I=n,D=e.get(n),P=r(D);e.forEach(n+1,s-1,(function(e,t){var n=r(t);u(n,P)&&(I=e,P=n,D=t)})),n!==I&&(d._swapRows(n,I,x[1],g,_,b),d._swapRows(n,I,S[1],w,E,N),e.swap(n,I),C=I,A=k[O=n],T=k[C],M[A]=C,M[T]=O,k[O]=T,k[C]=A),e.forEach(0,s-1,(function(e,t){e<=n?(w.push(t),E.push(e)):(t=a(t,D),l(t,0)||(g.push(t),_.push(e)))}))};for(n=0;n<f;n++)O();return N.push(w.length),b.push(g.length),{L:new d({values:g,index:_,ptr:b,size:x}),U:new d({values:w,index:E,ptr:N,size:S}),p:M,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}(e)},Array:function(e){var t=h(n(e));return{L:t.L.valueOf(),U:t.U.valueOf(),p:t.p}}});function h(e){var t,n,c,d=e._size[0],p=e._size[1],h=Math.min(d,p),m=(0,Ye.d9)(e._data),v=[],y=[d,h],g=[],_=[h,p],b=[];for(t=0;t<d;t++)b[t]=t;for(n=0;n<p;n++){if(n>0)for(t=0;t<d;t++){var x=Math.min(t,n),w=0;for(c=0;c<x;c++)w=i(w,o(m[t][c],m[c][n]));m[t][n]=s(m[t][n],w)}var E=n,N=0,S=0;for(t=n;t<d;t++){var M=m[t][n],k=r(M);u(k,N)&&(E=t,N=k,S=M)}if(n!==E&&(b[n]=[b[E],b[E]=b[n]][0],f._swapRows(n,E,m)),n<d)for(t=n+1;t<d;t++){var O=m[t][n];l(O,0)||(m[t][n]=a(m[t][n],S))}}for(n=0;n<p;n++)for(t=0;t<d;t++)0===n&&(t<p&&(g[t]=[]),v[t]=[]),t<n?(t<p&&(g[t][n]=m[t][n]),n<d&&(v[t][n]=0)):t!==n?(t<p&&(g[t][n]=0),n<d&&(v[t][n]=m[t][n])):(t<p&&(g[t][n]=m[t][n]),n<d&&(v[t][n]=1));var C=new f({data:v,size:y}),A=new f({data:g,size:_}),T=[];for(t=0,h=b.length;t<h;t++)T[b[t]]=t;return{L:C,U:A,p:T,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}}));function Af(e,t,n,r,i,a,o){var s=0;for(n[o]=e;s>=0;){var u=n[o+s],l=n[r+u];-1===l?(s--,a[t++]=u):(n[r+u]=n[i+l],n[o+ ++s]=l)}return t}function Tf(e){return-e-2}var If=["add","multiply","transpose"],Df=(0,i.d5)("csAmd",If,(e=>{var{add:t,multiply:n,transpose:r}=e;return function(e,o){if(!o||e<=0||e>3)return null;var s=o._size,u=s[0],l=s[1],c=0,f=Math.max(16,10*Math.sqrt(l)),d=function(e,i,a,o,s){var u=r(i);if(1===e&&o===a)return t(i,u);if(2===e){for(var l=u._index,c=u._ptr,f=0,d=0;d<a;d++){var p=c[d];if(c[d]=f,!(c[d+1]-p>s))for(var h=c[d+1];p<h;p++)l[f++]=l[p]}return c[a]=f,i=r(u),n(u,i)}return n(u,i)}(e,o,u,l,f=Math.min(l-2,f));!function(e,t,n){for(var r=e._values,i=e._index,a=e._ptr,o=e._size[1],s=0,u=0;u<o;u++){var l=a[u];for(a[u]=s;l<a[u+1];l++)t(i[l],u,r?r[l]:1,null)&&(i[s]=i[l],r&&(r[s]=r[l]),s++)}a[o]=s,i.splice(s,i.length-s),r&&r.splice(s,r.length-s)}(d,a);for(var p,h,m,v,y,g,_,b,x,w,E,N,S,M,k,O,C=d._index,A=d._ptr,T=A[l],I=[],D=[],P=l+1,j=2*(l+1),R=3*(l+1),L=4*(l+1),B=5*(l+1),U=6*(l+1),q=7*(l+1),z=I,F=function(e,t,n,r,a,o,s,u,l,c,f,d){for(var p=0;p<e;p++)n[0+p]=t[p+1]-t[p];n[0+e]=0;for(var h=0;h<=e;h++)n[a+h]=-1,o[h]=-1,n[s+h]=-1,n[u+h]=-1,n[l+h]=1,n[c+h]=1,n[f+h]=0,n[d+h]=n[0+h];var m=i(0,0,n,c,e);return n[f+e]=-2,t[e]=-1,n[c+e]=0,m}(l,A,D,0,R,z,j,q,P,U,L,B),H=function(e,t,n,r,i,a,o,s,u,l,c){for(var f=0,d=0;d<e;d++){var p=n[r+d];if(0===p)n[i+d]=-2,f++,t[d]=-1,n[a+d]=0;else if(p>o)n[s+d]=0,n[i+d]=-1,f++,t[d]=Tf(e),n[s+e]++;else{var h=n[u+p];-1!==h&&(l[h]=d),n[c+d]=n[u+p],n[u+p]=d}}return f}(l,A,D,B,L,U,f,P,R,z,j),Z=0;H<l;){for(m=-1;Z<l&&-1===(m=D[R+Z]);Z++);-1!==D[j+m]&&(z[D[j+m]]=-1),D[R+Z]=D[j+m];var W=D[L+m],G=D[P+m];H+=G;var J=0;D[P+m]=-G;var $=A[m],V=0===W?$:T,K=V;for(v=1;v<=W+1;v++){for(v>W?(g=m,_=$,b=D[0+m]-W):(_=A[g=C[$++]],b=D[0+g]),y=1;y<=b;y++)(x=D[P+(p=C[_++])])<=0||(J+=x,D[P+p]=-x,C[K++]=p,-1!==D[j+p]&&(z[D[j+p]]=z[p]),-1!==z[p]?D[j+z[p]]=D[j+p]:D[R+D[B+p]]=D[j+p]);g!==m&&(A[g]=Tf(m),D[U+g]=0)}for(0!==W&&(T=K),D[B+m]=J,A[m]=V,D[0+m]=K-V,D[L+m]=-2,F=i(F,c,D,U,l),w=V;w<K;w++)if(!((E=D[L+(p=C[w])])<=0)){var Y=F-(x=-D[P+p]);for($=A[p],N=A[p]+E-1;$<=N;$++)D[U+(g=C[$])]>=F?D[U+g]-=x:0!==D[U+g]&&(D[U+g]=D[B+g]+Y)}for(w=V;w<K;w++){for(S=(N=A[p=C[w]])+D[L+p]-1,M=N,k=0,O=0,$=N;$<=S;$++)if(0!==D[U+(g=C[$])]){var X=D[U+g]-F;X>0?(O+=X,C[M++]=g,k+=g):(A[g]=Tf(m),D[U+g]=0)}D[L+p]=M-N+1;var Q=M,ee=N+D[0+p];for($=S+1;$<ee;$++){var te=D[P+(h=C[$])];te<=0||(O+=te,C[M++]=h,k+=h)}0===O?(A[p]=Tf(m),J-=x=-D[P+p],G+=x,H+=x,D[P+p]=0,D[L+p]=-1):(D[B+p]=Math.min(D[B+p],O),C[M]=C[Q],C[Q]=C[N],C[N]=m,D[0+p]=M-N+1,k=(k<0?-k:k)%l,D[j+p]=D[q+k],D[q+k]=p,z[p]=k)}for(D[B+m]=J,F=i(F+(c=Math.max(c,J)),c,D,U,l),w=V;w<K;w++)if(!(D[P+(p=C[w])]>=0))for(p=D[q+(k=z[p])],D[q+k]=-1;-1!==p&&-1!==D[j+p];p=D[j+p],F++){for(b=D[0+p],E=D[L+p],$=A[p]+1;$<=A[p]+b-1;$++)D[U+C[$]]=F;var ne=p;for(h=D[j+p];-1!==h;){var re=D[0+h]===b&&D[L+h]===E;for($=A[h]+1;re&&$<=A[h]+b-1;$++)D[U+C[$]]!==F&&(re=0);re?(A[h]=Tf(p),D[P+p]+=D[P+h],D[P+h]=0,D[L+h]=-1,h=D[j+h],D[j+ne]=h):(ne=h,h=D[j+h])}}for($=V,w=V;w<K;w++)(x=-D[P+(p=C[w])])<=0||(D[P+p]=x,O=D[B+p]+J-x,-1!==D[R+(O=Math.min(O,l-H-x))]&&(z[D[R+O]]=p),D[j+p]=D[R+O],z[p]=-1,D[R+O]=p,Z=Math.min(Z,O),D[B+p]=O,C[$++]=p);D[P+m]=G,0==(D[0+m]=$-V)&&(A[m]=-1,D[U+m]=0),0!==W&&(T=$)}for(p=0;p<l;p++)A[p]=Tf(A[p]);for(h=0;h<=l;h++)D[R+h]=-1;for(h=l;h>=0;h--)D[P+h]>0||(D[j+h]=D[R+A[h]],D[R+A[h]]=h);for(g=l;g>=0;g--)D[P+g]<=0||-1!==A[g]&&(D[j+g]=D[R+A[g]],D[R+A[g]]=g);for(m=0,p=0;p<=l;p++)-1===A[p]&&(m=Af(p,m,D,R,j,I,U));return I.splice(I.length-1,1),I};function i(e,t,n,r,i){if(e<2||e+t<0){for(var a=0;a<i;a++)0!==n[r+a]&&(n[r+a]=1);e=2}return e}function a(e,t){return e!==t}}));function Pf(e,t,n,r,i,a,o){var s,u,l,c=0;if(e<=t||n[r+t]<=n[i+e])return-1;n[i+e]=n[r+t];var f=n[a+e];if(n[a+e]=t,-1===f)c=1,l=e;else{for(c=2,l=f;l!==n[o+l];l=n[o+l]);for(s=f;s!==l;s=u)u=n[o+s],n[o+s]=l}return{jleaf:c,q:l}}var jf=["transpose"],Rf=(0,i.d5)("csCounts",jf,(e=>{var{transpose:t}=e;return function(e,n,r,i){if(!e||!n||!r)return null;var a,o,s,u,l,c,f,d=e._size,p=d[0],h=d[1],m=4*h+(i?h+p+1:0),v=[],y=h,g=2*h,_=3*h,b=4*h,x=5*h+1;for(s=0;s<m;s++)v[s]=-1;var w=[],E=t(e),N=E._index,S=E._ptr;for(s=0;s<h;s++)for(w[o=r[s]]=-1===v[_+o]?1:0;-1!==o&&-1===v[_+o];o=n[o])v[_+o]=s;if(i){for(s=0;s<h;s++)v[r[s]]=s;for(a=0;a<p;a++){for(s=h,c=S[a],f=S[a+1],l=c;l<f;l++)s=Math.min(s,v[N[l]]);v[x+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!==n[o=r[s]]&&w[n[o]]--,u=i?v[b+s]:o;-1!==u;u=i?v[x+u]:-1)for(l=S[u];l<S[u+1];l++){var M=Pf(a=N[l],o,v,_,y,g,0);M.jleaf>=1&&w[o]++,2===M.jleaf&&w[M.q]--}-1!==n[o]&&(v[0+o]=n[o])}for(o=0;o<h;o++)-1!==n[o]&&(w[n[o]]+=w[o]);return w}})),Lf=["add","multiply","transpose"],Bf=(0,i.d5)("csSqr",Lf,(e=>{var{add:t,multiply:n,transpose:r}=e,i=Df({add:t,multiply:n,transpose:r}),a=Rf({transpose:r});return function(e,t,n){var r,o=t._ptr,s=t._size[1],u={};if(u.q=i(e,t),e&&!u.q)return null;if(n){var l=e?function(e,t,n,r){for(var i=e._values,a=e._index,o=e._ptr,s=e._size,u=e._datatype,l=s[0],c=s[1],f=null,d=[],p=[],h=0,m=0;m<c;m++){p[m]=h;for(var v=n?n[m]:m,y=o[v],g=o[v+1],_=y;_<g;_++){var b=a[_];d[h]=b,f&&(f[h]=i[_]),h++}}return p[c]=h,e.createSparseMatrix({values:f,index:d,ptr:p,size:[l,c],datatype:u})}(t,0,u.q):t;u.parent=function(e,t){if(!e)return null;var n,r,i=e._index,a=e._ptr,o=e._size,s=o[0],u=o[1],l=[],c=[],f=u;for(n=0;n<s;n++)c[f+n]=-1;for(var d=0;d<u;d++){l[d]=-1,c[0+d]=-1;for(var p=a[d],h=a[d+1],m=p;m<h;m++){var v=i[m];for(n=c[f+v];-1!==n&&n<d;n=r)r=c[0+n],c[0+n]=d,-1===r&&(l[n]=d);c[f+v]=d}}return l}(l);var c=function(e,t){if(!e)return null;var n,r=0,i=[],a=[],o=t,s=2*t;for(n=0;n<t;n++)a[0+n]=-1;for(n=t-1;n>=0;n--)-1!==e[n]&&(a[o+n]=a[0+e[n]],a[0+e[n]]=n);for(n=0;n<t;n++)-1===e[n]&&(r=Af(n,r,a,0,o,i,s));return i}(u.parent,s);if(u.cp=a(l,u.parent,c,1),l&&u.parent&&u.cp&&function(e,t){var n=e._ptr,r=e._index,i=e._size,a=i[0],o=i[1];t.pinv=[],t.leftmost=[];var s,u,l,c,f,d=t.parent,p=t.pinv,h=t.leftmost,m=[],v=a,y=a+o,g=a+2*o;for(u=0;u<o;u++)m[v+u]=-1,m[y+u]=-1,m[g+u]=0;for(s=0;s<a;s++)h[s]=-1;for(u=o-1;u>=0;u--)for(c=n[u],f=n[u+1],l=c;l<f;l++)h[r[l]]=u;for(s=a-1;s>=0;s--)p[s]=-1,-1!==(u=h[s])&&(0==m[g+u]++&&(m[y+u]=s),m[0+s]=m[v+u],m[v+u]=s);for(t.lnz=0,t.m2=a,u=0;u<o;u++)if(s=m[v+u],t.lnz++,s<0&&(s=t.m2++),p[s]=u,!(--g[u]<=0)){t.lnz+=m[g+u];var _=d[u];-1!==_&&(0===m[g+_]&&(m[y+_]=m[y+u]),m[0+m[y+u]]=m[v+_],m[v+_]=m[0+s],m[g+_]+=m[g+u])}for(s=0;s<a;s++)p[s]<0&&(p[s]=u++);return!0}(l,u))for(u.unz=0,r=0;r<s;r++)u.unz+=u.cp[r]}else u.unz=4*o[s]+s,u.lnz=u.unz;return u}}));function Uf(e,t){return e[t]<0}function qf(e,t){e[t]=Tf(e[t])}function zf(e){return e<0?Tf(e):e}function Ff(e,t,n,r,i){var a,o,s,u=t._index,l=t._ptr,c=t._size[1],f=0;for(r[0]=e;f>=0;){e=r[f];var d=i?i[e]:e;Uf(l,e)||(qf(l,e),r[c+f]=d<0?0:zf(l[d]));var p=1;for(o=r[c+f],s=d<0?0:zf(l[d+1]);o<s;o++)if(!Uf(l,a=u[o])){r[c+f]=o,r[++f]=a,p=0;break}p&&(f--,r[--n]=e)}return n}var Hf=["divideScalar","multiply","subtract"],Zf=(0,i.d5)("csSpsolve",Hf,(e=>{var{divideScalar:t,multiply:n,subtract:r}=e;return function(e,i,a,o,s,u,l){var c,f,d,p,h=e._values,m=e._index,v=e._ptr,y=e._size[1],g=i._values,_=i._index,b=i._ptr,x=function(e,t,n,r,i){var a,o,s,u=e._ptr,l=e._size,c=t._index,f=t._ptr,d=l[1],p=d;for(o=f[n],s=f[n+1],a=o;a<s;a++){var h=c[a];Uf(u,h)||(p=Ff(h,e,p,r,i))}for(a=p;a<d;a++)qf(u,r[a]);return p}(e,i,a,o,u);for(c=x;c<y;c++)s[o[c]]=0;for(f=b[a],d=b[a+1],c=f;c<d;c++)s[_[c]]=g[c];for(var w=x;w<y;w++){var E=o[w],N=u?u[E]:E;if(!(N<0))for(f=v[N],d=v[N+1],s[E]=t(s[E],h[l?f:d-1]),c=l?f+1:f,p=l?d:d-1;c<p;c++){var S=m[c];s[S]=r(s[S],n(h[c],s[E]))}}return x}})),Wf=["abs","divideScalar","multiply","subtract","larger","largerEq","SparseMatrix"],Gf=(0,i.d5)("csLu",Wf,(e=>{var{abs:t,divideScalar:n,multiply:r,subtract:i,larger:a,largerEq:o,SparseMatrix:s}=e,u=Zf({divideScalar:n,multiply:r,subtract:i});return function(e,i,l){if(!e)return null;var c,f=e._size[1],d=100,p=100;i&&(c=i.q,d=i.lnz||d,p=i.unz||p);var h,m,v=[],y=[],g=[],_=new s({values:v,index:y,ptr:g,size:[f,f]}),b=[],x=[],w=[],E=new s({values:b,index:x,ptr:w,size:[f,f]}),N=[],S=[],M=[];for(h=0;h<f;h++)S[h]=0,N[h]=-1,g[h+1]=0;d=0,p=0;for(var k=0;k<f;k++){g[k]=d,w[k]=p;var O=c?c[k]:k,C=u(_,e,O,M,S,N,1),A=-1,T=-1;for(m=C;m<f;m++)if(N[h=M[m]]<0){var I=t(S[h]);a(I,T)&&(T=I,A=h)}else x[p]=N[h],b[p++]=S[h];if(-1===A||T<=0)return null;N[O]<0&&o(t(S[O]),r(T,l))&&(A=O);var D=S[A];for(x[p]=k,b[p++]=D,N[A]=k,y[d]=A,v[d++]=1,m=C;m<f;m++)N[h=M[m]]<0&&(y[d]=h,v[d++]=n(S[h],D)),S[h]=0}for(g[f]=d,w[f]=p,m=0;m<d;m++)y[m]=N[y[m]];return v.splice(d,v.length-d),y.splice(d,y.length-d),b.splice(p,b.length-p),x.splice(p,x.length-p),{L:_,U:E,pinv:N}}})),Jf=["typed","abs","add","multiply","transpose","divideScalar","subtract","larger","largerEq","SparseMatrix"],$f=(0,i.d5)("slu",Jf,(e=>{var{typed:t,abs:n,add:r,multiply:i,transpose:a,divideScalar:o,subtract:s,larger:l,largerEq:c,SparseMatrix:f}=e,d=Bf({add:r,multiply:i,transpose:a}),p=Gf({abs:n,divideScalar:o,multiply:i,subtract:s,larger:l,largerEq:c,SparseMatrix:f});return t("slu",{"SparseMatrix, number, number":function(e,t,n){if(!(0,u.U)(t)||t<0||t>3)throw new Error("Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]");if(n<0||n>1)throw new Error("Partial pivoting threshold must be a number from 0 to 1");var r=d(t,e,!1),i=p(e,r,n);return{L:i.L,U:i.U,p:i.pinv,q:r.q,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\np: "+this.p.toString()+(this.q?"\nq: "+this.q.toString():"")+"\n"}}}})})),Vf=["typed","matrix","subtract","multiply","unaryMinus","lup"],Kf=(0,i.d5)("det",Vf,(e=>{var{typed:t,matrix:n,subtract:r,multiply:i,unaryMinus:a,lup:o}=e;return t("det",{any:function(e){return(0,Ye.d9)(e)},"Array | Matrix":function(e){var t;switch((t=(0,l.SW)(e)?e.size():Array.isArray(e)?(e=n(e)).size():[]).length){case 0:return(0,Ye.d9)(e);case 1:if(1===t[0])return(0,Ye.d9)(e.valueOf()[0]);throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");case 2:var s=t[0];if(s===t[1])return function(e,t,n){if(1===t)return(0,Ye.d9)(e[0][0]);if(2===t)return r(i(e[0][0],e[1][1]),i(e[1][0],e[0][1]));for(var s=o(e),u=s.U[0][0],l=1;l<t;l++)u=i(u,s.U[l][l]);for(var c=0,f=0,d=[];;){for(;d[f];)f++;if(f>=t)break;for(var p=f,h=0;!d[s.p[p]];)d[s.p[p]]=!0,p=s.p[p],h++;h%2==0&&c++}return c%2==0?u:a(u)}(e.clone().valueOf(),s);throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+(0,Ke.WU)(t)+")")}}})})),Yf="distance",Xf=["typed","addScalar","subtract","divideScalar","multiplyScalar","unaryMinus","sqrt","abs"],Qf=(0,i.d5)(Yf,Xf,(e=>{var{typed:t,addScalar:n,subtract:r,multiplyScalar:i,divideScalar:a,unaryMinus:o,sqrt:s,abs:u}=e;return t(Yf,{"Array, Array, Array":function(e,t,n){if(2===e.length&&2===t.length&&2===n.length){if(!f(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!f(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!f(n))throw new TypeError("Array with 2 numbers or BigNumbers expected for third argument");var s=a(r(n[1],n[0]),r(t[1],t[0])),u=i(i(s,s),t[0]),l=o(i(s,t[0])),c=e[1];return v(e[0],e[1],u,l,c)}throw new TypeError("Invalid Arguments: Try again")},"Object, Object, Object":function(e,t,n){if(2===Object.keys(e).length&&2===Object.keys(t).length&&2===Object.keys(n).length){if(!f(e))throw new TypeError("Values of pointX and pointY should be numbers or BigNumbers");if(!f(t))throw new TypeError("Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers");if(!f(n))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 n&&"lineTwoPtY"in n){var s=a(r(n.lineTwoPtY,n.lineTwoPtX),r(t.lineOnePtY,t.lineOnePtX)),u=i(i(s,s),t.lineOnePtX),l=o(i(s,t.lineOnePtX)),c=e.pointX;return v(e.pointX,e.pointY,u,l,c)}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(!f(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!d(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(!d(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(!p(e))throw new TypeError("All values of an array should be numbers or BigNumbers");if(!p(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(!f(e))throw new TypeError("Values of pointX and pointY should be numbers or BigNumbers");if(!d(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(!d(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(!f(e))throw new TypeError("Values of pointOneX and pointOneY should be numbers or BigNumbers");if(!f(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(!d(e))throw new TypeError("Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers");if(!d(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&&c(e[0][0])&&c(e[0][1])){if(e.some((e=>2!==e.length||!c(e[0])||!c(e[1]))))return!1}else{if(!(3===e[0].length&&c(e[0][0])&&c(e[0][1])&&c(e[0][2])))return!1;if(e.some((e=>3!==e.length||!c(e[0])||!c(e[1])||!c(e[2]))))return!1}return!0}(e))throw new TypeError("Incorrect array format entered for pairwise distance calculation");return function(e){for(var t=[],n=[],r=[],i=0;i<e.length-1;i++)for(var a=i+1;a<e.length;a++)2===e[0].length?(n=[e[i][0],e[i][1]],r=[e[a][0],e[a][1]]):3===e[0].length&&(n=[e[i][0],e[i][1],e[i][2]],r=[e[a][0],e[a][1],e[a][2]]),t.push(g(n,r));return t}(e)}});function c(e){return"number"==typeof e||(0,l.l9)(e)}function f(e){return e.constructor!==Array&&(e=m(e)),c(e[0])&&c(e[1])}function d(e){return e.constructor!==Array&&(e=m(e)),c(e[0])&&c(e[1])&&c(e[2])}function p(e){return Array.isArray(e)||(e=m(e)),e.every(c)}function h(e){return e.constructor!==Array&&(e=m(e)),c(e[0])&&c(e[1])&&c(e[2])&&c(e[3])&&c(e[4])&&c(e[5])}function m(e){for(var t=Object.keys(e),n=[],r=0;r<t.length;r++)n.push(e[t[r]]);return n}function v(e,t,r,o,l){var c=u(n(n(i(r,e),i(o,t)),l)),f=s(n(i(r,r),i(o,o)));return a(c,f)}function y(e,t,o,u,l,c,f,d,p){var h=[r(i(r(l,t),p),i(r(c,o),d)),r(i(r(c,o),f),i(r(u,e),p)),r(i(r(u,e),d),i(r(l,t),f))];h=s(n(n(i(h[0],h[0]),i(h[1],h[1])),i(h[2],h[2])));var m=s(n(n(i(f,f),i(d,d)),i(p,p)));return a(h,m)}function g(e,t){for(var a=e.length,o=0,u=0,l=0;l<a;l++)u=r(e[l],t[l]),o=n(i(u,u),o);return s(o)}})),ed="stirlingS2",td=["typed","addScalar","subtract","multiplyScalar","divideScalar","pow","factorial","combinations","isNegative","isInteger","larger"],nd=(0,i.d5)(ed,td,(e=>{var{typed:t,addScalar:n,subtract:r,multiplyScalar:i,divideScalar:a,pow:o,factorial:s,combinations:u,isNegative:l,isInteger:c,larger:f}=e;return t(ed,{"number | BigNumber, number | BigNumber":function(e,t){if(!c(e)||l(e)||!c(t)||l(t))throw new TypeError("Non-negative integer value expected in function stirlingS2");if(f(t,e))throw new TypeError("k must be less than or equal to n in function stirlingS2");for(var d=s(t),p=0,h=0;h<=t;h++){var m=o(-1,r(t,h)),v=u(t,h),y=o(h,e);p=n(p,i(i(v,y),m))}return a(p,d)}})})),rd="catalan",id=["typed","addScalar","divideScalar","multiplyScalar","combinations","isNegative","isInteger"],ad=(0,i.d5)(rd,id,(e=>{var{typed:t,addScalar:n,divideScalar:r,multiplyScalar:i,combinations:a,isNegative:o,isInteger:s}=e;return t(rd,{"number | BigNumber":function(e){if(!s(e)||o(e))throw new TypeError("Non-negative integer value expected in function catalan");return r(a(i(e,2),e),n(e,1))}})})),od="count",sd=["typed","size","prod"],ud=(0,i.d5)(od,sd,(e=>{var{typed:t,size:n,prod:r}=e;return t(od,{string:function(e){return e.length},"Matrix | Array":function(e){return r(n(e))}})})),ld=["config","typed","divideScalar","Complex"],cd=(0,i.d5)("log",ld,(e=>{var{typed:t,config:n,divideScalar:r,Complex:i}=e;return t("log",{number:function(e){return e>=0||n.predictable?en(e):new i(e,0).log()},Complex:function(e){return e.log()},BigNumber:function(e){return!e.isNegative()||n.predictable?e.ln():new i(e.toNumber(),0).log()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)},"any, any":function(e,t){return r(this(e),this(t))}})})),fd="dotDivide",dd=["typed","matrix","equalScalar","divideScalar","DenseMatrix"],pd=(0,i.d5)(fd,dd,(e=>{var{typed:t,matrix:n,equalScalar:r,divideScalar:i,DenseMatrix:a}=e,o=So({typed:t,equalScalar:r}),s=ko({typed:t}),u=$o({typed:t,DenseMatrix:a}),l=To({typed:t,equalScalar:r}),c=Do({typed:t,DenseMatrix:a}),f=_o({typed:t}),d=xo({typed:t});return t(fd,{"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 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 l(e,t,i,!1)},"DenseMatrix, any":function(e,t){return d(e,t,i,!1)},"any, SparseMatrix":function(e,t){return c(t,e,i,!0)},"any, DenseMatrix":function(e,t){return d(t,e,i,!0)},"Array, any":function(e,t){return d(n(e),t,i,!1).valueOf()},"any, Array":function(e,t){return d(n(t),e,i,!0).valueOf()}})})),hd="usolveAll",md=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],vd=(0,i.d5)(hd,md,(e=>{var{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(hd,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var n=[u(e,t,!0)._data.map((e=>e[0]))],l=e._size[0],c=e._size[1],f=e._values,d=e._index,p=e._ptr,h=c-1;h>=0;h--)for(var m=n.length,v=0;v<m;v++){for(var y=n[v],g=[],_=[],b=p[h],x=0,w=p[h+1]-1;w>=b;w--){var E=d[w];E===h?x=f[w]:E<h&&(g.push(f[w]),_.push(E))}if(o(x,0))if(o(y[h],0)){if(0===v){var N=[...y];N[h]=1;for(var S=0,M=_.length;S<M;S++){var k=_[S];N[k]=a(N[k],g[S])}n.push(N)}}else{if(0===v)return[];n.splice(v,1),v-=1,m-=1}else{y[h]=r(y[h],x);for(var O=0,C=_.length;O<C;O++){var A=_[O];y[A]=a(y[A],i(y[h],g[O]))}}}return n.map((e=>new s({data:e.map((e=>[e])),size:[l,1]})))}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return l(e,t)},"Array, Array | Matrix":function(e,t){return l(n(e),t).map((e=>e.valueOf()))}});function l(e,t){for(var n=[u(e,t,!0)._data.map((e=>e[0]))],l=e._data,c=e._size[0],f=e._size[1]-1;f>=0;f--)for(var d=n.length,p=0;p<d;p++){var h=n[p];if(o(l[f][f],0))if(o(h[f],0)){if(0===p){var m=[...h];m[f]=1;for(var v=f-1;v>=0;v--)m[v]=a(m[v],l[v][f]);n.push(m)}}else{if(0===p)return[];n.splice(p,1),p-=1,d-=1}else{h[f]=r(h[f],l[f][f]);for(var y=f-1;y>=0;y--)h[y]=a(h[y],i(h[f],l[y][f]))}}return n.map((e=>new s({data:e.map((e=>[e])),size:[c,1]})))}})),yd="hypot",gd=["typed","abs","addScalar","divideScalar","multiplyScalar","sqrt","smaller","isPositive"],_d=(0,i.d5)(yd,gd,(e=>{var{typed:t,abs:n,addScalar:r,divideScalar:i,multiplyScalar:a,sqrt:o,smaller:s,isPositive:u}=e;return t(yd,{"... number | BigNumber":function(e){for(var t=0,l=0,c=0;c<e.length;c++){var f=n(e[c]);s(l,f)?(t=a(t,a(i(l,f),i(l,f))),t=r(t,1),l=f):t=r(t,u(f)?a(i(f,l),i(f,l)):f)}return a(l,o(t))},Array:function(e){return this.apply(this,(0,Ve.xH)(e))},Matrix:function(e){return this.apply(this,(0,Ve.xH)(e.toArray()))}})}));function bd(){return(bd=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e}).apply(this,arguments)}var xd=["typed","matrix","zeros","identity","isZero","equal","sign","sqrt","conj","unaryMinus","addScalar","divideScalar","multiplyScalar","subtract","complex"],wd=(0,i.d5)("qr",xd,(e=>{var{typed:t,matrix:n,zeros:r,identity:i,isZero:a,equal:o,sign:s,sqrt:u,conj:l,unaryMinus:c,addScalar:f,divideScalar:d,multiplyScalar:p,subtract:h,complex:m}=e;return bd(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(n(e));return{Q:t.Q.valueOf(),R:t.R.valueOf()}}}),{_denseQRimpl:v});function v(e){var t,n,m,v=e._size[0],y=e._size[1],g=i([v],"dense"),_=g._data,b=e.clone(),x=b._data,w=r([v],"");for(m=0;m<Math.min(y,v);++m){var E=x[m][m],N=c(o(E,0)?1:s(E)),S=l(N),M=0;for(t=m;t<v;t++)M=f(M,p(x[t][m],l(x[t][m])));var k=p(N,u(M));if(!a(k)){var O=h(E,k);for(w[m]=1,t=m+1;t<v;t++)w[t]=d(x[t][m],O);var C=c(l(d(O,k))),A=void 0;for(n=m;n<y;n++){for(A=0,t=m;t<v;t++)A=f(A,p(l(w[t]),x[t][n]));for(A=p(A,C),t=m;t<v;t++)x[t][n]=p(h(x[t][n],p(w[t],A)),S)}for(t=0;t<v;t++){for(A=0,n=m;n<v;n++)A=f(A,p(_[t][n],w[n]));for(A=p(A,C),n=m;n<v;++n)_[t][n]=d(h(_[t][n],p(A,l(w[n]))),S)}}}return{Q:g,R:b,toString:function(){return"Q: "+this.Q.toString()+"\nR: "+this.R.toString()}}}function y(e){var t=v(e),n=t.R._data;if(e._data.length>0)for(var r="Complex"===n[0][0].type?m(0):0,i=0;i<n.length;++i)for(var a=0;a<i&&a<(n[0]||[]).length;++a)n[i][a]=r;return t}})),Ed=["typed","matrix","divideScalar","addScalar","multiply","unaryMinus","det","identity","abs"],Nd=(0,i.d5)("inv",Ed,(e=>{var{typed:t,matrix:n,divideScalar:r,addScalar:i,multiply:a,unaryMinus:o,det:s,identity:u,abs:c}=e;return t("inv",{"Array | Matrix":function(e){var t=(0,l.SW)(e)?e.size():(0,Ve.aJ)(e);switch(t.length){case 1:if(1===t[0])return(0,l.SW)(e)?n([r(1,e.valueOf()[0])]):[r(1,e[0])];throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");case 2:var i=t[0],a=t[1];if(i===a)return(0,l.SW)(e)?n(f(e.valueOf(),i,a),e.storage()):f(e,i,a);throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+(0,Ke.WU)(t)+")")}},any:function(e){return r(1,e)}});function f(e,t,n){var l,f,d,p,h;if(1===t){if(0===(p=e[0][0]))throw Error("Cannot calculate inverse, determinant is zero");return[[r(1,p)]]}if(2===t){var m=s(e);if(0===m)throw Error("Cannot calculate inverse, determinant is zero");return[[r(e[1][1],m),r(o(e[0][1]),m)],[r(o(e[1][0]),m),r(e[0][0],m)]]}var v=e.concat();for(l=0;l<t;l++)v[l]=v[l].concat();for(var y=u(t).valueOf(),g=0;g<n;g++){var _=c(v[g][g]),b=g;for(l=g+1;l<t;)c(v[l][g])>_&&(_=c(v[l][g]),b=l),l++;if(0===_)throw Error("Cannot calculate inverse, determinant is zero");(l=b)!==g&&(h=v[g],v[g]=v[l],v[l]=h,h=y[g],y[g]=y[l],y[l]=h);var x=v[g],w=y[g];for(l=0;l<t;l++){var E=v[l],N=y[l];if(l!==g){if(0!==E[g]){for(d=r(o(E[g]),x[g]),f=g;f<n;f++)E[f]=i(E[f],a(d,x[f]));for(f=0;f<n;f++)N[f]=i(N[f],a(d,w[f]))}}else{for(d=x[g],f=g;f<n;f++)E[f]=r(E[f],d);for(f=0;f<n;f++)N[f]=r(N[f],d)}}}return y}})),Sd="expm",Md=["typed","abs","add","identity","inv","multiply"],kd=(0,i.d5)(Sd,Md,(e=>{var{typed:t,abs:n,add:r,identity:i,inv:a,multiply:o}=e;return t(Sd,{Matrix:function(e){var t=e.size();if(2!==t.length||t[0]!==t[1])throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");for(var u=t[0],c=function(e,t){for(var n=0;n<30;n++)for(var r=0;r<=n;r++){var i=n-r;if(s(e,r,i)<1e-15)return{q:r,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],r=0,i=0;i<t;i++){for(var a=0,o=0;o<t;o++)a+=n(e.get([i,o]));r=Math.max(a,r)}return r}(e)),f=c.q,d=c.j,p=o(e,Math.pow(2,-d)),h=i(u),m=i(u),v=1,y=p,g=-1,_=1;_<=f;_++)_>1&&(y=o(y,p),g=-g),h=r(h,o(v=v*(f-_+1)/((2*f-_+1)*_),y)),m=r(m,o(v*g,y));for(var b=o(a(m),h),x=0;x<d;x++)b=o(b,b);return(0,l.sA)(e)?e.createSparseMatrix(b):b}});function s(e,t,n){for(var r=1,i=2;i<=t;i++)r*=i;for(var a=r,o=t+1;o<=2*t;o++)a*=o;var s=a*(2*t+1);return 8*Math.pow(e/Math.pow(2,n),2*t)*r*r/(a*s)}})),Od=["typed","matrix","multiply","equalScalar","divideScalar","inv"],Cd=(0,i.d5)("divide",Od,(e=>{var{typed:t,matrix:n,multiply:r,equalScalar:i,divideScalar:a,inv:o}=e,s=To({typed:t,equalScalar:i}),u=xo({typed:t});return t("divide",(0,Ye.l7)({"Array | Matrix, Array | Matrix":function(e,t){return r(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(n(e),t,a,!1).valueOf()},"any, Array | Matrix":function(e,t){return r(e,o(t))}},a.signatures))})),Ad="kldivergence",Td=["typed","matrix","divide","sum","multiply","dotDivide","log","isNumeric"],Id=(0,i.d5)(Ad,Td,(e=>{var{typed:t,matrix:n,divide:r,sum:i,multiply:a,dotDivide:o,log:s,isNumeric:u}=e;return t(Ad,{"Array, Array":function(e,t){return l(n(e),n(t))},"Matrix, Array":function(e,t){return l(e,n(t))},"Array, Matrix":function(e,t){return l(n(e),t)},"Matrix, Matrix":function(e,t){return l(e,t)}});function l(e,t){var n=t.size().length,l=e.size().length;if(n>1)throw new Error("first object must be one dimensional");if(l>1)throw new Error("second object must be one dimensional");if(n!==l)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 c=r(e,i(e)),f=r(t,i(t)),d=i(a(c,s(o(c,f))));return u(d)?d:Number.NaN}})),Dd="bellNumbers",Pd=["typed","addScalar","isNegative","isInteger","stirlingS2"],jd=(0,i.d5)(Dd,Pd,(e=>{var{typed:t,addScalar:n,isNegative:r,isInteger:i,stirlingS2:a}=e;return t(Dd,{"number | BigNumber":function(e){if(!i(e)||r(e))throw new TypeError("Non-negative integer value expected in function bellNumbers");for(var t=0,o=0;o<=e;o++)t=n(t,a(e,o));return t}})})),Rd="log1p",Ld=["typed","config","divideScalar","log","Complex"],Bd=(0,i.d5)(Rd,Ld,(e=>{var{typed:t,config:n,divideScalar:r,log:i,Complex:a}=e;return t(Rd,{number:function(e){return e>=-1||n.predictable?(0,u.Kr)(e):o(new a(e,0))},Complex:o,BigNumber:function(e){var t=e.plus(1);return!t.isNegative()||n.predictable?t.ln():o(new a(e.toNumber(),0))},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)},"any, any":function(e,t){return r(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))}}));function Ud(){return(Ud=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e}).apply(this,arguments)}function qd(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);t&&(r=r.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),n.push.apply(n,r)}return n}function zd(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{};t%2?qd(Object(n),!0).forEach((function(t){Fd(e,t,n[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(n)):qd(Object(n)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(n,t))}))}return e}function Fd(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}var Hd=["?on","config","addScalar","subtract","multiplyScalar","divideScalar","pow","abs","fix","round","equal","isNumeric","format","number","Complex","BigNumber","Fraction"],Zd=(0,i.d5)("Unit",Hd,(e=>{var t,n,r,{on:i,config:a,addScalar:o,subtract:s,multiplyScalar:u,divideScalar:c,pow:f,abs:d,fix:p,round:m,equal:v,isNumeric:g,format:_,number:b,Complex:x,BigNumber:w,Fraction:E}=e,N=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)&&!(0,l.Mc)(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 n=S.parse(t);this.units=n.units,this.dimensions=n.dimensions}else{this.units=[{unit:U,prefix:j.NONE,power:0}],this.dimensions=[];for(var r=0;r<R.length;r++)this.dimensions[r]=0}this.value=null!=e?this._normalize(e):null,this.fixPrefix=!1,this.skipAutomaticSimplification=!0}function M(){for(;" "===r||"\t"===r;)O()}function k(e){return e>="0"&&e<="9"}function O(){n++,r=t.charAt(n)}function C(e){n=e,r=t.charAt(n)}function A(){var e="",t=n;if("+"===r?O():"-"===r&&(e+=r,O()),!function(e){return e>="0"&&e<="9"||"."===e}(r))return C(t),null;if("."===r){if(e+=r,O(),!k(r))return C(t),null}else{for(;k(r);)e+=r,O();"."===r&&(e+=r,O())}for(;k(r);)e+=r,O();if("E"===r||"e"===r){var i="",a=n;if(i+=r,O(),"+"!==r&&"-"!==r||(i+=r,O()),!k(r))return C(a),e;for(e+=i;k(r);)e+=r,O()}return e}function T(){for(var e="";k(r)||S.isValidAlpha(r);)e+=r,O();var t=e.charAt(0);return S.isValidAlpha(t)?e:null}function I(e){return r===e?(O(),e):null}S.prototype.type="Unit",S.prototype.isUnit=!0,S.parse=function(e,i){if(i=i||{},n=-1,r="","string"!=typeof(t=e))throw new TypeError("Invalid argument in Unit.parse, string expected");var o=new S;o.units=[];var s=1,u=!1;O(),M();var l=A(),c=null;if(l){if("BigNumber"===a.number)c=new w(l);else if("Fraction"===a.number)try{c=new E(l)}catch(e){c=parseFloat(l)}else c=parseFloat(l);M(),I("*")?(s=1,u=!0):I("/")&&(s=-1,u=!0)}for(var f=[],d=1;;){for(M();"("===r;)f.push(s),d*=s,s=1,O(),M();var p;if(!r)break;var h=r;if(null===(p=T()))throw new SyntaxError('Unexpected "'+h+'" in "'+t+'" at index '+n.toString());var m=D(p);if(null===m)throw new SyntaxError('Unit "'+p+'" not found.');var v=s*d;if(M(),I("^")){M();var y=A();if(null===y)throw new SyntaxError('In "'+e+'", "^" must be followed by a floating-point number');v*=y}o.units.push({unit:m.unit,prefix:m.prefix,power:v});for(var g=0;g<R.length;g++)o.dimensions[g]+=(m.unit.dimensions[g]||0)*v;for(M();")"===r;){if(0===f.length)throw new SyntaxError('Unmatched ")" in "'+t+'" at index '+n.toString());d/=f.pop(),O(),M()}if(u=!1,I("*")?(s=1,u=!0):I("/")?(s=-1,u=!0):s=1,m.unit.base){var _=m.unit.base.key;H.auto[_]={unit:m.unit,prefix:m.prefix}}}if(M(),r)throw new SyntaxError('Could not parse: "'+e+'"');if(u)throw new SyntaxError('Trailing characters: "'+e+'"');if(0!==f.length)throw new SyntaxError('Unmatched "(" in "'+t+'"');if(0===o.units.length&&!i.allowNoUnits)throw new SyntaxError('"'+e+'" contains no units');return o.value=void 0!==c?o._normalize(c):null,o},S.prototype.clone=function(){var e=new S;e.fixPrefix=this.fixPrefix,e.skipAutomaticSimplification=this.skipAutomaticSimplification,e.value=(0,Ye.d9)(this.value),e.dimensions=this.dimensions.slice(0),e.units=[];for(var t=0;t<this.units.length;t++)for(var n in e.units[t]={},this.units[t])(0,Ye.nr)(this.units[t],n)&&(e.units[t][n]=this.units[t][n]);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){var t,n,r,i,a;if(null==e||0===this.units.length)return e;if(this._isDerived()){var s=e;a=S._getNumberConverter((0,l.kM)(e));for(var c=0;c<this.units.length;c++)t=a(this.units[c].unit.value),i=a(this.units[c].prefix.value),r=a(this.units[c].power),s=u(s,f(u(t,i),r));return s}return t=(a=S._getNumberConverter((0,l.kM)(e)))(this.units[0].unit.value),n=a(this.units[0].unit.offset),i=a(this.units[0].prefix.value),u(o(e,n),u(t,i))},S.prototype._denormalize=function(e,t){var n,r,i,a,o;if(null==e||0===this.units.length)return e;if(this._isDerived()){var d=e;o=S._getNumberConverter((0,l.kM)(e));for(var p=0;p<this.units.length;p++)n=o(this.units[p].unit.value),a=o(this.units[p].prefix.value),i=o(this.units[p].power),d=c(d,f(u(n,a),i));return d}return n=(o=S._getNumberConverter((0,l.kM)(e)))(this.units[0].unit.value),a=o(this.units[0].prefix.value),r=o(this.units[0].unit.offset),s(c(c(e,n),null==t?a:t),r)};var D=(0,h.HP)((e=>{if((0,Ye.nr)(q,e)){var t=q[e];return{unit:t,prefix:t.prefixes[""]}}for(var n in q)if((0,Ye.nr)(q,n)&&(0,Ke.pn)(e,n)){var r=q[n],i=e.length-n.length,a=e.substring(0,i),o=(0,Ye.nr)(r.prefixes,a)?r.prefixes[a]:void 0;if(void 0!==o)return{unit:r,prefix:o}}return null}),{hasher:e=>e[0],limit:100});function P(e){return e.equalBase(L.NONE)&&null!==e.value&&!a.predictable?e.value:e}S.isValuelessUnit=function(e){return null!==D(e)},S.prototype.hasBase=function(e){if("string"==typeof e&&(e=L[e]),!e)return!1;for(var t=0;t<R.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<R.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)&&v(this.value,e.value)},S.prototype.multiply=function(e){for(var t=this.clone(),n=0;n<R.length;n++)t.dimensions[n]=(this.dimensions[n]||0)+(e.dimensions[n]||0);for(var r=0;r<e.units.length;r++){var i=zd({},e.units[r]);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=u(a,o)}else t.value=null;return t.skipAutomaticSimplification=!1,P(t)},S.prototype.divide=function(e){for(var t=this.clone(),n=0;n<R.length;n++)t.dimensions[n]=(this.dimensions[n]||0)-(e.dimensions[n]||0);for(var r=0;r<e.units.length;r++){var i=zd(zd({},e.units[r]),{},{power:-e.units[r].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=c(a,o)}else t.value=null;return t.skipAutomaticSimplification=!1,P(t)},S.prototype.pow=function(e){for(var t=this.clone(),n=0;n<R.length;n++)t.dimensions[n]=(this.dimensions[n]||0)*e;for(var r=0;r<t.units.length;r++)t.units[r].power*=e;return null!==t.value?t.value=f(t.value,e):t.value=null,t.skipAutomaticSimplification=!1,P(t)},S.prototype.abs=function(){var e=this.clone();for(var t in e.value=null!==e.value?d(e.value):null,e.units)"VA"!==e.units[t].unit.name&&"VAR"!==e.units[t].unit.name||(e.units[t].unit=q.W);return e},S.prototype.to=function(e){var t,n=null===this.value?this._normalize(1):this.value;if("string"==typeof e){if(t=S.parse(e),!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");return t.value=(0,Ye.d9)(n),t.fixPrefix=!0,t.skipAutomaticSimplification=!0,t}if((0,l.wr)(e)){if(!this.equalBase(e))throw new Error("Units do not match ('".concat(e.toString(),"' != '").concat(this.toString(),"')"));if(null!==e.value)throw new Error("Cannot convert to a unit with a value");return(t=e.clone()).value=(0,Ye.d9)(n),t.fixPrefix=!0,t.skipAutomaticSimplification=!0,t}throw new Error("String or Unit expected as parameter")},S.prototype.toNumber=function(e){return N(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,n=this.clone(),r=[];for(var i in Z)if((0,Ye.nr)(Z,i)&&n.hasBase(L[i])){e=i;break}if("NONE"===e)n.units=[];else if(e&&(0,Ye.nr)(Z,e)&&(t=Z[e]),t)n.units=[{unit:t.unit,prefix:t.prefix,power:1}];else{for(var a=!1,o=0;o<R.length;o++){var s=R[o];Math.abs(n.dimensions[o]||0)>1e-12&&((0,Ye.nr)(Z,s)?r.push({unit:Z[s].unit,prefix:Z[s].prefix,power:n.dimensions[o]||0}):a=!0)}r.length<n.units.length&&!a&&(n.units=r)}return n},S.prototype.toSI=function(){for(var e=this.clone(),t=[],n=0;n<R.length;n++){var r=R[n];if(Math.abs(e.dimensions[n]||0)>1e-12){if(!(0,Ye.nr)(H.si,r))throw new Error("Cannot express custom unit "+r+" in SI units");t.push({unit:H.si[r].unit,prefix:H.si[r].prefix,power:e.dimensions[n]||0})}}return e.units=t,e.fixPrefix=!0,e.skipAutomaticSimplification=!0,e},S.prototype.formatUnits=function(){for(var e="",t="",n=0,r=0,i=0;i<this.units.length;i++)this.units[i].power>0?(n++,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&&r++;if(r>0)for(var a=0;a<this.units.length;a++)this.units[a].power<0&&(n>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),n>1&&r>0&&(e="("+e+")"),r>1&&n>0&&(t="("+t+")");var o=e;return n>0&&r>0&&(o+=" / "),o+t},S.prototype.format=function(e){var t=this.skipAutomaticSimplification||null===this.value?this.clone():this.simplify(),n=!1;for(var r in void 0!==t.value&&null!==t.value&&(0,l.Mc)(t.value)&&(n=Math.abs(t.value.re)<1e-14),t.units)(0,Ye.nr)(t.units,r)&&t.units[r].unit&&("VA"===t.units[r].unit.name&&n?t.units[r].unit=q.VAR:"VAR"!==t.units[r].unit.name||n||(t.units[r].unit=q.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?_(i,e||{}):"",o=t.formatUnits();return t.value&&(0,l.Mc)(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?d(this.value):0,t=d(this.units[0].unit.value),n=this.units[0].prefix;if(0===e)return n;var r=this.units[0].power,i=Math.log(e/Math.pow(n.value*t,r))/Math.LN10-1.2;if(i>-2.200001&&i<1.800001)return n;i=Math.abs(i);var a=this.units[0].unit.prefixes;for(var o in a)if((0,Ye.nr)(a,o)){var s=a[o];if(s.scientific){var u=Math.abs(Math.log(e/Math.pow(s.value*t,r))/Math.LN10-1.2);(u<i||u===i&&s.name.length<n.name.length)&&(n=s,i=u)}}return n},S.prototype.splitUnit=function(e){for(var t=this.clone(),n=[],r=0;r<e.length&&(t=t.to(e[r]),r!==e.length-1);r++){var i=t.toNumeric(),a=m(i),u=new S(v(a,i)?a:p(t.toNumeric()),e[r].toString());n.push(u),t=s(t,u)}for(var l=0,c=0;c<n.length;c++)l=o(l,n[c].value);return v(l,this.value)&&(t.value=0),n.push(t),n};var j={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}}};j.SHORTLONG=Ud({},j.SHORT,j.LONG),j.BINARY_SHORT=Ud({},j.BINARY_SHORT_SI,j.BINARY_SHORT_IEC),j.BINARY_LONG=Ud({},j.BINARY_LONG_SI,j.BINARY_LONG_IEC);var R=["MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","ANGLE","BIT"],L={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 B in L)(0,Ye.nr)(L,B)&&(L[B].key=B);var U={name:"",base:{},value:1,offset:0,dimensions:R.map((e=>0))},q={meter:{name:"meter",base:L.LENGTH,prefixes:j.LONG,value:1,offset:0},inch:{name:"inch",base:L.LENGTH,prefixes:j.NONE,value:.0254,offset:0},foot:{name:"foot",base:L.LENGTH,prefixes:j.NONE,value:.3048,offset:0},yard:{name:"yard",base:L.LENGTH,prefixes:j.NONE,value:.9144,offset:0},mile:{name:"mile",base:L.LENGTH,prefixes:j.NONE,value:1609.344,offset:0},link:{name:"link",base:L.LENGTH,prefixes:j.NONE,value:.201168,offset:0},rod:{name:"rod",base:L.LENGTH,prefixes:j.NONE,value:5.0292,offset:0},chain:{name:"chain",base:L.LENGTH,prefixes:j.NONE,value:20.1168,offset:0},angstrom:{name:"angstrom",base:L.LENGTH,prefixes:j.NONE,value:1e-10,offset:0},m:{name:"m",base:L.LENGTH,prefixes:j.SHORT,value:1,offset:0},in:{name:"in",base:L.LENGTH,prefixes:j.NONE,value:.0254,offset:0},ft:{name:"ft",base:L.LENGTH,prefixes:j.NONE,value:.3048,offset:0},yd:{name:"yd",base:L.LENGTH,prefixes:j.NONE,value:.9144,offset:0},mi:{name:"mi",base:L.LENGTH,prefixes:j.NONE,value:1609.344,offset:0},li:{name:"li",base:L.LENGTH,prefixes:j.NONE,value:.201168,offset:0},rd:{name:"rd",base:L.LENGTH,prefixes:j.NONE,value:5.02921,offset:0},ch:{name:"ch",base:L.LENGTH,prefixes:j.NONE,value:20.1168,offset:0},mil:{name:"mil",base:L.LENGTH,prefixes:j.NONE,value:254e-7,offset:0},m2:{name:"m2",base:L.SURFACE,prefixes:j.SQUARED,value:1,offset:0},sqin:{name:"sqin",base:L.SURFACE,prefixes:j.NONE,value:64516e-8,offset:0},sqft:{name:"sqft",base:L.SURFACE,prefixes:j.NONE,value:.09290304,offset:0},sqyd:{name:"sqyd",base:L.SURFACE,prefixes:j.NONE,value:.83612736,offset:0},sqmi:{name:"sqmi",base:L.SURFACE,prefixes:j.NONE,value:2589988.110336,offset:0},sqrd:{name:"sqrd",base:L.SURFACE,prefixes:j.NONE,value:25.29295,offset:0},sqch:{name:"sqch",base:L.SURFACE,prefixes:j.NONE,value:404.6873,offset:0},sqmil:{name:"sqmil",base:L.SURFACE,prefixes:j.NONE,value:6.4516e-10,offset:0},acre:{name:"acre",base:L.SURFACE,prefixes:j.NONE,value:4046.86,offset:0},hectare:{name:"hectare",base:L.SURFACE,prefixes:j.NONE,value:1e4,offset:0},m3:{name:"m3",base:L.VOLUME,prefixes:j.CUBIC,value:1,offset:0},L:{name:"L",base:L.VOLUME,prefixes:j.SHORT,value:.001,offset:0},l:{name:"l",base:L.VOLUME,prefixes:j.SHORT,value:.001,offset:0},litre:{name:"litre",base:L.VOLUME,prefixes:j.LONG,value:.001,offset:0},cuin:{name:"cuin",base:L.VOLUME,prefixes:j.NONE,value:16387064e-12,offset:0},cuft:{name:"cuft",base:L.VOLUME,prefixes:j.NONE,value:.028316846592,offset:0},cuyd:{name:"cuyd",base:L.VOLUME,prefixes:j.NONE,value:.764554857984,offset:0},teaspoon:{name:"teaspoon",base:L.VOLUME,prefixes:j.NONE,value:5e-6,offset:0},tablespoon:{name:"tablespoon",base:L.VOLUME,prefixes:j.NONE,value:15e-6,offset:0},drop:{name:"drop",base:L.VOLUME,prefixes:j.NONE,value:5e-8,offset:0},gtt:{name:"gtt",base:L.VOLUME,prefixes:j.NONE,value:5e-8,offset:0},minim:{name:"minim",base:L.VOLUME,prefixes:j.NONE,value:6.161152e-8,offset:0},fluiddram:{name:"fluiddram",base:L.VOLUME,prefixes:j.NONE,value:36966911e-13,offset:0},fluidounce:{name:"fluidounce",base:L.VOLUME,prefixes:j.NONE,value:2957353e-11,offset:0},gill:{name:"gill",base:L.VOLUME,prefixes:j.NONE,value:.0001182941,offset:0},cc:{name:"cc",base:L.VOLUME,prefixes:j.NONE,value:1e-6,offset:0},cup:{name:"cup",base:L.VOLUME,prefixes:j.NONE,value:.0002365882,offset:0},pint:{name:"pint",base:L.VOLUME,prefixes:j.NONE,value:.0004731765,offset:0},quart:{name:"quart",base:L.VOLUME,prefixes:j.NONE,value:.0009463529,offset:0},gallon:{name:"gallon",base:L.VOLUME,prefixes:j.NONE,value:.003785412,offset:0},beerbarrel:{name:"beerbarrel",base:L.VOLUME,prefixes:j.NONE,value:.1173478,offset:0},oilbarrel:{name:"oilbarrel",base:L.VOLUME,prefixes:j.NONE,value:.1589873,offset:0},hogshead:{name:"hogshead",base:L.VOLUME,prefixes:j.NONE,value:.238481,offset:0},fldr:{name:"fldr",base:L.VOLUME,prefixes:j.NONE,value:36966911e-13,offset:0},floz:{name:"floz",base:L.VOLUME,prefixes:j.NONE,value:2957353e-11,offset:0},gi:{name:"gi",base:L.VOLUME,prefixes:j.NONE,value:.0001182941,offset:0},cp:{name:"cp",base:L.VOLUME,prefixes:j.NONE,value:.0002365882,offset:0},pt:{name:"pt",base:L.VOLUME,prefixes:j.NONE,value:.0004731765,offset:0},qt:{name:"qt",base:L.VOLUME,prefixes:j.NONE,value:.0009463529,offset:0},gal:{name:"gal",base:L.VOLUME,prefixes:j.NONE,value:.003785412,offset:0},bbl:{name:"bbl",base:L.VOLUME,prefixes:j.NONE,value:.1173478,offset:0},obl:{name:"obl",base:L.VOLUME,prefixes:j.NONE,value:.1589873,offset:0},g:{name:"g",base:L.MASS,prefixes:j.SHORT,value:.001,offset:0},gram:{name:"gram",base:L.MASS,prefixes:j.LONG,value:.001,offset:0},ton:{name:"ton",base:L.MASS,prefixes:j.SHORT,value:907.18474,offset:0},t:{name:"t",base:L.MASS,prefixes:j.SHORT,value:1e3,offset:0},tonne:{name:"tonne",base:L.MASS,prefixes:j.LONG,value:1e3,offset:0},grain:{name:"grain",base:L.MASS,prefixes:j.NONE,value:6479891e-11,offset:0},dram:{name:"dram",base:L.MASS,prefixes:j.NONE,value:.0017718451953125,offset:0},ounce:{name:"ounce",base:L.MASS,prefixes:j.NONE,value:.028349523125,offset:0},poundmass:{name:"poundmass",base:L.MASS,prefixes:j.NONE,value:.45359237,offset:0},hundredweight:{name:"hundredweight",base:L.MASS,prefixes:j.NONE,value:45.359237,offset:0},stick:{name:"stick",base:L.MASS,prefixes:j.NONE,value:.115,offset:0},stone:{name:"stone",base:L.MASS,prefixes:j.NONE,value:6.35029318,offset:0},gr:{name:"gr",base:L.MASS,prefixes:j.NONE,value:6479891e-11,offset:0},dr:{name:"dr",base:L.MASS,prefixes:j.NONE,value:.0017718451953125,offset:0},oz:{name:"oz",base:L.MASS,prefixes:j.NONE,value:.028349523125,offset:0},lbm:{name:"lbm",base:L.MASS,prefixes:j.NONE,value:.45359237,offset:0},cwt:{name:"cwt",base:L.MASS,prefixes:j.NONE,value:45.359237,offset:0},s:{name:"s",base:L.TIME,prefixes:j.SHORT,value:1,offset:0},min:{name:"min",base:L.TIME,prefixes:j.NONE,value:60,offset:0},h:{name:"h",base:L.TIME,prefixes:j.NONE,value:3600,offset:0},second:{name:"second",base:L.TIME,prefixes:j.LONG,value:1,offset:0},sec:{name:"sec",base:L.TIME,prefixes:j.LONG,value:1,offset:0},minute:{name:"minute",base:L.TIME,prefixes:j.NONE,value:60,offset:0},hour:{name:"hour",base:L.TIME,prefixes:j.NONE,value:3600,offset:0},day:{name:"day",base:L.TIME,prefixes:j.NONE,value:86400,offset:0},week:{name:"week",base:L.TIME,prefixes:j.NONE,value:604800,offset:0},month:{name:"month",base:L.TIME,prefixes:j.NONE,value:2629800,offset:0},year:{name:"year",base:L.TIME,prefixes:j.NONE,value:31557600,offset:0},decade:{name:"decade",base:L.TIME,prefixes:j.NONE,value:315576e3,offset:0},century:{name:"century",base:L.TIME,prefixes:j.NONE,value:315576e4,offset:0},millennium:{name:"millennium",base:L.TIME,prefixes:j.NONE,value:315576e5,offset:0},hertz:{name:"Hertz",base:L.FREQUENCY,prefixes:j.LONG,value:1,offset:0,reciprocal:!0},Hz:{name:"Hz",base:L.FREQUENCY,prefixes:j.SHORT,value:1,offset:0,reciprocal:!0},rad:{name:"rad",base:L.ANGLE,prefixes:j.SHORT,value:1,offset:0},radian:{name:"radian",base:L.ANGLE,prefixes:j.LONG,value:1,offset:0},deg:{name:"deg",base:L.ANGLE,prefixes:j.SHORT,value:null,offset:0},degree:{name:"degree",base:L.ANGLE,prefixes:j.LONG,value:null,offset:0},grad:{name:"grad",base:L.ANGLE,prefixes:j.SHORT,value:null,offset:0},gradian:{name:"gradian",base:L.ANGLE,prefixes:j.LONG,value:null,offset:0},cycle:{name:"cycle",base:L.ANGLE,prefixes:j.NONE,value:null,offset:0},arcsec:{name:"arcsec",base:L.ANGLE,prefixes:j.NONE,value:null,offset:0},arcmin:{name:"arcmin",base:L.ANGLE,prefixes:j.NONE,value:null,offset:0},A:{name:"A",base:L.CURRENT,prefixes:j.SHORT,value:1,offset:0},ampere:{name:"ampere",base:L.CURRENT,prefixes:j.LONG,value:1,offset:0},K:{name:"K",base:L.TEMPERATURE,prefixes:j.NONE,value:1,offset:0},degC:{name:"degC",base:L.TEMPERATURE,prefixes:j.NONE,value:1,offset:273.15},degF:{name:"degF",base:L.TEMPERATURE,prefixes:j.NONE,value:1/1.8,offset:459.67},degR:{name:"degR",base:L.TEMPERATURE,prefixes:j.NONE,value:1/1.8,offset:0},kelvin:{name:"kelvin",base:L.TEMPERATURE,prefixes:j.NONE,value:1,offset:0},celsius:{name:"celsius",base:L.TEMPERATURE,prefixes:j.NONE,value:1,offset:273.15},fahrenheit:{name:"fahrenheit",base:L.TEMPERATURE,prefixes:j.NONE,value:1/1.8,offset:459.67},rankine:{name:"rankine",base:L.TEMPERATURE,prefixes:j.NONE,value:1/1.8,offset:0},mol:{name:"mol",base:L.AMOUNT_OF_SUBSTANCE,prefixes:j.SHORT,value:1,offset:0},mole:{name:"mole",base:L.AMOUNT_OF_SUBSTANCE,prefixes:j.LONG,value:1,offset:0},cd:{name:"cd",base:L.LUMINOUS_INTENSITY,prefixes:j.SHORT,value:1,offset:0},candela:{name:"candela",base:L.LUMINOUS_INTENSITY,prefixes:j.LONG,value:1,offset:0},N:{name:"N",base:L.FORCE,prefixes:j.SHORT,value:1,offset:0},newton:{name:"newton",base:L.FORCE,prefixes:j.LONG,value:1,offset:0},dyn:{name:"dyn",base:L.FORCE,prefixes:j.SHORT,value:1e-5,offset:0},dyne:{name:"dyne",base:L.FORCE,prefixes:j.LONG,value:1e-5,offset:0},lbf:{name:"lbf",base:L.FORCE,prefixes:j.NONE,value:4.4482216152605,offset:0},poundforce:{name:"poundforce",base:L.FORCE,prefixes:j.NONE,value:4.4482216152605,offset:0},kip:{name:"kip",base:L.FORCE,prefixes:j.LONG,value:4448.2216,offset:0},kilogramforce:{name:"kilogramforce",base:L.FORCE,prefixes:j.NONE,value:9.80665,offset:0},J:{name:"J",base:L.ENERGY,prefixes:j.SHORT,value:1,offset:0},joule:{name:"joule",base:L.ENERGY,prefixes:j.SHORT,value:1,offset:0},erg:{name:"erg",base:L.ENERGY,prefixes:j.NONE,value:1e-7,offset:0},Wh:{name:"Wh",base:L.ENERGY,prefixes:j.SHORT,value:3600,offset:0},BTU:{name:"BTU",base:L.ENERGY,prefixes:j.BTU,value:1055.05585262,offset:0},eV:{name:"eV",base:L.ENERGY,prefixes:j.SHORT,value:1602176565e-28,offset:0},electronvolt:{name:"electronvolt",base:L.ENERGY,prefixes:j.LONG,value:1602176565e-28,offset:0},W:{name:"W",base:L.POWER,prefixes:j.SHORT,value:1,offset:0},watt:{name:"watt",base:L.POWER,prefixes:j.LONG,value:1,offset:0},hp:{name:"hp",base:L.POWER,prefixes:j.NONE,value:745.6998715386,offset:0},VAR:{name:"VAR",base:L.POWER,prefixes:j.SHORT,value:x.I,offset:0},VA:{name:"VA",base:L.POWER,prefixes:j.SHORT,value:1,offset:0},Pa:{name:"Pa",base:L.PRESSURE,prefixes:j.SHORT,value:1,offset:0},psi:{name:"psi",base:L.PRESSURE,prefixes:j.NONE,value:6894.75729276459,offset:0},atm:{name:"atm",base:L.PRESSURE,prefixes:j.NONE,value:101325,offset:0},bar:{name:"bar",base:L.PRESSURE,prefixes:j.SHORTLONG,value:1e5,offset:0},torr:{name:"torr",base:L.PRESSURE,prefixes:j.NONE,value:133.322,offset:0},mmHg:{name:"mmHg",base:L.PRESSURE,prefixes:j.NONE,value:133.322,offset:0},mmH2O:{name:"mmH2O",base:L.PRESSURE,prefixes:j.NONE,value:9.80665,offset:0},cmH2O:{name:"cmH2O",base:L.PRESSURE,prefixes:j.NONE,value:98.0665,offset:0},coulomb:{name:"coulomb",base:L.ELECTRIC_CHARGE,prefixes:j.LONG,value:1,offset:0},C:{name:"C",base:L.ELECTRIC_CHARGE,prefixes:j.SHORT,value:1,offset:0},farad:{name:"farad",base:L.ELECTRIC_CAPACITANCE,prefixes:j.LONG,value:1,offset:0},F:{name:"F",base:L.ELECTRIC_CAPACITANCE,prefixes:j.SHORT,value:1,offset:0},volt:{name:"volt",base:L.ELECTRIC_POTENTIAL,prefixes:j.LONG,value:1,offset:0},V:{name:"V",base:L.ELECTRIC_POTENTIAL,prefixes:j.SHORT,value:1,offset:0},ohm:{name:"ohm",base:L.ELECTRIC_RESISTANCE,prefixes:j.SHORTLONG,value:1,offset:0},henry:{name:"henry",base:L.ELECTRIC_INDUCTANCE,prefixes:j.LONG,value:1,offset:0},H:{name:"H",base:L.ELECTRIC_INDUCTANCE,prefixes:j.SHORT,value:1,offset:0},siemens:{name:"siemens",base:L.ELECTRIC_CONDUCTANCE,prefixes:j.LONG,value:1,offset:0},S:{name:"S",base:L.ELECTRIC_CONDUCTANCE,prefixes:j.SHORT,value:1,offset:0},weber:{name:"weber",base:L.MAGNETIC_FLUX,prefixes:j.LONG,value:1,offset:0},Wb:{name:"Wb",base:L.MAGNETIC_FLUX,prefixes:j.SHORT,value:1,offset:0},tesla:{name:"tesla",base:L.MAGNETIC_FLUX_DENSITY,prefixes:j.LONG,value:1,offset:0},T:{name:"T",base:L.MAGNETIC_FLUX_DENSITY,prefixes:j.SHORT,value:1,offset:0},b:{name:"b",base:L.BIT,prefixes:j.BINARY_SHORT,value:1,offset:0},bits:{name:"bits",base:L.BIT,prefixes:j.BINARY_LONG,value:1,offset:0},B:{name:"B",base:L.BIT,prefixes:j.BINARY_SHORT,value:8,offset:0},bytes:{name:"bytes",base:L.BIT,prefixes:j.BINARY_LONG,value:8,offset:0}},z={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 F(e){if("BigNumber"===e.number){var t=y(w);q.rad.value=new w(1),q.deg.value=t.div(180),q.grad.value=t.div(200),q.cycle.value=t.times(2),q.arcsec.value=t.div(648e3),q.arcmin.value=t.div(10800)}else q.rad.value=1,q.deg.value=Math.PI/180,q.grad.value=Math.PI/200,q.cycle.value=2*Math.PI,q.arcsec.value=Math.PI/648e3,q.arcmin.value=Math.PI/10800;q.radian.value=q.rad.value,q.degree.value=q.deg.value,q.gradian.value=q.grad.value}F(a),i&&i("config",(function(e,t){e.number!==t.number&&F(e)}));var H={si:{NONE:{unit:U,prefix:j.NONE[""]},LENGTH:{unit:q.m,prefix:j.SHORT[""]},MASS:{unit:q.g,prefix:j.SHORT.k},TIME:{unit:q.s,prefix:j.SHORT[""]},CURRENT:{unit:q.A,prefix:j.SHORT[""]},TEMPERATURE:{unit:q.K,prefix:j.SHORT[""]},LUMINOUS_INTENSITY:{unit:q.cd,prefix:j.SHORT[""]},AMOUNT_OF_SUBSTANCE:{unit:q.mol,prefix:j.SHORT[""]},ANGLE:{unit:q.rad,prefix:j.SHORT[""]},BIT:{unit:q.bits,prefix:j.SHORT[""]},FORCE:{unit:q.N,prefix:j.SHORT[""]},ENERGY:{unit:q.J,prefix:j.SHORT[""]},POWER:{unit:q.W,prefix:j.SHORT[""]},PRESSURE:{unit:q.Pa,prefix:j.SHORT[""]},ELECTRIC_CHARGE:{unit:q.C,prefix:j.SHORT[""]},ELECTRIC_CAPACITANCE:{unit:q.F,prefix:j.SHORT[""]},ELECTRIC_POTENTIAL:{unit:q.V,prefix:j.SHORT[""]},ELECTRIC_RESISTANCE:{unit:q.ohm,prefix:j.SHORT[""]},ELECTRIC_INDUCTANCE:{unit:q.H,prefix:j.SHORT[""]},ELECTRIC_CONDUCTANCE:{unit:q.S,prefix:j.SHORT[""]},MAGNETIC_FLUX:{unit:q.Wb,prefix:j.SHORT[""]},MAGNETIC_FLUX_DENSITY:{unit:q.T,prefix:j.SHORT[""]},FREQUENCY:{unit:q.Hz,prefix:j.SHORT[""]}}};H.cgs=JSON.parse(JSON.stringify(H.si)),H.cgs.LENGTH={unit:q.m,prefix:j.SHORT.c},H.cgs.MASS={unit:q.g,prefix:j.SHORT[""]},H.cgs.FORCE={unit:q.dyn,prefix:j.SHORT[""]},H.cgs.ENERGY={unit:q.erg,prefix:j.NONE[""]},H.us=JSON.parse(JSON.stringify(H.si)),H.us.LENGTH={unit:q.ft,prefix:j.NONE[""]},H.us.MASS={unit:q.lbm,prefix:j.NONE[""]},H.us.TEMPERATURE={unit:q.degF,prefix:j.NONE[""]},H.us.FORCE={unit:q.lbf,prefix:j.NONE[""]},H.us.ENERGY={unit:q.BTU,prefix:j.BTU[""]},H.us.POWER={unit:q.hp,prefix:j.NONE[""]},H.us.PRESSURE={unit:q.psi,prefix:j.NONE[""]},H.auto=JSON.parse(JSON.stringify(H.si));var Z=H.auto;for(var W in S.setUnitSystem=function(e){if(!(0,Ye.nr)(H,e))throw new Error("Unit system "+e+" does not exist. Choices are: "+Object.keys(H).join(", "));Z=H[e]},S.getUnitSystem=function(){for(var e in H)if((0,Ye.nr)(H,e)&&H[e]===Z)return e},S.typeConverters={BigNumber:function(e){return new w(e+"")},Fraction:function(e){return new E(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]},q)if((0,Ye.nr)(q,W)){var G=q[W];G.dimensions=G.base.dimensions}for(var J in z)if((0,Ye.nr)(z,J)){var $=q[z[J]],V={};for(var K in $)(0,Ye.nr)($,K)&&(V[K]=$[K]);V.name=J,q[J]=V}return S.isValidAlpha=function(e){return/^[a-zA-Z]$/.test(e)},S.createUnit=function(e,t){if("object"!=typeof e)throw new TypeError("createUnit expects first parameter to be of type 'Object'");if(t&&t.override)for(var n in e)if((0,Ye.nr)(e,n)&&S.deleteUnit(n),e[n].aliases)for(var r=0;r<e[n].aliases.length;r++)S.deleteUnit(e[n].aliases[r]);var i;for(var a in e)(0,Ye.nr)(e,a)&&(i=S.createUnitSingle(a,e[a]));return i},S.createUnitSingle=function(e,t,n){if(null==t&&(t={}),"string"!=typeof e)throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");if((0,Ye.nr)(q,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(r=e.charAt(t),0===t&&!S.isValidAlpha(r))throw new Error('Invalid unit name (must begin with alpha character): "'+e+'"');if(t>0&&!S.isValidAlpha(r)&&!k(r))throw new Error('Invalid unit name (only alphanumeric characters are allowed): "'+e+'"')}}(e);var i,a,o,s=null,u=[],l=0;if(t&&"Unit"===t.type)s=t.clone();else if("string"==typeof t)""!==t&&(i=t);else{if("object"!=typeof t)throw new TypeError('Cannot create unit "'+e+'" from "'+t.toString()+'": expecting "string" or "Unit" or "Object"');i=t.definition,a=t.prefixes,l=t.offset,o=t.baseName,t.aliases&&(u=t.aliases.valueOf())}if(u)for(var c=0;c<u.length;c++)if((0,Ye.nr)(q,u[c]))throw new Error('Cannot create alias "'+u[c]+'": a unit with that name already exists');if(i&&"string"==typeof i&&!s)try{s=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&&(s=i.clone());u=u||[],l=l||0,a=a&&a.toUpperCase&&j[a.toUpperCase()]||j.NONE;var f={};if(s){f={name:e,value:s.value,dimensions:s.dimensions.slice(0),prefixes:a,offset:l};var d=!1;for(var p in L)if((0,Ye.nr)(L,p)){for(var h=!0,m=0;m<R.length;m++)if(Math.abs((f.dimensions[m]||0)-(L[p].dimensions[m]||0))>1e-12){h=!1;break}if(h){d=!0,f.base=L[p];break}}if(!d){o=o||e+"_STUFF";var v={dimensions:s.dimensions.slice(0)};v.key=o,L[o]=v,Z[o]={unit:f,prefix:j.NONE[""]},f.base=L[o]}}else{if(o=o||e+"_STUFF",R.indexOf(o)>=0)throw new Error('Cannot create new base unit "'+e+'": a base unit with that name already exists (and cannot be overridden)');for(var y in R.push(o),L)(0,Ye.nr)(L,y)&&(L[y].dimensions[R.length-1]=0);for(var g={dimensions:[]},_=0;_<R.length;_++)g.dimensions[_]=0;g.dimensions[R.length-1]=1,g.key=o,L[o]=g,f={name:e,value:1,dimensions:L[o].dimensions.slice(0),prefixes:a,offset:l,base:L[o]},Z[o]={unit:f,prefix:j.NONE[""]}}S.UNITS[e]=f;for(var b=0;b<u.length;b++){var x=u[b],w={};for(var E in f)(0,Ye.nr)(f,E)&&(w[E]=f[E]);w.name=x,S.UNITS[x]=w}return delete D.cache,new S(null,e)},S.deleteUnit=function(e){delete S.UNITS[e]},S.PREFIXES=j,S.BASE_DIMENSIONS=R,S.BASE_UNITS=L,S.UNIT_SYSTEMS=H,S.UNITS=q,S}),{isClass:!0}),Wd="createUnit",Gd=["typed","Unit"],Jd=(0,i.d5)(Wd,Gd,(e=>{var{typed:t,Unit:n}=e;return t(Wd,{"Object, Object":function(e,t){return n.createUnit(e,t)},Object:function(e){return n.createUnit(e,{})},"string, Unit | string | Object, Object":function(e,t,r){var i={};return i[e]=t,n.createUnit(i,r)},"string, Unit | string | Object":function(e,t){var r={};return r[e]=t,n.createUnit(r,{})},string:function(e){var t={};return t[e]={},n.createUnit(t,{})}})})),$d=["config","typed","matrix","addScalar","equal","subtract","abs","atan","cos","sin","multiplyScalar","inv","bignumber","multiply","add"],Vd=(0,i.d5)("eigs",$d,(e=>{var{config:t,typed:n,matrix:r,addScalar:i,subtract:a,equal:o,abs:s,atan:u,cos:l,sin:c,multiplyScalar:f,inv:d,bignumber:p,multiply:h,add:m}=e;return n("eigs",{Array:function(e){var t=r(e),n=t.size();if(2!==n.length||n[0]!==n[1])throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(n)+")");var i=v(t,n[0]);return{values:i[0],vectors:i[1]}},Matrix:function(e){var t=e.size();if(2!==t.length||t[0]!==t[1])throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");var n=v(e,t[0]);return{values:r(n[0]),vectors:r(n[1])}}});function v(e,n){var r=e.datatype();if(void 0===r&&(r=e.getDataType()),"number"!==r&&"BigNumber"!==r&&"Fraction"!==r)throw"mixed"===r?new TypeError("Mixed matrix element type is not supported"):new TypeError("Matrix element type not supported ("+r+")");if(function(e,t){for(var n=0;n<t;n++)for(var r=n;r<t;r++)if(!o(e[n][r],e[r][n]))throw new TypeError("Input matrix is not symmetric")}(e.toArray(),n),"number"===r)return y(e.toArray());if("Fraction"===r){for(var i=e.toArray(),l=0;l<n;l++)for(var c=l;c<n;c++)i[l][c]=i[l][c].valueOf(),i[c][l]=i[l][c];return y(e.toArray())}return"BigNumber"===r?function(e){for(var n,r=e.length,i=s(t.epsilon/r),o=new Array(r),l=0;l<r;l++)o[l]=S(r,0),o[l][l]=1;for(var c,m,v,y,g=E(e);s(g[1])>=s(i);){var x=g[0][0],w=g[0][1];e=b(e,(c=e[x][x],m=e[w][w],v=e[x][w],y=void 0,y=a(m,c),n=s(y)<=t.epsilon?p(-1).acos().div(4):f(.5,u(h(2,v,d(y))))),x,w),o=_(o,n,x,w),g=E(e)}for(var M=S(r,0),k=0;k<r;k++)M[k]=e[k][k];return N((0,Ye.d9)(M),(0,Ye.d9)(o))}(e.toArray()):void 0}function y(e){for(var n,r=e.length,i=Math.abs(t.epsilon/r),a=new Array(r),o=0;o<r;o++)a[o]=S(r,0),a[o][o]=1;for(var s=w(e);Math.abs(s[1])>=Math.abs(i);){var u=s[0][0],l=s[0][1];e=x(e,(c=e[u][u],f=e[l][l],d=e[u][l],p=void 0,p=f-c,n=Math.abs(p)<=t.epsilon?Math.PI/4:.5*Math.atan(2*d/(f-c))),u,l),a=g(a,n,u,l),s=w(e)}for(var c,f,d,p,h=S(r,0),m=0;m<r;m++)h[m]=e[m][m];return N((0,Ye.d9)(h),(0,Ye.d9)(a))}function g(e,t,n,r){for(var i=e.length,a=Math.cos(t),o=Math.sin(t),s=S(i,0),u=S(i,0),l=0;l<i;l++)s[l]=a*e[l][n]-o*e[l][r],u[l]=o*e[l][n]+a*e[l][r];for(var c=0;c<i;c++)e[c][n]=s[c],e[c][r]=u[c];return e}function _(e,t,n,r){for(var o=e.length,s=l(t),u=c(t),d=S(o,p(0)),h=S(o,p(0)),m=0;m<o;m++)d[m]=a(f(s,e[m][n]),f(u,e[m][r])),h[m]=i(f(u,e[m][n]),f(s,e[m][r]));for(var v=0;v<o;v++)e[v][n]=d[v],e[v][r]=h[v];return e}function b(e,t,n,r){for(var o=e.length,s=p(l(t)),u=p(c(t)),d=f(s,s),v=f(u,u),y=S(o,p(0)),g=S(o,p(0)),_=h(p(2),s,u,e[n][r]),b=i(a(f(d,e[n][n]),_),f(v,e[r][r])),x=m(f(v,e[n][n]),_,f(d,e[r][r])),w=0;w<o;w++)y[w]=a(f(s,e[n][w]),f(u,e[r][w])),g[w]=i(f(u,e[n][w]),f(s,e[r][w]));e[n][n]=b,e[r][r]=x,e[n][r]=p(0),e[r][n]=p(0);for(var E=0;E<o;E++)E!==n&&E!==r&&(e[n][E]=y[E],e[E][n]=y[E],e[r][E]=g[E],e[E][r]=g[E]);return e}function x(e,t,n,r){for(var i=e.length,a=Math.cos(t),o=Math.sin(t),s=a*a,u=o*o,l=S(i,0),c=S(i,0),f=s*e[n][n]-2*a*o*e[n][r]+u*e[r][r],d=u*e[n][n]+2*a*o*e[n][r]+s*e[r][r],p=0;p<i;p++)l[p]=a*e[n][p]-o*e[r][p],c[p]=o*e[n][p]+a*e[r][p];e[n][n]=f,e[r][r]=d,e[n][r]=0,e[r][n]=0;for(var h=0;h<i;h++)h!==n&&h!==r&&(e[n][h]=l[h],e[h][n]=l[h],e[r][h]=c[h],e[h][r]=c[h]);return e}function w(e){for(var t=e.length,n=0,r=[0,1],i=0;i<t;i++)for(var a=i+1;a<t;a++)Math.abs(n)<Math.abs(e[i][a])&&(n=Math.abs(e[i][a]),r=[i,a]);return[r,n]}function E(e){for(var t=e.length,n=0,r=[0,1],i=0;i<t;i++)for(var a=i+1;a<t;a++)s(n)<s(e[i][a])&&(n=s(e[i][a]),r=[i,a]);return[r,n]}function N(e,t){for(var n=e.length,r=Array(n),i=Array(n),a=0;a<n;a++)i[a]=Array(n);for(var o=0;o<n;o++){for(var s=0,u=e[0],l=0;l<e.length;l++)e[l]<u&&(u=e[s=l]);r[o]=e.splice(s,1)[0];for(var c=0;c<n;c++)i[c][o]=t[c][s],t[c].splice(s,1)}return[(0,Ye.d9)(r),(0,Ye.d9)(i)]}function S(e,t){for(var n=new Array(e),r=0;r<e;r++)n[r]=t;return n}})),Kd=["typed","config","abs","add","addScalar","matrix","multiply","multiplyScalar","divideScalar","subtract","smaller","equalScalar"],Yd=(0,i.d5)("intersect",Kd,(e=>{var{typed:t,config:n,abs:r,add:i,addScalar:a,matrix:o,multiply:s,multiplyScalar:u,divideScalar:c,subtract:f,smaller:d,equalScalar:p}=e;return t("intersect",{"Array, Array, Array":function(e,t,n){if(!v(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!v(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!function(e){return 4===e.length&&h(e[0])&&h(e[1])&&h(e[2])&&h(e[3])}(n))throw new TypeError("Array with 4 numbers expected as third argument");return function(e,t,n,r,i,o,s,l,d,p){var h=u(e,s),m=u(r,s),v=u(t,l),y=u(i,l),g=u(n,d),_=u(o,d),b=c(f(f(f(p,h),v),g),f(f(f(a(a(m,y),_),h),v),g));return[a(e,u(b,f(r,e))),a(t,u(b,f(i,t))),a(n,u(b,f(o,n)))]}(e[0],e[1],e[2],t[0],t[1],t[2],n[0],n[1],n[2],n[3])},"Array, Array, Array, Array":function(e,t,o,l){if(2===e.length){if(!m(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!m(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!m(o))throw new TypeError("Array with 2 numbers or BigNumbers expected for third argument");if(!m(l))throw new TypeError("Array with 2 numbers or BigNumbers expected for fourth argument");return function(e,t,o,l){var p=e,h=o,m=f(p,t),v=f(h,l),y=f(u(m[0],v[1]),u(v[0],m[1]));if(d(r(y),n.epsilon))return null;var g=u(v[0],p[1]),_=u(v[1],p[0]),b=u(v[0],h[1]),x=u(v[1],h[0]),w=c(a(f(f(g,_),b),x),y);return i(s(m,w),p)}(e,t,o,l)}if(3===e.length){if(!v(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!v(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!v(o))throw new TypeError("Array with 3 numbers or BigNumbers expected for third argument");if(!v(l))throw new TypeError("Array with 3 numbers or BigNumbers expected for fourth argument");return h=e[0],g=e[1],_=e[2],b=t[0],x=t[1],w=t[2],E=o[0],N=o[1],S=o[2],C=y(h,E,M=l[0],E,g,N,k=l[1],N,_,S,O=l[2],S),A=y(M,E,b,h,k,N,x,g,O,S,w,_),T=y(h,E,b,h,g,N,x,g,_,S,w,_),I=y(M,E,M,E,k,N,k,N,O,S,O,S),D=y(b,h,b,h,x,g,x,g,w,_,w,_),P=c(f(u(C,A),u(T,I)),f(u(D,I),u(A,A))),j=c(a(C,u(P,A)),I),R=a(h,u(P,f(b,h))),L=a(g,u(P,f(x,g))),B=a(_,u(P,f(w,_))),U=a(E,u(j,f(M,E))),q=a(N,u(j,f(k,N))),z=a(S,u(j,f(O,S))),p(R,U)&&p(L,q)&&p(B,z)?[R,L,B]:null}throw new TypeError("Arrays with two or thee dimensional points expected");var h,g,_,b,x,w,E,N,S,M,k,O,C,A,T,I,D,P,j,R,L,B,U,q,z},"Matrix, Matrix, Matrix":function(e,t,n){return o(this(e.valueOf(),t.valueOf(),n.valueOf()))},"Matrix, Matrix, Matrix, Matrix":function(e,t,n,r){return o(this(e.valueOf(),t.valueOf(),n.valueOf(),r.valueOf()))}});function h(e){return"number"==typeof e||(0,l.l9)(e)}function m(e){return 2===e.length&&h(e[0])&&h(e[1])}function v(e){return 3===e.length&&h(e[0])&&h(e[1])&&h(e[2])}function y(e,t,n,r,i,o,s,l,c,d,p,h){var m=u(f(e,t),f(n,r)),v=u(f(i,o),f(s,l)),y=u(f(c,d),f(p,h));return a(a(m,v),y)}})),Xd="usolve",Qd=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],ep=(0,i.d5)(Xd,Qd,(e=>{var{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(Xd,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var n=(t=u(e,t,!0))._data,l=e._size[0],c=e._size[1],f=e._values,d=e._index,p=e._ptr,h=[],m=c-1;m>=0;m--){var v=n[m][0]||0;if(o(v,0))h[m]=[0];else{for(var y=0,g=[],_=[],b=p[m],x=p[m+1]-1;x>=b;x--){var w=d[x];w===m?y=f[x]:w<m&&(g.push(f[x]),_.push(w))}if(o(y,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var E=r(v,y),N=0,S=_.length;N<S;N++){var M=_[N];n[M]=[a(n[M][0],i(E,g[N]))]}h[m]=[E]}}return new s({data:h,size:[l,1]})}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return l(e,t)},"Array, Array | Matrix":function(e,t){return l(n(e),t).valueOf()}});function l(e,t){for(var n=(t=u(e,t,!0))._data,l=e._size[0],c=e._size[1],f=[],d=e._data,p=c-1;p>=0;p--){var h=n[p][0]||0,m=void 0;if(o(h,0))m=0;else{var v=d[p][p];if(o(v,0))throw new Error("Linear system cannot be solved since matrix is singular");m=r(h,v);for(var y=p-1;y>=0;y--)n[y]=[a(n[y][0]||0,i(m,d[y][p]))]}f[p]=[m]}return new s({data:f,size:[l,1]})}})),tp="norm",np=["typed","abs","add","pow","conj","sqrt","multiply","equalScalar","larger","smaller","matrix","ctranspose","eigs"],rp=(0,i.d5)(tp,np,(e=>{var{typed:t,abs:n,add:r,pow:i,conj:a,sqrt:o,multiply:s,equalScalar:u,larger:l,smaller:c,matrix:f,ctranspose:d,eigs:p}=e;return t(tp,{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 h(f(e),2)},Matrix:function(e){return h(e,2)},"number | Complex | BigNumber | boolean, number | BigNumber | string":function(e){return this(e)},"Array, number | BigNumber | string":function(e,t){return h(f(e),t)},"Matrix, number | BigNumber | string":function(e,t){return h(e,t)}});function h(e,t){var f=e.size();if(1===f.length)return function(e,t){if(t===Number.POSITIVE_INFINITY||"inf"===t)return function(e){var t=0;return e.forEach((function(e){var r=n(e);l(r,t)&&(t=r)}),!0),t}(e);if(t===Number.NEGATIVE_INFINITY||"-inf"===t)return function(e){var t;return e.forEach((function(e){var r=n(e);t&&!c(r,t)||(t=r)}),!0),t||0}(e);if("fro"===t)return h(e,2);if("number"==typeof t&&!isNaN(t)){if(!u(t,0)){var a=0;return e.forEach((function(e){a=r(i(n(e),t),a)}),!0),i(a,1/t)}return Number.POSITIVE_INFINITY}throw new Error("Unsupported parameter value")}(e,t);if(2===f.length){if(f[0]&&f[1])return function(e,t){if(1===t)return function(e){var t=[],i=0;return e.forEach((function(e,a){var o=a[1],s=r(t[o]||0,n(e));l(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=r(t[o]||0,n(e));l(s,i)&&(i=s),t[o]=s}),!0),i}(e);if("fro"===t)return function(e){var t=0;return e.forEach((function(e,n){t=r(t,s(e,a(e)))})),n(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 r=d(e),i=s(r,e),a=p(i).values,u=a.get([a.size()[0]-1]);return n(o(u))}(e);throw new Error("Unsupported parameter value "+t)}(e,t);throw new RangeError("Invalid matrix dimensions")}}}));function ip(e,t){var n,r=t.length,i=[];if(e)for(n=0;n<r;n++)i[e[n]]=t[n];else for(n=0;n<r;n++)i[n]=t[n];return i}var ap="lusolve",op=["typed","matrix","lup","slu","usolve","lsolve","DenseMatrix"],sp=(0,i.d5)(ap,op,(e=>{var{typed:t,matrix:n,lup:r,slu:i,usolve:a,lsolve:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(ap,{"Array, Array | Matrix":function(e,t){e=n(e);var i=r(e);return f(i.L,i.U,i.p,null,t).valueOf()},"DenseMatrix, Array | Matrix":function(e,t){var n=r(e);return f(n.L,n.U,n.p,null,t)},"SparseMatrix, Array | Matrix":function(e,t){var n=r(e);return f(n.L,n.U,n.p,null,t)},"SparseMatrix, Array | Matrix, number, number":function(e,t,n,r){var a=i(e,n,r);return f(a.L,a.U,a.p,a.q,t)},"Object, Array | Matrix":function(e,t){return f(e.L,e.U,e.p,e.q,t)}});function c(e){if((0,l.SW)(e))return e;if((0,l.kJ)(e))return n(e);throw new TypeError("Invalid Matrix LU decomposition")}function f(e,t,n,r,i){e=c(e),t=c(t),n&&((i=u(e,i,!0))._data=ip(n,i._data));var s=o(e,i),l=a(t,s);return r&&(l._data=ip(r,l._data)),l}})),up="sqrtm",lp=["typed","abs","add","multiply","sqrt","subtract","inv","size","max","identity"],cp=(0,i.d5)(up,lp,(e=>{var{typed:t,abs:n,add:r,multiply:i,sqrt:a,subtract:o,inv:s,size:u,max:c,identity:f}=e,d=1e-6;function p(e){var t,a=0,l=e,p=f(u(e));do{var h=l;if(l=i(.5,r(h,s(p))),p=i(.5,r(p,s(h))),(t=c(n(o(l,h))))>d&&++a>1e3)throw new Error("computing square root of matrix: iterative method could not converge")}while(t>d);return l}return t(up,{"Array | Matrix":function(e){var t=(0,l.SW)(e)?e.size():(0,Ve.aJ)(e);switch(t.length){case 1:if(1===t[0])return a(e);throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");case 2:if(t[0]===t[1])return p(e);throw new RangeError("Matrix must be square (size: "+(0,Ke.WU)(t)+")");default:throw new RangeError("Matrix must be at most two dimensional (size: "+(0,Ke.WU)(t)+")")}}})})),fp="multinomial",dp=["typed","add","divide","multiply","factorial","isInteger","isPositive"],pp=(0,i.d5)(fp,dp,(e=>{var{typed:t,add:n,divide:r,multiply:i,factorial:a,isInteger:o,isPositive:s}=e;return t(fp,{"Array | Matrix":function(e){var t=0,u=1;return(0,ut.Et)(e,(function(e){if(!o(e)||!s(e))throw new TypeError("Positive integer value expected in function multinomial");t=n(t,e),u=i(u,a(e))})),r(a(t),u)}})})),hp="rotationMatrix",mp=["typed","config","multiplyScalar","addScalar","unaryMinus","norm","matrix","BigNumber","DenseMatrix","SparseMatrix","cos","sin"],vp=(0,i.d5)(hp,mp,(e=>{var{typed:t,config:n,multiplyScalar:r,addScalar:i,unaryMinus:a,norm:o,BigNumber:s,matrix:u,DenseMatrix:c,SparseMatrix:f,cos:d,sin:p}=e;return t(hp,{"":function(){return"Matrix"===n.matrix?u([]):[]},string:function(e){return u(e)},"number | BigNumber | Complex | Unit":function(e){return h(e,"Matrix"===n.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 n=u(t);return m(n),g(e,n,void 0)},"number | BigNumber | Complex | Unit, Matrix":function(e,t){m(t);var r=t.storage()||("Matrix"===n.matrix?"dense":void 0);return g(e,t,r)},"number | BigNumber | Complex | Unit, Array, string":function(e,t,n){var r=u(t);return m(r),g(e,r,n)},"number | BigNumber | Complex | Unit, Matrix, string":function(e,t,n){return m(t),g(e,t,n)}});function h(e,t){var n=(0,l.l9)(e)?new s(-1):-1,i=d(e),a=p(e);return y([[i,r(n,a)],[a,i]],t)}function m(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(((e,t)=>r(e,t)))}function y(e,t){if(t){if("sparse"===t)return new f(e);if("dense"===t)return new c(e);throw new TypeError('Unknown matrix type "'.concat(t,'"'))}return e}function g(e,t,n){var r=o(t);if(0===r)throw new RangeError("Rotation around zero vector");var u=(0,l.l9)(e)?s:null,c=u?new u(1):1,f=u?new u(-1):-1,h=u?new u(t.get([0])/r):t.get([0])/r,m=u?new u(t.get([1])/r):t.get([1])/r,g=u?new u(t.get([2])/r):t.get([2])/r,_=d(e),b=i(c,a(_)),x=p(e);return y([[i(_,v([h,h,b])),i(v([h,m,b]),v([f,g,x])),i(v([h,g,b]),v([m,x]))],[i(v([h,m,b]),v([g,x])),i(_,v([m,m,b])),i(v([m,g,b]),v([f,h,x]))],[i(v([h,g,b]),v([f,m,x])),i(v([m,g,b]),v([h,x])),i(_,v([g,g,b]))]],n)}})),yp="median",gp=["typed","add","divide","compare","partitionSelect"],_p=(0,i.d5)(yp,gp,(e=>{var{typed:t,add:n,divide:r,compare:i,partitionSelect:a}=e;function o(e){try{var t=(e=(0,Ve.xH)(e.valueOf())).length;if(0===t)throw new Error("Cannot calculate median of an empty array");if(t%2==0){for(var n=t/2-1,r=a(e,n+1),o=e[n],l=0;l<n;++l)i(e[l],o)>0&&(o=e[l]);return u(o,r)}var c=a(e,(t-1)/2);return s(c)}catch(e){throw(0,Lc.x)(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 r(n(e,t),2)}});return t(yp,{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("median(A, dim) is not yet supported")},"...":function(e){if((0,ut.CQ)(e))throw new TypeError("Scalar values expected in function median");return o(e)}})})),bp="rotate",xp=["typed","multiply","rotationMatrix"],wp=(0,i.d5)(bp,xp,(e=>{var{typed:t,multiply:n,rotationMatrix:r}=e;return t(bp,{"Array , number | BigNumber | Complex | Unit":function(e,t){return i(e,2),n(r(t),e).toArray()},"Matrix , number | BigNumber | Complex | Unit":function(e,t){return i(e,2),n(r(t),e)},"Array, number | BigNumber | Complex | Unit, Array | Matrix":function(e,t,a){return i(e,3),n(r(t,a),e)},"Matrix, number | BigNumber | Complex | Unit, Array | Matrix":function(e,t,a){return i(e,3),n(r(t,a),e)}});function i(e,t){var n=Array.isArray(e)?(0,Ve.aJ)(e):e.size();if(n.length>2)throw new RangeError("Vector must be of dimensions 1x".concat(t));if(2===n.length&&1!==n[1])throw new RangeError("Vector must be of dimensions 1x".concat(t));if(n[0]!==t)throw new RangeError("Vector must be of dimensions 1x".concat(t))}})),Ep=["typed","abs","map","median","subtract"],Np=(0,i.d5)("mad",Ep,(e=>{var{typed:t,abs:n,map:r,median:i,subtract:a}=e;return t("mad",{"Array | Matrix":o,"...":function(e){return o(e)}});function o(e){if(0===(e=(0,Ve.xH)(e.valueOf())).length)throw new Error("Cannot calculate median absolute deviation (mad) of an empty array");try{var t=i(e);return i(r(e,(function(e){return n(a(e,t))})))}catch(e){throw e instanceof TypeError&&-1!==e.message.indexOf("median")?new TypeError(e.message.replace("median","mad")):(0,Lc.x)(e,"mad")}}})),Sp="unit",Mp=["typed","Unit"],kp=(0,i.d5)(Sp,Mp,(e=>{var{typed:t,Unit:n}=e;return t(Sp,{Unit:function(e){return e.clone()},string:function(e){return n.isValuelessUnit(e)?new n(null,e):n.parse(e,{allowNoUnits:!0})},"number | BigNumber | Fraction | Complex, string":function(e,t){return new n(e,t)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Op=n(7773),Cp=n(7592),Ap=n(7238),Tp=n(3685),Ip=n(7726),Dp=n(1598),Pp=n(2349),jp=n(8911),Rp=n(7797),Lp=n(6012),Bp=n(8980),Up=n(7359),qp=n(4723),zp=o({}),Fp=f({}),Hp=p({}),Zp=N({}),Wp=S({}),Gp=E({}),Jp=H({config:r.v}),$p=W({}),Vp=J({}),Kp=B({Complex:Fp}),Yp=D({BigNumber:Jp,config:r.v}),Xp=j({BigNumber:Jp,config:r.v}),Qp=k({BigNumber:Jp,config:r.v}),eh=O({BigNumber:Jp,config:r.v}),th=R({BigNumber:Jp,config:r.v}),nh=C({BigNumber:Jp,config:r.v}),rh=we({BigNumber:Jp,config:r.v}),ih=pe({BigNumber:Jp,config:r.v}),ah=Ie({BigNumber:Jp,config:r.v}),oh=xe({BigNumber:Jp,config:r.v}),sh=$e({}),uh=A({BigNumber:Jp,config:r.v}),lh=M({BigNumber:Jp,config:r.v}),ch=P({BigNumber:Jp,config:r.v}),fh=U({}),dh=et({Matrix:$p}),ph=T({BigNumber:Jp,config:r.v}),hh=it({BigNumber:Jp,Complex:Fp,DenseMatrix:dh,Fraction:sh}),mh=ft({typed:hh}),vh=ht({typed:hh}),yh=wt({typed:hh}),gh=St({typed:hh}),_h=Ct({config:r.v,typed:hh}),bh=Tt({typed:hh}),xh=Pt({typed:hh}),wh=Rt({Complex:Fp,typed:hh}),Eh=Ut({typed:hh}),Nh=pn({BigNumber:Jp,config:r.v,typed:hh}),Sh=(0,Op.j)({isInteger:mh,typed:hh}),Mh=vn({typed:hh}),kh=_n({Complex:Fp,typed:hh}),Oh=wn({Complex:Fp,config:r.v,typed:hh}),Ch=Nn({typed:hh}),Ah=kn({BigNumber:Jp,Fraction:sh,complex:wh,typed:hh}),Th=An({typed:hh}),Ih=Vn({typed:hh}),Dh=Yn({typed:hh}),Ph=Qn({typed:hh}),jh=or({typed:hh}),Rh=ur({typed:hh}),Lh=dr({typed:hh}),Bh=mr({typed:hh}),Uh=gr({typed:hh}),qh=Mr({typed:hh}),zh=kr({format:qh,typed:hh}),Fh=Ar({typed:hh}),Hh=Pr({typed:hh}),Zh=Lr({Complex:Fp,config:r.v,typed:hh}),Wh=ri({BigNumber:Jp,typed:hh}),Gh=oi({BigNumber:Jp,Complex:Fp,config:r.v,typed:hh}),Jh=li({BigNumber:Jp,Complex:Fp,config:r.v,typed:hh}),$h=di({Complex:Fp,config:r.v,typed:hh}),Vh=hi({typed:hh}),Kh=yi({Complex:Fp,config:r.v,typed:hh}),Yh=bi({typed:hh}),Xh=Ei({BigNumber:Jp,typed:hh}),Qh=Mi({BigNumber:Jp,typed:hh}),em=Ci({BigNumber:Jp,typed:hh}),tm=Ii({typed:hh}),nm=Pi({typed:hh}),rm=Ui({typed:hh}),im=Wi({config:r.v,typed:hh}),am=Vi({config:r.v,typed:hh}),om=I({BigNumber:Jp,config:r.v}),sm=Xi({typed:hh}),um=ta({isNumeric:vh,typed:hh}),lm=ia({typed:hh}),cm=sa({typed:hh}),fm=la({Fraction:sh,typed:hh}),dm=da({typed:hh}),pm=ma({typed:hh}),hm=ya({typed:hh}),mm=ba({Complex:Fp,config:r.v,typed:hh}),vm=wa({Complex:Fp,config:r.v,typed:hh}),ym=Sa({typed:hh}),gm=Oa({typed:hh}),_m=Ta({isNaN:gh,isNumeric:vh,typed:hh}),bm=Ia({format:qh,typed:hh}),xm=ja({Complex:Fp,config:r.v,typed:hh}),wm=Ba({BigNumber:Jp,typed:hh}),Em=qa({typed:hh}),Nm=Fa({typed:hh}),Sm=Za({BigNumber:Jp,typed:hh}),Mm=Ga({typed:hh}),km=Va({typed:hh}),Om=Qa({config:r.v,typed:hh}),Cm=L({BigNumber:Jp,config:r.v}),Am=no({typed:hh}),Tm=io({Matrix:$p,equalScalar:_h,typed:hh}),Im=so({DenseMatrix:dh,Matrix:$p,SparseMatrix:Tm,typed:hh}),Dm=co({BigNumber:Jp,Complex:Fp,Fraction:sh,config:r.v,isNegative:Am,matrix:Im,typed:hh,unaryMinus:dm}),Pm=Eo({BigNumber:Jp,DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh}),jm=jo({DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh}),Rm=qo({BigNumber:Jp,equalScalar:_h,matrix:Im,typed:hh}),Lm=Ho({BigNumber:Jp,config:r.v,matrix:Im,typed:hh}),Bm=Go({equalScalar:_h,matrix:Im,typed:hh}),Um=Yo({DenseMatrix:dh,matrix:Im,typed:hh}),qm=Qo({DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh}),zm=(0,Cp.k)({isInteger:mh,matrix:Im,typed:hh}),Fm=ns({DenseMatrix:dh,SparseMatrix:Tm,matrix:Im,typed:hh}),Hm=as({BigNumber:Jp,DenseMatrix:dh,SparseMatrix:Tm,config:r.v,matrix:Im,typed:hh}),Zm=ss({BigNumber:Jp,config:r.v,matrix:Im,typed:hh}),Wm=cs({isInteger:mh,matrix:Im,typed:hh}),Gm=hs({matrix:Im,config:r.v,typed:hh}),Jm=(0,Ap.q)({matrix:Im,typed:hh}),$m=ys({BigNumber:Jp,config:r.v,matrix:Im,typed:hh}),Vm=gs({format:qh,typed:hh}),Km=Ss({BigNumber:Jp,DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh,zeros:$m}),Ym=Ts({DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh,zeros:$m}),Xm=Ps({DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh,zeros:$m}),Qm=Ls({BigNumber:Jp,DenseMatrix:dh,Fraction:sh,config:r.v,equalScalar:_h,matrix:Im,typed:hh}),ev=qs({matrix:Im,typed:hh}),tv=Hs({DenseMatrix:dh,config:r.v,matrix:Im,typed:hh}),nv=Gs({DenseMatrix:dh,config:r.v,matrix:Im,typed:hh}),rv=Vs({DenseMatrix:dh,config:r.v,equalScalar:_h,matrix:Im,typed:hh}),iv=Ys({DenseMatrix:dh,smaller:tv}),av=Qs({larger:nv,smaller:tv}),ov=nu({SparseMatrix:Tm,typed:hh}),sv=au({BigNumber:Jp,Complex:Fp,config:r.v,typed:hh}),uv=cu({BigNumber:Jp,DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh}),lv=du({BigNumber:Jp,typed:hh}),cv=hu({DenseMatrix:dh,SparseMatrix:Tm,addScalar:pm,equalScalar:_h,matrix:Im,typed:hh}),fv=vu({addScalar:pm,conj:ym,multiplyScalar:Ch,size:Gm,typed:hh}),dv=_u({addScalar:pm,combinations:rm,isInteger:mh,isNegative:Am,isPositive:yh,larger:nv,typed:hh}),pv=wu({typed:hh}),hv=Nu({typed:hh}),mv=Mu({config:r.v,equalScalar:_h,matrix:Im,round:Km,typed:hh}),vv=Cu({addScalar:pm,dot:fv,equalScalar:_h,matrix:Im,multiplyScalar:Ch,typed:hh}),yv=Iu({equalScalar:_h,matrix:Im,multiplyScalar:Ch,typed:hh}),gv=Pu({typed:hh}),_v=Lu({matrix:Im,typed:hh}),bv=qu({config:r.v,matrix:Im}),xv=Hu({matrix:Im,typed:hh}),wv=Wu({matrix:Im,typed:hh}),Ev=Ju({Complex:Fp,config:r.v,fraction:fm,identity:Hm,matrix:Im,multiply:vv,number:bh,typed:hh}),Nv=Ku({DenseMatrix:dh,equalScalar:_h,matrix:Im,pow:Ev,typed:hh}),Sv=Qu({DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh,zeros:$m}),Mv=rl({compare:Qm,typed:hh}),kv=ol({compareText:ev,isZero:pv,typed:hh}),Ov=ll({DenseMatrix:dh,config:r.v,matrix:Im,typed:hh}),Cv=dl({compare:Qm,isNaN:gh,isNumeric:vh,typed:hh}),Av=hl({ImmutableDenseMatrix:iv}),Tv=yl({BigNumber:Jp,Complex:Fp,config:r.v,typed:hh}),Iv=_l({typed:hh}),Dv=wl({DenseMatrix:dh,Index:Av,compareNatural:Mv,size:Gm,subset:Jm,typed:hh}),Pv=Sl({DenseMatrix:dh,Index:Av,compareNatural:Mv,size:Gm,subset:Jm,typed:hh}),jv=Ol({Index:Av,compareNatural:Mv,size:Gm,subset:Jm,typed:hh}),Rv=Tl({compareNatural:Mv,typed:hh}),Lv=Dl({add:cv,matrix:Im,typed:hh}),Bv=jl({add:cv,compare:Qm,multiply:vv,partitionSelect:Cv,typed:hh}),Uv=zl({BigNumber:Jp,Complex:Fp,config:r.v,multiplyScalar:Ch,pow:Ev,typed:hh}),qv=Hl({BigNumber:Jp,typed:hh}),zv=Wl({equalScalar:_h,matrix:Im,typed:hh}),Fv=$l({DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh}),Hv=Yl({matrix:Im,multiplyScalar:Ch,typed:hh}),Zv=Ql({matrix:Im,typed:hh}),Wv=tc({bignumber:qv,fraction:fm,number:bh}),Gv=rc({equalScalar:_h,matrix:Im,not:jh,typed:hh,zeros:$m}),Jv=oc({DenseMatrix:dh,config:r.v,matrix:Im,typed:hh}),$v=lc({compare:Qm,compareNatural:Mv,matrix:Im,typed:hh}),Vv=(0,Tp.D)({config:r.v,numeric:Wv,smaller:tv,typed:hh}),Kv=fc({BigNumber:Jp,typed:hh}),Yv=hc({DenseMatrix:dh,Index:Av,compareNatural:Mv,size:Gm,subset:Jm,typed:hh}),Xv=yc({Index:Av,compareNatural:Mv,size:Gm,subset:Jm,typed:hh}),Qv=bc({Index:Av,typed:hh}),ey=(0,Ip.O)({add:cv,config:r.v,numeric:Wv,typed:hh}),ty=Ec({gamma:Uv,typed:hh}),ny=Mc({factorial:ty,typed:hh}),ry=Cc({config:r.v,equalScalar:_h,matrix:Im,round:Km,typed:hh}),iy=Ic({DenseMatrix:dh,addScalar:pm,equalScalar:_h,matrix:Im,typed:hh,unaryMinus:dm}),ay=Rc({matrix:Im,multiply:vv,subtract:iy,typed:hh}),oy=(0,Dp.M)({bignumber:qv,matrix:Im,config:r.v,larger:nv,largerEq:Ov,smaller:tv,smallerEq:Jv,typed:hh}),sy=(0,Pp.v)({Index:Av,matrix:Im,range:oy,typed:hh}),uy=qc({config:r.v,multiplyScalar:Ch,numeric:Wv,typed:hh}),ly=Hc({DenseMatrix:dh,equalScalar:_h,matrix:Im,typed:hh}),cy=(0,jp.J)({config:r.v,larger:nv,numeric:Wv,typed:hh}),fy=Gc({DenseMatrix:dh,Index:Av,compareNatural:Mv,size:Gm,subset:Jm,typed:hh}),dy=Vc({Index:Av,concat:zm,setDifference:Dv,size:Gm,subset:Jm,typed:hh}),py=Yc({Complex:Fp,ceil:ry,floor:mv,matrix:Im,typed:hh}),hy=(0,Rp.w)({Index:Av,matrix:Im,range:oy,typed:hh}),my=(0,Lp.J)({matrix:Im,number:bh,subtract:iy,typed:hh}),vy=ef({conj:ym,transpose:Zv,typed:hh}),yy=rf({equal:ly,typed:hh}),gy=sf({Index:Av,compareNatural:Mv,size:Gm,subset:Jm,typed:hh}),_y=lf({DenseMatrix:dh,matrix:Im,typed:hh}),by=df({numeric:Wv,typed:hh}),xy=mf({Complex:Fp,config:r.v,divideScalar:by,typed:hh}),wy=_f({DenseMatrix:dh,divideScalar:by,equalScalar:_h,matrix:Im,multiplyScalar:Ch,subtract:iy,typed:hh}),Ey=wf({DenseMatrix:dh,divideScalar:by,equalScalar:_h,matrix:Im,multiplyScalar:Ch,subtract:iy,typed:hh}),Ny=Nf({FibonacciHeap:av,addScalar:pm,equalScalar:_h}),Sy=kf({Index:Av,concat:zm,setIntersect:Pv,setSymDifference:dy,size:Gm,subset:Jm,typed:hh}),My=Cf({DenseMatrix:dh,Spa:Ny,SparseMatrix:Tm,abs:hv,addScalar:pm,divideScalar:by,equalScalar:_h,larger:nv,matrix:Im,multiplyScalar:Ch,subtract:iy,typed:hh,unaryMinus:dm}),ky=$f({SparseMatrix:Tm,abs:hv,add:cv,divideScalar:by,larger:nv,largerEq:Ov,multiply:vv,subtract:iy,transpose:Zv,typed:hh}),Oy=Kf({lup:My,matrix:Im,multiply:vv,subtract:iy,typed:hh,unaryMinus:dm}),Cy=Qf({abs:hv,addScalar:pm,divideScalar:by,multiplyScalar:Ch,sqrt:vm,subtract:iy,typed:hh,unaryMinus:dm}),Ay=nd({addScalar:pm,combinations:rm,divideScalar:by,factorial:ty,isInteger:mh,isNegative:Am,larger:nv,multiplyScalar:Ch,pow:Ev,subtract:iy,typed:hh}),Ty=ad({addScalar:pm,combinations:rm,divideScalar:by,isInteger:mh,isNegative:Am,multiplyScalar:Ch,typed:hh}),Iy=ud({prod:uy,size:Gm,typed:hh}),Dy=cd({Complex:Fp,config:r.v,divideScalar:by,typed:hh}),Py=pd({DenseMatrix:dh,divideScalar:by,equalScalar:_h,matrix:Im,typed:hh}),jy=vd({DenseMatrix:dh,divideScalar:by,equalScalar:_h,matrix:Im,multiplyScalar:Ch,subtract:iy,typed:hh}),Ry=_d({abs:hv,addScalar:pm,divideScalar:by,isPositive:yh,multiplyScalar:Ch,smaller:tv,sqrt:vm,typed:hh}),Ly=wd({addScalar:pm,complex:wh,conj:ym,divideScalar:by,equal:ly,identity:Hm,isZero:pv,matrix:Im,multiplyScalar:Ch,sign:Ah,sqrt:vm,subtract:iy,typed:hh,unaryMinus:dm,zeros:$m}),By=Nd({abs:hv,addScalar:pm,det:Oy,divideScalar:by,identity:Hm,matrix:Im,multiply:vv,typed:hh,unaryMinus:dm}),Uy=kd({abs:hv,add:cv,identity:Hm,inv:By,multiply:vv,typed:hh}),qy=Cd({divideScalar:by,equalScalar:_h,inv:By,matrix:Im,multiply:vv,typed:hh}),zy=(0,Bp.Q)({add:cv,divide:qy,typed:hh}),Fy=(0,Up.F)({add:cv,apply:Sh,divide:qy,isNaN:gh,multiply:vv,subtract:iy,typed:hh}),Hy=Id({divide:qy,dotDivide:Py,isNumeric:vh,log:Dy,matrix:Im,multiply:vv,sum:ey,typed:hh}),Zy=jd({addScalar:pm,isInteger:mh,isNegative:Am,stirlingS2:Ay,typed:hh}),Wy=Bd({Complex:Fp,config:r.v,divideScalar:by,log:Dy,typed:hh}),Gy=Zd({BigNumber:Jp,Complex:Fp,Fraction:sh,abs:hv,addScalar:pm,config:r.v,divideScalar:by,equal:ly,fix:py,format:qh,isNumeric:vh,multiplyScalar:Ch,number:bh,pow:Ev,round:Km,subtract:iy}),Jy=Jd({Unit:Gy,typed:hh}),$y=Vd({abs:hv,add:cv,addScalar:pm,atan:Vh,bignumber:qv,config:r.v,cos:Nm,equal:ly,inv:By,matrix:Im,multiply:vv,multiplyScalar:Ch,sin:Mm,subtract:iy,typed:hh}),Vy=Yd({abs:hv,add:cv,addScalar:pm,config:r.v,divideScalar:by,equalScalar:_h,matrix:Im,multiply:vv,multiplyScalar:Ch,smaller:tv,subtract:iy,typed:hh}),Ky=(0,qp.X)({sqrt:vm,typed:hh,variance:Fy}),Yy=Ee({BigNumber:Jp,Unit:Gy,config:r.v}),Xy=re({BigNumber:Jp,Unit:Gy,config:r.v}),Qy=Se({BigNumber:Jp,Unit:Gy,config:r.v}),eg=ie({BigNumber:Jp,Unit:Gy,config:r.v}),tg=ve({BigNumber:Jp,Unit:Gy,config:r.v}),ng=fe({BigNumber:Jp,Unit:Gy,config:r.v}),rg=Me({BigNumber:Jp,Unit:Gy,config:r.v}),ig=ke({BigNumber:Jp,Unit:Gy,config:r.v}),ag=V({BigNumber:Jp,Unit:Gy,config:r.v}),og=he({BigNumber:Jp,Unit:Gy,config:r.v}),sg=ue({BigNumber:Jp,Unit:Gy,config:r.v}),ug=X({BigNumber:Jp,Unit:Gy,config:r.v}),lg=Re({BigNumber:Jp,Unit:Gy,config:r.v}),cg=Ae({BigNumber:Jp,Unit:Gy,config:r.v}),fg=ye({BigNumber:Jp,Unit:Gy,config:r.v}),dg=Fe({BigNumber:Jp,Unit:Gy,config:r.v}),pg=Ue({BigNumber:Jp,Unit:Gy,config:r.v}),hg=He({BigNumber:Jp,Unit:Gy,config:r.v}),mg=me({BigNumber:Jp,Unit:Gy,config:r.v}),vg=Y({BigNumber:Jp,Unit:Gy,config:r.v}),yg=De({BigNumber:Jp,Unit:Gy,config:r.v}),gg=Pe({BigNumber:Jp,Unit:Gy,config:r.v}),_g=ee({BigNumber:Jp,Unit:Gy,config:r.v}),bg=ep({DenseMatrix:dh,divideScalar:by,equalScalar:_h,matrix:Im,multiplyScalar:Ch,subtract:iy,typed:hh}),xg=rp({abs:hv,add:cv,conj:ym,ctranspose:vy,eigs:$y,equalScalar:_h,larger:nv,matrix:Im,multiply:vv,pow:Ev,smaller:tv,sqrt:vm,typed:hh}),wg=sp({DenseMatrix:dh,lsolve:wy,lup:My,matrix:Im,slu:ky,typed:hh,usolve:bg}),Eg=cp({abs:hv,add:cv,identity:Hm,inv:By,max:cy,multiply:vv,size:Gm,sqrt:vm,subtract:iy,typed:hh}),Ng=pp({add:cv,divide:qy,factorial:ty,isInteger:mh,isPositive:yh,multiply:vv,typed:hh}),Sg=Ne({BigNumber:Jp,Unit:Gy,config:r.v}),Mg=ce({BigNumber:Jp,Unit:Gy,config:r.v}),kg=Q({BigNumber:Jp,Unit:Gy,config:r.v}),Og=de({BigNumber:Jp,Unit:Gy,config:r.v}),Cg=Be({BigNumber:Jp,Unit:Gy,config:r.v}),Ag=Oe({BigNumber:Jp,Unit:Gy,config:r.v}),Tg=Le({BigNumber:Jp,Unit:Gy,config:r.v}),Ig=se({BigNumber:Jp,Unit:Gy,config:r.v}),Dg=qe({BigNumber:Jp,Unit:Gy,config:r.v}),Pg=ge({BigNumber:Jp,Unit:Gy,config:r.v}),jg=$({BigNumber:Jp,Unit:Gy,config:r.v}),Rg=je({BigNumber:Jp,Unit:Gy,config:r.v}),Lg=vp({BigNumber:Jp,DenseMatrix:dh,SparseMatrix:Tm,addScalar:pm,config:r.v,cos:Nm,matrix:Im,multiplyScalar:Ch,norm:xg,sin:Mm,typed:hh,unaryMinus:dm}),Bg=_p({add:cv,compare:Qm,divide:qy,partitionSelect:Cv,typed:hh}),Ug=le({BigNumber:Jp,Unit:Gy,config:r.v}),qg=ne({BigNumber:Jp,Unit:Gy,config:r.v}),zg=ae({BigNumber:Jp,Unit:Gy,config:r.v}),Fg=Te({BigNumber:Jp,Unit:Gy,config:r.v}),Hg=ze({BigNumber:Jp,Unit:Gy,config:r.v}),Zg=be({BigNumber:Jp,Unit:Gy,config:r.v}),Wg=wp({multiply:vv,rotationMatrix:Lg,typed:hh}),Gg=Np({abs:hv,map:Bh,median:Bg,subtract:iy,typed:hh}),Jg=te({BigNumber:Jp,Unit:Gy,config:r.v}),$g=oe({BigNumber:Jp,Unit:Gy,config:r.v}),Vg=_e({BigNumber:Jp,Unit:Gy,config:r.v}),Kg=kp({Unit:Gy,typed:hh}),Yg=Ce({BigNumber:Jp,Unit:Gy,config:r.v}),Xg=K({BigNumber:Jp,Unit:Gy,config:r.v})},4961:(e,t,n)=>{"use strict";function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.actual=e,this.expected=t,this.relation=n,this.message="Dimension mismatch ("+(Array.isArray(e)?"["+e.join(", ")+"]":e)+" "+(this.relation||"!=")+" "+(Array.isArray(t)?"["+t.join(", ")+"]":t)+")",this.stack=(new Error).stack}n.d(t,{m:()=>r}),r.prototype=new RangeError,r.prototype.constructor=RangeError,r.prototype.name="DimensionError",r.prototype.isDimensionError=!0},1647:(e,t,n)=>{"use strict";function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.index=e,arguments.length<3?(this.min=0,this.max=t):(this.min=t,this.max=n),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}n.d(t,{c:()=>r}),r.prototype=new RangeError,r.prototype.constructor=RangeError,r.prototype.name="IndexError",r.prototype.isIndexError=!0},7773:(e,t,n)=>{"use strict";n.d(t,{j:()=>l});var r=n(8794),i=n(4444),a=n(5542),o=n(1647),s="apply",u=["typed","isInteger"],l=(0,r.d5)(s,u,(e=>{var{typed:t,isInteger:n}=e;return t(s,{"Array | Matrix, number | BigNumber, function":function(e,t,r){if(!n(t))throw new TypeError("Integer number expected for dimension");var s=Array.isArray(e)?(0,i.aJ)(e):e.size();if(t<0||t>=s.length)throw new o.c(t,s.length);return(0,a.SW)(e)?e.create(c(e.valueOf(),t,r)):c(e,t,r)}})}));function c(e,t,n){var r,i,a;if(t<=0){if(Array.isArray(e[0])){for(a=function(e){var t,n,r=e.length,i=e[0].length,a=[];for(n=0;n<i;n++){var o=[];for(t=0;t<r;t++)o.push(e[t][n]);a.push(o)}return a}(e),i=[],r=0;r<a.length;r++)i[r]=c(a[r],t-1,n);return i}return n(e)}for(i=[],r=0;r<e.length;r++)i[r]=c(e[r],t-1,n);return i}},7797:(e,t,n)=>{"use strict";n.d(t,{w:()=>u});var r=n(8794),i=n(5254),a=n(4444),o="column",s=["typed","Index","matrix","range"],u=(0,r.d5)(o,s,(e=>{var{typed:t,Index:n,matrix:r,range:s}=e;return t(o,{"Matrix, number":u,"Array, number":function(e,t){return u(r((0,i.d9)(e)),t).valueOf()}});function u(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");(0,a.Ls)(t,e.size()[1]);var r=s(0,e.size()[0]),i=new n(r,t);return e.subset(i)}}))},7592:(e,t,n)=>{"use strict";n.d(t,{k:()=>f});var r=n(5542),i=n(5254),a=n(4444),o=n(1647),s=n(4961),u=n(8794),l="concat",c=["typed","matrix","isInteger"],f=(0,u.d5)(l,c,(e=>{var{typed:t,matrix:n,isInteger:u}=e;return t(l,{"...Array | Matrix | number | BigNumber":function(e){var t,l,c=e.length,f=-1,p=!1,h=[];for(t=0;t<c;t++){var m=e[t];if((0,r.SW)(m)&&(p=!0),(0,r.hj)(m)||(0,r.l9)(m)){if(t!==c-1)throw new Error("Dimension must be specified as last argument");if(l=f,f=m.valueOf(),!u(f))throw new TypeError("Integer number expected for dimension");if(f<0||t>0&&f>l)throw new o.c(f,l+1)}else{var v=(0,i.d9)(m).valueOf(),y=(0,a.aJ)(v);if(h[t]=v,l=f,f=y.length-1,t>0&&f!==l)throw new s.m(l+1,f+1)}}if(0===h.length)throw new SyntaxError("At least one matrix expected");for(var g=h.shift();h.length;)g=d(g,h.shift(),f,0);return p?n(g):g},"...string":function(e){return e.join("")}})}));function d(e,t,n,r){if(r<n){if(e.length!==t.length)throw new s.m(e.length,t.length);for(var i=[],a=0;a<e.length;a++)i[a]=d(e[a],t[a],n,r+1);return i}return e.concat(t)}},6012:(e,t,n)=>{"use strict";n.d(t,{J:()=>u});var r=n(8794),i=n(9139),a=n(5542),o="diff",s=["typed","matrix","subtract","number"],u=(0,r.d5)(o,s,(e=>{var{typed:t,matrix:n,subtract:r,number:s}=e;return t(o,{"Array | Matrix":function(e){return(0,a.SW)(e)?n(l(e.toArray())):l(e)},"Array | Matrix, number":function(e,t){if(!(0,i.U)(t))throw new RangeError("Dimension must be a whole number");return(0,a.SW)(e)?n(u(e.toArray(),t)):u(e,t)},"Array | Matrix, BigNumber":function(e,t){return this(e,s(t))}});function u(e,t){if((0,a.SW)(e)&&(e=e.toArray()),!Array.isArray(e))throw RangeError("Array/Matrix does not have that many dimensions");if(t>0){var n=[];return e.forEach((e=>{n.push(u(e,t-1))})),n}if(0===t)return l(e);throw RangeError("Cannot have negative dimension")}function l(e){var t=[],n=e.length;if(n<2)return e;for(var r=1;r<n;r++)t.push(c(e[r-1],e[r]));return t}function c(e,t){(0,a.SW)(e)&&(e=e.toArray()),(0,a.SW)(t)&&(t=t.toArray());var n=Array.isArray(e),i=Array.isArray(t);if(n&&i)return function(e,t){if(e.length!==t.length)throw RangeError("Not all sub-arrays have the same length");for(var n=[],r=e.length,i=0;i<r;i++)n.push(c(e[i],t[i]));return n}(e,t);if(!n&&!i)return r(t,e);throw TypeError("Cannot calculate difference between 1 array and 1 non-array")}}))},1598:(e,t,n)=>{"use strict";n.d(t,{M:()=>s});var r=n(8794),i=n(5180),a="range",o=["typed","config","?matrix","?bignumber","smaller","smallerEq","larger","largerEq"],s=(0,r.d5)(a,o,(e=>{var{typed:t,config:n,matrix:r,bignumber:o,smaller:s,smallerEq:u,larger:l,largerEq:c}=e;return t(a,{string:d,"string, boolean":d,"number, number":function(e,t){return f(p(e,t,1))},"number, number, number":function(e,t,n){return f(p(e,t,n))},"number, number, boolean":function(e,t,n){return f(n?h(e,t,1):p(e,t,1))},"number, number, number, boolean":function(e,t,n,r){return f(r?h(e,t,n):p(e,t,n))},"BigNumber, BigNumber":function(e,t){return f(m(e,t,new(0,e.constructor)(1)))},"BigNumber, BigNumber, BigNumber":function(e,t,n){return f(m(e,t,n))},"BigNumber, BigNumber, boolean":function(e,t,n){var r=e.constructor;return f(n?v(e,t,new r(1)):m(e,t,new r(1)))},"BigNumber, BigNumber, BigNumber, boolean":function(e,t,n,r){return f(r?v(e,t,n):m(e,t,n))}});function f(e){return"Matrix"===n.matrix?r?r(e):(0,i.kX)():e}function d(e,t){var r=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(!r)throw new SyntaxError('String "'+e+'" is no valid range');return"BigNumber"===n.number?(void 0===o&&(0,i.R3)(),f((t?v:m)(o(r.start),o(r.end),o(r.step)))):f((t?h:p)(r.start,r.end,r.step))}function p(e,t,n){var r=[],i=e;if(n>0)for(;s(i,t);)r.push(i),i+=n;else if(n<0)for(;l(i,t);)r.push(i),i+=n;return r}function h(e,t,n){var r=[],i=e;if(n>0)for(;u(i,t);)r.push(i),i+=n;else if(n<0)for(;c(i,t);)r.push(i),i+=n;return r}function m(e,t,n){var r=o(0),i=[],a=e;if(n.gt(r))for(;s(a,t);)i.push(a),a=a.plus(n);else if(n.lt(r))for(;l(a,t);)i.push(a),a=a.plus(n);return i}function v(e,t,n){var r=o(0),i=[],a=e;if(n.gt(r))for(;u(a,t);)i.push(a),a=a.plus(n);else if(n.lt(r))for(;c(a,t);)i.push(a),a=a.plus(n);return i}}))},2349:(e,t,n)=>{"use strict";n.d(t,{v:()=>s});var r=n(8794),i=n(5254),a=n(4444),o=["typed","Index","matrix","range"],s=(0,r.d5)("row",o,(e=>{var{typed:t,Index:n,matrix:r,range:o}=e;return t("row",{"Matrix, number":s,"Array, number":function(e,t){return s(r((0,i.d9)(e)),t).valueOf()}});function s(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");(0,a.Ls)(t,e.size()[0]);var r=o(0,e.size()[1]),i=new n(t,r);return e.subset(i)}}))},7238:(e,t,n)=>{"use strict";n.d(t,{q:()=>f});var r=n(5542),i=n(5254),a=n(4444),o=n(3068),s=n(4961),u=n(8794),l="subset",c=["typed","matrix"],f=(0,u.d5)(l,c,(e=>{var{typed:t,matrix:n}=e;return t(l,{"Array, Index":function(e,t){var r=n(e).subset(t);return t.isScalar()?r:r.valueOf()},"Matrix, Index":function(e,t){return e.subset(t)},"Object, Index":h,"string, Index":d,"Array, Index, any":function(e,t,r){return n((0,i.d9)(e)).subset(t,r,void 0).valueOf()},"Array, Index, any, any":function(e,t,r,a){return n((0,i.d9)(e)).subset(t,r,a).valueOf()},"Matrix, Index, any":function(e,t,n){return e.clone().subset(t,n)},"Matrix, Index, any, any":function(e,t,n,r){return e.clone().subset(t,n,r)},"string, Index, string":p,"string, Index, string, string":p,"Object, Index, any":m})}));function d(e,t){if(!(0,r.dh)(t))throw new TypeError("Index expected");if(1!==t.size().length)throw new s.m(t.size().length,1);var n=e.length;(0,a.Ls)(t.min()[0],n),(0,a.Ls)(t.max()[0],n);var i=t.dimension(0),o="";return i.forEach((function(t){o+=e.charAt(t)})),o}function p(e,t,n,r){if(!t||!0!==t.isIndex)throw new TypeError("Index expected");if(1!==t.size().length)throw new s.m(t.size().length,1);if(void 0!==r){if("string"!=typeof r||1!==r.length)throw new TypeError("Single character expected as defaultValue")}else r=" ";var i=t.dimension(0);if(i.size()[0]!==n.length)throw new s.m(i.size()[0],n.length);var o=e.length;(0,a.Ls)(t.min()[0]),(0,a.Ls)(t.max()[0]);for(var u=[],l=0;l<o;l++)u[l]=e.charAt(l);if(i.forEach((function(e,t){u[e]=n.charAt(t[0])})),u.length>o)for(var c=o-1,f=u.length;c<f;c++)u[c]||(u[c]=r);return u.join("")}function h(e,t){if(1!==t.size().length)throw new s.m(t.size(),1);var n=t.dimension(0);if("string"!=typeof n)throw new TypeError("String expected as index to retrieve an object property");return(0,o.YF)(e,n)}function m(e,t,n){if(1!==t.size().length)throw new s.m(t.size(),1);var r=t.dimension(0);if("string"!=typeof r)throw new TypeError("String expected as index to retrieve an object property");var a=(0,i.d9)(e);return(0,o.nI)(a,r,n),a}},8911:(e,t,n)=>{"use strict";n.d(t,{J:()=>s});var r=n(4344),i=n(8794),a=n(7635),o=["typed","config","numeric","larger"],s=(0,i.d5)("max",o,(e=>{var{typed:t,config:n,numeric:i,larger:o}=e;return t("max",{"Array | Matrix":u,"Array | Matrix, number | BigNumber":function(e,t){return(0,r.u4)(e,t.valueOf(),s)},"...":function(e){if((0,r.CQ)(e))throw new TypeError("Scalar values expected in function max");return u(e)}});function s(e,t){try{return o(e,t)?e:t}catch(e){throw(0,a.x)(e,"max",t)}}function u(e){var t;if((0,r.Et)(e,(function(e){try{isNaN(e)&&"number"==typeof e?t=NaN:(void 0===t||o(e,t))&&(t=e)}catch(t){throw(0,a.x)(t,"max",e)}})),void 0===t)throw new Error("Cannot calculate max of an empty array");return"string"==typeof t&&(t=i(t,n.number)),t}}))},8980:(e,t,n)=>{"use strict";n.d(t,{Q:()=>l});var r=n(4344),i=n(4444),a=n(8794),o=n(7635),s="mean",u=["typed","add","divide"],l=(0,a.d5)(s,u,(e=>{var{typed:t,add:n,divide:a}=e;return t(s,{"Array | Matrix":u,"Array | Matrix, number | BigNumber":function(e,t){try{var s=(0,r.u4)(e,t,n),u=Array.isArray(e)?(0,i.aJ)(e):e.size();return a(s,u[t])}catch(e){throw(0,o.x)(e,"mean")}},"...":function(e){if((0,r.CQ)(e))throw new TypeError("Scalar values expected in function mean");return u(e)}});function u(e){var t,i=0;if((0,r.Et)(e,(function(e){try{t=void 0===t?e:n(t,e),i++}catch(t){throw(0,o.x)(t,"mean",e)}})),0===i)throw new Error("Cannot calculate the mean of an empty array");return a(t,i)}}))},3685:(e,t,n)=>{"use strict";n.d(t,{D:()=>s});var r=n(4344),i=n(8794),a=n(7635),o=["typed","config","numeric","smaller"],s=(0,i.d5)("min",o,(e=>{var{typed:t,config:n,numeric:i,smaller:o}=e;return t("min",{"Array | Matrix":u,"Array | Matrix, number | BigNumber":function(e,t){return(0,r.u4)(e,t.valueOf(),s)},"...":function(e){if((0,r.CQ)(e))throw new TypeError("Scalar values expected in function min");return u(e)}});function s(e,t){try{return o(e,t)?e:t}catch(e){throw(0,a.x)(e,"min",t)}}function u(e){var t;if((0,r.Et)(e,(function(e){try{isNaN(e)&&"number"==typeof e?t=NaN:(void 0===t||o(e,t))&&(t=e)}catch(t){throw(0,a.x)(t,"min",e)}})),void 0===t)throw new Error("Cannot calculate min of an empty array");return"string"==typeof t&&(t=i(t,n.number)),t}}))},4723:(e,t,n)=>{"use strict";n.d(t,{X:()=>i});var r=["typed","sqrt","variance"],i=(0,n(8794).d5)("std",r,(e=>{var{typed:t,sqrt:n,variance:r}=e;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 n(r.apply(null,arguments))}catch(e){throw e instanceof TypeError&&-1!==e.message.indexOf(" variance")?new TypeError(e.message.replace(" variance"," std")):e}}}))},7726:(e,t,n)=>{"use strict";n.d(t,{O:()=>s});var r=n(4344),i=n(8794),a=n(7635),o=["typed","config","add","numeric"],s=(0,i.d5)("sum",o,(e=>{var{typed:t,config:n,add:i,numeric:o}=e;return t("sum",{"Array | Matrix":s,"Array | Matrix, number | BigNumber":function(e,t){try{return(0,r.u4)(e,t,i)}catch(e){throw(0,a.x)(e,"sum")}},"...":function(e){if((0,r.CQ)(e))throw new TypeError("Scalar values expected in function sum");return s(e)}});function s(e){var t;return(0,r.Et)(e,(function(e){try{t=void 0===t?e:i(t,e)}catch(t){throw(0,a.x)(t,"sum",e)}})),void 0===t&&(t=o(0,n.number)),"string"==typeof t&&(t=o(t,n.number)),t}}))},7635:(e,t,n)=>{"use strict";n.d(t,{x:()=>i});var r=n(5542);function i(e,t,n){var i;return-1!==String(e).indexOf("Unexpected type")?(i=arguments.length>2?" (type: "+(0,r.kM)(n)+", value: "+JSON.stringify(n)+")":" (type: "+e.data.actual+")",new TypeError("Cannot calculate "+t+", unexpected type of argument"+i)):-1!==String(e).indexOf("complex numbers")?(i=arguments.length>2?" (type: "+(0,r.kM)(n)+", value: "+JSON.stringify(n)+")":"",new TypeError("Cannot calculate "+t+", no ordering relation is defined for complex numbers"+i)):e}},7359:(e,t,n)=>{"use strict";n.d(t,{F:()=>c});var r=n(4344),i=n(5542),a=n(8794),o=n(7635),s="unbiased",u="variance",l=["typed","add","subtract","multiply","divide","apply","isNaN"],c=(0,a.d5)(u,l,(e=>{var{typed:t,add:n,subtract:a,multiply:l,divide:c,apply:f,isNaN:d}=e;return t(u,{"Array | Matrix":function(e){return p(e,s)},"Array | Matrix, string":p,"Array | Matrix, number | BigNumber":function(e,t){return h(e,t,s)},"Array | Matrix, number | BigNumber, string":h,"...":function(e){return p(e,s)}});function p(e,t){var s,u=0;if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");if((0,r.Et)(e,(function(e){try{s=void 0===s?e:n(s,e),u++}catch(t){throw(0,o.x)(t,"variance",e)}})),0===u)throw new Error("Cannot calculate variance of an empty array");var f=c(s,u);if(s=void 0,(0,r.Et)(e,(function(e){var t=a(e,f);s=void 0===s?l(t,t):n(s,l(t,t))})),d(s))return s;switch(t){case"uncorrected":return c(s,u);case"biased":return c(s,u+1);case"unbiased":var p=(0,i.l9)(s)?s.mul(0):0;return 1===u?p:c(s,u-1);default:throw new Error('Unknown normalization "'+t+'". Choose "unbiased" (default), "uncorrected", or "biased".')}}function h(e,t,n){try{if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");return f(e,t,(e=>p(e,n)))}catch(e){throw(0,o.x)(e,"variance")}}}))},4444:(e,t,n)=>{"use strict";n.d(t,{aJ:()=>u,Gu:()=>c,Ls:()=>f,SI:()=>d,XL:()=>h,eu:()=>m,L9:()=>y,f4:()=>_,xH:()=>x,UI:()=>w,Ed:()=>E,hX:()=>N,U_:()=>S,v_:()=>M,yV:()=>k,D$:()=>O,$q:()=>C});var r=n(9139),i=n(5542),a=n(3014),o=n(4961),s=n(1647);function u(e){for(var t=[];Array.isArray(e);)t.push(e.length),e=e[0];return t}function l(e,t,n){var r,i=e.length;if(i!==t[n])throw new o.m(i,t[n]);if(n<t.length-1){var a=n+1;for(r=0;r<i;r++){var s=e[r];if(!Array.isArray(s))throw new o.m(t.length-1,t.length,"<");l(e[r],t,a)}}else for(r=0;r<i;r++)if(Array.isArray(e[r]))throw new o.m(t.length+1,t.length,">")}function c(e,t){if(0===t.length){if(Array.isArray(e))throw new o.m(e.length,0)}else l(e,t,0)}function f(e,t){if(!(0,i.hj)(e)||!(0,r.U)(e))throw new TypeError("Index must be an integer (value: "+e+")");if(e<0||"number"==typeof t&&e>=t)throw new s.c(e,t)}function d(e,t,n){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(!(0,i.hj)(e)||!(0,r.U)(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+(0,a.WU)(t)+")")})),p(e,t,0,void 0!==n?n:0),e}function p(e,t,n,r){var i,a,o=e.length,s=t[n],u=Math.min(o,s);if(e.length=s,n<t.length-1){var l=n+1;for(i=0;i<u;i++)a=e[i],Array.isArray(a)||(a=[a],e[i]=a),p(a,t,l,r);for(i=u;i<s;i++)a=[],e[i]=a,p(a,t,l,r)}else{for(i=0;i<u;i++)for(;Array.isArray(e[i]);)e[i]=e[i][0];for(i=u;i<s;i++)e[i]=r}}function h(e,t){var n=x(e),r=n.length;if(!Array.isArray(e)||!Array.isArray(t))throw new TypeError("Array expected");if(0===t.length)throw new o.m(0,r,"!=");var i=v(t=m(t,r));if(r!==i)throw new o.m(i,r,"!=");try{return function(e,t){for(var n,r=e,i=t.length-1;i>0;i--){var a=t[i];n=[];for(var o=r.length/a,s=0;s<o;s++)n.push(r.slice(s*a,(s+1)*a));r=n}return r}(n,t)}catch(e){if(e instanceof o.m)throw new o.m(i,r,"!=");throw e}}function m(e,t){var n=v(e),r=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%n!=0)throw new Error("Could not replace wildcard, since "+t+" is no multiple of "+-n);r[i]=-t/n}return r}function v(e){return e.reduce(((e,t)=>e*t),1)}function y(e,t){for(var n=t||u(e);Array.isArray(e)&&1===e.length;)e=e[0],n.shift();for(var r=n.length;1===n[r-1];)r--;return r<n.length&&(e=g(e,r,0),n.length=r),e}function g(e,t,n){var r,i;if(n<t){var a=n+1;for(r=0,i=e.length;r<i;r++)e[r]=g(e[r],t,a)}else for(;Array.isArray(e);)e=e[0];return e}function _(e,t,n,r){var i=r||u(e);if(n)for(var a=0;a<n;a++)e=[e],i.unshift(1);for(e=b(e,t,0);i.length<t;)i.push(1);return e}function b(e,t,n){var r,i;if(Array.isArray(e)){var a=n+1;for(r=0,i=e.length;r<i;r++)e[r]=b(e[r],t,a)}else for(var o=n;o<t;o++)e=[e];return e}function x(e){if(!Array.isArray(e))return e;var t=[];return e.forEach((function e(n){Array.isArray(n)?n.forEach(e):t.push(n)})),t}function w(e,t){return Array.prototype.map.call(e,t)}function E(e,t){Array.prototype.forEach.call(e,t)}function N(e,t){if(1!==u(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,t)}function S(e,t){if(1!==u(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,(e=>t.test(e)))}function M(e,t){return Array.prototype.join.call(e,t)}function k(e){if(!Array.isArray(e))throw new TypeError("Array input expected");if(0===e.length)return e;var t=[],n=0;t[0]={value:e[0],identifier:0};for(var r=1;r<e.length;r++)e[r]===e[r-1]?n++:n=0,t.push({value:e[r],identifier:n});return t}function O(e){if(!Array.isArray(e))throw new TypeError("Array input expected");if(0===e.length)return e;for(var t=[],n=0;n<e.length;n++)t.push(e[n].value);return t}function C(e,t){for(var n,r=0,i=0;i<e.length;i++){var a=e[i],o=Array.isArray(a);if(0===i&&o&&(r=a.length),o&&a.length!==r)return;var s=o?C(a,t):t(a);if(void 0===n)n=s;else if(n!==s)return"mixed"}return n}},4344:(e,t,n)=>{"use strict";n.d(t,{CQ:()=>o,Et:()=>s,Fh:()=>u,u4:()=>l,U6:()=>f});var r=n(5542),i=n(1647),a=n(4444);function o(e){for(var t=0;t<e.length;t++)if((0,r.uZ)(e[t]))return!0;return!1}function s(e,t){(0,r.SW)(e)&&(e=e.valueOf());for(var n=0,i=e.length;n<i;n++){var a=e[n];Array.isArray(a)?s(a,t):t(a)}}function u(e,t,n){return e&&"function"==typeof e.map?e.map((function(e){return u(e,t,n)})):t(e)}function l(e,t,n){var o=Array.isArray(e)?(0,a.aJ)(e):e.size();if(t<0||t>=o.length)throw new i.c(t,o.length);return(0,r.SW)(e)?e.create(c(e.valueOf(),t,n)):c(e,t,n)}function c(e,t,n){var r,i,a,o;if(t<=0){if(Array.isArray(e[0])){for(o=function(e){var t,n,r=e.length,i=e[0].length,a=[];for(n=0;n<i;n++){var o=[];for(t=0;t<r;t++)o.push(e[t][n]);a.push(o)}return a}(e),i=[],r=0;r<o.length;r++)i[r]=c(o[r],t-1,n);return i}for(a=e[0],r=1;r<e.length;r++)a=n(a,e[r]);return a}for(i=[],r=0;r<e.length;r++)i[r]=c(e[r],t-1,n);return i}function f(e,t,n,r,i,a,o,s,u,l,c){var f,d,p,h,m=e._values,v=e._index,y=e._ptr;if(r)for(d=y[t],p=y[t+1],f=d;f<p;f++)n[h=v[f]]!==a?(n[h]=a,o.push(h),l?(r[h]=u?s(m[f],c):s(c,m[f]),i[h]=a):r[h]=m[f]):(r[h]=u?s(m[f],r[h]):s(r[h],m[f]),i[h]=a);else for(d=y[t],p=y[t+1],f=d;f<p;f++)n[h=v[f]]!==a?(n[h]=a,o.push(h)):i[h]=a}},3068:(e,t,n)=>{"use strict";n.d(t,{YF:()=>i,nI:()=>a,pp:()=>o,np:()=>s,OJ:()=>u});var r=n(5254);function i(e,t){if(l(e)&&o(e,t))return e[t];if("function"==typeof e[t]&&u(e,t))throw new Error('Cannot access method "'+t+'" as a property');throw new Error('No access to property "'+t+'"')}function a(e,t,n){if(l(e)&&o(e,t))return e[t]=n,n;throw new Error('No access to property "'+t+'"')}function o(e,t){return!(!e||"object"!=typeof e||!(0,r.nr)(c,t)&&(t in Object.prototype||t in Function.prototype))}function s(e,t){if(!u(e,t))throw new Error('No access to method "'+t+'"')}function u(e,t){return!(null==e||"function"!=typeof e[t]||(0,r.nr)(e,t)&&Object.getPrototypeOf&&t in Object.getPrototypeOf(e)||!(0,r.nr)(f,t)&&(t in Object.prototype||t in Function.prototype))}function l(e){return"object"==typeof e&&e&&e.constructor===Object}var c={length:!0,name:!0},f={toString:!0,valueOf:!0,toLocaleString:!0}},8794:(e,t,n)=>{"use strict";n.d(t,{d5:()=>i});var r=n(5254);function i(e,t,n,i){function o(i){var o=(0,r.W6)(i,t.map(a));return function(e,t,n){if(!t.filter((e=>!function(e){return e&&"?"===e[0]}(e))).every((e=>void 0!==n[e]))){var r=t.filter((e=>void 0===n[e]));throw new Error('Cannot create function "'.concat(e,'", ')+"some dependencies are missing: ".concat(r.map((e=>'"'.concat(e,'"'))).join(", "),"."))}}(e,t,i),n(o)}return o.isFactory=!0,o.fn=e,o.dependencies=t.slice().sort(),i&&(o.meta=i),o}function a(e){return e&&"?"===e[0]?e.slice(1):e}},77:(e,t,n)=>{"use strict";function r(e){var t=0,n=1,r=Object.create(null),i=Object.create(null),a=0,o=function(e){var o=i[e];if(o&&(delete r[o],delete i[e],--t,n===o)){if(!t)return a=0,void(n=1);for(;!hasOwnProperty.call(r,++n););}};return e=Math.abs(e),{hit:function(s){var u=i[s],l=++a;if(r[l]=s,i[s]=l,!u){if(++t<=e)return;return s=r[n],o(s),s}if(delete r[u],n===u)for(;!hasOwnProperty.call(r,++n););},delete:o,clear:function(){t=a=0,n=1,r=Object.create(null),i=Object.create(null)}}}function i(e){var{hasher:t,limit:n}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};return n=null==n?Number.POSITIVE_INFINITY:n,t=null==t?JSON.stringify:t,function i(){"object"!=typeof i.cache&&(i.cache={values:new Map,lru:r(n||Number.POSITIVE_INFINITY)});for(var a=[],o=0;o<arguments.length;o++)a[o]=arguments[o];var s=t(a);if(i.cache.values.has(s))return i.cache.lru.hit(s),i.cache.values.get(s);var u=e.apply(e,a);return i.cache.values.set(s,u),i.cache.values.delete(i.cache.lru.hit(s)),u}}function a(e){return Object.keys(e.signatures||{}).reduce((function(e,t){var n=(t.match(/,/g)||[]).length+1;return Math.max(e,n)}),-1)}n.d(t,{oV:()=>a,HP:()=>i})},5542:(e,t,n)=>{"use strict";function r(e){return"number"==typeof e}function i(e){return e&&!0===e.constructor.prototype.isBigNumber||!1}function a(e){return e&&"object"==typeof e&&!0===Object.getPrototypeOf(e).isComplex||!1}function o(e){return e&&"object"==typeof e&&!0===Object.getPrototypeOf(e).isFraction||!1}function s(e){return e&&!0===e.constructor.prototype.isUnit||!1}function u(e){return"string"==typeof e}n.d(t,{hj:()=>r,l9:()=>i,Mc:()=>a,yQ:()=>o,wr:()=>s,HD:()=>u,kJ:()=>l,SW:()=>c,uZ:()=>f,jH:()=>d,sA:()=>p,bR:()=>h,dh:()=>m,jn:()=>v,cB:()=>y,x1:()=>g,mf:()=>_,J_:()=>b,Kj:()=>x,Kn:()=>w,Ft:()=>E,o8:()=>N,Yz:()=>S,j0:()=>M,Bp:()=>k,zh:()=>O,tS:()=>C,nu:()=>A,l7:()=>T,VO:()=>I,Cl:()=>D,UG:()=>P,Lr:()=>j,bV:()=>R,Ig:()=>L,ex:()=>B,FG:()=>U,qg:()=>q,kM:()=>z});var l=Array.isArray;function c(e){return e&&!0===e.constructor.prototype.isMatrix||!1}function f(e){return Array.isArray(e)||c(e)}function d(e){return e&&e.isDenseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function p(e){return e&&e.isSparseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function h(e){return e&&!0===e.constructor.prototype.isRange||!1}function m(e){return e&&!0===e.constructor.prototype.isIndex||!1}function v(e){return"boolean"==typeof e}function y(e){return e&&!0===e.constructor.prototype.isResultSet||!1}function g(e){return e&&!0===e.constructor.prototype.isHelp||!1}function _(e){return"function"==typeof e}function b(e){return e instanceof Date}function x(e){return e instanceof RegExp}function w(e){return!(!e||"object"!=typeof e||e.constructor!==Object||a(e)||o(e))}function E(e){return null===e}function N(e){return void 0===e}function S(e){return e&&!0===e.isAccessorNode&&!0===e.constructor.prototype.isNode||!1}function M(e){return e&&!0===e.isArrayNode&&!0===e.constructor.prototype.isNode||!1}function k(e){return e&&!0===e.isAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function O(e){return e&&!0===e.isBlockNode&&!0===e.constructor.prototype.isNode||!1}function C(e){return e&&!0===e.isConditionalNode&&!0===e.constructor.prototype.isNode||!1}function A(e){return e&&!0===e.isConstantNode&&!0===e.constructor.prototype.isNode||!1}function T(e){return e&&!0===e.isFunctionAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function I(e){return e&&!0===e.isFunctionNode&&!0===e.constructor.prototype.isNode||!1}function D(e){return e&&!0===e.isIndexNode&&!0===e.constructor.prototype.isNode||!1}function P(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 R(e){return e&&!0===e.isOperatorNode&&!0===e.constructor.prototype.isNode||!1}function L(e){return e&&!0===e.isParenthesisNode&&!0===e.constructor.prototype.isNode||!1}function B(e){return e&&!0===e.isRangeNode&&!0===e.constructor.prototype.isNode||!1}function U(e){return e&&!0===e.isSymbolNode&&!0===e.constructor.prototype.isNode||!1}function q(e){return e&&!0===e.constructor.prototype.isChain||!1}function z(e){var t=typeof e;return"object"===t?null===e?"null":Array.isArray(e)?"Array":e instanceof Date?"Date":e instanceof RegExp?"RegExp":i(e)?"BigNumber":a(e)?"Complex":o(e)?"Fraction":c(e)?"Matrix":s(e)?"Unit":m(e)?"Index":h(e)?"Range":y(e)?"ResultSet":P(e)?e.type:q(e)?"Chain":g(e)?"Help":"Object":"function"===t?"Function":t}},5180:(e,t,n)=>{"use strict";function r(){throw new Error('No "bignumber" implementation available')}function i(){throw new Error('No "fraction" implementation available')}function a(){throw new Error('No "matrix" implementation available')}n.d(t,{R3:()=>r,nG:()=>i,kX:()=>a})},9139:(e,t,n)=>{"use strict";n.d(t,{U:()=>i,Xx:()=>a,k3:()=>o,mv:()=>s,Kr:()=>u,eK:()=>l,t$:()=>c,WU:()=>d,FH:()=>h,nz:()=>g,RI:()=>b,__:()=>x,Vf:()=>w,C8:()=>E,f9:()=>N,R_:()=>S,AE:()=>M});var r=n(5542);function i(e){return"boolean"==typeof e||!!isFinite(e)&&e===Math.round(e)}var a=Math.sign||function(e){return e>0?1:e<0?-1:0},o=Math.log2||function(e){return Math.log(e)/Math.LN2},s=Math.log10||function(e){return Math.log(e)/Math.LN10},u=Math.log1p||function(e){return Math.log(e+1)},l=Math.cbrt||function(e){if(0===e)return e;var t,n=e<0;return n&&(e=-e),t=isFinite(e)?(e/((t=Math.exp(Math.log(e)/3))*t)+2*t)/3:e,n?-t:t},c=Math.expm1||function(e){return e>=2e-4||e<=-2e-4?Math.exp(e)-1:e+e*e/2+e*e*e/6};function f(e,t,n){var r={2:"0b",8:"0o",16:"0x"}[t],a="";if(n){if(n<1)throw new Error("size must be in greater than 0");if(!i(n))throw new Error("size must be an integer");if(e>2**(n-1)-1||e<-(2**(n-1)))throw new Error("Value must be in range [-2^".concat(n-1,", 2^").concat(n-1,"-1]"));if(!i(e))throw new Error("Value must be an integer");e<0&&(e+=2**n),a="i".concat(n)}var o="";return e<0&&(e=-e,o="-"),"".concat(o).concat(r).concat(e.toString(t)).concat(a)}function d(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 n,i,a="auto";if(t&&(t.notation&&(a=t.notation),(0,r.hj)(t)?n=t:(0,r.hj)(t.precision)&&(n=t.precision),t.wordSize&&"number"!=typeof(i=t.wordSize)))throw new Error('Option "wordSize" must be a number');switch(a){case"fixed":return h(e,n);case"exponential":return m(e,n);case"engineering":return function(e,t){if(isNaN(e)||!isFinite(e))return String(e);var n=v(p(e),t),i=n.exponent,a=n.coefficients,o=i%3==0?i:i<0?i-3-i%3:i-i%3;if((0,r.hj)(t))for(;t>a.length||i-o+1>a.length;)a.push(0);else for(var s=Math.abs(i-o)-(a.length-1),u=0;u<s;u++)a.push(0);for(var l=Math.abs(i-o),c=1;l>0;)c++,l--;var f=a.slice(c).join(""),d=(0,r.hj)(t)&&f.length||f.match(/[1-9]/)?"."+f:"",h=a.slice(0,c).join("")+d+"e"+(i>=0?"+":"")+o.toString();return n.sign+h}(e,n);case"bin":return f(e,2,i);case"oct":return f(e,8,i);case"hex":return f(e,16,i);case"auto":return function(e,t,n){if(isNaN(e)||!isFinite(e))return String(e);var r=n&&void 0!==n.lowerExp?n.lowerExp:-3,i=n&&void 0!==n.upperExp?n.upperExp:5,a=p(e),o=t?v(a,t):a;if(o.exponent<r||o.exponent>=i)return m(e,t);var s=o.coefficients,u=o.exponent;s.length<t&&(s=s.concat(y(t-s.length))),s=s.concat(y(u-s.length+1+(s.length<t?t-s.length:0)));var l=u>0?u:0;return l<(s=y(-u).concat(s)).length-1&&s.splice(l+1,0,"."),o.sign+s.join("")}(e,n,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 "'+a+'". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.')}}function p(e){var t=String(e).toLowerCase().match(/^0*?(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);if(!t)throw new SyntaxError("Invalid number "+e);var n=t[1],r=t[2],i=parseFloat(t[4]||"0"),a=r.indexOf(".");i+=-1!==a?a-1:r.length-1;var o=r.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:n,coefficients:o,exponent:i}}function h(e,t){if(isNaN(e)||!isFinite(e))return String(e);var n=p(e),r="number"==typeof t?v(n,n.exponent+1+t):n,i=r.coefficients,a=r.exponent+1,o=a+(t||0);return i.length<o&&(i=i.concat(y(o-i.length))),a<0&&(i=y(1-a).concat(i),a=1),a<i.length&&i.splice(a,0,0===a?"0.":"."),r.sign+i.join("")}function m(e,t){if(isNaN(e)||!isFinite(e))return String(e);var n=p(e),r=t?v(n,t):n,i=r.coefficients,a=r.exponent;i.length<t&&(i=i.concat(y(t-i.length)));var o=i.shift();return r.sign+o+(i.length>0?"."+i.join(""):"")+"e"+(a>=0?"+":"")+a}function v(e,t){for(var n={sign:e.sign,coefficients:e.coefficients,exponent:e.exponent},r=n.coefficients;t<=0;)r.unshift(0),n.exponent++,t++;if(r.length>t&&r.splice(t,r.length-t)[0]>=5){var i=t-1;for(r[i]++;10===r[i];)r.pop(),0===i&&(r.unshift(0),n.exponent++,i++),r[--i]++}return n}function y(e){for(var t=[],n=0;n<e;n++)t.push(0);return t}function g(e){return e.toExponential().replace(/e.*$/,"").replace(/^0\.?0*|\./,"").length}var _=Number.EPSILON||2220446049250313e-31;function b(e,t,n){if(null==n)return e===t;if(e===t)return!0;if(isNaN(e)||isNaN(t))return!1;if(isFinite(e)&&isFinite(t)){var r=Math.abs(e-t);return r<_||r<=Math.max(Math.abs(e),Math.abs(t))*n}return!1}var x=Math.acosh||function(e){return Math.log(Math.sqrt(e*e-1)+e)},w=Math.asinh||function(e){return Math.log(Math.sqrt(e*e+1)+e)},E=Math.atanh||function(e){return Math.log((1+e)/(1-e))/2},N=Math.cosh||function(e){return(Math.exp(e)+Math.exp(-e))/2},S=Math.sinh||function(e){return(Math.exp(e)-Math.exp(-e))/2},M=Math.tanh||function(e){var t=Math.exp(2*e);return(t-1)/(t+1)}},5254:(e,t,n)=>{"use strict";n.d(t,{d9:()=>i,l7:()=>a,J5:()=>o,Vo:()=>s,nr:()=>u,W6:()=>l});var r=n(5542);function i(e){var t=typeof 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 i(e)}));if(e instanceof Date)return new Date(e.valueOf());if((0,r.l9)(e))return e;if(e instanceof RegExp)throw new TypeError("Cannot clone "+e);return function(e,t){var n={};for(var r in e)u(e,r)&&(n[r]=t(e[r]));return n}(e,i)}function a(e,t){for(var n in t)u(t,n)&&(e[n]=t[n]);return e}function o(e,t){var n,r,i;if(Array.isArray(e)){if(!Array.isArray(t))return!1;if(e.length!==t.length)return!1;for(r=0,i=e.length;r<i;r++)if(!o(e[r],t[r]))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(n in e)if(!(n in t)||!o(e[n],t[n]))return!1;for(n in t)if(!(n in e)||!o(e[n],t[n]))return!1;return!0}return e===t}function s(e,t,n){var r,i=!0;Object.defineProperty(e,t,{get:function(){return i&&(r=n(),i=!1),r},set:function(e){r=e,i=!1},configurable:!0,enumerable:!0})}function u(e,t){return e&&Object.hasOwnProperty.call(e,t)}function l(e,t){for(var n={},r=0;r<t.length;r++){var i=t[r],a=e[i];void 0!==a&&(n[i]=a)}return n}},3014:(e,t,n)=>{"use strict";n.d(t,{cd:()=>d,pn:()=>s,YU:()=>c,WU:()=>u,Pz:()=>l});var r=n(5542),i=n(9139);function a(e,t,n){var r=new(0,e.constructor)(2),a="";if(n){if(n<1)throw new Error("size must be in greater than 0");if(!(0,i.U)(n))throw new Error("size must be an integer");if(e.greaterThan(r.pow(n-1).sub(1))||e.lessThan(r.pow(n-1).mul(-1)))throw new Error("Value must be in range [-2^".concat(n-1,", 2^").concat(n-1,"-1]"));if(!e.isInteger())throw new Error("Value must be an integer");e.lessThan(0)&&(e=e.add(r.pow(n))),a="i".concat(n)}switch(t){case 2:return"".concat(e.toBinary()).concat(a);case 8:return"".concat(e.toOctal()).concat(a);case 16:return"".concat(e.toHexadecimal()).concat(a);default:throw new Error("Base ".concat(t," not supported "))}}function o(e,t){return void 0!==t?e.toExponential(t-1):e.toExponential()}function s(e,t){var n=e.length-t.length,r=e.length;return e.substring(n,r)===t}function u(e,t){return"number"==typeof e?(0,i.WU)(e,t):(0,r.l9)(e)?function(e,t){if("function"==typeof t)return t(e);if(!e.isFinite())return e.isNaN()?"NaN":e.gt(0)?"Infinity":"-Infinity";var n,r,i="auto";if(void 0!==t&&(t.notation&&(i=t.notation),"number"==typeof t?n=t:t.precision&&(n=t.precision),t.wordSize&&"number"!=typeof(r=t.wordSize)))throw new Error('Option "wordSize" must be a number');switch(i){case"fixed":return function(e,t){return e.toFixed(t)}(e,n);case"exponential":return o(e,n);case"engineering":return function(e,t){var n=e.e,r=n%3==0?n:n<0?n-3-n%3:n-n%3,i=e.mul(Math.pow(10,-r)),a=i.toPrecision(t);return-1!==a.indexOf("e")&&(a=i.toString()),a+"e"+(n>=0?"+":"")+r.toString()}(e,n);case"bin":return a(e,2,r);case"oct":return a(e,8,r);case"hex":return a(e,16,r);case"auto":var s=t&&void 0!==t.lowerExp?t.lowerExp:-3,u=t&&void 0!==t.upperExp?t.upperExp:5;if(e.isZero())return"0";var l=e.toSignificantDigits(n),c=l.e;return(c>=s&&c<u?l.toFixed():o(e,n)).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.')}}(e,t):function(e){return e&&"object"==typeof e&&"number"==typeof e.s&&"number"==typeof e.n&&"number"==typeof e.d||!1}(e)?t&&"decimal"===t.fraction?e.toString():e.s*e.n+"/"+e.d:Array.isArray(e)?f(e,t):(0,r.HD)(e)?'"'+e+'"':"function"==typeof e?e.syntax?String(e.syntax):"function":e&&"object"==typeof e?"function"==typeof e.format?e.format(t):e&&e.toString(t)!=={}.toString()?e.toString(t):"{"+Object.keys(e).map((n=>'"'+n+'": '+u(e[n],t))).join(", ")+"}":String(e)}function l(e){for(var t=String(e),n="",r=0;r<t.length;){var i=t.charAt(r);"\\"===i?(n+=i,r++,""!==(i=t.charAt(r))&&-1!=='"\\/bfnrtu'.indexOf(i)||(n+="\\"),n+=i):n+='"'===i?'\\"':i,r++}return'"'+n+'"'}function c(e){var t=String(e);return t.replace(/&/g,"&amp;").replace(/"/g,"&quot;").replace(/'/g,"&#39;").replace(/</g,"&lt;").replace(/>/g,"&gt;")}function f(e,t){if(Array.isArray(e)){for(var n="[",r=e.length,i=0;i<r;i++)0!==i&&(n+=", "),n+=f(e[i],t);return n+"]"}return u(e,t)}function d(e,t){if(!(0,r.HD)(e))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+(0,r.kM)(e)+", index: 0)");if(!(0,r.HD)(t))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+(0,r.kM)(t)+", index: 1)");return e===t?0:e>t?1:-1}},5666:e=>{var t=function(e){"use strict";var t,n=Object.prototype,r=n.hasOwnProperty,i="function"==typeof Symbol?Symbol:{},a=i.iterator||"@@iterator",o=i.asyncIterator||"@@asyncIterator",s=i.toStringTag||"@@toStringTag";function u(e,t,n){return Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}),e[t]}try{u({},"")}catch(e){u=function(e,t,n){return e[t]=n}}function l(e,t,n,r){var i=t&&t.prototype instanceof v?t:v,a=Object.create(i.prototype),o=new O(r||[]);return a._invoke=function(e,t,n){var r=f;return function(i,a){if(r===p)throw new Error("Generator is already running");if(r===h){if("throw"===i)throw a;return A()}for(n.method=i,n.arg=a;;){var o=n.delegate;if(o){var s=S(o,n);if(s){if(s===m)continue;return s}}if("next"===n.method)n.sent=n._sent=n.arg;else if("throw"===n.method){if(r===f)throw r=h,n.arg;n.dispatchException(n.arg)}else"return"===n.method&&n.abrupt("return",n.arg);r=p;var u=c(e,t,n);if("normal"===u.type){if(r=n.done?h:d,u.arg===m)continue;return{value:u.arg,done:n.done}}"throw"===u.type&&(r=h,n.method="throw",n.arg=u.arg)}}}(e,n,o),a}function c(e,t,n){try{return{type:"normal",arg:e.call(t,n)}}catch(e){return{type:"throw",arg:e}}}e.wrap=l;var f="suspendedStart",d="suspendedYield",p="executing",h="completed",m={};function v(){}function y(){}function g(){}var _={};_[a]=function(){return this};var b=Object.getPrototypeOf,x=b&&b(b(C([])));x&&x!==n&&r.call(x,a)&&(_=x);var w=g.prototype=v.prototype=Object.create(_);function E(e){["next","throw","return"].forEach((function(t){u(e,t,(function(e){return this._invoke(t,e)}))}))}function N(e,t){function n(i,a,o,s){var u=c(e[i],e,a);if("throw"!==u.type){var l=u.arg,f=l.value;return f&&"object"==typeof f&&r.call(f,"__await")?t.resolve(f.__await).then((function(e){n("next",e,o,s)}),(function(e){n("throw",e,o,s)})):t.resolve(f).then((function(e){l.value=e,o(l)}),(function(e){return n("throw",e,o,s)}))}s(u.arg)}var i;this._invoke=function(e,r){function a(){return new t((function(t,i){n(e,r,t,i)}))}return i=i?i.then(a,a):a()}}function S(e,n){var r=e.iterator[n.method];if(r===t){if(n.delegate=null,"throw"===n.method){if(e.iterator.return&&(n.method="return",n.arg=t,S(e,n),"throw"===n.method))return m;n.method="throw",n.arg=new TypeError("The iterator does not provide a 'throw' method")}return m}var i=c(r,e.iterator,n.arg);if("throw"===i.type)return n.method="throw",n.arg=i.arg,n.delegate=null,m;var a=i.arg;return a?a.done?(n[e.resultName]=a.value,n.next=e.nextLoc,"return"!==n.method&&(n.method="next",n.arg=t),n.delegate=null,m):a:(n.method="throw",n.arg=new TypeError("iterator result is not an object"),n.delegate=null,m)}function M(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 k(e){var t=e.completion||{};t.type="normal",delete t.arg,e.completion=t}function O(e){this.tryEntries=[{tryLoc:"root"}],e.forEach(M,this),this.reset(!0)}function C(e){if(e){var n=e[a];if(n)return n.call(e);if("function"==typeof e.next)return e;if(!isNaN(e.length)){var i=-1,o=function n(){for(;++i<e.length;)if(r.call(e,i))return n.value=e[i],n.done=!1,n;return n.value=t,n.done=!0,n};return o.next=o}}return{next:A}}function A(){return{value:t,done:!0}}return y.prototype=w.constructor=g,g.constructor=y,y.displayName=u(g,s,"GeneratorFunction"),e.isGeneratorFunction=function(e){var t="function"==typeof e&&e.constructor;return!!t&&(t===y||"GeneratorFunction"===(t.displayName||t.name))},e.mark=function(e){return Object.setPrototypeOf?Object.setPrototypeOf(e,g):(e.__proto__=g,u(e,s,"GeneratorFunction")),e.prototype=Object.create(w),e},e.awrap=function(e){return{__await:e}},E(N.prototype),N.prototype[o]=function(){return this},e.AsyncIterator=N,e.async=function(t,n,r,i,a){void 0===a&&(a=Promise);var o=new N(l(t,n,r,i),a);return e.isGeneratorFunction(n)?o:o.next().then((function(e){return e.done?e.value:o.next()}))},E(w),u(w,s,"Generator"),w[a]=function(){return this},w.toString=function(){return"[object Generator]"},e.keys=function(e){var t=[];for(var n in e)t.push(n);return t.reverse(),function n(){for(;t.length;){var r=t.pop();if(r in e)return n.value=r,n.done=!1,n}return n.done=!0,n}},e.values=C,O.prototype={constructor:O,reset:function(e){if(this.prev=0,this.next=0,this.sent=this._sent=t,this.done=!1,this.delegate=null,this.method="next",this.arg=t,this.tryEntries.forEach(k),!e)for(var n in this)"t"===n.charAt(0)&&r.call(this,n)&&!isNaN(+n.slice(1))&&(this[n]=t)},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 n=this;function i(r,i){return s.type="throw",s.arg=e,n.next=r,i&&(n.method="next",n.arg=t),!!i}for(var a=this.tryEntries.length-1;a>=0;--a){var o=this.tryEntries[a],s=o.completion;if("root"===o.tryLoc)return i("end");if(o.tryLoc<=this.prev){var u=r.call(o,"catchLoc"),l=r.call(o,"finallyLoc");if(u&&l){if(this.prev<o.catchLoc)return i(o.catchLoc,!0);if(this.prev<o.finallyLoc)return i(o.finallyLoc)}else if(u){if(this.prev<o.catchLoc)return i(o.catchLoc,!0)}else{if(!l)throw new Error("try statement without catch or finally");if(this.prev<o.finallyLoc)return i(o.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,m):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),m},finish:function(e){for(var t=this.tryEntries.length-1;t>=0;--t){var n=this.tryEntries[t];if(n.finallyLoc===e)return this.complete(n.completion,n.afterLoc),k(n),m}},catch:function(e){for(var t=this.tryEntries.length-1;t>=0;--t){var n=this.tryEntries[t];if(n.tryLoc===e){var r=n.completion;if("throw"===r.type){var i=r.arg;k(n)}return i}}throw new Error("illegal catch attempt")},delegateYield:function(e,n,r){return this.delegate={iterator:C(e),resultName:n,nextLoc:r},"next"===this.method&&(this.arg=t),m}},e}(e.exports);try{regeneratorRuntime=t}catch(e){Function("r","regeneratorRuntime = r")(t)}},6377:(e,t,n)=>{var r=n(4832),i=n(8652),a=n(801),o=n(2030),s=n(3618),u=n(9049),l=n(1971);l.alea=r,l.xor128=i,l.xorwow=a,l.xorshift7=o,l.xor4096=s,l.tychei=u,e.exports=l},4832:function(e,t,n){var r;!function(e,i,a){function o(e){var t,n=this,r=(t=4022871197,function(e){e=String(e);for(var n=0;n<e.length;n++){var r=.02519603282416938*(t+=e.charCodeAt(n));r-=t=r>>>0,t=(r*=t)>>>0,t+=4294967296*(r-=t)}return 2.3283064365386963e-10*(t>>>0)});n.next=function(){var e=2091639*n.s0+2.3283064365386963e-10*n.c;return n.s0=n.s1,n.s1=n.s2,n.s2=e-(n.c=0|e)},n.c=1,n.s0=r(" "),n.s1=r(" "),n.s2=r(" "),n.s0-=r(e),n.s0<0&&(n.s0+=1),n.s1-=r(e),n.s1<0&&(n.s1+=1),n.s2-=r(e),n.s2<0&&(n.s2+=1),r=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 n=new o(e),r=t&&t.state,i=n.next;return i.int32=function(){return 4294967296*n.next()|0},i.double=function(){return i()+11102230246251565e-32*(2097152*i()|0)},i.quick=i,r&&("object"==typeof r&&s(r,n),i.state=function(){return s(n,{})}),i}i&&i.exports?i.exports=u:n.amdD&&n.amdO?void 0===(r=function(){return u}.call(t,n,t,i))||(i.exports=r):this.alea=u}(0,e=n.nmd(e),n.amdD)},9049:function(e,t,n){var r;!function(e,i,a){function o(e){var t=this,n="";t.next=function(){var e=t.b,n=t.c,r=t.d,i=t.a;return e=e<<25^e>>>7^n,n=n-r|0,r=r<<24^r>>>8^i,i=i-e|0,t.b=e=e<<20^e>>>12^n,t.c=n=n-r|0,t.d=r<<16^n>>>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):n+=e;for(var r=0;r<n.length+20;r++)t.b^=0|n.charCodeAt(r),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 n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&("object"==typeof r&&s(r,n),i.state=function(){return s(n,{})}),i}i&&i.exports?i.exports=u:n.amdD&&n.amdO?void 0===(r=function(){return u}.call(t,n,t,i))||(i.exports=r):this.tychei=u}(0,e=n.nmd(e),n.amdD)},8652:function(e,t,n){var r;!function(e,i,a){function o(e){var t=this,n="";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:n+=e;for(var r=0;r<n.length+64;r++)t.x^=0|n.charCodeAt(r),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 n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&("object"==typeof r&&s(r,n),i.state=function(){return s(n,{})}),i}i&&i.exports?i.exports=u:n.amdD&&n.amdO?void 0===(r=function(){return u}.call(t,n,t,i))||(i.exports=r):this.xor128=u}(0,e=n.nmd(e),n.amdD)},3618:function(e,t,n){var r;!function(e,i,a){function o(e){var t=this;t.next=function(){var e,n,r=t.w,i=t.X,a=t.i;return t.w=r=r+1640531527|0,n=i[a+34&127],e=i[a=a+1&127],n^=n<<13,e^=e<<17,n^=n>>>15,e^=e>>>12,n=i[a]=n^e,t.i=a,n+(r^r>>>16)|0},function(e,t){var n,r,i,a,o,s=[],u=128;for(t===(0|t)?(r=t,t=null):(t+="\0",r=0,u=Math.max(u,t.length)),i=0,a=-32;a<u;++a)t&&(r^=t.charCodeAt((a+32)%t.length)),0===a&&(o=r),r^=r<<10,r^=r>>>15,r^=r<<4,r^=r>>>13,a>=0&&(o=o+1640531527|0,i=0==(n=s[127&a]^=r+o)?i+1:0);for(i>=128&&(s[127&(t&&t.length||0)]=-1),i=127,a=512;a>0;--a)r=s[i+34&127],n=s[i=i+1&127],r^=r<<13,n^=n<<17,r^=r>>>15,n^=n>>>12,s[i]=r^n;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 n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&(r.X&&s(r,n),i.state=function(){return s(n,{})}),i}i&&i.exports?i.exports=u:n.amdD&&n.amdO?void 0===(r=function(){return u}.call(t,n,t,i))||(i.exports=r):this.xor4096=u}(0,e=n.nmd(e),n.amdD)},2030:function(e,t,n){var r;!function(e,i,a){function o(e){var t=this;t.next=function(){var e,n,r=t.x,i=t.i;return e=r[i],n=(e^=e>>>7)^e<<24,n^=(e=r[i+1&7])^e>>>10,n^=(e=r[i+3&7])^e>>>3,n^=(e=r[i+4&7])^e<<7,e=r[i+7&7],n^=(e^=e<<13)^e<<9,r[i]=n,t.i=i+1&7,n},function(e,t){var n,r=[];if(t===(0|t))r[0]=t;else for(t=""+t,n=0;n<t.length;++n)r[7&n]=r[7&n]<<15^t.charCodeAt(n)+r[n+1&7]<<13;for(;r.length<8;)r.push(0);for(n=0;n<8&&0===r[n];++n);for(8==n?r[7]=-1:r[n],e.x=r,e.i=0,n=256;n>0;--n)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 n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&(r.x&&s(r,n),i.state=function(){return s(n,{})}),i}i&&i.exports?i.exports=u:n.amdD&&n.amdO?void 0===(r=function(){return u}.call(t,n,t,i))||(i.exports=r):this.xorshift7=u}(0,e=n.nmd(e),n.amdD)},801:function(e,t,n){var r;!function(e,i,a){function o(e){var t=this,n="";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:n+=e;for(var r=0;r<n.length+64;r++)t.x^=0|n.charCodeAt(r),r==n.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 n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&("object"==typeof r&&s(r,n),i.state=function(){return s(n,{})}),i}i&&i.exports?i.exports=u:n.amdD&&n.amdO?void 0===(r=function(){return u}.call(t,n,t,i))||(i.exports=r):this.xorwow=u}(0,e=n.nmd(e),n.amdD)},1971:function(e,t,n){var r;!function(i,a,o){var s,u=256,l=o.pow(u,6),c=o.pow(2,52),f=2*c,d=255;function p(e,t,n){var r=[],d=y(v((t=1==t?{entropy:!0}:t||{}).entropy?[e,g(a)]:null==e?function(){try{var e;return s&&(e=s.randomBytes)?e=e(u):(e=new Uint8Array(u),(i.crypto||i.msCrypto).getRandomValues(e)),g(e)}catch(e){var t=i.navigator,n=t&&t.plugins;return[+new Date,i,n,i.screen,g(a)]}}():e,3),r),p=new h(r),_=function(){for(var e=p.g(6),t=l,n=0;e<c;)e=(e+n)*u,t*=u,n=p.g(1);for(;e>=f;)e/=2,t/=2,n>>>=1;return(e+n)/t};return _.int32=function(){return 0|p.g(4)},_.quick=function(){return p.g(4)/4294967296},_.double=_,y(g(p.S),a),(t.pass||n||function(e,t,n,r){return r&&(r.S&&m(r,p),e.state=function(){return m(p,{})}),n?(o.random=e,t):e})(_,d,"global"in t?t.global:this==o,t.state)}function h(e){var t,n=e.length,r=this,i=0,a=r.i=r.j=0,o=r.S=[];for(n||(e=[n++]);i<u;)o[i]=i++;for(i=0;i<u;i++)o[i]=o[a=d&a+e[i%n]+(t=o[i])],o[a]=t;(r.g=function(e){for(var t,n=0,i=r.i,a=r.j,o=r.S;e--;)t=o[i=d&i+1],n=n*u+o[d&(o[i]=o[a=d&a+t])+(o[a]=t)];return r.i=i,r.j=a,n})(u)}function m(e,t){return t.i=e.i,t.j=e.j,t.S=e.S.slice(),t}function v(e,t){var n,r=[],i=typeof e;if(t&&"object"==i)for(n in e)try{r.push(v(e[n],t-1))}catch(e){}return r.length?r:"string"==i?e:e+"\0"}function y(e,t){for(var n,r=e+"",i=0;i<r.length;)t[d&i]=d&(n^=19*t[d&i])+r.charCodeAt(i++);return g(t)}function g(e){return String.fromCharCode.apply(0,e)}if(y(o.random(),a),e.exports){e.exports=p;try{s=n(5042)}catch(e){}}else void 0===(r=function(){return p}.call(t,n,t,e))||(e.exports=r)}("undefined"!=typeof self?self:this,[],Math)},2287:function(e,t){"use strict";var n,r;void 0===(r="function"==typeof(n=function(){function e(){return!0}function t(){return!1}function n(){}return function r(){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 l(e){var t=U(u.types,(function(t){return t.name===e}));if(t)return t;if("any"===e)return a;var n=U(u.types,(function(t){return t.name.toLowerCase()===e.toLowerCase()}));throw new TypeError('Unknown type "'+e+'"'+(n?'. Did you mean "'+n.name+'"?':""))}function c(e){return e===a?999:u.types.indexOf(e)}function f(e){var t=U(u.types,(function(t){return t.test(e)}));if(t)return t.name;throw new TypeError("Value has unknown type. Value: "+e)}function d(e){return e.map((function(e){var t=e.types.map(b);return(e.restParam?"...":"")+t.join("|")})).join(",")}function p(e,t){var n=0===e.indexOf("..."),r=(n?e.length>3?e.slice(3):"any":e).split("|").map(I).filter(D).filter(T),i=function(e,t){var n={};return e.forEach((function(e){-1!==t.indexOf(e.from)||-1===t.indexOf(e.to)||n[e.from]||(n[e.from]=e)})),Object.keys(n).map((function(e){return n[e]}))}(t,r),a=r.map((function(e){var t=l(e);return{name:e,typeIndex:c(t),test:t.test,conversion:null,conversionIndex:-1}})),o=i.map((function(e){var n=l(e.from);return{name:e.from,typeIndex:c(n),test:n.test,conversion:e,conversionIndex:t.indexOf(e)}}));return{types:a.concat(o),restParam:n}}function h(e){var t=R(e);return!!t&&t.restParam}function m(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 l(t.types[0].name).test;if(2===t.types.length){var n=l(t.types[0].name).test,r=l(t.types[1].name).test;return function(e){return n(e)||r(e)}}var i=t.types.map((function(e){return l(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,n,r,i;if(h(e)){var a=(t=(i=e,i.slice(0,i.length-1)).map(v)).length,o=v(R(e));return function(e){for(var n=0;n<t.length;n++)if(!t[n](e[n]))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?(n=v(e[0]),function(e){return n(e[0])&&1===e.length}):2===e.length?(n=v(e[0]),r=v(e[1]),function(e){return n(e[0])&&r(e[1])&&2===e.length}):(t=e.map(v),function(e){for(var n=0;n<t.length;n++)if(!t[n](e[n]))return!1;return e.length===t.length})}function g(e,t){return t<e.params.length?e.params[t]:h(e.params)?R(e.params):null}function _(e,t,n){var r=g(e,t);return(r?n?r.types.filter(x):r.types:[]).map(b)}function b(e){return e.name}function x(e){return null===e.conversion||void 0===e.conversion}function w(e,t){var n=function(e){for(var t={},n=0;n<e.length;n++)t[e[n]]=!0;return Object.keys(t)}(q(e,(function(e){return _(e,t,!1)})));return-1!==n.indexOf("any")?["any"]:n}function E(e,t,n){var r,i,a,o=e||"unnamed",s=n;for(a=0;a<t.length;a++){var u=s.filter((function(e){var n=v(g(e,a));return(a<e.params.length||h(e.params))&&n(t[a])}));if(0===u.length){if((i=w(s,a)).length>0){var l=f(t[a]);return(r=new TypeError("Unexpected type of argument in function "+o+" (expected: "+i.join(" or ")+", actual: "+l+", index: "+a+")")).data={category:"wrongType",fn:o,index:a,actual:l,expected:i},r}}else s=u}var c=s.map((function(e){return h(e.params)?1/0:e.params.length}));if(t.length<Math.min.apply(null,c))return i=w(s,a),(r=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},r;var d=Math.max.apply(null,c);return t.length>d?((r=new TypeError("Too many arguments in function "+o+" (expected: "+d+", actual: "+t.length+")")).data={category:"tooManyArgs",fn:o,index:t.length,expectedLength:d},r):((r=new TypeError('Arguments of type "'+t.join(", ")+'" do not match any of the defined signatures of function '+o+".")).data={category:"mismatch",actual:t.map(f)},r)}function N(e){for(var t=999,n=0;n<e.types.length;n++)x(e.types[n])&&(t=Math.min(t,e.types[n].typeIndex));return t}function S(e){for(var t=999,n=0;n<e.types.length;n++)x(e.types[n])||(t=Math.min(t,e.types[n].conversionIndex));return t}function M(e,t){var n;return 0!=(n=e.restParam-t.restParam)||0!=(n=m(e)-m(t))||0!=(n=N(e)-N(t))?n:S(e)-S(t)}function k(e,t){var n,r,i=Math.min(e.params.length,t.params.length);if(0!=(r=e.params.some(m)-t.params.some(m)))return r;for(n=0;n<i;n++)if(0!=(r=m(e.params[n])-m(t.params[n])))return r;for(n=0;n<i;n++)if(0!==(r=M(e.params[n],t.params[n])))return r;return e.params.length-t.params.length}function O(e){var t,n,r,i,a=[],o=[];switch(e.types.forEach((function(e){e.conversion&&(a.push(l(e.conversion.from).test),o.push(e.conversion.convert))})),o.length){case 0:return function(e){return e};case 1:return t=a[0],r=o[0],function(e){return t(e)?r(e):e};case 2:return t=a[0],n=a[1],r=o[0],i=o[1],function(e){return t(e)?r(e):n(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 C(e,t){return function e(n,r,i){if(r<n.length){var a,o=n[r],s=t?o.types.filter(x):o.types;if(o.restParam){var u=s.filter(x);a=u.length<s.length?[u,s]:[s]}else a=s.map((function(e){return[e]}));return q(a,(function(t){return e(n,r+1,i.concat([t]))}))}return[i.map((function(e,t){return{types:e,restParam:t===n.length-1&&h(n)}}))]}(e,0,[])}function A(e,r){if(0===Object.keys(r).length)throw new SyntaxError("No signatures provided");var i=[];Object.keys(r).map((function(e){return function(e,t,n){var r=[];return""!==e.trim()&&(r=e.split(",").map(I).map((function(e,t,r){var i=p(e,n);if(i.restParam&&t!==r.length-1)throw new SyntaxError('Unexpected rest parameter "'+e+'": only allowed for the last parameter');return i}))),r.some(j)?null:{params:r,fn:t}}(e,r[e],u.conversions)})).filter(P).forEach((function(e){var t=U(i,(function(t){return function(e,t){for(var n=Math.max(e.params.length,t.params.length),r=0;r<n;r++)if(!B(_(e,r,!0),_(t,r,!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 "'+d(t.params)+'" and "'+d(e.params)+'".');i.push(e)}));var a=q(i,(function(e){return(e?C(e.params,!1):[]).map((function(t){return{params:t,fn:e.fn}}))})).filter(P);a.sort(k);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),l=a[2]&&a[2].params.length<=2&&!h(a[2].params),c=a[3]&&a[3].params.length<=2&&!h(a[3].params),f=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&&l&&c&&f&&g,x=a.map((function(e){return y(e.params)})),w=o?v(a[0].params[0]):t,N=s?v(a[1].params[0]):t,S=l?v(a[2].params[0]):t,M=c?v(a[3].params[0]):t,A=f?v(a[4].params[0]):t,T=g?v(a[5].params[0]):t,D=o?v(a[0].params[1]):t,R=s?v(a[1].params[1]):t,z=l?v(a[2].params[1]):t,F=c?v(a[3].params[1]):t,H=f?v(a[4].params[1]):t,Z=g?v(a[5].params[1]):t,W=a.map((function(e){return function(e,t){var n=t;if(e.some(m)){var r=h(e),i=e.map(O);n=function(){for(var e=[],n=r?arguments.length-1:arguments.length,a=0;a<n;a++)e[a]=i[a](arguments[a]);return r&&(e[n]=arguments[n].map(i[n])),t.apply(this,e)}}var a=n;if(h(e)){var o=e.length-1;a=function(){return n.apply(this,L(arguments,0,o).concat([L(arguments,o)]))}}return a}(e.params,e.fn)})),G=o?W[0]:n,J=s?W[1]:n,$=l?W[2]:n,V=c?W[3]:n,K=f?W[4]:n,Y=g?W[5]:n,X=o?a[0].params.length:-1,Q=s?a[1].params.length:-1,ee=l?a[2].params.length:-1,te=c?a[3].params.length:-1,ne=f?a[4].params.length:-1,re=g?a[5].params.length:-1,ie=b?6:0,ae=a.length,oe=function(){for(var t=ie;t<ae;t++)if(x[t](arguments))return W[t].apply(this,arguments);throw E(e,arguments,a)},se=function e(t,n){return arguments.length===X&&w(t)&&D(n)?G.apply(e,arguments):arguments.length===Q&&N(t)&&R(n)?J.apply(e,arguments):arguments.length===ee&&S(t)&&z(n)?$.apply(e,arguments):arguments.length===te&&M(t)&&F(n)?V.apply(e,arguments):arguments.length===ne&&A(t)&&H(n)?K.apply(e,arguments):arguments.length===re&&T(t)&&Z(n)?Y.apply(e,arguments):oe.apply(e,arguments)};try{Object.defineProperty(se,"name",{value:e})}catch(e){}return se.signatures=function(e){var t={};return e.forEach((function(e){e.params.some(m)||C(e.params,!0).forEach((function(n){t[d(n)]=e.fn}))})),t}(a),se}function T(e){return-1===u.ignore.indexOf(e)}function I(e){return e.trim()}function D(e){return!!e}function P(e){return null!==e}function j(e){return 0===e.types.length}function R(e){return e[e.length-1]}function L(e,t,n){return Array.prototype.slice.call(e,t,n)}function B(e,t){for(var n=0;n<e.length;n++)if(r=t,i=e[n],-1!==r.indexOf(i))return!0;var r,i;return!1}function U(e,t){for(var n=0;n<e.length;n++)if(t(e[n]))return e[n]}function q(e,t){return Array.prototype.concat.apply([],e.map(t))}function z(e){for(var t="",n=0;n<e.length;n++){var r=e[n];if(("object"==typeof r.signatures||"string"==typeof r.signature)&&""!==r.name)if(""===t)t=r.name;else if(t!==r.name){var i=new Error("Function names do not match (expected: "+t+", actual: "+r.name+")");throw i.data={actual:r.name,expected:t},i}}return t}function F(e){var t,n={};function r(e,r){if(n.hasOwnProperty(e)&&r!==n[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)&&(r(o,a.signatures[o]),n[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;r(a.signature,a),n[a.signature]=a}}return n}return(u=A("typed",{"string, Object":A,Object:function(e){var t=[];for(var n in e)e.hasOwnProperty(n)&&t.push(e[n]);return A(z(t),e)},"...Function":function(e){return A(z(e),F(e))},"string, ...Function":function(e,t){return A(e,F(t))}})).create=r,u.types=i,u.conversions=s,u.ignore=o,u.convert=function(e,t){var n=f(e);if(t===n)return e;for(var r=0;r<u.conversions.length;r++){var i=u.conversions[r];if(i.from===n&&i.to===t)return i.convert(e)}throw new Error("Cannot convert from "+n+" to "+t)},u.find=function(e,t){if(!e.signatures)throw new TypeError("Function is no typed-function");var n;if("string"==typeof t){n=t.split(",");for(var r=0;r<n.length;r++)n[r]=n[r].trim()}else{if(!Array.isArray(t))throw new TypeError("String array or a comma separated string expected");n=t}var i=n.join(","),a=e.signatures[i];if(a)return a;throw new TypeError("Signature not found (signature: "+(e.name||"unnamed")+"("+n.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 n=0;n<u.types.length;n++)if("Object"===u.types[n].name)return void u.types.splice(n,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,[]):n)||(e.exports=r)},5042:()=>{}},__webpack_module_cache__={},inProgress,dataWebpackPrefix;function __webpack_require__(e){var t=__webpack_module_cache__[e];if(void 0!==t)return t.exports;var n=__webpack_module_cache__[e]={id:e,loaded:!1,exports:{}};return __webpack_modules__[e].call(n.exports,n,n.exports,__webpack_require__),n.loaded=!0,n.exports}__webpack_require__.m=__webpack_modules__,__webpack_require__.amdD=function(){throw new Error("define cannot be used indirect")},__webpack_require__.amdO={},__webpack_require__.n=e=>{var t=e&&e.__esModule?()=>e.default:()=>e;return __webpack_require__.d(t,{a:t}),t},__webpack_require__.d=(e,t)=>{for(var n in t)__webpack_require__.o(t,n)&&!__webpack_require__.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:t[n]})},__webpack_require__.f={},__webpack_require__.e=e=>Promise.all(Object.keys(__webpack_require__.f).reduce(((t,n)=>(__webpack_require__.f[n](e,t),t)),[])),__webpack_require__.u=e=>e+".js",__webpack_require__.g=function(){if("object"==typeof globalThis)return globalThis;try{return this||new Function("return this")()}catch(e){if("object"==typeof window)return window}}(),__webpack_require__.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),inProgress={},dataWebpackPrefix="@spcl/sdfv:",__webpack_require__.l=(e,t,n,r)=>{if(inProgress[e])inProgress[e].push(t);else{var i,a;if(void 0!==n)for(var o=document.getElementsByTagName("script"),s=0;s<o.length;s++){var u=o[s];if(u.getAttribute("src")==e||u.getAttribute("data-webpack")==dataWebpackPrefix+n){i=u;break}}i||(a=!0,(i=document.createElement("script")).charset="utf-8",i.timeout=120,__webpack_require__.nc&&i.setAttribute("nonce",__webpack_require__.nc),i.setAttribute("data-webpack",dataWebpackPrefix+n),i.src=e),inProgress[e]=[t];var l=(t,n)=>{i.onerror=i.onload=null,clearTimeout(c);var r=inProgress[e];if(delete inProgress[e],i.parentNode&&i.parentNode.removeChild(i),r&&r.forEach((e=>e(n))),t)return t(n)},c=setTimeout(l.bind(null,void 0,{type:"timeout",target:i}),12e4);i.onerror=l.bind(null,i.onerror),i.onload=l.bind(null,i.onload),a&&document.head.appendChild(i)}},__webpack_require__.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},__webpack_require__.nmd=e=>(e.paths=[],e.children||(e.children=[]),e),(()=>{var e;__webpack_require__.g.importScripts&&(e=__webpack_require__.g.location+"");var t=__webpack_require__.g.document;if(!e&&t&&(t.currentScript&&(e=t.currentScript.src),!e)){var n=t.getElementsByTagName("script");n.length&&(e=n[n.length-1].src)}if(!e)throw new Error("Automatic publicPath is not supported in this browser");e=e.replace(/#.*$/,"").replace(/\?.*$/,"").replace(/\/[^\/]+$/,"/"),__webpack_require__.p=e})(),(()=>{var e={179:0,529:0};__webpack_require__.f.j=(t,n)=>{var r=__webpack_require__.o(e,t)?e[t]:void 0;if(0!==r)if(r)n.push(r[2]);else{var i=new Promise(((n,i)=>r=e[t]=[n,i]));n.push(r[2]=i);var a=__webpack_require__.p+__webpack_require__.u(t),o=new Error;__webpack_require__.l(a,(n=>{if(__webpack_require__.o(e,t)&&(0!==(r=e[t])&&(e[t]=void 0),r)){var i=n&&("load"===n.type?"missing":n.type),a=n&&n.target&&n.target.src;o.message="Loading chunk "+t+" failed.\n("+i+": "+a+")",o.name="ChunkLoadError",o.type=i,o.request=a,r[1](o)}}),"chunk-"+t,t)}};var t=(t,n)=>{var r,i,[a,o,s]=n,u=0;for(r in o)__webpack_require__.o(o,r)&&(__webpack_require__.m[r]=o[r]);for(s&&s(__webpack_require__),t&&t(n);u<a.length;u++)i=a[u],__webpack_require__.o(e,i)&&e[i]&&e[i][0](),e[a[u]]=0},n=self.webpackChunk_spcl_sdfv=self.webpackChunk_spcl_sdfv||[];n.forEach(t.bind(null,0)),n.push=t.bind(null,n.push.bind(n))})();var __webpack_exports__=__webpack_require__(4316)})();
-//# sourceMappingURL=main.js.map
\ No newline at end of file
diff --git a/dist/main.js.LICENSE.txt b/dist/main.js.LICENSE.txt
deleted file mode 100755
index 82c1b784..00000000
--- a/dist/main.js.LICENSE.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-/**
- * @license Complex.js v2.0.12 11/02/2016
- *
- * Copyright (c) 2016, Robert Eisele (robert@xarg.org)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- **/
-
-/**
- * @license Fraction.js v4.0.12 09/09/2015
- * http://www.xarg.org/2014/03/rational-numbers-in-javascript/
- *
- * Copyright (c) 2015, Robert Eisele (robert@xarg.org)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- **/
diff --git a/dist/main.js.map b/dist/main.js.map
deleted file mode 100755
index c36e5058..00000000
--- a/dist/main.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/classCallCheck.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/isNativeReflectConstruct.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/construct.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/createClass.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/defineProperty.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/get.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/superPropBase.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/inherits.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/slicedToArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/nonIterableRest.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/iterableToArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/typeof.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/regenerator/index.js","webpack://@spcl/sdfv/./renderer_dir/datahelper.js","webpack://@spcl/sdfv/./renderer_dir/renderer_util.js","webpack://@spcl/sdfv/./renderer_dir/windowing.js","webpack://@spcl/sdfv/./src/diode-ui/diode.js","webpack://@spcl/sdfv/./src/diode-ui/diode_appearance.js","webpack://@spcl/sdfv/./src/diode-ui/diode_project.js","webpack://@spcl/sdfv/./src/diode-ui/diode_settings.js","webpack://@spcl/sdfv/./src/diode-ui/table.js","webpack://@spcl/sdfv/./src/diode-ui/treeview.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/context.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/settings.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/diode_settings.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/code_in.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/terminal.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/code_out.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/sdfg.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/prop_window.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/runqueue.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/start_page.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/transformation_history.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/available_transformations.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/error.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/run_config.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/perf_times.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/instrumentation_control.js","webpack://@spcl/sdfv/./renderer_dir/Roofline/main.js","webpack://@spcl/sdfv/./src/diode-ui/contexts/roofline.js","webpack://@spcl/sdfv/./src/main.js","webpack://@spcl/sdfv/./src/overlays/generic_sdfg_overlay.js","webpack://@spcl/sdfv/./src/overlays/memory_volume_overlay.js","webpack://@spcl/sdfv/./src/overlays/runtime_micro_seconds_overlay.js","webpack://@spcl/sdfv/./src/overlays/static_flops_overlay.js","webpack://@spcl/sdfv/./src/utils/bounding_box.js","webpack://@spcl/sdfv/./src/renderer/canvas_manager.js","webpack://@spcl/sdfv/./src/utils/lerp_matrix.js","webpack://@spcl/sdfv/./src/overlay_manager.js","webpack://@spcl/sdfv/./src/renderer/renderer.js","webpack://@spcl/sdfv/./src/renderer/renderer_elements.js","webpack://@spcl/sdfv/./src/sdfv_ui_handlers.js","webpack://@spcl/sdfv/./src/sdfv.js","webpack://@spcl/sdfv/./src/utils/context_menu.js","webpack://@spcl/sdfv/./src/utils/sanitization.ts","webpack://@spcl/sdfv/./src/utils/sdfg/display.js","webpack://@spcl/sdfv/./src/utils/sdfg/json_serializer.ts","webpack://@spcl/sdfv/./src/utils/sdfg/sdfg_parser.js","webpack://@spcl/sdfv/./src/utils/sdfg/sdfg_utils.js","webpack://@spcl/sdfv/./src/utils/sdfg/traversal.js","webpack://@spcl/sdfv/./src/utils/utils.ts","webpack://@spcl/sdfv/./node_modules/complex.js/complex.js","webpack://@spcl/sdfv/./node_modules/dagre/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/acyclic.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/add-border-segments.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/coordinate-system.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/data/list.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/debug.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/graphlib.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/greedy-fas.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/layout.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/lodash.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/nesting-graph.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/normalize.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/add-subgraph-constraints.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/barycenter.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/build-layer-graph.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/cross-count.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/init-order.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/resolve-conflicts.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/sort-subgraph.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/sort.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/parent-dummy-chains.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/position/bk.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/position/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/feasible-tree.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/network-simplex.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/util.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/util.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/version.js","webpack://@spcl/sdfv/./node_modules/decimal.js/decimal.js","webpack://@spcl/sdfv/./node_modules/escape-latex/dist/index.js","webpack://@spcl/sdfv/./node_modules/fraction.js/fraction.js","webpack://@spcl/sdfv/./node_modules/graphlib/index.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/components.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/dfs.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/dijkstra-all.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/dijkstra.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/find-cycles.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/floyd-warshall.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/index.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/is-acyclic.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/postorder.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/preorder.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/prim.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/tarjan.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/topsort.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/data/priority-queue.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/graph.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/index.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/json.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/lodash.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/version.js","webpack://@spcl/sdfv/./node_modules/javascript-natural-sort/naturalSort.js","webpack://@spcl/sdfv/./node_modules/lodash/_DataView.js","webpack://@spcl/sdfv/./node_modules/lodash/_Hash.js","webpack://@spcl/sdfv/./node_modules/lodash/_ListCache.js","webpack://@spcl/sdfv/./node_modules/lodash/_Map.js","webpack://@spcl/sdfv/./node_modules/lodash/_MapCache.js","webpack://@spcl/sdfv/./node_modules/lodash/_Promise.js","webpack://@spcl/sdfv/./node_modules/lodash/_Set.js","webpack://@spcl/sdfv/./node_modules/lodash/_SetCache.js","webpack://@spcl/sdfv/./node_modules/lodash/_Stack.js","webpack://@spcl/sdfv/./node_modules/lodash/_Symbol.js","webpack://@spcl/sdfv/./node_modules/lodash/_Uint8Array.js","webpack://@spcl/sdfv/./node_modules/lodash/_WeakMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_apply.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayEach.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayFilter.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayIncludes.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayIncludesWith.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayLikeKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayPush.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayReduce.js","webpack://@spcl/sdfv/./node_modules/lodash/_arraySome.js","webpack://@spcl/sdfv/./node_modules/lodash/_asciiSize.js","webpack://@spcl/sdfv/./node_modules/lodash/_assignMergeValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_assignValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_assocIndexOf.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseAssign.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseAssignIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseAssignValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseClone.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseCreate.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseEach.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseExtremum.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFilter.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFindIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFlatten.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFor.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseForOwn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGetAllKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGetTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGt.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseHasIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIndexOf.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsArguments.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsEqual.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsEqualDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsMatch.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsNaN.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsNative.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsTypedArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIteratee.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseKeysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseLt.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMatches.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMatchesProperty.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMerge.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMergeDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseOrderBy.js","webpack://@spcl/sdfv/./node_modules/lodash/_basePick.js","webpack://@spcl/sdfv/./node_modules/lodash/_basePickBy.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseProperty.js","webpack://@spcl/sdfv/./node_modules/lodash/_basePropertyDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseRange.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseReduce.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseRest.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseSetToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseSortBy.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseTimes.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseTrim.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseUnary.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseUniq.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseValues.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseZipObject.js","webpack://@spcl/sdfv/./node_modules/lodash/_cacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_castFunction.js","webpack://@spcl/sdfv/./node_modules/lodash/_castPath.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneArrayBuffer.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneBuffer.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneDataView.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneRegExp.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneSymbol.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneTypedArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_compareAscending.js","webpack://@spcl/sdfv/./node_modules/lodash/_compareMultiple.js","webpack://@spcl/sdfv/./node_modules/lodash/_copyArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_copyObject.js","webpack://@spcl/sdfv/./node_modules/lodash/_copySymbols.js","webpack://@spcl/sdfv/./node_modules/lodash/_copySymbolsIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_coreJsData.js","webpack://@spcl/sdfv/./node_modules/lodash/_createAssigner.js","webpack://@spcl/sdfv/./node_modules/lodash/_createBaseEach.js","webpack://@spcl/sdfv/./node_modules/lodash/_createBaseFor.js","webpack://@spcl/sdfv/./node_modules/lodash/_createFind.js","webpack://@spcl/sdfv/./node_modules/lodash/_createRange.js","webpack://@spcl/sdfv/./node_modules/lodash/_createSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_defineProperty.js","webpack://@spcl/sdfv/./node_modules/lodash/_equalArrays.js","webpack://@spcl/sdfv/./node_modules/lodash/_equalByTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_equalObjects.js","webpack://@spcl/sdfv/./node_modules/lodash/_flatRest.js","webpack://@spcl/sdfv/./node_modules/lodash/_freeGlobal.js","webpack://@spcl/sdfv/./node_modules/lodash/_getAllKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_getAllKeysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_getMapData.js","webpack://@spcl/sdfv/./node_modules/lodash/_getMatchData.js","webpack://@spcl/sdfv/./node_modules/lodash/_getNative.js","webpack://@spcl/sdfv/./node_modules/lodash/_getPrototype.js","webpack://@spcl/sdfv/./node_modules/lodash/_getRawTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_getSymbols.js","webpack://@spcl/sdfv/./node_modules/lodash/_getSymbolsIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_getTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_getValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_hasPath.js","webpack://@spcl/sdfv/./node_modules/lodash/_hasUnicode.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_initCloneArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_initCloneByTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_initCloneObject.js","webpack://@spcl/sdfv/./node_modules/lodash/_isFlattenable.js","webpack://@spcl/sdfv/./node_modules/lodash/_isIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/_isIterateeCall.js","webpack://@spcl/sdfv/./node_modules/lodash/_isKey.js","webpack://@spcl/sdfv/./node_modules/lodash/_isKeyable.js","webpack://@spcl/sdfv/./node_modules/lodash/_isMasked.js","webpack://@spcl/sdfv/./node_modules/lodash/_isPrototype.js","webpack://@spcl/sdfv/./node_modules/lodash/_isStrictComparable.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapToArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_matchesStrictComparable.js","webpack://@spcl/sdfv/./node_modules/lodash/_memoizeCapped.js","webpack://@spcl/sdfv/./node_modules/lodash/_nativeCreate.js","webpack://@spcl/sdfv/./node_modules/lodash/_nativeKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_nativeKeysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_nodeUtil.js","webpack://@spcl/sdfv/./node_modules/lodash/_objectToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_overArg.js","webpack://@spcl/sdfv/./node_modules/lodash/_overRest.js","webpack://@spcl/sdfv/./node_modules/lodash/_root.js","webpack://@spcl/sdfv/./node_modules/lodash/_safeGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_setCacheAdd.js","webpack://@spcl/sdfv/./node_modules/lodash/_setCacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_setToArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_setToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_shortOut.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_strictIndexOf.js","webpack://@spcl/sdfv/./node_modules/lodash/_stringSize.js","webpack://@spcl/sdfv/./node_modules/lodash/_stringToPath.js","webpack://@spcl/sdfv/./node_modules/lodash/_toKey.js","webpack://@spcl/sdfv/./node_modules/lodash/_toSource.js","webpack://@spcl/sdfv/./node_modules/lodash/_trimmedEndIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/_unicodeSize.js","webpack://@spcl/sdfv/./node_modules/lodash/clone.js","webpack://@spcl/sdfv/./node_modules/lodash/cloneDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/constant.js","webpack://@spcl/sdfv/./node_modules/lodash/defaults.js","webpack://@spcl/sdfv/./node_modules/lodash/each.js","webpack://@spcl/sdfv/./node_modules/lodash/eq.js","webpack://@spcl/sdfv/./node_modules/lodash/filter.js","webpack://@spcl/sdfv/./node_modules/lodash/find.js","webpack://@spcl/sdfv/./node_modules/lodash/findIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/flatten.js","webpack://@spcl/sdfv/./node_modules/lodash/forEach.js","webpack://@spcl/sdfv/./node_modules/lodash/forIn.js","webpack://@spcl/sdfv/./node_modules/lodash/get.js","webpack://@spcl/sdfv/./node_modules/lodash/has.js","webpack://@spcl/sdfv/./node_modules/lodash/hasIn.js","webpack://@spcl/sdfv/./node_modules/lodash/identity.js","webpack://@spcl/sdfv/./node_modules/lodash/isArguments.js","webpack://@spcl/sdfv/./node_modules/lodash/isArray.js","webpack://@spcl/sdfv/./node_modules/lodash/isArrayLike.js","webpack://@spcl/sdfv/./node_modules/lodash/isArrayLikeObject.js","webpack://@spcl/sdfv/./node_modules/lodash/isBuffer.js","webpack://@spcl/sdfv/./node_modules/lodash/isEmpty.js","webpack://@spcl/sdfv/./node_modules/lodash/isFunction.js","webpack://@spcl/sdfv/./node_modules/lodash/isLength.js","webpack://@spcl/sdfv/./node_modules/lodash/isMap.js","webpack://@spcl/sdfv/./node_modules/lodash/isObject.js","webpack://@spcl/sdfv/./node_modules/lodash/isObjectLike.js","webpack://@spcl/sdfv/./node_modules/lodash/isPlainObject.js","webpack://@spcl/sdfv/./node_modules/lodash/isSet.js","webpack://@spcl/sdfv/./node_modules/lodash/isString.js","webpack://@spcl/sdfv/./node_modules/lodash/isSymbol.js","webpack://@spcl/sdfv/./node_modules/lodash/isTypedArray.js","webpack://@spcl/sdfv/./node_modules/lodash/isUndefined.js","webpack://@spcl/sdfv/./node_modules/lodash/keys.js","webpack://@spcl/sdfv/./node_modules/lodash/keysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/last.js","webpack://@spcl/sdfv/./node_modules/lodash/map.js","webpack://@spcl/sdfv/./node_modules/lodash/mapValues.js","webpack://@spcl/sdfv/./node_modules/lodash/max.js","webpack://@spcl/sdfv/./node_modules/lodash/memoize.js","webpack://@spcl/sdfv/./node_modules/lodash/merge.js","webpack://@spcl/sdfv/./node_modules/lodash/min.js","webpack://@spcl/sdfv/./node_modules/lodash/minBy.js","webpack://@spcl/sdfv/./node_modules/lodash/noop.js","webpack://@spcl/sdfv/./node_modules/lodash/now.js","webpack://@spcl/sdfv/./node_modules/lodash/pick.js","webpack://@spcl/sdfv/./node_modules/lodash/property.js","webpack://@spcl/sdfv/./node_modules/lodash/range.js","webpack://@spcl/sdfv/./node_modules/lodash/reduce.js","webpack://@spcl/sdfv/./node_modules/lodash/size.js","webpack://@spcl/sdfv/./node_modules/lodash/sortBy.js","webpack://@spcl/sdfv/./node_modules/lodash/stubArray.js","webpack://@spcl/sdfv/./node_modules/lodash/stubFalse.js","webpack://@spcl/sdfv/./node_modules/lodash/toFinite.js","webpack://@spcl/sdfv/./node_modules/lodash/toInteger.js","webpack://@spcl/sdfv/./node_modules/lodash/toNumber.js","webpack://@spcl/sdfv/./node_modules/lodash/toPlainObject.js","webpack://@spcl/sdfv/./node_modules/lodash/toString.js","webpack://@spcl/sdfv/./node_modules/lodash/transform.js","webpack://@spcl/sdfv/./node_modules/lodash/union.js","webpack://@spcl/sdfv/./node_modules/lodash/uniqueId.js","webpack://@spcl/sdfv/./node_modules/lodash/values.js","webpack://@spcl/sdfv/./node_modules/lodash/zipObject.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/core/config.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/entry/configReadonly.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/core/function/config.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/keywords.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/Node.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ArrayNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/BlockNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/latex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ConstantNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ObjectNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/operators.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/RelationalNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/chain/Chain.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/json/reviver.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/OperatorNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/RangeNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/chain/function/chain.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/utils/access.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/AccessorNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/IndexNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/utils/assign.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/SymbolNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/FunctionNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/parse.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/evaluate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/Help.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/Parser.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/help.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/compile.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/util.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/simplifyCore.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/simplifyConstant.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/resolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/rationalize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/parser.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/derivative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/apply.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/filter.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/map.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/subset.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/index.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/concat.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/max.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/min.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/sum.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/column.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/range.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/diff.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/row.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/mean.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/variance.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/std.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/resultset/ResultSet.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/complex/Complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/Range.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/constants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/constants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/constants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/version.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/Matrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/json/replacer.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/physicalConstants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/fraction/Fraction.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/core/function/typed.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isInteger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isNumeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/utils.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isPositive.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isNaN.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/equalScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/number.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/boolean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/complex/function/complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/arithmetic.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/cube.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/expm1.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/sign.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/square.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/bitwise.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitNot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/arg.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/im.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/logical.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/not.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/filter.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/forEach.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/map.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/special/erf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/format.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/oct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/print.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isPrime.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/trigonometry.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acsc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/atan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/atanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/cosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/coth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/csch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/tanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/product.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/combinations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/combinations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/pickRandom.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/randomInt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/clone.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/typeOf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/string.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/fraction/function/fraction.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/exp.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/conj.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/mode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/bin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acsch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/cos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/csc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/random.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isNegative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm01.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm04.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm13.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm14.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/gcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm02.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm03.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm05.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm11.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm12.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/mod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm06.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm07.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitXor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/or.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/diag.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/identity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/ones.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/reshape.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/size.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/zeros.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/hex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/round.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm08.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/leftShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/compare.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/compareText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/smaller.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/larger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/unequal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/function/sparse.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acoth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm09.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/atan2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/add.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/dot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/composition.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isZero.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/abs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/floor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/multiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/re.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/flatten.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/error/ArgumentsError.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/resize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/squeeze.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/unit/to.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/pow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/compareNatural.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/equalText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/largerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/tan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setIntersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setMultiplicity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setSize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/trace.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/probability.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/gamma.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/lcm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitOr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/kron.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/transpose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/numeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/and.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/smallerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/sort.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/cot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setDistinct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setPowerset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/function/index.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/factorial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/permutations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/ceil.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/subtract.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/cross.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/prod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/equal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setCartesian.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setSymDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/fix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/ctranspose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/deepEqual.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setIsSubset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/xor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/Spa.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setUnion.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/det.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/geometry/distance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/catalan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/count.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/hypot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/inv.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/expm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/divide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/kldivergence.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log1p.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/Unit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/function/createUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/eigs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/geometry/intersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/norm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/sqrtm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/multinomial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/median.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/rotate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/mad.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/function/unit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/error/DimensionError.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/error/IndexError.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/apply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/column.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/concat.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/diff.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/range.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/row.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/subset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/max.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/mean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/min.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/std.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/sum.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/variance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/array.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/collection.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/customs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/factory.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/lruQueue.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/function.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/is.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/noop.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/number.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/object.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/string.js","webpack://@spcl/sdfv/./node_modules/regenerator-runtime/runtime.js","webpack://@spcl/sdfv/./node_modules/seedrandom/index.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/alea.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/tychei.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xor128.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xor4096.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xorshift7.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xorwow.js","webpack://@spcl/sdfv/./node_modules/seedrandom/seedrandom.js","webpack://@spcl/sdfv/./node_modules/typed-function/typed-function.js","webpack://@spcl/sdfv/webpack/bootstrap","webpack://@spcl/sdfv/webpack/runtime/load script","webpack://@spcl/sdfv/webpack/runtime/amd define","webpack://@spcl/sdfv/webpack/runtime/amd options","webpack://@spcl/sdfv/webpack/runtime/compat get default export","webpack://@spcl/sdfv/webpack/runtime/define property getters","webpack://@spcl/sdfv/webpack/runtime/ensure chunk","webpack://@spcl/sdfv/webpack/runtime/get javascript chunk filename","webpack://@spcl/sdfv/webpack/runtime/global","webpack://@spcl/sdfv/webpack/runtime/hasOwnProperty shorthand","webpack://@spcl/sdfv/webpack/runtime/make namespace object","webpack://@spcl/sdfv/webpack/runtime/node module decorator","webpack://@spcl/sdfv/webpack/runtime/publicPath","webpack://@spcl/sdfv/webpack/runtime/jsonp chunk loading","webpack://@spcl/sdfv/webpack/startup"],"names":["_arrayLikeToArray","arr","len","length","i","arr2","Array","_assertThisInitialized","self","ReferenceError","asyncGeneratorStep","gen","resolve","reject","_next","_throw","key","arg","info","value","error","done","Promise","then","_asyncToGenerator","fn","this","args","arguments","apply","err","undefined","_classCallCheck","instance","Constructor","TypeError","_isNativeReflectConstruct","Reflect","construct","sham","Proxy","Boolean","prototype","valueOf","call","e","_construct","Parent","Class","a","push","Function","bind","setPrototypeOf","_defineProperties","target","props","descriptor","enumerable","configurable","writable","Object","defineProperty","_createClass","protoProps","staticProps","_defineProperty","obj","_get","property","receiver","get","base","object","hasOwnProperty","getPrototypeOf","desc","getOwnPropertyDescriptor","_getPrototypeOf","o","__proto__","_inherits","subClass","superClass","create","constructor","_possibleConstructorReturn","_setPrototypeOf","p","_slicedToArray","isArray","Symbol","iterator","_arr","_n","_d","_e","_s","_i","next","unsupportedIterableToArray","_taggedTemplateLiteral","strings","raw","slice","freeze","defineProperties","_toConsumableArray","arrayLikeToArray","iter","from","_typeof","_unsupportedIterableToArray","minLen","n","toString","name","test","module","exports","MathHelper","array","Math","sqrt","input","ObjectHelper","assert","tmp","toUpperCase","dict","x","keys","k","v","max_func_obj","X","Y","cov","stdev","xmean","mean","ymean","sum","zip","map","y","j","reduce","b","pow","sorted","Number","sort","index","ret","floor","array_of_arrays","outersize","innersize","filter","indexOf","in_array","chunksize","aggregate","isNaN","number","valarr","valstr","parseInt","toFixed","round","mode","unit","digits","exp","base1024table","0","1","2","3","4","5","toUnicodeSuperscript","thresh","numerator","denominator","abs","gcd","temp","gcd_val","super_n","sub_d","toUnicodeSubscript","func","String","modifyingMapRecursive","listKeys","valueFromPromiseFull","obj_array","valueFromPromise","arr1","onconflicts","console","log","o1","o2","specials","every","includes","o1ref","mergeRecursive","specfunc","concat","title","JSON","stringify","values","expr","trace","window","alert","Error","seen","WeakSet","has","add","render_button_to_graphic","button","c","document","createElement","ctx","getContext","width","button_subwindow","targetwidth","height","targetheight","new_obj","dataparams","button_subwindow_state","is_locked_open","setFullyOpen","Bracket","setupEventListeners","addButton","drawEx","Pos","imgdat","toDataURL","createImageDownload","brackets","prefix","colsize","rowsize","ypos","maxxpos","entries","buttons","save","fillStyle","fillRect","restore","bracket_entry","bracket","textBaseline","textAlign","font","unified_id","stateid","nodeid","fillText","xpos","src_canvas","drawImage","max","d","setAttribute","style","display","body","appendChild","click","removeChild","max_func","max_val","m","objfunc","max_obj","min_func","min_val","other","num","topleft","bottomright","Clickable","children","onEnterHover","onLeaveHover","onClick","onDoubleClick","onMouseMove","clickable_state","enable_func","clickable","unshift","mousepos","mb","is_inside","onUpdateDoubleClick","onUpdateClick","onUpdateMove","pos","SubWindow","_sizetrans","subwindow_trans_change","subwindow_popped_out","layout","background_color","state","ctx_override","beginPath","strokeStyle","lineWidth","oldfill","rect","fill","stroke","draw","offsetpos","minus","Button","update","color","addChild","size","button_image","setOnDoubleClick","newwin","DiodeWindow","setSenderData","className","dataParams","open","data_url","side_len","Image","src","onload","now","Date","cfseg","PI","mid","fac","getMilliseconds","xval","cos","yval","sin","grad","createLinearGradient","addColorStop","Layout","subwindow","parent","_layout","databinding","_this","_layout_clickable","val","realsize","realtopleft","plus","times","_tmp_hovered","_mouse_pos","setOnClick","dv","getCurrentDataView","information_button_pos","information_button_size","showOptimizationHints","left","right","top","bottom","is_multiview","multiview_selector","dataviews","setOnMouseMove","mouseInside","openSettingsWindow","dataview","addVIPChild","enter","leave","setOnEnterHover","setOnLeaveHover","rect_name","dataview_array","RU_DataViewBarGraph","dvbg_clickable","setEnableFunc","db","setRect","DataBlock","data","type","setData","datatype","RU_DataView","analyze","color_scaling_func","update_data","information_html_string","information_overlay_age","information_overlay_alpha","information_overlay_timer","optimization_hint_path","path","win","dist","clearTimeout","setTimeout","scale","alpha","subalpha","information_sign","base_fontsize","textwidth","measureText","textheight","center_x","description","setSettingsDict","eval","setDataAnalysisFunction","str","sw","setCallback","reply","source","origin","getSettingsDict","datablock","RU_DataViewText","fontsize","align","text","optstruct","typevar","xAxisVar","yAxisVar","dvbg_chart_data","xAxes","yAxes","dvbg_canvas_scaler","dvbg_canvas","dvbg_ctx","chartsettings","options","responsive","tooltips","intersect","scales","dvbg_chart","Chart","visibility","position","parent_this","getBoundingClientRect","event","MouseEvent","offsetX","offsetY","clientX","clientY","dispatchEvent","basedict","display_xAxes","some","display_yAxes","display_legend","legend","general_graph_options","dha","dva","dl","forEach","prev_scale","datacpy","parse","dvbg_cached_data","resize","RU_DataViewNumberBlock","opt","display_title","text_align","draw_bar","padding","dvnb_cached_data","stringformatter","percent2color","left_pad","moveTo","lineTo","drawOverlay","percent","padStart","RU_DataViewSuggestedActionBlock","dvsa_clickable","tl_x","tl_y","size_x","size_y","local_pos","heightpadding","eachheight","dvsa_button_hovered","getButtonIndex","buttonHovered","hints","dvsab_cached_data","cond","display_text","ellipse","RU_DataViewFormLayout","datablock_in","form_entries","rows","realfontsize","text_height","line","start","end","offset","startoffset","listeners","button_alpha","bracket_alpha","opacity","canvas_draw_mgr","mouseXtrans","canvas","mouseYtrans","get_zoom","mapPixelToCoordsX","mapPixelToCoordsY","mm_lis","c_lis","dc_lis","lis","addEventListener","removeEventListener","animate","updatefunc","max_x","max_y","inRect","is_inside_buttons","is_inside_bracket","bracket_clicked","clearRect","oldalpha","globalAlpha","drawButtons","requestAnimationFrame","startpos","yoffset","tlsel","tl_higher","_canvas_manager_counter","CanvasDrawManager","ref_global_state","anim_id","drawables","indices","request_scale","scale_factor","last_scale_factor","_destroying","scale_origin","contention","_svg","createElementNS","user_transform","createSVGMatrix","addCtxTransformTracking","pt","createSVGPoint","ut","setTransform","f","svg","_custom_transform_matrix","checker","_ctx","scale_func","sx","sy","scaleNonUniform","translate_func","translate","rotate_func","rotate","r","transform_func","transform","m2","multiply","setTransform_func","custom_inverseTransformMultiply","matrixTransform","inverse","clearDrawables","counter","drawable","destroy","diff","sv","svgPoint","noJitter","parseFloat","applyUserTransform","drawSDFG","message_userdef","_msg_func","message","url","features","replace","msg_obj","postMessage","passMessage","window_data","getSendableObject","serialize","def","serialize_dataview","serialize_array","serialize_default","serialize_function","_data","answer","close","$","globalThis","DIODE","_settings","DIODE_Settings","_debouncing","_background_projects","_current_project","_stale_data_button","_shortcut_functions","_creation_counter","_client_id","localStorage","getItem","getPseudorandom","setItem","_appearance","Appearance","setOnChange","toStorable","goldenlayout","eventHub","on","project","eventString","__impl_showStaleDataButton","__impl_removeStaleDataButton","__impl_showIndeterminateLoading","__impl_hideIndeterminateLoading","ev","hint","pubSSH","config","existing","getRunConfigs","localeCompare","sessionStorage","getCurrentRunConfigName","getCurrentRunConfig","new_settings","keyfile_string","post_params","client_id","getClientID","REST_request","xhr","readyState","status","startsWith","cached","response","t","pubkey","create_overlay","_h","elem","fulldata","w2overlay","getAttribute","stopPropagation","preventDefault","composed","composedPath","purpose","w2popup","showMax","file_handler","newFile","setup_drag_n_drop","mime","readMode","fuploader","file","files","reader","FileReader","result","readAsText","getEnum","root","getItemsByFilter","comp","clearClosedWindowsList","componentName","cw","_closed_windows","setClosedWindowsList","contentItems","content","addContentItem","isSubWindow","emit","ci","copy","remove","closeAll","createNewProject","millis","split","componentState","created","code_content","gatherProjectElementsAndCompile","sdfg_over_code","transthis","node","params","realparams","params_keys","_lst","mx","category","element","target_name","propertyChanged","request","timeout","refreshSDFG","applyTransformation","apply_params","locateTransformation","opt_name","opt_pos","affects","sdfg_name","dt","DiodeTables","cur_dt","dtc","categories","cat","debugDevMode","z","cat_name","sp","innerText","tr","addRow","childNodes","colSpan","propx","title_part","value_part","diode","getMatchingInput","cr","addContentRow","setCSSClass","classList","locate_button","createIn","_x","disabled","_y","warn","create_visual_access_representation","elems","__access_indices","__ranges","__user_input","__additional_defines","_r","prompt","__mem_dims","attributes","shape","__eval_func","__defs","join","__tbl_container","__tbl_hor","__axis_x_info","__i","__tmp","__e","__axis_y_info","__tbl_vert","__size","__fixed_rngs","depth","reverse","__var_rng","__rng_inputs","__create_func","__main","main","input_cont","__global_slider","min","step","__total_rng_count","__locked_range","__r","_lbl","_in","_click","__spos","__base","__s","__v","__e_size","__x","__ev","__subval","_ev","innerHTML","__all_fixed","assign","rname","__defstring","__ellision_thresh_y","__ellision_thresh_x","__mark_cells","feval","__it","__r_s","__r_e","__r_step","__a_i","__y","__dim_2","__row","__cell","__set_marking","__colorstr","create_visual_range_representation","__starts","__ends","__steps","__tiles","__mayfail","__data","__obj_to_arr","__symbols","__e_starts","__e_ends","__e_steps","__e_tiles","__e_sizes","__r_it","__start","__end","__step","__tile","__e_start","__e_end","__e_step","__e_tile","__failed","__symbol_setter","Min","int_ceil","ceil","__shapedims","__sym_name","__ret","create_language_input","onchange","language_types","qualified","FormBuilder","__resolve_initials","__initials","__syms","__merger","acpy","__needed_defs","__placeholder_defines","__user_input_needed","__retry","__placeholder_def_str","__test","__j","__f","var","tile","create_index_subset_input","cont","preview","resp","syms","tsyms","SDFG_Parser","state_id","node_id","initials","newelems","data_objs","_arrays","popup_div","popup_div_body","value_input","apply_but","create_range_input","data_obj","ranges","range","range_elems","r_row","input_refs","lbl","ti","textContent","visbut","sdfg_obj","sdfg_object","vis_elem","re","onclick","metatype","checked","cb","arrays","sdfg","array_names","new_elem","parentNode","replaceChild","on_timeout","getJSON","classpath","available_implementations","sdfg_list_id","parent_id","id","parse_sdfg","handleErrors","new_sdfg","item_name","label","codeelem","langelem","language","string_data","schedule_types","types","access_types","info_obj","msg","storage_types","getHostList","dobj","replaceOrCreate","recompileOnPropertyChange","stale_data_button","show","hide","generic_group","comps","names","setActiveContentItem","code_ins","filterComponentTreeByCname","opttrees","opthists","sdfg_renderers","code_outs","property_renderers","code_in_stack","createContentItem","opttree_stack","sdfg_stack","code_out_stack","property_stack","top_row","bottom_row","top_bottom","predicate","sdfg_components","new_container","contents","alt","ctrl","altKey","expect","onKeyUp","cs","ctrlKey","DIODE_Project","clearTransformationHistory","clear","_project_id","setupEvents","proj_id","getCurrentProject","gl","getTime","random","sdfgs","sdfgs_obj","compounds","SDFG_available","create_sdfg_func","new_sdfg_config","sdfg_data","create_codeout_func","new_codeout_config","code","generated_code","new_error_config","optgraph","create_optgraph_func","new_optgraph_config","for_sdfg","optgraph_data","create_history_func","OptGraph_available","calling_context","direct_passing","on_success","on_failure","sdfg_props","optpath","reqlist","on_collected","collect_cb","dry_run","cis","cval","sd","run","runopts","compile_and_run","term_id","_","OptGraphs_available","compile","optpath_cb","code_is_sdfg","sdfg_node_properties","stringify_sdfg","runnercode","version_string","peek","removeStaleDataButton","multiple_SDFGs_available","errors","traceback","Error_available","terminal_identifier","terminal_config","showIndeterminateLoading","pd","ondone","hideIndeterminateLoading","applyCurrentRunConfig","remaining_settings","not","display_current_execution_status","perf_mode","endsWith","toast","newdata","substr","seenBytes","responseText","icon","callback","VanillaToasts","from_code","code_data","sdfgprop_data","on_data_available","replace_request","window_name","replace_params","recreate_func","open_windows","tid","timeout_id","group","list","btoa","crypto","subtle","digest","Uint8Array","filterfunc","filterComponentTree","theme","editorTheme","getScript","boolean_value","_change_callback","_config","insertStylesheet","_constructor_values","vals","getCSS","stylestring","stylesheet","getElementById","head","setChanged","css_type","css_value","shortname","inner","theme_name","s","getClassProperties","bgc","bg","setValue","cssclassname","getComputedStyle","project_id","_diode","setup","_callback","_rcvbuf","_waiter","_listeners","_blob","removeItem","sdata","getTransformationSnapshots","changing_transformation","getConfigForClosedWindow","getClosedWindowsList","new_list","rets","cname","suffix","hub","unbind","blob","Blob","URL","revokeObjectURL","createObjectURL","filename","link","href","createblob","__impl_request","reqid","startListening","interval_step","setInterval","missing","clearInterval","stopListening","project_name","pdata","getProjectData","snapshots","location","reload","denormalized","settings_values","changed","setting","TableCategory","table","parent_row","_table","_title_row","_cat_rows","row","Table","init","_thead","_tbody","_is_collapsed","columns","_columns","th","td","expandVertically","collapseVertically","classname","ValueTreeNode","_label","_prev","_children","_on_activate","_representative","l","_path_label","pred","getChild","it","asPreOrderArray","pathLabel","map_func","current","new_node","LabelConflictSameLevel","LabelConflictGlobal","allLabelsInTree","handler","level","TreeView","value_tree_node","_tree","listitem","listitemspan","append","nextparent","onclickfunc","toggle","activate","ondblclickfunc","passed_click_func","passed_dblclick_func","debounce","setRepresentative","create_html_in","DIODE_Context","gl_container","container","initial_state","saveToState","_project","_event_listeners","_event_listeners_closed","_no_user_destroy","keep_alive_when_closed","eh","closed_on","addToClosedWindowsList","getState","extendState","removeClosedWindowEvents","dict_value","setState","DIODE_Context_Settings","settings","change","set_settings","toToggle","toggleclassname","hasClass","removeClass","addClass","is_topmost","dicts","meta","settings_lookup","settings_change_callback","setHandler","repr","representative","setting_path","newparent","addNode","parse_settings2","hasChanged","changed_values","changedValues","clearChanged","debounced","DIODE_Context_DIODESettings","_settings_container","_editor_themes","getThemes","createContainer","createLabel","theme_names","themeNames","createSelectInput","setFromAceEditorTheme","createToggleSwitch","setFont","DIODE_Context_CodeIn","editor","_terminal_identifer","_markers","clearSelection","highlight_error","highlight_code","clearErrors","dbg_info","s_c","start_col","e_c","end_col","markerrange","ace","Range","start_line","end_line","uc","marker","session","addMarker","scrollToLine","gotoLine","getSession","removeMarker","lineno","getLine","substring","getElement","DIODE_Context_Terminal","output","insert","getLength","column","curr_str","getValue","matchAll","perflist","median_val","time","DIODE_Context_CodeOut","extracted","setCode","codestr","cleanCode","DIODE_Context_SDFG","_message_handler","renderer_pane","_analysis_values","renamed_dict","json_list","_state","_transformed_state","create_renderer_pane","message_handler_filter","discardInvalidated","getChangedSDFGPropertiesFromState","named","symbolPropertyChanged","removeDataSymbol","addDataSymbol","forProgram","AnalysisName","forUnifiedID","forSuperSection","forSection","drawAllPerfInfo","getSDFGDataFromState","aname","found","old","resetState","typestr","dtype","nodeinfo","max_num","highlighted_elements","highlighted","draw_async","elements","sdfg_id","sid","nid","graph","sdfg_list","comp_name","has_component","force_open","sdfg_dat","render_free_variables","node_a","aprefix","node_b","bprefix","en_attrs","SDFG_PropUtil","ex_attrs","new_attrs","na","indirected","mcpy","xa","ecpy","renderPropertiesInWindow","getEdgeReference","getNodeReference","edges","dst","nodes","set_sdfg","sdfv","SDFGRenderer","et","el","sle","ed","on_renderer_mouse_event","evtype","canvas_coords","renderer","selected_elements","ends_drag","clicked_states","states","clicked_nodes","clicked_edges","clicked_interstate_edges","isedges","clicked_connectors","connectors","total_elements","foreground_elem","contextmenu","stroke_color","cmenu","ContextMenu","addOption","spos","sdfg_elem","State","SDFGNode","scope_entry","is_collapsed","relayout","submenu","id_name","Edge","render_props","element_list","properties","attr","renderProperties","exit_node","find_exit_for_entry","rnode","entry_id","entry_node","DIODE_Context_PropWindow","_html_container","setTitle","getHTMLContainer","renderDataSymbols","caller_id","symbol","reduced_node","backaction","data_name","data_type","free_symbol_table","setHeaders","all_symbols","symbols","edit_but","renderDataSymbolProperties","del_but","but_container","input_name","placeholder","add_scalar","add_array","libnode_container","expand_all","DIODE_Context_Runqueue","_autorefresher","base_element","css","header","header_row","h","tbody","optparse","current_value","perfopts","core_counts","DataTable","getCurrentQueue","refreshUI","DIODE_Context_StartPage","startpage_container","startpage_recent","file_title","createStartpageListElement","openUploader","recent_title","startpage_resources","resource_title","last_saved","dace_logo","image","diode_image","cols","img","col2","proj_name","proj_detail","fontSize","justifyContent","col3","proj_date","proj_unused","DIODE_Context_TransformationHistory","hist","getTransformationHistory","parent_element","history_base_div","history_scoll_div","_history_scroll_div","addElementToHistory","simple_node","hsd","revert","hover","tsh","discardTransformationsAfter","DIODE_Context_AvailableTransformations","_tree_view","_current_root","operation_running","sel","sname","matching_opts","getTransformations","highlightTransformation","transforms","Event","appendHistoryItem","affecting","selstring","previousElementSibling","propertyChanged2","opt_params","idstring_list","og","full","arrayed","container_node","c_title","c_title_span","_transformation_list","sendHighlightRequest","_repr","sendClearHighlightRequest","_title","cpy","saveSnapshot","parent_override","at_list","list_elem","adv_button","newstate","at_div","addNodes","DIODE_Context_Error","setError","error_string","DIODE_Context_RunConfig","runopts_container","runopts_general_container","find","remoteparams","instrumentationparams","apply_button","addToRunConfigs","DIODE_Context_PerfTimes","_chart","addTime","oldstate","runtimes","labels","datasets","backgroundColor","ticks","beginAtZero","autoSkip","runtime","DIODE_Context_InstrumentationControl","started","_update_timeout","load_perfdata","download_but","base_url","download","download_can_but","delete_but","delete_can_but","render_but","roofline_but","show_roofline","celem","roofline_socket","fillLine","margin","yoptions","gflops","setLineDash","axis_len_y","pix_step","steps","logval","inv_step_value_func","options_max_val","step_value_func","value_per_step","getYPixel","pix_step_y","getXPixel","xoptions","pix_step_x","fillBandwidthBound","bytes_per_cycle","maxyval","maxxval","logvaly_start","y_start","logvaly","logvalx","angle","atan2","dotdata","flopbounds","bandwidthbounds","draw_full","painter","drawAxes","drawComputeBounds","drawBandwidthBounds","connectDots","drawDots","drawDot","flop_per_cyc","flop_per_byte","off","setDot","floppercyc","flopperbyte","highlight","drawInfoBox","sidelen","triangle_size","boxleft","boxright","boxbottom","boxtop","closePath","RooflinePainter","xopts","yopts","cur_val","marker_height","drawMarkersX","drawMarkersY","highlights","dot_x","dot","DIODE_Context_Roofline","_proc_func","redraw_func","message_source","log2","pow2","send","data_proc","pid","flop_per_c","socksetup","WebSocket","onopen","onmessage","onclose","onerror","Roofline","proc_func","on_resize","ResizeObserver","observe","host","callbackSingle","callbackMultiple","condition","drag_enter","drag_over","drag_drop","dataTransfer","readAsArrayBuffer","command","payload","method","XMLHttpRequest","setRequestHeader","onreadystatechange","initEnums","w2toolbar","items","caption","item","selected","open_diode_settings","open_runqueue","show_inst_options","show_exec_times","groupOptGraph","groupSDFGsAndCodeOutsTogether","groupLikeDIODE1","configs","setCurrentRunConfig","show_run_options","ui_compile_and_run","refresh","reopenClosedWindow","saved_config","GoldenLayout","isInitialised","openPopouts","popout","toConfig","registerComponent","html","diode_context","load","get_settings","editorstring","new_element","editor_div","edit","setTheme","setMode","commands","addCommand","bindKey","mac","exec","readOnly","setEditorReference","setReadOnly","firstval","divstring","setContainer","createFromState","setLayout","getProject","updateSize","onKeyDown","addKeyShortcut","firstChild","start_DIODE","idstr","known_list","initial","dlist","inputelem","onfocus","oldvalue","onblur","fname","labeltext","tooltip","legacy","styled_elem","option","option_elem","oninput","GenericSdfgOverlay","overlay_manager","symbol_resolver","vscode","badness_scale_center","MemoryVolumeOverlay","for_all_elements","isected","volume","edge","symbol_map","volume_values","volume_string","parse_symbol_expression","g","that","state_graph","calculate_volume_edge","NestedSDFG","nested_symbols_map","mapping","symbol_mapping","calculate_volume_graph","symbol_value_map","badness_scale_method","median","clear_cached_volume_values","recalculate_volume_values","badness","getTempColor","shade","ppp","visible_rect","lod","STATE_LOD","w","NODE_LOD","recursively_shade_sdfg","shade_edge","canvas_manager","points_per_pixel","RuntimeMicroSecondsOverlay","criterium","runtime_map","MapExit","undefined_val","micros_values","micros","EPSILON","rt_summary","get_element_uuid","tooltip_container","pretty_print_micros","shade_node","StaticFlopsOverlay","flops_map","flops","flops_string","flops_values","calculate_flops_node","calculate_flops_graph","clear_cached_flops_values","recalculate_flops_values","calculateBoundingBox","bb","boundingBox","x1","y1","x2","y2","calculateEdgeBoundingBox","points","updateEdgeBoundingBox","CanvasManager","prev_time","animation_start","animation_end","animation_target","animation","scalef","new_transform","alreadyAnimatingTo","stopAnimation","m1","decompose","row0x","row0y","row1x","row1y","skew11","skew12","skew21","skew22","d1","d2","lerp","d1Angle","d2Angle","d1Scale","lerpDecomposed","matrix","lerpMatrix","getImageData","Uint32Array","buffer","isBlank","bgcolor","zoom_to_view","canvas_w","canvas_h","tx","ty","animateTo","old_mousepos","new_mousepos","entire_graph","state_parent_list","drag_start","update_position_info","move_entire_edge","edge_dpoints","out_edges","in_edges","parent_graph","outEdges","edge_id","inEdges","dx","dy","edge_point","ddx","cx","ddy","cy","curdist","parent_left_border","parent_right_border","parent_top_border","parent_bottom_border","el_h_margin","el_w_margin","min_x","min_y","target_x","target_y","get_positioning_info","initialize_positioning_info","move_node_and_connectors","EntryNode","scope_dx","scope_dy","point","moved","src_connector","out_connectors","intersectRect","dst_connector","dst_el","in_connectors","src_el","translate_recursive","ng","animation_step","draw_now","SymbolResolver","constants_prop","symbols_to_define","init_overlay_popup_dialogue","expression_string","prompt_completion","expression_tree","recursive_find_undefined_symbol","prompt_define_symbol","evaluated","evaluate","isInteger","exception","pop","popup_dialogue","_show","definition","dialogue_background","_hide","header_bar","close_button","htmlSanitize","content_box","set_val","_map","_symbol","_input","setCustomValidity","_content","which","footer_bar","confirm_button","OverlayManager","overlays","overlay","ol","symbol_value_changed","on_mouse_event","check_valid_add_position","lib","debug_draw","background","mode_buttons","last_visible_elements","last_hovered_elements","last_clicked_elements","last_dragged_element","menu","toolbar","panmode_btn","movemode_btn","selectmode_btn","addmode_btns","add_type","add_mode_lib","addmode_divs","mode_selected_bg_color","mouse_follow_svgs","mouse_follow_element","all_memlet_trees_sdfg","inclusive_ranges","omit_access_nodes","mouse_mode","box_select_rect","realmousepos","dragging","drag_second_start","external_mouse_handler","ctrl_key_selection","shift_key_movement","add_uuid","add_position","add_edge_start","ex","in_vscode","init_elements","memlet_tree_complete","update_fast_memlet_lookup","cursor","interaction_info_box","interaction_info_text","add_btn","dbg_info_box","dbg_mouse_coords","borderRadius","visible","save_as_png","has_pdf","save_as_pdf","addCheckableOption","overlays_menu","_cmenu_elem","overlays_cmenu","is_overlay_active","register_overlay","deregister_overlay","refresh_analysis_pane","reset_positions","collapse_all","pan","move","select","add_btns","show_select_library_node_dialog","update_toggle_buttons","daemon_connected","show_no_daemon_dialog","pan_mode_btn","move_mode_btn","box_select_btn","shift_click","ctrl_click","on_key_event","exit_preview_btn","viewing_history_state","prevent_refreshes","reset_active","onmouseover","error_popover_container","error_popover_text","error_popover_dismiss","MutationObserver","mutations","onresize","set_mouse_handlers","svgs","uuid","get_uuid_graph_element","fill_info","find_graph_element_by_uuid","br","comp_x","comp_y","offsetWidth","offsetHeight","all_memlet_trees","tree","Set","relayout_sdfg","translate_moved_elements","outline","traverse_sdfg_scopes","Node","add_scope_movement","scope_entry_node","isFinite","translate_element","e_id","final_pos_d","edge_pos","set_view","for_all_sdfg_elements","otype","odict","send_new_sdfg_to_vscode","delete_positioning_info","blobStream","canvas2pdf","PdfContext","save_all","stream","curx","cury","endx","endy","curw","curh","oldctx","pdf","toBlobURL","grid_width","lim_x_min","lim_x_max","lim_y_min","lim_y_max","arc","on_pre_draw","draw_sdfg","old_line_width","x_start","x_end","y_end","debug_draw_grid","on_post_draw","el_id","isedge_id","offending_element","find_graph_element","do_for_intersected_elements","el_type","traverse_recursive","connector","conntype","isedge","mouse_pos_x","mouse_pos_y","elements_in_rect","foreground_surface","shiftKey","remove_graph_nodes","comp_x_func","comp_y_func","dirty","element_focus_changed","multi_selection_changed","touches","elements_to_move","Connector","list_id","nested_sdfg_parent","state_parent","mouse_elements","find_elements_under_cursor","movementX","movementY","touch1","touch2","oldCenter","initialDistance","currentDistance","newCenter","deltaY","elements_under_cursor","firstElementChild","layerX","clientWidth","layerY","clientHeight","intersected","hovered","get_nested_memlet_tree","te","AccessNode","nested_graph","elements_in_selection","start_x","end_x","start_y","end_y","contained_in","add_node_to_graph","elements_to_reset","element_moved","relayout_necessary","new_points","new_x","new_y","mouse_x","mouse_y","vscode_handle_event","STATE_MARGIN","LINEHEIGHT","dagre","setGraph","setDefaultEdgeLabel","u","stateinfo","state_g","sdfg_state","multigraph","layout_options","ranksep","ranker","toplevel_nodes","scope_dict","drawn_nodes","hidden_nodes","Map","layout_node","set","dsts","nested_g","nodesize","labelsize","inconnsize","outconnsize","maxwidth","maxheight","calculateNodeSize","sdfginfo","SDFGElements","conn","setNode","hidden_src","hidden_dst","shortcut","add_edge_info_if_hidden","check_and_redirect_edge","setEdge","hidden_node","tmp_edge","shortcut_e","deepCopy","redirected_e","oe","shortcut_edge","gnode","offset_sdfg","SPACING","iconn_length","oconn_length","iconn_x","oconn_x","gedge","src_conn","dst_conn","src_node","cindex","dst_node","relayout_state","offset_state","SDFGElement","elem_id","set_layout","strokeRect","getCssProperty","box_start_x","box_end_x","box_start_y","box_end_y","el_start_x","el_end_x","el_start_y","el_end_y","propertyName","getPropertyValue","trim","SDFG","clamped","orig_fill_style","orig_alpha","fgstyle","bgstyle","textw","xm","ym","quadraticCurveTo","create_arrow_line","wcr","drawArrow","orig_stroke_style","orig_line_cap","lineCap","orig_line_width","dsettings","view_settings","subset","sdfg_property_to_string","other_subset","num_accesses","dynamic","ptLineDistance","fillColor","scope_connector","drawEllipse","nodedesc","textmetrics","ScopeNode","draw_shape","drawHexagon","drawTrapezoid","scopeend","far_label","drawAdaptiveText","close_label","SCOPE_LOD","entry","ind","attrs","ConsumeEntry","ConsumeExit","pe_index","num_pes","sdfg_range_elem_to_string","ExitNode","MapEntry","PipelineEntry","PipelineExit","Tasklet","drawOctagon","TASKLET_LOD","lines","maxline","maxline_len","oldfont","hr","wr","FONTSIZE","text_yoffset","Reduce","sdfg_dagre","EDGE_LOD","simple_draw","sdfg_graph","eid","far_text","close_text","ppp_thres","max_font_size","font_multiplier","tw","hexseg","octseg","kappa","ox","oy","xe","ye","bezierCurveTo","p1","p2","inverted","line1","line2","res","LibraryNode","_path","_path2","SDFVUIHandlers","on_init_menu","bar","drag","selection","empty","getSelection","removeAllRanges","view","innerWidth","pageX","on_sidebar_set_title","on_sidebar_show","sidebar_get_contents","on_close_menu","on_outline","sidebar","stack","node_type","nodes_to_display","subnode_id","cancelBubble","on_fill_info","sdfg_edge","globals","daceRenderer","sdfg_array","fr","instrumentation_file","assignIfNotExists","daceUIHandlers","daceInitSDFV","init_sdfv","daceParseSDFG","daceStringifySDFG","daceFindInGraph","find_in_graph","daceSDFGPropertyToString","daceSDFGRangeElemToString","daceGetUUIDGraphElement","daceFindGraphElementByUUID","daceTraverseSDFGScopes","daceSDFGTypeclassToString","sdfg_typeclass_to_string","daceStringToSDFGTypeclass","string_to_sdfg_typeclass","daceSDFGRenderer","daceSDFGElements","daceGenericSDFGOverlay","daceMemoryVolumeOverlay","daceRuntimeMicroSecondsOverlay","daceStaticFlopsOverlay","daceMouseEvent","mouse_event","currentScript","hasAttribute","results","RegExp","decodeURIComponent","getParameterByName","responseType","load_sdfg_from_url","reload_file","close_menu","load_instrumentation_report","start_find_in_graph","pan_btn","move_btn","select_btn","file_read_complete","load_instrumentation_report_callback","report","traceEvents","ph","dur","minmax","get_minmax","runtime_summary","get_overlay","instrumentation_report_read_complete","MAX_VALUE","find_recursive","query","case_sensitive","toLowerCase","edgeid","sidebar_set_title","onmouseenter","onmouseleave","sidebar_show","ready","html_content","_html_content","_click_close_handlers","_options","onselect","onhover","checkbox","cmenu_div","markelem","escapeHTML","escapeCharacters","endp1","simplify","prop","approx","first","subprop","argstring","splitidx","lastIndexOf","count","cb_argstring","cb_args_raw","ret_type","cb_args","raw_arg","returntype","typeclass","sdfg_json","reviver","replacer","orig_sdfg","_sdfg","SDFG_State_Parser","symbols_to_resolve","memlets","mdata","lookup_symbols","rngs","fltrd","inc_edges","_sdfg_state","SDFG_Node_Parser","_node","attr_name","recursively_find_graph","graph_id","ns_node","search_graph","scope_src","new_edge","p_graph","uuid_split","found_graph","set_positioning_info","post_subscope_func","scopes_recursive","processed_nodes","memlet_tree_nested","visited_edges","isview","propagate_forward","propagate_backward","add_children","next_node","nested_sdfg","nstate","memlet_tree_recursive","root_sdfg","trees","common_edge","mt","fromEntries","class_name","contains","cosh","sinh","parser_exit","SyntaxError","logHypot","_a","_b","Complex","tokens","match","loh","im","expm1","limit","xx","cosm1","t1","t2","Infinity","atan","acos","asin","noIM","oneMinus","onePlus","atanh","asinh","acosh","places","E","NaN","graphlib","debug","util","notime","version","greedyFAS","fas","acyclicer","weight","weightFn","visited","dfs","dfsFAS","removeEdge","forwardName","reversed","uniqueId","undo","addBorderNode","sg","sgNode","rank","borderType","prev","curr","addDummyNode","setParent","borderLeft","borderRight","minRank","maxRank","swapWidthHeight","swapWidthHeightOne","reverseYOne","swapXYOne","adjust","rankDir","rankdir","reverseY","swapXY","List","sentinel","_sentinel","unlink","filterOutLinks","dequeue","enqueue","strs","Graph","debugOrdering","layerMatrix","buildLayerMatrix","compound","layer","layerV","nodeCount","fasGraph","maxIn","maxOut","out","prevWeight","edgeWeight","buckets","zeroIdx","assignBucket","buildState","DEFAULT_WEIGHT_FN","sources","sinks","removeNode","doGreedyFAS","flatten","constant","collectPredecessors","uEntry","wEntry","acyclic","normalize","normalizeRanks","parentDummyChains","removeEmptyRanks","nestingGraph","addBorderSegments","coordinateSystem","order","opts","debugTiming","layoutGraph","inputGraph","canonicalize","merge","graphDefaults","selectNumberAttrs","graphNumAttrs","pick","graphAttrs","defaults","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","minlen","labelpos","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","asNonCompoundGraph","injectEdgeLabelProxies","cleanup","borderTop","borderBottom","assignRankMinMax","dummy","labelRank","removeEdgeLabelProxies","layers","orderShift","selfEdge","insertSelfEdges","selfNode","positionSelfEdges","last","removeBorderNodes","fixupEdgeLabelCoords","minX","POSITIVE_INFINITY","maxX","minY","maxY","graphLabel","marginX","marginx","marginY","marginy","getExtremes","translateGraph","nodeV","nodeW","assignNodeIntersects","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","edgesep","nodesep","mapValues","newAttrs","lodash","cloneDeep","each","forIn","isUndefined","minBy","sortBy","zipObject","nodeSep","depths","child","childNode","childTop","childBottom","thisWeight","nestingEdge","treeDepths","nestingRoot","acc","sumWeights","nodeRankFactor","dummyChains","vRank","wRank","edgeLabel","edgeObj","normalizeEdge","origLabel","successors","cg","vs","rootPrev","prevChild","movable","inV","nodeU","barycenter","relationship","hasNode","createRootNode","setDefaultNodeLabel","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","firstIndex","treeSize","cc","weightSum","layering","initOrder","crossCount","sortSubgraph","buildLayerGraph","addSubgraphConstraints","buildLayerGraphs","ranks","sweepLayerGraphs","layerGraphs","biasRight","lg","assignOrder","downLayerGraphs","upLayerGraphs","best","bestCC","lastBest","simpleNodes","orderedVs","mappedEntries","indegree","entryV","entryW","sourceSet","handleIn","vEntry","merged","handleOut","doResolveConflicts","resolveConflicts","bl","subgraphs","barycenters","subgraphResult","expandSubgraphs","predecessors","blPred","brPred","consumeUnsortable","unsortable","bias","parts","partition","sortable","lhs","rhs","vsIndex","postorderNums","lim","low","postorder","pathData","lca","vPath","wPath","findPath","pathIdx","pathV","ascending","findType1Conflicts","conflicts","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","addConflict","findType2Conflicts","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","conflictsV","hasConflict","verticalAlignment","neighborFn","prevIdx","ws","mp","il","horizontalCompaction","reverseSep","xs","blockG","blockGraph","sepFn","edgeSep","delta","vLabel","wLabel","sep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","findSmallestWidthAlignment","xss","NEGATIVE_INFINITY","halfWidth","alignCoordinates","alignTo","alignToVals","alignToMin","alignToMax","vert","horiz","alignment","xsVals","balance","ul","ignore","positionX","adjustedLayering","smallestWidth","rankSep","prevY","maxHeight","positionY","slack","tightTree","nodeEdges","edgeV","findMinSlackEdge","shiftRanks","directed","longestPath","feasibleTree","networkSimplex","networkSimplexRanker","tightTreeRanker","longestPathRanker","initRank","preorder","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","cutvalue","calcCutValue","assignCutValue","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","hasEdge","otherCutValue","dfsAssignLowLim","nextLim","neighbors","tailLabel","flip","candidates","isDescendant","flipped","updateRanks","rootLabel","simplified","simpleLabel","isMultigraph","successorWeights","weightMap","sucs","predecessorWeights","preds","collection","globalScope","Decimal","inexact","quadrant","EXP_LIMIT","MAX_DIGITS","NUMERALS","LN10","DEFAULTS","precision","rounding","modulo","toExpNeg","toExpPos","minE","maxE","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LN10_PRECISION","PI_PRECISION","P","digitsToString","indexOfLastWord","getZeroString","checkInt32","checkRoundingDigits","rm","repeating","di","rd","convertBase","baseIn","baseOut","arrL","strL","charAt","absoluteValue","finalise","comparedTo","cmp","xdL","ydL","xd","yd","ys","cosine","pr","Ctor","tinyPow","taylorSeries","cos2x","toLessThanHalfPi","neg","cubeRoot","cbrt","rep","t3","t3plusx","isZero","toExponential","divide","eq","decimalPlaces","dp","dividedBy","div","dividedToIntegerBy","divToInt","equals","greaterThan","gt","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","isInt","isNegative","isPositive","isPos","lessThan","lt","lessThanOrEqualTo","logarithm","isBase10","inf","naturalLogarithm","getLn10","sub","xLTy","shift","getBase10Exponent","mod","q","naturalExponential","negated","carry","getPrecision","sine","sin2_x","squareRoot","tangent","tan","mul","rL","toBinary","toStringBinary","toDecimalPlaces","toDP","finiteToString","toFraction","maxD","d0","n0","n1","toHexadecimal","toHex","toNearest","toNumber","toOctal","toPower","yn","intPow","toPrecision","toSignificantDigits","toSD","truncated","trunc","toJSON","multiplyInteger","compare","aL","bL","subtract","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","sign","isTruncated","roundUp","xdi","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","ltgt","guard","c0","parseDecimal","search","charCodeAt","parseOther","divisor","isFloat","isHyperbolic","pi","useDefaults","ps","getRandomValues","randomBytes","hypot","isDecimalInstance","log10","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","_extends","defaultEscapes","formatEscapes","defaultEscapeMapFn","_ref","_ref$preserveFormatti","preserveFormatting","_ref$escapeMapFn","escapeMapFn","runningStr","escapes","escapeKeys","_loop","specialCharFound","createError","errorConstructor","IntermediateInheritor","DivisionByZero","Fraction","InvalidParameter","throwInvalidParam","M","A","B","C","D","N","eps","rec","excludeWhole","whole","dec","cycLen","cycleLen","cycOff","rem1","rem2","modpow","cycleStart","json","alg","cmpt","cmpts","doDfs","navigation","isDirected","dijkstra","weightFunc","edgeFunc","PriorityQueue","edgeFn","pq","updateNeighbors","distance","predecessor","decrease","removeMin","runDijkstra","DEFAULT_WEIGHT_FUNC","tarjan","rowK","rowI","ik","kj","ij","altDistance","runFloydWarshall","components","dijkstraAll","findCycles","floydWarshall","isAcyclic","prim","topsort","CycleException","parents","pri","priority","onStack","lowlink","visit","_keyIndices","keyIndices","_decrease","_swap","_heapify","largest","origArrI","origArrJ","GRAPH_NODE","_isDirected","_isMultigraph","_isCompound","_defaultNodeLabelFn","_defaultEdgeLabelFn","_nodes","_parent","_preds","_out","_sucs","_edgeObjs","_edgeLabels","incrementOrInitEntry","decrementOrRemoveEntry","edgeArgsToId","v_","w_","edgeArgsToObj","edgeObjToId","_nodeCount","_edgeCount","isCompound","newDefault","isFunction","isEmpty","setNodes","_removeFromParentsChildList","ancestor","predsV","sucsV","union","isLeaf","filterNodes","findParent","edgeCount","setPath","valueSpecified","arg0","outV","writeNodes","nodeValue","writeEdges","edgeValue","write","read","naturalSort","oFxNcL","oFyNcL","sre","dre","hre","ore","insensitive","xN","yN","xD","yD","cLoc","numS","DataView","getNative","hashClear","hashDelete","hashGet","hashHas","hashSet","Hash","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","ListCache","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","setCacheAdd","setCacheHas","SetCache","__data__","stackClear","stackDelete","stackGet","stackHas","stackSet","Stack","WeakMap","thisArg","iteratee","resIndex","baseIndexOf","comparator","baseTimes","isArguments","isBuffer","isIndex","isTypedArray","inherited","isArr","isArg","isBuff","isType","skipIndexes","accumulator","initAccum","asciiSize","baseProperty","baseAssignValue","objValue","copyObject","keysIn","arrayEach","assignValue","baseAssign","baseAssignIn","cloneBuffer","copyArray","copySymbols","copySymbolsIn","getAllKeys","getAllKeysIn","getTag","initCloneArray","initCloneByTag","initCloneObject","isMap","isObject","isSet","argsTag","funcTag","objectTag","cloneableTags","baseClone","bitmask","customizer","isDeep","isFlat","isFull","tag","isFunc","stacked","subValue","objectCreate","baseCreate","proto","baseForOwn","baseEach","createBaseEach","isSymbol","computed","fromIndex","fromRight","arrayPush","isFlattenable","baseFlatten","isStrict","baseFor","createBaseFor","castPath","toKey","keysFunc","symbolsFunc","getRawTag","objectToString","symToStringTag","toStringTag","baseFindIndex","baseIsNaN","strictIndexOf","baseGetTag","isObjectLike","baseIsEqualDeep","baseIsEqual","equalArrays","equalByTag","equalObjects","arrayTag","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","isMasked","toSource","reIsHostCtor","funcProto","objectProto","funcToString","reIsNative","isLength","typedArrayTags","baseMatches","baseMatchesProperty","identity","isPrototype","nativeKeys","nativeKeysIn","isProto","isArrayLike","baseIsMatch","getMatchData","matchesStrictComparable","hasIn","isKey","isStrictComparable","assignMergeValue","baseMergeDeep","safeGet","baseMerge","srcIndex","newValue","cloneTypedArray","isArrayLikeObject","isPlainObject","toPlainObject","mergeFunc","isCommon","isTyped","arrayMap","baseGet","baseIteratee","baseMap","baseSortBy","baseUnary","compareMultiple","iteratees","orders","basePickBy","paths","baseSet","nativeCeil","nativeMax","eachFunc","overRest","setToString","lastIndex","nested","baseSetToString","string","comparer","symbolProto","symbolToString","baseToString","trimmedEndIndex","reTrimStart","arrayIncludes","arrayIncludesWith","cacheHas","createSet","setToArray","outer","seenIndex","assignFunc","valsLength","cache","stringToPath","arrayBuffer","byteLength","freeExports","nodeType","freeModule","Buffer","allocUnsafe","cloneArrayBuffer","dataView","byteOffset","reFlags","regexp","symbolValueOf","typedArray","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","compareAscending","objCriteria","criteria","othCriteria","ordersLength","isNew","getSymbols","getSymbolsIn","coreJsData","baseRest","isIterateeCall","assigner","iterable","findIndexFunc","baseRange","toFinite","noop","arraySome","isPartial","arrLength","othLength","arrStacked","othStacked","arrValue","othValue","compared","othIndex","mapToArray","convert","objProps","objLength","objStacked","skipCtor","objCtor","othCtor","freeGlobal","baseGetAllKeys","isKeyable","baseIsNative","getPrototype","overArg","nativeObjectToString","isOwn","unmasked","arrayFilter","stubArray","propertyIsEnumerable","nativeGetSymbols","getOwnPropertySymbols","mapTag","promiseTag","setTag","weakMapTag","dataViewTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","ArrayBuffer","ctorString","hasFunc","reHasUnicode","nativeCreate","cloneDataView","cloneRegExp","cloneSymbol","spreadableSymbol","isConcatSpreadable","reIsUint","reIsDeepProp","reIsPlainProp","uid","maskSrcKey","IE_PROTO","assocIndexOf","splice","getMapData","memoize","freeProcess","process","nodeUtil","require","binding","otherArgs","freeSelf","shortOut","nativeNow","lastCalled","stamp","remaining","pairs","LARGE_ARRAY_SIZE","hasUnicode","unicodeSize","memoizeCapped","rePropName","reEscapeChar","quote","subString","reWhitespace","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","rsSymbol","reUnicode","CLONE_DEEP_FLAG","propsIndex","propsLength","baseFilter","createFind","toInteger","castFunction","defaultValue","baseHas","hasPath","baseHasIn","baseIsArguments","stubFalse","baseKeys","baseIsMap","nodeIsMap","objectCtorString","baseIsSet","nodeIsSet","baseIsTypedArray","nodeIsTypedArray","arrayLikeKeys","baseKeysIn","baseExtremum","baseGt","resolver","memoized","Cache","createAssigner","baseLt","basePick","flatRest","basePropertyDeep","createRange","arrayReduce","baseReduce","isString","stringSize","baseOrderBy","remainder","baseTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","isArrLike","baseUniq","idCounter","baseValues","baseZipObject","epsilon","predictable","randomSeed","MATRIX_OPTIONS","NUMBER_OPTIONS","keywords","dependencies","createNode","factory","mathWithTransform","scope","isNode","comment","_compile","_validateScope","math","argNames","_ifNode","is","traverse","_traverse","_transform","replacement","customString","_getCustomString","_toString","toHTML","toTex","_toTex","getIdentifier","getContent","isClass","createArrayNode","ArrayNode","isArrayNode","evalItems","context","evalItem","mathjs","fromJSON","createBlockNode","ResultSet","BlockNode","blocks","block","isBlockNode","evalBlocks","param","latexSymbols","Alpha","Beta","beta","Gamma","gamma","Delta","Epsilon","varepsilon","Zeta","zeta","Eta","eta","Theta","theta","vartheta","Iota","iota","Kappa","varkappa","Lambda","lambda","Mu","mu","Nu","nu","Xi","Omicron","omicron","Pi","varpi","Rho","rho","varrho","Sigma","sigma","varsigma","Tau","tau","Upsilon","upsilon","Phi","phi","varphi","Chi","chi","Psi","psi","Omega","omega","true","false","Inf","infinity","oo","latexOperators","transpose","ctranspose","factorial","dotPow","unaryPlus","unaryMinus","bitNot","dotMultiply","dotDivide","to","leftShift","rightArithShift","rightLogShift","equal","unequal","smaller","larger","smallerEq","largerEq","bitAnd","bitXor","bitOr","and","xor","or","latexFunctions","cube","fix","log1p","norm","nthRoot","nthRoots","square","bellNumbers","catalan","stirlingS2","conj","cross","det","expm","inv","sqrtm","combinations","combinationsWithRep","erf","variance","acot","acoth","acsc","acsch","asec","asech","cot","coth","csc","csch","sec","sech","numeric","bignumber","complex","sparse","latexUnits","deg","escapeLatex","toSymbol","isUnit","createConstantNode","ConstantNode","isConstantNode","toLatex","createObjectNode","ObjectNode","isObjectNode","evalEntries","stringifiedKey","parsedKey","_key","createParenthesisNode","ParenthesisNode","isParenthesisNode","parenthesis","AssignmentNode","FunctionAssignmentNode","ConditionalNode","latexLeftParens","latexRightParens","latexParens","associativity","associativeWith","RelationalNode","RangeNode","getPrecedence","identifier","getAssociativity","isAssociativeWith","nodeA","nodeB","identifierA","identifierB","createRelationalNode","conditionals","isRelationalNode","compiled","evalLhs","evalRhs","condFn","precedence","paramStrings","paramPrecedence","operatorMap","createChainClass","Chain","createLazyProxy","chainify","isChain","createProxy","arg1","_name","excludedNames","expression","docs","classes","createReviver","createConditionalNode","trueExpr","falseExpr","isConditionalNode","evalCondition","evalTrueExpr","evalFalseExpr","testCondition","conditionPrecedence","truePrecedence","falsePrecedence","createOperatorNode","OperatorNode","op","implicit","calculateNecessaryParentheses","latex","operandPrecedence","operandIdentifier","rootIdentifier","lhsParens","rhsParens","lhsPrecedence","assocWithLhs","_rootIdentifier","lhsIdentifier","rhsIdentifier","rhsPrecedence","assocWithRhs","argPrecedence","assocWithArg","argAssociativity","isOperatorNode","evalArgs","evalArg0","_evalArg","evalArg1","evalArg","isUnary","parens","assoc","operand","opIsNamed","stringifiedArgs","lhsTex","rhsTex","texifiedArgs","createRangeNode","startPrecedence","stepPrecedence","endPrecedence","isRangeNode","needsEnd","evalStart","evalEnd","evalStep","createFunctionAssignmentNode","typed","needParenthesis","exprPrecedence","isFunctionAssignmentNode","childArgNames","evalExpr","signature","syntax","signatures","childArgs","createChain","any","errorTransform","isIndexError","IndexError","accessFactory","isObjectProperty","getObjectProperty","createAccessorNode","access","AccessorNode","isAccessorNode","evalObject","evalIndex","createIndexNode","IndexNode","dimensions","dotNotation","isIndexNode","evalDimensions","_evalStart","_evalEnd","_evalStep","_childArgNames","evalRange","_evalRange","evalDimension","createAssignmentNode","assignFactory","isAssignmentNode","evalValue","childObject","evalParentObject","parentProp","evalParentIndex","parentIndex","createSymbolNode","Unit","isValuelessUnit","SymbolNode","isSymbolNode","undef","createFunctionNode","FunctionNode","isFunctionNode","rawArgs","_rawArgs","evalFn","_rawArgs2","nodeToString","expandTemplate","template","regex","inputPos","nodeToTex","customTex","latexConverter","customToTex","createParse","parseStart","expressions","parseMultiple","extraNodes","DELIMITERS","'","NAMED_DELIMITERS","in","CONSTANTS","null","NUMERIC_CONSTANTS","currentString","currentCharacter","prevCharacter","nextCharacter","getToken","tokenType","token","isWhitespace","nestingLevel","c1","c2","c3","isDigitDot","_c","isHexDigit","isDigit","isDecimalMark","createSyntaxError","isAlpha","getTokenSkipNewline","openParams","closeParams","conditionalLevel","parseAssignment","parseBlock","valid","parseLogicalXor","parseLogicalOr","parseConditional","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","parseShift","operators","parseConversion","parseRange","parseAddSubtract","parseMultiplyDivide","parseImplicitMultiplication","parseRule2","parseUnary","tokenStates","CustomNode","parseAccessors","parseDoubleQuotesStringToken","parseSingleQuotesStringToken","parseRow","numberStr","parseEnd","parseParentheses","parseNumber","parseObject","parseMatrix","parseSingleQuotesString","parseDoubleQuotesString","parseSymbol","parseCustomNodes","parseLeftHandOperators","parsePow","col","char","cPrev","cNext","isValidLatinOrGreek","isValidMathSymbol","high","createEvaluate","createHelpClass","Help","doc","isHelp","examples","seealso","createParserClass","Parser","isParser","getAll","piDocs","eDocs","embeddedDocs","boolean","createUnit","fraction","splitUnit","LN2","LOG2E","LOG10E","SQRT1_2","SQRT2","speedOfLight","gravitationConstant","planckConstant","reducedPlanckConstant","magneticConstant","electricConstant","vacuumImpedance","coulomb","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","lsolve","lsolveAll","lup","lusolve","rationalize","slu","usolve","usolveAll","qr","lcm","xgcd","composition","import","help","diag","getMatrixDataType","eigs","kron","ones","partitionSelect","reshape","rotationMatrix","squeeze","zeros","kldivergence","multinomial","permutations","pickRandom","randomInt","compareNatural","compareText","deepEqual","equalText","setCartesian","setDifference","setDistinct","setIntersect","setIsSubset","setMultiplicity","setPowerset","setSize","setSymDifference","setUnion","mad","quantileSeq","std","format","bin","oct","hex","isNumeric","hasNumericValue","isPrime","typeOf","createHelp","searchName","searchText","createCompile","createUtil","commutative","associative","isAssociative","allChildren","findChildren","createMakeNodeFunction","isCommutative","unflattenr","makeNode","curnode","unflattenl","createSimplifyCore","node0","node1","simplifyCore","a0","a1","a00","a00a1","a01","createSimplifyConstant","_eval","fnname","_toNumber","_toNode","vn","unaryMinusNode","BigNumber","_exactFraction","exactFractions","fractionsLimit","foldOp","ignoreandcontinue","foldFraction","ignoreandcontine","_args","consts","vars","createResolve","createSimplify","simplifyConstant","rules","ruleSet","rule","newRule","ruleType","lr","removeParens","expandsym","_lastsym","expanded","_buildRules","applyRule","SUPPORTED_CONSTANTS","repl","matches","_ruleMatch","placeholders","mergeMatch","match1","match2","_exactMatch","combineChildMatches","list1","list2","i1","i2","isSplit","splits","rightArgs","getSplits","splitMatches","matchSet","childMatches","childMatch","sets","uniqueSets","unique","mergeChildMatches","createRationalize","detailed","setRules","oldRules","rulesFirst","rulesSucDiv","firstRules","distrDivRules","sucDivRules","firstRulesAgain","finalRules","rulesRationalize","polyRet","extended","variables","oper","recPoly","tp","retFunc","polynomial","nVars","sBefore","expandPower","eDistrDiv","redoInic","coefficients","retRationalize","polyToCanonical","indParent","internal","does","nEsqTopo","nDirTopo","maxExpo","varname","recurPol","noPai","noFil","fire","cte","valor","_i2","no","n2","n3","createParser","createDerivative","variable","constNodes","constTag","_derivative","_simplify","deriv","_derivTex","varName","isConst","funcArgsCheck","funcDerivative","negative","chainDerivative","constantTerms","nonConstantTerms","nonConstantNode","newArgs","argOuter","argInner","_arg","_arg2","powMinusOne","valueType","createApplyTransform","dim","isTransformFunction","compileInlineExpression","subScope","createFilterTransform","filterTransform","_filter","toArray","createMapTransform","mapTransform","orig","argsCount","recurse","createForEachTransform","forEachTransform","_forEach","createSubsetTransform","createIndexTransform","Index","ii","createConcatTransform","lastDimToZeroBase","createMaxTransform","createMinTransform","createSumTransform","createColumnTransform","createRangeTransform","createDiffTransform","createRowTransform","createMeanTransform","createVarianceTransform","createStdTransform","chain","parser","equalScalar","multiplyScalar","print","addScalar","divideScalar","Matrix","DenseMatrix","SparseMatrix","ImmutableDenseMatrix","FibonacciHeap","Spa","createResultSet","isResultSet","createComplexClass","strRe","strIm","hasBase","createRangeClass","hasStart","hasEnd","hasStep","isRange","nums","createBigNumberE","hasher","createBigNumberPhi","createBigNumberPi","createBigNumberTau","createTrue","createFalse","createNull","createInfinity","recreateFactory","createNaN","_ref2","createPi","_ref3","createTau","_ref4","createE","_ref5","createPhi","_ref6","createLN2","_ref7","createLN10","_ref8","createLOG2E","_ref9","createLOG10E","_ref10","createSQRT1_2","_ref11","createSQRT2","_ref12","createI","_ref13","I","createVersion","recreateOnConfigChange","createBigNumberClass","isBigNumber","createMatrixClass","isMatrix","storage","skipZeros","createReplacer","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","valueStr","unitStr","fixPrefix","createFractionClass","createDenseMatrixClass","_size","_datatype","preprocess","isScalar","DimensionError","_getSubmatrix","dims","dimension","_set","submatrix","sSize","iSize","_fit","_setSubmatrix","dataIndex","subIndex","_resize","newSize","createDenseMatrix","isDenseMatrix","getDataType","indexI","sizeArray","currentLength","me","diagonal","kSuper","kSub","_value","ms","swapRows","_swapRows","vi","_createTyped2","createTyped","conversions","throwNoBignumber","throwNoComplex","throwNoFraction","throwNoMatrix","createIsInteger","createIsNumeric","isNegativeNumber","isPositiveNumber","isZeroNumber","isNaNNumber","createIsPositive","createIsNaN","createEqualScalar","complexEquals","equalBase","createNumber","nonDecimalWithRadixMatch","nonDecimalNumberParts","radix","integerPart","fractionalPart","makeNumberFromNonDecimalParts","wordSizeSuffixMatch","valuelessUnit","createBoolean","lcase","createComplex","ZERO","createSplitUnit","absNumber","addNumber","multiplyNumber","unaryMinusNumber","unaryPlusNumber","cbrtNumber","ceilNumber","cubeNumber","expNumber","expm1Number","gcdNumber","lcmNumber","logNumber","log10Number","log2Number","modNumber","signNumber","squareNumber","xgcdNumber","lastx","lasty","powNumber","roundNumber","decimals","createUnaryPlus","createCube","createExpm1","_Complex","createLog10","createMultiplyScalar","_normalize","createSign","_BigNumber","_Fraction","createSquare","bitAndBigNumber","bitwise","bitNotBigNumber","prevPrec","bitOrBigNumber","negOne","xBits","yBits","minBits","maxBits","minSign","xSign","ySign","decCoefficientToBinaryString","shortLen","longLen","expFuncVal","outVal","twoPower","two","_j","leftShiftBigNumber","rightArithShiftBigNumber","bitAndNumber","bitNotNumber","bitOrNumber","bitXorNumber","leftShiftNumber","rightArithShiftNumber","rightLogShiftNumber","createBitNot","createArg","createIm","notNumber","orNumber","xorNumber","andNumber","createNot","createFilter","_filterCallback","createForEach","createMap","createErf","MAX_NUM","THRESH","ysq","xnum","xden","Q","erf1","del","erfc2","SQRPI","erfc3","createFormat","createOct","notation","wordSize","createPrint","_print","original","createIsPrime","createAcos","acoshNumber","acotNumber","acothNumber","acscNumber","acschNumber","xInv","asecNumber","asechNumber","asinhNumber","atanhNumber","cotNumber","cothNumber","cscNumber","cschNumber","secNumber","sechNumber","sinhNumber","createAcot","createAcsc","createAsec","createAsin","createAtan","createAtanh","createCosh","BASE_UNITS","ANGLE","createCoth","createCsch","createSech","createSinh","createTanh","product","half","combinationsNumber","nMinusk","createCombinations","isPositiveInteger","singletonRandom","seedrandom","seed","createPickRandom","rng","possibles","_pickRandom","weights","elementWise","single","createMatrix","totalWeights","randKey","_len","randomMatrix","_length","createRandomInt","_randomInt","_randomIntMatrix","createClone","createHasNumericValue","createTypeOf","createString","createFraction","createUnaryMinus","createAddScalar","createExp","createLog2","_log2Complex","newX","createSqrt","_sqrtNumber","createConj","conjugate","createGetMatrixDataType","createMode","_mode","createBin","createAcosh","createAcsch","createAsinh","createCos","createCsc","createSin","createCombinationsWithRep","nMinusOne","createRandom","_random","_randomMatrix","createIsNegative","createSparseMatrixClass","_values","_index","_ptr","_createFromArray","_createFromMatrix","ptr","zero","_getsubset","idx","kk","mvalues","mindex","mptr","pv","_setsubset","x0","y0","_getValueIndex","_insert","ins","_toArray","createSparseMatrix","isSparseMatrix","density","_remove","sizes","colIndex","rowIndex","r1","flat","_i3","minRow","maxRow","minColumn","maxColumn","invoke","_k","_i5","_k2","_i7","_forEachRow","kx","ky","vx","vy","_create","createCbrt","_cbrtComplex","third","negate","_result","allRoots","arg3","principal","all","createAlgorithm01","denseMatrix","sparseMatrix","adata","asize","adt","bvalues","bindex","bptr","bsize","bdt","RangeError","cf","cdata","mark","createAlgorithm04","avalues","aindex","aptr","cvalues","cptr","xb","wa","wb","createAlgorithm10","createAlgorithm13","bdata","csize","_iterate","av","bv","cv","createAlgorithm14","createGcd","algorithm01","algorithm04","algorithm10","algorithm13","algorithm14","createAlgorithm02","cij","createAlgorithm03","createAlgorithm05","wai","wbi","vc","createAlgorithm11","createAlgorithm12","createMod","algorithm02","algorithm03","algorithm05","algorithm11","algorithm12","createAlgorithm06","createNthRoot","algorithm06","complexErr","_bigNthRoot","Big","createXgcd","createBitAnd","createAlgorithm07","_scatter","va","vb","createBitXor","algorithm07","createOr","createDiag","_diag","_createDiagonalMatrix","dm","vector","_getDiagonal","createIdentity","_identity","_identityVector","minimum","createOnes","_ones","hasBigNumbers","_validate","createReshape","createSize","createZeros","_zeros","createHex","ownKeys","enumerableOnly","sym","_objectSpread","getOwnPropertyDescriptors","NO_INT","createRound","roundNumberSignatures","createAlgorithm08","createLeftShift","algorithm08","createRightLogShift","createCompare","createCompareText","createSmaller","createLarger","createUnequal","_unequal","createImmutableDenseMatrixClass","_min","_max","isImmutableDenseMatrix","createFibonacciHeapClass","oneOverLogPhi","_minimum","_cut","degree","_cascadingCut","isFibonacciHeap","extractMinimum","numberOfChildren","tempRight","arraySize","numRoots","_linkNodes","_findMinimumNode","_decreaseKey","createSparse","createAcoth","createAlgorithm09","createAtan2","algorithm09","createSec","createAdd","rest","createDot","_validateDim","aIsColumn","bIsColumn","_c2","_c3","xindex","xvalues","yindex","yvalues","J","xLen","yLen","xSize","ySize","createComposition","createIsZero","createAbs","createFloor","exponent","createMultiply","_validateMatrixDimensions","size1","size2","_multiplyMatrixVector","arows","acolumns","af","mf","brows","ib","vbi","ka0","ka1","ka","ia","ic","_multiplyMatrixMatrix","bcolumns","jb","kb0","kb1","kb","vbij","p0","xsize","ysize","_multiplyVectorVector","alength","_multiplyVectorDenseMatrix","_multiplyVectorMatrix","createDotMultiply","createRe","createFlatten","ArgumentsError","isArgumentsError","createResize","_resizeString","asMatrix","defaultChar","createSqueeze","createTo","createPow","_pow","_powArray","_powMatrix","yFrac","yNum","createDotPow","createRightArithShift","createCompareNatural","compareBooleans","typeX","typeY","compareMatricesAndArrays","compareComplexNumbers","compareArrays","formatUnits","keysX","keysY","compareObjects","createEqualText","createLargerEq","createPartitionSelect","asc","_partitionSelect","quickSelect","pivot","createIndexClass","_dimensions","_isScalar","_createImmutableMatrix","createAsech","createTan","createSetDifference","a2","inb2","b1","b2","createSetIntersect","createSetMultiplicity","createSetSize","createTrace","_denseTrace","createQuantileSeq","_quantileSeq","prob","_fracPart","validate","_left","_right","_integerPart","fracPart","integerPartNumber","probOrN","probArr","dataArr","nPlusOne","intN","_nPlusOne","currProb","gammaNumber","twoN","threeN","fourN","fiveN","gammaP","gammaG","createGamma","real","den","twoPiSqrt","bigFactorial","createBignumber","twoPowSize","twoPowSizeSubOne","createLcm","createBitOr","createKron","_kron","createTranspose","transposedRow","transposed","_denseTranspose","_sparseTranspose","createNumeric","_number","validInputTypes","validOutputTypes","outputType","inputType","createAnd","createSmallerEq","createSort","compareAsc","compareDesc","_arrayIsVector","_matrixIsVector","_comparator","createCot","createSetDistinct","createSetPowerset","_subset","_sort","bitarray","createIndex","createFactorial","createPermutations","createCeil","createSubtract","checkEqualDimensions","createCross","_cross","highestDimension","createProd","_prod","improveErrorMessage","createEqual","createSetCartesian","createSetSymDifference","createFix","createCtranspose","createDeepEqual","_deepEqual","createSetIsSubset","createXor","createDivideScalar","createNthRoots","_calculateExactResult","_nthComplexRoots","aIsNumeric","roots","halfPiFactor","createSolveValidation","mSize","bSize","_i4","createLsolve","solveValidation","bj","vjj","jValues","jIndices","xj","_sparseForwardSubstitution","_denseForwardSubstitution","createLsolveAll","b_","L","iValues","iIndices","Mii","bNew","_j3","_lastIndex2","_J2","_j2","_lastIndex","_J","createSpaClass","_heap","isSpa","accumulate","heap","swap","nodei","nodej","createSetUnion","createLup","_denseLUP","lvalues","lindex","lptr","lsize","uvalues","uindex","uptr","usize","pvCo","pvOc","spa","vkj","vik","pabsv","absv","U","_sparseLUP","ldata","udata","vij","csTdfs","post","csFlip","createCsAmd","lemax","dense","cm","at","tindex","tptr","_createTargetMatrix","nz","csFkeep","k2","pj","nvi","pk","eln","pn","cnz","W","nv","elen","hhead","_wclear","_initializeQuotientGraph","nel","_initializeDegreeLists","mindeg","elenk","nvk","dk","pk1","pk2","wnvi","dext","p3","p4","nvj","jlast","ok","csLeaf","maxfirst","prevleaf","sparent","jleaf","jprev","createCsCounts","ata","colcount","createCsSqr","csAmd","csCounts","pinv","t0","csPermute","inext","csEtree","csPost","cp","leftmost","tail","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","createDet","decomp","evenCycles","_det","createDistance","_2d","xCoeff","yCoeff","_distancePointLine2D","lineTwoPtY","lineTwoPtX","lineOnePtY","lineOnePtX","pointX","pointY","_3d","_parametricLine","_distancePointLine3D","_containsOnlyNumbers","_euclideanDistance","xCoeffLine","yCoeffLine","pointZ","z0","pointOneX","pointOneY","pointTwoX","pointTwoY","pointOneZ","pointTwoZ","_isNumber","aI","_pairwise","pointA","pointB","_distancePairwise","_objectToArray","vectorSize","createStirlingS2","kFactorial","negativeOne","kChooseI","iPower","createCatalan","createCount","createLog","createDotDivide","createUsolveAll","_sparseBackwardSubstitution","_denseBackwardSubstitution","createHypot","createQr","_denseQR","_sparseQR","R","_denseQRimpl","Qdata","Rdata","sgn","conjSgn","alphaSquared","u1","createInv","_inv","mat","ABig","rBig","Ac","Bc","Ar","Br","createExpm","infNorm","errorEstimate","findParams","rowSum","infinityNorm","Apos","factor","AposToI","alternate","qfac","twoqfac","twoqp1fac","createDivide","createKldivergence","_kldiv","plength","qlength","qnorm","pnorm","createBellNumbers","createLog1p","_log1pComplex","xRe1p","createUnitClass","units","UNIT_NONE","PREFIXES","NONE","power","BASE_DIMENSIONS","skipAutomaticSimplification","skipWhitespace","oldIndex","tentativeNumber","tentativeIndex","parseUnit","unitName","isValidAlpha","firstC","parseCharacter","toFind","powerMultiplierCurrent","expectingUnit","powerMultiplierStack","powerMultiplierStackProduct","uStr","oldC","_findUnit","baseDim","UNIT_SYSTEMS","auto","allowNoUnits","_isDerived","unitValue","unitOffset","unitPower","unitPrefixValue","_getNumberConverter","_denormalize","prefixValue","UNITS","prefixes","_unit","prefixLen","prefixName","_prefix","getNumericIfUnitless","valThis","valOther","toNumeric","matchingBase","matchingUnit","proposedUnitList","currentUnitSystem","missingBaseDim","toSI","si","strNum","strDen","nNum","nDen","simp","isImaginary","VAR","VA","_bestPrefix","absValue","absUnitValue","bestPrefix","bestDiff","scientific","xNumeric","xRounded","testSum","SHORT","da","G","T","Z","LONG","deca","hecto","kilo","mega","giga","tera","peta","exa","zetta","yotta","deci","centi","milli","micro","nano","pico","femto","atto","zepto","yocto","SQUARED","CUBIC","BINARY_SHORT_SI","BINARY_SHORT_IEC","Ki","Mi","Gi","Ti","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","BIT","meter","inch","foot","yard","mile","rod","angstrom","ft","mi","li","ch","mil","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","acre","hectare","m3","litre","cuin","cuft","cuyd","teaspoon","tablespoon","drop","gtt","minim","fluiddram","fluidounce","gill","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","fldr","floz","gi","qt","gal","bbl","obl","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","stone","gr","dr","oz","lbm","cwt","second","minute","hour","day","week","month","year","decade","century","millennium","hertz","reciprocal","Hz","rad","radian","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","atm","torr","mmHg","mmH2O","cmH2O","farad","F","volt","V","ohm","henry","H","siemens","S","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","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","cgs","us","_key2","setUnitSystem","getUnitSystem","typeConverters","_name2","_unit2","alias","_key3","override","_key4","deleteUnit","aliases","lastUnit","_key5","createUnitSingle","assertUnitNameIsValid","baseName","defUnit","newUnit","anyMatch","_newBaseUnit","newBaseUnit","_i6","_i8","aliasName","_alias","_key6","createCreateUnit","createEigs","ans","checkAndSubmit","vectors","isSymmetric","xArr","e0","Sij","createArray","aii","ajj","aij","denom","Vab","getAijBig","x1Big","Sij1Big","sorting","diagBig","getAij","Sij1","Ski","Skj","Hij","s2","Aki","Akj","csHij","Aii","Ajj","_k3","_k4","Mij","maxMij","maxIJ","Ef","Sf","minID","_k5","createIntersect","plane","_isNumeric","_4d","z1","z2","x1x","x2x","y1y","y2y","z1z","z2z","_intersectLinePlane","p1a","p1b","p2a","p2b","d20o11","d21o10","d20o21","d21o20","_intersect2d","x3","y3","z3","d1343","_intersect3dHelper","x4","y4","z4","d4321","d1321","d4343","d2121","ta","tb","pax","pay","paz","pbx","pby","pbz","add1","add2","add3","createUsolve","createNorm","_norm","sizeX","pinf","_vectorNormPlusInfinity","ninf","_vectorNormMinusInfinity","_vectorNorm","maxc","cj","_matrixNormOne","maxr","ri","_matrixNormInfinity","fro","_matrixNormFrobenius","squaredX","eigenVals","_matrixNormTwo","_matrixNorm","csIpvec","createLusolve","_lusolve","_toMatrix","createSqrtm","_tolerance","_denmanBeavers","iterations","Yk","createMultinomial","ai","createRotationMatrix","_rotationMatrix2x2","matrixV","_validateVector","_rotationMatrix3x3","storageType","minusOne","cosTheta","sinTheta","_convertToFormat","_mul","normV","vz","oneMinusC","createMedian","_median","middle2","middle","createRotate","_validateSize","expectedSize","actualSize","createMad","_mad","med","createUnitFunction","_false","_null","_true","_NaN","_Infinity","actual","expected","relation","isDimensionError","createApply","_apply","tran","_switch","createColumn","_column","rowRange","createConcat","prevDim","matrices","_concat","concatDim","createDiff","_diff","_recursive","_ElementDiff","obj1","obj2","obj1IsArray","obj2IsArray","_ArrayDiff","_strRange","_rangeEx","includeEnd","_rangeInc","_bigRangeEx","_bigRangeInc","_parse","createRow","_row","columnRange","createSubset","_getObjectProperty","_getSubstring","_setSubstring","_setObjectProperty","strLen","chars","updated","createMax","_largest","createMean","_mean","createMin","_smallest","createStd","_std","normalization","createSum","_sum","fnName","details","DEFAULT_NORMALIZATION","createVariance","_var","_varDim","dimNext","validateIndex","oldLen","newLen","flatArray","newLength","processSizesWildcard","tmpArray2","tmpArray","sizeIndex","_reshape","processedSizes","wildCardIndex","_squeeze","unsqueeze","_unsqueeze","filterRegExp","separator","identify","generalize","getArrayDataType","itemType","containsCollections","deepForEach","deepMap","_reduce","scatter","getSafeProperty","isSafeProperty","isSafeMethod","setSafeProperty","safeNativeProperties","validateSafeMethod","safeNativeMethods","toLocaleString","assertAndCreate","deps","stripOptionalNotation","dependency","isOptionalDependency","missingDependencies","assertDependencies","isFactory","lruQueue","queue","hit","nuIndex","delete","lru","hash","newVal","maxArgumentCount","isNumber","isComplex","isFraction","isCollection","isBoolean","isDate","isRegExp","isNull","noBignumber","noFraction","noMatrix","formatNumberToBase","8","16","rounded","roundDigits","splitNumber","newExp","missingZeros","expDiff","decimalIdx","decimalVal","toEngineering","lowerExp","upperExp","splitValue","pp","DBL_EPSILON","nearlyEqual","mapObject","extend","deepStrictEqual","lazy","valueResolver","_uninitialized","pickShallow","formatBigNumberToBase","big2","BigNumberCtor","valueWithoutExp","looksLikeFraction","formatArray","escaped","Op","hasOwn","$Symbol","iteratorSymbol","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","define","wrap","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","Context","_invoke","GenStateSuspendedStart","GenStateExecuting","GenStateCompleted","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","record","tryCatch","GenStateSuspendedYield","makeInvokeMethod","GeneratorFunction","GeneratorFunctionPrototype","IteratorPrototype","getProto","NativeIteratorPrototype","Gp","defineIteratorMethods","AsyncIterator","PromiseImpl","__await","unwrapped","previousPromise","callInvokeWithMethodAndArg","resultName","nextLoc","pushTryEntry","locs","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","reset","iteratorMethod","displayName","isGeneratorFunction","genFun","ctor","awrap","async","skipTempReset","stop","rootRecord","rval","handle","loc","caught","hasCatch","hasFinally","finallyEntry","complete","finish","thrown","delegateYield","regeneratorRuntime","accidentalStrictMode","alea","xor128","xorwow","xorshift7","xor4096","tychei","sr","global","Alea","mash","s0","s1","impl","xg","prng","int32","double","quick","XorGen","strseed","pool","nodecrypto","startdenom","significance","overflow","mask","shortseed","mixkey","entropy","tostring","msCrypto","browser","navigator","plugins","screen","autoseed","arc4","ARC4","pass","is_math_call","keylen","typ","smear","stringseed","fromCharCode","notOk","_types","anyType","_ignore","_conversions","findTypeByName","typeName","findInArray","findTypeIndex","findTypeName","stringifyParams","typeNames","getTypeName","restParam","parseParam","notEmpty","notIgnore","matchingConversions","conversion","filterConversions","exactTypes","typeIndex","conversionIndex","convertibleTypes","hasRestParam","hasConversions","compileTest","test0","test1","tests","compileTests","varIndex","lastTest","testRestParam","getParamAtIndex","getExpectedTypeNames","excludeConversions","isExactType","mergeExpectedParams","uniq","flatMap","matchingSignatures","nextMatchingDefs","actualType","lengths","maxLength","expectedLength","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","compareSignatures","signature1","signature2","compileArgConversion","conversion0","conversion1","splitParams","ignoreConversionTypes","_splitParams","typeGroups","filteredTypes","typeGroup","createTypedFunction","signaturesMap","parsedSignatures","parsedParam","isInvalidParam","parseSignature","notNull","parsedSignature","conflictingSignature","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","createSignaturesMap","array1","array2","getName","extractSignatures","validateUnique","_signature","_fn","addType","beforeObjectTest","addConversion","__webpack_module_cache__","inProgress","dataWebpackPrefix","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","amdD","amdO","getter","__esModule","chunkId","promises","script","needAttach","scripts","getElementsByTagName","charset","nc","onScriptComplete","doneFns","nmd","scriptUrl","importScripts","installedChunks","179","529","installedChunkData","promise","errorType","realSrc","webpackJsonpCallback","parentChunkLoadingFunction","chunkIds","moreModules","chunkLoadingGlobal","__webpack_exports__"],"mappings":";0DAAe,SAASA,EAAkBC,EAAKC,IAClC,MAAPA,GAAeA,EAAMD,EAAIE,UAAQD,EAAMD,EAAIE,QAE/C,IAAK,IAAIC,EAAI,EAAGC,EAAO,IAAIC,MAAMJ,GAAME,EAAIF,EAAKE,IAC9CC,EAAKD,GAAKH,EAAIG,GAGhB,OAAOC,E,8CCPM,SAASE,EAAuBC,GAC7C,QAAa,IAATA,EACF,MAAM,IAAIC,eAAe,6DAG3B,OAAOD,E,8CCLT,SAASE,EAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQC,EAAKC,GACpE,IACE,IAAIC,EAAOP,EAAIK,GAAKC,GAChBE,EAAQD,EAAKC,MACjB,MAAOC,GAEP,YADAP,EAAOO,GAILF,EAAKG,KACPT,EAAQO,GAERG,QAAQV,QAAQO,GAAOI,KAAKT,EAAOC,GAIxB,SAASS,EAAkBC,GACxC,OAAO,WACL,IAAIjB,EAAOkB,KACPC,EAAOC,UACX,OAAO,IAAIN,SAAQ,SAAUV,EAASC,GACpC,IAAIF,EAAMc,EAAGI,MAAMrB,EAAMmB,GAEzB,SAASb,EAAMK,GACbT,EAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQ,OAAQI,GAGlE,SAASJ,EAAOe,GACdpB,EAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQ,QAASe,GAGnEhB,OAAMiB,O,8CC/BG,SAASC,EAAgBC,EAAUC,GAChD,KAAMD,aAAoBC,GACxB,MAAM,IAAIC,UAAU,qC,6ECFT,SAASC,IACtB,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EACjE,GAAID,QAAQC,UAAUC,KAAM,OAAO,EACnC,GAAqB,mBAAVC,MAAsB,OAAO,EAExC,IAEE,OADAC,QAAQC,UAAUC,QAAQC,KAAKP,QAAQC,UAAUG,QAAS,IAAI,iBACvD,EACP,MAAOI,GACP,OAAO,GCPI,SAASC,EAAWC,EAAQpB,EAAMqB,GAc/C,OAZEF,EADE,IACWT,QAAQC,UAER,SAAoBS,EAAQpB,EAAMqB,GAC7C,IAAIC,EAAI,CAAC,MACTA,EAAEC,KAAKrB,MAAMoB,EAAGtB,GAChB,IACIM,EAAW,IADGkB,SAASC,KAAKvB,MAAMkB,EAAQE,IAG9C,OADID,IAAO,EAAAK,EAAA,GAAepB,EAAUe,EAAMN,WACnCT,IAIOJ,MAAM,KAAMD,a,4BChBhC,SAAS0B,EAAkBC,EAAQC,GACjC,IAAK,IAAIpD,EAAI,EAAGA,EAAIoD,EAAMrD,OAAQC,IAAK,CACrC,IAAIqD,EAAaD,EAAMpD,GACvBqD,EAAWC,WAAaD,EAAWC,aAAc,EACjDD,EAAWE,cAAe,EACtB,UAAWF,IAAYA,EAAWG,UAAW,GACjDC,OAAOC,eAAeP,EAAQE,EAAWzC,IAAKyC,IAInC,SAASM,EAAa7B,EAAa8B,EAAYC,GAG5D,OAFID,GAAYV,EAAkBpB,EAAYQ,UAAWsB,GACrDC,GAAaX,EAAkBpB,EAAa+B,GACzC/B,E,8CCbM,SAASgC,EAAgBC,EAAKnD,EAAKG,GAYhD,OAXIH,KAAOmD,EACTN,OAAOC,eAAeK,EAAKnD,EAAK,CAC9BG,MAAOA,EACPuC,YAAY,EACZC,cAAc,EACdC,UAAU,IAGZO,EAAInD,GAAOG,EAGNgD,E,6ECXM,SAASC,EAAKb,EAAQc,EAAUC,GAiB7C,OAfEF,EADqB,oBAAZ/B,SAA2BA,QAAQkC,IACrClC,QAAQkC,IAER,SAAchB,EAAQc,EAAUC,GACrC,IAAIE,ECLK,SAAwBC,EAAQJ,GAC7C,MAAQR,OAAOnB,UAAUgC,eAAe9B,KAAK6B,EAAQJ,IAEpC,QADfI,GAAS,EAAAE,EAAA,GAAeF,MAI1B,OAAOA,EDDQ,CAAclB,EAAQc,GACjC,GAAKG,EAAL,CACA,IAAII,EAAOf,OAAOgB,yBAAyBL,EAAMH,GAEjD,OAAIO,EAAKL,IACAK,EAAKL,IAAI3B,KAAK0B,GAGhBM,EAAKzD,SAIJoC,EAAQc,EAAUC,GAAYf,K,4BElB7B,SAASuB,EAAgBC,GAItC,OAHAD,EAAkBjB,OAAOR,eAAiBQ,OAAOc,eAAiB,SAAyBI,GACzF,OAAOA,EAAEC,WAAanB,OAAOc,eAAeI,KAEvBA,G,4ECHV,SAASE,EAAUC,EAAUC,GAC1C,GAA0B,mBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIhD,UAAU,sDAGtB+C,EAASxC,UAAYmB,OAAOuB,OAAOD,GAAcA,EAAWzC,UAAW,CACrE2C,YAAa,CACXlE,MAAO+D,EACPtB,UAAU,EACVD,cAAc,KAGdwB,IAAY,OAAeD,EAAUC,K,oECX5B,SAASG,EAA2B9E,EAAMoC,GACvD,OAAIA,GAA2B,YAAlB,OAAQA,IAAsC,mBAATA,GAI3C,OAAsBpC,GAHpBoC,I,4BCJI,SAAS2C,EAAgBR,EAAGS,GAMzC,OALAD,EAAkB1B,OAAOR,gBAAkB,SAAyB0B,EAAGS,GAErE,OADAT,EAAEC,UAAYQ,EACPT,IAGcA,EAAGS,G,6ECFb,SAASC,EAAexF,EAAKG,GAC1C,OCLa,SAAyBH,GACtC,GAAIK,MAAMoF,QAAQzF,GAAM,OAAOA,EDIxB,CAAeA,IELT,SAA+BA,EAAKG,GACjD,GAAsB,oBAAXuF,QAA4BA,OAAOC,YAAY/B,OAAO5D,GAAjE,CACA,IAAI4F,EAAO,GACPC,GAAK,EACLC,GAAK,EACLC,OAAKjE,EAET,IACE,IAAK,IAAiCkE,EAA7BC,EAAKjG,EAAI0F,OAAOC,cAAmBE,GAAMG,EAAKC,EAAGC,QAAQ9E,QAChEwE,EAAK3C,KAAK+C,EAAG9E,QAETf,GAAKyF,EAAK1F,SAAWC,GAH8C0F,GAAK,IAK9E,MAAOhE,GACPiE,GAAK,EACLC,EAAKlE,EACL,QACA,IACOgE,GAAsB,MAAhBI,EAAW,QAAWA,EAAW,SAC5C,QACA,GAAIH,EAAI,MAAMC,GAIlB,OAAOH,GFnBuB,CAAqB5F,EAAKG,KAAM,EAAAgG,EAAA,GAA2BnG,EAAKG,IGLjF,WACb,MAAM,IAAI+B,UAAU,6IHIgF,K,4BILvF,SAASkE,EAAuBC,EAASC,GAKtD,OAJKA,IACHA,EAAMD,EAAQE,MAAM,IAGf3C,OAAO4C,OAAO5C,OAAO6C,iBAAiBJ,EAAS,CACpDC,IAAK,CACHpF,MAAO0C,OAAO4C,OAAOF,O,sFCHZ,SAASI,EAAmB1G,GACzC,OCJa,SAA4BA,GACzC,GAAIK,MAAMoF,QAAQzF,GAAM,OAAO,EAAA2G,EAAA,GAAiB3G,GDGzC,CAAkBA,IELZ,SAA0B4G,GACvC,GAAsB,oBAAXlB,QAA0BA,OAAOC,YAAY/B,OAAOgD,GAAO,OAAOvG,MAAMwG,KAAKD,GFIvD,CAAgB5G,KAAQ,EAAAmG,EAAA,GAA2BnG,IGLvE,WACb,MAAM,IAAIkC,UAAU,wIHIwE,K,2BIL/E,SAAS4E,EAAQ5C,GAa9B,OATE4C,EADoB,mBAAXpB,QAAoD,iBAApBA,OAAOC,SACtC,SAAiBzB,GACzB,cAAcA,GAGN,SAAiBA,GACzB,OAAOA,GAAyB,mBAAXwB,QAAyBxB,EAAIkB,cAAgBM,QAAUxB,IAAQwB,OAAOjD,UAAY,gBAAkByB,IAI9GA,G,4ECZF,SAAS6C,EAA4BjC,EAAGkC,GACrD,GAAKlC,EAAL,CACA,GAAiB,iBAANA,EAAgB,OAAO,OAAiBA,EAAGkC,GACtD,IAAIC,EAAIrD,OAAOnB,UAAUyE,SAASvE,KAAKmC,GAAGyB,MAAM,GAAI,GAEpD,MADU,WAANU,GAAkBnC,EAAEM,cAAa6B,EAAInC,EAAEM,YAAY+B,MAC7C,QAANF,GAAqB,QAANA,EAAoB5G,MAAMwG,KAAK/B,GACxC,cAANmC,GAAqB,2CAA2CG,KAAKH,IAAW,OAAiBnC,EAAGkC,QAAxG,K,eCPFK,EAAOC,QAAU,EAAjB,O,ipCC6WMC,E,iFACF,SAAaC,GACT,OAAOC,KAAKC,KAAKjG,KAAA,IAAS+F,M,iCAG9B,SAA2BG,GACvBC,EAAaC,OAAO,sBAAuBF,GAAS,GAAOA,GAAS,KAEpE,IAEIG,GAFiB,IAARH,GAEIT,SAAS,IAAIa,cAE9B,OADAH,EAAaC,OAAO,iBAAgC,GAAdC,EAAI5H,QAA6B,GAAd4H,EAAI5H,QACxC,GAAd4H,EAAI5H,OAAc4H,EAAM,IAAMA,I,sBAGzC,SAAgBN,GAEZI,EAAaC,OAAO,cAAwB/F,MAAT0F,GAAsC1F,MAAhB0F,EAAMtH,QAC/D,IAHmB,EAIf8H,EAAO,GAJQ,IAKLR,GALK,IAKnB,2BAAqB,KAAZS,EAAY,QACFnG,MAAXkG,EAAKC,KACLD,EAAKC,GAAK,GAEdD,EAAKC,MATU,8BAanB,IADA,IAAIjF,EAAI,GACR,MAAcY,OAAOsE,KAAKF,GAA1B,eAAiC,CAA5B,IAAIG,EAAC,KACFC,EAAIJ,EAAKG,GAEbnF,EAAEC,KAAK,CAACkF,EAAGC,IAGf,OADAR,EAAaC,OAAO,aAAc7E,EAAE9C,OAAS,IACtCmI,kBAAarF,GAAG,SAAAiF,GAAC,OAAIA,EAAE,MAAI,SAAAA,GAAC,OAAIA,EAAE,Q,kBAI7C,SAAYK,EAAGC,GACX,OAAO9G,KAAK+G,IAAIF,EAAGC,IAAM9G,KAAKgH,MAAMH,GAAK7G,KAAKgH,MAAMF,M,yBAIxD,SAAmBD,EAAGC,GAClB,IAAIG,EAAQjH,KAAKkH,KAAKL,GAClBM,EAAQnH,KAAKkH,KAAKJ,GAItB,OAFU9G,KAAKoH,IAAIpH,KAAKqH,IAAIR,EAAGC,GAAGQ,KAAI,SAAAd,GAAC,OAAKA,EAAE,GAAKS,IAAUT,EAAE,GAAKW,OACxDnB,KAAKC,KAAKjG,KAAKoH,IAAIP,EAAES,KAAI,SAAAd,GAAC,OAAKA,EAAIS,IAAUT,EAAIS,OAAWjH,KAAKoH,IAAIN,EAAEQ,KAAI,SAAAC,GAAC,OAAKA,EAAIJ,IAAUI,EAAIJ,U,iBAInH,SAAWN,EAAGC,GAIV,IAHA,IAAItB,EAAIqB,EAAEpI,OAGDC,EAAI,EAAGA,EAAI8G,IAAK9G,EACrB,IAAK,IAAI8I,EAAI9I,EAAI,EAAG8I,EAAIhC,IAAKgC,EACdX,EAAEnI,GAAKmI,EAAEW,GAAOV,EAAEpI,GAAKoI,EAAEU,GAI5C,OAAOnB,KAAOb,EAAIA,K,iBAGtB,SAAWO,GACP,IAAImB,EAAOlH,KAAKkH,KAAKnB,GAErB,OADUA,EAAM0B,QAAO,SAAClG,EAAGmG,GAAJ,OAAUnG,EAAIyE,KAAK2B,IAAID,EAAIR,EAAM,KAAM,GACjDnB,EAAMtH,S,kBAGvB,SAAYsH,GACR,OAAoB,GAAhBA,EAAMtH,OACCuB,KAAKoH,IAAIrB,GAAUA,EAAMtH,OAGzB,I,oBAKf,SAAcsH,GACV,GAAoB,GAAhBA,EAAMtH,OAAa,CACnB,IAAImJ,EAAS7B,EAAMuB,KAAI,SAAAd,GAAC,OAAI,IAAIqB,OAAOrB,MACvCoB,EAAOE,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAImG,KAC1B,IAAIK,EAAQH,EAAOnJ,OAAS,EAExBuJ,EAAMJ,EADVG,EAAQ/B,KAAKiC,MAAMF,IAMnB,OAHAC,EAAM,IAAIH,OAAOG,GAEjB7B,EAAaC,OAAO,YAAa4B,aAAeH,QACzCG,EAGP,OAAO,I,iBAIf,SAAWjC,GAEP,OADAI,EAAaC,OAAO,cAAwB/F,MAAT0F,GAA+B,MAATA,GAClDA,EAAM0B,QAAO,SAAClG,EAAGmG,GAAJ,OAAUG,OAAOtG,GAAKsG,OAAOH,KAAI,K,sBAEzD,SAAgBQ,GACZ,IAD6B,EACzBpF,EAAO,KADkB,IAEhBoF,GAFgB,IAE7B,2BAA8B,KAAtB1B,EAAsB,QAC1B,GAAY,MAAR1D,EACAA,EAAO0D,OAGP,IAAI,IAAI9H,EAAI,EAAGA,EAAIoE,EAAKrE,SAAUC,EAC9BoE,EAAKpE,GAAKoE,EAAKpE,GAAK8H,EAAE9H,IARL,8BAY7B,OAAOoE,I,mBAMX,SAAaiD,GACT,GAAIA,GAAS,GAAI,MAAO,GAMxB,IAJA,IAAIiC,EAAM,GACNG,EAAYpC,EAAMtH,OAClB2J,EAAYrC,EAAM,GAAGtH,OAEhBC,EAAI,EAAGA,EAAI0J,IAAa1J,EAAG,CAEhC,IADA,IAAI2H,EAAM,GACDmB,EAAI,EAAGA,EAAIW,IAAaX,EAC7BnB,EAAI7E,KAAKuE,EAAMyB,GAAG9I,IAEtBsJ,EAAIxG,KAAK6E,GAEb,OAAO2B,I,iBAGX,SAAWnB,EAAGC,GAEV,IADA,IAAIkB,EAAM,GACDtJ,EAAI,EAAGA,EAAImI,EAAEpI,SAAUC,EAC5BsJ,EAAIxG,KAAK,CAACqF,EAAEnI,GAAIoI,EAAEpI,KAEtB,OAAOsJ,I,oBAGX,SAAcjC,GACV,OAAOA,EAAMsC,QAAO,SAAC7B,EAAGuB,EAAOxG,GAAX,OAAiBA,EAAE+G,QAAQ9B,IAAMuB,S,KAIvD5B,E,kGAEF,SAAoBoC,EAAUC,GAAgC,IAArBC,EAAqB,4DAAXpI,EAC/C8F,EAAaC,OAAO,mBAAoBsC,MAAMF,IAA2B,GAAbA,GAAiCnI,MAAbmI,GAChF,IAAIR,EAAM,QACO3H,IAAdoI,IAAyBA,EAAY,SAAAjC,GAAC,OAAIA,IAC7C,IAAI,IAAI9H,EAAI,EAAGA,EAAI6J,EAAS9J,OAAQC,GAAK8J,EAAW,CAChD,IAAInC,EAAMkC,EAASzD,MAAMpG,EAAGA,EAAI8J,GAChCR,EAAIxG,KAAKiH,EAAUpC,IAEvB,OAAO2B,I,kCAGX,SAA4BW,GAExB,IAAMC,EAAS,CAAC,IAAS,IAAU,IAAU,IAAU,IAAU,IAAU,IAAU,IAAU,IAAU,KACrGC,EAAS,GAEA,IAJbF,EAAS,IAAId,OAAOc,MAKhBE,EAASD,EAAO,IAKpB,IAAI,IAAIlK,EAAIoK,SAASH,EAAOI,QAAQ,IAAKrK,EAAI,EAAGA,KAAOA,EAAI,IAIvDmK,EAFQD,EADI5C,KAAKgD,MAAMtK,GAAK,IAGfmK,EAEjB,OAAOA,I,gCAGX,SAA0BF,GAEtB,IAAMC,EAAS,CAAC,IAAS,IAAU,IAAU,IAAU,IAAU,IAAU,IAAU,IAAU,IAAU,KACrGC,EAAS,GAEA,IAJbF,EAAS,IAAId,OAAOc,MAKhBE,EAASD,EAAO,IAGpB,IAAI,IAAIlK,EAAIoK,SAASH,EAAOI,QAAQ,IAAKrK,EAAI,EAAGA,KAAOA,EAAI,IAIvDmK,EAFQD,EADI5C,KAAKgD,MAAMtK,GAAK,IAGfmK,EAEjB,OAAOA,I,mCAIX,SAA6BpJ,GAA6C,IAAtCwJ,EAAsC,uDAAjC,aAAcC,EAAmB,uDAAd,GAAIC,EAAU,uDAAH,EAInE1J,EAAQ,IAAIoI,OAAOpI,GACnB,IAAI2J,EAAM,EACNC,EAAgB,CAChBC,EAAG,GACHC,EAAG,KACHC,EAAG,KACHC,EAAG,KACHC,EAAG,KACHC,EAAG,MAUH3B,EAAM,GACV,GAAW,cAARiB,EAAsB,CAErB,KAAMxJ,GAAS,MACXA,GAAgB,OACd2J,EAENpB,EAAMvI,EAAMsJ,QAAQI,EAAS,GAE7BnB,GAAO,IAAMqB,EAAcD,GAAOF,OAEjC,GAAW,cAARD,EAAsB,CAE1B,KAAMxJ,GAAS,IACXA,GAAS,KACP2J,EAENpB,EAAMvI,EAAMsJ,QAAQI,EAAS,GAChBC,EAAI3D,WAKjBuC,GAAO,QAHE7B,EAAayD,qBAAqBR,QAK1C,GAAW,YAARH,EAAoB,CAQxB,IAJA,IAAMY,EAAS,KAEXC,EAAY,IAAIjC,OAAOpI,GACvBsK,EAAc,EACZ/D,KAAKgE,IAAIhE,KAAKgD,MAAMc,GAAaA,GAAaD,GAEhDC,GAAa,GACbC,GAAe,GAGnB,IAAIE,EAAM,SAAC1I,EAAGmG,GAGV,GAFAnG,EAAIyE,KAAKgE,IAAIhE,KAAKgD,MAAMzH,KACxBmG,EAAI1B,KAAKgE,IAAIhE,KAAKgD,MAAMtB,KAChBnG,EAAG,CAAC,IAAI2I,EAAO3I,EAAGA,EAAImG,EAAGA,EAAIwC,EACrC,KAAO3I,GAAK,GAAKmG,GAAK,GAAG,CACrB,GAAS,GAALA,EAAQ,OAAOnG,EAEnB,GAAS,IADTA,GAAKmG,GACO,OAAOA,EACnBA,GAAKnG,EAET,OAAO,GAGP4I,EAAUF,EAAIH,EAAWC,GAC7BD,GAAaK,EACbJ,GAAeI,EAGf,IAAIC,EAAUjE,EAAayD,qBAAqBE,EAAUrE,YACtD4E,EAAQlE,EAAamE,mBAAmBP,EAAYtE,YAExDuC,EAAMoC,EAAU,IAAMC,OAItBlE,EAAaC,OAAO,gBAAgB,GAIxC,OAAO4B,I,mCAIX,SAA6BvF,EAAKnD,EAAKiL,GACnC,KAAUlK,MAAPoC,GAA2B,MAAPA,GAAeA,aAAe+H,QAAwB,iBAAP/H,GAGtE,GAAGA,aAAe7D,MAAlB,CAAyB,UACR6D,GADQ,IACrB,2BAAkB,KAAV+D,EAAU,QACdL,EAAasE,sBAAsBjE,EAAGlH,EAAKiL,IAF1B,mCAAzB,CAMA,IAAI9D,EAAON,EAAauE,SAASjI,GACjC,GAAWpC,MAARoG,EAAH,CAXyC,UAc5BA,GAd4B,IAczC,2BAAmB,KAAXC,EAAW,QACZA,GAAKpH,EACJmD,EAAIiE,GAAK6D,EAAK9H,EAAIiE,IAGlBP,EAAasE,sBAAsBhI,EAAIiE,GAAIpH,EAAKiL,IAnBf,mC,mDAwB7C,WAA8B9H,GAA9B,0EACoBpC,MAAZoC,EAAI5C,KADZ,gCAEsB4C,EAFtB,cAEY+D,EAFZ,yBAGeA,GAHf,gCAMe/D,GANf,2C,qGAYA,WAAkCA,GAAlC,0EACoBpC,MAAZoC,EAAI5C,KADZ,gCAEsB4C,EAFtB,cAEY+D,EAFZ,gBAGqBL,EAAawE,qBAAqBnE,GAHvD,wEAMe/D,GANf,4C,0FAWA,WAAuBmI,GAAvB,uEACYlM,EAAI,EADhB,YACmBA,EAAIkM,EAAUnM,QADjC,gCAE6B0H,EAAa0E,iBAAiBD,EAAUlM,IAFrE,OAEQkM,EAAUlM,GAFlB,gBAC2CA,EAD3C,+CAIWkM,GAJX,2C,uEAOA,SAAmBE,EAAMnM,GAGrB,GAFAqB,KAAKoG,OAAO,aAAc0E,aAAgBlM,OAC1CoB,KAAKoG,OAAO,aAAczH,aAAgBC,OACvCkM,EAAKrM,QAAUE,EAAKF,OACnB,OAAO,EAGX,IAAI,IAAIC,EAAI,EAAGA,EAAIoM,EAAKrM,SAAUC,EAC9B,GAAGoM,EAAKpM,IAAMC,EAAKD,GACf,OAAO,EAGf,OAAO,I,sBAGX,SAAgB+D,GAEZ,IADA,IAAIuF,EAAM,GACV,MAAc7F,OAAOsE,KAAKhE,GAA1B,eAAgC,CAA3B,IAAIiE,EAAC,KACNsB,EAAIxG,KAAKkF,GAGb,OAAOsB,I,mBAMX,SAAaO,GAA4B,IAAlBwC,EAAkB,uDAAJ,GAGjC,GAAsB,GAAnBxC,EAAS9J,OAAa,MAAO,GAEhC,IALqC,EAKjCgI,EAAOzG,KAAK0K,SAASnC,EAAS,IAE9BP,EAAM,GAP2B,IASxBvB,GATwB,IASrC,2BAAmB,KAAXC,EAAW,QACfsB,EAAItB,QAAKrG,GAVwB,wCAYxBkI,GAZwB,IAYrC,2BAAuB,OAAf/B,EAAe,YACNC,GADM,IACnB,2BAAmB,KAAXC,EAAW,QACXC,EAAIH,EAAEE,GACV,GAAGC,aAAa/H,MAAO,OACNyB,MAAV2H,EAAItB,KACHsB,EAAItB,GAAK,KAEb,EAAAsB,EAAItB,IAAGlF,KAAP,gBAAemF,QAEd,CAID,GAHatG,MAAV2H,EAAItB,KACHsB,EAAItB,GAAKC,GAEVqB,EAAItB,IAAMC,IACTqE,QAAQC,IAAI,8BAAgCvE,EAAI,KAAOsB,EAAItB,GAAK,OAASC,GACpDtG,MAAlB0K,EAAYrE,IAAiB,CAC5BsB,EAAItB,GAAKqE,EAAYrE,GAAGsB,EAAItB,GAAIC,GAChC,SAGR3G,KAAKoG,OAAO,wBAAyB4B,EAAItB,IAAMC,KApBpC,gCAZc,8BAoCrC,OAAOqB,I,4BAIX,SAAsBkD,EAAIC,GAAmB,IAAfC,EAAe,uDAAJ,GACrC,GAAS,MAANF,GAAoB7K,MAAN6K,EAAiB,OAAOC,EACzC,GAAS,MAANA,GAAoB9K,MAAN8K,EAAiB,OAAOD,EACzC,GAAgB,iBAANA,EAAgB,OAAOA,EACjC,IAAkB,gBAANA,GAAmBA,aAActM,SAA0B,gBAANuM,GAAmBA,aAAcvM,OAC9F,OAAGuM,EAAGE,OAAM,SAAA7E,GAAC,OAAI0E,EAAGI,SAAS9E,MAElB0E,EAEX,kBAAWA,IAAX,OAAkBC,IAGtB,IAZyC,EAYrCnD,EAAMkD,EACNzE,EAAON,EAAauE,SAASS,GAbQ,IAe5B1E,GAf4B,IAezC,2BAAmB,KAAXC,EAAW,QACXC,EAAIwE,EAAGzE,GAEX,GAAkBrG,MAAf+K,EAAS1E,GAAZ,CAMA,IAAI6E,EAAQvD,EAAItB,GAGZsB,EAAItB,GAFIrG,MAATkL,EAEU5E,EAGAR,EAAaqF,eAAexD,EAAItB,GAAIC,OAZjD,CACI,IAAI8E,EAAWL,EAAS1E,GACxBsB,EAAItB,GAAK+E,EAASzD,EAAItB,GAAIC,EAAGyE,KApBI,8BAiCzC,OAAOpD,I,qBAIX,SAAeO,GACX,MAAO,GAAGmD,OAAOvL,MAAM,GAAIoI,K,uBAG/B,SAAiBoD,EAAOlJ,GAKpB,OAJUpC,MAAPoC,IACCA,EAAMkJ,EACNA,EAAQ,UAELX,QAAQC,IAAIU,EAAQ,KAAOC,KAAKC,UAAUpJ,M,qBAKrD,SAAe8F,EAAUgC,GAErB,IAF2B,EAEvBvC,EAAM,GAFiB,IAIdO,GAJc,IAI3B,2BAAuB,KAAf/B,EAAe,QACnBL,EAAaC,OAAO,yBAAiC/F,IAAZkK,EAAK/D,IAC3CL,EAAauE,SAAS1C,GAAKsD,SAASf,EAAK/D,IACxCwB,EAAIuC,EAAK/D,IAAIhF,KAAKgF,GAGlBwB,EAAIuC,EAAK/D,IAAM,CAACA,IAVG,8BAc3B,OAAOrE,OAAO2J,OAAO9D,K,oBAGzB,SAActC,EAAMqG,GAChB,IAAIA,EAIA,MAHAf,QAAQC,IAAI,cAAiBvF,EAAO,YACpCsF,QAAQgB,QACRC,OAAOC,MAAM,mCACP,IAAIC,Q,gCAIlB,SAA0B1J,GACtB,IACU2J,EAYV,OAAOR,KAAKC,UAAUpJ,GAZZ2J,EAAO,IAAIC,QACV,SAAC/M,EAAKG,GACT,GAAqB,YAAjB,OAAOA,IAAgC,OAAVA,EAAgB,CAC7C,GAAI2M,EAAKE,IAAI7M,GACT,OAEJ2M,EAAKG,IAAI9M,GAEb,OAAOA,S,w9GC/1BvB,SAAS+M,yBAAyBC,GAA+B,IAAvBxD,EAAuB,uDAAlB,iBAEvCyD,GADeD,EAAO9I,YAAY+B,KAC9BiH,SAASC,cAAc,WAC3BC,EAAMH,EAAEI,WAAW,MAEvBJ,EAAEK,MAAQN,EAAOO,iBAAiBC,YAClCP,EAAEQ,OAAST,EAAOO,iBAAiBG,aAGnC,IAAIC,GAAU,mEAAIX,EAAO9I,YAAd,CAA0BkJ,GAA1B,mFAAmCJ,EAAOY,cAErDD,EAAQE,uBAAyB,OACjCF,EAAQG,gBAAiB,EAEzBH,EAAQI,eACR,IAAI9F,EAAI,IAAI+F,QAAQZ,GAEpBnF,EAAEgG,sBAEFhG,EAAEiG,UAAUP,GAEZ1F,EAAEkG,OAAO,IAAIC,KAAK,GAAI,GAAI,IAAIA,IAAI,EAAG,GAAI,EAAG,GAAG,GAG/C,IAAIC,EAASpB,EAAEqB,UAAU,cAEzB,MAAY,mBAAT9E,EACQyD,EAEJoB,EAGX,SAASE,oBAAoBC,GAAqB,IAAXC,EAAW,uDAAJ,GAYtCxB,EAAIC,SAASC,cAAc,UAE3BC,EAAMH,EAAEI,WAAW,MAEjBqB,EAAU,IACVC,EAAU,IACZC,EAAO,EACPC,EAAU,EAGd5B,EAAEQ,OAAS/K,OAAOoM,QAAQN,GAAUxP,OAAS2P,EAG7C,IAAI/H,EAAMlE,OAAOoM,QAAQN,GAAU,GAAG,GACtCvB,EAAEK,OAAS,EAAI1G,EAAImI,QAAQ/P,QAAU0P,EAIrCtB,EAAI4B,OACJ5B,EAAI6B,UAAY,QAChB7B,EAAI8B,SAAS,EAAG,EAAGjC,EAAEK,MAAOL,EAAEQ,QAC9BL,EAAI+B,UAEJ,cAAyBzM,OAAOoM,QAAQN,GAAxC,eAAmD,CAA/C,IAAIY,EAAa,KAEbvP,EAAMuP,EAAc,GACpBC,EAAUD,EAAc,GAE5BhC,EAAI4B,OAEJ5B,EAAIkC,aAAe,SACnBlC,EAAImC,UAAY,SAEhBnC,EAAIoC,KAAO,aAEX,IAAIC,EAAa,IAAIrH,OAAOvI,GACxB6P,EAAWD,GAAc,GAAM,MAC/BE,EAAwB,MAAdF,EAEdrC,EAAIwC,SAAS,iBAAmBF,EAAQ1J,WAAa,IAAM2J,EAAO3J,WAAY0I,EAAU,EAAKE,EAAOD,EAAU,GAE9GvB,EAAI+B,UAEJ,IApB+C,EAoB3CU,EAAOnB,EApBoC,6BAqB7BW,EAAQN,SArBqB,IAqB/C,2BAAmC,KAA3B/B,EAA2B,QAG3B8C,EAAa/C,yBAAyBC,GAE1CI,EAAI2C,UAAUD,EAAYD,EAAMjB,GAEhCiB,GAAQnB,GA5BmC,8BA8B/CG,EAAUtI,KAAKyJ,IAAInB,EAASgB,GAE5BjB,GAAQD,EACRkB,EAAO,EAGX,IAAIxB,EAASpB,EAAEqB,UAAU,cAErB2B,EAAI/C,SAASC,cAAc,KAC/B8C,EAAEC,aAAa,OAAQ7B,GACvB4B,EAAEC,aAAa,WAAYzB,EAAS,eAEpCwB,EAAEE,MAAMC,QAAU,OAClBlD,SAASmD,KAAKC,YAAYL,GAE1BA,EAAEM,QAEFrD,SAASmD,KAAKG,YAAYP,GAI9B,SAASQ,SAASnK,EAAOwE,GACTlK,MAAT0F,GACCiF,QAAQgB,MAAM,uBAElB7F,sDAAoB,qBAAsBJ,EAAMtH,OAAS,GACzD,IAL2B,EAMvB0R,EAAU5F,EAAKxE,EAAM,IANE,6BAOdA,GAPc,IAO3B,2BAAoB,KAAZS,EAAY,QACZ4J,EAAI7F,EAAK/D,GACV4J,EAAID,IACHA,EAAUC,IAVS,8BAe3B,OAAOD,EAGX,SAASvJ,aAAab,EAAOwE,EAAM8F,GAC/B,GAAmB,GAAhBtK,EAAMtH,OACL,OAAO,KAEX,IAJwC,EAIpC6R,EAAUD,EAAQtK,EAAM,IACxBoK,EAAU5F,EAAKxE,EAAM,IALe,6BAM3BA,GAN2B,IAMxC,2BAAoB,KAAZS,EAAY,QACZ4J,EAAI7F,EAAK/D,GACV4J,EAAID,IACHA,EAAUC,EACVE,EAAUD,EAAQ7J,KAVc,8BAcxC,OAAO8J,EAGX,SAASC,SAASxK,EAAOwE,GACrB,IAD2B,EAEvBiG,EAAUjG,EAAKxE,EAAM,IAFE,6BAGdA,GAHc,IAG3B,2BAAoB,KAAZS,EAAY,QACZ4J,EAAI7F,EAAK/D,GACV4J,EAAII,IACHA,EAAUJ,IANS,8BAW3B,OAAOI,E,IAGL3C,I,WACF,WAAYrH,EAAGe,IAAG,gFACdvH,KAAKwG,EAAIA,EACTxG,KAAKuH,EAAIA,E,qGAGb,WACI,MAAO,IAAMvH,KAAKwG,EAAI,KAAOxG,KAAKuH,EAAI,M,mBAG1C,SAAMkJ,GACF,OAAO,IAAI5C,EAAI7N,KAAKwG,EAAIiK,EAAMjK,EAAGxG,KAAKuH,EAAIkJ,EAAMlJ,K,kBAEpD,SAAKkJ,GACD,OAAO,IAAI5C,EAAI7N,KAAKwG,EAAIiK,EAAMjK,EAAGxG,KAAKuH,EAAIkJ,EAAMlJ,K,mBAEpD,SAAMkJ,GACF,OAAO,IAAI5C,EAAI7N,KAAKwG,EAAIiK,EAAMjK,EAAGxG,KAAKuH,EAAIkJ,EAAMlJ,K,sBAGpD,SAASmJ,GACL,OAAO,IAAI7C,EAAI7N,KAAKwG,EAAIkK,EAAK1Q,KAAKuH,EAAImJ,K,kBAG1C,WACI,OAAO1K,KAAKC,KAAKjG,KAAKwG,EAAIxG,KAAKwG,EAAIxG,KAAKuH,EAAIvH,KAAKuH,K,oBAGrD,SAAOoJ,EAASC,GACZ,QAAI5Q,KAAKwG,EAAImK,EAAQnK,GAAKxG,KAAKuH,EAAIoJ,EAAQpJ,GACvCvH,KAAKwG,EAAIoK,EAAYpK,GAAKxG,KAAKuH,EAAIqJ,EAAYrJ,O,KAMrDsJ,U,WAEF,cAAc,gFAEV7Q,KAAK8Q,SAAWlS,QAEhBoB,KAAK+Q,aAAe,WAAc,OAAO,GACzC/Q,KAAKgR,aAAe,WAAc,OAAO,GACzChR,KAAKiR,QAAU,WAAc,OAAO,GACpCjR,KAAKkR,cAAgB,WAAc,OAAO,GAC1ClR,KAAKmR,YAAc,WAAc,OAAO,GAGxCnR,KAAKoR,gBAAkB,cAEvBpR,KAAKqR,YAAc,kBAAM,G,oGAG7B,WACIrR,KAAK8Q,SAAW,K,sBAGpB,SAASQ,GACLtR,KAAK8Q,SAAStP,KAAK8P,K,yBAGvB,SAAYA,GACRtR,KAAK8Q,SAASS,QAAQD,K,2BAG1B,SAAc/G,GACVvK,KAAKqR,YAAc9G,I,iCAGvB,SAAoBiH,EAAUC,GAC1B,IAAIzR,KAAKqR,cAAe,OAAO,EAC/B,GAAGrR,KAAK0R,UAAUF,IACXxR,KAAKkR,gBACJ,OAAO,EAJe,mCAUjBlR,KAAK8Q,UAVY,IAU9B,2BACI,GADwB,QACnBa,oBAAoBH,EAAUC,GAC/B,OAAO,EAZe,8BAe9B,OAAO,I,2BAGX,SAAcD,EAAUC,GACpB,IAAIzR,KAAKqR,cAAe,OAAO,EAC/B,GAAGrR,KAAK0R,UAAUF,IACXxR,KAAKiR,UACJ,OAAO,EAJS,mCAUXjR,KAAK8Q,UAVM,IAUxB,2BACI,GADwB,QACnBc,cAAcJ,EAAUC,GACzB,OAAO,EAZS,8BAexB,OAAO,I,0BAGX,SAAaD,GACT,IAAIxR,KAAKqR,cAAe,OAAO,EAC/B,GAAIrR,KAAK0R,UAAUF,IAEf,GADAxR,KAAKmR,YAAYK,GACW,eAAxBxR,KAAKoR,kBACLpR,KAAKoR,gBAAkB,UACnBpR,KAAK+Q,aAAaS,IAClB,OAAO,OAKf,GAA4B,WAAxBxR,KAAKoR,kBACLpR,KAAKoR,gBAAkB,cACnBpR,KAAKgR,gBACL,OAAO,EAfA,mCAoBLhR,KAAK8Q,UApBA,IAoBnB,2BACI,GADyB,QACnBe,aAAaL,GACf,OAAO,EAtBI,8BA0BnB,OAAO,I,uBAGX,SAAUM,GAGN,OADA9G,QAAQC,IAAI,yCACL,I,6BAGX,SAAgBV,GACZvK,KAAK+Q,aAAexG,I,6BAGxB,SAAgBA,GACZvK,KAAKgR,aAAezG,I,wBAGxB,SAAWA,GACPvK,KAAKiR,QAAU1G,I,8BAGnB,SAAiBA,GACbvK,KAAKkR,cAAgB3G,I,4BAGzB,SAAeA,GACXvK,KAAKmR,YAAc5G,M,KAKrBwH,U,0GACF,WAAYlF,EAAKrG,EAAGe,EAAGwF,EAAOG,GAAQ,8FAClC,gBAEKL,IAAMA,EACX,EAAK8D,QAAU,IAAI9C,IAAIrH,EAAGe,GAC1B,EAAK0F,YAAcF,EACnB,EAAKI,aAAeD,EACpB,EAAK8E,WAAa,EAElB,EAAKC,uBAAyB,GAE9B,EAAKC,sBAAuB,EAE5B,EAAKC,OAAS,KAEd,EAAKC,iBAAmB,QAfU,E,sGAkBtC,SAAUD,GAEN,OADAnS,KAAKmS,OAASA,EACPnS,O,mBAGX,WACI,OAAOA,KAAKiN,YAAcjN,KAAKgS,WAAa,M,oBAGhD,WACI,OAAOhS,KAAKmN,aAAenN,KAAKgS,WAAa,M,kBAGjD,SAAKrB,EAAS0B,GAA4B,IAArBC,EAAqB,uDAAN,KAEjB,MAAX3B,IACA3Q,KAAK2Q,QAAUA,GAEnB,IAAI9D,EAAM7M,KAAK6M,IACZyF,IACCzF,EAAMyF,GAGVzF,EAAI4B,OAEJ5B,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAI4F,UAAY,EAChB,IAAIC,EAAU7F,EAAI6B,UAClB7B,EAAI6B,UAAY1O,KAAKoS,iBACrBvF,EAAI8F,KAAK3S,KAAK2Q,QAAQnK,EAAGxG,KAAK2Q,QAAQpJ,EAAGvH,KAAK+M,QAAS/M,KAAKkN,UAC5DL,EAAI+F,OACJ/F,EAAIgG,SACJhG,EAAI6B,UAAYgE,EAEH,QAATL,GACArS,KAAKgS,YAAchS,KAAKiS,uBACpBjS,KAAKgS,WAAa,MAClBhS,KAAKgS,WAAa,MACN,aAATK,IACPrS,KAAKgS,YAAchS,KAAKiS,uBACpBjS,KAAKgS,WAAa,IAClBhS,KAAKgS,WAAa,IAGR,MAAfhS,KAAKmS,QACkB,GAAnBnS,KAAKgS,YACJhS,KAAKmS,OAAOW,KAAKjG,GAGzBA,EAAI+B,Y,uBAGR,SAAUkD,GACN,IAAIiB,EAAYjB,EAAIkB,MAAMhT,KAAK2Q,SAE/B,QAAIoC,EAAUvM,EAAI,GAAKuM,EAAUxL,EAAI,GACjCwL,EAAUvM,EAAIxG,KAAK+M,SAAW/M,KAAKkN,c,GA5EvB2D,WAmFlBoC,O,0GACF,WAAYpG,GAAK,8FACb,gBACKA,IAAMA,EACX,EAAKwF,MAAQ,EACb,EAAKa,OAAS,EAEd,EAAKC,MAAQ,SACb,EAAK7F,uBAAyB,YAC9B,EAAKN,iBAAmB,IAAI+E,UAAUlF,EAAK,EAAG,EAAG,IAAK,KACtD,EAAKuG,SAAS,EAAKpG,kBACnB,EAAKO,gBAAiB,EAEtB,EAAKoD,QAAU,IAAI9C,IAAI,EAAE,GACzB,EAAKwF,KAAO,IAAIxF,IAAI,EAAE,GAEtB,EAAKyF,aAAe,KAfP,E,+GAkBjB,WAAqB,WACjBtT,KAAKuT,kBAAiB,SAAAzP,GAClB,IAAI0P,EAAS,IAAIC,6CAAYxH,QAW7B,OAVAuH,EAAOE,cAAc,CACjBC,UAAW,EAAKhQ,YAAY+B,KAC5BkO,WAAY,EAAKvG,aAERmG,EAAOK,KAAK,8BAA+B,YAEpD7I,QAAQC,IAAI,4BACZiB,MAAM,8BAGH,O,0BAKf,WACIlM,KAAKsN,uBAAyB,OAC9BtN,KAAKgN,iBAAiBgF,WAAa,IACnChS,KAAKuN,gBAAiB,I,4BAI1B,SAAeuG,GAA0B,WAAhBC,EAAgB,uDAAL,IAChC,GAAe1T,MAAZyT,EACC,OAAO9T,KAGXA,KAAKsT,aAAe,IAAIU,MACxBhU,KAAKsT,aAAaW,IAAMH,EAGxB9T,KAAKsT,aAAaY,OAAS,WAEvB,IAAIxH,EAAIC,SAASC,cAAc,UAC3BC,EAAMH,EAAEI,WAAW,MAEvBJ,EAAEK,MAAQgH,EACVrH,EAAEQ,OAAS6G,EAEXlH,EAAI2C,UAAU,EAAK8D,aAAc,EAAG,EAAGS,EAAUA,GAGjD,EAAKT,aAAaW,IAAMvH,EAAEqB,e,uBAIlC,SAAU+D,GACN,IAAIiB,EAAYjB,EAAIkB,MAAMhT,KAAK2Q,SAE/B,QAAIoC,EAAUvM,EAAI,GAAKuM,EAAUxL,EAAI,GACjCwL,EAAUvM,EAAIxG,KAAKqT,KAAK7M,GAAKuM,EAAUxL,EAAIvH,KAAKqT,KAAK9L,K,kBAI7D,SAAKoJ,EAAS0C,GACVrT,KAAKkT,SACL,IAAIiB,EAAM,IAAIC,KACVvH,EAAM7M,KAAK6M,IAWf,GATA7M,KAAK2Q,QAAUA,EACf3Q,KAAKqT,KAAOA,EAGZrT,KAAKgN,iBAAiB8F,KAAKnC,EAAS3Q,KAAKsN,wBACzCT,EAAI4B,OAEJ5B,EAAI0F,YAEoB,MAArBvS,KAAKsT,aAAsB,CAC1B,GAAkB,GAAdtT,KAAKqS,MAAY,CAEjB,IAAIgC,EAAQ,EAAIrO,KAAKsO,GAAK,IACtBC,EAAMlB,EAAK7M,EAAI,EACfgO,EAAML,EAAIM,kBACVC,EAAO1O,KAAK2O,IAAIN,EAAQG,GAAOD,EAC/BK,EAAO5O,KAAK6O,IAAIR,EAAQG,GAAOD,EAG/BO,EAAOjI,EAAIkI,qBAAqBpE,EAAQnK,EAAI+N,EAAMG,EAAM/D,EAAQpJ,EAAIgN,EAAMK,EAAMjE,EAAQnK,EAAI+N,EAAMG,EAAM/D,EAAQpJ,EAAIgN,EAAMK,GAC9HE,EAAKE,aAAa,EAAGhV,KAAKmT,OAC1B2B,EAAKE,aAAa,EAAG,SACrBnI,EAAI6B,UAAYoG,EAIpBjI,EAAI2F,YAAc,UAClB3F,EAAI4F,UAAY,EAChB5F,EAAI8F,KAAKhC,EAAQnK,EAAGmK,EAAQpJ,EAAG8L,EAAK7M,EAAG6M,EAAK9L,GAC5CsF,EAAIgG,SACc,GAAd7S,KAAKqS,OACLxF,EAAI+F,YAIR/F,EAAI2C,UAAUxP,KAAKsT,aAAc3C,EAAQnK,EAAGmK,EAAQpJ,EAAG8L,EAAK7M,EAAG6M,EAAK9L,GACpEsF,EAAI2F,YAAc,UAClB3F,EAAI4F,UAAY,EAChB5F,EAAI8F,KAAKhC,EAAQnK,EAAGmK,EAAQpJ,EAAG8L,EAAK7M,EAAG6M,EAAK9L,GAC5CsF,EAAIgG,SAGRhG,EAAI+B,UAEJ+B,EAAU,KACV0C,EAAO,KACPc,EAAM,S,GA/HOtD,WAuIfoE,O,WACF,WAAYC,GAAW,4FACnBlV,KAAKmV,OAASD,EACdlV,KAAKoV,QAAU,GACfpV,KAAKqV,YAAc,KACnB,IAAIC,EAAQtV,KACZA,KAAKuV,kBAAoB,gVACrB,SAAUzD,GACN,cAAa3P,OAAOsE,KAAK6O,EAAMF,SAA/B,eAAyC,CAArC,IAAI5O,EAAC,KACDgP,EAAMF,EAAMF,QAAQ5O,GACpBiP,EAAW,IAAI5H,IAAIyH,EAAMH,OAAOpI,QAAUyI,EAAInC,KAAK7M,EAAI,IAAO8O,EAAMH,OAAOjI,SAAWsI,EAAInC,KAAK9L,EAAI,KACnGmO,EAAcJ,EAAMH,OAAOxE,QAAQgF,KAAKH,EAAI7E,QAAQiF,MAAM,IAAI/H,IAAIyH,EAAMH,OAAOpI,QAAU,IAAOuI,EAAMH,OAAOjI,SAAW,OAI5H,GAFawI,EAAYlP,EAAIsL,EAAItL,GAAKsL,EAAItL,EAAKkP,EAAYlP,EAAIiP,EAASjP,GAAMkP,EAAYnO,EAAIuK,EAAIvK,GAAKuK,EAAIvK,EAAKmO,EAAYnO,EAAIkO,EAASlO,EAKrI,OAFAvH,KAAK6V,aAAerP,EACpBxG,KAAK8V,WAAahE,GACX,EAIf,cADO9R,KAAK6V,cACL,MAhBU,EAAI,CAAchF,YAoB3C7Q,KAAKuV,kBAAkBQ,YAAW,WAC9B,IAAIlU,EAAS,EAAK0T,kBAAkBM,aAChCL,EAAM,EAAKJ,QAAQvT,GAEnB4T,EAAW,IAAI5H,IAAI,EAAKsH,OAAOpI,QAAUyI,EAAInC,KAAK7M,EAAI,IAAO,EAAK2O,OAAOjI,SAAWsI,EAAInC,KAAK9L,EAAI,KACjGmO,EAAc,EAAKP,OAAOxE,QAAQgF,KAAKH,EAAI7E,QAAQiF,MAAM,IAAI/H,IAAI,EAAKsH,OAAOpI,QAAU,IAAO,EAAKoI,OAAOjI,SAAW,OAErH4E,EAAM,EAAKyD,kBAAkBO,WAIzBE,EAAK,EAAKC,mBAAmBpU,GACjC,GAAgC,MAA7BmU,EAAGE,wBACCF,EAAGE,uBAAuB1P,EAAIsL,EAAItL,GAAKwP,EAAGE,uBAAuB3O,EAAIuK,EAAIvK,GACrEyO,EAAGE,uBAAuB1P,EAAIwP,EAAGG,wBAAwB3P,EAAIsL,EAAItL,GAAKwP,EAAGE,uBAAuB3O,EAAIyO,EAAGG,wBAAwB5O,EAAIuK,EAAIvK,EAGtI,OAFAyD,QAAQC,IAAI,+BACZ+K,EAAGI,yBACI,EAMvB,IAAIC,EAAOX,EAAYlP,EAAIiP,EAASjP,EAAI,GACpC8P,EAAQZ,EAAYlP,EAAIiP,EAASjP,EACjC+P,EAAMb,EAAYnO,EAClBiP,EAASd,EAAYnO,EAAI,GAC7B,SAAGiO,EAAIiB,cACAJ,EAAOvE,EAAItL,GAAKsL,EAAItL,EAAI8P,GAASC,EAAMzE,EAAIvK,GAAKuK,EAAIvK,EAAIiP,KAEvDhB,EAAIkB,oBAAsBlB,EAAIkB,mBAAqB,GAAKlB,EAAImB,UAAUlY,QAC/D,MAWnBuB,KAAKuV,kBAAkBqB,gBAAe,SAAC9E,GAGnC,IAAIjQ,EAAS,EAAK0T,kBAAkBM,aACpC,GAAGhU,EAGC,OAFU,EAAKoU,mBAAmBpU,GAC9BgV,YAAY/E,IACT,KAMf9R,KAAKuV,kBAAkBhC,kBAAiB,WACpC,IAAI1R,EAAS,EAAK0T,kBAAkBM,aAChCL,EAAM,EAAKJ,QAAQvT,GAEnB4T,EAAW,IAAI5H,IAAI,EAAKsH,OAAOpI,QAAUyI,EAAInC,KAAK7M,EAAI,IAAO,EAAK2O,OAAOjI,SAAWsI,EAAInC,KAAK9L,EAAI,KACjGmO,EAAc,EAAKP,OAAOxE,QAAQgF,KAAKH,EAAI7E,QAAQiF,MAAM,IAAI/H,IAAI,EAAKsH,OAAOpI,QAAU,IAAO,EAAKoI,OAAOjI,SAAW,OAErH4E,EAAM,EAAKyD,kBAAkBO,WAE7BO,EAAOX,EAAYlP,EAAIiP,EAASjP,EAAI,GACpC8P,EAAQZ,EAAYlP,EAAIiP,EAASjP,EACjC+P,EAAMb,EAAYnO,EAClBiP,EAASd,EAAYnO,EAAI,GAC7B,OAAGiO,EAAIiB,eACAJ,EAAOvE,EAAItL,GAAKsL,EAAItL,EAAI8P,GAASC,EAAMzE,EAAIvK,GAAKuK,EAAIvK,EAAIiP,IAK9ChB,EAAImB,UAAUnB,EAAIkB,oBAExBI,qBACI,KAKFtB,EAAIuB,SAEVD,sBAEI,MAQf5B,EAAU8B,YAAYhX,KAAKuV,mB,6GAG/B,SAAiBvF,EAAOiH,EAAOC,GAC3BlX,KAAKuV,kBAAkBQ,WAAW/F,GAClChQ,KAAKuV,kBAAkB4B,gBAAgBF,GACvCjX,KAAKuV,kBAAkB6B,gBAAgBF,K,gCAG3C,SAAmBG,GACf,IAAI7B,EAAMxV,KAAKoV,QAAQiC,GACvB,OAAG7B,EAAIiB,aACIjB,EAAImB,UAAUnB,EAAIkB,oBAGlBlB,EAAIuB,W,6BAInB,WAEI,IADA,IAAI/O,EAAM,GACV,MAAa7F,OAAOsE,KAAKzG,KAAKoV,SAA9B,eAAwC,CAApC,IAAI1O,EAAC,KACG,YAALA,GACK,aAALA,IACHsB,EAAItB,GAAK1G,KAAKoV,QAAQ1O,IAE1B,OAAO1G,KAAKoV,U,qBAIhB,SAAQ1P,EAAMiL,EAAS0C,EAAM0D,GACzB/W,KAAKoV,QAAQ1P,GAAQ,GACrB1F,KAAKoV,QAAQ1P,GAAMiL,QAAUA,EAC7B3Q,KAAKoV,QAAQ1P,GAAM2N,KAAOA,EAC1BrT,KAAKoV,QAAQ1P,GAAMqR,SAAWA,I,8BAGlC,SAAiBrR,EAAMiL,EAAS0C,EAAMiE,GAAgB,WAClD,GAAGA,EAAe7Y,OAAS,EACvByN,MAAM,oDADV,CAIAlM,KAAKoV,QAAQ1P,GAAQ,GACrB1F,KAAKoV,QAAQ1P,GAAMiL,QAAUA,EAC7B3Q,KAAKoV,QAAQ1P,GAAM2N,KAAOA,EAC1BrT,KAAKoV,QAAQ1P,GAAMiR,UAAYW,EAC/BtX,KAAKoV,QAAQ1P,GAAM+Q,cAAe,EAClCzW,KAAKoV,QAAQ1P,GAAMgR,mBAAqBY,EAAe7Y,OAAS,EAIhE,IAdkD,eAc1CC,GACJ,IAAI8H,EAAI8Q,EAAe5Y,GACpB8H,aAAa+Q,qBACZ/Q,EAAEgR,eAAeC,eAAc,WAC3B,OAAO,EAAKrC,QAAQ1P,GAAMgR,oBAAsBhY,MAJpDA,EAAI,EAAGA,EAAI4Y,EAAe7Y,SAAUC,EAAG,EAAvCA,M,4BAUZ,SAAegZ,GACX1X,KAAKqV,YAAcqC,I,kBAGvB,SAAK7K,GAED,IADA,IAAIwI,EAAcrV,KAAKqV,YACvB,MAAalT,OAAOsE,KAAKzG,KAAKoV,SAA9B,eAAwC,CAApC,IAAI5O,EAAC,KACDgP,EAAMxV,KAAKoV,QAAQ5O,GAEnBiP,EAAW,IAAI5H,IAAI7N,KAAKmV,OAAOpI,QAAUyI,EAAInC,KAAK7M,EAAI,IAAOxG,KAAKmV,OAAOjI,SAAWsI,EAAInC,KAAK9L,EAAI,KACjGmO,EAAc1V,KAAKmV,OAAOxE,QAAQgF,KAAKH,EAAI7E,QAAQiF,MAAM,IAAI/H,IAAI7N,KAAKmV,OAAOpI,QAAU,IAAO/M,KAAKmV,OAAOjI,SAAW,OAErH8I,EAAK,KAOA3V,OALL2V,EADDR,EAAIiB,aACEjB,EAAImB,UAAUnB,EAAIkB,oBAGlBlB,EAAIuB,WAGT/L,QAAQC,IAAI,wBAA0BzE,GAE1CwP,EAAG2B,QAAQjC,EAAaD,GAErBD,EAAIiB,cACHT,EAAGlD,KAAKjG,EAAKwI,EAAY7O,GAAGgP,EAAIkB,oBAAqB1W,KAAKmV,OAAOnD,WAAa,KAC9EnF,EAAI4B,OACJ5B,EAAI0F,YACJ1F,EAAI6B,UAAU,OACd7B,EAAI8F,KAAK+C,EAAYlP,EAAIiP,EAASjP,EAAI,GAAIkP,EAAYnO,EAAG,GAAI,IAC7DsF,EAAI+F,OACJ/F,EAAI+B,WAGJoH,EAAGlD,KAAKjG,EAAKwI,EAAY7O,GAAIxG,KAAKmV,OAAOnD,WAAa,U,KAOhE4F,U,WACF,WAAYC,EAAMC,IAAM,gFACpB9X,KAAK+X,QAAQF,EAAMC,G,oGAEvB,SAAQD,EAAMC,GAIV,OAHA9X,KAAK6X,KAAOA,EACZ7X,KAAKgY,SAAWF,EAET9X,S,KAKTiY,Y,WACF,wBAAc,0FACVjY,KAAK2Q,QAAU,KACf3Q,KAAKqT,KAAO,KACZrT,KAAKkY,QAAU,SAAA1R,GAAC,OAAIA,GACpBxG,KAAKmY,mBAAqB,SAAA3R,GAAC,OAAIA,GAE/BxG,KAAKoY,aAAc,EAKnBpY,KAAKqY,wBAA0B,GAE/BrY,KAAKsY,wBAA0B,EAC/BtY,KAAKuY,0BAA4B,EACjCvY,KAAKwY,0BAA4B,KAEjCxY,KAAKkW,uBAAyB,KAC9BlW,KAAKmW,wBAA0B,KAC/BnW,KAAKyY,uBAAyB,Q,6HAGlC,SAAuBC,GAGnB,OAFA1Y,KAAKyY,uBAAyBC,EAEvB1Y,O,mCAGX,WAEIgL,QAAQC,IAAI,WAAajL,KAAKyY,wBAC9B,IAAIE,EAAM1M,OAAO4H,KAAK7T,KAAKyY,uBAAwB,GAAI,wBAIvD,OAFAtS,sDAAoB,YAAoB,MAAPwS,GAE1B3Y,O,yBAGX,SAAY8R,GAAK,WACb3L,sDAAoB,YAAa2L,GACjC3L,sDAAoB,gBAAiBnG,KAAK2Q,SAC1CxK,sDAAoB,aAAcnG,KAAKqT,MAEvC,IAEIuF,EAFO9G,EAAIkB,MAAMhT,KAAK2Q,QAAQgF,KAAK,IAAI9H,IAAI7N,KAAKqT,KAAK7M,EAAI,EAAG,KAEhDoS,OAWhB,GATGA,GAAQ,IACP5Y,KAAKsY,yBAA2B,EAChCrM,OAAO4M,aAAa7Y,KAAKwY,2BACzBxY,KAAKwY,0BAA4BvM,OAAO6M,YAAW,kBAAM,EAAKR,wBAA0B,IAAI,MAG5FtY,KAAKsY,wBAA0B,EAGhCM,GAAQ,GACP5Y,KAAKuY,0BAA4B,MAEhC,CAED,IAAI7I,EAAKkJ,EAAQ,GACjB5Y,KAAKuY,0BAA4B,EAAO7I,K,yBAMhD,SAAY7C,GAAkB,IAAbkM,EAAa,uDAAL,EAElB/Y,KAAKsY,yBAA2B,MAE7BtY,KAAKsY,wBACJtY,KAAKsY,wBAA0B,IAC9BtY,KAAKuY,2BAA6B,IAC/BvY,KAAKuY,0BAA4B,IAChCvY,KAAKuY,0BAA4B,GAErCvY,KAAKsY,wBAA0B,IAIvC,IAAIU,EAAQ,GACZA,GAAShZ,KAAKuY,0BACd,IAAIU,EAAW,EACfA,GAAYjZ,KAAKuY,0BAEjB,IAAIW,EAAmB,KACnBC,EAAgB,GACpBtM,EAAI4B,OACJ5B,EAAI0F,YAGJ1F,EAAImC,UAAY,SAChBnC,EAAIkC,aAAe,MACnBlC,EAAIoC,KAAOjJ,KAAKgD,MAAMmQ,EAAgBJ,GAAS,gBAG/C,IAAIK,EAAYvM,EAAIwM,YAAYH,GAAkBnM,MAC9CuM,EAAaF,EAEjBvM,EAAI6B,UAAY,uBAAyBsK,EAAQ,IACjDnM,EAAI2F,YAAc,uBAAyByG,EAAW,IACtDjZ,KAAKkW,uBAAyB,IAAIrI,IAAI7N,KAAK2Q,QAAQnK,GAAKxG,KAAKqT,KAAK7M,EAAI4S,GAAaL,EAAQ,EAAIK,EAAWpZ,KAAK2Q,QAAQpJ,GACvHvH,KAAKmW,wBAA0B,IAAItI,IAAgB,EAAZuL,EAA4B,IAAbE,GACtDzM,EAAI8F,KAAK3S,KAAKkW,uBAAuB1P,EAAGxG,KAAKkW,uBAAuB3O,EAAGvH,KAAKmW,wBAAwB3P,EAAGxG,KAAKmW,wBAAwB5O,GACpIsF,EAAI+F,OACJ/F,EAAIgG,SAEJhG,EAAI0F,YAEJyG,EAAQ,EAAMhZ,KAAKuY,0BACnB1L,EAAI6B,UAAY,mBAAqBsK,EAAQ,IAC7C,IAAIO,EAAWvZ,KAAK2Q,QAAQnK,EAAIxG,KAAKqT,KAAK7M,EAAIuS,EAAQ,EACtDlM,EAAIwC,SAAS6J,EAAkBK,EAAUvZ,KAAK2Q,QAAQpJ,GAGtDsF,EAAI+B,Y,6BAIR,WASI,MARU,CACN,cAAiB,CACbkJ,KAAM,OACNrY,MAAOO,KAAKkY,QAAQzS,WACpB+T,YAAa,Y,6BAOzB,SAAAC,gBAAgBlT,MACZ,IAAIgE,KAAOmP,KAAKnT,KAAI,cAAkB9G,MAAMgG,YAC5CU,sDAAoB,uBAAwBoE,gBAAgB9I,UAC5DzB,KAAK2Z,wBAAwBpP,MAC7BvK,KAAKoY,aAAc,I,sCAGvB,SAAyBwB,GAErB,OADA5Z,KAAKqY,wBAA0BuB,EACxB5Z,O,sCAGX,WACI,OAAOA,KAAKqY,0B,gCAGhB,WAAqB,WACbwB,EAAK,IAAIpG,6CAAYxH,QAEzB4N,EAAGC,aAAY,SAAAtT,GAEE,gBAAVA,EAAEsR,KACD+B,EAAGE,MAAMvT,EAAEwT,OAAQxT,EAAEyT,OAAQ,CACzBnC,KAAM,gBACND,KAAM,EAAKqC,oBAGD,iBAAV1T,EAAEsR,MACN,EAAK2B,gBAAgBjT,EAAEqR,MACvB7M,QAAQC,IAAI,yBAGZD,QAAQC,IAAI,gCAAkCW,KAAKC,UAAUrF,OAG5DqT,EAAGhG,KAAK,wBAAyB,WAEtC3H,MAAM,oC,sBAId,SAASP,GAEL,OAAO3L,O,kBAEX,SAAK6M,EAAKsN,EAAWpB,GACjB/N,QAAQC,IAAI,8B,+BAGhB,WACI,OAAOjL,O,gCAGX,SAAmB+C,GAEf,OADAiI,QAAQC,IAAI,iDACLjL,O,qCAGX,SAAwBuK,GAEpB,OADAvK,KAAKkY,QAAU3N,EACRvK,O,qBAGX,SAAQ2Q,EAAS0C,GAGb,OAFArT,KAAK2Q,QAAUA,EACf3Q,KAAKqT,KAAOA,EACLrT,O,sBAGX,SAAS6M,GACLA,EAAI0F,YACJ1F,EAAI8F,KAAK3S,KAAK2Q,QAAQnK,EAAGxG,KAAK2Q,QAAQpJ,EAAGvH,KAAKqT,KAAK7M,EAAGxG,KAAKqT,KAAK9L,GAChEsF,EAAIgG,a,eAKNuH,gB,0GACF,aAAc,oG,+GAId,SAAmB3X,GAEf,OAAOzC,O,kBAEX,SAAK6M,EAAKsN,EAAWpB,GAEjB,GAAY,GAATA,EAAH,CAIAlM,EAAI4B,OAEJ5B,EAAI0F,YAGJ1F,EAAIoC,KAAOjJ,KAAKgD,MAAM+P,EAAQoB,EAAUtC,KAAKwC,UAAU5U,WAAa,gBACpEoH,EAAI6B,UAAYyL,EAAUtC,KAAK1E,MAC/BtG,EAAImC,UAAUmL,EAAUtC,KAAKyC,MAC7B,IAAIhB,EAAazM,EAAIwM,YAAY,KAAKtM,MACtCF,EAAIwC,SAAS8K,EAAUtC,KAAK0C,KAAMva,KAAK2Q,QAAQnK,EAAIxG,KAAKqT,KAAK7M,EAAI,EAAGxG,KAAK2Q,QAAQpJ,EAAI+R,GAErFzM,EAAI+B,e,GA1BkBqJ,aAiCxBV,oB,0GACF,aAA8B,MAAlBiD,EAAkB,uDAAN,MAAM,gFAG1B,IAAIC,EAAU,MACVC,OAAWra,EACXsa,OAAWta,GAJf,gBAMKua,gBAAkB,KAEP,MAAbJ,IACsBna,MAAlBma,EAAU1C,OACT2C,EAAUD,EAAU1C,MAEFzX,MAAnBma,EAAUK,QACTH,EAAWF,EAAUK,OAEHxa,MAAnBma,EAAUM,QACTH,EAAWH,EAAUM,QAM7B,EAAKC,mBAAqBpO,SAASC,cAAc,OACjD,EAAKoO,YAAcrO,SAASC,cAAc,UAC1C,EAAKqO,SAAW,EAAKD,YAAYlO,WAAW,MAE5C,EAAKiO,mBAAmBhL,YAAY,EAAKiL,aACzCrO,SAASmD,KAAKC,YAAY,EAAKgL,oBAE/B,IAAIG,EAAgB,CAChBpD,KAAM2C,EACN5C,KAAM,EAAKK,QAAQ,MACnBiD,QAAS,CACLC,YAAY,EACZzP,MAAO,CACHkE,SAAS,EACT0K,KAAM,iBAEVc,SAAU,CACNpS,KAAM,QACNqS,WAAW,GAEfC,OAAQ,KAMDlb,MAAZqa,IACCQ,EAAcC,QAAQI,OAAOV,MAAQH,GAE1Bra,MAAZsa,IACCO,EAAcC,QAAQI,OAAOT,MAAQH,GAGzC,EAAKa,WAAa,IAAIC,MAAM,EAAKR,SAAUC,GAE3C,EAAKH,mBAAmBnL,MAAM8L,WAAa,SAC3C,EAAKX,mBAAmBnL,MAAM+L,SAAW,QAGzC,IAAIC,GAAc,kFA9DQ,OA+D1B,EAAKpE,eAAiB,8GAClB,aAAc,oGADI,sGAKlB,SAAU1F,GACN,OAA0B,MAAvB8J,EAAYjL,SACPiL,EAAYjL,QAAQnK,EAAIsL,EAAItL,GAAKsL,EAAItL,EAAIoV,EAAYjL,QAAQnK,EAAIoV,EAAYvI,KAAK7M,GAAOoV,EAAYjL,QAAQpJ,EAAIuK,EAAIvK,GAAKuK,EAAIvK,EAAIqU,EAAYjL,QAAQpJ,EAAIqU,EAAYvI,KAAK9L,IAPrK,0BAUlB,SAAauK,GACT,IAAI9R,KAAKqR,cAAe,OAAO,EAC/B,IAAIrR,KAAK0R,UAAUI,GACf,OAAO,EAEX,IAAIa,EAAOiJ,EAAYZ,YAAYa,wBAC/BC,EAAQ,IAAIC,WAAW,YAAa,CACpCC,QAASlK,EAAItL,EACbyV,QAASnK,EAAIvK,EACb2U,QAASvJ,EAAK0D,KAAOvE,EAAItL,EAAIoV,EAAYjL,QAAQnK,EACjD2V,QAASxJ,EAAK4D,IAAMzE,EAAIvK,EAAIqU,EAAYjL,QAAQpJ,IAIpDqU,EAAYZ,YAAYoB,cAAcN,KAxBxB,2BA2BlB,SAAchK,GACV,IAAI9R,KAAKqR,cAAe,OAAO,EAC/B,IAAIrR,KAAK0R,UAAUI,GACf,OAAO,EAEX,IAAIa,EAAOiJ,EAAYZ,YAAYa,wBAC/BC,EAAQ,IAAIC,WAAW,QAAS,CAChCC,QAASlK,EAAItL,EACbyV,QAASnK,EAAIvK,EACb2U,QAASvJ,EAAK0D,KAAOvE,EAAItL,EAAIoV,EAAYjL,QAAQnK,EACjD2V,QAASxJ,EAAK4D,IAAMzE,EAAIvK,EAAIqU,EAAYjL,QAAQpJ,IAIpDqU,EAAYZ,YAAYoB,cAAcN,OAzCxB,EAAI,CAAcjL,YA/Dd,E,4GA6G9B,WACI,IAAIwL,GAAW,uLAGXxB,EAAQ7a,KAAKwb,WAAWL,QAAQI,OAAOV,MACvCC,EAAQ9a,KAAKwb,WAAWL,QAAQI,OAAOT,MACvCwB,EAAgBzB,EAAM0B,MAAK,SAAA/V,GAAC,OAASnG,MAALmG,GAAkBA,EAAEqJ,WACpD2M,EAAgB1B,EAAMyB,MAAK,SAAA/V,GAAC,OAASnG,MAALmG,GAAkBA,EAAEqJ,WAEpD4M,EAAiBzc,KAAKwb,WAAWL,QAAQuB,OAAO7M,QA2BpD,OAxBAwM,EAAQ,sBAA4B,CAChCvE,KAAM,QACNrY,MAAO,CAEH,uBAA0B,CACtBqY,KAAM,OACNrY,MAAO6c,EACP9C,YAAa,+BAEjB,sBAAyB,CACrB1B,KAAM,OACNrY,MAAO+c,EACPhD,YAAa,6BAEjB,eAAkB,CACd1B,KAAM,OACNrY,MAAOgd,EACPjD,YAAa,uBAGrBA,YAAa,iCAIV6C,I,6BAGX,SAAgB9V,IACZ,sLAAsBA,GAGtB,IAAIoW,EAAwBpW,EAAI,sBAA0B9G,MACtDmd,EAAMD,EAAqB,uBAA2Bld,MACtDod,EAAMF,EAAqB,sBAA0Bld,MACrDqd,EAAKH,EAAqB,eAAmBld,MAGjDO,KAAKwb,WAAWL,QAAQI,OAAOV,MAAMkC,SAAQ,SAAAvW,GAAC,OAAIA,EAAEqJ,QAAU+M,KAC9D5c,KAAKwb,WAAWL,QAAQI,OAAOT,MAAMiC,SAAQ,SAAAvW,GAAC,OAAIA,EAAEqJ,QAAUgN,KAE9D7c,KAAKwb,WAAWL,QAAQuB,OAAO7M,QAAUiN,EAEzC9c,KAAKwb,WAAWtI,W,+BAGpB,WACI,IAAIlL,EAAM,GAKV,OAHAA,EAAIkT,cAAgBlb,KAAKwb,WAAWL,QACpCnT,EAAIkQ,QAAUlY,KAAKkY,QAAQzS,WAEpBuC,I,gCAGX,SAAmBvF,GAEf,OADAzC,KAAK2Z,wBAAwB,IAAIlY,SAASgB,EAAIyV,UACvClY,O,uBAoCX,SAAUmV,GAEN,OADAA,EAAO/B,SAASpT,KAAKwX,gBACdxX,O,gCAGX,SAAmBuK,GAEf,OADAA,EAAKvK,KAAKwb,YACHxb,O,kBAGX,SAAK6M,EAAKsN,EAAWpB,GACjB,GAAY,GAATA,EAAH,CAGA,IAAI7F,EAASlT,KAAKgd,YAAcjE,EAMhC,GALA/Y,KAAKgd,WAAajE,EAClB/Y,KAAK+a,mBAAmBnL,MAAM1C,OAASlH,KAAKyJ,IAAIzP,KAAKqT,KAAK9L,EAAIwR,EAAO,GAAK,KAC1E/Y,KAAK+a,mBAAmBnL,MAAM7C,MAAQ/G,KAAKyJ,IAAIzP,KAAKqT,KAAK7M,EAAIuS,EAAO,GAAK,KAGtE/Y,KAAKoY,YACR,CACIpY,KAAK4a,gBAAkB5a,KAAKkY,QAAQiC,GACpC,IAAI8C,EAAUrR,KAAKsR,MAAMtR,KAAKC,UAAU7L,KAAK4a,kBAC7C5a,KAAKwb,WAAW3D,KAAOoF,EACvBjd,KAAKoY,aAAc,EACnBpY,KAAKwb,WAAWtI,SAGjBiH,GAAana,KAAKmd,mBAIjBnd,KAAKmd,iBAAmBhD,EAExBna,KAAKwb,WAAWtI,UAGjBA,GAEClT,KAAKwb,WAAW4B,SAIpBvQ,EAAI4B,OAEJ5B,EAAI0F,YAGJ1F,EAAI2C,UAAUxP,KAAKgb,YAAahb,KAAK2Q,QAAQnK,EAAGxG,KAAK2Q,QAAQpJ,EAAGvH,KAAKqT,KAAK7M,EAAGxG,KAAKqT,KAAK9L,GAEvFsF,EAAI+B,c,wBAlFR,WACI,IAAI5G,EAAM,IAAIpJ,MA2Bd,OAxBAoJ,EAAIxG,KAAK,wBAETwG,EAAIxG,KAAK,wBAETwG,EAAIxG,KAAK,wBAETwG,EAAIxG,KAAK,4BAETwG,EAAIxG,KAAK,0BAETwG,EAAIxG,KAAK,sBAETwG,EAAIxG,KAAK,2BAETwG,EAAIxG,KAAK,wBAETwG,EAAIxG,KAAK,0BAETwG,EAAIxG,KAAK,wBAETwG,EAAIxG,KAAK,0BAETwG,EAAIxG,KAAK,4BAEFwG,M,GAnNmBiQ,aA+Q5BoF,uB,0GACF,aAAc,8FACV,gBAEKC,IAAM,CACPC,eAAe,EACfC,WAAY,SACZC,cAAUpd,EACVqd,aAASrd,GAGb,EAAKsd,sBAAmBtd,EAVd,E,qGAad,SAASsL,GAEL,OADA3L,KAAK2L,MAAQA,EACN3L,O,wBAGX,SAAWsd,GAEP,OADAtd,KAAKsd,IAAMA,EACJtd,O,gCAGX,SAAmBuK,GACfvK,KAAK4d,gBAAkBrT,I,6BAkB3B,SAAgBA,GAEZ,OADAvK,KAAKmY,mBAAqB5N,EACnBvK,O,kBAEX,SAAK6M,EAAKsN,EAAWpB,GAQjB,GANG/Y,KAAKoY,cAEJpY,KAAK2d,iBAAmB3d,KAAKkY,QAAQiC,GACrCna,KAAKoY,aAAc,GAGX,GAATW,EAAH,CAGAlM,EAAI4B,OAEJ5B,EAAI0F,YACJ1F,EAAImC,UAAU,SACdnC,EAAIoC,KAAMjJ,KAAKgD,MAAM,GAAK+P,GAAOtT,WAAa,gBAE9C,IAAI6T,EAAazM,EAAIwM,YAAY,KAAKtM,MAClCvG,EAAIxG,KAAK2Q,QAAQnK,EAAIxG,KAAKqT,KAAK7M,EAAI,EACnCe,EAAIvH,KAAK2Q,QAAQpJ,EAAI+R,EAEtBtZ,KAAKsd,IAAIC,eACR1Q,EAAIwC,SAASrP,KAAK2L,MAAOnF,EAAGe,GAIhC,IAAIzD,EAAI9D,KAAK2d,iBAEb9Q,EAAI0F,YACJ1F,EAAImC,UAAYhP,KAAKsd,IAAIE,WACzB3Q,EAAIoC,KAAK,SAAW,GAAK8J,GAAOtT,WAAa,gBAC7CoH,EAAI6B,UAAU2O,EAAuBQ,cAAc7d,KAAKmY,mBAAmBrU,IAC3EwV,EAAazM,EAAIwM,YAAY,KAAKtM,MAClCF,EAAIkC,aAAe,SAEnB,IAAI+O,EAAW,EAYf,GAXG9d,KAAKsd,IAAII,SACL1d,KAAKsd,IAAII,QAAQrH,OAChByH,EAAW9d,KAAKsd,IAAII,QAAQrH,MAGV,UAAvBrW,KAAKsd,IAAIE,WACR3Q,EAAIwC,SAAS7E,OAAO1G,GAAK,IAAK0C,EAAIsX,EAAU9d,KAAK2Q,QAAQpJ,EAAIvH,KAAKqT,KAAK9L,EAAI,GAChD,QAAvBvH,KAAKsd,IAAIE,YACb3Q,EAAIwC,SAAS7E,OAAO1G,GAAK,IAAK9D,KAAK2Q,QAAQnK,EAAIsX,EAAU9d,KAAK2Q,QAAQpJ,EAAIvH,KAAKqT,KAAK9L,EAAI,GAGzFvH,KAAKsd,IAAIG,SAAU,oCACTzd,KAAKsd,IAAIG,UADA,IAClB,2BACY,SADRjX,EAAwB,UAEpBqG,EAAI0F,YACJ1F,EAAI2F,YAAY,QAChB3F,EAAI4F,UAAY,EAChB5F,EAAIkR,OAAO/d,KAAK2Q,QAAQnK,EAAGxG,KAAK2Q,QAAQpJ,GACxCsF,EAAImR,OAAOhe,KAAK2Q,QAAQnK,EAAGxG,KAAK2Q,QAAQpJ,EAAIvH,KAAKqT,KAAK9L,EAAIwR,GAC1DlM,EAAIgG,UAGJ7H,QAAQC,IAAI,wDAA0DzE,GAX5D,+BAgBtBxG,KAAKie,YAAYpR,EAAKkM,GAEtBlM,EAAI+B,c,4BApFR,SAAqBsP,GACjB,IAEI1I,EAAmC,EAA7BxP,KAAKiC,MAFJ,KAEiBiW,GAU5B,MAAO,KANJA,GAAW,GACJ,MAAa,MAAa1I,EAG1B,SAAa,IAAaxP,KAAKgD,MAAM,IAAQwM,IAEtC/P,SAAS,IAAI0Y,SAAS,EAAG,S,GAzCblG,aAqH/BmG,gC,0GACF,aAAc,wFACV,gBAEKd,IAAM,GAIX,IAAI1B,GAAc,kFAPR,OAQV,EAAKyC,eAAiB,8GAClB,aAAc,oGADI,sGAKlB,SAAUvM,GACN,OAA0B,MAAvB8J,EAAYjL,SACPiL,EAAYjL,QAAQnK,EAAIsL,EAAItL,GAAKsL,EAAItL,EAAIoV,EAAYjL,QAAQnK,EAAIoV,EAAYvI,KAAK7M,GAAOoV,EAAYjL,QAAQpJ,EAAIuK,EAAIvK,GAAKuK,EAAIvK,EAAIqU,EAAYjL,QAAQpJ,EAAIqU,EAAYvI,KAAK9L,IAPrK,4BAUlB,SAAeuK,GAEX,IAAIwM,EAAO1C,EAAYjL,QAAQnK,EAC3B+X,EAAO3C,EAAYjL,QAAQpJ,EAE3BiX,EAAS5C,EAAYvI,KAAK7M,EAC1BiY,EAAS7C,EAAYvI,KAAK9L,EAI1BmX,GAFK9C,EAAY+C,cAED7M,EAAItL,EAAI8X,GAAxBI,EAAiC5M,EAAIvK,EAAIgX,EAE7C,GAAGG,EAAc,GAAKA,EAAcF,EAAQ,OAAQ,EACpD,GAAGE,EAAc,GAAKA,EAAcD,EAAQ,OAAQ,EAGpD,IAAIG,EAAahD,EAAYtC,WAAasC,EAAY+C,cAItD,OAFY3Y,KAAKiC,MAAMyW,EAAcE,KA5BvB,0BAiClB,SAAa9M,GACT,IAAI9R,KAAKqR,cAAe,OAAO,EAC/B,IAAIrR,KAAK0R,UAAUI,GAGf,OADA8J,EAAYiD,qBAAuB,GAC5B,EAGX,IAAI9W,EAAQ/H,KAAK8e,eAAehN,GAKhC,OAHA8J,EAAYmD,cAAchX,IAGnB,IA9CO,2BAiDlB,SAAc+J,GACV,QAAI9R,KAAKqR,iBACLrR,KAAK0R,UAAUI,OAnDL,EAAI,CAAcjB,YA0DxC,EAAKmO,MAAQ,GAEb,EAAKC,kBAAoB,GAEzB,EAAKN,cAAgB,GAtEX,E,0GA4Ed,SAAc5W,GACV/H,KAAK6e,oBAAsB9W,I,sBAG/B,SAAS4D,GAEL,OADA3L,KAAK2L,MAAQA,EACN3L,O,qBAGX,SAAQkf,EAAM3E,GAEV,OADAva,KAAKgf,MAAME,GAAQ3E,EACZva,O,wBAGX,SAAWsd,GAEP,OADAtd,KAAKsd,IAAMA,EACJtd,O,gCAGX,SAAmBuK,GACfvK,KAAK4d,gBAAkBrT,I,uBAG3B,SAAU4K,GAEN,OADAA,EAAO/B,SAASpT,KAAKqe,gBACdre,O,kBAIX,SAAK6M,EAAKsN,EAAWpB,GASjB,GAPG/Y,KAAKoY,cAEJpY,KAAKif,kBAAoBjf,KAAKkY,QAAQiC,GACtChU,sDAAoB,8BAAyD9F,MAA1BL,KAAKif,mBACxDjf,KAAKoY,aAAc,GAGX,GAATW,EAAH,CAGAlM,EAAI4B,OAGJ5B,EAAImC,UAAY,SAChBnC,EAAIkC,aAAe,SACnBlC,EAAI2F,YAAc,QAClB3F,EAAI4F,UAAY,EAGhB5F,EAAIoC,KAAOjJ,KAAKgD,MAAM,GAAK+P,GAAOtT,WAAa,gBAG/C,IAAI6T,EAAazM,EAAIwM,YAAY,KAAKtM,MACtC/M,KAAKsZ,WAAaA,EAElB,IA3BwB,EA2BpBhK,EAAOtP,KAAK2Q,QAAQnK,EAAIxG,KAAKqT,KAAK7M,EAAI,EACtC6H,EAAOrO,KAAK2Q,QAAQpJ,EAAI+R,EAExB5a,EAAI,EA9BgB,6BA+BXsB,KAAKif,mBA/BM,IA+BxB,2BAAqC,KAA7BzY,EAA6B,QAC7B2Y,EAAenf,KAAKgf,MAAMxY,GAE9BqG,EAAI0F,YACD7T,GAAKsB,KAAK6e,oBACThS,EAAI2F,YAAc,MAGlB3F,EAAI2F,YAAc,QAEtB3F,EAAIwC,SAAS8P,EAAc7P,EAAMjB,GACjCxB,EAAIuS,QAAQ9P,EAAMjB,EAAMrO,KAAKqT,KAAK7M,EAAI,GAAM8S,EAAatZ,KAAK2e,cAAgB,GAAO,EAAK,EAAK,EAAK,EAAI3Y,KAAKsO,IAC7GzH,EAAIgG,SAGJxE,IAASiL,EAAatZ,KAAK2e,eAAiB5F,IAC1Cra,GA/CkB,8BAmDxBsB,KAAKie,YAAYpR,EAAKkM,GAEtBlM,EAAI+B,e,GA/JkCqJ,aAqKxCoH,sB,0GACF,aAAc,oG,iGAId,SAAKxS,EAAKyS,EAAcvG,GAEpB,GAAY,GAATA,EAAH,CAEAlM,EAAI4B,OACJ5B,EAAI0F,YAGJ,IAAI4H,EAAYna,KAAKkY,QAAQoH,GAGzBjF,EAAWF,EAAUE,SACrBkF,EAAepF,EAAUqF,KAEzB9B,EAAUvD,EAAUuD,QAEpB+B,EAAezZ,KAAKgD,MAAMqR,EAAWtB,GAEzClM,EAAIoC,KAAOwQ,EAAe,gBAGTvP,SAASqP,EAAajY,KAAI,SAAAd,GAAC,OAAIA,EAAEmF,UAAQ,SAAAnF,GAAC,OAAIqG,EAAIwM,YAAY7S,EAAI,MAAMuG,SAAzF,IArB2B,EAuBvB2S,EAAc7S,EAAIwM,YAAY,KAAKtM,MAMnCrO,GAFYwR,SAASqP,EAAajY,KAAI,SAAAd,GAAC,OAAIA,EAAEgP,QAAM,SAAAhP,GAAC,OAAIqG,EAAIwM,YAAY7S,GAAGuG,SAEvE,GA7BmB,6BA8BXwS,GA9BW,IA8B3B,2BAA8B,KAAtBI,EAAsB,QACtBja,EAAOia,EAAKhU,MACZ6J,EAAMmK,EAAKlgB,MAGfoN,EAAI0F,YACJ1F,EAAImC,UAAY,OAChBnC,EAAIwC,SAAS3J,EAAM1F,KAAK2Q,QAAQnK,EAAIkX,EAAQrH,KAAO0C,EAAO/Y,KAAK2Q,QAAQpJ,EAAImW,EAAQnH,KAAO7X,EAAE,IAAMghB,EAbnF,KAgBf7S,EAAI0F,YACJ1F,EAAImC,UAAY,QAEhBnC,EAAIwC,SAASmG,EAAKxV,KAAK2Q,QAAQnK,GAAKxG,KAAKqT,KAAK7M,EAAIkX,EAAQpH,OAASyC,EAAO/Y,KAAK2Q,QAAQpJ,EAAImW,EAAQnH,KAAO7X,EAAE,IAAMghB,EAnBnG,KAqBfhhB,KA7CuB,8BA+C3BmO,EAAI+B,e,GApDwBqJ,aAwD9BxK,Q,0GACF,WAAYZ,GAAK,8FACb,gBACKA,IAAMA,EACX,EAAK2B,QAAU,GAEf,EAAKoR,MAAQ,IAAI/R,IAAI,EAAG,GACxB,EAAKgS,IAAM,IAAIhS,IAAI,EAAG,GACtB,EAAKiS,OAAS,EACd,EAAKC,YAAc,EAEnB,EAAKC,UAAY,GAEjB,EAAKC,aAAe,EACpB,EAAKC,cAAgB,EAbR,E,iGAgBjB,WACIlgB,KAAKigB,aAAe,EACpBjgB,KAAKkgB,cAAgB,I,kBAGzB,WAAoB,IAAfC,EAAe,uDAAL,EACXngB,KAAKigB,aAAeE,EACpBngB,KAAKkgB,cAAgBC,I,iCAGzB,WAA+C,WAA3BC,EAA2B,4DAAX/f,EAG5BggB,GAFSrgB,KAAK6M,IAAIyT,OAEJ,SAAA9Z,GAAC,OAAIA,IACnB+Z,EAAc,SAAAhZ,GAAC,OAAIA,GAEDlH,MAAnB4L,OAAOuU,WACNH,EAAc,SAAA7Z,GAAC,OAAIA,EAAIyF,OAAOuU,YAC9BD,EAAc,SAAAhZ,GAAC,OAAIA,EAAI0E,OAAOuU,aAGZngB,MAAnB+f,IACCC,EAAc,SAAA7Z,GAAC,OAAI4Z,EAAgBK,kBAAkBja,IACrD+Z,EAAc,SAAAhZ,GAAC,OAAI6Y,EAAgBM,kBAAkBnZ,KAGzD,IAAIoZ,EAAS,SAAAxf,GACT,EAAK0Q,aAAa,IAAIhE,IAAIwS,EAAYlf,EAAE6a,SAAUuE,EAAYpf,EAAE8a,YAEhE2E,EAAQ,SAAAzf,GACR,EAAKyQ,cAAc,IAAI/D,IAAIwS,EAAYlf,EAAE6a,SAAUuE,EAAYpf,EAAE8a,UAAW9a,EAAEsL,SAE9EoU,EAAS,SAAA1f,GACT,EAAKwQ,oBAAoB,IAAI9D,IAAIwS,EAAYlf,EAAE6a,SAAUuE,EAAYpf,EAAE8a,UAAW9a,EAAEsL,SAIxFzM,KAAKggB,UAAUxe,KAAK,CAAC,YAAamf,IAClC3gB,KAAKggB,UAAUxe,KAAK,CAAC,QAASof,IAC9B5gB,KAAKggB,UAAUxe,KAAK,CAAC,WAAYqf,IAEjC,IA/B2C,EA+BvChU,EAAM7M,KAAK6M,IA/B4B,6BAgC5B7M,KAAKggB,WAhCuB,IAgC3C,2BAA+B,OAAvBc,EAAuB,SAC3B,EAAAjU,EAAIyT,QAAOS,iBAAX,oFAA+BD,KAjCQ,iC,qBAqC/C,YACI,+KADM,mCAGS9gB,KAAKggB,WAHd,IAGN,2BAA+B,OAAvBc,EAAuB,SAC3B,EAAA9gB,KAAK6M,IAAIyT,QAAOU,oBAAhB,oFAAuCF,KAJrC,8BAON9gB,KAAKwO,QAAU,KACfxO,KAAK4f,MAAQ,KACb5f,KAAK6f,IAAM,KACX7f,KAAK6M,IAAM,O,oBAGf,SAAO+S,EAAOC,EAAKC,EAAQC,EAAakB,EAASC,GAC7ClhB,KAAK4f,MAAQA,EACb5f,KAAK6f,IAAMA,EACX7f,KAAK8f,OAASA,EACd9f,KAAK+f,YAAcA,EACnB/f,KAAKihB,QAAUA,EACfjhB,KAAKkhB,WAAaA,EAElBlhB,KAAK8S,S,+BAGT,SAAkBhB,GACd,GAAwB,GAArB9R,KAAKigB,aAEJ,OAAO,EAGX,IANmB,EAMfkB,EAAQ,EACRC,EAAQ,EAPO,6BASLphB,KAAKwO,SATA,IASnB,2BAA4B,KAAnB9G,EAAmB,QAChBrH,MAALqH,EACCsD,QAAQC,IAAI,qBAEK5K,MAAbqH,EAAEiJ,SACN3F,QAAQC,IAAI,qBAEhBkW,EAAQnb,KAAKyJ,IAAI/H,EAAEiJ,QAAQnK,EAAIkB,EAAE2L,KAAK7M,EAAG2a,GACzCC,EAAQpb,KAAKyJ,IAAI/H,EAAEiJ,QAAQpJ,EAAIG,EAAE2L,KAAK9L,EAAG6Z,IAjB1B,8BAoBnB,QAAItP,EAAIuP,OAAOrhB,KAAK4f,MAAO,IAAI/R,IAAIsT,EAAOC,M,6BAO9C,WAC4B,GAArBphB,KAAKigB,aACJjgB,KAAKigB,aAAe,EAGpBjgB,KAAKigB,aAAe,I,+BAI5B,SAAkBnO,GAEd,QAAGA,EAAItL,EAAIxG,KAAK4f,MAAMpZ,EAAIxG,KAAK+f,YADnB,GACwCjO,EAAItL,EAAIxG,KAAK4f,MAAMpZ,EAAIxG,KAAK8f,OADpE,IAIThO,EAAIvK,EAAIvH,KAAK4f,MAAMrY,EAJV,GAIqBuK,EAAIvK,EAAIvH,KAAK6f,IAAItY,EAJtC,KAKRyD,QAAQC,IAAI,aACL,M,uBAMf,SAAU6G,GACN,OAAO9R,KAAKshB,kBAAkBxP,K,2BAGlC,SAAcA,EAAKL,GACf,OAAGzR,KAAKuhB,kBAAkBzP,EAAKL,IAC3BzR,KAAKwhB,mBACE,GAGa,GAArBxhB,KAAKigB,eAKR,oLAA2BnO,EAAKL,K,iCAGpC,SAAoBK,EAAKL,GACrB,OAAGzR,KAAKuhB,kBAAkBzP,EAAKL,IAC3BzR,KAAKwhB,mBACE,GAGa,GAArBxhB,KAAKigB,eAKR,0LAAiCnO,EAAKL,K,kBAG1C,WAAO,WACCmO,EAAQ5f,KAAK4f,MACbC,EAAM7f,KAAK6f,IACXC,EAAS9f,KAAK8f,OACdC,EAAc/f,KAAK+f,YACnBlT,EAAM7M,KAAK6M,IAEZ7M,KAAKihB,SAA8B,MAAnBjhB,KAAKkhB,YACpBrU,EAAI4U,UAAU,EAAG,EAAG5U,EAAIyT,OAAOvT,MAAOF,EAAIyT,OAAOpT,QAIrDL,EAAI4B,OACJ5B,EAAI0F,YACJ1F,EAAI4F,UAAY,EAChB5F,EAAI2F,YAAc,gBAAkBxS,KAAKkgB,cAAcza,WAAa,IACpEoH,EAAIkR,OAAO6B,EAAMpZ,EAAIuZ,EAAaH,EAAMrY,GAExCsF,EAAImR,OAAO4B,EAAMpZ,EAAIsZ,EAAQF,EAAMrY,GACnCsF,EAAIgG,SAEJhG,EAAImR,OAAO4B,EAAMpZ,EAAIsZ,EAAQD,EAAItY,GACjCsF,EAAIgG,SAEJhG,EAAImR,OAAO6B,EAAIrZ,EAAIuZ,EAAaF,EAAItY,GACpCsF,EAAIgG,SAEJhG,EAAI+B,UAEJ,IAAI8S,EAAW7U,EAAI8U,YAWnB,GAVA9U,EAAI8U,YAAc3hB,KAAKigB,aAEpBjgB,KAAKigB,aAAe,GAEnBjgB,KAAK4hB,YAAY,IAAI/T,IAAI+R,EAAMpZ,EAAIsZ,EAxBnB,GAwB2CF,EAAMrY,IAGrEsF,EAAI8U,YAAcD,EAGf1hB,KAAKihB,QAAS,CACb,IAAI3L,EAAQtV,KAGZiM,OAAO4V,uBAAsB,WACH,MAAnB,EAAKX,WACJ5L,EAAMxC,OAGN,EAAKoO,mB,yBAMrB,SAAYY,GACR,IAAIxS,EAAOwS,EAAStb,EAChB6H,EAAOyT,EAASva,EAEpBua,EAAW,KAEX,IACIpa,EAPc,EAQdqa,EAAU,EARI,6BASR/hB,KAAKwO,SATG,IASlB,2BAAwB,CAAnB9G,EAAmB,QACX,IAAImG,IAAIyB,EAAMjB,GAAvB,IAGI2T,EAFAC,EAAY,IAAIpU,IAAIyB,EAAMjB,EAAO0T,GAGN,QAA5Bra,EAAE4F,yBAEDyU,GAAW1O,IAEf2O,EAAQC,EACRva,EAAEoL,KAAKkP,EAAO,IAAInU,IAbX,OAa4B7N,KAAK6M,KACxCyC,GAAQ+D,IApBM,iC,uBAwBtB,SAAU3L,GACN1H,KAAKwO,QAAQhN,KAAKkG,GAClB1H,KAAKoT,SAAS1L,O,GA1PAmJ,WA+PlBqR,wBAA0B,EAIxBC,kB,WAIF,WAAYtV,EAAKuV,IAAkB,gFAC/BpiB,KAAK6M,IAAMA,EACX7M,KAAKqiB,QAAU,KACfriB,KAAKsiB,UAAY,GACjBtiB,KAAKoiB,iBAAmBA,EACxBpiB,KAAKuiB,QAAU,GAEfviB,KAAKwiB,eAAgB,EACrBxiB,KAAKyiB,aAAe,CAACjc,EAAG,EAAGe,EAAG,GAC9BvH,KAAK0iB,kBAAoB,CAAClc,EAAG,EAAGe,EAAG,GAEnCvH,KAAK2iB,aAAc,EAEnB3iB,KAAK4iB,aAAe,CAACpc,EAAG,EAAGe,EAAG,GAE9BvH,KAAK6iB,WAAa,EAElB7iB,KAAK8iB,KAAOnW,SAASoW,gBAAgB,6BAA6B,OAElE/iB,KAAKgjB,eAAiBhjB,KAAK8iB,KAAKG,kBAEhCjjB,KAAKkjB,0B,qGAGT,SAAS1c,EAAGe,GACR,IAAI4b,EAAMnjB,KAAK8iB,KAAKM,iBAEpB,OADAD,EAAG3c,EAAEA,EAAG2c,EAAG5b,EAAEA,EACN4b,I,gCAGX,WACI,IAAIE,EAAKrjB,KAAKgjB,eACdhjB,KAAK6M,IAAIyW,aAAaD,EAAG9hB,EAAG8hB,EAAG3b,EAAG2b,EAAG3W,EAAG2W,EAAG3T,EAAG2T,EAAGliB,EAAGkiB,EAAGE,K,uBAG3D,WACI,MAAO,CAAE/c,EAAGxG,KAAKgjB,eAAe7hB,EAAGoG,EAAGvH,KAAKgjB,eAAeO,K,qCAG9D,WAA0B,WAOlBC,EAAM7W,SAASoW,gBAAgB,6BAA6B,OAChE/iB,KAAK6M,IAAI4W,yBAA2BD,EAAIP,kBAGxC,IAAIS,EAAU,WACV1Y,QAAQ5E,QAAQsC,MAAM,EAAKmE,IAAI4W,yBAAyBF,KAExDI,EAAO3jB,KAAK6M,IACZ+W,EAAaD,EAAK5K,MACtB4K,EAAK5K,MAAQ,SAAS8K,EAAGC,GAGrB,OAFAH,EAAKF,yBAA2BE,EAAKF,yBAAyBM,gBAAgBF,EAAGC,GACjFJ,IACOE,EAAW1iB,KAAKyiB,EAAME,EAAIC,IAErC,IAAIE,EAAiBL,EAAKM,UAC1BN,EAAKM,UAAY,SAASJ,EAAGC,GAGzB,OAFAH,EAAKF,yBAA2BE,EAAKF,yBAAyBQ,UAAUJ,EAAGC,GAC3EJ,IACOM,EAAe9iB,KAAKyiB,EAAME,EAAIC,IAEzC,IAAII,EAAcP,EAAKQ,OACvBR,EAAKQ,OAAS,SAASC,GAGnB,OAFAT,EAAKF,yBAA2BE,EAAKF,yBAAyBU,OAAW,IAAJC,EAAYpe,KAAKsO,IACtFoP,IACOQ,EAAYhjB,KAAKyiB,EAAMS,IAElC,IAAIC,EAAiBV,EAAK5K,MAC1B4K,EAAKW,UAAY,SAAS/iB,EAAEmG,EAAEgF,EAAEgD,EAAEvO,EAAEoiB,GAChC,IAAIgB,EAAKf,EAAIP,kBAIb,OAHAsB,EAAGhjB,EAAEA,EAAGgjB,EAAG7c,EAAEA,EAAG6c,EAAG7X,EAAEA,EAAG6X,EAAG7U,EAAEA,EAAG6U,EAAGpjB,EAAEA,EAAGojB,EAAGhB,EAAEA,EAC7CI,EAAKF,yBAA2BE,EAAKF,yBAAyBe,SAASD,GACvEb,IACOW,EAAenjB,KAAKyiB,EAAKpiB,EAAEmG,EAAEgF,EAAEgD,EAAEvO,EAAEoiB,IAG9C,IAAIkB,EAAoBd,EAAKL,aAC7BK,EAAKL,aAAe,SAAS/hB,EAAEmG,EAAEgF,EAAEgD,EAAEvO,EAAEoiB,GAQnC,OAPAI,EAAKF,yBAAyBliB,EAAIA,EAClCoiB,EAAKF,yBAAyB/b,EAAIA,EAClCic,EAAKF,yBAAyB/W,EAAIA,EAClCiX,EAAKF,yBAAyB/T,EAAIA,EAClCiU,EAAKF,yBAAyBtiB,EAAIA,EAClCwiB,EAAKF,yBAAyBF,EAAIA,EAClCG,IACOe,EAAkBvjB,KAAKyiB,EAAKpiB,EAAEmG,EAAEgF,EAAEgD,EAAEvO,EAAEoiB,IAGjDI,EAAKe,gCAAkC,SAASle,EAAEe,GAC9C,IAAI4b,EAAMK,EAAIJ,iBAGd,OAFAD,EAAG3c,EAAEA,EAAG2c,EAAG5b,EAAEA,EACbmc,IACOP,EAAGwB,gBAAgBhB,EAAKF,yBAAyBmB,c,qBAIhE,WACI5kB,KAAK2iB,aAAc,EACnB3iB,KAAK6kB,mB,yBAGT,SAAYpiB,GACRzC,KAAKsiB,UAAU9gB,KAAKiB,GACpBzC,KAAKuiB,QAAQ/gB,KAAK,CAAC,EAAK2gB,EAAkB2C,UAAW,EAAKriB,M,4BAG9D,SAAesiB,GACX/kB,KAAKsiB,UAAYtiB,KAAKsiB,UAAUja,QAAO,SAAA7B,GAAC,OAAIA,GAAKue,O,4BAGrD,WAAiB,mCACA/kB,KAAKsiB,WADL,IACb,2BAA6B,QACvB0C,UAFO,8BAIbhlB,KAAKsiB,UAAY,GACjBtiB,KAAKuiB,QAAU,K,mBAGnB,SAAM0C,GAAgB,IAAVze,EAAU,uDAAR,EAAGe,EAAK,uDAAH,EAEf,GAAGvH,KAAKwiB,eAAiBxc,KAAKgE,IAAIib,GAAQ,MAAUjlB,KAAK6iB,WAAa,EAClE7X,QAAQC,IAAI,+BADhB,CAIAjL,KAAK6iB,aACL7iB,KAAKwiB,eAAgB,EAErBxiB,KAAK4iB,aAAapc,EAAIA,EACtBxG,KAAK4iB,aAAarb,EAAIA,EACtBvH,KAAKyiB,aAAajc,GAAKye,EACvBjlB,KAAKyiB,aAAalb,GAAK0d,EAEvBjlB,KAAKyiB,aAAajc,EAAIR,KAAKyJ,IAAI,KAAOzP,KAAKyiB,aAAajc,GACxDxG,KAAKyiB,aAAalb,EAAIvB,KAAKyJ,IAAI,KAAOzP,KAAKyiB,aAAalb,GAEpD,IAAI2d,EAAKD,EAAO,EAAI,GAAM,IACtB9B,EAAKnjB,KAAKmlB,SAASnlB,KAAK4iB,aAAapc,EAAGxG,KAAK4iB,aAAarb,GAAGod,gBAAgB3kB,KAAKgjB,eAAe4B,WACrG5kB,KAAKgjB,eAAiBhjB,KAAKgjB,eAAeiB,UAAUd,EAAG3c,EAAG2c,EAAG5b,GAC7DvH,KAAKgjB,eAAiBhjB,KAAKgjB,eAAejK,MAAMmM,EAAIA,EAAI,EAAG,EAAG,EAAG,GACjEllB,KAAKgjB,eAAiBhjB,KAAKgjB,eAAeiB,WAAWd,EAAG3c,GAAI2c,EAAG5b,GAEnEvH,KAAK6iB,gB,uBAGT,SAAUrc,EAAGe,GACTvH,KAAKgjB,eAAiBhjB,KAAKgjB,eAAeiB,UAAUzd,EAAIxG,KAAKgjB,eAAezhB,EAAGgG,EAAIvH,KAAKgjB,eAAetT,K,+BAG3G,SAAkBJ,GACd,OAAOtP,KAAKmlB,SAAS7V,EAAM,GAAGqV,gBAAgB3kB,KAAKgjB,eAAe4B,WAAWpe,I,+BAGjF,SAAkB6H,GACd,OAAOrO,KAAKmlB,SAAS,EAAG9W,GAAMsW,gBAAgB3kB,KAAKgjB,eAAe4B,WAAWrd,I,sBAGjF,WAEI,OADApB,sDAAoB,gBAAiBnG,KAAKyiB,aAAajc,GAAKxG,KAAKyiB,aAAalb,GACvEvH,KAAKolB,SAASplB,KAAKyiB,aAAajc,K,0BAG3C,WACI,OAAOxG,KAAKolB,SAASplB,KAAK0iB,kBAAkBlc,K,sBAGhD,SAASA,GAGL,OAFAA,EAAI6e,WAAW7e,EAAEuC,QAAQ,IACrB/C,KAAKgD,MAAU,IAAJxC,GAAW,M,kBAK9B,WACI,KAAGxG,KAAK2iB,aAGL3iB,KAAK6iB,WAAa,GAArB,CACA7iB,KAAK6iB,YAAc,EACnB,IAAIhW,EAAM7M,KAAK6M,IAGfA,EAAI4B,OACJ5B,EAAIyW,aAAa,EAAG,EAAG,EAAG,EAAG,EAAG,GAChCzW,EAAI4U,UAAU,EAAG,EAAG5U,EAAIyT,OAAOvT,MAAOF,EAAIyT,OAAOpT,QACjDL,EAAI+B,UAID5O,KAAKwiB,eAAoC,GAAnBxiB,KAAK6iB,YAErB7iB,KAAKygB,kBAAkBzgB,KAAK4iB,aAAapc,GACzCxG,KAAK0gB,kBAAkB1gB,KAAK4iB,aAAarb,GAG9CvH,KAAKslB,qBACLtlB,KAAKwiB,eAAgB,IAIhBxiB,KAAKygB,kBAAkBzgB,KAAK4iB,aAAapc,GACzCxG,KAAK0gB,kBAAkB1gB,KAAK4iB,aAAarb,IAIlDvH,KAAKslB,qBAILtlB,KAAKoiB,iBAAiBmD,WApCnB,mCAqCUvlB,KAAKsiB,WArCf,IAqCH,2BAA6B,QACvBxP,OAtCH,8BA+CH9S,KAAK6iB,YAAc,K,wBAGvB,WACI,IAAIvN,EAAQtV,KACZA,KAAKqiB,QAAUpW,OAAO4V,uBAAsB,kBAAMvM,EAAMxC,a,sBAxO5D,WACI,OAAOoP,8B,6lCC32DTzO,E,WACF,WAAY0B,GAAQ,2BAChBnV,KAAKmV,OAASA,EACdnV,KAAKiM,OAAS,KAEdjM,KAAKwlB,gBAAkB,KAEvBxlB,KAAKylB,UAAY,SAAAjf,GAAC,OAAI,EAAKkf,QAAQlf,IACnCxG,KAAKmV,OAAO4L,iBAAiB,UAAW/gB,KAAKylB,W,mCAGjD,WAA4D,IAAvDE,EAAuD,uDAAjD,GAAI9jB,EAA6C,uDAApC,GAAI+jB,EAAgC,uDAArB,GAAIC,EAAiB,wDAGxD,OAFA7lB,KAAKiM,OAASkJ,OAAOtB,KAAK8R,EAAK9jB,EAAQ+jB,EAAW,uBAAwBC,GAEtE7lB,KAAKiM,OAEFjM,KAAKiM,S,yBAGhB,SAAYzF,GACRxG,KAAKwlB,gBAAkBhf,I,yBAG3B,SAAYsf,GACR,OAAO9lB,KAAKiM,OAAO8Z,YAAYD,EAAS,O,mBAG5C,SAAMnN,EAAKsB,EAAQ6L,GAIf,OAHGnN,GAAO3Y,KAAKiM,QAAyB,MAAfjM,KAAKiM,QAC1BjB,QAAQC,IAAI,+BAETjL,KAAKgmB,YAAYF,K,2BAG5B,SAAcjO,GACV7X,KAAKimB,YAAcpO,I,qBAGvB,WACI7X,KAAKmV,OAAO6L,oBAAoB,UAAWhhB,KAAKylB,a,gCAGpD,SAAmBzP,GACf,OAAOA,EAAGkQ,sB,6BAGd,SAAgB3nB,GACZ,IADiB,EACbyJ,EAAM,GADO,IAEJzJ,GAFI,IAEjB,2BAAkB,KAAViI,EAAU,QACdwB,EAAIxG,KAAKxB,KAAKmmB,UAAU3f,KAHX,8BAKjB,OAAOwB,I,gCAGX,SAAmBuC,GACf,OAAOA,EAAK9E,a,+BAGhB,SAAkB2gB,GACd,GAAU/lB,MAAP+lB,EACC,MAAO,GAEX,IAJmB,EAIfpe,EAAM,GAJS,IAKR7B,cAAsBigB,IALd,IAMnB,2BAAmB,KAAX5f,EAAW,QACXgP,EAAM4Q,EAAI5f,GAEdwB,EAAIxB,GAAKxG,KAAKmmB,UAAU3Q,IATT,8BAYnB,OAAOxN,I,uBAKX,SAAUvF,GACN,OAAGA,aAAewV,YACPjY,KAAKqmB,mBAAmB5jB,GAE3BA,aAAe7D,MACZoB,KAAKsmB,gBAAgB7jB,GAExBA,aAAeN,OACZnC,KAAKumB,kBAAkB9jB,GACZ,mBAAPA,EACJzC,KAAKwmB,mBAAmB/jB,GAExBA,I,qBAGf,SAAQqZ,GACJ,IAAI2K,EAAQ3K,EAAMjE,KAClB,GAAGiE,EAAM9B,QAAUha,KAAKiM,OAIxB,GAAiB,gBAAdwa,EAAM3O,KAGL,GAA2B,MAAxB9X,KAAKwlB,gBAAyB,CAC7B,IAAIkB,EAAS,CACT5O,KAAM,cACND,KAAM7X,KAAKimB,aAEfjmB,KAAK+Z,MAAM+B,EAAM9B,OAAQ8B,EAAM7B,OAAQyM,QAIvC1mB,KAAKwlB,gBAAgBiB,OAGP,SAAdA,EAAM3O,MACV9M,QAAQC,IAAI,iCACZjL,KAAKiM,OAAO0a,QACZ3mB,KAAKglB,WAEuB,MAAxBhlB,KAAKwlB,gBAITxlB,KAAKwlB,gBAAgBiB,GAGrBzb,QAAQC,IAAI,gBAAkBW,KAAKC,UAAU4a,Q,+3FCvHjDG,EAAMC,WAAND,EAEKE,MAAb,WACI,kBAAc,oFACV9mB,KAAK+mB,UAAY,IAAIC,+CACrBhnB,KAAKinB,YAAc,GAEnBjnB,KAAKknB,qBAAuB,GAC5BlnB,KAAKmnB,iBAAmB,KAExBnnB,KAAKonB,mBAAqB,KAE1BpnB,KAAKqnB,oBAAsB,GAa3BrnB,KAAKsnB,kBAAoB,EAGzBtnB,KAAKunB,WAAaC,aAAaC,QAAQ,mBAChB,MAAnBznB,KAAKunB,aACLvnB,KAAKunB,WAAavnB,KAAK0nB,kBACvBF,aAAaG,QAAQ,kBAAmB3nB,KAAKunB,aAIjDvnB,KAAK4nB,YAAc,IAAIC,iDAAWL,aAAaC,QAAQ,qBACvDznB,KAAK4nB,YAAYE,aAAY,SAAAthB,GACzBghB,aAAaG,QAAQ,mBAAoB/b,KAAKC,UAAUrF,EAAEuhB,kBAnCtE,4GAuCI,WAAc,WACV/nB,KAAKgoB,aAAaC,SAASC,GAAGloB,KAAKmoB,UAAUC,YAAY,gCAAgC,SAAA5hB,GACrF,EAAK6hB,gCAETroB,KAAKgoB,aAAaC,SAASC,GAAGloB,KAAKmoB,UAAUC,YAAY,kCAAkC,SAAA5hB,GACvF,EAAK8hB,kCAETtoB,KAAKgoB,aAAaC,SAASC,GAAGloB,KAAKmoB,UAAUC,YAAY,sBAAsB,SAAA5hB,GAC3E,EAAK+hB,qCAETvoB,KAAKgoB,aAAaC,SAASC,GAAGloB,KAAKmoB,UAAUC,YAAY,sBAAsB,SAAA5hB,GAC3E,EAAKgiB,qCAITvc,OAAO8U,iBAAiB,eAAe,SAAA0H,GACnCzd,QAAQC,IAAI,2BAA4Bwd,EAAG5mB,QAE3C,EAAK6mB,KAAKD,QAzDtB,2BA6DI,WAAgC,IAAlB/iB,EAAkB,4DAAXrF,EACbgG,EAAMmhB,aAAaC,QAAQ,qBAgB/B,GAdIphB,EADO,MAAPA,EACMuF,KAAKsR,MAAM7W,GAGX,CAAC,CACH,qBAAsB,UACtB,KAAQ,YACR,WAAW,EACX,UAAWrG,KAAK2oB,SAChB,mBAAoB,GACpB,gBAAmB,MACnB,oBAAqB,QAIjBtoB,MAARqF,EAAmB,CACnB,IAAMsC,EAAM3B,EAAIgC,QAAO,SAAA7B,GAAC,OAAIA,EAAE,uBAAyBd,KACvD,GAAkB,GAAdsC,EAAIvJ,OAIJ,OAAOuJ,EAAI,GAFXgD,QAAQtL,MAAM,gDAAiDgG,GAKvE,OAAOW,IAvFf,6BA0FI,SAAgBuiB,UACLA,EAAO,WACd,IAFoB,EAEdC,EAAW7oB,KAAK8oB,gBAElBpqB,EAAI,EAJY,6BAKJmqB,GALI,IAKpB,2BAA0B,CACtB,GADsB,QAChB,uBAAyBD,EAAO,sBAAuB,CAEzDC,EAASnqB,GAAKkqB,EACd,QAEFlqB,GAXc,8BAahBA,GAAKmqB,EAASpqB,QACdoqB,EAASrnB,KAAKonB,GAElBC,EAAS/gB,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAE,sBAAsBwnB,cAAcrhB,EAAE,0BAChE8f,aAAaG,QAAQ,oBAAqB/b,KAAKC,UAAUgd,MA3GjE,iCA8GI,SAAoBnjB,GAChBsjB,eAAerB,QAAQ,2BAA4BjiB,KA/G3D,qCAkHI,WACI,IAAMW,EAAM2iB,eAAevB,QAAQ,4BACnC,OAAW,MAAPphB,EACO,UAEAA,IAvHnB,iCA2HI,WAEI,OADerG,KAAK8oB,cAAc9oB,KAAKipB,6BA5H/C,mCAgII,WAAwB,WACdL,EAAS5oB,KAAKkpB,sBAEhBC,EAAe,GASnB,GAPAA,EAAe,cAAH,iBACLA,GAAiB,CAChB,yBAA0BP,EAAM,OAKpCA,EAAO,WAAY,CAGnB,IAAMQ,EAAiB,KAAKzjB,KAAKijB,EAAO,qBAAwB,OAASA,EAAO,oBAAsB,IAAO,IAC7GO,EAAe,cAAH,iBACLA,GAAiB,CAChB,4BAA8B,sBAAwBC,EAAiB,qBACvE,gCAAkC,SAAWA,EAAiB,iCAC9D,gCAAkC,SAAWA,EAAiB,wCAKtED,EAAe,cAAH,iBACLA,GAAiB,CAChB,4BAA6B,aAC7B,gCAAiC,2BACjC,gCAAiC,6BAqB7C,OAdY,IAAIvpB,SAAQ,SAACV,EAASC,GAC9B,IAAMkqB,EAAc,cAAH,CACbC,UAAW,EAAKC,eACbJ,IAEPK,yCAAa,iCAAkCH,GAAa,SAACI,GAClC,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAC5BzqB,EAAQ0pB,GACc,IAAfa,EAAIE,SAAkBF,EAAIE,OAAS,KAAKC,WAAW,MAC1DzqB,YA7KpB,oBAqLI,WACI,IAAM0qB,EAASrC,aAAaC,QAAQ,gBACpC,GAAc,MAAVoC,EACA,OAAOA,GAEXL,yCAAa,iCAA6BnpB,GAAW,SAAAopB,GACjD,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAC5C,IAAMniB,EAAIoE,KAAKsR,MAAMuM,EAAIK,UACzB,GAAezpB,MAAXmH,EAAE9H,MAAoB,CACtB,IAAMqqB,EAAIviB,EAAEwiB,OACZxC,aAAaG,QAAQ,eAAgBoC,QAErC7d,MAAM1E,EAAE9H,UAGjB,SApMX,kBAiNI,SAAK+oB,GAKD,IAAMwB,EAAiB,SAACC,EAAIC,GAExB,IAAMC,EAAWxe,KAAKsR,MAAMgN,GAG5BtD,EAAEuD,GAAME,UAAU,8BAAgCD,EAAStS,KAAO,QAAUsS,EAAS1kB,KAAO,WAG1F7D,EAAS4mB,EAAG5mB,OACdqoB,EAAKroB,EAAOyoB,aAAa,aAC7B,GAAU,MAANJ,EAkBAD,EAAeC,EAAIroB,GACnB4mB,EAAG8B,kBACH9B,EAAG+B,iBAGPxf,QAAQC,IAAI,gBAAiBif,OAvB7B,CAEI,IAAKzB,EAAGgC,SAAU,OAClB,IAHY,+BAGFhC,EAAGiC,gBAHD,IAIZ,2BAAmB,KAARvpB,EAAQ,QAKf,GAAU,OAHN+oB,EADkB7pB,MAAlBc,EAAEmpB,aACGnpB,EAAEmpB,aAAa,aACZ,MAEI,CACZL,EAAeC,EAAI/oB,GACnBsnB,EAAG8B,kBACH9B,EAAG+B,iBACH,QAbI,kCAhOxB,0BA2PI,WAA2B,WAAdG,EAAc,uDAAJ,GAEnBC,QAAQ/W,KAAK,CACTlI,MAAO,qBACPmE,KAAM,uZAYNtB,QAAS,GACTqc,SAAS,IAEb,IAAIrkB,EAAIogB,EAAE,eACV,GAAgB,GAAZpgB,EAAE/H,OACF,KAAM,+BAEV+H,EAAIA,EAAE,GAEN,IAAMskB,EAAe,SAACjT,GACH,eAAX8S,GACA,EAAKI,QAAQlT,KAIrBmT,yCAAkBxkB,GAAG,SAACykB,EAAMpT,GACxB7M,QAAQC,IAAI,cAAeggB,GAE3BH,EAAajT,GAGb+S,QAAQjE,UACT,KAAM,CACLuE,SAAU,SAGd,IAAIC,EAAYvE,EAAE,gBAClB,GAAwB,GAApBuE,EAAU1sB,OACV,KAAM,gCAEV0sB,EAAYA,EAAU,IAEZvb,MAAMuQ,QAAU,EAE1BgL,EAAUpK,iBAAiB,UAAU,SAAAva,GACjC,IAAM4kB,EAAOD,EAAUE,MAAM,GAEvBC,EAAS,IAAIC,WACnBD,EAAOpX,OAAS,SAAA3M,GACZujB,EAAavjB,EAAE1F,OAAO2pB,QAEtBZ,QAAQjE,SAEZ2E,EAAOG,WAAWL,QAtT9B,yBA0TI,WACI,OAAOprB,KAAKunB,aA3TpB,uBAmUI,WACIvnB,KAAK0rB,QAAQ,gBACb1rB,KAAK0rB,QAAQ,eACb1rB,KAAK0rB,QAAQ,cACb1rB,KAAK0rB,QAAQ,cAvUrB,sBA2UI,WACS1rB,KAAKgoB,aAAa2D,OAET3rB,KAAKgoB,aAAa2D,KAAKC,kBAAiB,SAAAplB,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,QAC9DiF,SAAQ,SAAC8O,GAAD,OAAUA,EAAKlF,WAC7B3mB,KAAKmoB,UAAU2D,4BAhVvB,4BAmVI,SAAelD,GAEX,GAAIA,EAAOmD,cAAe,CACtB,IAAMC,EAAKhsB,KAAKmoB,UAAU8D,gBAC1BjsB,KAAKmoB,UAAU+D,qBAAqBF,EAAG3jB,QAAO,SAAA7B,GAAC,OAAIA,EAAE,IAAMoiB,EAAOmD,kBAGtE,IAAMJ,EAAO3rB,KAAKgoB,aAAa2D,KAG/B,GAAKA,EAGL,GAAiC,IAA7BA,EAAKQ,aAAa1tB,OAMlBktB,EAAKvY,SAJiB,CAClB0E,KAAM,MACNsU,QAAS,KAKbpsB,KAAKqsB,eAAezD,QAEpB,GAAI5oB,KAAKgoB,aAAasE,YAElBtsB,KAAKgoB,aAAaC,SAASsE,KAAK,wBAAyB3gB,KAAKC,UAAU+c,QACrE,oCACc+C,EAAKQ,cADnB,IACH,2BAAoC,KAAzBK,EAAyB,QAChC,GAAsB,SAAlBA,EAAG5D,OAAO9Q,KAEV,YADA0U,EAAGpZ,SAASwV,IAHjB,8BAQH,IAAM6D,EAAOd,EAAKQ,aAAa,GAAGA,aAAa7kB,KAAI,SAAAd,GAAC,OAAIA,EAAEoiB,UAC1D+C,EAAKQ,aAAa,GAAGO,SATlB,mCAWcD,GAXd,IAWH,2BAAuB,KAAZD,EAAY,QACnBxsB,KAAKqsB,eAAeG,IAZrB,8BAcHxsB,KAAKqsB,eAAezD,MA5XpC,qBAkYI,WAAsB,IAAdwD,EAAc,uDAAJ,GAEdpsB,KAAK2sB,WACL3sB,KAAK4sB,mBAEL,IAAMC,EAAS7sB,KAAK0nB,kBAGF,KAAd0E,EAAQ,IAE0B,GAA9BA,EAAQU,MAAM,MAAMruB,SACpB2tB,EAAUxgB,KAAKC,UAAUD,KAAKsR,MAAMkP,GAAU,KAAM,IAI5D,IAAMxD,EAAS,CACXjd,MAAO,cACPmM,KAAM,YACNiU,cAAe,kBACfgB,eAAgB,CAAEC,QAASH,EAAQI,aAAcb,IAGrDpsB,KAAKqsB,eAAezD,GAGpB5oB,KAAKktB,gCAAgCltB,KAAM,GAAI,CAAEmtB,gBAAgB,MA3ZzE,iCA8ZI,WACI,IAEMvE,EAAS,CACXjd,MAAO,WACPmM,KAAM,YACNiU,cAAe,oBACfgB,eAAgB,CAAEC,QANPhtB,KAAK0nB,oBASpB1nB,KAAKqsB,eAAezD,KAxa5B,2BA2aI,WACI,IAEMA,EAAS,CACXjd,MAAO,YACPmM,KAAM,YACNiU,cAAe,oBACfgB,eAAgB,CAAEC,QANPhtB,KAAK0nB,oBASpB1nB,KAAKqsB,eAAezD,KArb5B,qBAwbI,SAAQljB,GACJ,IAAMmkB,EAASrC,aAAaC,QAAQ,eAAiB/hB,GACrD,OAAc,MAAVmkB,GAA4BxpB,MAAVwpB,IAGlBL,yCAAa,0BAA4B9jB,OAAMrF,GAAW,SAAAopB,GACtD,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAC5C3e,QAAQC,IAAIvF,EAAM+jB,EAAIK,UACtB,IAAMzjB,EAAMuF,KAAKsR,MAAMuM,EAAIK,UACf,YAARpkB,GACAW,EAAG,KAAM7E,KAAK,UAElBgmB,aAAaG,QAAQ,eAAiBjiB,EAAMkG,KAAKC,UAAUxF,OAEhE,OAEI,MAGJuF,KAAKsR,MAAM2M,GAAX,OA3cf,8BA8cI,SAAiBuD,EAAWC,EAAMC,EAAQnY,GAA6B,WAArBgG,EAAqB,4DAAX9a,EAIxD,GAAc,MAAVitB,EAAJ,CAIA,IAAK1uB,MAAMoF,QAAQspB,GAAS,CACxB,IAAMC,EAAaD,EAGfE,EAAcrrB,OAAOsE,KAAK6mB,GAAQjlB,QAAO,SAAA7B,GAAC,OAAKA,EAAEojB,WAAW,aAG1D6D,GAFND,EAAcA,EAAYnlB,QAAO,SAAA7B,GAAC,OAAIrE,OAAOsE,KAAK6mB,GAAQhiB,SAAS,SAAW9E,OAErDc,KAAI,SAAAd,GACzB,IAAMknB,EAAK9hB,KAAKsR,MAAMtR,KAAKC,UAAUyhB,EAAO,SAAW9mB,KAKvD,OAHAknB,EAAGhoB,KAAOc,EACVknB,EAAGjuB,MAAQ6tB,EAAO9mB,GAEX,CAAE7D,SAAU+qB,EAAIC,SAAUD,EAAGC,SAAUC,QAASL,EAAY1V,KAAMwV,EAAKxV,SAGlFyV,EAASG,EAGb,GAA0B,iBAAdL,EAAwB,CAEhC,IAAMS,EAAcT,EACpBA,EAAY,CACRU,gBAAiB,SAACF,EAASloB,EAAMjG,GAE7B,EAAK0oB,UAAU4F,QAAQ,CAAC,oBAAsBF,IAAc,SAAArnB,MAEzD,CACCwnB,QAAS,IACTV,OAAQ,CACJM,QAASA,EACTloB,KAAMA,EACNjG,MAAOA,EACPqY,KAAMqD,EAAUA,EAAQrD,KAAOqD,KAKnCA,GAA4B,mBAAjBA,EAAQrD,MAGvB,EAAKmW,eAETC,oBAAqB,WACjB,EAAK/F,UAAU4F,QAAQ,CAAC,4BAA8BF,IAAc,SAAArnB,MAEjE,CACCwnB,QAAS,IACTV,OAAmBjtB,MAAX8a,OAAuB9a,EAAY8a,EAAQgT,gBAG3DC,qBAAsB,SAACC,EAAUC,EAASC,GACtC,EAAKpG,UAAU4F,QAAQ,CAAC,yBAA2B5S,EAAQqT,YAAY,SAAAhoB,MAEpE,CACCwnB,QAAS,IACTV,OAAQ1hB,KAAKC,UAAU,CAACwiB,EAAUC,EAASC,OAGnDpG,QAAS,kBAAM,EAAKA,YAG5B,IAtEmE,EAsE7DsG,EAAK,IAAIC,sCACXC,EAASF,EAETG,EAAM,KACJC,EAAa,GA1EgD,6BA2EnDvB,GA3EmD,IA2EnE,2BAAwB,KAAb9mB,EAAa,QAEdsoB,EAAMtoB,EAAEmnB,SACSttB,MAAnBwuB,EAAWC,KACXD,EAAWC,GAAO,IAEtBD,EAAWC,GAAKttB,KAAKgF,IAjF0C,8BAmF9DsgB,MAAMiI,uBACAF,EAAW,WAEtB,cAAgB1sB,OAAOoM,QAAQsgB,GAA/B,eAA4C,CAAvC,IAAMG,EAAC,KAGFC,EAAWD,EAAE,GACbznB,EAAIynB,EAAE,GAAGlnB,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAEoB,SAAS+C,KAAKqjB,cAAcrhB,EAAE/E,SAAS+C,SAIvEipB,EAASF,EACT,IAAMS,EAAKviB,SAASC,cAAc,QAClCsiB,EAAGC,UAAYF,EACf,IAAMG,EAAKT,EAAOU,OAAOH,GACzBE,EAAGE,WAAW,GAAGC,QAAU,IAE3BX,EAAM,IAAIF,sCAA0BC,EAAQS,GAdJ,mCAgBpB7nB,GAhBoB,IAgBxC,2BAAuB,KAAZioB,EAAY,QACbC,EAAa9iB,SAASC,cAAc,QACpCpG,EAAIgpB,EAAM7sB,SAChB8sB,EAAWN,UAAY3oB,EAAEd,KACzB+pB,EAAW9jB,MAAQnF,EAAEtD,KACrB,IAAMwsB,EAAaC,MAAMC,iBAAiBxC,EAAW5mB,EAAGgpB,GAClDK,EAAKlB,EAAOU,OAAOI,EAAYC,GAC1B,MAAPd,GACAA,EAAIkB,cAAcD,IAxBc,+BA8B5C,GAFApB,EAAGsB,YAAY,wBAEX5U,GAA2B,kBAAhBA,EAAQrD,KAA0B,CAE7C,IAAMnM,EAAQgB,SAASC,cAAc,QACrCjB,EAAMqkB,UAAY,GAClBrkB,EAAMwjB,UAAYhU,EAAQkT,SAC1BlZ,EAAOpF,YAAYpE,GAGnB,IAAMskB,EAAgBtjB,SAASC,cAAc,QAC7CqjB,EAAcd,UAAY,cAC1Bc,EAAcD,UAAY,iBAC1BC,EAAcrgB,MAAQ,mBAEtBqgB,EAAclP,iBAAiB,SAAS,WAEpCqM,EAAUgB,qBAAqBjT,EAAQkT,SAAUlT,EAAQrJ,IAAKqJ,EAAQgT,aAAa,GAAGI,YAE1FpZ,EAAOpF,YAAYkgB,GAGvB,GADAxB,EAAGyB,SAAS/a,GACRgG,GAA2B,kBAAhBA,EAAQrD,KAA0B,CAE7C,IAAMrL,EAASE,SAASC,cAAc,UACtCH,EAAO0iB,UAAY,gCACnB1iB,EAAOsU,iBAAiB,SAAS,SAAAoP,GAC7B1jB,EAAO2jB,UAAW,EAClB,EAAKjI,UAAU4F,QAAQ,CAAC,4BAA8B5S,EAAQqT,YAAY,SAAA6B,MACvE,CACC/C,OAAQ1hB,KAAKC,UAAUsP,EAAQgT,mBAGvChZ,EAAOpF,YAAYtD,SA9InBzB,QAAQslB,KAAK,2CAndzB,iDAsmBI,SAAAC,oCAAoCC,MAAO3Y,MAEvC,IAAM4Y,iBAAmBD,MAAM,GACzBE,SAAWF,MAAM,GACjBG,aAAeH,MAAM,GACrBI,qBAAuB,CAG7BA,IAA8B,2BAC9BA,SAAmC,2BATU,sCAW7BD,cAX6B,WAW7C,kDAA8B,KAAnBnqB,EAAmB,aACpBqqB,GAAK5kB,OAAO6kB,OAAO,4BAA8BtqB,GACvD,GAAU,MAANqqB,GAMA,MAHAD,qBAAqBpqB,GAAKqqB,IAhBW,gDAwB7C7lB,QAAQC,IAAI,OAAQ4M,MACH,SAAbA,KAAKC,MACL9M,QAAQslB,KAAK,qBAAsBzY,MAGvC,IAAIkZ,WAAalZ,KAAKmZ,WAAWC,MACjCjmB,QAAQ5E,OAAqB/F,MAAd0wB,YAEf,IAAMG,YAAc,SAAdA,cACF,IAAMC,OAAShvB,OAAOsE,KAAKmqB,sBAAsBtpB,KAAI,SAAAd,GAAC,MAAI,OAASA,EAAI,MAAQoqB,qBAAqBpqB,MAAI4qB,KAAK,KAAO,IACpHL,WAAaA,WAAWzpB,KAAI,SAAAd,GAAC,OAAIkT,KAAKyX,OAAS3qB,OAEnD0qB,cAGA,IAAMG,gBAAkB1kB,SAASC,cAAc,OACzC0kB,UAAY3kB,SAASC,cAAc,OACzC0kB,UAAUtB,UAAY,WACtBsB,UAAU1hB,MAAQ,kDAClB,IAAM2hB,cAAgB5kB,SAASC,cAAc,OAEzC2kB,cAAcvB,UAAY,WAC1BuB,cAAc3hB,MAAQ,kCAGtB,IAAK,IAAI4hB,IAAM,EAAGA,IAAM,IAAKA,IAAK,CAC9B,IAAMC,MAAQ9kB,SAASC,cAAc,OAErC,IACI6kB,MAAMtC,UAAoB,GAAPqC,IAAY,IAAMT,WAAW,GAClD,MAAOW,GACLD,MAAMtC,UAAoB,GAAPqC,IAAY,QAAU,MAE7CD,cAAcxhB,YAAY0hB,OAIlC,IAAME,cAAgBhlB,SAASC,cAAc,OAEzC+kB,cAAc3B,UAAY,cAC1B2B,cAAc/hB,MAAQ,kCAGtB,IAAK,IAAI4hB,IAAM,EAAGA,IAAM,IAAKA,IAAK,CAC9B,IAAMC,KAAQ9kB,SAASC,cAAc,OAErC,IACI6kB,KAAMtC,UAAoB,GAAPqC,IAAY,IAAMT,WAAW,GAClD,MAAOW,GACLD,KAAMtC,UAAoB,GAAPqC,IAAY,QAAU,MAE7CG,cAAc5hB,YAAY0hB,MAIlC,IAAMG,WAAajlB,SAASC,cAAc,OAC1CglB,WAAW5B,UAAY,WACX,MAARnY,OACA+Z,WAAW7hB,YAAYwhB,eACvBD,UAAUvhB,YAAY4hB,gBAG1B,IAAIE,OAAS,GACTd,WAAWxU,MAAK,SAAA/V,GAAC,OAAIA,EAAI,SAAMqrB,OAAS,GAExCd,WAAWtyB,OAAS,GAAGsyB,WAAWvvB,KAAK,GAE3CwJ,QAAQC,IAAI,iBAAkBwlB,kBAC9BzlB,QAAQC,IAAI,SAAUylB,UAYtB,IAAMoB,aAAepB,SAASppB,KAAI,SAAAd,GAAC,OAAIA,KAAGsB,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAEwwB,MAAQrqB,EAAEqqB,SAAOjtB,MAAM,GAAGktB,UAE/EC,UAAYvB,SAAS,GAErBwB,aAAe,GAEjBC,cAAgB,kBAAM,MAEpBC,OAAS,SAAA5rB,GAAC,OAAcnG,MAAVmG,EAAE6rB,KAAoB7rB,EAAE6rB,KAAO7rB,GAiOnD,OA/NA,WACI,IAAM8rB,WAAa3lB,SAASC,cAAc,OACtCukB,OAAShvB,OAAOsE,KAAKmqB,sBAAsBtpB,KAAI,SAAAd,GAAC,MAAI,OAASA,EAAI,MAAQoqB,qBAAqBpqB,MAAI4qB,KAAK,KAAO,IAE5GmB,gBAAkB5lB,SAASC,cAAc,SAE3C2lB,gBAAgBza,KAAO,QACvBya,gBAAgBC,IAAM,IACtBD,gBAAgB9yB,MAAQ,IACxB8yB,gBAAgBE,KAAO,IAEvBH,WAAWviB,YAAYwiB,iBAG3B,IAAIG,kBAAoB,EACpBC,gBAAiB,EAErBL,WAAWtC,UAAY,cAjB3B,0CAkBsB8B,cAlBtB,WAkBI,kDAAgC,KAArBc,IAAqB,aACtBC,MAAOlmB,SAASC,cAAc,SAC9BkmB,KAAMnmB,SAASC,cAAc,SACnCkmB,KAAIhb,KAAO,SACXgb,KAAIN,IAAM,IACVM,KAAIL,KAAO,IAEXK,KAAI/R,iBAAiB,UAAU,SAAAgS,GAI3B,IAJqC,EAIjCC,EAAS,EACTC,EAAS,EALwB,6BAMnBf,aAAa5qB,KAAI,SAAAd,GAAC,OAAIA,KAAGwrB,WANN,IAMrC,2BAAsD,KAA3CY,EAA2C,QAC5CM,EAAMpqB,SAAS8pB,EAAInjB,KAAO3G,SAAS8pB,EAAIJ,KAAO,EAE9CW,EAAMP,EAAInzB,MAEhBuzB,GAAUlqB,SAASqqB,GAAOF,EAC1BA,GAAUnqB,SAASoqB,IAZc,8BAcrCX,gBAAgB9yB,MAAQuzB,EAExBb,mBAGJ,IACIW,KAAIN,IAAM9Y,KAAKyX,OAASiB,OAAOQ,IAAIpd,IAAIoK,QACzC,MAAOze,GACL6J,QAAQslB,KAAK,sCAAuCnvB,GAExD,IACI2xB,KAAIrjB,IAAMiK,KAAKyX,OAASiB,OAAOQ,IAAIpd,IAAIqK,MACzC,MAAO1e,GACL6J,QAAQslB,KAAK,sCAAuCnvB,GAExD,IACI2xB,KAAIrzB,MAAQia,KAAKyX,OAASiB,OAAOQ,IAAIpd,IAAIoK,QAC3C,MAAOze,GACL6J,QAAQslB,KAAK,sCAAuCnvB,GAIxDgwB,QAAU,OAASyB,IAAG,IAAO,MAAQR,OAAOQ,IAAIpd,IAAIoK,OAAS,IAE7DiT,MAAK1D,UAAY,kBAAoByD,IAAG,IAAO,UAAYR,OAAOQ,IAAIpd,IAAIoK,OAAS,KAAOwS,OAAOQ,IAAIpd,IAAIqK,KAAO,iBAAmBuS,OAAOQ,IAAIpd,IAAIid,MAClJK,KAAInjB,aAAa,aAAcijB,IAAG,KAClCC,MAAK9iB,YAAY+iB,MACjBZ,aAAa1wB,KAAKsxB,MAElBR,WAAWviB,YAAY8iB,OAEE,GAArBH,oBAAwBA,kBAAoB,GAEhD,IAAMU,SAAY,SAACC,KAAD,OAAS3Z,KAAKyX,OAAS,IAAMiB,OAAOiB,IAAI7d,IAAIqK,KAAO,MAAQuS,OAAOiB,IAAI7d,IAAIoK,OAAS,SAAWwS,OAAOiB,IAAI7d,IAAIid,OAA7G,CAAqHG,KACvH,GAAZQ,UAAiBT,eACjBA,gBAAiB,EAEjBD,mBAAqBU,UA5EjC,gDA+EIpoB,QAAQC,IAAI,oBAAqBynB,mBAE7BH,gBAAgB9iB,IAAMijB,kBAAoB,EAE1CH,gBAAgBxR,iBAAiB,SAAS,SAAAuS,GACtC,IAD8C,EAC1CH,EAAMrqB,SAASypB,gBAAgB9yB,OADW,6BAG5ByyB,aAAa5qB,KAAI,SAAAd,GAAC,OAAIA,KAAGwrB,WAHG,IAG9C,2BAAsD,KAA3CY,EAA2C,QAC5CM,EAAMpqB,SAAS8pB,EAAInjB,KAAO3G,SAAS8pB,EAAIJ,KAAO,EAE9Ce,EAAWJ,EAAMD,EAEvBN,EAAInzB,MAAQ8zB,EAEZJ,EAAMntB,KAAKiC,MAAMkrB,EAAMD,IAVmB,kCAclD,IAAM9O,EAAI6N,UACJY,KAAOlmB,SAASC,cAAc,SAC9BkmB,IAAMnmB,SAASC,cAAc,QAEnC2lB,gBAAgBxR,iBAAiB,SAAS,SAAAyS,GACtCrB,mBAGJW,IAAI3D,UAAY,gBAChB0D,KAAK1D,UAAY,kBAAoB/K,EAAC,IAAO,UAAYgO,OAAOhO,EAAE5O,IAAIoK,OAAS,KAAOwS,OAAOhO,EAAE5O,IAAIqK,KAAO,iBAAmBuS,OAAOhO,EAAE5O,IAAIid,MAC1II,KAAK9iB,YAAY+iB,KAEjBR,WAAWviB,YAAY8iB,MAE3BxB,gBAAgBthB,YAAYuiB,YA/GhC,GAkHAH,cAAgB,yBACZP,WAAW6B,UAAY,GACvB7B,WAAW7hB,YAAYwhB,eACvB,IAAMmC,YAAc,GACpBvxB,OAAOwxB,OAAOD,YAAa9C,sBAE3B,2CACoBsB,cADpB,YACI,qDAA8B,KAAnBxzB,EAAmB,cACpBk1B,MAAQl1B,EAAE4rB,aAAa,cACvB9U,IAAM9W,EAAEe,MAEdi0B,YAAYE,OAASpe,KAL7B,kDASA,IAAMqe,YAAc1xB,OAAOsE,KAAKitB,aAAapsB,KAAI,SAAAd,GAAC,MAAI,OAASA,EAAI,MAAQktB,YAAYltB,GAAK,OAAK4qB,KAAK,IAEhG0C,oBAAsB,GACtBC,oBAAsB,IAEtBC,aAAe,IAGrB,WAUI,IATA,IAAMC,MAAQ,SAARA,MAASztB,GACX,OAAOkT,KAAKma,YAAcrtB,IAExB0tB,KAAOjC,UAAS,IAChBkC,MAAQ/B,OAAOH,UAAUzc,IAAIoK,OAC7BwU,MAAQhC,OAAOH,UAAUzc,IAAIqK,KAC7BwU,SAAWjC,OAAOH,UAAUzc,IAAIid,MAP1C,eAUaY,GAEL,IAAIiB,EAAQ7D,iBAAiBnpB,KAAI,SAACd,EAAG9H,GAAJ,MAAU,CAAC8H,EAAG9H,MAAIoJ,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAE,GAAKmG,EAAE,MAAIJ,KAAI,SAAAd,GAAC,OAAIA,EAAE,MAG1F8tB,EAAQA,EAAMhtB,KAAI,SAAAitB,GAAG,OAAIN,MAAM,OAASC,KAAO,MAAQb,EAAM,IAAMkB,EAAG,QAGzDl0B,MADC2zB,aAAaM,EAAM,MAE7BN,aAAaM,EAAM,IAAM,IAE7BN,aAAaM,EAAM,IAAI9yB,KAAK8yB,EAAM,KAX7BjB,IAAMY,MAAME,OAAQd,KAAOY,MAAMG,OAAQf,KAAOY,MAAMI,UAAW,MAAjEhB,MAVb,GAyBA,IAAK,IAAImB,QAAU,EAAGA,QAAUzD,WAAW,KAAMyD,QAG7C,GAAIzD,WAAW,GAAK+C,qBAAuBU,QAAUV,oBAAsB,GAAKU,QAAUzD,WAAW,GAAK+C,oBAAsB,GAE5H,GAAIU,QAAU,GAAKV,oBAAsB,EAAG,CAExC,IAAMW,KAAQ9nB,SAASC,cAAc,OACrC6nB,KAAMzE,UAAY,WAClByE,KAAM7kB,MAAQ,iDACd6kB,KAAMtF,UAAY,MAClByC,WAAW7hB,YAAY0kB,WAR/B,CAYA,IAAMA,MAAQ9nB,SAASC,cAAc,OACrC6nB,MAAMzE,UAAY,WAClByE,MAAM7kB,MAAQ,iDAEd,IAAK,IAAI4hB,IAAM,EAAGA,IAAMT,WAAW,KAAMS,IAErC,GAAIT,WAAW,GAAKgD,qBAAuBvC,IAAMuC,oBAAsB,GAAKvC,IAAMT,WAAW,GAAKgD,oBAAsB,GAEpH,GAAIvC,IAAM,GAAKuC,oBAAsB,EAAG,CAEpC,IAAMW,MAAS/nB,SAASC,cAAc,OACtC8nB,MAAO9kB,MAAQ,oBAGf8kB,MAAOvF,UAAY,MACnBsF,MAAM1kB,YAAY2kB,YAT1B,CAcA,IAAIC,eAAgB,EAEVlD,MAAQuC,aAAaQ,SACdn0B,MAAToxB,OACIA,MAAMnmB,SAASkmB,OAAMmD,eAAgB,GAIjD,IAAMD,OAAS/nB,SAASC,cAAc,OAClCgoB,WAAa,qBACbD,gBACAC,WAAa,oBAGjBF,OAAO9kB,MAAQ,cAAgBiiB,OAAS,mBAAqBA,OAAS,iCAAmC+C,WACzGH,MAAM1kB,YAAY2kB,QAGtB9C,WAAW7hB,YAAY0kB,OAE3BnD,UAAUvhB,YAAY6hB,aAE1BP,gBAAgBthB,YAAYuhB,WAE5Ba,gBAEOd,kBAv7Bf,gDA07BI,SAAAwD,mCAAmCC,SAAUC,OAAQC,QAASC,SAA0C,IAAjCC,YAAiC,yDAAfC,OAAe,uDAAN,KACxFC,aAAe,SAAA5uB,GAAC,OAAKA,aAAa5H,MAAS4H,EAAI,CAACA,IAEtDsuB,SAAWM,aAAaN,UACxBC,OAASK,aAAaL,QACtBC,QAAUI,aAAaJ,SACvBC,QAAUG,aAAaH,SAWvB,IARA,IAAMI,UAAY,GAEZC,WAAa,GACbC,SAAW,GACXC,UAAY,GACZC,UAAY,GACZC,UAAY,GAETC,OAAS,EAAGA,OAASb,SAASr2B,SAAUk3B,OAAQ,CAarD,IAXA,IAAMC,QAAUd,SAASa,QACnBE,MAAQd,OAAOY,QACfG,OAASd,QAAQW,QACjBI,OAASd,QAAQU,QAEnBK,UAAY,KACZC,QAAU,KACVC,QAAW,KACXC,QAAW,KAEXpF,UAAa,KACJ,CACT,IAAIqF,UAAW,EACTC,gBAAkBl0B,OAAOoM,QAAQ8mB,WAAW/tB,KAAI,SAAAd,GAAC,MAAI,OAASA,EAAE,GAAK,IAAMA,EAAE,GAAK,OAAK4qB,KAAK,IAClG,IAEI,IAAMkF,IAAM,kBAAUtwB,KAAKwsB,IAAL,MAAAxsB,KAAI,YACpBuwB,SAAW,SAACh1B,EAAGmG,GAAJ,OAAU1B,KAAKwwB,KAAKj1B,EAAImG,IAOzC,GALAsuB,UAAYtc,KAAK2c,gBAAkBT,SACnCK,QAAUvc,KAAK2c,gBAAkBR,OAAS,EAC1CK,QAAWxc,KAAK2c,gBAAkBP,QAClCK,QAAWzc,KAAK2c,gBAAkBN,QAEpB,MAAVZ,OAAgB,CAChB,IAAMsB,YAActB,OAAOnE,WAAWC,MAAMxyB,OAC5CsyB,UAAa,GACb,IAAK,IAAImC,IAAM,EAAGA,IAAMuD,cAAevD,IACnCnC,UAAWvvB,KAAKkY,KAAK2c,gBAAkBlB,OAAOnE,WAAWC,MAAMiC,QAGzE,MAAO/xB,GACL,KAAIA,aAAapC,gBAeb,MAAMoC,EAbN,GAAI+zB,UAAW,CACXkB,UAAW,EACX,MAGA,IAAMM,WAAav1B,EAAEukB,QAAQoH,MAAM,KAAK,GAClC6J,MAAQ1qB,OAAO6kB,OAAO,6BAA+B4F,WAAa,KACxE,GAAa,MAATC,MAAe,MAAMx1B,EACzBk0B,UAAUqB,YAAc5tB,SAAS6tB,OACjCP,UAAW,EAOvB,IAAKA,SACD,MAIR,IAAMhD,QAAW6C,QAAUD,UAE3BV,WAAW9zB,KAAKw0B,WAChBT,SAAS/zB,KAAKy0B,SACdT,UAAUh0B,KAAK00B,SACfT,UAAUj0B,KAAK20B,SACfT,UAAUl0B,KAAK4xB,SAGnB,IAAM/B,gBAAkB1kB,SAASC,cAAc,OACzC0kB,UAAY3kB,SAASC,cAAc,OACzC0kB,UAAUtB,UAAY,WACtBsB,UAAU1hB,MAAQ,qBAClB,IAAM2hB,cAAgB5kB,SAASC,cAAc,OAEzC2kB,cAAcvB,UAAY,WAC1BuB,cAAc3hB,MAAQ,kCAGtB,IAAK,IAAI4hB,IAAM,EAAGA,IAAM,IAAKA,IAAK,CAC9B,IAAMC,MAAQ9kB,SAASC,cAAc,OAErC,IACI6kB,MAAMtC,UAAoB,GAAPqC,IAAY,IAAMT,WAAW,GAClD,MAAOW,GACLD,MAAMtC,UAAoB,GAAPqC,IAAY,QAAU,MAE7CD,cAAcxhB,YAAY0hB,OAIlC,IAAME,cAAgBhlB,SAASC,cAAc,OAEzC+kB,cAAc3B,UAAY,cAC1B2B,cAAc/hB,MAAQ,kCAGtB,IAAK,IAAI4hB,IAAM,EAAGA,IAAM,IAAKA,IAAK,CAC9B,IAAMC,MAAQ9kB,SAASC,cAAc,OAErC,IACI6kB,MAAMtC,UAAoB,GAAPqC,IAAY,IAAMT,WAAW,GAClD,MAAOW,GACLD,MAAMtC,UAAoB,GAAPqC,IAAY,QAAU,MAE7CG,cAAc5hB,YAAY0hB,OAIpB,MAAV0D,SACA9D,gBAAgBthB,YAAYwhB,eAC5BD,UAAUvhB,YAAY4hB,gBAI1B,IAAM8C,MAAQ9nB,SAASC,cAAc,OACrC6nB,MAAMzE,UAAY,WAClByE,MAAM7kB,MAAQ,iDAEd,IAAIiiB,OAAS,GACPuB,SAAWsC,UAAU,GACrBQ,SAAWV,UAAU,GACrBW,SAAWV,UAAU,GAEvBrC,SAAW,MAAKvB,OAAS,GAE7B,IAAK,IAAIL,IAAM,EAAGA,IAAM4B,WAAY5B,IAAK,CACrC,IAAMkD,OAAS/nB,SAASC,cAAc,OAClCgoB,WAAa,qBACb5uB,KAAKiC,MAAMupB,IAAM0E,UAAY,GAAK,EAC9B1E,IAAM0E,SAAWC,WACjBvB,WAAa,4BAGbpD,IAAM0E,SAAWC,WACjBvB,WAAa,2BAGrBF,OAAO9kB,MAAQ,cAAgBiiB,OAAS,mBAAqBA,OAAS,8BAAgC+C,WACtGH,MAAM1kB,YAAY2kB,QAKtB,OAFApD,UAAUvhB,YAAY0kB,OACtBpD,gBAAgBthB,YAAYuhB,WACrBD,kBAxlCf,8BA2lCI,SAAAzB,iBAAiBxC,UAAW5mB,EAAG6mB,MAAM,gBAE3BuJ,sBAAwB,SAACn3B,EAAOo3B,GACrBx2B,MAATZ,IACAA,EAAQ+G,EAAE/G,OAEEY,MAAZw2B,IACAA,EAAW,SAAC1M,GACRiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAGrD,IAAMq3B,EAAiB,OAAKpL,QAAQ,YAChCqL,EAAYt3B,EAKhB,OAJKq3B,EAAexrB,SAASyrB,KACzBA,EAAY,YAAcA,GAEjBC,wDAA8B,QAAUxwB,EAAEd,KAAMmxB,EAAUC,EAAgBC,IAIrFE,mBAAqB,SAArBA,mBAAsBC,WAAYC,eAE7BlrB,OAAOvN,EAIdw4B,WAAaA,WAAW7uB,QAAO,SAAA7B,GAAC,OAAIkC,MAAMlC,EAAC,QAkB3C,IAfA,IAAM4wB,SAAW,SAAC71B,EAAGmG,GACjB,IADuB,EACjB2vB,EAAO91B,EAAE+F,KAAI,SAAAd,GAAC,OAAIA,KADD,6BAEPkB,GAFO,yBAEZH,EAFY,QAGnB,GAAI8vB,EAAKhvB,QAAO,SAAA7B,GAAC,OAAKA,GAAKe,GAAgBlH,MAATmG,EAAC,KAAsBoF,KAAKC,UAAUrF,EAAC,MAASoF,KAAKC,UAAUtE,EAAC,QAAS9I,OAAS,EAChH,iBAEA44B,EAAK71B,KAAK+F,IAJlB,2BAAmB,IAFI,8BASvB,OAAO8vB,GAGPC,cAAgB,GACdC,sBAAwB,GAC1BC,oBAAsB,KACb,CACT,IAAIC,SAAU,EACVC,sBAAwBH,sBAAsBjwB,KAAI,SAAAd,GAAC,MAAI,OAASA,EAAI,UAAQ4qB,KAAK,KAErFsG,uBAAyB,gFAJhB,2CAKSR,YALT,YAKT,qDAA8B,KAAnB1F,IAAmB,cAE1B,IACI,IAAMmG,OAASje,KAAKge,sBAAwBlG,IAAG,KACjD,MAAOrwB,GACL,KAAIA,aAAapC,gBAiEb,MAAMoC,EAjEuB,qBAC7B,IAAMu1B,EAAav1B,EAAEukB,QAAQoH,MAAM,KAAK,GAClCqE,EAASgG,OAAO9uB,QAAO,SAAA7B,GAAC,OAAIA,EAAC,KAAQkwB,GAAuB,MAATlwB,EAAEgP,OAC3D,GAAI2b,EAAO1yB,OAAS,EAAG,CAEnB84B,sBAAsB/1B,KAAKk1B,GAC3BY,cAAgBF,SAASE,cAAe,CAACnG,EAAO,KAGhD,IADA,IAAIyG,EAAM,EACHA,EAAMT,OAAO14B,QACZmN,KAAKC,UAAUsrB,OAAOS,KAAShsB,KAAKC,UAAUslB,EAAO,MAD/ByG,GAK9B,IAAMC,EAAM,SAAArxB,GAAC,OAAcnG,MAAVmG,EAAE6rB,KAAoB7rB,EAAE6rB,KAAO7rB,GAGhD,GAAqB,MAAjB2qB,EAAO,GAAG3b,KAAsCnV,MAAvB8wB,EAAO,GAAG3b,IAAIoK,MAAoB,CAG3D,IAAI6R,EAAQwF,mBAAmB,CAAC,CAC5Ba,IAAKD,EAAI1G,EAAO,GAAG3b,IAAIoK,OACvBpK,IAAK,OACL2hB,OAAOryB,MAAM8yB,IACjBN,cAAgBF,SAASE,cAAe7F,EAAM,IAC9C+F,oBAAsBJ,SAASI,oBAAqB/F,EAAM,IAC1DA,EAAQwF,mBAAmB,CAAC,CACxBa,IAAKD,EAAI1G,EAAO,GAAG3b,IAAIqK,KACvBrK,IAAK,OACL2hB,OAAOryB,MAAM8yB,IACjBN,cAAgBF,SAASE,cAAe7F,EAAM,IAC9C+F,oBAAsBJ,SAASI,oBAAqB/F,EAAM,IAC1DA,EAAQwF,mBAAmB,CAAC,CACxBa,IAAKD,EAAI1G,EAAO,GAAG3b,IAAIid,MACvBjd,IAAK,OACL2hB,OAAOryB,MAAM8yB,IACjBN,cAAgBF,SAASE,cAAe7F,EAAM,IAC9C+F,oBAAsBJ,SAASI,oBAAqB/F,EAAM,IAC1DA,EAAQwF,mBAAmB,CAAC,CACxBa,IAAKD,EAAI1G,EAAO,GAAG3b,IAAIuiB,MACvBviB,IAAK,OACL2hB,OAAOryB,MAAM8yB,IACjBN,cAAgBF,SAASE,cAAe7F,EAAM,IAC9C+F,oBAAsBJ,SAASI,oBAAqB/F,EAAM,QACvD,CAEH,IAAMA,EAAQwF,mBAAmB,CAAC,CAC9Ba,IAAKD,EAAI1G,EAAO,GAAG3b,KACnBA,IAAK,OACL2hB,OAAOryB,MAAM8yB,IACjB5sB,QAAQC,IAAI,MAAOwmB,GAEnB6F,cAAgBF,SAASE,cAAe7F,EAAM,IAC9C+F,oBAAsBJ,SAASI,oBAAqB/F,EAAM,UAI9D+F,oBAAoBh2B,KAAKk1B,GAEzBa,sBAAsB/1B,KAAKk1B,GAG/B,OADAe,SAAU,EACV,QA9D6B,sBA8D7B,MAMR,GAAIA,QAAS,OA9ER,kDAgFT,IAAIA,QAGJ,MAGJ,MAAO,CAACP,WAAYI,cAAeE,sBAGjCQ,0BAA4B,SAAC5K,EAAW5mB,EAAG6mB,GAS7C,IAAM4K,EAAOtrB,SAASC,cAAc,OAEpC,QAAkBvM,IAAdgtB,EAAKxV,KACL,OAAO+O,EAAEqR,GAGb,IAfsD,EAkBlDC,EAAU,IAlBwC,6BAetC1xB,EAAE/G,MAAM8iB,SAf8B,IAmBtD,2BACI2V,GADyB,QACN,KApB+B,8BAsBtDA,EAAUA,EAAQpzB,MAAM,GAAI,GAAK,IAEjCmzB,EAAK9I,UAAY+I,EAAU,KAE3B,IAAM/N,EAAOxd,SAASC,cAAc,UA4EpC,OA3EAud,EAAKva,MAAL,MAAmB,QACnBua,EAAKgF,UAAY,OACjB8I,EAAKloB,YAAYoa,GAEjBA,EAAKpJ,iBAAiB,SAAS,SAACgS,GAC5B,OAAK5K,UAAU4F,QAAQ,CAAC,gBAAgB,SAAAoK,GAGpC,IAFA,IAAM9xB,EAAM8xB,EAAI,YACZC,EAAO,GACX,MAAgBj2B,OAAO2J,OAAOzF,GAA9B,eAAoC,CAA/B,IAAMM,EAAC,KACF0xB,EAAQC,uEAA2B3xB,EAAG0mB,EAAKkL,SAAUlL,EAAKmL,QAAS,MACzEJ,EAAO,GAAH,mFAAOA,IAAP,2EAAgBC,IACpBrtB,QAAQC,IAAI,OAAQmtB,GAUxB,IAhB4C,EAgBtCK,EAAW,GAhB2B,6BAiB5BL,GAjB4B,IAiB5C,2BAAsB,KAAX5xB,EAAW,QAClB,GAAa,MAATA,EAAEgP,IAAa,MACnBijB,EAASj3B,KAAKgF,IAnB0B,8BAuB5C,IAAMkyB,EAAWzB,mBAAmBwB,EAAUL,GAC9CptB,QAAQC,IAAI,WAAYytB,GAKxB,IAHA,IAAI7gB,EAAOwV,EAAKxV,OAAO/V,MAAMuG,QAAO,SAAA7B,GAAC,MAAc,QAAVA,EAAEd,QAAgB,GAEvDizB,EAAY,GAChB,MAAgBx2B,OAAO2J,OAAOzF,GAA9B,eAAoC,CAA/B,IAAMG,EAAC,KACRmyB,EAAUn3B,KAAKgF,EAAEwqB,WAAW4H,QAAQ/gB,EAAKpY,SAE7Ck5B,EAAYA,EAAUtwB,QAAO,SAAA7B,GAAC,OAASnG,MAALmG,MACpB/H,OAAS,IACnBoZ,EAAO8gB,EAAU,IAGrB,IAAME,EAAYlsB,SAASC,cAAc,OAEnCksB,EAAiBnsB,SAASC,cAAc,OAExCmsB,EAAcpsB,SAASC,cAAc,SAC3CmsB,EAAYjhB,KAAO,OACnBihB,EAAYt5B,MAAQmM,KAAKC,UAAUrF,EAAE/G,OAErC,IAAM0B,EAAI,OAAKovB,oCACXmI,EAAU7gB,GAGRmhB,EAAYrsB,SAASC,cAAc,UACzCosB,EAAU7J,UAAY,gBACtB6J,EAAUjY,iBAAiB,SAAS,SAAAgS,GAChC3F,EAAUU,gBAAgBT,EAAM7mB,EAAEd,KAAMkG,KAAKsR,MAAM6b,EAAYt5B,QAC/DmrB,QAAQjE,WAEZmS,EAAe/oB,YAAYgpB,GAE3BD,EAAe/oB,YAAY5O,GAC3B03B,EAAU9oB,YAAY+oB,GAEtBlO,QAAQ/W,KAAK,CACTlI,MAAO,iCACPmE,KAAM+oB,EACNrqB,QAASwqB,EACTjsB,MAAO,KACPG,OAAQ,QAEb,OAGA0Z,EAAEqR,IAGPgB,mBAAqB,SAAC7L,EAAW5mB,EAAG6mB,GAKtC,IAAI6L,EAAW,KACf,GAAiB74B,MAAbgtB,EAAKxV,KAAmB,CACxB,IAAMxR,EAAMgnB,EAAKxV,OAAO/V,MAAMuG,QAAO,SAAA7B,GAAC,MAAc,QAAVA,EAAEd,QACxCW,EAAI5H,OAAS,IAEby6B,EAAW7yB,EAAI,IAKvB,IAf+C,EAezC4xB,EAAOtrB,SAASC,cAAc,OAE9BusB,EAAS3yB,EAAE/G,MAAM05B,OACjBN,EAAYlsB,SAASC,cAAc,OAGrCsrB,EAAU,IArBiC,6BAsB3BiB,GAtB2B,IAsB/C,2BAA4B,KAAjBC,EAAiB,QACxBlB,GAAWkB,EAAMxZ,MAAQ,KAAOwZ,EAAMvZ,IACpB,GAAduZ,EAAM3G,MACNyF,GAAW,IAAMkB,EAAM3G,KACL,GAAd2G,EAAMrB,OACNG,GAAW,IAAMkB,EAAMrB,OACN,GAAdqB,EAAMrB,OACbG,GAAW,KAAOkB,EAAMrB,MAE5BG,GAAW,MA/BgC,8BAiC/CA,EAAUA,EAAQpzB,MAAM,GAAI,GAAK,IAEjCmzB,EAAK9I,UAAY+I,EAAU,KAE3B,IAAM/N,EAAOxd,SAASC,cAAc,UACpCud,EAAKva,MAAL,MAAmB,QACnBua,EAAKgF,UAAY,OACjB8I,EAAKloB,YAAYoa,GAGjB,IA3C+C,EA2CzC2O,EAAiBnsB,SAASC,cAAc,OAGxCysB,EAAc,GA9C2B,6BA+C/BF,GA/C+B,IA+C/C,2BAAwB,KAAb/U,EAAa,QAEdkV,EAAQ3sB,SAASC,cAAc,OACrC0sB,EAAMtJ,UAAY,WAClBsJ,EAAM1pB,MAAQ,qBACU,iBAAZwU,EAAExE,QAAoBwE,EAAExE,MAAQwE,EAAExE,MAAMyS,MAC9B,iBAAVjO,EAAEvE,MAAkBuE,EAAEvE,IAAMuE,EAAEvE,IAAIwS,MACvB,iBAAXjO,EAAEqO,OAAmBrO,EAAEqO,KAAOrO,EAAEqO,KAAKJ,MAC1B,iBAAXjO,EAAE2T,OAAmB3T,EAAE2T,KAAO3T,EAAE2T,KAAK1F,MAEjD,WAGI,IAFA,IAAMkH,EAAa,GAEV76B,EAAI,EAAGA,EAAI,IAAKA,EAAG,CAExB,IAAM86B,EAAM7sB,SAASC,cAAc,SAC7B6sB,EAAK9sB,SAASC,cAAc,SAGlC,OAFA6sB,EAAG7pB,MAAQ,eACX6pB,EAAG3hB,KAAO,OACFpZ,GACJ,KAAK,EACD+6B,EAAGh6B,MAAQ2kB,EAAExE,MACb4Z,EAAIE,YAAc,QAClB,MACJ,KAAK,EACDD,EAAGh6B,MAAQ2kB,EAAEvE,IACb2Z,EAAIE,YAAc,MAClB,MACJ,KAAK,EACDD,EAAGh6B,MAAQ2kB,EAAEqO,KACb+G,EAAIE,YAAc,OAClB,MACJ,KAAK,EACDD,EAAGh6B,MAAQ2kB,EAAE2T,KACbyB,EAAIE,YAAc,OAG1BH,EAAW/3B,KAAKi4B,GAChBD,EAAIzpB,YAAY0pB,GAChBH,EAAMvpB,YAAYypB,GAEtBH,EAAY73B,KAAK+3B,GACjB,IAAMI,EAAShtB,SAASC,cAAc,OACtC+sB,EAAO/pB,MAAQ,iEACf+pB,EAAO5Y,iBAAiB,SAAS,WAG7B,GAAgB,MAAZmY,EAEA,OAAK/Q,UAAU4F,QAAQ,CAAC,gBAAgB,SAAA6L,GAEhCA,EADgC,YAAhC,gEAAOA,EAASC,aACLD,EAASC,YAETjuB,KAAKsR,MAAM0c,EAASC,aACnC7uB,QAAQC,IAAI,kBAAmB2uB,GAI/B,IADA,IAAIjB,EAAY,GAChB,MAAgBx2B,OAAO2J,OAAO8tB,GAA9B,eAAyC,CAApC,IAAMpzB,EAAC,KACRmyB,EAAUn3B,KAAKgF,EAAEwqB,WAAW4H,QAAQM,EAASz5B,SAEjDk5B,EAAYA,EAAUtwB,QAAO,SAAA7B,GAAC,OAASnG,MAALmG,MACpB/H,OAAS,IACnBy6B,EAAWP,EAAU,IAGzB,IAAMmB,EAAW,OAAKjF,mCAAL,cAAI,2EAAuC0E,EAAWjyB,KAAI,SAAAd,GAAC,OAAIA,EAAE/G,UAA7D,SAAqE,EAAOy5B,KACjGS,EAAOlG,UAAY,GACnBkG,EAAO5pB,YAAY+pB,KACpB,QAEA,CACH,IAAMA,EAAW,OAAKjF,mCAAL,cAAI,2EAAuC0E,EAAWjyB,KAAI,SAAAd,GAAC,OAAIA,EAAE/G,UAA7D,SAAqE,EAAOy5B,KACjGS,EAAOlG,UAAY,GACnBkG,EAAO5pB,YAAY+pB,OAI3BH,EAAOxK,UAAY,uCACnBmK,EAAMvpB,YAAY4pB,GArEtB,GAyEAb,EAAe/oB,YAAYupB,IAlIgB,8BAqI/CT,EAAU9oB,YAAY+oB,GAEtB,IAAME,EAAYrsB,SAASC,cAAc,UA4BzC,OA3BAosB,EAAU7J,UAAY,QACtB6J,EAAUjY,iBAAiB,SAAS,WAChC,IADsC,EAChC/Y,EAAM,CACRmxB,OAAQ,GACRrhB,KAAMtR,EAAE/G,MAAMqY,MAHoB,6BAKrBuhB,GALqB,IAKtC,2BAA8B,KAAnBU,EAAmB,QAC1B/xB,EAAImxB,OAAO33B,KAAK,CACZoe,MAAOma,EAAG,GAAGt6B,MACbogB,IAAKka,EAAG,GAAGt6B,MACXgzB,KAAMsH,EAAG,GAAGt6B,MACZs4B,KAAMgC,EAAG,GAAGt6B,SAVkB,8BAatC2tB,EAAUU,gBAAgBT,EAAM7mB,EAAEd,KAAMsC,GACxC4iB,QAAQjE,WAGZwD,EAAK6P,QAAU,WACXpP,QAAQ/W,KAAK,CACTlI,MAAO,iBACPmE,KAAM+oB,EACNrqB,QAASwqB,EACTjsB,MAAO,KACPG,OAAQ,OAGT0Z,EAAEqR,IAIT9N,KAAOxd,SAASC,cAAc,OAClC,GAAkB,QAAdpG,EAAEyzB,SAAoB,CACtB,IAAIzkB,IAAMhP,EAAE/G,MACQ,iBAAR+V,MAAkBA,IAAa,QAAPA,KACpC2U,KAAO6M,yDAA+B,QAAUxwB,EAAEd,MAAM,SAACykB,GACrDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK+P,WAE9C1kB,UACA,GACW,OAAdhP,EAAEyzB,UAAmC,SAAdzzB,EAAEyzB,UAAqC,kBAAdzzB,EAAEyzB,UAA8C,YAAdzzB,EAAEyzB,SAEpF9P,KAAO6M,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9C+G,EAAE/G,YACF,GACW,SAAd+G,EAAEyzB,UAAqC,QAAdzzB,EAAEyzB,UACb,QAAdzzB,EAAEyzB,UAAoC,OAAdzzB,EAAEyzB,SAE1B9P,KAAO6M,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClD,IAAI9jB,EAAM8jB,EAAK1qB,MACf,IACI4G,EAAMuF,KAAKsR,MAAMiN,EAAK1qB,OACxB,MAAO0B,GACLkF,EAAM8jB,EAAK1qB,MAEf2tB,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMW,KACzCuF,KAAKC,UAAUrF,EAAE/G,aACjB,GAAkB,SAAd+G,EAAEyzB,SACT9P,KAAO8O,mBAAmB7L,UAAW5mB,EAAG6mB,WACrC,GAAkB,gBAAd7mB,EAAEyzB,SAA4B,CAGrC9P,KAAOxd,SAASC,cAAc,QAC9Bud,KAAKgF,UAAY3oB,EAAE/G,MAEnB0qB,KAAOvD,EAAEuD,MACT,IAAMgQ,GAAK,SAAAzqB,GAEP,IACM0qB,EADO/M,KAAKgN,KACErJ,WAAW4H,QACzB0B,EAAcn4B,OAAOsE,KAAK2zB,GAE1BG,EAAWvD,0DAAgC,QAAUxwB,EAAEd,MAAM,SAACykB,GAChEiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9C66B,EAAa9zB,EAAE/G,OAGlB0qB,KAAK,GAAGqQ,WAAWC,aAAaF,EAAS,GAAIpQ,KAAK,KAEtDnqB,KAAKmoB,UAAU4F,QAAQ,CAAC,eAAgBoM,GAAI,CACxCO,WAAYP,GACZnM,QAAS,WAGV,GAAkB,iCAAdxnB,EAAEyzB,SAGT9P,KAAOxd,SAASC,cAAc,QAC9Bud,KAAKgF,UAAY3oB,EAAE/G,MAEnB0qB,KAAOvD,EAAEuD,MACTvD,EAAE+T,QAAQ,6BAA+BtN,KAAKO,QAAQgN,WAAW,SAAAC,GAC7D,IAAMV,EAAK,SAAAzqB,GACP,IAAM6qB,EAAWvD,0DAAgC,QAAUxwB,EAAEd,MAAM,SAACykB,GAChEiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9Co7B,EAA2Br0B,EAAE/G,OAG1BgN,EAASuqB,mDAAyB,QAAUxwB,EAAEd,KAAO,WACvD,SAACykB,IAGGX,yCAAa,yBAA0B,CACnC6Q,KAAMhN,KAAKgN,KACXjrB,OAAQ,CAACie,KAAKgN,KAAKS,aAAczN,KAAKO,QAAQmN,UAAW1N,KAAKO,QAAQoN,MACvE,SAACvR,GACA,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAC5C,IAAMwO,GAAO8C,+DAAWxR,EAAIK,eACTzpB,IAAf83B,EAAKz4B,OAEL,OAAKw7B,aAAa,OAAM/C,GAI5B,OAAKhQ,UAAU4F,QAAQ,CAAC,mBAAmB,SAAAvnB,MACxC,CACC8mB,OAAQ,CACJ6N,SAAUhD,EAAKkC,KACfe,UAAW,UAAY/N,KAAKO,QAAQyN,eAKrD,UAIPlR,KAAK,GAAGqQ,WAAWC,aAAaF,EAAS,GAAIpQ,KAAK,IAClDoQ,EAAS,GAAGC,WAAWzqB,YAAYtD,EAAO,KAE9C,OAAK0b,UAAU4F,QAAQ,CAAC,eAAgBoM,EAAI,CACxCO,WAAYP,EACZnM,QAAS,aAGd,IAAkB,gBAAdxnB,EAAEyzB,UAA4C,aAAdzzB,EAAEyzB,SAAyB,CAClE,IAAIqB,SAAW,KACXC,SAAW,KACT1E,SAAW,SAAC1M,GACdiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAM,CACpC,YAAe41B,SAAS,GAAG77B,MAC3B,SAAY87B,SAAS,GAAG97B,SAchC,OAXe,MAAX+G,EAAE/G,QACF+G,EAAE/G,MAAQ,GACV+G,EAAE/G,MAAM+7B,SAAW,SACnBh1B,EAAE/G,MAAMg8B,YAAc,IAE1BH,SAAWtE,0DAAgC,QAAUxwB,EAAEd,KAAMmxB,SAAUrwB,EAAE/G,MAAMg8B,aAC/EtR,KAAKpa,YAAYurB,SAAS,IAC1BC,SAAW3E,sBAAsBpwB,EAAE/G,MAAM+7B,SAAU3E,UACnD1M,KAAKpa,YAAYwrB,SAAS,IAC1BpR,KAAK6F,UAAUzjB,IAAI,eAEZ4d,KACJ,GAAkB,OAAd3jB,EAAEyzB,SACT9P,KAAO6M,qDAA2B,QAAUxwB,EAAEd,MAAM,SAACykB,GACjDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMoD,SAASqhB,EAAK1qB,UACvD+G,EAAE/G,YACF,GAAkB,gBAAd+G,EAAEyzB,SAA4B,CACrC,IAAMyB,eAAiB17B,KAAK0rB,QAAQ,gBAChCqL,UAAYvwB,EAAE/G,MACbi8B,eAAepwB,SAASyrB,aACzBA,UAAY,gBAAkBA,WAElC5M,KAAO6M,wDAA8B,QAAUxwB,EAAEd,MAAM,SAACykB,GACpDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9Ci8B,eAAgB3E,gBAChB,GAAkB,sBAAdvwB,EAAEyzB,SAAkC,CAC3C,IAAM0B,MAAQ37B,KAAK0rB,QAAQ,sBACvBqL,WAAYvwB,EAAE/G,MACbk8B,MAAMrwB,SAASyrB,cAChBA,WAAY,sBAAwBA,YAExC5M,KAAO6M,wDAA8B,QAAUxwB,EAAEd,MAAM,SAACykB,GACpDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9Ck8B,MAAO5E,iBACP,GAAkB,cAAdvwB,EAAEyzB,SAA0B,CACnC,IAAM2B,aAAe57B,KAAK0rB,QAAQ,cAC9BqL,YAAYvwB,EAAE/G,MACbm8B,aAAatwB,SAASyrB,eACvBA,YAAY,cAAgBA,aAEhC5M,KAAO6M,wDAA8B,QAAUxwB,EAAEd,MAAM,SAACykB,GACpDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9Cm8B,aAAc7E,kBACd,GAAkB,YAAdvwB,EAAEyzB,SACT9P,KAAOyM,4BACJ,IAAkB,QAAdpwB,EAAEyzB,SAGT,OADAjvB,QAAQC,IAAI,oCAAqCzE,GAC1C2jB,KACJ,GAAkB,UAAd3jB,EAAEyzB,UAAkC,YAAVzzB,EAAEd,KAEnC,OAAOykB,KACJ,GAAkB,kBAAd3jB,EAAEyzB,SAET9P,KAAO6M,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9C+G,EAAE/G,YACF,GAAkB,aAAd+G,EAAEyzB,SAAyB,CAGlC,IAAI4B,SAAWr1B,EAAE/G,MACQ,iBAAbo8B,WACRA,SAAWjwB,KAAKsR,MAAM2e,WAC1B1R,KAAO6M,0DAAgC,QAAUxwB,EAAEd,MAAM,SAACykB,GAEtDiD,UAAUjF,UAAU4F,QAAQ,CAAC,mBAAmB,SAAA+N,MAC7C,CACCxO,OAAQuO,aAEbA,eACA,GAAkB,gBAAdr1B,EAAEyzB,SAET9P,KAAO6M,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClD,IAAI9jB,EAAM8jB,EAAK1qB,MACf,IACI4G,EAAMuF,KAAKsR,MAAMiN,EAAK1qB,OACxB,MAAO0B,GACLkF,EAAM8jB,EAAK1qB,MAEf2tB,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMW,KACzCuF,KAAKC,UAAUrF,EAAE/G,aACjB,GAAkB,eAAd+G,EAAEyzB,SAA2B,CACpC,IAAM8B,cAAgB/7B,KAAK0rB,QAAQ,eAC/BqL,YAAYvwB,EAAE/G,MACbs8B,cAAczwB,SAASyrB,eACxBA,YAAY,eAAiBA,aAEjC5M,KAAO6M,wDAA8B,QAAUxwB,EAAEd,MAAM,SAACykB,GACpDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9Cs8B,cAAehF,kBACf,GAAkB,uBAAdvwB,EAAEyzB,SAAmC,CAC5C,IAAM8B,eAAgB/7B,KAAK0rB,QAAQ,uBAC/BqL,YAAYvwB,EAAE/G,MACbs8B,eAAczwB,SAASyrB,eACxBA,YAAY,uBAAyBA,aAEzC5M,KAAO6M,wDAA8B,QAAUxwB,EAAEd,MAAM,SAACykB,GACpDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9Cs8B,eAAehF,kBACf,GAAkB,aAAdvwB,EAAEyzB,SAET9P,KAAO6M,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9C+G,EAAE/G,YACF,GAAkB,YAAd+G,EAAEyzB,SACT9P,KAAO6M,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9CqnB,MAAMkV,cAAex1B,EAAE/G,YACvB,GAAkB,eAAd+G,EAAEyzB,SACT9P,KAAO6M,wDAA8B,QAAUxwB,EAAEd,MAAM,SAACykB,GACpDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9C+G,EAAE2U,QAAS3U,EAAE/G,YACb,GAAkB,YAAd+G,EAAEyzB,SACT9P,KAAO6M,0DAAgC,QAAUxwB,EAAEd,MAAM,SAACykB,GACtDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMykB,EAAK1qB,SAC9C+G,EAAE2U,QAAS3U,EAAE/G,WACb,IAAkB,QAAd+G,EAAEyzB,SAET,OADAjvB,QAAQslB,KAAK,0BAA2B9pB,EAAEyzB,UACnC9P,KACJ,GAAkB,yBAAd3jB,EAAEyzB,SAET,OAAO9P,KACJ,GAAkB,kBAAd3jB,EAAEyzB,SAEL9P,KADW,MAAX3jB,EAAE/G,MACKu3B,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMkG,KAAKsR,MAAMiN,EAAK1qB,UACzDmM,KAAKC,UAAUrF,EAAE/G,QACG,mBAAhB+G,EAAE/G,MAAMqY,MAA6C,WAAhBtR,EAAE/G,MAAMqY,KAC7CkgB,0BAA0B5K,UAAW5mB,EAAG6mB,MAExC4L,mBAAmB7L,UAAW5mB,EAAG6mB,UAEzC,IAAkB,oBAAd7mB,EAAEyzB,SAQT,OAHAjvB,QAAQC,IAAI,gCAAiCzE,GAGtC2jB,KAPPA,KAAO6M,sDAA4B,QAAUxwB,EAAEd,MAAM,SAACykB,GAClDiD,UAAUU,gBAAgBT,KAAM7mB,EAAEd,KAAMkG,KAAKsR,MAAMiN,EAAK1qB,UACzDmM,KAAKC,UAAUrF,EAAE/G,WAOxB,OAAO0qB,KAAK,KAhvDpB,sCAmvDI,SAAyBiD,EAAWC,EAAMC,EAAQnS,GAAS,WACjD8gB,EAAO,CACT7O,UAAiC,iBAAdA,EAAyBA,EAAYA,EAAUJ,QAClEK,KAAMA,EACNC,OAAQA,EACRnS,QAASA,GAEbnb,KAAKk8B,gBAAgB,CAAC,sBAAuB,mBAAoBD,GAC7D,WACI,IACMrT,EAAS,CACX9Q,KAAM,YACNiU,cAAe,mBACfgB,eAAgB,CACZC,QALO,EAAKtF,kBAMZ4F,OAAQ2O,IAIhB,EAAK5P,eAAezD,QAtwDpC,iCA0wDI,WACI5oB,KAAKmoB,UAAU4F,QAAQ,CAAC,2BAA2B,SAAAvnB,MAChD,MA5wDX,mCA+wDI,WACIxG,KAAKmoB,UAAU4F,QAAQ,CAAC,6BAA6B,SAAAvnB,MAClD,MAjxDX,yBAoxDI,WACIxG,KAAKktB,gCAAgCyC,MAAO,GAAI,CAAExC,gBAAgB,MArxD1E,wCAwxDI,WAA6B,WAKzB,GAAIrG,MAAMqV,4BAENn8B,KAAKktB,gCAAgCltB,KAAM,GAAI,CAAEmtB,gBAAgB,SAGrE,GAA+B,MAA3BntB,KAAKonB,mBAAT,CAGA,IAAMgV,EAAoBzvB,SAASC,cAAc,OACjDwvB,EAAkBpM,UAAY,oBAC9BoM,EAAkB3I,UAAY,8FAE9B2I,EAAkBrb,iBAAiB,SAAS,SAAAva,GACxC,EAAK0mB,gCAAgCyC,MAAO,GAAI,CAAExC,gBAAgB,OAGtExgB,SAASmD,KAAKC,YAAYqsB,GAE1Bp8B,KAAKonB,mBAAqBgV,KA/yDlC,0CAkzDI,WACmC,MAA3Bp8B,KAAKonB,qBACKpnB,KAAKonB,mBAAmBoT,WAChCvqB,YAAYjQ,KAAKonB,oBACnBpnB,KAAKonB,mBAAqB,QAtzDtC,sCA2zDI,WACIpnB,KAAKmoB,UAAU4F,QAAQ,CAAC,iBAAiB,SAAAvnB,MACtC,MA7zDX,sCA60DI,WACIxG,KAAKmoB,UAAU4F,QAAQ,CAAC,iBAAiB,SAAAvnB,MACtC,MA/0DX,6CAq0DI,WACIogB,EAAE,sBAAsByV,SAt0DhC,6CAy0DI,WACIzV,EAAE,sBAAsB0V,SA10DhC,wBAi2DI,WACIt8B,KAAKu8B,eAAc,SAAA/1B,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,MAA0C,iBAAnBtR,EAAEulB,mBAl2DlE,2BAq2DI,WACI/rB,KAAKu8B,eAAc,SAAA/1B,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,MAA0C,oBAAnBtR,EAAEulB,mBAt2DlE,2BAy2DI,WACI/rB,KAAKu8B,eAAc,SAAA/1B,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,MAA0C,qBAAnBtR,EAAEulB,mBA12DlE,2CA62DI,WAAgC,aACxByQ,EAAQx8B,KAAKgoB,aAAa2D,KAAKC,kBAAiB,SAAAplB,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,MAA0C,iBAAnBtR,EAAEulB,iBAErF0Q,EAAQ,GAHc,6BAIZD,GAJY,IAI5B,2BAAuB,KAAZh2B,EAAY,QACnBi2B,EAAMj7B,KAAKgF,EAAEoiB,OAAOmE,eAAeyB,YALX,8BAQ5B,IAR4B,iBAQvB,IAAMhpB,EAAC,KACR,EAAK+2B,eAAc,SAAA/1B,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,OACT,iBAAnBtR,EAAEulB,eAAuD,oBAAnBvlB,EAAEulB,gBACzCvlB,EAAEoiB,OAAOmE,eAAeyB,WAAahpB,MAH7C,MAAgBi3B,EAAhB,eAAuB,KAOvBD,EAAQx8B,KAAKgoB,aAAa2D,KAAKC,kBAAiB,SAAAplB,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,MAA0C,iBAAnBtR,EAAEulB,kBACjFhP,SAAQ,SAAAvW,GAAC,OAAIA,EAAE2O,OAAOunB,qBAAqBl2B,QA73DzD,6BAi4DI,WAaIxG,KAAKgoB,aAAaC,SAASsE,KAAK,6BAA8B,IAG9D,IAAMoQ,EAAW7V,MAAM8V,2BAA2B58B,KAAKgoB,aAAa2D,KAAM,mBACpEkR,EAAW/V,MAAM8V,2BAA2B58B,KAAKgoB,aAAa2D,KAAM,qCACpEmR,EAAWhW,MAAM8V,2BAA2B58B,KAAKgoB,aAAa2D,KAAM,kCACpEoR,EAAiBjW,MAAM8V,2BAA2B58B,KAAKgoB,aAAa2D,KAAM,iBAC1EqR,EAAYlW,MAAM8V,2BAA2B58B,KAAKgoB,aAAa2D,KAAM,oBACrEsR,EAAqBnW,MAAM8V,2BAA2B58B,KAAKgoB,aAAa2D,KAAM,oBAKpF,GAAiC,GAA7BsR,EAAmBx+B,OAAa,CAGhC,IAAMiO,EAAI1M,KAAK0nB,kBACfuV,EAAmBz7B,KAAK,CACpBonB,OAAQ,CACJ9Q,KAAM,YACNiU,cAAe,mBACfgB,eAAgB,CACZC,QAAStgB,MAQzB,IADA,IACA,MADkB,CAACiwB,EAAUK,EAAWH,EAAUC,EAAUC,EAAgBE,GAC5E,eAA2B,CAAtB,IAAsB,+BAAf,MAAe,IACvB,2BAAmB,KAARz2B,EAAQ,QACQnG,MAAnBmG,EAAEulB,eACFvlB,EAAEkmB,UAHa,+BAU3B,IArDc,gCAqDJ,2EAAI1sB,KAAKgoB,aAAa2D,KAAKQ,eArDvB,IAsDd,2BAAmB,KAAR3lB,EAAQ,QACfxG,KAAKgoB,aAAa2D,KAAK1b,YAAYzJ,IAvDzB,8BA4Dd,IAAM02B,EAAgBl9B,KAAKgoB,aAAamV,kBAAkB,CACtDrlB,KAAM,QACNsU,QAAS,KAEPgR,EAAgBp9B,KAAKgoB,aAAamV,kBAAkB,CACtDrlB,KAAM,QACNsU,QAAS,KAEPiR,EAAar9B,KAAKgoB,aAAamV,kBAAkB,CACnDrlB,KAAM,QACNsU,QAAS,KAEPkR,EAAiBt9B,KAAKgoB,aAAamV,kBAAkB,CACvDrlB,KAAM,QACNsU,QAAS,KAEPmR,EAAiBv9B,KAAKgoB,aAAamV,kBAAkB,CACvDrlB,KAAM,QACNsU,QAAS,KAGPoR,EAAUx9B,KAAKgoB,aAAamV,kBAAkB,CAChDrlB,KAAM,MACNsU,QAAS,KAGPqR,EAAaz9B,KAAKgoB,aAAamV,kBAAkB,CACnDrlB,KAAM,MACNsU,QAAS,KAIPsR,EAAa19B,KAAKgoB,aAAamV,kBAAkB,CACnDrlB,KAAM,SACNsU,QAAS,KAGbpsB,KAAKgoB,aAAa2D,KAAKvY,SAASsqB,GAEhCA,EAAWtqB,SAASoqB,GACpBE,EAAWtqB,SAASqqB,GAGpBD,EAAQpqB,SAAS8pB,GACjBM,EAAQpqB,SAASgqB,GACjBI,EAAQpqB,SAASiqB,GAEjBI,EAAWrqB,SAASkqB,GACpBG,EAAWrqB,SAASmqB,GAEpBR,EAAehgB,SAAQ,SAAAvW,GAAC,OAAI62B,EAAWjqB,SAAS5M,EAAEoiB,WAClDqU,EAAmBlgB,SAAQ,SAAAvW,GAAC,OAAI+2B,EAAenqB,SAAS5M,EAAEoiB,WAC1DoU,EAAUjgB,SAAQ,SAAAvW,GAAC,OAAI82B,EAAelqB,SAAS5M,EAAEoiB,WACjDiU,EAAS9f,SAAQ,SAAAvW,GAAC,OAAI42B,EAAchqB,SAAS5M,EAAEoiB,WAC/CkU,EAAS/f,SAAQ,SAAAvW,GAAC,OAAI42B,EAAchqB,SAAS5M,EAAEoiB,WAC/C+T,EAAS5f,SAAQ,SAAAvW,GAAC,OAAI02B,EAAc9pB,SAAS5M,EAAEoiB,WAI/C,cAAgB,CAACwU,EAAeF,EAAeG,EAAYE,GAA3D,eAA4E,CAAvE,IAAM/2B,EAAC,KACqB,GAAzBA,EAAE2lB,aAAa1tB,QACf+H,EAAEkmB,SAKV1sB,KAAKgoB,aAAaC,SAASsE,KAAK,6BAA8B,MA//DtE,2BAkgEI,SAAcoR,GAKV39B,KAAKgoB,aAAaC,SAASsE,KAAK,6BAA8B,IAC9D,IAAMqR,EAAkB59B,KAAKgoB,aAAa2D,KAAKC,iBAAiB+R,GAElC,GAA1BC,EAAgBn/B,QAChBuM,QAAQslB,KAAK,mCAEjB,IAXqB,EAWfuN,EAAgB79B,KAAKgoB,aAAamV,kBAAkB,CACtDrlB,KAAM,QACNgmB,SAAU,KAbO,6BAgBLF,GAhBK,IAgBrB,2BAAiC,KAAtBp3B,EAAsB,QACvBoiB,EAASpiB,EAAEoiB,OACjBpiB,EAAE2O,OAAOlF,YAAYzJ,GACrBq3B,EAAczqB,SAASwV,IAnBN,8BAsBrB5oB,KAAKqsB,eAAewR,GAEpB79B,KAAKgoB,aAAaC,SAASsE,KAAK,6BAA8B,MA1hEtE,4BA8hEI,SAAejtB,EAAKiL,GAAgC,IAA1BwzB,IAA0B,yDAAdC,EAAc,wDAC1Cv3B,GAAO,2EAAInH,GACXoN,EAAI,CACN,IAAOqxB,EACP,KAAQC,EACR,KAAQzzB,EACR,MAAS,EACT,OAAU9D,EAAK3B,MAAM,SAEiBzE,IAAtCL,KAAKqnB,oBAAoB5gB,EAAK,IAC9BzG,KAAKqnB,oBAAoB5gB,EAAK,IAAM,CAACiG,GAErC1M,KAAKqnB,oBAAoB5gB,EAAK,IAAIjF,KAAKkL,KA1iEnD,qBA8iEI,SAAQ+b,GACJ,GAAiB,GAAbA,EAAGwV,QAA6B,OAAVxV,EAAGnpB,IACzB,cAAiB6C,OAAO2J,OAAO9L,KAAKqnB,qBAApC,eAA0D,CAArD,IAAqD,+BAA7C,MAA6C,IACtD,2BAAoB,QACdhV,MAAQ,EAFwC,kCAhjEtE,uBAwjEI,SAAUoW,GACN,cAAiBtmB,OAAO2J,OAAO9L,KAAKqnB,qBAApC,eAA0D,CAArD,IAAqD,+BAA7C,MAA6C,IACtD,2BAAoB,KAAT3a,EAAS,QAChB,GAAiB,GAAb+b,EAAGwV,QAIP,GAAIvxB,EAAE2F,MAAQ,GAEN3F,EAAEwxB,OAAOxxB,EAAE2F,MAAQ,IAAMoW,EAAGnpB,MAC5BoN,EAAE2F,OAAS,EACP3F,EAAE2F,MAAQ3F,EAAEwxB,OAAOz/B,QAQnB,OANAiO,EAAEnC,OACFke,EAAG8B,kBACH9B,EAAG+B,sBAGHxqB,KAAKm+B,QAAQ,CAAEF,QAAQ,EAAO3+B,IAAK,aAd3CoN,EAAE2F,MAAQ,GAHoC,+BAwB1D,IAAM+rB,EAAKp+B,KAAKqnB,oBAAoBoB,EAAGnpB,KACvC,QAAWe,IAAP+9B,EAAJ,CAEA,IA5BU,EA4BN1/B,EAAI,EA5BE,6BA6BM0/B,GA7BN,IA6BV,2BAAoB,KAAT1xB,EAAS,QAChB,GAAIA,EAAEqxB,KAAOtV,EAAGwV,QAAUvxB,EAAEsxB,MAAQvV,EAAG4V,QAAS,CAE5C,GAAI3xB,EAAEwxB,OAAOz/B,OAAS,EAAG,CAErBiO,EAAE2F,OAAS,EACXrH,QAAQC,IAAI,eAAgBjL,KAAKqnB,oBAAoBoB,EAAGnpB,KAAKZ,MAC3DA,EACF,SAEJgO,EAAEnC,OAEFke,EAAG8B,kBACH9B,EAAG+B,iBAEHxqB,KAAKm+B,QAAQ,CAAEF,QAAQ,EAAO3+B,IAAK,UAErCZ,GA9CI,kCAxjElB,8BA0mEI,WACIsB,KAAKmnB,iBAAmB,IAAImX,+CAAct+B,MAC1CA,KAAKmnB,iBAAiBoX,6BACtBvV,eAAewV,QACfvyB,OAAO+c,eAAerB,QAAQ,gBAAiB3nB,KAAKmnB,iBAAiBsX,aACrEz+B,KAAK0+B,gBA/mEb,wBAknEI,WACI,IAAMC,EAAU1yB,OAAO+c,eAAevB,QAAQ,iBAC9CznB,KAAKmnB,iBAAmB,IAAImX,+CAAct+B,KAAM2+B,GACjC,MAAXA,GAA8Bt+B,MAAXs+B,IAEnB1yB,OAAO+c,eAAerB,QAAQ,gBAAiB3nB,KAAK4+B,oBAAoBH,aACxEz+B,KAAK0+B,iBAxnEjB,qBA4nEI,WAEI,OAAO1+B,KAAK4+B,sBA9nEpB,+BAioEI,WACI,OAAO5+B,KAAKmnB,mBAloEpB,uBAqoEI,SAAU0X,GACN7+B,KAAKgoB,aAAe6W,IAtoE5B,sBAyoEI,WACI,OAAO7+B,KAAK+mB,YA1oEpB,6BA6oEI,WACI,IACM8F,GADO,IAAIzY,MACG0qB,UAAUr5B,WAAaO,KAAK+4B,SAASh2B,QAAQ,IAAItD,WAAazF,KAAKsnB,kBAAkB7hB,WAMzG,QAJEzF,KAAKsnB,kBAEPtc,QAAQ5E,YAAkB/F,IAAXwsB,EAAsB,uBAE9BA,IArpEf,sCAwpEI,SAAyBmS,GAIrB,IAFA,IAAMC,EAA+B,iBAAVD,GAAsB/D,+DAAW+D,GAASA,EAErE,MAAgB78B,OAAOsE,KAAKw4B,EAAUC,WAAtC,eAAkD,CAA7C,IAAM14B,EAAC,KAEF/G,EAAQw/B,EAAUC,UAAU14B,GAClCxG,KAAKm/B,eAAe1/B,EAAO+G,MA/pEvC,4BAmqEI,SAAe6zB,GAAqB,WAAf30B,EAAe,uDAAR,OAIlBmnB,EAAS,kBAAM,EAAKnF,mBAE1B2S,EAAK7L,UAAY9oB,EAEjB,IAAM05B,EAAmB,WACrB,IAAMC,EAAkB,CACpB1zB,MAAOjG,EACPoS,KAAM,YACNiU,cAAe,gBACfgB,eAAgB,CAAEC,QAASH,IAAUyS,UAAWjF,EAAM7L,UAAW9oB,IAErE,EAAK2mB,eAAegT,IAExBr/B,KAAKk8B,gBAAgB,CAAC,YAAa,gBAAiBtwB,KAAKC,UAAUwuB,GAAO+E,GAE1E,IAAMG,EAAsB,WACxB,IAAMC,EAAqB,CACvB7zB,MAAO,iBACPmM,KAAM,YACNiU,cAAe,mBACfgB,eAAgB,CAAEC,QAASH,IAAU4S,KAAMpF,EAAM7L,UAAW9oB,IAEhE,EAAK2mB,eAAemT,IAEGn/B,MAAvBg6B,EAAKqF,iBACL10B,QAAQC,IAAI,sBAAuBjL,KAAKmoB,WACxCnoB,KAAKk8B,gBAAgB,CAAC,eAAgB,mBAAoB7B,EAAMkF,MAjsE5E,6BAqsEI,SAAgB7/B,GAAO,WAUnBM,KAAKk8B,gBAAgB,CAAC,aAAc,iBAAkBx8B,GAT5B,WACtB,IAAMigC,EAAmB,CACrBh0B,MAAO,QACPmM,KAAM,YACNiU,cAAe,iBACfgB,eAAgB,CAAErtB,MAAOA,IAE7B,EAAK2sB,eAAesT,QA7sEhC,gCAktEI,SAAmBC,GAAqB,WAAXl6B,EAAW,uDAAJ,GAET,iBAAZk6B,IACPA,EAAWh0B,KAAKC,UAAU+zB,IAI9B,IAAM/S,EAAS7sB,KAAK0nB,kBAEdmY,EAAuB,WACzB,IAAMC,EAAsB,CACxBhoB,KAAM,SACNsU,QAAS,CAAC,CACNzgB,MAAe,IAARjG,EAAa,kBAAoB,wBAA0BA,EAAO,IACzEoS,KAAM,YACNiU,cAAe,oCACfgB,eAAgB,CAAEC,QAASH,EAAQkT,SAAUr6B,EAAMs6B,cAAeJ,MAG1E,EAAKvT,eAAeyT,IAExB9/B,KAAKk8B,gBAAgB,CAAC,gBAAkBx2B,GAAO,oCAC3Ck6B,EAAUC,GAEd,IAAMI,EAAsB,WACxB,IAAMH,EAAsB,CACxBhoB,KAAM,SACNsU,QAAS,CAAC,CACNzgB,MAAO,UACPmM,KAAM,YACNiU,cAAe,iCACfgB,eAAgB,CAAEC,QAASH,EAAQkT,SAAUr6B,MAGrD,EAAK2mB,eAAeyT,IAExB9/B,KAAKk8B,gBAAgB,CAAC,eAAiBx2B,GAAO,iCAC1Ck6B,EAAUK,KAvvEtB,iCA2vEI,SAAoBL,GAChB,IAAIv8B,EAAIu8B,EACU,iBAANv8B,IACRA,EAAIuI,KAAKsR,MAAM0iB,IAGnB,cAAgBz9B,OAAOsE,KAAKpD,GAA5B,eAAgC,CAA3B,IAAMmD,EAAC,KACF2jB,EAAO9mB,EAAEmD,GACfxG,KAAKkgC,mBAAmB/V,EAAM3jB,MAnwE1C,6CAuwEI,SAAgC25B,GACoB,WADHC,EACG,uDADc,GAAIjlB,EAClB,uDAD4B,GAC5EklB,EAAgD,4DAAnChgC,EAAWigC,EAAwB,4DAAXjgC,EAkB/Bo/B,EAAOW,EAAeX,KACtBc,EAAaH,EAAeG,WAC5BC,EAAUJ,EAAeI,QAEzBC,EAAU,QACHpgC,IAATo/B,IACItkB,EAAQgS,gBACRsT,EAAQj/B,KAAK,eAEjBi/B,EAAQj/B,KAAK,oBAGDnB,IAAZmgC,GAAuBC,EAAQj/B,KAAK,WAOxC,IAAMk/B,EAAe,SAAC50B,GAQlB,GAPYzL,MAARo/B,IAAmB3zB,EAAM,WAAiB2zB,GAC5Bp/B,MAAdkgC,IAAyBz0B,EAAM,WAAiBy0B,GACrClgC,MAAXmgC,IAAsB10B,EAAM,QAAc00B,GAEpBngC,MAAtB8a,EAAQwlB,YACRxlB,EAAQwlB,WAAW70B,IAEC,IAApBqP,EAAQylB,QAAZ,CAGA,IAAIC,EAA+BxgC,MAAzByL,EAAM,YACZg1B,EAAOh1B,EAAM,WAGjB,IAAK+0B,GAAkB,KAAXC,EAAK,GAAW,CACxB,IAAMC,GAAK9F,+DAAW6F,GACtBh1B,EAAM,YAAkB,GACxBA,EAAM,YAAgBi1B,EAAG/P,WAAWtrB,MAAQo7B,EAE5CD,GAAM,EAYV,GATIA,GAEqB,iBADrBC,EAAOh1B,EAAM,eAETg1B,GAAO7F,+DAAW6F,IAG1BX,EAAgBhY,UAAU4F,QAAQ,CAAC,iBAAiB,gBAGhC,IAAhB5S,EAAQ6lB,IAAc,CACtB,IAAMC,EAAU,GACZ9lB,EAAO,YACP8lB,EAAO,UAAgB9lB,EAAO,WAElC8lB,EAAO,YAAkB,EACzBA,EAAO,aAAmBJ,EAC1BI,EAAO,WAAiBn1B,EAAM,WAC9B,EAAKo1B,gBAAgBf,EAAiBhlB,EAAQgmB,QAASL,EAAMh1B,EAAM,QAAaA,EAAM,WAAgBm1B,EAASZ,EAAYC,OACxH,CACH,IAAInG,EAAK,SAAChC,GACN,EAAK+D,gBAAgB,CAAC,mBAAoB,oCAAqC/D,GAAM,SAACiJ,GAClF,EAAKC,oBAAoBlJ,QAGF,IAA3Bhd,EAAO,cACPgf,OAAK95B,GAGT,EAAKihC,QAAQnB,EAAiBW,EAAMh1B,EAAM,QAAaA,EAAM,WACzD,CACIy1B,WAAYpH,EACZqH,aAAcX,GACfR,EAAYC,MAK3BH,EAAgBhY,UAAU4F,QAAQ0S,EAASC,EAAc,CAAE1S,QAAS,IAAK0M,WAAYgG,MAz2E7F,qBA42EI,SAAQP,EAAiBV,GAC2B,WADrBe,EACqB,4DADXngC,EAAWohC,EACA,4DADuBphC,EAAW8a,EAClC,uDAD4C,GAC5FklB,EAAgD,4DAAnChgC,EAAWigC,EAAwB,4DAAXjgC,EAMjCgpB,EAAc,IACW,IAAzBlO,EAAQqmB,cACRnY,EAAc,CAAE,MAAQqY,+DAAejC,KAE5B,KAAWtkB,EAAQwmB,WAE9BtY,EAAc,CAAE,KAAQoW,GAGbp/B,MAAXmgC,IACAnX,EAAW,QAAcmX,GAEDngC,MAAxBohC,IACApY,EAAW,WAAiBoY,GAEhCpY,EAAW,UAAgBrpB,KAAKupB,cAChC,IAAMqY,EAAiB,OACvBpY,yCAAa,cAAgBoY,EAAiB,gBAAiBvY,GAAa,SAACI,GACzE,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAE5C,IAAMkY,GAAO5G,+DAAWxR,EAAIK,UAC5B,GAAqBzpB,MAAjBwhC,EAAI,MAEJ,EAAK3G,aAAaiF,EAAiB0B,QAChBxhC,IAAfigC,GACAA,QACD,CAEH,EAAKwB,wBAEL,IAAMz+B,GAAI43B,+DAAWxR,EAAIK,UACzB,EAAKiY,yBAAyBtY,EAAIK,eACPzpB,IAAvB8a,EAAQomB,WACR,EAAKF,oBAAoBh+B,EAAC,WAE1B8X,EAAQomB,WAAWl+B,EAAC,gBAELhD,IAAfggC,GACAA,WAz5ExB,0BA+5EI,SAAaF,EAAiBp9B,GAC1B,IAAIi/B,EAASj/B,EAAM,MAMnB,GALI,cAAeA,IACfi/B,GAAU,OAASj/B,EAAOk/B,WAE9BjiC,KAAKkiC,gBAAgBF,GAEE,iBAAXA,EAAZ,CAPkC,mCAYdA,GAZc,IAYlC,2BAA4B,KAAjBtiC,EAAiB,QAEL,gBAAfA,EAAMoY,KAGNqoB,EAAgBhY,UAAU4F,QAAQ,CAAC,cAAc,SAAA+N,MAE7C,CACIxO,OAAQ5tB,EACRsuB,QAAS,MAGjBhjB,QAAQslB,KAAK,UAAW5wB,IAxBE,oCAQ9BsL,QAAQslB,KAAK,UAAW0R,KAv6EpC,gCA67EI,SAAmB7B,GAEf,IAAMtT,EAAS7sB,KAAK0nB,kBAEdya,EAAsB,YAActV,EAGpCuV,EAAkB,CACpBz2B,MAAO,WACPmM,KAAM,YACNiU,cAAe,oBACfgB,eAAgB,CAAEC,QAASH,IAE/B7sB,KAAKqsB,eAAe+V,GAGpBpiC,KAAKktB,gCAAgCltB,KAAM,GAAI,CAAEghC,KAAK,EAAMG,QAASgB,EAAqBhV,gBAAgB,MA78ElH,2BAg9EI,WAAgB,WACZntB,KAAKqiC,2BACL,IAGMhZ,EAAc,CAChBC,UAJctpB,KAAKupB,gBAMvBC,yCAAa,+BAAgCH,GAAa,SAACI,GACvD,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAC5C,IAAM2Y,EAAK12B,KAAKsR,MAAMuM,EAAIK,UAC1B9e,QAAQC,IAAI,aAAcq3B,GAE1B,IAAMC,EAAS,WACX,EAAKC,4BAGT,EAAKra,UAAU4F,QAAQ,CAAC,kBAAkB,SAAAvnB,GACtC+7B,MACD,CACCjV,OAAQgV,EACR5H,WAAY6H,UAr+EhC,6BA2+EI,WAQIviC,KAAKqsB,eAPU,CACXvU,KAAM,YACNiU,cAAe,qBACfgB,eAAgB,GAChBphB,MAAO,sBAh/EnB,8BAs/EI,SAAiBw0B,GAObngC,KAAKqsB,eANW,CACZvU,KAAM,YACNiU,cAAe,qBACfpgB,MAAO,wBA1/EnB,+BAggFI,SAAkBw0B,GAOdngC,KAAKqsB,eANW,CACZvU,KAAM,YACNiU,cAAe,uBACfpgB,MAAO,8BApgFnB,2BA0gFI,SAAcw0B,GAOVngC,KAAKqsB,eANW,CACZvU,KAAM,YACNiU,cAAe,oBACfpgB,MAAO,eA9gFnB,6BAohFI,SAAgBw0B,EAAiBgC,EAAqB1C,GAE1B,WAFgCe,EAEhC,4DAF0CngC,EAClEohC,EACwB,4DADDphC,EAAW8a,EACV,uDADoB,GAAIklB,EACxB,4DADqChgC,EAC7DigC,EAAwB,4DAAXjgC,EAITgpB,EAAc,IACW,IAAzBlO,EAAQqmB,cACRnY,EAAc,CAAE,MAAQqY,+DAAejC,KAC5B,KAAWtkB,EAAQwmB,WAE9BtY,EAAc,CAAE,KAAQoW,GAEbp/B,MAAXmgC,IACAnX,EAAW,QAAcmX,GAEDngC,MAAxBohC,IACApY,EAAW,WAAiBoY,GAEhCzhC,KAAKyiC,wBAAwB5iC,MAAK,SAAC6iC,GAC/B,IAAMpZ,EAAY,EAAKC,cAEvB,GADAF,EAAW,UAAgBC,EACkB,OAAzCoZ,EAAkB,gBAClBrZ,EAAW,eAAgBhpB,OACxB,GAA6C,WAAzCqiC,EAAkB,gBACzBrZ,EAAW,UAAgB,CAAC,eACzB,IAA6C,QAAzCqZ,EAAkB,gBAMzB,OAHAx2B,MAAM,wBACNlB,QAAQtL,MAAM,+BAAgCgjC,EAAkB,2BAC7CriC,IAAfigC,GAA0BA,KAJ9BjX,EAAW,UAAgB,CAAC,UAAW,YAAa,QAAS,WAQjE,IAAIsZ,EAAMD,EAAmB,qBACT,iBAARC,IACRA,EAAM/2B,KAAKsR,MAAMylB,IAErBtZ,EAAW,WAAiBsZ,EAAIr7B,KAAI,SAAAd,GAAC,OAAIsC,SAAStC,MAClD6iB,EAAW,YAAkB,GAG7BG,yCAAa,sBAA0CH,GAAa,SAACI,GACjE,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAE5C,IAAItjB,EAAMojB,EAAIK,SACM,iBAARzjB,IAAkBA,EAAMuF,KAAKsR,MAAM7W,IAC3CA,EAAG,OAEH,EAAKu8B,iCAAiCzC,EAAiBgC,EAAqB7Y,QACzDjpB,IAAfigC,GACAA,UACkBjgC,IAAfggC,GACPA,aA1kFxB,8CAglFI,SAAiCF,EAAiBgC,EAAqB7Y,GAAkC,WAAvBuZ,EAAuB,4DAAXxiC,EACpFgpB,EAAc,GACpBA,EAAW,UAAgBC,EAC3BD,EAAW,UAAgBwZ,EAC3B,IAAMjB,EAAiB,OACvBpY,yCAAa,cAAgBoY,EAAiB,eAAgBvY,GAAa,SAACI,GACxE,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAExCF,EAAIK,SAASgZ,SAAS,MACtB,EAAKC,MAAM,kBAAmB,yBAA0B,QAExD,EAAKA,MAAM,kBAAmB,aAAc,SAGhD,IAAMC,EAAUvZ,EAAIK,SAASmZ,OAAOxZ,EAAIyZ,WACxC,EAAKlb,aAAaC,SAASsE,KAAK4V,EAAqBa,GACrDvZ,EAAIyZ,UAAYzZ,EAAI0Z,aAAa1kC,OAErC,GAAuB,IAAnBgrB,EAAIC,WAAkB,CACtB,IAAMsZ,EAAUvZ,EAAIK,SAASmZ,OAAOxZ,EAAIyZ,WACxC,EAAKlb,aAAaC,SAASsE,KAAK4V,EAAqBa,GACrDvZ,EAAIyZ,UAAYzZ,EAAI0Z,aAAa1kC,aArmFjD,mBA0mFI,SAAMkN,EAAO4O,GAA8E,IAAxEzC,EAAwE,uDAAjE,OAAQkW,EAAyD,uDAA/C,IAAOoV,EAAwC,4DAAjC/iC,EAAWgjC,EAAsB,4DAAXhjC,EACtE0iC,EAAQO,cAAc5/B,OAAO,CAC/BiI,MAAOA,EACP4O,KAAMA,EACNzC,KAAMA,EACNsrB,KAAMA,EACNpV,QAASA,EACTqV,SAAUA,IAGdC,cAAcxqB,WAAWiqB,EAAM/H,GAAc,IAAVhN,KApnF3C,sBAunFI,SAASmS,EAAiBK,QAGNngC,IAAZmgC,IACAA,EAAU,IAEd,IAAMpT,EAAYptB,KA8BlBmgC,EAAgBhY,UAAU4F,QAAQ,CAAC,aAAc,gBAAgB,SAAClW,GAE9D,IAAI0rB,GAAY,EACWljC,MAAvBwX,EAAI,aACJ0rB,GAAY,EACZ1rB,EAAOA,EAAI,YACXA,EAAOjM,KAAKsR,MAAMrF,IAElBA,EAAOA,EAAI,WApCO,SAAC2rB,EAAWC,EAAeF,GACjD,IAAI9D,EAEAA,EAAO+D,EAiBXpW,EAAUkU,QAAQnB,EAAiBV,EAAMe,EAR7BngC,UAQ6C,CACrDkhC,WAPO,SAACpJ,GACR/K,EAAU8O,gBAAgB,CAAC,mBAAoB,oCAAqC/D,GAAM,SAACiJ,GACvFhU,EAAUiU,oBAAoBlJ,OAMlCqJ,cAAe+B,IAgBnBG,CAAkB7rB,EAAMxX,EAAWkjC,QArqF/C,6BA8qFI,SAAgBI,EAAiBC,EAAaC,EAAgBC,GAC1D,IAAIC,EAAe,KACf/jC,KAAKgoB,aAAa2D,OAClBoY,EAAe/jC,KAAKgoB,aAAa2D,KAAKC,kBAAiB,SAAAplB,GAAC,MAAsB,aAAjBA,EAAEoiB,OAAO9Q,MAClEtR,EAAEulB,eAAiB6X,MAEvBG,GAAgBA,EAAatlC,OAAS,EACtCuB,KAAK4+B,oBAAoB7Q,QAAQ4V,GAAiB,SAACxL,EAAM6L,MAErD,CACIhW,QAAS,KACTV,OAAQuW,EACRI,WAAY,OAGpBH,EAAcD,KA7rF1B,sBAqsFI,SAASK,EAAO35B,EAAMyjB,GAElB,QAAyB3tB,IAArBL,KAAKinB,YAEL,OAAO1c,EAEX,IAAM6iB,EAAYptB,KAQlB,OAPkB,gBACuBK,IAAjC+sB,EAAUnG,YAAYid,IACtBrrB,aAAauU,EAAUnG,YAAYid,IAEvC9W,EAAUnG,YAAYid,GAASprB,WAAWvO,EAAMyjB,OAhtF5D,0BAuMI,WACI,IAAM3nB,EAAMmhB,aAAaC,QAAQ,mBACjC,OAAW,MAAPphB,EAAoB,CAAC,aACbuF,KAAKsR,MAAM7W,KA1M/B,yBA6MI,SAAmB89B,GACf3c,aAAaG,QAAQ,kBAAmB/b,KAAKC,UAAUs4B,MA9M/D,kBA8TI,SAAYtsB,GACR,OAAOusB,KAAKC,OAAOC,OAAOC,OAAO,UAAWC,WAAWp/B,KAAKyS,OA/TpE,iCAk1DI,SAA2B/U,GAA2B,MAArB2hC,EAAqB,uDAAR,SAAAj+B,GAAC,OAAIA,GACzCwB,EAAM,GADsC,6BAElClF,EAAKqpB,cAF6B,IAElD,2BAAmC,KAAxB3lB,EAAwB,QAE/BwB,EAAIxG,KAAJ,MAAAwG,GAAG,2EAAShI,KAAK0kC,oBAAoBl+B,EAAGi+B,MAJM,8BAOlD,OAAOz8B,EAAIK,OAAOo8B,KAz1D1B,wCA41DI,SAAkC3hC,EAAMipB,GAEpC,OAAOjpB,EAAK8oB,kBADO,SAAAplB,GAAC,MAAqB,aAAjBA,EAAEoiB,OAAO9Q,MAAuBtR,EAAEulB,eAAiBA,OA71DnF,yBAstFI,WACI,IAAM4Y,EAAQnd,aAAaC,QAAQ,0BACnC,OAAc,OAAVkd,EACO,SAEJA,IA3tFf,yBA8tFI,WACI,MAAO,aAAe7d,MAAM8d,gBA/tFpC,uBAkuFI,WACI,OAAOhe,EAAEie,UAAU,0BAA4B/d,MAAM8d,cAAgB,SAnuF7E,sBAsuFI,SAAgBl/B,GACZ8hB,aAAaG,QAAQ,yBAA0BjiB,KAvuFvD,uCA0uFI,WAEI,MAAiE,QAA1D8hB,aAAaC,QAAQ,oCA5uFpC,0CA+uFI,SAAoCqd,GAC5BA,EACAtd,aAAaG,QAAQ,iCAAkC,QAEvDH,aAAaG,QAAQ,iCAAkC,WAnvFnE,6BAuvFI,SAAuBmd,GACfA,EACAtd,aAAaG,QAAQ,qBAAsB,QAE3CH,aAAaG,QAAQ,qBAAsB,WA3vFvD,0BA+vFI,WAKI,MAAa,SADHH,aAAaC,QAAQ,0BAnwFvC,U,oECTaI,EAAb,WAEI,WAAYe,IAAQ,eACD,OAAXA,KACAA,EAAS,IACFhZ,MAAQiY,EAAU,WAEN,iBAAXe,IACRA,EAAShd,KAAKsR,MAAM0L,IAGxB5oB,KAAK+kC,iBAAmB,KACxB/kC,KAAKglC,QAAUpc,EACf5oB,KAAKilC,iBAAiBrc,EAAOhZ,OAE7B5P,KAAKklC,oBAAsB,GACR7kC,MAAfuoB,EAAOuc,OACPnlC,KAAKklC,oBAAsBtc,EAAOuc,MAjB9C,0CAmEI,SAAY56B,GACRvK,KAAK+kC,iBAAmBx6B,IApEhC,wBAuEI,WACiC,MAAzBvK,KAAK+kC,kBACL/kC,KAAK+kC,iBAAiB/kC,QAzElC,mBA6EI,WACIA,KAAKilC,iBAAiBjlC,KAAKolC,YA9EnC,8BAiFI,SAAiBC,GAGb,IAAIC,EAAa34B,SAAS44B,eAAe,yBACrCryB,GAAS,EACK,MAAdoyB,GAAoCjlC,MAAdilC,IAEtBpyB,GAAS,GADToyB,EAAa34B,SAASC,cAAc,UAEzBouB,GAAK,wBAChBsK,EAAWxtB,KAAO,YAGtBwtB,EAAWnW,UAAYkW,EAElBnyB,GACDvG,SAAS64B,KAAKz1B,YAAYu1B,GAG9BtlC,KAAKylC,eAnGb,sBAsGI,SAASC,EAAUC,GAEf,OADA3lC,KAAKklC,oBAAoBQ,GAAYC,EAC9B3lC,OAxGf,qBA0GI,SAAQ4lC,GACJ,IAAMriB,EAAIsE,EAAW5Y,KAAK22B,GAE1B,OADA5lC,KAAKklC,oBAAoB,eAAiB3hB,EACnCvjB,OA7Gf,sBAgHI,WACI,OAAO4L,KAAKC,UAAU7L,KAAKglC,WAjHnC,oBAoHI,WAGI,IAFA,IAAIa,EAAQ,GAEZ,MAAgB1jC,OAAOoM,QAAQvO,KAAKklC,qBAApC,eAA0D,CAArD,IAAM1+B,EAAC,KACRq/B,GAASr/B,EAAE,GAAK,KAAOA,EAAE,GAAK,IAGlC,IAAIwB,EAAM,uBASV,OARAA,GAAO69B,EACP79B,GAAO,IAIPA,GAAO,kBACPA,GAAO69B,GACA,MAnIf,wBAuII,WACI,MAAO,CACHj2B,MAAO5P,KAAKolC,SACZD,KAAMnlC,KAAKklC,uBA1IvB,mCA8II,SAAsBY,GAMlB,IAAMC,EAAIle,EAAWme,mBAAmB,OAASF,GAE3CG,EAAMF,EAAE,oBACRG,EAAKH,EAAC,WACRE,GAAKjmC,KAAKmmC,SAAS,mBAAoBF,GACvCC,GAAIlmC,KAAKmmC,SAAS,aAAcD,EAAK,eACzClmC,KAAKmmC,SAAS,QAASJ,EAAC,OAExB/lC,KAAKilC,iBAAiBjlC,KAAKolC,aA5JnC,iCAqBI,SAA0BgB,GACtB,IAAMjc,EAAOxd,SAASC,cAAc,OACpCud,EAAK6F,UAAYoW,EACjBjc,EAAKva,MAAQ,uBACbjD,SAASmD,KAAKC,YAAYoa,GAE1B,IAAMva,EAAQhE,KAAKsR,MAAMtR,KAAKC,UAAUI,OAAOo6B,iBAAiBlc,KAGhE,OAFAxd,SAASmD,KAAKG,YAAYka,GAEnBva,IA9Bf,mBAkCI,WACI,MAAO,CACH,UAAW,WAAY,QACvB,QAAS,aAAc,YAAa,SAAU,SAAU,SAAU,YAAa,UAC/E,UAAW,mBAtCvB,kBA0CI,SAAYg2B,GACR,OAAQA,GAEJ,IAAK,UAAW,MAAO,iBACvB,IAAK,WAAY,MAAO,uDACxB,IAAK,QAAS,MAAO,kCAGrB,IAAK,QAAS,MAAO,+BACrB,IAAK,aAAc,MAAO,oCAC1B,IAAK,YAAa,MAAO,uCACzB,IAAK,SAAU,MAAO,+BACtB,IAAK,SAAU,MAAO,qDACtB,IAAK,SAAU,MAAO,6BACtB,IAAK,YAAa,MAAO,wCACzB,IAAK,UAAW,MAAO,8BAGvB,IAAK,UAAW,MAAO,oCACvB,IAAK,gBAAiB,MAAO,sCAE7B,QAAS,KAAM,iCA/D3B,qBA+JI,WAWI,MAPkB,2DAEG/d,EAAW5Y,KAAK,SAFnB,4BAnK1B,M,mlCCEO,IAAMqvB,EAAb,WACI,WAAY3O,GAA+B,IAAxB2W,EAAwB,4DAAXjmC,GAAW,eACvCL,KAAKumC,OAAS5W,EAEV3vB,KAAKy+B,YADL6H,QACmB3W,EAAMjI,kBAEN4e,EAEvBtmC,KAAKwmC,QACLxmC,KAAKymC,UAAY,KACjBzmC,KAAK0mC,QAAU,GACf1mC,KAAK2mC,QAAU,GAEf3mC,KAAK4mC,WAAa,GAElB5mC,KAAKisB,gBAAkB,GAEvBjsB,KAAK6mC,MAAQ,KAjBrB,yDAoBI,WAEI7d,eAAe8d,WAAW,8BAtBlC,wCAyBI,WACI,IAAIC,EAAQ/d,eAAevB,QAAQ,4BAMnC,OALa,MAATsf,EACQ,GAEAn7B,KAAKsR,MAAM6pB,KA9B/B,sCAmCI,WAEI,OADc/mC,KAAKgnC,6BACN1/B,KAAI,SAAAd,GAAC,OAAIA,EAAE,QArChC,yCAwCI,SAA4BuB,GACxB,IAAMg/B,EAAQ/mC,KAAKgnC,6BAGnBhe,eAAerB,QAAQ,2BAA4B/b,KAAKC,UAAUk7B,EAAMjiC,MAAM,EAAGiD,KAEjF/H,KAAK+tB,QAAQ,CAAC,eAAe,SAAAvnB,GAAC,OAAIA,IAAG,MA9C7C,0BAiDI,SAAaw4B,EAAOiI,GAMhB,IAAMF,EAAQ/mC,KAAKgnC,6BACnBD,EAAMvlC,KAAK,CAACylC,EAAyBjI,IACrChW,eAAerB,QAAQ,2BAA4B/b,KAAKC,UAAUk7B,MAzD1E,gCA4DI,SAAmBrhC,GACf,IAAMuG,EAASjM,KAAKknC,yBAAyBxhC,GAAM,GACnD1F,KAAKumC,OAAOla,eAAepgB,GAG3BjM,KAAKumC,OAAOve,aAAaC,SAASsE,KAAK,mBAAqB7mB,KAjEpE,sCAoEI,SAAyBA,GAAqB,MAAfgnB,IAAe,yDACpCyX,EAAOnkC,KAAKmnC,uBACZC,EAAW,GAEXC,EAAO,GAJ6B,IAM1BlD,GAN0B,IAM1C,2BAAsB,KAAX39B,EAAW,QACZ8gC,EAAQ9gC,EAAE,GACV6L,EAAQ7L,EAAE,GAEZ6L,EAAM2a,UAAYtnB,GAGlB2hC,EAAK7lC,KAAK,CAAC8lC,EAAOj1B,IAEdqa,GAGA0a,EAAS5lC,KAAK,CAAC8lC,EAAOj1B,KAI1B+0B,EAAS5lC,KAAK,CAAC8lC,EAAOj1B,KAtBY,8BA2B1CrS,KAAKksB,qBAAqBkb,GAE1Bp8B,QAAQ5E,OAAuB,IAAhBihC,EAAK5oC,OAAc,0BAClC,IAAMuJ,EAAMq/B,EAAK,GAGXze,EAAS,CACX9Q,KAAM,YACNiU,cAAe/jB,EAAI,GACnB+kB,eAAgB/kB,EAAI,IAGxB,OAAO4gB,IA3Gf,kCA8GI,SAAqBwe,GACjBpnC,KAAKisB,gBAAkBmb,EACvBpe,eAAerB,QAAQ3nB,KAAKy+B,YAAc,sBAAuB7yB,KAAKC,UAAU7L,KAAKisB,oBAhH7F,oCAmHI,WACIjsB,KAAKisB,gBAAkB,GAEvBjD,eAAerB,QAAQ3nB,KAAKy+B,YAAc,sBAAuB7yB,KAAKC,UAAU7L,KAAKisB,oBAtH7F,oCAyHI,SAAuBF,EAAe1Z,GAClCrS,KAAKisB,gBAAkBjsB,KAAKmnC,uBAC5BnnC,KAAKisB,gBAAgBzqB,KAAK,CAACuqB,EAAe1Z,IAE1C,IACI2W,eAAerB,QAAQ3nB,KAAKy+B,YAAc,sBAAuB7yB,KAAKC,UAAU7L,KAAKisB,kBACvF,MAAO9qB,GACL6J,QAAQtL,MAAR,4CAA2DyB,GAC3D6nB,eAAewV,WAjI3B,kCAqII,WACI,IAAIn4B,EAAM2iB,eAAevB,QAAQznB,KAAKy+B,YAAc,uBAKpD,MAJqB,iBAATp4B,IACRA,EAAMuF,KAAKsR,MAAM7W,IAGT,OAARA,EACO,GAEJA,IA9If,yBAiJI,SAAYkhC,GAER,OADAv8B,QAAQ5E,OAA2B,MAApBpG,KAAKy+B,YAAqB,oBAClCz+B,KAAKy+B,YAAc8I,IAnJlC,4BAsJI,SAAezrB,EAAOkf,GAClB,IAAMwM,EAAMxnC,KAAKumC,OAAOve,aAAaC,SAE/BmF,EAAYptB,KAWZstB,EAAS,CAACttB,KAAKooB,YAAYtM,GAVtB,SAACggB,GACR,IAAMz1B,EAAM+mB,EAAUsZ,QAAQ1L,GAAIlf,GAC9BzV,aAAezH,MACfwuB,EAAUsZ,QAAQ1L,GAAIlf,GAAOta,KAAKs6B,GAC3Bz1B,aAAelE,OACtBA,OAAOwxB,OAAOvG,EAAUsZ,QAAQ1L,GAAIlf,GAAQggB,GAE5C1O,EAAUsZ,QAAQ1L,GAAIlf,GAASggB,GAGM97B,MAC7CwnC,EAAItf,GAAJ,MAAAsf,EAAUla,GAEVttB,KAAK4mC,WAAW5L,GAAIx5B,KAAK8rB,KAvKjC,2BA0KI,SAAc0N,GACV,IADc,EACRwM,EAAMxnC,KAAKumC,OAAOve,aAAaC,SADvB,IAEEjoB,KAAK4mC,WAAW5L,IAFlB,IAEd,2BAAqC,KAA1Bx0B,EAA0B,QACjCghC,EAAIC,OAAJ,MAAAD,GAAG,OAAWhhC,KAHJ,qCAKPxG,KAAK4mC,WAAW5L,KA/K/B,mBAmLI,cAnLJ,wBAgOI,SAAWnjB,GACP,IAAM6vB,EAAO,IAAIC,KAAK,CAAC9vB,GAAO,CAC1BC,KAAM,eAWV,OANmB,OAAf9X,KAAK6mC,OACL56B,OAAO27B,IAAIC,gBAAgB7nC,KAAK6mC,OAGpC7mC,KAAK6mC,MAAQ56B,OAAO27B,IAAIE,gBAAgBJ,GAEjC1nC,KAAK6mC,QA7OpB,kBAgPI,WAAO,WAEH7mC,KAAK+tB,QAAQ,CAAC,gBAAgB,SAAAvnB,GAC1B,IAAI6zB,EAAO7zB,EAAEqzB,YACTkO,EAAW,KACM,iBAAT1N,GACR0N,EAAW5lC,OAAOsE,KAAKD,EAAEqzB,aAAa,GACtCQ,EAAOqH,eAAev/B,OAAO2J,OAAOtF,EAAEqzB,aAAa,KAGnDkO,EADiB9M,WAAWZ,GACRrJ,WAAWtrB,KAEnCqiC,GAAY,QAEZ,IAAMC,EAAOr7B,SAASC,cAAc,KACpCo7B,EAAKr4B,aAAa,WAAYo4B,GAC9BC,EAAKC,KAAO,EAAKC,WAAW7N,GAC5B1tB,SAASmD,KAAKC,YAAYi4B,GAE1B/7B,OAAO4V,uBAAsB,WACzB,IAAM/F,EAAQ,IAAIC,WAAW,SAC7BisB,EAAK5rB,cAAcN,GACnBnP,SAASmD,KAAKG,YAAY+3B,WAtQ1C,qBA2QI,SAAQ7D,EAAMd,GAAwB,IAAdloB,EAAc,uDAAJ,GAOxB9U,EAAM,IAAIi4B,EAAct+B,KAAKumC,OAAQvmC,KAAKy+B,aAChD,OAAOp4B,EAAI8hC,eAAehE,EAAMd,EAAUloB,KAnRlD,4BAsRI,SAAegpB,EAAMd,GAAwB,IAAdloB,EAAc,uDAAJ,GAOrCnb,KAAKymC,UAAYpD,EACjB,IAAM/V,EAASnS,EAAQmS,OACjB8a,EAAQ,KAAOpoC,KAAKumC,OAAO7e,kBAEjC1nB,KAAK0mC,QAAQ0B,GAAS,GACtBpoC,KAAK4mC,WAAWwB,GAAS,GAZgB,UAazBjE,GAbyB,IAazC,2BAAsB,KAAX39B,EAAW,QAClBxG,KAAKqoC,eAAe7hC,EAAG4hC,GACvBpoC,KAAKumC,OAAOve,aAAaC,SAASsE,KAAKvsB,KAAKooB,YAAY,QAAU5hB,GAAI8mB,EAAQttB,OAfzC,8BAkBzC,IAAMotB,EAAYptB,KACZsoC,EAAgB,IAClBta,EAAU7S,EAAQ6S,QAEtBhuB,KAAK2mC,QAAQyB,GAASG,aAAY,WAC9B,IADoC,EAChCC,GAAU,EADsB,IAGpBrE,GAHoB,IAGpC,2BACI,KADkB,WACP/W,EAAUsZ,QAAQ0B,IAAS,CAClCI,GAAU,EACV,OAN4B,8BASpC,IAAKA,EAAS,CACVC,cAAcrb,EAAUuZ,QAAQyB,IAChChb,EAAUsb,cAAcN,GACxBhb,EAAUuZ,QAAQyB,GAAS,KAC3B,IAAM/hC,EAAM+mB,EAAUsZ,QAAQ0B,GAE9B,cADOhb,EAAUsZ,QAAQ0B,GAClBhb,EAAUqZ,UAAUpgC,EAAK8U,EAAQ8oB,YACrB,OAAZjW,IACPA,GAAWsa,IACI,IAEXG,cAAcrb,EAAUuZ,QAAQyB,IAChChb,EAAUsb,cAAcN,GACE/nC,MAAtB8a,EAAQuf,YACRvf,EAAQuf,WAAWtN,EAAUsZ,QAAQ0B,IAEzChb,EAAUuZ,QAAQyB,GAAS,YACpBhb,EAAUsZ,QAAQ0B,MAGlCE,MAzUX,mBAuLI,SAAY3Y,EAAOgZ,GACf,IAAMC,EAAQtK,EAAcuK,eAAeF,GAErC3gC,EAAM,IAAIs2B,EAAc3O,EAAOiZ,EAAMtC,YAoB3C,OAdA3W,EAAM3H,aAAahD,UAGnBgE,eAAerB,QAAQ,aAAc/b,KAAKC,UAAU+8B,EAAM/wB,OAG1DmR,eAAerB,QAAQ,gBAAiB3f,EAAIy2B,aAG5CzV,eAAerB,QAAQ,2BAA4B/b,KAAKC,UAAU+8B,EAAME,YAGxE78B,OAAO88B,SAASC,SAEThhC,IA9Mf,4BAiNI,SAAsB2gC,GAClB,IAAMC,EAAQphB,aAAaC,QAAQ,WAAakhB,GAChD,GAAa,MAATC,EACA,KAAM,qBAEV,OAAOh9B,KAAKsR,MAAM0rB,KAtN1B,8BAyNI,WACI,IAAMviC,EAAMmhB,aAAaC,QAAQ,kBACjC,OAAW,MAAPphB,EACO,GACJuF,KAAKsR,MAAM7W,OA7N1B,M,qECHa2gB,EAAb,WACI,aAA+B,IAAnBiiB,EAAmB,uDAAJ,IAAI,eAC3BjpC,KAAKkpC,gBAAkBD,EACvBjpC,KAAKmpC,QAAU,GAHvB,mCAMI,WAEInpC,KAAKkpC,gBAAkBj9B,OAAOub,aAAaC,QAAQ,4BACnDznB,KAAKmpC,QAAUl9B,OAAOub,aAAaC,QAAQ,4BATnD,mBAYI,WAEIxb,OAAOub,aAAaG,QAAQ,2BAA4B3nB,KAAKkpC,iBAC7Dj9B,OAAOub,aAAaG,QAAQ,yBAA0B3nB,KAAKmpC,WAfnE,oBAkBI,SAAOC,EAAS3pC,GACZO,KAAKmpC,QAAQC,EAAQhY,KAAK,MAAQ3xB,IAnB1C,wBAsBI,WACI,OAAOO,KAAKmpC,SAAW,KAvB/B,2BA0BI,WACI,OAAOnpC,KAAKmpC,UA3BpB,0BA8BI,WACInpC,KAAKmpC,QAAU,KA/BvB,oBAkCI,WACI,OAAOnpC,KAAKkpC,oBAnCpB,M,glCCCO,IAAMG,EAAb,WAEI,WAAYC,EAAOC,GAAY,2BAC3BvpC,KAAKwpC,OAASF,EACdtpC,KAAKypC,WAAaF,EAClBvpC,KAAK0pC,UAAY,GAEjB1pC,KAAKypC,WAAWzZ,UAAUzjB,IAAI,yBAE9BvM,KAAKypC,WAAW1oB,iBAAiB,SAAS,SAAA0H,GAAM,UAC5B,EAAKihB,WADuB,IAC5C,2BAAgC,KAArBljC,EAAqB,QACL,QAAnBA,EAAEoJ,MAAMC,SACRrJ,EAAEoJ,MAAMC,QAAU,KAClB,EAAK45B,WAAWzZ,UAAUtD,OAAO,eAGjClmB,EAAEoJ,MAAMC,QAAU,OAClB,EAAK45B,WAAWzZ,UAAUzjB,IAAI,eARM,kCATxD,4CAuBI,SAAco9B,GACV3pC,KAAK0pC,UAAUloC,KAAKmoC,OAxB5B,KA8BaC,EAAb,WACI,cAAc,eAEV5pC,KAAK6pC,OAHb,mCAMI,WACI7pC,KAAKwpC,OAAS78B,SAASC,cAAc,SACrC5M,KAAK8pC,OAASn9B,SAASC,cAAc,SACrC5M,KAAK+pC,OAASp9B,SAASC,cAAc,SAErC5M,KAAKwpC,OAAOz5B,YAAY/P,KAAK8pC,QAC7B9pC,KAAKwpC,OAAOz5B,YAAY/P,KAAK+pC,QAE7B/pC,KAAKgqC,eAAgB,IAd7B,sBAiBI,SAAS7f,GACLA,EAAKpa,YAAY/P,KAAKwpC,UAlB9B,wBAqBI,WAAuB,2BAATS,EAAS,yBAATA,EAAS,gBACnBjqC,KAAKkqC,SAAWD,EAEhBjqC,KAAK8pC,OAAOrW,UAAY,GAExB,IALmB,EAKbrE,EAAKziB,SAASC,cAAc,MALf,IAMH5M,KAAKkqC,UANF,IAMnB,2BAA+B,KAApB1jC,EAAoB,QACrB2jC,EAAKx9B,SAASC,cAAc,MACf,iBAAPpG,EACR2jC,EAAGhb,UAAY3oB,EAGf2jC,EAAGp6B,YAAYvJ,GAEnB4oB,EAAGrf,YAAYo6B,IAdA,8BAiBnB,OADAnqC,KAAK8pC,OAAO/5B,YAAYqf,GACjBA,IAtCf,oBAyCI,WAAmB,2BAAT6a,EAAS,yBAATA,EAAS,gBAKf,IAHA,IAAM5jC,EAAM4jC,EAEN7a,EAAKziB,SAASC,cAAc,MAClC,MAAgBvG,EAAhB,eAAqB,CAAhB,IAAMG,EAAC,KACF4jC,EAAKz9B,SAASC,cAAc,MACf,iBAAPpG,EACR4jC,EAAGjb,UAAY3oB,EAGf4jC,EAAGr6B,YAAYvJ,GAEnB4oB,EAAGrf,YAAYq6B,GAInB,OADApqC,KAAK+pC,OAAOh6B,YAAYqf,GACjBA,IA1Df,gCA6DI,WACIpvB,KAAKwpC,OAAO55B,MAAMC,QAAU,OAC5B7P,KAAKgqC,eAAgB,IA/D7B,8BAkEI,WACIhqC,KAAKwpC,OAAO55B,MAAMC,QAAU,KAC5B7P,KAAKgqC,eAAgB,IApE7B,8BAuEI,WACQhqC,KAAKgqC,cACLhqC,KAAKqqC,mBAGLrqC,KAAKsqC,uBA5EjB,yBAgFI,SAAYC,GACRvqC,KAAKwpC,OAAOxZ,UAAYua,MAjFhC,M,urCC9BO,IAAMC,EAAb,WAEI,WAAYnP,GAAoB,IAAbxjB,EAAa,uDAAN,MAAM,eAC5B7X,KAAKyqC,OAASpP,EACdr7B,KAAK0qC,MAAQ,KACb1qC,KAAKymB,MAAQ5O,EACb7X,KAAK2qC,UAAY,GAEjB3qC,KAAK4qC,aAAe,KACpB5qC,KAAK6qC,gBAAkB,KAT/B,oCAYI,WAAU,OAAO7qC,KAAKyqC,SAZ1B,0BAaI,SAAaK,GAAK9qC,KAAK+qC,YAAcD,IAbzC,uBAcI,WAAc,YAAyBzqC,IAArBL,KAAK+qC,YAAkC/qC,KAAKq7B,QAAqBr7B,KAAK+qC,cAd5F,kBAeI,WAAS,OAAO/qC,KAAKymB,QAfzB,sBAgBI,WAAa,OAAOzmB,KAAK2qC,YAhB7B,oBAiBI,WAAW,OAAO3qC,KAAK0qC,QAjB3B,sBAmBI,SAASM,GAAM,UACKhrC,KAAK8Q,YADV,IACX,2BAAiC,KAAtBtK,EAAsB,QAC7B,GAAIwkC,EAAKxkC,GAAI,OAAOA,EAEpB,IAAMH,EAAMG,EAAEykC,SAASD,GACvB,GAAW,MAAP3kC,EAAa,OAAOA,GALjB,8BAOX,OAAO,OA1Bf,2BA6BI,WACIrG,KAAK2qC,UAAY,KA9BzB,kBAiCI,WAEI,IADA,IAAIO,EAAKlrC,KACU,MAAZkrC,EAAGR,OACNQ,EAAKA,EAAGR,MAEZ,OAAOQ,IAtCf,6BAyCI,WACI,OAAOlrC,KAAKwlC,OAAO2F,iBAAgB,SAAA3kC,GAAC,OAAIA,EAAE4kC,iBA1ClD,6BA6CI,WAA4B,MAAZ7nB,EAAY,uDAAR,SAAA/c,GAAC,OAAIA,GAEfwB,EAAM,CAACub,EAAEvjB,OAFS,IAIRA,KAAK8Q,YAJG,IAIxB,2BAAiC,KAAtBtK,EAAsB,QAC7BwB,EAAIxG,KAAJ,MAAAwG,GAAG,OAASxB,EAAE2kC,gBAAgB5nB,MALV,8BAQxB,OAAOvb,IArDf,kBA0DI,WAA2B,IAAtBqjC,EAAsB,4DAAXhrC,EACR2H,EAAM,QACO3H,IAAbgrC,IACAA,EAAW,SAAAC,GAAa,MAAO,CAAE,KAAQA,EAAQF,YAAa,OAAUE,EAAQzzB,UAGpF,IADA,IAAIyzB,EAAUtrC,KACU,MAAjBsrC,EAAQZ,OAAe,CAC1B,IAAMvpC,EAAIkqC,EAASC,GACL,cAAVnqC,EAAEuE,OAEFsC,EAAM,CAAC7G,GAAJ,eAAU6G,KAEjBsjC,EAAUA,EAAQZ,MAGtB,OAAO1iC,IAzEf,qBA4EI,SAAQqzB,GAAkC,IAA3BxjB,EAA2B,uDAApB,KAAMsD,EAAc,uDAAJ,GAc9BowB,EAAW,IAAIf,EAAcnP,EAAOxjB,GAUxC,OATA0zB,EAASb,MAAQ1qC,KACqBK,MAAlC8a,EAAQqwB,yBACRD,EAAWpwB,EAAQqwB,uBAAuBD,EAAUvrC,KAAK8Q,WAAWxJ,KAAI,SAAAd,GAAC,OAAIA,EAAE60B,aAEhDh7B,MAA/B8a,EAAQswB,sBACRF,EAAWpwB,EAAQswB,oBAAoBF,EAAUvrC,KAAK0rC,oBAE1DH,EAASb,MAAQ1qC,KACjBA,KAAK2qC,UAAUnpC,KAAK+pC,GACbA,IApGf,wBAuGI,SAAWzzB,EAAM6zB,GAGD,YAAR7zB,EACA9X,KAAK4qC,aAAee,EAGpB3gC,QAAQ5E,QAAO,EAAO,QAAU0R,EAAO,iBA9GnD,+BAkHI,SAAkBrV,GACdzC,KAAK6qC,gBAAkBpoC,IAnH/B,4BAsHI,WAAmB,OAAOzC,KAAK6qC,kBAtHnC,sBAwHI,SAASe,GACoB,MAArB5rC,KAAK4qC,cACL5qC,KAAK4qC,aAAa5qC,KAAM4rC,OA1HpC,KAkIaC,EAAb,WACI,WAAYC,IAAiB,eACzB9rC,KAAK+rC,MAAQD,EACb9rC,KAAKinB,YAAc,KAH3B,4CAMI,SAAcxkB,GACVzC,KAAKinB,YAAcxkB,IAP3B,4BAeI,SAAe0S,GAAqC,IAA7B4c,EAA6B,uDAArB,EAAG1E,EAAkB,4DAAXhtB,EAE/BirC,OAAmBjrC,IAATgtB,EAAqBrtB,KAAK+rC,MAAQ1e,EAE5C2e,EAAWr/B,SAASC,cAAc,MAClCq/B,EAAet/B,SAASC,cAAc,QAC5Cq/B,EAAa9c,UAAYmc,EAAQjQ,QACjC2Q,EAASE,OAAOD,GAEhB,IAAME,EAAax/B,SAASC,cAAc,MAC1Cu/B,EAAWnc,UAAUzjB,IAAI,aACzB4/B,EAAWnc,UAAUzjB,IAAI,qBAEzB,IAAM6/B,EAAc,WAChBD,EAAWnc,UAAUqc,OAAO,qBAC5Bf,EAAQgB,SAAS,IAEfC,EAAiB,WACnBjB,EAAQgB,SAAS,IAEjBE,EAAoBJ,EACpBK,EAAuBL,EAEH,MAApBpsC,KAAKinB,cACLulB,EAAoBxsC,KAAKinB,YAAYylB,SAAS,iBAAkBN,EAAa,KAC7EK,EAAuBzsC,KAAKinB,YAAYylB,SAAS,iBAAkBH,EAAgB,KAEvFP,EAASjrB,iBAAiB,QAASyrB,GAEnCR,EAASjrB,iBAAiB,cAAc,WACpCuqB,EAAQgB,SAAS,MAErBN,EAASjrB,iBAAiB,cAAc,WACpCuqB,EAAQgB,UAAU,MAGtBN,EAASjrB,iBAAiB,WAAY0rB,GAEtCnB,EAAQqB,kBAAkBX,GAG1BG,EAAWD,OAAOF,GAElB,IAAMl7B,EAAWw6B,EAAQx6B,WACzB,GAAuB,GAAnBA,EAASrS,YAIR,WAEeqS,GAFf,IAED,2BAA0B,KAAftL,EAAe,QACtBxF,KAAK4sC,eAAeT,EAAYpa,EAAQ,EAAGvsB,IAH9C,+BAML2P,EAAO+2B,OAAOC,OArEtB,K,8gCCjIO,IAAMU,EAAb,WACI,WAAYld,EAAOmd,EAAcz6B,IAAO,eACpCrS,KAAK2vB,MAAQA,EACb3vB,KAAK+sC,UAAYD,EACjB9sC,KAAKgtC,cAAgB36B,EAErBrS,KAAKgtB,QAAU3a,EAAM2a,QACD3sB,MAAhBL,KAAKgtB,UACLhtB,KAAKgtB,QAAUhtB,KAAK2vB,MAAMjI,kBAC1B1nB,KAAKitC,YAAY,CAAEjgB,QAAShtB,KAAKgtB,WAErChtB,KAAKktC,SAAW,KACQ7sC,MAApBgS,EAAMi0B,YAA+C,MAApBj0B,EAAMi0B,YAA0C,QAApBj0B,EAAMi0B,aACnEtmC,KAAKktC,SAAW,IAAI5O,IAAct+B,KAAK2vB,MAAOtd,EAAMi0B,aAGxDtmC,KAAKmtC,iBAAmB,GACxBntC,KAAKotC,wBAA0B,GAE/BptC,KAAKqtC,kBAAmB,EAnBhC,sCAsBI,WAEI,OADAriC,QAAQ5E,OAAwB,MAAjBpG,KAAKktC,SAAkB,mBAC/BltC,KAAKktC,WAxBpB,gBA2BI,SAAGxnC,EAAMmS,GAAsC,IAAhCy1B,EAAgC,wDACrCC,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SAE7BqF,EAAS,CAAC5nB,EAAMmS,GACtB01B,EAAGrlB,GAAH,MAAAqlB,EAASjgB,GACTttB,KAAKmtC,iBAAiB3rC,KAAK8rB,GAEvBggB,GAGAttC,KAAKwtC,UAAU9nC,GAAM,SAACc,GAAD,OAAOqR,EAAKrR,QArC7C,uBA0CI,SAAUd,EAAMmS,GAGZ,IAAMyV,EAAS,CAAC5nB,EAAMmS,GACtB7X,KAAKotC,wBAAwB5rC,KAAK8rB,KA9C1C,sCAiDI,WAGI,IAHuB,EAGjBigB,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SAHZ,IAIPjoB,KAAKotC,yBAJE,IAIvB,2BAA8C,KAAnC5mC,EAAmC,QAC1C+mC,EAAG9F,OAAH,MAAA8F,GAAE,OAAW/mC,KALM,8BAOvBxG,KAAKotC,wBAA0B,KAxDvC,qBA2DI,WAEIpiC,QAAQC,IAAI,aAAcjL,MAE1B,IAJM,EAIAutC,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SAJ7B,IAKUjoB,KAAKmtC,kBALf,IAKN,2BAAuC,KAA5B3mC,EAA4B,QACnC+mC,EAAG9F,OAAH,MAAA8F,GAAE,OAAW/mC,KANX,8BAQNxG,KAAKmtC,iBAAmB,KAnEhC,mBAsEI,WAMIniC,QAAQC,IAAI,UAAWjL,MAEvBA,KAAKmoB,UAAUslB,uBAAuBztC,KAAK+sC,UAAU/H,QAAQjZ,cAAe/rB,KAAK0tC,YAGjF,IAXI,EAWEH,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SAX/B,IAYiBjoB,KAAKotC,yBAZtB,IAYJ,2BAAmD,KAAxC9f,EAAwC,QAC/CigB,EAAGrlB,GAAH,MAAAqlB,GAAE,OAAOjgB,KAbT,iCAtEZ,yBAuFI,SAAYnF,GAAS,WACI,MAAjBnoB,KAAKktC,WACLltC,KAAKktC,SAAW/kB,GAGpBnoB,KAAK+sC,UAAUY,YAAY,CAAE,WAAc3tC,KAAKktC,SAAS9kB,YAAY,MAErEpoB,KAAKkoB,GAAG,WAAaloB,KAAK0tC,WAAW1gB,SAAS,SAAA8O,GACrC,EAAKuR,kBAEN,EAAK1mB,QAET,EAAK3B,aAGThlB,KAAKkoB,GAAG,8BAA8B,SAAA4T,GAClC,EAAKuR,kBAAmB,EACxBriC,QAAQC,IAAI,mCAAoC,MAEpDjL,KAAKkoB,GAAG,8BAA8B,SAAA4T,GAClC,EAAKuR,kBAAmB,EACxBriC,QAAQC,IAAI,kCAAmC,MAGnDjL,KAAKwtC,UAAU,mBAAqBxtC,KAAK0tC,WAAW1gB,SAAS,SAAAxmB,GACzD,EAAKonC,gCAhHjB,sBAoHI,WACI,OAAO5tC,KAAK+sC,UAAUW,aArH9B,yBAwHI,SAAYG,GACR7tC,KAAK+sC,UAAUY,YAAYE,KAzHnC,wBA4HI,WAA4B,IAAjBA,EAAiB,uDAAJ,GACpB7tC,KAAK+sC,UAAUe,SAASD,KA7HhC,mCAgII,SAAsBvuC,EAAKG,GACvB+nB,aAAaG,QAAQroB,EAAKG,KAjIlC,gCAoII,SAAmBH,GACf,OAAOkoB,aAAaC,QAAQnoB,OArIpC,K,6kDCGQsnB,EAAMC,WAAND,EAEKmnB,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYpe,EAAOmd,EAAcz6B,GAAO,kCAC9Bsd,EAAOmd,EAAcz6B,GAFnC,uDAKI,SAAyByF,EAAMY,EAAMjZ,GAEjCuL,QAAQ5E,YAAiB/F,IAAVZ,EAAqB,mBAEpCuL,QAAQC,IAAI,kBAAmByN,EAAMjZ,GACrCO,KAAK2vB,MAAMqe,WAAWC,OAAOv1B,EAAMjZ,GAEnCO,KAAKkuC,iBAZb,oCAeI,SAAuBtgB,EAASugB,GAC5B,IAAMC,EAAkB,sBACxBxgB,EAAQ1F,GAAG,SAAS,WACZimB,EAASE,SAASD,GAClBD,EAASG,YAAYF,GAErBD,EAASI,SAASH,QArBlC,6BA0BI,SAAgBJ,GAAyC,WAA/B74B,EAA+B,4DAAtB9U,EAAWqY,EAAW,uDAAJ,GAC7C81B,GAAa,OACFnuC,IAAX8U,IACAA,EAAS,IAAIq1B,EAAc,WAAY,MACvCgE,GAAa,GAGjB,IAAIC,EAAQ,GACN3iC,EAAS,GAGf3J,OAAOoM,QAAQy/B,GAAUjxB,SACrB,YAAkB,mBAAhBzd,EAAgB,KAAXG,EAAW,KACRivC,EAAOjvC,EAAMivC,KACPjvC,EAAMA,MAED,QAAbivC,EAAK52B,KACL22B,EAAMjtC,KAAK,CAAClC,EAAKG,IAEjBqM,EAAOtK,KAAK,CAAClC,EAAKG,OAI9B,IAAIkvC,EAAkB,GAEhBlgB,EAAK,IAAIC,IAEPpB,EAAS1hB,KAAKsR,MAAMtR,KAAKC,UAAUC,IACvCwhB,EAASA,EAAOhmB,KAAI,SAAAd,GAChB,IAAMlH,EAAMkH,EAAE,GAERH,GADNG,EAAIA,EAAE,IACQkoC,KAKd,OAJAroC,EAAI5G,MAAQ+G,EAAE/G,MACd4G,EAAIX,KAAOW,EAAIsF,MACftF,EAAIsnB,SAAW,UACftnB,EAAI/G,IAAMA,EACH+G,KAGX,IAbJ,EAaQsoB,EAASF,EAETG,EAAM,KACJC,EAAa,GAhBvB,IAiBoBvB,GAjBpB,IAiBI,2BAAwB,KAAb9mB,EAAa,QAEdsoB,EAAMtoB,EAAEmnB,SACSttB,MAAnBwuB,EAAWC,KACXD,EAAWC,GAAO,IAEtBD,EAAWC,GAAKttB,KAAKgF,IAvB7B,8BAyBSsgB,2BACM+H,EAAW,WAUtB,IAPA,IAAMzB,EAAY,CACdU,gBAAiB,SAACpV,EAAMhT,EAAMjG,GAC1BuL,QAAQC,IAAI,kBAAmByN,EAAMhT,EAAMjG,GAC3C,EAAKmvC,8BAAyBvuC,EAAWqY,EAAMjZ,KAIvD,MAAgB0C,OAAOoM,QAAQsgB,GAA/B,eAA4C,CAAvC,IAAMG,EAAC,KAGFC,EAAWD,EAAE,GACbznB,EAAIynB,EAAE,GAAGlnB,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAEmE,KAAKqjB,cAAcrhB,EAAEhC,SAIrDipB,EAASF,EACT,IAAMS,EAAKviB,SAASC,cAAc,QAClCsiB,EAAGC,UAAYF,EACf,IAAMG,EAAKT,EAAOU,OAAOH,GACzBE,EAAGE,WAAW,GAAGC,QAAU,IAE3BX,EAAM,IAAIF,IAA0BC,EAAQS,GAdJ,UAgBxB7nB,GAhBwB,IAgBxC,2BAAmB,KAARf,EAAQ,QAEfmoC,EAAgBj2B,GAAQlS,EAAE/G,MAE1B,IAAMiwB,EAAaC,MAAMC,iBAAiBxC,EAAW5mB,EAAlC,kBAAyCkS,GAAzC,CAA+ClS,EAAElH,OAC9DuwB,EAAKlB,EAAOU,OAAO7oB,EAAEd,KAAMgqB,GACtB,MAAPd,GACAA,EAAIkB,cAAcD,IAvBc,+BA2B5CpB,EAAGsB,YAAY,wBAGnB5a,EAAO05B,WAAW,YAAY,SAACxhB,EAAMue,GACjC,GAAa,GAATA,EAAY,CACZ,IAAMkD,EAAOzhB,EAAK0hB,iBAElB1hB,EAAKmY,OAAO2F,iBAAgB,SAAA3kC,GAAC,OAAIA,EAAEuoC,oBAAkBhyB,SAAQ,SAAAvW,GAAC,OAAIA,EAAEwpB,UAAUtD,OAAO,eACrFoiB,EAAK9e,UAAUzjB,IAAI,YACnB,IAAM0rB,EAAOrR,EAAE,mCAAmC,GAClDqR,EAAKxE,UAAY,GACjBhF,EAAGyB,SAAS+H,OApGiC,UAyGrDwW,EAAQA,EAAM3mC,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAE,GAAGmtC,KAAK/iC,MAAMod,cAAcrhB,EAAE,GAAGgnC,KAAK/iC,WAzGhB,yBA2G5C+D,EA3G4C,QA4G3CpQ,EAAMoQ,EAAE,GACdA,EAAIA,EAAE,GACN,IAAMs/B,EAAet2B,EAAKhN,OAAOpM,GAE3B2vC,EAAY95B,EAAO+5B,QAAQx/B,EAAEg/B,KAAK/iC,MAAO,MAE/CmN,YAAW,kBAAMm2B,EAAUF,iBAAiBpjC,MAAQ+D,EAAEg/B,KAAKl1B,cAAa,KAGxExO,QAAQC,IAAI,eAAgB+jC,GAC5B,IAAM3oC,EAAM,EAAK8oC,gBAAgBz/B,EAAEjQ,MAAOwvC,EAAWD,GACrDL,EAAkB,EAAH,KAAQA,GAAoBtoC,IAZ/C,2BAAqB,IA3GgC,8BA0HrD,GAAImoC,EAAY,CACZ,IAAMzC,EAAQ,IAAIF,EAAS12B,GAC3B42B,EAAMa,eAAehmB,EAAE,6BAA6B,IAExD,OAAO+nB,IAxJf,0BA2JI,WAAe,WAIXnlB,GAAa,iCAHO,CAChBF,UAAWtpB,KAAK2vB,MAAMpG,gBAEkC,SAACE,GACzD,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAC5C,IAAMqkB,EAAW,EAAKmB,gBAAgBvjC,KAAKsR,MAAMuM,EAAIK,WAErD,EAAK6F,MAAM5I,UAAY,IAAIC,IAAegnB,SAnK1D,0BAyKI,WACI,GAAKhuC,KAAK2vB,MAAMqe,WAAWoB,aAA3B,CAKA,IAAMC,EAAiBrvC,KAAK2vB,MAAMqe,WAAWsB,gBAC7CtvC,KAAKitC,YAAY,CACb,QAAWoC,EACX,UAAarvC,KAAK2vB,MAAMqe,WAAWliC,WAGvC,IAAMshB,EAAYptB,KACZspB,EAAYtpB,KAAK2vB,MAAMpG,cACvBF,EAAcgmB,EACpBhmB,EAAW,UAAgBC,EAETtpB,KAAK2vB,MAAM+c,SAAS,oBAAoB,WAAY,WAElEljB,GAAa,iCAAkCH,GAAa,SAACI,GAClC,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,SAC5ByD,EAAUuC,MAAMqe,WAAWuB,eAC3B,EAAK5f,MAAMoT,MAAM,mBAAoB,qDAAsD,OAAQ,WAG5G,IACHyM,QAnMR,GAA4C3C,G,SCFrC,IAAM4C,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAY9f,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IAEtBq9B,oBAAsB,KAE3B,EAAKC,eAAiB,EAAKC,YALS,EAD5C,wCASI,WAAY,WACRpmB,GAAa,mCAA+BnpB,GAAW,SAAAopB,GAC5B,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,SAC5B,EAAKgmB,eAAiB/jC,KAAKsR,MAAMuM,EAAIK,UACrC9e,QAAQC,IAAI,oBAAqB,EAAK0kC,gBAEtC,EAAKjsC,YAEV,SAjBX,wBAoBI,WACI,OAAO1D,KAAK2vC,eAAeroC,KAAI,SAAAd,GAAC,OAAIA,EAAEy8B,OAAO,SAASxkC,QAAQqG,MAAM,GAAI,QArBhF,0BAwBI,SAAaqlB,GACTnqB,KAAK0vC,oBAAsBvlB,IAzBnC,oBA4BI,WAAS,WAGK8N,EAAOjB,GAAY6Y,qBAAgBxvC,GACnCg7B,EAAQrE,GAAY8Y,iBAAYzvC,EAAW,eAAgB,6BAC3D0vC,EAAc/vC,KAAKgwC,aACnB9pC,EAAQ8wB,GAAYiZ,uBAAkB5vC,GAAW,SAAAmG,GACnD,IAAMgP,EAAMhP,EAAE/G,MAEdqnB,aAAetR,GACfsR,gBAAkBjnB,MAAK,SAAA2G,GACnB,EAAKmpB,MAAM/H,YAAYsoB,sBAAsB16B,QAGlDu6B,EAAajpB,mBAEhBmR,EAAKiU,OAAO7Q,GACZpD,EAAKiU,OAAOhmC,GAEZlG,KAAK0vC,oBAAoBxD,OAAOjU,GAIhC,IAAMA,EAAOjB,GAAY6Y,qBAAgBxvC,GACnCg7B,EAAQrE,GAAY8Y,iBAAYzvC,EAAW,6BAA8B,qEAEzE6F,EAAQ8wB,GAAYmZ,wBAAmB9vC,GAAW,SAAAmG,GACpD,IAAMgP,EAAMhP,EAAE0zB,QACdpT,iCAAmCtR,KACpCsR,iCAEHmR,EAAKiU,OAAO7Q,GACZpD,EAAKiU,OAAOhmC,GAEZlG,KAAK0vC,oBAAoBxD,OAAOjU,GAIhC,IAAMA,EAAOjB,GAAY6Y,qBAAgBxvC,GACnCg7B,EAAQrE,GAAY8Y,iBAAYzvC,EAAW,kBAAmB,mGAE9D6F,EAAQ8wB,GAAYmZ,wBAAmB9vC,GAAW,SAAAmG,GACpD,IAAMgP,EAAMhP,EAAE0zB,QACdpT,oBAAsBtR,KACvBsR,oBAEHmR,EAAKiU,OAAO7Q,GACZpD,EAAKiU,OAAOhmC,GAEZlG,KAAK0vC,oBAAoBxD,OAAOjU,GAIhC,IAAMA,EAAOjB,GAAY6Y,qBAAgBxvC,GACnCg7B,EAAQrE,GAAY8Y,iBAAYzvC,EAAW,UAAW,kFAEtDirC,EAAUzjB,uBAA8B,oBAA9B,WAEV3hB,EAAQ8wB,GAAYiZ,uBAAkB5vC,GAAW,SAAAmG,GACnD,IAAMgP,EAAMhP,EAAE/G,MAEd,EAAKkwB,MAAM/H,YAAYwoB,QAAQ56B,GAC/B,EAAKma,MAAM/H,YAAYznB,UACxB0nB,YAAoByjB,GAEvBrT,EAAKiU,OAAO7Q,GACZpD,EAAKiU,OAAOhmC,GAEZlG,KAAK0vC,oBAAoBxD,OAAOjU,OAhG5C,GAAiD4U,G,8gCCH1C,IAAMwD,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAY1gB,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IACtBi+B,OAAS,KACd,EAAKC,oBAAsB,KAE3B,EAAKC,SAAW,GALoB,EAD5C,0CASI,SAAYroB,GAAS,YACjB,0DAAkBA,GAElB,IAAMiF,EAAYptB,KAEZutC,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SACnCjoB,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,oBAAoB,SAAC0T,GAEnDhjB,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,cAAe,EAAKslB,WAAL,gBAAkC,GACzGtgB,EAAUkjB,OAAOG,oBAClB,GAEHzwC,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,mBAAmB,SAAA0T,GAElDhjB,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,aAAc,QAAO,GAC7E,EAAKsoB,gBAAgB5U,MAGzB97B,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,wBAAwB,SAAA0T,GACvDhjB,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,kBAAmB,QAAO,GAClF,EAAKuoB,eAAe7U,MAGxB97B,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,uBAAuB,SAAA0T,GACtDhjB,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,iBAAkB,QAAO,GAEjF,EAAKkoB,OAAOnK,SAASrK,GACrB,EAAKwU,OAAOG,oBAGhBzwC,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,sBAAsB,SAAA0T,GACrDhjB,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,gBAAiB,QAAO,GAChF,EAAKwoB,mBAzCjB,4BA8CI,SAAeC,GAAU,WACfC,EAAMD,EAASE,UACjBC,EAAMH,EAASI,QACfD,GAAOF,IAEPE,EAAM,KAEV,IAAME,EAAc,IAAIC,IAAIC,MAAMP,EAASQ,WAAa,EAAGP,EAAKD,EAASS,SAAW,EAAGN,GAEjFO,EAAK,OAASvxC,KAAK2vB,MAAMjI,kBAEzB8pB,EAASxxC,KAAKswC,OAAOmB,QAAQC,UAC/BR,EACA,kBAAoBK,GAGxBvxC,KAAKswC,OAAOlzB,QAAO,GACnBpd,KAAKswC,OAAOqB,aAAad,EAASQ,YAAY,GAAM,GAAM,eAE1DrxC,KAAKswC,OAAOsB,SAASf,EAASQ,WAAY,IAAI,GAE9Cv4B,YAAW,WACP,EAAKw3B,OAAOuB,aAAaC,aAAaN,KACvC,OArEX,yBAwEI,WAAc,UACMxxC,KAAKwwC,UADX,IACV,2BAA+B,KAApBpgC,EAAoB,QAC3BpQ,KAAKswC,OAAOuB,aAAaC,aAAa1hC,IAFhC,8BAIVpQ,KAAKwwC,SAAW,KA5ExB,6BA+EI,SAAgB9wC,GAEZ,GAAkB,eAAdA,EAAMoY,KAAuB,CAC7B,IAAIi6B,EAASjpC,SAASpJ,EAAMigB,MAEtBpF,GADSzR,SAASpJ,EAAMogB,QACjBpgB,EAAM6a,MAEnBw3B,GAAU,EAEV,IAGMnyB,EAHU5f,KAAKswC,OAAOmB,QAAQO,QAAQD,GAGtBzpC,QAAQiS,EAAK03B,UAAU,EAAG13B,EAAK9b,OAAS,IAExDyyC,EAAc,IAAIC,IAAIC,MAAMW,EAAQnyB,EAAOmyB,EAAQnyB,EAAQrF,EAAK9b,OAAS,GAGzE8yC,EAAK,OAASvxC,KAAK2vB,MAAMjI,kBAEzB8pB,EAASxxC,KAAKswC,OAAOmB,QAAQC,UAC/BR,EACA,0BAA4BK,GAGhCvxC,KAAKwwC,SAAShvC,KAAKgwC,QAKnBxmC,QAAQC,IAAI,uBAAwBvL,KA5GhD,iCAgHI,WACI,OAAOM,KAAKuwC,sBAjHpB,qBAoHI,SAAQ9Q,GAAM,UACMz/B,KAAKwwC,UADX,IACV,2BAA+B,KAApBpgC,EAAoB,QAC3BpQ,KAAKswC,OAAOuB,aAAaC,aAAa1hC,IAFhC,8BAIVpQ,KAAKwwC,SAAW,GAChBxwC,KAAK2vB,MAAM2R,QAAQthC,KAAMy/B,KAzHjC,gCA4HI,SAAmB6Q,GAAQ,WACvBtwC,KAAKswC,OAASA,EAEDtwC,KAAK+sC,UAAUmF,aAAa,GACpCnxB,iBAAiB,UAAU,SAAAva,GAC5B,EAAK8pC,OAAOlzB,cAjIxB,6BAsII,SAAgBqiB,GAEZ,IAAM5S,EAAS7sB,KAAK2vB,MAAMjI,kBAEpBya,EAAsB,YAActV,EAGpCuV,EAAkB,CACpBz2B,MAAO,WACPmM,KAAM,YACNiU,cAAe,oBACfgB,eAAgB,CAAEC,QAASH,IAE/B7sB,KAAK2vB,MAAMtD,eAAe+V,GAE1Bp3B,QAAQC,IAAI,sBAAuBk3B,GAEnCniC,KAAKuwC,oBAAsBpO,EAE3BniC,KAAK2vB,MAAMzC,gCAAgCltB,KAAM,GAAwB,CACrEghC,KAAK,EACLG,QAASgB,QA3JrB,GAA0C0K,G,0GCAnC,IAAMsF,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYxiB,EAAOmd,EAAcz6B,GAAO,kCAC9Bsd,EAAOmd,EAAcz6B,GAFnC,iDAKI,SAAmBi+B,GACftwC,KAAKswC,OAASA,IANtB,oBASI,SAAO8B,GACH,IAAMX,EAAUzxC,KAAKswC,OAAOuB,aAC5BJ,EAAQY,OAAO,CACX1I,IAAK8H,EAAQa,YACbC,OAAQ,GACTH,GAEH,IAPW,EAOLI,EAAWf,EAAQgB,WAPd,E,w5BAAA,EAWK,OAAID,EAASE,SADlB,oBAVA,IAYX,2BAAyB,KAAdtiC,EAAc,QACrBpF,QAAQC,IAAI,YAAamF,GAEzB,IAAIuiC,EAAWviC,EAAE,GAEjBuiC,EAAWA,EAAS9sB,QAAQ,MAAO,KACnC8sB,EAAW/mC,KAAKsR,MAAMy1B,IACb7qC,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAImG,KAC5B,IAAMkrC,EAAaD,EAAS3sC,KAAKiC,MAAM0qC,EAASl0C,OAAS,IAEzDuM,QAAQC,IAAI,4BAA6B2nC,GACzC5yC,KAAKmoB,UAAU4F,QAAQ,CAAC,aAAa,cAClC,CACCT,OAAQ,CACJulB,KAAMD,MA1BP,8BA+BX5yC,KAAK+sC,UAAUY,YAAY,CACvB,cAAiB6E,IAErBxyC,KAAKswC,OAAOG,qBA3CpB,GAA4C5D,G,0GCArC,IAAMiG,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYnjB,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IAEtBi+B,OAAS,KAHsB,EAD5C,0CAOI,SAAYnoB,GAAS,YACjB,0DAAkBA,GAElB,IAAMiF,EAAYptB,KAEZutC,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SACnCjoB,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,qBAAqB,SAAC0T,GAEpD,GAAIA,EAAItN,WAAa,EAAKkf,WAAL,UAArB,CAMA50B,YAAW,SAAAtS,GAAC,OAAI+mC,EAAGhhB,KAAKa,EAAUjF,UAAUC,YAAY,eAAgB,QAAO,GAC/E,IAAM2qB,EAAYjX,EAClB,EAAKkX,QAAQD,SAvBzB,uBA2BI,SAAUE,GAEN,OAAOA,EAAQptB,QAAQ,+BAAgC,MA7B/D,qBAgCI,SAAQktB,GACJ,IAAM7sC,EAAQ6sC,EAKd,GAJyB,iBAAdA,IACPA,EAAYnnC,KAAKsR,MAAM61B,IAGY,iBAA5BA,EAAUrT,eACjB1/B,KAAKswC,OAAOnK,SAASnmC,KAAKkzC,UAAUH,EAAUrT,iBAC9C1/B,KAAKswC,OAAOG,qBACT,CAEHzwC,KAAKswC,OAAOnK,SAAS,IACrBnmC,KAAKswC,OAAOG,iBAHT,Q,w5BAAA,CAIasC,EAAUrT,gBAJvB,IAIH,2BAA0C,KAClC/4B,EADkC,QAElCosC,EAAUrT,eAAejhC,OAAS,IAClCkI,EAAI,qDAA4DA,GAEpE,IAAM8qC,EAAUzxC,KAAKswC,OAAOuB,aAC5BJ,EAAQY,OAAO,CACX1I,IAAK8H,EAAQa,YACbC,OAAQ,GACTvyC,KAAKkzC,UAAUvsC,IAClB3G,KAAKswC,OAAOG,kBAdb,+BAiBPzwC,KAAKitC,YAAY,CAAE,KAAQ/mC,MA1DnC,gCA6DI,SAAmBoqC,GAAQ,WACvBtwC,KAAKswC,OAASA,EAEDtwC,KAAK+sC,UAAUmF,aAAa,GACpCnxB,iBAAiB,UAAU,SAAAva,GAC5B,EAAK8pC,OAAOlzB,gBAlExB,GAA2CyvB,G,qjCCKpC,IAAMsG,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYxjB,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IAEtB+gC,iBAAmB,SAAA5sC,GAAC,OAAI0F,MAAM1F,IAEnC,EAAK6sC,cAAgB,KAErB,EAAKC,iBAAmB,GAExBtoC,QAAQC,IAAI,QAASoH,GATe,EAD5C,0CAaI,SAAYw7B,GAGR,IAFA,IAAM0F,EAAe,GACfC,EAAY,CAAC,YAAa,QAChC,MAAgBrxC,OAAOoM,QAAQs/B,GAA/B,eAA4C,CAAvC,IAAMrnC,EAAC,KACR+sC,EAAa/sC,EAAE,IAAOgtC,EAAUloC,SAAS9E,EAAE,KAAwB,iBAATA,EAAE,GAAmBoF,KAAKC,UAAUrF,EAAE,IAAMA,EAAE,IAE5G,0DAAkB+sC,GAElBvoC,QAAQ5E,OAA+B/F,MAAxBL,KAAK0tC,WAAWrT,QArBvC,wBAwBI,SAAWwT,GAGP,IAFA,IAAM0F,EAAe,GACfC,EAAY,CAAC,YAAa,QAChC,MAAgBrxC,OAAOoM,QAAQs/B,GAA/B,eAA4C,CAAvC,IAAMrnC,EAAC,KACR+sC,EAAa/sC,EAAE,IAAOgtC,EAAUloC,SAAS9E,EAAE,KAAwB,iBAATA,EAAE,GAAmBoF,KAAKC,UAAUrF,EAAE,IAAMA,EAAE,IAE5G,yDAAiB+sC,GACjBvoC,QAAQ5E,OAA+B/F,MAAxBL,KAAK0tC,WAAWrT,QA/BvC,sBAkCI,WAII,IAHA,IAAMoZ,GAAS,wDACTC,EAAqB,GACrBF,EAAY,CAAC,YAAa,QAChC,MAAgBrxC,OAAOoM,QAAQklC,GAA/B,eAAwC,CAAnC,IAAMjtC,EAAC,KACRktC,EAAmBltC,EAAE,IAAwB,iBAATA,EAAE,IAAmBgtC,EAAUloC,SAAS9E,EAAE,IAAOoF,KAAKsR,MAAM1W,EAAE,IAAMA,EAAE,GAE9G,OAAOktC,IAzCf,yBA4CI,SAAYvrB,GAAS,YACjB,0DAAkBA,GAElB,IAAMiF,EAAYptB,KAEZutC,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SACnCjoB,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,kBAAkB,SAAC0T,GAE7B,iBAARA,IACRA,GAAMb,OAAWa,IACjBA,EAAItN,YAAc,EAAKkf,WAAL,YAOtB50B,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,YAAa,QAAO,GACxE,EAAKurB,qBAAqB7X,GAAK,OAKnC97B,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,kBAAkB,SAAA0T,GAEhD,IAAI9zB,EAAM,EAAK4rC,uBAAuB9X,QAC1Bz7B,IAAR2H,IACAA,EAAM,MAEV8Q,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,YAAapgB,KAAM,MAG/EhI,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,oBAAoB,SAAA0T,GAEvCz7B,MAAPy7B,GACA,EAAK+X,mBAAmB/X,GAE5B,IAAM3D,EAAO,EAAK2b,oCACZC,EAAQ,GACdA,EAAM,EAAKrG,WAAL,WAAgCvV,EACtCrf,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,cAAe2rB,KAAQ,MAChF,GAEH/zC,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,yBAA2BpoB,KAAK0tC,WAAW1gB,UAAU,SAAC8O,GAErFhjB,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,oBAAsB,EAAKslB,WAAW1gB,SAAU,QAAO,GAE3F,qBAAZ8O,EAAIhkB,KACJ,EAAKk8B,sBAAsBlY,EAAIlO,QAASkO,EAAIp2B,KAAMo2B,EAAIr8B,OAGtD,EAAKquB,gBAAgBgO,EAAIlO,QAASkO,EAAIp2B,KAAMo2B,EAAIr8B,UAErD,GAEHO,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,2BAA6BpoB,KAAK0tC,WAAW1gB,UAAU,SAAC8O,GACvFhjB,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,sBAAwB,EAAKslB,WAAW1gB,SAAU,QAAO,GAE7G,EAAKinB,iBAAiBnY,MAG1B97B,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,wBAA0BpoB,KAAK0tC,WAAW1gB,UAAU,SAAC8O,GACpFhjB,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,mBAAqB,EAAKslB,WAAW1gB,SAAU,QAAO,GAE1G,EAAKknB,cAAcpY,EAAIhkB,KAAMgkB,EAAIp2B,SAGrC1F,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,uBAAuB,SAAC0T,GACvDhjB,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,iBAAkB,QAAO,GACjF,EAAKkrB,iBAAmBxX,EAAIx0B,KAAI,SAAAd,GAAC,MAAK,CAClC2tC,WAAY3tC,EAAE,GACd4tC,aAAc5tC,EAAE,GAChBy6B,QAASz6B,EAAE,GACX6tC,aAAc7tC,EAAE,GAChB8tC,gBAAiB9tC,EAAE,GACnB+tC,WAAY/tC,EAAE,GACdqR,KAAMjM,KAAKsR,MAAM1W,EAAE,QAEvB,EAAK6sC,cAAcmB,qBAGvBx0C,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,qBAAqB,SAAA0T,GAEpD,IAAM2X,EAAS,EAAKgB,uBACdpa,EAAsB,QAAfoZ,EAAO37B,KAAiB27B,EAASA,EAAOpZ,KAC/C0Z,EAAQ,GACdA,EAAM,EAAKrG,WAAL,WAAgCrT,EAEtCvhB,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,eAAgB2rB,KAAQ,MAC7E,KArIX,8BAwII,SAAiBW,GAMb,IAJA,IACMra,EADIr6B,KAAKy0C,uBACD,KAEVE,GAAQ,EACZ,MAAgBxyC,OAAOsE,KAAK4zB,EAAKrJ,WAAW4H,SAA5C,eAAsD,CAAjD,IAAMpyB,EAAC,KACR,GAAIA,GAAKkuC,EAAO,QAELra,EAAKrJ,WAAW4H,QAAQpyB,GAC/BmuC,GAAQ,EACR,OAGHA,GACD3pC,QAAQtL,MAAM,uBAAyBgG,KAAO,mCAElD,IAAMkvC,EAAM50C,KAAK0tC,WACD,QAAZkH,EAAI98B,KACJ9M,QAAQtL,MAAM,yDAGdk1C,EAAItV,UAAUjF,KAAOA,EAEzBr6B,KAAK60C,WAAWD,GAEhB50C,KAAK2vB,MAAM1B,gBAlKnB,2BAqKI,SAAcnW,EAAM48B,GAEhB,GAAa,IAATA,EAAJ,CAMA,IAAII,EAAU,GACF,UAARh9B,EACAg9B,EAAU,SACG,SAARh9B,IACLg9B,EAAU,SAYd,IAXA,IAAMj9B,EAAO,CACTC,KAAMg9B,EACN9jB,WAAY,CACR+jB,MAAO,UAKT1a,EADIr6B,KAAKy0C,uBACD,KAEVE,GAAQ,EACZ,MAAgBxyC,OAAOsE,KAAK4zB,EAAKrJ,WAAW4H,SAA5C,eACI,GADQ,MACC8b,EAAO,CAEZC,GAAQ,EACR,MAGR,GAAIA,EACA30C,KAAK2vB,MAAMoT,MAAM,oBAAqB,sBAAwB2R,EAAQ,uBAAwB,QAAS,SAD3G,CAKAra,EAAKrJ,WAAW4H,QAAQ8b,GAAS78B,EACjC,IAAM+8B,EAAM50C,KAAK0tC,WACD,QAAZkH,EAAI98B,KACJ9M,QAAQtL,MAAM,yDAGdk1C,EAAItV,UAAUjF,KAAOA,EAEzBr6B,KAAK60C,WAAWD,GAGhB50C,KAAK2vB,MAAM1B,oBA5CP/hB,MAAM,iEAxKlB,8BAuNI,SAAiBwoC,EAAOM,GAEpB,IAAI9lC,EAAa,KAKjB,GAJgB,MAAZ8lC,IACA9lC,EAAcpG,SAASksC,EAAS7lC,UAAY,GAAMrG,SAASksC,EAAS5lC,SAExEpE,QAAQC,IAAI,mBAAoBypC,EAAOM,GAC1B,aAATN,EAGA,OADe10C,KAAKszC,iBAAiBhsC,KAAI,SAAAd,GAAC,OAAKA,EAAE6tC,cAAgB,GAAM,SAEpE,GAAa,YAATK,EAEP,OADc10C,KAAKszC,iBAAiBhsC,KAAI,SAAAd,GAAC,OAAuB,MAAlBA,EAAE6tC,gBAE7C,GAAa,oBAATK,EAGP,OAFqB10C,KAAKszC,iBAAiBjrC,QAAO,SAAA7B,GAAC,MAAsB,yBAAlBA,EAAE4tC,gBACjB/rC,QAAO,SAAA7B,GAAC,OAAIA,EAAE6tC,cAAgBnlC,KAEnE,GAAa,wBAATwlC,EAGP,OAFY10C,KAAKszC,iBAAiBjrC,QAAO,SAAA7B,GAAC,MAAsB,wBAAlBA,EAAE4tC,gBAC3B/rC,QAAO,SAAA7B,GAAC,OAAIA,EAAE6tC,cAAgBnlC,KAEhD,GAAa,2BAATwlC,EAGP,OAFW10C,KAAKszC,iBAAiBjrC,QAAO,SAAA7B,GAAC,MAAsB,kBAAlBA,EAAE4tC,gBAC3B/rC,QAAO,SAAA7B,GAAC,OAAIA,EAAE6tC,cAAgBnlC,KAE/C,GAAa,kBAATwlC,EAGP,OAFW10C,KAAKszC,iBAAiBjrC,QAAO,SAAA7B,GAAC,MAAsB,kBAAlBA,EAAE4tC,gBAC3B/rC,QAAO,SAAA7B,GAAC,OAAIA,EAAE6tC,cAAgBnlC,KAE/C,GAAa,iBAATwlC,EAGP,OAFY10C,KAAKszC,iBAAiBjrC,QAAO,SAAA7B,GAAC,MAAsB,oBAAlBA,EAAE4tC,gBAC3B/rC,QAAO,SAAA7B,GAAC,OAAIA,EAAE6tC,cAAgBnlC,KAEhD,GAAa,mBAATwlC,EAGP,OAFY10C,KAAKszC,iBAAiBjrC,QAAO,SAAA7B,GAAC,MAAsB,mBAAlBA,EAAE4tC,gBAC3B/rC,QAAO,SAAA7B,GAAC,OAAIA,EAAE6tC,cAAgBnlC,KAEhD,GAAa,cAATwlC,EAKP,OAAO,SAAAluC,GACH,IAAMH,EAAMG,EAAEc,KAAI,SAAAC,GACd,IAAM6c,EAAI,GAEV,OADA7c,EAAE05B,QAAQpb,QAAQ,2BAA2B,SAACzV,EAAGtM,GAAJ,OAAUsgB,EAAE5iB,KAAKsC,MACvDsgB,KAEL6wB,EAAUjvC,KAAKyJ,IAAL,MAAAzJ,MAAI,OAAQK,EAAIiB,KAAI,SAAAd,GAAC,OAAIsC,SAAStC,QAClD,OAAOA,EAAE6B,QAAO,SAAA2mB,GAAC,OAAIA,EAAEiS,SAAW,6BAA+BgU,EAAU,mCAG/E,KAAM,UA5QlB,oCAgRI,SAAuBnZ,GAKnB,IADAA,EAAMlwB,KAAKsR,MAAM4e,IACTtN,WAAaxuB,KAAK0tC,WAAL,YAGL,oBAAZ5R,EAAIhkB,OACA9X,KAAKk1C,sBACLl1C,KAAKk1C,qBAAqBn4B,SAAQ,SAAA5b,GAC1BA,IACAA,EAAEg0C,aAAc,MAE5Bn1C,KAAKk1C,qBAAuB,GAC5Bl1C,KAAKqzC,cAAc+B,cAEP,sBAAZtZ,EAAIhkB,MAA8B,CAE9B9X,KAAKk1C,sBACLl1C,KAAKk1C,qBAAqBn4B,SAAQ,SAAA5b,GAC1BA,IACAA,EAAEg0C,aAAc,MAE5Bn1C,KAAKk1C,qBAAuB,GAPM,UAUlBpZ,EAAIuZ,UAVc,IAUlC,2BAA8B,KAAnB7uC,EAAmB,QACpB8uC,EAAU9uC,EAAE,GAAI+uC,EAAM/uC,EAAE,GAAIgvC,EAAMhvC,EAAE,GACtC2jB,EAAO,KACPsrB,EAAQ,KAQZ,QAAcp1C,KANVo1C,EADAH,GAAW,EACHt1C,KAAKqzC,cAAcqC,UAAUJ,GAG7Bt1C,KAAKqzC,cAAcoC,OAG/B,CAGA,IAAY,GAARF,EACAprB,EAAOsrB,EAAMpoB,KAAKmoB,OACjB,CACD,IAAMnjC,EAAQojC,EAAMpoB,KAAKkoB,GAEzB,QAAcl1C,IAAVgS,EACA,SACJ8X,EAAO9X,EAAMwF,KAAK49B,MAAMpoB,KAAKmoB,QAEpBn1C,IAAT8pB,GACAnqB,KAAKk1C,qBAAqB1zC,KAAK2oB,KAlCL,8BAoClCnqB,KAAKk1C,qBAAqBn4B,SAAQ,SAAA5b,GAC1BA,IACAA,EAAEg0C,aAAc,MAExBn1C,KAAKqzC,cAAc+B,gBAzU/B,2BAiVI,SAAcO,GAA0B,IAAfxgC,EAAe,uDAAN,KAI9B,GAFKA,IACDA,EAASnV,KAAK2vB,MAAM3H,aAAa2D,MACjC,kBAAmBxW,GAAUA,EAAO4W,gBAAkB4pB,EACtD,OAAOxgC,EACX,GAAI,iBAAkBA,EAAQ,WACTA,EAAOgX,cADE,IAC1B,2BAAsC,KAA3BK,EAA2B,QAC5BhB,EAASxrB,KAAK41C,cAAcD,EAAWnpB,GAC7C,GAAIhB,EACA,OAAOA,GAJW,+BAO9B,OAAO,OA9Vf,mCAiWI,SAAsBqqB,GAAY,WAC1BC,EAAW91C,KAAKy0C,uBACC,QAAjBqB,EAASh+B,OACTg+B,EAAWA,EAASzb,MACxBr6B,KAAK2vB,MAAMuM,gBAAgB,CAAC,oBAAqB,mBAAoB,CACjErkB,KAAMi+B,EACN3V,gBAAiBngC,KAAKgtB,UAEtB,WACIhiB,QAAQC,IAAI,+BAOZ,EAAK0kB,MAAMtD,eANI,CACXvU,KAAM,YACNiU,cAAe,mBACfgB,eAAgB,KAIpBjU,YAAW,kBAAM,EAAKi9B,sBAAsBF,KAAa,QAlXzE,8BAsXI,SAAiBG,EAAQC,EAASC,EAAQC,GAItC,IAJ+C,EAIzCC,EAAWC,uBAAgCL,GAC3CM,EAAWD,uBAAgCH,GAE3CK,EAAY,GAP6B,IAS9BH,GAT8B,IAS/C,2BAA2B,KAAhBI,EAAgB,QACjB9H,EAAO2H,gBAAyBL,EAAQQ,GAC9C,GAAI9H,EAAK+H,WAELF,EAAU,SAAWC,GAAM9H,EAC3B6H,EAAUC,GAAMR,EAAOhlB,WAAWwlB,OAC/B,CAEH,IAAME,EAAO9qC,KAAKsR,MAAMtR,KAAKC,UAAU6iC,IACvCgI,EAAI,SAAeV,EAAOl+B,KAAO,MAAQ4+B,EAAI,SAC7CH,EAAU,SAAWN,EAAUO,GAAME,EACrCH,EAAUN,EAAUO,GAAMR,EAAOhlB,WAAWwlB,KApBL,wCAyB9BF,GAzB8B,IAyB/C,2BAA2B,KAAhBK,EAAgB,QACjBjI,EAAO2H,gBAAyBH,EAAQS,GAC9C,IAAKjI,EAAK+H,WAAY,CAClB,IAAMC,EAAO9qC,KAAKsR,MAAMtR,KAAKC,UAAU6iC,IACvCgI,EAAI,SAAeR,EAAOp+B,KAAO,MAAQ4+B,EAAI,SAC7CA,EAAI,SAAeR,EAAO1d,QAC1B+d,EAAU,SAAWJ,EAAUQ,GAAMD,EACrCH,EAAUJ,EAAUQ,GAAMT,EAAOllB,WAAW2lB,KAhCL,8BAqC/C,IAAMC,EAAOhrC,KAAKsR,MAAMtR,KAAKC,UAAUmqC,IAEvC,OADAY,EAAK5lB,WAAaulB,EACXK,IA7Zf,wCAgaI,WAII,OAHU52C,KAAKy0C,uBACA,aAlavB,kCAuaI,WACI,IAAMhB,EAASzzC,KAAK0tC,WAChBrqC,EAAI,KASR,IAHkB,iBAJdA,EADehD,MAAfozC,EAAOpZ,KACHoZ,EAEAA,EAAM,aAGVpwC,EAAIuI,KAAKsR,MAAM7Z,IAEK,iBAAVA,EAAEg3B,MACZh3B,EAAEg3B,MAAOY,OAAW53B,EAAEg3B,MAE1B,OAAOh3B,IArbf,8BAwbI,SAAiBgqB,GAKb,IAAMC,EAASD,EAAKxV,KAIpB7X,KAAK2vB,MAAMknB,yBAHO72C,KAG6BqtB,EAAMC,KAjc7D,qCAocI,SAAwBkL,EAASD,GAC7B,OAAe,MAAXC,GAAmBA,EAAQ70B,aAAexB,OACnCnC,KAAK82C,iBAAiBte,EAASD,GAE/Bv4B,KAAK+2C,iBAAiBve,EAASD,KAxclD,8BA4cI,SAAiBC,EAASD,GACtB,IACM8B,EADIr6B,KAAKy0C,uBACD,KAEd,GAAgBp0C,MAAZk4B,EAAuB,WAEP8B,EAAK2c,OAFE,IAEvB,2BAA4B,KAAjB71C,EAAiB,QACxB,GAAIA,EAAE8S,KAAOukB,EAAQvkB,KAAO9S,EAAE81C,KAAOze,EAAQye,IACzC,MAAO,CAAC91C,EAAE6vB,WAAWnZ,KAAMwiB,IAJZ,+BAJK,UAahBA,EAAK6c,OAbW,IAahC,2BAA4B,KAAjB1wC,EAAiB,QACxB,GAAIA,EAAEw0B,IAAMzC,EAAU,WACF/xB,EAAEwwC,OADA,IAClB,2BAAyB,KAAd71C,EAAc,QAErB,GAAIA,EAAE8S,KAAOukB,EAAQvkB,KAAO9S,EAAE81C,KAAOze,EAAQye,IACzC,MAAO,CAAC91C,EAAE6vB,WAAWnZ,KAAMwiB,IAJjB,8BAQlB,QAtBwB,iCA5cxC,8BAueI,SAAiB7B,EAASD,GACtB,IADgC,EAE1B8B,EADIr6B,KAAKy0C,uBACD,KAFkB,IAIhBpa,EAAK6c,OAJW,IAIhC,2BAA4B,KAAjB1wC,EAAiB,QACxB,GAAIA,EAAEw0B,IAAMzC,EAAU,CAElB,GAAe,MAAXC,EACA,MAAO,CAAChyB,EAAG6zB,GAHG,UAIF7zB,EAAE0wC,OAJA,IAIlB,2BAAyB,KAAd1xC,EAAc,QAErB,GAAIA,EAAEw1B,IAAMxC,EACR,MAAO,CAAChzB,EAAG60B,IAPD,8BAWlB,QAhBwB,iCAvexC,mCA6fI,SAAsBhN,EAAM3nB,EAAMjG,GAI9BuL,QAAQC,IAAI,wBAAyBvF,EAAMjG,GAQ3C,IALA,IACM46B,EADIr6B,KAAKy0C,uBACD,KAEVE,GAAQ,EACNjlC,EAAI2d,EAAKxV,OACf,MAAgB1V,OAAOsE,KAAK4zB,EAAKrJ,WAAW4H,SAA5C,eAAsD,CAAjD,IAAMpyB,EAAC,KACR,GAAIA,GAAKkJ,EAAE,GAAI,CAEX2qB,EAAKrJ,WAAW4H,QAAQpyB,GAAGwqB,WAAWtrB,GAAQjG,EAC9Ck1C,GAAQ,EACR,OAGHA,GACD3pC,QAAQtL,MAAM,uBAAyBgG,EAAO,mCAElD,IAAMkvC,EAAM50C,KAAK0tC,WACD,QAAZkH,EAAI98B,KACJ9M,QAAQtL,MAAM,yDAGdk1C,EAAItV,UAAUjF,KAAOA,EAEzBr6B,KAAK60C,WAAWD,GAEhB50C,KAAK2vB,MAAM1B,gBA7hBnB,6BAgiBI,SAAgBZ,EAAM3nB,EAAMjG,GAKX4tB,EAAKO,QAEboD,WAAWtrB,GAAQjG,EAExB,IAAM46B,EAAOr6B,KAAKqzC,cAAchZ,KAC5Bua,EAAM50C,KAAK0tC,WACC,QAAZkH,EAAI98B,KACJ88B,EAAMva,EAGNua,EAAItV,UAAUjF,KAAOA,EAEzBr6B,KAAK60C,WAAWD,GAEhB50C,KAAK2vB,MAAM1B,gBAnjBnB,kCAujBI,WAA4D,WAAvCqR,EAAuC,4DAA3Bj/B,EACZA,MAAbi/B,IACAA,EAAYt/B,KAAK0tC,WAAL,WAEhB,IAAIrnC,EAAMi5B,EAENj5B,EADiB,iBAATA,GACF40B,OAAWqE,GAEb,SAAUA,EACJA,EAGA,CAAEjF,KAAMiF,GAOlBt0B,QAAQ5E,YAA0B/F,IAAnBgG,EAAIk6B,YAMnB,IAAMwF,EAAI/lC,KAAK0tC,WASnB,GARI1iC,QAAQ5E,OAAsB/F,MAAf0lC,EAAEzG,kBACVyG,EAAEzG,UACTt/B,KAAK60C,WAAW9O,GAEpB/lC,KAAKitC,YAAY,CACb,UAAa5mC,IAGU,OAAvBrG,KAAKqzC,cACLrzC,KAAKqzC,cAAc8D,SAAS9wC,EAAIg0B,UAC/B,CACD,IAAM+c,EAAO,IAAIC,IAAahxC,EAAIg0B,KAAMr6B,KAAK+sC,UAAUmF,aAAa,IAChE,SAACoF,EAAIn2C,EAAGuL,EAAG6qC,EAAInzB,EAAGozB,EAAKC,GAAvB,OAA8B,EAAKC,wBAAwBJ,EAAIn2C,EAAGuL,EAAG6qC,EAAInzB,EAAGozB,EAAKC,KACjF,MAAM,EAAO,SACjBz3C,KAAKqzC,cAAgB+D,EAIzBp3C,KAAK+1C,uBAAsB,KAnmBnC,qCAsmBI,SAAwB4B,EAAQ77B,EAAO87B,EAAevC,EAAUwC,EAAUC,EAAmBC,GAAW,WAE9FC,EAAiB3C,EAAS4C,OAC1BC,EAAgB7C,EAAS6B,MACzBiB,EAAgB9C,EAAS2B,MACzBoB,EAA2B/C,EAASgD,QACpCC,EAAqBjD,EAASkD,WAChCC,EAAiBR,EAAev5C,OAASy5C,EAAcz5C,OAAS05C,EAAc15C,OAC9E25C,EAAyB35C,OAAS65C,EAAmB75C,OACrDg6C,EAAkB,KAkBtB,GAjBIX,EAAkBr5C,OAAS,EAC3Bg6C,EAAkBX,EAAkB,GAGpCU,EAAiB,EAIN,UAAXb,GAAiC,gBAAXA,GAAuC,cAAXA,GAAqC,gBAAXA,GACjE,UAAXA,GACI33C,KAAK04C,cACL14C,KAAK04C,YAAY1zB,UACjBhlB,KAAK04C,YAAc,MAKL,GAAlBF,GAAkC,UAAXb,EAUvB,OARI33C,KAAKk1C,sBACLl1C,KAAKk1C,qBAAqBn4B,SAAQ,SAAA5b,GAC1BA,IACAA,EAAEw3C,aAAe,SAI7B34C,KAAK+1C,uBAAsB,IACpB,EAEX,GAAsB,GAAlByC,GAAkC,gBAAXb,EAA0B,CACjD,IAAMiB,EAAQ,IAAIC,IAMlB,OALAD,EAAME,UAAU,mBAAmB,SAAAtyC,GAC/B,EAAKuvC,uBAAsB,MAE/B6C,EAAMvc,KAAKvgB,EAAMtV,EAAGsV,EAAMvU,GAC1BvH,KAAK04C,YAAcE,GACZ,EAGNV,EAAcz5C,OAAS05C,EAAc15C,OAAS25C,EAAyB35C,SAAY,GAEhFu5C,EAAev5C,OAIvB,IAAI85B,EAAW,KAAMC,EAAU,KAY/B,GAXIwf,EAAev5C,OAAS,IACxB85B,EAAWyf,EAAe,GAAGhd,IAC7Bod,EAAyB35C,OAAS,IAClC+5B,EAAU4f,EAAyB,GAAGpd,IAEtCkd,EAAcz5C,OAAS,EACvB+5B,EAAU0f,EAAc,GAAGld,GACtBmd,EAAc15C,OAAS,IAC5B+5B,EAAU2f,EAAc,GAAGnd,IAGhB,gBAAX2c,EAA0B,CAE1B,IAAMoB,EAAO,CAAEvyC,EAAGsV,EAAMtV,EAAGe,EAAGuU,EAAMvU,GAC9BinB,EAAYqpB,EAASxd,KAAKrJ,WAAWtrB,KAErCkzC,EAAQ,IAAIC,IAIZxe,EAAQoe,EAAkBA,EAAgBpe,KAAO,KACnD2e,EAAY,KAkFhB,OAjFIP,aAA2BQ,MAC3BD,EAAYP,EAAgB5gC,KAAKxF,MAC5BomC,aAA2BS,UAChCF,EAAYP,EAAgB5gC,KAAKwV,MAGnBvV,KAAKgrB,SAAS,UACxBkW,EAAY3e,EAAK6c,MAAMuB,EAAgB1d,WAAWmc,MAAM8B,EAAUG,cAGtEH,EAAY,KAGZA,GAAa,iBAAkBA,EAAUhoB,YACzC4nB,EAAME,UAAWE,EAAUhoB,WAAWooB,aAAgB,SAAW,YAC7D,SAAA5yC,GACIwyC,EAAUhoB,WAAWooB,cAAgBJ,EAAUhoB,WAAWooB,aAC1D,EAAK/F,cAAcgG,WACnB,EAAKhG,cAAc+B,gBAI/BwD,EAAME,UAAU,wBAAwB,SAAAtyC,GACpCwE,QAAQC,IAAI,sCAEZ,EAAKkd,UAAU4F,QAAQ,CAAC,6BAA+BS,IAAY,SAAAhoB,MAChE,CACC8mB,OAAQ,CACJiL,SAAUA,EACVC,QAASA,QAIrBogB,EAAME,UAAU,0BAA+B,SAAAtyC,GAC3CwE,QAAQC,IAAI,sCAGZ,EAAKkd,UAAU4F,QAAQ,CAAC,uBAAyBS,IAAY,SAAAhoB,GACzDwE,QAAQC,IAAI,iCAAkCzE,GAE9C,IAH8D,EAGxDH,EAAMlE,OAAO2J,OAAOtF,GAAG,GAGvB8yC,EAAU,IAAIT,IAN0C,IAQ9CxyC,GAR8C,yBAQnDkB,EARmD,QAS1D+xC,EAAQR,UAAUvxC,EAAE8mB,UAAU,SAAA7nB,GAC1B,EAAK2hB,UAAU4F,QAAQ,CAAC,wBAA0BS,IAAY,SAAAhoB,MAE1D,CACI8mB,OAAQ/lB,EAAEgyC,cAL1B,2BAAqB,IARyC,8BAkB9DD,EAAQjd,KAAK0c,EAAKvyC,EAAIoyC,EAAM7rC,QAASgsC,EAAKxxC,KAC3C,CACC+lB,OAAQ,CACJiL,SAAUA,EACVC,QAASA,KAMjBhyB,EAAEgkB,iBACFhkB,EAAE+jB,qBAENquB,EAAME,UAAU,oBAAoB,SAAAtyC,GAChCwE,QAAQC,IAAI,wBAEhB2tC,EAAME,UAAU,uBAAuB,SAAAtyC,GACnCwE,QAAQC,IAAI,2BAEhB2tC,EAAME,UAAU,cAAc,SAAAtyC,GAC1BwE,QAAQC,IAAI,+BAGhB2tC,EAAMvc,KAAK0c,EAAKvyC,EAAGuyC,EAAKxxC,GACxBvH,KAAK04C,YAAcE,GAEZ,EAGX,MAAe,UAAXjB,IAIA33C,KAAKk1C,sBACLl1C,KAAKk1C,qBAAqBn4B,SAAQ,SAAA5b,GAC1BA,IACAA,EAAEw3C,aAAe,SAG7B34C,KAAKk1C,qBAAuB4C,EAG5Bh/B,YAAW,WAEP9N,QAAQC,IAAI,OAAQwtC,EAAgBpe,MAGhCoe,aAA2Be,MAAsC,OAA9Bf,EAAgB1d,WACtC0d,EAAgBpe,KAAK6c,MAAM3e,GAAUye,MAAMyB,EAAgBzd,IACtDic,IAGtB,IAAMwC,EAAe,SAAAC,GACjB,IAAMC,EAAa,GACnBD,EAAa38B,SAAQ,SAAA6Q,GAEjB,IAF4B,EAEtBgsB,EAAOhsB,EAAQoD,WAFO,IAGd7uB,OAAOsE,KAAKmzC,GAAMvxC,QAAO,SAAA7B,GAAC,OAAKA,EAAEojB,WAAW,cAH9B,IAK5B,2BAAuB,KAAZljB,EAAY,QACbjH,EAAQm6C,EAAKlzC,GACbgoC,EAAOkL,EAAK,SAAWlzC,GAC7B,GAAYrG,MAARquC,EAAJ,CAGA,IAAM9F,EAAQh9B,KAAKsR,MAAMtR,KAAKC,UAAU6iC,IACxC9F,EAAMnpC,MAAQA,EACdmpC,EAAMljC,KAAOgB,EAEbizC,EAAWn4C,KAAK,CACZmB,SAAUimC,EAAOhb,QAASA,EAASyM,KAAMoe,EAAgBpe,KACzD1M,SAAUC,EAAQ9V,KAAO,MAAQ8wB,EAAMjb,aAjBnB,kCAqBhC,EAAKksB,iBAAiB,CAClBhiC,KAAM8hC,KAId,GAAIlB,aAA2Be,KAC3BC,EAAa,CAAChB,EAAgB5gC,YAC7B,GAAI4gC,aAA2BS,SAAU,CAC1C,IAAM1zC,EAAIizC,EAAgB5gC,KAAKwV,KAE/B7nB,EAAEu1B,UAAY0d,EAAgB1d,UAC9B,IAAM1oB,EAAQomC,EAAgBpe,KAAK6c,MAAMuB,EAAgB1d,WAEzD,GAAIv1B,EAAEsS,KAAKgrB,SAAS,SAAU,CAE1B,IAAMgX,GAAYC,QAAoB1nC,EAAM6kC,MAAO1xC,GAK7Cw0C,EAFQnC,EAASnC,UAAU+C,EAAgBpe,KAAKS,cACjCzN,KAAKorB,EAAgB1d,WACrBljB,KAAK49B,MAAMpoB,KAAKysB,EAAU9e,IAC/C,EAAKka,qBAAqB1zC,KAAKw4C,GAE/BP,EAAa,CAACj0C,EAAGs0C,SACd,GAAIt0C,EAAEsS,KAAKgrB,SAAS,QAAS,CAEhC,IAAMmX,EAAWnxC,SAAStD,EAAE2zC,aACtBe,EAAa7nC,EAAM6kC,MAAM+C,GAKzBD,EAFQnC,EAASnC,UAAU+C,EAAgBpe,KAAKS,cACjCzN,KAAKorB,EAAgB1d,WACrBljB,KAAK49B,MAAMpoB,KAAK6sB,EAAWlf,IAChD,EAAKka,qBAAqB1zC,KAAKw4C,GAE/BP,EAAa,CAACS,EAAY10C,QACR,eAAXA,EAAEsS,KAGT2hC,EAAa,CAACj0C,EADAizC,EAAgBpe,KAAKrJ,WAAW4H,QAAQpzB,EAAEwrB,WAAWnZ,QAInE4hC,EAAa,CAACj0C,SACXizC,aAA2BQ,OAClCQ,EAAa,CAAChB,EAAgB5gC,KAAKxF,QAEvC,EAAK6iC,qBAAqBn4B,SAAQ,SAAA5b,GAC1BA,IACAA,EAAEw3C,aAAe,UAEzBd,EAASzC,eACV,KAhGQ,MAzwBnB,GAAwCvI,G,8GCJhCjmB,EAAMC,WAAND,EAEKuzB,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYxqB,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IAEtB+nC,gBAAkB,KAEvB,EAAKrN,UAAUsN,SAAS,cALY,EAD5C,0CASI,SAAYlyB,GAAS,YACjB,0DAAkBA,GAElB,IAAMolB,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SACnCjoB,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,4BAA4B,SAAC0T,GAC5DhjB,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,sBAAuB,QAAO,GAClF,EAAKkyB,mBAAmB7mB,UAAY,GACpC,IAAI3vB,EAAIg4B,EAAIxO,OACM,iBAANxpB,IACRA,EAAI8H,KAAKsR,MAAMpZ,IACnB,EAAK6rB,MAAMkqB,iBAAiB/d,EAAI1O,UAAW0O,EAAIzO,KAAMvpB,EAAG,EAAKw2C,mBAAoBxe,EAAI3gB,YAGzFnb,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,0BAA0B,SAAA0T,GACzDhjB,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,oBAAqB,QAAO,GAChF,EAAKmyB,kBAAkBze,EAAIqE,gBAAiBrE,EAAIjkB,WAxB5D,wCA6BI,SAA2B2iC,EAAWC,GAQlC,IAAMC,EAAe,CACrBA,KAAoB,kBAAMD,IAC1Bz6C,KAAK2vB,MAAMknB,yBAAyB2D,EAAWE,EAAcD,EAAO,GAAGzpB,WAAY,CAC/E2pB,WAAY,aAGZ7iC,KAAM,wBA3ClB,8BA+CI,SAAiBqoB,EAAiBya,GAC9B56C,KAAKmoB,UAAU4F,QAAQ,CAAC,sBAAwBoS,IAAkB,SAAA35B,MAC/D,CACC8mB,OAAQstB,MAlDpB,2BAsDI,SAAcza,EAAiB0a,EAAWD,GACtC56C,KAAKmoB,UAAU4F,QAAQ,CAAC,mBAAqBoS,IAAkB,SAAA35B,MAC5D,CACC8mB,OAAQ,CACJ5nB,KAAMk1C,EACN9iC,KAAM+iC,OA3DtB,+BAgEI,SAAkB1a,EAAiBtoB,GAAM,WAErC,GAAY,MAARA,EAAJ,CAIA,IAAMijC,EAAoB,IAAIpsB,IAC9BosB,EAAkBC,WAAW,SAAU,OAAQ,aAAc,YAG7D,IAAMC,EAAc,GAAH,eAAO74C,OAAOsE,KAAKoR,EAAKmZ,WAAWiqB,UAAnC,CAA6C,mBAA7C,OAAkE94C,OAAOoM,QAAQsJ,EAAKmZ,WAAW4H,WAE5G4hB,EAAYra,EAClBn1B,QAAQ5E,OAAoB/F,MAAbm6C,GAAgD,iBAAdA,GAbZ,Q,w5BAAA,CAerBQ,GAfqB,yBAe1Bx0C,EAf0B,QAiBjC,GAAS,kBAALA,EAOA,OALYs0C,EAAkBzrB,OAAO,UACjCC,WAAWvS,SAAQ,SAAAvW,GACnBA,EAAE+oB,QAAU,EACZ/oB,EAAEoJ,MAAQ,wBAEd,WAEJ,GAAY,QAARpJ,EAAE,IAAwB,MAARA,EAAE,IAA2B,iBAANA,GAAkBA,aAAagE,OACxE,iBACJ,IAAM0wC,EAAWvuC,SAASC,cAAc,UACxCsuC,EAASn6B,iBAAiB,SAAS,SAAAoP,GAC/B,EAAKgrB,2BAA2BX,EAAWh0C,MAE/C00C,EAAS/rB,UAAY,OACrB,IAAMisB,EAAUzuC,SAASC,cAAc,UACvCwuC,EAAQr6B,iBAAiB,SAAS,SAAAoP,GAC9B,EAAK8jB,iBAAiBuG,EAAWh0C,EAAE,OAEvC40C,EAAQjsB,UAAY,SACpB,IAAMksB,EAAgB1uC,SAASC,cAAc,OAC7CyuC,EAActrC,YAAYmrC,GAC1BG,EAActrC,YAAYqrC,GAC1BN,EAAkBzrB,OAAO7oB,EAAE,GAAIA,EAAE,GAAGsR,KAAMtR,EAAE,GAAGwqB,WAAW+jB,MAAQ,IAAMvuC,EAAE,GAAGwqB,WAAWC,MAAQ,IAAKoqB,IA1BzG,2BAA6B,IAfQ,8BA4CrCP,EAAkBzrB,OAAO,oBAAoBC,WAAWvS,SAAQ,SAAAvW,GAC5DA,EAAE+oB,QAAU,EACZ/oB,EAAEoJ,MAAQ,wBAGV,IAAM0rC,EAAa3uC,SAASC,cAAc,SAC1C0uC,EAAWxjC,KAAO,OAClBwjC,EAAWC,YAAc,cACzB,IAAMC,EAAa7uC,SAASC,cAAc,UAC1C4uC,EAAWrsB,UAAY,aACvBqsB,EAAWz6B,iBAAiB,SAAS,WACjC,EAAKmzB,cAAcsG,EAAW,SAAUc,EAAW77C,UAEvD,IAAMg8C,EAAY9uC,SAASC,cAAc,UACzC6uC,EAAU16B,iBAAiB,SAAS,WAChC,EAAKmzB,cAAcsG,EAAW,QAASc,EAAW77C,UAEtDg8C,EAAUtsB,UAAY,YAEtB,IAAMksB,EAAgB1uC,SAASC,cAAc,OAC7CyuC,EAActrC,YAAYyrC,GAC1BH,EAActrC,YAAY0rC,GAE1BX,EAAkBzrB,OAAOisB,EAAYD,GAAe/rB,WAAWvS,SAAQ,SAAAvW,GACnEA,EAAE+oB,QAAU,EACZ/oB,EAAEoJ,MAAQ,wBAGd,IAAM8rC,EAAoB/uC,SAASC,cAAc,OAC3C+uC,EAAahvC,SAASC,cAAc,UAC1C+uC,EAAW56B,iBAAiB,SAAS,WAEjCyI,GAAa,yBAA0B,CACnC6Q,KAAMxiB,IACP,SAAC4R,GACA,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAC5C,IAAMwO,GAAO8C,OAAWxR,EAAIK,eACTzpB,IAAf83B,EAAKz4B,OAEL,EAAKiwB,MAAMuL,aAAa,EAAM/C,GAIlC,EAAKhQ,UAAU4F,QAAQ,CAAC,mBAAmB,SAAAvnB,MACxC,CACC8mB,OAAQ,CACJ6N,SAAUhD,EAAKkC,KACfe,UAAW,iCAM/BugB,EAAWxsB,UAAY,2BACvBusB,EAAkB3rC,YAAY4rC,GAC9Bb,EAAkBzrB,OAAOqsB,GAG7B17C,KAAKs6C,mBAAmB7mB,UAAY,GAEpCqnB,EAAkB/qB,YAAY,qBAC9B+qB,EAAkB5qB,SAASlwB,KAAKs6C,yBAtG5BtvC,QAAQslB,KAAK,mDAnEzB,8BA4KI,WAEI,OADe1J,EAAE5mB,KAAK+sC,UAAUmF,cAAcphC,SAAS,gBACzC,KA9KtB,6BAiLI,WACc9Q,KAAKs6C,mBACb3qC,aAAa,YAAa,gDAC5B,IAAM0C,EAAQrS,KAAK0tC,WACnB,GAAoBrtC,MAAhBgS,EAAMib,QAA8C,MAAvBjb,EAAMib,OAAOA,OAAgB,CAC1D,IAAMxpB,EAAIuO,EAAMib,OAChBttB,KAAK2vB,MAAMkqB,iBAAiB/1C,EAAEspB,UAAWtpB,EAAEupB,KAAMzhB,KAAKsR,MAAMpZ,EAAEwpB,QAASttB,KAAKs6C,yBAvLxF,GAA8CzN,G,8GCJtCjmB,EAAMC,WAAND,EAEKg1B,EAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYjsB,EAAOmd,EAAcz6B,GAAO,kCAC9Bsd,EAAOmd,EAAcz6B,GAFnC,0CAMI,SAAY8V,IACR,0DAAkBA,GAIPnoB,KAAK2vB,MAAM3H,aAAaC,SAEnCjoB,KAAK67C,eAAiB,OAb9B,qBAiBI,WACIpT,cAAczoC,KAAK67C,iBACnB,yDAnBR,uBAsBI,SAAUhkC,GAAM,WAES,iBAATA,IACRA,EAAOjM,KAAKsR,MAAMrF,IAGDxX,MAAjBwX,EAAKw9B,WACLx9B,EAAKw9B,SAAW,IAEpB,IAAMyG,EAAel1B,EAAE5mB,KAAK+sC,UAAUmF,cAAc,GACpD4J,EAAaroB,UAAY,GACzB,IAAMsZ,EAAYpgC,SAASC,cAAc,OACzCga,EAAEmmB,GAAWgP,IAAI,WAAY,QAC7Bn1B,EAAEmmB,GAAWhgC,MAAM,QACnB6Z,EAAEmmB,GAAW7/B,OAAO,QACpB,IAAMo8B,EAAQ38B,SAASC,cAAc,SAG/BovC,EAASrvC,SAASC,cAAc,SAChCqvC,EAAatvC,SAASC,cAAc,MACpB,CAAC,WAAY,WAAY,QAAS,WAC1CtF,KAAI,SAAAd,GACd,IAAM01C,EAAIvvC,SAASC,cAAc,MAEjC,OADAsvC,EAAE/sB,UAAY3oB,EACP01C,KACRn/B,SAAQ,SAAAvW,GAAC,OAAIy1C,EAAWlsC,YAAYvJ,MAEvCw1C,EAAOjsC,YAAYksC,GACnB3S,EAAMv5B,YAAYisC,GAElB,IA9BY,EA8BNG,EAAQxvC,SAASC,cAAc,SA9BzB,E,w5BAAA,CA+BIiL,EAAKw9B,UA/BT,yBA+BD7uC,EA/BC,QAiCJ41C,EAAW51C,EAAE2U,QACQ,iBAAbihC,IACW/7C,MAAZ+7C,EACS/7C,MAAZmG,EAAE4rC,QAAiC,UAAV5rC,EAAEsR,QAC3BskC,EAAWzvC,SAASC,cAAc,WACzBotB,QAAU,SAAAhqB,GACf,EAAK2f,MAAMtD,eAAe,CACtB,KAAQ,YACR,cAAiB,oBACjB,eAAkB,CACdgwB,cAAe71C,EAAE4rC,QAErB,MAAS,YAGjBgK,EAASjtB,UAAY,WAGJ9uB,MAAjB+7C,EAAStkC,OACTskC,EAAWA,EAASE,UAExBF,EAAWA,EAASnzC,KAAO,cAAgBmzC,EAASG,cAExD,IAAMzwC,EAAS,CACXtF,EAAC,MACDA,EAAC,UACDA,EAAC,MACD41C,GAEEzS,EAAMh9B,SAASC,cAAc,MACnCd,EAAOxE,KAAI,SAAAC,GACP,IAAMmF,EAAIC,SAASC,cAAc,MAMjC,MALkB,iBAANrF,GAAgC,iBAANA,EAClCmF,EAAEyiB,UAAY5nB,EAEdmF,EAAEqD,YAAYxI,GAEXmF,KACRqQ,SAAQ,SAAAxV,GAAC,OAAIoiC,EAAI55B,YAAYxI,MAChC40C,EAAMpsC,YAAY45B,IAzCtB,2BAA+B,IA/BnB,8BA2EZL,EAAMv5B,YAAYosC,GAGlBpP,EAAUh9B,YAAYu5B,GACtBwS,EAAa/rC,YAAYg9B,GACzBnmB,EAAE0iB,GAAOkT,cAtGjB,oBAyGI,WAAS,WACLx8C,KAAK67C,eAAiBtT,aAAY,SAAA/hC,GAC9B,EAAKi2C,oBACN,KACH71B,EAAE5mB,KAAK+sC,UAAUmF,cAAc6J,IAAI,WAAY,QAC/C/7C,KAAK08C,UAAU,MA9GvB,6BAiHI,WAAkB,WAGdlzB,GAAa,kCADO,IACyC,SAAAC,GAClC,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,QAE5B,EAAK+yB,UAAUjzB,EAAIK,iBAvHnC,GAA4C+iB,G,8GCFpCjmB,EAAMC,WAAND,EAEK+1B,GAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYhtB,EAAOmd,EAAcz6B,GAAO,kCAC9Bsd,EAAOmd,EAAcz6B,GAFnC,qCAKI,WAAS,WACDsD,EAAO,+PACXA,EAAO,6BAA+ByuB,KAAKzuB,GAE3C3V,KAAK+sC,UAAUsN,SAAS,cAGxB,IAAMllC,EAASyR,EAAE5mB,KAAK+sC,UAAUmF,cAAc,GAExC8J,EAASrvC,SAASC,cAAc,MACtCovC,EAAOhhB,GAAK,mBACZghB,EAAO7sB,UAAY,QACnBha,EAAOpF,YAAYisC,GAEnB,IAAMY,EAAsBjwC,SAASC,cAAc,OACnDgwC,EAAoB5hB,GAAK,sBACzB4hB,EAAoB5sB,UAAY,WAChC4sB,EAAoBhtC,MAAQ,2BAE5B,IAAMitC,EAAmBlwC,SAASC,cAAc,OAChDiwC,EAAiB7hB,GAAK,mBAElB,IAAM8hB,EAAanwC,SAASC,cAAc,OAC1CkwC,EAAW3tB,UAAY,MACvB2tB,EAAW9sB,UAAY,kBACvB6sB,EAAiB9sC,YAAY+sC,GAE7BD,EAAiB9sC,YAAY/P,KAAK+8C,2BAA2B,uBAAwB,KAAM,KAAMpnC,GAAM,SAAAnP,GACnG,EAAKumC,UAAUpmB,QAKf,EAAKgJ,MAAMqtB,aAAa,mBAI5B,IAAMC,EAAetwC,SAASC,cAAc,OAC5CqwC,EAAa9tB,UAAY,SACzB8tB,EAAajtB,UAAY,kBACzB6sB,EAAiB9sC,YAAYktC,GAEjC,IAAMC,EAAsBvwC,SAASC,cAAc,OACnDswC,EAAoBliB,GAAK,uBAErB,IAAMmiB,EAAiBxwC,SAASC,cAAc,OAC9CuwC,EAAehuB,UAAY,YAC3BguB,EAAentB,UAAY,kBAC3BktB,EAAoBntC,YAAYotC,GAMhC,IADJ,I,w5BAAA,CACqB7e,wBADrB,yBAEex6B,EAFf,QAGQkH,QAAQC,IAAI,IAAKnH,GAEjB,IAAM8kC,EAAQtK,mBAA6Bx6B,GAE3C+4C,EAAiB9sC,YAAY,EAAKgtC,2BAA2Bj5C,EAAG8kC,EAAMwU,WAAYxU,EAAMpvB,iBAAanZ,GAAW,SAAAmG,GAC5G83B,SAAmB,EAAK3O,MAAO7rB,QANvC,2BAA0B,IAF9B,8BAcA,IAAIu5C,EAAY,qhDAehBA,EAAY,6BAA+BjZ,KAAKiZ,GAEhDH,EAAoBntC,YAAY/P,KAAK+8C,2BAA2B,uBAAwB,KAAM,KAAM,gCAAgC,SAAAv2C,GAChIyF,OAAO4H,KAAK,+BAAgC,cAEhDqpC,EAAoBntC,YAAY/P,KAAK+8C,2BAA2B,qBAAsB,KAAM,KAAMM,GAAW,SAAA72C,GACzGyF,OAAO4H,KAAK,0CAA2C,cAI3D+oC,EAAoB7sC,YAAY8sC,GAChCD,EAAoB7sC,YAAYmtC,GAEhC/nC,EAAOpF,YAAY6sC,KApG3B,wCAuGI,SAA2Bl3C,EAAMmtC,EAAMrzC,GAA2C,IAArC89C,EAAqC,4DAA7Bj9C,EAAW25B,EAAkB,uDAAR,SAAAxzB,GAAC,OAAIA,GAErE+2C,EAAc,2aACPl9C,MAATi9C,IACAA,EAAQ,6BAA+BlZ,KAAKmZ,IAEhD,IAAMpzB,EAAOxd,SAASC,cAAc,OACpCud,EAAK6F,UAAY,yBAEjB,IAAMwtB,EAAO7wC,SAASC,cAAc,OAEhC4wC,EAAKxtB,UAAY,WAEjB,IAAMytB,EAAM9wC,SAASC,cAAc,OACnC6wC,EAAIxpC,IAAMqpC,EACVG,EAAI1wC,MAAQ,KACZ0wC,EAAIvwC,OAAS,KACbswC,EAAKztC,YAAY0tC,GAGjB,IAAMC,EAAO/wC,SAASC,cAAc,OAEhC8wC,EAAK1tB,UAAY,cAEjB,IAAM2tB,EAAYhxC,SAASC,cAAc,QACzC+wC,EAAUxuB,UAAYzpB,EACtB,IAAMk4C,EAAcjxC,SAASC,cAAc,QAC3CgxC,EAAYzuB,UAAY3vB,EAExBk+C,EAAK3tC,YAAY4tC,GACL,MAARn+C,EACAk+C,EAAK3tC,YAAY6tC,IAGjBD,EAAU/tC,MAAMiuC,SAAW,SAG3BH,EAAK9tC,MAAMkuC,eAAiB,UAGpCN,EAAKztC,YAAY2tC,GAEjB,IAAMK,EAAOpxC,SAASC,cAAc,OAEhCmxC,EAAK/tB,UAAY,cAEjB,IAAMguB,EAAYrxC,SAASC,cAAc,QACzCoxC,EAAU7uB,UAAY0jB,EACtB,IAAMoL,EAActxC,SAASC,cAAc,QAanD,OAXyB,MAAboxC,IACAD,EAAKhuC,YAAYiuC,GACjBD,EAAKhuC,YAAYkuC,IAGzBT,EAAKztC,YAAYguC,GAErB5zB,EAAKpa,YAAYytC,GAEjBrzB,EAAKpJ,iBAAiB,QAASiZ,GAExB7P,MApKf,GAA6C0iB,G,4gCCHrCjmB,GAAMC,WAAND,EAEKs3B,GAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYvuB,EAAOmd,EAAcz6B,GAAO,kCAC9Bsd,EAAOmd,EAAcz6B,GAFnC,0CAMI,SAAY8V,GAAS,YACjB,0DAAkBA,GAElB,IAAMolB,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SAEnCjoB,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,oBAAoB,SAAA0T,GAGnD,IAAMqiB,EAAO,EAAKh2B,UAAUi2B,2BAC5B,EAAK16C,OAAOy6C,GACZrlC,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,cAAe,QAAO,QAhBtF,oBAoBI,WAAkB,IAAX+1B,EAAW,uDAAJ,GACNE,EAAiBr+C,KAAK+sC,UAAUmF,aACpCtrB,GAAEy3B,GAAgBtC,IAAI,WAAY,QAClCn1B,GAAEy3B,GAAgB,GAAG1uC,aAAa,YAAa,+DAE/C0uC,EAAiBz3B,GAAEy3B,GAAgB,IAEpB5qB,UAAY,GAE3B,IAAM6qB,EAAmB3xC,SAASC,cAAc,OAChD0xC,EAAiBtuB,UAAY,8BAE7B,IAAMuuB,EAAoB5xC,SAASC,cAAc,OACjD2xC,EAAkBvuB,UAAY,8BAE9BhwB,KAAKw+C,oBAAsBD,EAE3BD,EAAiBvuC,YAAYwuC,GAE7BF,EAAe5qB,UAAY,GAC3B4qB,EAAetuC,YAAYuuC,GAE3B,IAtBc,EAsBV5/C,EAAI,EAtBM,KAuBEy/C,GAvBF,IAuBd,2BAAsB,KAAX33C,EAAW,QAClBxG,KAAKy+C,oBAAoBj4C,EAAG9H,KAC1BA,GAzBQ,iCApBtB,iCAiDI,SAAoBggD,EAAa32C,GAAO,WAC9B42C,EAAM3+C,KAAKw+C,oBAEXr0B,EAAOxd,SAASC,cAAc,OACpCud,EAAK6F,UAAY,sCAEjB,IAAMrkB,EAAQgB,SAASC,cAAc,OACrCjB,EAAMqkB,UAAY,4CAClBrkB,EAAMwjB,UAAYhtB,OAAO2J,OAAO4yC,GAAa,GAAG,GAAGh5C,KAEnD,IAAMs4B,EAAOrxB,SAASC,cAAc,OACpCoxB,EAAKhO,UAAY,uDAGb,IAAM4uB,EAASjyC,SAASC,cAAc,OACtCgyC,EAAO5uB,UAAY,gBACnB4uB,EAAOjzC,MAAQ,SACfizC,EAAOnrB,UAAY,qCACnB7M,GAAEg4B,GAAQC,OAAM,WACZ10B,EAAK6F,UAAUzjB,IAAI,qBACpB,WACC4d,EAAK6F,UAAUtD,OAAO,qBAG1BkyB,EAAO79B,iBAAiB,SAAS,SAAAoP,GAE7B,IAAM2uB,EAAM,EAAK32B,UAAU6e,6BAA6Bj/B,GACxD,EAAK4nB,MAAMoS,yBAAyB,CAAE7C,UAAW4f,EAAI,KAGrD,EAAK32B,UAAU42B,4BAA4Bh3C,GAGvC,EAAK4nB,MAAMzC,gCAAgC,EAAM,GAAI,CACjDC,gBAAgB,OAK5B6Q,EAAKjuB,YAAY6uC,GAGrBz0B,EAAKpa,YAAYpE,GACjBwe,EAAKpa,YAAYiuB,GACjB2gB,EAAI5uC,YAAYoa,OA7FxB,GAAyD0iB,G,4gCCDjDjmB,GAAMC,WAAND,EAEKo4B,GAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYrvB,EAAOmd,EAAcz6B,GAAO,uBACpC,cAAMsd,EAAOmd,EAAcz6B,IAEtB4sC,WAAa,KAClB,EAAKC,cAAgB,KAGrB,IAAMb,EAAiB,EAAKtR,UAAUmF,aAPF,OAQpCtrB,GAAEy3B,GAAgBtC,IAAI,WAAY,QAElC,EAAKoD,mBAAoB,EAVW,EAD5C,0CAcI,SAAYh3B,GAAS,YACjB,0DAAkBA,GAElB,IAAMiF,EAAYptB,KAEZutC,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SACnCjoB,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,yBAAyB,SAAC0T,GAExD,IAAMz4B,EAAIy4B,EACQ,iBAANz4B,GACRuI,KAAKsR,MAAM4e,GAEf,IAAMsjB,EAAM/7C,EAAE,EAAKqqC,WAAL,eACFrtC,IAAR++C,IAGJtmC,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,mBAAoB,QAAO,GAEnF,EAAK1kB,OAAO07C,OAGhBp/C,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,iBAAiB,SAAA0T,GAC/C,IAAMiY,EAAQ,GACdA,EAAM,EAAKrG,WAAL,UAA+B,GACrC50B,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,WAAY2rB,KAAQ,MAGhF,IAAMsL,EAAQr/C,KAAK0tC,WAAL,SACd1tC,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,qBAAuBi3B,IAAQ,SAAAvjB,GAE7D,IAAMz4B,EAAIuI,KAAKsR,MAAM4e,QAETz7B,IADAgD,EAAEi8C,gBAKdxmC,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,gBAAkBi3B,GAAQ,QAAO,GAEzF,EAAK37C,OAAOL,OAGhBrD,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,kCAAoCi3B,IAAQ,SAAAvjB,GAE3E,EAAKyjB,mBAAmBzjB,GAAK/e,SAAQ,SAAAvW,GAAC,OAAI,EAAKg5C,wBAAwBh5C,SAI3ExG,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,4BAA8Bi3B,IAAQ,SAAAvjB,GAErE,IAAM2jB,EAAa,EAAKF,mBAAmBzjB,GAE3ChjB,YAAW,kBAAMy0B,EAAGhhB,KAAKa,EAAU8f,SAAS9kB,YAAY,uBAAyBi3B,GAAQI,KAAa,MAG1Gz/C,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,6BAA+Bi3B,IAAQ,SAAAvjB,GAGtE,IADA,IAAMhrB,EAAW,EAAK48B,WAAL,UACjB,MAAgBvrC,OAAO2J,OAAOgF,GAA9B,eAAyC,CAApC,IAAoC,OAA7B,MAA6B,IACrC,2BAAmB,KAARpB,EAAQ,aAELrP,IAANqP,GAEAA,EAAE6pC,SAAWzd,GAGbpsB,EAAEq/B,eAAe3yB,cAAc,IAAIsjC,MAAM,WARZ,mCAc7C1/C,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,8BAAgCi3B,IAAQ,SAAAvjB,GACvE,EAAK1N,qBAAL,SAAI,OAAyBxiB,KAAKsR,MAAM4e,QAG5C97B,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,iCAAmCi3B,IAAQ,SAAAvjB,GAE1E,IAAMt1B,EAAIoF,KAAKsR,MAAM4e,GACrB,EAAK5N,oBAAL,SAAI,OAAwB1nB,OAEhCxG,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,wBAAwB,SAAA0T,GACvD,EAAK6jB,kBAAkB7jB,EAAIX,SAAUW,EAAIV,cAG7Cp7B,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,yBAA2BpoB,KAAK0tC,WAAW1gB,UAAU,SAAC8O,GACrF,EAAKhO,gBAAgBgO,EAAIlO,QAASkO,EAAIp2B,KAAMo2B,EAAIr8B,OAChDqZ,YAAW,kBAAMy0B,EAAGhhB,KAAK,EAAKpE,UAAUC,YAAY,oBAAsB,EAAKslB,WAAW1gB,SAAU,QAAO,QApGvH,gCAwGI,SAAmB4yB,GAIf,IAHA,IAAM53C,EAAM,GACN63C,EAAY,IAAMD,EAAUrnB,SAAW,IAAMqnB,EAAUpnB,QACvD1nB,EAAW9Q,KAAK0tC,WAAL,UACjB,MAAgBvrC,OAAO2J,OAAOgF,GAA9B,eAAyC,CAApC,IAAoC,OAA7B,MAA6B,IACrC,2BAAmB,KAARpB,EAAQ,aAELrP,IAANqP,GAEYA,EAAE6e,QAENjjB,SAASu0C,IACjB73C,EAAIxG,KAAKkO,IARoB,+BAYzC,OAAO1H,IAxHf,qCA2HI,SAAwBqlB,GAGpB,IAFA,IAAMyhB,EAAOzhB,EAAK0hB,eACdhJ,EAAI+I,EAAKtU,WACNuL,GACHA,EAAE/V,UAAUtD,OAAO,eACnBqZ,EAAIA,EAAE+Z,uBAGVl5B,GAAEkoB,GAAMiN,IAAI,QAAS,OACrBjjC,YAAW,SAAAtS,GACPogB,GAAEkoB,GAAMiN,IAAI,QAAS,MACtB,OAtIX,6BAyII,SAAgB1uB,EAAM3nB,EAAMjG,GACxB,OAAOO,KAAK+/C,iBAAiB1yB,EAAM3nB,EAAMjG,KA1IjD,8BA6II,SAAiB4tB,EAAM3nB,EAAMjG,GACzB4tB,EAAKO,QAAQloB,GAAQjG,IA9I7B,8BAiJI,SAAiB4tB,EAAMvb,EAAKqc,GAIxB,IAAMb,EAASD,EAAK2yB,WAIdtF,EAAe,CACrBA,KAAoB,kBAAMrtB,EAAK2yB,aAC/BhgD,KAAK2vB,MAAMknB,yBAJO72C,KAI6B06C,EAAcptB,EAAQ,CACjExV,KAAM,iBACN0W,UAAWxuB,KAAK0tC,WAAL,SACXrf,SAAUhB,EAAKgB,SACfvc,IAAKA,EACLqc,aAAcA,MAhK1B,kCAqKI,SAAqB8xB,GACjBjgD,KAAKktC,SAASnf,QAAQ,CAAC,aAAa,SAAAoK,MACjC,CACC7K,OAAQ1hB,KAAKC,UAAU,CACnBiM,KAAM,qBACN0W,UAAWxuB,KAAK0tC,WAAL,SACX2H,SAAU4K,IAEdjyB,QAAS,QA7KrB,uCAiLI,WACIhuB,KAAKktC,SAASnf,QAAQ,CAAC,aAAa,SAAAoK,MACjC,CACC7K,OAAQ1hB,KAAKC,UAAU,CACnB2iB,UAAWxuB,KAAK0tC,WAAL,SACX51B,KAAM,qBAEVkW,QAAS,QAxLrB,sBA4LI,SAASkyB,GAAI,aAEHC,EAAO,GAFJ,KAIOD,GAJP,IAIT,2BAAoB,KAAT15C,EAAS,aACSnG,IAArB8/C,EAAK35C,EAAE6nB,YACP8xB,EAAK35C,EAAE6nB,UAAY,IAEvB8xB,EAAK35C,EAAE6nB,UAAU7sB,KAAKgF,IARjB,8BAWT,IADA,IAAM45C,EAAU,GAChB,MAAgBj+C,OAAOoM,QAAQ4xC,GAA/B,eAAsC,CAAjC,IAAM35C,EAAC,KACFE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GACZ45C,EAAQ5+C,KAAK,CAACkF,EAAGC,IAErB,IAhBS,OAgBMy5C,EAAQt4C,MAAK,SAACvG,EAAGmG,GAAJ,OAAUnG,EAAE,GAAGwnB,cAAcrhB,EAAE,QAhBlD,IAiBT,2BAAwB,KAAbsnB,EAAa,QACdznB,EAAIynB,EAAE,GACNxoB,EAAIwoB,EAAE,GAERtwB,EAAI,EACJ2hD,OAAiBhgD,EACjBmG,EAAE/H,OAAS,GAAG,YAEd4hD,EAAiB1zC,SAASC,cAAc,QACzBojB,UAAY,cAE3B,IAAMswB,EAAU3zC,SAASC,cAAc,OAE7B2zC,EAAe5zC,SAASC,cAAc,QAC5C2zC,EAAapxB,UAAY5nB,EACzB+4C,EAAQtwB,UAAY,kBACpBswB,EAAQvwC,YAAYwwC,GAEpBD,EAAQv/B,iBAAiB,SAAS,SAAAva,GAC9B85C,EAAQtwB,UAAUqc,OAAO,kBAIjCgU,EAAetwC,YAAYuwC,GAE3B,EAAKE,qBAAqBzwC,YAAYswC,GAnBxB,GANE,WA2BJ75C,GA3BI,IA2BpB,2BAAmB,KAARhB,EAAQ,QACfxF,KAAKkvC,QAAQ1pC,EAAG9G,EAAG2hD,KACjB3hD,GA7Bc,gCAjBf,8BAiDT,IAAM6F,EAAKvE,KAAK0tC,WAChBnpC,EAAGiW,UAAY2lC,EACfngD,KAAKitC,YAAY1oC,KA/OzB,kCAkPI,SAAqB8pB,EAAUC,EAASC,GAAS,WAC7CvjB,QAAQC,IAAI,uBAAwB/K,WAEpCF,KAAKygD,qBAAqBlyB,GAE1B,IAAMklB,EAASzzC,KAAK0tC,WACdgT,EAAQjN,EAAOj5B,UAAU6T,GAAUC,GAASygB,eAClDnoB,GAAE85B,GAAO3E,IAAI,aAAc,SAE3BjjC,YAAW,WACP,EAAK6nC,4BACL/5B,GAAE85B,GAAO3E,IAAI,aAAc,MAC5B,OA9PX,iCAiQI,SAAoBv1C,EAAGsL,EAAK8uC,GAAQ,WAChC,IAAI5gD,KAAKm/C,kBAAT,CAEAn/C,KAAKm/C,mBAAoB,EACzB,IACM3kC,EADSxa,KAAK0tC,WACI,UAClBqG,EAAQ,GACR8M,EAAMj1C,KAAKsR,MAAMtR,KAAKC,UAAU2O,EAAUhU,EAAE6nB,UAAUvc,KAC5DiiC,EAAM/zC,KAAK0tC,WAAL,UAA+B,CAAC,CAClChoC,KAAMk7C,EACNtzB,OAAQ,CACJxrB,MAAO++C,EAAG,cAIlB,IAAMx6C,EAAM,SAACG,GAET,EAAKmpB,MAAMzC,gCAAgC,EAAM,CAC7CsT,QAASuT,GACV,CACC5mB,gBAAgB,IACjB,WACC,EAAKhF,UAAU24B,aAAat6C,EAAC,YAAiButC,GAE9C,EAAK5rB,UAAU4F,QAAQ,CAAC,eAAe,SAAAvnB,GACnC,EAAK24C,mBAAoB,IAC1B,CACCzkB,WAAY,WACR,EAAKykB,mBAAoB,QAGlC,WAEC,EAAKA,mBAAoB,MAIjCn/C,KAAKmoB,UAAU4F,QAAQ,CAAC,gBAAgB,SAAAvnB,GACpCwE,QAAQC,IAAI,eAAgBzE,GACE,iBAAlBA,EAAEqzB,cACVrzB,EAAEqzB,YAAcjuB,KAAKsR,MAAM1W,EAAEqzB,cAEjC/gB,WAAWzS,EAAK,GAAIG,KACrB,OA5SX,+BA+SI,SAAkB20B,EAAUC,GAAW,WACnC,IAAIp7B,KAAKm/C,kBAAT,CAEAn/C,KAAKm/C,mBAAoB,EACzB,IAAMpL,EAAQ,GACdA,EAAM/zC,KAAK0tC,WAAL,UAA+B,CAAC,CAClChoC,KAAM01B,EACN9N,OAAQ,KAGZ,IAAMjnB,EAAM,WAER,EAAKspB,MAAMzC,gCAAgC,EAAM,CAC7CuS,MAAMiC,OAAevG,IACtB,KAGPn7B,KAAKmoB,UAAU4F,QAAQ,CAAC,gBAAgB,SAAAvnB,GACpCwE,QAAQC,IAAI,eAAgBzE,GACE,iBAAlBA,EAAEqzB,cACVrzB,EAAEqzB,YAAcjuB,KAAKsR,MAAM1W,EAAEqzB,cAEjC,EAAK1R,UAAU24B,aAAat6C,EAAC,YAAiButC,GAE9C,EAAK5rB,UAAU4F,QAAQ,CAAC,eAAe,SAAAvnB,GACnC,EAAK24C,mBAAoB,IAC1B,CACCzkB,WAAY,WACR,EAAKykB,mBAAoB,KAIjCrmC,WAAWzS,EAAK,MACjB,OAhVX,qBAmVI,SAAQG,GAAyC,WAAtCsL,EAAsC,uDAAhC,EAAGivC,EAA6B,4DAAX1gD,EAE9BugD,EAASp6C,EAAE6nB,SAGJ,GAAPvc,IACA8uC,GAAU,IAAM9uC,GAEpBtL,EAAE+yC,QAAUqH,EAEZ,IAAMI,OAA+B3gD,IAApB0gD,EACb/gD,KAAKwgD,qBAAuBO,EAG1BE,EAAYt0C,SAASC,cAAc,OACzCq0C,EAAUjxB,UAAY,sBAGtB,IAAMrkB,EAAQgB,SAASC,cAAc,OACrCjB,EAAMwjB,UAAYyxB,EAElBj1C,EAAMoV,iBAAiB,cAAc,SAAAoP,GACjC,EAAKswB,qBAAqBj6C,EAAE+nB,YAEhC5iB,EAAMoV,iBAAiB,cAAc,SAAAoP,GACjC,EAAKwwB,+BAGTh1C,EAAMoV,iBAAiB,SAAS,SAAAoP,GAE5B,EAAKjC,oBAAoB1nB,EAAGsL,EAAK8uC,MAGrCj1C,EAAMgE,aAAa,YAAa,uCAAyCnJ,EAAE6nB,SAAW,MACtF7nB,EAAEuoC,eAAiBpjC,EAGnB,IAAMqyB,EAAOrxB,SAASC,cAAc,OAG1Bs0C,EAAav0C,SAASC,cAAc,KAC1Cs0C,EAAWlxB,UAAY,GACvBkxB,EAAW/xB,UAAY,MAEvB+xB,EAAWngC,iBAAiB,SAAS,SAAAoP,GAEjC,EAAK0pB,iBAAiBrzC,EAAGsL,EAAK,CAACtL,EAAGsL,EAAK8uC,OAG3C5iB,EAAKjuB,YAAYmxC,GAYrBD,EAAUlxC,YAAYpE,GACtBs1C,EAAUlxC,YAAYiuB,GAGtBgjB,EAAQjxC,YAAYkxC,KApZ5B,oBAuZI,WAA6B,IAAtBE,EAAsB,4DAAX9gD,EACd,GAAgBA,MAAZ8gD,EAAuB,CAEvB,IAAM1N,EAASzzC,KAAK0tC,WACpBvrC,OAAOwxB,OAAO8f,EAAQ0N,GACtBnhD,KAAK60C,WAAWpB,GAEpB,IAAIA,EAASzzC,KAAK0tC,WACK,iBAAX+F,IACRA,EAAS7nC,KAAKsR,MAAMu2B,IAExB,IAAI6L,OAAgBj/C,EACpB,GAA4BA,MAAxBozC,EAAO6L,cACPA,EAAgB7L,EAAO6L,mBACpB,GAA4Bj/C,MAAxBozC,EAAOzT,cAA4B,CAC1C,IAAMvZ,EAAQ7a,KAAKsR,MAAMu2B,EAAOzT,eAChCsf,EAAgB74B,EAAM64B,cAE1B,IAAMnqC,EAAUnV,KAAK+sC,UAAUmF,aAAc,GAC7C/8B,EAAOse,UAAY,GAEnB,IAAM2tB,EAASz0C,SAASC,cAAc,OACtCw0C,EAAOpxB,UAAY,eACnB,IAAMgxB,EAAUr0C,SAASC,cAAc,OAEvC5M,KAAKwgD,qBAAuBQ,EAE5BI,EAAOrxC,YAAYixC,GAEnB7rC,EAAOpF,YAAYqxC,GAEE/gD,MAAjBi/C,GACAt/C,KAAKqhD,SAAS/B,OAvb1B,GAA4DzS,G,2GCDrD,IAAMyU,GAAb,6B,IAAA,G,EAAA,E,gaACI,WAAY3xB,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IAEtBi+B,OAAS,KAHsB,EAD5C,0CAOI,SAAYnoB,GAAS,YACjB,0DAAkBA,GAElB,IAAMiF,EAAYptB,KAEZutC,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SACnCjoB,KAAKkoB,GAAGloB,KAAKktC,SAAS9kB,YAAY,mBAAmB,SAAC0T,GAElDhjB,YAAW,SAAAtS,GAAC,OAAI+mC,EAAGhhB,KAAKa,EAAUjF,UAAUC,YAAY,aAAc,QAAO,GAC7E,IAAM2qB,EAAYjX,EAClB,EAAKylB,SAASxO,QAjB1B,sBAqBI,SAASrzC,GACLsL,QAAQC,IAAI,QAASvL,GAErB,IAAI8hD,EAAe,GACnB,GAAsB,iBAAV9hD,EACRM,KAAKswC,OAAOnK,SAASzmC,QACpB,GAAId,MAAMoF,QAAQtE,GAAQ,S,05BAAA,CACXA,GADW,IAC3B,2BAAuB,KAAZyB,EAAY,QACNd,MAATc,EAAE26B,MACF0lB,GAAgBrgD,EAAE26B,KAEtB9wB,QAAQC,IAAI,gBAAiB9J,IALN,8BAO3BnB,KAAKswC,OAAOnK,SAASqb,GAEzBxhD,KAAKitC,YAAY,CAAE,MAASvtC,MApCpC,gCAuCI,SAAmB4wC,GAAQ,WACvBtwC,KAAKswC,OAASA,EAEDtwC,KAAK+sC,UAAUmF,aAAa,GACpCnxB,iBAAiB,UAAU,SAAAva,GAC5B,EAAK8pC,OAAOlzB,gBA5CxB,GAAyCyvB,GCAlC,IAAM4U,GAAb,6B,IAAA,G,EAAA,E,gaACI,WAAY9xB,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IAEtBq9B,oBAAsB,KAHS,EAD5C,qCAQI,WAAS,WACCv6B,EAASnV,KAAK+sC,UAAUmF,aAAa,GAErCwP,EAAoB/0C,SAASC,cAAc,OAE3C+0C,EAA4Bh1C,SAASC,cAAc,OAErDd,EAAS,CACT,qBAAsB,GACtB,KAAQ,YACR,WAAW,EACX,UAAW9L,KAAK2vB,MAAMhH,SACtB,mBAAoB,GACpB,gBAAmB,MACnB,oBAAqB,OAGrB2E,EAAS,GAETF,EAAY,KAGhBA,EAAY,CACRU,gBAAiB,SAACT,EAAM3nB,EAAMjG,GAC1B,GAAY,sBAARiG,GACI,EAAKiqB,MAAM7G,gBAAgBxhB,KAAI,SAAAd,GAAC,OAAIA,EAAE,yBAAuB8E,SAAS7L,GAAQ,CAG9E,IADA,IAAMgtB,EAAO,EAAKkD,MAAM7G,cAAcrpB,GAFwC,aAGzE,IAAM+G,EAAC,KACFG,EAAI8lB,EAAKjmB,GACJ8mB,EAAOs0B,MAAK,SAAAr6C,GAAC,OAAIA,EAAE7B,MAAQc,KACnC/G,MAAQkH,GAHf,MAAgBxE,OAAOsE,KAAKgmB,GAA5B,eAAmC,IAQnC,OAHA3gB,EAAS2gB,EACTk1B,EAA0BluB,UAAY,QACtC,EAAK9D,MAAMkqB,iBAAiBzsB,EAAWC,EAAMC,EAAQq0B,EAA2B,IAIxF71C,EAAOpG,GAAQjG,KAcnB6tB,EAAS,CAAC,CACN5nB,KAAM,qBACNoS,KAAM,WACNrY,MAAOqM,EAAO,sBACdqP,QAASnb,KAAK2vB,MAAM7G,gBAAgBxhB,KAAI,SAAAd,GAAC,OAAIA,EAAE,yBAC/CtD,KAAM,8BACP,CACCwC,KAAM,OACNoS,KAAM,WACNrY,MAAOqM,EAAM,KACb5I,KAAM,iCAMH6Z,SAAQ,SAAAvW,GAAC,OAAIA,EAAEmnB,SAAW,aAEjC,IAAMk0B,EAAe,CAAC,CAClBn8C,KAAM,UACNoS,KAAM,OACNrY,MAAOqM,EAAO,WACd5I,KAAM,gEACP,CACCwC,KAAM,UACNoS,KAAM,MACNrY,MAAOqM,EAAO,WACd5I,KAAM,0GACP,CACCwC,KAAM,mBACNoS,KAAM,MACNrY,MAAOqM,EAAO,oBACd5I,KAAM,2GAKV2+C,EAAa9kC,SAAQ,SAAAvW,GAAC,OAAIA,EAAEmnB,SAAW,YAEvC,IAAMm0B,EAAwB,CAAC,CAC3Bp8C,KAAM,kBACNoS,KAAM,cACNrY,MAAOqM,EAAM,gBACbqP,QAAS,CAAC,MAAO,UAAW,QAC5BjY,KAAM,uCAEV,CACIwC,KAAM,oBACNoS,KAAM,OACNrY,MAAOqM,EAAO,qBACd5I,KAAM,6KAOV4+C,EAAsB/kC,SAAQ,SAAAvW,GAAC,OAAIA,EAAEmnB,SAAW,eAIhDL,EAAS,GAAH,eAAOA,GAAWu0B,EAAiBC,GAEzC,IAAMz0B,EAAO,CACTxV,KAAM,kBAAMyV,IAIhBttB,KAAK2vB,MAAMkqB,iBAAiBzsB,EAAWC,EAAMC,EAAQq0B,EAA2B,IAIpFD,EAAkB3xC,YAAY4xC,GAG9BxsC,EAAOpF,YAAY2xC,GAEnB,IAAMK,EAAep1C,SAASC,cAAc,UAC5Cm1C,EAAa5yB,UAAY,OACzB4yB,EAAahhC,iBAAiB,SAAS,SAAAoP,GACnC,EAAKR,MAAMqyB,gBAAgBl2C,MAE/BqJ,EAAOpF,YAAYgyC,OA/I3B,GAA6ClV,GCAtC,IAAMoV,GAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYtyB,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IACtB6vC,OAAS,KAFsB,EAD5C,0CAMI,SAAY/5B,GAAS,YACjB,0DAAkBA,GAElB,IAAMolB,EAAKvtC,KAAK2vB,MAAM3H,aAAaC,SAC7BmF,EAAYptB,KAElBA,KAAKkoB,GAAGloB,KAAKmoB,UAAUC,YAAY,kBAAkB,SAAC0T,GAClDhjB,YAAW,SAAAtS,GAAC,OAAI+mC,EAAGhhB,KAAKa,EAAUjF,UAAUC,YAAY,YAAa,QAAO,GAC5E,EAAK+5B,QAAQrmB,EAAI+W,WAd7B,oBAkBI,WACI,IAAM1oB,EAAOnqB,KAAK+sC,UAAUmF,aAAa,GACzC/nB,EAAKsJ,UAAY,GAGjB,IAAMnT,EAAS3T,SAASC,cAAc,UACtCud,EAAKpa,YAAYuQ,GAEjB,IAAM8hC,EAAWpiD,KAAK0tC,gBACIrtC,IAAtB+hD,EAASC,WACTD,EAASC,SAAW,IAGxBr3C,QAAQC,IAAI,yBAA0Bm3C,EAASC,UAG/C,IADA,IAAMC,EAAS,GACN5jD,EAAI,EAAGA,EAAI0jD,EAASC,SAAS5jD,SAAUC,EAC5C4jD,EAAO9gD,KAAK9C,GAGhBsB,KAAKkiD,OAAS,IAAIzmC,MAAM6E,EAAOxT,WAAW,MAAO,CAC7CgL,KAAM,MAEND,KAAM,CACFyqC,OAAQA,EACRC,SAAU,CAAC,CACPlnB,MAAO,mBACPmnB,gBAAiB,OACjB3qC,KAAMuqC,EAASC,SAAS/6C,KAAI,SAAAd,GAAC,OAAIA,QAGzC2U,QAAS,CACLC,YAAY,EACZG,OAAQ,CACJT,MAAO,CAAC,CACJjL,SAAS,EACT4yC,MAAO,CACHC,aAAa,KAGrB7nC,MAAO,CAAC,CACJhL,SAAS,EACT4yC,MAAO,CACHE,UAAU,MAItBjmC,OAAQ,CAEJf,SAAU,OAEdhQ,MAAO,CACHkE,SAAS,EACT0K,KAAM,sBAIlBva,KAAKkiD,OAAOhvC,WA3EpB,qBA8EI,SAAQ0vC,GACJ,IAAMR,EAAWpiD,KAAK0tC,gBACIrtC,IAAtB+hD,EAASC,WACTD,EAASC,SAAW,IAExBD,EAASC,SAAS7gD,KAAKohD,GACvB5iD,KAAK60C,WAAWuN,GAEhBpiD,KAAK0D,aAtFb,GAA6CmpC,G,2GCCtC,IAAMgW,GAAb,6B,IAAA,G,EAAA,E,gaAMI,WAAYlzB,EAAOmd,EAAcz6B,GAAO,kCAC9Bsd,EAAOmd,EAAcz6B,GAPnC,0CAWI,SAAY8V,GAAS,YACjB,0DAAkBA,GAElB,IAAI26B,GAAU,EAGd9iD,KAAK+iD,gBAAkBxa,aAAY,WAC/B/e,GAAa,kCAAmC,IAAI,SAAAC,GAChD,GAAuB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,OAAgB,CAE5C,IAF4C,EAExChqB,GAAO,EAFiC,E,05BAAA,CAG/BiM,KAAKsR,MAAMuM,EAAIK,UACTurB,UAJyB,IAK5C,2BAAuB,KACbhyC,EADa,QACP8X,QACM,iBAAN9X,IACR2H,QAAQC,IAAI,QAAS5H,GACZ,YAALA,IAEA1D,GAAO,EACPmjD,GAAU,KAZsB,8BAiBxCA,GAAWnjD,IACXmjD,GAAU,EACV,EAAKnzB,MAAMqzB,uBAKxB,OA3CX,mBA8CI,WACIva,cAAczoC,KAAK+iD,iBACnB/iD,KAAK+iD,gBAAkB,MACvB,uDAjDR,qBAoDI,YACI,yDArDR,oBAwDI,WAAS,WACC5tC,EAASnV,KAAK+sC,UAAUmF,aAAa,GAE3C/8B,EAAOse,UAAY,0GAMnB,IAAMwvB,EAAet2C,SAASC,cAAc,KAC5Cq2C,EAAa9zB,UAAY,6BACzB8zB,EAAahb,KAAOib,SAAW,oCAAsCljD,KAAK2vB,MAAMpG,cAAgB,IAChG05B,EAAaE,SAAW,mBAExB,IAAMC,EAAmBz2C,SAASC,cAAc,KAChDw2C,EAAiBj0B,UAAY,eAC7Bi0B,EAAiBnb,KAAOib,SAAW,+BAAiCljD,KAAK2vB,MAAMpG,cAAgB,IAC/F65B,EAAiBD,SAAW,kBAE5B,IAAME,EAAa12C,SAASC,cAAc,UAC1Cy2C,EAAWl0B,UAAY,yBACvBk0B,EAAWtiC,iBAAiB,SAAS,WACjCyI,GAAa,iCAAkC,CAC3CF,UAAW,EAAKqG,MAAMpG,gBACvB,SAAA/iB,UAIP,IAAM88C,EAAiB32C,SAASC,cAAc,UAC9C02C,EAAen0B,UAAY,oBAC3Bm0B,EAAeviC,iBAAiB,SAAS,WACrCyI,GAAa,4BAA6B,CACtCF,UAAW,EAAKqG,MAAMpG,gBACvB,SAAA/iB,UAIP,IAAM+8C,EAAa52C,SAASC,cAAc,UAC1C22C,EAAWp0B,UAAY,kCACvBo0B,EAAWxiC,iBAAiB,SAAS,WACjC,EAAK4O,MAAMqzB,mBAGf,IAAMQ,EAAe72C,SAASC,cAAc,UAC5C42C,EAAar0B,UAAY,gBACzBq0B,EAAaziC,iBAAiB,SAAS,WACnC,EAAK4O,MAAM8zB,mBAGf,IAAMC,EAAQ/2C,SAASC,cAAc,OACrC82C,EAAM1zB,UAAY,cAElB0zB,EAAM3zC,YAAYkzC,GAClBS,EAAM3zC,YAAYqzC,GAClBM,EAAM3zC,YAAYszC,GAClBK,EAAM3zC,YAAYuzC,GAClBI,EAAM3zC,YAAYwzC,GAClBG,EAAM3zC,YAAYyzC,GAElBruC,EAAOpF,YAAY2zC,OAnH3B,GAA0D7W,G,mhCCD1D,IAAI8W,GAAkB,EAyJtB,SAASC,GAAS/2C,EAAKg3C,EAAQC,EAAUC,GAAqB,IAAb96C,EAAa,uDAAR,OAM9C8D,EAAQ,kBAAMF,EAAIyT,OAAOvT,OACzBG,EAAS,kBAAML,EAAIyT,OAAOpT,QAG9BL,EAAI4B,OAEM,SAAPxF,EACC4D,EAAIm3C,YAAY,CAAC,GAAI,KAGrBn3C,EAAIm3C,YAAY,IAEpBn3C,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAI4F,UAAY,EAEhB,IAAIwxC,EAAa/2C,IAAW22C,EAAOttC,IAAMstC,EAAOrtC,OAC5C0tC,EAAWD,EAAaH,EAASK,MAEjCC,EAASN,EAASO,oBAAoBN,GACtCx8C,EAAI2F,IAAW22C,EAAOrtC,OAAS0tC,EAAWE,EAE9Cv3C,EAAIkR,OAAO8lC,EAAOxtC,KAAM9O,GACxBsF,EAAImR,OAAOjR,IAAU82C,EAAOvtC,MAAO/O,GACnCsF,EAAIgG,SAEJhG,EAAI0F,YAEJ1F,EAAIoC,KAAO,aACXpC,EAAI6B,UAAY,QAEhB7B,EAAImC,UAAY,QAChBnC,EAAIkC,aAAe,SACnBlC,EAAIwC,SAAS00C,EAAOt+C,WAAa,UAAWsH,IAAU82C,EAAOvtC,MAAO/O,GAEpEsF,EAAI+B,UAGR,SAAS01C,GAAgBnpC,GACrB,OAAOA,EAAQopC,iBAAiBppC,EAAQgpC,MAAQ,GAAKhpC,EAAQqpC,gBAOjE,SAASC,GAAU53C,EAAKi3C,EAAUD,EAAQpkD,GACtC,IAAIyN,EAAS,kBAAML,EAAIyT,OAAOpT,QAE1Bw3C,GADax3C,IAAW22C,EAAOttC,IAAMstC,EAAOrtC,QAClBstC,EAASK,MAEnC3uC,EAAMsuC,EAASO,oBAAoB5kD,GAGvC,OAFQyN,IAAW22C,EAAOrtC,OAASkuC,EAAalvC,EAKpD,SAASmvC,GAAU93C,EAAK+3C,EAAUf,EAAQpkD,GACtC,IAEIolD,GAFch4C,EAAIyT,OAAOvT,MACF82C,EAAOxtC,KAAOwtC,EAAOvtC,OAClBsuC,EAAST,MAEnC3uC,EAAMovC,EAASP,oBAAoB5kD,GAGvC,OAFQokD,EAAOxtC,KAAOwuC,EAAarvC,EAKvC,SAASsvC,GAAmBj4C,EAAKg3C,EAAQe,EAAUd,EAAUiB,GAEzD,IAKI73C,EAAS,kBAAML,EAAIyT,OAAOpT,QAE9BL,EAAI4B,OAEJ5B,EAAI2F,YAAc,QAClB3F,EAAI4F,UAAY,EAEhB,IAWIiC,EAVAgwC,GADax3C,IAAW22C,EAAOttC,IAAMstC,EAAOrtC,QAClBstC,EAASK,MAGnCU,GAZch4C,EAAIyT,OAAOvT,MAWF82C,EAAOxtC,KAAOwtC,EAAOvtC,OAClBsuC,EAAST,MAEnCa,EAAUV,GAAgBR,GAC1BmB,EAAUX,GAAgBM,GAG1BhwC,EAAOmwC,EAAkBE,EAG7BrwC,EAAO5O,KAAKwsB,IAAI5d,EAAMowC,GACtBtwC,EAAO1O,KAAKwsB,IAAI5d,EAAOmwC,EAAiBE,GAGxC,IAAIC,EAAgBpB,EAASO,oBAAoCO,EAxDlDL,gBAAgB,GAwD8CQ,GACzEI,EAAUj4C,IAAW22C,EAAOrtC,OAASkuC,EAAaQ,EAElDE,EAAUtB,EAASO,oBAAoBzvC,GACvCrN,EAAI2F,IAAW22C,EAAOrtC,OAASkuC,EAAaU,EAE5CC,EAAUT,EAASP,oBAAoB3vC,GACvClO,EAAIq9C,EAAOxtC,KAAOwuC,EAAaQ,EAGnCx4C,EAAIkR,OAAO8lC,EAAOxtC,KAAM8uC,GAExBt4C,EAAImR,OAAOxX,EAAGe,GACdsF,EAAIgG,SAGJhG,EAAIoX,UAAUzd,GAAIe,EAAIs8C,EAAOttC,IAAMstC,EAAOrtC,QAC1C,IAAI8uC,EAAQt/C,KAAKu/C,MAAMh+C,EAAI49C,EAAS3+C,EAAIq9C,EAAOxtC,MAC/CxJ,EAAIsX,OAAOmhC,GACXz4C,EAAIoC,KAAO,aACXpC,EAAI6B,UAAY,QAEhB7B,EAAImC,UAAY,QAChBnC,EAAIkC,aAAe,SACnBlC,EAAIwC,SAAS01C,EAAgBt/C,WAAa,OAAQ,EAAG,GAGrDoH,EAAI+B,UAGR,IAAI42C,GAAU,GACVC,GAAa,GACbC,GAAkB,GAGtB,SAASC,GAAU94C,EAAK+4C,GACpB/4C,EAAI4U,UAAU,EAAG,EAAG5U,EAAIyT,OAAOvT,MAAOF,EAAIyT,OAAOpT,QACjD04C,EAAQC,WAERD,EAAQE,oBACRF,EAAQG,sBAERH,EAAQI,cAERJ,EAAQK,WAIZ,SAASC,GAAQr5C,EAAK+3C,EAAUd,EAAUD,EAAQsC,EAAcC,GAAyB,IAAV/yC,EAAU,uDAAH,EAClFxG,EAAI4B,OAEJ,IAAIjI,EAAIm+C,GAAU93C,EAAK+3C,EAAUf,EAAQuC,GACrC7+C,EAAIk9C,GAAU53C,EAAKi3C,EAAUD,EAAQsC,GAErCE,EAAMhzC,EAEVxG,EAAI6B,UAAY,MAChB7B,EAAI8B,SAASnI,EAAI6/C,EAAK9+C,EAAI8+C,EAAW,EAANA,EAAe,EAANA,GAExCx5C,EAAI+B,UAGR,SAAS03C,GAAOz5C,EAAK+3C,EAAUd,EAAUD,EAAQsC,EAAcC,EAAeprB,GAC1E,IAAIx0B,EAAIm+C,GAAU93C,EAAK+3C,EAAUf,EAAQuC,GACrC7+C,EAAIk9C,GAAU53C,EAAKi3C,EAAUD,EAAQsC,GACzCX,GAAQhkD,KAAK,CAACgF,EAAGA,EAAGe,EAAGA,EAAGg/C,WAAYJ,EAAcK,YAAaJ,EAAeK,WAAW,EAAOzrB,GAAIA,IAI1G,SAAS0rB,GAAY75C,EAAKrG,EAAGe,EAAGo/C,GAAuB,IAAd3rB,EAAc,4DAAX36B,EAEpCumD,EAAgB,GAChBC,EAAUrgD,EAAImgD,EACdG,EAAWtgD,EAAImgD,EACfI,EAAYx/C,EAAIq/C,EAChBI,EAASD,EAAYJ,EAEzB95C,EAAI4B,OACJ5B,EAAI6B,UAAY,OAChB7B,EAAIkR,OAAOvX,EAAGe,GAEdsF,EAAI0F,YAEJ1F,EAAImR,OAAOxX,EAAIogD,EAAeG,GAC9Bl6C,EAAImR,OAAO6oC,EAASE,GACpBl6C,EAAImR,OAAO6oC,EAASG,GACpBn6C,EAAImR,OAAO8oC,EAAUE,GACrBn6C,EAAImR,OAAO8oC,EAAUC,GACrBl6C,EAAImR,OAAOxX,EAAIogD,EAAeG,GAC9Bl6C,EAAImR,OAAOxX,EAAGe,GAEdsF,EAAIo6C,YACJp6C,EAAIgG,SACJhG,EAAI+F,OAEJ/F,EAAI6B,UAAY,QAChB7B,EAAIoC,KAAO,aACXpC,EAAIkC,aAAe,WACT1O,IAAP26B,GACCnuB,EAAIwC,SAAS,OAAS2rB,EAAI6rB,EAAUD,EAAeI,EAASJ,GAEhE/5C,EAAI+B,U,IAKFs4C,G,WAEF,WAAYr6C,EAAKg3C,EAAQsD,EAAOC,IAAO,eACnCpnD,KAAK6M,IAAMA,EACX7M,KAAK6jD,OAASA,EACd7jD,KAAK4kD,SAAWuC,EAChBnnD,KAAK8jD,SAAWsD,E,uCAGpB,WAEI,IAAIv6C,EAAM7M,KAAK6M,IACXg3C,EAAS7jD,KAAK6jD,OAGd32C,EAAS,kBAAML,EAAIyT,OAAOpT,QAG9BL,EAAI2F,YAAc,QAClB3F,EAAI4F,UAAY,EAChB5F,EAAI0F,YACJ1F,EAAIkR,OAAO8lC,IAASxtC,KAAMnJ,IAAW22C,IAASrtC,QAC9C3J,EAAImR,OAAO6lC,IAASxtC,KAAMwtC,IAASttC,KACnC1J,EAAIgG,SACJhG,EAAIo6C,YAGJp6C,EAAI0F,YACJ1F,EAAIkR,OAAO8lC,IAASxtC,KAAMnJ,IAAW22C,IAASrtC,QAC9C3J,EAAImR,OAfcnR,EAAIyT,OAAOvT,MAeR82C,IAASvtC,MAAOpJ,IAAW22C,IAASrtC,QACzD3J,EAAIgG,SACJhG,EAAIo6C,YA1TZ,SAAsBp6C,EAAKg3C,EAAQ1oC,GAE/B,IAAIpO,EAAQ,kBAAMF,EAAIyT,OAAOvT,OACzBG,EAAS,kBAAML,EAAIyT,OAAOpT,QAE1Bi3C,EAAQhpC,EAAQgpC,MAChBI,EAAkBppC,EAAQopC,gBAI1BL,GAFan3C,IAAU82C,EAAOxtC,KAAOwtC,EAAOvtC,OAEpB6tC,EAGxBvkC,EACGikC,EAAOxtC,KADVuJ,EAEG1S,IAAW22C,EAAOrtC,OAIzB3J,EAAI4B,OACJ,IAAI,IAAI/P,EAAI,EAAGA,EAAIylD,IAASzlD,EAAG,CAE3B,IAAI2oD,EAAU9C,EAAgB7lD,GAC1BoT,EAAM8N,EAAUlhB,EAAIwlD,EAGxBr3C,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAI4F,UAAY,EAChB5F,EAAIm3C,YAAY,IAChBn3C,EAAIkR,OAAOjM,EAAK8N,EAAU0nC,GAC1Bz6C,EAAImR,OAAOlM,EAAK8N,EAAU0nC,GAC1Bz6C,EAAIgG,SAIJhG,EAAI0F,YACJ1F,EAAI2F,YAAc,OAClB3F,EAAIm3C,YAAY,CAAC,EAAG,KACpBn3C,EAAI4F,UAAY,EAChB5F,EAAIkR,OAAOjM,EAAK+xC,EAAOttC,KACvB1J,EAAImR,OAAOlM,EAAK5E,IAAW22C,EAAOrtC,QAClC3J,EAAIgG,SAGJhG,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAIm3C,YAAY,IAChBn3C,EAAI4F,UAAY,EAChB5F,EAAIoC,KAAO,aACXpC,EAAImC,UAAY,SAChBnC,EAAIkC,aAAe,MAEhBs4C,EAAU,IACTA,EAAUlhD,4BAAmCkhD,EAAS,aAG1Dx6C,EAAIwC,SAASg4C,EAAQ5hD,WAAYqM,EAAK8N,EAAU0nC,GAGpDz6C,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAIm3C,YAAY,IAChBn3C,EAAI4F,UAAY,EAChB5F,EAAIoC,KAAO,aACXpC,EAAImC,UAAY,SAChBnC,EAAIkC,aAAe,MACnBlC,EAAIwC,SAAS,oCAAqCw0C,EAAOxtC,MAAQtJ,IAAU82C,EAAOxtC,KAAOwtC,EAAOvtC,OAAS,EAAKpJ,IAAW22C,EAAOrtC,OAAS,GAEzI3J,EAAI+B,UAuPA24C,CAAa16C,EAAKg3C,IAAU7jD,KAAK4kD,UA1YzC,SAAsB/3C,EAAKg3C,EAAQ1oC,GAE/B,IACIjO,EAAS,kBAAML,EAAIyT,OAAOpT,QAE1Bi3C,EAAQhpC,EAAQgpC,MAChBI,EAAkBppC,EAAQopC,gBAI1BL,GAFah3C,IAAW22C,EAAOttC,IAAMstC,EAAOrtC,QAEpB2tC,EAGxBvkC,EACGikC,EAAOxtC,KADVuJ,EAEG1S,IAAW22C,EAAOrtC,OAIzB3J,EAAI4B,OACJ,IAAI,IAAI/P,EAAI,EAAGA,EAAIylD,IAASzlD,EAAG,CAE3B,IAAI2oD,EAAU9C,EAAgB7lD,GAC1BoT,EAAM8N,EAAUlhB,EAAIwlD,EAGxBr3C,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAI4F,UAAY,EAChB5F,EAAIm3C,YAAY,IAChBn3C,EAAIkR,OAAO6B,EAAU0nC,EAAqBx1C,GAC1CjF,EAAImR,OAAO4B,EAAU0nC,EAAqBx1C,GAC1CjF,EAAIgG,SAIJhG,EAAI0F,YACJ1F,EAAI2F,YAAc,OAClB3F,EAAIm3C,YAAY,CAAC,EAAG,KACpBn3C,EAAI4F,UAAY,EAChB5F,EAAIkR,OAAO8lC,EAAOxtC,KAAMvE,GACxBjF,EAAImR,OAvCUnR,EAAIyT,OAAOvT,MAuCJ82C,EAAOvtC,MAAOxE,GACnCjF,EAAIgG,SAGJhG,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAIm3C,YAAY,IAChBn3C,EAAI4F,UAAY,EAChB5F,EAAIoC,KAAO,aACXpC,EAAImC,UAAY,QAChBnC,EAAIkC,aAAe,SAGhBs4C,EAAU,IACTA,EAAUlhD,4BAAmCkhD,EAAS,aAE1Dx6C,EAAIwC,SAASg4C,EAAQ5hD,WAAYma,EAAU0nC,EAAqBx1C,GAIxD5E,IAAW22C,EAAOrtC,OAASqtC,EAAOttC,IAAastC,EAAOttC,IAElE1J,EAAI0F,YACJ1F,EAAI2F,YAAc,QAClB3F,EAAIm3C,YAAY,IAChBn3C,EAAI4F,UAAY,EAChB5F,EAAIoC,KAAO,aACXpC,EAAImC,UAAY,SAChBnC,EAAIkC,aAAe,SACnBlC,EAAIoX,UAAU4/B,EAAOxtC,KAAM,GAC3BxJ,EAAIsX,OAAOne,KAAKsO,IAAM,GACtBzH,EAAIwC,SAAS,wBAAyBnC,IAAW,GAAM22C,EAAOxtC,KAAO,GACrExJ,EAAIoX,WAAW4/B,EAAOxtC,KAAM,GAE5BxJ,EAAI+B,UAgUA44C,CAAa36C,EAAKg3C,IAAU7jD,KAAK8jD,Y,sBAGrC,WACI,IADO,EACH2D,EAAa,GADV,KAESjC,IAFT,IAEP,2BAAyB,KAAjBr7B,EAAiB,QACrB+7B,GAAQlmD,KAAK6M,IAAK7M,KAAK4kD,SAAU5kD,KAAK8jD,SAAU9jD,KAAK6jD,SAAU15B,EAAKo8B,WAAYp8B,EAAKq8B,YAAar8B,EAAKs8B,UAAY,GAAK,GACrHt8B,EAAKs8B,WACJgB,EAAWjmD,KAAK2oB,IALjB,8BASP,cAAgBs9B,EAAhB,eAA4B,CAAxB,IAAIt9B,EAAI,KACRA,EAAK3jB,EAAIm+C,GAAU3kD,KAAK6M,IAAK7M,KAAK4kD,SAAU5kD,KAAK6jD,SAAU15B,EAAKq8B,aAChEr8B,EAAK5iB,EAAIk9C,GAAUzkD,KAAK6M,IAAK7M,KAAK8jD,SAAU9jD,KAAK6jD,SAAU15B,EAAKo8B,YAChEG,GAAY1mD,KAAK6M,IAAKsd,EAAK3jB,EAAG2jB,EAAK5iB,EAAG,IAAK4iB,EAAK6Q,O,+BAIxD,WACI,IADgB,EACZt8B,EAAI,EADQ,KAEA+mD,IAFA,IAEhB,2BAA4B,KAApBt7B,EAAoB,QAEpBy5B,GAAS5jD,KAAK6M,IAAK7M,KAAK6jD,SAAU7jD,KAAK8jD,SAAU35B,EAD7C,GAALzrB,EACwD,OAGA,UAEzDA,GATU,iC,iCAapB,WAAsB,WACFgnD,IADE,IAClB,2BAAiC,KAAzBv7B,EAAyB,QAC7B26B,GAAmB9kD,KAAK6M,IAAK7M,KAAK6jD,SAAU7jD,KAAK4kD,SAAU5kD,KAAK8jD,SAAU35B,IAF5D,iC,yBAMtB,WACI,IAAIu9B,OAAQrnD,EAEZL,KAAK6M,IAAI0F,YAHC,WAIKizC,IAJL,IAIV,2BAAwB,KAAhBmC,EAAgB,QAChBnhD,EAAImhD,EAAInhD,EACRe,EAAIogD,EAAIpgD,OACUlH,IAAVqnD,EAER1nD,KAAK6M,IAAIkR,OAAOvX,EAAGe,IAGnBvH,KAAK6M,IAAImR,OAAOxX,EAAGe,GACnBvH,KAAK6M,IAAIgG,UAEb60C,EAAQlhD,GAfF,mC,KClbX,IAAMohD,GAAb,6B,IAAA,G,EAAA,E,gaACI,WAAYj4B,EAAOmd,EAAcz6B,GAAO,6BACpC,cAAMsd,EAAOmd,EAAcz6B,IACtBw1C,WAAa,KAFkB,EAD5C,0CAMI,SAAY1/B,IACR,0DAAkBA,GAEPnoB,KAAK2vB,MAAM3H,aAAaC,WAT3C,oBAkBI,WAAS,WACC9S,EAASnV,KAAK+sC,UAAUmF,aAAa,GAC3C/8B,EAAOvF,MAAM7C,MAAQ,OACrBoI,EAAOvF,MAAM1C,OAAS,OAEtB,IAAMoT,EAAS3T,SAASC,cAAc,UACtC0T,EAAOvT,MAAQ,KACfuT,EAAOpT,OAAS,KAEhB,IAAM46C,ED+ad,WAA0D,IAA5CxnC,EAA4C,4DAArCjgB,EAAW0nD,EAA0B,4DAAX1nD,EAE9BA,MAAVigB,IAAqBA,EAAS3T,SAAS44B,eAAe,aACzD,IAAI14B,EAAMyT,EAAOxT,WAAW,MAOxB+2C,EAAS,WAAQ,MAAO,CACpBttC,IAAK,IACLC,OAAQ,IACRH,KAAM,IACNC,MAAO,MAIXsuC,EAAW,CACXT,MAAO,GACPK,eAAgB,EAChBD,gBAAiB,SAAC9xB,GACd,OAAOzsB,KAAK2B,IAAI,GAAM,EAAM8qB,IAEhC4xB,oBAAqB,SAAC5xB,GAClB,OAAO,EAAMzsB,KAAKgiD,KAAKv1B,KAG3BqxB,EAAW,CACXK,MAAO,GACPK,eAAgB,EAChBD,gBAAiB,SAAC9xB,GACd,OAAOzsB,KAAK2B,IAAI,GAAM,EAAM8qB,IAEhC4xB,oBAAqB,SAAC5xB,GAClB,OAAO,EAAMzsB,KAAKgiD,KAAKv1B,KAI3BmzB,EAAU,IAAIsB,GAAgBr6C,EAAKg3C,EAAQe,EAAUd,GAEzDxjC,EAAOS,iBAAiB,aAAa,SAACjF,GAClC,IAD4C,EACxCnJ,EAAO2N,EAAOzE,wBACdrV,GAAKsV,EAAMI,QAAUvJ,EAAK0D,OAAS1D,EAAK2D,MAAQ3D,EAAK0D,MAAQiK,EAAOvT,MACpExF,GAAKuU,EAAMK,QAAUxJ,EAAK4D,MAAQ5D,EAAK6D,OAAS7D,EAAK4D,KAAO+J,EAAOpT,OAGnE+6C,EAAO,SAAAzhD,GAAC,OAAIA,EAAEA,GAN0B,KAQ5Bg/C,IAR4B,IAQ5C,2BACA,KADQr7B,EACR,QACIA,EAAK3jB,EAAIm+C,GAAU93C,EAAK+3C,EAAUf,IAAU15B,EAAKq8B,aACjDr8B,EAAK5iB,EAAIk9C,GAAU53C,EAAKi3C,EAAUD,IAAU15B,EAAKo8B,YAC9C0B,EAAK99B,EAAK3jB,EAAIA,GAAKyhD,EAAK99B,EAAK5iB,EAAIA,IAAM0gD,EAPpC,IASF99B,EAAKs8B,WAAY,EAGjBt8B,EAAKs8B,WAAY,GAjBmB,8BAoB5Cd,GAAU94C,EAAK+4C,MAMnBtlC,EAAOS,iBAAiB,SAAS,SAACjF,GAC9B,IADwC,EACpCnJ,EAAO2N,EAAOzE,wBACdrV,GAAKsV,EAAMI,QAAUvJ,EAAK0D,OAAS1D,EAAK2D,MAAQ3D,EAAK0D,MAAQiK,EAAOvT,MACpExF,GAAKuU,EAAMK,QAAUxJ,EAAK4D,MAAQ5D,EAAK6D,OAAS7D,EAAK4D,KAAO+J,EAAOpT,OAGnE+6C,EAAO,SAAAzhD,GAAC,OAAIA,EAAEA,GANsB,KAQxBg/C,IARwB,IAQxC,2BACA,KADQr7B,EACR,QACI,GAAG89B,EAAK99B,EAAK3jB,EAAIA,GAAKyhD,EAAK99B,EAAK5iB,EAAIA,IAAM0gD,EALpC,IAQF,YADAtE,GAAgBuE,KAAKt8C,KAAKC,UAAU,CAAC,SAAY,WAAY,QAAW,iBAAkB,UAAase,EAAK6Q,OAZ5E,kCAqB5C4oB,GAAS/2C,EAAKg3C,IAAUC,EAAU,GAClCgB,GAAmBj4C,EAAKg3C,IAAUe,EAAUd,EAAU,GAEtD2B,GAAWjkD,KAAK,GAAM,GACtBkkD,GAAgBlkD,KAAK,GAErB8kD,GAAOz5C,EAAK+3C,EAAUd,EAAUD,IAAU,EAAG,EAAG,GAChDyC,GAAOz5C,EAAK+3C,EAAUd,EAAUD,IAAU,EAAG,EAAG,GAChDyC,GAAOz5C,EAAK+3C,EAAUd,EAAUD,IAAU,EAAG,EAAG,GAChDyC,GAAOz5C,EAAK+3C,EAAUd,EAAUD,IAAU,EAAG,EAAG,GAChDyC,GAAOz5C,EAAK+3C,EAAUd,EAAUD,IAAU,EAAG,EAAG,GAEhD8B,GAAU94C,EAAK+4C,GAEf,IAAIuC,EAAY,SAAArsB,GACZ,GAAsB,iBAAnBA,EAAG,SAAiC,CAEnC0pB,GAAU,GAEV,IAJmC,OAIxB1pB,EAAG,MAJqB,IAMnC,2BAAmB,KAAXt1B,EAAW,QACX4hD,EAAM5hD,EAAC,UACP6hD,EAAa7hD,EAAC,OAMd4/C,GALa5/C,EAAC,UACCA,EAAC,SAIA6hD,EAHF7hD,EAAC,SAMnB8/C,GAAOz5C,EAAK+3C,EAAUd,EAAUD,IAAUwE,EAAYjC,EAAegC,IAjBtC,iCAsBvCE,EAAY,YACZ3E,GAAkB,IAAI4E,UAAU,yBAEhBC,OAAS,SAAU1sC,GAC/B6nC,GAAgBuE,KAAKt8C,KAAKC,UAAU,CAAC,SAAY,WAAY,QAAW,gBAE5E83C,GAAgB8E,UAAY,SAAU3sC,GAElCggB,IAAMlwB,KAAKsR,MAAMpB,EAAMjE,MACvBswC,EAAUrsB,MAEd6nB,GAAgB+E,QAAU,SAAU5sC,GAChC9Q,QAAQC,IAAI,8BAEhB04C,GAAgBgF,QAAU,SAAU7sC,GAChC9Q,QAAQC,IAAI,oDAWpB,OANqB5K,MAAlB0nD,EACCO,IAEAP,EAAeI,GAGZ,kBAAMxC,GAAU94C,EAAK+4C,ICtkBJgD,CAActoC,GAAQ,SAAAuoC,GAEtC,EAAKhB,WAAagB,KAGhBC,EAAY,WACd99C,QAAQC,IAAI,YACZqV,EAAOvT,MAAQjE,SAASqM,EAAOvF,MAAM7C,OAAS,GAC9CuT,EAAOpT,OAASpE,SAASqM,EAAOvF,MAAM1C,QAAU,GAGhD46C,KAGJ3yC,EAAO4L,iBAAiB,SAAU+nC,GAE9B78C,OAAO88C,eACP,IAAIA,eAAeD,GAAWE,QAAQ7zC,GAEtCnK,QAAQslB,KAAK,gCAGjBnb,EAAOpF,YAAYuQ,GAEnBkJ,GAAa,oCAAqC,CAC9CF,UAAWtpB,KAAK2vB,MAAMpG,gBACvB,SAAAE,GACwB,IAAnBA,EAAIC,YAAmC,MAAfD,EAAIE,QAC5B,EAAKk+B,WAAWj8C,KAAKsR,MAAMuM,EAAIK,kBAvD/C,GAA4C+iB,G,wgCCc5C,IAAMqW,GAAW,KAAOj3C,OAAO88B,SAASkgB,KACxCpiC,WAAWq8B,SAAWA,G,IAGdt8B,GAAMC,WAAND,EAqCD,SAASoE,GAAkBb,EAAM++B,EAAgBC,GAA6E,IAA3DhuC,EAA2D,uDAAjD,CAAE+P,SAAU,OAAQk+B,UAAW,SAACj/B,GAAD,OAAU,IAWnHk/B,EAAa,SAACloD,GACXga,EAAQiuC,UAAUj/B,KACvBhpB,EAAEopB,kBACFppB,EAAEqpB,mBAGA8+B,EAAY,SAAAnoD,GACTga,EAAQiuC,UAAUj/B,KACvBhpB,EAAEopB,kBACFppB,EAAEqpB,mBAGA++B,EAAY,SAAApoD,GACd,GAAKga,EAAQiuC,UAAUj/B,GAAvB,CACA,IAAMkB,EAAQzsB,MAAMwG,KAAKjE,EAAEqoD,aAAan+B,OAExC,GAAqB,IAAjBA,EAAM5sB,OAwBL,MAAI4sB,EAAM5sB,OAAS,GACpB0C,EAAEopB,kBACFppB,EAAEqpB,iBAGFte,MAAM,sDACA,+BAGNA,MAAM,+EACA,8BAjCN/K,EAAEopB,kBACFppB,EAAEqpB,iBAGF,IAAMY,EAAOC,EAAM,GAEbJ,EAAOG,EAAKtT,KAEZwT,EAAS,IAAIC,WAInB,GAHAD,EAAOpX,OAAS,SAAAuU,GACZygC,EAAej+B,EAAMxC,EAAG5mB,OAAO2pB,SAEX,QAApBrQ,EAAQ+P,SACRI,EAAOG,WAAWL,OAEjB,IAAwB,UAApBjQ,EAAQ+P,SAIb,KAAM,2BAA6B/P,EAAQ+P,SAH3CI,EAAOm+B,kBAAkBr+B,MAsBrCjB,EAAKpJ,iBAAiB,YAAasoC,GAAY,GAC/Cl/B,EAAKpJ,iBAAiB,WAAYuoC,GAAW,GAC7Cn/B,EAAKpJ,iBAAiB,OAAQwoC,GAAW,GAGtC,SAAS//B,GAAakgC,EAASC,EAAStmB,GAA2B,IAAjBumB,EAAiB,uDAAR,OACxDngC,EAAM,IAAIogC,eACVlkC,EAAMu9B,GAAWwG,EAUvB,GATAjgC,EAAI5V,KAAK+1C,EAAQjkC,GAAK,GACtB8D,EAAIqgC,iBAAiB,eAAgB,oBACrCrgC,EAAIsgC,mBAAqB,WACrB1mB,EAAS5Z,IAEbA,EAAIk/B,QAAU,SAACxnD,GACX6J,QAAQslB,KAAK,mBAAoBnvB,GACjC+K,MAAM,qBAEK7L,MAAXspD,EAAsB,CACtB,IAAM9xC,EAAOjM,KAAKC,UAAU89C,GAC5BlgC,EAAIy+B,KAAKrwC,QAGT4R,EAAIy+B,QA4MZ,WACI,IAAMv4B,EAAQ,IAAI7I,IAClB7a,OAAO0jB,MAAQA,EACfA,EAAMq6B,YACNr6B,EAAMhH,QAAO,GAEb/B,GAAE,YAAYqjC,UAAU,CACpBvkD,KAAM,UACNwkD,MAAO,CACH,CACIpyC,KAAM,OAAQkjB,GAAI,YAAamvB,QAAS,OAAQ/mB,KAAM,sCAAuC8mB,MAAO,CAChG,CAAE3vC,KAAM,QAAS6oB,KAAM,0CAA2CpI,GAAI,SACtE,CAAEzgB,KAAM,OAAQ6oB,KAAM,oCAAqCpI,GAAI,aAC/D,CAAEzgB,KAAM,OAAQ6oB,KAAM,oCAAqCpI,GAAI,UAGvE,CAAEljB,KAAM,QAASkjB,GAAI,UACrB,CACIljB,KAAM,OAAQkjB,GAAI,gBAAiBmvB,QAAS,WAAY/mB,KAAM,wCAAyC8mB,MAAO,CAC1G,CAAE3vC,KAAM,gBAAiB6oB,KAAM,8CAA+CpI,GAAI,kBAClF,CAAEzgB,KAAM,iBAAkB6oB,KAAM,oDAAqDpI,GAAI,kBACzF,CAAEzgB,KAAM,qBAAsB6oB,KAAM,6CAA8CpI,GAAI,cACtF,CAAEzgB,KAAM,WAAY6oB,KAAM,yCAA0CpI,GAAI,YACxE,CAAEzgB,KAAM,WAAYygB,GAAI,YACxB,CAAEzgB,KAAM,YAAaygB,GAAI,eAGjC,CACIljB,KAAM,OAAQsrB,KAAM,qCAAsCpI,GAAI,eAAgBmvB,QAAS,UAAWD,MAAO,CACrG,CAAE3vC,KAAM,UAAWygB,GAAI,UAAWoI,KAAM,sCACxC,CAAE7oB,KAAM,MAAOygB,GAAI,MAAOoI,KAAM,qCAChC,CAAE7oB,KAAM,qCAAsCygB,GAAI,gBAAiBoI,KAAM,wCAGjF,CACItrB,KAAM,aAAckjB,GAAI,YAAazgB,KAAM,SAAU6vC,GACjD,IAAMrgC,EAA+B,iBAAlBqgC,EAAKC,SAAyBD,EAAKC,SAAWD,EAAKC,WAAkB9S,EAAKv3C,KAAK6C,IAAI,aAAeknB,GAAI,MAAO,YAAqB,MAANwtB,EAAc5nB,EAAM1G,0BAA4BsuB,EAAGh9B,OACnM8vC,SAAU,SAAUD,GACnB,OAAOz6B,EAAM1G,2BACdihC,MAAO,CAAC,CACPlvB,GAAI,UAAWzgB,KAAM,aAI7B,CACIzC,KAAM,OAAQkjB,GAAI,sBAAuBmvB,QAAS,kBAAmBD,MAAO,CACxE,CAAE3vC,KAAM,UAAWygB,GAAI,WACvB,CAAEzgB,KAAM,4BAA6BygB,GAAI,eAIjD,CACIljB,KAAM,OAAQkjB,GAAI,aAAcmvB,QAAS,QAAS/mB,KAAM,oCAAqC8mB,MAAO,CAEhG,CAAE3vC,KAAM,gBAAiBygB,GAAI,kBAGrC,CAAEljB,KAAM,OAAQkjB,GAAI,iBAAkBmvB,QAAS,iBAAkB/mB,KAAM,sCAAuC8mB,MAAO,KAEzHj5C,QAAS,SAAU6K,GAsCf,GArCqB,wBAAjBA,EAAMja,QACN8tB,EAAMqtB,aAAa,eAEF,oBAAjBlhC,EAAMja,SAEN8tB,EAAMhD,WAQNgD,EAAMtD,eANS,CACXvU,KAAM,YACNiU,cAAe,qBACfgB,eAAgB,MAKH,mBAAjBjR,EAAMja,QACN8tB,EAAMxH,UAAU1Z,OAEA,gCAAhBqN,EAAMja,QACN8tB,EAAM26B,sBAEU,0BAAhBxuC,EAAMja,QACN8tB,EAAM46B,gBAEU,0BAAhBzuC,EAAMja,QAEN8tB,EAAM66B,oBAEU,2BAAhB1uC,EAAMja,QACN8tB,EAAM86B,kBAEU,0BAAhB3uC,EAAMja,SACN8tB,EAAM+6B,gBAAiB/6B,EAAMg7B,iCAEb,2BAAhB7uC,EAAMja,QACN8tB,EAAMi7B,kBAEU,aAAhB9uC,EAAMja,OAAuB,CAC7B,IAAMuO,EAAIpQ,KAAK6C,IAAIiZ,EAAMja,QAEnBgpD,EAAUl7B,EAAM7G,gBAEtB1Y,EAAE85C,MAAQ,GALmB,WAObW,GAPa,IAO7B,2BAAyB,KACfvjB,EADe,QACL,sBAChBl3B,EAAE85C,MAAM1oD,KAAK,CAAEw5B,GAAIsM,EAAO/sB,KAAM+sB,KATP,+BAYjC,GAAIxrB,EAAMja,OAAO+nB,WAAW,cAAe,CACvC,IAAMlkB,EAAOoW,EAAMja,OAAOohC,OAAO,aAAaxkC,QAC9CkxB,EAAMm7B,oBAAoBplD,GA0C9B,GAxCoB,+BAAhBoW,EAAMja,QACN8tB,EAAMtD,eAAe,CACjBvU,KAAM,YACNiU,cAAe,iCACfpgB,MAAO,yBACPohB,eAAgB,KAGJ,iCAAhBjR,EAAMja,QACN8tB,EAAMtD,eAAe,CACjBvU,KAAM,YACNiU,cAAe,oCACfgB,eAAgB,KAGJ,wBAAhBjR,EAAMja,QAEN8tB,EAAMzC,gCAAgCyC,EAAO,GAAI,CAC7CxC,gBAAgB,IAGJ,8BAAhBrR,EAAMja,SACN8tB,EAAMxH,UAAU4F,QAAQ,CAAC,iBAAiB,eAC1C4B,EAAMxH,UAAU42B,4BAA4B,GAE5CpvB,EAAMxH,UAAU4F,QAAQ,CAAC,eAAe,SAAA+N,GACpCnM,EAAM2R,QAAQ3R,EAAOmM,EAAG,cACzB,CACC9N,QAAS,IACT0M,WAAY,kBAAMxuB,MAAM,4CAGZ,4BAAhB4P,EAAMja,QACN8tB,EAAMo7B,iBAAiBp7B,GAEP,oBAAhB7T,EAAMja,QAGN8tB,EAAMq7B,mBAAmBr7B,GAET,kBAAhB7T,EAAMja,OAA4B,CAClC,IAAMuO,EAAIpQ,KAAK6C,IAAIiZ,EAAMja,QAGzBuO,EAAE85C,MAAQ,GAGV95C,EAAE85C,MAAM1oD,KAAK,CAAE+Y,KAAM,YAAaygB,GAAI,uBAAwBoI,KAAM,uCAEpE,IATkC,OASpBzT,EAAMxH,UAAUgf,wBATI,IAUlC,2BAAuB,KAAZ3gC,EAAY,QACbd,EAAOc,EAAE,GAEf4J,EAAE85C,MAAM1oD,KAAK,CAAE+Y,KAAM7U,EAAMs1B,GAAI,eAAiBx0B,EAAE,GAAGwmB,WAbvB,8BAgBlChtB,KAAKirD,UAMT,GAHoB,uCAAhBnvC,EAAMja,QACN8tB,EAAMxH,UAAU2D,yBAEhBhQ,EAAMja,OAAO+nB,WAAW,+BAAgC,CAExD,IAAIlkB,EAAOoW,EAAMja,OACjB6D,EAAOA,EAAKu9B,OAAO,8BAA8BxkC,QAEjDkxB,EAAMxH,UAAU+iC,mBAAmBxlD,OAO/C,IAWMylD,EAAeniC,eAAevB,QAAQ,cAExCO,EAAe,MAEfA,EADiB,OAAjBmjC,EACe,IAAIC,aAAax/C,KAAKsR,MAAMiuC,GAAevkC,GAAE,wBAG7C,IAAIwkC,aAlBK,CACxBh/B,QAAS,CAAC,CACNtU,KAAM,MACNsU,QAAS,CAAC,CACNtU,KAAM,YACNiU,cAAe,qBACfgB,eAAgB,QAY6BnG,GAAE,yBAG9CsB,GAAG,eAAgByH,EAAM+c,SAAS,gBAAgB,WAC3D,GAAM1kB,EAAaqjC,eAAiBrjC,EAAasjC,YAAYjgD,OAAM,SAAAkgD,GAAM,OAAIA,EAAOF,mBAIhFrjC,EAAasE,YAAjB,CAEA,IAAMjmB,EAAM2hB,EAAawjC,WAEnBn5C,EAAQzG,KAAKC,UAAUxF,GAC7B2iB,eAAerB,QAAQ,aAActV,MACtC,MAEE2V,EAAasE,aACdtE,EAAaC,SAASC,GAAG,yBAAyB,SAAA1hB,GAC9C,IAAMoiB,EAAShd,KAAKsR,MAAM1W,GAE1BmpB,EAAMtD,eAAezD,MAI7BZ,EAAayjC,kBAAkB,iBAAiB,SAAC1e,EAAWhgB,GACxDggB,EAAUmF,aAAawZ,KAAK,OAAS3+B,EAAesO,MAAQ,YAEhErT,EAAayjC,kBAAkB,qBAAqB,SAAC1e,EAAWhgB,GAE5D,IAAM4+B,EAAgB,IAAI5d,EAAuBpe,EAAOod,EAAWhgB,GACnEnG,GAAEmmB,EAAUmF,cAAc0Z,KAAK,sBAAsB,WACjDD,EAAcE,qBAItB7jC,EAAayjC,kBAAkB,sBAAsB,SAAC1e,EAAWhgB,GAE7D,IAAM4+B,EAAgB,IAAI1J,GAAwBtyB,EAAOod,EAAWhgB,GACpE4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcjoD,YAElBskB,EAAayjC,kBAAkB,wBAAwB,SAAC1e,EAAWhgB,GAE/D,IAAM4+B,EAAgB,IAAI9I,GAAqClzB,EAAOod,EAAWhgB,GACjF4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcjoD,YAElBskB,EAAayjC,kBAAkB,qBAAqB,SAAC1e,EAAWhgB,GAE5D,IAAM4+B,EAAgB,IAAI/D,GAAuBj4B,EAAOod,EAAWhgB,GACnE4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcjoD,YAElBskB,EAAayjC,kBAAkB,iBAAiB,SAAC1e,EAAWhgB,GAExD,IAAM4+B,EAAgB,IAAIxY,EAAmBxjB,EAAOod,EAAWhgB,GAE/D4+B,EAAchY,qBAAqB5mB,EAAc,WACjD4+B,EAAcjtB,YAAY/O,EAAMiP,wBAEpC5W,EAAayjC,kBAAkB,kCAAkC,SAAC1e,EAAWhgB,GAEzE,IAAM4+B,EAAgB,IAAIzN,GAAoCvuB,EAAOod,EAAWhgB,GAChF4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC,IAAMuf,EAAOwN,EAAcxjC,UAAUi2B,2BACrCuN,EAAcjoD,OAAOy6C,MAGzBn2B,EAAayjC,kBAAkB,qCAAqC,SAAC1e,EAAWhgB,GAE5E,IAAM4+B,EAAgB,IAAI3M,GAAuCrvB,EAAOod,EAAWhgB,GACnF4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcjoD,YAGlBskB,EAAayjC,kBAAkB,mBAAmB,SAAC1e,EAAWhgB,GAE1D,IAAM4+B,EAAgB,IAAItb,EAAqB1gB,EAAOod,EAAWhgB,GAC3D++B,EAAe,WAAaH,EAAc3+B,QAC1CqxB,EAAiBz3B,GAAEmmB,EAAUmF,cAC7B6Z,EAAcnlC,GAAE,YAAcklC,EAAe,+DAGnDzN,EAAenS,OAAO6f,GACtB1N,EAAe/hB,OAAOD,KAAK,GAE3B,WACI,IAAM2vB,EAAaD,EACnBC,EAAWpS,KAAK,KAAMkS,GACtBE,EAAWzxC,KAAKwS,EAAeE,cAC/B++B,EAAW1vB,OAAOD,KAAK,GACvB,IAAMiU,EAASa,IAAI8a,KAAKF,EAAY,IACpCzb,EAAO4b,SAASplC,mBAChBwpB,EAAOmB,QAAQ0a,QAAQ,mBACvB7b,EAAOuB,aAAa3pB,GAAG,UAAU,WAC7B6kB,EAAUY,YAAY,CAAE,aAAgB2C,EAAOmC,gBAGnDznB,GAAkB+gC,EAAY,IAAI,SAAC9gC,EAAMmB,GAErCphB,QAAQC,IAAI,eAAgBggB,EAAMmB,GAElCkkB,EAAOnK,SAAS/Z,GAChBkkB,EAAOG,oBAGXH,EAAOlzB,SAEPkzB,EAAO8b,SAASC,WAAW,CACvB3mD,KAAM,UACN4mD,QAAS,CAAE3zC,IAAK,SAAU4zC,IAAK,aAC/BC,KAAM,SAAUlc,GACZpkC,MAAM,mBACNy/C,EAAcrqB,QAAQgP,EAAOmC,aAEjCga,UAAU,IAEdnc,EAAO8b,SAASC,WAAW,CACvB3mD,KAAM,kBACN4mD,QAAS,CAAE3zC,IAAK,QAAS4zC,IAAK,SAC9BC,KAAM,SAAUlc,GACZpkC,MAAM,yBACNy/C,EAAczqB,gBAAgBoP,EAAOmC,aAEzCga,UAAU,IAEdd,EAAce,mBAAmBpc,GACjCqb,EAAcjtB,YAAY/O,EAAMiP,qBAzCpC,MAiDJ5W,EAAayjC,kBAAkB,oBAAoB,SAAC1e,EAAWhgB,GAE3D,IAAM4+B,EAAgB,IAAI7Y,EAAsBnjB,EAAOod,EAAWhgB,GAC5D++B,EAAe,YAAcH,EAAc3+B,QAC3CqxB,EAAiBz3B,GAAEmmB,EAAUmF,cAC7B6Z,EAAcnlC,GAAE,YAAcklC,EAAe,6DAGnDzN,EAAenS,OAAO6f,GACtB1N,EAAe/hB,OAAOD,KAAK,GAE3B,WACI,IAAM2vB,EAAaD,EACnBC,EAAWpS,KAAK,KAAMkS,GACtBE,EAAW1vB,OAAOD,KAAK,GACvB,IAAMiU,EAASa,IAAI8a,KAAKF,EAAY,IACpCzb,EAAO4b,SAASplC,mBAChBwpB,EAAOmB,QAAQ0a,QAAQ,kBACvB7b,EAAOqc,aAAY,GAGnBhB,EAAce,mBAAmBpc,GACjCqb,EAAcjtB,YAAY/O,EAAMiP,qBAEhC,IAAMmU,EAAY4Y,EAAcje,WAAWjO,KAC3CksB,EAAc3Y,QAAQD,GACtBzC,EAAOlzB,SAfX,MA2BJ4K,EAAayjC,kBAAkB,kBAAkB,SAAC1e,EAAWhgB,GAEzD,IAAM4+B,EAAgB,IAAIrK,GAAoB3xB,EAAOod,EAAWhgB,GAC1D++B,EAAe,SAAWH,EAAc3+B,QACxCqxB,EAAiBz3B,GAAEmmB,EAAUmF,cAC7B6Z,EAAcnlC,GAAE,YAAcklC,EAAe,6DAGnDzN,EAAenS,OAAO6f,GACtB1N,EAAe/hB,OAAOD,KAAK,GAE3B,WACI,IAAM2vB,EAAaD,EACnBC,EAAWpS,KAAK,KAAMkS,GACtBE,EAAW1vB,OAAOD,KAAK,GACvB,IAAMiU,EAASa,IAAI8a,KAAKF,EAAY,IACpCzb,EAAO4b,SAASplC,mBAChBwpB,EAAOmB,QAAQ0a,QAAQ,mBAGvBR,EAAce,mBAAmBpc,GACjCqb,EAAcjtB,YAAY/O,EAAMiP,qBAEhC,IAAMmU,EAAY4Y,EAAcje,WAAWhuC,MAC3CisD,EAAcpK,SAASxO,GACvBzC,EAAOlzB,SAdX,MAsBJ4K,EAAayjC,kBAAkB,qBAAqB,SAAC1e,EAAWhgB,GAE5D,IAAM4+B,EAAgB,IAAIxZ,EAAuBxiB,EAAOod,EAAWhgB,GAC7D++B,EAAe,YAAcH,EAAc3+B,QAC3CqxB,EAAiBz3B,GAAEmmB,EAAUmF,cAC7B6Z,EAAcnlC,GAAE,YAAcklC,EAAe,6DAEnDzN,EAAenS,OAAO6f,GACtB1N,EAAe/hB,OAAOD,KAAK,GAGR0vB,EACRzvB,OAAOD,KAAK,GACvB,IAAMiU,EAASa,IAAI8a,KAAKF,EAAY,IACpCzb,EAAO4b,SAASplC,mBAChBwpB,EAAOmB,QAAQ0a,QAAQ,eACvB7b,EAAOqc,aAAY,GAEnB,IAAMC,EAAWjB,EAAcje,WAAW2O,mBACzBh8C,IAAbusD,GACAtc,EAAOnK,SAASymB,GACpBtc,EAAOG,iBAEPkb,EAAce,mBAAmBpc,GAEjCtlC,QAAQC,IAAI,sBAAuB6gD,GAEnC9jC,EAAaC,SAASC,GAAG4jC,GAAc,SAAC3qD,GACpCwqD,EAAczf,OAAO/qC,MAGzBwqD,EAAcjtB,YAAY/O,EAAMiP,wBAGpC5W,EAAayjC,kBAAkB,0BAA0B,SAAC1e,EAAWhgB,GACjE,IAAM4+B,EAAgB,IAAIlc,EAA4B9f,EAAOod,EAAWhgB,GAClE8/B,EAAY,iBAAmBlB,EAAc3+B,QAC7CqxB,EAAiBz3B,GAAEmmB,EAAUmF,cAC7B6Z,EAAcnlC,GAAE,YAAcimC,EAAY,6DAEhDd,EAAY7f,OAAO,2BACnByf,EAAcmB,aAAaf,GAC3B1N,EAAenS,OAAO6f,MAI1B/jC,EAAayjC,kBAAkB,sBAAsB,SAAC1e,EAAWhgB,GAC7D,IAAM4+B,EAAgB,IAAIlK,GAAwB9xB,EAAOod,EAAWhgB,GAEpE4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcjoD,YAGlBskB,EAAayjC,kBAAkB,oBAAoB,SAAC1e,EAAWhgB,GAE3D,IAAM4+B,EAAgB,IAAIxR,EAAyBxqB,EAAOod,EAAWhgB,GAE/D5C,EAAOxd,SAASC,cAAc,OACpCud,EAAK6F,UAAUzjB,IAAI,eACnB4d,EAAKva,MAAQ,4BACbgX,GAAEmmB,EAAUmF,cAAchG,OAAO/hB,GAEjCwhC,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcoB,qBAGlB/kC,EAAayjC,kBAAkB,sBAAsB,SAAC1e,EAAWhgB,GAC7D,IAAM4+B,EAAgB,IAAIhP,GAAwBhtB,EAAOod,EAAWhgB,GAIpE4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcjoD,YAGlBskB,EAAayjC,kBAAkB,qBAAqB,SAAC1e,EAAWhgB,GAE5D,IAAM4+B,EAAgB,IAAI/P,EAAuBjsB,EAAOod,EAAWhgB,GAGnE4+B,EAAcjtB,YAAY/O,EAAMiP,qBAChC+sB,EAAcjoD,YAGlBskB,EAAaE,GAAG,iBAAiB,SAAA/mB,GAC7B,QAAgCd,IAA5Bc,EAAEynB,OAAOmE,eAAb,CAIA,IAAMvmB,EAAIrF,EAAEynB,OAAOmE,eAAeC,QAClChF,EAAaC,SAASsE,KAAK,WAAa/lB,GACxCwE,QAAQC,IAAI,gBAAiB9J,OAGjCwuB,EAAMq9B,UAAUhlC,GAChB2H,EAAMs9B,aAGNjlC,EAAa6hB,OAEb59B,OAAO8U,iBAAiB,UAAU,SAAAva,GAG9BwhB,EAAaklC,gBAIjBvgD,SAASmD,KAAKiR,iBAAiB,WAAW,SAAC0H,GACvCkH,EAAMw9B,UAAU1kC,MAEpB9b,SAASmD,KAAKiR,iBAAiB,SAAS,SAAC0H,GACrCkH,EAAMwO,QAAQ1V,MAElBkH,EAAMy9B,eAAe,MAAM,WAAQz9B,EAAM+6B,gBAAiB/6B,EAAMg7B,mCAChEh7B,EAAMy9B,eAAe,MAAM,WAAQz9B,EAAMi7B,qBACzCj7B,EAAMy9B,eAAe,KAAK,WACtBz9B,EAAM26B,yBAEV36B,EAAMy9B,eAAe,KAAK,WAAQz9B,EAAMzC,gCAAgCyC,EAAO,GAAI,CAAExC,gBAAgB,OACrGwC,EAAMy9B,eAAe,KAAK,WAAQz9B,EAAMxH,UAAU1Z,UAAW,GAAO,GAEpEkhB,EAAM+O,cAKN1T,GAFYpE,GAAE,uBACE,GAAGymC,YACI,SAACpiC,EAAMmB,GAC1BphB,QAAQC,IAAI,eAAgBggB,EAAMmB,GAElC,IAAMxD,EAAS,CACX9Q,KAAM,YACNiU,cAAe,kBACfgB,eAAgB,CACZE,aAAcb,IAItBuD,EAAMtD,eAAezD,UACtBvoB,EAAW,CACV6qB,SAAU,OACVk+B,UAAW,SAACj/B,GAAD,OAAoC,GAA1BA,EAAKmF,WAAW7wB,UA92B7C6uD,GA+HO,IAAMt2B,GAAb,2FAEI,SAAuBu2B,GACnB,IAAMpjC,EAAOxd,SAASC,cAAc,OAGpC,OAFAud,EAAK6Q,GAAKuyB,EACVpjC,EAAK6F,UAAY,qBACVpJ,GAAEuD,KANjB,6BASI,SAAuB6Q,EAAInE,GAA6D,IAAnD22B,EAAmD,uDAAtC,CAAC,aAAcC,EAAuB,uDAAb,YACjEtjC,EAAOxd,SAASC,cAAc,SACpCud,EAAKrS,KAAO,OACZqS,EAAK6Q,GAAKA,EACV,IAAI0yB,EAAQ/gD,SAAS44B,eAAe,kBAC/BmoB,KACDA,EAAQ/gD,SAASC,cAAc,aACzBouB,GAAK,iBACXruB,SAASmD,KAAKC,YAAY29C,IAE9B9mC,GAAEuD,GAAMyvB,KAAK,OAAQ,kBACrB8T,EAAMj6B,UAAY,GAXkE,WAYpE+5B,GAZoE,IAYpF,2BAA4B,KAAjBhnD,EAAiB,QACxBknD,EAAMj6B,WAAa,kBAAoBjtB,EAAI,MAbqC,8BAqBpF,OALA2jB,EAAK1qB,MAAQguD,EACbtjC,EAAK0M,SAAW,WACZA,EAAS1M,IAGNvD,GAAEuD,KA9BjB,iCAiCI,SAA2B6Q,EAAInE,EAAU22B,EAAYC,GACjD,IAAMtjC,EAAOxd,SAASC,cAAc,OAC9B+gD,EAAYhhD,SAASC,cAAc,SACzC+gD,EAAU71C,KAAO,OACjB61C,EAAU3yB,GAAKA,EACf2yB,EAAUC,QAAU,WAEhB,IAAMC,EAAWF,EAAUluD,MAC3BkuD,EAAUG,OAAS,WACfH,EAAUluD,MAAQouD,GAEtBF,EAAUluD,MAAQ,IAGtB,IAAMiuD,EAAQ/gD,SAASC,cAAc,YACrC8gD,EAAM1yB,GAAKA,EAAK,SAChB7Q,EAAKpa,YAAY29C,GAEjB9mC,GAAE+mC,GAAW/T,KAAK,OAAQ5e,EAAK,UAC/B0yB,EAAMj6B,UAAY,GAnBwC,WAoB1C+5B,GApB0C,IAoB1D,2BAA4B,KAAjBhnD,EAAiB,QACxBknD,EAAMj6B,WAAa,kBAAoBjtB,EAAI,MArBW,8BAgC1D,OARAmnD,EAAUluD,MAAQguD,EAClBE,EAAU92B,SAAW,WACjB82B,EAAUG,OAAS,KACnBj3B,EAAS82B,IAGbxjC,EAAKpa,YAAY49C,GAEV/mC,GAAEuD,KAjEjB,iCAoEI,SAA2B6Q,EAAIhB,EAASv3B,GACpC,IAAM0nB,EAAOxd,SAASC,cAAc,QAOpC,GANAud,EAAK6Q,GAAKA,EACV7Q,EAAKpJ,iBAAiB,SAAS,SAAAva,GAC3BwzB,EAAQxzB,MAEZ2jB,EAAK6F,UAAUzjB,IAAI,YAER,MAAP9J,GAA+B,MAAhBA,EAAIslC,SACnB5d,EAAKgF,UAAY,MACjBhF,EAAKxe,MAAQ,oDAEZ,CACD,IAAMmhB,EAAQrqB,EAAIslC,SAASjb,MAAM,KAC3BihC,EAAQjhC,EAAMA,EAAMruB,OAAS,GAEnC0rB,EAAKgF,UAAY4+B,EAAQ,IAAMtrD,EAAI4uC,WACnClnB,EAAKxe,MAAQlJ,EAAIslC,SAGrB,OAAOnhB,GAAEuD,KAxFjB,yBA2FI,SAAmB6Q,EAAIgzB,EAAWC,GAC9B,IAAM9jC,EAAOxd,SAASC,cAAc,QAMpC,OALAud,EAAK6Q,GAAKA,EACV7Q,EAAKsJ,UAAYu6B,EACjB7jC,EAAKxe,MAAQsiD,EACb9jC,EAAK6F,UAAY,QAEVpJ,GAAEuD,KAlGjB,gCAqGI,SAA0B6Q,EAAInE,GAA2B,IAAjB42B,EAAiB,wDAC/CS,GAAS,EACT/jC,EAAOxd,SAASC,cAAc,SASpC,GARAud,EAAK0M,SAAW,WACZA,EAAS1M,IAEbA,EAAKrS,KAAO,WACZqS,EAAK6Q,GAAKA,EACV7Q,EAAK+P,QAAUuzB,GAGVS,EAAQ,CAGT,IAAMC,EAAcxhD,SAASC,cAAc,SAI3C,OAHAuhD,EAAYn+B,UAAY,SACxBpJ,GAAEunC,GAAajiB,OAAO/hB,GACtBvD,GAAEunC,GAAajiB,OAAOtlB,GAAE,uCACjBA,GAAEunC,GAGb,OAAOvnC,GAAEuD,KA1HjB,6BA8HI,SAAuB6Q,EAAInE,GAAwB,IAAd42B,EAAc,uDAAJ,GACrCtjC,EAAOxd,SAASC,cAAc,SAQpC,OANAud,EAAK0M,SAAW,WACZA,EAAS1M,IAEbA,EAAKrS,KAAO,OACZqS,EAAK6Q,GAAKA,EACV7Q,EAAK1qB,MAAQguD,EACN7mC,GAAEuD,KAvIjB,iCA0II,SAA2B6Q,EAAInE,GAAwB,IAAd42B,EAAc,uDAAJ,GACzCtjC,EAAOxd,SAASC,cAAc,YAOpC,OALAud,EAAK0M,SAAW,WACZA,EAAS1M,EAAKsJ,YAElBtJ,EAAK6Q,GAAKA,EACV7Q,EAAKsJ,UAAYg6B,EACV7mC,GAAEuD,KAlJjB,+BAqJI,SAAyB6Q,EAAInE,EAAU1b,GAAuB,MAAdsyC,EAAc,uDAAJ,GAChDtjC,EAAOxd,SAASC,cAAc,UADsB,KAGrCuO,GAHqC,IAG1D,2BAA8B,KAAnBizC,EAAmB,QACpBC,EAAc1hD,SAASC,cAAc,UAC3CyhD,EAAYl/B,UAAYi/B,EACxBjkC,EAAK+hB,OAAOmiB,IAN0C,8BAe1D,OALAlkC,EAAKmkC,QAAU,WACXz3B,EAAS1M,IAEbA,EAAK6Q,GAAKA,EACV7Q,EAAK1qB,MAAQguD,EACN7mC,GAAEuD,KApKjB,4BAuKI,SAAsB6Q,EAAInE,GAAuB,IAAb42B,EAAa,uDAAH,EACpCtjC,EAAOxd,SAASC,cAAc,SAQpC,OAPAud,EAAKmkC,QAAU,WACXz3B,EAAS1M,IAEbA,EAAKrS,KAAO,SACZqS,EAAKsI,KAAO,EACZtI,EAAK6Q,GAAKA,EACV7Q,EAAK1qB,MAAQguD,EACN7mC,GAAEuD,KAhLjB,8BAoLI,SAAwB6Q,EAAInE,GACxB,IAAM1M,EAAOxd,SAASC,cAAc,SAMpC,OALAud,EAAKmkC,QAAU,WACXz3B,EAAS1M,IAEbA,EAAKrS,KAAO,SACZqS,EAAK6Q,GAAKA,EACHpU,GAAEuD,KA3LjB,0BA8LI,SAAoB6Q,EAAIhB,EAASqB,GAC7B,IAAMlR,EAAOxd,SAASC,cAAc,UAKpC,OAJAud,EAAK6P,QAAU,WACXA,EAAQ7P,IAEZA,EAAKsJ,UAAY4H,EACVzU,GAAEuD,OApMjB,M,qECvJaokC,EAAb,WAEI,WAAYC,EAAiB3W,IAAU,eACnC73C,KAAKwuD,gBAAkBA,EACvBxuD,KAAKyuD,gBAAkBzuD,KAAKwuD,gBAAgBC,gBAC5CzuD,KAAK63C,SAAWA,EAChB73C,KAAK0uD,OAA2B,oBAAXA,QAA0BA,OAE/C1uD,KAAK2uD,qBAAuB,EARpC,mCAWI,cAXJ,4BAcI,SAAe72C,EAAM2Q,EAAIjX,EAAU6jC,EAAUoD,EAAiBV,GAC1D,OAAO,IAff,qBAkBI,gBAlBJ,M,gICKO,IAAM6W,EAAb,6B,IAAA,G,EAAA,E,gaAEI,WAAYJ,EAAiB3W,GAAU,6BACnC,cACI2W,EACA3W,IAGCoT,UAN8B,EAF3C,yDAWI,WACIjrD,KAAK63C,SAASgX,iBAAiB,EAAG,EAAG,EAAG,GAAG,SAAC/2C,EAAM3W,EAAGsB,EAAKqsD,GAClDrsD,EAAIoV,WACoBxX,IAApBoC,EAAIoV,KAAKk3C,SACTtsD,EAAIoV,KAAKk3C,YAAS1uD,QAftC,mCAoBI,SAAsB2uD,EAAMC,EAAYC,GACpC,IAAIC,OAAgB9uD,EAChB2uD,EAAKn3C,MAAQm3C,EAAKn3C,KAAKmZ,iBAED3wB,KADtB8uD,EAAgBH,EAAKn3C,KAAKmZ,WAAW+9B,UAGjCI,GADAA,EAAgBA,EAActpC,QAAQ,QAAS,MACjBA,QAAQ,WAAY,SAG1D,IAAIkpC,OAAS1uD,EAYb,YAXsBA,IAAlB8uD,IACAJ,EAAS/uD,KAAKyuD,gBAAgBW,wBAC1BD,EACAF,IAGRD,EAAKn3C,KAAKk3C,OAASA,OAEJ1uD,IAAX0uD,GAAwBA,EAAS,GACjCG,EAAc1tD,KAAKutD,GAEhBA,IAzCf,oCA4CI,SAAuBM,EAAGJ,EAAYC,GAClC,IAAMI,EAAOtvD,KACbqvD,EAAEnY,QAAQn6B,SAAQ,SAAApW,GACd,IACM4oD,EADQF,EAAEhiC,KAAK1mB,GACKkR,KAAK49B,MAC3B8Z,IACAA,EAAYvY,QAAQj6B,SAAQ,SAAA5b,GACxB,IAAM6tD,EAAOO,EAAYP,KAAK7tD,GAC1B6tD,aAAgBxV,MAChB8V,EAAKE,sBACDR,EACAC,EACAC,MAIZK,EAAYrY,QAAQn6B,SAAQ,SAAApW,GACxB,IAAM0mB,EAAOkiC,EAAYliC,KAAK1mB,GAC9B,GAAI0mB,aAAgBoiC,KAAY,CAC5B,IAAMC,EAAqB,GACrBC,EAAUtiC,EAAKxV,KAAKwV,KAAK2D,WAAW4+B,eAG1CztD,OAAOsE,KAAKkpD,GAAS5yC,SAAQ,SAAC09B,GAC1BiV,EAAmBjV,GACf6U,EAAKb,gBAAgBW,wBACjBO,EAAQlV,GACRwU,MAIZ9sD,OAAOsE,KAAKwoD,GAAYlyC,SAAQ,SAAC09B,GACvBA,KAAUiV,IACZA,EAAmBjV,GAAUwU,EAAWxU,OAGhD6U,EAAKO,uBACDxiC,EAAKxV,KAAK49B,MACVia,EACAR,aAnF5B,uCA2FI,SAA0BzZ,GACtBz1C,KAAK2uD,qBAAuB,EAE5B,IAAMO,EAAgB,CAAC,GAOvB,OANAlvD,KAAK6vD,uBACDpa,EACAz1C,KAAKyuD,gBAAgBqB,iBACrBZ,GAGIlvD,KAAKwuD,gBAAgBuB,sBACzB,IAAK,OACD/vD,KAAK2uD,sBAAuBznD,SAAKgoD,GACjC,MACJ,IAAK,SACL,QACIlvD,KAAK2uD,sBAAuBqB,SAAOd,MA3GnD,qBAgHI,WACIlvD,KAAKiwD,6BACLjwD,KAAKkwD,0BAA0BlwD,KAAK63C,SAASpC,OAE7Cz1C,KAAK63C,SAASzC,eApHtB,wBAuHI,SAAW4Z,EAAMniD,GACb,IAAMkiD,EAASC,EAAKn3C,KAAKk3C,OACzB,QAAe1uD,IAAX0uD,EAAsB,CAEtB,GAAIA,GAAU,EACV,OAEJ,IAAIoB,EAAW,GAAiC,EAA5BnwD,KAAK2uD,sBAA6BI,EAClDoB,EAAU,IACVA,EAAU,GACVA,EAAU,IACVA,EAAU,GACd,IAAMh9C,GAAQi9C,QAAaD,GAE3BnB,EAAKqB,MAAMrwD,KAAK63C,SAAUhrC,EAAKsG,MArI3C,oCAyII,SAAuBsiC,EAAO5oC,EAAKyjD,EAAKC,GAAc,WAClD9a,EAAMyB,QAAQn6B,SAAQ,SAAApW,GAClB,IAAM0L,EAAQojC,EAAMpoB,KAAK1mB,GAIzB,KAAIkG,EAAI2jD,OAAQF,GAAOG,WAAap+C,EAAMtF,MAAQujD,EAAMG,eAIpD5jD,EAAI2jD,KAAQn+C,EAAMiJ,UAAUi1C,EAAa/pD,EAAG+pD,EAAahpD,EACzDgpD,EAAaG,EAAGH,EAAarU,IADjC,CAIA,IAAMqT,EAAcl9C,EAAMwF,KAAK49B,MAC3B8Z,IAAgBl9C,EAAMwF,KAAKxF,MAAM2e,WAAWooB,eAC5CmW,EAAYrY,QAAQn6B,SAAQ,SAAApW,GACxB,IAAM0mB,EAAOkiC,EAAYliC,KAAK1mB,GAG1BkG,EAAI2jD,MAAQnjC,EAAK/R,UAAUi1C,EAAa/pD,EACxC+pD,EAAahpD,EAAGgpD,EAAaG,EAAGH,EAAarU,IAK7C7uB,EAAKxV,KAAKwV,KAAK2D,WAAWooB,cACzBvsC,EAAI2jD,KAAOF,GAAOK,UAGnBtjC,aAAgBoiC,MAChB,EAAKmB,uBACDvjC,EAAKxV,KAAK49B,MAAO5oC,EAAKyjD,EAAKC,MAIvChB,EAAYvY,QAAQj6B,SAAQ,SAAA5b,GACxB,IAAM6tD,EAAOO,EAAYP,KAAK7tD,GAE1B0L,EAAI2jD,MAAQxB,EAAK1zC,UAAUi1C,EAAa/pD,EACxC+pD,EAAahpD,EAAGgpD,EAAaG,EAAGH,EAAarU,IAGjD,EAAK2U,WAAW7B,EAAMniD,aApL1C,kBA0LI,WACI7M,KAAK4wD,uBACD5wD,KAAK63C,SAASpC,MACdz1C,KAAK63C,SAAShrC,IACd7M,KAAK63C,SAASiZ,eAAeC,mBAC7B/wD,KAAK63C,SAAS0Y,gBA/L1B,4BAmMI,SAAez4C,EAAM2Q,EAAIjX,EAAU6jC,EAAUoD,EAAiBV,GAC1D,GAAa,UAATjgC,IAAqBigC,QACG13C,IAApBo4C,GACAA,aAA2Be,WACSn5C,IAAhCo4C,EAAgB5gC,KAAKk3C,QACjBtW,EAAgB5gC,KAAKmZ,WAAW+9B,OAAQ,CACxC,IAAMO,EAAOtvD,KACbA,KAAKyuD,gBAAgBW,wBACjB3W,EAAgB5gC,KAAKmZ,WAAW+9B,OAChCO,EAAKb,gBAAgBqB,kBACrB,GACA,WACIR,EAAKW,6BACLX,EAAKY,0BACDZ,EAAKzX,SAASpC,UAQ1C,OAAO,MAzNf,GAAyC8Y,M,gICAlC,IAAMyC,EAAb,6B,IAAA,G,EAAA,E,gaAEI,WAAYxC,EAAiB3W,GAAU,6BACnC,cACI2W,EACA3W,IAGCoZ,UAAY,OACjB,EAAKC,YAAc,GAEnB,EAAKvC,qBAAuB,EATO,EAF3C,+CAcI,SAAiB/gC,GAEb,OAAIA,aAAmBqrB,KAEfrrB,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQoN,GADRpN,QAHc,EAQXA,aAAmB6hC,KACV7hC,EAAQ/V,KAAKwV,KAAK2D,WAAWqJ,KAAKS,aAE9Cwa,WAXc,EAgBX1nB,aAAmBujC,KAItBvjC,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQmN,UAAY,IACpBnN,EAAQ/V,KAAKwV,KAAK8rB,YAAc,KAtBlB,EAyBXvrB,aAAmBsrB,KAEtBtrB,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQmN,UAAY,IACpBnN,EAAQoN,GAAK,KA7BC,EAkClBo2B,gBAjDZ,qBAwDI,WACIpxD,KAAK2uD,qBAAuB,EAI5B,IAFA,IAAM0C,EAAgB,CAAC,GAEvB,MAAkBlvD,OAAOsE,KAAKzG,KAAKkxD,aAAnC,eAAiD,CAA5C,IAAM5xD,EAAG,KAEE,eAARA,GACA+xD,EAAc7vD,KAAKxB,KAAKkxD,YAAY5xD,GAAKU,KAAKixD,YAGtD,OAAQjxD,KAAKwuD,gBAAgBuB,sBACzB,IAAK,OACD/vD,KAAK2uD,sBAAuBznD,SAAKmqD,GACjC,MACJ,IAAK,SACL,QACIrxD,KAAK2uD,sBAAuBqB,SAAOqB,GAI3CrxD,KAAK63C,SAASzC,eA7EtB,iCAgFI,SAAoBkc,GAChB,IAAIpoD,EAAO,KACPzJ,EAAQ6xD,EACZ,GAAIA,EAAS,IAAM,CACfpoD,EAAO,KACP,IAAM2jB,EAASykC,EAAS,IACxB7xD,EAAQotB,EACJA,EAAS,MACT3jB,EAAO,IAEPzJ,EADgBotB,EAAS,KAMjC,OADAptB,EAAQuG,KAAKgD,MAAiC,KAA1BvJ,EAAQoI,OAAO0pD,UAAkB,KACxC9rD,WAAa,IAAMyD,IA/FxC,wBAkGI,SAAWmkB,EAAMxgB,GAAK,WACZ2kD,EAAaxxD,KAAKkxD,YAAYlxD,KAAKyxD,iBAAiBpkC,IAE1D,QAAmBhtB,IAAfmxD,EAAJ,CAGIxxD,KAAK63C,SAASrmC,UACd6b,EAAK/R,UAAUtb,KAAK63C,SAASrmC,SAAShL,EAAGxG,KAAK63C,SAASrmC,SAASjK,KAE5DiqD,EAAU,MAAYA,EAAU,IAChCxxD,KAAK63C,SAASoW,QAAU,WACpB,EAAKpW,SAAS6Z,kBAAkBviC,UAC5B,EAAKwiC,oBAAoBH,EAAU,MAK3CxxD,KAAK63C,SAASoW,QAAU,WACpB,EAAKpW,SAAS6Z,kBAAkBviC,UAC5B,QAAU,EAAKwiC,oBAAoBH,EAAU,KAC7C,UAAY,EAAKG,oBAAoBH,EAAU,KAC/C,WAAa,EAAKG,oBAAoBH,EAAU,MAChD,aAAe,EAAKG,oBAAoBH,EAAU,KAClD,YAAcA,EAAU,QAMxC,IAAMF,EAASE,EAAWxxD,KAAKixD,WAC3Bd,EAAW,GAAiC,EAA5BnwD,KAAK2uD,sBAA6B2C,EAClDnB,EAAU,IACVA,EAAU,GACVA,EAAU,IACVA,EAAU,GACd,IAAMh9C,GAAQi9C,QAAaD,GAE3B9iC,EAAKgjC,MAAMrwD,KAAK63C,SAAUhrC,EAAKsG,MAvIvC,oCA0II,SAAuBsiC,EAAO5oC,EAAKyjD,EAAKC,GAAc,WAKlD9a,EAAMyB,QAAQn6B,SAAQ,SAAApW,GAClB,IAAM0L,EAAQojC,EAAMpoB,KAAK1mB,GAGzB,IAAIkG,EAAI2jD,KAAQn+C,EAAMiJ,UAAUi1C,EAAa/pD,EAAG+pD,EAAahpD,EACzDgpD,EAAaG,EAAGH,EAAarU,GAGjC,GAAKrvC,EAAI2jD,MAAQF,GAAOG,WACpBp+C,EAAMtF,MAAQujD,GAAOG,YACrBp+C,EAAMwF,KAAKxF,MAAM2e,WAAWooB,aAC5B,EAAKwY,WAAWv/C,EAAOxF,OACpB,CACH,IAAM0iD,EAAcl9C,EAAMwF,KAAK49B,MAC3B8Z,GACAA,EAAYrY,QAAQn6B,SAAQ,SAAApW,GACxB,IAAM0mB,EAAOkiC,EAAYliC,KAAK1mB,GAG1BkG,EAAI2jD,MAAQnjC,EAAK/R,UAAUi1C,EAAa/pD,EACxC+pD,EAAahpD,EAAGgpD,EAAaG,EAAGH,EAAarU,KAG7C7uB,EAAKxV,KAAKwV,KAAK2D,WAAWooB,cACzBvsC,EAAI2jD,KAAOF,GAAOK,SACnB,EAAKiB,WAAWvkC,EAAMxgB,GAElBwgB,aAAgBoiC,KAChB,EAAKmB,uBACDvjC,EAAKxV,KAAK49B,MAAO5oC,EAAKyjD,EAAKC,GAG/B,EAAKqB,WAAWvkC,EAAMxgB,aA/KtD,kBAwLI,WACI7M,KAAK4wD,uBACD5wD,KAAK63C,SAASpC,MACdz1C,KAAK63C,SAAShrC,IACd7M,KAAK63C,SAASiZ,eAAeC,mBAC7B/wD,KAAK63C,SAAS0Y,kBA7L1B,GAAgDhC,M,gICAzC,IAAMsD,EAAb,6B,IAAA,G,EAAA,E,gaAEI,WAAYrD,EAAiB3W,GAAU,6BACnC,cACI2W,EACA3W,IAGCia,UAAY,GAEb,EAAKpD,QACLA,OAAO3oC,YAAY,CACfjO,KAAM,mBAVqB,EAF3C,+CAiBI,SAAiB8V,GAEb,OAAIA,aAAmBqrB,KAEfrrB,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQoN,GADRpN,QAHc,EAQXA,aAAmB6hC,KACV7hC,EAAQ/V,KAAKwV,KAAK2D,WAAWqJ,KAAKS,aAE9Cwa,WAXc,EAgBX1nB,aAAmBujC,KAItBvjC,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQmN,UAAY,IACpBnN,EAAQ/V,KAAKwV,KAAK8rB,YAAc,KAtBlB,EAyBXvrB,aAAmBsrB,KAEtBtrB,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQmN,UAAY,IACpBnN,EAAQoN,GAAK,KA7BC,EAkClBo2B,gBApDZ,uCA2DI,WACIpxD,KAAK63C,SAASgX,iBAAiB,EAAG,EAAG,EAAG,GAAG,SAAC/2C,EAAM3W,EAAGsB,EAAKqsD,GAClDrsD,EAAIoV,YACmBxX,IAAnBoC,EAAIoV,KAAKk6C,QACTtvD,EAAIoV,KAAKk6C,WAAQ1xD,QACSA,IAA1BoC,EAAIoV,KAAKm6C,eACTvvD,EAAIoV,KAAKm6C,kBAAe3xD,SAjE5C,kCAsEI,SAAqBgtB,EAAM4hC,EAAYgD,GACnC,IAAMD,EAAehyD,KAAK8xD,UAAU9xD,KAAKyxD,iBAAiBpkC,IACtD0kC,OAAQ1xD,EAaZ,YAZqBA,IAAjB2xD,IACAD,EAAQ/xD,KAAKyuD,gBAAgBW,wBACzB4C,EACA/C,IAGR5hC,EAAKxV,KAAKm6C,aAAeA,EACzB3kC,EAAKxV,KAAKk6C,MAAQA,OAEJ1xD,IAAV0xD,GAAuBA,EAAQ,GAC/BE,EAAazwD,KAAKuwD,GAEfA,IArFf,mCAwFI,SAAsB1C,EAAGJ,EAAYgD,GACjC,IAAM3C,EAAOtvD,KACbqvD,EAAEnY,QAAQn6B,SAAQ,SAAApW,GACd,IAAM0L,EAAQg9C,EAAEhiC,KAAK1mB,GACrB2oD,EAAK4C,qBAAqB7/C,EAAO48C,EAAYgD,GAC7C,IAAM1C,EAAcl9C,EAAMwF,KAAK49B,MAC3B8Z,GACAA,EAAYrY,QAAQn6B,SAAQ,SAAApW,GACxB,IAAM0mB,EAAOkiC,EAAYliC,KAAK1mB,GAC9B,GAAI0mB,aAAgBoiC,KAAY,CAC5B,IAAMC,EAAqB,GACrBC,EAAUtiC,EAAKxV,KAAKwV,KAAK2D,WAAW4+B,eAG1CztD,OAAOsE,KAAKkpD,GAAS5yC,SAAQ,SAAC09B,GAC1BiV,EAAmBjV,GACf6U,EAAKb,gBAAgBW,wBACjBO,EAAQlV,GACRwU,MAIZ9sD,OAAOsE,KAAKwoD,GAAYlyC,SAAQ,SAAC09B,GACvBA,KAAUiV,IACZA,EAAmBjV,GAAUwU,EAAWxU,OAGhD6U,EAAK4C,qBACD7kC,EACAqiC,EACAuC,GAEJ3C,EAAK6C,sBACD9kC,EAAKxV,KAAK49B,MACVia,EACAuC,QAGJ3C,EAAK4C,qBACD7kC,EACA4hC,EACAgD,WAjI5B,sCAyII,SAAyBxc,GACrBz1C,KAAK2uD,qBAAuB,EAE5B,IAAMsD,EAAe,CAAC,GAOtB,OANAjyD,KAAKmyD,sBACD1c,EACAz1C,KAAKyuD,gBAAgBqB,iBACrBmC,GAGIjyD,KAAKwuD,gBAAgBuB,sBACzB,IAAK,OACD/vD,KAAK2uD,sBAAuBznD,SAAK+qD,GACjC,MACJ,IAAK,SACL,QACIjyD,KAAK2uD,sBAAuBqB,SAAOiC,MAzJnD,8BA8JI,SAAiBH,GACb9xD,KAAK8xD,UAAYA,EACjB9xD,KAAKirD,YAhKb,qBAmKI,WACIjrD,KAAKoyD,4BACLpyD,KAAKqyD,yBAAyBryD,KAAK63C,SAASpC,OAE5Cz1C,KAAK63C,SAASzC,eAvKtB,wBA0KI,SAAW/nB,EAAMxgB,GAAK,WACZklD,EAAQ1kC,EAAKxV,KAAKk6C,MAClBC,EAAe3kC,EAAKxV,KAAKm6C,aAoB/B,QAlBqB3xD,IAAjB2xD,GAA8BhyD,KAAK63C,SAASrmC,UAC5C6b,EAAK/R,UAAUtb,KAAK63C,SAASrmC,SAAShL,EAAGxG,KAAK63C,SAASrmC,SAASjK,KAE5DmB,MAAMspD,SAA2B3xD,IAAV0xD,EACvB/xD,KAAK63C,SAASoW,QAAU,WACpB,EAAKpW,SAAS6Z,kBAAkBviC,UAC5B,UAAY6iC,EAAe,KAAOD,EAAQ,KAKlD/xD,KAAK63C,SAASoW,QAAU,WACpB,EAAKpW,SAAS6Z,kBAAkBviC,UAC5B,UAAY6iC,SAKd3xD,IAAV0xD,EAIA,YAAqB1xD,IAAjB2xD,OACA3kC,EAAKgjC,MAAMrwD,KAAK63C,SAAUhrC,EAAK,aAG/B,EAKR,KAAIklD,GAAS,GAAb,CAIA,IAAI5B,EAAW,GAAiC,EAA5BnwD,KAAK2uD,sBAA6BoD,EAClD5B,EAAU,IACVA,EAAU,GACVA,EAAU,IACVA,EAAU,GACd,IAAMh9C,GAAQi9C,QAAaD,GAE3B9iC,EAAKgjC,MAAMrwD,KAAK63C,SAAUhrC,EAAKsG,MAxNvC,oCA2NI,SAAuBsiC,EAAO5oC,EAAKyjD,EAAKC,GAAc,WAKlD9a,EAAMyB,QAAQn6B,SAAQ,SAAApW,GAClB,IAAM0L,EAAQojC,EAAMpoB,KAAK1mB,GAGzB,IAAIkG,EAAI2jD,KAAQn+C,EAAMiJ,UAAUi1C,EAAa/pD,EAAG+pD,EAAahpD,EACzDgpD,EAAaG,EAAGH,EAAarU,GAGjC,GAAKrvC,EAAI2jD,MAAQF,GAAOG,WACpBp+C,EAAMtF,MAAQujD,GAAOG,YACrBp+C,EAAMwF,KAAKxF,MAAM2e,WAAWooB,aAC5B,EAAKwY,WAAWv/C,EAAOxF,OACpB,CACH,IAAM0iD,EAAcl9C,EAAMwF,KAAK49B,MAC3B8Z,GACAA,EAAYrY,QAAQn6B,SAAQ,SAAApW,GACxB,IAAM0mB,EAAOkiC,EAAYliC,KAAK1mB,GAG1BkG,EAAI2jD,MAAQnjC,EAAK/R,UAAUi1C,EAAa/pD,EACxC+pD,EAAahpD,EAAGgpD,EAAaG,EAAGH,EAAarU,KAG7C7uB,EAAKxV,KAAKwV,KAAK2D,WAAWooB,cACzBvsC,EAAI2jD,KAAOF,GAAOK,SACnB,EAAKiB,WAAWvkC,EAAMxgB,GAElBwgB,aAAgBoiC,KAChB,EAAKmB,uBACDvjC,EAAKxV,KAAK49B,MAAO5oC,EAAKyjD,EAAKC,GAG/B,EAAKqB,WAAWvkC,EAAMxgB,aAhQtD,kBAyQI,WACI7M,KAAK4wD,uBACD5wD,KAAK63C,SAASpC,MACdz1C,KAAK63C,SAAShrC,IACd7M,KAAK63C,SAASiZ,eAAeC,mBAC7B/wD,KAAK63C,SAAS0Y,gBA9Q1B,4BAkRI,SAAez4C,EAAM2Q,EAAIjX,EAAU6jC,EAAUoD,EAAiBV,GAC1D,KAAa,UAATjgC,GAAqBigC,GACjBU,SACEA,aAA2Be,WACMn5C,IAA/Bo4C,EAAgB5gC,KAAKk6C,OAAqB,CAC1C,IAAMC,EAAehyD,KAAK8xD,UAAU9xD,KAAKyxD,iBAAiBhZ,IAC1D,GAAIuZ,EAAc,CACd,IAAM1C,EAAOtvD,KACbA,KAAKyuD,gBAAgBW,wBACjB4C,EACA1C,EAAKb,gBAAgBqB,kBACrB,GACA,WACIR,EAAK8C,4BACL9C,EAAK+C,yBACD/C,EAAKzX,SAASpC,WAQ1C,OAAO,MAzSf,GAAwC8Y,M,mJCJjC,SAAS+D,EAAqBjD,GAEjC,IAAMkD,EAAK,CACXA,MAAW,EACXA,OAAY,GASZ,OAPAlD,EAAEnY,QAAQn6B,SAAQ,SAACpW,GACf,IAAMH,EAAI6oD,EAAEhiC,KAAK1mB,GAAGH,EAAI6oD,EAAEhiC,KAAK1mB,GAAGoG,MAAQ,EACpCxF,EAAI8nD,EAAEhiC,KAAK1mB,GAAGY,EAAI8nD,EAAEhiC,KAAK1mB,GAAGuG,OAAS,EACvC1G,EAAI+rD,EAAGxlD,QAAOwlD,EAAGxlD,MAAQvG,GACzBe,EAAIgrD,EAAGrlD,SAAQqlD,EAAGrlD,OAAS3F,MAG5BgrD,EAGJ,SAASC,EAAYnd,GACxB,IAAMkd,EAAK,CAAEE,GAAI,KAAMC,GAAI,KAAMC,GAAI,KAAMC,GAAI,MAc/C,OAZAvd,EAASt4B,SAAQ,SAACpW,GACd,IAAMgK,EAAUhK,EAAEgK,WACJ,OAAV4hD,EAAGE,IAAe9hD,EAAQnK,EAAI+rD,EAAGE,MAAIF,EAAGE,GAAK9hD,EAAQnK,IAC3C,OAAV+rD,EAAGG,IAAe/hD,EAAQpJ,EAAIgrD,EAAGG,MAAIH,EAAGG,GAAK/hD,EAAQpJ,GAEzD,IAAMorD,EAAKhsD,EAAEH,EAAIG,EAAEoG,MAAQ,EACrB6lD,EAAKjsD,EAAEY,EAAIZ,EAAEuG,OAAS,GAEd,OAAVqlD,EAAGI,IAAeA,EAAKJ,EAAGI,MAAIJ,EAAGI,GAAKA,IAC5B,OAAVJ,EAAGK,IAAeA,EAAKL,EAAGK,MAAIL,EAAGK,GAAKA,MAGvC,CAAEpsD,EAAG+rD,EAAGE,GAAIlrD,EAAGgrD,EAAGG,GAAI3lD,MAAOwlD,EAAGI,GAAKJ,EAAGE,GAAIvlD,OAAQqlD,EAAGK,GAAKL,EAAGG,IAGnE,SAASG,EAAyB7D,GAErC,IAAIuD,EAAK,GAyBT,OAxBAA,EAAGE,GAAKzD,EAAK8D,OAAO,GAAGtsD,EACvB+rD,EAAGG,GAAK1D,EAAK8D,OAAO,GAAGvrD,EACvBgrD,EAAGI,GAAK3D,EAAK8D,OAAO,GAAGtsD,EACvB+rD,EAAGK,GAAK5D,EAAK8D,OAAO,GAAGvrD,EAEvBynD,EAAK8D,OAAO/1C,SAAQ,SAACjZ,GACjByuD,EAAGE,GAAK3uD,EAAE0C,EAAI+rD,EAAGE,GAAK3uD,EAAE0C,EAAI+rD,EAAGE,GAC/BF,EAAGG,GAAK5uD,EAAEyD,EAAIgrD,EAAGG,GAAK5uD,EAAEyD,EAAIgrD,EAAGG,GAC/BH,EAAGI,GAAK7uD,EAAE0C,EAAI+rD,EAAGI,GAAK7uD,EAAE0C,EAAI+rD,EAAGI,GAC/BJ,EAAGK,GAAK9uD,EAAEyD,EAAIgrD,EAAGK,GAAK9uD,EAAEyD,EAAIgrD,EAAGK,OAGnCL,EAAK,CACD,EAAKA,EAAGE,GAAI,EAAKF,EAAGG,GAAI,MAAUH,EAAGI,GAAKJ,EAAGE,GAC7C,OAAWF,EAAGK,GAAKL,EAAGG,KAEnB3lD,OAAS,IACZwlD,EAAGxlD,MAAQ,GACXwlD,EAAG/rD,GAAK,GAER+rD,EAAGrlD,QAAU,IACbqlD,EAAGrlD,OAAS,GACZqlD,EAAGhrD,GAAK,GAELgrD,EAGJ,SAASQ,EAAsB/D,GAClC,IAAMuD,EAAKM,EAAyB7D,GACpCA,EAAKxoD,EAAI+rD,EAAG/rD,EAAI+rD,EAAGxlD,MAAQ,EAC3BiiD,EAAKznD,EAAIgrD,EAAGhrD,EAAIgrD,EAAGrlD,OAAS,EAC5B8hD,EAAKjiD,MAAQwlD,EAAGxlD,MAChBiiD,EAAK9hD,OAASqlD,EAAGrlD,O,0GC5DrB,I,EAGIgV,EAA0B,EAEjB8wC,EAAb,WAOI,WAAYnmD,EAAKgrC,EAAUv3B,IAAQ,eAC/BtgB,KAAK6M,IAAMA,EACX7M,KAAK6M,IAAI2jD,KAAM,EACfxwD,KAAKsgB,OAASA,EACdtgB,KAAKqiB,QAAU,KACfriB,KAAKizD,UAAY,KACjBjzD,KAAKsiB,UAAY,GACjBtiB,KAAK63C,SAAWA,EAChB73C,KAAKuiB,QAAU,GAEfviB,KAAKkzD,gBAAkB,KACvBlzD,KAAKmzD,cAAgB,KACrBnzD,KAAKozD,iBAAmB,KAIxBpzD,KAAKqzD,UAAY,KAEjBrzD,KAAKwiB,eAAgB,EACrBxiB,KAAKszD,OAAS,EAEdtzD,KAAK2iB,aAAc,EAEnB3iB,KAAK4iB,aAAe,CAAEpc,EAAG,EAAGe,EAAG,GAE/BvH,KAAK6iB,WAAa,EAElB7iB,KAAK8iB,KAAOnW,SAASoW,gBAAgB,6BAA8B,OAEnE/iB,KAAKgjB,eAAiBhjB,KAAK8iB,KAAKG,kBAEhCjjB,KAAKkjB,0BAtCb,4CAyCI,WACIljB,KAAKkzD,gBAAkB,KACvBlzD,KAAKmzD,cAAgB,KACrBnzD,KAAKqzD,UAAY,KACjBrzD,KAAKozD,iBAAmB,OA7ChC,gCAgDI,SAAmBG,GACf,GAAIvzD,KAAKozD,iBAAkB,CACvB,IAAI5nC,GAAS,EAOb,OANAA,GAAUxrB,KAAKozD,iBAAiB7xD,GAAKgyD,EAAchyD,EACnDiqB,GAAUxrB,KAAKozD,iBAAiB1rD,GAAK6rD,EAAc7rD,EACnD8jB,GAAUxrB,KAAKozD,iBAAiB1mD,GAAK6mD,EAAc7mD,EACnD8e,GAAUxrB,KAAKozD,iBAAiB1jD,GAAK6jD,EAAc7jD,GACnD8b,GAAUxrB,KAAKozD,iBAAiBjyD,GAAKoyD,EAAcpyD,GACzCnB,KAAKozD,iBAAiB7vC,GAAKgwC,EAAchwC,EAGnD,OAAO,IA3DnB,uBA8DI,SAAUgwC,GAEN,GAAIvzD,KAAKwzD,mBAAmBD,GAGxB,OAFAvzD,KAAKyzD,qBACLzzD,KAAKgjB,eAAiBuwC,GAI1BvzD,KAAKyzD,gBACLzzD,KAAKqzD,UChFN,SAAoBK,EAAInvC,GAC3B,SAASovC,EAAUvjD,GACf,IAAM2I,EAAQ,CAAC/S,KAAKC,KAAKmK,EAAE7O,EAAI6O,EAAE7O,EAAI6O,EAAE1I,EAAI0I,EAAE1I,GAAI1B,KAAKC,KAAKmK,EAAE1D,EAAI0D,EAAE1D,EAAI0D,EAAEV,EAAIU,EAAEV,IAEnEU,EAAE7O,EAAI6O,EAAEV,EAAIU,EAAE1I,EAAI0I,EAAE1D,EACtB,IACF0D,EAAE7O,EAAI6O,EAAEV,EACRqJ,EAAM,IAAMA,EAAM,GAElBA,EAAM,IAAMA,EAAM,IAG1B,IAAM66C,EAAQxjD,EAAE7O,GAAKwX,EAAM,IAAM,GAC3B86C,EAAQzjD,EAAE1I,GAAKqR,EAAM,IAAM,GAC3B+6C,EAAQ1jD,EAAE1D,GAAKqM,EAAM,IAAM,GAC3Bg7C,EAAQ3jD,EAAEV,GAAKqJ,EAAM,IAAM,GAE3Bi7C,EAASJ,EAAQA,EAAQC,EAAQC,EACjCG,EAASL,EAAQC,EAAQA,EAAQE,EACjCG,EAASN,EAAQE,EAAQD,EAAQD,EACjCO,EAASP,EAAQG,EAAQF,EAAQA,EAEjCvO,EAA+B,IAAvBt/C,KAAKu/C,MAAMn1C,EAAE1I,EAAG0I,EAAE7O,GAAWyE,KAAKsO,GAEhD,MAAO,CACH2P,UAAW,CAAC7T,EAAEjP,EAAGiP,EAAEmT,GACnBxK,QACAi7C,SACAC,SACAC,SACAC,SACA7O,SAuDR,IAAM8O,EAAKT,EAAUD,GACfW,EAAKV,EAAUpvC,GAErB,OAAO,SAACwF,GAAD,OAdYra,EAxCnB,SAAwB0kD,EAAIC,EAAItqC,GAC5B,SAASuqC,EAAK/yD,EAAGmG,GACb,OAAQA,EAAInG,GAAKwoB,EAAIxoB,EAGzB,IAAIgzD,EAAUH,EAAG9O,OAAS,IACtBkP,EAAUH,EAAG/O,OAAS,IACtBmP,EAAUL,EAAGr7C,MAgBjB,OAdKq7C,EAAGr7C,MAAM,GAAK,GAAKs7C,EAAGt7C,MAAM,GAAK,GAAOq7C,EAAGr7C,MAAM,GAAK,GAAKs7C,EAAGt7C,MAAM,GAAK,KAC1E07C,EAAU,EAAEA,EAAQ,IAAKA,EAAQ,IACjCF,GAAWA,EAAU,EAAI,KAAO,KAGhCvuD,KAAKgE,IAAIuqD,EAAUC,GAAW,MAC1BD,EAAUC,EACVD,GAAW,IAEXC,GAAW,KAKZ,CACHvwC,UAAW,CACPqwC,EAAKF,EAAGnwC,UAAU,GAAIowC,EAAGpwC,UAAU,IACnCqwC,EAAKF,EAAGnwC,UAAU,GAAIowC,EAAGpwC,UAAU,KAEvClL,MAAO,CACHu7C,EAAKG,EAAQ,GAAIJ,EAAGt7C,MAAM,IAC1Bu7C,EAAKG,EAAQ,GAAIJ,EAAGt7C,MAAM,KAE9Bi7C,OAAQM,EAAKF,EAAGJ,OAAQK,EAAGL,QAC3BC,OAAQK,EAAKF,EAAGH,OAAQI,EAAGJ,QAC3BC,OAAQI,EAAKF,EAAGF,OAAQG,EAAGH,QAC3BC,OAAQG,EAAKF,EAAGD,OAAQE,EAAGF,QAC3B7O,MAAOgP,EAAKC,EAASC,IAkBLE,CAAeN,EAAIC,EAAItqC,IAbrC4qC,EAAShoD,SAASoW,gBAAgB,6BAA8B,OAAOE,mBACtE1hB,EAAImO,EAAEskD,OACbW,EAAOjtD,EAAIgI,EAAEukD,OACbU,EAAOjoD,EAAIgD,EAAEwkD,OACbS,EAAOjlD,EAAIA,EAAEykD,OACbQ,EAAOxzD,EAAIuO,EAAEuU,UAAU,GAAKvU,EAAEskD,OAAStkD,EAAEuU,UAAU,GAAKvU,EAAEwkD,OAC1DS,EAAOpxC,EAAI7T,EAAEuU,UAAU,GAAKvU,EAAEukD,OAASvkD,EAAEuU,UAAU,GAAKvU,EAAEykD,OACnDQ,EAAOxwC,OAAO,EAAG,EAAGzU,EAAE41C,MAAQt/C,KAAKsO,GAAK,KAAKyE,MAAMrJ,EAAEqJ,MAAM,GAAIrJ,EAAEqJ,MAAM,IARlF,IAAmBrJ,EACTilD,GDIWC,CAAW50D,KAAKgjB,eAAgBuwC,GACjDvzD,KAAKozD,iBAAmBG,IAxEhC,sBA2EI,SAAS/sD,EAAGe,GACR,IAAM4b,EAAKnjB,KAAK8iB,KAAKM,iBAErB,OADAD,EAAG3c,EAAIA,EAAG2c,EAAG5b,EAAIA,EACV4b,IA9Ef,gCAiFI,WACI,IAAME,EAAKrjB,KAAKgjB,eAChBhjB,KAAK6M,IAAIyW,aAAaD,EAAG9hB,EAAG8hB,EAAG3b,EAAG2b,EAAG3W,EAAG2W,EAAG3T,EAAG2T,EAAGliB,EAAGkiB,EAAGE,KAnF/D,uBAsFI,WACI,MAAO,CAAE/c,EAAGxG,KAAKgjB,eAAe7hB,EAAGoG,EAAGvH,KAAKgjB,eAAeO,KAvFlE,qCA0FI,WAA0B,WAOhBC,EAAM7W,SAASoW,gBAAgB,6BAA8B,OACnE/iB,KAAK6M,IAAI4W,yBAA2BD,EAAIP,kBAGxC,IAAMS,EAAU,WACZ1Y,QAAQ5E,QAAQsC,MAAM,EAAKmE,IAAI4W,yBAAyBF,KAEtDI,EAAO3jB,KAAK6M,IACZ+W,EAAaD,EAAK5K,MACxB4K,EAAK5K,MAAQ,SAAU8K,EAAIC,GAGvB,OAFAH,EAAKF,yBAA2BE,EAAKF,yBAAyBM,gBAAgBF,EAAIC,GAClFJ,IACOE,EAAW1iB,KAAKyiB,EAAME,EAAIC,IAErC,IAAME,EAAiBL,EAAKM,UAC5BN,EAAKM,UAAY,SAAUJ,EAAIC,GAG3B,OAFAH,EAAKF,yBAA2BE,EAAKF,yBAAyBQ,UAAUJ,EAAIC,GAC5EJ,IACOM,EAAe9iB,KAAKyiB,EAAME,EAAIC,IAEzC,IAAMI,EAAcP,EAAKQ,OACzBR,EAAKQ,OAAS,SAAUC,GAGpB,OAFAT,EAAKF,yBAA2BE,EAAKF,yBAAyBU,OAAW,IAAJC,EAAYpe,KAAKsO,IACtFoP,IACOQ,EAAYhjB,KAAKyiB,EAAMS,IAElC,IAAMC,EAAiBV,EAAK5K,MAC5B4K,EAAKW,UAAY,SAAU/iB,EAAGmG,EAAGgF,EAAGgD,EAAGvO,EAAGoiB,GACtC,IAAMgB,EAAKf,EAAIP,kBAIf,OAHAsB,EAAGhjB,EAAIA,EAAGgjB,EAAG7c,EAAIA,EAAG6c,EAAG7X,EAAIA,EAAG6X,EAAG7U,EAAIA,EAAG6U,EAAGpjB,EAAIA,EAAGojB,EAAGhB,EAAIA,EACzDI,EAAKF,yBAA2BE,EAAKF,yBAAyBe,SAASD,GACvEb,IACOW,EAAenjB,KAAKyiB,EAAMpiB,EAAGmG,EAAGgF,EAAGgD,EAAGvO,EAAGoiB,IAGpD,IAAMkB,EAAoBd,EAAKL,aAC/BK,EAAKL,aAAe,SAAU/hB,EAAGmG,EAAGgF,EAAGgD,EAAGvO,EAAGoiB,GAQzC,OAPAI,EAAKF,yBAAyBliB,EAAIA,EAClCoiB,EAAKF,yBAAyB/b,EAAIA,EAClCic,EAAKF,yBAAyB/W,EAAIA,EAClCiX,EAAKF,yBAAyB/T,EAAIA,EAClCiU,EAAKF,yBAAyBtiB,EAAIA,EAClCwiB,EAAKF,yBAAyBF,EAAIA,EAClCG,IACOe,EAAkBvjB,KAAKyiB,EAAMpiB,EAAGmG,EAAGgF,EAAGgD,EAAGvO,EAAGoiB,IAGvDI,EAAKe,gCAAkC,SAAUle,EAAGe,GAChD,IAAM4b,EAAKK,EAAIJ,iBAGf,OAFAD,EAAG3c,EAAIA,EAAG2c,EAAG5b,EAAIA,EACjBmc,IACOP,EAAGwB,gBAAgBhB,EAAKF,yBAAyBmB,cApJpE,qBAwJI,WACI5kB,KAAK2iB,aAAc,EACnB3iB,KAAK6kB,mBA1Jb,yBA6JI,SAAYpiB,GACRzC,KAAKsiB,UAAU9gB,KAAKiB,GACpBzC,KAAKuiB,QAAQ/gB,KAAK,CAAE,EAAKwxD,EAAcluC,UAAW,EAAKriB,MA/J/D,4BAkKI,SAAesiB,GACX/kB,KAAKsiB,UAAYtiB,KAAKsiB,UAAUja,QAAO,SAAA7B,GAAC,OAAIA,GAAKue,OAnKzD,4BAsKI,WAAiB,Q,w5BAAA,CACG/kB,KAAKsiB,WADR,IACb,2BAAgC,QAC1B0C,UAFO,8BAIbhlB,KAAKsiB,UAAY,GACjBtiB,KAAKuiB,QAAU,KA3KvB,qBA8KI,WACI,IAAM1V,EAAM7M,KAAKsgB,OAAOxT,WAAW,MAC7B6D,EAAU9D,EAAIgoD,aAAa,EAAG,EAAG,EAAG,GAAGh9C,KAC7C,OAAkB,GAAdlH,EAAQ,IAAyB,GAAdA,EAAQ,IAAyB,GAAdA,EAAQ,IAAyB,KAAdA,EAAQ,KAGjD,IAAImkD,YACpBjoD,EAAIgoD,aAAa,EAAG,EAAG70D,KAAKsgB,OAAOvT,MAAO/M,KAAKsgB,OAAOpT,QAAQ2K,KAAKk9C,QAGnDx4C,MAAK,SAAApJ,GAAK,OAAc,aAAVA,OAxL1C,mBA2LI,SAAM8R,GAAoB,IAAdze,EAAc,uDAAV,EAAGe,EAAO,uDAAH,EAEnB,GADAvH,KAAKyzD,kBACDzzD,KAAKwiB,eAAiBxiB,KAAK6iB,WAAa,GAA5C,CAGA7iB,KAAK6iB,aACL7iB,KAAKwiB,eAAgB,EACjBxiB,KAAKg1D,YACLh1D,KAAK63C,SAASod,QAAU,QACxBj1D,KAAK63C,SAASqd,aAAa,MAAM,GACjCjwC,EAAO,KAGXjlB,KAAK4iB,aAAapc,EAAIA,EACtBxG,KAAK4iB,aAAarb,EAAIA,EAEtB,IAAM2d,EAAKD,EACL9B,EAAKnjB,KAAKmlB,SAASnlB,KAAK4iB,aAAapc,EAAGxG,KAAK4iB,aAAarb,GAAGod,gBAAgB3kB,KAAKgjB,eAAe4B,WACvG5kB,KAAKgjB,eAAiBhjB,KAAKgjB,eAAeiB,UAAUd,EAAG3c,EAAG2c,EAAG5b,GAC7DvH,KAAKgjB,eAAiBhjB,KAAKgjB,eAAejK,MAAMmM,EAAIA,EAAI,EAAG,EAAG,EAAG,GACjEllB,KAAKszD,QAAUpuC,EACfllB,KAAKgjB,eAAiBhjB,KAAKgjB,eAAeiB,WAAWd,EAAG3c,GAAI2c,EAAG5b,GAE/DvH,KAAK6iB,gBAlNb,sBAsNI,SAASlQ,GAAuB,IAAjBsO,EAAiB,wDACtBk0C,EAAWn1D,KAAKsgB,OAAOvT,MACvBqoD,EAAWp1D,KAAKsgB,OAAOpT,OAC7B,GAAgB,GAAZioD,GAA6B,GAAZC,EAArB,CAGA,IAAIr8C,EAAQ,EAAGs8C,EAAK,EAAGC,EAAK,EACxB3iD,EAAK5F,MAAQ4F,EAAKzF,QAClB6L,EAAQo8C,EAAWxiD,EAAK5F,MACxBsoD,GAAM1iD,EAAKnM,EACX8uD,GAAM3iD,EAAKpL,EAAKoL,EAAKzF,OAAS,EAAMkoD,EAAWr8C,EAAQ,EAGnDpG,EAAKzF,OAAS6L,EAAQq8C,IACtBr8C,EAAQq8C,EAAWziD,EAAKzF,OACxBmoD,GAAM1iD,EAAKnM,EAAKmM,EAAK5F,MAAQ,EAAMooD,EAAWp8C,EAAQ,EACtDu8C,GAAM3iD,EAAKpL,KAGfwR,EAAQq8C,EAAWziD,EAAKzF,OACxBmoD,GAAM1iD,EAAKnM,EAAKmM,EAAK5F,MAAQ,EAAMooD,EAAWp8C,EAAQ,EACtDu8C,GAAM3iD,EAAKpL,EAGPoL,EAAK5F,MAAQgM,EAAQo8C,IACrBp8C,EAAQo8C,EAAWxiD,EAAK5F,MACxBsoD,GAAM1iD,EAAKnM,EACX8uD,GAAM3iD,EAAKpL,EAAKoL,EAAKzF,OAAS,EAAMkoD,EAAWr8C,EAAQ,IAK/D,IAAMw6C,EAAgBvzD,KAAK8iB,KAAKG,kBAAkBlK,MAAMA,EAAOA,EAAO,EAAG,EAAG,EAAG,GAAGkL,UAAUoxC,EAAIC,GAE5Fr0C,GAA8B,OAAnBjhB,KAAKizD,UAChBjzD,KAAKu1D,UAAUhC,IAEfvzD,KAAKyzD,gBACLzzD,KAAKgjB,eAAiBuwC,GAG1BvzD,KAAK4iB,aAAe,CAAEpc,EAAG,EAAGe,EAAG,GAC/BvH,KAAKszD,OAAS,KAhQtB,uBAmQI,SAAU9sD,EAAGe,GACTvH,KAAKyzD,gBACLzzD,KAAKgjB,eAAiBhjB,KAAKgjB,eAAeiB,UAAUzd,EAAIxG,KAAKgjB,eAAezhB,EAAGgG,EAAIvH,KAAKgjB,eAAetT,KArQ/G,+BAkRI,SACI6nC,EAAIie,EAAcC,EAAcC,EAAchgB,EAC9CigB,EAAmBC,GAErB,IAFiCC,IAEjC,yDADEC,EACF,wDAD4BC,EAC5B,4DAD2C11D,EAEzCL,KAAKyzD,gBAGL,IAAIuC,EAAY,GACZC,EAAW,GAGXC,EAAexgB,EAAU6B,EAAGld,KAAKS,cACjCujB,EAAiB,KAEjBqX,IAAiBQ,IAAiB3e,EAAG1/B,KAAKxF,OAAyB,kBAAhBklC,EAAG1/B,KAAKC,KAMnC,OAAjBy/B,EAAGxc,WAAsBm7B,IAGhC7X,EAAiB6X,EAAa7oC,KAAKkqB,EAAGxc,YAEnBljB,KAAKxF,QACpB6jD,EAAe7X,EAAexmC,KAAK49B,OAPvC4I,EAAiBsX,EAAkBpe,EAAGld,KAAKS,eAU3Co7B,GAAkB3e,aAAciC,OAEhC0c,EAAaC,SAAS5e,EAAGvc,IAAIje,SAAQ,SAAAq5C,GACjCJ,EAAUx0D,KAAK00D,EAAalH,KAAKoH,OAErCF,EAAaG,QAAQ9e,EAAGvc,IAAIje,SAAQ,SAAAq5C,GAChCH,EAASz0D,KAAK00D,EAAalH,KAAKoH,QAKxC,IAAIE,EAAKb,EAAajvD,EAAIgvD,EAAahvD,EACnC+vD,EAAKd,EAAaluD,EAAIiuD,EAAajuD,EAGnC4b,GAAM,EACV,GAAIo0B,aAAciC,KACd,GAAIsc,EACA3yC,GAAM,OACH,GAAI4yC,GAAgBA,EAAat3D,OAAS,EAC7C0kB,GAAM,OACH,GAAIyyC,EAEP,QAA8Bv1D,IAA1Bu1D,EAAWY,WAA0B,CACrC,IAAI59C,EAAO,KACX2+B,EAAGub,OAAO/1C,SAAQ,SAACjZ,EAAGpF,GAGlB,GAAS,GAALA,GAAUA,GAAK64C,EAAGub,OAAOr0D,OAAS,EAAtC,CAEA,IAAIg4D,EAAM3yD,EAAE0C,EAAIovD,EAAWc,GACvBC,EAAM7yD,EAAEyD,EAAIquD,EAAWgB,GACvBC,EAAUJ,EAAIA,EAAME,EAAIA,GACf,OAAT/9C,GAAiBi+C,EAAUj+C,KAC3BA,EAAOi+C,EACP1zC,EAAKzkB,OAGbk3D,EAAWY,WAAarzC,OAExBA,EAAKyyC,EAAWY,WAK5B,GAAInY,EAAgB,CAIhB,IAAMyY,EACDzY,EAAe73C,EAAK63C,EAAetxC,MAAQ,EAC1CgqD,EACFD,EAAqBzY,EAAetxC,MAClCiqD,EACD3Y,EAAe92C,EAAK82C,EAAenxC,OAAS,EAC3C+pD,EACFD,EAAoB3Y,EAAenxC,OAEnCgqD,EAAc3f,EAAGrqC,OAAS,EAC1BiqD,EAAc5f,EAAGxqC,MAAQ,EACzBwqC,aAAciC,OACd0d,EAAcC,EAAc,GAEhC,IAAMC,EAAQN,EAAqBK,EAC7BE,EAAQL,EAAoBE,EAC5B/1C,EAAQ41C,EAAsBI,EAC9B/1C,EAAQ61C,EAAuBC,EAKrC,GAAI3f,aAAciC,MACd,GAAIr2B,EAAK,EAAG,CACR,IAAIm0C,EAAW/f,EAAGub,OAAO3vC,GAAI3c,EAAI8vD,EAC7BiB,EAAWhgB,EAAGub,OAAO3vC,GAAI5b,EAAIgvD,EAC7Be,GAAYF,GACZ3B,EAAajvD,GAAKswD,EAClBR,EAAKc,EAAQ7f,EAAGub,OAAO3vC,GAAI3c,GACpB8wD,GAAYn2C,GACnBs0C,EAAajvD,GAAKuwD,KAClBT,EAAKn1C,EAAQo2B,EAAGub,OAAO3vC,GAAI3c,GAE3B+wD,GAAYF,GACZ5B,EAAaluD,GAAKyvD,EAClBT,EAAKc,EAAQ9f,EAAGub,OAAO3vC,GAAI5b,GACpBgwD,GAAYn2C,GACnBq0C,EAAaluD,GAAK0vD,KAClBV,EAAKn1C,EAAQm2B,EAAGub,OAAO3vC,GAAI5b,QAGhC,CACH,IAAI+vD,EAAW/f,EAAG/wC,EAAI8vD,EAClBiB,EAAWhgB,EAAGhwC,EAAIgvD,EAClBe,GAAYF,GACZ3B,EAAajvD,GAAKswD,EAClBR,EAAKc,EAAQ7f,EAAG/wC,GACT8wD,GAAYn2C,GACnBs0C,EAAajvD,GAAKuwD,KAClBT,EAAKn1C,EAAQo2B,EAAG/wC,GAEhB+wD,GAAYF,GACZ5B,EAAaluD,GAAKyvD,EAClBT,EAAKc,EAAQ9f,EAAGhwC,GACTgwD,GAAYn2C,GACnBq0C,EAAaluD,GAAK0vD,KAClBV,EAAKn1C,EAAQm2B,EAAGhwC,IAK5B,GAAIgwC,aAAciC,KAAlB,CACI,IAAI79B,EAOJ,GANIk6C,KACAl6C,GAAW67C,QAAqBjgB,MAG5B57B,GAAW87C,QAA4BlgB,KAE3Cp0B,EAAK,GAQL,GANAo0B,EAAGub,OAAO3vC,GAAI3c,GAAK8vD,EACnB/e,EAAGub,OAAO3vC,GAAI5b,GAAKgvD,EAGnBxD,EAAsBxb,GAElBse,EAAsB,CACtB,IAAKl6C,EAASm3C,OAAQ,CAClBn3C,EAASm3C,OAASl0D,MAAM24C,EAAGub,OAAOr0D,QAClC,IAAK,IAAIC,EAAI,EAAGA,EAAI64C,EAAGub,OAAOr0D,OAAQC,IAClCid,EAASm3C,OAAOp0D,GAAK,CAAC43D,GAAI,EAAGC,GAAI,GAIzC56C,EAASm3C,OAAO3vC,GAAImzC,IAAMA,EAC1B36C,EAASm3C,OAAO3vC,GAAIozC,IAAMA,QAE3B,IAAW,GAAPpzC,EAAU,CAEjB,IAAK,IAAIzkB,EAAI,EAAGA,EAAI64C,EAAGub,OAAOr0D,OAAS,EAAGC,IACtC64C,EAAGub,OAAOp0D,GAAG8H,GAAK8vD,EAClB/e,EAAGub,OAAOp0D,GAAG6I,GAAKgvD,EAGtB,GAAIV,EACA,IAAK,IAAIn3D,EAAI,EAAGA,EAAI64C,EAAGub,OAAOr0D,OAAS,EAAGC,IACtCid,EAASm3C,OAAOp0D,GAAG43D,IAAMA,EACzB36C,EAASm3C,OAAOp0D,GAAG63D,IAAMA,OAG9B,IAAW,GAAPpzC,EACP,IAAK,IAAIzkB,EAAI,EAAGA,EAAI64C,EAAGub,OAAOr0D,OAAS,EAAGC,IACtC64C,EAAGub,OAAOp0D,GAAG8H,GAAKuvD,EAAar3D,GAAG43D,GAClC/e,EAAGub,OAAOp0D,GAAG6I,GAAKwuD,EAAar3D,GAAG63D,OA3C9C,CA6GA,GAHAmB,EAAyBngB,GAGrBse,EAAsB,CACtB,IAAIl6C,GAAW67C,QAAqBjgB,GAC/B57B,IACDA,GAAW87C,QAA4BlgB,IAE3C57B,EAAS26C,IAAMA,EACf36C,EAAS46C,IAAMA,EAGXhf,aAAcogB,WAAapgB,EAAG1/B,KAAKwV,KAAK2D,WAAWooB,eAC9Cz9B,EAASi8C,WACVj8C,EAASi8C,SAAW,EACpBj8C,EAASk8C,SAAW,GAGxBl8C,EAASi8C,UAAYtB,EACrB36C,EAASk8C,UAAYtB,GAI7B,GAAIhf,EAAG1/B,KAAKxF,QAAUklC,EAAG1/B,KAAKxF,MAAM2e,WAAWooB,aAAc,CAEzD,IAAM3D,EAAQ8B,EAAG1/B,KAAK49B,MACtBA,EAAMyB,QAAQn6B,SAAQ,SAAAyb,GAElBk/B,EADajiB,EAAMpoB,KAAKmL,OAK5Bid,EAAMuB,QAAQj6B,SAAQ,SAAAq5C,GAClB,IAAMpH,EAAOvZ,EAAMuZ,KAAKoH,GACxBpH,EAAKxoD,GAAK8vD,EACVtH,EAAKznD,GAAKgvD,EACVvH,EAAK8D,OAAO/1C,SAAQ,SAAA+6C,GAChBA,EAAMtxD,GAAK8vD,EACXwB,EAAMvwD,GAAKgvD,KAEfxD,EAAsB/D,MAK9BgH,EAAUj5C,SAAQ,SAAAiyC,GACd,IAAMxpD,EAAIwpD,EAAK8D,OAAOr0D,OAAS,EAC3Bs5D,GAAQ,EACZ,GAA2B,OAAvB/I,EAAKgJ,cACL,IAAK,IAAIt5D,EAAI,EAAGA,EAAI64C,EAAG0gB,eAAex5D,OAAQC,IAC1C,GAAI64C,EAAG0gB,eAAev5D,GAAGmZ,KAAKnS,OAASspD,EAAKgJ,cAAe,CACvDhJ,EAAK8D,OAAO,IAAKoF,mBAAc3gB,EAAG0gB,eAAev5D,GAAIswD,EAAK8D,OAAO,IACjEiF,GAAQ,EACR,MASZ,GALKA,IACD/I,EAAK8D,OAAO,GAAGtsD,GAAK8vD,EACpBtH,EAAK8D,OAAO,GAAGvrD,GAAKgvD,GAGG,OAAvBvH,EAAKmJ,cAAwB,WACzBh3D,EAAC,UAAGk9C,SAAH,iBAAG,EAAgBxmC,YAAnB,iBAAG,EAAsBxF,aAAzB,aAAG,EAA6B2kC,MAAMgY,EAAKh0B,IAC5Co9B,EAASlC,EAAa7oC,KAAKlsB,aAAlB,EAAkBA,EAAG81C,KAClC,GAAImhB,EACA,IAAK,IAAI15D,EAAI,EAAGA,EAAI05D,EAAOC,cAAc55D,OAAQC,IAE7C,GADe05D,EAAOC,cAAc35D,GAAGmZ,KAAKnS,OAC3BspD,EAAKmJ,cAAe,CACjCnJ,EAAK8D,OAAOttD,IAAK0yD,mBACbE,EAAOC,cAAc35D,GAAIswD,EAAK8D,OAAOttD,EAAI,IAE7C,OAKhButD,EAAsB/D,MAE1BiH,EAASl5C,SAAQ,SAAAiyC,GACb,IAAMxpD,EAAIwpD,EAAK8D,OAAOr0D,OAAS,EAC3Bs5D,GAAQ,EACZ,GAA2B,OAAvB/I,EAAKmJ,cACL,IAAK,IAAIz5D,EAAI,EAAGA,EAAI64C,EAAG8gB,cAAc55D,OAAQC,IACzC,GAAI64C,EAAG8gB,cAAc35D,GAAGmZ,KAAKnS,OAASspD,EAAKmJ,cAAe,CACtDnJ,EAAK8D,OAAOttD,IAAK0yD,mBACb3gB,EAAG8gB,cAAc35D,GAAIswD,EAAK8D,OAAOttD,EAAE,IAEvCuyD,GAAQ,EACR,MASZ,GALKA,IACD/I,EAAK8D,OAAOttD,GAAGgB,GAAK8vD,EACpBtH,EAAK8D,OAAOttD,GAAG+B,GAAKgvD,GAGG,OAAvBvH,EAAKgJ,cAAwB,WACzB72D,EAAC,UAAGk9C,SAAH,iBAAG,EAAgBxmC,YAAnB,iBAAG,EAAsBxF,aAAzB,aAAG,EAA6B2kC,MAAMgY,EAAKh0B,IAC5Cs9B,EAASpC,EAAa7oC,KAAKlsB,aAAlB,EAAkBA,EAAG8S,KAClC,GAAIqkD,EACA,IAAK,IAAI55D,EAAI,EAAGA,EAAI45D,EAAOL,eAAex5D,OAAQC,IAE9C,GADe45D,EAAOL,eAAev5D,GAAGmZ,KAAKnS,OAC5BspD,EAAKgJ,cAAe,CACjChJ,EAAK8D,OAAO,IAAKoF,mBACbI,EAAOL,eAAev5D,GAAIswD,EAAK8D,OAAO,IAE1C,OAKhBC,EAAsB/D,MAxK1B,SAAS0I,EAAyBrqC,GAC9BA,EAAK7mB,GAAK8vD,EACVjpC,EAAK9lB,GAAKgvD,EACNlpC,EAAKxV,KAAKwV,MAAgC,eAAxBA,EAAKxV,KAAKwV,KAAKvV,MACjCygD,EAAoBlrC,EAAKxV,KAAK49B,OAC9BpoB,EAAKgrC,eACLhrC,EAAKgrC,cAAct7C,SAAQ,SAAArQ,GACvBA,EAAElG,GAAK8vD,EACP5pD,EAAEnF,GAAKgvD,KAEXlpC,EAAK4qC,gBACL5qC,EAAK4qC,eAAel7C,SAAQ,SAAArQ,GACxBA,EAAElG,GAAK8vD,EACP5pD,EAAEnF,GAAKgvD,KAKnB,SAASgC,EAAoBC,GACzBA,EAAGthB,QAAQn6B,SAAQ,SAAAwb,GACf,IAAMlmB,EAAQmmD,EAAGnrC,KAAKkL,GACtBlmB,EAAM7L,GAAK8vD,EACXjkD,EAAM9K,GAAKgvD,EACX,IAAMlH,EAAIh9C,EAAMwF,KAAK49B,MACjB4Z,IACAA,EAAEnY,QAAQn6B,SAAQ,SAAAyb,GAEdk/B,EADarI,EAAEhiC,KAAKmL,OAIxB62B,EAAErY,QAAQj6B,SAAQ,SAAAq5C,GACd,IAAMpH,EAAOK,EAAEL,KAAKoH,GACpBpH,EAAKxoD,GAAK8vD,EACVtH,EAAKznD,GAAKgvD,EACVvH,EAAK8D,OAAO/1C,SAAQ,SAAA+6C,GAChBA,EAAMtxD,GAAK8vD,EACXwB,EAAMvwD,GAAKgvD,KAEfxD,EAAsB/D,UAIlCwJ,EAAGxhB,QAAQj6B,SAAQ,SAAAq5C,GACf,IAAMpH,EAAOwJ,EAAGxJ,KAAKoH,GACrBpH,EAAKxoD,GAAK8vD,EACVtH,EAAKznD,GAAKgvD,EACVvH,EAAK8D,OAAO/1C,SAAQ,SAAA+6C,GAChBA,EAAMtxD,GAAK8vD,EACXwB,EAAMvwD,GAAKgvD,KAEfxD,EAAsB/D,SAngBtC,+BA6nBI,SAAkB1/C,GACd,OAAOtP,KAAKmlB,SAAS7V,EAAM,GAAGqV,gBAAgB3kB,KAAKgjB,eAAe4B,WAAWpe,IA9nBrF,+BAioBI,SAAkB6H,GACd,OAAOrO,KAAKmlB,SAAS,EAAG9W,GAAMsW,gBAAgB3kB,KAAKgjB,eAAe4B,WAAWrd,IAloBrF,sBAqoBI,SAASf,GAGL,OAFAA,EAAI6e,WAAW7e,EAAEuC,QAAQ,IACrB/C,KAAKgD,MAAU,IAAJxC,GAAW,MAvoBlC,8BA2oBI,WAGI,IAAM6P,EAAOrW,KAAKygB,kBAAkB,GAEpC,OADczgB,KAAKygB,kBAAkBzgB,KAAKsgB,OAAOvT,OACjCsJ,GAAQrW,KAAKsgB,OAAOvT,QAhpB5C,4BAmpBI,SAAeoH,GACX,GAAuB,OAAnBnU,KAAKqzD,UAAT,CASA,GAL6B,OAAzBrzD,KAAKkzD,kBACLlzD,KAAKkzD,gBAAkB/+C,EACvBnU,KAAKmzD,cAAgBh/C,EA/pBN,KAkqBfA,GAAOnU,KAAKmzD,cAGZ,OAFAnzD,KAAKgjB,eAAiBhjB,KAAKqzD,UAAU,QACrCrzD,KAAKyzD,gBAIT,IAvqBmB1pC,EAuqBbnK,EAAQ5f,KAAKkzD,gBACbrzC,EAAM7f,KAAKmzD,cACjBnzD,KAAKgjB,eAAiBhjB,KAAKqzD,WAzqBRtpC,GAyqBsC5V,EAAMyL,IAAUC,EAAMD,GAzqBvD,EAAI5Z,KAAK2B,IAAI,EAAIoiB,EAAG,QAIpD,sBAwqBI,SAAS5V,GACL,IAAInU,KAAK2iB,YAAT,CAGA,IAAI8L,EAAKta,EAAMnU,KAAKizD,UAKpB,GAJKjzD,KAAKizD,YACNxkC,EAAK,MACTzuB,KAAKizD,UAAY9+C,IAEbnU,KAAK6iB,WAAa,GAAtB,CACA7iB,KAAK6iB,YAAc,EACnB,IAAMhW,EAAM7M,KAAK6M,IAGjBA,EAAI4B,OACJ5B,EAAIyW,aAAa,EAAG,EAAG,EAAG,EAAG,EAAG,GAChCzW,EAAI4U,UAAU,EAAG,EAAG5U,EAAIyT,OAAOvT,MAAOF,EAAIyT,OAAOpT,QACjDL,EAAI6B,UAAY1O,KAAK63C,SAASod,QAC9BpoD,EAAI8B,SAAS,EAAG,EAAG9B,EAAIyT,OAAOvT,MAAOF,EAAIyT,OAAOpT,QAChDL,EAAI+B,UAEJ5O,KAAKy4D,eAAetkD,GAEpBnU,KAAKslB,qBACDtlB,KAAKwiB,gBACLxiB,KAAKwiB,cAAoC,IAApBxiB,KAAK6iB,YAE9B7iB,KAAK63C,SAAS/kC,KAAK2b,GACnBzuB,KAAK6iB,YAAc,EAEQ,OAAvB7iB,KAAKmzD,eAA0Bh/C,EAAMnU,KAAKmzD,eAC1CnzD,KAAKo1C,iBAvsBjB,wBA0sBI,WAAa,WACTp1C,KAAKqiB,QAAUpW,OAAO4V,uBAAsB,SAAC1N,GAAD,OAAS,EAAKukD,SAASvkD,SA3sB3E,sBAGI,WACI,OAAO+N,QAJf,K,2DENMy2C,E,WAEF,WAAY9gB,GAAU,2BAClB73C,KAAK63C,SAAWA,EAChB73C,KAAKq6B,KAAOr6B,KAAK63C,SAASxd,KAC1Br6B,KAAK0uD,OAA2B,oBAAXA,QAA0BA,OAG/C1uD,KAAK8vD,iBAAmB,GACxB3tD,OAAOsE,KAAKzG,KAAKq6B,KAAKrJ,WAAWiqB,SAASl+B,SAAQ,SAACgpB,QACH1lC,IAAxC,EAAKg6B,KAAKrJ,WAAW4nC,gBACrBz2D,OAAOsE,KAAK,EAAK4zB,KAAKrJ,WAAW4nC,gBAAgBttD,SAASy6B,IACJ,WAAtD,EAAK1L,KAAKrJ,WAAW4nC,eAAe7yB,GAAG,GAAvC,KACA,EAAK+pB,iBAAiB/pB,GAAK,EAAK1L,KAAKrJ,WAAW4nC,eAC5C7yB,GACF,GAEF,EAAK+pB,iBAAiB/pB,QAAK1lC,KAEnCL,KAAK64D,kBAAoB,GAEzB74D,KAAK84D,8B,mDAGT,SAAqBre,EAAQh7C,GACrBg7C,KAAUz6C,KAAK8vD,mBACf9vD,KAAK8vD,iBAAiBrV,GAAUh7C,K,qCAGxC,SACIs5D,EACApJ,GAGF,IAFEqJ,EAEF,wDADE31B,EACF,4DADahjC,EAEPmrB,OAASnrB,EACb,IACI,IAAM44D,GAAkB/7C,QAAM67C,GAC9B,GAAIC,EACAh5D,KAAKk5D,gCAAgCD,EAAiBtJ,GACtD3vD,KAAKm5D,qBAAqBxJ,EAAStsB,QAEnC,IACI,IAAM+1B,EACFH,EAAgBI,SAAS1J,GAIzBnkC,OAHcnrB,IAAd+4D,IACC1wD,MAAM0wD,IACPvxD,OAAOyxD,WAAWF,IACRA,OAED/4D,EACf,MAAOc,GACLqqB,OAASnrB,EAGjB,OAAOmrB,EACT,MAAO+tC,GACLvuD,QAAQtL,MAAM65D,GArBlB,QAuBI,OAAO/tC,K,kCAIf,SAAqBmkC,GAA+B,WAAtBtsB,EAAsB,4DAAXhjC,EACrC,GAAIL,KAAK64D,kBAAkBp6D,OAAS,EAAG,CACnC,IAAMg8C,EAASz6C,KAAK64D,kBAAkBW,MAChClK,EAAOtvD,KACbA,KAAKy5D,eAAeC,MAChBjf,EACAkV,GACA,WACQ,EAAKjB,QACLA,OAAO3oC,YAAY,CACfjO,KAAM,yBACN2iC,OAAQA,EACRkf,WAAYhK,EAAQlV,UAEXp6C,IAAbgjC,GACAA,IACJisB,EAAK6J,qBAAqBxJ,EAAStsB,S,6CAMnD,SAAgC41B,EAAiBtJ,GAAS,WACtDsJ,EAAgBl8C,SAAQ,SAACsQ,EAAM3U,EAAMvD,GACjC,OAAQkY,EAAKvV,MACT,IAAK,aACGuV,EAAK3nB,QAAQiqD,QACUtvD,IAAvBsvD,EAAQtiC,EAAK3nB,QACZ,EAAKmzD,kBAAkBvtD,SAAS+hB,EAAK3nB,OAGtC,EAAKmzD,kBAAkBr3D,KAAK6rB,EAAK3nB,MAErC,MACJ,IAAK,eACL,IAAK,kBACD,EAAKwzD,gCAAgC7rC,EAAMsiC,S,yCAS3D,WACI,IAAIiK,GAAsBhtD,QAAc,MAAO,GAC3C,CAAC,yBAA0BD,SAASmD,MACxC8pD,EAAoBF,MAAQ,WACxB15D,KAAK4P,MAAMC,QAAU,SAEzB+pD,EAAoBC,MAAQ,WACxB75D,KAAK4P,MAAMC,QAAU,QAGzB,IAAI4pD,GAAiB7sD,QAAc,MAAO,wBACtC,CAAC,cAAegtD,GACpBH,EAAe14C,iBAAiB,SAAS,SAAC0H,GACtCA,EAAG8B,qBAEPkvC,EAAe7pD,MAAMC,QAAU,OAC/B7P,KAAKy5D,eAAiBA,EAEtB,IAAIK,GAAaltD,QAAc,MAAO,GAAI,CAAC,wBACvC5M,KAAKy5D,gBACTz5D,KAAKy5D,eAAe7Y,QAASh0C,QAAc,OAAQ,GAC/C,CAAC,oBAAqBktD,GAC1B,IAAIC,GAAentD,QAAc,MAAO,GAAI,CAAC,eACzCktD,GACJC,EAAatmC,WAAYumC,OAAzB,yDACAD,EAAah5C,iBAAiB,SAAS,WACnC04C,EAAeI,WAGnB,IAAII,GAAcrtD,QAAc,MAAO,GAAI,CAAC,0BACxC5M,KAAKy5D,gBAMT,SAASS,IACL,GAAIT,EAAeU,MAAQV,EAAeW,QAAS,CAC/C,IAAI5kD,EAAMikD,EAAeY,OAAO56D,MAChC,GAAI+V,IAAQ9M,MAAM8M,IAAQ3N,OAAOyxD,WAAW9jD,IAAQA,EAAM,EAKtD,OAJAikD,EAAeU,KAAKV,EAAeW,SAAW5kD,EAC9CikD,EAAeI,aACXJ,EAAehzB,WACfgzB,EAAehzB,aAI3BgzB,EAAeY,OAAOC,kBAAkB,2BAhB5Ct6D,KAAKy5D,eAAec,UAAW3tD,QAAc,MAAO,GAChD,CAAC,sBAAuBqtD,GAC5Bj6D,KAAKy5D,eAAeY,QAASztD,QAAc,QAAS,eAChD,CAAC,yBAA0B5M,KAAKy5D,eAAec,UAenDv6D,KAAKy5D,eAAeY,OAAOt5C,iBAAiB,YAAY,SAAC0H,GACpC,KAAbA,EAAG+xC,OACHN,OAGR,IAAIO,GAAa7tD,QAAc,MAAO,GAAI,CAAC,yBACvC5M,KAAKy5D,gBACLiB,GAAiB9tD,QAAc,MAAO,GACtC,CAAC,SAAU,6BAA8B6tD,GAC7CC,EAAe35C,iBAAiB,SAAS,SAAC0H,GAASyxC,QACzBttD,QAAc,OAAQ,GAAI,GAAI8tD,GACpCvrC,UAAY,WAChCviB,QAAc,MAAO,GAAI,CAAC,YAAa6tD,GAEvCz6D,KAAKy5D,eAAeC,MAAQ,SAAUjf,EAAQnzC,EAAK+7B,GAC/CrjC,KAAK4P,MAAMC,QAAU,QACrB4pD,EAAe7Y,OAAOzxB,UAAY,iBAAmBsrB,EACrDgf,EAAeW,QAAU3f,EACzBgf,EAAeU,KAAO7yD,EACtBmyD,EAAehzB,UAAYpD,EAC3Bu2B,EAAoBF,SAExB15D,KAAKy5D,eAAeI,MAAQ,WACxB75D,KAAK4P,MAAMC,QAAU,OACrB4pD,EAAe7Y,OAAOzxB,UAAY,GAClCsqC,EAAeY,OAAO56D,MAAQ,GAC9Bg6D,EAAeY,OAAOC,kBAAkB,IACxCV,EAAoBC,SAExBD,EAAoB74C,iBAAiB,SAAS,SAAC0H,GAC3CgxC,EAAeI,e,KAMdc,EAAb,WAEI,WAAY9iB,IAAU,eAClB73C,KAAK63C,SAAWA,EAEhB73C,KAAK+vD,qBAAuB,SAE5B/vD,KAAK46D,SAAW,GAEhB56D,KAAKyuD,gBAAkB,IAAIkK,EAAe34D,KAAK63C,UATvD,+CAYI,SAAiB//B,GACb,OAAQA,GACJ,KAAK82C,IACL,KAAKiD,IACL,KAAKb,IACDhxD,KAAK46D,SAASp5D,KACV,IAAIsW,EAAK9X,KAAMA,KAAK63C,WAExB,MACJ,QAEI73C,KAAK46D,SAASp5D,KAAKsW,GAG3B9X,KAAK63C,SAASzC,eA1BtB,gCA6BI,SAAmBt9B,GACf9X,KAAK46D,SAAW56D,KAAK46D,SAASvyD,QAAO,SAAAwyD,GACjC,QAASA,aAAmB/iD,MAGhC9X,KAAK63C,SAASzC,eAlCtB,+BAqCI,SAAkBt9B,GACd,OAAO9X,KAAK46D,SAASvyD,QAAO,SAAAwyD,GACxB,OAAOA,aAAmB/iD,KAC3BrZ,OAAS,IAxCpB,yBA2CI,SAAYqZ,GACR,IAAI+iD,OAAUx6D,EAOd,OANAL,KAAK46D,SAAS79C,SAAQ,SAAA+9C,GACdA,aAAchjD,IACd+iD,EAAUC,MAIXD,IAnDf,kCAsDI,SAAqBpgB,EAAQh7C,GACzBO,KAAKyuD,gBAAgBsM,qBAAqBtgB,EAAQh7C,GAClDO,KAAK46D,SAAS79C,SAAQ,SAAA89C,GAClBA,EAAQ5P,eAzDpB,yCA6DI,SAA4BrB,GACxB5pD,KAAK+vD,qBAAuBnG,EAC5B5pD,KAAK46D,SAAS79C,SAAQ,SAAA89C,GAClBA,EAAQ5P,eAhEpB,kBAoEI,WACIjrD,KAAK46D,SAAS79C,SAAQ,SAAA89C,GAClBA,EAAQ/nD,YAtEpB,qBA0EI,WACI9S,KAAK46D,SAAS79C,SAAQ,SAAA89C,GAClBA,EAAQ5P,eA5EpB,4BAgFI,SAAenzC,EAAM2Q,EAAIjX,EAAU6jC,EAAUoD,EAAiBV,GAC1D/3C,KAAK46D,SAAS79C,SAAQ,SAAA89C,GAClBA,EAAQG,eAAeljD,EAAM2Q,EAAIjX,EAAU6jC,EACvCoD,EAAiBV,UAnFjC,K,8gCCxKA,SAASkjB,EAAyBnjD,EAAM2gC,EAAiByiB,EAAK1pD,GAC1D,OAAQsG,GACJ,IAAK,YACD,OAAQ2gC,aAA2BgX,MACP,OAApBhX,EACZ,IAAK,OACD,OAAQA,aAA2BS,UAC3BT,aAA2BQ,MACvC,IAAK,cACD,OAAQR,aAA2BQ,OAASiiB,EAChD,QACI,OAAOziB,aAA2BQ,OAIvC,IAAM5B,EAAb,WACI,WAAYhd,EAAM0S,GACsD,IAD3CiuB,EAC2C,uDAD1B,KAAMh4C,EACoB,uDADH,KACzDm4C,EAA4D,wDAAxCC,EAAwC,uDAA3B,KAAMC,EAAqB,uDAAN,MAAM,eAEpEr7D,KAAKq6B,KAAOA,EACZr6B,KAAK01C,UAAY,GACjB11C,KAAK21D,kBAAoB,GAGzB31D,KAAK+sC,UAAYA,EACjB/sC,KAAK6M,IAAM,KACX7M,KAAKsgB,OAAS,KACdtgB,KAAKs7D,sBAAwB,KAC7Bt7D,KAAKu7D,sBAAwB,KAC7Bv7D,KAAKw7D,sBAAwB,KAC7Bx7D,KAAKy7D,qBAAuB,KAC5Bz7D,KAAKiuD,QAAU,KACfjuD,KAAK0xD,kBAAoB,KAGzB1xD,KAAK07D,KAAO,KACZ17D,KAAK27D,QAAU,KACf37D,KAAK47D,YAAc,KACnB57D,KAAK67D,aAAe,KACpB77D,KAAK87D,eAAiB,KACtB97D,KAAK+7D,aAAe,KACpB/7D,KAAKg8D,SAAW,KAChBh8D,KAAKi8D,aAAe,KACpBj8D,KAAKk8D,aAAe,KACpBl8D,KAAKm8D,uBAAyB,UAC9Bn8D,KAAKo8D,kBAAoB,KACzBp8D,KAAKq8D,qBAAuB,KAG5Br8D,KAAKs8D,sBAAwB,GAG7Bt8D,KAAKu8D,kBAAmB,EACxBv8D,KAAKw8D,mBAAoB,EAGzBx8D,KAAKy8D,WAAa,MAClBz8D,KAAK08D,gBAAkB,KACvB18D,KAAKwR,SAAW,KAChBxR,KAAK28D,aAAe,KACpB38D,KAAK48D,UAAW,EAChB58D,KAAK41D,WAAa,KAClB51D,KAAK68D,kBAAoB,KACzB78D,KAAK88D,uBAAyB9B,EAC9Bh7D,KAAK+8D,oBAAqB,EAC1B/8D,KAAKg9D,oBAAqB,EAC1Bh9D,KAAKi9D,SAAW,KAChBj9D,KAAKk9D,aAAe,KACpBl9D,KAAKm9D,eAAiB,KAGtBn9D,KAAK83C,kBAAoB,GAGzB,IACI93C,KAAKwuD,gBAAkB,IAAImM,EAAe36D,MAC5C,MAAOo9D,GACLp9D,KAAKwuD,gBAAkB,KAG3BxuD,KAAKq9D,WAAY,EACjB,IACI3O,OACIA,SACA1uD,KAAKq9D,WAAY,GACvB,MAAOD,IAGTp9D,KAAKm7D,WAAaA,EAElBn7D,KAAKs9D,cAAct6C,EAAgBo4C,EAAYC,GAE/Cr7D,KAAKq5C,WAELr5C,KAAKs8D,uBAAwBiB,QAAqBv9D,KAAKq6B,MAEvDr6B,KAAKw9D,4BAjFb,sCAoFI,WACI,IACQx9D,KAAK07D,MACL17D,KAAK07D,KAAK12C,UACdhlB,KAAK8wD,eAAe9rC,UACpBhlB,KAAK+sC,UAAU98B,YAAYjQ,KAAKsgB,QAChCtgB,KAAK+sC,UAAU98B,YAAYjQ,KAAK27D,SAChC37D,KAAK+sC,UAAU98B,YAAYjQ,KAAK0xD,mBAClC,MAAO0L,OA5FjB,2BAiGI,WACI,MAAO,CAAEb,iBAAkBv8D,KAAKu8D,oBAlGxC,mCAsGI,WAEIv8D,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,UAC3Bz9D,KAAK09D,qBAAqB9tD,MAAMC,QAAU,OAC1C7P,KAAK29D,sBAAsBlqC,UAAY,GAEvCzzB,KAAK47D,YAAYhsD,MAAQ,yCACzB5P,KAAK67D,aAAajsD,MAAQ,yCAC1B5P,KAAK87D,eAAelsD,MAAQ,yCAE5B5P,KAAKq8D,qBAAqB5oC,UAAY,KAVlB,UAYAzzB,KAAK+7D,cAZL,IAYpB,2BAAuC,KAA9B6B,EAA8B,QAC/BA,EAAQtzC,aAAa,SAAWtqB,KAAKg8D,UACrC4B,EAAQhuD,MAAQ,kCACZ5P,KAAKm8D,uBACTn8D,KAAKq8D,qBAAqB5oC,UACtBzzB,KAAKo8D,kBAAkBp8D,KAAKg8D,WAEhC4B,EAAQhuD,MAAQ,sBAnBJ,8BAuBpB,OAAQ5P,KAAKy8D,YACT,IAAK,OACDz8D,KAAK67D,aAAajsD,MAAQ,uDAEL5P,KAAKm8D,uBAC1Bn8D,KAAK09D,qBAAqB9tD,MAAMC,QAAU,QAC1C7P,KAAK29D,sBAAsBlqC,UACvB,wDAEJ,MACJ,IAAK,SACDzzB,KAAK87D,eAAelsD,MAAQ,uDAEP5P,KAAKm8D,uBAC1Bn8D,KAAK09D,qBAAqB9tD,MAAMC,QAAU,QAC1C7P,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,YACvBz9D,KAAK+8D,mBACL/8D,KAAK29D,sBAAsBlqC,UACvB,yBAEJzzB,KAAK29D,sBAAsBlqC,UACvB,mFAIR,MACJ,IAAK,MACDzzB,KAAK09D,qBAAqB9tD,MAAMC,QAAU,QACpB,SAAlB7P,KAAKg8D,SACDh8D,KAAKm9D,eACLn9D,KAAK29D,sBAAsBlqC,UACvB,+FAIJzzB,KAAK29D,sBAAsBlqC,UACvB,gGAIRzzB,KAAK29D,sBAAsBlqC,UACvB,mIAKR,MACJ,IAAK,MACL,QACIzzB,KAAK47D,YAAYhsD,MAAQ,uDAEJ5P,KAAKm8D,0BAhL1C,2BAsLI,SAAcn5C,EAAgBo4C,EAAYC,GAAc,IA4ChD3rD,EA5CgD,OAEpD1P,KAAKsgB,OAAS3T,SAASC,cAAc,UACrC5M,KAAKsgB,OAAO0P,UAAUzjB,IAAI,eAEtBvM,KAAKsgB,OAAO1Q,MAAM4yC,gBADlB4Y,GAGoC,UACxCp7D,KAAK+sC,UAAUb,OAAOlsC,KAAKsgB,QAEvBtgB,KAAKm7D,aACLn7D,KAAK69D,aAAelxD,SAASC,cAAc,OAC3C5M,KAAK69D,aAAajuD,MAAM+L,SAAW,WACnC3b,KAAK69D,aAAajuD,MAAM4G,OAAS,QACjCxW,KAAK69D,aAAajuD,MAAM0G,MAAQ,QAChCtW,KAAK69D,aAAajuD,MAAM4yC,gBAAkB,QAC1CxiD,KAAK69D,aAAajuD,MAAM8N,QAAU,QAClC1d,KAAK89D,iBAAmBnxD,SAASC,cAAc,QAC/C5M,KAAK89D,iBAAiBluD,MAAMuD,MAAQ,QACpCnT,KAAK89D,iBAAiBluD,MAAMiuC,SAAW,OACvC79C,KAAK89D,iBAAiB3uC,UAAY,kBAClCnvB,KAAK69D,aAAa9tD,YAAY/P,KAAK89D,kBACnC99D,KAAK+sC,UAAUh9B,YAAY/P,KAAK69D,eAKpC79D,KAAK09D,qBAAuB/wD,SAASC,cAAc,OACnD5M,KAAK09D,qBAAqB9tD,MAAM+L,SAAW,WAC3C3b,KAAK09D,qBAAqB9tD,MAAM4G,OAAS,QACzCxW,KAAK09D,qBAAqB9tD,MAAMyG,KAAO,QACvCrW,KAAK09D,qBAAqB9tD,MAAM4yC,gBAAkB,qBAClDxiD,KAAK09D,qBAAqB9tD,MAAMmuD,aAAe,MAC/C/9D,KAAK09D,qBAAqB9tD,MAAM8N,QAAU,QAC1C1d,KAAK09D,qBAAqB9tD,MAAMC,QAAU,OAC1C7P,KAAK29D,sBAAwBhxD,SAASC,cAAc,QACpD5M,KAAK29D,sBAAsB/tD,MAAMuD,MAAQ,UACzCnT,KAAK29D,sBAAsBlqC,UAAY,GACvCzzB,KAAK09D,qBAAqB3tD,YAAY/P,KAAK29D,uBAC3C39D,KAAK+sC,UAAUh9B,YAAY/P,KAAK09D,sBAGhC19D,KAAK27D,QAAUhvD,SAASC,cAAc,OACtC5M,KAAK27D,QAAQ/rD,MAAQ,2CAIrB,IACIipC,KACAnpC,EAAI/C,SAASC,cAAc,WACzB+G,UAAY,SACdjE,EAAE+jB,UAAY,qCACd/jB,EAAEE,MAAQ,yCACV,IAAI0/C,EAAOtvD,KACX0P,EAAEsqB,QAAU,WAAY,WACpB,GAAIs1B,EAAKoM,MAAQpM,EAAKoM,KAAKsC,UACvB1O,EAAKoM,KAAK12C,cADd,CAIA,IAAIrS,EAAO3S,KAAK6b,wBACZ+8B,EAAQ,IAAIC,IAChBD,EAAME,UAAU,oBAAoB,SAAAtyC,GAAC,OAAI8oD,EAAK2O,iBAC1C3O,EAAK4O,YACLtlB,EAAME,UAAU,oBAAoB,SAAAtyC,GAAC,OAAI8oD,EAAK6O,iBAC9CvlB,EAAME,UAAU,mBAAmB,SAAAtyC,GAAC,OAAI8oD,EAAK6O,aAAY,OAE7DvlB,EAAMwlB,mBAAmB,mBAAoB9O,EAAKiN,kBAAkB,SAAC/1D,EAAG0zB,GAAco1B,EAAKiN,iBAAmBriC,KAC9G0e,EAAMwlB,mBAAmB,0BAA2B9O,EAAKziD,IAAI2jD,KAAK,SAAChqD,EAAG0zB,GAAco1B,EAAKziD,IAAI2jD,IAAMt2B,KAC9Fl6B,KAAKq9D,WACNzkB,EAAME,UACF,YACA,WACI,GAAIwW,EAAK+O,eAAiB/O,EAAK+O,cAAcL,UACzC1O,EAAK+O,cAAcr5C,cADvB,CAIA,IAAIrS,EAAOimC,EAAM0lB,YAAYziD,wBACzB0iD,EAAiB,IAAI1lB,IACzB0lB,EAAeH,mBACX,yBACA9O,EAAKd,gBAAgBgQ,kBACjB5P,MAEJ,SAACpoD,EAAG0zB,GACIA,EACAo1B,EAAKd,gBAAgBiQ,iBACjB7P,KAGJU,EAAKd,gBAAgBkQ,mBACjB9P,KAERU,EAAKla,aACD,EAAKioB,WACLsB,2BAGZrP,EAAK+O,cAAgBE,EACrBjP,EAAK+O,cAAchiC,KAAK1pB,EAAK0D,KAAM1D,EAAK4D,SAGpDqiC,EAAMwlB,mBAAmB,oBAAqB9O,EAAKkN,mBAAmB,SAACp7B,EAAGlH,GACtEo1B,EAAKkN,kBAAoBtiC,EACzBo1B,EAAKjW,WACLiW,EAAKla,gBAETwD,EAAME,UAAU,mBAAmB,kBAAMwW,EAAKsP,qBAC9CtP,EAAKoM,KAAO9iB,EACZ0W,EAAKoM,KAAKr/B,KAAK1pB,EAAK0D,KAAM1D,EAAK6D,UAEnC9G,EAAE/D,MAAQ,OACV3L,KAAK27D,QAAQ5rD,YAAYL,GAC3B,MAAO0tD,IA6BT,IA1BA1tD,EAAI/C,SAASC,cAAc,WACzB+G,UAAY,SACdjE,EAAE+jB,UAAY,oDACd/jB,EAAEE,MAAQ,yCACVF,EAAEsqB,QAAU,kBAAM,EAAKk7B,gBACvBxlD,EAAE/D,MAAQ,mBACV3L,KAAK27D,QAAQ5rD,YAAYL,IAGzBA,EAAI/C,SAASC,cAAc,WACzB+G,UAAY,SACdjE,EAAE+jB,UAAY,4CACd/jB,EAAEE,MAAQ,yCACVF,EAAEsqB,QAAU,kBAAM,EAAK6kC,gBACvBnvD,EAAE/D,MAAQ,wBACV3L,KAAK27D,QAAQ5rD,YAAYL,IAGzBA,EAAI/C,SAASC,cAAc,WACzB+G,UAAY,SACdjE,EAAE+jB,UAAY,4CACd/jB,EAAEE,MAAQ,yCACVF,EAAEsqB,QAAU,kBAAM,EAAK2hB,cACvBjsC,EAAE/D,MAAQ,sBACV3L,KAAK27D,QAAQ5rD,YAAYL,GAErB2rD,EAAc,CAGdr7D,KAAK47D,YAAcP,EAAayD,IAChC9+D,KAAK67D,aAAeR,EAAa0D,KACjC/+D,KAAK87D,eAAiBT,EAAa2D,OACnCh/D,KAAK+7D,aAAeV,EAAa4D,SANnB,UAOMj/D,KAAK+7D,cAPX,yBAOL6B,EAPK,QAQ2B,gBAAjCA,EAAQtzC,aAAa,QACrBszC,EAAQ5jC,QAAU,WACd,EAAKklC,iCAAgC,WACjC,EAAKzC,WAAa,MAClB,EAAKT,SAAW,cAChB,EAAKmB,eAAiB,KACtB,EAAKgC,4BAIbvB,EAAQ5jC,QAAU,WACTolC,kBAGD,EAAK3C,WAAa,MAClB,EAAKT,SAAW4B,EAAQtzC,aAAa,QACrC,EAAK2xC,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKgC,yBANL,EAAKE,0BAbrB,2BAAuC,IAPzB,8BA+Bdr/D,KAAKm8D,uBAAyB,cAC3B,CAEHn8D,KAAK+7D,aAAe,GAGpB,IAAIuD,EAAe3yD,SAASC,cAAc,UAC1C0yD,EAAa3rD,UAAY,SACzB2rD,EAAa7rC,UAAY,yCACzB6rC,EAAa1vD,MAAQ,uDAAyD5P,KAAKm8D,uBACnFmD,EAAa3zD,MAAQ,WACrB3L,KAAK47D,YAAc0D,EACnBt/D,KAAK27D,QAAQ5rD,YAAYuvD,GAGzB,IAAIC,EAAgB5yD,SAASC,cAAc,UAC3C2yD,EAAc5rD,UAAY,SAC1B4rD,EAAc9rC,UAAY,0CAC1B8rC,EAAc3vD,MAAQ,yCACtB2vD,EAAc5zD,MAAQ,qBACtB3L,KAAK67D,aAAe0D,EACpBv/D,KAAK27D,QAAQ5rD,YAAYwvD,GAGzB,IAAIC,EAAiB7yD,SAASC,cAAc,UAC5C4yD,EAAe7rD,UAAY,SAC3B6rD,EAAe/rC,UAAY,6CAC3B+rC,EAAe5vD,MAAQ,yCACvB4vD,EAAe7zD,MAAQ,cACvB3L,KAAK87D,eAAiB0D,EACtBx/D,KAAK27D,QAAQ5rD,YAAYyvD,GA+C7B,GA3CAx/D,KAAK47D,YAAY5hC,QAAU,WACvB,EAAKyiC,WAAa,MAClB,EAAKT,SAAW,KAChB,EAAKC,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKgC,yBAITn/D,KAAK67D,aAAa7hC,QAAU,SAACoH,EAAGq+B,GAGxB,EAAKzC,qBAAsC,IAAhByC,EAC3B,EAAKhD,WAAa,MAElB,EAAKA,WAAa,OACtB,EAAKT,SAAW,KAChB,EAAKC,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKH,mBAAqByC,EAC1B,EAAKN,yBAITn/D,KAAK87D,eAAe9hC,QAAU,SAACoH,EAAGs+B,GAG1B,EAAK3C,qBAAqC,IAAf2C,EAC3B,EAAKjD,WAAa,MAElB,EAAKA,WAAa,SACtB,EAAKT,SAAW,KAChB,EAAKC,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKJ,mBAAqB2C,EAC1B,EAAKP,yBAITxyD,SAASoU,iBAAiB,WAAW,SAAC5f,GAAD,OAAO,EAAKw+D,aAAax+D,MAC9DwL,SAASoU,iBAAiB,SAAS,SAAC5f,GAAD,OAAO,EAAKw+D,aAAax+D,MAGxDnB,KAAKq9D,UAAW,CAChB,IAAIuC,EAAmBjzD,SAASC,cAAc,UAC9CgzD,EAAiB5kC,GAAK,sBACtB4kC,EAAiBjsD,UAAY,gBAC7BisD,EAAiBnsC,UAAY,sCAC7BmsC,EAAiBhwD,MAAQ,yCACzBgwD,EAAiB5lC,QAAU,WACvB4lC,EAAiBjsD,UAAY,gBAC7B1H,OAAO4zD,uBAAwB,EAC3BnR,SACAA,OAAO3oC,YAAY,CACfjO,KAAM,wBACNgoD,mBAAmB,IAEvBpR,OAAO3oC,YAAY,CACfjO,KAAM,iCACNioD,cAAc,MAI1BH,EAAiBj0D,MAAQ,eACzB3L,KAAK27D,QAAQ5rD,YAAY6vD,GAG7B5/D,KAAK+sC,UAAUb,OAAOlsC,KAAK27D,SAI3B37D,KAAK0xD,kBAAoB/kD,SAASC,cAAc,OAChD5M,KAAK0xD,kBAAkBj+B,UAAY,GACnCzzB,KAAK0xD,kBAAkB/9C,UAAY,cACnC3T,KAAK0xD,kBAAkBsO,YAAc,kBAAM,EAAKtO,kBAAkB9hD,MAAMC,QAAU,QAClF7P,KAAK+sC,UAAUh9B,YAAY/P,KAAK0xD,mBAGhC1xD,KAAKigE,wBAA0BtzD,SAASC,cAAc,OACtD5M,KAAKigE,wBAAwBxsC,UAAY,GACzCzzB,KAAKigE,wBAAwBtsD,UAAY,gBACzC3T,KAAKkgE,mBAAqBvzD,SAASC,cAAc,OACjD,IAAIuzD,EAAwBxzD,SAASC,cAAc,UAC/C0iD,EAAOtvD,KACXmgE,EAAsBnmC,QAAU,WAC5Bs1B,EAAKj1B,KAAK36B,WAAQW,EAClBivD,EAAK4Q,mBAAmB/wC,UAAY,GACpCmgC,EAAK2Q,wBAAwBrwD,MAAMC,QAAU,QAEjDswD,EAAsBvwD,MAAtB,MAAoC,QACpCuwD,EAAsBvwD,MAAM6tD,OAAS,UACrC0C,EAAsBvwD,MAAMuD,MAAQ,QACpCgtD,EAAsB1sC,UAAY,sCAClCzzB,KAAKigE,wBAAwBlwD,YAAYowD,GACzCngE,KAAKigE,wBAAwBlwD,YAAY/P,KAAKkgE,oBAC9ClgE,KAAK+sC,UAAUh9B,YAAY/P,KAAKigE,yBAEhCjgE,KAAK6M,IAAM7M,KAAKsgB,OAAOxT,WAAW,MAGlC9M,KAAK8wD,eAAiB,IAAIkC,EAAchzD,KAAK6M,IAAK7M,KAAMA,KAAKsgB,QACtC,OAAnB0C,IACAhjB,KAAK8wD,eAAe9tC,eAAiBA,GAG1B,IAAIo9C,kBAAiB,SAACC,GAAgB,EAAKC,WAAY,EAAKlrB,gBAClE4T,QAAQhpD,KAAK+sC,UAAW,CAAE/b,YAAY,IAI3ChxB,KAAKi1D,QADLmG,GAGenvD,OAAOo6B,iBAAiBrmC,KAAKsgB,QAAQkiC,gBAGxDxiD,KAAKq5C,WAGLr5C,KAAKugE,qBAGkB,OAAnBv9C,GACAhjB,KAAKk1D,eAET,IAkFI3d,EAAK5qC,SAASC,cAAc,OAChC2qC,EAAG3nC,MAAQ,oFAEX5P,KAAK+sC,UAAUh9B,YAAYwnC,GAE3Bv3C,KAAKq8D,qBAAuB9kB,EAC5Bv3C,KAAKo8D,kBAxFM,CACXoE,IAAA,6YAOAA,QAAA,qaAOAA,QAAA,2nBAWAA,WAAA,qmCAoBAA,YAAA,wnBAUAA,WAAA,mOAIAA,OAAA,4PAIAA,UAAA,0PAIAA,UAAA,mOAIAA,KAAA,8fAkBAxgE,KAAKm/D,wBAGLn/D,KAAKo1C,eA7lBb,wBAgmBI,WACIp1C,KAAK8wD,eAAe1b,eAjmB5B,qCAumBI,cAvmBJ,+BAymBI,cAzmBJ,gCA2mBI,cA3mBJ,gCA6mBI,cA7mBJ,mCA+mBI,cA/mBJ,6CAinBI,cAjnBJ,sBAsnBI,SAASja,GAOL,GANAn7B,KAAKq6B,KAAOc,EAEZn7B,KAAKq5C,WACLr5C,KAAKo1C,aAGgC,GAAjCp1C,KAAK83C,kBAAkBr5C,OAAa,CACpC,IAAIgiE,GAAOC,QAAuB1gE,KAAK83C,kBAAkB,KACzD6oB,QAAUC,QAA2B5gE,KAAKy1C,MAAOgrB,GAAM7yC,YA/nBnE,gCAooBI,WAQI,IARiB,WACbtN,EAAStgB,KAAKsgB,OACdugD,EAAK,kBAAMvgD,EAAOzE,yBAElBilD,EAAS,SAAAhlD,GAAK,OAAI,EAAKg1C,eAAerwC,kBAAkB3E,EAAMI,QAAU2kD,IAAKxqD,OAC7E0qD,EAAS,SAAAjlD,GAAK,OAAI,EAAKg1C,eAAepwC,kBAAkB5E,EAAMK,QAAU0kD,IAAKtqD,MALhE,aAQZ,IAAIohC,EAAM,KAEXr3B,EAAOS,iBAAiB42B,GAAQ,SAAAnxC,GACZ,EAAKw0D,eAAex0D,EAAGs6D,EAAQC,EAAQppB,IAGlD,EAAK0lB,YACN72D,EAAE+jB,kBACF/jB,EAAEgkB,sBARd,MAAmB,CAAC,YAAa,YAAa,UAAW,aAAc,YAAa,WAChF,QAAS,QAAS,WAAY,eADlC,eACkD,MA7oB1D,sBA0pBI,WAEIxqB,KAAKsgB,OAAO1Q,MAAM7C,MAAQ,MAC1B/M,KAAKsgB,OAAO1Q,MAAM1C,OAAS,MAC3BlN,KAAKsgB,OAAOvT,MAAQ/M,KAAKsgB,OAAO0gD,YAChChhE,KAAKsgB,OAAOpT,OAASlN,KAAKsgB,OAAO2gD,eA/pBzC,uCAmqBI,WACIjhE,KAAKkhE,iBAAmB,GADA,UAEPlhE,KAAKs8D,uBAFE,IAExB,2BAA6C,OAApC6E,EAAoC,QACrCp7B,EAAI,IAAIq7B,IAD6B,IAExBD,GAFwB,IAEzC,2BAAuB,KAAdnS,EAAc,QACnBjpB,EAAEx5B,IAAIyiD,EAAKh+B,WAAWnZ,KAAKm3C,OAHU,8BAKzChvD,KAAKkhE,iBAAiB1/D,KAAKukC,IAPP,iCAnqBhC,sBA+qBI,WACI/lC,KAAK01C,UAAY,GACjB11C,KAAKy1C,MAAQ4rB,EAAcrhE,KAAK6M,IAAK7M,KAAKq6B,KAAMr6B,KAAK01C,UACjD11C,KAAK21D,kBAAmB31D,KAAKw8D,mBACjCx8D,KAAKsgE,WAELtgE,KAAKw9D,4BAGLx9D,KAAKshE,2BAGwB,OAAzBthE,KAAKwuD,iBACLxuD,KAAKwuD,gBAAgBvD,UAGzB,IACQyD,QACA6S,QAAQvhE,KAAMA,KAAKy1C,OACzB,MAAO2nB,IAET,OAAOp9D,KAAKy1C,QApsBpB,sCAusBI,WAA2B,YACvB+rB,QAAqBxhE,KAAKy1C,OAAO,SAACpoB,EAAMooB,GAAU,MAC1CmiB,EAAW,EACXC,EAAW,EAkBXxqC,aAAgBo0C,MAhBpB,SAASC,EAAmBl8D,GACxB,GAAIA,EAAEqS,KAAKwV,KAAK8rB,YAAa,CACzB,IAAIwoB,EAAmBlsB,EAAMpoB,KAAK7nB,EAAEqS,KAAKwV,KAAK8rB,aAC1CjqB,GAAKsoC,QAAqBmK,GAC1BzyC,GAAMrnB,OAAO+5D,SAAS1yC,EAAG0oC,WACzB/vD,OAAO+5D,SAAS1yC,EAAG2oC,YACnBD,GAAY1oC,EAAG0oC,SACfC,GAAY3oC,EAAG2oC,UAEf8J,GACAD,EAAmBC,IAO3BD,CAAmBr0C,GAEvB,IAAIipC,EAAKsB,EACLrB,EAAKsB,EAELl8C,GAAW67C,QAAqBnqC,GA6CpC,OA5CI1R,IACA26C,GAAM36C,EAAS26C,GACfC,GAAM56C,EAAS46C,KAGfD,GAAMC,IAEN,EAAKzF,eAAe+Q,kBAChBx0C,EAAM,CAAE7mB,EAAG6mB,EAAK7mB,EAAGe,EAAG8lB,EAAK9lB,GAC3B,CAAEf,EAAG6mB,EAAK7mB,EAAI8vD,EAAI/uD,EAAG8lB,EAAK9lB,EAAIgvD,GAAM,EAAK9gB,MACzC,EAAKC,UAAW,EAAKigB,uBAAmBt1D,GAAW,GAI3Do1C,EAAM4gB,QAAQhpC,EAAK2N,IAAIje,SAAQ,SAAAqkB,OAG/B,UAAAqU,EAAM4gB,QAAQhpC,EAAK2N,WAAnB,SAAwBje,SAAQ,SAAA+kD,GAC5B,IAGIC,EAHA/S,EAAOvZ,EAAMuZ,KAAK8S,GAClBE,GAAWxK,QAAqBxI,GAIpC,GAAI4I,GAAYC,EAAU,EACtBkK,EAAc,IACFvgE,KAAK,CAAE80D,GAAI,EAAGC,GAAI,IAC9B,IAAK,IAAI73D,EAAI,EAAGA,EAAIswD,EAAK8D,OAAOr0D,OAAS,EAAGC,IACxCqjE,EAAYvgE,KAAK,CAAE80D,GAAIsB,EAAUrB,GAAIsB,IACjCmK,WAAUlP,SACViP,EAAYrjE,GAAG43D,IAAM0L,EAASlP,OAAOp0D,GAAG43D,GACxCyL,EAAYrjE,GAAG43D,IAAM0L,EAASlP,OAAOp0D,GAAG63D,IAGhDwL,EAAYvgE,KAAK,CAAE80D,GAAI,EAAGC,GAAI,SACvByL,WAAUlP,SACjBiP,EAAcC,EAASlP,QAEvBiP,GAEA,EAAKjR,eAAe+Q,kBAAkB7S,EAAM,CAAExoD,EAAG,EAAGe,EAAG,GACnD,CAAEf,EAAG,EAAGe,EAAG,GAAK,EAAKkuC,MAAO,EAAKC,UACjC,EAAKigB,uBAAmBt1D,GAAW,GAAO,EAAO0hE,OAGtD,OA/wBnB,0BAqxBI,WAA8C,WAAjC1sB,EAAiC,uDAAtB,KAAMp0B,IAAgB,yDACrCo0B,GAA+B,GAAnBA,EAAS52C,SACtB42C,EAAWr1C,KAAKy1C,MAAMyB,QAAQ5vC,KAAI,SAAAd,GAAC,OAAI,EAAKivC,MAAMpoB,KAAK7mB,OAE3D,IAAI+rD,EAAKC,EAAYnd,GACrBr1C,KAAK8wD,eAAemR,SAAS1P,EAAItxC,GAEjCjhB,KAAKo1C,eA5xBb,0BA+xBI,WACIp1C,KAAKkiE,uBAAsB,SAACC,EAAOC,EAAO3/D,GAClC,iBAAkBA,EAAIuuB,aAAevuB,EAAIqV,KAAKgrB,SAAS,UACvDrgC,EAAIuuB,WAAWooB,cAAe,MAGtCp5C,KAAKqiE,0BAELriE,KAAKq5C,WACLr5C,KAAKo1C,eAxyBb,wBA2yBI,WACIp1C,KAAKkiE,uBAAsB,SAACC,EAAOC,EAAO3/D,GAClC,iBAAkBA,EAAIuuB,aAAevuB,EAAIqV,KAAKgrB,SAAS,UACvDrgC,EAAIuuB,WAAWooB,cAAe,MAGtCp5C,KAAKqiE,0BAELriE,KAAKq5C,WACLr5C,KAAKo1C,eApzBb,6BAuzBI,WACIp1C,KAAKkiE,uBAAsB,SAACC,EAAOC,EAAO3/D,IACtC6/D,QAAwB7/D,MAG5BzC,KAAKqiE,0BAELriE,KAAKq5C,WACLr5C,KAAKo1C,eA/zBb,kBAm0BI,SAAKrN,EAAUjK,GACX,IAAIkK,EAAOr7B,SAASC,cAAc,KAClCo7B,EAAKr4B,aAAa,WAAYo4B,GAC9BC,EAAKC,KAAOnK,EACZnxB,SAASmD,KAAKC,YAAYi4B,GAG1B/7B,OAAO4V,uBAAsB,WACzB,IAAI/F,EAAQ,IAAIC,WAAW,SAC3BisB,EAAK5rB,cAAcN,GACnBnP,SAASmD,KAAKG,YAAY+3B,QA70BtC,yBAi1BI,WACIhoC,KAAKyO,KAAK,WAAYzO,KAAKsgB,OAAOvS,UAAU,gBAl1BpD,qBAq1BI,WACI,IAGI,OAFAw0D,WACAC,WAAWC,YACJ,EACT,MAAOthE,GACL,OAAO,KA31BnB,yBA+1BI,WAA8B,IAMtBkS,EANsB,OAAlBqvD,EAAkB,wDACtBC,EAASJ,aAGTK,EAAO5iE,KAAK8wD,eAAerwC,kBAAkB,GAC7CoiD,EAAO7iE,KAAK8wD,eAAepwC,kBAAkB,GAEjD,GAAIgiD,EAAU,CAEV,IAAIrtB,EAAWr1C,KAAKy1C,MAAMyB,QAAQ5vC,KAAI,SAAAd,GAAC,OAAI,EAAKivC,MAAMpoB,KAAK7mB,MACvD+rD,EAAKC,EAAYnd,GACrBhiC,EAAO,CAACk/C,EAAGxlD,MAAOwlD,EAAGrlD,YAClB,CAEH,IAAI41D,EAAO9iE,KAAK8wD,eAAerwC,kBAAkBzgB,KAAKsgB,OAAOvT,OACzDg2D,EAAO/iE,KAAK8wD,eAAepwC,kBAAkB1gB,KAAKsgB,OAAOpT,QACzD81D,EAAOF,EAAOF,EAAMK,EAAOF,EAAOF,EACtCxvD,EAAO,CAAC2vD,EAAMC,GAIlB,IAAIp2D,EAAM,IAAI21D,WAAWC,WAAWE,EAAQ,CACxCtvD,KAAMA,IAEN6vD,EAASljE,KAAK6M,IAClB7M,KAAK6M,IAAMA,EACX7M,KAAK6M,IAAI2jD,KAAOkS,EAChB1iE,KAAK6M,IAAIs2D,KAAM,EAEVT,GACD1iE,KAAK6M,IAAIoX,WAAW2+C,GAAOC,GAE/B7iE,KAAKo1C,aAELvoC,EAAI81D,OAAOz6C,GAAG,UAAU,WACpB,EAAKzZ,KAAK,WAAY5B,EAAI81D,OAAOS,UAAU,oBAC3C,EAAKv2D,IAAMq2D,EACX,EAAK9tB,kBAp4BjB,6BAy4BI,SAAgBwtB,EAAMC,EAAMC,EAAMC,GAK9B,IALsD,IAAlBM,EAAkB,uDAAL,IAC3CC,EAAYt9D,KAAKiC,MAAM26D,EAAOS,GAAcA,EAC5CE,EAAYv9D,KAAKwwB,KAAKssC,EAAOO,GAAcA,EAC3CG,EAAYx9D,KAAKiC,MAAM46D,EAAOQ,GAAcA,EAC5CI,EAAYz9D,KAAKwwB,KAAKusC,EAAOM,GAAcA,EACxC3kE,EAAI4kE,EAAW5kE,GAAK6kE,EAAW7kE,GAAK2kE,EACzCrjE,KAAK6M,IAAIkR,OAAOrf,EAAG8kE,GACnBxjE,KAAK6M,IAAImR,OAAOtf,EAAG+kE,GAEvB,IAAS/kE,EAAI8kE,EAAW9kE,GAAK+kE,EAAW/kE,GAAK2kE,EACzCrjE,KAAK6M,IAAIkR,OAAOulD,EAAW5kE,GAC3BsB,KAAK6M,IAAImR,OAAOulD,EAAW7kE,GAE/BsB,KAAK6M,IAAI2F,YAAc,SACvBxS,KAAK6M,IAAIgG,SAGT7S,KAAK6M,IAAI0F,YACTvS,KAAK6M,IAAI62D,IAAI,EAAG,EAAG,GAAI,EAAG,EAAI19D,KAAKsO,IAAI,GACvCtU,KAAK6M,IAAI6B,UAAY,MACrB1O,KAAK6M,IAAI+F,OACT5S,KAAK6M,IAAI2F,YAAc,MACvBxS,KAAK6M,IAAIgG,WA/5BjB,kBAm6BI,SAAK4b,GACD,IAAM5hB,EAAM7M,KAAK6M,IACXwiD,EAAIrvD,KAAKy1C,MACTmtB,EAAO5iE,KAAK8wD,eAAerwC,kBAAkB,GAC7CoiD,EAAO7iE,KAAK8wD,eAAepwC,kBAAkB,GAC7CoiD,EAAO9iE,KAAK8wD,eAAerwC,kBAAkBzgB,KAAKsgB,OAAOvT,OACzDg2D,EAAO/iE,KAAK8wD,eAAepwC,kBAAkB1gB,KAAKsgB,OAAOpT,QACzD81D,EAAOF,EAAOF,EAAMK,EAAOF,EAAOF,EAQxC,GANA7iE,KAAKuwD,aAAe,CAAE/pD,EAAGo8D,EAAMr7D,EAAGs7D,EAAMnS,EAAGsS,EAAM9mB,EAAG+mB,GAEpDjjE,KAAK2jE,eAELC,QAAU5jE,KAAM6M,EAAKwiD,EAAGrvD,KAAKwR,SAAUxR,KAAKm7D,YAExCn7D,KAAK08D,gBAAiB,CACtB18D,KAAK6M,IAAI0F,YACT,IAAMsxD,EAAiB7jE,KAAK6M,IAAI4F,UAChCzS,KAAK6M,IAAI4F,UAAYzS,KAAK8wD,eAAeC,mBACzC/wD,KAAK6M,IAAI2F,YAAc,OACvBxS,KAAK6M,IAAI8F,KAAK3S,KAAK08D,gBAAgBoH,QAAS9jE,KAAK08D,gBAAgBvX,QAC7DnlD,KAAK08D,gBAAgBqH,MAAQ/jE,KAAK08D,gBAAgBoH,QAClD9jE,KAAK08D,gBAAgBsH,MAAQhkE,KAAK08D,gBAAgBvX,SACtDnlD,KAAK6M,IAAIgG,SACT7S,KAAK6M,IAAI4F,UAAYoxD,EAGrB7jE,KAAKm7D,aACLn7D,KAAKikE,gBAAgBrB,EAAMC,EAAMC,EAAMC,EAAM,KACzC/iE,KAAKwR,SACLxR,KAAK89D,iBAAiB3uC,UAAY,MAAQnpB,KAAKiC,MAAMjI,KAAKwR,SAAShL,GAC/D,SAAWR,KAAKiC,MAAMjI,KAAKwR,SAASjK,GAExCvH,KAAK89D,iBAAiB3uC,UAAY,mBAI1CnvB,KAAKkkE,iBAx8Bb,yBA28BI,cA38BJ,0BA68BI,WACiC,OAAzBlkE,KAAKwuD,iBACLxuD,KAAKwuD,gBAAgB17C,OAEzB,IACI9S,KAAK6M,IAAIgT,MACX,MAAOu9C,IAIT,GAAIp9D,KAAKiuD,QAAS,CACd,IAAM4S,EAAK7gE,KAAKsgB,OAAOzE,wBACjB/J,EAAM,CACRtL,EAAGxG,KAAK28D,aAAan2D,EAAIq6D,EAAGr6D,EAC5Be,EAAGvH,KAAK28D,aAAap1D,EAAIs5D,EAAGt5D,GAIhCvH,KAAK0xD,kBAAkB9hD,MAAQ,GAC/B5P,KAAK0xD,kBAAkBj+B,UAAY,GACnCzzB,KAAK0xD,kBAAkB9hD,MAAMC,QAAU,QAGvC7P,KAAKiuD,QAAQjuD,KAAK0xD,mBAGlB1xD,KAAK0xD,kBAAkB9hD,MAAM2G,IAAMzE,EAAIvK,EAAI,KAC3CvH,KAAK0xD,kBAAkB9hD,MAAMyG,KAAQvE,EAAItL,EAAI,GAAM,UAEnDxG,KAAK0xD,kBAAkB9hD,MAAMC,QAAU,OAG3C,GAAI7P,KAAKq6B,KAAK36B,MAAO,CACjB,IAAMA,EAAQM,KAAKq6B,KAAK36B,MAEpBoY,EAAO,GACPygB,GAAY,EACZ4rC,GAAS,EACb,QAAwB9jE,IAApBX,EAAM0kE,UACNtsD,EAAO,SACPqsD,EAAQzkE,EAAM0kE,cACX,SAAuB/jE,IAAnBX,EAAM64B,SAYb,OAXAA,EAAW74B,EAAM64B,cACKl4B,IAAlBX,EAAM84B,SACN1gB,EAAO,OACPqsD,EAAQzkE,EAAM84B,cACWn4B,IAAlBX,EAAM02D,SACbt+C,EAAO,OACPqsD,EAAQzkE,EAAM02D,SAEdt+C,EAAO,QAKf,IAAMusD,EAAoBC,mBACtBtkE,KAAKy1C,MAAO39B,EAAMpY,EAAM41C,QAAS/c,EAAU4rC,GAE3CE,IACArkE,KAAKk1D,aAAa,CAACmP,IACnBrkE,KAAKigE,wBAAwBrwD,MAAMC,QAAU,QAC7C7P,KAAKigE,wBAAwBrwD,MAAM4G,OAAS,KAC5CxW,KAAKigE,wBAAwBrwD,MAAMyG,KAAO,KAC1CrW,KAAKkgE,mBAAmB/wC,UAAYzvB,EAAMgmB,cAG9C1lB,KAAKigE,wBAAwBrwD,MAAMC,QAAU,SA/gCzD,8BAmhCI,WACI,IAAM+yD,EAAO5iE,KAAK8wD,eAAerwC,kBAAkB,GAC7CoiD,EAAO7iE,KAAK8wD,eAAepwC,kBAAkB,GAG7CsiD,EAFOhjE,KAAK8wD,eAAerwC,kBAAkBzgB,KAAKsgB,OAAOvT,OAE3C61D,EACdK,EAFOjjE,KAAK8wD,eAAepwC,kBAAkB1gB,KAAKsgB,OAAOpT,QAE3C21D,EACdxtB,EAAW,GAqBjB,OApBAr1C,KAAKukE,4BAA4B3B,EAAMC,EAAMG,EAAMC,GAAM,SAACnrD,EAAM3W,EAAGsB,GAC/D,IAAM81B,EAAWp3B,EAAEkR,MAAQxK,OAAO1G,EAAEkR,QAAU,EAC1CmyD,EAAU,QACD,UAAT1sD,EACA0sD,EAAU,OACI,WAAT1sD,EACL0sD,EAAU,QACI,UAAT1sD,EACL0sD,EAAU,OACI,YAAT1sD,EACL0sD,EAAU,SACI,eAAT1sD,IACL0sD,EAAU,aACdnvB,EAAS7zC,KAAK,CACVsW,KAAM0sD,EACNlvB,QAASztC,OAAO1G,EAAEm0C,SAClB/c,SAAUA,EACVyC,GAAInzB,OAAO1G,EAAE65B,SAGdqa,IA/iCf,8BAwjCI,SAAiB7uC,EAAGe,EAAGmpD,EAAGxU,GACtB,IAAM7G,EAAW,CACb4C,OAAQ,GAAIf,MAAO,GAAIqB,WAAY,GACnCvB,MAAO,GAAIqB,QAAS,IAMxB,OAJAr4C,KAAKukE,4BAA4B/9D,EAAGe,EAAGmpD,EAAGxU,GAAG,SAACpkC,EAAM3W,EAAGsB,GACnDtB,EAAEsB,IAAMA,EACR4yC,EAASv9B,GAAMtW,KAAKL,MAEjBk0C,IAjkCf,yCAokCI,SAA4B7uC,EAAGe,EAAGmpD,EAAGxU,EAAG3xC,IAEpC,SAASk6D,EAAmBpV,EAAG7gC,EAAW8mB,GACtC+Z,EAAEnY,QAAQn6B,SAAQ,SAAAwb,GACd,IAAMlmB,EAAQg9C,EAAEhiC,KAAKkL,GACrB,GAAKlmB,GAEDA,EAAMiJ,UAAU9U,EAAGe,EAAGmpD,EAAGxU,GAAI,CAI7B,GAFA3xC,EAAK,SAAU,CAAE8vB,KAAM7L,EAAW8mB,QAASA,EAASta,GAAIzC,GAAYlmB,GAEhEA,EAAMwF,KAAKxF,MAAM2e,WAAWooB,aAC5B,OAEJ,IAAMof,EAAKnmD,EAAMwF,KAAK49B,MACtB,IAAK+iB,EACD,OACJA,EAAGthB,QAAQn6B,SAAQ,SAAAyb,GACf,IAAMnL,EAAOmrC,EAAGnrC,KAAKmL,GACjBnL,EAAK/R,UAAU9U,EAAGe,EAAGmpD,EAAGxU,KAExB3xC,EAAK,QAAS,CAAE8vB,KAAM7L,EAAW8mB,QAASA,EAASjjC,MAAOkmB,EAAUyC,GAAIxC,GAAWnL,GAGvD,eAAxBA,EAAKxV,KAAKwV,KAAKvV,MACf2sD,EAAmBp3C,EAAKxV,KAAK49B,MACzBpoB,EAAKxV,KAAKwV,KAAK2D,WAAWqJ,KAAKrJ,WAAWtrB,KAC1C2nB,EAAKxV,KAAKwV,KAAK2D,WAAWqJ,KAAKS,eAG3CzN,EAAKgrC,cAAct7C,SAAQ,SAACrQ,EAAGhO,GACvBgO,EAAE4O,UAAU9U,EAAGe,EAAGmpD,EAAGxU,IACrB3xC,EAAK,aAAc,CACf8vB,KAAM7L,EAAW8mB,QAASA,EAASjjC,MAAOkmB,EAAUlL,KAAMmL,EAC1DksC,UAAWhmE,EAAGimE,SAAU,MACzBj4D,MAEX2gB,EAAK4qC,eAAel7C,SAAQ,SAACrQ,EAAGhO,GACxBgO,EAAE4O,UAAU9U,EAAGe,EAAGmpD,EAAGxU,IACrB3xC,EAAK,aAAc,CACf8vB,KAAM7L,EAAW8mB,QAASA,EAASjjC,MAAOkmB,EAAUlL,KAAMmL,EAC1DksC,UAAWhmE,EAAGimE,SAAU,OACzBj4D,SAKf8rD,EAAGxhB,QAAQj6B,SAAQ,SAAAq5C,GACf,IAAMpH,EAAOwJ,EAAGxJ,KAAKoH,GACjBpH,EAAK1zC,UAAU9U,EAAGe,EAAGmpD,EAAGxU,IACxB3xC,EAAK,QAAS,CAAE8vB,KAAM7L,EAAW8mB,QAASA,EAASjjC,MAAOkmB,EAAUyC,GAAIg0B,EAAKh0B,IAAMg0B,UAOnGK,EAAErY,QAAQj6B,SAAQ,SAAAqnD,GACd,IAAMQ,EAASvV,EAAEL,KAAKoV,GAClBQ,EAAOtpD,UAAU9U,EAAGe,EAAGmpD,EAAGxU,IAC1B3xC,EAAK,UAAW,CAAE8vB,KAAM7L,EAAW8mB,QAASA,EAASta,GAAI4pC,EAAO5pC,IAAM4pC,MAMlFH,CAAmBzkE,KAAKy1C,MAAOz1C,KAAKq6B,KAAKrJ,WAAWtrB,KAChD1F,KAAKq6B,KAAKS,gBAvoCtB,mCA0oCI,SAAsBvwB,IAElB,SAASk6D,EAAmBpqC,GACxBA,EAAK6c,MAAMn6B,SAAQ,SAAC1K,EAAOkmB,GAEvBhuB,EAAK,SAAU,CAAE8vB,KAAMA,EAAMW,GAAIzC,GAAYlmB,GAE7CA,EAAM6kC,MAAMn6B,SAAQ,SAACsQ,EAAMmL,GAEvBjuB,EAAK,QAAS,CAAE8vB,KAAMA,EAAMhoB,MAAOkmB,EAAUyC,GAAIxC,GAAWnL,GAG1C,eAAdA,EAAKvV,MACL2sD,EAAmBp3C,EAAK2D,WAAWqJ,SAI3ChoB,EAAM2kC,MAAMj6B,SAAQ,SAACiyC,EAAMoH,GACvB7rD,EAAK,QAAS,CAAE8vB,KAAMA,EAAMhoB,MAAOkmB,EAAUyC,GAAIo7B,GAAWpH,SAKpE30B,EAAK2c,MAAMj6B,SAAQ,SAAC6nD,EAAQR,GACxB75D,EAAK,UAAW,CAAE8vB,KAAMA,EAAMW,GAAIopC,GAAaQ,MAKvDH,CAAmBzkE,KAAKq6B,QAvqChC,8BA0qCI,SAAiB7zB,EAAGe,EAAGmpD,EAAGxU,EAAG3xC,IAEzB,SAASk6D,EAAmBpV,EAAG7gC,GAC3B6gC,EAAEnY,QAAQn6B,SAAQ,SAAAwb,GACd,IAAMlmB,EAAQg9C,EAAEhiC,KAAKkL,GACrB,GAAKlmB,IAGL9H,EAAK,SAAU,CAAE8vB,KAAM7L,EAAWwM,GAAIzC,EAAUkd,MAAO4Z,GAAKh9C,EAAOA,EAAMiJ,UAAU9U,EAAGe,EAAGmpD,EAAGxU,KAExF7pC,EAAMwF,KAAKxF,MAAM2e,WAAWooB,cAAhC,CAGA,IAAMof,EAAKnmD,EAAMwF,KAAK49B,MACjB+iB,IAELA,EAAGthB,QAAQn6B,SAAQ,SAAAyb,GACf,IAAMnL,EAAOmrC,EAAGnrC,KAAKmL,GAErBjuB,EAAK,QAAS,CAAE8vB,KAAM7L,EAAWnc,MAAOkmB,EAAUyC,GAAIxC,EAASid,MAAO+iB,GAAMnrC,EAAMA,EAAK/R,UAAU9U,EAAGe,EAAGmpD,EAAGxU,IAG9E,eAAxB7uB,EAAKxV,KAAKwV,KAAKvV,MACf2sD,EAAmBp3C,EAAKxV,KAAK49B,MAAOpoB,EAAKxV,KAAKwV,KAAK2D,WAAWqJ,KAAKrJ,WAAWtrB,MAGlF2nB,EAAKgrC,cAAct7C,SAAQ,SAACrQ,EAAGhO,GAC3B6L,EAAK,aAAc,CACf8vB,KAAM7L,EAAWnc,MAAOkmB,EAAUlL,KAAMmL,EACxCksC,UAAWhmE,EAAGimE,SAAU,KAAMlvB,MAAO+iB,GACtC9rD,EAAGA,EAAE4O,UAAU9U,EAAGe,EAAGmpD,EAAGxU,OAE/B7uB,EAAK4qC,eAAel7C,SAAQ,SAACrQ,EAAGhO,GAC5B6L,EAAK,aAAc,CACf8vB,KAAM7L,EAAWnc,MAAOkmB,EAAUlL,KAAMmL,EACxCksC,UAAWhmE,EAAGimE,SAAU,MAAOlvB,MAAO+iB,GACvC9rD,EAAGA,EAAE4O,UAAU9U,EAAGe,EAAGmpD,EAAGxU,UAKnCsc,EAAGxhB,QAAQj6B,SAAQ,SAAAq5C,GACf,IAAMpH,EAAOwJ,EAAGxJ,KAAKoH,GACrB7rD,EAAK,QAAS,CAAE8vB,KAAM7L,EAAWnc,MAAOkmB,EAAUyC,GAAIg0B,EAAKh0B,GAAIya,MAAO+iB,GAAMxJ,EAAMA,EAAK1zC,UAAU9U,EAAGe,EAAGmpD,EAAGxU,YAKlHmT,EAAErY,QAAQj6B,SAAQ,SAAAqnD,GACd,IAAMQ,EAASvV,EAAEL,KAAKoV,GACtB75D,EAAK,UAAW,CAAE8vB,KAAM7L,EAAWwM,GAAI4pC,EAAO5pC,GAAIya,MAAO4Z,GAAKuV,EAAQA,EAAOtpD,UAAU9U,EAAGe,EAAGmpD,EAAGxU,OAKxGuoB,CAAmBzkE,KAAKy1C,MAAOz1C,KAAKq6B,KAAKrJ,WAAWtrB,QAjuC5D,oCAouCI,SAAuBspD,GAAM,UACNhvD,KAAKkhE,kBADC,IACzB,gCAAWC,EAAX,QACI,GAAIA,EAAK70D,IAAI0iD,GACT,OAAOmS,GAHU,8BAIzB,MAAO,KAxuCf,wCA2uCI,SAA2B0D,EAAaC,GAsBpC,IApBA,IAAMzvB,EAAWr1C,KAAK+kE,iBAAiBF,EAAaC,EAAa,EAAG,GAC9D9sB,EAAiB3C,EAAS4C,OAC1BC,EAAgB7C,EAAS6B,MACzBiB,EAAgB9C,EAAS2B,MACzBoB,EAA2B/C,EAASgD,QACpCC,EAAqBjD,EAASkD,WAC9BC,EACFR,EAAev5C,OAASy5C,EAAcz5C,OACtC05C,EAAc15C,OAAS25C,EAAyB35C,OAChD65C,EAAmB75C,OACnBg6C,EAAkB,KAAMusB,GAAsB,EAUlD,MANmB,CACfhtB,EACAI,EACAF,EACAC,GAEJ,eACI,IADC,IAAMxqB,EAAQ,KACNjvB,EAAI,EAAGA,EAAIivB,EAASlvB,OAAQC,IAAK,CACtC,IAAMqnC,EAAIpY,EAASjvB,GAAG+D,IAAIsK,MAAQ4gB,EAASjvB,GAAG+D,IAAIyK,QAC9C83D,EAAqB,GAAKj/B,EAAIi/B,KAC9BA,EAAqBj/B,EACrB0S,EAAkB9qB,EAASjvB,GAAG+D,KAK1C,MAAO,CACH+1C,iBACAnD,WACAoD,qBA9wCZ,0BAkxCI,SAAa38B,GAGT,GAAIA,EAAMja,SAAW8K,SAASmD,KAA9B,CASA,GANI9P,KAAK+8D,qBAAuBjhD,EAAMuiB,SAClCr+B,KAAK87D,eAAe9hC,QAAQle,GAAO,GAEnC9b,KAAKg9D,qBAAuBlhD,EAAMmpD,UAClCjlE,KAAK67D,aAAa7hC,QAAQle,GAAO,GAEb,QAApB9b,KAAKy8D,WAwBT,MApByB,WAAd3gD,EAAMxc,IACTU,KAAK83C,kBAAkBr5C,OAAS,IAChCuB,KAAK83C,kBAAkB/6B,SAAQ,SAAAw6B,GAC3BA,EAAG8S,UAAW,KAElBrqD,KAAK83C,kBAAoB,GACzB93C,KAAKo1C,cAEY,WAAdt5B,EAAMxc,KAAmC,UAAfwc,EAAMhE,OACnC9X,KAAK83C,kBAAkBr5C,OAAS,GAChCuB,KAAKklE,mBAAmBllE,KAAK83C,mBACjC93C,KAAK83C,kBAAoB,IAGzBh8B,EAAMuiB,UAAYviB,EAAMmpD,UACxBjlE,KAAK87D,eAAe9hC,QAAQle,GAAO,GAEnCA,EAAMmpD,WAAanpD,EAAMuiB,SACzBr+B,KAAK67D,aAAa7hC,QAAQle,GAAO,IAE9B,EAvBe,WAAdA,EAAMxc,KAAqBwc,EAAMuiB,SAAYviB,EAAMmpD,UACnDjlE,KAAK47D,YAAY5hC,aAhyCjC,4BAyzCI,SAAele,EAAOqpD,EAAaC,GAA+B,WAAlBztB,EAAkB,uDAAT,SACjD33C,KAAK+8D,oBAAsB/8D,KAAKg9D,qBAChCh9D,KAAK2/D,aAAa7jD,GAEtB,IAAIupD,GAAQ,EAERC,GAAwB,EAExBC,GAA0B,EAE9B,GAAe,cAAX5tB,GAAqC,eAAXA,EAC1B33C,KAAK41D,WAAa95C,OACf,GAAe,YAAX67B,EACP33C,KAAK41D,WAAa,KAClB51D,KAAKy7D,qBAAuB,UACzB,GAAe,aAAX9jB,EACqB,GAAxB77B,EAAM0pD,QAAQ/mE,OACduB,KAAK41D,WAAa,KAElB51D,KAAK41D,WAAa95C,OACnB,GAAe,cAAX67B,EAAwB,CAE/B,IAAM6d,EAAex1D,KAAKwR,SAK1B,GAJAxR,KAAKwR,SAAW,CAAEhL,EAAG2+D,EAAYrpD,GAAQvU,EAAG69D,EAAYtpD,IACxD9b,KAAK28D,aAAe,CAAEn2D,EAAGsV,EAAMI,QAAS3U,EAAGuU,EAAMK,SAG7Cnc,KAAK41D,YAA8B,EAAhB95C,EAAMtN,QAAa,CAGtC,GAFAxO,KAAK48D,UAAW,EAEQ,SAApB58D,KAAKy8D,WAAuB,CAC5B,GAAIz8D,KAAKy7D,qBAAsB,CAC3Bz7D,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,WAC3Bz9D,KAAK41D,WAAWc,GAAKyO,EAAYnlE,KAAK41D,YACtC51D,KAAK41D,WAAWgB,GAAKwO,EAAYplE,KAAK41D,YACtC,IAAI6P,EAAmB,CAACzlE,KAAKy7D,sBACzBz7D,KAAK83C,kBAAkBxsC,SACnBtL,KAAKy7D,uBACJz7D,KAAK83C,kBAAkBr5C,OAAS,IACrCgnE,EAAmBzlE,KAAK83C,kBAAkBzvC,QACtC,SAAAkvC,GAEI,GAAIA,aAAcmuB,KACd,OAAO,EACX,IAAIC,EAAUpuB,EAAGld,KAAKS,aAIlB8qC,EACA,EAAKjQ,kBAAkBgQ,GAC3B,GAAIC,GACA,EAAK9tB,kBAAkBxsC,SACnBs6D,GAEJ,OAAO,EAIX,IAAIC,EACA,EAAKnwB,UAAUiwB,GAASt4C,KACpBkqB,EAAGxc,WAEX,OAAI8qC,IACA,EAAK/tB,kBAAkBxsC,SACnBu6D,OAUpB,IA3C2B,EA2CvB/P,EAAmB2P,EAAiBhnE,OAAS,EA3CtB,IA4CZgnE,GA5CY,IA4C3B,2BAAiC,KAAxBluB,EAAwB,QAC7Bv3C,KAAK8wD,eAAe+Q,kBAChBtqB,EACAie,EAAcx1D,KAAKwR,SACnBxR,KAAKy1C,MAAOz1C,KAAK01C,UACjB11C,KAAK21D,kBACL31D,KAAK41D,YACL,EACAE,IApDmB,8BA0D3B,OAFAuP,GAAQ,EACRrlE,KAAKo1C,cACE,EAEP,IAAM0wB,EAAiB9lE,KAAK+lE,2BACxB/lE,KAAKwR,SAAShL,EAAGxG,KAAKwR,SAASjK,GAEnC,OAAIu+D,EAAertB,kBACfz4C,KAAKy7D,qBACDqK,EAAertB,gBACnBz4C,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,YACpB,GAIY,WAApBz9D,KAAKy8D,YACZz8D,KAAK08D,gBAAkB,CACnBoH,QAASqB,EAAYnlE,KAAK41D,YAC1BzQ,QAASigB,EAAYplE,KAAK41D,YAC1BmO,MAAO/jE,KAAKwR,SAAShL,EACrBw9D,MAAOhkE,KAAKwR,SAASjK,GAIzB89D,GAAQ,IAERrlE,KAAK8wD,eAAe7sC,UAAUnI,EAAMkqD,UAChClqD,EAAMmqD,WAGVZ,GAAQ,QAET,GAAIrlE,KAAK41D,YAA8B,EAAhB95C,EAAMtN,QAEhCxO,KAAK48D,UAAW,EAChB58D,KAAK8wD,eAAe7sC,UAAUnI,EAAMkqD,UAAWlqD,EAAMmqD,WACrDZ,GAAQ,EACRC,GAAwB,OAIxB,GAFAtlE,KAAK41D,WAAa,KAClB51D,KAAKy7D,qBAAuB,KACR,EAAhB3/C,EAAMtN,SAA+B,EAAhBsN,EAAMtN,QAC3B,OAAO,OAEZ,GAAe,cAAXmpC,EACP,GAAI33C,KAAK41D,WAAW4P,QAAQ/mE,QAAUqd,EAAM0pD,QAAQ/mE,OAEhDuB,KAAK41D,WAAa95C,MACf,IAA4B,GAAxBA,EAAM0pD,QAAQ/mE,OAQrB,OAPAuB,KAAK8wD,eAAe7sC,UAAUnI,EAAM0pD,QAAQ,GAAGtpD,QAAUlc,KAAK41D,WAAW4P,QAAQ,GAAGtpD,QAChFJ,EAAM0pD,QAAQ,GAAGrpD,QAAUnc,KAAK41D,WAAW4P,QAAQ,GAAGrpD,SAC1Dnc,KAAK41D,WAAa95C,EAGlBupD,GAAQ,EACRrlE,KAAKo1C,cACE,EACJ,GAA4B,GAAxBt5B,EAAM0pD,QAAQ/mE,OAAa,CAGlC,IAAMynE,EAASlmE,KAAK41D,WAAW4P,QAAQ,GACjCW,EAASnmE,KAAK41D,WAAW4P,QAAQ,GACnC/S,EAAKyT,EAAOhqD,QAASy2C,EAAKwT,EAAOjqD,QACjCw2C,EAAKwT,EAAO/pD,QAASy2C,EAAKuT,EAAOhqD,QAC/BiqD,EAAY,EAAE3T,EAAKE,GAAM,GAAMD,EAAKE,GAAM,GAC1CyT,EAAkBrgE,KAAKC,KAAK,SAACwsD,EAAKE,EAAO,GAAb,SAAkBD,EAAKE,EAAO,IAChEH,EAAK32C,EAAM0pD,QAAQ,GAAGtpD,QAASy2C,EAAK72C,EAAM0pD,QAAQ,GAAGtpD,QACrDw2C,EAAK52C,EAAM0pD,QAAQ,GAAGrpD,QAASy2C,EAAK92C,EAAM0pD,QAAQ,GAAGrpD,QACrD,IAAMmqD,EAAkBtgE,KAAKC,KAAK,SAACwsD,EAAKE,EAAO,GAAb,SAAkBD,EAAKE,EAAO,IAC1D2T,EAAY,EAAE9T,EAAKE,GAAM,GAAMD,EAAKE,GAAM,GAchD,OAXA5yD,KAAK8wD,eAAe7sC,UAAUsiD,EAAU,GAAKH,EAAU,GACnDG,EAAU,GAAKH,EAAU,IAE7BpmE,KAAK8wD,eAAe/3C,MAAMutD,EAAkBD,EACxCE,EAAU,GAAIA,EAAU,IAE5BvmE,KAAK41D,WAAa95C,EAGlBupD,GAAQ,EACRrlE,KAAKo1C,cACE,QAER,GAAe,UAAXuC,EAAoB,CAE3B,IAAMkpB,EAAK7gE,KAAKsgB,OAAOzE,wBACjBrV,EAAIsV,EAAMI,QAAU2kD,EAAGr6D,EACvBe,EAAIuU,EAAMK,QAAU0kD,EAAGt5D,EAC7BvH,KAAK8wD,eAAe/3C,MAAM+C,EAAM0qD,OAAS,EAAI,GAAM,IAAKhgE,EAAGe,GAC3D89D,GAAQ,EACRC,GAAwB,EAI5B,IAAKtlE,KAAKwR,SACN,OAAO,EAGX,IAAMi1D,EAAwBzmE,KAAK+lE,2BAC/B/lE,KAAKwR,SAAShL,EAAGxG,KAAKwR,SAASjK,GAE7B8tC,EAAWoxB,EAAsBpxB,SACjCmD,EAAiBiuB,EAAsBjuB,eACvCC,EAAkBguB,EAAsBhuB,gBAE9C,GAAuB,OAAnBz4C,KAAKy8D,WAAqB,CAC1B,IAAIllB,EAAKv3C,KAAKq8D,qBACVpB,EACAj7D,KAAKg8D,SAAUvjB,EAAiBz4C,KAAKi8D,aAAcj8D,KAAKwR,UAExD+lC,EAAGmvB,kBAAkB/2D,aAAa,SAAU,SAE5C4nC,EAAGmvB,kBAAkB/2D,aAAa,SAAU,OAEhD4nC,EAAG3nC,MAAMyG,KACJyF,EAAM6qD,OAASpvB,EAAGmvB,kBAAkBE,YAAc,EAAK,KAC5DrvB,EAAG3nC,MAAM2G,IACJuF,EAAM+qD,OAAStvB,EAAGmvB,kBAAkBI,aAAe,EAAK,KAiGjE,GA7FwB,WAApB9mE,KAAKy8D,WACLz8D,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,YACpBjlB,EAAiB,EACA,SAApBx4C,KAAKy8D,YAAyBz8D,KAAK41D,WACnC51D,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,WACA,SAApBz9D,KAAKy8D,WACZz8D,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,OAGtBhlB,EAAgB5gC,KAAKxF,OACrBomC,EAAgB5gC,KAAKxF,MAAM2e,WAAWooB,cACtCX,EAAgB5gC,KAAKwV,MACrBorB,EAAgB5gC,KAAKwV,KAAK2D,WAAWooB,aAGtCp5C,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,QAE3Bz9D,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,UAInCz9D,KAAKsgB,OAAO1Q,MAAM6tD,OAAS,OAG/Bz9D,KAAKiuD,QAAU,KACfjuD,KAAKu7D,sBAAwBlmB,EAG7Br1C,KAAK6uD,iBAAiB7uD,KAAKwR,SAAShL,EAAGxG,KAAKwR,SAASjK,EAAG,EAAG,GAAG,SAACuQ,EAAM3W,EAAGsB,EAAKskE,GACzEtkE,EAAIukE,SAAU,EACdvkE,EAAI0yC,aAAc,KAGtBn1C,KAAK6uD,iBAAiB7uD,KAAKwR,SAAShL,EAAGxG,KAAKwR,SAASjK,EAAG,EAAG,GAAG,SAACuQ,EAAM3W,EAAGsB,EAAKskE,GA2BzE,GAzBIA,GAAetkE,aAAe+2C,MAAyB,MAAjB/2C,EAAIs4B,WAC7B,EAAKksC,uBAAuBxkE,GACpCsa,SAAQ,SAAAmqD,GACLA,GAAMzkE,QAAcpC,IAAP6mE,IACbA,EAAG/xB,aAAc,MAMzB4xB,GAAetkE,aAAe0kE,aAC9B3F,QAAqB,EAAK9rB,UAAUjzC,EAAI43B,KAAKS,eAAe,SAACzN,GAEzD,OAAIA,aAAgB4rB,QAGhB5rB,aAAgB85C,YAAc95C,EAAKxV,KAAKwV,KAAKgO,QAAU54B,EAAIoV,KAAKwV,KAAKgO,QACrEhO,EAAK8nB,aAAc,IAGhB,MAKX4xB,GAAetkE,aAAeijE,KAAW,CACzC,IAAM0B,EAAejmE,EAAEs0C,MAAMpoB,KAAK5qB,EAAIs4B,WAAWljB,KAAK49B,MAClD2xB,IACA5F,QAAqB4F,GAAc,SAAC/5C,GAEhC,OAAIA,aAAgB4rB,QAGhB5rB,aAAgB85C,YAAc95C,EAAKxV,KAAKwV,KAAKgO,QAAU54B,EAAI44B,UAC3DhO,EAAK8nB,aAAc,IAGhB,MAKf4xB,IACAtkE,EAAIukE,SAAU,MAKE,QAApBhnE,KAAKy8D,YAA0C,SAAlBz8D,KAAKg8D,UAClCh8D,KAAKm9D,iBACLn9D,KAAKm9D,eAAehoB,aAAc,GAGvB,cAAXwC,IAEA0tB,GAAQ,GAGG,aAAX1tB,EAAuB,CACvB,IAAMtd,EAAQoe,EAAkBA,EAAgBpe,KAAO,KACnD2e,EAAY,KACZP,aAA2BQ,MAC3BD,EAAYP,EAAgB5gC,KAAKxF,MAC5BomC,aAA2BS,UAChCF,EAAYP,EAAgB5gC,KAAKwV,MAGnBvV,KAAKgrB,SAAS,UACxBkW,EAAY3e,EAAK6c,MAAMuB,EAAgB1d,WAAWmc,MAAM8B,EAAUG,cAEtEH,EAAY,KAGZA,GAAa,iBAAkBA,EAAUhoB,aACzCgoB,EAAUhoB,WAAWooB,cAAgBJ,EAAUhoB,WAAWooB,aAE1Dp5C,KAAKqiE,0BAGLriE,KAAKq5C,WACLgsB,GAAQ,EACRC,GAAwB,GAIhC,IAAIvtB,GAAY,EAChB,GAAe,UAAXJ,EACA,GAAI33C,KAAK48D,SAAU,CAOf,GALA58D,KAAK48D,UAAW,EAChB7kB,GAAY,EAEZutB,GAAwB,EAEpBtlE,KAAK08D,gBAAiB,CACtB,IAAI2K,EAAwB,GACxBC,EAAUthE,KAAKwsB,IAAIxyB,KAAK08D,gBAAgBoH,QACxC9jE,KAAK08D,gBAAgBqH,OACrBwD,EAAQvhE,KAAKyJ,IAAIzP,KAAK08D,gBAAgBoH,QACtC9jE,KAAK08D,gBAAgBqH,OACrByD,EAAUxhE,KAAKwsB,IAAIxyB,KAAK08D,gBAAgBvX,QACxCnlD,KAAK08D,gBAAgBsH,OACrByD,EAAQzhE,KAAKyJ,IAAIzP,KAAK08D,gBAAgBvX,QACtCnlD,KAAK08D,gBAAgBsH,OACrBtT,EAAI6W,EAAQD,EACZprB,EAAIurB,EAAQD,EAChBxnE,KAAKukE,4BAA4B+C,EAASE,EAAS9W,EAAGxU,GAClD,SAACpkC,EAAM3W,EAAGsB,GACFA,EAAIilE,aAAaJ,EAASE,EAAS9W,EAAGxU,IACtCmrB,EAAsB7lE,KAAKiB,MAEnCqZ,EAAMmpD,WAAajlE,KAAK+8D,mBACxBsK,EAAsBtqD,SAAQ,SAACw6B,GACtB,EAAKO,kBAAkBxsC,SAASisC,IACjC,EAAKO,kBAAkBt2C,KAAK+1C,MAE7Bz7B,EAAMuiB,UAAYr+B,KAAK+8D,mBAC9BsK,EAAsBtqD,SAAQ,SAACw6B,GACvB,EAAKO,kBAAkBxsC,SAASisC,KAChC,EAAKO,kBACD,EAAKA,kBAAkBzvC,QAAO,SAACmN,GAE3B,OADAA,EAAI60C,UAAW,EACR70C,IAAQ+hC,UAK/Bv3C,KAAK83C,kBAAkB/6B,SAAQ,SAACw6B,GAC5BA,EAAG8S,UAAW,KAElBrqD,KAAK83C,kBAAoBuvB,GAE7BrnE,KAAK08D,gBAAkB,KACvB2I,GAAQ,EACRC,GAAwB,EACxBC,GAA0B,EAGN,SAApBvlE,KAAKy8D,YACLz8D,KAAKqiE,8BACN,CACH,GAAwB,QAApBriE,KAAKy8D,YACDxB,EACAj7D,KAAKg8D,SAAUvjB,EAAiBz4C,KAAKi8D,aACrCj8D,KAAKwR,UACN,CACC,GAAsB,SAAlBxR,KAAKg8D,SACL,GAAIh8D,KAAKm9D,eAAgB,CACrB,IAAIv9C,EAAQ5f,KAAKm9D,eACjBn9D,KAAKm9D,oBAAiB98D,EACtBL,KAAK2nE,kBACD3nE,KAAKg8D,UACL0E,QAAuBjoB,IACvBioB,QAAuB9gD,SAG3B5f,KAAKm9D,eAAiB1kB,EACtBz4C,KAAKm/D,4BAEgB,gBAAlBn/D,KAAKg8D,UACZh8D,KAAKk9D,aAAel9D,KAAKwR,SAEzBxR,KAAK2nE,kBACD3nE,KAAKg8D,SAAW,IAAMh8D,KAAKi8D,cAC3ByE,QAAuBjoB,MAG3Bz4C,KAAKk9D,aAAel9D,KAAKwR,SAEzBxR,KAAK2nE,kBACD3nE,KAAKg8D,UACL0E,QAAuBjoB,KAI1B38B,EAAMuiB,SAA+B,SAAlBr+B,KAAKg8D,UACLh8D,KAAKm9D,gBAEzBn9D,KAAK47D,YAAY5hC,UAKzBye,EACI38B,EAAMuiB,SAGFr+B,KAAK83C,kBAAkBxsC,SAASmtC,IAChCA,EAAgB4R,UAAW,EAC3BrqD,KAAK83C,kBACD93C,KAAK83C,kBAAkBzvC,QAAO,SAACkvC,GAC3B,OAAOA,IAAOkB,MAGtBz4C,KAAK83C,kBAAkBt2C,KAAKi3C,GAIhC8sB,GAA0B,GACnBzpD,EAAMmpD,WAOTjlE,KAAK83C,kBAAkBr5C,OAAS,IAChC8mE,GAA0B,GAE9BvlE,KAAK83C,kBAAkB/6B,SAAQ,SAACw6B,GAC5BA,EAAG8S,UAAW,KAElBrqD,KAAK83C,kBAAoB,CAACW,KAO1Bz4C,KAAK83C,kBAAkBr5C,OAAS,IAChC8mE,GAA0B,GAE9BvlE,KAAK83C,kBAAkB/6B,SAAQ,SAACw6B,GAC5BA,EAAG8S,UAAW,KAElBrqD,KAAK83C,kBAAoB,IAE7ButB,GAAQ,EACRC,GAAwB,EAOhC,GAJAtlE,KAAK83C,kBAAkB/6B,SAAQ,SAACw6B,GAC5BA,EAAG8S,UAAW,KAGH,gBAAX1S,EACA,GAAuB,QAAnB33C,KAAKy8D,WAAsB,CAC3B,IAAImL,EAAoB,CAACnvB,GACrBz4C,KAAK83C,kBAAkBxsC,SAASmtC,KAChCmvB,EAAoB5nE,KAAK83C,mBAE7B,IAL2B,EAKvB+vB,GAAgB,EAChBC,GAAqB,EANE,IAOZF,GAPY,IAO3B,2BAAkC,KAAzBrwB,GAAyB,QAC1B57B,IAAW67C,QAAqBjgB,IACpC,GAAIA,MAAQA,cAAcmuB,OAAc/pD,GAAU,CAG9C,GAAI47B,cAAciC,KAAM,CACpB,IAAK79B,GAASm3C,OACV,SAIJ,IADA,IAAIiV,GAAa,IAAInpE,MAAM24C,GAAGub,OAAOr0D,QAC5B+I,GAAI,EAAGA,GAAI+vC,GAAGub,OAAOr0D,OAAS,EAAG+I,KACtCugE,GAAWvgE,IAAK,CACZ8uD,IAAM36C,GAASm3C,OAAOtrD,IAAG8uD,GACzBC,IAAM56C,GAASm3C,OAAOtrD,IAAG+uD,IAG7B56C,GAASm3C,OAAOtrD,IAAG8uD,GAAK,EACxB36C,GAASm3C,OAAOtrD,IAAG+uD,GAAK,EAI5Bv2D,KAAK8wD,eAAe+Q,kBAChBtqB,GAAI,CAAE/wC,EAAG,EAAGe,EAAG,GAAK,CAAEf,EAAG,EAAGe,EAAG,GAAKvH,KAAKy1C,MACzCz1C,KAAK01C,UAAW11C,KAAK21D,uBACrBt1D,GAAW,GAAO,EAAO0nE,IAG7BF,GAAgB,MACb,CACH,IAAIG,QAAK,EAAEC,QAAK,EAChB,IAAKtsD,GAAS26C,KAAO36C,GAAS46C,GAC1B,SAIJyR,GAAQzwB,GAAG/wC,EAAImV,GAAS26C,GACxB2R,GAAQ1wB,GAAGhwC,EAAIoU,GAAS46C,GAExB56C,GAAS26C,GAAK,EACd36C,GAAS46C,GAAK,EAGdv2D,KAAK8wD,eAAe+Q,kBAChBtqB,GAAI,CAAE/wC,EAAG+wC,GAAG/wC,EAAGe,EAAGgwC,GAAGhwC,GACrB,CAAEf,EAAGwhE,GAAOzgE,EAAG0gE,IAASjoE,KAAKy1C,MAC7Bz1C,KAAK01C,UAAW11C,KAAK21D,uBACrBt1D,GAAW,GAAO,OAAOA,GAG7BwnE,GAAgB,EAGhBtwB,cAAcogB,YAEdh8C,GAASi8C,SAAW,EACpBj8C,GAASk8C,SAAW,EAEftgB,GAAG1/B,KAAKwV,KAAK2D,WAAWooB,eACzB0uB,GAAqB,MAlEV,8BAuEvBA,GACA9nE,KAAKq5C,WAETr5C,KAAKo1C,aAEDyyB,GACA7nE,KAAKqiE,8BAEiB,OAAnBriE,KAAKy8D,YAEZz8D,KAAK47D,YAAY5hC,UAIzB,IAAIkuC,GAAU/C,EAAYrpD,GACtBqsD,GAAU/C,EAAYtpD,GAoB1B,GAnBI9b,KAAK88D,yBACLuI,GAASrlE,KAAK88D,uBAAuBnlB,EAAQ77B,EAAO,CAAEtV,EAAG0hE,GAAS3gE,EAAG4gE,IAAW9yB,EAC5Er1C,KAAMA,KAAK83C,kBAAmBC,IAET,OAAzB/3C,KAAKwuD,kBACL6W,GAASrlE,KAAKwuD,gBAAgBwM,eAC1BrjB,EACA77B,EACA,CAAEtV,EAAG0hE,GAAS3gE,EAAG4gE,IACjB9yB,EACAoD,EACAV,IAIJstB,GACArlE,KAAKo1C,aAGLkwB,EAGA,IACQ5W,QACA0Z,oBACI,gCACA,CACI7C,wBAAyBA,IAGvC,MAAOnI,IAKb,OAAO,MAp5Df,KAo8DA,SAASiE,EAAcx0D,EAAKwtB,EAAMqb,EAAWigB,EAAmB6G,GAC5D,IAAM6L,EAAe,EAAIC,WAGnBjZ,EAAI,IAAIkZ,oBACdlZ,EAAEmZ,SAAS,IACXnZ,EAAEoZ,qBAAoB,SAACC,EAAG/hE,GAAQ,MAAO,MAGzC0zB,EAAK6c,MAAMn6B,SAAQ,SAAC1K,GAChB,IAAIs2D,EAAY,GAEhBA,EAAUttC,MAAQhpB,EAAM2oB,GACxB,IAAI4tC,EAAU,KACVv2D,EAAM2e,WAAWooB,cACjBuvB,EAAU57D,MAAQF,EAAIwM,YAAYsvD,EAAUttC,OAAOtuB,MACnD47D,EAAUz7D,OAASo7D,aAGnBM,EAuEZ,SAAwB/7D,EAAKg8D,EAAYxuC,EAAMqb,EAAWigB,EAAmB6G,GAEzE,IAAMnN,EAAI,IAAIkZ,oBAAqB,CAAEO,YAAY,IAG3CC,EAAiB,CAAEC,QAAS,IAC9BH,EAAW3xB,MAAMz4C,QAAU,MAC3BsqE,EAAeE,OAAS,gBAE5B5Z,EAAEmZ,SAASO,GAIX1Z,EAAEoZ,qBAAoB,SAACC,EAAG/hE,GAAQ,MAAO,MAOzC,IAAIuiE,EAAiBL,EAAWM,YAAY,QACrB9oE,IAAnB6oE,IACAA,EAAiB/mE,OAAOsE,KAAKoiE,EAAW3xB,QAC5C,IAAMkyB,EAAc,IAAIhI,IAClBiI,EAAe,IAAIC,IAEzB,SAASC,EAAYl8C,GACjB,GAAImvC,GAAkC,cAAbnvC,EAAKvV,KAE1BuxD,EAAaG,IAAIn8C,EAAK2N,GAAGv1B,WAAY,CAAE4nB,KAAMA,EAAMpZ,IAAK,KAAMw1D,KAAM,SAFxE,CAMA,IAAIC,EAAW,KACfr8C,EAAK2D,WAAW7e,OAAS,GAGzBkb,EAAK2D,WAAW7e,OAAOkmD,cAAgBhrC,EAAK2D,WAAWqnC,cACnD,iBAAkBhrC,EAAK2D,YAAc3D,EAAK2D,WAAWooB,cAA8B,eAAd/rB,EAAKvV,KAC1EuV,EAAK2D,WAAW7e,OAAO8lD,gBAAiBle,QAAoB8uB,EAAW3xB,MAAO7pB,GAAM2D,WAAWinC,eAE/F5qC,EAAK2D,WAAW7e,OAAO8lD,eAAiB5qC,EAAK2D,WAAWinC,eAE5D,IAAM0R,EAhLd,SAA2Bd,EAAYx7C,EAAMxgB,GACzC,IAAM+8D,EAAY/8D,EAAIwM,YAAYgU,EAAKgO,OAAOtuB,MACxC88D,EAAa,EAAIvB,WAAanmE,OAAOsE,KAAK4mB,EAAK2D,WAAW7e,OAAOkmD,eAAe55D,OAAS6pE,WACzFwB,EAAc,EAAIxB,WAAanmE,OAAOsE,KAAK4mB,EAAK2D,WAAW7e,OAAO8lD,gBAAgBx5D,OAAS6pE,WAC3FyB,EAAW/jE,KAAKyJ,IAAIm6D,EAAWC,EAAYC,GAC7CE,EAAY,EAAI1B,WAGdj1D,EAAO,CAAEtG,MAAOg9D,EAAU78D,OAFhC88D,GAAa,EAAI1B,YAiCjB,MA5BkB,eAAdj7C,EAAKvV,MACLzE,EAAKnG,QAAU,EAAIo7D,WACnBj1D,EAAKtG,OAASsG,EAAKnG,QAEdmgB,EAAKvV,KAAKgrB,SAAS,UAInBzV,EAAKvV,KAAKgrB,SAAS,SAHxBzvB,EAAKtG,OAAS,EAAMsG,EAAKnG,OACzBmG,EAAKnG,QAAU,MAMI,YAAdmgB,EAAKvV,MAIS,gBAAduV,EAAKvV,MAHVzE,EAAKtG,OAAgBsG,EAAKnG,OAAS,EAArB,EACdmG,EAAKnG,QAAU,MAMI,WAAdmgB,EAAKvV,OACVzE,EAAKnG,QAAU,EAAIo7D,WACnBj1D,EAAKtG,OAAS,EACdsG,EAAKnG,OAASmG,EAAKtG,MAAQ,GAKxBsG,EAyIc42D,CAAkBpB,EAAYx7C,EAAMxgB,GAMrD,GALAwgB,EAAK2D,WAAW7e,OAAOpF,MAAQ48D,EAAS58D,MACxCsgB,EAAK2D,WAAW7e,OAAOjF,OAASy8D,EAASz8D,OACzCmgB,EAAK2D,WAAW7e,OAAOkpB,MAAQhO,EAAKgO,MAGlB,eAAdhO,EAAKvV,KAAuB,CAE5B,IAAMoyD,EAAW5X,EADjBoX,EAAWrI,EAAcx0D,EAAKwgB,EAAK2D,WAAWqJ,KAAMqb,EAAWigB,EAAmB6G,IAElFnvC,EAAK2D,WAAW7e,OAAOpF,MAAQm9D,EAASn9D,MAAQ,EAAIu7D,WACpDj7C,EAAK2D,WAAW7e,OAAOjF,OAASg9D,EAASh9D,OAAS,EAAIo7D,WAI1D,IAAM7lE,EAAM,IAAI0nE,KAAa98C,EAAKvV,MAAM,CAAEuV,KAAMA,EAAMooB,MAAOi0B,GAAYr8C,EAAK2N,GAAIX,EAAMwuC,EAAW7tC,IAIjF,eAAd3N,EAAKvV,OACL69C,EAAkBtoC,EAAK2D,WAAWqJ,KAAKS,cAAgBr4B,GAG3D,IAvCuB,EAuCnB/D,EAAI,EAvCe,IAyCnBE,MAAMoF,QAAQqpB,EAAK2D,WAAW7e,OAAOkmD,eAC7BhrC,EAAK2D,WAAW7e,OAAOkmD,cAEvBl2D,OAAOsE,KAAK4mB,EAAK2D,WAAW7e,OAAOkmD,gBA5CxB,IA6CvB,2BAA2B,KAAhB/wB,EAAgB,QACjB8iC,EAAO,IAAI1E,KAAU,CAAEhgE,KAAM4hC,GAAS5oC,EAAG27B,EAAMhN,EAAK2N,IAC1Dv4B,EAAI41D,cAAc72D,KAAK4oE,GACvB1rE,GAAK,GAhDc,8BAoDvBA,EAAI,EApDmB,UAqDnBE,MAAMoF,QAAQqpB,EAAK2D,WAAW7e,OAAO8lD,gBAC7B5qC,EAAK2D,WAAW7e,OAAO8lD,eAEvB91D,OAAOsE,KAAK4mB,EAAK2D,WAAW7e,OAAO8lD,iBAxDxB,IAyDvB,2BAA2B,KAAhB3wB,EAAgB,QACjB8iC,EAAO,IAAI1E,KAAU,CAAEhgE,KAAM4hC,GAAS5oC,EAAG27B,EAAMhN,EAAK2N,IAC1Dv4B,EAAIw1D,eAAez2D,KAAK4oE,GACxB1rE,GAAK,GA5Dc,8BAmEvB,GAJA2wD,EAAEgb,QAAQh9C,EAAK2N,GAAIv4B,GACnB2mE,EAAY78D,IAAI8gB,EAAK2N,GAAGv1B,YAGpB4nB,EAAK2N,MAAM6tC,EAAWM,WAAY,CAClC,GAAI97C,EAAK2D,WAAWooB,aAChB,OACJyvB,EAAWM,WAAW97C,EAAK2N,IAAIje,SAAQ,SAAC3N,GAEpCm6D,EADaV,EAAW3xB,MAAM9nC,SAyM1C,OAlMA85D,EAAensD,SAAQ,SAAC3N,GAEpBm6D,EADaV,EAAW3xB,MAAM9nC,OA+BlCy5D,EAAW7xB,MAAMj6B,SAAQ,SAACiyC,EAAMh0B,GAC5B,IA3BJ,SAAiCg0B,GAC7B,IAAMsb,EAAajB,EAAaxmE,IAAImsD,EAAK/6C,KACnCs2D,EAAalB,EAAaxmE,IAAImsD,EAAK/X,KAEzC,GAAIqzB,GAAcC,EAEdD,EAAWb,KAAOc,EAAWd,KAC7Bza,EAAKh+B,WAAWnZ,KAAKmZ,WAAWw5C,UAAW,MACxC,IAAIF,EAIP,OAFAA,EAAWb,KAAKjoE,KAAKwtD,GACrBA,EAAKh+B,WAAWnZ,KAAKmZ,WAAWw5C,UAAW,GACpC,EACJ,GAAID,EAIP,OAFAA,EAAWt2D,IAAM+6C,EACjBA,EAAKh+B,WAAWnZ,KAAKmZ,WAAWw5C,UAAW,GACpC,EAIX,QAAKhO,IAAqBxN,EAAKh+B,WAAWnZ,KAAKmZ,WAAWw5C,UAMtDC,CAAwBzb,KAC5BA,GAAO0b,QAAwB1b,EAAMoa,EAAaP,IAClD,CACA,IAAM1nE,EAAI,IAAIq4C,KAAKwV,EAAKh+B,WAAWnZ,KAAMmjB,EAAIX,EAAMwuC,EAAW7tC,IAC9Dg0B,EAAKh+B,WAAWnZ,KAAKm3C,KAAO7tD,EAC5BA,EAAE62D,cAAgBhJ,EAAKgJ,cACvB72D,EAAEg3D,cAAgBnJ,EAAKmJ,cACvB9I,EAAEsb,QAAQ3b,EAAK/6C,IAAK+6C,EAAK/X,IAAK91C,EAAG65B,OAGrCquC,EAAatsD,SAAQ,SAAA6tD,GACbA,EAAY32D,KACZ22D,EAAYnB,KAAK1sD,SAAQ,SAAA5b,GAErB,IAAM0pE,EAAW1pE,EAAE6vB,WAAWnZ,KAAKm3C,KACnC7tD,EAAE6vB,WAAWnZ,KAAKm3C,KAAO,KACzB,IAAM8b,GAAaC,QAAS5pE,GAC5BA,EAAE6vB,WAAWnZ,KAAKm3C,KAAO6b,EACzBC,EAAW72D,IAAM22D,EAAY32D,IAAIA,IACjC62D,EAAW9S,cAAgB4S,EAAY32D,IAAI+jD,cAC3C8S,EAAW3S,cAAgBh3D,EAAEg3D,cAE7B2S,EAAW95C,WAAWnZ,KAAKmZ,WAAWw5C,UAAW,EAGjD,IAAMQ,GAAeN,QAAwBI,EAAY1B,EAAaP,GACtE,GAAKmC,EAAL,CAGA,IAjB0B,MAiBZ3b,EAAE8G,SAAS6U,EAAa/2D,MAjBZ,IAkB1B,2BAAwB,KAAbg3D,EAAa,QACpB,GAAIA,EAAGva,GAAKvvD,EAAE81C,KAAO4xB,EAAW7xB,MAAMi0B,EAAGvlE,MAAMyyD,eAAiBh3D,EAAEg3D,cAC9D,QApBkB,8BAyB1B0Q,EAAW7xB,MAAMx1C,KAAKspE,GAGtB,IAAM1U,EAAUyS,EAAW7xB,MAAMv4C,OAAS,EACpCysE,EAAgB,IAAI1xB,MAAKuxB,QAASC,EAAah6C,WAAWnZ,MAAOu+C,EAAS/7B,EAAMwuC,EAAW7tC,IACjGkwC,EAAclT,cAAgBgT,EAAahT,cAC3CkT,EAAc/S,cAAgB6S,EAAa7S,cAC3C+S,EAAcrzD,KAAKmZ,WAAWw5C,UAAW,EAEzCnb,EAAEsb,QAAQK,EAAa/2D,IAAK+2D,EAAa/zB,IAAKi0B,EAAe9U,UAKzEmS,WAAalZ,GAIbwZ,EAAW3xB,MAAMn6B,SAAQ,SAACsQ,EAAM2N,GAC5B,IAAMmwC,EAAQ9b,EAAEhiC,KAAK2N,GACrB,GAAKmwC,KAAU3O,GAAqB2O,aAAiBhE,YAArD,CAIA,IAAMx2D,EAAUw6D,EAAMx6D,UAGJ,eAAd0c,EAAKvV,OAELszD,QAAY/9C,EAAK2D,WAAWqJ,KAAM8wC,EAAMtzD,KAAK49B,MAAO,CAChDjvC,EAAGmK,EAAQnK,EAAI8hE,WACf/gE,EAAGoJ,EAAQpJ,EAAI+gE,aAIvB,IAjBmC,EAiB7B+C,EAAU/C,WACVgD,GAAgBhD,WAAa+C,GAAWlpE,OAAOsE,KAAK4mB,EAAK2D,WAAW7e,OAAOkmD,eAAe55D,OAAS4sE,EACnGE,GAAgBjD,WAAa+C,GAAWlpE,OAAOsE,KAAK4mB,EAAK2D,WAAW7e,OAAO8lD,gBAAgBx5D,OAAS4sE,EACtGG,EAAUL,EAAM3kE,EAAI8kE,EAAe,EAAMhD,WAAa,EACtDmD,EAAUN,EAAM3kE,EAAI+kE,EAAe,EAAMjD,WAAa,EArBvB,IAuBnB6C,EAAM9S,eAvBa,IAuBnC,2BAAqC,KAA1B3rD,EAA0B,QACjCA,EAAEK,MAAQu7D,WACV57D,EAAEQ,OAASo7D,WACX57D,EAAElG,EAAIglE,EACNA,GAAWlD,WAAa+C,EACxB3+D,EAAEnF,EAAIoJ,EAAQpJ,GA5BiB,wCA8BnB4jE,EAAMlT,gBA9Ba,IA8BnC,2BAAsC,KAA3BvrD,EAA2B,QAClCA,EAAEK,MAAQu7D,WACV57D,EAAEQ,OAASo7D,WACX57D,EAAElG,EAAIilE,EACNA,GAAWnD,WAAa+C,EACxB3+D,EAAEnF,EAAIoJ,EAAQpJ,EAAI4jE,EAAMj+D,QAnCO,mCAuCvC27D,EAAW7xB,MAAMj6B,SAAQ,SAACiyC,EAAMh0B,GAE5B,GADAg0B,GAAO0b,QAAwB1b,EAAMoa,EAAaP,GAClD,CACA,IAAM6C,EAAQrc,EAAEL,KAAKA,EAAK/6C,IAAK+6C,EAAK/X,IAAKjc,GACzC,MAAK0wC,GAAUlP,IAAwD,IAAnCkP,EAAM7zD,KAAKmZ,WAAWw5C,WAClDhO,GAAqBkP,EAAM7zD,KAAKmZ,WAAWw5C,UADnD,CAOA,IAAImB,EAAW,KAAMC,EAAW,KAChC,GAAI5c,EAAKgJ,cAAe,CAGpB,IAFA,IAAM6T,EAAWxc,EAAEhiC,KAAK2hC,EAAK/6C,KACzB63D,GAAU,EACLptE,EAAI,EAAGA,EAAImtE,EAAS5T,eAAex5D,OAAQC,IAChD,GAAImtE,EAAS5T,eAAev5D,GAAGmZ,KAAKnS,MAAQspD,EAAKgJ,cAAe,CAC5D8T,EAASptE,EACT,MAGJotE,GAAU,IACVJ,EAAM5Y,OAAO,GAAGtsD,EAAIqlE,EAAS5T,eAAe6T,GAAQtlE,EACpDklE,EAAM5Y,OAAO,GAAGvrD,EAAIskE,EAAS5T,eAAe6T,GAAQvkE,EACpDokE,EAAWE,EAAS5T,eAAe6T,IAG3C,GAAI9c,EAAKmJ,cAAe,CAGpB,IAFA,IAAM4T,EAAW1c,EAAEhiC,KAAK2hC,EAAK/X,KACzB60B,GAAU,EACLptE,EAAI,EAAGA,EAAIqtE,EAAS1T,cAAc55D,OAAQC,IAC/C,GAAIqtE,EAAS1T,cAAc35D,GAAGmZ,KAAKnS,MAAQspD,EAAKmJ,cAAe,CAC3D2T,EAASptE,EACT,MAGJotE,GAAU,IACVJ,EAAM5Y,OAAO4Y,EAAM5Y,OAAOr0D,OAAS,GAAG+H,EAAIulE,EAAS1T,cAAcyT,GAAQtlE,EACzEklE,EAAM5Y,OAAO4Y,EAAM5Y,OAAOr0D,OAAS,GAAG8I,EAAIwkE,EAAS1T,cAAcyT,GAAQvkE,EACzEqkE,EAAWG,EAAS1T,cAAcyT,IAI1C,IAAMtmE,EAAIkmE,EAAM5Y,OAAOr0D,OAAS,EACf,OAAbktE,IACAD,EAAM5Y,OAAO,IAAKoF,mBAAcyT,EAAUD,EAAM5Y,OAAOttD,KAC1C,OAAbomE,IACAF,EAAM5Y,OAAOttD,IAAK0yD,mBAAc0T,EAAUF,EAAM5Y,OAAO,KAEhC,GAAvB4Y,EAAM5Y,OAAOr0D,QAAeitE,EAAM5Y,OAAO,GAAGtsD,GAAKklE,EAAM5Y,OAAOttD,GAAGgB,IACjEklE,EAAM5Y,OAAS,CAAC4Y,EAAM5Y,OAAO,GAAI4Y,EAAM5Y,OAAOttD,KAElD,IAAM+sD,EAAKM,EAAyB6Y,GAEpCnZ,EAAG/rD,GAAK+rD,EAAGxlD,MAAQ,EACnBwlD,EAAGhrD,GAAKgrD,EAAGrlD,OAAS,EAEpB8hD,EAAKjiD,MAAQwlD,EAAGxlD,MAChBiiD,EAAK9hD,OAASqlD,EAAGrlD,OACjB8hD,EAAKxoD,EAAI+rD,EAAG/rD,EACZwoD,EAAKznD,EAAIgrD,EAAGhrD,EACZmkE,EAAM3+D,MAAQwlD,EAAGxlD,MACjB2+D,EAAMx+D,OAASqlD,EAAGrlD,OAClBw+D,EAAMllE,EAAI+rD,EAAG/rD,EACbklE,EAAMnkE,EAAIgrD,EAAGhrD,OAGV8nD,EAjXW2c,CAAen/D,EAAKwF,EAAOgoB,EAAMqb,EACvCigB,EAAmB6G,GACvBmM,EAAYrW,EAAqBsW,IAErCD,EAAU57D,OAAS,EAAIs7D,EACvBM,EAAUz7D,QAAU,EAAIm7D,EACxBhZ,EAAEgb,QAAQh4D,EAAM2oB,GAAI,IAAIie,MAAM,CAC1B5mC,MAAOA,EACPF,OAAQw2D,EACRlzB,MAAOmzB,GACRv2D,EAAM2oB,GAAIX,OAGjBA,EAAK2c,MAAMj6B,SAAQ,SAACiyC,EAAMh0B,GACtBq0B,EAAEsb,QAAQ3b,EAAK/6C,IAAK+6C,EAAK/X,IAAK,IAAIuC,KAAKwV,EAAKh+B,WAAWnZ,KAAMmjB,EAAIX,OAGrEkuC,WAAalZ,GAGbh1B,EAAK6c,MAAMn6B,SAAQ,SAAC1K,GAChB,IAAM84D,EAAQ9b,EAAEhiC,KAAKhb,EAAM2oB,IAC3B3oB,EAAM2e,WAAW7e,OAAS,GAC1BE,EAAM2e,WAAW7e,OAAO3L,EAAI2kE,EAAM3kE,EAClC6L,EAAM2e,WAAW7e,OAAO5K,EAAI4jE,EAAM5jE,EAClC8K,EAAM2e,WAAW7e,OAAOpF,MAAQo+D,EAAMp+D,MACtCsF,EAAM2e,WAAW7e,OAAOjF,OAASi+D,EAAMj+D,UAG3CmtB,EAAK2c,MAAMj6B,SAAQ,SAACiyC,GAChB,IAAM0c,EAAQrc,EAAEL,KAAKA,EAAK/6C,IAAK+6C,EAAK/X,KAC9Bsb,EAAKM,EAAyB6Y,GAEpCnZ,EAAG/rD,GAAK+rD,EAAGxlD,MAAQ,EACnBwlD,EAAGhrD,GAAKgrD,EAAGrlD,OAAS,EAEpBw+D,EAAMllE,EAAI+rD,EAAG/rD,EACbklE,EAAMnkE,EAAIgrD,EAAGhrD,EACbmkE,EAAM3+D,MAAQwlD,EAAGxlD,MACjB2+D,EAAMx+D,OAASqlD,EAAGrlD,OAClB8hD,EAAKh+B,WAAW7e,OAAS,GACzB68C,EAAKh+B,WAAW7e,OAAOpF,MAAQwlD,EAAGxlD,MAClCiiD,EAAKh+B,WAAW7e,OAAOjF,OAASqlD,EAAGrlD,OACnC8hD,EAAKh+B,WAAW7e,OAAO3L,EAAI+rD,EAAG/rD,EAC9BwoD,EAAKh+B,WAAW7e,OAAO5K,EAAIgrD,EAAGhrD,EAC9BynD,EAAKh+B,WAAW7e,OAAO2gD,OAAS4Y,EAAM5Y,UAI1Cz4B,EAAK6c,MAAMn6B,SAAQ,SAACgpB,EAAGwP,GACnB,IAAIxP,EAAE/U,WAAWooB,aAAjB,CAGA,IAAM/mC,EAAQg9C,EAAEhiC,KAAKkoB,GACf5kC,EAAU0B,EAAM1B,WACtBs7D,QAAalmC,EAAG1zB,EAAO,CACnB7L,EAAGmK,EAAQnK,EAAI6hE,EACf9gE,EAAGoJ,EAAQpJ,EAAI8gE,QAIvB,IAAM9V,EAAKD,EAAqBjD,GAOhC,OANAA,EAAEtiD,MAAQwlD,EAAGxlD,MACbsiD,EAAEniD,OAASqlD,EAAGrlD,OAGdwoC,EAAUrb,EAAKS,cAAgBu0B,EAExBA,I,mpBCvkEJ,IAAM6c,EAAb,WAEI,WAAY/hD,EAAMgiD,EAAS9xC,GAAwB,IAAlBU,EAAkB,uDAAN,MAAM,eAC/C/6B,KAAK6X,KAAOsS,EACZnqB,KAAKg7B,GAAKmxC,EACVnsE,KAAK+6B,UAAYA,EACjB/6B,KAAKq6B,KAAOA,EACZr6B,KAAKq4D,cAAgB,GACrBr4D,KAAKi4D,eAAiB,GAGtBj4D,KAAKqqD,UAAW,EAChBrqD,KAAKm1C,aAAc,EACnBn1C,KAAKgnE,SAAU,EAEfhnE,KAAKosE,aAfb,yCAkBI,WAEIpsE,KAAK+M,MAAQ/M,KAAK6X,KAAK1F,OAAOpF,MAC9B/M,KAAKkN,OAASlN,KAAK6X,KAAK1F,OAAOjF,SArBvC,kBAwBI,SAAK2qC,EAAUhrC,EAAK2E,MAxBxB,mBA0BI,SAAMqmC,EAAUhrC,EAAKsG,MA1BzB,wBA4BI,SAAW0kC,EAAUhrC,GACbgrC,EAASsjB,aAETtuD,EAAI0F,YACJ1F,EAAI62D,IAAI1jE,KAAKwG,EAAGxG,KAAKuH,EAAG,EAAG,EAAG,EAAIvB,KAAKsO,IAAI,GAC3CzH,EAAI6B,UAAY,MAChB7B,EAAI+F,OACJ/F,EAAI2F,YAAc,MAClB3F,EAAIgG,SACJhG,EAAIw/D,WAAWrsE,KAAKwG,EAAKxG,KAAK+M,MAAQ,EAAM/M,KAAKuH,EAAKvH,KAAKkN,OAAS,EAChElN,KAAK+M,MAAO/M,KAAKkN,WAtCjC,wBA0CI,WACI,OAAOlN,KAAK6X,KAAKmZ,aA3CzB,kBA8CI,WACI,OAAOhxB,KAAK6X,KAAKC,OA/CzB,mBAkDI,WACI,OAAO9X,KAAK6X,KAAKwjB,QAnDzB,wBAsDI,WACI,OAAOr7B,KAAKq7B,UAvDpB,qBA2DI,SAAQ0R,GACJA,EAAUp5B,UAAY,gBA5D9B,qBA+DI,WACI,MAAO,CAAEnN,EAAGxG,KAAKwG,EAAIxG,KAAK+M,MAAQ,EAAGxF,EAAGvH,KAAKuH,EAAIvH,KAAKkN,OAAS,KAhEvE,yBAmEI,WAAkC,IAAtB2qC,EAAsB,4DAAXx3C,EACnB,OAAIL,KAAKqqD,SACDrqD,KAAKgnE,QACEhnE,KAAKssE,eAAez0B,EAAU,4BAChC73C,KAAKm1C,YACHn1C,KAAKssE,eAAez0B,EAAU,gCAE9B73C,KAAKssE,eAAez0B,EAAU,oBAErC73C,KAAKgnE,QACEhnE,KAAKssE,eAAez0B,EAAU,mBAChC73C,KAAKm1C,YACHn1C,KAAKssE,eAAez0B,EAAU,uBAEtC73C,KAAKssE,eAAez0B,EAAU,qBAjF7C,uBAqFI,SAAUrxC,EAAGe,GAAiB,IAAdmpD,EAAc,uDAAV,EAAGxU,EAAO,uDAAH,EACvB,OAAS,GAALwU,GAAe,GAALxU,EACF11C,GAAKxG,KAAKwG,EAAIxG,KAAK+M,MAAQ,GAC9BvG,GAAKxG,KAAKwG,EAAIxG,KAAK+M,MAAQ,GAC3BxF,GAAKvH,KAAKuH,EAAIvH,KAAKkN,OAAS,GAC5B3F,GAAKvH,KAAKuH,EAAIvH,KAAKkN,OAAS,EAEzB1G,GAAKxG,KAAKwG,EAAIxG,KAAK+M,MAAQ,GAC9BvG,EAAIkqD,GAAK1wD,KAAKwG,EAAIxG,KAAK+M,MAAQ,GAC/BxF,GAAKvH,KAAKuH,EAAIvH,KAAKkN,OAAS,GAC5B3F,EAAI20C,GAAKl8C,KAAKuH,EAAIvH,KAAKkN,OAAS,IA/FjD,0BAmGI,SAAa1G,EAAGe,GAAiB,IAAdmpD,EAAc,uDAAV,EAAGxU,EAAO,uDAAH,EAC1B,GAAU,IAANwU,GAAiB,IAANxU,EACX,OAAO,EAEX,IAAMqwB,EAAc/lE,EACdgmE,EAAYhmE,EAAIkqD,EAChB+b,EAAcllE,EACdmlE,EAAYnlE,EAAI20C,EAEhBywB,EAAa3sE,KAAKwG,EAAKxG,KAAK+M,MAAQ,EACpC6/D,EAAW5sE,KAAKwG,EAAKxG,KAAK+M,MAAQ,EAClC8/D,EAAa7sE,KAAKuH,EAAKvH,KAAKkN,OAAS,EACrC4/D,EAAW9sE,KAAKuH,EAAKvH,KAAKkN,OAAS,EAEzC,OAAOq/D,GAAeI,GAClBH,GAAaI,GACbH,GAAeI,GACfH,GAAaI,IApHzB,4BAuHI,SAAej1B,EAAUk1B,GACrB,OAAO9gE,OAAOo6B,iBAAiBwR,EAASv3B,QAAQ0sD,iBAAiBD,GAAcE,WAxHvF,KA6HaC,EAAb,oCACI,WAAY7yC,GAAM,kCACRA,GAAO,EAAGA,GAFxB,yCAKI,cALJ,mBAQI,WACI,OAAOr6B,KAAK6X,KAAKmZ,WAAWtrB,SATpC,GAA0BwmE,GAabjzB,EAAb,kIACI,SAAKpB,EAAUhrC,EAAK2E,GAChB,IAAMb,EAAU3Q,KAAK2Q,UACf4/C,EAAe1Y,EAAS0Y,aAC1B4c,EAAU,CACV3mE,EAAGR,KAAKyJ,IAAIkB,EAAQnK,EAAG+pD,EAAa/pD,GACpCe,EAAGvB,KAAKyJ,IAAIkB,EAAQpJ,EAAGgpD,EAAahpD,GACpCorD,GAAI3sD,KAAKwsB,IAAI7hB,EAAQnK,EAAIxG,KAAK+M,MAC1BwjD,EAAa/pD,EAAI+pD,EAAaG,GAClCkC,GAAI5sD,KAAKwsB,IAAI7hB,EAAQpJ,EAAIvH,KAAKkN,OAC1BqjD,EAAahpD,EAAIgpD,EAAarU,IAEtCixB,EAAQzc,EAAIyc,EAAQxa,GAAKwa,EAAQ3mE,EACjC2mE,EAAQjxB,EAAIixB,EAAQva,GAAKua,EAAQ5lE,EAC5BsF,EAAI2jD,MACL2c,EAAU,CACN3mE,EAAGmK,EAAQnK,EAAGe,EAAGoJ,EAAQpJ,EACzBmpD,EAAG1wD,KAAK+M,MAAOmvC,EAAGl8C,KAAKkN,SAG/BL,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,4BAC9ChrC,EAAI8B,SAASw+D,EAAQ3mE,EAAG2mE,EAAQ5lE,EAAG4lE,EAAQzc,EAAGyc,EAAQjxB,GACtDrvC,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,4BAE1C0Y,EAAa/pD,GAAKmK,EAAQnK,GAAK+pD,EAAahpD,GAAKoJ,EAAQpJ,EAAI+gE,YAC7Dz7D,EAAIwC,SAASrP,KAAKq7B,QAAS1qB,EAAQnK,EAAGmK,EAAQpJ,EAAI+gE,cAGjDtoE,KAAKqqD,UAAYrqD,KAAKm1C,aAAen1C,KAAKgnE,UAC1CmG,EAAQ3mE,IAAMmK,EAAQnK,GACnB2mE,EAAQ5lE,IAAMoJ,EAAQpJ,GACtB4lE,EAAQxa,KAAOhiD,EAAQnK,EAAIxG,KAAK+M,OAChCogE,EAAQva,KAAOjiD,EAAQpJ,EAAIvH,KAAKkN,SACpCL,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GACnChrC,EAAIw/D,WAAWc,EAAQ3mE,EAAG2mE,EAAQ5lE,EAAG4lE,EAAQzc,EAAGyc,EAAQjxB,IAIxDl8C,KAAK6X,KAAKxF,MAAM2e,WAAWooB,eAC3BvsC,EAAI0F,YACJ1F,EAAIkR,OAAO/d,KAAKwG,EAAGxG,KAAKuH,EAAI+gE,YAC5Bz7D,EAAImR,OAAOhe,KAAKwG,EAAGxG,KAAKuH,EAAI+gE,YAC5Bz7D,EAAIgG,SACJhG,EAAI0F,YACJ1F,EAAIkR,OAAO/d,KAAKwG,EAAI8hE,WAAYtoE,KAAKuH,GACrCsF,EAAImR,OAAOhe,KAAKwG,EAAI8hE,WAAYtoE,KAAKuH,GACrCsF,EAAIgG,UAGRhG,EAAI2F,YAAc,UAjD1B,yBAoDI,SAAYqlC,EAAUhrC,EAAK2E,GAAU,WAE3Bb,EAAU3Q,KAAK2Q,UAErB9D,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,4BAC9ChrC,EAAI8B,SAASgC,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACpDL,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,sBAE1CrmC,GAAYxR,KAAKsb,UAAU9J,EAAShL,EAAGgL,EAASjK,KAChDswC,EAASoW,QAAU,SAACvhD,GAAD,OAAO,EAAKuhD,QAAQvhD,OA7DnD,mBA6EI,SAAMmrC,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAE1Bo0D,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEhB,IAAMxC,EAAU3Q,KAAK2Q,UACrB9D,EAAI8B,SAASgC,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QAGpDL,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,IA1F1B,qBA6FI,SAAQtgC,GACJA,EAAU5d,UAAY,UAAYnvB,KAAKq7B,UA9F/C,wBAiGI,WACI,OAAOr7B,KAAK6X,KAAKxF,MAAM2e,aAlG/B,mBAqGI,WACI,OAAOhxB,KAAK6X,KAAKxF,MAAMgpB,QAtG/B,kBAyGI,WACI,OAAOr7B,KAAK6X,KAAKxF,MAAMyF,SA1G/B,GAA2Bo0D,GA8GdhzB,EAAb,kIACI,SAAKrB,EAAUhrC,EAAK2E,GAAoF,IAA1E87D,EAA0E,uDAAhE,0BAA2BC,EAAqC,uDAA3B,0BACnE58D,EAAU3Q,KAAK2Q,UACrB9D,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU01B,GAC9C1gE,EAAI8B,SAASgC,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACpDL,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GACnChrC,EAAIw/D,WAAW17D,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACtDL,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAUy1B,GAC9C,IAAME,EAAQ3gE,EAAIwM,YAAYrZ,KAAKq7B,SAAStuB,MAC5CF,EAAIwC,SAASrP,KAAKq7B,QAASr7B,KAAKwG,EAAIgnE,EAAQ,EAAGxtE,KAAKuH,EAAI+gE,WAAa,KAT7E,yBAYI,SAAYzwB,EAAUhrC,EAAK2E,GAEvB,IAAMb,EAAU3Q,KAAK2Q,UACrB9D,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC9ChrC,EAAI8B,SAASgC,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACpDL,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,6BAjBtD,mBAoBI,SAAMA,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAE1Bo0D,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEhB,IAAMxC,EAAU3Q,KAAK2Q,UACrB9D,EAAI8B,SAASgC,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QAGpDL,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,IAjC1B,mBAoCI,WACI,OAAOrtE,KAAK6X,KAAKwV,KAAKgO,QArC9B,wBAwCI,WACI,OAAOr7B,KAAK6X,KAAKwV,KAAK2D,aAzC9B,kBA4CI,WACI,OAAOhxB,KAAK6X,KAAKwV,KAAKvV,OA7C9B,wBAgDI,WACI9X,KAAK+M,MAAQ/M,KAAK6X,KAAKwV,KAAK2D,WAAW7e,OAAOpF,MAC9C/M,KAAKkN,OAASlN,KAAK6X,KAAKwV,KAAK2D,WAAW7e,OAAOjF,WAlDvD,GAA8Bg/D,GAsDjB1yB,EAAb,+IAEI,SAAkB3sC,GAGd,GAFAA,EAAI0F,YACJ1F,EAAIkR,OAAO/d,KAAK8yD,OAAO,GAAGtsD,EAAGxG,KAAK8yD,OAAO,GAAGvrD,GACjB,IAAvBvH,KAAK8yD,OAAOr0D,OAEZoO,EAAImR,OAAOhe,KAAK8yD,OAAO,GAAGtsD,EAAGxG,KAAK8yD,OAAO,GAAGvrD,OACzC,CACH,IAAI7I,EACJ,IAAKA,EAAI,EAAGA,EAAIsB,KAAK8yD,OAAOr0D,OAAS,EAAGC,IAAK,CACzC,IAAM+uE,GAAMztE,KAAK8yD,OAAOp0D,GAAG8H,EAAIxG,KAAK8yD,OAAOp0D,EAAI,GAAG8H,GAAK,EACjDknE,GAAM1tE,KAAK8yD,OAAOp0D,GAAG6I,EAAIvH,KAAK8yD,OAAOp0D,EAAI,GAAG6I,GAAK,EACvDsF,EAAI8gE,iBAAiB3tE,KAAK8yD,OAAOp0D,GAAG8H,EAAGxG,KAAK8yD,OAAOp0D,GAAG6I,EAAGkmE,EAAIC,GAEjE7gE,EAAI8gE,iBAAiB3tE,KAAK8yD,OAAOp0D,GAAG8H,EAAGxG,KAAK8yD,OAAOp0D,GAAG6I,EAClDvH,KAAK8yD,OAAOp0D,EAAI,GAAG8H,EAAGxG,KAAK8yD,OAAOp0D,EAAI,GAAG6I,MAhBzD,kBAoBI,SAAKswC,EAAUhrC,EAAK2E,GAAU,WACpBw9C,EAAOhvD,KAEbA,KAAK4tE,kBAAkB/gE,GAEvB,IAAI+C,EAAQ5P,KAAKwS,YAAYqlC,GAkB7B,GAjBI73C,KAAKgnE,UACLnvB,EAASoW,QAAU,SAACvhD,GAAD,OAAO,EAAKuhD,QAAQvhD,EAAGmrC,KACxB,MAAlB73C,KAAK+6B,WAAqBnrB,IAAU5P,KAAKssE,eAAez0B,EAAU,qBAClEjoC,EAAQ5P,KAAKssE,eAAez0B,EAAU,4BAE1ChrC,EAAI6B,UAAY7B,EAAI2F,YAAc5C,EAGZ,MAAlB5P,KAAK+6B,WAAiD,MAA5B/6B,KAAK6X,KAAKmZ,WAAW68C,IAC/ChhE,EAAIm3C,YAAY,CAAC,EAAG,IAEpBn3C,EAAIm3C,YAAY,CAAC,EAAG,IAExBn3C,EAAIgG,SAEJhG,EAAIm3C,YAAY,CAAC,EAAG,MAEhBgL,EAAK8D,OAAOr0D,OAAS,GAAzB,CAMI,IAAIC,EADR,GAAIsB,KAAKqqD,UAAoC,SAAxBxS,EAAS4kB,WAE1B,IAAK/9D,EAAI,EAAGA,EAAIsB,KAAK8yD,OAAOr0D,OAAS,EAAGC,IACpCmO,EAAIw/D,WAAWrsE,KAAK8yD,OAAOp0D,GAAG8H,EAAI,EAAGxG,KAAK8yD,OAAOp0D,GAAG6I,EAAI,EAAG,EAAG,GAGtEumE,EAAUjhE,EAAKmiD,EAAK8D,OAAO9D,EAAK8D,OAAOr0D,OAAS,GAAIuwD,EAAK8D,OAAO9D,EAAK8D,OAAOr0D,OAAS,GAAI,MAtDjG,mBAyDI,SAAMo5C,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAChChZ,KAAK4tE,kBAAkB/gE,GAGvB,IAAMkhE,EAAoBlhE,EAAI2F,YACxB46D,EAAkBvgE,EAAI6B,UACtBs/D,EAAgBnhE,EAAIohE,QACpBC,EAAkBrhE,EAAI4F,UACtB46D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI4F,UAAYy7D,EAAkB,EAClCrhE,EAAI6B,UAAYyE,EAChBtG,EAAI2F,YAAcW,EAClBtG,EAAIohE,QAAU,QAEdphE,EAAIgG,SAEA7S,KAAK8yD,OAAOr0D,OAAS,IAEzBqvE,EAAUjhE,EAAK7M,KAAK8yD,OAAO9yD,KAAK8yD,OAAOr0D,OAAS,GAC5CuB,KAAK8yD,OAAO9yD,KAAK8yD,OAAOr0D,OAAS,GAAI,EAAG,EAAG,GAG/CoO,EAAI2F,YAAcu7D,EAClBlhE,EAAI6B,UAAY0+D,EAChBvgE,EAAIohE,QAAUD,EACdnhE,EAAI4F,UAAYy7D,EAChBrhE,EAAI8U,YAAc0rD,KArF1B,qBAwFI,SAAQtgC,EAAW8K,IACf,sDAAc9K,GACd,IAAMohC,EAAYt2B,EAASu2B,gBACrBx0B,EAAO55C,KAAKgxB,aAElB,QAAoB3wB,IAAhBu5C,EAAKy0B,OAAsB,CAC3B,GAAoB,OAAhBz0B,EAAKy0B,OAEL,YADAthC,EAAUn9B,MAAMC,QAAU,QAG9B,IAAIiuB,EAAW8b,EAAK/hC,KACpBimB,IAAYwwC,QAAwB10B,EAAKy0B,OAAQF,GAE7Cv0B,EAAK20B,eACLzwC,GAAY,QAASwwC,QAAwB10B,EAAK20B,aAAcJ,IAEhEv0B,EAAKi0B,MACL/vC,GAAY,iBAAkBwwC,QAAwB10B,EAAKi0B,IAAKM,GAAa,QAEjF,IAAIK,EAAe,KAEfA,EADA50B,EAAKmV,QACUuf,QAAwB10B,EAAKmV,OAAQof,IAErCG,QAAwB10B,EAAK40B,aAAcL,GAE1Dv0B,EAAK60B,QAEDD,EADgB,GAAhBA,IAAsC,GAAjBA,EACN,6BAEA,yBAA2BA,EAAe,KACrC,GAAjBA,IACPA,EAAe,8BAGnB1wC,GAAY,+CAAiD0wC,EAAe,UAC5EzhC,EAAUtZ,UAAYqK,OAEtBiP,EAAU/c,UAAUzjB,IAAI,gCACxBwgC,EAAU5d,UAAYnvB,KAAKq7B,QACtBr7B,KAAKq7B,UACN0R,EAAUn9B,MAAMC,QAAU,UAhI1C,wBAoII,cApIJ,mBAwII,WAEI,YAAoCxP,IAAhCL,KAAK6X,KAAKmZ,WAAWq9C,OACd,IACX,uDA5IR,uBA+II,SAAU7nE,EAAGe,GAAiB,IAAdmpD,EAAc,uDAAV,EAAGxU,EAAO,uDAAH,EAEvB,KAAK,wDAAgB11C,EAAGe,EAAGmpD,EAAGxU,GAC1B,OAAO,EAGX,GAAS,GAALwU,GAAe,GAALxU,EAAQ,CAClB,IAAK,IAAIx9C,EAAI,EAAGA,EAAIsB,KAAK8yD,OAAOr0D,OAAS,EAAGC,IAAK,CAC7C,IAAMka,EAAO81D,EAAe,CAAEloE,EAAGA,EAAGe,EAAGA,GAAKvH,KAAK8yD,OAAOp0D,GAAIsB,KAAK8yD,OAAOp0D,EAAI,IAC5E,GAAIka,GAAQ,EACR,OAAO,EAEf,OAAO,EAEX,OAAO,MA7Jf,GAA0BszD,GAiKbxG,EAAb,kIACI,SAAK7tB,EAAUhrC,EAAK2E,GAAU,IAOtBm9D,EAPsB,OACpBC,EAAmB5uE,KAAK6X,KAAKnS,KAAKkkB,WAAW,QAAU5pB,KAAK6X,KAAKnS,KAAKkkB,WAAW,QACjFjZ,EAAU3Q,KAAK2Q,UAMrB,GALA9D,EAAI0F,YACJs8D,EAAYhiE,EAAK8D,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACxDL,EAAIo6C,YACJp6C,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GAE/B+2B,EAAiB,CACjB,IAAItnC,EAAQtnC,KAAK6X,KAAKnS,KAElB4hC,EADAA,EAAM1d,WAAW,OACT0d,EAAM2K,UAAU,GAEhB3K,EAAM2K,UAAU,GAE5BplC,EAAI4F,UAAY,GAChB5F,EAAIgG,SACJhG,EAAI4F,UAAY,EAChBk8D,EAAY3uE,KAAKssE,eAAez0B,EAAU,iCAE1ChrC,EAAIgG,SACJ87D,EAAY3uE,KAAKssE,eAAez0B,EAAU,8BAE1ChrC,EAAIs2D,MACJwL,EAAYA,EAAU1rC,OAAO,EAAG,IACpCp2B,EAAI6B,UAAYigE,EAEZ9hE,EAAIs2D,MACJt2D,EAAI0F,YACJs8D,EAAYhiE,EAAK8D,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACxDL,EAAIo6C,aAERp6C,EAAI+F,OACA5S,KAAKwS,YAAYqlC,KAAc73C,KAAKssE,eAAez0B,EAAU,qBAC7DA,EAASoW,QAAU,SAACvhD,GAAD,OAAO,EAAKuhD,QAAQvhD,OAnCnD,wBAsCI,WACI,MAAO,KAvCf,wBA0CI,cA1CJ,mBA4CI,WAAU,OAAO1M,KAAK6X,KAAKnS,OA5C/B,qBA8CI,SAAQqnC,IACJ,sDAAcA,GACdA,EAAU/c,UAAUzjB,IAAI,0BACxBwgC,EAAU5d,UAAYnvB,KAAKq7B,YAjDnC,GAA+B6wC,GAqDlB/E,EAAb,kIACI,SAAKtvB,EAAUhrC,EAAK2E,GAChB,IAAMb,EAAU3Q,KAAK2Q,UACrB9D,EAAI0F,YACJs8D,EAAYhiE,EAAK8D,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACxDL,EAAIo6C,YACJp6C,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GAEnC,IAAMi3B,EAAW9uE,KAAKq6B,KAAKrJ,WAAW4H,QAAQ54B,KAAK6X,KAAKwV,KAAK2D,WAAWnZ,MAEpEi3D,GAA8B,WAAlBA,EAASh3D,KACrBjL,EAAIm3C,YAAY,CAAC,EAAG,IAEpBn3C,EAAIm3C,YAAY,CAAC,EAAG,IAIpB8qB,IAA8C,IAAlCA,EAAS99C,WAAT,UACZnkB,EAAI4F,UAAY,EAEhB5F,EAAI4F,UAAY,EAEpB5F,EAAIgG,SACJhG,EAAI4F,UAAY,EAChB5F,EAAIm3C,YAAY,CAAC,EAAG,IAGhB8qB,GAA8B,SAAlBA,EAASh3D,KACrBjL,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,8BAE9ChrC,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAG9ChrC,EAAIs2D,MACJt2D,EAAI0F,YACJs8D,EAAYhiE,EAAK8D,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACxDL,EAAIo6C,aAERp6C,EAAI+F,OACJ/F,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC9C,IAAMk3B,EAAcliE,EAAIwM,YAAYrZ,KAAKq7B,SACzCxuB,EAAIwC,SAASrP,KAAKq7B,QAASr7B,KAAKwG,EAAIuoE,EAAYhiE,MAAQ,EAAK/M,KAAKuH,EAAI+gE,WAAa,KAzC3F,mBA4CI,SAAMzwB,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAE1Bo0D,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEhB,IAAMxC,EAAU3Q,KAAK2Q,UACrB9D,EAAI0F,YACJs8D,EAAYhiE,EAAK8D,EAAQnK,EAAGmK,EAAQpJ,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QACxDL,EAAIo6C,YACJp6C,EAAI+F,OAGJ/F,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,MA5D1B,GAAgCn0B,GAiEnB81B,EAAb,kIACI,SAAKn3B,EAAUhrC,EAAK2E,GAAU,IACtBy9D,EADsB,OAGtBA,EADAjvE,KAAK6X,KAAKwV,KAAK2D,WAAWooB,aACb,kBAAM81B,EAAYriE,EAAK,EAAKrG,EAAG,EAAKe,EAAG,EAAKwF,MAAO,EAAKG,SAExD,kBAAMiiE,EAActiE,EAAK,EAAK8D,UAAW,EAAM,EAAKy+D,aAErEviE,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GAG/B73C,KAAK6X,KAAKwV,KAAKvV,KAAK8R,WAAW,WAC/B/c,EAAIm3C,YAAY,CAAC,EAAG,IAEpBn3C,EAAIm3C,YAAY,CAAC,EAAG,IAExBirB,IACApiE,EAAIgG,SACJhG,EAAIm3C,YAAY,CAAC,EAAG,IACpBn3C,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC1ChrC,EAAIs2D,KACJ8L,IACJpiE,EAAI+F,OACJ/F,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAE9C,IAAMw3B,EAAYrvE,KAAKqvE,YACvBC,EAAiBziE,EAAKgrC,EAAUw3B,EAC5BrvE,KAAKuvE,YAAY13B,GAAW73C,KAAKwG,EAAGxG,KAAKuH,EACzCvH,KAAK+M,MAAO/M,KAAKkN,OACjBsiE,aA7BZ,mBAgCI,SAAM33B,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAE1Bo0D,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEZnT,KAAK6X,KAAKwV,KAAK2D,WAAWooB,aAC1B81B,EAAYriE,EAAK7M,KAAKwG,EAAGxG,KAAKuH,EAAGvH,KAAK+M,MAAO/M,KAAKkN,QAElDiiE,EAActiE,EAAK7M,KAAK2Q,UAAW3Q,KAAMA,KAAKovE,YAClDviE,EAAI+F,OAGJ/F,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,IAhD1B,uBAmDI,WACI,IAAI7hD,EAASxrB,KAAKgxB,aAAaqK,MAC/B,GAAIr7B,KAAKovE,WAAY,CACjB,IAAMK,EAAQzvE,KAAKq6B,KAAK6c,MAAMl3C,KAAK+6B,WAAWmc,MAAMl3C,KAAK6X,KAAKwV,KAAK8rB,aACnE,QAAc94C,IAAVovE,EACAjkD,EAASikD,EAAMz+C,WAAWqK,UACzB,CAED,IAAMq0C,GADNlkD,EAASxrB,KAAK6X,KAAKwV,KAAKgO,OACL/yB,QAAQ,KACvBonE,EAAM,IACNlkD,EAASA,EAAOymB,UAAU,EAAGy9B,KAGzC,OAAOlkD,IAhEf,yBAmEI,SAAYqsB,GACR,IAAKA,EAAS0kB,iBACV,OAAOv8D,KAAKq7B,QAEhB,IAAI7P,EAASxrB,KAAKqvE,YACdM,EAAQ3vE,KAAKgxB,aACjB,GAAIhxB,KAAKovE,WAAY,CACjB,IAAMK,EAAQzvE,KAAKq6B,KAAK6c,MAAMl3C,KAAK+6B,WAAWmc,MAAMl3C,KAAK6X,KAAKwV,KAAK8rB,aACnE,QAAc94C,IAAVovE,EAGA,OAAOzvE,KAAKq7B,QAFZs0C,EAAQF,EAAMz+C,WAMtB,GAFAxF,GAAU,KAENxrB,gBAAgB4vE,GAAgB5vE,gBAAgB6vE,EAChDrkD,GAAUmkD,EAAMG,SAANH,QAAgCA,EAAMI,QAAU,GAAGtqE,eAC1D,CACH,IAAK,IAAI/G,EAAI,EAAGA,EAAIixE,EAAMriD,OAAO7uB,SAAUC,EACvC8sB,GAAUmkD,EAAMriD,OAAO5uB,GAAK,IAC5B8sB,IAAUwkD,QAA0BL,EAAMv2C,MAAMD,OAAOz6B,GAAIm5C,EAASu2B,iBAAmB,KAE3F5iD,EAASA,EAAOymB,UAAU,EAAGzmB,EAAO/sB,OAAS,GAEjD,OAAO+sB,EAAS,QA3FxB,GAA+B0tB,GA+FlBye,EAAb,sIACI,WAAa,OAAO,MADxB,GAA+BqX,GAIlBiB,EAAb,sIACI,WAAa,OAAO,MADxB,GAA8BjB,GAIjBkB,EAAb,wIAA0C,SAAWrjE,GAAOA,EAAIm3C,YAAY,CAAC,EAAG,QAAhF,GAA8B2T,GACjBxG,EAAb,wIAAwC,SAAWtkD,GAAOA,EAAIm3C,YAAY,CAAC,EAAG,QAA9E,GAA6BisB,GAChBL,EAAb,wIAA8C,SAAW/iE,GAAOA,EAAIm3C,YAAY,CAAC,EAAG,QAApF,GAAkC2T,GACrBkY,EAAb,wIAA4C,SAAWhjE,GAAOA,EAAIm3C,YAAY,CAAC,EAAG,QAAlF,GAAiCisB,GACpBE,EAAb,wIAA+C,SAAWtjE,GAAOA,EAAIm3C,YAAY,CAAC,GAAI,QAAtF,GAAmC2T,GACtByY,EAAb,wIAA6C,SAAWvjE,GAAOA,EAAIm3C,YAAY,CAAC,GAAI,QAApF,GAAkCisB,GAErBI,EAAb,kIACI,SAAKx4B,EAAUhrC,EAAK2E,GAChB,IAAMb,EAAU3Q,KAAK2Q,UACrB2/D,EAAYzjE,EAAK8D,EAAS3Q,KAAK+M,MAAO/M,KAAKkN,QAC3CL,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GACnChrC,EAAIgG,SACJhG,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC1ChrC,EAAIs2D,KACJmN,EAAYzjE,EAAK8D,EAAS3Q,KAAK+M,MAAO/M,KAAKkN,QAC/CL,EAAI+F,OACJ/F,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAE9C,IAAMyY,EAAMzY,EAASiZ,eAAeC,mBACpC,IAAKlkD,EAAI2jD,KAAOF,EAAMigB,YAAtB,CAKI,IAHA,IACMC,EADOxwE,KAAKgxB,aAAayO,KAAKhE,YACjB3O,MAAM,MACrB2jD,EAAU,EAAGC,EAAc,EACtBhyE,EAAI,EAAGA,EAAI8xE,EAAM/xE,OAAQC,IAC1B8xE,EAAM9xE,GAAGD,OAASiyE,IAClBD,EAAU/xE,EACVgyE,EAAcF,EAAM9xE,GAAGD,QAG/B,IAAMkyE,EAAU9jE,EAAIoC,KACpBpC,EAAIoC,KAAO,mBACX,IAAM8/D,EAAcliE,EAAIwM,YAAYm3D,EAAMC,IAGpCvjE,EAASsjE,EAAM/xE,OAAS6pE,WAAa,KACrCv7D,EAAQgiE,EAAYhiE,MAEpB6jE,EAAK1jE,GADkC,GACxBlN,KAAKkN,QACpB2jE,EAAK9jE,GAFY,GAEH/M,KAAK+M,OACnB+jE,EAAW9qE,KAAKwsB,IAAI,GAAKo+C,EAAI,GAAKC,GAClCE,EAAeD,EAAW,EAEhCjkE,EAAIoC,KAAO6hE,EAAW,iBAGtB,IADA,IAAMvpE,EAAIvH,KAAKuH,EAAIwpE,GAAiBP,EAAM/xE,OAAS,GAAK,EAAKqyE,EAAW,KAC/DpyE,EAAI,EAAGA,EAAI8xE,EAAM/xE,OAAQC,IAC9BmO,EAAIwC,SAASmhE,EAAM9xE,GAAIsB,KAAKwG,EAVT,GAUcxG,KAAK+M,MAA0B,EAC5DxF,EAAI7I,EAAIoyE,EAAW,MAE3BjkE,EAAIoC,KAAO0hE,MA/Bf,CAmCA,IAAM5B,EAAcliE,EAAIwM,YAAYrZ,KAAKq7B,SACzCxuB,EAAIwC,SAASrP,KAAKq7B,QAASr7B,KAAKwG,EAAIuoE,EAAYhiE,MAAQ,EAAK/M,KAAKuH,EAAI+gE,WAAa,MAjD3F,mBAoDI,SAAMzwB,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAE1Bo0D,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEhBm9D,EAAYzjE,EAAK7M,KAAK2Q,UAAW3Q,KAAK+M,MAAO/M,KAAKkN,QAClDL,EAAI+F,OAGJ/F,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,MAjE1B,GAA6Bn0B,GAsEhB83B,EAAb,kIACI,SAAKn5B,EAAUhrC,EAAK2E,GAAU,WACpBb,EAAU3Q,KAAK2Q,UACfs+D,EAAa,WACfpiE,EAAI0F,YACJ1F,EAAIkR,OAAOpN,EAAQnK,EAAGmK,EAAQpJ,GAC9BsF,EAAImR,OAAOrN,EAAQnK,EAAI,EAAKuG,MAAQ,EAAG4D,EAAQpJ,EAAI,EAAK2F,QACxDL,EAAImR,OAAOrN,EAAQnK,EAAI,EAAKuG,MAAO4D,EAAQpJ,GAC3CsF,EAAImR,OAAOrN,EAAQnK,EAAGmK,EAAQpJ,GAC9BsF,EAAIo6C,aAERp6C,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GACnCo3B,IACApiE,EAAIgG,SACJhG,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC1ChrC,EAAIs2D,KACJ8L,IACJpiE,EAAI+F,OACJ/F,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAE9C,IAAMw3B,EAAYrvE,KAAKq7B,QAAQ4W,UAAU,EAAGjyC,KAAKq7B,QAAQ/yB,QAAQ,MACjEgnE,EAAiBziE,EAAKgrC,EAAUw3B,EAC5BrvE,KAAKq7B,QAASr7B,KAAKwG,EAAGxG,KAAKuH,EAAkB,GAAdvH,KAAKkN,OACpClN,KAAK+M,MAAO/M,KAAKkN,OACjBsiE,aAxBZ,mBA2BI,SAAM33B,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAE1Bo0D,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEhB,IAAMxC,EAAU3Q,KAAK2Q,UACrB9D,EAAI0F,YACJ1F,EAAIkR,OAAOpN,EAAQnK,EAAGmK,EAAQpJ,GAC9BsF,EAAImR,OAAOrN,EAAQnK,EAAIxG,KAAK+M,MAAQ,EAAG4D,EAAQpJ,EAAIvH,KAAKkN,QACxDL,EAAImR,OAAOrN,EAAQnK,EAAIxG,KAAK+M,MAAO4D,EAAQpJ,GAC3CsF,EAAImR,OAAOrN,EAAQnK,EAAGmK,EAAQpJ,GAC9BsF,EAAIo6C,YACJp6C,EAAI+F,OAGJ/F,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,MA9C1B,GAA4Bn0B,GAmDfuW,EAAb,kIACI,SAAK5X,EAAUhrC,EAAK2E,GAChB,GAAIxR,KAAK6X,KAAKwV,KAAK2D,WAAWooB,aAA9B,CACI,IAAMzoC,EAAU3Q,KAAK2Q,UACrB2/D,EAAYzjE,EAAK8D,EAAS3Q,KAAK+M,MAAO/M,KAAKkN,QAC3CL,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GACnChrC,EAAIgG,SACJy9D,EAAYzjE,EAAK,CAAErG,EAAGmK,EAAQnK,EAAI,IAAKe,EAAGoJ,EAAQpJ,EAAI,KAAOvH,KAAK+M,MAAQ,EAAG/M,KAAKkN,OAAS,GAC3FL,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GACnChrC,EAAIgG,SACJhG,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC1ChrC,EAAIs2D,KACJmN,EAAYzjE,EAAK,CAAErG,EAAGmK,EAAQnK,EAAI,IAAKe,EAAGoJ,EAAQpJ,EAAI,KAAOvH,KAAK+M,MAAQ,EAAG/M,KAAKkN,OAAS,GAC/FL,EAAI+F,OACJ/F,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC9C,IAAMxc,EAAQr7B,KAAK6X,KAAKwV,KAAK2D,WAAWqK,MAClC0zC,EAAcliE,EAAIwM,YAAYgiB,GACpCxuB,EAAIwC,SAASgsB,EAAOr7B,KAAKwG,EAAIuoE,EAAYhiE,MAAQ,EAAK/M,KAAKuH,EAAI+gE,WAAa,QAKhF,mDAAWzwB,EAAUhrC,EAAK2E,EAAU,iCAChC,kCAGJoyD,EAAU/rB,EAAUhrC,EAAK7M,KAAK6X,KAAK49B,MAAOjkC,KA1BlD,mBA6BI,SAAMqmC,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAChC,GAAIhZ,KAAK6X,KAAKwV,KAAK2D,WAAWooB,aAAc,CAExC,IAAMg0B,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEhBm9D,EAAYzjE,EAAK7M,KAAK2Q,UAAW3Q,KAAK+M,MAAO/M,KAAKkN,QAClDL,EAAI+F,OAGJ/F,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,OAElB,oDAAYx1B,EAAUhrC,EAAKsG,EAAO6F,KA7C9C,wBAiDI,WACI,GAAIhZ,KAAK6X,KAAKwV,KAAK2D,WAAWooB,aAAc,CACxC,IAAMwwB,EAAY5pE,KAAK6X,KAAKwV,KAAK2D,WAAWqK,MAAM58B,OAAS6pE,WAAa,GAClEuB,EAAa,EAAIvB,WAAanmE,OAAOsE,KAAKzG,KAAK6X,KAAKwV,KAAK2D,WAAWqnC,eAAe55D,OAAS6pE,WAC5FwB,EAAc,EAAIxB,WAAanmE,OAAOsE,KAAKzG,KAAK6X,KAAKwV,KAAK2D,WAAWinC,gBAAgBx5D,OAAS6pE,WAC9FyB,EAAW/jE,KAAKyJ,IAAIm6D,EAAWC,EAAYC,GAC7CE,EAAY,EAAI1B,WAGdj1D,EAAO,CAAEtG,MAAOg9D,EAAU78D,OAFhC88D,GAAa,EAAI1B,YAGjBj1D,EAAKtG,OAAgBsG,EAAKnG,OAAS,EAArB,EACdmG,EAAKnG,QAAU,KAEflN,KAAK+M,MAAQsG,EAAKtG,MAClB/M,KAAKkN,OAASmG,EAAKnG,YAEnBlN,KAAK+M,MAAQ/M,KAAK6X,KAAKwV,KAAK2D,WAAW7e,OAAOpF,MAC9C/M,KAAKkN,OAASlN,KAAK6X,KAAKwV,KAAK2D,WAAW7e,OAAOjF,SAlE3D,mBAuEI,WAAU,MAAO,OAvErB,GAAgCgsC,GAmIzB,SAAS0qB,EAAU/rB,EAAUhrC,EAAKokE,EAAYz/D,GACjD,IAAM8+C,EAAMzY,EAASiZ,eAAeC,mBAG9B1B,EAAI4hB,IACLpkE,EAAI2jD,KAAOF,EAAM4gB,WAClB7hB,EAAErY,QAAQj6B,SAAQ,SAAA5b,GACd,IAAM6tD,EAAOK,EAAEL,KAAK7tD,GACpB6tD,EAAKl8C,KAAK+kC,EAAUhrC,EAAK2E,GACzBw9C,EAAKmM,WAAWtjB,EAAUhrC,MAIlC,IAAM0jD,EAAe1Y,EAAS0Y,aAG9BlB,EAAEnY,QAAQn6B,SAAQ,SAAApW,GACd,IAAM0mB,EAAOgiC,EAAEhiC,KAAK1mB,GAEpB,GAAIkG,EAAI2jD,MAAQF,GAAOG,WAAapjC,EAAKtgB,MAAQujD,EAAMG,WAGnD,OAFApjC,EAAK8jD,YAAYt5B,EAAUhrC,EAAK2E,QAChC6b,EAAK8tC,WAAWtjB,EAAUhrC,GAI9B,IAAIA,EAAI2jD,KAAQnjC,EAAK/R,UAAUi1C,EAAa/pD,EAAG+pD,EAAahpD,EAAGgpD,EAAaG,EAAGH,EAAarU,GAA5F,CAGA7uB,EAAKva,KAAK+kC,EAAUhrC,EAAK2E,GACzB6b,EAAK8tC,WAAWtjB,EAAUhrC,GAE1B,IAAM2rD,EAAKnrC,EAAKxV,KAAK49B,MAErB,IAAKpoB,EAAKxV,KAAKxF,MAAM2e,WAAWooB,cAAgBof,EAAI,CAuBhD,GAtBAA,EAAGthB,QAAQn6B,SAAQ,SAAApW,GACf,IAAMnB,EAAIgzD,EAAGnrC,KAAK1mB,GAElB,IAAIkG,EAAI2jD,KAAQhrD,EAAE8V,UAAUi1C,EAAa/pD,EAAG+pD,EAAahpD,EAAGgpD,EAAaG,EAAGH,EAAarU,GAAzF,CAEA,GAAIrvC,EAAI2jD,KAAOF,GAAOK,SAGlB,OAFAnrD,EAAE2rE,YAAYt5B,EAAUhrC,EAAK2E,QAC7BhM,EAAE21D,WAAWtjB,EAAUhrC,GAI3BrH,EAAEsN,KAAK+kC,EAAUhrC,EAAK2E,GACtBhM,EAAE21D,WAAWtjB,EAAUhrC,GACvBrH,EAAE6yD,cAAct7C,SAAQ,SAAArQ,GACpBA,EAAEoG,KAAK+kC,EAAUhrC,EAAK2E,GACtB9E,EAAEyuD,WAAWtjB,EAAUhrC,MAE3BrH,EAAEyyD,eAAel7C,SAAQ,SAAArQ,GACrBA,EAAEoG,KAAK+kC,EAAUhrC,EAAK2E,GACtB9E,EAAEyuD,WAAWtjB,EAAUhrC,UAG3BA,EAAI2jD,KAAOF,GAAO4gB,SAClB,OACJ1Y,EAAGxhB,QAAQj6B,SAAQ,SAAA5b,GACf,IAAM6tD,EAAOwJ,EAAGxJ,KAAK7tD,GACjB0L,EAAI2jD,MAAQxB,EAAK1zC,UAAUi1C,EAAa/pD,EAAG+pD,EAAahpD,EAAGgpD,EAAaG,EAAGH,EAAarU,KAE5F8S,EAAKl8C,KAAK+kC,EAAUhrC,EAAK2E,GACzBw9C,EAAKmM,WAAWtjB,EAAUhrC,YAOnC,SAASu+D,EAAY/wC,EAAM+2C,EAAYtxD,GAC1Cua,EAAK6c,MAAMn6B,SAAQ,SAAC1K,EAAO2oB,GACvB,IAAMq0B,EAAI+hB,EAAW/jD,KAAK2N,GAC1Bq0B,EAAE7oD,GAAKsZ,EAAOtZ,EACd6oD,EAAE9nD,GAAKuY,EAAOvY,EACT8K,EAAM2e,WAAWooB,cAClB6yB,EAAa55D,EAAOg9C,EAAGvvC,MAE/Bua,EAAK2c,MAAMj6B,SAAQ,SAAC5b,EAAGkwE,GACnB,IAAMriB,EAAOoiB,EAAWpiB,KAAK7tD,EAAE8S,IAAK9S,EAAE81C,KACtC+X,EAAKxoD,GAAKsZ,EAAOtZ,EACjBwoD,EAAKznD,GAAKuY,EAAOvY,EACjBynD,EAAK8D,OAAO/1C,SAAQ,SAACjZ,GACjBA,EAAE0C,GAAKsZ,EAAOtZ,EACd1C,EAAEyD,GAAKuY,EAAOvY,QAMnB,SAAS0kE,EAAa55D,EAAOk9C,EAAazvC,GAC7C,IAAMspD,EAAc,IAAIhI,IAExB/uD,EAAM6kC,MAAMn6B,SAAQ,SAACvX,EAAGgwC,GACpB,IAAMnoB,EAAOkiC,EAAY13C,KAAK49B,MAAMpoB,KAAKmoB,GACpCnoB,IACL+7C,EAAY78D,IAAIipC,EAAI/vC,YAEpB4nB,EAAK7mB,GAAKsZ,EAAOtZ,EACjB6mB,EAAK9lB,GAAKuY,EAAOvY,EACjB8lB,EAAKgrC,cAAct7C,SAAQ,SAAArQ,GACvBA,EAAElG,GAAKsZ,EAAOtZ,EACdkG,EAAEnF,GAAKuY,EAAOvY,KAElB8lB,EAAK4qC,eAAel7C,SAAQ,SAAArQ,GACxBA,EAAElG,GAAKsZ,EAAOtZ,EACdkG,EAAEnF,GAAKuY,EAAOvY,KAGU,eAAxB8lB,EAAKxV,KAAKwV,KAAKvV,MACfszD,EAAY/9C,EAAKxV,KAAKwV,KAAK2D,WAAWqJ,KAAMhN,EAAKxV,KAAK49B,MAAO31B,OAErEzN,EAAM2kC,MAAMj6B,SAAQ,SAAC5b,EAAGkwE,GAEpB,GADAlwE,GAAIupE,QAAwBvpE,EAAGioE,EAAa/2D,GAC5C,CACA,IAAM28C,EAAOO,EAAY13C,KAAK49B,MAAMuZ,KAAK7tD,EAAE8S,IAAK9S,EAAE81C,IAAKo6B,GAClDriB,IACLA,EAAKxoD,GAAKsZ,EAAOtZ,EACjBwoD,EAAKznD,GAAKuY,EAAOvY,EACjBynD,EAAK8D,OAAO/1C,SAAQ,SAACjZ,GACjBA,EAAE0C,GAAKsZ,EAAOtZ,EACd1C,EAAEyD,GAAKuY,EAAOvY,UAQnB,SAAS+nE,EAAiBziE,EAAKgrC,EAAUy5B,EAAUC,EACtD/qE,EAAGe,EAAGmpD,EAAGxU,EAAGs1B,GACU,IADCC,EACD,uDADiB,GACvCC,EAAsB,0DAAJ,GACZphB,EAAMzY,EAASiZ,eAAeC,mBAChC11B,EAAQk2C,EACRT,EAAW9qE,KAAKwsB,IAAI89B,EAAMohB,EAAiBD,GAC3C1vD,EAAUumD,WAAa,EACrBqI,EAAU9jE,EAAIoC,KAChBpC,EAAI2jD,KAAOF,GAAOkhB,IAClB3kE,EAAIoC,KAAO6hE,EAAW,gBACtBz1C,EAAQi2C,EACRvvD,EAAU+uD,EAAW,EAAM50B,EAAI,GAGnC,IAAM6yB,EAAcliE,EAAIwM,YAAYgiB,GAChCs2C,EAAK5C,EAAYhiE,MACjBF,EAAI2jD,KAAOF,GAAOkhB,GAAaG,EAAKjhB,IACpCogB,GAAuBa,EAAKjhB,EAC5B7jD,EAAIoC,KAAO6hE,EAAW,gBACtB/uD,EAAU+uD,EAAW,EAAM50B,EAAI,EAC/By1B,EAAKjhB,GAGT7jD,EAAIwC,SAASgsB,EAAO70B,EAAImrE,EAAK,EAAKpqE,EAAIwa,GAElClV,EAAI2jD,KAAOF,GAAOkhB,IAClB3kE,EAAIoC,KAAO0hE,GAGZ,SAASzB,EAAYriE,EAAKrG,EAAGe,EAAGmpD,EAAGxU,EAAGp8B,GACzC,IAAMnP,EAAU,CAAEnK,EAAGA,EAAIkqD,EAAI,EAAKnpD,EAAGA,EAAI20C,EAAI,GACvC01B,EAAS11B,EAAI,EACnBrvC,EAAI0F,YACJ1F,EAAIkR,OAAOpN,EAAQnK,EAAGe,GACtBsF,EAAImR,OAAOrN,EAAQnK,EAAIorE,EAAQjhE,EAAQpJ,GACvCsF,EAAImR,OAAOrN,EAAQnK,EAAIkqD,EAAIkhB,EAAQjhE,EAAQpJ,GAC3CsF,EAAImR,OAAOrN,EAAQnK,EAAIkqD,EAAGnpD,GAC1BsF,EAAImR,OAAOrN,EAAQnK,EAAIkqD,EAAIkhB,EAAQjhE,EAAQpJ,EAAI20C,GAC/CrvC,EAAImR,OAAOrN,EAAQnK,EAAIorE,EAAQjhE,EAAQpJ,EAAI20C,GAC3CrvC,EAAImR,OAAOrN,EAAQnK,EAAGe,GACtBsF,EAAIo6C,YAGD,SAASqpB,EAAYzjE,EAAK8D,EAAS5D,EAAOG,GAC7C,IAAM2kE,EAAS3kE,EAAS,EACxBL,EAAI0F,YACJ1F,EAAIkR,OAAOpN,EAAQnK,EAAGmK,EAAQpJ,EAAIsqE,GAClChlE,EAAImR,OAAOrN,EAAQnK,EAAIqrE,EAAQlhE,EAAQpJ,GACvCsF,EAAImR,OAAOrN,EAAQnK,EAAIuG,EAAQ8kE,EAAQlhE,EAAQpJ,GAC/CsF,EAAImR,OAAOrN,EAAQnK,EAAIuG,EAAO4D,EAAQpJ,EAAIsqE,GAC1ChlE,EAAImR,OAAOrN,EAAQnK,EAAIuG,EAAO4D,EAAQpJ,EAAI,EAAIsqE,GAC9ChlE,EAAImR,OAAOrN,EAAQnK,EAAIuG,EAAQ8kE,EAAQlhE,EAAQpJ,EAAI2F,GACnDL,EAAImR,OAAOrN,EAAQnK,EAAIqrE,EAAQlhE,EAAQpJ,EAAI2F,GAC3CL,EAAImR,OAAOrN,EAAQnK,EAAGmK,EAAQpJ,EAAI,EAAIsqE,GACtChlE,EAAImR,OAAOrN,EAAQnK,EAAGmK,EAAQpJ,EAAI,EAAIsqE,GACtChlE,EAAIo6C,YAID,SAAS4nB,EAAYhiE,EAAKrG,EAAGe,EAAGmpD,EAAGxU,GACtC,IAAM41B,EAAQ,SACVC,EAAMrhB,EAAI,EAAKohB,EACfE,EAAM91B,EAAI,EAAK41B,EACfG,EAAKzrE,EAAIkqD,EACTwhB,EAAK3qE,EAAI20C,EACTuxB,EAAKjnE,EAAIkqD,EAAI,EACbgd,EAAKnmE,EAAI20C,EAAI,EAEjBrvC,EAAIkR,OAAOvX,EAAGknE,GACd7gE,EAAIslE,cAAc3rE,EAAGknE,EAAKsE,EAAIvE,EAAKsE,EAAIxqE,EAAGkmE,EAAIlmE,GAC9CsF,EAAIslE,cAAc1E,EAAKsE,EAAIxqE,EAAG0qE,EAAIvE,EAAKsE,EAAIC,EAAIvE,GAC/C7gE,EAAIslE,cAAcF,EAAIvE,EAAKsE,EAAIvE,EAAKsE,EAAIG,EAAIzE,EAAIyE,GAChDrlE,EAAIslE,cAAc1E,EAAKsE,EAAIG,EAAI1rE,EAAGknE,EAAKsE,EAAIxrE,EAAGknE,GAG3C,SAASI,EAAUjhE,EAAKulE,EAAIC,EAAIh/D,GAA+B,IAAzByM,EAAyB,uDAAhB,EAAGpC,EAAa,uDAAH,EAC/D7Q,EAAI4B,OAEJ,IAAM6nD,EAAK+b,EAAG7rE,EAAI4rE,EAAG5rE,EACf+vD,EAAK8b,EAAG9qE,EAAI6qE,EAAG7qE,EACrBsF,EAAIoX,UAAUouD,EAAG7rE,EAAG6rE,EAAG9qE,GACvBsF,EAAIsX,OAAOne,KAAKu/C,MAAMgR,EAAID,IAG1BzpD,EAAI0F,YACJ1F,EAAIkR,OAAO,EAAIL,EAAUoC,EAAQ,GACjCjT,EAAImR,QAAU,EAAI3K,EAAQqK,EAAWoC,IAAUzM,EAAOqK,IACtD7Q,EAAImR,QAAU,EAAI3K,EAAQqK,EAAWoC,EAASzM,EAAOqK,GACrD7Q,EAAIo6C,YACJp6C,EAAI+F,OACJ/F,EAAI+B,UAGD,SAASugE,EAActiE,EAAK8D,EAAS0c,GAAwB,IAAlBilD,EAAkB,wDAChEzlE,EAAI0F,YACA+/D,GACAzlE,EAAIkR,OAAOpN,EAAQnK,EAAGmK,EAAQpJ,GAC9BsF,EAAImR,OAAOrN,EAAQnK,EAAI6mB,EAAKtgB,MAAO4D,EAAQpJ,GAC3CsF,EAAImR,OAAOrN,EAAQnK,EAAI6mB,EAAKtgB,MAAQsgB,EAAKngB,OAAQyD,EAAQpJ,EAAI8lB,EAAKngB,QAClEL,EAAImR,OAAOrN,EAAQnK,EAAI6mB,EAAKngB,OAAQyD,EAAQpJ,EAAI8lB,EAAKngB,QACrDL,EAAImR,OAAOrN,EAAQnK,EAAGmK,EAAQpJ,KAE9BsF,EAAIkR,OAAOpN,EAAQnK,EAAGmK,EAAQpJ,EAAI8lB,EAAKngB,QACvCL,EAAImR,OAAOrN,EAAQnK,EAAI6mB,EAAKtgB,MAAO4D,EAAQpJ,EAAI8lB,EAAKngB,QACpDL,EAAImR,OAAOrN,EAAQnK,EAAI6mB,EAAKtgB,MAAQsgB,EAAKngB,OAAQyD,EAAQpJ,GACzDsF,EAAImR,OAAOrN,EAAQnK,EAAI6mB,EAAKngB,OAAQyD,EAAQpJ,GAC5CsF,EAAImR,OAAOrN,EAAQnK,EAAGmK,EAAQpJ,EAAI8lB,EAAKngB,SAE3CL,EAAIo6C,YAID,SAASynB,EAAe5qE,EAAGyuE,EAAOC,GACrC,IAAMlc,EAAMkc,EAAMhsE,EAAI+rE,EAAM/rE,EACtB+vD,EAAMic,EAAMjrE,EAAIgrE,EAAMhrE,EACtBkrE,EAAMlc,EAAKzyD,EAAE0C,EAAI8vD,EAAKxyD,EAAEyD,EAAIirE,EAAMhsE,EAAI+rE,EAAMhrE,EAAIirE,EAAMjrE,EAAIgrE,EAAM/rE,EAEtE,OAAOR,KAAKgE,IAAIyoE,GAAOzsE,KAAKC,KAAKswD,EAAKA,EAAKD,EAAKA,GAQ7C,SAASlG,EAAa56C,GAMzB,OALIA,EAAM,IACNA,EAAM,GACNA,EAAM,IACNA,EAAM,GAEH,QADkB,KAAX,EAAIA,IAAY/P,SAAS,IACjB,aAGnB,IAAM0kE,EAAe,CACxB+B,cAAagB,OAAMj0B,QAAOC,WAAUM,OAAMksB,YAAWyB,aAAY6H,YAAWrX,YAAWsY,WAAUC,WAAU/e,UAC3Gye,eAAcC,cAAaQ,UAASW,SAAQb,gBAAeC,eAAc3gB,aAAYijB,YAlUzF,mIACI,SAAM7lE,GACF,IAAM+kE,EAAS5xE,KAAKkN,OAAS,EACvByD,EAAU3Q,KAAK2Q,UACrB9D,EAAI0F,YACJ1F,EAAIkR,OAAOpN,EAAQnK,EAAGmK,EAAQpJ,GAC9BsF,EAAImR,OAAOrN,EAAQnK,EAAIxG,KAAK+M,MAAQ6kE,EAAQjhE,EAAQpJ,GACpDsF,EAAImR,OAAOrN,EAAQnK,EAAIxG,KAAK+M,MAAO4D,EAAQpJ,EAAIqqE,GAC/C/kE,EAAImR,OAAOrN,EAAQnK,EAAIxG,KAAK+M,MAAO4D,EAAQpJ,EAAIvH,KAAKkN,QACpDL,EAAImR,OAAOrN,EAAQnK,EAAGmK,EAAQpJ,EAAIvH,KAAKkN,QACvCL,EAAIo6C,cAVZ,oBAaI,SAAOp6C,GACH,IAAM+kE,EAAS5xE,KAAKkN,OAAS,EACvByD,EAAU3Q,KAAK2Q,UACrB9D,EAAI0F,YACJ1F,EAAIkR,OAAOpN,EAAQnK,EAAIxG,KAAK+M,MAAQ6kE,EAAQjhE,EAAQpJ,GACpDsF,EAAImR,OAAOrN,EAAQnK,EAAIxG,KAAK+M,MAAQ6kE,EAAQjhE,EAAQpJ,EAAIqqE,GACxD/kE,EAAImR,OAAOrN,EAAQnK,EAAIxG,KAAK+M,MAAO4D,EAAQpJ,EAAIqqE,KAnBvD,kBAsBI,SAAK/5B,EAAUhrC,EAAK2E,GAChB3E,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC9C73C,KAAK2yE,MAAM9lE,GACXA,EAAI+F,OACJ/F,EAAI2F,YAAcxS,KAAKwS,YAAYqlC,GACnC73C,KAAK2yE,MAAM9lE,GACXA,EAAIgG,SACJ7S,KAAK4yE,OAAO/lE,GACZA,EAAIgG,SACJhG,EAAI6B,UAAY1O,KAAKssE,eAAez0B,EAAU,2BAC9C,IAAM21B,EAAQ3gE,EAAIwM,YAAYrZ,KAAKq7B,SAAStuB,MAC5CF,EAAIwC,SAASrP,KAAKq7B,QAASr7B,KAAKwG,EAAIgnE,EAAQ,EAAGxtE,KAAKuH,EAAI+gE,WAAa,KAjC7E,mBAoCI,SAAMzwB,EAAUhrC,EAAKsG,GAAsB,IAAf6F,EAAe,uDAAP,MAE1Bo0D,EAAkBvgE,EAAI6B,UACtB2+D,EAAaxgE,EAAI8U,YAEvB9U,EAAI8U,YAAc3I,EAClBnM,EAAI6B,UAAYyE,EAEhBnT,KAAK2yE,MAAM9lE,GACXA,EAAI+F,OAGJ/F,EAAI6B,UAAY0+D,EAChBvgE,EAAI8U,YAAc0rD,MAjD1B,GAAiCn0B,IAsUjC/2C,OAAOwxB,OAAO9M,WAAYsjD,I,uPC3rCnB,IAAM0I,EAAiB,CAC1BC,aA4IJ,WACI,IAAMx8D,EAAQ3J,SAAS44B,eAAe,WAChCwtC,EAAMpmE,SAAS44B,eAAe,WAE9BytC,EAAO,SAAC7xE,GACVwL,SAASsmE,UAAYtmE,SAASsmE,UAAUC,QAAUjnE,OAAOknE,eAAeC,kBACxE98D,EAAM1G,MAAM7C,MAAQ/G,KAAKyJ,IAAMtO,EAAEkyE,KAAKC,WAAanyE,EAAEoyE,MAAS,IAAM,MAGxER,EAAIhyD,iBAAiB,aAAa,WAC9BpU,SAASoU,iBAAiB,YAAaiyD,GACvCrmE,SAASoU,iBAAiB,WAAW,WACjCpU,SAASqU,oBAAoB,YAAagyD,UAvJlDQ,uBACAC,kBACAC,uBACAC,cAoIJ,WACIhnE,SAAS44B,eAAe,WAAW31B,MAAMC,QAAU,QApInD+jE,WAyDJ,SAAoB/7B,EAAUxd,GAC1Bm5C,EAAqB,gBAErB,IAAMK,EAAUH,IAChBG,EAAQpgD,UAAY,GAGpB,IAAM/jB,EAAI/C,SAASC,cAAc,OACjC8C,EAAEiE,UAAY,sBACdjE,EAAE+jB,WAAYumC,OAAd,0GAA+GniB,EAASxd,KAAKrJ,WAAWtrB,MACxIgK,EAAEsqB,QAAU,kBAAM6d,EAASqd,gBAC3B2e,EAAQ9jE,YAAYL,GAEpB,IAAMokE,EAAQ,CAACD,IAGfrS,QAAqBnnC,GAAM,SAAChN,EAAMlY,GAE9B,GAAIkY,EAAKvV,OAAOgrB,SAAS,SAAWzV,EAAKxV,KAAKwV,KAAK8rB,aAAe,EAE9D,OADA26B,EAAMtyE,KAAK,OACJ,EAIX,IAAMkO,EAAI/C,SAASC,cAAc,OACjC8C,EAAEiE,UAAY,sBACd,IAAIylC,EAAe/rB,EAAK2D,aAAaooB,aACrCA,OAAiC/4C,IAAjB+4C,GAAsCA,EACtD,IAAI26B,EAAY1mD,EAAKvV,OAgCrB,OA7BIuV,EAAKvV,OAAOgrB,SAAS,eAEaziC,IADpBgtB,EAAKgN,KAAK6c,MAAM7pB,EAAK0N,WACzBouC,WAAW97C,EAAK2N,MACtB+4C,EAAYA,EAAUjvE,MAAM,GAAI,IAIxC4K,EAAE+jB,WAAYumC,OAAd,+BAA6B+Z,EAAa1mD,EAAKgO,QAAU+d,EAAe,eAAiB,IACzF1pC,EAAEsqB,QAAU,SAAC74B,GAET,IAAM6yE,EAAmB,CAAC3mD,GAC1B,GAAIA,EAAKvV,OAAOgrB,SAAS,SAAU,CAC/B,IAAMzwB,EAAQgb,EAAKgN,KAAK6c,MAAM7pB,EAAK0N,WACnC,QAAkC16B,IAA9BgS,EAAM82D,WAAW97C,EAAK2N,IAAmB,S,w5BAAA,CAChB3oB,EAAM82D,WAAW97C,EAAK2N,KADN,IACzC,gCAAWi5C,EAAX,QACID,EAAiBxyE,KAAK2T,EAAOkY,KAAK4mD,KAFG,gCAMjDp8B,EAASqd,aAAa8e,GAGjB7yE,IAAGA,EAAI8K,OAAO6P,OACnB3a,EAAE+yE,cAAe,EACb/yE,EAAEopB,iBAAiBppB,EAAEopB,mBAE7BupD,EAAMtyE,KAAKkO,IAGP0pC,QAAJ,KAGD,SAAC/rB,EAAMlY,GAGN,IAAMgV,EAAO2pD,EAAMta,MACfrvC,GACA2pD,EAAMA,EAAMr1E,OAAS,GAAGsR,YAAYoa,MAG5CspD,KA/HAU,aAiBJ,SAAsBhqD,GAClB,IAAI2T,EAAW41C,IACXhoB,EAAO,GACX,GAAIvhC,aAAgBqvB,MAA2B,WAAnBrvB,EAAKtS,KAAKC,KAAmB,CACrD,IAAIs8D,EAAYjqD,EAAKkQ,KAAK6c,MAAM/sB,EAAK4Q,WAAWic,MAAM7sB,EAAK6Q,IAC3D0wB,GAAQ,mBAAqB0oB,EAAUpc,cAAgB,WACnDoc,EAAUjc,cAAgB,QAElCzM,GAAQ,SAER,cAAiBvpD,OAAOoM,QAAQ4b,EAAK6G,cAArC,eAAoD,CAA/C,IAAI4oB,EAAI,KACO,WAAZA,EAAK,IAA+B,SAAZA,EAAK,IACjB,YAAZA,EAAK,IAAoBA,EAAK,GAAGhwB,WAAW,WACjC,YAAXgwB,EAAK,KAET8R,GAAQ,MAAQ9R,EAAK,GAAK,oBAC1B8R,IAAQ4iB,QACJ10B,EAAK,GAAIy6B,EAAQC,aAAalG,iBAC9B,QAIR,GAAIjkD,aAAgBg9C,WAAY,CAC5B,IAAIoN,EAAapqD,EAAKkQ,KAAKrJ,WAAW4H,QAAQzO,EAAK6G,aAAanZ,MAChE6zC,GAAQ,aAAe6oB,EAAWz8D,KAAO,oBACzC,cAAiB3V,OAAOoM,QAAQgmE,EAAWvjD,YAA3C,eAAwD,CAAnD,IAAI4oB,EAAI,KACO,WAAZA,EAAK,IAA+B,SAAZA,EAAK,IAC7BA,EAAK,GAAGhwB,WAAW,YAEvB8hC,GAAQ,MAAQ9R,EAAK,GAAK,oBAC1B8R,IAAQ4iB,QACJ10B,EAAK,GAAIy6B,EAAQC,aAAalG,iBAC9B,SAIZtwC,EAASrK,UAAYi4B,IAlDzB,SAAS8nB,EAAqB7nE,GAE1BgB,SAAS44B,eAAe,kBAAkBpW,UAAYxjB,EAG1D,SAAS+nE,IACL,OAAO/mE,SAAS44B,eAAe,oBAGnC,SAASkuC,IAEL9mE,SAAS44B,eAAe,WAAW31B,MAAMC,QAAU,O,0kCCFnD2kE,EAFI5tD,EAAMC,WAAND,EAGJwE,EAAO,KACPqpD,EAAuB,KAMdJ,GAAUK,QACA7tD,WACnB,CACIytD,aAAc,KACdK,eAAgB9B,EAChB+B,aAAcC,EACdC,cAAe75C,IACf85C,kBAAmBrzC,IACnBszC,gBAAiBC,EACjBC,yBAA0B5G,KAC1B6G,0BAA2BnF,KAC3BoF,wBAAyB1U,KACzB2U,2BAA4BzU,KAC5B0U,uBAAwB9T,KACxB+T,0BAA2BC,KAC3BC,0BAA2BC,KAC3BC,iBAAkBt+B,IAClBu+B,iBAAkBzL,KAClB0L,uBAAwBtnB,IACxBunB,wBAAyBlnB,IACzBmnB,+BAAgC/kB,IAChCglB,uBAAwBnkB,IACxBokB,eAAgBC,IAMxB,GAAIvpE,SAASwpE,cAAcC,aAAa,kBACpCvB,GAAU55C,OAAWtuB,SAASwpE,cAAc7rD,aAAa,wBACtD,CACH,IAAM3E,EAyLV,SAA4BjgB,GACxB,IAAMigB,EAAM1Z,OAAO88B,SAASd,KAC5BviC,EAAOA,EAAKmgB,QAAQ,UAAW,QAC/B,IACIwwD,EADU,IAAIC,OAAO,OAAS5wE,EAAO,qBACrB8mD,KAAK7mC,GACzB,OAAK0wD,EACAA,EAAQ,GACNE,mBAAmBF,EAAQ,GAAGxwD,QAAQ,MAAO,MAD5B,GADH,KA9LT2wD,CAAmB,OAC3B7wD,EAkMR,SAA4BA,GACxB,IAAMoI,EAAU,IAAI87B,eACpB97B,EAAQ0oD,aAAe,OACvB1oD,EAAQ7Z,OAAS,WACb,GAAsB,KAAlB6Z,EAAQpE,OAAe,CACvB,IAAM0Q,GAAOY,OAAWlN,EAAQjE,UAC5BuqD,EAAQC,cACRD,EAAQC,aAAatvD,UACzB6vD,EAAUx6C,QAEVnuB,MAAM,gCACN2oE,EAAU,OAGlB9mD,EAAQ46B,QAAU,WACdz8C,MAAM,iCAAmC6hB,EAAQpE,QACjDkrD,EAAU,OAEd9mD,EAAQla,KAAK,MAAO8R,GAAQ,KAAMhgB,KAAKggB,GAAO,IAAM,MAAQ,IAAIvR,MAAQ0qB,WAAW,GACnF/Q,EAAQm6B,OApNJwuB,CAAmB/wD,GAEnBkvD,EAAU,MAIlB,SAASA,EAAUx6C,GAAiD,IAA3CrX,EAA2C,uDAA1B,KAAMm4C,EAAoB,wDAChEv0C,EAAE,oBAAoBqnB,QAAO,SAAC9sC,GACtBA,EAAEU,OAAOwpB,MAAM5sB,OAAS,IAE5B2sB,EAAOjqB,EAAEU,OAAOwpB,MAAM,GACtBsrD,QAEJ/vD,EAAE,cAAc5W,OAAM,kBAAM4mE,OAC5BhwD,EAAE,WAAW5W,OAAM,WACf2mE,OAEJ/vD,EAAE,sCAAsCqnB,QAAO,SAAC9sC,GACxCA,EAAEU,OAAOwpB,MAAM5sB,OAAS,IAE5Bg2E,EAAuBtzE,EAAEU,OAAOwpB,MAAM,GACtCwrD,QAEJjwD,EAAE,YAAY5W,OAAM,WACZqkE,EAAQC,cACRx7D,YAAW,kBAAMyoD,EAAQ8S,EAAQC,aAAcD,EAAQC,aAAa7+B,SAAQ,MAEpF7uB,EAAE,eAAe5W,OAAM,WACfqkE,EAAQC,cACRx7D,YAAW,WACPm8D,EAAcZ,EAAQC,aAAcD,EAAQC,aAAa7+B,MAAO7uB,EAAE,WAAWpR,MACzEoR,EAAE,gBAAgB,GAAGsT,WAC1B,MAEXtT,EAAE,WAAWsB,GAAG,WAAW,SAAC/mB,GACX,SAATA,EAAE7B,KAA6B,IAAX6B,EAAEq5D,QACtBsc,IACA31E,EAAEqpB,qBAIV,IAAI6wC,EAAe,KACf0b,EAAUpqE,SAAS44B,eAAe,WAClCyxC,EAAWrqE,SAAS44B,eAAe,YACnC0xC,EAAatqE,SAAS44B,eAAe,cACrC05B,EAAW,GACfA,EAASz9D,KAAKmL,SAAS44B,eAAe,aACtC05B,EAASz9D,KAAKmL,SAAS44B,eAAe,iBACtC05B,EAASz9D,KAAKmL,SAAS44B,eAAe,iBACtC05B,EAASz9D,KAAKmL,SAAS44B,eAAe,qBACtC05B,EAASz9D,KAAKmL,SAAS44B,eAAe,qBACtC05B,EAASz9D,KAAKmL,SAAS44B,eAAe,gBACtC05B,EAASz9D,KAAKmL,SAAS44B,eAAe,eAClCwxC,IACA1b,EAAe,CACXyD,IAAKiY,EACLhY,KAAMiY,EACNhY,OAAQiY,EACRhY,SAAUA,IAGL,OAAT5kC,IACAg6C,EAAQC,aAAe,IAAIj9B,IACvBhd,EAAM1tB,SAAS44B,eAAe,YAAa2wC,EAC3ClzD,EAAgBm4C,EAAY,KAAME,IAI9C,SAASyb,IACDzC,EAAQC,cACRx7D,YAAW,WACPm8D,EACIZ,EAAQC,aAAcD,EAAQC,aAAa7+B,MAC3C7uB,EAAE,WAAWpR,MAAOoR,EAAE,gBAAgB,GAAGsT,WAE9C,GAGX,SAASy8C,IACAvrD,KAELopD,EAAK,IAAIjpD,YACNrX,OAASgjE,EACZ1C,EAAG/oD,WAAWL,IAGlB,SAAS8rD,IAAqB,MACpB78C,GAAOY,OAAWu5C,EAAGhpD,QAC3B,UAAA6oD,EAAQC,oBAAR,SAAsBtvD,UACtBqvD,EAAQC,aAAe,IAAIj9B,IAAahd,EAAM1tB,SAAS44B,eAAe,YAAa2wC,GACnFU,IAGJ,SAASC,IACApC,KAELD,EAAK,IAAIjpD,YACNrX,OAASijE,EACZ3C,EAAG/oD,WAAWgpD,IAGlB,SAAS0C,KAqBT,SAA8CC,GAAQ,MAC5ClmB,EAAc,GAEpB,GAAIkmB,EAAOC,aAAP,UAAsBhD,EAAQC,oBAA9B,OAAsB,EAAsBj6C,KAAM,WAC9B+8C,EAAOC,aADuB,IAClD,2BAAwC,KAA7Bv7D,EAA6B,QACpC,GAAiB,MAAbA,EAAMw7D,GAAY,CAClB,IAAI7W,EAAO3kD,EAAM7b,KAAKq1C,QAAU,SACJj1C,IAAxByb,EAAM7b,KAAKs4B,UACXkoC,GAAQ3kD,EAAM7b,KAAKs4B,SAAW,SACRl4B,IAAlByb,EAAM7b,KAAK+6B,GACXylC,GAAQ3kD,EAAM7b,KAAK+6B,GAAK,MAExBylC,GAAQ,SAEZA,GAAQ,gBAGcpgE,IAAtB6wD,EAAYuP,GACZvP,EAAYuP,GAAMj/D,KAAKsa,EAAMy7D,KAE7BrmB,EAAYuP,GAAQ,CAAC3kD,EAAMy7D,OAjBW,8BAqBlD,IAAK,IAAMj4E,KAAO4xD,EAAa,CAC3B,IAAMplD,EAASolD,EAAY5xD,GACrBk4E,EAASC,EAAW3rE,GAGpB4rE,EAAkB,CACpB,IAHQF,EAAO,GAIf,IAHQA,EAAO,GAIf,MAAQtwE,SAAK4E,GACb,KAAOkkD,SAAOlkD,GACd,MAASA,EAAOrN,QAEpByyD,EAAY5xD,GAAOo4E,EAGvB,IAAM7/B,EAAWw8B,EAAQC,aAEzB,GAAIz8B,EAAS2W,gBAAiB,CACrB3W,EAAS2W,gBAAgBgQ,kBAC1BxN,MAEAnZ,EAAS2W,gBAAgBiQ,iBACrBzN,KAGR,IAAM8J,EAAKjjB,EAAS2W,gBAAgBmpB,YAChC3mB,KAEA8J,IACAA,EAAG5J,YAAcA,EACjB4J,EAAG7P,aA1Ef2sB,CAAqChsE,KAAKsR,MAAMs3D,EAAGhpD,SAQvD,SAASisD,EAAWl5E,GAChB,IAAIkR,GAAO5H,OAAOgwE,UACdrlD,EAAM3qB,OAAOgwE,UAOjB,OANAt5E,EAAIwe,SAAQ,SAAAvH,GACJA,EAAM/F,IACNA,EAAM+F,GACNA,EAAMgd,IACNA,EAAMhd,MAEP,CAACgd,EAAK/iB,GAgGjB,SAASqoE,EAAeriC,EAAOsiC,EAAO1B,EAAS2B,GAAgB,UACtCviC,EAAMyB,SADgC,IAC3D,2BAAoC,KAAzB9nC,EAAyB,QAC1Bie,EAAOooB,EAAMpoB,KAAKje,GACpBisB,EAAQhO,EAAKgO,QACZ28C,IACD38C,EAAQA,EAAM48C,gBACY,IAA1B58C,EAAM/yB,QAAQyvE,IACd1B,EAAQ70E,KAAK6rB,GAEbA,EAAKxV,KAAK49B,OACVqiC,EAAezqD,EAAKxV,KAAK49B,MAAOsiC,EAAO1B,EAAS2B,IAVG,wCAYtCviC,EAAMuB,SAZgC,IAY3D,2BAAoC,KAAzBkhC,EAAyB,QAC1BlpB,EAAOvZ,EAAMuZ,KAAKkpB,GACpB78C,EAAQ2zB,EAAK3zB,aACHh7B,IAAVg7B,IACK28C,IACD38C,EAAQA,EAAM48C,gBACY,IAA1B58C,EAAM/yB,QAAQyvE,IACd1B,EAAQ70E,KAAKwtD,KAnBkC,+BAwB/D,SAASimB,EAAcp9B,EAAUxd,EAAM09C,GAA6B,IAAtBC,EAAsB,wDAChEG,EAAkB,uBAAyBJ,EAAQ,KAEnD,IAAM1B,EAAU,GACX2B,IACDD,EAAQA,EAAME,eAClBH,EAAez9C,EAAM09C,EAAO1B,EAAS2B,GAGjC3B,EAAQ53E,OAAS,GACjBo5C,EAASqd,aAAamhB,GAG1B,IAAMxC,EAAUH,IAChBG,EAAQpgD,UAAY,GACpB,IAfgE,iBAe3D,IAAMjI,EAAM,KACP9b,EAAI/C,SAASC,cAAc,OACjC8C,EAAEiE,UAAY,sBACdjE,EAAE+jB,WAAYumC,OAAd,4BAA6BxuC,EAAO1T,OAAU0T,EAAO6P,SACrD3rB,EAAEsqB,QAAU,WAAQ6d,EAASqd,aAAa,CAAC1pC,KAC3C9b,EAAE0oE,aAAe,WACR5sD,EAAO2pB,cACR3pB,EAAO2pB,aAAc,EACrB0C,EAASzC,eAGjB1lC,EAAE2oE,aAAe,WACT7sD,EAAO2pB,cACP3pB,EAAO2pB,aAAc,EACrB0C,EAASzC,eAGjBy+B,EAAQ9jE,YAAYL,IAjBxB,MAAqB2mE,EAArB,eAA8B,IAoB9BiC,IAqFJ,SAASpC,EAAYv+B,EAAQ77B,EAAOtK,EAAU6jC,EAAUwC,EACpDC,EAAmBC,GAIf,IAAInqB,GAHQ,UAAX+pB,IAAuBI,GAAyB,aAAXJ,KAClCE,EAAS6jB,MACT7jB,EAAS6jB,KAAK12C,UASF,QANZ4I,EAD6B,IAA7BkqB,EAAkBr5C,OACR,IAAIyuE,KAAKr1B,EAASxd,MACM,IAA7Byd,EAAkBr5C,OACbq5C,EAAkB,GAElB,OAGVqgC,EAAkBvqD,EAAQ9V,OAAS,IAAM8V,EAAQyN,SACjDslC,EAAU/yC,KAEVgpD,IACAuB,EAAkB,+BAEtBG,KASR,SAASH,EAAkBxsE,GACvB,OAAO0oE,EAAQM,eAAenB,qBAAqB7nE,GAGvD,SAAS2sE,IACL,OAAOjE,EAAQM,eAAelB,kBAGlC,SAASC,IACL,OAAOW,EAAQM,eAAejB,uBAGlC,SAASkD,IACL,OAAOvC,EAAQM,eAAehB,gBAGlC,SAASpS,EAAQ1pB,EAAUxd,GACvB,OAAOg6C,EAAQM,eAAef,WAAW/7B,EAAUxd,GAGhD,SAASsmC,EAAUx2C,GACtB,OAAOkqD,EAAQM,eAAeR,aAAahqD,GAG/CvD,EAAE,YAAY2xD,OAAM,WA3BTlE,EAAQM,eAAe7B,mB,6mCCjc1BlsD,EAAMC,WAAND,EAEKiyB,EAAb,WAII,aAAiC,WAArB2/B,EAAqB,uDAAN,MAAM,eAE7Bx4E,KAAKy4E,cAAgBD,EACrBx4E,KAAK04E,sBAAwB,GAE7B14E,KAAKohC,EAAItoB,YAAW,WAChB,EAAK4/D,sBAAwB,CACzB,CAAC,QAAS,SAAAlyE,GACN,EAAKwe,YAET,CAAC,cAAe,SAAAxe,GACZ,EAAKwe,aANS,UAWR,EAAK0zD,uBAXG,IAWtB,2BAA0C,OAAjClyE,EAAiC,SACtC,EAAAyF,QAAO8U,iBAAP,gBAA2Bva,KAZT,iCAcvB,IAEHxG,KAAK24E,SAAW,GAChB34E,KAAKs+D,YAAc,KA1B3B,oCA6BI,WACI,OAAOt+D,KAAKs+D,YAAY0C,cA9BhC,qBAiCI,WAAY,OAA2B,MAApBhhE,KAAKs+D,cAjC5B,uBAmCI,SAAU54D,EAAMkzE,GAA0B,IAAhBC,EAAgB,uDAAN,KAChC74E,KAAK24E,SAASn3E,KAAK,CACfkE,KAAMA,EACN6E,KAAMquE,EACNC,QAASA,MAvCrB,gCA2CI,SAAmBnzE,EAAMw0B,EAAS0+C,GAA0B,IAAhBC,EAAgB,uDAAN,KAClD74E,KAAK24E,SAASn3E,KAAK,CACfkE,KAAMA,EACNozE,UAAU,EACV5+C,QAASA,EACT3vB,KAAMquE,EACNC,QAASA,MAjDrB,qBAqDI,WACI,GAAK74E,KAAKs+D,YAAV,CAMA3xD,SAASmD,KAAKG,YAAYjQ,KAAKs+D,aAPzB,UASQt+D,KAAK04E,uBATb,IASN,2BAA0C,OAAjClyE,EAAiC,SACtC,EAAAyF,QAAO+U,oBAAP,gBAA8Bxa,KAV5B,8BAaNxG,KAAKs+D,YAAc,QAlE3B,kBAqEI,SAAK93D,EAAGe,GAKJ,IAAIwxE,EAAYpsE,SAASC,cAAc,OAOvC,GANAmsE,EAAU/9C,GAAK,cACfpU,EAAEmyD,GAAWh9B,IAAI,OAAQv1C,EAAI,MAC7BogB,EAAEmyD,GAAWh9B,IAAI,MAAOx0C,EAAI,MAC5BwxE,EAAU/oD,UAAUzjB,IAAI,gBAGE,MAAtBvM,KAAKy4E,cAAuB,WAGdz4E,KAAK24E,UAHS,yBAGnBnyE,EAHmB,QAKpB2jB,EAAOxd,SAASC,cAAc,OAIlC,GAHAud,EAAKpJ,iBAAiB,QAASva,EAAE+D,MACjC4f,EAAK6F,UAAUzjB,IAAI,uBAEf/F,EAAEsyE,SAAU,CACZ,IAAIE,EAAWrsE,SAASC,cAAc,QACtCosE,EAAShpD,UAAYxpB,EAAE0zB,QAAU,oBAAsB,YACvD/P,EAAKpa,YAAYipE,GACjB7uD,EAAKsJ,YAAaumC,OAAlB,wBAAiCxzD,EAAEd,MACnCykB,EAAKpJ,iBAAiB,SAAS,SAAAoJ,GAC3B3jB,EAAE0zB,SAAW1zB,EAAE0zB,QACf1zB,EAAE+D,KAAK4f,EAAM3jB,EAAE0zB,iBAGnB/P,EAAKgF,UAAY3oB,EAAEd,KACnBykB,EAAKpJ,iBAAiB,QAASva,EAAE+D,MAErCwuE,EAAUhpE,YAAYoa,IAnB1B,2BAA6B,IAHD,oCA0B5B4uD,EAAUtlD,UAAYzzB,KAAKy4E,cAG/Bz4E,KAAKs+D,YAAcya,EACnBpsE,SAASmD,KAAKC,YAAYgpE,OA/GlC,M,4BCHO,SAASE,EAAWlzC,GACvB,IAAMmzC,EAAwC,IAAI5P,IAAI,CAClD,CAAC,IAAK,SACN,CAAC,IAAK,QACN,CAAC,IAAK,QACN,CAAC,IAAK,UACN,CAAC,IAAK,YAGV,MAAO,UAAGvjC,GAAIlgB,QAAQ,YAAY,SAAAzV,GAAC,OAAI8oE,EAAiBr2E,IAAIuN,MAGzD,SAAS4pD,EAAap1D,GAAyD,2BAAvBkH,EAAuB,iCAAvBA,EAAuB,kBAClF,OAA0B,IAAnBlH,EAAQnG,OAAemG,EAAQ,GAChCA,EAAQ6C,QAAO,SAACs+B,EAAGvgC,EAAG9G,GAAP,gBAAgBqnC,GAAhB,OAAoBkzC,EAAWzuE,OAAOsB,EAAOpN,EAAI,MAAjD,OAAwD8G,M,4mCCZ1E,SAASwqE,EAA0B52C,GAAwB,IAAjB4U,EAAiB,uDAAN,KACpD9V,EAAU,GACd,GAAIkB,EAAMxZ,OAASwZ,EAAMvZ,KAAqB,GAAduZ,EAAM3G,MAA2B,GAAd2G,EAAMrB,KACrDG,GAAWo2C,EAAwBl1C,EAAMxZ,MAAOouB,OAC/C,CACD,GAAIA,GAAYA,EAASuuB,iBACrBrkC,GAAWo2C,EAAwBl1C,EAAMxZ,MAAOouB,GAAY,KACxDsgC,EAAwBl1C,EAAMvZ,IAAKmuB,OACpC,CACH,IAAImrC,EAAQ7K,EAAwBl1C,EAAMvZ,IAAKmuB,GAAY,OAC3D,IACImrC,GAAQC,QAASD,GAAO1zE,WAC1B,MAAOtE,IACT+2B,GAAWo2C,EAAwBl1C,EAAMxZ,MAAOouB,GAAY,IACxDmrC,EAEU,GAAd//C,EAAM3G,MACNyF,GAAW,IAAMo2C,EAAwBl1C,EAAM3G,KAAMub,GACnC,GAAd5U,EAAMrB,OACNG,GAAW,IAAMo2C,EAAwBl1C,EAAMrB,KAAMiW,KACpC,GAAd5U,EAAMrB,OACbG,GAAW,KAAOo2C,EAAwBl1C,EAAMrB,KAAMiW,IAG9D,OAAO9V,EAKJ,SAASo2C,EAAwB+K,GAAuB,IAAjBrrC,EAAiB,uDAAN,KACrD,GAAa,OAATqrC,EAAe,OAAOA,EAC1B,GAAoB,kBAATA,EACP,OAAIA,EACO,OACJ,QACJ,GAAkB,YAAdA,EAAKvhE,MAAoC,oBAAduhE,EAAKvhE,KAA4B,CACnE,IADmE,EAC7DyK,EAAU82D,EAAK92D,QACjB2V,EAAU,IAFqD,IAG/C3V,GAH+C,IAGnE,2BAA6B,KAAlBxa,EAAkB,QACzBmwB,GAAWo2C,EAAwBvmE,EAAOimC,GAAY,MAJS,8BAMnE,OAAO9V,EAAQpzB,MAAM,GAAI,GAAK,IAC3B,GAAkB,UAAdu0E,EAAKvhE,MAAkC,kBAAduhE,EAAKvhE,KAA0B,CAC/D,IAD+D,EACzDqhB,EAASkgD,EAAKlgD,OAGhBjB,EAAU,IAJiD,IAK3CiB,GAL2C,IAK/D,2BAA4B,KAAjBC,EAAiB,QACxBlB,GAAW83C,EAA0B52C,EAAO4U,GAAY,MANG,8BAQ/D,OAAO9V,EAAQpzB,MAAM,GAAI,GAAK,IAC3B,QAAsBzE,IAAlBg5E,EAAK79C,SAEZ,MAAyB,KAArB69C,EAAK59C,kBAA2Cp7B,IAArBg5E,EAAK59C,aAAkD,OAArB49C,EAAK59C,YAC3D,2BAA6B49C,EAAK59C,YAAYwxC,OACjD,4CACD,GACJ,QAAoB5sE,IAAhBg5E,EAAKC,aAAsCj5E,IAAdg5E,EAAKhnD,KAEzC,OAAOgnD,EAAKhnD,KACT,GAAIgnD,EAAK11E,aAAexB,OAE3B,MAAO,2BAA6ByJ,KAAKC,UAAUwtE,OAAMh5E,EAAW,GAChE,4CACD,GAAIg5E,EAAK11E,aAAe/E,MAAO,CAElC,IAFkC,EAE9B4sB,EAAS,KACT+tD,GAAQ,EAHsB,IAIZF,GAJY,IAIlC,2BAA4B,KAAjBG,EAAiB,QACnBD,IACD/tD,GAAU,MACdA,GAAU8iD,EAAwBkL,EAASxrC,GAC3CurC,GAAQ,GARsB,8BAUlC,OAAO/tD,EAAS,KAEhB,OAAO6tD,EAIR,SAAS3D,EAAyB97D,GAGrC,GAFAA,EAAIiM,QAAQ,OAAQ,IAER,KAARjM,GAAsB,SAARA,EACd,OAAO,KAEX,GAAIA,EAAIkpB,SAAS,KACb,GAAIlpB,EAAIgQ,WAAW,WAAY,CAC3B,IAAM6vD,EAAY7/D,EAAIq4B,UAAU,EAAGr4B,EAAInb,OAAS,GAChD,GAAIg7E,EAAW,CACX,IAAMC,EAAWD,EAAUE,YAAY,KACvC,GAAID,EAAU,CACV,IAAM3kC,EAAQ2gC,EACV+D,EAAUxnC,UAAU,EAAGynC,IAErBE,EAAQH,EAAUxnC,UAAUynC,GAClC,GAAI3kC,GAAS6kC,EACT,MAAO,CACH9hE,KAAM,SACNi9B,MAAOA,EACPM,SAAUukC,UAIvB,GAAIhgE,EAAIgQ,WAAW,YAAa,CACnC,IAAM6vD,EAAY7/D,EAAIq4B,UAAU,EAAGr4B,EAAInb,OAAS,GAChD,GAAIg7E,EACA,MAAO,CACH3hE,KAAM,UACNi9B,MAAO2gC,EAAyB+D,SAErC,GAAI7/D,EAAIgQ,WAAW,WAAY,CAClC,IAAM6vD,EAAY7/D,EAAIq4B,UAAU,EAAGr4B,EAAInb,OAAS,GAChD,GAAIg7E,EACA,MAAO,CACH3hE,KAAM,SACNpS,KAAM+zE,QAEX,GAAI7/D,EAAIgQ,WAAW,aAAc,CACpC,IAAM6vD,EAAY7/D,EAAIq4B,UAAU,EAAGr4B,EAAInb,OAAS,GAChD,GAAIg7E,EAAW,CACX,IAAMC,EAAWD,EAAUE,YAAY,KACvC,GAAID,EAAU,CACV,IAAMG,EAAeJ,EAAUxnC,UAAU,EAAGynC,GAC5C,GAAIG,EAAajwD,WAAW,MACxBiwD,EAAa/2C,SAAS,KAAM,CAC5B,IAAMg3C,EAAcD,EAAa5nC,UAC7B,EAAG4nC,EAAap7E,OAAS,GAC3BquB,MAAM,KACFitD,EAAWrE,EACb+D,EAAUxnC,UAAUynC,IAGlBM,EAAU,GAMhB,GALIF,GACAA,EAAY/8D,SAAQ,SAAAk9D,GAChBD,EAAQx4E,KAAKk0E,EAAyBuE,OAG1CD,GAAWD,EACX,MAAO,CACHjiE,KAAM,WACN5X,UAAW85E,EACXE,WAAYH,MAOxC,OAAOngE,EAGJ,SAAS47D,EAAyB2E,GACrC,GAAIA,QACA,MAAO,OAEX,GAAIA,EAAUx2E,cAAgBxB,OAAQ,CAClC,QAAuB9B,IAAnB85E,EAAUriE,KACV,OAAQqiE,EAAUriE,MACd,IAAK,SACD,QAA2BzX,IAAvB85E,EAAU9kC,eACUh1C,IAApB85E,EAAUplC,MACV,MAAO,UAAYygC,EACf2E,EAAUplC,OACV,KAAOolC,EAAU9kC,SAAW,IACpC,MACJ,IAAK,UACD,QAAwBh1C,IAApB85E,EAAUplC,MACV,MAAO,WAAaygC,EAChB2E,EAAUplC,OACV,IACR,MACJ,IAAK,SACD,QAAuB10C,IAAnB85E,EAAUz0E,KACV,MAAO,UAAYy0E,EAAUz0E,KAAO,IACxC,MACJ,IAAK,WACD,QAA4BrF,IAAxB85E,EAAUj6E,UAAyB,CAEnC,IADA,IAAI0Z,EAAM,aACDlb,EAAI,EAAGA,EAAIy7E,EAAUj6E,UAAUzB,OAAQC,IAC5Ckb,GAAO47D,EACH2E,EAAUj6E,UAAUxB,IAEpBA,EAAIy7E,EAAUj6E,UAAUzB,OAAS,IACjCmb,GAAO,MAUf,OARAA,GAAO,WACsBvZ,IAAzB85E,EAAUD,WACVtgE,GAAO47D,EACH2E,EAAUD,YAGdtgE,GAAO,OACXA,EAAO,KAQvB,OAAO00D,EAAwB6L,GAInC,OAAOA,I,kEC/MJ,SAASl/C,EAAWm/C,GACvB,OAAOxuE,KAAKsR,MAAMk9D,EAAWC,GAG1B,SAAS34C,EAAerH,GAC3B,OAAOzuB,KAAKC,UAAUwuB,GAAM,SAAC30B,EAAM8P,GAAP,OAAe8kE,EAAS50E,EAAM8P,EAAK6kB,MAGnE,SAASggD,EAAQ30E,EAAc8P,GAC3B,MAAY,QAAR9P,GAAkB8P,GAAsB,iBAARA,GAA+B,MAAXA,EAAI,GACjD5J,KAAKsR,MAAM1H,EAAK6kE,GAEpB7kE,EAOX,SAAS8kE,EAAS50E,EAAc8P,EAAc+kE,GAC1C,OAAI/kE,IALQ7O,EAKM6O,EAJE,YAAb,OAAO7O,IAAwB,OAANA,GAAgBA,aAAa/H,OAAY+H,aAAayN,OAI5DoB,IAAQ+kE,KAAa,SAAU/kE,IAAoB,SAAbA,EAAIsC,KAG7DtC,EAFI5J,KAAKC,UAAU2J,GAAK,SAAChQ,EAAGmB,GAAJ,OAAU2zE,EAAS90E,EAAGmB,EAAG6O,MAN5D,IAAgB7O,I,4lCChBT,IAAM2xB,EAAb,WACI,WAAY+B,IAAM,eACdr6B,KAAKw6E,MAAQngD,EAFrB,wCAKI,WAEI,OAAOr6B,KAAKw6E,MAAMtjC,MAAM5vC,KAAI,SAAAd,GAAC,OAAI,IAAIi0E,EAAkBj0E,SAP/D,6BAUI,SAAsB6zB,EAAM9B,EAAUpO,EAAMuwD,GAA+B,IAAX3oD,EAAW,uDAAH,EAE9D1f,EAAQgoB,EAAK6c,MAAM3e,GAErBH,EAAO,GAEX,GAAIjO,EAAKxmB,aAAexB,OAAQ,CAE5B,IAF4B,EAEtBw4E,EAAUtoE,EAAM2kC,MAAM3uC,QAAO,SAAA7B,GAAC,OAAIA,EAAEywC,KAAO9sB,EAAK8sB,KAAOzwC,EAAEyN,KAAOkW,EAAKlW,OAF/C,IAKZ0mE,GALY,IAK5B,2BAAyB,KAAdvqE,EAAc,QAGfwqE,EAAQxqE,EAAE4gB,WAAWnZ,KAAKmZ,WAAWq9C,OAE3C,GAAkB,mBAAduM,EAAM9iE,KAA2B,CAGjC,IAHiC,EAG3BzR,EAAMu0E,EAAMr4D,QAAQjb,KAAI,SAAAd,GAAC,OAAIA,KAAGwrB,UAHL,IAIjB3rB,GAJiB,IAIjC,2BAAqB,KAAVG,EAAU,QAEjBurB,GAAS,EACTqG,EAAK52B,KAAK,CAAEs2B,IAAKtxB,EAAGgP,IAAK,KAAMuc,MAAOA,KAPT,oCAU5B6oD,EAAM9iE,KAOAuiB,EAAK6c,MAAM3e,GAAU2e,MAAM9mC,EAAE6D,KAA5C,IACM5N,EAAMiyB,EAAYuiD,eAAexgD,EAAM9B,EAAUnoB,EAAE6D,IAAKymE,EAAoB3oD,EAAQ,GAC1FqG,EAAO,GAAH,eAAOA,IAAP,OAAgB/xB,KA7BI,mCAgC3B,CAED,IAAMgnB,EAAOhb,EAAM6kC,MAAM/sB,GAGzB,KAAI,WACA,IAAM2wD,EAAOztD,EAAK2D,WAAWoI,MAAMD,OAAO7xB,KAAI,SAAAd,GAAC,OAAIA,KAC7C8mB,EAASD,EAAK2D,WAAW1D,OAAOhmB,KAAI,SAAAd,GAAC,OAAIA,KAE/CwE,QAAQ5E,OAAO00E,EAAKr8E,QAAU6uB,EAAO7uB,OAAQ,4DAG7Cq8E,EAAK9oD,UACL1E,EAAO0E,UAEP,IAVA,eAUStzB,GAEL,IAAMq8E,EAAQ3iD,EAAK/vB,QAAO,SAAA7B,GAAC,OAAIA,EAAC,KAAQ8mB,EAAO5uB,MAC3B,GAAhBq8E,EAAMt8E,QACNszB,GAAS,EACTqG,EAAK52B,KAAK,CAAEs2B,IAAKxK,EAAO5uB,GAAI8W,IAAKslE,EAAKp8E,GAAIqzB,MAAOA,KAG7CnmB,KAAKC,UAAUkvE,EAAM,GAAGvlE,MAAQ5J,KAAKC,UAAUivE,EAAKp8E,KACpDsM,QAAQslB,KAAK,iCAAmChD,EAAO5uB,GAAIq8E,EAAM,GAAGvlE,IAAKslE,EAAKp8E,KATjFA,EAAI,EAAGA,EAAIo8E,EAAKr8E,SAAUC,EAAG,EAA7BA,GAVT,GAwBJ,MAAOyC,IAIP,IAjCC,EAiCK65E,EAAY3oE,EAAM2kC,MAAM3uC,QAAO,SAAA7B,GAAC,OAAIA,EAAEywC,KAAO9sB,KAjClD,IAkCe6wD,GAlCf,IAkCD,2BAA2B,KAAhB75E,EAAgB,QACjBkF,EAAMiyB,EAAYuiD,eAAexgD,EAAM9B,EAAUp3B,EAAGu5E,EAAoB3oD,EAAQ,GACtFqG,EAAO,GAAH,eAAOA,IAAP,OAAgB/xB,KApCvB,+BAwCL,OAAO+xB,MAxFf,KA4FaqiD,EAAb,WACI,WAAY5R,IAAY,eACpB7oE,KAAKi7E,YAAcpS,EAF3B,uCAKI,WACI,OAAO7oE,KAAKi7E,YAAY/jC,MAAM5vC,KAAI,SAAAd,GAAC,OAAI,IAAI00E,EAAiB10E,UANpE,KAUa00E,EAAb,WACI,WAAY7tD,IAAM,eACdrtB,KAAKm7E,MAAQ9tD,EAFrB,yCAKI,SAAW0mD,GACP,OAAO/zE,KAAKm7E,MAAMnqD,WAAWlZ,OAASi8D,MAN9C,KAUa19B,EAAb,sFACI,SAAkB5zC,EAAK24E,GACnB,OAAO34E,EAAIuuB,WAAW,SAAWoqD,KAFzC,+BAKI,SAAyB34E,GACrB,IAAMgE,EAAOtE,OAAOsE,KAAKhE,EAAIuuB,YAE7B,OADavqB,EAAK4B,QAAO,SAAA7B,GAAC,OAAIC,EAAK6E,SAAS,SAAW9E,UAP/D,M,4mCC9GQipD,E,QAAe0a,cAEhB,SAASkR,EAAuB5lC,EAAO6lC,GAA+B,IAArBC,EAAqB,4DAAXl7E,EAC9D,GAAIo1C,EAAMpoB,KAAK,GAAGgN,KAAKS,eAAiBwgD,EACpC,MAAO,CACH7lC,MAAOA,EACPpoB,KAAMkuD,GAGV,IADG,EACG/vD,EAAS,CACXiqB,WAAOp1C,EACPgtB,UAAMhtB,GAHP,IAKoBo1C,EAAMyB,SAL1B,IAKH,2BAAsC,KAA3B3e,EAA2B,QAC5BlmB,EAAQojC,EAAMpoB,KAAKkL,GACzB,QAAyBl4B,IAArBgS,EAAMwF,KAAK49B,OAA4C,OAArBpjC,EAAMwF,KAAK49B,MAAjD,WAC0BpjC,EAAMwF,KAAK49B,MAAMyB,SAD3C,IACI,2BAAgD,KAArC1e,EAAqC,QACtCnL,EAAOhb,EAAMwF,KAAK49B,MAAMpoB,KAAKmL,GACnC,GAAInL,aAAgBoiC,EAAY,CAC5B,IAAM+rB,EAAeH,EACjBhuD,EAAKxV,KAAK49B,MAAO6lC,EAAUjuD,GAE/B,QAA2BhtB,IAAvBm7E,EAAa/lC,MACb,OAAO+lC,IARvB,iCAPD,8BAoBH,OAAOhwD,EAKR,SAASuuB,EAAoB7C,EAAOgD,GAAY,UACnChD,GADmC,IACnD,2BAAuB,KAAZ1xC,EAAY,QACnB,GAAIA,EAAEsS,KAAKgrB,SAAS,SAAWh6B,SAAStD,EAAE2zC,cAAgBe,EAAWlf,GACjE,OAAOx1B,GAHoC,8BAOnD,OADAwF,QAAQslB,KAAK,mCACN,KAiBH,SAASowC,EAAuB9yC,GAEpC,GAAIA,aAAmBqrB,MACnB,OACIrrB,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQoN,GADRpN,QAHc,EAQf,GAAIA,aAAmBsrB,SAC1B,OACItrB,EAAQyM,KAAKS,aAAe,IAC5BlN,EAAQmN,UAAY,IACpBnN,EAAQoN,GAAK,KAZC,EAef,GAAIpN,aAAmB4rB,KAAM,CAChC,IAAIze,GAhBc,EAmBlB,OAF0B,OAAtBnN,EAAQmN,gBAA4C16B,IAAtButB,EAAQmN,YACtCA,EAAYnN,EAAQmN,WAEpBnN,EAAQyM,KAAKS,aAAe,IAC5BC,EADAnN,OAGAA,EAAQoN,GAGhB,MACIo2B,cAQD,SAASsZ,EAAwB1b,EAAMoa,EAAaP,GAEvD,IAAKO,EAAY98D,IAAI0iD,EAAK/X,KACtB,OAAO,KAEX,GAAImyB,EAAY98D,IAAI0iD,EAAK/6C,KACrB,OAAO+6C,EAGX,IAAMysB,EAAY5S,EAAW3xB,MAAM8X,EAAK/6C,KAAKklC,YAC7C,IAAKiwB,EAAY98D,IAAImvE,GACjB,OAAO,KAGX,IAAMC,EAAWv5E,OAAOwxB,OAAO,GAAIq7B,GAGnC,OAFA0sB,EAASznE,IAAMwnE,EAERC,EAGJ,SAAS9a,EAA2B+a,EAASlb,GAChD,IAAMmb,EAAanb,EAAK3zC,MAAM,KAExBwuD,EAAWzzE,OAAO+zE,EAAW,IAC7BrjD,EAAW1wB,OAAO+zE,EAAW,IAC7BpjD,EAAU3wB,OAAO+zE,EAAW,IAC5BxlB,EAAUvuD,OAAO+zE,EAAW,IAE9BpwD,EAAS,CACTrW,YAAQ9U,EACRutB,aAASvtB,GAGTo1C,EAAQkmC,EACZ,GAAIL,EAAW,EAAG,CACd,IAAMO,EAAcR,EAAuB5lC,EAAO6lC,GAClD,QAA0Bj7E,IAAtBw7E,EAAYpmC,MACZ,MAAM,IAAItpC,MAGdqf,EAAS,CACLrW,OAFJsgC,EAAQomC,EAAYpmC,MAGhB7nB,QAASiuD,EAAYxuD,MAI7B,IAAIhb,OAAQhS,EA6BZ,OA5BkB,IAAdk4B,QAA6Bl4B,IAAVo1C,IACnBpjC,EAAQojC,EAAMpoB,KAAKkL,GACnB/M,EAAS,CACLrW,OAAQsgC,EACR7nB,QAASvb,KAIA,IAAbmmB,QAA4Bn4B,IAAVgS,GAA4C,OAArBA,EAAMwF,KAAK49B,MAEpDjqB,EAAS,CACLrW,OAAQ9C,EAAMwF,KAAK49B,MACnB7nB,QAASvb,EAAMwF,KAAK49B,MAAMpoB,KAAKmL,KAEf,IAAb49B,QAA4B/1D,IAAVgS,GAA4C,OAArBA,EAAMwF,KAAK49B,MAE3DjqB,EAAS,CACLrW,OAAQ9C,EAAMwF,KAAK49B,MACnB7nB,QAASvb,EAAMwF,KAAK49B,MAAMuZ,KAAKoH,KAEf,IAAbA,QAA4B/1D,IAAVgS,IAEzBmZ,EAAS,CACLrW,OAAQsgC,EACR7nB,QAAS6nB,EAAMuZ,KAAKoH,KAIrB5qC,EASJ,SAASisC,EAA4BttC,GACxC,IAAIxO,EACJ,GAAIwO,aAAgBqvB,MAAsB,uBAAdrvB,EAAKrS,KAA+B,CAC5D,IAAIg7C,OAASzyD,EACT8pB,EAAK2oC,SACLA,EAASl0D,MAAMurB,EAAK2oC,OAAOr0D,SAE/Bkd,EAAW,CACPm3C,OAAQA,EACR8E,SAAU,EACVC,SAAU,GAGd,IAAK,IAAIn5D,EAAI,EAAGyrB,EAAK2oC,QAAUp0D,EAAIyrB,EAAK2oC,OAAOr0D,OAAQC,IACnDid,EAASm3C,OAAOp0D,GAAK,CAAE43D,GAAI,EAAGC,GAAI,QAEtC56C,EAAW,CAAE26C,GAAI,EAAGC,GAAI,EAAGqB,SAAU,EAAGC,SAAU,GAKtD,OAUG,SAA8B1tC,EAAMxO,GACnCwO,aAAgB8uB,MAChB9uB,EAAKtS,KAAKxF,MAAM2e,WAAWrV,SAAWA,EACjCwO,aAAgB+uB,SACrB/uB,EAAKtS,KAAKwV,KAAK2D,WAAWrV,SAAWA,EAChCwO,aAAgBqvB,KACrBrvB,EAAKtS,KAAKmZ,WAAWrV,SAAWA,EACb,uBAAdwO,EAAKrS,KACVqS,EAAK6G,WAAWnZ,KAAKmZ,WAAWrV,SAAWA,EAEtCwO,EAAK6G,aACV7G,EAAK6G,WAAWrV,SAAWA,GAvB/BmgE,CAAqB3xD,EAAMxO,GAEpBA,EA8BJ,SAAS67C,EAAqBrtC,GAAM,UACvC,OAAIA,aAAgB8uB,MACT9uB,EAAKtS,KAAKxF,MAAM2e,WAAWrV,SAClCwO,aAAgB+uB,SACT/uB,EAAKtS,KAAKwV,KAAK2D,WAAWrV,SACjCwO,aAAgBqvB,KACTrvB,EAAKtS,KAAKmZ,WAAWrV,SACb,wBAAfwO,aAAA,EAAAA,EAAMrS,MACCqS,SAAP,UAAOA,EAAM6G,kBAAb,iBAAO,EAAkBnZ,YAAzB,iBAAO,EAAwBmZ,kBAA/B,aAAO,EAAoCrV,SAE3CwO,WAAM6G,WACC7G,EAAK6G,WAAWrV,cAD3B,EAWG,SAAS2mD,EAAwBn4C,GAChCA,aAAgB8uB,cACT9uB,EAAKtS,KAAKxF,MAAM2e,WAAWrV,SAClCwO,aAAgB+uB,iBACT/uB,EAAKtS,KAAKwV,KAAK2D,WAAWrV,SACjCwO,aAAgBqvB,aACTrvB,EAAKtS,KAAKmZ,WAAWrV,SACb,wBAAfwO,aAAA,EAAAA,EAAMrS,cACCqS,EAAK6G,WAAWnZ,KAAKmZ,WAAWrV,SAEvCwO,WAAM6G,mBACC7G,EAAK6G,WAAWrV,W,giCChQvB,SAAS6lD,EAAqBnnC,EAAM9vB,GAAiC,IAA3BwxE,EAA2B,uDAAN,KACnE,SAASC,EAAiBvmC,EAAOyB,GAA+B,IAAxB+kC,EAAwB,uDAAN,KAC9B,OAApBA,IACAA,EAAkB,IAAI7a,KAFkC,UAIvClqB,GAJuC,IAI5D,2BAA4B,KAAjB9nC,EAAiB,QAClBie,EAAOooB,EAAMpoB,KAAKje,GACxB,QAAa/O,IAATgtB,IAAsB4uD,EAAgB3vE,IAAI+gB,EAAK2N,GAAGv1B,YAAtD,CAIA,IAAM+lB,EAASjhB,EAAK8iB,EAAMooB,GAG1B,IAAe,IAAXjqB,EAAkB,CAElB,GAAI6B,EAAKvV,OAAOgrB,SAAS,SAAU,CAC/B,IAAMzwB,EAAQgb,EAAKgN,KAAK6c,MAAM7pB,EAAK0N,gBACD16B,IAA9BgS,EAAM82D,WAAW97C,EAAK2N,KACtBghD,EAAiBvmC,EAAOpjC,EAAM82D,WAAW97C,EAAK2N,IAAKihD,GAI3D,GAAI5uD,EAAKxV,KAAK49B,MAAO,CACjB,IAAMpjC,EAAQgb,EAAKxV,KAAKxF,WACVhS,IAAVgS,QAAgDhS,IAAzBgS,EAAM82D,YAAY,GACzC6S,EAAiB3uD,EAAKxV,KAAK49B,MAAOpjC,EAAM82D,YAAY,IAEpD6S,EAAiB3uD,EAAKxV,KAAK49B,MAAOpoB,EAAKxV,KAAK49B,MAAMyB,UAI1D6kC,GACAA,EAAmB1uD,EAAMooB,GAE7BwmC,EAAgB1vE,IAAI8gB,EAAK2N,GAAGv1B,cAlC4B,+BAqChEu2E,EAAiB3hD,EAAMA,EAAK6c,SAkIzB,SAASglC,EAAmB7hD,EAAMhoB,EAAO28C,GAA0B,IAApBmtB,EAAoB,uDAAJ,GAClE,GAAIA,EAAc7wE,SAAS0jD,IAASA,EAAKh+B,WAAWnZ,KAAKmZ,WAAWw5C,SAChE,MAAO,GAGX2R,EAAc36E,KAAKwtD,GAEnB,IAAIxjC,EAAS,GAEb,SAASvX,EAAI9S,GACT,OAAOkR,EAAM6kC,MAAM/1C,EAAE8S,KAEzB,SAASgjC,EAAI91C,GACT,OAAOkR,EAAM6kC,MAAM/1C,EAAE81C,KAEzB,SAASmlC,EAAO/uD,GACZ,GAAiB,cAAbA,EAAKvV,KAAsB,CAC3B,IAAMg3D,EAAWz0C,EAAKrJ,WAAW4H,QAAQvL,EAAK2D,WAAWnZ,MACzD,OAAQi3D,GAA8B,SAAlBA,EAASh3D,KAEjC,OAAO,EAIX,IAAIukE,GAAoB,EAAOC,GAAqB,EAiBpD,IAhBKttB,EAAKgJ,eAAiB/jD,EAAI+6C,GAAMl3C,KAAKgrB,SAAS,UAC9CksB,EAAKmJ,eAAiBlhB,EAAI+X,GAAMl3C,KAAKgrB,SAAS,UAC3CksB,EAAKmJ,cAAcvuC,WAAW,QAChB,cAAlBqtB,EAAI+X,GAAMl3C,MACVskE,EAAOnlC,EAAI+X,OACXqtB,GAAoB,IACnBrtB,EAAKgJ,eAAiB/jD,EAAI+6C,GAAMl3C,KAAKgrB,SAAS,SAC9CksB,EAAKmJ,eAAiBlhB,EAAI+X,GAAMl3C,KAAKgrB,SAAS,SAC7B,cAAlB7uB,EAAI+6C,GAAMl3C,MACVskE,EAAOnoE,EAAI+6C,OACXstB,GAAqB,GAEzB9wD,EAAOhqB,KAAKwtD,GAIRqtB,GAAqBC,IAA6C,IAAvBA,EAC3C,OAAO9wD,EAGX,SAAS+wD,EAAavtB,GAClB,IAAMl+C,EAAW,GAEjB,GAAIurE,EAAmB,CACnB,IAAMG,EAAYvlC,EAAI+X,GAGtB,GAAsB,cAAlBwtB,EAAU1kE,KAAsB,CAChC,IAAMpS,EAAOspD,EAAKmJ,cACZskB,EAAcD,EAAUxrD,WAAWqJ,KAEzCoiD,EAAYvlC,MAAMn6B,SAAQ,SAAA2/D,GACtBA,EAAO1lC,MAAMj6B,SAAQ,SAAA5b,GACjB,IAAMksB,EAAOqvD,EAAOxlC,MAAM/1C,EAAE8S,KACX,cAAboZ,EAAKvV,MAAwBuV,EAAK2D,WAAWnZ,OAASnS,IACtD8lB,EAASA,EAAO9f,OAAOwwE,EAAmBO,EAAaC,EAAQv7E,EAAGg7E,WAMlF,GAAIC,EAAOI,GACPnqE,EAAM2kC,MAAMj6B,SAAQ,SAAA5b,GACZA,EAAE8S,KAAOuoE,EAAUxhD,KACnBlqB,EAAStP,KAAKL,GACTA,EAAE6vB,WAAWnZ,KAAKmZ,WAAWw5C,UAC9Bh/C,EAAOhqB,KAAKL,WAIrB,CACH,IAAMq7E,EAAU1kE,KAAKgrB,SAAS,WACzBksB,EAAKmJ,gBAAkBnJ,EAAKmJ,cAAcvuC,WAAW,OACtD,OACJ,GAAI4yD,EAAUxrD,WAAWooB,aACrB,OACJ,IAAMgxB,EAAOpb,EAAKmJ,cAAclmB,UAAU,GAC1C5/B,EAAM2kC,MAAMj6B,SAAQ,SAAA5b,GACZA,EAAE8S,KAAOuoE,EAAUxhD,IAAM75B,EAAE62D,eAAiB,OAASoS,IACrDt5D,EAAStP,KAAKL,GACTA,EAAE6vB,WAAWnZ,KAAKmZ,WAAWw5C,UAC9Bh/C,EAAOhqB,KAAKL,QAMhC,GAAIm7E,EAAoB,CACpB,IAAME,EAAYvoE,EAAI+6C,GAGtB,GAAsB,cAAlBwtB,EAAU1kE,KAAsB,CAChC,IAAMpS,EAAOspD,EAAKgJ,cACZykB,EAAcD,EAAUxrD,WAAWqJ,KAEzCoiD,EAAYvlC,MAAMn6B,SAAQ,SAAA2/D,GACtBA,EAAO1lC,MAAMj6B,SAAQ,SAAA5b,GACjB,IAAMksB,EAAOqvD,EAAOxlC,MAAM/1C,EAAE81C,KACX,cAAb5pB,EAAKvV,MAAwBuV,EAAK2D,WAAWnZ,MAAQnS,IACrD8lB,EAASA,EAAO9f,OAAOwwE,EAAmBO,EAAaC,EAAQv7E,EAAGg7E,WAMlF,GAAIC,EAAOI,GACPnqE,EAAM2kC,MAAMj6B,SAAQ,SAAA5b,GACZA,EAAE81C,KAAOulC,EAAUxhD,KACnBlqB,EAAStP,KAAKL,GACdqqB,EAAOhqB,KAAKL,WAGjB,CACH,IAAMq7E,EAAU1kE,KAAKgrB,SAAS,UAAaksB,EAAKgJ,cAC5C,OAEJ,IAAMoS,EAAOpb,EAAKgJ,cAAc/lB,UAAU,GAC1C5/B,EAAM2kC,MAAMj6B,SAAQ,SAAA5b,GACZA,EAAE81C,KAAOulC,EAAUxhD,IAAM75B,EAAEg3D,eAAiB,MAAQiS,IACpDt5D,EAAStP,KAAKL,GACdqqB,EAAOhqB,KAAKL,QAM5B,cAAoB2P,EAApB,eACIyrE,EADY,MAOpB,OAFAA,EAAavtB,GAENxjC,EAQJ,SAASmxD,EAAsBC,GAClC,IAAIC,EAAQ,GACNV,EAAgB,GAoBtB,OAlBAS,EAAU1lC,MAAMn6B,SAAQ,SAAA1K,GAEpBA,EAAM2kC,MAAMj6B,SAAQ,SAAA5b,GAChB,IAAMggE,EAAO+a,EAAmBU,EAAWvqE,EAAOlR,EAAGg7E,GACjDhb,EAAK1iE,OAAS,GACdo+E,EAAMr7E,KAAK2/D,MAInB9uD,EAAM6kC,MAAMn6B,SAAQ,SAAAvX,GAChB,GAAc,cAAVA,EAAEsS,KAAsB,CACxB,IAAMiS,EAAI4yD,EAAsBn3E,EAAEwrB,WAAWqJ,MAC7CwiD,EAAQA,EAAMnxE,OAAOqe,UAM1B8yD,EAQJ,SAAStf,EAAqBljC,GACjC,IAAM6mC,EAAmB,GAqBzB,OApBqByb,EAAsBtiD,GAG9Btd,SAAQ,SAAAokD,GACjB,IADyB,EACrB2b,GAAc,EADO,IAER5b,GAFQ,2BAEd6b,EAFc,YAGF5b,GAHE,IAGrB,2BAAyB,KAAdnS,EAAc,QACrB,GAAI+tB,EAAGzwE,IAAI0iD,GAAO,CACdmS,EAAKpkD,SAAQ,SAAA5b,GAAC,OAAI47E,EAAGxwE,IAAIpL,MACzB27E,GAAc,EACd,QAPa,8BAUrB,GAAIA,EACA,eATR,2BAAmC,iBAFV,8BAapBA,GACD5b,EAAiB1/D,KAAK,IAAI4/D,IAAID,OAG/BD,E,6HC/WJ,SAAS6J,EAAYtoE,GACxB,MAAmB,YAAf,OAAOA,IAA4B,OAARA,EAAqBA,EAChD7D,MAAMoF,QAAQvB,GACPA,EAAI6E,KAAI,SAAAjE,GAAC,OAAI0nE,EAAS1nE,MAEtBlB,OAAO66E,YAAYjS,GAAS,OAAI5oE,OAAOoM,QAAQ9L,MAgBvD,SAASmK,EACZkL,GAIwB,IAHxBkjB,EAGwB,uDAHnB,GACLhL,EAEwB,uDAFF,GACtB7a,EACwB,4DADG9U,EAErButB,EAAUjhB,SAASC,cAAckL,GAUvC,MATW,KAAPkjB,IACApN,EAAQoN,GAAKA,GACbhL,IAAc,IACdA,EAAUjT,SAAQ,SAAAkgE,GACTrvD,EAAQoC,UAAUktD,SAASD,IAC5BrvD,EAAQoC,UAAUzjB,IAAI0wE,MAE9B9nE,GACAA,EAAOpF,YAAY6d,GAChBA,EAMJ,SAAS8mD,EAAwBjyE,EAAQgO,GAE5C,IADA,IAAMpN,EAAIZ,EACV,MAAyBN,OAAOoM,QAAQkC,GAAxC,eAAgD,uBAApCnR,EAAoC,KAA/BkW,EAA+B,KACtClW,KAAOmD,IAAMY,EAAE/D,GAAOkW,GAEhC,OAAOnS,I,mBCvDX,OAmCA,SAAUsoB,GAER,aAEA,IAAIwxD,EAAO,SAAS32E,GAClB,MAAsC,IAA9BR,KAAKoD,IAAI5C,GAAKR,KAAKoD,KAAK5C,KAG9B42E,EAAO,SAAS52E,GAClB,MAAsC,IAA9BR,KAAKoD,IAAI5C,GAAKR,KAAKoD,KAAK5C,KAqD9B62E,EAAc,WAChB,MAAMC,YAAY,kBAUpB,SAASC,EAASh8E,EAAGmG,GAEnB,IAAI81E,EAAKx3E,KAAKgE,IAAIzI,GACdk8E,EAAKz3E,KAAKgE,IAAItC,GAElB,OAAU,IAANnG,EACKyE,KAAKiF,IAAIwyE,GAGR,IAAN/1E,EACK1B,KAAKiF,IAAIuyE,GAGdA,EAAK,KAAQC,EAAK,IACa,GAA1Bz3E,KAAKiF,IAAI1J,EAAIA,EAAImG,EAAIA,GAmCvB1B,KAAKiF,IAAI1J,EAAIyE,KAAK2O,IAAI3O,KAAKu/C,MAAM79C,EAAGnG,KAyH7C,SAASm8E,EAAQn8E,EAAGmG,GAElB,KAAM1H,gBAAgB09E,GACpB,OAAO,IAAIA,EAAQn8E,EAAGmG,GAGxB,IAAIsnB,EA5HM,SAASztB,EAAGmG,GAEtB,IAAIsnB,EAAI,CAAC,GAAM,EAAG,GAAM,GAExB,GAAIztB,QACFytB,EAAM,GACEA,EAAM,GAAI,OACb,QAAU3uB,IAANqH,EACTsnB,EAAM,GAAIztB,EACVytB,EAAM,GAAItnB,OAEV,cAAenG,GAEb,IAAK,SAEH,GAAI,OAAQA,GAAK,OAAQA,EACvBytB,EAAM,GAAIztB,EAAM,GAChBytB,EAAM,GAAIztB,EAAM,QACX,GAAI,QAASA,GAAK,QAASA,EAAG,CACnC,IAAKsG,OAAO+5D,SAASrgE,EAAO,MAAMsG,OAAO+5D,SAASrgE,EAAO,KACvD,OAAOm8E,EAAkB,SAE3B1uD,EAAM,GAAIztB,EAAO,IAAIyE,KAAK2O,IAAIpT,EAAO,KACrCytB,EAAM,GAAIztB,EAAO,IAAIyE,KAAK6O,IAAItT,EAAO,UAChC,GAAI,MAAOA,GAAK,QAASA,EAAG,CACjC,IAAKsG,OAAO+5D,SAASrgE,EAAK,IAAMsG,OAAO+5D,SAASrgE,EAAO,KACrD,OAAOm8E,EAAkB,SAE3B1uD,EAAM,GAAIztB,EAAK,EAAIyE,KAAK2O,IAAIpT,EAAO,KACnCytB,EAAM,GAAIztB,EAAK,EAAIyE,KAAK6O,IAAItT,EAAO,UACb,IAAbA,EAAE9C,QACXuwB,EAAM,GAAIztB,EAAE,GACZytB,EAAM,GAAIztB,EAAE,IAEZ87E,IAEF,MAEF,IAAK,SAEHruD,EAAM,GACEA,EAAM,GAAI,EAElB,IAAI2uD,EAASp8E,EAAEq8E,MAAM,yCACjBjoE,EAAO,EACP3C,EAAQ,EAEG,OAAX2qE,GACFN,IAGF,IAAK,IAAI3+E,EAAI,EAAGA,EAAIi/E,EAAOl/E,OAAQC,IAAK,CAEtC,IAAIgO,EAAIixE,EAAOj/E,GAEL,MAANgO,GAAmB,OAANA,GAAoB,OAANA,IAEd,MAANA,EACTiJ,IACe,MAANjJ,EACTsG,IACe,MAANtG,GAAmB,MAANA,GAElBiJ,EAAO3C,IAAU,GACnBqqE,IAGoB,MAAlBM,EAAOj/E,EAAI,IAAegK,MAAMi1E,EAAOj/E,EAAI,IAI7CswB,EAAM,IAAK3J,YAAYrS,EAAQ,EAAI,IAAM,IAAM,MAH/Cgc,EAAM,IAAK3J,YAAYrS,EAAQ,EAAI,IAAM,IAAM2qE,EAAOj/E,EAAI,IAC1DA,KAIFiX,EAAO3C,EAAQ,KAIX2C,EAAO3C,IAAU,GAAKtK,MAAMgE,KAC9B2wE,IAGoB,MAAlBM,EAAOj/E,EAAI,IAAgC,MAAlBi/E,EAAOj/E,EAAI,IACtCswB,EAAM,IAAK3J,YAAYrS,EAAQ,EAAI,IAAM,IAAMtG,GAC/ChO,KAEAswB,EAAM,IAAK3J,YAAYrS,EAAQ,EAAI,IAAM,IAAMtG,GAEjDiJ,EAAO3C,EAAQ,IAKf2C,EAAO3C,EAAQ,GACjBqqE,IAEF,MAEF,IAAK,SACHruD,EAAM,GAAI,EACVA,EAAM,GAAIztB,EACV,MAEF,QACE87E,IAQN,OALI30E,MAAMsmB,EAAM,KAAMtmB,MAAMsmB,EAAM,IAK3BA,EAaC9R,CAAM3b,EAAGmG,GAEjB1H,KAAS,GAAIgvB,EAAM,GACnBhvB,KAAS,GAAIgvB,EAAM,GAGrB0uD,EAAQ18E,UAAY,CAElB,GAAM,EACN,GAAM,EAON,KAAQ,WAEN,IAAIgJ,EAAMhK,KAAU,MAEpB,OAAO,IAAI09E,EACH19E,KAAS,GAAIgK,EACbhK,KAAS,GAAIgK,IAQvB,IAAO,SAASzI,EAAGmG,GAEjB,IAAIsnB,EAAI,IAAI0uD,EAAQn8E,EAAGmG,GAGvB,OAAI1H,KAAiB,cAAOgvB,EAAc,aACjC0uD,EAAa,IAIlB19E,KAAiB,cAAOgvB,EAAc,aACjC0uD,EAAkB,SAGpB,IAAIA,EACH19E,KAAS,GAAIgvB,EAAM,GACnBhvB,KAAS,GAAIgvB,EAAM,KAQ7B,IAAO,SAASztB,EAAGmG,GAEjB,IAAIsnB,EAAI,IAAI0uD,EAAQn8E,EAAGmG,GAGvB,OAAI1H,KAAiB,cAAOgvB,EAAc,aACjC0uD,EAAa,IAIlB19E,KAAiB,cAAOgvB,EAAc,aACjC0uD,EAAkB,SAGpB,IAAIA,EACH19E,KAAS,GAAIgvB,EAAM,GACnBhvB,KAAS,GAAIgvB,EAAM,KAQ7B,IAAO,SAASztB,EAAGmG,GAEjB,IAAIsnB,EAAI,IAAI0uD,EAAQn8E,EAAGmG,GAGvB,OAAK1H,KAAiB,cAAOgvB,EAAU,UAAShvB,KAAa,UAAOgvB,EAAc,aACzE0uD,EAAa,IAIlB19E,KAAiB,cAAOgvB,EAAc,aACjC0uD,EAAkB,SAIX,IAAZ1uD,EAAM,IAA0B,IAAfhvB,KAAS,GACrB,IAAI09E,EAAQ19E,KAAS,GAAIgvB,EAAM,GAAG,GAGpC,IAAI0uD,EACH19E,KAAS,GAAIgvB,EAAM,GAAIhvB,KAAS,GAAIgvB,EAAM,GAC1ChvB,KAAS,GAAIgvB,EAAM,GAAIhvB,KAAS,GAAIgvB,EAAM,KAQpD,IAAO,SAASztB,EAAGmG,GAEjB,IAAIsnB,EAAI,IAAI0uD,EAAQn8E,EAAGmG,GAGvB,GAAK1H,KAAa,UAAOgvB,EAAU,UAAShvB,KAAiB,cAAOgvB,EAAc,aAChF,OAAO0uD,EAAa,IAItB,GAAI19E,KAAiB,cAAOgvB,EAAU,SACpC,OAAO0uD,EAAkB,SAI3B,GAAI19E,KAAa,UAAOgvB,EAAc,aACpC,OAAO0uD,EAAc,KAGvBn8E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEb,IAEI+pB,EAAGvjB,EAFHkG,EAAIsiB,EAAM,GACVtf,EAAIsf,EAAM,GAGd,OAAI,IAAMtf,EAED,IAAIguE,EAAQn8E,EAAImL,EAAGhF,EAAIgF,GAG5B1G,KAAKgE,IAAI0C,GAAK1G,KAAKgE,IAAI0F,GAKlB,IAAIguE,GACFn8E,GAJTiF,EAAIkG,EAAIgD,GAIShI,IAHjBqiB,EAAIrd,EAAIlG,EAAIkJ,IAIHhI,EAAIlB,EAAIjF,GAAKwoB,GAOf,IAAI2zD,GACFn8E,EAAImG,GAJblB,EAAIkJ,EAAIhD,KACRqd,EAAIra,EAAIlJ,EAAIkG,IAIHhF,EAAInG,EAAIiF,GAAKujB,IAS1B,IAAO,SAASxoB,EAAGmG,GAEjB,IAAIsnB,EAAI,IAAI0uD,EAAQn8E,EAAGmG,GAKvB,GAHAnG,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAETgvB,EAAU,SACZ,OAAO0uD,EAAa,IAItB,GAAgB,IAAZ1uD,EAAM,GAAS,CAEjB,GAAU,IAANtnB,EAEF,OAAO,IAAIg2E,EAAQ13E,KAAK2B,IAAIpG,EAAGytB,EAAM,IAAI,GAEpC,GAAU,IAANztB,EAET,QAASytB,EAAM,GAAI,EAAI,GAAK,GAC1B,KAAK,EACH,OAAO,IAAI0uD,EAAQ13E,KAAK2B,IAAID,EAAGsnB,EAAM,IAAI,GAC3C,KAAK,EACH,OAAO,IAAI0uD,EAAQ,EAAG13E,KAAK2B,IAAID,EAAGsnB,EAAM,KAC1C,KAAK,EACH,OAAO,IAAI0uD,GAAS13E,KAAK2B,IAAID,EAAGsnB,EAAM,IAAI,GAC5C,KAAK,EACH,OAAO,IAAI0uD,EAAQ,GAAI13E,KAAK2B,IAAID,EAAGsnB,EAAM,MAwBjD,GAAU,IAANztB,GAAiB,IAANmG,GAAWsnB,EAAM,GAAI,GAAKA,EAAM,IAAK,EAClD,OAAO0uD,EAAc,KAGvB,IAAIn+E,EAAMyG,KAAKu/C,MAAM79C,EAAGnG,GACpBs8E,EAAMN,EAASh8E,EAAGmG,GAItB,OAFAnG,EAAIyE,KAAKoD,IAAI4lB,EAAM,GAAI6uD,EAAM7uD,EAAM,GAAIzvB,GACvCmI,EAAIsnB,EAAM,GAAI6uD,EAAM7uD,EAAM,GAAIzvB,EACvB,IAAIm+E,EACHn8E,EAAIyE,KAAK2O,IAAIjN,GACbnG,EAAIyE,KAAK6O,IAAInN,KAQvB,KAAQ,WAEN,IAIIqyB,EAAI+jD,EAJJv8E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GACbokB,EAAIpkB,KAAU,MAIlB,GAAIuB,GAAK,EAAG,CAEV,GAAU,IAANmG,EACF,OAAO,IAAIg2E,EAAQ13E,KAAKC,KAAK1E,GAAI,GAGnCw4B,EAAK,GAAM/zB,KAAKC,KAAK,GAAOme,EAAI7iB,SAEhCw4B,EAAK/zB,KAAKgE,IAAItC,GAAK1B,KAAKC,KAAK,GAAKme,EAAI7iB,IASxC,OALEu8E,EADEv8E,GAAK,EACF,GAAMyE,KAAKC,KAAK,GAAOme,EAAI7iB,IAE3ByE,KAAKgE,IAAItC,GAAK1B,KAAKC,KAAK,GAAKme,EAAI7iB,IAGjC,IAAIm8E,EAAQ3jD,EAAIryB,EAAI,GAAKo2E,EAAKA,IAQvC,IAAO,WAEL,IAAIz3E,EAAML,KAAKoD,IAAIpJ,KAAS,IAK5B,OAHIA,KAAS,GAGN,IAAI09E,EACHr3E,EAAML,KAAK2O,IAAI3U,KAAS,IACxBqG,EAAML,KAAK6O,IAAI7U,KAAS,MAWlC,MAAS,WAQP,IAAIuB,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,OAAO,IAAI09E,EACH13E,KAAK+3E,MAAMx8E,GAAKyE,KAAK2O,IAAIjN,GAjhBzB,SAASlB,GACnB,IAAIw3E,EAAQh4E,KAAKsO,GAAG,EACpB,GAAI9N,GAAKw3E,GAASx3E,EAAIw3E,EACpB,OAAQh4E,KAAK2O,IAAInO,GAAK,EAGxB,IAAIy3E,EAAKz3E,EAAIA,EACb,OAAOy3E,GACGA,GACL,EAAE,GAAKA,IACJ,EAAE,IAAMA,GACP,EAAE,MAAQA,IACP,EAAE,QAAUA,GACX,EAAE,WAAaA,IACZ,EAAE,YAAcA,GACf,EAAE,qBAPf,IAygBoCC,CAAMx2E,GACpC1B,KAAKoD,IAAI7H,GAAKyE,KAAK6O,IAAInN,KAQjC,IAAO,WAEL,IAAInG,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAMjB,OAAO,IAAI09E,EACHH,EAASh8E,EAAGmG,GACZ1B,KAAKu/C,MAAM79C,EAAGnG,KAQxB,IAAO,WAEL,OAthBiBiF,EAshBJxG,KAAS,GAthBFuH,EAshBKvH,KAAS,GAphBhCuB,EAAIyE,KAAKgE,IAAIxD,GACbkB,EAAI1B,KAAKgE,IAAIzC,GAEbhG,EAAI,KAAQmG,EAAI,IACX1B,KAAKC,KAAK1E,EAAIA,EAAImG,EAAIA,IAG3BnG,EAAImG,GACNnG,EAAImG,EACJA,EAAIlB,EAAIe,GAERG,EAAIH,EAAIf,EAEHjF,EAAIyE,KAAKC,KAAK,EAAIyB,EAAIA,IAfnB,IAASlB,EAAGe,EAElBhG,EACAmG,GA2hBJ,IAAO,WAEL,OAAO1B,KAAKu/C,MAAMvlD,KAAS,GAAGA,KAAS,KAQzC,IAAO,WAIL,IAAIuB,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,OAAO,IAAI09E,EACH13E,KAAK6O,IAAItT,GAAK47E,EAAKz1E,GACnB1B,KAAK2O,IAAIpT,GAAK67E,EAAK11E,KAQ7B,IAAO,WAIL,IAAInG,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,OAAO,IAAI09E,EACH13E,KAAK2O,IAAIpT,GAAK47E,EAAKz1E,IAClB1B,KAAK6O,IAAItT,GAAK67E,EAAK11E,KAQ9B,IAAO,WAIL,IAAInG,EAAI,EAAIvB,KAAS,GACjB0H,EAAI,EAAI1H,KAAS,GACjB0P,EAAI1J,KAAK2O,IAAIpT,GAAK47E,EAAKz1E,GAE3B,OAAO,IAAIg2E,EACH13E,KAAK6O,IAAItT,GAAKmO,EACd0tE,EAAK11E,GAAKgI,IAQpB,IAAO,WAIL,IAAInO,EAAI,EAAIvB,KAAS,GACjB0H,EAAI,EAAI1H,KAAS,GACjB0P,EAAI1J,KAAK2O,IAAIpT,GAAK47E,EAAKz1E,GAE3B,OAAO,IAAIg2E,GACF13E,KAAK6O,IAAItT,GAAKmO,EACf0tE,EAAK11E,GAAKgI,IAQpB,IAAO,WAIL,IAAInO,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GACb0P,EAAI,GAAMytE,EAAK,EAAIz1E,GAAK,GAAM1B,KAAK2O,IAAI,EAAIpT,GAE/C,OAAO,IAAIm8E,EACH13E,KAAK2O,IAAIpT,GAAK47E,EAAKz1E,GAAKgI,EACxB1J,KAAK6O,IAAItT,GAAK67E,EAAK11E,GAAKgI,IAQlC,IAAO,WAIL,IAAInO,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GACb0P,EAAI,GAAMytE,EAAK,EAAIz1E,GAAK,GAAM1B,KAAK2O,IAAI,EAAIpT,GAE/C,OAAO,IAAIm8E,EACH13E,KAAK6O,IAAItT,GAAK47E,EAAKz1E,GAAKgI,GACvB1J,KAAK2O,IAAIpT,GAAK67E,EAAK11E,GAAKgI,IAQnC,KAAQ,WAIN,IAAInO,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEbm+E,EAAK,IAAIT,EACLh2E,EAAIA,EAAInG,EAAIA,EAAI,GACf,EAAIA,EAAImG,GAAS,OAEtB02E,EAAK,IAAIV,EACLS,EAAO,GAAIz2E,EACXy2E,EAAO,GAAI58E,GAAQ,MAE3B,OAAO,IAAIm8E,EAAQU,EAAO,IAAIA,EAAO,KAQvC,KAAQ,WAIN,IAAI78E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEbm+E,EAAK,IAAIT,EACLh2E,EAAIA,EAAInG,EAAIA,EAAI,GACf,EAAIA,EAAImG,GAAS,OAEtB02E,EAAK,IAAIV,EACLS,EAAO,GAAIz2E,EACXy2E,EAAO,GAAI58E,GAAQ,MAE3B,OAAO,IAAIm8E,EAAQ13E,KAAKsO,GAAK,EAAI8pE,EAAO,GAAGA,EAAO,KAQpD,KAAQ,WAIN,IAAI78E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,GAAU,IAANuB,EAAS,CAEX,GAAU,IAANmG,EACF,OAAO,IAAIg2E,EAAQ,EAAGW,KAGxB,IAAW,IAAP32E,EACF,OAAO,IAAIg2E,EAAQ,GAAG,KAI1B,IAAIhuE,EAAInO,EAAIA,GAAK,EAAMmG,IAAM,EAAMA,GAE/By2E,EAAK,IAAIT,GACJ,EAAIh2E,EAAIA,EAAInG,EAAIA,GAAKmO,GACrB,EAAInO,EAAImO,GAAGzE,MAEpB,OAAO,IAAIyyE,GAAS,GAAMS,EAAO,GAAG,GAAMA,EAAO,KAQnD,KAAQ,WAIN,IAAI58E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,GAAU,IAAN0H,EACF,OAAO,IAAIg2E,EAAQ13E,KAAKu/C,MAAM,EAAGhkD,GAAI,GAGvC,IAAImO,EAAInO,EAAIA,EAAImG,EAAIA,EACpB,OAAc,IAANgI,EACE,IAAIguE,EACEn8E,EAAImO,GACHhI,EAAIgI,GAAG4uE,OACd,IAAIZ,EACS,IAANn8E,EAAWA,EAAI,EAAI,EACb,IAANmG,GAAYA,EAAI,EAAI,GAAG42E,QAQ1C,KAAQ,WAIN,IAAI/8E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,GAAU,IAANuB,GAAiB,IAANmG,EACb,OAAO,IAAIg2E,EAAQ,EAAGW,KAGxB,IAAI3uE,EAAInO,EAAIA,EAAImG,EAAIA,EACpB,OAAc,IAANgI,EACE,IAAIguE,EACEn8E,EAAImO,GACHhI,EAAIgI,GAAG6uE,OACd,IAAIb,EACS,IAANn8E,EAAWA,EAAI,EAAI,EACb,IAANmG,GAAYA,EAAI,EAAI,GAAG62E,QAQ1C,KAAQ,WAIN,IAAIh9E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,GAAU,IAANuB,GAAiB,IAANmG,EACb,OAAO,IAAIg2E,EAAQ13E,KAAKsO,GAAK,EAAG+pE,KAGlC,IAAI3uE,EAAInO,EAAIA,EAAImG,EAAIA,EACpB,OAAc,IAANgI,EACE,IAAIguE,EACEn8E,EAAImO,GACHhI,EAAIgI,GAAG8uE,OACd,IAAId,EACS,IAANn8E,EAAWA,EAAI,EAAI,EACb,IAANmG,GAAYA,EAAI,EAAI,GAAG82E,QAQ1C,KAAQ,WAIN,IAAIj9E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,OAAO,IAAI09E,EACHN,EAAK77E,GAAKyE,KAAK2O,IAAIjN,GACnBy1E,EAAK57E,GAAKyE,KAAK6O,IAAInN,KAQ7B,KAAQ,WAIN,IAAInG,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,OAAO,IAAI09E,EACHP,EAAK57E,GAAKyE,KAAK2O,IAAIjN,GACnB01E,EAAK77E,GAAKyE,KAAK6O,IAAInN,KAQ7B,KAAQ,WAIN,IAAInG,EAAI,EAAIvB,KAAS,GACjB0H,EAAI,EAAI1H,KAAS,GACjB0P,EAAIytE,EAAK57E,GAAKyE,KAAK2O,IAAIjN,GAE3B,OAAO,IAAIg2E,EACHN,EAAK77E,GAAKmO,EACV1J,KAAK6O,IAAInN,GAAKgI,IAQxB,KAAQ,WAIN,IAAInO,EAAI,EAAIvB,KAAS,GACjB0H,EAAI,EAAI1H,KAAS,GACjB0P,EAAIytE,EAAK57E,GAAKyE,KAAK2O,IAAIjN,GAE3B,OAAO,IAAIg2E,EACHN,EAAK77E,GAAKmO,GACT1J,KAAK6O,IAAInN,GAAKgI,IAQzB,KAAQ,WAIN,IAAInO,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GACb0P,EAAI1J,KAAK2O,IAAI,EAAIjN,GAAKy1E,EAAK,EAAI57E,GAEnC,OAAO,IAAIm8E,GACF,EAAIN,EAAK77E,GAAKyE,KAAK2O,IAAIjN,GAAKgI,EAC7B,EAAIytE,EAAK57E,GAAKyE,KAAK6O,IAAInN,GAAKgI,IAQtC,KAAQ,WAIN,IAAInO,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GACb0P,EAAI1J,KAAK2O,IAAI,EAAIjN,GAAKy1E,EAAK,EAAI57E,GAEnC,OAAO,IAAIm8E,EACH,EAAIP,EAAK57E,GAAKyE,KAAK2O,IAAIjN,GAAKgI,GAC3B,EAAI0tE,EAAK77E,GAAKyE,KAAK6O,IAAInN,GAAKgI,IAQvC,MAAS,WAIP,IAAIrJ,EAAMrG,KAAS,GACnBA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAIqG,EACb,IAAIosE,EAAMzyE,KAAW,OAQrB,OANAA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAIqG,EACbA,EAAMosE,EAAQ,GAEdA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIpsE,EACLosE,GAQT,MAAS,WAIP,IAAIA,EAAMzyE,KAAW,OACrB,GAAIyyE,EAAQ,IAAK,EAAG,CAClB,IAAIpsE,EAAMosE,EAAQ,GAClBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIpsE,OAERA,EAAMosE,EAAQ,GAClBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIpsE,EAEd,OAAOosE,GAQT,MAAS,WAIP,IAAIlxE,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEby+E,EAAOl9E,EAAI,GAAW,IAANmG,EAChBg3E,EAAW,EAAIn9E,EACfo9E,EAAU,EAAIp9E,EACdmO,EAAIgvE,EAAWA,EAAWh3E,EAAIA,EAE9BlB,EAAW,IAANkJ,EACC,IAAIguE,GACGiB,EAAUD,EAAWh3E,EAAIA,GAAKgI,GAC9BhI,EAAIg3E,EAAWC,EAAUj3E,GAAKgI,GACrC,IAAIguE,GACU,IAAPn8E,EAAaA,EAAI,EAAK,EAChB,IAANmG,EAAYA,EAAI,EAAK,GAElCwC,EAAO1D,EAAM,GAMjB,OALAA,EAAM,GAAI+2E,EAAS/2E,EAAM,GAAGA,EAAM,IAAK,EACvCA,EAAM,GAAIR,KAAKu/C,MAAM/+C,EAAM,GAAG0D,GAAQ,EAClCu0E,IACFj4E,EAAM,IAAKA,EAAM,IAEZA,GAQT,MAAS,WAIP,IAAIjF,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,GAAU,IAANuB,GAAiB,IAANmG,EACb,OAAO,IAAIg2E,EAAQ,EAAG13E,KAAKsO,GAAK,GAGlC,IAAI5E,EAAInO,EAAIA,EAAImG,EAAIA,EACpB,OAAc,IAANgI,EACE,IAAIguE,EACEn8E,EAAImO,GACHhI,EAAIgI,GAAGkvE,QACd,IAAIlB,EACS,IAANn8E,EAAWA,EAAI,EAAI,EACb,IAANmG,GAAYA,EAAI,EAAI,GAAGk3E,SAQ1C,MAAS,WAIP,IAAIr9E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,GAAU,IAAN0H,EAEF,OAAO,IAAIg2E,EACI,IAANn8E,EACCyE,KAAKiF,IAAI1J,EAAIyE,KAAKC,KAAK1E,EAAIA,EAAI,IAC/B88E,IAAU,GAGtB,IAAI3uE,EAAInO,EAAIA,EAAImG,EAAIA,EACpB,OAAc,IAANgI,EACE,IAAIguE,EACEn8E,EAAImO,GACHhI,EAAIgI,GAAGmvE,QACd,IAAInB,EACS,IAANn8E,EAAWA,EAAI,EAAI,EACb,IAANmG,GAAYA,EAAI,EAAI,GAAGm3E,SAQ1C,MAAS,WAIP,IAAIt9E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEjB,GAAIA,KAAa,SACf,OAAO09E,EAAkB,SAG3B,IAAIhuE,EAAInO,EAAIA,EAAImG,EAAIA,EACpB,OAAc,IAANgI,EACE,IAAIguE,EACEn8E,EAAImO,GACHhI,EAAIgI,GAAGovE,QACd,IAAIpB,EACS,IAANn8E,EAAWA,EAAI,EAAI,EACb,IAANmG,GAAYA,EAAI,EAAI,GAAGo3E,SAQ1C,QAAW,WAGT,GAAI9+E,KAAa,SACf,OAAO09E,EAAkB,SAG3B,GAAI19E,KAAiB,aACnB,OAAO09E,EAAc,KAGvB,IAAIn8E,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GAEb0P,EAAInO,EAAIA,EAAImG,EAAIA,EAEpB,OAAO,IAAIg2E,EAAQn8E,EAAImO,GAAIhI,EAAIgI,IAQjC,UAAa,WAEX,OAAO,IAAIguE,EAAQ19E,KAAS,IAAIA,KAAS,KAQ3C,IAAO,WAEL,OAAO,IAAI09E,GAAS19E,KAAS,IAAIA,KAAS,KAQ5C,KAAQ,SAAS++E,GAIf,OAFAA,EAAS/4E,KAAK2B,IAAI,GAAIo3E,GAAU,GAEzB,IAAIrB,EACH13E,KAAKwwB,KAAKx2B,KAAS,GAAI++E,GAAUA,EACjC/4E,KAAKwwB,KAAKx2B,KAAS,GAAI++E,GAAUA,IAQ3C,MAAS,SAASA,GAIhB,OAFAA,EAAS/4E,KAAK2B,IAAI,GAAIo3E,GAAU,GAEzB,IAAIrB,EACH13E,KAAKiC,MAAMjI,KAAS,GAAI++E,GAAUA,EAClC/4E,KAAKiC,MAAMjI,KAAS,GAAI++E,GAAUA,IAQ5C,MAAS,SAASA,GAIhB,OAFAA,EAAS/4E,KAAK2B,IAAI,GAAIo3E,GAAU,GAEzB,IAAIrB,EACH13E,KAAKgD,MAAMhJ,KAAS,GAAI++E,GAAUA,EAClC/4E,KAAKgD,MAAMhJ,KAAS,GAAI++E,GAAUA,IAU5C,OAAU,SAASx9E,EAAGmG,GAEpB,IAAIsnB,EAAI,IAAI0uD,EAAQn8E,EAAGmG,GAEvB,OAAO1B,KAAKgE,IAAIglB,EAAM,GAAIhvB,KAAS,KAAM09E,EAAiB,SAClD13E,KAAKgE,IAAIglB,EAAM,GAAIhvB,KAAS,KAAM09E,EAAiB,SAQ7D,MAAS,WAEP,OAAO,IAAIA,EAAQ19E,KAAS,GAAGA,KAAS,KAQ1C,SAAY,WAEV,IAAIuB,EAAIvB,KAAS,GACb0H,EAAI1H,KAAS,GACbgI,EAAM,GAEV,OAAIhI,KAAY,QACP,MAGLA,KAAiB,aACZ,WAIC,IAAN0H,EACKM,EAAMzG,GAGL,IAANA,GACFyG,GAAMzG,EACNyG,GAAM,IACFN,EAAI,GACNA,GAAKA,EACLM,GAAM,KAENA,GAAM,IAERA,GAAM,KACGN,EAAI,IACbA,GAAKA,EACLM,GAAM,KAGJ,IAAMN,IACRM,GAAMN,GAEDM,EAAM,MAQf,SAAY,WAEV,MAAO,CAAChI,KAAS,GAAGA,KAAS,KAQ/B,QAAW,WAET,OAAmB,IAAfA,KAAS,GACJA,KAAS,GAEX,MAQT,MAAS,WACP,OAAO0I,MAAM1I,KAAS,KAAM0I,MAAM1I,KAAS,KAS7C,OAAU,WACR,OAAsB,IAAfA,KAAS,IAA0B,IAAfA,KAAS,IAStC,SAAY,WACV,OAAO4hE,SAAS5hE,KAAS,KAAM4hE,SAAS5hE,KAAS,KASnD,WAAc,WACZ,QAASA,KAAY,SAAOA,KAAe,cAI/C09E,EAAc,KAAI,IAAIA,EAAQ,EAAG,GACjCA,EAAa,IAAI,IAAIA,EAAQ,EAAG,GAChCA,EAAW,EAAI,IAAIA,EAAQ,EAAG,GAC9BA,EAAY,GAAI,IAAIA,EAAQ13E,KAAKsO,GAAI,GACrCopE,EAAW,EAAI,IAAIA,EAAQ13E,KAAKg5E,EAAG,GACnCtB,EAAkB,SAAI,IAAIA,EAAQW,IAAUA,KAC5CX,EAAa,IAAI,IAAIA,EAAQuB,IAAKA,KAClCvB,EAAiB,QAAI,WAKlB,KAFU,EAAF,WACP,OAAOA,GACR,QAFM,OAEN,aAv0CL,I,cCbA93E,EAAOC,QAAU,CACfq5E,SAAU,EAAQ,KAElB/sE,OAAQ,EAAQ,MAChBgtE,MAAO,EAAQ,MACfC,KAAM,CACJvsC,KAAM,aACNwsC,OAAQ,gBAEVC,QAAS,EAAQ,Q,4BC7BnB,IAAIl+C,EAAI,EAAQ,MACZm+C,EAAY,EAAQ,MAExB35E,EAAOC,QAAU,CACfm7B,IAIF,SAAaquB,GACX,IAAImwB,EAA+B,WAAxBnwB,EAAE5Z,QAAQgqC,UACjBF,EAAUlwB,EAUd,SAAkBA,GAChB,OAAO,SAASluD,GACd,OAAOkuD,EAAEL,KAAK7tD,GAAGu+E,QAZJC,CAAStwB,IAiB5B,SAAgBA,GACd,IAAImwB,EAAM,GACN1L,EAAQ,GACR8L,EAAU,GAmBd,OADAx+C,EAAErkB,QAAQsyC,EAAEnY,SAhBZ,SAAS2oC,EAAIl5E,GACPy6B,EAAE90B,IAAIszE,EAASj5E,KAGnBi5E,EAAQj5E,IAAK,EACbmtE,EAAMntE,IAAK,EACXy6B,EAAErkB,QAAQsyC,EAAE8G,SAASxvD,IAAI,SAASxF,GAC5BigC,EAAE90B,IAAIwnE,EAAO3yE,EAAEuvD,GACjB8uB,EAAIh+E,KAAKL,GAET0+E,EAAI1+E,EAAEuvD,aAGHojB,EAAMntE,OAIR64E,EAtCHM,CAAOzwB,GACXjuB,EAAErkB,QAAQyiE,GAAK,SAASr+E,GACtB,IAAIk6B,EAAQg0B,EAAEL,KAAK7tD,GACnBkuD,EAAE0wB,WAAW5+E,GACbk6B,EAAM2kD,YAAc7+E,EAAEuE,KACtB21B,EAAM4kD,UAAW,EACjB5wB,EAAEsb,QAAQxpE,EAAEuvD,EAAGvvD,EAAEwF,EAAG00B,EAAO+F,EAAE8+C,SAAS,YAZxCC,KA+CF,SAAc9wB,GACZjuB,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAIk6B,EAAQg0B,EAAEL,KAAK7tD,GACnB,GAAIk6B,EAAM4kD,SAAU,CAClB5wB,EAAE0wB,WAAW5+E,GAEb,IAAI6+E,EAAc3kD,EAAM2kD,mBACjB3kD,EAAM4kD,gBACN5kD,EAAM2kD,YACb3wB,EAAEsb,QAAQxpE,EAAEuvD,EAAGvvD,EAAEwF,EAAG00B,EAAO2kD,U,eC/DjC,IAAI5+C,EAAI,EAAQ,MACZg+C,EAAO,EAAQ,MA2BnB,SAASgB,EAAc/wB,EAAGgqB,EAAMnrE,EAAQmyE,EAAIC,EAAQC,GAClD,IAAIllD,EAAQ,CAAEtuB,MAAO,EAAGG,OAAQ,EAAGqzE,KAAMA,EAAMC,WAAYnH,GACvDoH,EAAOH,EAAOjH,GAAMkH,EAAO,GAC3BG,EAAOtB,EAAKuB,aAAatxB,EAAG,SAAUh0B,EAAOntB,GACjDoyE,EAAOjH,GAAMkH,GAAQG,EACrBrxB,EAAEuxB,UAAUF,EAAML,GACdI,GACFpxB,EAAEsb,QAAQ8V,EAAMC,EAAM,CAAEhB,OAAQ,IAhCpC95E,EAAOC,QAEP,SAA2BwpD,GAoBzBjuB,EAAErkB,QAAQsyC,EAAEv+C,YAnBZ,SAAS+uE,EAAIl5E,GACX,IAAImK,EAAWu+C,EAAEv+C,SAASnK,GACtB0mB,EAAOgiC,EAAEhiC,KAAK1mB,GAKlB,GAJImK,EAASrS,QACX2iC,EAAErkB,QAAQjM,EAAU+uE,GAGlBz+C,EAAE90B,IAAI+gB,EAAM,WAAY,CAC1BA,EAAKwzD,WAAa,GAClBxzD,EAAKyzD,YAAc,GACnB,IAAK,IAAIP,EAAOlzD,EAAK0zD,QAASC,EAAU3zD,EAAK2zD,QAAU,EACrDT,EAAOS,IACLT,EACFH,EAAc/wB,EAAG,aAAc,MAAO1oD,EAAG0mB,EAAMkzD,GAC/CH,EAAc/wB,EAAG,cAAe,MAAO1oD,EAAG0mB,EAAMkzD,S,4BClBxD,IAAIn/C,EAAI,EAAQ,MA0BhB,SAAS6/C,EAAgB5xB,GACvBjuB,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAAKu6E,EAAmB7xB,EAAEhiC,KAAK1mB,OAC7Dy6B,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAAK+/E,EAAmB7xB,EAAEL,KAAK7tD,OAG/D,SAAS+/E,EAAmBvR,GAC1B,IAAIjf,EAAIif,EAAM5iE,MACd4iE,EAAM5iE,MAAQ4iE,EAAMziE,OACpByiE,EAAMziE,OAASwjD,EAejB,SAASywB,EAAYxR,GACnBA,EAAMpoE,GAAKooE,EAAMpoE,EAenB,SAAS65E,EAAUzR,GACjB,IAAInpE,EAAImpE,EAAMnpE,EACdmpE,EAAMnpE,EAAImpE,EAAMpoE,EAChBooE,EAAMpoE,EAAIf,EAlEZZ,EAAOC,QAAU,CACfw7E,OAIF,SAAgBhyB,GACd,IAAIiyB,EAAUjyB,EAAE5Z,QAAQ8rC,QAAQtJ,cAChB,OAAZqJ,GAAgC,OAAZA,GACtBL,EAAgB5xB,IANlB8wB,KAUF,SAAc9wB,GACZ,IAAIiyB,EAAUjyB,EAAE5Z,QAAQ8rC,QAAQtJ,cAChB,OAAZqJ,GAAgC,OAAZA,GAqB1B,SAAkBjyB,GAChBjuB,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAAKw6E,EAAY9xB,EAAEhiC,KAAK1mB,OAEtDy6B,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GAClBigC,EAAErkB,QAAQiyC,EAAK8D,OAAQquB,GACnB//C,EAAE90B,IAAI0iD,EAAM,MACdmyB,EAAYnyB,MA3BdwyB,CAASnyB,GAGK,OAAZiyB,GAAgC,OAAZA,IAiC1B,SAAgBjyB,GACdjuB,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAAKy6E,EAAU/xB,EAAEhiC,KAAK1mB,OAEpDy6B,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GAClBigC,EAAErkB,QAAQiyC,EAAK8D,OAAQsuB,GACnBhgD,EAAE90B,IAAI0iD,EAAM,MACdoyB,EAAUpyB,MAvCZyyB,CAAOpyB,GACP4xB,EAAgB5xB,O,SCjBpB,SAASqyB,IACP,IAAIC,EAAW,GACfA,EAASviF,MAAQuiF,EAASj3C,MAAQi3C,EAClC3hF,KAAK4hF,UAAYD,EAkCnB,SAASE,EAAOpS,GACdA,EAAM/kC,MAAMtrC,MAAQqwE,EAAMrwE,MAC1BqwE,EAAMrwE,MAAMsrC,MAAQ+kC,EAAM/kC,aACnB+kC,EAAMrwE,aACNqwE,EAAM/kC,MAGf,SAASo3C,EAAep7E,EAAGC,GACzB,GAAU,UAAND,GAAuB,UAANA,EACnB,OAAOC,EAhDXf,EAAOC,QAAU67E,EAQjBA,EAAK1gF,UAAU+gF,QAAU,WACvB,IAAIJ,EAAW3hF,KAAK4hF,UAChBnS,EAAQkS,EAASj3C,MACrB,GAAI+kC,IAAUkS,EAEZ,OADAE,EAAOpS,GACAA,GAIXiS,EAAK1gF,UAAUghF,QAAU,SAASvS,GAChC,IAAIkS,EAAW3hF,KAAK4hF,UAChBnS,EAAM/kC,OAAS+kC,EAAMrwE,OACvByiF,EAAOpS,GAETA,EAAMrwE,MAAQuiF,EAASviF,MACvBuiF,EAASviF,MAAMsrC,MAAQ+kC,EACvBkS,EAASviF,MAAQqwE,EACjBA,EAAM/kC,MAAQi3C,GAGhBD,EAAK1gF,UAAUyE,SAAW,WAIxB,IAHA,IAAIw8E,EAAO,GACPN,EAAW3hF,KAAK4hF,UAChBlB,EAAOiB,EAASj3C,MACbg2C,IAASiB,GACdM,EAAKzgF,KAAKoK,KAAKC,UAAU60E,EAAMoB,IAC/BpB,EAAOA,EAAKh2C,MAEd,MAAO,IAAMu3C,EAAK7wD,KAAK,MAAQ,M,eCzCjC,IAAIgQ,EAAI,EAAQ,MACZg+C,EAAO,EAAQ,MACf8C,EAAQ,aAEZt8E,EAAOC,QAAU,CACfs8E,cAIF,SAAuB9yB,GACrB,IAAI+yB,EAAchD,EAAKiD,iBAAiBhzB,GAEpCnT,EAAI,IAAIgmC,EAAM,CAAEI,UAAU,EAAMxZ,YAAY,IAAQN,SAAS,IAoBjE,OAlBApnC,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5Bu1C,EAAEmuB,QAAQ1jE,EAAG,CAAE00B,MAAO10B,IACtBu1C,EAAE0kC,UAAUj6E,EAAG,QAAU0oD,EAAEhiC,KAAK1mB,GAAG45E,SAGrCn/C,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B+6C,EAAEyuB,QAAQxpE,EAAEwF,EAAGxF,EAAEuvD,EAAG,GAAIvvD,EAAEuE,SAG5B07B,EAAErkB,QAAQqlE,GAAa,SAASG,EAAO7jF,GACrC,IAAI8jF,EAAS,QAAU9jF,EACvBw9C,EAAEmuB,QAAQmY,EAAQ,CAAEjC,KAAM,SAC1Bn/C,EAAE35B,OAAO86E,GAAO,SAAS7Z,EAAG/hE,GAE1B,OADAu1C,EAAEyuB,QAAQjC,EAAG/hE,EAAG,CAAEiJ,MAAO,UAClBjJ,QAIJu1C,K,cC9BT,IAAIgjC,EAGF,IACEA,EAAW,EAAQ,MACnB,MAAO/9E,IAKN+9E,IACHA,EAAWjzE,OAAOizE,UAGpBt5E,EAAOC,QAAUq5E,G,eChBjB,IAAI99C,EAAI,EAAQ,MACZ8gD,EAAQ,aACRR,EAAO,EAAQ,MASnB97E,EAAOC,QAIP,SAAmBwpD,EAAGswB,GACpB,GAAItwB,EAAEozB,aAAe,EACnB,MAAO,GAET,IAAIpwE,EA4DN,SAAoBg9C,EAAGswB,GACrB,IAAI+C,EAAW,IAAIR,EACfS,EAAQ,EACRC,EAAS,EAEbxhD,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B+7E,EAASrY,QAAQ1jE,EAAG,CAAEA,EAAGA,EAAG,GAAM,EAAGk8E,IAAK,OAK5CzhD,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI2hF,EAAaJ,EAAS1zB,KAAK7tD,EAAEwF,EAAGxF,EAAEuvD,IAAM,EACxCgvB,EAASC,EAASx+E,GAClB4hF,EAAaD,EAAapD,EAC9BgD,EAAS/X,QAAQxpE,EAAEwF,EAAGxF,EAAEuvD,EAAGqyB,GAC3BH,EAAS58E,KAAKyJ,IAAImzE,EAAQF,EAASr1D,KAAKlsB,EAAEwF,GAAGk8E,KAAOnD,GACpDiD,EAAS38E,KAAKyJ,IAAIkzE,EAAQD,EAASr1D,KAAKlsB,EAAEuvD,GAAO,IAAMgvB,MAGzD,IAAIsD,EAAU5hD,EAAEhI,MAAMwpD,EAASD,EAAQ,GAAGr7E,KAAI,WAAa,OAAO,IAAIo6E,KAClEuB,EAAUN,EAAQ,EAMtB,OAJAvhD,EAAErkB,QAAQ2lE,EAASxrC,SAAS,SAASvwC,GACnCu8E,EAAaF,EAASC,EAASP,EAASr1D,KAAK1mB,OAGxC,CAAE8uC,MAAOitC,EAAUM,QAASA,EAASC,QAASA,GAvFzCE,CAAW9zB,EAAGswB,GAAYyD,GAClC/M,EAQN,SAAqBhnB,EAAG2zB,EAASC,GAM/B,IALA,IAIIxT,EAJA4G,EAAU,GACVgN,EAAUL,EAAQA,EAAQvkF,OAAS,GACnC6kF,EAAQN,EAAQ,GAGb3zB,EAAEozB,aAAa,CACpB,KAAQhT,EAAQ6T,EAAMvB,WAAgBwB,EAAWl0B,EAAG2zB,EAASC,EAASxT,GACtE,KAAQA,EAAQ4T,EAAQtB,WAAcwB,EAAWl0B,EAAG2zB,EAASC,EAASxT,GACtE,GAAIpgB,EAAEozB,YACJ,IAAK,IAAI/jF,EAAIskF,EAAQvkF,OAAS,EAAGC,EAAI,IAAKA,EAExC,GADA+wE,EAAQuT,EAAQtkF,GAAGqjF,UACR,CACT1L,EAAUA,EAAQ3qE,OAAO63E,EAAWl0B,EAAG2zB,EAASC,EAASxT,GAAO,IAChE,OAMR,OAAO4G,EA5BOmN,CAAYnxE,EAAMojC,MAAOpjC,EAAM2wE,QAAS3wE,EAAM4wE,SAG5D,OAAO7hD,EAAEqiD,QAAQriD,EAAE95B,IAAI+uE,GAAS,SAASl1E,GACvC,OAAOkuD,EAAE8G,SAASh1D,EAAEwF,EAAGxF,EAAEuvD,OACvB,IAZN,IAAI0yB,EAAoBhiD,EAAEsiD,SAAS,GAsCnC,SAASH,EAAWl0B,EAAG2zB,EAASC,EAASxT,EAAOkU,GAC9C,IAAItN,EAAUsN,EAAsB,QAAKtjF,EAwBzC,OAtBA+gC,EAAErkB,QAAQsyC,EAAEgH,QAAQoZ,EAAM9oE,IAAI,SAASqoD,GACrC,IAAI0wB,EAASrwB,EAAEL,KAAKA,GAChB40B,EAASv0B,EAAEhiC,KAAK2hC,EAAKroD,GAErBg9E,GACFtN,EAAQ70E,KAAK,CAAEmF,EAAGqoD,EAAKroD,EAAG+pD,EAAG1B,EAAK0B,IAGpCkzB,EAAOf,KAAOnD,EACdwD,EAAaF,EAASC,EAASW,MAGjCxiD,EAAErkB,QAAQsyC,EAAE8G,SAASsZ,EAAM9oE,IAAI,SAASqoD,GACtC,IAAI0wB,EAASrwB,EAAEL,KAAKA,GAChB0B,EAAI1B,EAAK0B,EACTmzB,EAASx0B,EAAEhiC,KAAKqjC,GACpBmzB,EAAW,IAAKnE,EAChBwD,EAAaF,EAASC,EAASY,MAGjCx0B,EAAEk0B,WAAW9T,EAAM9oE,GAEZ0vE,EAiCT,SAAS6M,EAAaF,EAASC,EAASxT,GACjCA,EAAMoT,IAECpT,EAAU,GAGpBuT,EAAQvT,EAAMoT,IAAMpT,EAAU,GAAIwT,GAASjB,QAAQvS,GAFnDuT,EAAQA,EAAQvkF,OAAS,GAAGujF,QAAQvS,GAFpCuT,EAAQ,GAAGhB,QAAQvS,K,4BC7GvB,IAAIruC,EAAI,EAAQ,MACZ0iD,EAAU,EAAQ,MAClBC,EAAY,EAAQ,MACpBxD,EAAO,EAAQ,MACfyD,EAAiB,uBACjBC,EAAoB,EAAQ,MAC5BC,EAAmB,yBACnBC,EAAe,EAAQ,MACvBC,EAAoB,EAAQ,MAC5BC,EAAmB,EAAQ,MAC3BC,EAAQ,EAAQ,MAChB3oE,EAAW,EAAQ,MACnByjE,EAAO,EAAQ,MACf8C,EAAQ,aAEZt8E,EAAOC,QAEP,SAAgBwpD,EAAGk1B,GACjB,IAAI1xC,EAAO0xC,GAAQA,EAAKC,YAAcpF,EAAKvsC,KAAOusC,EAAKC,OACvDxsC,EAAK,UAAU,WACb,IAAI4xC,EACF5xC,EAAK,sBAAsB,WAAa,OA2F9C,SAA0B6xC,GACxB,IAAIr1B,EAAI,IAAI6yB,EAAM,CAAEpZ,YAAY,EAAMwZ,UAAU,IAC5C7sC,EAAQkvC,EAAaD,EAAWjvC,SAqBpC,OAnBA4Z,EAAEmZ,SAASpnC,EAAEwjD,MAAM,GACjBC,EACAC,EAAkBrvC,EAAOsvC,GACzB3jD,EAAE4jD,KAAKvvC,EAAOwvC,KAEhB7jD,EAAErkB,QAAQ2nE,EAAWxtC,SAAS,SAASvwC,GACrC,IAAI0mB,EAAOs3D,EAAaD,EAAWr3D,KAAK1mB,IACxC0oD,EAAEgb,QAAQ1jE,EAAGy6B,EAAE8jD,SAASJ,EAAkBz3D,EAAM83D,GAAeC,IAC/D/1B,EAAEuxB,UAAUj6E,EAAG+9E,EAAWvvE,OAAOxO,OAGnCy6B,EAAErkB,QAAQ2nE,EAAW1tC,SAAS,SAAS71C,GACrC,IAAI6tD,EAAO21B,EAAaD,EAAW11B,KAAK7tD,IACxCkuD,EAAEsb,QAAQxpE,EAAGigC,EAAEwjD,MAAM,GACnBS,EACAP,EAAkB91B,EAAMs2B,GACxBlkD,EAAE4jD,KAAKh2B,EAAMu2B,QAGVl2B,EAlH4Cm2B,CAAiBn2B,MAClExc,EAAK,eAAsB,YAK/B,SAAmBwc,EAAGxc,GACpBA,EAAK,8BAA8B,YAsHrC,SAAgCwc,GAC9B,IAAI5Z,EAAQ4Z,EAAE5Z,QACdA,EAAMuzB,SAAW,EACjB5nC,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GAClB6tD,EAAKy2B,QAAU,EACqB,MAAhCz2B,EAAK02B,SAASzN,gBACM,OAAlBxiC,EAAM8rC,SAAsC,OAAlB9rC,EAAM8rC,QAClCvyB,EAAKjiD,OAASiiD,EAAK22B,YAEnB32B,EAAK9hD,QAAU8hD,EAAK22B,gBAhIsBC,CAAuBv2B,MACvExc,EAAK,uBAA8B,YAmSrC,SAAyBwc,GACvBjuB,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,GAAIA,EAAEwF,IAAMxF,EAAEuvD,EAAG,CACf,IAAIrjC,EAAOgiC,EAAEhiC,KAAKlsB,EAAEwF,GACf0mB,EAAKw4D,YACRx4D,EAAKw4D,UAAY,IAEnBx4D,EAAKw4D,UAAUrkF,KAAK,CAAEL,EAAGA,EAAGk6B,MAAOg0B,EAAEL,KAAK7tD,KAC1CkuD,EAAE0wB,WAAW5+E,OA3S+B2kF,CAAgBz2B,MAChExc,EAAK,eAA8B,WAAaixC,EAAQ9iD,IAAIquB,MAC5Dxc,EAAK,wBAA8B,WAAasxC,EAAanjD,IAAIquB,MACjExc,EAAK,YAA8B,WAAa0tC,EAAKnB,EAAK2G,mBAAmB12B,OAC7Exc,EAAK,8BAA8B,YAuIrC,SAAgCwc,GAC9BjuB,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GAClB,GAAI6tD,EAAKjiD,OAASiiD,EAAK9hD,OAAQ,CAC7B,IAAIvG,EAAI0oD,EAAEhiC,KAAKlsB,EAAEwF,GAEb00B,EAAQ,CAAEklD,MADNlxB,EAAEhiC,KAAKlsB,EAAEuvD,GACM6vB,KAAO55E,EAAE45E,MAAQ,EAAI55E,EAAE45E,KAAMp/E,EAAGA,GACvDi+E,EAAKuB,aAAatxB,EAAG,aAAch0B,EAAO,WA9IE2qD,CAAuB32B,MACvExc,EAAK,wBAA8B,WAAaqxC,EAAiB70B,MACjExc,EAAK,4BAA8B,WAAasxC,EAAa8B,QAAQ52B,MACrExc,EAAK,sBAA8B,WAAamxC,EAAe30B,MAC/Dxc,EAAK,wBAA8B,YA+IrC,SAA0Bwc,GACxB,IAAI2xB,EAAU,EACd5/C,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GACd0mB,EAAK64D,YACP74D,EAAK0zD,QAAU1xB,EAAEhiC,KAAKA,EAAK64D,WAAW3F,KACtClzD,EAAK2zD,QAAU3xB,EAAEhiC,KAAKA,EAAK84D,cAAc5F,KACzCS,EAAU5/C,EAAE3xB,IAAIuxE,EAAS3zD,EAAK2zD,aAGlC3xB,EAAE5Z,QAAQurC,QAAUA,EAzJ4BoF,CAAiB/2B,MACjExc,EAAK,8BAA8B,YA2JrC,SAAgCwc,GAC9BjuB,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GACC,eAAf0mB,EAAKg5D,QACPh3B,EAAEL,KAAK3hC,EAAKlsB,GAAGmlF,UAAYj5D,EAAKkzD,KAChClxB,EAAEk0B,WAAW58E,OAhK+B4/E,CAAuBl3B,MACvExc,EAAK,qBAA8B,WAAakxC,EAAU/iD,IAAIquB,MAC9Dxc,EAAK,yBAA8B,WAAaoxC,EAAkB50B,MAClExc,EAAK,yBAA8B,WAAauxC,EAAkB/0B,MAClExc,EAAK,aAA8B,WAAayxC,EAAMj1B,MACtDxc,EAAK,uBAA8B,YAkSrC,SAAyBwc,GACvB,IAAIm3B,EAASpH,EAAKiD,iBAAiBhzB,GACnCjuB,EAAErkB,QAAQypE,GAAQ,SAASjE,GACzB,IAAIkE,EAAa,EACjBrlD,EAAErkB,QAAQwlE,GAAO,SAAS57E,EAAGjI,GAC3B,IAAI2uB,EAAOgiC,EAAEhiC,KAAK1mB,GAClB0mB,EAAKi3D,MAAQ5lF,EAAI+nF,EACjBrlD,EAAErkB,QAAQsQ,EAAKw4D,WAAW,SAASa,GACjCtH,EAAKuB,aAAatxB,EAAG,WAAY,CAC/BtiD,MAAO25E,EAASrrD,MAAMtuB,MACtBG,OAAQw5E,EAASrrD,MAAMnuB,OACvBqzE,KAAMlzD,EAAKkzD,KACX+D,MAAO5lF,KAAO+nF,EACdtlF,EAAGulF,EAASvlF,EACZk6B,MAAOqrD,EAASrrD,OACf,iBAEEhO,EAAKw4D,gBAnTgCc,CAAgBt3B,MAChExc,EAAK,8BAA8B,WAAawxC,EAAiBhD,OAAOhyB,MACxExc,EAAK,gBAA8B,WAAal3B,EAAS0zC,MACzDxc,EAAK,yBAA8B,YAqTrC,SAA2Bwc,GACzBjuB,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GAClB,GAAmB,aAAf0mB,EAAKg5D,MAAsB,CAC7B,IAAIO,EAAWv3B,EAAEhiC,KAAKA,EAAKlsB,EAAEwF,GACzBH,EAAIogF,EAASpgF,EAAIogF,EAAS75E,MAAQ,EAClCxF,EAAIq/E,EAASr/E,EACb+uD,EAAKjpC,EAAK7mB,EAAIA,EACd+vD,EAAKqwB,EAAS15E,OAAS,EAC3BmiD,EAAEsb,QAAQt9C,EAAKlsB,EAAGksB,EAAKgO,OACvBg0B,EAAEk0B,WAAW58E,GACb0mB,EAAKgO,MAAMy3B,OAAS,CAClB,CAAEtsD,EAAGA,EAAI,EAAI8vD,EAAK,EAAG/uD,EAAGA,EAAIgvD,GAC5B,CAAE/vD,EAAGA,EAAI,EAAI8vD,EAAK,EAAG/uD,EAAGA,EAAIgvD,GAC5B,CAAE/vD,EAAGA,EAAQ8vD,EAAQ/uD,EAAGA,GACxB,CAAEf,EAAGA,EAAI,EAAI8vD,EAAK,EAAG/uD,EAAGA,EAAIgvD,GAC5B,CAAE/vD,EAAGA,EAAI,EAAI8vD,EAAK,EAAG/uD,EAAGA,EAAIgvD,IAE9BlpC,EAAKgO,MAAM70B,EAAI6mB,EAAK7mB,EACpB6mB,EAAKgO,MAAM9zB,EAAI8lB,EAAK9lB,MAxUwBs/E,CAAkBx3B,MAClExc,EAAK,yBAA8B,YA0PrC,SAA2Bwc,GACzBjuB,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,GAAI0oD,EAAEv+C,SAASnK,GAAGlI,OAAQ,CACxB,IAAI4uB,EAAOgiC,EAAEhiC,KAAK1mB,GACdojB,EAAIslC,EAAEhiC,KAAKA,EAAK64D,WAChBx+E,EAAI2nD,EAAEhiC,KAAKA,EAAK84D,cAChBr7C,EAAIukB,EAAEhiC,KAAK+T,EAAE0lD,KAAKz5D,EAAKwzD,aACvBz8D,EAAIirC,EAAEhiC,KAAK+T,EAAE0lD,KAAKz5D,EAAKyzD,cAE3BzzD,EAAKtgB,MAAQ/G,KAAKgE,IAAIoa,EAAE5d,EAAIskC,EAAEtkC,GAC9B6mB,EAAKngB,OAASlH,KAAKgE,IAAItC,EAAEH,EAAIwiB,EAAExiB,GAC/B8lB,EAAK7mB,EAAIskC,EAAEtkC,EAAI6mB,EAAKtgB,MAAQ,EAC5BsgB,EAAK9lB,EAAIwiB,EAAExiB,EAAI8lB,EAAKngB,OAAS,MAIjCk0B,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GACJ,WAApB0oD,EAAEhiC,KAAK1mB,GAAG0/E,OACZh3B,EAAEk0B,WAAW58E,MA5Q+BogF,CAAkB13B,MAClExc,EAAK,sBAA8B,WAAakxC,EAAU5D,KAAK9wB,MAC/Dxc,EAAK,4BAA8B,YAgOrC,SAA8Bwc,GAC5BjuB,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GAClB,GAAIigC,EAAE90B,IAAI0iD,EAAM,KAId,OAHsB,MAAlBA,EAAK02B,UAAsC,MAAlB12B,EAAK02B,WAChC12B,EAAKjiD,OAASiiD,EAAK22B,aAEb32B,EAAK02B,UACb,IAAK,IAAK12B,EAAKxoD,GAAKwoD,EAAKjiD,MAAQ,EAAIiiD,EAAK22B,YAAa,MACvD,IAAK,IAAK32B,EAAKxoD,GAAKwoD,EAAKjiD,MAAQ,EAAIiiD,EAAK22B,gBAzOEqB,CAAqB33B,MACrExc,EAAK,4BAA8B,WAAawxC,EAAiBlE,KAAK9wB,MACtExc,EAAK,sBAA8B,YAwJrC,SAAwBwc,GACtB,IAAI43B,EAAOp/E,OAAOq/E,kBACdC,EAAO,EACPC,EAAOv/E,OAAOq/E,kBACdG,EAAO,EACPC,EAAaj4B,EAAE5Z,QACf8xC,EAAUD,EAAWE,SAAW,EAChCC,EAAUH,EAAWI,SAAW,EAEpC,SAASC,EAAYhY,GACnB,IAAInpE,EAAImpE,EAAMnpE,EACVe,EAAIooE,EAAMpoE,EACVmpD,EAAIif,EAAM5iE,MACVmvC,EAAIyzB,EAAMziE,OACd+5E,EAAOjhF,KAAKwsB,IAAIy0D,EAAMzgF,EAAIkqD,EAAI,GAC9By2B,EAAOnhF,KAAKyJ,IAAI03E,EAAM3gF,EAAIkqD,EAAI,GAC9B02B,EAAOphF,KAAKwsB,IAAI40D,EAAM7/E,EAAI20C,EAAI,GAC9BmrC,EAAOrhF,KAAKyJ,IAAI43E,EAAM9/E,EAAI20C,EAAI,GAGhC9a,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAAKghF,EAAYt4B,EAAEhiC,KAAK1mB,OACtDy6B,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GACdigC,EAAE90B,IAAI0iD,EAAM,MACd24B,EAAY34B,MAIhBi4B,GAAQM,EACRH,GAAQK,EAERrmD,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GAClB0mB,EAAK7mB,GAAKygF,EACV55D,EAAK9lB,GAAK6/E,KAGZhmD,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GAClBigC,EAAErkB,QAAQiyC,EAAK8D,QAAQ,SAAShvD,GAC9BA,EAAE0C,GAAKygF,EACPnjF,EAAEyD,GAAK6/E,KAELhmD,EAAE90B,IAAI0iD,EAAM,OAAQA,EAAKxoD,GAAKygF,GAC9B7lD,EAAE90B,IAAI0iD,EAAM,OAAQA,EAAKznD,GAAK6/E,MAGpCE,EAAWv6E,MAAQo6E,EAAOF,EAAOM,EACjCD,EAAWp6E,OAASm6E,EAAOD,EAAOK,EAxMcG,CAAev4B,MAC/Dxc,EAAK,4BAA8B,YA0MrC,SAA8Bwc,GAC5BjuB,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAGIixE,EAAIC,EAHJrjB,EAAOK,EAAEL,KAAK7tD,GACd0mF,EAAQx4B,EAAEhiC,KAAKlsB,EAAEwF,GACjBmhF,EAAQz4B,EAAEhiC,KAAKlsB,EAAEuvD,GAEhB1B,EAAK8D,QAKRsf,EAAKpjB,EAAK8D,OAAO,GACjBuf,EAAKrjB,EAAK8D,OAAO9D,EAAK8D,OAAOr0D,OAAS,KALtCuwD,EAAK8D,OAAS,GACdsf,EAAK0V,EACLzV,EAAKwV,GAKP74B,EAAK8D,OAAOvhD,QAAQ6tE,EAAKlnB,cAAc2vB,EAAOzV,IAC9CpjB,EAAK8D,OAAOtxD,KAAK49E,EAAKlnB,cAAc4vB,EAAOzV,OAzNG0V,CAAqB14B,MACrExc,EAAK,qBAA8B,YA2OrC,SAAuCwc,GACrCjuB,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GACd6tD,EAAKixB,UACPjxB,EAAK8D,OAAO9gC,aA/OgCg2D,CAA8B34B,MAC9Exc,EAAK,oBAA8B,WAAaixC,EAAQ3D,KAAK9wB,MAhCnB44B,CAAUxD,EAAa5xC,MAC/DA,EAAK,sBAAsB,YAwC/B,SAA0B6xC,EAAYD,GACpCrjD,EAAErkB,QAAQ2nE,EAAWxtC,SAAS,SAASvwC,GACrC,IAAIuhF,EAAaxD,EAAWr3D,KAAK1mB,GAC7BwhF,EAAc1D,EAAYp3D,KAAK1mB,GAE/BuhF,IACFA,EAAW1hF,EAAI2hF,EAAY3hF,EAC3B0hF,EAAW3gF,EAAI4gF,EAAY5gF,EAEvBk9E,EAAY3zE,SAASnK,GAAGlI,SAC1BypF,EAAWn7E,MAAQo7E,EAAYp7E,MAC/Bm7E,EAAWh7E,OAASi7E,EAAYj7E,YAKtCk0B,EAAErkB,QAAQ2nE,EAAW1tC,SAAS,SAAS71C,GACrC,IAAI+mF,EAAaxD,EAAW11B,KAAK7tD,GAC7BgnF,EAAc1D,EAAYz1B,KAAK7tD,GAEnC+mF,EAAWp1B,OAASq1B,EAAYr1B,OAC5B1xB,EAAE90B,IAAI67E,EAAa,OACrBD,EAAW1hF,EAAI2hF,EAAY3hF,EAC3B0hF,EAAW3gF,EAAI4gF,EAAY5gF,MAI/Bm9E,EAAWjvC,QAAQ1oC,MAAQ03E,EAAYhvC,QAAQ1oC,MAC/C23E,EAAWjvC,QAAQvoC,OAASu3E,EAAYhvC,QAAQvoC,OApENk7E,CAAiB/4B,EAAGo1B,UAuEhE,IAAIM,EAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,EAAgB,CAAE7b,QAAS,GAAIqf,QAAS,GAAIC,QAAS,GAAI/G,QAAS,MAClE0D,EAAa,CAAC,YAAa,SAAU,UAAW,SAChDE,EAAe,CAAC,QAAS,UACzBC,EAAe,CAAEr4E,MAAO,EAAGG,OAAQ,GACnCo4E,EAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,EAAe,CACjBI,OAAQ,EAAG/F,OAAQ,EAAG3yE,MAAO,EAAGG,OAAQ,EACxCy4E,YAAa,GAAID,SAAU,KAEzBH,EAAY,CAAC,YAmRjB,SAAST,EAAkBriF,EAAKktE,GAC9B,OAAOvuC,EAAEmnD,UAAUnnD,EAAE4jD,KAAKviF,EAAKktE,GAAQ9nE,QAGzC,SAAS88E,EAAahV,GACpB,IAAI6Y,EAAW,GAIf,OAHApnD,EAAErkB,QAAQ4yD,GAAO,SAAShpE,EAAGD,GAC3B8hF,EAAS9hF,EAAEuxE,eAAiBtxE,KAEvB6hF,I,eCpYT,IAAIC,EAGF,IACEA,EAAS,CACPC,UAAW,EAAQ,KACnBhF,SAAU,EAAQ,MAClBwB,SAAU,EAAQ,MAClByD,KAAM,EAAQ,MACdtgF,OAAQ,EAAQ,MAChBu5C,KAAM,EAAQ,MACd6hC,QAAS,EAAQ,MACjB1mE,QAAS,EAAQ,MACjB6rE,MAAO,EAAQ,MACft8E,IAAM,EAAQ,MACdu8E,YAAa,EAAQ,MACrB/B,KAAM,EAAQ,KACdx/E,IAAK,EAAQ,MACbihF,UAAW,EAAQ,MACnB94E,IAAK,EAAQ,MACbm1E,MAAO,EAAQ,MACfpyD,IAAK,EAAQ,MACbs2D,MAAO,EAAQ,MACf30E,IAAK,EAAQ,MACb6wE,KAAM,EAAQ,MACd5rD,MAAO,EAAQ,MACf3xB,OAAQ,EAAQ,MAChBshF,OAAQ,EAAQ,MAChB7I,SAAU,EAAQ,MAClBp0E,OAAQ,EAAQ,MAChBk9E,UAAW,EAAQ,OAErB,MAAO7nF,IAKNsnF,IACHA,EAASx8E,OAAOm1B,GAGlBx7B,EAAOC,QAAU4iF,G,eC3CjB,IAAIrnD,EAAI,EAAQ,MACZg+C,EAAO,EAAQ,MAsDnB,SAASS,EAAIxwB,EAAG1jC,EAAMs9D,EAASvJ,EAAQxyE,EAAQg8E,EAAQviF,GACrD,IAAImK,EAAWu+C,EAAEv+C,SAASnK,GAC1B,GAAKmK,EAASrS,OAAd,CAOA,IAAI8X,EAAM6oE,EAAKgB,cAAc/wB,EAAG,OAC5B74C,EAAS4oE,EAAKgB,cAAc/wB,EAAG,OAC/Bh0B,EAAQg0B,EAAEhiC,KAAK1mB,GAEnB0oD,EAAEuxB,UAAUrqE,EAAK5P,GACjB00B,EAAM6qD,UAAY3vE,EAClB84C,EAAEuxB,UAAUpqE,EAAQ7P,GACpB00B,EAAM8qD,aAAe3vE,EAErB4qB,EAAErkB,QAAQjM,GAAU,SAASq4E,GAC3BtJ,EAAIxwB,EAAG1jC,EAAMs9D,EAASvJ,EAAQxyE,EAAQg8E,EAAQC,GAE9C,IAAIC,EAAY/5B,EAAEhiC,KAAK87D,GACnBE,EAAWD,EAAUlD,UAAYkD,EAAUlD,UAAYiD,EACvDG,EAAcF,EAAUjD,aAAeiD,EAAUjD,aAAegD,EAChEI,EAAaH,EAAUlD,UAAYxG,EAAS,EAAIA,EAChD+F,EAAS4D,IAAaC,EAAc,EAAIp8E,EAASg8E,EAAOviF,GAAK,EAEjE0oD,EAAEsb,QAAQp0D,EAAK8yE,EAAU,CACvB3J,OAAQ6J,EACR9D,OAAQA,EACR+D,aAAa,IAGfn6B,EAAEsb,QAAQ2e,EAAa9yE,EAAQ,CAC7BkpE,OAAQ6J,EACR9D,OAAQA,EACR+D,aAAa,OAIZn6B,EAAEl6C,OAAOxO,IACZ0oD,EAAEsb,QAAQh/C,EAAMpV,EAAK,CAAEmpE,OAAQ,EAAG+F,OAAQv4E,EAASg8E,EAAOviF,UAtCtDA,IAAMglB,GACR0jC,EAAEsb,QAAQh/C,EAAMhlB,EAAG,CAAE+4E,OAAQ,EAAG+F,OAAQwD,IAxD9CrjF,EAAOC,QAAU,CACfm7B,IA2BF,SAAaquB,GACX,IAAI1jC,EAAOyzD,EAAKuB,aAAatxB,EAAG,OAAQ,GAAI,SACxC65B,EAmEN,SAAoB75B,GAClB,IAAI65B,EAAS,GACb,SAASrJ,EAAIl5E,EAAGorB,GACd,IAAIjhB,EAAWu+C,EAAEv+C,SAASnK,GACtBmK,GAAYA,EAASrS,QACvB2iC,EAAErkB,QAAQjM,GAAU,SAASq4E,GAC3BtJ,EAAIsJ,EAAOp3D,EAAQ,MAGvBm3D,EAAOviF,GAAKorB,EAGd,OADAqP,EAAErkB,QAAQsyC,EAAEv+C,YAAY,SAASnK,GAAKk5E,EAAIl5E,EAAG,MACtCuiF,EA/EMO,CAAWp6B,GACpBniD,EAASk0B,EAAE3xB,IAAI2xB,EAAEt1B,OAAOo9E,IAAW,EACnCD,EAAU,EAAI/7E,EAAS,EAE3BmiD,EAAE5Z,QAAQi0C,YAAc/9D,EAGxByV,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAAKkuD,EAAEL,KAAK7tD,GAAGskF,QAAUwD,KAGvD,IAAIvJ,EAwEN,SAAoBrwB,GAClB,OAAOjuB,EAAE35B,OAAO4nD,EAAErY,SAAS,SAAS2yC,EAAKxoF,GACvC,OAAOwoF,EAAMt6B,EAAEL,KAAK7tD,GAAGu+E,SACtB,GA3EUkK,CAAWv6B,GAAK,EAG7BjuB,EAAErkB,QAAQsyC,EAAEv+C,YAAY,SAASq4E,GAC/BtJ,EAAIxwB,EAAG1jC,EAAMs9D,EAASvJ,EAAQxyE,EAAQg8E,EAAQC,MAKhD95B,EAAE5Z,QAAQo0C,eAAiBZ,GA/C3BhD,QAoHF,SAAiB52B,GACf,IAAIi4B,EAAaj4B,EAAE5Z,QACnB4Z,EAAEk0B,WAAW+D,EAAWoC,oBACjBpC,EAAWoC,YAClBtoD,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GACjBkuD,EAAEL,KAAK7tD,GACTqoF,aACPn6B,EAAE0wB,WAAW5+E,S,4BC9HnB,IAAIigC,EAAI,EAAQ,MACZg+C,EAAO,EAAQ,MAEnBx5E,EAAOC,QAAU,CACfm7B,IAoBF,SAAaquB,GACXA,EAAE5Z,QAAQq0C,YAAc,GACxB1oD,EAAErkB,QAAQsyC,EAAErY,SAAS,SAASgY,IAGhC,SAAuBK,EAAGluD,GACxB,IAYIklF,EAAO1W,EAAOjxE,EAZdiI,EAAIxF,EAAEwF,EACNojF,EAAQ16B,EAAEhiC,KAAK1mB,GAAG45E,KAClB7vB,EAAIvvD,EAAEuvD,EACNs5B,EAAQ36B,EAAEhiC,KAAKqjC,GAAG6vB,KAClB76E,EAAOvE,EAAEuE,KACTukF,EAAY56B,EAAEL,KAAK7tD,GACnBmlF,EAAY2D,EAAU3D,UAE1B,GAAI0D,IAAUD,EAAQ,EAAtB,CAKA,IAHA16B,EAAE0wB,WAAW5+E,GAGRzC,EAAI,IAAKqrF,EAAOA,EAAQC,IAAStrF,IAAKqrF,EACzCE,EAAUn3B,OAAS,GACnB6c,EAAQ,CACN5iE,MAAO,EAAGG,OAAQ,EAClB+8E,UAAWA,EAAWC,QAAS/oF,EAC/Bo/E,KAAMwJ,GAER1D,EAAQjH,EAAKuB,aAAatxB,EAAG,OAAQsgB,EAAO,MACxCoa,IAAUzD,IACZ3W,EAAM5iE,MAAQk9E,EAAUl9E,MACxB4iE,EAAMziE,OAAS+8E,EAAU/8E,OACzByiE,EAAM0W,MAAQ,aACd1W,EAAM+V,SAAWuE,EAAUvE,UAE7Br2B,EAAEsb,QAAQhkE,EAAG0/E,EAAO,CAAE3G,OAAQuK,EAAUvK,QAAUh6E,GACxC,IAANhH,GACF2wD,EAAE5Z,QAAQq0C,YAAYtoF,KAAK6kF,GAE7B1/E,EAAI0/E,EAGNh3B,EAAEsb,QAAQhkE,EAAG+pD,EAAG,CAAEgvB,OAAQuK,EAAUvK,QAAUh6E,IAtCRykF,CAAc96B,EAAGL,OArBvDmxB,KA8DF,SAAc9wB,GACZjuB,EAAErkB,QAAQsyC,EAAE5Z,QAAQq0C,aAAa,SAASnjF,GACxC,IAEI+pD,EAFArjC,EAAOgiC,EAAEhiC,KAAK1mB,GACdyjF,EAAY/8D,EAAK48D,UAGrB,IADA56B,EAAEsb,QAAQt9C,EAAK68D,QAASE,GACjB/8D,EAAKg5D,OACV31B,EAAIrB,EAAEg7B,WAAW1jF,GAAG,GACpB0oD,EAAEk0B,WAAW58E,GACbyjF,EAAUt3B,OAAOtxD,KAAK,CAAEgF,EAAG6mB,EAAK7mB,EAAGe,EAAG8lB,EAAK9lB,IACxB,eAAf8lB,EAAKg5D,QACP+D,EAAU5jF,EAAI6mB,EAAK7mB,EACnB4jF,EAAU7iF,EAAI8lB,EAAK9lB,EACnB6iF,EAAUr9E,MAAQsgB,EAAKtgB,MACvBq9E,EAAUl9E,OAASmgB,EAAKngB,QAE1BvG,EAAI+pD,EACJrjC,EAAOgiC,EAAEhiC,KAAK1mB,S,eCtFpB,IAAIy6B,EAAI,EAAQ,MAEhBx7B,EAAOC,QAEP,SAAgCwpD,EAAGi7B,EAAIC,GACrC,IACEC,EADE/J,EAAO,GAGXr/C,EAAErkB,QAAQwtE,GAAI,SAAS5jF,GAIrB,IAHA,IACEwO,EACAs1E,EAFEtB,EAAQ95B,EAAEl6C,OAAOxO,GAGdwiF,GAAO,CASZ,IARAh0E,EAASk6C,EAAEl6C,OAAOg0E,KAEhBsB,EAAYhK,EAAKtrE,GACjBsrE,EAAKtrE,GAAUg0E,IAEfsB,EAAYD,EACZA,EAAWrB,GAETsB,GAAaA,IAActB,EAE7B,YADAmB,EAAG3f,QAAQ8f,EAAWtB,GAGxBA,EAAQh0E,Q,eCzBd,IAAIisB,EAAI,EAAQ,MAEhBx7B,EAAOC,QAEP,SAAoBwpD,EAAGq7B,GACrB,OAAOtpD,EAAE95B,IAAIojF,GAAS,SAAS/jF,GAC7B,IAAIgkF,EAAMt7B,EAAEgH,QAAQ1vD,GACpB,GAAKgkF,EAAIlsF,OAEF,CACL,IAAI+sB,EAAS4V,EAAE35B,OAAOkjF,GAAK,SAAShB,EAAKxoF,GACvC,IAAI6tD,EAAOK,EAAEL,KAAK7tD,GAChBypF,EAAQv7B,EAAEhiC,KAAKlsB,EAAEwF,GACnB,MAAO,CACLS,IAAKuiF,EAAIviF,IAAO4nD,EAAK0wB,OAASkL,EAAMtG,MACpC5E,OAAQiK,EAAIjK,OAAS1wB,EAAK0wB,UAE3B,CAAEt4E,IAAK,EAAGs4E,OAAQ,IAErB,MAAO,CACL/4E,EAAGA,EACHkkF,WAAYr/D,EAAOpkB,IAAMokB,EAAOk0D,OAChCA,OAAQl0D,EAAOk0D,QAdjB,MAAO,CAAE/4E,EAAGA,Q,eCRlB,IAAIy6B,EAAI,EAAQ,MACZ8gD,EAAQ,aAEZt8E,EAAOC,QAgCP,SAAyBwpD,EAAGkxB,EAAMuK,GAChC,IAAIn/D,EAgCN,SAAwB0jC,GAEtB,IADA,IAAI1oD,EACG0oD,EAAE07B,QAASpkF,EAAIy6B,EAAE8+C,SAAS,YACjC,OAAOv5E,EAnCIqkF,CAAe37B,GACxB7jC,EAAS,IAAI02D,EAAM,CAAEI,UAAU,IAAQ9Z,SAAS,CAAE78C,KAAMA,IACrDs/D,qBAAoB,SAAStkF,GAAK,OAAO0oD,EAAEhiC,KAAK1mB,MA2BrD,OAzBAy6B,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GAChBwO,EAASk6C,EAAEl6C,OAAOxO,IAEhB0mB,EAAKkzD,OAASA,GAAQlzD,EAAK0zD,SAAWR,GAAQA,GAAQlzD,EAAK2zD,WAC7Dx1D,EAAO6+C,QAAQ1jE,GACf6kB,EAAOo1D,UAAUj6E,EAAGwO,GAAUwW,GAG9ByV,EAAErkB,QAAQsyC,EAAEy7B,GAAcnkF,IAAI,SAASxF,GACrC,IAAIunE,EAAIvnE,EAAEwF,IAAMA,EAAIxF,EAAEuvD,EAAIvvD,EAAEwF,EAC1BqoD,EAAOxjC,EAAOwjC,KAAK0Z,EAAG/hE,GACtB+4E,EAAUt+C,EAAEynD,YAAY75B,GAAsB,EAAdA,EAAK0wB,OACvCl0D,EAAOm/C,QAAQjC,EAAG/hE,EAAG,CAAE+4E,OAAQrwB,EAAEL,KAAK7tD,GAAGu+E,OAASA,OAGhDt+C,EAAE90B,IAAI+gB,EAAM,YACd7B,EAAO6+C,QAAQ1jE,EAAG,CAChBk6E,WAAYxzD,EAAKwzD,WAAWN,GAC5BO,YAAazzD,EAAKyzD,YAAYP,SAM/B/0D,I,4BC/DT,IAAI4V,EAAI,EAAQ,MA4BhB,SAAS8pD,EAAmB77B,EAAG87B,EAAYC,GAczC,IAVA,IAAIC,EAAWjqD,EAAE4nD,UAAUoC,EACzBhqD,EAAE95B,IAAI8jF,GAAY,SAAUzkF,EAAGjI,GAAK,OAAOA,MACzC4sF,EAAelqD,EAAEqiD,QAAQriD,EAAE95B,IAAI6jF,GAAY,SAASxkF,GACtD,OAAOy6B,EAAE2nD,OAAO3nD,EAAE95B,IAAI+nD,EAAE8G,SAASxvD,IAAI,SAASxF,GAC5C,MAAO,CAAE2Q,IAAKu5E,EAASlqF,EAAEuvD,GAAIgvB,OAAQrwB,EAAEL,KAAK7tD,GAAGu+E,WAC7C,WACF,GAGA6L,EAAa,EACVA,EAAaH,EAAW3sF,QAAQ8sF,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIpqB,EAAO//B,EAAE95B,IAAI,IAAI1I,MAAM4sF,IAAW,WAAa,OAAO,KAGtDC,EAAK,EAeT,OAdArqD,EAAErkB,QAAQuuE,EAAavuE,SAAQ,SAAS0yD,GACtC,IAAI1nE,EAAQ0nE,EAAM39D,IAAMy5E,EACxBpqB,EAAKp5D,IAAU0nE,EAAMiQ,OAErB,IADA,IAAIgM,EAAY,EACT3jF,EAAQ,GACTA,EAAQ,IACV2jF,GAAavqB,EAAKp5D,EAAQ,IAG5Bo5D,EADAp5D,EAASA,EAAQ,GAAM,IACR0nE,EAAMiQ,OAEvB+L,GAAMhc,EAAMiQ,OAASgM,MAGhBD,EA7DT7lF,EAAOC,QAkBP,SAAoBwpD,EAAGs8B,GAErB,IADA,IAAIF,EAAK,EACA/sF,EAAI,EAAGA,EAAIitF,EAASltF,SAAUC,EACrC+sF,GAAMP,EAAmB77B,EAAGs8B,EAASjtF,EAAE,GAAIitF,EAASjtF,IAEtD,OAAO+sF,I,4BCzBT,IAAIrqD,EAAI,EAAQ,MACZwqD,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAkB,EAAQ,MAC1BC,EAAyB,EAAQ,MACjC9J,EAAQ,aACR9C,EAAO,EAAQ,MA6CnB,SAAS6M,EAAiB58B,EAAG68B,EAAOpB,GAClC,OAAO1pD,EAAE95B,IAAI4kF,GAAO,SAAS3L,GAC3B,OAAOwL,EAAgB18B,EAAGkxB,EAAMuK,MAIpC,SAASqB,EAAiBC,EAAaC,GACrC,IAAI/B,EAAK,IAAIpI,EACb9gD,EAAErkB,QAAQqvE,GAAa,SAASE,GAC9B,IAAI3gE,EAAO2gE,EAAG72C,QAAQ9pB,KAClB/jB,EAASkkF,EAAaQ,EAAI3gE,EAAM2+D,EAAI+B,GACxCjrD,EAAErkB,QAAQnV,EAAO2iF,IAAI,SAAS5jF,EAAGjI,GAC/B4tF,EAAGj/D,KAAK1mB,GAAG29E,MAAQ5lF,KAErBstF,EAAuBM,EAAIhC,EAAI1iF,EAAO2iF,OAI1C,SAASgC,EAAYl9B,EAAGs8B,GACtBvqD,EAAErkB,QAAQ4uE,GAAU,SAASpJ,GAC3BnhD,EAAErkB,QAAQwlE,GAAO,SAAS57E,EAAGjI,GAC3B2wD,EAAEhiC,KAAK1mB,GAAG29E,MAAQ5lF,QAhExBkH,EAAOC,QAiBP,SAAewpD,GACb,IAAI2xB,EAAU5B,EAAK4B,QAAQ3xB,GACzBm9B,EAAkBP,EAAiB58B,EAAGjuB,EAAEhI,MAAM,EAAG4nD,EAAU,GAAI,WAC/DyL,EAAgBR,EAAiB58B,EAAGjuB,EAAEhI,MAAM4nD,EAAU,GAAI,GAAI,GAAI,YAEhE2K,EAAWC,EAAUv8B,GACzBk9B,EAAYl9B,EAAGs8B,GAKf,IAHA,IACEe,EADEC,EAAS9kF,OAAOq/E,kBAGXxoF,EAAI,EAAGkuF,EAAW,EAAGA,EAAW,IAAKluF,IAAKkuF,EAAU,CAC3DT,EAAiBztF,EAAI,EAAI8tF,EAAkBC,EAAe/tF,EAAI,GAAK,GAEnEitF,EAAWvM,EAAKiD,iBAAiBhzB,GACjC,IAAIo8B,EAAKI,EAAWx8B,EAAGs8B,GACnBF,EAAKkB,IACPC,EAAW,EACXF,EAAOtrD,EAAEsnD,UAAUiD,GACnBgB,EAASlB,GAIbc,EAAYl9B,EAAGq9B,K,4BCjDjB,IAAItrD,EAAI,EAAQ,MAEhBx7B,EAAOC,QAaP,SAAmBwpD,GACjB,IAAIuwB,EAAU,GACViN,EAAczrD,EAAE/4B,OAAOgnD,EAAEnY,SAAS,SAASvwC,GAC7C,OAAQ0oD,EAAEv+C,SAASnK,GAAGlI,UAEpBuiF,EAAU5/C,EAAE3xB,IAAI2xB,EAAE95B,IAAIulF,GAAa,SAASlmF,GAAK,OAAO0oD,EAAEhiC,KAAK1mB,GAAG45E,SAClEiG,EAASplD,EAAE95B,IAAI85B,EAAEhI,MAAM4nD,EAAU,IAAI,WAAa,MAAO,MAUzD8L,EAAY1rD,EAAE2nD,OAAO8D,GAAa,SAASlmF,GAAK,OAAO0oD,EAAEhiC,KAAK1mB,GAAG45E,QAGrE,OAFAn/C,EAAErkB,QAAQ+vE,GATV,SAASjN,EAAIl5E,GACX,IAAIy6B,EAAE90B,IAAIszE,EAASj5E,GAAnB,CACAi5E,EAAQj5E,IAAK,EACb,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GAClB6/E,EAAOn5D,EAAKkzD,MAAM/+E,KAAKmF,GACvBy6B,EAAErkB,QAAQsyC,EAAEg7B,WAAW1jF,GAAIk5E,OAMtB2G,I,4BClCT,IAAIplD,EAAI,EAAQ,MAEhBx7B,EAAOC,QA2BP,SAA0B0I,EAAS+7E,GACjC,IAAIyC,EAAgB,GA4BpB,OA3BA3rD,EAAErkB,QAAQxO,GAAS,SAASkhE,EAAO/wE,GACjC,IAAI2H,EAAM0mF,EAActd,EAAM9oE,GAAK,CACjCqmF,SAAU,EACV,GAAM,GACNnK,IAAK,GACL0H,GAAI,CAAC9a,EAAM9oE,GACXjI,EAAGA,GAEA0iC,EAAEynD,YAAYpZ,EAAMob,cACvBxkF,EAAIwkF,WAAapb,EAAMob,WACvBxkF,EAAIq5E,OAASjQ,EAAMiQ,WAIvBt+C,EAAErkB,QAAQutE,EAAGtzC,SAAS,SAAS71C,GAC7B,IAAI8rF,EAASF,EAAc5rF,EAAEwF,GACzBumF,EAASH,EAAc5rF,EAAEuvD,GACxBtvB,EAAEynD,YAAYoE,IAAY7rD,EAAEynD,YAAYqE,KAC3CA,EAAOF,WACPC,EAAOpK,IAAIrhF,KAAKurF,EAAc5rF,EAAEuvD,QAWtC,SAA4By8B,GAC1B,IAAI5+E,EAAU,GAEd,SAAS6+E,EAASC,GAChB,OAAO,SAASzJ,GAmCpB,IAAsB/hF,EAAQmY,EACxB5S,EACAs4E,EApCIkE,EAAO0J,SAGPlsD,EAAEynD,YAAYjF,EAAOiH,aACrBzpD,EAAEynD,YAAYwE,EAAOxC,aACrBjH,EAAOiH,YAAcwC,EAAOxC,cA6BR7wE,EA5BD4pE,EA6BvBx8E,EAAM,EACNs4E,EAAS,GAFO79E,EA5BDwrF,GAgCR3N,SACTt4E,GAAOvF,EAAOgpF,WAAahpF,EAAO69E,OAClCA,GAAU79E,EAAO69E,QAGf1lE,EAAO0lE,SACTt4E,GAAO4S,EAAO6wE,WAAa7wE,EAAO0lE,OAClCA,GAAU1lE,EAAO0lE,QAGnB79E,EAAO0oF,GAAKvwE,EAAOuwE,GAAG7+E,OAAO7J,EAAO0oF,IACpC1oF,EAAOgpF,WAAazjF,EAAMs4E,EAC1B79E,EAAO69E,OAASA,EAChB79E,EAAOnD,EAAIsH,KAAKwsB,IAAIxY,EAAOtb,EAAGmD,EAAOnD,GACrCsb,EAAOszE,QAAS,IAzChB,SAASC,EAAUF,GACjB,OAAO,SAASxJ,GACdA,EAAW,GAAEriF,KAAK6rF,GACQ,KAApBxJ,EAAOmJ,UACXG,EAAU3rF,KAAKqiF,IAKrB,KAAOsJ,EAAU1uF,QAAQ,CACvB,IAAIgxE,EAAQ0d,EAAU3zB,MACtBjrD,EAAQ/M,KAAKiuE,GACbruC,EAAErkB,QAAQ0yD,EAAU,GAAEz9C,UAAWo7D,EAAS3d,IAC1CruC,EAAErkB,QAAQ0yD,EAAMoT,IAAK0K,EAAU9d,IAGjC,OAAOruC,EAAE95B,IAAI85B,EAAE/4B,OAAOkG,GAAS,SAASkhE,GAAS,OAAQA,EAAM6d,WAC7D,SAAS7d,GACP,OAAOruC,EAAE4jD,KAAKvV,EAAO,CAAC,KAAM,IAAK,aAAc,cArC5C+d,CAJSpsD,EAAE/4B,OAAO0kF,GAAe,SAAStd,GAC/C,OAAQA,EAAMud,e,eCzDlB,IAAI5rD,EAAI,EAAQ,MACZypD,EAAa,EAAQ,MACrB4C,EAAmB,EAAQ,MAC3B3lF,EAAO,EAAQ,MAEnBlC,EAAOC,QAEP,SAASimF,EAAaz8B,EAAG1oD,EAAG2jF,EAAI+B,GAC9B,IAAI3B,EAAUr7B,EAAEv+C,SAASnK,GACrB0mB,EAAOgiC,EAAEhiC,KAAK1mB,GACd+mF,EAAKrgE,EAAOA,EAAKwzD,gBAAaxgF,EAC9BwgE,EAAKxzC,EAAOA,EAAKyzD,iBAAazgF,EAC9BstF,EAAY,GAEZD,IACFhD,EAAUtpD,EAAE/4B,OAAOqiF,GAAS,SAASh6B,GACnC,OAAOA,IAAMg9B,GAAMh9B,IAAMmQ,MAI7B,IAAI+sB,EAAc/C,EAAWx7B,EAAGq7B,GAChCtpD,EAAErkB,QAAQ6wE,GAAa,SAASne,GAC9B,GAAIpgB,EAAEv+C,SAAS2+D,EAAM9oE,GAAGlI,OAAQ,CAC9B,IAAIovF,EAAiB/B,EAAaz8B,EAAGogB,EAAM9oE,EAAG2jF,EAAI+B,GAClDsB,EAAUle,EAAM9oE,GAAKknF,EACjBzsD,EAAE90B,IAAIuhF,EAAgB,gBAwCNhsF,EAvCD4tE,EAuCSh/D,EAvCFo9E,EAwCzBzsD,EAAEynD,YAAYhnF,EAAOgpF,aAMxBhpF,EAAOgpF,WAAap6E,EAAMo6E,WAC1BhpF,EAAO69E,OAASjvE,EAAMivE,SANtB79E,EAAOgpF,YAAchpF,EAAOgpF,WAAahpF,EAAO69E,OAC3BjvE,EAAMo6E,WAAap6E,EAAMivE,SACzB79E,EAAO69E,OAASjvE,EAAMivE,QAC3C79E,EAAO69E,QAAUjvE,EAAMivE,SAL3B,IAA0B79E,EAAQ4O,KAlChC,IAAIlC,EAAUk/E,EAAiBG,EAAatD,IAuB9C,SAAyB/7E,EAASo/E,GAChCvsD,EAAErkB,QAAQxO,GAAS,SAASkhE,GAC1BA,EAAM8a,GAAKnpD,EAAEqiD,QAAQhU,EAAM8a,GAAGjjF,KAAI,SAASX,GACzC,OAAIgnF,EAAUhnF,GACLgnF,EAAUhnF,GAAG4jF,GAEf5jF,MACL,MA7BNmnF,CAAgBv/E,EAASo/E,GAEzB,IAAIniE,EAAS1jB,EAAKyG,EAAS89E,GAE3B,GAAIqB,IACFliE,EAAO++D,GAAKnpD,EAAEqiD,QAAQ,CAACiK,EAAIliE,EAAO++D,GAAI1pB,IAAK,GACvCxR,EAAE0+B,aAAaL,GAAIjvF,QAAQ,CAC7B,IAAIuvF,EAAS3+B,EAAEhiC,KAAKgiC,EAAE0+B,aAAaL,GAAI,IACrCO,EAAS5+B,EAAEhiC,KAAKgiC,EAAE0+B,aAAaltB,GAAI,IAChCz/B,EAAE90B,IAAIkf,EAAQ,gBACjBA,EAAOq/D,WAAa,EACpBr/D,EAAOk0D,OAAS,GAElBl0D,EAAOq/D,YAAcr/D,EAAOq/D,WAAar/D,EAAOk0D,OAC3BsO,EAAO1J,MAAQ2J,EAAO3J,QAAU94D,EAAOk0D,OAAS,GACrEl0D,EAAOk0D,QAAU,EAIrB,OAAOl0D,I,eCnDT,IAAI4V,EAAI,EAAQ,MACZg+C,EAAO,EAAQ,MAmCnB,SAAS8O,EAAkB3D,EAAI4D,EAAYpmF,GAEzC,IADA,IAAI++E,EACGqH,EAAW1vF,SAAWqoF,EAAO1lD,EAAE0lD,KAAKqH,IAAazvF,GAAKqJ,GAC3DomF,EAAW30B,MACX+wB,EAAG/oF,KAAKslF,EAAKyD,IACbxiF,IAEF,OAAOA,EAxCTnC,EAAOC,QAEP,SAAc0I,EAAS89E,GACrB,IAwCuB+B,EAxCnBC,EAAQjP,EAAKkP,UAAU//E,GAAS,SAASkhE,GAC3C,OAAOruC,EAAE90B,IAAImjE,EAAO,iBAElB8e,EAAWF,EAAMG,IACnBL,EAAa/sD,EAAE2nD,OAAOsF,EAAMI,KAAK,SAAShf,GAAS,OAAQA,EAAM/wE,KACjE6rF,EAAK,GACLnjF,EAAM,EACNs4E,EAAS,EACTgP,EAAU,EAEZH,EAASzmF,MA8BcsmF,IA9BS/B,EA+BzB,SAASY,EAAQC,GACtB,OAAID,EAAOpC,WAAaqC,EAAOrC,YACrB,EACCoC,EAAOpC,WAAaqC,EAAOrC,WAC7B,EAGDuD,EAA6BlB,EAAOxuF,EAAIuuF,EAAOvuF,EAAxCuuF,EAAOvuF,EAAIwuF,EAAOxuF,KApCnCgwF,EAAUR,EAAkB3D,EAAI4D,EAAYO,GAE5CttD,EAAErkB,QAAQwxE,GAAU,SAAU9e,GAC5Bif,GAAWjf,EAAM8a,GAAG9rF,OACpB8rF,EAAG/oF,KAAKiuE,EAAM8a,IACdnjF,GAAOqoE,EAAMob,WAAapb,EAAMiQ,OAChCA,GAAUjQ,EAAMiQ,OAChBgP,EAAUR,EAAkB3D,EAAI4D,EAAYO,MAG9C,IAAIljE,EAAS,CAAE++D,GAAInpD,EAAEqiD,QAAQ8G,GAAI,IAKjC,OAJI7K,IACFl0D,EAAOq/D,WAAazjF,EAAMs4E,EAC1Bl0D,EAAOk0D,OAASA,GAEXl0D,I,eCjCT,IAAI4V,EAAI,EAAQ,MAEhBx7B,EAAOC,QAEP,SAA2BwpD,GACzB,IAAIs/B,EAoEN,SAAmBt/B,GACjB,IAAI7jC,EAAS,GACTojE,EAAM,EASV,OAFAxtD,EAAErkB,QAAQsyC,EAAEv+C,YALZ,SAAS+uE,EAAIl5E,GACX,IAAIkoF,EAAMD,EACVxtD,EAAErkB,QAAQsyC,EAAEv+C,SAASnK,GAAIk5E,GACzBr0D,EAAO7kB,GAAK,CAAEkoF,IAAKA,EAAKD,IAAKA,QAIxBpjE,EA/EasjE,CAAUz/B,GAE9BjuB,EAAErkB,QAAQsyC,EAAE5Z,QAAQq0C,aAAa,SAASnjF,GAUxC,IATA,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GACdujF,EAAU78D,EAAK68D,QACf6E,EAqCR,SAAkB1/B,EAAGs/B,EAAehoF,EAAG+pD,GACrC,IAIIv7C,EACA65E,EALAC,EAAQ,GACRC,EAAQ,GACRL,EAAM7oF,KAAKwsB,IAAIm8D,EAAchoF,GAAGkoF,IAAKF,EAAcj+B,GAAGm+B,KACtDD,EAAM5oF,KAAKyJ,IAAIk/E,EAAchoF,GAAGioF,IAAKD,EAAcj+B,GAAGk+B,KAK1Dz5E,EAASxO,EACT,GACEwO,EAASk6C,EAAEl6C,OAAOA,GAClB85E,EAAMztF,KAAK2T,SACJA,IACCw5E,EAAcx5E,GAAQ05E,IAAMA,GAAOD,EAAMD,EAAcx5E,GAAQy5E,MAKzE,IAJAI,EAAM75E,EAGNA,EAASu7C,GACDv7C,EAASk6C,EAAEl6C,OAAOA,MAAa65E,GACrCE,EAAM1tF,KAAK2T,GAGb,MAAO,CAAEuD,KAAMu2E,EAAMvjF,OAAOwjF,EAAMl9D,WAAYg9D,IAAKA,GA5DlCG,CAAS9/B,EAAGs/B,EAAezE,EAAQvjF,EAAGujF,EAAQx5B,GACzDh4C,EAAOq2E,EAASr2E,KAChBs2E,EAAMD,EAASC,IACfI,EAAU,EACVC,EAAQ32E,EAAK02E,GACbE,GAAY,EAET3oF,IAAMujF,EAAQx5B,GAAG,CAGtB,GAFArjC,EAAOgiC,EAAEhiC,KAAK1mB,GAEV2oF,EAAW,CACb,MAAQD,EAAQ32E,EAAK02E,MAAcJ,GAC5B3/B,EAAEhiC,KAAKgiE,GAAOrO,QAAU3zD,EAAKkzD,MAClC6O,IAGEC,IAAUL,IACZM,GAAY,GAIhB,IAAKA,EAAW,CACd,KAAOF,EAAU12E,EAAKja,OAAS,GACxB4wD,EAAEhiC,KAAKgiE,EAAQ32E,EAAK02E,EAAU,IAAIrO,SAAW1zD,EAAKkzD,MACvD6O,IAEFC,EAAQ32E,EAAK02E,GAGf//B,EAAEuxB,UAAUj6E,EAAG0oF,GACf1oF,EAAI0oD,EAAEg7B,WAAW1jF,GAAG,S,4BCtC1B,IAAIy6B,EAAI,EAAQ,MACZ8gD,EAAQ,aACR9C,EAAO,EAAQ,MAqCnB,SAASmQ,EAAmBlgC,EAAGs8B,GAC7B,IAAI6D,EAAY,GAqChB,OADApuD,EAAE35B,OAAOkkF,GAlCT,SAAoB8D,EAAWlN,GAC7B,IAGEmN,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAUhxF,OAC5BoxF,EAAWzuD,EAAE0lD,KAAKvE,GAsBpB,OApBAnhD,EAAErkB,QAAQwlE,GAAO,SAAS57E,EAAGjI,GAC3B,IAAIgyD,EAuEV,SAAmCrB,EAAG1oD,GACpC,GAAI0oD,EAAEhiC,KAAK1mB,GAAG0/E,MACZ,OAAOjlD,EAAEwgB,KAAKyN,EAAE0+B,aAAapnF,IAAI,SAAS+hE,GACxC,OAAOrZ,EAAEhiC,KAAKq7C,GAAG2d,SA1ETyJ,CAA0BzgC,EAAG1oD,GACnCopF,EAAKr/B,EAAIrB,EAAEhiC,KAAKqjC,GAAG4zB,MAAQsL,GAEzBl/B,GAAK/pD,IAAMkpF,KACbzuD,EAAErkB,QAAQwlE,EAAMz9E,MAAM6qF,EAASjxF,EAAG,IAAI,SAASsxF,GAC7C5uD,EAAErkB,QAAQsyC,EAAE0+B,aAAaiC,IAAW,SAAStnB,GAC3C,IAAIunB,EAAS5gC,EAAEhiC,KAAKq7C,GAClBwnB,EAAOD,EAAO3L,QACX4L,EAAOR,GAAMK,EAAKG,IACjBD,EAAO5J,OAASh3B,EAAEhiC,KAAK2iE,GAAU3J,OACrC8J,EAAYX,EAAW9mB,EAAGsnB,SAIhCL,EAAUjxF,EAAI,EACdgxF,EAAKK,MAIFxN,KAIFiN,EAGT,SAASY,EAAmB/gC,EAAGs8B,GAC7B,IAAI6D,EAAY,GAEhB,SAASa,EAAKC,EAAOjF,EAAUkF,EAAUC,EAAiBC,GACxD,IAAI9pF,EACJy6B,EAAErkB,QAAQqkB,EAAEhI,MAAMiyD,EAAUkF,IAAW,SAAS7xF,GAC9CiI,EAAI2pF,EAAM5xF,GACN2wD,EAAEhiC,KAAK1mB,GAAG0/E,OACZjlD,EAAErkB,QAAQsyC,EAAE0+B,aAAapnF,IAAI,SAAS+hE,GACpC,IAAIgoB,EAAQrhC,EAAEhiC,KAAKq7C,GACfgoB,EAAMrK,QACLqK,EAAMpM,MAAQkM,GAAmBE,EAAMpM,MAAQmM,IAClDN,EAAYX,EAAW9mB,EAAG/hE,SA8BpC,OADAy6B,EAAE35B,OAAOkkF,GArBT,SAAoBgF,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElBxF,EAAW,EAeb,OAbAjqD,EAAErkB,QAAQuzE,GAAO,SAAS3pF,EAAGmqF,GAC3B,GAAwB,WAApBzhC,EAAEhiC,KAAK1mB,GAAG0/E,MAAoB,CAChC,IAAI0H,EAAe1+B,EAAE0+B,aAAapnF,GAC9BonF,EAAatvF,SACfmyF,EAAevhC,EAAEhiC,KAAK0gE,EAAa,IAAIzJ,MACvC+L,EAAKC,EAAOjF,EAAUyF,EAAgBD,EAAcD,GACpDvF,EAAWyF,EACXD,EAAeD,GAGnBP,EAAKC,EAAOjF,EAAUiF,EAAM7xF,OAAQmyF,EAAcD,EAAMlyF,WAGnD6xF,KAIFd,EAWT,SAASW,EAAYX,EAAW7oF,EAAG+pD,GACjC,GAAI/pD,EAAI+pD,EAAG,CACT,IAAIrqD,EAAMM,EACVA,EAAI+pD,EACJA,EAAIrqD,EAGN,IAAI0qF,EAAavB,EAAU7oF,GACtBoqF,IACHvB,EAAU7oF,GAAKoqF,EAAa,IAE9BA,EAAWrgC,IAAK,EAGlB,SAASsgC,EAAYxB,EAAW7oF,EAAG+pD,GACjC,GAAI/pD,EAAI+pD,EAAG,CACT,IAAIrqD,EAAMM,EACVA,EAAI+pD,EACJA,EAAIrqD,EAEN,OAAO+6B,EAAE90B,IAAIkjF,EAAU7oF,GAAI+pD,GAW7B,SAASugC,EAAkB5hC,EAAGs8B,EAAU6D,EAAW0B,GACjD,IAAIvlE,EAAO,GACTrR,EAAQ,GACRxI,EAAM,GAkCR,OA7BAsvB,EAAErkB,QAAQ4uE,GAAU,SAASpJ,GAC3BnhD,EAAErkB,QAAQwlE,GAAO,SAAS57E,EAAG29E,GAC3B34D,EAAKhlB,GAAKA,EACV2T,EAAM3T,GAAKA,EACXmL,EAAInL,GAAK29E,QAIbljD,EAAErkB,QAAQ4uE,GAAU,SAASpJ,GAC3B,IAAI4O,GAAW,EACf/vD,EAAErkB,QAAQwlE,GAAO,SAAS57E,GACxB,IAAIyqF,EAAKF,EAAWvqF,GACpB,GAAIyqF,EAAG3yF,OAGL,IADA,IAAI4yF,IADJD,EAAKhwD,EAAE2nD,OAAOqI,GAAI,SAAS1gC,GAAK,OAAO5+C,EAAI4+C,OAC9BjyD,OAAS,GAAK,EAClBC,EAAIsH,KAAKiC,MAAMopF,GAAKC,EAAKtrF,KAAKwwB,KAAK66D,GAAK3yF,GAAK4yF,IAAM5yF,EAAG,CAC7D,IAAIgyD,EAAI0gC,EAAG1yF,GACP4b,EAAM3T,KAAOA,GACbwqF,EAAUr/E,EAAI4+C,KACbsgC,EAAYxB,EAAW7oF,EAAG+pD,KAC7Bp2C,EAAMo2C,GAAK/pD,EACX2T,EAAM3T,GAAKglB,EAAKhlB,GAAKglB,EAAK+kC,GAC1BygC,EAAUr/E,EAAI4+C,WAOjB,CAAE/kC,KAAMA,EAAMrR,MAAOA,GAG9B,SAASi3E,EAAqBliC,EAAGs8B,EAAUhgE,EAAMrR,EAAOk3E,GAMtD,IAAIC,EAAK,GACPC,EAmDJ,SAAyBriC,EAAGs8B,EAAUhgE,EAAM6lE,GAC1C,IAAIG,EAAa,IAAIzP,EACnBoF,EAAaj4B,EAAE5Z,QACfm8C,EA+GJ,SAAa3I,EAAS4I,EAASL,GAC7B,OAAO,SAASniC,EAAG1oD,EAAG+pD,GACpB,IAGIohC,EAHAC,EAAS1iC,EAAEhiC,KAAK1mB,GAChBqrF,EAAS3iC,EAAEhiC,KAAKqjC,GAChBtpD,EAAM,EAIV,GADAA,GAAO2qF,EAAOhlF,MAAQ,EAClBq0B,EAAE90B,IAAIylF,EAAQ,YAChB,OAAQA,EAAOrM,SAASzN,eACxB,IAAK,IAAK6Z,GAASC,EAAOhlF,MAAQ,EAAG,MACrC,IAAK,IAAK+kF,EAAQC,EAAOhlF,MAAQ,EAYnC,GATI+kF,IACF1qF,GAAOoqF,EAAaM,GAASA,GAE/BA,EAAQ,EAER1qF,IAAQ2qF,EAAO1L,MAAQwL,EAAU5I,GAAW,EAC5C7hF,IAAQ4qF,EAAO3L,MAAQwL,EAAU5I,GAAW,EAE5C7hF,GAAO4qF,EAAOjlF,MAAQ,EAClBq0B,EAAE90B,IAAI0lF,EAAQ,YAChB,OAAQA,EAAOtM,SAASzN,eACxB,IAAK,IAAK6Z,EAAQE,EAAOjlF,MAAQ,EAAG,MACpC,IAAK,IAAK+kF,GAASE,EAAOjlF,MAAQ,EAQpC,OALI+kF,IACF1qF,GAAOoqF,EAAaM,GAASA,GAE/BA,EAAQ,EAED1qF,GAjJC6qF,CAAI3K,EAAWgB,QAAShB,EAAWe,QAASmJ,GAgBtD,OAdApwD,EAAErkB,QAAQ4uE,GAAU,SAASpJ,GAC3B,IAAI7Z,EACJtnC,EAAErkB,QAAQwlE,GAAO,SAAS57E,GACxB,IAAIurF,EAAQvmE,EAAKhlB,GAEjB,GADAgrF,EAAWtnB,QAAQ6nB,GACfxpB,EAAG,CACL,IAAIypB,EAAQxmE,EAAK+8C,GACf0pB,EAAUT,EAAW3iC,KAAKmjC,EAAOD,GACnCP,EAAWhnB,QAAQwnB,EAAOD,EAAOlsF,KAAKyJ,IAAImiF,EAAMviC,EAAG1oD,EAAG+hE,GAAI0pB,GAAW,IAEvE1pB,EAAI/hE,QAIDgrF,EAtEIU,CAAgBhjC,EAAGs8B,EAAUhgE,EAAM6lE,GAC5ChR,EAAagR,EAAa,aAAe,cAE3C,SAASc,EAAQC,EAAWC,GAI1B,IAHA,IAAI1e,EAAQ4d,EAAOx6C,QACf/sB,EAAO2pD,EAAMta,MACbomB,EAAU,GACPz1D,GACDy1D,EAAQz1D,GACVooE,EAAUpoE,IAEVy1D,EAAQz1D,IAAQ,EAChB2pD,EAAMtyE,KAAK2oB,GACX2pD,EAAQA,EAAMpoE,OAAO8mF,EAAcroE,KAGrCA,EAAO2pD,EAAMta,MA+BjB,OARA84B,GAlBA,SAAenoE,GACbsnE,EAAGtnE,GAAQunE,EAAOr7B,QAAQlsC,GAAM1iB,QAAO,SAASkiF,EAAKxoF,GACnD,OAAO6E,KAAKyJ,IAAIk6E,EAAK8H,EAAGtwF,EAAEwF,GAAK+qF,EAAO1iC,KAAK7tD,MAC1C,KAeUuwF,EAAO3D,aAAarsF,KAAKgwF,IACxCY,GAZA,SAAenoE,GACb,IAAIqI,EAAMk/D,EAAOv7B,SAAShsC,GAAM1iB,QAAO,SAASkiF,EAAKxoF,GACnD,OAAO6E,KAAKwsB,IAAIm3D,EAAK8H,EAAGtwF,EAAEuvD,GAAKghC,EAAO1iC,KAAK7tD,MAC1C0G,OAAOq/E,mBAEN75D,EAAOgiC,EAAEhiC,KAAKlD,GACdqI,IAAQ3qB,OAAOq/E,mBAAqB75D,EAAKmzD,aAAeA,IAC1DiR,EAAGtnE,GAAQnkB,KAAKyJ,IAAIgiF,EAAGtnE,GAAOqI,MAKnBk/D,EAAOrH,WAAW3oF,KAAKgwF,IAGtCtwD,EAAErkB,QAAQzC,GAAO,SAAS3T,GACxB8qF,EAAG9qF,GAAK8qF,EAAG9lE,EAAKhlB,OAGX8qF,EA6BT,SAASgB,EAA2BpjC,EAAGqjC,GACrC,OAAOtxD,EAAE0nD,MAAM1nD,EAAEt1B,OAAO4mF,IAAM,SAAUjB,GACtC,IAAIhiF,EAAM5H,OAAO8qF,kBACbngE,EAAM3qB,OAAOq/E,kBASjB,OAPA9lD,EAAEwnD,MAAM6I,GAAI,SAAUjrF,EAAGG,GACvB,IAAIisF,EAyHV,SAAevjC,EAAG1oD,GAChB,OAAO0oD,EAAEhiC,KAAK1mB,GAAGoG,MA1HGA,CAAMsiD,EAAG1oD,GAAK,EAE9B8I,EAAMzJ,KAAKyJ,IAAIjJ,EAAIosF,EAAWnjF,GAC9B+iB,EAAMxsB,KAAKwsB,IAAIhsB,EAAIosF,EAAWpgE,MAGzB/iB,EAAM+iB,KAWjB,SAASqgE,EAAiBH,EAAKI,GAC7B,IAAIC,EAAc3xD,EAAEt1B,OAAOgnF,GACzBE,EAAa5xD,EAAE5O,IAAIugE,GACnBE,EAAa7xD,EAAE3xB,IAAIsjF,GAErB3xD,EAAErkB,QAAQ,CAAC,IAAK,MAAM,SAASm2E,GAC7B9xD,EAAErkB,QAAQ,CAAC,IAAK,MAAM,SAASo2E,GAC7B,IAEErB,EAFEsB,EAAYF,EAAOC,EACrB1B,EAAKiB,EAAIU,GAEX,GAAI3B,IAAOqB,EAAX,CAEA,IAAIO,EAASjyD,EAAEt1B,OAAO2lF,IACtBK,EAAkB,MAAVqB,EAAgBH,EAAa5xD,EAAE5O,IAAI6gE,GAAUJ,EAAa7xD,EAAE3xB,IAAI4jF,MAGtEX,EAAIU,GAAahyD,EAAEmnD,UAAUkJ,GAAI,SAASjrF,GAAK,OAAOA,EAAIsrF,aAMlE,SAASwB,EAAQZ,EAAKp4E,GACpB,OAAO8mB,EAAEmnD,UAAUmK,EAAIa,IAAI,SAASC,EAAQ7sF,GAC1C,GAAI2T,EACF,OAAOo4E,EAAIp4E,EAAM29D,eAAetxE,GAEhC,IAAI8qF,EAAKrwD,EAAE2nD,OAAO3nD,EAAE95B,IAAIorF,EAAK/rF,IAC7B,OAAQ8qF,EAAG,GAAKA,EAAG,IAAM,KAzU/B7rF,EAAOC,QAAU,CACf4tF,UA6UF,SAAmBpkC,GACjB,IAMIqkC,EANA/H,EAAWvM,EAAKiD,iBAAiBhzB,GACjCmgC,EAAYpuD,EAAEwjD,MAChB2K,EAAmBlgC,EAAGs8B,GACtByE,EAAmB/gC,EAAGs8B,IAEpB+G,EAAM,GAEVtxD,EAAErkB,QAAQ,CAAC,IAAK,MAAM,SAASm2E,GAC7BQ,EAA4B,MAATR,EAAevH,EAAWvqD,EAAEt1B,OAAO6/E,GAAU35D,UAChEoP,EAAErkB,QAAQ,CAAC,IAAK,MAAM,SAASo2E,GACf,MAAVA,IACFO,EAAmBtyD,EAAE95B,IAAIosF,GAAkB,SAAS7tD,GAClD,OAAOzE,EAAEt1B,OAAO+5B,GAAO7T,cAI3B,IAAIk/D,GAAuB,MAATgC,EAAe7jC,EAAE0+B,aAAe1+B,EAAEg7B,YAAY3oF,KAAK2tD,GACjE/0C,EAAQ22E,EAAkB5hC,EAAGqkC,EAAkBlE,EAAW0B,GAC1DO,EAAKF,EAAqBliC,EAAGqkC,EAC/Bp5E,EAAMqR,KAAMrR,EAAMA,MAAiB,MAAV64E,GACb,MAAVA,IACF1B,EAAKrwD,EAAEmnD,UAAUkJ,GAAI,SAASjrF,GAAK,OAAQA,MAE7CksF,EAAIQ,EAAOC,GAAS1B,QAIxB,IAAIkC,EAAgBlB,EAA2BpjC,EAAGqjC,GAElD,OADAG,EAAiBH,EAAKiB,GACfL,EAAQZ,EAAKrjC,EAAE5Z,QAAQn7B,QA1W9Bi1E,mBAAoBA,EACpBa,mBAAoBA,EACpBD,YAAaA,EACba,YAAaA,EACbC,kBAAmBA,EACnBM,qBAAsBA,EACtBsB,iBAAkBA,EAClBJ,2BAA4BA,EAC5Ba,QAASA,I,4BCnBX,IAAIlyD,EAAI,EAAQ,MACZg+C,EAAO,EAAQ,MACfqU,EAAY,kBAEhB7tF,EAAOC,QAEP,SAAkBwpD,IASlB,SAAmBA,GACjB,IAAIs8B,EAAWvM,EAAKiD,iBAAiBhzB,GACjCukC,EAAUvkC,EAAE5Z,QAAQuzB,QACpB6qB,EAAQ,EACZzyD,EAAErkB,QAAQ4uE,GAAU,SAASpJ,GAC3B,IAAIuR,EAAY1yD,EAAE3xB,IAAI2xB,EAAE95B,IAAIi7E,GAAO,SAAS57E,GAAK,OAAO0oD,EAAEhiC,KAAK1mB,GAAGuG,WAClEk0B,EAAErkB,QAAQwlE,GAAO,SAAS57E,GACxB0oD,EAAEhiC,KAAK1mB,GAAGY,EAAIssF,EAAQC,EAAY,KAEpCD,GAASC,EAAYF,MAfvBG,CAFA1kC,EAAI+vB,EAAK2G,mBAAmB12B,IAG5BjuB,EAAErkB,QAAQ02E,EAAUpkC,IAAI,SAAS7oD,EAAGG,GAClC0oD,EAAEhiC,KAAK1mB,GAAGH,EAAIA,O,2BCXlB,IAAI46B,EAAI,EAAQ,MACZ8gD,EAAQ,aACR8R,EAAQ,cAmDZ,SAASC,EAAUlqE,EAAGslC,GAcpB,OADAjuB,EAAErkB,QAAQgN,EAAEmtB,SAZZ,SAAS2oC,EAAIl5E,GACXy6B,EAAErkB,QAAQsyC,EAAE6kC,UAAUvtF,IAAI,SAASxF,GACjC,IAAIgzF,EAAQhzF,EAAEwF,EACZ+pD,EAAK/pD,IAAMwtF,EAAShzF,EAAEuvD,EAAIyjC,EACvBpqE,EAAEghE,QAAQr6B,IAAOsjC,EAAM3kC,EAAGluD,KAC7B4oB,EAAEsgD,QAAQ3Z,EAAG,IACb3mC,EAAE4gD,QAAQhkE,EAAG+pD,EAAG,IAChBmvB,EAAInvB,UAMH3mC,EAAE04D,YAOX,SAAS2R,EAAiBrqE,EAAGslC,GAC3B,OAAOjuB,EAAE0nD,MAAMz5B,EAAErY,SAAS,SAAS71C,GACjC,GAAI4oB,EAAEghE,QAAQ5pF,EAAEwF,KAAOojB,EAAEghE,QAAQ5pF,EAAEuvD,GACjC,OAAOsjC,EAAM3kC,EAAGluD,MAKtB,SAASkzF,EAAWtqE,EAAGslC,EAAGyiC,GACxB1wD,EAAErkB,QAAQgN,EAAEmtB,SAAS,SAASvwC,GAC5B0oD,EAAEhiC,KAAK1mB,GAAG45E,MAAQuR,KAhFtBlsF,EAAOC,QA2BP,SAAsBwpD,GACpB,IAOIL,EAAM8iC,EAPN/nE,EAAI,IAAIm4D,EAAM,CAAEoS,UAAU,IAG1B10E,EAAQyvC,EAAEnY,QAAQ,GAClB7jC,EAAOg8C,EAAEozB,YAIb,IAHA14D,EAAEsgD,QAAQzqD,EAAO,IAGVq0E,EAAUlqE,EAAGslC,GAAKh8C,GACvB27C,EAAOolC,EAAiBrqE,EAAGslC,GAC3ByiC,EAAQ/nE,EAAEghE,QAAQ/7B,EAAKroD,GAAKqtF,EAAM3kC,EAAGL,IAASglC,EAAM3kC,EAAGL,GACvDqlC,EAAWtqE,EAAGslC,EAAGyiC,GAGnB,OAAO/nE,I,4BC9CT,IACIwqE,EADW,EAAQ,MACIA,YACvBC,EAAe,EAAQ,KACvBC,EAAiB,EAAQ,MAE7B7uF,EAAOC,QAqBP,SAAcwpD,GACZ,OAAOA,EAAE5Z,QAAQwzB,QACjB,IAAK,kBAAmByrB,EAAqBrlC,GAAI,MACjD,IAAK,cASP,SAAyBA,GACvBklC,EAAYllC,GACZmlC,EAAanlC,GAXMslC,CAAgBtlC,GAAI,MACvC,IAAK,eAAgBulC,EAAkBvlC,GAAI,MAC3C,QAASqlC,EAAqBrlC,KAKhC,IAAIulC,EAAoBL,EAOxB,SAASG,EAAqBrlC,GAC5BolC,EAAeplC,K,4BC5CjB,IAAIjuB,EAAI,EAAQ,MACZozD,EAAe,EAAQ,KACvBR,EAAQ,cACRa,EAAW,oBACXC,EAAW,oBACXhG,EAAY,qBACZ1V,EAAW,iBA6Cf,SAASqb,EAAeplC,GACtBA,EAAI+pB,EAAS/pB,GACbwlC,EAASxlC,GACT,IAIIluD,EAJA4oB,EAAIyqE,EAAanlC,GAKrB,IAJA0lC,EAAiBhrE,GACjBirE,EAAcjrE,EAAGslC,GAGTluD,EAAI8zF,EAAUlrE,IAEpBmrE,EAAcnrE,EAAGslC,EAAGluD,EADhBg0F,EAAUprE,EAAGslC,EAAGluD,IAQxB,SAAS6zF,EAAcjrE,EAAGslC,GACxB,IAAIk7B,EAAKuE,EAAU/kE,EAAGA,EAAEmtB,SACxBqzC,EAAKA,EAAGzlF,MAAM,EAAGylF,EAAG9rF,OAAS,GAC7B2iC,EAAErkB,QAAQwtE,GAAI,SAAS5jF,IAKzB,SAAwBojB,EAAGslC,EAAG85B,GAC5B,IACIh0E,EADW4U,EAAEsD,KAAK87D,GACAh0E,OACtB4U,EAAEilC,KAAKm6B,EAAOh0E,GAAQigF,SAAWC,EAAatrE,EAAGslC,EAAG85B,GAPlDmM,CAAevrE,EAAGslC,EAAG1oD,MAczB,SAAS0uF,EAAatrE,EAAGslC,EAAG85B,GAC1B,IACIh0E,EADW4U,EAAEsD,KAAK87D,GACAh0E,OAElBogF,GAAc,EAEdC,EAAYnmC,EAAEL,KAAKm6B,EAAOh0E,GAE1BsgF,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAYnmC,EAAEL,KAAK75C,EAAQg0E,IAG7BsM,EAAWD,EAAU9V,OAErBt+C,EAAErkB,QAAQsyC,EAAE6kC,UAAU/K,IAAQ,SAAShoF,GACrC,IAqHsBunE,EAAG/hE,EArHrB+uF,EAAYv0F,EAAEwF,IAAMwiF,EACtB14E,EAAQilF,EAAYv0F,EAAEuvD,EAAIvvD,EAAEwF,EAE9B,GAAI8J,IAAU0E,EAAQ,CACpB,IAAIwgF,EAAeD,IAAcH,EAC/BK,EAAcvmC,EAAEL,KAAK7tD,GAAGu+E,OAG1B,GADA+V,GAAYE,EAAeC,GAAeA,EA8GtBltB,EA7GFygB,EA6GKxiF,EA7GE8J,EAAVsZ,EA8GP8rE,QAAQntB,EAAG/hE,GA9Gc,CAC/B,IAAImvF,EAAgB/rE,EAAEilC,KAAKm6B,EAAO14E,GAAO2kF,SACzCK,GAAYE,GAAgBG,EAAgBA,OAK3CL,EAGT,SAASV,EAAiB5zB,EAAMx1C,GAC1BzrB,UAAUzB,OAAS,IACrBktB,EAAOw1C,EAAKjqB,QAAQ,IAEtB6+C,EAAgB50B,EAAM,GAAI,EAAGx1C,GAG/B,SAASoqE,EAAgB50B,EAAMye,EAASoW,EAASrvF,EAAGwO,GAClD,IAAI05E,EAAMmH,EACN36D,EAAQ8lC,EAAK9zC,KAAK1mB,GAkBtB,OAhBAi5E,EAAQj5E,IAAK,EACby6B,EAAErkB,QAAQokD,EAAK80B,UAAUtvF,IAAI,SAAS+pD,GAC/BtvB,EAAE90B,IAAIszE,EAASlvB,KAClBslC,EAAUD,EAAgB50B,EAAMye,EAASoW,EAAStlC,EAAG/pD,OAIzD00B,EAAMwzD,IAAMA,EACZxzD,EAAMuzD,IAAMoH,IACR7gF,EACFkmB,EAAMlmB,OAASA,SAGRkmB,EAAMlmB,OAGR6gF,EAGT,SAASf,EAAU9zB,GACjB,OAAO//B,EAAEwgB,KAAKuf,EAAKnqB,SAAS,SAAS71C,GACnC,OAAOggE,EAAKnS,KAAK7tD,GAAGi0F,SAAW,KAInC,SAASD,EAAUprE,EAAGslC,EAAGL,GACvB,IAAIroD,EAAIqoD,EAAKroD,EACT+pD,EAAI1B,EAAK0B,EAKRrB,EAAEwmC,QAAQlvF,EAAG+pD,KAChB/pD,EAAIqoD,EAAK0B,EACTA,EAAI1B,EAAKroD,GAGX,IAAIorF,EAAShoE,EAAEsD,KAAK1mB,GAChBqrF,EAASjoE,EAAEsD,KAAKqjC,GAChBwlC,EAAYnE,EACZoE,GAAO,EAIPpE,EAAOnD,IAAMoD,EAAOpD,MACtBsH,EAAYlE,EACZmE,GAAO,GAGT,IAAIC,EAAah1D,EAAE/4B,OAAOgnD,EAAErY,SAAS,SAASgY,GAC5C,OAAOmnC,IAASE,EAAatsE,EAAGA,EAAEsD,KAAK2hC,EAAKroD,GAAIuvF,IACzCC,IAASE,EAAatsE,EAAGA,EAAEsD,KAAK2hC,EAAK0B,GAAIwlC,MAGlD,OAAO90D,EAAE0nD,MAAMsN,GAAY,SAASpnC,GAAQ,OAAOglC,EAAM3kC,EAAGL,MAG9D,SAASkmC,EAAcnrE,EAAGslC,EAAGluD,EAAGoiB,GAC9B,IAAI5c,EAAIxF,EAAEwF,EACN+pD,EAAIvvD,EAAEuvD,EACV3mC,EAAEg2D,WAAWp5E,EAAG+pD,GAChB3mC,EAAE4gD,QAAQpnD,EAAE5c,EAAG4c,EAAEmtC,EAAG,IACpBqkC,EAAiBhrE,GACjBirE,EAAcjrE,EAAGslC,GAInB,SAAqBtlC,EAAGslC,GACtB,IAAI1jC,EAAOyV,EAAEwgB,KAAK73B,EAAEmtB,SAAS,SAASvwC,GAAK,OAAQ0oD,EAAEhiC,KAAK1mB,GAAGwO,UACzDo1E,EAAKuK,EAAS/qE,EAAG4B,GACrB4+D,EAAKA,EAAGzlF,MAAM,GACds8B,EAAErkB,QAAQwtE,GAAI,SAAS5jF,GACrB,IAAIwO,EAAS4U,EAAEsD,KAAK1mB,GAAGwO,OACrB65C,EAAOK,EAAEL,KAAKroD,EAAGwO,GACjBmhF,GAAU,EAEPtnC,IACHA,EAAOK,EAAEL,KAAK75C,EAAQxO,GACtB2vF,GAAU,GAGZjnC,EAAEhiC,KAAK1mB,GAAG45E,KAAOlxB,EAAEhiC,KAAKlY,GAAQorE,MAAQ+V,EAAUtnC,EAAKy2B,QAAUz2B,EAAKy2B,WAjBxE8Q,CAAYxsE,EAAGslC,GAgCjB,SAASgnC,EAAal1B,EAAM4wB,EAAQyE,GAClC,OAAOA,EAAU3H,KAAOkD,EAAOnD,KAAOmD,EAAOnD,KAAO4H,EAAU5H,IA9NhEhpF,EAAOC,QAAU4uF,EAGjBA,EAAeM,iBAAmBA,EAClCN,EAAeO,cAAgBA,EAC/BP,EAAeY,aAAeA,EAC9BZ,EAAeQ,UAAYA,EAC3BR,EAAeU,UAAYA,EAC3BV,EAAeS,cAAgBA,G,4BChB/B,IAAI9zD,EAAI,EAAQ,MAEhBx7B,EAAOC,QAAU,CACf0uF,YAyBF,SAAqBllC,GACnB,IAAIuwB,EAAU,GAsBdx+C,EAAErkB,QAAQsyC,EAAEg0B,WApBZ,SAASxD,EAAIl5E,GACX,IAAI00B,EAAQg0B,EAAEhiC,KAAK1mB,GACnB,GAAIy6B,EAAE90B,IAAIszE,EAASj5E,GACjB,OAAO00B,EAAMklD,KAEfX,EAAQj5E,IAAK,EAEb,IAAI45E,EAAOn/C,EAAE5O,IAAI4O,EAAE95B,IAAI+nD,EAAE8G,SAASxvD,IAAI,SAASxF,GAC7C,OAAO0+E,EAAI1+E,EAAEuvD,GAAKrB,EAAEL,KAAK7tD,GAAGskF,WAS9B,OANIlF,IAAS14E,OAAOq/E,mBAAhB3G,MACAA,IAEFA,EAAO,GAGDllD,EAAMklD,KAAOA,MA5CvByT,MAsDF,SAAe3kC,EAAGluD,GAChB,OAAOkuD,EAAEhiC,KAAKlsB,EAAEuvD,GAAG6vB,KAAOlxB,EAAEhiC,KAAKlsB,EAAEwF,GAAG45E,KAAOlxB,EAAEL,KAAK7tD,GAAGskF,U,4BCzDzD,IAAIrkD,EAAI,EAAQ,MACZ8gD,EAAQ,aAsBZ,SAASvB,EAAatxB,EAAGv3C,EAAM63D,EAAOjqE,GACpC,IAAIiB,EACJ,GACEA,EAAIy6B,EAAE8+C,SAASx6E,SACR2pD,EAAE07B,QAAQpkF,IAInB,OAFAgpE,EAAM0W,MAAQvuE,EACdu3C,EAAEgb,QAAQ1jE,EAAGgpE,GACNhpE,EAiKT,SAASq6E,EAAQ3xB,GACf,OAAOjuB,EAAE3xB,IAAI2xB,EAAE95B,IAAI+nD,EAAEnY,SAAS,SAASvwC,GACrC,IAAI45E,EAAOlxB,EAAEhiC,KAAK1mB,GAAG45E,KACrB,IAAKn/C,EAAEynD,YAAYtI,GACjB,OAAOA,MAjMb36E,EAAOC,QAAU,CACf86E,aAAcA,EACdvH,SAiCF,SAAkB/pB,GAChB,IAAIonC,GAAa,IAAIvU,GAAQ1Z,SAASnZ,EAAE5Z,SAUxC,OATArU,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAAK8vF,EAAWpsB,QAAQ1jE,EAAG0oD,EAAEhiC,KAAK1mB,OAChEy6B,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5B,IAAIu1F,EAAcD,EAAWznC,KAAK7tD,EAAEwF,EAAGxF,EAAEuvD,IAAM,CAAEgvB,OAAQ,EAAG+F,OAAQ,GAChEpqD,EAAQg0B,EAAEL,KAAK7tD,GACnBs1F,EAAW9rB,QAAQxpE,EAAEwF,EAAGxF,EAAEuvD,EAAG,CAC3BgvB,OAAQgX,EAAYhX,OAASrkD,EAAMqkD,OACnC+F,OAAQz/E,KAAKyJ,IAAIinF,EAAYjR,OAAQpqD,EAAMoqD,aAGxCgR,GA3CP1Q,mBA8CF,SAA4B12B,GAC1B,IAAIonC,EAAa,IAAIvU,EAAM,CAAEpZ,WAAYzZ,EAAEsnC,iBAAkBnuB,SAASnZ,EAAE5Z,SASxE,OARArU,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GACvB0oD,EAAEv+C,SAASnK,GAAGlI,QACjBg4F,EAAWpsB,QAAQ1jE,EAAG0oD,EAAEhiC,KAAK1mB,OAGjCy6B,EAAErkB,QAAQsyC,EAAErY,SAAS,SAAS71C,GAC5Bs1F,EAAW9rB,QAAQxpE,EAAGkuD,EAAEL,KAAK7tD,OAExBs1F,GAvDPG,iBA0DF,SAA0BvnC,GACxB,IAAIwnC,EAAYz1D,EAAE95B,IAAI+nD,EAAEnY,SAAS,SAASvwC,GACxC,IAAImwF,EAAO,GAIX,OAHA11D,EAAErkB,QAAQsyC,EAAE8G,SAASxvD,IAAI,SAASxF,GAChC21F,EAAK31F,EAAEuvD,IAAMomC,EAAK31F,EAAEuvD,IAAM,GAAKrB,EAAEL,KAAK7tD,GAAGu+E,UAEpCoX,KAET,OAAO11D,EAAE4nD,UAAU35B,EAAEnY,QAAS2/C,IAjE9BE,mBAoEF,SAA4B1nC,GAC1B,IAAIwnC,EAAYz1D,EAAE95B,IAAI+nD,EAAEnY,SAAS,SAASvwC,GACxC,IAAIqwF,EAAQ,GAIZ,OAHA51D,EAAErkB,QAAQsyC,EAAEgH,QAAQ1vD,IAAI,SAASxF,GAC/B61F,EAAM71F,EAAEwF,IAAMqwF,EAAM71F,EAAEwF,IAAM,GAAK0oD,EAAEL,KAAK7tD,GAAGu+E,UAEtCsX,KAET,OAAO51D,EAAE4nD,UAAU35B,EAAEnY,QAAS2/C,IA3E9B3+B,cAkFF,SAAuBvlD,EAAMmlD,GAC3B,IAcIj0C,EAAIC,EAdJtd,EAAImM,EAAKnM,EACTe,EAAIoL,EAAKpL,EAIT+uD,EAAKwB,EAAMtxD,EAAIA,EACf+vD,EAAKuB,EAAMvwD,EAAIA,EACfmpD,EAAI/9C,EAAK5F,MAAQ,EACjBmvC,EAAIvpC,EAAKzF,OAAS,EAEtB,IAAKopD,IAAOC,EACV,MAAM,IAAIpqD,MAAM,6DAoBlB,OAhBInG,KAAKgE,IAAIusD,GAAM7F,EAAI1qD,KAAKgE,IAAIssD,GAAMpa,GAEhCqa,EAAK,IACPra,GAAKA,GAEPr4B,EAAKq4B,EAAIoa,EAAKC,EACdzyC,EAAKo4B,IAGDoa,EAAK,IACP5F,GAAKA,GAEP7sC,EAAK6sC,EACL5sC,EAAK4sC,EAAI6F,EAAKD,GAGT,CAAE9vD,EAAGA,EAAIqd,EAAItc,EAAGA,EAAIuc,IAjH3Bu+D,iBAwHF,SAA0BhzB,GACxB,IAAIs8B,EAAWvqD,EAAE95B,IAAI85B,EAAEhI,MAAM4nD,EAAQ3xB,GAAK,IAAI,WAAa,MAAO,MAQlE,OAPAjuB,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GACd45E,EAAOlzD,EAAKkzD,KACXn/C,EAAEynD,YAAYtI,KACjBoL,EAASpL,GAAMlzD,EAAKi3D,OAAS39E,MAG1BglF,GAhIP3H,eAuIF,SAAwB30B,GACtB,IAAI78B,EAAM4O,EAAE5O,IAAI4O,EAAE95B,IAAI+nD,EAAEnY,SAAS,SAASvwC,GAAK,OAAO0oD,EAAEhiC,KAAK1mB,GAAG45E,SAChEn/C,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI0mB,EAAOgiC,EAAEhiC,KAAK1mB,GACdy6B,EAAE90B,IAAI+gB,EAAM,UACdA,EAAKkzD,MAAQ/tD,OA3IjB0xD,iBAgJF,SAA0B70B,GAExB,IAAIvvC,EAASshB,EAAE5O,IAAI4O,EAAE95B,IAAI+nD,EAAEnY,SAAS,SAASvwC,GAAK,OAAO0oD,EAAEhiC,KAAK1mB,GAAG45E,SAE/DiG,EAAS,GACbplD,EAAErkB,QAAQsyC,EAAEnY,SAAS,SAASvwC,GAC5B,IAAI45E,EAAOlxB,EAAEhiC,KAAK1mB,GAAG45E,KAAOzgE,EACvB0mE,EAAOjG,KACViG,EAAOjG,GAAQ,IAEjBiG,EAAOjG,GAAM/+E,KAAKmF,MAGpB,IAAImrF,EAAQ,EACRjI,EAAiBx6B,EAAE5Z,QAAQo0C,eAC/BzoD,EAAErkB,QAAQypE,GAAQ,SAAS+D,EAAI7rF,GACzB0iC,EAAEynD,YAAY0B,IAAO7rF,EAAImrF,GAAmB,IAC5CiI,EACOA,GACT1wD,EAAErkB,QAAQwtE,GAAI,SAAS5jF,GAAK0oD,EAAEhiC,KAAK1mB,GAAG45E,MAAQuR,SAlKlD1R,cAuKF,SAAuB/wB,EAAGnhD,EAAQqyE,EAAM+D,GACtC,IAAIj3D,EAAO,CACTtgB,MAAO,EACPG,OAAQ,GAMV,OAJIhN,UAAUzB,QAAU,IACtB4uB,EAAKkzD,KAAOA,EACZlzD,EAAKi3D,MAAQA,GAER3D,EAAatxB,EAAG,SAAUhiC,EAAMnf,IA/KvC8yE,QAASA,EACTsN,UA+LF,SAAmB2I,EAAYl3F,GAC7B,IAAIyrB,EAAS,CAAEgjE,IAAK,GAAIC,IAAK,IAQ7B,OAPArtD,EAAErkB,QAAQk6E,GAAY,SAASx3F,GACzBM,EAAGN,GACL+rB,EAAOgjE,IAAIhtF,KAAK/B,GAEhB+rB,EAAOijE,IAAIjtF,KAAK/B,MAGb+rB,GAvMPqnB,KA8MF,SAAcntC,EAAM3F,GAClB,IAAI6f,EAAQwhB,EAAEjtB,MACd,IACE,OAAOpU,IACP,QACAiL,QAAQC,IAAIvF,EAAO,WAAa07B,EAAEjtB,MAAQyL,GAAS,QAlNrDy/D,OAsNF,SAAgB35E,EAAM3F,GACpB,OAAOA,O,SC5OT6F,EAAOC,QAAU,S,qBCAjB,OAAC,SAAWqxF,GACV,aAiBA,IAkFEC,EAASC,EAAqBC,EAlF5BC,EAAY,KAIdC,EAAa,IAGbC,EAAW,mBAGXC,EAAO,qgCAGPnjF,EAAK,qgCAILojF,EAAW,CAOTC,UAAW,GAiBXC,SAAU,EAeVC,OAAQ,EAIRC,UAAW,EAIXC,SAAW,GAIXC,MAAOV,EAIPW,KAAMX,EAGNjzD,QAAQ,GAQV6zD,GAAW,EAEXC,EAAe,kBACfC,EAAkBD,EAAe,qBACjCE,EAAyBF,EAAe,2BACxCG,EAAoBH,EAAe,qBAEnCI,EAAYvyF,KAAKiC,MACjBuwF,EAAUxyF,KAAK2B,IAEf8wF,EAAW,6CACXC,EAAQ,yDACRC,EAAU,gDACVC,EAAY,qCAEZC,EAAO,IAIPC,EAAiBrB,EAAKh5F,OAAS,EAC/Bs6F,EAAezkF,EAAG7V,OAAS,EAG3Bu6F,EAAI,CAAEtzF,KAAM,oBAg1Ed,SAASuzF,EAAevpF,GACtB,IAAIhR,EAAGgI,EAAG0qF,EACR8H,EAAkBxpF,EAAEjR,OAAS,EAC7Bmb,EAAM,GACN82C,EAAIhhD,EAAE,GAER,GAAIwpF,EAAkB,EAAG,CAEvB,IADAt/E,GAAO82C,EACFhyD,EAAI,EAAGA,EAAIw6F,EAAiBx6F,KAE/BgI,EAj2EO,GAg2EP0qF,EAAK1hF,EAAEhR,GAAK,IACMD,UACXmb,GAAOu/E,EAAczyF,IAC5BkT,GAAOw3E,GAKT1qF,EAx2ES,GAu2ET0qF,GADA1gC,EAAIhhD,EAAEhR,IACG,IACSD,UACXmb,GAAOu/E,EAAczyF,SACvB,GAAU,IAANgqD,EACT,MAAO,IAIT,KAAOA,EAAI,IAAO,GAAIA,GAAK,GAE3B,OAAO92C,EAAM82C,EAIf,SAAS0oC,EAAW16F,EAAG8zB,EAAK/iB,GAC1B,GAAI/Q,MAAQA,GAAKA,EAAI8zB,GAAO9zB,EAAI+Q,EAC9B,MAAMtD,MAAMisF,EAAkB15F,GAUlC,SAAS26F,EAAoB3pF,EAAGhR,EAAG46F,EAAIC,GACrC,IAAIC,EAAI9yF,EAAG0d,EAAGq1E,EAGd,IAAK/yF,EAAIgJ,EAAE,GAAIhJ,GAAK,GAAIA,GAAK,KAAMhI,EAwCnC,QArCMA,EAAI,GACRA,GAz4ES,EA04ET86F,EAAK,IAELA,EAAKxzF,KAAKwwB,MAAM93B,EAAI,GA54EX,GA64ETA,GA74ES,GAm5EXgI,EAAI8xF,EAAQ,GAn5ED,EAm5EgB95F,GAC3B+6F,EAAK/pF,EAAE8pF,GAAM9yF,EAAI,EAEA,MAAb6yF,EACE76F,EAAI,GACG,GAALA,EAAQ+6F,EAAKA,EAAK,IAAM,EACd,GAAL/6F,IAAQ+6F,EAAKA,EAAK,GAAK,GAChCr1E,EAAIk1E,EAAK,GAAW,OAANG,GAAeH,EAAK,GAAW,OAANG,GAAqB,KAANA,GAAqB,GAANA,GAErEr1E,GAAKk1E,EAAK,GAAKG,EAAK,GAAK/yF,GAAK4yF,EAAK,GAAKG,EAAK,GAAK/yF,EAAI,KACnDgJ,EAAE8pF,EAAK,GAAK9yF,EAAI,IAAM,IAAM8xF,EAAQ,GAAI95F,EAAI,GAAK,IAC/C+6F,GAAM/yF,EAAI,GAAW,GAAN+yF,IAAyC,IAA5B/pF,EAAE8pF,EAAK,GAAK9yF,EAAI,IAAM,GAGrDhI,EAAI,GACG,GAALA,EAAQ+6F,EAAKA,EAAK,IAAO,EACf,GAAL/6F,EAAQ+6F,EAAKA,EAAK,IAAM,EACnB,GAAL/6F,IAAQ+6F,EAAKA,EAAK,GAAK,GAChCr1E,GAAKm1E,GAAaD,EAAK,IAAY,MAANG,IAAeF,GAAaD,EAAK,GAAW,MAANG,GAEnEr1E,IAAMm1E,GAAaD,EAAK,IAAMG,EAAK,GAAK/yF,IACtC6yF,GAAaD,EAAK,GAAMG,EAAK,GAAK/yF,EAAI,KACrCgJ,EAAE8pF,EAAK,GAAK9yF,EAAI,IAAO,IAAM8xF,EAAQ,GAAI95F,EAAI,GAAK,EAIlD0lB,EAOT,SAASs1E,EAAY9/E,EAAK+/E,EAAQC,GAOhC,IANA,IAAIpyF,EAEFqyF,EADAt7F,EAAM,CAAC,GAEPG,EAAI,EACJo7F,EAAOlgF,EAAInb,OAENC,EAAIo7F,GAAO,CAChB,IAAKD,EAAOt7F,EAAIE,OAAQo7F,KAASt7F,EAAIs7F,IAASF,EAE9C,IADAp7F,EAAI,IAAMi5F,EAASlvF,QAAQsR,EAAImgF,OAAOr7F,MACjC8I,EAAI,EAAGA,EAAIjJ,EAAIE,OAAQ+I,IACtBjJ,EAAIiJ,GAAKoyF,EAAU,SACF,IAAfr7F,EAAIiJ,EAAI,KAAejJ,EAAIiJ,EAAI,GAAK,GACxCjJ,EAAIiJ,EAAI,IAAMjJ,EAAIiJ,GAAKoyF,EAAU,EACjCr7F,EAAIiJ,IAAMoyF,GAKhB,OAAOr7F,EAAIyzB,UAv3EbgnE,EAAEgB,cAAgBhB,EAAEhvF,IAAM,WACxB,IAAIxD,EAAI,IAAIxG,KAAK2D,YAAY3D,MAE7B,OADIwG,EAAEu/B,EAAI,IAAGv/B,EAAEu/B,EAAI,GACZk0D,EAASzzF,IASlBwyF,EAAExiE,KAAO,WACP,OAAOyjE,EAAS,IAAIj6F,KAAK2D,YAAY3D,MAAOA,KAAKmB,EAAI,EAAG,IAY1D63F,EAAEkB,WAAalB,EAAEmB,IAAM,SAAU5yF,GAC/B,IAAI7I,EAAG8I,EAAG4yF,EAAKC,EACb7zF,EAAIxG,KACJs6F,EAAK9zF,EAAEkJ,EACP6qF,GAAMhzF,EAAI,IAAIf,EAAE7C,YAAY4D,IAAImI,EAChC+hF,EAAKjrF,EAAEu/B,EACPy0D,EAAKjzF,EAAEw+B,EAGT,IAAKu0D,IAAOC,EACV,OAAQ9I,GAAO+I,EAAW/I,IAAO+I,EAAK/I,EAAK6I,IAAOC,EAAK,GAAKD,EAAK7I,EAAK,EAAI,GAAK,EAA3DxS,IAItB,IAAKqb,EAAG,KAAOC,EAAG,GAAI,OAAOD,EAAG,GAAK7I,EAAK8I,EAAG,IAAMC,EAAK,EAGxD,GAAI/I,IAAO+I,EAAI,OAAO/I,EAGtB,GAAIjrF,EAAErF,IAAMoG,EAAEpG,EAAG,OAAOqF,EAAErF,EAAIoG,EAAEpG,EAAIswF,EAAK,EAAI,GAAK,EAMlD,IAAK/yF,EAAI,EAAG8I,GAJZ4yF,EAAME,EAAG77F,SACT47F,EAAME,EAAG97F,QAGmB27F,EAAMC,EAAK37F,EAAI8I,IAAK9I,EAC9C,GAAI47F,EAAG57F,KAAO67F,EAAG77F,GAAI,OAAO47F,EAAG57F,GAAK67F,EAAG77F,GAAK+yF,EAAK,EAAI,GAAK,EAI5D,OAAO2I,IAAQC,EAAM,EAAID,EAAMC,EAAM5I,EAAK,EAAI,GAAK,GAiBrDuH,EAAEyB,OAASzB,EAAErkF,IAAM,WACjB,IAAI+lF,EAAIpB,EACN9yF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAK6C,EAAEkJ,EAGFlJ,EAAEkJ,EAAE,IAETgrF,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK10F,KAAKyJ,IAAIjJ,EAAErF,EAAGqF,EAAEu6B,MArK3B,EAsKX45D,EAAK/C,SAAW,EAEhBpxF,EAwyEF,SAAgBm0F,EAAMn0F,GACpB,IAAIE,EAAGa,EACL/I,EAAMgI,EAAEkJ,EAAEjR,OAMRD,EAAM,GAER+I,GAAK,EAAIqzF,EAAQ,EADjBl0F,EAAIV,KAAKwwB,KAAKh4B,EAAM,KACIiH,YAExBiB,EAAI,GACJa,EAAI,gCAGNozF,EAAKhD,WAAajxF,EAElBF,EAAIq0F,EAAaF,EAAM,EAAGn0F,EAAEoP,MAAMrO,GAAI,IAAIozF,EAAK,IAG/C,IAAK,IAAIj8F,EAAIgI,EAAGhI,KAAM,CACpB,IAAIo8F,EAAQt0F,EAAEoP,MAAMpP,GACpBA,EAAIs0F,EAAMllF,MAAMklF,GAAO9nF,MAAM8nF,GAAOllF,MAAM,GAAGD,KAAK,GAKpD,OAFAglF,EAAKhD,WAAajxF,EAEXF,EAp0EHi0F,CAAOE,EAAMI,EAAiBJ,EAAMn0F,IAExCm0F,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAETW,EAAqB,GAAZ5C,GAA6B,GAAZA,EAAgB7wF,EAAEw0F,MAAQx0F,EAAGk0F,EAAIpB,GAAI,IAZlD,IAAIqB,EAAK,GAHZ,IAAIA,EAAK1b,MAmC5B+Z,EAAEiC,SAAWjC,EAAEkC,KAAO,WACpB,IAAI/5F,EAAGiP,EAAG5K,EAAG4e,EAAG+2E,EAAKp1D,EAAGhF,EAAIhX,EAAGqxE,EAAIC,EACjC70F,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,IAAK6C,EAAEo7D,YAAcp7D,EAAE80F,SAAU,OAAO,IAAIX,EAAKn0F,GAoCjD,IAnCA0xF,GAAW,GAGXnyD,EAAIv/B,EAAEu/B,EAAIyyD,EAAQhyF,EAAEu/B,EAAIv/B,EAAG,EAAI,KAIrBR,KAAKgE,IAAI+7B,IAAM,IAqBvB3hB,EAAI,IAAIu2E,EAAK50D,EAAEtgC,aApBfD,EAAIyzF,EAAezyF,EAAEkJ,IAIjBq2B,IAHJ5kC,EAAIqF,EAAErF,GAGOqE,EAAE/G,OAAS,GAAK,KAAG+G,GAAW,GAALugC,IAAgB,GAANA,EAAU,IAAM,MAChEA,EAAIyyD,EAAQhzF,EAAG,EAAI,GAGnBrE,EAAIo3F,GAAWp3F,EAAI,GAAK,IAAMA,EAAI,IAAMA,EAAI,GAAK,EAAI,KASrDijB,EAAI,IAAIu2E,EANNn1F,EADEugC,GAAK,IACH,KAAO5kC,GAEXqE,EAAIugC,EAAEw1D,iBACAz2F,MAAM,EAAGU,EAAE8C,QAAQ,KAAO,GAAKnH,IAIrC4kC,EAAIv/B,EAAEu/B,GAKVhF,GAAM5/B,EAAIw5F,EAAKhD,WAAa,IAW1B,GAJA0D,GADAD,GADArxE,EAAI3F,GACGxO,MAAMmU,GAAGnU,MAAMmU,IACTpU,KAAKnP,GAClB4d,EAAIo3E,EAAOH,EAAQ1lF,KAAKnP,GAAGoP,MAAMmU,GAAIsxE,EAAQ1lF,KAAKylF,GAAKr6D,EAAK,EAAG,GAG3Dk4D,EAAelvE,EAAEra,GAAG5K,MAAM,EAAGi8B,MAASv7B,EAAIyzF,EAAe70E,EAAE1U,IAAI5K,MAAM,EAAGi8B,GAAK,CAK/E,GAAS,SAJTv7B,EAAIA,EAAEV,MAAMi8B,EAAK,EAAGA,EAAK,MAILo6D,GAAY,QAAL31F,GAepB,EAICA,KAAOA,EAAEV,MAAM,IAAqB,KAAfU,EAAEu0F,OAAO,MAGlCE,EAAS71E,EAAGjjB,EAAI,EAAG,GACnBiP,GAAKgU,EAAExO,MAAMwO,GAAGxO,MAAMwO,GAAGq3E,GAAGj1F,IAG9B,MAtBA,IAAK20F,IACHlB,EAASlwE,EAAG5oB,EAAI,EAAG,GAEf4oB,EAAEnU,MAAMmU,GAAGnU,MAAMmU,GAAG0xE,GAAGj1F,IAAI,CAC7B4d,EAAI2F,EACJ,MAIJgX,GAAM,EACNo6D,EAAM,EAmBZ,OAFAjD,GAAW,EAEJ+B,EAAS71E,EAAGjjB,EAAGw5F,EAAK/C,SAAUxnF,IAQvC4oF,EAAE0C,cAAgB1C,EAAE2C,GAAK,WACvB,IAAIjrC,EACFhhD,EAAI1P,KAAK0P,EACTlK,EAAIy5E,IAEN,GAAIvvE,EAAG,CAML,GAJAlK,EAtSS,IAqSTkrD,EAAIhhD,EAAEjR,OAAS,GACN85F,EAAUv4F,KAAKmB,EAtSf,IAySTuvD,EAAIhhD,EAAEghD,GACC,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIlrD,IAChCA,EAAI,IAAGA,EAAI,GAGjB,OAAOA,GAyBTwzF,EAAE4C,UAAY5C,EAAE6C,IAAM,SAAUt0F,GAC9B,OAAOi0F,EAAOx7F,KAAM,IAAIA,KAAK2D,YAAY4D,KAS3CyxF,EAAE8C,mBAAqB9C,EAAE+C,SAAW,SAAUx0F,GAC5C,IACEozF,EADM36F,KACG2D,YACX,OAAOs2F,EAASuB,EAFRx7F,KAEkB,IAAI26F,EAAKpzF,GAAI,EAAG,EAAG,GAAIozF,EAAKhD,UAAWgD,EAAK/C,WAQxEoB,EAAEgD,OAAShD,EAAEyC,GAAK,SAAUl0F,GAC1B,OAAuB,IAAhBvH,KAAKm6F,IAAI5yF,IASlByxF,EAAE/wF,MAAQ,WACR,OAAOgyF,EAAS,IAAIj6F,KAAK2D,YAAY3D,MAAOA,KAAKmB,EAAI,EAAG,IAS1D63F,EAAEiD,YAAcjD,EAAEkD,GAAK,SAAU30F,GAC/B,OAAOvH,KAAKm6F,IAAI5yF,GAAK,GASvByxF,EAAEmD,qBAAuBnD,EAAEoD,IAAM,SAAU70F,GACzC,IAAIb,EAAI1G,KAAKm6F,IAAI5yF,GACjB,OAAY,GAALb,GAAgB,IAANA,GA6BnBsyF,EAAEqD,iBAAmBrD,EAAE7b,KAAO,WAC5B,IAAIz2E,EAAGlB,EAAGk1F,EAAIpB,EAAI96F,EAChBgI,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YACT24F,EAAM,IAAI3B,EAAK,GAEjB,IAAKn0F,EAAEo7D,WAAY,OAAO,IAAI+4B,EAAKn0F,EAAEu/B,EAAI,IAAQk5C,KACjD,GAAIz4E,EAAE80F,SAAU,OAAOgB,EAEvB5B,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK10F,KAAKyJ,IAAIjJ,EAAErF,EAAGqF,EAAEu6B,MAAQ,EAC9C45D,EAAK/C,SAAW,GAChBp5F,EAAMgI,EAAEkJ,EAAEjR,QAOA,GAER+G,GAAK,EAAIo1F,EAAQ,EADjBl0F,EAAIV,KAAKwwB,KAAKh4B,EAAM,KACIiH,YAExBiB,EAAI,GACJlB,EAAI,gCAGNgB,EAAIq0F,EAAaF,EAAM,EAAGn0F,EAAEoP,MAAMpQ,GAAI,IAAIm1F,EAAK,IAAI,GAMnD,IAHA,IAAI4B,EACF79F,EAAIgI,EACJ81F,EAAK,IAAI7B,EAAK,GACTj8F,KACL69F,EAAU/1F,EAAEoP,MAAMpP,GAClBA,EAAI81F,EAAItpF,MAAMupF,EAAQ3mF,MAAM4mF,EAAGxpF,MAAMupF,EAAQ3mF,MAAM4mF,MAGrD,OAAOvC,EAASzzF,EAAGm0F,EAAKhD,UAAY+C,EAAIC,EAAK/C,SAAW0B,GAAI,IAkC9DN,EAAEyD,eAAiBzD,EAAE5b,KAAO,WAC1B,IAAI12E,EAAGg0F,EAAIpB,EAAI96F,EACbgI,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,IAAK6C,EAAEo7D,YAAcp7D,EAAE80F,SAAU,OAAO,IAAIX,EAAKn0F,GAQjD,GANAk0F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK10F,KAAKyJ,IAAIjJ,EAAErF,EAAGqF,EAAEu6B,MAAQ,EAC9C45D,EAAK/C,SAAW,GAChBp5F,EAAMgI,EAAEkJ,EAAEjR,QAEA,EACR+H,EAAIq0F,EAAaF,EAAM,EAAGn0F,EAAGA,GAAG,OAC3B,CAYLE,GADAA,EAAI,IAAMV,KAAKC,KAAKzH,IACZ,GAAK,GAAS,EAAJkI,EAGlBF,EAAIq0F,EAAaF,EAAM,EADvBn0F,EAAIA,EAAEoP,MAAM,EAAIglF,EAAQ,EAAGl0F,IACEF,GAAG,GAOhC,IAJA,IAAIk2F,EACFC,EAAK,IAAIhC,EAAK,GACdiC,EAAM,IAAIjC,EAAK,IACfkC,EAAM,IAAIlC,EAAK,IACVj0F,KACLg2F,EAAUl2F,EAAEoP,MAAMpP,GAClBA,EAAIA,EAAEoP,MAAM+mF,EAAGhnF,KAAK+mF,EAAQ9mF,MAAMgnF,EAAIhnF,MAAM8mF,GAAS/mF,KAAKknF,MAO9D,OAHAlC,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAETW,EAASzzF,EAAGk0F,EAAIpB,GAAI,IAoB7BN,EAAE8D,kBAAoB9D,EAAE+D,KAAO,WAC7B,IAAIrC,EAAIpB,EACN9yF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAK6C,EAAEo7D,WACHp7D,EAAE80F,SAAiB,IAAIX,EAAKn0F,IAEhCk0F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK,EACtBC,EAAK/C,SAAW,EAET4D,EAAOh1F,EAAE42E,OAAQ52E,EAAE22E,OAAQwd,EAAKhD,UAAY+C,EAAIC,EAAK/C,SAAW0B,IAR7C,IAAIqB,EAAKn0F,EAAEu/B,IA+BvCizD,EAAEgE,cAAgBhE,EAAEza,KAAO,WACzB,IAAI0e,EACFz2F,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YACT+C,EAAIF,EAAEwD,MAAMmwF,IAAI,GAChBO,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SAEZ,OAAW,IAAPlxF,EACW,IAANA,EAEHF,EAAE02F,QAAUC,EAAMxC,EAAMD,EAAIpB,GAAM,IAAIqB,EAAK,GAE3C,IAAIA,EAAK1b,KAGXz4E,EAAE80F,SAAiB6B,EAAMxC,EAAMD,EAAK,EAAGpB,GAAI1jF,MAAM,KAIrD+kF,EAAKhD,UAAY+C,EAAK,EACtBC,EAAK/C,SAAW,EAEhBpxF,EAAIA,EAAEg4E,OACNye,EAASE,EAAMxC,EAAMD,EAAK,EAAGpB,GAAI1jF,MAAM,IAEvC+kF,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAET2D,EAAOjqF,MAAMxM,KAuBtBwyF,EAAEoE,wBAA0BpE,EAAEla,MAAQ,WACpC,IAAI4b,EAAIpB,EACN9yF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAI6C,EAAE62F,IAAI,GAAW,IAAI1C,EAAKn0F,EAAEi1F,GAAG,GAAK,EAAIxc,KACvCz4E,EAAEo7D,YAEP84B,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK10F,KAAKyJ,IAAIzJ,KAAKgE,IAAIxD,EAAErF,GAAIqF,EAAEu6B,MAAQ,EACxD45D,EAAK/C,SAAW,EAChBM,GAAW,EAEX1xF,EAAIA,EAAEoP,MAAMpP,GAAGwM,MAAM,GAAG/M,OAAO0P,KAAKnP,GAEpC0xF,GAAW,EACXyC,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAET9yF,EAAE82F,MAdiB,IAAI3C,EAAKn0F,IAkCrCwyF,EAAEuE,sBAAwBvE,EAAEna,MAAQ,WAClC,IAAI6b,EAAIpB,EACN9yF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAK6C,EAAEo7D,YAAcp7D,EAAE80F,SAAiB,IAAIX,EAAKn0F,IAEjDk0F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK,EAAI10F,KAAKyJ,IAAIzJ,KAAKgE,IAAIxD,EAAErF,GAAIqF,EAAEu6B,MAAQ,EAC5D45D,EAAK/C,SAAW,EAChBM,GAAW,EAEX1xF,EAAIA,EAAEoP,MAAMpP,GAAGmP,KAAK,GAAG1P,OAAO0P,KAAKnP,GAEnC0xF,GAAW,EACXyC,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAET9yF,EAAE82F,OAuBXtE,EAAEwE,yBAA2BxE,EAAEpa,MAAQ,WACrC,IAAI8b,EAAIpB,EAAImE,EAAKC,EACfl3F,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAK6C,EAAEo7D,WACHp7D,EAAErF,GAAK,EAAU,IAAIw5F,EAAKn0F,EAAEwD,MAAMyxF,GAAG,GAAKj1F,EAAEu/B,EAAI,EAAIv/B,EAAE80F,SAAW90F,EAAIy4E,MAEzEyb,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV8F,EAAMl3F,EAAEu6B,KAEJ/6B,KAAKyJ,IAAIiuF,EAAKhD,GAAM,GAAKl0F,EAAErF,EAAI,EAAU84F,EAAS,IAAIU,EAAKn0F,GAAIk0F,EAAIpB,GAAI,IAE3EqB,EAAKhD,UAAY8F,EAAMC,EAAMl3F,EAAErF,EAE/BqF,EAAIg1F,EAAOh1F,EAAEmP,KAAK,GAAI,IAAIglF,EAAK,GAAG3nF,MAAMxM,GAAIi3F,EAAM/C,EAAI,GAEtDC,EAAKhD,UAAY+C,EAAK,EACtBC,EAAK/C,SAAW,EAEhBpxF,EAAIA,EAAE82F,KAEN3C,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAET9yF,EAAEoP,MAAM,MArBW,IAAI+kF,EAAK1b,MA8CrC+Z,EAAE2E,YAAc3E,EAAExa,KAAO,WACvB,IAAIye,EAAQv2F,EACVg0F,EAAIpB,EACJ9yF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAI6C,EAAE80F,SAAiB,IAAIX,EAAKn0F,IAEhCE,EAAIF,EAAEwD,MAAMmwF,IAAI,GAChBO,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,UAEC,IAAPlxF,EAGQ,IAANA,IACFu2F,EAASE,EAAMxC,EAAMD,EAAK,EAAGpB,GAAI1jF,MAAM,KAChCmwB,EAAIv/B,EAAEu/B,EACNk3D,GAIF,IAAItC,EAAK1b,MAKlB0b,EAAKhD,UAAY+C,EAAK,EACtBC,EAAK/C,SAAW,EAEhBpxF,EAAIA,EAAEq1F,IAAI,IAAIlB,EAAK,GAAG3nF,MAAMxM,EAAEoP,MAAMpP,IAAIP,OAAO0P,KAAK,IAAI2oE,OAExDqc,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAET9yF,EAAEoP,MAAM,MAsBjBojF,EAAE4E,eAAiB5E,EAAE1a,KAAO,WAC1B,IAAI5/E,EAAG8I,EAAGd,EAAGlB,EAAGq4F,EAAI9zE,EAAG3F,EAAGq5E,EAAK9qC,EAC7BnsD,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YACT+2F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SAEZ,GAAKpxF,EAAEo7D,WAOA,IAAIp7D,EAAE80F,SACX,OAAO,IAAIX,EAAKn0F,GACX,GAAIA,EAAEwD,MAAMyxF,GAAG,IAAMf,EAAK,GAAK3B,EAGpC,OAFA30E,EAAI+4E,EAAMxC,EAAMD,EAAK,EAAGpB,GAAI1jF,MAAM,MAChCmwB,EAAIv/B,EAAEu/B,EACD3hB,MAZU,CACjB,IAAK5d,EAAEu/B,EAAG,OAAO,IAAI40D,EAAK1b,KAC1B,GAAIyb,EAAK,GAAK3B,EAGZ,OAFA30E,EAAI+4E,EAAMxC,EAAMD,EAAK,EAAGpB,GAAI1jF,MAAM,KAChCmwB,EAAIv/B,EAAEu/B,EACD3hB,EAqBX,IAXAu2E,EAAKhD,UAAY8F,EAAM/C,EAAK,GAC5BC,EAAK/C,SAAW,EAUXl5F,EAFLgI,EAAIV,KAAKwsB,IAAI,GAAIirE,EAz1BN,EAy1BuB,EAAI,GAE1B/+F,IAAKA,EAAG8H,EAAIA,EAAEq1F,IAAIr1F,EAAEoP,MAAMpP,GAAGmP,KAAK,GAAG1P,OAAO0P,KAAK,IAW7D,IATAuiF,GAAW,EAEX1wF,EAAIxB,KAAKwwB,KAAKinE,EA/1BH,GAg2BXj4F,EAAI,EACJmtD,EAAKnsD,EAAEoP,MAAMpP,GACb4d,EAAI,IAAIu2E,EAAKn0F,GACbq3F,EAAKr3F,GAGS,IAAP9H,GAOL,GANAm/F,EAAKA,EAAGjoF,MAAM+8C,GACd5oC,EAAI3F,EAAEpR,MAAM6qF,EAAGhC,IAAIr2F,GAAK,IAExBq4F,EAAKA,EAAGjoF,MAAM+8C,QAGC,KAFfvuC,EAAI2F,EAAEpU,KAAKkoF,EAAGhC,IAAIr2F,GAAK,KAEjBkK,EAAElI,GAAe,IAAK9I,EAAI8I,EAAG4c,EAAE1U,EAAEhR,KAAOqrB,EAAEra,EAAEhR,IAAMA,MAO1D,OAJIgI,IAAG0d,EAAIA,EAAExO,MAAM,GAAMlP,EAAI,IAE7BwxF,GAAW,EAEJ+B,EAAS71E,EAAGu2E,EAAKhD,UAAY+C,EAAIC,EAAK/C,SAAW0B,GAAI,IAQ9DN,EAAEp3B,SAAW,WACX,QAAS5hE,KAAK0P,GAQhBspF,EAAE1/B,UAAY0/B,EAAE8E,MAAQ,WACtB,QAAS99F,KAAK0P,GAAK6oF,EAAUv4F,KAAKmB,EAt4BvB,GAs4BuCnB,KAAK0P,EAAEjR,OAAS,GAQpEu6F,EAAEtwF,MAAQ,WACR,OAAQ1I,KAAK+lC,GAQfizD,EAAE+E,WAAa/E,EAAEkE,MAAQ,WACvB,OAAOl9F,KAAK+lC,EAAI,GAQlBizD,EAAEgF,WAAahF,EAAEiF,MAAQ,WACvB,OAAOj+F,KAAK+lC,EAAI,GAQlBizD,EAAEsC,OAAS,WACT,QAASt7F,KAAK0P,GAAmB,IAAd1P,KAAK0P,EAAE,IAQ5BspF,EAAEkF,SAAWlF,EAAEmF,GAAK,SAAU52F,GAC5B,OAAOvH,KAAKm6F,IAAI5yF,GAAK,GAQvByxF,EAAEoF,kBAAoBpF,EAAEqE,IAAM,SAAU91F,GACtC,OAAOvH,KAAKm6F,IAAI5yF,GAAK,GAkCvByxF,EAAEqF,UAAYrF,EAAE/tF,IAAM,SAAUnI,GAC9B,IAAIw7F,EAAU5uF,EAAG3F,EAAarD,EAAG63F,EAAK7tF,EAAKqwB,EAAI3c,EAC7C7kB,EAAMS,KACN26F,EAAOp7F,EAAIoE,YACX+2F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SAIZ,GAAY,MAAR90F,EACFA,EAAO,IAAI63F,EAAK,IAChB2D,GAAW,MACN,CAKL,GAHA5uF,GADA5M,EAAO,IAAI63F,EAAK73F,IACP4M,EAGL5M,EAAKijC,EAAI,IAAMr2B,IAAMA,EAAE,IAAM5M,EAAK24F,GAAG,GAAI,OAAO,IAAId,EAAK1b,KAE7Dqf,EAAWx7F,EAAK24F,GAAG,IAMrB,GAHA/rF,EAAInQ,EAAImQ,EAGJnQ,EAAIwmC,EAAI,IAAMr2B,IAAMA,EAAE,IAAMnQ,EAAIk8F,GAAG,GACrC,OAAO,IAAId,EAAKjrF,IAAMA,EAAE,IAAK,IAAkB,GAATnQ,EAAIwmC,EAASk5C,IAAMvvE,EAAI,EAAI,KAKnE,GAAI4uF,EACF,GAAI5uF,EAAEjR,OAAS,EACb8/F,GAAM,MACD,CACL,IAAK73F,EAAIgJ,EAAE,GAAIhJ,EAAI,IAAO,GAAIA,GAAK,GACnC63F,EAAY,IAAN73F,EA0BV,GAtBAwxF,GAAW,EAEXxnF,EAAM8tF,EAAiBj/F,EADvBwhC,EAAK25D,EAnCK,GAqCV3wF,EAAcu0F,EAAWG,EAAQ9D,EAAM55D,EAAK,IAAMy9D,EAAiB17F,EAAMi+B,GAmBrEs4D,GAhBJj1E,EAAIo3E,EAAO9qF,EAAK3G,EAAag3B,EAAI,IAgBPrxB,EAAGhJ,EAAIg0F,EAAIpB,GAEnC,GAME,GAJA5oF,EAAM8tF,EAAiBj/F,EADvBwhC,GAAM,IAENh3B,EAAcu0F,EAAWG,EAAQ9D,EAAM55D,EAAK,IAAMy9D,EAAiB17F,EAAMi+B,GACzE3c,EAAIo3E,EAAO9qF,EAAK3G,EAAag3B,EAAI,IAE5Bw9D,EAAK,EAGHtF,EAAe70E,EAAE1U,GAAG5K,MAAM4B,EAAI,EAAGA,EAAI,IAAM,GAAK,OACnD0d,EAAI61E,EAAS71E,EAAGs2E,EAAK,EAAG,IAG1B,aAEKrB,EAAoBj1E,EAAE1U,EAAGhJ,GAAK,GAAI4yF,IAK7C,OAFApB,GAAW,EAEJ+B,EAAS71E,EAAGs2E,EAAIpB,IAiDzBN,EAAEhmF,MAAQgmF,EAAE0F,IAAM,SAAUn3F,GAC1B,IAAImI,EAAGvO,EAAGzC,EAAG8I,EAAGd,EAAGlI,EAAKk8F,EAAIpB,EAAIgB,EAAIroB,EAAI0sB,EAAMpE,EAC5C/zF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAKX,GAHA4D,EAAI,IAAIozF,EAAKpzF,IAGRf,EAAEkJ,IAAMnI,EAAEmI,EAab,OAVKlJ,EAAEu/B,GAAMx+B,EAAEw+B,EAGNv/B,EAAEkJ,EAAGnI,EAAEw+B,GAAKx+B,EAAEw+B,EAKlBx+B,EAAI,IAAIozF,EAAKpzF,EAAEmI,GAAKlJ,EAAEu/B,IAAMx+B,EAAEw+B,EAAIv/B,EAAIy4E,KARzB13E,EAAI,IAAIozF,EAAK1b,KAUxB13E,EAIT,GAAIf,EAAEu/B,GAAKx+B,EAAEw+B,EAEX,OADAx+B,EAAEw+B,GAAKx+B,EAAEw+B,EACFv/B,EAAEmP,KAAKpO,GAShB,GANA+yF,EAAK9zF,EAAEkJ,EACP6qF,EAAKhzF,EAAEmI,EACPgrF,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,UAGL0C,EAAG,KAAOC,EAAG,GAAI,CAGpB,GAAIA,EAAG,GAAIhzF,EAAEw+B,GAAKx+B,EAAEw+B,MAGf,KAAIu0D,EAAG,GAIP,OAAO,IAAIK,EAAY,IAAPrB,GAAY,EAAI,GAJrB/xF,EAAI,IAAIozF,EAAKn0F,GAM7B,OAAO0xF,EAAW+B,EAAS1yF,EAAGmzF,EAAIpB,GAAM/xF,EAa1C,GAPApG,EAAIo3F,EAAUhxF,EAAEpG,EAzpCL,GA0pCX8wE,EAAKsmB,EAAU/xF,EAAErF,EA1pCN,GA4pCXm5F,EAAKA,EAAGx1F,QACR4B,EAAIurE,EAAK9wE,EAGF,CAyBL,KAxBAw9F,EAAOj4F,EAAI,IAGTgJ,EAAI4qF,EACJ5zF,GAAKA,EACLlI,EAAM+7F,EAAG97F,SAETiR,EAAI6qF,EACJp5F,EAAI8wE,EACJzzE,EAAM87F,EAAG77F,QAQPiI,GAFJhI,EAAIsH,KAAKyJ,IAAIzJ,KAAKwwB,KAAKkkE,EAhrCd,GAgrC8Bl8F,GAAO,KAG5CkI,EAAIhI,EACJgR,EAAEjR,OAAS,GAIbiR,EAAEsiB,UACGtzB,EAAIgI,EAAGhI,KAAMgR,EAAElO,KAAK,GACzBkO,EAAEsiB,cAGG,CASL,KAHA2sE,GAFAjgG,EAAI47F,EAAG77F,SACPD,EAAM+7F,EAAG97F,WAECD,EAAME,GAEXA,EAAI,EAAGA,EAAIF,EAAKE,IACnB,GAAI47F,EAAG57F,IAAM67F,EAAG77F,GAAI,CAClBigG,EAAOrE,EAAG57F,GAAK67F,EAAG77F,GAClB,MAIJgI,EAAI,EAcN,IAXIi4F,IACFjvF,EAAI4qF,EACJA,EAAKC,EACLA,EAAK7qF,EACLnI,EAAEw+B,GAAKx+B,EAAEw+B,GAGXvnC,EAAM87F,EAAG77F,OAIJC,EAAI67F,EAAG97F,OAASD,EAAKE,EAAI,IAAKA,EAAG47F,EAAG97F,KAAS,EAGlD,IAAKE,EAAI67F,EAAG97F,OAAQC,EAAIgI,GAAI,CAE1B,GAAI4zF,IAAK57F,GAAK67F,EAAG77F,GAAI,CACnB,IAAK8I,EAAI9I,EAAG8I,GAAiB,IAAZ8yF,IAAK9yF,IAAW8yF,EAAG9yF,GAAKqxF,EAAO,IAC9CyB,EAAG9yF,GACL8yF,EAAG57F,IAAMm6F,EAGXyB,EAAG57F,IAAM67F,EAAG77F,GAId,KAAqB,IAAd47F,IAAK97F,IAAa87F,EAAG9gC,MAG5B,KAAiB,IAAV8gC,EAAG,GAAUA,EAAGsE,UAAWz9F,EAGlC,OAAKm5F,EAAG,IAER/yF,EAAEmI,EAAI4qF,EACN/yF,EAAEpG,EAAI09F,EAAkBvE,EAAIn5F,GAErB+2F,EAAW+B,EAAS1yF,EAAGmzF,EAAIpB,GAAM/xF,GALrB,IAAIozF,EAAY,IAAPrB,GAAY,EAAI,IAiC9CN,EAAEnB,OAASmB,EAAE8F,IAAM,SAAUv3F,GAC3B,IAAIw3F,EACFv4F,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAKX,OAHA4D,EAAI,IAAIozF,EAAKpzF,IAGRf,EAAEkJ,IAAMnI,EAAEw+B,GAAKx+B,EAAEmI,IAAMnI,EAAEmI,EAAE,GAAW,IAAIirF,EAAK1b,MAG/C13E,EAAEmI,GAAKlJ,EAAEkJ,IAAMlJ,EAAEkJ,EAAE,GACfuqF,EAAS,IAAIU,EAAKn0F,GAAIm0F,EAAKhD,UAAWgD,EAAK/C,WAIpDM,GAAW,EAEQ,GAAfyC,EAAK9C,QAIPkH,EAAIvD,EAAOh1F,EAAGe,EAAEyC,MAAO,EAAG,EAAG,IAC3B+7B,GAAKx+B,EAAEw+B,EAETg5D,EAAIvD,EAAOh1F,EAAGe,EAAG,EAAGozF,EAAK9C,OAAQ,GAGnCkH,EAAIA,EAAEnpF,MAAMrO,GAEZ2wF,GAAW,EAEJ1xF,EAAEwM,MAAM+rF,KAUjB/F,EAAEgG,mBAAqBhG,EAAE5vF,IAAM,WAC7B,OAAO41F,EAAmBh/F,OAS5Bg5F,EAAEwF,iBAAmBxF,EAAEsE,GAAK,WAC1B,OAAOkB,EAAiBx+F,OAS1Bg5F,EAAEiG,QAAUjG,EAAEgC,IAAM,WAClB,IAAIx0F,EAAI,IAAIxG,KAAK2D,YAAY3D,MAE7B,OADAwG,EAAEu/B,GAAKv/B,EAAEu/B,EACFk0D,EAASzzF,IAyBlBwyF,EAAErjF,KAAOqjF,EAAEzsF,IAAM,SAAUhF,GACzB,IAAI23F,EAAOxvF,EAAGvO,EAAGzC,EAAGgI,EAAGlI,EAAKk8F,EAAIpB,EAAIgB,EAAIC,EACtC/zF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAKX,GAHA4D,EAAI,IAAIozF,EAAKpzF,IAGRf,EAAEkJ,IAAMnI,EAAEmI,EAWb,OARKlJ,EAAEu/B,GAAMx+B,EAAEw+B,EAMLv/B,EAAEkJ,IAAGnI,EAAI,IAAIozF,EAAKpzF,EAAEmI,GAAKlJ,EAAEu/B,IAAMx+B,EAAEw+B,EAAIv/B,EAAIy4E,MANnC13E,EAAI,IAAIozF,EAAK1b,KAQxB13E,EAIT,GAAIf,EAAEu/B,GAAKx+B,EAAEw+B,EAEX,OADAx+B,EAAEw+B,GAAKx+B,EAAEw+B,EACFv/B,EAAEwM,MAAMzL,GASjB,GANA+yF,EAAK9zF,EAAEkJ,EACP6qF,EAAKhzF,EAAEmI,EACPgrF,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,UAGL0C,EAAG,KAAOC,EAAG,GAMhB,OAFKA,EAAG,KAAIhzF,EAAI,IAAIozF,EAAKn0F,IAElB0xF,EAAW+B,EAAS1yF,EAAGmzF,EAAIpB,GAAM/xF,EAa1C,GAPAb,EAAI6xF,EAAU/xF,EAAErF,EAz5CL,GA05CXA,EAAIo3F,EAAUhxF,EAAEpG,EA15CL,GA45CXm5F,EAAKA,EAAGx1F,QACRpG,EAAIgI,EAAIvF,EAGD,CAuBL,IArBIzC,EAAI,GACNgR,EAAI4qF,EACJ57F,GAAKA,EACLF,EAAM+7F,EAAG97F,SAETiR,EAAI6qF,EACJp5F,EAAIuF,EACJlI,EAAM87F,EAAG77F,QAOPC,GAFJF,GADAkI,EAAIV,KAAKwwB,KAAKkkE,EA76CL,IA86CCl8F,EAAMkI,EAAI,EAAIlI,EAAM,KAG5BE,EAAIF,EACJkR,EAAEjR,OAAS,GAIbiR,EAAEsiB,UACKtzB,KAAMgR,EAAElO,KAAK,GACpBkO,EAAEsiB,UAeJ,KAZAxzB,EAAM87F,EAAG77F,SACTC,EAAI67F,EAAG97F,QAGO,IACZC,EAAIF,EACJkR,EAAI6qF,EACJA,EAAKD,EACLA,EAAK5qF,GAIFwvF,EAAQ,EAAGxgG,GACdwgG,GAAS5E,IAAK57F,GAAK47F,EAAG57F,GAAK67F,EAAG77F,GAAKwgG,GAASrG,EAAO,EACnDyB,EAAG57F,IAAMm6F,EAUX,IAPIqG,IACF5E,EAAG/oF,QAAQ2tF,KACT/9F,GAKC3C,EAAM87F,EAAG77F,OAAqB,GAAb67F,IAAK97F,IAAY87F,EAAG9gC,MAK1C,OAHAjyD,EAAEmI,EAAI4qF,EACN/yF,EAAEpG,EAAI09F,EAAkBvE,EAAIn5F,GAErB+2F,EAAW+B,EAAS1yF,EAAGmzF,EAAIpB,GAAM/xF,GAU1CyxF,EAAErB,UAAYqB,EAAEj4D,GAAK,SAAU/R,GAC7B,IAAItoB,EACFF,EAAIxG,KAEN,QAAU,IAANgvB,GAAgBA,MAAQA,GAAW,IAANA,GAAiB,IAANA,EAAS,MAAM7iB,MAAMisF,EAAkBppE,GASnF,OAPIxoB,EAAEkJ,GACJhJ,EAAIy4F,EAAa34F,EAAEkJ,GACfsf,GAAKxoB,EAAErF,EAAI,EAAIuF,IAAGA,EAAIF,EAAErF,EAAI,IAEhCuF,EAAIu4E,IAGCv4E,GASTsyF,EAAEhwF,MAAQ,WACR,IAAIxC,EAAIxG,KACN26F,EAAOn0F,EAAE7C,YAEX,OAAOs2F,EAAS,IAAIU,EAAKn0F,GAAIA,EAAErF,EAAI,EAAGw5F,EAAK/C,WAmB7CoB,EAAEoG,KAAOpG,EAAEnkF,IAAM,WACf,IAAI6lF,EAAIpB,EACN9yF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAK6C,EAAEo7D,WACHp7D,EAAE80F,SAAiB,IAAIX,EAAKn0F,IAEhCk0F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK10F,KAAKyJ,IAAIjJ,EAAErF,EAAGqF,EAAEu6B,MAzhD3B,EA0hDX45D,EAAK/C,SAAW,EAEhBpxF,EA67DF,SAAcm0F,EAAMn0F,GAClB,IAAIE,EACFlI,EAAMgI,EAAEkJ,EAAEjR,OAEZ,GAAID,EAAM,EAAG,OAAOq8F,EAAaF,EAAM,EAAGn0F,EAAGA,GAQ7CE,GADAA,EAAI,IAAMV,KAAKC,KAAKzH,IACZ,GAAK,GAAS,EAAJkI,EAGlBF,EAAIq0F,EAAaF,EAAM,EADvBn0F,EAAIA,EAAEoP,MAAM,EAAIglF,EAAQ,EAAGl0F,IACEF,GAO7B,IAJA,IAAI64F,EACF1C,EAAK,IAAIhC,EAAK,GACdiC,EAAM,IAAIjC,EAAK,IACfkC,EAAM,IAAIlC,EAAK,IACVj0F,KACL24F,EAAS74F,EAAEoP,MAAMpP,GACjBA,EAAIA,EAAEoP,MAAM+mF,EAAGhnF,KAAK0pF,EAAOzpF,MAAMgnF,EAAIhnF,MAAMypF,GAAQrsF,MAAM6pF,MAG3D,OAAOr2F,EAx9DH44F,CAAKzE,EAAMI,EAAiBJ,EAAMn0F,IAEtCm0F,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAETW,EAAS5C,EAAW,EAAI7wF,EAAEw0F,MAAQx0F,EAAGk0F,EAAIpB,GAAI,IAb1B,IAAIqB,EAAK1b,MA6BrC+Z,EAAEsG,WAAatG,EAAE/yF,KAAO,WACtB,IAAImK,EAAG5K,EAAGu7B,EAAI3c,EAAG+2E,EAAKpxE,EACpBvjB,EAAIxG,KACJ0P,EAAIlJ,EAAEkJ,EACNvO,EAAIqF,EAAErF,EACN4kC,EAAIv/B,EAAEu/B,EACN40D,EAAOn0F,EAAE7C,YAGX,GAAU,IAANoiC,IAAYr2B,IAAMA,EAAE,GACtB,OAAO,IAAIirF,GAAM50D,GAAKA,EAAI,KAAOr2B,GAAKA,EAAE,IAAMuvE,IAAMvvE,EAAIlJ,EAAI,KAgC9D,IA7BA0xF,GAAW,EAOF,IAJTnyD,EAAI//B,KAAKC,MAAMO,KAIDu/B,GAAK,OACjBvgC,EAAIyzF,EAAevpF,IAEZjR,OAAS0C,GAAK,GAAK,IAAGqE,GAAK,KAClCugC,EAAI//B,KAAKC,KAAKT,GACdrE,EAAIo3F,GAAWp3F,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS3CijB,EAAI,IAAIu2E,EANNn1F,EADEugC,GAAK,IACH,KAAO5kC,GAEXqE,EAAIugC,EAAEw1D,iBACAz2F,MAAM,EAAGU,EAAE8C,QAAQ,KAAO,GAAKnH,IAKvCijB,EAAI,IAAIu2E,EAAK50D,EAAEtgC,YAGjBs7B,GAAM5/B,EAAIw5F,EAAKhD,WAAa,IAQ1B,GAHAvzE,GADA2F,EAAI3F,GACEzO,KAAK6lF,EAAOh1F,EAAGujB,EAAGgX,EAAK,EAAG,IAAInrB,MAAM,IAGtCqjF,EAAelvE,EAAEra,GAAG5K,MAAM,EAAGi8B,MAASv7B,EAAIyzF,EAAe70E,EAAE1U,IAAI5K,MAAM,EAAGi8B,GAAK,CAK/E,GAAS,SAJTv7B,EAAIA,EAAEV,MAAMi8B,EAAK,EAAGA,EAAK,MAILo6D,GAAY,QAAL31F,GAepB,EAICA,KAAOA,EAAEV,MAAM,IAAqB,KAAfU,EAAEu0F,OAAO,MAGlCE,EAAS71E,EAAGjjB,EAAI,EAAG,GACnBiP,GAAKgU,EAAExO,MAAMwO,GAAGq3E,GAAGj1F,IAGrB,MAtBA,IAAK20F,IACHlB,EAASlwE,EAAG5oB,EAAI,EAAG,GAEf4oB,EAAEnU,MAAMmU,GAAG0xE,GAAGj1F,IAAI,CACpB4d,EAAI2F,EACJ,MAIJgX,GAAM,EACNo6D,EAAM,EAmBZ,OAFAjD,GAAW,EAEJ+B,EAAS71E,EAAGjjB,EAAGw5F,EAAK/C,SAAUxnF,IAiBvC4oF,EAAEuG,QAAUvG,EAAEwG,IAAM,WAClB,IAAI9E,EAAIpB,EACN9yF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAEX,OAAK6C,EAAEo7D,WACHp7D,EAAE80F,SAAiB,IAAIX,EAAKn0F,IAEhCk0F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SACV+C,EAAKhD,UAAY+C,EAAK,GACtBC,EAAK/C,SAAW,GAEhBpxF,EAAIA,EAAEqO,OACJkxB,EAAI,EACNv/B,EAAIg1F,EAAOh1F,EAAG,IAAIm0F,EAAK,GAAG3nF,MAAMxM,EAAEoP,MAAMpP,IAAIP,OAAQy0F,EAAK,GAAI,GAE7DC,EAAKhD,UAAY+C,EACjBC,EAAK/C,SAAW0B,EAETW,EAAqB,GAAZ5C,GAA6B,GAAZA,EAAgB7wF,EAAEw0F,MAAQx0F,EAAGk0F,EAAIpB,GAAI,IAf5C,IAAIqB,EAAK1b,MAwCrC+Z,EAAEpjF,MAAQojF,EAAEyG,IAAM,SAAUl4F,GAC1B,IAAI23F,EAAO/9F,EAAGzC,EAAGgI,EAAG0d,EAAGs7E,EAAI31E,EAAGqwE,EAAKC,EACjC7zF,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YACT22F,EAAK9zF,EAAEkJ,EACP6qF,GAAMhzF,EAAI,IAAIozF,EAAKpzF,IAAImI,EAKzB,GAHAnI,EAAEw+B,GAAKv/B,EAAEu/B,IAGJu0D,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAII,GAAMpzF,EAAEw+B,GAAKu0D,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAI5Drb,IAICqb,GAAOC,EAAqB,EAANhzF,EAAEw+B,EAAZx+B,EAAEw+B,EAAI,GAoBzB,IAjBA5kC,EAAIo3F,EAAU/xF,EAAErF,EA3tDL,GA2tDqBo3F,EAAUhxF,EAAEpG,EA3tDjC,IA4tDXi5F,EAAME,EAAG77F,SACT47F,EAAME,EAAG97F,UAIP2lB,EAAIk2E,EACJA,EAAKC,EACLA,EAAKn2E,EACLs7E,EAAKtF,EACLA,EAAMC,EACNA,EAAMqF,GAIRt7E,EAAI,GAEC1lB,EADLghG,EAAKtF,EAAMC,EACE37F,KAAM0lB,EAAE5iB,KAAK,GAG1B,IAAK9C,EAAI27F,IAAO37F,GAAK,GAAI,CAEvB,IADAwgG,EAAQ,EACHx4F,EAAI0zF,EAAM17F,EAAGgI,EAAIhI,GACpBqrB,EAAI3F,EAAE1d,GAAK6zF,EAAG77F,GAAK47F,EAAG5zF,EAAIhI,EAAI,GAAKwgG,EACnC96E,EAAE1d,KAAOqjB,EAAI8uE,EAAO,EACpBqG,EAAQn1E,EAAI8uE,EAAO,EAGrBz0E,EAAE1d,IAAM0d,EAAE1d,GAAKw4F,GAASrG,EAAO,EAIjC,MAAQz0E,IAAIs7E,IAAMt7E,EAAEo1C,MAQpB,OANI0lC,IAAS/9F,EACRijB,EAAEw6E,QAEPr3F,EAAEmI,EAAI0U,EACN7c,EAAEpG,EAAI09F,EAAkBz6E,EAAGjjB,GAEpB+2F,EAAW+B,EAAS1yF,EAAGozF,EAAKhD,UAAWgD,EAAK/C,UAAYrwF,GAcjEyxF,EAAE2G,SAAW,SAAU5+D,EAAIu4D,GACzB,OAAOsG,EAAe5/F,KAAM,EAAG+gC,EAAIu4D,IAcrCN,EAAE6G,gBAAkB7G,EAAE8G,KAAO,SAAUnE,EAAIrC,GACzC,IAAI9yF,EAAIxG,KACN26F,EAAOn0F,EAAE7C,YAGX,OADA6C,EAAI,IAAIm0F,EAAKn0F,QACF,IAAPm1F,EAAsBn1F,GAE1B4yF,EAAWuC,EAAI,EAAGpE,QAEP,IAAP+B,EAAeA,EAAKqB,EAAK/C,SACxBwB,EAAWE,EAAI,EAAG,GAEhBW,EAASzzF,EAAGm1F,EAAKn1F,EAAErF,EAAI,EAAGm4F,KAYnCN,EAAEuC,cAAgB,SAAUI,EAAIrC,GAC9B,IAAI1/E,EACFpT,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAcX,YAZW,IAAPg4F,EACF/hF,EAAMmmF,EAAev5F,GAAG,IAExB4yF,EAAWuC,EAAI,EAAGpE,QAEP,IAAP+B,EAAeA,EAAKqB,EAAK/C,SACxBwB,EAAWE,EAAI,EAAG,GAGvB1/E,EAAMmmF,EADNv5F,EAAIyzF,EAAS,IAAIU,EAAKn0F,GAAIm1F,EAAK,EAAGrC,IACV,EAAMqC,EAAK,IAG9Bn1F,EAAE02F,UAAY12F,EAAE80F,SAAW,IAAM1hF,EAAMA,GAoBhDo/E,EAAEjwF,QAAU,SAAU4yF,EAAIrC,GACxB,IAAI1/E,EAAKrS,EACPf,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAgBX,YAdW,IAAPg4F,EACF/hF,EAAMmmF,EAAev5F,IAErB4yF,EAAWuC,EAAI,EAAGpE,QAEP,IAAP+B,EAAeA,EAAKqB,EAAK/C,SACxBwB,EAAWE,EAAI,EAAG,GAGvB1/E,EAAMmmF,EADNx4F,EAAI0yF,EAAS,IAAIU,EAAKn0F,GAAIm1F,EAAKn1F,EAAErF,EAAI,EAAGm4F,IAChB,EAAOqC,EAAKp0F,EAAEpG,EAAI,IAKrCqF,EAAE02F,UAAY12F,EAAE80F,SAAW,IAAM1hF,EAAMA,GAehDo/E,EAAEgH,WAAa,SAAUC,GACvB,IAAIvwF,EAAGwwF,EAAI9rC,EAAIC,EAAIlzD,EAAGuF,EAAGlB,EAAG26F,EAAIC,EAAI1F,EAAIqE,EAAG36E,EACzC5d,EAAIxG,KACJs6F,EAAK9zF,EAAEkJ,EACPirF,EAAOn0F,EAAE7C,YAEX,IAAK22F,EAAI,OAAO,IAAIK,EAAKn0F,GAUzB,GARA45F,EAAKF,EAAK,IAAIvF,EAAK,GACnBvmC,EAAK+rC,EAAK,IAAIxF,EAAK,GAInBj0F,GADAvF,GADAuO,EAAI,IAAIirF,EAAKvmC,IACPjzD,EAAIg+F,EAAa7E,GAAM9zF,EAAErF,EAAI,GA34DxB,EA64DXuO,EAAEA,EAAE,GAAK8oF,EAAQ,GAAI9xF,EAAI,EA74Dd,EA64D6BA,EAAIA,GAEhC,MAARu5F,EAGFA,EAAO9+F,EAAI,EAAIuO,EAAI0wF,MACd,CAEL,KADA56F,EAAI,IAAIm1F,EAAKsF,IACNnC,SAAWt4F,EAAE24F,GAAGiC,GAAK,MAAMj0F,MAAMisF,EAAkB5yF,GAC1Dy6F,EAAOz6F,EAAE02F,GAAGxsF,GAAMvO,EAAI,EAAIuO,EAAI0wF,EAAM56F,EAQtC,IALA0yF,GAAW,EACX1yF,EAAI,IAAIm1F,EAAK1B,EAAeqB,IAC5BI,EAAKC,EAAKhD,UACVgD,EAAKhD,UAAYx2F,EA55DN,EA45DUm5F,EAAG77F,OAAoB,EAG1CsgG,EAAIvD,EAAOh2F,EAAGkK,EAAG,EAAG,EAAG,GAEH,IADpB2kD,EAAK6rC,EAAGvqF,KAAKopF,EAAEnpF,MAAMw+C,KACd+lC,IAAI8F,IACXC,EAAK9rC,EACLA,EAAKC,EACLA,EAAK+rC,EACLA,EAAKD,EAAGxqF,KAAKopF,EAAEnpF,MAAMy+C,IACrB8rC,EAAK9rC,EACLA,EAAK3kD,EACLA,EAAIlK,EAAEwN,MAAM+rF,EAAEnpF,MAAMy+C,IACpB7uD,EAAI6uD,EAeN,OAZAA,EAAKmnC,EAAOyE,EAAKjtF,MAAMktF,GAAK9rC,EAAI,EAAG,EAAG,GACtC+rC,EAAKA,EAAGxqF,KAAK0+C,EAAGz+C,MAAMwqF,IACtBF,EAAKA,EAAGvqF,KAAK0+C,EAAGz+C,MAAMw+C,IACtB+rC,EAAGp6D,EAAIq6D,EAAGr6D,EAAIv/B,EAAEu/B,EAGhB3hB,EAAIo3E,EAAO4E,EAAIhsC,EAAIjzD,EAAG,GAAG6R,MAAMxM,GAAGwD,MAAMmwF,IAAIqB,EAAO2E,EAAID,EAAI/+F,EAAG,GAAG6R,MAAMxM,GAAGwD,OAAS,EAC7E,CAACo2F,EAAIhsC,GAAM,CAAC+rC,EAAID,GAEtBvF,EAAKhD,UAAY+C,EACjBxC,GAAW,EAEJ9zE,GAcT40E,EAAEqH,cAAgBrH,EAAEsH,MAAQ,SAAUv/D,EAAIu4D,GACxC,OAAOsG,EAAe5/F,KAAM,GAAI+gC,EAAIu4D,IAoBtCN,EAAEuH,UAAY,SAAUh5F,EAAG+xF,GACzB,IAAI9yF,EAAIxG,KACN26F,EAAOn0F,EAAE7C,YAIX,GAFA6C,EAAI,IAAIm0F,EAAKn0F,GAEJ,MAALe,EAAW,CAGb,IAAKf,EAAEkJ,EAAG,OAAOlJ,EAEjBe,EAAI,IAAIozF,EAAK,GACbrB,EAAKqB,EAAK/C,aACL,CASL,GARArwF,EAAI,IAAIozF,EAAKpzF,QACF,IAAP+xF,EACFA,EAAKqB,EAAK/C,SAEVwB,EAAWE,EAAI,EAAG,IAIf9yF,EAAEkJ,EAAG,OAAOnI,EAAEw+B,EAAIv/B,EAAIe,EAG3B,IAAKA,EAAEmI,EAEL,OADInI,EAAEw+B,IAAGx+B,EAAEw+B,EAAIv/B,EAAEu/B,GACVx+B,EAiBX,OAZIA,EAAEmI,EAAE,IACNwoF,GAAW,EACX1xF,EAAIg1F,EAAOh1F,EAAGe,EAAG,EAAG+xF,EAAI,GAAG1jF,MAAMrO,GACjC2wF,GAAW,EACX+B,EAASzzF,KAITe,EAAEw+B,EAAIv/B,EAAEu/B,EACRv/B,EAAIe,GAGCf,GASTwyF,EAAEwH,SAAW,WACX,OAAQxgG,MAcVg5F,EAAEyH,QAAU,SAAU1/D,EAAIu4D,GACxB,OAAOsG,EAAe5/F,KAAM,EAAG+gC,EAAIu4D,IA+CrCN,EAAE0H,QAAU1H,EAAErxF,IAAM,SAAUJ,GAC5B,IAAIpG,EAAGuF,EAAGg0F,EAAIt2E,EAAGk1E,EAAIvzD,EACnBv/B,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YACTg9F,IAAOp5F,EAAI,IAAIozF,EAAKpzF,IAGtB,KAAKf,EAAEkJ,GAAMnI,EAAEmI,GAAMlJ,EAAEkJ,EAAE,IAAOnI,EAAEmI,EAAE,IAAI,OAAO,IAAIirF,EAAKnC,GAAShyF,EAAGm6F,IAIpE,IAFAn6F,EAAI,IAAIm0F,EAAKn0F,IAEPi1F,GAAG,GAAI,OAAOj1F,EAKpB,GAHAk0F,EAAKC,EAAKhD,UACV2B,EAAKqB,EAAK/C,SAENrwF,EAAEk0F,GAAG,GAAI,OAAOxB,EAASzzF,EAAGk0F,EAAIpB,GAMpC,IAHAn4F,EAAIo3F,EAAUhxF,EAAEpG,EAlmEL,KAqmEFoG,EAAEmI,EAAEjR,OAAS,IAAMiI,EAAIi6F,EAAK,GAAKA,EAAKA,IApmE5B,iBAsmEjB,OADAv8E,EAAIw8E,EAAOjG,EAAMn0F,EAAGE,EAAGg0F,GAChBnzF,EAAEw+B,EAAI,EAAI,IAAI40D,EAAK,GAAGkB,IAAIz3E,GAAK61E,EAAS71E,EAAGs2E,EAAIpB,GAMxD,IAHAvzD,EAAIv/B,EAAEu/B,GAGE,EAAG,CAGT,GAAI5kC,EAAIoG,EAAEmI,EAAEjR,OAAS,EAAG,OAAO,IAAIk8F,EAAK1b,KAMxC,GAHoB,IAAN,EAAT13E,EAAEmI,EAAEvO,MAAc4kC,EAAI,GAGhB,GAAPv/B,EAAErF,GAAoB,GAAVqF,EAAEkJ,EAAE,IAAyB,GAAdlJ,EAAEkJ,EAAEjR,OAEjC,OADA+H,EAAEu/B,EAAIA,EACCv/B,EAgBX,OAPArF,EAAS,IADTuF,EAAI8xF,GAAShyF,EAAGm6F,KACD/+B,SAASl7D,GAEpB,IAAIi0F,EAAKj0F,EAAI,IAAIvF,EADjBo3F,EAAUoI,GAAM36F,KAAKiF,IAAI,KAAOguF,EAAezyF,EAAEkJ,IAAM1J,KAAKyxF,KAAOjxF,EAAErF,EAAI,KAMrEw5F,EAAK1C,KAAO,GAAK92F,EAAIw5F,EAAK3C,KAAO,EAAU,IAAI2C,EAAKx5F,EAAI,EAAI4kC,EAAI,EAAI,IAE5EmyD,GAAW,EACXyC,EAAK/C,SAAWpxF,EAAEu/B,EAAI,EAMtBr/B,EAAIV,KAAKwsB,IAAI,IAAKrxB,EAAI,IAAI1C,SAG1B2lB,EAAI46E,EAAmBz3F,EAAEqO,MAAM4oF,EAAiBh4F,EAAGk0F,EAAKh0F,IAAKg0F,IAGvDhrF,GAOA2pF,GAJJj1E,EAAI61E,EAAS71E,EAAGs2E,EAAK,EAAG,IAIEhrF,EAAGgrF,EAAIpB,KAC/Bn4F,EAAIu5F,EAAK,IAMJzB,GAHL70E,EAAI61E,EAAS+E,EAAmBz3F,EAAEqO,MAAM4oF,EAAiBh4F,EAAGrF,EAAIuF,IAAKvF,GAAIA,EAAI,EAAG,IAG1DuO,GAAG5K,MAAM41F,EAAK,EAAGA,EAAK,IAAM,GAAK,OACrDt2E,EAAI61E,EAAS71E,EAAGs2E,EAAK,EAAG,KAK9Bt2E,EAAE2hB,EAAIA,EACNmyD,GAAW,EACXyC,EAAK/C,SAAW0B,EAETW,EAAS71E,EAAGs2E,EAAIpB,KAezBN,EAAE6H,YAAc,SAAU9/D,EAAIu4D,GAC5B,IAAI1/E,EACFpT,EAAIxG,KACJ26F,EAAOn0F,EAAE7C,YAcX,YAZW,IAAPo9B,EACFnnB,EAAMmmF,EAAev5F,EAAGA,EAAErF,GAAKw5F,EAAK7C,UAAYtxF,EAAErF,GAAKw5F,EAAK5C,WAE5DqB,EAAWr4D,EAAI,EAAGw2D,QAEP,IAAP+B,EAAeA,EAAKqB,EAAK/C,SACxBwB,EAAWE,EAAI,EAAG,GAGvB1/E,EAAMmmF,EADNv5F,EAAIyzF,EAAS,IAAIU,EAAKn0F,GAAIu6B,EAAIu4D,GACNv4D,GAAMv6B,EAAErF,GAAKqF,EAAErF,GAAKw5F,EAAK7C,SAAU/2D,IAGtDv6B,EAAE02F,UAAY12F,EAAE80F,SAAW,IAAM1hF,EAAMA,GAkBhDo/E,EAAE8H,oBAAsB9H,EAAE+H,KAAO,SAAUhgE,EAAIu4D,GAC7C,IACEqB,EADM36F,KACG2D,YAYX,YAVW,IAAPo9B,GACFA,EAAK45D,EAAKhD,UACV2B,EAAKqB,EAAK/C,WAEVwB,EAAWr4D,EAAI,EAAGw2D,QAEP,IAAP+B,EAAeA,EAAKqB,EAAK/C,SACxBwB,EAAWE,EAAI,EAAG,IAGlBW,EAAS,IAAIU,EAbZ36F,MAaqB+gC,EAAIu4D,IAWnCN,EAAEvzF,SAAW,WACX,IAAIe,EAAIxG,KACN26F,EAAOn0F,EAAE7C,YACTiW,EAAMmmF,EAAev5F,EAAGA,EAAErF,GAAKw5F,EAAK7C,UAAYtxF,EAAErF,GAAKw5F,EAAK5C,UAE9D,OAAOvxF,EAAE02F,UAAY12F,EAAE80F,SAAW,IAAM1hF,EAAMA,GAQhDo/E,EAAEgI,UAAYhI,EAAEiI,MAAQ,WACtB,OAAOhH,EAAS,IAAIj6F,KAAK2D,YAAY3D,MAAOA,KAAKmB,EAAI,EAAG,IAS1D63F,EAAE/3F,QAAU+3F,EAAEkI,OAAS,WACrB,IAAI16F,EAAIxG,KACN26F,EAAOn0F,EAAE7C,YACTiW,EAAMmmF,EAAev5F,EAAGA,EAAErF,GAAKw5F,EAAK7C,UAAYtxF,EAAErF,GAAKw5F,EAAK5C,UAE9D,OAAOvxF,EAAE02F,QAAU,IAAMtjF,EAAMA,GA6NjC,IAAI4hF,EAAS,WAGX,SAAS2F,EAAgB36F,EAAGE,EAAG5D,GAC7B,IAAIoH,EACFg1F,EAAQ,EACRxgG,EAAI8H,EAAE/H,OAER,IAAK+H,EAAIA,EAAE1B,QAASpG,KAClBwL,EAAO1D,EAAE9H,GAAKgI,EAAIw4F,EAClB14F,EAAE9H,GAAKwL,EAAOpH,EAAO,EACrBo8F,EAAQh1F,EAAOpH,EAAO,EAKxB,OAFIo8F,GAAO14F,EAAE+K,QAAQ2tF,GAEd14F,EAGT,SAAS46F,EAAQ7/F,EAAGmG,EAAG25F,EAAIC,GACzB,IAAI5iG,EAAG0lB,EAEP,GAAIi9E,GAAMC,EACRl9E,EAAIi9E,EAAKC,EAAK,GAAK,OAEnB,IAAK5iG,EAAI0lB,EAAI,EAAG1lB,EAAI2iG,EAAI3iG,IACtB,GAAI6C,EAAE7C,IAAMgJ,EAAEhJ,GAAI,CAChB0lB,EAAI7iB,EAAE7C,GAAKgJ,EAAEhJ,GAAK,GAAK,EACvB,MAKN,OAAO0lB,EAGT,SAASm9E,EAAShgG,EAAGmG,EAAG25F,EAAIv+F,GAI1B,IAHA,IAAIpE,EAAI,EAGD2iG,KACL9/F,EAAE8/F,IAAO3iG,EACTA,EAAI6C,EAAE8/F,GAAM35F,EAAE25F,GAAM,EAAI,EACxB9/F,EAAE8/F,GAAM3iG,EAAIoE,EAAOvB,EAAE8/F,GAAM35F,EAAE25F,GAI/B,MAAQ9/F,EAAE,IAAMA,EAAE9C,OAAS,GAAI8C,EAAEq9F,QAGnC,OAAO,SAAUp4F,EAAGe,EAAGmzF,EAAIpB,EAAIqC,EAAI74F,GACjC,IAAIq3F,EAAKh5F,EAAGzC,EAAGgI,EAAG86F,EAASC,EAAMC,EAAMC,EAAO5C,EAAG6C,EAAIC,EAAKC,EAAMC,EAAMhhE,EAAIhX,EAAGi4E,EAAIC,EAAIC,EACnFC,EAAIC,EACJzH,EAAOn0F,EAAE7C,YACT0+F,EAAO77F,EAAEu/B,GAAKx+B,EAAEw+B,EAAI,GAAK,EACzBu0D,EAAK9zF,EAAEkJ,EACP6qF,EAAKhzF,EAAEmI,EAGT,KAAK4qF,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAII,EACRn0F,EAAEu/B,GAAMx+B,EAAEw+B,IAAMu0D,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG9CD,GAAe,GAATA,EAAG,KAAYC,EAAY,EAAP8H,EAAWA,EAAO,EAHQpjB,KAsBxD,IAhBIn8E,GACF0+F,EAAU,EACVrgG,EAAIqF,EAAErF,EAAIoG,EAAEpG,IAEZ2B,EAAO+1F,EACP2I,EA5jFO,EA6jFPrgG,EAAIo3F,EAAU/xF,EAAErF,EAAIqgG,GAAWjJ,EAAUhxF,EAAEpG,EAAIqgG,IAGjDW,EAAK5H,EAAG97F,OACRwjG,EAAK3H,EAAG77F,OAERmjG,GADA7C,EAAI,IAAIpE,EAAK0H,IACN3yF,EAAI,GAINhR,EAAI,EAAG67F,EAAG77F,KAAO47F,EAAG57F,IAAM,GAAIA,KAanC,GAXI67F,EAAG77F,IAAM47F,EAAG57F,IAAM,IAAIyC,IAEhB,MAANu5F,GACF35D,EAAK25D,EAAKC,EAAKhD,UACf2B,EAAKqB,EAAK/C,UAEV72D,EADS46D,EACJjB,GAAMl0F,EAAErF,EAAIoG,EAAEpG,GAAK,EAEnBu5F,EAGH35D,EAAK,EACP6gE,EAAGpgG,KAAK,GACRigG,GAAO,MACF,CAOL,GAJA1gE,EAAKA,EAAKygE,EAAU,EAAI,EACxB9iG,EAAI,EAGM,GAANyjG,EAAS,CAMX,IALAz7F,EAAI,EACJ6zF,EAAKA,EAAG,GACRx5D,KAGQriC,EAAIujG,GAAMv7F,IAAMq6B,IAAMriC,IAC5BqrB,EAAIrjB,EAAI5D,GAAQw3F,EAAG57F,IAAM,GACzBkjG,EAAGljG,GAAKqrB,EAAIwwE,EAAK,EACjB7zF,EAAIqjB,EAAIwwE,EAAK,EAGfkH,EAAO/6F,GAAKhI,EAAIujG,MAGX,CAiBL,KAdAv7F,EAAI5D,GAAQy3F,EAAG,GAAK,GAAK,GAEjB,IACNA,EAAK4G,EAAgB5G,EAAI7zF,EAAG5D,GAC5Bw3F,EAAK6G,EAAgB7G,EAAI5zF,EAAG5D,GAC5Bq/F,EAAK5H,EAAG97F,OACRwjG,EAAK3H,EAAG77F,QAGVujG,EAAKG,EAELL,GADAD,EAAMvH,EAAGx1F,MAAM,EAAGq9F,IACP1jG,OAGJqjG,EAAOK,GAAKN,EAAIC,KAAU,GAEjCM,EAAK7H,EAAGz1F,SACLyM,QAAQ,GACX2wF,EAAM3H,EAAG,GAELA,EAAG,IAAMz3F,EAAO,KAAKo/F,EAEzB,GACEx7F,EAAI,GAGJyzF,EAAMiH,EAAQ7G,EAAIsH,EAAKM,EAAIL,IAGjB,GAGRC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAOj/F,GAAQ++F,EAAI,IAAM,KAGhDn7F,EAAIq7F,EAAOG,EAAM,GAUT,GACFx7F,GAAK5D,IAAM4D,EAAI5D,EAAO,GAWf,IAHXq3F,EAAMiH,EALNM,EAAOP,EAAgB5G,EAAI7zF,EAAG5D,GAKV++F,EAJpBF,EAAQD,EAAKjjG,OACbqjG,EAAOD,EAAIpjG,WAOTiI,IAGA66F,EAASG,EAAMS,EAAKR,EAAQS,EAAK7H,EAAIoH,EAAO7+F,MAOrC,GAAL4D,IAAQyzF,EAAMzzF,EAAI,GACtBg7F,EAAOnH,EAAGz1F,UAGZ68F,EAAQD,EAAKjjG,QACDqjG,GAAMJ,EAAKnwF,QAAQ,GAG/BgwF,EAASM,EAAKH,EAAMI,EAAMh/F,IAGd,GAARq3F,IAIFA,EAAMiH,EAAQ7G,EAAIsH,EAAKM,EAHvBL,EAAOD,EAAIpjG,SAMD,IACRiI,IAGA66F,EAASM,EAAKM,EAAKL,EAAOM,EAAK7H,EAAIuH,EAAMh/F,IAI7Cg/F,EAAOD,EAAIpjG,QACM,IAAR07F,IACTzzF,IACAm7F,EAAM,CAAC,IAITD,EAAGljG,KAAOgI,EAGNyzF,GAAO0H,EAAI,GACbA,EAAIC,KAAUxH,EAAG0H,IAAO,GAExBH,EAAM,CAACvH,EAAG0H,IACVF,EAAO,UAGDE,IAAOC,QAAiB,IAAXJ,EAAI,KAAkB9gE,KAE7C0gE,OAAkB,IAAXI,EAAI,GAIRD,EAAG,IAAIA,EAAGhD,QAIjB,GAAe,GAAX4C,EACFzC,EAAE59F,EAAIA,EACNi2F,EAAUqK,MACL,CAGL,IAAK/iG,EAAI,EAAGgI,EAAIk7F,EAAG,GAAIl7F,GAAK,GAAIA,GAAK,GAAIhI,IACzCqgG,EAAE59F,EAAIzC,EAAIyC,EAAIqgG,EAAU,EAExBvH,EAAS8E,EAAGpD,EAAKjB,EAAKqE,EAAE59F,EAAI,EAAIu5F,EAAIpB,EAAImI,GAG1C,OAAO1C,GAnQE,GA4QZ,SAAS9E,EAASzzF,EAAGu6B,EAAIu4D,EAAIgJ,GAC5B,IAAIn5F,EAAQzK,EAAG8I,EAAGd,EAAG+yF,EAAI8I,EAAS7xC,EAAG4pC,EAAIkI,EACvC7H,EAAOn0F,EAAE7C,YAGXk/E,EAAK,GAAU,MAAN9hD,EAAY,CAInB,KAHAu5D,EAAK9zF,EAAEkJ,GAGE,OAAOlJ,EAWhB,IAAK2C,EAAS,EAAGzC,EAAI4zF,EAAG,GAAI5zF,GAAK,GAAIA,GAAK,GAAIyC,IAI9C,IAHAzK,EAAIqiC,EAAK53B,GAGD,EACNzK,GAxxFO,EAyxFP8I,EAAIu5B,EAIJ04D,GAHA/oC,EAAI4pC,EAAGkI,EAAM,IAGJhK,EAAQ,GAAIrvF,EAAS3B,EAAI,GAAK,GAAK,OAI5C,IAFAg7F,EAAMx8F,KAAKwwB,MAAM93B,EAAI,GA/xFd,MAgyFPgI,EAAI4zF,EAAG77F,QACO,CACZ,IAAI6jG,EASF,MAAMzf,EANN,KAAOn8E,KAAO87F,GAAMlI,EAAG94F,KAAK,GAC5BkvD,EAAI+oC,EAAK,EACTtwF,EAAS,EAET3B,GADA9I,GAxyFG,KAyyFgB,MAIhB,CAIL,IAHAgyD,EAAIhqD,EAAI4zF,EAAGkI,GAGNr5F,EAAS,EAAGzC,GAAK,GAAIA,GAAK,GAAIyC,IAUnCswF,GAHAjyF,GAJA9I,GApzFK,KAwzFcyK,GAGV,EAAI,EAAIunD,EAAI8nC,EAAQ,GAAIrvF,EAAS3B,EAAI,GAAK,GAAK,EAoB5D,GAfA86F,EAAcA,GAAevhE,EAAK,QAChB,IAAhBu5D,EAAGkI,EAAM,KAAkBh7F,EAAI,EAAIkpD,EAAIA,EAAI8nC,EAAQ,GAAIrvF,EAAS3B,EAAI,IAMtE+6F,EAAUjJ,EAAK,GACVG,GAAM6I,KAAuB,GAANhJ,GAAWA,IAAO9yF,EAAEu/B,EAAI,EAAI,EAAI,IACxD0zD,EAAK,GAAW,GAANA,IAAkB,GAANH,GAAWgJ,GAAqB,GAANhJ,IAG9C56F,EAAI,EAAI8I,EAAI,EAAIkpD,EAAI8nC,EAAQ,GAAIrvF,EAAS3B,GAAK,EAAI8yF,EAAGkI,EAAM,IAAM,GAAM,GACvElJ,IAAO9yF,EAAEu/B,EAAI,EAAI,EAAI,IAEvBhF,EAAK,IAAMu5D,EAAG,GAgBhB,OAfAA,EAAG77F,OAAS,EACR8jG,GAGFxhE,GAAMv6B,EAAErF,EAAI,EAGZm5F,EAAG,GAAK9B,EAAQ,IAv1FX,EAu1F2Bz3D,EAv1F3B,MAw1FLv6B,EAAErF,GAAK4/B,GAAM,GAIbu5D,EAAG,GAAK9zF,EAAErF,EAAI,EAGTqF,EAiBT,GAbS,GAAL9H,GACF47F,EAAG77F,OAAS+jG,EACZ97F,EAAI,EACJ87F,MAEAlI,EAAG77F,OAAS+jG,EAAM,EAClB97F,EAAI8xF,EAAQ,GAz2FL,EAy2FoB95F,GAI3B47F,EAAGkI,GAAOh7F,EAAI,GAAKkpD,EAAI8nC,EAAQ,GAAIrvF,EAAS3B,GAAKgxF,EAAQ,GAAIhxF,GAAK,GAAKd,EAAI,GAGzE67F,EACF,OAAS,CAGP,GAAW,GAAPC,EAAU,CAGZ,IAAK9jG,EAAI,EAAG8I,EAAI8yF,EAAG,GAAI9yF,GAAK,GAAIA,GAAK,GAAI9I,IAEzC,IADA8I,EAAI8yF,EAAG,IAAM5zF,EACRA,EAAI,EAAGc,GAAK,GAAIA,GAAK,GAAId,IAG1BhI,GAAKgI,IACPF,EAAErF,IACEm5F,EAAG,IAAMzB,IAAMyB,EAAG,GAAK,IAG7B,MAGA,GADAA,EAAGkI,IAAQ97F,EACP4zF,EAAGkI,IAAQ3J,EAAM,MACrByB,EAAGkI,KAAS,EACZ97F,EAAI,EAMV,IAAKhI,EAAI47F,EAAG77F,OAAoB,IAAZ67F,IAAK57F,IAAW47F,EAAG9gC,MAsBzC,OAnBI0+B,IAGE1xF,EAAErF,EAAIw5F,EAAK1C,MAGbzxF,EAAEkJ,EAAI,KACNlJ,EAAErF,EAAI89E,KAGGz4E,EAAErF,EAAIw5F,EAAK3C,OAGpBxxF,EAAErF,EAAI,EACNqF,EAAEkJ,EAAI,CAAC,KAKJlJ,EAIT,SAASu5F,EAAev5F,EAAGi8F,EAAO1hE,GAChC,IAAKv6B,EAAEo7D,WAAY,OAAO8gC,EAAkBl8F,GAC5C,IAAIE,EACFvF,EAAIqF,EAAErF,EACNyY,EAAMq/E,EAAezyF,EAAEkJ,GACvBlR,EAAMob,EAAInb,OAwBZ,OAtBIgkG,GACE1hE,IAAOr6B,EAAIq6B,EAAKviC,GAAO,EACzBob,EAAMA,EAAImgF,OAAO,GAAK,IAAMngF,EAAI9U,MAAM,GAAKq0F,EAAczyF,GAChDlI,EAAM,IACfob,EAAMA,EAAImgF,OAAO,GAAK,IAAMngF,EAAI9U,MAAM,IAGxC8U,EAAMA,GAAOpT,EAAErF,EAAI,EAAI,IAAM,MAAQqF,EAAErF,GAC9BA,EAAI,GACbyY,EAAM,KAAOu/E,GAAeh4F,EAAI,GAAKyY,EACjCmnB,IAAOr6B,EAAIq6B,EAAKviC,GAAO,IAAGob,GAAOu/E,EAAczyF,KAC1CvF,GAAK3C,GACdob,GAAOu/E,EAAch4F,EAAI,EAAI3C,GACzBuiC,IAAOr6B,EAAIq6B,EAAK5/B,EAAI,GAAK,IAAGyY,EAAMA,EAAM,IAAMu/E,EAAczyF,OAE3DA,EAAIvF,EAAI,GAAK3C,IAAKob,EAAMA,EAAI9U,MAAM,EAAG4B,GAAK,IAAMkT,EAAI9U,MAAM4B,IAC3Dq6B,IAAOr6B,EAAIq6B,EAAKviC,GAAO,IACrB2C,EAAI,IAAM3C,IAAKob,GAAO,KAC1BA,GAAOu/E,EAAczyF,KAIlBkT,EAKT,SAASilF,EAAkB11F,EAAQhI,GACjC,IAAIuvD,EAAIvnD,EAAO,GAGf,IAAMhI,GA58FK,EA48FUuvD,GAAK,GAAIA,GAAK,GAAIvvD,IACvC,OAAOA,EAIT,SAASs9F,EAAQ9D,EAAM55D,EAAI25D,GACzB,GAAI35D,EAAK+3D,EAKP,MAFAZ,GAAW,EACPwC,IAAIC,EAAKhD,UAAY+C,GACnBvuF,MAAMksF,GAEd,OAAO4B,EAAS,IAAIU,EAAKlD,GAAO12D,EAAI,GAAG,GAIzC,SAASo8D,EAAMxC,EAAM55D,EAAIu4D,GACvB,GAAIv4D,EAAKg4D,EAAc,MAAM5sF,MAAMksF,GACnC,OAAO4B,EAAS,IAAIU,EAAKrmF,GAAKysB,EAAIu4D,GAAI,GAIxC,SAAS6F,EAAah2F,GACpB,IAAIunD,EAAIvnD,EAAO1K,OAAS,EACtBD,EAr+FS,EAq+FHkyD,EAAe,EAKvB,GAHAA,EAAIvnD,EAAOunD,GAGJ,CAGL,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIlyD,IAG7B,IAAKkyD,EAAIvnD,EAAO,GAAIunD,GAAK,GAAIA,GAAK,GAAIlyD,IAGxC,OAAOA,EAIT,SAAS26F,EAAczyF,GAErB,IADA,IAAIi8F,EAAK,GACFj8F,KAAMi8F,GAAM,IACnB,OAAOA,EAWT,SAAS/B,EAAOjG,EAAMn0F,EAAGhB,EAAGk1F,GAC1B,IAAI4H,EACFl+E,EAAI,IAAIu2E,EAAK,GAIbj0F,EAAIV,KAAKwwB,KAAKkkE,EA3gGL,EA2gGqB,GAIhC,IAFAxC,GAAW,IAEF,CAOP,GANI1yF,EAAI,GAEFo9F,GADJx+E,EAAIA,EAAExO,MAAMpP,IACGkJ,EAAGhJ,KAAI47F,GAAc,GAI5B,KADV98F,EAAI+yF,EAAU/yF,EAAI,IACL,CAGXA,EAAI4e,EAAE1U,EAAEjR,OAAS,EACb6jG,GAA0B,IAAXl+E,EAAE1U,EAAElK,MAAY4e,EAAE1U,EAAElK,GACvC,MAIFo9F,GADAp8F,EAAIA,EAAEoP,MAAMpP,IACDkJ,EAAGhJ,GAKhB,OAFAwxF,GAAW,EAEJ9zE,EAIT,SAASy+E,EAAMr9F,GACb,OAA6B,EAAtBA,EAAEkK,EAAElK,EAAEkK,EAAEjR,OAAS,GAO1B,SAASqkG,EAASnI,EAAM16F,EAAM8iG,GAK5B,IAJA,IAAIx7F,EACFf,EAAI,IAAIm0F,EAAK16F,EAAK,IAClBvB,EAAI,IAEGA,EAAIuB,EAAKxB,QAAS,CAEzB,KADA8I,EAAI,IAAIozF,EAAK16F,EAAKvB,KACXqnC,EAAG,CACRv/B,EAAIe,EACJ,MACSf,EAAEu8F,GAAMx7F,KACjBf,EAAIe,GAIR,OAAOf,EAmCT,SAASw4F,EAAmBx4F,EAAGu6B,GAC7B,IAAIh3B,EAAai5F,EAAOx7F,EAAGG,EAAKP,EAAK2iB,EAAG0zE,EACtCtC,EAAM,EACNz8F,EAAI,EACJgI,EAAI,EACJi0F,EAAOn0F,EAAE7C,YACT21F,EAAKqB,EAAK/C,SACV8C,EAAKC,EAAKhD,UAGZ,IAAKnxF,EAAEkJ,IAAMlJ,EAAEkJ,EAAE,IAAMlJ,EAAErF,EAAI,GAE3B,OAAO,IAAIw5F,EAAKn0F,EAAEkJ,EACblJ,EAAEkJ,EAAE,GAASlJ,EAAEu/B,EAAI,EAAI,EAAI,IAAlB,EACVv/B,EAAEu/B,EAAIv/B,EAAEu/B,EAAI,EAAI,EAAIv/B,EAAI,KAa9B,IAVU,MAANu6B,GACFm3D,GAAW,EACXuF,EAAM/C,GAEN+C,EAAM18D,EAGRhX,EAAI,IAAI4wE,EAAK,QAGNn0F,EAAErF,GAAK,GAGZqF,EAAIA,EAAEoP,MAAMmU,GACZrjB,GAAK,EAUP,IAJA+2F,GADAuF,EAAQh9F,KAAKiF,IAAIutF,EAAQ,EAAG9xF,IAAMV,KAAKyxF,KAAO,EAAI,EAAI,EAEtD1tF,EAAcpC,EAAMP,EAAM,IAAIuzF,EAAK,GACnCA,EAAKhD,UAAY8F,IAER,CAKP,GAJA91F,EAAMsyF,EAAStyF,EAAIiO,MAAMpP,GAAIi3F,EAAK,GAClC1zF,EAAcA,EAAY6L,QAAQlX,GAG9Bu6F,GAFJlvE,EAAI3iB,EAAIuO,KAAK6lF,EAAO7zF,EAAKoC,EAAa0zF,EAAK,KAEtB/tF,GAAG5K,MAAM,EAAG24F,KAASxE,EAAe7xF,EAAIsI,GAAG5K,MAAM,EAAG24F,GAAM,CAE7E,IADAj2F,EAAId,EACGc,KAAKJ,EAAM6yF,EAAS7yF,EAAIwO,MAAMxO,GAAMq2F,EAAK,GAOhD,GAAU,MAAN18D,EAYF,OADA45D,EAAKhD,UAAY+C,EACVtzF,EAVP,KAAI+zF,EAAM,GAAK9B,EAAoBjyF,EAAIsI,EAAG+tF,EAAMuF,EAAO1J,EAAI6B,IAMzD,OAAOlB,EAAS7yF,EAAKuzF,EAAKhD,UAAY+C,EAAIpB,EAAIpB,GAAW,GALzDyC,EAAKhD,UAAY8F,GAAO,GACxB1zF,EAAcpC,EAAMoiB,EAAI,IAAI4wE,EAAK,GACjCj8F,EAAI,EACJy8F,IAUN/zF,EAAM2iB,GAoBV,SAASy0E,EAAiBj3F,EAAGw5B,GAC3B,IAAIr0B,EAAGu2F,EAAIl5F,EAAa5I,EAAG2I,EAAWqxF,EAAK/zF,EAAK2iB,EAAG0zE,EAAKhrC,EAAIE,EAC1DntD,EAAI,EAEJgB,EAAIe,EACJ+yF,EAAK9zF,EAAEkJ,EACPirF,EAAOn0F,EAAE7C,YACT21F,EAAKqB,EAAK/C,SACV8C,EAAKC,EAAKhD,UAGZ,GAAInxF,EAAEu/B,EAAI,IAAMu0D,IAAOA,EAAG,KAAO9zF,EAAErF,GAAc,GAATm5F,EAAG,IAAwB,GAAbA,EAAG77F,OACvD,OAAO,IAAIk8F,EAAKL,IAAOA,EAAG,IAAK,IAAgB,GAAP9zF,EAAEu/B,EAASk5C,IAAMqb,EAAK,EAAI9zF,GAcpE,GAXU,MAANu6B,GACFm3D,GAAW,EACXuF,EAAM/C,GAEN+C,EAAM18D,EAGR45D,EAAKhD,UAAY8F,GAnBP,GAqBVwF,GADAv2F,EAAIusF,EAAeqB,IACZP,OAAO,KAEV/zF,KAAKgE,IAAI7I,EAAIqF,EAAErF,GAAK,OAqCtB,OAJA4oB,EAAI00E,EAAQ9D,EAAM8C,EAAM,EAAG/C,GAAI9kF,MAAMzU,EAAI,IACzCqF,EAAIg4F,EAAiB,IAAI7D,EAAKsI,EAAK,IAAMv2F,EAAE5H,MAAM,IAAK24F,EAzD9C,IAyD2D9nF,KAAKoU,GACxE4wE,EAAKhD,UAAY+C,EAEJ,MAAN35D,EAAak5D,EAASzzF,EAAGk0F,EAAIpB,EAAIpB,GAAW,GAAQ1xF,EAxB3D,KAAOy8F,EAAK,GAAW,GAANA,GAAiB,GAANA,GAAWv2F,EAAEqtF,OAAO,GAAK,GAGnDkJ,GADAv2F,EAAIusF,GADJzyF,EAAIA,EAAEoP,MAAMrO,IACSmI,IACdqqF,OAAO,GACdv0F,IAiCJ,IA9BErE,EAAIqF,EAAErF,EAEF8hG,EAAK,GACPz8F,EAAI,IAAIm0F,EAAK,KAAOjuF,GACpBvL,KAEAqF,EAAI,IAAIm0F,EAAKsI,EAAK,IAAMv2F,EAAE5H,MAAM,IAepC2tD,EAAKjsD,EAKLY,EAAM0C,EAAYtD,EAAIg1F,EAAOh1F,EAAEwM,MAAM,GAAIxM,EAAEmP,KAAK,GAAI8nF,EAAK,GACzD9qC,EAAKsnC,EAASzzF,EAAEoP,MAAMpP,GAAIi3F,EAAK,GAC/B1zF,EAAc,IAEL,CAIP,GAHAD,EAAYmwF,EAASnwF,EAAU8L,MAAM+8C,GAAK8qC,EAAK,GAG3CxE,GAFJlvE,EAAI3iB,EAAIuO,KAAK6lF,EAAO1xF,EAAW,IAAI6wF,EAAK5wF,GAAc0zF,EAAK,KAEtC/tF,GAAG5K,MAAM,EAAG24F,KAASxE,EAAe7xF,EAAIsI,GAAG5K,MAAM,EAAG24F,GAAM,CAc7E,GAbAr2F,EAAMA,EAAIwO,MAAM,GAIN,IAANzU,IAASiG,EAAMA,EAAIuO,KAAK8oF,EAAQ9D,EAAM8C,EAAM,EAAG/C,GAAI9kF,MAAMzU,EAAI,MACjEiG,EAAMo0F,EAAOp0F,EAAK,IAAIuzF,EAAKn1F,GAAIi4F,EAAK,GAQ1B,MAAN18D,EAWF,OADA45D,EAAKhD,UAAY+C,EACVtzF,EAVP,IAAIiyF,EAAoBjyF,EAAIsI,EAAG+tF,EA5F3B,GA4FwCnE,EAAI6B,GAM9C,OAAOlB,EAAS7yF,EAAKuzF,EAAKhD,UAAY+C,EAAIpB,EAAIpB,GAAW,GALzDyC,EAAKhD,UAAY8F,GA7Ff,GA8FF1zE,EAAIjgB,EAAYtD,EAAIg1F,EAAO/oC,EAAGz/C,MAAM,GAAIy/C,EAAG98C,KAAK,GAAI8nF,EAAK,GACzD9qC,EAAKsnC,EAASzzF,EAAEoP,MAAMpP,GAAIi3F,EAAK,GAC/B1zF,EAAcoxF,EAAM,EAU1B/zF,EAAM2iB,EACNhgB,GAAe,GAMnB,SAAS24F,EAAkBl8F,GAEzB,OAAOgE,OAAOhE,EAAEu/B,EAAIv/B,EAAEu/B,EAAI,GAO5B,SAASm9D,EAAa18F,EAAGoT,GACvB,IAAIzY,EAAGzC,EAAGF,EAmBV,KAhBK2C,EAAIyY,EAAItR,QAAQ,OAAS,IAAGsR,EAAMA,EAAIiM,QAAQ,IAAK,MAGnDnnB,EAAIkb,EAAIupF,OAAO,OAAS,GAGvBhiG,EAAI,IAAGA,EAAIzC,GACfyC,IAAMyY,EAAI9U,MAAMpG,EAAI,GACpBkb,EAAMA,EAAIq4B,UAAU,EAAGvzC,IACdyC,EAAI,IAGbA,EAAIyY,EAAInb,QAILC,EAAI,EAAyB,KAAtBkb,EAAIwpF,WAAW1kG,GAAWA,KAGtC,IAAKF,EAAMob,EAAInb,OAAoC,KAA5Bmb,EAAIwpF,WAAW5kG,EAAM,KAAaA,GAGzD,GAFAob,EAAMA,EAAI9U,MAAMpG,EAAGF,GAEV,CAYP,GAXAA,GAAOE,EACP8H,EAAErF,EAAIA,EAAIA,EAAIzC,EAAI,EAClB8H,EAAEkJ,EAAI,GAMNhR,GAAKyC,EAAI,GA71GA,EA81GLA,EAAI,IAAGzC,GA91GF,GAg2GLA,EAAIF,EAAK,CAEX,IADIE,GAAG8H,EAAEkJ,EAAElO,MAAMoY,EAAI9U,MAAM,EAAGpG,IACzBF,GAl2GE,EAk2GeE,EAAIF,GAAMgI,EAAEkJ,EAAElO,MAAMoY,EAAI9U,MAAMpG,EAAGA,GAl2GhD,IAo2GPA,EAp2GO,GAm2GPkb,EAAMA,EAAI9U,MAAMpG,IACGD,YAEnBC,GAAKF,EAGP,KAAOE,KAAMkb,GAAO,IACpBpT,EAAEkJ,EAAElO,MAAMoY,GAENs+E,IAGE1xF,EAAErF,EAAIqF,EAAE7C,YAAYs0F,MAGtBzxF,EAAEkJ,EAAI,KACNlJ,EAAErF,EAAI89E,KAGGz4E,EAAErF,EAAIqF,EAAE7C,YAAYq0F,OAG7BxxF,EAAErF,EAAI,EACNqF,EAAEkJ,EAAI,CAAC,UAOXlJ,EAAErF,EAAI,EACNqF,EAAEkJ,EAAI,CAAC,GAGT,OAAOlJ,EAOT,SAAS68F,EAAW78F,EAAGoT,GACrB,IAAI9W,EAAM63F,EAAM2I,EAAS5kG,EAAG6kG,EAAS/kG,EAAKsF,EAAGw2F,EAAIroB,EAEjD,GAAY,aAARr4D,GAA8B,QAARA,EAIxB,OAHMA,IAAKpT,EAAEu/B,EAAIk5C,KACjBz4E,EAAErF,EAAI89E,IACNz4E,EAAEkJ,EAAI,KACClJ,EAGT,GAAIkyF,EAAM/yF,KAAKiU,GACb9W,EAAO,GACP8W,EAAMA,EAAIq+D,mBACL,GAAIwgB,EAAS9yF,KAAKiU,GACvB9W,EAAO,MACF,KAAI61F,EAAQhzF,KAAKiU,GAGtB,MAAMzN,MAAMisF,EAAkBx+E,GAF9B9W,EAAO,EAkCT,KA5BApE,EAAIkb,EAAIupF,OAAO,OAEP,GACNr/F,GAAK8V,EAAI9U,MAAMpG,EAAI,GACnBkb,EAAMA,EAAIq4B,UAAU,EAAGvzC,IAEvBkb,EAAMA,EAAI9U,MAAM,GAMlBy+F,GADA7kG,EAAIkb,EAAItR,QAAQ,OACD,EACfqyF,EAAOn0F,EAAE7C,YAEL4/F,IAGF7kG,GADAF,GADAob,EAAMA,EAAIiM,QAAQ,IAAK,KACbpnB,QACAC,EAGV4kG,EAAU1C,EAAOjG,EAAM,IAAIA,EAAK73F,GAAOpE,EAAO,EAAJA,IAOvCA,EAHLuzE,GADAqoB,EAAKZ,EAAY9/E,EAAK9W,EAAM+1F,IACpBp6F,OAAS,EAGM,IAAV67F,EAAG57F,KAAYA,EAAG47F,EAAG9gC,MAClC,OAAI96D,EAAI,EAAU,IAAIi8F,EAAW,EAANn0F,EAAEu/B,IAC7Bv/B,EAAErF,EAAI09F,EAAkBvE,EAAIroB,GAC5BzrE,EAAEkJ,EAAI4qF,EACNpC,GAAW,EAQPqL,IAAS/8F,EAAIg1F,EAAOh1F,EAAG88F,EAAe,EAAN9kG,IAGhCsF,IAAG0C,EAAIA,EAAEoP,MAAM5P,KAAKgE,IAAIlG,GAAK,GAAK00F,EAAQ,EAAG10F,GAAKqzF,EAAQxvF,IAAI,EAAG7D,KACrEo0F,GAAW,EAEJ1xF,GAyCT,SAASq0F,EAAaF,EAAMn1F,EAAGgB,EAAGe,EAAGi8F,GACnC,IAAIh8F,EAAGuiB,EAAG2+C,EAAG/V,EAEX+nC,EAAKC,EAAKhD,UACVjxF,EAAIV,KAAKwwB,KAAKkkE,EA7/GL,GAmgHX,IAJAxC,GAAW,EACXvlC,EAAKnsD,EAAEoP,MAAMpP,GACbkiE,EAAI,IAAIiyB,EAAKpzF,KAEJ,CAMP,GALAwiB,EAAIyxE,EAAO9yB,EAAE9yD,MAAM+8C,GAAK,IAAIgoC,EAAKn1F,IAAMA,KAAMk1F,EAAI,GACjDhyB,EAAI86B,EAAej8F,EAAEoO,KAAKoU,GAAKxiB,EAAEyL,MAAM+W,GACvCxiB,EAAIi0F,EAAOzxE,EAAEnU,MAAM+8C,GAAK,IAAIgoC,EAAKn1F,IAAMA,KAAMk1F,EAAI,QAGlC,KAFf3wE,EAAI2+C,EAAE/yD,KAAKpO,IAELmI,EAAEhJ,GAAe,CACrB,IAAKc,EAAId,EAAGqjB,EAAEra,EAAElI,KAAOkhE,EAAEh5D,EAAElI,IAAMA,MACjC,IAAU,GAANA,EAAS,MAGfA,EAAIkhE,EACJA,EAAInhE,EACJA,EAAIwiB,EACJA,EAAIviB,EAON,OAHA0wF,GAAW,EACXnuE,EAAEra,EAAEjR,OAASiI,EAAI,EAEVqjB,EAKT,SAAS6wE,EAAQlzF,EAAGvG,GAElB,IADA,IAAIqE,EAAIkC,IACCvG,GAAGqE,GAAKkC,EACjB,OAAOlC,EAKT,SAASu1F,EAAiBJ,EAAMn0F,GAC9B,IAAIujB,EACFmzE,EAAQ12F,EAAEu/B,EAAI,EACd09D,EAAKtG,EAAMxC,EAAMA,EAAKhD,UAAW,GACjCsF,EAASwG,EAAG7tF,MAAM,IAIpB,IAFApP,EAAIA,EAAEwD,OAEAqzF,IAAIJ,GAER,OADA5F,EAAW6F,EAAQ,EAAI,EAChB12F,EAKT,IAFAujB,EAAIvjB,EAAEu1F,SAAS0H,IAETnI,SACJjE,EAAW6F,EAAQ,EAAI,MAClB,CAIL,IAHA12F,EAAIA,EAAEwM,MAAM+W,EAAEnU,MAAM6tF,KAGdpG,IAAIJ,GAER,OADA5F,EAAWwL,EAAM94E,GAAMmzE,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAC9C12F,EAGT6wF,EAAWwL,EAAM94E,GAAMmzE,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAGvD,OAAO12F,EAAEwM,MAAMywF,GAAIz5F,MASrB,SAAS41F,EAAep5F,EAAGozF,EAAS74D,EAAIu4D,GACtC,IAAIx2F,EAAM3B,EAAGzC,EAAGgI,EAAGlI,EAAK+jG,EAAS3oF,EAAK0gF,EAAI/yF,EACxCozF,EAAOn0F,EAAE7C,YACT8+F,OAAe,IAAP1hE,EAWV,GATI0hE,GACFrJ,EAAWr4D,EAAI,EAAGw2D,QACP,IAAP+B,EAAeA,EAAKqB,EAAK/C,SACxBwB,EAAWE,EAAI,EAAG,KAEvBv4D,EAAK45D,EAAKhD,UACV2B,EAAKqB,EAAK/C,UAGPpxF,EAAEo7D,WAEA,CAoCL,IA3BI6gC,GACF3/F,EAAO,EACQ,IAAX82F,EACF74D,EAAU,EAALA,EAAS,EACM,GAAX64D,IACT74D,EAAU,EAALA,EAAS,IAGhBj+B,EAAO82F,GAfTl7F,GADAkb,EAAMmmF,EAAev5F,IACb8B,QAAQ,OAsBP,IACPsR,EAAMA,EAAIiM,QAAQ,IAAK,KACvBte,EAAI,IAAIozF,EAAK,IACXx5F,EAAIyY,EAAInb,OAASC,EACnB6I,EAAEmI,EAAIgqF,EAAYqG,EAAex4F,GAAI,GAAIzE,GACzCyE,EAAEpG,EAAIoG,EAAEmI,EAAEjR,QAIZ0C,EAAI3C,GADJ87F,EAAKZ,EAAY9/E,EAAK,GAAI9W,IACbrE,OAGO,GAAb67F,IAAK97F,IAAY87F,EAAG9gC,MAE3B,GAAK8gC,EAAG,GAED,CAyBL,GAxBI57F,EAAI,EACNyC,MAEAqF,EAAI,IAAIm0F,EAAKn0F,IACXkJ,EAAI4qF,EACN9zF,EAAErF,EAAIA,EAENm5F,GADA9zF,EAAIg1F,EAAOh1F,EAAGe,EAAGw5B,EAAIu4D,EAAI,EAAGx2F,IACrB4M,EACPvO,EAAIqF,EAAErF,EACNohG,EAAUnL,GAIZ14F,EAAI47F,EAAGv5D,GACPr6B,EAAI5D,EAAO,EACXy/F,EAAUA,QAA0B,IAAfjI,EAAGv5D,EAAK,GAE7BwhE,EAAUjJ,EAAK,QACJ,IAAN56F,GAAgB6jG,KAAoB,IAAPjJ,GAAYA,KAAQ9yF,EAAEu/B,EAAI,EAAI,EAAI,IAChErnC,EAAIgI,GAAKhI,IAAMgI,IAAa,IAAP4yF,GAAYiJ,GAAkB,IAAPjJ,GAAyB,EAAbgB,EAAGv5D,EAAK,IAChEu4D,KAAQ9yF,EAAEu/B,EAAI,EAAI,EAAI,IAE1Bu0D,EAAG77F,OAASsiC,EAERwhE,EAGF,OAASjI,IAAKv5D,GAAMj+B,EAAO,GACzBw3F,EAAGv5D,GAAM,EACJA,MACD5/B,EACFm5F,EAAG/oF,QAAQ,IAMjB,IAAK/S,EAAM87F,EAAG77F,QAAS67F,EAAG97F,EAAM,KAAMA,GAGtC,IAAKE,EAAI,EAAGkb,EAAM,GAAIlb,EAAIF,EAAKE,IAAKkb,GAAO49E,EAASuC,OAAOO,EAAG57F,IAG9D,GAAI+jG,EAAO,CACT,GAAIjkG,EAAM,EACR,GAAe,IAAXo7F,GAA4B,GAAXA,EAAc,CAEjC,IADAl7F,EAAe,IAAXk7F,EAAgB,EAAI,IACjBp7F,EAAKA,EAAME,EAAGF,IAAOob,GAAO,IAEnC,IAAKpb,GADL87F,EAAKZ,EAAY9/E,EAAK9W,EAAM82F,IACdn7F,QAAS67F,EAAG97F,EAAM,KAAMA,GAGtC,IAAKE,EAAI,EAAGkb,EAAM,KAAMlb,EAAIF,EAAKE,IAAKkb,GAAO49E,EAASuC,OAAOO,EAAG57F,SAEhEkb,EAAMA,EAAImgF,OAAO,GAAK,IAAMngF,EAAI9U,MAAM,GAI1C8U,EAAOA,GAAOzY,EAAI,EAAI,IAAM,MAAQA,OAC/B,GAAIA,EAAI,EAAG,CAChB,OAASA,GAAIyY,EAAM,IAAMA,EACzBA,EAAM,KAAOA,OAEb,KAAMzY,EAAI3C,EAAK,IAAK2C,GAAK3C,EAAK2C,KAAOyY,GAAO,SACnCzY,EAAI3C,IAAKob,EAAMA,EAAI9U,MAAM,EAAG3D,GAAK,IAAMyY,EAAI9U,MAAM3D,SAlE5DyY,EAAM6oF,EAAQ,OAAS,IAsEzB7oF,GAAkB,IAAXggF,EAAgB,KAAkB,GAAXA,EAAe,KAAkB,GAAXA,EAAe,KAAO,IAAMhgF,OA9GhFA,EAAM8oF,EAAkBl8F,GAiH1B,OAAOA,EAAEu/B,EAAI,EAAI,IAAMnsB,EAAMA,EAK/B,SAASgpF,EAASrkG,EAAKC,GACrB,GAAID,EAAIE,OAASD,EAEf,OADAD,EAAIE,OAASD,GACN,EAyDX,SAASwL,GAAIxD,GACX,OAAO,IAAIxG,KAAKwG,GAAGwD,MAUrB,SAASu0E,GAAK/3E,GACZ,OAAO,IAAIxG,KAAKwG,GAAG+3E,OAWrB,SAASO,GAAMt4E,GACb,OAAO,IAAIxG,KAAKwG,GAAGs4E,QAYrB,SAASvyE,GAAI/F,EAAGe,GACd,OAAO,IAAIvH,KAAKwG,GAAGmP,KAAKpO,GAW1B,SAASi3E,GAAKh4E,GACZ,OAAO,IAAIxG,KAAKwG,GAAGg4E,OAWrB,SAASK,GAAMr4E,GACb,OAAO,IAAIxG,KAAKwG,GAAGq4E,QAWrB,SAASP,GAAK93E,GACZ,OAAO,IAAIxG,KAAKwG,GAAG83E,OAWrB,SAASM,GAAMp4E,GACb,OAAO,IAAIxG,KAAKwG,GAAGo4E,QA6BrB,SAASr5B,GAAMh+C,EAAGf,GAChBe,EAAI,IAAIvH,KAAKuH,GACbf,EAAI,IAAIxG,KAAKwG,GACb,IAAI4d,EACFs2E,EAAK16F,KAAK23F,UACV2B,EAAKt5F,KAAK43F,SACV6F,EAAM/C,EAAK,EAkCb,OA/BKnzF,EAAEw+B,GAAMv/B,EAAEu/B,EAIHx+B,EAAEmI,GAAMlJ,EAAEkJ,GAKVlJ,EAAEkJ,GAAKnI,EAAE+zF,UACnBl3E,EAAI5d,EAAEu/B,EAAI,EAAIo3D,EAAMn9F,KAAM06F,EAAIpB,GAAM,IAAIt5F,KAAK,IAC3C+lC,EAAIx+B,EAAEw+B,GAGEx+B,EAAEmI,GAAKlJ,EAAE80F,UACnBl3E,EAAI+4E,EAAMn9F,KAAMy9F,EAAK,GAAG7nF,MAAM,KAC5BmwB,EAAIx+B,EAAEw+B,EAGCv/B,EAAEu/B,EAAI,GACf/lC,KAAK23F,UAAY8F,EACjBz9F,KAAK43F,SAAW,EAChBxzE,EAAIpkB,KAAKs+E,KAAKkd,EAAOj0F,EAAGf,EAAGi3F,EAAK,IAChCj3F,EAAI22F,EAAMn9F,KAAMy9F,EAAK,GACrBz9F,KAAK23F,UAAY+C,EACjB16F,KAAK43F,SAAW0B,EAChBl1E,EAAI7c,EAAEw+B,EAAI,EAAI3hB,EAAEpR,MAAMxM,GAAK4d,EAAEzO,KAAKnP,IAElC4d,EAAIpkB,KAAKs+E,KAAKkd,EAAOj0F,EAAGf,EAAGi3F,EAAK,KAvBhCr5E,EAAI+4E,EAAMn9F,KAAMy9F,EAAK,GAAG7nF,MAAMpP,EAAEu/B,EAAI,EAAI,IAAO,MAC7CA,EAAIx+B,EAAEw+B,EALR3hB,EAAI,IAAIpkB,KAAKi/E,KA8BR76D,EAWT,SAAS82E,GAAK10F,GACZ,OAAO,IAAIxG,KAAKwG,GAAG00F,OAUrB,SAAS1kE,GAAKhwB,GACZ,OAAOyzF,EAASzzF,EAAI,IAAIxG,KAAKwG,GAAIA,EAAErF,EAAI,EAAG,GAsB5C,SAASynB,GAAOnmB,GACd,IAAKA,GAAsB,iBAARA,EAAkB,MAAM0J,MAAMgsF,EAAe,mBAChE,IAAIz5F,EAAGoF,EAAG6C,EACR+8F,GAA+B,IAAjBjhG,EAAIyiF,SAClBye,EAAK,CACH,YAAa,EAAGpM,EAChB,WAAY,EAAG,EACf,YAAaD,EAAW,EACxB,WAAY,EAAGA,EACf,OAAQ,EAAGA,EACX,QAASA,EAAW,EACpB,SAAU,EAAG,GAGjB,IAAK54F,EAAI,EAAGA,EAAIilG,EAAGllG,OAAQC,GAAK,EAE9B,GADIoF,EAAI6/F,EAAGjlG,GAAIglG,IAAa1jG,KAAK8D,GAAK4zF,EAAS5zF,SAC1B,KAAhB6C,EAAIlE,EAAIqB,IAAgB,CAC3B,KAAIy0F,EAAU5xF,KAAOA,GAAKA,GAAKg9F,EAAGjlG,EAAI,IAAMiI,GAAKg9F,EAAGjlG,EAAI,IACnD,MAAMyN,MAAMisF,EAAkBt0F,EAAI,KAAO6C,GADc3G,KAAK8D,GAAK6C,EAM1E,GADI7C,EAAI,SAAU4/F,IAAa1jG,KAAK8D,GAAK4zF,EAAS5zF,SAC7B,KAAhB6C,EAAIlE,EAAIqB,IAAgB,CAC3B,IAAU,IAAN6C,IAAoB,IAANA,GAAqB,IAANA,GAAiB,IAANA,EAY1C,MAAMwF,MAAMisF,EAAkBt0F,EAAI,KAAO6C,GAXzC,GAAIA,EAAG,CACL,GAAqB,oBAAV09B,SAAyBA,SACjCA,OAAOu/D,kBAAmBv/D,OAAOw/D,YAGlC,MAAM13F,MAAMmsF,GAFZt4F,KAAK8D,IAAK,OAKZ9D,KAAK8D,IAAK,EAOhB,OAAO9D,KAWT,SAAS2U,GAAInO,GACX,OAAO,IAAIxG,KAAKwG,GAAGmO,MAWrB,SAASwoE,GAAK32E,GACZ,OAAO,IAAIxG,KAAKwG,GAAG22E,OAuMrB,SAAS0e,GAAIr1F,EAAGe,GACd,OAAO,IAAIvH,KAAKwG,GAAGq1F,IAAIt0F,GAWzB,SAAS6B,GAAI5C,GACX,OAAO,IAAIxG,KAAKwG,GAAG4C,MAUrB,SAASnB,GAAMzB,GACb,OAAOyzF,EAASzzF,EAAI,IAAIxG,KAAKwG,GAAIA,EAAErF,EAAI,EAAG,GAa5C,SAAS2iG,KACP,IAAIplG,EAAG8G,EACLukB,EAAI,IAAI/pB,KAAK,GAIf,IAFAk4F,GAAW,EAENx5F,EAAI,EAAGA,EAAIwB,UAAUzB,QAExB,IADA+G,EAAI,IAAIxF,KAAKE,UAAUxB,OAChBgR,EAMIqa,EAAEra,IACXqa,EAAIA,EAAEpU,KAAKnQ,EAAEoQ,MAAMpQ,SAPX,CACR,GAAIA,EAAEugC,EAEJ,OADAmyD,GAAW,EACJ,IAAIl4F,KAAK,KAElB+pB,EAAIvkB,EAQR,OAFA0yF,GAAW,EAEJnuE,EAAE9jB,OASX,SAAS89F,GAAkBthG,GACzB,OAAOA,aAAe00F,GAAW10F,GAAoB,qBAAbA,EAAIiD,OAA+B,EAW7E,SAAS43F,GAAG92F,GACV,OAAO,IAAIxG,KAAKwG,GAAG82F,KAcrB,SAASryF,GAAIzE,EAAGe,GACd,OAAO,IAAIvH,KAAKwG,GAAGyE,IAAI1D,GAWzB,SAASygD,GAAKxhD,GACZ,OAAO,IAAIxG,KAAKwG,GAAGyE,IAAI,GAWzB,SAAS+4F,GAAMx9F,GACb,OAAO,IAAIxG,KAAKwG,GAAGyE,IAAI,IAUzB,SAASwE,KACP,OAAOqzF,EAAS9iG,KAAME,UAAW,MAUnC,SAASsyB,KACP,OAAOswE,EAAS9iG,KAAME,UAAW,MAYnC,SAAS4+F,GAAIt4F,EAAGe,GACd,OAAO,IAAIvH,KAAKwG,GAAGs4F,IAAIv3F,GAYzB,SAASk4F,GAAIj5F,EAAGe,GACd,OAAO,IAAIvH,KAAKwG,GAAGi5F,IAAIl4F,GAYzB,SAASI,GAAInB,EAAGe,GACd,OAAO,IAAIvH,KAAKwG,GAAGmB,IAAIJ,GAYzB,SAASw3B,GAAOgC,GACd,IAAIrxB,EAAGvO,EAAGuF,EAAGlB,EACX9G,EAAI,EACJ0lB,EAAI,IAAIpkB,KAAK,GACby5F,EAAK,GAOP,QALW,IAAP14D,EAAeA,EAAK/gC,KAAK23F,UACxByB,EAAWr4D,EAAI,EAAGw2D,GAEvB7wF,EAAIV,KAAKwwB,KAAKuK,EAn6IH,GAq6IN/gC,KAAKqkC,OAIH,GAAIA,OAAOu/D,gBAGhB,IAFAl0F,EAAI20B,OAAOu/D,gBAAgB,IAAI9uC,YAAYpuD,IAEpChI,EAAIgI,IACTlB,EAAIkK,EAAEhR,KAIG,MACPgR,EAAEhR,GAAK2lC,OAAOu/D,gBAAgB,IAAI9uC,YAAY,IAAI,GAKlD2kC,EAAG/6F,KAAO8G,EAAI,QAKb,KAAI6+B,OAAOw/D,YAwBhB,MAAM13F,MAAMmsF,GAnBZ,IAFA5oF,EAAI20B,OAAOw/D,YAAYn9F,GAAK,GAErBhI,EAAIgI,IAGTlB,EAAIkK,EAAEhR,IAAMgR,EAAEhR,EAAI,IAAM,IAAMgR,EAAEhR,EAAI,IAAM,MAAmB,IAAXgR,EAAEhR,EAAI,KAAc,MAG7D,MACP2lC,OAAOw/D,YAAY,GAAGp3E,KAAK/c,EAAGhR,IAK9B+6F,EAAGj4F,KAAKgE,EAAI,KACZ9G,GAAK,GAITA,EAAIgI,EAAI,OA5CR,KAAOhI,EAAIgI,GAAI+yF,EAAG/6F,KAAuB,IAAhBsH,KAAK+4B,SAAiB,EA2DjD,IATAgC,GAx9IW,GAu9IXr6B,EAAI+yF,IAAK/6F,KAIAqiC,IACPv7B,EAAIgzF,EAAQ,GA59IH,EA49IkBz3D,GAC3B04D,EAAG/6F,IAAMgI,EAAIlB,EAAI,GAAKA,GAIP,IAAVi0F,EAAG/6F,GAAUA,IAAK+6F,EAAGjgC,MAG5B,GAAI96D,EAAI,EACNyC,EAAI,EACJs4F,EAAK,CAAC,OACD,CAIL,IAHAt4F,GAAK,EAGY,IAAVs4F,EAAG,GAAUt4F,GA3+IX,EA2+I0Bs4F,EAAGmF,QAGtC,IAAKl4F,EAAI,EAAGlB,EAAIi0F,EAAG,GAAIj0F,GAAK,GAAIA,GAAK,GAAIkB,IAGrCA,EAj/IK,IAi/ISvF,GAj/IT,EAi/IyBuF,GAMpC,OAHA0d,EAAEjjB,EAAIA,EACNijB,EAAE1U,EAAI+pF,EAECr1E,EAYT,SAASpb,GAAMxC,GACb,OAAOyzF,EAASzzF,EAAI,IAAIxG,KAAKwG,GAAIA,EAAErF,EAAI,EAAGnB,KAAK43F,UAejD,SAASyK,GAAK77F,GAEZ,OADAA,EAAI,IAAIxG,KAAKwG,IACJkJ,EAAKlJ,EAAEkJ,EAAE,GAAKlJ,EAAEu/B,EAAI,EAAIv/B,EAAEu/B,EAAKv/B,EAAEu/B,GAAKk5C,IAWjD,SAASpqE,GAAIrO,GACX,OAAO,IAAIxG,KAAKwG,GAAGqO,MAWrB,SAASuoE,GAAK52E,GACZ,OAAO,IAAIxG,KAAKwG,GAAG42E,OAWrB,SAASn3E,GAAKO,GACZ,OAAO,IAAIxG,KAAKwG,GAAGP,OAYrB,SAASy4F,GAAIl4F,EAAGe,GACd,OAAO,IAAIvH,KAAKwG,GAAGk4F,IAAIn3F,GAWzB,SAASi4F,GAAIh5F,GACX,OAAO,IAAIxG,KAAKwG,GAAGg5F,MAWrB,SAASzC,GAAKv2F,GACZ,OAAO,IAAIxG,KAAKwG,GAAGu2F,OAUrB,SAASkE,GAAMz6F,GACb,OAAOyzF,EAASzzF,EAAI,IAAIxG,KAAKwG,GAAIA,EAAErF,EAAI,EAAG,IAK5Cg2F,EAllBA,SAAS8M,EAAMxhG,GACb,IAAI/D,EAAGoF,EAAG6/F,EASV,SAASxM,EAAQxwF,GACf,IAAIxF,EAAGzC,EAAGqrB,EACRvjB,EAAIxG,KAGN,KAAMwG,aAAa2wF,GAAU,OAAO,IAAIA,EAAQxwF,GAOhD,GAHAH,EAAE7C,YAAcwzF,EAGZxwF,aAAawwF,EAuBf,OAtBA3wF,EAAEu/B,EAAIp/B,EAAEo/B,OAEJmyD,GACGvxF,EAAE+I,GAAK/I,EAAExF,EAAIg2F,EAAQc,MAGxBzxF,EAAErF,EAAI89E,IACNz4E,EAAEkJ,EAAI,MACG/I,EAAExF,EAAIg2F,EAAQa,MAGvBxxF,EAAErF,EAAI,EACNqF,EAAEkJ,EAAI,CAAC,KAEPlJ,EAAErF,EAAIwF,EAAExF,EACRqF,EAAEkJ,EAAI/I,EAAE+I,EAAE5K,UAGZ0B,EAAErF,EAAIwF,EAAExF,EACRqF,EAAEkJ,EAAI/I,EAAE+I,EAAI/I,EAAE+I,EAAE5K,QAAU6B,EAAE+I,IAQhC,GAAU,WAFVqa,SAAWpjB,GAES,CAClB,GAAU,IAANA,EAIF,OAHAH,EAAEu/B,EAAI,EAAIp/B,EAAI,GAAK,EAAI,EACvBH,EAAErF,EAAI,OACNqF,EAAEkJ,EAAI,CAAC,IAYT,GARI/I,EAAI,GACNA,GAAKA,EACLH,EAAEu/B,GAAK,GAEPv/B,EAAEu/B,EAAI,EAIJp/B,MAAQA,GAAKA,EAAI,IAAK,CACxB,IAAKxF,EAAI,EAAGzC,EAAIiI,EAAGjI,GAAK,GAAIA,GAAK,GAAIyC,IAkBrC,YAhBI+2F,EACE/2F,EAAIg2F,EAAQc,MACdzxF,EAAErF,EAAI89E,IACNz4E,EAAEkJ,EAAI,MACGvO,EAAIg2F,EAAQa,MACrBxxF,EAAErF,EAAI,EACNqF,EAAEkJ,EAAI,CAAC,KAEPlJ,EAAErF,EAAIA,EACNqF,EAAEkJ,EAAI,CAAC/I,KAGTH,EAAErF,EAAIA,EACNqF,EAAEkJ,EAAI,CAAC/I,KAMJ,OAAQ,EAAJA,GAAU,GACdA,IAAGH,EAAEu/B,EAAIk5C,KACdz4E,EAAErF,EAAI89E,SACNz4E,EAAEkJ,EAAI,OAIDwzF,EAAa18F,EAAGG,EAAElB,YAEpB,GAAU,WAANskB,EACT,MAAM5d,MAAMisF,EAAkBzxF,GAahC,OAT8B,MAAzBjI,EAAIiI,EAAEy8F,WAAW,KACpBz8F,EAAIA,EAAE7B,MAAM,GACZ0B,EAAEu/B,GAAK,IAGG,KAANrnC,IAAUiI,EAAIA,EAAE7B,MAAM,IAC1B0B,EAAEu/B,EAAI,GAGD6yD,EAAUjzF,KAAKgB,GAAKu8F,EAAa18F,EAAGG,GAAK08F,EAAW78F,EAAGG,GA0DhE,GAvDAwwF,EAAQn2F,UAAYg4F,EAEpB7B,EAAQ+M,SAAW,EACnB/M,EAAQgN,WAAa,EACrBhN,EAAQiN,WAAa,EACrBjN,EAAQkN,YAAc,EACtBlN,EAAQmN,cAAgB,EACxBnN,EAAQoN,gBAAkB,EAC1BpN,EAAQqN,gBAAkB,EAC1BrN,EAAQsN,gBAAkB,EAC1BtN,EAAQuN,iBAAmB,EAC3BvN,EAAQwN,OAAS,EAEjBxN,EAAQvuE,OAASuuE,EAAQ3tB,IAAM5gD,GAC/BuuE,EAAQ8M,MAAQA,EAChB9M,EAAQyB,UAAYmL,GAEpB5M,EAAQntF,IAAMA,GACdmtF,EAAQ5Y,KAAOA,GACf4Y,EAAQrY,MAAQA,GAChBqY,EAAQ5qF,IAAMA,GACd4qF,EAAQ3Y,KAAOA,GACf2Y,EAAQtY,MAAQA,GAChBsY,EAAQ7Y,KAAOA,GACf6Y,EAAQvY,MAAQA,GAChBuY,EAAQ5xC,MAAQA,GAChB4xC,EAAQ+D,KAAOA,GACf/D,EAAQ3gE,KAAOA,GACf2gE,EAAQxiF,IAAMA,GACdwiF,EAAQha,KAAOA,GACfga,EAAQ0E,IAAMA,GACd1E,EAAQ/tF,IAAMA,GACd+tF,EAAQlvF,MAAQA,GAChBkvF,EAAQ2M,MAAQA,GAChB3M,EAAQmG,GAAKA,GACbnG,EAAQlsF,IAAMA,GACdksF,EAAQ6M,MAAQA,GAChB7M,EAAQnvC,KAAOA,GACfmvC,EAAQ1nF,IAAMA,GACd0nF,EAAQ3kE,IAAMA,GACd2kE,EAAQ2H,IAAMA,GACd3H,EAAQsI,IAAMA,GACdtI,EAAQxvF,IAAMA,GACdwvF,EAAQp4D,OAASA,GACjBo4D,EAAQnuF,MAAQA,GAChBmuF,EAAQkL,KAAOA,GACflL,EAAQtiF,IAAMA,GACdsiF,EAAQ/Z,KAAOA,GACf+Z,EAAQlxF,KAAOA,GACfkxF,EAAQuH,IAAMA,GACdvH,EAAQqI,IAAMA,GACdrI,EAAQ4F,KAAOA,GACf5F,EAAQ8J,MAAQA,QAEJ,IAARx+F,IAAgBA,EAAM,IACtBA,IACmB,IAAjBA,EAAIyiF,SAEN,IADAye,EAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,UAC5EjlG,EAAI,EAAGA,EAAIilG,EAAGllG,QAAcgE,EAAIO,eAAec,EAAI6/F,EAAGjlG,QAAO+D,EAAIqB,GAAK9D,KAAK8D,IAMpF,OAFAqzF,EAAQvuE,OAAOnmB,GAER00F,EAgaC8M,CAAMvM,IAEC,QAAIP,EAAQA,QAAUA,EAGvCM,EAAO,IAAIN,EAAQM,GACnBnjF,EAAK,IAAI6iF,EAAQ7iF,QAUd,KAFD,aACE,OAAO6iF,GACR,8BAnvJJ,I,sBCKD,IAAIyN,EAAWziG,OAAOwxB,QAAU,SAAU9xB,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAS9Z,UAAUxB,GAAI,IAAK,IAAIY,KAAO0a,EAAc7X,OAAOnB,UAAUgC,eAAe9B,KAAK8Y,EAAQ1a,KAAQuC,EAAOvC,GAAO0a,EAAO1a,IAAY,OAAOuC,GAEnPgjG,EAAiB,CACnB,IAAK,MACL,IAAK,MACL,KAAM,oBACN,IAAK,MACLj+E,EAAG,MACH,IAAK,MACL,IAAK,MACL,IAAK,sBACLwa,EAAG,MACH,IAAK,sBAEH0jE,EAAgB,CAClB,IAAU,OACV,IAAU,QACV,IAAK,IACL,KAAM,YACN,OAAQ,cACR,KAAM,eAGJC,EAAqB,SAA4BF,EAAgBC,GACnE,OAAOF,EAAS,GAAIC,EAAgBC,IAWtCl/F,EAAOC,QAAU,SAAU+T,GAmCzB,IAlCA,IAAIorF,EAAO9kG,UAAUzB,OAAS,QAAsB4B,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAC3E+kG,EAAwBD,EAAKE,mBAC7BA,OAA+C7kG,IAA1B4kG,GAA8CA,EACnEE,EAAmBH,EAAKI,YACxBA,OAAmC/kG,IAArB8kG,EAAiCJ,EAAqBI,EAEpEE,EAAa76F,OAAOoP,GACpB4R,EAAS,GAET85E,EAAUF,EAAYR,EAAS,GAAIC,GAAiBK,EAAqBN,EAAS,GAAIE,GAAiB,IACvGS,EAAapjG,OAAOsE,KAAK6+F,GAMzBE,EAAQ,WACV,IAAIC,GAAmB,EACvBF,EAAWxoF,SAAQ,SAAUzd,EAAKyI,GAC5B09F,GAGAJ,EAAW5mG,QAAUa,EAAIb,QAAU4mG,EAAWvgG,MAAM,EAAGxF,EAAIb,UAAYa,IACzEksB,GAAU85E,EAAQC,EAAWx9F,IAC7Bs9F,EAAaA,EAAWvgG,MAAMxF,EAAIb,OAAQ4mG,EAAW5mG,QACrDgnG,GAAmB,MAGlBA,IACHj6E,GAAU65E,EAAWvgG,MAAM,EAAG,GAC9BugG,EAAaA,EAAWvgG,MAAM,EAAGugG,EAAW5mG,UAIzC4mG,GACLG,IAEF,OAAOh6E,I,mBC9ET,OAuCA,SAAUG,GAER,aAKA,IAGIqtE,EAAI,CACN,EAAK,EACL,EAAK,EACL,EAAK,GAGP,SAAS0M,EAAYhgG,GAEnB,SAASigG,IACP,IAAIz7F,EAAOiC,MAAMhM,MAAMH,KAAME,WAC7BgK,EAAW,KAAIlK,KAAW,KAAI0F,EAC9B1F,KAAY,MAAIkK,EAAY,MAC5BlK,KAAc,QAAIkK,EAAc,QAQlC,SAAS07F,KAIT,OAHAA,EAAsB5kG,UAAYmL,MAAMnL,UACxC2kG,EAAiB3kG,UAAY,IAAI4kG,EAE1BD,EAGT,IAAIE,EAAiBC,EAAyB,eAAIJ,EAAY,kBAC1DK,EAAmBD,EAA2B,iBAAIJ,EAAY,oBAElE,SAAS/xE,EAAOnuB,EAAGugC,GAKjB,OAHIr9B,MAAMlD,EAAIsD,SAAStD,EAAG,MACxBwgG,IAEKxgG,EAAIugC,EAGb,SAASigE,IACP,MAAM,IAAID,EAGZ,IAAI7oF,EAAQ,SAASk1D,EAAIC,GAEvB,IAOI4zB,EAPAzgG,EAAI,EAAGkK,EAAI,EAAGq2B,EAAI,EAClBp/B,EAAI,EAAG+pD,EAAI,EAAGlqD,EAAI,EAAGe,EAAI,EAAGynB,EAAI,EAEhCk3E,EAAI,EAAGC,EAAI,EACXC,EAAI,EAAGC,EAAI,EAEXC,EAAI,IAGR,GAAIl0B,cAEG,QAAW/xE,IAAPgyE,EAGTtsC,GAFAvgC,EAAI4sE,IACJ1iE,EAAI2iE,QAGJ,cAAeD,GAEb,IAAK,SAEG,MAAOA,GAAM,MAAOA,GACtB5sE,EAAI4sE,EAAM,EACV1iE,EAAI0iE,EAAM,EACN,MAAOA,IACT5sE,GAAK4sE,EAAM,IACJ,KAAKA,GACd5sE,EAAI4sE,EAAG,GACH,KAAKA,IACP1iE,EAAI0iE,EAAG,KAET4zB,IAEFjgE,EAAIvgC,EAAIkK,EACR,MAEJ,IAAK,SAOD,GALI0iE,EAAK,IACPrsC,EAAIqsC,EACJA,GAAMA,GAGJA,EAAK,GAAM,EACb5sE,EAAI4sE,OACC,GAAIA,EAAK,EAAG,CAUjB,IARIA,GAAM,IAERA,GADApjD,EAAIhpB,KAAK2B,IAAI,GAAI3B,KAAKiC,MAAM,EAAIjC,KAAKiF,IAAImnE,GAAMpsE,KAAKyxF,QAO/C0O,GAAKG,GAAKD,GAAKC,GAAG,CAGvB,GAAIl0B,KAFJ6zB,GAAKC,EAAIE,IAAMD,EAAIE,IAEL,CACRF,EAAIE,GAAKC,GACX9gG,EAAI0gG,EAAIE,EACR12F,EAAIy2F,EAAIE,GACCA,EAAIF,GACb3gG,EAAI4gG,EACJ12F,EAAI22F,IAEJ7gG,EAAI0gG,EACJx2F,EAAIy2F,GAEN,MAII/zB,EAAK6zB,GACPC,GAAKE,EACLD,GAAKE,IAELD,GAAKF,EACLG,GAAKF,GAGHA,EAAIG,GACN9gG,EAAI4gG,EACJ12F,EAAI22F,IAEJ7gG,EAAI0gG,EACJx2F,EAAIy2F,GAIV3gG,GAAKwpB,OACItmB,MAAM0pE,IAAO1pE,MAAM2pE,MAC5B3iE,EAAIlK,EAAIy5E,KAEV,MAEJ,IAAK,SAgDD,GA5CU,QAFVknB,EAAI/zB,EAAGwL,MAAM,YAGXooB,IAEW,MAATG,EAAED,IACJngE,GAAK,EACLmgE,KACkB,MAATC,EAAED,IACXA,IAGEC,EAAE1nG,SAAWynG,EAAI,EACnBx1C,EAAI/8B,EAAOwyE,EAAED,KAAMngE,GACG,MAAbogE,EAAED,EAAI,IAAuB,MAATC,EAAED,IAElB,MAATC,EAAED,KACJv/F,EAAIgtB,EAAOwyE,EAAED,KAAMngE,KAKb,KAHRmgE,IAGcC,EAAE1nG,QAAuB,MAAb0nG,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,MAC1Fx1C,EAAI/8B,EAAOwyE,EAAED,GAAIngE,GACjBx+B,EAAIvB,KAAK2B,IAAI,GAAIw+F,EAAED,GAAGznG,QACtBynG,MAIW,MAATC,EAAED,IAA2B,MAAbC,EAAED,EAAI,IAAuB,MAATC,EAAED,IAA2B,MAAbC,EAAED,EAAI,MAC5D1/F,EAAImtB,EAAOwyE,EAAED,EAAI,GAAIngE,GACrB/W,EAAIhpB,KAAK2B,IAAI,GAAIw+F,EAAED,EAAI,GAAGznG,QAAU,EACpCynG,GAAK,IAGe,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IACnCx1C,EAAI/8B,EAAOwyE,EAAED,GAAIngE,GACjBx+B,EAAIosB,EAAOwyE,EAAED,EAAI,GAAI,GACrBA,GAAK,GACiB,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,KACnCv/F,EAAIgtB,EAAOwyE,EAAED,GAAIngE,GACjB2qB,EAAI/8B,EAAOwyE,EAAED,EAAI,GAAIngE,GACrBx+B,EAAIosB,EAAOwyE,EAAED,EAAI,GAAI,GACrBA,GAAK,GAGHC,EAAE1nG,QAAUynG,EAAG,CAEjBngE,EACAvgC,EAAIgB,GAFJkJ,EAAInI,EAAIynB,GAEIroB,EAAIqoB,EAAI0hC,EACpB,MAKN,QACEs1C,IAGN,GAAU,IAANt2F,EACF,MAAM,IAAIm2F,EAGZ7M,EAAK,EAAIjzD,EAAI,GAAK,EAAI,EACtBizD,EAAK,EAAIhzF,KAAKgE,IAAIxE,GAClBwzF,EAAK,EAAIhzF,KAAKgE,IAAI0F,IAgEpB,SAASzF,EAAI1I,EAAGmG,GAEd,IAAKnG,EACH,OAAOmG,EACT,IAAKA,EACH,OAAOnG,EAET,OAAU,CAER,KADAA,GAAKmG,GAEH,OAAOA,EAET,KADAA,GAAKnG,GAEH,OAAOA,GAWb,SAASukG,EAASvkG,EAAGmG,GAEnB,KAAM1H,gBAAgB8lG,GACpB,OAAO,IAAIA,EAASvkG,EAAGmG,GAGzBwV,EAAM3b,EAAGmG,GAGPnG,EADEukG,EAAiB,OACf77F,EAAI+uF,EAAK,EAAGA,EAAK,GAEjB,EAGNh5F,KAAQ,EAAIg5F,EAAK,EACjBh5F,KAAQ,EAAIg5F,EAAK,EAAIz3F,EACrBvB,KAAQ,EAAIg5F,EAAK,EAAIz3F,EAOvBukG,EAAiB,OAAI,EAErBA,EAAS9kG,UAAY,CAEnB,EAAK,EACL,EAAK,EACL,EAAK,EAOL,IAAO,WAEL,OAAO,IAAI8kG,EAAS9lG,KAAQ,EAAGA,KAAQ,IAQzC,IAAO,WAEL,OAAO,IAAI8lG,GAAU9lG,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,IAQtD,IAAO,SAASuB,EAAGmG,GAGjB,OADAwV,EAAM3b,EAAGmG,GACF,IAAIo+F,EACT9lG,KAAQ,EAAIA,KAAQ,EAAIg5F,EAAK,EAAIA,EAAK,EAAIh5F,KAAQ,EAAIg5F,EAAK,EAC3Dh5F,KAAQ,EAAIg5F,EAAK,IASrB,IAAO,SAASz3F,EAAGmG,GAGjB,OADAwV,EAAM3b,EAAGmG,GACF,IAAIo+F,EACT9lG,KAAQ,EAAIA,KAAQ,EAAIg5F,EAAK,EAAIA,EAAK,EAAIh5F,KAAQ,EAAIg5F,EAAK,EAC3Dh5F,KAAQ,EAAIg5F,EAAK,IASrB,IAAO,SAASz3F,EAAGmG,GAGjB,OADAwV,EAAM3b,EAAGmG,GACF,IAAIo+F,EACT9lG,KAAQ,EAAIg5F,EAAK,EAAIh5F,KAAQ,EAAIg5F,EAAK,EACtCh5F,KAAQ,EAAIg5F,EAAK,IASrB,IAAO,SAASz3F,EAAGmG,GAGjB,OADAwV,EAAM3b,EAAGmG,GACF,IAAIo+F,EACT9lG,KAAQ,EAAIg5F,EAAK,EAAIh5F,KAAQ,EAAIg5F,EAAK,EACtCh5F,KAAQ,EAAIg5F,EAAK,IASrB,MAAS,WACP,OAAO,IAAI8M,EAAS9lG,OAQtB,IAAO,SAASuB,EAAGmG,GAEjB,OAAIgB,MAAM1I,KAAQ,IAAM0I,MAAM1I,KAAQ,GAC7B,IAAI8lG,EAAS7mB,UAGZ5+E,IAANkB,EACK,IAAIukG,EAAS9lG,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,EAAG,IAGzDkd,EAAM3b,EAAGmG,GACL,IAAMsxF,EAAK,GAAK,IAAMh5F,KAAQ,GAChC8lG,EAAS,EAAG,GAiBP,IAAIA,EACT9lG,KAAQ,GAAKg5F,EAAK,EAAIh5F,KAAQ,IAAMg5F,EAAK,EAAIh5F,KAAQ,GACrDg5F,EAAK,EAAIh5F,KAAQ,KASrB,IAAO,SAASuB,EAAGmG,GAMjB,OAJAwV,EAAM3b,EAAGmG,GAIF,IAAIo+F,EAAS77F,EAAI+uF,EAAK,EAAGh5F,KAAQ,GAAKiK,EAAI+uF,EAAK,EAAGh5F,KAAQ,GAAIg5F,EAAK,EAAIh5F,KAAQ,IAQxF,IAAO,SAASuB,EAAGmG,GAMjB,OAJAwV,EAAM3b,EAAGmG,GAIM,IAAXsxF,EAAK,GAAyB,IAAdh5F,KAAQ,EACnB,IAAI8lG,EAEN,IAAIA,EAAS9M,EAAK,EAAIh5F,KAAQ,EAAGiK,EAAI+uF,EAAK,EAAGh5F,KAAQ,GAAKiK,EAAI+uF,EAAK,EAAGh5F,KAAQ,KAQvF,KAAQ,SAAS++E,GAIf,OAFAA,EAAS/4E,KAAK2B,IAAI,GAAIo3E,GAAU,GAE5Br2E,MAAM1I,KAAQ,IAAM0I,MAAM1I,KAAQ,GAC7B,IAAI8lG,EAAS7mB,KAEf,IAAI6mB,EAAS9/F,KAAKwwB,KAAKuoD,EAAS/+E,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI++E,IAQ7E,MAAS,SAASA,GAIhB,OAFAA,EAAS/4E,KAAK2B,IAAI,GAAIo3E,GAAU,GAE5Br2E,MAAM1I,KAAQ,IAAM0I,MAAM1I,KAAQ,GAC7B,IAAI8lG,EAAS7mB,KAEf,IAAI6mB,EAAS9/F,KAAKiC,MAAM82E,EAAS/+E,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI++E,IAQ9E,MAAS,SAASA,GAIhB,OAFAA,EAAS/4E,KAAK2B,IAAI,GAAIo3E,GAAU,GAE5Br2E,MAAM1I,KAAQ,IAAM0I,MAAM1I,KAAQ,GAC7B,IAAI8lG,EAAS7mB,KAEf,IAAI6mB,EAAS9/F,KAAKgD,MAAM+1E,EAAS/+E,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI++E,IAQ9E,QAAW,WAET,OAAO,IAAI+mB,EAAS9lG,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,IAQrD,IAAO,SAASoQ,GAEd,OAAIA,EAAI,EACC,IAAI01F,EAAS9/F,KAAK2B,IAAI3H,KAAQ,EAAIA,KAAQ,GAAIoQ,GAAIpK,KAAK2B,IAAI3H,KAAQ,GAAIoQ,IAEvE,IAAI01F,EAAS9/F,KAAK2B,IAAI3H,KAAQ,EAAIA,KAAQ,EAAGoQ,GAAIpK,KAAK2B,IAAI3H,KAAQ,EAAGoQ,KAShF,OAAU,SAAS7O,EAAGmG,GAGpB,OADAwV,EAAM3b,EAAGmG,GACF1H,KAAQ,EAAIA,KAAQ,EAAIg5F,EAAK,GAAMA,EAAK,EAAIA,EAAK,EAAIh5F,KAAQ,GAQtE,QAAW,SAASuB,EAAGmG,GAErBwV,EAAM3b,EAAGmG,GACT,IAAIqiB,EAAK/pB,KAAQ,EAAIA,KAAQ,EAAIg5F,EAAK,EAAIA,EAAK,EAAIA,EAAK,EAAIh5F,KAAQ,EACpE,OAAQ,EAAI+pB,IAAMA,EAAI,IAGxB,SAAY,SAASw8E,GAInB,GAAI79F,MAAM1I,KAAQ,IAAM0I,MAAM1I,KAAQ,GACpC,OAAOA,KAGT,IAAIi4B,EAAOj4B,KAAU,MAAiB,cAItC,SAASwmG,EAAIjlG,GACX,OAAiB,IAAbA,EAAE9C,OACG,IAAIqnG,EAASvkG,EAAE,IACjBilG,EAAIjlG,EAAEuD,MAAM,IAAa,UAAS,IAAEvD,EAAE,IAL/CglG,EAAMA,GAAO,KAQb,IAAK,IAAI7nG,EAAI,EAAGA,EAAIu5B,EAAKx5B,OAAQC,IAAK,CACpC,IAAI2H,EAAMmgG,EAAIvuE,EAAKnzB,MAAM,EAAGpG,EAAI,IAChC,GAAI2H,EAAS,IAAErG,KAAU,OAAU,MAAIiB,UAAYslG,EACjD,OAAOlgG,EAAS,IAAErG,KAAQ,GAG9B,OAAOA,MAQT,UAAa,SAASuB,EAAGmG,GAGvB,OADAwV,EAAM3b,EAAGmG,OACEsxF,EAAK,EAAIh5F,KAAQ,IAAQA,KAAQ,EAAIg5F,EAAK,GAAMA,EAAK,EAAIh5F,KAAQ,KAQ9E,QAAW,WAET,OAAOA,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAQzC,WAAc,SAASymG,GAErB,IAAIC,EAAO9sF,EAAM,GACbpU,EAAIxF,KAAQ,EACZ0P,EAAI1P,KAAQ,EAmBhB,OAlBIA,KAAQ,EAAI,IACd4Z,GAAO,KAGC,IAANlK,EACFkK,GAAOpU,GAGHihG,IAAiBC,EAAQ1gG,KAAKiC,MAAMzC,EAAIkK,IAAM,IAChDkK,GAAO8sF,EACP9sF,GAAO,IACPpU,GAAKkK,GAGPkK,GAAOpU,EACPoU,GAAO,IACPA,GAAOlK,GAEFkK,GAQT,QAAW,SAAS6sF,GAElB,IAAIC,EAAO9sF,EAAM,GACbpU,EAAIxF,KAAQ,EACZ0P,EAAI1P,KAAQ,EAoBhB,OAnBIA,KAAQ,EAAI,IACd4Z,GAAO,KAGC,IAANlK,EACFkK,GAAOpU,GAGHihG,IAAiBC,EAAQ1gG,KAAKiC,MAAMzC,EAAIkK,IAAM,IAChDkK,GAAO8sF,EACPlhG,GAAKkK,GAGPkK,GAAO,UACPA,GAAOpU,EACPoU,GAAO,KACPA,GAAOlK,EACPkK,GAAO,KAEFA,GAQT,YAAe,WAEb,IAAImQ,EACAxoB,EAAIvB,KAAQ,EACZ0H,EAAI1H,KAAQ,EACZyyE,EAAM,GAEV,GAAI/pE,MAAMnH,IAAMmH,MAAMhB,GACpB,OAAO+qE,EAGT,GACEA,EAAIjxE,KAAKwE,KAAKiC,MAAM1G,EAAImG,IACxBqiB,EAAIxoB,EAAImG,EACRnG,EAAImG,EACJA,EAAIqiB,QACS,IAANxoB,GAET,OAAOkxE,GAQT,SAAY,SAASk0B,GAEnB,IAAIt3C,EACAi3C,EAAItmG,KAAQ,EACZqmG,EAAIrmG,KAAQ,EAEhB,GAAI0I,MAAM49F,IAAM59F,MAAM29F,GACpB,MAAO,MAGJP,EAAiB,SAEpBQ,GADAj3C,EAAIplD,EAAIq8F,EAAGD,GAEXA,GAAKh3C,GAGPs3C,EAAMA,GAAO,GAEb,IAAIC,EA/fR,SAAkBphG,EAAGkK,GAEnB,KAAOA,EAAI,GAAM,EACfA,GAAK,GAGP,KAAOA,EAAI,GAAM,EACfA,GAAK,GAGP,GAAU,IAANA,EACF,OAAO,EAUT,IAHA,IAAImyF,EAAM,GAAKnyF,EACXqa,EAAI,EAEO,IAAR83E,EAAW93E,IAGhB,GAFA83E,EAAY,GAANA,EAAWnyF,EAEbqa,EAzPY,IA0Pd,OAAO,EAEX,OAAOA,EAoeQ88E,CAASP,EAAGD,GACrBS,EAjeR,SAAoBthG,EAAGkK,EAAGlR,GAKxB,IAHA,IAAIuoG,EAAO,EACPC,EA/CN,SAAgBt/F,EAAGvG,EAAGiP,GAGpB,IADA,IAAIgU,EAAI,EACDjjB,EAAI,EAAGuG,EAAKA,EAAIA,EAAK0I,EAAGjP,IAAM,EAE3B,EAAJA,IACFijB,EAAKA,EAAI1c,EAAK0I,GAGlB,OAAOgU,EAsCI6iF,CAAO,GAAIzoG,EAAKkR,GAElBqa,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAG5B,GAAIg9E,IAASC,EACX,OAAOj9E,EAETg9E,EAAc,GAAPA,EAAYr3F,EACnBs3F,EAAc,GAAPA,EAAYt3F,EAErB,OAAO,EAmdQw3F,CAAWZ,EAAGD,EAAGO,GAE1BhtF,GAAqB,IAAf5Z,KAAQ,EAAW,IAAM,GAUnC,GARA4Z,GAAO0sF,EAAID,EAAI,EAEfC,GAAKD,GACLC,GAAK,MAGH1sF,GAAO,KAELgtF,EAAQ,CAEV,IAAK,IAAIloG,EAAIooG,EAAQpoG,KACnBkb,GAAO0sF,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAGP,IADA1sF,GAAO,IACElb,EAAIkoG,EAAQloG,KACnBkb,GAAO0sF,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAEP1sF,GAAO,SAEP,IAASlb,EAAIioG,EAAKL,GAAK5nG,KACrBkb,GAAO0sF,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAGT,OAAO1sF,SAOR,KAFU,EAAF,WACP,OAAOksF,GACR,QAFM,OAEN,aAhxBL,I,eCTA,IAAI5qC,EAAM,EAAQ,MAElBt1D,EAAOC,QAAU,CACfq8E,MAAOhnB,EAAIgnB,MACXilB,KAAM,EAAQ,MACdC,IAAK,EAAQ,MACb9nB,QAASpkB,EAAIokB,U,eCpCf,IAAIl+C,EAAI,EAAQ,MAEhBx7B,EAAOC,QAEP,SAAoBwpD,GAClB,IAEIg4C,EAFAznB,EAAU,GACV0nB,EAAQ,GAGZ,SAASznB,EAAIl5E,GACPy6B,EAAE90B,IAAIszE,EAASj5E,KACnBi5E,EAAQj5E,IAAK,EACb0gG,EAAK7lG,KAAKmF,GACVy6B,EAAEunD,KAAKt5B,EAAEg7B,WAAW1jF,GAAIk5E,GACxBz+C,EAAEunD,KAAKt5B,EAAE0+B,aAAapnF,GAAIk5E,IAW5B,OARAz+C,EAAEunD,KAAKt5B,EAAEnY,SAAS,SAASvwC,GACzB0gG,EAAO,GACPxnB,EAAIl5E,GACA0gG,EAAK5oG,QACP6oG,EAAM9lG,KAAK6lG,MAIRC,I,eCzBT,IAAIlmE,EAAI,EAAQ,MA+BhB,SAASmmE,EAAMl4C,EAAG1oD,EAAGmoF,EAAWlP,EAAS4nB,EAAY7d,GAC9CvoD,EAAE90B,IAAIszE,EAASj5E,KAClBi5E,EAAQj5E,IAAK,EAERmoF,GAAanF,EAAInoF,KAAKmF,GAC3By6B,EAAEunD,KAAK6e,EAAW7gG,IAAI,SAAS+pD,GAC7B62C,EAAMl4C,EAAGqB,EAAGo+B,EAAWlP,EAAS4nB,EAAY7d,MAE1CmF,GAAanF,EAAInoF,KAAKmF,IArC9Bf,EAAOC,QAUP,SAAawpD,EAAGk7B,EAAIjG,GACbljD,EAAEp9B,QAAQumF,KACbA,EAAK,CAACA,IAGR,IAAIid,GAAcn4C,EAAEo4C,aAAep4C,EAAEg7B,WAAah7B,EAAE4mC,WAAWv0F,KAAK2tD,GAEhEs6B,EAAM,GACN/J,EAAU,GAQd,OAPAx+C,EAAEunD,KAAK4B,GAAI,SAAS5jF,GAClB,IAAK0oD,EAAE07B,QAAQpkF,GACb,MAAM,IAAIwF,MAAM,6BAA+BxF,GAGjD4gG,EAAMl4C,EAAG1oD,EAAa,SAAV29E,EAAkB1E,EAAS4nB,EAAY7d,MAE9CA,I,eC5BT,IAAI+d,EAAW,EAAQ,MACnBtmE,EAAI,EAAQ,MAEhBx7B,EAAOC,QAEP,SAAqBwpD,EAAGs4C,EAAYC,GAClC,OAAOxmE,EAAE9c,UAAU+qC,EAAEnY,SAAS,SAASyyC,EAAKhjF,GAC1CgjF,EAAIhjF,GAAK+gG,EAASr4C,EAAG1oD,EAAGghG,EAAYC,KACnC,M,eCRL,IAAIxmE,EAAI,EAAQ,MACZymE,EAAgB,EAAQ,MAE5BjiG,EAAOC,QAIP,SAAkBwpD,EAAGr1C,EAAQ2lE,EAAUmoB,GACrC,OAKF,SAAqBz4C,EAAGr1C,EAAQ2lE,EAAUmoB,GACxC,IAEInhG,EAAG0mF,EAFHhX,EAAU,GACV0xB,EAAK,IAAIF,EAGTG,EAAkB,SAASh5C,GAC7B,IAAI0B,EAAI1B,EAAKroD,IAAMA,EAAIqoD,EAAKroD,EAAIqoD,EAAK0B,EACjCmzB,EAASxN,EAAQ3lB,GACjBgvB,EAASC,EAAS3wB,GAClBi5C,EAAW5a,EAAO4a,SAAWvoB,EAEjC,GAAIA,EAAS,EACX,MAAM,IAAIvzE,MAAM,4DACe6iD,EAAO,YAAc0wB,GAGlDuoB,EAAWpkB,EAAOokB,WACpBpkB,EAAOokB,SAAWA,EAClBpkB,EAAOqkB,YAAcvhG,EACrBohG,EAAGI,SAASz3C,EAAGu3C,KAUnB,IANA54C,EAAEnY,QAAQn6B,SAAQ,SAASpW,GACzB,IAAIshG,EAAWthG,IAAMqT,EAAS,EAAInS,OAAOq/E,kBACzC7Q,EAAQ1vE,GAAK,CAAEshG,SAAUA,GACzBF,EAAGx7F,IAAI5F,EAAGshG,MAGLF,EAAG10F,OAAS,IACjB1M,EAAIohG,EAAGK,aACP/a,EAAShX,EAAQ1vE,IACNshG,WAAapgG,OAAOq/E,oBAI/B4gB,EAAOnhG,GAAGoW,QAAQirF,GAGpB,OAAO3xB,EA5CAgyB,CAAYh5C,EAAG7kD,OAAOwP,GAC3B2lE,GAAY2oB,EACZR,GAAU,SAASnhG,GAAK,OAAO0oD,EAAE8G,SAASxvD,MAL9C,IAAI2hG,EAAsBlnE,EAAEsiD,SAAS,I,eCLrC,IAAItiD,EAAI,EAAQ,MACZmnE,EAAS,EAAQ,MAErB3iG,EAAOC,QAEP,SAAoBwpD,GAClB,OAAOjuB,EAAE/4B,OAAOkgG,EAAOl5C,IAAI,SAASg4C,GAClC,OAAOA,EAAK5oG,OAAS,GAAsB,IAAhB4oG,EAAK5oG,QAAgB4wD,EAAEwmC,QAAQwR,EAAK,GAAIA,EAAK,S,eCP5E,IAAIjmE,EAAI,EAAQ,MAEhBx7B,EAAOC,QAIP,SAAuBwpD,EAAGswB,EAAUmoB,GAClC,OAKF,SAA0Bz4C,EAAGswB,EAAUmoB,GACrC,IAAIzxB,EAAU,GACVn/B,EAAQmY,EAAEnY,QAkCd,OAhCAA,EAAMn6B,SAAQ,SAASpW,GACrB0vE,EAAQ1vE,GAAK,GACb0vE,EAAQ1vE,GAAGA,GAAK,CAAEshG,SAAU,GAC5B/wD,EAAMn6B,SAAQ,SAAS2zC,GACjB/pD,IAAM+pD,IACR2lB,EAAQ1vE,GAAG+pD,GAAK,CAAEu3C,SAAUpgG,OAAOq/E,uBAGvC4gB,EAAOnhG,GAAGoW,SAAQ,SAASiyC,GACzB,IAAI0B,EAAI1B,EAAKroD,IAAMA,EAAIqoD,EAAK0B,EAAI1B,EAAKroD,EACjC+I,EAAIiwE,EAAS3wB,GACjBqnB,EAAQ1vE,GAAG+pD,GAAK,CAAEu3C,SAAUv4F,EAAGw4F,YAAavhG,SAIhDuwC,EAAMn6B,SAAQ,SAASrW,GACrB,IAAI8hG,EAAOnyB,EAAQ3vE,GACnBwwC,EAAMn6B,SAAQ,SAASre,GACrB,IAAI+pG,EAAOpyB,EAAQ33E,GACnBw4C,EAAMn6B,SAAQ,SAASvV,GACrB,IAAIkhG,EAAKD,EAAK/hG,GACViiG,EAAKH,EAAKhhG,GACVohG,EAAKH,EAAKjhG,GACVqhG,EAAcH,EAAGT,SAAWU,EAAGV,SAC/BY,EAAcD,EAAGX,WACnBW,EAAGX,SAAWY,EACdD,EAAGV,YAAcS,EAAGT,sBAMrB7xB,EAzCAyyB,CAAiBz5C,EACtBswB,GAAY2oB,EACZR,GAAU,SAASnhG,GAAK,OAAO0oD,EAAE8G,SAASxvD,MAL9C,IAAI2hG,EAAsBlnE,EAAEsiD,SAAS,I,eCJrC99E,EAAOC,QAAU,CACfkjG,WAAY,EAAQ,MACpBrB,SAAU,EAAQ,MAClBsB,YAAa,EAAQ,MACrBC,WAAY,EAAQ,MACpBC,cAAe,EAAQ,MACvBC,UAAW,EAAQ,MACnBra,UAAW,EAAQ,MACnBgG,SAAU,EAAQ,MAClBsU,KAAM,EAAQ,KACdb,OAAQ,EAAQ,MAChBc,QAAS,EAAQ,Q,eCXnB,IAAIA,EAAU,EAAQ,MAEtBzjG,EAAOC,QAEP,SAAmBwpD,GACjB,IACEg6C,EAAQh6C,GACR,MAAOluD,GACP,GAAIA,aAAakoG,EAAQC,eACvB,OAAO,EAET,MAAMnoG,EAER,OAAO,I,eCbT,IAAI0+E,EAAM,EAAQ,MAElBj6E,EAAOC,QAEP,SAAmBwpD,EAAGk7B,GACpB,OAAO1K,EAAIxwB,EAAGk7B,EAAI,U,eCLpB,IAAI1K,EAAM,EAAQ,MAElBj6E,EAAOC,QAEP,SAAkBwpD,EAAGk7B,GACnB,OAAO1K,EAAIxwB,EAAGk7B,EAAI,S,cCLpB,IAAInpD,EAAI,EAAQ,MACZ8gD,EAAQ,EAAQ,KAChB2lB,EAAgB,EAAQ,MAE5BjiG,EAAOC,QAEP,SAAcwpD,EAAGs4C,GACf,IAGIhhG,EAHA6kB,EAAS,IAAI02D,EACbqnB,EAAU,GACVxB,EAAK,IAAIF,EAGb,SAASG,EAAgBh5C,GACvB,IAAI0B,EAAI1B,EAAKroD,IAAMA,EAAIqoD,EAAK0B,EAAI1B,EAAKroD,EACjC6iG,EAAMzB,EAAG0B,SAAS/4C,GACtB,QAAYrwD,IAARmpG,EAAmB,CACrB,IAAIzmB,EAAa4kB,EAAW34C,GACxB+zB,EAAaymB,IACfD,EAAQ74C,GAAK/pD,EACbohG,EAAGI,SAASz3C,EAAGqyB,KAKrB,GAAsB,IAAlB1zB,EAAEozB,YACJ,OAAOj3D,EAGT4V,EAAEunD,KAAKt5B,EAAEnY,SAAS,SAASvwC,GACzBohG,EAAGx7F,IAAI5F,EAAGkB,OAAOq/E,mBACjB17D,EAAO6+C,QAAQ1jE,MAIjBohG,EAAGI,SAAS94C,EAAEnY,QAAQ,GAAI,GAG1B,IADA,IAAIrN,GAAO,EACJk+D,EAAG10F,OAAS,GAAG,CAEpB,GADA1M,EAAIohG,EAAGK,YACHhnE,EAAE90B,IAAIi9F,EAAS5iG,GACjB6kB,EAAOm/C,QAAQhkE,EAAG4iG,EAAQ5iG,QACrB,IAAIkjC,EACT,MAAM,IAAI19B,MAAM,iCAAmCkjD,GAEnDxlB,GAAO,EAGTwlB,EAAE6kC,UAAUvtF,GAAGoW,QAAQirF,GAGzB,OAAOx8E,I,eClDT,IAAI4V,EAAI,EAAQ,MAEhBx7B,EAAOC,QAEP,SAAgBwpD,GACd,IAAItnD,EAAQ,EACR+rE,EAAQ,GACR8L,EAAU,GACVvJ,EAAU,GAEd,SAASwJ,EAAIl5E,GACX,IAAI8oE,EAAQmQ,EAAQj5E,GAAK,CACvB+iG,SAAS,EACTC,QAAS5hG,EACTA,MAAOA,KAaT,GAXA+rE,EAAMtyE,KAAKmF,GAEX0oD,EAAEg7B,WAAW1jF,GAAGoW,SAAQ,SAAS2zC,GAC1BtvB,EAAE90B,IAAIszE,EAASlvB,GAGTkvB,EAAQlvB,GAAGg5C,UACpBj6B,EAAMk6B,QAAU3jG,KAAKwsB,IAAIi9C,EAAMk6B,QAAS/pB,EAAQlvB,GAAG3oD,SAHnD83E,EAAInvB,GACJ+e,EAAMk6B,QAAU3jG,KAAKwsB,IAAIi9C,EAAMk6B,QAAS/pB,EAAQlvB,GAAGi5C,aAMnDl6B,EAAMk6B,UAAYl6B,EAAM1nE,MAAO,CACjC,IACI2oD,EADA22C,EAAO,GAEX,GACE32C,EAAIojB,EAAMta,MACVomB,EAAQlvB,GAAGg5C,SAAU,EACrBrC,EAAK7lG,KAAKkvD,SACH/pD,IAAM+pD,GACf2lB,EAAQ70E,KAAK6lG,IAUjB,OANAh4C,EAAEnY,QAAQn6B,SAAQ,SAASpW,GACpBy6B,EAAE90B,IAAIszE,EAASj5E,IAClBk5E,EAAIl5E,MAID0vE,I,eC7CT,IAAIj1C,EAAI,EAAQ,MAKhB,SAASioE,EAAQh6C,GACf,IAAIuwB,EAAU,GACV9L,EAAQ,GACRuC,EAAU,GAkBd,GAFAj1C,EAAEunD,KAAKt5B,EAAEi0B,SAdT,SAASsmB,EAAMv8E,GACb,GAAI+T,EAAE90B,IAAIwnE,EAAOzmD,GACf,MAAM,IAAIi8E,EAGPloE,EAAE90B,IAAIszE,EAASvyD,KAClBymD,EAAMzmD,IAAQ,EACduyD,EAAQvyD,IAAQ,EAChB+T,EAAEunD,KAAKt5B,EAAE0+B,aAAa1gE,GAAOu8E,UACtB91B,EAAMzmD,GACbgpD,EAAQ70E,KAAK6rB,OAMb+T,EAAE/tB,KAAKusE,KAAavwB,EAAEozB,YACxB,MAAM,IAAI6mB,EAGZ,OAAOjzB,EAGT,SAASizB,KA/BT1jG,EAAOC,QAAUwjG,EACjBA,EAAQC,eAAiBA,EA+BzBA,EAAetoG,UAAY,IAAImL,O,eClC/B,IAAIi1B,EAAI,EAAQ,MAWhB,SAASymE,IACP7nG,KAAKmE,KAAO,GACZnE,KAAK6pG,YAAc,GAXrBjkG,EAAOC,QAAUgiG,EAiBjBA,EAAc7mG,UAAUqS,KAAO,WAC7B,OAAOrT,KAAKmE,KAAK1F,QAMnBopG,EAAc7mG,UAAUyF,KAAO,WAC7B,OAAOzG,KAAKmE,KAAKmD,KAAI,SAASd,GAAK,OAAOA,EAAElH,QAM9CuoG,EAAc7mG,UAAUsL,IAAM,SAAShN,GACrC,OAAO8hC,EAAE90B,IAAItM,KAAK6pG,YAAavqG,IASjCuoG,EAAc7mG,UAAUyoG,SAAW,SAASnqG,GAC1C,IAAIyI,EAAQ/H,KAAK6pG,YAAYvqG,GAC7B,QAAce,IAAV0H,EACF,OAAO/H,KAAKmE,KAAK4D,GAAO0hG,UAQ5B5B,EAAc7mG,UAAUwxB,IAAM,WAC5B,GAAoB,IAAhBxyB,KAAKqT,OACP,MAAM,IAAIlH,MAAM,mBAElB,OAAOnM,KAAKmE,KAAK,GAAG7E,KAWtBuoG,EAAc7mG,UAAUuL,IAAM,SAASjN,EAAKmqG,GAC1C,IAAIK,EAAa9pG,KAAK6pG,YAEtB,GADAvqG,EAAMkL,OAAOlL,IACR8hC,EAAE90B,IAAIw9F,EAAYxqG,GAAM,CAC3B,IAAIf,EAAMyB,KAAKmE,KACX4D,EAAQxJ,EAAIE,OAIhB,OAHAqrG,EAAWxqG,GAAOyI,EAClBxJ,EAAIiD,KAAK,CAAClC,IAAKA,EAAKmqG,SAAUA,IAC9BzpG,KAAK+pG,UAAUhiG,IACR,EAET,OAAO,GAMT8/F,EAAc7mG,UAAUonG,UAAY,WAClCpoG,KAAKgqG,MAAM,EAAGhqG,KAAKmE,KAAK1F,OAAS,GACjC,IAAI+zB,EAAMxyB,KAAKmE,KAAKq1D,MAGpB,cAFOx5D,KAAK6pG,YAAYr3E,EAAIlzB,KAC5BU,KAAKiqG,SAAS,GACPz3E,EAAIlzB,KAUbuoG,EAAc7mG,UAAUmnG,SAAW,SAAS7oG,EAAKmqG,GAC/C,IAAI1hG,EAAQ/H,KAAK6pG,YAAYvqG,GAC7B,GAAImqG,EAAWzpG,KAAKmE,KAAK4D,GAAO0hG,SAC9B,MAAM,IAAIt9F,MAAM,uDACF7M,EAAM,SAAWU,KAAKmE,KAAK4D,GAAO0hG,SAAW,SAAWA,GAExEzpG,KAAKmE,KAAK4D,GAAO0hG,SAAWA,EAC5BzpG,KAAK+pG,UAAUhiG,IAGjB8/F,EAAc7mG,UAAUipG,SAAW,SAASvrG,GAC1C,IAAIH,EAAMyB,KAAKmE,KACX2mC,EAAI,EAAIpsC,EACR0lB,EAAI0mB,EAAI,EACRo/D,EAAUxrG,EACVosC,EAAIvsC,EAAIE,SACVyrG,EAAU3rG,EAAIusC,GAAG2+D,SAAWlrG,EAAI2rG,GAAST,SAAW3+D,EAAIo/D,EACpD9lF,EAAI7lB,EAAIE,SACVyrG,EAAU3rG,EAAI6lB,GAAGqlF,SAAWlrG,EAAI2rG,GAAST,SAAWrlF,EAAI8lF,GAEtDA,IAAYxrG,IACdsB,KAAKgqG,MAAMtrG,EAAGwrG,GACdlqG,KAAKiqG,SAASC,MAKpBrC,EAAc7mG,UAAU+oG,UAAY,SAAShiG,GAI3C,IAHA,IAEIoN,EAFA5W,EAAMyB,KAAKmE,KACXslG,EAAWlrG,EAAIwJ,GAAO0hG,SAET,IAAV1hG,KAEDxJ,EADJ4W,EAASpN,GAAS,GACF0hG,SAAWA,IAG3BzpG,KAAKgqG,MAAMjiG,EAAOoN,GAClBpN,EAAQoN,GAIZ0yF,EAAc7mG,UAAUgpG,MAAQ,SAAStrG,EAAG8I,GAC1C,IAAIjJ,EAAMyB,KAAKmE,KACX2lG,EAAa9pG,KAAK6pG,YAClBM,EAAW5rG,EAAIG,GACf0rG,EAAW7rG,EAAIiJ,GACnBjJ,EAAIG,GAAK0rG,EACT7rG,EAAIiJ,GAAK2iG,EACTL,EAAWM,EAAS9qG,KAAOZ,EAC3BorG,EAAWK,EAAS7qG,KAAOkI,I,2BCpJ7B,IAAI45B,EAAI,EAAQ,MAEhBx7B,EAAOC,QAAUq8E,EAEjB,IACImoB,EAAa,KAajB,SAASnoB,EAAMqC,GACbvkF,KAAKsqG,aAAclpE,EAAE90B,IAAIi4E,EAAM,aAAcA,EAAK+P,SAClDt0F,KAAKuqG,gBAAgBnpE,EAAE90B,IAAIi4E,EAAM,eAAgBA,EAAKzb,WACtD9oE,KAAKwqG,cAAcppE,EAAE90B,IAAIi4E,EAAM,aAAcA,EAAKjC,SAGlDtiF,KAAKyqC,YAASpqC,EAGdL,KAAKyqG,oBAAsBrpE,EAAEsiD,cAASrjF,GAGtCL,KAAK0qG,oBAAsBtpE,EAAEsiD,cAASrjF,GAGtCL,KAAK2qG,OAAS,GAEV3qG,KAAKwqG,cAEPxqG,KAAK4qG,QAAU,GAGf5qG,KAAK2qC,UAAY,GACjB3qC,KAAK2qC,UAAU0/D,MAAc,IAI/BrqG,KAAK8yB,IAAM,GAGX9yB,KAAK6qG,OAAS,GAGd7qG,KAAK8qG,KAAO,GAGZ9qG,KAAK+qG,MAAQ,GAGb/qG,KAAKgrG,UAAY,GAGjBhrG,KAAKirG,YAAc,GA4arB,SAASC,EAAqB5jG,EAAKZ,GAC7BY,EAAIZ,GACNY,EAAIZ,KAEJY,EAAIZ,GAAK,EAIb,SAASykG,EAAuB7jG,EAAKZ,KAC5BY,EAAIZ,WAAaY,EAAIZ,GAG9B,SAAS0kG,EAAa3D,EAAY4D,EAAIC,EAAI5lG,GACxC,IAAIiB,EAAI,GAAK0kG,EACT36C,EAAI,GAAK46C,EACb,IAAK7D,GAAc9gG,EAAI+pD,EAAG,CACxB,IAAIrqD,EAAMM,EACVA,EAAI+pD,EACJA,EAAIrqD,EAEN,OAAOM,EAtfY,IAsfS+pD,EAtfT,KAufPtvB,EAAEynD,YAAYnjF,GAzfJ,KAyfgCA,GAGxD,SAAS6lG,EAAc9D,EAAY4D,EAAIC,EAAI5lG,GACzC,IAAIiB,EAAI,GAAK0kG,EACT36C,EAAI,GAAK46C,EACb,IAAK7D,GAAc9gG,EAAI+pD,EAAG,CACxB,IAAIrqD,EAAMM,EACVA,EAAI+pD,EACJA,EAAIrqD,EAEN,IAAI6jF,EAAW,CAAEvjF,EAAGA,EAAG+pD,EAAGA,GAI1B,OAHIhrD,IACFwkF,EAAQxkF,KAAOA,GAEVwkF,EAGT,SAASshB,EAAY/D,EAAYvd,GAC/B,OAAOkhB,EAAa3D,EAAYvd,EAAQvjF,EAAGujF,EAAQx5B,EAAGw5B,EAAQxkF,MAhdhEw8E,EAAMlhF,UAAUyqG,WAAa,EAG7BvpB,EAAMlhF,UAAU0qG,WAAa,EAK7BxpB,EAAMlhF,UAAUymG,WAAa,WAC3B,OAAOznG,KAAKsqG,aAGdpoB,EAAMlhF,UAAU21F,aAAe,WAC7B,OAAO32F,KAAKuqG,eAGdroB,EAAMlhF,UAAU2qG,WAAa,WAC3B,OAAO3rG,KAAKwqG,aAGdtoB,EAAMlhF,UAAUwnE,SAAW,SAASntC,GAElC,OADAr7B,KAAKyqC,OAASpP,EACPr7B,MAGTkiF,EAAMlhF,UAAUy0C,MAAQ,WACtB,OAAOz1C,KAAKyqC,QAMdy3C,EAAMlhF,UAAUiqF,oBAAsB,SAAS2gB,GAK7C,OAJKxqE,EAAEyqE,WAAWD,KAChBA,EAAaxqE,EAAEsiD,SAASkoB,IAE1B5rG,KAAKyqG,oBAAsBmB,EACpB5rG,MAGTkiF,EAAMlhF,UAAUyhF,UAAY,WAC1B,OAAOziF,KAAKyrG,YAGdvpB,EAAMlhF,UAAUk2C,MAAQ,WACtB,OAAO9V,EAAE36B,KAAKzG,KAAK2qG,SAGrBzoB,EAAMlhF,UAAUqiF,QAAU,WACxB,IAAIvkF,EAAOkB,KACX,OAAOohC,EAAE/4B,OAAOrI,KAAKk3C,SAAS,SAASvwC,GACrC,OAAOy6B,EAAE0qE,QAAQhtG,EAAKg0B,IAAInsB,QAI9Bu7E,EAAMlhF,UAAUsiF,MAAQ,WACtB,IAAIxkF,EAAOkB,KACX,OAAOohC,EAAE/4B,OAAOrI,KAAKk3C,SAAS,SAASvwC,GACrC,OAAOy6B,EAAE0qE,QAAQhtG,EAAKgsG,KAAKnkG,QAI/Bu7E,EAAMlhF,UAAU+qG,SAAW,SAASxhB,EAAI9qF,GACtC,IAAIQ,EAAOC,UACPpB,EAAOkB,KAQX,OAPAohC,EAAEunD,KAAK4B,GAAI,SAAS5jF,GACd1G,EAAKxB,OAAS,EAChBK,EAAKurE,QAAQ1jE,EAAGlH,GAEhBX,EAAKurE,QAAQ1jE,MAGV3G,MAGTkiF,EAAMlhF,UAAUqpE,QAAU,SAAS1jE,EAAGlH,GACpC,OAAI2hC,EAAE90B,IAAItM,KAAK2qG,OAAQhkG,IACjBzG,UAAUzB,OAAS,IACrBuB,KAAK2qG,OAAOhkG,GAAKlH,GAEZO,OAGTA,KAAK2qG,OAAOhkG,GAAKzG,UAAUzB,OAAS,EAAIgB,EAAQO,KAAKyqG,oBAAoB9jG,GACrE3G,KAAKwqG,cACPxqG,KAAK4qG,QAAQjkG,GAAK0jG,EAClBrqG,KAAK2qC,UAAUhkC,GAAK,GACpB3G,KAAK2qC,UAAU0/D,MAAY1jG,IAAK,GAElC3G,KAAK8yB,IAAInsB,GAAK,GACd3G,KAAK6qG,OAAOlkG,GAAK,GACjB3G,KAAK8qG,KAAKnkG,GAAK,GACf3G,KAAK+qG,MAAMpkG,GAAK,KACd3G,KAAKyrG,WACAzrG,OAGTkiF,EAAMlhF,UAAUqsB,KAAO,SAAS1mB,GAC9B,OAAO3G,KAAK2qG,OAAOhkG,IAGrBu7E,EAAMlhF,UAAU+pF,QAAU,SAASpkF,GACjC,OAAOy6B,EAAE90B,IAAItM,KAAK2qG,OAAQhkG,IAG5Bu7E,EAAMlhF,UAAUuiF,WAAc,SAAS58E,GACrC,IAAI7H,EAAOkB,KACX,GAAIohC,EAAE90B,IAAItM,KAAK2qG,OAAQhkG,GAAI,CACzB,IAAIo5E,EAAa,SAAS5+E,GAAKrC,EAAKihF,WAAWjhF,EAAKksG,UAAU7pG,YACvDnB,KAAK2qG,OAAOhkG,GACf3G,KAAKwqG,cACPxqG,KAAKgsG,4BAA4BrlG,UAC1B3G,KAAK4qG,QAAQjkG,GACpBy6B,EAAEunD,KAAK3oF,KAAK8Q,SAASnK,IAAI,SAASwiF,GAChCrqF,EAAK8hF,UAAUuI,aAEVnpF,KAAK2qC,UAAUhkC,IAExBy6B,EAAEunD,KAAKvnD,EAAE36B,KAAKzG,KAAK8yB,IAAInsB,IAAKo5E,UACrB//E,KAAK8yB,IAAInsB,UACT3G,KAAK6qG,OAAOlkG,GACnBy6B,EAAEunD,KAAKvnD,EAAE36B,KAAKzG,KAAK8qG,KAAKnkG,IAAKo5E,UACtB//E,KAAK8qG,KAAKnkG,UACV3G,KAAK+qG,MAAMpkG,KAChB3G,KAAKyrG,WAET,OAAOzrG,MAGTkiF,EAAMlhF,UAAU4/E,UAAY,SAASj6E,EAAGwO,GACtC,IAAKnV,KAAKwqG,YACR,MAAM,IAAIr+F,MAAM,6CAGlB,GAAIi1B,EAAEynD,YAAY1zE,GAChBA,EAASk1F,MACJ,CAGL,IAAK,IAAI4B,EADT92F,GAAU,IAEPisB,EAAEynD,YAAYojB,GACfA,EAAWjsG,KAAKmV,OAAO82F,GACvB,GAAIA,IAAatlG,EACf,MAAM,IAAIwF,MAAM,WAAagJ,EAAQ,iBAAmBxO,EACxC,yBAIpB3G,KAAKqqE,QAAQl1D,GAOf,OAJAnV,KAAKqqE,QAAQ1jE,GACb3G,KAAKgsG,4BAA4BrlG,GACjC3G,KAAK4qG,QAAQjkG,GAAKwO,EAClBnV,KAAK2qC,UAAUx1B,GAAQxO,IAAK,EACrB3G,MAGTkiF,EAAMlhF,UAAUgrG,4BAA8B,SAASrlG,UAC9C3G,KAAK2qC,UAAU3qC,KAAK4qG,QAAQjkG,IAAIA,IAGzCu7E,EAAMlhF,UAAUmU,OAAS,SAASxO,GAChC,GAAI3G,KAAKwqG,YAAa,CACpB,IAAIr1F,EAASnV,KAAK4qG,QAAQjkG,GAC1B,GAAIwO,IAAWk1F,EACb,OAAOl1F,IAKb+sE,EAAMlhF,UAAU8P,SAAW,SAASnK,GAKlC,GAJIy6B,EAAEynD,YAAYliF,KAChBA,EAAI0jG,GAGFrqG,KAAKwqG,YAAa,CACpB,IAAI15F,EAAW9Q,KAAK2qC,UAAUhkC,GAC9B,GAAImK,EACF,OAAOswB,EAAE36B,KAAKqK,OAEX,IAAInK,IAAM0jG,EACf,OAAOrqG,KAAKk3C,QACP,GAAIl3C,KAAK+qF,QAAQpkF,GACtB,MAAO,KAIXu7E,EAAMlhF,UAAU+sF,aAAe,SAASpnF,GACtC,IAAIulG,EAASlsG,KAAK6qG,OAAOlkG,GACzB,GAAIulG,EACF,OAAO9qE,EAAE36B,KAAKylG,IAIlBhqB,EAAMlhF,UAAUqpF,WAAa,SAAS1jF,GACpC,IAAIwlG,EAAQnsG,KAAK+qG,MAAMpkG,GACvB,GAAIwlG,EACF,OAAO/qE,EAAE36B,KAAK0lG,IAIlBjqB,EAAMlhF,UAAUi1F,UAAY,SAAStvF,GACnC,IAAIqwF,EAAQh3F,KAAK+tF,aAAapnF,GAC9B,GAAIqwF,EACF,OAAO51D,EAAEgrE,MAAMpV,EAAOh3F,KAAKqqF,WAAW1jF,KAI1Cu7E,EAAMlhF,UAAUqrG,OAAS,SAAU1lG,GAOjC,OAA4B,KALxB3G,KAAKynG,aACKznG,KAAKqqF,WAAW1jF,GAEhB3G,KAAKi2F,UAAUtvF,IAEZlI,QAGnByjF,EAAMlhF,UAAUsrG,YAAc,SAASjkG,GACrC,IAAIokB,EAAO,IAAIzsB,KAAK2D,YAAY,CAC9B2wF,SAAUt0F,KAAKsqG,YACfxhC,WAAY9oE,KAAKuqG,cACjBjoB,SAAUtiF,KAAKwqG,cAGjB/9E,EAAK+7C,SAASxoE,KAAKy1C,SAEnB,IAAI32C,EAAOkB,KACXohC,EAAEunD,KAAK3oF,KAAK2qG,QAAQ,SAASlrG,EAAOkH,GAC9B0B,EAAO1B,IACT8lB,EAAK49C,QAAQ1jE,EAAGlH,MAIpB2hC,EAAEunD,KAAK3oF,KAAKgrG,WAAW,SAAS7pG,GAC1BsrB,EAAKs+D,QAAQ5pF,EAAEwF,IAAM8lB,EAAKs+D,QAAQ5pF,EAAEuvD,IACtCjkC,EAAKk+C,QAAQxpE,EAAGrC,EAAKkwD,KAAK7tD,OAI9B,IAAIooG,EAAU,GACd,SAASgD,EAAW5lG,GAClB,IAAIwO,EAASrW,EAAKqW,OAAOxO,GACzB,YAAetG,IAAX8U,GAAwBsX,EAAKs+D,QAAQ51E,IACvCo0F,EAAQ5iG,GAAKwO,EACNA,GACEA,KAAUo0F,EACZA,EAAQp0F,GAERo3F,EAAWp3F,GAUtB,OANInV,KAAKwqG,aACPppE,EAAEunD,KAAKl8D,EAAKyqB,SAAS,SAASvwC,GAC5B8lB,EAAKm0D,UAAUj6E,EAAG4lG,EAAW5lG,OAI1B8lB,GAKTy1D,EAAMlhF,UAAUynE,oBAAsB,SAASmjC,GAK7C,OAJKxqE,EAAEyqE,WAAWD,KAChBA,EAAaxqE,EAAEsiD,SAASkoB,IAE1B5rG,KAAK0qG,oBAAsBkB,EACpB5rG,MAGTkiF,EAAMlhF,UAAUwrG,UAAY,WAC1B,OAAOxsG,KAAK0rG,YAGdxpB,EAAMlhF,UAAUg2C,MAAQ,WACtB,OAAO5V,EAAEt1B,OAAO9L,KAAKgrG,YAGvB9oB,EAAMlhF,UAAUyrG,QAAU,SAASliB,EAAI9qF,GACrC,IAAIX,EAAOkB,KACPC,EAAOC,UASX,OARAkhC,EAAE35B,OAAO8iF,GAAI,SAAS5jF,EAAG+pD,GAMvB,OALIzwD,EAAKxB,OAAS,EAChBK,EAAK6rE,QAAQhkE,EAAG+pD,EAAGjxD,GAEnBX,EAAK6rE,QAAQhkE,EAAG+pD,GAEXA,KAEF1wD,MAOTkiF,EAAMlhF,UAAU2pE,QAAU,WACxB,IAAIhkE,EAAG+pD,EAAGhrD,EAAMjG,EACZitG,GAAiB,EACjBC,EAAOzsG,UAAU,GAED,iBAATysG,GAA8B,OAATA,GAAiB,MAAOA,GACtDhmG,EAAIgmG,EAAKhmG,EACT+pD,EAAIi8C,EAAKj8C,EACThrD,EAAOinG,EAAKjnG,KACa,IAArBxF,UAAUzB,SACZgB,EAAQS,UAAU,GAClBwsG,GAAiB,KAGnB/lG,EAAIgmG,EACJj8C,EAAIxwD,UAAU,GACdwF,EAAOxF,UAAU,GACbA,UAAUzB,OAAS,IACrBgB,EAAQS,UAAU,GAClBwsG,GAAiB,IAIrB/lG,EAAI,GAAKA,EACT+pD,EAAI,GAAKA,EACJtvB,EAAEynD,YAAYnjF,KACjBA,EAAO,GAAKA,GAGd,IAAIvE,EAAIiqG,EAAaprG,KAAKsqG,YAAa3jG,EAAG+pD,EAAGhrD,GAC7C,GAAI07B,EAAE90B,IAAItM,KAAKirG,YAAa9pG,GAI1B,OAHIurG,IACF1sG,KAAKirG,YAAY9pG,GAAK1B,GAEjBO,KAGT,IAAKohC,EAAEynD,YAAYnjF,KAAU1F,KAAKuqG,cAChC,MAAM,IAAIp+F,MAAM,qDAKlBnM,KAAKqqE,QAAQ1jE,GACb3G,KAAKqqE,QAAQ3Z,GAEb1wD,KAAKirG,YAAY9pG,GAAKurG,EAAiBjtG,EAAQO,KAAK0qG,oBAAoB/jG,EAAG+pD,EAAGhrD,GAE9E,IAAIwkF,EAAUqhB,EAAcvrG,KAAKsqG,YAAa3jG,EAAG+pD,EAAGhrD,GAYpD,OAVAiB,EAAIujF,EAAQvjF,EACZ+pD,EAAIw5B,EAAQx5B,EAEZvuD,OAAO4C,OAAOmlF,GACdlqF,KAAKgrG,UAAU7pG,GAAK+oF,EACpBghB,EAAqBlrG,KAAK6qG,OAAOn6C,GAAI/pD,GACrCukG,EAAqBlrG,KAAK+qG,MAAMpkG,GAAI+pD,GACpC1wD,KAAK8yB,IAAI49B,GAAGvvD,GAAK+oF,EACjBlqF,KAAK8qG,KAAKnkG,GAAGxF,GAAK+oF,EAClBlqF,KAAK0rG,aACE1rG,MAGTkiF,EAAMlhF,UAAUguD,KAAO,SAASroD,EAAG+pD,EAAGhrD,GACpC,IAAIvE,EAA0B,IAArBjB,UAAUzB,OACf+sG,EAAYxrG,KAAKsqG,YAAapqG,UAAU,IACxCkrG,EAAaprG,KAAKsqG,YAAa3jG,EAAG+pD,EAAGhrD,GACzC,OAAO1F,KAAKirG,YAAY9pG,IAG1B+gF,EAAMlhF,UAAU60F,QAAU,SAASlvF,EAAG+pD,EAAGhrD,GACvC,IAAIvE,EAA0B,IAArBjB,UAAUzB,OACf+sG,EAAYxrG,KAAKsqG,YAAapqG,UAAU,IACxCkrG,EAAaprG,KAAKsqG,YAAa3jG,EAAG+pD,EAAGhrD,GACzC,OAAO07B,EAAE90B,IAAItM,KAAKirG,YAAa9pG,IAGjC+gF,EAAMlhF,UAAU++E,WAAa,SAASp5E,EAAG+pD,EAAGhrD,GAC1C,IAAIvE,EAA0B,IAArBjB,UAAUzB,OACf+sG,EAAYxrG,KAAKsqG,YAAapqG,UAAU,IACxCkrG,EAAaprG,KAAKsqG,YAAa3jG,EAAG+pD,EAAGhrD,GACrCspD,EAAOhvD,KAAKgrG,UAAU7pG,GAY1B,OAXI6tD,IACFroD,EAAIqoD,EAAKroD,EACT+pD,EAAI1B,EAAK0B,SACF1wD,KAAKirG,YAAY9pG,UACjBnB,KAAKgrG,UAAU7pG,GACtBgqG,EAAuBnrG,KAAK6qG,OAAOn6C,GAAI/pD,GACvCwkG,EAAuBnrG,KAAK+qG,MAAMpkG,GAAI+pD,UAC/B1wD,KAAK8yB,IAAI49B,GAAGvvD,UACZnB,KAAK8qG,KAAKnkG,GAAGxF,GACpBnB,KAAK0rG,cAEA1rG,MAGTkiF,EAAMlhF,UAAUq1D,QAAU,SAAS1vD,EAAG+hE,GACpC,IAAIiiB,EAAM3qF,KAAK8yB,IAAInsB,GACnB,GAAIgkF,EAAK,CACP,IAAI3zC,EAAQ5V,EAAEt1B,OAAO6+E,GACrB,OAAKjiB,EAGEtnC,EAAE/4B,OAAO2uC,GAAO,SAASgY,GAAQ,OAAOA,EAAKroD,IAAM+hE,KAFjD1xB,IAMbkrC,EAAMlhF,UAAUm1D,SAAW,SAASxvD,EAAG+pD,GACrC,IAAIk8C,EAAO5sG,KAAK8qG,KAAKnkG,GACrB,GAAIimG,EAAM,CACR,IAAI51D,EAAQ5V,EAAEt1B,OAAO8gG,GACrB,OAAKl8C,EAGEtvB,EAAE/4B,OAAO2uC,GAAO,SAASgY,GAAQ,OAAOA,EAAK0B,IAAMA,KAFjD1Z,IAMbkrC,EAAMlhF,UAAUkzF,UAAY,SAASvtF,EAAG+pD,GACtC,IAAI2F,EAAUr2D,KAAKq2D,QAAQ1vD,EAAG+pD,GAC9B,GAAI2F,EACF,OAAOA,EAAQ3qD,OAAO1L,KAAKm2D,SAASxvD,EAAG+pD,M,eCre3C9qD,EAAOC,QAAU,CACfq8E,MAAO,EAAQ,KACf5C,QAAS,EAAQ,Q,eCHnB,IAAIl+C,EAAI,EAAQ,MACZ8gD,EAAQ,EAAQ,KAuBpB,SAAS2qB,EAAWx9C,GAClB,OAAOjuB,EAAE95B,IAAI+nD,EAAEnY,SAAS,SAASvwC,GAC/B,IAAImmG,EAAYz9C,EAAEhiC,KAAK1mB,GACnBwO,EAASk6C,EAAEl6C,OAAOxO,GAClB0mB,EAAO,CAAE1mB,EAAGA,GAOhB,OANKy6B,EAAEynD,YAAYikB,KACjBz/E,EAAK5tB,MAAQqtG,GAEV1rE,EAAEynD,YAAY1zE,KACjBkY,EAAKlY,OAASA,GAETkY,KAIX,SAAS0/E,EAAW19C,GAClB,OAAOjuB,EAAE95B,IAAI+nD,EAAErY,SAAS,SAAS71C,GAC/B,IAAI6rG,EAAY39C,EAAEL,KAAK7tD,GACnB6tD,EAAO,CAAEroD,EAAGxF,EAAEwF,EAAG+pD,EAAGvvD,EAAEuvD,GAO1B,OANKtvB,EAAEynD,YAAY1nF,EAAEuE,QACnBspD,EAAKtpD,KAAOvE,EAAEuE,MAEX07B,EAAEynD,YAAYmkB,KACjBh+C,EAAKvvD,MAAQutG,GAERh+C,KA9CXppD,EAAOC,QAAU,CACfonG,MAIF,SAAe59C,GACb,IAAI83C,EAAO,CACThsF,QAAS,CACPm5E,SAAUjlC,EAAEo4C,aACZ3+B,WAAYzZ,EAAEsnC,eACdrU,SAAUjzB,EAAEs8C,cAEdz0D,MAAO21D,EAAWx9C,GAClBrY,MAAO+1D,EAAW19C,IAKpB,OAHKjuB,EAAEynD,YAAYx5B,EAAE5Z,WACnB0xD,EAAK1nG,MAAQ2hC,EAAE6iE,MAAM50C,EAAE5Z,UAElB0xD,GAhBP+F,KAgDF,SAAc/F,GACZ,IAAI93C,EAAI,IAAI6yB,EAAMilB,EAAKhsF,SAASqtD,SAAS2+B,EAAK1nG,OAU9C,OATA2hC,EAAEunD,KAAKwe,EAAKjwD,OAAO,SAASu4B,GAC1BpgB,EAAEgb,QAAQoF,EAAM9oE,EAAG8oE,EAAMhwE,OACrBgwE,EAAMt6D,QACRk6C,EAAEuxB,UAAUnR,EAAM9oE,EAAG8oE,EAAMt6D,WAG/BisB,EAAEunD,KAAKwe,EAAKnwD,OAAO,SAASy4B,GAC1BpgB,EAAEsb,QAAQ,CAAEhkE,EAAG8oE,EAAM9oE,EAAG+pD,EAAG+e,EAAM/e,EAAGhrD,KAAM+pE,EAAM/pE,MAAQ+pE,EAAMhwE,UAEzD4vD,K,eC9DT,IAAIo5B,EAGF,IACEA,EAAS,CACPwb,MAAO,EAAQ,MACfvgB,SAAU,EAAQ,MAClBiF,KAAM,EAAQ,MACdtgF,OAAQ,EAAQ,MAChBiE,IAAM,EAAQ,MACdtI,QAAS,EAAQ,MACjB8nG,QAAS,EAAQ,MACjBD,WAAY,EAAQ,MACpBhjB,YAAa,EAAQ,MACrBpiF,KAAM,EAAQ,MACda,IAAK,EAAQ,MACbG,OAAQ,EAAQ,MAChB4L,KAAM,EAAQ,MACdiR,UAAW,EAAQ,MACnB8nF,MAAO,EAAQ,MACftgG,OAAQ,EAAQ,OAElB,MAAO3K,IAKNsnF,IACHA,EAASx8E,OAAOm1B,GAGlBx7B,EAAOC,QAAU4iF,G,SCjCjB7iF,EAAOC,QAAU,S,SCKjBD,EAAOC,QAAU,SAASsnG,EAAa5rG,EAAGmG,GACzC,aACA,IAeC0lG,EAAQC,EAfLtzE,EAAK,8EACRuzE,EAAM,iBACNC,EAAM,iHACNC,EAAM,iBACNC,EAAM,KACN/uG,EAAI,SAASqnC,GAAK,OAAOonE,EAAYO,cAAgB,GAAK3nE,GAAGkyC,eAAiB,GAAKlyC,GAEnFv/B,EAAI9H,EAAE6C,GAAGskB,QAAQynF,EAAK,KAAO,GAC7B/lG,EAAI7I,EAAEgJ,GAAGme,QAAQynF,EAAK,KAAO,GAE7BK,EAAKnnG,EAAEqf,QAAQkU,EAAI,UAAUlU,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAIiH,MAAM,MACvE8gF,EAAKrmG,EAAEse,QAAQkU,EAAI,UAAUlU,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAIiH,MAAM,MAEvE+gF,EAAK/kG,SAAStC,EAAEo3E,MAAM4vB,GAAM,KAAsB,IAAdG,EAAGlvG,QAAgB+H,EAAEo3E,MAAM2vB,IAAQn5F,KAAK8I,MAAM1W,GAClFsnG,EAAKhlG,SAASvB,EAAEq2E,MAAM4vB,GAAM,KAAOK,GAAMtmG,EAAEq2E,MAAM2vB,IAAQn5F,KAAK8I,MAAM3V,IAAM,KAG3E,GAAIumG,EAAI,CACP,GAAKD,EAAKC,EAAO,OAAQ,EACpB,GAAKD,EAAKC,EAAO,OAAO,EAG9B,IAAI,IAAIC,EAAK,EAAGC,EAAKhoG,KAAKyJ,IAAIk+F,EAAGlvG,OAAQmvG,EAAGnvG,QAASsvG,EAAOC,EAAMD,IAAQ,CAKzE,GAHAX,IAAWO,EAAGI,IAAS,IAAInwB,MAAM6vB,IAAQpoF,WAAWsoF,EAAGI,KAAUJ,EAAGI,IAAS,EAC7EV,IAAWO,EAAGG,IAAS,IAAInwB,MAAM6vB,IAAQpoF,WAAWuoF,EAAGG,KAAUH,EAAGG,IAAS,EAEzErlG,MAAM0kG,KAAY1kG,MAAM2kG,GAAW,OAAQ3kG,MAAM0kG,GAAW,GAAK,EAMrE,UAJgBA,UAAkBC,IACjCD,GAAU,GACVC,GAAU,IAEPD,EAASC,EAAU,OAAQ,EAC/B,GAAID,EAASC,EAAU,OAAO,EAE/B,OAAO,I,eC3CR,IAIIY,EAJY,EAAQ,IAITC,CAHJ,EAAQ,MAGY,YAE/BtoG,EAAOC,QAAUooG,G,eCNjB,IAAIE,EAAY,EAAQ,MACpBC,EAAa,EAAQ,KACrBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAStB,SAASC,EAAKjgG,GACZ,IAAIxG,GAAS,EACTtJ,EAAoB,MAAX8P,EAAkB,EAAIA,EAAQ9P,OAG3C,IADAuB,KAAKw+B,UACIz2B,EAAQtJ,GAAQ,CACvB,IAAIgxE,EAAQlhE,EAAQxG,GACpB/H,KAAKwpE,IAAIiG,EAAM,GAAIA,EAAM,KAK7B++B,EAAKxtG,UAAUw9B,MAAQ2vE,EACvBK,EAAKxtG,UAAkB,OAAIotG,EAC3BI,EAAKxtG,UAAU6B,IAAMwrG,EACrBG,EAAKxtG,UAAUsL,IAAMgiG,EACrBE,EAAKxtG,UAAUwoE,IAAM+kC,EAErB3oG,EAAOC,QAAU2oG,G,eC/BjB,IAAIC,EAAiB,EAAQ,MACzBC,EAAkB,EAAQ,MAC1BC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,MAS3B,SAASC,EAAUvgG,GACjB,IAAIxG,GAAS,EACTtJ,EAAoB,MAAX8P,EAAkB,EAAIA,EAAQ9P,OAG3C,IADAuB,KAAKw+B,UACIz2B,EAAQtJ,GAAQ,CACvB,IAAIgxE,EAAQlhE,EAAQxG,GACpB/H,KAAKwpE,IAAIiG,EAAM,GAAIA,EAAM,KAK7Bq/B,EAAU9tG,UAAUw9B,MAAQiwE,EAC5BK,EAAU9tG,UAAkB,OAAI0tG,EAChCI,EAAU9tG,UAAU6B,IAAM8rG,EAC1BG,EAAU9tG,UAAUsL,IAAMsiG,EAC1BE,EAAU9tG,UAAUwoE,IAAMqlC,EAE1BjpG,EAAOC,QAAUipG,G,eC/BjB,IAIIxlC,EAJY,EAAQ,IAId4kC,CAHC,EAAQ,MAGO,OAE1BtoG,EAAOC,QAAUyjE,G,eCNjB,IAAIylC,EAAgB,EAAQ,MACxBC,EAAiB,EAAQ,MACzBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,MACtBC,EAAc,EAAQ,MAS1B,SAASC,EAAS7gG,GAChB,IAAIxG,GAAS,EACTtJ,EAAoB,MAAX8P,EAAkB,EAAIA,EAAQ9P,OAG3C,IADAuB,KAAKw+B,UACIz2B,EAAQtJ,GAAQ,CACvB,IAAIgxE,EAAQlhE,EAAQxG,GACpB/H,KAAKwpE,IAAIiG,EAAM,GAAIA,EAAM,KAK7B2/B,EAASpuG,UAAUw9B,MAAQuwE,EAC3BK,EAASpuG,UAAkB,OAAIguG,EAC/BI,EAASpuG,UAAU6B,IAAMosG,EACzBG,EAASpuG,UAAUsL,IAAM4iG,EACzBE,EAASpuG,UAAUwoE,IAAM2lC,EAEzBvpG,EAAOC,QAAUupG,G,eC/BjB,IAIIxvG,EAJY,EAAQ,IAIVsuG,CAHH,EAAQ,MAGW,WAE9BtoG,EAAOC,QAAUjG,G,eCNjB,IAIIwhE,EAJY,EAAQ,IAId8sC,CAHC,EAAQ,MAGO,OAE1BtoG,EAAOC,QAAUu7D,G,eCNjB,IAAIguC,EAAW,EAAQ,MACnBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,MAU1B,SAASC,EAASzjG,GAChB,IAAI/D,GAAS,EACTtJ,EAAmB,MAAVqN,EAAiB,EAAIA,EAAOrN,OAGzC,IADAuB,KAAKwvG,SAAW,IAAIJ,IACXrnG,EAAQtJ,GACfuB,KAAKuM,IAAIT,EAAO/D,IAKpBwnG,EAASvuG,UAAUuL,IAAMgjG,EAASvuG,UAAUQ,KAAO6tG,EACnDE,EAASvuG,UAAUsL,IAAMgjG,EAEzB1pG,EAAOC,QAAU0pG,G,eC1BjB,IAAIT,EAAY,EAAQ,MACpBW,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MACtBC,EAAW,EAAQ,MACnBC,EAAW,EAAQ,MACnBC,EAAW,EAAQ,MASvB,SAASC,EAAMvhG,GACb,IAAIsJ,EAAO7X,KAAKwvG,SAAW,IAAIV,EAAUvgG,GACzCvO,KAAKqT,KAAOwE,EAAKxE,KAInBy8F,EAAM9uG,UAAUw9B,MAAQixE,EACxBK,EAAM9uG,UAAkB,OAAI0uG,EAC5BI,EAAM9uG,UAAU6B,IAAM8sG,EACtBG,EAAM9uG,UAAUsL,IAAMsjG,EACtBE,EAAM9uG,UAAUwoE,IAAMqmC,EAEtBjqG,EAAOC,QAAUiqG,G,eC1BjB,IAGI7rG,EAHO,EAAQ,MAGDA,OAElB2B,EAAOC,QAAU5B,G,eCLjB,IAGIugC,EAHO,EAAQ,MAGGA,WAEtB5+B,EAAOC,QAAU2+B,G,cCLjB,IAIIurE,EAJY,EAAQ,IAIV7B,CAHH,EAAQ,MAGW,WAE9BtoG,EAAOC,QAAUkqG,G,SCcjBnqG,EAAOC,QAVP,SAAe0E,EAAMylG,EAAS/vG,GAC5B,OAAQA,EAAKxB,QACX,KAAK,EAAG,OAAO8L,EAAKrJ,KAAK8uG,GACzB,KAAK,EAAG,OAAOzlG,EAAKrJ,KAAK8uG,EAAS/vG,EAAK,IACvC,KAAK,EAAG,OAAOsK,EAAKrJ,KAAK8uG,EAAS/vG,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOsK,EAAKrJ,KAAK8uG,EAAS/vG,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOsK,EAAKpK,MAAM6vG,EAAS/vG,K,SCI7B2F,EAAOC,QAZP,SAAmBE,EAAOkqG,GAIxB,IAHA,IAAIloG,GAAS,EACTtJ,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,SAE9BsJ,EAAQtJ,IAC8B,IAAzCwxG,EAASlqG,EAAMgC,GAAQA,EAAOhC,KAIpC,OAAOA,I,SCMTH,EAAOC,QAfP,SAAqBE,EAAO43B,GAM1B,IALA,IAAI51B,GAAS,EACTtJ,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,OACnCyxG,EAAW,EACX1kF,EAAS,KAEJzjB,EAAQtJ,GAAQ,CACvB,IAAIgB,EAAQsG,EAAMgC,GACd41B,EAAUl+B,EAAOsI,EAAOhC,KAC1BylB,EAAO0kF,KAAczwG,GAGzB,OAAO+rB,I,eCrBT,IAAI2kF,EAAc,EAAQ,MAgB1BvqG,EAAOC,QALP,SAAuBE,EAAOtG,GAE5B,QADsB,MAATsG,IAAoBA,EAAMtH,SACpB0xG,EAAYpqG,EAAOtG,EAAO,IAAM,I,SCQrDmG,EAAOC,QAZP,SAA2BE,EAAOtG,EAAO2wG,GAIvC,IAHA,IAAIroG,GAAS,EACTtJ,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,SAE9BsJ,EAAQtJ,GACf,GAAI2xG,EAAW3wG,EAAOsG,EAAMgC,IAC1B,OAAO,EAGX,OAAO,I,eClBT,IAAIsoG,EAAY,EAAQ,MACpBC,EAAc,EAAQ,MACtBtsG,EAAU,EAAQ,MAClBusG,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MAMvBztG,EAHcb,OAAOnB,UAGQgC,eAqCjC4C,EAAOC,QA3BP,SAAuBpG,EAAOixG,GAC5B,IAAIC,EAAQ3sG,EAAQvE,GAChBmxG,GAASD,GAASL,EAAY7wG,GAC9BoxG,GAAUF,IAAUC,GAASL,EAAS9wG,GACtCqxG,GAAUH,IAAUC,IAAUC,GAAUJ,EAAahxG,GACrDsxG,EAAcJ,GAASC,GAASC,GAAUC,EAC1CtlF,EAASulF,EAAcV,EAAU5wG,EAAMhB,OAAQ+L,QAAU,GACzD/L,EAAS+sB,EAAO/sB,OAEpB,IAAK,IAAIa,KAAOG,GACTixG,IAAa1tG,EAAe9B,KAAKzB,EAAOH,IACvCyxG,IAEQ,UAAPzxG,GAECuxG,IAAkB,UAAPvxG,GAA0B,UAAPA,IAE9BwxG,IAAkB,UAAPxxG,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDkxG,EAAQlxG,EAAKb,KAElB+sB,EAAOhqB,KAAKlC,GAGhB,OAAOksB,I,SCzBT5lB,EAAOC,QAXP,SAAkBE,EAAOkqG,GAKvB,IAJA,IAAIloG,GAAS,EACTtJ,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,OACnC+sB,EAAS5sB,MAAMH,KAEVsJ,EAAQtJ,GACf+sB,EAAOzjB,GAASkoG,EAASlqG,EAAMgC,GAAQA,EAAOhC,GAEhD,OAAOylB,I,SCET5lB,EAAOC,QAXP,SAAmBE,EAAO+F,GAKxB,IAJA,IAAI/D,GAAS,EACTtJ,EAASqN,EAAOrN,OAChBqhB,EAAS/Z,EAAMtH,SAEVsJ,EAAQtJ,GACfsH,EAAM+Z,EAAS/X,GAAS+D,EAAO/D,GAEjC,OAAOhC,I,SCSTH,EAAOC,QAbP,SAAqBE,EAAOkqG,EAAUe,EAAaC,GACjD,IAAIlpG,GAAS,EACTtJ,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,OAKvC,IAHIwyG,GAAaxyG,IACfuyG,EAAcjrG,IAAQgC,MAEfA,EAAQtJ,GACfuyG,EAAcf,EAASe,EAAajrG,EAAMgC,GAAQA,EAAOhC,GAE3D,OAAOirG,I,SCATprG,EAAOC,QAZP,SAAmBE,EAAO43B,GAIxB,IAHA,IAAI51B,GAAS,EACTtJ,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,SAE9BsJ,EAAQtJ,GACf,GAAIk/B,EAAU53B,EAAMgC,GAAQA,EAAOhC,GACjC,OAAO,EAGX,OAAO,I,eCnBT,IASImrG,EATe,EAAQ,IASXC,CAAa,UAE7BvrG,EAAOC,QAAUqrG,G,eCXjB,IAAIE,EAAkB,EAAQ,MAC1B3V,EAAK,EAAQ,MAkBjB71F,EAAOC,QAPP,SAA0B9C,EAAQzD,EAAKG,SACtBY,IAAVZ,IAAwBg8F,EAAG14F,EAAOzD,GAAMG,SAC9BY,IAAVZ,KAAyBH,KAAOyD,KACnCquG,EAAgBruG,EAAQzD,EAAKG,K,eCfjC,IAAI2xG,EAAkB,EAAQ,MAC1B3V,EAAK,EAAQ,MAMbz4F,EAHcb,OAAOnB,UAGQgC,eAoBjC4C,EAAOC,QARP,SAAqB9C,EAAQzD,EAAKG,GAChC,IAAI4xG,EAAWtuG,EAAOzD,GAChB0D,EAAe9B,KAAK6B,EAAQzD,IAAQm8F,EAAG4V,EAAU5xG,UACxCY,IAAVZ,GAAyBH,KAAOyD,IACnCquG,EAAgBruG,EAAQzD,EAAKG,K,eCvBjC,IAAIg8F,EAAK,EAAQ,MAoBjB71F,EAAOC,QAVP,SAAsBE,EAAOzG,GAE3B,IADA,IAAIb,EAASsH,EAAMtH,OACZA,KACL,GAAIg9F,EAAG11F,EAAMtH,GAAQ,GAAIa,GACvB,OAAOb,EAGX,OAAQ,I,eCjBV,IAAI6yG,EAAa,EAAQ,MACrB7qG,EAAO,EAAQ,MAenBb,EAAOC,QAJP,SAAoB9C,EAAQiX,GAC1B,OAAOjX,GAAUuuG,EAAWt3F,EAAQvT,EAAKuT,GAASjX,K,eCbpD,IAAIuuG,EAAa,EAAQ,MACrBC,EAAS,EAAQ,MAerB3rG,EAAOC,QAJP,SAAsB9C,EAAQiX,GAC5B,OAAOjX,GAAUuuG,EAAWt3F,EAAQu3F,EAAOv3F,GAASjX,K,eCbtD,IAAIX,EAAiB,EAAQ,MAwB7BwD,EAAOC,QAbP,SAAyB9C,EAAQzD,EAAKG,GACzB,aAAPH,GAAsB8C,EACxBA,EAAeW,EAAQzD,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASG,EACT,UAAY,IAGdsD,EAAOzD,GAAOG,I,eCpBlB,IAAIqwG,EAAQ,EAAQ,MAChB0B,EAAY,EAAQ,MACpBC,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAc,EAAQ,MACtBC,EAAY,EAAQ,KACpBC,EAAc,EAAQ,MACtBC,EAAgB,EAAQ,MACxBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAS,EAAQ,MACjBC,EAAiB,EAAQ,MACzBC,EAAiB,EAAQ,MACzBC,EAAkB,EAAQ,MAC1BruG,EAAU,EAAQ,MAClBusG,EAAW,EAAQ,MACnB+B,EAAQ,EAAQ,MAChBC,EAAW,EAAQ,MACnBC,EAAQ,EAAQ,MAChB/rG,EAAO,EAAQ,MACf8qG,EAAS,EAAQ,MAQjBkB,EAAU,qBAKVC,EAAU,oBAIVC,EAAY,kBAoBZC,EAAgB,GACpBA,EAAcH,GAAWG,EA7BV,kBA8BfA,EAfqB,wBAeWA,EAdd,qBAelBA,EA9Bc,oBA8BWA,EA7BX,iBA8BdA,EAfiB,yBAeWA,EAdX,yBAejBA,EAdc,sBAcWA,EAbV,uBAcfA,EAbe,uBAaWA,EA5Bb,gBA6BbA,EA5BgB,mBA4BWA,EAAcD,GACzCC,EA3BgB,mBA2BWA,EA1Bd,gBA2BbA,EA1BgB,mBA0BWA,EAzBX,mBA0BhBA,EAhBe,uBAgBWA,EAfJ,8BAgBtBA,EAfgB,wBAeWA,EAdX,yBAcsC,EACtDA,EArCe,kBAqCWA,EAAcF,GACxCE,EA5BiB,qBA4BW,EA8F5BhtG,EAAOC,QA5EP,SAASgtG,EAAUpzG,EAAOqzG,EAASC,EAAYzzG,EAAKyD,EAAQ+wE,GAC1D,IAAItoD,EACAwnF,EAnEgB,EAmEPF,EACTG,EAnEgB,EAmEPH,EACTI,EAnEmB,EAmEVJ,EAKb,GAHIC,IACFvnF,EAASzoB,EAASgwG,EAAWtzG,EAAOH,EAAKyD,EAAQ+wE,GAASi/B,EAAWtzG,SAExDY,IAAXmrB,EACF,OAAOA,EAET,IAAK+mF,EAAS9yG,GACZ,OAAOA,EAET,IAAIkxG,EAAQ3sG,EAAQvE,GACpB,GAAIkxG,GAEF,GADAnlF,EAAS2mF,EAAe1yG,IACnBuzG,EACH,OAAOnB,EAAUpyG,EAAO+rB,OAErB,CACL,IAAI2nF,EAAMjB,EAAOzyG,GACb2zG,EAASD,GAAOT,GA7EX,8BA6EsBS,EAE/B,GAAI5C,EAAS9wG,GACX,OAAOmyG,EAAYnyG,EAAOuzG,GAE5B,GAAIG,GAAOR,GAAaQ,GAAOV,GAAYW,IAAWrwG,GAEpD,GADAyoB,EAAUynF,GAAUG,EAAU,GAAKf,EAAgB5yG,IAC9CuzG,EACH,OAAOC,EACHlB,EAActyG,EAAOkyG,EAAanmF,EAAQ/rB,IAC1CqyG,EAAYryG,EAAOiyG,EAAWlmF,EAAQ/rB,QAEvC,CACL,IAAKmzG,EAAcO,GACjB,OAAOpwG,EAAStD,EAAQ,GAE1B+rB,EAAS4mF,EAAe3yG,EAAO0zG,EAAKH,IAIxCl/B,IAAUA,EAAQ,IAAIg8B,GACtB,IAAIuD,EAAUv/B,EAAMjxE,IAAIpD,GACxB,GAAI4zG,EACF,OAAOA,EAETv/B,EAAMtK,IAAI/pE,EAAO+rB,GAEbgnF,EAAM/yG,GACRA,EAAMsd,SAAQ,SAASu2F,GACrB9nF,EAAOjf,IAAIsmG,EAAUS,EAAUR,EAASC,EAAYO,EAAU7zG,EAAOq0E,OAE9Dw+B,EAAM7yG,IACfA,EAAMsd,SAAQ,SAASu2F,EAAUh0G,GAC/BksB,EAAOg+C,IAAIlqE,EAAKuzG,EAAUS,EAAUR,EAASC,EAAYzzG,EAAKG,EAAOq0E,OAIzE,IAIIhyE,EAAQ6uG,OAAQtwG,GAJL6yG,EACVD,EAAShB,EAAeD,EACxBiB,EAAS1B,EAAS9qG,GAEkBhH,GASzC,OARA+xG,EAAU1vG,GAASrC,GAAO,SAAS6zG,EAAUh0G,GACvCwC,IAEFwxG,EAAW7zG,EADXH,EAAMg0G,IAIR7B,EAAYjmF,EAAQlsB,EAAKuzG,EAAUS,EAAUR,EAASC,EAAYzzG,EAAKG,EAAOq0E,OAEzEtoD,I,eClKT,IAAI+mF,EAAW,EAAQ,MAGnBgB,EAAepxG,OAAOuB,OAUtB8vG,EAAc,WAChB,SAASzwG,KACT,OAAO,SAAS0wG,GACd,IAAKlB,EAASkB,GACZ,MAAO,GAET,GAAIF,EACF,OAAOA,EAAaE,GAEtB1wG,EAAO/B,UAAYyyG,EACnB,IAAIjoF,EAAS,IAAIzoB,EAEjB,OADAA,EAAO/B,eAAYX,EACZmrB,GAZM,GAgBjB5lB,EAAOC,QAAU2tG,G,eC7BjB,IAAIE,EAAa,EAAQ,MAWrBC,EAViB,EAAQ,KAUdC,CAAeF,GAE9B9tG,EAAOC,QAAU8tG,G,eCbjB,IAAIE,EAAW,EAAQ,MA+BvBjuG,EAAOC,QAnBP,SAAsBE,EAAOkqG,EAAUG,GAIrC,IAHA,IAAIroG,GAAS,EACTtJ,EAASsH,EAAMtH,SAEVsJ,EAAQtJ,GAAQ,CACvB,IAAIgB,EAAQsG,EAAMgC,GACdujC,EAAU2kE,EAASxwG,GAEvB,GAAe,MAAX6rC,SAAiCjrC,IAAbyzG,EACfxoE,GAAYA,IAAYuoE,EAASvoE,GAClC8kE,EAAW9kE,EAASwoE,IAE1B,IAAIA,EAAWxoE,EACX9f,EAAS/rB,EAGjB,OAAO+rB,I,cC5BT,IAAImoF,EAAW,EAAQ,MAoBvB/tG,EAAOC,QAVP,SAAoBoxF,EAAYt5D,GAC9B,IAAInS,EAAS,GAMb,OALAmoF,EAAS1c,GAAY,SAASx3F,EAAOsI,EAAOkvF,GACtCt5D,EAAUl+B,EAAOsI,EAAOkvF,IAC1BzrE,EAAOhqB,KAAK/B,MAGT+rB,I,SCMT5lB,EAAOC,QAZP,SAAuBE,EAAO43B,EAAWo2E,EAAWC,GAIlD,IAHA,IAAIv1G,EAASsH,EAAMtH,OACfsJ,EAAQgsG,GAAaC,EAAY,GAAK,GAElCA,EAAYjsG,MAAYA,EAAQtJ,GACtC,GAAIk/B,EAAU53B,EAAMgC,GAAQA,EAAOhC,GACjC,OAAOgC,EAGX,OAAQ,I,eCpBV,IAAIksG,EAAY,EAAQ,MACpBC,EAAgB,EAAQ,MAoC5BtuG,EAAOC,QAvBP,SAASsuG,EAAYpuG,EAAOgsB,EAAO4L,EAAWy2E,EAAU5oF,GACtD,IAAIzjB,GAAS,EACTtJ,EAASsH,EAAMtH,OAKnB,IAHAk/B,IAAcA,EAAYu2E,GAC1B1oF,IAAWA,EAAS,MAEXzjB,EAAQtJ,GAAQ,CACvB,IAAIgB,EAAQsG,EAAMgC,GACdgqB,EAAQ,GAAK4L,EAAUl+B,GACrBsyB,EAAQ,EAEVoiF,EAAY10G,EAAOsyB,EAAQ,EAAG4L,EAAWy2E,EAAU5oF,GAEnDyoF,EAAUzoF,EAAQ/rB,GAEV20G,IACV5oF,EAAOA,EAAO/sB,QAAUgB,GAG5B,OAAO+rB,I,eClCT,IAaI6oF,EAbgB,EAAQ,KAadC,GAEd1uG,EAAOC,QAAUwuG,G,eCfjB,IAAIA,EAAU,EAAQ,MAClB5tG,EAAO,EAAQ,MAcnBb,EAAOC,QAJP,SAAoB9C,EAAQktG,GAC1B,OAAOltG,GAAUsxG,EAAQtxG,EAAQktG,EAAUxpG,K,eCZ7C,IAAI8tG,EAAW,EAAQ,MACnBC,EAAQ,EAAQ,KAsBpB5uG,EAAOC,QAZP,SAAiB9C,EAAQ2V,GAMvB,IAHA,IAAI3Q,EAAQ,EACRtJ,GAHJia,EAAO67F,EAAS77F,EAAM3V,IAGJtE,OAED,MAAVsE,GAAkBgF,EAAQtJ,GAC/BsE,EAASA,EAAOyxG,EAAM97F,EAAK3Q,OAE7B,OAAQA,GAASA,GAAStJ,EAAUsE,OAAS1C,I,eCpB/C,IAAI4zG,EAAY,EAAQ,MACpBjwG,EAAU,EAAQ,MAkBtB4B,EAAOC,QALP,SAAwB9C,EAAQ0xG,EAAUC,GACxC,IAAIlpF,EAASipF,EAAS1xG,GACtB,OAAOiB,EAAQjB,GAAUyoB,EAASyoF,EAAUzoF,EAAQkpF,EAAY3xG,M,eChBlE,IAAIkB,EAAS,EAAQ,MACjB0wG,EAAY,EAAQ,MACpBC,EAAiB,EAAQ,MAOzBC,EAAiB5wG,EAASA,EAAO6wG,iBAAcz0G,EAkBnDuF,EAAOC,QATP,SAAoBpG,GAClB,OAAa,MAATA,OACeY,IAAVZ,EAdQ,qBADL,gBAiBJo1G,GAAkBA,KAAkB1yG,OAAO1C,GAC/Ck1G,EAAUl1G,GACVm1G,EAAen1G,K,SCXrBmG,EAAOC,QAJP,SAAgBpG,EAAOgR,GACrB,OAAOhR,EAAQgR,I,SCTjB,IAGIzN,EAHcb,OAAOnB,UAGQgC,eAcjC4C,EAAOC,QAJP,SAAiB9C,EAAQzD,GACvB,OAAiB,MAAVyD,GAAkBC,EAAe9B,KAAK6B,EAAQzD,K,OCHvDsG,EAAOC,QAJP,SAAmB9C,EAAQzD,GACzB,OAAiB,MAAVyD,GAAkBzD,KAAO6C,OAAOY,K,eCTzC,IAAIgyG,EAAgB,EAAQ,MACxBC,EAAY,EAAQ,MACpBC,EAAgB,EAAQ,MAiB5BrvG,EAAOC,QANP,SAAqBE,EAAOtG,EAAOs0G,GACjC,OAAOt0G,GAAUA,EACbw1G,EAAclvG,EAAOtG,EAAOs0G,GAC5BgB,EAAchvG,EAAOivG,EAAWjB,K,eChBtC,IAAImB,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MAgB3BvvG,EAAOC,QAJP,SAAyBpG,GACvB,OAAO01G,EAAa11G,IAVR,sBAUkBy1G,EAAWz1G,K,cCd3C,IAAI21G,EAAkB,EAAQ,MAC1BD,EAAe,EAAQ,MA0B3BvvG,EAAOC,QAVP,SAASwvG,EAAY51G,EAAOgR,EAAOqiG,EAASC,EAAYj/B,GACtD,OAAIr0E,IAAUgR,IAGD,MAAThR,GAA0B,MAATgR,IAAmB0kG,EAAa11G,KAAW01G,EAAa1kG,GACpEhR,GAAUA,GAASgR,GAAUA,EAE/B2kG,EAAgB31G,EAAOgR,EAAOqiG,EAASC,EAAYsC,EAAavhC,M,eCxBzE,IAAIg8B,EAAQ,EAAQ,MAChBwF,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBtD,EAAS,EAAQ,MACjBluG,EAAU,EAAQ,MAClBusG,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MAMvBgC,EAAU,qBACVgD,EAAW,iBACX9C,EAAY,kBAMZ3vG,EAHcb,OAAOnB,UAGQgC,eA6DjC4C,EAAOC,QA7CP,SAAyB9C,EAAQ0N,EAAOqiG,EAASC,EAAY2C,EAAW5hC,GACtE,IAAI6hC,EAAW3xG,EAAQjB,GACnB6yG,EAAW5xG,EAAQyM,GACnBolG,EAASF,EAAWF,EAAWvD,EAAOnvG,GACtC+yG,EAASF,EAAWH,EAAWvD,EAAOzhG,GAKtCslG,GAHJF,EAASA,GAAUpD,EAAUE,EAAYkD,IAGhBlD,EACrBqD,GAHJF,EAASA,GAAUrD,EAAUE,EAAYmD,IAGhBnD,EACrBsD,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa1F,EAASxtG,GAAS,CACjC,IAAKwtG,EAAS9/F,GACZ,OAAO,EAETklG,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAjiC,IAAUA,EAAQ,IAAIg8B,GACd6F,GAAYlF,EAAa1tG,GAC7BuyG,EAAYvyG,EAAQ0N,EAAOqiG,EAASC,EAAY2C,EAAW5hC,GAC3DyhC,EAAWxyG,EAAQ0N,EAAOolG,EAAQ/C,EAASC,EAAY2C,EAAW5hC,GAExE,KArDyB,EAqDnBg/B,GAAiC,CACrC,IAAIoD,EAAeH,GAAY/yG,EAAe9B,KAAK6B,EAAQ,eACvDozG,EAAeH,GAAYhzG,EAAe9B,KAAKuP,EAAO,eAE1D,GAAIylG,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAenzG,EAAOtD,QAAUsD,EAC/CszG,EAAeF,EAAe1lG,EAAMhR,QAAUgR,EAGlD,OADAqjE,IAAUA,EAAQ,IAAIg8B,GACf4F,EAAUU,EAAcC,EAAcvD,EAASC,EAAYj/B,IAGtE,QAAKmiC,IAGLniC,IAAUA,EAAQ,IAAIg8B,GACf0F,EAAazyG,EAAQ0N,EAAOqiG,EAASC,EAAY2C,EAAW5hC,M,eC/ErE,IAAIo+B,EAAS,EAAQ,MACjBiD,EAAe,EAAQ,MAgB3BvvG,EAAOC,QAJP,SAAmBpG,GACjB,OAAO01G,EAAa11G,IAVT,gBAUmByyG,EAAOzyG,K,eCdvC,IAAIqwG,EAAQ,EAAQ,MAChBuF,EAAc,EAAQ,KA4D1BzvG,EAAOC,QA5CP,SAAqB9C,EAAQiX,EAAQs8F,EAAWvD,GAC9C,IAAIhrG,EAAQuuG,EAAU73G,OAClBA,EAASsJ,EACTwuG,GAAgBxD,EAEpB,GAAc,MAAVhwG,EACF,OAAQtE,EAGV,IADAsE,EAASZ,OAAOY,GACTgF,KAAS,CACd,IAAI8P,EAAOy+F,EAAUvuG,GACrB,GAAKwuG,GAAgB1+F,EAAK,GAClBA,EAAK,KAAO9U,EAAO8U,EAAK,MACtBA,EAAK,KAAM9U,GAEnB,OAAO,EAGX,OAASgF,EAAQtJ,GAAQ,CAEvB,IAAIa,GADJuY,EAAOy+F,EAAUvuG,IACF,GACXspG,EAAWtuG,EAAOzD,GAClBk3G,EAAW3+F,EAAK,GAEpB,GAAI0+F,GAAgB1+F,EAAK,IACvB,QAAiBxX,IAAbgxG,KAA4B/xG,KAAOyD,GACrC,OAAO,MAEJ,CACL,IAAI+wE,EAAQ,IAAIg8B,EAChB,GAAIiD,EACF,IAAIvnF,EAASunF,EAAW1B,EAAUmF,EAAUl3G,EAAKyD,EAAQiX,EAAQ85D,GAEnE,UAAiBzzE,IAAXmrB,EACE6pF,EAAYmB,EAAUnF,EAAUoF,EAA+C1D,EAAYj/B,GAC3FtoD,GAEN,OAAO,GAIb,OAAO,I,SC/CT5lB,EAAOC,QAJP,SAAmBpG,GACjB,OAAOA,GAAUA,I,eCRnB,IAAIosG,EAAa,EAAQ,MACrB6K,EAAW,EAAQ,MACnBnE,EAAW,EAAQ,MACnBoE,EAAW,EAAQ,KASnBC,EAAe,8BAGfC,EAAYp1G,SAAST,UACrB81G,EAAc30G,OAAOnB,UAGrB+1G,EAAeF,EAAUpxG,SAGzBzC,EAAiB8zG,EAAY9zG,eAG7Bg0G,EAAa1gC,OAAO,IACtBygC,EAAa71G,KAAK8B,GAAgB6iB,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhFjgB,EAAOC,QARP,SAAsBpG,GACpB,SAAK8yG,EAAS9yG,IAAUi3G,EAASj3G,MAGnBosG,EAAWpsG,GAASu3G,EAAaJ,GAChCjxG,KAAKgxG,EAASl3G,M,eC3C/B,IAAIyyG,EAAS,EAAQ,MACjBiD,EAAe,EAAQ,MAgB3BvvG,EAAOC,QAJP,SAAmBpG,GACjB,OAAO01G,EAAa11G,IAVT,gBAUmByyG,EAAOzyG,K,eCdvC,IAAIy1G,EAAa,EAAQ,MACrB+B,EAAW,EAAQ,MACnB9B,EAAe,EAAQ,MA8BvB+B,EAAiB,GACrBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7BtxG,EAAOC,QALP,SAA0BpG,GACxB,OAAO01G,EAAa11G,IAClBw3G,EAASx3G,EAAMhB,WAAay4G,EAAehC,EAAWz1G,M,eCxD1D,IAAI03G,EAAc,EAAQ,MACtBC,EAAsB,EAAQ,MAC9BC,EAAW,EAAQ,MACnBrzG,EAAU,EAAQ,MAClBrB,EAAW,EAAQ,MA0BvBiD,EAAOC,QAjBP,SAAsBpG,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK43G,EAEW,iBAAT53G,EACFuE,EAAQvE,GACX23G,EAAoB33G,EAAM,GAAIA,EAAM,IACpC03G,EAAY13G,GAEXkD,EAASlD,K,cC3BlB,IAAI63G,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MAMrBv0G,EAHcb,OAAOnB,UAGQgC,eAsBjC4C,EAAOC,QAbP,SAAkB9C,GAChB,IAAKu0G,EAAYv0G,GACf,OAAOw0G,EAAWx0G,GAEpB,IAAIyoB,EAAS,GACb,IAAK,IAAIlsB,KAAO6C,OAAOY,GACjBC,EAAe9B,KAAK6B,EAAQzD,IAAe,eAAPA,GACtCksB,EAAOhqB,KAAKlC,GAGhB,OAAOksB,I,cC1BT,IAAI+mF,EAAW,EAAQ,MACnB+E,EAAc,EAAQ,MACtBE,EAAe,EAAQ,MAMvBx0G,EAHcb,OAAOnB,UAGQgC,eAwBjC4C,EAAOC,QAfP,SAAoB9C,GAClB,IAAKwvG,EAASxvG,GACZ,OAAOy0G,EAAaz0G,GAEtB,IAAI00G,EAAUH,EAAYv0G,GACtByoB,EAAS,GAEb,IAAK,IAAIlsB,KAAOyD,GACD,eAAPzD,IAAyBm4G,GAAYz0G,EAAe9B,KAAK6B,EAAQzD,KACrEksB,EAAOhqB,KAAKlC,GAGhB,OAAOksB,I,QChBT5lB,EAAOC,QAJP,SAAgBpG,EAAOgR,GACrB,OAAOhR,EAAQgR,I,eCVjB,IAAIkjG,EAAW,EAAQ,MACnB+D,EAAc,EAAQ,MAoB1B9xG,EAAOC,QAVP,SAAiBoxF,EAAYgZ,GAC3B,IAAIloG,GAAS,EACTyjB,EAASksF,EAAYzgB,GAAcr4F,MAAMq4F,EAAWx4F,QAAU,GAKlE,OAHAk1G,EAAS1c,GAAY,SAASx3F,EAAOH,EAAK23F,GACxCzrE,IAASzjB,GAASkoG,EAASxwG,EAAOH,EAAK23F,MAElCzrE,I,eClBT,IAAImsF,EAAc,EAAQ,MACtBC,EAAe,EAAQ,MACvBC,EAA0B,EAAQ,MAmBtCjyG,EAAOC,QAVP,SAAqBmU,GACnB,IAAIs8F,EAAYsB,EAAa59F,GAC7B,OAAwB,GAApBs8F,EAAU73G,QAAe63G,EAAU,GAAG,GACjCuB,EAAwBvB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASvzG,GACd,OAAOA,IAAWiX,GAAU29F,EAAY50G,EAAQiX,EAAQs8F,M,eCjB5D,IAAIjB,EAAc,EAAQ,KACtBxyG,EAAM,EAAQ,MACdi1G,EAAQ,EAAQ,MAChBC,EAAQ,EAAQ,MAChBC,EAAqB,EAAQ,MAC7BH,EAA0B,EAAQ,MAClCrD,EAAQ,EAAQ,KA0BpB5uG,EAAOC,QAZP,SAA6B6S,EAAM89F,GACjC,OAAIuB,EAAMr/F,IAASs/F,EAAmBxB,GAC7BqB,EAAwBrD,EAAM97F,GAAO89F,GAEvC,SAASzzG,GACd,IAAIsuG,EAAWxuG,EAAIE,EAAQ2V,GAC3B,YAAqBrY,IAAbgxG,GAA0BA,IAAamF,EAC3CsB,EAAM/0G,EAAQ2V,GACd28F,EAAYmB,EAAUnF,EAAUoF,M,eC5BxC,IAAI3G,EAAQ,EAAQ,MAChBmI,EAAmB,EAAQ,MAC3B5D,EAAU,EAAQ,MAClB6D,EAAgB,EAAQ,MACxB3F,EAAW,EAAQ,MACnBhB,EAAS,EAAQ,MACjB4G,EAAU,EAAQ,MAmCtBvyG,EAAOC,QAtBP,SAASuyG,EAAUr1G,EAAQiX,EAAQq+F,EAAUtF,EAAYj/B,GACnD/wE,IAAWiX,GAGfq6F,EAAQr6F,GAAQ,SAASw8F,EAAUl3G,GAEjC,GADAw0E,IAAUA,EAAQ,IAAIg8B,GAClByC,EAASiE,GACX0B,EAAcn1G,EAAQiX,EAAQ1a,EAAK+4G,EAAUD,EAAWrF,EAAYj/B,OAEjE,CACH,IAAIwkC,EAAWvF,EACXA,EAAWoF,EAAQp1G,EAAQzD,GAAMk3G,EAAWl3G,EAAM,GAAKyD,EAAQiX,EAAQ85D,QACvEzzE,OAEaA,IAAbi4G,IACFA,EAAW9B,GAEbyB,EAAiBl1G,EAAQzD,EAAKg5G,MAE/B/G,K,eCtCL,IAAI0G,EAAmB,EAAQ,MAC3BrG,EAAc,EAAQ,MACtB2G,EAAkB,EAAQ,MAC1B1G,EAAY,EAAQ,KACpBQ,EAAkB,EAAQ,MAC1B/B,EAAc,EAAQ,MACtBtsG,EAAU,EAAQ,MAClBw0G,EAAoB,EAAQ,MAC5BjI,EAAW,EAAQ,MACnB1E,EAAa,EAAQ,MACrB0G,EAAW,EAAQ,MACnBkG,EAAgB,EAAQ,MACxBhI,EAAe,EAAQ,MACvB0H,EAAU,EAAQ,MAClBO,EAAgB,EAAQ,MA+E5B9yG,EAAOC,QA9DP,SAAuB9C,EAAQiX,EAAQ1a,EAAK+4G,EAAUM,EAAW5F,EAAYj/B,GAC3E,IAAIu9B,EAAW8G,EAAQp1G,EAAQzD,GAC3Bk3G,EAAW2B,EAAQn+F,EAAQ1a,GAC3B+zG,EAAUv/B,EAAMjxE,IAAI2zG,GAExB,GAAInD,EACF4E,EAAiBl1G,EAAQzD,EAAK+zG,OADhC,CAIA,IAAIiF,EAAWvF,EACXA,EAAW1B,EAAUmF,EAAWl3G,EAAM,GAAKyD,EAAQiX,EAAQ85D,QAC3DzzE,EAEAu4G,OAAwBv4G,IAAbi4G,EAEf,GAAIM,EAAU,CACZ,IAAIjI,EAAQ3sG,EAAQwyG,GAChB3F,GAAUF,GAASJ,EAASiG,GAC5BqC,GAAWlI,IAAUE,GAAUJ,EAAa+F,GAEhD8B,EAAW9B,EACP7F,GAASE,GAAUgI,EACjB70G,EAAQqtG,GACViH,EAAWjH,EAEJmH,EAAkBnH,GACzBiH,EAAWzG,EAAUR,GAEdR,GACP+H,GAAW,EACXN,EAAW1G,EAAY4E,GAAU,IAE1BqC,GACPD,GAAW,EACXN,EAAWC,EAAgB/B,GAAU,IAGrC8B,EAAW,GAGNG,EAAcjC,IAAalG,EAAYkG,IAC9C8B,EAAWjH,EACPf,EAAYe,GACdiH,EAAWI,EAAcrH,GAEjBkB,EAASlB,KAAaxF,EAAWwF,KACzCiH,EAAWjG,EAAgBmE,KAI7BoC,GAAW,EAGXA,IAEF9kC,EAAMtK,IAAIgtC,EAAU8B,GACpBK,EAAUL,EAAU9B,EAAU6B,EAAUtF,EAAYj/B,GACpDA,EAAc,OAAE0iC,IAElByB,EAAiBl1G,EAAQzD,EAAKg5G,M,eC1FhC,IAAIQ,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClBC,EAAa,EAAQ,MACrBC,EAAY,EAAQ,MACpBC,EAAkB,EAAQ,MAC1B/B,EAAW,EAAQ,MACnBrzG,EAAU,EAAQ,MAwCtB4B,EAAOC,QA7BP,SAAqBoxF,EAAYoiB,EAAWC,GAExCD,EADEA,EAAU56G,OACAq6G,EAASO,GAAW,SAASpJ,GACvC,OAAIjsG,EAAQisG,GACH,SAASxwG,GACd,OAAOs5G,EAAQt5G,EAA2B,IAApBwwG,EAASxxG,OAAewxG,EAAS,GAAKA,IAGzDA,KAGG,CAACoH,GAGf,IAAItvG,GAAS,EACbsxG,EAAYP,EAASO,EAAWF,EAAUH,IAE1C,IAAIxtF,EAASytF,EAAQhiB,GAAY,SAASx3F,EAAOH,EAAK23F,GAIpD,MAAO,CAAE,SAHM6hB,EAASO,GAAW,SAASpJ,GAC1C,OAAOA,EAASxwG,MAEa,QAAWsI,EAAO,MAAStI,MAG5D,OAAOy5G,EAAW1tF,GAAQ,SAASzoB,EAAQ0N,GACzC,OAAO2oG,EAAgBr2G,EAAQ0N,EAAO6oG,Q,eC5C1C,IAAIC,EAAa,EAAQ,MACrBzB,EAAQ,EAAQ,MAiBpBlyG,EAAOC,QANP,SAAkB9C,EAAQy2G,GACxB,OAAOD,EAAWx2G,EAAQy2G,GAAO,SAAS/5G,EAAOiZ,GAC/C,OAAOo/F,EAAM/0G,EAAQ2V,Q,eCdzB,IAAIqgG,EAAU,EAAQ,MAClBU,EAAU,EAAQ,KAClBlF,EAAW,EAAQ,MA2BvB3uG,EAAOC,QAhBP,SAAoB9C,EAAQy2G,EAAO77E,GAKjC,IAJA,IAAI51B,GAAS,EACTtJ,EAAS+6G,EAAM/6G,OACf+sB,EAAS,KAEJzjB,EAAQtJ,GAAQ,CACvB,IAAIia,EAAO8gG,EAAMzxG,GACbtI,EAAQs5G,EAAQh2G,EAAQ2V,GAExBilB,EAAUl+B,EAAOiZ,IACnB+gG,EAAQjuF,EAAQ+oF,EAAS77F,EAAM3V,GAAStD,GAG5C,OAAO+rB,I,QCbT5lB,EAAOC,QANP,SAAsBvG,GACpB,OAAO,SAASyD,GACd,OAAiB,MAAVA,OAAiB1C,EAAY0C,EAAOzD,M,eCT/C,IAAIy5G,EAAU,EAAQ,MAetBnzG,EAAOC,QANP,SAA0B6S,GACxB,OAAO,SAAS3V,GACd,OAAOg2G,EAAQh2G,EAAQ2V,M,OCV3B,IAAIghG,EAAa1zG,KAAKwwB,KAClBmjF,EAAY3zG,KAAKyJ,IAyBrB7J,EAAOC,QAZP,SAAmB+Z,EAAOC,EAAK4S,EAAMuhF,GAKnC,IAJA,IAAIjsG,GAAS,EACTtJ,EAASk7G,EAAUD,GAAY75F,EAAMD,IAAU6S,GAAQ,IAAK,GAC5DjH,EAAS5sB,MAAMH,GAEZA,KACL+sB,EAAOwoF,EAAYv1G,IAAWsJ,GAAS6X,EACvCA,GAAS6S,EAEX,OAAOjH,I,QCFT5lB,EAAOC,QATP,SAAoBoxF,EAAYgZ,EAAUe,EAAaC,EAAW2I,GAMhE,OALAA,EAAS3iB,GAAY,SAASx3F,EAAOsI,EAAOkvF,GAC1C+Z,EAAcC,GACTA,GAAY,EAAOxxG,GACpBwwG,EAASe,EAAavxG,EAAOsI,EAAOkvF,MAEnC+Z,I,eCnBT,IAAIqG,EAAW,EAAQ,MACnBwC,EAAW,EAAQ,MACnBC,EAAc,EAAQ,IAc1Bl0G,EAAOC,QAJP,SAAkB0E,EAAMqV,GACtB,OAAOk6F,EAAYD,EAAStvG,EAAMqV,EAAOy3F,GAAW9sG,EAAO,M,cCb7D,IAAIknG,EAAc,EAAQ,MACtB8C,EAAW,EAAQ,MACnB/D,EAAU,EAAQ,MAClB+B,EAAW,EAAQ,MACnBiC,EAAQ,EAAQ,KA8CpB5uG,EAAOC,QAlCP,SAAiB9C,EAAQ2V,EAAMjZ,EAAOszG,GACpC,IAAKR,EAASxvG,GACZ,OAAOA,EAST,IALA,IAAIgF,GAAS,EACTtJ,GAHJia,EAAO67F,EAAS77F,EAAM3V,IAGJtE,OACds7G,EAAYt7G,EAAS,EACrBu7G,EAASj3G,EAEI,MAAVi3G,KAAoBjyG,EAAQtJ,GAAQ,CACzC,IAAIa,EAAMk1G,EAAM97F,EAAK3Q,IACjBuwG,EAAW74G,EAEf,GAAY,cAARH,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOyD,EAGT,GAAIgF,GAASgyG,EAAW,CACtB,IAAI1I,EAAW2I,EAAO16G,QAELe,KADjBi4G,EAAWvF,EAAaA,EAAW1B,EAAU/xG,EAAK06G,QAAU35G,KAE1Di4G,EAAW/F,EAASlB,GAChBA,EACCb,EAAQ93F,EAAK3Q,EAAQ,IAAM,GAAK,IAGzC0pG,EAAYuI,EAAQ16G,EAAKg5G,GACzB0B,EAASA,EAAO16G,GAElB,OAAOyD,I,eC/CT,IAAI2gF,EAAW,EAAQ,MACnBthF,EAAiB,EAAQ,MACzBi1G,EAAW,EAAQ,MAUnB4C,EAAmB73G,EAA4B,SAASmI,EAAM2vG,GAChE,OAAO93G,EAAemI,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASm5E,EAASw2B,GAClB,UAAY,KALwB7C,EASxCzxG,EAAOC,QAAUo0G,G,SCDjBr0G,EAAOC,QAVP,SAAoBE,EAAOo0G,GACzB,IAAI17G,EAASsH,EAAMtH,OAGnB,IADAsH,EAAM+B,KAAKqyG,GACJ17G,KACLsH,EAAMtH,GAAUsH,EAAMtH,GAAQgB,MAEhC,OAAOsG,I,SCETH,EAAOC,QAVP,SAAmBL,EAAGyqG,GAIpB,IAHA,IAAIloG,GAAS,EACTyjB,EAAS5sB,MAAM4G,KAEVuC,EAAQvC,GACfgmB,EAAOzjB,GAASkoG,EAASloG,GAE3B,OAAOyjB,I,cChBT,IAAIvnB,EAAS,EAAQ,MACjB60G,EAAW,EAAQ,MACnB90G,EAAU,EAAQ,MAClB6vG,EAAW,EAAQ,MAMnBuG,EAAcn2G,EAASA,EAAOjD,eAAYX,EAC1Cg6G,EAAiBD,EAAcA,EAAY30G,cAAWpF,EA0B1DuF,EAAOC,QAhBP,SAASy0G,EAAa76G,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIuE,EAAQvE,GAEV,OAAOq5G,EAASr5G,EAAO66G,GAAgB,GAEzC,GAAIzG,EAASp0G,GACX,OAAO46G,EAAiBA,EAAen5G,KAAKzB,GAAS,GAEvD,IAAI+rB,EAAU/rB,EAAQ,GACtB,MAAkB,KAAV+rB,GAAkB,EAAI/rB,IA3BjB,IA2BwC,KAAO+rB,I,eCjC9D,IAAI+uF,EAAkB,EAAQ,MAG1BC,EAAc,OAelB50G,EAAOC,QANP,SAAkBq0G,GAChB,OAAOA,EACHA,EAAOp1G,MAAM,EAAGy1G,EAAgBL,GAAU,GAAGr0F,QAAQ20F,EAAa,IAClEN,I,SCFNt0G,EAAOC,QANP,SAAmB0E,GACjB,OAAO,SAAS9K,GACd,OAAO8K,EAAK9K,M,eCThB,IAAI8vG,EAAW,EAAQ,MACnBkL,EAAgB,EAAQ,MACxBC,EAAoB,EAAQ,MAC5BC,EAAW,EAAQ,MACnBC,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MAkEzBj1G,EAAOC,QApDP,SAAkBE,EAAOkqG,EAAUG,GACjC,IAAIroG,GAAS,EACTuD,EAAWmvG,EACXh8G,EAASsH,EAAMtH,OACfm6G,GAAW,EACXptF,EAAS,GACTpf,EAAOof,EAEX,GAAI4kF,EACFwI,GAAW,EACXttG,EAAWovG,OAER,GAAIj8G,GAvBY,IAuBgB,CACnC,IAAI+qE,EAAMymC,EAAW,KAAO2K,EAAU70G,GACtC,GAAIyjE,EACF,OAAOqxC,EAAWrxC,GAEpBovC,GAAW,EACXttG,EAAWqvG,EACXvuG,EAAO,IAAImjG,OAGXnjG,EAAO6jG,EAAW,GAAKzkF,EAEzBsvF,EACA,OAAS/yG,EAAQtJ,GAAQ,CACvB,IAAIgB,EAAQsG,EAAMgC,GACd+rG,EAAW7D,EAAWA,EAASxwG,GAASA,EAG5C,GADAA,EAAS2wG,GAAwB,IAAV3wG,EAAeA,EAAQ,EAC1Cm5G,GAAY9E,GAAaA,EAAU,CAErC,IADA,IAAIiH,EAAY3uG,EAAK3N,OACds8G,KACL,GAAI3uG,EAAK2uG,KAAejH,EACtB,SAASgH,EAGT7K,GACF7jG,EAAK5K,KAAKsyG,GAEZtoF,EAAOhqB,KAAK/B,QAEJ6L,EAASc,EAAM0nG,EAAU1D,KAC7BhkG,IAASof,GACXpf,EAAK5K,KAAKsyG,GAEZtoF,EAAOhqB,KAAK/B,IAGhB,OAAO+rB,I,eCpET,IAAIstF,EAAW,EAAQ,MAkBvBlzG,EAAOC,QANP,SAAoB9C,EAAQjB,GAC1B,OAAOg3G,EAASh3G,GAAO,SAASxC,GAC9B,OAAOyD,EAAOzD,Q,SCQlBsG,EAAOC,QAbP,SAAuB/D,EAAOgK,EAAQkvG,GAMpC,IALA,IAAIjzG,GAAS,EACTtJ,EAASqD,EAAMrD,OACfw8G,EAAanvG,EAAOrN,OACpB+sB,EAAS,KAEJzjB,EAAQtJ,GAAQ,CACvB,IAAIgB,EAAQsI,EAAQkzG,EAAanvG,EAAO/D,QAAS1H,EACjD26G,EAAWxvF,EAAQ1pB,EAAMiG,GAAQtI,GAEnC,OAAO+rB,I,SCPT5lB,EAAOC,QAJP,SAAkBq1G,EAAO57G,GACvB,OAAO47G,EAAM5uG,IAAIhN,K,eCTnB,IAAI+3G,EAAW,EAAQ,MAavBzxG,EAAOC,QAJP,SAAsBpG,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ43G,I,eCV9C,IAAIrzG,EAAU,EAAQ,MAClB+zG,EAAQ,EAAQ,MAChBoD,EAAe,EAAQ,MACvB11G,EAAW,EAAQ,MAiBvBG,EAAOC,QAPP,SAAkBpG,EAAOsD,GACvB,OAAIiB,EAAQvE,GACHA,EAEFs4G,EAAMt4G,EAAOsD,GAAU,CAACtD,GAAS07G,EAAa11G,EAAShG,M,eCjBhE,IAAI+kC,EAAa,EAAQ,MAezB5+B,EAAOC,QANP,SAA0Bu1G,GACxB,IAAI5vF,EAAS,IAAI4vF,EAAYz3G,YAAYy3G,EAAYC,YAErD,OADA,IAAI72E,EAAWhZ,GAAQg+C,IAAI,IAAIhlC,EAAW42E,IACnC5vF,I,0BCZT,IAAIG,EAAO,EAAQ,MAGf2vF,EAA4Cz1G,IAAYA,EAAQ01G,UAAY11G,EAG5E21G,EAAaF,GAA4C11G,IAAWA,EAAO21G,UAAY31G,EAMvF61G,EAHgBD,GAAcA,EAAW31G,UAAYy1G,EAG5B3vF,EAAK8vF,YAASp7G,EACvCq7G,EAAcD,EAASA,EAAOC,iBAAcr7G,EAqBhDuF,EAAOC,QAXP,SAAqBkvD,EAAQi+C,GAC3B,GAAIA,EACF,OAAOj+C,EAAOjwD,QAEhB,IAAIrG,EAASs2D,EAAOt2D,OAChB+sB,EAASkwF,EAAcA,EAAYj9G,GAAU,IAAIs2D,EAAOpxD,YAAYlF,GAGxE,OADAs2D,EAAOtoC,KAAKjB,GACLA,I,eC/BT,IAAImwF,EAAmB,EAAQ,MAe/B/1G,EAAOC,QALP,SAAuB+1G,EAAU5I,GAC/B,IAAIj+C,EAASi+C,EAAS2I,EAAiBC,EAAS7mD,QAAU6mD,EAAS7mD,OACnE,OAAO,IAAI6mD,EAASj4G,YAAYoxD,EAAQ6mD,EAASC,WAAYD,EAASP,c,SCXxE,IAAIS,EAAU,OAedl2G,EAAOC,QANP,SAAqBk2G,GACnB,IAAIvwF,EAAS,IAAIuwF,EAAOp4G,YAAYo4G,EAAO/hG,OAAQ8hG,EAAQtvD,KAAKuvD,IAEhE,OADAvwF,EAAOuuF,UAAYgC,EAAOhC,UACnBvuF,I,cCbT,IAAIvnB,EAAS,EAAQ,MAGjBm2G,EAAcn2G,EAASA,EAAOjD,eAAYX,EAC1C27G,EAAgB5B,EAAcA,EAAYn5G,aAAUZ,EAaxDuF,EAAOC,QAJP,SAAqB40C,GACnB,OAAOuhE,EAAgB75G,OAAO65G,EAAc96G,KAAKu5C,IAAW,K,eCd9D,IAAIkhE,EAAmB,EAAQ,MAe/B/1G,EAAOC,QALP,SAAyBo2G,EAAYjJ,GACnC,IAAIj+C,EAASi+C,EAAS2I,EAAiBM,EAAWlnD,QAAUknD,EAAWlnD,OACvE,OAAO,IAAIknD,EAAWt4G,YAAYoxD,EAAQknD,EAAWJ,WAAYI,EAAWx9G,U,eCZ9E,IAAIo1G,EAAW,EAAQ,MAwCvBjuG,EAAOC,QA9BP,SAA0BpG,EAAOgR,GAC/B,GAAIhR,IAAUgR,EAAO,CACnB,IAAIyrG,OAAyB77G,IAAVZ,EACf08G,EAAsB,OAAV18G,EACZ28G,EAAiB38G,GAAUA,EAC3B48G,EAAcxI,EAASp0G,GAEvB68G,OAAyBj8G,IAAVoQ,EACf8rG,EAAsB,OAAV9rG,EACZ+rG,EAAiB/rG,GAAUA,EAC3BgsG,EAAc5I,EAASpjG,GAE3B,IAAM8rG,IAAcE,IAAgBJ,GAAe58G,EAAQgR,GACtD4rG,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAeh9G,EAAQgR,GACtDgsG,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,EAGZ,OAAO,I,eCrCT,IAAIE,EAAmB,EAAQ,MA2C/B92G,EAAOC,QA3BP,SAAyB9C,EAAQ0N,EAAO6oG,GAOtC,IANA,IAAIvxG,GAAS,EACT40G,EAAc55G,EAAO65G,SACrBC,EAAcpsG,EAAMmsG,SACpBn+G,EAASk+G,EAAYl+G,OACrBq+G,EAAexD,EAAO76G,SAEjBsJ,EAAQtJ,GAAQ,CACvB,IAAI+sB,EAASkxF,EAAiBC,EAAY50G,GAAQ80G,EAAY90G,IAC9D,GAAIyjB,EACF,OAAIzjB,GAAS+0G,EACJtxF,EAGFA,GAAmB,QADd8tF,EAAOvxG,IACiB,EAAI,GAU5C,OAAOhF,EAAOgF,MAAQ0I,EAAM1I,Q,QCrB9BnC,EAAOC,QAXP,SAAmBmU,EAAQjU,GACzB,IAAIgC,GAAS,EACTtJ,EAASub,EAAOvb,OAGpB,IADAsH,IAAUA,EAAQnH,MAAMH,MACfsJ,EAAQtJ,GACfsH,EAAMgC,GAASiS,EAAOjS,GAExB,OAAOhC,I,eChBT,IAAI0rG,EAAc,EAAQ,MACtBL,EAAkB,EAAQ,MAsC9BxrG,EAAOC,QA1BP,SAAoBmU,EAAQlY,EAAOiB,EAAQgwG,GACzC,IAAIgK,GAASh6G,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAIgF,GAAS,EACTtJ,EAASqD,EAAMrD,SAEVsJ,EAAQtJ,GAAQ,CACvB,IAAIa,EAAMwC,EAAMiG,GAEZuwG,EAAWvF,EACXA,EAAWhwG,EAAOzD,GAAM0a,EAAO1a,GAAMA,EAAKyD,EAAQiX,QAClD3Z,OAEaA,IAAbi4G,IACFA,EAAWt+F,EAAO1a,IAEhBy9G,EACF3L,EAAgBruG,EAAQzD,EAAKg5G,GAE7B7G,EAAY1uG,EAAQzD,EAAKg5G,GAG7B,OAAOv1G,I,eCpCT,IAAIuuG,EAAa,EAAQ,MACrB0L,EAAa,EAAQ,MAczBp3G,EAAOC,QAJP,SAAqBmU,EAAQjX,GAC3B,OAAOuuG,EAAWt3F,EAAQgjG,EAAWhjG,GAASjX,K,eCZhD,IAAIuuG,EAAa,EAAQ,MACrB2L,EAAe,EAAQ,MAc3Br3G,EAAOC,QAJP,SAAuBmU,EAAQjX,GAC7B,OAAOuuG,EAAWt3F,EAAQijG,EAAajjG,GAASjX,K,eCZlD,IAGIm6G,EAHO,EAAQ,MAGG,sBAEtBt3G,EAAOC,QAAUq3G,G,eCLjB,IAAIC,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MAmC7Bx3G,EAAOC,QA1BP,SAAwBw3G,GACtB,OAAOF,GAAS,SAASp6G,EAAQsgF,GAC/B,IAAIt7E,GAAS,EACTtJ,EAAS4kF,EAAQ5kF,OACjBs0G,EAAat0G,EAAS,EAAI4kF,EAAQ5kF,EAAS,QAAK4B,EAChD2iG,EAAQvkG,EAAS,EAAI4kF,EAAQ,QAAKhjF,EAWtC,IATA0yG,EAAcsK,EAAS5+G,OAAS,GAA0B,mBAAds0G,GACvCt0G,IAAUs0G,QACX1yG,EAEA2iG,GAASoa,EAAe/5B,EAAQ,GAAIA,EAAQ,GAAI2f,KAClD+P,EAAat0G,EAAS,OAAI4B,EAAY0yG,EACtCt0G,EAAS,GAEXsE,EAASZ,OAAOY,KACPgF,EAAQtJ,GAAQ,CACvB,IAAIub,EAASqpE,EAAQt7E,GACjBiS,GACFqjG,EAASt6G,EAAQiX,EAAQjS,EAAOgrG,GAGpC,OAAOhwG,O,eChCX,IAAI20G,EAAc,EAAQ,MA+B1B9xG,EAAOC,QArBP,SAAwB+zG,EAAU5F,GAChC,OAAO,SAAS/c,EAAYgZ,GAC1B,GAAkB,MAAdhZ,EACF,OAAOA,EAET,IAAKygB,EAAYzgB,GACf,OAAO2iB,EAAS3iB,EAAYgZ,GAM9B,IAJA,IAAIxxG,EAASw4F,EAAWx4F,OACpBsJ,EAAQisG,EAAYv1G,GAAU,EAC9B6+G,EAAWn7G,OAAO80F,IAEd+c,EAAYjsG,MAAYA,EAAQtJ,KACa,IAA/CwxG,EAASqN,EAASv1G,GAAQA,EAAOu1G,KAIvC,OAAOrmB,K,SCHXrxF,EAAOC,QAjBP,SAAuBmuG,GACrB,OAAO,SAASjxG,EAAQktG,EAAUwE,GAMhC,IALA,IAAI1sG,GAAS,EACTu1G,EAAWn7G,OAAOY,GAClBjB,EAAQ2yG,EAAS1xG,GACjBtE,EAASqD,EAAMrD,OAEZA,KAAU,CACf,IAAIa,EAAMwC,EAAMkyG,EAAYv1G,IAAWsJ,GACvC,IAA+C,IAA3CkoG,EAASqN,EAASh+G,GAAMA,EAAKg+G,GAC/B,MAGJ,OAAOv6G,K,eCpBX,IAAIi2G,EAAe,EAAQ,MACvBtB,EAAc,EAAQ,MACtBjxG,EAAO,EAAQ,MAsBnBb,EAAOC,QAbP,SAAoB03G,GAClB,OAAO,SAAStmB,EAAYt5D,EAAWo2E,GACrC,IAAIuJ,EAAWn7G,OAAO80F,GACtB,IAAKygB,EAAYzgB,GAAa,CAC5B,IAAIgZ,EAAW+I,EAAar7E,EAAW,GACvCs5D,EAAaxwF,EAAKwwF,GAClBt5D,EAAY,SAASr+B,GAAO,OAAO2wG,EAASqN,EAASh+G,GAAMA,EAAKg+G,IAElE,IAAIv1G,EAAQw1G,EAActmB,EAAYt5D,EAAWo2E,GACjD,OAAOhsG,GAAS,EAAIu1G,EAASrN,EAAWhZ,EAAWlvF,GAASA,QAAS1H,K,eCpBzE,IAAIm9G,EAAY,EAAQ,IACpBJ,EAAiB,EAAQ,MACzBK,EAAW,EAAQ,MA2BvB73G,EAAOC,QAlBP,SAAqBmuG,GACnB,OAAO,SAASp0F,EAAOC,EAAK4S,GAa1B,OAZIA,GAAuB,iBAARA,GAAoB2qF,EAAex9F,EAAOC,EAAK4S,KAChE5S,EAAM4S,OAAOpyB,GAGfuf,EAAQ69F,EAAS79F,QACLvf,IAARwf,GACFA,EAAMD,EACNA,EAAQ,GAERC,EAAM49F,EAAS59F,GAEjB4S,OAAgBpyB,IAAToyB,EAAsB7S,EAAQC,EAAM,GAAK,EAAK49F,EAAShrF,GACvD+qF,EAAU59F,EAAOC,EAAK4S,EAAMuhF,M,eCzBvC,IAAI5yC,EAAM,EAAQ,MACds8C,EAAO,EAAQ,KACf7C,EAAa,EAAQ,MAYrBD,EAAcx5C,GAAQ,EAAIy5C,EAAW,IAAIz5C,EAAI,CAAC,EAAE,KAAK,IAT1C,IASoE,SAASt1D,GAC1F,OAAO,IAAIs1D,EAAIt1D,IAD2D4xG,EAI5E93G,EAAOC,QAAU+0G,G,eClBjB,IAAI1M,EAAY,EAAQ,KAEpB9rG,EAAkB,WACpB,IACE,IAAImI,EAAO2jG,EAAU/rG,OAAQ,kBAE7B,OADAoI,EAAK,GAAI,GAAI,IACNA,EACP,MAAOpJ,KALU,GAQrByE,EAAOC,QAAUzD,G,eCVjB,IAAImtG,EAAW,EAAQ,MACnBoO,EAAY,EAAQ,MACpBhD,EAAW,EAAQ,MAiFvB/0G,EAAOC,QA9DP,SAAqBE,EAAO0K,EAAOqiG,EAASC,EAAY2C,EAAW5hC,GACjE,IAAI8pC,EAjBqB,EAiBT9K,EACZ+K,EAAY93G,EAAMtH,OAClBq/G,EAAYrtG,EAAMhS,OAEtB,GAAIo/G,GAAaC,KAAeF,GAAaE,EAAYD,GACvD,OAAO,EAGT,IAAIE,EAAajqC,EAAMjxE,IAAIkD,GACvBi4G,EAAalqC,EAAMjxE,IAAI4N,GAC3B,GAAIstG,GAAcC,EAChB,OAAOD,GAActtG,GAASutG,GAAcj4G,EAE9C,IAAIgC,GAAS,EACTyjB,GAAS,EACTpf,EA/BuB,EA+Bf0mG,EAAoC,IAAIvD,OAAWlvG,EAM/D,IAJAyzE,EAAMtK,IAAIzjE,EAAO0K,GACjBqjE,EAAMtK,IAAI/4D,EAAO1K,KAGRgC,EAAQ81G,GAAW,CAC1B,IAAII,EAAWl4G,EAAMgC,GACjBm2G,EAAWztG,EAAM1I,GAErB,GAAIgrG,EACF,IAAIoL,EAAWP,EACX7K,EAAWmL,EAAUD,EAAUl2G,EAAO0I,EAAO1K,EAAO+tE,GACpDi/B,EAAWkL,EAAUC,EAAUn2G,EAAOhC,EAAO0K,EAAOqjE,GAE1D,QAAiBzzE,IAAb89G,EAAwB,CAC1B,GAAIA,EACF,SAEF3yF,GAAS,EACT,MAGF,GAAIpf,GACF,IAAKuxG,EAAUltG,GAAO,SAASytG,EAAUE,GACnC,IAAKzD,EAASvuG,EAAMgyG,KACfH,IAAaC,GAAYxI,EAAUuI,EAAUC,EAAUpL,EAASC,EAAYj/B,IAC/E,OAAO1nE,EAAK5K,KAAK48G,MAEjB,CACN5yF,GAAS,EACT,YAEG,GACDyyF,IAAaC,IACXxI,EAAUuI,EAAUC,EAAUpL,EAASC,EAAYj/B,GACpD,CACLtoD,GAAS,EACT,OAKJ,OAFAsoD,EAAc,OAAE/tE,GAChB+tE,EAAc,OAAErjE,GACT+a,I,eChFT,IAAIvnB,EAAS,EAAQ,MACjBugC,EAAa,EAAQ,MACrBi3D,EAAK,EAAQ,MACb6Z,EAAc,EAAQ,MACtB+I,EAAa,EAAQ,MACrBxD,EAAa,EAAQ,MAqBrBT,EAAcn2G,EAASA,EAAOjD,eAAYX,EAC1C27G,EAAgB5B,EAAcA,EAAYn5G,aAAUZ,EAoFxDuF,EAAOC,QAjEP,SAAoB9C,EAAQ0N,EAAO0iG,EAAKL,EAASC,EAAY2C,EAAW5hC,GACtE,OAAQq/B,GACN,IAzBc,oBA0BZ,GAAKpwG,EAAOs4G,YAAc5qG,EAAM4qG,YAC3Bt4G,EAAO84G,YAAcprG,EAAMorG,WAC9B,OAAO,EAET94G,EAASA,EAAOgyD,OAChBtkD,EAAQA,EAAMskD,OAEhB,IAlCiB,uBAmCf,QAAKhyD,EAAOs4G,YAAc5qG,EAAM4qG,aAC3B3F,EAAU,IAAIlxE,EAAWzhC,GAAS,IAAIyhC,EAAW/zB,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAOgrF,GAAI14F,GAAS0N,GAEtB,IAxDW,iBAyDT,OAAO1N,EAAO2C,MAAQ+K,EAAM/K,MAAQ3C,EAAO2iB,SAAWjV,EAAMiV,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAO3iB,GAAW0N,EAAQ,GAE5B,IAjES,eAkEP,IAAI6tG,EAAUD,EAEhB,IAjES,eAkEP,IAAIT,EA5EiB,EA4EL9K,EAGhB,GAFAwL,IAAYA,EAAUzD,GAElB93G,EAAOsQ,MAAQ5C,EAAM4C,OAASuqG,EAChC,OAAO,EAGT,IAAIvK,EAAUv/B,EAAMjxE,IAAIE,GACxB,GAAIswG,EACF,OAAOA,GAAW5iG,EAEpBqiG,GAtFuB,EAyFvBh/B,EAAMtK,IAAIzmE,EAAQ0N,GAClB,IAAI+a,EAAS8pF,EAAYgJ,EAAQv7G,GAASu7G,EAAQ7tG,GAAQqiG,EAASC,EAAY2C,EAAW5hC,GAE1F,OADAA,EAAc,OAAE/wE,GACTyoB,EAET,IAnFY,kBAoFV,GAAIwwF,EACF,OAAOA,EAAc96G,KAAK6B,IAAWi5G,EAAc96G,KAAKuP,GAG9D,OAAO,I,eC5GT,IAAIuhG,EAAa,EAAQ,MASrBhvG,EAHcb,OAAOnB,UAGQgC,eAgFjC4C,EAAOC,QAjEP,SAAsB9C,EAAQ0N,EAAOqiG,EAASC,EAAY2C,EAAW5hC,GACnE,IAAI8pC,EAtBqB,EAsBT9K,EACZyL,EAAWvM,EAAWjvG,GACtBy7G,EAAYD,EAAS9/G,OAIzB,GAAI+/G,GAHWxM,EAAWvhG,GACDhS,SAEMm/G,EAC7B,OAAO,EAGT,IADA,IAAI71G,EAAQy2G,EACLz2G,KAAS,CACd,IAAIzI,EAAMi/G,EAASx2G,GACnB,KAAM61G,EAAYt+G,KAAOmR,EAAQzN,EAAe9B,KAAKuP,EAAOnR,IAC1D,OAAO,EAIX,IAAIm/G,EAAa3qC,EAAMjxE,IAAIE,GACvBi7G,EAAalqC,EAAMjxE,IAAI4N,GAC3B,GAAIguG,GAAcT,EAChB,OAAOS,GAAchuG,GAASutG,GAAcj7G,EAE9C,IAAIyoB,GAAS,EACbsoD,EAAMtK,IAAIzmE,EAAQ0N,GAClBqjE,EAAMtK,IAAI/4D,EAAO1N,GAGjB,IADA,IAAI27G,EAAWd,IACN71G,EAAQy2G,GAAW,CAE1B,IAAInN,EAAWtuG,EADfzD,EAAMi/G,EAASx2G,IAEXm2G,EAAWztG,EAAMnR,GAErB,GAAIyzG,EACF,IAAIoL,EAAWP,EACX7K,EAAWmL,EAAU7M,EAAU/xG,EAAKmR,EAAO1N,EAAQ+wE,GACnDi/B,EAAW1B,EAAU6M,EAAU5+G,EAAKyD,EAAQ0N,EAAOqjE,GAGzD,UAAmBzzE,IAAb89G,EACG9M,IAAa6M,GAAYxI,EAAUrE,EAAU6M,EAAUpL,EAASC,EAAYj/B,GAC7EqqC,GACD,CACL3yF,GAAS,EACT,MAEFkzF,IAAaA,EAAkB,eAAPp/G,GAE1B,GAAIksB,IAAWkzF,EAAU,CACvB,IAAIC,EAAU57G,EAAOY,YACjBi7G,EAAUnuG,EAAM9M,YAGhBg7G,GAAWC,KACV,gBAAiB77G,MAAU,gBAAiB0N,IACzB,mBAAXkuG,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDpzF,GAAS,GAKb,OAFAsoD,EAAc,OAAE/wE,GAChB+wE,EAAc,OAAErjE,GACT+a,I,eCtFT,IAAIi4D,EAAU,EAAQ,MAClBo2B,EAAW,EAAQ,MACnBC,EAAc,EAAQ,IAa1Bl0G,EAAOC,QAJP,SAAkB0E,GAChB,OAAOuvG,EAAYD,EAAStvG,OAAMlK,EAAWojF,GAAUl5E,EAAO,M,eCXhE,IAAIs0G,EAA8B,iBAAV,EAAAxvD,GAAsB,EAAAA,GAAU,EAAAA,EAAOltD,SAAWA,QAAU,EAAAktD,EAEpFzpD,EAAOC,QAAUg5G,G,eCHjB,IAAIC,EAAiB,EAAQ,MACzB9B,EAAa,EAAQ,MACrBv2G,EAAO,EAAQ,MAanBb,EAAOC,QAJP,SAAoB9C,GAClB,OAAO+7G,EAAe/7G,EAAQ0D,EAAMu2G,K,eCZtC,IAAI8B,EAAiB,EAAQ,MACzB7B,EAAe,EAAQ,MACvB1L,EAAS,EAAQ,MAcrB3rG,EAAOC,QAJP,SAAsB9C,GACpB,OAAO+7G,EAAe/7G,EAAQwuG,EAAQ0L,K,eCbxC,IAAI8B,EAAY,EAAQ,MAiBxBn5G,EAAOC,QAPP,SAAoByB,EAAKhI,GACvB,IAAIuY,EAAOvQ,EAAIkoG,SACf,OAAOuP,EAAUz/G,GACbuY,EAAmB,iBAAPvY,EAAkB,SAAW,QACzCuY,EAAKvQ,M,eCdX,IAAI0wG,EAAqB,EAAQ,MAC7BvxG,EAAO,EAAQ,MAsBnBb,EAAOC,QAbP,SAAsB9C,GAIpB,IAHA,IAAIyoB,EAAS/kB,EAAK1D,GACdtE,EAAS+sB,EAAO/sB,OAEbA,KAAU,CACf,IAAIa,EAAMksB,EAAO/sB,GACbgB,EAAQsD,EAAOzD,GAEnBksB,EAAO/sB,GAAU,CAACa,EAAKG,EAAOu4G,EAAmBv4G,IAEnD,OAAO+rB,I,cCpBT,IAAIwzF,EAAe,EAAQ,MACvBvsE,EAAW,EAAQ,MAevB7sC,EAAOC,QALP,SAAmB9C,EAAQzD,GACzB,IAAIG,EAAQgzC,EAAS1vC,EAAQzD,GAC7B,OAAO0/G,EAAav/G,GAASA,OAAQY,I,eCbvC,IAGI4+G,EAHU,EAAQ,KAGHC,CAAQ/8G,OAAOc,eAAgBd,QAElDyD,EAAOC,QAAUo5G,G,eCLjB,IAAIh7G,EAAS,EAAQ,MAGjB6yG,EAAc30G,OAAOnB,UAGrBgC,EAAiB8zG,EAAY9zG,eAO7Bm8G,EAAuBrI,EAAYrxG,SAGnCovG,EAAiB5wG,EAASA,EAAO6wG,iBAAcz0G,EA6BnDuF,EAAOC,QApBP,SAAmBpG,GACjB,IAAI2/G,EAAQp8G,EAAe9B,KAAKzB,EAAOo1G,GACnC1B,EAAM1zG,EAAMo1G,GAEhB,IACEp1G,EAAMo1G,QAAkBx0G,EACxB,IAAIg/G,GAAW,EACf,MAAOl+G,IAET,IAAIqqB,EAAS2zF,EAAqBj+G,KAAKzB,GAQvC,OAPI4/G,IACED,EACF3/G,EAAMo1G,GAAkB1B,SAEjB1zG,EAAMo1G,IAGVrpF,I,eC1CT,IAAI8zF,EAAc,EAAQ,MACtBC,EAAY,EAAQ,KAMpBC,EAHcr9G,OAAOnB,UAGcw+G,qBAGnCC,EAAmBt9G,OAAOu9G,sBAS1B1C,EAAcyC,EAA+B,SAAS18G,GACxD,OAAc,MAAVA,EACK,IAETA,EAASZ,OAAOY,GACTu8G,EAAYG,EAAiB18G,IAAS,SAAS03C,GACpD,OAAO+kE,EAAqBt+G,KAAK6B,EAAQ03C,QANR8kE,EAUrC35G,EAAOC,QAAUm3G,G,eC7BjB,IAAI/I,EAAY,EAAQ,MACpBgL,EAAe,EAAQ,MACvBjC,EAAa,EAAQ,MACrBuC,EAAY,EAAQ,KAYpBtC,EATmB96G,OAAOu9G,sBASqB,SAAS38G,GAE1D,IADA,IAAIyoB,EAAS,GACNzoB,GACLkxG,EAAUzoF,EAAQwxF,EAAWj6G,IAC7BA,EAASk8G,EAAal8G,GAExB,OAAOyoB,GAN8B+zF,EASvC35G,EAAOC,QAAUo3G,G,eCxBjB,IAAIhP,EAAW,EAAQ,MACnB3kC,EAAM,EAAQ,MACd1pE,EAAU,EAAQ,MAClBwhE,EAAM,EAAQ,MACd2uC,EAAU,EAAQ,KAClBmF,EAAa,EAAQ,MACrByB,EAAW,EAAQ,KAGnBgJ,EAAS,eAETC,EAAa,mBACbC,EAAS,eACTC,EAAa,mBAEbC,EAAc,oBAGdC,EAAqBrJ,EAAS1I,GAC9BgS,EAAgBtJ,EAASrtC,GACzB42C,EAAoBvJ,EAAS/2G,GAC7BugH,EAAgBxJ,EAASv1C,GACzBg/C,EAAoBzJ,EAAS5G,GAS7BmC,EAASgD,GAGRjH,GAAYiE,EAAO,IAAIjE,EAAS,IAAIoS,YAAY,MAAQN,GACxDz2C,GAAO4oC,EAAO,IAAI5oC,IAAQq2C,GAC1B//G,GAAWsyG,EAAOtyG,EAAQV,YAAc0gH,GACxCx+C,GAAO8wC,EAAO,IAAI9wC,IAAQy+C,GAC1B9P,GAAWmC,EAAO,IAAInC,IAAY+P,KACrC5N,EAAS,SAASzyG,GAChB,IAAI+rB,EAAS0pF,EAAWz1G,GACpBk7F,EA/BQ,mBA+BDnvE,EAAsB/rB,EAAMkE,iBAActD,EACjDigH,EAAa3lB,EAAOgc,EAAShc,GAAQ,GAEzC,GAAI2lB,EACF,OAAQA,GACN,KAAKN,EAAoB,OAAOD,EAChC,KAAKE,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAC/B,KAAKO,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAGnC,OAAOt0F,IAIX5lB,EAAOC,QAAUqsG,G,SC7CjBtsG,EAAOC,QAJP,SAAkB9C,EAAQzD,GACxB,OAAiB,MAAVyD,OAAiB1C,EAAY0C,EAAOzD,K,cCT7C,IAAIi1G,EAAW,EAAQ,MACnBjE,EAAc,EAAQ,MACtBtsG,EAAU,EAAQ,MAClBwsG,EAAU,EAAQ,MAClByG,EAAW,EAAQ,MACnBzC,EAAQ,EAAQ,KAiCpB5uG,EAAOC,QAtBP,SAAiB9C,EAAQ2V,EAAM6nG,GAO7B,IAJA,IAAIx4G,GAAS,EACTtJ,GAHJia,EAAO67F,EAAS77F,EAAM3V,IAGJtE,OACd+sB,GAAS,IAEJzjB,EAAQtJ,GAAQ,CACvB,IAAIa,EAAMk1G,EAAM97F,EAAK3Q,IACrB,KAAMyjB,EAAmB,MAAVzoB,GAAkBw9G,EAAQx9G,EAAQzD,IAC/C,MAEFyD,EAASA,EAAOzD,GAElB,OAAIksB,KAAYzjB,GAAStJ,EAChB+sB,KAET/sB,EAAmB,MAAVsE,EAAiB,EAAIA,EAAOtE,SAClBw4G,EAASx4G,IAAW+xG,EAAQlxG,EAAKb,KACjDuF,EAAQjB,IAAWutG,EAAYvtG,M,SClCpC,IAWIy9G,EAAelqC,OAAO,uFAa1B1wE,EAAOC,QAJP,SAAoBq0G,GAClB,OAAOsG,EAAa76G,KAAKu0G,K,eCtB3B,IAAIuG,EAAe,EAAQ,MAc3B76G,EAAOC,QALP,WACE7F,KAAKwvG,SAAWiR,EAAeA,EAAa,MAAQ,GACpDzgH,KAAKqT,KAAO,I,QCKdzN,EAAOC,QANP,SAAoBvG,GAClB,IAAIksB,EAASxrB,KAAKsM,IAAIhN,WAAeU,KAAKwvG,SAASlwG,GAEnD,OADAU,KAAKqT,MAAQmY,EAAS,EAAI,EACnBA,I,eCbT,IAAIi1F,EAAe,EAAQ,MASvBz9G,EAHcb,OAAOnB,UAGQgC,eAoBjC4C,EAAOC,QATP,SAAiBvG,GACf,IAAIuY,EAAO7X,KAAKwvG,SAChB,GAAIiR,EAAc,CAChB,IAAIj1F,EAAS3T,EAAKvY,GAClB,MArBiB,8BAqBVksB,OAA4BnrB,EAAYmrB,EAEjD,OAAOxoB,EAAe9B,KAAK2W,EAAMvY,GAAOuY,EAAKvY,QAAOe,I,eC1BtD,IAAIogH,EAAe,EAAQ,MAMvBz9G,EAHcb,OAAOnB,UAGQgC,eAgBjC4C,EAAOC,QALP,SAAiBvG,GACf,IAAIuY,EAAO7X,KAAKwvG,SAChB,OAAOiR,OAA8BpgH,IAAdwX,EAAKvY,GAAsB0D,EAAe9B,KAAK2W,EAAMvY,K,eCnB9E,IAAImhH,EAAe,EAAQ,MAsB3B76G,EAAOC,QAPP,SAAiBvG,EAAKG,GACpB,IAAIoY,EAAO7X,KAAKwvG,SAGhB,OAFAxvG,KAAKqT,MAAQrT,KAAKsM,IAAIhN,GAAO,EAAI,EACjCuY,EAAKvY,GAAQmhH,QAA0BpgH,IAAVZ,EAfV,4BAekDA,EAC9DO,O,SClBT,IAGIgD,EAHcb,OAAOnB,UAGQgC,eAqBjC4C,EAAOC,QAZP,SAAwBE,GACtB,IAAItH,EAASsH,EAAMtH,OACf+sB,EAAS,IAAIzlB,EAAMpC,YAAYlF,GAOnC,OAJIA,GAA6B,iBAAZsH,EAAM,IAAkB/C,EAAe9B,KAAK6E,EAAO,WACtEylB,EAAOzjB,MAAQhC,EAAMgC,MACrByjB,EAAOtlB,MAAQH,EAAMG,OAEhBslB,I,eCtBT,IAAImwF,EAAmB,EAAQ,MAC3B+E,EAAgB,EAAQ,MACxBC,EAAc,EAAQ,MACtBC,EAAc,EAAQ,KACtBrI,EAAkB,EAAQ,MAwE9B3yG,EAAOC,QApCP,SAAwB9C,EAAQowG,EAAKH,GACnC,IAAIrY,EAAO53F,EAAOY,YAClB,OAAQwvG,GACN,IA3BiB,uBA4Bf,OAAOwI,EAAiB54G,GAE1B,IAvCU,mBAwCV,IAvCU,gBAwCR,OAAO,IAAI43F,GAAM53F,GAEnB,IAjCc,oBAkCZ,OAAO29G,EAAc39G,EAAQiwG,GAE/B,IAnCa,wBAmCI,IAlCJ,wBAmCb,IAlCU,qBAkCI,IAjCH,sBAiCkB,IAhClB,sBAiCX,IAhCW,sBAgCI,IA/BG,6BA+BmB,IA9BzB,uBA8ByC,IA7BzC,uBA8BV,OAAOuF,EAAgBx1G,EAAQiwG,GAEjC,IAjDS,eAkDP,OAAO,IAAIrY,EAEb,IAnDY,kBAoDZ,IAjDY,kBAkDV,OAAO,IAAIA,EAAK53F,GAElB,IAtDY,kBAuDV,OAAO49G,EAAY59G,GAErB,IAxDS,eAyDP,OAAO,IAAI43F,EAEb,IAzDY,kBA0DV,OAAOimB,EAAY79G,M,eCxEzB,IAAIywG,EAAa,EAAQ,MACrByL,EAAe,EAAQ,MACvB3H,EAAc,EAAQ,MAe1B1xG,EAAOC,QANP,SAAyB9C,GACvB,MAAqC,mBAAtBA,EAAOY,aAA8B2zG,EAAYv0G,GAE5D,GADAywG,EAAWyL,EAAal8G,M,eCb9B,IAAIkB,EAAS,EAAQ,MACjBqsG,EAAc,EAAQ,MACtBtsG,EAAU,EAAQ,MAGlB68G,EAAmB58G,EAASA,EAAO68G,wBAAqBzgH,EAc5DuF,EAAOC,QALP,SAAuBpG,GACrB,OAAOuE,EAAQvE,IAAU6wG,EAAY7wG,OAChCohH,GAAoBphH,GAASA,EAAMohH,M,SCf1C,IAGIE,EAAW,mBAoBfn7G,EAAOC,QAVP,SAAiBpG,EAAOhB,GACtB,IAAIqZ,SAAcrY,EAGlB,SAFAhB,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAARqZ,GACU,UAARA,GAAoBipG,EAASp7G,KAAKlG,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQhB,I,eCrBjD,IAAIg9F,EAAK,EAAQ,MACbic,EAAc,EAAQ,MACtBlH,EAAU,EAAQ,MAClB+B,EAAW,EAAQ,MA0BvB3sG,EAAOC,QAdP,SAAwBpG,EAAOsI,EAAOhF,GACpC,IAAKwvG,EAASxvG,GACZ,OAAO,EAET,IAAI+U,SAAc/P,EAClB,SAAY,UAAR+P,EACK4/F,EAAY30G,IAAWytG,EAAQzoG,EAAOhF,EAAOtE,QACrC,UAARqZ,GAAoB/P,KAAShF,IAE7B04F,EAAG14F,EAAOgF,GAAQtI,K,eCxB7B,IAAIuE,EAAU,EAAQ,MAClB6vG,EAAW,EAAQ,MAGnBmN,EAAe,mDACfC,EAAgB,QAuBpBr7G,EAAOC,QAbP,SAAepG,EAAOsD,GACpB,GAAIiB,EAAQvE,GACV,OAAO,EAET,IAAIqY,SAAcrY,EAClB,QAAY,UAARqY,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATrY,IAAiBo0G,EAASp0G,KAGvBwhH,EAAct7G,KAAKlG,KAAWuhH,EAAar7G,KAAKlG,IAC1C,MAAVsD,GAAkBtD,KAAS0C,OAAOY,K,SCXvC6C,EAAOC,QAPP,SAAmBpG,GACjB,IAAIqY,SAAcrY,EAClB,MAAgB,UAARqY,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVrY,EACU,OAAVA,I,eCXP,IAIMyhH,EAJFhE,EAAa,EAAQ,MAGrBiE,GACED,EAAM,SAAS10D,KAAK0wD,GAAcA,EAAWz2G,MAAQy2G,EAAWz2G,KAAK26G,UAAY,KACvE,iBAAmBF,EAAO,GAc1Ct7G,EAAOC,QAJP,SAAkB0E,GAChB,QAAS42G,GAAeA,KAAc52G,I,SCfxC,IAAIusG,EAAc30G,OAAOnB,UAgBzB4E,EAAOC,QAPP,SAAqBpG,GACnB,IAAIk7F,EAAOl7F,GAASA,EAAMkE,YAG1B,OAAOlE,KAFqB,mBAARk7F,GAAsBA,EAAK35F,WAAc81G,K,eCZ/D,IAAIvE,EAAW,EAAQ,MAcvB3sG,EAAOC,QAJP,SAA4BpG,GAC1B,OAAOA,GAAUA,IAAU8yG,EAAS9yG,K,SCCtCmG,EAAOC,QALP,WACE7F,KAAKwvG,SAAW,GAChBxvG,KAAKqT,KAAO,I,eCTd,IAAIguG,EAAe,EAAQ,MAMvBC,EAHa1iH,MAAMoC,UAGCsgH,OA4BxB17G,EAAOC,QAjBP,SAAyBvG,GACvB,IAAIuY,EAAO7X,KAAKwvG,SACZznG,EAAQs5G,EAAaxpG,EAAMvY,GAE/B,QAAIyI,EAAQ,IAIRA,GADY8P,EAAKpZ,OAAS,EAE5BoZ,EAAK2hD,MAEL8nD,EAAOpgH,KAAK2W,EAAM9P,EAAO,KAEzB/H,KAAKqT,KACA,M,eC/BT,IAAIguG,EAAe,EAAQ,MAkB3Bz7G,EAAOC,QAPP,SAAsBvG,GACpB,IAAIuY,EAAO7X,KAAKwvG,SACZznG,EAAQs5G,EAAaxpG,EAAMvY,GAE/B,OAAOyI,EAAQ,OAAI1H,EAAYwX,EAAK9P,GAAO,K,eCf7C,IAAIs5G,EAAe,EAAQ,MAe3Bz7G,EAAOC,QAJP,SAAsBvG,GACpB,OAAO+hH,EAAarhH,KAAKwvG,SAAUlwG,IAAQ,I,eCZ7C,IAAI+hH,EAAe,EAAQ,MAyB3Bz7G,EAAOC,QAbP,SAAsBvG,EAAKG,GACzB,IAAIoY,EAAO7X,KAAKwvG,SACZznG,EAAQs5G,EAAaxpG,EAAMvY,GAQ/B,OANIyI,EAAQ,KACR/H,KAAKqT,KACPwE,EAAKrW,KAAK,CAAClC,EAAKG,KAEhBoY,EAAK9P,GAAO,GAAKtI,EAEZO,O,eCtBT,IAAIwuG,EAAO,EAAQ,MACfM,EAAY,EAAQ,MACpBxlC,EAAM,EAAQ,MAkBlB1jE,EAAOC,QATP,WACE7F,KAAKqT,KAAO,EACZrT,KAAKwvG,SAAW,CACd,KAAQ,IAAIhB,EACZ,IAAO,IAAKllC,GAAOwlC,GACnB,OAAU,IAAIN,K,eChBlB,IAAI+S,EAAa,EAAQ,MAiBzB37G,EAAOC,QANP,SAAwBvG,GACtB,IAAIksB,EAAS+1F,EAAWvhH,KAAMV,GAAa,OAAEA,GAE7C,OADAU,KAAKqT,MAAQmY,EAAS,EAAI,EACnBA,I,cCdT,IAAI+1F,EAAa,EAAQ,MAezB37G,EAAOC,QAJP,SAAqBvG,GACnB,OAAOiiH,EAAWvhH,KAAMV,GAAKuD,IAAIvD,K,eCZnC,IAAIiiH,EAAa,EAAQ,MAezB37G,EAAOC,QAJP,SAAqBvG,GACnB,OAAOiiH,EAAWvhH,KAAMV,GAAKgN,IAAIhN,K,eCZnC,IAAIiiH,EAAa,EAAQ,MAqBzB37G,EAAOC,QATP,SAAqBvG,EAAKG,GACxB,IAAIoY,EAAO0pG,EAAWvhH,KAAMV,GACxB+T,EAAOwE,EAAKxE,KAIhB,OAFAwE,EAAK2xD,IAAIlqE,EAAKG,GACdO,KAAKqT,MAAQwE,EAAKxE,MAAQA,EAAO,EAAI,EAC9BrT,O,SCDT4F,EAAOC,QAVP,SAAoByB,GAClB,IAAIS,GAAS,EACTyjB,EAAS5sB,MAAM0I,EAAI+L,MAKvB,OAHA/L,EAAIyV,SAAQ,SAAStd,EAAOH,GAC1BksB,IAASzjB,GAAS,CAACzI,EAAKG,MAEnB+rB,I,SCKT5lB,EAAOC,QAVP,SAAiCvG,EAAKk3G,GACpC,OAAO,SAASzzG,GACd,OAAc,MAAVA,GAGGA,EAAOzD,KAASk3G,SACPn2G,IAAbm2G,GAA2Bl3G,KAAO6C,OAAOY,O,eCfhD,IAAIy+G,EAAU,EAAQ,MAyBtB57G,EAAOC,QAZP,SAAuB0E,GACrB,IAAIihB,EAASg2F,EAAQj3G,GAAM,SAASjL,GAIlC,OAfmB,MAYf47G,EAAM7nG,MACR6nG,EAAM18E,QAEDl/B,KAGL47G,EAAQ1vF,EAAO0vF,MACnB,OAAO1vF,I,eCtBT,IAGIi1F,EAHY,EAAQ,IAGLvS,CAAU/rG,OAAQ,UAErCyD,EAAOC,QAAU46G,G,eCLjB,IAGIlJ,EAHU,EAAQ,KAGL2H,CAAQ/8G,OAAOsE,KAAMtE,QAEtCyD,EAAOC,QAAU0xG,G,SCcjB3xG,EAAOC,QAVP,SAAsB9C,GACpB,IAAIyoB,EAAS,GACb,GAAc,MAAVzoB,EACF,IAAK,IAAIzD,KAAO6C,OAAOY,GACrByoB,EAAOhqB,KAAKlC,GAGhB,OAAOksB,I,0BChBT,IAAIqzF,EAAa,EAAQ,MAGrBvD,EAA4Cz1G,IAAYA,EAAQ01G,UAAY11G,EAG5E21G,EAAaF,GAA4C11G,IAAWA,EAAO21G,UAAY31G,EAMvF67G,EAHgBjG,GAAcA,EAAW31G,UAAYy1G,GAGtBuD,EAAW6C,QAG1CC,EAAY,WACd,IAIE,OAFYnG,GAAcA,EAAWoG,SAAWpG,EAAWoG,QAAQ,QAAQjmF,OAOpE8lF,GAAeA,EAAYI,SAAWJ,EAAYI,QAAQ,QACjE,MAAO1gH,KAXI,GAcfyE,EAAOC,QAAU87G,G,SC5BjB,IAOIxC,EAPch9G,OAAOnB,UAOcyE,SAavCG,EAAOC,QAJP,SAAwBpG,GACtB,OAAO0/G,EAAqBj+G,KAAKzB,K,SCJnCmG,EAAOC,QANP,SAAiB0E,EAAM+Z,GACrB,OAAO,SAAS/kB,GACd,OAAOgL,EAAK+Z,EAAU/kB,O,eCV1B,IAAIY,EAAQ,EAAQ,MAGhBw5G,EAAY3zG,KAAKyJ,IAgCrB7J,EAAOC,QArBP,SAAkB0E,EAAMqV,EAAO0E,GAE7B,OADA1E,EAAQ+5F,OAAoBt5G,IAAVuf,EAAuBrV,EAAK9L,OAAS,EAAKmhB,EAAO,GAC5D,WAML,IALA,IAAI3f,EAAOC,UACP6H,GAAS,EACTtJ,EAASk7G,EAAU15G,EAAKxB,OAASmhB,EAAO,GACxC7Z,EAAQnH,MAAMH,KAETsJ,EAAQtJ,GACfsH,EAAMgC,GAAS9H,EAAK2f,EAAQ7X,GAE9BA,GAAS,EAET,IADA,IAAI+5G,EAAYljH,MAAMghB,EAAQ,KACrB7X,EAAQ6X,GACfkiG,EAAU/5G,GAAS9H,EAAK8H,GAG1B,OADA+5G,EAAUliG,GAAS0E,EAAUve,GACtB5F,EAAMoK,EAAMvK,KAAM8hH,M,eC/B7B,IAAIjD,EAAa,EAAQ,MAGrBkD,EAA0B,iBAARjjH,MAAoBA,MAAQA,KAAKqD,SAAWA,QAAUrD,KAGxE6sB,EAAOkzF,GAAckD,GAAYtgH,SAAS,cAATA,GAErCmE,EAAOC,QAAU8lB,G,SCYjB/lB,EAAOC,QAZP,SAAiB9C,EAAQzD,GACvB,IAAY,gBAARA,GAAgD,mBAAhByD,EAAOzD,KAIhC,aAAPA,EAIJ,OAAOyD,EAAOzD,K,QCChBsG,EAAOC,QALP,SAAqBpG,GAEnB,OADAO,KAAKwvG,SAAShmC,IAAI/pE,EAbC,6BAcZO,O,SCFT4F,EAAOC,QAJP,SAAqBpG,GACnB,OAAOO,KAAKwvG,SAASljG,IAAI7M,K,SCO3BmG,EAAOC,QAVP,SAAoB2jE,GAClB,IAAIzhE,GAAS,EACTyjB,EAAS5sB,MAAM4qE,EAAIn2D,MAKvB,OAHAm2D,EAAIzsD,SAAQ,SAAStd,GACnB+rB,IAASzjB,GAAStI,KAEb+rB,I,aCdT,IAAIyuF,EAAkB,EAAQ,MAW1BH,EAVW,EAAQ,KAULkI,CAAS/H,GAE3Br0G,EAAOC,QAAUi0G,G,SCZjB,IAIImI,EAAY7tG,KAAKD,IA+BrBvO,EAAOC,QApBP,SAAkB0E,GAChB,IAAIqvE,EAAQ,EACRsoC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQF,IACRG,EApBO,IAoBiBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMxoC,GAzBI,IA0BR,OAAO15E,UAAU,QAGnB05E,EAAQ,EAEV,OAAOrvE,EAAKpK,WAAME,EAAWH,c,eChCjC,IAAI4uG,EAAY,EAAQ,MAcxBlpG,EAAOC,QALP,WACE7F,KAAKwvG,SAAW,IAAIV,EACpB9uG,KAAKqT,KAAO,I,SCMdzN,EAAOC,QARP,SAAqBvG,GACnB,IAAIuY,EAAO7X,KAAKwvG,SACZhkF,EAAS3T,EAAa,OAAEvY,GAG5B,OADAU,KAAKqT,KAAOwE,EAAKxE,KACVmY,I,SCDT5lB,EAAOC,QAJP,SAAkBvG,GAChB,OAAOU,KAAKwvG,SAAS3sG,IAAIvD,K,SCG3BsG,EAAOC,QAJP,SAAkBvG,GAChB,OAAOU,KAAKwvG,SAASljG,IAAIhN,K,eCV3B,IAAIwvG,EAAY,EAAQ,MACpBxlC,EAAM,EAAQ,MACd8lC,EAAW,EAAQ,MA+BvBxpG,EAAOC,QAhBP,SAAkBvG,EAAKG,GACrB,IAAIoY,EAAO7X,KAAKwvG,SAChB,GAAI33F,aAAgBi3F,EAAW,CAC7B,IAAIuT,EAAQxqG,EAAK23F,SACjB,IAAKlmC,GAAQ+4C,EAAM5jH,OAAS6jH,IAG1B,OAFAD,EAAM7gH,KAAK,CAAClC,EAAKG,IACjBO,KAAKqT,OAASwE,EAAKxE,KACZrT,KAET6X,EAAO7X,KAAKwvG,SAAW,IAAIJ,EAASiT,GAItC,OAFAxqG,EAAK2xD,IAAIlqE,EAAKG,GACdO,KAAKqT,KAAOwE,EAAKxE,KACVrT,O,SCRT4F,EAAOC,QAZP,SAAuBE,EAAOtG,EAAOs0G,GAInC,IAHA,IAAIhsG,EAAQgsG,EAAY,EACpBt1G,EAASsH,EAAMtH,SAEVsJ,EAAQtJ,GACf,GAAIsH,EAAMgC,KAAWtI,EACnB,OAAOsI,EAGX,OAAQ,I,eCnBV,IAAImpG,EAAY,EAAQ,MACpBqR,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MAe1B58G,EAAOC,QANP,SAAoBq0G,GAClB,OAAOqI,EAAWrI,GACdsI,EAAYtI,GACZhJ,EAAUgJ,K,eCdhB,IAAIuI,EAAgB,EAAQ,MAGxBC,EAAa,mGAGbC,EAAe,WASfxH,EAAesH,GAAc,SAASvI,GACxC,IAAI1uF,EAAS,GAOb,OAN6B,KAAzB0uF,EAAO9W,WAAW,IACpB53E,EAAOhqB,KAAK,IAEd04G,EAAOr0F,QAAQ68F,GAAY,SAAS9kC,EAAOj1E,EAAQi6G,EAAOC,GACxDr3F,EAAOhqB,KAAKohH,EAAQC,EAAUh9F,QAAQ88F,EAAc,MAASh6G,GAAUi1E,MAElEpyD,KAGT5lB,EAAOC,QAAUs1G,G,cC1BjB,IAAItH,EAAW,EAAQ,MAoBvBjuG,EAAOC,QARP,SAAepG,GACb,GAAoB,iBAATA,GAAqBo0G,EAASp0G,GACvC,OAAOA,EAET,IAAI+rB,EAAU/rB,EAAQ,GACtB,MAAkB,KAAV+rB,GAAkB,EAAI/rB,IAdjB,IAcwC,KAAO+rB,I,QChB9D,IAGIurF,EAHYt1G,SAAST,UAGIyE,SAqB7BG,EAAOC,QAZP,SAAkB0E,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOwsG,EAAa71G,KAAKqJ,GACzB,MAAOpJ,IACT,IACE,OAAQoJ,EAAO,GACf,MAAOpJ,KAEX,MAAO,K,SCrBT,IAAI2hH,EAAe,KAiBnBl9G,EAAOC,QAPP,SAAyBq0G,GAGvB,IAFA,IAAInyG,EAAQmyG,EAAOz7G,OAEZsJ,KAAW+6G,EAAan9G,KAAKu0G,EAAOngB,OAAOhyF,MAClD,OAAOA,I,SCdT,IASIg7G,EAAU,kDACVC,EAAS,2BAETC,EAAc,qBACdC,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAO1BK,KACXC,EAAW,oBAEXC,EAAQD,EAAWF,EADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAY/xF,KAAK,KAAO,IAAMkyF,EAAWF,EAAW,KAElHI,EAAW,MAAQ,CAACP,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAd3D,qBAciF/xF,KAAK,KAAO,IAGxGqyF,EAAYntC,OAAO0sC,EAAS,MAAQA,EAAS,KAAOQ,EAAWD,EAAO,KAiB1E39G,EAAOC,QARP,SAAqBq0G,GAEnB,IADA,IAAI1uF,EAASi4F,EAAU1J,UAAY,EAC5B0J,EAAU99G,KAAKu0G,MAClB1uF,EAEJ,OAAOA,I,eCxCT,IAAIqnF,EAAY,EAAQ,MAmCxBjtG,EAAOC,QAJP,SAAepG,GACb,OAAOozG,EAAUpzG,EA7BM,K,cCHzB,IAAIozG,EAAY,EAAQ,MA4BxBjtG,EAAOC,QAJP,SAAmBpG,GACjB,OAAOozG,EAAUpzG,EAAOikH,K,SCA1B99G,EAAOC,QANP,SAAkBpG,GAChB,OAAO,WACL,OAAOA,K,eCrBX,IAAI09G,EAAW,EAAQ,MACnB1hB,EAAK,EAAQ,MACb2hB,EAAiB,EAAQ,MACzB7L,EAAS,EAAQ,MAGjBuF,EAAc30G,OAAOnB,UAGrBgC,EAAiB8zG,EAAY9zG,eAuB7BkiF,EAAWi4B,GAAS,SAASp6G,EAAQsgF,GACvCtgF,EAASZ,OAAOY,GAEhB,IAAIgF,GAAS,EACTtJ,EAAS4kF,EAAQ5kF,OACjBukG,EAAQvkG,EAAS,EAAI4kF,EAAQ,QAAKhjF,EAMtC,IAJI2iG,GAASoa,EAAe/5B,EAAQ,GAAIA,EAAQ,GAAI2f,KAClDvkG,EAAS,KAGFsJ,EAAQtJ,GAMf,IALA,IAAIub,EAASqpE,EAAQt7E,GACjBjG,EAAQyvG,EAAOv3F,GACf2pG,GAAc,EACdC,EAAc9hH,EAAMrD,SAEfklH,EAAaC,GAAa,CACjC,IAAItkH,EAAMwC,EAAM6hH,GACZlkH,EAAQsD,EAAOzD,SAELe,IAAVZ,GACCg8F,EAAGh8F,EAAOq3G,EAAYx3G,MAAU0D,EAAe9B,KAAK6B,EAAQzD,MAC/DyD,EAAOzD,GAAO0a,EAAO1a,IAK3B,OAAOyD,KAGT6C,EAAOC,QAAUq/E,G,eC/DjBt/E,EAAOC,QAAU,EAAjB,O,SCoCAD,EAAOC,QAJP,SAAYpG,EAAOgR,GACjB,OAAOhR,IAAUgR,GAAUhR,GAAUA,GAASgR,GAAUA,I,eCjC1D,IAAI6uG,EAAc,EAAQ,MACtBuE,EAAa,EAAQ,KACrB7K,EAAe,EAAQ,MACvBh1G,EAAU,EAAQ,MAgDtB4B,EAAOC,QALP,SAAgBoxF,EAAYt5D,GAE1B,OADW35B,EAAQizF,GAAcqoB,EAAcuE,GACnC5sB,EAAY+hB,EAAar7E,EAAW,M,eChDlD,IAuCIikB,EAvCa,EAAQ,KAuCdkiE,CAtCK,EAAQ,MAwCxBl+G,EAAOC,QAAU+7C,G,cCzCjB,IAAImzD,EAAgB,EAAQ,MACxBiE,EAAe,EAAQ,MACvB+K,EAAY,EAAQ,KAGpBpK,EAAY3zG,KAAKyJ,IAiDrB7J,EAAOC,QAZP,SAAmBE,EAAO43B,EAAWo2E,GACnC,IAAIt1G,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIsJ,EAAqB,MAAbgsG,EAAoB,EAAIgQ,EAAUhQ,GAI9C,OAHIhsG,EAAQ,IACVA,EAAQ4xG,EAAUl7G,EAASsJ,EAAO,IAE7BgtG,EAAchvG,EAAOizG,EAAar7E,EAAW,GAAI51B,K,eCnD1D,IAAIosG,EAAc,EAAQ,MAqB1BvuG,EAAOC,QALP,SAAiBE,GAEf,OADsB,MAATA,GAAoBA,EAAMtH,OACvB01G,EAAYpuG,EAAO,GAAK,K,eClB1C,IAAIyrG,EAAY,EAAQ,MACpBmC,EAAW,EAAQ,MACnBqQ,EAAe,EAAQ,MACvBhgH,EAAU,EAAQ,MAqCtB4B,EAAOC,QALP,SAAiBoxF,EAAYgZ,GAE3B,OADWjsG,EAAQizF,GAAcua,EAAYmC,GACjC1c,EAAY+sB,EAAa/T,M,eCrCvC,IAAIoE,EAAU,EAAQ,MAClB2P,EAAe,EAAQ,MACvBzS,EAAS,EAAQ,MAoCrB3rG,EAAOC,QANP,SAAe9C,EAAQktG,GACrB,OAAiB,MAAVltG,EACHA,EACAsxG,EAAQtxG,EAAQihH,EAAa/T,GAAWsB,K,eCnC9C,IAAIwH,EAAU,EAAQ,MAgCtBnzG,EAAOC,QALP,SAAa9C,EAAQ2V,EAAMurG,GACzB,IAAIz4F,EAAmB,MAAVzoB,OAAiB1C,EAAY04G,EAAQh2G,EAAQ2V,GAC1D,YAAkBrY,IAAXmrB,EAAuBy4F,EAAez4F,I,eC7B/C,IAAI04F,EAAU,EAAQ,MAClBC,EAAU,EAAQ,KAiCtBv+G,EAAOC,QAJP,SAAa9C,EAAQ2V,GACnB,OAAiB,MAAV3V,GAAkBohH,EAAQphH,EAAQ2V,EAAMwrG,K,eC/BjD,IAAIE,EAAY,EAAQ,IACpBD,EAAU,EAAQ,KAgCtBv+G,EAAOC,QAJP,SAAe9C,EAAQ2V,GACrB,OAAiB,MAAV3V,GAAkBohH,EAAQphH,EAAQ2V,EAAM0rG,K,SCVjDx+G,EAAOC,QAJP,SAAkBpG,GAChB,OAAOA,I,eCjBT,IAAI4kH,EAAkB,EAAQ,MAC1BlP,EAAe,EAAQ,MAGvB2B,EAAc30G,OAAOnB,UAGrBgC,EAAiB8zG,EAAY9zG,eAG7Bw8G,EAAuB1I,EAAY0I,qBAoBnClP,EAAc+T,EAAgB,WAAa,OAAOnkH,UAApB,IAAsCmkH,EAAkB,SAAS5kH,GACjG,OAAO01G,EAAa11G,IAAUuD,EAAe9B,KAAKzB,EAAO,YACtD+/G,EAAqBt+G,KAAKzB,EAAO,WAGtCmG,EAAOC,QAAUyqG,G,SCZjB,IAAItsG,EAAUpF,MAAMoF,QAEpB4B,EAAOC,QAAU7B,G,eCzBjB,IAAI6nG,EAAa,EAAQ,MACrBoL,EAAW,EAAQ,MA+BvBrxG,EAAOC,QAJP,SAAqBpG,GACnB,OAAgB,MAATA,GAAiBw3G,EAASx3G,EAAMhB,UAAYotG,EAAWpsG,K,eC7BhE,IAAIi4G,EAAc,EAAQ,MACtBvC,EAAe,EAAQ,MA+B3BvvG,EAAOC,QAJP,SAA2BpG,GACzB,OAAO01G,EAAa11G,IAAUi4G,EAAYj4G,K,0BC7B5C,IAAIksB,EAAO,EAAQ,MACf24F,EAAY,EAAQ,MAGpBhJ,EAA4Cz1G,IAAYA,EAAQ01G,UAAY11G,EAG5E21G,EAAaF,GAA4C11G,IAAWA,EAAO21G,UAAY31G,EAMvF61G,EAHgBD,GAAcA,EAAW31G,UAAYy1G,EAG5B3vF,EAAK8vF,YAASp7G,EAsBvCkwG,GAnBiBkL,EAASA,EAAOlL,cAAWlwG,IAmBfikH,EAEjC1+G,EAAOC,QAAU0qG,G,eCrCjB,IAAIgU,EAAW,EAAQ,KACnBrS,EAAS,EAAQ,MACjB5B,EAAc,EAAQ,MACtBtsG,EAAU,EAAQ,MAClB0zG,EAAc,EAAQ,MACtBnH,EAAW,EAAQ,MACnB+G,EAAc,EAAQ,MACtB7G,EAAe,EAAQ,MAUvBztG,EAHcb,OAAOnB,UAGQgC,eA2DjC4C,EAAOC,QAxBP,SAAiBpG,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIi4G,EAAYj4G,KACXuE,EAAQvE,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAM6hH,QAC1D/Q,EAAS9wG,IAAUgxG,EAAahxG,IAAU6wG,EAAY7wG,IAC1D,OAAQA,EAAMhB,OAEhB,IAAI00G,EAAMjB,EAAOzyG,GACjB,GApDW,gBAoDP0zG,GAnDO,gBAmDUA,EACnB,OAAQ1zG,EAAM4T,KAEhB,GAAIikG,EAAY73G,GACd,OAAQ8kH,EAAS9kH,GAAOhB,OAE1B,IAAK,IAAIa,KAAOG,EACd,GAAIuD,EAAe9B,KAAKzB,EAAOH,GAC7B,OAAO,EAGX,OAAO,I,eCzET,IAAI41G,EAAa,EAAQ,MACrB3C,EAAW,EAAQ,MAmCvB3sG,EAAOC,QAVP,SAAoBpG,GAClB,IAAK8yG,EAAS9yG,GACZ,OAAO,EAIT,IAAI0zG,EAAM+B,EAAWz1G,GACrB,MA5BY,qBA4BL0zG,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,I,SCC/DvtG,EAAOC,QALP,SAAkBpG,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,mB,eCDvB,IAAI+kH,EAAY,EAAQ,MACpBrL,EAAY,EAAQ,MACpBwI,EAAW,EAAQ,MAGnB8C,EAAY9C,GAAYA,EAASrP,MAmBjCA,EAAQmS,EAAYtL,EAAUsL,GAAaD,EAE/C5+G,EAAOC,QAAUysG,G,SCIjB1sG,EAAOC,QALP,SAAkBpG,GAChB,IAAIqY,SAAcrY,EAClB,OAAgB,MAATA,IAA0B,UAARqY,GAA4B,YAARA,K,SCC/ClS,EAAOC,QAJP,SAAsBpG,GACpB,OAAgB,MAATA,GAAiC,iBAATA,I,eCzBjC,IAAIy1G,EAAa,EAAQ,MACrB+J,EAAe,EAAQ,MACvB9J,EAAe,EAAQ,MAMvB0B,EAAYp1G,SAAST,UACrB81G,EAAc30G,OAAOnB,UAGrB+1G,EAAeF,EAAUpxG,SAGzBzC,EAAiB8zG,EAAY9zG,eAG7B0hH,EAAmB3N,EAAa71G,KAAKiB,QA2CzCyD,EAAOC,QAbP,SAAuBpG,GACrB,IAAK01G,EAAa11G,IA5CJ,mBA4Ccy1G,EAAWz1G,GACrC,OAAO,EAET,IAAIg0G,EAAQwL,EAAax/G,GACzB,GAAc,OAAVg0G,EACF,OAAO,EAET,IAAI9Y,EAAO33F,EAAe9B,KAAKuyG,EAAO,gBAAkBA,EAAM9vG,YAC9D,MAAsB,mBAARg3F,GAAsBA,aAAgBA,GAClDoc,EAAa71G,KAAKy5F,IAAS+pB,I,eC1D/B,IAAIC,EAAY,EAAQ,MACpBxL,EAAY,EAAQ,MACpBwI,EAAW,EAAQ,MAGnBiD,EAAYjD,GAAYA,EAASnP,MAmBjCA,EAAQoS,EAAYzL,EAAUyL,GAAaD,EAE/C/+G,EAAOC,QAAU2sG,G,eC1BjB,IAAI0C,EAAa,EAAQ,MACrBlxG,EAAU,EAAQ,MAClBmxG,EAAe,EAAQ,MA2B3BvvG,EAAOC,QALP,SAAkBpG,GAChB,MAAuB,iBAATA,IACVuE,EAAQvE,IAAU01G,EAAa11G,IArBrB,mBAqB+By1G,EAAWz1G,K,eC1B1D,IAAIy1G,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MA2B3BvvG,EAAOC,QALP,SAAkBpG,GAChB,MAAuB,iBAATA,GACX01G,EAAa11G,IArBF,mBAqBYy1G,EAAWz1G,K,eCzBvC,IAAIolH,EAAmB,EAAQ,MAC3B1L,EAAY,EAAQ,MACpBwI,EAAW,EAAQ,MAGnBmD,EAAmBnD,GAAYA,EAASlR,aAmBxCA,EAAeqU,EAAmB3L,EAAU2L,GAAoBD,EAEpEj/G,EAAOC,QAAU4qG,G,SCLjB7qG,EAAOC,QAJP,SAAqBpG,GACnB,YAAiBY,IAAVZ,I,eClBT,IAAIslH,EAAgB,EAAQ,MACxBR,EAAW,EAAQ,KACnB7M,EAAc,EAAQ,MAkC1B9xG,EAAOC,QAJP,SAAc9C,GACZ,OAAO20G,EAAY30G,GAAUgiH,EAAchiH,GAAUwhH,EAASxhH,K,eCjChE,IAAIgiH,EAAgB,EAAQ,MACxBC,EAAa,EAAQ,KACrBtN,EAAc,EAAQ,MA6B1B9xG,EAAOC,QAJP,SAAgB9C,GACd,OAAO20G,EAAY30G,GAAUgiH,EAAchiH,GAAQ,GAAQiiH,EAAWjiH,K,QCTxE6C,EAAOC,QALP,SAAcE,GACZ,IAAItH,EAAkB,MAATsH,EAAgB,EAAIA,EAAMtH,OACvC,OAAOA,EAASsH,EAAMtH,EAAS,QAAK4B,I,eChBtC,IAAIy4G,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClBj1G,EAAU,EAAQ,MAiDtB4B,EAAOC,QALP,SAAaoxF,EAAYgZ,GAEvB,OADWjsG,EAAQizF,GAAc6hB,EAAWG,GAChChiB,EAAY+hB,EAAa/I,EAAU,M,eCjDjD,IAAImB,EAAkB,EAAQ,MAC1BsC,EAAa,EAAQ,MACrBsF,EAAe,EAAQ,MAwC3BpzG,EAAOC,QAVP,SAAmB9C,EAAQktG,GACzB,IAAIzkF,EAAS,GAMb,OALAykF,EAAW+I,EAAa/I,EAAU,GAElCyD,EAAW3wG,GAAQ,SAAStD,EAAOH,EAAKyD,GACtCquG,EAAgB5lF,EAAQlsB,EAAK2wG,EAASxwG,EAAOH,EAAKyD,OAE7CyoB,I,eCvCT,IAAIy5F,EAAe,EAAQ,MACvBC,EAAS,EAAQ,MACjB7N,EAAW,EAAQ,MA0BvBzxG,EAAOC,QANP,SAAaE,GACX,OAAQA,GAASA,EAAMtH,OACnBwmH,EAAal/G,EAAOsxG,EAAU6N,QAC9B7kH,I,eCzBN,IAAI+uG,EAAW,EAAQ,MAiDvB,SAASoS,EAAQj3G,EAAM46G,GACrB,GAAmB,mBAAR56G,GAAmC,MAAZ46G,GAAuC,mBAAZA,EAC3D,MAAM,IAAI1kH,UAhDQ,uBAkDpB,IAAI2kH,EAAW,WACb,IAAInlH,EAAOC,UACPZ,EAAM6lH,EAAWA,EAAShlH,MAAMH,KAAMC,GAAQA,EAAK,GACnDi7G,EAAQkK,EAASlK,MAErB,GAAIA,EAAM5uG,IAAIhN,GACZ,OAAO47G,EAAMr4G,IAAIvD,GAEnB,IAAIksB,EAASjhB,EAAKpK,MAAMH,KAAMC,GAE9B,OADAmlH,EAASlK,MAAQA,EAAM1xC,IAAIlqE,EAAKksB,IAAW0vF,EACpC1vF,GAGT,OADA45F,EAASlK,MAAQ,IAAKsG,EAAQ6D,OAASjW,GAChCgW,EAIT5D,EAAQ6D,MAAQjW,EAEhBxpG,EAAOC,QAAU27G,G,eCxEjB,IAAIpJ,EAAY,EAAQ,MAkCpBxzB,EAjCiB,EAAQ,KAiCjB0gC,EAAe,SAASviH,EAAQiX,EAAQq+F,GAClDD,EAAUr1G,EAAQiX,EAAQq+F,MAG5BzyG,EAAOC,QAAU++E,G,eCtCjB,IAAIqgC,EAAe,EAAQ,MACvBM,EAAS,EAAQ,KACjBlO,EAAW,EAAQ,MA0BvBzxG,EAAOC,QANP,SAAaE,GACX,OAAQA,GAASA,EAAMtH,OACnBwmH,EAAal/G,EAAOsxG,EAAUkO,QAC9BllH,I,eCzBN,IAAI4kH,EAAe,EAAQ,MACvBjM,EAAe,EAAQ,MACvBuM,EAAS,EAAQ,KA+BrB3/G,EAAOC,QANP,SAAeE,EAAOkqG,GACpB,OAAQlqG,GAASA,EAAMtH,OACnBwmH,EAAal/G,EAAOizG,EAAa/I,EAAU,GAAIsV,QAC/CllH,I,QCdNuF,EAAOC,QAJP,c,eCZA,IAAI8lB,EAAO,EAAQ,MAsBnB/lB,EAAOC,QAJG,WACR,OAAO8lB,EAAKvX,KAAKD,Q,eCnBnB,IAAIqxG,EAAW,EAAQ,MAoBnBxgC,EAnBW,EAAQ,KAmBZygC,EAAS,SAAS1iH,EAAQy2G,GACnC,OAAiB,MAAVz2G,EAAiB,GAAKyiH,EAASziH,EAAQy2G,MAGhD5zG,EAAOC,QAAUm/E,G,eCxBjB,IAAImsB,EAAe,EAAQ,KACvBuU,EAAmB,EAAQ,MAC3B3N,EAAQ,EAAQ,MAChBvD,EAAQ,EAAQ,KA4BpB5uG,EAAOC,QAJP,SAAkB6S,GAChB,OAAOq/F,EAAMr/F,GAAQy4F,EAAaqD,EAAM97F,IAASgtG,EAAiBhtG,K,eC5BpE,IA2CI0gB,EA3Cc,EAAQ,KA2CdusF,GAEZ//G,EAAOC,QAAUuzB,G,eC7CjB,IAAIwsF,EAAc,EAAQ,MACtBjS,EAAW,EAAQ,MACnBqF,EAAe,EAAQ,MACvB6M,EAAa,EAAQ,KACrB7hH,EAAU,EAAQ,MA8CtB4B,EAAOC,QAPP,SAAgBoxF,EAAYgZ,EAAUe,GACpC,IAAIzmG,EAAOvG,EAAQizF,GAAc2uB,EAAcC,EAC3C5U,EAAY/wG,UAAUzB,OAAS,EAEnC,OAAO8L,EAAK0sF,EAAY+hB,EAAa/I,EAAU,GAAIe,EAAaC,EAAW0C,K,eC/C7E,IAAI4Q,EAAW,EAAQ,KACnBrS,EAAS,EAAQ,MACjBwF,EAAc,EAAQ,MACtBoO,EAAW,EAAQ,MACnBC,EAAa,EAAQ,MAyCzBngH,EAAOC,QAdP,SAAcoxF,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIygB,EAAYzgB,GACd,OAAO6uB,EAAS7uB,GAAc8uB,EAAW9uB,GAAcA,EAAWx4F,OAEpE,IAAI00G,EAAMjB,EAAOjb,GACjB,MAhCW,gBAgCPkc,GA/BO,gBA+BUA,EACZlc,EAAW5jF,KAEbkxG,EAASttB,GAAYx4F,S,eC1C9B,IAAI01G,EAAc,EAAQ,MACtB6R,EAAc,EAAQ,MACtB7I,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MA+BzBr0B,EAASo0B,GAAS,SAASlmB,EAAYoiB,GACzC,GAAkB,MAAdpiB,EACF,MAAO,GAET,IAAIx4F,EAAS46G,EAAU56G,OAMvB,OALIA,EAAS,GAAK2+G,EAAenmB,EAAYoiB,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACH56G,EAAS,GAAK2+G,EAAe/D,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB2M,EAAY/uB,EAAYkd,EAAYkF,EAAW,GAAI,OAG5DzzG,EAAOC,QAAUkjF,G,QCzBjBnjF,EAAOC,QAJP,WACE,MAAO,K,SCFTD,EAAOC,QAJP,WACE,OAAO,I,eCdT,IAAI26F,EAAW,EAAQ,MAyCvB56F,EAAOC,QAZP,SAAkBpG,GAChB,OAAKA,EA3BQ,YA8BbA,EAAQ+gG,EAAS/gG,KACSA,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,I,cC/BjC,IAAIg+G,EAAW,EAAQ,MAmCvB73G,EAAOC,QAPP,SAAmBpG,GACjB,IAAI+rB,EAASiyF,EAASh+G,GAClBwmH,EAAYz6F,EAAS,EAEzB,OAAOA,GAAWA,EAAUy6F,EAAYz6F,EAASy6F,EAAYz6F,EAAU,I,eChCzE,IAAI06F,EAAW,EAAQ,MACnB3T,EAAW,EAAQ,MACnBsB,EAAW,EAAQ,MAMnBsS,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAex9G,SA8CnBlD,EAAOC,QArBP,SAAkBpG,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIo0G,EAASp0G,GACX,OA1CM,IA4CR,GAAI8yG,EAAS9yG,GAAQ,CACnB,IAAIgR,EAAgC,mBAAjBhR,EAAMwB,QAAwBxB,EAAMwB,UAAYxB,EACnEA,EAAQ8yG,EAAS9hG,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAAThR,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQymH,EAASzmH,GACjB,IAAIg5F,EAAW2tB,EAAWzgH,KAAKlG,GAC/B,OAAQg5F,GAAY4tB,EAAU1gH,KAAKlG,GAC/B6mH,EAAa7mH,EAAMqF,MAAM,GAAI2zF,EAAW,EAAI,GAC3C0tB,EAAWxgH,KAAKlG,GAvDb,KAuD6BA,I,eC5DvC,IAAI6xG,EAAa,EAAQ,MACrBC,EAAS,EAAQ,MA8BrB3rG,EAAOC,QAJP,SAAuBpG,GACrB,OAAO6xG,EAAW7xG,EAAO8xG,EAAO9xG,M,eC5BlC,IAAI66G,EAAe,EAAQ,KA2B3B10G,EAAOC,QAJP,SAAkBpG,GAChB,OAAgB,MAATA,EAAgB,GAAK66G,EAAa76G,K,eCxB3C,IAAI+xG,EAAY,EAAQ,MACpBgC,EAAa,EAAQ,MACrBE,EAAa,EAAQ,MACrBsF,EAAe,EAAQ,MACvBiG,EAAe,EAAQ,MACvBj7G,EAAU,EAAQ,MAClBusG,EAAW,EAAQ,MACnB1E,EAAa,EAAQ,MACrB0G,EAAW,EAAQ,MACnB9B,EAAe,EAAQ,MAuD3B7qG,EAAOC,QAvBP,SAAmB9C,EAAQktG,EAAUe,GACnC,IAAIL,EAAQ3sG,EAAQjB,GAChBwjH,EAAY5V,GAASJ,EAASxtG,IAAW0tG,EAAa1tG,GAG1D,GADAktG,EAAW+I,EAAa/I,EAAU,GACf,MAAfe,EAAqB,CACvB,IAAIrW,EAAO53F,GAAUA,EAAOY,YAE1BqtG,EADEuV,EACY5V,EAAQ,IAAIhW,EAAO,GAE1B4X,EAASxvG,IACF8oG,EAAWlR,GAAQ6Y,EAAWyL,EAAal8G,IAG3C,GAMlB,OAHCwjH,EAAY/U,EAAYkC,GAAY3wG,GAAQ,SAAStD,EAAOsI,EAAOhF,GAClE,OAAOktG,EAASe,EAAavxG,EAAOsI,EAAOhF,MAEtCiuG,I,eC7DT,IAAImD,EAAc,EAAQ,MACtBgJ,EAAW,EAAQ,MACnBqJ,EAAW,EAAQ,MACnBhO,EAAoB,EAAQ,MAkB5BpM,EAAQ+Q,GAAS,SAAS/iF,GAC5B,OAAOosF,EAASrS,EAAY/5E,EAAQ,EAAGo+E,GAAmB,OAG5D5yG,EAAOC,QAAUumG,G,eCzBjB,IAAI3mG,EAAW,EAAQ,MAGnBghH,EAAY,EAwBhB7gH,EAAOC,QALP,SAAkBqI,GAChB,IAAI8sB,IAAOyrF,EACX,OAAOhhH,EAASyI,GAAU8sB,I,eCxB5B,IAAI0rF,EAAa,EAAQ,MACrBjgH,EAAO,EAAQ,MAgCnBb,EAAOC,QAJP,SAAgB9C,GACd,OAAiB,MAAVA,EAAiB,GAAK2jH,EAAW3jH,EAAQ0D,EAAK1D,M,eC9BvD,IAAI0uG,EAAc,EAAQ,MACtBkV,EAAgB,EAAQ,MAsB5B/gH,EAAOC,QAJP,SAAmB/D,EAAOgK,GACxB,OAAO66G,EAAc7kH,GAAS,GAAIgK,GAAU,GAAI2lG,K,6CCpB3C,IAAI,EAAiB,CAG1BmV,QAAS,MAETjyD,OAAQ,SAERhsD,OAAQ,SAERgvF,UAAW,GAKXkvB,aAAa,EAGbC,WAAY,MCjBd,SAASliB,IAA2Q,OAA9PA,EAAWziG,OAAOwxB,QAAU,SAAU9xB,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAS9Z,UAAUxB,GAAI,IAAK,IAAIY,KAAO0a,EAAc7X,OAAOnB,UAAUgC,eAAe9B,KAAK8Y,EAAQ1a,KAAQuC,EAAOvC,GAAO0a,EAAO1a,IAAY,OAAOuC,IAA2B1B,MAAMH,KAAME,WAKzS,IAAI0oB,EAAwB,SAAgBzN,GACjD,GAAIA,EACF,MAAM,IAAIhP,MAAM,uPAGlB,OAAOhK,OAAO4C,OAAO,IAGvB6/F,EAASh8E,EAAQ,EAAgB,CAC/Bm+F,eCZ0B,CAAC,SAAU,SDarCC,eCX0B,CAAC,SAAU,YAAa,e,gFCHzCC,EAAW,CACpBpnG,KAAK,G,oBCGHqnG,EAAe,CAAC,qBACTC,GAA4B,EAAAC,EAAA,IAF5B,OAE0CF,GAAeliB,IAClE,IAAI,kBACFqiB,GACEriB,EAKJ,SAASvjC,IACP,KAAMzhE,gBAAgByhE,GACpB,MAAM,IAAI6b,YAAY,oDAiY1B,OAvXA7b,EAAKzgE,UAAUq4D,SAAW,SAAUiuD,GAClC,OAAOtnH,KAAKshC,UAAU+3B,SAASiuD,IAGjC7lD,EAAKzgE,UAAU8W,KAAO,OACtB2pD,EAAKzgE,UAAUumH,QAAS,EACxB9lD,EAAKzgE,UAAUwmH,QAAU,GAUzB/lD,EAAKzgE,UAAUsgC,QAAU,WACvB,IAAIv1B,EAAO/L,KAAKynH,SAASJ,EAAmB,IAExCpnH,EAAO,GAWX,MAAO,CACLo5D,SATF,SAAkBiuD,GAChB,IAAIvhF,EAAIuhF,GAAS,GAIjB,OAkVJ,SAAwBA,GACtB,IAAK,IAAI7sE,KAAU6sE,EACjB,IAAI,QAAeA,EAAO7sE,IACpBA,KAAUwsE,EACZ,MAAM,IAAI96G,MAAM,sCAAwCsuC,EAAS,2BAxVrEitE,CAAe3hF,GAERh6B,EAAKg6B,EAAG9lC,EAPH,SA6BhBwhE,EAAKzgE,UAAUymH,SAAW,SAAUE,EAAMC,GACxC,MAAM,IAAIz7G,MAAM,iDAAmDnM,KAAK8X,OAQ1E2pD,EAAKzgE,UAAU+b,QAAU,SAAUsmB,GAEjC,MAAM,IAAIl3B,MAAM,2CAUlBs1D,EAAKzgE,UAAUsG,IAAM,SAAU+7B,GAE7B,MAAM,IAAIl3B,MAAM,uCAUlBs1D,EAAKzgE,UAAU6mH,QAAU,SAAUx6F,GACjC,KAAK,EAAAy6F,EAAA,IAAOz6F,GACV,MAAM,IAAI5sB,UAAU,wCAGtB,OAAO4sB,GAUTo0C,EAAKzgE,UAAU+mH,SAAW,SAAU1kF,GAGlCA,EAASrjC,KAAM,KAAM,MAErB,SAASgoH,EAAU36F,EAAMgW,GACvBhW,EAAKtQ,SAAQ,SAAUosE,EAAOzwE,EAAMvD,GAClCkuB,EAAS8lD,EAAOzwE,EAAMvD,GAEtB6yG,EAAU7+B,EAAO9lD,MAIrB2kF,CAAUhoH,KAAMqjC,IAyBlBo+B,EAAKzgE,UAAUsjB,UAAY,SAAU+e,GAYnC,OAXA,SAAS4kF,EAAW9+B,EAAOzwE,EAAMvD,GAC/B,IAAI+yG,EAAc7kF,EAAS8lD,EAAOzwE,EAAMvD,GAExC,OAAI+yG,IAAgB/+B,EAEX++B,EAGF/+B,EAAM7hF,IAAI2gH,GAGZA,CAAWjoH,KAAM,KAAM,OAkBhCyhE,EAAKzgE,UAAUqH,OAAS,SAAUg7B,GAChC,IAAI6T,EAAQ,GAMZ,OALAl3C,KAAK+nH,UAAS,SAAU16F,EAAM3U,EAAMvD,GAC9BkuB,EAAShW,EAAM3U,EAAMvD,IACvB+hC,EAAM11C,KAAK6rB,MAGR6pB,GAQTuqB,EAAKzgE,UAAUijG,MAAQ,WAErB,MAAM,IAAI93F,MAAM,kCAQlBs1D,EAAKzgE,UAAU0nF,UAAY,WACzB,OAAO1oF,KAAKsH,KAAI,SAAU+lB,GACxB,OAAOA,EAAKq7D,gBAWhBjnB,EAAKzgE,UAAUg7F,OAAS,SAAUvrF,GAChC,QAAOA,IAAQ,QAAgBzQ,KAAMyQ,IAmBvCgxD,EAAKzgE,UAAUyE,SAAW,SAAU0V,GAClC,IAAIgtG,EAAenoH,KAAKooH,iBAAiBjtG,GAEzC,YAA4B,IAAjBgtG,EACFA,EAGFnoH,KAAKqoH,UAAUltG,IAUxBsmD,EAAKzgE,UAAUkgG,OAAS,WACtB,MAAM,IAAI/0F,MAAM,sDAAwDnM,KAAK8X,OAmB/E2pD,EAAKzgE,UAAUsnH,OAAS,SAAUntG,GAChC,IAAIgtG,EAAenoH,KAAKooH,iBAAiBjtG,GAEzC,YAA4B,IAAjBgtG,EACFA,EAGFnoH,KAAKsoH,OAAOntG,IAUrBsmD,EAAKzgE,UAAUqnH,UAAY,WAEzB,MAAM,IAAIl8G,MAAM,iCAAmCnM,KAAK8X,OAmB1D2pD,EAAKzgE,UAAUunH,MAAQ,SAAUptG,GAC/B,IAAIgtG,EAAenoH,KAAKooH,iBAAiBjtG,GAEzC,YAA4B,IAAjBgtG,EACFA,EAGFnoH,KAAKwoH,OAAOrtG,IAWrBsmD,EAAKzgE,UAAUwnH,OAAS,SAAUrtG,GAEhC,MAAM,IAAIhP,MAAM,8BAAgCnM,KAAK8X,OAOvD2pD,EAAKzgE,UAAUonH,iBAAmB,SAAUjtG,GAC1C,GAAIA,GAA8B,iBAAZA,EACpB,cAAeA,EAAQwwB,SACrB,IAAK,SACL,IAAK,YACH,OAEF,IAAK,WACH,OAAOxwB,EAAQwwB,QAAQ3rC,KAAMmb,GAE/B,QACE,MAAM,IAAI1a,UAAU,6CAU5BghE,EAAKzgE,UAAUynH,cAAgB,WAC7B,OAAOzoH,KAAK8X,MAQd2pD,EAAKzgE,UAAU0nH,WAAa,WAC1B,OAAO1oH,MAmBFyhE,IACN,CACDknD,SAAS,EACTpB,QAAQ,I,UChZN,EAAe,CAAC,QACTqB,GAAiC,EAAAxB,EAAA,IAFjC,YAE+C,GAAepiB,IACvE,IAAI,KACFvjC,GACEujC,EAQJ,SAAS6jB,EAAU3+D,GACjB,KAAMlqD,gBAAgB6oH,GACpB,MAAM,IAAIvrC,YAAY,oDAKxB,GAFAt9E,KAAKkqD,MAAQA,GAAS,IAEjBtrD,MAAMoF,QAAQhE,KAAKkqD,SAAWlqD,KAAKkqD,MAAM7+C,MAAMy8G,EAAA,IAClD,MAAM,IAAIrnH,UAAU,mCA6JxB,OAzJAooH,EAAU7nH,UAAY,IAAIygE,EAC1BonD,EAAU7nH,UAAU8W,KAAO,YAC3B+wG,EAAU7nH,UAAU8nH,aAAc,EAelCD,EAAU7nH,UAAUymH,SAAW,SAAUE,EAAMC,GAC7C,IAAImB,GAAY,QAAI/oH,KAAKkqD,OAAO,SAAUE,GACxC,OAAOA,EAAKq9D,SAASE,EAAMC,MAI7B,GAFsC,UAAvBD,EAAK/+F,OAAO+rC,OAEb,CACZ,IAAIA,EAASgzD,EAAKhzD,OAClB,OAAO,SAAuB2yD,EAAOrnH,EAAM+oH,GACzC,OAAOr0D,GAAO,QAAIo0D,GAAW,SAAUE,GACrC,OAAOA,EAAS3B,EAAOrnH,EAAM+oH,QAIjC,OAAO,SAAuB1B,EAAOrnH,EAAM+oH,GACzC,OAAO,QAAID,GAAW,SAAUE,GAC9B,OAAOA,EAAS3B,EAAOrnH,EAAM+oH,QAWrCH,EAAU7nH,UAAU+b,QAAU,SAAUsmB,GACtC,IAAK,IAAI3kC,EAAI,EAAGA,EAAIsB,KAAKkqD,MAAMzrD,OAAQC,IAErC2kC,EADWrjC,KAAKkqD,MAAMxrD,GACP,SAAWA,EAAI,IAAKsB,OAWvC6oH,EAAU7nH,UAAUsG,IAAM,SAAU+7B,GAGlC,IAFA,IAAI6mB,EAAQ,GAEHxrD,EAAI,EAAGA,EAAIsB,KAAKkqD,MAAMzrD,OAAQC,IACrCwrD,EAAMxrD,GAAKsB,KAAK6nH,QAAQxkF,EAASrjC,KAAKkqD,MAAMxrD,GAAI,SAAWA,EAAI,IAAKsB,OAGtE,OAAO,IAAI6oH,EAAU3+D,IAQvB2+D,EAAU7nH,UAAUijG,MAAQ,WAC1B,OAAO,IAAI4kB,EAAU7oH,KAAKkqD,MAAMplD,MAAM,KAUxC+jH,EAAU7nH,UAAUqnH,UAAY,SAAUltG,GAIxC,MAAO,IAHKnb,KAAKkqD,MAAM5iD,KAAI,SAAU+lB,GACnC,OAAOA,EAAK5nB,SAAS0V,MAEJiW,KAAK,MAAQ,KAQlCy3F,EAAU7nH,UAAUkgG,OAAS,WAC3B,MAAO,CACLgoB,OAAQ,YACRh/D,MAAOlqD,KAAKkqD,QAYhB2+D,EAAUM,SAAW,SAAUhiB,GAC7B,OAAO,IAAI0hB,EAAU1hB,EAAKj9C,QAU5B2+D,EAAU7nH,UAAUsnH,OAAS,SAAUntG,GAIrC,MAAO,kEAHKnb,KAAKkqD,MAAM5iD,KAAI,SAAU+lB,GACnC,OAAOA,EAAKi7F,OAAOntG,MAE4DiW,KAAK,yCAA2C,mEASnIy3F,EAAU7nH,UAAUwnH,OAAS,SAAUrtG,GACrC,IAAI4qB,EAAI,mBAcR,OAbA/lC,KAAKkqD,MAAMntC,SAAQ,SAAUsQ,GACvBA,EAAK68B,MACPnkB,GAAK1Y,EAAK68B,MAAM5iD,KAAI,SAAU8hF,GAC5B,OAAOA,EAAUm/B,MAAMptG,MACtBiW,KAAK,KAER2U,GAAK1Y,EAAKk7F,MAAMptG,GAIlB4qB,GAAK,UAEPA,GAAK,kBAIA8iF,IACN,CACDF,SAAS,EACTpB,QAAQ,ICpLN,EAAe,CAAC,YAAa,QACtB6B,GAAiC,EAAAhC,EAAA,IAFjC,YAE+C,GAAepiB,IACvE,IAAI,UACFqkB,EAAS,KACT5nD,GACEujC,EAWJ,SAASskB,EAAUC,GACjB,KAAMvpH,gBAAgBspH,GACpB,MAAM,IAAIhsC,YAAY,oDAIxB,IAAK1+E,MAAMoF,QAAQulH,GAAS,MAAM,IAAIp9G,MAAM,kBAC5CnM,KAAKupH,OAASA,EAAOjiH,KAAI,SAAUkiH,GACjC,IAAIn8F,EAAOm8F,GAASA,EAAMn8F,KACtB2wC,GAAUwrD,QAA2BnpH,IAAlBmpH,EAAMxrD,SAAwBwrD,EAAMxrD,QAC3D,KAAK,EAAA8pD,EAAA,IAAOz6F,GAAO,MAAM,IAAI5sB,UAAU,kCACvC,GAAuB,kBAAZu9D,EAAuB,MAAM,IAAIv9D,UAAU,wCACtD,MAAO,CACL4sB,KAAMA,EACN2wC,QAASA,MA0Jf,OArJAsrD,EAAUtoH,UAAY,IAAIygE,EAC1B6nD,EAAUtoH,UAAU8W,KAAO,YAC3BwxG,EAAUtoH,UAAUyoH,aAAc,EAelCH,EAAUtoH,UAAUymH,SAAW,SAAUE,EAAMC,GAC7C,IAAI8B,GAAa,QAAI1pH,KAAKupH,QAAQ,SAAUC,GAC1C,MAAO,CACLnwD,SAAUmwD,EAAMn8F,KAAKo6F,SAASE,EAAMC,GACpC5pD,QAASwrD,EAAMxrD,YAGnB,OAAO,SAAwBspD,EAAOrnH,EAAM+oH,GAC1C,IAAI3yC,EAAU,GAQd,OAPA,QAAQqzC,GAAY,SAAuBF,GACzC,IAAIh+F,EAASg+F,EAAMnwD,SAASiuD,EAAOrnH,EAAM+oH,GAErCQ,EAAMxrD,SACRqY,EAAQ70E,KAAKgqB,MAGV,IAAI69F,EAAUhzC,KASzBizC,EAAUtoH,UAAU+b,QAAU,SAAUsmB,GACtC,IAAK,IAAI3kC,EAAI,EAAGA,EAAIsB,KAAKupH,OAAO9qH,OAAQC,IACtC2kC,EAASrjC,KAAKupH,OAAO7qH,GAAG2uB,KAAM,UAAY3uB,EAAI,SAAUsB,OAW5DspH,EAAUtoH,UAAUsG,IAAM,SAAU+7B,GAGlC,IAFA,IAAIkmF,EAAS,GAEJ7qH,EAAI,EAAGA,EAAIsB,KAAKupH,OAAO9qH,OAAQC,IAAK,CAC3C,IAAI8qH,EAAQxpH,KAAKupH,OAAO7qH,GAEpB2uB,EAAOrtB,KAAK6nH,QAAQxkF,EAASmmF,EAAMn8F,KAAM,UAAY3uB,EAAI,SAAUsB,OAEvEupH,EAAO7qH,GAAK,CACV2uB,KAAMA,EACN2wC,QAASwrD,EAAMxrD,SAInB,OAAO,IAAIsrD,EAAUC,IAQvBD,EAAUtoH,UAAUijG,MAAQ,WAO1B,OAAO,IAAIqlB,EANEtpH,KAAKupH,OAAOjiH,KAAI,SAAUkiH,GACrC,MAAO,CACLn8F,KAAMm8F,EAAMn8F,KACZ2wC,QAASwrD,EAAMxrD,cAarBsrD,EAAUtoH,UAAUqnH,UAAY,SAAUltG,GACxC,OAAOnb,KAAKupH,OAAOjiH,KAAI,SAAUqiH,GAC/B,OAAOA,EAAMt8F,KAAK5nB,SAAS0V,IAAYwuG,EAAM3rD,QAAU,GAAK,QAC3D5sC,KAAK,OAQVk4F,EAAUtoH,UAAUkgG,OAAS,WAC3B,MAAO,CACLgoB,OAAQ,YACRK,OAAQvpH,KAAKupH,SAYjBD,EAAUH,SAAW,SAAUhiB,GAC7B,OAAO,IAAImiB,EAAUniB,EAAKoiB,SAU5BD,EAAUtoH,UAAUsnH,OAAS,SAAUntG,GACrC,OAAOnb,KAAKupH,OAAOjiH,KAAI,SAAUqiH,GAC/B,OAAOA,EAAMt8F,KAAKi7F,OAAOntG,IAAYwuG,EAAM3rD,QAAU,GAAK,4CACzD5sC,KAAK,+CASVk4F,EAAUtoH,UAAUwnH,OAAS,SAAUrtG,GACrC,OAAOnb,KAAKupH,OAAOjiH,KAAI,SAAUqiH,GAC/B,OAAOA,EAAMt8F,KAAKk7F,MAAMptG,IAAYwuG,EAAM3rD,QAAU,GAAK,QACxD5sC,KAAK,aAGHk4F,IACN,CACDX,SAAS,EACTpB,QAAQ,I,oBC5LCqC,EAAe,CAExBC,MAAO,IACP7wG,MAAO,UACP8wG,KAAM,IACNC,KAAM,SACNC,MAAO,UACPC,MAAO,UACPC,MAAO,UACPp4B,MAAO,UACPq4B,QAAS,IACTvD,QAAS,YACTwD,WAAY,eACZC,KAAM,IACNC,KAAM,SACNC,IAAK,IACLC,IAAK,QACLC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,KAAM,IACNC,KAAM,SACNC,MAAO,IACPh5C,MAAO,UACPi5C,SAAU,aACVC,OAAQ,WACRC,OAAQ,WACRC,GAAI,IACJC,GAAI,OACJC,GAAI,IACJC,GAAI,OACJC,GAAI,OACJtpB,GAAI,OACJupB,QAAS,IACTC,QAAS,IACTC,GAAI,OACJhoB,GAAI,OACJioB,MAAO,UACPC,IAAK,IACLC,IAAK,QACLC,OAAQ,WACRC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,IAAK,IACLC,IAAK,QACLC,QAAS,YACTC,QAAS,YACTC,IAAK,QACLC,IAAK,QACLC,OAAQ,WACRC,IAAK,IACLC,IAAK,QACLC,IAAK,QACLC,IAAK,QACLC,MAAO,UACPC,MAAO,UAEPC,KAAM,iBACNC,MAAO,kBAEPruH,EAAG,IAEH6/F,IAAK,UACLyuB,IAAK,UACLC,SAAU,UACV5uC,SAAU,UACV6uC,GAAI,UACJt+B,IAAK,QACLvuF,UAAW,eAEF8sH,EAAiB,CAC1BC,UAAW,SACXC,WAAY,KACZC,UAAW,IACX3lH,IAAK,IACL4lH,OAAQ,YAERC,UAAW,IACXC,WAAY,IACZC,OAAQ,MAER/qF,IAAK,QACLne,SAAU,SACVg3E,OAAQ,SAERmyB,YAAa,UAEbC,UAAW,KAEX9uB,IAAK,QACLvyF,IAAK,IACLg1F,SAAU,IACVssB,GAAI,eACJC,UAAW,KACXC,gBAAiB,KACjBC,cAAe,MACfC,MAAO,IACPC,QAAS,QACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,QACXC,SAAU,QACVC,OAAQ,MACRC,OAAQ,iBACRC,MAAO,IACPC,IAAK,UACLC,IAAK,WACLC,GAAI,SAEKC,EAAiB,CAE1B7kH,IAAK,CACHT,EAAG,6BAELgD,IAAK,CACH/C,EAAG,oBAAoBkC,OAAOyhH,EAAe5gH,IAAK,uBAEpD2uF,KAAM,CACJ3xF,EAAG,yBAELitB,KAAM,CACJjtB,EAAG,yCAELulH,KAAM,CACJvlH,EAAG,+BAELiyF,OAAQ,CACNhyF,EAAG,kCAELokH,UAAW,CACTpkH,EAAG,oBAAoBkC,OAAOyhH,EAAeS,UAAW,uBAE1DD,YAAa,CACXnkH,EAAG,oBAAoBkC,OAAOyhH,EAAeQ,YAAa,uBAE5DJ,OAAQ,CACN/jH,EAAG,oBAAoBkC,OAAOyhH,EAAeI,OAAQ,uBAEvDnkH,IAAK,CACHG,EAAG,kCAELw0E,MAAO,WAAWryE,OAAOyhH,EAAexlH,IAAK,0BAC7ConH,IAAK,CACHxlH,EAAG,8CAELtB,MAAO,CACLsB,EAAG,2CAELU,IAAK,8BACL65F,MAAO,gCACP74F,IAAK,CACH1B,EAAG,gCACHC,EAAG,+CAELw6F,MAAO,CACLz6F,EAAG,uCAELylH,MAAO,CACLzlH,EAAG,kCACHC,EAAG,iDAELw+C,KAAM,qCACN82C,IAAK,CACHt1F,EAAG,oBAAoBkC,OAAOyhH,EAAeruB,IAAK,uBAEpDt6E,SAAU,CACRhb,EAAG,oBAAoBkC,OAAOyhH,EAAe3oG,SAAU,uBAEzDyqG,KAAM,CACJ1lH,EAAG,gCACHC,OAAGnJ,GAGL6uH,QAAS,CACP1lH,EAAG,kCAEL2lH,SAAU,CACR3lH,EAAG,yCAEL7B,IAAK,CACH6B,EAAG,4BAA4BkC,OAAOyhH,EAAexlH,IAAK,iBAE5DqB,MAAO,CACLO,EAAG,yCACHC,OAAGnJ,GAGLgiG,KAAM,CACJ94F,EAAG,8CAELtD,KAAM,CACJsD,EAAG,sBAEL6lH,OAAQ,CACN7lH,EAAG,+BAELg4F,SAAU,CACR/3F,EAAG,oBAAoBkC,OAAOyhH,EAAe5rB,SAAU,uBAEzDksB,WAAY,CACVlkH,EAAG,GAAGmC,OAAOyhH,EAAeM,WAAY,8BAE1CD,UAAW,CACTjkH,EAAG,GAAGmC,OAAOyhH,EAAeK,UAAW,8BAGzCe,OAAQ,CACN/kH,EAAG,oBAAoBkC,OAAOyhH,EAAeoB,OAAQ,uBAEvDb,OAAQ,CACNnkH,EAAG4jH,EAAeO,OAAS,6BAE7Be,MAAO,CACLjlH,EAAG,oBAAoBkC,OAAOyhH,EAAesB,MAAO,uBAEtDD,OAAQ,CACNhlH,EAAG,oBAAoBkC,OAAOyhH,EAAeqB,OAAQ,uBAEvDV,UAAW,CACTtkH,EAAG,oBAAoBkC,OAAOyhH,EAAeW,UAAW,uBAE1DC,gBAAiB,CACfvkH,EAAG,oBAAoBkC,OAAOyhH,EAAeY,gBAAiB,uBAEhEC,cAAe,CACbxkH,EAAG,oBAAoBkC,OAAOyhH,EAAea,cAAe,uBAG9DqB,YAAa,CACX9lH,EAAG,4BAEL+lH,QAAS,CACP/lH,EAAG,4BAELgmH,WAAY,CACV/lH,EAAG,qCAGLjK,IAAK,CACHgK,EAAG,kCAELimH,KAAM,CACJjmH,EAAG,+BAELu0E,GAAI,CACFv0E,EAAG,+CAELwwB,GAAI,CACFxwB,EAAG,+CAGLmlH,IAAK,CACHllH,EAAG,oBAAoBkC,OAAOyhH,EAAeuB,IAAK,uBAEpD/rF,IAAK,CACHp5B,EAAG4jH,EAAexqF,IAAM,6BAE1BisF,GAAI,CACFplH,EAAG,oBAAoBkC,OAAOyhH,EAAeyB,GAAI,uBAEnDD,IAAK,CACHnlH,EAAG,oBAAoBkC,OAAOyhH,EAAewB,IAAK,uBAGpDc,MAAO,CACLjmH,EAAG,6DAEL6jH,WAAY,CACV9jH,EAAG,4BAA4BmC,OAAOyhH,EAAeE,aAEvDqC,IAAK,CACHnmH,EAAG,kCAELo+C,IAAK,CACHn+C,EAAG,6CAELmmH,KAAM,CACJpmH,EAAG,kCAELqmH,IAAK,CACHrmH,EAAG,kCAELsmH,MAAO,CACLtmH,EAAG,eAAemC,OAAOyhH,EAAexlH,IAAK,mBAE/CqE,MAAO,CACLzC,EAAG,yCAEL6jH,UAAW,CACT7jH,EAAG,4BAA4BmC,OAAOyhH,EAAeC,YAGvD0C,aAAc,CACZtmH,EAAG,mCAELumH,oBAAqB,CACnBvmH,EAAG,gEAEL8jH,UAAW,CACT/jH,EAAG,4BAA4BmC,OAAOyhH,EAAeG,YAEvDrD,MAAO,CACL1gH,EAAG,oCAGL0kH,MAAO,CACLzkH,EAAG,oBAAoBkC,OAAOyhH,EAAec,MAAO,uBAEtDG,OAAQ,CACN5kH,EAAG,oBAAoBkC,OAAOyhH,EAAeiB,OAAQ,uBAEvDE,SAAU,CACR9kH,EAAG,oBAAoBkC,OAAOyhH,EAAemB,SAAU,uBAEzDH,QAAS,CACP3kH,EAAG,oBAAoBkC,OAAOyhH,EAAegB,QAAS,uBAExDE,UAAW,CACT7kH,EAAG,oBAAoBkC,OAAOyhH,EAAekB,UAAW,uBAE1DH,QAAS,CACP1kH,EAAG,oBAAoBkC,OAAOyhH,EAAee,QAAS,uBAGxD8B,IAAK,CACHzmH,EAAG,gCAGLkG,IAAK,8BACL+iB,IAAK,8BACLy9F,SAAU,sCAEV1xC,KAAM,CACJh1E,EAAG,uCAELu1E,MAAO,CACLv1E,EAAG,wCAEL2mH,KAAM,CACJ3mH,EAAG,uCAEL4mH,MAAO,CACL5mH,EAAG,wCAEL6mH,KAAM,CACJ7mH,EAAG,uCAEL8mH,MAAO,CACL9mH,EAAG,gDAEL+mH,KAAM,CACJ/mH,EAAG,uCAELgnH,MAAO,CACLhnH,EAAG,gDAELi1E,KAAM,CACJj1E,EAAG,uCAELs1E,MAAO,CACLt1E,EAAG,wCAEL+0E,KAAM,CACJ/0E,EAAG,uCAELg8C,MAAO,CACL/7C,EAAG,yCAELo1E,MAAO,CACLr1E,EAAG,wCAELoL,IAAK,CACHpL,EAAG,kCAEL4zE,KAAM,CACJ5zE,EAAG,mCAELinH,IAAK,CACHjnH,EAAG,kCAELknH,KAAM,CACJlnH,EAAG,mCAELmnH,IAAK,CACHnnH,EAAG,kCAELonH,KAAM,CACJpnH,EAAG,2CAELqnH,IAAK,CACHrnH,EAAG,kCAELsnH,KAAM,CACJtnH,EAAG,2CAELsL,IAAK,CACHtL,EAAG,kCAEL6zE,KAAM,CACJ7zE,EAAG,mCAELi2F,IAAK,CACHj2F,EAAG,kCAELwzF,KAAM,CACJxzF,EAAG,mCAGLskH,GAAI,CACFrkH,EAAG,oBAAoBkC,OAAOyhH,EAAeU,GAAI,uBAGnDiD,QAAS,SAAiBzjG,EAAMlS,GAE9B,OAAOkS,EAAKptB,KAAK,GAAGsoH,SAGtB5/G,OAAQ,CACNW,EAAG,IACHC,EAAG,4BACHC,EAAG,sDAEL0wG,OAAQ,CACN5wG,EAAG,eACHC,EAAG,6CAELwnH,UAAW,CACTznH,EAAG,IACHC,EAAG,6BAELynH,QAAS,CACP1nH,EAAG,IACHC,EAAG,4BACHC,EAAG,oCAAoCkC,OAAOk+G,EAAalrH,EAAG,4CAEhEi2D,OAAQ,CACNrrD,EAAG,iCACHC,EAAG,4BACHC,EAAG,6BAELynH,OAAQ,CACN3nH,EAAG,iCACHC,EAAG,6BAELL,KAAM,CACJK,EAAG,4BACHC,EAAG,uDAIH0nH,EAAa,CACfC,IAAK,WAEA,SAASC,EAAYlX,GAC1B,OAAO,EAAeA,EAAQ,CAC5BhV,oBAAoB,IAKjB,SAASmsB,EAAS3rH,EAAM4rH,GAG7B,OAFAA,OAA2B,IAAXA,GAAiCA,IAG3C,QAAeJ,EAAYxrH,GACtBwrH,EAAWxrH,GAGb,YAAc0rH,EAAY1rH,GAAQ,KAGvC,QAAekkH,EAAclkH,GACxBkkH,EAAalkH,GAGf0rH,EAAY1rH,GC3drB,IACI,EAAe,CAAC,QACT6rH,GAAoC,EAAAnK,EAAA,IAFpC,eAEkD,GAAepiB,IAC1E,IAAI,KACFvjC,GACEujC,EAcJ,SAASwsB,EAAa/xH,GACpB,KAAMO,gBAAgBwxH,GACpB,MAAM,IAAIl0C,YAAY,oDAGxBt9E,KAAKP,MAAQA,EA6Jf,OA1JA+xH,EAAaxwH,UAAY,IAAIygE,EAC7B+vD,EAAaxwH,UAAU8W,KAAO,eAC9B05G,EAAaxwH,UAAUywH,gBAAiB,EAexCD,EAAaxwH,UAAUymH,SAAW,SAAUE,EAAMC,GAChD,IAAInoH,EAAQO,KAAKP,MACjB,OAAO,WACL,OAAOA,IASX+xH,EAAaxwH,UAAU+b,QAAU,SAAUsmB,KAU3CmuF,EAAaxwH,UAAUsG,IAAM,SAAU+7B,GACrC,OAAOrjC,KAAKikG,SAQdutB,EAAaxwH,UAAUijG,MAAQ,WAC7B,OAAO,IAAIutB,EAAaxxH,KAAKP,QAS/B+xH,EAAaxwH,UAAUqnH,UAAY,SAAUltG,GAC3C,OAAO,QAAOnb,KAAKP,MAAO0b,IAS5Bq2G,EAAaxwH,UAAUsnH,OAAS,SAAUntG,GACxC,IAAI1b,EAAQO,KAAKqoH,UAAUltG,GAE3B,QAAQ,QAAOnb,KAAKP,QAClB,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+BA,EAAQ,UAEhD,IAAK,SACH,MAAO,6BAA+BA,EAAQ,UAEhD,IAAK,UACH,MAAO,8BAAgCA,EAAQ,UAEjD,IAAK,OACH,MAAO,kCAAoCA,EAAQ,UAErD,IAAK,YACH,MAAO,gCAAkCA,EAAQ,UAEnD,QACE,MAAO,6BAA+BA,EAAQ,YASpD+xH,EAAaxwH,UAAUkgG,OAAS,WAC9B,MAAO,CACLgoB,OAAQ,eACRzpH,MAAOO,KAAKP,QAYhB+xH,EAAarI,SAAW,SAAUhiB,GAChC,OAAO,IAAIqqB,EAAarqB,EAAK1nG,QAS/B+xH,EAAaxwH,UAAUwnH,OAAS,SAAUrtG,GACxC,IAAI1b,EAAQO,KAAKqoH,UAAUltG,GAE3B,QAAQ,QAAOnb,KAAKP,QAClB,IAAK,SACH,MAAO,YAAc2xH,EAAY3xH,GAAS,IAE5C,IAAK,SACL,IAAK,YAED,IAAKmiE,SAAS5hE,KAAKP,OACjB,OAAOO,KAAKP,MAAMwB,UAAY,EAAI,WAAa,UAGjD,IAAI8G,EAAQtI,EAAMw4E,cAAc3vE,QAAQ,KAExC,OAAe,IAAXP,EACKtI,EAAMwyC,UAAU,EAAGlqC,GAAS,aAAetI,EAAMwyC,UAAUlqC,EAAQ,GAAK,IAG5EtI,EAET,IAAK,WACH,OAAOO,KAAKP,MAAMiyH,UAEpB,QACE,OAAOjyH,IAIN+xH,IACN,CACD7I,SAAS,EACTpB,QAAQ,I,UCtLN,EAAe,CAAC,QACToK,GAAkC,EAAAvK,EAAA,IAFlC,aAEgD,GAAepiB,IACxE,IAAI,KACFvjC,GACEujC,EAQJ,SAAS4sB,EAAWj4E,GAClB,KAAM35C,gBAAgB4xH,GACpB,MAAM,IAAIt0C,YAAY,oDAKxB,GAFAt9E,KAAK25C,WAAaA,GAAc,GAE5BA,IAC0B,iBAAfA,IAA6Bx3C,OAAOsE,KAAKkzC,GAAYtuC,OAAM,SAAU/L,GAChF,OAAO,EAAAwoH,EAAA,IAAOnuE,EAAWr6C,QAEzB,MAAM,IAAImB,UAAU,oCAsL1B,OAjLAmxH,EAAW5wH,UAAY,IAAIygE,EAC3BmwD,EAAW5wH,UAAU8W,KAAO,aAC5B85G,EAAW5wH,UAAU6wH,cAAe,EAepCD,EAAW5wH,UAAUymH,SAAW,SAAUE,EAAMC,GAC9C,IAAIkK,EAAc,GAElB,IAAK,IAAIxyH,KAAOU,KAAK25C,WACnB,IAAI,QAAe35C,KAAK25C,WAAYr6C,GAAM,CAGxC,IAAIyyH,GAAiB,EAAA7X,EAAA,IAAU56G,GAC3B0yH,EAAYpmH,KAAKsR,MAAM60G,GAE3B,KAAK,QAAe/xH,KAAK25C,WAAYq4E,GACnC,MAAM,IAAI7lH,MAAM,0BAA4B6lH,EAAY,KAG1DF,EAAYE,GAAahyH,KAAK25C,WAAWr6C,GAAKmoH,SAASE,EAAMC,GAIjE,OAAO,SAAwBN,EAAOrnH,EAAM+oH,GAC1C,IAAIvmH,EAAM,GAEV,IAAK,IAAIwvH,KAAQH,GACX,QAAeA,EAAaG,KAC9BxvH,EAAIwvH,GAAQH,EAAYG,GAAM3K,EAAOrnH,EAAM+oH,IAI/C,OAAOvmH,IASXmvH,EAAW5wH,UAAU+b,QAAU,SAAUsmB,GACvC,IAAK,IAAI/jC,KAAOU,KAAK25C,YACf,QAAe35C,KAAK25C,WAAYr6C,IAClC+jC,EAASrjC,KAAK25C,WAAWr6C,GAAM,eAAgB,EAAA46G,EAAA,IAAU56G,GAAO,IAAKU,OAY3E4xH,EAAW5wH,UAAUsG,IAAM,SAAU+7B,GACnC,IAAIsW,EAAa,GAEjB,IAAK,IAAIr6C,KAAOU,KAAK25C,YACf,QAAe35C,KAAK25C,WAAYr6C,KAClCq6C,EAAWr6C,GAAOU,KAAK6nH,QAAQxkF,EAASrjC,KAAK25C,WAAWr6C,GAAM,eAAgB,EAAA46G,EAAA,IAAU56G,GAAO,IAAKU,QAIxG,OAAO,IAAI4xH,EAAWj4E,IAQxBi4E,EAAW5wH,UAAUijG,MAAQ,WAC3B,IAAItqD,EAAa,GAEjB,IAAK,IAAIr6C,KAAOU,KAAK25C,YACf,QAAe35C,KAAK25C,WAAYr6C,KAClCq6C,EAAWr6C,GAAOU,KAAK25C,WAAWr6C,IAItC,OAAO,IAAIsyH,EAAWj4E,IAUxBi4E,EAAW5wH,UAAUqnH,UAAY,SAAUltG,GACzC,IAAI5M,EAAU,GAEd,IAAK,IAAIjP,KAAOU,KAAK25C,YACf,QAAe35C,KAAK25C,WAAYr6C,IAClCiP,EAAQ/M,MAAK,EAAA04G,EAAA,IAAU56G,GAAO,KAAOU,KAAK25C,WAAWr6C,GAAKmG,SAAS0V,IAIvE,MAAO,IAAM5M,EAAQ6iB,KAAK,MAAQ,KAQpCwgG,EAAW5wH,UAAUkgG,OAAS,WAC5B,MAAO,CACLgoB,OAAQ,aACRvvE,WAAY35C,KAAK25C,aAYrBi4E,EAAWzI,SAAW,SAAUhiB,GAC9B,OAAO,IAAIyqB,EAAWzqB,EAAKxtD,aAU7Bi4E,EAAW5wH,UAAUsnH,OAAS,SAAUntG,GACtC,IAAI5M,EAAU,GAEd,IAAK,IAAIjP,KAAOU,KAAK25C,YACf,QAAe35C,KAAK25C,WAAYr6C,IAClCiP,EAAQ/M,KAAK,4CAA6C,QAAOlC,GAApD,8HAAgMU,KAAK25C,WAAWr6C,GAAKgpH,OAAOntG,IAI7O,MAAO,iEAAmE5M,EAAQ6iB,KAAK,yCAA2C,kEASpIwgG,EAAW5wH,UAAUwnH,OAAS,SAAUrtG,GACtC,IAAI5M,EAAU,GAEd,IAAK,IAAIjP,KAAOU,KAAK25C,YACf,QAAe35C,KAAK25C,WAAYr6C,IAClCiP,EAAQ/M,KAAK,YAAclC,EAAM,QAAUU,KAAK25C,WAAWr6C,GAAKipH,MAAMptG,GAAW,QAIrF,MAAO,8BAA8BzP,OAAO6C,EAAQ6iB,KAAK,MAAO,2BAG3DwgG,IACN,CACDjJ,SAAS,EACTpB,QAAQ,ICnNN,EAAe,CAAC,QACT2K,GAAuC,EAAA9K,EAAA,IAFvC,kBAEqD,GAAepiB,IAC7E,IAAI,KACFvjC,GACEujC,EASJ,SAASmtB,EAAgB/lG,GACvB,KAAMpsB,gBAAgBmyH,GACpB,MAAM,IAAI70C,YAAY,oDAIxB,KAAK,EAAAwqC,EAAA,IAAO17F,GACV,MAAM,IAAI3rB,UAAU,yCAGtBT,KAAKosB,QAAUA,EAqIjB,OAlIA+lG,EAAgBnxH,UAAY,IAAIygE,EAChC0wD,EAAgBnxH,UAAU8W,KAAO,kBACjCq6G,EAAgBnxH,UAAUoxH,mBAAoB,EAe9CD,EAAgBnxH,UAAUymH,SAAW,SAAUE,EAAMC,GACnD,OAAO5nH,KAAKosB,QAAQq7F,SAASE,EAAMC,IASrCuK,EAAgBnxH,UAAU0nH,WAAa,WACrC,OAAO1oH,KAAKosB,QAAQs8F,cAQtByJ,EAAgBnxH,UAAU+b,QAAU,SAAUsmB,GAC5CA,EAASrjC,KAAKosB,QAAS,UAAWpsB,OAUpCmyH,EAAgBnxH,UAAUsG,IAAM,SAAU+7B,GAExC,OAAO,IAAI8uF,EADG9uF,EAASrjC,KAAKosB,QAAS,UAAWpsB,QASlDmyH,EAAgBnxH,UAAUijG,MAAQ,WAChC,OAAO,IAAIkuB,EAAgBnyH,KAAKosB,UAUlC+lG,EAAgBnxH,UAAUqnH,UAAY,SAAUltG,GAC9C,OAAKA,GAAWA,IAAYA,EAAQk3G,aAAel3G,GAAmC,SAAxBA,EAAQk3G,YAC7D,IAAMryH,KAAKosB,QAAQ3mB,SAAS0V,GAAW,IAGzCnb,KAAKosB,QAAQ3mB,SAAS0V,IAQ/Bg3G,EAAgBnxH,UAAUkgG,OAAS,WACjC,MAAO,CACLgoB,OAAQ,kBACR98F,QAASpsB,KAAKosB,UAYlB+lG,EAAgBhJ,SAAW,SAAUhiB,GACnC,OAAO,IAAIgrB,EAAgBhrB,EAAK/6E,UAUlC+lG,EAAgBnxH,UAAUsnH,OAAS,SAAUntG,GAC3C,OAAKA,GAAWA,IAAYA,EAAQk3G,aAAel3G,GAAmC,SAAxBA,EAAQk3G,YAC7D,iEAAmEryH,KAAKosB,QAAQk8F,OAAOntG,GAAW,iEAGpGnb,KAAKosB,QAAQk8F,OAAOntG,IAU7Bg3G,EAAgBnxH,UAAUwnH,OAAS,SAAUrtG,GAC3C,OAAKA,GAAWA,IAAYA,EAAQk3G,aAAel3G,GAAmC,SAAxBA,EAAQk3G,YAC7D,UAAU3mH,OAAO1L,KAAKosB,QAAQm8F,MAAMptG,GAAU,YAGhDnb,KAAKosB,QAAQm8F,MAAMptG,IAGrBg3G,IACN,CACDxJ,SAAS,EACTpB,QAAQ,IC/IC5tE,EAAa,CAAC,CAEvB24E,eAAgB,GAChBC,uBAAwB,IACvB,CAEDC,gBAAiB,CACfC,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,IAId,CAED,kBAAmB,CACjBC,cAAe,OACfC,gBAAiB,KAElB,CAED,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,qBAAsB,CACpBD,cAAe,OACfC,gBAAiB,KAElB,CAED,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAElB,CAED,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAElB,CAED,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,KAElB,CAED,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,+BAAgC,CAC9BD,cAAe,OACfC,gBAAiB,IAEnB,6BAA8B,CAC5BD,cAAe,OACfC,gBAAiB,KAElB,CAED,kBAAmB,CACjBD,cAAe,OACfC,gBAAiB,KAElB,CAEDE,UAAW,IACV,CAED,mBAAoB,CAClBH,cAAe,OACfC,gBAAiB,CAAC,mBAAoB,0BAExC,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,KAElB,CAED,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,uBAE5F,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,GACjBJ,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,GAKf,2BAA4B,CAC1BC,cAAe,OACfC,gBAAiB,CAAC,wBAAyB,sBAAuB,2BAA4B,0BAEhG,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,yBAA0B,CACxBD,cAAe,SAEjB,0BAA2B,CACzBA,cAAe,SAEjB,sBAAuB,CACrBA,cAAe,SAEjB,mBAAoB,CAClBA,cAAe,UAEhB,CAED,mBAAoB,CAClBA,cAAe,QACfC,gBAAiB,GACjBH,kBAAkB,GAKpB,sBAAuB,CACrBE,cAAe,QACfC,gBAAiB,KAElB,CAED,yBAA0B,CACxBD,cAAe,SAEhB,CAED,yBAA0B,CACxBA,cAAe,UAaZ,SAASI,EAAc73C,EAAOk3C,GACnC,IAAIhlG,EAAO8tD,EAES,SAAhBk3C,IAEFhlG,EAAO8tD,EAAMutC,cAKf,IAFA,IAAIuK,EAAa5lG,EAAKo7F,gBAEb/pH,EAAI,EAAGA,EAAIi7C,EAAWl7C,OAAQC,IACrC,GAAIu0H,KAAct5E,EAAWj7C,GAC3B,OAAOA,EAIX,OAAO,KAaF,SAASw0H,EAAiB/3C,EAAOk3C,GACtC,IAAIhlG,EAAO8tD,EAES,SAAhBk3C,IAEFhlG,EAAO8tD,EAAMutC,cAGf,IAAIuK,EAAa5lG,EAAKo7F,gBAClB1gH,EAAQirH,EAAc3lG,EAAMglG,GAEhC,GAAc,OAAVtqH,EAEF,OAAO,KAGT,IAAIpF,EAAWg3C,EAAW5xC,GAAOkrH,GAEjC,IAAI,QAAetwH,EAAU,iBAAkB,CAC7C,GAA+B,SAA3BA,EAASiwH,cACX,MAAO,OAGT,GAA+B,UAA3BjwH,EAASiwH,cACX,MAAO,QAIT,MAAMzmH,MAAM,IAAO8mH,EAAa,oCAAwCtwH,EAASiwH,cAAgB,MAInG,OAAO,KAYF,SAASO,EAAkBC,EAAOC,EAAOhB,GAE9C,IAAI9wH,EAAoB,SAAhB8wH,EAAyBe,EAAM1K,aAAe0K,EAClD1rH,EAAoB,SAAhB2qH,EAAyBe,EAAM1K,aAAe2K,EAClDC,EAAc/xH,EAAEknH,gBAChB8K,EAAc7rH,EAAE+gH,gBAChB1gH,EAAQirH,EAAczxH,EAAG8wH,GAE7B,GAAc,OAAVtqH,EAEF,OAAO,KAGT,IAAIpF,EAAWg3C,EAAW5xC,GAAOurH,GAEjC,IAAI,QAAe3wH,EAAU,oBAAsBA,EAASkwH,2BAA2Bj0H,MAAO,CAC5F,IAAK,IAAIF,EAAI,EAAGA,EAAIiE,EAASkwH,gBAAgBp0H,OAAQC,IACnD,GAAIiE,EAASkwH,gBAAgBn0H,KAAO60H,EAClC,OAAO,EAIX,OAAO,EAIT,OAAO,KC9ST,IACI,EAAe,CAAC,QACTC,GAAsC,EAAApM,EAAA,IAFtC,iBAEoD,GAAepiB,IAC5E,IAAI,KACFvjC,GACEujC,EAWJ,SAAS8tB,EAAeW,EAAcnmG,GACpC,KAAMttB,gBAAgB8yH,GACpB,MAAM,IAAIx1C,YAAY,oDAGxB,IAAK1+E,MAAMoF,QAAQyvH,GAAe,MAAM,IAAIhzH,UAAU,2CACtD,IAAK7B,MAAMoF,QAAQspB,GAAS,MAAM,IAAI7sB,UAAU,qCAChD,GAAIgzH,EAAah1H,SAAW6uB,EAAO7uB,OAAS,EAAG,MAAM,IAAIgC,UAAU,sFACnET,KAAKyzH,aAAeA,EACpBzzH,KAAKstB,OAASA,EAiLhB,OA9KAwlG,EAAe9xH,UAAY,IAAIygE,EAC/BqxD,EAAe9xH,UAAU8W,KAAO,iBAChCg7G,EAAe9xH,UAAU0yH,kBAAmB,EAe5CZ,EAAe9xH,UAAUymH,SAAW,SAAUE,EAAMC,GAClD,IAAI9oH,EAAOkB,KACP2zH,EAAW3zH,KAAKstB,OAAOhmB,KAAIxD,GAAKA,EAAE2jH,SAASE,EAAMC,KACrD,OAAO,SAA4BN,EAAOrnH,EAAM+oH,GAI9C,IAHA,IAAI4K,EACAC,EAAUF,EAAS,GAAGrM,EAAOrnH,EAAM+oH,GAE9BtqH,EAAI,EAAGA,EAAII,EAAK20H,aAAah1H,OAAQC,IAK5C,GAJAk1H,EAAUC,EACVA,EAAUF,EAASj1H,EAAI,GAAG4oH,EAAOrnH,EAAM+oH,KAC1B,QAAgBrB,EAAM7oH,EAAK20H,aAAa/0H,GAEhDo1H,CAAOF,EAASC,GACnB,OAAO,EAIX,OAAO,IASXf,EAAe9xH,UAAU+b,QAAU,SAAUsmB,GAC3CrjC,KAAKstB,OAAOvQ,SAAQ,CAACvX,EAAG9G,IAAM2kC,EAAS79B,EAAG,UAAY9G,EAAI,IAAKsB,OAAOA,OAUxE8yH,EAAe9xH,UAAUsG,IAAM,SAAU+7B,GACvC,OAAO,IAAIyvF,EAAe9yH,KAAKyzH,aAAa3uH,QAAS9E,KAAKstB,OAAOhmB,KAAI,CAAC9B,EAAG9G,IAAMsB,KAAK6nH,QAAQxkF,EAAS79B,EAAG,UAAY9G,EAAI,IAAKsB,QAAQA,QAQvI8yH,EAAe9xH,UAAUijG,MAAQ,WAC/B,OAAO,IAAI6uB,EAAe9yH,KAAKyzH,aAAczzH,KAAKstB,SASpDwlG,EAAe9xH,UAAUqnH,UAAY,SAAUltG,GAiB7C,IAhBA,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrE0B,EAAaf,EAAchzH,KAAMqyH,GACjC2B,EAAeh0H,KAAKstB,OAAOhmB,KAAI,SAAUxD,EAAGiE,GAC9C,IAAIksH,EAAkBjB,EAAclvH,EAAGuuH,GACvC,MAAuB,QAAhBA,GAA6C,OAApB4B,GAA4BA,GAAmBF,EAAa,IAAMjwH,EAAE2B,SAAS0V,GAAW,IAAMrX,EAAE2B,SAAS0V,MAEvI+4G,EAAc,CAChBjG,MAAO,KACPC,QAAS,KACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,KACXC,SAAU,MAERtmH,EAAMgsH,EAAa,GAEdt1H,EAAI,EAAGA,EAAIsB,KAAKyzH,aAAah1H,OAAQC,IAC5CsJ,GAAO,IAAMksH,EAAYl0H,KAAKyzH,aAAa/0H,IAAM,IAAMs1H,EAAat1H,EAAI,GAG1E,OAAOsJ,GAQT8qH,EAAe9xH,UAAUkgG,OAAS,WAChC,MAAO,CACLgoB,OAAQ,iBACRuK,aAAczzH,KAAKyzH,aACnBnmG,OAAQttB,KAAKstB,SAYjBwlG,EAAe3J,SAAW,SAAUhiB,GAClC,OAAO,IAAI2rB,EAAe3rB,EAAKssB,aAActsB,EAAK75E,SASpDwlG,EAAe9xH,UAAUsnH,OAAS,SAAUntG,GAiB1C,IAhBA,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrE0B,EAAaf,EAAchzH,KAAMqyH,GACjC2B,EAAeh0H,KAAKstB,OAAOhmB,KAAI,SAAUxD,EAAGiE,GAC9C,IAAIksH,EAAkBjB,EAAclvH,EAAGuuH,GACvC,MAAuB,QAAhBA,GAA6C,OAApB4B,GAA4BA,GAAmBF,EAAa,iEAAmEjwH,EAAEwkH,OAAOntG,GAAW,iEAAmErX,EAAEwkH,OAAOntG,MAE7P+4G,EAAc,CAChBjG,MAAO,KACPC,QAAS,KACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,KACXC,SAAU,MAERtmH,EAAMgsH,EAAa,GAEdt1H,EAAI,EAAGA,EAAIsB,KAAKyzH,aAAah1H,OAAQC,IAC5CsJ,GAAO,mFAAoF,QAAOksH,EAAYl0H,KAAKyzH,aAAa/0H,KAAO,UAAYs1H,EAAat1H,EAAI,GAGtK,OAAOsJ,GAST8qH,EAAe9xH,UAAUwnH,OAAS,SAAUrtG,GAS1C,IARA,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrE0B,EAAaf,EAAchzH,KAAMqyH,GACjC2B,EAAeh0H,KAAKstB,OAAOhmB,KAAI,SAAUxD,EAAGiE,GAC9C,IAAIksH,EAAkBjB,EAAclvH,EAAGuuH,GACvC,MAAuB,QAAhBA,GAA6C,OAApB4B,GAA4BA,GAAmBF,EAAa,UAAYjwH,EAAEykH,MAAMptG,GAAW,UAAYrX,EAAEykH,MAAMptG,MAE7InT,EAAMgsH,EAAa,GAEdt1H,EAAI,EAAGA,EAAIsB,KAAKyzH,aAAah1H,OAAQC,IAC5CsJ,GAAOmlH,EAAentH,KAAKyzH,aAAa/0H,IAAMs1H,EAAat1H,EAAI,GAGjE,OAAOsJ,GAGF8qH,IACN,CACDnK,SAAS,EACTpB,QAAQ,IC7MN,EAAe,CAAC,MAAO,QAChB4M,GAAkC,EAAA/M,EAAA,IAFlC,QAEgD,GAAepiB,IACxE,IAAI,GACF98E,EAAE,KACFy/F,GACE3iB,EAoBJ,SAASovB,EAAM30H,GACb,KAAMO,gBAAgBo0H,GACpB,MAAM,IAAI92C,YAAY,qDAGpB,EAAAwqC,EAAA,IAAQroH,GACVO,KAAKP,MAAQA,EAAMA,MAEnBO,KAAKP,MAAQA,EAqFjB,SAAS40H,EAAgB3uH,EAAMy/G,IAC7B,QAAKiP,EAAMpzH,UAAW0E,GAAM,WAC1B,IAAI3F,EAAKolH,IAET,GAAkB,mBAAPplH,EACT,OAAOu0H,EAASv0H,MActB,SAASu0H,EAASv0H,GAChB,OAAO,WAGL,IAFA,IAAIE,EAAO,CAACD,KAAKP,OAERf,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IACpCuB,EAAKvB,EAAI,GAAKwB,UAAUxB,GAG1B,OAAO,IAAI01H,EAAMr0H,EAAGI,MAAMJ,EAAIE,KAxGlCm0H,EAAMpzH,UAAU8W,KAAO,QACvBs8G,EAAMpzH,UAAUuzH,SAAU,EAO1BH,EAAMpzH,UAAUrB,KAAO,WACrB,OAAOK,KAAKP,OASd20H,EAAMpzH,UAAUC,QAAU,WACxB,OAAOjB,KAAKP,OAQd20H,EAAMpzH,UAAUyE,SAAW,WACzB,OAAO,QAAOzF,KAAKP,QAQrB20H,EAAMpzH,UAAUkgG,OAAS,WACvB,MAAO,CACLgoB,OAAQ,QACRzpH,MAAOO,KAAKP,QAYhB20H,EAAMjL,SAAW,SAAUhiB,GACzB,OAAO,IAAIitB,EAAMjtB,EAAK1nG,QAuExB20H,EAAMI,YAAc,SAAU7nB,EAAM8nB,GAClC,GAAoB,iBAAT9nB,GA7Db,SAAqBjnG,EAAM3F,GACP,mBAAPA,IACTq0H,EAAMpzH,UAAU0E,GAAQ4uH,EAASv0H,IA6DjCy0H,CAAY7nB,EAAM8nB,OACb,CACL,IAAIjvB,EAAQ,SAAekvB,IACrB,QAAe/nB,EAAM+nB,SAAmCr0H,IAAzBs0H,EAAcD,IAC/CL,EAAgBK,GAAO,IAAM/nB,EAAK+nB,MAKtC,IAAK,IAAIA,KAAS/nB,EAChBnH,EAAMkvB,KAKZ,IAAIC,EAAgB,CAClBC,YAAY,EACZC,MAAM,EACN/8G,MAAM,EACNg9G,SAAS,EACT3tB,MAAM,EACNznG,OAAO,EACP60H,SAAS,GAeX,OAXAH,EAAMI,YAAY7M,GAEdz/F,GACFA,EAAG,UAAU,SAAUxiB,EAAMy/G,EAAUzsG,GAChCA,GAEH27G,EAAgB3uH,EAAMy/G,MAKrBiP,IACN,CACDzL,SAAS,ICjNP,EAAe,CAAC,WACToM,GAA+B,EAAA3N,EAAA,IAF/B,UAE6C,GAAepiB,IACrE,IAAI,QACF8vB,GACE9vB,EAQJ,OAAO,SAAiB1lG,EAAKG,GAC3B,IAAIkE,EAAcmxH,EAAQr1H,GAASA,EAAMypH,QAEzC,OAAIvlH,GAA+C,mBAAzBA,EAAYwlH,SAC7BxlH,EAAYwlH,SAAS1pH,GAGvBA,MCjBP,EAAe,CAAC,QACTu1H,GAAuC,EAAA5N,EAAA,IAFvC,kBAEqD,GAAepiB,IAC7E,IAAI,KACFvjC,GACEujC,EAYJ,SAASwtB,EAAgBppE,EAAW6rE,EAAUC,GAC5C,KAAMl1H,gBAAgBwyH,GACpB,MAAM,IAAIl1C,YAAY,oDAGxB,KAAK,EAAAwqC,EAAA,IAAO1+D,GAAY,MAAM,IAAI3oD,UAAU,sCAC5C,KAAK,EAAAqnH,EAAA,IAAOmN,GAAW,MAAM,IAAIx0H,UAAU,qCAC3C,KAAK,EAAAqnH,EAAA,IAAOoN,GAAY,MAAM,IAAIz0H,UAAU,sCAC5CT,KAAKopD,UAAYA,EACjBppD,KAAKi1H,SAAWA,EAChBj1H,KAAKk1H,UAAYA,EA6MnB,OA1MA1C,EAAgBxxH,UAAY,IAAIygE,EAChC+wD,EAAgBxxH,UAAU8W,KAAO,kBACjC06G,EAAgBxxH,UAAUm0H,mBAAoB,EAe9C3C,EAAgBxxH,UAAUymH,SAAW,SAAUE,EAAMC,GACnD,IAAIwN,EAAgBp1H,KAAKopD,UAAUq+D,SAASE,EAAMC,GAE9CyN,EAAer1H,KAAKi1H,SAASxN,SAASE,EAAMC,GAE5C0N,EAAgBt1H,KAAKk1H,UAAUzN,SAASE,EAAMC,GAElD,OAAO,SAA6BN,EAAOrnH,EAAM+oH,GAC/C,OAuJJ,SAAuB5/D,GACrB,GAAyB,iBAAdA,GAA+C,kBAAdA,GAAgD,iBAAdA,EAC5E,QAASA,EAGX,GAAIA,EAAW,CACb,IAAI,EAAA0+D,EAAA,IAAY1+D,GACd,OAAQA,EAAUkyC,SAGpB,IAAI,EAAAwsB,EAAA,IAAU1+D,GACZ,SAAUA,EAAUrvB,KAAMqvB,EAAU00B,IAGtC,IAAI,EAAAgqC,EAAA,IAAO1+D,GACT,QAASA,EAAU3pD,MAIvB,GAAI2pD,QACF,OAAO,EAGT,MAAM,IAAI3oD,UAAU,mCAAoC,QAAO2oD,GAAa,KA9KnEmsE,CAAcH,EAAc9N,EAAOrnH,EAAM+oH,IAAYqM,EAAa/N,EAAOrnH,EAAM+oH,GAAWsM,EAAchO,EAAOrnH,EAAM+oH,KAShIwJ,EAAgBxxH,UAAU+b,QAAU,SAAUsmB,GAC5CA,EAASrjC,KAAKopD,UAAW,YAAappD,MACtCqjC,EAASrjC,KAAKi1H,SAAU,WAAYj1H,MACpCqjC,EAASrjC,KAAKk1H,UAAW,YAAal1H,OAUxCwyH,EAAgBxxH,UAAUsG,IAAM,SAAU+7B,GACxC,OAAO,IAAImvF,EAAgBxyH,KAAK6nH,QAAQxkF,EAASrjC,KAAKopD,UAAW,YAAappD,OAAQA,KAAK6nH,QAAQxkF,EAASrjC,KAAKi1H,SAAU,WAAYj1H,OAAQA,KAAK6nH,QAAQxkF,EAASrjC,KAAKk1H,UAAW,YAAal1H,SAQpMwyH,EAAgBxxH,UAAUijG,MAAQ,WAChC,OAAO,IAAIuuB,EAAgBxyH,KAAKopD,UAAWppD,KAAKi1H,SAAUj1H,KAAKk1H,YASjE1C,EAAgBxxH,UAAUqnH,UAAY,SAAUltG,GAC9C,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrE0B,EAAaf,EAAchzH,KAAMqyH,GAKjCjpE,EAAYppD,KAAKopD,UAAU3jD,SAAS0V,GACpCq6G,EAAsBxC,EAAchzH,KAAKopD,UAAWipE,IAEpC,QAAhBA,GAAiD,iBAAxBryH,KAAKopD,UAAUtxC,MAAmD,OAAxB09G,GAAgCA,GAAuBzB,KAC5H3qE,EAAY,IAAMA,EAAY,KAGhC,IAAI6rE,EAAWj1H,KAAKi1H,SAASxvH,SAAS0V,GAClCs6G,EAAiBzC,EAAchzH,KAAKi1H,SAAU5C,IAE9B,QAAhBA,GAAgD,iBAAvBryH,KAAKi1H,SAASn9G,MAA8C,OAAnB29G,GAA2BA,GAAkB1B,KACjHkB,EAAW,IAAMA,EAAW,KAG9B,IAAIC,EAAYl1H,KAAKk1H,UAAUzvH,SAAS0V,GACpCu6G,EAAkB1C,EAAchzH,KAAKk1H,UAAW7C,GAMpD,OAJoB,QAAhBA,GAAiD,iBAAxBryH,KAAKk1H,UAAUp9G,MAA+C,OAApB49G,GAA4BA,GAAmB3B,KACpHmB,EAAY,IAAMA,EAAY,KAGzB9rE,EAAY,MAAQ6rE,EAAW,MAAQC,GAQhD1C,EAAgBxxH,UAAUkgG,OAAS,WACjC,MAAO,CACLgoB,OAAQ,kBACR9/D,UAAWppD,KAAKopD,UAChB6rE,SAAUj1H,KAAKi1H,SACfC,UAAWl1H,KAAKk1H,YAYpB1C,EAAgBrJ,SAAW,SAAUhiB,GACnC,OAAO,IAAIqrB,EAAgBrrB,EAAK/9C,UAAW+9C,EAAK8tB,SAAU9tB,EAAK+tB,YASjE1C,EAAgBxxH,UAAUsnH,OAAS,SAAUntG,GAC3C,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrE0B,EAAaf,EAAchzH,KAAMqyH,GAKjCjpE,EAAYppD,KAAKopD,UAAUk/D,OAAOntG,GAClCq6G,EAAsBxC,EAAchzH,KAAKopD,UAAWipE,IAEpC,QAAhBA,GAAiD,iBAAxBryH,KAAKopD,UAAUtxC,MAAmD,OAAxB09G,GAAgCA,GAAuBzB,KAC5H3qE,EAAY,iEAAmEA,EAAY,kEAG7F,IAAI6rE,EAAWj1H,KAAKi1H,SAAS3M,OAAOntG,GAChCs6G,EAAiBzC,EAAchzH,KAAKi1H,SAAU5C,IAE9B,QAAhBA,GAAgD,iBAAvBryH,KAAKi1H,SAASn9G,MAA8C,OAAnB29G,GAA2BA,GAAkB1B,KACjHkB,EAAW,iEAAmEA,EAAW,kEAG3F,IAAIC,EAAYl1H,KAAKk1H,UAAU5M,OAAOntG,GAClCu6G,EAAkB1C,EAAchzH,KAAKk1H,UAAW7C,GAMpD,OAJoB,QAAhBA,GAAiD,iBAAxBryH,KAAKk1H,UAAUp9G,MAA+C,OAApB49G,GAA4BA,GAAmB3B,KACpHmB,EAAY,iEAAmEA,EAAY,kEAGtF9rE,EAAY,iEAAmE6rE,EAAW,iEAAmEC,GAStK1C,EAAgBxxH,UAAUwnH,OAAS,SAAUrtG,GAC3C,MAAO,mBAAqBnb,KAAKi1H,SAAS1M,MAAMptG,GAAW,4BAA8Bnb,KAAKopD,UAAUm/D,MAAMptG,GAAW,SAAWnb,KAAKk1H,UAAU3M,MAAMptG,GAAW,6CAmC/Jq3G,IACN,CACD7J,SAAS,EACTpB,QAAQ,ICtON,EAAe,CAAC,QACToO,GAAoC,EAAAvO,EAAA,IAFpC,eAEkD,GAAepiB,IAC1E,IAAI,KACFvjC,GACEujC,EAYJ,SAAS4wB,EAAaC,EAAI91H,EAAIE,EAAM61H,GAClC,KAAM91H,gBAAgB41H,GACpB,MAAM,IAAIt4C,YAAY,oDAIxB,GAAkB,iBAAPu4C,EACT,MAAM,IAAIp1H,UAAU,sCAGtB,GAAkB,iBAAPV,EACT,MAAM,IAAIU,UAAU,sCAGtB,IAAK7B,MAAMoF,QAAQ/D,KAAUA,EAAKoL,MAAMy8G,EAAA,IACtC,MAAM,IAAIrnH,UAAU,wDAGtBT,KAAK81H,UAAwB,IAAbA,EAChB91H,KAAK61H,GAAKA,EACV71H,KAAKD,GAAKA,EACVC,KAAKC,KAAOA,GAAQ,GA8HtB,SAAS81H,EAA8BpqG,EAAM0mG,EAAayD,EAAU71H,EAAM+1H,GAExE,IAmBIxqG,EAnBAuoG,EAAaf,EAAcrnG,EAAM0mG,GACjCO,EAAgBM,EAAiBvnG,EAAM0mG,GAE3C,GAAoB,QAAhBA,GAAyBpyH,EAAKxB,OAAS,GAA8B,qBAAzBktB,EAAK88F,iBAAmE,0BAAzB98F,EAAK88F,gBAClG,OAAOxoH,EAAKqH,KAAI,SAAU/H,GACxB,OAAQA,EAAImpH,aAAa5wG,MAEvB,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,OAAO,EAET,QACE,OAAO,MAOf,OAAQ7X,EAAKxB,QACX,KAAK,EACH+sB,EAAS,GACT,MAEF,KAAK,EAID,IAAIyqG,EAAoBjD,EAAc/yH,EAAK,GAAIoyH,GAE/C,GAAI2D,GAA+B,OAAtBC,EAA4B,CACvC,IAAIC,EACAC,EAWJ,GAToB,SAAhB9D,GACF6D,EAAoBj2H,EAAK,GAAGwoH,gBAC5B0N,EAAiBxqG,EAAK88F,kBAGtByN,EAAoBj2H,EAAK,GAAGyoH,aAAaD,gBACzC0N,EAAiBxqG,EAAK+8F,aAAaD,kBAG0B,IAA3D9uE,EAAWo6E,GAAYoC,GAAgB1D,gBAA2B,CACpEjnG,EAAS,EAAC,GACV,MAGF,IAAqE,IAAjEmuB,EAAWs8E,GAAmBC,GAAmBvD,YAAuB,CAC1EnnG,EAAS,EAAC,GACV,OAIJ,GAA0B,OAAtByqG,EAA4B,CAE9BzqG,EAAS,EAAC,GACV,MAGF,GAAIyqG,GAAqBlC,EAAY,CAEnCvoG,EAAS,EAAC,GACV,MAIFA,EAAS,EAAC,GAEZ,MAEF,KAAK,EAGD,IAAI4qG,EAuBAC,EApBAC,EAAgBtD,EAAc/yH,EAAK,GAAIoyH,GAEvCkE,EAAepD,EAAkBxnG,EAAM1rB,EAAK,GAAIoyH,GAKlD+D,EAHoB,OAAlBE,IAIOA,IAAkBvC,GAAgC,UAAlBnB,IAA8B2D,GAM9DD,EAAgBvC,GAS3B,IAsBMyC,EAEAC,EACAC,EAzBFC,EAAgB3D,EAAc/yH,EAAK,GAAIoyH,GAEvCuE,EAAezD,EAAkBxnG,EAAM1rB,EAAK,GAAIoyH,GAKlDgE,EAHoB,OAAlBM,IAIOA,IAAkB5C,GAAgC,SAAlBnB,IAA6BgE,GAM7DD,EAAgB5C,GAOvBiC,IAMkB,SAAhB3D,GACFmE,EAAkB7qG,EAAK88F,gBACvBgO,EAAgB9qG,EAAK1rB,KAAK,GAAGwoH,gBAC7BiO,EAAgB/qG,EAAK1rB,KAAK,GAAGwoH,kBAG7B+N,EAAkB7qG,EAAK+8F,aAAaD,gBACpCgO,EAAgB9qG,EAAK1rB,KAAK,GAAGyoH,aAAaD,gBAC1CiO,EAAgB/qG,EAAK1rB,KAAK,GAAGyoH,aAAaD,iBAGtB,OAAlB6N,KAC8D,IAA5D38E,EAAWo6E,GAAYyC,GAAiB/D,kBAC1C2D,GAAY,IAG+C,IAAzDz8E,EAAW28E,GAAeG,GAAe9D,cAC3CyD,GAAY,IAIM,OAAlBO,KAC+D,IAA7Dh9E,EAAWo6E,GAAYyC,GAAiB9D,mBAC1C2D,GAAY,IAG+C,IAAzD18E,EAAWg9E,GAAeD,GAAe/D,cAC3C0D,GAAY,KAKlB7qG,EAAS,CAAC4qG,EAAWC,GAEvB,MAEF,QAC+B,qBAAzB1qG,EAAK88F,iBAAmE,0BAAzB98F,EAAK88F,kBACtDj9F,EAASvrB,EAAKqH,KAAI,SAAU/H,GAC1B,IAAIs3H,EAAgB7D,EAAczzH,EAAK8yH,GACnCyE,EAAe3D,EAAkBxnG,EAAMpsB,EAAK8yH,GAC5C0E,EAAmB7D,EAAiB3zH,EAAK8yH,GAE7C,OAAsB,OAAlBwE,IAGO9C,IAAe8C,GAAiBjE,IAAkBmE,IAAqBD,GAEvED,EAAgB9C,OA2BnC,OAbI9zH,EAAKxB,QAAU,GAA8B,0BAAzBktB,EAAK88F,iBAA+C98F,EAAKmqG,UAA4B,SAAhBzD,GAAuC,SAAbyD,IACrHtqG,EAASvrB,EAAKqH,KAAI,SAAU/H,EAAKwI,GAC/B,IAAIqqH,EAA4C,oBAAxB7yH,EAAIkpH,gBAE5B,SAAIj9F,EAAOzjB,KAAUqqH,OASlB5mG,EA+ST,OAxnBAoqG,EAAa50H,UAAY,IAAIygE,EAC7Bm0D,EAAa50H,UAAU8W,KAAO,eAC9B89G,EAAa50H,UAAUg2H,gBAAiB,EAexCpB,EAAa50H,UAAUymH,SAAW,SAAUE,EAAMC,GAEhD,GAAuB,iBAAZ5nH,KAAKD,MAAoB,QAAa4nH,EAAM3nH,KAAKD,IAC1D,MAAK4nH,EAAK3nH,KAAKD,IAGP,IAAIoM,MAAM,0BAA4BnM,KAAKD,GAAK,KAFhD,IAAIoM,MAAM,YAAcnM,KAAKD,GAAK,yCAM5C,IAAIA,GAAK,QAAgB4nH,EAAM3nH,KAAKD,IAChCk3H,GAAW,QAAIj3H,KAAKC,MAAM,SAAUV,GACtC,OAAOA,EAAIkoH,SAASE,EAAMC,MAG5B,GAAwB,IAApBqP,EAASx4H,OAAc,CACzB,IAAIy4H,EAAWD,EAAS,GACxB,OAAO,SAA0B3P,EAAOrnH,EAAM+oH,GAC5C,OAAOjpH,EAAGm3H,EAAS5P,EAAOrnH,EAAM+oH,KAE7B,GAAwB,IAApBiO,EAASx4H,OAAc,CAChC,IAAI04H,EAAWF,EAAS,GACpBG,EAAWH,EAAS,GACxB,OAAO,SAA0B3P,EAAOrnH,EAAM+oH,GAC5C,OAAOjpH,EAAGo3H,EAAS7P,EAAOrnH,EAAM+oH,GAAUoO,EAAS9P,EAAOrnH,EAAM+oH,KAGlE,OAAO,SAA0B1B,EAAOrnH,EAAM+oH,GAC5C,OAAOjpH,EAAGI,MAAM,MAAM,QAAI82H,GAAU,SAAUI,GAC5C,OAAOA,EAAQ/P,EAAOrnH,EAAM+oH,SAWpC4M,EAAa50H,UAAU+b,QAAU,SAAUsmB,GACzC,IAAK,IAAI3kC,EAAI,EAAGA,EAAIsB,KAAKC,KAAKxB,OAAQC,IACpC2kC,EAASrjC,KAAKC,KAAKvB,GAAI,QAAUA,EAAI,IAAKsB,OAW9C41H,EAAa50H,UAAUsG,IAAM,SAAU+7B,GAGrC,IAFA,IAAIpjC,EAAO,GAEFvB,EAAI,EAAGA,EAAIsB,KAAKC,KAAKxB,OAAQC,IACpCuB,EAAKvB,GAAKsB,KAAK6nH,QAAQxkF,EAASrjC,KAAKC,KAAKvB,GAAI,QAAUA,EAAI,IAAKsB,OAGnE,OAAO,IAAI41H,EAAa51H,KAAK61H,GAAI71H,KAAKD,GAAIE,EAAMD,KAAK81H,WAQvDF,EAAa50H,UAAUijG,MAAQ,WAC7B,OAAO,IAAI2xB,EAAa51H,KAAK61H,GAAI71H,KAAKD,GAAIC,KAAKC,KAAK6E,MAAM,GAAI9E,KAAK81H,WASrEF,EAAa50H,UAAUs2H,QAAU,WAC/B,OAA4B,IAArBt3H,KAAKC,KAAKxB,QASnBm3H,EAAa50H,UAAUy3F,SAAW,WAChC,OAA4B,IAArBz4F,KAAKC,KAAKxB,QAwOnBm3H,EAAa50H,UAAUqnH,UAAY,SAAUltG,GAC3C,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrEyD,EAAW36G,GAAWA,EAAQ26G,SAAW36G,EAAQ26G,SAAW,OAC5D71H,EAAOD,KAAKC,KACZs3H,EAASxB,EAA8B/1H,KAAMqyH,EAAayD,EAAU71H,GAAM,GAE9E,GAAoB,IAAhBA,EAAKxB,OAAc,CAErB,IAAI+4H,EAAQtE,EAAiBlzH,KAAMqyH,GAC/BoF,EAAUx3H,EAAK,GAAGwF,SAAS0V,GAE3Bo8G,EAAO,KACTE,EAAU,IAAMA,EAAU,KAI5B,IAAIC,EAAY,YAAY/xH,KAAK3F,KAAK61H,IAEtC,MAAc,UAAV2B,EAEKx3H,KAAK61H,IAAM6B,EAAY,IAAM,IAAMD,EACvB,SAAVD,EAEFC,GAAWC,EAAY,IAAM,IAAM13H,KAAK61H,GAI1C4B,EAAUz3H,KAAK61H,GACjB,GAAoB,IAAhB51H,EAAKxB,OAAc,CAC5B,IAAI+vF,EAAMvuF,EAAK,GAAGwF,SAAS0V,GAEvBszE,EAAMxuF,EAAK,GAAGwF,SAAS0V,GAY3B,OAVIo8G,EAAO,KAET/oC,EAAM,IAAMA,EAAM,KAGhB+oC,EAAO,KAET9oC,EAAM,IAAMA,EAAM,KAGhBzuF,KAAK81H,UAAqC,0BAAzB91H,KAAKyoH,iBAA4D,SAAbqN,EAChEtnC,EAAM,IAAMC,EAGdD,EAAM,IAAMxuF,KAAK61H,GAAK,IAAMpnC,EAC9B,GAAIxuF,EAAKxB,OAAS,IAA+B,qBAAzBuB,KAAKyoH,iBAAmE,0BAAzBzoH,KAAKyoH,iBAA8C,CAC/H,IAAIkP,EAAkB13H,EAAKqH,KAAI,SAAU/H,EAAKwI,GAQ5C,OAPAxI,EAAMA,EAAIkG,SAAS0V,GAEfo8G,EAAOxvH,KAETxI,EAAM,IAAMA,EAAM,KAGbA,KAGT,OAAIS,KAAK81H,UAAqC,0BAAzB91H,KAAKyoH,iBAA4D,SAAbqN,EAChE6B,EAAgBvmG,KAAK,KAGvBumG,EAAgBvmG,KAAK,IAAMpxB,KAAK61H,GAAK,KAG5C,OAAO71H,KAAKD,GAAK,IAAMC,KAAKC,KAAKmxB,KAAK,MAAQ,KASlDwkG,EAAa50H,UAAUkgG,OAAS,WAC9B,MAAO,CACLgoB,OAAQ,eACR2M,GAAI71H,KAAK61H,GACT91H,GAAIC,KAAKD,GACTE,KAAMD,KAAKC,KACX61H,SAAU91H,KAAK81H,WAYnBF,EAAazM,SAAW,SAAUhiB,GAChC,OAAO,IAAIyuB,EAAazuB,EAAK0uB,GAAI1uB,EAAKpnG,GAAIonG,EAAKlnG,KAAMknG,EAAK2uB,WAS5DF,EAAa50H,UAAUsnH,OAAS,SAAUntG,GACxC,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrEyD,EAAW36G,GAAWA,EAAQ26G,SAAW36G,EAAQ26G,SAAW,OAC5D71H,EAAOD,KAAKC,KACZs3H,EAASxB,EAA8B/1H,KAAMqyH,EAAayD,EAAU71H,GAAM,GAE9E,GAAoB,IAAhBA,EAAKxB,OAAc,CAErB,IAAI+4H,EAAQtE,EAAiBlzH,KAAMqyH,GAC/BoF,EAAUx3H,EAAK,GAAGqoH,OAAOntG,GAM7B,OAJIo8G,EAAO,KACTE,EAAU,iEAAmEA,EAAU,kEAG3E,UAAVD,EAEK,iFAAkF,QAAOx3H,KAAK61H,IAAM,UAAY4B,EAGhHA,EAAU,kFAAmF,QAAOz3H,KAAK61H,IAAM,UAEnH,GAAoB,IAAhB51H,EAAKxB,OAAc,CAE5B,IAAI+vF,EAAMvuF,EAAK,GAAGqoH,OAAOntG,GAErBszE,EAAMxuF,EAAK,GAAGqoH,OAAOntG,GAYzB,OAVIo8G,EAAO,KAET/oC,EAAM,iEAAmEA,EAAM,kEAG7E+oC,EAAO,KAET9oC,EAAM,iEAAmEA,EAAM,kEAG7EzuF,KAAK81H,UAAqC,0BAAzB91H,KAAKyoH,iBAA4D,SAAbqN,EAChEtnC,EAAM,yFAA2FC,EAGnGD,EAAM,mFAAoF,QAAOxuF,KAAK61H,IAAM,UAAYpnC,EAE/H,IAAIkpC,EAAkB13H,EAAKqH,KAAI,SAAU/H,EAAKwI,GAQ5C,OAPAxI,EAAMA,EAAI+oH,OAAOntG,GAEbo8G,EAAOxvH,KAETxI,EAAM,iEAAmEA,EAAM,kEAG1EA,KAGT,OAAIU,EAAKxB,OAAS,IAA+B,qBAAzBuB,KAAKyoH,iBAAmE,0BAAzBzoH,KAAKyoH,iBACtEzoH,KAAK81H,UAAqC,0BAAzB91H,KAAKyoH,iBAA4D,SAAbqN,EAChE6B,EAAgBvmG,KAAK,0FAGvBumG,EAAgBvmG,KAAK,mFAAoF,QAAOpxB,KAAK61H,IAAM,WAG3H,gCAAiC,QAAO71H,KAAKD,IAAM,wEAA0E43H,EAAgBvmG,KAAK,yCAA2C,kEAW1MwkG,EAAa50H,UAAUwnH,OAAS,SAAUrtG,GACxC,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrEyD,EAAW36G,GAAWA,EAAQ26G,SAAW36G,EAAQ26G,SAAW,OAC5D71H,EAAOD,KAAKC,KACZs3H,EAASxB,EAA8B/1H,KAAMqyH,EAAayD,EAAU71H,GAAM,GAC1E41H,EAAK1I,EAAentH,KAAKD,IAG7B,GAFA81H,OAAmB,IAAPA,EAAqB71H,KAAK61H,GAAKA,EAEvB,IAAhB51H,EAAKxB,OAAc,CAErB,IAAI+4H,EAAQtE,EAAiBlzH,KAAMqyH,GAC/BoF,EAAUx3H,EAAK,GAAGsoH,MAAMptG,GAM5B,OAJIo8G,EAAO,KACTE,EAAU,UAAU/rH,OAAO+rH,EAAS,aAGxB,UAAVD,EAEK3B,EAAK4B,EAGLA,EAAU5B,EAKd,GAAoB,IAAhB51H,EAAKxB,OAAc,CAE5B,IAAI+vF,EAAMvuF,EAAK,GAEX23H,EAASppC,EAAI+5B,MAAMptG,GAEnBo8G,EAAO,KACTK,EAAS,UAAUlsH,OAAOksH,EAAQ,aAGpC,IASInB,EAPAoB,EAFM53H,EAAK,GAEEsoH,MAAMptG,GAgBvB,OAdIo8G,EAAO,KACTM,EAAS,UAAUnsH,OAAOmsH,EAAQ,aAOlCpB,EADkB,SAAhBpE,EACc7jC,EAAIi6B,gBAGJj6B,EAAIk6B,aAAaD,gBAG3BzoH,KAAKyoH,iBACX,IAAK,sBAEH,OAAOoN,EAAK,IAAM+B,EAAX/B,KAAgCgC,EAAS,IAElD,IAAK,mBAIH,OAHAD,EAAS,IAAMA,EAAS,IACxBC,EAAS,IAAMA,EAAS,IAEhBpB,GACN,IAAK,kBAEL,IAAK,sBACHmB,EAAS,UAAUlsH,OAAOksH,EAAQ,YAGtC,MAEF,IAAK,wBACH,GAAI53H,KAAK81H,UAAyB,SAAbA,EACnB,OAAO8B,EAAS,IAAMC,EAK5B,OAAOD,EAAS/B,EAAKgC,EAChB,GAAI53H,EAAKxB,OAAS,IAA+B,qBAAzBuB,KAAKyoH,iBAAmE,0BAAzBzoH,KAAKyoH,iBAA8C,CAC/H,IAAIqP,EAAe73H,EAAKqH,KAAI,SAAU/H,EAAKwI,GAOzC,OANAxI,EAAMA,EAAIgpH,MAAMptG,GAEZo8G,EAAOxvH,KACTxI,EAAM,UAAUmM,OAAOnM,EAAK,aAGvBA,KAGT,MAA6B,0BAAzBS,KAAKyoH,iBAA+CzoH,KAAK81H,SACpDgC,EAAa1mG,KAAK,KAGpB0mG,EAAa1mG,KAAKykG,GAKzB,MAAO,YAAc71H,KAAKD,GAAK,WAAaE,EAAKqH,KAAI,SAAU/H,GAC7D,OAAOA,EAAIgpH,MAAMptG,MAChBiW,KAAK,KAAO,YASnBwkG,EAAa50H,UAAUynH,cAAgB,WACrC,OAAOzoH,KAAK8X,KAAO,IAAM9X,KAAKD,IAGzB61H,IACN,CACDjN,SAAS,EACTpB,QAAQ,ICvqBN,EAAe,CAAC,QACTwQ,GAAiC,EAAA3Q,EAAA,IAFjC,YAE+C,GAAepiB,IACvE,IAAI,KACFvjC,GACEujC,EAUJ,SAAS+tB,EAAUnzG,EAAOC,EAAK4S,GAC7B,KAAMzyB,gBAAgB+yH,GACpB,MAAM,IAAIz1C,YAAY,oDAIxB,KAAK,EAAAwqC,EAAA,IAAOloG,GAAQ,MAAM,IAAInf,UAAU,iBACxC,KAAK,EAAAqnH,EAAA,IAAOjoG,GAAM,MAAM,IAAIpf,UAAU,iBACtC,GAAIgyB,KAAS,EAAAq1F,EAAA,IAAOr1F,GAAO,MAAM,IAAIhyB,UAAU,iBAC/C,GAAIP,UAAUzB,OAAS,EAAG,MAAM,IAAI0N,MAAM,sBAC1CnM,KAAK4f,MAAQA,EAEb5f,KAAK6f,IAAMA,EAEX7f,KAAKyyB,KAAOA,GAAQ,KAgGtB,SAASsjG,EAA8B1oG,EAAMglG,GAC3C,IAAI0B,EAAaf,EAAc3lG,EAAMglG,GACjCkF,EAAS,GACTS,EAAkBhF,EAAc3lG,EAAKzN,MAAOyyG,GAGhD,GAFAkF,EAAO33G,MAA4B,OAApBo4G,GAA4BA,GAAmBjE,GAA8B,QAAhB1B,EAExEhlG,EAAKoF,KAAM,CACb,IAAIwlG,EAAiBjF,EAAc3lG,EAAKoF,KAAM4/F,GAC9CkF,EAAO9kG,KAA0B,OAAnBwlG,GAA2BA,GAAkBlE,GAA8B,QAAhB1B,EAG3E,IAAI6F,EAAgBlF,EAAc3lG,EAAKxN,IAAKwyG,GAE5C,OADAkF,EAAO13G,IAAwB,OAAlBq4G,GAA0BA,GAAiBnE,GAA8B,QAAhB1B,EAC/DkF,EA8IT,OAxPAxE,EAAU/xH,UAAY,IAAIygE,EAC1BsxD,EAAU/xH,UAAU8W,KAAO,YAC3Bi7G,EAAU/xH,UAAUm3H,aAAc,EAOlCpF,EAAU/xH,UAAUo3H,SAAW,WAK7B,OAHiBp4H,KAAKqI,QAAO,SAAUglB,GACrC,OAAO,EAAAy6F,EAAA,IAAaz6F,IAAuB,QAAdA,EAAK3nB,QAElBjH,OAAS,GAiB7Bs0H,EAAU/xH,UAAUymH,SAAW,SAAUE,EAAMC,GAC7C,IAAIxuF,EAAQuuF,EAAKvuF,MAEbi/F,EAAYr4H,KAAK4f,MAAM6nG,SAASE,EAAMC,GAEtC0Q,EAAUt4H,KAAK6f,IAAI4nG,SAASE,EAAMC,GAEtC,GAAI5nH,KAAKyyB,KAAM,CACb,IAAI8lG,EAAWv4H,KAAKyyB,KAAKg1F,SAASE,EAAMC,GAExC,OAAO,SAAuBN,EAAOrnH,EAAM+oH,GACzC,OAAO5vF,EAAMi/F,EAAU/Q,EAAOrnH,EAAM+oH,GAAUsP,EAAQhR,EAAOrnH,EAAM+oH,GAAUuP,EAASjR,EAAOrnH,EAAM+oH,KAGrG,OAAO,SAAuB1B,EAAOrnH,EAAM+oH,GACzC,OAAO5vF,EAAMi/F,EAAU/Q,EAAOrnH,EAAM+oH,GAAUsP,EAAQhR,EAAOrnH,EAAM+oH,MAUzE+J,EAAU/xH,UAAU+b,QAAU,SAAUsmB,GACtCA,EAASrjC,KAAK4f,MAAO,QAAS5f,MAC9BqjC,EAASrjC,KAAK6f,IAAK,MAAO7f,MAEtBA,KAAKyyB,MACP4Q,EAASrjC,KAAKyyB,KAAM,OAAQzyB,OAWhC+yH,EAAU/xH,UAAUsG,IAAM,SAAU+7B,GAClC,OAAO,IAAI0vF,EAAU/yH,KAAK6nH,QAAQxkF,EAASrjC,KAAK4f,MAAO,QAAS5f,OAAQA,KAAK6nH,QAAQxkF,EAASrjC,KAAK6f,IAAK,MAAO7f,OAAQA,KAAKyyB,MAAQzyB,KAAK6nH,QAAQxkF,EAASrjC,KAAKyyB,KAAM,OAAQzyB,SAQ/K+yH,EAAU/xH,UAAUijG,MAAQ,WAC1B,OAAO,IAAI8uB,EAAU/yH,KAAK4f,MAAO5f,KAAK6f,IAAK7f,KAAKyyB,MAAQzyB,KAAKyyB,OAiC/DsgG,EAAU/xH,UAAUqnH,UAAY,SAAUltG,GACxC,IAGIvB,EAFA29G,EAASxB,EAA8B/1H,KADzBmb,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,QAIrEzyG,EAAQ5f,KAAK4f,MAAMna,SAAS0V,GAQhC,GANIo8G,EAAO33G,QACTA,EAAQ,IAAMA,EAAQ,KAGxBhG,EAAMgG,EAEF5f,KAAKyyB,KAAM,CACb,IAAIA,EAAOzyB,KAAKyyB,KAAKhtB,SAAS0V,GAE1Bo8G,EAAO9kG,OACTA,EAAO,IAAMA,EAAO,KAGtB7Y,GAAO,IAAM6Y,EAGf,IAAI5S,EAAM7f,KAAK6f,IAAIpa,SAAS0V,GAO5B,OALIo8G,EAAO13G,MACTA,EAAM,IAAMA,EAAM,KAGpBjG,EAAO,IAAMiG,GASfkzG,EAAU/xH,UAAUkgG,OAAS,WAC3B,MAAO,CACLgoB,OAAQ,YACRtpG,MAAO5f,KAAK4f,MACZC,IAAK7f,KAAK6f,IACV4S,KAAMzyB,KAAKyyB,OAYfsgG,EAAU5J,SAAW,SAAUhiB,GAC7B,OAAO,IAAI4rB,EAAU5rB,EAAKvnF,MAAOunF,EAAKtnF,IAAKsnF,EAAK10E,OASlDsgG,EAAU/xH,UAAUsnH,OAAS,SAAUntG,GACrC,IAGIvB,EAFA29G,EAASxB,EAA8B/1H,KADzBmb,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,QAIrEzyG,EAAQ5f,KAAK4f,MAAM0oG,OAAOntG,GAQ9B,GANIo8G,EAAO33G,QACTA,EAAQ,iEAAmEA,EAAQ,kEAGrFhG,EAAMgG,EAEF5f,KAAKyyB,KAAM,CACb,IAAIA,EAAOzyB,KAAKyyB,KAAK61F,OAAOntG,GAExBo8G,EAAO9kG,OACTA,EAAO,iEAAmEA,EAAO,kEAGnF7Y,GAAO,2DAA6D6Y,EAGtE,IAAI5S,EAAM7f,KAAK6f,IAAIyoG,OAAOntG,GAO1B,OALIo8G,EAAO13G,MACTA,EAAM,iEAAmEA,EAAM,kEAGjFjG,EAAO,2DAA6DiG,GAUtEkzG,EAAU/xH,UAAUwnH,OAAS,SAAUrtG,GACrC,IACIo8G,EAASxB,EAA8B/1H,KADzBmb,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,QAErEz4G,EAAM5Z,KAAK4f,MAAM2oG,MAAMptG,GAM3B,GAJIo8G,EAAO33G,QACThG,EAAM,UAAUlO,OAAOkO,EAAK,aAG1B5Z,KAAKyyB,KAAM,CACb,IAAIA,EAAOzyB,KAAKyyB,KAAK81F,MAAMptG,GAEvBo8G,EAAO9kG,OACTA,EAAO,UAAU/mB,OAAO+mB,EAAM,aAGhC7Y,GAAO,IAAM6Y,EAGf,IAAI5S,EAAM7f,KAAK6f,IAAI0oG,MAAMptG,GAOzB,OALIo8G,EAAO13G,MACTA,EAAM,UAAUnU,OAAOmU,EAAK,aAG9BjG,EAAO,IAAMiG,GAIRkzG,IACN,CACDpK,SAAS,EACTpB,QAAQ,ICrRN,EAAe,CAAC,QAAS,QAClBiR,GAA8C,EAAApR,EAAA,IAF9C,yBAE4D,GAAepiB,IACpF,IAAI,MACFyzB,EAAK,KACLh3D,GACEujC,EAcJ,SAASutB,EAAuB7sH,EAAM4nB,EAAQvhB,GAC5C,KAAM/L,gBAAgBuyH,GACpB,MAAM,IAAIj1C,YAAY,oDAIxB,GAAoB,iBAAT53E,EAAmB,MAAM,IAAIjF,UAAU,wCAClD,IAAK7B,MAAMoF,QAAQspB,GAAS,MAAM,IAAI7sB,UAAU,uEAChD,KAAK,EAAAqnH,EAAA,IAAO/7G,GAAO,MAAM,IAAItL,UAAU,sCACvC,GAAIiF,KAAQuhH,EAAU,MAAM,IAAI96G,MAAM,2BAA6BzG,EAAO,2BAC1E1F,KAAK0F,KAAOA,EACZ1F,KAAKstB,OAASA,EAAOhmB,KAAI,SAAUqiH,GACjC,OAAOA,GAASA,EAAMjkH,MAAQikH,KAEhC3pH,KAAK27B,MAAQrO,EAAOhmB,KAAI,SAAUqiH,GAChC,OAAOA,GAASA,EAAM7xG,MAAQ,SAEhC9X,KAAK+L,KAAOA,EA0Fd,SAAS2sH,EAAgBrrG,EAAMglG,GAC7B,IAAI0B,EAAaf,EAAc3lG,EAAMglG,GACjCsG,EAAiB3F,EAAc3lG,EAAKthB,KAAMsmH,GAC9C,MAAuB,QAAhBA,GAA4C,OAAnBsG,GAA2BA,GAAkB5E,EA4F/E,OAtLAxB,EAAuBvxH,UAAY,IAAIygE,EACvC8wD,EAAuBvxH,UAAU8W,KAAO,yBACxCy6G,EAAuBvxH,UAAU43H,0BAA2B,EAe5DrG,EAAuBvxH,UAAUymH,SAAW,SAAUE,EAAMC,GAC1D,IAAIiR,EAAgB12H,OAAOuB,OAAOkkH,IAClC,QAAQ5nH,KAAKstB,QAAQ,SAAUq8F,GAC7BkP,EAAclP,IAAS,KAGzB,IAAImP,EAAW94H,KAAK+L,KAAK07G,SAASE,EAAMkR,GAEpCnzH,EAAO1F,KAAK0F,KACZ4nB,EAASttB,KAAKstB,OACdyrG,GAAY,QAAK/4H,KAAK27B,MAAO,KAC7Bq9F,EAAStzH,EAAO,KAAM,QAAK1F,KAAKstB,OAAQ,MAAQ,IACpD,OAAO,SAAoCg6F,EAAOrnH,EAAM+oH,GACtD,IAAIiQ,EAAa,GAEjBA,EAAWF,GAAa,WAGtB,IAFA,IAAIG,EAAY/2H,OAAOuB,OAAOzD,GAErBvB,EAAI,EAAGA,EAAI4uB,EAAO7uB,OAAQC,IACjCw6H,EAAU5rG,EAAO5uB,IAAMwB,UAAUxB,GAGnC,OAAOo6H,EAASxR,EAAO4R,EAAWlQ,IAGpC,IAAIjpH,EAAK04H,EAAM/yH,EAAMuzH,GAGrB,OAFAl5H,EAAGi5H,OAASA,GACZ,QAAgB1R,EAAO5hH,EAAM3F,GACtBA,IASXwyH,EAAuBvxH,UAAU+b,QAAU,SAAUsmB,GACnDA,EAASrjC,KAAK+L,KAAM,OAAQ/L,OAU9BuyH,EAAuBvxH,UAAUsG,IAAM,SAAU+7B,GAC/C,IAAIt3B,EAAO/L,KAAK6nH,QAAQxkF,EAASrjC,KAAK+L,KAAM,OAAQ/L,OAEpD,OAAO,IAAIuyH,EAAuBvyH,KAAK0F,KAAM1F,KAAKstB,OAAOxoB,MAAM,GAAIiH,IAQrEwmH,EAAuBvxH,UAAUijG,MAAQ,WACvC,OAAO,IAAIsuB,EAAuBvyH,KAAK0F,KAAM1F,KAAKstB,OAAOxoB,MAAM,GAAI9E,KAAK+L,OAsB1EwmH,EAAuBvxH,UAAUqnH,UAAY,SAAUltG,GACrD,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrEtmH,EAAO/L,KAAK+L,KAAKtG,SAAS0V,GAM9B,OAJIu9G,EAAgB14H,KAAMqyH,KACxBtmH,EAAO,IAAMA,EAAO,KAGf/L,KAAK0F,KAAO,IAAM1F,KAAKstB,OAAO8D,KAAK,MAAQ,OAASrlB,GAQ7DwmH,EAAuBvxH,UAAUkgG,OAAS,WACxC,IAAIvlE,EAAQ37B,KAAK27B,MACjB,MAAO,CACLutF,OAAQ,yBACRxjH,KAAM1F,KAAK0F,KACX4nB,OAAQttB,KAAKstB,OAAOhmB,KAAI,SAAUqiH,EAAO5hH,GACvC,MAAO,CACLrC,KAAMikH,EACN7xG,KAAM6jB,EAAM5zB,OAGhBgE,KAAM/L,KAAK+L,OAYfwmH,EAAuBpJ,SAAW,SAAUhiB,GAC1C,OAAO,IAAIorB,EAAuBprB,EAAKzhG,KAAMyhG,EAAK75E,OAAQ65E,EAAKp7F,OASjEwmH,EAAuBvxH,UAAUsnH,OAAS,SAAUntG,GAIlD,IAHA,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrE/kG,EAAS,GAEJ5uB,EAAI,EAAGA,EAAIsB,KAAKstB,OAAO7uB,OAAQC,IACtC4uB,EAAO9rB,KAAK,6CAA8C,QAAOxB,KAAKstB,OAAO5uB,IAAM,WAGrF,IAAIqN,EAAO/L,KAAK+L,KAAKu8G,OAAOntG,GAM5B,OAJIu9G,EAAgB14H,KAAMqyH,KACxBtmH,EAAO,iEAAmEA,EAAO,kEAG5E,gCAAiC,QAAO/L,KAAK0F,MAA7C,wEAAoI4nB,EAAO8D,KAAK,yCAA2C,qLAAuLrlB,GAS3XwmH,EAAuBvxH,UAAUwnH,OAAS,SAAUrtG,GAClD,IAAIk3G,EAAcl3G,GAAWA,EAAQk3G,YAAcl3G,EAAQk3G,YAAc,OACrEtmH,EAAO/L,KAAK+L,KAAKw8G,MAAMptG,GAM3B,OAJIu9G,EAAgB14H,KAAMqyH,KACxBtmH,EAAO,UAAUL,OAAOK,EAAM,aAGzB,YAAc/L,KAAK0F,KAAO,WAAa1F,KAAKstB,OAAOhmB,IAAI+pH,GAAUjgG,KAAK,KAAO,aAAerlB,GAG9FwmH,IACN,CACD5J,SAAS,EACTpB,QAAQ,ICxON,EAAO,QACP,EAAe,CAAC,QAAS,SAClB4R,GAA6B,EAAA/R,EAAA,IAAQ,EAAM,GAAepiB,IACnE,IAAI,MACFyzB,EAAK,MACLrE,GACEpvB,EAqCJ,OAAOyzB,EAAM,EAAM,CACjB,GAAI,WACF,OAAO,IAAIrE,GAEbgF,IAAK,SAAa35H,GAChB,OAAO,IAAI20H,EAAM30H,S,UC1ChB,SAAS45H,EAAej5H,GAC7B,OAAIA,GAAOA,EAAIk5H,aACN,IAAIC,EAAA,EAAWn5H,EAAI2H,MAAQ,EAAG3H,EAAIoyB,IAAM,OAAenyB,IAAZD,EAAIqP,IAAoBrP,EAAIqP,IAAM,OAAIpP,GAGnFD,ECVF,SAASo5H,EAAcx0B,GAC5B,IAAI,OACF32B,GACE22B,EAaJ,OAAO,SAAgBjiG,EAAQgF,GAC7B,IACE,GAAInJ,MAAMoF,QAAQjB,GAChB,OAAOsrE,EAAOtrE,EAAQgF,GACjB,GAAIhF,GAAmC,mBAAlBA,EAAOsrE,OAEjC,OAAOtrE,EAAOsrE,OAAOtmE,GAChB,GAAsB,iBAAXhF,EAEhB,OAAOsrE,EAAOtrE,EAAQgF,GACjB,GAAsB,iBAAXhF,EAAqB,CACrC,IAAKgF,EAAM0xH,mBACT,MAAM,IAAIh5H,UAAU,mDAGtB,OAAO,QAAgBsC,EAAQgF,EAAM2xH,qBAErC,MAAM,IAAIj5H,UAAU,kDAEtB,MAAOL,GACP,MAAMi5H,EAAej5H,KClC3B,IACI,GAAe,CAAC,SAAU,QACnBu5H,IAAoC,EAAAvS,EAAA,IAFpC,eAEkD,IAAepiB,IAC1E,IAAI,OACF32B,EAAM,KACN5M,GACEujC,EACA40B,EAASJ,EAAc,CACzBnrD,WAYF,SAASwrD,EAAa92H,EAAQgF,GAC5B,KAAM/H,gBAAgB65H,GACpB,MAAM,IAAIv8C,YAAY,oDAGxB,KAAK,EAAAwqC,EAAA,IAAO/kH,GACV,MAAM,IAAItC,UAAU,wCAGtB,KAAK,EAAAqnH,EAAA,IAAY//G,GACf,MAAM,IAAItH,UAAU,4CAGtBT,KAAK+C,OAASA,GAAU,KACxB/C,KAAK+H,MAAQA,EAEb5F,OAAOC,eAAepC,KAAM,OAAQ,CAClC6C,IAAK,WACH,OAAI7C,KAAK+H,MACA/H,KAAK+H,MAAM0xH,mBAAqBz5H,KAAK+H,MAAM2xH,oBAAsB,GAEjE15H,KAAK+C,OAAO2C,MAAQ,IAE7BhE,KAAK1B,MACPwpE,IAAK,WACH,MAAM,IAAIr9D,MAAM,kDAsJtB,SAASusH,EAAgBrrG,GAEvB,SAAS,EAAAy6F,EAAA,IAAez6F,KAAS,EAAAy6F,EAAA,IAAYz6F,KAAS,EAAAy6F,EAAA,IAAez6F,KAAS,EAAAy6F,EAAA,IAAez6F,KAAS,EAAAy6F,EAAA,IAAaz6F,KAAS,EAAAy6F,EAAA,IAAkBz6F,KAAS,EAAAy6F,EAAA,IAAaz6F,IAGtK,OAtJAwsG,EAAa74H,UAAY,IAAIygE,EAC7Bo4D,EAAa74H,UAAU8W,KAAO,eAC9B+hH,EAAa74H,UAAU84H,gBAAiB,EAexCD,EAAa74H,UAAUymH,SAAW,SAAUE,EAAMC,GAChD,IAAImS,EAAa/5H,KAAK+C,OAAO0kH,SAASE,EAAMC,GAExCoS,EAAYh6H,KAAK+H,MAAM0/G,SAASE,EAAMC,GAE1C,GAAI5nH,KAAK+H,MAAM0xH,mBAAoB,CACjC,IAAIpgD,EAAOr5E,KAAK+H,MAAM2xH,oBACtB,OAAO,SAA0BpS,EAAOrnH,EAAM+oH,GAC5C,OAAO,QAAgB+Q,EAAWzS,EAAOrnH,EAAM+oH,GAAU3vC,IAG3D,OAAO,SAA0BiuC,EAAOrnH,EAAM+oH,GAC5C,IAAIjmH,EAASg3H,EAAWzS,EAAOrnH,EAAM+oH,GACjCjhH,EAAQiyH,EAAU1S,EAAOrnH,EAAM8C,GAEnC,OAAO62H,EAAO72H,EAAQgF,KAU5B8xH,EAAa74H,UAAU+b,QAAU,SAAUsmB,GACzCA,EAASrjC,KAAK+C,OAAQ,SAAU/C,MAChCqjC,EAASrjC,KAAK+H,MAAO,QAAS/H,OAUhC65H,EAAa74H,UAAUsG,IAAM,SAAU+7B,GACrC,OAAO,IAAIw2F,EAAa75H,KAAK6nH,QAAQxkF,EAASrjC,KAAK+C,OAAQ,SAAU/C,OAAQA,KAAK6nH,QAAQxkF,EAASrjC,KAAK+H,MAAO,QAAS/H,SAQ1H65H,EAAa74H,UAAUijG,MAAQ,WAC7B,OAAO,IAAI41B,EAAa75H,KAAK+C,OAAQ/C,KAAK+H,QAS5C8xH,EAAa74H,UAAUqnH,UAAY,SAAUltG,GAC3C,IAAIpY,EAAS/C,KAAK+C,OAAO0C,SAAS0V,GAMlC,OAJIu9G,EAAgB14H,KAAK+C,UACvBA,EAAS,IAAMA,EAAS,KAGnBA,EAAS/C,KAAK+H,MAAMtC,SAAS0V,IAStC0+G,EAAa74H,UAAUsnH,OAAS,SAAUntG,GACxC,IAAIpY,EAAS/C,KAAK+C,OAAOulH,OAAOntG,GAMhC,OAJIu9G,EAAgB14H,KAAK+C,UACvBA,EAAS,iEAAmEA,EAAS,kEAGhFA,EAAS/C,KAAK+H,MAAMugH,OAAOntG,IASpC0+G,EAAa74H,UAAUwnH,OAAS,SAAUrtG,GACxC,IAAIpY,EAAS/C,KAAK+C,OAAOwlH,MAAMptG,GAM/B,OAJIu9G,EAAgB14H,KAAK+C,UACvBA,EAAS,iCAGJA,EAAS/C,KAAK+H,MAAMwgH,MAAMptG,IAQnC0+G,EAAa74H,UAAUkgG,OAAS,WAC9B,MAAO,CACLgoB,OAAQ,eACRnmH,OAAQ/C,KAAK+C,OACbgF,MAAO/H,KAAK+H,QAYhB8xH,EAAa1Q,SAAW,SAAUhiB,GAChC,OAAO,IAAI0yB,EAAa1yB,EAAKpkG,OAAQokG,EAAKp/F,QAarC8xH,IACN,CACDlR,SAAS,EACTpB,QAAQ,ICzMN,GAAe,CAAC,QAAS,OAAQ,QAC1B0S,IAAiC,EAAA7S,EAAA,IAFjC,YAE+C,IAAepiB,IACvE,IAAI,MACF5zD,EAAK,KACLqwB,EAAI,KACJpuD,GACE2xF,EAiBJ,SAASk1B,EAAUC,EAAYC,GAC7B,KAAMp6H,gBAAgBk6H,GACpB,MAAM,IAAI58C,YAAY,oDAMxB,GAHAt9E,KAAKm6H,WAAaA,EAClBn6H,KAAKo6H,YAAcA,IAAe,GAE7Bx7H,MAAMoF,QAAQm2H,KAAgBA,EAAW9uH,MAAMy8G,EAAA,IAClD,MAAM,IAAIrnH,UAAU,8DAGtB,GAAIT,KAAKo6H,cAAgBp6H,KAAKy5H,mBAC5B,MAAM,IAAIttH,MAAM,qDA4NpB,SAASw5G,EAAY/lG,EAAOC,EAAK4S,GAC/B,OAAO,IAAI2e,GAAM,EAAA02E,EAAA,IAAYloG,GAASA,EAAM4gF,WAAa5gF,GAAO,EAAAkoG,EAAA,IAAYjoG,GAAOA,EAAI2gF,WAAa3gF,GAAK,EAAAioG,EAAA,IAAYr1F,GAAQA,EAAK+tE,WAAa/tE,GAGjJ,OA5NAynG,EAAUl5H,UAAY,IAAIygE,EAC1By4D,EAAUl5H,UAAU8W,KAAO,YAC3BoiH,EAAUl5H,UAAUq5H,aAAc,EAelCH,EAAUl5H,UAAUymH,SAAW,SAAUE,EAAMC,GAM7C,IAAI0S,GAAiB,QAAIt6H,KAAKm6H,YAAY,SAAU/gG,EAAO16B,GACzD,IAAI,EAAAopH,EAAA,IAAY1uF,GAAQ,CACtB,GAAIA,EAAMg/F,WAAY,CAEpB,IAAIS,EAAgB12H,OAAOuB,OAAOkkH,GAClCiR,EAAch5G,KAAM,EAEpB,IAAIw4G,EAAYj/F,EAAMxZ,MAAM6nG,SAASE,EAAMkR,GAEvCP,EAAUl/F,EAAMvZ,IAAI4nG,SAASE,EAAMkR,GAEnCN,EAAWn/F,EAAM3G,KAAO2G,EAAM3G,KAAKg1F,SAASE,EAAMkR,GAAiB,WACrE,OAAO,GAET,OAAO,SAAuBvR,EAAOrnH,EAAM+oH,GACzC,IAAIjjF,EAAI1yB,EAAK21G,GAAS/nH,UAClBi4H,EAAY/2H,OAAOuB,OAAOzD,GAE9B,OADAi5H,EAAUr5G,IAAMkmB,EAAErnC,GACXinH,EAAY0S,EAAU/Q,EAAO4R,EAAWlQ,GAAUsP,EAAQhR,EAAO4R,EAAWlQ,GAAUuP,EAASjR,EAAO4R,EAAWlQ,KAI1H,IAAIuR,EAAanhG,EAAMxZ,MAAM6nG,SAASE,EAAMC,GAExC4S,EAAWphG,EAAMvZ,IAAI4nG,SAASE,EAAMC,GAEpC6S,EAAYrhG,EAAM3G,KAAO2G,EAAM3G,KAAKg1F,SAASE,EAAMC,GAAY,WACjE,OAAO,GAGT,OAAO,SAAuBN,EAAOrnH,EAAM+oH,GACzC,OAAOrD,EAAY4U,EAAWjT,EAAOrnH,EAAM+oH,GAAUwR,EAASlT,EAAOrnH,EAAM+oH,GAAUyR,EAAUnT,EAAOrnH,EAAM+oH,KAG3G,IAAI,EAAAlB,EAAA,IAAa1uF,IAAyB,QAAfA,EAAM1zB,KAAgB,CAEtD,IAAIg1H,EAAiBv4H,OAAOuB,OAAOkkH,GAEnC8S,EAAe76G,KAAM,EAErB,IAAI86G,EAAYvhG,EAAMquF,SAASE,EAAM+S,GAErC,OAAO,SAAuBpT,EAAOrnH,EAAM+oH,GACzC,IAAIjjF,EAAI1yB,EAAK21G,GAAS/nH,UAClBi4H,EAAY/2H,OAAOuB,OAAOzD,GAE9B,OADAi5H,EAAUr5G,IAAMkmB,EAAErnC,GACXi8H,EAAUrT,EAAO4R,EAAWlQ,IAIrC,IAAI4R,EAAaxhG,EAAMquF,SAASE,EAAMC,GAEtC,OAAO,SAAuBN,EAAOrnH,EAAM+oH,GACzC,OAAO4R,EAAWtT,EAAOrnH,EAAM+oH,OAIjCjhH,GAAQ,QAAgB4/G,EAAM,SAClC,OAAO,SAAuBL,EAAOrnH,EAAM+oH,GACzC,IAAImR,GAAa,QAAIG,GAAgB,SAAUO,GAC7C,OAAOA,EAAcvT,EAAOrnH,EAAM+oH,MAEpC,OAAOjhH,KAASoyH,KASpBD,EAAUl5H,UAAU+b,QAAU,SAAUsmB,GACtC,IAAK,IAAI3kC,EAAI,EAAGA,EAAIsB,KAAKm6H,WAAW17H,OAAQC,IAC1C2kC,EAASrjC,KAAKm6H,WAAWz7H,GAAI,cAAgBA,EAAI,IAAKsB,OAW1Dk6H,EAAUl5H,UAAUsG,IAAM,SAAU+7B,GAGlC,IAFA,IAAI82F,EAAa,GAERz7H,EAAI,EAAGA,EAAIsB,KAAKm6H,WAAW17H,OAAQC,IAC1Cy7H,EAAWz7H,GAAKsB,KAAK6nH,QAAQxkF,EAASrjC,KAAKm6H,WAAWz7H,GAAI,cAAgBA,EAAI,IAAKsB,OAGrF,OAAO,IAAIk6H,EAAUC,EAAYn6H,KAAKo6H,cAQxCF,EAAUl5H,UAAUijG,MAAQ,WAC1B,OAAO,IAAIi2B,EAAUl6H,KAAKm6H,WAAWr1H,MAAM,GAAI9E,KAAKo6H,cAQtDF,EAAUl5H,UAAUy4H,iBAAmB,WACrC,OAAkC,IAA3Bz5H,KAAKm6H,WAAW17H,SAAgB,EAAAqpH,EAAA,IAAe9nH,KAAKm6H,WAAW,KAA2C,iBAA7Bn6H,KAAKm6H,WAAW,GAAG16H,OASzGy6H,EAAUl5H,UAAU04H,kBAAoB,WACtC,OAAO15H,KAAKy5H,mBAAqBz5H,KAAKm6H,WAAW,GAAG16H,MAAQ,MAS9Dy6H,EAAUl5H,UAAUqnH,UAAY,SAAUltG,GAExC,OAAOnb,KAAKo6H,YAAc,IAAMp6H,KAAK05H,oBAAsB,IAAM15H,KAAKm6H,WAAW/oG,KAAK,MAAQ,KAQhG8oG,EAAUl5H,UAAUkgG,OAAS,WAC3B,MAAO,CACLgoB,OAAQ,YACRiR,WAAYn6H,KAAKm6H,WACjBC,YAAap6H,KAAKo6H,cAYtBF,EAAU/Q,SAAW,SAAUhiB,GAC7B,OAAO,IAAI+yB,EAAU/yB,EAAKgzB,WAAYhzB,EAAKizB,cAS7CF,EAAUl5H,UAAUsnH,OAAS,SAAUntG,GAIrC,IAFA,IAAIg/G,EAAa,GAERz7H,EAAI,EAAGA,EAAIsB,KAAKm6H,WAAW17H,OAAQC,IAC1Cy7H,EAAWz7H,GAAKsB,KAAKm6H,WAAWz7H,GAAG4pH,SAGrC,OAAItoH,KAAKo6H,YACA,uGAA6G,QAAOp6H,KAAK05H,qBAAuB,UAEhJ,kEAAoES,EAAW/oG,KAAK,yCAA2C,mEAU1I8oG,EAAUl5H,UAAUwnH,OAAS,SAAUrtG,GACrC,IAAIg/G,EAAan6H,KAAKm6H,WAAW7yH,KAAI,SAAU8xB,GAC7C,OAAOA,EAAMmvF,MAAMptG,MAErB,OAAOnb,KAAKo6H,YAAc,IAAMp6H,KAAK05H,oBAA2B,KAAOS,EAAW/oG,KAAK,KAAO,KAQzF8oG,IACN,CACDvR,SAAS,EACTpB,QAAQ,ICtQN,GAAe,CAAC,SAAU,UAC9B,QACWuT,IAAsC,EAAA1T,EAAA,IAHtC,iBAGoD,IAAepiB,IAC5E,IAAI,OACF32B,EAAM,OACN1Z,EAAM,KACN8M,GACEujC,EACA40B,EAASJ,EAAc,CACzBnrD,WAEE16C,EChBC,SAAuBqxE,GAC5B,IAAI,OACF32B,EAAM,OACN1Z,GACEqwC,EAgBJ,OAAO,SAAgBjiG,EAAQgF,EAAOtI,GACpC,IACE,GAAIb,MAAMoF,QAAQjB,GAEhB,OAAO4xD,EAAO5xD,GAAQsrE,OAAOtmE,EAAOtI,GAAOwB,UACtC,GAAI8B,GAAmC,mBAAlBA,EAAOsrE,OAEjC,OAAOtrE,EAAOsrE,OAAOtmE,EAAOtI,GACvB,GAAsB,iBAAXsD,EAEhB,OAAOsrE,EAAOtrE,EAAQgF,EAAOtI,GACxB,GAAsB,iBAAXsD,EAAqB,CACrC,IAAKgF,EAAM0xH,mBACT,MAAMh5H,UAAU,mDAIlB,OADA,QAAgBsC,EAAQgF,EAAM2xH,oBAAqBj6H,GAC5CsD,EAEP,MAAM,IAAItC,UAAU,kDAEtB,MAAOL,GACP,MAAMi5H,EAAej5H,KD1BZ26H,CAAc,CACzB1sD,SACA1Z,WA6BF,SAAS29D,EAAevvH,EAAQgF,EAAOtI,GACrC,KAAMO,gBAAgBsyH,GACpB,MAAM,IAAIh1C,YAAY,oDAOxB,GAJAt9E,KAAK+C,OAASA,EACd/C,KAAK+H,MAAQtI,EAAQsI,EAAQ,KAC7B/H,KAAKP,MAAQA,GAASsI,IAEjB,EAAA+/G,EAAA,IAAa/kH,MAAY,EAAA+kH,EAAA,IAAe/kH,GAC3C,MAAM,IAAItC,UAAU,mDAGtB,IAAI,EAAAqnH,EAAA,IAAa/kH,IAA2B,QAAhBA,EAAO2C,KACjC,MAAM,IAAIyG,MAAM,iCAGlB,GAAInM,KAAK+H,SAAU,EAAA+/G,EAAA,IAAY9nH,KAAK+H,OAElC,MAAM,IAAItH,UAAU,iCAGtB,KAAK,EAAAqnH,EAAA,IAAO9nH,KAAKP,OACf,MAAM,IAAIgB,UAAU,4BAItB0B,OAAOC,eAAepC,KAAM,OAAQ,CAClC6C,IAAK,WACH,OAAI7C,KAAK+H,MACA/H,KAAK+H,MAAM0xH,mBAAqBz5H,KAAK+H,MAAM2xH,oBAAsB,GAEjE15H,KAAK+C,OAAO2C,MAAQ,IAE7BhE,KAAK1B,MACPwpE,IAAK,WACH,MAAM,IAAIr9D,MAAM,kDAgJtB,SAASusH,EAAgBrrG,EAAMglG,GACxBA,IACHA,EAAc,QAGhB,IAAI0B,EAAaf,EAAc3lG,EAAMglG,GACjCsG,EAAiB3F,EAAc3lG,EAAK5tB,MAAO4yH,GAC/C,MAAuB,QAAhBA,GAA4C,OAAnBsG,GAA2BA,GAAkB5E,EAmF/E,OArOAzB,EAAetxH,UAAY,IAAIygE,EAC/B6wD,EAAetxH,UAAU8W,KAAO,iBAChCw6G,EAAetxH,UAAUg6H,kBAAmB,EAe5C1I,EAAetxH,UAAUymH,SAAW,SAAUE,EAAMC,GAClD,IAAImS,EAAa/5H,KAAK+C,OAAO0kH,SAASE,EAAMC,GAExCoS,EAAYh6H,KAAK+H,MAAQ/H,KAAK+H,MAAM0/G,SAASE,EAAMC,GAAY,KAE/DqT,EAAYj7H,KAAKP,MAAMgoH,SAASE,EAAMC,GAEtCliH,EAAO1F,KAAK+C,OAAO2C,KAEvB,GAAK1F,KAAK+H,MASH,IAAI/H,KAAK+H,MAAM0xH,mBAAoB,CAExC,IAAIpgD,EAAOr5E,KAAK+H,MAAM2xH,oBACtB,OAAO,SAA4BpS,EAAOrnH,EAAM+oH,GAC9C,IAAIjmH,EAASg3H,EAAWzS,EAAOrnH,EAAM+oH,GACjCvpH,EAAQw7H,EAAU3T,EAAOrnH,EAAM+oH,GACnC,OAAO,QAAgBjmH,EAAQs2E,EAAM55E,IAElC,IAAI,EAAAqoH,EAAA,IAAa9nH,KAAK+C,QAE3B,OAAO,SAA4BukH,EAAOrnH,EAAM+oH,GAC9C,IAAIkS,EAAcnB,EAAWzS,EAAOrnH,EAAM+oH,GACtCvpH,EAAQw7H,EAAU3T,EAAOrnH,EAAM+oH,GAC/BjhH,EAAQiyH,EAAU1S,EAAOrnH,EAAMi7H,GAGnC,OADA,QAAgB5T,EAAO5hH,EAAMiuB,EAAOunG,EAAanzH,EAAOtI,IACjDA,GAQT,IAAI07H,EAAmBn7H,KAAK+C,OAAOA,OAAO0kH,SAASE,EAAMC,GAEzD,GAAI5nH,KAAK+C,OAAOgF,MAAM0xH,mBAAoB,CACxC,IAAI2B,EAAap7H,KAAK+C,OAAOgF,MAAM2xH,oBACnC,OAAO,SAA4BpS,EAAOrnH,EAAM+oH,GAC9C,IAAI7zG,EAASgmH,EAAiB7T,EAAOrnH,EAAM+oH,GACvCkS,GAAc,QAAgB/lH,EAAQimH,GACtCrzH,EAAQiyH,EAAU1S,EAAOrnH,EAAMi7H,GAE/Bz7H,EAAQw7H,EAAU3T,EAAOrnH,EAAM+oH,GAEnC,OADA,QAAgB7zG,EAAQimH,EAAYznG,EAAOunG,EAAanzH,EAAOtI,IACxDA,GAIT,IAAI47H,EAAkBr7H,KAAK+C,OAAOgF,MAAM0/G,SAASE,EAAMC,GAEvD,OAAO,SAA4BN,EAAOrnH,EAAM+oH,GAC9C,IAAI7zG,EAASgmH,EAAiB7T,EAAOrnH,EAAM+oH,GACvCsS,EAAcD,EAAgB/T,EAAOrnH,EAAMkV,GAE3C+lH,EAActB,EAAOzkH,EAAQmmH,GAC7BvzH,EAAQiyH,EAAU1S,EAAOrnH,EAAMi7H,GAE/Bz7H,EAAQw7H,EAAU3T,EAAOrnH,EAAM+oH,GAEnC,OADAr1F,EAAOxe,EAAQmmH,EAAa3nG,EAAOunG,EAAanzH,EAAOtI,IAChDA,GAzDX,KAAK,EAAAqoH,EAAA,IAAa9nH,KAAK+C,QACrB,MAAM,IAAItC,UAAU,iCAGtB,OAAO,SAA4B6mH,EAAOrnH,EAAM+oH,GAC9C,OAAO,QAAgB1B,EAAO5hH,EAAMu1H,EAAU3T,EAAOrnH,EAAM+oH,MA+DjEsJ,EAAetxH,UAAU+b,QAAU,SAAUsmB,GAC3CA,EAASrjC,KAAK+C,OAAQ,SAAU/C,MAE5BA,KAAK+H,OACPs7B,EAASrjC,KAAK+H,MAAO,QAAS/H,MAGhCqjC,EAASrjC,KAAKP,MAAO,QAASO,OAUhCsyH,EAAetxH,UAAUsG,IAAM,SAAU+7B,GAOvC,OAAO,IAAIivF,EANEtyH,KAAK6nH,QAAQxkF,EAASrjC,KAAK+C,OAAQ,SAAU/C,OAE9CA,KAAK+H,MAAQ/H,KAAK6nH,QAAQxkF,EAASrjC,KAAK+H,MAAO,QAAS/H,OAAS,KAEjEA,KAAK6nH,QAAQxkF,EAASrjC,KAAKP,MAAO,QAASO,SAUzDsyH,EAAetxH,UAAUijG,MAAQ,WAC/B,OAAO,IAAIquB,EAAetyH,KAAK+C,OAAQ/C,KAAK+H,MAAO/H,KAAKP,QA0B1D6yH,EAAetxH,UAAUqnH,UAAY,SAAUltG,GAC7C,IAAIpY,EAAS/C,KAAK+C,OAAO0C,SAAS0V,GAC9BpT,EAAQ/H,KAAK+H,MAAQ/H,KAAK+H,MAAMtC,SAAS0V,GAAW,GACpD1b,EAAQO,KAAKP,MAAMgG,SAAS0V,GAMhC,OAJIu9G,EAAgB14H,KAAMmb,GAAWA,EAAQk3G,eAC3C5yH,EAAQ,IAAMA,EAAQ,KAGjBsD,EAASgF,EAAQ,MAAQtI,GAQlC6yH,EAAetxH,UAAUkgG,OAAS,WAChC,MAAO,CACLgoB,OAAQ,iBACRnmH,OAAQ/C,KAAK+C,OACbgF,MAAO/H,KAAK+H,MACZtI,MAAOO,KAAKP,QAYhB6yH,EAAenJ,SAAW,SAAUhiB,GAClC,OAAO,IAAImrB,EAAenrB,EAAKpkG,OAAQokG,EAAKp/F,MAAOo/F,EAAK1nG,QAS1D6yH,EAAetxH,UAAUsnH,OAAS,SAAUntG,GAC1C,IAAIpY,EAAS/C,KAAK+C,OAAOulH,OAAOntG,GAC5BpT,EAAQ/H,KAAK+H,MAAQ/H,KAAK+H,MAAMugH,OAAOntG,GAAW,GAClD1b,EAAQO,KAAKP,MAAM6oH,OAAOntG,GAM9B,OAJIu9G,EAAgB14H,KAAMmb,GAAWA,EAAQk3G,eAC3C5yH,EAAQ,iEAAmEA,EAAQ,kEAG9EsD,EAASgF,EAAQ,uHAAyHtI,GASnJ6yH,EAAetxH,UAAUwnH,OAAS,SAAUrtG,GAC1C,IAAIpY,EAAS/C,KAAK+C,OAAOwlH,MAAMptG,GAC3BpT,EAAQ/H,KAAK+H,MAAQ/H,KAAK+H,MAAMwgH,MAAMptG,GAAW,GACjD1b,EAAQO,KAAKP,MAAM8oH,MAAMptG,GAM7B,OAJIu9G,EAAgB14H,KAAMmb,GAAWA,EAAQk3G,eAC3C5yH,EAAQ,UAAUiM,OAAOjM,EAAO,aAG3BsD,EAASgF,EAAQ,KAAOtI,GAG1B6yH,IACN,CACD3J,SAAS,EACTpB,QAAQ,IE7TN,GAAe,CAAC,OAAQ,QAAS,QAC1BgU,IAAkC,EAAAnU,EAAA,IAFlC,aAEgD,IAAepiB,IACxE,IAAI,KACF2iB,EAAI,KACJ6T,EAAI,KACJ/5D,GACEujC,EAOJ,SAASy2B,EAAgB/1H,GACvB,QAAO81H,GAAOA,EAAKC,gBAAgB/1H,GAWrC,SAASg2H,EAAWh2H,GAClB,KAAM1F,gBAAgB07H,GACpB,MAAM,IAAIp+C,YAAY,oDAIxB,GAAoB,iBAAT53E,EAAmB,MAAM,IAAIjF,UAAU,wCAClDT,KAAK0F,KAAOA,EAqKd,OAlKAg2H,EAAW16H,UAAY,IAAIygE,EAC3Bi6D,EAAW16H,UAAU8W,KAAO,aAC5B4jH,EAAW16H,UAAU26H,cAAe,EAepCD,EAAW16H,UAAUymH,SAAW,SAAUE,EAAMC,GAC9C,IAAIliH,EAAO1F,KAAK0F,KAEhB,IAAuB,IAAnBkiH,EAASliH,GAGX,OAAO,SAAU4hH,EAAOrnH,EAAM+oH,GAC5B,OAAO/oH,EAAKyF,IAET,GAAIA,KAAQiiH,EACjB,OAAO,SAAUL,EAAOrnH,EAAM+oH,GAC5B,OAAOtjH,KAAQ4hH,GAAQ,QAAgBA,EAAO5hH,IAAQ,QAAgBiiH,EAAMjiH,IAG9E,IAAI4rH,EAASmK,EAAgB/1H,GAC7B,OAAO,SAAU4hH,EAAOrnH,EAAM+oH,GAC5B,OAAOtjH,KAAQ4hH,GAAQ,QAAgBA,EAAO5hH,GAAQ4rH,EAAS,IAAIkK,EAAK,KAAM91H,GA6BpF,SAAeA,GACb,MAAM,IAAIyG,MAAM,oBAAsBzG,GA9BoDk2H,CAAMl2H,KAUlGg2H,EAAW16H,UAAU+b,QAAU,SAAUsmB,KAUzCq4F,EAAW16H,UAAUsG,IAAM,SAAU+7B,GACnC,OAAOrjC,KAAKikG,SAiBdy3B,EAAW16H,UAAUijG,MAAQ,WAC3B,OAAO,IAAIy3B,EAAW17H,KAAK0F,OAU7Bg2H,EAAW16H,UAAUqnH,UAAY,SAAUltG,GACzC,OAAOnb,KAAK0F,MAUdg2H,EAAW16H,UAAUsnH,OAAS,SAAUntG,GACtC,IAAIzV,GAAO,QAAO1F,KAAK0F,MAEvB,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,WAQ/Cg2H,EAAW16H,UAAUkgG,OAAS,WAC5B,MAAO,CACLgoB,OAAQ,aACRxjH,KAAM1F,KAAK0F,OAYfg2H,EAAWvS,SAAW,SAAUhiB,GAC9B,OAAO,IAAIu0B,EAAWv0B,EAAKzhG,OAU7Bg2H,EAAW16H,UAAUwnH,OAAS,SAAUrtG,GACtC,IAAIm2G,GAAS,OAEkB,IAApB3J,EAAK3nH,KAAK0F,OAAyB+1H,EAAgBz7H,KAAK0F,QACjE4rH,GAAS,GAGX,IAAI72E,EAAS42E,EAASrxH,KAAK0F,KAAM4rH,GAEjC,MAAkB,OAAd72E,EAAO,GAEFA,EAIF,IAAMA,GAGRihF,IACN,CACD/S,SAAS,EACTpB,QAAQ,IC7MV,SAAS3iB,KAA2Q,OAA9PA,GAAWziG,OAAOwxB,QAAU,SAAU9xB,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAS9Z,UAAUxB,GAAI,IAAK,IAAIY,KAAO0a,EAAc7X,OAAOnB,UAAUgC,eAAe9B,KAAK8Y,EAAQ1a,KAAQuC,EAAOvC,GAAO0a,EAAO1a,IAAY,OAAOuC,IAA2B1B,MAAMH,KAAME,WAShT,IACI,GAAe,CAAC,OAAQ,OAAQ,cACzB27H,IAAoC,EAAAzU,EAAA,IAFpC,eAEkD,IAAepiB,IAC1E,IAAI,KACF2iB,EAAI,KACJlmD,EAAI,WACJi6D,GACE12B,EAUJ,SAAS82B,EAAa/7H,EAAIE,GACxB,KAAMD,gBAAgB87H,GACpB,MAAM,IAAIx+C,YAAY,oDAQxB,GALkB,iBAAPv9E,IACTA,EAAK,IAAI27H,EAAW37H,MAIjB,EAAA+nH,EAAA,IAAO/nH,GAAK,MAAM,IAAIU,UAAU,mCAErC,IAAK7B,MAAMoF,QAAQ/D,KAAUA,EAAKoL,MAAMy8G,EAAA,IACtC,MAAM,IAAIrnH,UAAU,wDAGtBT,KAAKD,GAAKA,EACVC,KAAKC,KAAOA,GAAQ,GAEpBkC,OAAOC,eAAepC,KAAM,OAAQ,CAClC6C,IAAK,WACH,OAAO7C,KAAKD,GAAG2F,MAAQ,IACvBhE,KAAK1B,MACPwpE,IAAK,WACH,MAAM,IAAIr9D,MAAM,kDAKtB2vH,EAAa96H,UAAY,IAAIygE,EAC7Bq6D,EAAa96H,UAAU8W,KAAO,eAC9BgkH,EAAa96H,UAAU+6H,gBAAiB,EAexCD,EAAa96H,UAAUymH,SAAW,SAAUE,EAAMC,GAChD,KAAM5nH,gBAAgB87H,GACpB,MAAM,IAAIr7H,UAAU,yBAItB,IAAIw2H,GAAW,QAAIj3H,KAAKC,MAAM,SAAUV,GACtC,OAAOA,EAAIkoH,SAASE,EAAMC,MAG5B,IAAI,EAAAE,EAAA,IAAa9nH,KAAKD,IAAK,CAEzB,IAAI20H,EAAQ10H,KAAKD,GAAG2F,KAChB3F,EAAK20H,KAAS/M,GAAO,QAAgBA,EAAM+M,QAASr0H,EAGxD,GAF0B,mBAAPN,IAAoC,IAAfA,EAAGi8H,QAEhC,CAGT,IAAIA,EAAUh8H,KAAKC,KACnB,OAAO,SAA0BqnH,EAAOrnH,EAAM+oH,GAC5C,OAAQ0L,KAASpN,GAAQ,QAAgBA,EAAOoN,GAAS30H,GAAIi8H,EAASrU,EAAM/iB,GAAS,GAAI0iB,EAAOrnH,KAIlG,GAAwB,IAApBg3H,EAASx4H,OAAc,CACzB,IAAIy4H,EAAWD,EAAS,GACxB,OAAO,SAA0B3P,EAAOrnH,EAAM+oH,GAC5C,OAAQ0L,KAASpN,GAAQ,QAAgBA,EAAOoN,GAAS30H,GAAIm3H,EAAS5P,EAAOrnH,EAAM+oH,KAEhF,GAAwB,IAApBiO,EAASx4H,OAAc,CAChC,IAAI04H,EAAWF,EAAS,GACpBG,EAAWH,EAAS,GACxB,OAAO,SAA0B3P,EAAOrnH,EAAM+oH,GAC5C,OAAQ0L,KAASpN,GAAQ,QAAgBA,EAAOoN,GAAS30H,GAAIo3H,EAAS7P,EAAOrnH,EAAM+oH,GAAUoO,EAAS9P,EAAOrnH,EAAM+oH,KAGrH,OAAO,SAA0B1B,EAAOrnH,EAAM+oH,GAC5C,OAAQ0L,KAASpN,GAAQ,QAAgBA,EAAOoN,GAAS30H,GAAII,MAAM,MAAM,QAAI82H,GAAU,SAAUI,GAC/F,OAAOA,EAAQ/P,EAAOrnH,EAAM+oH,QAK/B,IAAI,EAAAlB,EAAA,IAAe9nH,KAAKD,MAAO,EAAA+nH,EAAA,IAAY9nH,KAAKD,GAAGgI,QAAU/H,KAAKD,GAAGgI,MAAM0xH,mBAAoB,CAEpG,IAAIM,EAAa/5H,KAAKD,GAAGgD,OAAO0kH,SAASE,EAAMC,GAE3CvuC,EAAOr5E,KAAKD,GAAGgI,MAAM2xH,oBACrBuC,EAAWj8H,KAAKC,KACpB,OAAO,SAA0BqnH,EAAOrnH,EAAM+oH,GAC5C,IAAIjmH,EAASg3H,EAAWzS,EAAOrnH,EAAM+oH,GAGrC,OAFA,QAAmBjmH,EAAQs2E,GACft2E,EAAOs2E,IAASt2E,EAAOs2E,GAAM2iD,QAC1Bj5H,EAAOs2E,GAAM4iD,EAAUtU,EAAM/iB,GAAS,GAAI0iB,EAAOrnH,IAC9D8C,EAAOs2E,GAAMl5E,MAAM4C,GAAQ,QAAIk0H,GAAU,SAAUI,GAEnD,OAAOA,EAAQ/P,EAAOrnH,EAAM+oH,QAMhC,IAAIkT,EAASl8H,KAAKD,GAAG0nH,SAASE,EAAMC,GAEhCuU,EAAYn8H,KAAKC,KACrB,OAAO,SAA0BqnH,EAAOrnH,EAAM+oH,GAC5C,IAAIjpH,EAAKm8H,EAAO5U,EAAOrnH,EAAM+oH,GAE7B,OADYjpH,GAAMA,EAAGi8H,QACNj8H,EAAGo8H,EAAWxU,EAAM/iB,GAAS,GAAI0iB,EAAOrnH,IACrDF,EAAGI,MAAMJ,GAAI,QAAIk3H,GAAU,SAAUI,GAErC,OAAOA,EAAQ/P,EAAOrnH,EAAM+oH,SAWpC8S,EAAa96H,UAAU+b,QAAU,SAAUsmB,GACzCA,EAASrjC,KAAKD,GAAI,KAAMC,MAExB,IAAK,IAAItB,EAAI,EAAGA,EAAIsB,KAAKC,KAAKxB,OAAQC,IACpC2kC,EAASrjC,KAAKC,KAAKvB,GAAI,QAAUA,EAAI,IAAKsB,OAW9C87H,EAAa96H,UAAUsG,IAAM,SAAU+7B,GAKrC,IAJA,IAAItjC,EAAKC,KAAK6nH,QAAQxkF,EAASrjC,KAAKD,GAAI,KAAMC,OAE1CC,EAAO,GAEFvB,EAAI,EAAGA,EAAIsB,KAAKC,KAAKxB,OAAQC,IACpCuB,EAAKvB,GAAKsB,KAAK6nH,QAAQxkF,EAASrjC,KAAKC,KAAKvB,GAAI,QAAUA,EAAI,IAAKsB,OAGnE,OAAO,IAAI87H,EAAa/7H,EAAIE,IAQ9B67H,EAAa96H,UAAUijG,MAAQ,WAC7B,OAAO,IAAI63B,EAAa97H,KAAKD,GAAIC,KAAKC,KAAK6E,MAAM,KAKnD,IAAIs3H,EAAeN,EAAa96H,UAAUyE,SA8F1C,SAAS42H,EAAeC,EAAUjvG,EAAMlS,GAStC,IARA,IAMIyiE,EANAo4C,EAAQ,GAGRuG,EAAQ,qDACRC,EAAW,EAI2B,QAAlC5+C,EAAQ2+C,EAAM/vE,KAAK8vE,KAMzB,GAHAtG,GAASsG,EAASrqF,UAAUuqF,EAAU5+C,EAAM71E,OAC5Cy0H,EAAW5+C,EAAM71E,MAEA,OAAb61E,EAAM,GAERo4C,GAAS,IACTwG,QACK,CAELA,GAAY5+C,EAAM,GAAGn/E,OACrB,IAAIkE,EAAW0qB,EAAKuwD,EAAM,IAE1B,IAAKj7E,EACH,MAAM,IAAI5D,eAAe,sBAAwB6+E,EAAM,GAAK,oBAG9D,QAAiBv9E,IAAbu9E,EAAM,GAER,cAAej7E,GACb,IAAK,SACHqzH,GAASrzH,EACT,MAEF,IAAK,SACH,IAAI,EAAAmlH,EAAA,IAAOnlH,GACTqzH,GAASrzH,EAAS4lH,MAAMptG,OACnB,KAAIvc,MAAMoF,QAAQrB,GAUvB,MAAM,IAAIlC,UAAU,aAAem9E,EAAM,GAAK,+CAR9Co4C,GAASrzH,EAAS2E,KAAI,SAAU/H,EAAKwI,GACnC,IAAI,EAAA+/G,EAAA,IAAOvoH,GACT,OAAOA,EAAIgpH,MAAMptG,GAGnB,MAAM,IAAI1a,UAAU,aAAem9E,EAAM,GAAK,IAAM71E,EAAQ,uBAC3DqpB,KAAK,KAKV,MAEF,QACE,MAAM,IAAI3wB,UAAU,aAAem9E,EAAM,GAAK,mDAE7C,CAEL,KAAI,EAAAkqC,EAAA,IAAOnlH,EAASi7E,EAAM,KAAOj7E,EAASi7E,EAAM,KAG9C,MAAM,IAAIn9E,UAAU,aAAem9E,EAAM,GAAK,IAAMA,EAAM,GAAK,oBAF/Do4C,GAASrzH,EAASi7E,EAAM,IAAI2qC,MAAMptG,IAU1C,OAFA66G,EAASsG,EAASx3H,MAAM03H,GAnJ1BV,EAAa96H,UAAUyE,SAAW,SAAU0V,GAC1C,IAAIgtG,EACAziH,EAAO1F,KAAKD,GAAG0F,SAAS0V,GAO5B,OALIA,GAAsC,iBAApBA,EAAQwwB,UAAwB,QAAexwB,EAAQwwB,QAASjmC,KAEpFyiH,EAAehtG,EAAQwwB,QAAQjmC,GAAM1F,KAAMmb,SAGjB,IAAjBgtG,EACFA,EAIFiU,EAAal7H,KAAKlB,KAAMmb,IASjC2gH,EAAa96H,UAAUqnH,UAAY,SAAUltG,GAC3C,IAAIlb,EAAOD,KAAKC,KAAKqH,KAAI,SAAU/H,GACjC,OAAOA,EAAIkG,SAAS0V,MAItB,QAFS,EAAA2sG,EAAA,IAAyB9nH,KAAKD,IAAM,IAAMC,KAAKD,GAAG0F,SAAS0V,GAAW,IAAMnb,KAAKD,GAAG0F,SAAS0V,IAE1F,IAAMlb,EAAKmxB,KAAK,MAAQ,KAQtC0qG,EAAa96H,UAAUkgG,OAAS,WAC9B,MAAO,CACLgoB,OAAQ,eACRnpH,GAAIC,KAAKD,GACTE,KAAMD,KAAKC,OAYf67H,EAAa3S,SAAW,SAAUhiB,GAChC,OAAO,IAAI20B,EAAa30B,EAAKpnG,GAAIonG,EAAKlnG,OASxC67H,EAAa96H,UAAUsnH,OAAS,SAAUntG,GACxC,IAAIlb,EAAOD,KAAKC,KAAKqH,KAAI,SAAU/H,GACjC,OAAOA,EAAI+oH,OAAOntG,MAGpB,MAAO,gCAAiC,QAAOnb,KAAKD,IAAM,wEAA0EE,EAAKmxB,KAAK,yCAA2C,kEAsF3L,IAAIqrG,EAAYX,EAAa96H,UAAUunH,MA+FvC,OAlFAuT,EAAa96H,UAAUunH,MAAQ,SAAUptG,GACvC,IAAIuhH,EAOJ,OALIvhH,GAAsC,iBAApBA,EAAQwwB,UAAwB,QAAexwB,EAAQwwB,QAAS3rC,KAAK0F,QAEzFg3H,EAAYvhH,EAAQwwB,QAAQ3rC,KAAK0F,MAAM1F,KAAMmb,SAGtB,IAAduhH,EACFA,EAIFD,EAAUv7H,KAAKlB,KAAMmb,IAS9B2gH,EAAa96H,UAAUwnH,OAAS,SAAUrtG,GACxC,IAIIwhH,EAYAC,EAhBA38H,EAAOD,KAAKC,KAAKqH,KAAI,SAAU/H,GAEjC,OAAOA,EAAIgpH,MAAMptG,MAgBnB,OAZI0zG,EAAe7uH,KAAK0F,QACtBi3H,EAAiB9N,EAAe7uH,KAAK0F,QAInCiiH,EAAK3nH,KAAK0F,OAA2C,mBAA1BiiH,EAAK3nH,KAAK0F,MAAM6iH,OAAyD,iBAA1BZ,EAAK3nH,KAAK0F,MAAM6iH,OAAuD,iBAA1BZ,EAAK3nH,KAAK0F,MAAM6iH,QAEzIoU,EAAiBhV,EAAK3nH,KAAK0F,MAAM6iH,cAKpBoU,GACb,IAAK,WAEHC,EAAcD,EAAe38H,KAAMmb,GACnC,MAEF,IAAK,SAEHyhH,EAAcP,EAAeM,EAAgB38H,KAAMmb,GACnD,MAEF,IAAK,SAEH,cAAewhH,EAAe18H,EAAKxB,SACjC,IAAK,WACHm+H,EAAcD,EAAe18H,EAAKxB,QAAQuB,KAAMmb,GAChD,MAEF,IAAK,SACHyhH,EAAcP,EAAeM,EAAe18H,EAAKxB,QAASuB,KAAMmb,IAMxE,YAA2B,IAAhByhH,EACFA,EAGFP,EpBSkB,0CoBTcr8H,KAAMmb,IAQ/C2gH,EAAa96H,UAAUynH,cAAgB,WACrC,OAAOzoH,KAAK8X,KAAO,IAAM9X,KAAK0F,MAGzBo2H,IACN,CACDnT,SAAS,EACTpB,QAAQ,I,WC3cV,SAAS,KAA2Q,OAA9P,GAAWplH,OAAOwxB,QAAU,SAAU9xB,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAS9Z,UAAUxB,GAAI,IAAK,IAAIY,KAAO0a,EAAc7X,OAAOnB,UAAUgC,eAAe9B,KAAK8Y,EAAQ1a,KAAQuC,EAAOvC,GAAO0a,EAAO1a,IAAY,OAAOuC,IAA2B1B,MAAMH,KAAME,WAMhT,IAAI,GAAO,QACP,GAAe,CAAC,QAAS,UAAW,SAAU,eAAgB,YAAa,iBAAkB,YAAa,kBAAmB,eAAgB,yBAA0B,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAa,iBAAkB,cAC7Q28H,IAA6B,EAAAzV,EAAA,IAAQ,GAAM,IAAepiB,IACnE,IAAI,MACFyzB,EAAK,QACL3H,EAAO,OACPloG,EAAM,aACNixG,EAAY,UACZhR,EAAS,eACTyJ,EAAc,UACdhJ,EAAS,gBACTkJ,EAAe,aACfhB,EAAY,uBACZe,EAAsB,aACtBuJ,EAAY,UACZ5B,EAAS,WACTtI,EAAU,aACVgE,EAAY,gBACZzD,EAAe,UACfY,EAAS,eACTD,EAAc,WACd4I,GACE12B,EAyCA9nF,EAAQu7G,EAAM,GAAM,CACtBve,OAAQ,SAAgB0a,GACtB,OAAOkI,EAAWlI,EAAY,KAEhC,iBAAkB,SAAqBmI,GACrC,OAAOC,EAAcD,EAAa,KAEpC,iBAAkB,SAAsBnI,EAAYz5G,GAElD,OAAO2hH,EAAWlI,OADiBv0H,IAAlB8a,EAAQ+7B,MAAsB/7B,EAAQ+7B,MAAQ,KAGjE,yBAA0B8lF,IAG5B,SAASA,EAAcD,GACrB,IAAI5hH,EAAUjb,UAAUzB,OAAS,QAAsB4B,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAC9E+8H,OAA+B58H,IAAlB8a,EAAQ+7B,MAAsB/7B,EAAQ+7B,MAAQ,GAE/D,OAAO,SAAQ6lF,GAAa,SAAU5yG,GACpC,GAAoB,iBAATA,EAAmB,MAAM,IAAI1pB,UAAU,mBAClD,OAAOq8H,EAAW3yG,EAAM8yG,MAK5B,IAQIC,EAAa,CACf,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACLC,KAAM,EACN,KAAK,EACL,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,EACL,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,MAAM,EACN,MAAM,EACN,OAAO,GAGLC,EAAmB,CACrBt+B,KAAK,EACL+uB,IAAI,EACJwP,IAAI,EACJ3O,KAAK,EACLC,KAAK,EACLC,IAAI,EACJjsF,KAAK,GAEH26F,EAAY,CACdxQ,MAAM,EACNC,OAAO,EACPwQ,KAAM,KACNl9H,eAAWA,GAETm9H,EAAoB,CAAC,MAAO,YAgChC,SAASC,EAAcprH,EAAO5T,GAC5B,OAAO4T,EAAMuiH,WAAW3xF,OAAO5wB,EAAMtK,MAAOtJ,GAW9C,SAASi/H,EAAiBrrH,GACxB,OAAOorH,EAAcprH,EAAO,GAU9B,SAAS5N,EAAK4N,GACZA,EAAMtK,QASR,SAAS41H,EAActrH,GACrB,OAAOA,EAAMuiH,WAAW76B,OAAO1nF,EAAMtK,MAAQ,GAS/C,SAAS61H,EAAcvrH,GACrB,OAAOA,EAAMuiH,WAAW76B,OAAO1nF,EAAMtK,MAAQ,GAS/C,SAAS81H,EAASxrH,GAMhB,IALAA,EAAMyrH,UAnJA,EAoJNzrH,EAAM0rH,MAAQ,GACd1rH,EAAMm1G,QAAU,GAGTtqG,EAAM8gH,aAAaN,EAAiBrrH,GAAQA,EAAM4rH,eACvDx5H,EAAK4N,GAIP,GAAgC,MAA5BqrH,EAAiBrrH,GACnB,KAAmC,OAA5BqrH,EAAiBrrH,IAA+C,KAA5BqrH,EAAiBrrH,IAC1DA,EAAMm1G,SAAWkW,EAAiBrrH,GAClC5N,EAAK4N,GAKT,GAAgC,KAA5BqrH,EAAiBrrH,GAArB,CAOA,GAAgC,OAA5BqrH,EAAiBrrH,KAAoBA,EAAM4rH,aAI7C,OAHA5rH,EAAMyrH,UA5KG,EA6KTzrH,EAAM0rH,MAAQL,EAAiBrrH,QAC/B5N,EAAK4N,GAIP,IAAI6rH,EAAKR,EAAiBrrH,GACtB8rH,EAAKV,EAAcprH,EAAO,GAC1B+rH,EAAKX,EAAcprH,EAAO,GAE9B,GAAkB,IAAd+rH,EAAG3/H,QAAgBy+H,EAAWkB,GAMhC,OALA/rH,EAAMyrH,UAvLG,EAwLTzrH,EAAM0rH,MAAQK,EACd35H,EAAK4N,GACL5N,EAAK4N,QACL5N,EAAK4N,GAKP,GAAkB,IAAd8rH,EAAG1/H,QAAgBy+H,EAAWiB,GAKhC,OAJA9rH,EAAMyrH,UAjMG,EAkMTzrH,EAAM0rH,MAAQI,EACd15H,EAAK4N,QACL5N,EAAK4N,GAKP,GAAI6qH,EAAWgB,GAIb,OAHA7rH,EAAMyrH,UA1MG,EA2MTzrH,EAAM0rH,MAAQG,OACdz5H,EAAK4N,GAKP,GAAI6K,EAAMmhH,WAAWH,GAArB,CACE7rH,EAAMyrH,UAjNA,EAmNN,IAAIQ,EAAKb,EAAcprH,EAAO,GAE9B,GAAW,OAAPisH,GAAsB,OAAPA,GAAsB,OAAPA,EAAa,CAM7C,IALAjsH,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GACLA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAEE6K,EAAMqhH,WAAWb,EAAiBrrH,KACvCA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAGP,GAAgC,MAA5BqrH,EAAiBrrH,GAKnB,IAHAA,EAAM0rH,OAAS,IACft5H,EAAK4N,GAEE6K,EAAMqhH,WAAWb,EAAiBrrH,KACvCA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,QAEF,GAAgC,MAA5BqrH,EAAiBrrH,GAK1B,IAHAA,EAAM0rH,OAAS,IACft5H,EAAK4N,GAEE6K,EAAMshH,QAAQd,EAAiBrrH,KACpCA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAIT,OAIF,GAAgC,MAA5BqrH,EAAiBrrH,GACnBA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAEA6K,EAAMshH,QAAQd,EAAiBrrH,MAElCA,EAAMyrH,UA/PD,OAiQF,CACL,KAAO5gH,EAAMshH,QAAQd,EAAiBrrH,KACpCA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAGH6K,EAAMuhH,cAAcf,EAAiBrrH,GAAQurH,EAAcvrH,MAC7DA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,IAIT,KAAO6K,EAAMshH,QAAQd,EAAiBrrH,KACpCA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAIP,GAAgC,MAA5BqrH,EAAiBrrH,IAA8C,MAA5BqrH,EAAiBrrH,GACtD,GAAI6K,EAAMshH,QAAQZ,EAAcvrH,KAAoC,MAAzBurH,EAAcvrH,IAA2C,MAAzBurH,EAAcvrH,GAAgB,CAUvG,GATAA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAE2B,MAA5BqrH,EAAiBrrH,IAA8C,MAA5BqrH,EAAiBrrH,KACtDA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,KAIF6K,EAAMshH,QAAQd,EAAiBrrH,IAClC,MAAMqsH,GAAkBrsH,EAAO,wBAA0BqrH,EAAiBrrH,GAAS,KAGrF,KAAO6K,EAAMshH,QAAQd,EAAiBrrH,KACpCA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAGP,GAAI6K,EAAMuhH,cAAcf,EAAiBrrH,GAAQurH,EAAcvrH,IAC7D,MAAMqsH,GAAkBrsH,EAAO,wBAA0BqrH,EAAiBrrH,GAAS,UAEhF,GAA6B,MAAzBurH,EAAcvrH,GAEvB,MADA5N,EAAK4N,GACCqsH,GAAkBrsH,EAAO,wBAA0BqrH,EAAiBrrH,GAAS,SA3FzF,CAmGA,IAAI6K,EAAMyhH,QAAQjB,EAAiBrrH,GAAQsrH,EAActrH,GAAQurH,EAAcvrH,IAA/E,CAkBA,IAFAA,EAAMyrH,UAjUG,EAmU0B,KAA5BJ,EAAiBrrH,IACtBA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,GAGP,MAAMqsH,GAAkBrsH,EAAO,yBAA2BA,EAAM0rH,MAAQ,KAtBtE,KAAO7gH,EAAMyhH,QAAQjB,EAAiBrrH,GAAQsrH,EAActrH,GAAQurH,EAAcvrH,KAAW6K,EAAMshH,QAAQd,EAAiBrrH,KAC1HA,EAAM0rH,OAASL,EAAiBrrH,GAChC5N,EAAK4N,IAGH,QAAe+qH,EAAkB/qH,EAAM0rH,OACzC1rH,EAAMyrH,UA3TC,EA6TPzrH,EAAMyrH,UA3TF,QAoKNzrH,EAAMyrH,UAtKG,EAkVb,SAASc,EAAoBvsH,GAC3B,GACEwrH,EAASxrH,SACc,OAAhBA,EAAM0rH,OASjB,SAASc,EAAWxsH,GAClBA,EAAM4rH,eAQR,SAASa,EAAYzsH,GACnBA,EAAM4rH,eAoHR,SAASnB,EAAWlI,EAAYqI,GAC9B,IAAI5qH,EA9ZG,CACL4qH,WAAY,GAEZrI,WAAY,GAEZpN,QAAS,GAETz/G,MAAO,EAEPg2H,MAAO,GAEPD,UA3EI,EA6EJG,aAAc,EAEdc,iBAAkB,MAiZpB,GAAS1sH,EAAO,CACduiH,aACAqI,eAGFY,EAASxrH,GACT,IAAIgb,EAwBN,SAAoBhb,GAClB,IAAIgb,EAEA2wC,EADAurD,EAAS,GASb,IANoB,KAAhBl3G,EAAM0rH,OAAgC,OAAhB1rH,EAAM0rH,OAAkC,MAAhB1rH,EAAM0rH,SACtD1wG,EAAO2xG,EAAgB3sH,IAClBm1G,QAAUn1G,EAAMm1G,SAIA,OAAhBn1G,EAAM0rH,OAAkC,MAAhB1rH,EAAM0rH,OAEb,IAAlBxU,EAAO9qH,QAAgB4uB,IACzB2wC,EAA0B,MAAhB3rD,EAAM0rH,MAChBxU,EAAO/nH,KAAK,CACV6rB,KAAMA,EACN2wC,QAASA,KAIb6/D,EAASxrH,GAEW,OAAhBA,EAAM0rH,OAAkC,MAAhB1rH,EAAM0rH,OAAiC,KAAhB1rH,EAAM0rH,SACvD1wG,EAAO2xG,EAAgB3sH,IAClBm1G,QAAUn1G,EAAMm1G,QACrBxpD,EAA0B,MAAhB3rD,EAAM0rH,MAChBxU,EAAO/nH,KAAK,CACV6rB,KAAMA,EACN2wC,QAASA,KAKf,OAAIurD,EAAO9qH,OAAS,EACX,IAAI6qH,EAAUC,IAEhBl8F,KACHA,EAAO,IAAImkG,OAAanxH,IACnBmnH,QAAUn1G,EAAMm1G,SAGhBn6F,GAlEE4xG,CAAW5sH,GAGtB,GAAoB,KAAhBA,EAAM0rH,MACR,MAzeS,IAyeL1rH,EAAMyrH,UAGFp4B,GAAYrzF,EAAO,uBAAyBA,EAAM0rH,OAElDW,GAAkBrsH,EAAO,oBAAsBA,EAAM0rH,MAAQ,KAIvE,OAAO1wG,EAkET,SAAS2xG,EAAgB3sH,GACvB,IAAI3M,EAAMzF,EAAMR,EAAOy/H,EACnB7xG,EAmDN,SAA0Bhb,GAGxB,IAFA,IAAIgb,EA8BN,SAAwBhb,GAGtB,IAFA,IAAIgb,EAAO8xG,EAAgB9sH,GAEJ,OAAhBA,EAAM0rH,OAEXa,EAAoBvsH,GACpBgb,EAAO,IAAIuoG,EAAa,KAAM,KAAM,CAACvoG,EAAM8xG,EAAgB9sH,KAG7D,OAAOgb,EAvCI+xG,CAAe/sH,GAEH,MAAhBA,EAAM0rH,OAAe,CAI1B,IAAIt9C,EAAOpuE,EAAM0sH,iBACjB1sH,EAAM0sH,iBAAmB1sH,EAAM4rH,aAC/BW,EAAoBvsH,GACpB,IAAI+2C,EAAY/7B,EACZ4nG,EAAW+J,EAAgB3sH,GAC/B,GAAoB,MAAhBA,EAAM0rH,MAAe,MAAMW,GAAkBrsH,EAAO,iDACxDA,EAAM0sH,iBAAmB,KACzBH,EAAoBvsH,GACpB,IAAI6iH,EAAY8J,EAAgB3sH,GAEhCgb,EAAO,IAAImlG,EAAgBppE,EAAW6rE,EAAUC,GAEhD7iH,EAAM0sH,iBAAmBt+C,EAG3B,OAAOpzD,EAzEIgyG,CAAiBhtH,GAE5B,GAAoB,MAAhBA,EAAM0rH,MAAe,CACvB,IAAI,EAAAjW,EAAA,IAAaz6F,GAKf,OAHA3nB,EAAO2nB,EAAK3nB,KACZk5H,EAAoBvsH,GACpB5S,EAAQu/H,EAAgB3sH,GACjB,IAAIigH,EAAe,IAAIoJ,EAAWh2H,GAAOjG,GAC3C,IAAI,EAAAqoH,EAAA,IAAez6F,GAIxB,OAFAuxG,EAAoBvsH,GACpB5S,EAAQu/H,EAAgB3sH,GACjB,IAAIigH,EAAejlG,EAAKtqB,OAAQsqB,EAAKtlB,MAAOtI,GAC9C,IAAI,EAAAqoH,EAAA,IAAez6F,KAAS,EAAAy6F,EAAA,IAAaz6F,EAAKttB,MAEnDm/H,GAAQ,EACRj/H,EAAO,GACPyF,EAAO2nB,EAAK3nB,KACZ2nB,EAAKptB,KAAK8c,SAAQ,SAAUxd,EAAKwI,IAC3B,EAAA+/G,EAAA,IAAavoH,GACfU,EAAK8H,GAASxI,EAAImG,KAElBw5H,GAAQ,KAIRA,GAGF,OAFAN,EAAoBvsH,GACpB5S,EAAQu/H,EAAgB3sH,GACjB,IAAIkgH,EAAuB7sH,EAAMzF,EAAMR,GAIlD,MAAMi/H,GAAkBrsH,EAAO,mDAGjC,OAAOgb,EA+DT,SAAS8xG,EAAgB9sH,GAGvB,IAFA,IAAIgb,EAAOiyG,EAAgBjtH,GAEJ,QAAhBA,EAAM0rH,OAEXa,EAAoBvsH,GACpBgb,EAAO,IAAIuoG,EAAa,MAAO,MAAO,CAACvoG,EAAMiyG,EAAgBjtH,KAG/D,OAAOgb,EAST,SAASiyG,EAAgBjtH,GAGvB,IAFA,IAAIgb,EAAOkyG,EAAeltH,GAEH,QAAhBA,EAAM0rH,OAEXa,EAAoBvsH,GACpBgb,EAAO,IAAIuoG,EAAa,MAAO,MAAO,CAACvoG,EAAMkyG,EAAeltH,KAG9D,OAAOgb,EAST,SAASkyG,EAAeltH,GAGtB,IAFA,IAAIgb,EAAOmyG,EAAgBntH,GAEJ,MAAhBA,EAAM0rH,OAEXa,EAAoBvsH,GACpBgb,EAAO,IAAIuoG,EAAa,IAAK,QAAS,CAACvoG,EAAMmyG,EAAgBntH,KAG/D,OAAOgb,EAST,SAASmyG,EAAgBntH,GAGvB,IAFA,IAAIgb,EAAOoyG,EAAgBptH,GAEJ,OAAhBA,EAAM0rH,OAEXa,EAAoBvsH,GACpBgb,EAAO,IAAIuoG,EAAa,KAAM,SAAU,CAACvoG,EAAMoyG,EAAgBptH,KAGjE,OAAOgb,EAST,SAASoyG,EAAgBptH,GAGvB,IAFA,IAAIgb,EAAOqyG,EAAgBrtH,GAEJ,MAAhBA,EAAM0rH,OAEXa,EAAoBvsH,GACpBgb,EAAO,IAAIuoG,EAAa,IAAK,SAAU,CAACvoG,EAAMqyG,EAAgBrtH,KAGhE,OAAOgb,EAQT,SAASqyG,EAAgBrtH,GAYvB,IAXA,IAAIib,EAAS,CAACqyG,EAAWttH,IACrBohH,EAAe,GACfmM,EAAY,CACd,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,aAGD,QAAeA,EAAWvtH,EAAM0rH,QAAQ,CAE7C,IAAI7+G,EAAO,CACTxZ,KAAM2M,EAAM0rH,MACZh+H,GAAI6/H,EAAUvtH,EAAM0rH,QAEtBtK,EAAajyH,KAAK0d,GAClB0/G,EAAoBvsH,GACpBib,EAAO9rB,KAAKm+H,EAAWttH,IAGzB,OAAsB,IAAlBib,EAAO7uB,OACF6uB,EAAO,GACa,IAAlBA,EAAO7uB,OACT,IAAIm3H,EAAanC,EAAa,GAAG/tH,KAAM+tH,EAAa,GAAG1zH,GAAIutB,GAE3D,IAAIwlG,EAAeW,EAAansH,KAAIoF,GAAKA,EAAE3M,KAAKutB,GAU3D,SAASqyG,EAAWttH,GAClB,IAAIgb,EAAM3nB,EAAM3F,EAAIutB,EACpBD,EAAOwyG,EAAgBxtH,GAOvB,IANA,IAAIutH,EAAY,CACd,KAAM,YACN,KAAM,kBACN,MAAO,kBAGF,QAAeA,EAAWvtH,EAAM0rH,QAErCh+H,EAAK6/H,EADLl6H,EAAO2M,EAAM0rH,OAEba,EAAoBvsH,GACpBib,EAAS,CAACD,EAAMwyG,EAAgBxtH,IAChCgb,EAAO,IAAIuoG,EAAalwH,EAAM3F,EAAIutB,GAGpC,OAAOD,EAST,SAASwyG,EAAgBxtH,GACvB,IAAIgb,EAAM3nB,EAAM3F,EAAIutB,EACpBD,EAAOyyG,EAAWztH,GAOlB,IANA,IAAIutH,EAAY,CACd/R,GAAI,KACJwP,GAAI,OAIC,QAAeuC,EAAWvtH,EAAM0rH,QAErCh+H,EAAK6/H,EADLl6H,EAAO2M,EAAM0rH,OAEba,EAAoBvsH,GAEP,OAAT3M,GAAiC,KAAhB2M,EAAM0rH,MAEzB1wG,EAAO,IAAIuoG,EAAa,IAAK,WAAY,CAACvoG,EAAM,IAAIquG,EAAW,QAAQ,IAGvEpuG,EAAS,CAACD,EAAMyyG,EAAWztH,IAC3Bgb,EAAO,IAAIuoG,EAAalwH,EAAM3F,EAAIutB,IAItC,OAAOD,EAST,SAASyyG,EAAWztH,GAClB,IAAIgb,EACAC,EAAS,GAUb,GANED,EAFkB,MAAhBhb,EAAM0rH,MAED,IAAIvM,EAAa,GAGjBuO,EAAiB1tH,GAGN,MAAhBA,EAAM0rH,OAAiB1rH,EAAM0sH,mBAAqB1sH,EAAM4rH,aAAc,CAIxE,IAFA3wG,EAAO9rB,KAAK6rB,GAEW,MAAhBhb,EAAM0rH,OAAiBzwG,EAAO7uB,OAAS,GAE5CmgI,EAAoBvsH,GAEA,MAAhBA,EAAM0rH,OAAiC,MAAhB1rH,EAAM0rH,OAAiC,MAAhB1rH,EAAM0rH,OAAiC,KAAhB1rH,EAAM0rH,MAE7EzwG,EAAO9rB,KAAK,IAAIk6H,EAAW,QAG3BpuG,EAAO9rB,KAAKu+H,EAAiB1tH,IAM/Bgb,EAFoB,IAAlBC,EAAO7uB,OAEF,IAAIs0H,EAAUzlG,EAAO,GAAIA,EAAO,GAAIA,EAAO,IAI3C,IAAIylG,EAAUzlG,EAAO,GAAIA,EAAO,IAI3C,OAAOD,EAST,SAAS0yG,EAAiB1tH,GACxB,IAAIgb,EAAM3nB,EAAM3F,EAAIutB,EACpBD,EAAO2yG,EAAoB3tH,GAM3B,IALA,IAAIutH,EAAY,CACd,IAAK,MACL,IAAK,aAGA,QAAeA,EAAWvtH,EAAM0rH,QAErCh+H,EAAK6/H,EADLl6H,EAAO2M,EAAM0rH,OAEba,EAAoBvsH,GACpBib,EAAS,CAACD,EAAM2yG,EAAoB3tH,IACpCgb,EAAO,IAAIuoG,EAAalwH,EAAM3F,EAAIutB,GAGpC,OAAOD,EAST,SAAS2yG,EAAoB3tH,GAC3B,IAAIgb,EAAMy5D,EAAMphF,EAAM3F,EAEtB+mF,EADAz5D,EAAO4yG,EAA4B5tH,GAWnC,IATA,IAAIutH,EAAY,CACd,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,YACN,IAAK,MACL9gC,IAAK,QAID,QAAe8gC,EAAWvtH,EAAM0rH,QAGlCh+H,EAAK6/H,EADLl6H,EAAO2M,EAAM0rH,OAEba,EAAoBvsH,GACpBy0E,EAAOm5C,EAA4B5tH,GACnCgb,EAAO,IAAIuoG,EAAalwH,EAAM3F,EAAI,CAACstB,EAAMy5D,IAM7C,OAAOz5D,EAST,SAAS4yG,EAA4B5tH,GACnC,IAAIgb,EAAMy5D,EAIV,IAFAA,EADAz5D,EAAO6yG,EAAW7tH,GAh8BV,IAo8BFA,EAAMyrH,WAAkD,OAAhBzrH,EAAM0rH,QAAkB,EAAAjW,EAAA,IAAez6F,MAr8B7E,IAq8BsFhb,EAAMyrH,YAAmC,EAAAhW,EAAA,IAAehhC,KAAW,EAAAghC,EAAA,IAAehhC,IAAqB,MAAZA,EAAK+uC,KAA+B,MAAhBxjH,EAAM0rH,OAM/Mj3C,EAAOo5C,EAAW7tH,GAClBgb,EAAO,IAAIuoG,EAAa,IAAK,WAAY,CAACvoG,EAAMy5D,IAAO,GAQ3D,OAAOz5D,EAWT,SAAS6yG,EAAW7tH,GAKlB,IAJA,IAAIgb,EAAO8yG,EAAW9tH,GAClBy0E,EAAOz5D,EACP+yG,EAAc,GAII,MAAhB/tH,EAAM0rH,QAAiB,EAAAjW,EAAA,IAAehhC,IAF/B,CAOT,GAHAs5C,EAAY5+H,KAAK,GAAS,GAAI6Q,IAC9BusH,EAAoBvsH,GAz+BhB,IA2+BAA,EAAMyrH,UAqBH,CAEL,GAASzrH,EAAO+tH,EAAY5mE,OAE5B,MApBA,GAHA4mE,EAAY5+H,KAAK,GAAS,GAAI6Q,IAC9BusH,EAAoBvsH,GA7+BlB,IA++BEA,EAAMyrH,WAAkD,MAAhBzrH,EAAM0rH,MAQ3C,CAELqC,EAAY5mE,MAEZ,GAASnnD,EAAO+tH,EAAY5mE,OAE5B,MAXA,GAASnnD,EAAO+tH,EAAY5mE,OAE5B4mE,EAAY5mE,MACZstB,EAAOq5C,EAAW9tH,GAClBgb,EAAO,IAAIuoG,EAAa,IAAK,SAAU,CAACvoG,EAAMy5D,IAoBtD,OAAOz5D,EAST,SAAS8yG,EAAW9tH,GAClB,IAAI3M,EAAM4nB,EAAQvtB,EACd6/H,EAAY,CACd,IAAK,aACL,IAAK,YACL,IAAK,SACLj9F,IAAK,OAGP,OAAI,QAAei9F,EAAWvtH,EAAM0rH,QAClCh+H,EAAK6/H,EAAUvtH,EAAM0rH,OACrBr4H,EAAO2M,EAAM0rH,MACba,EAAoBvsH,GACpBib,EAAS,CAAC6yG,EAAW9tH,IACd,IAAIujH,EAAalwH,EAAM3F,EAAIutB,IAatC,SAAkBjb,GAChB,IAAIgb,EAAM3nB,EAAM3F,EAAIutB,EAYpB,OAXAD,EAoBF,SAAgChb,GAC9B,IAAIgb,EAAM3nB,EAAM3F,EAChBstB,EA+CF,SAA0Bhb,GACxB,IAAIib,EAAS,GAEb,GAxnCQ,IAwnCJjb,EAAMyrH,YAAkC,QAAezrH,EAAM4qH,WAAY5qH,EAAM0rH,OAAQ,CACzF,IAAIsC,EAAahuH,EAAM4qH,WAAW5qH,EAAM0rH,OAGxC,GAFAF,EAASxrH,GAEW,MAAhBA,EAAM0rH,MAAe,CAKvB,GAJAzwG,EAAS,GACTuxG,EAAWxsH,GACXwrH,EAASxrH,GAEW,MAAhBA,EAAM0rH,MAGR,IAFAzwG,EAAO9rB,KAAKw9H,EAAgB3sH,IAEL,MAAhBA,EAAM0rH,OAEXF,EAASxrH,GACTib,EAAO9rB,KAAKw9H,EAAgB3sH,IAIhC,GAAoB,MAAhBA,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,0BAGjCysH,EAAYzsH,GACZwrH,EAASxrH,GAKX,OAAO,IAAIguH,EAAW/yG,GAGxB,OASF,SAAqBjb,GACnB,IAAU3M,EAEV,OApqCQ,IAoqCJ2M,EAAMyrH,WAtqCC,IAsqCiCzrH,EAAMyrH,WAAqCzrH,EAAM0rH,SAASX,GACpG13H,EAAO2M,EAAM0rH,MACbF,EAASxrH,GAaFiuH,EAAejuH,GAXlB,QAAeirH,EAAW53H,GAErB,IAAI8rH,EAAa8L,EAAU53H,KACY,IAArC83H,EAAkBl1H,QAAQ5C,GAE5B,IAAI8rH,EAAaV,EAAQprH,EAAM,WAE/B,IAAIg2H,EAAWh2H,KA4G5B,SAAiC2M,GAC/B,IAAUuH,EAEV,MAAoB,MAAhBvH,EAAM0rH,OACRnkH,EAAM2mH,EAA6BluH,GAI5BiuH,EAAejuH,EAFf,IAAIm/G,EAAa53G,KA6C5B,SAAiCvH,GAC/B,IAAUuH,EAEV,MAAoB,MAAhBvH,EAAM0rH,OACRnkH,EAAM4mH,GAA6BnuH,GAI5BiuH,EAAejuH,EAFf,IAAIm/G,EAAa53G,KA6C5B,SAAqBvH,GACnB,IAAItM,EAAOunB,EAAQ9N,EAAMg+B,EAEzB,GAAoB,MAAhBnrC,EAAM0rH,MAAe,CAKvB,GAHAc,EAAWxsH,GACXwrH,EAASxrH,GAEW,MAAhBA,EAAM0rH,MAAe,CAEvB,IAAIp0F,EAAM82F,GAASpuH,GAEnB,GAAoB,MAAhBA,EAAM0rH,MAAe,CAKvB,IAHAv+G,EAAO,EACP8N,EAAS,CAACqc,GAEa,MAAhBt3B,EAAM0rH,OAEXF,EAASxrH,GACTib,EAAO9N,GAAQihH,GAASpuH,GACxBmN,IAGF,GAAoB,MAAhBnN,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,4BAGjCysH,EAAYzsH,GACZwrH,EAASxrH,GAETmrC,EAAOlwB,EAAO,GAAG48B,MAAMzrD,OAEvB,IAAK,IAAI2lB,EAAI,EAAGA,EAAI5E,EAAM4E,IACxB,GAAIkJ,EAAOlJ,GAAG8lC,MAAMzrD,SAAW++C,EAC7B,MAAMkoD,GAAYrzF,EAAO,+BAAsCib,EAAOlJ,GAAG8lC,MAAMzrD,OAAS,QAAU++C,EAAO,KAI7Gz3C,EAAQ,IAAI8iH,EAAUv7F,OACjB,CAEL,GAAoB,MAAhBjb,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,4BAGjCysH,EAAYzsH,GACZwrH,EAASxrH,GACTtM,EAAQ4jC,QAIVm1F,EAAYzsH,GACZwrH,EAASxrH,GACTtM,EAAQ,IAAI8iH,EAAU,IAGxB,OAAOyX,EAAejuH,EAAOtM,GAG/B,OA6BF,SAAqBsM,GACnB,GAAoB,MAAhBA,EAAM0rH,MAAe,CAEvB,IAAIz+H,EADJu/H,EAAWxsH,GAEX,IAAIsnC,EAAa,GAEjB,GAGE,GAFAkkF,EAASxrH,GAEW,MAAhBA,EAAM0rH,MAAe,CAEvB,GAAoB,MAAhB1rH,EAAM0rH,MACRz+H,EAAMihI,EAA6BluH,QAC9B,GAAoB,MAAhBA,EAAM0rH,MACfz+H,EAAMkhI,GAA6BnuH,OAC9B,MAz+CL,IAy+CSA,EAAMyrH,WA3+CZ,IA2+C8CzrH,EAAMyrH,WAAqCzrH,EAAM0rH,SAASX,GAI3G,MAAMsB,GAAkBrsH,EAAO,2CAH/B/S,EAAM+S,EAAM0rH,MACZF,EAASxrH,GAMX,GAAoB,MAAhBA,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,qCAGjCwrH,EAASxrH,GAETsnC,EAAWr6C,GAAO0/H,EAAgB3sH,UAEb,MAAhBA,EAAM0rH,OAGf,GAAoB,MAAhB1rH,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,oDAGjCysH,EAAYzsH,GACZwrH,EAASxrH,GACT,IAAIgb,EAAO,IAAIukG,EAAWj4E,GAG1B,OADO2mF,EAAejuH,EAAOgb,GAI/B,OASF,SAAqBhb,GACnB,IAAIquH,EAEJ,OArhDQ,IAqhDJruH,EAAMyrH,WAER4C,EAAYruH,EAAM0rH,MAClBF,EAASxrH,GACF,IAAIm/G,EAAaV,EAAQ4P,EAAW93G,EAAOjgB,UAYtD,SAA0B0J,GACxB,IAAIgb,EAEJ,GAAoB,MAAhBhb,EAAM0rH,MAAe,CAMvB,GAJAc,EAAWxsH,GACXwrH,EAASxrH,GACTgb,EAAO2xG,EAAgB3sH,GAEH,MAAhBA,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,0BAOjC,OAJAysH,EAAYzsH,GACZwrH,EAASxrH,GAEFiuH,EAAejuH,EADtBgb,EAAO,IAAI8kG,EAAgB9kG,IAK7B,OASF,SAAkBhb,GAChB,KAAoB,KAAhBA,EAAM0rH,MAEFW,GAAkBrsH,EAAO,gCAEzBqsH,GAAkBrsH,EAAO,kBAd1BsuH,CAAStuH,GA7BTuuH,CAAiBvuH,GAnBjBwuH,CAAYxuH,GA3EZyuH,CAAYzuH,GAnGZ0uH,CAAY1uH,GAnDZ2uH,CAAwB3uH,GAhHxB4uH,CAAwB5uH,GA/BxB6uH,CAAY7uH,GAlFZ8uH,CAAiB9uH,GAMxB,IALA,IAAIutH,EAAY,CACd,IAAK,YACLzC,IAAM,eAGD,QAAeyC,EAAWvtH,EAAM0rH,QAErCh+H,EAAK6/H,EADLl6H,EAAO2M,EAAM0rH,OAEbF,EAASxrH,GAGTgb,EAAOizG,EAAejuH,EADtBgb,EAAO,IAAIuoG,EAAalwH,EAAM3F,EADrB,CAACstB,KAKZ,OAAOA,EArCA+zG,CAAuB/uH,IAEV,MAAhBA,EAAM0rH,OAAiC,OAAhB1rH,EAAM0rH,SAE/Bh+H,EAAc,OADd2F,EAAO2M,EAAM0rH,OACO,MAAQ,SAC5Ba,EAAoBvsH,GACpBib,EAAS,CAACD,EAAM8yG,EAAW9tH,IAE3Bgb,EAAO,IAAIuoG,EAAalwH,EAAM3F,EAAIutB,IAG7BD,EAvBAg0G,CAAShvH,GAqKlB,SAASiuH,EAAejuH,EAAOgb,EAAMsO,GAGnC,IAFA,IAAIrO,IAEoB,MAAhBjb,EAAM0rH,OAAiC,MAAhB1rH,EAAM0rH,OAAiC,MAAhB1rH,EAAM0rH,OAAoBpiG,IAAyC,IAAhCA,EAAMrzB,QAAQ+J,EAAM0rH,SAI3G,GAFAzwG,EAAS,GAEW,MAAhBjb,EAAM0rH,MAAe,CACvB,KAAI,EAAAjW,EAAA,IAAaz6F,MAAS,EAAAy6F,EAAA,IAAez6F,GA0BvC,OAAOA,EArBP,GAHAwxG,EAAWxsH,GACXwrH,EAASxrH,GAEW,MAAhBA,EAAM0rH,MAGR,IAFAzwG,EAAO9rB,KAAKw9H,EAAgB3sH,IAEL,MAAhBA,EAAM0rH,OAEXF,EAASxrH,GACTib,EAAO9rB,KAAKw9H,EAAgB3sH,IAIhC,GAAoB,MAAhBA,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,0BAGjCysH,EAAYzsH,GACZwrH,EAASxrH,GACTgb,EAAO,IAAIyuG,EAAazuG,EAAMC,QAO3B,GAAoB,MAAhBjb,EAAM0rH,MAAe,CAK9B,GAHAc,EAAWxsH,GACXwrH,EAASxrH,GAEW,MAAhBA,EAAM0rH,MAGR,IAFAzwG,EAAO9rB,KAAKw9H,EAAgB3sH,IAEL,MAAhBA,EAAM0rH,OAEXF,EAASxrH,GACTib,EAAO9rB,KAAKw9H,EAAgB3sH,IAIhC,GAAoB,MAAhBA,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,0BAGjCysH,EAAYzsH,GACZwrH,EAASxrH,GACTgb,EAAO,IAAIwsG,EAAaxsG,EAAM,IAAI6sG,EAAU5sG,QACvC,CAIL,GAFAuwG,EAASxrH,GArwCL,IAuwCAA,EAAMyrH,UACR,MAAMY,GAAkBrsH,EAAO,oCAGjCib,EAAO9rB,KAAK,IAAIgwH,EAAan/G,EAAM0rH,QACnCF,EAASxrH,GAETgb,EAAO,IAAIwsG,EAAaxsG,EAAM,IAAI6sG,EAAU5sG,GAD1B,IAKtB,OAAOD,EA6BT,SAASkzG,EAA6BluH,GAGpC,IAFA,IAAIuH,EAAM,GAEyB,KAA5B8jH,EAAiBrrH,IAA6C,MAA5BqrH,EAAiBrrH,IACxB,OAA5BqrH,EAAiBrrH,KAGnBuH,GAAO8jH,EAAiBrrH,GACxB5N,EAAK4N,IAGPuH,GAAO8jH,EAAiBrrH,GACxB5N,EAAK4N,GAKP,GAFAwrH,EAASxrH,GAEW,MAAhBA,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,4BAIjC,OADAwrH,EAASxrH,GACFzG,KAAKsR,MAAM,IAAMtD,EAAM,KA6BhC,SAAS4mH,GAA6BnuH,GAGpC,IAFA,IAAIuH,EAAM,GAEyB,KAA5B8jH,EAAiBrrH,IAA6C,MAA5BqrH,EAAiBrrH,IACxB,OAA5BqrH,EAAiBrrH,KAGnBuH,GAAO8jH,EAAiBrrH,GACxB5N,EAAK4N,IAGPuH,GAAO8jH,EAAiBrrH,GACxB5N,EAAK4N,GAKP,GAFAwrH,EAASxrH,GAEW,MAAhBA,EAAM0rH,MACR,MAAMW,GAAkBrsH,EAAO,4BAIjC,OADAwrH,EAASxrH,GACFzG,KAAKsR,MAAM,IAAMtD,EAAM,KA6EhC,SAAS6mH,GAASpuH,GAIhB,IAHA,IAAIib,EAAS,CAAC0xG,EAAgB3sH,IAC1B7T,EAAM,EAEa,MAAhB6T,EAAM0rH,OAEXF,EAASxrH,GAETib,EAAO9uB,GAAOwgI,EAAgB3sH,GAC9B7T,IAGF,OAAO,IAAIqqH,EAAUv7F,GA2IvB,SAASg0G,GAAIjvH,GACX,OAAOA,EAAMtK,MAAQsK,EAAM0rH,MAAMt/H,OAAS,EAW5C,SAASigI,GAAkBrsH,EAAOqT,GAChC,IAAIhZ,EAAI40H,GAAIjvH,GACR3S,EAAQ,IAAI49E,YAAY53D,EAAU,UAAYhZ,EAAI,KAEtD,OADAhN,EAAM6hI,KAAO70H,EACNhN,EAWT,SAASgmG,GAAYrzF,EAAOqT,GAC1B,IAAIhZ,EAAI40H,GAAIjvH,GACR3S,EAAQ,IAAI49E,YAAY53D,EAAU,UAAYhZ,EAAI,KAEtD,OADAhN,EAAM6hI,KAAO70H,EACNhN,EAGT,OAlwCAwd,EAAMyhH,QAAU,SAAiBjyH,EAAG80H,EAAOC,GACzC,OAAOvkH,EAAMwkH,oBAAoBh1H,IAAMwQ,EAAMykH,kBAAkBj1H,EAAG+0H,IAAUvkH,EAAMykH,kBAAkBH,EAAO90H,IAS7GwQ,EAAMwkH,oBAAsB,SAA6Bh1H,GACvD,MAAO,sDAAsD/G,KAAK+G,IAmBpEwQ,EAAMykH,kBAAoB,SAA2BC,EAAM/yC,GACzD,MAAO,aAAalpF,KAAKi8H,IAAS,oBAAoBj8H,KAAKkpF,IAAQ,2KAA2KlpF,KAAKkpF,IAUrP3xE,EAAM8gH,aAAe,SAAsBtxH,EAAGuxH,GAE5C,MAAa,MAANvxH,GAAmB,OAANA,GAAoB,OAANA,GAAcuxH,EAAe,GAWjE/gH,EAAMuhH,cAAgB,SAAuB/xH,EAAG+0H,GAC9C,MAAa,MAAN/0H,GAAuB,MAAV+0H,GAA2B,MAAVA,GAA2B,MAAVA,GASxDvkH,EAAMmhH,WAAa,SAAoB3xH,GACrC,OAAOA,GAAK,KAAOA,GAAK,KAAa,MAANA,GASjCwQ,EAAMshH,QAAU,SAAiB9xH,GAC/B,OAAOA,GAAK,KAAOA,GAAK,KAS1BwQ,EAAMqhH,WAAa,SAAoB7xH,GACrC,OAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KA6qCnEwQ,KC9tDL,GAAO,WACP,GAAe,CAAC,QAAS,SAClB2kH,IAAgC,EAAAza,EAAA,IAAQ,GAAM,IAAepiB,IACtE,IAAI,MACFyzB,EAAK,MACLv7G,GACE8nF,EAkCJ,OAAOyzB,EAAM,GAAM,CACjBve,OAAQ,SAAgBnuG,GAEtB,OAAOmR,EAAMnR,GAAMu1B,UAAU+3B,SADjB,KAGd,iBAAkB,SAAsBttD,EAAMu7G,GAC5C,OAAOpqG,EAAMnR,GAAMu1B,UAAU+3B,SAASiuD,IAExC,iBAAkB,SAAqBv7G,GACrC,IAAIu7G,EAAQ,GACZ,OAAO,SAAQv7G,GAAM,SAAU0jE,GAC7B,OAAOvyD,EAAMuyD,GAAOnuC,UAAU+3B,SAASiuD,OAG3C,yBAA0B,SAA2Bv7G,EAAMu7G,GACzD,OAAO,SAAQv7G,GAAM,SAAU0jE,GAC7B,OAAOvyD,EAAMuyD,GAAOnuC,UAAU+3B,SAASiuD,YCrD3C,GAAe,CAAC,SACTwa,IAAiC,EAAA1a,EAAA,IAFjC,OAE+C,IAAepiB,IACvE,IAAI,MACF9nF,GACE8nF,EAaJ,SAAS+8B,EAAKC,GACZ,KAAMhiI,gBAAgB+hI,GACpB,MAAM,IAAIzkD,YAAY,oDAGxB,IAAK0kD,EAAK,MAAM,IAAI71H,MAAM,0BAC1BnM,KAAKgiI,IAAMA,EAiGb,OA1FAD,EAAK/gI,UAAU8W,KAAO,OACtBiqH,EAAK/gI,UAAUihI,QAAS,EAOxBF,EAAK/gI,UAAUyE,SAAW,WACxB,IAAIu8H,EAAMhiI,KAAKgiI,KAAO,GAClB9+H,EAAO,KAkBX,GAhBI8+H,EAAIt8H,OACNxC,GAAQ,SAAW8+H,EAAIt8H,KAAO,QAG5Bs8H,EAAIr0G,WACNzqB,GAAQ,aAAe8+H,EAAIr0G,SAAW,QAGpCq0G,EAAIxoH,cACNtW,GAAQ,qBAAuB8+H,EAAIxoH,YAAc,QAG/CwoH,EAAIhJ,SACN91H,GAAQ,gBAAkB8+H,EAAIhJ,OAAO5nG,KAAK,UAAY,QAGpD4wG,EAAIE,SAAU,CAChBh/H,GAAQ,cAGR,IAFA,IAAIokH,EAAQ,GAEH5oH,EAAI,EAAGA,EAAIsjI,EAAIE,SAASzjI,OAAQC,IAAK,CAC5C,IAAIqN,EAAOi2H,EAAIE,SAASxjI,GACxBwE,GAAQ,OAAS6I,EAAO,KACxB,IAAI0mE,OAAM,EAEV,IAEEA,EAAMv1D,EAAMnR,GAAMu1B,UAAU+3B,SAASiuD,GACrC,MAAOnmH,GACPsxE,EAAMtxE,OAGId,IAARoyE,IAAsB,EAAAq1C,EAAA,IAAOr1C,KAC/BvvE,GAAQ,YAAa,QAAOuvE,EAAK,CAC/BklB,UAAW,KACR,MAITz0F,GAAQ,KAOV,OAJI8+H,EAAIG,SAAWH,EAAIG,QAAQ1jI,SAC7ByE,GAAQ,aAAe8+H,EAAIG,QAAQ/wG,KAAK,MAAQ,MAG3CluB,GAOT6+H,EAAK/gI,UAAUkgG,OAAS,WACtB,IAAIz+F,GAAM,QAAMzC,KAAKgiI,KAErB,OADAv/H,EAAIymH,OAAS,OACNzmH,GASTs/H,EAAK5Y,SAAW,SAAUhiB,GACxB,IAAI66B,EAAM,GAIV,OAHA7/H,OAAOsE,KAAK0gG,GAAM9+F,QAAOgxE,GAAiB,WAATA,IAAmBt8D,SAAQs8D,IAC1D2oD,EAAI3oD,GAAQ8tB,EAAK9tB,MAEZ,IAAI0oD,EAAKC,IAOlBD,EAAK/gI,UAAUC,QAAU8gI,EAAK/gI,UAAUyE,SACjCs8H,IACN,CACDpZ,SAAS,IC3HP,GAAe,CAAC,SACTyZ,IAAmC,EAAAhb,EAAA,IAFnC,SAEiD,IAAepiB,IACzE,IAAI,MACF9nF,GACE8nF,EAkDJ,SAASq9B,IACP,KAAMriI,gBAAgBqiI,GACpB,MAAM,IAAI/kD,YAAY,oDAGxBt9E,KAAKsnH,MAAQ,GA2Ef,OApEA+a,EAAOrhI,UAAU8W,KAAO,SACxBuqH,EAAOrhI,UAAUshI,UAAW,EAQ5BD,EAAOrhI,UAAUq4D,SAAW,SAAUttD,GAEpC,OAAOmR,EAAMnR,GAAMu1B,UAAU+3B,SAASr5D,KAAKsnH,QAU7C+a,EAAOrhI,UAAU6B,IAAM,SAAU6C,GAE/B,OAAOA,KAAQ1F,KAAKsnH,OAAQ,QAAgBtnH,KAAKsnH,MAAO5hH,QAAQrF,GAQlEgiI,EAAOrhI,UAAUuhI,OAAS,WACxB,OAAO,QAAO,GAAIviI,KAAKsnH,QASzB+a,EAAOrhI,UAAUwoE,IAAM,SAAU9jE,EAAMjG,GAErC,OAAO,QAAgBO,KAAKsnH,MAAO5hH,EAAMjG,IAQ3C4iI,EAAOrhI,UAAU0rB,OAAS,SAAUhnB,UAE3B1F,KAAKsnH,MAAM5hH,IAOpB28H,EAAOrhI,UAAUw9B,MAAQ,WACvB,IAAK,IAAIk2F,KAAS10H,KAAKsnH,OACjB,QAAetnH,KAAKsnH,MAAOoN,WACtB10H,KAAKsnH,MAAMoN,IAKjB2N,IACN,CACD1Z,SAAS,IC5IA6Z,GAAS,CAClB98H,KAAM,KACNioB,SAAU,YACVqrG,OAAQ,CAAC,MACTx/G,YAAa,gJACb0oH,SAAU,CAAC,KAAM,aACjBC,QAAS,CAAC,QCNDM,GAAQ,CACjB/8H,KAAM,IACNioB,SAAU,YACVqrG,OAAQ,CAAC,KACTx/G,YAAa,oFACb0oH,SAAU,CAAC,IAAK,QAAS,SAAU,UACnCC,QAAS,CAAC,QCqNDO,GAAe,CAExB3R,UC7NyB,CACzBrrH,KAAM,YACNioB,SAAU,eACVqrG,OAAQ,CAAC,gBACTx/G,YAAa,+CACb0oH,SAAU,CAAC,YAAa,kCAAmC,mBAAoB,uBAAwB,8BACvGC,QAAS,CAAC,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,SDwNzEQ,QE9NuB,CACvBj9H,KAAM,UACNioB,SAAU,eACVqrG,OAAQ,CAAC,IAAK,cACdx/G,YAAa,6CACb0oH,SAAU,CAAC,aAAc,aAAc,aAAc,kBAAmB,mBAAoB,yBAC5FC,QAAS,CAAC,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SFyNzEnR,QG/NuB,CACvBtrH,KAAM,UACNioB,SAAU,eACVqrG,OAAQ,CAAC,YAAa,kBAAmB,mBACzCx/G,YAAa,2BACb0oH,SAAU,CAAC,YAAa,gBAAiB,qBACzCC,QAAS,CAAC,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SH0NzES,WIhO0B,CAC1Bl9H,KAAM,aACNioB,SAAU,eACVqrG,OAAQ,CAAC,0BAA2B,gCACpCx/G,YAAa,iEACb0oH,SAAU,CAAC,oBAAqB,uFAAwF,oCACxHC,QAAS,CAAC,OAAQ,cJ2NlBU,SKjOwB,CACxBn9H,KAAM,WACNioB,SAAU,eACVqrG,OAAQ,CAAC,gBAAiB,qBAC1Bx/G,YAAa,uEACb0oH,SAAU,CAAC,kBAAmB,mCAC9BC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SL4N1Ep6H,MMlOqB,CACrBrC,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,UAAW,cAAe,mBAAoB,yBAA0B,kCAAmC,+CACpHx/G,YAAa,yDACb0oH,SAAU,CAAC,KAAM,YAAa,yBAA0B,UAAW,eAAgB,4BACnFC,QAAS,CAAC,YAAa,UAAW,UAAW,UAAW,SAAU,QAAS,SAAU,SN6NrFxtE,OOnOsB,CACtBjvD,KAAM,SACNioB,SAAU,eACVqrG,OAAQ,CAAC,KAAM,6BAA8B,WAAY,kBAAmB,iBAC5Ex/G,YAAa,mBACb0oH,SAAU,CAAC,KAAM,YAAa,qBAAsB,WAAY,iBAAkB,iCAAkC,4CACpHC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WP8NlFx5H,OQpOsB,CACtBjD,KAAM,SACNioB,SAAU,eACVqrG,OAAQ,CAAC,IAAK,YAAa,+BAC3Bx/G,YAAa,gEACb0oH,SAAU,CAAC,IAAK,MAAO,OAAQ,YAAa,gBAAiB,eAAgB,oCAAqC,6BAClHC,QAAS,CAAC,YAAa,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,SR+NtFlR,OSrOsB,CACtBvrH,KAAM,SACNioB,SAAU,eACVqrG,OAAQ,CAAC,WAAY,qCAAsC,gDAC3Dx/G,YAAa,0BACb0oH,SAAU,CAAC,WAAY,uBAAwB,kCAC/CC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WTgOlFW,UUtOyB,CACzBp9H,KAAM,YACNioB,SAAU,eACVqrG,OAAQ,CAAC,wCACTx/G,YAAa,6EACb0oH,SAAU,CAAC,oCACXC,QAAS,CAAC,OAAQ,eViOlBjoB,OWvOsB,CACtBx0G,KAAM,SACNioB,SAAU,eACVqrG,OAAQ,CAAC,SAAU,aACnBx/G,YAAa,iDACb0oH,SAAU,CAAC,iBAAkB,cAAe,kBAC5CC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SXkO1Ej5H,KYxOoB,CACpBxD,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,aAAc,oBAAqB,gBAC5Cx/G,YAAa,iBACb0oH,SAAU,CAAC,SAAU,SAAU,wBAAyB,kBACxDC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,WZoO1EhhI,EAAGshI,GACHzjD,EAAGyjD,GACH1V,Ma5OqB,CACrBrnH,KAAM,QACNioB,SAAU,YACVqrG,OAAQ,CAAC,SACTx/G,YAAa,sBACb0oH,SAAU,CAAC,SACXC,QAAS,CAAC,SbuOVzjI,Ec7OiB,CACjBgH,KAAM,IACNioB,SAAU,YACVqrG,OAAQ,CAAC,KACTx/G,YAAa,sIACb0oH,SAAU,CAAC,IAAK,QAAS,YACzBC,QAAS,IdwOT9jD,Se9OwB,CACxB34E,KAAM,WACNioB,SAAU,YACVqrG,OAAQ,CAAC,YACTx/G,YAAa,6GACb0oH,SAAU,CAAC,WAAY,SACvBC,QAAS,IfyOTY,IgB/OmB,CACnBr9H,KAAM,MACNioB,SAAU,YACVqrG,OAAQ,CAAC,OACTx/G,YAAa,mEACb0oH,SAAU,CAAC,MAAO,UAClBC,QAAS,IhB0OT1qC,KiBhPoB,CACpB/xF,KAAM,OACNioB,SAAU,YACVqrG,OAAQ,CAAC,QACTx/G,YAAa,oEACb0oH,SAAU,CAAC,OAAQ,WACnBC,QAAS,IjB2OTa,MkBjPqB,CACrBt9H,KAAM,QACNioB,SAAU,YACVqrG,OAAQ,CAAC,SACTx/G,YAAa,kEACb0oH,SAAU,CAAC,QAAS,aACpBC,QAAS,IlB4OTc,OmBlPsB,CACtBv9H,KAAM,SACNioB,SAAU,YACVqrG,OAAQ,CAAC,UACTx/G,YAAa,mEACb0oH,SAAU,CAAC,SAAU,cACrBC,QAAS,InB6OTljD,IoBnPmB,CACnBv5E,KAAM,MACNioB,SAAU,YACVqrG,OAAQ,CAAC,OACTx/G,YAAa,eACb0oH,SAAU,CAAC,MAAO,SAClBC,QAAS,IpB8OT5E,KqBpPoB,CACpB73H,KAAM,OACNioB,SAAU,YACVqrG,OAAQ,CAAC,QACTx/G,YAAa,aACb0oH,SAAU,CAAC,QACXC,QAAS,CAAC,OAAQ,UrB+OlB1+B,GAAI++B,GACJluH,GAAIkuH,GACJlW,IsBvPmB,CACnB5mH,KAAM,MACNioB,SAAU,YACVqrG,OAAQ,CAAC,OACTx/G,YAAa,mOACb0oH,SAAU,CAAC,OACXC,QAAS,ItBkPTe,QuBxPsB,CACtBx9H,KAAM,UACNioB,SAAU,YACVqrG,OAAQ,CAAC,WACTx/G,YAAa,+DACb0oH,SAAU,CAAC,UAAW,aACtBC,QAAS,IvBmPTgB,MwBzPqB,CACrBz9H,KAAM,QACNioB,SAAU,YACVqrG,OAAQ,CAAC,SACTx/G,YAAa,6DACb0oH,SAAU,CAAC,QAAS,WACpBC,QAAS,IxBoPTjW,IyB1PmB,CACnBxmH,KAAM,MACNioB,SAAU,YACVqrG,OAAQ,CAAC,OACTx/G,YAAa,0GACb0oH,SAAU,CAAC,MAAO,UAClBC,QAAS,CAAC,OzBqPVrV,K0B3PoB,CACpBpnH,KAAM,OACNioB,SAAU,YACVqrG,OAAQ,CAAC,QACTx/G,YAAa,qBACb0oH,SAAU,CAAC,QACXC,QAAS,CAAC,U1BsPV7iD,Q2B5PuB,CACvB55E,KAAM,UACNioB,SAAU,YACVqrG,OAAQ,CAAC,WACTx/G,YAAa,8CACb0oH,SAAU,CAAC,WACXC,QAAS,I3ByPTiB,aAAc,CACZ5pH,YAAa,2BACb0oH,SAAU,CAAC,iBAEbmB,oBAAqB,CACnB7pH,YAAa,oCACb0oH,SAAU,CAAC,wBAEboB,eAAgB,CACd9pH,YAAa,kBACb0oH,SAAU,CAAC,mBAEbqB,sBAAuB,CACrB/pH,YAAa,0BACb0oH,SAAU,CAAC,0BAEbsB,iBAAkB,CAChBhqH,YAAa,0CACb0oH,SAAU,CAAC,qBAEbuB,iBAAkB,CAChBjqH,YAAa,0CACb0oH,SAAU,CAAC,qBAEbwB,gBAAiB,CACflqH,YAAa,qCACb0oH,SAAU,CAAC,oBAEbyB,QAAS,CACPnqH,YAAa,qBACb0oH,SAAU,CAAC,YAEb0B,iBAAkB,CAChBpqH,YAAa,oBACb0oH,SAAU,CAAC,qBAEb2B,aAAc,CACZrqH,YAAa,gBACb0oH,SAAU,CAAC,iBAEb4B,mBAAoB,CAClBtqH,YAAa,sBACb0oH,SAAU,CAAC,uBAEb6B,0BAA2B,CACzBvqH,YAAa,8BACb0oH,SAAU,CAAC,8BAGb8B,oBAAqB,CACnBxqH,YAAa,wBACb0oH,SAAU,CAAC,wBAEb+B,gBAAiB,CACfzqH,YAAa,mBACb0oH,SAAU,CAAC,oBAEbgC,SAAU,CACR1qH,YAAa,wBACb0oH,SAAU,CAAC,aAEbiC,WAAY,CACV3qH,YAAa,cACb0oH,SAAU,CAAC,eAEbkC,wBAAyB,CACvB5qH,YAAa,4BACb0oH,SAAU,CAAC,4BAEbmC,aAAc,CACZ7qH,YAAa,gBACb0oH,SAAU,CAAC,iBAEboC,cAAe,CACb9qH,YAAa,0BACb0oH,SAAU,CAAC,kBAEbqC,cAAe,CACb/qH,YAAa,0BACb0oH,SAAU,CAAC,kBAEbsC,cAAe,CACbhrH,YAAa,iBACb0oH,SAAU,CAAC,kBAEbuC,WAAY,CACVjrH,YAAa,cACb0oH,SAAU,CAAC,eAEbwC,aAAc,CACZlrH,YAAa,gBACb0oH,SAAU,CAAC,iBAEbyC,YAAa,CACXnrH,YAAa,eACb0oH,SAAU,CAAC,gBAEb0C,qBAAsB,CACpBprH,YAAa,yBACb0oH,SAAU,CAAC,yBAEb2C,QAAS,CACPrrH,YAAa,mBACb0oH,SAAU,CAAC,YAEb4C,oBAAqB,CACnBtrH,YAAa,wBACb0oH,SAAU,CAAC,wBAEb6C,gBAAiB,CACfvrH,YAAa,oBACb0oH,SAAU,CAAC,oBAEb8C,aAAc,CACZxrH,YAAa,gBACb0oH,SAAU,CAAC,iBAEb+C,WAAY,CACVzrH,YAAa,uBACb0oH,SAAU,CAAC,eAEbgD,SAAU,CACR1rH,YAAa,oBACb0oH,SAAU,CAAC,aAEbiD,UAAW,CACT3rH,YAAa,qBACb0oH,SAAU,CAAC,cAEbkD,QAAS,CACP5rH,YAAa,mBACb0oH,SAAU,CAAC,YAEbmD,eAAgB,CACd7rH,YAAa,2BACb0oH,SAAU,CAAC,mBAEboD,UAAW,CACT9rH,YAAa,qDACb0oH,SAAU,CAAC,cAEbqD,YAAa,CACX/rH,YAAa,eACb0oH,SAAU,CAAC,gBAEbsD,oBAAqB,CACnBhsH,YAAa,wBACb0oH,SAAU,CAAC,wBAEbuD,YAAa,CACXjsH,YAAa,+DACb0oH,SAAU,CAAC,gBAEbwD,cAAe,CACblsH,YAAa,qDACb0oH,SAAU,CAAC,kBAEbyD,gBAAiB,CACfnsH,YAAa,4BACb0oH,SAAU,CAAC,oBAEb0D,gBAAiB,CACfpsH,YAAa,4BACb0oH,SAAU,CAAC,oBAEb2D,iBAAkB,CAChBrsH,YAAa,iCACb0oH,SAAU,CAAC,qBAGb4D,UAAW,CACTtsH,YAAa,sBACb0oH,SAAU,CAAC,cAEb6D,aAAc,CACZvsH,YAAa,mCACb0oH,SAAU,CAAC,iBAEb8D,QAAS,CACPxsH,YAAa,iFACb0oH,SAAU,CAAC,YAEb+D,aAAc,CACZzsH,YAAa,gBACb0oH,SAAU,CAAC,iBAEbgE,WAAY,CACV1sH,YAAa,cACb0oH,SAAU,CAAC,eAEbiE,WAAY,CACV3sH,YAAa,cACb0oH,SAAU,CAAC,eAEbkE,aAAc,CACZ5sH,YAAa,gBACb0oH,SAAU,CAAC,iBAEbmE,kBAAmB,CACjB7sH,YAAa,qBACb0oH,SAAU,CAAC,sBAGboE,W4B1c0B,CAC1B5gI,KAAM,aACNioB,SAAU,UACVqrG,OAAQ,CAAC,6BAA8B,mDACvCx/G,YAAa,4OACb0oH,SAAU,CAAC,0BAA2B,6CAA8C,mCAAoC,6BAA8B,uBAAwB,iBAAkB,wBAAyB,uBACzNC,QAAS,CAAC,WAAY,QAAS,a5Bqc/BoE,O6B3csB,CACtB7gI,KAAM,SACNioB,SAAU,UACVqrG,OAAQ,CAAC,kBACTx/G,YAAa,gIACb0oH,SAAU,CAAC,oBAAqB,cAAe,oBAC/CC,QAAS,CAAC,YAAa,MAAO,UAAW,SAAU,SAAU,W7Bsc7DqE,U8B5cyB,CACzB9gI,KAAM,YACNioB,SAAU,UACVqrG,OAAQ,CAAC,qBACTx/G,YAAa,iIACb0oH,SAAU,CAAC,oBAAqB,cAAe,oBAC/CC,QAAS,CAAC,SAAU,MAAO,UAAW,SAAU,SAAU,W9Buc1DsE,I+B7cmB,CACnB/gI,KAAM,MACNioB,SAAU,UACVqrG,OAAQ,CAAC,UACTx/G,YAAa,sIACb0oH,SAAU,CAAC,wBAAyB,gCAAiC,iCACrEC,QAAS,CAAC,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,O/BwcpEuE,QgC9cuB,CACvBhhI,KAAM,UACNioB,SAAU,UACVqrG,OAAQ,CAAC,kBAAmB,oBAC5Bx/G,YAAa,gGACb0oH,SAAU,CAAC,oBAAqB,cAAe,qBAC/CC,QAAS,CAAC,MAAO,MAAO,SAAU,SAAU,SAAU,WhCyctD/oD,SiC/cwB,CACxB1zE,KAAM,WACNioB,SAAU,UACVqrG,OAAQ,CAAC,iBAAkB,yBAC3Bx/G,YAAa,+BACb0oH,SAAU,CAAC,wBAAyB,qBAAsB,+BAAgC,2BAA4B,+BACtHC,QAAS,CAAC,aAAc,QAAS,ajC0cjCwE,YkChd2B,CAC3BjhI,KAAM,cACNioB,SAAU,UACVqrG,OAAQ,CAAC,oBAAqB,2BAA4B,sCAC1Dx/G,YAAa,mPACb0oH,SAAU,CAAC,gCAAiC,uCAC5CC,QAAS,CAAC,alC2cVyE,ImCjdmB,CACnBlhI,KAAM,MACNioB,SAAU,UACVqrG,OAAQ,CAAC,4BACTx/G,YAAa,wKACb0oH,SAAU,CAAC,2FACXC,QAAS,CAAC,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,OnC4cpE0E,OoCldsB,CACtBnhI,KAAM,SACNioB,SAAU,UACVqrG,OAAQ,CAAC,kBACTx/G,YAAa,gIACb0oH,SAAU,CAAC,oFACXC,QAAS,CAAC,YAAa,MAAO,UAAW,SAAU,SAAU,WpC6c7D2E,UqCndyB,CACzBphI,KAAM,YACNioB,SAAU,UACVqrG,OAAQ,CAAC,kBACTx/G,YAAa,iIACb0oH,SAAU,CAAC,oFACXC,QAAS,CAAC,SAAU,MAAO,UAAW,SAAU,SAAU,WrC8c1D4E,GsCpdkB,CAClBrhI,KAAM,KACNioB,SAAU,UACVqrG,OAAQ,CAAC,SACTx/G,YAAa,uKACb0oH,SAAU,CAAC,4DACXC,QAAS,CAAC,MAAO,MAAO,WtCgdxBn4H,IuCtdmB,CACnBtE,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,UACTx/G,YAAa,8BACb0oH,SAAU,CAAC,WAAY,aACvBC,QAAS,CAAC,SvCidV51H,IwCvdmB,CACnB7G,KAAM,MACNioB,SAAU,YACVqrG,OAAQ,CAAC,QAAS,aAClBx/G,YAAa,kBACb0oH,SAAU,CAAC,gBAAiB,UAAW,SAAU,gBAAiB,eAClEC,QAAS,CAAC,axCkdVjnC,KyCxdoB,CACpBx1F,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,UAAW,qBACpBx/G,YAAa,iQACb0oH,SAAU,CAAC,WAAY,UAAW,WAAY,eAAgB,WAAY,iBAAkB,gBAC5FC,QAAS,CAAC,SAAU,OAAQ,OAAQ,azCmdpC3rG,K0CzdoB,CACpB9wB,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,WACTx/G,YAAa,wHACb0oH,SAAU,CAAC,YAAa,YAAa,cACrCC,QAAS,CAAC,QAAS,MAAO,U1Cod1BrT,K2C1doB,CACpBppH,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,WACTx/G,YAAa,2DACb0oH,SAAU,CAAC,UAAW,MAAO,aAC7BC,QAAS,CAAC,WAAY,SAAU,Q3CqdhC3mC,O4C3dsB,CACtB91F,KAAM,SACNioB,SAAU,YACVqrG,OAAQ,CAAC,QAAS,gBAClBx/G,YAAa,qBACb0oH,SAAU,CAAC,YAAa,QAAS,UAAW,YAAa,cAAe,eACxEC,QAAS,CAAC,a5CsdVvU,U6C5dyB,CACzBloH,KAAM,YACNioB,SAAU,YACVqrG,OAAQ,CAAC,SAAU,mBACnBx/G,YAAa,kCACb0oH,SAAU,CAAC,yBAA0B,yBAA0B,UAC/DC,QAAS,CAAC,WAAY,cAAe,W7CudrCxU,Y8C7d2B,CAC3BjoH,KAAM,cACNioB,SAAU,YACVqrG,OAAQ,CAAC,SAAU,qBACnBx/G,YAAa,oCACb0oH,SAAU,CAAC,yBAA0B,yBAA0B,UAC/DC,QAAS,CAAC,WAAY,SAAU,c9CwdhC5U,O+C9dsB,CACtB7nH,KAAM,SACNioB,SAAU,YACVqrG,OAAQ,CAAC,SAAU,gBACnBx/G,YAAa,+CACb0oH,SAAU,CAAC,yBAA0B,UACrCC,QAAS,CAAC,Q/CydV/4H,IgD/dmB,CACnB1D,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,UACTx/G,YAAa,qCACb0oH,SAAU,CAAC,WAAY,UAAW,gBAAiB,UAAW,uDAC9DC,QAAS,CAAC,OAAQ,QAAS,MAAO,QhD0dlCxS,KiDheoB,CACpBjqH,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,UACTx/G,YAAa,wJACb0oH,SAAU,CAAC,uBACXC,QAAS,CAAC,QjD2dVpkD,MkDjeqB,CACrBr4E,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,YACTx/G,YAAa,mEACb0oH,SAAU,CAAC,WAAY,gBAAiB,qBACxCC,QAAS,CAAC,MAAO,MAAO,QlD4dxBpT,ImDlemB,CACnBrpH,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,UACTx/G,YAAa,sGACb0oH,SAAU,CAAC,WAAY,WAAY,YAAa,aAChDC,QAAS,CAAC,OAAQ,QAAS,UnD6d3Bl6H,MoDneqB,CACrBvC,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,YACTx/G,YAAa,yHACb0oH,SAAU,CAAC,aAAc,aAAc,eACvCC,QAAS,CAAC,OAAQ,MAAO,UpD8dzBl4H,IqDpemB,CACnBvE,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,YAAa,qBACtBx/G,YAAa,uCACb0oH,SAAU,CAAC,aAAc,aAAc,oBACvCC,QAAS,CAAC,MAAO,SrD+djBr+B,MsDreqB,CACrBp+F,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,sBAAuB,yBAChCx/G,YAAa,mDACb0oH,SAAU,CAAC,cAAe,kBAAmB,YAAa,oBAC1DC,QAAS,CAAC,MAAO,StDgejB6E,IuDtemB,CACnBthI,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,aACTx/G,YAAa,qCACb0oH,SAAU,CAAC,YAAa,aAAc,iBACtCC,QAAS,CAAC,QvDieVl3H,IwDvemB,CACnBvF,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,SAAU,gBACnBx/G,YAAa,8NACb0oH,SAAU,CAAC,WAAY,eAAgB,SAAU,SAAU,iBAAkB,uBAAwB,mBAAoB,SACzHC,QAAS,CAAC,MAAO,QAAS,OAAQ,UxDkelCn6E,KyDxeoB,CACpBtiD,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,WACTx/G,YAAa,gFACb0oH,SAAU,CAAC,gBAAiB,WAAY,qBAAsB,aAC9DC,QAAS,CAAC,MAAO,QAAS,MAAO,UzDmejCnT,M0DzeqB,CACrBtpH,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,WAAY,kBACrBx/G,YAAa,yCACb0oH,SAAU,CAAC,aAAc,kBAAmB,aAAc,kBAAmB,yBAC7EC,QAAS,CAAC,MAAO,MAAO,OAAQ,U1DoehCn+B,M2D1eqB,CACrBt+F,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,YACTx/G,YAAa,4CACb0oH,SAAU,CAAC,iBAAkB,eAAgB,SAAU,uBAAwB,kBAC/EC,QAAS,CAAC,MAAO,Q3DqejBrjC,I4D3emB,CACnBp5F,KAAM,MACNioB,SAAU,YACVqrG,OAAQ,CAAC,QAAS,UAAW,aAC7Bx/G,YAAa,gEACb0oH,SAAU,CAAC,QAAS,SAAU,WAAY,mBAAoB,WAAY,YAC1EC,QAAS,CAAC,W5DseV39G,S6D5ewB,CACxB9e,KAAM,WACNioB,SAAU,YACVqrG,OAAQ,CAAC,QAAS,kBAClBx/G,YAAa,uBACb0oH,SAAU,CAAC,gBAAiB,UAAW,YAAa,cAAe,cACnEC,QAAS,CAAC,W7DueVlT,K8D7eoB,CACpBvpH,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,UAAW,cACpBx/G,YAAa,oDACb0oH,SAAU,CAAC,YAAa,aAAc,eAAgB,6BAA8B,8BAA+B,kBAAmB,4BAA6B,gCAAiC,kC9DyepMhT,Q+D9euB,CACvBxpH,KAAM,UACNioB,SAAU,aACVqrG,OAAQ,CAAC,aAAc,oBACvBx/G,YAAa,qJACb0oH,SAAU,CAAC,QAAS,iBAAkB,gBAAiB,WACvDC,QAAS,CAAC,WAAY,MAAO,S/Dye7BhT,SgE/ewB,CACxBzpH,KAAM,WACNioB,SAAU,aACVqrG,OAAQ,CAAC,cAAe,qBACxBx/G,YAAa,2LACb0oH,SAAU,CAAC,cAAe,kBAC1BC,QAAS,CAAC,OAAQ,MAAO,YhE0ezBx6H,IiEhfmB,CACnBjC,KAAM,MACNioB,SAAU,YACVqrG,OAAQ,CAAC,QAAS,aAClBx/G,YAAa,uCACb0oH,SAAU,CAAC,MAAO,QAAS,oBAC3BC,QAAS,CAAC,WAAY,UAAW,WAAY,SjE2e7Cn5H,MkEjfqB,CACrBtD,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,WAAY,eACrBx/G,YAAa,4LACb0oH,SAAU,CAAC,aAAc,aAAc,cAAe,cAAe,eAAgB,uBACrFC,QAAS,CAAC,OAAQ,QAAS,QlE4e3B9/B,KmElfoB,CACpB38F,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,WACTx/G,YAAa,iGACb0oH,SAAU,CAAC,YAAa,aAAc,WACtCC,QAAS,CAAC,QnE6eVl8H,KoEnfoB,CACpBP,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,WACTx/G,YAAa,+EACb0oH,SAAU,CAAC,WAAY,QAAS,YAChCC,QAAS,CAAC,SAAU,QAAS,WAAY,UAAW,WAAY,QpE8ehEtS,MqEpfqB,CACrBnqH,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,YACTx/G,YAAa,+IACb0oH,SAAU,CAAC,2BACXC,QAAS,CAAC,OAAQ,MAAO,SAAU,arE+enC/S,OsErfsB,CACtB1pH,KAAM,SACNioB,SAAU,aACVqrG,OAAQ,CAAC,aACTx/G,YAAa,2DACb0oH,SAAU,CAAC,YAAa,UAAW,MAAO,SAC1CC,QAAS,CAAC,WAAY,MAAO,OAAQ,StEgfrC5gC,SuEtfwB,CACxB77F,KAAM,WACNioB,SAAU,YACVqrG,OAAQ,CAAC,QAAS,kBAClBx/G,YAAa,uBACb0oH,SAAU,CAAC,cAAe,QAAS,YAAa,YAAa,iBAC7DC,QAAS,CAAC,QvEifV1U,WwEvf0B,CAC1B/nH,KAAM,aACNioB,SAAU,YACVqrG,OAAQ,CAAC,KAAM,iBACfx/G,YAAa,yEACb0oH,SAAU,CAAC,OAAQ,UAAW,SAC9BC,QAAS,CAAC,MAAO,WAAY,cxEkf7B3U,UyExfyB,CACzB9nH,KAAM,YACNioB,SAAU,YACVqrG,OAAQ,CAAC,KAAM,gBACfx/G,YAAa,4CACb0oH,SAAU,CAAC,QAAS,QACpBC,QAAS,CAAC,MAAO,WAAY,ezEmf7B8E,K0EzfoB,CACpBvhI,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,cACTx/G,YAAa,iLACb0oH,SAAU,CAAC,cAAe,aAAc,sBACxCC,QAAS,CAAC,MAAO,Q1EqfjB5T,O2E3fsB,CACtB7oH,KAAM,SACNioB,SAAU,UACVqrG,OAAQ,CAAC,QAAS,gBAClBx/G,YAAa,6QACb0oH,SAAU,CAAC,QAAS,kBAAmB,oBACvCC,QAAS,CAAC,SAAU,QAAS,SAAU,YAAa,kBAAmB,kB3EsfvEzU,O4E5fsB,CACtBhoH,KAAM,SACNioB,SAAU,UACVqrG,OAAQ,CAAC,KAAM,aACfx/G,YAAa,8IACb0oH,SAAU,CAAC,KAAM,KAAM,sBACvBC,QAAS,CAAC,SAAU,QAAS,SAAU,YAAa,kBAAmB,kB5EufvE1T,M6E7fqB,CACrB/oH,KAAM,QACNioB,SAAU,UACVqrG,OAAQ,CAAC,QAAS,eAClBx/G,YAAa,8PACb0oH,SAAU,CAAC,QAAS,uBACpBC,QAAS,CAAC,SAAU,SAAU,SAAU,YAAa,kBAAmB,kB7EwfxE3T,O8E9fsB,CACtB9oH,KAAM,SACNioB,SAAU,UACVqrG,OAAQ,CAAC,gBACTx/G,YAAa,mRACb0oH,SAAU,CAAC,cAAe,wBAC1BC,QAAS,CAAC,SAAU,SAAU,QAAS,YAAa,kBAAmB,kB9EyfvErU,U+E/fyB,CACzBpoH,KAAM,YACNioB,SAAU,UACVqrG,OAAQ,CAAC,SAAU,mBACnBx/G,YAAa,+DACb0oH,SAAU,CAAC,SAAU,UACrBC,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,kBAAmB,kB/E0fpEpU,gBgFhgB+B,CAC/BroH,KAAM,kBACNioB,SAAU,UACVqrG,OAAQ,CAAC,SAAU,yBACnBx/G,YAAa,mEACb0oH,SAAU,CAAC,SAAU,SAAU,YAC/BC,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,YAAa,kBhF2f9DnU,ciFjgB6B,CAC7BtoH,KAAM,gBACNioB,SAAU,UACVqrG,OAAQ,CAAC,UAAW,uBACpBx/G,YAAa,gEACb0oH,SAAU,CAAC,UAAW,SAAU,aAChCC,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,YAAa,oBjF6f9D9S,YkFngB2B,CAC3B3pH,KAAM,cACNioB,SAAU,gBACVqrG,OAAQ,CAAC,kBACTx/G,YAAa,2NACb0oH,SAAU,CAAC,iBAAkB,kBAC7BC,QAAS,CAAC,elF8fV7S,QmFpgBuB,CACvB5pH,KAAM,UACNioB,SAAU,gBACVqrG,OAAQ,CAAC,cACTx/G,YAAa,0KACb0oH,SAAU,CAAC,aAAc,cACzBC,QAAS,CAAC,gBnF+fV+E,YoFrgB2B,CAC3BxhI,KAAM,cACNioB,SAAU,gBACVqrG,OAAQ,CAAC,qBACTx/G,YAAa,wIACb0oH,SAAU,CAAC,qBACXC,QAAS,CAAC,iBpFggBV5S,WqFtgB0B,CAC1B7pH,KAAM,aACNioB,SAAU,gBACVqrG,OAAQ,CAAC,oBACTx/G,YAAa,kRACb0oH,SAAU,CAAC,oBACXC,QAAS,CAAC,gBrFkgBVv5G,OsFxgBsB,CACtBljB,KAAM,SACNioB,SAAU,OACVqrG,OAAQ,CAAC,WAAY,mBACrBx/G,YAAa,6CACb0oH,SAAU,CAAC,WAAY,YAAa,+BAAgC,aACpEC,QAAS,ItFmgBTgF,OuFzgBsB,CACtBzhI,KAAM,SACNioB,SAAU,OACVqrG,OAAQ,CAAC,oBAAqB,8BAC9Bx/G,YAAa,gDACb0oH,SAAU,CAAC,4CAA6C,UAAW,cACnEC,QAAS,IvFogBT1J,MwF1gBqB,CACrB/yH,KAAM,QACNioB,SAAU,OACVqrG,OAAQ,CAAC,oBAAqB,2BAC9Bx/G,YAAa,2BACb0oH,SAAU,CAAC,iDAAkD,YAAa,mBAC1EC,QAAS,IxFsgBT5iI,IyF5gBmB,CACnBmG,KAAM,MACNioB,SAAU,UACVqrG,OAAQ,CAAC,UACTx/G,YAAa,iGACb0oH,SAAU,CAAC,cAAe,cAAe,eACzCC,QAAS,CAAC,KAAM,KAAM,OAAQ,QzFugB9B3S,K0F7gBoB,CACpB9pH,KAAM,OACNioB,SAAU,UACVqrG,OAAQ,CAAC,WACTx/G,YAAa,gGACb0oH,SAAU,CAAC,eAAgB,eAAgB,eAC3CC,QAAS,CAAC,KAAM,KAAM,MAAO,Q1FwgB7BpoG,G2F9gBkB,CAClBr0B,KAAM,KACNioB,SAAU,UACVqrG,OAAQ,CAAC,SACTx/G,YAAa,yCACb0oH,SAAU,CAAC,aAAc,aAAc,YAAa,WACpDC,QAAS,CAAC,KAAM,OAAQ,MAAO,Q3FygB/BrkD,G4F/gBkB,CAClBp4E,KAAM,KACNioB,SAAU,UACVqrG,OAAQ,CAAC,SACTx/G,YAAa,8CACb0oH,SAAU,CAAC,aAAc,aAAc,YAAa,WACpDC,QAAS,CAAC,KAAM,OAAQ,MAAO,Q5F2gB/B9oE,S6FjhBwB,CACxB3zD,KAAM,WACNioB,SAAU,aACVqrG,OAAQ,CAAC,uBAAwB,wCACjCx/G,YAAa,uDACb0oH,SAAU,CAAC,oBAAqB,+BAChCC,QAAS,I7F4gBTiF,K8FlhBoB,CACpB1hI,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,eAAgB,gBACzBx/G,YAAa,oDACb0oH,SAAU,CAAC,aAAc,mBACzBC,QAAS,I9F8gBTl6B,S+FphBwB,CACxBviG,KAAM,WACNioB,SAAU,WACVqrG,OAAQ,CAAC,+BAAgC,kCACzCx/G,YAAa,wDACb0oH,SAAU,CAAC,yBAA0B,4BACrCC,QAAS,I/F+gBT7mH,UgGrhByB,CACzB5V,KAAM,YACNioB,SAAU,WACVqrG,OAAQ,CAAC,wCAAyC,kCAClDx/G,YAAa,0DACb0oH,SAAU,CAAC,gDAAiD,mDAC5DC,QAAS,IhGihBTzT,IiGvhBmB,CACnBhpH,KAAM,MACNioB,SAAU,UACVqrG,OAAQ,CAAC,UAAW,aACpBx/G,YAAa,uFACb0oH,SAAU,CAAC,iBAAkB,gBAAiB,WAC9CC,QAAS,CAAC,MAAO,KAAM,QjGkhBvBx/F,IkGxhBmB,CACnBj9B,KAAM,MACNioB,SAAU,UACVqrG,OAAQ,CAAC,QAAS,UAClBx/G,YAAa,0DACb0oH,SAAU,CAAC,WAAY,YAAa,QAAS,SAC7CC,QAAS,CAAC,MAAO,KAAM,QlGmhBvBvT,GmGzhBkB,CAClBlpH,KAAM,KACNioB,SAAU,UACVqrG,OAAQ,CAAC,SAAU,YACnBx/G,YAAa,mFACb0oH,SAAU,CAAC,gBAAiB,iBAAkB,UAC9CC,QAAS,CAAC,MAAO,MAAO,QnGohBxBxT,IoG1hBmB,CACnBjpH,KAAM,MACNioB,SAAU,UACVqrG,OAAQ,CAAC,UAAW,aACpBx/G,YAAa,2GACb0oH,SAAU,CAAC,iBAAkB,kBAAmB,gBAAiB,WACjEC,QAAS,CAAC,MAAO,MAAO,OpGshBxBz2H,OqG5hBsB,CACtBhG,KAAM,SACNioB,SAAU,SACVqrG,OAAQ,CAAC,uBAAwB,6BACjCx/G,YAAa,iKACb0oH,SAAU,CAAC,mBAAoB,mBAAoB,eAAgB,kBAAmB,mBACtFC,QAAS,CAAC,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UrGuhBhHvoD,MsG7hBqB,CACrBl0E,KAAM,QACNioB,SAAU,SACVqrG,OAAQ,CAAC,YACTx/G,YAAa,6DACb0oH,SAAU,CAAC,yBAA0B,WAAY,UAAW,wBAC5DC,QAAS,CAAC,StGwhBV1S,MuG9hBqB,CACrB/pH,KAAM,QACNioB,SAAU,SACVqrG,OAAQ,CAAC,eACTx/G,YAAa,0EACb0oH,SAAU,CAAC,+BAAgC,+BAAgC,gCAC3EC,QAAS,CAAC,WAAY,QvGyhBtB5vF,OwG/hBsB,CACtB7sC,KAAM,SACNioB,SAAU,SACVqrG,OAAQ,CAAC,oBACTx/G,YAAa,0CACb0oH,SAAU,CAAC,uBAAwB,eAAgB,gBACnDC,QAAS,CAAC,QxG0hBV9U,WyGhiB0B,CAC1B3nH,KAAM,aACNioB,SAAU,SACVqrG,OAAQ,CAAC,KAAO,iBAChBx/G,YAAa,2CACb0oH,SAAU,CAAC,yBAA0B,KAAO,iBAC5CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,UzG2hB7GzS,I0GjiBmB,CACnBhqH,KAAM,MACNioB,SAAU,SACVqrG,OAAQ,CAAC,UACTx/G,YAAa,wCACb0oH,SAAU,CAAC,oBAAqB,uCAChCC,QAAS,CAAC,SAAU,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U1G4hBnHkF,K2GliBoB,CACpB3hI,KAAM,OACNioB,SAAU,SACVqrG,OAAQ,CAAC,UAAW,cACpBx/G,YAAa,4aACb0oH,SAAU,CAAC,YAAa,eAAgB,kCAAmC,WAC3EC,QAAS,CAAC,SAAU,MAAO,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U3G6hBlHl9G,K4GniBoB,CACpBvf,KAAM,OACNioB,SAAU,SACVqrG,OAAQ,CAAC,YAAa,kBACtBx/G,YAAa,CAAC,kFAAmF,2GAA4G,mEAAoE,oEAAqE,0DAA6D,+HACnZ0oH,SAAU,CAAC,wBAAyB,2BAA4B,gCAAiC,yBAA0B,4BAA6B,4BAA6B,uCAAwC,oCAAqC,qCAClQC,QAAS,CAAC,WAAY,oB5G8hBtBx6E,I6GpiBmB,CACnBjiD,KAAM,MACNioB,SAAU,SACVqrG,OAAQ,CAAC,YAAa,SACtBx/G,YAAa,6LACb0oH,SAAU,CAAC,4BAA6B,yBACxCC,QAAS,CAAC,WAAY,U7G+hBtBmF,kB8GriBiC,CACjC5hI,KAAM,oBACNioB,SAAU,SACVqrG,OAAQ,CAAC,wBACTx/G,YAAa,iOACb0oH,SAAU,CAAC,+BAAgC,wCAAyC,iCAAkC,wCACtHC,QAAS,CAAC,SAAU,SAAU,W9GgiB9B9qB,S+GtiBwB,CACxB3xG,KAAM,WACNioB,SAAU,SACVqrG,OAAQ,CAAC,cAAe,iBAAkB,oBAC1Cx/G,YAAa,yGACb0oH,SAAU,CAAC,cAAe,iBAAkB,yBAA0B,qBACtEC,QAAS,CAAC,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U/GiiB9G95H,OgHviBsB,CACtB3C,KAAM,SACNioB,SAAU,SACVqrG,OAAQ,CAAC,mBACTx/G,YAAa,4BACb0oH,SAAU,CAAC,wBAAyB,wCAAyC,oCAC7EC,QAAS,CAAC,OAAQ,MAAO,YhHkiBzB1+C,QiHxiBuB,CACvB/9E,KAAM,UACNioB,SAAU,SACVqrG,OAAQ,CAAC,cACTx/G,YAAa,uEACb0oH,SAAU,CAAC,yBAA0B,UAAW,iBAAkB,WAClEC,QAAS,CAAC,SAAU,SAAU,OAAQ,YjHmiBtCplH,QkHziBuB,CACvBrX,KAAM,UACNioB,SAAU,SACVqrG,OAAQ,CAAC,wBACTx/G,YAAa,0FACb0oH,SAAU,CAAC,0DACXC,QAAS,CAAC,MAAO,OAAQ,WlHoiBzBvS,ImH1iBmB,CACnBlqH,KAAM,MACNioB,SAAU,SACVqrG,OAAQ,CAAC,UACTx/G,YAAa,oCACb0oH,SAAU,CAAC,oBAAqB,SAAU,SAC1CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UnHqiBnHoF,KoH3iBoB,CACpB7hI,KAAM,OACNioB,SAAU,SACVqrG,OAAQ,CAAC,WACTx/G,YAAa,wEACb0oH,SAAU,CAAC,8BACXC,QAAS,CAAC,QpHsiBVqF,KqH5iBoB,CACpB9hI,KAAM,OACNioB,SAAU,SACVqrG,OAAQ,CAAC,cACTx/G,YAAa,6DACb0oH,SAAU,CAAC,2CAA4C,wBACvDC,QAAS,CAAC,WAAY,MAAO,UrHuiB7B76H,IsH7iBmB,CACnB5B,KAAM,MACNioB,SAAU,SACVqrG,OAAQ,CAAC,oBACTx/G,YAAa,qHACb0oH,SAAU,CAAC,0BACXC,QAAS,CAAC,SAAU,YtHwiBpBsF,KuH9iBoB,CACpB/hI,KAAM,OACNioB,SAAU,SACVqrG,OAAQ,CAAC,UAAW,aAAc,qBAAsB,YAAa,eAAgB,wBACrFx/G,YAAa,mCACb0oH,SAAU,CAAC,UAAW,aAAc,oBAAqB,yBAA0B,iBACnFC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UvHyiBlHuF,gBwH/iB+B,CAC/BhiI,KAAM,kBACNioB,SAAU,SACVqrG,OAAQ,CAAC,wBAAyB,kCAClCx/G,YAAa,uIACb0oH,SAAU,CAAC,iCAAkC,4CAC7CC,QAAS,CAAC,SxH0iBV/oG,MyHhjBqB,CACrB1zB,KAAM,QACNioB,SAAU,OACVqrG,OAAQ,CAAC,YAAa,iBAAkB,oBAAqB,0BAA2B,iBACxFx/G,YAAa,iFACb0oH,SAAU,CAAC,MAAO,UAAW,cAAe,kBAAmB,gBAAiB,+BAAgC,eAChHC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,OAAQ,UAAW,SAAU,QAAS,YAAa,UzH2iBjH/kH,O0HjjBsB,CACtB1X,KAAM,SACNioB,SAAU,SACVqrG,OAAQ,CAAC,kBAAmB,iCAC5Bx/G,YAAa,mBACb0oH,SAAU,CAAC,2BAA4B,uBAAwB,2BAA4B,oBAAqB,6BAChHC,QAAS,CAAC,OAAQ,SAAU,UAAW,Y1H4iBvCwF,Q2HljBuB,CACvBjiI,KAAM,UACNioB,SAAU,SACVqrG,OAAQ,CAAC,qBACTx/G,YAAa,qEACb0oH,SAAU,CAAC,sCAAuC,oCAAqC,kCACvFC,QAAS,CAAC,OAAQ,UAAW,W3H6iB7Bh+G,O4HnjBsB,CACtBze,KAAM,SACNioB,SAAU,SACVqrG,OAAQ,CAAC,mBAAoB,uBAC7Bx/G,YAAa,2JACb0oH,SAAU,CAAC,8BAA+B,wCAAyC,8CAA+C,+DAClIC,QAAS,CAAC,SAAU,mB5H8iBpByF,e6HpjB8B,CAC9BliI,KAAM,iBACNioB,SAAU,SACVqrG,OAAQ,CAAC,wBAAyB,2BAA4B,oCAC9Dx/G,YAAa,2JACb0oH,SAAU,CAAC,yBAA0B,2CAA4C,kDACjFC,QAAS,CAAC,MAAO,Q7H+iBjBx4F,I8HrjBmB,CACnBjkC,KAAM,MACNioB,SAAU,SACVqrG,OAAQ,CAAC,iBACTx/G,YAAa,uCACb0oH,SAAU,CAAC,uBAAwB,YAAa,aAChDC,QAAS,CAAC,W9HgjBV9uH,K+HtjBoB,CACpB3N,KAAM,OACNioB,SAAU,SACVqrG,OAAQ,CAAC,WACTx/G,YAAa,kCACb0oH,SAAU,CAAC,YAAa,sBAAuB,yBAA0B,UAAW,aACpFC,QAAS,CAAC,SAAU,QAAS,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,UAAW,SAAU,QAAS,YAAa,U/HijB3Hr6H,KgIvjBoB,CACpBpC,KAAM,OACNioB,SAAU,SACVqrG,OAAQ,CAAC,UAAW,oBACpBx/G,YAAa,2GACb0oH,SAAU,CAAC,mBAAoB,6BAA8B,+CAAgD,iDAAkD,qCAC/JC,QAAS,CAAC,MAAO,SAAU,YhIkjB3B0F,QiIxjBuB,CACvBniI,KAAM,UACNioB,SAAU,SACVqrG,OAAQ,CAAC,cACTx/G,YAAa,6DACb0oH,SAAU,CAAC,mBAAoB,mBAAoB,mBAAoB,oBACvEC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,SAAU,QAAS,YAAa,UjImjB/G9zD,OkIzjBsB,CACtB3oE,KAAM,SACNioB,SAAU,SACVqrG,OAAQ,CAAC,eAAgB,6BAA8B,yBAA0B,uCACjFx/G,YAAa,8HACb0oH,SAAU,CAAC,mBAAoB,SAAU,qBAAsB,mBAAoB,YAAa,UAAW,WAC3GC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,QAAS,YAAa,UlIojBhHn2H,MmI1jBqB,CACrBtG,KAAM,QACNioB,SAAU,SACVqrG,OAAQ,CAAC,YACTx/G,YAAa,oGACb0oH,SAAU,CAAC,mCAAoC,YAC/CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,YAAa,UnIqjBjH/U,UoI3jByB,CACzB1nH,KAAM,YACNioB,SAAU,SACVqrG,OAAQ,CAAC,KAAO,gBAChBx/G,YAAa,qBACb0oH,SAAU,CAAC,yBAA0B,KAAO,gBAC5CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,UpIsjB7G2F,MqI5jBqB,CACrBpiI,KAAM,QACNioB,SAAU,SACVqrG,OAAQ,CAAC,WAAY,cAAe,sBAAuB,aAAc,gBAAiB,yBAC1Fx/G,YAAa,oCACb0oH,SAAU,CAAC,WAAY,cAAe,yBAA0B,kBAChEC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,crIwjB7GrS,asI9jB4B,CAC5BpqH,KAAM,eACNioB,SAAU,cACVqrG,OAAQ,CAAC,sBACTx/G,YAAa,kEACb0oH,SAAU,CAAC,sBACXC,QAAS,CAAC,sBAAuB,eAAgB,ctIyjBjDpS,oBuI/jBmC,CACnCrqH,KAAM,sBACNioB,SAAU,cACVqrG,OAAQ,CAAC,6BACTx/G,YAAa,qFACb0oH,SAAU,CAAC,6BACXC,QAAS,CAAC,eAAgB,eAAgB,cvI2jB1C7U,UwIjkByB,CACzB5nH,KAAM,YACNioB,SAAU,cACVqrG,OAAQ,CAAC,KAAM,gBACfx/G,YAAa,mCACb0oH,SAAU,CAAC,KAAM,oBAAqB,MACtCC,QAAS,CAAC,eAAgB,sBAAuB,eAAgB,UxI4jBjElY,MyIlkBqB,CACrBvkH,KAAM,QACNioB,SAAU,cACVqrG,OAAQ,CAAC,YACTx/G,YAAa,6IACb0oH,SAAU,CAAC,WAAY,KAAM,aAAc,YAC3CC,QAAS,CAAC,czI6jBV4F,a0InkB4B,CAC5BriI,KAAM,eACNioB,SAAU,cACVqrG,OAAQ,CAAC,sBACTx/G,YAAa,6EACb0oH,SAAU,CAAC,8CACXC,QAAS,I1I8jBT6F,Y2IpkB2B,CAC3BtiI,KAAM,cACNioB,SAAU,cACVqrG,OAAQ,CAAC,kBACTx/G,YAAa,4OACb0oH,SAAU,CAAC,0BACXC,QAAS,CAAC,eAAgB,c3I+jB1B8F,a4IrkB4B,CAC5BviI,KAAM,eACNioB,SAAU,cACVqrG,OAAQ,CAAC,kBAAmB,sBAC5Bx/G,YAAa,kEACb0oH,SAAU,CAAC,kBAAmB,sBAC9BC,QAAS,CAAC,eAAgB,sBAAuB,c5IgkBjD+F,W6ItkB0B,CAC1BxiI,KAAM,aACNioB,SAAU,cACVqrG,OAAQ,CAAC,oBAAqB,4BAA6B,6BAA8B,qCAAsC,sCAC/Hx/G,YAAa,0CACb0oH,SAAU,CAAC,mBAAoB,2BAA4B,8BAA+B,yCAA0C,4CAA6C,6CACjLC,QAAS,CAAC,SAAU,c7IikBpBpjG,O8IvkBsB,CACtBr5B,KAAM,SACNioB,SAAU,cACVqrG,OAAQ,CAAC,WAAY,cAAe,mBAAoB,eAAgB,oBAAqB,0BAC7Fx/G,YAAa,0BACb0oH,SAAU,CAAC,WAAY,iBAAkB,kBACzCC,QAAS,CAAC,aAAc,c9IkkBxBgG,U+IxkByB,CACzBziI,KAAM,YACNioB,SAAU,cACVqrG,OAAQ,CAAC,iBAAkB,sBAAuB,kBAAmB,uBAAwB,6BAC7Fx/G,YAAa,iCACb0oH,SAAU,CAAC,oBAAqB,yBAChCC,QAAS,CAAC,aAAc,W/IokBxB/gC,QgJ1kBuB,CACvB17F,KAAM,UACNioB,SAAU,aACVqrG,OAAQ,CAAC,iBACTx/G,YAAa,8EACb0oH,SAAU,CAAC,gBAAiB,gBAAiB,gBAAiB,qBAAsB,yBACpFC,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,iBAAkB,gBhJqkBpFiG,eiJ3kB8B,CAC9B1iI,KAAM,iBACNioB,SAAU,aACVqrG,OAAQ,CAAC,wBACTx/G,YAAa,0HACb0oH,SAAU,CAAC,uBAAwB,uBAAwB,uBAAwB,4BAA6B,4BAA6B,iCAAkC,uCAAwC,oCAAqC,iCAAkC,kCAC9RC,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,UAAW,gBjJskB7EkG,YkJ5kB2B,CAC3B3iI,KAAM,cACNioB,SAAU,aACVqrG,OAAQ,CAAC,qBACTx/G,YAAa,uHACb0oH,SAAU,CAAC,wBAAyB,wBAAyB,wBAAyB,yBAA0B,qBAAsB,iBAAkB,4BAA6B,qCACrLC,QAAS,CAAC,UAAW,mBlJukBrBmG,UmJ7kByB,CACzB5iI,KAAM,YACNioB,SAAU,aACVqrG,OAAQ,CAAC,mBACTx/G,YAAa,+IACb0oH,SAAU,CAAC,8BAA+B,6BAC1CC,QAAS,CAAC,QAAS,UAAW,UAAW,SAAU,YAAa,WAAY,YnJwkB5ElU,MoJ9kBqB,CACrBvoH,KAAM,QACNioB,SAAU,aACVqrG,OAAQ,CAAC,SAAU,eACnBx/G,YAAa,wFACb0oH,SAAU,CAAC,WAAY,WAAY,UAAW,YAAa,SAAU,gBACrEC,QAAS,CAAC,UAAW,UAAW,SAAU,YAAa,WAAY,UAAW,YAAa,cpJykB3FoG,UqJ/kByB,CACzB7iI,KAAM,YACNioB,SAAU,aACVqrG,OAAQ,CAAC,mBACTx/G,YAAa,uHACb0oH,SAAU,CAAC,8BAA+B,sBAAuB,uBAAwB,2BAA4B,mCACrHC,QAAS,CAAC,UAAW,iBAAkB,cAAe,UrJ0kBtD/T,OsJhlBsB,CACtB1oH,KAAM,SACNioB,SAAU,aACVqrG,OAAQ,CAAC,QAAS,gBAClBx/G,YAAa,2FACb0oH,SAAU,CAAC,QAAS,UAAW,UAAW,YAAa,UAAW,UAAW,iBAC7EC,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,YtJ2kBlE7T,SuJjlBwB,CACxB5oH,KAAM,WACNioB,SAAU,aACVqrG,OAAQ,CAAC,SAAU,kBACnBx/G,YAAa,yGACb0oH,SAAU,CAAC,WAAY,UAAW,UAAW,YAAa,YAC1DC,QAAS,CAAC,QAAS,UAAW,YAAa,UAAW,YvJ4kBtDhU,QwJllBuB,CACvBzoH,KAAM,UACNioB,SAAU,aACVqrG,OAAQ,CAAC,QAAS,iBAClBx/G,YAAa,mGACb0oH,SAAU,CAAC,QAAS,UAAW,UAAW,YAAa,UAAW,iBAClEC,QAAS,CAAC,QAAS,UAAW,SAAU,YAAa,WAAY,YxJ6kBjE9T,UyJnlByB,CACzB3oH,KAAM,YACNioB,SAAU,aACVqrG,OAAQ,CAAC,SAAU,mBACnBx/G,YAAa,0GACb0oH,SAAU,CAAC,WAAY,UAAW,UAAW,YAAa,YAC1DC,QAAS,CAAC,QAAS,UAAW,SAAU,UAAW,WAAY,YzJ8kB/DjU,Q0JplBuB,CACvBxoH,KAAM,UACNioB,SAAU,aACVqrG,OAAQ,CAAC,SAAU,iBACnBx/G,YAAa,uGACb0oH,SAAU,CAAC,WAAY,WAAY,UAAW,YAAa,SAAU,eAAgB,kBACrFC,QAAS,CAAC,QAAS,UAAW,SAAU,YAAa,WAAY,UAAW,c1JglB5EqG,a2JtlB4B,CAC5B9iI,KAAM,eACNioB,SAAU,MACVqrG,OAAQ,CAAC,4BACTx/G,YAAa,6IACb0oH,SAAU,CAAC,gCACXC,QAAS,CAAC,WAAY,eAAgB,gBAAiB,gB3JilBvDsG,c4JvlB6B,CAC7B/iI,KAAM,gBACNioB,SAAU,MACVqrG,OAAQ,CAAC,6BACTx/G,YAAa,8LACb0oH,SAAU,CAAC,4CAA6C,qDACxDC,QAAS,CAAC,WAAY,eAAgB,qB5JklBtCuG,Y6JxlB2B,CAC3BhjI,KAAM,cACNioB,SAAU,MACVqrG,OAAQ,CAAC,oBACTx/G,YAAa,2IACb0oH,SAAU,CAAC,mCACXC,QAAS,CAAC,oB7JmlBVwG,a8JzlB4B,CAC5BjjI,KAAM,eACNioB,SAAU,MACVqrG,OAAQ,CAAC,4BACTx/G,YAAa,wIACb0oH,SAAU,CAAC,2CAA4C,oDACvDC,QAAS,CAAC,WAAY,kB9JolBtByG,Y+J1lB2B,CAC3BljI,KAAM,cACNioB,SAAU,MACVqrG,OAAQ,CAAC,2BACTx/G,YAAa,wMACb0oH,SAAU,CAAC,oCAAqC,qCAChDC,QAAS,CAAC,WAAY,eAAgB,kB/JqlBtC0G,gBgK3lB+B,CAC/BnjI,KAAM,kBACNioB,SAAU,MACVqrG,OAAQ,CAAC,iCACTx/G,YAAa,kJACb0oH,SAAU,CAAC,mCAAoC,oCAC/CC,QAAS,CAAC,cAAe,YhKslBzB2G,YiK5lB2B,CAC3BpjI,KAAM,cACNioB,SAAU,MACVqrG,OAAQ,CAAC,oBACTx/G,YAAa,gMACb0oH,SAAU,CAAC,0BACXC,QAAS,CAAC,iBjKulBV4G,QkK7lBuB,CACvBrjI,KAAM,UACNioB,SAAU,MACVqrG,OAAQ,CAAC,eAAgB,wBACzBx/G,YAAa,sNACb0oH,SAAU,CAAC,wBAAyB,+BACpCC,QAAS,CAAC,WAAY,eAAgB,kBlKwlBtC6G,iBmK9lBgC,CAChCtjI,KAAM,mBACNioB,SAAU,MACVqrG,OAAQ,CAAC,gCACTx/G,YAAa,gJACb0oH,SAAU,CAAC,+CAAgD,wDAC3DC,QAAS,CAAC,WAAY,eAAgB,kBnKylBtC8G,SoK/lBwB,CACxBvjI,KAAM,WACNioB,SAAU,MACVqrG,OAAQ,CAAC,wBACTx/G,YAAa,iIACb0oH,SAAU,CAAC,uCAAwC,gDACnDC,QAAS,CAAC,eAAgB,kBpK2lB1BnS,IqKjmBmB,CACnBtqH,KAAM,MACNioB,SAAU,UACVqrG,OAAQ,CAAC,UACTx/G,YAAa,6GACb0oH,SAAU,CAAC,WAAY,YAAa,UACpCC,QAAS,IrK6lBT+G,IsKnmBmB,CACnBxjI,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,oBAAqB,UAC9Bx/G,YAAa,8KACb0oH,SAAU,CAAC,kBAAmB,kBAC9BC,QAAS,CAAC,OAAQ,SAAU,MAAO,QtK8lBnC1yH,IuKpmBmB,CACnB/J,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,oBAAqB,SAAU,eACxCx/G,YAAa,iDACb0oH,SAAU,CAAC,kBAAmB,oBAAqB,oBAAqB,uBAAwB,uBAAwB,gCAAiC,iCACzJC,QAAS,CAAC,OAAQ,SAAU,MAAO,OAAQ,MAAO,MAAO,avK+lBzDj7H,KwKrmBoB,CACpBxB,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,qBAAsB,UAAW,gBAC1Cx/G,YAAa,mDACb0oH,SAAU,CAAC,mBAAoB,qBAAsB,qBAAsB,wBAAyB,wBAAyB,8BAC7HC,QAAS,CAAC,MAAO,SAAU,MAAO,OAAQ,MAAO,MAAO,axKgmBxDnyE,OyKtmBsB,CACtBtqD,KAAM,SACNioB,SAAU,aACVqrG,OAAQ,CAAC,uBAAwB,aACjCx/G,YAAa,mLACb0oH,SAAU,CAAC,kBAAmB,yBAC9BC,QAAS,CAAC,MAAO,OAAQ,MAAO,OAAQ,MAAO,MAAO,WAAY,gBzKimBlE3vG,I0KvmBmB,CACnB9sB,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,oBAAqB,SAAU,eACxCx/G,YAAa,iDACb0oH,SAAU,CAAC,kBAAmB,oBAAqB,oBAAqB,uBAAwB,uBAAwB,gCAAiC,iCACzJC,QAAS,CAAC,MAAO,OAAQ,SAAU,OAAQ,MAAO,MAAO,a1KkmBzDl5H,K2KxmBoB,CACpBvD,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,qBAAsB,UAAW,4BAC1Cx/G,YAAa,2HACb0oH,SAAU,CAAC,sBAAuB,8BAA+B,uBACjEC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,OAAQ,MAAO,MAAO,a3KmmBhEzgC,K4KzmBoB,CACpBh8F,KAAM,OACNioB,SAAU,aACVqrG,OAAQ,CAAC,qBAAsB,WAC/Bx/G,YAAa,qCACb0oH,SAAU,CAAC,gBAAiB,kBAAmB,sBAC/CC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,MAAO,MAAO,MAAO,a5KomB/DgH,Y6K1mB2B,CAC3BzjI,KAAM,cACNioB,SAAU,aACVqrG,OAAQ,CAAC,iCAAkC,gDAAiD,+BAC5Fx/G,YAAa,sWACb0oH,SAAU,CAAC,kCAAmC,yCAA0C,gCAAiC,yCACzHC,QAAS,CAAC,OAAQ,SAAU,MAAO,MAAO,OAAQ,MAAO,MAAO,a7KqmBhEiH,I8K3mBmB,CACnB1jI,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,oBAAqB,SAAU,yBACxCx/G,YAAa,iLACb0oH,SAAU,CAAC,eAAgB,oBAAqB,mCAAoC,8BAA+B,2BACnHC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,OAAQ,MAAO,a9KsmBzD/6H,I+K5mBmB,CACnB1B,KAAM,MACNioB,SAAU,aACVqrG,OAAQ,CAAC,oBAAqB,UAC9Bx/G,YAAa,iCACb0oH,SAAU,CAAC,kBAAmB,oBAAqB,qBACnDC,QAAS,CAAC,MAAO,OAAQ,SAAU,MAAO,OAAQ,MAAO,MAAO,a/KumBhElS,SgL7mBwB,CACxBvqH,KAAM,WACNioB,SAAU,aACVqrG,OAAQ,CAAC,yBAA0B,cAAe,8BAClDx/G,YAAa,gIACb0oH,SAAU,CAAC,oBAAqB,yBAA0B,wCAAyC,mCAAoC,gCACvIC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,MAAO,OAAQ,MAAO,QhLymBhE5jD,KiL/mBoB,CACpB74E,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,oDACb0oH,SAAU,CAAC,YAAa,kBACxBC,QAAS,CAAC,MAAO,OAAQ,SjL0mBzBrjD,MkLhnBqB,CACrBp5E,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,YACTx/G,YAAa,6FACb0oH,SAAU,CAAC,cACXC,QAAS,CAAC,OAAQ,QAAS,UlL2mB3BjS,KmLjnBoB,CACpBxqH,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,8CACb0oH,SAAU,CAAC,YAAa,iBAAkB,WAC1CC,QAAS,CAAC,MAAO,SnL4mBjBhS,MoLlnBqB,CACrBzqH,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,YACTx/G,YAAa,6GACb0oH,SAAU,CAAC,WAAY,cACvBC,QAAS,CAAC,QAAS,UpL6mBnB/R,KqLnnBoB,CACpB1qH,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,8CACb0oH,SAAU,CAAC,UAAW,iBAAkB,aACxCC,QAAS,CAAC,MAAO,OAAQ,SrL8mBzB9R,MsLpnBqB,CACrB3qH,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,YACTx/G,YAAa,sGACb0oH,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,UtL+mBnB7R,KuLrnBoB,CACpB5qH,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,2CACb0oH,SAAU,CAAC,YAAa,iBAAkB,WAC1CC,QAAS,CAAC,OAAQ,OAAQ,SvLgnB1B5R,MwLtnBqB,CACrB7qH,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,YACTx/G,YAAa,2CACb0oH,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,UxLinBnB3jD,KyLvnBoB,CACpB94E,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,kDACb0oH,SAAU,CAAC,YAAa,kBACxBC,QAAS,CAAC,MAAO,OAAQ,SzLknBzBtjD,M0LxnBqB,CACrBn5E,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,YACTx/G,YAAa,8FACb0oH,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,U1LmnBnB7jD,K2LznBoB,CACpB54E,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,qDACb0oH,SAAU,CAAC,YAAa,kBACxBC,QAAS,CAAC,MAAO,OAAQ,S3LonBzBvjD,M4L1nBqB,CACrBl5E,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,YACTx/G,YAAa,mGACb0oH,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,U5LqnBnB58E,M6L3nBqB,CACrB7/C,KAAM,QACNioB,SAAU,eACVqrG,OAAQ,CAAC,eACTx/G,YAAa,qEACb0oH,SAAU,CAAC,mBAAoB,wBAAyB,iBAAkB,iBAAkB,eAC5FC,QAAS,CAAC,MAAO,MAAO,Q7LsnBxBxtH,I8L5nBmB,CACnBjP,KAAM,MACNioB,SAAU,eACVqrG,OAAQ,CAAC,UACTx/G,YAAa,sCACb0oH,SAAU,CAAC,SAAU,kBAAmB,eAAgB,cAAe,2BACvEC,QAAS,CAAC,OAAQ,MAAO,Q9LunBzBhlD,K+L7nBoB,CACpBz3E,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,iDACb0oH,SAAU,CAAC,aACXC,QAAS,CAAC,OAAQ,OAAQ,S/LwnB1B3R,IgM9nBmB,CACnB9qH,KAAM,MACNioB,SAAU,eACVqrG,OAAQ,CAAC,UACTx/G,YAAa,6DACb0oH,SAAU,CAAC,SAAU,cACrBC,QAAS,CAAC,MAAO,MAAO,QhMynBxB1R,KiM/nBoB,CACpB/qH,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,oDACb0oH,SAAU,CAAC,UAAW,eACtBC,QAAS,CAAC,OAAQ,OAAQ,SjM0nB1BzR,IkMhoBmB,CACnBhrH,KAAM,MACNioB,SAAU,eACVqrG,OAAQ,CAAC,UACTx/G,YAAa,4DACb0oH,SAAU,CAAC,SAAU,cACrBC,QAAS,CAAC,MAAO,MAAO,QlM2nBxBxR,KmMjoBoB,CACpBjrH,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,wEACb0oH,SAAU,CAAC,UAAW,eACtBC,QAAS,CAAC,OAAQ,OAAQ,SnM4nB1BvR,IoMloBmB,CACnBlrH,KAAM,MACNioB,SAAU,eACVqrG,OAAQ,CAAC,UACTx/G,YAAa,0DACb0oH,SAAU,CAAC,SAAU,cACrBC,QAAS,CAAC,MAAO,MAAO,QpM6nBxBtR,KqMnoBoB,CACpBnrH,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,sEACb0oH,SAAU,CAAC,UAAW,eACtBC,QAAS,CAAC,OAAQ,OAAQ,SrM8nB1BttH,IsMpoBmB,CACnBnP,KAAM,MACNioB,SAAU,eACVqrG,OAAQ,CAAC,UACTx/G,YAAa,oCACb0oH,SAAU,CAAC,SAAU,kBAAmB,cAAe,cAAe,2BACtEC,QAAS,CAAC,OAAQ,MAAO,QtM+nBzB/kD,KuMroBoB,CACpB13E,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,+CACb0oH,SAAU,CAAC,aACXC,QAAS,CAAC,OAAQ,SvMgoBlB3iC,IwMtoBmB,CACnB95F,KAAM,MACNioB,SAAU,eACVqrG,OAAQ,CAAC,UACTx/G,YAAa,uCACb0oH,SAAU,CAAC,WAAY,sBAAuB,cAAe,eAC7DC,QAAS,CAAC,OAAQ,MAAO,QxMioBzBplC,KyMvoBoB,CACpBr3F,KAAM,OACNioB,SAAU,eACVqrG,OAAQ,CAAC,WACTx/G,YAAa,kDACb0oH,SAAU,CAAC,YAAa,yBACxBC,QAAS,CAAC,OAAQ,SzMmoBlBtU,G0MzoBkB,CAClBnoH,KAAM,KACNioB,SAAU,QACVqrG,OAAQ,CAAC,YAAa,eACtBx/G,YAAa,8BACb0oH,SAAU,CAAC,eAAgB,aAAc,oBACzCC,QAAS,I1MqoBTl+B,M2M3oBqB,CACrBv+F,KAAM,QACNioB,SAAU,QACVqrG,OAAQ,CAAC,YACTx/G,YAAa,sFACb0oH,SAAU,CAAC,aAAc,gBAAiB,gBAAiB,sBAAuB,wBAClFC,QAAS,I3MsoBTkH,O4M5oBsB,CACtB3jI,KAAM,SACNioB,SAAU,QACVqrG,OAAQ,CAAC,gBAAiB,4BAC1Bx/G,YAAa,wCACb0oH,SAAU,CAAC,cAAe,iBAAkB,aAAc,iBAC1DC,QAAS,CAAC,U5MuoBVmH,I6M7oBmB,CACnB5jI,KAAM,MACNioB,SAAU,QACVqrG,OAAQ,CAAC,cACTx/G,YAAa,4BACb0oH,SAAU,CAAC,UACXC,QAAS,CAAC,MAAO,Q7MwoBjBoH,I8M9oBmB,CACnB7jI,KAAM,MACNioB,SAAU,QACVqrG,OAAQ,CAAC,cACTx/G,YAAa,2BACb0oH,SAAU,CAAC,WACXC,QAAS,CAAC,MAAO,Q9MyoBjBqH,I+M/oBmB,CACnB9jI,KAAM,MACNioB,SAAU,QACVqrG,OAAQ,CAAC,cACTx/G,YAAa,iCACb0oH,SAAU,CAAC,YACXC,QAAS,CAAC,MAAO,Q/M0oBjBz5H,MgNhpBqB,CACrBhD,KAAM,QACNioB,SAAU,QACVqrG,OAAQ,CAAC,YACTx/G,YAAa,6CACb0oH,SAAU,CAAC,WAAY,eAAgB,aAAc,mBACrDC,QAAS,CAAC,aAAc,YAAa,aAAc,WhN2oBnD7oE,UiNjpByB,CACzB5zD,KAAM,YACNioB,SAAU,QACVqrG,OAAQ,CAAC,gBACTx/G,YAAa,6CACb0oH,SAAU,CAAC,eAAgB,iBAAkB,2BAC7CC,QAAS,CAAC,aAAc,YAAa,aAAc,WjN4oBnDpkC,WkNlpB0B,CAC1Br4F,KAAM,aACNioB,SAAU,QACVqrG,OAAQ,CAAC,iBACTx/G,YAAa,uDACb0oH,SAAU,CAAC,gBAAiB,gBAAiB,iBAAkB,4BAC/DC,QAAS,CAAC,YAAa,YAAa,aAAc,WlN6oBlDsH,UmNnpByB,CACzB/jI,KAAM,YACNioB,SAAU,QACVqrG,OAAQ,CAAC,gBACTx/G,YAAa,qHACb0oH,SAAU,CAAC,eAAgB,iBAAkB,uBAAwB,eAAgB,4BAA6B,6BAA8B,oBAAqB,kCACrKC,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,oBnN8oBtEuH,gBoNppB+B,CAC/BhkI,KAAM,kBACNioB,SAAU,QACVqrG,OAAQ,CAAC,sBACTx/G,YAAa,0HACb0oH,SAAU,CAAC,qBAAsB,uBAAwB,iBAAkB,qBAAsB,kCAAmC,mCAAoC,0BAA2B,wCACnMC,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,cpN+oBtEnkC,WqNrpB0B,CAC1Bt4F,KAAM,aACNioB,SAAU,QACVqrG,OAAQ,CAAC,iBACTx/G,YAAa,sDACb0oH,SAAU,CAAC,gBAAiB,gBAAiB,iBAAkB,4BAC/DC,QAAS,CAAC,YAAa,YAAa,aAAc,WrNgpBlDwH,QsNtpBuB,CACvBjkI,KAAM,UACNioB,SAAU,QACVqrG,OAAQ,CAAC,cACTx/G,YAAa,4EACb0oH,SAAU,CAAC,aAAc,cAAe,yBACxCC,QAAS,CAAC,YAAa,YAAa,aAAc,WtNipBlD7mC,OuNvpBsB,CACtB51F,KAAM,SACNioB,SAAU,QACVqrG,OAAQ,CAAC,aACTx/G,YAAa,gCACb0oH,SAAU,CAAC,YAAa,YAAa,aAAc,yBACnDC,QAAS,CAAC,YAAa,YAAa,aAAc,evNmpBlDyH,OwNzpBsB,CACtBlkI,KAAM,SACNioB,SAAU,QACVqrG,OAAQ,CAAC,aACTx/G,YAAa,8BACb0oH,SAAU,CAAC,cAAe,iBAAkB,iBAAkB,yBAC9DC,QAAS,CAAC,sBxNopBVrR,QyN1pBuB,CACvBprH,KAAM,UACNioB,SAAU,QACVqrG,OAAQ,CAAC,cACTx/G,YAAa,sFACb0oH,SAAU,CAAC,eAAgB,yBAA0B,4BAA6B,0BAA2B,yBAA0B,oCACvIC,QAAS,CAAC,SAAU,WAAY,YAAa,SAAU,YCFrD,GAAO,OACP,GAAe,CAAC,QAAS,oBAAqB,QACvC0H,IAA4B,EAAAziB,EAAA,IAAQ,GAAM,IAAepiB,IAClE,IAAI,MACFyzB,EAAK,kBACLpR,EAAiB,KACjB0a,GACE/8B,EAoBJ,OAAOyzB,EAAM,GAAM,CACjBW,IAAK,SAAaj2B,GAChB,IAAI9pB,EACAywD,EAAa3mC,EAEjB,GAAsB,iBAAXA,EACT,IAAK9pB,KAAQguC,EAEX,IAAI,QAAeA,EAAmBhuC,IAAS8pB,IAAWkkB,EAAkBhuC,GAAO,CACjFywD,EAAazwD,EACb,MAmBN,IAAI2oD,GAAM,QAAgBU,GAAcoH,GAExC,IAAK9H,EAAK,CACR,IAAI+H,EAAmC,mBAAfD,EAA4BA,EAAWpkI,KAAOokI,EACtE,MAAM,IAAI39H,MAAM,8BAAgC49H,EAAa,KAG/D,OAAO,IAAIhI,EAAKC,SCjElB,GAAO,UACP,GAAe,CAAC,QAAS,SAClBgI,IAA+B,EAAA5iB,EAAA,IAAQ,GAAM,IAAepiB,IACrE,IAAI,MACFyzB,EAAK,MACLv7G,GACE8nF,EAoCJ,OAAOyzB,EAAM,GAAM,CACjBve,OAAQ,SAAgBnuG,GACtB,OAAOmR,EAAMnR,GAAMu1B,WAErB,iBAAkB,SAAqBv1B,GACrC,OAAO,SAAQA,GAAM,SAAU0jE,GAC7B,OAAOvyD,EAAMuyD,GAAOnuC,mBC9CxB,GAAe,CAAC,eAAgB,eAAgB,cACzC2oG,IAA4B,EAAA7iB,EAAA,IAF5B,eAE0C,IAAepiB,IAClE,IAAI,aACF82B,EAAY,aACZlG,EAAY,WACZ8F,GACE12B,EAKAklC,EAAc,CAChB39H,KAAK,EACLiY,UAAU,GAER2lH,EAAc,CAChB59H,KAAK,EACLiY,UAAU,GAiBZ,SAAS4lH,EAAc/8G,EAAM27F,GAC3B,KAAK,EAAAlB,EAAA,IAAez6F,GAClB,OAAO,EAGT,IAAI3nB,EAAO2nB,EAAKttB,GAAG0F,WAEnB,OAAIujH,IAAW,QAAeA,EAAStjH,KAAS,QAAesjH,EAAQtjH,GAAO,eACrEsjH,EAAQtjH,GAAMykI,YAGhBA,EAAYzkI,KAAS,EAyB9B,SAAS2kI,EAAYh9G,GACnB,IAAIwoG,EACA/kH,EAAW,GAcf,OAAIs5H,EAAc/8G,IAChBwoG,EAAKxoG,EAAKwoG,GAbO,SAASyU,EAAaj9G,GACvC,IAAK,IAAI3uB,EAAI,EAAGA,EAAI2uB,EAAKptB,KAAKxB,OAAQC,IAAK,CACzC,IAAIyqF,EAAQ97D,EAAKptB,KAAKvB,IAElB,EAAAopH,EAAA,IAAe3+B,IAAU0sC,IAAO1sC,EAAM0sC,GACxCyU,EAAanhD,GAEbr4E,EAAStP,KAAK2nF,IAOlBmhD,CAAaj9G,GACNvc,GAEAuc,EAAKptB,KA0DhB,SAASsqI,EAAuBl9G,GAC9B,OAAI,EAAAy6F,EAAA,IAAez6F,GACV,SAAUptB,GACf,IACE,OAAO,IAAI21H,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAIE,EAAMotB,EAAKyoG,UACrD,MAAO11H,GAEP,OADA4K,QAAQtL,MAAMU,GACP,KAIJ,SAAUH,GACf,OAAO,IAAI67H,EAAa,IAAIJ,EAAWruG,EAAK3nB,MAAOzF,IAKzD,MAAO,CACLsqI,yBACAC,cApJF,SAAuBn9G,EAAM27F,GAC3B,KAAK,EAAAlB,EAAA,IAAez6F,GAClB,OAAO,EAGT,IAAI3nB,EAAO2nB,EAAKttB,GAAG0F,WAEnB,OAAIujH,IAAW,QAAeA,EAAStjH,KAAS,QAAesjH,EAAQtjH,GAAO,eACrEsjH,EAAQtjH,GAAMwkI,YAGhBA,EAAYxkI,KAAS,GA0I5B0kI,gBACA3mD,QArHF,SAASA,EAAQp2D,GACf,IAAKA,EAAKptB,MAA6B,IAArBotB,EAAKptB,KAAKxB,OAC1B,OAAO4uB,EAGTA,EAAKptB,KAAOoqI,EAAYh9G,GAExB,IAAK,IAAI3uB,EAAI,EAAGA,EAAI2uB,EAAKptB,KAAKxB,OAAQC,IACpC+kF,EAAQp2D,EAAKptB,KAAKvB,KA8GpB2rI,cACAI,WAzEF,SAASA,EAAWp9G,GAClB,GAAKA,EAAKptB,MAA6B,IAArBotB,EAAKptB,KAAKxB,OAA5B,CAOA,IAHA,IAAIisI,EAAWH,EAAuBl9G,GAClCyd,EAAIzd,EAAKptB,KAAKxB,OAETC,EAAI,EAAGA,EAAIosC,EAAGpsC,IACrB+rI,EAAWp9G,EAAKptB,KAAKvB,IAGvB,GAAIosC,EAAI,GAAKs/F,EAAc/8G,GAAO,CAGhC,IAFA,IAAIs9G,EAAUt9G,EAAKptB,KAAKu5D,MAEjBnsC,EAAKptB,KAAKxB,OAAS,GACxBksI,EAAUD,EAAS,CAACr9G,EAAKptB,KAAKu5D,MAAOmxE,IAGvCt9G,EAAKptB,KAAO0qI,EAAQ1qI,QAuDtB2qI,WA/CF,SAASA,EAAWv9G,GAClB,GAAKA,EAAKptB,MAA6B,IAArBotB,EAAKptB,KAAKxB,OAA5B,CAOA,IAHA,IAAIisI,EAAWH,EAAuBl9G,GAClCyd,EAAIzd,EAAKptB,KAAKxB,OAETC,EAAI,EAAGA,EAAIosC,EAAGpsC,IACrBksI,EAAWv9G,EAAKptB,KAAKvB,IAGvB,GAAIosC,EAAI,GAAKs/F,EAAc/8G,GAAO,CAGhC,IAFA,IAAIs9G,EAAUt9G,EAAKptB,KAAK2+F,QAEjBvxE,EAAKptB,KAAKxB,OAAS,GACxBksI,EAAUD,EAAS,CAACC,EAASt9G,EAAKptB,KAAK2+F,UAGzCvxE,EAAKptB,KAAO0qI,EAAQ1qI,YClJtB,GAAe,CAAC,QAAS,SAAU,MAAO,WAAY,WAAY,SAAU,MAAO,eAAgB,eAAgB,eAAgB,mBAC5H4qI,IAAoC,EAAAzjB,EAAA,IAFpC,eAEkD,IAAepiB,IAC1E,IAAI,MACFipB,EAAK,OACL3yB,EAAM,IACN/uF,EAAG,SACHg1F,EAAQ,SACR/8E,EAAQ,OACRg3E,EAAM,IACN7zF,EAAG,aACH6pH,EAAY,aACZoE,EAAY,aACZkG,EAAY,gBACZ3J,GACEntB,EACA8lC,EAAQ,IAAItZ,EAAa,GACzBuZ,EAAQ,IAAIvZ,EAAa,GA0K7B,OAjJA,SAASwZ,EAAa39G,GACpB,IAAI,EAAAy6F,EAAA,IAAez6F,IAASA,EAAKiqG,UAAW,CAC1C,IAAI2T,EAAKD,EAAa39G,EAAKptB,KAAK,IAEhC,GAAgB,MAAZotB,EAAKwoG,GAEP,OAAOoV,EAGT,GAAgB,MAAZ59G,EAAKwoG,GAAY,CAEnB,IAAI,EAAA/N,EAAA,IAAemjB,GAAK,CACtB,GAAIA,EAAG3T,WAAuB,MAAV2T,EAAGpV,GACrB,OAAOoV,EAAGhrI,KAAK,GACV,GAAIgrI,EAAGxyC,YAAwB,aAAVwyC,EAAGlrI,GAC7B,OAAO,IAAI61H,EAAa,IAAK,WAAY,CAACqV,EAAGhrI,KAAK,GAAIgrI,EAAGhrI,KAAK,KAIlE,OAAO,IAAI21H,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACkrI,UAExC,IAAI,EAAAnjB,EAAA,IAAez6F,IAASA,EAAKorE,WAAY,CAClD,IAAIjb,EAAKwtD,EAAa39G,EAAKptB,KAAK,IAE5BirI,EAAKF,EAAa39G,EAAKptB,KAAK,IAEhC,GAAgB,MAAZotB,EAAKwoG,GAAY,CACnB,IAAI,EAAA/N,EAAA,IAAetqC,GAAK,CACtB,GAAI8d,EAAO9d,EAAG/9E,OACZ,OAAOyrI,EACF,IAAI,EAAApjB,EAAA,IAAeojB,GACxB,OAAO,IAAI1Z,EAAajlH,EAAIixE,EAAG/9E,MAAOyrI,EAAGzrI,QAI7C,OAAI,EAAAqoH,EAAA,IAAeojB,IAAO5vC,EAAO4vC,EAAGzrI,OAC3B+9E,GAGL,EAAAsqC,EAAA,IAAeojB,IAAOA,EAAG5T,WAAuB,MAAV4T,EAAGrV,GACpC,IAAID,EAAa,IAAK,WAAY,CAACp4C,EAAI0tD,EAAGjrI,KAAK,KAGjD,IAAI21H,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAImrI,EAAK,CAAC1tD,EAAI0tD,GAAM,CAAC1tD,IACtD,GAAgB,MAAZnwD,EAAKwoG,GAAY,CAC1B,IAAI,EAAA/N,EAAA,IAAetqC,IAAO0tD,EAAI,CAC5B,IAAI,EAAApjB,EAAA,IAAeojB,GACjB,OAAO,IAAI1Z,EAAajwB,EAAS/jB,EAAG/9E,MAAOyrI,EAAGzrI,QACzC,GAAI67F,EAAO9d,EAAG/9E,OACnB,OAAO,IAAIm2H,EAAa,IAAK,aAAc,CAACsV,IAKhD,GAAgB,aAAZ79G,EAAKttB,GACP,OAAI,EAAA+nH,EAAA,IAAeojB,IAAO5vC,EAAO4vC,EAAGzrI,OAC3B+9E,GAGL,EAAAsqC,EAAA,IAAeojB,IAAOA,EAAG5T,WAAuB,MAAV4T,EAAGrV,GACpCmV,EAAa,IAAIpV,EAAa,IAAK,MAAO,CAACp4C,EAAI0tD,EAAGjrI,KAAK,MAGzD,IAAI21H,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACy9E,EAAI0tD,QAE5C,IAAgB,MAAZ79G,EAAKwoG,GAAY,CAC1B,IAAI,EAAA/N,EAAA,IAAetqC,GAAK,CACtB,GAAI8d,EAAO9d,EAAG/9E,OACZ,OAAOqrI,EACF,GAAI7c,EAAMzwC,EAAG/9E,MAAO,GACzB,OAAOyrI,EACF,IAAI,EAAApjB,EAAA,IAAeojB,GACxB,OAAO,IAAI1Z,EAAahtG,EAASg5D,EAAG/9E,MAAOyrI,EAAGzrI,QAIlD,IAAI,EAAAqoH,EAAA,IAAeojB,GAAK,CACtB,GAAI5vC,EAAO4vC,EAAGzrI,OACZ,OAAOqrI,EACF,GAAI7c,EAAMid,EAAGzrI,MAAO,GACzB,OAAO+9E,EACF,IAAI,EAAAsqC,EAAA,IAAetqC,IAAOA,EAAGib,YAAcjb,EAAGq4C,KAAOxoG,EAAKwoG,GAAI,CACnE,IAAIsV,EAAM3tD,EAAGv9E,KAAK,GAElB,IAAI,EAAA6nH,EAAA,IAAeqjB,GAAM,CACvB,IAAIC,EAAQ,IAAI5Z,EAAahtG,EAAS2mH,EAAI1rI,MAAOyrI,EAAGzrI,QACpD,OAAO,IAAIm2H,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACqrI,EAAO5tD,EAAGv9E,KAAK,IAAKotB,EAAKyoG,WAIxE,OAAO,IAAIF,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACmrI,EAAI1tD,GAAKnwD,EAAKyoG,UAG3D,OAAO,IAAIF,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACy9E,EAAI0tD,GAAK79G,EAAKyoG,UACpD,GAAgB,MAAZzoG,EAAKwoG,GAAY,CAC1B,IAAI,EAAA/N,EAAA,IAAetqC,GAAK,CACtB,GAAI8d,EAAO9d,EAAG/9E,OACZ,OAAOqrI,EACF,IAAI,EAAAhjB,EAAA,IAAeojB,KAAQjd,EAAMid,EAAGzrI,MAAO,IAAMwuH,EAAMid,EAAGzrI,MAAO,IAAMwuH,EAAMid,EAAGzrI,MAAO,IAC5F,OAAO,IAAI+xH,EAAah2B,EAAOhe,EAAG/9E,MAAOyrI,EAAGzrI,QAIhD,OAAO,IAAIm2H,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACy9E,EAAI0tD,IAC1C,GAAgB,MAAZ79G,EAAKwoG,GAAY,CAC1B,IAAI,EAAA/N,EAAA,IAAeojB,GAAK,CACtB,GAAI5vC,EAAO4vC,EAAGzrI,OACZ,OAAOsrI,EACF,GAAI9c,EAAMid,EAAGzrI,MAAO,GACzB,OAAO+9E,EAEP,IAAI,EAAAsqC,EAAA,IAAetqC,GAEjB,OAAO,IAAIg0C,EAAa7pH,EAAI61E,EAAG/9E,MAAOyrI,EAAGzrI,QACpC,IAAI,EAAAqoH,EAAA,IAAetqC,IAAOA,EAAGib,YAAwB,MAAVjb,EAAGq4C,GAAY,CAC/D,IAAIwV,EAAM7tD,EAAGv9E,KAAK,GAElB,IAAI,EAAA6nH,EAAA,IAAeujB,GACjB,OAAO,IAAIzV,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACy9E,EAAGv9E,KAAK,GAAI,IAAIuxH,EAAahtG,EAAS6mH,EAAI5rI,MAAOyrI,EAAGzrI,WAMvG,OAAO,IAAIm2H,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACy9E,EAAI0tD,UAE5C,KAAI,EAAApjB,EAAA,IAAkBz6F,GAAO,CAClC,IAAI3gB,EAAIs+H,EAAa39G,EAAKjB,SAE1B,OAAI,EAAA07F,EAAA,IAAkBp7G,KAAM,EAAAo7G,EAAA,IAAap7G,KAAM,EAAAo7G,EAAA,IAAep7G,GACrDA,EAGF,IAAIylH,EAAgBzlH,GACtB,IAAI,EAAAo7G,EAAA,IAAez6F,GAAO,CAC/B,IAAIptB,EAAOotB,EAAKptB,KAAKqH,IAAI0jI,GAAc1jI,KAAI,SAAU/H,GACnD,OAAO,EAAAuoH,EAAA,IAAkBvoH,GAAOA,EAAI6sB,QAAU7sB,KAEhD,OAAO,IAAIu8H,EAAakP,EAAa39G,EAAKttB,IAAKE,IAIjD,OAAOotB,M,WCpLP,GAAe,CAAC,QAAS,SAAU,oBAAqB,YAAa,aAAc,eAAgB,eAAgB,eAAgB,cAC5Hi+G,IAAwC,EAAAlkB,EAAA,IAFxC,mBAEsD,IAAepiB,IAC9E,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,kBACNy+F,EAAiB,SACjBwb,EAAQ,UACR9R,EAAS,aACTS,EAAY,aACZoE,EAAY,aACZkG,EAAY,WACZJ,GACE12B,GACA,cACFwlC,EAAa,cACbJ,EAAa,YACbC,EAAW,uBACXE,GACEN,GAAW,CACbnO,eACAlG,eACA8F,eAQF,SAAS6P,EAAMC,EAAQvrI,EAAMkb,GAC3B,IACE,OAAOswH,EAAUpkB,EAAkBmkB,GAAQrrI,MAAM,KAAMF,GAAOkb,GAC9D,MAAOq4E,GASP,OAPAvzF,EAAOA,EAAKqH,KAAI,SAAUd,GACxB,OAAI,EAAAshH,EAAA,IAAWthH,GACNA,EAAEvF,UAGJuF,KAEFilI,EAAUpkB,EAAkBmkB,GAAQrrI,MAAM,KAAMF,GAAOkb,IAIlE,IAAIuwH,EAAUjT,EAAM,CAClB3yB,SAkFF,SAAyBviF,GACvB,IAAI/d,EACAmmI,EAAKpoH,EAAEwiB,EAAIxiB,EAAE/d,EAQjB,OALEA,EADEmmI,EAAK,EACH,IAAI/V,EAAa,IAAK,aAAc,CAAC,IAAIpE,GAAcma,KAEvD,IAAIna,EAAama,GAGX,IAARpoH,EAAE7T,EACGlK,EAGF,IAAIowH,EAAa,IAAK,SAAU,CAACpwH,EAAG,IAAIgsH,EAAajuG,EAAE7T,MA/F9D/G,OAAQ,SAAgBnD,GACtB,OAAIA,EAAI,EACComI,EAAe,IAAIpa,GAAchsH,IAGnC,IAAIgsH,EAAahsH,IAE1BqmI,UAAW,SAAmBrmI,GAC5B,OAAIA,EAAI,EACComI,EAAe,IAAIpa,GAAchsH,IAGnC,IAAIgsH,EAAahsH,IAE1Bk4E,QAAS,SAAiB33C,GACxB,MAAM,IAAI55B,MAAM,4CAMpB,SAAS2/H,EAAetmI,EAAG2V,GAGzB,GAFqBA,IAAsC,IAA3BA,EAAQ4wH,gBAElBnqE,SAASp8D,IAAMq9H,EAAU,CAC7C,IAAIt/G,EAAIs/G,EAASr9H,GACbwmI,EAAiB7wH,GAA6C,iBAA3BA,EAAQ6wH,eAA8B7wH,EAAQ6wH,eAAiB3tD,IAEtG,GAAI96D,EAAEtiB,YAAcuE,GAAK+d,EAAE/d,EAAIwmI,GAAkBzoH,EAAE7T,EAAIs8H,EACrD,OAAOzoH,EAIX,OAAO/d,EAKT,IAAIimI,EAAYhT,EAAM,CACpB,iBAAkB,SAAsB1yF,EAAG5qB,GACzC,MAAsB,cAAlByN,EAAOjgB,aACStI,IAAd0wH,IACF,WAGKA,EAAUhrF,IACU,aAAlBnd,EAAOjgB,aACCtI,IAAbwiI,IACF,WAGKA,EAAS98F,IAGT+lG,EADCzmH,WAAW0gB,GACM5qB,IAG7B,mBAAoB,SAAwB4qB,EAAG5qB,GAC7C,OAAO4qB,GAGT,oBAAqB,SAAyBA,EAAG5qB,GAC/C,OAAO4qB,GAGT,iBAAkB,SAAsBA,EAAG5qB,GACzC,OAAO2wH,EAAe/lG,EAAG5qB,IAE3B,kBAAmB,SAAuB4qB,EAAG5qB,GAC3C,OAAa,IAAT4qB,EAAE+3C,GACG/3C,EAGF+lG,EAAe/lG,EAAEhM,GAAI5e,MAIhC,SAASywH,EAAepmI,GACtB,OAAO,IAAIowH,EAAa,IAAK,aAAc,CAACpwH,IA+B9C,SAASymI,EAAOlsI,EAAIE,EAAMyqI,EAAUvvH,GAClC,OAAOlb,EAAKwH,QAAO,SAAUlG,EAAGmG,GAC9B,IAAK,EAAAogH,EAAA,IAAOvmH,KAAO,EAAAumH,EAAA,IAAOpgH,IAOd,EAAAogH,EAAA,IAAOvmH,IAEP,EAAAumH,EAAA,IAAOpgH,KACjBA,EAAIgkI,EAAQhkI,IAFZnG,EAAImqI,EAAQnqI,OARgB,CAC5B,IACE,OAAOgqI,EAAMxrI,EAAI,CAACwB,EAAGmG,GAAIyT,GACzB,MAAO+wH,IAET3qI,EAAImqI,EAAQnqI,GACZmG,EAAIgkI,EAAQhkI,GAOd,OAAOgjI,EAAS,CAACnpI,EAAGmG,OAKxB,SAASykI,EAAa9+G,EAAMlS,GAC1B,OAAQkS,EAAKvV,MACX,IAAK,aACH,OAAOuV,EAET,IAAK,eACH,MAA0B,iBAAfA,EAAK5tB,OAAuBiJ,MAAM2kB,EAAK5tB,OAI3C4tB,EAHEo+G,EAAUp+G,EAAK5tB,MAAO0b,GAKjC,IAAK,eACH,GAAIksG,EAAkBh6F,EAAK3nB,OAAS2hH,EAAkBh6F,EAAK3nB,MAAMs2H,QAC/D,OAAO3uG,EAOP,IAA8C,IAFtB,CAAC,MAAO,YAEV/kB,QAAQ+kB,EAAK3nB,MAAc,CAC/C,IAAIzF,EAAOotB,EAAKptB,KAAKqH,KAAI/H,GAAO4sI,EAAa5sI,EAAK4b,KAElD,IAAKlb,EAAKsc,KAAKurG,EAAA,IACb,IACE,OAAOyjB,EAAMl+G,EAAK3nB,KAAMzF,EAAMkb,GAC9B,MAAOixH,IAOX,OAHAnsI,EAAOA,EAAKqH,KAAI,SAAU/H,GACxB,OAAO,EAAAuoH,EAAA,IAAOvoH,GAAOA,EAAMmsI,EAAQnsI,MAE9B,IAAIu8H,EAAazuG,EAAK3nB,KAAMzF,GAOzC,IAAK,eAED,IAEIosI,EAEA55D,EAJA1yE,EAAKstB,EAAKttB,GAAG0F,WAKbilI,EAAWH,EAAuBl9G,GAEtC,IAAI,EAAAy6F,EAAA,IAAez6F,IAASA,EAAKiqG,UAC/B+U,EAAQ,CAACF,EAAa9+G,EAAKptB,KAAK,GAAIkb,IAKlCs3D,GAHG,EAAAq1C,EAAA,IAAOukB,EAAM,IAGV3B,EAAS2B,GAFTd,EAAMxrI,EAAIssI,EAAOlxH,QAIpB,GAAIivH,EAAc/8G,GAIvB,GAFAg/G,GADAA,EAAQhC,EAAYh9G,IACN/lB,KAAI/H,GAAO4sI,EAAa5sI,EAAK4b,KAEvCqvH,EAAczqI,GAAK,CAKrB,IAHA,IAAIusI,EAAS,GACTC,EAAO,GAEF7tI,EAAI,EAAGA,EAAI2tI,EAAM5tI,OAAQC,KAC3B,EAAAopH,EAAA,IAAOukB,EAAM3tI,IAGhB6tI,EAAK/qI,KAAK6qI,EAAM3tI,IAFhB4tI,EAAO9qI,KAAK6qI,EAAM3tI,IAMlB4tI,EAAO7tI,OAAS,GAClBg0E,EAAMw5D,EAAOlsI,EAAIusI,EAAQ5B,EAAUvvH,GACnCoxH,EAAKh7H,QAAQkhE,GACbA,EAAMw5D,EAAOlsI,EAAIwsI,EAAM7B,EAAUvvH,IAGjCs3D,EAAMw5D,EAAOlsI,EAAIssI,EAAO3B,EAAUvvH,QAIpCs3D,EAAMw5D,EAAOlsI,EAAIssI,EAAO3B,EAAUvvH,QAKpCs3D,EAAMw5D,EAAOlsI,EADbssI,EAAQh/G,EAAKptB,KAAKqH,KAAI/H,GAAO4sI,EAAa5sI,EAAK4b,KACvBuvH,EAAUvvH,GAGpC,OAAOs3D,EAGX,IAAK,kBAEH,OAAO05D,EAAa9+G,EAAKjB,QAASjR,GAEpC,IAAK,eAGL,IAAK,YAGL,IAAK,iBAGL,IAAK,YAGL,IAAK,yBAGL,IAAK,YAGL,IAAK,aAGL,IAAK,YAGL,IAAK,kBAGL,QACE,MAAM,IAAIhP,MAAM,gDAAgDT,OAAO2hB,EAAKvV,QAIlF,OA5RA,SAA0B/L,EAAMoP,GAC9B,IAAIs3D,EAAM05D,EAAapgI,EAAMoP,GAC7B,OAAO,EAAA2sG,EAAA,IAAOr1C,GAAOA,EAAMi5D,EAAQj5D,OC7BnC,GAAe,CAAC,QAAS,eAAgB,eAAgB,mBAClD+5D,IAA+B,EAAAplB,EAAA,IAF/B,UAE6C,IAAepiB,IACrE,IAAI,MACF9nF,EAAK,aACL4+G,EAAY,aACZlG,EAAY,gBACZzD,GACEntB,EAkDJ,OA/BA,SAAS9lG,EAAQmuB,EAAMi6F,GACrB,IAAKA,EACH,OAAOj6F,EAGT,IAAI,EAAAy6F,EAAA,IAAaz6F,GAAO,CACtB,IAAI5tB,EAAQ6nH,EAAMj6F,EAAK3nB,MAEvB,IAAI,EAAAoiH,EAAA,IAAOroH,GACT,OAAOP,EAAQO,EAAO6nH,GACjB,GAAqB,iBAAV7nH,EAChB,OAAOyd,EAAM1S,OAAO/K,QAEjB,KAAI,EAAAqoH,EAAA,IAAez6F,GAAO,CAC/B,IAAIptB,EAAOotB,EAAKptB,KAAKqH,KAAI,SAAU/H,GACjC,OAAOL,EAAQK,EAAK+nH,MAEtB,OAAO,IAAIsO,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAIE,EAAMotB,EAAKyoG,UAChD,IAAI,EAAAhO,EAAA,IAAkBz6F,GAC3B,OAAO,IAAI8kG,EAAgBjzH,EAAQmuB,EAAKjB,QAASk7F,IAC5C,IAAI,EAAAQ,EAAA,IAAez6F,GAAO,CAC/B,IAAIg/G,EAAQh/G,EAAKptB,KAAKqH,KAAI,SAAU/H,GAClC,OAAOL,EAAQK,EAAK+nH,MAGtB,OAAO,IAAIwU,EAAazuG,EAAK3nB,KAAM2mI,IAGrC,OAAOh/G,MCjDP,GAAe,CAAC,SAAU,QAAS,QAAS,MAAO,WAAY,WAAY,SAAU,MAAO,SAAU,QAAS,YAAa,aAAc,oBAAqB,eAAgB,eAAgB,eAAgB,kBAAmB,cAC3No/G,IAAgC,EAAArlB,EAAA,IAFhC,WAE8C,IAAepiB,IACtE,IAAI,OACFp8E,EAAM,MACN6vG,EAAK,MACLv7G,EAAK,IACL3Q,EAAG,SACHg1F,EAAQ,SACR/8E,EAAQ,OACRg3E,EAAM,IACN7zF,EAAG,OACH2zF,EAAM,MACN2yB,EAAK,SACL4U,EAAQ,UACR9R,EAAS,kBACT1J,EAAiB,aACjBmK,EAAY,aACZsK,EAAY,aACZlG,EAAY,gBACZzD,EAAe,WACfuJ,GACE12B,EACA0nC,EAAmBpB,GAAuB,CAC5C7S,QACA7vG,SACAy+F,oBACAwb,WACA9R,YACAS,eACAoE,eACAkG,eACAJ,eAEEsP,EAAeH,GAAmB,CACpC5c,QACA3yB,SACA/uF,MACAg1F,WACA/8E,WACAg3E,SACA7zF,MACA6pH,eACAoE,eACAkG,eACA3J,oBAEEjzH,EAAUstI,GAAc,CAC1BtvH,QACA4+G,eACAlG,eACAzD,qBAEE,cACFqY,EAAa,cACbJ,EAAa,QACb3mD,EAAO,WACPgnD,EAAU,WACVG,EAAU,uBACVL,GACEN,GAAW,CACbnO,eACAlG,eACA8F,eA0EEtiD,EAAWq/C,EAAM,WAAY,CAC/Bve,OAAQ,SAAgBnuG,GACtB,OAAO/L,KAAKkd,EAAMnR,GAAO/L,KAAK2sI,MAAO,GAAI,KAE3C,iBAAkB,SAAsB5gI,EAAMu7G,GAC5C,OAAOtnH,KAAKkd,EAAMnR,GAAO/L,KAAK2sI,MAAOrlB,EAAO,KAE9C,yBAA0B,SAA4Bv7G,EAAMu7G,EAAOnsG,GACjE,OAAOnb,KAAKkd,EAAMnR,GAAO/L,KAAK2sI,MAAOrlB,EAAOnsG,IAE9C,gBAAiB,SAAqBpP,EAAM4gI,GAC1C,OAAO3sI,KAAKkd,EAAMnR,GAAO4gI,EAAO,GAAI,KAEtC,wBAAyB,SAA2B5gI,EAAM4gI,EAAOrlB,GAC/D,OAAOtnH,KAAKkd,EAAMnR,GAAO4gI,EAAOrlB,EAAO,KAEzC,gCAAiC,SAAiCv7G,EAAM4gI,EAAOrlB,EAAOnsG,GACpF,OAAOnb,KAAKkd,EAAMnR,GAAO4gI,EAAOrlB,EAAOnsG,IAEzC,eAAgB,SAAoBpP,EAAMu7G,GACxC,OAAOtnH,KAAK+L,EAAM/L,KAAK2sI,MAAOrlB,EAAO,KAEvC,uBAAwB,SAA0Bv7G,EAAMu7G,EAAOnsG,GAC7D,OAAOnb,KAAK+L,EAAM/L,KAAK2sI,MAAOrlB,EAAOnsG,IAEvCsmD,KAAM,SAAc11D,GAClB,OAAO/L,KAAK+L,EAAM/L,KAAK2sI,MAAO,GAAI,KAEpC,cAAe,SAAmB5gI,EAAM4gI,GACtC,OAAO3sI,KAAK+L,EAAM4gI,EAAO,GAAI,KAE/B,sBAAuB,SAAyB5gI,EAAM4gI,EAAOrlB,GAC3D,OAAOtnH,KAAK+L,EAAM4gI,EAAOrlB,EAAO,KAElC,8BAA+B,SAA+Bv7G,EAAM4gI,EAAOrlB,EAAOnsG,GAChFwxH,EA0MJ,SAAqBA,GAInB,IAFA,IAAIC,EAAU,GAELluI,EAAI,EAAGA,EAAIiuI,EAAMluI,OAAQC,IAAK,CACrC,IAAImuI,EAAOF,EAAMjuI,GACbouI,OAAU,EACVC,SAAkBF,EAEtB,OAAQE,GACN,IAAK,SAED,IAAIC,EAAKH,EAAK//G,MAAM,MAEpB,GAAkB,IAAdkgH,EAAGvuI,OAML,MAAM6+E,YAAY,yBAA2BuvD,GAL7CA,EAAO,CACL/hG,EAAGkiG,EAAG,GACN5oH,EAAG4oH,EAAG,IASd,IAAK,SAcH,GAbAF,EAAU,CACRhiG,EAAGmiG,EAAa/vH,EAAM2vH,EAAK/hG,IAC3B1mB,EAAG6oH,EAAa/vH,EAAM2vH,EAAKzoH,KAGzByoH,EAAK7jB,UACP8jB,EAAQzzE,SAAWwzE,EAAK7jB,SAGtB6jB,EAAKxzE,WACPyzE,EAAQzzE,SAAWn8C,EAAM2vH,EAAKxzE,WAG5B+wE,EAAc0C,EAAQhiG,GAAI,CAC5B,IAAI4/F,EAAWH,EAAuBuC,EAAQhiG,GAE1CoiG,EAgCL,IAAIxR,EAAW,KAAOyR,KA9BrBL,EAAQM,SAAW,GACnBN,EAAQM,SAAStiG,EAAI4/F,EAAS,CAACoC,EAAQhiG,EAAEm5D,QAASipC,IAGlDzpD,EAAQqpD,EAAQM,SAAStiG,GACzB2/F,EAAWqC,EAAQM,SAAStiG,GAC5BgiG,EAAQM,SAAShpH,EAAIsmH,EAAS,CAACoC,EAAQ1oH,EAAG8oH,IAG5C,MAEF,IAAK,WACHJ,EAAUD,EACV,MAEF,QACE,MAAMpsI,UAAU,6BAA+BssI,GAKnDH,EAAQprI,KAAKsrI,GAGf,OAAOF,EA/QGS,CAAYV,GAQpB,IAPA,IAAIl6D,EAAMvzE,EAAQ6M,EAAMu7G,GAEpB1nC,EAAU,GACVhmE,GAFJ64D,EAAMw6D,EAAax6D,IAELhtE,SAAS,CACrB4sH,YAAa,SAGPzyC,EAAQhmE,IAAM,CACpBgmE,EAAQhmE,IAAO,EACfuzH,EAAW,EAEX,IAAK,IAAIzuI,EAAI,EAAGA,EAAIiuI,EAAMluI,OAAQC,IACR,mBAAbiuI,EAAMjuI,GACf+zE,EAAMk6D,EAAMjuI,GAAG+zE,EAAKt3D,IAEpBsoE,EAAQhR,GACRA,EAAM66D,EAAU76D,EAAKk6D,EAAMjuI,KAG7BksI,EAAWn4D,GAGb74D,EAAM64D,EAAIhtE,SAAS,CACjB4sH,YAAa,QAIjB,OAAO5/C,KAMX,SAASw6D,EAAa5/G,GACpB,OAAOA,EAAK/I,WAAU,SAAU+I,EAAM3U,EAAMvD,GAC1C,OAAO,EAAA2yG,EAAA,IAAkBz6F,GAAQ4/G,EAAa5/G,EAAKjB,SAAWiB,KALlE+rD,EAAS4xD,aAAeA,EACxB5xD,EAASl6E,QAAUA,EASnB,IAAIquI,EAAsB,CACxBzgB,MAAM,EACNC,OAAO,EACP5rH,GAAG,EACHzC,GAAG,EACH2/E,UAAU,EACV0kD,KAAK,EACLtrC,MAAM,EACNurC,OAAO,EACPC,QAAQ,EACRhkD,KAAK,EACLqtC,KAAK,EACL7oB,IAAI,EACJy/B,SAAS,EACTC,OAAO,EACPjX,KAAK,GAcP9yC,EAASuzD,MAAQ,CAAC3B,EAOlB,CACElgG,EAAG,SACH1mB,EAAG,KAEL,CACE0mB,EAAG,OACH1mB,EAAG,SAEL,CACE0mB,EAAG,SACH1mB,EAAG,YAEL,CACE0mB,EAAG,KACH1mB,EAAG,YACF,CACD0mB,EAAG,UACH1mB,EAAG,YAEL,CACE0mB,EAAG,OACH1mB,EAAG,WAEL,CACE0mB,EAAG,gBACH1mB,EAAG,iBAEL,CACE0mB,EAAG,MACH1mB,EAAG,OACF,CACD0mB,EAAG,WACH1mB,EAAG,YACF,CACD0mB,EAAG,cACH1mB,EAAG,aAEL,CACE0mB,EAAG,MACH1mB,EAAG,OACF,CACD0mB,EAAG,OACH1mB,EAAG,KACF,CACD0mB,EAAG,aACH1mB,EAAG,aACF,CACD0mB,EAAG,gBACH1mB,EAAG,cAEL,CACE0mB,EAAG,sBACH1mB,EAAG,0BACFsoH,EAAkB,CACnB5hG,EAAG,UACH1mB,EAAG,WAGL,CACE0mB,EAAG,MACH1mB,EAAG,MACH4kG,QAAS,CACPz8G,IAAK,CACH29H,aAAa,KAGhB,CACDp/F,EAAG,MACH1mB,EAAG,MACH4kG,QAAS,CACPxkG,SAAU,CACR0lH,aAAa,KAKnB,CACEp/F,EAAG,QACH1mB,EAAG,QAEL,CACE0mB,EAAG,YACH1mB,EAAG,QAEL,CACE0mB,EAAG,WACH1mB,EAAG,WACF,CACD0mB,EAAG,QACH1mB,EAAG,QACF,CACD0mB,EAAG,YACH1mB,EAAG,aAEL,CACE0mB,EAAG,YACH1mB,EAAG,WAIL,CACE0mB,EAAG,MACH1mB,EAAG,KAEL,CACE0mB,EAAG,aACH1mB,EAAG,eA2FL,IAAI+oH,EAAW,EAaf,IAAIG,EAAY7U,EAAM,YAAa,CACjC,eAAgB,SAAoBprG,EAAMw/G,GAGxC,IAAIp6D,EAAMplD,EAIV,GAAIolD,aAAemjD,GAAgBnjD,aAAeqpD,GAChD,GAAIrpD,EAAIxyE,KACN,IAAK,IAAIvB,EAAI,EAAGA,EAAI+zE,EAAIxyE,KAAKxB,OAAQC,IACnC+zE,EAAIxyE,KAAKvB,GAAK4uI,EAAU76D,EAAIxyE,KAAKvB,GAAImuI,QAGhCp6D,aAAe0/C,GACpB1/C,EAAIrmD,UACNqmD,EAAIrmD,QAAUkhH,EAAU76D,EAAIrmD,QAASygH,IAKzC,IAAIW,EAAOX,EAAKzoH,EAEZqpH,EAAUC,EAAWb,EAAK/hG,EAAG2nC,GAAK,GAStC,IALKg7D,GAAWZ,EAAKO,WACnBI,EAAOX,EAAKO,SAAShpH,EACrBqpH,EAAUC,EAAWb,EAAKO,SAAStiG,EAAG2nC,GAAK,IAGzCg7D,EAAS,CAIX,IAAI3X,EAAWrjD,EAAIqjD,SACnBrjD,EAAM+6D,EAAKvpC,QAEP6xB,GAAY,aAAc0X,IAC5B/6D,EAAIqjD,UAAW,GAIjBrjD,EAAMA,EAAInuD,WAAU,SAAU+I,GAC5B,OAAIA,EAAKsuG,eAAgB,QAAe8R,EAAQE,aAActgH,EAAK3nB,MAC1D+nI,EAAQE,aAAatgH,EAAK3nB,MAAMu+F,QAEhC52E,KAMb,OAAOolD,KAqCX,SAASm7D,EAAWC,EAAQC,GAC1B,IAAIr7D,EAAM,CACRk7D,aAAc,IAGhB,IAAKE,EAAOF,eAAiBG,EAAOH,aAClC,OAAOl7D,EACF,IAAKo7D,EAAOF,aACjB,OAAOG,EACF,IAAKA,EAAOH,aACjB,OAAOE,EAIT,IAAK,IAAIvuI,KAAOuuI,EAAOF,aACrB,IAAI,QAAeE,EAAOF,aAAcruI,KACtCmzE,EAAIk7D,aAAaruI,GAAOuuI,EAAOF,aAAaruI,IAExC,QAAewuI,EAAOH,aAAcruI,KACjCyuI,EAAYF,EAAOF,aAAaruI,GAAMwuI,EAAOH,aAAaruI,KAC7D,OAAO,KAMf,IAAK,IAAI2yH,KAAQ6b,EAAOH,cAClB,QAAeG,EAAOH,aAAc1b,KACtCx/C,EAAIk7D,aAAa1b,GAAQ6b,EAAOH,aAAa1b,IAIjD,OAAOx/C,EAQT,SAASu7D,EAAoBC,EAAOC,GAClC,IAMI5gD,EANA7a,EAAM,GAEV,GAAqB,IAAjBw7D,EAAMxvI,QAAiC,IAAjByvI,EAAMzvI,OAC9B,OAAOg0E,EAKT,IAAK,IAAI07D,EAAK,EAAGA,EAAKF,EAAMxvI,OAAQ0vI,IAClC,IAAK,IAAIC,EAAK,EAAGA,EAAKF,EAAMzvI,OAAQ2vI,KAClC9gD,EAASsgD,EAAWK,EAAME,GAAKD,EAAME,MAGnC37D,EAAIjxE,KAAK8rF,GAKf,OAAO7a,EAsCT,SAASi7D,EAAWb,EAAMx/G,EAAMghH,GAK9B,IAAI57D,EAAM,CAAC,CACTk7D,aAAc,KAGhB,GAAId,aAAgBjX,GAAgBvoG,aAAgBuoG,GAAgBiX,aAAgB/Q,GAAgBzuG,aAAgByuG,EAAc,CAEhI,GAAI+Q,aAAgBjX,GAClB,GAAIiX,EAAKhX,KAAOxoG,EAAKwoG,IAAMgX,EAAK9sI,KAAOstB,EAAKttB,GAC1C,MAAO,QAEJ,GAAI8sI,aAAgB/Q,GACrB+Q,EAAKnnI,OAAS2nB,EAAK3nB,KACrB,MAAO,GAKX,KAAyB,IAArB2nB,EAAKptB,KAAKxB,QAAqC,IAArBouI,EAAK5sI,KAAKxB,SAAiB2rI,EAAc/8G,IAASA,EAAKptB,KAAKxB,SAAWouI,EAAK5sI,KAAKxB,QAAU4vI,GAiBlH,IAAIhhH,EAAKptB,KAAKxB,QAAU,GAA0B,IAArBouI,EAAK5sI,KAAKxB,OAAc,CAO1D,IAHA,IAAI6vI,EArKV,SAAmBjhH,EAAM27F,GACvB,IACI1yG,EAAOi4H,EADP97D,EAAM,GAENi4D,EAAWH,EAAuBl9G,GAEtC,GAAIm9G,EAAcn9G,EAAM27F,GACtB,IAAK,IAAItqH,EAAI,EAAGA,EAAI2uB,EAAKptB,KAAKxB,OAAQC,KACpC6vI,EAAYlhH,EAAKptB,KAAK6E,MAAM,IAClBw8G,OAAO5iH,EAAG,GACpB4X,EAA6B,IAArBi4H,EAAU9vI,OAAe8vI,EAAU,GAAK7D,EAAS6D,GACzD97D,EAAIjxE,KAAKkpI,EAAS,CAACr9G,EAAKptB,KAAKvB,GAAI4X,UAInCA,EAA6B,KAD7Bi4H,EAAYlhH,EAAKptB,KAAK6E,MAAM,IACVrG,OAAe8vI,EAAU,GAAK7D,EAAS6D,GACzD97D,EAAIjxE,KAAKkpI,EAAS,CAACr9G,EAAKptB,KAAK,GAAIqW,KAGnC,OAAOm8D,EAmJU+7D,CAAUnhH,EAAMw/G,EAAK7jB,SAC9BylB,EAAe,GAEVjqI,EAAK,EAAGA,EAAK8pI,EAAO7vI,OAAQ+F,IAAM,CACzC,IAAIkqI,EAAWhB,EAAWb,EAAMyB,EAAO9pI,IAAK,GAG5CiqI,EAAeA,EAAa/iI,OAAOgjI,GAGrC,OAAOD,EACF,GAAI5B,EAAK5sI,KAAKxB,OAAS,EAC5B,MAAM0N,MAAM,+CAAiD0gI,EAAKpnI,YAGlE,MAAO,GAhCP,IAFA,IAAIkpI,EAAe,GAEVjwI,EAAI,EAAGA,EAAImuI,EAAK5sI,KAAKxB,OAAQC,IAAK,CACzC,IAAIkwI,EAAalB,EAAWb,EAAK5sI,KAAKvB,GAAI2uB,EAAKptB,KAAKvB,IAEpD,GAA0B,IAAtBkwI,EAAWnwI,OAEb,MAAO,GAITkwI,EAAantI,KAAKotI,GAGpBn8D,EAnEN,SAA2Bk8D,GACzB,GAA4B,IAAxBA,EAAalwI,OACf,OAAOkwI,EAOT,IAJA,IAAIE,EAAOF,EAAalnI,OAAOumI,GAC3Bc,EAAa,GACbC,EAAS,GAEJrwI,EAAI,EAAGA,EAAImwI,EAAKpwI,OAAQC,IAAK,CACpC,IAAIqnC,EAAIn6B,KAAKC,UAAUgjI,EAAKnwI,IAEvBqwI,EAAOhpG,KACVgpG,EAAOhpG,IAAK,EACZ+oG,EAAWttI,KAAKqtI,EAAKnwI,KAIzB,OAAOowI,EAiDGE,CAAkBL,QAsBrB,GAAI9B,aAAgBnR,EAAY,CAKrC,GAAyB,IAArBmR,EAAKnnI,KAAKjH,OACZ,MAAM,IAAI0N,MAAM,oCAGlB,GAAIohI,EAAoBV,EAAKnnI,OAE3B,GAAImnI,EAAKnnI,OAAS2nB,EAAK3nB,KACrB,MAAO,QAEJ,GAAqB,MAAjBmnI,EAAKnnI,KAAK,IAA4C,OAA9BmnI,EAAKnnI,KAAKusC,UAAU,EAAG,GAIxDwgC,EAAI,GAAGk7D,aAAad,EAAKnnI,MAAQ2nB,OAC5B,GAAqB,MAAjBw/G,EAAKnnI,KAAK,GAAY,CAE/B,IAAK,EAAAoiH,EAAA,IAAez6F,GAIlB,MAAO,GAHPolD,EAAI,GAAGk7D,aAAad,EAAKnnI,MAAQ2nB,MAK9B,IAAqB,MAAjBw/G,EAAKnnI,KAAK,GASnB,MAAM,IAAIyG,MAAM,2BAA6B0gI,EAAKnnI,MAPlD,KAAI2nB,aAAgBmkG,GAIlB,MAAO,GAHP/+C,EAAI,GAAGk7D,aAAad,EAAKnnI,MAAQ2nB,OAQhC,MAAIw/G,aAAgBrb,GAOzB,MAAO,GALP,IAAKvD,EAAM4e,EAAKptI,MAAO4tB,EAAK5tB,OAC1B,MAAO,GASX,OAAOgzE,EAWT,SAASs7D,EAAYjqI,EAAGi7F,GACtB,GAAIj7F,aAAa0tH,GAAgBzyB,aAAayyB,GAC5C,IAAKvD,EAAMnqH,EAAErE,MAAOs/F,EAAEt/F,OACpB,OAAO,OAEJ,GAAIqE,aAAa43H,GAAc38B,aAAa28B,GACjD,GAAI53H,EAAE4B,OAASq5F,EAAEr5F,KACf,OAAO,MAEJ,MAAI5B,aAAa8xH,GAAgB72B,aAAa62B,GAAgB9xH,aAAag4H,GAAgB/8B,aAAa+8B,GAqB7G,OAAO,EApBP,GAAIh4H,aAAa8xH,GACf,GAAI9xH,EAAE+xH,KAAO92B,EAAE82B,IAAM/xH,EAAE/D,KAAOg/F,EAAEh/F,GAC9B,OAAO,OAEJ,GAAI+D,aAAag4H,GAClBh4H,EAAE4B,OAASq5F,EAAEr5F,KACf,OAAO,EAIX,GAAI5B,EAAE7D,KAAKxB,SAAWsgG,EAAE9+F,KAAKxB,OAC3B,OAAO,EAGT,IAAK,IAAIC,EAAI,EAAGA,EAAIoF,EAAE7D,KAAKxB,OAAQC,IACjC,IAAKqvI,EAAYjqI,EAAE7D,KAAKvB,GAAIqgG,EAAE9+F,KAAKvB,IACjC,OAAO,EAOb,OAAO,EAGT,OAAO06E,K,WCvyBL,GAAO,cACP,GAAe,CAAC,SAAU,QAAS,QAAS,SAAU,MAAO,WAAY,WAAY,SAAU,MAAO,QAAS,WAAY,aAAc,YAAa,oBAAqB,eAAgB,eAAgB,eAAgB,aAAc,mBAClO61D,IAAmC,EAAA7nB,EAAA,IAAQ,GAAM,IAAepiB,IACzE,IAAI,OACFp8E,EAAM,MACN6vG,EAAK,MACLxK,EAAK,OACL3yB,EAAM,IACN/uF,EAAG,SACHg1F,EAAQ,SACR/8E,EAAQ,OACRg3E,EAAM,IACN7zF,EAAG,MACHuV,EAAK,SACLk8D,EAAQ,SACRypD,EAAQ,UACR9R,EAAS,kBACT1J,EAAiB,aACjBmK,EAAY,aACZoE,EAAY,aACZkG,EAAY,WACZJ,EAAU,gBACVvJ,GACEntB,EACA0nC,EAAmBpB,GAAuB,CAC5C7S,QACA7vG,SACAy+F,oBACAwb,WACA9R,YACAS,eACAoE,eACAkG,eACAJ,eAEEsP,EAAeH,GAAmB,CACpC5c,QACA3yB,SACA/uF,MACAg1F,WACA/8E,WACAg3E,SACA7zF,MACA6pH,eACAoE,eACAkG,eACA3J,oBAwDF,OAAOsG,EAAM,GAAM,CACjBve,OAAQ,SAAgBnuG,GACtB,OAAO/L,KAAKkd,EAAMnR,GAAO,IAAI,IAE/B,kBAAmB,SAAuBA,EAAMmjI,GAC9C,OAAOlvI,KAAKkd,EAAMnR,GAAO,GAAImjI,IAE/B,iBAAkB,SAAsBnjI,EAAMu7G,GAC5C,OAAOtnH,KAAKkd,EAAMnR,GAAOu7G,GAAO,IAElC,0BAA2B,SAA6Bv7G,EAAMu7G,EAAO4nB,GACnE,OAAOlvI,KAAKkd,EAAMnR,GAAOu7G,EAAO4nB,IAElCztE,KAAM,SAAc11D,GAClB,OAAO/L,KAAK+L,EAAM,IAAI,IAExB,gBAAiB,SAAqBA,EAAMmjI,GAC1C,OAAOlvI,KAAK+L,EAAM,GAAImjI,IAExB,eAAgB,SAAoBnjI,EAAMu7G,GACxC,OAAOtnH,KAAK+L,EAAMu7G,GAAO,IAE3B,wBAAyB,SAA2Bv7G,EAAMu7G,EAAO4nB,GAC/D,IAAIC,EAgMR,WACE,IAAIC,EAAW,CAACpE,EAChB,CACElgG,EAAG,MACH1mB,EAAG,OACF,CACD0mB,EAAG,OACH1mB,EAAG,KACFsoH,EACH,CACE5hG,EAAG,YACH1mB,EAAG,QACF,CACD0mB,EAAG,WACH1mB,EAAG,WACF,CACD0mB,EAAG,QACH1mB,EAAG,QACF,CACD0mB,EAAG,YACH1mB,EAAG,aACF,CACD0mB,EAAG,MACH1mB,EAAG,MAEDirH,EAAa,CAAC,CAChBvkG,EAAG,cACH1mB,EAAG,SAEL,CACE0mB,EAAG,cACH1mB,EAAG,SAEL,CACE0mB,EAAG,SACH1mB,EAAG,SAEL,CACE0mB,EAAG,QACH1mB,EAAG,YAEL,CACE0mB,EAAG,aACH1mB,EAAG,mBAEL,CACE0mB,EAAG,aACH1mB,EAAG,iBAEL,CACE0mB,EAAG,cACH1mB,EAAG,aAEL,CACE0mB,EAAG,WACH1mB,EAAG,YAEL,CACE0mB,EAAG,cACH1mB,EAAG,aAEL,CACE0mB,EAAG,WACH1mB,EAAG,YAEL,CACE0mB,EAAG,MACH1mB,EAAG,WAEL,CACE0mB,EAAG,OACH1mB,EAAG,YAEL,CACE0mB,EAAG,QACH1mB,EAAG,OAEL,CACE0mB,EAAG,OACH1mB,EAAG,QAEL,CACE0mB,EAAG,OACH1mB,EAAG,QAEL,CACE0mB,EAAG,MACH1mB,EAAG,OAEL,CACE0mB,EAAG,YACH1mB,EAAG,WAEL,CACE0mB,EAAG,WACH1mB,EAAG,YAEL,CACE0mB,EAAG,YACH1mB,EAAG,WAEL,CACE0mB,EAAG,WACH1mB,EAAG,YAEL,CACE0mB,EAAG,aACH1mB,EAAG,gBAEL,CACE0mB,EAAG,YACH1mB,EAAG,WAEL,CACE0mB,EAAG,WACH1mB,EAAG,aAgBDkrH,EAAc,CAAC,CACjBxkG,EAAG,eACH1mB,EAAG,gBAEL,CACE0mB,EAAG,aACH1mB,EAAG,iBAED+qH,EAAW,GA8Ff,OA1FAA,EAASI,WAAaH,EAAS1jI,OAAO2jI,EAAYC,GAElDH,EAASK,cA3BW,CAAC,CACnB1kG,EAAG,kBACH1mB,EAAG,6BAEL,CACE0mB,EAAG,eACH1mB,EAAG,qBAEL,CACE0mB,EAAG,eACH1mB,EAAG,sBAmBL+qH,EAASM,YAAcH,EAEvBH,EAASO,gBAAkBN,EAAS1jI,OAAO2jI,GAK3CF,EAASQ,WAAa,CAAC3E,EACvB,CACElgG,EAAG,OACH1mB,EAAG,QAEL,CACE0mB,EAAG,MACH1mB,EAAG,OAELsoH,EACA,CACE5hG,EAAG,UACH1mB,EAAG,aAEL,CACE0mB,EAAG,SACH1mB,EAAG,YAEL,CACE0mB,EAAG,aACH1mB,EAAG,cAEL,CACE0mB,EAAG,YACH1mB,EAAG,aAEL,CACE0mB,EAAG,UACH1mB,EAAG,aAEL,CACE0mB,EAAG,SACH1mB,EAAG,YAEL,CACE0mB,EAAG,UACH1mB,EAAG,aAEL,CACE0mB,EAAG,SACH1mB,EAAG,YAEL,CACE0mB,EAAG,UACH1mB,EAAG,aAEL,CACE0mB,EAAG,SACH1mB,EAAG,YAEL,CACE0mB,EAAG,aACH1mB,EAAG,aAEL,CACE0mB,EAAG,YACH1mB,EAAG,aAEL,CACE0mB,EAAG,cACH1mB,EAAG,YAEL,CACE0mB,EAAG,SACH1mB,EAAG,QAEL,CACE0mB,EAAG,SACH1mB,EAAG,SAEL,CACE0mB,EAAG,MACH1mB,EAAG,OAEL,CACE0mB,EAAG,aACH1mB,EAAG,iBAGE+qH,EAzaUS,GAEXC,EA0GR,SAAoB9jI,EAAMu7G,EAAOwoB,EAAUnD,GACzC,IAAIoD,EAAY,GACZ1iH,EAAO+rD,EAASrtE,EAAM4gI,EAAOrlB,EAAO,CACtCykB,gBAAgB,IAIdiE,EAAO,QADXF,IAAaA,GACkB,IAAM,KAuBrC,SAASG,EAAQ5iH,GACf,IAAI6iH,EAAK7iH,EAAKvV,KAEd,GAAW,iBAAPo4H,EAEF,MAAM,IAAI/jI,MAAM,sCACX,GAAW,iBAAP+jI,EACT,GAAgB,MAAZ7iH,EAAKwoG,GAAY,CAEnB,GAA0B,iBAAtBxoG,EAAKptB,KAAK,GAAG6X,QAA4B,QAAUuN,WAAWgI,EAAKptB,KAAK,GAAGR,QAC7E,MAAM,IAAI0M,MAAM,mCAEhB8jI,EAAQ5iH,EAAKptB,KAAK,QAEf,CACL,IAA+B,IAA3B+vI,EAAK1nI,QAAQ+kB,EAAKwoG,IACpB,MAAM,IAAI1pH,MAAM,YAAckhB,EAAKwoG,GAAK,qCAG1C,IAAK,IAAIn3H,EAAI,EAAGA,EAAI2uB,EAAKptB,KAAKxB,OAAQC,IACpCuxI,EAAQ5iH,EAAKptB,KAAKvB,SAIjB,GAAW,eAAPwxI,EAAqB,CAC9B,IAAIxb,EAAQrnG,EAAK3nB,MAIJ,IAFHqqI,EAAUznI,QAAQosH,IAI1Bqb,EAAUvuI,KAAKkzH,QAEZ,GAAW,oBAAPwb,EACTD,EAAQ5iH,EAAKjB,cACR,GAAW,iBAAP8jH,EACT,MAAM,IAAI/jI,MAAM,QAAU+jI,EAAK,4CA1DnCD,CAAQ5iH,GACR,IAAI8iH,EAAU,GAGd,OAFAA,EAAQvb,WAAavnG,EACrB8iH,EAAQJ,UAAYA,EACbI,EAtHSC,CAAWrkI,EAAMu7G,GAAO,EAAM6nB,EAASI,YAEjDc,EAAQR,EAAQE,UAAUtxI,OAG9B,GAFAsN,EAAO8jI,EAAQjb,WAEXyb,GAAS,EAAG,CAId,IAAIC,EAEA3D,EAJJ5gI,EAAOwkI,EAAYxkI,GAKnB,IAMIg6B,EANAyqG,GAAY,EACZC,GAAW,EAOf,IANA1kI,EAAOqtE,EAASrtE,EAAMojI,EAASI,WAAY,GAAI,CAC7CxD,gBAAgB,IAOhBY,EAAQ6D,EAAYrB,EAASK,cAAgBL,EAASM,YAGtDe,GAAaA,GAEbzqG,GAJAh6B,EAAOqtE,EAASrtE,EAAM4gI,IAIblnI,cAEC6qI,GAIVG,GAAW,EACXH,EAAUvqG,EAGR0qG,IAEF1kI,EAAOqtE,EAASrtE,EAAMojI,EAASO,gBAAiB,GAAI,CAClD3D,gBAAgB,KAIpBhgI,EAAOqtE,EAASrtE,EAAMojI,EAASQ,WAAY,GAAI,CAC7C5D,gBAAgB,IAKpB,IAAI2E,EAAe,GACfC,EAAiB,GAyBrB,MAvBkB,iBAAd5kI,EAAK+L,MAA2B/L,EAAK0sF,YAA0B,MAAZ1sF,EAAK8pH,IAE5C,IAAVwa,IACFtkI,EAAK9L,KAAK,GAAK2wI,EAAgB7kI,EAAK9L,KAAK,GAAIywI,GAC7C3kI,EAAK9L,KAAK,GAAK2wI,EAAgB7kI,EAAK9L,KAAK,KAGvCivI,IACFyB,EAAe7mI,UAAYiC,EAAK9L,KAAK,GACrC0wI,EAAe5mI,YAAcgC,EAAK9L,KAAK,MAG3B,IAAVowI,IACFtkI,EAAO6kI,EAAgB7kI,EAAM2kI,IAG3BxB,IACFyB,EAAe7mI,UAAYiC,EAC3B4kI,EAAe5mI,YAAc,OAK5BmlI,GACLyB,EAAeD,aAAeA,EAC9BC,EAAeZ,UAAYF,EAAQE,UACnCY,EAAe/b,WAAa7oH,EACrB4kI,GAJe5kI,KAgX1B,SAASwkI,EAAYljH,EAAMlY,EAAQ07H,GACjC,IAAIX,EAAK7iH,EAAKvV,KACVg5H,EAAW5wI,UAAUzB,OAAS,EAElC,GAAW,iBAAPyxI,GAAyB7iH,EAAKorE,WAAY,CAC5C,IACIjjF,EADAu7H,GAAO,EAYX,GATgB,MAAZ1jH,EAAKwoG,KAEoB,oBAAtBxoG,EAAKptB,KAAK,GAAG6X,MAAoD,iBAAtBuV,EAAKptB,KAAK,GAAG6X,MAAkD,iBAAtBuV,EAAKptB,KAAK,GAAG6X,OAGpGi5H,GADAv7H,EAAM6P,WAAWgI,EAAKptB,KAAK,GAAGR,SAChB,IAAK,QAAU+V,KAI7Bu7H,EAAM,CAOR,GAAIv7H,EAAM,EAAG,CASX,IAAIw7H,EAAW3jH,EAAKptB,KAAK,GACrBgxI,EAAW,IAAIrb,EAAa,IAAK,MAAO,CAACvoG,EAAKptB,KAAK,GAAGyoF,YAAa,IAAI8oC,EAAah8G,EAAM,KAC9F6X,EAAO,IAAIuoG,EAAa,IAAK,WAAY,CAACob,EAAUC,SAQpD5jH,EAAO,IAAIuoG,EAAa,IAAK,WAAY,CAACvoG,EAAKptB,KAAK,GAAIotB,EAAKptB,KAAK,GAAGyoF,cAGnEooD,IAEgB,YAAdD,EACF17H,EAAOiX,QAAUiB,EAEjBlY,EAAOlV,KAAK4wI,GAAaxjH,IAQjC,GAAW,oBAAP6iH,EAEFK,EAAYljH,EAAKjB,QAASiB,EAAM,gBAC3B,GAAW,iBAAP6iH,GAAgC,eAAPA,EAClC,IAAK,IAAIxxI,EAAI,EAAGA,EAAI2uB,EAAKptB,KAAKxB,OAAQC,IACpC6xI,EAAYljH,EAAKptB,KAAKvB,GAAI2uB,EAAM3uB,GAIpC,IAAKoyI,EAEH,OAAOzjH,EA6BX,SAASujH,EAAgBvjH,EAAMqjH,QACRrwI,IAAjBqwI,IACFA,EAAe,IAIjBA,EAAa,GAAK,EAElB,IAMIQ,EAAU,EAEVC,EAAU,IA+Dd,SAASC,EAAS/jH,EAAMgkH,EAAOhuI,GAC7B,IAAI6sI,EAAK7iH,EAAKvV,KAEd,GAAW,iBAAPo4H,EAGF,MAAM,IAAI/jI,MAAM,sCACX,GAAW,iBAAP+jI,EAAuB,CAEhC,IAAiC,IAA7B,OAAO5nI,QAAQ+kB,EAAKwoG,IAAY,MAAM,IAAI1pH,MAAM,YAAckhB,EAAKwoG,GAAK,YAE5E,GAAc,OAAVwb,EAAgB,CAElB,IAAiB,eAAZhkH,EAAKttB,IAAmC,QAAZstB,EAAKttB,KAA8B,QAAbsxI,EAAMtxI,IAA6B,aAAbsxI,EAAMtxI,IAAkC,aAAbsxI,EAAMtxI,GAC5G,MAAM,IAAIoM,MAAM,WAAakhB,EAAKwoG,GAAK,YAIzC,IAAiB,aAAZxoG,EAAKttB,IAAiC,QAAZstB,EAAKttB,IAA4B,aAAZstB,EAAKttB,KAAmC,QAAbsxI,EAAMtxI,IAA6B,aAAbsxI,EAAMtxI,GACzG,MAAM,IAAIoM,MAAM,WAAakhB,EAAKwoG,GAAK,YAIzC,IAAiB,aAAZxoG,EAAKttB,IAAiC,QAAZstB,EAAKttB,IAA4B,eAAZstB,EAAKttB,KAAoC,IAAZsD,EAAEiuI,MACjF,MAAM,IAAInlI,MAAM,WAAakhB,EAAKwoG,GAAK,YAM3B,MAAZxoG,EAAKwoG,IAA0B,MAAZxoG,EAAKwoG,KAC1BxyH,EAAEkuI,KAAOlkH,EAAKwoG,IAGhB,IAAK,IAAIrxH,EAAK,EAAGA,EAAK6oB,EAAKptB,KAAKxB,OAAQ+F,IAEtB,eAAZ6oB,EAAKttB,KAAqBsD,EAAE2sI,KAAO,KAEvB,MAAZ3iH,EAAKwoG,IAA0B,aAAZxoG,EAAKttB,KAC1BsD,EAAEkuI,KAAO,GACTluI,EAAEmuI,IAAM,EAERnuI,EAAE2sI,KAAc,IAAPxrI,EAAW,IAAM6oB,EAAKwoG,IAGjCxyH,EAAEiuI,MAAQ9sI,EAEV4sI,EAAS/jH,EAAKptB,KAAKuE,GAAK6oB,EAAMhqB,QAG3B,GAAW,eAAP6sI,EAAqB,CAE9B,GAAI7iH,EAAK3nB,OAASyrI,GAAuB,KAAZA,EAC3B,MAAM,IAAIhlI,MAAM,mCAKlB,GAFAglI,EAAU9jH,EAAK3nB,KAED,OAAV2rI,EAEF,YADAX,EAAa,GAAK,GAKpB,GAAiB,MAAbW,EAAMxb,IAA0B,IAAZxyH,EAAEiuI,MACxB,MAAM,IAAInlI,MAAM,uDAIlB,GAAiB,MAAbklI,EAAMxb,IAA0B,IAAZxyH,EAAEiuI,MACxB,MAAM,IAAInlI,MAAM,2DAIH,KAAX9I,EAAEkuI,MAA0B,MAAXluI,EAAEkuI,OACjBL,EAAU,IAAGR,EAAa,GAAK,GACnCA,EAAa,IAAMrtI,EAAEmuI,KAAkB,MAAXnuI,EAAE2sI,KAAe,GAAK,GAClDkB,EAAUlrI,KAAKyJ,IAAI,EAAGyhI,QAEnB,IAAW,iBAAPhB,EAgCT,MAAM,IAAI/jI,MAAM,QAAU+jI,EAAK,mBA/B/B,IAAIuB,EAAQpsH,WAAWgI,EAAK5tB,OAE5B,GAAc,OAAV4xI,EAEF,YADAX,EAAa,GAAKe,GAIpB,GAAiB,MAAbJ,EAAMxb,GAAY,CAEpB,GAAgB,IAAZxyH,EAAEiuI,MAAa,MAAM,IAAInlI,MAAM,8BAEnC,KAAK,QAAUslI,IAAUA,GAAS,EAChC,MAAM,IAAItlI,MAAM,uCAGlB,IAAK,IAAIulI,EAAMR,EAAU,EAAGQ,EAAMD,EAAOC,IACvChB,EAAagB,GAAO,EAMtB,OAHID,EAAQP,IAASR,EAAae,GAAS,GAC3Cf,EAAae,IAAUpuI,EAAEmuI,KAAkB,MAAXnuI,EAAE2sI,KAAe,GAAK,QACtDkB,EAAUlrI,KAAKyJ,IAAIgiI,EAAOP,IAI5B7tI,EAAEmuI,IAAMC,EAEO,KAAXpuI,EAAEkuI,OACJb,EAAa,IAAMrtI,EAAEmuI,KAAkB,MAAXnuI,EAAE2sI,KAAe,GAAK,KAzKxDoB,CAAS/jH,EAAM,KAVP,CACR,IAAQ,EACR,KAAS,IAGT,KAAS,KAUT,IAHA,IACIskH,EADAp4D,GAAQ,EAGH76E,EAJTwyI,EAAUR,EAAajyI,OAAS,EAIVC,GAAK,EAAGA,IAC5B,GAAwB,IAApBgyI,EAAahyI,GAAjB,CACA,IAAI0hG,EAAK,IAAIoxB,EAAaj4C,EAAQm3D,EAAahyI,GAAKsH,KAAKgE,IAAI0mI,EAAahyI,KACtEm3H,EAAK6a,EAAahyI,GAAK,EAAI,IAAM,IAErC,GAAIA,EAAI,EAAG,CAET,IAAIkzI,EAAK,IAAIlW,EAAWyV,GAExB,GAAIzyI,EAAI,EAAG,CACT,IAAImzI,EAAK,IAAIrgB,EAAa9yH,GAC1BkzI,EAAK,IAAIhc,EAAa,IAAK,MAAO,CAACgc,EAAIC,IAIvCzxC,GADuB,IAArBswC,EAAahyI,IAAa66E,EACvB,IAAIq8C,EAAa,IAAK,aAAc,CAACgc,IACH,IAA9B5rI,KAAKgE,IAAI0mI,EAAahyI,IAC1BkzI,EAEA,IAAIhc,EAAa,IAAK,WAAY,CAACx1B,EAAIwxC,IAK9CD,EADEp4D,EACG6mB,EACW,MAAPy1B,EACJ,IAAID,EAAa,IAAK,MAAO,CAAC+b,EAAIvxC,IAElC,IAAIw1B,EAAa,IAAK,WAAY,CAAC+b,EAAIvxC,IAG9C7mB,GAAQ,EAIV,OAAIA,EACK,IAAIi4C,EAAa,GAEjBmgB,MC9tBT,GAAO,SACP,GAAe,CAAC,QAAS,UAClBG,IAA8B,EAAA1qB,EAAA,IAAQ,GAAM,IAAepiB,IACpE,IAAI,MACFyzB,EAAK,OACL4J,GACEr9B,EA6CJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,OAAO,IAAI4J,QCnDb,GAAe,CAAC,QAAS,SAAU,QAAS,WAAY,QAAS,SAAU,UAAW,eAAgB,eAAgB,eAAgB,kBAAmB,cAClJ0P,IAAkC,EAAA3qB,EAAA,IAFlC,aAEgD,IAAepiB,IACxE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,MACN1L,EAAK,SACLk8D,EAAQ,MACR60C,EAAK,OACL3yB,EAAM,QACNw1B,EAAO,aACPU,EAAY,aACZsK,EAAY,aACZlG,EAAY,gBACZzD,EAAe,WACfuJ,GACE12B,EAwCAshC,EAAa7N,EAAM,aAAc,CACnC,2BAA4B,SAA8B1sH,EAAMimI,EAAU72H,GACxE,IAAI82H,EAAa,GACjBC,EAASD,EAAYlmI,EAAMimI,EAAStsI,MAEpC,IAAI+sE,EAAM0/D,EAAYpmI,EAAMkmI,GAE5B,OAAO92H,EAAQi+D,SAAWA,EAAS3G,GAAOA,GAE5C,mBAAoB,SAAwB1mE,EAAMimI,GAChD,OAAOhyI,KAAK+L,EAAMimI,EAAU,CAC1B54D,UAAU,KAGd,qBAAsB,SAA0BrtE,EAAMimI,GACpD,OAAOhyI,KAAKkd,EAAMnR,GAAOimI,IAE3B,6BAA8B,SAAgCjmI,EAAMimI,EAAU72H,GAC5E,OAAOnb,KAAKkd,EAAMnR,GAAOimI,EAAU72H,IAErC,iBAAkB,SAAsBpP,EAAMimI,GAC5C,OAAOhyI,KAAKkd,EAAMnR,GAAOmR,EAAM80H,KAEjC,yBAA0B,SAA4BjmI,EAAMimI,EAAU72H,GACpE,OAAOnb,KAAKkd,EAAMnR,GAAOmR,EAAM80H,GAAW72H,IAE5C,eAAgB,SAAoBpP,EAAMimI,GACxC,OAAOhyI,KAAK+L,EAAMmR,EAAM80H,KAE1B,uBAAwB,SAA0BjmI,EAAMimI,EAAU72H,GAChE,OAAOnb,KAAK+L,EAAMmR,EAAM80H,GAAW72H,MAgBvCmrH,EAAW8L,WAAY,EAEvB9L,EAAW/d,MAAQ,SAAU8pB,GAC3B,OAAOC,EAAUnyI,MAAM,KAAMkyI,EAAMpyI,OAKrC,IAAIqyI,EAAY7Z,EAAM,YAAa,CACjC,mBAAoB,SAAwB1sH,EAAMvF,GAChD,OAAI,EAAAshH,EAAA,IAAe/7G,IAAgC,YAAvB,QAAOA,EAAKtM,OAC/B6yI,EAAUp1H,EAAMnR,EAAKtM,OAAOgG,WAAYe,EAAEf,WAAY,GAEtD6sI,EAAUvmI,EAAKtG,WAAYe,EAAEf,WAAY,IAGpD,qBAAsB,SAA0BsG,EAAMvF,GACpD,GAAwB,YAApB,QAAOA,EAAE/G,OACX,OAAO6yI,EAAUvmI,EAAMmR,EAAM1W,EAAE/G,QAE/B,MAAM,IAAI0M,MAAM,kEAGpB,iCAAkC,SAAoCJ,EAAMvF,EAAG89E,GAC7E,OAAOguD,EAAUvmI,EAAKtG,WAAYe,EAAEd,KAAM4+E,EAAM7kF,QAElD,yBAA0B,SAA4BsM,EAAMvF,EAAG89E,GAS7D,OANc,IAAVA,EACE,aAAe99E,EAAI,IAEnB,OAAS89E,EAAQ,YAAc99E,EAAI,KAAO89E,EAAQ,MAG7C,UAAU54E,OAAOK,EAAM,eAoBlCmmI,EAAWzZ,EAAM,WAAY,CAC/B,+BAAgC,SAAkCwZ,EAAY5kH,GAE5E,OADA4kH,EAAW5kH,IAAQ,GACZ,GAET,6BAA8B,SAAgC4kH,EAAY5kH,EAAMklH,GAG9E,OAAIllH,EAAK3nB,OAAS6sI,IAChBN,EAAW5kH,IAAQ,GACZ,IAKX,kCAAmC,SAAqC4kH,EAAY5kH,EAAMklH,GACxF,OAAOL,EAASD,EAAY5kH,EAAKjB,QAASmmH,IAE5C,yCAA0C,SAA4CN,EAAY5kH,EAAMklH,GACtG,OAAsC,IAAlCllH,EAAKC,OAAOhlB,QAAQiqI,IACtBN,EAAW5kH,IAAQ,GACZ,GAGF6kH,EAASD,EAAY5kH,EAAKthB,KAAMwmI,IAEzC,8CAA+C,SAA8CN,EAAY5kH,EAAMklH,GAC7G,GAAIllH,EAAKptB,KAAKxB,OAAS,EAAG,CAGxB,IAFA,IAAI+zI,EAAUN,EAASD,EAAY5kH,EAAKptB,KAAK,GAAIsyI,GAExC7zI,EAAI,EAAGA,EAAI2uB,EAAKptB,KAAKxB,SAAUC,EACtC8zI,EAAUN,EAASD,EAAY5kH,EAAKptB,KAAKvB,GAAI6zI,IAAYC,EAG3D,GAAIA,EAEF,OADAP,EAAW5kH,IAAQ,GACZ,EAIX,OAAO,KAWP8kH,EAAc1Z,EAAM,cAAe,CACrC,uBAAwB,SAA4BprG,GAClD,OAAOkkG,EAAmB,IAE5B,qBAAsB,SAA0BlkG,EAAM4kH,GACpD,YAAyB5xI,IAArB4xI,EAAW5kH,GACNkkG,EAAmB,GAGrBA,EAAmB,IAE5B,0BAA2B,SAA+BlkG,EAAM4kH,GAC9D,OAAO,IAAI9f,EAAgBggB,EAAY9kH,EAAKjB,QAAS6lH,KAEvD,iCAAkC,SAAsC5kH,EAAM4kH,GAC5E,YAAyB5xI,IAArB4xI,EAAW5kH,GACNkkG,EAAmB,GAGrB4gB,EAAY9kH,EAAKthB,KAAMkmI,IAEhC,uBAAwB,SAA4B5kH,EAAM4kH,GAKxD,GAJyB,IAArB5kH,EAAKptB,KAAKxB,QAqWlB,SAAuB4uB,GAErB,GAAmB,QAAdA,EAAK3nB,MAAgC,YAAd2nB,EAAK3nB,MAAoC,QAAd2nB,EAAK3nB,MAAwC,IAArB2nB,EAAKptB,KAAKxB,OAAzF,CAOA,IAAK,IAAIC,EAAI,EAAGA,EAAI2uB,EAAKptB,KAAKxB,SAAUC,EACtC2uB,EAAKptB,KAAKvB,GAAK6yH,EAAmB,GAIpC,MADAlkG,EAAKiU,UAAU+3B,WACT,IAAIltD,MAAM,uCAlXZsmI,CAAcplH,QAGShtB,IAArB4xI,EAAW5kH,GACb,OAAOkkG,EAAmB,GAG5B,IACIkD,EAKAie,EAkNA7c,EAAItrH,EAxNJoiG,EAAOt/E,EAAKptB,KAAK,GAEjB47F,GAAM,EAEN82C,GAAW,EAIf,OAAQtlH,EAAK3nB,MACX,IAAK,OAEHm2F,GAAM,EACN62C,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACrE,EAAmB,GAAI,IAAIqE,EAAa,IAAK,MAAO,CAACjpB,EAAM,IAAIipB,EAAa,IAAK,SAAU,CAACrE,EAAmB,GAAIA,EAAmB,SAC1L,MAEF,IAAK,OACL,IAAK,UAEH,GAAyB,IAArBlkG,EAAKptB,KAAKxB,OACZo9F,GAAM,EACN62C,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACrE,EAAmB,GAAI,IAAIuK,EAAa,OAAQ,CAACnvB,WAChG,GAAyB,IAArBt/E,EAAKptB,KAAKxB,OAKnB,OADAwzI,EAFAxd,EAAO,IAAImB,EAAa,IAAK,SAAU,CAACrE,EAAmB,GAAIlkG,EAAKptB,KAAK,MAEtDgyI,EAAW5kH,EAAKptB,KAAK,IACjCkyI,EAAY,IAAIvc,EAAa,IAAK,MAAO,CAACjpB,EAAM8nB,IAAQwd,GAGjE,MAEF,IAAK,QACHxd,EAAOlD,EAAmB,IAI5B,IAAK,MACH,GAAKkD,GAA6B,IAArBpnG,EAAKptB,KAAKxB,QAIhB,GAAyB,IAArB4uB,EAAKptB,KAAKxB,QAAgBg2H,GAA6B,IAArBpnG,EAAKptB,KAAKxB,aAA6C4B,IAA7B4xI,EAAW5kH,EAAKptB,KAAK,IAE1FyyI,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACjpB,EAAK1I,QAAS,IAAI63B,EAAa,MAAO,CAACrH,GAAQpnG,EAAKptB,KAAK,OAC7G47F,GAAM,OACD,GAAyB,IAArBxuE,EAAKptB,KAAKxB,OAEnB,OAAO0zI,EAAY,IAAIvc,EAAa,IAAK,SAAU,CAAC,IAAIkG,EAAa,MAAO,CAACnvB,IAAQ,IAAImvB,EAAa,MAAO,CAACzuG,EAAKptB,KAAK,OAAQgyI,QARhIS,EAAiB/lC,EAAK1I,QACtBpI,GAAM,EAUR,MAEF,IAAK,MAGH,OAFAo2C,EAAWxd,GAAQwd,EAAW5kH,EAAKptB,KAAK,IAEjCkyI,EAAY,IAAIvc,EAAa,IAAK,MAAO,CAACjpB,EAAMt/E,EAAKptB,KAAK,KAAMgyI,GAEzE,IAAK,MAEHS,EAAiB,IAAI5W,EAAa,MAAO,CAACnvB,EAAK1I,UAC/C,MAEF,IAAK,MAEHyuC,EAAiB,IAAI5W,EAAa,MAAO,CAACnvB,EAAK1I,UAC/C,MAEF,IAAK,MAEHyuC,EAAiB,IAAI9c,EAAa,IAAK,aAAc,CAAC,IAAIkG,EAAa,MAAO,CAACnvB,EAAK1I,YACpF,MAEF,IAAK,MAEHyuC,EAAiB,IAAI9c,EAAa,IAAK,MAAO,CAAC,IAAIkG,EAAa,MAAO,CAACnvB,EAAK1I,UAAWstB,EAAmB,KAC3G,MAEF,IAAK,MAEHmhB,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACvoG,EAAM,IAAIyuG,EAAa,MAAO,CAACnvB,EAAK1I,YACxF,MAEF,IAAK,MAEH0uC,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACvoG,EAAM,IAAIyuG,EAAa,MAAO,CAACnvB,EAAK1I,YACxF,MAEF,IAAK,MAEH0uC,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,MAAO,CAAC,IAAIkG,EAAa,MAAO,CAACnvB,EAAK1I,UAAWstB,EAAmB,KAC3G,MAEF,IAAK,OAEH11B,GAAM,EACN62C,EAAiB,IAAI5W,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,WAAY,CAACrE,EAAmB,GAAI,IAAIqE,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,SACpK,MAEF,IAAK,OAEH11B,GAAM,EACN82C,GAAW,EACXD,EAAiB,IAAI5W,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,WAAY,CAACrE,EAAmB,GAAI,IAAIqE,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,SACpK,MAEF,IAAK,OAEH11B,GAAM,EACN62C,EAAiB,IAAI9c,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,KAAMA,EAAmB,KACvI,MAEF,IAAK,OAEH11B,GAAM,EACN62C,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAAC,IAAIkG,EAAa,MAAO,CAACnvB,EAAK1I,UAAW,IAAI63B,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,KAAMA,EAAmB,SAClP,MAEF,IAAK,OAEH11B,GAAM,EACN82C,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAAC,IAAIkG,EAAa,MAAO,CAACnvB,EAAK1I,UAAW,IAAI63B,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,KAAMA,EAAmB,SAClP,MAEF,IAAK,OAEH11B,GAAM,EACN82C,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,KAAMA,EAAmB,KACvI,MAEF,IAAK,OAEHmhB,EAAiB,IAAI5W,EAAa,OAAQ,CAACnvB,EAAK1I,UAChD,MAEF,IAAK,OAEHyuC,EAAiB,IAAI5W,EAAa,OAAQ,CAACnvB,EAAK1I,UAChD,MAEF,IAAK,OAEHyuC,EAAiB,IAAI9c,EAAa,IAAK,MAAO,CAAC,IAAIkG,EAAa,OAAQ,CAACnvB,EAAK1I,UAAWstB,EAAmB,KAC5G,MAEF,IAAK,OAEHohB,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACvoG,EAAM,IAAIyuG,EAAa,OAAQ,CAACnvB,EAAK1I,YACzF,MAEF,IAAK,OAEH0uC,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACvoG,EAAM,IAAIyuG,EAAa,OAAQ,CAACnvB,EAAK1I,YACzF,MAEF,IAAK,OAEH0uC,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,MAAO,CAAC,IAAIkG,EAAa,OAAQ,CAACnvB,EAAK1I,UAAWstB,EAAmB,KAC5G,MAEF,IAAK,QAEH11B,GAAM,EACN62C,EAAiB,IAAI5W,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,KAAMA,EAAmB,OACjK,MAEF,IAAK,QAEH11B,GAAM,EACN62C,EAAiB,IAAI5W,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,KAAMA,EAAmB,OACtK,MAEF,IAAK,QAEH11B,GAAM,EACN62C,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACrE,EAAmB,GAAI,IAAIqE,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,OAC1I,MAEF,IAAK,QAEH11B,GAAM,EACN82C,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACjpB,EAAK1I,QAAS,IAAI63B,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,WAAY,CAACrE,EAAmB,GAAI,IAAIqE,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,WACrN,MAEF,IAAK,QAEH11B,GAAM,EACN82C,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAAC,IAAIkG,EAAa,MAAO,CAACnvB,EAAK1I,UAAW,IAAI63B,EAAa,OAAQ,CAAC,IAAIlG,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,KAAMA,EAAmB,SAC7O,MAEF,IAAK,QAEH11B,GAAM,EACN82C,GAAW,EACXD,EAAiB,IAAI9c,EAAa,IAAK,WAAY,CAACrE,EAAmB,GAAI,IAAIqE,EAAa,IAAK,MAAO,CAACjpB,EAAK1I,QAASstB,EAAmB,OAC1I,MAEF,IAAK,MAEHmhB,EAAiB,IAAI9c,EAAa,IAAK,SAAU,CAAC,IAAIkG,EAAa,IAAIJ,EAAW,OAAQ,CAAC/uB,EAAK1I,UAAW0I,EAAK1I,UAChH,MAEF,IAAK,QAEL,QACE,MAAM,IAAI93F,MAAM,aAAekhB,EAAK3nB,KAAO,8EAK3Cm2F,GACFg6B,EAAK,IACLtrH,EAAO,WAEPsrH,EAAK,IACLtrH,EAAO,YAOT,IAAIqoI,EAAkBT,EAAYxlC,EAAMslC,GAMxC,OAJIU,IACFC,EAAkB,IAAIhd,EAAa,IAAK,aAAc,CAACgd,KAGlD,IAAIhd,EAAaC,EAAItrH,EAAM,CAACqoI,EAAiBF,KAEtD,uBAAwB,SAA4BrlH,EAAM4kH,GACxD,QAAyB5xI,IAArB4xI,EAAW5kH,GACb,OAAOkkG,EAAmB,GAG5B,GAAgB,MAAZlkG,EAAKwoG,GAEP,OAAO,IAAID,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAIstB,EAAKptB,KAAKqH,KAAI,SAAU/H,GAChE,OAAO4yI,EAAY5yI,EAAK0yI,OAI5B,GAAgB,MAAZ5kH,EAAKwoG,GAAY,CAEnB,GAAIxoG,EAAKiqG,UACP,OAAO,IAAI1B,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACoyI,EAAY9kH,EAAKptB,KAAK,GAAIgyI,KAIvE,GAAI5kH,EAAKorE,WACP,OAAO,IAAIm9B,EAAavoG,EAAKwoG,GAAIxoG,EAAKttB,GAAI,CAACoyI,EAAY9kH,EAAKptB,KAAK,GAAIgyI,GAAaE,EAAY9kH,EAAKptB,KAAK,GAAIgyI,KAIhH,GAAgB,MAAZ5kH,EAAKwoG,GAAY,CAEnB,IAAIgd,EAAgBxlH,EAAKptB,KAAKoI,QAAO,SAAU9I,GAC7C,YAA2Bc,IAApB4xI,EAAW1yI,MAGpB,GAAIszI,EAAcp0I,OAAS,EAAG,CAC5B,IAAIq0I,EAAmBzlH,EAAKptB,KAAKoI,QAAO,SAAU9I,GAChD,YAA2Bc,IAApB4xI,EAAW1yI,MAEhBwzI,EAA8C,IAA5BD,EAAiBr0I,OAAeq0I,EAAiB,GAAK,IAAIld,EAAa,IAAK,WAAYkd,GAC1GE,EAAUH,EAAcnnI,OAAOymI,EAAYY,EAAiBd,IAChE,OAAO,IAAIrc,EAAa,IAAK,WAAYod,GAI3C,OAAO,IAAIpd,EAAa,IAAK,MAAOvoG,EAAKptB,KAAKqH,KAAI,SAAU2rI,GAC1D,OAAO,IAAIrd,EAAa,IAAK,WAAYvoG,EAAKptB,KAAKqH,KAAI,SAAU4rI,GAC/D,OAAOA,IAAaD,EAAWd,EAAYe,EAAUjB,GAAciB,EAASjvC,gBAKlF,GAAgB,MAAZ52E,EAAKwoG,IAAcxoG,EAAKorE,WAAY,CACtC,IAAIkU,EAAOt/E,EAAKptB,KAAK,GACjBw0H,EAAOpnG,EAAKptB,KAAK,GAErB,YAAyBI,IAArB4xI,EAAWxd,GACN,IAAImB,EAAa,IAAK,SAAU,CAACuc,EAAYxlC,EAAMslC,GAAaxd,SAIhDp0H,IAArB4xI,EAAWtlC,GACN,IAAIipB,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,aAAc,CAACjpB,IAAQ,IAAIipB,EAAa,IAAK,SAAU,CAACuc,EAAY1d,EAAMwd,GAAa,IAAIrc,EAAa,IAAK,MAAO,CAACnB,EAAKxwB,QAASstB,EAAmB,SAIjN,IAAIqE,EAAa,IAAK,SAAU,CAAC,IAAIA,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,WAAY,CAACuc,EAAYxlC,EAAMslC,GAAaxd,EAAKxwB,UAAW,IAAI2xB,EAAa,IAAK,WAAY,CAACjpB,EAAK1I,QAASkuC,EAAY1d,EAAMwd,OAAiB,IAAIrc,EAAa,IAAK,MAAO,CAACnB,EAAKxwB,QAASstB,EAAmB,OAGlT,GAAgB,MAAZlkG,EAAKwoG,IAAcxoG,EAAKorE,WAAY,CACtC,IAAI06C,EAAO9lH,EAAKptB,KAAK,GACjBmzI,EAAQ/lH,EAAKptB,KAAK,GAEtB,QAAyBI,IAArB4xI,EAAWkB,GAEb,OAAI,EAAArrB,EAAA,IAAeqrB,KAAU73C,EAAO63C,EAAK1zI,QAAUwuH,EAAMklB,EAAK1zI,MAAO,IAC5D8xH,EAAmB,GAIrB,IAAIqE,EAAa,IAAK,WAAY,CAACvoG,EAAM,IAAIuoG,EAAa,IAAK,WAAY,CAAC,IAAIkG,EAAa,MAAO,CAACqX,EAAKlvC,UAAWkuC,EAAYiB,EAAMnvC,QAASguC,OAGzJ,QAA0B5xI,IAAtB4xI,EAAWmB,GAAsB,CACnC,IAAI,EAAAtrB,EAAA,IAAesrB,GAAQ,CAEzB,GAAI93C,EAAO83C,EAAM3zI,OACf,OAAO8xH,EAAmB,GAI5B,GAAItD,EAAMmlB,EAAM3zI,MAAO,GACrB,OAAO0yI,EAAYgB,EAAMlB,GAK7B,IAAIoB,EAAc,IAAIzd,EAAa,IAAK,MAAO,CAACud,EAAKlvC,QAAS,IAAI2xB,EAAa,IAAK,WAAY,CAACwd,EAAO7hB,EAAmB,OAC3H,OAAO,IAAIqE,EAAa,IAAK,WAAY,CAACwd,EAAMnvC,QAAS,IAAI2xB,EAAa,IAAK,WAAY,CAACuc,EAAYgB,EAAMlB,GAAaoB,MAI7H,OAAO,IAAIzd,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACud,EAAKlvC,QAASmvC,EAAMnvC,UAAW,IAAI2xB,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,WAAY,CAACuc,EAAYgB,EAAMlB,GAAa,IAAIrc,EAAa,IAAK,SAAU,CAACwd,EAAMnvC,QAASkvC,EAAKlvC,YAAa,IAAI2xB,EAAa,IAAK,WAAY,CAACuc,EAAYiB,EAAOnB,GAAa,IAAInW,EAAa,MAAO,CAACqX,EAAKlvC,gBAG5W,MAAM,IAAI93F,MAAM,aAAekhB,EAAKwoG,GAAK,iFAoC7C,SAAStE,EAAmB9xH,EAAO6zI,GACjC,OAAO,IAAI9hB,EAAaV,EAAQrxH,EAAO6zI,GAAa1qH,EAAOjgB,SAG7D,OAAO29H,K,WCrmBL,GAAe,CAAC,QAAS,aASlBiN,IAAsC,EAAAnsB,EAAA,IAVtC,QAUoD,IAAepiB,IAC5E,IAAI,MACFyzB,EAAK,UACLn/D,GACE0rC,EACA7kG,GAAQ,QAAY,CACtBs4H,QACAn/D,cAGF,OAAOm/D,EAAM,QAAS,CACpB,SAAU,SAAax4H,GAErB,IAAIuzI,EAAMvzI,EAAK,IAEX,EAAA6nH,EAAA,IAAS0rB,GACXvzI,EAAK,GAAKuzI,EAAM,GACP,EAAA1rB,EAAA,IAAY0rB,KACrBvzI,EAAK,GAAKuzI,EAAIxgI,MAAM,IAGtB,IACE,OAAO7S,EAAMA,MAAM,KAAMF,GACzB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,SCjChB,SAASC,GAAwB9e,EAAYjN,EAAML,GAExD,IAAI7sE,EAASm6E,EAAWvsH,QAAO,SAAUglB,GACvC,OAAO,EAAAy6F,EAAA,IAAaz6F,MAAWA,EAAK3nB,QAAQiiH,MAAWt6F,EAAK3nB,QAAQ4hH,MACnE,GAEH,IAAK7sE,EACH,MAAM,IAAItuC,MAAM,qDAAuDyoH,EAAa,KAItF,IAAIlvH,EAAO+0C,EAAO/0C,KAEdiuI,EAAWxxI,OAAOuB,OAAO4jH,GACzB7rB,EAAKm5B,EAAWtzF,UACpB,OAAO,SAA0B96B,GAE/B,OADAmtI,EAASjuI,GAAQc,EACVi1F,EAAGpiC,SAASs6E,ICtBvB,IACI,GAAe,CAAC,SACTC,IAAuC,EAAAxsB,EAAA,IAFvC,SAEqD,IAAepiB,IAC7E,IAAI,MACFyzB,GACEzzB,EASJ,SAAS6uC,EAAgB5zI,EAAM0nH,EAAML,GACnC,IAAI9gH,EAAG68B,EAgBP,OAdIpjC,EAAK,KACPuG,EAAIvG,EAAK,GAAGqhC,UAAU+3B,SAASiuD,IAG7BrnH,EAAK,KAGLojC,GAFE,EAAAykF,EAAA,IAAa7nH,EAAK,MAAO,EAAA6nH,EAAA,IAAyB7nH,EAAK,IAE9CA,EAAK,GAAGqhC,UAAU+3B,SAASiuD,GAG3BosB,GAAwBzzI,EAAK,GAAI0nH,EAAML,IAI/Cj/G,EAAO7B,EAAG68B,GAGnBwwG,EAAgB7X,SAAU,EAE1B,IAAI3zH,EAASowH,EAAM,SAAU,CAC3B,kBAAmBqb,GACnB,mBAAoB,SAAwBttI,EAAGb,GAC7C,OAAOa,EAAE9C,OAAOowI,GAAQttI,EAAEutI,UAAWpuI,KAEvC,gBAAiB,KACjB,iBAAkB,SAAsBa,EAAGb,GACzC,OAAOa,EAAE9C,QAAO,QAAa8C,EAAEutI,UAAWpuI,OAG9C,OAAOkuI,IACN,CACDJ,qBAAqB,IAavB,SAASK,GAAQttI,EAAG68B,GAElB,IAAIpjC,GAAO,SAAiBojC,GAC5B,OAAO,QAAO78B,GAAG,SAAU/G,EAAOsI,EAAOhC,GAEvC,OAAa,IAAT9F,EACKojC,EAAS5jC,GACE,IAATQ,EACFojC,EAAS5jC,EAAO,CAACsI,EAAQ,IAGzBs7B,EAAS5jC,EAAO,CAACsI,EAAQ,GAAIhC,MCxE1C,IACI,GAAe,CAAC,SACTiuI,IAAoC,EAAA5sB,EAAA,IAFpC,MAEkD,IAAepiB,IAC1E,IAAI,MACFyzB,GACEzzB,EAQJ,SAASivC,EAAah0I,EAAM0nH,EAAML,GAChC,IAAI9gH,EAAG68B,EAgBP,OAdIpjC,EAAK,KACPuG,EAAIvG,EAAK,GAAGqhC,UAAU+3B,SAASiuD,IAG7BrnH,EAAK,KAGLojC,GAFE,EAAAykF,EAAA,IAAa7nH,EAAK,MAAO,EAAA6nH,EAAA,IAAyB7nH,EAAK,IAE9CA,EAAK,GAAGqhC,UAAU+3B,SAASiuD,GAG3BosB,GAAwBzzI,EAAK,GAAI0nH,EAAML,IAI/ChgH,EAAId,EAAG68B,GAGhB4wG,EAAajY,SAAU,EAEvB,IAAI10H,EAAMmxH,EAAM,MAAO,CACrB,kBAAmB,SAAuBjyH,EAAG68B,GAC3C,OAAO82B,GAAK3zD,EAAG68B,EAAU78B,IAE3B,mBAAoB,SAAwBA,EAAG68B,GAC7C,OAAO78B,EAAE9C,OAAOy2D,GAAK3zD,EAAEvF,UAAWoiC,EAAU78B,OAGhD,OAAOytI,IACN,CACDR,qBAAqB,IAWvB,SAASt5E,GAAKp0D,EAAOs9B,EAAU6wG,GAE7B,IAAIC,GAAY,SAAiB9wG,GAqBjC,OAnBA,SAAS+wG,EAAQ30I,EAAOsI,GACtB,OAAInJ,MAAMoF,QAAQvE,IACT,QAAIA,GAAO,SAAU0pF,EAAOzqF,GAEjC,OAAO01I,EAAQjrD,EAAOphF,EAAM2D,OAAOhN,EAAI,OAIvB,IAAdy1I,EACK9wG,EAAS5jC,GACO,IAAd00I,EACF9wG,EAAS5jC,EAAOsI,GAGhBs7B,EAAS5jC,EAAOsI,EAAOmsI,GAK7BE,CAAQruI,EAAO,IC/ExB,IACI,GAAe,CAAC,SACTsuI,IAAwC,EAAAjtB,EAAA,IAFxC,UAEsD,IAAepiB,IAC9E,IAAI,MACFyzB,GACEzzB,EAQJ,SAASsvC,EAAiBr0I,EAAM0nH,EAAML,GACpC,IAAI9gH,EAAG68B,EAgBP,OAdIpjC,EAAK,KACPuG,EAAIvG,EAAK,GAAGqhC,UAAU+3B,SAASiuD,IAG7BrnH,EAAK,KAGLojC,GAFE,EAAAykF,EAAA,IAAa7nH,EAAK,MAAO,EAAA6nH,EAAA,IAAyB7nH,EAAK,IAE9CA,EAAK,GAAGqhC,UAAU+3B,SAASiuD,GAG3BosB,GAAwBzzI,EAAK,GAAI0nH,EAAML,IAI/CitB,EAAS/tI,EAAG68B,GAGrBixG,EAAiBtY,SAAU,EAE3B,IAAIuY,EAAW9b,EAAM,UAAW,CAC9B,2BAA4B,SAA6B1yH,EAAOs9B,GAE9D,IAAIpjC,GAAO,SAAiBojC,IAEd,SAAS+wG,EAAQ30I,EAAOsI,GAChCnJ,MAAMoF,QAAQvE,IAChB,QAAQA,GAAO,SAAU0pF,EAAOzqF,GAE9B01I,EAAQjrD,EAAOphF,EAAM2D,OAAOhN,EAAI,OAIrB,IAATuB,EACFojC,EAAS5jC,GACS,IAATQ,EACTojC,EAAS5jC,EAAOsI,GAGhBs7B,EAAS5jC,EAAOsI,EAAOhC,GAK7BquI,CAAQruI,EAAM9E,UAAW,OAI7B,OAAOqzI,IACN,CACDb,qBAAqB,I,WClEnB,GAAe,CAAC,QAAS,UAClBe,IAAuC,EAAAptB,EAAA,IAFvC,SAEqD,IAAepiB,IAC7E,IAAI,MACFyzB,EAAK,OACL9jE,GACEqwC,EACA32B,GAAS,QAAa,CACxBoqD,QACA9jE,WASF,OAAO8jE,EAAM,SAAU,CACrB,SAAU,SAAax4H,GACrB,IACE,OAAOouE,EAAOluE,MAAM,KAAMF,GAC1B,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,IC5BnB,GAAe,CAAC,SACTgB,IAAsC,EAAArtB,EAAA,IAFtC,QAEoD,IAAepiB,IAC5E,IAAI,MACF0vC,GACE1vC,EAQJ,OAAO,WAGL,IAFA,IAAI/kG,EAAO,GAEFvB,EAAI,EAAGi2I,EAAKz0I,UAAUzB,OAAQC,EAAIi2I,EAAIj2I,IAAK,CAClD,IAAIa,EAAMW,UAAUxB,GAEpB,IAAI,EAAAopH,EAAA,IAAQvoH,GACVA,EAAIqgB,QACJrgB,EAAIsgB,KAAOtgB,EAAIkzB,KAAO,EAAI,EAAI,OACzB,GAAIlzB,IAAqB,IAAdA,EAAIizG,MACpBjzG,EAAMA,EAAI+H,KAAI,SAAUX,GACtB,OAAOA,EAAI,UAER,IAAI,EAAAmhH,EAAA,IAAQvoH,KAAQ,EAAAuoH,EAAA,IAASvoH,GAClCA,EAAMA,EAAI+H,KAAI,SAAUX,GACtB,OAAOA,EAAI,UAER,IAAI,EAAAmhH,EAAA,IAASvoH,GAClBA,SACK,IAAI,EAAAuoH,EAAA,IAAYvoH,GACrBA,EAAMA,EAAIihG,WAAa,OAClB,GAAmB,iBAARjhG,EAEhB,MAAM,IAAIkB,UAAU,gEAGtBR,EAAKvB,GAAKa,EAGZ,IAAIkzE,EAAM,IAAIiiE,EAEd,OADAA,EAAMv0I,MAAMsyE,EAAKxyE,GACVwyE,KAER,CACDghE,qBAAqB,I,WC5CnB,GAAe,CAAC,QAAS,SAAU,aAC5BmB,IAAuC,EAAAxtB,EAAA,IAFvC,SAEqD,IAAepiB,IAC7E,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,UACN2E,GACE0rC,EACAt5F,GAAS,QAAa,CACxB+sH,QACA9jE,SACA2E,cAUF,OAAOm/D,EAAM,SAAU,CACrB,SAAU,SAAax4H,GAErB,IAAI85G,EAAY95G,EAAKxB,OAAS,EAC1BqoF,EAAO7mF,EAAK85G,IAEZ,EAAA+N,EAAA,IAAShhC,GACX7mF,EAAK85G,GAAajzB,EAAO,GAChB,EAAAghC,EAAA,IAAYhhC,KACrB7mF,EAAK85G,GAAajzB,EAAK9zE,MAAM,IAG/B,IACE,OAAOtH,EAAOvL,MAAM,KAAMF,GAC1B,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WCxChB,SAASoB,GAAkB50I,GAChC,GAAoB,IAAhBA,EAAKxB,SAAgB,EAAAqpH,EAAA,IAAa7nH,EAAK,IAAK,CAE9C,IAAIuzI,GADJvzI,EAAOA,EAAK6E,SACG,IAEX,EAAAgjH,EAAA,IAAS0rB,GACXvzI,EAAK,GAAKuzI,EAAM,GACP,EAAA1rB,EAAA,IAAY0rB,KACrBvzI,EAAK,GAAKuzI,EAAIxgI,MAAM,IAIxB,OAAO/S,ECbT,IACI,GAAe,CAAC,QAAS,SAAU,UAAW,UACvC60I,IAAoC,EAAA1tB,EAAA,IAFpC,MAEkD,IAAepiB,IAC1E,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACNkoG,EAAO,OACP1C,GACEppB,EACAv1F,GAAM,QAAU,CAClBgpH,QACA7vG,SACAkoG,UACA1C,WAUF,OAAOqK,EAAM,MAAO,CAClB,SAAU,SAAax4H,GACrBA,EAAO40I,GAAkB50I,GAEzB,IACE,OAAOwP,EAAItP,MAAM,KAAMF,GACvB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WClCnB,GAAe,CAAC,QAAS,SAAU,UAAW,WACvCsB,IAAoC,EAAA3tB,EAAA,IAFpC,MAEkD,IAAepiB,IAC1E,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACNkoG,EAAO,QACP3C,GACEnpB,EACAxyE,GAAM,QAAU,CAClBimG,QACA7vG,SACAkoG,UACA3C,YAUF,OAAOsK,EAAM,MAAO,CAClB,SAAU,SAAax4H,GACrBA,EAAO40I,GAAkB50I,GAEzB,IACE,OAAOuyB,EAAIryB,MAAM,KAAMF,GACvB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WC1BnB,GAAe,CAAC,QAAS,SAAU,MAAO,WACnCuB,IAAoC,EAAA5tB,EAAA,IAFpC,MAEkD,IAAepiB,IAC1E,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,IACNrc,EAAG,QACHukH,GACE9rB,EACA59F,GAAM,QAAU,CAClBqxH,QACA7vG,SACArc,MACAukH,YAEF,OAAO2H,EAfE,MAeU,CACjB,SAAU,SAAax4H,GACrBA,EAAO40I,GAAkB50I,GAEzB,IACE,OAAOmH,EAAIjH,MAAM,KAAMF,GACvB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WClCnB,GAAe,CAAC,QAAS,QAAS,SAAU,SASrCwB,IAAuC,EAAA7tB,EAAA,IAVvC,SAUqD,IAAepiB,IAC7E,IAAI,MACFyzB,EAAK,MACLic,EAAK,OACL//E,EAAM,MACNv7B,GACE4rE,EACAzyD,GAAS,QAAa,CACxBkmF,QACAic,QACA//E,SACAv7B,UAGF,OAAOq/F,EAAM,SAAU,CACrB,SAAU,SAAax4H,GAErB,IAAI85G,EAAY95G,EAAKxB,OAAS,EAC1BqoF,EAAO7mF,EAAK85G,IAEZ,EAAA+N,EAAA,IAAShhC,KACX7mF,EAAK85G,GAAajzB,EAAO,GAG3B,IACE,OAAOv0C,EAAOpyC,MAAM,KAAMF,GAC1B,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WC3CnB,GAAe,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,YACvFyB,IAAsC,EAAA9tB,EAAA,IAFtC,QAEoD,IAAepiB,IAC5E,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,UACNo8D,EAAS,QACT5C,EAAO,UACPE,EAAS,OACTD,EAAM,SACNE,GACEtpB,EACA5rE,GAAQ,QAAY,CACtBq/F,QACA7vG,SACA+rC,SACAo8D,YACA5C,UACAE,YACAD,SACAE,aASF,OAAOmK,EAAM,QAAS,CACpB,SAAU,SAAax4H,GASrB,MALoB,kBAFTA,EADKA,EAAKxB,OAAS,IAK5BwB,EAAKuB,MAAK,GAGL43B,EAAMj5B,MAAM,KAAMF,QAG5B,CACDwzI,qBAAqB,I,WC1CnB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAAY,SAAU,aAClD0B,IAAqC,EAAA/tB,EAAA,IAAQ,GAAM,IAAepiB,IAC3E,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,SACN4sC,EAAQ,OACR54F,EAAM,UACNooH,GACE/rB,EACA//E,GAAO,QAAW,CACpBwzG,QACA9jE,SACA4sC,WACA54F,SACAooH,cASF,OAAO0H,EAAM,GAAM,CACjB,SAAU,SAAax4H,GACrBA,EAAO40I,GAAkB50I,GAEzB,IACE,OAAOglB,EAAK9kB,MAAM,KAAMF,GACxB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WCnCnB,GAAe,CAAC,QAAS,QAAS,SAAU,SASrC2B,IAAoC,EAAAhuB,EAAA,IAVpC,MAUkD,IAAepiB,IAC1E,IAAI,MACFyzB,EAAK,MACLic,EAAK,OACL//E,EAAM,MACNv7B,GACE4rE,EACAr7D,GAAM,QAAU,CAClB8uF,QACAic,QACA//E,SACAv7B,UAGF,OAAOq/F,EAAM,MAAO,CAClB,SAAU,SAAax4H,GAErB,IAAI85G,EAAY95G,EAAKxB,OAAS,EAC1BqoF,EAAO7mF,EAAK85G,IAEZ,EAAA+N,EAAA,IAAShhC,KACX7mF,EAAK85G,GAAajzB,EAAO,GAG3B,IACE,OAAOn9C,EAAIxpC,MAAM,KAAMF,GACvB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WCzCnB,GAAe,CAAC,QAAS,MAAO,UACzB4B,IAAqC,EAAAjuB,EAAA,IAFrC,OAEmD,IAAepiB,IAC3E,IAAI,MACFyzB,EAAK,IACLlsH,EAAG,OACHivF,GACEwJ,EACA99F,GAAO,QAAW,CACpBuxH,QACAlsH,MACAivF,WAUF,OAAOi9B,EAAM,OAAQ,CACnB,SAAU,SAAax4H,GACrBA,EAAO40I,GAAkB50I,GAEzB,IACE,OAAOiH,EAAK/G,MAAM,KAAMF,GACxB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WCjCnB,GAAO,WACP,GAAe,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,SASpE6B,IAAyC,EAAAluB,EAAA,IAAQ,GAAM,IAAepiB,IAC/E,IAAI,MACFyzB,EAAK,IACLlsH,EAAG,SACHg1F,EAAQ,SACR/8E,EAAQ,OACRg3E,EAAM,MACNr7F,EAAK,MACLuI,GACEs8F,EACAirB,GAAW,QAAe,CAC5BwI,QACAlsH,MACAg1F,WACA/8E,WACAg3E,SACAr7F,QACAuI,UAEF,OAAO+vH,EAAM,GAAM,CACjB,SAAU,SAAax4H,GACrBA,EAAO40I,GAAkB50I,GAEzB,IACE,OAAOgwH,EAAS9vH,MAAM,KAAMF,GAC5B,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WCxCnB,GAAe,CAAC,QAAS,OAAQ,YAS1B8B,IAAoC,EAAAnuB,EAAA,IAVpC,MAUkD,IAAepiB,IAC1E,IAAI,MACFyzB,EAAK,KACLxyH,EAAI,SACJgqH,GACEjrB,EACAokC,GAAM,QAAU,CAClB3Q,QACAxyH,OACAgqH,aAEF,OAAOwI,EAAM,MAAO,CAClB,SAAU,SAAax4H,GACrBA,EAAO40I,GAAkB50I,GAEzB,IACE,OAAOmpI,EAAIjpI,MAAM,KAAMF,GACvB,MAAOG,GACP,MAAMi5H,EAAej5H,SAI1B,CACDqzI,qBAAqB,I,WCrCvB,SAAS,KAA2Q,OAA9P,GAAWtxI,OAAOwxB,QAAU,SAAU9xB,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAS9Z,UAAUxB,GAAI,IAAK,IAAIY,KAAO0a,EAAc7X,OAAOnB,UAAUgC,eAAe9B,KAAK8Y,EAAQ1a,KAAQuC,EAAOvC,GAAO0a,EAAO1a,IAAY,OAAOuC,IAA2B1B,MAAMH,KAAME,WAUhT,IAAIynH,GAAO,GAEPN,GAAoB,GAEpByN,GAAU,GAEHrzD,GAAO0lD,EAAW,CAC3BE,uBAESwB,GAAYD,EAAgB,CACrCnnD,UAES6nD,GAAYF,EAAgB,CACrC3nD,QACA4nD,UAAS,SAEAmI,GAAeD,EAAmB,CAC3C9vD,UAESmwD,GAAaD,EAAiB,CACvClwD,UAES0wD,GAAkBD,EAAsB,CACjDzwD,UAESqxD,GAAiBU,EAAqB,CAC/C/xD,UAES2yD,GAAQD,EAAiB,CAClCxM,UAESttC,GAAU06C,EAAc,CACjCD,aAEStC,GAAkBwC,EAAsB,CACjDvzD,UAESm0D,GAAeD,EAAmB,CAC3Cl0D,UAESsxD,GAAYgF,EAAgB,CACrCt2D,UAES8wD,GAAyBiG,EAA6B,CAC/D/2D,QACAg3D,MAAK,SAEI+c,GAAQrc,EAAY,CAC7B/E,SACAqE,MAAK,SAEIoB,GAAeF,GAAmB,CAC3Cl4D,QACA4M,OAAM,SAEG6rD,GAAYD,GAAgB,CACrCx4D,QACArwB,MAAK,OACL/9B,KAAI,SAEKi/G,GAAiBwI,GAAqB,CAC/CnmE,OAAM,OACN8M,QACA4M,OAAM,SAEGqtD,GAAaH,GAAiB,CACvCC,KAAI,OACJ/5D,QACAkmD,UAESmU,GAAeD,GAAmB,CAC3Cp6D,QACAi6D,cACA/T,UAESzqG,GAAQ2/G,GAAY,CAC7BhD,gBACAhR,aACAyJ,kBACAhJ,aACAkJ,mBACAhB,gBACAe,0BACAuJ,gBACA5B,aACAtI,cACAgE,gBACAzD,mBACAY,aACAD,kBACA4I,cACA9yG,OAAM,IACNkoG,QAAO,OACP2H,MAAK,SAEIp/D,GAAWwoE,GAAe,CACnC3kH,SACAu7G,MAAK,SAEIsJ,GAAOD,GAAgB,CAChC5kH,WAESmlH,GAASD,GAAkB,CACpCllH,WAESkqH,GAAOyC,GAAW,CAC3B9H,QACA1a,qBACAoR,MAAK,SAEIn3F,GAAU0oG,GAAc,CACjC9sH,SACAu7G,MAAK,SAEIr/C,GAAWqzD,GAAe,CACnC1b,UAAS,OACT8R,SAAQ,OACRrR,gBACAsK,gBACAlG,gBACAzD,mBACAuJ,cACAnvH,IAAG,OACHqc,OAAM,IACN4yE,OAAM,OACNyyB,MAAK,OACL3yB,OAAM,OACN+rB,qBACA7iG,SAAQ,OACRtH,SACAvV,IAAG,OACH45F,SAAQ,OACRk3B,MAAK,SAEIkO,GAAcsI,GAAkB,CACzCle,UAAS,OACT8R,SAAQ,OACRrR,gBACAsK,gBACAlG,gBACAzD,mBACAuJ,cACAnvH,IAAG,OACHqc,OAAM,IACN4yE,OAAM,OACNyyB,MAAK,OACL3yB,OAAM,OACN+rB,qBACA7iG,SAAQ,OACRtH,SACAvV,IAAG,OACHyxE,YACAmoB,SAAQ,OACRk3B,MAAK,SAEIgd,GAAS3D,GAAa,CAC/BzP,UACA5J,MAAK,SAEI6N,GAAayL,GAAiB,CACvCvgB,gBACAsK,gBACAlG,gBACAzD,mBACAuJ,cACA9yG,OAAM,IACNqlG,MAAK,OACL3yB,OAAM,OACNw1B,QAAO,OACP5zG,SACAk8D,YACAq/C,MAAK,SAGP,GAAS9Q,GAAM,CACbttC,WACA0yC,MAAO,OACPwQ,KAAM,OACNzQ,KAAM,OACNxyC,SAAQ,OACR57E,EAAC,KACD+4F,KAAI,OACJwrC,OAAM,OACNhkD,IAAK,OACLwkB,GAAE,MACFy/B,QAAO,OACPhX,IAAG,OACH8Y,aAAY,OACZT,cAAa,OACbmB,cAAa,OACbX,gBAAe,OACf5jI,EAAC,KACDk9E,SAAU,OACV2kD,MAAK,OACL,GAAM,GAAAv/B,GACNnkB,QAAO,OACP,EAAK,GAAAn+E,EACLmrH,IAAG,OACHmM,MAAK,OACLn/D,UAAS,OACTmwE,UAAS,OACTzrC,WAAU,OACVt1F,MAAK,OACLgtI,YAAW,OACX/sI,OAAM,OACNg6H,QAAO,OACP3R,QAAO,OACP8R,UAAS,OACTtV,UAAS,OACTrtH,MAAK,OACL2uH,KAAI,OACJ/wC,MAAK,OACLimB,MAAK,OACL2xC,eAAc,OACdtzC,KAAI,OACJ+sB,OAAM,OACN1B,OAAM,OACNnuH,IAAG,OACHu+E,GAAE,MACFn7C,IAAG,OACHt6B,OAAM,OACN0U,QAAO,OACPzV,IAAG,OACH0oH,IAAG,OACHqZ,OAAM,OACNE,IAAG,OACHqM,MAAK,OACLjM,QAAO,OACPprD,KAAI,OACJ2xC,KAAI,OACJE,KAAI,OACJE,KAAI,OACJ9xC,KAAI,OACJF,KAAI,OACJM,MAAK,OACLzB,KAAI,OACJszC,KAAI,OACJE,KAAI,OACJE,KAAI,OACJzzC,KAAI,OACJ2f,KAAI,OACJy4C,SACA1lB,aAAY,OACZoY,WAAU,OACVC,UAAS,OACTpF,IAAG,OACH9+B,MAAK,OACLylC,gBAAe,OACfE,OAAM,OACN1vB,OAAM,OACN2oB,SAAQ,OACRpV,WAAU,OACVooB,UAAS,OACTzsI,IAAG,OACH4+C,KAAI,OACJ/hD,KAAI,OACJupH,KAAI,OACJ8X,kBAAiB,OACjBr+H,KAAI,OACJqgI,IAAG,OACHxqD,MAAK,OACLuxC,MAAK,OACLxxC,MAAK,OACLlqE,IAAG,OACH+7G,IAAG,OACH77G,IAAG,OACHk7G,oBAAmB,OACnBhxF,OAAM,OACNokG,MAAK,OACLplC,WAAU,OACVppC,OAAM,OACNumC,KAAI,OACJjxF,IAAG,OACH60F,IAAG,OACHowB,QAAO,OACP+X,KAAI,OACJ1Y,OAAM,OACNC,OAAM,OACNI,GAAE,MACFljH,OAAM,OACN27H,KAAI,OACJhwB,SAAQ,OACRowB,KAAI,OACJE,QAAO,OACPt0H,KAAI,OACJg7D,OAAM,OACNy5D,MAAK,OACL0B,IAAG,OACHxgI,MAAK,OACL8kH,UAAS,OACTE,cAAa,OACb5sB,QAAO,OACPinC,YAAW,OACXla,QAAO,OACPC,OAAM,OACNF,QAAO,OACP+C,OAAM,OACNd,MAAK,OACL5qE,MAAK,OACLqrE,IAAG,OACHrkH,IAAG,OACHo7C,IAAG,OACHu/E,YAAW,OACX5rC,OAAM,OACNtxF,IAAG,OACH/B,MAAK,OACLuc,SAAQ,OACRmpG,YAAW,OACX5zF,GAAE,MACF0pD,QAAO,OACPrmE,OAAM,OACNyqH,QAAO,OACPha,GAAE,MACFlmH,IAAG,OACH4lH,OAAM,OACNQ,gBAAe,OACfqa,eAAc,OACdG,UAAS,OACTja,SAAQ,OACRoZ,gBAAe,OACfnX,MAAK,OACL/wB,IAAG,OACHipC,cAAa,OACbE,aAAY,OACZE,gBAAe,OACfE,QAAO,OACP/8H,MAAK,OACLm9H,YAAW,OACXlf,MAAK,OACL8G,UAAS,OACTiW,IAAG,OACHvY,MAAK,OACL+Y,KAAI,OACJpa,UAAS,OACT0D,QAAO,OACPpC,IAAG,OACHL,UAAS,OACTvmH,KAAI,OACJ0qB,IAAG,OACHg+F,IAAG,OACHkY,YAAW,OACXI,YAAW,OACX/gI,MAAK,OACLX,IAAG,OACHkmH,UAAS,OACT2a,aAAY,OACZzxG,KAAI,OACJ+qE,SAAQ,OACRkuB,MAAK,OACLr2F,MAAK,OACLuQ,IAAG,OACH+3D,KAAI,OACJusB,MAAK,OACLx+G,IAAG,OACH+4H,aAAY,OACZQ,iBAAgB,OAChBja,IAAG,OACHx8E,OAAM,OACNttB,KAAI,OACJooG,WAAU,OACVib,UAAS,OACTM,YAAW,OACXja,IAAG,OACHmnB,aAAY,OACZ3mB,SAAQ,OACRoX,OAAM,OACNC,UAAS,OACTyC,SAAQ,OACRxC,IAAG,OACHG,IAAG,OACHlX,IAAG,OACHznB,SAAQ,OACRsnB,WAAU,OACVD,QAAO,OACP11C,MAAK,OACL3uE,IAAG,OACH2iH,UAAS,OACTkZ,UAAS,OACThjC,MAAK,OACLijC,GAAE,MACFnX,IAAG,OACHD,KAAI,OACJn0B,OAAM,OACNt0F,KAAI,OACJ+oH,SAAQ,OACR8X,aAAY,OACZ1Y,YAAW,OACXL,MAAK,OACL4T,WAAU,OACV2E,KAAI,OACJjsH,UAAS,OACT8tH,IAAG,OACHnE,WAAU,OACVpB,aAAY,OACZsB,UAAS,OACTrB,mBAAkB,OAClBY,aAAY,OACZL,aAAY,OACZe,QAAO,OACPC,eAAc,OACdhC,oBAAmB,OACnBmB,cAAa,OACbN,SAAQ,OACRV,iBAAgB,OAChBsC,UAAS,OACTN,oBAAmB,OACnBb,YAAW,OACXyB,aAAY,OACZH,aAAY,OACZI,kBAAiB,OACjB5B,WAAU,OACVlB,sBAAqB,OACrBoC,gBAAe,OACfC,gBAAe,OACflC,gBAAe,OACfmD,OAAM,OACN5X,KAAI,OACJyX,QAAO,MACP7W,MAAK,OACLmY,YAAW,OACX9C,SAAQ,OACRd,wBAAuB,OACvBX,iBAAgB,OAChBa,cAAa,OACb0B,QAAO,OACPV,UAAS,OACTS,aAAY,OACZ9B,gBAAe,OACfiC,WAAU,OACVtB,qBAAoB,OACpBxB,aAAY,OACZyC,iBAAgB,OAChB+B,eAAc,OACd53E,OAAM,OACNm0E,WAAU,OACVP,iBAAgB,OAChBG,0BAAyB,OACzB0B,YAAW,OACXU,WAAU,OACVrB,oBAAmB,OACnB3gH,OAAM,OACNjH,SACAm8C,YACA6vE,IAAG,OACHvF,QAAO,OACPK,oBAAmB,OACnBa,QAAO,OACP37H,KAAI,OACJk+H,QACA7B,YAAW,OACXjkG,WACA83C,YACAutD,eACA8O,UACAnS,eAAc,OACdgD,cACA19G,OAAM,MAGR,GAASy+F,GAAmBM,GAAM,CAChCxnH,MAAOozI,GAAqB,CAC1Bj6E,UAAS,OACTm/D,MAAK,SAEPpwH,OAAQurI,GAAsB,CAC5Bnb,MAAK,SAEPnxH,IAAK0sI,GAAmB,CACtBvb,MAAK,SAEP17G,QAASs3H,GAAuB,CAC9B5b,MAAK,SAEPpqD,OAAQmmE,GAAsB,CAC5B7/E,OAAM,OACN8jE,MAAK,SAEP1wH,MAAO0sI,GAAqB,CAC1BC,MAAK,SAEPhpI,OAAQkpI,GAAsB,CAC5Bt7E,UAAS,OACT3E,OAAM,OACN8jE,MAAK,SAEPhpH,IAAKqlI,GAAmB,CACtBlsH,OAAM,IACNwlG,OAAM,OACN0C,QAAO,OACP2H,MAAK,SAEPjmG,IAAKuiH,GAAmB,CACtBnsH,OAAM,IACNkoG,QAAO,OACP3C,QAAO,OACPsK,MAAK,SAEPrxH,IAAK4tI,GAAmB,CACtBzoI,IAAG,OACHqc,OAAM,IACNkoG,QAAO,OACP2H,MAAK,SAEPlmF,OAAQ0iG,GAAsB,CAC5BP,MAAK,OACL//E,OAAM,OACNv7B,MAAK,OACLq/F,MAAK,SAEPr/F,MAAO87G,GAAqB,CAC1BnkB,UAAS,OACTp8D,OAAM,OACN/rC,OAAM,IACNwlG,OAAM,OACNE,SAAQ,OACRH,QAAO,OACPE,UAAS,OACToK,MAAK,SAEPxzG,KAAMkwH,GAAoB,CACxBpkB,UAAS,OACTp8D,OAAM,OACNhsD,OAAM,OACN44F,SAAQ,OACRk3B,MAAK,SAEP9uF,IAAKyrG,GAAmB,CACtBV,MAAK,OACL//E,OAAM,OACNv7B,MAAK,OACLq/F,MAAK,SAEPvxH,KAAMmuI,GAAoB,CACxB9oI,IAAG,OACHivF,OAAM,OACNi9B,MAAK,SAEPxI,SAAUqlB,GAAwB,CAChC/oI,IAAG,OACHpM,MAAK,OACLq7F,OAAM,OACN9yF,MAAK,OACL8b,SAAQ,OACR+8E,SAAQ,OACRk3B,MAAK,SAEP2Q,IAAKmM,GAAmB,CACtBtvI,KAAI,OACJwyH,MAAK,OACLxI,SAAQ,WAIZ,GAAS6E,GAAS,CAChBzL,UAAS,OACT3rC,QAAO,OACPtsC,MAAK,OACLqwB,QACAonD,aACAS,aACAkI,gBACAI,cACAO,mBACAW,kBACAsB,SACAyX,UAAS,OACTkK,OAAM,OACNvjB,mBACAoD,gBACA9vB,SAAQ,OACRitB,aACAijB,YAAW,OACXzjB,0BACA0jB,aAAY,OACZC,qBAAoB,OACpBC,cAAa,OACbtc,gBACAK,aACAwa,MAAK,OACLpiB,kBACA8jB,IAAG,OACH5a,KAAI,OACJE,cACAI,gBACAiG,QACAM,YAGFjO,GAAMI,YAAY7M,K,glGCplBdT,EAAe,GACRmvB,GAAiC,QAFjC,YAE+CnvB,GAAc,KAOtE,SAASmC,EAAU96G,GACjB,KAAMvO,gBAAgBqpH,GACpB,MAAM,IAAI/rC,YAAY,oDAGxBt9E,KAAKuO,QAAUA,GAAW,GAuD5B,OAhDA86G,EAAUroH,UAAU8W,KAAO,YAC3BuxG,EAAUroH,UAAUs1I,aAAc,EAOlCjtB,EAAUroH,UAAUC,QAAU,WAC5B,OAAOjB,KAAKuO,SASd86G,EAAUroH,UAAUyE,SAAW,WAC7B,MAAO,IAAMzF,KAAKuO,QAAQ6iB,KAAK,MAAQ,KAUzCi4F,EAAUroH,UAAUkgG,OAAS,WAC3B,MAAO,CACLgoB,OAAQ,YACR36G,QAASvO,KAAKuO,UAYlB86G,EAAUF,SAAW,SAAUhiB,GAC7B,OAAO,IAAIkiB,EAAUliB,EAAK54F,UAGrB86G,IACN,CACDV,SAAS,I,8BCnEP,EAAe,GACR4tB,GAAoC,QAFpC,UAEkD,GAAc,KAIzE,iBAAyB,UACzB,uBAA8B,EAO9B,mBAA2B,WACzB,MAAO,CACLrtB,OAAQ,UACRnvF,GAAI/5B,KAAK+5B,GACT+jD,GAAI99E,KAAK89E,KAUb,oBAA4B,WAC1B,MAAO,CACL15D,EAAGpkB,KAAKgK,MACRsiH,IAAKtsH,KAAKT,QAcd,mBAA2B,SAAU4b,GACnC,IACI2iE,EAAK99E,KAAK89E,GACV/jD,EAAK/5B,KAAK+5B,GACVy8G,GAAQ,QAAOx2I,KAAK+5B,GAAI5e,GACxBs7H,GAAQ,QAAOz2I,KAAK89E,GAAI3iE,GAExBw8E,GAAY,EAAAmwB,EAAA,IAAS3sG,GAAWA,EAAUA,EAAUA,EAAQw8E,UAAY,KAE5E,GAAkB,OAAdA,EAAoB,CACtB,IAAIivB,EAAU5gH,KAAK2B,IAAI,IAAKgwF,GAExB3xF,KAAKgE,IAAI+vB,EAAK+jD,GAAM8oC,IACtB7sF,EAAK,GAGH/zB,KAAKgE,IAAI8zE,EAAK/jD,GAAM6sF,IACtB9oC,EAAK,GAiCT,OA7BW,IAAPA,EAEI04D,EACU,IAAPz8G,EAEE,IAAP+jD,EACI,KACW,IAARA,EACH,KAEA24D,EAAQ,IAIZ34D,EAAK,GACK,IAARA,EACI04D,EAAQ,OAERA,EAAQ,MAAQC,EAAMxkG,UAAU,GAAK,IAGlC,IAAP6rC,EACI04D,EAAQ,OAERA,EAAQ,MAAQC,EAAQ,KAoBtC,YAAoB,SAAUx2I,GAC5B,OAAQC,UAAUzB,QAChB,KAAK,EAED,IAAIc,EAAMW,UAAU,GAEpB,GAAmB,iBAARX,EACT,OAAO,EAAQA,GAEf,MAAM,IAAIkB,UAAU,kDAI1B,KAAK,EAED,IAAI2jB,EAAIlkB,UAAU,GACdosH,EAAMpsH,UAAU,GAEpB,IAAI,EAAA4nH,EAAA,IAAS1jG,GAAI,CAMf,IALI,EAAA0jG,EAAA,IAAOwE,IAAQA,EAAIoqB,QAAQ,WAE7BpqB,EAAMA,EAAI9rB,SAAS,SAGjB,EAAAsnB,EAAA,IAASwE,GACX,OAAO,IAAI,EAAQ,CACjBloG,EAAGA,EACHkoG,IAAKA,IAIT,MAAM,IAAI7rH,UAAU,0CAEpB,MAAM,IAAIA,UAAU,6BAI1B,QACE,MAAM,IAAI68E,YAAY,qDAI5B,oBAA4B,qBAU5B,WAAmB,SAAU6pB,GAC3B,OAAO,IAAI,EAAQA,IAmBrB,UAAkB,SAAU5lG,EAAGmG,GAC7B,OAAInG,EAAEw4B,GAAKryB,EAAEqyB,GACJ,EAGLx4B,EAAEw4B,GAAKryB,EAAEqyB,IACH,EAGNx4B,EAAEu8E,GAAKp2E,EAAEo2E,GACJ,EAGLv8E,EAAEu8E,GAAKp2E,EAAEo2E,IACH,EAGH,GAGF,IACN,CACD6qC,SAAS,IC5MP,EAAe,GACRguB,GAAkC,QAFlC,QAEgD,GAAc,KAgCvE,SAASvlG,EAAMxxB,EAAOC,EAAK4S,GACzB,KAAMzyB,gBAAgBoxC,GACpB,MAAM,IAAIksC,YAAY,oDAGxB,IAAIs5D,EAAWh3H,QACXi3H,EAASh3H,QACTi3H,EAAUrkH,QAEd,GAAImkH,EACF,IAAI,EAAA9uB,EAAA,IAAYloG,GACdA,EAAQA,EAAM4gF,gBACT,GAAqB,iBAAV5gF,EAChB,MAAM,IAAInf,UAAU,oCAIxB,GAAIo2I,EACF,IAAI,EAAA/uB,EAAA,IAAYjoG,GACdA,EAAMA,EAAI2gF,gBACL,GAAmB,iBAAR3gF,EAChB,MAAM,IAAIpf,UAAU,kCAIxB,GAAIq2I,EACF,IAAI,EAAAhvB,EAAA,IAAYr1F,GACdA,EAAOA,EAAK+tE,gBACP,GAAoB,iBAAT/tE,EAChB,MAAM,IAAIhyB,UAAU,mCAIxBT,KAAK4f,MAAQg3H,EAAWvxH,WAAWzF,GAAS,EAC5C5f,KAAK6f,IAAMg3H,EAASxxH,WAAWxF,GAAO,EACtC7f,KAAKyyB,KAAOqkH,EAAUzxH,WAAWoN,GAAQ,EAoQ3C,OA7PA2e,EAAMpwC,UAAU8W,KAAO,QACvBs5B,EAAMpwC,UAAU+1I,SAAU,EAW1B3lG,EAAMl0B,MAAQ,SAAUtD,GACtB,GAAmB,iBAARA,EACT,OAAO,KAGT,IACIo9H,EADOp9H,EAAIkT,MAAM,KACLxlB,KAAI,SAAU/H,GAC5B,OAAO8lB,WAAW9lB,MAMpB,GAJcy3I,EAAKz6H,MAAK,SAAU7L,GAChC,OAAOhI,MAAMgI,MAIb,OAAO,KAGT,OAAQsmI,EAAKv4I,QACX,KAAK,EACH,OAAO,IAAI2yC,EAAM4lG,EAAK,GAAIA,EAAK,IAEjC,KAAK,EACH,OAAO,IAAI5lG,EAAM4lG,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE1C,QACE,OAAO,OASb5lG,EAAMpwC,UAAUijG,MAAQ,WACtB,OAAO,IAAI7yD,EAAMpxC,KAAK4f,MAAO5f,KAAK6f,IAAK7f,KAAKyyB,OAU9C2e,EAAMpwC,UAAUqS,KAAO,WACrB,IAAI7U,EAAM,EACNohB,EAAQ5f,KAAK4f,MACb6S,EAAOzyB,KAAKyyB,KAEZxN,EADMjlB,KAAK6f,IACED,EAYjB,OAVI,QAAK6S,MAAU,QAAKxN,GACtBzmB,EAAMwH,KAAKwwB,KAAKvR,EAAOwN,GACL,IAATxN,IACTzmB,EAAM,GAGJkK,MAAMlK,KACRA,EAAM,GAGD,CAACA,IASV4yC,EAAMpwC,UAAUwxB,IAAM,WACpB,IAAInf,EAAOrT,KAAKqT,OAAO,GAEvB,OAAIA,EAAO,EACLrT,KAAKyyB,KAAO,EAEPzyB,KAAK4f,MAGL5f,KAAK4f,OAASvM,EAAO,GAAKrT,KAAKyyB,UAGxC,GAUJ2e,EAAMpwC,UAAUyO,IAAM,WACpB,IAAI4D,EAAOrT,KAAKqT,OAAO,GAEvB,OAAIA,EAAO,EACLrT,KAAKyyB,KAAO,EAEPzyB,KAAK4f,OAASvM,EAAO,GAAKrT,KAAKyyB,KAG/BzyB,KAAK4f,WAGd,GAYJwxB,EAAMpwC,UAAU+b,QAAU,SAAUsmB,GAClC,IAAI78B,EAAIxG,KAAK4f,MACT6S,EAAOzyB,KAAKyyB,KACZ5S,EAAM7f,KAAK6f,IACXnhB,EAAI,EAER,GAAI+zB,EAAO,EACT,KAAOjsB,EAAIqZ,GACTwjB,EAAS78B,EAAG,CAAC9H,GAAIsB,MACjBwG,GAAKisB,EACL/zB,SAEG,GAAI+zB,EAAO,EAChB,KAAOjsB,EAAIqZ,GACTwjB,EAAS78B,EAAG,CAAC9H,GAAIsB,MACjBwG,GAAKisB,EACL/zB,KAeN0yC,EAAMpwC,UAAUsG,IAAM,SAAU+7B,GAC9B,IAAIt9B,EAAQ,GAIZ,OAHA/F,KAAK+c,SAAQ,SAAUtd,EAAOsI,EAAOtF,GACnCsD,EAAMgC,EAAM,IAAMs7B,EAAS5jC,EAAOsI,EAAOtF,MAEpCsD,GASTqrC,EAAMpwC,UAAU+yI,QAAU,WACxB,IAAIhuI,EAAQ,GAIZ,OAHA/F,KAAK+c,SAAQ,SAAUtd,EAAOsI,GAC5BhC,EAAMgC,EAAM,IAAMtI,KAEbsG,GASTqrC,EAAMpwC,UAAUC,QAAU,WAExB,OAAOjB,KAAK+zI,WAcd3iG,EAAMpwC,UAAUqoI,OAAS,SAAUluH,GACjC,IAAIvB,GAAM,QAAO5Z,KAAK4f,MAAOzE,GAO7B,OALkB,IAAdnb,KAAKyyB,OACP7Y,GAAO,KAAM,QAAO5Z,KAAKyyB,KAAMtX,IAGjCvB,EAAO,KAAM,QAAO5Z,KAAK6f,IAAK1E,IAUhCi2B,EAAMpwC,UAAUyE,SAAW,WACzB,OAAOzF,KAAKqpI,UAUdj4F,EAAMpwC,UAAUkgG,OAAS,WACvB,MAAO,CACLgoB,OAAQ,QACRtpG,MAAO5f,KAAK4f,MACZC,IAAK7f,KAAK6f,IACV4S,KAAMzyB,KAAKyyB,OAYf2e,EAAM+3E,SAAW,SAAUhiB,GACzB,OAAO,IAAI/1D,EAAM+1D,EAAKvnF,MAAOunF,EAAKtnF,IAAKsnF,EAAK10E,OAGvC2e,IACN,CACDu3E,SAAS,I,QCvUAsuB,GAAmB,SAAQ,SAAUpL,GAC9C,OAAO,IAAIA,EAAU,GAAGziI,QACvB,CACD8tI,WAQSC,GAAqB,SAAQ,SAAUtL,GAChD,OAAO,IAAIA,EAAU,GAAGl2H,KAAK,IAAIk2H,EAAU,GAAG5lI,QAAQ41F,IAAI,KACzD,CACDq7C,WAQSE,GAAoB,SAAQ,SAAUvL,GAC/C,OAAOA,EAAUttD,MAAM,KACtB,CACD24D,WAQSG,GAAqB,SAAQ,SAAUxL,GAChD,OAAOuL,EAAkBvL,GAAWj2H,MAAM,KACzC,CACDshI,WAWF,SAASA,EAAOj3I,GACd,OAAOA,EAAK,GAAG03F,UCvDV,IAAI8L,EAAKz9F,KAAKsO,GACV43G,EAAM,EAAIlmH,KAAKsO,GACfnT,EAAI6E,KAAKg5E,ECETs4D,GAA4B,QAAQ,OAAQ,IAAI,KAAM,IACtDC,GAA6B,QAAQ,QAAS,IAAI,KAAM,IACxDC,GAA4B,QAAQ,OAAQ,IAAI,IAAM,OACtDC,EAAgCC,EAAgB,WAAY,CAAC,SAAU,eAAgB1yC,IAChG,IAAI,OACFp8E,EAAM,UACNijH,GACE7mC,EACJ,MAAyB,cAAlBp8E,EAAOjgB,OAAyB,IAAIkjI,EAAUxtD,KAAYA,OAExDs5D,EAA2BD,EAAgB,MAAO,CAAC,SAAU,eAAgBE,IACtF,IAAI,OACFhvH,EAAM,UACNijH,GACE+L,EACJ,MAAyB,cAAlBhvH,EAAOjgB,OAAyB,IAAIkjI,EAAU5sD,KAAOA,OAEnD44D,EAA0BH,EAAgB,KAAM,CAAC,SAAU,eAAgBI,IACpF,IAAI,OACFlvH,EAAM,UACNijH,GACEiM,EACJ,MAAyB,cAAlBlvH,EAAOjgB,OAAyByuI,EAAkBvL,GAAapoC,KAE7Ds0C,EAA2BL,EAAgB,MAAO,CAAC,SAAU,eAAgBM,IACtF,IAAI,OACFpvH,EAAM,UACNijH,GACEmM,EACJ,MAAyB,cAAlBpvH,EAAOjgB,OAAyB0uI,EAAmBxL,GAAa3f,KAE9D+rB,EAAyBP,EAAgB,IAAK,CAAC,SAAU,eAAgBQ,IAClF,IAAI,OACFtvH,EAAM,UACNijH,GACEqM,EACJ,MAAyB,cAAlBtvH,EAAOjgB,OAAyBsuI,EAAiBpL,GAAa1qI,KAG5Dg3I,EAA2BT,EAAgB,MAAO,CAAC,SAAU,eAAgBU,IACtF,IAAI,OACFxvH,EAAM,UACNijH,GACEuM,EACJ,MAAyB,cAAlBxvH,EAAOjgB,OAAyBwuI,EAAmBtL,GD7C3C,qBC+CNwM,EAA2BX,EAAgB,MAAO,CAAC,SAAU,eAAgBY,IACtF,IAAI,OACF1vH,EAAM,UACNijH,GACEyM,EACJ,MAAyB,cAAlB1vH,EAAOjgB,OAAyB,IAAIkjI,EAAU,GAAGvuC,KAAOt3F,KAAK+8H,OAE3DwV,EAA4Bb,EAAgB,OAAQ,CAAC,SAAU,eAAgBc,IACxF,IAAI,OACF5vH,EAAM,UACNijH,GACE2M,EACJ,MAAyB,cAAlB5vH,EAAOjgB,OAAyB,IAAIkjI,EAAU,IAAIvuC,KAAOt3F,KAAKyxF,QAE5DghD,EAA6Bf,EAAgB,QAAS,CAAC,SAAU,eAAgBgB,IAC1F,IAAI,OACF9vH,EAAM,UACNijH,GACE6M,EACJ,MAAyB,cAAlB9vH,EAAOjgB,OAAyB,IAAIkjI,EAAU,GAAGhwC,IAAI,IAAIgwC,EAAU,GAAGvuC,MAAQt3F,KAAKg9H,SAEjF2V,EAA8BjB,EAAgB,SAAU,CAAC,SAAU,eAAgBkB,IAC5F,IAAI,OACFhwH,EAAM,UACNijH,GACE+M,EACJ,MAAyB,cAAlBhwH,EAAOjgB,OAAyB,IAAIkjI,EAAU,GAAGhwC,IAAI,IAAIgwC,EAAU,IAAIvuC,MAAQt3F,KAAKi9H,UAElF4V,EAA+BnB,EAC1C,UAAW,CAAC,SAAU,eAAgBoB,IACpC,IAAI,OACFlwH,EAAM,UACNijH,GACEiN,EACJ,MAAyB,cAAlBlwH,EAAOjgB,OAAyB,IAAIkjI,EAAU,OAAO5lI,OAASD,KAAKk9H,WAEjE6V,EAA6BrB,EAAgB,QAAS,CAAC,SAAU,eAAgBsB,IAC1F,IAAI,OACFpwH,EAAM,UACNijH,GACEmN,EACJ,MAAyB,cAAlBpwH,EAAOjgB,OAAyB,IAAIkjI,EAAU,GAAG5lI,OAASD,KAAKm9H,SAE7D8V,EAAyBvB,EAAgB,IAAK,CAAC,YAAawB,IACrE,IAAI,QACFx7D,GACEw7D,EACJ,OAAOx7D,EAAQy7D,KAeNC,GAA+B,QAAQ,UAAW,IAAI,IChH5C,UDmHrB,SAAS1B,EAAgBhyI,EAAMwhH,EAAcxjH,GAC3C,OAAO,QAAQgC,EAAMwhH,EAAcxjH,EAAQ,CACzC21I,wBAAwB,I,cElHxB,EAAe,CAAC,MAAO,UAChBC,GAAsC,QAFtC,YAEoD,GAAet0C,IAC5E,IAAI,GACF98E,EAAE,OACFU,GACEo8E,EAGA6mC,EAAY,QAAc,CAC5Bl0C,UAAW/uE,EAAO+uE,UAClBE,OAJW,IAgDb,OAtCAg0C,EAAU7qI,UAAU8W,KAAO,YAC3B+zH,EAAU7qI,UAAUu4I,aAAc,EAQlC1N,EAAU7qI,UAAUkgG,OAAS,WAC3B,MAAO,CACLgoB,OAAQ,YACRzpH,MAAOO,KAAKyF,aAWhBomI,EAAU1iB,SAAW,SAAUhiB,GAC7B,OAAO,IAAI0kC,EAAU1kC,EAAK1nG,QAGxByoB,GAEFA,EAAG,UAAU,SAAUw4D,EAAMD,GACvBC,EAAKiX,YAAclX,EAAKkX,WAC1Bk0C,EAAUjjH,OAAO,CACf+uE,UAAWjX,EAAKiX,eAMjBk0C,IACN,CACDljB,SAAS,ICzDP,EAAe,GACR6wB,GAAmC,QAFnC,SAEiD,GAAc,KAuBxE,SAASzD,IACP,KAAM/1I,gBAAgB+1I,GACpB,MAAM,IAAIz4D,YAAY,oDA0N1B,OAlNAy4D,EAAO/0I,UAAU8W,KAAO,SACxBi+H,EAAO/0I,UAAUy4I,UAAW,EAU5B1D,EAAO/0I,UAAU04I,QAAU,WAEzB,MAAM,IAAIvtI,MAAM,gDAYlB4pI,EAAO/0I,UAAUgX,SAAW,WAE1B,MAAM,IAAI7L,MAAM,iDASlB4pI,EAAO/0I,UAAU0C,OAAS,SAAUmU,EAAMG,GACxC,MAAM,IAAI7L,MAAM,+CAiBlB4pI,EAAO/0I,UAAUqtE,OAAS,SAAUtmE,EAAOmgH,EAAajE,GAEtD,MAAM,IAAI93G,MAAM,+CASlB4pI,EAAO/0I,UAAU6B,IAAM,SAAUkF,GAE/B,MAAM,IAAIoE,MAAM,4CAalB4pI,EAAO/0I,UAAUwoE,IAAM,SAAUzhE,EAAOtI,EAAOwkH,GAE7C,MAAM,IAAI93G,MAAM,4CAgBlB4pI,EAAO/0I,UAAUoc,OAAS,SAAU/J,EAAM4wG,GAExC,MAAM,IAAI93G,MAAM,+CAalB4pI,EAAO/0I,UAAU2mI,QAAU,SAAUt0H,EAAM4wG,GAEzC,MAAM,IAAI93G,MAAM,gDAQlB4pI,EAAO/0I,UAAUijG,MAAQ,WAEvB,MAAM,IAAI93F,MAAM,8CAQlB4pI,EAAO/0I,UAAUqS,KAAO,WAEtB,MAAM,IAAIlH,MAAM,6CAclB4pI,EAAO/0I,UAAUsG,IAAM,SAAU+7B,EAAUs2G,GAEzC,MAAM,IAAIxtI,MAAM,4CAUlB4pI,EAAO/0I,UAAU+b,QAAU,SAAUsmB,GAEnC,MAAM,IAAIl3B,MAAM,gDAQlB4pI,EAAO/0I,UAAU+yI,QAAU,WAEzB,MAAM,IAAI5nI,MAAM,gDAQlB4pI,EAAO/0I,UAAUC,QAAU,WAEzB,MAAM,IAAIkL,MAAM,gDAYlB4pI,EAAO/0I,UAAUqoI,OAAS,SAAUluH,GAElC,MAAM,IAAIhP,MAAM,+CAQlB4pI,EAAO/0I,UAAUyE,SAAW,WAE1B,MAAM,IAAI0G,MAAM,iDAGX4pI,IACN,CACDptB,SAAS,ICtPP,EAAe,GACRixB,GAAgC,QAFhC,WAE8C,GAAc,IAa9D,SAAkBt6I,EAAKG,GAE5B,MAAqB,iBAAVA,GAAwBmiE,SAASniE,KAAUiJ,MAAMjJ,GAOrDA,EANE,CACLypH,OAAQ,SACRzpH,MAAO+K,OAAO/K,OClBXo6I,EAAoCC,GAAY,eAAgB,YAAa,UAC7EC,EAA2CD,GAAY,sBAAuB,cAAe,kBAC7FE,EAAsCF,GAAY,iBAAkB,iBAAkB,OACtFG,EAA6CH,GAAY,wBAAyB,yBAA0B,OAE5GI,EAAwCJ,GAAY,mBAAoB,mBAAoB,UAC5FK,EAAwCL,GAAY,mBAAoB,mBAAoB,UAC5FM,GAAuCN,GAAY,kBAAmB,gBAAiB,OACvFO,GAA+BP,GAAY,UAAW,sBAAuB,cAC7EQ,GAAwCR,GAAY,mBAAoB,kBAAmB,KAC3FS,GAAoCT,GAAY,eAAgB,mBAAoB,UACpFU,GAA0CV,GAAY,qBAAsB,uBAAwB,KACpGW,GAAiDX,GAAY,4BAA6B,qBAAsB,OAChHY,GAA2CZ,GAAY,sBAAuB,yBAA0B,MACxGa,GAAuCb,GAAY,kBAAmB,mBAAoB,UAC1Fc,GAAgCd,GAAY,WAAY,qBAAsB,OAI9Ee,GAAkCf,GAAY,aAAc,oBAAqB,KACjFgB,GAA+ChB,GAAY,0BAA2B,mBAAoB,KAC1GiB,GAAoCjB,GAAY,eAAgB,mBAAoB,MACpFkB,GAAqClB,GAAY,gBAAiB,eAAgB,UAClFmB,GAAsBC,GAAc,gBAAiB,gBACrDC,GAAqCrB,GAAY,gBAAiB,sBAAuB,KACzFsB,GAAkCtB,GAAY,aAAc,oBAAqB,MACjFuB,GAAoCvB,GAAY,eAAgB,mBAAoB,MACpFwB,GAAmCxB,GAAY,cAAe,mBAAoB,MAClFyB,GAA4CzB,GAAY,uBAAwB,kBAAmB,YACnG0B,GAA+B1B,GAAY,UAAW,kBAAmB,QACzE2B,GAA2C3B,GAAY,sBAAuB,mBAAoB,OAClG4B,GAAwBR,GAAc,kBAAmB,OACzDS,GAAqBT,GAAc,eAAgB,MAEnDU,GAAkC9B,GAAY,aAAc,oBAAqB,MACjF+B,GAAgC/B,GAAY,WAAY,gBAAiB,UACzEgC,GAAiChC,GAAY,YAAa,eAAgB,UAC1EiC,GAA+BjC,GAAY,UAAW,oBAAqB,YAC3EkC,GAAsClC,GAAY,iBAAkB,yBAA0B,SAE9FmC,GAAiCnC,GAAY,YAAa,uBAAwB,QAClFoC,GAAmCpC,GAAY,cAAe,mBAAoB,iBAClFqC,GAA2CrC,GAAY,sBAAuB,wBAAyB,cACvGsC,GAAmCtC,GAAY,cAAe,uBAAwB,cACtFuC,GAAsBnB,GAAc,iBAAkB,eACtDoB,GAAuCxC,GAAY,kBAAmB,uBAAwB,OAC9FyC,GAAuCzC,GAAY,kBAAmB,sBAAuB,eAC7F0C,GAAwC1C,GAAY,mBAAoB,iBAAkB,OAE1F2C,GAAiC3C,GAAY,YAAa,mBAAoB,aAC9E4C,GAAoC5C,GAAY,eAAgB,mBAAoB,aACpF6C,GAA+B7C,GAAY,UAAW,UAAW,UAGjE8C,GAAoC9C,GAAY,eAAgB,eAAgB,KAChF+C,GAAkC/C,GAAY,aAAc,cAAe,MAC3EgD,GAAkChD,GAAY,aAAc,eAAgB,KAC5EiD,GAAoCjD,GAAY,eAAgB,oBAAqB,KACrFkD,GAAyClD,GAAY,oBAAqB,eAAgB,KAGrG,SAASA,GAAYp0I,EAAMu3I,EAAUC,GAEnC,OAAO,QAAQx3I,EADI,CAAC,SAAU,OAAQ,cACFs/F,IAClC,IAAI,OACFp8E,EAAM,KACN4yG,EAAI,UACJqQ,GACE7mC,EAKA97F,EAAO,IAAIsyH,EADe,cAAlB5yG,EAAOjgB,OAAyB,IAAIkjI,EAAUoR,GAAY53H,WAAW43H,GACtDC,GAE3B,OADAh0I,EAAKi0I,WAAY,EACVj0I,KAMX,SAASgyI,GAAcx1I,EAAMjG,GAE3B,OAAO,QAAQiG,EADI,CAAC,SAAU,cACMkyI,IAClC,IAAI,OACFhvH,EAAM,UACNijH,GACE+L,EACJ,MAAyB,cAAlBhvH,EAAOjgB,OAAyB,IAAIkjI,EAAUpsI,GAASA,K,eCxF9D,GAAe,GACR29I,IAAqC,QAFrC,WAEmD,IAAc,KAI1E,kBAA0B,WAC1B,yBAAgC,EAOhC,oBAA4B,WAC1B,MAAO,CACLl0B,OAAQ,WACR1jH,EAAGxF,KAAK+lC,EAAI/lC,KAAKwF,EACjBkK,EAAG1P,KAAK0P,IAWZ,YAAoB,SAAUy3F,GAC5B,OAAO,IAAI,GAASA,IAGf,KACN,CACDwhB,SAAS,I,4CC7BP,GAAe,CAAC,UACT00B,IAAwC,QAFxC,cAEsD,IAAer4C,IAC9E,IAAI,OACF+wC,GACE/wC,EAMJ,SAASgxC,EAAYn+H,EAAMG,GACzB,KAAMhY,gBAAgBg2I,GACpB,MAAM,IAAI14D,YAAY,oDAGxB,GAAItlE,KAAa,EAAA8vG,EAAA,IAAS9vG,GACxB,MAAM,IAAI7L,MAAM,qBAAuB6L,GAGzC,IAAI,EAAA8vG,EAAA,IAASjwG,GAEO,gBAAdA,EAAKC,MAEP9X,KAAKymB,OAAQ,SAAM5O,EAAK4O,OACxBzmB,KAAKs9I,OAAQ,SAAMzlI,EAAKylI,OACxBt9I,KAAKu9I,UAAYvlI,GAAYH,EAAK0lI,YAGlCv9I,KAAKymB,MAAQ5O,EAAKk8H,UAClB/zI,KAAKs9I,MAAQzlI,EAAKxE,OAClBrT,KAAKu9I,UAAYvlI,GAAYH,EAAK0lI,gBAE/B,GAAI1lI,IAAQ,EAAAiwG,EAAA,IAAQjwG,EAAKA,QAAS,EAAAiwG,EAAA,IAAQjwG,EAAKxE,MAEpDrT,KAAKymB,MAAQ5O,EAAKA,KAClB7X,KAAKs9I,MAAQzlI,EAAKxE,MAElB,SAASrT,KAAKymB,MAAOzmB,KAAKs9I,OAC1Bt9I,KAAKu9I,UAAYvlI,GAAYH,EAAKG,cAC7B,IAAI,EAAA8vG,EAAA,IAAQjwG,GAEjB7X,KAAKymB,MAAQ+2H,EAAW3lI,GAExB7X,KAAKs9I,OAAQ,SAAUt9I,KAAKymB,QAE5B,SAASzmB,KAAKymB,MAAOzmB,KAAKs9I,OAE1Bt9I,KAAKu9I,UAAYvlI,MACZ,IAAIH,EAET,MAAM,IAAIpX,UAAU,8BAA+B,QAAOoX,GAAQ,KAGlE7X,KAAKymB,MAAQ,GACbzmB,KAAKs9I,MAAQ,CAAC,GACdt9I,KAAKu9I,UAAYvlI,GA0LrB,SAAStV,EAAKiyD,EAAQ5sD,GACpB,KAAK,EAAA+/G,EAAA,IAAQ//G,GACX,MAAM,IAAItH,UAAU,iBAKtB,GAFesH,EAAM01I,WAInB,OAAO9oF,EAAO9xD,IAAIkF,EAAMyqB,OAGxB,IAAInf,EAAOtL,EAAMsL,OAEjB,GAAIA,EAAK5U,SAAWk2D,EAAO2oF,MAAM7+I,OAC/B,MAAM,IAAIi/I,GAAA,EAAerqI,EAAK5U,OAAQk2D,EAAO2oF,MAAM7+I,QAOrD,IAHA,IAAI+zB,EAAMzqB,EAAMyqB,MACZ/iB,EAAM1H,EAAM0H,MAEP/Q,EAAI,EAAGi2I,EAAKhgF,EAAO2oF,MAAM7+I,OAAQC,EAAIi2I,EAAIj2I,KAChD,SAAc8zB,EAAI9zB,GAAIi2D,EAAO2oF,MAAM5+I,KACnC,SAAc+Q,EAAI/Q,GAAIi2D,EAAO2oF,MAAM5+I,IAKrC,OAAO,IAAIs3I,EAAY2H,EAAchpF,EAAOluC,MAAO1e,EAAOsL,EAAK5U,OAAQ,GAAIk2D,EAAO4oF,WAgBtF,SAASI,EAAc9lI,EAAM9P,EAAO61I,EAAMpK,GACxC,IAAI1sD,EAAO0sD,IAAQoK,EAAO,EACtBxkH,EAAQrxB,EAAM81I,UAAUrK,GAE5B,OAAI1sD,EACK1tD,EAAM9xB,KAAI,SAAU5I,GAEzB,OADA,SAAcA,EAAGmZ,EAAKpZ,QACfoZ,EAAKnZ,MACXuC,UAEIm4B,EAAM9xB,KAAI,SAAU5I,GAGzB,OAFA,SAAcA,EAAGmZ,EAAKpZ,QAEfk/I,EADK9lI,EAAKnZ,GACWqJ,EAAO61I,EAAMpK,EAAM,MAC9CvyI,UAiBP,SAAS68I,EAAKnpF,EAAQ5sD,EAAOg2I,EAAW95B,GACtC,IAAKl8G,IAA2B,IAAlBA,EAAMyoG,QAClB,MAAM,IAAI/vG,UAAU,iBAItB,IAGIu9I,EAHAC,EAAQl2I,EAAMsL,OACdoqI,EAAW11I,EAAM01I,WAWrB,IAPI,EAAA31B,EAAA,IAASi2B,IACXC,EAAQD,EAAU1qI,OAClB0qI,EAAYA,EAAU98I,WAEtB+8I,GAAQ,SAAUD,GAGhBN,EAAU,CAGZ,GAAqB,IAAjBO,EAAMv/I,OACR,MAAM,IAAIgC,UAAU,mBAGtBk0D,EAAO6U,IAAIzhE,EAAMyqB,MAAOurH,EAAW95B,OAC9B,CAGL,GAAIg6B,EAAMx/I,OAASk2D,EAAO2oF,MAAM7+I,OAC9B,MAAM,IAAIi/I,GAAA,EAAeO,EAAMx/I,OAAQk2D,EAAO2oF,MAAM7+I,OAAQ,KAG9D,GAAIu/I,EAAMv/I,OAASw/I,EAAMx/I,OAAQ,CAK/B,IAHA,IAAIC,EAAI,EACJo8G,EAAQ,EAEQ,IAAbmjC,EAAMv/I,IAAyB,IAAbs/I,EAAMt/I,IAC7BA,IAGF,KAAoB,IAAbu/I,EAAMv/I,IACXo8G,IACAp8G,IAIFq/I,GAAY,SAAUA,EAAWE,EAAMx/I,OAAQq8G,EAAOkjC,GAIxD,KAAK,SAAgBC,EAAOD,GAC1B,MAAM,IAAIN,GAAA,EAAeO,EAAOD,EAAO,KAQzCE,EAAKvpF,EAJM5sD,EAAM0H,MAAMnI,KAAI,SAAU5I,GACnC,OAAOA,EAAI,KAGMulH,GAGnB,IAAI25B,EAAOK,EAAMx/I,OAGjB0/I,EAAcxpF,EAAOluC,MAAO1e,EAAOg2I,EAAWH,EAFpC,GAKZ,OAAOjpF,EAcT,SAASwpF,EAActmI,EAAM9P,EAAOg2I,EAAWH,EAAMpK,GACnD,IAAI1sD,EAAO0sD,IAAQoK,EAAO,EACtBxkH,EAAQrxB,EAAM81I,UAAUrK,GAExB1sD,EACF1tD,EAAMrc,SAAQ,SAAUqhI,EAAWC,IACjC,SAAcD,GACdvmI,EAAKumI,GAAaL,EAAUM,EAAS,OAGvCjlH,EAAMrc,SAAQ,SAAUqhI,EAAWC,IACjC,SAAcD,GAEdD,EAActmI,EAAKumI,GAAYr2I,EAAOg2I,EAAUM,EAAS,IAAKT,EAAMpK,EAAM,MAmChF,SAAS8K,EAAQ3pF,EAAQthD,EAAM4wG,GAE7B,GAAoB,IAAhB5wG,EAAK5U,OAAc,CAIrB,IAFA,IAAIkI,EAAIguD,EAAOluC,OAER,EAAAqhG,EAAA,IAAQnhH,IACbA,EAAIA,EAAE,GAGR,OAAOA,EAQT,OAJAguD,EAAO2oF,MAAQjqI,EAAKvO,MAAM,GAE1B6vD,EAAOluC,OAAQ,SAAOkuC,EAAOluC,MAAOkuC,EAAO2oF,MAAOr5B,GAE3CtvD,EAsCT,SAASupF,EAAKvpF,EAAQthD,EAAM4wG,GAM1B,IALA,IACAs6B,EAAU5pF,EAAO2oF,MAAMx4I,MAAM,GAEzBqkC,GAAU,EAEPo1G,EAAQ9/I,OAAS4U,EAAK5U,QAC3B8/I,EAAQ/8I,KAAK,GACb2nC,GAAU,EAIZ,IAAK,IAAIzqC,EAAI,EAAGi2I,EAAKthI,EAAK5U,OAAQC,EAAIi2I,EAAIj2I,IACpC2U,EAAK3U,GAAK6/I,EAAQ7/I,KACpB6/I,EAAQ7/I,GAAK2U,EAAK3U,GAClByqC,GAAU,GAIVA,GAEFm1G,EAAQ3pF,EAAQ4pF,EAASt6B,GAgY7B,SAASu5B,EAAW3lI,GAClB,IAAK,IAAInZ,EAAI,EAAGi2I,EAAK98H,EAAKpZ,OAAQC,EAAIi2I,EAAIj2I,IAAK,CAC7C,IAAIyrB,EAAOtS,EAAKnZ,IAEZ,EAAAopH,EAAA,IAAQ39F,GACVtS,EAAKnZ,GAAK8+I,EAAWrzH,GACZA,IAA0B,IAAlBA,EAAKsvH,WACtB5hI,EAAKnZ,GAAK8+I,EAAWrzH,EAAKlpB,YAI9B,OAAO4W,EAGT,OAj2BAm+H,EAAYh1I,UAAY,IAAI+0I,EAK5BC,EAAYh1I,UAAUw9I,kBAAoB,SAAU3mI,EAAMG,GACxD,OAAO,IAAIg+H,EAAYn+H,EAAMG,IAO/Bg+H,EAAYh1I,UAAU8W,KAAO,cAC7Bk+H,EAAYh1I,UAAUy9I,eAAgB,EAWtCzI,EAAYh1I,UAAU09I,YAAc,WAClC,OAAO,SAAiB1+I,KAAKymB,MAAO,OAatCuvH,EAAYh1I,UAAU04I,QAAU,WAC9B,MAAO,SAaT1D,EAAYh1I,UAAUgX,SAAW,WAC/B,OAAOhY,KAAKu9I,WAUdvH,EAAYh1I,UAAU0C,OAAS,SAAUmU,EAAMG,GAC7C,OAAO,IAAIg+H,EAAYn+H,EAAMG,IAkB/Bg+H,EAAYh1I,UAAUqtE,OAAS,SAAUtmE,EAAOmgH,EAAajE,GAC3D,OAAQ/jH,UAAUzB,QAChB,KAAK,EACH,OAAOiE,EAAK1C,KAAM+H,GAGpB,KAAK,EACL,KAAK,EACH,OAAO+1I,EAAK99I,KAAM+H,EAAOmgH,EAAajE,GAExC,QACE,MAAM,IAAI3mC,YAAY,+BAW5B04D,EAAYh1I,UAAU6B,IAAM,SAAUkF,GACpC,KAAK,EAAA+/G,EAAA,IAAQ//G,GACX,MAAM,IAAItH,UAAU,kBAGtB,GAAIsH,EAAMtJ,SAAWuB,KAAKs9I,MAAM7+I,OAC9B,MAAM,IAAIi/I,GAAA,EAAe31I,EAAMtJ,OAAQuB,KAAKs9I,MAAM7+I,QAIpD,IAAK,IAAI+H,EAAI,EAAGA,EAAIuB,EAAMtJ,OAAQ+H,KAChC,SAAcuB,EAAMvB,GAAIxG,KAAKs9I,MAAM92I,IAKrC,IAFA,IAAIqR,EAAO7X,KAAKymB,MAEP/nB,EAAI,EAAGi2I,EAAK5sI,EAAMtJ,OAAQC,EAAIi2I,EAAIj2I,IAAK,CAC9C,IAAIigJ,EAAS52I,EAAMrJ,IACnB,SAAcigJ,EAAQ9mI,EAAKpZ,QAC3BoZ,EAAOA,EAAK8mI,GAGd,OAAO9mI,GAcTm+H,EAAYh1I,UAAUwoE,IAAM,SAAUzhE,EAAOtI,EAAOwkH,GAClD,KAAK,EAAA6D,EAAA,IAAQ//G,GACX,MAAM,IAAItH,UAAU,kBAGtB,GAAIsH,EAAMtJ,OAASuB,KAAKs9I,MAAM7+I,OAC5B,MAAM,IAAIi/I,GAAA,EAAe31I,EAAMtJ,OAAQuB,KAAKs9I,MAAM7+I,OAAQ,KAG5D,IAAIC,EAAGi2I,EAAIgK,EAMXT,EAAKl+I,KAJM+H,EAAMT,KAAI,SAAU5I,GAC7B,OAAOA,EAAI,KAGIulH,GAGjB,IAAIpsG,EAAO7X,KAAKymB,MAEhB,IAAK/nB,EAAI,EAAGi2I,EAAK5sI,EAAMtJ,OAAS,EAAGC,EAAIi2I,EAAIj2I,IACzCigJ,EAAS52I,EAAMrJ,IACf,SAAcigJ,EAAQ9mI,EAAKpZ,QAC3BoZ,EAAOA,EAAK8mI,GAOd,OAHAA,EAAS52I,EAAMA,EAAMtJ,OAAS,IAC9B,SAAckgJ,EAAQ9mI,EAAKpZ,QAC3BoZ,EAAK8mI,GAAUl/I,EACRO,MA2MTg2I,EAAYh1I,UAAUoc,OAAS,SAAU/J,EAAM4wG,EAAcx3F,GAE3D,KAAK,EAAAq7F,EAAA,IAAaz0G,GAChB,MAAM,IAAI5S,UAAU,4BAItB,IAAIm+I,EAAYvrI,EAAKpS,UAAUqG,KAAI7H,GAC1Bb,MAAMoF,QAAQvE,IAA2B,IAAjBA,EAAMhB,OAAegB,EAAM,GAAKA,IAKjE,OAAO6+I,EAFC7xH,EAAOzsB,KAAKikG,QAAUjkG,KAEZ4+I,EAAW36B,IAuC/B+xB,EAAYh1I,UAAU2mI,QAAU,SAAUt0H,EAAMoZ,GAC9C,IAAIrc,EAAIqc,EAAOzsB,KAAKikG,QAAUjkG,KAC9BoQ,EAAEqW,OAAQ,SAAQrW,EAAEqW,MAAOpT,GAE3B,IAAIwrI,EAAgBzuI,EAAEktI,MAAM71I,QAAO,CAAChJ,EAAQ4U,IAAS5U,EAAS4U,IAG9D,OADAjD,EAAEktI,OAAQ,SAAqBjqI,EAAMwrI,GAC9BzuI,GA4CT4lI,EAAYh1I,UAAUijG,MAAQ,WAM5B,OALQ,IAAI+xC,EAAY,CACtBn+H,MAAM,SAAM7X,KAAKymB,OACjBpT,MAAM,SAAMrT,KAAKs9I,OACjBtlI,SAAUhY,KAAKu9I,aAWnBvH,EAAYh1I,UAAUqS,KAAO,WAC3B,OAAOrT,KAAKs9I,MAAMx4I,MAAM,IAc1BkxI,EAAYh1I,UAAUsG,IAAM,SAAU+7B,GAEpC,IAAIy7G,EAAK9+I,KAcL6X,EAZU,SAASu8H,EAAQ30I,EAAOsI,GACpC,OAAI,EAAA+/G,EAAA,IAAQroH,GACHA,EAAM6H,KAAI,SAAU6hF,EAAOzqF,GAChC,OAAO01I,EAAQjrD,EAAOphF,EAAM2D,OAAOhN,OAG9B2kC,EAAS5jC,EAAOsI,EAAO+2I,GAMvB1K,CAAQp0I,KAAKymB,MAAO,IAE/B,OAAO,IAAIuvH,EAAYn+H,OADWxX,IAAnBL,KAAKu9I,WAA0B,SAAiB1lI,EAAM,WAAUxX,IAYjF21I,EAAYh1I,UAAU+b,QAAU,SAAUsmB,GAExC,IAAIy7G,EAAK9+I,MAEK,SAASo0I,EAAQ30I,EAAOsI,IAChC,EAAA+/G,EAAA,IAAQroH,GACVA,EAAMsd,SAAQ,SAAUosE,EAAOzqF,GAC7B01I,EAAQjrD,EAAOphF,EAAM2D,OAAOhN,OAG9B2kC,EAAS5jC,EAAOsI,EAAO+2I,GAI3B1K,CAAQp0I,KAAKymB,MAAO,KAStBuvH,EAAYh1I,UAAU+yI,QAAU,WAC9B,OAAO,SAAM/zI,KAAKymB,QASpBuvH,EAAYh1I,UAAUC,QAAU,WAC9B,OAAOjB,KAAKymB,OAaduvH,EAAYh1I,UAAUqoI,OAAS,SAAUluH,GACvC,OAAO,SAAOnb,KAAKymB,MAAOtL,IAS5B66H,EAAYh1I,UAAUyE,SAAW,WAC/B,OAAO,SAAOzF,KAAKymB,QASrBuvH,EAAYh1I,UAAUkgG,OAAS,WAC7B,MAAO,CACLgoB,OAAQ,cACRrxG,KAAM7X,KAAKymB,MACXpT,KAAMrT,KAAKs9I,MACXtlI,SAAUhY,KAAKu9I,YAanBvH,EAAYh1I,UAAU+9I,SAAW,SAAUr4I,GAEzC,GAAIA,GAOF,IALI,EAAAohH,EAAA,IAAYphH,KACdA,EAAIA,EAAE85F,cAIH,EAAAsnB,EAAA,IAASphH,MAAO,OAAUA,GAC7B,MAAM,IAAIjG,UAAU,kDAItBiG,EAAI,EAaN,IAVA,IAAIs4I,EAASt4I,EAAI,EAAIA,EAAI,EACrBu4I,EAAOv4I,EAAI,GAAKA,EAAI,EAEpB8Y,EAAOxf,KAAKs9I,MAAM,GAClBrzG,EAAUjqC,KAAKs9I,MAAM,GAErB93I,EAAIQ,KAAKwsB,IAAIhT,EAAOy/H,EAAMh1G,EAAU+0G,GAEpCnnI,EAAO,GAEFnZ,EAAI,EAAGA,EAAI8G,EAAG9G,IACrBmZ,EAAKnZ,GAAKsB,KAAKymB,MAAM/nB,EAAIugJ,GAAMvgJ,EAAIsgJ,GAIrC,OAAO,IAAIhJ,EAAY,CACrBn+H,KAAMA,EACNxE,KAAM,CAAC7N,GACPwS,SAAUhY,KAAKu9I,aAiBnBvH,EAAY+I,SAAW,SAAU1rI,EAAM5T,EAAOiH,EAAGu9G,GAC/C,KAAK,EAAA6D,EAAA,IAAQz0G,GACX,MAAM,IAAI5S,UAAU,kCAGtB,GAAoB,IAAhB4S,EAAK5U,OACP,MAAM,IAAI0N,MAAM,4CAmBlB,GAfAkH,EAAOA,EAAK/L,KAAI,SAAUy+B,GAQxB,IANI,EAAA+hF,EAAA,IAAY/hF,KAEdA,EAAIA,EAAEy6D,cAIH,EAAAsnB,EAAA,IAAS/hF,MAAO,OAAUA,IAAMA,EAAI,EACvC,MAAM,IAAI55B,MAAM,yCAGlB,OAAO45B,KAGLr/B,GAOF,IALI,EAAAohH,EAAA,IAAYphH,KACdA,EAAIA,EAAE85F,cAIH,EAAAsnB,EAAA,IAASphH,MAAO,OAAUA,GAC7B,MAAM,IAAIjG,UAAU,kDAItBiG,EAAI,EAGN,IAQIw4I,EARAF,EAASt4I,EAAI,EAAIA,EAAI,EACrBu4I,EAAOv4I,EAAI,GAAKA,EAAI,EAEpB8Y,EAAOnM,EAAK,GACZ42B,EAAU52B,EAAK,GAEf7N,EAAIQ,KAAKwsB,IAAIhT,EAAOy/H,EAAMh1G,EAAU+0G,GAKxC,IAAI,EAAAl3B,EAAA,IAAQroH,GAAQ,CAElB,GAAIA,EAAMhB,SAAW+G,EAEnB,MAAM,IAAI2G,MAAM,8BAIlB+yI,EAAS,SAAgBxgJ,GAEvB,OAAOe,EAAMf,SAEV,IAAI,EAAAopH,EAAA,IAASroH,GAAQ,CAE1B,IAAI0/I,EAAK1/I,EAAM4T,OAEf,GAAkB,IAAd8rI,EAAG1gJ,QAAgB0gJ,EAAG,KAAO35I,EAE/B,MAAM,IAAI2G,MAAM,yBAIlB+yI,EAAS,SAAgBxgJ,GAEvB,OAAOe,EAAMoD,IAAI,CAACnE,UAIpBwgJ,EAAS,WAEP,OAAOz/I,GAKNwkH,IAEHA,GAAe,EAAA6D,EAAA,IAAYo3B,EAAO,IAAMA,EAAO,GAAGz/C,IAAI,GACpD,GAIJ,IAAI5nF,EAAO,GAEX,GAAIxE,EAAK5U,OAAS,EAAG,CAEnBoZ,GAAO,SAAOA,EAAMxE,EAAM4wG,GAE1B,IAAK,IAAIv0G,EAAI,EAAGA,EAAIlK,EAAGkK,IACrBmI,EAAKnI,EAAIuvI,GAAMvvI,EAAIsvI,GAAUE,EAAOxvI,GAKxC,OAAO,IAAIsmI,EAAY,CACrBn+H,KAAMA,EACNxE,KAAM,CAACmM,EAAMyqB,MAajB+rG,EAAY7sB,SAAW,SAAUhiB,GAC/B,OAAO,IAAI6uC,EAAY7uC,IAazB6uC,EAAYh1I,UAAUo+I,SAAW,SAAU1gJ,EAAG8I,GAE5C,MAAK,EAAAsgH,EAAA,IAASppH,KAAO,OAAUA,KAAO,EAAAopH,EAAA,IAAStgH,KAAO,OAAUA,IAC9D,MAAM,IAAI2E,MAAM,uCAIlB,GAA0B,IAAtBnM,KAAKs9I,MAAM7+I,OACb,MAAM,IAAI0N,MAAM,4CAUlB,OANA,SAAczN,EAAGsB,KAAKs9I,MAAM,KAC5B,SAAc91I,EAAGxH,KAAKs9I,MAAM,IAE5BtH,EAAYqJ,UAAU3gJ,EAAG8I,EAAGxH,KAAKymB,OAG1BzmB,MAWTg2I,EAAYqJ,UAAY,SAAU3gJ,EAAG8I,EAAGqQ,GAEtC,IAAIynI,EAAKznI,EAAKnZ,GACdmZ,EAAKnZ,GAAKmZ,EAAKrQ,GACfqQ,EAAKrQ,GAAK83I,GAyBLtJ,IACN,CACDrtB,SAAS,I,WC53BP42B,GAAgB,WAIlB,OADAA,GAAgB,UACT,IAGL,GAAe,CAAC,aAAc,WAAY,eAAgB,aAOnDC,IAA6B,QAAQ,QAAS,IAAc,SAAqBx6C,GAC1F,IAAI,UACF6mC,EAAS,QACTnuD,EAAO,YACPs4D,EAAW,SACXlwC,GACEd,EAIAyzB,EAAQ8mB,KA6SZ,OAxSA9mB,EAAM98F,MAAQ,CAAC,CACbj2B,KAAM,SACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,UACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,YACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,WACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,OACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,SACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,QACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,QACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,SACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,cACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,eACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,QACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,QACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,UACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,YACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,OACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,WACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,OACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,SACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,OACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,YACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,eACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,YACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,iBACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,YACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,kBACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,eACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,eACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,yBACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,YACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,OACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,aACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,eACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,kBACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,YACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,aACNC,KAAMmiH,EAAA,IACL,CACDpiH,KAAM,SACNC,KAAMmiH,EAAA,KAGR2Q,EAAMgnB,YAAc,CAAC,CACnBr6I,KAAM,SACNyoH,GAAI,YACJvP,QAAS,SAAiB93G,GAMxB,GALKqlI,GACH6T,GAAiBl5I,IAIf,QAAOA,GAAK,GACd,MAAM,IAAI/F,UAAU,uFAA8F+F,EAA9F,yDAGtB,OAAO,IAAIqlI,EAAUrlI,KAEtB,CACDpB,KAAM,SACNyoH,GAAI,UACJvP,QAAS,SAAiB93G,GAKxB,OAJKk3E,GACHiiE,GAAen5I,GAGV,IAAIk3E,EAAQl3E,EAAG,KAEvB,CACDpB,KAAM,SACNyoH,GAAI,SACJvP,QAAS,SAAiB93G,GACxB,OAAOA,EAAI,KAEZ,CACDpB,KAAM,YACNyoH,GAAI,UACJvP,QAAS,SAAiB93G,GAKxB,OAJKk3E,GACHiiE,GAAen5I,GAGV,IAAIk3E,EAAQl3E,EAAEg6F,WAAY,KAElC,CACDp7F,KAAM,WACNyoH,GAAI,YACJvP,QAAS,SAAiB93G,GACxB,MAAM,IAAI/F,UAAU,+JAErB,CACD2E,KAAM,WACNyoH,GAAI,UACJvP,QAAS,SAAiB93G,GAKxB,OAJKk3E,GACHiiE,GAAen5I,GAGV,IAAIk3E,EAAQl3E,EAAEvF,UAAW,KAEjC,CACDmE,KAAM,SACNyoH,GAAI,WACJvP,QAAS,SAAiB93G,GACnBs/F,GACH85C,GAAgBp5I,GAGlB,IAAI+c,EAAI,IAAIuiF,EAASt/F,GAErB,GAAI+c,EAAEtiB,YAAcuF,EAClB,MAAM,IAAI/F,UAAU,mGAA0G+F,EAA1G,uDAGtB,OAAO+c,IAER,CAQDne,KAAM,SACNyoH,GAAI,SACJvP,QAAS,SAAiB93G,GACxB,IAAIhB,EAAIqC,OAAOrB,GAEf,GAAIkC,MAAMlD,GACR,MAAM,IAAI2G,MAAM,mBAAqB3F,EAAI,iBAG3C,OAAOhB,IAER,CACDJ,KAAM,SACNyoH,GAAI,YACJvP,QAAS,SAAiB93G,GACnBqlI,GACH6T,GAAiBl5I,GAGnB,IACE,OAAO,IAAIqlI,EAAUrlI,GACrB,MAAOpG,GACP,MAAM,IAAI+L,MAAM,mBAAqB3F,EAAI,qBAG5C,CACDpB,KAAM,SACNyoH,GAAI,WACJvP,QAAS,SAAiB93G,GACnBs/F,GACH85C,GAAgBp5I,GAGlB,IACE,OAAO,IAAIs/F,EAASt/F,GACpB,MAAOpG,GACP,MAAM,IAAI+L,MAAM,mBAAqB3F,EAAI,oBAG5C,CACDpB,KAAM,SACNyoH,GAAI,UACJvP,QAAS,SAAiB93G,GACnBk3E,GACHiiE,GAAen5I,GAGjB,IACE,OAAO,IAAIk3E,EAAQl3E,GACnB,MAAOpG,GACP,MAAM,IAAI+L,MAAM,mBAAqB3F,EAAI,mBAG5C,CACDpB,KAAM,UACNyoH,GAAI,SACJvP,QAAS,SAAiB93G,GACxB,OAAQA,IAET,CACDpB,KAAM,UACNyoH,GAAI,YACJvP,QAAS,SAAiB93G,GAKxB,OAJKqlI,GACH6T,GAAiBl5I,GAGZ,IAAIqlI,GAAWrlI,KAEvB,CACDpB,KAAM,UACNyoH,GAAI,WACJvP,QAAS,SAAiB93G,GAKxB,OAJKs/F,GACH85C,GAAgBp5I,GAGX,IAAIs/F,GAAUt/F,KAEtB,CACDpB,KAAM,UACNyoH,GAAI,SACJvP,QAAS,SAAiB93G,GACxB,OAAOgE,OAAOhE,KAEf,CACDpB,KAAM,QACNyoH,GAAI,SACJvP,QAAS,SAAiBv4G,GAKxB,OAJKiwI,GAwBX,WACE,MAAM,IAAI7pI,MAAM,uEAxBV0zI,GAGK,IAAI7J,EAAYjwI,KAExB,CACDX,KAAM,SACNyoH,GAAI,QACJvP,QAAS,SAAiB3pD,GACxB,OAAOA,EAAO1zD,aAGXw3H,KAGT,SAASinB,GAAiBl5I,GACxB,MAAM,IAAI2F,MAAM,wBAAwBT,OAAOlF,EAAG,qDAGpD,SAASm5I,GAAen5I,GACtB,MAAM,IAAI2F,MAAM,wBAAwBT,OAAOlF,EAAG,wDAOpD,SAASo5I,GAAgBp5I,GACvB,MAAM,IAAI2F,MAAM,wBAAwBT,OAAOlF,EAAG,oD,eC5XhD,GAAO,YACP,GAAe,CAAC,SACTs5I,IAAiC,QAAQ,GAAM,IAAe96C,IACvE,IAAI,MACFyzB,GACEzzB,EA+BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,IAERkjI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEs3F,SAEXgI,SAAU,SAAkBt/F,GAC1B,OAAe,IAARA,EAAEkJ,GAAWkyD,SAASp7D,EAAEhB,IAEjC,iBAAkB,SAAqBgB,GACrC,OAAO,SAAQA,EAAGxG,YC/CpB,GAAO,YACP,GAAe,CAAC,SACT+/I,IAAiC,QAAQ,GAAM,IAAe/6C,IACvE,IAAI,MACFyzB,GACEzzB,EA+BJ,OAAOyzB,EAAM,GAAM,CACjB,0CAA2C,WACzC,OAAO,GAET,oDAAqD,WACnD,OAAO,GAET,iBAAkB,SAAqBjyH,GACrC,OAAO,SAAQA,EAAGxG,YC7CpBogG,GAAK,SAKF,SAAS4/C,GAAiBx5I,GAC/B,OAAOA,EAAI,EAGN,SAASy5I,GAAiBz5I,GAC/B,OAAOA,EAAI,EAGN,SAAS05I,GAAa15I,GAC3B,OAAa,IAANA,EAGF,SAAS25I,GAAY35I,GAC1B,OAAOqB,OAAOa,MAAMlC,GAVtBw5I,GAAiBjnB,UAAY34B,GAI7B6/C,GAAiBlnB,UAAY34B,GAI7B8/C,GAAannB,UAAY34B,GAIzB+/C,GAAYpnB,UAAY34B,GClBxB,IAAI,GAAO,aACP,GAAe,CAAC,SACTggD,IAAkC,QAAQ,GAAM,IAAep7C,IACxE,IAAI,MACFyzB,GACEzzB,EAiCJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQs3I,GACRpU,UAAW,SAAmBrlI,GAC5B,OAAQA,EAAE02F,UAAY12F,EAAE80F,WAAa90F,EAAEkC,SAEzCo9F,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEu/B,EAAI,GAAKv/B,EAAEhB,EAAI,GAE1Bg2H,KAAM,SAAch1H,GAClB,OAAOxG,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YClDpB,GAAO,QACP,GAAe,CAAC,SACTqgJ,IAA6B,QAAQ,GAAM,IAAer7C,IACnE,IAAI,MACFyzB,GACEzzB,EA+BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQw3I,GACRtU,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEkC,SAEXo9F,SAAU,SAAkBt/F,GAC1B,OAAO,GAETk3E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEkC,SAEX8yH,KAAM,SAAch1H,GAClB,OAAOqB,OAAOa,MAAMlC,EAAE/G,QAExB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGqB,OAAOa,aC7CxB,SAAS,GAAYlC,EAAGe,EAAGq/G,GAEhC,GAAIA,QACF,OAAOpgH,EAAEi1F,GAAGl0F,GAId,GAAIf,EAAEi1F,GAAGl0F,GACP,OAAO,EAIT,GAAIf,EAAEkC,SAAWnB,EAAEmB,QACjB,OAAO,EAIT,GAAIlC,EAAEo7D,YAAcr6D,EAAEq6D,WAAY,CAEhC,IAAI38C,EAAOze,EAAEwM,MAAMzL,GAAGyC,MAEtB,GAAIib,EAAKq2E,SACP,OAAO,EAGP,IAAI7rF,EAAMjJ,EAAE7C,YAAY8L,IAAIjJ,EAAEwD,MAAOzC,EAAEyC,OACvC,OAAOib,EAAKo4E,IAAI5tF,EAAImG,MAAMgxG,IAK9B,OAAO,ECpCT,IAAI,GAAO,cACP,GAAe,CAAC,QAAS,UAClB05B,IAAmC,QAAQ,GAAM,IAAet7C,IACzE,IAAI,MACFyzB,EAAK,OACL7vG,GACEo8E,EAUJ,OAAOyzB,EAAM,GAAM,CACjB,mBAAoB,SAAwBjyH,EAAGe,GAC7C,OAAOf,IAAMe,GAEf,iBAAkB,SAAsBf,EAAGe,GACzC,OAAO,QAAYf,EAAGe,EAAGqhB,EAAOg+F,UAElC,uBAAwB,SAA4BpgH,EAAGe,GACrD,OAAOf,EAAEi1F,GAAGl0F,IAAM,GAAef,EAAGe,EAAGqhB,EAAOg+F,UAEhD,qBAAsB,SAA0BpgH,EAAGe,GACjD,OAAOf,EAAEw1F,OAAOz0F,IAElB,mBAAoB,SAAwBf,EAAGe,GAC7C,OCxBC,SAAuBf,EAAGe,EAAGq/G,GAClC,OAAO,QAAYpgH,EAAEuzB,GAAIxyB,EAAEwyB,GAAI6sF,KAAY,QAAYpgH,EAAEs3E,GAAIv2E,EAAEu2E,GAAI8oC,GDuBxD25B,CAAc/5I,EAAGe,EAAGqhB,EAAOg+F,UAEpC,aAAc,SAAkBpgH,EAAGe,GACjC,IAAKf,EAAEg6I,UAAUj5I,GACf,MAAM,IAAI4E,MAAM,4CAGlB,OAAOnM,KAAKwG,EAAE/G,MAAO8H,EAAE9H,aEtCzB,KF0CiC,QAAQ,GAAM,CAAC,QAAS,WAAYm4I,IACvE,IAAI,MACFnf,EAAK,OACL7vG,GACEgvH,EACJ,OAAOnf,EAAM,GAAM,CACjB,iBAAkB,SAAsBjyH,EAAGe,GACzC,OAAO,QAAYf,EAAGe,EAAGqhB,EAAOg+F,eEjDnB,CAAC,UAqDT65B,IAA8B,QAtD9B,SAsD4C,IAAez7C,IACpE,IAAI,MACFyzB,GACEzzB,EA2BAr8F,EAAS8vH,EAAM,SAAU,CAC3B,GAAI,WACF,OAAO,GAET9vH,OAAQ,SAAgBnC,GACtB,OAAOA,GAET0zG,OAAQ,SAAgB1zG,GACtB,GAAU,QAANA,EAAa,OAAOy4E,IACxB,IArF4B/4E,EAC5Bw6I,EAoFIC,GApFJD,GAD4Bx6I,EAqFyBM,GApFpBo3E,MAAM,2CAUlC,CACL13E,QACA06I,MATU,CACV,KAAM,EACN,KAAM,EACN,KAAM,IACNF,EAAyB,IAMzBG,YALgBH,EAAyB,GAMzCI,eALmBJ,EAAyB,IAQvC,KAqEL,GAAIC,EACF,OA5DR,SAAuCtyD,GAIrC,IAHA,IAAI7oF,EAAIsD,SAASulF,EAAMwyD,YAAaxyD,EAAMuyD,OACtCr9H,EAAI,EAEC7kB,EAAI,EAAGA,EAAI2vF,EAAMyyD,eAAeriJ,OAAQC,IAE/C6kB,GADiBza,SAASulF,EAAMyyD,eAAepiJ,GAAI2vF,EAAMuyD,OACvC56I,KAAK2B,IAAI0mF,EAAMuyD,MAAOliJ,EAAI,GAG9C,IAAI8sB,EAAShmB,EAAI+d,EAEjB,GAAI7a,MAAM8iB,GACR,MAAM,IAAI8xD,YAAY,WAAa+Q,EAAMnoF,MAAQ,wBAGnD,OAAOslB,EA6CMu1H,CAA8BJ,GAGvC,IAAIttI,EAAO,EACP2tI,EAAsBx6I,EAAEo3E,MAAM,iCAE9BojE,IAGF3tI,EAAOxL,OAAOm5I,EAAoB,IAClCx6I,EAAIw6I,EAAoB,IAG1B,IAAItwI,EAAM7I,OAAOrB,GAEjB,GAAIkC,MAAMgI,GACR,MAAM,IAAI4sE,YAAY,WAAa92E,EAAI,wBAGzC,GAAIw6I,EAAqB,CAGvB,GAAItwI,EAAM,GAAK2C,EAAO,EAEpB,MAAM,IAAIiqE,YAAY,WAAY5xE,OAAOlF,EAAG,sBAI1CkK,GAAO,IAAM2C,EAAO,KACtB3C,GAAY,GAAK2C,GAIrB,OAAO3C,GAETm7H,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEg6F,YAEXsF,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEvF,WAEXu6H,KAAM,SAAch1H,GAClB,MAAM,IAAI2F,MAAM,iDAElBoxH,KAAM,SAAe/2H,GACnB,OAAO,GAET,sBAAuB,SAAwB0C,EAAM+3I,GACnD,OAAO/3I,EAAKs3F,SAASygD,IAEvB,iBAAkB,SAAqBz6I,GACrC,OAAO,SAAQA,EAAGxG,SAYtB,OAJA2I,EAAOwgH,SAAW,SAAUhiB,GAC1B,OAAO9hF,WAAW8hF,EAAK1nG,QAGlBkJ,KC/JL,GAAO,UACP,GAAe,CAAC,SACTu4I,IAA+B,QAAQ,GAAM,IAAel8C,IACrE,IAAI,MACFyzB,GACEzzB,EA6BJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,OAAO,GAETkK,QAAS,SAAiBn8H,GACxB,OAAOA,GAETmC,OAAQ,SAAgBnC,GACtB,QAASA,GAEX+2H,KAAM,SAAe/2H,GACnB,OAAO,GAETqlI,UAAW,SAAmBrlI,GAC5B,OAAQA,EAAE80F,UAEZ4e,OAAQ,SAAgB1zG,GAEtB,IAAI26I,EAAQ36I,EAAEyxE,cAEd,GAAc,SAAVkpE,EACF,OAAO,EACF,GAAc,UAAVA,EACT,OAAO,EAIT,IAAIzwI,EAAM7I,OAAOrB,GAEjB,GAAU,KAANA,IAAakC,MAAMgI,GACrB,QAASA,EAGX,MAAM,IAAIvE,MAAM,mBAAqB3F,EAAI,mBAE3C,iBAAkB,SAAqBA,GACrC,OAAO,SAAQA,EAAGxG,YCrEpB,GAAe,CAAC,QAAS,WAClBohJ,IAA+B,QAF/B,UAE6C,IAAep8C,IACrE,IAAI,MACFyzB,EAAK,QACL/6C,GACEsnB,EAwCJ,OAAOyzB,EAAM,UAAW,CACtB,GAAI,WACF,OAAO/6C,EAAQ2jE,MAEjB14I,OAAQ,SAAgBnC,GACtB,OAAO,IAAIk3E,EAAQl3E,EAAG,IAExB,iBAAkB,SAAsBuzB,EAAI+jD,GAC1C,OAAO,IAAIJ,EAAQ3jD,EAAI+jD,IAGzB,uBAAwB,SAA4B/jD,EAAI+jD,GACtD,OAAO,IAAIJ,EAAQ3jD,EAAGymE,WAAY1iB,EAAG0iB,aAEvCsF,SAAU,SAAkBt/F,GAC1B,OAAO,IAAIk3E,EAAQl3E,EAAEvF,UAAW,IAElCy8E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEy9F,SAEXiW,OAAQ,SAAgB1zG,GACtB,OAAOk3E,EAAQl3E,IAEjB+2H,KAAM,SAAe/2H,GACnB,OAAOk3E,EAAQ,IAEjBv7E,OAAQ,SAAgBqE,GACtB,GAAI,OAAQA,GAAK,OAAQA,EACvB,OAAO,IAAIk3E,EAAQl3E,EAAEuzB,GAAIvzB,EAAEs3E,IAG7B,GAAI,MAAOt3E,GAAK,QAASA,GAAK,QAASA,GAAK,QAASA,EACnD,OAAO,IAAIk3E,EAAQl3E,GAGrB,MAAM,IAAI2F,MAAM,gFAElB,iBAAkB,SAAqB3F,GACrC,OAAO,SAAQA,EAAGxG,YCrFpB,GAAO,YACP,GAAe,CAAC,SACTshJ,IAAiC,QAAQ,GAAM,IAAet8C,IACvE,IAAI,MACFyzB,GACEzzB,EAqBJ,OAAOyzB,EAAM,GAAM,CACjB,cAAe,SAAmBvvH,EAAMmlF,GACtC,OAAOnlF,EAAK45H,UAAUz0C,SC5BxB,GAAK,SACLujD,GAAK,iBACF,SAAS2P,GAAUhgJ,GACxB,OAAOyE,KAAKgE,IAAIzI,GAGX,SAASigJ,GAAUjgJ,EAAGmG,GAC3B,OAAOnG,EAAImG,EAON,SAAS+5I,GAAelgJ,EAAGmG,GAChC,OAAOnG,EAAImG,EAON,SAASg6I,GAAiBl7I,GAC/B,OAAQA,EAGH,SAASm7I,GAAgBn7I,GAC9B,OAAOA,EAGF,SAASo7I,GAAWp7I,GACzB,OAAO,QAAKA,GAGP,SAASq7I,GAAWr7I,GACzB,OAAOR,KAAKwwB,KAAKhwB,GAGZ,SAASs7I,GAAWt7I,GACzB,OAAOA,EAAIA,EAAIA,EAGV,SAASu7I,GAAUv7I,GACxB,OAAOR,KAAKoD,IAAI5C,GAGX,SAASw7I,GAAYx7I,GAC1B,OAAO,QAAMA,GAkBR,SAASy7I,GAAU1gJ,EAAGmG,GAC3B,KAAK,OAAUnG,MAAO,OAAUmG,GAC9B,MAAM,IAAIyE,MAAM,sDAMlB,IAFA,IAAIiY,EAES,IAAN1c,GACL0c,EAAI7iB,EAAImG,EACRnG,EAAImG,EACJA,EAAI0c,EAGN,OAAO7iB,EAAI,GAAKA,EAAIA,EAUf,SAAS2gJ,GAAU3gJ,EAAGmG,GAC3B,KAAK,OAAUnG,MAAO,OAAUmG,GAC9B,MAAM,IAAIyE,MAAM,sDAGlB,GAAU,IAAN5K,GAAiB,IAANmG,EACb,OAAO,EAQT,IAHA,IAAIqiB,EACA23E,EAAOngG,EAAImG,EAEF,IAANA,GAELA,EAAInG,GADJwoB,EAAIriB,GAEJnG,EAAIwoB,EAGN,OAAO/jB,KAAKgE,IAAI03F,EAAOngG,GASlB,SAAS4gJ,GAAU37I,GACxB,OAAOR,KAAKiF,IAAIzE,GASX,SAAS47I,GAAY57I,GAC1B,OAAO,QAAMA,GASR,SAAS67I,GAAW77I,GACzB,OAAO,QAAKA,GAqBP,SAAS87I,GAAU97I,EAAGe,GAC3B,GAAIA,EAAI,EAIN,OAAOf,EAAIe,EAAIvB,KAAKiC,MAAMzB,EAAIe,GACzB,GAAU,IAANA,EACT,OAAOf,EAIP,MAAM,IAAI2F,MAAM,+CAYb,SAAS,GAAc5K,EAAGoqB,GAC/B,IAAIikG,EAAMjkG,EAAO,EAMjB,GAJIikG,IACFjkG,GAAQA,GAGG,IAATA,EACF,MAAM,IAAIxf,MAAM,yBAGlB,GAAI5K,EAAI,GAAKyE,KAAKgE,IAAI2hB,GAAQ,GAAM,EAClC,MAAM,IAAIxf,MAAM,wCAIlB,GAAU,IAAN5K,EACF,OAAOquH,EAAMvxC,IAAW,EAG1B,IAAKzc,SAASrgE,GACZ,OAAOquH,EAAM,EAAIruH,EAGnB,IAAIiF,EAAIR,KAAK2B,IAAI3B,KAAKgE,IAAIzI,GAAI,EAAIoqB,GAIlC,OADAnlB,EAAIjF,EAAI,GAAKiF,EAAIA,EACVopH,EAAM,EAAIppH,EAAIA,EAuBhB,SAAS+7I,GAAW/7I,GACzB,OAAO,QAAKA,GAOP,SAASg8I,GAAah8I,GAC3B,OAAOA,EAAIA,EAWN,SAASi8I,GAAWlhJ,EAAGmG,GAE5B,IAAIqiB,EAEAg1E,EAEA36E,EAEA5d,EAAI,EACJk8I,EAAQ,EACRn7I,EAAI,EACJo7I,EAAQ,EAEZ,KAAK,OAAUphJ,MAAO,OAAUmG,GAC9B,MAAM,IAAIyE,MAAM,uDAGlB,KAAOzE,GAEL0c,EAAI7iB,GADJw9F,EAAI/4F,KAAKiC,MAAM1G,EAAImG,IACPA,EACZqiB,EAAIvjB,EACJA,EAAIk8I,EAAQ3jD,EAAIv4F,EAChBk8I,EAAQ34H,EACRA,EAAIxiB,EACJA,EAAIo7I,EAAQ5jD,EAAIx3F,EAChBo7I,EAAQ54H,EACRxoB,EAAImG,EACJA,EAAI0c,EAWN,OANI7iB,EAAI,EACA,EAAEA,GAAImhJ,GAAQC,GAEd,CAACphJ,EAAGA,EAAImhJ,EAAQ,EAAGC,GAatB,SAASC,GAAUp8I,EAAGe,GAG3B,OAAIf,EAAIA,EAAI,GAAKe,IAAM82E,KAAY73E,EAAIA,EAAI,GAAKe,KAAM,IAC7C,EAGFvB,KAAK2B,IAAInB,EAAGe,GAWd,SAASs7I,GAAYpjJ,GAC1B,IAAIqjJ,EAAW5iJ,UAAUzB,OAAS,QAAsB4B,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,EACnF,OAAOmlB,YAAW,QAAQ5lB,EAAOqjJ,IA7TnCvB,GAAUxoB,UAAY,GAItByoB,GAAUzoB,UAAY6Y,GAQtB6P,GAAe1oB,UAAY6Y,GAQ3B8P,GAAiB3oB,UAAY,GAI7B4oB,GAAgB5oB,UAAY,GAI5B6oB,GAAW7oB,UAAY,GAIvB8oB,GAAW9oB,UAAY,GAIvB+oB,GAAW/oB,UAAY,GAIvBgpB,GAAUhpB,UAAY,GAItBipB,GAAYjpB,UAAY,GAgCxBkpB,GAAUlpB,UAAY6Y,GA8BtBsQ,GAAUnpB,UAAY6Y,GAUtBuQ,GAAUppB,UAAY,GAUtBqpB,GAAYrpB,UAAY,GAUxBspB,GAAWtpB,UAAY,GAiCvBupB,GAAUvpB,UAAY6Y,GA2DtB,GAAc7Y,UAAY6Y,GAI1B2Q,GAAWxpB,UAAY,GAQvBypB,GAAazpB,UAAY,GAiDzB0pB,GAAW1pB,UAAY6Y,GAiBvBgR,GAAU7pB,UAAY6Y,GAatBiR,GAAY9pB,UAAY6Y,GClUxB,IAAI,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,aAC5BmR,IAAiC,QAAQ,GAAM,IAAe/9C,IACvE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,UACNijH,GACE7mC,EA0BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQg5I,GACRjkE,QAAS,SAAiBl3E,GACxB,OAAOA,GAETqlI,UAAW,SAAmBrlI,GAC5B,OAAOA,GAETs/F,SAAU,SAAkBt/F,GAC1B,OAAOA,GAETg1H,KAAM,SAAch1H,GAClB,OAAOA,EAAEy9F,SAEX,iBAAkB,SAAqBz9F,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1B,mBAAoB,SAAuBwG,GAEzC,MAAyB,cAAlBoiB,EAAOjgB,OAAyB,IAAIkjI,GAAWrlI,IAAMA,QCrD9D,GAAO,OACP,GAAe,CAAC,SACTw8I,IAA4B,QAAQ,GAAM,IAAeh+C,IAClE,IAAI,MACFyzB,GACEzzB,EA0BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQm5I,GACRpkE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEi5F,IAAIj5F,GAAGi5F,IAAIj5F,IAEtBqlI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEoP,MAAMpP,GAAGoP,MAAMpP,IAE1Bs/F,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEmB,IAAI,IAEf,iBAAkB,SAAqBnB,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1Bw7H,KAAM,SAAch1H,GAClB,OAAOA,EAAEmB,IAAI,SC/Cf,GAAO,QACP,GAAe,CAAC,QAAS,WAClBs7I,IAA6B,QAAQ,GAAM,IAAej+C,IACnE,IAAI,MACFyzB,EACA/6C,QAASwlE,GACPl+C,EA8BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQq5I,GACRtkE,QAAS,SAAiBl3E,GACxB,IAAI4d,EAAIpe,KAAKoD,IAAI5C,EAAEuzB,IACnB,OAAO,IAAImpH,EAAS9+H,EAAIpe,KAAK2O,IAAInO,EAAEs3E,IAAM,EAAG15D,EAAIpe,KAAK6O,IAAIrO,EAAEs3E,MAE7D+tD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE4C,MAAM4J,MAAM,IAEvB,iBAAkB,SAAqBxM,GACrC,OAAO,SAAQA,EAAGxG,YC9CpB,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAC5BmjJ,IAA6B,QAAQ,GAAM,IAAen+C,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EACA80D,QAASwlE,GACPl+C,EA2BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,GAAK,GAAKoiB,EAAOi+F,YACZu7B,GAAY57I,GAGZ,IAAI08I,EAAS18I,EAAG,GAAGyE,MAAM4wF,IAAI71F,KAAKyxF,OAG7C/Z,QAAS,SAAiBl3E,GACxB,OAAO,IAAI08I,EAAS18I,GAAGyE,MAAM4wF,IAAI71F,KAAKyxF,OAExCo0C,UAAW,SAAmBrlI,GAC5B,OAAKA,EAAEu3F,cAAgBn1E,EAAOi+F,YACrBrgH,EAAEyE,MAGF,IAAIi4I,EAAS18I,EAAEg6F,WAAY,GAAGv1F,MAAM4wF,IAAI71F,KAAKyxF,OAGxD,iBAAkB,SAAqBjxF,GACrC,OAAO,SAAQA,EAAGxG,YCvDpB,GAAe,CAAC,SACTojJ,IAAsC,QAFtC,iBAEoD,IAAep+C,IAC5E,IAAI,MACFyzB,GACEzzB,EAcJ,OAAOyzB,EAAM,iBAAkB,CAC7B,iBAAkBgpB,GAClB,mBAAoB,SAAwBj7I,EAAGe,GAC7C,OAAOf,EAAEi5F,IAAIl4F,IAEf,uBAAwB,SAA4Bf,EAAGe,GACrD,OAAOf,EAAEoP,MAAMrO,IAEjB,qBAAsB,SAA0Bf,EAAGe,GACjD,OAAOf,EAAEi5F,IAAIl4F,IAEf,gDAAiD,SAA4Cf,EAAGe,GAC9F,IAAIkrE,EAAMlrE,EAAE08F,QAEZ,OADAxxB,EAAIhzE,MAAsB,OAAdgzE,EAAIhzE,MAAiBgzE,EAAI4wE,WAAW78I,GAAKxG,KAAKyyE,EAAIhzE,MAAO+G,GAC9DisE,GAET,gDAAiD,SAA4CjsE,EAAGe,GAC9F,IAAIkrE,EAAMjsE,EAAEy9F,QAEZ,OADAxxB,EAAIhzE,MAAsB,OAAdgzE,EAAIhzE,MAAiBgzE,EAAI4wE,WAAW97I,GAAKvH,KAAKyyE,EAAIhzE,MAAO8H,GAC9DkrE,GAET,aAAc,SAAkBjsE,EAAGe,GACjC,OAAOf,EAAEge,SAASjd,SCxCpB,GAAO,OACP,GAAe,CAAC,QAAS,YAAa,WAAY,WAC3C+7I,IAA4B,QAAQ,GAAM,IAAet+C,IAClE,IAAI,MACFyzB,EACAoT,UAAW0X,EAAU,QACrBvyB,EACAlrB,SAAU09C,GACRx+C,EAgCJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ45I,GACR7kE,QAAS,SAAiBl3E,GACxB,OAAgB,IAATA,EAAEs3E,GAAWkzC,EAAQuxB,GAAW/7I,EAAEuzB,KAAOvzB,EAAE67F,QAEpDwpC,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW/8I,EAAE2zF,IAAI,KAE9B2L,SAAU,SAAkBt/F,GAC1B,OAAO,IAAIg9I,EAAUh9I,EAAEu/B,EAAG,IAE5B,iBAAkB,SAAqBv/B,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1Bw7H,KAAM,SAAch1H,GAClB,OAAOxG,KAAKwG,EAAE/G,aCxDhB,GAAO,SACP,GAAe,CAAC,SACTgkJ,IAA8B,QAAQ,GAAM,IAAez+C,IACpE,IAAI,MACFyzB,GACEzzB,EA4BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ65I,GACR9kE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEi5F,IAAIj5F,IAEfqlI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEoP,MAAMpP,IAEjBs/F,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEi5F,IAAIj5F,IAEf,iBAAkB,SAAqBA,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1Bw7H,KAAM,SAAch1H,GAClB,OAAOA,EAAEmB,IAAI,SC/BZ,SAAS+7I,GAAgBl9I,EAAGe,GACjC,GAAIf,EAAEo7D,aAAep7D,EAAE8yD,aAAe/xD,EAAEq6D,aAAer6D,EAAE+xD,YACvD,MAAM,IAAIntD,MAAM,wCAGlB,IAAI0/H,EAAYrlI,EAAE7C,YAElB,GAAI6C,EAAEkC,SAAWnB,EAAEmB,QACjB,OAAO,IAAImjI,EAAU5sD,KAGvB,GAAIz4E,EAAE80F,UAAY/zF,EAAEk0F,IAAI,IAAMj1F,EAAEi1F,GAAGl0F,GACjC,OAAOf,EAGT,GAAIe,EAAE+zF,UAAY90F,EAAEi1F,IAAI,GACtB,OAAOl0F,EAGT,IAAKf,EAAEo7D,aAAer6D,EAAEq6D,WAAY,CAClC,IAAKp7D,EAAEo7D,aAAer6D,EAAEq6D,WACtB,OAAIp7D,EAAEu3F,eAAiBx2F,EAAEw2F,aAChBv3F,EAGF,IAAIqlI,EAAU,GAGvB,IAAKrlI,EAAEo7D,WACL,OAAIr6D,EAAEw2F,aACGv3F,EAGLA,EAAEu3F,aACG,IAAI8tC,EAAU,GAGhBtkI,EAGT,IAAKA,EAAEq6D,WACL,OAAIp7D,EAAEu3F,aACGx2F,EAGLA,EAAEw2F,aACG,IAAI8tC,EAAU,GAGhBrlI,EAIX,OAAOm9I,GAAQn9I,EAAGe,GAAG,SAAUhG,EAAGmG,GAChC,OAAOnG,EAAImG,KAUR,SAASk8I,GAAgBp9I,GAC9B,GAAIA,EAAEo7D,aAAep7D,EAAE8yD,YACrB,MAAM,IAAIntD,MAAM,uCAGlB,IAAI0/H,EAAYrlI,EAAE7C,YACdkgJ,EAAWhY,EAAUl0C,UACzBk0C,EAAUjjH,OAAO,CACf+uE,UAAW,MAEb,IAAInsE,EAAShlB,EAAEmP,KAAK,IAAIk2H,EAAU,IAKlC,OAJArgH,EAAOua,GAAKva,EAAOua,GAAK,KACxB8lG,EAAUjjH,OAAO,CACf+uE,UAAWksD,IAENr4H,EAuBF,SAASs4H,GAAet9I,EAAGe,GAChC,GAAIf,EAAEo7D,aAAep7D,EAAE8yD,aAAe/xD,EAAEq6D,aAAer6D,EAAE+xD,YACvD,MAAM,IAAIntD,MAAM,uCAGlB,IAAI0/H,EAAYrlI,EAAE7C,YAElB,GAAI6C,EAAEkC,SAAWnB,EAAEmB,QACjB,OAAO,IAAImjI,EAAU5sD,KAGvB,IAAI8kE,EAAS,IAAIlY,GAAW,GAE5B,OAAIrlI,EAAE80F,UAAY/zF,EAAEk0F,GAAGsoD,IAAWv9I,EAAEi1F,GAAGl0F,GAC9BA,EAGLA,EAAE+zF,UAAY90F,EAAEi1F,GAAGsoD,GACdv9I,EAGJA,EAAEo7D,YAAer6D,EAAEq6D,WAYjB+hF,GAAQn9I,EAAGe,GAAG,SAAUhG,EAAGmG,GAChC,OAAOnG,EAAImG,MAZNlB,EAAEo7D,aAAep7D,EAAEu3F,cAAgBx2F,EAAEw2F,cAAgBv3F,EAAEu3F,eAAiBx2F,EAAEw2F,eAAiBx2F,EAAEq6D,WACzFmiF,EAGLv9I,EAAEu3F,cAAgBx2F,EAAEw2F,aACfv3F,EAAEo7D,WAAap7D,EAAIe,EAGrBf,EAAEo7D,WAAar6D,EAAIf,EAevB,SAASm9I,GAAQn9I,EAAGe,EAAGgD,GAC5B,IACIy5I,EAAOC,EAwBPC,EAASC,EAASC,EAzBlBvY,EAAYrlI,EAAE7C,YAEd0gJ,IAAU79I,EAAEu/B,EAAI,GAChBu+G,IAAU/8I,EAAEw+B,EAAI,GAEpB,GAAIs+G,EAAO,CACTL,EAAQO,GAA6BX,GAAgBp9I,IAErD,IAAK,IAAI9H,EAAI,EAAGA,EAAIslJ,EAAMvlJ,SAAUC,EAClCslJ,EAAMtlJ,IAAM,OAGdslJ,EAAQO,GAA6B/9I,GAGvC,GAAI89I,EAAO,CACTL,EAAQM,GAA6BX,GAAgBr8I,IAErD,IAAK,IAAI/C,EAAK,EAAGA,EAAKy/I,EAAMxlJ,SAAU+F,EACpCy/I,EAAMz/I,IAAO,OAGfy/I,EAAQM,GAA6Bh9I,GAKnCy8I,EAAMvlJ,QAAUwlJ,EAAMxlJ,QACxBylJ,EAAUF,EACVG,EAAUF,EACVG,EAAUC,IAEVH,EAAUD,EACVE,EAAUH,EACVI,EAAUE,GAGZ,IAAIE,EAAWN,EAAQzlJ,OACnBgmJ,EAAUN,EAAQ1lJ,OAClBimJ,EAAkC,EAArBn6I,EAAK85I,EAAOC,GACzBK,EAAS,IAAI9Y,EAAuB,EAAb6Y,GACvBE,EAAW,IAAI/Y,EAAU,GACzBgZ,EAAM,IAAIhZ,EAAU,GACpBgY,EAAWhY,EAAUl0C,UAKzB,IAJAk0C,EAAUjjH,OAAO,CACf+uE,UAAW,MAGN6sD,EAAW,GACZj6I,EAAK25I,IAAUM,GAAWL,IAAUM,MAAcC,IACpDC,EAASA,EAAOhvI,KAAKivI,IAGvBA,EAAWA,EAAShvI,MAAMivI,GAG5B,KAAOJ,EAAU,GACXl6I,EAAK65I,EAASD,IAAUM,MAAcC,IACxCC,EAASA,EAAOhvI,KAAKivI,IAGvBA,EAAWA,EAAShvI,MAAMivI,GAW5B,OARAhZ,EAAUjjH,OAAO,CACf+uE,UAAWksD,IAGM,IAAfa,IACFC,EAAO5+G,GAAK4+G,EAAO5+G,GAGd4+G,EAIT,SAASJ,GAA6B/9I,GAMpC,IAJA,IAAIjF,EAAIiF,EAAEkJ,EAEN0U,EAAI7iB,EAAE,GAAK,GAEN7C,EAAI,EAAGA,EAAI6C,EAAE9C,SAAUC,EAAG,CAGjC,IAFA,IAAIqnC,EAAIxkC,EAAE7C,GAAK,GAENswB,EAAI,EAAI+W,EAAEtnC,OAAQuwB,KACzB+W,EAAI,IAAMA,EAGZ3hB,GAAK2hB,EAKP,IAFA,IAAIv+B,EAAI4c,EAAE3lB,OAEa,MAAhB2lB,EAAE21E,OAAOvyF,IACdA,IAGF,IAAIyqE,EAAKzrE,EAAErF,EACPyY,EAAMwK,EAAEtf,MAAM,EAAG0C,EAAI,GAAK,GAC1BsyF,EAAOlgF,EAAInb,OAEf,GAAIwzE,EAAK,EACP,KAAMA,EAAK6nB,EAIT,IAFA7nB,GAAM6nB,EAEC7nB,KACLr4D,GAAO,SAEAq4D,EAAK6nB,IACdlgF,EAAMA,EAAI9U,MAAM,EAAGmtE,GAAM,IAAMr4D,EAAI9U,MAAMmtE,IAO7C,IAFA,IAAI1zE,EAAM,CAAC,GAEFmzI,EAAM,EAAGA,EAAM93H,EAAInb,QAAS,CAGnC,IAFA,IAAIo7F,EAAOt7F,EAAIE,OAERo7F,KACLt7F,EAAIs7F,IAAS,GAGft7F,EAAI,IAAMuK,SAAS8Q,EAAImgF,OAAO23C,MAE9B,IAAK,IAAIoT,EAAK,EAAGA,EAAKvmJ,EAAIE,SAAUqmJ,EAC9BvmJ,EAAIumJ,GAAM,IACQ,OAAhBvmJ,EAAIumJ,EAAK,SAA+BzkJ,IAAhB9B,EAAIumJ,EAAK,KACnCvmJ,EAAIumJ,EAAK,GAAK,GAGhBvmJ,EAAIumJ,EAAK,IAAMvmJ,EAAIumJ,IAAO,EAC1BvmJ,EAAIumJ,IAAO,GAKjB,OAAOvmJ,EAAIyzB,UAuBN,SAASw8F,GAAOhoH,EAAGe,GACxB,GAAIf,EAAEo7D,aAAep7D,EAAE8yD,aAAe/xD,EAAEq6D,aAAer6D,EAAE+xD,YACvD,MAAM,IAAIntD,MAAM,wCAGlB,IAAI0/H,EAAYrlI,EAAE7C,YAElB,GAAI6C,EAAEkC,SAAWnB,EAAEmB,QACjB,OAAO,IAAImjI,EAAU5sD,KAGvB,GAAIz4E,EAAE80F,SACJ,OAAO/zF,EAGT,GAAIA,EAAE+zF,SACJ,OAAO90F,EAGT,GAAIA,EAAEi1F,GAAGl0F,GACP,OAAO,IAAIskI,EAAU,GAGvB,IAAIkY,EAAS,IAAIlY,GAAW,GAE5B,OAAIrlI,EAAEi1F,GAAGsoD,GACAH,GAAgBr8I,GAGrBA,EAAEk0F,GAAGsoD,GACAH,GAAgBp9I,GAGpBA,EAAEo7D,YAAer6D,EAAEq6D,WAQjB+hF,GAAQn9I,EAAGe,GAAG,SAAUhG,EAAGmG,GAChC,OAAOnG,EAAImG,KARNlB,EAAEo7D,YAAer6D,EAAEq6D,WAIjB,IAAIiqE,EAAUrlI,EAAEu3F,eAAiBx2F,EAAEw2F,aAAe1f,KAAW,KAH3D0lE,EA6BN,SAASgB,GAAmBv+I,EAAGe,GACpC,GAAIf,EAAEo7D,aAAep7D,EAAE8yD,aAAe/xD,EAAEq6D,aAAer6D,EAAE+xD,YACvD,MAAM,IAAIntD,MAAM,2CAGlB,IAAI0/H,EAAYrlI,EAAE7C,YAElB,OAAI6C,EAAEkC,SAAWnB,EAAEmB,SAAWnB,EAAEw2F,eAAiBx2F,EAAE+zF,SAC1C,IAAIuwC,EAAU5sD,KAGnBz4E,EAAE80F,UAAY/zF,EAAE+zF,SACX90F,EAGJA,EAAEo7D,YAAer6D,EAAEq6D,WAKpBr6D,EAAE42F,GAAG,IACA33F,EAAEoP,MAAM5P,KAAK2B,IAAI,EAAGJ,EAAEi5F,YAAc,IAGtCh6F,EAAEoP,MAAM,IAAIi2H,EAAU,GAAGlkI,IAAIJ,IAR3B,IAAIskI,EAAU5sD,KA8BlB,SAAS+lE,GAAyBx+I,EAAGe,GAC1C,GAAIf,EAAEo7D,aAAep7D,EAAE8yD,aAAe/xD,EAAEq6D,aAAer6D,EAAE+xD,YACvD,MAAM,IAAIntD,MAAM,iDAGlB,IAAI0/H,EAAYrlI,EAAE7C,YAElB,OAAI6C,EAAEkC,SAAWnB,EAAEmB,SAAWnB,EAAEw2F,eAAiBx2F,EAAE+zF,SAC1C,IAAIuwC,EAAU5sD,KAGnBz4E,EAAE80F,UAAY/zF,EAAE+zF,SACX90F,EAGJe,EAAEq6D,WAaHr6D,EAAE42F,GAAG,IACA33F,EAAEq1F,IAAI71F,KAAK2B,IAAI,EAAGJ,EAAEi5F,YAAc,IAAIv4F,QAGxCzB,EAAEq1F,IAAI,IAAIgwC,EAAU,GAAGlkI,IAAIJ,IAAIU,QAhBhCzB,EAAEu3F,aACG,IAAI8tC,GAAW,GAGnBrlI,EAAEo7D,WAIA,IAAIiqE,EAAU,GAHZ,IAAIA,EAAU5sD,KC7c3B,IACI,GAAK,iBACF,SAASgmE,GAAaz+I,EAAGe,GAC9B,KAAK,OAAUf,MAAO,OAAUe,GAC9B,MAAM,IAAI4E,MAAM,wCAGlB,OAAO3F,EAAIe,EAGN,SAAS29I,GAAa1+I,GAC3B,KAAK,OAAUA,GACb,MAAM,IAAI2F,MAAM,uCAGlB,OAAQ3F,EAGH,SAAS2+I,GAAY3+I,EAAGe,GAC7B,KAAK,OAAUf,MAAO,OAAUe,GAC9B,MAAM,IAAI4E,MAAM,uCAGlB,OAAO3F,EAAIe,EAGN,SAAS69I,GAAa5+I,EAAGe,GAC9B,KAAK,OAAUf,MAAO,OAAUe,GAC9B,MAAM,IAAI4E,MAAM,wCAGlB,OAAO3F,EAAIe,EAGN,SAAS89I,GAAgB7+I,EAAGe,GACjC,KAAK,OAAUf,MAAO,OAAUe,GAC9B,MAAM,IAAI4E,MAAM,2CAGlB,OAAO3F,GAAKe,EAGP,SAAS+9I,GAAsB9+I,EAAGe,GACvC,KAAK,OAAUf,MAAO,OAAUe,GAC9B,MAAM,IAAI4E,MAAM,iDAGlB,OAAO3F,GAAKe,EAGP,SAASg+I,GAAoB/+I,EAAGe,GACrC,KAAK,OAAUf,MAAO,OAAUe,GAC9B,MAAM,IAAI4E,MAAM,+CAGlB,OAAO3F,IAAMe,EA9Cf09I,GAAalsB,UAAY,GAQzBmsB,GAAansB,UAjBJ,SAyBTosB,GAAYpsB,UAAY,GAQxBqsB,GAAarsB,UAAY,GAQzBssB,GAAgBtsB,UAAY,GAQ5BusB,GAAsBvsB,UAAY,GAQlCwsB,GAAoBxsB,UAAY,GCtDhC,IAAI,GAAO,SACP,GAAe,CAAC,SACTysB,IAA8B,QAAQ,GAAM,IAAexgD,IACpE,IAAI,MACFyzB,GACEzzB,EAwBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQu8I,GACRrZ,UAAW+X,GACX,iBAAkB,SAAqBp9I,GACrC,OAAO,SAAQA,EAAGxG,YClCpB,GAAe,CAAC,SACTylJ,IAA2B,QAF3B,MAEyC,IAAezgD,IACjE,IAAI,MACFyzB,GACEzzB,EA6BJ,OAAOyzB,EAlCE,MAkCU,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAOR,KAAKu/C,MAAM,EAAG/+C,IAEvBqlI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE7C,YAAY4hD,MAAM,EAAG/+C,IAEhCk3E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEjH,OAGX,iBAAkB,SAAqBiH,GACrC,OAAO,SAAQA,EAAGxG,YC7CpB,GAAe,CAAC,SACT0lJ,IAA0B,QAF1B,KAEwC,IAAe1gD,IAChE,IAAI,MACFyzB,GACEzzB,EA6BJ,OAAOyzB,EAlCE,KAkCU,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAO,GAETqlI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEi5F,IAAI,IAEf/hB,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEs3E,IAEX,iBAAkB,SAAqBt3E,GACrC,OAAO,SAAQA,EAAGxG,YC9CpB,GAAK,iBACF,SAAS2lJ,GAAUn/I,GACxB,OAAQA,EAGH,SAASo/I,GAASp/I,EAAGe,GAC1B,SAAUf,IAAKe,GAGV,SAASs+I,GAAUr/I,EAAGe,GAC3B,QAASf,KAAQe,EAGZ,SAASu+I,GAAUt/I,EAAGe,GAC3B,SAAUf,IAAKe,GAVjBo+I,GAAU5sB,UALD,SAST6sB,GAAS7sB,UAAY,GAIrB8sB,GAAU9sB,UAAY,GAItB+sB,GAAU/sB,UAAY,GCdtB,IACI,GAAe,CAAC,SACTgtB,IAA2B,QAF3B,MAEyC,IAAe/gD,IACjE,IAAI,MACFyzB,GACEzzB,EA2BJ,OAAOyzB,EAhCE,MAgCU,CACjB9vH,OAAQg9I,GACRjoE,QAAS,SAAiBl3E,GACxB,OAAgB,IAATA,EAAEuzB,IAAqB,IAATvzB,EAAEs3E,IAEzB+tD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE80F,UAAY90F,EAAEkC,SAEzB8yH,KAAM,SAAch1H,GAClB,OAAmB,OAAZA,EAAE/G,OAAiBO,KAAKwG,EAAE/G,QAEnC,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC3CpB,GAAe,CAAC,SACTgmJ,IAA8B,QAF9B,SAE4C,IAAehhD,IACpE,IAAI,MACFyzB,GACEzzB,EA+BJ,OAAOyzB,EAAM,SAAU,CACrB,kBAAmBwtB,GACnB,mBAAoB,SAAwBz/I,EAAGb,GAC7C,OAAOa,EAAE9C,OAAOuiJ,GAAgBz/I,EAAEutI,UAAWpuI,KAE/C,gBAAiB,MACjB,iBAAkB,SAAsBa,EAAGb,GACzC,OAAOa,EAAE9C,QAAO,SAAa8C,EAAEutI,UAAWpuI,UAYhD,SAASsgJ,GAAgBz/I,EAAG68B,GAE1B,IAAIpjC,GAAO,QAAiBojC,GAC5B,OAAO,SAAO78B,GAAG,SAAU/G,EAAOsI,EAAOhC,GAEvC,OAAa,IAAT9F,EACKojC,EAAS5jC,GACE,IAATQ,EACFojC,EAAS5jC,EAAO,CAACsI,IAGjBs7B,EAAS5jC,EAAO,CAACsI,GAAQhC,MClEtC,IAAI,GAAO,UACP,GAAe,CAAC,SACTmgJ,IAA+B,QAAQ,GAAM,IAAelhD,IACrE,IAAI,MACFyzB,GACEzzB,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB,kBAAmB8b,GACnB,mBAAoB,SAAwB/tI,EAAG68B,GAC7C,OAAO78B,EAAEuW,QAAQsmB,SAWvB,SAASkxG,GAASxuI,EAAOs9B,GAEvB,IAAIpjC,GAAO,QAAiBojC,IAEd,SAAS+wG,EAAQ30I,EAAOsI,GAChCnJ,MAAMoF,QAAQvE,IAChB,SAAaA,GAAO,SAAU0pF,EAAOzqF,GAEnC01I,EAAQjrD,EAAOphF,EAAM2D,OAAOhN,OAIjB,IAATuB,EACFojC,EAAS5jC,GACS,IAATQ,EACTojC,EAAS5jC,EAAOsI,GAGhBs7B,EAAS5jC,EAAOsI,EAAOhC,GAK7BquI,CAAQruI,EAAO,ICpEjB,IACI,GAAe,CAAC,SACTogJ,IAA2B,QAF3B,MAEyC,IAAenhD,IACjE,IAAI,MACFyzB,GACEzzB,EA0BJ,OAAOyzB,EA/BE,MA+BU,CACjB,kBAAmBt+D,GACnB,mBAAoB,SAAwB3zD,EAAG68B,GAC7C,OAAO78B,EAAEc,IAAI+7B,SAYnB,SAAS82B,GAAKp0D,EAAOs9B,GAEnB,IAAIpjC,GAAO,QAAiBojC,GAqB5B,OAnBc,SAAS+wG,EAAQ30I,EAAOsI,GACpC,OAAInJ,MAAMoF,QAAQvE,GACTA,EAAM6H,KAAI,SAAU6hF,EAAOzqF,GAEhC,OAAO01I,EAAQjrD,EAAOphF,EAAM2D,OAAOhN,OAIxB,IAATuB,EACKojC,EAAS5jC,GACE,IAATQ,EACFojC,EAAS5jC,EAAOsI,GAGhBs7B,EAAS5jC,EAAOsI,EAAOhC,GAK7BquI,CAAQruI,EAAO,ICnExB,IACI,GAAe,CAAC,SACTqgJ,IAA2B,QAF3B,MAEyC,IAAephD,IACjE,IAAI,MACFyzB,GACEzzB,EA0BJ,OAAOyzB,EAAM,OAAQ,CACnB9vH,OAAQ,SAAgBnC,GACtB,IAAIe,EAAIvB,KAAKgE,IAAIxD,GAEjB,OAAIe,GAAK8+I,IACA,QAAK7/I,GAGVe,GAAK++I,IACA,QAAK9/I,GAsBlB,SAAce,GACZ,IAGI7I,EAHA6nJ,EAAMh/I,EAAIA,EACVi/I,EAAOxtD,GAAE,GAAG,GAAKutD,EACjBE,EAAOF,EAGX,IAAK7nJ,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtB8nJ,GAAQA,EAAOxtD,GAAE,GAAGt6F,IAAM6nJ,EAC1BE,GAAQA,EAAOC,GAAE,GAAGhoJ,IAAM6nJ,EAG5B,OAAOh/I,GAAKi/I,EAAOxtD,GAAE,GAAG,KAAOytD,EAAOC,GAAE,GAAG,IAjCtBC,CAAKp/I,GAGpBA,GAAK,GACA,QAAKf,IAAM,EAwCxB,SAAee,GACb,IAEI7I,EAFA8nJ,EAAOxtD,GAAE,GAAG,GAAKzxF,EACjBk/I,EAAOl/I,EAGX,IAAK7I,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtB8nJ,GAAQA,EAAOxtD,GAAE,GAAGt6F,IAAM6I,EAC1Bk/I,GAAQA,EAAOC,GAAE,GAAGhoJ,IAAM6I,EAG5B,IAAIikB,GAAUg7H,EAAOxtD,GAAE,GAAG,KAAOytD,EAAOC,GAAE,GAAG,IACzCH,EAAMz9I,SAAa,GAAJvB,GAAU,GACzBq/I,GAAOr/I,EAAIg/I,IAAQh/I,EAAIg/I,GAC3B,OAAOvgJ,KAAKoD,KAAKm9I,EAAMA,GAAOvgJ,KAAKoD,KAAKw9I,GAAOp7H,EArDrBq7H,CAAMt/I,KAGvB,QAAKf,IAAM,EA+DtB,SAAee,GACb,IAGI7I,EAHA6nJ,EAAM,GAAKh/I,EAAIA,GACfi/I,EAAOxtD,GAAE,GAAG,GAAKutD,EACjBE,EAAOF,EAGX,IAAK7nJ,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtB8nJ,GAAQA,EAAOxtD,GAAE,GAAGt6F,IAAM6nJ,EAC1BE,GAAQA,EAAOC,GAAE,GAAGhoJ,IAAM6nJ,EAG5B,IAAI/6H,EAAS+6H,GAAOC,EAAOxtD,GAAE,GAAG,KAAOytD,EAAOC,GAAE,GAAG,IACnDl7H,GAAUs7H,GAAQt7H,GAAUjkB,EAE5B,IAAIq/I,GAAOr/I,GADXg/I,EAAMz9I,SAAa,GAAJvB,GAAU,MACFA,EAAIg/I,GAC3B,OAAOvgJ,KAAKoD,KAAKm9I,EAAMA,GAAOvgJ,KAAKoD,KAAKw9I,GAAOp7H,EA9EvBu7H,CAAMx/I,KAE9B,iBAAkB,SAAqB/B,GACrC,OAAO,SAAQA,EAAGxF,YAmFpBsmJ,GAAS,OAMTQ,GAAQ,kBAOR9tD,GAAI,CAAC,CAAC,mBAAwB,mBAAwB,iBAAwB,mBAAwB,oBAAyB,CAAC,kBAAwB,kBAAwB,kBAAwB,kBAAwB,iBAAwB,mBAAwB,mBAAwB,mBAAwB,uBAAyB,CAAC,mBAAwB,mBAAwB,mBAAwB,oBAAwB,qBAAwB,sBAOld0tD,GAAI,CAAC,CAAC,mBAAwB,mBAAwB,mBAAwB,mBAAyB,CAAC,mBAAwB,kBAAwB,kBAAwB,mBAAwB,mBAAwB,kBAAwB,mBAAwB,oBAAyB,CAAC,kBAAwB,mBAAwB,kBAAwB,mBAAwB,uBAO1YL,GAAUrgJ,KAAK2B,IAAI,EAAG,IClKtB,GAAO,SACP,GAAe,CAAC,SACTq/I,IAA8B,QAAQ,GAAM,IAAehiD,IACpE,IAAI,MACFyzB,GACEzzB,EAkHJ,OAAOyzB,EAAM,GAAM,CACjBW,IAAK,MACL,kCAAmC,WClG5B6tB,IAAY,QAxBZ,MACQ,CAAC,QAAS,WAuBuBjiD,IAClD,IAAI,MACFyzB,EAAK,OACL4Q,GACErkC,EACJ,OAAOyzB,EA7BE,MA6BU,CACjB,qBAAsB,SAAyBjzH,GAC7C,OAAO6jI,EAAO7jI,EAAG,CACf0hJ,SAAU,SAGd,6BAA8B,SAA+B1hJ,EAAG2hJ,GAC9D,OAAO9d,EAAO7jI,EAAG,CACf0hJ,SAAU,MACVC,SAAUA,UCpCd,GAAO,QACP,GAAe,CAAC,SACTC,IAA6B,QAAQ,GAAM,IAAepiD,IACnE,IAAI,MACFyzB,GACEzzB,EA8CJ,OAAOyzB,EAAM,GAAM,CAEjB,yBAA0B4uB,GAC1B,0CAA2CA,QAY/C,SAASA,GAAO/qB,EAAUxwH,EAAQqP,GAChC,OAAOmhH,EAASz2G,QAAQ,eAAe,SAAUyhI,EAAUhoJ,GAIzD,IAHA,IAAImH,EAAOnH,EAAIwtB,MAAM,KACjBrtB,EAAQqM,EAAOrF,EAAKm4F,SAEjBn4F,EAAKhI,aAAoB4B,IAAVZ,GAAqB,CACzC,IAAIiH,EAAID,EAAKm4F,QACbn/F,EAAQiH,EAAIjH,EAAMiH,GAAKjH,EAAQ,IAGjC,YAAcY,IAAVZ,GACG,EAAAqoH,EAAA,IAASroH,GAGLA,GAFA,SAAOA,EAAO0b,GAMlBmsI,KCrFX,IAAI,GAAO,UACP,GAAe,CAAC,SACTC,IAA+B,QAAQ,GAAM,IAAeviD,IACrE,IAAI,MACFyzB,GACEzzB,EA8BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,GAAQ,EAAJA,GAAU,EACZ,OAAO,EAGT,GAAIA,GAAK,EACP,OAAOA,EAAI,EAGb,GAAIA,EAAI,GAAM,GAAKA,EAAI,GAAM,EAC3B,OAAO,EAGT,IAAK,IAAI9H,EAAI,EAAGA,EAAIA,GAAK8H,EAAG9H,GAAK,EAC/B,GAAI8H,EAAI9H,GAAM,GAAK8H,GAAK9H,EAAI,IAAO,EACjC,OAAO,EAIX,OAAO,GAETmtI,UAAW,SAAmBrmI,GAC5B,GAAmB,EAAfA,EAAEg7F,YAAmB,EACvB,OAAO,EAGT,GAAIh7F,EAAE63F,IAAI,GAAI,OAAO73F,EAAE02F,GAAG,GAC1B,GAAI12F,EAAEs5F,IAAI,GAAGrD,GAAG,IAAMj2F,EAAEs5F,IAAI,GAAGrD,GAAG,GAAI,OAAO,EAE7C,IAAK,IAAI/8F,EAAI,EAAG8G,EAAE42F,IAAI19F,EAAIA,GAAIA,GAAK,EACjC,GAAI8G,EAAEs5F,IAAIpgG,GAAG+8F,GAAG,IAAMj2F,EAAEs5F,IAAIpgG,EAAI,GAAG+8F,GAAG,GACpC,OAAO,EAIX,OAAO,GAET,iBAAkB,SAAqBj1F,GACrC,OAAO,SAAQA,EAAGxG,YC1EpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5BwnJ,IAA4B,QAAQ,GAAM,IAAexiD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,GACEsnB,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKoiB,EAAOi+F,YACvB7gH,KAAKu4E,KAAK/3E,GAEV,IAAIk3E,EAAQl3E,EAAG,GAAG+3E,QAG7Bb,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE+3E,QAEXstD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE+3E,QAEX,iBAAkB,SAAqB/3E,GACrC,OAAO,SAAQA,EAAGxG,YChDpB,GAAK,SAMF,SAASynJ,GAAYjhJ,GAC1B,OAAO,QAAMA,GAGR,SAASkhJ,GAAWlhJ,GACzB,OAAOR,KAAKs4E,KAAK,EAAI93E,GAGhB,SAASmhJ,GAAYnhJ,GAC1B,OAAOo7D,SAASp7D,IAAMR,KAAKiF,KAAKzE,EAAI,GAAKA,GAAKR,KAAKiF,IAAIzE,GAAKA,EAAI,KAAO,EAAI,EAGtE,SAASohJ,GAAWphJ,GACzB,OAAOR,KAAKw4E,KAAK,EAAIh4E,GAGhB,SAASqhJ,GAAYrhJ,GAC1B,IAAIshJ,EAAO,EAAIthJ,EACf,OAAOR,KAAKiF,IAAI68I,EAAO9hJ,KAAKC,KAAK6hJ,EAAOA,EAAO,IAG1C,SAASC,GAAWvhJ,GACzB,OAAOR,KAAKu4E,KAAK,EAAI/3E,GAGhB,SAASwhJ,GAAYxhJ,GAC1B,IAAIshJ,EAAO,EAAIthJ,EACXwB,EAAMhC,KAAKC,KAAK6hJ,EAAOA,EAAO,GAClC,OAAO9hJ,KAAKiF,IAAIjD,EAAM8/I,GAOjB,SAASG,GAAYzhJ,GAC1B,OAAO,QAAMA,GAWR,SAAS0hJ,GAAY1hJ,GAC1B,OAAO,QAAMA,GAWR,SAAS2hJ,GAAU3hJ,GACxB,OAAO,EAAIR,KAAKw5F,IAAIh5F,GAGf,SAAS4hJ,GAAW5hJ,GACzB,IAAIrF,EAAI6E,KAAKoD,IAAI,EAAI5C,GACrB,OAAQrF,EAAI,IAAMA,EAAI,GAGjB,SAASknJ,GAAU7hJ,GACxB,OAAO,EAAIR,KAAK6O,IAAIrO,GAGf,SAAS8hJ,GAAW9hJ,GAEzB,OAAU,IAANA,EACKqB,OAAOq/E,kBAEPlhF,KAAKgE,IAAI,GAAKhE,KAAKoD,IAAI5C,GAAKR,KAAKoD,KAAK5C,MAAO,QAAKA,GAItD,SAAS+hJ,GAAU/hJ,GACxB,OAAO,EAAIR,KAAK2O,IAAInO,GAGf,SAASgiJ,GAAWhiJ,GACzB,OAAO,GAAKR,KAAKoD,IAAI5C,GAAKR,KAAKoD,KAAK5C,IAO/B,SAASiiJ,GAAWjiJ,GACzB,OAAO,QAAKA,GA3FdihJ,GAAY1uB,UAAY,GAIxB2uB,GAAW3uB,UAAY,GAIvB4uB,GAAY5uB,UAAY,GAIxB6uB,GAAW7uB,UAAY,GAKvB8uB,GAAY9uB,UAAY,GAIxBgvB,GAAWhvB,UAAY,GAMvBivB,GAAYjvB,UAAY,GAQxBkvB,GAAYlvB,UAAY,GAYxBmvB,GAAYnvB,UAAY,GAYxBovB,GAAUpvB,UAAY,GAKtBqvB,GAAWrvB,UAAY,GAIvBsvB,GAAUtvB,UAAY,GAStBuvB,GAAWvvB,UAAY,GAIvBwvB,GAAUxvB,UAAY,GAItByvB,GAAWzvB,UAAY,GAQvB0vB,GAAW1vB,UAAY,GCpGvB,IAAI,GAAO,OACP,GAAe,CAAC,QAAS,aAClB2vB,IAA4B,QAAQ,GAAM,IAAe1jD,IAClE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ++I,GACRhqE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE0pH,QAEX2b,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,GAAG83E,QAElC,iBAAkB,SAAqB93E,GACrC,OAAO,SAAQA,EAAGxG,YCxCpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvC2oJ,IAA4B,QAAQ,GAAM,IAAe3jD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,EACAmuD,UAAW0X,GACTv+C,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKoiB,EAAOi+F,YACvB+gC,GAAWphJ,GAGb,IAAIk3E,EAAQl3E,EAAG,GAAG4pH,QAE3B1yC,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE4pH,QAEXyb,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,GAAGg4E,QAElC,iBAAkB,SAAqBh4E,GACrC,OAAO,SAAQA,EAAGxG,YChDpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvC4oJ,IAA4B,QAAQ,GAAM,IAAe5jD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,EACAmuD,UAAW0X,GACTv+C,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKoiB,EAAOi+F,YACvBkhC,GAAWvhJ,GAGb,IAAIk3E,EAAQl3E,EAAG,GAAG8pH,QAE3B5yC,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE8pH,QAEXub,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,GAAG+3E,QAElC,iBAAkB,SAAqB/3E,GACrC,OAAO,SAAQA,EAAGxG,YCjDpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5B6oJ,IAA4B,QAAQ,GAAM,IAAe7jD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,GACEsnB,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKoiB,EAAOi+F,YACvB7gH,KAAKw4E,KAAKh4E,GAEV,IAAIk3E,EAAQl3E,EAAG,GAAGg4E,QAG7Bd,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEg4E,QAEXqtD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEg4E,QAEX,iBAAkB,SAAqBh4E,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SC/C1B,GAAe,CAAC,SACT8oJ,IAA4B,QAF5B,OAE0C,IAAe9jD,IAClE,IAAI,MACFyzB,GACEzzB,EAyBJ,OAAOyzB,EAAM,OAAQ,CACnB9vH,OAAQ,SAAgBnC,GACtB,OAAOR,KAAKs4E,KAAK93E,IAEnBk3E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE83E,QAEXutD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE83E,QAEX,iBAAkB,SAAqB93E,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SCzC1B,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAC5B+oJ,IAA6B,QAAQ,GAAM,IAAe/jD,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,GACEsnB,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,GAAK,GAAKA,IAAM,GAAKoiB,EAAOi+F,YACvBqhC,GAAY1hJ,GAGd,IAAIk3E,EAAQl3E,EAAG,GAAGo4E,SAE3BlB,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEo4E,SAEXitD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEo4E,SAEX,iBAAkB,SAAqBp4E,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SC9C1B,GAAO,OACP,GAAe,CAAC,SACTgpJ,IAA4B,QAAQ,GAAM,IAAehkD,IAClE,IAAI,MACFyzB,GACEzzB,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,KACR+0E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE22E,QAEX0uD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE22E,QAEXq+C,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,qCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC5CpB,GAAO,OACP,GAAe,CAAC,QAAS,aAClBmpJ,IAA4B,QAAQ,GAAM,IAAenkD,IAClE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQy/I,GACR1qE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEiqH,QAEXob,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,EAAEu2F,SAEjCy+B,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,qCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC/CpB,GAAO,OACP,GAAe,CAAC,QAAS,aAClBopJ,IAA4B,QAAQ,GAAM,IAAepkD,IAClE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ2/I,GACR5qE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEmqH,QAEXkb,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,EAAE42E,SAEjCo+C,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,qCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC/CpB,GAAO,OACP,GAAe,CAAC,QAAS,aAClBqpJ,IAA4B,QAAQ,GAAM,IAAerkD,IAClE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ6/I,GACR9qE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEqqH,QAEXgb,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,EAAE22E,SAEjCq+C,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,qCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC/CpB,GAAO,OACP,GAAe,CAAC,SACTspJ,IAA4B,QAAQ,GAAM,IAAetkD,IAClE,IAAI,MACFyzB,GACEzzB,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ8/I,GACR/qE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE42E,QAEXyuD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE42E,QAEXo+C,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,qCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SC5C1B,GAAe,CAAC,SACTupJ,IAA4B,QAF5B,OAE0C,IAAevkD,IAClE,IAAI,MACFyzB,GACEzzB,EA0BJ,OAAOyzB,EAAM,OAAQ,CACnB9vH,OAAQ,KACR+0E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEu2F,QAEX8uC,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEu2F,QAEXy+B,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,qCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SC/CvB,SAASwpJ,GAAQ9qJ,EAAG8G,GACzB,GAAIA,EAAI9G,EACN,OAAO,EAGT,GAAI8G,IAAM9G,EACR,OAAO8G,EAGT,IAAIikJ,EAAOjkJ,EAAI9G,GAAK,EAEpB,OAAO8qJ,GAAQ9qJ,EAAG+qJ,GAAQD,GAAQC,EAAO,EAAGjkJ,GCbvC,SAASkkJ,GAAmBlkJ,EAAGkB,GACpC,KAAK,OAAUlB,IAAMA,EAAI,EACvB,MAAM,IAAI/E,UAAU,4DAGtB,KAAK,OAAUiG,IAAMA,EAAI,EACvB,MAAM,IAAIjG,UAAU,4DAGtB,GAAIiG,EAAIlB,EACN,MAAM,IAAI/E,UAAU,qCAGtB,IAAIkpJ,EAAUnkJ,EAAIkB,EAGlB,OAAIA,EAAIijJ,EACMH,GAAQG,EAAU,EAAGnkJ,GACdgkJ,GAAQ,EAAG9iJ,GAGpB8iJ,GAAQ9iJ,EAAI,EAAGlB,GACRgkJ,GAAQ,EAAGG,GAEhCD,GAAmB3wB,UAAY,iBCxB/B,IAAI,GAAO,eACP,GAAe,CAAC,SACT6wB,IAAoC,QAAQ,GAAM,IAAe5kD,IAC1E,IAAI,MACFyzB,GACEzzB,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkBixB,GAClB,uBAAwB,SAA4BlkJ,EAAGkB,GACrD,IACI8kB,EAAQ9sB,EADRmtI,EAAYrmI,EAAE7B,YAEdgmJ,EAAUnkJ,EAAEwN,MAAMtM,GAClB41F,EAAM,IAAIuvC,EAAU,GAExB,IAAKge,GAAkBrkJ,KAAOqkJ,GAAkBnjJ,GAC9C,MAAM,IAAIjG,UAAU,4DAGtB,GAAIiG,EAAEw1F,GAAG12F,GACP,MAAM,IAAI/E,UAAU,kDAKtB,GAFA+qB,EAAS8wE,EAEL51F,EAAEy3F,GAAGwrD,GACP,IAAKjrJ,EAAI49F,EAAK59F,EAAE2+F,IAAIssD,GAAUjrJ,EAAIA,EAAEiX,KAAK2mF,GACvC9wE,EAASA,EAAO5V,MAAMlP,EAAEiP,KAAKjX,IAAIk9F,UAAUl9F,QAG7C,IAAKA,EAAI49F,EAAK59F,EAAE2+F,IAAI32F,GAAIhI,EAAIA,EAAEiX,KAAK2mF,GACjC9wE,EAASA,EAAO5V,MAAM+zI,EAAQh0I,KAAKjX,IAAIk9F,UAAUl9F,GAIrD,OAAO8sB,QAWb,SAASq+H,GAAkBrkJ,GACzB,OAAOA,EAAE8zD,aAAe9zD,EAAE42F,IAAI,G,eCvE5B0tD,GAAiCC,GAAW31I,KAAKD,OAC9C,SAAS,GAAU2yG,GACxB,IAAI/nF,EAEairH,EAWjB,OAVEjrH,EAAkB,QADHirH,EAKTljC,GAJmBgjC,GAAkBC,GAAWv/I,OAAOw/I,IAM/D,WACE,OAAOjrH,KCTX,IACI,GAAe,CAAC,QAAS,SAAU,OAC5BkrH,IAAkC,QAFlC,aAEgD,IAAejlD,IACxE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,GACNV,GACE88E,EAEAklD,EAAM,GAAUthI,EAAOk+F,YA8C3B,OA5CI5+F,GACFA,EAAG,UAAU,SAAUw4D,EAAMD,GACvBC,EAAKomC,aAAermC,EAAKqmC,aAC3BojC,EAAM,GAAUxpE,EAAKomC,gBAyCpB2R,EAAM,CACX,iBAAkB,SAAqB0xB,GACrC,OAAOC,EAAYD,EAAW,KAEhC,yBAA0B,SAA2BA,EAAWhvI,GAC9D,OAAOivI,EAAYD,EAAWhvI,IAEhC,yBAA0B,SAA2BgvI,EAAWxhJ,GAC9D,OAAOyhJ,EAAYD,EAAW,CAC5BxhJ,YAGJ,iCAAkC,SAAgCwhJ,EAAWE,GAC3E,OAAOD,EAAYD,EAAW,CAC5BE,aAGJ,yCAA0C,SAAsCF,EAAWE,EAAS1hJ,GAClG,OAAOyhJ,EAAYD,EAAW,CAC5BxhJ,SACA0hJ,aAGJ,yCAA0C,SAAsCF,EAAWxhJ,EAAQ0hJ,GACjG,OAAOD,EAAYD,EAAW,CAC5BxhJ,SACA0hJ,eAeN,SAASD,EAAYD,EAAWvS,GAC9B,IAAI,OACFjvI,EAAM,QACN0hJ,EAAO,YACPC,GAAc,GACZ1S,EACA2S,OAA2B,IAAX5hJ,EAEhB4hJ,IACF5hJ,EAAS,GAGX,IAAI6hJ,GAAe,EAAA1iC,EAAA,IAASqiC,GAAaA,EAAUzmJ,QAAS,EAAAokH,EAAA,IAASuiC,GAAWA,EAAQ3mJ,OAAS,KACjGymJ,EAAYA,EAAUlpJ,UAElBopJ,IACFA,EAAUA,EAAQppJ,YAGA,IAAhBqpJ,IACFH,GAAY,SAAQA,GACpBE,GAAU,SAAQA,IAGpB,IAAII,EAAe,EAEnB,QAAuB,IAAZJ,EAAyB,CAClC,GAAIA,EAAQ5rJ,SAAW0rJ,EAAU1rJ,OAC/B,MAAM,IAAI0N,MAAM,kDAGlB,IAAK,IAAIzN,EAAI,EAAGF,EAAM6rJ,EAAQ5rJ,OAAQC,EAAIF,EAAKE,IAAK,CAClD,KAAK,EAAAopH,EAAA,IAASuiC,EAAQ3rJ,KAAO2rJ,EAAQ3rJ,GAAK,EACxC,MAAM,IAAIyN,MAAM,gDAGlBs+I,GAAgBJ,EAAQ3rJ,IAQ5B,IAJA,IAEIsmF,EAFAvmF,EAAS0rJ,EAAU1rJ,OACnB+sB,EAAS,GAGNA,EAAO/sB,OAASkK,GAAQ,CAC7B,QAAuB,IAAZ0hJ,EACTrlE,EAAOmlE,EAAUnkJ,KAAKiC,MAAMiiJ,IAAQzrJ,SAIpC,IAFA,IAAIisJ,EAAUR,IAAQO,EAEbjmJ,EAAK,EAAGmmJ,EAAOR,EAAU1rJ,OAAQ+F,EAAKmmJ,EAAMnmJ,IAGnD,IAFAkmJ,GAAWL,EAAQ7lJ,IAEL,EAAG,CACfwgF,EAAOmlE,EAAU3lJ,GACjB,MAKNgnB,EAAOhqB,KAAKwjF,GAGd,OAAOulE,EAAS/+H,EAAO,GAAKg/H,EAAeA,EAAah/H,GAAUA,MC7J/D,SAASo/H,GAAav3I,EAAM0rB,GACjC,IAAIlnB,EAAO,GAGX,IAFAxE,EAAOA,EAAKvO,MAAM,IAETrG,OAAS,EAChB,IAAK,IAAIC,EAAI,EAAGD,EAAS4U,EAAKurF,QAASlgG,EAAID,EAAQC,IACjDmZ,EAAKrW,KAAKopJ,GAAav3I,EAAM0rB,SAG/B,IAAK,IAAIv6B,EAAK,EAAGqmJ,EAAUx3I,EAAKurF,QAASp6F,EAAKqmJ,EAASrmJ,IACrDqT,EAAKrW,KAAKu9B,KAId,OAAOlnB,EChBT,IAAI,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,OAC5BizI,IAAiC,QAAQ,GAAM,IAAe9lD,IACvE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,GACNV,GACE88E,EAEAklD,EAAM,GAAUthI,EAAOk+F,YAwC3B,OAtCI5+F,GACFA,EAAG,UAAU,SAAUw4D,EAAMD,GACvBC,EAAKomC,aAAermC,EAAKqmC,aAC3BojC,EAAM,GAAUxpE,EAAKomC,gBAmCpB2R,EAAM,GAAM,CACjB,GAAI,IAAMsyB,EAAW,EAAG,GACxBpiJ,OAAQ8G,GAAOs7I,EAAW,EAAGt7I,GAC7B,iBAAkB,CAAC+iB,EAAK/iB,IAAQs7I,EAAWv4H,EAAK/iB,GAChD,iBAAkB4D,GAAQ23I,EAAiB33I,EAAM,EAAG,GACpD,yBAA0B,CAACA,EAAM5D,IAAQu7I,EAAiB33I,EAAM,EAAG5D,GACnE,iCAAkC,CAAC4D,EAAMmf,EAAK/iB,IAAQu7I,EAAiB33I,EAAMmf,EAAK/iB,KAGpF,SAASu7I,EAAiB33I,EAAMmf,EAAK/iB,GACnC,IAAIgjE,EAAMm4E,GAAav3I,EAAKpS,WAAW,IAAM8pJ,EAAWv4H,EAAK/iB,KAC7D,OAAO,EAAAq4G,EAAA,IAASz0G,GAAQA,EAAK3P,OAAO+uE,GAAOA,EAG7C,SAASs4E,EAAWv4H,EAAK/iB,GACvB,OAAOzJ,KAAKiC,MAAMuqB,EAAM03H,KAASz6I,EAAM+iB,QClEvC,GAAO,QACP,GAAe,CAAC,SACTy4H,IAA6B,QAAQ,GAAM,IAAejmD,IACnE,IAAI,MACFyzB,GACEzzB,EAoBJ,OAAOyzB,EAAM,GAAM,CACjBW,IAAKr2H,GAAA,QC3BL,GAAO,kBACP,GAAe,CAAC,QAAS,aAClBmoJ,IAAuC,QAAQ,GAAM,IAAelmD,IAC7E,IAAI,MACFyzB,EAAK,UACLgR,GACEzkC,EA+BJ,OAAOyzB,EAAM,GAAM,CACjBve,OAAQ,SAAgB1zG,GACtB,OAAOA,EAAEymE,OAAOxuE,OAAS,IAAMiK,MAAMb,OAAOrB,KAE9C4yH,IAAK,SAAa5yH,GAChB,OAAOijI,EAAUjjI,SCzCnB,GAAO,SACP,GAAe,CAAC,SACT2kJ,IAA8B,QAAQ,GAAM,IAAenmD,IACpE,IAAI,MACFyzB,GACEzzB,EA4DJ,OAAOyzB,EAAM,GAAM,CACjBW,IAAK,UCjEL,GAAO,SACP,GAAe,CAAC,SACTgyB,IAA8B,QAAQ,GAAM,IAAepmD,IACpE,IAAI,MACFyzB,GACEzzB,EA2BJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,MAAO,IAET9vH,OAAQ,KACR40H,KAAM,SAAe/2H,GACnB,MAAO,QAETm8H,QAAS,SAAiBn8H,GACxB,OAAOA,EAAI,IAEb0zG,OAAQ,SAAgB1zG,GACtB,OAAOA,GAET,iBAAkB,SAAqBA,GACrC,OAAO,SAAQA,EAAGxG,OAEpBo5H,IAAK,SAAa5yH,GAChB,OAAOgE,OAAOhE,SClDhB,GAAe,CAAC,QAAS,YAClB6kJ,IAAgC,QAFhC,WAE8C,IAAermD,IACtE,IAAI,MACFyzB,EAAK,SACL3yB,GACEd,EA2BJ,OAAOyzB,EAAM,WAAY,CACvB9vH,OAAQ,SAAgBnC,GACtB,IAAKo7D,SAASp7D,IAAMkC,MAAMlC,GACxB,MAAM,IAAI2F,MAAM3F,EAAI,wCAGtB,OAAO,IAAIs/F,EAASt/F,IAEtB0zG,OAAQ,SAAgB1zG,GACtB,OAAO,IAAIs/F,EAASt/F,IAEtB,iBAAkB,SAAsBsD,EAAWC,GACjD,OAAO,IAAI+7F,EAASh8F,EAAWC,IAEjCwzH,KAAM,SAAe/2H,GACnB,OAAO,IAAIs/F,EAAS,IAEtB+lC,UAAW,SAAmBrlI,GAC5B,OAAO,IAAIs/F,EAASt/F,EAAEf,aAExBqgG,SAAU,SAAkBt/F,GAC1B,OAAOA,GAETrE,OAAQ,SAAgBqE,GACtB,OAAO,IAAIs/F,EAASt/F,IAEtB,iBAAkB,SAAqBA,GACrC,OAAO,SAAQA,EAAGxG,YC3DpB,GAAO,aACP,GAAe,CAAC,SACTsrJ,IAAkC,QAAQ,GAAM,IAAetmD,IACxE,IAAI,MACFyzB,GACEzzB,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ+4I,GACRhkE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEw0F,OAEX6wC,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEw0F,OAEX8K,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEw0F,OAEXwgC,KAAM,SAAch1H,GAClB,IAAIisE,EAAMjsE,EAAEy9F,QAEZ,OADAxxB,EAAIhzE,MAAQO,KAAKwG,EAAE/G,OACZgzE,GAET,iBAAkB,SAAqBjsE,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SCjD1B,GAAO,YACP,GAAe,CAAC,SACTurJ,IAAiC,QAAQ,GAAM,IAAevmD,IACvE,IAAI,MACFyzB,GACEzzB,EAcJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB+oB,GAClB,mBAAoB,SAAwBh7I,EAAGe,GAC7C,OAAOf,EAAE+F,IAAIhF,IAEf,uBAAwB,SAA4Bf,EAAGe,GACrD,OAAOf,EAAEmP,KAAKpO,IAEhB,qBAAsB,SAA0Bf,EAAGe,GACjD,OAAOf,EAAE+F,IAAIhF,IAEf,aAAc,SAAkBf,EAAGe,GACjC,GAAgB,OAAZf,EAAE/G,YAA8BY,IAAZmG,EAAE/G,MAAqB,MAAM,IAAI0M,MAAM,oDAC/D,GAAgB,OAAZ5E,EAAE9H,YAA8BY,IAAZkH,EAAE9H,MAAqB,MAAM,IAAI0M,MAAM,oDAC/D,IAAK3F,EAAEg6I,UAAUj5I,GAAI,MAAM,IAAI4E,MAAM,sBACrC,IAAIsmE,EAAMjsE,EAAEy9F,QAGZ,OAFAxxB,EAAIhzE,MAAQO,KAAKyyE,EAAIhzE,MAAO8H,EAAE9H,OAC9BgzE,EAAI0qE,WAAY,EACT1qE,QCnCT,GAAe,CAAC,SACT+4E,IAA2B,QAF3B,MAEyC,IAAexmD,IACjE,IAAI,MACFyzB,GACEzzB,EA8BJ,OAAOyzB,EAnCE,MAmCU,CACjB9vH,OAAQo5I,GACRrkE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE4C,OAEXyiI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE4C,OAEX,iBAAkB,SAAqB5C,GAErC,OAAO,SAAQA,EAAGxG,YC7CpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5ByrJ,IAA4B,QAAQ,GAAM,IAAezmD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,GACEsnB,EA2BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,GAAK,GAAKoiB,EAAOi+F,YACZw7B,GAAW77I,GAGXklJ,EAAa,IAAIhuE,EAAQl3E,EAAG,KAGvCk3E,QAASguE,EACT7f,UAAW,SAAmBrlI,GAC5B,OAAKA,EAAEu3F,cAAgBn1E,EAAOi+F,YACrBrgH,EAAEyE,IAAI,GAGNygJ,EAAa,IAAIhuE,EAAQl3E,EAAEg6F,WAAY,KAGlD,iBAAkB,SAAqBh6F,GACrC,OAAO,SAAQA,EAAGxG,SAUtB,SAAS0rJ,EAAallJ,GACpB,IAAImlJ,EAAO3lJ,KAAKC,KAAKO,EAAEuzB,GAAKvzB,EAAEuzB,GAAKvzB,EAAEs3E,GAAKt3E,EAAEs3E,IAC5C,OAAO,IAAIJ,EAAQ13E,KAAKgiD,KAAOhiD,KAAKgiD,KAAK2jG,GAAQ3lJ,KAAKiF,IAAI0gJ,GAAQ3lJ,KAAK+8H,IAAK/8H,KAAKu/C,MAAM/+C,EAAEs3E,GAAIt3E,EAAEuzB,IAAM/zB,KAAK+8H,SCjE1G,GAAe,CAAC,SAAU,QAAS,WAC5B6oB,IAA4B,QAF5B,OAE0C,IAAe5mD,IAClE,IAAI,OACFp8E,EAAM,MACN6vG,EAAK,QACL/6C,GACEsnB,EA0BJ,OAAOyzB,EAAM,OAAQ,CACnB9vH,OAAQkjJ,EACRnuE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEP,QAEX4lI,UAAW,SAAmBrlI,GAC5B,OAAKA,EAAEu3F,cAAgBn1E,EAAOi+F,YACrBrgH,EAAEP,OAGF4lJ,EAAYrlJ,EAAEg6F,aAGzB,iBAAkB,SAAqBh6F,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1Bw7H,KAAM,SAAch1H,GAElB,OAAOA,EAAEmB,IAAI,OAUjB,SAASkkJ,EAAYrlJ,GACnB,OAAIkC,MAAMlC,GACDy4E,IACEz4E,GAAK,GAAKoiB,EAAOi+F,YACnB7gH,KAAKC,KAAKO,GAEV,IAAIk3E,EAAQl3E,EAAG,GAAGP,WCpE3B,GAAO,OACP,GAAe,CAAC,SACT6lJ,IAA4B,QAAQ,GAAM,IAAe9mD,IAClE,IAAI,MACFyzB,GACEzzB,EA2BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAOA,GAETqlI,UAAW,SAAmBrlI,GAC5B,OAAOA,GAETk3E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEulJ,aAEX,iBAAkB,SAAqBvlJ,GACrC,OAAO,SAAQA,EAAGxG,YC1CpB,GAAO,oBACP,GAAe,CAAC,SACTgsJ,IAAyC,QAAQ,GAAM,IAAehnD,IAC/E,IAAI,MACFyzB,GACEzzB,EAoCJ,OAAOyzB,EAAM,GAAM,CACjB75H,MAAO,SAAe4H,GACpB,OAAO,SAAiBA,EAAG,OAE7BuvI,OAAQ,SAAgBvvI,GACtB,OAAOA,EAAEk4I,oBC/CX,GAAO,OACP,GAAe,CAAC,QAAS,QAAS,aAC3BuN,IAA4B,QAAQ,GAAM,IAAejnD,IAClE,IAAI,MACFyzB,EAAK,MACL/vH,EAAK,UACL+gI,GACEzkC,EA2BJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkByzB,EAClB,MAAO,SAAWjsJ,GAChB,OAAOisJ,EAAMjsJ,MAUjB,SAASisJ,EAAMpgJ,GAIb,GAAY,KAHZA,GAAS,SAAQA,EAAO7K,YACPxC,OAGf,MAAM,IAAI0N,MAAM,2CAOlB,IAJA,IAAIytE,EAAQ,GACR3wE,EAAO,GACPwG,EAAM,EAED/Q,EAAI,EAAGA,EAAIoN,EAAOrN,OAAQC,IAAK,CACtC,IAAIe,EAAQqM,EAAOpN,GAEnB,GAAI+qI,EAAUhqI,IAAUiJ,EAAMjJ,GAC5B,MAAM,IAAI0M,MAAM,2DAGZ1M,KAASm6E,IACbA,EAAMn6E,GAAS,GAGjBm6E,EAAMn6E,KAEFm6E,EAAMn6E,KAAWgQ,EACnBxG,EAAKzH,KAAK/B,GACDm6E,EAAMn6E,GAASgQ,IACxBA,EAAMmqE,EAAMn6E,GACZwJ,EAAO,CAACxJ,IAIZ,OAAOwJ,MCzDAkjJ,IAAY,QAxBZ,MACQ,CAAC,QAAS,WAuBuBnnD,IAClD,IAAI,MACFyzB,EAAK,OACL4Q,GACErkC,EACJ,OAAOyzB,EA7BE,MA6BU,CACjB,qBAAsB,SAAyBjzH,GAC7C,OAAO6jI,EAAO7jI,EAAG,CACf0hJ,SAAU,SAGd,6BAA8B,SAA+B1hJ,EAAG2hJ,GAC9D,OAAO9d,EAAO7jI,EAAG,CACf0hJ,SAAU,MACVC,SAAUA,UCpCd,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAC5BiF,IAA6B,QAAQ,GAAM,IAAepnD,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,GACEsnB,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,GAAK,GAAKoiB,EAAOi+F,YACZ4gC,GAAYjhJ,GAGjBA,IAAM,EACD,IAAIk3E,EAAQ13E,KAAKiF,IAAIjF,KAAKC,KAAKO,EAAIA,EAAI,GAAKA,GAAIR,KAAKsO,IAGvD,IAAIopE,EAAQl3E,EAAG,GAAGs4E,SAE3BpB,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEs4E,SAEX+sD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEs4E,SAEX,iBAAkB,SAAqBt4E,GACrC,OAAO,SAAQA,EAAGxG,YCjDpB,GAAO,QACP,GAAe,CAAC,QAAS,aAClBqsJ,IAA6B,QAAQ,GAAM,IAAernD,IACnE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQk/I,GACRnqE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE6pH,SAEXwb,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,GAAGq4E,SAElC,iBAAkB,SAAqBr4E,GACrC,OAAO,SAAQA,EAAGxG,YCrCpB,GAAe,CAAC,SACTssJ,IAA6B,QAF7B,QAE2C,IAAetnD,IACnE,IAAI,MACFyzB,GACEzzB,EAuBJ,OAAOyzB,EAAM,QAAS,CACpB9vH,OAAQs/I,GACRvqE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEq4E,SAEXgtD,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEq4E,SAEX,iBAAkB,SAAqBr4E,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SCtC1B,GAAe,CAAC,SACTusJ,IAA2B,QAF3B,MAEyC,IAAevnD,IACjE,IAAI,MACFyzB,GACEzzB,EA4BJ,OAAOyzB,EAjCE,MAiCU,CACjB9vH,OAAQ3C,KAAK2O,IACb+oE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEmO,OAEXk3H,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEmO,OAEX6mH,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,oCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC/CpB,GAAe,CAAC,QAAS,aAClBwsJ,IAA2B,QAF3B,MAEyC,IAAexnD,IACjE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAuBJ,OAAOyzB,EA7BE,MA6BU,CACjB9vH,OAAQ0/I,GACR3qE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEkqH,OAEXmb,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,EAAEqO,QAEjC2mH,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,oCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC7CpB,GAAe,CAAC,SACTysJ,IAA2B,QAF3B,MAEyC,IAAeznD,IACjE,IAAI,MACFyzB,GACEzzB,EA4BJ,OAAOyzB,EAjCE,MAiCU,CACjB9vH,OAAQ3C,KAAK6O,IACb6oE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEqO,OAEXg3H,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEqO,OAEX2mH,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,oCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SCjD1B,GAAO,sBACP,GAAe,CAAC,SACT0sJ,IAA2C,QAAQ,GAAM,IAAe1nD,IACjF,IAAI,MACFyzB,GACEzzB,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAsBjzH,EAAGkB,GACzC,KAAK,OAAUlB,IAAMA,EAAI,EACvB,MAAM,IAAI/E,UAAU,mEAGtB,KAAK,OAAUiG,IAAMA,EAAI,EACvB,MAAM,IAAIjG,UAAU,mEAGtB,GAAI+E,EAAI,EACN,MAAM,IAAI/E,UAAU,6CAGtB,OAAIiG,EAAIlB,EAAI,EACOgkJ,GAAQhkJ,EAAGA,EAAIkB,EAAI,GAEhB8iJ,GAAQ,EAAG9iJ,GAGjB8iJ,GAAQ9iJ,EAAI,EAAGlB,EAAIkB,EAAI,GACpB8iJ,GAAQ,EAAGhkJ,EAAI,IAEpC,uBAAwB,SAA4BA,EAAGkB,GACrD,IACI8kB,EAAQ9sB,EACR49F,EAAM,IAAIuvC,EAFErmI,EAAE7B,aAEM,GACpBgpJ,EAAYnnJ,EAAEwN,MAAMspF,GAExB,IAAK,GAAkB92F,KAAO,GAAkBkB,GAC9C,MAAM,IAAIjG,UAAU,mEAGtB,GAAI+E,EAAE24F,GAAG7B,GACP,MAAM,IAAI77F,UAAU,6EAKtB,GAFA+qB,EAAS8wE,EAEL51F,EAAEy3F,GAAGwuD,GACP,IAAKjuJ,EAAI49F,EAAK59F,EAAE2+F,IAAIsvD,GAAYjuJ,EAAIA,EAAEiX,KAAK2mF,GACzC9wE,EAASA,EAAO5V,MAAMlP,EAAEiP,KAAKjX,IAAIk9F,UAAUl9F,QAG7C,IAAKA,EAAI49F,EAAK59F,EAAE2+F,IAAI32F,GAAIhI,EAAIA,EAAEiX,KAAK2mF,GACjC9wE,EAASA,EAAO5V,MAAM+2I,EAAUh3I,KAAKjX,IAAIk9F,UAAUl9F,GAIvD,OAAO8sB,QAUb,SAAS,GAAkBhmB,GACzB,OAAOA,EAAE8zD,aAAe9zD,EAAE42F,IAAI,GCzFhC,IAAI,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,OAC5BwwD,IAA8B,QAAQ,GAAM,IAAe5nD,IACpE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,GACNV,GACE88E,EAEAklD,EAAM,GAAUthI,EAAOk+F,YAyC3B,OAvCI5+F,GACFA,EAAG,UAAU,SAAUw4D,EAAMD,GACvBC,EAAKomC,aAAermC,EAAKqmC,aAC3BojC,EAAM,GAAUxpE,EAAKomC,gBAoCpB2R,EAAM,GAAM,CACjB,GAAI,IAAMo0B,EAAQ,EAAG,GACrBlkJ,OAAQ8G,GAAOo9I,EAAQ,EAAGp9I,GAC1B,iBAAkB,CAAC+iB,EAAK/iB,IAAQo9I,EAAQr6H,EAAK/iB,GAC7C,iBAAkB4D,GAAQy5I,EAAcz5I,EAAM,EAAG,GACjD,yBAA0B,CAACA,EAAM5D,IAAQq9I,EAAcz5I,EAAM,EAAG5D,GAChE,iCAAkC,CAAC4D,EAAMmf,EAAK/iB,IAAQq9I,EAAcz5I,EAAMmf,EAAK/iB,KAGjF,SAASq9I,EAAcz5I,EAAMmf,EAAK/iB,GAChC,IAAIgjE,EAAMm4E,GAAav3I,EAAKpS,WAAW,IAAM4rJ,EAAQr6H,EAAK/iB,KAC1D,OAAO,EAAAq4G,EAAA,IAASz0G,GAAQA,EAAK3P,OAAO+uE,GAAOA,EAG7C,SAASo6E,EAAQr6H,EAAK/iB,GACpB,OAAO+iB,EAAM03H,KAASz6I,EAAM+iB,OClE5B,GAAO,aACP,GAAe,CAAC,SACTu6H,IAAkC,QAAQ,GAAM,IAAe/nD,IACxE,IAAI,MACFyzB,GACEzzB,EA+BJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQq3I,GACRnU,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE02F,UAAY12F,EAAE80F,WAAa90F,EAAEkC,SAExCo9F,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEu/B,EAAI,GAEfy1F,KAAM,SAAch1H,GAClB,OAAOxG,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC3CpB,GAAe,CAAC,QAAS,cAAe,UACjCgtJ,IAAyC,QAFzC,eAEuD,IAAehoD,IAC/E,IAAI,MACFyzB,EAAK,YACLid,EAAW,OACXK,GACE/wC,EAOJ,SAASixC,EAAap+H,EAAMG,GAC1B,KAAMhY,gBAAgBi2I,GACpB,MAAM,IAAI34D,YAAY,oDAGxB,GAAItlE,KAAa,EAAA8vG,EAAA,IAAS9vG,GACxB,MAAM,IAAI7L,MAAM,qBAAuB6L,GAGzC,IAAI,EAAA8vG,EAAA,IAASjwG,IA0Bf,SAA2B88C,EAAQ36C,EAAQhC,GAErB,iBAAhBgC,EAAOlC,MAET68C,EAAOs4F,QAAUjzI,EAAOizI,SAAU,SAAMjzI,EAAOizI,cAAW5sJ,EAC1Ds0D,EAAOu4F,QAAS,SAAMlzI,EAAOkzI,QAC7Bv4F,EAAOw4F,MAAO,SAAMnzI,EAAOmzI,MAC3Bx4F,EAAO2oF,OAAQ,SAAMtjI,EAAOsjI,OAC5B3oF,EAAO4oF,UAAYvlI,GAAYgC,EAAOujI,WAGtC6P,EAAiBz4F,EAAQ36C,EAAO/Y,UAAW+W,GAAYgC,EAAOujI,WAnC9D8P,CAAkBrtJ,KAAM6X,EAAMG,QACzB,GAAIH,IAAQ,EAAAiwG,EAAA,IAAQjwG,EAAK9P,SAAU,EAAA+/G,EAAA,IAAQjwG,EAAKy1I,OAAQ,EAAAxlC,EAAA,IAAQjwG,EAAKxE,MAE1ErT,KAAKitJ,QAAUp1I,EAAK/L,OACpB9L,KAAKktJ,OAASr1I,EAAK9P,MACnB/H,KAAKmtJ,KAAOt1I,EAAKy1I,IACjBttJ,KAAKs9I,MAAQzlI,EAAKxE,KAClBrT,KAAKu9I,UAAYvlI,GAAYH,EAAKG,cAC7B,IAAI,EAAA8vG,EAAA,IAAQjwG,GAEjBu1I,EAAiBptJ,KAAM6X,EAAMG,OACxB,IAAIH,EAET,MAAM,IAAIpX,UAAU,8BAA+B,QAAOoX,GAAQ,KAGlE7X,KAAKitJ,QAAU,GACfjtJ,KAAKktJ,OAAS,GACdltJ,KAAKmtJ,KAAO,CAAC,GACbntJ,KAAKs9I,MAAQ,CAAC,EAAG,GACjBt9I,KAAKu9I,UAAYvlI,GAmBrB,SAASo1I,EAAiBz4F,EAAQ98C,EAAMG,GAEtC28C,EAAOs4F,QAAU,GACjBt4F,EAAOu4F,OAAS,GAChBv4F,EAAOw4F,KAAO,GACdx4F,EAAO4oF,UAAYvlI,EAEnB,IAAIwH,EAAO3H,EAAKpZ,OACZwrC,EAAU,EAEVwxD,EAAKi6C,EAEL6X,EAAO,EAUX,IARI,EAAAzlC,EAAA,IAAS9vG,KAEXyjF,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAAC19H,EAAUA,KAAc09H,EAEtD6X,EAAO90B,EAAMna,QAAQ,EAAGtmG,IAItBwH,EAAO,EAAG,CAEZ,IAAIhY,EAAI,EAER,EAAG,CAEDmtD,EAAOw4F,KAAK3rJ,KAAKmzD,EAAOu4F,OAAOzuJ,QAG/B,IAAK,IAAIC,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAAK,CAE7B,IAAIirC,EAAM9xB,EAAKnZ,GAEf,IAAI,EAAAopH,EAAA,IAAQn+E,IAOV,GALU,IAANniC,GAAWyiC,EAAUN,EAAIlrC,SAC3BwrC,EAAUN,EAAIlrC,QAIZ+I,EAAImiC,EAAIlrC,OAAQ,CAElB,IAAIkI,EAAIgjC,EAAIniC,GAEPi0F,EAAG90F,EAAG4mJ,KAET54F,EAAOs4F,QAAQzrJ,KAAKmF,GAGpBguD,EAAOu4F,OAAO1rJ,KAAK9C,UAKb,IAAN8I,GAAWyiC,EAAU,IACvBA,EAAU,GAIPwxD,EAAG9xD,EAAK4jH,KAEX54F,EAAOs4F,QAAQzrJ,KAAKmoC,GAGpBgrB,EAAOu4F,OAAO1rJ,KAAK9C,IAMzB8I,UACOA,EAAIyiC,GAIf0qB,EAAOw4F,KAAK3rJ,KAAKmzD,EAAOu4F,OAAOzuJ,QAG/Bk2D,EAAO2oF,MAAQ,CAAC99H,EAAMyqB,GA6HxB,SAASujH,EAAW74F,EAAQ84F,GAE1B,KAAK,EAAA3lC,EAAA,IAAQ2lC,GACX,MAAM,IAAIhtJ,UAAU,iBAKtB,GAFegtJ,EAAIhQ,WAIjB,OAAO9oF,EAAO9xD,IAAI4qJ,EAAIj7H,OAIxB,IAOI9zB,EAAGi2I,EAAIjuI,EAAGgnJ,EAPVr6I,EAAOo6I,EAAIp6I,OAEf,GAAIA,EAAK5U,SAAWk2D,EAAO2oF,MAAM7+I,OAC/B,MAAM,IAAIi/I,GAAA,EAAerqI,EAAK5U,OAAQk2D,EAAO2oF,MAAM7+I,QAMrD,IAAI+zB,EAAMi7H,EAAIj7H,MACV/iB,EAAMg+I,EAAIh+I,MAEd,IAAK/Q,EAAI,EAAGi2I,EAAKhgF,EAAO2oF,MAAM7+I,OAAQC,EAAIi2I,EAAIj2I,KAC5C,SAAc8zB,EAAI9zB,GAAIi2D,EAAO2oF,MAAM5+I,KACnC,SAAc+Q,EAAI/Q,GAAIi2D,EAAO2oF,MAAM5+I,IAIrC,IAAIivJ,EAAUh5F,EAAOs4F,QACjBW,EAASj5F,EAAOu4F,OAChBW,EAAOl5F,EAAOw4F,KAEd3tI,EAAOiuI,EAAI5P,UAAU,GACrB5zG,EAAUwjH,EAAI5P,UAAU,GAExBntF,EAAI,GACJo9F,EAAK,GAETtuI,EAAKzC,SAAQ,SAAUre,EAAG0lB,GAExB0pI,EAAGpvJ,GAAK0lB,EAAE,GAEVssC,EAAEhyD,IAAK,KAGT,IAAIoN,EAAS6hJ,EAAU,QAAKttJ,EACxB0H,EAAQ,GACRulJ,EAAM,GAuBV,OArBArjH,EAAQltB,SAAQ,SAAUvV,GAIxB,IAFA8lJ,EAAI9rJ,KAAKuG,EAAMtJ,QAEViI,EAAImnJ,EAAKrmJ,GAAIkmJ,EAAKG,EAAKrmJ,EAAI,GAAId,EAAIgnJ,EAAIhnJ,IAE1ChI,EAAIkvJ,EAAOlnJ,IAEE,IAATgqD,EAAEhyD,KAEJqJ,EAAMvG,KAAKssJ,EAAGpvJ,IAEVoN,GACFA,EAAOtK,KAAKmsJ,EAAQjnJ,QAM5B4mJ,EAAI9rJ,KAAKuG,EAAMtJ,QAER,IAAIw3I,EAAa,CACtBnqI,OAAQA,EACR/D,MAAOA,EACPulJ,IAAKA,EACLj6I,KAAMA,EACN2E,SAAU28C,EAAO4oF,YAIrB,SAASwQ,EAAWp5F,EAAQ5sD,EAAOg2I,EAAW95B,GAE5C,IAAKl8G,IAA2B,IAAlBA,EAAMyoG,QAClB,MAAM,IAAI/vG,UAAU,iBAItB,IAGIu9I,EAHAC,EAAQl2I,EAAMsL,OACdoqI,EAAW11I,EAAM01I,WAerB,IAXI,EAAA31B,EAAA,IAASi2B,IAEXC,EAAQD,EAAU1qI,OAElB0qI,EAAYA,EAAUhK,WAGtBiK,GAAQ,SAAUD,GAIhBN,EAAU,CAEZ,GAAqB,IAAjBO,EAAMv/I,OACR,MAAM,IAAIgC,UAAU,mBAItBk0D,EAAO6U,IAAIzhE,EAAMyqB,MAAOurH,EAAW95B,OAC9B,CAEL,GAAqB,IAAjBg6B,EAAMx/I,QAAiC,IAAjBw/I,EAAMx/I,OAC9B,MAAM,IAAIi/I,GAAA,EAAeO,EAAMx/I,OAAQk2D,EAAO2oF,MAAM7+I,OAAQ,KAI9D,GAAIu/I,EAAMv/I,OAASw/I,EAAMx/I,OAAQ,CAK/B,IAHA,IAAIC,EAAI,EACJo8G,EAAQ,EAEQ,IAAbmjC,EAAMv/I,IAAyB,IAAbs/I,EAAMt/I,IAC7BA,IAGF,KAAoB,IAAbu/I,EAAMv/I,IACXo8G,IACAp8G,IAIFq/I,GAAY,SAAUA,EAAWE,EAAMx/I,OAAQq8G,EAAOkjC,GAIxD,KAAK,SAAgBC,EAAOD,GAC1B,MAAM,IAAIN,GAAA,EAAeO,EAAOD,EAAO,KAUzC,IANA,IAAIgQ,EAAKjmJ,EAAMyqB,MAAM,GACjBy7H,EAAKlmJ,EAAMyqB,MAAM,GAEjBpiB,EAAI4tI,EAAM,GACVx4I,EAAIw4I,EAAM,GAELx3I,EAAI,EAAGA,EAAI4J,EAAG5J,IAErB,IAAK,IAAIe,EAAI,EAAGA,EAAI/B,EAAG+B,IAAK,CAE1B,IAAIZ,EAAIo3I,EAAUv3I,GAAGe,GAErBotD,EAAO6U,IAAI,CAAChjE,EAAIwnJ,EAAIzmJ,EAAI0mJ,GAAKtnJ,EAAGs9G,IAKtC,OAAOtvD,EAsHT,SAASu5F,EAAexvJ,EAAG6X,EAAKC,EAAQzO,GAEtC,GAAIyO,EAASD,GAAQ,EACnB,OAAOC,EAIT,IAAK,IAAI4N,EAAI7N,EAAK6N,EAAI5N,EAAQ4N,IAE5B,GAAIrc,EAAMqc,KAAO1lB,EACf,OAAO0lB,EAKX,OAAO7N,EAaT,SAAS43I,EAAQznJ,EAAGhI,EAAG8I,EAAGb,EAAGmF,EAAQ/D,EAAOulJ,GAE1CxhJ,EAAOw1G,OAAO56G,EAAG,EAAGC,GAEpBoB,EAAMu5G,OAAO56G,EAAG,EAAGhI,GAEnB,IAAK,IAAI8H,EAAIgB,EAAI,EAAGhB,EAAI8mJ,EAAI7uJ,OAAQ+H,IAClC8mJ,EAAI9mJ,KA6CR,SAAS83I,EAAQ3pF,EAAQn1C,EAAMyqB,EAASg6E,GAEtC,IAAIxkH,EAAQwkH,GAAgB,EAExBxoB,EAAKi6C,EAEL6X,EAAO,GAEP,EAAAzlC,EAAA,IAASnzD,EAAO4oF,aAElB9hD,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAAC/gF,EAAO4oF,UAAW5oF,EAAO4oF,aAAe7H,EAEtE6X,EAAO90B,EAAMna,QAAQ,EAAG3pD,EAAO4oF,WAE/B99I,EAAQg5H,EAAMna,QAAQ7+G,EAAOk1D,EAAO4oF,YAItC,IAII7+I,EAAG8I,EAAGd,EAJN0nJ,GAAO3yD,EAAGh8F,EAAO8tJ,GAEjBnpI,EAAIuwC,EAAO2oF,MAAM,GACjB5wI,EAAIioD,EAAO2oF,MAAM,GAGrB,GAAIrzG,EAAUv9B,EAAG,CAEf,IAAKlF,EAAIkF,EAAGlF,EAAIyiC,EAASziC,IAIvB,GAFAmtD,EAAOw4F,KAAK3lJ,GAAKmtD,EAAOs4F,QAAQxuJ,OAE5B2vJ,EAEF,IAAK1vJ,EAAI,EAAGA,EAAI0lB,EAAG1lB,IAEjBi2D,EAAOs4F,QAAQzrJ,KAAK/B,GAGpBk1D,EAAOu4F,OAAO1rJ,KAAK9C,GAMzBi2D,EAAOw4F,KAAKljH,GAAW0qB,EAAOs4F,QAAQxuJ,YAC7BwrC,EAAUv9B,IAEnBioD,EAAOw4F,KAAK7rC,OAAOr3E,EAAU,EAAGv9B,EAAIu9B,GAGpC0qB,EAAOs4F,QAAQ3rC,OAAO3sD,EAAOw4F,KAAKljH,GAAU0qB,EAAOs4F,QAAQxuJ,QAE3Dk2D,EAAOu4F,OAAO5rC,OAAO3sD,EAAOw4F,KAAKljH,GAAU0qB,EAAOu4F,OAAOzuJ,SAM3D,GAFAiO,EAAIu9B,EAEAzqB,EAAO4E,GAET,GAAIgqI,EAAK,CAEP,IAAI5oJ,EAAI,EAER,IAAKgC,EAAI,EAAGA,EAAIkF,EAAGlF,IAAK,CAEtBmtD,EAAOw4F,KAAK3lJ,GAAKmtD,EAAOw4F,KAAK3lJ,GAAKhC,EAElCkB,EAAIiuD,EAAOw4F,KAAK3lJ,EAAI,GAAKhC,EAEzB,IAAI1B,EAAI,EAER,IAAKpF,EAAI0lB,EAAG1lB,EAAI8gB,EAAM9gB,IAAKoF,IAEzB6wD,EAAOs4F,QAAQ3rC,OAAO56G,EAAI5C,EAAG,EAAGrE,GAGhCk1D,EAAOu4F,OAAO5rC,OAAO56G,EAAI5C,EAAG,EAAGpF,GAG/B8G,IAKJmvD,EAAOw4F,KAAKzgJ,GAAKioD,EAAOs4F,QAAQxuJ,aAE7B,GAAI+gB,EAAO4E,EAAG,CAEnB,IAAI1U,EAAI,EAER,IAAKlI,EAAI,EAAGA,EAAIkF,EAAGlF,IAAK,CAEtBmtD,EAAOw4F,KAAK3lJ,GAAKmtD,EAAOw4F,KAAK3lJ,GAAKkI,EAElC,IAAIggF,EAAK/6B,EAAOw4F,KAAK3lJ,GACjBuoF,EAAKp7B,EAAOw4F,KAAK3lJ,EAAI,GAAKkI,EAE9B,IAAKhJ,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,KAEnBhI,EAAIi2D,EAAOu4F,OAAOxmJ,IAEV8Y,EAAO,IAEbm1C,EAAOs4F,QAAQ3rC,OAAO56G,EAAG,GAGzBiuD,EAAOu4F,OAAO5rC,OAAO56G,EAAG,GAGxBgJ,KAMNilD,EAAOw4F,KAAK3lJ,GAAKmtD,EAAOs4F,QAAQxuJ,OAOlC,OAHAk2D,EAAO2oF,MAAM,GAAK99H,EAClBm1C,EAAO2oF,MAAM,GAAKrzG,EAEX0qB,EA+TT,SAAS05F,EAASviJ,EAAQ/D,EAAOulJ,EAAKj6I,EAAMoZ,GAE1C,IAKI/tB,EAAG8I,EALHgY,EAAOnM,EAAK,GACZ42B,EAAU52B,EAAK,GAEf9R,EAAI,GAIR,IAAK7C,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAGpB,IAFA6C,EAAE7C,GAAK,GAEF8I,EAAI,EAAGA,EAAIyiC,EAASziC,IACvBjG,EAAE7C,GAAG8I,GAAK,EAKd,IAAKA,EAAI,EAAGA,EAAIyiC,EAASziC,IAKvB,IAHA,IAAIkoF,EAAK49D,EAAI9lJ,GACTuoF,EAAKu9D,EAAI9lJ,EAAI,GAERd,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAIvBnF,EAFA7C,EAAIqJ,EAAMrB,IAELc,GAAKsE,EAAS2gB,GAAO,SAAM3gB,EAAOpF,IAAMoF,EAAOpF,GAAK,EAI7D,OAAOnF,EA0aT,OAp2CA00I,EAAaj1I,UAAY,IAAI+0I,EAK7BE,EAAaj1I,UAAUstJ,mBAAqB,SAAUz2I,EAAMG,GAC1D,OAAO,IAAIi+H,EAAap+H,EAAMG,IAOhCi+H,EAAaj1I,UAAU8W,KAAO,eAC9Bm+H,EAAaj1I,UAAUutJ,gBAAiB,EAWxCtY,EAAaj1I,UAAU09I,YAAc,WACnC,OAAO,SAAiB1+I,KAAKitJ,QAAS,OAaxChX,EAAaj1I,UAAU04I,QAAU,WAC/B,MAAO,UAaTzD,EAAaj1I,UAAUgX,SAAW,WAChC,OAAOhY,KAAKu9I,WAUdtH,EAAaj1I,UAAU0C,OAAS,SAAUmU,EAAMG,GAC9C,OAAO,IAAIi+H,EAAap+H,EAAMG,IAahCi+H,EAAaj1I,UAAUwtJ,QAAU,WAE/B,IAAIhvI,EAAOxf,KAAKs9I,MAAM,GAClBrzG,EAAUjqC,KAAKs9I,MAAM,GAEzB,OAAgB,IAAT99H,GAA0B,IAAZyqB,EAAgBjqC,KAAKktJ,OAAOzuJ,QAAU+gB,EAAOyqB,GAAW,GAkB/EgsG,EAAaj1I,UAAUqtE,OAAS,SAAUtmE,EAAOmgH,EAAajE,GAE5D,IAAKjkH,KAAKitJ,QACR,MAAM,IAAI9gJ,MAAM,iDAIlB,OAAQjM,UAAUzB,QAChB,KAAK,EACH,OAAO+uJ,EAAWxtJ,KAAM+H,GAG1B,KAAK,EACL,KAAK,EACH,OAAOgmJ,EAAW/tJ,KAAM+H,EAAOmgH,EAAajE,GAE9C,QACE,MAAM,IAAI3mC,YAAY,+BAgL5B24D,EAAaj1I,UAAU6B,IAAM,SAAUkF,GACrC,KAAK,EAAA+/G,EAAA,IAAQ//G,GACX,MAAM,IAAItH,UAAU,kBAGtB,GAAIsH,EAAMtJ,SAAWuB,KAAKs9I,MAAM7+I,OAC9B,MAAM,IAAIi/I,GAAA,EAAe31I,EAAMtJ,OAAQuB,KAAKs9I,MAAM7+I,QAIpD,IAAKuB,KAAKitJ,QACR,MAAM,IAAI9gJ,MAAM,8CAIlB,IAAIzN,EAAIqJ,EAAM,GACVP,EAAIO,EAAM,IAEd,SAAcrJ,EAAGsB,KAAKs9I,MAAM,KAC5B,SAAc91I,EAAGxH,KAAKs9I,MAAM,IAE5B,IAAI52I,EAAIwnJ,EAAexvJ,EAAGsB,KAAKmtJ,KAAK3lJ,GAAIxH,KAAKmtJ,KAAK3lJ,EAAI,GAAIxH,KAAKktJ,QAG/D,OAAIxmJ,EAAI1G,KAAKmtJ,KAAK3lJ,EAAI,IAAMxH,KAAKktJ,OAAOxmJ,KAAOhI,EACtCsB,KAAKitJ,QAAQvmJ,GAGf,GAcTuvI,EAAaj1I,UAAUwoE,IAAM,SAAUzhE,EAAOpB,EAAGs9G,GAC/C,KAAK,EAAA6D,EAAA,IAAQ//G,GACX,MAAM,IAAItH,UAAU,kBAGtB,GAAIsH,EAAMtJ,SAAWuB,KAAKs9I,MAAM7+I,OAC9B,MAAM,IAAIi/I,GAAA,EAAe31I,EAAMtJ,OAAQuB,KAAKs9I,MAAM7+I,QAIpD,IAAKuB,KAAKitJ,QACR,MAAM,IAAI9gJ,MAAM,8CAIlB,IAAIzN,EAAIqJ,EAAM,GACVP,EAAIO,EAAM,GAEVyX,EAAOxf,KAAKs9I,MAAM,GAClBrzG,EAAUjqC,KAAKs9I,MAAM,GAErB7hD,EAAKi6C,EAEL6X,EAAO,GAEP,EAAAzlC,EAAA,IAAS9nH,KAAKu9I,aAEhB9hD,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAAC11I,KAAKu9I,UAAWv9I,KAAKu9I,aAAe7H,EAElE6X,EAAO90B,EAAMna,QAAQ,EAAGt+G,KAAKu9I,aAI3B7+I,EAAI8gB,EAAO,GAAKhY,EAAIyiC,EAAU,KAEhCq0G,EAAQt+I,KAAMgG,KAAKyJ,IAAI/Q,EAAI,EAAG8gB,GAAOxZ,KAAKyJ,IAAIjI,EAAI,EAAGyiC,GAAUg6E,GAG/DzkG,EAAOxf,KAAKs9I,MAAM,GAClBrzG,EAAUjqC,KAAKs9I,MAAM,KAIvB,SAAc5+I,EAAG8gB,IACjB,SAAchY,EAAGyiC,GAEjB,IAAIvjC,EAAIwnJ,EAAexvJ,EAAGsB,KAAKmtJ,KAAK3lJ,GAAIxH,KAAKmtJ,KAAK3lJ,EAAI,GAAIxH,KAAKktJ,QAiB/D,OAdIxmJ,EAAI1G,KAAKmtJ,KAAK3lJ,EAAI,IAAMxH,KAAKktJ,OAAOxmJ,KAAOhI,EAExC+8F,EAAG90F,EAAG4mJ,GAiCf,SAAiB7mJ,EAAGc,EAAGsE,EAAQ/D,EAAOulJ,GAEpCxhJ,EAAOw1G,OAAO56G,EAAG,GACjBqB,EAAMu5G,OAAO56G,EAAG,GAEhB,IAAK,IAAIF,EAAIgB,EAAI,EAAGhB,EAAI8mJ,EAAI7uJ,OAAQ+H,IAClC8mJ,EAAI9mJ,KAlCFioJ,CAAQ/nJ,EAAGc,EAAGxH,KAAKitJ,QAASjtJ,KAAKktJ,OAAQltJ,KAAKmtJ,MAH9CntJ,KAAKitJ,QAAQvmJ,GAAKC,EAOpBwnJ,EAAQznJ,EAAGhI,EAAG8I,EAAGb,EAAG3G,KAAKitJ,QAASjtJ,KAAKktJ,OAAQltJ,KAAKmtJ,MAG/CntJ,MAwDTi2I,EAAaj1I,UAAUoc,OAAS,SAAU/J,EAAM4wG,EAAcx3F,GAE5D,KAAK,EAAAq7F,EAAA,IAAaz0G,GAChB,MAAM,IAAI5S,UAAU,4BAItB,IAAIm+I,EAAYvrI,EAAKpS,UAAUqG,KAAI7H,GAC1Bb,MAAMoF,QAAQvE,IAA2B,IAAjBA,EAAMhB,OAAegB,EAAM,GAAKA,IAGjE,GAAyB,IAArBm/I,EAAUngJ,OACZ,MAAM,IAAI0N,MAAM,4CAYlB,OARAyyI,EAAU7hI,SAAQ,SAAUtd,GAC1B,KAAK,EAAAqoH,EAAA,IAASroH,MAAW,OAAUA,IAAUA,EAAQ,EACnD,MAAM,IAAIgB,UAAU,wDAA8D,SAAOm+I,GAAa,QAMnGN,EAFC7xH,EAAOzsB,KAAKikG,QAAUjkG,KAEZ4+I,EAAU,GAAIA,EAAU,GAAI36B,IA+IhDgyB,EAAaj1I,UAAU2mI,QAAU,SAAU+mB,EAAOjiI,GAEhD,KAAK,EAAAq7F,EAAA,IAAQ4mC,GACX,MAAM,IAAIjuJ,UAAU,kBAGtB,GAAqB,IAAjBiuJ,EAAMjwJ,OACR,MAAM,IAAI0N,MAAM,0DAIlBuiJ,EAAM3xI,SAAQ,SAAUtd,GACtB,KAAK,EAAAqoH,EAAA,IAASroH,MAAW,OAAUA,IAAUA,IAAU,GAAe,IAAVA,EAC1D,MAAM,IAAIgB,UAAU,8DAAoE,SAAOiuJ,GAAS,QAG5G,IAAI7P,EAAgB7+I,KAAKs9I,MAAM,GAAKt9I,KAAKs9I,MAAM,GAI/C,GAAIuB,KAHJ6P,GAAQ,SAAqBA,EAAO7P,IACd,GAAK6P,EAAM,GAG/B,MAAM,IAAIviJ,MAAM,uEAIlB,IAAIiE,EAAIqc,EAAOzsB,KAAKikG,QAAUjkG,KAE9B,GAAIA,KAAKs9I,MAAM,KAAOoR,EAAM,IAAM1uJ,KAAKs9I,MAAM,KAAOoR,EAAM,GACxD,OAAOt+I,EAMT,IAFA,IAAIu+I,EAAW,GAENjwJ,EAAI,EAAGA,EAAI0R,EAAE+8I,KAAK1uJ,OAAQC,IACjC,IAAK,IAAI8I,EAAI,EAAGA,EAAI4I,EAAE+8I,KAAKzuJ,EAAI,GAAK0R,EAAE+8I,KAAKzuJ,GAAI8I,IAC7CmnJ,EAASntJ,KAAK9C,GAWlB,IANA,IAAIoN,EAASsE,EAAE68I,QAAQnoJ,QAGnB8pJ,EAAWx+I,EAAE88I,OAAOpoJ,QAGfN,EAAK,EAAGA,EAAK4L,EAAE88I,OAAOzuJ,OAAQ+F,IAAM,CAC3C,IAAIqqJ,EAAKD,EAASpqJ,GACd05H,EAAKywB,EAASnqJ,GACdsqJ,EAAOD,EAAKz+I,EAAEktI,MAAM,GAAKpf,EAC7BywB,EAASnqJ,GAAMsqJ,EAAOJ,EAAM,GAC5BE,EAASpqJ,GAAMwB,KAAKiC,MAAM6mJ,EAAOJ,EAAM,IAQzCt+I,EAAE68I,QAAQxuJ,OAAS,EACnB2R,EAAE88I,OAAOzuJ,OAAS,EAClB2R,EAAE+8I,KAAK1uJ,OAASiwJ,EAAM,GAAK,EAC3Bt+I,EAAEktI,MAAQoR,EAAM5pJ,QAEhB,IAAK,IAAI4sI,EAAM,EAAGA,EAAMthI,EAAE+8I,KAAK1uJ,OAAQizI,IACrCthI,EAAE+8I,KAAKzb,GAAO,EAKhB,IAAK,IAAIx1F,EAAI,EAAGA,EAAIpwC,EAAOrN,OAAQy9C,IAAK,CACtC,IAAI6yG,EAAMH,EAAS1yG,GACf4oG,EAAK6J,EAASzyG,GACdv1C,EAAImF,EAAOowC,GAIfiyG,EAFQD,EAAea,EAAK3+I,EAAE+8I,KAAKrI,GAAK10I,EAAE+8I,KAAKrI,EAAK,GAAI10I,EAAE88I,QAE/C6B,EAAKjK,EAAIn+I,EAAGyJ,EAAE68I,QAAS78I,EAAE88I,OAAQ98I,EAAE+8I,MAIhD,OAAO/8I,GAST6lI,EAAaj1I,UAAUijG,MAAQ,WAQ7B,OAPQ,IAAIgyC,EAAa,CACvBnqI,OAAQ9L,KAAKitJ,SAAU,SAAMjtJ,KAAKitJ,cAAW5sJ,EAC7C0H,OAAO,SAAM/H,KAAKktJ,QAClBI,KAAK,SAAMttJ,KAAKmtJ,MAChB95I,MAAM,SAAMrT,KAAKs9I,OACjBtlI,SAAUhY,KAAKu9I,aAWnBtH,EAAaj1I,UAAUqS,KAAO,WAC5B,OAAOrT,KAAKs9I,MAAMx4I,MAAM,IAe1BmxI,EAAaj1I,UAAUsG,IAAM,SAAU+7B,EAAUs2G,GAE/C,IAAK35I,KAAKitJ,QACR,MAAM,IAAI9gJ,MAAM,8CAIlB,IAAI2yI,EAAK9+I,KAWT,OAQF,SAAc20D,EAAQq6F,EAAQC,EAAQC,EAAWC,EAAW9rH,EAAUs2G,GAEpE,IAAI7tI,EAAS,GACT/D,EAAQ,GACRulJ,EAAM,GAEN7xD,EAAKi6C,EAEL6X,EAAO,GAEP,EAAAzlC,EAAA,IAASnzD,EAAO4oF,aAElB9hD,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAAC/gF,EAAO4oF,UAAW5oF,EAAO4oF,aAAe7H,EAEtE6X,EAAO90B,EAAMna,QAAQ,EAAG3pD,EAAO4oF,YAiBjC,IAbA,IAAI6R,EAAS,SAAgBzoJ,EAAGH,EAAGe,GAEjCZ,EAAI08B,EAAS18B,EAAGH,EAAGe,GAEdk0F,EAAG90F,EAAG4mJ,KAETzhJ,EAAOtK,KAAKmF,GAEZoB,EAAMvG,KAAKgF,KAKNgB,EAvCsB,EAuCPA,GAAK2nJ,EAAW3nJ,IAAK,CAE3C8lJ,EAAI9rJ,KAAKsK,EAAOrN,QAEhB,IAAIixF,EAAK/6B,EAAOw4F,KAAK3lJ,GACjBuoF,EAAKp7B,EAAOw4F,KAAK3lJ,EAAI,GAEzB,GAAImyI,EAEF,IAAK,IAAIjzI,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5B,IAAIhI,EAAIi2D,EAAOu4F,OAAOxmJ,GAElBhI,GApDQ,GAoDOA,GAAKuwJ,GAEtBG,EAAOz6F,EAAOs4F,QAAQvmJ,GAAIhI,EAtDhB,EAsD4B8I,EAtDf,OAyDtB,CAIL,IAFA,IAAIylJ,EAAU,GAELoC,EAAK3/D,EAAI2/D,EAAKt/D,EAAIs/D,IAEzBpC,EADUt4F,EAAOu4F,OAAOmC,IACT16F,EAAOs4F,QAAQoC,GAKhC,IAAK,IAAIC,EApEK,EAoESA,GAAOL,EAAQK,IAEpCF,EADYE,KAAOrC,EAAUA,EAAQqC,GAAO,EAC9BA,EAtEF,EAsEgB9nJ,EAtEH,IA8E/B,OAFA8lJ,EAAI9rJ,KAAKsK,EAAOrN,QAET,IAAIw3I,EAAa,CACtBnqI,OAAQA,EACR/D,MAAOA,EACPulJ,IAAKA,EACLj6I,KAAM,CAAC47I,EAlFS,EAkFS,EAAGE,EAlFC,EAkFuB,KAlF/Ch1F,CAAKn6D,KAAM,EATPA,KAAKs9I,MAAM,GASM,EAAG,EARjBt9I,KAAKs9I,MAAM,GAQmB,GAN/B,SAAgB32I,EAAGjI,EAAG8I,GAEjC,OAAO67B,EAAS18B,EAAG,CAACjI,EAAG8I,GAAIs3I,KAI0BnF,IA+FzD1D,EAAaj1I,UAAU+b,QAAU,SAAUsmB,EAAUs2G,GAEnD,IAAK35I,KAAKitJ,QACR,MAAM,IAAI9gJ,MAAM,kDASlB,IALA,IAEIqT,EAAOxf,KAAKs9I,MAAM,GAClBrzG,EAAUjqC,KAAKs9I,MAAM,GAEhB91I,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhC,IAAIkoF,EAAK1vF,KAAKmtJ,KAAK3lJ,GACfuoF,EAAK/vF,KAAKmtJ,KAAK3lJ,EAAI,GAEvB,GAAImyI,EAEF,IAAK,IAAIjzI,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5B,IAAIhI,EAAIsB,KAAKktJ,OAAOxmJ,GAEpB28B,EAASrjC,KAAKitJ,QAAQvmJ,GAAI,CAAChI,EAAG8I,GAhB3BxH,UAkBA,CAIL,IAFA,IAAI8L,EAAS,GAEJyjJ,EAAM7/D,EAAI6/D,EAAMx/D,EAAIw/D,IAE3BzjJ,EADU9L,KAAKktJ,OAAOqC,IACRvvJ,KAAKitJ,QAAQsC,GAK7B,IAAK,IAAIC,EAAM,EAAGA,EAAMhwI,EAAMgwI,IAE5BnsH,EADYmsH,KAAO1jJ,EAASA,EAAO0jJ,GAAO,EAC1B,CAACA,EAAKhoJ,GA/BnBxH,SA2CXi2I,EAAaj1I,UAAU+yI,QAAU,WAC/B,OAAOsa,EAASruJ,KAAKitJ,QAASjtJ,KAAKktJ,OAAQltJ,KAAKmtJ,KAAMntJ,KAAKs9I,OAAO,IASpErH,EAAaj1I,UAAUC,QAAU,WAC/B,OAAOotJ,EAASruJ,KAAKitJ,QAASjtJ,KAAKktJ,OAAQltJ,KAAKmtJ,KAAMntJ,KAAKs9I,OAAO,IA+CpErH,EAAaj1I,UAAUqoI,OAAS,SAAUluH,GASxC,IAPA,IAAIqE,EAAOxf,KAAKs9I,MAAM,GAClBrzG,EAAUjqC,KAAKs9I,MAAM,GAErBkR,EAAUxuJ,KAAKwuJ,UAEf50I,EAAM,mBAAoB,SAAO4F,EAAMrE,GAAW,OAAQ,SAAO8uB,EAAS9uB,GAAW,eAAgB,SAAOqzI,EAASrzI,GAAW,KAE3H3T,EAAI,EAAGA,EAAIyiC,EAASziC,IAK3B,IAHA,IAAIkoF,EAAK1vF,KAAKmtJ,KAAK3lJ,GACfuoF,EAAK/vF,KAAKmtJ,KAAK3lJ,EAAI,GAEdd,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5B,IAAIhI,EAAIsB,KAAKktJ,OAAOxmJ,GAEpBkT,GAAO,WAAY,SAAOlb,EAAGyc,GAAW,MAAO,SAAO3T,EAAG2T,GAAW,UAAYnb,KAAKitJ,SAAU,SAAOjtJ,KAAKitJ,QAAQvmJ,GAAIyU,GAAW,KAItI,OAAOvB,GASTq8H,EAAaj1I,UAAUyE,SAAW,WAChC,OAAO,SAAOzF,KAAK+zI,YASrBkC,EAAaj1I,UAAUkgG,OAAS,WAC9B,MAAO,CACLgoB,OAAQ,eACRp9G,OAAQ9L,KAAKitJ,QACbllJ,MAAO/H,KAAKktJ,OACZI,IAAKttJ,KAAKmtJ,KACV95I,KAAMrT,KAAKs9I,MACXtlI,SAAUhY,KAAKu9I,YAanBtH,EAAaj1I,UAAU+9I,SAAW,SAAUr4I,GAE1C,GAAIA,GAOF,IALI,EAAAohH,EAAA,IAAYphH,KACdA,EAAIA,EAAE85F,cAIH,EAAAsnB,EAAA,IAASphH,MAAO,OAAUA,GAC7B,MAAM,IAAIjG,UAAU,kDAItBiG,EAAI,EAGN,IAAIs4I,EAASt4I,EAAI,EAAIA,EAAI,EACrBu4I,EAAOv4I,EAAI,GAAKA,EAAI,EAEpB8Y,EAAOxf,KAAKs9I,MAAM,GAClBrzG,EAAUjqC,KAAKs9I,MAAM,GAErB93I,EAAIQ,KAAKwsB,IAAIhT,EAAOy/H,EAAMh1G,EAAU+0G,GAEpClzI,EAAS,GACT/D,EAAQ,GACRulJ,EAAM,GAEVA,EAAI,GAAK,EAET,IAAK,IAAI9lJ,EAAIw3I,EAAQx3I,EAAIyiC,GAAWn+B,EAAOrN,OAAS+G,EAAGgC,IAKrD,IAHA,IAAIkoF,EAAK1vF,KAAKmtJ,KAAK3lJ,GACfuoF,EAAK/vF,KAAKmtJ,KAAK3lJ,EAAI,GAEdhB,EAAIkpF,EAAIlpF,EAAIupF,EAAIvpF,IAAK,CAE5B,IAAI9H,EAAIsB,KAAKktJ,OAAO1mJ,GAEpB,GAAI9H,IAAM8I,EAAIw3I,EAASC,EAAM,CAE3BnzI,EAAOtK,KAAKxB,KAAKitJ,QAAQzmJ,IAEzBuB,EAAM+D,EAAOrN,OAAS,GAAKC,EAAIugJ,EAE/B,OAQN,OAFAqO,EAAI9rJ,KAAKsK,EAAOrN,QAET,IAAIw3I,EAAa,CACtBnqI,OAAQA,EACR/D,MAAOA,EACPulJ,IAAKA,EACLj6I,KAAM,CAAC7N,EAAG,MAadywI,EAAa9sB,SAAW,SAAUhiB,GAChC,OAAO,IAAI8uC,EAAa9uC,IAgB1B8uC,EAAa8I,SAAW,SAAU1rI,EAAM5T,EAAOiH,EAAGu9G,EAAcjsG,GAC9D,KAAK,EAAA8vG,EAAA,IAAQz0G,GACX,MAAM,IAAI5S,UAAU,kCAGtB,GAAoB,IAAhB4S,EAAK5U,OACP,MAAM,IAAI0N,MAAM,4CAmBlB,GAfAkH,EAAOA,EAAK/L,KAAI,SAAUy+B,GAQxB,IANI,EAAA+hF,EAAA,IAAY/hF,KAEdA,EAAIA,EAAEy6D,cAIH,EAAAsnB,EAAA,IAAS/hF,MAAO,OAAUA,IAAMA,EAAI,EACvC,MAAM,IAAI55B,MAAM,yCAGlB,OAAO45B,KAGLr/B,GAOF,IALI,EAAAohH,EAAA,IAAYphH,KACdA,EAAIA,EAAE85F,cAIH,EAAAsnB,EAAA,IAASphH,MAAO,OAAUA,GAC7B,MAAM,IAAIjG,UAAU,kDAItBiG,EAAI,EAIN,IAAI+0F,EAAKi6C,EAEL6X,EAAO,GAEP,EAAAzlC,EAAA,IAAS9vG,KAEXyjF,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAAC19H,EAAUA,KAAc09H,EAEtD6X,EAAO90B,EAAMna,QAAQ,EAAGtmG,IAG1B,IAQIknI,EARAF,EAASt4I,EAAI,EAAIA,EAAI,EACrBu4I,EAAOv4I,EAAI,GAAKA,EAAI,EAEpB8Y,EAAOnM,EAAK,GACZ42B,EAAU52B,EAAK,GAEf7N,EAAIQ,KAAKwsB,IAAIhT,EAAOy/H,EAAMh1G,EAAU+0G,GAKxC,IAAI,EAAAl3B,EAAA,IAAQroH,GAAQ,CAElB,GAAIA,EAAMhB,SAAW+G,EAEnB,MAAM,IAAI2G,MAAM,8BAIlB+yI,EAAS,SAAgBxgJ,GAEvB,OAAOe,EAAMf,SAEV,IAAI,EAAAopH,EAAA,IAASroH,GAAQ,CAE1B,IAAI0/I,EAAK1/I,EAAM4T,OAEf,GAAkB,IAAd8rI,EAAG1gJ,QAAgB0gJ,EAAG,KAAO35I,EAE/B,MAAM,IAAI2G,MAAM,yBAIlB+yI,EAAS,SAAgBxgJ,GAEvB,OAAOe,EAAMoD,IAAI,CAACnE,UAIpBwgJ,EAAS,WAEP,OAAOz/I,GASX,IAJA,IAAIqM,EAAS,GACT/D,EAAQ,GACRulJ,EAAM,GAED9lJ,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhC8lJ,EAAI9rJ,KAAKsK,EAAOrN,QAEhB,IAAIC,EAAI8I,EAAIw3I,EAEZ,GAAItgJ,GAAK,GAAKA,EAAI8G,EAAG,CAEnB,IAAImB,EAAIu4I,EAAOxgJ,GAGV+8F,EAAG90F,EAAG4mJ,KAETxlJ,EAAMvG,KAAK9C,EAAIugJ,GAEfnzI,EAAOtK,KAAKmF,KAQlB,OAFA2mJ,EAAI9rJ,KAAKsK,EAAOrN,QAET,IAAIw3I,EAAa,CACtBnqI,OAAQA,EACR/D,MAAOA,EACPulJ,IAAKA,EACLj6I,KAAM,CAACmM,EAAMyqB,MAcjBgsG,EAAaj1I,UAAUo+I,SAAW,SAAU1gJ,EAAG8I,GAE7C,MAAK,EAAAsgH,EAAA,IAASppH,KAAO,OAAUA,KAAO,EAAAopH,EAAA,IAAStgH,KAAO,OAAUA,IAC9D,MAAM,IAAI2E,MAAM,uCAIlB,GAA0B,IAAtBnM,KAAKs9I,MAAM7+I,OACb,MAAM,IAAI0N,MAAM,4CAUlB,OANA,SAAczN,EAAGsB,KAAKs9I,MAAM,KAC5B,SAAc91I,EAAGxH,KAAKs9I,MAAM,IAE5BrH,EAAaoJ,UAAU3gJ,EAAG8I,EAAGxH,KAAKs9I,MAAM,GAAIt9I,KAAKitJ,QAASjtJ,KAAKktJ,OAAQltJ,KAAKmtJ,MAGrEntJ,MAaTi2I,EAAawZ,YAAc,SAAUjoJ,EAAGsE,EAAQ/D,EAAOulJ,EAAKjqH,GAK1D,IAHA,IAAIqsD,EAAK49D,EAAI9lJ,GACTuoF,EAAKu9D,EAAI9lJ,EAAI,GAERd,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAEvB28B,EAASt7B,EAAMrB,GAAIoF,EAAOpF,KAe9BuvI,EAAaoJ,UAAY,SAAU74I,EAAGe,EAAG0iC,EAASn+B,EAAQ/D,EAAOulJ,GAE/D,IAAK,IAAI9lJ,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhC,IAAIkoF,EAAK49D,EAAI9lJ,GACTuoF,EAAKu9D,EAAI9lJ,EAAI,GAEbkoJ,EAAKxB,EAAe1nJ,EAAGkpF,EAAIK,EAAIhoF,GAG/B4nJ,EAAKzB,EAAe3mJ,EAAGmoF,EAAIK,EAAIhoF,GAGnC,GAAI2nJ,EAAK3/D,GAAM4/D,EAAK5/D,GAAMhoF,EAAM2nJ,KAAQlpJ,GAAKuB,EAAM4nJ,KAAQpoJ,GAEzD,GAAIuE,EAAQ,CACV,IAAInF,EAAImF,EAAO4jJ,GACf5jJ,EAAO4jJ,GAAM5jJ,EAAO6jJ,GACpB7jJ,EAAO6jJ,GAAMhpJ,QAQjB,GAAI+oJ,EAAK3/D,GAAMhoF,EAAM2nJ,KAAQlpJ,IAAMmpJ,GAAM5/D,GAAMhoF,EAAM4nJ,KAAQpoJ,GAA7D,CAEE,IAAIqoJ,EAAK9jJ,EAASA,EAAO4jJ,QAAMrvJ,EAE/B0H,EAAMu5G,OAAOquC,EAAI,EAAGpoJ,GAEhBuE,GACFA,EAAOw1G,OAAOquC,EAAI,EAAGC,GAIvB7nJ,EAAMu5G,OAAOquC,GAAMD,EAAKA,EAAK,EAAIA,EAAI,GAEjC5jJ,GACFA,EAAOw1G,OAAOquC,GAAMD,EAAKA,EAAK,EAAIA,EAAI,QAQ1C,GAAIC,EAAK5/D,GAAMhoF,EAAM4nJ,KAAQpoJ,IAAMmoJ,GAAM3/D,GAAMhoF,EAAM2nJ,KAAQlpJ,GAAI,CAE/D,IAAIqpJ,EAAK/jJ,EAASA,EAAO6jJ,QAAMtvJ,EAE/B0H,EAAMu5G,OAAOouC,EAAI,EAAGlpJ,GAEhBsF,GACFA,EAAOw1G,OAAOouC,EAAI,EAAGG,GAIvB9nJ,EAAMu5G,OAAOouC,GAAMC,EAAKA,EAAK,EAAIA,EAAI,GAEjC7jJ,GACFA,EAAOw1G,OAAOouC,GAAMC,EAAKA,EAAK,EAAIA,EAAI,MAMvC1Z,IACN,CACDttB,SAAS,IC//CP,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,cAAe,gBAC3C6hC,IAA8B,QAAQ,GAAM,IAAexlD,IACpE,IAAI,MACFyzB,EAAK,OACLsd,EAAM,YACNC,EAAW,aACXC,GACEjxC,EAkCJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,OAAOq3B,EAAQ,KAEjB51C,OAAQ,SAAgBmvB,GACtB,OAAOymB,EAAQ,GAAIzmB,IAErB,iBAAkB,SAAsBA,EAAQrxH,GAC9C,OAAO83I,EAAQ,GAAIzmB,EAAQrxH,IAE7BpZ,MAAO,SAAeiZ,GACpB,OAAOi4I,EAAQj4I,IAEjBk+H,OAAQ,SAAgBl+H,GACtB,OAAOi4I,EAAQj4I,EAAMA,EAAK6hI,YAE5B,yBAA0BoW,EAC1B,iCAAkCA,IAWpC,SAASA,EAAQj4I,EAAMwxH,EAAQrxH,GAE7B,GAAe,UAAXqxH,GAAiC,YAAXA,QAAmChpI,IAAXgpI,EAChD,OAAO,IAAI2M,EAAYn+H,EAAMG,GAG/B,GAAe,WAAXqxH,EACF,OAAO,IAAI4M,EAAap+H,EAAMG,GAGhC,MAAM,IAAIvX,UAAU,uBAAyBmL,KAAKC,UAAUw9H,GAAU,SC7EtE,GAAO,OACP,GAAe,CAAC,SAAU,QAAS,aAAc,aAAc,SAAU,UAAW,YAAa,YAC1F0mB,IAA4B,QAAQ,GAAM,IAAe/qD,IAClE,IAAI,OACFp8E,EAAM,MACN6vG,EAAK,WACL16B,EAAU,WACV0vB,EAAU,OACV94D,EAAM,QACN+oB,EAAO,UACPmuD,EAAS,SACT/lC,GACEd,EAyCJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQi5I,GAGRlkE,QAASsyE,EACT,mBAAoBA,EACpBnkB,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE00F,QAEXsgC,KAsCF,SAAmBh1H,GACjB,GAAIA,EAAE/G,QAAS,EAAAqoH,EAAA,IAAUthH,EAAE/G,OAAQ,CACjC,IAAI+rB,EAAShlB,EAAEy9F,QAMf,OALAz4E,EAAO/rB,MAAQ,GACf+rB,EAASA,EAAO7jB,IAAI,EAAM,IAEnBlI,MAAQuwJ,EAAaxpJ,EAAE/G,OAEvB+rB,EAEP,IAOIykI,EAPAC,EAASnyD,EAAWv3F,EAAE/G,OAEtBywJ,IACF1pJ,EAAE/G,MAAQguH,EAAWjnH,EAAE/G,QAOvBwwJ,GADE,EAAAnoC,EAAA,IAAYthH,EAAE/G,OACR,IAAIosI,EAAU,GAAGhwC,IAAI,IACpB,EAAAisB,EAAA,IAAWthH,EAAE/G,OACd,IAAIqmG,EAAS,EAAG,GAEhB,EAAI,EAGd,IAAIqqD,EAAU3pJ,EAAEmB,IAAIsoJ,GAMpB,OAJIC,IACFC,EAAQ1wJ,MAAQguH,EAAW0iC,EAAQ1wJ,QAG9B0wJ,GAtET,iBAAkB,SAAqB3pJ,GAErC,OAAO,SAAQA,EAAGxG,MAAM,MAa5B,SAASgwJ,EAAaxpJ,EAAG4pJ,GAEvB,IAAIC,EAAO7pJ,EAAEjH,MAAQ,EACjByK,EAAMxD,EAAEwD,MAERsmJ,EAAY,IAAI5yE,EAAQkkE,GAAW53I,GAAM,GAAGy1F,IAAI,IAAI/hB,EAAQ,EAAG2yE,GAAMjnJ,OAEzE,GAAIgnJ,EAAU,CACZ,IAAIG,EAAM,CAACD,EAAW,IAAI5yE,EAAQkkE,GAAW53I,GAAM,GAAGy1F,IAAI,IAAI/hB,EAAQ,EAAG2yE,EAAiB,EAAVrqJ,KAAKsO,GAAS,GAAGlL,OAAQ,IAAIs0E,EAAQkkE,GAAW53I,GAAM,GAAGy1F,IAAI,IAAI/hB,EAAQ,EAAG2yE,EAAiB,EAAVrqJ,KAAKsO,GAAS,GAAGlL,QACpL,MAAyB,UAAlBwf,EAAO+rC,OAAqB47F,EAAM57F,EAAO47F,GAEhD,OAAOD,MC1FT,GAAe,CAAC,SACTE,IAAmC,QAFnC,cAEiD,IAAexrD,IACzE,IAAI,MACFyzB,GACEzzB,EAqBJ,OAAO,SAAoByrD,EAAaC,EAAcrtH,EAAUze,GAE9D,IAAI+rI,EAAQF,EAAYhqI,MACpBmqI,EAAQH,EAAYnT,MACpBuT,EAAMJ,EAAYlT,UAElBuT,EAAUJ,EAAazD,QACvB8D,EAASL,EAAaxD,OACtB8D,EAAON,EAAavD,KACpB8D,EAAQP,EAAapT,MACrB4T,EAAMR,EAAanT,UAEvB,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKH,EACH,MAAM,IAAI3kJ,MAAM,sEAIlB,IAOIzN,EAAG8I,EAPHgY,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAEhBniI,EAAoB,iBAARoiI,GAAoBA,IAAQK,EAAML,OAAMxwJ,EAEpD+wJ,EAAK3iI,EAAKgqG,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,IAAO4U,EAI3CguH,EAAQ,GAEZ,IAAK3yJ,EAAI,EAAGA,EAAI8gB,EAAM9gB,IACpB2yJ,EAAM3yJ,GAAK,GAIb,IAAI8H,EAAI,GAEJkqD,EAAI,GAER,IAAKlpD,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAI5B,IAFA,IAAI8pJ,EAAO9pJ,EAAI,EAENkoF,EAAKshE,EAAKxpJ,GAAIuoF,EAAKihE,EAAKxpJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAIvDF,EAFA9H,EAAIqyJ,EAAOrqJ,IAEJke,EAAUwsI,EAAGN,EAAQpqJ,GAAIiqJ,EAAMjyJ,GAAG8I,IAAM4pJ,EAAGT,EAAMjyJ,GAAG8I,GAAIspJ,EAAQpqJ,IAEvEgqD,EAAEhyD,GAAK4yJ,EAIT,IAAK5yJ,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAEhBgyD,EAAEhyD,KAAO4yJ,EAEXD,EAAM3yJ,GAAG8I,GAAKhB,EAAE9H,GAGhB2yJ,EAAM3yJ,GAAG8I,GAAKmpJ,EAAMjyJ,GAAG8I,GAM7B,OAAOipJ,EAAYjS,kBAAkB,CACnC3mI,KAAMw5I,EACNh+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QCtGZ,GAAe,CAAC,QAAS,eAClB8iI,IAAmC,QAFnC,cAEiD,IAAevsD,IACzE,IAAI,MACFyzB,EAAK,YACLid,GACE1wC,EAoBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,GAEhC,IAAImuH,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACTyD,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAERuT,EAAUppJ,EAAEulJ,QACZ8D,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KACT8D,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAEZ,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIxiI,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBn1D,EAAKi6C,EAEL6X,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELp1D,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAIjC,IAUI/vB,EAAG8I,EAAGd,EAAGgpF,EAAIK,EAVb4hE,EAAUH,GAAWV,EAAU,QAAKzwJ,EACpCyrE,EAAS,GACT8lF,EAAO,GAEPj7G,EAAK66G,GAAWV,EAAU,QAAKzwJ,EAC/BwxJ,EAAKL,GAAWV,EAAU,QAAKzwJ,EAE/ByxJ,EAAK,GACLC,EAAK,GAIT,IAAKvqJ,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAE5BoqJ,EAAKpqJ,GAAKskE,EAAOrtE,OAEjB,IAAI6yJ,EAAO9pJ,EAAI,EAEf,IAAKkoF,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAEnDhI,EAAI+yJ,EAAO/qJ,GAEXolE,EAAOtqE,KAAK9C,GAEZozJ,EAAGpzJ,GAAK4yJ,EAEJ36G,IACFA,EAAGj4C,GAAK8yJ,EAAQ9qJ,IAKpB,IAAKgpF,EAAKshE,EAAKxpJ,GAAIuoF,EAAKihE,EAAKxpJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAInD,GAAIorJ,EAFJpzJ,EAAIqyJ,EAAOrqJ,MAEG4qJ,GAEZ,GAAI36G,EAAI,CAEN,IAAIhwC,EAAIyqJ,EAAGz6G,EAAGj4C,GAAIoyJ,EAAQpqJ,IAErB+0F,EAAG90F,EAAG4mJ,GAKTuE,EAAGpzJ,GAAK,KAHRi4C,EAAGj4C,GAAKiI,QAQZmlE,EAAOtqE,KAAK9C,GAEZqzJ,EAAGrzJ,GAAK4yJ,EAEJO,IACFA,EAAGnzJ,GAAKoyJ,EAAQpqJ,IAMtB,GAAIiwC,GAAMk7G,EAIR,IAFAnrJ,EAAIkrJ,EAAKpqJ,GAEFd,EAAIolE,EAAOrtE,QAIZqzJ,EAFJpzJ,EAAIotE,EAAOplE,MAEG4qJ,GAEZK,EAAQjrJ,GAAKiwC,EAAGj4C,GAEhBgI,KACSqrJ,EAAGrzJ,KAAO4yJ,GAEnBK,EAAQjrJ,GAAKmrJ,EAAGnzJ,GAEhBgI,KAGAolE,EAAOw1C,OAAO56G,EAAG,GASzB,OAFAkrJ,EAAK3nH,GAAW6hC,EAAOrtE,OAEhB8C,EAAE+sJ,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QC1KZ,GAAe,CAAC,QAAS,eAClBujI,IAAmC,QAFnC,cAEiD,IAAehtD,IACzE,IAAI,MACFyzB,EAAK,YACLud,GACEhxC,EAqBJ,OAAO,SAAqBj/D,EAAGr+B,EAAG27B,EAAUze,GAE1C,IAAI4sI,EAAUzrH,EAAEknH,QACZwE,EAAS1rH,EAAEmnH,OACXwE,EAAO3rH,EAAEonH,KACTyD,EAAQ7qH,EAAEu3G,MACVuT,EAAM9qH,EAAEw3G,UAEZ,IAAKiU,EACH,MAAM,IAAIrlJ,MAAM,sEAIlB,IAGIsiB,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBQ,EAAK/tH,EAEU,iBAARwtH,IAETpiI,EAAKoiI,EAELnpJ,EAAI+wH,EAAMna,QAAQ52G,EAAG+mB,GAErB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAUjC,IANA,IAAI4iI,EAAQ,GAER7qJ,EAAI,GAEJkqD,EAAI,GAEClpD,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAIhC,IAFA,IAAI8pJ,EAAO9pJ,EAAI,EAENkoF,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5D,IAAI0d,EAAIqtI,EAAO/qJ,GAEfF,EAAE4d,GAAKotI,EAAQ9qJ,GACfgqD,EAAEtsC,GAAKktI,EAIT,IAAK,IAAI5yJ,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAEd,IAAN8I,IAEF6pJ,EAAM3yJ,GAAK,IAITgyD,EAAEhyD,KAAO4yJ,EAEXD,EAAM3yJ,GAAG8I,GAAKod,EAAUwsI,EAAG1pJ,EAAGlB,EAAE9H,IAAM0yJ,EAAG5qJ,EAAE9H,GAAIgJ,GAG/C2pJ,EAAM3yJ,GAAG8I,GAAKE,EAMpB,OAAO,IAAIsuI,EAAY,CACrBn+H,KAAMw5I,EACNh+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QChGZ,GAAe,CAAC,SACTwjI,IAAmC,QAFnC,cAEiD,IAAejtD,IACzE,IAAI,MACFyzB,GACEzzB,EAgBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,GAEhC,IA0BI5U,EA1BAkiI,EAAQpvJ,EAAEklB,MACVmqI,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAER2U,EAAQxqJ,EAAE+e,MACVwqI,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAER4U,EAAQ,GAEZ,GAAIvB,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,IAAK,IAAIsnC,EAAI,EAAGA,EAAI6qH,EAAMnyJ,OAAQsnC,IAAK,CAErC,GAAI6qH,EAAM7qH,KAAOkrH,EAAMlrH,GACrB,MAAM,IAAIorH,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItGkB,EAAMpsH,GAAK6qH,EAAM7qH,GAMnB,IAAIqrH,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELO,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAIjC,IAAI4iI,EAAQc,EAAM1zJ,OAAS,EAAI2zJ,EAAShB,EAAI,EAAGe,EAAOA,EAAM,GAAIxB,EAAOuB,GAAS,GAEhF,OAAO3wJ,EAAEi9I,kBAAkB,CACzB3mI,KAAMw5I,EACNh+I,KAAM8+I,EACNn6I,SAAUyW,KAId,SAAS2jI,EAAS7uI,EAAGqoB,EAAO7F,EAAGvgC,EAAG6sJ,EAAIC,GAEpC,IAAIC,EAAK,GAET,GAAI3mH,IAAU7F,EAAEtnC,OAAS,EAEvB,IAAK,IAAIC,EAAI,EAAGA,EAAI8G,EAAG9G,IAErB6zJ,EAAG7zJ,GAAK6kB,EAAE8uI,EAAG3zJ,GAAI4zJ,EAAG5zJ,SAItB,IAAK,IAAI8I,EAAI,EAAGA,EAAIhC,EAAGgC,IAErB+qJ,EAAG/qJ,GAAK4qJ,EAAS7uI,EAAGqoB,EAAQ,EAAG7F,EAAGA,EAAE6F,EAAQ,GAAIymH,EAAG7qJ,GAAI8qJ,EAAG9qJ,IAI9D,OAAO+qJ,MCvFP,GAAe,CAAC,SACTC,IAAmC,QAFnC,cAEiD,IAAextD,IACzE,IAAI,MACFyzB,GACEzzB,EAiBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,EAAUze,GAE1C,IAII6J,EAJAkiI,EAAQpvJ,EAAEklB,MACVmqI,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAIR6T,EAAK/tH,EAEU,iBAARwtH,IAETpiI,EAAKoiI,EAELnpJ,EAAI+wH,EAAMna,QAAQ52G,EAAG+mB,GAErB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAIjC,IAAI4iI,EAAQT,EAAMnyJ,OAAS,EAAI2zJ,EAAShB,EAAI,EAAGR,EAAOA,EAAM,GAAID,EAAOjpJ,EAAGkd,GAAW,GAErF,OAAOrjB,EAAEi9I,kBAAkB,CACzB3mI,KAAMw5I,EACNh+I,MAAM,SAAMu9I,GACZ54I,SAAUyW,KAId,SAAS2jI,EAAS7uI,EAAGqoB,EAAO7F,EAAGvgC,EAAG6sJ,EAAIC,EAAI1tI,GAExC,IAAI2tI,EAAK,GAET,GAAI3mH,IAAU7F,EAAEtnC,OAAS,EAEvB,IAAK,IAAIC,EAAI,EAAGA,EAAI8G,EAAG9G,IAErB6zJ,EAAG7zJ,GAAKkmB,EAAUrB,EAAE+uI,EAAID,EAAG3zJ,IAAM6kB,EAAE8uI,EAAG3zJ,GAAI4zJ,QAI5C,IAAK,IAAI9qJ,EAAI,EAAGA,EAAIhC,EAAGgC,IAErB+qJ,EAAG/qJ,GAAK4qJ,EAAS7uI,EAAGqoB,EAAQ,EAAG7F,EAAGA,EAAE6F,EAAQ,GAAIymH,EAAG7qJ,GAAI8qJ,EAAI1tI,GAI/D,OAAO2tI,MC/DP,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,eACxDE,IAA2B,QAF3B,MAEyC,IAAeztD,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,UACX7J,EAAS,YACTmK,GACEhxC,EACA0tD,EAAclC,GAAkB,CAClC/3B,UAEEk6B,EAAcpB,GAAkB,CAClC94B,QACAid,gBAEEkd,EAAcZ,GAAkB,CAClCv5B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA4BF,OAAOA,EArDE,MAqDU,CACjB,iBAAkBwpB,GAClB,uBAmEF,SAAuB1gJ,EAAGmG,GACxB,IAAKnG,EAAEu8F,UAAYp2F,EAAEo2F,QACnB,MAAM,IAAI3xF,MAAM,sDAMlB,IAFA,IAAIohJ,EAAO,IAAI1hB,EAAU,IAEjBnkI,EAAE4zF,UAAU,CAClB,IAAIl3E,EAAI7iB,EAAEu9F,IAAIp3F,GACdnG,EAAImG,EACJA,EAAI0c,EAGN,OAAO7iB,EAAE48F,GAAGovD,GAAQhsJ,EAAEy5F,MAAQz5F,GAhF9B,qBAAsB,SAA0BiF,EAAGe,GACjD,OAAOf,EAAEyD,IAAI1C,IAEf,6BAA8B,SAAkCf,EAAGe,GACjE,OAAOorJ,EAAYnsJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmrJ,EAAYnrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmrJ,EAAYlsJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mCAAoC,SAAqCf,EAAGe,GAC1E,OAAOqrJ,EAAYpsJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,mCAAoC,SAAqCwG,EAAGe,GAC1E,OAAOqrJ,EAAYrrJ,EAAGf,EAAGxG,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAE5D,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,4BAA6B,SAA8BuF,EAAGe,GAE5D,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,WAG/C,mHAAoH,SAAwFM,EAAGmG,EAAGzH,GAGhN,IAFA,IAAIwyE,EAAMzyE,KAAKuB,EAAGmG,GAEThJ,EAAI,EAAGA,EAAIuB,EAAKxB,OAAQC,IAC/B+zE,EAAMzyE,KAAKyyE,EAAKxyE,EAAKvB,IAGvB,OAAO+zE,QCnHT,GAAe,CAAC,QAAS,eAClBsgF,IAAmC,QAFnC,cAEiD,IAAe/tD,IACzE,IAAI,MACFyzB,EAAK,YACLid,GACE1wC,EAqBJ,OAAO,SAAqByrD,EAAaC,EAAcrtH,EAAUze,GAE/D,IAAI+rI,EAAQF,EAAYhqI,MACpBmqI,EAAQH,EAAYnT,MACpBuT,EAAMJ,EAAYlT,UAElBuT,EAAUJ,EAAazD,QACvB8D,EAASL,EAAaxD,OACtB8D,EAAON,EAAavD,KACpB8D,EAAQP,EAAapT,MACrB4T,EAAMR,EAAanT,UAEvB,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKH,EACH,MAAM,IAAI3kJ,MAAM,sEAIlB,IAGIsiB,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBn1D,EAAKi6C,EAEL6X,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELp1D,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAQjC,IAJA,IAAIkjI,EAAU,GACV7lF,EAAS,GACT8lF,EAAO,GAEFpqJ,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhCoqJ,EAAKpqJ,GAAKskE,EAAOrtE,OAEjB,IAAK,IAAIixF,EAAKshE,EAAKxpJ,GAAIuoF,EAAKihE,EAAKxpJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5D,IAAIhI,EAAIqyJ,EAAOrqJ,GAEXssJ,EAAMpuI,EAAUwsI,EAAGN,EAAQpqJ,GAAIiqJ,EAAMjyJ,GAAG8I,IAAM4pJ,EAAGT,EAAMjyJ,GAAG8I,GAAIspJ,EAAQpqJ,IAErE+0F,EAAGu3D,EAAKzF,KAEXzhF,EAAOtqE,KAAK9C,GACZizJ,EAAQnwJ,KAAKwxJ,KAQnB,OAFApB,EAAK3nH,GAAW6hC,EAAOrtE,OAEhBiyJ,EAAapC,mBAAmB,CACrCxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QC1GZ,GAAe,CAAC,SACTwkI,IAAmC,QAFnC,cAEiD,IAAejuD,IACzE,IAAI,MACFyzB,GACEzzB,EAqBJ,OAAO,SAAqByrD,EAAaC,EAAcrtH,EAAUze,GAE/D,IAAI+rI,EAAQF,EAAYhqI,MACpBmqI,EAAQH,EAAYnT,MACpBuT,EAAMJ,EAAYlT,UAElBuT,EAAUJ,EAAazD,QACvB8D,EAASL,EAAaxD,OACtB8D,EAAON,EAAavD,KACpB8D,EAAQP,EAAapT,MACrB4T,EAAMR,EAAanT,UAEvB,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKH,EACH,MAAM,IAAI3kJ,MAAM,sEAIlB,IAGIsiB,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBrD,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELtD,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAMjC,IAFA,IAAI4iI,EAAQ,GAEHriI,EAAI,EAAGA,EAAIxP,EAAMwP,IAExBqiI,EAAMriI,GAAK,GAQb,IAJA,IAAIxoB,EAAI,GAEJkqD,EAAI,GAEClpD,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAIhC,IAFA,IAAI8pJ,EAAO9pJ,EAAI,EAENkoF,EAAKshE,EAAKxpJ,GAAIuoF,EAAKihE,EAAKxpJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5D,IAAIhI,EAAIqyJ,EAAOrqJ,GAEfF,EAAE9H,GAAKkmB,EAAUwsI,EAAGN,EAAQpqJ,GAAIiqJ,EAAMjyJ,GAAG8I,IAAM4pJ,EAAGT,EAAMjyJ,GAAG8I,GAAIspJ,EAAQpqJ,IACvEgqD,EAAEhyD,GAAK4yJ,EAIT,IAAK,IAAI/pJ,EAAI,EAAGA,EAAIiY,EAAMjY,IAEpBmpD,EAAEnpD,KAAO+pJ,EAEXD,EAAM9pJ,GAAGC,GAAKhB,EAAEe,GAGhB8pJ,EAAM9pJ,GAAGC,GAAKod,EAAUwsI,EAAG7D,EAAMoD,EAAMppJ,GAAGC,IAAM4pJ,EAAGT,EAAMppJ,GAAGC,GAAI+lJ,GAMtE,OAAOkD,EAAYjS,kBAAkB,CACnC3mI,KAAMw5I,EACNh+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QChHZ,GAAe,CAAC,QAAS,eAClBykI,IAAmC,QAFnC,cAEiD,IAAeluD,IACzE,IAAI,MACFyzB,EAAK,YACLid,GACE1wC,EAoBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,GAEhC,IAAImuH,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACTyD,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAERuT,EAAUppJ,EAAEulJ,QACZ8D,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KACT8D,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAEZ,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIxiI,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBn1D,EAAKi6C,EAEL6X,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELp1D,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAIjC,IAUI/vB,EAAG8I,EAAGd,EAAGqpF,EAVT4hE,EAAUH,GAAWV,EAAU,QAAKzwJ,EACpCyrE,EAAS,GACT8lF,EAAO,GAEPj7G,EAAKg7G,EAAU,QAAKtxJ,EACpBwxJ,EAAKF,EAAU,QAAKtxJ,EAEpByxJ,EAAK,GACLC,EAAK,GAIT,IAAKvqJ,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAE5BoqJ,EAAKpqJ,GAAKskE,EAAOrtE,OAEjB,IAAI6yJ,EAAO9pJ,EAAI,EAEf,IAAKd,EAAIgrJ,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIqpF,EAAIrpF,IAE1ChI,EAAI+yJ,EAAO/qJ,GAEXolE,EAAOtqE,KAAK9C,GAEZozJ,EAAGpzJ,GAAK4yJ,EAEJ36G,IACFA,EAAGj4C,GAAK8yJ,EAAQ9qJ,IAKpB,IAAKA,EAAIsqJ,EAAKxpJ,GAAIuoF,EAAKihE,EAAKxpJ,EAAI,GAAId,EAAIqpF,EAAIrpF,IAItCorJ,EAFJpzJ,EAAIqyJ,EAAOrqJ,MAEG4qJ,GAEZxlF,EAAOtqE,KAAK9C,GAIdqzJ,EAAGrzJ,GAAK4yJ,EAEJO,IACFA,EAAGnzJ,GAAKoyJ,EAAQpqJ,IAKpB,GAAIirJ,EAIF,IAFAjrJ,EAAIkrJ,EAAKpqJ,GAEFd,EAAIolE,EAAOrtE,QAAQ,CAIxB,IAAI00J,EAAMrB,EAFVpzJ,EAAIotE,EAAOplE,IAGP0sJ,EAAMrB,EAAGrzJ,GAEb,GAAIy0J,IAAQ7B,GAAQ8B,IAAQ9B,EAAM,CAEhC,IAGI+B,EAAKjC,EAHA+B,IAAQ7B,EAAO36G,EAAGj4C,GAAK6uJ,EACvB6F,IAAQ9B,EAAOO,EAAGnzJ,GAAK6uJ,GAI3B9xD,EAAG43D,EAAI9F,GAOVzhF,EAAOw1C,OAAO56G,EAAG,IALjBirJ,EAAQnwJ,KAAK6xJ,GAEb3sJ,OAaV,OAFAkrJ,EAAK3nH,GAAW6hC,EAAOrtE,OAEhB8C,EAAE+sJ,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QCnKZ,GAAe,CAAC,QAAS,eAClB6kI,IAAmC,QAFnC,cAEiD,IAAetuD,IACzE,IAAI,MACFyzB,EAAK,YACLid,GACE1wC,EAqBJ,OAAO,SAAqBj/D,EAAGr+B,EAAG27B,EAAUze,GAE1C,IAAI4sI,EAAUzrH,EAAEknH,QACZwE,EAAS1rH,EAAEmnH,OACXwE,EAAO3rH,EAAEonH,KACTyD,EAAQ7qH,EAAEu3G,MACVuT,EAAM9qH,EAAEw3G,UAEZ,IAAKiU,EACH,MAAM,IAAIrlJ,MAAM,sEAIlB,IAGIsiB,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBn1D,EAAKi6C,EAEL6X,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,IAETpiI,EAAKoiI,EAELp1D,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB/mB,EAAI+wH,EAAMna,QAAQ52G,EAAG+mB,GAErB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAQjC,IAJA,IAAIkjI,EAAU,GACV7lF,EAAS,GACT8lF,EAAO,GAEFpqJ,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhCoqJ,EAAKpqJ,GAAKskE,EAAOrtE,OAEjB,IAAK,IAAIixF,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5D,IAAIhI,EAAI+yJ,EAAO/qJ,GAEXC,EAAIie,EAAUwsI,EAAG1pJ,EAAG8pJ,EAAQ9qJ,IAAM0qJ,EAAGI,EAAQ9qJ,GAAIgB,GAEhD+zF,EAAG90F,EAAG4mJ,KAETzhF,EAAOtqE,KAAK9C,GACZizJ,EAAQnwJ,KAAKmF,KAQnB,OAFAirJ,EAAK3nH,GAAW6hC,EAAOrtE,OAEhBsnC,EAAEuoH,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QC9FZ,GAAe,CAAC,QAAS,eAClB8kI,IAAmC,QAFnC,cAEiD,IAAevuD,IACzE,IAAI,MACFyzB,EAAK,YACLud,GACEhxC,EAqBJ,OAAO,SAAqBj/D,EAAGr+B,EAAG27B,EAAUze,GAE1C,IAAI4sI,EAAUzrH,EAAEknH,QACZwE,EAAS1rH,EAAEmnH,OACXwE,EAAO3rH,EAAEonH,KACTyD,EAAQ7qH,EAAEu3G,MACVuT,EAAM9qH,EAAEw3G,UAEZ,IAAKiU,EACH,MAAM,IAAIrlJ,MAAM,sEAIlB,IAGIsiB,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBQ,EAAK/tH,EAEU,iBAARwtH,IAETpiI,EAAKoiI,EAELnpJ,EAAI+wH,EAAMna,QAAQ52G,EAAG+mB,GAErB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAUjC,IANA,IAAI4iI,EAAQ,GAER7qJ,EAAI,GAEJkqD,EAAI,GAEClpD,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAIhC,IAFA,IAAI8pJ,EAAO9pJ,EAAI,EAENkoF,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5D,IAAI0d,EAAIqtI,EAAO/qJ,GAEfF,EAAE4d,GAAKotI,EAAQ9qJ,GACfgqD,EAAEtsC,GAAKktI,EAIT,IAAK,IAAI5yJ,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAEd,IAAN8I,IAEF6pJ,EAAM3yJ,GAAK,IAITgyD,EAAEhyD,KAAO4yJ,EAEXD,EAAM3yJ,GAAG8I,GAAKod,EAAUwsI,EAAG1pJ,EAAGlB,EAAE9H,IAAM0yJ,EAAG5qJ,EAAE9H,GAAIgJ,GAG/C2pJ,EAAM3yJ,GAAG8I,GAAKod,EAAUwsI,EAAG1pJ,EAAG,GAAK0pJ,EAAG,EAAG1pJ,GAM/C,OAAO,IAAIsuI,EAAY,CACrBn+H,KAAMw5I,EACNh+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QCzFZ,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3C+kI,IAA2B,QAF3B,MAEyC,IAAexuD,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,YACXM,GACEhxC,EACAyuD,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEge,EAAcT,GAAkB,CAClCx6B,UAEEk7B,EAAcT,GAAkB,CAClCz6B,QACAid,gBAEEke,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEme,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAsCF,OAAOA,EAtEE,MAsEU,CACjB,iBAAkB6pB,GAClB,uBAAwB,SAA4B97I,EAAGe,GACrD,GAAIA,EAAE21F,QACJ,MAAM,IAAI/wF,MAAM,+CAGlB,OAAO5E,EAAE+zF,SAAW90F,EAAIA,EAAEs4F,IAAIv3F,IAEhC,qBAAsB,SAA0Bf,EAAGe,GACjD,GAAIA,EAAE65F,QAAQ,GAAK,EACjB,MAAM,IAAIj1F,MAAM,+CAIlB,OAAO3F,EAAE46F,QAAQ,IAAM,EAAI56F,EAAEs4F,IAAIv3F,GAAKf,EAAEs4F,IAAIv3F,GAAGgF,IAAIhF,GAAGu3F,IAAIv3F,IAE5D,6BAA8B,SAAkCf,EAAGe,GACjE,OAAOosJ,EAAYntJ,EAAGe,EAAGvH,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCtI/C,GAAe,CAAC,QAAS,eAClB6yJ,IAAmC,QAFnC,cAEiD,IAAe9uD,IACzE,IAAI,MACFyzB,EAAK,YACLid,GACE1wC,EAoBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,GAEhC,IAAImuH,EAAUjwJ,EAAE0rJ,QACZ2D,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAERuT,EAAUppJ,EAAEulJ,QACZgE,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAEZ,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIxiI,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBn1D,EAAKi6C,EAEL6X,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELp1D,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAcjC,IAVA,IAAIkjI,EAAUH,GAAWV,EAAU,QAAKzwJ,EACpCyrE,EAAS,GACT8lF,EAAO,GAEPprJ,EAAImrJ,EAAU,QAAKtxJ,EAEnBqwD,EAAI,GAEJgY,EAAI,GAEClhE,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhCoqJ,EAAKpqJ,GAAKskE,EAAOrtE,OAEjB,IAAI6yJ,EAAO9pJ,EAAI,EAMf,IAJA,SAAQjG,EAAGiG,EAAGkpD,EAAGlqD,EAAGkiE,EAAG4oF,EAAMxlF,EAAQslF,IAErC,SAAQ1pJ,EAAGF,EAAGkpD,EAAGlqD,EAAGkiE,EAAG4oF,EAAMxlF,EAAQslF,GAEjC5qJ,EAIF,IAFA,IAAIE,EAAIkrJ,EAAKpqJ,GAENd,EAAIolE,EAAOrtE,QAAQ,CAExB,IAAIC,EAAIotE,EAAOplE,GAEf,GAAIgiE,EAAEhqE,KAAO4yJ,EAAM,CAEjB,IAAI3qJ,EAAIH,EAAE9H,GAEL+8F,EAAG90F,EAAG4mJ,GAOTzhF,EAAOw1C,OAAO56G,EAAG,IALjBirJ,EAAQnwJ,KAAKmF,GAEbD,UAOFolE,EAAOw1C,OAAO56G,EAAG,QAOrB,IAFA,IAAI5C,EAAI8tJ,EAAKpqJ,GAEN1D,EAAIgoE,EAAOrtE,QAIZiqE,EAFIoD,EAAOhoE,MAEFwtJ,EAEXxlF,EAAOw1C,OAAOx9G,EAAG,GAGjBA,IASR,OAFA8tJ,EAAK3nH,GAAW6hC,EAAOrtE,OAEhB8C,EAAE+sJ,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QCzIZ,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,cAAe,aAC3CslI,IAA+B,QAAQ,GAAM,IAAe/uD,IACrE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EACA7J,UAAW0X,GACTv+C,EACA0tD,EAAclC,GAAkB,CAClC/3B,UAEEg7B,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEse,EAAcF,GAAkB,CAClCr7B,QACAid,gBAEEke,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAgCEw7B,EAAa,0EACjB,OAAOx7B,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAO,GAAcA,EAAG,IAE1B,iBAAkB,GAClBqlI,UAAW,SAAmBrlI,GAC5B,OAAO0tJ,EAAY1tJ,EAAG,IAAI+8I,EAAW,KAEvC7lE,QAAS,SAAiBl3E,GACxB,MAAM,IAAI2F,MAAM8nJ,IAElB,kBAAmB,SAAuBztJ,EAAGe,GAC3C,MAAM,IAAI4E,MAAM8nJ,IAElB,uBAAwBC,EACxB,iBAAkB,SAAqB1tJ,GACrC,OAAOxG,KAAKwG,EAAG,IAEjB,6BAA8B,SAAkCA,EAAGe,GAEjE,GAAoB,IAAhBA,EAAEinJ,UAEJ,OAAOwF,EAAYxtJ,EAAGe,EAAGvH,MAGzB,MAAM,IAAImM,MAAM,0BAGpB,4BAA6B,SAAiC3F,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAE/D,GAAoB,IAAhBA,EAAEinJ,UAEJ,OAAOkE,EAAYlsJ,EAAGe,EAAGvH,MAAM,GAG/B,MAAM,IAAImM,MAAM,0BAGpB,2BAA4B,SAAgC3F,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mCAAoC,SAAqCf,EAAGe,GAC1E,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,mCAAoC,SAAqCwG,EAAGe,GAE1E,GAAoB,IAAhBA,EAAEinJ,UAEJ,OAAOoF,EAAYrsJ,EAAGf,EAAGxG,MAAM,GAG/B,MAAM,IAAImM,MAAM,0BAGpB,kCAAmC,SAAoC3F,EAAGe,GACxE,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAE5D,OAAOvH,KAAK20D,EAAOnuD,GAAIe,GAAGtG,WAE5B,4BAA6B,SAA8BuF,EAAGe,GAE5D,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,IAAItG,aAW9B,SAASizJ,EAAY3yJ,EAAGoqB,GACtB,IAAIgsE,EAAY4rD,EAAW5rD,UAEvBw8D,EAAM5Q,EAAWt/C,MAAM,CACzBtM,UAAWA,EAAY,IAGrB41D,EAAO,IAAIhK,EAAW,GACtBjnD,EAAM,IAAI63D,EAAI,GACdvkC,EAAMjkG,EAAKoyE,aAMf,GAJI6xB,IACFjkG,EAAOA,EAAKqvE,OAGVrvE,EAAK2vE,SACP,MAAM,IAAInvF,MAAM,yBAGlB,GAAI5K,EAAEw8F,eAAiBpyE,EAAK3hB,MAAM80F,IAAI,GAAG9C,OAAO,GAC9C,MAAM,IAAI7vF,MAAM,wCAIlB,GAAI5K,EAAE+5F,SACJ,OAAOs0B,EAAM,IAAIukC,EAAI91E,KAAY,EAGnC,IAAK98E,EAAEqgE,WACL,OAAOguD,EAAM29B,EAAOhsJ,EAGtB,IAAIiF,EAAIjF,EAAEyI,MAAMrC,IAAI20F,EAAIT,IAAIlwE,IAI5B,OADAnlB,EAAIjF,EAAE27F,QAAU12F,EAAEw0F,MAAQx0F,EACnB,IAAI+8I,GAAY3zB,EAAMtzB,EAAIT,IAAIr1F,GAAKA,GAAGq6F,YAAYlJ,QCnMzD,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,SAAU,aACtCy8D,IAA4B,QAAQ,GAAM,IAAepvD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,UACNk3E,GACE7mC,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAsBl3H,EAAGmG,GACzC,IAAI+qE,EAAMgwE,GAAWlhJ,EAAGmG,GACxB,MAAyB,UAAlBkhB,EAAO+rC,OAAqB8d,EAAM9d,EAAO8d,IAElD,uBAWF,SAAwBlxE,EAAGmG,GAEzB,IACAqiB,EAEAg1E,EAEA36E,EAyBIquD,EAxBA86E,EAAO,IAAI1hB,EAAU,GACrBvvC,EAAM,IAAIuvC,EAAU,GACpBrlI,EAAI+mJ,EACJ7K,EAAQpmD,EACR/0F,EAAI+0F,EACJqmD,EAAQ4K,EAEZ,IAAKhsJ,EAAEu8F,UAAYp2F,EAAEo2F,QACnB,MAAM,IAAI3xF,MAAM,uDAGlB,MAAQzE,EAAE4zF,UACRyD,EAAIx9F,EAAEs6F,IAAIn0F,GAAGO,QACbmc,EAAI7iB,EAAEu9F,IAAIp3F,GACVqiB,EAAIvjB,EACJA,EAAIk8I,EAAM1vI,MAAM+rF,EAAEnpF,MAAMpP,IACxBk8I,EAAQ34H,EACRA,EAAIxiB,EACJA,EAAIo7I,EAAM3vI,MAAM+rF,EAAEnpF,MAAMrO,IACxBo7I,EAAQ54H,EACRxoB,EAAImG,EACJA,EAAI0c,EAWN,OALEquD,EADElxE,EAAE48F,GAAGovD,GACD,CAAChsJ,EAAEy5F,MAAO0nD,EAAM1nD,MAAO2nD,EAAM3nD,OAE7B,CAACz5F,EAAIA,EAAE+5F,SAAmB,EAARonD,EAAWC,GAGZ,UAAlB/5H,EAAO+rC,OAAqB8d,EAAM9d,EAAO8d,SCnFhD,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAC5B4hF,IAA8B,QAAQ,GAAM,IAAervD,IACpE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,GACE1wC,EACAyuD,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEse,EAAcF,GAAkB,CAClCr7B,QACAid,gBAEEke,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAyBF,OAAOA,EAAM,GAAM,CACjB,iBAAkBwsB,GAClB,uBAAwBvB,GACxB,6BAA8B,SAAkCl9I,EAAGe,GACjE,OAAOysJ,EAAYxtJ,EAAGe,EAAGvH,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYjtJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOqsJ,EAAYrsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCnG/C,GAAe,CAAC,QAAS,eAClBqzJ,IAAmC,QAFnC,cAEiD,IAAetvD,IACzE,IAAI,MACFyzB,EAAK,YACLud,GACEhxC,EAgBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,GAEhC,IAAIutH,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAER0T,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAEZ,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIxiI,EAgBA/vB,EAAG8I,EAnBHgY,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBrD,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELtD,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAMjC,IAAI4iI,EAAQ,GAEZ,IAAK3yJ,EAAI,EAAGA,EAAI8gB,EAAM9gB,IACpB2yJ,EAAM3yJ,GAAK,GAIb,IAAIi4C,EAAK,GACLk7G,EAAK,GAELC,EAAK,GACLC,EAAK,GAET,IAAKvqJ,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAE5B,IAAI8pJ,EAAO9pJ,EAAI,EAQf,IANA+sJ,EAAShzJ,EAAGiG,EAAGsqJ,EAAIn7G,EAAI26G,GAGvBiD,EAAS7sJ,EAAGF,EAAGuqJ,EAAIF,EAAIP,GAGlB5yJ,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAAK,CAEzB,IAAI81J,EAAK1C,EAAGpzJ,KAAO4yJ,EAAO36G,EAAGj4C,GAAK6uJ,EAC9BkH,EAAK1C,EAAGrzJ,KAAO4yJ,EAAOO,EAAGnzJ,GAAK6uJ,EAElC8D,EAAM3yJ,GAAG8I,GAAK4pJ,EAAGoD,EAAIC,IAKzB,OAAO,IAAIze,EAAY,CACrBn+H,KAAMw5I,EACNh+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,KAId,SAAS8lI,EAASnkJ,EAAG5I,EAAGkpD,EAAGlqD,EAAG8qJ,GAM5B,IAJA,IAAIxlJ,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KAEHzmJ,EAAI4mJ,EAAI9lJ,GAAIuoF,EAAKu9D,EAAI9lJ,EAAI,GAAId,EAAIqpF,EAAIrpF,IAAK,CAEjD,IAAIhI,EAAIqJ,EAAMrB,GAEdgqD,EAAEhyD,GAAK4yJ,EACP9qJ,EAAE9H,GAAKoN,EAAOpF,QC1GhB,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAC5BguJ,IAA8B,QAAQ,GAAM,IAAe1vD,IACpE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACNqhF,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAyBF,OAAOA,EAAM,GAAM,CACjB,iBAAkB2sB,GAClB,uBAAwB,GACxB,6BAA8B,SAAkC5+I,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBC7F/C,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3C2zJ,IAA0B,QAF1B,KAEwC,IAAe5vD,IAChE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,YACXM,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk7B,EAAcT,GAAkB,CAClCz6B,QACAid,gBAEEme,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA+BF,OAAOA,EAvDE,KAuDU,CACjB,iBAAkBmtB,GAClB,mBAAoB,SAAwBp/I,EAAGe,GAC7C,OAAgB,IAATf,EAAEuzB,IAAqB,IAATvzB,EAAEs3E,IAAqB,IAATv2E,EAAEwyB,IAAqB,IAATxyB,EAAEu2E,IAErD,uBAAwB,SAA4Bt3E,EAAGe,GACrD,OAAQf,EAAE80F,WAAa90F,EAAEkC,UAAYnB,EAAE+zF,WAAa/zF,EAAEmB,SAExD,aAAc,SAAkBlC,EAAGe,GACjC,OAAOvH,KAAKwG,EAAE/G,OAAS,EAAG8H,EAAE9H,OAAS,IAEvC,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOosJ,EAAYntJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBC/G/C,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,cAAe,gBAC3C4zJ,IAA4B,QAAQ,GAAM,IAAe7vD,IAClE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACNqhF,EAAW,aACXC,GACEjxC,EAuCJ,OAAOyzB,EAAM,GAAM,CAEjB75H,MAAO,SAAe4H,GACpB,OAAOsuJ,EAAMtuJ,EAAG,GAAG,SAAUA,GAAI,OAEnC,gBAAiB,SAAqBA,EAAGE,GACvC,OAAOouJ,EAAMtuJ,EAAGE,GAAG,SAAUF,GAAI,OAEnC,mBAAoB,SAAwBA,EAAGE,GAC7C,OAAOouJ,EAAMtuJ,EAAGE,EAAE85F,YAAY,SAAUh6F,GAAI,OAE9C,gBAAiB,SAAqBA,EAAG6iI,GACvC,OAAOyrB,EAAMtuJ,EAAG,GAAG,SAAUA,GAAI6iI,IAEnC,wBAAyB,SAA2B7iI,EAAGE,EAAG2iI,GACxD,OAAOyrB,EAAMtuJ,EAAGE,GAAG,SAAUF,GAAI6iI,IAEnC,2BAA4B,SAA8B7iI,EAAGE,EAAG2iI,GAC9D,OAAOyrB,EAAMtuJ,EAAGE,EAAE85F,YAAY,SAAUh6F,GAAI6iI,IAE9C0M,OAAQ,SAAgBvvI,GACtB,OAAOsuJ,EAAMtuJ,EAAG,EAAGA,EAAE6M,OAAQ7M,EAAEkzI,YAEjC,iBAAkB,SAAsBlzI,EAAGE,GACzC,OAAOouJ,EAAMtuJ,EAAGE,EAAGF,EAAE6M,OAAQ7M,EAAEkzI,YAEjC,oBAAqB,SAAyBlzI,EAAGE,GAC/C,OAAOouJ,EAAMtuJ,EAAGE,EAAE85F,WAAYh6F,EAAE6M,OAAQ7M,EAAEkzI,YAE5C,iBAAkB,SAAsBlzI,EAAG6iI,GACzC,OAAOyrB,EAAMtuJ,EAAG,EAAGA,EAAE6M,OAAQg2H,IAE/B,yBAA0B,SAA4B7iI,EAAGE,EAAG2iI,GAC1D,OAAOyrB,EAAMtuJ,EAAGE,EAAGF,EAAE6M,OAAQg2H,IAE/B,4BAA6B,SAA+B7iI,EAAGE,EAAG2iI,GAChE,OAAOyrB,EAAMtuJ,EAAGE,EAAE85F,WAAYh6F,EAAE6M,OAAQg2H,MAa5C,SAASyrB,EAAMtuJ,EAAGE,EAAG2M,EAAMg2H,GACzB,KAAK,OAAU3iI,GACb,MAAM,IAAIjG,UAAU,wDAGtB,IAAIu+I,EAASt4I,EAAI,EAAIA,EAAI,EACrBu4I,EAAOv4I,EAAI,GAAKA,EAAI,EAExB,OAAQ2M,EAAK5U,QACX,KAAK,EACH,OASN,SAA+B+H,EAAGE,EAAG2iI,EAAQv+F,EAAGm0G,EAAMD,GAEpD,IAAIG,EAAK,CAACr0G,EAAIm0G,EAAMn0G,EAAIk0G,GAExB,GAAI3V,GAAqB,WAAXA,GAAkC,UAAXA,EACnC,MAAM,IAAI5oI,UAAU,uBAAuBiL,OAAO29H,EAAQ,MAI5D,IAAIj5H,EAAe,WAAXi5H,EAAsB4M,EAAa8I,SAASI,EAAI34I,EAAGE,GAAKsvI,EAAY+I,SAASI,EAAI34I,EAAGE,GAE5F,OAAkB,OAAX2iI,EAAkBj5H,EAAIA,EAAEnP,UApBpB8zJ,CAAsBvuJ,EAAGE,EAAG2iI,EAAQh2H,EAAK,GAAI4rI,EAAMD,GAE5D,KAAK,EACH,OAoBN,SAAsBx4I,EAAGE,EAAG2iI,EAAQtjG,EAAGk5G,EAAMD,GAE3C,IAAI,EAAAl3B,EAAA,IAASthH,GAAI,CAEf,IAAIwuJ,EAAKxuJ,EAAEu4I,SAASr4I,GAEpB,OAAe,OAAX2iI,EAEEA,IAAW2rB,EAAGtb,UACT/kF,EAAOqgG,EAAI3rB,GAGb2rB,EAGFA,EAAG/zJ,UAQZ,IAJA,IAAIuE,EAAIQ,KAAKwsB,IAAIuT,EAAE,GAAKk5G,EAAMl5G,EAAE,GAAKi5G,GAEjCiW,EAAS,GAEJv2J,EAAI,EAAGA,EAAI8G,EAAG9G,IACrBu2J,EAAOv2J,GAAK8H,EAAE9H,EAAIugJ,GAAMvgJ,EAAIsgJ,GAI9B,OAAkB,OAAX3V,EAAkB10E,EAAOsgG,GAAUA,EAhD/BC,CAAa1uJ,EAAGE,EAAG2iI,EAAQh2H,EAAM4rI,EAAMD,GAGlD,MAAM,IAAImS,WAAW,sDChHrB,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,SAAU,YAAa,cAAe,gBAClEgE,IAAgC,QAAQ,GAAM,IAAenwD,IACtE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,UACNk3E,EAAS,YACTmK,EAAW,aACXC,GACEjxC,EAgCJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,MAAyB,WAAlB7vG,EAAO+rC,OAAsBA,EAAO,IAAM,IAEnDulD,OAAQ,SAAgBmvB,GACtB,OAAO10E,EAAO00E,IAEhB,qBAAsB,SAAyB7pH,GAC7C,OAAO41I,EAAU51I,EAAMA,EAAwB,WAAlBoJ,EAAO+rC,OAAsB,aAAUt0D,IAEtE,6BAA8B,SAA+Bmf,EAAM6pH,GACjE,OAAO+rB,EAAU51I,EAAMA,EAAM6pH,IAE/B,yCAA0C,SAAwC7pH,EAAMg+B,GACtF,OAAO43G,EAAU51I,EAAMg+B,EAAwB,WAAlB50B,EAAO+rC,OAAsB,aAAUt0D,IAEtE,iDAAkD,SAA8Cmf,EAAMg+B,EAAM6rF,GAC1G,OAAO+rB,EAAU51I,EAAMg+B,EAAM6rF,IAE/BzqI,MAAO,SAAeyU,GACpB,OAAOgiJ,EAAgBhiJ,IAEzB,gBAAiB,SAAqBA,EAAMg2H,GAC1C,OAAOgsB,EAAgBhiJ,EAAMg2H,IAE/B0M,OAAQ,SAAgB1iI,GACtB,OAAOgiJ,EAAgBhiJ,EAAKpS,UAAWoS,EAAKqmI,YAE9C,iBAAkB,SAAsBrmI,EAAMg2H,GAC5C,OAAOgsB,EAAgBhiJ,EAAKpS,UAAWooI,MAI3C,SAASgsB,EAAgBhiJ,EAAMg2H,GAC7B,OAAQh2H,EAAK5U,QACX,KAAK,EACH,OAAO4qI,EAAS10E,EAAO00E,GAAU,GAEnC,KAAK,EACH,OAAO+rB,EAAU/hJ,EAAK,GAAIA,EAAK,GAAIg2H,GAErC,KAAK,EACH,OAAO+rB,EAAU/hJ,EAAK,GAAIA,EAAK,GAAIg2H,GAErC,QACE,MAAM,IAAIl9H,MAAM,0CAatB,SAASipJ,EAAU51I,EAAMg+B,EAAM6rF,GAE7B,IAAI8qB,GAAM,EAAArsC,EAAA,IAAYtoG,KAAS,EAAAsoG,EAAA,IAAYtqE,GAAQquF,EAAY,KAI/D,IAHI,EAAA/jB,EAAA,IAAYtoG,KAAOA,EAAOA,EAAKghF,aAC/B,EAAAsnB,EAAA,IAAYtqE,KAAOA,EAAOA,EAAKgjD,cAE9B,OAAUhhF,IAASA,EAAO,EAC7B,MAAM,IAAIrT,MAAM,6DAGlB,KAAK,OAAUqxC,IAASA,EAAO,EAC7B,MAAM,IAAIrxC,MAAM,6DAGlB,IAAImwF,EAAM63D,EAAM,IAAItoB,EAAU,GAAK,EAC/B5nB,EAAekwC,EAAM,IAAIA,EAAI,GAAK,EAClC9gJ,EAAO,CAACmM,EAAMg+B,GAElB,GAAI6rF,EAAQ,CAEV,GAAe,WAAXA,EACF,OAAO4M,EAAa8I,SAAS1rI,EAAMipF,EAAK,EAAG2nB,GAG7C,GAAe,UAAXolB,EACF,OAAO2M,EAAY+I,SAAS1rI,EAAMipF,EAAK,EAAG2nB,GAG5C,MAAM,IAAIxjH,UAAU,wBAAyBiL,OAAO29H,EAAQ,MAQ9D,IAJA,IAAI52D,GAAM,SAAO,GAAIp/D,EAAM4wG,GAEvBqxC,EAAU91I,EAAOg+B,EAAOh+B,EAAOg+B,EAE1B9tC,EAAI,EAAGA,EAAI4lJ,EAAS5lJ,IAC3B+iE,EAAI/iE,GAAGA,GAAK4sF,EAGd,OAAO7pB,MC3IP,GAAe,CAAC,QAAS,SAAU,SAAU,aACtC8iF,IAA4B,QAF5B,OAE0C,IAAevwD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,UACNk3E,GACE7mC,EAmCJ,OAAOyzB,EAAM,OAAQ,CACnB,GAAI,WACF,MAAyB,UAAlB7vG,EAAO+rC,OAAqB6gG,EAAM,IAAMA,EAAM,GAAI,YAI3D,iCAAkC,SAA+BniJ,GAG/D,GAAoB,iBAFTA,EAAKA,EAAK5U,OAAS,GAEA,CAC5B,IAAI4qI,EAASh2H,EAAKmmD,MAClB,OAAOg8F,EAAMniJ,EAAMg2H,GACd,MAAsB,UAAlBzgH,EAAO+rC,OACT6gG,EAAMniJ,GAENmiJ,EAAMniJ,EAAM,YAGvBzU,MAAO42J,EACPzf,OAAQ,SAAgB1iI,GACtB,IAAIg2H,EAASh2H,EAAKqmI,UAClB,OAAO8b,EAAMniJ,EAAKpS,UAAWooI,IAE/B,yBAA0B,SAA2Bh2H,EAAMg2H,GACzD,OAAOmsB,EAAMniJ,EAAKpS,UAAWooI,MAWjC,SAASmsB,EAAMniJ,EAAMg2H,GACnB,IAEIplB,EA0BN,SAAoB5wG,GAClB,IAAIoiJ,GAAgB,EAOpB,OANApiJ,EAAK0J,SAAQ,SAAUtd,EAAOsI,EAAOxJ,IAC/B,EAAAupH,EAAA,IAAYroH,KACdg2J,GAAgB,EAChBl3J,EAAIwJ,GAAStI,EAAM+gG,eAGhBi1D,EApCapS,CAAWhwI,GAEI,IAAIw4H,EAAU,GAAK,EAItD,GAkCF,SAAmBx4H,GACjBA,EAAK0J,SAAQ,SAAUtd,GACrB,GAAqB,iBAAVA,KAAuB,OAAUA,IAAUA,EAAQ,EAC5D,MAAM,IAAI0M,MAAM,4DAvCpBupJ,CAAUriJ,GAENg2H,EAAQ,CAEV,IAAIj5H,EAAIukD,EAAO00E,GAEf,OAAIh2H,EAAK5U,OAAS,EACT2R,EAAEgN,OAAO/J,EAAM4wG,GAGjB7zG,EAGP,IAAI7R,EAAM,GAEV,OAAI8U,EAAK5U,OAAS,GACT,SAAOF,EAAK8U,EAAM4wG,GAGpB1lH,MCxGT,GAAO,UACP,GAAe,CAAC,QAAS,YAAa,UAC/Bo3J,IAA+B,QAAQ,GAAM,IAAe3wD,IACrE,IAAI,MACFyzB,EAAK,UACLn/D,GACE0rC,EA0CJ,OAAOyzB,EAAM,GAAM,CACjB,gBAAiB,SAAqBjyH,EAAGkoJ,GACvC,OAAOloJ,EAAEmhI,QAAQ+mB,IAEnB,eAAgB,SAAoBloJ,EAAGkoJ,GAMrC,OALAA,EAAM3xI,SAAQ,SAAU1J,GACtB,IAAKimD,EAAUjmD,GACb,MAAM,IAAI5S,UAAU,+BAAiC4S,OAGlD,SAAa7M,EAAGkoJ,S,WCzDzB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5BkH,IAA4B,QAAQ,GAAM,IAAe5wD,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,GACEqwC,EAyBJ,OAAOyzB,EAAM,GAAM,CACjBsd,OAAQ,SAAgBvvI,GACtB,OAAOA,EAAE9C,OAAO8C,EAAE6M,SAEpBzU,MAAO,MACPs7G,OAAQ,SAAgB1zG,GACtB,MAAyB,UAAlBoiB,EAAO+rC,OAAqB,CAACnuD,EAAE/H,QAAUk2D,EAAO,CAACnuD,EAAE/H,UAE5D,uDAAwD,SAA+C+H,GAErG,MAAyB,UAAlBoiB,EAAO+rC,OAAqB,GAAKA,EAASA,EAAO,KAAM,iBCzChE,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,SAAU,aACtCkhG,IAA6B,QAAQ,GAAM,IAAe7wD,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,UACNk3E,GACE7mC,EAiCJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,MAAyB,UAAlB7vG,EAAO+rC,OAAqBmhG,EAAO,IAAMA,EAAO,GAAI,YAI7D,iCAAkC,SAA+BziJ,GAG/D,GAAoB,iBAFTA,EAAKA,EAAK5U,OAAS,GAEA,CAC5B,IAAI4qI,EAASh2H,EAAKmmD,MAClB,OAAOs8F,EAAOziJ,EAAMg2H,GACf,MAAsB,UAAlBzgH,EAAO+rC,OACTmhG,EAAOziJ,GAEPyiJ,EAAOziJ,EAAM,YAGxBzU,MAAOk3J,EACP/f,OAAQ,SAAgB1iI,GACtB,IAAIg2H,EAASh2H,EAAKqmI,UAClB,OAAOoc,EAAOziJ,EAAKpS,UAAWooI,IAEhC,yBAA0B,SAA2Bh2H,EAAMg2H,GACzD,OAAOysB,EAAOziJ,EAAKpS,UAAWooI,MAWlC,SAASysB,EAAOziJ,EAAMg2H,GACpB,IAEIplB,EA0BN,SAAoB5wG,GAClB,IAAIoiJ,GAAgB,EAOpB,OANApiJ,EAAK0J,SAAQ,SAAUtd,EAAOsI,EAAOxJ,IAC/B,EAAAupH,EAAA,IAAYroH,KACdg2J,GAAgB,EAChBl3J,EAAIwJ,GAAStI,EAAM+gG,eAGhBi1D,EApCapS,CAAWhwI,GAEI,IAAIw4H,EAAU,GAAK,EAItD,GAkCF,SAAmBx4H,GACjBA,EAAK0J,SAAQ,SAAUtd,GACrB,GAAqB,iBAAVA,KAAuB,OAAUA,IAAUA,EAAQ,EAC5D,MAAM,IAAI0M,MAAM,6DAvCpBupJ,CAAUriJ,GAENg2H,EAAQ,CAEV,IAAIj5H,EAAIukD,EAAO00E,GAEf,OAAIh2H,EAAK5U,OAAS,EACT2R,EAAEgN,OAAO/J,EAAM4wG,GAGjB7zG,EAGP,IAAI7R,EAAM,GAEV,OAAI8U,EAAK5U,OAAS,GACT,SAAOF,EAAK8U,EAAM4wG,GAGpB1lH,MC/EFw3J,IAAY,QAxBZ,MACQ,CAAC,QAAS,WAuBuB/wD,IAClD,IAAI,MACFyzB,EAAK,OACL4Q,GACErkC,EACJ,OAAOyzB,EA7BE,MA6BU,CACjB,qBAAsB,SAAyBjzH,GAC7C,OAAO6jI,EAAO7jI,EAAG,CACf0hJ,SAAU,SAGd,6BAA8B,SAA+B1hJ,EAAG2hJ,GAC9D,OAAO9d,EAAO7jI,EAAG,CACf0hJ,SAAU,MACVC,SAAUA,UCvClB,SAAS6O,GAAQjzJ,EAAQkzJ,GAAkB,IAAIxvJ,EAAOtE,OAAOsE,KAAK1D,GAAS,GAAIZ,OAAOu9G,sBAAuB,CAAE,IAAIzkE,EAAU94C,OAAOu9G,sBAAsB38G,GAAakzJ,IAAgBh7G,EAAUA,EAAQ5yC,QAAO,SAAU6tJ,GAAO,OAAO/zJ,OAAOgB,yBAAyBJ,EAAQmzJ,GAAKl0J,eAAgByE,EAAKjF,KAAKrB,MAAMsG,EAAMw0C,GAAY,OAAOx0C,EAE9U,SAAS0vJ,GAAct0J,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAyB,MAAhB9Z,UAAUxB,GAAawB,UAAUxB,GAAK,GAAQA,EAAI,EAAKs3J,GAAQ7zJ,OAAO6X,IAAS,GAAM+C,SAAQ,SAAUzd,GAAOkD,GAAgBX,EAAQvC,EAAK0a,EAAO1a,OAAsB6C,OAAOi0J,0BAA6Bj0J,OAAO6C,iBAAiBnD,EAAQM,OAAOi0J,0BAA0Bp8I,IAAmBg8I,GAAQ7zJ,OAAO6X,IAAS+C,SAAQ,SAAUzd,GAAO6C,OAAOC,eAAeP,EAAQvC,EAAK6C,OAAOgB,yBAAyB6W,EAAQ1a,OAAe,OAAOuC,EAE7gB,SAASW,GAAgBC,EAAKnD,EAAKG,GAAiK,OAApJH,KAAOmD,EAAON,OAAOC,eAAeK,EAAKnD,EAAK,CAAEG,MAAOA,EAAOuC,YAAY,EAAMC,cAAc,EAAMC,UAAU,IAAkBO,EAAInD,GAAOG,EAAgBgD,EAS3M,IAAI4zJ,GAAS,0DACT,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,YAAa,eACjEC,IAA6B,QAAQ,GAAM,IAAetxD,IACnE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,MACX5N,EAAK,UACL+D,EAAS,YACTmK,GACEhxC,EACA4uD,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEme,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE8c,EAAcN,GAAkB,CAClC/5B,UAsCF,OAAOA,EAAM,GAAM09B,GAAcA,GAAc,GAAII,IAAwB,GAAI,CAC7E74E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEwC,SAEX,kBAAmB,SAAuBxC,EAAGhB,GAC3C,GAAIA,EAAI,EACN,MAAM,IAAI/E,UAAU41J,IAGtB,OAAO7vJ,EAAEwC,MAAMxD,IAEjB,qBAAsB,SAA0BgB,EAAGhB,GACjD,IAAKA,EAAE8zD,YACL,MAAM,IAAI74D,UAAU41J,IAGtB,IAAIjyJ,EAAKoB,EAAEg7F,WAEX,OAAOh6F,EAAEwC,MAAM5E,IAEjB,oBAAqB,SAAyBoC,EAAGhB,GAC/C,IAAKA,EAAE8zD,YACL,MAAM,IAAI74D,UAAU41J,IAGtB,OAAO,IAAIxqB,EAAUrlI,GAAGq5F,gBAAgBr6F,EAAEg7F,aAE5CqrC,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEq5F,gBAAgB,IAE3B,uBAAwB,SAA4Br5F,EAAGhB,GACrD,IAAKA,EAAE8zD,YACL,MAAM,IAAI74D,UAAU41J,IAGtB,OAAO7vJ,EAAEq5F,gBAAgBr6F,EAAEg7F,aAE7BsF,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEwC,SAEX,mBAAoB,SAAwBxC,EAAGhB,GAC7C,GAAIA,EAAI,EACN,MAAM,IAAI/E,UAAU41J,IAGtB,OAAO7vJ,EAAEwC,MAAMxD,IAEjB,iBAAkB,SAAqBgB,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1B,mCAAoC,SAAqCwG,EAAGe,GAC1E,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,6CAA8C,SAA4CwG,EAAGe,GAE3F,OAAImuI,EAAYlvI,EAAG,GAEVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBma,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,4CAA6C,SAA2CwG,EAAGe,GAEzF,OAAImuI,EAAYlvI,EAAG,GAEVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBoZ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAE5D,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,sCAAuC,SAAqCuF,EAAGe,GAE7E,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,iBAI/Cs1J,GAAwB,CAC1B5tJ,OAAQk6I,GACR,iBAAkB,SAAsBr8I,EAAGhB,GACzC,KAAK,OAAUA,GACb,MAAM,IAAI/E,UAAU41J,IAGtB,GAAI7wJ,EAAI,GAAKA,EAAI,GACf,MAAM,IAAI2G,MAAM,oEAGlB,OAAO02I,GAAYr8I,EAAGhB,KCrKtB,GAAe,CAAC,QAAS,eAClBgxJ,IAAmC,QAFnC,cAEiD,IAAexxD,IACzE,IAAI,MACFyzB,EAAK,YACLid,GACE1wC,EAoBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,GAEhC,IAAImuH,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACTyD,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAERuT,EAAUppJ,EAAEulJ,QACZ8D,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KACT8D,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAEZ,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKO,IAAYV,EACf,MAAM,IAAI3kJ,MAAM,uDAIlB,IAGIsiB,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBn1D,EAAKi6C,EAEL6X,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELp1D,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAcjC,IAVA,IAQI/nB,EAAGgpF,EAAIK,EAAIrxF,EARXizJ,EAAU,GACV7lF,EAAS,GACT8lF,EAAO,GAEPprJ,EAAI,GAEJkqD,EAAI,GAIClpD,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhCoqJ,EAAKpqJ,GAAKskE,EAAOrtE,OAEjB,IAAI6yJ,EAAO9pJ,EAAI,EAEf,IAAKkoF,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAInDgqD,EAFAhyD,EAAI+yJ,EAAO/qJ,IAEJ4qJ,EAEP9qJ,EAAE9H,GAAK8yJ,EAAQ9qJ,GAEfolE,EAAOtqE,KAAK9C,GAId,IAAKgxF,EAAKshE,EAAKxpJ,GAAIuoF,EAAKihE,EAAKxpJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAI/CgqD,EAFJhyD,EAAIqyJ,EAAOrqJ,MAEE4qJ,IAEX9qJ,EAAE9H,GAAK0yJ,EAAG5qJ,EAAE9H,GAAIoyJ,EAAQpqJ,KAO5B,IAFAA,EAAIkrJ,EAAKpqJ,GAEFd,EAAIolE,EAAOrtE,QAAQ,CAIxB,IAAIkI,EAAIH,EAFR9H,EAAIotE,EAAOplE,IAIN+0F,EAAG90F,EAAG4mJ,GAOTzhF,EAAOw1C,OAAO56G,EAAG,IALjBirJ,EAAQnwJ,KAAKmF,GAEbD,MAWN,OAFAkrJ,EAAK3nH,GAAW6hC,EAAOrtE,OAEhB8C,EAAE+sJ,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QCzIZ,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,eACpDgoI,IAAiC,QAAQ,GAAM,IAAezxD,IACvE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,MACX5N,EAAK,YACLkO,GACEhxC,EACA0tD,EAAclC,GAAkB,CAClC/3B,UAEEg7B,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEghB,EAAcF,GAAkB,CAClC/9B,QACAid,gBAEEkd,EAAcZ,GAAkB,CAClCv5B,QACAud,gBAEE4d,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkB4sB,GAClB,uBAAwBN,GACxB,6BAA8B,SAAkCv+I,EAAGe,GACjE,OAAOmvJ,EAAYlwJ,EAAGe,EAAGvH,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmrJ,EAAYlsJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mCAAoC,SAAqCf,EAAGe,GAE1E,OAAImuI,EAAYnuI,EAAG,GACVf,EAAEy9F,QAGJ2vD,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GAExE,OAAImuI,EAAYnuI,EAAG,GACVf,EAAEy9F,QAGJ6uD,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,mCAAoC,SAAqCwG,EAAGe,GAE1E,OAAImuI,EAAYlvI,EAAG,GACVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBkZ,EAAYrrJ,EAAGf,EAAGxG,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GAExE,OAAImuI,EAAYlvI,EAAG,GACVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBoZ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAE5D,OAAOvH,KAAK20D,EAAOnuD,GAAIe,GAAGtG,WAE5B,4BAA6B,SAA8BuF,EAAGe,GAE5D,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,IAAItG,gBC7H5B,GAAO,gBACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,eACpD01J,IAAqC,QAAQ,GAAM,IAAe3xD,IAC3E,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,MACX5N,EAAK,YACLkO,GACEhxC,EACA0tD,EAAclC,GAAkB,CAClC/3B,UAEEg7B,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEghB,EAAcF,GAAkB,CAClC/9B,QACAid,gBAEEkd,EAAcZ,GAAkB,CAClCv5B,QACAud,gBAEE4d,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkB8sB,GAElB,6BAA8B,SAAkC/+I,EAAGe,GACjE,OAAOmvJ,EAAYlwJ,EAAGe,EAAGvH,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmrJ,EAAYlsJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mCAAoC,SAAqCf,EAAGe,GAE1E,OAAImuI,EAAYnuI,EAAG,GACVf,EAAEy9F,QAGJ2vD,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GAExE,OAAImuI,EAAYnuI,EAAG,GACVf,EAAEy9F,QAGJ6uD,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,mCAAoC,SAAqCwG,EAAGe,GAE1E,OAAImuI,EAAYlvI,EAAG,GACVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBkZ,EAAYrrJ,EAAGf,EAAGxG,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GAExE,OAAImuI,EAAYlvI,EAAG,GACVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBoZ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAE5D,OAAOvH,KAAK20D,EAAOnuD,GAAIe,GAAGtG,WAE5B,4BAA6B,SAA8BuF,EAAGe,GAE5D,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,IAAItG,gBC7H5B,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,SAAU,cAAe,YAAa,WAAY,eAC9E21J,IAA+B,QAAQ,GAAM,IAAe5xD,IACrE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,YACN8sH,EAAW,OACX/gF,EAAM,UACNk3E,EAAS,SACT/lC,EAAQ,YACRkwC,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk7B,EAAcT,GAAkB,CAClCz6B,QACAid,gBAEEme,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAwCF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwBjyH,EAAGe,GAC7C,OAAOf,IAAMe,EAAI,EAAIf,EAAIe,EAAI,GAAK,GAEpC,iBAAkB,SAAsBf,EAAGe,GACzC,OAAO,QAAYf,EAAGe,EAAGqhB,EAAOg+F,SAAW,EAAIpgH,EAAIe,EAAI,GAAK,GAE9D,uBAAwB,SAA4Bf,EAAGe,GACrD,OAAO,GAAef,EAAGe,EAAGqhB,EAAOg+F,SAAW,IAAIilB,EAAU,GAAK,IAAIA,EAAUrlI,EAAE2zF,IAAI5yF,KAEvF,qBAAsB,SAA0Bf,EAAGe,GACjD,OAAO,IAAIu+F,EAASt/F,EAAE46F,QAAQ75F,KAEhC,mBAAoB,WAClB,MAAM,IAAI9G,UAAU,wDAEtB,aAAc,SAAkB+F,EAAGe,GACjC,IAAKf,EAAEg6I,UAAUj5I,GACf,MAAM,IAAI4E,MAAM,4CAGlB,OAAOnM,KAAKwG,EAAE/G,MAAO8H,EAAE9H,QAEzB,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOosJ,EAAYntJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCxI/C,GAAO,cACP,GAAe,CAAC,QAAS,UAClB41J,IAAmC,QAAQ,GAAM,IAAe7xD,IACzE,IAAI,MACFyzB,EAAK,OACL9jE,GACEqwC,EACA6tD,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA+BF,OAAOA,EAAM,GAAM,CACjB,WAAY,MACZ,2BAA4B,SAAgCjyH,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAG,QAE3B,eAAgB,SAAoBf,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mBAAoB,SAAwBf,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAG,OAAc,IAEzC,mBAAoB,SAAwBf,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAG,OAAc,IAEzC,aAAc,SAAkBA,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAG,OAAc,GAAOtG,WAExD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAG,OAAc,GAAMvF,gBCnEvD,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtC61J,IAA+B,QAAQ,GAAM,IAAe9xD,IACrE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,YACNqhF,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAkCF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwBjyH,EAAGe,GAC7C,OAAOf,EAAIe,GAEb,iBAAkB,SAAsBf,EAAGe,GACzC,OAAOf,EAAIe,KAAM,QAAYf,EAAGe,EAAGqhB,EAAOg+F,UAE5C,uBAAwB,SAA4BpgH,EAAGe,GACrD,OAAOf,EAAE23F,GAAG52F,KAAO,GAAef,EAAGe,EAAGqhB,EAAOg+F,UAEjD,qBAAsB,SAA0BpgH,EAAGe,GACjD,OAAyB,IAAlBf,EAAE46F,QAAQ75F,IAEnB,mBAAoB,SAAwBf,EAAGe,GAC7C,MAAM,IAAI9G,UAAU,wDAEtB,aAAc,SAAkB+F,EAAGe,GACjC,IAAKf,EAAEg6I,UAAUj5I,GACf,MAAM,IAAI4E,MAAM,4CAGlB,OAAOnM,KAAKwG,EAAE/G,MAAO8H,EAAE9H,QAEzB,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBC3H/C,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtC81J,IAA8B,QAAQ,GAAM,IAAe/xD,IACpE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,YACNqhF,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAkCF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwBjyH,EAAGe,GAC7C,OAAOf,EAAIe,GAEb,iBAAkB,SAAsBf,EAAGe,GACzC,OAAOf,EAAIe,KAAM,QAAYf,EAAGe,EAAGqhB,EAAOg+F,UAE5C,uBAAwB,SAA4BpgH,EAAGe,GACrD,OAAOf,EAAE01F,GAAG30F,KAAO,GAAef,EAAGe,EAAGqhB,EAAOg+F,UAEjD,qBAAsB,SAA0BpgH,EAAGe,GACjD,OAAwB,IAAjBf,EAAE46F,QAAQ75F,IAEnB,mBAAoB,WAClB,MAAM,IAAI9G,UAAU,wDAEtB,aAAc,SAAkB+F,EAAGe,GACjC,IAAKf,EAAEg6I,UAAUj5I,GACf,MAAM,IAAI4E,MAAM,4CAGlB,OAAOnM,KAAKwG,EAAE/G,MAAO8H,EAAE9H,QAEzB,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBC7H/C,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,cAAe,SAAU,eACrD+1J,IAA+B,QAAQ,GAAM,IAAehyD,IACrE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,YACN8sH,EAAW,OACX/gF,EAAM,YACNqhF,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA8CF,OAAOA,EAAM,UAAW,CACtB,WAAY,SAAgBjyH,EAAGe,GAE7B,OAAU,OAANf,EACW,OAANe,EAGC,OAANA,EACW,OAANf,OAGCnG,IAANmG,OACWnG,IAANkH,OAGClH,IAANkH,OACWlH,IAANmG,EAGFywJ,EAASzwJ,EAAGe,IAErB,6BAA8B,SAAkCf,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAG0vJ,IAE3B,4BAA6B,SAAiCzwJ,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGywJ,GAAU,IAErC,4BAA6B,SAAiCzwJ,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAG0vJ,GAAU,IAErC,2BAA4B,SAAgCzwJ,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAG0vJ,IAE3B,eAAgB,SAAoBzwJ,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAG0vJ,GAAU,IAErC,mBAAoB,SAAwBzwJ,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAG0vJ,GAAU,IAErC,oBAAqB,SAAyBzwJ,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGywJ,GAAU,IAErC,mBAAoB,SAAwBzwJ,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGywJ,GAAU,IAErC,aAAc,SAAkBzwJ,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAG0vJ,GAAU,GAAOh2J,WAEpD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGywJ,GAAU,GAAMh2J,aAIrD,SAASg2J,EAASzwJ,EAAGe,GACnB,OAAQmuI,EAAYlvI,EAAGe,OC7IvB,KDgJ6B,QAAQ,GAAM,CAAC,QAAS,gBAAiBqwI,IACxE,IAAI,MACFnf,EAAK,YACLid,GACEkC,EACJ,OAAOnf,EAAM,GAAM,CACjB,WAAY,SAAgBjyH,EAAGe,GAE7B,OAAU,OAANf,EACW,OAANe,EAGC,OAANA,EACW,OAANf,OAGCnG,IAANmG,OACWnG,IAANkH,OAGClH,IAANkH,OACWlH,IAANmG,GAGDkvI,EAAYlvI,EAAGe,SCxKV,CAAC,UAAW,gBACpB2vJ,IAAiD,QAFjD,uBAE+D,IAAelyD,IACvF,IAAI,QACFmpB,EAAO,YACP6nB,GACEhxC,EAEJ,SAASkxC,EAAqBr+H,EAAMG,GAClC,KAAMhY,gBAAgBk2I,GACpB,MAAM,IAAI54D,YAAY,oDAGxB,GAAItlE,KAAa,EAAA8vG,EAAA,IAAS9vG,GACxB,MAAM,IAAI7L,MAAM,qBAAuB6L,GAGzC,IAAI,EAAA8vG,EAAA,IAASjwG,KAAS,EAAAiwG,EAAA,IAAQjwG,GAAO,CAEnC,IAAI88C,EAAS,IAAIqhF,EAAYn+H,EAAMG,GAEnChY,KAAKymB,MAAQkuC,EAAOluC,MACpBzmB,KAAKs9I,MAAQ3oF,EAAO2oF,MACpBt9I,KAAKu9I,UAAY5oF,EAAO4oF,UACxBv9I,KAAKm3J,KAAO,KACZn3J,KAAKo3J,KAAO,UACP,GAAIv/I,IAAQ,EAAAiwG,EAAA,IAAQjwG,EAAKA,QAAS,EAAAiwG,EAAA,IAAQjwG,EAAKxE,MAEpDrT,KAAKymB,MAAQ5O,EAAKA,KAClB7X,KAAKs9I,MAAQzlI,EAAKxE,KAClBrT,KAAKu9I,UAAY1lI,EAAKG,SACtBhY,KAAKm3J,UAA2B,IAAbt/I,EAAK2a,IAAsB3a,EAAK2a,IAAM,KACzDxyB,KAAKo3J,UAA2B,IAAbv/I,EAAKpI,IAAsBoI,EAAKpI,IAAM,SACpD,IAAIoI,EAET,MAAM,IAAIpX,UAAU,8BAA+B,QAAOoX,GAAQ,KAGlE7X,KAAKymB,MAAQ,GACbzmB,KAAKs9I,MAAQ,CAAC,GACdt9I,KAAKu9I,UAAYvlI,EACjBhY,KAAKm3J,KAAO,KACZn3J,KAAKo3J,KAAO,MA+LhB,OA3LAlhB,EAAqBl1I,UAAY,IAAIg1I,EAKrCE,EAAqBl1I,UAAU8W,KAAO,uBACtCo+H,EAAqBl1I,UAAUq2J,wBAAyB,EAexDnhB,EAAqBl1I,UAAUqtE,OAAS,SAAUtmE,GAChD,OAAQ7H,UAAUzB,QAChB,KAAK,EAGD,IAAI2R,EAAI4lI,EAAYh1I,UAAUqtE,OAAOntE,KAAKlB,KAAM+H,GAEhD,OAAI,EAAA+/G,EAAA,IAAS13G,GAEJ,IAAI8lI,EAAqB,CAC9Br+H,KAAMzH,EAAEqW,MACRpT,KAAMjD,EAAEktI,MACRtlI,SAAU5H,EAAEmtI,YAITntI,EAIX,KAAK,EACL,KAAK,EACH,MAAM,IAAIjE,MAAM,4DAElB,QACE,MAAM,IAAImxE,YAAY,+BAc5B44D,EAAqBl1I,UAAUwoE,IAAM,WACnC,MAAM,IAAIr9D,MAAM,sDAgBlB+pI,EAAqBl1I,UAAUoc,OAAS,WACtC,MAAM,IAAIjR,MAAM,yDASlB+pI,EAAqBl1I,UAAU2mI,QAAU,WACvC,MAAM,IAAIx7H,MAAM,0DAQlB+pI,EAAqBl1I,UAAUijG,MAAQ,WACrC,OAAO,IAAIiyC,EAAqB,CAC9Br+H,MAAM,SAAM7X,KAAKymB,OACjBpT,MAAM,SAAMrT,KAAKs9I,OACjBtlI,SAAUhY,KAAKu9I,aASnBrH,EAAqBl1I,UAAUkgG,OAAS,WACtC,MAAO,CACLgoB,OAAQ,uBACRrxG,KAAM7X,KAAKymB,MACXpT,KAAMrT,KAAKs9I,MACXtlI,SAAUhY,KAAKu9I,YAYnBrH,EAAqB/sB,SAAW,SAAUhiB,GACxC,OAAO,IAAI+uC,EAAqB/uC,IAYlC+uC,EAAqBl1I,UAAUo+I,SAAW,WACxC,MAAM,IAAIjzI,MAAM,2DAQlB+pI,EAAqBl1I,UAAUwxB,IAAM,WAEnC,GAAkB,OAAdxyB,KAAKm3J,KAAe,CAEtB,IAAI/mJ,EAAI,KAERpQ,KAAK+c,SAAQ,SAAUpW,IACX,OAANyJ,GAAc+9G,EAAQxnH,EAAGyJ,MAC3BA,EAAIzJ,MAGR3G,KAAKm3J,KAAa,OAAN/mJ,EAAaA,OAAI/P,EAG/B,OAAOL,KAAKm3J,MAQdjhB,EAAqBl1I,UAAUyO,IAAM,WAEnC,GAAkB,OAAdzP,KAAKo3J,KAAe,CAEtB,IAAIhnJ,EAAI,KAERpQ,KAAK+c,SAAQ,SAAUpW,IACX,OAANyJ,GAAc+9G,EAAQ/9G,EAAGzJ,MAC3ByJ,EAAIzJ,MAGR3G,KAAKo3J,KAAa,OAANhnJ,EAAaA,OAAI/P,EAG/B,OAAOL,KAAKo3J,MAGPlhB,IACN,CACDvtB,SAAS,IC5OP,GAAe,CAAC,UAAW,UACpB2uC,IAA0C,QAF1C,gBAEwD,IAAetyD,IAChF,IAAI,QACFmpB,EAAO,OACPC,GACEppB,EACAuyD,EAAgB,EAAMvxJ,KAAKiF,KAAK,EAAMjF,KAAKC,KAAK,IAAQ,GAO5D,SAASkwI,IACP,KAAMn2I,gBAAgBm2I,GACpB,MAAM,IAAI74D,YAAY,oDAIxBt9E,KAAKw3J,SAAW,KAChBx3J,KAAKs9I,MAAQ,EA8Lf,SAASma,EAAKnC,EAASjoI,EAAMlY,GAE3BkY,EAAKhX,KAAKC,MAAQ+W,EAAK/W,MACvB+W,EAAK/W,MAAMD,KAAOgX,EAAKhX,KACvBlB,EAAOuiJ,SAEHviJ,EAAOg0E,QAAU97D,IACnBlY,EAAOg0E,MAAQ97D,EAAK/W,OAIA,IAAlBnB,EAAOuiJ,SACTviJ,EAAOg0E,MAAQ,MAIjB97D,EAAKhX,KAAOi/I,EACZjoI,EAAK/W,MAAQg/I,EAAQh/I,MACrBg/I,EAAQh/I,MAAQ+W,EAChBA,EAAK/W,MAAMD,KAAOgX,EAElBA,EAAKlY,OAAS,KAEdkY,EAAKikI,MAAO,EAUd,SAASqG,EAAcrC,EAASjoI,GAE9B,IAAIlY,EAASkY,EAAKlY,OAEbA,IAKAkY,EAAKikI,MAIRmG,EAAKnC,EAASjoI,EAAMlY,GAGpBwiJ,EAAcxiJ,IANdkY,EAAKikI,MAAO,GAlOhBnb,EAAcn1I,UAAU8W,KAAO,gBAC/Bq+H,EAAcn1I,UAAU42J,iBAAkB,EAQ1CzhB,EAAcn1I,UAAUqxC,OAAS,SAAU/yC,EAAKG,GAE9C,IAAI4tB,EAAO,CACT/tB,IAAKA,EACLG,MAAOA,EACPi4J,OAAQ,GAGV,GAAI13J,KAAKw3J,SAAU,CAEjB,IAAIlC,EAAUt1J,KAAKw3J,SAEnBnqI,EAAKhX,KAAOi/I,EACZjoI,EAAK/W,MAAQg/I,EAAQh/I,MACrBg/I,EAAQh/I,MAAQ+W,EAChBA,EAAK/W,MAAMD,KAAOgX,EAEd8gG,EAAQ7uH,EAAKg2J,EAAQh2J,OAEvBU,KAAKw3J,SAAWnqI,QAIlBA,EAAKhX,KAAOgX,EACZA,EAAK/W,MAAQ+W,EAEbrtB,KAAKw3J,SAAWnqI,EAMlB,OAFArtB,KAAKs9I,QAEEjwH,GAQT8oH,EAAcn1I,UAAUqS,KAAO,WAC7B,OAAOrT,KAAKs9I,OAQdnH,EAAcn1I,UAAUw9B,MAAQ,WAC9Bx+B,KAAKw3J,SAAW,KAChBx3J,KAAKs9I,MAAQ,GAQfnH,EAAcn1I,UAAU8qG,QAAU,WAChC,OAAsB,IAAf9rG,KAAKs9I,OASdnH,EAAcn1I,UAAU62J,eAAiB,WAEvC,IAAIxqI,EAAOrtB,KAAKw3J,SAEhB,GAAa,OAATnqI,EACF,OAAOA,EAUT,IANA,IAAIioI,EAAUt1J,KAAKw3J,SAEfM,EAAmBzqI,EAAKqqI,OAExBlxJ,EAAI6mB,EAAK87D,MAEN2uE,EAAmB,GAAG,CAE3B,IAAIC,EAAYvxJ,EAAE8P,MAElB9P,EAAE6P,KAAKC,MAAQ9P,EAAE8P,MACjB9P,EAAE8P,MAAMD,KAAO7P,EAAE6P,KAEjB7P,EAAE6P,KAAOi/I,EACT9uJ,EAAE8P,MAAQg/I,EAAQh/I,MAClBg/I,EAAQh/I,MAAQ9P,EAChBA,EAAE8P,MAAMD,KAAO7P,EAEfA,EAAE2O,OAAS,KACX3O,EAAIuxJ,EACJD,IAsBF,OAlBAzqI,EAAKhX,KAAKC,MAAQ+W,EAAK/W,MACvB+W,EAAK/W,MAAMD,KAAOgX,EAAKhX,KAIrBi/I,EAFEjoI,IAASA,EAAK/W,MAEN,KAqJd,SAA0Bg/I,EAASjiJ,GAEjC,IAkBI9L,EAlBAywJ,EAAYhyJ,KAAKiC,MAAMjC,KAAKiF,IAAIoI,GAAQkkJ,GAAiB,EAEzDxxJ,EAAQ,IAAInH,MAAMo5J,GAElBC,EAAW,EACXzxJ,EAAI8uJ,EAER,GAAI9uJ,EAIF,IAHAyxJ,IACAzxJ,EAAIA,EAAE8P,MAEC9P,IAAM8uJ,GACX2C,IACAzxJ,EAAIA,EAAE8P,MAOV,KAAO2hJ,EAAW,GAAG,CAMnB,IAJA,IAAIvoJ,EAAIlJ,EAAEkxJ,OAENjzJ,EAAO+B,EAAE8P,MAIX/O,EAAIxB,EAAM2J,IAFC,CASX,GAAI0+G,EAAO5nH,EAAElH,IAAKiI,EAAEjI,KAAM,CACxB,IAAI4K,EAAO3C,EACXA,EAAIf,EACJA,EAAI0D,EAINguJ,EAAW3wJ,EAAGf,GAGdT,EAAM2J,GAAK,KACXA,IAIF3J,EAAM2J,GAAKlJ,EAEXA,EAAI/B,EACJwzJ,IAIF3C,EAAU,KAEV,IAAK,IAAI52J,EAAI,EAAGA,EAAIs5J,EAAWt5J,KAE7B6I,EAAIxB,EAAMrH,MAON42J,GAEF/tJ,EAAE8O,KAAKC,MAAQ/O,EAAE+O,MACjB/O,EAAE+O,MAAMD,KAAO9O,EAAE8O,KAEjB9O,EAAE8O,KAAOi/I,EACT/tJ,EAAE+O,MAAQg/I,EAAQh/I,MAClBg/I,EAAQh/I,MAAQ/O,EAChBA,EAAE+O,MAAMD,KAAO9O,EAEX4mH,EAAQ5mH,EAAEjI,IAAKg2J,EAAQh2J,OACzBg2J,EAAU/tJ,IAGZ+tJ,EAAU/tJ,GAId,OAAO+tJ,EAxOK6C,CAFV7C,EAAUjoI,EAAK/W,MAEqBtW,KAAKs9I,OAI3Ct9I,KAAKs9I,QAELt9I,KAAKw3J,SAAWlC,EAETjoI,GAWT8oH,EAAcn1I,UAAU0rB,OAAS,SAAUW,GAEzCrtB,KAAKw3J,SAYP,SAAsBlC,EAASjoI,EAAM/tB,GAEnC+tB,EAAK/tB,KAd8C,EAgBnD,IAAI6V,EAASkY,EAAKlY,OAgBlB,OAdIA,GAAUg5G,EAAQ9gG,EAAK/tB,IAAK6V,EAAO7V,OAErCm4J,EAAKnC,EAASjoI,EAAMlY,GAGpBwiJ,EAAcrC,EAASngJ,IAIrBg5G,EAAQ9gG,EAAK/tB,IAAKg2J,EAAQh2J,OAC5Bg2J,EAAUjoI,GAILioI,EAhCS8C,CAAap4J,KAAKw3J,SAAUnqI,GAE5CrtB,KAAK63J,kBAiGP,IAAIK,EAAa,SAAoB7qI,EAAMlY,GAEzCkY,EAAKhX,KAAKC,MAAQ+W,EAAK/W,MACvB+W,EAAK/W,MAAMD,KAAOgX,EAAKhX,KAEvBgX,EAAKlY,OAASA,EAETA,EAAOg0E,OAKV97D,EAAKhX,KAAOlB,EAAOg0E,MACnB97D,EAAK/W,MAAQnB,EAAOg0E,MAAM7yE,MAC1BnB,EAAOg0E,MAAM7yE,MAAQ+W,EACrBA,EAAK/W,MAAMD,KAAOgX,IAPlBlY,EAAOg0E,MAAQ97D,EACfA,EAAK/W,MAAQ+W,EACbA,EAAKhX,KAAOgX,GASdlY,EAAOuiJ,SAEPrqI,EAAKikI,MAAO,GA8Fd,OAAOnb,IACN,CACDxtB,SAAS,IClYP,GAAO,SACP,GAAe,CAAC,QAAS,gBAClB0vC,IAA8B,QAAQ,GAAM,IAAerzD,IACpE,IAAI,MACFyzB,EAAK,aACLwd,GACEjxC,EA6BJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,OAAO,IAAIwd,EAAa,KAE1B/7B,OAAQ,SAAgBliG,GACtB,OAAO,IAAIi+H,EAAa,GAAIj+H,IAE9B,iBAAkB,SAAqBH,GACrC,OAAO,IAAIo+H,EAAap+H,IAE1B,yBAA0B,SAA2BA,EAAMG,GACzD,OAAO,IAAIi+H,EAAap+H,EAAMG,SC5ChC,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvCsgJ,IAA6B,QAAQ,GAAM,IAAetzD,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,EACAmuD,UAAW0X,GACTv+C,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,GAAK,GAAKA,IAAM,GAAKoiB,EAAOi+F,YACvB8gC,GAAYnhJ,GAGd,IAAIk3E,EAAQl3E,EAAG,GAAG2pH,SAE3BzyC,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE2pH,SAEX0b,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,GAAGo4E,SAElC,iBAAkB,SAAqBp4E,GACrC,OAAO,SAAQA,EAAGxG,YC9CpB,GAAe,CAAC,QAAS,eAClBu4J,IAAmC,QAFnC,cAEiD,IAAevzD,IACzE,IAAI,MACFyzB,EAAK,YACLid,GACE1wC,EAoBJ,OAAO,SAAqBzjG,EAAGmG,EAAG27B,GAEhC,IAAImuH,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACTyD,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAERuT,EAAUppJ,EAAEulJ,QACZ8D,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KACT8D,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAEZ,GAAIqT,EAAMnyJ,SAAWwyJ,EAAMxyJ,OACzB,MAAM,IAAIi/I,GAAA,EAAekT,EAAMnyJ,OAAQwyJ,EAAMxyJ,QAI/C,GAAImyJ,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIxiI,EAHAjP,EAAOoxI,EAAM,GACb3mH,EAAU2mH,EAAM,GAIhBn1D,EAAKi6C,EAEL6X,EAAO,EAEP6D,EAAK/tH,EAEU,iBAARwtH,GAAoBA,IAAQK,IAErCziI,EAAKoiI,EAELp1D,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,GAExB2iI,EAAK34B,EAAM72E,KAAKve,EAAU,CAAC5U,EAAIA,KAIjC,IAQI/vB,EAAG8I,EAAGd,EAAGgpF,EAAIK,EARb4hE,EAAUH,GAAWV,EAAU,QAAKzwJ,EACpCyrE,EAAS,GACT8lF,EAAO,GAEPprJ,EAAImrJ,EAAU,QAAKtxJ,EAEnBqwD,EAAI,GAIR,IAAKlpD,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAE5BoqJ,EAAKpqJ,GAAKskE,EAAOrtE,OAEjB,IAAI6yJ,EAAO9pJ,EAAI,EAEf,GAAIhB,EAEF,IAAKkpF,EAAKshE,EAAKxpJ,GAAIuoF,EAAKihE,EAAKxpJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAInDgqD,EAFAhyD,EAAIqyJ,EAAOrqJ,IAEJ4qJ,EACP9qJ,EAAE9H,GAAKoyJ,EAAQpqJ,GAKnB,IAAKgpF,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAInD,GAFAhI,EAAI+yJ,EAAO/qJ,GAEPF,EAAG,CAEL,IAAIiuJ,EAAK/jG,EAAEhyD,KAAO4yJ,EAAO9qJ,EAAE9H,GAAK6uJ,EAE5B8F,EAAKjC,EAAGI,EAAQ9qJ,GAAI+tJ,GAEnBh5D,EAAG43D,EAAI9F,KAEVzhF,EAAOtqE,KAAK9C,GAEZizJ,EAAQnwJ,KAAK6xJ,SAIfvnF,EAAOtqE,KAAK9C,GAQlB,OAFAkzJ,EAAK3nH,GAAW6hC,EAAOrtE,OAEhB8C,EAAE+sJ,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACmM,EAAMyqB,GACbjyB,SAAUyW,QC9HZ,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,eACxD+pI,IAA6B,QAAQ,GAAM,IAAexzD,IACnE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,UACX7J,EAAS,YACTmK,GACEhxC,EACAyuD,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEge,EAAcT,GAAkB,CAClCx6B,UAEEggC,EAAcF,GAAkB,CAClC9/B,QACAid,gBAEEke,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEme,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAgCF,OAAOA,EAAM,GAAM,CACjB,iBAAkBzyH,KAAKu/C,MAIvB,uBAAwB,SAA4Bh+C,EAAGf,GACrD,OAAOqlI,EAAUtmF,MAAMh+C,EAAGf,IAE5B,6BAA8B,SAAkCA,EAAGe,GACjE,OAAOkxJ,EAAYjyJ,EAAGe,EAAGvH,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAE/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GACrC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GACvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GACvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mCAAoC,SAAqCf,EAAGe,GAC1E,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,mCAAoC,SAAqCwG,EAAGe,GAE1E,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GAExE,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAC5D,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,4BAA6B,SAA8BuF,EAAGe,GAC5D,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCrH/C,GAAe,CAAC,QAAS,aAClBy3J,IAA2B,QAF3B,MAEyC,IAAe1zD,IACjE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAuBJ,OAAOyzB,EA7BE,MA6BU,CACjB9vH,OAAQ4/I,GACR7qE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEoqH,OAEXib,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,EAAEmO,QAEjC6mH,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,oCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YCxCpB,GAAe,CAAC,QAAS,SAAU,YAAa,cAAe,cAAe,gBACvE24J,IAA2B,QAF3B,MAEyC,IAAe3zD,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,UACNkhF,EAAS,YACTH,EAAW,YACXM,EAAW,aACXC,GACEjxC,EACA0tD,EAAclC,GAAkB,CAClC/3B,UAEEk6B,EAAcpB,GAAkB,CAClC94B,QACAid,gBAEEkd,EAAcZ,GAAkB,CAClCv5B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAqCF,OAAOA,EA/DE,OA+DU,SAAO,CAExB,2BAA4B,SAAgCjyH,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGsuI,IAE3B,4BAA6B,SAAiCrvI,EAAGe,GAC/D,OAAOmrJ,EAAYlsJ,EAAGe,EAAGsuI,GAAW,IAEtC,4BAA6B,SAAiCrvI,EAAGe,GAC/D,OAAOmrJ,EAAYnrJ,EAAGf,EAAGqvI,GAAW,IAEtC,6BAA8B,SAAkCrvI,EAAGe,GACjE,OAAOorJ,EAAYnsJ,EAAGe,EAAGsuI,IAE3B,eAAgB,SAAoBrvI,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mBAAoB,SAAwBf,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGsuI,GAAW,IAEtC,oBAAqB,SAAyBrvI,EAAGe,GAC/C,OAAOqrJ,EAAYpsJ,EAAGe,EAAGsuI,GAAW,IAEtC,mBAAoB,SAAwBrvI,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGqvI,GAAW,IAEtC,oBAAqB,SAAyBrvI,EAAGe,GAC/C,OAAOqrJ,EAAYrrJ,EAAGf,EAAGqvI,GAAW,IAEtC,aAAc,SAAkBrvI,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGsuI,GAAW,GAAO50I,WAErD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGqvI,GAAW,GAAM50I,WAEpD,WAAY40I,EACZ,mBAAoB,SAAmBrvI,EAAGe,EAAGqxJ,GAG3C,IAFA,IAAIptI,EAASxrB,KAAKwG,EAAGe,GAEZ7I,EAAI,EAAGA,EAAIk6J,EAAKn6J,OAAQC,IAC/B8sB,EAASxrB,KAAKwrB,EAAQotI,EAAKl6J,IAG7B,OAAO8sB,IAERqqH,EAAU5c,gBC3HX,GAAe,CAAC,QAAS,YAAa,iBAAkB,OAAQ,QACzD4/B,IAA2B,QAF3B,MAEyC,IAAe7zD,IACjE,IAAI,MACFyzB,EAAK,UACLod,EAAS,eACTF,EAAc,KACdnmB,EAAI,KACJn8G,GACE2xF,EAyBJ,OAAOyzB,EAlCE,MAkCU,CACjB,2CAgCF,SAAmBl3H,EAAGmG,GACpB,IAAI4+F,EAAIwyD,EAAav3J,EAAGmG,GAEpBipJ,GAAQ,EAAA7oC,EAAA,IAASvmH,GAAKA,EAAEklB,MAAQllB,EAChCsvJ,GAAM,EAAA/oC,EAAA,IAASvmH,GAAKA,EAAEg8I,eAAYl9I,EAClC6xJ,GAAQ,EAAApqC,EAAA,IAASpgH,GAAKA,EAAE+e,MAAQ/e,EAChCwpJ,GAAM,EAAAppC,EAAA,IAASpgH,GAAKA,EAAE61I,eAAYl9I,EAElC04J,EAAgC,IAApBzb,EAAM/7I,GAAG9C,OACrBu6J,EAAgC,IAApB1b,EAAM51I,GAAGjJ,OACrB8N,EAAMspI,EACNp2C,EAAMk2C,EAEV,GAAIkb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,EAAkB,CACxD,IAAIpiI,EAAKoiI,EAETtkJ,EAAMksH,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IACjCgxE,EAAMg5B,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,IAIxC,IAAKsqI,IAAcC,EAAW,CAG5B,IAFA,IAAItsJ,EAAI+yF,EAAI+vB,EAAKmhC,EAAM,IAAKuB,EAAM,IAEzBxzJ,EAAI,EAAGA,EAAI4nG,EAAG5nG,IACrBgO,EAAIH,EAAIG,EAAG+yF,EAAI+vB,EAAKmhC,EAAMjyJ,IAAKwzJ,EAAMxzJ,KAGvC,OAAOgO,EAIT,IAAKqsJ,GAAaC,EAAW,CAG3B,IAFA,IAAI16B,EAAK7+B,EAAI+vB,EAAKmhC,EAAM,IAAKuB,EAAM,GAAG,IAE7B1tJ,EAAK,EAAGA,EAAK8hG,EAAG9hG,IACvB85H,EAAK/xH,EAAI+xH,EAAI7+B,EAAI+vB,EAAKmhC,EAAMnsJ,IAAM0tJ,EAAM1tJ,GAAI,KAG9C,OAAO85H,EAIT,GAAIy6B,IAAcC,EAAW,CAG3B,IAFA,IAAIC,EAAMx5D,EAAI+vB,EAAKmhC,EAAM,GAAG,IAAKuB,EAAM,IAE9BxgB,EAAM,EAAGA,EAAMprC,EAAGorC,IACzBunB,EAAM1sJ,EAAI0sJ,EAAKx5D,EAAI+vB,EAAKmhC,EAAMjf,GAAK,IAAKwgB,EAAMxgB,KAGhD,OAAOunB,EAIT,GAAIF,GAAaC,EAAW,CAG1B,IAFA,IAAIE,EAAMz5D,EAAI+vB,EAAKmhC,EAAM,GAAG,IAAKuB,EAAM,GAAG,IAEjCnD,EAAM,EAAGA,EAAMzoD,EAAGyoD,IACzBmK,EAAM3sJ,EAAI2sJ,EAAKz5D,EAAI+vB,EAAKmhC,EAAM5B,GAAK,IAAKmD,EAAMnD,GAAK,KAGrD,OAAOmK,IA5FT,6BAgGF,SAAoB1yJ,EAAGe,GACrBuxJ,EAAatyJ,EAAGe,GAahB,IAXA,IAAI4xJ,EAAS3yJ,EAAE0mJ,OACXkM,EAAU5yJ,EAAEymJ,QACZoM,EAAS9xJ,EAAE2lJ,OACXoM,EAAU/xJ,EAAE0lJ,QAEZvgJ,EAAI,EACJH,EAAMspI,EACNp2C,EAAMk2C,EACNj3I,EAAI,EACJ8I,EAAI,EAED9I,EAAIy6J,EAAO16J,QAAU+I,EAAI6xJ,EAAO56J,QAAQ,CAC7C,IAAI06I,EAAIggB,EAAOz6J,GACX66J,EAAIF,EAAO7xJ,GAEX2xI,EAAIogB,EACN76J,IAIEy6I,EAAIogB,EACN/xJ,IAIE2xI,IAAMogB,IACR7sJ,EAAIH,EAAIG,EAAG+yF,EAAI25D,EAAQ16J,GAAI46J,EAAQ9xJ,KACnC9I,IACA8I,KAIJ,OAAOkF,KAhIT,SAASosJ,EAAatyJ,EAAGe,GACvB,IAIIiyJ,EAAMC,EAJNC,EAAQpc,EAAM92I,GAEdmzJ,EAAQrc,EAAM/1I,GAIlB,GAAqB,IAAjBmyJ,EAAMj7J,OACR+6J,EAAOE,EAAM,OACR,IAAqB,IAAjBA,EAAMj7J,QAA6B,IAAbi7J,EAAM,GAGrC,MAAM,IAAIvI,WAAW,2DAA6DuI,EAAMtoI,KAAK,MAAQ,KAFrGooI,EAAOE,EAAM,GAKf,GAAqB,IAAjBC,EAAMl7J,OACRg7J,EAAOE,EAAM,OACR,IAAqB,IAAjBA,EAAMl7J,QAA6B,IAAbk7J,EAAM,GAGrC,MAAM,IAAIxI,WAAW,2DAA6DwI,EAAMvoI,KAAK,MAAQ,KAFrGqoI,EAAOE,EAAM,GAKf,GAAIH,IAASC,EAAM,MAAM,IAAItI,WAAW,mCAAqCqI,EAAO,OAASC,EAAO,KACpG,GAAa,IAATD,EAAY,MAAM,IAAIrI,WAAW,qDACrC,OAAOqI,EA2GT,SAASlc,EAAM92I,GACb,OAAO,EAAAshH,EAAA,IAASthH,GAAKA,EAAE6M,OAASA,EAAK7M,OC7KrC,GAAO,cACP,GAAe,CAAC,QAAS,YAAa,eAAgB,aAAc,aAAc,YAAa,UACxFozJ,IAAmC,QAAQ,GAAM,IAAe50D,IACzE,IAAI,MACFyzB,EAAK,UACLod,EAAS,aACT/lB,EAAY,WACZ9xB,EAAU,WACVD,EAAU,UACVzkC,EAAS,OACT80D,GACEppB,EAwBJ,OAAOyzB,EAAM,GAAM,CACjB,yCAA0C,SAAwCjzH,EAAGkB,GACnF,KAAK4yD,EAAU9zD,IAAOw4F,EAAWx4F,IAAO8zD,EAAU5yD,IAAOs3F,EAAWt3F,IAClE,MAAM,IAAIjG,UAAU,2DACf,GAAI2tH,EAAO1nH,EAAGlB,GACnB,MAAM,IAAI/E,UAAU,6DAGtB,OAAOqvH,EAAa+lB,EAAUrwI,GAAI,GAAIqwI,EAAUnvI,GAAI,UCzCtD,GAAO,SACP,GAAe,CAAC,SACTmzJ,IAA8B,QAAQ,GAAM,IAAe70D,IACpE,IAAI,MACFyzB,GACEzzB,EAmCJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQu3I,GACRrU,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAE80F,UAEX5d,QAAS,SAAiBl3E,GACxB,OAAgB,IAATA,EAAEuzB,IAAqB,IAATvzB,EAAEs3E,IAEzBgoB,SAAU,SAAkBt/F,GAC1B,OAAe,IAARA,EAAEkJ,GAAmB,IAARlJ,EAAEhB,GAExBg2H,KAAM,SAAch1H,GAClB,OAAOxG,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YCtDpB,GAAe,CAAC,SACT85J,IAA2B,QAF3B,MAEyC,IAAe90D,IACjE,IAAI,MACFyzB,GACEzzB,EA0BJ,OAAOyzB,EA/BE,MA+BU,CACjB9vH,OAAQ44I,GACR7jE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEwD,OAEX6hI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEwD,OAEX87F,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEwD,OAEX,iBAAkB,SAAqBxD,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1Bw7H,KAAM,SAAch1H,GAClB,OAAOA,EAAEwD,YC1CX,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,eAC/C+vJ,IAA6B,QAF7B,QAE2C,IAAe/0D,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,MACN5f,EAAK,OACL2rD,EAAM,YACN+gF,GACE1wC,EACA4uD,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEod,EAAcN,GAAkB,CAClC/5B,UAuCF,OAAOA,EAAM,QAAS,CACpB9vH,OAAQ,SAAgBnC,GACtB,OAAI,QAAYA,EAAGwC,EAAMxC,GAAIoiB,EAAOg+F,SAC3B59G,EAAMxC,GAENR,KAAKiC,MAAMzB,IAGtB,iBAAkB,SAAsBA,EAAGhB,GACzC,IAAI,QAAYgB,EAAGwC,EAAMxC,EAAGhB,GAAIojB,EAAOg+F,SACrC,OAAO59G,EAAMxC,EAAGhB,GAEhB,IAAKmD,EAAQqxJ,GAAY,GAAGtuJ,OAAOlF,EAAG,KAAKsmB,MAAM,KAC7CtB,EAASxlB,KAAKiC,MAAMJ,OAAO,GAAG6D,OAAO/C,EAAQ,KAAK+C,OAAO7D,OAAOmyJ,GAAYx0J,KAEhF,OADCmD,EAAQqxJ,GAAY,GAAGtuJ,OAAO8f,EAAQ,KAAKsB,MAAM,KAC3CjlB,OAAO,GAAG6D,OAAO/C,EAAQ,KAAK+C,OAAO7D,OAAOmyJ,GAAYx0J,KAGnEk4E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEyB,SAEX,kBAAmB,SAAuBzB,EAAGhB,GAC3C,OAAOgB,EAAEyB,MAAMzC,IAEjBqmI,UAAW,SAAmBrlI,GAC5B,OAAI,GAAeA,EAAGwC,EAAMxC,GAAIoiB,EAAOg+F,SAC9B59G,EAAMxC,GAENA,EAAEyB,SAGb,uBAAwB,SAA4BzB,EAAGhB,GACrD,OAAI,GAAegB,EAAGwC,EAAMxC,EAAGhB,GAAIojB,EAAOg+F,SACjC59G,EAAMxC,EAAGhB,GAETgB,EAAEq5F,gBAAgBr6F,EAAEg7F,WAAY,gBAG3CsF,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEyB,SAEX,mBAAoB,SAAwBzB,EAAGhB,GAC7C,OAAOgB,EAAEyB,MAAMzC,IAEjB,iBAAkB,SAAqBgB,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1B,yBAA0B,SAA2BwG,EAAGhB,GAEtD,OAAO,SAAQgB,GAAG9H,GAAKsB,KAAKtB,EAAG8G,KAAI,IAErC,mCAAoC,SAAqCgB,EAAGe,GAC1E,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,sCAAuC,SAAqCwG,EAAGe,GAE7E,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCnH/C,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,YAAa,iBAAkB,cAAe,OAC1Eg5J,IAAgC,QAAQ,GAAM,IAAej1D,IACtE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,UACNkhF,EAAS,eACTF,EAAc,YACdD,EAAW,IACX/tF,GACEq9C,EACA4uD,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEod,EAAcN,GAAkB,CAClC/5B,UAGF,SAASyhC,EAA0BC,EAAOC,GAExC,OAAQD,EAAM17J,QACZ,KAAK,EAEH,OAAQ27J,EAAM37J,QACZ,KAAK,EAEH,GAAI07J,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjJ,WAAW,2EAGvB,MAEF,KAAK,EAEH,GAAIgJ,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjJ,WAAW,wDAA0DgJ,EAAM,GAAK,6BAA+BC,EAAM,GAAK,KAGtI,MAEF,QACE,MAAM,IAAIjuJ,MAAM,+DAAiEiuJ,EAAM37J,OAAS,gBAGpG,MAEF,KAAK,EAEH,OAAQ27J,EAAM37J,QACZ,KAAK,EAEH,GAAI07J,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjJ,WAAW,yDAA2DgJ,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAGzI,MAEF,KAAK,EAEH,GAAID,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjJ,WAAW,2DAA6DgJ,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAG3I,MAEF,QACE,MAAM,IAAIjuJ,MAAM,+DAAiEiuJ,EAAM37J,OAAS,gBAGpG,MAEF,QACE,MAAM,IAAI0N,MAAM,+DAAiEguJ,EAAM17J,OAAS,iBA4GtG,IAAI47J,EAAwB5hC,EAAM,wBAAyB,CACzD,mBA6BF,SAAoCl3H,EAAGmG,GAErC,IAUI+mB,EAVAkiI,EAAQpvJ,EAAEklB,MACVmqI,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAER2U,EAAQxqJ,EAAE+e,MACVyqI,EAAMxpJ,EAAE61I,UAER+c,EAAQ1J,EAAM,GACd2J,EAAW3J,EAAM,GAIjB4J,EAAK3kB,EAEL4kB,EAAK9kB,EAELkb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtCpiI,EAAKoiI,EAEL2J,EAAK/hC,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IAChCgsI,EAAKhiC,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,KAMvC,IAFA,IAAI/hB,EAAI,GAEChO,EAAI,EAAGA,EAAI47J,EAAO57J,IAAK,CAM9B,IAJA,IAAIirC,EAAMgnH,EAAMjyJ,GAEZ0I,EAAMqzJ,EAAG9wH,EAAI,GAAIuoH,EAAM,IAElB1qJ,EAAI,EAAGA,EAAI+yJ,EAAU/yJ,IAE5BJ,EAAMozJ,EAAGpzJ,EAAKqzJ,EAAG9wH,EAAIniC,GAAI0qJ,EAAM1qJ,KAGjCkF,EAAEhO,GAAK0I,EAIT,OAAO7F,EAAEi9I,kBAAkB,CACzB3mI,KAAMnL,EACN2G,KAAM,CAACinJ,GACPtiJ,SAAUyW,KA3EZ,oBA0QF,SAAqCltB,EAAGmG,GAEtC,IAAI8pJ,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACT0D,EAAMtvJ,EAAEg8I,UAEZ,IAAKiU,EACH,MAAM,IAAIrlJ,MAAM,0DAIlB,IAUIsiB,EAVAyjI,EAAQxqJ,EAAE+e,MACVyqI,EAAMxpJ,EAAE61I,UAER+c,EAAQ/4J,EAAE+7I,MAAM,GAChBod,EAAQhzJ,EAAE41I,MAAM,GAEhBqU,EAAU,GACV7lF,EAAS,GACT8lF,EAAO,GAIP4I,EAAK3kB,EAEL4kB,EAAK9kB,EAELl6C,EAAKi6C,EAEL6X,EAAO,EAEPsD,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtCpiI,EAAKoiI,EAEL2J,EAAK/hC,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IAChCgsI,EAAKhiC,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,IACrCgtE,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,IAI1B,IAAIjoB,EAAI,GAEJkqD,EAAI,GAERkhG,EAAK,GAAK,EAEV,IAAK,IAAI+I,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,IAAIC,EAAM1I,EAAMyI,GAEhB,IAAKl/D,EAAGm/D,EAAKrN,GAEX,IAAK,IAAIsN,EAAMnJ,EAAKiJ,GAAKG,EAAMpJ,EAAKiJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,IAAIC,EAAKvJ,EAAOsJ,GAEXrqG,EAAEsqG,GASLx0J,EAAEw0J,GAAMR,EAAGh0J,EAAEw0J,GAAKP,EAAGG,EAAKpJ,EAAQuJ,MAPlCrqG,EAAEsqG,IAAM,EAERlvF,EAAOtqE,KAAKw5J,GAEZx0J,EAAEw0J,GAAMP,EAAGG,EAAKpJ,EAAQuJ,MAUhC,IAAK,IAAI3oF,EAAKtG,EAAOrtE,OAAQqF,EAAI,EAAGA,EAAIsuE,EAAItuE,IAAK,CAE/C,IAAIm3J,EAAKnvF,EAAOhoE,GAEhB6tJ,EAAQ7tJ,GAAK0C,EAAEy0J,GAMjB,OAFArJ,EAAK,GAAK9lF,EAAOrtE,OAEV8C,EAAE+sJ,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACinJ,EAAO,GACdtiJ,SAAUyW,OAzVVysI,EAAwBziC,EAAM,wBAAyB,CACzD,2BA2EF,SAAyCl3H,EAAGmG,GAE1C,IAYI+mB,EAZAkiI,EAAQpvJ,EAAEklB,MACVmqI,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAER2U,EAAQxqJ,EAAE+e,MACVwqI,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAER+c,EAAQ1J,EAAM,GACd2J,EAAW3J,EAAM,GACjBuK,EAAWlK,EAAM,GAIjBuJ,EAAK3kB,EAEL4kB,EAAK9kB,EAELkb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtCpiI,EAAKoiI,EAEL2J,EAAK/hC,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IAChCgsI,EAAKhiC,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,KAMvC,IAFA,IAAI/hB,EAAI,GAEChO,EAAI,EAAGA,EAAI47J,EAAO57J,IAAK,CAE9B,IAAIirC,EAAMgnH,EAAMjyJ,GAEhBgO,EAAEhO,GAAK,GAEP,IAAK,IAAI8I,EAAI,EAAGA,EAAI2zJ,EAAU3zJ,IAAK,CAIjC,IAFA,IAAIJ,EAAMqzJ,EAAG9wH,EAAI,GAAIuoH,EAAM,GAAG1qJ,IAErBhB,EAAI,EAAGA,EAAI+zJ,EAAU/zJ,IAE5BY,EAAMozJ,EAAGpzJ,EAAKqzJ,EAAG9wH,EAAInjC,GAAI0rJ,EAAM1rJ,GAAGgB,KAGpCkF,EAAEhO,GAAG8I,GAAKJ,GAKd,OAAO7F,EAAEi9I,kBAAkB,CACzB3mI,KAAMnL,EACN2G,KAAM,CAACinJ,EAAOa,GACdnjJ,SAAUyW,KAhIZ,4BA6IF,SAA0CltB,EAAGmG,GAE3C,IAAIipJ,EAAQpvJ,EAAEklB,MACVmqI,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAERuT,EAAUppJ,EAAEulJ,QACZ8D,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KACT8D,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAEZ,IAAKuT,EACH,MAAM,IAAI3kJ,MAAM,0DAIlB,IAGIsiB,EAHA6rI,EAAQ1J,EAAM,GACduK,EAAWlK,EAAM,GAIjBuJ,EAAK3kB,EAEL4kB,EAAK9kB,EAELl6C,EAAKi6C,EAEL6X,EAAO,EAEPsD,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtCpiI,EAAKoiI,EAEL2J,EAAK/hC,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IAChCgsI,EAAKhiC,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,IACrCgtE,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,IAgB1B,IAZA,IAAIkjI,EAAU,GACV7lF,EAAS,GACT8lF,EAAO,GAEPllJ,EAAIhF,EAAE4mJ,mBAAmB,CAC3BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACinJ,EAAOa,GACdnjJ,SAAUyW,IAGH2sI,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpCxJ,EAAKwJ,GAAMtvF,EAAOrtE,OAElB,IAAI48J,EAAMrK,EAAKoK,GACXE,EAAMtK,EAAKoK,EAAK,GAEpB,GAAIE,EAAMD,EAIR,IAFA,IAAIv0E,EAAO,EAEFpoF,EAAI,EAAGA,EAAI47J,EAAO57J,IAAK,CAM9B,IAJA,IAAI4yJ,EAAO5yJ,EAAI,EAEXs0J,OAAM,EAEDuI,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAEjC,IAAIZ,EAAK5J,EAAOwK,GAEZz0E,IAASwqE,GAEX0B,EAAMyH,EAAG9J,EAAMjyJ,GAAGi8J,GAAK7J,EAAQyK,IAE/Bz0E,EAAOwqE,GAGP0B,EAAMwH,EAAGxH,EAAKyH,EAAG9J,EAAMjyJ,GAAGi8J,GAAK7J,EAAQyK,KAKvCz0E,IAASwqE,GAAS71D,EAAGu3D,EAAKzF,KAE5BzhF,EAAOtqE,KAAK9C,GACZizJ,EAAQnwJ,KAAKwxJ,KASrB,OAFApB,EAAKuJ,GAAYrvF,EAAOrtE,OAEjBiO,GA/OP,4BAmWF,SAA0CnL,EAAGmG,GAE3C,IAAI8pJ,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACT0D,EAAMtvJ,EAAEg8I,UAEZ,IAAKiU,EACH,MAAM,IAAIrlJ,MAAM,0DAIlB,IAOIsiB,EAPAyjI,EAAQxqJ,EAAE+e,MACVyqI,EAAMxpJ,EAAE61I,UAER+c,EAAQ/4J,EAAE+7I,MAAM,GAChBod,EAAQhzJ,EAAE41I,MAAM,GAChB6d,EAAWzzJ,EAAE41I,MAAM,GAInBkd,EAAK3kB,EAEL4kB,EAAK9kB,EAELl6C,EAAKi6C,EAEL6X,EAAO,EAEPsD,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtCpiI,EAAKoiI,EAEL2J,EAAK/hC,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IAChCgsI,EAAKhiC,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,IACrCgtE,EAAKg9B,EAAM72E,KAAK8zF,EAAa,CAACjnH,EAAIA,IAElC8+H,EAAO90B,EAAMna,QAAQ,EAAG7vF,IAoB1B,IAhBA,IAAIkjI,EAAU,GACV7lF,EAAS,GACT8lF,EAAO,GAEPllJ,EAAInL,EAAE+sJ,mBAAmB,CAC3BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACinJ,EAAOa,GACdnjJ,SAAUyW,IAGRjoB,EAAI,GAEJkqD,EAAI,GAEC0qG,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpCxJ,EAAKwJ,GAAMtvF,EAAOrtE,OAIlB,IAFA,IAAI6yJ,EAAO8J,EAAK,EAEPT,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,IAAIa,EAAOtJ,EAAMyI,GAAIS,GAErB,IAAK3/D,EAAG+/D,EAAMjO,GAEZ,IAAK,IAAIsN,EAAMnJ,EAAKiJ,GAAKG,EAAMpJ,EAAKiJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,IAAIC,EAAKvJ,EAAOsJ,GAEZrqG,EAAEsqG,KAAQ1J,GAEZ5gG,EAAEsqG,GAAM1J,EAERxlF,EAAOtqE,KAAKw5J,GAEZx0J,EAAEw0J,GAAMP,EAAGe,EAAMhK,EAAQuJ,KAGzBv0J,EAAEw0J,GAAMR,EAAGh0J,EAAEw0J,GAAKP,EAAGe,EAAMhK,EAAQuJ,MAO3C,IAAK,IAAIU,EAAK7J,EAAKwJ,GAAKhpF,EAAKtG,EAAOrtE,OAAQqF,EAAI23J,EAAI33J,EAAIsuE,EAAItuE,IAAK,CAE/D,IAAIm3J,EAAKnvF,EAAOhoE,GAEhB6tJ,EAAQ7tJ,GAAK0C,EAAEy0J,IAOnB,OAFArJ,EAAKuJ,GAAYrvF,EAAOrtE,OAEjBiO,GAtcP,6BAkdF,SAA2CnL,EAAGmG,GAE5C,IAeI+mB,EAfA+iI,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACT0D,EAAMtvJ,EAAEg8I,UAERuT,EAAUppJ,EAAEulJ,QACZ8D,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KACT+D,EAAMxpJ,EAAE61I,UAER+c,EAAQ/4J,EAAE+7I,MAAM,GAChB6d,EAAWzzJ,EAAE41I,MAAM,GAEnBxxI,EAAS0lJ,GAAWV,EAIpB0J,EAAK3kB,EAEL4kB,EAAK9kB,EAELkb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtCpiI,EAAKoiI,EAEL2J,EAAK/hC,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IAChCgsI,EAAKhiC,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,KAsBvC,IAlBA,IAgBIssI,EAAIF,EAAKC,EAAKS,EAAIF,EAAKC,EAAKN,EAAIL,EAhBhChJ,EAAU7lJ,EAAS,QAAKzL,EACxByrE,EAAS,GACT8lF,EAAO,GAEPllJ,EAAInL,EAAE+sJ,mBAAmB,CAC3BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACinJ,EAAOa,GACdnjJ,SAAUyW,IAGRjoB,EAAIsF,EAAS,QAAKzL,EAElBqwD,EAAI,GAIC0qG,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpCxJ,EAAKwJ,GAAMtvF,EAAOrtE,OAElB,IAAI6yJ,EAAO8J,EAAK,EAEhB,IAAKC,EAAMrK,EAAKoK,GAAKE,EAAMtK,EAAKoK,EAAK,GAAIG,EAAKF,EAAKE,EAAKD,EAAKC,IAI3D,GAFAZ,EAAK5J,EAAOwK,GAERzvJ,EAEF,IAAK+uJ,EAAMnJ,EAAKiJ,GAAKG,EAAMpJ,EAAKiJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAIvDrqG,EAFJsqG,EAAKvJ,EAAOsJ,MAEEzJ,GAEZ5gG,EAAEsqG,GAAM1J,EAERxlF,EAAOtqE,KAAKw5J,GAEZx0J,EAAEw0J,GAAMP,EAAG3J,EAAQyK,GAAK/J,EAAQuJ,KAGhCv0J,EAAEw0J,GAAMR,EAAGh0J,EAAEw0J,GAAKP,EAAG3J,EAAQyK,GAAK/J,EAAQuJ,UAK9C,IAAKF,EAAMnJ,EAAKiJ,GAAKG,EAAMpJ,EAAKiJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAIvDrqG,EAFJsqG,EAAKvJ,EAAOsJ,MAEEzJ,IAEZ5gG,EAAEsqG,GAAM1J,EAERxlF,EAAOtqE,KAAKw5J,IAOpB,GAAIlvJ,EAEF,IAAK,IAAI2vJ,EAAK7J,EAAKwJ,GAAKhpF,EAAKtG,EAAOrtE,OAAQqF,EAAI23J,EAAI33J,EAAIsuE,EAAItuE,IAAK,CAE/D,IAAIm3J,EAAKnvF,EAAOhoE,GAEhB6tJ,EAAQ7tJ,GAAK0C,EAAEy0J,IAQrB,OAFArJ,EAAKuJ,GAAYrvF,EAAOrtE,OAEjBiO,KAqCT,OAAO+rH,EAAM,IAAM,SAAO,CAExB,eAAgB,SAAoBjyH,EAAGe,GAErC2yJ,GAA0B,SAAU1zJ,IAAI,SAAUe,IAGlD,IAAI6I,EAAIpQ,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAE/B,OAAO,EAAAugH,EAAA,IAAS13G,GAAKA,EAAEnP,UAAYmP,GAErC,iBAAkB,SAAsB5J,EAAGe,GAEzC,IAAIm0J,EAAQl1J,EAAE6M,OACVsoJ,EAAQp0J,EAAE8L,OAKd,OAHA6mJ,EAA0BwB,EAAOC,GAGZ,IAAjBD,EAAMj9J,OAEa,IAAjBk9J,EAAMl9J,OA1uBhB,SAA+B8C,EAAGmG,EAAGlC,GAEnC,GAAU,IAANA,EACF,MAAM,IAAI2G,MAAM,qCAGlB,OAAOw7C,EAAIpmD,EAAGmG,GAsuBDk0J,CAAsBp1J,EAAGe,EAAGm0J,EAAM,IA1tBjD,SAA+Bn6J,EAAGmG,GAEhC,GAAoB,UAAhBA,EAAEgyI,UACJ,MAAM,IAAIvtI,MAAM,4CAGlB,OAYF,SAAoC5K,EAAGmG,GAErC,IAWI+mB,EAXAkiI,EAAQpvJ,EAAEklB,MACVmqI,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAER2U,EAAQxqJ,EAAE+e,MACVwqI,EAAQvpJ,EAAE41I,MACV4T,EAAMxpJ,EAAE61I,UAERse,EAAUjL,EAAM,GAChBuK,EAAWlK,EAAM,GAIjBuJ,EAAK3kB,EAEL4kB,EAAK9kB,EAELkb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtCpiI,EAAKoiI,EAEL2J,EAAK/hC,EAAM72E,KAAKi0F,EAAW,CAACpnH,EAAIA,IAChCgsI,EAAKhiC,EAAM72E,KAAK+zF,EAAgB,CAAClnH,EAAIA,KAMvC,IAFA,IAAI/hB,EAAI,GAEClF,EAAI,EAAGA,EAAI2zJ,EAAU3zJ,IAAK,CAIjC,IAFA,IAAIJ,EAAMqzJ,EAAG9J,EAAM,GAAIuB,EAAM,GAAG1qJ,IAEvB9I,EAAI,EAAGA,EAAIm9J,EAASn9J,IAE3B0I,EAAMozJ,EAAGpzJ,EAAKqzJ,EAAG9J,EAAMjyJ,GAAIwzJ,EAAMxzJ,GAAG8I,KAGtCkF,EAAElF,GAAKJ,EAIT,OAAO7F,EAAEi9I,kBAAkB,CACzB3mI,KAAMnL,EACN2G,KAAM,CAAC8nJ,GACPnjJ,SAAUyW,IA1DLqtI,CAA2Bv6J,EAAGmG,GAwtB1Bq0J,CAAsBv1J,EAAGe,GAIb,IAAjBo0J,EAAMl9J,OAED47J,EAAsB7zJ,EAAGe,GAI3B2zJ,EAAsB10J,EAAGe,IAElC,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,EAAGe,EAAEmyI,WAAYnyI,IAEtC,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqsJ,EAAYptJ,EAAGe,EAAGouI,GAAgB,IAE3C,mBAAoB,SAAwBnvI,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGouI,GAAgB,IAE3C,oBAAqB,SAAyBnvI,EAAGe,GAC/C,OAAOqsJ,EAAYrsJ,EAAGf,EAAGmvI,GAAgB,IAE3C,mBAAoB,SAAwBnvI,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGmvI,GAAgB,IAE3C,aAAc,SAAkBnvI,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGouI,GAAgB,GAAO10I,WAE1D,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGmvI,GAAgB,GAAM10I,WAEzD,WAAY00I,EACZ,mBAAoB,SAAmBnvI,EAAGe,EAAGqxJ,GAG3C,IAFA,IAAIptI,EAASxrB,KAAKwG,EAAGe,GAEZ7I,EAAI,EAAGA,EAAIk6J,EAAKn6J,OAAQC,IAC/B8sB,EAASxrB,KAAKwrB,EAAQotI,EAAKl6J,IAG7B,OAAO8sB,IAERmqH,EAAe1c,gBC53BhB,GAAO,cACP,GAAe,CAAC,QAAS,SAAU,cAAe,kBAC3C+iC,IAAmC,QAAQ,GAAM,IAAeh3D,IACzE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,eACXC,GACE3wC,EACAyuD,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEE+iB,EAAcF,GAAkB,CAClC9/B,QACAid,gBAEEke,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA6BF,OAAOA,EAAM,GAAM,CACjB,WAAYkd,EACZ,6BAA8B,SAAkCnvI,EAAGe,GACjE,OAAOkxJ,EAAYjyJ,EAAGe,EAAGouI,GAAgB,IAE3C,4BAA6B,SAAiCnvI,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGmvI,GAAgB,IAE3C,4BAA6B,SAAiCnvI,EAAGe,GAC/D,OAAOksJ,EAAYjtJ,EAAGe,EAAGouI,GAAgB,IAE3C,2BAA4B,SAAgCnvI,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGouI,IAE3B,eAAgB,SAAoBnvI,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqsJ,EAAYptJ,EAAGe,EAAGouI,GAAgB,IAE3C,mBAAoB,SAAwBnvI,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGouI,GAAgB,IAE3C,oBAAqB,SAAyBnvI,EAAGe,GAC/C,OAAOqsJ,EAAYrsJ,EAAGf,EAAGmvI,GAAgB,IAE3C,mBAAoB,SAAwBnvI,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGmvI,GAAgB,IAE3C,aAAc,SAAkBnvI,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGouI,GAAgB,GAAO10I,WAE1D,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGmvI,GAAgB,GAAM10I,gBCrGzD,GAAe,CAAC,SACTg7J,IAA0B,QAF1B,KAEwC,IAAej3D,IAChE,IAAI,MACFyzB,GACEzzB,EA6BJ,OAAOyzB,EAlCE,KAkCU,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAOA,GAETqlI,UAAW,SAAmBrlI,GAC5B,OAAOA,GAETk3E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEuzB,IAEX,iBAAkB,SAAqBvzB,GACrC,OAAO,SAAQA,EAAGxG,YC5CpB,GAAO,UACP,GAAe,CAAC,QAAS,UAClBk8J,IAA+B,QAAQ,GAAM,IAAel3D,IACrE,IAAI,MACFyzB,EAAK,OACL9jE,GACEqwC,EAoBJ,OAAOyzB,EAAM,GAAM,CACjB75H,MAAO,SAAe4H,GACpB,OAAO,UAAa,SAAMA,KAE5BuvI,OAAQ,SAAgBvvI,GACtB,IAAIsoJ,GAAO,UAAa,SAAMtoJ,EAAEutI,YAEhC,OAAOp/E,EAAOm6F,SC3Bb,SAASqN,GAAep8J,EAAI65E,EAAOpnD,EAAK/iB,GAC7C,KAAMzP,gBAAgBm8J,IACpB,MAAM,IAAI7+E,YAAY,oDAGxBt9E,KAAKD,GAAKA,EACVC,KAAK45E,MAAQA,EACb55E,KAAKwyB,IAAMA,EACXxyB,KAAKyP,IAAMA,EACXzP,KAAK0lB,QAAU,yCAA2C3lB,EAAK,KAAO65E,EAAQ,cAAgBpnD,GAAO/iB,QAAoC,IAAMA,EAAM,IAAM,aAC3JzP,KAAK8zE,OAAQ,IAAI3nE,OAAQ2nE,MAE3BqoF,GAAen7J,UAAY,IAAImL,MAC/BgwJ,GAAen7J,UAAU2C,YAAcwI,MACvCgwJ,GAAen7J,UAAU0E,KAAO,iBAChCy2J,GAAen7J,UAAUo7J,kBAAmB,EChB5C,IACI,GAAe,CAAC,SAAU,UACnBC,IAA8B,QAF9B,SAE4C,IAAer3D,IACpE,IAAI,OACFp8E,EAAM,OACN+rC,GACEqwC,EA6BJ,OAAO,SAAgBx+F,EAAG6M,EAAM4wG,GAC9B,GAAyB,IAArB/jH,UAAUzB,QAAqC,IAArByB,UAAUzB,OACtC,MAAM,IAAI09J,GAAe,SAAUj8J,UAAUzB,OAAQ,EAAG,GAe1D,IAZI,EAAAqpH,EAAA,IAASz0G,KACXA,EAAOA,EAAKpS,YAGV,EAAA6mH,EAAA,IAAYz0G,EAAK,MAEnBA,EAAOA,EAAK/L,KAAI,SAAU7H,GACxB,OAAQ,EAAAqoH,EAAA,IAAYroH,GAAiBA,EAAM+gG,WAAd/gG,OAK7B,EAAAqoH,EAAA,IAASthH,GAEX,OAAOA,EAAE4W,OAAO/J,EAAM4wG,GAAc,GAGtC,GAAiB,iBAANz9G,EAET,OAAO81J,EAAc91J,EAAG6M,EAAM4wG,GAIhC,IAAIs4C,GAAW39J,MAAMoF,QAAQwC,IAA+B,UAAlBoiB,EAAO+rC,OAEjD,GAAoB,IAAhBthD,EAAK5U,OAAc,CAErB,KAAOG,MAAMoF,QAAQwC,IACnBA,EAAIA,EAAE,GAGR,OAAO,SAAMA,GAGR5H,MAAMoF,QAAQwC,KACjBA,EAAI,CAACA,IAGPA,GAAI,SAAMA,GACV,IAAIisE,GAAM,SAAYjsE,EAAG6M,EAAM4wG,GAC/B,OAAOs4C,EAAW5nG,EAAO8d,GAAOA,GAWpC,SAAS6pF,EAAc1iJ,EAAKvG,EAAMmpJ,GAChC,QAAoBn8J,IAAhBm8J,GACF,GAA2B,iBAAhBA,GAAmD,IAAvBA,EAAY/9J,OACjD,MAAM,IAAIgC,UAAU,kDAGtB+7J,EAAc,IAGhB,GAAoB,IAAhBnpJ,EAAK5U,OACP,MAAM,IAAIi/I,GAAA,EAAerqI,EAAK5U,OAAQ,GAGxC,IAAID,EAAM6U,EAAK,GAEf,GAAmB,iBAAR7U,KAAqB,OAAUA,GACxC,MAAM,IAAIiC,UAAU,wDAA8D,SAAO4S,GAAQ,KAGnG,GAAIuG,EAAInb,OAASD,EACf,OAAOob,EAAIq4B,UAAU,EAAGzzC,GACnB,GAAIob,EAAInb,OAASD,EAAK,CAG3B,IAFA,IAAIi0E,EAAM74D,EAEDlb,EAAI,EAAGi2I,EAAKn2I,EAAMob,EAAInb,OAAQC,EAAIi2I,EAAIj2I,IAC7C+zE,GAAO+pF,EAGT,OAAO/pF,EAEP,OAAO74D,MC9HT,GAAO,UACP,GAAe,CAAC,QAAS,UAClB6iJ,IAA+B,QAAQ,GAAM,IAAez3D,IACrE,IAAI,MACFyzB,EAAK,OACL9jE,GACEqwC,EA+BJ,OAAOyzB,EAAM,GAAM,CACjB75H,MAAO,SAAe4H,GACpB,OAAO,UAAa,SAAMA,KAE5BuvI,OAAQ,SAAgBvvI,GACtB,IAAIisE,GAAM,SAAajsE,EAAEutI,WAEzB,OAAOn1I,MAAMoF,QAAQyuE,GAAO9d,EAAO8d,GAAOA,GAE5C2mD,IAAK,SAAa5yH,GAEhB,OAAO,SAAMA,SC/Cf,GAAe,CAAC,QAAS,UAClBk2J,IAA0B,QAF1B,KAEwC,IAAe13D,IAChE,IAAI,MACFyzB,EAAK,OACL9jE,GACEqwC,EACA6tD,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA2BF,OAAOA,EAtCE,KAsCU,CACjB,sBAAuB,SAAwBjyH,EAAG0C,GAChD,OAAO1C,EAAEqnH,GAAG3kH,IAEd,iBAAkB,SAAsB1C,EAAGe,GAEzC,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,cAAe,SAAmBf,EAAGe,GAEnC,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,cAAe,SAAmBwG,EAAGe,GAEnC,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCtE/C,GAAe,CAAC,QAAS,SAAU,WAAY,WAAY,SAAU,WAAY,SAAU,WACpF07J,IAA2B,QAF3B,MAEyC,IAAe33D,IACjE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,SACNyuF,EAAQ,SACR7yF,EAAQ,OACRmwC,EAAM,OACNhsD,EAAM,SACNk6H,EAAQ,QACRnlD,GACEsnB,EAkCJ,OAAOyzB,EA9CE,MA8CU,CACjB,iBAAkBmkC,EAClB,mBAAoB,SAAwBp2J,EAAGe,GAC7C,OAAOf,EAAEmB,IAAIJ,IAEf,uBAAwB,SAA4Bf,EAAGe,GACrD,OAAIA,EAAE+xD,aAAe9yD,GAAK,GAAKoiB,EAAOi+F,YAC7BrgH,EAAEmB,IAAIJ,GAEN,IAAIm2E,EAAQl3E,EAAEg6F,WAAY,GAAG74F,IAAIJ,EAAEi5F,WAAY,IAG1D,qBAAsB,SAA0Bh6F,EAAGe,GACjD,GAAY,IAARA,EAAEmI,EAAS,CACb,GAAIkZ,EAAOi+F,YACT,MAAM,IAAI16G,MAAM,sEAEhB,OAAOywJ,EAAKp2J,EAAEvF,UAAWsG,EAAEtG,WAG7B,OAAOuF,EAAEmB,IAAIJ,IAGjB,gBAAiBs1J,EACjB,mBAAoB,SAAwBr2J,EAAGe,GAC7C,OAAOs1J,EAAUr2J,EAAGe,EAAEi5F,aAExB,iBAAkBs8D,EAClB,oBAAqB,SAAyBt2J,EAAGe,GAC/C,OAAOu1J,EAAWt2J,EAAGe,EAAEi5F,aAEzB,2BAA4B,SAA6Bh6F,EAAGe,GAC1D,OAAOf,EAAEmB,IAAIJ,MAWjB,SAASq1J,EAAKp2J,EAAGe,GAGf,GAAIqhB,EAAOi+F,eAAgB,OAAUt/G,IAAMf,EAAI,EAE7C,IACE,IAAIu2J,EAAQl6B,EAASt7H,GACjBy1J,EAAOr0J,EAAOo0J,GAElB,IAAIx1J,IAAMy1J,GAAQh3J,KAAKgE,KAAKzC,EAAIy1J,GAAQz1J,GAAK,QACvCw1J,EAAMrtJ,EAAI,GAAM,EAClB,OAAQqtJ,EAAMv3J,EAAI,GAAM,EAAI,GAAK,GAAKQ,KAAK2B,KAAKnB,EAAGe,GAGvD,MAAO61D,IAQX,OAAIx0C,EAAOi+F,cAAgBrgH,GAAK,GAAKe,IAAM82E,KAAY73E,GAAK,GAAKA,EAAI,GAAKe,KAAM,KACvE03E,KAGL,OAAU13E,IAAMf,GAAK,GAAKoiB,EAAOi+F,YAC5B+7B,GAAUp8I,EAAGe,GAKhBf,EAAIA,EAAI,GAAKe,IAAM82E,KAAY73E,EAAIA,EAAI,GAAKe,KAAM,IAC7C,EAGF,IAAIm2E,EAAQl3E,EAAG,GAAGmB,IAAIJ,EAAG,GAYpC,SAASs1J,EAAUr2J,EAAGe,GACpB,KAAK,OAAUA,IAAMA,EAAI,EACvB,MAAM,IAAI9G,UAAU,mDAAqD8G,EAAI,KAI/E,IAAIw+B,GAAI,SAAKv/B,GAEb,GAAiB,IAAbu/B,EAAEtnC,OACJ,MAAM,IAAI0N,MAAM,2CAA6C45B,EAAEtnC,OAAS,gBAG1E,GAAIsnC,EAAE,KAAOA,EAAE,GACb,MAAM,IAAI55B,MAAM,sCAAwC45B,EAAE,GAAK,IAAMA,EAAE,GAAK,KAM9E,IAHA,IAAI0sC,EAAM4kC,EAAStxE,EAAE,IAAI9kC,UACrB48F,EAAKr3F,EAEFe,GAAK,GACM,IAAP,EAAJA,KACHkrE,EAAMjuD,EAASq5E,EAAIprB,IAGrBlrE,IAAM,EACNs2F,EAAKr5E,EAASq5E,EAAIA,GAGpB,OAAOprB,EAWT,SAASqqF,EAAWt2J,EAAGe,GACrB,OAAOotD,EAAOkoG,EAAUr2J,EAAEvF,UAAWsG,QC9KrC,GAAO,SACP,GAAe,CAAC,QAAS,cAAe,SAAU,MAAO,eAClD01J,IAA8B,QAAQ,GAAM,IAAej4D,IACpE,IAAI,MACFyzB,EAAK,YACLid,EAAW,OACX/gF,EAAM,IACNhtD,EAAG,YACHquI,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE4d,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEme,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA0BF,OAAOA,EAAM,GAAM,CACjB,WAAY9wH,EACZ,6BAA8B,SAAkCnB,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGI,GAAK,IAEhC,4BAA6B,SAAiCnB,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGmB,GAAK,IAEhC,4BAA6B,SAAiCnB,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGI,GAAK,IAEhC,2BAA4B,SAAgCnB,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGI,IAE3B,eAAgB,SAAoBnB,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBChG/C,GAAO,kBACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,eACpDi8J,IAAuC,QAAQ,GAAM,IAAel4D,IAC7E,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,MACX5N,EAAK,YACLkO,GACEhxC,EACA0tD,EAAclC,GAAkB,CAClC/3B,UAEEg7B,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEghB,EAAcF,GAAkB,CAClC/9B,QACAid,gBAEEkd,EAAcZ,GAAkB,CAClCv5B,QACAud,gBAEE4d,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkB6sB,GAClB,uBAAwBN,GACxB,6BAA8B,SAAkCx+I,EAAGe,GACjE,OAAOmvJ,EAAYlwJ,EAAGe,EAAGvH,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmrJ,EAAYlsJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mCAAoC,SAAqCf,EAAGe,GAE1E,OAAImuI,EAAYnuI,EAAG,GACVf,EAAEy9F,QAGJ2vD,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GAExE,OAAImuI,EAAYnuI,EAAG,GACVf,EAAEy9F,QAGJ6uD,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,mCAAoC,SAAqCwG,EAAGe,GAE1E,OAAImuI,EAAYlvI,EAAG,GACVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBkZ,EAAYrrJ,EAAGf,EAAGxG,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GAExE,OAAImuI,EAAYlvI,EAAG,GACVshI,EAAMvgI,EAAE8L,OAAQ9L,EAAEmyI,WAGpBoZ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAE5D,OAAOvH,KAAK20D,EAAOnuD,GAAIe,GAAGtG,WAE5B,4BAA6B,SAA8BuF,EAAGe,GAE5D,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,IAAItG,gB,WCnI5B,GAAO,iBACP,GAAe,CAAC,QAAS,WAClBk8J,IAAsC,QAAQ,GAAM,IAAen4D,IAC5E,IAAI,MACFyzB,EAAK,QACLr3B,GACE4D,EACAo4D,EAAkBh8D,EAAQ63B,WAAW,mBAsEzC,OAAOR,EAAM,GAAM,CACjB,WAAY,SAAgBjyH,EAAGe,GAC7B,IAEImF,EAFA2wJ,GAAQ,QAAO72J,GACf82J,GAAQ,QAAO/1J,GAGnB,KAAe,WAAV81J,GAAgC,cAAVA,GAAmC,aAAVA,GAAoC,WAAVC,GAAgC,cAAVA,GAAmC,aAAVA,GAG3H,MAAqB,OAFrB5wJ,EAAI00F,EAAQ56F,EAAGe,IAET9B,WAEGiH,EAAI,EAAI,GAAK,EAEbygG,GAAYkwD,EAAOC,GAK9B,GAAc,UAAVD,GAA+B,WAAVA,GAAgC,UAAVC,GAA+B,WAAVA,EAGlE,OAAU,KAFV5wJ,EAAI6wJ,EAAyBv9J,KAAMwG,EAAGe,IAG7BmF,EAEAygG,GAAYkwD,EAAOC,GAK9B,GAAID,IAAUC,EACZ,OAAOnwD,GAAYkwD,EAAOC,GAG5B,GAAc,YAAVD,EACF,OAiKR,SAA+B72J,EAAGe,GAChC,OAAIf,EAAEuzB,GAAKxyB,EAAEwyB,GACJ,EAGLvzB,EAAEuzB,GAAKxyB,EAAEwyB,IACH,EAGNvzB,EAAEs3E,GAAKv2E,EAAEu2E,GACJ,EAGLt3E,EAAEs3E,GAAKv2E,EAAEu2E,IACH,EAGH,EAlLM0/E,CAAsBh3J,EAAGe,GAGlC,GAAc,SAAV81J,EACF,OAAI72J,EAAEg6I,UAAUj5I,GACPvH,KAAKwG,EAAE/G,MAAO8H,EAAE9H,OAIlBg+J,EAAcz9J,KAAMwG,EAAEk3J,cAAen2J,EAAEm2J,eAGhD,GAAc,YAAVL,EACF,OAAOD,EAAgB52J,EAAGe,GAG5B,GAAc,WAAV81J,EACF,OAAOlwD,GAAY3mG,EAAGe,GAGxB,GAAc,WAAV81J,EACF,OAyGN,SAAwBj1B,EAAgB5hI,EAAGe,GACzC,IAAIo2J,EAAQx7J,OAAOsE,KAAKD,GACpBo3J,EAAQz7J,OAAOsE,KAAKc,GAExBo2J,EAAM71J,KAAKqlG,IACXywD,EAAM91J,KAAKqlG,IACX,IAAIzgG,EAAI+wJ,EAAcr1B,EAAgBu1B,EAAOC,GAE7C,GAAU,IAANlxJ,EACF,OAAOA,EAIT,IAAK,IAAIhO,EAAI,EAAGA,EAAIi/J,EAAMl/J,OAAQC,IAAK,CACrC,IAAIiI,EAAIyhI,EAAe5hI,EAAEm3J,EAAMj/J,IAAK6I,EAAEq2J,EAAMl/J,KAE5C,GAAU,IAANiI,EACF,OAAOA,EAIX,OAAO,EA9HIk3J,CAAe79J,KAAMwG,EAAGe,GAGjC,GAAc,SAAV81J,EACF,OAAO,EAGT,GAAc,cAAVA,EACF,OAAO,EAIT,MAAM,IAAI58J,UAAU,8BAAgC48J,EAAQ,QAWhE,SAASE,EAAyBn1B,EAAgB5hI,EAAGe,GACnD,OAAI,EAAAugH,EAAA,IAAethH,KAAM,EAAAshH,EAAA,IAAevgH,GAC/Bk2J,EAAcr1B,EAAgB5hI,EAAE06F,SAASp1F,OAAQvE,EAAE25F,SAASp1F,SAGjE,EAAAg8G,EAAA,IAAethH,GAEV+2J,EAAyBn1B,EAAgB5hI,EAAEutI,UAAWxsI,IAG3D,EAAAugH,EAAA,IAAevgH,GAEVg2J,EAAyBn1B,EAAgB5hI,EAAGe,EAAEwsI,YAInD,EAAAjsB,EAAA,IAActhH,GACT+2J,EAAyBn1B,EAAgB5hI,EAAE06F,SAASrpF,KAAMtQ,IAG/D,EAAAugH,EAAA,IAAcvgH,GACTg2J,EAAyBn1B,EAAgB5hI,EAAGe,EAAE25F,SAASrpF,MAI3DjZ,MAAMoF,QAAQwC,GAId5H,MAAMoF,QAAQuD,GAIZk2J,EAAcr1B,EAAgB5hI,EAAGe,GAH/Bg2J,EAAyBn1B,EAAgB5hI,EAAG,CAACe,IAJ7Cg2J,EAAyBn1B,EAAgB,CAAC5hI,GAAIe,GAsBzD,SAASk2J,EAAcr1B,EAAgB5hI,EAAGe,GAExC,IAAK,IAAI7I,EAAI,EAAGi2I,EAAK3uI,KAAKwsB,IAAIhsB,EAAE/H,OAAQ8I,EAAE9I,QAASC,EAAIi2I,EAAIj2I,IAAK,CAC9D,IAAIiI,EAAIyhI,EAAe5hI,EAAE9H,GAAI6I,EAAE7I,IAE/B,GAAU,IAANiI,EACF,OAAOA,EAKX,OAAIH,EAAE/H,OAAS8I,EAAE9I,OACR,EAGL+H,EAAE/H,OAAS8I,EAAE9I,QACP,EAIH,MCjOP,GAAO,YACP,GAAe,CAAC,QAAS,cAAe,UACjCq/J,IAAiC,QAAQ,GAAM,IAAe94D,IACvE,IAAI,MACFyzB,EAAK,YACL4P,EAAW,OACX/sC,GACE0J,EA4BJ,OAAOyzB,EAAM,GAAM,CACjB,WAAY,SAAgBjyH,EAAGe,GAC7B,OAAO+zF,EAAO+sC,EAAY7hI,EAAGe,UC9B/B,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtCw2J,IAAgC,QAAQ,GAAM,IAAe/4D,IACtE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,YACNqhF,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA8BF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwBjyH,EAAGe,GAC7C,OAAOf,GAAKe,GAEd,iBAAkB,SAAsBf,EAAGe,GACzC,OAAOf,GAAKe,IAAK,QAAYf,EAAGe,EAAGqhB,EAAOg+F,UAE5C,uBAAwB,SAA4BpgH,EAAGe,GACrD,OAAOf,EAAE41F,IAAI70F,IAAM,GAAef,EAAGe,EAAGqhB,EAAOg+F,UAEjD,qBAAsB,SAA0BpgH,EAAGe,GACjD,OAAyB,IAAlBf,EAAE46F,QAAQ75F,IAEnB,mBAAoB,WAClB,MAAM,IAAI9G,UAAU,wDAEtB,aAAc,SAAkB+F,EAAGe,GACjC,IAAKf,EAAEg6I,UAAUj5I,GACf,MAAM,IAAI4E,MAAM,4CAGlB,OAAOnM,KAAKwG,EAAE/G,MAAO8H,EAAE9H,QAEzB,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBC5H/C,GAAO,kBACP,GAAe,CAAC,QAAS,YAAa,QAAS,WACxC+8J,IAAuC,QAAQ,GAAM,IAAeh5D,IAC7E,IAAI,MACFyzB,EAAK,UACLgR,EAAS,MACT/gI,EAAK,QACL04F,GACE4D,EACAi5D,EAAM78D,EAENl+F,EAAO,CAAC3B,EAAGmG,KAAO05F,EAAQ7/F,EAAGmG,GAmCjC,OAAO+wH,EAAM,GAAM,CACjB,yBAA0B,SAA2BjyH,EAAGE,GACtD,OAAOw3J,EAAiB13J,EAAGE,EAAGu3J,IAEhC,iCAAkC,SAAiCz3J,EAAGE,EAAG06F,GACvE,GAAgB,QAAZA,EACF,OAAO88D,EAAiB13J,EAAGE,EAAGu3J,GACzB,GAAgB,SAAZ78D,EACT,OAAO88D,EAAiB13J,EAAGE,EAAGxD,GAE9B,MAAM,IAAIiJ,MAAM,2CAGpB,mCAAoC+xJ,IAGtC,SAASA,EAAiB13J,EAAGE,EAAG06F,GAC9B,KAAK,OAAU16F,IAAMA,EAAI,EACvB,MAAM,IAAIyF,MAAM,oCAGlB,IAAI,EAAA27G,EAAA,IAASthH,GAAI,CAGf,GAFWA,EAAE6M,OAEJ5U,OAAS,EAChB,MAAM,IAAI0N,MAAM,2CAGlB,OAAOgyJ,EAAY33J,EAAEvF,UAAWyF,EAAG06F,GAGrC,GAAIxiG,MAAMoF,QAAQwC,GAChB,OAAO23J,EAAY33J,EAAGE,EAAG06F,GAe7B,SAAS+8D,EAAY5/J,EAAKmI,EAAG06F,GAC3B,GAAI16F,GAAKnI,EAAIE,OACX,MAAM,IAAI0N,MAAM,mBAIlB,IAAK,IAAIzN,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9B,GAAI+qI,EAAUlrI,EAAIG,KAAOgK,EAAMnK,EAAIG,IACjC,OAAOH,EAAIG,GAOf,IAHA,IAAI0G,EAAO,EACPyoH,EAAKtvH,EAAIE,OAAS,EAEf2G,EAAOyoH,GAAI,CAKhB,IAJA,IAAIzpG,EAAIhf,EACJsrD,EAAIm9D,EACJuwC,EAAQ7/J,EAAIyH,KAAKiC,MAAMjC,KAAK+4B,UAAY8uF,EAAKzoH,EAAO,IAAMA,GAEvDgf,EAAIssC,GAET,GAAI0wC,EAAQ7iG,EAAI6lB,GAAIg6I,IAAU,EAAG,CAE/B,IAAI/3J,EAAM9H,EAAImyD,GACdnyD,EAAImyD,GAAKnyD,EAAI6lB,GACb7lB,EAAI6lB,GAAK/d,IACPqqD,QAGAtsC,EAKFg9E,EAAQ7iG,EAAI6lB,GAAIg6I,GAAS,KACzBh6I,EAIA1d,GAAK0d,EACPypG,EAAKzpG,EAELhf,EAAOgf,EAAI,EAIf,OAAO7lB,EAAImI,OC1IX,GAAe,CAAC,wBACT23J,IAAkC,QAFlC,QAEgD,IAAer5D,IACxE,IAAI,qBACFkxC,GACElxC,EAsBJ,SAAS0vC,EAAMv7G,GACb,KAAMn5B,gBAAgB00I,GACpB,MAAM,IAAIp3D,YAAY,oDAGxBt9E,KAAKs+J,YAAc,GACnBt+J,KAAKu+J,WAAY,EAEjB,IAAK,IAAI7/J,EAAI,EAAGi2I,EAAKz0I,UAAUzB,OAAQC,EAAIi2I,EAAIj2I,IAAK,CAClD,IAAIa,EAAMW,UAAUxB,GAEpB,IAAI,EAAAopH,EAAA,IAAQvoH,GACVS,KAAKs+J,YAAY98J,KAAKjC,GAEtBS,KAAKu+J,WAAY,OACZ,GAAI3/J,MAAMoF,QAAQzE,KAAQ,EAAAuoH,EAAA,IAASvoH,GAAM,CAE9C,IAAI6Q,EAAIouJ,EAAuBj/J,EAAI0B,WAEnCjB,KAAKs+J,YAAY98J,KAAK4O,GAGtB,IAAIiD,EAAOjD,EAAEiD,OAEO,IAAhBA,EAAK5U,QAA4B,IAAZ4U,EAAK,KAC5BrT,KAAKu+J,WAAY,QAEd,GAAmB,iBAARh/J,EAChBS,KAAKs+J,YAAY98J,KAAKg9J,EAAuB,CAACj/J,SACzC,IAAmB,iBAARA,EAIhB,MAAM,IAAIkB,UAAU,gEAFpBT,KAAKs+J,YAAY98J,KAAKjC,KAe5B,SAASi/J,EAAuBj/J,GAE9B,IAAK,IAAIb,EAAI,EAAGosC,EAAIvrC,EAAId,OAAQC,EAAIosC,EAAGpsC,IACrC,GAAsB,iBAAXa,EAAIb,MAAoB,OAAUa,EAAIb,IAC/C,MAAM,IAAI+B,UAAU,qDAKxB,OAAO,IAAIy1I,EAAqB32I,GAoNlC,OAhOAm1I,EAAM1zI,UAAU8W,KAAO,QACvB48H,EAAM1zI,UAAUwvG,SAAU,EAoB1BkkC,EAAM1zI,UAAUijG,MAAQ,WACtB,IAAIl8F,EAAQ,IAAI2sI,EAGhB,OAFA3sI,EAAMu2J,aAAc,SAAMt+J,KAAKs+J,aAC/Bv2J,EAAMw2J,UAAYv+J,KAAKu+J,UAChBx2J,GAWT2sI,EAAMhxI,OAAS,SAAUy1B,GACvB,IAAIpxB,EAAQ,IAAI2sI,EAEhB,OADAA,EAAMv0I,MAAM4H,EAAOoxB,GACZpxB,GAST2sI,EAAM1zI,UAAUqS,KAAO,WAGrB,IAFA,IAAIA,EAAO,GAEF3U,EAAI,EAAGi2I,EAAK30I,KAAKs+J,YAAY7/J,OAAQC,EAAIi2I,EAAIj2I,IAAK,CACzD,IAAIgR,EAAI1P,KAAKs+J,YAAY5/J,GACzB2U,EAAK3U,GAAkB,iBAANgR,EAAiB,EAAIA,EAAE2D,OAAO,GAGjD,OAAOA,GASTqhI,EAAM1zI,UAAUyO,IAAM,WAGpB,IAFA,IAAI3D,EAAS,GAEJpN,EAAI,EAAGi2I,EAAK30I,KAAKs+J,YAAY7/J,OAAQC,EAAIi2I,EAAIj2I,IAAK,CACzD,IAAI06B,EAAQp5B,KAAKs+J,YAAY5/J,GAC7BoN,EAAOpN,GAAsB,iBAAV06B,EAAqBA,EAAQA,EAAM3pB,MAGxD,OAAO3D,GAST4oI,EAAM1zI,UAAUwxB,IAAM,WAGpB,IAFA,IAAI1mB,EAAS,GAEJpN,EAAI,EAAGi2I,EAAK30I,KAAKs+J,YAAY7/J,OAAQC,EAAIi2I,EAAIj2I,IAAK,CACzD,IAAI06B,EAAQp5B,KAAKs+J,YAAY5/J,GAC7BoN,EAAOpN,GAAsB,iBAAV06B,EAAqBA,EAAQA,EAAM5G,MAGxD,OAAO1mB,GAWT4oI,EAAM1zI,UAAU+b,QAAU,SAAUsmB,GAClC,IAAK,IAAI3kC,EAAI,EAAGi2I,EAAK30I,KAAKs+J,YAAY7/J,OAAQC,EAAIi2I,EAAIj2I,IACpD2kC,EAASrjC,KAAKs+J,YAAY5/J,GAAIA,EAAGsB,OAWrC00I,EAAM1zI,UAAU68I,UAAY,SAAUrK,GACpC,OAAOxzI,KAAKs+J,YAAY9qB,IAAQ,MAQlCkB,EAAM1zI,UAAUy4H,iBAAmB,WACjC,OAAmC,IAA5Bz5H,KAAKs+J,YAAY7/J,QAA+C,iBAAxBuB,KAAKs+J,YAAY,IASlE5pB,EAAM1zI,UAAU04H,kBAAoB,WAClC,OAAO15H,KAAKy5H,mBAAqBz5H,KAAKs+J,YAAY,GAAK,MAYzD5pB,EAAM1zI,UAAUy8I,SAAW,WACzB,OAAOz9I,KAAKu+J,WAUd7pB,EAAM1zI,UAAU+yI,QAAU,WAGxB,IAFA,IAAIhuI,EAAQ,GAEHrH,EAAI,EAAGi2I,EAAK30I,KAAKs+J,YAAY7/J,OAAQC,EAAIi2I,EAAIj2I,IAAK,CACzD,IAAIm/I,EAAY79I,KAAKs+J,YAAY5/J,GACjCqH,EAAMvE,KAA0B,iBAAdq8I,EAAyBA,EAAYA,EAAU9J,WAGnE,OAAOhuI,GAUT2uI,EAAM1zI,UAAUC,QAAUyzI,EAAM1zI,UAAU+yI,QAO1CW,EAAM1zI,UAAUyE,SAAW,WAGzB,IAFA,IAAIb,EAAU,GAELlG,EAAI,EAAGi2I,EAAK30I,KAAKs+J,YAAY7/J,OAAQC,EAAIi2I,EAAIj2I,IAAK,CACzD,IAAIm/I,EAAY79I,KAAKs+J,YAAY5/J,GAER,iBAAdm/I,EACTj5I,EAAQpD,KAAKoK,KAAKC,UAAUgyI,IAE5Bj5I,EAAQpD,KAAKq8I,EAAUp4I,YAI3B,MAAO,IAAMb,EAAQwsB,KAAK,MAAQ,KAUpCsjH,EAAM1zI,UAAUkgG,OAAS,WACvB,MAAO,CACLgoB,OAAQ,QACRiR,WAAYn6H,KAAKs+J,cAYrB5pB,EAAMvrB,SAAW,SAAUhiB,GACzB,OAAOutC,EAAMhxI,OAAOyjG,EAAKgzB,aAGpBua,IACN,CACD/rB,SAAS,ICzSP,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvC81C,IAA6B,QAAQ,GAAM,IAAez5D,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACN80D,EACAmuD,UAAW0X,GACTv+C,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,GAAIA,GAAK,GAAKA,IAAM,GAAKoiB,EAAOi+F,YAAa,CAC3C,IAAIihC,EAAO,EAAIthJ,EAEf,GAAIshJ,EAAO,GAAKl/H,EAAOi+F,YACrB,OAAOmhC,GAAYxhJ,GAGrB,IAAIwB,EAAMhC,KAAKC,KAAK6hJ,EAAOA,EAAO,GAClC,OAAO,IAAIpqE,EAAQ13E,KAAKiF,IAAIjD,EAAM8/I,GAAO9hJ,KAAKsO,IAGhD,OAAO,IAAIopE,EAAQl3E,EAAG,GAAG+pH,SAE3B7yC,QAAS,SAAiBl3E,GACxB,OAAOA,EAAE+pH,SAEXsb,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,GAAGs4E,SAElC,iBAAkB,SAAqBt4E,GACrC,OAAO,SAAQA,EAAGxG,YCrDpB,GAAe,CAAC,SACT0+J,IAA2B,QAF3B,MAEyC,IAAe15D,IACjE,IAAI,MACFyzB,GACEzzB,EAyBJ,OAAOyzB,EA9BE,MA8BU,CACjB9vH,OAAQ3C,KAAKw5F,IACb9hB,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEg5F,OAEXqsC,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEg5F,OAEXg8B,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,oCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAGxG,MAAM,SC/C1B,GAAO,gBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/D2+J,IAAqC,QAAQ,GAAM,IAAe35D,IAC3E,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJg7D,EAAM,eACN+5D,EAAc,MACdsM,EAAK,YACLsB,GACEhxC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,iCAAkC,SAAgCyS,EAAI0zB,GACpE,IAAIpzI,EAEJ,GAAuC,IAAnC6iD,EAAOh7D,EAAK63H,GAAK,IAAIwJ,EAAM,IAE7BlpH,EAAS,OACJ,IAAuC,IAAnC6iD,EAAOh7D,EAAKurJ,GAAK,IAAIlqB,EAAM,IAEpC,OAAO,SAAQxJ,EAAG6I,WAElB,IAGI8qB,EAHAC,GAAK,UAAS,SAAQlgK,MAAMoF,QAAQknI,GAAMA,EAAKA,EAAG6I,WAAWjsI,KAAKsgI,IAClE22B,GAAK,UAAS,SAAQngK,MAAMoF,QAAQ46J,GAAMA,EAAKA,EAAG7qB,WAAWjsI,KAAKsgI,IACtE58G,EAAS,GAGT,IAAK,IAAI9sB,EAAI,EAAGA,EAAIogK,EAAGrgK,OAAQC,IAAK,CAClCmgK,GAAO,EAEP,IAAK,IAAIr3J,EAAI,EAAGA,EAAIu3J,EAAGtgK,OAAQ+I,IAC7B,GAAiD,IAA7C4gI,EAAe02B,EAAGpgK,GAAGe,MAAOs/J,EAAGv3J,GAAG/H,QAAgBq/J,EAAGpgK,GAAGu0H,aAAe8rC,EAAGv3J,GAAGyrH,WAAY,CAE3F4rC,GAAO,EACP,MAICA,GACHrzI,EAAOhqB,KAAKs9J,EAAGpgK,KAMrB,OAAIE,MAAMoF,QAAQknI,IAAOtsI,MAAMoF,QAAQ46J,IAC9B,SAAWpzI,GAIb,IAAIwqH,GAAY,SAAWxqH,UCxEpC,GAAO,eACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/DwzI,IAAoC,QAAQ,GAAM,IAAeh6D,IAC1E,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJg7D,EAAM,eACN+5D,EAAc,MACdsM,EAAK,YACLsB,GACEhxC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,iCAAkC,SAAgCyS,EAAI0zB,GACpE,IAAIpzI,EAEJ,GAAuC,IAAnC6iD,EAAOh7D,EAAK63H,GAAK,IAAIwJ,EAAM,KAAgD,IAAnCrmE,EAAOh7D,EAAKurJ,GAAK,IAAIlqB,EAAM,IAErElpH,EAAS,OACJ,CACL,IAAIszI,GAAK,UAAS,SAAQlgK,MAAMoF,QAAQknI,GAAMA,EAAKA,EAAG6I,WAAWjsI,KAAKsgI,IAClE22B,GAAK,UAAS,SAAQngK,MAAMoF,QAAQ46J,GAAMA,EAAKA,EAAG7qB,WAAWjsI,KAAKsgI,IACtE58G,EAAS,GAET,IAAK,IAAI9sB,EAAI,EAAGA,EAAIogK,EAAGrgK,OAAQC,IAC7B,IAAK,IAAI8I,EAAI,EAAGA,EAAIu3J,EAAGtgK,OAAQ+I,IAC7B,GAAiD,IAA7C4gI,EAAe02B,EAAGpgK,GAAGe,MAAOs/J,EAAGv3J,GAAG/H,QAAgBq/J,EAAGpgK,GAAGu0H,aAAe8rC,EAAGv3J,GAAGyrH,WAAY,CAE3FznG,EAAOhqB,KAAKs9J,EAAGpgK,IACf,OAOR,OAAIE,MAAMoF,QAAQknI,IAAOtsI,MAAMoF,QAAQ46J,IAC9B,SAAWpzI,GAIb,IAAIwqH,GAAY,SAAWxqH,UC9DpC,GAAO,kBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,SACtDyzI,IAAuC,QAAQ,GAAM,IAAej6D,IAC7E,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJg7D,EAAM,eACN+5D,EAAc,MACdsM,GACE1vC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,0DAA2D,SAAmDt3H,EAAGI,GAC/G,GAAsC,IAAlC8sE,EAAOh7D,EAAK9R,GAAI,IAAImzI,EAAM,IAE5B,OAAO,EAMT,IAHA,IAAIhtI,GAAI,SAAQ9I,MAAMoF,QAAQzC,GAAKA,EAAIA,EAAEwyI,WACrCn6D,EAAQ,EAEHl7E,EAAI,EAAGA,EAAIgJ,EAAEjJ,OAAQC,IACI,IAA5B0pI,EAAe1gI,EAAEhJ,GAAIyC,IACvBy4E,IAIJ,OAAOA,QChDT,GAAO,UACP,GAAe,CAAC,QAAS,kBAClBslF,IAA+B,QAAQ,GAAM,IAAel6D,IACrE,IAAI,MACFyzB,EAAK,eACL2P,GACEpjC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAqBl3H,GACrC,OAAO3C,MAAMoF,QAAQzC,IAAK,SAAQA,GAAG9C,QAAS,SAAQ8C,EAAEwyI,WAAWt1I,QAErE,0BAA2B,SAA4B8C,EAAGwtI,GACxD,IAAe,IAAXA,GAAiC,IAAbxtI,EAAE9C,OACxB,OAAOG,MAAMoF,QAAQzC,IAAK,SAAQA,GAAG9C,QAAS,SAAQ8C,EAAEwyI,WAAWt1I,OAKnE,IAHA,IAAIiJ,GAAI,SAAQ9I,MAAMoF,QAAQzC,GAAKA,EAAIA,EAAEwyI,WAAWjsI,KAAKsgI,GACrDxuD,EAAQ,EAEHl7E,EAAI,EAAGA,EAAIgJ,EAAEjJ,OAAQC,IACW,IAAnC0pI,EAAe1gI,EAAEhJ,GAAIgJ,EAAEhJ,EAAI,KAC7Bk7E,IAIJ,OAAOA,QC5CX,GAAe,CAAC,QAAS,SAAU,OAC5BulF,IAA6B,QAF7B,QAE2C,IAAen6D,IACnE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,IACNpoD,GACEy4F,EA6BJ,OAAOyzB,EAAM,QAAS,CACpB75H,MAAO,SAAqB4H,GAE1B,OAAO44J,EAAYzqG,EAAOnuD,KAE5ByvI,aA+CF,SAAsB7lI,GAEpB,IAAItE,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KACR95I,EAAOjD,EAAEktI,MAET99H,EAAOnM,EAAK,GACZ42B,EAAU52B,EAAK,GAEnB,GAAImM,IAASyqB,EAAS,CAEpB,IAAI7iC,EAAM,EAEV,GAAI0E,EAAOrN,OAAS,EAElB,IAAK,IAAI+I,EAAI,EAAGA,EAAIyiC,EAASziC,IAK3B,IAHA,IAAIkoF,EAAK49D,EAAI9lJ,GACTuoF,EAAKu9D,EAAI9lJ,EAAI,GAERd,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE5B,IAAIhI,EAAIqJ,EAAMrB,GAEd,GAAIhI,IAAM8I,EAAG,CAEXJ,EAAMmF,EAAInF,EAAK0E,EAAOpF,IAEtB,MAGF,GAAIhI,EAAI8I,EAEN,MAOR,OAAOJ,EAGT,MAAM,IAAI+pJ,WAAW,iCAAkC,SAAO99I,GAAQ,MA1FtE2iI,YAAaopB,EACbhmC,IAAK,QAGP,SAASgmC,EAAYhvJ,GAEnB,IAAIiD,EAAOjD,EAAEktI,MACTzlI,EAAOzH,EAAEqW,MAEb,OAAQpT,EAAK5U,QACX,KAAK,EAEH,GAAgB,IAAZ4U,EAAK,GAEP,OAAO,SAAMwE,EAAK,IAGpB,MAAM,IAAIs5I,WAAW,iCAAkC,SAAO99I,GAAQ,KAExE,KAAK,EAGD,IAAImM,EAAOnM,EAAK,GAGhB,GAAImM,IAFOnM,EAAK,GAEG,CAIjB,IAFA,IAAIjM,EAAM,EAED1I,EAAI,EAAGA,EAAI8gB,EAAM9gB,IACxB0I,EAAMmF,EAAInF,EAAKyQ,EAAKnZ,GAAGA,IAIzB,OAAO0I,EAEP,MAAM,IAAI+pJ,WAAW,iCAAkC,SAAO99I,GAAQ,KAI5E,QAEE,MAAM,IAAI89I,WAAW,0CAA2C,SAAO99I,GAAQ,UClFnF,GAAe,CAAC,QAAS,MAAO,WAAY,kBAAmB,WACxDgsJ,IAAmC,QAFnC,cAEiD,IAAer6D,IACzE,IAAI,MACFyzB,EAAK,IACLlsH,EAAG,SACHiY,EAAQ,gBACRkjH,EAAe,QACftmC,GACE4D,EAkKJ,SAASs6D,EAAav5J,EAAOw5J,EAAM33J,GACjC,IAAIknJ,GAAO,SAAQ/oJ,GACfvH,EAAMswJ,EAAKrwJ,OAEf,GAAY,IAARD,EACF,MAAM,IAAI2N,MAAM,kDAGlB,IAAI,EAAA27G,EAAA,IAASy3C,GAAO,CAClB,IAAIrS,EAASqS,GAAQ/gK,EAAM,GAEvBghK,EAAYtS,EAAS,EAEzB,GAAkB,IAAdsS,EAAiB,CACnB,IAAI//J,EAAQmI,EAASknJ,EAAK5B,GAAUxlB,EAAgBonB,EAAM5B,GAE1D,OADAuS,EAAShgK,GACFA,EAGT,IAEIigK,EAEAC,EAJAC,EAAe55J,KAAKiC,MAAMilJ,GAM9B,GAAItlJ,EACF83J,EAAQ5Q,EAAK8Q,GACbD,EAAS7Q,EAAK8Q,EAAe,OACxB,CACLD,EAASj4B,EAAgBonB,EAAM8Q,EAAe,GAE9CF,EAAQ5Q,EAAK8Q,GAEb,IAAK,IAAIlhK,EAAI,EAAGA,EAAIkhK,IAAgBlhK,EAC9B0iG,EAAQ0tD,EAAKpwJ,GAAIghK,GAAS,IAC5BA,EAAQ5Q,EAAKpwJ,IAQnB,OAHA+gK,EAASC,GACTD,EAASE,GAEFpzJ,EAAIiY,EAASk7I,EAAO,EAAIF,GAAYh7I,EAASm7I,EAAQH,IAI9D,IAAIz3J,EAAQw3J,EAAK3pJ,MAAMpX,EAAM,GAE7B,GAAIuJ,EAAMuxD,YAAa,CACrBvxD,EAAQA,EAAMy4F,WAEd,IAAI0+C,EAASt3I,EAASknJ,EAAK/mJ,GAAS2/H,EAAgBonB,EAAM/mJ,GAG1D,OADA03J,EAASvgB,GACFA,EAGT,IAGI7oI,EACAC,EAJAuqI,EAAc94I,EAAME,QACpB43J,EAAW93J,EAAMiL,MAAM6tI,GACvBif,EAAoBjf,EAAYrgD,WAIpC,GAAI54F,EACFyO,EAAOy4I,EAAKgR,GACZxpJ,EAAQw4I,EAAKgR,EAAoB,OAC5B,CACLxpJ,EAAQoxH,EAAgBonB,EAAMgR,EAAoB,GAElDzpJ,EAAOy4I,EAAKgR,GAEZ,IAAK,IAAI/Q,EAAM,EAAGA,EAAM+Q,IAAqB/Q,EACvC3tD,EAAQ0tD,EAAKC,GAAM14I,GAAQ,IAC7BA,EAAOy4I,EAAKC,IAKlB0Q,EAASppJ,GACTopJ,EAASnpJ,GAET,IAAIgmF,EAAM,IAAIujE,EAASl8J,YAAY,GACnC,OAAO4I,EAAIiY,EAASnO,EAAMimF,EAAItpF,MAAM6sJ,IAAYr7I,EAASlO,EAAOupJ,IAUlE,IAAIJ,EAAWhnC,EAAM,CACnB,4BAA6B,SAA6BjyH,GACxD,OAAOA,KAGX,OAhOA,SAAqBqR,EAAMkoJ,EAASn4J,GAClC,IAAIo4J,EAASC,EAAS3jE,EAEtB,GAAIp8F,UAAUzB,OAAS,GAAKyB,UAAUzB,OAAS,EAC7C,MAAM,IAAI6+E,YAAY,yDAGxB,IAAI,EAAAwqC,EAAA,IAAajwG,GAAO,CAGtB,GAAsB,kBAFtBjQ,EAASA,IAAU,GAEc,CAG/B,GAFAq4J,EAAUpoJ,EAAK5W,WAEX,EAAA6mH,EAAA,IAASi4C,GAAU,CACrB,GAAIA,EAAU,EACZ,MAAM,IAAI5zJ,MAAM,+BAGlB,GAAI4zJ,GAAW,EAEb,OAAOT,EAAaW,EAASF,EAASn4J,GAGxC,GAAIm4J,EAAU,EAAG,CAEf,KAAK,OAAUA,GACb,MAAM,IAAI5zJ,MAAM,gCAGlB,IAAI+zJ,EAAWH,EAAU,EACzBC,EAAU,IAAIphK,MAAMmhK,GAEpB,IAAK,IAAIrhK,EAAI,EAAGA,EAAIqhK,GAClBC,EAAQthK,GAAK4gK,EAAaW,IAAWvhK,EAAIwhK,EAAUt4J,GAGrD,OAAOo4J,GAIX,IAAI,EAAAl4C,EAAA,IAAYi4C,GAAU,CACxB,IAAIl0B,EAAYk0B,EAAQp8J,YAExB,GAAIo8J,EAAQhiE,aACV,MAAM,IAAI5xF,MAAM,+BAKlB,GAFAmwF,EAAM,IAAIuvC,EAAU,GAEhBk0B,EAAQ1iE,IAAIf,GAEd,OAAO,IAAIuvC,EAAUyzB,EAAaW,EAASF,EAASn4J,IAGtD,GAAIm4J,EAAQ7jE,GAAGI,GAAM,CAEnB,IAAKyjE,EAAQzmG,YACX,MAAM,IAAIntD,MAAM,gCAKlB,IAAIg0J,EAAOJ,EAAQv/D,WAEnB,GAAI2/D,EAAO,WACT,MAAM,IAAIh0J,MAAM,qFAGlB,IAAIi0J,EAAY,IAAIv0B,EAAUs0B,EAAO,GAErCH,EAAU,IAAIphK,MAAMuhK,GAEpB,IAAK,IAAI37J,EAAK,EAAGA,EAAK27J,GACpBH,EAAQx7J,GAAM,IAAIqnI,EAAUyzB,EAAaW,EAAS,IAAIp0B,IAAYrnI,GAAIq3F,IAAIukE,GAAYx4J,IAGxF,OAAOo4J,GAIX,GAAIphK,MAAMoF,QAAQ+7J,GAAU,CAE1BC,EAAU,IAAIphK,MAAMmhK,EAAQthK,QAE5B,IAAK,IAAIizI,EAAM,EAAGA,EAAMsuB,EAAQvhK,SAAUizI,EAAK,CAC7C,IAAI2uB,EAAWN,EAAQruB,GAEvB,IAAI,EAAA5pB,EAAA,IAASu4C,IACX,GAAIA,EAAW,GAAKA,EAAW,EAC7B,MAAM,IAAIl0J,MAAM,sDAEb,MAAI,EAAA27G,EAAA,IAAYu4C,GAOrB,MAAM,IAAI5/J,UAAU,uDAJpB,GAFA67F,EAAM,IAAI+jE,EAAS18J,YAAY,GAE3B08J,EAAStiE,cAAgBsiE,EAASnkE,GAAGI,GACvC,MAAM,IAAInwF,MAAM,kDAMpB6zJ,EAAQtuB,GAAO4tB,EAAaW,EAASI,EAAUz4J,GAGjD,OAAOo4J,EAGT,MAAM,IAAIv/J,UAAU,uDAGtB,MAAM,IAAIA,UAAU,uDAGtB,MAAM,IAAIA,UAAU,2DC/JjB,SAAS6/J,GAAY96J,GAC1B,IAAIgB,EAEJ,IAAI,OAAUhB,GACZ,OAAIA,GAAK,EACAo8D,SAASp8D,GAAK64E,IAAWY,IAG9Bz5E,EAAI,IACC64E,IAGFmrE,GAAQ,EAAGhkJ,EAAI,GAGxB,GAAIA,EAAI,GACN,OAAOQ,KAAKsO,IAAMtO,KAAK6O,IAAI7O,KAAKsO,GAAK9O,GAAK86J,GAAY,EAAI96J,IAG5D,GAAIA,GAAK,OACP,OAAO64E,IAGT,GAAI74E,EAAI,GAAM,CAEZ,IAAI+6J,EAAO/6J,EAAIA,EACXg7J,EAASD,EAAO/6J,EAChBi7J,EAAQD,EAASh7J,EACjBk7J,EAAQD,EAAQj7J,EACpB,OAAOQ,KAAKC,KAAK,EAAID,KAAKsO,GAAK9O,GAAKQ,KAAK2B,IAAInC,EAAIQ,KAAKg5E,EAAGx5E,IAAM,EAAI,GAAK,GAAKA,GAAK,GAAK,IAAM+6J,GAAQ,KAAO,MAAQC,GAAU,KAAO,QAAUC,GAAS,QAAU,UAAYC,GAAS,SAAW,YAAcA,EAAQl7J,MAGxNA,EACFgB,EAAIm6J,GAAO,GAEX,IAAK,IAAIjiK,EAAI,EAAGA,EAAIiiK,GAAOliK,SAAUC,EACnC8H,GAAKm6J,GAAOjiK,IAAM8G,EAAI9G,GAGxB,IAAIqrB,EAAIvkB,EAAIo7J,GAAS,GACrB,OAAO56J,KAAKC,KAAK,EAAID,KAAKsO,IAAMtO,KAAK2B,IAAIoiB,EAAGvkB,EAAI,IAAOQ,KAAKoD,KAAK2gB,GAAKvjB,EAExE85J,GAAYvnC,UAAY,SAEjB,IAAI6nC,GAAS,UACTD,GAAS,CAAC,kBAAwB,mBAAwB,kBAAuB,oBAAwB,kBAAwB,qBAA2B,sBAA4B,qBAA2B,sBAA4B,sBAA2B,uBAA4B,qBAA2B,sBAA4B,sBAA2B,uBC7C/X,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,iBAAkB,MAAO,YAAa,WAClEE,IAA6B,QAAQ,GAAM,IAAe77D,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,eACN+sH,EAAc,IACdhuI,EACAkkI,UAAW0X,EACX7lE,QAASwlE,GACPl+C,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ23J,GACR5iF,QAAS,SAAiBl4E,GACxB,GAAa,IAATA,EAAEs4E,GACJ,OAAO99E,KAAKwF,EAAEu0B,IAGhBv0B,EAAI,IAAI09I,EAAS19I,EAAEu0B,GAAK,EAAGv0B,EAAEs4E,IAG7B,IAFA,IAAIt3E,EAAI,IAAI08I,EAASyd,GAAO,GAAI,GAEvBjiK,EAAI,EAAGA,EAAIiiK,GAAOliK,SAAUC,EAAG,CACtC,IAAIoiK,EAAOt7J,EAAEu0B,GAAKr7B,EAEdqiK,EAAMD,EAAOA,EAAOt7J,EAAEs4E,GAAKt4E,EAAEs4E,GAErB,IAARijF,GACFv6J,EAAEuzB,IAAM4mI,GAAOjiK,GAAKoiK,EAAOC,EAC3Bv6J,EAAEs3E,KAAQ6iF,GAAOjiK,GAAK8G,EAAEs4E,GAAMijF,GAE9Bv6J,EAAEuzB,GAAK4mI,GAAOjiK,GAAK,GAAI,IAAY2/E,IAIvC,IAAIt0D,EAAI,IAAIm5H,EAAS19I,EAAEu0B,GAAK6mI,GAAS,GAAKp7J,EAAEs4E,IACxCkjF,EAAYh7J,KAAKC,KAAK,EAAID,KAAKsO,IACnC9O,EAAEu0B,IAAM,GACR,IAAIvO,EAAS7jB,EAAIoiB,EAAGvkB,GAEF,IAAdgmB,EAAOsyD,GAETtyD,EAAOuO,IAAMinI,GACU,IAAdx1I,EAAOuO,KAGhBvO,EAAOuO,IAAMinI,GAFbx1I,EAAOsyD,IAAMkjF,GAMf,IAAI58I,EAAIpe,KAAKoD,KAAK2gB,EAAEgQ,IAIpB,OAFAhQ,EAAEgQ,GAAK3V,EAAIpe,KAAK2O,KAAKoV,EAAE+zD,IACvB/zD,EAAE+zD,GAAK15D,EAAIpe,KAAK6O,KAAKkV,EAAE+zD,IAChB63D,EAAeA,EAAenqH,EAAQzB,GAAIvjB,IAEnDqlI,UAAW,SAAmBrmI,GAC5B,GAAIA,EAAE8zD,YACJ,OAAO9zD,EAAEu4F,cAAgBv4F,EAAE81F,SAAW,IAAIioD,EAAWllE,KAAY4iF,EAAaz7J,EAAEwN,MAAM,IAGxF,IAAKxN,EAAEo8D,WACL,OAAO,IAAI2hF,EAAW/9I,EAAEu4F,aAAe9e,IAAMZ,KAG/C,MAAM,IAAIlyE,MAAM,+BAElB,iBAAkB,SAAqB3G,GACrC,OAAO,SAAQA,EAAGxF,SAStB,SAASihK,EAAaz7J,GACpB,GAAIA,EAAI,EACN,OAAO,IAAI+9I,EAAW,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,IAAK,IAAK,MAAM/9I,IAGzD,IAAImyF,EAAY/uE,EAAO+uE,WAAsC,EAAzB3xF,KAAKiF,IAAIzF,EAAEg7F,aAE3C2zD,EAAM5Q,EAAWt/C,MAAM,CACzBtM,UAAWA,IAGb,GAAInyF,EAAI,GAAM,EACZ,OAAOA,EAAEoQ,MAAMqrJ,EAAa,IAAI1d,EAAW/9I,EAAI,KAOjD,IAJA,IAAI1B,EAAI0B,EACJk8F,EAAO,IAAIyyD,EAAI3uJ,GACf4B,EAAM5B,EAAEg7F,WAEL18F,EAAI,GAETsD,GADAtD,GAAK,EAEL49F,EAAOA,EAAK9rF,MAAMxO,GAGpB,OAAO,IAAIm8I,EAAW7hD,EAAKb,YAAY0iD,EAAW5rD,gBC7HlD,GAAe,CAAC,QAAS,aAClBupE,IAAiC,QAFjC,YAE+C,IAAel8D,IACvE,IAAI,MACFyzB,EAAK,UACLoT,GACE7mC,EA2BJ,OAAOyzB,EAAM,YAAa,CACxB,GAAI,WACF,OAAO,IAAIoT,EAAU,IAEvBljI,OAAQ,SAAgBnC,GAEtB,OAAO,IAAIqlI,EAAUrlI,EAAI,KAE3B0zG,OAAQ,SAAgB1zG,GACtB,IAAIw6I,EAAsBx6I,EAAEo3E,MAAM,iCAElC,GAAIojE,EAAqB,CAEvB,IAAI3tI,EAAO2tI,EAAoB,GAC3Bx7I,EAAIqmI,EAAUmV,EAAoB,IAClCmgB,EAAa,IAAIt1B,EAAU,GAAGlkI,IAAIE,OAAOwL,IAE7C,GAAI7N,EAAE02F,GAAGilE,EAAWziE,IAAI,IACtB,MAAM,IAAIphB,YAAY,WAAY5xE,OAAOlF,EAAG,sBAG9C,IAAI46J,EAAmB,IAAIv1B,EAAU,GAAGlkI,IAAIE,OAAOwL,GAAQ,GAE3D,OAAI7N,EAAE42F,IAAIglE,GACD57J,EAAEk5F,IAAIyiE,GAEN37J,EAIX,OAAO,IAAIqmI,EAAUrlI,IAEvBqlI,UAAW,SAAmBrlI,GAE5B,OAAOA,GAETs/F,SAAU,SAAkBt/F,GAC1B,OAAO,IAAIqlI,EAAUrlI,EAAEhB,GAAGq2F,IAAIr1F,EAAEkJ,GAAGkG,MAAMpP,EAAEu/B,IAE7Cw3F,KAAM,SAAe/2H,GACnB,OAAO,IAAIqlI,EAAU,IAEvB,iBAAkB,SAAqBrlI,GACrC,OAAO,SAAQA,EAAGxG,YCtEpB,GAAe,CAAC,QAAS,SAAU,eAC5BqhK,IAA2B,QAF3B,MAEyC,IAAer8D,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,GACE1wC,EACAyuD,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEse,EAAcF,GAAkB,CAClCr7B,QACAid,gBAEEke,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAgCF,OAAOA,EAxDE,MAwDU,CACjB,iBAAkBypB,GAClB,uBAmEF,SAAuB3gJ,EAAGmG,GACxB,IAAKnG,EAAEu8F,UAAYp2F,EAAEo2F,QACnB,MAAM,IAAI3xF,MAAM,sDAGlB,GAAI5K,EAAE+5F,SACJ,OAAO/5F,EAGT,GAAImG,EAAE4zF,SACJ,OAAO5zF,EAOT,IAFA,IAAIg6F,EAAOngG,EAAEqU,MAAMlO,IAEXA,EAAE4zF,UAAU,CAClB,IAAIvxE,EAAIriB,EACRA,EAAInG,EAAEu9F,IAAI/0E,GACVxoB,EAAIwoB,EAGN,OAAO23E,EAAK7F,IAAIt6F,GAAGyI,OAzFnB,qBAAsB,SAA0BxD,EAAGe,GACjD,OAAOf,EAAEwgI,IAAIz/H,IAEf,6BAA8B,SAAkCf,EAAGe,GACjE,OAAOysJ,EAAYxtJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYjtJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,mCAAoC,SAAqCf,EAAGe,GAC1E,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,mCAAoC,SAAqCwG,EAAGe,GAC1E,OAAOqsJ,EAAYrsJ,EAAGf,EAAGxG,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAA8BwG,EAAGe,GAE5D,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,4BAA6B,SAA8BuF,EAAGe,GAE5D,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,WAG/C,mHAAoH,SAAwFM,EAAGmG,EAAGzH,GAGhN,IAFA,IAAIwyE,EAAMzyE,KAAKuB,EAAGmG,GAEThJ,EAAI,EAAGA,EAAIuB,EAAKxB,OAAQC,IAC/B+zE,EAAMzyE,KAAKyyE,EAAKxyE,EAAKvB,IAGvB,OAAO+zE,QCjHT,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3C6uF,IAA6B,QAAQ,GAAM,IAAet8D,IACnE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,YACXM,GACEhxC,EACA0tD,EAAclC,GAAkB,CAClC/3B,UAEEk6B,EAAcpB,GAAkB,CAClC94B,QACAid,gBAEEkd,EAAcZ,GAAkB,CAClCv5B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkB0sB,GAClB,uBAAwBrB,GACxB,6BAA8B,SAAkCt9I,EAAGe,GACjE,OAAOorJ,EAAYnsJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmrJ,EAAYnrJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmrJ,EAAYlsJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqrJ,EAAYpsJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOqrJ,EAAYrrJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCrG/C,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,kBAC5BsgK,IAA4B,QAAQ,GAAM,IAAev8D,IAClE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,eACNghF,GACE3wC,EA6BJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAsBjyH,EAAGe,GACzC,OAAOotD,EAAO6sG,EAAMh7J,EAAEutI,UAAWxsI,EAAEwsI,aAErC,gBAAiB,SAAqBvtI,EAAGe,GACvC,OAAOotD,EAAO6sG,EAAMh7J,EAAEutI,UAAWxsI,KAEnC,gBAAiB,SAAqBf,EAAGe,GACvC,OAAOotD,EAAO6sG,EAAMh7J,EAAGe,EAAEwsI,aAE3B,eAAgBytB,IAUlB,SAASA,EAAMjgK,EAAGmG,GAYhB,GAVuB,KAAnB,SAAKnG,GAAG9C,SAEV8C,EAAI,CAACA,IAGgB,KAAnB,SAAKmG,GAAGjJ,SAEViJ,EAAI,CAACA,KAGH,SAAKnG,GAAG9C,OAAS,IAAK,SAAKiJ,GAAGjJ,OAAS,EACzC,MAAM,IAAI0yJ,WAAW,+EAAsFvlJ,KAAKC,UAAUtK,EAAE9C,QAAU,SAAWmN,KAAKC,UAAUnE,EAAEjJ,QAAU,KAG9K,IAAIsrB,EAAI,GACJ3F,EAAI,GACR,OAAO7iB,EAAE+F,KAAI,SAAU/F,GACrB,OAAOmG,EAAEJ,KAAI,SAAUI,GAGrB,OAFA0c,EAAI,GACJ2F,EAAEvoB,KAAK4iB,GACA7iB,EAAE+F,KAAI,SAAUC,GACrB,OAAOG,EAAEJ,KAAI,SAAUd,GACrB,OAAO4d,EAAE5iB,KAAKm0I,EAAepuI,EAAGf,iBAIlCujB,MClFN,GAAe,CAAC,QAAS,UAClB03I,IAAiC,QAFjC,YAE+C,IAAez8D,IACvE,IAAI,MACFyzB,EAAK,OACL9jE,GACEqwC,EAwBJ,OAAOyzB,EAAM,YAAa,CACxB75H,MAAO,SAAe4H,GAEpB,OAAOxG,KAAK20D,EAAOnuD,IAAIvF,WAEzB80I,OAAQ,SAAgBvvI,GAEtB,IAEIkG,EAFA2G,EAAO7M,EAAE6M,OAIb,OAAQA,EAAK5U,QACX,KAAK,EAEHiO,EAAIlG,EAAEy9F,QACN,MAEF,KAAK,EAGD,IAAIzkF,EAAOnM,EAAK,GACZ42B,EAAU52B,EAAK,GAEnB,GAAgB,IAAZ42B,EAEF,MAAM,IAAIknH,WAAW,wDAAyD,SAAO99I,GAAQ,KAI/F,OAAQ7M,EAAEkzI,WACR,IAAK,QACHhtI,EAuBd,SAAyB0D,EAAGoP,EAAMyqB,GAOhC,IALA,IAGIy3H,EAHA7pJ,EAAOzH,EAAEqW,MAETk7I,EAAa,GAGRn6J,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAEhCk6J,EAAgBC,EAAWn6J,GAAK,GAEhC,IAAK,IAAI9I,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAExBgjK,EAAchjK,IAAK,SAAMmZ,EAAKnZ,GAAG8I,IAKrC,OAAO4I,EAAEouI,kBAAkB,CACzB3mI,KAAM8pJ,EACNtuJ,KAAM,CAAC42B,EAASzqB,GAChBxH,SAAU5H,EAAEmtI,YA5CEqkB,CAAgBp7J,EAAGgZ,EAAMyqB,GAC7B,MAEF,IAAK,SACHv9B,EA4Cd,SAA0B0D,EAAGoP,EAAMyqB,GAYjC,IAVA,IAeInmC,EAAGgnC,EAAGtjC,EAfNsE,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KAERwE,EAAU7lJ,EAAS,QAAKzL,EACxByrE,EAAS,GACT8lF,EAAO,GAEPlhG,EAAI,GAEClqD,EAAI,EAAGA,EAAIgZ,EAAMhZ,IACxBkqD,EAAElqD,GAAK,EAMT,IAAK1C,EAAI,EAAGgnC,EAAI/iC,EAAMtJ,OAAQqF,EAAIgnC,EAAGhnC,IAEnC4sD,EAAE3oD,EAAMjE,MAMV,IAFA,IAAIsD,EAAM,EAED1I,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAExBkzJ,EAAKpwJ,KAAK4F,GAEVA,GAAOspD,EAAEhyD,GAETgyD,EAAEhyD,GAAKkzJ,EAAKlzJ,GAMd,IAFAkzJ,EAAKpwJ,KAAK4F,GAELI,EAAI,EAAGA,EAAIyiC,EAASziC,IAEvB,IAAK,IAAIkoF,EAAK49D,EAAI9lJ,GAAIuoF,EAAKu9D,EAAI9lJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAAK,CAE1D,IAAIq4F,EAAIruC,EAAE3oD,EAAMrB,MAEhBolE,EAAOizB,GAAKv3F,EAERsE,IACF6lJ,EAAQ5yD,IAAK,SAAMjzF,EAAOpF,KAMhC,OAAO0J,EAAEk+I,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAAC42B,EAASzqB,GAChBxH,SAAU5H,EAAEmtI,YAvGEskB,CAAiBr7J,EAAGgZ,EAAMyqB,GAIpC,MAEF,QAEE,MAAM,IAAIknH,WAAW,sDAAuD,SAAOnxJ,KAAKs9I,OAAS,KAGrG,OAAO5wI,GAGT0sH,IAAK,SAAa5yH,GAChB,OAAO,SAAMA,SC/Ef,GAAe,CAAC,SAAU,aAAc,aACjCs7J,IAA+B,QAF/B,UAE6C,IAAe98D,IACrE,IACEr8F,OAAQo5J,EAAO,UACfhxC,EAAS,SACT8R,GACE79B,EACAg9D,EAAkB,CACpB9nD,QAAQ,EACRvxG,QAAQ,EACRkjI,WAAW,EACX/lC,UAAU,GAGRm8D,EAAmB,CACrBt5J,OAAQnC,GAAKu7J,EAAQv7J,GACrBqlI,UAAW9a,EAAYvqH,GAAKuqH,EAAUvqH,GAAK,MAC3Cs/F,SAAU+8B,EAAWr8H,GAAKq8H,EAASr8H,GAAK,OA+B1C,OAAO,SAAiB/G,EAAOyiK,GAC7B,IAAIC,GAAY,QAAO1iK,GAEvB,KAAM0iK,KAAaH,GACjB,MAAM,IAAIvhK,UAAU,kBAAoBhB,EAAQ,aAAe0iK,EAAY,4BAA8BhgK,OAAOsE,KAAKu7J,GAAiB5wI,KAAK,OAG7I,KAAM8wI,KAAcD,GAClB,MAAM,IAAIxhK,UAAU,kBAAoBhB,EAAQ,aAAeyiK,EAAa,6BAA+B//J,OAAOsE,KAAKw7J,GAAkB7wI,KAAK,OAGhJ,OAAI8wI,IAAeC,EACV1iK,EAEAwiK,EAAiBC,GAAYziK,OC1DtC,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,OACpD2iK,IAA2B,QAF3B,MAEyC,IAAep9D,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,MACX5N,EAAK,IACLnlG,GACEqiE,EACAyuD,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEse,EAAcF,GAAkB,CAClCr7B,QACAid,gBAEEke,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEmd,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA+BF,OAAOA,EAzDE,MAyDU,CACjB,iBAAkBqtB,GAClB,mBAAoB,SAAwBt/I,EAAGe,GAC7C,QAAiB,IAATf,EAAEuzB,IAAqB,IAATvzB,EAAEs3E,IAAuB,IAATv2E,EAAEwyB,IAAqB,IAATxyB,EAAEu2E,KAExD,uBAAwB,SAA4Bt3E,EAAGe,GACrD,QAAQf,EAAE80F,UAAa/zF,EAAE+zF,UAAa90F,EAAEkC,SAAYnB,EAAEmB,UAExD,aAAc,SAAkBlC,EAAGe,GACjC,OAAOvH,KAAKwG,EAAE/G,OAAS,EAAG8H,EAAE9H,OAAS,IAEvC,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOysJ,EAAYxtJ,EAAGe,EAAGvH,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOksJ,EAAYjtJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAE/C,OAAIo7B,EAAIp7B,GAECugI,EAAMthI,EAAE6M,OAAQ7M,EAAEkzI,WAGpBka,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAE7C,OAAIo7B,EAAIp7B,GAECugI,EAAMthI,EAAE6M,OAAQ7M,EAAEkzI,WAGpBoZ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAE/C,OAAIo7B,EAAIn8B,GAECshI,EAAMthI,EAAE6M,OAAQ7M,EAAEkzI,WAGpBka,EAAYrsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAE7C,OAAIo7B,EAAIn8B,GAECshI,EAAMthI,EAAE6M,OAAQ7M,EAAEkzI,WAGpBoZ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,GAAGtG,WAE5B,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,IAAItG,gBCrI5B,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtCohK,IAAiC,QAAQ,GAAM,IAAer9D,IACvE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,YACNqhF,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA8BF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwBjyH,EAAGe,GAC7C,OAAOf,GAAKe,GAEd,iBAAkB,SAAsBf,EAAGe,GACzC,OAAOf,GAAKe,IAAK,QAAYf,EAAGe,EAAGqhB,EAAOg+F,UAE5C,uBAAwB,SAA4BpgH,EAAGe,GACrD,OAAOf,EAAE62F,IAAI91F,IAAM,GAAef,EAAGe,EAAGqhB,EAAOg+F,UAEjD,qBAAsB,SAA0BpgH,EAAGe,GACjD,OAAwB,IAAjBf,EAAE46F,QAAQ75F,IAEnB,mBAAoB,WAClB,MAAM,IAAI9G,UAAU,wDAEtB,aAAc,SAAkB+F,EAAGe,GACjC,IAAKf,EAAEg6I,UAAUj5I,GACf,MAAM,IAAI4E,MAAM,4CAGlB,OAAOnM,KAAKwG,EAAE/G,MAAO8H,EAAE9H,QAEzB,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBC7H/C,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,UAAW,kBACvCqhK,IAA4B,QAAQ,GAAM,IAAet9D,IAClE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,QACNysC,EAAO,eACPgnC,GACEpjC,EACAu9D,EAAanhE,EAEbohE,EAAc,CAACjhK,EAAGmG,KAAO05F,EAAQ7/F,EAAGmG,GAkCxC,OAAO+wH,EAAM,GAAM,CACjB75H,MAAO,SAAe4H,GAGpB,OAFAi8J,EAAej8J,GAERA,EAAEsB,KAAKy6J,IAEhBxsB,OAAQ,SAAgBvvI,GAGtB,OAFAk8J,EAAgBl8J,GAETmuD,EAAOnuD,EAAEutI,UAAUjsI,KAAKy6J,GAAa/7J,EAAEkzI,YAEhD,kBAAmB,SAAuBlzI,EAAGm8J,GAG3C,OAFAF,EAAej8J,GAERA,EAAEsB,KAAK66J,IAEhB,mBAAoB,SAAwBn8J,EAAGm8J,GAG7C,OAFAD,EAAgBl8J,GAETmuD,EAAOnuD,EAAEutI,UAAUjsI,KAAK66J,GAAcn8J,EAAEkzI,YAEjD,gBAAiB,SAAqBlzI,EAAG89E,GAGvC,OAFAm+E,EAAej8J,GAERA,EAAEsB,KAAK66J,EAAYr+E,KAE5B,iBAAkB,SAAsB99E,EAAG89E,GAGzC,OAFAo+E,EAAgBl8J,GAETmuD,EAAOnuD,EAAEutI,UAAUjsI,KAAK66J,EAAYr+E,IAAS99E,EAAEkzI,cAS1D,SAASipB,EAAYr+E,GACnB,GAAc,QAAVA,EACF,OAAOi+E,EACF,GAAc,SAAVj+E,EACT,OAAOk+E,EACF,GAAc,YAAVl+E,EACT,OAAO8jD,EAEP,MAAM,IAAIj8H,MAAM,+CAWpB,SAASs2J,EAAe18J,GACtB,GAA2B,KAAvB,SAAKA,GAAOtH,OACd,MAAM,IAAI0N,MAAM,kCAWpB,SAASu2J,EAAgB/tG,GACvB,GAA6B,IAAzBA,EAAOthD,OAAO5U,OAChB,MAAM,IAAI0N,MAAM,uCCnHlB,GAAe,CAAC,QAAS,aAClBy2J,IAA2B,QAF3B,MAEyC,IAAe59D,IACjE,IAAI,MACFyzB,EACAoT,UAAW0X,GACTv+C,EAuBJ,OAAOyzB,EA7BE,MA6BU,CACjB9vH,OAAQw/I,GACRzqE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEgqH,OAEXqb,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW,GAAG1nD,IAAIr1F,EAAEg5F,QAEjCg8B,KAAM,SAAch1H,GAClB,IAAKA,EAAEkwI,QAAQlwI,EAAE7C,YAAYslJ,WAAWC,OACtC,MAAM,IAAIzoJ,UAAU,oCAGtB,OAAOT,KAAKwG,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAGxG,YC9CpB,GAAO,cACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/D6iK,IAAmC,QAAQ,GAAM,IAAe79D,IACzE,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJg7D,EAAM,eACN+5D,EAAc,MACdsM,EAAK,YACLsB,GACEhxC,EAqBJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAqBl3H,GACrC,IAAIiqB,EAEJ,GAAsC,IAAlC6iD,EAAOh7D,EAAK9R,GAAI,IAAImzI,EAAM,IAE5BlpH,EAAS,OACJ,CACL,IAAI9jB,GAAI,SAAQ9I,MAAMoF,QAAQzC,GAAKA,EAAIA,EAAEwyI,WAAWjsI,KAAKsgI,IACzD58G,EAAS,IACFhqB,KAAKkG,EAAE,IAEd,IAAK,IAAIhJ,EAAI,EAAGA,EAAIgJ,EAAEjJ,OAAQC,IACW,IAAnC0pI,EAAe1gI,EAAEhJ,GAAIgJ,EAAEhJ,EAAI,KAC7B8sB,EAAOhqB,KAAKkG,EAAEhJ,IAMpB,OAAIE,MAAMoF,QAAQzC,GACTiqB,EAIF,IAAIwqH,EAAYxqH,SCxDzB,GAAO,cACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,SACtDs3I,IAAmC,QAAQ,GAAM,IAAe99D,IACzE,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJg7D,EAAM,eACN+5D,EAAc,MACdsM,GACE1vC,EAqBJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAqBl3H,GACrC,GAAsC,IAAlC8sE,EAAOh7D,EAAK9R,GAAI,IAAImzI,EAAM,IAE5B,MAAO,GAOT,IAJA,IAAIhtI,GAAI,SAAQ9I,MAAMoF,QAAQzC,GAAKA,EAAIA,EAAEwyI,WAAWjsI,KAAKsgI,GACrD58G,EAAS,GACT7iB,EAAS,EAENA,EAAOlD,SAAS,GAAGhH,QAAUiJ,EAAEjJ,QACpC+sB,EAAOhqB,KAAKuhK,EAAQr7J,EAAGiB,EAAOlD,SAAS,GAAGqnB,MAAM,IAAIkF,YACpDrpB,IAIF,OAiBJ,SAAe5C,GAGb,IAFA,IAAImE,EAAO,GAEFxL,EAAIqH,EAAMtH,OAAS,EAAGC,EAAI,EAAGA,IACpC,IAAK,IAAI8I,EAAI,EAAGA,EAAI9I,EAAG8I,IACjBzB,EAAMyB,GAAG/I,OAASsH,EAAMyB,EAAI,GAAG/I,SACjCyL,EAAOnE,EAAMyB,GACbzB,EAAMyB,GAAKzB,EAAMyB,EAAI,GACrBzB,EAAMyB,EAAI,GAAK0C,GAKrB,OAAOnE,EA9BEi9J,CAAMx3I,MAIjB,SAASu3I,EAAQh9J,EAAOk9J,GAGtB,IAFA,IAAIz3I,EAAS,GAEJ9sB,EAAI,EAAGA,EAAIukK,EAASxkK,OAAQC,IACf,MAAhBukK,EAASvkK,IACX8sB,EAAOhqB,KAAKuE,EAAMrH,IAItB,OAAO8sB,MC5DP,GAAO,QACP,GAAe,CAAC,QAAS,SAClB03I,IAA6B,QAAQ,GAAM,IAAel+D,IACnE,IAAI,MACFyzB,EAAK,MACLic,GACE1vC,EAmCJ,OAAOyzB,EAAM,GAAM,CACjB,0DAA2D,SAA+Cx4H,GACxG,IAAIk5B,EAASl5B,EAAKqH,KAAI,SAAU/H,GAC9B,OAAI,EAAAuoH,EAAA,IAAYvoH,GACPA,EAAIihG,WACF5hG,MAAMoF,QAAQzE,KAAQ,EAAAuoH,EAAA,IAASvoH,GACjCA,EAAI+H,KAAI,SAAU6iB,GAEvB,OAAO,EAAA29F,EAAA,IAAY39F,GAAQA,EAAKq2E,WAAar2E,KAGxC5qB,KAGPkzE,EAAM,IAAIiiE,EAEd,OADAA,EAAMv0I,MAAMsyE,EAAKt5C,GACVs5C,QCzDT,GAAO,YACP,GAAe,CAAC,QAAS,SAClB0wF,IAAiC,QAAQ,GAAM,IAAen+D,IACvE,IAAI,MACFyzB,EAAK,MACLxO,GACEjlB,EAwBJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnD,GACtB,GAAIA,EAAI,EACN,MAAM,IAAI2G,MAAM,8BAGlB,OAAO89G,EAAMzkH,EAAI,IAEnBqmI,UAAW,SAAmBrmI,GAC5B,GAAIA,EAAEu4F,aACJ,MAAM,IAAI5xF,MAAM,8BAGlB,OAAO89G,EAAMzkH,EAAEmQ,KAAK,KAEtB,iBAAkB,SAAqBnQ,GACrC,OAAO,SAAQA,EAAGxF,YC7CpB,GAAO,eACP,GAAe,CAAC,QAAS,aAClBojK,IAAoC,QAAQ,GAAM,IAAep+D,IAC1E,IAAI,MACFyzB,EAAK,UACLnL,GACEtoB,EA2BJ,OAAOyzB,EAAM,GAAM,CACjB,qBAAsBnL,EACtB,iBAAkB,SAAsB9nH,EAAGkB,GACzC,KAAK,OAAUlB,IAAMA,EAAI,EACvB,MAAM,IAAI/E,UAAU,4DAGtB,KAAK,OAAUiG,IAAMA,EAAI,EACvB,MAAM,IAAIjG,UAAU,4DAGtB,GAAIiG,EAAIlB,EACN,MAAM,IAAI/E,UAAU,oEAItB,OAAO+oJ,GAAQhkJ,EAAIkB,EAAI,EAAGlB,IAE5B,uBAAwB,SAA4BA,EAAGkB,GACrD,IAAI8kB,EAAQ9sB,EAEZ,IAAK,GAAkB8G,KAAO,GAAkBkB,GAC9C,MAAM,IAAIjG,UAAU,4DAGtB,GAAIiG,EAAEw1F,GAAG12F,GACP,MAAM,IAAI/E,UAAU,oEAMtB,IAFA+qB,EADUhmB,EAAEi6F,IAAI,GAAGlzF,IAAI,GAGlB7N,EAAI8G,EAAEwN,MAAMtM,GAAGiP,KAAK,GAAIjX,EAAE2+F,IAAI73F,GAAI9G,EAAIA,EAAEiX,KAAK,GAChD6V,EAASA,EAAO5V,MAAMlX,GAGxB,OAAO8sB,QAWb,SAAS,GAAkBhmB,GACzB,OAAOA,EAAE8zD,aAAe9zD,EAAE42F,IAAI,GC5EhC,IACI,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,eAC/CinE,IAA4B,QAF5B,OAE0C,IAAer+D,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,MACN5f,EAAK,OACL2rD,EAAM,YACN+gF,GACE1wC,EACA4uD,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEod,EAAcN,GAAkB,CAClC/5B,UAwCF,OAAOA,EAAM,OAAQ,CACnB9vH,OAAQ,SAAgBnC,GACtB,OAAI,QAAYA,EAAGwC,EAAMxC,GAAIoiB,EAAOg+F,SAC3B59G,EAAMxC,GAENq7I,GAAWr7I,IAGtB,iBAAkB,SAAsBA,EAAGhB,GACzC,IAAI,QAAYgB,EAAGwC,EAAMxC,EAAGhB,GAAIojB,EAAOg+F,SACrC,OAAO59G,EAAMxC,EAAGhB,GAEhB,IAAKmD,EAAQqxJ,GAAY,GAAGtuJ,OAAOlF,EAAG,KAAKsmB,MAAM,KAC7CtB,EAASxlB,KAAKwwB,KAAK3uB,OAAO,GAAG6D,OAAO/C,EAAQ,KAAK+C,OAAO7D,OAAOmyJ,GAAYx0J,KAE/E,OADCmD,EAAQqxJ,GAAY,GAAGtuJ,OAAO8f,EAAQ,KAAKsB,MAAM,KAC3CjlB,OAAO,GAAG6D,OAAO/C,EAAQ,KAAK+C,OAAO7D,OAAOmyJ,GAAYx0J,KAGnEk4E,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEgwB,QAEX,kBAAmB,SAAuBhwB,EAAGhB,GAC3C,OAAOgB,EAAEgwB,KAAKhxB,IAEhBqmI,UAAW,SAAmBrlI,GAC5B,OAAI,GAAeA,EAAGwC,EAAMxC,GAAIoiB,EAAOg+F,SAC9B59G,EAAMxC,GAENA,EAAEgwB,QAGb,uBAAwB,SAA4BhwB,EAAGhB,GACrD,OAAI,GAAegB,EAAGwC,EAAMxC,EAAGhB,GAAIojB,EAAOg+F,SACjC59G,EAAMxC,EAAGhB,GAETgB,EAAEq5F,gBAAgBr6F,EAAEg7F,WAAY,eAG3CsF,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEgwB,QAEX,mBAAoB,SAAwBhwB,EAAGhB,GAC7C,OAAOgB,EAAEgwB,KAAKhxB,IAEhB,iBAAkB,SAAqBgB,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1B,yBAA0B,SAA2BwG,EAAGhB,GAEtD,OAAO,SAAQgB,GAAG9H,GAAKsB,KAAKtB,EAAG8G,KAAI,IAErC,mCAAoC,SAAqCgB,EAAGe,GAC1E,OAAOqsJ,EAAYptJ,EAAGe,EAAGvH,MAAM,IAEjC,kCAAmC,SAAoCwG,EAAGe,GACxE,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,sCAAuC,SAAqCwG,EAAGe,GAE7E,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCnH/C,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,aAAc,eACtEqiK,IAAgC,QAAQ,GAAM,IAAet+D,IACtE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,UACXG,EAAS,WACTpoB,EAAU,YACVuoB,GACEhxC,EAEA0tD,EAAclC,GAAkB,CAClC/3B,UAEEi7B,EAAcT,GAAkB,CAClCx6B,UAEEk7B,EAAcT,GAAkB,CAClCz6B,QACAid,gBAEEkd,EAAcZ,GAAkB,CAClCv5B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UAoCF,OAAOA,EAAM,GAAM,CACjB,iBAAkB,SAAsBjyH,EAAGe,GACzC,OAAOf,EAAIe,GAEb,mBAAoB,SAAwBf,EAAGe,GAC7C,OAAOf,EAAEk4F,IAAIn3F,IAEf,uBAAwB,SAA4Bf,EAAGe,GACrD,OAAOf,EAAEwM,MAAMzL,IAEjB,qBAAsB,SAA0Bf,EAAGe,GACjD,OAAOf,EAAEk4F,IAAIn3F,IAEf,aAAc,SAAkBf,EAAGe,GACjC,GAAgB,OAAZf,EAAE/G,MACJ,MAAM,IAAI0M,MAAM,oDAGlB,GAAgB,OAAZ5E,EAAE9H,MACJ,MAAM,IAAI0M,MAAM,oDAGlB,IAAK3F,EAAEg6I,UAAUj5I,GACf,MAAM,IAAI4E,MAAM,sBAGlB,IAAIsmE,EAAMjsE,EAAEy9F,QAGZ,OAFAxxB,EAAIhzE,MAAQO,KAAKyyE,EAAIhzE,MAAO8H,EAAE9H,OAC9BgzE,EAAI0qE,WAAY,EACT1qE,GAET,6BAA8B,SAAkCjsE,EAAGe,GAEjE,OADAg8J,GAAqB/8J,EAAGe,GACjBosJ,EAAYntJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAE/D,OADAg8J,GAAqB/8J,EAAGe,GACjBmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAE/D,OADAg8J,GAAqB/8J,EAAGe,GACjBmrJ,EAAYlsJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAE7D,OADAg8J,GAAqB/8J,EAAGe,GACjBsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqrJ,EAAYpsJ,EAAGinH,EAAWlmH,GAAIsuI,IAEvC,mBAAoB,SAAwBrvI,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,OAE3B,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOqrJ,EAAYrrJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBAWnD,SAASsiK,GAAqB/8J,EAAGe,GAC/B,IAAIm0J,EAAQl1J,EAAE6M,OACVsoJ,EAAQp0J,EAAE8L,OAEd,GAAIqoJ,EAAMj9J,SAAWk9J,EAAMl9J,OACzB,MAAM,IAAIi/I,GAAA,EAAege,EAAMj9J,OAAQk9J,EAAMl9J,QCrKjD,IAAI,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAAY,YACxC+kK,IAA6B,QAAQ,GAAM,IAAex+D,IACnE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,SACN4sC,EAAQ,SACR/8E,GACEwgF,EAmCJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAsBjyH,EAAGe,GACzC,OAAOotD,EAAO8uG,EAAOj9J,EAAEutI,UAAWxsI,EAAEwsI,aAEtC,gBAAiB,SAAqBvtI,EAAGe,GACvC,OAAOotD,EAAO8uG,EAAOj9J,EAAEutI,UAAWxsI,KAEpC,gBAAiB,SAAqBf,EAAGe,GACvC,OAAOotD,EAAO8uG,EAAOj9J,EAAGe,EAAEwsI,aAE5B,eAAgB0vB,IAUlB,SAASA,EAAOj9J,EAAGe,GACjB,IAAIm8J,EAAmB19J,KAAKyJ,KAAI,SAAUjJ,GAAG/H,QAAQ,SAAU8I,GAAG9I,QAClE+H,GAAI,SAAQA,GACZe,GAAI,SAAQA,GACZ,IAAImyJ,GAAQ,SAAUlzJ,GAClBmzJ,GAAQ,SAAUpyJ,GAEtB,GAAqB,IAAjBmyJ,EAAMj7J,QAAiC,IAAjBk7J,EAAMl7J,QAA6B,IAAbi7J,EAAM,IAAyB,IAAbC,EAAM,GACtE,MAAM,IAAIxI,WAAW,6CAAoDuI,EAAMtoI,KAAK,MAAQ,WAAauoI,EAAMvoI,KAAK,MAAQ,MAG9H,IAAIo4H,EAAU,CAACjoD,EAAS/8E,EAAShe,EAAE,GAAIe,EAAE,IAAKid,EAAShe,EAAE,GAAIe,EAAE,KAAMg6F,EAAS/8E,EAAShe,EAAE,GAAIe,EAAE,IAAKid,EAAShe,EAAE,GAAIe,EAAE,KAAMg6F,EAAS/8E,EAAShe,EAAE,GAAIe,EAAE,IAAKid,EAAShe,EAAE,GAAIe,EAAE,MAE3K,OAAIm8J,EAAmB,EACd,CAACla,GAEDA,M,WC9ET,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,iBAAkB,WAC9Cma,IAA4B,QAAQ,GAAM,IAAe3+D,IAClE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,eACN+sH,EAAc,QACd7kB,GACE9rB,EA2BJ,OAAOyzB,EAAM,GAAM,CAEjB,iBAAkBmrC,EAElB,qCAAsC,SAAoC79J,EAAOytI,GAE/E,MAAM,IAAIrnI,MAAM,sCAGlB,MAAO,SAAWlM,GAChB,OAAO2jK,EAAM3jK,MAUjB,SAAS2jK,EAAM79J,GACb,IAAI27F,EAaJ,IAZA,SAAY37F,GAAO,SAAUtG,GAC3B,IACEiiG,OAAgBrhG,IAATqhG,EAAqBjiG,EAAQk2I,EAAej0C,EAAMjiG,GACzD,MAAOW,GACP,MAAM,EAAAyjK,GAAA,GAAoBzjK,EAAK,OAAQX,OAIvB,iBAATiiG,IACTA,EAAOovB,EAAQpvB,EAAM94E,EAAOjgB,cAGjBtI,IAATqhG,EACF,MAAM,IAAIv1F,MAAM,2CAGlB,OAAOu1F,MCtEP,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3CoiE,IAA6B,QAAQ,GAAM,IAAe9+D,IACnE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,YACXM,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA+CF,OAAOA,EAAM,GAAM,CACjB,WAAY,SAAgBjyH,EAAGe,GAE7B,OAAU,OAANf,EACW,OAANe,EAGC,OAANA,EACW,OAANf,OAGCnG,IAANmG,OACWnG,IAANkH,OAGClH,IAANkH,OACWlH,IAANmG,EAGFkvI,EAAYlvI,EAAGe,IAExB,6BAA8B,SAAkCf,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGmuI,IAE3B,4BAA6B,SAAiClvI,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGkvI,GAAa,IAExC,4BAA6B,SAAiClvI,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGmuI,GAAa,IAExC,2BAA4B,SAAgClvI,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGmuI,IAE3B,eAAgB,SAAoBlvI,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGmuI,GAAa,IAExC,mBAAoB,SAAwBlvI,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGmuI,GAAa,IAExC,oBAAqB,SAAyBlvI,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGkvI,GAAa,IAExC,mBAAoB,SAAwBlvI,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGkvI,GAAa,IAExC,aAAc,SAAkBlvI,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGmuI,GAAa,GAAOz0I,WAEvD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGkvI,GAAa,GAAMz0I,gBC1ItD,KD8I2B,QAAQ,GAAM,CAAC,QAAS,gBAAiB22I,IACtE,IAAI,MACFnf,EAAK,YACLid,GACEkC,EACJ,OAAOnf,EAAM,GAAM,CACjB,WAAY,SAAgBjyH,EAAGe,GAE7B,OAAU,OAANf,EACW,OAANe,EAGC,OAANA,EACW,OAANf,OAGCnG,IAANmG,OACWnG,IAANkH,OAGClH,IAANkH,OACWlH,IAANmG,EAGFkvI,EAAYlvI,EAAGe,SCtKjB,gBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/Dw8J,IAAoC,QAAQ,GAAM,IAAe/+D,IAC1E,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJg7D,EAAM,eACN+5D,EAAc,MACdsM,EAAK,YACLsB,GACEhxC,EAsBJ,OAAOyzB,EAAM,GAAM,CACjB,iCAAkC,SAAgCyS,EAAI0zB,GACpE,IAAIpzI,EAAS,GAEb,GAAuC,IAAnC6iD,EAAOh7D,EAAK63H,GAAK,IAAIwJ,EAAM,KAAgD,IAAnCrmE,EAAOh7D,EAAKurJ,GAAK,IAAIlqB,EAAM,IAAW,CAEhF,IAAIoqB,GAAK,SAAQlgK,MAAMoF,QAAQknI,GAAMA,EAAKA,EAAG6I,WAAWjsI,KAAKsgI,GACzD22B,GAAK,SAAQngK,MAAMoF,QAAQ46J,GAAMA,EAAKA,EAAG7qB,WAAWjsI,KAAKsgI,GAC7D58G,EAAS,GAET,IAAK,IAAI9sB,EAAI,EAAGA,EAAIogK,EAAGrgK,OAAQC,IAC7B,IAAK,IAAI8I,EAAI,EAAGA,EAAIu3J,EAAGtgK,OAAQ+I,IAC7BgkB,EAAOhqB,KAAK,CAACs9J,EAAGpgK,GAAIqgK,EAAGv3J,KAM7B,OAAI5I,MAAMoF,QAAQknI,IAAOtsI,MAAMoF,QAAQ46J,GAC9BpzI,EAIF,IAAIwqH,EAAYxqH,SCvDzB,GAAO,mBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,SAAU,gBAAiB,SAC/Dw4I,IAAwC,QAAQ,GAAM,IAAeh/D,IAC9E,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJ3H,EAAM,OACN2iE,EAAM,cACNo6D,EAAa,MACbiM,GACE1vC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,iCAAkC,SAAgCyS,EAAI0zB,GACpE,GAAuC,IAAnCvwF,EAAOh7D,EAAK63H,GAAK,IAAIwJ,EAAM,IAE7B,OAAO,SAAQkqB,GACV,GAAuC,IAAnCvwF,EAAOh7D,EAAKurJ,GAAK,IAAIlqB,EAAM,IACpC,OAAO,SAAQxJ,GAGjB,IAAI4zB,GAAK,SAAQ5zB,GACb6zB,GAAK,SAAQH,GACjB,OAAOlzJ,EAAO+8H,EAAcq2B,EAAIC,GAAKt2B,EAAcs2B,EAAID,UC1CzD,GAAe,CAAC,QAAS,UAAW,SAAU,OAAQ,SAC/CmF,IAA2B,QAF3B,MAEyC,IAAej/D,IACjE,IAAI,MACFyzB,EACA/6C,QAASwlE,EAAQ,OACjBvuF,EAAM,KACNn+B,EAAI,MACJvuB,GACE+8F,EACA8tD,EAAcN,GAAkB,CAClC/5B,UAsCF,OAAOA,EAAM,MAAO,CAClB9vH,OAAQ,SAAgBnC,GACtB,OAAOA,EAAI,EAAIyB,EAAMzB,GAAKgwB,EAAKhwB,IAEjC,6BAA8B,SAA+BA,EAAGhB,GAC9D,OAAOgB,EAAI,EAAIyB,EAAMzB,EAAGhB,GAAKgxB,EAAKhwB,EAAGhB,IAEvCk4E,QAAS,SAAiBl3E,GACxB,OAAO,IAAI08I,EAAS18I,EAAEuzB,GAAK,EAAI/zB,KAAKiC,MAAMzB,EAAEuzB,IAAM/zB,KAAKwwB,KAAKhwB,EAAEuzB,IAAKvzB,EAAEs3E,GAAK,EAAI93E,KAAKiC,MAAMzB,EAAEs3E,IAAM93E,KAAKwwB,KAAKhwB,EAAEs3E,MAE/G,8BAA+B,SAAgCt3E,EAAGhB,GAChE,OAAO,IAAI09I,EAAS18I,EAAEuzB,GAAK,EAAI9xB,EAAMzB,EAAEuzB,GAAIv0B,GAAKgxB,EAAKhwB,EAAEuzB,GAAIv0B,GAAIgB,EAAEs3E,GAAK,EAAI71E,EAAMzB,EAAEs3E,GAAIt4E,GAAKgxB,EAAKhwB,EAAEs3E,GAAIt4E,KAExGqmI,UAAW,SAAmBrlI,GAC5B,OAAOA,EAAEu3F,aAAevnE,EAAKhwB,GAAKyB,EAAMzB,IAE1C,gCAAiC,SAAkCA,EAAGhB,GACpE,OAAOgB,EAAEu3F,aAAevnE,EAAKhwB,EAAGhB,GAAKyC,EAAMzB,EAAGhB,IAEhDsgG,SAAU,SAAkBt/F,GAC1B,OAAOA,EAAEu/B,EAAI,EAAIv/B,EAAEgwB,OAAShwB,EAAEyB,SAEhC,+BAAgC,SAAiCzB,EAAGhB,GAClE,OAAOgB,EAAEu/B,EAAI,EAAIv/B,EAAEgwB,KAAKhxB,GAAKgB,EAAEyB,MAAMzC,IAEvC,iBAAkB,SAAqBgB,GAErC,OAAO,SAAQA,EAAGxG,MAAM,IAE1B,qCAAsC,SAAoCwG,EAAGhB,GAE3E,OAAO,SAAQgB,GAAG9H,GAAKsB,KAAKtB,EAAG8G,KAAI,IAErC,sCAAuC,SAAqCgB,EAAGe,GAE7E,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBCtF/C,GAAO,aACP,GAAe,CAAC,QAAS,YAAa,QAC/BijK,IAAkC,QAAQ,GAAM,IAAel/D,IACxE,IAAI,MACFyzB,EAAK,UACLrL,EAAS,KACToC,GACExqB,EAwBJ,OAAOyzB,EAAM,GAAM,CACjBW,IAAK,SAAa5yH,GAChB,OAAOgpH,EAAKpC,EAAU5mH,UCjCxB,GAAO,YACP,GAAe,CAAC,QAAS,SAClB29J,IAAiC,QAAQ,GAAM,IAAen/D,IACvE,IAAI,MACFyzB,EAAK,MACLxK,GACEjpB,EA+BJ,OAAOyzB,EAAM,GAAM,CACjB,WAAY,SAAgBjyH,EAAGe,GAC7B,OAAO68J,EAAW59J,EAAEvF,UAAWsG,EAAEtG,cAUrC,SAASmjK,EAAW59J,EAAGe,GACrB,GAAI3I,MAAMoF,QAAQwC,GAAI,CACpB,GAAI5H,MAAMoF,QAAQuD,GAAI,CACpB,IAAI/I,EAAMgI,EAAE/H,OAEZ,GAAID,IAAQ+I,EAAE9I,OACZ,OAAO,EAGT,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAKE,IACvB,IAAK0lK,EAAW59J,EAAE9H,GAAI6I,EAAE7I,IACtB,OAAO,EAIX,OAAO,EAEP,OAAO,EAGT,OAAIE,MAAMoF,QAAQuD,IAGT0mH,EAAMznH,EAAGe,OCvEpB,GAAO,cACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,SACtD88J,IAAmC,QAAQ,GAAM,IAAer/D,IACzE,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJg7D,EAAM,eACN+5D,EAAc,MACdsM,GACE1vC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,iCAAkC,SAAgCyS,EAAI0zB,GACpE,GAAuC,IAAnCvwF,EAAOh7D,EAAK63H,GAAK,IAAIwJ,EAAM,IAE7B,OAAO,EACF,GAAuC,IAAnCrmE,EAAOh7D,EAAKurJ,GAAK,IAAIlqB,EAAM,IAEpC,OAAO,EAOT,IAJA,IAEImqB,EAFAC,GAAK,UAAS,SAAQlgK,MAAMoF,QAAQknI,GAAMA,EAAKA,EAAG6I,WAAWjsI,KAAKsgI,IAClE22B,GAAK,UAAS,SAAQngK,MAAMoF,QAAQ46J,GAAMA,EAAKA,EAAG7qB,WAAWjsI,KAAKsgI,IAG7D1pI,EAAI,EAAGA,EAAIogK,EAAGrgK,OAAQC,IAAK,CAClCmgK,GAAO,EAEP,IAAK,IAAIr3J,EAAI,EAAGA,EAAIu3J,EAAGtgK,OAAQ+I,IAC7B,GAAiD,IAA7C4gI,EAAe02B,EAAGpgK,GAAGe,MAAOs/J,EAAGv3J,GAAG/H,QAAgBq/J,EAAGpgK,GAAGu0H,aAAe8rC,EAAGv3J,GAAGyrH,WAAY,CAE3F4rC,GAAO,EACP,MAIJ,IAAa,IAATA,EACF,OAAO,EAIX,OAAO,QCxDT,GAAe,CAAC,QAAS,SAAU,eAC5ByF,IAA2B,QAF3B,MAEyC,IAAet/D,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACNqhF,GACEhxC,EACA0uD,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE6d,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA+BF,OAAOA,EAtDE,MAsDU,CACjB,iBAAkBotB,GAClB,mBAAoB,SAAwBr/I,EAAGe,GAC7C,OAAiB,IAATf,EAAEuzB,IAAqB,IAATvzB,EAAEs3E,MAAwB,IAATv2E,EAAEwyB,IAAqB,IAATxyB,EAAEu2E,KAEzD,uBAAwB,SAA4Bt3E,EAAGe,GACrD,QAASf,EAAE80F,WAAa90F,EAAEkC,YAAenB,EAAE+zF,WAAa/zF,EAAEmB,UAE5D,aAAc,SAAkBlC,EAAGe,GACjC,OAAOvH,KAAKwG,EAAE/G,OAAS,EAAG8H,EAAE9H,OAAS,IAEvC,6BAA8B,SAAkC+G,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGvH,OAE3B,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYnsJ,EAAGf,EAAGxG,MAAM,IAEjC,4BAA6B,SAAiCwG,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGvH,MAAM,IAEjC,2BAA4B,SAAgCwG,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGvH,OAE3B,eAAgB,SAAoBwG,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOssJ,EAAYrtJ,EAAGe,EAAGvH,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGvH,MAAM,IAEjC,oBAAqB,SAAyBwG,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGxG,MAAM,IAEjC,mBAAoB,SAAwBwG,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGxG,MAAM,IAEjC,aAAc,SAAkBwG,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGvH,MAAM,GAAOiB,WAEhD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGxG,MAAM,GAAMiB,gBChH/C,GAAO,eACP,GAAe,CAAC,QAAS,WAClBsjK,IAAoC,QAAQ,GAAM,IAAev/D,IAC1E,IAAI,MACFyzB,EAAK,QACL3H,GACE9rB,EAcJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAsBjyH,EAAGe,GACzC,OAAOf,EAAIe,GAEb,mBAAoB,SAAwBf,EAAGe,GAC7C,OAAOf,EAAEq1F,IAAIt0F,IAEf,uBAAwB,SAA4Bf,EAAGe,GACrD,OAAOf,EAAEq1F,IAAIt0F,IAEf,qBAAsB,SAA0Bf,EAAGe,GACjD,OAAOf,EAAEq1F,IAAIt0F,IAEf,sCAAuC,SAAqCf,EAAGe,GAC7E,IAAIkrE,EAAMjsE,EAAEy9F,QAER3H,EAAMw0B,EAAQ,GAAG,QAAOvpH,IAE5B,OADAkrE,EAAIhzE,MAAQO,KAAmB,OAAdyyE,EAAIhzE,MAAiBgzE,EAAI4wE,WAAW/mD,GAAO7pB,EAAIhzE,MAAO8H,GAChEkrE,GAET,sCAAuC,SAAqCjsE,EAAGe,GAC7E,IAAIkrE,EAAMlrE,EAAE08F,QACZxxB,EAAMA,EAAI9qE,KAAK,GAEf,IAAI20F,EAAMw0B,EAAQ,GAAG,QAAOtqH,IAE5B,OADAisE,EAAIhzE,MAAQO,KAAKwG,EAAe,OAAZe,EAAE9H,MAAiB8H,EAAE87I,WAAW/mD,GAAO/0F,EAAE9H,OACtDgzE,GAET,aAAc,SAAkBjsE,EAAGe,GACjC,OAAOf,EAAEg1F,OAAOj0F,SClDlB,GAAO,WACP,GAAe,CAAC,SAAU,QAAS,eAAgB,WAC5Ci9J,IAAgC,QAAQ,GAAM,IAAex/D,IACtE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,aACNktH,EAAY,QACZp4D,GACEsnB,EAQAy/D,EAAwB,CAAC,SAAiBjvJ,GAC5C,OAAO,IAAIkoE,EAAQloE,EAAK,IACvB,SAAiBA,GAClB,OAAO,IAAIkoE,EAAQ,EAAGloE,IACrB,SAAiBA,GAClB,OAAO,IAAIkoE,GAASloE,EAAK,IACxB,SAAiBA,GAClB,OAAO,IAAIkoE,EAAQ,GAAIloE,KASzB,SAASkvJ,EAAiBnjK,EAAGoqB,GAC3B,GAAIA,EAAO,EAAG,MAAM,IAAIxf,MAAM,kCAC9B,GAAa,IAATwf,EAAY,MAAM,IAAIxf,MAAM,yBAChC,GAAIwf,EAAO,GAAM,EAAG,MAAM,IAAIxf,MAAM,2BACpC,GAAU,IAAN5K,GAAuB,IAAZA,EAAEyI,MAAa,MAAO,CAAC,IAAI0zE,EAAQ,EAAG,IACrD,IACI59D,EADA6kJ,EAA0B,iBAANpjK,GAGpBojK,GAAuB,IAATpjK,EAAEw4B,IAAqB,IAATx4B,EAAEu8E,MAE9Bh+D,EADE6kJ,EACO,IAAMpjK,EAAI,GACD,IAATA,EAAEu8E,GACF,IAAMv8E,EAAEw4B,GAAK,GAEb,IAAMx4B,EAAEu8E,GAAK,GAAK,GAS/B,IALA,IAAIv+E,EAAMgC,EAAEhC,MACRyK,EAAMzI,EAAEyI,MACR46J,EAAQ,GACRxgJ,EAAIpe,KAAK2B,IAAIqC,EAAK,EAAI2hB,GAEjBjlB,EAAI,EAAGA,EAAIilB,EAAMjlB,IAAK,CAC7B,IAAIm+J,GAAgB/kJ,EAAS,EAAIpZ,GAAKilB,EAMlCk5I,IAAiB7+J,KAAKgD,MAAM67J,GAKhCD,EAAMpjK,KAAK,IAAIk8E,EAAQ,CACrBt5D,EAAGA,EACHkoG,KAAM/sH,EAAM,EAAIyG,KAAKsO,GAAK5N,GAAKilB,KAN/Bi5I,EAAMpjK,KAAKijK,EAAsBI,EAAe,GAAGzgJ,IAUvD,OAAOwgJ,EAoCT,OAAOnsC,EAAM,GAAM,CACjB/6C,QAAS,SAAiBl3E,GACxB,OAAOk+J,EAAiBl+J,EAAG,IAE7B,kBAAmBk+J,OC/GhB,SAASI,GAAsB9/D,GACpC,IAAI,YACFgxC,GACEhxC,EAWJ,OAAO,SAAyB50F,EAAG1I,EAAG+kB,GACpC,IAAIs4I,EAAQ30J,EAAEiD,OAEd,GAAqB,IAAjB0xJ,EAAMtmK,OACR,MAAM,IAAI0yJ,WAAW,0CAA2C,SAAO4T,GAAS,KAGlF,IAAIvlJ,EAAOulJ,EAAM,GAGjB,GAAIvlJ,IAFUulJ,EAAM,GAGlB,MAAM,IAAI5T,WAAW,iCAAkC,SAAO4T,GAAS,KAGzE,IAAIltJ,EAAO,GAEX,IAAI,EAAAiwG,EAAA,IAASpgH,GAAI,CACf,IAAIs9J,EAAQt9J,EAAE2L,OACV6+I,EAAQxqJ,EAAE+e,MAEd,GAAqB,IAAjBu+I,EAAMvmK,OAAc,CACtB,GAAIumK,EAAM,KAAOxlJ,EACf,MAAM,IAAI2xI,WAAW,gEAGvB,IAAK,IAAIzyJ,EAAI,EAAGA,EAAI8gB,EAAM9gB,IACxBmZ,EAAKnZ,GAAK,CAACwzJ,EAAMxzJ,IAGnB,OAAO,IAAIs3I,EAAY,CACrBn+H,KAAMA,EACNxE,KAAM,CAACmM,EAAM,GACbxH,SAAUtQ,EAAE61I,YAKhB,GAAqB,IAAjBynB,EAAMvmK,OAAc,CACtB,GAAIumK,EAAM,KAAOxlJ,GAAqB,IAAbwlJ,EAAM,GAC7B,MAAM,IAAI7T,WAAW,gEAGvB,IAAI,EAAArpC,EAAA,IAAcpgH,GAAI,CACpB,GAAI+kB,EAAM,CACR5U,EAAO,GAEP,IAAK,IAAIrT,EAAK,EAAGA,EAAKgb,EAAMhb,IAC1BqT,EAAKrT,GAAM,CAAC0tJ,EAAM1tJ,GAAI,IAGxB,OAAO,IAAIwxI,EAAY,CACrBn+H,KAAMA,EACNxE,KAAM,CAACmM,EAAM,GACbxH,SAAUtQ,EAAE61I,YAIhB,OAAO71I,EAGT,IAAI,EAAAogH,EAAA,IAAepgH,GAAI,CACrB,IAAK,IAAIgqI,EAAM,EAAGA,EAAMlyH,EAAMkyH,IAC5B75H,EAAK65H,GAAO,CAAC,GAOf,IAJA,IAAI5lI,EAASpE,EAAEulJ,QACXllJ,EAAQL,EAAEwlJ,OACVI,EAAM5lJ,EAAEylJ,KAEHp9D,EAAKu9D,EAAI,GAAI5mJ,EAAI4mJ,EAAI,GAAI5mJ,EAAIqpF,EAAIrpF,IAExCmR,EADU9P,EAAMrB,IACN,GAAKoF,EAAOpF,GAGxB,OAAO,IAAIsvI,EAAY,CACrBn+H,KAAMA,EACNxE,KAAM,CAACmM,EAAM,GACbxH,SAAUtQ,EAAE61I,aAKlB,MAAM,IAAI4T,WAAW,mFAGvB,IAAI,EAAArpC,EAAA,IAAQpgH,GAAI,CACd,IAAIupJ,GAAQ,SAAUvpJ,GAEtB,GAAqB,IAAjBupJ,EAAMxyJ,OAAc,CACtB,GAAIwyJ,EAAM,KAAOzxI,EACf,MAAM,IAAI2xI,WAAW,gEAGvB,IAAK,IAAI8T,EAAM,EAAGA,EAAMzlJ,EAAMylJ,IAC5BptJ,EAAKotJ,GAAO,CAACv9J,EAAEu9J,IAGjB,OAAO,IAAIjvB,EAAY,CACrBn+H,KAAMA,EACNxE,KAAM,CAACmM,EAAM,KAIjB,GAAqB,IAAjByxI,EAAMxyJ,OAAc,CACtB,GAAIwyJ,EAAM,KAAOzxI,GAAqB,IAAbyxI,EAAM,GAC7B,MAAM,IAAIE,WAAW,gEAGvB,IAAK,IAAI7B,EAAM,EAAGA,EAAM9vI,EAAM8vI,IAC5Bz3I,EAAKy3I,GAAO,CAAC5nJ,EAAE4nJ,GAAK,IAGtB,OAAO,IAAItZ,EAAY,CACrBn+H,KAAMA,EACNxE,KAAM,CAACmM,EAAM,KAIjB,MAAM,IAAI2xI,WAAW,qFCrI3B,IAAI,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzF+T,IAA8B,QAAQ,GAAM,IAAelgE,IACpE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,aACNmhF,EAAY,eACZH,EAAc,SACdp0C,EAAQ,YACRm0C,EAAW,YACXM,GACEhxC,EACAmgE,EAAkBL,GAAsB,CAC1C9uB,gBA2BF,OAAOvd,EAAM,GAAM,CACjB,+BAAgC,SAAiCroH,EAAG1I,GAClE,OAuDJ,SAAoC0I,EAAG1I,GAYrC,IATA,IAAIwqJ,GADJxqJ,EAAIy9J,EAAgB/0J,EAAG1I,GAAG,IACZ+e,MACVjH,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAClBxxI,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KAER3mJ,EAAI,GAECgB,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAChC,IAAI49J,EAAKlT,EAAM1qJ,GAAG,IAAM,EAExB,GAAKkuI,EAAY0vB,EAAI,GAqCnB5+J,EAAEgB,GAAK,CAAC,OArCe,CAUvB,IARA,IAAI69J,EAAM,EAENC,EAAU,GACVC,EAAW,GAEXh6E,EAAa+hE,EAAI9lJ,GACjBuyG,EAAYuzC,EAAI9lJ,EAAI,GAEfd,EAAI6kF,EAAY7kF,EAAIqzG,EAAWrzG,IAAK,CAC3C,IAAIhI,EAAIqJ,EAAMrB,GAEVhI,IAAM8I,EACR69J,EAAMv5J,EAAOpF,GACJhI,EAAI8I,IAEb89J,EAAQ9jK,KAAKsK,EAAOpF,IACpB6+J,EAAS/jK,KAAK9C,IAKlB,GAAIg3I,EAAY2vB,EAAK,GACnB,MAAM,IAAIl5J,MAAM,2DAKlB,IAFA,IAAIq5J,EAAK1vB,EAAasvB,EAAIC,GAEjBhW,EAAK,EAAGvkH,EAAIy6H,EAAS9mK,OAAQ4wJ,EAAKvkH,EAAGukH,IAAM,CAClD,IAAI7qJ,EAAK+gK,EAASlW,GAClB6C,EAAM1tJ,GAAM,CAAC+8F,EAAS2wD,EAAM1tJ,GAAI,IAAM,EAAGmxI,EAAe6vB,EAAIF,EAAQjW,MAGtE7oJ,EAAEgB,GAAK,CAACg+J,IAOZ,OAAO,IAAIxvB,EAAY,CACrBn+H,KAAMrR,EACN6M,KAAM,CAACmM,EAAM,KAjHNimJ,CAA2Br1J,EAAG1I,IAEvC,8BAA+B,SAAgC0I,EAAG1I,GAChE,OAAOg+J,EAA0Bt1J,EAAG1I,IAEtC,wBAAyB,SAA0BnG,EAAGmG,GAKpD,OAFQg+J,EAFA/wG,EAAOpzD,GAEsBmG,GAE5BzG,aAIb,SAASykK,EAA0Bt1J,EAAG1I,GAUpC,IAPA,IAAIwqJ,GADJxqJ,EAAIy9J,EAAgB/0J,EAAG1I,GAAG,IACZ+e,MACVjH,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAElB92I,EAAI,GACJo0E,EAAQxqE,EAAEqW,MAELjf,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAChC,IAAI49J,EAAKlT,EAAM1qJ,GAAG,IAAM,EACpBg+J,OAAK,EAET,GAAK9vB,EAAY0vB,EAAI,GAenBI,EAAK,MAfkB,CAEvB,IAAIH,EAAMzqF,EAAMpzE,GAAGA,GAEnB,GAAIkuI,EAAY2vB,EAAK,GACnB,MAAM,IAAIl5J,MAAM,2DAGlBq5J,EAAK1vB,EAAasvB,EAAIC,GAEtB,IAAK,IAAI3mK,EAAI8I,EAAI,EAAG9I,EAAI8gB,EAAM9gB,IAC5BwzJ,EAAMxzJ,GAAK,CAAC6iG,EAAS2wD,EAAMxzJ,GAAG,IAAM,EAAGi3I,EAAe6vB,EAAI5qF,EAAMl8E,GAAG8I,MAOvEhB,EAAEgB,GAAK,CAACg+J,GAGV,OAAO,IAAIxvB,EAAY,CACrBn+H,KAAMrR,EACN6M,KAAM,CAACmM,EAAM,SC7Ff,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzFmmJ,IAAiC,QAAQ,GAAM,IAAe3gE,IACvE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,aACNmhF,EAAY,eACZH,EAAc,SACdp0C,EAAQ,YACRm0C,EAAW,YACXM,GACEhxC,EACAmgE,EAAkBL,GAAsB,CAC1C9uB,gBA2BF,OAAOvd,EAAM,GAAM,CACjB,+BAAgC,SAAiCroH,EAAG1I,GAClE,OAoEJ,SAAoC0I,EAAGw1J,GASrC,IAPA,IAAIz/D,EAAI,CAACg/D,EAAgB/0J,EAAGw1J,GAAI,GAAMn/I,MAAMnf,KAAInG,GAAKA,EAAE,MACnDqe,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAClBxxI,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KAEHzuJ,EAAI,EAAGA,EAAIurC,EAASvrC,IAG3B,IAFA,IAAImnK,EAAI1/D,EAAE1nG,OAEDiI,EAAI,EAAGA,EAAIm/J,EAAGn/J,IAAK,CAW1B,IAVA,IAAIgB,EAAIy+F,EAAEz/F,GAENo/J,EAAU,GACVC,EAAW,GAEXx6E,EAAa+hE,EAAI5uJ,GACjBq7G,EAAYuzC,EAAI5uJ,EAAI,GAEpBsnK,EAAM,EAEDx+J,EAAI+jF,EAAY/jF,EAAIuyG,EAAWvyG,IAAK,CAC3C,IAAI+xJ,EAAIxxJ,EAAMP,GAEV+xJ,IAAM76J,EACRsnK,EAAMl6J,EAAOtE,GACJ+xJ,EAAI76J,IAEbonK,EAAQtkK,KAAKsK,EAAOtE,IACpBu+J,EAASvkK,KAAK+3J,IAIlB,GAAK7jB,EAAYswB,EAAK,GAQf,GAAKtwB,EAAYhuI,EAAEhJ,GAAI,IAWvB,GAAU,IAANgI,EAAS,CAElB,IAAIu/J,EAAO,IAAIv+J,GACfu+J,EAAKvnK,GAAK,EAEV,IAAK,IAAIwnK,EAAM,EAAGC,EAAcJ,EAAStnK,OAAQynK,EAAMC,EAAaD,IAAO,CACzE,IAAIE,EAAML,EAASG,GACnBD,EAAKG,GAAO7kE,EAAS0kE,EAAKG,GAAMN,EAAQI,IAG1C//D,EAAE3kG,KAAKykK,QArByB,CAEhC,GAAU,IAANv/J,EAEF,MAAO,GAGPy/F,EAAEmb,OAAO56G,EAAG,GACZA,GAAK,EACLm/J,GAAK,MAjBiB,CAExBn+J,EAAEhJ,GAAKo3I,EAAapuI,EAAEhJ,GAAIsnK,GAE1B,IAAK,IAAIK,EAAM,EAAGC,EAAaP,EAAStnK,OAAQ4nK,EAAMC,EAAYD,IAAO,CACvE,IAAIE,EAAKR,EAASM,GAClB3+J,EAAE6+J,GAAMhlE,EAAS75F,EAAE6+J,GAAK5wB,EAAejuI,EAAEhJ,GAAIonK,EAAQO,OA4B7D,OAAOlgE,EAAE7+F,KAAId,GAAK,IAAIwvI,EAAY,CAChCn+H,KAAMrR,EAAEc,KAAInG,GAAK,CAACA,KAClBkS,KAAM,CAACmM,EAAM,OA3INimJ,CAA2Br1J,EAAG1I,IAEvC,8BAA+B,SAAgC0I,EAAG1I,GAChE,OAAOg+J,EAA0Bt1J,EAAG1I,IAEtC,wBAAyB,SAA0BnG,EAAGmG,GAKpD,OAFQg+J,EAFA/wG,EAAOpzD,GAEsBmG,GAE5BJ,KAAI8c,GAAKA,EAAEnjB,eAIxB,SAASykK,EAA0Bt1J,EAAGw1J,GASpC,IALA,IAAIz/D,EAAI,CAACg/D,EAAgB/0J,EAAGw1J,GAAI,GAAMn/I,MAAMnf,KAAInG,GAAKA,EAAE,MACnD8kG,EAAI71F,EAAEqW,MACNjH,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAEb5+I,EAAI,EAAGA,EAAIurC,EAASvrC,IAG3B,IAFA,IAAImnK,EAAI1/D,EAAE1nG,OAEDiI,EAAI,EAAGA,EAAIm/J,EAAGn/J,IAAK,CAC1B,IAAIgB,EAAIy+F,EAAEz/F,GAEV,GAAKgvI,EAAYzvC,EAAEvnG,GAAGA,GAAI,GAQnB,GAAKg3I,EAAYhuI,EAAEhJ,GAAI,IAWvB,GAAU,IAANgI,EAAS,CAElB,IAAIu/J,EAAO,IAAIv+J,GACfu+J,EAAKvnK,GAAK,EAEV,IAAK,IAAIomJ,EAAKpmJ,EAAI,EAAGomJ,EAAK76G,EAAS66G,IACjCmhB,EAAKnhB,GAAMvjD,EAAS0kE,EAAKnhB,GAAK7+C,EAAE6+C,GAAIpmJ,IAGtCynG,EAAE3kG,KAAKykK,QApByB,CAEhC,GAAU,IAANv/J,EAEF,MAAO,GAGPy/F,EAAEmb,OAAO56G,EAAG,GACZA,GAAK,EACLm/J,GAAK,MAjBqB,CAE5Bn+J,EAAEhJ,GAAKo3I,EAAapuI,EAAEhJ,GAAIunG,EAAEvnG,GAAGA,IAE/B,IAAK,IAAI8I,EAAI9I,EAAI,EAAG8I,EAAIyiC,EAASziC,IAE/BE,EAAEF,GAAK+5F,EAAS75F,EAAEF,GAAImuI,EAAejuI,EAAEhJ,GAAIunG,EAAEz+F,GAAG9I,MA2BxD,OAAOynG,EAAE7+F,KAAId,GAAK,IAAIwvI,EAAY,CAChCn+H,KAAMrR,EAAEc,KAAInG,GAAK,CAACA,KAClBkS,KAAM,CAACmM,EAAM,WC1Gf,GAAe,CAAC,YAAa,cAAe,iBACrCgnJ,IAAgC,QAFhC,MAE8C,IAAexhE,IACtE,IAAI,UACF6wC,EAAS,YACTH,EAAW,cACXS,GACEnxC,EAMJ,SAASoxC,IACP,KAAMp2I,gBAAgBo2I,GACpB,MAAM,IAAI94D,YAAY,oDAIxBt9E,KAAKitJ,QAAU,GACfjtJ,KAAKymK,MAAQ,IAAItwB,EAiInB,OA1HAC,EAAIp1I,UAAU8W,KAAO,MACrBs+H,EAAIp1I,UAAU0lK,OAAQ,EAQtBtwB,EAAIp1I,UAAUwoE,IAAM,SAAU9qE,EAAGiI,GAE/B,GAAK3G,KAAKitJ,QAAQvuJ,GAQhBsB,KAAKitJ,QAAQvuJ,GAAGe,MAAQkH,MARJ,CAEpB,IAAI0mB,EAAOrtB,KAAKymK,MAAMp0H,OAAO3zC,EAAGiI,GAGhC3G,KAAKitJ,QAAQvuJ,GAAK2uB,IAOtB+oH,EAAIp1I,UAAU6B,IAAM,SAAUnE,GAC5B,IAAI2uB,EAAOrtB,KAAKitJ,QAAQvuJ,GAExB,OAAI2uB,EACKA,EAAK5tB,MAGP,GAGT22I,EAAIp1I,UAAU2lK,WAAa,SAAUjoK,EAAGiI,GAEtC,IAAI0mB,EAAOrtB,KAAKitJ,QAAQvuJ,GAEnB2uB,EAOHA,EAAK5tB,MAAQo2I,EAAUxoH,EAAK5tB,MAAOkH,IALnC0mB,EAAOrtB,KAAKymK,MAAMp0H,OAAO3zC,EAAGiI,GAE5B3G,KAAKitJ,QAAQvuJ,GAAK2uB,IAOtB+oH,EAAIp1I,UAAU+b,QAAU,SAAU3X,EAAMyoH,EAAIxqF,GAE1C,IAAIujI,EAAO5mK,KAAKymK,MACZ36J,EAAS9L,KAAKitJ,QAEd/1G,EAAQ,GAER7pB,EAAOu5I,EAAK/O,iBAOhB,IALIxqI,GACF6pB,EAAM11C,KAAK6rB,GAINA,GAAQA,EAAK/tB,KAAOuuH,GAErBxgG,EAAK/tB,KAAO8F,IAETswI,EAAYroH,EAAK5tB,MAAO,IAE3B4jC,EAAShW,EAAK/tB,IAAK+tB,EAAK5tB,MAAOO,QAKnCqtB,EAAOu5I,EAAK/O,mBAGV3gH,EAAM11C,KAAK6rB,GAKf,IAAK,IAAI3uB,EAAI,EAAGA,EAAIw4C,EAAMz4C,OAAQC,IAAK,CAErC,IAAI8G,EAAI0xC,EAAMx4C,GAIdoN,GAFAuhB,EAAOu5I,EAAKv0H,OAAO7sC,EAAElG,IAAKkG,EAAE/F,QAEhBH,KAAO+tB,IAIvB+oH,EAAIp1I,UAAU6lK,KAAO,SAAUnoK,EAAG8I,GAEhC,IAAIs/J,EAAQ9mK,KAAKitJ,QAAQvuJ,GACrBqoK,EAAQ/mK,KAAKitJ,QAAQzlJ,GAEzB,IAAKs/J,GAASC,EAEZD,EAAQ9mK,KAAKymK,MAAMp0H,OAAO3zC,EAAGqoK,EAAMtnK,OAEnCO,KAAKymK,MAAM/5I,OAAOq6I,GAGlB/mK,KAAKitJ,QAAQvuJ,GAAKooK,EAClB9mK,KAAKitJ,QAAQzlJ,QAAKnH,OACb,GAAIymK,IAAUC,EAEnBA,EAAQ/mK,KAAKymK,MAAMp0H,OAAO7qC,EAAGs/J,EAAMrnK,OAEnCO,KAAKymK,MAAM/5I,OAAOo6I,GAGlB9mK,KAAKitJ,QAAQzlJ,GAAKu/J,EAClB/mK,KAAKitJ,QAAQvuJ,QAAK2B,OACb,GAAIymK,GAASC,EAAO,CAEzB,IAAIpgK,EAAImgK,EAAMrnK,MACdqnK,EAAMrnK,MAAQsnK,EAAMtnK,MACpBsnK,EAAMtnK,MAAQkH,IAIXyvI,IACN,CACDztB,SAAS,ICtJP,GAAO,WACP,GAAe,CAAC,QAAS,OAAQ,SAAU,SAAU,eAAgB,mBAAoB,SAClFq+C,IAAgC,QAAQ,GAAM,IAAehiE,IACtE,IAAI,MACFyzB,EAAK,KACLplH,EAAI,OACJ3H,EAAM,OACN2iE,EAAM,aACNs6D,EAAY,iBACZK,EAAgB,MAChB0L,GACE1vC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,iCAAkC,SAAgCyS,EAAI0zB,GACpE,GAAuC,IAAnCvwF,EAAOh7D,EAAK63H,GAAK,IAAIwJ,EAAM,IAE7B,OAAO,SAAQkqB,GACV,GAAuC,IAAnCvwF,EAAOh7D,EAAKurJ,GAAK,IAAIlqB,EAAM,IACpC,OAAO,SAAQxJ,GAGjB,IAAI4zB,GAAK,SAAQ5zB,GACb6zB,GAAK,SAAQH,GACjB,OAAOlzJ,EAAOs9H,EAAiB81B,EAAIC,GAAKp2B,EAAam2B,EAAIC,UC5C3D,GAAe,CAAC,QAAS,SAAU,MAAO,YAAa,eAAgB,iBAAkB,WAAY,SAAU,cAAe,aAAc,cAAe,eAAgB,OACpKkI,IAA2B,QAF3B,MAEyC,IAAejiE,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,IACN3qD,EAAG,UACH6rI,EAAS,aACTC,EAAY,eACZH,EAAc,SACdp0C,EAAQ,OACR6sB,EAAM,YACNsnB,EAAW,WACXjoB,EAAU,YACVuoB,EAAW,aACXC,EAAY,IACZG,GACEpxC,EA4BJ,OAAOyzB,EA7CE,MA6CU,CACjBud,YAAa,SAAqB5lI,GAChC,OAAO82J,EAAU92J,IAEnB6lI,aAAc,SAAsB7lI,GAClC,OAoMJ,SAAoBA,GAElB,IAmBI1R,EAAG8I,EAAGd,EAnBN8Y,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAElB93I,EAAIQ,KAAKwsB,IAAIhT,EAAMyqB,GAEnBn+B,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KAERga,EAAU,GACVC,EAAS,GACTC,EAAO,GACPC,EAAQ,CAAC9nJ,EAAMha,GAEf+hK,EAAU,GACVC,EAAS,GACTC,EAAO,GACPC,EAAQ,CAACliK,EAAGykC,GAIZ09H,EAAO,GACPC,EAAO,GAEX,IAAKlpK,EAAI,EAAGA,EAAI8gB,EAAM9gB,IACpBipK,EAAKjpK,GAAKA,EACVkpK,EAAKlpK,GAAKA,EAIZ,IAaI8mG,EAAQ,WAEV,IAAIqiE,EAAM,IAAIzxB,EAEV5uI,EAAIgY,IAEN6nJ,EAAK7lK,KAAK2lK,EAAQ1oK,QAElB0oK,EAAQ3lK,KAAK,GACb4lK,EAAO5lK,KAAKgG,IAIdigK,EAAKjmK,KAAK+lK,EAAQ9oK,QAElB,IAAIixF,EAAK49D,EAAI9lJ,GACTuoF,EAAKu9D,EAAI9lJ,EAAI,GAEjB,IAAKd,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAEnBhI,EAAIqJ,EAAMrB,GAEVmhK,EAAIr+F,IAAIm+F,EAAKjpK,GAAIoN,EAAOpF,IAItBc,EAAI,GAENqgK,EAAI9qJ,QAAQ,EAAGvV,EAAI,GAAG,SAAUd,EAAGohK,GAEjC7xB,EAAawZ,YAAY/oJ,EAAGygK,EAASC,EAAQC,GAAM,SAAU3oK,EAAGqpK,GAE1DrpK,EAAIgI,GAENmhK,EAAIlB,WAAWjoK,EAAG+uH,EAAWkoB,EAAeoyB,EAAKD,WAOzD,IAtDqCthK,EAAGe,EAEpCmoJ,EACAC,EAmDAlsD,EAAKj8F,EACL69J,EAAMwC,EAAIhlK,IAAI2E,GACdwgK,EAAQh+J,EAAIq7J,GAEhBwC,EAAI9qJ,QAAQvV,EAAI,EAAGgY,EAAO,GAAG,SAAUhZ,EAAGG,GAExC,IAAIshK,EAAOj+J,EAAIrD,GAEXynH,EAAO65C,EAAMD,KAEfvkE,EAAKj9F,EAELwhK,EAAQC,EAER5C,EAAM1+J,MAINa,IAAMi8F,IAERwyC,EAAaoJ,UAAU73I,EAAGi8F,EAAI6jE,EAAM,GAAIH,EAASC,EAAQC,GAGzDpxB,EAAaoJ,UAAU73I,EAAGi8F,EAAIikE,EAAM,GAAIH,EAASC,EAAQC,GAGzDI,EAAIhB,KAAKr/J,EAAGi8F,GAhF0Bl8F,EAkFvBk8F,EAhFbisD,EAAKkY,EAF4BphK,EAkFvBgB,GA/EVmoJ,EAAKiY,EAAKrgK,GAEdogK,EAAKjY,GAAMnoJ,EACXogK,EAAKhY,GAAMnpJ,EAEXohK,EAAKphK,GAAKmpJ,EACViY,EAAKrgK,GAAKmoJ,GA6EVmY,EAAI9qJ,QAAQ,EAAGyC,EAAO,GAAG,SAAUhZ,EAAGG,GAEhCH,GAAKgB,GAEP+/J,EAAQ/lK,KAAKmF,GACb6gK,EAAOhmK,KAAKgF,KAGZG,EAAImvI,EAAanvI,EAAG0+J,GAEf3vB,EAAY/uI,EAAG,KAElBwgK,EAAQ3lK,KAAKmF,GACbygK,EAAO5lK,KAAKgF,SAMpB,IAAKgB,EAAI,EAAGA,EAAIyiC,EAASziC,IACvBg+F,IAOF,OAHAiiE,EAAKjmK,KAAK+lK,EAAQ9oK,QAClB4oK,EAAK7lK,KAAK2lK,EAAQ1oK,QAEX,CACLonK,EAAG,IAAI5vB,EAAa,CAClBnqI,OAAQq7J,EACRp/J,MAAOq/J,EACP9Z,IAAK+Z,EACLh0J,KAAMi0J,IAERY,EAAG,IAAIjyB,EAAa,CAClBnqI,OAAQy7J,EACRx/J,MAAOy/J,EACPla,IAAKma,EACLp0J,KAAMq0J,IAER5jK,EAAG6jK,EACHliK,SAAU,WACR,MAAO,MAAQzF,KAAK6lK,EAAEpgK,WAAa,QAAUzF,KAAKkoK,EAAEziK,WAAa,QAAUzF,KAAK8D,IApW3EqkK,CAAW/3J,IAEpBxR,MAAO,SAAe2C,GAEpB,IAEI6iB,EAAI8iJ,EAFAvyG,EAAOpzD,IAKf,MAAO,CACLskK,EAAGzhJ,EAAEyhJ,EAAE5kK,UACPinK,EAAG9jJ,EAAE8jJ,EAAEjnK,UACP6C,EAAGsgB,EAAEtgB,MAKX,SAASojK,EAAU92J,GAEjB,IAaI1R,EAAG8I,EAAGd,EAbN8Y,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAElB93I,EAAIQ,KAAKwsB,IAAIhT,EAAMyqB,GAEnBpyB,GAAO,SAAMzH,EAAEqW,OAEf2hJ,EAAQ,GACRd,EAAQ,CAAC9nJ,EAAMha,GAEf6iK,EAAQ,GACRX,EAAQ,CAACliK,EAAGykC,GAIZnmC,EAAI,GAER,IAAKpF,EAAI,EAAGA,EAAI8gB,EAAM9gB,IACpBoF,EAAEpF,GAAKA,EAIT,IAAK8I,EAAI,EAAGA,EAAIyiC,EAASziC,IAAK,CAE5B,GAAIA,EAAI,EAEN,IAAK9I,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAAK,CAEzB,IAAI8zB,EAAMxsB,KAAKwsB,IAAI9zB,EAAG8I,GAElBu+B,EAAI,EAER,IAAKr/B,EAAI,EAAGA,EAAI8rB,EAAK9rB,IAEnBq/B,EAAI8vG,EAAU9vG,EAAG4vG,EAAe99H,EAAKnZ,GAAGgI,GAAImR,EAAKnR,GAAGc,KAGtDqQ,EAAKnZ,GAAG8I,GAAK+5F,EAAS1pF,EAAKnZ,GAAG8I,GAAIu+B,GAKtC,IAAI09D,EAAKj8F,EACLwgK,EAAQ,EACR3C,EAAM,EAEV,IAAK3mK,EAAI8I,EAAG9I,EAAI8gB,EAAM9gB,IAAK,CAEzB,IAAIiI,EAAIkR,EAAKnZ,GAAG8I,GAEZygK,EAAOj+J,EAAIrD,GAEXynH,EAAO65C,EAAMD,KAEfvkE,EAAK/kG,EAELspK,EAAQC,EAER5C,EAAM1+J,GAaV,GARIa,IAAMi8F,IAER3/F,EAAE0D,GAAK,CAAC1D,EAAE2/F,GAAK3/F,EAAE2/F,GAAM3/F,EAAE0D,IAAI,GAE7BwuI,EAAYqJ,UAAU73I,EAAGi8F,EAAI5rF,IAI3BrQ,EAAIgY,EAEN,IAAK9gB,EAAI8I,EAAI,EAAG9I,EAAI8gB,EAAM9gB,IAAK,CAE7B,IAAI4pK,EAAMzwJ,EAAKnZ,GAAG8I,GAEbkuI,EAAY4yB,EAAK,KAEpBzwJ,EAAKnZ,GAAG8I,GAAKsuI,EAAaj+H,EAAKnZ,GAAG8I,GAAI69J,KAO9C,IAAK79J,EAAI,EAAGA,EAAIyiC,EAASziC,IAEvB,IAAK9I,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAEV,IAAN8I,IAEE9I,EAAIurC,IAENo+H,EAAM3pK,GAAK,IAIb0pK,EAAM1pK,GAAK,IAITA,EAAI8I,GAEF9I,EAAIurC,IAENo+H,EAAM3pK,GAAG8I,GAAKqQ,EAAKnZ,GAAG8I,IAIpBA,EAAIgY,IAEN4oJ,EAAM1pK,GAAG8I,GAAK,IAOd9I,IAAM8I,GAiBN9I,EAAIurC,IAENo+H,EAAM3pK,GAAG8I,GAAK,GAIZA,EAAIgY,IAEN4oJ,EAAM1pK,GAAG8I,GAAKqQ,EAAKnZ,GAAG8I,MAvBlB9I,EAAIurC,IAENo+H,EAAM3pK,GAAG8I,GAAKqQ,EAAKnZ,GAAG8I,IAIpBA,EAAIgY,IAEN4oJ,EAAM1pK,GAAG8I,GAAK,IAqBtB,IAAIsjC,EAAI,IAAIkrG,EAAY,CACtBn+H,KAAMuwJ,EACN/0J,KAAMi0J,IAGJ5+F,EAAI,IAAIstE,EAAY,CACtBn+H,KAAMwwJ,EACNh1J,KAAMq0J,IAGJ5Z,EAAK,GAET,IAAKpvJ,EAAI,EAAG8G,EAAI1B,EAAErF,OAAQC,EAAI8G,EAAG9G,IAC/BovJ,EAAGhqJ,EAAEpF,IAAMA,EAIb,MAAO,CACLmnK,EAAG/6H,EACHo9H,EAAGx/F,EACH5kE,EAAGgqJ,EACHroJ,SAAU,WACR,MAAO,MAAQzF,KAAK6lK,EAAEpgK,WAAa,QAAUzF,KAAKkoK,EAAEziK,WAAa,QAAUzF,KAAK8D,QCtOjF,SAASykK,GAAO/gK,EAAGd,EAAGgqD,EAAGlrB,EAAM/gC,EAAM+jK,EAAM10F,GAEhD,IAAIv9D,EAAM,EAIV,IAFAm6C,EAAEojB,GAAStsE,EAEJ+O,GAAO,GAAG,CAEf,IAAIzS,EAAI4sD,EAAEojB,EAAQv9D,GAEd7X,EAAIgyD,EAAElrB,EAAO1hC,IAEN,IAAPpF,GAEF6X,IAEAiyJ,EAAK9hK,KAAO5C,IAGZ4sD,EAAElrB,EAAO1hC,GAAK4sD,EAAEjsD,EAAO/F,GAIvBgyD,EAAEojB,KAFAv9D,GAEe7X,GAIrB,OAAOgI,ECjCF,SAAS+hK,GAAO/pK,GAErB,OAAQA,EAAI,ECLd,IACI,GAAe,CAAC,MAAO,WAAY,aAC5BgqK,IAA6B,QAF7B,QAE2C,IAAe1jE,IACnE,IAAI,IACFz4F,EAAG,SACHiY,EAAQ,UACR4oG,GACEpoB,EAaJ,OAAO,SAAe1gB,EAAO/iF,GAE3B,IAAKA,GAAK+iF,GAAS,GAAKA,EAAQ,EAC9B,OAAO,KAIT,IAAIssE,EAAQrvJ,EAAE+7I,MAEVltI,EAAIwgJ,EAAM,GACVprJ,EAAIorJ,EAAM,GAEV+X,EAAQ,EAERC,EAAQ5iK,KAAKyJ,IAAI,GAAI,GAAKzJ,KAAKC,KAAKT,IAGpCqjK,EA+aN,SAA6BvkF,EAAO/iF,EAAG6O,EAAG5K,EAAGojK,GAE3C,IAAIE,EAAK17C,EAAU7rH,GAEnB,GAAc,IAAV+iF,GAAe9+E,IAAM4K,EAEvB,OAAO7D,EAAIhL,EAAGunK,GAIhB,GAAc,IAAVxkF,EAAa,CAOf,IALA,IAAIykF,EAASD,EAAG5b,OACZ8b,EAAOF,EAAG3b,KAEV96E,EAAK,EAEA7qE,EAAI,EAAGA,EAAI4I,EAAG5I,IAAK,CAE1B,IAAI1D,EAAIklK,EAAKxhK,GAIb,GAFAwhK,EAAKxhK,GAAK6qE,IAEN22F,EAAKxhK,EAAI,GAAK1D,EAAI8kK,GAKtB,IAAK,IAAIx2F,EAAK42F,EAAKxhK,EAAI,GAAI1D,EAAIsuE,EAAItuE,IACjCilK,EAAO12F,KAAQ02F,EAAOjlK,GAS1B,OAJAklK,EAAK54J,GAAKiiE,EAEV9wE,EAAI6rH,EAAU07C,GAEPtkJ,EAASskJ,EAAIvnK,GAItB,OAAOijB,EAASskJ,EAAIvnK,GAzdX0nK,CAAoB3kF,EAAO/iF,EAAG6O,EAAG5K,EAF1CojK,EAAQ5iK,KAAKwsB,IAAIhtB,EAAI,EAAGojK,KCxBrB,SAAiBrnK,EAAG8hC,EAAU5yB,GAWnC,IATA,IAAI+gJ,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KAGT3nJ,EAFQjE,EAAE+7I,MAEA,GAEV4rB,EAAK,EAEA1hK,EAAI,EAAGA,EAAIhC,EAAGgC,IAAK,CAE1B,IAAI1D,EAAI4tJ,EAAKlqJ,GAIb,IAFAkqJ,EAAKlqJ,GAAK0hK,EAEHplK,EAAI4tJ,EAAKlqJ,EAAI,GAAI1D,IAElBu/B,EAASouH,EAAO3tJ,GAAI0D,EAAGgqJ,EAAUA,EAAQ1tJ,GAAK,EDUjC,QCRf2tJ,EAAOyX,GAAMzX,EAAO3tJ,GAEhB0tJ,IACFA,EAAQ0X,GAAM1X,EAAQ1tJ,IAIxBolK,KAMNxX,EAAKlsJ,GAAK0jK,EAEVzX,EAAOnwC,OAAO4nD,EAAIzX,EAAOhzJ,OAASyqK,GAE9B1X,GACFA,EAAQlwC,OAAO4nD,EAAI1X,EAAQ/yJ,OAASyqK,GDVpCC,CAAQN,EAAI/T,GAuCZ,IArCA,IAmCIp2J,EAAG8I,EAAGd,EAAGqpF,EAAIq5E,EAAIjoK,EAAGkoK,EAAI/rE,EAAIgsE,EAAKC,EAAIC,EAAKp3F,EAAIC,EAAIo3F,EAAIvtH,EAAGxsC,EAnCzDo8D,EAAS+8F,EAAG3b,OACZ0E,EAAOiX,EAAG1b,KAEVuc,EAAM9X,EAAKpsJ,GAEXwzF,EAAI,GAEJ2wE,EAAI,GAGJC,EAAKpkK,EAAI,EAETf,EAAO,GAAKe,EAAI,GAEhBggC,EAAO,GAAKhgC,EAAI,GAEhBqkK,EAAO,GAAKrkK,EAAI,GAEhBkyJ,EAAS,GAAKlyJ,EAAI,GAElBkrD,EAAI,GAAKlrD,EAAI,GAEbskK,EAAQ,GAAKtkK,EAAI,GAGjBshF,EAAOkS,EAEPs4D,EAqcN,SAAkC9rJ,EAAGosJ,EAAM+X,EAAGnrK,EAAKgnC,EAAMshD,EAAMriF,EAAMqlK,EAAOF,EAAIl5G,EAAGm5G,EAAMnS,GAEvF,IAAK,IAAIhxJ,EAAI,EAAGA,EAAIlB,EAAGkB,IACrBijK,EA3dQ,EA2dAjjK,GAAKkrJ,EAAKlrJ,EAAI,GAAKkrJ,EAAKlrJ,GAGlCijK,EA9dU,EA8dFnkK,GAAK,EAEb,IAAK,IAAI9G,EAAI,EAAGA,GAAK8G,EAAG9G,IAEtBirK,EAAEnkI,EAAO9mC,IAAM,EACfooF,EAAKpoF,IAAM,EACXirK,EAAEllK,EAAO/F,IAAM,EAEfirK,EAAEG,EAAQprK,IAAM,EAEhBirK,EAAEC,EAAKlrK,GAAK,EAEZirK,EAAEj5G,EAAIhyD,GAAK,EAEXirK,EAAEE,EAAOnrK,GAAK,EAEdirK,EAAEjS,EAASh5J,GAAKirK,EA9eR,EA8egBjrK,GAI1B,IAAI4yJ,EAAOyY,EAAQ,EAAG,EAAGJ,EAAGj5G,EAAGlrD,GAS/B,OANAmkK,EAAEE,EAAOrkK,IAAM,EAEfosJ,EAAKpsJ,IAAM,EAEXmkK,EAAEj5G,EAAIlrD,GAAK,EAEJ8rJ,EAxeI0Y,CAAyBxkK,EAAGosJ,EAAM+X,EAnBnC,EAmB2CnkI,EAAMshD,EAAMriF,EAAMqlK,EAAOF,EAAIl5G,EAAGm5G,EAAMnS,GAGvFuS,EA8eN,SAAgCzkK,EAAGosJ,EAAM+X,EAAGjS,EAAQmS,EAAMn5G,EAAGk4G,EAAOgB,EAAIpkI,EAAMshD,EAAMriF,GAIlF,IAFA,IAAIwlK,EAAM,EAEDvrK,EAAI,EAAGA,EAAI8G,EAAG9G,IAAK,CAE1B,IAAIgR,EAAIi6J,EAAEjS,EAASh5J,GAEnB,GAAU,IAANgR,EAEFi6J,EAAEE,EAAOnrK,IAAM,EACfurK,IAEArY,EAAKlzJ,IAAM,EACXirK,EAAEj5G,EAAIhyD,GAAK,OACN,GAAIgR,EAAIk5J,EAEbe,EAAEC,EAAKlrK,GAAK,EAEZirK,EAAEE,EAAOnrK,IAAM,EACfurK,IACArY,EAAKlzJ,GAAK+pK,GAAOjjK,GACjBmkK,EAAEC,EAAKpkK,SACF,CACL,IAAI02C,EAAIytH,EAAEnkI,EAAO91B,IAEN,IAAPwsC,IACF4qC,EAAK5qC,GAAKx9C,GAIZirK,EAAEllK,EAAO/F,GAAKirK,EAAEnkI,EAAO91B,GACvBi6J,EAAEnkI,EAAO91B,GAAKhR,GAIlB,OAAOurK,EAlhBGC,CAAuB1kK,EAAGosJ,EAAM+X,EAAGjS,EAAQmS,EAAMn5G,EAAGk4G,EAAOgB,EAAIpkI,EAAMshD,EAAMriF,GAGjF0lK,EAAS,EAINF,EAAMzkK,GAAG,CAId,IAAKkB,GAAK,EAAGyjK,EAAS3kK,IAAiC,KAA3BkB,EAAIijK,EAAEnkI,EAAO2kI,IAAiBA,MAIrC,IAAjBR,EAAEllK,EAAOiC,KACXogF,EAAK6iF,EAAEllK,EAAOiC,KAAO,GAIvBijK,EAAEnkI,EAAO2kI,GAAUR,EAAEllK,EAAOiC,GAE5B,IAAI0jK,EAAQT,EAAEE,EAAOnjK,GAEjB2jK,EAAMV,EAAEC,EAAKljK,GAEjBujK,GAAOI,EAIP,IAAIC,EAAK,EAETX,EAAEC,EAAKljK,IAAM2jK,EACb,IAAIvmK,EAAI8tJ,EAAKlrJ,GAET6jK,EAAgB,IAAVH,EAActmK,EAAI4lK,EACxBc,EAAMD,EAEV,IAAKx6E,EAAK,EAAGA,GAAMq6E,EAAQ,EAAGr6E,IAAM,CAgBlC,IAfIA,EAAKq6E,GAEPjpK,EAAIuF,EAEJ2iK,EAAKvlK,EAELw5F,EAAKqsE,EAnED,EAmESjjK,GAAK0jK,IAIlBf,EAAKzX,EADLzwJ,EAAI2qE,EAAOhoE,MAGXw5F,EAAKqsE,EAzED,EAyESxoK,IAGVioK,EAAK,EAAGA,GAAM9rE,EAAI8rE,KAGhBE,EAAMK,EAAEC,GAFblrK,EAAIotE,EAAOu9F,SAEc,IAKzBiB,GAAMhB,EAENK,EAAEC,EAAKlrK,IAAM4qK,EAEbx9F,EAAO0+F,KAAS9rK,GAEK,IAAjBirK,EAAEllK,EAAO/F,KACXooF,EAAK6iF,EAAEllK,EAAO/F,IAAMooF,EAAKpoF,KAIV,IAAbooF,EAAKpoF,GACPirK,EAAEllK,EAAOqiF,EAAKpoF,IAAMirK,EAAEllK,EAAO/F,GAE7BirK,EAAEnkI,EAAOmkI,EAAEjS,EAASh5J,IAAMirK,EAAEllK,EAAO/F,IAInCyC,IAAMuF,IAERkrJ,EAAKzwJ,GAAKsnK,GAAO/hK,GAEjBijK,EAAEj5G,EAAIvvD,GAAK,GAqBf,IAhBc,IAAVipK,IACFV,EAAMc,GAIRb,EAAEjS,EAAShxJ,GAAK4jK,EAEhB1Y,EAAKlrJ,GAAK6jK,EACVZ,EAvHQ,EAuHAjjK,GAAK8jK,EAAMD,EAEnBZ,EAAEE,EAAOnjK,IAAM,EAIf4qJ,EAAOyY,EAAQzY,EAAMqX,EAAOgB,EAAGj5G,EAAGlrD,GAE7B+jK,EAAKgB,EAAKhB,EAAKiB,EAAKjB,IAGvB,MAAKC,EAAMG,EAAEE,GAFbnrK,EAAIotE,EAAOy9F,OAEgB,GAA3B,CAMA,IAAIkB,EAAOnZ,GADXgY,GAAOK,EAAEC,EAAKlrK,IAGd,IAAKoF,EAAI8tJ,EAAKlzJ,GAAI0zE,EAAKw/E,EAAKlzJ,GAAK8qK,EAAM,EAAG1lK,GAAKsuE,EAAItuE,IAG7C6lK,EAAEj5G,GAFNvvD,EAAI2qE,EAAOhoE,MAEKwtJ,EAEdqY,EAAEj5G,EAAIvvD,IAAMmoK,EACU,IAAbK,EAAEj5G,EAAIvvD,KAEfwoK,EAAEj5G,EAAIvvD,GAAKwoK,EAAEjS,EAASv2J,GAAKspK,GASjC,IAAKlB,EAAKgB,EAAKhB,EAAKiB,EAAKjB,IAAM,CAO7B,IAHAl3F,GADAD,EAAKw/E,EADLlzJ,EAAIotE,EAAOy9F,KAEDI,EAAEE,EAAOnrK,GAAK,EACxB+qK,EAAKr3F,EAEAl2B,EAAI,EAAGxsC,EAAI,EAAG5L,EAAIsuE,EAAItuE,GAAKuuE,EAAIvuE,IAGlC,GAAiB,IAAb6lK,EAAEj5G,GAFNvvD,EAAI2qE,EAAOhoE,KAES,CAElB,IAAI4mK,EAAOf,EAAEj5G,EAAIvvD,GAAKmwJ,EAElBoZ,EAAO,GAETh7J,GAAKg7J,EAEL5+F,EAAO29F,KAAQtoK,EAEf+6C,GAAK/6C,IAGLywJ,EAAKzwJ,GAAKsnK,GAAO/hK,GAEjBijK,EAAEj5G,EAAIvvD,GAAK,GAMjBwoK,EAAEE,EAAOnrK,GAAK+qK,EAAKr3F,EAAK,EACxB,IAAIu4F,EAAKlB,EACLmB,GAAKx4F,EAAKu3F,EA5LR,EA4LgBjrK,GAEtB,IAAKoF,EAAIuuE,EAAK,EAAGvuE,EAAI8mK,GAAI9mK,IAAK,CAG5B,IAAI+mK,GAAMlB,EAAEC,GAFZpiK,EAAIskE,EAAOhoE,KAIP+mK,IAAO,IAKXn7J,GAAKm7J,GAEL/+F,EAAO29F,KAAQjiK,EAEf00C,GAAK10C,GAIG,IAANkI,GAEFkiJ,EAAKlzJ,GAAK+pK,GAAO/hK,GAGjB4jK,GAFAhB,GAAOK,EAAEC,EAAKlrK,GAId2rK,GAAOf,EACPW,GAAOX,EACPK,EAAEC,EAAKlrK,GAAK,EAEZirK,EAAEE,EAAOnrK,IAAM,IAGfirK,EAAEjS,EAASh5J,GAAKsH,KAAKwsB,IAAIm3I,EAAEjS,EAASh5J,GAAIgR,GAExCo8D,EAAO29F,GAAM39F,EAAO6+F,GAEpB7+F,EAAO6+F,GAAM7+F,EAAOsG,GAEpBtG,EAAOsG,GAAM1rE,EAEbijK,EAtOI,EAsOIjrK,GAAK+qK,EAAKr3F,EAAK,EAEvBl2B,GAAKA,EAAI,GAAKA,EAAIA,GAAK12C,EAEvBmkK,EAAEllK,EAAO/F,GAAKirK,EAAEG,EAAQ5tH,GACxBytH,EAAEG,EAAQ5tH,GAAKx9C,EAEfooF,EAAKpoF,GAAKw9C,GAWd,IANAytH,EAAEjS,EAAShxJ,GAAK4jK,EAGhBhZ,EAAOyY,EAAQzY,GAFfqX,EAAQ3iK,KAAKyJ,IAAIk5J,EAAO2B,IAEK3B,EAAOgB,EAAGj5G,EAAGlrD,GAGrC+jK,EAAKgB,EAAKhB,EAAKiB,EAAKjB,IAGvB,KAAII,EAAEC,GAFNlrK,EAAIotE,EAAOy9F,MAEM,GAUjB,IAJA7qK,EAAIirK,EAAEG,GADN5tH,EAAI4qC,EAAKpoF,KAGTirK,EAAEG,EAAQ5tH,IAAM,GAEF,IAAPx9C,IAA6B,IAAjBirK,EAAEllK,EAAO/F,GAAWA,EAAIirK,EAAEllK,EAAO/F,GAAI4yJ,IAAQ,CAI9D,IAHAh0D,EAAKqsE,EAtQD,EAsQSjrK,GACb8qK,EAAMG,EAAEE,EAAOnrK,GAEVoF,EAAI8tJ,EAAKlzJ,GAAK,EAAGoF,GAAK8tJ,EAAKlzJ,GAAK4+F,EAAK,EAAGx5F,IAC3C6lK,EAAEj5G,EAAIob,EAAOhoE,IAAMwtJ,EAGrB,IAAIwZ,GAAQpsK,EAEZ,IAAK8I,EAAImiK,EAAEllK,EAAO/F,IAAW,IAAP8I,GAAW,CAC/B,IAAIujK,GAAKpB,EAhRP,EAgReniK,KAAO81F,GAAMqsE,EAAEE,EAAOriK,KAAOgiK,EAE9C,IAAK1lK,EAAI8tJ,EAAKpqJ,GAAK,EAAGujK,IAAMjnK,GAAK8tJ,EAAKpqJ,GAAK81F,EAAK,EAAGx5F,IAE7C6lK,EAAEj5G,EAAIob,EAAOhoE,MAAQwtJ,IACvByZ,GAAK,GAKLA,IAEFnZ,EAAKpqJ,GAAKihK,GAAO/pK,GACjBirK,EAAEC,EAAKlrK,IAAMirK,EAAEC,EAAKpiK,GACpBmiK,EAAEC,EAAKpiK,GAAK,EAEZmiK,EAAEE,EAAOriK,IAAM,EAEfA,EAAImiK,EAAEllK,EAAO+C,GACbmiK,EAAEllK,EAAOqmK,IAAStjK,IAGlBsjK,GAAQtjK,EACRA,EAAImiK,EAAEllK,EAAO+C,KAQrB,IAAK1D,EAAIymK,EAAKhB,EAAKgB,EAAKhB,EAAKiB,EAAKjB,KAG3BD,GAAOK,EAAEC,GAFdlrK,EAAIotE,EAAOy9F,OAEe,IAK1BI,EAAEC,EAAKlrK,GAAK4qK,EAEZ55J,EAAIi6J,EAAEjS,EAASh5J,GAAK4rK,EAAKhB,GAGJ,IAAjBK,EAAEnkI,GAFN91B,EAAI1J,KAAKwsB,IAAI9iB,EAAGlK,EAAIykK,EAAMX,OAGxBxiF,EAAK6iF,EAAEnkI,EAAO91B,IAAMhR,GAItBirK,EAAEllK,EAAO/F,GAAKirK,EAAEnkI,EAAO91B,GACvBo3E,EAAKpoF,IAAM,EACXirK,EAAEnkI,EAAO91B,GAAKhR,EAEdyrK,EAASnkK,KAAKwsB,IAAI23I,EAAQz6J,GAC1Bi6J,EAAEjS,EAASh5J,GAAKgR,EAEhBo8D,EAAOhoE,KAAOpF,GAIhBirK,EAAEC,EAAKljK,GAAK2jK,EAEmB,IAA1BV,EA9UG,EA8UKjjK,GAAK5C,EAAIymK,KAEpB3Y,EAAKlrJ,IAAM,EAEXijK,EAAEj5G,EAAIhqD,GAAK,GAGC,IAAV0jK,IAEFV,EAAM5lK,GASV,IAAKpF,EAAI,EAAGA,EAAI8G,EAAG9G,IACjBkzJ,EAAKlzJ,GAAK+pK,GAAO7W,EAAKlzJ,IAGxB,IAAK8I,EAAI,EAAGA,GAAKhC,EAAGgC,IAClBmiK,EAAEnkI,EAAOh+B,IAAM,EAIjB,IAAKA,EAAIhC,EAAGgC,GAAK,EAAGA,IAEdmiK,EAAEC,EAAKpiK,GAAK,IAKhBmiK,EAAEllK,EAAO+C,GAAKmiK,EAAEnkI,EAAOosH,EAAKpqJ,IAC5BmiK,EAAEnkI,EAAOosH,EAAKpqJ,IAAMA,GAItB,IAAKrG,EAAIqE,EAAGrE,GAAK,EAAGA,IAEdwoK,EAAEC,EAAKzoK,IAAM,IAIA,IAAbywJ,EAAKzwJ,KAEPwoK,EAAEllK,EAAOtD,GAAKwoK,EAAEnkI,EAAOosH,EAAKzwJ,IAC5BwoK,EAAEnkI,EAAOosH,EAAKzwJ,IAAMA,GAKxB,IAAKuF,EAAI,EAAGhI,EAAI,EAAGA,GAAK8G,EAAG9G,KACR,IAAbkzJ,EAAKlzJ,KACPgI,EAAI6hK,GAAO7pK,EAAGgI,EAAGijK,EAAGnkI,EAAM/gC,EAAMu0F,EAAGtoC,IAOvC,OAFAsoC,EAAEsoB,OAAOtoB,EAAEv6F,OAAS,EAAG,GAEhBu6F,GA+JT,SAAS+wE,EAAQzY,EAAMqX,EAAOgB,EAAGj5G,EAAGlrD,GAClC,GAAI8rJ,EAAO,GAAKA,EAAOqX,EAAQ,EAAG,CAChC,IAAK,IAAIjiK,EAAI,EAAGA,EAAIlB,EAAGkB,IACJ,IAAbijK,EAAEj5G,EAAIhqD,KACRijK,EAAEj5G,EAAIhqD,GAAK,GAIf4qJ,EAAO,EAIT,OAAOA,EAGT,SAASwD,EAAMp2J,EAAG8I,GAChB,OAAO9I,IAAM8I,MEjmBV,SAASwjK,GAAOtsK,EAAG8I,EAAGkpD,EAAG6oB,EAAO0xF,EAAUC,EAAUj/D,GACzD,IAAIlmE,EAAGolI,EAGHpsE,EADAqsE,EAAQ,EAGZ,GAAI1sK,GAAK8I,GAAKkpD,EAAE6oB,EAAQ/xE,IAAMkpD,EAAEu6G,EAAWvsK,GACzC,OAAQ,EAIVgyD,EAAEu6G,EAAWvsK,GAAKgyD,EAAE6oB,EAAQ/xE,GAE5B,IAAI6jK,EAAQ36G,EAAEw6G,EAAWxsK,GAGzB,GAFAgyD,EAAEw6G,EAAWxsK,GAAK8I,GAEH,IAAX6jK,EAEFD,EAAQ,EACRrsE,EAAIrgG,MACC,CAIL,IAFA0sK,EAAQ,EAEHrsE,EAAIssE,EAAOtsE,IAAMruC,EAAEu7C,EAAWlN,GAAIA,EAAIruC,EAAEu7C,EAAWlN,IAIxD,IAAKh5D,EAAIslI,EAAOtlI,IAAMg5D,EAAGh5D,EAAIolI,EAE3BA,EAAUz6G,EAAEu7C,EAAWlmE,GACvB2qB,EAAEu7C,EAAWlmE,GAAKg5D,EAItB,MAAO,CACLqsE,MAAOA,EACPrsE,EAAGA,GCnDP,IACI,GAAe,CAAC,aACTusE,IAAgC,QAFhC,WAE8C,IAAetmE,IACtE,IAAI,UACFooB,GACEpoB,EAcJ,OAAO,SAAUzjG,EAAG4T,EAAQqzJ,EAAM+C,GAEhC,IAAKhqK,IAAM4T,IAAWqzJ,EACpB,OAAO,KAIT,IAKI9pK,EAAG8I,EAAGd,EAAG6yJ,EAAGz1J,EAAG23J,EAAIrpF,EALnBw+E,EAAQrvJ,EAAE+7I,MAEVltI,EAAIwgJ,EAAM,GACVprJ,EAAIorJ,EAAM,GAIV7qH,EAAI,EAAIvgC,GAAK+lK,EAAM/lK,EAAI4K,EAAI,EAAI,GAE/BsgD,EAAI,GAIJu6G,EAAWzlK,EAEX0lK,EAAW,EAAI1lK,EAEf+zE,EAAQ,EAAI/zE,EAEZggC,EAAO,EAAIhgC,EAEXf,EAAO,EAAIe,EAAI,EAGnB,IAAKkB,EAAI,EAAGA,EAAIq/B,EAAGr/B,IACjBgqD,EAAEhqD,IAAM,EAIV,IAAI8kK,EAAW,GAGX1C,EAAK17C,EAAU7rH,GAEfwnK,EAASD,EAAG5b,OACZ8b,EAAOF,EAAG3b,KAEd,IAAKzmJ,EAAI,EAAGA,EAAIlB,EAAGkB,IAKjB,IAFA8kK,EAFAhkK,EAAIghK,EAAK9hK,KAEuB,IAAlBgqD,EAAE6oB,EAAQ/xE,GAAY,EAAI,GAE1B,IAAPA,IAA8B,IAAlBkpD,EAAE6oB,EAAQ/xE,GAAWA,EAAI2N,EAAO3N,GACjDkpD,EAAE6oB,EAAQ/xE,GAAKd,EAKnB,GAAI6kK,EAAK,CAEP,IAAK7kK,EAAI,EAAGA,EAAIlB,EAAGkB,IACjBgqD,EAAE83G,EAAK9hK,IAAMA,EAIf,IAAKhI,EAAI,EAAGA,EAAI0R,EAAG1R,IAAK,CAEtB,IAAKgI,EAAIlB,EAAGi2J,EAAKuN,EAAKtqK,GAAI0zE,EAAK42F,EAAKtqK,EAAI,GAAIoF,EAAI23J,EAAI33J,EAAIsuE,EAAItuE,IAC1D4C,EAAIV,KAAKwsB,IAAI9rB,EAAGgqD,EAAEq4G,EAAOjlK,KAI3B4sD,EAAEjsD,EAAO/F,GAAKgyD,EAAElrB,EAAO9+B,GACvBgqD,EAAElrB,EAAO9+B,GAAKhI,GAKlB,IAAKA,EAAI,EAAGA,EAAI8G,EAAG9G,IACjBgyD,EA1Da,EA0DAhyD,GAAKA,EAGpB,IAAKgI,EAAI,EAAGA,EAAIlB,EAAGkB,IAAK,CAStB,KALmB,IAAfyO,EAFJ3N,EAAIghK,EAAK9hK,KAGP8kK,EAASr2J,EAAO3N,MAIb+xJ,EAAIgS,EAAM76G,EAAElrB,EAAO9+B,GAAKc,GAAU,IAAP+xJ,EAAUA,EAAIgS,EAAM76G,EAAEjsD,EAAO80J,IAAM,EACjE,IAAKz1J,EAAIklK,EAAKzP,GAAIz1J,EAAIklK,EAAKzP,EAAI,GAAIz1J,IAAK,CAEtC,IAAIsgB,EAAI4mJ,GADRtsK,EAAIqqK,EAAOjlK,GACO0D,EAAGkpD,EAAG6oB,EAAO0xF,EAAUC,EAzEhC,GA2EL9mJ,EAAEgnJ,OAAS,GACbI,EAAShkK,KAIK,IAAZ4c,EAAEgnJ,OACJI,EAASpnJ,EAAE26E,MAKE,IAAf5pF,EAAO3N,KACTkpD,EAvFW,EAuFElpD,GAAK2N,EAAO3N,IAK7B,IAAKA,EAAI,EAAGA,EAAIhC,EAAGgC,KACE,IAAf2N,EAAO3N,KACTgkK,EAASr2J,EAAO3N,KAAOgkK,EAAShkK,IAIpC,OAAOgkK,MClIP,GAAe,CAAC,MAAO,WAAY,aAC5BC,IAA6B,QAF7B,QAE2C,IAAezmE,IACnE,IAAI,IACFz4F,EAAG,SACHiY,EAAQ,UACR4oG,GACEpoB,EACA0mE,EAAQhD,GAAY,CACtBn8J,MACAiY,WACA4oG,cAEEu+C,EAAWL,GAAe,CAC5Bl+C,cAeF,OAAO,SAAe9oC,EAAO/iF,EAAGwlI,GAE9B,IAKIrgI,EALAgrJ,EAAOnwJ,EAAE4rJ,KAGT3nJ,EAFQjE,EAAE+7I,MAEA,GAIVv3G,EAAI,GAIR,GAFAA,EAAEg5D,EAAI2sE,EAAMpnF,EAAO/iF,GAEf+iF,IAAUv+C,EAAEg5D,EACd,OAAO,KAIT,GAAIgoC,EAAI,CAEN,IAAIr6H,EAAI43E,EC3CP,SAAmB/iF,EAAGqqK,EAAM7sE,EAAGjzF,GAmBpC,IAjBA,IAAI0lJ,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACTyD,EAAQrvJ,EAAE+7I,MACVuT,EAAMtvJ,EAAEg8I,UAERntI,EAAIwgJ,EAAM,GACVprJ,EAAIorJ,EAAM,GAEVe,EAAqC,KACrC7lF,EAAS,GAET8lF,EAAO,GAGPsX,EAAK,EAEAxiK,EAAI,EAAGA,EAAIlB,EAAGkB,IAAK,CAE1BkrJ,EAAKlrJ,GAAKwiK,EAIV,IAFA,IAAI1hK,EAAIu3F,EAAIA,EAAEr4F,GAAKA,EAEVmlK,EAAKna,EAAKlqJ,GAAI22E,EAAKuzE,EAAKlqJ,EAAI,GAAIuiB,EAAI8hJ,EAAI9hJ,EAAIo0D,EAAIp0D,IAAK,CAE5D,IAAI3F,EAA6BqtI,EAAO1nI,GAExC+hD,EAAOo9F,GAAM9kJ,EAETutI,IACFA,EAAQuX,GAAM1X,EAAQznI,IAIxBm/I,KAOJ,OAFAtX,EAAKpsJ,GAAK0jK,EAEH3nK,EAAE+sJ,mBAAmB,CAC1BxiJ,OAAQ6lJ,EACR5pJ,MAAO+jE,EACPwhF,IAAKsE,EACLv+I,KAAM,CAACjD,EAAG5K,GACVwS,SAAU64I,IDLQib,CAAUvqK,EAAG,EAAMwkC,EAAEg5D,GAAQx9F,EAE7CwkC,EAAE5wB,OEhDD,SAAiB5T,EAAGgqK,GAEzB,IAAKhqK,EACH,OAAO,KAIT,IAgBI7C,EAAGqtK,EAhBHta,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KACTyD,EAAQrvJ,EAAE+7I,MAEVltI,EAAIwgJ,EAAM,GACVprJ,EAAIorJ,EAAM,GAEVz7I,EAAS,GAGTu7C,EAAI,GAIJ+vB,EAAOj7E,EAMT,IAAK9G,EAAI,EAAGA,EAAI0R,EAAG1R,IACjBgyD,EAAE+vB,EAAO/hF,IAAM,EAKnB,IAAK,IAAIgI,EAAI,EAAGA,EAAIlB,EAAGkB,IAAK,CAE1ByO,EAAOzO,IAAM,EAEbgqD,EAlBa,EAkBAhqD,IAAM,EAEnB,IAAK,IAAI+0J,EAAK/J,EAAKhrJ,GAAI0rE,EAAKs/E,EAAKhrJ,EAAI,GAAI5C,EAAI23J,EAAI33J,EAAIsuE,EAAItuE,IAAK,CAE5D,IAAIsgB,EAAIqtI,EAAO3tJ,GAIf,IAFApF,EAAUgyD,EAAE+vB,EAAOr8D,IAEL,IAAP1lB,GAAYA,EAAIgI,EAAGhI,EAAIqtK,EAE5BA,EAAQr7G,EA5BC,EA4BYhyD,GAErBgyD,EA9BS,EA8BIhyD,GAAKgI,GAEH,IAAXqlK,IACF52J,EAAOzW,GAAKgI,GAKdgqD,EAAE+vB,EAAOr8D,GAAK1d,GAKpB,OAAOyO,EFdQ62J,CAAQt/J,GAEnB,IAAI87J,EGjDH,SAAgBrzJ,EAAQ3P,GAE7B,IAAK2P,EACH,OAAO,KAIT,IACI3N,EADAd,EAAI,EAGJ8hK,EAAO,GAGP93G,EAAI,GAGJjsD,EAAOe,EACPsuE,EAAQ,EAAItuE,EAEhB,IAAKgC,EAAI,EAAGA,EAAIhC,EAAGgC,IAEjBkpD,EANS,EAMAlpD,IAAM,EAIjB,IAAKA,EAAIhC,EAAI,EAAGgC,GAAK,EAAGA,KAEH,IAAf2N,EAAO3N,KAKXkpD,EAAEjsD,EAAO+C,GAAKkpD,EAjBL,EAiBcv7C,EAAO3N,IAC9BkpD,EAlBS,EAkBAv7C,EAAO3N,IAAMA,GAIxB,IAAKA,EAAI,EAAGA,EAAIhC,EAAGgC,KAEE,IAAf2N,EAAO3N,KAKXd,EAAI6hK,GAAO/gK,EAAGd,EAAGgqD,EA7BR,EA6BiBjsD,EAAM+jK,EAAM10F,IAGxC,OAAO00F,EHEQyD,CAAOlmI,EAAE5wB,OAAQ3P,GAI5B,GAFAugC,EAAEmmI,GAAKP,EAASj/J,EAAGq5B,EAAE5wB,OAAQqzJ,EAAM,GAE/B97J,GAAKq5B,EAAE5wB,QAAU4wB,EAAEmmI,IAmB3B,SAAiB3qK,EAAGwkC,GAElB,IAAI2rH,EAAOnwJ,EAAE4rJ,KACTsE,EAASlwJ,EAAE2rJ,OACX0D,EAAQrvJ,EAAE+7I,MAEVltI,EAAIwgJ,EAAM,GACVprJ,EAAIorJ,EAAM,GAEd7qH,EAAE6lI,KAAO,GAET7lI,EAAEomI,SAAW,GAGb,IAWIztK,EAAGgI,EAAG5C,EAAG23J,EAAIrpF,EAXbj9D,EAAS4wB,EAAE5wB,OACXy2J,EAAO7lI,EAAE6lI,KACTO,EAAWpmI,EAAEomI,SAEbz7G,EAAI,GAGJlrB,EAAOp1B,EACPg8J,EAAOh8J,EAAI5K,EACX6mK,EAAOj8J,EAAI,EAAI5K,EAInB,IAAKkB,EAAI,EAAGA,EAAIlB,EAAGkB,IAEjBgqD,EAAElrB,EAAO9+B,IAAM,EACfgqD,EAAE07G,EAAO1lK,IAAM,EACfgqD,EAAE27G,EAAO3lK,GAAK,EAIhB,IAAKhI,EAAI,EAAGA,EAAI0R,EAAG1R,IACjBytK,EAASztK,IAAM,EAIjB,IAAKgI,EAAIlB,EAAI,EAAGkB,GAAK,EAAGA,IAEtB,IAAK+0J,EAAK/J,EAAKhrJ,GAAI0rE,EAAKs/E,EAAKhrJ,EAAI,GAAI5C,EAAI23J,EAAI33J,EAAIsuE,EAAItuE,IAEnDqoK,EAAS1a,EAAO3tJ,IAAM4C,EAK1B,IAAKhI,EAAI0R,EAAI,EAAG1R,GAAK,EAAGA,IAEtBktK,EAAKltK,IAAM,GAGA,KAFXgI,EAAIylK,EAASztK,MAOS,GAAlBgyD,EAAE27G,EAAO3lK,OACXgqD,EAAE07G,EAAO1lK,GAAKhI,GAIhBgyD,EA5CS,EA4CAhyD,GAAKgyD,EAAElrB,EAAO9+B,GACvBgqD,EAAElrB,EAAO9+B,GAAKhI,GAMhB,IAHAqnC,EAAEumI,IAAM,EACRvmI,EAAExhB,GAAKnU,EAEF1J,EAAI,EAAGA,EAAIlB,EAAGkB,IAajB,GAXAhI,EAAIgyD,EAAElrB,EAAO9+B,GAEbq/B,EAAEumI,MAEE5tK,EAAI,IACNA,EAAIqnC,EAAExhB,MAIRqnJ,EAAKltK,GAAKgI,MAEJ2lK,EAAK3lK,IAAM,GAAjB,CAKAq/B,EAAEumI,KAAO57G,EAAE27G,EAAO3lK,GAElB,IAAI6lK,EAAKp3J,EAAOzO,IAEJ,IAAR6lK,IACmB,IAAjB77G,EAAE27G,EAAOE,KACX77G,EAAE07G,EAAOG,GAAM77G,EAAE07G,EAAO1lK,IAG1BgqD,EA9EO,EA8EEA,EAAE07G,EAAO1lK,IAAMgqD,EAAElrB,EAAO+mI,GACjC77G,EAAElrB,EAAO+mI,GAAM77G,EA/ER,EA+EiBhyD,GACxBgyD,EAAE27G,EAAOE,IAAO77G,EAAE27G,EAAO3lK,IAI7B,IAAKhI,EAAI,EAAGA,EAAI0R,EAAG1R,IACbktK,EAAKltK,GAAK,IACZktK,EAAKltK,GAAKgI,KAId,OAAO,EAjIwB8lK,CAAQ9/J,EAAGq5B,GAEtC,IAAKA,EAAE0mI,IAAM,EAAG/lK,EAAI,EAAGA,EAAIlB,EAAGkB,IAC5Bq/B,EAAE0mI,KAAO1mI,EAAEmmI,GAAGxlK,QAKlBq/B,EAAE0mI,IAAM,EAAI/a,EAAKlsJ,GAAKA,EACtBugC,EAAEumI,IAAMvmI,EAAE0mI,IAIZ,OAAO1mI,MIpEJ,SAAS2mI,GAASh8G,EAAGlpD,GAE1B,OAAOkpD,EAAElpD,GAAK,ECAT,SAASmlK,GAAOj8G,EAAGlpD,GAExBkpD,EAAElpD,GAAKihK,GAAO/3G,EAAElpD,ICHX,SAASolK,GAASluK,GAEvB,OAAOA,EAAI,EAAI+pK,GAAO/pK,GAAKA,ECStB,SAASmuK,GAAMrlK,EAAG6nD,EAAG94C,EAAKyrF,EAAI4pE,GAEnC,IAMIltK,EAAGoF,EAAGuuE,EANNtqE,EAAQsnD,EAAE69F,OACVI,EAAMj+F,EAAE89F,KAGR3nJ,EAFO6pD,EAAEiuF,MAEA,GAIT93G,EAAO,EAIX,IAFAw8D,EAAG,GAAKx6F,EAEDg+B,GAAQ,GAAG,CAEhBh+B,EAAIw6F,EAAGx8D,GAEP,IAAIsnI,EAAOlB,EAAOA,EAAKpkK,GAAKA,EAEvBklK,GAASpf,EAAK9lJ,KAEjBmlK,GAAOrf,EAAK9lJ,GAEZw6F,EAAGx8F,EAAIggC,GAAQsnI,EAAO,EAAI,EAAIF,GAAStf,EAAIwf,KAI7C,IAAIntK,EAAO,EAEX,IAAKmE,EAAIk+F,EAAGx8F,EAAIggC,GAAO6sC,EAAKy6F,EAAO,EAAI,EAAIF,GAAStf,EAAIwf,EAAO,IAAKhpK,EAAIuuE,EAAIvuE,IAI1E,IAAI4oK,GAASpf,EAFb5uJ,EAAIqJ,EAAMjE,IAEV,CAKAk+F,EAAGx8F,EAAIggC,GAAQ1hC,EAEfk+F,IAAKx8D,GAAQ9mC,EAEbiB,EAAO,EAEP,MAIEA,IAEF6lC,IAEAw8D,IAAKzrF,GAAO/O,GAIhB,OAAO+O,EC3ET,IACI,GAAe,CAAC,eAAgB,WAAY,YACrCw2J,IAAiC,QAFjC,YAE+C,IAAe/nE,IACvE,IAAI,aACF8wC,EAAY,SACZtxH,EAAQ,SACR+8E,GACEyD,EAqBJ,OAAO,SAAmB31C,EAAG3nD,EAAGhB,EAAGs7F,EAAIx7F,EAAGolK,EAAMoB,GAE9C,IAWIlpK,EAAG23J,EAAIrpF,EAAI2sB,EAXXkuE,EAAU59G,EAAE49F,QACZigB,EAAS79G,EAAE69F,OACXigB,EAAO99G,EAAE89F,KAGT3nJ,EAFQ6pD,EAAEiuF,MAEA,GAEVwT,EAAUppJ,EAAEulJ,QACZ8D,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KAIT52I,ECzBD,SAAiB84C,EAAG3nD,EAAGhB,EAAGs7F,EAAI4pE,GAEnC,IAQI9nK,EAAG23J,EAAIrpF,EARP+6F,EAAO99G,EAAE89F,KACTigB,EAAQ/9G,EAAEiuF,MAEVyT,EAASrpJ,EAAEwlJ,OACX8D,EAAOtpJ,EAAEylJ,KAET3nJ,EAAI4nK,EAAM,GAIV72J,EAAM/Q,EAEV,IAAKi2J,EAAKzK,EAAKtqJ,GAAI0rE,EAAK4+E,EAAKtqJ,EAAI,GAAI5C,EAAI23J,EAAI33J,EAAIsuE,EAAItuE,IAAK,CAExD,IAAIpF,EAAIqyJ,EAAOjtJ,GAEV4oK,GAASS,EAAMzuK,KAElB6X,EAAMs2J,GAAMnuK,EAAG2wD,EAAG94C,EAAKyrF,EAAI4pE,IAK/B,IAAK9nK,EAAIyS,EAAKzS,EAAI0B,EAAG1B,IAEnB6oK,GAAOQ,EAAMnrE,EAAGl+F,IAGlB,OAAOyS,EDLK82J,CAAQh+G,EAAG3nD,EAAGhB,EAAGs7F,EAAI4pE,GAE/B,IAAK9nK,EAAIyS,EAAKzS,EAAI0B,EAAG1B,IACnB0C,EAAEw7F,EAAGl+F,IAAM,EAIb,IAAK23J,EAAKzK,EAAKtqJ,GAAI0rE,EAAK4+E,EAAKtqJ,EAAI,GAAI5C,EAAI23J,EAAI33J,EAAIsuE,EAAItuE,IACnD0C,EAAEuqJ,EAAOjtJ,IAAMgtJ,EAAQhtJ,GAIzB,IAAK,IAAI+5F,EAAKtnF,EAAKsnF,EAAKr4F,EAAGq4F,IAAM,CAE/B,IAAIr2F,EAAIw6F,EAAGnE,GAEP07D,EAAIqS,EAAOA,EAAKpkK,GAAKA,EAEzB,KAAI+xJ,EAAI,GAaR,IARAkC,EAAK0R,EAAK5T,GACVnnF,EAAK+6F,EAAK5T,EAAI,GAEd/yJ,EAAEgB,GAAKsuI,EAAatvI,EAAEgB,GAAIylK,EAAQD,EAAKvR,EAAKrpF,EAAK,IAEjDtuE,EAAIkpK,EAAKvR,EAAK,EAAIA,EAClB18D,EAAIiuE,EAAK56F,EAAKA,EAAK,EAEZtuE,EAAIi7F,EAAGj7F,IAAK,CAEjB,IAAIpF,EAAIwuK,EAAOppK,GAEf0C,EAAE9H,GAAK6iG,EAAS/6F,EAAE9H,GAAI8lB,EAASyoJ,EAAQnpK,GAAI0C,EAAEgB,MAKjD,OAAO+O,MElFP,GAAe,CAAC,MAAO,eAAgB,WAAY,WAAY,SAAU,WAAY,gBAC9E+2J,IAA4B,QAF5B,OAE0C,IAAetoE,IAClE,IAAI,IACFh7F,EAAG,aACH8rI,EAAY,SACZtxH,EAAQ,SACR+8E,EAAQ,OACR6sB,EAAM,SACNE,EAAQ,aACR2nB,GACEjxC,EACAuoE,EAAYR,GAAgB,CAC9Bj3B,eACAtxH,WACA+8E,aAkBF,OAAO,SAAcnxF,EAAG21B,EAAGynI,GAEzB,IAAKp9J,EACH,OAAO,KAIT,IAII2uF,EAFAv5F,EAFO4K,EAAEktI,MAEA,GAGTgvB,EAAM,IACNG,EAAM,IAEN1mI,IACFg5D,EAAIh5D,EAAEg5D,EACNutE,EAAMvmI,EAAEumI,KAAOA,EACfG,EAAM1mI,EAAE0mI,KAAOA,GAIjB,IA+BI/tK,EAAGoF,EA/BHqjK,EAAU,GAEVC,EAAS,GAETC,EAAO,GAGPxB,EAAI,IAAI5vB,EAAa,CACvBnqI,OAAQq7J,EACRp/J,MAAOq/J,EACP9Z,IAAK+Z,EACLh0J,KAAM,CAAC7N,EAAGA,KAGR+hK,EAAU,GAEVC,EAAS,GAETC,EAAO,GAGPS,EAAI,IAAIjyB,EAAa,CACvBnqI,OAAQy7J,EACRx/J,MAAOy/J,EACPla,IAAKma,EACLp0J,KAAM,CAAC7N,EAAGA,KAGRomK,EAAO,GAKPplK,EAAI,GAEJw7F,EAAK,GAGT,IAAKtjG,EAAI,EAAGA,EAAI8G,EAAG9G,IAEjB8H,EAAE9H,GAAK,EAEPktK,EAAKltK,IAAM,EAEX2oK,EAAK3oK,EAAI,GAAK,EAIhB4tK,EAAM,EACNG,EAAM,EAEN,IAAK,IAAI/lK,EAAI,EAAGA,EAAIlB,EAAGkB,IAAK,CAE1B2gK,EAAK3gK,GAAK4lK,EACV7E,EAAK/gK,GAAK+lK,EAEV,IAAInrC,EAAMviC,EAAIA,EAAEr4F,GAAKA,EAEjB6P,EAAMg3J,EAAU1H,EAAGz1J,EAAGkxH,EAAKt/B,EAAIx7F,EAAGolK,EAAM,GAExC6B,GAAQ,EACRlsK,GAAK,EAET,IAAKuC,EAAIyS,EAAKzS,EAAI0B,EAAG1B,IAInB,GAAI8nK,EAFJltK,EAAIsjG,EAAGl+F,IAEO,EAAG,CAEf,IAAI4pK,EAAO1jK,EAAIxD,EAAE9H,IAEb0vH,EAAOs/C,EAAMnsK,KAEfA,EAAImsK,EACJD,EAAO/uK,QAIT8oK,EAAOiF,GAAOb,EAAKltK,GACnB6oK,EAAQkF,KAASjmK,EAAE9H,GAKvB,IAAc,IAAV+uK,GAAelsK,GAAK,EACtB,OAAO,KAILqqK,EAAKtqC,GAAO,GAAKhT,EAAStkH,EAAIxD,EAAE86H,IAAO98G,EAASjjB,EAAGisK,MACrDC,EAAOnsC,GAIT,IAAI88B,EAAQ53J,EAAEinK,GAUd,IARAjG,EAAOiF,GAAO/lK,EACd6gK,EAAQkF,KAASrO,EAEjBwN,EAAK6B,GAAQ/mK,EAEb0gK,EAAOkF,GAAOmB,EACdtG,EAAQmF,KAAS,EAEZxoK,EAAIyS,EAAKzS,EAAI0B,EAAG1B,IAIf8nK,EAFJltK,EAAIsjG,EAAGl+F,IAEO,IAEZsjK,EAAOkF,GAAO5tK,EAEdyoK,EAAQmF,KAASx2B,EAAatvI,EAAE9H,GAAI0/J,IAItC53J,EAAE9H,GAAK,EAQX,IAHA2oK,EAAK7hK,GAAK8mK,EACV7E,EAAKjiK,GAAKinK,EAEL3oK,EAAI,EAAGA,EAAIwoK,EAAKxoK,IACnBsjK,EAAOtjK,GAAK8nK,EAAKxE,EAAOtjK,IAS1B,OALAqjK,EAAQ7lD,OAAOgrD,EAAKnF,EAAQ1oK,OAAS6tK,GACrClF,EAAO9lD,OAAOgrD,EAAKlF,EAAO3oK,OAAS6tK,GACnC/E,EAAQjmD,OAAOmrD,EAAKlF,EAAQ9oK,OAASguK,GACrCjF,EAAOlmD,OAAOmrD,EAAKjF,EAAO/oK,OAASguK,GAE5B,CACL5G,EAAGA,EACHqC,EAAGA,EACH0D,KAAMA,OC7LR,GAAe,CAAC,QAAS,MAAO,MAAO,WAAY,YAAa,eAAgB,WAAY,SAAU,WAAY,gBAC3G+B,IAA2B,QAF3B,MAEyC,IAAe3oE,IACjE,IAAI,MACFyzB,EAAK,IACLzuH,EAAG,IACHuC,EAAG,SACHiY,EAAQ,UACR4oG,EAAS,aACT0oB,EAAY,SACZv0C,EAAQ,OACR6sB,EAAM,SACNE,EAAQ,aACR2nB,GACEjxC,EACA4oE,EAAQnC,GAAY,CACtBl/J,MACAiY,WACA4oG,cAEEygD,EAAOP,GAAW,CACpBtjK,MACA8rI,eACAtxH,WACA+8E,WACA6sB,SACAE,WACA2nB,iBAwCF,OAAOxd,EAnEE,MAmEU,CACjB,+BAAgC,SAAkCl3H,EAAG+iF,EAAOwpF,GAE1E,KAAK,OAAUxpF,IAAUA,EAAQ,GAAKA,EAAQ,EAC5C,MAAM,IAAIn4E,MAAM,yFAIlB,GAAI2hK,EAAY,GAAKA,EAAY,EAC/B,MAAM,IAAI3hK,MAAM,2DAIlB,IAAI45B,EAAI6nI,EAAMtpF,EAAO/iF,GAAG,GAEpBgiB,EAAIsqJ,EAAKtsK,EAAGwkC,EAAG+nI,GAEnB,MAAO,CACLjI,EAAGtiJ,EAAEsiJ,EACLqC,EAAG3kJ,EAAE2kJ,EACLpkK,EAAGyf,EAAEqoJ,KACL7sE,EAAGh5D,EAAEg5D,EACLt5F,SAAU,WACR,MAAO,MAAQzF,KAAK6lK,EAAEpgK,WAAa,QAAUzF,KAAKkoK,EAAEziK,WAAa,QAAUzF,KAAK8D,EAAE2B,YAAczF,KAAK++F,EAAI,QAAU/+F,KAAK++F,EAAEt5F,WAAa,IAAM,aCzFnJ,GAAe,CAAC,QAAS,SAAU,WAAY,WAAY,aAAc,OAClEsoK,IAA2B,QAF3B,MAEyC,IAAe/oE,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,SACN4sC,EAAQ,SACR/8E,EAAQ,WACRipG,EAAU,IACVgZ,GACEzhC,EA2BJ,OAAOyzB,EArCE,MAqCU,CACjBW,IAAK,SAAa5yH,GAChB,OAAO,SAAMA,IAEf,iBAAkB,SAAaA,GAC7B,IAAI6M,EAYJ,QATEA,GADE,EAAAy0G,EAAA,IAASthH,GACJA,EAAE6M,OACAzU,MAAMoF,QAAQwC,IACvBA,EAAImuD,EAAOnuD,IACF6M,OAGF,IAGI5U,QACX,KAAK,EAEH,OAAO,SAAM+H,GAEf,KAAK,EAEH,GAAgB,IAAZ6M,EAAK,GACP,OAAO,SAAM7M,EAAEvF,UAAU,IAEzB,MAAM,IAAIkwJ,WAAW,iCAAuC,SAAO99I,GAAQ,KAG/E,KAAK,EAGD,IAAImM,EAAOnM,EAAK,GAGhB,GAAImM,IAFOnM,EAAK,GAGd,OAqBZ,SAAcshD,EAAQn1C,EAAMg+B,GAC1B,GAAa,IAATh+B,EAEF,OAAO,SAAMm1C,EAAO,GAAG,IAClB,GAAa,IAATn1C,EAGT,OAAO+hF,EAAS/8E,EAASmwC,EAAO,GAAG,GAAIA,EAAO,GAAG,IAAKnwC,EAASmwC,EAAO,GAAG,GAAIA,EAAO,GAAG,KAOvF,IAJA,IAAIq5G,EAASvnC,EAAI9xE,GAEb+6D,EAAMs+C,EAAO9F,EAAE,GAAG,GAEb1jK,EAAK,EAAGA,EAAKgb,EAAMhb,IAC1BkrH,EAAMlrG,EAASkrG,EAAKs+C,EAAO9F,EAAE1jK,GAAIA,IASnC,IAJA,IAAIypK,EAAa,EACbvvK,EAAI,EACJkhF,EAAU,KAED,CACX,KAAOA,EAAQlhF,IACbA,IAGF,GAAIA,GAAK8gB,EAAM,MAIf,IAHA,IAAIhY,EAAI9I,EACJmoG,EAAW,GAEPjnB,EAAQouF,EAAOlqK,EAAE0D,KACvBo4E,EAAQouF,EAAOlqK,EAAE0D,KAAM,EACvBA,EAAIwmK,EAAOlqK,EAAE0D,GACbq/F,IAGEA,EAAW,GAAM,GACnBonE,IAIJ,OAAOA,EAAa,GAAM,EAAIv+C,EAAMjC,EAAWiC,GAjEhCw+C,CAAK1nK,EAAEy9F,QAAQhjG,UAAWue,GAEjC,MAAM,IAAI2xI,WAAW,iCAAuC,SAAO99I,GAAQ,KAIjF,QAEE,MAAM,IAAI89I,WAAW,0CAAgD,SAAO99I,GAAQ,YCpF1F,GAAO,WACP,GAAe,CAAC,QAAS,YAAa,WAAY,eAAgB,iBAAkB,aAAc,OAAQ,OACnG86J,IAAgC,QAAQ,GAAM,IAAenpE,IACtE,IAAI,MACFyzB,EAAK,UACLod,EAAS,SACTt0C,EAAQ,eACRo0C,EAAc,aACdG,EAAY,WACZroB,EAAU,KACVxnH,EAAI,IACJ+D,GACEg7F,EAuDJ,OAAOyzB,EAAM,GAAM,CACjB,sBAAuB,SAAyBjyH,EAAGe,EAAGynB,GAEpD,GAAiB,IAAbxoB,EAAE/H,QAA6B,IAAb8I,EAAE9I,QAA6B,IAAbuwB,EAAEvwB,OAAc,CACtD,IAAK2vK,EAAI5nK,GACP,MAAM,IAAI/F,UAAU,kEAGtB,IAAK2tK,EAAI7mK,GACP,MAAM,IAAI9G,UAAU,mEAGtB,IAAK2tK,EAAIp/I,GACP,MAAM,IAAIvuB,UAAU,kEAGtB,IAAI2P,EAAI0lI,EAAav0C,EAASvyE,EAAE,GAAIA,EAAE,IAAKuyE,EAASh6F,EAAE,GAAIA,EAAE,KACxD8mK,EAAS14B,EAAeA,EAAevlI,EAAGA,GAAI7I,EAAE,IAChD+mK,EAAS7gD,EAAWkoB,EAAevlI,EAAG7I,EAAE,KACxCm8E,EAAWl9E,EAAE,GACjB,OAAO+nK,EAAqB/nK,EAAE,GAAIA,EAAE,GAAI6nK,EAAQC,EAAQ5qF,GAExD,MAAM,IAAIjjF,UAAU,iCAGxB,yBAA0B,SAA4B+F,EAAGe,EAAGynB,GAC1D,GAA8B,IAA1B7sB,OAAOsE,KAAKD,GAAG/H,QAA0C,IAA1B0D,OAAOsE,KAAKc,GAAG9I,QAA0C,IAA1B0D,OAAOsE,KAAKuoB,GAAGvwB,OAAc,CAC7F,IAAK2vK,EAAI5nK,GACP,MAAM,IAAI/F,UAAU,+DAGtB,IAAK2tK,EAAI7mK,GACP,MAAM,IAAI9G,UAAU,uEAGtB,IAAK2tK,EAAIp/I,GACP,MAAM,IAAIvuB,UAAU,uEAGtB,GAAI,WAAY+F,GAAK,WAAYA,GAAK,eAAgBe,GAAK,eAAgBA,GAAK,eAAgBynB,GAAK,eAAgBA,EAAG,CACtH,IAAI5e,EAAI0lI,EAAav0C,EAASvyE,EAAEw/I,WAAYx/I,EAAEy/I,YAAaltE,EAASh6F,EAAEmnK,WAAYnnK,EAAEonK,aAChFN,EAAS14B,EAAeA,EAAevlI,EAAGA,GAAI7I,EAAEonK,YAChDL,EAAS7gD,EAAWkoB,EAAevlI,EAAG7I,EAAEonK,aACxCjrF,EAAWl9E,EAAEooK,OACjB,OAAOL,EAAqB/nK,EAAEooK,OAAQpoK,EAAEqoK,OAAQR,EAAQC,EAAQ5qF,GAEhE,MAAM,IAAIjjF,UAAU,0BAGtB,MAAM,IAAIA,UAAU,iCAGxB,eAAgB,SAAoB+F,EAAGe,GAErC,GAAiB,IAAbf,EAAE/H,QAA6B,IAAb8I,EAAE9I,OAAc,CACpC,IAAK2vK,EAAI5nK,GACP,MAAM,IAAI/F,UAAU,kEAGtB,IAAKquK,EAAIvnK,GACP,MAAM,IAAI9G,UAAU,mEAGtB,OAAO8tK,EAAqB/nK,EAAE,GAAIA,EAAE,GAAIe,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACjD,GAAiB,IAAbf,EAAE/H,QAA6B,IAAb8I,EAAE9I,OAAc,CAE3C,IAAKqwK,EAAItoK,GACP,MAAM,IAAI/F,UAAU,kEAGtB,IAAKsuK,EAAgBxnK,GACnB,MAAM,IAAI9G,UAAU,mEAGtB,OAAOuuK,EAAqBxoK,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIe,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACzE,GAAIf,EAAE/H,SAAW8I,EAAE9I,QAAU+H,EAAE/H,OAAS,EAAG,CAEhD,IAAKwwK,EAAqBzoK,GACxB,MAAM,IAAI/F,UAAU,0DAGtB,IAAKwuK,EAAqB1nK,GACxB,MAAM,IAAI9G,UAAU,0DAGtB,OAAOyuK,EAAmB1oK,EAAGe,GAE7B,MAAM,IAAI9G,UAAU,iCAGxB,iBAAkB,SAAsB+F,EAAGe,GACzC,GAA8B,IAA1BpF,OAAOsE,KAAKD,GAAG/H,QAA0C,IAA1B0D,OAAOsE,KAAKc,GAAG9I,OAAc,CAC9D,IAAK2vK,EAAI5nK,GACP,MAAM,IAAI/F,UAAU,+DAGtB,IAAKquK,EAAIvnK,GACP,MAAM,IAAI9G,UAAU,iFAGtB,GAAI,WAAY+F,GAAK,WAAYA,GAAK,eAAgBe,GAAK,eAAgBA,GAAK,aAAcA,EAC5F,OAAOgnK,EAAqB/nK,EAAEooK,OAAQpoK,EAAEqoK,OAAQtnK,EAAE4nK,WAAY5nK,EAAE6nK,WAAY7nK,EAAEm8E,UAE9E,MAAM,IAAIjjF,UAAU,0BAEjB,GAA8B,IAA1B0B,OAAOsE,KAAKD,GAAG/H,QAA0C,IAA1B0D,OAAOsE,KAAKc,GAAG9I,OAAc,CAErE,IAAKqwK,EAAItoK,GACP,MAAM,IAAI/F,UAAU,uEAGtB,IAAKsuK,EAAgBxnK,GACnB,MAAM,IAAI9G,UAAU,oEAGtB,GAAI,WAAY+F,GAAK,WAAYA,GAAK,OAAQe,GAAK,OAAQA,GAAK,OAAQA,GAAK,MAAOA,GAAK,MAAOA,GAAK,MAAOA,EAC1G,OAAOynK,EAAqBxoK,EAAEooK,OAAQpoK,EAAEqoK,OAAQroK,EAAE6oK,OAAQ9nK,EAAEymJ,GAAIzmJ,EAAE0mJ,GAAI1mJ,EAAE+nK,GAAI/nK,EAAEhG,EAAGgG,EAAEG,EAAGH,EAAEmF,GAExF,MAAM,IAAIjM,UAAU,0BAEjB,GAA8B,IAA1B0B,OAAOsE,KAAKD,GAAG/H,QAA0C,IAA1B0D,OAAOsE,KAAKc,GAAG9I,OAAc,CAErE,IAAK2vK,EAAI5nK,GACP,MAAM,IAAI/F,UAAU,qEAGtB,IAAK2tK,EAAI7mK,GACP,MAAM,IAAI9G,UAAU,qEAGtB,GAAI,cAAe+F,GAAK,cAAeA,GAAK,cAAee,GAAK,cAAeA,EAC7E,OAAO2nK,EAAmB,CAAC1oK,EAAE+oK,UAAW/oK,EAAEgpK,WAAY,CAACjoK,EAAEkoK,UAAWloK,EAAEmoK,YAEtE,MAAM,IAAIjvK,UAAU,0BAEjB,GAA8B,IAA1B0B,OAAOsE,KAAKD,GAAG/H,QAA0C,IAA1B0D,OAAOsE,KAAKc,GAAG9I,OAAc,CAErE,IAAKqwK,EAAItoK,GACP,MAAM,IAAI/F,UAAU,gFAGtB,IAAKquK,EAAIvnK,GACP,MAAM,IAAI9G,UAAU,gFAGtB,GAAI,cAAe+F,GAAK,cAAeA,GAAK,cAAeA,GAAK,cAAee,GAAK,cAAeA,GAAK,cAAeA,EACrH,OAAO2nK,EAAmB,CAAC1oK,EAAE+oK,UAAW/oK,EAAEgpK,UAAWhpK,EAAEmpK,WAAY,CAACpoK,EAAEkoK,UAAWloK,EAAEmoK,UAAWnoK,EAAEqoK,YAEhG,MAAM,IAAInvK,UAAU,0BAGtB,MAAM,IAAIA,UAAU,iCAGxB7B,MAAO,SAAeL,GACpB,IA2DJ,SAAmBgD,GAEjB,GAAoB,IAAhBA,EAAE,GAAG9C,QAAgBoxK,EAAUtuK,EAAE,GAAG,KAAOsuK,EAAUtuK,EAAE,GAAG,KAC5D,GAAIA,EAAEgb,MAAKuzJ,GAAoB,IAAdA,EAAGrxK,SAAiBoxK,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MACrE,OAAO,MAEJ,MAAoB,IAAhBvuK,EAAE,GAAG9C,QAAgBoxK,EAAUtuK,EAAE,GAAG,KAAOsuK,EAAUtuK,EAAE,GAAG,KAAOsuK,EAAUtuK,EAAE,GAAG,KAKzF,OAAO,EAJP,GAAIA,EAAEgb,MAAKuzJ,GAAoB,IAAdA,EAAGrxK,SAAiBoxK,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MAC1F,OAAO,EAMX,OAAO,EAzEAC,CAAUxxK,GACb,MAAM,IAAIkC,UAAU,oEAGtB,OAkGJ,SAA2Bc,GAKzB,IAJA,IAAIiqB,EAAS,GACTwkJ,EAAS,GACTC,EAAS,GAEJvxK,EAAI,EAAGA,EAAI6C,EAAE9C,OAAS,EAAGC,IAChC,IAAK,IAAI8I,EAAI9I,EAAI,EAAG8I,EAAIjG,EAAE9C,OAAQ+I,IACZ,IAAhBjG,EAAE,GAAG9C,QACPuxK,EAAS,CAACzuK,EAAE7C,GAAG,GAAI6C,EAAE7C,GAAG,IACxBuxK,EAAS,CAAC1uK,EAAEiG,GAAG,GAAIjG,EAAEiG,GAAG,KACC,IAAhBjG,EAAE,GAAG9C,SACduxK,EAAS,CAACzuK,EAAE7C,GAAG,GAAI6C,EAAE7C,GAAG,GAAI6C,EAAE7C,GAAG,IACjCuxK,EAAS,CAAC1uK,EAAEiG,GAAG,GAAIjG,EAAEiG,GAAG,GAAIjG,EAAEiG,GAAG,KAGnCgkB,EAAOhqB,KAAK0tK,EAAmBc,EAAQC,IAI3C,OAAOzkJ,EArHE0kJ,CAAkB3xK,MAI7B,SAASsxK,EAAUtuK,GAEjB,MAAoB,iBAANA,IAAkB,EAAAumH,EAAA,IAAYvmH,GAG9C,SAAS6sK,EAAI7sK,GAMX,OAJIA,EAAEoC,cAAgB/E,QACpB2C,EAAI4uK,EAAe5uK,IAGdsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,IAGxC,SAASutK,EAAIvtK,GAMX,OAJIA,EAAEoC,cAAgB/E,QACpB2C,EAAI4uK,EAAe5uK,IAGdsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,IAG3D,SAAS0tK,EAAqB1tK,GAM5B,OAJK3C,MAAMoF,QAAQzC,KACjBA,EAAI4uK,EAAe5uK,IAGdA,EAAE8J,MAAMwkK,GAGjB,SAASd,EAAgBxtK,GAKvB,OAJIA,EAAEoC,cAAgB/E,QACpB2C,EAAI4uK,EAAe5uK,IAGdsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,KAAOsuK,EAAUtuK,EAAE,IAGpH,SAAS4uK,EAAe9sK,GAItB,IAHA,IAAIoD,EAAOtE,OAAOsE,KAAKpD,GACnB9B,EAAI,GAEC7C,EAAI,EAAGA,EAAI+H,EAAKhI,OAAQC,IAC/B6C,EAAEC,KAAK6B,EAAEoD,EAAK/H,KAGhB,OAAO6C,EAoBT,SAASgtK,EAAqB/nK,EAAGe,EAAGhG,EAAGmG,EAAGgF,GACxC,IAAIgE,EAAM1G,EAAI6rI,EAAUA,EAAUF,EAAep0I,EAAGiF,GAAImvI,EAAejuI,EAAGH,IAAKmF,IAC3Eq0J,EAAM96J,EAAK4vI,EAAUF,EAAep0I,EAAGA,GAAIo0I,EAAejuI,EAAGA,KACjE,OAAOouI,EAAaplI,EAAKqwJ,GAG3B,SAASiO,EAAqBxoK,EAAGe,EAAGynB,EAAGg/H,EAAIC,EAAIqhB,EAAI/tK,EAAGmG,EAAGgF,GACvD,IAAIgE,EAAM,CAAC6wF,EAASo0C,EAAep0C,EAAS0sD,EAAI1mJ,GAAImF,GAAIipI,EAAep0C,EAAS+tE,EAAItgJ,GAAItnB,IAAK65F,EAASo0C,EAAep0C,EAAS+tE,EAAItgJ,GAAIztB,GAAIo0I,EAAep0C,EAASysD,EAAIxnJ,GAAIkG,IAAK60F,EAASo0C,EAAep0C,EAASysD,EAAIxnJ,GAAIkB,GAAIiuI,EAAep0C,EAAS0sD,EAAI1mJ,GAAIhG,KAC5PmP,EAAMzK,EAAK4vI,EAAUA,EAAUF,EAAejlI,EAAI,GAAIA,EAAI,IAAKilI,EAAejlI,EAAI,GAAIA,EAAI,KAAMilI,EAAejlI,EAAI,GAAIA,EAAI,MAC3H,IAAIqwJ,EAAM96J,EAAK4vI,EAAUA,EAAUF,EAAep0I,EAAGA,GAAIo0I,EAAejuI,EAAGA,IAAKiuI,EAAejpI,EAAGA,KAClG,OAAOopI,EAAaplI,EAAKqwJ,GAG3B,SAASmO,EAAmB1oK,EAAGe,GAK7B,IAJA,IAAI6oK,EAAa5pK,EAAE/H,OACf+sB,EAAS,EACTvG,EAAO,EAEFvmB,EAAI,EAAGA,EAAI0xK,EAAY1xK,IAC9BumB,EAAOs8E,EAAS/6F,EAAE9H,GAAI6I,EAAE7I,IACxB8sB,EAASqqH,EAAUF,EAAe1wH,EAAMA,GAAOuG,GAGjD,OAAOvlB,EAAKulB,OClUZ,GAAO,aACP,GAAe,CAAC,QAAS,YAAa,WAAY,iBAAkB,eAAgB,MAAO,YAAa,eAAgB,aAAc,YAAa,UAC5I6kJ,IAAkC,QAAQ,GAAM,IAAerrE,IACxE,IAAI,MACFyzB,EAAK,UACLod,EAAS,SACTt0C,EAAQ,eACRo0C,EAAc,aACdG,EAAY,IACZnuI,EAAG,UACH2lH,EAAS,aACTwC,EAAY,WACZ/xB,EAAU,UACVzkC,EAAS,OACT80D,GACEppB,EA0BJ,OAAOyzB,EAAM,GAAM,CACjB,yCAA0C,SAAwCjzH,EAAGkB,GACnF,IAAK4yD,EAAU9zD,IAAMu4F,EAAWv4F,KAAO8zD,EAAU5yD,IAAMq3F,EAAWr3F,GAChE,MAAM,IAAIjG,UAAU,8DACf,GAAI2tH,EAAO1nH,EAAGlB,GACnB,MAAM,IAAI/E,UAAU,4DAOtB,IAHA,IAAI6vK,EAAahjD,EAAU5mH,GACvB8kB,EAAS,EAEJ9sB,EAAI,EAAGA,GAAKgI,EAAGhI,IAAK,CAC3B,IAAI6xK,EAAc5oK,GAAK,EAAG45F,EAAS76F,EAAGhI,IAClC8xK,EAAW1gD,EAAappH,EAAGhI,GAC3B+xK,EAAS9oK,EAAIjJ,EAAG8G,GACpBgmB,EAASqqH,EAAUrqH,EAAQmqH,EAAeA,EAAe66B,EAAUC,GAASF,IAG9E,OAAOz6B,EAAatqH,EAAQ8kJ,SC5D9B,GAAO,UACP,GAAe,CAAC,QAAS,YAAa,eAAgB,iBAAkB,eAAgB,aAAc,aAC/FI,IAA+B,QAAQ,GAAM,IAAe1rE,IACrE,IAAI,MACFyzB,EAAK,UACLod,EAAS,aACTC,EAAY,eACZH,EAAc,aACd7lB,EAAY,WACZ/xB,EAAU,UACVzkC,GACE0rC,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,qBAAsB,SAAyBjzH,GAC7C,IAAK8zD,EAAU9zD,IAAMu4F,EAAWv4F,GAC9B,MAAM,IAAI/E,UAAU,2DAGtB,OAAOq1I,EAAahmB,EAAa6lB,EAAenwI,EAAG,GAAIA,GAAIqwI,EAAUrwI,EAAG,UCxC1E,GAAO,QACP,GAAe,CAAC,QAAS,OAAQ,QAC1BmrK,IAA6B,QAAQ,GAAM,IAAe3rE,IACnE,IAAI,MACFyzB,EAAK,KACLplH,EAAI,KACJquF,GACEsD,EAuBJ,OAAOyzB,EAAM,GAAM,CACjBve,OAAQ,SAAgB1zG,GACtB,OAAOA,EAAE/H,QAEX,iBAAkB,SAAqB+H,GACrC,OAAOk7F,EAAKruF,EAAK7M,UChCnB,GAAe,CAAC,SAAU,QAAS,eAAgB,WAC5CoqK,IAA2B,QAF3B,MAEyC,IAAe5rE,IACjE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,aACNktH,EAAY,QACZp4D,GACEsnB,EAoCJ,OAAOyzB,EA5CE,MA4CU,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,GAAK,GAAKoiB,EAAOi+F,YACZs7B,GAAU37I,GAGV,IAAIk3E,EAAQl3E,EAAG,GAAGyE,OAG7ByyE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEyE,OAEX4gI,UAAW,SAAmBrlI,GAC5B,OAAKA,EAAEu3F,cAAgBn1E,EAAOi+F,YACrBrgH,EAAE82F,KAGF,IAAI5f,EAAQl3E,EAAEg6F,WAAY,GAAGv1F,OAGxC,iBAAkB,SAAqBzE,GACrC,OAAO,SAAQA,EAAGxG,OAEpB,WAAY,SAAgBwG,EAAG1D,GAE7B,OAAOgzI,EAAa91I,KAAKwG,GAAIxG,KAAK8C,UChEpC,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,cAAe,eAAgB,eAC3D+tK,IAAiC,QAAQ,GAAM,IAAe7rE,IACvE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,YACN+gF,EAAW,aACXI,EAAY,YACZE,GACEhxC,EACAyuD,EAAcV,GAAkB,CAClCt6B,QACAid,gBAEEge,EAAcT,GAAkB,CAClCx6B,UAEEk8B,EAAcL,GAAkB,CAClC77B,QACAud,gBAEE4d,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEme,EAAcN,GAAkB,CAClC96B,QACAud,gBAEE6c,EAAcZ,GAAkB,CAClCx5B,UAEEq6B,EAAcN,GAAkB,CAClC/5B,UA6BF,OAAOA,EAAM,GAAM,CACjB,WAAYqd,EACZ,6BAA8B,SAAkCtvI,EAAGe,GACjE,OAAOotJ,EAAYnuJ,EAAGe,EAAGuuI,GAAc,IAEzC,4BAA6B,SAAiCtvI,EAAGe,GAC/D,OAAOksJ,EAAYlsJ,EAAGf,EAAGsvI,GAAc,IAEzC,4BAA6B,SAAiCtvI,EAAGe,GAC/D,OAAOmsJ,EAAYltJ,EAAGe,EAAGuuI,GAAc,IAEzC,2BAA4B,SAAgCtvI,EAAGe,GAC7D,OAAOsrJ,EAAYrsJ,EAAGe,EAAGuuI,IAE3B,eAAgB,SAAoBtvI,EAAGe,GAErC,OAAOvH,KAAK20D,EAAOnuD,GAAImuD,EAAOptD,IAAItG,WAEpC,gBAAiB,SAAqBuF,EAAGe,GAEvC,OAAOvH,KAAK20D,EAAOnuD,GAAIe,IAEzB,gBAAiB,SAAqBf,EAAGe,GAEvC,OAAOvH,KAAKwG,EAAGmuD,EAAOptD,KAExB,oBAAqB,SAAyBf,EAAGe,GAC/C,OAAOqsJ,EAAYptJ,EAAGe,EAAGuuI,GAAc,IAEzC,mBAAoB,SAAwBtvI,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGuuI,GAAc,IAEzC,oBAAqB,SAAyBtvI,EAAGe,GAC/C,OAAOssJ,EAAYtsJ,EAAGf,EAAGsvI,GAAc,IAEzC,mBAAoB,SAAwBtvI,EAAGe,GAC7C,OAAOurJ,EAAYvrJ,EAAGf,EAAGsvI,GAAc,IAEzC,aAAc,SAAkBtvI,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGuuI,GAAc,GAAO70I,WAExD,aAAc,SAAkBuF,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOptD,GAAIf,EAAGsvI,GAAc,GAAM70I,gBChHvD,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzF6vK,IAAiC,QAAQ,GAAM,IAAe9rE,IACvE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,aACNmhF,EAAY,eACZH,EAAc,SACdp0C,EAAQ,YACRm0C,EAAW,YACXM,GACEhxC,EACAmgE,EAAkBL,GAAsB,CAC1C9uB,gBA2BF,OAAOvd,EAAM,GAAM,CACjB,+BAAgC,SAAiCroH,EAAG1I,GAClE,OAoEJ,SAAqC0I,EAAGw1J,GAStC,IAPA,IAAIz/D,EAAI,CAACg/D,EAAgB/0J,EAAGw1J,GAAI,GAAMn/I,MAAMnf,KAAInG,GAAKA,EAAE,MACnDqe,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAClBxxI,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KAEHzuJ,EAAIurC,EAAU,EAAGvrC,GAAK,EAAGA,IAGhC,IAFA,IAAImnK,EAAI1/D,EAAE1nG,OAEDiI,EAAI,EAAGA,EAAIm/J,EAAGn/J,IAAK,CAW1B,IAVA,IAAIgB,EAAIy+F,EAAEz/F,GAENo/J,EAAU,GACVC,EAAW,GAEXx6E,EAAa+hE,EAAI5uJ,GAGjBsnK,EAAM,EAEDx+J,EAJO8lJ,EAAI5uJ,EAAI,GAIC,EAAG8I,GAAK+jF,EAAY/jF,IAAK,CAChD,IAAI+xJ,EAAIxxJ,EAAMP,GAEV+xJ,IAAM76J,EACRsnK,EAAMl6J,EAAOtE,GACJ+xJ,EAAI76J,IAEbonK,EAAQtkK,KAAKsK,EAAOtE,IACpBu+J,EAASvkK,KAAK+3J,IAIlB,GAAK7jB,EAAYswB,EAAK,GAQf,GAAKtwB,EAAYhuI,EAAEhJ,GAAI,IAWvB,GAAU,IAANgI,EAAS,CAElB,IAAIu/J,EAAO,IAAIv+J,GACfu+J,EAAKvnK,GAAK,EAEV,IAAK,IAAIwnK,EAAM,EAAGC,EAAcJ,EAAStnK,OAAQynK,EAAMC,EAAaD,IAAO,CACzE,IAAIE,EAAML,EAASG,GACnBD,EAAKG,GAAO7kE,EAAS0kE,EAAKG,GAAMN,EAAQI,IAG1C//D,EAAE3kG,KAAKykK,QArByB,CAEhC,GAAU,IAANv/J,EAEF,MAAO,GAGPy/F,EAAEmb,OAAO56G,EAAG,GACZA,GAAK,EACLm/J,GAAK,MAjBiB,CAExBn+J,EAAEhJ,GAAKo3I,EAAapuI,EAAEhJ,GAAIsnK,GAE1B,IAAK,IAAIK,EAAM,EAAGC,EAAaP,EAAStnK,OAAQ4nK,EAAMC,EAAYD,IAAO,CACvE,IAAIE,EAAKR,EAASM,GAClB3+J,EAAE6+J,GAAMhlE,EAAS75F,EAAE6+J,GAAK5wB,EAAejuI,EAAEhJ,GAAIonK,EAAQO,OA4B7D,OAAOlgE,EAAE7+F,KAAId,GAAK,IAAIwvI,EAAY,CAChCn+H,KAAMrR,EAAEc,KAAInG,GAAK,CAACA,KAClBkS,KAAM,CAACmM,EAAM,OA3INuxJ,CAA4B3gK,EAAG1I,IAExC,8BAA+B,SAAgC0I,EAAG1I,GAChE,OAAOspK,EAA2B5gK,EAAG1I,IAEvC,wBAAyB,SAA0BnG,EAAGmG,GAKpD,OAFQspK,EAFAr8G,EAAOpzD,GAEuBmG,GAE7BJ,KAAI8c,GAAKA,EAAEnjB,eAIxB,SAAS+vK,EAA2B5gK,EAAGw1J,GASrC,IALA,IAAIz/D,EAAI,CAACg/D,EAAgB/0J,EAAGw1J,GAAI,GAAMn/I,MAAMnf,KAAInG,GAAKA,EAAE,MACnD8kG,EAAI71F,EAAEqW,MACNjH,EAAOpP,EAAEktI,MAAM,GAGV5+I,EAFK0R,EAAEktI,MAAM,GAEC,EAAG5+I,GAAK,EAAGA,IAGhC,IAFA,IAAImnK,EAAI1/D,EAAE1nG,OAEDiI,EAAI,EAAGA,EAAIm/J,EAAGn/J,IAAK,CAC1B,IAAIgB,EAAIy+F,EAAEz/F,GAEV,GAAKgvI,EAAYzvC,EAAEvnG,GAAGA,GAAI,GAQnB,GAAKg3I,EAAYhuI,EAAEhJ,GAAI,IAWvB,GAAU,IAANgI,EAAS,CAElB,IAAIu/J,EAAO,IAAIv+J,GACfu+J,EAAKvnK,GAAK,EAEV,IAAK,IAAIomJ,EAAKpmJ,EAAI,EAAGomJ,GAAM,EAAGA,IAC5BmhB,EAAKnhB,GAAMvjD,EAAS0kE,EAAKnhB,GAAK7+C,EAAE6+C,GAAIpmJ,IAGtCynG,EAAE3kG,KAAKykK,QApByB,CAEhC,GAAU,IAANv/J,EAEF,MAAO,GAGPy/F,EAAEmb,OAAO56G,EAAG,GACZA,GAAK,EACLm/J,GAAK,MAjBqB,CAE5Bn+J,EAAEhJ,GAAKo3I,EAAapuI,EAAEhJ,GAAIunG,EAAEvnG,GAAGA,IAE/B,IAAK,IAAI8I,EAAI9I,EAAI,EAAG8I,GAAK,EAAGA,IAE1BE,EAAEF,GAAK+5F,EAAS75F,EAAEF,GAAImuI,EAAejuI,EAAEhJ,GAAIunG,EAAEz+F,GAAG9I,MA2BxD,OAAOynG,EAAE7+F,KAAId,GAAK,IAAIwvI,EAAY,CAChCn+H,KAAMrR,EAAEc,KAAInG,GAAK,CAACA,KAClBkS,KAAM,CAACmM,EAAM,WC1Gf,GAAO,QACP,GAAe,CAAC,QAAS,MAAO,YAAa,eAAgB,iBAAkB,OAAQ,UAAW,cAC3FyxJ,IAA6B,QAAQ,GAAM,IAAejsE,IACnE,IAAI,MACFyzB,EAAK,IACLzuH,EAAG,UACH6rI,EAAS,aACTC,EAAY,eACZH,EAAc,KACd1vI,EAAI,QACJkoH,EAAO,WACPnwB,GACEgH,EA8BJ,OAAOyzB,EAAM,GAAM,CACjB,yBAeF,SAAgBx4H,GAMd,IAHA,IAAIurB,EAAS,EACT0+E,EAAU,EAELxrG,EAAI,EAAGA,EAAIuB,EAAKxB,OAAQC,IAAK,CACpC,IAAIe,EAAQuK,EAAI/J,EAAKvB,IAEjByvH,EAAQjkB,EAASzqG,IACnB+rB,EAASmqH,EAAenqH,EAAQmqH,EAAeG,EAAa5rC,EAASzqG,GAAQq2I,EAAa5rC,EAASzqG,KACnG+rB,EAASqqH,EAAUrqH,EAAQ,GAC3B0+E,EAAUzqG,GAEV+rB,EAASqqH,EAAUrqH,EAAQwyE,EAAWv+F,GAASk2I,EAAeG,EAAar2I,EAAOyqG,GAAU4rC,EAAar2I,EAAOyqG,IAAYzqG,GAIhI,OAAOk2I,EAAezrC,EAASjkG,EAAKulB,KAhCpC5sB,MAAO,SAAe4H,GACpB,OAAOxG,KAAKG,MAAMH,MAAM,SAAQwG,KAElCuvI,OAAQ,SAAgBvvI,GACtB,OAAOxG,KAAKG,MAAMH,MAAM,SAAQwG,EAAEutI,kBClDxC,SAASnvC,KAA2Q,OAA9PA,GAAWziG,OAAOwxB,QAAU,SAAU9xB,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAS9Z,UAAUxB,GAAI,IAAK,IAAIY,KAAO0a,EAAc7X,OAAOnB,UAAUgC,eAAe9B,KAAK8Y,EAAQ1a,KAAQuC,EAAOvC,GAAO0a,EAAO1a,IAAY,OAAOuC,IAA2B1B,MAAMH,KAAME,WAGhT,IACI,GAAe,CAAC,QAAS,SAAU,QAAS,WAAY,SAAU,QAAS,OAAQ,OAAQ,OAAQ,aAAc,YAAa,eAAgB,iBAAkB,WAAY,WACrKgxK,IAA0B,QAF1B,KAEwC,IAAelsE,IAChE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,MACNmzE,EAAK,SACLzwB,EAAQ,OACR/b,EAAM,MACN2yB,EAAK,KACL5rB,EAAI,KACJp8F,EAAI,KACJupH,EAAI,WACJ/B,EAAU,UACVooB,EAAS,aACTC,EAAY,eACZH,EAAc,SACdp0C,EAAQ,QACRyvB,GACEhsB,EA6CJ,OAAOJ,GAAS6zB,EAhEP,KAgEmB,CAC1Bud,YAAa,SAAqB5lI,GAChC,OAAO+gK,EAAS/gK,IAElB6lI,aAAc,SAAsB7lI,GAClC,OAiKJ,SAAmBA,GACjB,MAAM,IAAIjE,MAAM,8CAlKPilK,IAETxyK,MAAO,SAAe2C,GAEpB,IAEI6iB,EAAI+sJ,EAFAx8G,EAAOpzD,IAKf,MAAO,CACLmlJ,EAAGtiI,EAAEsiI,EAAEzlJ,UACPowK,EAAGjtJ,EAAEitJ,EAAEpwK,cAGT,CACFqwK,iBAGF,SAASA,EAAalhK,GAEpB,IASI1R,EAAG8I,EAAGd,EATN8Y,EAAOpP,EAAEktI,MAAM,GAEf9/F,EAAOptC,EAAEktI,MAAM,GAEfoJ,EAAIrvC,EAAS,CAAC73F,GAAO,SACrB+xJ,EAAQ7qB,EAAEjgI,MACV4qJ,EAAIjhK,EAAE6zF,QACNutE,EAAQH,EAAE5qJ,MAGViqC,EAAIo3E,EAAM,CAACtoH,GAAO,IAEtB,IAAK9Y,EAAI,EAAGA,EAAIV,KAAKwsB,IAAIgrB,EAAMh+B,KAAS9Y,EAAG,CAwBzC,IAAI03J,EAAQoT,EAAM9qK,GAAGA,GACjB+qK,EAAMhkD,EAAWQ,EAAMmwC,EAAO,GAAK,EAAI/7D,EAAK+7D,IAC5CsT,EAAUliD,EAAKiiD,GACfE,EAAe,EAEnB,IAAKjzK,EAAIgI,EAAGhI,EAAI8gB,EAAM9gB,IACpBizK,EAAe97B,EAAU87B,EAAch8B,EAAe67B,EAAM9yK,GAAGgI,GAAI8oH,EAAKgiD,EAAM9yK,GAAGgI,MAGnF,IAAIsS,EAAQ28H,EAAe87B,EAAKxrK,EAAK0rK,IAErC,IAAKr2E,EAAOtiF,GAAQ,CAElB,IAAI44J,EAAKrwE,EAAS68D,EAAOplJ,GAIzB,IAFA03C,EAAEhqD,GAAK,EAEFhI,EAAIgI,EAAI,EAAGhI,EAAI8gB,EAAM9gB,IACxBgyD,EAAEhyD,GAAKo3I,EAAa07B,EAAM9yK,GAAGgI,GAAIkrK,GAInC,IAAI1lD,EAAMuB,EAAW+B,EAAKsmB,EAAa87B,EAAI54J,KACvC+sB,OAAI,EAcR,IAAKv+B,EAAId,EAAGc,EAAIg2C,EAAMh2C,IAAK,CAGzB,IAFAu+B,EAAI,EAECrnC,EAAIgI,EAAGhI,EAAI8gB,EAAM9gB,IACpBqnC,EAAI8vG,EAAU9vG,EAAG4vG,EAAenmB,EAAK9+D,EAAEhyD,IAAK8yK,EAAM9yK,GAAG8I,KAMvD,IAFAu+B,EAAI4vG,EAAe5vG,EAAGmmF,GAEjBxtH,EAAIgI,EAAGhI,EAAI8gB,EAAM9gB,IACpB8yK,EAAM9yK,GAAG8I,GAAKmuI,EAAep0C,EAASiwE,EAAM9yK,GAAG8I,GAAImuI,EAAejlF,EAAEhyD,GAAIqnC,IAAK2rI,GAYjF,IAAKhzK,EAAI,EAAGA,EAAI8gB,EAAM9gB,IAAK,CAGzB,IAFAqnC,EAAI,EAECv+B,EAAId,EAAGc,EAAIgY,EAAMhY,IACpBu+B,EAAI8vG,EAAU9vG,EAAG4vG,EAAe47B,EAAM7yK,GAAG8I,GAAIkpD,EAAElpD,KAMjD,IAFAu+B,EAAI4vG,EAAe5vG,EAAGmmF,GAEjB1kH,EAAId,EAAGc,EAAIgY,IAAQhY,EACtB+pK,EAAM7yK,GAAG8I,GAAKsuI,EAAav0C,EAASgwE,EAAM7yK,GAAG8I,GAAImuI,EAAe5vG,EAAGypF,EAAK9+D,EAAElpD,MAAOkqK,KAOzF,MAAO,CACLhrB,EAAGA,EACH2qB,EAAGA,EACH5rK,SAAU,WACR,MAAO,MAAQzF,KAAK0mJ,EAAEjhJ,WAAa,QAAUzF,KAAKqxK,EAAE5rK,aAK1D,SAAS0rK,EAAS/gK,GAChB,IAAIpI,EAAMspK,EAAalhK,GAEnBohK,EAAQxpK,EAAIqpK,EAAE5qJ,MAElB,GAAIrW,EAAEqW,MAAMhoB,OAAS,EAGnB,IAFA,IAAI8uJ,EAA4B,YAArBikB,EAAM,GAAG,GAAG15J,KAAqBk5G,EAAQ,GAAK,EAEhDtyH,EAAI,EAAGA,EAAI8yK,EAAM/yK,SAAUC,EAClC,IAAK,IAAI8I,EAAI,EAAGA,EAAI9I,GAAK8I,GAAKgqK,EAAM,IAAM,IAAI/yK,SAAU+I,EACtDgqK,EAAM9yK,GAAG8I,GAAK+lJ,EAKpB,OAAOvlJ,MCjOP,GAAe,CAAC,QAAS,SAAU,eAAgB,YAAa,WAAY,aAAc,MAAO,WAAY,OACtG6pK,IAA2B,QAF3B,MAEyC,IAAe7sE,IACjE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,aACNmhF,EAAY,UACZD,EAAS,SACTrxH,EAAQ,WACRipG,EAAU,IACViC,EAAG,SACHrY,EAAQ,IACRrtG,GACEg7F,EAsBJ,OAAOyzB,EAnCE,MAmCU,CACjB,iBAAkB,SAAqBjyH,GACrC,IAAI6M,GAAO,EAAAy0G,EAAA,IAASthH,GAAKA,EAAE6M,QAAS,SAAU7M,GAE9C,OAAQ6M,EAAK5U,QACX,KAAK,EAEH,GAAgB,IAAZ4U,EAAK,GACP,OAAI,EAAAy0G,EAAA,IAASthH,GACJmuD,EAAO,CAACmhF,EAAa,EAAGtvI,EAAEvF,UAAU,MAEpC,CAAC60I,EAAa,EAAGtvI,EAAE,KAG5B,MAAM,IAAI2qJ,WAAW,iCAAuC,SAAO99I,GAAQ,KAG/E,KAAK,EAGD,IAAImM,EAAOnM,EAAK,GACZmqC,EAAOnqC,EAAK,GAEhB,GAAImM,IAASg+B,EACX,OAAI,EAAAsqE,EAAA,IAASthH,GACJmuD,EAAOm9G,EAAKtrK,EAAEvF,UAAWue,EAAMg+B,GAAOh3C,EAAEkzI,WAGxCo4B,EAAKtrK,EAAGgZ,EAAMg+B,GAGvB,MAAM,IAAI2zG,WAAW,iCAAuC,SAAO99I,GAAQ,KAIjF,QAEE,MAAM,IAAI89I,WAAW,0CAAgD,SAAO99I,GAAQ,OAG1F+lH,IAAK,SAAa5yH,GAEhB,OAAOsvI,EAAa,EAAGtvI,MAY3B,SAASsrK,EAAKC,EAAKvyJ,EAAMg+B,GACvB,IAAIp5B,EAAG2hB,EAAGxiB,EAAG9jB,EAAOyK,EAEpB,GAAa,IAATsV,EAAY,CAId,GAAc,KAFd/f,EAAQsyK,EAAI,GAAG,IAGb,MAAM5lK,MAAM,iDAGd,MAAO,CAAC,CAAC2pI,EAAa,EAAGr2I,KACpB,GAAa,IAAT+f,EAAY,CAErB,IAAI9P,EAAIggH,EAAIqiD,GAEZ,GAAU,IAANriK,EACF,MAAMvD,MAAM,iDAGd,MAAO,CAAC,CAAC2pI,EAAai8B,EAAI,GAAG,GAAIriK,GAAIomI,EAAaroB,EAAWskD,EAAI,GAAG,IAAKriK,IAAK,CAAComI,EAAaroB,EAAWskD,EAAI,GAAG,IAAKriK,GAAIomI,EAAai8B,EAAI,GAAG,GAAIriK,KAQ/I,IAAIw2F,EAAI6rE,EAAIrmK,SAEZ,IAAK0Y,EAAI,EAAGA,EAAI5E,EAAM4E,IACpB8hF,EAAE9hF,GAAK8hF,EAAE9hF,GAAG1Y,SAOd,IAFA,IAAIy6F,EAAIkR,EAAS73F,GAAMve,UAEdyL,EAAI,EAAGA,EAAI8wC,EAAM9wC,IAAK,CAE7B,IAAIslK,EAAOhoK,EAAIk8F,EAAEx5F,GAAGA,IAChBulK,EAAOvlK,EAGX,IAFA0X,EAAI1X,EAAI,EAED0X,EAAI5E,GACLxV,EAAIk8F,EAAE9hF,GAAG1X,IAAMslK,IACjBA,EAAOhoK,EAAIk8F,EAAE9hF,GAAG1X,IAChBulK,EAAO7tJ,GAGTA,IAGF,GAAa,IAAT4tJ,EACF,MAAM7lK,MAAM,kDAGdiY,EAAI6tJ,KAEMvlK,IACRxC,EAAOg8F,EAAEx5F,GACTw5F,EAAEx5F,GAAKw5F,EAAE9hF,GACT8hF,EAAE9hF,GAAKla,EACPA,EAAOi8F,EAAEz5F,GACTy5F,EAAEz5F,GAAKy5F,EAAE/hF,GACT+hF,EAAE/hF,GAAKla,GAIT,IAAIgoK,EAAKhsE,EAAEx5F,GACPylK,EAAKhsE,EAAEz5F,GAEX,IAAK0X,EAAI,EAAGA,EAAI5E,EAAM4E,IAAK,CACzB,IAAIguJ,EAAKlsE,EAAE9hF,GACPiuJ,EAAKlsE,EAAE/hF,GAEX,GAAIA,IAAM1X,GAER,GAAc,IAAV0lK,EAAG1lK,GAAU,CAIf,IAHA6W,EAAIuyH,EAAaroB,EAAW2kD,EAAG1lK,IAAKwlK,EAAGxlK,IAGlCq5B,EAAIr5B,EAAGq5B,EAAIyX,EAAMzX,IACpBqsI,EAAGrsI,GAAK8vG,EAAUu8B,EAAGrsI,GAAIvhB,EAASjB,EAAG2uJ,EAAGnsI,KAG1C,IAAKA,EAAI,EAAGA,EAAIyX,EAAMzX,IACpBssI,EAAGtsI,GAAK8vG,EAAUw8B,EAAGtsI,GAAIvhB,EAASjB,EAAG4uJ,EAAGpsI,UAGvC,CAKL,IAFAxiB,EAAI2uJ,EAAGxlK,GAEFq5B,EAAIr5B,EAAGq5B,EAAIyX,EAAMzX,IACpBqsI,EAAGrsI,GAAK+vG,EAAas8B,EAAGrsI,GAAIxiB,GAG9B,IAAKwiB,EAAI,EAAGA,EAAIyX,EAAMzX,IACpBssI,EAAGtsI,GAAK+vG,EAAau8B,EAAGtsI,GAAIxiB,KAMpC,OAAO4iF,MCpMT,GAAO,OACP,GAAe,CAAC,QAAS,MAAO,MAAO,WAAY,MAAO,YACnDmsE,IAA4B,QAAQ,GAAM,IAAettE,IAClE,IAAI,MACFyzB,EAAK,IACLzuH,EAAG,IACHuC,EAAG,SACH8qG,EAAQ,IACRuY,EAAG,SACHprG,GACEwgF,EA2BJ,OAAOyzB,EAAM,GAAM,CACjBsd,OAAQ,SAAgB7vC,GAEtB,IAAI7yF,EAAO6yF,EAAE7yF,OAEb,GAAoB,IAAhBA,EAAK5U,QAAgB4U,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAI89I,WAAW,iCAAuC,SAAO99I,GAAQ,KAmC7E,IAhCA,IAAI7N,EAAI6N,EAAK,GAYTia,EAgER,SAAoBilJ,EAAShsE,GAG3B,IAFA,IAES7/F,EAAI,EAAGA,EAFI,GAEeA,IACjC,IAAK,IAAIq4F,EAAI,EAAGA,GAAKr4F,EAAGq4F,IAAK,CAC3B,IAAIv3F,EAAId,EAAIq4F,EAEZ,GAAIyzE,EAAcD,EAASxzE,EAAGv3F,GAhFtB,MAiFN,MAAO,CACLu3F,EAAGA,EACHv3F,EAAGA,GAMX,MAAM,IAAI2E,MAAM,oHAhFDsmK,CAyCjB,SAAsBvsE,GAIpB,IAHA,IAAI1gG,EAAI0gG,EAAE7yF,OAAO,GACbk/J,EAAU,EAEL7zK,EAAI,EAAGA,EAAI8G,EAAG9G,IAAK,CAG1B,IAFA,IAAIg0K,EAAS,EAEJlrK,EAAI,EAAGA,EAAIhC,EAAGgC,IACrBkrK,GAAU1oK,EAAIk8F,EAAErjG,IAAI,CAACnE,EAAG8I,KAG1B+qK,EAAUvsK,KAAKyJ,IAAIijK,EAAQH,GAG7B,OAAOA,EA1DSI,CAAazsE,IAIvBnH,EAAIzxE,EAAOyxE,EACXv3F,EAAI8lB,EAAO9lB,EAOXorK,EAAOpuJ,EAAS0hF,EAAGlgG,KAAK2B,IAAI,GAAIH,IAEhC8+F,EAAI+Q,EAAS7xG,GACb6gG,EAAIgR,EAAS7xG,GAEbqtK,EAAS,EAETC,EAAUF,EAEVG,GAAa,EAERr0K,EAAI,EAAGA,GAAKqgG,EAAGrgG,IAClBA,EAAI,IACNo0K,EAAUtuJ,EAASsuJ,EAASF,GAC5BG,GAAaA,GAIfzsE,EAAI/5F,EAAI+5F,EAAG9hF,EADXquJ,EAASA,GAAU9zE,EAAIrgG,EAAI,KAAO,EAAIqgG,EAAIrgG,EAAI,GAAKA,GACvBo0K,IAC5BzsE,EAAI95F,EAAI85F,EAAG7hF,EAASquJ,EAASE,EAAWD,IAK1C,IAFA,IAAIzB,EAAI7sJ,EAASorG,EAAIvpB,GAAIC,GAEhB9hG,EAAK,EAAGA,EAAKgD,EAAGhD,IACvB6sK,EAAI7sJ,EAAS6sJ,EAAGA,GAGlB,OAAO,EAAAvpD,EAAA,IAAe5hB,GAAKA,EAAEooD,mBAAmB+iB,GAAKA,KAmDzD,SAASmB,EAAcD,EAASxzE,EAAGv3F,GAGjC,IAFA,IAAIwrK,EAAO,EAEFt0K,EAAI,EAAGA,GAAKqgG,EAAGrgG,IACtBs0K,GAAQt0K,EAKV,IAFA,IAAIu0K,EAAUD,EAELthC,EAAM3yC,EAAI,EAAG2yC,GAAO,EAAI3yC,EAAG2yC,IAClCuhC,GAAWvhC,EAGb,IAAIwhC,EAAYD,GAAW,EAAIl0E,EAAI,GACnC,OAAO,EAAM/4F,KAAK2B,IAAI4qK,EAAUvsK,KAAK2B,IAAI,EAAGH,GAAI,EAAIu3F,GAAKi0E,EAAOA,GAAQC,EAAUC,OC9JlF,GAAe,CAAC,QAAS,SAAU,WAAY,cAAe,eAAgB,OACvEC,IAA8B,QAF9B,SAE4C,IAAenuE,IACpE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,SACNnwC,EAAQ,YACRkxH,EAAW,aACXI,EAAY,IACZlmB,GACE5qB,EACA4uD,EAAcN,GAAkB,CAClC76B,QACAid,gBAEEod,EAAcN,GAAkB,CAClC/5B,UAkCF,OAAOA,EAAM,UAAU,SAAO,CAE5B,iCAAkC,SAAgCjyH,EAAGe,GAKnE,OAAOid,EAAShe,EAAGopH,EAAIroH,KAEzB,mBAAoB,SAAwBf,EAAGe,GAC7C,OAAOurJ,EAAYtsJ,EAAGe,EAAGuuI,GAAc,IAEzC,oBAAqB,SAAyBtvI,EAAGe,GAC/C,OAAOqsJ,EAAYptJ,EAAGe,EAAGuuI,GAAc,IAEzC,aAAc,SAAkBtvI,EAAGe,GAEjC,OAAOurJ,EAAYn+F,EAAOnuD,GAAIe,EAAGuuI,GAAc,GAAO70I,WAExD,sBAAuB,SAAwBuF,EAAGe,GAChD,OAAOid,EAAShe,EAAGopH,EAAIroH,MAExBuuI,EAAa7c,gBC3Ed,GAAO,eACP,GAAe,CAAC,QAAS,SAAU,SAAU,MAAO,WAAY,YAAa,MAAO,aAC7Em6C,IAAoC,QAAQ,GAAM,IAAepuE,IAC1E,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,OACN6mC,EAAM,IACNp0F,EAAG,SACHod,EAAQ,UACRopG,EAAS,IACT3iH,EAAG,UACHw+H,GACEzkC,EAkBJ,OAAOyzB,EAAM,GAAM,CACjB,eAAgB,SAAoB15B,EAAGj7F,GACrC,OAAOuvK,EAAO1+G,EAAOoqC,GAAIpqC,EAAO7wD,KAElC,gBAAiB,SAAqBi7F,EAAGj7F,GACvC,OAAOuvK,EAAOt0E,EAAGpqC,EAAO7wD,KAE1B,gBAAiB,SAAqBi7F,EAAGj7F,GACvC,OAAOuvK,EAAO1+G,EAAOoqC,GAAIj7F,IAE3B,iBAAkB,SAAsBi7F,EAAGj7F,GACzC,OAAOuvK,EAAOt0E,EAAGj7F,MAIrB,SAASuvK,EAAOt0E,EAAGj7F,GACjB,IAAIwvK,EAAUxvK,EAAEuP,OAAO5U,OACnB80K,EAAUx0E,EAAE1rF,OAAO5U,OAEvB,GAAI60K,EAAU,EACZ,MAAM,IAAInnK,MAAM,wCAGlB,GAAIonK,EAAU,EACZ,MAAM,IAAIpnK,MAAM,yCAGlB,GAAImnK,IAAYC,EACd,MAAM,IAAIpnK,MAAM,uCAMlB,GAAa,IAFF/E,EAAI23F,GAGb,MAAM,IAAI5yF,MAAM,oDAKlB,GAAa,IAFF/E,EAAItD,GAGb,MAAM,IAAIqI,MAAM,qDAGlB,IAAIqnK,EAAQh4E,EAAOuD,EAAG33F,EAAI23F,IACtB00E,EAAQj4E,EAAO13F,EAAGsD,EAAItD,IACtB0nB,EAASpkB,EAAIod,EAASgvJ,EAAOvoK,EAAI2iH,EAAU4lD,EAAOC,MAEtD,OAAIhqC,EAAUj+G,GACLA,EAEA3jB,OAAOo3E,QCjFhB,GAAO,cACP,GAAe,CAAC,QAAS,YAAa,aAAc,YAAa,cAC1Dy0F,IAAmC,QAAQ,GAAM,IAAe1uE,IACzE,IAAI,MACFyzB,EAAK,UACLod,EAAS,WACT93C,EAAU,UACVzkC,EAAS,WACTi2D,GACEvqB,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,qBAAsB,SAAyBjzH,GAC7C,IAAK8zD,EAAU9zD,IAAMu4F,EAAWv4F,GAC9B,MAAM,IAAI/E,UAAU,+DAMtB,IAFA,IAAI+qB,EAAS,EAEJ9sB,EAAI,EAAGA,GAAK8G,EAAG9G,IACtB8sB,EAASqqH,EAAUrqH,EAAQ+jG,EAAW/pH,EAAG9G,IAG3C,OAAO8sB,QC3CT,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,eAAgB,MAAO,WACnDmoJ,IAA6B,QAAQ,GAAM,IAAe3uE,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,aACNktH,EAAY,IACZ7qI,EAAG,QACHyyE,GACEsnB,EAiCJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ,SAAgBnC,GACtB,OAAIA,IAAM,GAAKoiB,EAAOi+F,aACb,QAAOrgH,GAGPotK,EAAc,IAAIl2F,EAAQl3E,EAAG,KAGxCk3E,QAASk2F,EACT/nC,UAAW,SAAmBrlI,GAC5B,IAAIe,EAAIf,EAAEmP,KAAK,GAEf,OAAKpO,EAAEw2F,cAAgBn1E,EAAOi+F,YACrBt/G,EAAE+1F,KAGFs2E,EAAc,IAAIl2F,EAAQl3E,EAAEg6F,WAAY,KAGnD,iBAAkB,SAAqBh6F,GACrC,OAAO,SAAQA,EAAGxG,OAEpB,WAAY,SAAgBwG,EAAG1D,GAE7B,OAAOgzI,EAAa91I,KAAKwG,GAAIyE,EAAInI,OAUrC,SAAS8wK,EAAcptK,GACrB,IAAIqtK,EAAQrtK,EAAEuzB,GAAK,EACnB,OAAO,IAAI2jD,EAAQ13E,KAAKiF,IAAIjF,KAAKC,KAAK4tK,EAAQA,EAAQrtK,EAAEs3E,GAAKt3E,EAAEs3E,KAAM93E,KAAKu/C,MAAM/+C,EAAEs3E,GAAI+1F,QClF1F,SAAS,KAA2Q,OAA9P,GAAW1xK,OAAOwxB,QAAU,SAAU9xB,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAS9Z,UAAUxB,GAAI,IAAK,IAAIY,KAAO0a,EAAc7X,OAAOnB,UAAUgC,eAAe9B,KAAK8Y,EAAQ1a,KAAQuC,EAAOvC,GAAO0a,EAAO1a,IAAY,OAAOuC,IAA2B1B,MAAMH,KAAME,WAEhT,SAAS,GAAQ6C,EAAQkzJ,GAAkB,IAAIxvJ,EAAOtE,OAAOsE,KAAK1D,GAAS,GAAIZ,OAAOu9G,sBAAuB,CAAE,IAAIzkE,EAAU94C,OAAOu9G,sBAAsB38G,GAAakzJ,IAAgBh7G,EAAUA,EAAQ5yC,QAAO,SAAU6tJ,GAAO,OAAO/zJ,OAAOgB,yBAAyBJ,EAAQmzJ,GAAKl0J,eAAgByE,EAAKjF,KAAKrB,MAAMsG,EAAMw0C,GAAY,OAAOx0C,EAE9U,SAAS,GAAc5E,GAAU,IAAK,IAAInD,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IAAK,CAAE,IAAIsb,EAAyB,MAAhB9Z,UAAUxB,GAAawB,UAAUxB,GAAK,GAAQA,EAAI,EAAK,GAAQyD,OAAO6X,IAAS,GAAM+C,SAAQ,SAAUzd,GAAO,GAAgBuC,EAAQvC,EAAK0a,EAAO1a,OAAsB6C,OAAOi0J,0BAA6Bj0J,OAAO6C,iBAAiBnD,EAAQM,OAAOi0J,0BAA0Bp8I,IAAmB,GAAQ7X,OAAO6X,IAAS+C,SAAQ,SAAUzd,GAAO6C,OAAOC,eAAeP,EAAQvC,EAAK6C,OAAOgB,yBAAyB6W,EAAQ1a,OAAe,OAAOuC,EAE7gB,SAAS,GAAgBY,EAAKnD,EAAKG,GAAiK,OAApJH,KAAOmD,EAAON,OAAOC,eAAeK,EAAKnD,EAAK,CAAEG,MAAOA,EAAOuC,YAAY,EAAMC,cAAc,EAAMC,UAAU,IAAkBO,EAAInD,GAAOG,EAAgBgD,EAQ3M,IACI,GAAe,CAAC,MAAO,SAAU,YAAa,WAAY,iBAAkB,eAAgB,MAAO,MAAO,MAAO,QAAS,QAAS,YAAa,SAAU,SAAU,UAAW,YAAa,YACrLqxK,IAAiC,QAFjC,OAE+C,IAAe9uE,IACvE,IAwFIzqF,EAAMxS,EAAO2E,GAxFb,GACFwb,EAAE,OACFU,EAAM,UACNitH,EAAS,SACTt0C,EAAQ,eACRo0C,EAAc,aACdG,EAAY,IACZnuI,EAAG,IACHqC,EAAG,IACH+kH,EAAG,MACH/lH,EAAK,MACLilH,EAAK,UACLwb,EAAS,OACTJ,EAAM,OACN1gI,EAAM,QACN+0E,EACAmuD,UAAW0X,EACXz9C,SAAU09C,GACRx+C,EACAxE,EAAW73F,EAqBf,SAAS6yH,EAAK/7H,EAAOiG,GACnB,KAAM1F,gBAAgBw7H,GACpB,MAAM,IAAIrvH,MAAM,oDAGlB,GAAM1M,UAAyCgqI,EAAUhqI,MAAU,EAAAqoH,EAAA,IAAUroH,GAC3E,MAAM,IAAIgB,UAAU,kGAGtB,QAAaJ,IAATqF,IAAuC,iBAATA,GAA8B,KAATA,GACrD,MAAM,IAAIjF,UAAU,yDAGtB,QAAaJ,IAATqF,EAAoB,CACtB,IAAIgjE,EAAI8yD,EAAKt+G,MAAMxX,GACnB1F,KAAK+zK,MAAQrrG,EAAEqrG,MACf/zK,KAAKm6H,WAAazxD,EAAEyxD,eACf,CACLn6H,KAAK+zK,MAAQ,CAAC,CACZ7qK,KAAM8qK,EACN9lK,OAAQ+lK,EAASC,KAEjBC,MAAO,IAETn0K,KAAKm6H,WAAa,GAElB,IAAK,IAAIz7H,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAC1CsB,KAAKm6H,WAAWz7H,GAAK,EAIzBsB,KAAKP,MAAQA,QAAwCO,KAAKqjJ,WAAW5jJ,GAAS,KAC9EO,KAAKm9I,WAAY,EAMjBn9I,KAAKq0K,6BAA8B,EAYrC,SAASC,IACP,KAAa,MAAN5nK,GAAmB,OAANA,GAClBjI,IAQJ,SAAS+5H,EAAQ9xH,GACf,OAAOA,GAAK,KAAOA,GAAK,IAG1B,SAASjI,IACPsD,IACA2E,EAAI6N,EAAKw/E,OAAOhyF,GAGlB,SAAS62C,EAAO21H,GACdxsK,EAAQwsK,EACR7nK,EAAI6N,EAAKw/E,OAAOhyF,GAGlB,SAAS84H,IACP,IAAIl4H,EAAS,GACT4rK,EAAWxsK,EASf,GAPU,MAAN2E,EACFjI,IACe,MAANiI,IACT/D,GAAU+D,EACVjI,MA1BJ,SAAoBiI,GAClB,OAAOA,GAAK,KAAOA,GAAK,KAAa,MAANA,EA4B1B2xH,CAAW3xH,GAGd,OADAkyC,EAAO21H,GACA,KAIT,GAAU,MAAN7nK,GAIF,GAHA/D,GAAU+D,EACVjI,KAEK+5H,EAAQ9xH,GAGX,OADAkyC,EAAO21H,GACA,SAEJ,CACL,KAAO/1C,EAAQ9xH,IACb/D,GAAU+D,EACVjI,IAGQ,MAANiI,IACF/D,GAAU+D,EACVjI,KAIJ,KAAO+5H,EAAQ9xH,IACb/D,GAAU+D,EACVjI,IAIF,GAAU,MAANiI,GAAmB,MAANA,EAAW,CAE1B,IAAI8nK,EAAkB,GAClBC,EAAiB1sK,EAUrB,GATAysK,GAAmB9nK,EACnBjI,IAEU,MAANiI,GAAmB,MAANA,IACf8nK,GAAmB9nK,EACnBjI,MAIG+5H,EAAQ9xH,GAGX,OADAkyC,EAAO61H,GACA9rK,EAMT,IAFAA,GAAkB6rK,EAEXh2C,EAAQ9xH,IACb/D,GAAU+D,EACVjI,IAIJ,OAAOkE,EAGT,SAAS+rK,IAGP,IAFA,IAAIC,EAAW,GAERn2C,EAAQ9xH,IAAM8uH,EAAKo5C,aAAaloK,IACrCioK,GAAYjoK,EACZjI,IAIF,IAAIowK,EAASF,EAAS56E,OAAO,GAE7B,OAAIyhC,EAAKo5C,aAAaC,GACbF,EAEA,KAIX,SAASG,EAAeC,GACtB,OAAIroK,IAAMqoK,GACRtwK,IACOswK,GAEA,KAhIXv5C,EAAKx6H,UAAU8W,KAAO,OACtB0jH,EAAKx6H,UAAUswH,QAAS,EA8IxBkK,EAAKt+G,MAAQ,SAAUtD,EAAKuB,GAM1B,GALAA,EAAUA,GAAW,GAErBpT,GAAS,EACT2E,EAAI,GAEgB,iBAJpB6N,EAAOX,GAKL,MAAM,IAAInZ,UAAU,mDAGtB,IAAIyI,EAAO,IAAIsyH,EACftyH,EAAK6qK,MAAQ,GACb,IAAIiB,EAAyB,EACzBC,GAAgB,EAapBxwK,IACA6vK,IAEA,IAAIr3B,EAAWpc,IACXphI,EAAQ,KAEZ,GAAIw9I,EAAU,CACZ,GAAsB,cAAlBr0H,EAAOjgB,OACTlJ,EAAQ,IAAI8jJ,EAAWtG,QAClB,GAAsB,aAAlBr0H,EAAOjgB,OAChB,IAEElJ,EAAQ,IAAI+jJ,EAAUvG,GACtB,MAAO78I,GACPX,EAAQ4lB,WAAW43H,QAIrBx9I,EAAQ4lB,WAAW43H,GAGrBq3B,IAGIQ,EAAe,MACjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,OACxBE,GAA0B,EAC1BC,GAAgB,GASpB,IAJA,IAAIC,EAAuB,GAEvBC,EAA8B,IAErB,CAIX,IAHAb,IAGa,MAAN5nK,GACLwoK,EAAqB1zK,KAAKwzK,GAC1BG,GAA+BH,EAC/BA,EAAyB,EACzBvwK,IACA6vK,IAIF,IAAIc,EAEJ,IAAI1oK,EASF,MARA,IAAI2oK,EAAO3oK,EAGX,GAAa,QAFb0oK,EAAOV,KAGL,MAAM,IAAIp3F,YAAY,eAAiB+3F,EAAO,SAAW96J,EAAO,cAAgBxS,EAAMtC,YAQ1F,IAAIgtE,EAAM6iG,EAAUF,GAEpB,GAAY,OAAR3iG,EAEF,MAAM,IAAI6K,YAAY,SAAW83F,EAAO,gBAG1C,IAAIjB,EAAQa,EAAyBG,EAIrC,GAFAb,IAEIQ,EAAe,KAAM,CACvBR,IACA,IAAIxwK,EAAI+8H,IAER,GAAU,OAAN/8H,EAEF,MAAM,IAAIw5E,YAAY,OAAS1jE,EAAM,sDAGvCu6J,GAASrwK,EAIXoF,EAAK6qK,MAAMvyK,KAAK,CACd0H,KAAMupE,EAAIvpE,KACVgF,OAAQukE,EAAIvkE,OACZimK,MAAOA,IAGT,IAAK,IAAIz1K,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAC1CwK,EAAKixH,WAAWz7H,KAAO+zE,EAAIvpE,KAAKixH,WAAWz7H,IAAM,GAAKy1K,EAOxD,IAFAG,IAEa,MAAN5nK,GAAW,CAChB,GAAoC,IAAhCwoK,EAAqBz2K,OACvB,MAAM,IAAI6+E,YAAY,qBAAuB/iE,EAAO,cAAgBxS,EAAMtC,YAG5E0vK,GAA+BD,EAAqB17G,MACpD/0D,IACA6vK,IAqBF,GAhBAW,GAAgB,EAEZH,EAAe,MAEjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,MAExBE,GAA0B,EAC1BC,GAAgB,GAGhBD,EAAyB,EAIvBviG,EAAIvpE,KAAKpG,KAAM,CACjB,IAAIyyK,EAAU9iG,EAAIvpE,KAAKpG,KAAKxD,IAC5Bk2K,EAAaC,KAAKF,GAAW,CAC3BrsK,KAAMupE,EAAIvpE,KACVgF,OAAQukE,EAAIvkE,SAQlB,GAFAomK,IAEI5nK,EACF,MAAM,IAAI4wE,YAAY,qBAAuB1jE,EAAM,KAIrD,GAAIq7J,EACF,MAAM,IAAI33F,YAAY,yBAA2B1jE,EAAM,KAIzD,GAAoC,IAAhCs7J,EAAqBz2K,OACvB,MAAM,IAAI6+E,YAAY,qBAAuB/iE,EAAO,KAItD,GAA0B,IAAtBrR,EAAK6qK,MAAMt1K,SAAiB0c,EAAQu6J,aACtC,MAAM,IAAIp4F,YAAY,IAAM1jE,EAAM,uBAIpC,OADA1Q,EAAKzJ,WAAkBY,IAAVZ,EAAsByJ,EAAKm6I,WAAW5jJ,GAAS,KACrDyJ,GASTsyH,EAAKx6H,UAAUijG,MAAQ,WACrB,IAAI/6F,EAAO,IAAIsyH,EACftyH,EAAKi0I,UAAYn9I,KAAKm9I,UACtBj0I,EAAKmrK,4BAA8Br0K,KAAKq0K,4BACxCnrK,EAAKzJ,OAAQ,SAAMO,KAAKP,OACxByJ,EAAKixH,WAAan6H,KAAKm6H,WAAWr1H,MAAM,GACxCoE,EAAK6qK,MAAQ,GAEb,IAAK,IAAIr1K,EAAI,EAAGA,EAAIsB,KAAK+zK,MAAMt1K,OAAQC,IAGrC,IAAK,IAAIoF,KAFToF,EAAK6qK,MAAMr1K,GAAK,GAEFsB,KAAK+zK,MAAMr1K,IACnB,SAAesB,KAAK+zK,MAAMr1K,GAAIoF,KAChCoF,EAAK6qK,MAAMr1K,GAAGoF,GAAK9D,KAAK+zK,MAAMr1K,GAAGoF,IAKvC,OAAOoF,GASTsyH,EAAKx6H,UAAU20K,WAAa,WAC1B,OAA0B,IAAtB31K,KAAK+zK,MAAMt1K,SAIRuB,KAAK+zK,MAAMt1K,OAAS,GAAKuH,KAAKgE,IAAIhK,KAAK+zK,MAAM,GAAGI,MAAQ,GAAO,QAWxE34C,EAAKx6H,UAAUqiJ,WAAa,SAAU5jJ,GACpC,IAAIm2K,EAAWC,EAAYC,EAAWC,EAClCz3D,EAEJ,GAAI7+G,SAA+D,IAAtBO,KAAK+zK,MAAMt1K,OACtD,OAAOgB,EACF,GAAIO,KAAK21K,aAAc,CAG5B,IAAIljG,EAAMhzE,EACV6+G,EAAUkd,EAAKw6C,qBAAoB,QAAOv2K,IAE1C,IAAK,IAAIf,EAAI,EAAGA,EAAIsB,KAAK+zK,MAAMt1K,OAAQC,IACrCk3K,EAAYt3D,EAAQt+G,KAAK+zK,MAAMr1K,GAAGwK,KAAKzJ,OACvCs2K,EAAkBz3D,EAAQt+G,KAAK+zK,MAAMr1K,GAAGwP,OAAOzO,OAC/Cq2K,EAAYx3D,EAAQt+G,KAAK+zK,MAAMr1K,GAAGy1K,OAClC1hG,EAAMkjE,EAAeljE,EAAK9qE,EAAIguI,EAAeigC,EAAWG,GAAkBD,IAG5E,OAAOrjG,EAQP,OAHAmjG,GAFAt3D,EAAUkd,EAAKw6C,qBAAoB,QAAOv2K,KAEtBO,KAAK+zK,MAAM,GAAG7qK,KAAKzJ,OACvCo2K,EAAav3D,EAAQt+G,KAAK+zK,MAAM,GAAG7qK,KAAK4W,QACxCi2J,EAAkBz3D,EAAQt+G,KAAK+zK,MAAM,GAAG7lK,OAAOzO,OACxCk2I,EAAeE,EAAUp2I,EAAOo2K,GAAalgC,EAAeigC,EAAWG,KAalFv6C,EAAKx6H,UAAUi1K,aAAe,SAAUx2K,EAAOy2K,GAC7C,IAAIN,EAAWC,EAAYC,EAAWC,EAClCz3D,EAEJ,GAAI7+G,SAA+D,IAAtBO,KAAK+zK,MAAMt1K,OACtD,OAAOgB,EACF,GAAIO,KAAK21K,aAAc,CAI5B,IAAIljG,EAAMhzE,EACV6+G,EAAUkd,EAAKw6C,qBAAoB,QAAOv2K,IAE1C,IAAK,IAAIf,EAAI,EAAGA,EAAIsB,KAAK+zK,MAAMt1K,OAAQC,IACrCk3K,EAAYt3D,EAAQt+G,KAAK+zK,MAAMr1K,GAAGwK,KAAKzJ,OACvCs2K,EAAkBz3D,EAAQt+G,KAAK+zK,MAAMr1K,GAAGwP,OAAOzO,OAC/Cq2K,EAAYx3D,EAAQt+G,KAAK+zK,MAAMr1K,GAAGy1K,OAClC1hG,EAAMqjE,EAAarjE,EAAK9qE,EAAIguI,EAAeigC,EAAWG,GAAkBD,IAG1E,OAAOrjG,EASP,OAJAmjG,GAFAt3D,EAAUkd,EAAKw6C,qBAAoB,QAAOv2K,KAEtBO,KAAK+zK,MAAM,GAAG7qK,KAAKzJ,OACvCs2K,EAAkBz3D,EAAQt+G,KAAK+zK,MAAM,GAAG7lK,OAAOzO,OAC/Co2K,EAAav3D,EAAQt+G,KAAK+zK,MAAM,GAAG7qK,KAAK4W,QAG/ByhF,EAASu0C,EAAaA,EAAar2I,EAAOm2K,GAD/CM,QAC2DH,EAEAG,GAFkBL,IAgBrF,IAAIP,GAAY,SAAQ17J,IAEtB,IAAI,SAAeu8J,EAAOv8J,GAAM,CAC9B,IAAI1Q,EAAOitK,EAAMv8J,GAEjB,MAAO,CACL1Q,OACAgF,OAHWhF,EAAKktK,SAAS,KAO7B,IAAK,IAAI1hD,KAASyhD,EAChB,IAAI,SAAeA,EAAOzhD,KACpB,SAAS96G,EAAK86G,GAAQ,CACxB,IAAI2hD,EAAQF,EAAMzhD,GACd4hD,EAAY18J,EAAInb,OAASi2H,EAAMj2H,OAC/B83K,EAAa38J,EAAIq4B,UAAU,EAAGqkI,GAE9BE,GAAU,SAAeH,EAAMD,SAAUG,GAAcF,EAAMD,SAASG,QAAcl2K,EAExF,QAAgBA,IAAZm2K,EAEF,MAAO,CACLttK,KAAMmtK,EACNnoK,OAAQsoK,GAOlB,OAAO,OACN,CACDt/B,OAAQj3I,GAAQA,EAAK,GACrB+9E,MAAO,MA0LT,SAASy4F,EAAqBvtK,GAC5B,OAAIA,EAAKs3I,UAAUyI,EAAWirB,OAAwB,OAAfhrK,EAAKzJ,QAAmBmpB,EAAOi+F,YAC7D39G,EAAKzJ,MAELyJ,EAlLXsyH,EAAKC,gBAAkB,SAAU/1H,GAC/B,OAA2B,OAApB4vK,EAAU5vK,IAUnB81H,EAAKx6H,UAAU01I,QAAU,SAAU5zI,GAKjC,GAJoB,iBAATA,IACTA,EAAOmmJ,EAAWnmJ,KAGfA,EACH,OAAO,EAIT,IAAK,IAAIpE,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAC1C,GAAIsH,KAAKgE,KAAKhK,KAAKm6H,WAAWz7H,IAAM,IAAMoE,EAAKq3H,WAAWz7H,IAAM,IAAM,MACpE,OAAO,EAIX,OAAO,GAWT88H,EAAKx6H,UAAUw/I,UAAY,SAAU/vI,GAEnC,IAAK,IAAI/R,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAC1C,GAAIsH,KAAKgE,KAAKhK,KAAKm6H,WAAWz7H,IAAM,IAAM+R,EAAM0pH,WAAWz7H,IAAM,IAAM,MACrE,OAAO,EAIX,OAAO,GAUT88H,EAAKx6H,UAAUg7F,OAAS,SAAUvrF,GAChC,OAAOzQ,KAAKwgJ,UAAU/vI,IAAUw9G,EAAMjuH,KAAKP,MAAOgR,EAAMhR,QAU1D+7H,EAAKx6H,UAAUwjB,SAAW,SAAU/T,GAGlC,IAFA,IAAIgiE,EAAMzyE,KAAKikG,QAENvlG,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAE1C+zE,EAAI0nD,WAAWz7H,IAAMsB,KAAKm6H,WAAWz7H,IAAM,IAAM+R,EAAM0pH,WAAWz7H,IAAM,GAI1E,IAAK,IAAI8F,EAAK,EAAGA,EAAKiM,EAAMsjK,MAAMt1K,OAAQ+F,IAAM,CAE9C,IAAI8tE,EAAW,GAAc,GAAI7hE,EAAMsjK,MAAMvvK,IAE7CiuE,EAAIshG,MAAMvyK,KAAK8wE,GAIjB,GAAmB,OAAftyE,KAAKP,OAAkC,OAAhBgR,EAAMhR,MAAgB,CAC/C,IAAIi3K,EAAyB,OAAf12K,KAAKP,MAAiBO,KAAKqjJ,WAAW,GAAKrjJ,KAAKP,MAC1Dk3K,EAA2B,OAAhBlmK,EAAMhR,MAAiBgR,EAAM4yI,WAAW,GAAK5yI,EAAMhR,MAClEgzE,EAAIhzE,MAAQk2I,EAAe+gC,EAASC,QAEpClkG,EAAIhzE,MAAQ,KAId,OADAgzE,EAAI4hG,6BAA8B,EAC3BoC,EAAqBhkG,IAU9B+oD,EAAKx6H,UAAUw6F,OAAS,SAAU/qF,GAGhC,IAFA,IAAIgiE,EAAMzyE,KAAKikG,QAENvlG,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAE1C+zE,EAAI0nD,WAAWz7H,IAAMsB,KAAKm6H,WAAWz7H,IAAM,IAAM+R,EAAM0pH,WAAWz7H,IAAM,GAI1E,IAAK,IAAIgzI,EAAM,EAAGA,EAAMjhI,EAAMsjK,MAAMt1K,OAAQizI,IAAO,CAEjD,IAAIp/D,EAAW,GAAc,GAAc,GAAI7hE,EAAMsjK,MAAMriC,IAAO,GAAI,CACpEyiC,OAAQ1jK,EAAMsjK,MAAMriC,GAAKyiC,QAG3B1hG,EAAIshG,MAAMvyK,KAAK8wE,GAIjB,GAAmB,OAAftyE,KAAKP,OAAkC,OAAhBgR,EAAMhR,MAAgB,CAC/C,IAAIi3K,EAAyB,OAAf12K,KAAKP,MAAiBO,KAAKqjJ,WAAW,GAAKrjJ,KAAKP,MAC1Dk3K,EAA2B,OAAhBlmK,EAAMhR,MAAiBgR,EAAM4yI,WAAW,GAAK5yI,EAAMhR,MAClEgzE,EAAIhzE,MAAQq2I,EAAa4gC,EAASC,QAElClkG,EAAIhzE,MAAQ,KAId,OADAgzE,EAAI4hG,6BAA8B,EAC3BoC,EAAqBhkG,IAU9B+oD,EAAKx6H,UAAU2G,IAAM,SAAU7D,GAG7B,IAFA,IAAI2uE,EAAMzyE,KAAKikG,QAENvlG,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAE1C+zE,EAAI0nD,WAAWz7H,IAAMsB,KAAKm6H,WAAWz7H,IAAM,GAAKoF,EAIlD,IAAK,IAAIirJ,EAAM,EAAGA,EAAMt8E,EAAIshG,MAAMt1K,OAAQswJ,IACxCt8E,EAAIshG,MAAMhlB,GAAKolB,OAASrwK,EAc1B,OAXkB,OAAd2uE,EAAIhzE,MACNgzE,EAAIhzE,MAAQkI,EAAI8qE,EAAIhzE,MAAOqE,GAM3B2uE,EAAIhzE,MAAQ,KAGdgzE,EAAI4hG,6BAA8B,EAC3BoC,EAAqBhkG,IAwB9B+oD,EAAKx6H,UAAUgJ,IAAM,WAGnB,IAAIhC,EAAMhI,KAAKikG,QAGf,IAAK,IAAIvlG,KAFTsJ,EAAIvI,MAAsB,OAAduI,EAAIvI,MAAiBuK,EAAIhC,EAAIvI,OAAS,KAEpCuI,EAAI+rK,MACe,OAA3B/rK,EAAI+rK,MAAMr1K,GAAGwK,KAAKxD,MAA4C,QAA3BsC,EAAI+rK,MAAMr1K,GAAGwK,KAAKxD,OACvDsC,EAAI+rK,MAAMr1K,GAAGwK,KAAOitK,EAAMxM,GAI9B,OAAO3hK,GAUTwzH,EAAKx6H,UAAU6sH,GAAK,SAAUozB,GAC5B,IAAIxwI,EACAhR,EAAuB,OAAfO,KAAKP,MAAiBO,KAAKqjJ,WAAW,GAAKrjJ,KAAKP,MAE5D,GAA6B,iBAAlBwhJ,EAA4B,CAIrC,GAFAxwI,EAAQ+qH,EAAKt+G,MAAM+jI,IAEdjhJ,KAAKwgJ,UAAU/vI,GAClB,MAAM,IAAItE,MAAM,wBAAwBT,OAAO+E,EAAMhL,WAAY,UAAUiG,OAAO1L,KAAKyF,WAAY,OAGrG,GAAoB,OAAhBgL,EAAMhR,MACR,MAAM,IAAI0M,MAAM,yCAMlB,OAHAsE,EAAMhR,OAAQ,SAAMA,GACpBgR,EAAM0sI,WAAY,EAClB1sI,EAAM4jK,6BAA8B,EAC7B5jK,EACF,IAAI,EAAAq3G,EAAA,IAAOm5B,GAAgB,CAChC,IAAKjhJ,KAAKwgJ,UAAUS,GAClB,MAAM,IAAI90I,MAAM,wBAAwBT,OAAOu1I,EAAcx7I,WAAY,UAAUiG,OAAO1L,KAAKyF,WAAY,OAG7G,GAA4B,OAAxBw7I,EAAcxhJ,MAChB,MAAM,IAAI0M,MAAM,yCAOlB,OAJAsE,EAAQwwI,EAAch9C,SAChBxkG,OAAQ,SAAMA,GACpBgR,EAAM0sI,WAAY,EAClB1sI,EAAM4jK,6BAA8B,EAC7B5jK,EAEP,MAAM,IAAItE,MAAM,yCAYpBqvH,EAAKx6H,UAAUw/F,SAAW,SAAUygD,GAClC,OAAOzgD,EAASxgG,KAAK42K,UAAU31B,KAUjCzlB,EAAKx6H,UAAU41K,UAAY,SAAU31B,GACnC,IAAIxwI,EASJ,OALEA,EAFEwwI,EAEMjhJ,KAAK6tH,GAAGozB,GAERjhJ,KAAKikG,SAGL0xE,cAAuC,IAAvBllK,EAAMsjK,MAAMt1K,OAC7BgS,EAAMwlK,aAAaxlK,EAAMhR,OAEzBgR,EAAMwlK,aAAaxlK,EAAMhR,MAAOgR,EAAMsjK,MAAM,GAAG7lK,OAAOzO,QAUjE+7H,EAAKx6H,UAAUyE,SAAW,WACxB,OAAOzF,KAAKqpI,UAUd7N,EAAKx6H,UAAUkgG,OAAS,WACtB,MAAO,CACLgoB,OAAQ,OACRzpH,MAAOO,KAAKi2K,aAAaj2K,KAAKP,OAC9ByJ,KAAMlJ,KAAK09J,cACXvgB,UAAWn9I,KAAKm9I,YAYpB3hB,EAAKrS,SAAW,SAAUhiB,GACxB,IAAIj+F,EAAO,IAAIsyH,EAAKr0B,EAAK1nG,MAAO0nG,EAAKj+F,MAErC,OADAA,EAAKi0I,UAAYh2C,EAAKg2C,YAAa,EAC5Bj0I,GASTsyH,EAAKx6H,UAAUC,QAAUu6H,EAAKx6H,UAAUyE,SAMxC+1H,EAAKx6H,UAAUo4E,SAAW,WACxB,IAGIy9F,EAcEC,EAjBF9uK,EAAMhI,KAAKikG,QACX8yE,EAAmB,GAIvB,IAAK,IAAIz3K,KAAO03K,EACd,IAAI,SAAeA,EAAmB13K,IAChC0I,EAAI0uI,QAAQuS,EAAW3pJ,IAAO,CAChCu3K,EAAev3K,EACf,MAKN,GAAqB,SAAjBu3K,EACF7uK,EAAI+rK,MAAQ,QAWZ,GAPI8C,IAEE,SAAeG,EAAmBH,KACpCC,EAAeE,EAAkBH,IAIjCC,EACF9uK,EAAI+rK,MAAQ,CAAC,CACX7qK,KAAM4tK,EAAa5tK,KACnBgF,OAAQ4oK,EAAa5oK,OACrBimK,MAAO,QAEJ,CAML,IAFA,IAAI8C,GAAiB,EAEZv4K,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAAK,CAC/C,IAAI62K,EAAUnB,EAAgB11K,GAE1BsH,KAAKgE,IAAIhC,EAAImyH,WAAWz7H,IAAM,GAAK,SACjC,SAAes4K,EAAmBzB,GACpCwB,EAAiBv1K,KAAK,CACpB0H,KAAM8tK,EAAkBzB,GAASrsK,KACjCgF,OAAQ8oK,EAAkBzB,GAASrnK,OACnCimK,MAAOnsK,EAAImyH,WAAWz7H,IAAM,IAG9Bu4K,GAAiB,GAMnBF,EAAiBt4K,OAASuJ,EAAI+rK,MAAMt1K,SAAWw4K,IAEjDjvK,EAAI+rK,MAAQgD,GAKlB,OAAO/uK,GAOTwzH,EAAKx6H,UAAUk2K,KAAO,WAMpB,IALA,IAAIlvK,EAAMhI,KAAKikG,QACX8yE,EAAmB,GAIdr4K,EAAI,EAAGA,EAAI01K,EAAgB31K,OAAQC,IAAK,CAC/C,IAAI62K,EAAUnB,EAAgB11K,GAE9B,GAAIsH,KAAKgE,IAAIhC,EAAImyH,WAAWz7H,IAAM,GAAK,MAAO,CAC5C,KAAI,SAAe82K,EAAa2B,GAAI5B,GAOlC,MAAM,IAAIppK,MAAM,8BAAgCopK,EAAU,gBAN1DwB,EAAiBv1K,KAAK,CACpB0H,KAAMssK,EAAa2B,GAAG5B,GAASrsK,KAC/BgF,OAAQsnK,EAAa2B,GAAG5B,GAASrnK,OACjCimK,MAAOnsK,EAAImyH,WAAWz7H,IAAM,KAYpC,OAHAsJ,EAAI+rK,MAAQgD,EACZ/uK,EAAIm1I,WAAY,EAChBn1I,EAAIqsK,6BAA8B,EAC3BrsK,GASTwzH,EAAKx6H,UAAU08J,YAAc,WAM3B,IALA,IAAI0Z,EAAS,GACTC,EAAS,GACTC,EAAO,EACPC,EAAO,EAEF74K,EAAI,EAAGA,EAAIsB,KAAK+zK,MAAMt1K,OAAQC,IACjCsB,KAAK+zK,MAAMr1K,GAAGy1K,MAAQ,GACxBmD,IACAF,GAAU,IAAMp3K,KAAK+zK,MAAMr1K,GAAGwP,OAAOxI,KAAO1F,KAAK+zK,MAAMr1K,GAAGwK,KAAKxD,KAE3DM,KAAKgE,IAAIhK,KAAK+zK,MAAMr1K,GAAGy1K,MAAQ,GAAO,QACxCiD,GAAU,IAAMp3K,KAAK+zK,MAAMr1K,GAAGy1K,QAEvBn0K,KAAK+zK,MAAMr1K,GAAGy1K,MAAQ,GAC/BoD,IAIJ,GAAIA,EAAO,EACT,IAAK,IAAItS,EAAM,EAAGA,EAAMjlK,KAAK+zK,MAAMt1K,OAAQwmK,IACrCjlK,KAAK+zK,MAAM9O,GAAKkP,MAAQ,IACtBmD,EAAO,GACTD,GAAU,IAAMr3K,KAAK+zK,MAAM9O,GAAK/2J,OAAOxI,KAAO1F,KAAK+zK,MAAM9O,GAAK/7J,KAAKxD,KAE/DM,KAAKgE,IAAIhK,KAAK+zK,MAAM9O,GAAKkP,MAAQ,GAAO,QAC1CkD,GAAU,KAAOr3K,KAAK+zK,MAAM9O,GAAKkP,SAGnCkD,GAAU,IAAMr3K,KAAK+zK,MAAM9O,GAAK/2J,OAAOxI,KAAO1F,KAAK+zK,MAAM9O,GAAK/7J,KAAKxD,KACnE2xK,GAAU,IAAMr3K,KAAK+zK,MAAM9O,GAAKkP,QAOxCiD,EAASA,EAAOn0I,OAAO,GACvBo0I,EAASA,EAAOp0I,OAAO,GAEnBq0I,EAAO,GAAKC,EAAO,IACrBH,EAAS,IAAMA,EAAS,KAGtBG,EAAO,GAAKD,EAAO,IACrBD,EAAS,IAAMA,EAAS,KAG1B,IAAIz9J,EAAMw9J,EAOV,OALIE,EAAO,GAAKC,EAAO,IACrB39J,GAAO,OAGTA,EAAOy9J,GAcT77C,EAAKx6H,UAAUqoI,OAAS,SAAUluH,GAGhC,IAAIq8J,EAAOx3K,KAAKq0K,6BAA8C,OAAfr0K,KAAKP,MAAiBO,KAAKikG,QAAUjkG,KAAKo5E,WAErFq+F,GAAc,EAOlB,IAAK,IAAI/4K,UALiB,IAAf84K,EAAK/3K,OAAwC,OAAf+3K,EAAK/3K,QAAkB,EAAAqoH,EAAA,IAAU0vD,EAAK/3K,SAE7Eg4K,EAAczxK,KAAKgE,IAAIwtK,EAAK/3K,MAAMs6B,IAAM,OAG5By9I,EAAKzD,OACb,SAAeyD,EAAKzD,MAAOr1K,IACzB84K,EAAKzD,MAAMr1K,GAAGwK,OACgB,OAA5BsuK,EAAKzD,MAAMr1K,GAAGwK,KAAKxD,MAAiB+xK,EACtCD,EAAKzD,MAAMr1K,GAAGwK,KAAOitK,EAAMuB,IACU,QAA5BF,EAAKzD,MAAMr1K,GAAGwK,KAAKxD,MAAmB+xK,IAC/CD,EAAKzD,MAAMr1K,GAAGwK,KAAOitK,EAAMwB,KAQT,IAAtBH,EAAKzD,MAAMt1K,QAAiB+4K,EAAKr6B,WAG/Bn3I,KAAKgE,IAAIwtK,EAAKzD,MAAM,GAAGI,MAAQnuK,KAAKgD,MAAMwuK,EAAKzD,MAAM,GAAGI,QAAU,QAEpEqD,EAAKzD,MAAM,GAAG7lK,OAASspK,EAAKI,eAIhC,IAAIn4K,EAAQ+3K,EAAKvB,aAAauB,EAAK/3K,OAE/Bma,EAAqB,OAAf49J,EAAK/3K,MAAiB4pI,EAAO5pI,EAAO0b,GAAW,IAAM,GAC3D+hI,EAAUs6B,EAAK9Z,cAWnB,OATI8Z,EAAK/3K,QAAS,EAAAqoH,EAAA,IAAU0vD,EAAK/3K,SAC/Bma,EAAM,IAAMA,EAAM,KAGhBsjI,EAAQz+I,OAAS,GAAKmb,EAAInb,OAAS,IACrCmb,GAAO,KAGTA,EAAOsjI,GAWT1hB,EAAKx6H,UAAU42K,YAAc,WAC3B,GAA0B,IAAtB53K,KAAK+zK,MAAMt1K,OACb,MAAM,IAAI0N,MAAM,4GAGlB,GAAInG,KAAKgE,IAAIhK,KAAK+zK,MAAM,GAAGI,MAAQnuK,KAAKgD,MAAMhJ,KAAK+zK,MAAM,GAAGI,SAAW,MACrE,MAAM,IAAIhoK,MAAM,4GAUlB,IAAI0rK,EAA0B,OAAf73K,KAAKP,MAAiBuK,EAAIhK,KAAKP,OAAS,EACnDq4K,EAAe9tK,EAAIhK,KAAK+zK,MAAM,GAAG7qK,KAAKzJ,OACtCs4K,EAAa/3K,KAAK+zK,MAAM,GAAG7lK,OAE/B,GAAiB,IAAb2pK,EACF,OAAOE,EAGT,IAAI5D,EAAQn0K,KAAK+zK,MAAM,GAAGI,MACtB6D,EAAWhyK,KAAKiF,IAAI4sK,EAAW7xK,KAAK2B,IAAIowK,EAAWt4K,MAAQq4K,EAAc3D,IAAUnuK,KAAKyxF,KAAO,IACnG,GAAIugF,GAAY,UAAYA,EAAW,SAAU,OAAOD,EAExDC,EAAWhyK,KAAKgE,IAAIguK,GACpB,IAAI5B,EAAWp2K,KAAK+zK,MAAM,GAAG7qK,KAAKktK,SAElC,IAAK,IAAItyK,KAAKsyK,EACZ,IAAI,SAAeA,EAAUtyK,GAAI,CAC/B,IAAIoK,EAASkoK,EAAStyK,GAEtB,GAAIoK,EAAO+pK,WAAY,CACrB,IAAIhzJ,EAAOjf,KAAKgE,IAAIhE,KAAKiF,IAAI4sK,EAAW7xK,KAAK2B,IAAIuG,EAAOzO,MAAQq4K,EAAc3D,IAAUnuK,KAAKyxF,KAAO,MAEhGxyE,EAAO+yJ,GAAY/yJ,IAAS+yJ,GAAY9pK,EAAOxI,KAAKjH,OAASs5K,EAAWryK,KAAKjH,UAG/Es5K,EAAa7pK,EACb8pK,EAAW/yJ,IAMnB,OAAO8yJ,GAiBTv8C,EAAKx6H,UAAU8hI,UAAY,SAAUz0C,GAInC,IAHA,IAAI7nF,EAAIxG,KAAKikG,QACTj8F,EAAM,GAEDtJ,EAAI,EAAGA,EAAI2vF,EAAM5vF,SAExB+H,EAAIA,EAAEqnH,GAAGx/B,EAAM3vF,IACXA,IAAM2vF,EAAM5vF,OAAS,GAHOC,IAAK,CAKrC,IAAIw5K,EAAW1xK,EAAEowK,YAGbuB,EAAWnvK,EAAMkvK,GAUjB3wK,EAAI,IAAIi0H,EARQvN,EAAMkqD,EAAUD,GAGzBC,EAEAppD,EAAIvoH,EAAEowK,aAGQvoF,EAAM3vF,GAAG+G,YAClCuC,EAAIxG,KAAK+F,GACTf,EAAI+6F,EAAS/6F,EAAGe,GASlB,IAFA,IAAI6wK,EAAU,EAEL9oB,EAAM,EAAGA,EAAMtnJ,EAAIvJ,OAAQ6wJ,IAClC8oB,EAAUviC,EAAUuiC,EAASpwK,EAAIsnJ,GAAK7vJ,OAQxC,OALIwuH,EAAMmqD,EAASp4K,KAAKP,SACtB+G,EAAE/G,MAAQ,GAGZuI,EAAIxG,KAAKgF,GACFwB,GAGT,IAAIisK,EAAW,CACbC,KAAM,CACJ,GAAI,CACFxuK,KAAM,GACNjG,MAAO,EACPw4K,YAAY,IAGhBI,MAAO,CACL,GAAI,CACF3yK,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdK,GAAI,CACF5yK,KAAM,KACNjG,MAAO,GACPw4K,YAAY,GAEd/7H,EAAG,CACDx2C,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdvxK,EAAG,CACDhB,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdhyE,EAAG,CACDvgG,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdM,EAAG,CACD7yK,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdO,EAAG,CACD9yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj/E,EAAG,CACDtzF,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj5F,EAAG,CACDt5E,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdQ,EAAG,CACD/yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdnxK,EAAG,CACDpB,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdvoK,EAAG,CACDhK,KAAM,IACNjG,MAAO,GACPw4K,YAAY,GAEdvrK,EAAG,CACDhH,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEd7nK,EAAG,CACD1K,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdvvG,EAAG,CACDhjE,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdzyK,EAAG,CACDE,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdn0K,EAAG,CACD4B,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd10J,EAAG,CACD7d,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd12K,EAAG,CACDmE,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEdjpJ,EAAG,CACDtpB,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd1wK,EAAG,CACD7B,KAAM,IACNjG,MAAO,MACPw4K,YAAY,IAGhBS,KAAM,CACJ,GAAI,CACFhzK,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdU,KAAM,CACJjzK,KAAM,OACNjG,MAAO,GACPw4K,YAAY,GAEdW,MAAO,CACLlzK,KAAM,QACNjG,MAAO,IACPw4K,YAAY,GAEdY,KAAM,CACJnzK,KAAM,OACNjG,MAAO,IACPw4K,YAAY,GAEda,KAAM,CACJpzK,KAAM,OACNjG,MAAO,IACPw4K,YAAY,GAEdc,KAAM,CACJrzK,KAAM,OACNjG,MAAO,IACPw4K,YAAY,GAEde,KAAM,CACJtzK,KAAM,OACNjG,MAAO,KACPw4K,YAAY,GAEdgB,KAAM,CACJvzK,KAAM,OACNjG,MAAO,KACPw4K,YAAY,GAEdiB,IAAK,CACHxzK,KAAM,MACNjG,MAAO,KACPw4K,YAAY,GAEdkB,MAAO,CACLzzK,KAAM,QACNjG,MAAO,KACPw4K,YAAY,GAEdmB,MAAO,CACL1zK,KAAM,QACNjG,MAAO,KACPw4K,YAAY,GAEdoB,KAAM,CACJ3zK,KAAM,OACNjG,MAAO,GACPw4K,YAAY,GAEdqB,MAAO,CACL5zK,KAAM,QACNjG,MAAO,IACPw4K,YAAY,GAEdsB,MAAO,CACL7zK,KAAM,QACNjG,MAAO,KACPw4K,YAAY,GAEduB,MAAO,CACL9zK,KAAM,QACNjG,MAAO,KACPw4K,YAAY,GAEdwB,KAAM,CACJ/zK,KAAM,OACNjG,MAAO,KACPw4K,YAAY,GAEdyB,KAAM,CACJh0K,KAAM,OACNjG,MAAO,MACPw4K,YAAY,GAEd0B,MAAO,CACLj0K,KAAM,QACNjG,MAAO,MACPw4K,YAAY,GAEd2B,KAAM,CACJl0K,KAAM,OACNjG,MAAO,MACPw4K,YAAY,GAEd4B,MAAO,CACLn0K,KAAM,QACNjG,MAAO,MACPw4K,YAAY,GAEd6B,MAAO,CACLp0K,KAAM,QACNjG,MAAO,MACPw4K,YAAY,IAGhB8B,QAAS,CACP,GAAI,CACFr0K,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdK,GAAI,CACF5yK,KAAM,KACNjG,MAAO,IACPw4K,YAAY,GAEd/7H,EAAG,CACDx2C,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdvxK,EAAG,CACDhB,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdhyE,EAAG,CACDvgG,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdM,EAAG,CACD7yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdO,EAAG,CACD9yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj/E,EAAG,CACDtzF,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj5F,EAAG,CACDt5E,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdQ,EAAG,CACD/yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdnxK,EAAG,CACDpB,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdvoK,EAAG,CACDhK,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdvrK,EAAG,CACDhH,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEd7nK,EAAG,CACD1K,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdvvG,EAAG,CACDhjE,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEdzyK,EAAG,CACDE,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEdn0K,EAAG,CACD4B,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd10J,EAAG,CACD7d,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd12K,EAAG,CACDmE,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEdjpJ,EAAG,CACDtpB,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd1wK,EAAG,CACD7B,KAAM,IACNjG,MAAO,MACPw4K,YAAY,IAGhB+B,MAAO,CACL,GAAI,CACFt0K,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdK,GAAI,CACF5yK,KAAM,KACNjG,MAAO,IACPw4K,YAAY,GAEd/7H,EAAG,CACDx2C,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdvxK,EAAG,CACDhB,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdhyE,EAAG,CACDvgG,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdM,EAAG,CACD7yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdO,EAAG,CACD9yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj/E,EAAG,CACDtzF,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj5F,EAAG,CACDt5E,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdQ,EAAG,CACD/yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdnxK,EAAG,CACDpB,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdvoK,EAAG,CACDhK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdvrK,EAAG,CACDhH,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEd7nK,EAAG,CACD1K,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdvvG,EAAG,CACDhjE,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEdzyK,EAAG,CACDE,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEdn0K,EAAG,CACD4B,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd10J,EAAG,CACD7d,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd12K,EAAG,CACDmE,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEdjpJ,EAAG,CACDtpB,KAAM,IACNjG,MAAO,MACPw4K,YAAY,GAEd1wK,EAAG,CACD7B,KAAM,IACNjG,MAAO,MACPw4K,YAAY,IAGhBgC,gBAAiB,CACf,GAAI,CACFv0K,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdvxK,EAAG,CACDhB,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdhyE,EAAG,CACDvgG,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdM,EAAG,CACD7yK,KAAM,IACNjG,MAAO,IACPw4K,YAAY,GAEdO,EAAG,CACD9yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj/E,EAAG,CACDtzF,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdj5F,EAAG,CACDt5E,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdQ,EAAG,CACD/yK,KAAM,IACNjG,MAAO,KACPw4K,YAAY,GAEdnxK,EAAG,CACDpB,KAAM,IACNjG,MAAO,KACPw4K,YAAY,IAGhBiC,iBAAkB,CAChB,GAAI,CACFx0K,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdkC,GAAI,CACFz0K,KAAM,KACNjG,MAAO,KACPw4K,YAAY,GAEdmC,GAAI,CACF10K,KAAM,KACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdoC,GAAI,CACF30K,KAAM,KACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdqC,GAAI,CACF50K,KAAM,KACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdxsD,GAAI,CACF/lH,KAAM,KACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdsC,GAAI,CACF70K,KAAM,KACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEduC,GAAI,CACF90K,KAAM,KACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdwC,GAAI,CACF/0K,KAAM,KACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,IAGhByC,eAAgB,CACd,GAAI,CACFh1K,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdY,KAAM,CACJnzK,KAAM,OACNjG,MAAO,IACPw4K,YAAY,GAEda,KAAM,CACJpzK,KAAM,OACNjG,MAAO,IACPw4K,YAAY,GAEdc,KAAM,CACJrzK,KAAM,OACNjG,MAAO,IACPw4K,YAAY,GAEde,KAAM,CACJtzK,KAAM,OACNjG,MAAO,KACPw4K,YAAY,GAEdgB,KAAM,CACJvzK,KAAM,OACNjG,MAAO,KACPw4K,YAAY,GAEdiB,IAAK,CACHxzK,KAAM,MACNjG,MAAO,KACPw4K,YAAY,GAEdkB,MAAO,CACLzzK,KAAM,QACNjG,MAAO,KACPw4K,YAAY,GAEdmB,MAAO,CACL1zK,KAAM,QACNjG,MAAO,KACPw4K,YAAY,IAGhB0C,gBAAiB,CACf,GAAI,CACFj1K,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEd2C,KAAM,CACJl1K,KAAM,OACNjG,MAAO,KACPw4K,YAAY,GAEd4C,KAAM,CACJn1K,KAAM,OACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEd6C,KAAM,CACJp1K,KAAM,OACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEd8C,KAAM,CACJr1K,KAAM,OACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEd+C,KAAM,CACJt1K,KAAM,OACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdgD,IAAK,CACHv1K,KAAM,MACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdiD,KAAM,CACJx1K,KAAM,OACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,GAEdkD,KAAM,CACJz1K,KAAM,OACNjG,MAAOuG,KAAK2B,IAAI,KAAM,GACtBswK,YAAY,IAGhBmD,IAAK,CACH,GAAI,CACF11K,KAAM,GACNjG,MAAO,EACPw4K,YAAY,GAEdoD,GAAI,CACF31K,KAAM,KACNjG,MAAO,IACPw4K,YAAY,KAIlBhE,EAASqH,UAAY,GAAS,GAAIrH,EAASoE,MAAOpE,EAASyE,MAC3DzE,EAASsH,aAAe,GAAS,GAAItH,EAASgG,gBAAiBhG,EAASiG,kBACxEjG,EAASuH,YAAc,GAAS,GAAIvH,EAASyG,eAAgBzG,EAAS0G,iBAiBtE,IAAIvG,EAAkB,CAAC,OAAQ,SAAU,OAAQ,UAAW,cAAe,qBAAsB,sBAAuB,QAAS,OAC7HnrB,EAAa,CACfirB,KAAM,CACJ/5C,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCshD,KAAM,CACJthD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCuhD,OAAQ,CACNvhD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCwhD,KAAM,CACJxhD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCyhD,QAAS,CACPzhD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC0hD,YAAa,CACX1hD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC2hD,mBAAoB,CAClB3hD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC4hD,oBAAqB,CACnB5hD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC6hD,MAAO,CACL7hD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExC8hD,QAAS,CACP9hD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC+hD,OAAQ,CACN/hD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCgiD,OAAQ,CACNhiD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCiiD,MAAO,CACLjiD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCkiD,SAAU,CACRliD,WAAY,CAAC,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCmiD,gBAAiB,CACfniD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCoiD,qBAAsB,CACpBpiD,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCqiD,mBAAoB,CAClBriD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCsiD,oBAAqB,CACnBtiD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCuiD,oBAAqB,CACnBviD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCwiD,qBAAsB,CACpBxiD,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCyiD,cAAe,CACbziD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC0iD,sBAAuB,CACrB1iD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC2iD,UAAW,CACT3iD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExC+uB,MAAO,CACL/uB,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC4iD,IAAK,CACH5iD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAIzC,IAAK,IAAI76H,KAAO2pJ,GACV,SAAeA,EAAY3pJ,KAC7B2pJ,EAAW3pJ,GAAKA,IAAMA,GAI1B,IACI00K,EAAY,CACdtuK,KAAM,GACN5C,KAHmB,GAInBrD,MAAO,EACPqgB,OAAQ,EACRq6G,WAAYi6C,EAAgB9sK,KAAId,GAAK,KAEnC2vK,EAAQ,CAEV6G,MAAO,CACLt3K,KAAM,QACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEVm9J,KAAM,CACJv3K,KAAM,OACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEVo9J,KAAM,CACJx3K,KAAM,OACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEVq9J,KAAM,CACJz3K,KAAM,OACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEVs9J,KAAM,CACJ13K,KAAM,OACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAEVkoB,KAAM,CACJtiC,KAAM,OACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEVu9J,IAAK,CACH33K,KAAM,MACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,OACPqgB,OAAQ,GAEV01H,MAAO,CACL9vI,KAAM,QACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEVw9J,SAAU,CACR53K,KAAM,WACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEV1P,EAAG,CACD1K,KAAM,IACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEVu9G,GAAI,CACF33H,KAAM,KACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEVy9J,GAAI,CACF73K,KAAM,KACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEVy6E,GAAI,CACF70F,KAAM,KACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEV09J,GAAI,CACF93K,KAAM,KACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAEV29J,GAAI,CACF/3K,KAAM,KACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEV25E,GAAI,CACF/zF,KAAM,KACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEV49J,GAAI,CACFh4K,KAAM,KACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEV69J,IAAK,CACHj4K,KAAM,MACN5C,KAAMmmJ,EAAWyyB,OACjBtF,SAAUnC,EAASC,KACnBz0K,MAAO,OACPqgB,OAAQ,GAIVyE,GAAI,CACF7e,KAAM,KACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAAS8F,QACnBt6K,MAAO,EACPqgB,OAAQ,GAEV89J,KAAM,CACJl4K,KAAM,OACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAGV+9J,KAAM,CACJn4K,KAAM,OACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,UACPqgB,OAAQ,GAGVg+J,KAAM,CACJp4K,KAAM,OACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,UACPqgB,OAAQ,GAGVi+J,KAAM,CACJr4K,KAAM,OACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,eACPqgB,OAAQ,GAGVk+J,KAAM,CACJt4K,KAAM,OACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAGVm+J,KAAM,CACJv4K,KAAM,OACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAGVo+J,MAAO,CACLx4K,KAAM,QACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,WACPqgB,OAAQ,GAGVq+J,KAAM,CACJz4K,KAAM,OACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAGVs+J,QAAS,CACP14K,KAAM,UACN5C,KAAMmmJ,EAAWgzB,QACjB7F,SAAUnC,EAASC,KACnBz0K,MAAO,IACPqgB,OAAQ,GAIVu+J,GAAI,CACF34K,KAAM,KACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAAS+F,MACnBv6K,MAAO,EACPqgB,OAAQ,GAEV+lJ,EAAG,CACDngK,KAAM,IACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASoE,MACnB54K,MAAO,KACPqgB,OAAQ,GAGVgrB,EAAG,CACDplC,KAAM,IACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASoE,MACnB54K,MAAO,KACPqgB,OAAQ,GAGVw+J,MAAO,CACL54K,KAAM,QACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASyE,KACnBj5K,MAAO,KACPqgB,OAAQ,GAEVy+J,KAAM,CACJ74K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,aACPqgB,OAAQ,GAGV0+J,KAAM,CACJ94K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,cACPqgB,OAAQ,GAGV2+J,KAAM,CACJ/4K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,cACPqgB,OAAQ,GAGV4+J,SAAU,CACRh5K,KAAM,WACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAGV6+J,WAAY,CACVj5K,KAAM,aACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAIV8+J,KAAM,CACJl5K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAGV++J,IAAK,CACHn5K,KAAM,MACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAIVg/J,MAAO,CACLp5K,KAAM,QACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGVi/J,UAAW,CACTr5K,KAAM,YACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,aACPqgB,OAAQ,GAGVk/J,WAAY,CACVt5K,KAAM,aACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGVm/J,KAAM,CACJv5K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGV2rE,GAAI,CACF/lF,KAAM,KACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAGVo/J,IAAK,CACHx5K,KAAM,MACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGVq/J,KAAM,CACJz5K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGVs/J,MAAO,CACL15K,KAAM,QACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGVu/J,OAAQ,CACN35K,KAAM,SACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,WACPqgB,OAAQ,GAGVw/J,WAAY,CACV55K,KAAM,aACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAGVy/J,UAAW,CACT75K,KAAM,YACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAGV0/J,SAAU,CACR95K,KAAM,WACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAIV2/J,KAAM,CACJ/5K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,aACPqgB,OAAQ,GAGV4/J,KAAM,CACJh6K,KAAM,OACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGV6/J,GAAI,CACFj6K,KAAM,KACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGVosJ,GAAI,CACFxmK,KAAM,KACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGVqD,GAAI,CACFzd,KAAM,KACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGV8/J,GAAI,CACFl6K,KAAM,KACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAGV+/J,IAAK,CACHn6K,KAAM,MACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,WACPqgB,OAAQ,GAGVggK,IAAK,CACHp6K,KAAM,MACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAGVigK,IAAK,CACHr6K,KAAM,MACN5C,KAAMmmJ,EAAWizB,OACjB9F,SAAUnC,EAASC,KACnBz0K,MAAO,SACPqgB,OAAQ,GAKVuvC,EAAG,CACD3pD,KAAM,IACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASoE,MACnB54K,MAAO,KACPqgB,OAAQ,GAEVkgK,KAAM,CACJt6K,KAAM,OACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASyE,KACnBj5K,MAAO,KACPqgB,OAAQ,GAEVmgK,IAAK,CACHv6K,KAAM,MACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASoE,MACnB54K,MAAO,UACPqgB,OAAQ,GAEViK,EAAG,CACDrkB,KAAM,IACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASoE,MACnB54K,MAAO,IACPqgB,OAAQ,GAEVogK,MAAO,CACLx6K,KAAM,QACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASyE,KACnBj5K,MAAO,IACPqgB,OAAQ,GAEVqgK,MAAO,CACLz6K,KAAM,QACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAEVsgK,KAAM,CACJ16K,KAAM,OACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,kBACPqgB,OAAQ,GAEVugK,MAAO,CACL36K,KAAM,QACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,cACPqgB,OAAQ,GAEVwgK,UAAW,CACT56K,KAAM,YACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,UACPqgB,OAAQ,GAEVygK,cAAe,CACb76K,KAAM,gBACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,UACPqgB,OAAQ,GAEV0gK,MAAO,CACL96K,KAAM,QACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAEV2gK,MAAO,CACL/6K,KAAM,QACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,WACPqgB,OAAQ,GAEV4gK,GAAI,CACFh7K,KAAM,KACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,YACPqgB,OAAQ,GAEV6gK,GAAI,CACFj7K,KAAM,KACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,kBACPqgB,OAAQ,GAEV8gK,GAAI,CACFl7K,KAAM,KACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,cACPqgB,OAAQ,GAEV+gK,IAAK,CACHn7K,KAAM,MACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,UACPqgB,OAAQ,GAEVghK,IAAK,CACHp7K,KAAM,MACN5C,KAAMmmJ,EAAWwyB,KACjBrF,SAAUnC,EAASC,KACnBz0K,MAAO,UACPqgB,OAAQ,GAGVimB,EAAG,CACDrgC,KAAM,IACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEV0S,IAAK,CACH9sB,KAAM,MACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,GACPqgB,OAAQ,GAEVo8B,EAAG,CACDx2C,KAAM,IACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAEVihK,OAAQ,CACNr7K,KAAM,SACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEV8wG,IAAK,CACHlrH,KAAM,MACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEVkhK,OAAQ,CACNt7K,KAAM,SACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,GACPqgB,OAAQ,GAEVmhK,KAAM,CACJv7K,KAAM,OACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAEVohK,IAAK,CACHx7K,KAAM,MACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,MACPqgB,OAAQ,GAEVqhK,KAAM,CACJz7K,KAAM,OACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,OACPqgB,OAAQ,GAEVshK,MAAO,CACL17K,KAAM,QACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,QAEPqgB,OAAQ,GAEVuhK,KAAM,CACJ37K,KAAM,OACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,SAEPqgB,OAAQ,GAEVwhK,OAAQ,CACN57K,KAAM,SACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,SAEPqgB,OAAQ,GAEVyhK,QAAS,CACP77K,KAAM,UACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,SAEPqgB,OAAQ,GAEV0hK,WAAY,CACV97K,KAAM,aACN5C,KAAMmmJ,EAAW0yB,KACjBvF,SAAUnC,EAASC,KACnBz0K,MAAO,SAEPqgB,OAAQ,GAGV2hK,MAAO,CACL/7K,KAAM,QACN5C,KAAMmmJ,EAAW6zB,UACjB1G,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,EACR4hK,YAAY,GAEdC,GAAI,CACFj8K,KAAM,KACN5C,KAAMmmJ,EAAW6zB,UACjB1G,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,EACR4hK,YAAY,GAGdE,IAAK,CACHl8K,KAAM,MACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEV+hK,OAAQ,CACNn8K,KAAM,SACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAGVqxG,IAAK,CACHzrH,KAAM,MACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASoE,MACnB54K,MAAO,KAEPqgB,OAAQ,GAEV43I,OAAQ,CACNhyJ,KAAM,SACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASyE,KACnBj5K,MAAO,KAEPqgB,OAAQ,GAGVhL,KAAM,CACJpP,KAAM,OACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASoE,MACnB54K,MAAO,KAEPqgB,OAAQ,GAEVgiK,QAAS,CACPp8K,KAAM,UACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASyE,KACnBj5K,MAAO,KAEPqgB,OAAQ,GAGViiK,MAAO,CACLr8K,KAAM,QACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASC,KACnBz0K,MAAO,KAEPqgB,OAAQ,GAGVkiK,OAAQ,CACNt8K,KAAM,SACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASC,KACnBz0K,MAAO,KAEPqgB,OAAQ,GAGVmiK,OAAQ,CACNv8K,KAAM,SACN5C,KAAMmmJ,EAAWC,MACjBktB,SAAUnC,EAASC,KACnBz0K,MAAO,KAEPqgB,OAAQ,GAGVomF,EAAG,CACDxgG,KAAM,IACN5C,KAAMmmJ,EAAW2yB,QACjBxF,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEVoiK,OAAQ,CACNx8K,KAAM,SACN5C,KAAMmmJ,EAAW2yB,QACjBxF,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAMVqiK,EAAG,CACDz8K,KAAM,IACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EACPqgB,OAAQ,GAEVsiK,KAAM,CACJ18K,KAAM,OACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EACPqgB,OAAQ,QAEVuiK,KAAM,CACJ38K,KAAM,OACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EAAI,IACXqgB,OAAQ,QAEVwiK,KAAM,CACJ58K,KAAM,OACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EAAI,IACXqgB,OAAQ,GAEVyiK,OAAQ,CACN78K,KAAM,SACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EACPqgB,OAAQ,GAEV0iK,QAAS,CACP98K,KAAM,UACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EACPqgB,OAAQ,QAEV2iK,WAAY,CACV/8K,KAAM,aACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EAAI,IACXqgB,OAAQ,QAEV4iK,QAAS,CACPh9K,KAAM,UACN5C,KAAMmmJ,EAAW4yB,YACjBzF,SAAUnC,EAASC,KACnBz0K,MAAO,EAAI,IACXqgB,OAAQ,GAGV6iK,IAAK,CACHj9K,KAAM,MACN5C,KAAMmmJ,EAAW8yB,oBACjB3F,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEV8iK,KAAM,CACJl9K,KAAM,OACN5C,KAAMmmJ,EAAW8yB,oBACjB3F,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAGV+iK,GAAI,CACFn9K,KAAM,KACN5C,KAAMmmJ,EAAW6yB,mBACjB1F,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEVgjK,QAAS,CACPp9K,KAAM,UACN5C,KAAMmmJ,EAAW6yB,mBACjB1F,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAMVwmF,EAAG,CACD5gG,KAAM,IACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEVijK,OAAQ,CACNr9K,KAAM,SACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEVkjK,IAAK,CACHt9K,KAAM,MACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASoE,MACnB54K,MAAO,KACPqgB,OAAQ,GAEVmjK,KAAM,CACJv9K,KAAM,OACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASyE,KACnBj5K,MAAO,KACPqgB,OAAQ,GAEVojK,IAAK,CACHx9K,KAAM,MACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASC,KACnBz0K,MAAO,gBACPqgB,OAAQ,GAEVqjK,WAAY,CACVz9K,KAAM,aACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASC,KACnBz0K,MAAO,gBACPqgB,OAAQ,GAEVsjK,IAAK,CACH19K,KAAM,MACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASyE,KACnBj5K,MAAO,UACPqgB,OAAQ,GAEVujK,cAAe,CACb39K,KAAM,gBACN5C,KAAMmmJ,EAAW+yB,MACjB5F,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAGVy5I,EAAG,CACD7zJ,KAAM,IACN5C,KAAMmmJ,EAAWkzB,OACjB/F,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEVwjK,MAAO,CACL59K,KAAM,QACN5C,KAAMmmJ,EAAWkzB,OACjB/F,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEVyjK,IAAK,CACH79K,KAAM,MACN5C,KAAMmmJ,EAAWkzB,OACjB/F,SAAUnC,EAASC,KACnBz0K,MAAO,KACPqgB,OAAQ,GAEV0jK,GAAI,CACF99K,KAAM,KACN5C,KAAMmmJ,EAAWkzB,OACjB/F,SAAUnC,EAASoE,MACnB54K,MAAO,KACPqgB,OAAQ,GAEVs7J,IAAK,CACH11K,KAAM,MACN5C,KAAMmmJ,EAAWkzB,OACjB/F,SAAUnC,EAASmH,IACnB37K,MAAO,cACPqgB,OAAQ,GAEV2jK,GAAI,CACF/9K,KAAM,KACN5C,KAAMmmJ,EAAWkzB,OACjB/F,SAAUnC,EAASoE,MACnB54K,MAAO,eACPqgB,OAAQ,GAEV4jK,aAAc,CACZh+K,KAAM,eACN5C,KAAMmmJ,EAAWkzB,OACjB/F,SAAUnC,EAASyE,KACnBj5K,MAAO,eACPqgB,OAAQ,GAGV6pJ,EAAG,CACDjkK,KAAM,IACN5C,KAAMmmJ,EAAWmzB,MACjBhG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEV6jK,KAAM,CACJj+K,KAAM,OACN5C,KAAMmmJ,EAAWmzB,MACjBhG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEV8jK,GAAI,CACFl+K,KAAM,KACN5C,KAAMmmJ,EAAWmzB,MACjBhG,SAAUnC,EAASC,KACnBz0K,MAAO,eACPqgB,OAAQ,GAGV43J,IAAK,CACHhyK,KAAM,MACN5C,KAAMmmJ,EAAWmzB,MACjBhG,SAAUnC,EAASoE,MACnB54K,MAAOi+E,EAAQy7D,EACfr5H,OAAQ,GAEV63J,GAAI,CACFjyK,KAAM,KACN5C,KAAMmmJ,EAAWmzB,MACjBhG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGV+jK,GAAI,CACFn+K,KAAM,KACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAEV6sG,IAAK,CACHjnH,KAAM,MACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASC,KACnBz0K,MAAO,iBACPqgB,OAAQ,GAEVgkK,IAAK,CACHp+K,KAAM,MACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASC,KACnBz0K,MAAO,OACPqgB,OAAQ,GAEVizD,IAAK,CACHrtE,KAAM,MACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASqH,UACnB77K,MAAO,IACPqgB,OAAQ,GAEVikK,KAAM,CACJr+K,KAAM,OACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEVkkK,KAAM,CACJt+K,KAAM,OACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEVmkK,MAAO,CACLv+K,KAAM,QACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAEVokK,MAAO,CACLx+K,KAAM,QACN5C,KAAMmmJ,EAAWozB,SACjBjG,SAAUnC,EAASC,KACnBz0K,MAAO,QACPqgB,OAAQ,GAGV6jH,QAAS,CACPj+H,KAAM,UACN5C,KAAMmmJ,EAAWqzB,gBACjBlG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEVsmF,EAAG,CACD1gG,KAAM,IACN5C,KAAMmmJ,EAAWqzB,gBACjBlG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGVqkK,MAAO,CACLz+K,KAAM,QACN5C,KAAMmmJ,EAAWszB,qBACjBnG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEVskK,EAAG,CACD1+K,KAAM,IACN5C,KAAMmmJ,EAAWszB,qBACjBnG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGVukK,KAAM,CACJ3+K,KAAM,OACN5C,KAAMmmJ,EAAWuzB,mBACjBpG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEVwkK,EAAG,CACD5+K,KAAM,IACN5C,KAAMmmJ,EAAWuzB,mBACjBpG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGVykK,IAAK,CACH7+K,KAAM,MACN5C,KAAMmmJ,EAAWwzB,oBACjBrG,SAAUnC,EAASqH,UAEnB77K,MAAO,EACPqgB,OAAQ,GAcV0kK,MAAO,CACL9+K,KAAM,QACN5C,KAAMmmJ,EAAWyzB,oBACjBtG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEV2kK,EAAG,CACD/+K,KAAM,IACN5C,KAAMmmJ,EAAWyzB,oBACjBtG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGV4kK,QAAS,CACPh/K,KAAM,UACN5C,KAAMmmJ,EAAW0zB,qBACjBvG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEV6kK,EAAG,CACDj/K,KAAM,IACN5C,KAAMmmJ,EAAW0zB,qBACjBvG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGV8kK,MAAO,CACLl/K,KAAM,QACN5C,KAAMmmJ,EAAW2zB,cACjBxG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEV+kK,GAAI,CACFn/K,KAAM,KACN5C,KAAMmmJ,EAAW2zB,cACjBxG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGVglK,MAAO,CACLp/K,KAAM,QACN5C,KAAMmmJ,EAAW4zB,sBACjBzG,SAAUnC,EAASyE,KACnBj5K,MAAO,EACPqgB,OAAQ,GAEV04J,EAAG,CACD9yK,KAAM,IACN5C,KAAMmmJ,EAAW4zB,sBACjBzG,SAAUnC,EAASoE,MACnB54K,MAAO,EACPqgB,OAAQ,GAGVpY,EAAG,CACDhC,KAAM,IACN5C,KAAMmmJ,EAAW8zB,IACjB3G,SAAUnC,EAASsH,aACnB97K,MAAO,EACPqgB,OAAQ,GAEVilK,KAAM,CACJr/K,KAAM,OACN5C,KAAMmmJ,EAAW8zB,IACjB3G,SAAUnC,EAASuH,YACnB/7K,MAAO,EACPqgB,OAAQ,GAEVqmF,EAAG,CACDzgG,KAAM,IACN5C,KAAMmmJ,EAAW8zB,IACjB3G,SAAUnC,EAASsH,aACnB97K,MAAO,EACPqgB,OAAQ,GAEVklK,MAAO,CACLt/K,KAAM,QACN5C,KAAMmmJ,EAAW8zB,IACjB3G,SAAUnC,EAASuH,YACnB/7K,MAAO,EACPqgB,OAAQ,IAIRmlK,EAAU,CACZC,OAAQ,QACRC,OAAQ,OACRC,KAAM,OACNC,MAAO,OACPC,MAAO,OACPC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,UAAW,WACXvnF,GAAI,IACJwnF,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,MACNC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,MAAO,OACPC,OAAQ,QACRC,YAAa,YACbC,eAAgB,gBAChBC,OAAQ,QACRC,GAAI,MACJC,IAAK,MACLC,KAAM,MACNC,IAAK,gBACLC,MAAO,OACPC,SAAU,UACVC,OAAQ,OACRC,OAAQ,OACRC,OAAQ,OACRC,QAAS,OACTC,KAAM,OACNC,MAAO,QACPC,MAAO,QACPC,QAAS,SACTC,KAAM,SACNC,QAAS,SACTC,KAAM,SACNC,MAAO,OACP13G,GAAI,OACJ23G,IAAK,OACLC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,MAAO,OACPC,QAAS,SACTC,UAAW,UACXC,UAAW,aACXrH,MAAO,QACPsH,QAAS,SACTC,QAAS,SACTC,SAAU,UACVC,OAAQ,QACRC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,WAAY,SACZC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,QAAS,SACTC,SAAU,UACVC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,OAAQ,QACRC,cAAe,eACfC,MAAO,OACPC,IAAK,OACLC,KAAM,SAQR,SAASC,EAAqBzhK,GAC5B,GAAsB,cAAlBA,EAAOjgB,OAAwB,CACjC,IAAI86F,EAAK,EAAS8/C,GAClB4yB,EAAMyL,IAAIniL,MAAQ,IAAI8jJ,EAAW,GACjC4yB,EAAMhlD,IAAI1xH,MAAQgkG,EAAG5H,IAAI,KAEzBs6E,EAAMrhK,KAAKrV,MAAQgkG,EAAG5H,IAAI,KAE1Bs6E,EAAM4L,MAAMtiL,MAAQgkG,EAAG7tF,MAAM,GAE7BugK,EAAM6L,OAAOviL,MAAQgkG,EAAG5H,IAAI,OAE5Bs6E,EAAM8L,OAAOxiL,MAAQgkG,EAAG5H,IAAI,YAG5Bs6E,EAAMyL,IAAIniL,MAAQ,EAClB02K,EAAMhlD,IAAI1xH,MAAQuG,KAAKsO,GAAK,IAE5B6hK,EAAMrhK,KAAKrV,MAAQuG,KAAKsO,GAAK,IAE7B6hK,EAAM4L,MAAMtiL,MAAkB,EAAVuG,KAAKsO,GAEzB6hK,EAAM6L,OAAOviL,MAAQuG,KAAKsO,GAAK,MAE/B6hK,EAAM8L,OAAOxiL,MAAQuG,KAAKsO,GAAK,MAIjC6hK,EAAM0L,OAAOpiL,MAAQ02K,EAAMyL,IAAIniL,MAC/B02K,EAAMze,OAAOj4J,MAAQ02K,EAAMhlD,IAAI1xH,MAC/B02K,EAAM2L,QAAQriL,MAAQ02K,EAAMrhK,KAAKrV,MAInC4qL,EAAqBzhK,GAEjBV,GAEFA,EAAG,UAAU,SAAUw4D,EAAMD,GACvBC,EAAK/3E,SAAW83E,EAAK93E,QACvB0hL,EAAqB3pG,MAW3B,IAAI80F,EAAe,CACjB2B,GAAI,CAEFjD,KAAM,CACJhrK,KAAM8qK,EACN9lK,OAAQ+lK,EAASC,KAAK,KAExBwH,OAAQ,CACNxyK,KAAMitK,EAAM/lK,EACZlC,OAAQ+lK,EAASoE,MAAM,KAEzBoD,KAAM,CACJvyK,KAAMitK,EAAM9mH,EACZnhD,OAAQ+lK,EAASoE,MAAM3xK,GAEzBi1K,KAAM,CACJzyK,KAAMitK,EAAMpwI,EACZ73B,OAAQ+lK,EAASoE,MAAM,KAEzBuD,QAAS,CACP1yK,KAAMitK,EAAMjwE,EACZh4F,OAAQ+lK,EAASoE,MAAM,KAEzBwD,YAAa,CACX3yK,KAAMitK,EAAMgM,EACZj0K,OAAQ+lK,EAASoE,MAAM,KAEzByD,mBAAoB,CAClB5yK,KAAMitK,EAAM0M,GACZ30K,OAAQ+lK,EAASoE,MAAM,KAEzB0D,oBAAqB,CACnB7yK,KAAMitK,EAAMwM,IACZz0K,OAAQ+lK,EAASoE,MAAM,KAEzBnvB,MAAO,CACLhgJ,KAAMitK,EAAMyL,IACZ1zK,OAAQ+lK,EAASoE,MAAM,KAEzB0E,IAAK,CACH7zK,KAAMitK,EAAM4O,KACZ72K,OAAQ+lK,EAASoE,MAAM,KAGzB2D,MAAO,CACL9yK,KAAMitK,EAAM7vE,EACZp4F,OAAQ+lK,EAASoE,MAAM,KAEzB8D,OAAQ,CACNjzK,KAAMitK,EAAM5c,EACZrrJ,OAAQ+lK,EAASoE,MAAM,KAEzB+D,MAAO,CACLlzK,KAAMitK,EAAMxM,EACZz7J,OAAQ+lK,EAASoE,MAAM,KAEzBgE,SAAU,CACRnzK,KAAMitK,EAAM0N,GACZ31K,OAAQ+lK,EAASoE,MAAM,KAEzBiE,gBAAiB,CACfpzK,KAAMitK,EAAM/vE,EACZl4F,OAAQ+lK,EAASoE,MAAM,KAEzBkE,qBAAsB,CACpBrzK,KAAMitK,EAAMiO,EACZl2K,OAAQ+lK,EAASoE,MAAM,KAEzBmE,mBAAoB,CAClBtzK,KAAMitK,EAAMmO,EACZp2K,OAAQ+lK,EAASoE,MAAM,KAEzBoE,oBAAqB,CACnBvzK,KAAMitK,EAAMoO,IACZr2K,OAAQ+lK,EAASoE,MAAM,KAEzBqE,oBAAqB,CACnBxzK,KAAMitK,EAAMsO,EACZv2K,OAAQ+lK,EAASoE,MAAM,KAEzBsE,qBAAsB,CACpBzzK,KAAMitK,EAAMwO,EACZz2K,OAAQ+lK,EAASoE,MAAM,KAEzBuE,cAAe,CACb1zK,KAAMitK,EAAM0O,GACZ32K,OAAQ+lK,EAASoE,MAAM,KAEzBwE,sBAAuB,CACrB3zK,KAAMitK,EAAMqC,EACZtqK,OAAQ+lK,EAASoE,MAAM,KAEzByE,UAAW,CACT5zK,KAAMitK,EAAMwL,GACZzzK,OAAQ+lK,EAASoE,MAAM,OAK7B7C,EAAa8U,IAAM1+K,KAAKsR,MAAMtR,KAAKC,UAAU2pK,EAAa2B,KAC1D3B,EAAa8U,IAAI5O,OAAS,CACxBxyK,KAAMitK,EAAM/lK,EACZlC,OAAQ+lK,EAASoE,MAAM3rK,GAEzB8oK,EAAa8U,IAAI7O,KAAO,CACtBvyK,KAAMitK,EAAM9mH,EACZnhD,OAAQ+lK,EAASoE,MAAM,KAEzB7C,EAAa8U,IAAItO,MAAQ,CACvB9yK,KAAMitK,EAAM6M,IACZ90K,OAAQ+lK,EAASoE,MAAM,KAEzB7C,EAAa8U,IAAInO,OAAS,CACxBjzK,KAAMitK,EAAMoN,IACZr1K,OAAQ+lK,EAASC,KAAK,KAIxBsB,EAAa+U,GAAK3+K,KAAKsR,MAAMtR,KAAKC,UAAU2pK,EAAa2B,KACzD3B,EAAa+U,GAAG7O,OAAS,CACvBxyK,KAAMitK,EAAMoH,GACZrvK,OAAQ+lK,EAASC,KAAK,KAExBsB,EAAa+U,GAAG9O,KAAO,CACrBvyK,KAAMitK,EAAM0K,IACZ3yK,OAAQ+lK,EAASC,KAAK,KAExBsB,EAAa+U,GAAG1O,YAAc,CAC5B3yK,KAAMitK,EAAMkM,KACZn0K,OAAQ+lK,EAASC,KAAK,KAExBsB,EAAa+U,GAAGvO,MAAQ,CACtB9yK,KAAMitK,EAAM+M,IACZh1K,OAAQ+lK,EAASC,KAAK,KAExBsB,EAAa+U,GAAGpO,OAAS,CACvBjzK,KAAMitK,EAAMiF,IACZltK,OAAQ+lK,EAASmH,IAAI,KAEvB5F,EAAa+U,GAAGnO,MAAQ,CACtBlzK,KAAMitK,EAAMyN,GACZ11K,OAAQ+lK,EAASC,KAAK,KAExBsB,EAAa+U,GAAGlO,SAAW,CACzBnzK,KAAMitK,EAAMxpD,IACZz+G,OAAQ+lK,EAASC,KAAK,KAIxBsB,EAAaC,KAAO7pK,KAAKsR,MAAMtR,KAAKC,UAAU2pK,EAAa2B,KAE3D,IAAIH,EAAoBxB,EAAaC,KAkErC,IAAK,IAAI+U,KA5DThvD,EAAKivD,cAAgB,SAAU/kL,GAC7B,KAAI,SAAe8vK,EAAc9vK,GAG/B,MAAM,IAAIyG,MAAM,eAAiBzG,EAAO,iCAAmCvD,OAAOsE,KAAK+uK,GAAcpkJ,KAAK,OAF1G4lJ,EAAoBxB,EAAa9vK,IAWrC81H,EAAKkvD,cAAgB,WACnB,IAAK,IAAIz4D,KAAQujD,EACf,IAAI,SAAeA,EAAcvjD,IAC3BujD,EAAavjD,KAAU+kD,EACzB,OAAO/kD,GAWfuJ,EAAKmvD,eAAiB,CACpB9+C,UAAW,SAAmBrlI,GAC5B,OAAO,IAAI+8I,EAAW/8I,EAAI,KAE5Bs/F,SAAU,SAAkBt/F,GAC1B,OAAO,IAAIg9I,EAAUh9I,IAEvBk3E,QAAS,SAAiBl3E,GACxB,OAAOA,GAETmC,OAAQ,SAAgBnC,GACtB,OAAOA,IAYXg1H,EAAKw6C,oBAAsB,SAAUl+J,GACnC,IAAK0jH,EAAKmvD,eAAe7yK,GACvB,MAAM,IAAIrX,UAAU,qBAAuBqX,EAAO,KAGpD,OAAO0jH,EAAKmvD,eAAe7yK,IAIXq+J,EAChB,IAAI,SAAeA,EAAOqU,GAAQ,CAChC,IAAIthL,EAAOitK,EAAMqU,GACjBthL,EAAKixH,WAAajxH,EAAKpG,KAAKq3H,WAKhC,IAAK,IAAIywD,KAAU3F,EACjB,IAAI,SAAeA,EAAS2F,GAAS,CACnC,IAAIC,EAAS1U,EAAM8O,EAAQ2F,IACvBE,EAAQ,GAEZ,IAAK,IAAIC,KAASF,GACZ,SAAeA,EAAQE,KACzBD,EAAMC,GAASF,EAAOE,IAI1BD,EAAMplL,KAAOklL,EACbzU,EAAMyU,GAAUE,EAgTpB,OAtSAtvD,EAAKo5C,aAAe,SAAsBloK,GACxC,MAAO,aAAa/G,KAAK+G,IAoC3B8uH,EAAKoH,WAAa,SAAUngI,EAAK0Y,GAC/B,GAAmB,iBAAR1Y,EACT,MAAM,IAAIhC,UAAU,6DAItB,GAAI0a,GAAWA,EAAQ6vK,SACrB,IAAK,IAAIC,KAASxoL,EAKhB,IAJI,SAAeA,EAAKwoL,IACtBzvD,EAAK0vD,WAAWD,GAGdxoL,EAAIwoL,GAAOE,QACb,IAAK,IAAIzsL,EAAI,EAAGA,EAAI+D,EAAIwoL,GAAOE,QAAQ1sL,OAAQC,IAC7C88H,EAAK0vD,WAAWzoL,EAAIwoL,GAAOE,QAAQzsL,IAO3C,IAAI0sL,EAEJ,IAAK,IAAIC,KAAS5oL,GACZ,SAAeA,EAAK4oL,KACtBD,EAAW5vD,EAAK8vD,iBAAiBD,EAAO5oL,EAAI4oL,KAIhD,OAAOD,GAgCT5vD,EAAK8vD,iBAAmB,SAAU5lL,EAAMjD,EAAK0Y,GAK3C,GAJI,MAAO1Y,IACTA,EAAM,IAGY,iBAATiD,EACT,MAAM,IAAIjF,UAAU,mEAItB,IAAI,SAAe01K,EAAOzwK,GACxB,MAAM,IAAIyG,MAAM,uBAAyBzG,EAAO,4CAzGpD,SAA+BA,GAC7B,IAAK,IAAIhH,EAAI,EAAGA,EAAIgH,EAAKjH,OAAQC,IAAK,CAGpC,GAFAgO,EAAIhH,EAAKq0F,OAAOr7F,GAEN,IAANA,IAAY88H,EAAKo5C,aAAaloK,GAChC,MAAM,IAAIP,MAAM,yDAA2DzG,EAAO,KAGpF,GAAIhH,EAAI,IAAO88H,EAAKo5C,aAAaloK,KAAM8xH,EAAQ9xH,GAC7C,MAAM,IAAIP,MAAM,kEAAoEzG,EAAO,MAoG/F6lL,CAAsB7lL,GACtB,IAIIi0D,EACAy8G,EACAoV,EANAC,EAAU,KAEVN,EAAU,GACVrrK,EAAS,EAKb,GAAIrd,GAAoB,SAAbA,EAAIqV,KACb2zK,EAAUhpL,EAAIwhG,aACT,GAAmB,iBAARxhG,EACJ,KAARA,IACFk3D,EAAal3D,OAEV,IAAmB,iBAARA,EAUhB,MAAM,IAAIhC,UAAU,uBAAyBiF,EAAO,WAAajD,EAAIgD,WAAa,+CATlFk0D,EAAal3D,EAAIk3D,WACjBy8G,EAAW3zK,EAAI2zK,SACft2J,EAASrd,EAAIqd,OACb0rK,EAAW/oL,EAAI+oL,SAEX/oL,EAAI0oL,UACNA,EAAU1oL,EAAI0oL,QAAQlqL,WAM1B,GAAIkqL,EACF,IAAK,IAAIzsL,EAAI,EAAGA,EAAIysL,EAAQ1sL,OAAQC,IAClC,IAAI,SAAey3K,EAAOgV,EAAQzsL,IAChC,MAAM,IAAIyN,MAAM,wBAA0Bg/K,EAAQzsL,GAAK,2CAK7D,GAAIi7D,GAAoC,iBAAfA,IAA4B8xH,EACnD,IACEA,EAAUjwD,EAAKt+G,MAAMy8C,EAAY,CAC/B+7G,cAAc,IAEhB,MAAOt4G,GAEP,MADAA,EAAG13C,QAAU,0BAA4BhgB,EAAO,WAAai0D,EAAa,MAAQyD,EAAG13C,QAC/E03C,OAECzD,GAAkC,SAApBA,EAAW7hD,OAClC2zK,EAAU9xH,EAAWsqC,SAGvBknF,EAAUA,GAAW,GACrBrrK,EAASA,GAAU,EAGjBs2J,EADEA,GAAYA,EAAS9vK,aACZ2tK,EAASmC,EAAS9vK,gBAElB2tK,EAASC,KAKtB,IAAIwX,EAAU,GAEd,GAAKD,EAwCE,CACLC,EAAU,CACRhmL,KAAMA,EACNjG,MAAOgsL,EAAQhsL,MACf06H,WAAYsxD,EAAQtxD,WAAWr1H,MAAM,GACrCsxK,SAAUA,EACVt2J,OAAQA,GAGV,IAAI6rK,GAAW,EAEf,IAAK,IAAIn8B,KAAOvG,EACd,IAAI,SAAeA,EAAYuG,GAAM,CAGnC,IAFA,IAAI5xE,GAAQ,EAEHp2E,EAAI,EAAGA,EAAI4sK,EAAgB31K,OAAQ+I,IAC1C,GAAIxB,KAAKgE,KAAK0hL,EAAQvxD,WAAW3yH,IAAM,IAAMyhJ,EAAWuG,GAAKr1B,WAAW3yH,IAAM,IAAM,MAAO,CACzFo2E,GAAQ,EACR,MAIJ,GAAIA,EAAO,CACT+tG,GAAW,EACXD,EAAQ5oL,KAAOmmJ,EAAWuG,GAC1B,OAKN,IAAKm8B,EAAU,CACbH,EAAWA,GAAY9lL,EAAO,SAG9B,IAAIkmL,EAAe,CACjBzxD,WAAYsxD,EAAQtxD,WAAWr1H,MAAM,IAEvC8mL,EAAatsL,IAAMksL,EACnBviC,EAAWuiC,GAAYI,EACvB5U,EAAkBwU,GAAY,CAC5BtiL,KAAMwiL,EACNx9K,OAAQ+lK,EAASC,KAAK,KAExBwX,EAAQ5oL,KAAOmmJ,EAAWuiC,QAnFhB,CAIZ,GAFAA,EAAWA,GAAY9lL,EAAO,SAE1B0uK,EAAgB9rK,QAAQkjL,IAAa,EACvC,MAAM,IAAIr/K,MAAM,gCAAkCzG,EAAO,2EAK3D,IAAK,IAAIgC,KAFT0sK,EAAgB5yK,KAAKgqL,GAEPviC,GACR,SAAeA,EAAYvhJ,KAC7BuhJ,EAAWvhJ,GAAGyyH,WAAWi6C,EAAgB31K,OAAS,GAAK,GAS3D,IAJA,IAAIotL,EAAc,CAChB1xD,WAAY,IAGL2xD,EAAM,EAAGA,EAAM1X,EAAgB31K,OAAQqtL,IAC9CD,EAAY1xD,WAAW2xD,GAAO,EAGhCD,EAAY1xD,WAAWi6C,EAAgB31K,OAAS,GAAK,EACrDotL,EAAYvsL,IAAMksL,EAClBviC,EAAWuiC,GAAYK,EACvBH,EAAU,CACRhmL,KAAMA,EACNjG,MAAO,EACP06H,WAAY8uB,EAAWuiC,GAAUrxD,WAAWr1H,MAAM,GAClDsxK,SAAUA,EACVt2J,OAAQA,EACRhd,KAAMmmJ,EAAWuiC,IAEnBxU,EAAkBwU,GAAY,CAC5BtiL,KAAMwiL,EACNx9K,OAAQ+lK,EAASC,KAAK,KAiD1B14C,EAAK26C,MAAMzwK,GAAQgmL,EAEnB,IAAK,IAAIK,EAAM,EAAGA,EAAMZ,EAAQ1sL,OAAQstL,IAAO,CAC7C,IAAIC,EAAYb,EAAQY,GACpBE,EAAS,GAEb,IAAK,IAAIC,KAASR,GACZ,SAAeA,EAASQ,KAC1BD,EAAOC,GAASR,EAAQQ,IAI5BD,EAAOvmL,KAAOsmL,EACdxwD,EAAK26C,MAAM6V,GAAaC,EAM1B,cADO3W,EAAUp6D,MACV,IAAIsgB,EAAK,KAAM91H,IAGxB81H,EAAK0vD,WAAa,SAAUxlL,UACnB81H,EAAK26C,MAAMzwK,IAIpB81H,EAAKy4C,SAAWA,EAChBz4C,EAAK44C,gBAAkBA,EACvB54C,EAAKytB,WAAaA,EAClBztB,EAAKg6C,aAAeA,EACpBh6C,EAAK26C,MAAQA,EACN36C,IACN,CACD7S,SAAS,ICj5HP,GAAO,aACP,GAAe,CAAC,QAAS,QAClBwjE,IAAkC,QAAQ,GAAM,IAAennF,IACxE,IAAI,MACFyzB,EAAK,KACL+C,GACEx2B,EA2CJ,OAAOyzB,EAAM,GAAM,CAEjB,iBAAkB,SAAsBh2H,EAAK0Y,GAC3C,OAAOqgH,EAAKoH,WAAWngI,EAAK0Y,IAG9BhZ,OAAQ,SAAgBM,GACtB,OAAO+4H,EAAKoH,WAAWngI,EAAK,KAG9B,yCAA0C,SAAsCiD,EAAM0gB,EAAKjL,GACzF,IAAI1Y,EAAM,GAEV,OADAA,EAAIiD,GAAQ0gB,EACLo1G,EAAKoH,WAAWngI,EAAK0Y,IAG9B,iCAAkC,SAAgCzV,EAAM0gB,GACtE,IAAI3jB,EAAM,GAEV,OADAA,EAAIiD,GAAQ0gB,EACLo1G,EAAKoH,WAAWngI,EAAK,KAG9By3G,OAAQ,SAAgBx0G,GACtB,IAAIjD,EAAM,GAEV,OADAA,EAAIiD,GAAQ,GACL81H,EAAKoH,WAAWngI,EAAK,UCvE9B,GAAe,CAAC,SAAU,QAAS,SAAU,YAAa,QAAS,WAAY,MAAO,OAAQ,MAAO,MAAO,iBAAkB,MAAO,YAAa,WAAY,OACvJ2pL,IAA4B,QAF5B,OAE0C,IAAepnF,IAClE,IAAI,OACFp8E,EAAM,MACN6vG,EAAK,OACL9jE,EAAM,UACNkhF,EAAS,SACTt0C,EAAQ,MACR0sB,EAAK,IACLjkH,EAAG,KACHs0E,EAAI,IACJ3pE,EAAG,IACHE,EAAG,eACH8gI,EAAc,IACd/lB,EAAG,UACHmB,EAAS,SACTvsG,EAAQ,IACRjY,GACEy4F,EA+BJ,OAAOyzB,EAAM,OAAQ,CACnB75H,MAAO,SAAe4H,GAEpB,IAAIurK,EAAMp9G,EAAOnuD,GACb6M,EAAO0+J,EAAI1+J,OAEf,GAAoB,IAAhBA,EAAK5U,QAAgB4U,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAI89I,WAAW,iCAAuC,SAAO99I,GAAQ,KAI7E,IAAIg5K,EAAMC,EAAeva,EAAK1+J,EAAK,IACnC,MAAO,CACLvH,OAAQugL,EAAI,GACZE,QAASF,EAAI,KAGjBt2C,OAAQ,SAAgBvvI,GAGtB,IAAI6M,EAAO7M,EAAE6M,OAEb,GAAoB,IAAhBA,EAAK5U,QAAgB4U,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAI89I,WAAW,iCAAuC,SAAO99I,GAAQ,KAG7E,IAAIg5K,EAAMC,EAAe9lL,EAAG6M,EAAK,IACjC,MAAO,CACLvH,OAAQ6oD,EAAO03H,EAAI,IACnBE,QAAS53H,EAAO03H,EAAI,QAoB1B,SAASC,EAAe9lL,EAAGhB,GACzB,IAAIsS,EAAOtR,EAAEwR,WAMb,QAJa3X,IAATyX,IACFA,EAAOtR,EAAEk4I,eAGE,WAAT5mI,GAA8B,cAATA,GAAiC,aAATA,EAC/C,KAAa,UAATA,EACI,IAAIrX,UAAU,8CAEd,IAAIA,UAAU,sCAAwCqX,EAAO,KAOvE,GAhCF,SAAqBtR,EAAGhB,GACtB,IAAK,IAAI9G,EAAI,EAAGA,EAAI8G,EAAG9G,IACrB,IAAK,IAAI8I,EAAI9I,EAAG8I,EAAIhC,EAAGgC,IAErB,IAAKymH,EAAMznH,EAAE9H,GAAG8I,GAAIhB,EAAEgB,GAAG9I,IACvB,MAAM,IAAI+B,UAAU,iCAuBxB+rL,CAAYhmL,EAAEutI,UAAWvuI,GAId,WAATsS,EACF,OAAOuvH,EAAK7gI,EAAEutI,WACT,GAAa,aAATj8H,EAAqB,CAG9B,IAFA,IAAI20K,EAAOjmL,EAAEutI,UAEJr1I,EAAI,EAAGA,EAAI8G,EAAG9G,IACrB,IAAK,IAAI8I,EAAI9I,EAAG8I,EAAIhC,EAAGgC,IACrBilL,EAAK/tL,GAAG8I,GAAKilL,EAAK/tL,GAAG8I,GAAGvG,UACxBwrL,EAAKjlL,GAAG9I,GAAK+tL,EAAK/tL,GAAG8I,GAIzB,OAAO6/H,EAAK7gI,EAAEutI,WACT,MAAa,cAATj8H,EAuCb,SAAiBtR,GAMf,IALA,IAEImmH,EAFArmB,EAAI9/F,EAAE/H,OACNiuL,EAAK1iL,EAAI4e,EAAOg+F,QAAUtgB,GAE1BqmF,EAAM,IAAI/tL,MAAM0nG,GAEX5nG,EAAI,EAAGA,EAAI4nG,EAAG5nG,IACrBiuL,EAAIjuL,GAAKkuL,EAAYtmF,EAAG,GACxBqmF,EAAIjuL,GAAGA,GAAK,EAMd,IAFA,IAiCmBmuL,EAAKC,EAAKC,EACzBC,EAlCAC,EAAMC,EAAU1mL,GAEbwD,EAAIijL,EAAI,KAAOjjL,EAAI0iL,IAAK,CAC7B,IAAI39B,EAAMk+B,EAAI,GAAG,GACbzlL,EAAIylL,EAAI,GAAG,GAEfzmL,EAAI2mL,EAAM3mL,GA2BOqmL,EA5BCrmL,EAAEuoJ,GAAKA,GA4BH+9B,EA5BStmL,EAAEgB,GAAGA,GA4BTulL,EA5BavmL,EAAEuoJ,GAAKvnJ,GA6B7CwlL,WAAQzrF,EAASurF,EAAKD,GA7BxBlgE,EA+BE3iH,EAAIgjL,IAAUpkK,EAAOg+F,QAChBmK,GAAW,GAAGxyC,OAAOsd,IAAI,GAEzB85C,EAAe,GAAKr3D,EAAK95D,EAAS,EAAGuoK,EAAKn9D,EAAIo9D,OAjCnCj+B,EAAKvnJ,GACvBmlL,EAAMS,EAAQT,EAAKhgE,EAAKoiC,EAAKvnJ,GAC7BylL,EAAMC,EAAU1mL,GAKlB,IAFA,IAAI+zK,EAAKqS,EAAYtmF,EAAG,GAEf2+D,EAAM,EAAGA,EAAM3+D,EAAG2+D,IACzBsV,EAAGtV,GAAOz+J,EAAEy+J,GAAKA,GAInB,OAAOooB,GAAQ,SAAM9S,IAAK,SAAMoS,IApEvBW,CAAQ9mL,EAAEutI,gBADZ,EAMT,SAAS1M,EAAK7gI,GAMZ,IALA,IAEImmH,EAFArmB,EAAI9/F,EAAE/H,OACNiuL,EAAK1mL,KAAKgE,IAAI4e,EAAOg+F,QAAUtgB,GAE/BqmF,EAAM,IAAI/tL,MAAM0nG,GAEX5nG,EAAI,EAAGA,EAAI4nG,EAAG5nG,IACrBiuL,EAAIjuL,GAAKkuL,EAAYtmF,EAAG,GACxBqmF,EAAIjuL,GAAGA,GAAK,EAMd,IAFA,IAAIuuL,EAAMM,EAAO/mL,GAEVR,KAAKgE,IAAIijL,EAAI,KAAOjnL,KAAKgE,IAAI0iL,IAAK,CACvC,IAAIloL,EAAKyoL,EAAI,GAAG,GACZzlL,EAAIylL,EAAI,GAAG,GAEfzmL,EAAIisD,EAAGjsD,GAiDOqmL,EAlDCrmL,EAAEhC,GAAIA,GAkDFsoL,EAlDOtmL,EAAEgB,GAAGA,GAkDPulL,EAlDWvmL,EAAEhC,GAAIgD,GAmDvCwlL,WAAQF,EAAMD,EAnDhBlgE,EAqDE3mH,KAAKgE,IAAIgjL,IAAUpkK,EAAOg+F,QACrB5gH,KAAKsO,GAAK,EAEV,GAAMtO,KAAKs4E,KAAK,EAAIyuG,GAAOD,EAAMD,KAvDzBroL,EAAIgD,GACnBmlL,EAAMa,EAAKb,EAAKhgE,EAAKnoH,EAAIgD,GACzBylL,EAAMM,EAAO/mL,GAKf,IA0CF,IAAkBqmL,EAAKC,EAAKC,EACtBC,EA7CAzS,EAAKqS,EAAYtmF,EAAG,GAEforC,EAAM,EAAGA,EAAMprC,EAAGorC,IACzB6oC,EAAG7oC,GAAOlrI,EAAEkrI,GAAKA,GAGnB,OAAO27C,GAAQ,SAAM9S,IAAK,SAAMoS,IA4DlC,SAASa,EAAKb,EAAKjiE,EAAOhsH,EAAG8I,GAO3B,IANA,IAAI8+F,EAAIqmF,EAAIluL,OACRiO,EAAI1G,KAAK2O,IAAI+1G,GACb3kF,EAAI//B,KAAK6O,IAAI61G,GACb+iE,EAAMb,EAAYtmF,EAAG,GACrBonF,EAAMd,EAAYtmF,EAAG,GAEhB5/F,EAAI,EAAGA,EAAI4/F,EAAG5/F,IACrB+mL,EAAI/mL,GAAKgG,EAAIigL,EAAIjmL,GAAGhI,GAAKqnC,EAAI4mJ,EAAIjmL,GAAGc,GACpCkmL,EAAIhnL,GAAKq/B,EAAI4mJ,EAAIjmL,GAAGhI,GAAKgO,EAAIigL,EAAIjmL,GAAGc,GAGtC,IAAK,IAAI6nJ,EAAK,EAAGA,EAAK/oD,EAAG+oD,IACvBs9B,EAAIt9B,GAAI3wJ,GAAK+uL,EAAIp+B,GACjBs9B,EAAIt9B,GAAI7nJ,GAAKkmL,EAAIr+B,GAGnB,OAAOs9B,EAIT,SAASS,EAAQT,EAAKjiE,EAAOhsH,EAAG8I,GAO9B,IANA,IAAI8+F,EAAIqmF,EAAIluL,OACRiO,EAAIiI,EAAI+1G,GACR3kF,EAAIlxB,EAAI61G,GACR+iE,EAAMb,EAAYtmF,EAAGyqB,EAAU,IAC/B28D,EAAMd,EAAYtmF,EAAGyqB,EAAU,IAE1BrqH,EAAI,EAAGA,EAAI4/F,EAAG5/F,IACrB+mL,EAAI/mL,GAAK66F,EAASo0C,EAAejpI,EAAGigL,EAAIjmL,GAAGhI,IAAKi3I,EAAe5vG,EAAG4mJ,EAAIjmL,GAAGc,KACzEkmL,EAAIhnL,GAAKmvI,EAAUF,EAAe5vG,EAAG4mJ,EAAIjmL,GAAGhI,IAAKi3I,EAAejpI,EAAGigL,EAAIjmL,GAAGc,KAG5E,IAAK,IAAI+nJ,EAAM,EAAGA,EAAMjpD,EAAGipD,IACzBo9B,EAAIp9B,GAAK7wJ,GAAK+uL,EAAIl+B,GAClBo9B,EAAIp9B,GAAK/nJ,GAAKkmL,EAAIn+B,GAGpB,OAAOo9B,EAIT,SAASQ,EAAMQ,EAAKjjE,EAAOhsH,EAAG8I,GAc5B,IAbA,IAAI8+F,EAAIqnF,EAAIlvL,OACRiO,EAAIqkH,EAAUp8G,EAAI+1G,IAClB3kF,EAAIgrF,EAAUl8G,EAAI61G,IAClByT,EAAKwX,EAAejpI,EAAGA,GACvBkhL,EAAKj4C,EAAe5vG,EAAGA,GACvB8nJ,EAAMjB,EAAYtmF,EAAGyqB,EAAU,IAC/B+8D,EAAMlB,EAAYtmF,EAAGyqB,EAAU,IAE/Bg9D,EAAQvpK,EAASusG,EAAU,GAAIrkH,EAAGq5B,EAAG4nJ,EAAIjvL,GAAG8I,IAE5CwmL,EAAMn4C,EAAUt0C,EAASo0C,EAAexX,EAAIwvD,EAAIjvL,GAAGA,IAAKqvL,GAAQp4C,EAAei4C,EAAID,EAAInmL,GAAGA,KAC1FymL,EAAM1hL,EAAIopI,EAAei4C,EAAID,EAAIjvL,GAAGA,IAAKqvL,EAAOp4C,EAAexX,EAAIwvD,EAAInmL,GAAGA,KAErEd,EAAI,EAAGA,EAAI4/F,EAAG5/F,IACrBmnL,EAAInnL,GAAK66F,EAASo0C,EAAejpI,EAAGihL,EAAIjvL,GAAGgI,IAAKivI,EAAe5vG,EAAG4nJ,EAAInmL,GAAGd,KACzEonL,EAAIpnL,GAAKmvI,EAAUF,EAAe5vG,EAAG4nJ,EAAIjvL,GAAGgI,IAAKivI,EAAejpI,EAAGihL,EAAInmL,GAAGd,KAI5EinL,EAAIjvL,GAAGA,GAAKsvL,EACZL,EAAInmL,GAAGA,GAAKymL,EACZN,EAAIjvL,GAAG8I,GAAKupH,EAAU,GACtB48D,EAAInmL,GAAG9I,GAAKqyH,EAAU,GAEtB,IAAK,IAAIm9D,EAAM,EAAGA,EAAM5nF,EAAG4nF,IACrBA,IAAQxvL,GAAKwvL,IAAQ1mL,IACvBmmL,EAAIjvL,GAAGwvL,GAAOL,EAAIK,GAClBP,EAAIO,GAAKxvL,GAAKmvL,EAAIK,GAClBP,EAAInmL,GAAG0mL,GAAOJ,EAAII,GAClBP,EAAIO,GAAK1mL,GAAKsmL,EAAII,IAItB,OAAOP,EAIT,SAASl7H,EAAGk7H,EAAKjjE,EAAOhsH,EAAG8I,GAYzB,IAXA,IAAI8+F,EAAIqnF,EAAIlvL,OACRiO,EAAI1G,KAAK2O,IAAI+1G,GACb3kF,EAAI//B,KAAK6O,IAAI61G,GACbyT,EAAKzxH,EAAIA,EACTkhL,EAAK7nJ,EAAIA,EACT8nJ,EAAMjB,EAAYtmF,EAAG,GACrBwnF,EAAMlB,EAAYtmF,EAAG,GAErB0nF,EAAM7vD,EAAKwvD,EAAIjvL,GAAGA,GAAK,EAAIgO,EAAIq5B,EAAI4nJ,EAAIjvL,GAAG8I,GAAKomL,EAAKD,EAAInmL,GAAGA,GAC3DymL,EAAML,EAAKD,EAAIjvL,GAAGA,GAAK,EAAIgO,EAAIq5B,EAAI4nJ,EAAIjvL,GAAG8I,GAAK22H,EAAKwvD,EAAInmL,GAAGA,GAEtDd,EAAI,EAAGA,EAAI4/F,EAAG5/F,IACrBmnL,EAAInnL,GAAKgG,EAAIihL,EAAIjvL,GAAGgI,GAAKq/B,EAAI4nJ,EAAInmL,GAAGd,GACpConL,EAAIpnL,GAAKq/B,EAAI4nJ,EAAIjvL,GAAGgI,GAAKgG,EAAIihL,EAAInmL,GAAGd,GAItCinL,EAAIjvL,GAAGA,GAAKsvL,EACZL,EAAInmL,GAAGA,GAAKymL,EACZN,EAAIjvL,GAAG8I,GAAK,EACZmmL,EAAInmL,GAAG9I,GAAK,EAEZ,IAAK,IAAIyvL,EAAM,EAAGA,EAAM7nF,EAAG6nF,IACrBA,IAAQzvL,GAAKyvL,IAAQ3mL,IACvBmmL,EAAIjvL,GAAGyvL,GAAON,EAAIM,GAClBR,EAAIQ,GAAKzvL,GAAKmvL,EAAIM,GAClBR,EAAInmL,GAAG2mL,GAAOL,EAAIK,GAClBR,EAAIQ,GAAK3mL,GAAKsmL,EAAIK,IAItB,OAAOR,EAIT,SAASJ,EAAOa,GAKd,IAJA,IAAI9nF,EAAI8nF,EAAI3vL,OACR4vL,EAAS,EACTC,EAAQ,CAAC,EAAG,GAEP5vL,EAAI,EAAGA,EAAI4nG,EAAG5nG,IACrB,IAAK,IAAI8I,EAAI9I,EAAI,EAAG8I,EAAI8+F,EAAG9+F,IACrBxB,KAAKgE,IAAIqkL,GAAUroL,KAAKgE,IAAIokL,EAAI1vL,GAAG8I,MACrC6mL,EAASroL,KAAKgE,IAAIokL,EAAI1vL,GAAG8I,IACzB8mL,EAAQ,CAAC5vL,EAAG8I,IAKlB,MAAO,CAAC8mL,EAAOD,GAIjB,SAASnB,EAAUkB,GAKjB,IAJA,IAAI9nF,EAAI8nF,EAAI3vL,OACR4vL,EAAS,EACTC,EAAQ,CAAC,EAAG,GAEP5vL,EAAI,EAAGA,EAAI4nG,EAAG5nG,IACrB,IAAK,IAAI8I,EAAI9I,EAAI,EAAG8I,EAAI8+F,EAAG9+F,IACrBwC,EAAIqkL,GAAUrkL,EAAIokL,EAAI1vL,GAAG8I,MAC3B6mL,EAASrkL,EAAIokL,EAAI1vL,GAAG8I,IACpB8mL,EAAQ,CAAC5vL,EAAG8I,IAKlB,MAAO,CAAC8mL,EAAOD,GAIjB,SAAShB,EAAQruG,EAAG2lG,GAKlB,IAJA,IAAIr+E,EAAItnB,EAAEvgF,OACN8vL,EAAK3vL,MAAM0nG,GACXkoF,EAAK5vL,MAAM0nG,GAEN5/F,EAAI,EAAGA,EAAI4/F,EAAG5/F,IACrB8nL,EAAG9nL,GAAK9H,MAAM0nG,GAGhB,IAAK,IAAI5nG,EAAI,EAAGA,EAAI4nG,EAAG5nG,IAAK,CAI1B,IAHA,IAAI+vL,EAAQ,EACRz2F,EAAOhZ,EAAE,GAEJx3E,EAAI,EAAGA,EAAIw3E,EAAEvgF,OAAQ+I,IACxBw3E,EAAEx3E,GAAKwwF,IAETA,EAAOhZ,EADPyvG,EAAQjnL,IAKZ+mL,EAAG7vL,GAAKsgF,EAAEsiC,OAAOmtE,EAAO,GAAG,GAE3B,IAAK,IAAIC,EAAM,EAAGA,EAAMpoF,EAAGooF,IACzBF,EAAGE,GAAKhwL,GAAKimL,EAAE+J,GAAKD,GAEpB9J,EAAE+J,GAAKptE,OAAOmtE,EAAO,GAIzB,MAAO,EAAC,SAAMF,IAAK,SAAMC,IAU3B,SAAS5B,EAAYv5K,EAAM5T,GAIzB,IAFA,IAAIsG,EAAQ,IAAInH,MAAMyU,GAEb3U,EAAI,EAAGA,EAAI2U,EAAM3U,IACxBqH,EAAMrH,GAAKe,EAGb,OAAOsG,MCxaP,GAAe,CAAC,QAAS,SAAU,MAAO,MAAO,YAAa,SAAU,WAAY,iBAAkB,eAAgB,WAAY,UAAW,eACtI4oL,IAAiC,QAFjC,YAE+C,IAAe3pF,IACvE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,IACN5e,EAAG,IACHuC,EAAG,UACHspI,EAAS,OACTlhF,EAAM,SACNnwC,EAAQ,eACRmxH,EAAc,aACdG,EAAY,SACZv0C,EAAQ,QACR4sB,EAAO,YACPunB,GACE1wC,EA6BJ,OAAOyzB,EAAM,YAAa,CACxB,sBAAuB,SAAyBjyH,EAAGe,EAAGqnL,GACpD,IAAK9f,EAAItoK,GACP,MAAM,IAAI/F,UAAU,kEAGtB,IAAKquK,EAAIvnK,GACP,MAAM,IAAI9G,UAAU,mEAGtB,IAqEJ,SAAa+F,GACX,OAAoB,IAAbA,EAAE/H,QAAgBowL,EAAWroL,EAAE,KAAOqoL,EAAWroL,EAAE,KAAOqoL,EAAWroL,EAAE,KAAOqoL,EAAWroL,EAAE,IAtE3FsoL,CAAIF,GACP,MAAM,IAAInuL,UAAU,mDAGtB,OA2HJ,SAA6BgyD,EAAIC,EAAIq8H,EAAIp8H,EAAIC,EAAIo8H,EAAIxoL,EAAGe,EAAGynB,EAAGtiB,GAC5D,IAAIuiL,EAAMt5C,EAAeljF,EAAIjsD,GACzB0oL,EAAMv5C,EAAehjF,EAAInsD,GACzB2oL,EAAMx5C,EAAejjF,EAAInrD,GACzB6nL,EAAMz5C,EAAe/iF,EAAIrrD,GACzB8nL,EAAM15C,EAAeo5C,EAAI//J,GACzBsgK,EAAM35C,EAAeq5C,EAAIhgK,GACzBjF,EAAI+rH,EAAav0C,EAASA,EAASA,EAAS70F,EAAGuiL,GAAME,GAAME,GAAM9tF,EAASA,EAASA,EAASs0C,EAAUA,EAAUq5C,EAAKE,GAAME,GAAML,GAAME,GAAME,IAIjJ,MAAO,CAHEx5C,EAAUpjF,EAAIkjF,EAAe5rH,EAAGw3E,EAAS5uC,EAAIF,KAC7CojF,EAAUnjF,EAAIijF,EAAe5rH,EAAGw3E,EAAS3uC,EAAIF,KAC7CmjF,EAAUk5C,EAAIp5C,EAAe5rH,EAAGw3E,EAASytF,EAAID,MArI7CQ,CAAoB/oL,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIe,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIqnL,EAAM,GAAIA,EAAM,GAAIA,EAAM,GAAIA,EAAM,KAErG,6BAA8B,SAA8Bl+H,EAAGlqD,EAAGe,EAAGynB,GACnE,GAAiB,IAAb0hC,EAAEjyD,OAAc,CAClB,IAAK2vK,EAAI19G,GACP,MAAM,IAAIjwD,UAAU,kEAGtB,IAAK2tK,EAAI5nK,GACP,MAAM,IAAI/F,UAAU,mEAGtB,IAAK2tK,EAAI7mK,GACP,MAAM,IAAI9G,UAAU,kEAGtB,IAAK2tK,EAAIp/I,GACP,MAAM,IAAIvuB,UAAU,mEAGtB,OAiDN,SAAsB+uL,EAAKC,EAAKC,EAAKC,GACnC,IAAIzkL,EAAKskL,EACLrkL,EAAKukL,EACLt7H,EAAKmtC,EAASr2F,EAAIukL,GAClBp7H,EAAKktC,EAASp2F,EAAIwkL,GAClBjgE,EAAMnuB,EAASo0C,EAAevhF,EAAG,GAAIC,EAAG,IAAKshF,EAAethF,EAAG,GAAID,EAAG,KAE1E,GAAI+5D,EAAQnkH,EAAI0lH,GAAM9mG,EAAOg+F,SAC3B,OAAO,KAGT,IAAIgpE,EAASj6C,EAAethF,EAAG,GAAInpD,EAAG,IAClC2kL,EAASl6C,EAAethF,EAAG,GAAInpD,EAAG,IAClC4kL,EAASn6C,EAAethF,EAAG,GAAIlpD,EAAG,IAClC4kL,EAASp6C,EAAethF,EAAG,GAAIlpD,EAAG,IAClC4e,EAAI+rH,EAAaD,EAAUt0C,EAASA,EAASquF,EAAQC,GAASC,GAASC,GAASrgE,GACpF,OAAOnjH,EAAIiY,EAAS4vC,EAAIrqC,GAAI7e,GAjEjB8kL,CAAat/H,EAAGlqD,EAAGe,EAAGynB,GACxB,GAAiB,IAAb0hC,EAAEjyD,OAAc,CACzB,IAAKqwK,EAAIp+G,GACP,MAAM,IAAIjwD,UAAU,kEAGtB,IAAKquK,EAAItoK,GACP,MAAM,IAAI/F,UAAU,mEAGtB,IAAKquK,EAAIvnK,GACP,MAAM,IAAI9G,UAAU,kEAGtB,IAAKquK,EAAI9/I,GACP,MAAM,IAAIvuB,UAAU,mEAGtB,OA0DgBgyD,EA1DI/B,EAAE,GA0DFgC,EA1DMhC,EAAE,GA0DJq+H,EA1DQr+H,EAAE,GA0DNiC,EA1DUnsD,EAAE,GA0DRosD,EA1DYpsD,EAAE,GA0DVwoL,EA1DcxoL,EAAE,GA0DZypL,EA1DgB1oL,EAAE,GA0Dd2oL,EA1DkB3oL,EAAE,GA0DhB4oL,EA1DoB5oL,EAAE,GA2DtE6oL,EAAQC,EAAmB59H,EAAIw9H,EADqBK,EA1DsBthK,EAAE,GA2DrCihK,EAAIv9H,EAAIw9H,EADSK,EA1DwBvhK,EAAE,GA2D3BkhK,EAAInB,EAAIoB,EADHK,EA1D0BxhK,EAAE,GA2DjBmhK,GAEvEM,EAAQJ,EAAmBC,EAAIL,EAAIt9H,EAAIF,EAAI89H,EAAIL,EAAIt9H,EAAIF,EAAI89H,EAAIL,EAAInB,EAAID,GAEvE2B,EAAQL,EAAmB59H,EAAIw9H,EAAIt9H,EAAIF,EAAIC,EAAIw9H,EAAIt9H,EAAIF,EAAIq8H,EAAIoB,EAAInB,EAAID,GAEvE4B,EAAQN,EAAmBC,EAAIL,EAAIK,EAAIL,EAAIM,EAAIL,EAAIK,EAAIL,EAAIM,EAAIL,EAAIK,EAAIL,GAEvES,EAAQP,EAAmB19H,EAAIF,EAAIE,EAAIF,EAAIG,EAAIF,EAAIE,EAAIF,EAAIs8H,EAAID,EAAIC,EAAID,GAEvE8B,EAAK/6C,EAAav0C,EAASo0C,EAAey6C,EAAOK,GAAQ96C,EAAe+6C,EAAOC,IAASpvF,EAASo0C,EAAei7C,EAAOD,GAAQh7C,EAAe86C,EAAOA,KACrJK,EAAKh7C,EAAaD,EAAUu6C,EAAOz6C,EAAek7C,EAAIJ,IAASE,GAC/DI,EAAMl7C,EAAUpjF,EAAIkjF,EAAek7C,EAAItvF,EAAS5uC,EAAIF,KACpDu+H,EAAMn7C,EAAUnjF,EAAIijF,EAAek7C,EAAItvF,EAAS3uC,EAAIF,KACpDu+H,EAAMp7C,EAAUk5C,EAAIp5C,EAAek7C,EAAItvF,EAASytF,EAAID,KACpDmC,EAAMr7C,EAAUo6C,EAAIt6C,EAAem7C,EAAIvvF,EAAS+uF,EAAIL,KACpDkB,EAAMt7C,EAAUq6C,EAAIv6C,EAAem7C,EAAIvvF,EAASgvF,EAAIL,KACpDkB,EAAMv7C,EAAUs6C,EAAIx6C,EAAem7C,EAAIvvF,EAASivF,EAAIL,KAEpDz6C,EAAYq7C,EAAKG,IAAQx7C,EAAYs7C,EAAKG,IAAQz7C,EAAYu7C,EAAKG,GAC9D,CAACL,EAAKC,EAAKC,GAEX,KA/EL,MAAM,IAAIxwL,UAAU,uDAwD1B,IAAsBgyD,EAAIC,EAAIq8H,EAAIp8H,EAAIC,EAAIo8H,EAAIiB,EAAIC,EAAIC,EAAIG,EAAIC,EAAIC,EAC5DJ,EAEAK,EAEAC,EAEAC,EAEAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAvEJ,yBAA0B,SAA4B5qL,EAAGe,EAAGqnL,GAC1D,OAAOj6H,EAAO30D,KAAKwG,EAAEvF,UAAWsG,EAAEtG,UAAW2tL,EAAM3tL,aAErD,iCAAkC,SAAkCyvD,EAAGlqD,EAAGe,EAAGynB,GAE3E,OAAO2lC,EAAO30D,KAAK0wD,EAAEzvD,UAAWuF,EAAEvF,UAAWsG,EAAEtG,UAAW+tB,EAAE/tB,eAIhE,SAAS4tL,EAAWttL,GAElB,MAAoB,iBAANA,IAAkB,EAAAumH,EAAA,IAAYvmH,GAG9C,SAAS6sK,EAAI5nK,GACX,OAAoB,IAAbA,EAAE/H,QAAgBowL,EAAWroL,EAAE,KAAOqoL,EAAWroL,EAAE,IAG5D,SAASsoK,EAAItoK,GACX,OAAoB,IAAbA,EAAE/H,QAAgBowL,EAAWroL,EAAE,KAAOqoL,EAAWroL,EAAE,KAAOqoL,EAAWroL,EAAE,IA0BhF,SAAS6pL,EAAmB9uL,EAAGmG,EAAGgF,EAAGgD,EAAGvO,EAAGoiB,EAAG8rC,EAAGnT,EAAGx9C,EAAG8I,EAAGd,EAAGokC,GAE3D,IAAIumJ,EAAO17C,EAAep0C,EAAShgG,EAAGmG,GAAI65F,EAAS70F,EAAGgD,IAClD4hL,EAAO37C,EAAep0C,EAASpgG,EAAGoiB,GAAIg+E,EAASlyC,EAAGnT,IAClDq1I,EAAO57C,EAAep0C,EAAS7iG,EAAG8I,GAAI+5F,EAAS76F,EAAGokC,IACtD,OAAO+qG,EAAUA,EAAUw7C,EAAMC,GAAOC,OCxJxC,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzFC,IAA8B,QAAQ,GAAM,IAAexsF,IACpE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,aACNmhF,EAAY,eACZH,EAAc,SACdp0C,EAAQ,YACRm0C,EAAW,YACXM,GACEhxC,EACAmgE,EAAkBL,GAAsB,CAC1C9uB,gBA2BF,OAAOvd,EAAM,GAAM,CACjB,+BAAgC,SAAiCroH,EAAG1I,GAClE,OA4DJ,SAAqC0I,EAAG1I,GAYtC,IATA,IAAIwqJ,GADJxqJ,EAAIy9J,EAAgB/0J,EAAG1I,GAAG,IACZ+e,MACVjH,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAClBxxI,EAASsE,EAAE68I,QACXllJ,EAAQqI,EAAE88I,OACVI,EAAMl9I,EAAE+8I,KAER3mJ,EAAI,GAECgB,EAAIyiC,EAAU,EAAGziC,GAAK,EAAGA,IAAK,CACrC,IAAI49J,EAAKlT,EAAM1qJ,GAAG,IAAM,EAExB,GAAKkuI,EAAY0vB,EAAI,GAqCnB5+J,EAAEgB,GAAK,CAAC,OArCe,CAUvB,IARA,IAAI69J,EAAM,EAENC,EAAU,GACVC,EAAW,GAEXh6E,EAAa+hE,EAAI9lJ,GAGZd,EAFO4mJ,EAAI9lJ,EAAI,GAEC,EAAGd,GAAK6kF,EAAY7kF,IAAK,CAChD,IAAIhI,EAAIqJ,EAAMrB,GAEVhI,IAAM8I,EACR69J,EAAMv5J,EAAOpF,GACJhI,EAAI8I,IAEb89J,EAAQ9jK,KAAKsK,EAAOpF,IACpB6+J,EAAS/jK,KAAK9C,IAKlB,GAAIg3I,EAAY2vB,EAAK,GACnB,MAAM,IAAIl5J,MAAM,2DAKlB,IAFA,IAAIq5J,EAAK1vB,EAAasvB,EAAIC,GAEjBhW,EAAK,EAAGiX,EAAaf,EAAS9mK,OAAQ4wJ,EAAKiX,EAAYjX,IAAM,CACpE,IAAI7qJ,EAAK+gK,EAASlW,GAClB6C,EAAM1tJ,GAAM,CAAC+8F,EAAS2wD,EAAM1tJ,GAAI,GAAImxI,EAAe6vB,EAAIF,EAAQjW,MAGjE7oJ,EAAEgB,GAAK,CAACg+J,IAOZ,OAAO,IAAIxvB,EAAY,CACrBn+H,KAAMrR,EACN6M,KAAM,CAACmM,EAAM,KAtHNuxJ,CAA4B3gK,EAAG1I,IAExC,8BAA+B,SAAgC0I,EAAG1I,GAChE,OAAOspK,EAA2B5gK,EAAG1I,IAEvC,wBAAyB,SAA0BnG,EAAGmG,GAKpD,OAFQspK,EAFAr8G,EAAOpzD,GAEuBmG,GAE7BzG,aAIb,SAAS+vK,EAA2B5gK,EAAG1I,GAUrC,IAPA,IAAIwqJ,GADJxqJ,EAAIy9J,EAAgB/0J,EAAG1I,GAAG,IACZ+e,MACVjH,EAAOpP,EAAEktI,MAAM,GACfrzG,EAAU75B,EAAEktI,MAAM,GAElB92I,EAAI,GACJo0E,EAAQxqE,EAAEqW,MAELjf,EAAIyiC,EAAU,EAAGziC,GAAK,EAAGA,IAAK,CAErC,IAAI49J,EAAKlT,EAAM1qJ,GAAG,IAAM,EAEpBg+J,OAAK,EAET,GAAK9vB,EAAY0vB,EAAI,GAiBnBI,EAAK,MAjBkB,CAEvB,IAAIH,EAAMzqF,EAAMpzE,GAAGA,GAEnB,GAAIkuI,EAAY2vB,EAAK,GAEnB,MAAM,IAAIl5J,MAAM,2DAGlBq5J,EAAK1vB,EAAasvB,EAAIC,GAEtB,IAAK,IAAI3mK,EAAI8I,EAAI,EAAG9I,GAAK,EAAGA,IAE1BwzJ,EAAMxzJ,GAAK,CAAC6iG,EAAS2wD,EAAMxzJ,GAAG,IAAM,EAAGi3I,EAAe6vB,EAAI5qF,EAAMl8E,GAAG8I,MAQvEhB,EAAEgB,GAAK,CAACg+J,GAGV,OAAO,IAAIxvB,EAAY,CACrBn+H,KAAMrR,EACN6M,KAAM,CAACmM,EAAM,SCnGf,GAAO,OACP,GAAe,CAAC,QAAS,MAAO,MAAO,MAAO,OAAQ,OAAQ,WAAY,cAAe,SAAU,UAAW,SAAU,aAAc,QAC/HiyK,IAA4B,QAAQ,GAAM,IAAezsF,IAClE,IAAI,MACFyzB,EAAK,IACLzuH,EAAG,IACHuC,EAAG,IACH5E,EAAG,KACH6nH,EAAI,KACJvpH,EAAI,SACJue,EAAQ,YACRkxH,EAAW,OACXtnB,EAAM,QACND,EAAO,OACPx5D,EAAM,WACN04D,EAAU,KACVka,GACEviC,EAwCJ,OAAOyzB,EAAM,GAAM,CACjB9vH,OAAQ3C,KAAKgE,IACb0zE,QAAS,SAAiBl3E,GACxB,OAAOA,EAAEwD,OAEX6hI,UAAW,SAAmBrlI,GAE5B,OAAOA,EAAEwD,OAEX24H,QAAS,SAAiBn8H,GAExB,OAAOR,KAAKgE,IAAIxD,IAElB5H,MAAO,SAAe4H,GACpB,OAAOkrL,EAAM/8H,EAAOnuD,GAAI,IAE1BuvI,OAAQ,SAAgBvvI,GACtB,OAAOkrL,EAAMlrL,EAAG,IAElB,sEAAuE,SAA4DA,GAEjI,OAAOxG,KAAKwG,IAEd,qCAAsC,SAAoCA,EAAG1C,GAC3E,OAAO4tL,EAAM/8H,EAAOnuD,GAAI1C,IAE1B,sCAAuC,SAAqC0C,EAAG1C,GAC7E,OAAO4tL,EAAMlrL,EAAG1C,MAsNpB,SAAS4tL,EAAMlrL,EAAG1C,GAEhB,IAAI6tL,EAAQnrL,EAAE6M,OAEd,GAAqB,IAAjBs+K,EAAMlzL,OACR,OAtKJ,SAAqB+H,EAAG1C,GAEtB,GAAIA,IAAM+D,OAAOq/E,mBAA2B,QAANpjF,EACpC,OA9CJ,SAAiC0C,GAE/B,IAAIorL,EAAO,EASX,OAPAprL,EAAEuW,SAAQ,SAAUtd,GAClB,IAAIkH,EAAIqD,EAAIvK,GAER2uH,EAAOznH,EAAGirL,KACZA,EAAOjrL,MAER,GACIirL,EAmCEC,CAAwBrrL,GAGjC,GAAI1C,IAAM+D,OAAO8qF,mBAA2B,SAAN7uF,EACpC,OA7BJ,SAAkC0C,GAEhC,IAAIsrL,EASJ,OAPAtrL,EAAEuW,SAAQ,SAAUtd,GAClB,IAAIkH,EAAIqD,EAAIvK,GAEPqyL,IAAQ3jE,EAAQxnH,EAAGmrL,KACtBA,EAAOnrL,MAER,GACImrL,GAAQ,EAkBNC,CAAyBvrL,GAGlC,GAAU,QAAN1C,EACF,OAAO4tL,EAAMlrL,EAAG,GAGlB,GAAiB,iBAAN1C,IAAmB4E,MAAM5E,GAAI,CAEtC,IAAK4xI,EAAY5xI,EAAG,GAAI,CAEtB,IAAI0B,EAAI,EAKR,OAHAgB,EAAEuW,SAAQ,SAAUtd,GAClB+F,EAAI+G,EAAI5E,EAAIqC,EAAIvK,GAAQqE,GAAI0B,MAC3B,GACImC,EAAInC,EAAG,EAAI1B,GAGpB,OAAO+D,OAAOq/E,kBAIhB,MAAM,IAAI/6E,MAAM,+BAwIP6lL,CAAYxrL,EAAG1C,GAIxB,GAAqB,IAAjB6tL,EAAMlzL,OAAc,CACtB,GAAIkzL,EAAM,IAAMA,EAAM,GACpB,OAzCN,SAAqBnrL,EAAG1C,GAEtB,GAAU,IAANA,EACF,OA9EJ,SAAwB0C,GAEtB,IAAIkG,EAAI,GAEJulL,EAAO,EAYX,OAVAzrL,EAAEuW,SAAQ,SAAUtd,EAAOsI,GACzB,IAAIP,EAAIO,EAAM,GACVmqL,EAAK3lL,EAAIG,EAAElF,IAAM,EAAGwC,EAAIvK,IAExB2uH,EAAO8jE,EAAID,KACbA,EAAOC,GAGTxlL,EAAElF,GAAK0qL,KACN,GACID,EA8DEE,CAAe3rL,GAGxB,GAAI1C,IAAM+D,OAAOq/E,mBAA2B,QAANpjF,EACpC,OAlCJ,SAA6B0C,GAE3B,IAAI4d,EAAI,GAEJguK,EAAO,EAYX,OAVA5rL,EAAEuW,SAAQ,SAAUtd,EAAOsI,GACzB,IAAIrJ,EAAIqJ,EAAM,GACVsqL,EAAK9lL,EAAI6X,EAAE1lB,IAAM,EAAGsL,EAAIvK,IAExB2uH,EAAOikE,EAAID,KACbA,EAAOC,GAGTjuK,EAAE1lB,GAAK2zL,KACN,GACID,EAkBEE,CAAoB9rL,GAG7B,GAAU,QAAN1C,EACF,OAtGJ,SAA8B0C,GAE5B,IAAI+rL,EAAM,EAIV,OAHA/rL,EAAEuW,SAAQ,SAAUtd,EAAOsI,GACzBwqL,EAAMhmL,EAAIgmL,EAAK/tK,EAAS/kB,EAAO+vH,EAAK/vH,QAE/BuK,EAAI/D,EAAKssL,IAgGPC,CAAqBhsL,GAG9B,GAAU,IAAN1C,EACF,OAhEJ,SAAwB0C,GAEtB,IAAImrL,EAAQnrL,EAAE6M,OAEd,GAAIs+K,EAAM,KAAOA,EAAM,GACrB,MAAM,IAAIxgC,WAAW,6BAGvB,IAAI97F,EAAKg4D,EAAW7mH,GAChBisL,EAAWjuK,EAAS6wC,EAAI7uD,GACxBksL,EAAYnrD,EAAKkrD,GAAU3mL,OAC3B8/G,EAAM8mE,EAAU7vL,IAAI,CAAC6vL,EAAUr/K,OAAO,GAAK,IAC/C,OAAOrJ,EAAI/D,EAAK2lH,IAoDP+mE,CAAensL,GAIxB,MAAM,IAAI2F,MAAM,+BAAiCrI,GAsBtC8uL,CAAYpsL,EAAG1C,GAEtB,MAAM,IAAIqtJ,WAAW,kCChTtB,SAAS0hC,GAAQ/uL,EAAG4D,GAEzB,IAAIhB,EACAlB,EAAIkC,EAAEjJ,OACN+H,EAAI,GAER,GAAI1C,EAEF,IAAK4C,EAAI,EAAGA,EAAIlB,EAAGkB,IAEjBF,EAAE1C,EAAE4C,IAAMgB,EAAEhB,QAId,IAAKA,EAAI,EAAGA,EAAIlB,EAAGkB,IAEjBF,EAAEE,GAAKgB,EAAEhB,GAIb,OAAOF,ECxBT,IAAI,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,MAAO,MAAO,SAAU,SAAU,eAC9DssL,IAA+B,QAAQ,GAAM,IAAe9tF,IACrE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,IACN8xE,EAAG,IACHG,EAAG,OACHC,EAAM,OACNN,EAAM,YACNyP,GACEhxC,EACAmgE,EAAkBL,GAAsB,CAC1C9uB,gBAoCF,OAAOvd,EAAM,GAAM,CACjB,wBAAyB,SAA0Bl3H,EAAGmG,GACpDnG,EAAIozD,EAAOpzD,GACX,IAAImO,EAAI+2H,EAAIllI,GAIZ,OAFQwxL,EAASrjL,EAAEm2J,EAAGn2J,EAAEw4J,EAAGx4J,EAAE5L,EAAG,KAAM4D,GAE7BzG,WAEX,8BAA+B,SAAgCM,EAAGmG,GAChE,IAAIgI,EAAI+2H,EAAIllI,GACZ,OAAOwxL,EAASrjL,EAAEm2J,EAAGn2J,EAAEw4J,EAAGx4J,EAAE5L,EAAG,KAAM4D,IAEvC,+BAAgC,SAAiCnG,EAAGmG,GAClE,IAAIgI,EAAI+2H,EAAIllI,GACZ,OAAOwxL,EAASrjL,EAAEm2J,EAAGn2J,EAAEw4J,EAAGx4J,EAAE5L,EAAG,KAAM4D,IAEvC,+CAAgD,SAA6CnG,EAAGmG,EAAG48E,EAAOwpF,GACxG,IAAIp+J,EAAIk3H,EAAIrlI,EAAG+iF,EAAOwpF,GACtB,OAAOilB,EAASrjL,EAAEm2J,EAAGn2J,EAAEw4J,EAAGx4J,EAAE5L,EAAG4L,EAAEqvF,EAAGr3F,IAEtC,yBAA0B,SAA2BgI,EAAGhI,GACtD,OAAOqrL,EAASrjL,EAAEm2J,EAAGn2J,EAAEw4J,EAAGx4J,EAAE5L,EAAG4L,EAAEqvF,EAAGr3F,MAIxC,SAASsrL,EAAUzxL,GACjB,IAAI,EAAAumH,EAAA,IAASvmH,GACX,OAAOA,EAGT,IAAI,EAAAumH,EAAA,IAAQvmH,GACV,OAAOozD,EAAOpzD,GAGhB,MAAM,IAAId,UAAU,mCAGtB,SAASsyL,EAASjoJ,EAAG49B,EAAG5kE,EAAGi7F,EAAGr3F,GAE5BojC,EAAIkoJ,EAAUloJ,GACd49B,EAAIsqH,EAAUtqH,GAEV5kE,KACF4D,EAAIy9J,EAAgBr6H,EAAGpjC,GAAG,IACxB+e,MAAQosK,GAAQ/uL,EAAG4D,EAAE+e,QAIzB,IAAIlf,EAAIg/H,EAAOz7F,EAAGpjC,GAEdlB,EAAIqgI,EAAOn+D,EAAGnhE,GAMlB,OAJIw3F,IACFv4F,EAAEigB,MAAQosK,GAAQ9zF,EAAGv4F,EAAEigB,QAGlBjgB,MC1GP,GAAO,QACP,GAAe,CAAC,QAAS,MAAO,MAAO,WAAY,OAAQ,WAAY,MAAO,OAAQ,MAAO,YACtFysL,IAA6B,QAAQ,GAAM,IAAejuF,IACnE,IAAI,MACFyzB,EAAK,IACLzuH,EAAG,IACHuC,EAAG,SACHiY,EAAQ,KACRve,EAAI,SACJs7F,EAAQ,IACRquB,EAAG,KACHv8G,EAAI,IACJ5D,EAAG,SACH4nG,GACErS,EAEAkuF,EAAa,KAWjB,SAASC,EAAejtF,GACtB,IAAIxmG,EACA0zL,EAAa,EACbtsL,EAAIo/F,EACJuyE,EAAIphE,EAAShkG,EAAK6yF,IAEtB,EAAG,CACD,IAAImtF,EAAKvsL,EAKT,GAJAA,EAAI0d,EAAS,GAAKjY,EAAI8mL,EAAIzjE,EAAI6oD,KAC9BA,EAAIj0J,EAAS,GAAKjY,EAAIksK,EAAG7oD,EAAIyjE,MAC7B3zL,EAAQ+P,EAAIzF,EAAIu3F,EAASz6F,EAAGusL,MAEhBH,KAAgBE,EAxBX,IAyBf,MAAM,IAAIjnL,MAAM,8EAEXzM,EAAQwzL,GAEjB,OAAOpsL,EAyBT,OAAO2xH,EAAM,GAAM,CACjB,iBAAkB,SAAqBvyB,GACrC,IAAI7yF,GAAO,EAAAy0G,EAAA,IAAS5hB,GAAKA,EAAE7yF,QAAS,SAAU6yF,GAE9C,OAAQ7yF,EAAK5U,QACX,KAAK,EAEH,GAAgB,IAAZ4U,EAAK,GACP,OAAOpN,EAAKigG,GAEZ,MAAM,IAAIirD,WAAW,iCAAuC,SAAO99I,GAAQ,KAG/E,KAAK,EAMD,GAHWA,EAAK,KACLA,EAAK,GAGd,OAAO8/K,EAAejtF,GAEtB,MAAM,IAAIirD,WAAW,iCAAuC,SAAO99I,GAAQ,KAIjF,QAEE,MAAM,IAAI89I,WAAW,kDAAwD,SAAO99I,GAAQ,YCnGlG,GAAO,cACP,GAAe,CAAC,QAAS,MAAO,SAAU,WAAY,YAAa,YAAa,cACzEigL,IAAmC,QAAQ,GAAM,IAAetuF,IACzE,IAAI,MACFyzB,EAAK,IACLlsH,EAAG,OACHivF,EAAM,SACNh3E,EAAQ,UACR8oG,EAAS,UACTh0D,EAAS,WACT0kC,GACEgH,EAuBJ,OAAOyzB,EAAM,GAAM,CACjB,iBAAkB,SAAqBl3H,GACrC,IAAI6F,EAAM,EACN4lL,EAAQ,EASZ,OARA,SAAYzrL,GAAG,SAAUgyL,GACvB,IAAKj6H,EAAUi6H,KAAQv1F,EAAWu1F,GAChC,MAAM,IAAI9yL,UAAU,2DAGtB2G,EAAMmF,EAAInF,EAAKmsL,GACfvG,EAAQxoK,EAASwoK,EAAO1/D,EAAUimE,OAE7B/3F,EAAO8xB,EAAUlmH,GAAM4lL,SC9ChC,GAAO,iBACP,GAAe,CAAC,QAAS,SAAU,iBAAkB,YAAa,aAAc,OAAQ,SAAU,YAAa,cAAe,eAAgB,MAAO,OAC9IwG,IAAsC,QAAQ,GAAM,IAAexuF,IAC5E,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,eACN+sH,EAAc,UACdE,EAAS,WACTpoB,EAAU,KACVwB,EAAI,UACJ4c,EAAS,OACTl3E,EAAM,YACNqhF,EAAW,aACXC,EAAY,IACZthI,EAAG,IACHE,GACEmwF,EAkCJ,OAAOyzB,EAAM,GAAM,CACjB,GAAI,WACF,MAAyB,WAAlB7vG,EAAO+rC,OAAsBA,EAAO,IAAM,IAEnDulD,OAAQ,SAAgBmvB,GACtB,OAAO10E,EAAO00E,IAEhB,sCAAuC,SAAoC3e,GACzE,OAAO+oE,EAAmB/oE,EAAyB,WAAlB9hG,EAAO+rC,OAAsB,aAAUt0D,IAE1E,8CAA+C,SAA0CqqH,EAAO2e,GAC9F,OAAOoqD,EAAmB/oE,EAAO2e,IAEnC,6CAA8C,SAAyC3e,EAAO/jH,GAC5F,IAAI+sL,EAAU/+H,EAAOhuD,GAIrB,OAFAgtL,EAAgBD,GAETE,EAAmBlpE,EAAOgpE,OAASrzL,IAE5C,8CAA+C,SAA0CqqH,EAAO/jH,GAC9FgtL,EAAgBhtL,GAEhB,IAAIktL,EAAcltL,EAAE+yI,YAAgC,WAAlB9wH,EAAO+rC,OAAsB,aAAUt0D,GACzE,OAAOuzL,EAAmBlpE,EAAO/jH,EAAGktL,IAEtC,qDAAsD,SAA+CnpE,EAAO/jH,EAAG0iI,GAC7G,IAAIqqD,EAAU/+H,EAAOhuD,GAIrB,OAFAgtL,EAAgBD,GAETE,EAAmBlpE,EAAOgpE,EAASrqD,IAE5C,sDAAuD,SAAgD3e,EAAO/jH,EAAG0iI,GAG/G,OAFAsqD,EAAgBhtL,GAETitL,EAAmBlpE,EAAO/jH,EAAG0iI,MAYxC,SAASoqD,EAAmB/oE,EAAO2e,GACjC,IACIyqD,GADM,EAAAhsE,EAAA,IAAY4C,GACD,IAAImhB,GAAW,IAAM,EACtCkoD,EAAWp/K,EAAI+1G,GACfspE,EAAWn/K,EAAI61G,GAEnB,OAAOupE,EADI,CAAC,CAACF,EAAUp+C,EAAem+C,EAAUE,IAAY,CAACA,EAAUD,IACzC1qD,GAGhC,SAASsqD,EAAgBhtL,GACvB,IAAI0M,EAAO1M,EAAE0M,OAEb,GAAIA,EAAK5U,OAAS,GAAiB,IAAZ4U,EAAK,GAC1B,MAAM,IAAI89I,WAAW,oCAIzB,SAAS+iC,EAAKnuL,GACZ,OAAOA,EAAM0B,QAAO,CAAC3D,EAAG48E,IAASi1D,EAAe7xI,EAAG48E,KAGrD,SAASuzG,EAAiBp8K,EAAMwxH,GAC9B,GAAIA,EAAQ,CACV,GAAe,WAAXA,EACF,OAAO,IAAI4M,EAAap+H,GAG1B,GAAe,UAAXwxH,EACF,OAAO,IAAI2M,EAAYn+H,GAGzB,MAAM,IAAIpX,UAAU,wBAAyBiL,OAAO29H,EAAQ,MAG9D,OAAOxxH,EAaT,SAAS+7K,EAAmBlpE,EAAO/jH,EAAG0iI,GACpC,IAAI8qD,EAAQllE,EAAKtoH,GAEjB,GAAc,IAAVwtL,EACF,MAAM,IAAIhjC,WAAW,+BAGvB,IAAIgD,GAAM,EAAArsC,EAAA,IAAY4C,GAASmhB,EAAY,KACvCvvC,EAAM63D,EAAM,IAAIA,EAAI,GAAK,EACzB2/B,EAAW3/B,EAAM,IAAIA,GAAK,IAAM,EAChCvE,EAAKuE,EAAM,IAAIA,EAAIxtJ,EAAE9D,IAAI,CAAC,IAAMsxL,GAASxtL,EAAE9D,IAAI,CAAC,IAAMsxL,EACtDtkC,EAAKsE,EAAM,IAAIA,EAAIxtJ,EAAE9D,IAAI,CAAC,IAAMsxL,GAASxtL,EAAE9D,IAAI,CAAC,IAAMsxL,EACtDC,EAAKjgC,EAAM,IAAIA,EAAIxtJ,EAAE9D,IAAI,CAAC,IAAMsxL,GAASxtL,EAAE9D,IAAI,CAAC,IAAMsxL,EACtDznL,EAAIiI,EAAI+1G,GACR2pE,EAAYx+C,EAAUv5C,EAAKmxB,EAAW/gH,IACtCq5B,EAAIlxB,EAAI61G,GAWZ,OAAOupE,EADI,CAAC,CATFp+C,EAAUnpI,EAAGwnL,EAAK,CAACtkC,EAAIA,EAAIykC,KAC3Bx+C,EAAUq+C,EAAK,CAACtkC,EAAIC,EAAIwkC,IAAaH,EAAK,CAACJ,EAAUM,EAAIruJ,KACzD8vG,EAAUq+C,EAAK,CAACtkC,EAAIwkC,EAAIC,IAAaH,EAAK,CAACrkC,EAAI9pH,MAO5B,CANnB8vG,EAAUq+C,EAAK,CAACtkC,EAAIC,EAAIwkC,IAAaH,EAAK,CAACE,EAAIruJ,KAC/C8vG,EAAUnpI,EAAGwnL,EAAK,CAACrkC,EAAIA,EAAIwkC,KAC3Bx+C,EAAUq+C,EAAK,CAACrkC,EAAIukC,EAAIC,IAAaH,EAAK,CAACJ,EAAUlkC,EAAI7pH,MAIrB,CAHpC8vG,EAAUq+C,EAAK,CAACtkC,EAAIwkC,EAAIC,IAAaH,EAAK,CAACJ,EAAUjkC,EAAI9pH,KACzD8vG,EAAUq+C,EAAK,CAACrkC,EAAIukC,EAAIC,IAAaH,EAAK,CAACtkC,EAAI7pH,KAC/C8vG,EAAUnpI,EAAGwnL,EAAK,CAACE,EAAIA,EAAIC,OAEPhrD,OCzK9B,GAAO,SACP,GAAe,CAAC,QAAS,MAAO,SAAU,UAAW,mBAC9CirD,IAA8B,QAAQ,GAAM,IAAetvF,IACpE,IAAI,MACFyzB,EAAK,IACLlsH,EAAG,OACHivF,EAAM,QACN4F,EAAO,gBACPsmC,GACE1iC,EAQJ,SAASuvF,EAAQxuL,GACf,IAEE,IAAI2K,GADJ3K,GAAQ,SAAQA,EAAM9E,YACNxC,OAEhB,GAAY,IAARiS,EACF,MAAM,IAAIvE,MAAM,6CAGlB,GAAIuE,EAAM,GAAM,EAAG,CAOjB,IALA,IAAI6D,EAAM7D,EAAM,EAAI,EAChB4F,EAAQoxH,EAAgB3hI,EAAOwO,EAAM,GAErC8B,EAAOtQ,EAAMwO,GAER7V,EAAI,EAAGA,EAAI6V,IAAO7V,EACrB0iG,EAAQr7F,EAAMrH,GAAI2X,GAAQ,IAC5BA,EAAOtQ,EAAMrH,IAIjB,OAAO81L,EAAQn+K,EAAMC,GAGrB,IAAIlG,EAAIs3H,EAAgB3hI,GAAQ2K,EAAM,GAAK,GAC3C,OAAO+jL,EAAOrkL,GAEhB,MAAOhQ,GACP,MAAM,EAAAyjK,GAAA,GAAoBzjK,EAAK,WAKnC,IAAIq0L,EAASh8D,EAAM,CACjB,sCAAuC,SAAoCh5H,GACzE,OAAOA,KAIP+0L,EAAU/7D,EAAM,CAClB,2EAA4E,SAA8DpiH,EAAMC,GAC9I,OAAOklF,EAAOjvF,EAAI8J,EAAMC,GAAQ,MA8BpC,OAAOmiH,EAAM,GAAM,CAEjB,iBAAkB87D,EAElB,qCAAsC,SAAoCxuL,EAAOytI,GAE/E,MAAM,IAAIrnI,MAAM,wCAGlB,MAAO,SAAWlM,GAChB,IAAI,SAAoBA,GACtB,MAAM,IAAIQ,UAAU,6CAGtB,OAAO8zL,EAAQt0L,SCzGjB,GAAO,SACP,GAAe,CAAC,QAAS,WAAY,kBAC9By0L,IAA8B,QAAQ,GAAM,IAAe1vF,IACpE,IAAI,MACFyzB,EAAK,SACLj0G,EAAQ,eACRojH,GACE5iC,EA8BJ,OAAOyzB,EAAM,GAAM,CACjB,8CAA+C,SAAyC/nE,EAAGg6D,GAIzF,OAHAiqE,EAAcjkI,EAAG,GAEDlsC,EAASojH,EAAeld,GAAQh6D,GAC/BqjF,WAEnB,+CAAgD,SAA0CrjF,EAAGg6D,GAG3F,OAFAiqE,EAAcjkI,EAAG,GAEVlsC,EAASojH,EAAeld,GAAQh6D,IAEzC,6DAA8D,SAAoDA,EAAGg6D,EAAO/jH,GAI1H,OAHAguL,EAAcjkI,EAAG,GAEDlsC,EAASojH,EAAeld,EAAO/jH,GAAI+pD,IAGrD,8DAA+D,SAAqDA,EAAGg6D,EAAO/jH,GAG5H,OAFAguL,EAAcjkI,EAAG,GAEVlsC,EAASojH,EAAeld,EAAO/jH,GAAI+pD,MAI9C,SAASikI,EAAchuL,EAAGiuL,GACxB,IAAIC,EAAaj2L,MAAMoF,QAAQ2C,IAAK,SAAUA,GAAKA,EAAE0M,OAErD,GAAIwhL,EAAWp2L,OAAS,EACtB,MAAM,IAAI0yJ,WAAW,kCAAkCzlJ,OAAOkpL,IAGhE,GAA0B,IAAtBC,EAAWp2L,QAAkC,IAAlBo2L,EAAW,GACxC,MAAM,IAAI1jC,WAAW,kCAAkCzlJ,OAAOkpL,IAGhE,GAAIC,EAAW,KAAOD,EACpB,MAAM,IAAIzjC,WAAW,kCAAkCzlJ,OAAOkpL,QCxEhE,GAAe,CAAC,QAAS,MAAO,MAAO,SAAU,YAC1CE,IAA2B,QAF3B,MAEyC,IAAe9vF,IACjE,IAAI,MACFyzB,EAAK,IACLzuH,EAAG,IACH1C,EAAG,OACH0oD,EAAM,SACNuxC,GACEyD,EA0BJ,OAAOyzB,EAnCE,MAmCU,CAEjB,iBAAkBs8D,EAElB,MAAO,SAAW90L,GAChB,OAAO80L,EAAK90L,MAIhB,SAAS80L,EAAKhvL,GAGZ,GAAqB,KAFrBA,GAAQ,SAAQA,EAAM9E,YAEZxC,OACR,MAAM,IAAI0N,MAAM,sEAGlB,IACE,IAAI6oL,EAAMhlI,EAAOjqD,GACjB,OAAOiqD,EAAO1oD,EAAIvB,GAAO,SAAUtG,GACjC,OAAOuK,EAAIu3F,EAAS9hG,EAAOu1L,QAE7B,MAAO50L,GACP,MAAIA,aAAeK,YAAgD,IAAnCL,EAAIslB,QAAQpd,QAAQ,UAC5C,IAAI7H,UAAUL,EAAIslB,QAAQG,QAAQ,SAAU,SAE5C,EAAAg+I,GAAA,GAAoBzjK,EAAK,YC7DnC,GAAO,OACP,GAAe,CAAC,QAAS,QAElB60L,IAAoC,QAAQ,GAAM,IAAejwF,IAC1E,IAAI,MACFyzB,EAAK,KACL+C,GACEx2B,EAyBJ,OAAOyzB,EAAM,GAAM,CACjB+C,KAAM,SAAch1H,GAClB,OAAOA,EAAEy9F,SAEXiW,OAAQ,SAAgB1zG,GACtB,OAAIg1H,EAAKC,gBAAgBj1H,GAChB,IAAIg1H,EAAK,KAAMh1H,GAGjBg1H,EAAKt+G,MAAM1W,EAAG,CACnBkvK,cAAc,KAGlB,kDAAmD,SAA8Cj2K,EAAOyJ,GACtG,OAAO,IAAIsyH,EAAK/7H,EAAOyJ,IAEzB,iBAAkB,SAAqB1C,GACrC,OAAO,SAAQA,EAAGxG,Y,+IC5CbqpH,GAA2BgtB,EAAgB,IAC3C34D,GAAyB64D,EAAmB,IAC5CnlG,GAAuBulG,EAAiB,IACxCu+C,GAAwB39C,EAAY,IACpC49C,GAAuB39C,EAAW,IAClC49C,GAAuB99C,EAAW,IAClCzL,GAA2ByN,EAAqB,CACzD1wH,OAAM,MAEGmtH,GAAwByD,EAAkB,IAC1Cl/D,GAA0Bs/D,EAAe,IACzCl7I,GAAmBu6I,EAAQ,CACpCv7D,aAES+Z,GAAsB8gD,EAAW,CAC1C1M,aACAjjH,OAAM,MAEGq6G,GAAwB0V,EAAa,CAC9C9M,aACAjjH,OAAM,MAEGysK,GAAsB19C,EAAU,CACzC9L,aACAjjH,OAAM,MAEG,GAAoBivH,EAAS,CACtChM,aACAjjH,OAAM,MAEGs6G,GAAyB2V,EAAc,CAChDhN,aACAjjH,OAAM,MAEG,GAAqBmvH,EAAU,CACxClM,aACAjjH,OAAM,MAEGo8G,GAA8B2W,GAAmB,CAC1D9P,aACAjjH,OAAM,MAEG27G,GAA+B0W,GAAoB,CAC5DpP,aACAjjH,OAAM,MAEG88G,GAA+B2W,GAAoB,CAC5DxQ,aACAjjH,OAAM,MAEGm8G,GAAiC2W,GAAsB,CAChE7P,aACAjjH,OAAM,MAEGk9E,GAA0Bs3C,GAAoB,IAC9C,GAAmBnF,EAAQ,CACpCpM,aACAjjH,OAAM,MAEG0sK,GAA2B79C,EAAe,CACnD5L,aACAjjH,OAAM,MAEGo6G,GAAuByV,EAAY,CAC5C5M,aACAjjH,OAAM,MAEG,GAAyBwwH,EAAc,IACvCpD,GAA6BqH,GAAuB,CAC7DtH,YAES,GAAqBoC,EAAU,CACxCtM,aACAjjH,OAAM,MAEG6vG,GAAuB+mB,GAAY,CAC5C3T,aACAnuD,WACAs4D,eACAlwC,cAESxsC,GAA2BwmF,GAAgB,CACpDrnB,WAESgR,GAA2BsW,GAAgB,CACpDtnB,WAESz6B,GAA4BoiD,GAAiB,CACtD3nB,WAES,GAAuB4nB,GAAY,CAC5C5nB,WAESid,GAA6B4K,GAAkB,CACxD13H,OAAM,IACN6vG,WAES9vH,GAAwB83I,GAAa,CAC9ChoB,WAES,GAAyByoB,GAAc,CAChDzoB,WAES,GAAyB2oB,GAAc,CAChD1jE,WACA+6C,WAESqK,GAA2Bwe,GAAgB,CACpD7oB,WAESjL,GAA2Bu1B,GAAgB,CACpDlX,aACAjjH,OAAM,IACN6vG,WAES,IAAuB,QAAY,CAC5Cn/D,aACAm/D,WAES3J,GAAsBk0B,GAAW,CAC1CvqB,WAES16C,GAAuBklE,GAAY,CAC5CvlE,WACA+6C,WAESz0B,GAAuBm/C,GAAY,CAC5CzlE,WACA90D,OAAM,IACN6vG,WAESkd,GAAgCyN,GAAqB,CAC9D3qB,WAESp2B,GAAsBihD,GAAW,CAC1CzX,aACA/lC,YACAkrB,QAAO,GACPyH,WAESrJ,GAAwBq0B,GAAa,CAC9ChrB,WAES/K,GAAwB83B,GAAa,CAC9C/sB,WAESl5H,GAAqBkmJ,GAAU,CACxChtB,WAES36C,GAAoB4nE,GAAS,CACtCjtB,WAES91F,GAAqBojH,GAAU,CACxCttB,WAESpwH,GAAwB29I,GAAa,CAC9CvtB,WAES17G,GAAyBmpI,GAAc,CAChDztB,WAESnxH,GAAqB6+I,GAAU,CACxC1tB,WAESzI,GAAqBo2B,GAAU,CACxC3tB,WAES4Q,GAAwB2d,GAAa,CAC9CvuB,WAES8Q,GAAqB0d,GAAU,CACxC5d,UACA5Q,WAESmd,GAAuBwR,GAAY,CAC5C3uB,WAESkR,GAAyB4d,GAAc,CAChD9uB,WAESl6C,GAAsBipE,GAAW,CAC1C9pE,WACA90D,OAAM,IACN6vG,WAESvI,GAAsBw4B,GAAW,CAC1C7c,aACApT,WAESrI,GAAsBu4B,GAAW,CAC1C9c,aACAnuD,WACA90D,OAAM,IACN6vG,WAESnI,GAAsBs4B,GAAW,CAC1C/c,aACAnuD,WACA90D,OAAM,IACN6vG,WAESj6C,GAAsBqqE,GAAW,CAC1CnrE,WACA90D,OAAM,IACN6vG,WAESn6C,GAAsBwqE,GAAW,CAC1CrwB,WAES75C,GAAuBmqE,GAAY,CAC5CrrE,WACA90D,OAAM,IACN6vG,WAESt7C,GAAsB6rE,GAAW,CAC1CvwB,WAEShI,GAAsB04B,GAAW,CAC1Ctd,aACApT,WAES9H,GAAsBy4B,GAAW,CAC1Cvd,aACApT,WAES5H,GAAsBw4B,GAAW,CAC1Cxd,aACApT,WAESr7C,GAAsBksE,GAAW,CAC1C7wB,WAES17B,GAAsBwsD,GAAW,CAC1C9wB,WAES3I,GAA8B85B,GAAmB,CAC1DnxB,WAESyP,GAA4B+hB,GAAiB,CACtDrhI,OAAM,IACN6vG,WAES0P,GAA2B2iB,GAAgB,CACpDliI,OAAM,IACN6vG,WAESsK,GAAqBsV,EAAU,CACxCxM,aACAjjH,OAAM,MAEGq7E,GAAuBgnD,GAAY,CAC5CxyB,WAESiR,GAAiCwhB,GAAsB,CAChEzhB,aACAhR,WAESmR,GAAwBuhB,GAAa,CAC9C1yB,WAES,GAAwB2yB,GAAa,CAC9C3yB,WAES,GAA0B4yB,GAAe,CAClDvlD,YACA2yB,WAEShL,GAA4B69B,GAAiB,CACtD7yB,WAESod,GAA2B0V,GAAgB,CACpD9yB,WAESrvH,GAAqBoiJ,GAAU,CACxC/yB,WAESzwE,GAAsByjG,GAAW,CAC1C/tE,WACA90D,OAAM,IACN6vG,WAESxyH,GAAsB2lJ,GAAW,CAC1CluE,WACA90D,OAAM,IACN6vG,WAESjJ,GAAsBs8B,GAAW,CAC1CrzB,WAES6O,GAAmC0kB,GAAwB,CACpEvzB,WAESxvH,GAAsBgjJ,GAAW,CAC1CvjJ,MAAK,GACL+gI,aACAhR,WAES6Q,GAAqB6iB,GAAU,CACxC9iB,UACA5Q,WAES35C,GAAuBstE,GAAY,CAC5C1uE,WACA90D,OAAM,IACN6vG,WAESpI,GAAuBg8B,GAAY,CAC5CxgB,aACApT,WAES55C,GAAuBytE,GAAY,CAC5C7zB,WAES9jH,GAAqB43I,GAAU,CACxC9zB,WAES/H,GAAqB87B,GAAU,CACxC3gB,aACApT,WAES5jH,GAAqB43I,GAAU,CACxCh0B,WAES1I,GAAqC28B,GAA0B,CACxEj0B,WAES15F,GAAwB6tH,GAAa,CAC9ChkI,OAAM,IACN6vG,WAES0K,GAAuB4V,EAAY,CAC5ClN,aACAjjH,OAAM,MAEGm1E,GAA4BgvD,GAAiB,CACtDt0B,WAESwd,GAA8B+W,GAAwB,CAC/DjX,UACAL,eACAjd,WAES9jE,GAAwB61F,GAAa,CAC9CxU,eACAD,UACAE,gBACAxd,WAESv9B,GAAsB60D,GAAW,CAC1ClkB,aACAnuD,WACAooB,YACAl9E,OAAM,IACNm1E,cACAppC,UACA8jE,SACAhL,gBAESxjH,GAAqBwoJ,GAAU,CACxC5mB,aACAmK,eACAN,eACA/gF,UACA8jE,WAES35B,GAAqB00D,GAAU,CACxCxd,eACAN,eACA/gF,UACA8jE,WAESvJ,GAAyB6kC,GAAc,CAChDloB,aACA6J,eACA/gF,UACA8jE,WAESwO,GAAsBmtB,GAAW,CAC1CvoB,aACAjjH,OAAM,IACN+rC,UACA8jE,WAESlK,GAAwB8lC,GAAa,CAC9C3e,eACA/gF,UACA8jE,WAES,GAAwBi8B,GAAa,CAC9C1e,eACArhF,UACA8jE,WAES7J,GAAoBgmC,GAAS,CACtC5e,eACAN,eACA/gF,UACA8jE,WAES,IAAwB,QAAa,CAC9Cn/D,aACA3E,UACA8jE,WAES4O,GAAsBwtB,GAAW,CAC1C7e,eACAC,gBACAthF,UACA8jE,WAESphB,GAA0B89C,GAAe,CAClDtpB,aACAmK,eACAC,gBACArtH,OAAM,IACN+rC,UACA8jE,WAESgP,GAAsB8tB,GAAW,CAC1C1pB,aACAjjH,OAAM,IACN+rC,UACA8jE,WAESkP,GAAyBguB,GAAc,CAChDr8F,aACA3E,UACA8jE,WAESplH,GAAsBuiJ,GAAW,CAC1CjhG,UACA/rC,OAAM,IACN6vG,WAES,IAAwB,QAAa,CAC9C9jE,UACA8jE,WAESqP,GAAuB+tB,GAAY,CAC5ChqB,aACAjjH,OAAM,IACN+rC,UACA8jE,WAES+Q,GAAqBusB,GAAU,CACxC1sB,UACA5Q,WAESzvH,GAAuBstJ,GAAY,CAC5CzqB,aACAmK,eACAN,eACA/gF,UACA8jE,SACAqP,WAESha,GAA2B2oC,GAAgB,CACpDzgB,eACAN,eACA/gF,UACA8jE,SACAqP,WAES9Z,GAA+B2oC,GAAoB,CAC5D3gB,eACAN,eACA/gF,UACA8jE,SACAqP,WAES1mC,GAAyBw1D,GAAc,CAChD/qB,aACAmK,eACAlwC,YACAl9E,OAAM,IACN8sH,eACA/gF,UACA8jE,WAES4P,GAA6BwuB,GAAkB,CACxDliG,UACA8jE,WAEStK,GAAyB2oC,GAAc,CAChD9gB,eACAptH,OAAM,IACN+rC,UACA8jE,WAESrK,GAAwB2oC,GAAa,CAC9C/gB,eACAptH,OAAM,IACN+rC,UACA8jE,WAESvK,GAAyB8oC,GAAc,CAChDhhB,eACAptH,OAAM,IACN8sH,eACA/gF,UACA8jE,WAESyd,GAAsCghB,GAAgC,CAC/ElhB,eACA7nB,aAESgoB,GAA+BmhB,GAAyB,CACjElpC,UACAD,aAES8C,GAAwBonC,GAAa,CAC9CpiB,gBACAxd,WAEStI,GAAuBmoC,GAAY,CAC5CzsB,aACAnuD,WACA90D,OAAM,IACN6vG,WAESlzE,GAAuBizG,GAAY,CAC5C3sB,aACAmK,eACAN,eACA/gF,UACA8jE,WAES7H,GAAqB8nC,GAAU,CACxC7sB,aACApT,WAESlsH,GAAqBosJ,GAAU,CACxC3iB,eACAC,gBACAJ,aACAH,eACA/gF,UACA8jE,WAES9wE,GAAqBkxG,GAAU,CACxChjB,aACArmB,QACAmmB,kBACAtiI,QACAolH,WAESyO,GAA6B0yB,GAAkB,CACxD/jB,aACA/lB,gBACAx2D,aACAykC,cACAC,cACAowB,UACAqK,WAESn9B,GAAwBu+D,GAAa,CAC9CphC,WAESzuH,GAAqB8vJ,GAAU,CACxCrhC,WAESxwH,GAAuB8xJ,GAAY,CAC5CnxI,OAAM,IACN8sH,eACA/gF,UACA3rD,SACAyvH,WAESj0G,GAA0By1I,GAAe,CAClDpkB,aACAluF,OACA+tF,eACA/gF,UACAghF,kBACAld,WAES9K,GAA6BquC,GAAkB,CACxDtmB,eACA/gF,UACAghF,kBACAld,WAES1+F,GAAoBkiI,GAAS,CACtCxjC,WAESh1C,GAAyBy4E,GAAc,CAChDvnG,UACA8jE,WAESr7G,GAAwBi/I,GAAa,CAC9CzzI,OAAM,IACN+rC,YAESkzE,GAAyB40B,GAAc,CAChD9nG,UACA8jE,WAES5K,GAAoB6uC,GAAS,CACtC/nG,UACA8jE,WAES9wH,GAAqBg1J,GAAU,CACxCj/E,WACA90D,OAAM,IACNi6G,SAAQ,GACRxrB,YACA1iD,UACAnwC,YACA7b,UACA8vH,WAESlL,GAAwB0vC,GAAa,CAC9CjnB,eACAN,eACA/gF,UACAhtD,OACA8wH,WAES1K,GAAiCmvC,GAAsB,CAChElnB,eACAN,eACA/gF,UACA8jE,SACAqP,WAESM,GAAgC+0B,GAAqB,CAC9D/7D,WACAq3B,WAES8P,GAA2Bu1B,GAAgB,CACpDz1B,eACA/sC,UACAm9B,WAESnK,GAA0ByvC,GAAe,CAClD/nB,eACAptH,OAAM,IACN+rC,UACA8jE,WAESiP,GAAiCs2B,GAAsB,CAChE58D,WACA14F,MAAK,GACL+gI,aACAhR,WAESic,GAAuB2pB,GAAiB,CACjDnoB,0BAES3lB,GAAuBkuC,GAAY,CAC5C5yB,aACAnuD,WACA90D,OAAM,IACN6vG,WAESj5B,GAAqBk/D,GAAU,CACxCjmC,WAESgQ,GAA+Bk2B,GAAoB,CAC5D3oB,eACAtB,SACAtM,kBACA/0H,QACAg7D,OAAM,GACNoqD,WAESkQ,GAA8Bq2B,GAAmB,CAC1DhpB,eACAtB,SACAtM,kBACA/0H,QACAg7D,OAAM,GACNoqD,WAESoQ,GAAiCo2B,GAAsB,CAChEvqB,SACAtM,kBACA/0H,QACAg7D,OAAM,GACNoqD,WAESsQ,GAAyBm2B,GAAc,CAChD92B,kBACA3P,WAESzsH,GAAuBmzJ,GAAY,CAC5C5yJ,OACAooD,UACA8jE,WAES0Q,GAA6Bk2B,GAAkB,CACxD9yJ,OACA60F,WACA58E,YACAkjH,mBACAjP,WAESxO,GAAuB42C,GAAY,CAC5Ch1B,aACAnuD,WACA90D,OAAM,IACN+sH,kBACAhuI,OACA8wH,WAES1H,GAA2BmwC,GAAgB,CACpDr1B,aACApT,WAESuO,GAAqBq6B,GAAU,CACxC3rB,eACA/gF,UACA8jE,WAEShK,GAAuB6yC,GAAY,CAC5CtrB,eACAN,eACA/gF,UACA8jE,WAES+O,GAAsB+5B,GAAW,CAC1C5sG,UACAghF,kBACAld,WAESrL,GAA2Bq0C,GAAgB,CACpD9sG,UACA8jE,WAES3H,GAAyBgxC,GAAc,CAChD/wC,aACA8R,SAAQ,GACRl6H,YAES+lH,GAAqB0zC,GAAU,CACxC1sB,eACA/gF,UACAhyB,OACA81F,SACAqP,WAESzZ,GAA2Bg0C,GAAgB,CACpDrsB,eACAptH,OAAM,IACN+rC,UACA8jE,WAES3wH,GAAsBw6J,GAAW,CAC1ClhE,WACAgnC,kBACAzzE,UACA8jE,WAES,IAAqB,QAAU,CACxC7vG,OAAM,IACNkoG,WACA3C,WACAsK,WAESjI,GAAqBoyC,GAAU,CACxC/2B,aACApT,WAESiQ,GAA6Bm6B,GAAkB,CACxD7sB,eACAtB,SACAtM,kBACA/0H,QACAg7D,OAAM,GACNoqD,WAESqQ,GAA6Bg6B,GAAkB,CACxDpuB,SACAtM,kBACA/0H,QACAg7D,OAAM,GACNoqD,WAES1wH,GAAuBm7J,GAAY,CAC5CxuB,SACAjc,WAES,IAAqB,QAAU,CACxClsH,OACAqc,OAAM,IACNkoG,WACA2H,WAESnL,GAA2B61C,GAAgB,CACpDl5C,SACAwO,WAESwP,GAA8Bm7B,GAAmB,CAC1D91C,aACAmL,WAESjiG,GAAsB6sI,GAAW,CAC1Cz6I,OAAM,IACN8sH,eACA/gF,UACA3rD,SACAyvH,WAESl3B,GAA0B+hE,GAAe,CAClDttB,eACAH,aACAH,eACA/gF,UACA8jE,SACAhL,gBAESgC,GAAuB+zC,GAAY,CAC5C7uG,UACAnwC,YACA+8E,YACAk3B,WAES,IAAuB,QAAY,CAC5C1H,aACAp8D,UACA/rC,OAAM,IACNwlG,UACAE,YACAH,WACAE,aACAoK,WAES,IAAqB,QAAU,CACxCic,SACA//E,UACAv7B,MAAK,GACLq/F,WAES/2B,GAAsBiiE,GAAW,CAC1C/6I,OAAM,IACN+sH,kBACA7kB,WACA2H,WAESxK,GAAuB61C,GAAY,CAC5C9tB,eACAN,eACA/gF,UACA8jE,WAES,IAAqB,QAAU,CACxC7vG,OAAM,IACNwlG,UACA0C,WACA2H,WAES+P,GAA8Bu7B,GAAmB,CAC1D/tB,eACAtB,SACAtM,kBACA/0H,QACAg7D,OAAM,GACNoqD,WAESuQ,GAAkCg7B,GAAuB,CAClEtvB,SACAhpI,OAAM,GACN+8H,iBACAp1H,QACAg7D,OAAM,GACNoqD,WAES1J,GAAqBk1C,GAAU,CACxCvmF,WACAlnD,QACAvuB,SACA0sD,UACA8jE,WAES,IAAwB,QAAa,CAC9Cic,SACA//E,UACAv7B,MAAK,GACLq/F,WAES,IAAsB,QAAW,CAC1C9jE,UACAhsD,UACA44F,YACAk3B,WAESpL,GAA4B62C,GAAiB,CACtD10C,QACApC,aACAqL,WAES6P,GAA2B67B,GAAgB,CACpDl2C,SACAwK,WAESmQ,GAA6By7B,GAAkB,CACxD3vB,SACAtM,kBACA/0H,QACAg7D,OAAM,GACNoqD,WAES9J,GAAqB21C,GAAU,CACxCtuB,eACArhF,UACA8jE,WAESqd,GAA8ByuB,GAAmB,CAC1DzzC,WACA2H,WAEStJ,GAA0Bq1C,GAAe,CAClD9mF,WACA90D,OAAM,IACNktH,gBACArd,WAES8N,GAAwB2+B,GAAa,CAC9ClvB,eACAF,gBACAJ,eACA/gF,UACAghF,kBACAp0C,YACAk3B,WAES+N,GAA2Bm/B,GAAgB,CACpD3vB,eACAF,gBACAJ,eACA/gF,UACAghF,kBACAp0C,YACAk3B,WAES2d,GAAqBowB,GAAe,CAC7CrwB,iBACAN,aACAH,iBAESzM,GAA0B+9B,GAAe,CAClDtyB,SACAhpI,OAAM,GACNi9H,gBACAK,oBACA31H,QACAg7D,OAAM,GACNoqD,WAESgO,GAAqBwgC,GAAU,CACxCjxB,eACAI,OACAH,gBACAjsI,OACA6rI,aACAC,gBACAJ,eACAtnB,UACAz5D,UACAghF,kBACAp0C,YACAk3B,SACAhL,gBAESmZ,GAAqB+mC,GAAU,CACxC13B,gBACAjsI,OACAuC,OACAupI,gBACA1nB,UACAE,YACA9pG,YACA+8E,YACA6rB,aACAqL,WAES/I,GAAqBq+C,GAAU,CACxCtnC,OACA9xE,UACAnwC,YACA+8E,YACAk3B,SACAhL,gBAESxlB,GAA0BkmE,GAAe,CAClDnkK,OACA6rI,aACAC,gBACAH,kBACA1vI,QACAs7F,YACAk3B,SACAhL,gBAES8B,GAA4B8gD,GAAiB,CACtDx6B,aACA/lB,gBACAgmB,gBACAxoB,aACAh0D,aACAykC,cACAqwB,UACAunB,kBACAhuI,OACA45F,YACAk3B,WAESnJ,GAAyBohD,GAAc,CAChD76B,aACA/lB,gBACAgmB,gBACAx8E,aACAykC,cACA43C,kBACAld,WAES7+C,GAAuB+2F,GAAY,CAC5CjvE,QACAruF,QACAolH,WAESxtH,GAAqB2lK,GAAU,CACxClzF,WACA90D,OAAM,IACNktH,gBACArd,WAES7K,GAA2BijD,GAAgB,CACpD76B,eACAF,gBACAJ,eACA/gF,UACA8jE,WAESqO,GAA2BgqC,GAAgB,CACpD96B,eACAF,gBACAJ,eACA/gF,UACAghF,kBACAp0C,YACAk3B,WAES30B,GAAuBmtE,GAAY,CAC5CjnK,OACA6rI,aACAC,gBACA93C,cACA23C,kBACAxnB,WACAloH,QACAwyH,WAESsO,GAAoBmqC,GAAS,CACtCr7B,aACA7kB,QAAO,GACPxB,QACAsmB,gBACA7nB,SACA5W,YACA/b,UACA3mC,UACAghF,kBACAtzC,QACAp8F,QACAs7F,YACAk3B,SACAhL,cACAqa,WAESlY,GAAqBiiD,GAAU,CACxC7nK,OACA6rI,aACAnmB,OACAomB,gBACAz+B,YACA1iD,UACAnwC,YACAi0G,SACAhL,gBAESkC,GAAsB2iD,GAAW,CAC1CtoK,OACAuC,OACA8qG,YACAuY,OACAprG,YACAi0G,WAESj9B,GAAwB23E,GAAa,CAC9Cr9B,gBACAJ,eACA9lB,OACAj7D,UACAnwC,YACAi0G,WAES,IAAsB,QAAW,CAC1ClsH,OACAivF,UACAi9B,WAES,IAA0B,QAAe,CAClDlsH,OACApM,MAAK,GACLq7F,UACA9yF,MAAK,GACL8b,YACA+8E,YACAk3B,WAESsP,GAA8BqrC,GAAmB,CAC1D53E,UACAoyB,aACA6b,aACAx+H,OACA0pD,UACAnwC,YACApd,IAAG,GACHqxH,WAESpJ,GAA6BqkD,GAAkB,CACxD79B,aACAv8E,aACAykC,cACAwxB,cACAkJ,WAESzJ,GAAuB2kD,GAAY,CAC5Cj2F,WACA90D,OAAM,IACNktH,gBACA7qI,OACAwtH,WAES+C,GAAsBs4C,GAAgB,CAC/CjoC,aACAnuD,WACAooB,YACA97F,OACA6rI,aACAjtH,OAAM,IACNktH,gBACA7nB,SACAc,OACAsa,UACAI,aACAkM,kBACAhtI,UACAhB,OACAqB,SACAu4F,cAESqhC,GAA4BupD,GAAiB,CACtD3wD,QACA/C,WAES8O,GAAsB6kD,GAAW,CAC1CpiL,OACAuC,OACAspI,aACAv3D,QACAyyC,aACAnoG,OAAM,IACNjU,OACAs5G,SACA2B,OACAj7D,UACAnwC,YACAmxH,kBACA9gI,OACA0sF,YACAk3B,WAESn9G,GAA2BqzK,GAAgB,CACpD3kL,OACAuC,OACAspI,aACAjtH,OAAM,IACNktH,gBACAJ,eACA/gF,UACAnwC,YACAmxH,kBACAxnB,WACA5sB,YACAk3B,WAES,IAAqB,QAAU,CACxCxyH,QACAwyH,SACAxI,SAAQ,KAECgV,GAA4B2W,GAAiB,CACtD/P,aACArQ,QACA5yG,OAAM,MAEGi7G,GAA8B0W,GAAmB,CAC1D1O,aACArQ,QACA5yG,OAAM,MAEGu8G,GAA2B2W,GAAgB,CACpDjQ,aACArQ,QACA5yG,OAAM,MAEGk7G,GAAoC0W,GAAyB,CACtE3O,aACArQ,QACA5yG,OAAM,MAEG87G,GAA8B2W,GAAmB,CAC1DxP,aACArQ,QACA5yG,OAAM,MAEGy7G,GAA8B0W,GAAmB,CAC1DlP,aACArQ,QACA5yG,OAAM,MAEGw8G,GAAyB2W,GAAc,CAChDlQ,aACArQ,QACA5yG,OAAM,MAEGy8G,GAAgC2W,GAAqB,CAC9DnQ,aACArQ,QACA5yG,OAAM,MAEGy6G,GAAqC0W,EAA0B,CACxElO,aACArQ,QACA5yG,OAAM,MAEG47G,GAA+B2W,GAAoB,CAC5DtP,aACArQ,QACA5yG,OAAM,MAEGs7G,GAA0B0W,GAAe,CAClD/O,aACArQ,QACA5yG,OAAM,MAEG46G,GAAkC0W,EAAuB,CAClErO,aACArQ,QACA5yG,OAAM,MAEGk9G,GAA2B2W,GAAgB,CACpD5Q,aACArQ,QACA5yG,OAAM,MAEG48G,GAAqC2W,GAA0B,CACxEtQ,aACArQ,QACA5yG,OAAM,MAEG+7G,GAA6B2W,GAAkB,CACxDzP,aACArQ,QACA5yG,OAAM,MAEGw9G,GAA8B2W,GAAmB,CAC1DlR,aACArQ,QACA5yG,OAAM,MAEGq9G,GAA8B2W,GAAmB,CAC1D/Q,aACArQ,QACA5yG,OAAM,MAEGy9G,GAAmC2W,GAAwB,CACpEnR,aACArQ,QACA5yG,OAAM,MAEG67G,GAA4B2W,GAAiB,CACtDvP,aACArQ,QACA5yG,OAAM,MAEG26G,GAAuC0W,EAA4B,CAC5EpO,aACArQ,QACA5yG,OAAM,MAEG+8G,GAAiC2W,GAAsB,CAChEzQ,aACArQ,QACA5yG,OAAM,MAEGg9G,GAAiC2W,GAAsB,CAChE1Q,aACArQ,QACA5yG,OAAM,MAEG86G,GAAiC0W,GAAsB,CAChEvO,aACArQ,QACA5yG,OAAM,MAEGi+G,GAAwB2qD,GAAa,CAC9Cx7C,eACAF,gBACAJ,eACA/gF,UACAghF,kBACAp0C,YACAk3B,WAESxJ,GAAsBwiE,GAAW,CAC1CznL,OACAuC,OACAijH,QACAnC,cACAka,QACAmO,eACAtnB,UACAz5D,UACAnwC,YACA7c,OACAwmH,WACAloH,QACAwyH,WAESiO,GAAyBosD,GAAc,CAChD98C,eACAzP,UACAE,OACA9xE,UACAiyE,OACAnO,SACAoO,YAEShX,GAAuBojE,GAAY,CAC5CjpL,OACAuC,OACA8qG,YACAuY,OACAngH,IAAG,GACH+U,YACAnR,QACApN,QACAs7F,YACAk3B,WAESuP,GAA6BsrD,GAAkB,CACxD/mL,OACAivF,UACA8xB,aACAh0D,aACA0kC,cACAx5E,YACAi0G,WAESyM,GAA0B2W,GAAe,CAClDhQ,aACArQ,QACA5yG,OAAM,MAEGw7G,GAAyC0W,GAA8B,CAChFjP,aACArQ,QACA5yG,OAAM,MAEG66G,GAAkC0W,EAAuB,CAClEtO,aACArQ,QACA5yG,OAAM,MAEG07G,GAA+B0W,GAAoB,CAC5DnP,aACArQ,QACA5yG,OAAM,MAEGo9G,GAAyB2W,GAAc,CAChD9Q,aACArQ,QACA5yG,OAAM,MAEG08G,GAA2B2W,GAAgB,CACpDpQ,aACArQ,QACA5yG,OAAM,MAEGm9G,GAA8B2W,GAAmB,CAC1D7Q,aACArQ,QACA5yG,OAAM,MAEGq7G,GAAiC0W,GAAsB,CAChE9O,aACArQ,QACA5yG,OAAM,MAEGs9G,GAA4B2W,GAAiB,CACtDhR,aACArQ,QACA5yG,OAAM,MAEGg8G,GAAsC2W,GAA2B,CAC1E1P,aACArQ,QACA5yG,OAAM,MAEGw6G,GAA8ByW,EAAmB,CAC1DhO,aACArQ,QACA5yG,OAAM,MAEGi9G,GAAkC2W,GAAuB,CAClE3Q,aACArQ,QACA5yG,OAAM,MAEGg/G,GAAgC4rD,GAAqB,CAC9D3nD,aACAmK,eACAC,gBACAJ,aACAjtH,OAAM,IACNjU,OACAggD,UACAghF,kBACA1mB,QACAp6G,OACA4jH,SACAhL,gBAESz9D,GAAwBskI,GAAa,CAC9C/nL,OACA60F,WACA5F,UACAksC,mBACAjP,WAES0L,GAA4B0W,GAAiB,CACtDhP,aACArQ,QACA5yG,OAAM,MAEGg7G,GAAkC0W,GAAuB,CAClEzO,aACArQ,QACA5yG,OAAM,MAEGm7G,GAA2C0W,GAAgC,CACpF5O,aACArQ,QACA5yG,OAAM,MAEG68G,GAA6B2W,GAAkB,CACxDvQ,aACArQ,QACA5yG,OAAM,MAEGu9G,GAA4B2W,GAAiB,CACtDjR,aACArQ,QACA5yG,OAAM,MAEGk8G,GAAqC2W,GAA0B,CACxE5P,aACArQ,QACA5yG,OAAM,MAEGzE,GAAwBuwK,GAAa,CAC9ClwK,YACAojH,kBACAnP,WAESyQ,GAAqB4rD,GAAU,CACxC9qL,OACA1C,OACA0oD,UACAuxC,YACAk3B,WAESkL,GAAyB0W,GAAc,CAChDxO,aACArQ,QACA5yG,OAAM,MAEGo7G,GAAqC0W,GAA0B,CACxE7O,aACArQ,QACA5yG,OAAM,MAEGi8G,GAAyB2W,GAAc,CAChD3P,aACArQ,QACA5yG,OAAM,MAEG1f,GAAsB+rL,GAAmB,CAClDz5D,QACA/C,WAES8M,GAA6B2W,GAAkB,CACxDrQ,aACArQ,QACA5yG,OAAM,MAEG06G,GAAgC0W,EAAqB,CAC9DnO,aACArQ,QACA5yG,OAAM,O,4BCt+CD,SAAS80H,EAAe63C,EAAQC,EAAUC,GAC/C,KAAMz1L,gBAAgB09I,GACpB,MAAM,IAAIpgE,YAAY,oDAGxBt9E,KAAKu1L,OAASA,EACdv1L,KAAKw1L,SAAWA,EAChBx1L,KAAKy1L,SAAWA,EAChBz1L,KAAK0lB,QAAU,wBAA0B9mB,MAAMoF,QAAQuxL,GAAU,IAAMA,EAAOnkK,KAAK,MAAQ,IAAMmkK,GAAU,KAAOv1L,KAAKy1L,UAAY,MAAQ,KAAO72L,MAAMoF,QAAQwxL,GAAY,IAAMA,EAASpkK,KAAK,MAAQ,IAAMokK,GAAY,IAC1Nx1L,KAAK8zE,OAAQ,IAAI3nE,OAAQ2nE,M,iBAE3B4pE,EAAe18I,UAAY,IAAImwJ,WAC/BzT,EAAe18I,UAAU2C,YAAcwtJ,WACvCzT,EAAe18I,UAAU0E,KAAO,iBAChCg4I,EAAe18I,UAAU00L,kBAAmB,G,4BCbrC,SAASn8D,EAAWxxH,EAAOyqB,EAAK/iB,GACrC,KAAMzP,gBAAgBu5H,GACpB,MAAM,IAAIj8C,YAAY,oDAGxBt9E,KAAK+H,MAAQA,EAET7H,UAAUzB,OAAS,GACrBuB,KAAKwyB,IAAM,EACXxyB,KAAKyP,IAAM+iB,IAEXxyB,KAAKwyB,IAAMA,EACXxyB,KAAKyP,IAAMA,QAGIpP,IAAbL,KAAKwyB,KAAqBxyB,KAAK+H,MAAQ/H,KAAKwyB,IAC9CxyB,KAAK0lB,QAAU,uBAAyB1lB,KAAK+H,MAAQ,MAAQ/H,KAAKwyB,IAAM,SAClDnyB,IAAbL,KAAKyP,KAAqBzP,KAAK+H,OAAS/H,KAAKyP,IACtDzP,KAAK0lB,QAAU,uBAAyB1lB,KAAK+H,MAAQ,OAAS/H,KAAKyP,IAAM,GAAK,IAE9EzP,KAAK0lB,QAAU,uBAAyB1lB,KAAK+H,MAAQ,IAGvD/H,KAAK8zE,OAAQ,IAAI3nE,OAAQ2nE,M,iBAE3BylD,EAAWv4H,UAAY,IAAImwJ,WAC3B53B,EAAWv4H,UAAU2C,YAAcwtJ,WACnC53B,EAAWv4H,UAAU0E,KAAO,aAC5B6zH,EAAWv4H,UAAUs4H,cAAe,G,yFClChC5zH,EAAO,QACPwhH,EAAe,CAAC,QAAS,aAClByuE,GAA6B,QAAQjwL,EAAMwhH,GAAeliB,IACnE,IAAI,MACFyzB,EAAK,UACLn/D,GACE0rC,EAkCJ,OAAOyzB,EAAM/yH,EAAM,CACjB,+CAAgD,SAA4CqsK,EAAKv+B,EAAKnwG,GACpG,IAAKi2B,EAAUk6E,GACb,MAAM,IAAI/yI,UAAU,yCAGtB,IAAI4S,EAAOzU,MAAMoF,QAAQ+tK,IAAO,QAAUA,GAAOA,EAAI1+J,OAErD,GAAImgI,EAAM,GAAKA,GAAOngI,EAAK5U,OACzB,MAAM,IAAI,IAAW+0I,EAAKngI,EAAK5U,QAGjC,OAAI,QAASszK,GACJA,EAAIruK,OAAOkyL,EAAO7jB,EAAI9wK,UAAWuyI,EAAKnwG,IAEtCuyJ,EAAO7jB,EAAKv+B,EAAKnwG,SAchC,SAASuyJ,EAAO7jB,EAAKv+B,EAAKnwG,GACxB,IAAI3kC,EAAGsJ,EAAK6tL,EAEZ,GAAIriD,GAAO,EAAG,CACZ,GAAK50I,MAAMoF,QAAQ+tK,EAAI,IAEhB,CAIL,IAHA8jB,EA2BN,SAAiB9jB,GACf,IAEIrzK,EAAG8I,EAFH2xI,EAAI44B,EAAItzK,OACR86J,EAAIwY,EAAI,GAAGtzK,OAEXuJ,EAAM,GAEV,IAAKR,EAAI,EAAGA,EAAI+xJ,EAAG/xJ,IAAK,CACtB,IAAInB,EAAM,GAEV,IAAK3H,EAAI,EAAGA,EAAIy6I,EAAGz6I,IACjB2H,EAAI7E,KAAKuwK,EAAIrzK,GAAG8I,IAGlBQ,EAAIxG,KAAK6E,GAGX,OAAO2B,EA3CI8tL,CAAQ/jB,GACf/pK,EAAM,GAEDtJ,EAAI,EAAGA,EAAIm3L,EAAKp3L,OAAQC,IAC3BsJ,EAAItJ,GAAKk3L,EAAOC,EAAKn3L,GAAI80I,EAAM,EAAGnwG,GAGpC,OAAOr7B,EATP,OAAOq7B,EAAS0uI,GAclB,IAFA/pK,EAAM,GAEDtJ,EAAI,EAAGA,EAAIqzK,EAAItzK,OAAQC,IAC1BsJ,EAAItJ,GAAKk3L,EAAO7jB,EAAIrzK,GAAI80I,EAAM,EAAGnwG,GAGnC,OAAOr7B,I,+EC7FPtC,EAAO,SACPwhH,EAAe,CAAC,QAAS,QAAS,SAAU,SACrC6uE,GAA8B,QAAQrwL,EAAMwhH,GAAeliB,IACpE,IAAI,MACFyzB,EAAK,MACLic,EAAK,OACL//E,EAAM,MACNv7B,GACE4rE,EAuBJ,OAAOyzB,EAAM/yH,EAAM,CACjB,iBAAkBswL,EAClB,gBAAiB,SAAqBv2L,EAAO8yC,GAC3C,OAAOyjJ,EAAQrhI,GAAO,QAAMl1D,IAAS8yC,GAAQtxC,aAUjD,SAAS+0L,EAAQv2L,EAAO8yC,GAEtB,GAA4B,IAAxB9yC,EAAM4T,OAAO5U,OACf,MAAM,IAAI0N,MAAM,6CAGlB,QAAcomC,EAAQ9yC,EAAM4T,OAAO,IACnC,IAAI4iL,EAAW78J,EAAM,EAAG35B,EAAM4T,OAAO,IACjCtL,EAAQ,IAAI2sI,EAAMuhD,EAAU1jJ,GAChC,OAAO9yC,EAAM4uE,OAAOtmE,Q,6GClDpBrC,EAAO,SACPwhH,EAAe,CAAC,QAAS,SAAU,aAC5BgvE,GAA8B,QAAQxwL,EAAMwhH,GAAeliB,IACpE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,UACN2E,GACE0rC,EA+BJ,OAAOyzB,EAAM/yH,EAAM,CAEjB,yCAA0C,SAAoCzF,GAC5E,IAAIvB,EAIAy3L,EAHA33L,EAAMyB,EAAKxB,OACX+0I,GAAO,EAGP+oB,GAAW,EACX65B,EAAW,GAEf,IAAK13L,EAAI,EAAGA,EAAIF,EAAKE,IAAK,CACxB,IAAIa,EAAMU,EAAKvB,GAMf,IAJI,QAASa,KACXg9J,GAAW,IAGT,QAASh9J,KAAQ,QAAYA,GAAM,CACrC,GAAIb,IAAMF,EAAM,EACd,MAAM,IAAI2N,MAAM,gDAOlB,GAHAgqL,EAAU3iD,EACVA,EAAMj0I,EAAI0B,WAELq4D,EAAUk6E,GACb,MAAM,IAAI/yI,UAAU,yCAGtB,GAAI+yI,EAAM,GAAK90I,EAAI,GAAK80I,EAAM2iD,EAE5B,MAAM,IAAI,IAAW3iD,EAAK2iD,EAAU,OAEjC,CAEL,IAAI/lL,GAAI,QAAM7Q,GAAK0B,UACfoS,GAAO,QAAUjD,GAKrB,GAJAgmL,EAAS13L,GAAK0R,EACd+lL,EAAU3iD,EACVA,EAAMngI,EAAK5U,OAAS,EAEhBC,EAAI,GAAK80I,IAAQ2iD,EACnB,MAAM,IAAI,IAAeA,EAAU,EAAG3iD,EAAM,IAKlD,GAAwB,IAApB4iD,EAAS33L,OACX,MAAM,IAAI6+E,YAAY,gCAKxB,IAFA,IAAI7K,EAAM2jH,EAASx3F,QAEZw3F,EAAS33L,QACdg0E,EAAM4jH,EAAQ5jH,EAAK2jH,EAASx3F,QAAS40C,EAAK,GAG5C,OAAO+oB,EAAW5nG,EAAO8d,GAAOA,GAElC,YAAa,SAAgBxyE,GAC3B,OAAOA,EAAKmxB,KAAK,UAevB,SAASilK,EAAQ90L,EAAGmG,EAAG4uL,EAAW9iD,GAChC,GAAIA,EAAM8iD,EAAW,CAEnB,GAAI/0L,EAAE9C,SAAWiJ,EAAEjJ,OACjB,MAAM,IAAI,IAAe8C,EAAE9C,OAAQiJ,EAAEjJ,QAKvC,IAFA,IAAIiO,EAAI,GAEChO,EAAI,EAAGA,EAAI6C,EAAE9C,OAAQC,IAC5BgO,EAAEhO,GAAK23L,EAAQ90L,EAAE7C,GAAIgJ,EAAEhJ,GAAI43L,EAAW9iD,EAAM,GAG9C,OAAO9mI,EAGP,OAAOnL,EAAEmK,OAAOhE,K,+ECtIhBhC,EAAO,OACPwhH,EAAe,CAAC,QAAS,SAAU,WAAY,UACxCqvE,GAA4B,QAAQ7wL,EAAMwhH,GAAeliB,IAClE,IAAI,MACFyzB,EAAK,OACL9jE,EAAM,SACN4sC,EAAQ,OACR54F,GACEq8F,EAgDJ,OAAOyzB,EAAM/yH,EAAM,CACjB,iBAAkB,SAAqBnH,GAErC,OAAI,QAASA,GACJo2D,EAAO6hI,EAAMj4L,EAAIw1I,YAEjByiD,EAAMj4L,IAGjB,yBAA0B,SAA2BA,EAAKi1I,GACxD,KAAK,OAAUA,GAAM,MAAM,IAAI2d,WAAW,oCAE1C,OAAI,QAAS5yJ,GACJo2D,EAAO8hI,EAAWl4L,EAAIw1I,UAAWP,IAEjCijD,EAAWl4L,EAAKi1I,IAG3B,4BAA6B,SAA8Bj1I,EAAKi1I,GAC9D,OAAOxzI,KAAKzB,EAAKoK,EAAO6qI,OAY5B,SAASijD,EAAWl4L,EAAKi1I,GAKvB,IAJI,QAASj1I,KACXA,EAAMA,EAAIw1I,YAGPn1I,MAAMoF,QAAQzF,GACjB,MAAM4yJ,WAAW,mDAGnB,GAAI3d,EAAM,EAAG,CACX,IAAIhoH,EAAS,GAIb,OAHAjtB,EAAIwe,SAAQ6Q,IACVpC,EAAOhqB,KAAKi1L,EAAW7oK,EAAS4lH,EAAM,OAEjChoH,EACF,GAAY,IAARgoH,EACT,OAAOgjD,EAAMj4L,GAEb,MAAM4yJ,WAAW,kCAWrB,SAASqlC,EAAMj4L,GACb,IAAIitB,EAAS,GACTnY,EAAO9U,EAAIE,OAEf,GAAI4U,EAAO,EACT,OAAO9U,EAGT,IAAK,IAAIG,EAAI,EAAGA,EAAI2U,EAAM3U,IACxB8sB,EAAOhqB,KAAKk1L,EAAan4L,EAAIG,EAAI,GAAIH,EAAIG,KAG3C,OAAO8sB,EAWT,SAASkrK,EAAaC,EAAMC,IAEtB,QAASD,KAAOA,EAAOA,EAAK5iD,YAC5B,QAAS6iD,KAAOA,EAAOA,EAAK7iD,WAChC,IAAI8iD,EAAcj4L,MAAMoF,QAAQ2yL,GAC5BG,EAAcl4L,MAAMoF,QAAQ4yL,GAEhC,GAAIC,GAAeC,EACjB,OAkBJ,SAAoBhsL,EAAMnM,GACxB,GAAImM,EAAKrM,SAAWE,EAAKF,OACvB,MAAM0yJ,WAAW,2CAMnB,IAHA,IAAI3lI,EAAS,GACTnY,EAAOvI,EAAKrM,OAEPC,EAAI,EAAGA,EAAI2U,EAAM3U,IACxB8sB,EAAOhqB,KAAKk1L,EAAa5rL,EAAKpM,GAAIC,EAAKD,KAGzC,OAAO8sB,EA9BEurK,CAAWJ,EAAMC,GAG1B,IAAKC,IAAgBC,EACnB,OAAOv1F,EAASq1F,EAAMD,GAGxB,MAAMl2L,UAAU,oE,qEC3JhBiF,EAAO,QACPwhH,EAAe,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,YACvFvB,GAA6B,QAAQjgH,EAAMwhH,GAAeliB,IACnE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,OACN+rC,EAAM,UACNo8D,EAAS,QACT5C,EAAO,UACPE,EAAS,OACTD,EAAM,SACNE,GACEtpB,EA6CJ,OAAOyzB,EAAM/yH,EAAM,CAGjBw0G,OAAQ88E,EACR,kBAAmBA,EACnB,iBAAkB,SAAsBp3K,EAAOC,GAC7C,OAAOirF,EAAKmsF,EAASr3K,EAAOC,EAAK,KAEnC,yBAA0B,SAA4BD,EAAOC,EAAK4S,GAChE,OAAOq4E,EAAKmsF,EAASr3K,EAAOC,EAAK4S,KAEnC,0BAA2B,SAA6B7S,EAAOC,EAAKq3K,GAClE,OAAoBpsF,EAAbosF,EAAkBC,EAAUv3K,EAAOC,EAAK,GAAWo3K,EAASr3K,EAAOC,EAAK,KAEjF,kCAAmC,SAAmCD,EAAOC,EAAK4S,EAAMykK,GACtF,OAAoBpsF,EAAbosF,EAAkBC,EAAUv3K,EAAOC,EAAK4S,GAAcwkK,EAASr3K,EAAOC,EAAK4S,KAEpF,uBAAwB,SAA4B7S,EAAOC,GAEzD,OAAOirF,EAAKssF,EAAYx3K,EAAOC,EAAK,IAAIgsH,EADxBjsH,EAAMjc,aAC4B,MAEpD,kCAAmC,SAAqCic,EAAOC,EAAK4S,GAClF,OAAOq4E,EAAKssF,EAAYx3K,EAAOC,EAAK4S,KAEtC,gCAAiC,SAAmC7S,EAAOC,EAAKq3K,GAC9E,IAAIrrD,EAAYjsH,EAAMjc,YACtB,OAAoBmnG,EAAbosF,EAAkBG,EAAaz3K,EAAOC,EAAK,IAAIgsH,EAAU,IAAYurD,EAAYx3K,EAAOC,EAAK,IAAIgsH,EAAU,MAEpH,2CAA4C,SAA4CjsH,EAAOC,EAAK4S,EAAMykK,GACxG,OAAoBpsF,EAAbosF,EAAkBG,EAAaz3K,EAAOC,EAAK4S,GAAc2kK,EAAYx3K,EAAOC,EAAK4S,OAI5F,SAASq4E,EAAKvsG,GACZ,MAAsB,WAAlBqqB,EAAO+rC,OACFA,EAASA,EAAOp2D,IAAO,UAGzBA,EAGT,SAASy4L,EAAUp9K,EAAKs9K,GACtB,IAAI9yK,EAiJN,SAAgBxK,GACd,IAEIo9H,EAFOp9H,EAAIkT,MAAM,KAELxlB,KAAI,SAAU/H,GAE5B,OAAOsI,OAAOtI,MAMhB,GAJcy3I,EAAKz6H,MAAK,SAAU7L,GAChC,OAAOhI,MAAMgI,MAIb,OAAO,KAGT,OAAQsmI,EAAKv4I,QACX,KAAK,EACH,MAAO,CACLmhB,MAAOo3H,EAAK,GACZn3H,IAAKm3H,EAAK,GACVvkH,KAAM,GAGV,KAAK,EACH,MAAO,CACL7S,MAAOo3H,EAAK,GACZn3H,IAAKm3H,EAAK,GACVvkH,KAAMukH,EAAK,IAGf,QACE,OAAO,MAhLHsgD,CAAO19K,GAEf,IAAKwK,EACH,MAAM,IAAIk5D,YAAY,WAAa1jE,EAAM,uBAK3C,MAAsB,cAAlBgP,EAAOjgB,aACStI,IAAd0wH,IACF,UAIKjmB,GADFosF,EAAaG,EAAeD,GAClBrmE,EAAU3sG,EAAExE,OAAQmxG,EAAU3sG,EAAEvE,KAAMkxG,EAAU3sG,EAAEqO,SAG1Dq4E,GADFosF,EAAaC,EAAYF,GACf7yK,EAAExE,MAAOwE,EAAEvE,IAAKuE,EAAEqO,OAarC,SAASwkK,EAASr3K,EAAOC,EAAK4S,GAC5B,IAAI1sB,EAAQ,GACRS,EAAIoZ,EAER,GAAI6S,EAAO,EACT,KAAO07F,EAAQ3nH,EAAGqZ,IAChB9Z,EAAMvE,KAAKgF,GACXA,GAAKisB,OAEF,GAAIA,EAAO,EAChB,KAAO27F,EAAO5nH,EAAGqZ,IACf9Z,EAAMvE,KAAKgF,GACXA,GAAKisB,EAIT,OAAO1sB,EAYT,SAASoxL,EAAUv3K,EAAOC,EAAK4S,GAC7B,IAAI1sB,EAAQ,GACRS,EAAIoZ,EAER,GAAI6S,EAAO,EACT,KAAO47F,EAAU7nH,EAAGqZ,IAClB9Z,EAAMvE,KAAKgF,GACXA,GAAKisB,OAEF,GAAIA,EAAO,EAChB,KAAO67F,EAAS9nH,EAAGqZ,IACjB9Z,EAAMvE,KAAKgF,GACXA,GAAKisB,EAIT,OAAO1sB,EAYT,SAASqxL,EAAYx3K,EAAOC,EAAK4S,GAC/B,IAAI86H,EAAOx8B,EAAU,GACjBhrH,EAAQ,GACRS,EAAIoZ,EAER,GAAI6S,EAAKypE,GAAGqxD,GACV,KAAOp/B,EAAQ3nH,EAAGqZ,IAChB9Z,EAAMvE,KAAKgF,GACXA,EAAIA,EAAEmP,KAAK8c,QAER,GAAIA,EAAK0rE,GAAGovD,GACjB,KAAOn/B,EAAO5nH,EAAGqZ,IACf9Z,EAAMvE,KAAKgF,GACXA,EAAIA,EAAEmP,KAAK8c,GAIf,OAAO1sB,EAYT,SAASsxL,EAAaz3K,EAAOC,EAAK4S,GAChC,IAAI86H,EAAOx8B,EAAU,GACjBhrH,EAAQ,GACRS,EAAIoZ,EAER,GAAI6S,EAAKypE,GAAGqxD,GACV,KAAOl/B,EAAU7nH,EAAGqZ,IAClB9Z,EAAMvE,KAAKgF,GACXA,EAAIA,EAAEmP,KAAK8c,QAER,GAAIA,EAAK0rE,GAAGovD,GACjB,KAAOj/B,EAAS9nH,EAAGqZ,IACjB9Z,EAAMvE,KAAKgF,GACXA,EAAIA,EAAEmP,KAAK8c,GAIf,OAAO1sB,O,+ECrOPmhH,EAAe,CAAC,QAAS,QAAS,SAAU,SACrCqwE,GAA2B,QAF3B,MAEyCrwE,GAAeliB,IACjE,IAAI,MACFyzB,EAAK,MACLic,EAAK,OACL//E,EAAM,MACNv7B,GACE4rE,EAuBJ,OAAOyzB,EA/BE,MA+BU,CACjB,iBAAkB++D,EAClB,gBAAiB,SAAqB/3L,EAAOkqC,GAC3C,OAAO6tJ,EAAK7iI,GAAO,QAAMl1D,IAASkqC,GAAK1oC,aAU3C,SAASu2L,EAAK/3L,EAAOkqC,GAEnB,GAA4B,IAAxBlqC,EAAM4T,OAAO5U,OACf,MAAM,IAAI0N,MAAM,6CAGlB,QAAcw9B,EAAKlqC,EAAM4T,OAAO,IAChC,IAAIokL,EAAcr+J,EAAM,EAAG35B,EAAM4T,OAAO,IACpCtL,EAAQ,IAAI2sI,EAAM/qG,EAAK8tJ,GAC3B,OAAOh4L,EAAM4uE,OAAOtmE,Q,6GClDpBrC,EAAO,SACPwhH,EAAe,CAAC,QAAS,UAClBwwE,GAA8B,QAAQhyL,EAAMwhH,GAAeliB,IACpE,IAAI,MACFyzB,EAAK,OACL9jE,GACEqwC,EAoCJ,OAAOyzB,EAAM/yH,EAAM,CAEjB,eAAgB,SAAoBjG,EAAOsI,GACzC,IACIsmE,EADI1Z,EAAOl1D,GACA4uE,OAAOtmE,GAEtB,OAAOA,EAAM01I,WAAapvE,EAASA,EAAOptE,WAE5C,gBAAiB,SAAqBxB,EAAOsI,GAC3C,OAAOtI,EAAM4uE,OAAOtmE,IAEtB,gBAAiB4vL,EACjB,gBAAiBC,EAEjB,oBAAqB,SAAuBn4L,EAAOsI,EAAOmgH,GACxD,OAAOvzD,GAAO,QAAMl1D,IAAQ4uE,OAAOtmE,EAAOmgH,OAAa7nH,GAAWY,WAEpE,yBAA0B,SAA0BxB,EAAOsI,EAAOmgH,EAAajE,GAC7E,OAAOtvD,GAAO,QAAMl1D,IAAQ4uE,OAAOtmE,EAAOmgH,EAAajE,GAAchjH,WAEvE,qBAAsB,SAAwBxB,EAAOsI,EAAOmgH,GAC1D,OAAOzoH,EAAMwkG,QAAQ51B,OAAOtmE,EAAOmgH,IAErC,0BAA2B,SAA2BzoH,EAAOsI,EAAOmgH,EAAajE,GAC/E,OAAOxkH,EAAMwkG,QAAQ51B,OAAOtmE,EAAOmgH,EAAajE,IAElD,wBAAyB4zE,EACzB,gCAAiCA,EACjC,qBAAsBC,OAW1B,SAASF,EAAch+K,EAAK7R,GAC1B,KAAK,QAAQA,GAEX,MAAM,IAAItH,UAAU,kBAGtB,GAA4B,IAAxBsH,EAAMsL,OAAO5U,OACf,MAAM,IAAI,IAAesJ,EAAMsL,OAAO5U,OAAQ,GAIhD,IAAIs5L,EAASn+K,EAAInb,QACjB,QAAcsJ,EAAMyqB,MAAM,GAAIulK,IAC9B,QAAchwL,EAAM0H,MAAM,GAAIsoL,GAC9B,IAAI3+J,EAAQrxB,EAAM81I,UAAU,GACxB56G,EAAS,GAIb,OAHA7J,EAAMrc,SAAQ,SAAUpW,GACtBs8B,GAAUrpB,EAAImgF,OAAOpzF,MAEhBs8B,EAcT,SAAS40J,EAAcj+K,EAAK7R,EAAOmgH,EAAajE,GAC9C,IAAKl8G,IAA2B,IAAlBA,EAAMyoG,QAElB,MAAM,IAAI/vG,UAAU,kBAGtB,GAA4B,IAAxBsH,EAAMsL,OAAO5U,OACf,MAAM,IAAI,IAAesJ,EAAMsL,OAAO5U,OAAQ,GAGhD,QAAqB4B,IAAjB4jH,GACF,GAA4B,iBAAjBA,GAAqD,IAAxBA,EAAaxlH,OACnD,MAAM,IAAIgC,UAAU,kDAGtBwjH,EAAe,IAGjB,IAAI7qF,EAAQrxB,EAAM81I,UAAU,GAG5B,GAFUzkH,EAAM/lB,OAAO,KAEX60G,EAAYzpH,OACtB,MAAM,IAAI,IAAe26B,EAAM/lB,OAAO,GAAI60G,EAAYzpH,QAIxD,IAAIs5L,EAASn+K,EAAInb,QACjB,QAAcsJ,EAAMyqB,MAAM,KAC1B,QAAczqB,EAAM0H,MAAM,IAI1B,IAFA,IAAIuoL,EAAQ,GAEHt5L,EAAI,EAAGA,EAAIq5L,EAAQr5L,IAC1Bs5L,EAAMt5L,GAAKkb,EAAImgF,OAAOr7F,GAOxB,GAJA06B,EAAMrc,SAAQ,SAAUpW,EAAGjI,GACzBs5L,EAAMrxL,GAAKuhH,EAAYnuB,OAAOr7F,EAAE,OAG9Bs5L,EAAMv5L,OAASs5L,EACjB,IAAK,IAAIvzL,EAAKuzL,EAAS,EAAGptC,EAAOqtC,EAAMv5L,OAAQ+F,EAAKmmJ,EAAMnmJ,IACnDwzL,EAAMxzL,KACTwzL,EAAMxzL,GAAMy/G,GAKlB,OAAO+zE,EAAM5mK,KAAK,IAWpB,SAASumK,EAAmB50L,EAAQgF,GAClC,GAA4B,IAAxBA,EAAMsL,OAAO5U,OACf,MAAM,IAAI,IAAesJ,EAAMsL,OAAQ,GAGzC,IAAI/T,EAAMyI,EAAM81I,UAAU,GAE1B,GAAmB,iBAARv+I,EACT,MAAM,IAAImB,UAAU,2DAGtB,OAAO,QAAgBsC,EAAQzD,GAYjC,SAASw4L,EAAmB/0L,EAAQgF,EAAOmgH,GACzC,GAA4B,IAAxBngH,EAAMsL,OAAO5U,OACf,MAAM,IAAI,IAAesJ,EAAMsL,OAAQ,GAGzC,IAAI/T,EAAMyI,EAAM81I,UAAU,GAE1B,GAAmB,iBAARv+I,EACT,MAAM,IAAImB,UAAU,2DAItB,IAAIw3L,GAAU,QAAMl1L,GAEpB,OADA,QAAgBk1L,EAAS34L,EAAK4oH,GACvB+vE,I,+ECpNL/wE,EAAe,CAAC,QAAS,SAAU,UAAW,UACvCgxE,GAA2B,QAF3B,MAEyChxE,GAAeliB,IACjE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACNkoG,EAAO,OACP1C,GACEppB,EAiCJ,OAAOyzB,EAzCE,MAyCU,CAEjB,iBAAkB2+B,EAElB,qCAAsC,SAAoCrxJ,EAAOytI,GAC/E,OAAO,QAAOztI,EAAOytI,EAAIvyI,UAAWk3L,IAGtC,MAAO,SAAWl4L,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIQ,UAAU,0CAGtB,OAAO22J,EAAKn3J,MAWhB,SAASk4L,EAAS3xL,EAAGe,GACnB,IACE,OAAO6mH,EAAO5nH,EAAGe,GAAKf,EAAIe,EAC1B,MAAOnH,GACP,MAAM,OAAoBA,EAAK,MAAOmH,IAW1C,SAAS6vJ,EAAKrxJ,GACZ,IAAI0sE,EAaJ,IAZA,QAAY1sE,GAAO,SAAUtG,GAC3B,IACMiJ,MAAMjJ,IAA2B,iBAAVA,EACzBgzE,EAAMwM,UACW5+E,IAARoyE,GAAqB27C,EAAO3uH,EAAOgzE,MAC5CA,EAAMhzE,GAER,MAAOW,GACP,MAAM,OAAoBA,EAAK,MAAOX,YAI9BY,IAARoyE,EACF,MAAM,IAAItmE,MAAM,0CAQlB,MAJmB,iBAARsmE,IACTA,EAAMq+C,EAAQr+C,EAAK7pD,EAAOjgB,SAGrB8pE,O,yFCtGP/sE,EAAO,OACPwhH,EAAe,CAAC,QAAS,MAAO,UACzBkxE,GAA4B,QAAQ1yL,EAAMwhH,GAAeliB,IAClE,IAAI,MACFyzB,EAAK,IACLlsH,EAAG,OACHivF,GACEwJ,EA6BJ,OAAOyzB,EAAM/yH,EAAM,CAEjB,iBAAkB2yL,EAElB,qCAmBF,SAAmBtyL,EAAOytI,GACxB,IACE,IAAIpsI,GAAM,QAAOrB,EAAOytI,EAAKjnI,GACzBw5B,EAAInnC,MAAMoF,QAAQ+B,IAAS,QAAUA,GAASA,EAAMsN,OACxD,OAAOmoF,EAAOp0F,EAAK2+B,EAAEytG,IACrB,MAAOpzI,GACP,MAAM,OAAoBA,EAAK,UAvBjC,MAAO,SAAWH,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIQ,UAAU,2CAGtB,OAAO43L,EAAMp4L,MA6BjB,SAASo4L,EAAMtyL,GACb,IAAIqB,EACAsJ,EAAM,EAUV,IATA,QAAY3K,GAAO,SAAUtG,GAC3B,IACE2H,OAAc/G,IAAR+G,EAAoB3H,EAAQ8M,EAAInF,EAAK3H,GAC3CiR,IACA,MAAOtQ,GACP,MAAM,OAAoBA,EAAK,OAAQX,OAI/B,IAARiR,EACF,MAAM,IAAIvE,MAAM,+CAGlB,OAAOqvF,EAAOp0F,EAAKsJ,Q,+EC5FnBw2G,EAAe,CAAC,QAAS,SAAU,UAAW,WACvCoxE,GAA2B,QAF3B,MAEyCpxE,GAAeliB,IACjE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,QACNkoG,EAAO,QACP3C,GACEnpB,EAiCJ,OAAOyzB,EAzCE,MAyCU,CAEjB,iBAAkB0+B,EAElB,qCAAsC,SAAoCpxJ,EAAOytI,GAC/E,OAAO,QAAOztI,EAAOytI,EAAIvyI,UAAWs3L,IAGtC,MAAO,SAAWt4L,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIQ,UAAU,0CAGtB,OAAO02J,EAAKl3J,MAWhB,SAASs4L,EAAU/xL,EAAGe,GACpB,IACE,OAAO4mH,EAAQ3nH,EAAGe,GAAKf,EAAIe,EAC3B,MAAOnH,GACP,MAAM,OAAoBA,EAAK,MAAOmH,IAW1C,SAAS4vJ,EAAKpxJ,GACZ,IAAIysB,EAaJ,IAZA,QAAYzsB,GAAO,SAAUtG,GAC3B,IACMiJ,MAAMjJ,IAA2B,iBAAVA,EACzB+yB,EAAMysD,UACW5+E,IAARmyB,GAAqB27F,EAAQ1uH,EAAO+yB,MAC7CA,EAAM/yB,GAER,MAAOW,GACP,MAAM,OAAoBA,EAAK,MAAOX,YAI9BY,IAARmyB,EACF,MAAM,IAAIrmB,MAAM,0CAQlB,MAJmB,iBAARqmB,IACTA,EAAMs+F,EAAQt+F,EAAK5J,EAAOjgB,SAGrB6pB,O,iDCxGP00F,EAAe,CAAC,QAAS,OAAQ,YAC1BsxE,GAA2B,E,QAAA,IAF3B,MAEyCtxE,GAAeliB,IACjE,IAAI,MACFyzB,EAAK,KACLxyH,EAAI,SACJgqH,GACEjrB,EAsDJ,OAAOyzB,EA7DE,MA6DU,CAEjB,iBAAkBggE,EAElB,yBAA0BA,EAE1B,qCAAsCA,EAEtC,6CAA8CA,EAE9C,MAAO,SAAWx4L,GAChB,OAAOw4L,EAAKx4L,MAIhB,SAASw4L,EAAK1yL,EAAO2yL,GACnB,GAAqB,IAAjB3yL,EAAMtH,OACR,MAAM,IAAI6+E,YAAY,6DAGxB,IACE,OAAOr3E,EAAKgqH,EAAS9vH,MAAM,KAAMD,YACjC,MAAOE,GACP,MAAIA,aAAeK,YAAmD,IAAtCL,EAAIslB,QAAQpd,QAAQ,aAC5C,IAAI7H,UAAUL,EAAIslB,QAAQG,QAAQ,YAAa,SAE/CzlB,Q,+ECpFV8mH,EAAe,CAAC,QAAS,SAAU,MAAO,WACnCyxE,GAA2B,QAF3B,MAEyCzxE,GAAeliB,IACjE,IAAI,MACFyzB,EAAK,OACL7vG,EAAM,IACNrc,EAAG,QACHukH,GACE9rB,EAyBJ,OAAOyzB,EAjCE,MAiCU,CAEjB,iBAAkBmgE,EAElB,qCAsCF,SAAkB7yL,EAAOytI,GACvB,IAEE,OADU,QAAOztI,EAAOytI,EAAKjnI,GAE7B,MAAOnM,GACP,MAAM,OAAoBA,EAAK,SAzCjC,MAAO,SAAWH,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIQ,UAAU,0CAGtB,OAAOm4L,EAAK34L,MAUhB,SAAS24L,EAAK7yL,GACZ,IAAIqB,EAiBJ,OAhBA,QAAYrB,GAAO,SAAUtG,GAC3B,IACE2H,OAAc/G,IAAR+G,EAAoB3H,EAAQ8M,EAAInF,EAAK3H,GAC3C,MAAOW,GACP,MAAM,OAAoBA,EAAK,MAAOX,YAI9BY,IAAR+G,IACFA,EAAM0pH,EAAQ,EAAGloG,EAAOjgB,SAGP,iBAARvB,IACTA,EAAM0pH,EAAQ1pH,EAAKwhB,EAAOjgB,SAGrBvB,O,2DC/DJ,SAASy8J,EAAoBzjK,EAAKy4L,EAAQp5L,GAE/C,IAAIq5L,EAEJ,OAAgD,IAA5CtuL,OAAOpK,GAAKkI,QAAQ,oBACtBwwL,EAAU54L,UAAUzB,OAAS,EAAI,YAAa,QAAOgB,GAAS,YAAcmM,KAAKC,UAAUpM,GAAS,IAAM,WAAaW,EAAIyX,KAAK09K,OAAS,IAClI,IAAI90L,UAAU,oBAAsBo4L,EAAS,gCAAkCC,KAGxC,IAA5CtuL,OAAOpK,GAAKkI,QAAQ,oBACtBwwL,EAAU54L,UAAUzB,OAAS,EAAI,YAAa,QAAOgB,GAAS,YAAcmM,KAAKC,UAAUpM,GAAS,IAAM,GACnG,IAAIgB,UAAU,oBAAsBo4L,EAAS,wDAA0DC,IAGzG14L,I,yFCtBL24L,EAAwB,WACxBrzL,EAAO,WACPwhH,EAAe,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,SACpE8xE,GAAgC,QAAQtzL,EAAMwhH,GAAeliB,IACtE,IAAI,MACFyzB,EAAK,IACLlsH,EAAG,SACHg1F,EAAQ,SACR/8E,EAAQ,OACRg3E,EAAM,MACNr7F,EAAK,MACLuI,GACEs8F,EAuDJ,OAAOyzB,EAAM/yH,EAAM,CAEjB,iBAAkB,SAAqBK,GACrC,OAAOkzL,EAAKlzL,EAAOgzL,IAGrB,yBAA0BE,EAE1B,qCAAsC,SAAoClzL,EAAOytI,GAC/E,OAAO0lD,EAAQnzL,EAAOytI,EAAKulD,IAG7B,6CAA8CG,EAE9C,MAAO,SAAWj5L,GAChB,OAAOg5L,EAAKh5L,EAAM84L,MAetB,SAASE,EAAKlzL,EAAO2yL,GACnB,IAAItxL,EACAsJ,EAAM,EAEV,GAAqB,IAAjB3K,EAAMtH,OACR,MAAM,IAAI6+E,YAAY,kEAYxB,IARA,QAAYv3E,GAAO,SAAUtG,GAC3B,IACE2H,OAAc/G,IAAR+G,EAAoB3H,EAAQ8M,EAAInF,EAAK3H,GAC3CiR,IACA,MAAOtQ,GACP,MAAM,OAAoBA,EAAK,WAAYX,OAGnC,IAARiR,EAAW,MAAM,IAAIvE,MAAM,+CAC/B,IAAIjF,EAAOs0F,EAAOp0F,EAAKsJ,GAQvB,GANAtJ,OAAM/G,GACN,QAAY0F,GAAO,SAAUtG,GAC3B,IAAIwlB,EAAOs8E,EAAS9hG,EAAOyH,GAC3BE,OAAc/G,IAAR+G,EAAoBod,EAASS,EAAMA,GAAQ1Y,EAAInF,EAAKod,EAASS,EAAMA,OAGvEvc,EAAMtB,GACR,OAAOA,EAGT,OAAQsxL,GACN,IAAK,cACH,OAAOl9F,EAAOp0F,EAAKsJ,GAErB,IAAK,SACH,OAAO8qF,EAAOp0F,EAAKsJ,EAAM,GAE3B,IAAK,WAED,IAAI68I,GAAO,QAAYnmJ,GAAOA,EAAIq4F,IAAI,GAAK,EAC3C,OAAe,IAAR/uF,EAAY68I,EAAO/xD,EAAOp0F,EAAKsJ,EAAM,GAGhD,QACE,MAAM,IAAIvE,MAAM,0BAA4BusL,EAA5B,gEAItB,SAASQ,EAAQnzL,EAAOytI,EAAKklD,GAC3B,IACE,GAAqB,IAAjB3yL,EAAMtH,OACR,MAAM,IAAI6+E,YAAY,kEAGxB,OAAOn9E,EAAM4F,EAAOytI,GAAKhtI,GAAKyyL,EAAKzyL,EAAGkyL,KACtC,MAAOt4L,GACP,MAAM,OAAoBA,EAAK,kB,oPChJ9B,SAAS43J,EAAUxxJ,GAGxB,IAFA,IAAIu/B,EAAI,GAEDnnC,MAAMoF,QAAQwC,IACnBu/B,EAAEvkC,KAAKgF,EAAE/H,QACT+H,EAAIA,EAAE,GAGR,OAAOu/B,EAYT,SAAS2vH,EAAU3vJ,EAAOsN,EAAMmgI,GAC9B,IAAI90I,EACAF,EAAMuH,EAAMtH,OAEhB,GAAID,IAAQ6U,EAAKmgI,GACf,MAAM,IAAI,IAAeh1I,EAAK6U,EAAKmgI,IAGrC,GAAIA,EAAMngI,EAAK5U,OAAS,EAAG,CAEzB,IAAI06L,EAAU3lD,EAAM,EAEpB,IAAK90I,EAAI,EAAGA,EAAIF,EAAKE,IAAK,CACxB,IAAIyqF,EAAQpjF,EAAMrH,GAElB,IAAKE,MAAMoF,QAAQmlF,GACjB,MAAM,IAAI,IAAe91E,EAAK5U,OAAS,EAAG4U,EAAK5U,OAAQ,KAGzDi3J,EAAU3vJ,EAAMrH,GAAI2U,EAAM8lL,SAI5B,IAAKz6L,EAAI,EAAGA,EAAIF,EAAKE,IACnB,GAAIE,MAAMoF,QAAQ+B,EAAMrH,IACtB,MAAM,IAAI,IAAe2U,EAAK5U,OAAS,EAAG4U,EAAK5U,OAAQ,KAcxD,SAASghK,EAAS15J,EAAOsN,GAG9B,GAF+B,IAAhBA,EAAK5U,QAIlB,GAAIG,MAAMoF,QAAQ+B,GAChB,MAAM,IAAI,IAAeA,EAAMtH,OAAQ,QAIzCi3J,EAAU3vJ,EAAOsN,EAAM,GAUpB,SAAS+lL,EAAcrxL,EAAOtJ,GACnC,KAAK,QAASsJ,MAAW,OAAUA,GACjC,MAAM,IAAItH,UAAU,oCAAsCsH,EAAQ,KAGpE,GAAIA,EAAQ,GAAuB,iBAAXtJ,GAAuBsJ,GAAStJ,EACtD,MAAM,IAAI,IAAWsJ,EAAOtJ,GAczB,SAAS2e,EAAOrX,EAAOsN,EAAM4wG,GAGlC,IAAKrlH,MAAMoF,QAAQ+B,KAAWnH,MAAMoF,QAAQqP,GAC1C,MAAM,IAAI5S,UAAU,kBAGtB,GAAoB,IAAhB4S,EAAK5U,OACP,MAAM,IAAI0N,MAAM,uCAclB,OAVAkH,EAAK0J,SAAQ,SAAUtd,GACrB,KAAK,QAASA,MAAW,OAAUA,IAAUA,EAAQ,EACnD,MAAM,IAAIgB,UAAU,wDAA8D,QAAO4S,GAAQ,QAMrGirI,EAAQv4I,EAAOsN,EAAM,OAFgBhT,IAAjB4jH,EAA6BA,EAAe,GAIzDl+G,EAYT,SAASu4I,EAAQv4I,EAAOsN,EAAMmgI,EAAKvvB,GACjC,IAAIvlH,EACAyrB,EACAkvK,EAAStzL,EAAMtH,OACf66L,EAASjmL,EAAKmgI,GACdjuI,EAASS,KAAKwsB,IAAI6mK,EAAQC,GAI9B,GAFAvzL,EAAMtH,OAAS66L,EAEX9lD,EAAMngI,EAAK5U,OAAS,EAAG,CAEzB,IAAI06L,EAAU3lD,EAAM,EAEpB,IAAK90I,EAAI,EAAGA,EAAI6G,EAAQ7G,IAEtByrB,EAAOpkB,EAAMrH,GAERE,MAAMoF,QAAQmmB,KACjBA,EAAO,CAACA,GAERpkB,EAAMrH,GAAKyrB,GAGbm0H,EAAQn0H,EAAM9W,EAAM8lL,EAASl1E,GAI/B,IAAKvlH,EAAI6G,EAAQ7G,EAAI46L,EAAQ56L,IAE3ByrB,EAAO,GACPpkB,EAAMrH,GAAKyrB,EAEXm0H,EAAQn0H,EAAM9W,EAAM8lL,EAASl1E,OAE1B,CAGL,IAAKvlH,EAAI,EAAGA,EAAI6G,EAAQ7G,IACtB,KAAOE,MAAMoF,QAAQ+B,EAAMrH,KACzBqH,EAAMrH,GAAKqH,EAAMrH,GAAG,GAKxB,IAAKA,EAAI6G,EAAQ7G,EAAI46L,EAAQ56L,IAC3BqH,EAAMrH,GAAKulH,GAgBV,SAAS0jB,EAAQ5hI,EAAO2oJ,GAC7B,IAAI6qC,EAAY91G,EAAQ19E,GACpB84I,EAAgB06C,EAAU96L,OAE9B,IAAKG,MAAMoF,QAAQ+B,KAAWnH,MAAMoF,QAAQ0qJ,GAC1C,MAAM,IAAIjuJ,UAAU,kBAGtB,GAAqB,IAAjBiuJ,EAAMjwJ,OACR,MAAM,IAAI,IAAe,EAAGogJ,EAAe,MAI7C,IAAI26C,EAAYhwC,EADhBkF,EAAQ+qC,EAAqB/qC,EAAO7P,IAGpC,GAAIA,IAAkB26C,EACpB,MAAM,IAAI,IAAeA,EAAW36C,EAAe,MAGrD,IACE,OA2DJ,SAAkB94I,EAAO2oJ,GAKvB,IAHA,IACIgrC,EADAC,EAAW5zL,EAGN6zL,EAAYlrC,EAAMjwJ,OAAS,EAAGm7L,EAAY,EAAGA,IAAa,CACjE,IAAIvmL,EAAOq7I,EAAMkrC,GACjBF,EAAY,GAIZ,IAFA,IAAIj7L,EAASk7L,EAASl7L,OAAS4U,EAEtB3U,EAAI,EAAGA,EAAID,EAAQC,IAC1Bg7L,EAAUl4L,KAAKm4L,EAAS70L,MAAMpG,EAAI2U,GAAO3U,EAAI,GAAK2U,IAIpDsmL,EAAWD,EAGb,OAAOC,EA9EEE,CAASN,EAAW7qC,GAC3B,MAAOvtJ,GACP,GAAIA,aAAa,IACf,MAAM,IAAI,IAAeq4L,EAAW36C,EAAe,MAGrD,MAAM19I,GAWH,SAASs4L,EAAqB/qC,EAAO7P,GAC1C,IAAI26C,EAAYhwC,EAAQkF,GACpBorC,EAAiBprC,EAAM5pJ,QAEvBi1L,EAAgBrrC,EAAMpmJ,SADX,GAIf,GAF4BomJ,EAAMpmJ,SAFnB,EAEqCyxL,EAAgB,IAAM,EAGxE,MAAM,IAAI5tL,MAAM,mCAMlB,GAHkB4tL,GAAiB,EAGlB,CACf,GAHuBl7C,EAAgB26C,GAAc,EAMnD,MAAM,IAAIrtL,MAAM,qCAAuC0yI,EAAgB,uBAAyB26C,GAFhGM,EAAeC,IAAkBl7C,EAAgB26C,EAMrD,OAAOM,EAQT,SAAStwC,EAAQzjJ,GACf,OAAOA,EAAM0B,QAAO,CAACg5E,EAAMC,IAASD,EAAOC,GAAM,GAwC5C,SAASmnD,EAAQ9hI,EAAOsN,GAG7B,IAFA,IAAI0yB,EAAI1yB,GAAQ2kJ,EAAUjyJ,GAEnBnH,MAAMoF,QAAQ+B,IAA2B,IAAjBA,EAAMtH,QACnCsH,EAAQA,EAAM,GACdggC,EAAE64D,QAMJ,IAFA,IAAIg/C,EAAO73G,EAAEtnC,OAEU,IAAhBsnC,EAAE63G,EAAO,IACdA,IASF,OALIA,EAAO73G,EAAEtnC,SACXsH,EAAQi0L,EAASj0L,EAAO63I,EAAM,GAC9B73G,EAAEtnC,OAASm/I,GAGN73I,EAWT,SAASi0L,EAASj0L,EAAO63I,EAAMpK,GAC7B,IAAI90I,EAAGi2I,EAEP,GAAInB,EAAMoK,EAAM,CACd,IAAIn5I,EAAO+uI,EAAM,EAEjB,IAAK90I,EAAI,EAAGi2I,EAAK5uI,EAAMtH,OAAQC,EAAIi2I,EAAIj2I,IACrCqH,EAAMrH,GAAKs7L,EAASj0L,EAAMrH,GAAIk/I,EAAMn5I,QAGtC,KAAO7F,MAAMoF,QAAQ+B,IACnBA,EAAQA,EAAM,GAIlB,OAAOA,EAgBF,SAASk0L,EAAUl0L,EAAO63I,EAAM9iC,EAAOznG,GAC5C,IAAI0yB,EAAI1yB,GAAQ2kJ,EAAUjyJ,GAE1B,GAAI+0G,EACF,IAAK,IAAIp8G,EAAI,EAAGA,EAAIo8G,EAAOp8G,IACzBqH,EAAQ,CAACA,GACTggC,EAAEx0B,QAAQ,GAOd,IAFAxL,EAAQm0L,EAAWn0L,EAAO63I,EAAM,GAEzB73G,EAAEtnC,OAASm/I,GAChB73G,EAAEvkC,KAAK,GAGT,OAAOuE,EAWT,SAASm0L,EAAWn0L,EAAO63I,EAAMpK,GAC/B,IAAI90I,EAAGi2I,EAEP,GAAI/1I,MAAMoF,QAAQ+B,GAAQ,CACxB,IAAItB,EAAO+uI,EAAM,EAEjB,IAAK90I,EAAI,EAAGi2I,EAAK5uI,EAAMtH,OAAQC,EAAIi2I,EAAIj2I,IACrCqH,EAAMrH,GAAKw7L,EAAWn0L,EAAMrH,GAAIk/I,EAAMn5I,QAGxC,IAAK,IAAIiL,EAAI8jI,EAAK9jI,EAAIkuI,EAAMluI,IAC1B3J,EAAQ,CAACA,GAIb,OAAOA,EAUF,SAAS09E,EAAQ19E,GACtB,IAAKnH,MAAMoF,QAAQ+B,GAEjB,OAAOA,EAGT,IAAI+oJ,EAAO,GAQX,OAPA/oJ,EAAMgX,SAAQ,SAASsmB,EAAS5jC,GAC1Bb,MAAMoF,QAAQvE,GAChBA,EAAMsd,QAAQsmB,GAEdyrH,EAAKttJ,KAAK/B,MAGPqvJ,EAQF,SAASxnJ,EAAIvB,EAAOs9B,GACzB,OAAOzkC,MAAMoC,UAAUsG,IAAIpG,KAAK6E,EAAOs9B,GAQlC,SAAStmB,EAAQhX,EAAOs9B,GAC7BzkC,MAAMoC,UAAU+b,QAAQ7b,KAAK6E,EAAOs9B,GAQ/B,SAASh7B,EAAOtC,EAAOs9B,GAC5B,GAAgC,IAA5B20H,EAAUjyJ,GAAOtH,OACnB,MAAM,IAAI0N,MAAM,2CAGlB,OAAOvN,MAAMoC,UAAUqH,OAAOnH,KAAK6E,EAAOs9B,GAUrC,SAAS82J,EAAap0L,EAAOg2G,GAClC,GAAgC,IAA5Bi8C,EAAUjyJ,GAAOtH,OACnB,MAAM,IAAI0N,MAAM,2CAGlB,OAAOvN,MAAMoC,UAAUqH,OAAOnH,KAAK6E,GAAO0pE,GAASssC,EAAOp2G,KAAK8pE,KAQ1D,SAASr+C,EAAKrrB,EAAOq0L,GAC1B,OAAOx7L,MAAMoC,UAAUowB,KAAKlwB,KAAK6E,EAAOq0L,GAQnC,SAASC,EAAS94L,GACvB,IAAK3C,MAAMoF,QAAQzC,GACjB,MAAM,IAAId,UAAU,wBAGtB,GAAiB,IAAbc,EAAE9C,OACJ,OAAO8C,EAGT,IAAImG,EAAI,GACJkyE,EAAQ,EACZlyE,EAAE,GAAK,CACLjI,MAAO8B,EAAE,GACT0xH,WAAY,GAGd,IAAK,IAAIv0H,EAAI,EAAGA,EAAI6C,EAAE9C,OAAQC,IACxB6C,EAAE7C,KAAO6C,EAAE7C,EAAI,GACjBk7E,IAEAA,EAAQ,EAGVlyE,EAAElG,KAAK,CACL/B,MAAO8B,EAAE7C,GACTu0H,WAAYr5C,IAIhB,OAAOlyE,EAQF,SAAS4yL,EAAW/4L,GACzB,IAAK3C,MAAMoF,QAAQzC,GACjB,MAAM,IAAId,UAAU,wBAGtB,GAAiB,IAAbc,EAAE9C,OACJ,OAAO8C,EAKT,IAFA,IAAImG,EAAI,GAEChJ,EAAI,EAAGA,EAAI6C,EAAE9C,OAAQC,IAC5BgJ,EAAElG,KAAKD,EAAE7C,GAAGe,OAGd,OAAOiI,EAYF,SAAS6yL,EAAiBx0L,EAAO6jI,GAKtC,IAJA,IAAI9xH,EAEArZ,EAAS,EAEJC,EAAI,EAAGA,EAAIqH,EAAMtH,OAAQC,IAAK,CACrC,IAAI0rD,EAAOrkD,EAAMrH,GACbsF,EAAUpF,MAAMoF,QAAQomD,GAO5B,GALU,IAAN1rD,GAAWsF,IACbvF,EAAS2rD,EAAK3rD,QAIZuF,GAAWomD,EAAK3rD,SAAWA,EAC7B,OAGF,IAAI+7L,EAAWx2L,EAAUu2L,EAAiBnwI,EAAMw/E,GAC9CA,EAAOx/E,GAET,QAAa/pD,IAATyX,EACFA,EAAO0iL,OACF,GAAI1iL,IAAS0iL,EAClB,MAAO,QAKX,OAAO1iL,I,oHC/kBF,SAAS2iL,EAAoB10L,GAClC,IAAK,IAAIrH,EAAI,EAAGA,EAAIqH,EAAMtH,OAAQC,IAChC,IAAI,QAAaqH,EAAMrH,IACrB,OAAO,EAIX,OAAO,EAUF,SAASg8L,EAAY30L,EAAOs9B,IAC7B,QAASt9B,KACXA,EAAQA,EAAM9E,WAGhB,IAAK,IAAIvC,EAAI,EAAGi2I,EAAK5uI,EAAMtH,OAAQC,EAAIi2I,EAAIj2I,IAAK,CAC9C,IAAIe,EAAQsG,EAAMrH,GAEdE,MAAMoF,QAAQvE,GAChBi7L,EAAYj7L,EAAO4jC,GAEnBA,EAAS5jC,IAiBR,SAASk7L,EAAQ50L,EAAOs9B,EAAUs2G,GACvC,OAAI5zI,GAA8B,mBAAdA,EAAMuB,IAEjBvB,EAAMuB,KAAI,SAAUd,GACzB,OAAOm0L,EAAQn0L,EAAG68B,EAAUs2G,MAGvBt2G,EAASt9B,GAab,SAAS0B,EAAOsqK,EAAKv+B,EAAKnwG,GAC/B,IAAIhwB,EAAOzU,MAAMoF,QAAQ+tK,IAAO,QAAUA,GAAOA,EAAI1+J,OAErD,GAAImgI,EAAM,GAAKA,GAAOngI,EAAK5U,OAEzB,MAAM,IAAI,IAAW+0I,EAAKngI,EAAK5U,QAGjC,OAAI,QAASszK,GACJA,EAAIruK,OAAOk3L,EAAQ7oB,EAAI9wK,UAAWuyI,EAAKnwG,IAEvCu3J,EAAQ7oB,EAAKv+B,EAAKnwG,GAY7B,SAASu3J,EAAQ7oB,EAAKv+B,EAAKnwG,GACzB,IAAI3kC,EAAGsJ,EAAKwN,EAAKqgL,EAEjB,GAAIriD,GAAO,EAAG,CACZ,GAAK50I,MAAMoF,QAAQ+tK,EAAI,IAQhB,CAIL,IAHA8jB,EA2BN,SAAiB9jB,GACf,IAEIrzK,EAAG8I,EAFH2xI,EAAI44B,EAAItzK,OACR86J,EAAIwY,EAAI,GAAGtzK,OAEXuJ,EAAM,GAEV,IAAKR,EAAI,EAAGA,EAAI+xJ,EAAG/xJ,IAAK,CACtB,IAAInB,EAAM,GAEV,IAAK3H,EAAI,EAAGA,EAAIy6I,EAAGz6I,IACjB2H,EAAI7E,KAAKuwK,EAAIrzK,GAAG8I,IAGlBQ,EAAIxG,KAAK6E,GAGX,OAAO2B,EA3CI8tL,CAAQ/jB,GACf/pK,EAAM,GAEDtJ,EAAI,EAAGA,EAAIm3L,EAAKp3L,OAAQC,IAC3BsJ,EAAItJ,GAAKk8L,EAAQ/E,EAAKn3L,GAAI80I,EAAM,EAAGnwG,GAGrC,OAAOr7B,EAbP,IAFAwN,EAAMu8J,EAAI,GAELrzK,EAAI,EAAGA,EAAIqzK,EAAItzK,OAAQC,IAC1B8W,EAAM6tB,EAAS7tB,EAAKu8J,EAAIrzK,IAG1B,OAAO8W,EAcT,IAFAxN,EAAM,GAEDtJ,EAAI,EAAGA,EAAIqzK,EAAItzK,OAAQC,IAC1BsJ,EAAItJ,GAAKk8L,EAAQ7oB,EAAIrzK,GAAI80I,EAAM,EAAGnwG,GAGpC,OAAOr7B,EA+BJ,SAAS6yL,EAAQt5L,EAAGiG,EAAGkpD,EAAGlqD,EAAGkiE,EAAG4oF,EAAMxlF,EAAQvoD,EAAGqB,EAAS1R,EAAQzT,GAEvE,IAIIiH,EAAGgpF,EAAIK,EAAIrxF,EAJX8yJ,EAAUjwJ,EAAE0rJ,QACZwE,EAASlwJ,EAAE2rJ,OACXwE,EAAOnwJ,EAAE4rJ,KAIb,GAAI3mJ,EAEF,IAAKkpF,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAI/CgqD,EAFJhyD,EAAI+yJ,EAAO/qJ,MAEE4qJ,GAEX5gG,EAAEhyD,GAAK4yJ,EAEPxlF,EAAOtqE,KAAK9C,GAERwU,GAEF1M,EAAE9H,GAAKkmB,EAAUrB,EAAEiuI,EAAQ9qJ,GAAIjH,GAAS8jB,EAAE9jB,EAAO+xJ,EAAQ9qJ,IAEzDgiE,EAAEhqE,GAAK4yJ,GAGP9qJ,EAAE9H,GAAK8yJ,EAAQ9qJ,KAIjBF,EAAE9H,GAAKkmB,EAAUrB,EAAEiuI,EAAQ9qJ,GAAIF,EAAE9H,IAAM6kB,EAAE/c,EAAE9H,GAAI8yJ,EAAQ9qJ,IAEvDgiE,EAAEhqE,GAAK4yJ,QAKX,IAAK5hE,EAAKgiE,EAAKlqJ,GAAIuoF,EAAK2hE,EAAKlqJ,EAAI,GAAId,EAAIgpF,EAAIhpF,EAAIqpF,EAAIrpF,IAI/CgqD,EAFJhyD,EAAI+yJ,EAAO/qJ,MAEE4qJ,GAEX5gG,EAAEhyD,GAAK4yJ,EAEPxlF,EAAOtqE,KAAK9C,IAGZgqE,EAAEhqE,GAAK4yJ,I,gGCrMf,SAASwpC,EAAgB/3L,EAAQs2E,GAE/B,GAAIo/B,EAAc11G,IAAWg4L,EAAeh4L,EAAQs2E,GAClD,OAAOt2E,EAAOs2E,GAGhB,GAA4B,mBAAjBt2E,EAAOs2E,IAAwB2hH,EAAaj4L,EAAQs2E,GAC7D,MAAM,IAAIltE,MAAM,yBAA2BktE,EAAO,mBAGpD,MAAM,IAAIltE,MAAM,0BAA4BktE,EAAO,KAcrD,SAAS4hH,EAAgBl4L,EAAQs2E,EAAM55E,GAErC,GAAIg5G,EAAc11G,IAAWg4L,EAAeh4L,EAAQs2E,GAElD,OADAt2E,EAAOs2E,GAAQ55E,EACRA,EAGT,MAAM,IAAI0M,MAAM,0BAA4BktE,EAAO,KAUrD,SAAS0hH,EAAeh4L,EAAQs2E,GAC9B,SAAKt2E,GAA4B,iBAAXA,KAMlB,QAAem4L,EAAsB7hH,KAMrCA,KAAQl3E,OAAOnB,WASfq4E,KAAQ53E,SAAST,YAkBvB,SAASm6L,EAAmBp4L,EAAQ6mD,GAClC,IAAKoxI,EAAaj4L,EAAQ6mD,GACxB,MAAM,IAAIz9C,MAAM,wBAA0By9C,EAAS,KAYvD,SAASoxI,EAAaj4L,EAAQ6mD,GAC5B,QAAI7mD,SAAqE,mBAAnBA,EAAO6mD,KAOzD,QAAe7mD,EAAQ6mD,IAAWznD,OAAOc,gBAAkB2mD,KAAUznD,OAAOc,eAAeF,MAM3F,QAAeq4L,EAAmBxxI,KAMlCA,KAAUznD,OAAOnB,WASjB4oD,KAAUnoD,SAAST,YAUzB,SAASy3G,EAAc11G,GACrB,MAAyB,iBAAXA,GAAuBA,GAAUA,EAAOY,cAAgBxB,OAGxE,IAAI+4L,EAAuB,CACzBz8L,QAAQ,EACRiH,MAAM,GAEJ01L,EAAoB,CACtB31L,UAAU,EACVxE,SAAS,EACTo6L,gBAAgB,I,4DChIX,SAASj0E,EAAQ1hH,EAAMwhH,EAAcxjH,EAAQgrC,GAClD,SAAS4sJ,EAAgBh0E,GAIvB,IAAIi0E,GAAO,QAAYj0E,EAAOJ,EAAa5/G,IAAIk0L,IAE/C,OAqFG,SAA4B91L,EAAMwhH,EAAcI,GAIrD,IAHiBJ,EAAa7+G,QAAOozL,IAShC,SAA8BA,GACnC,OAAOA,GAAgC,MAAlBA,EAAW,GAVoBC,CAAqBD,KACxEpwL,OAAMowL,QAAoCp7L,IAAtBinH,EAAMm0E,KAEV,CACf,IAAIE,EAAsBz0E,EAAa7+G,QAAOozL,QAAoCp7L,IAAtBinH,EAAMm0E,KAElE,MAAM,IAAItvL,MAAM,2BAA4BT,OAAOhG,EAAM,OAAU,kCAAkCgG,OAAOiwL,EAAoBr0L,KAAIoI,GAAK,IAAKhE,OAAOgE,EAAG,OAAO0hB,KAAK,MAAO,OA7F3KwqK,CAAmBl2L,EAAMwhH,EAAcI,GAChC5jH,EAAO63L,GAWhB,OARAD,EAAgBO,WAAY,EAC5BP,EAAgBv7L,GAAK2F,EACrB41L,EAAgBp0E,aAAeA,EAAapiH,QAAQgD,OAEhD4mC,IACF4sJ,EAAgB5sJ,KAAOA,GAGlB4sJ,EAuFF,SAASE,EAAsBC,GACpC,OAAOA,GAAgC,MAAlBA,EAAW,GAAaA,EAAW32L,MAAM,GAAK22L,I,0BClI9D,SAASK,EAAS99G,GACvB,IAAI3qE,EAAO,EACPvQ,EAAO,EACPi5L,EAAQ55L,OAAOuB,OAAO,MACtB4D,EAAMnF,OAAOuB,OAAO,MACpBqE,EAAQ,EAER6+I,EAAM,SAAa5rH,GACrB,IAAIu5I,EAAWjtK,EAAI0zB,GACnB,GAAKu5I,WACEwnB,EAAMxnB,UACNjtK,EAAI0zB,KACT3nB,EACEvQ,IAASyxK,GAAb,CAEA,IAAKlhK,EAGH,OAFAtL,EAAQ,OACRjF,EAAO,GAIT,MAAQE,eAAe9B,KAAK66L,IAASj5L,QAMvC,OADAk7E,EAAQh4E,KAAKgE,IAAIg0E,GACV,CACLg+G,IAAK,SAAahhK,GAChB,IAAIu5I,EAAWjtK,EAAI0zB,GACfihK,IAAYl0L,EAIhB,GAHAg0L,EAAME,GAAWjhK,EACjB1zB,EAAI0zB,GAAMihK,GAEL1nB,EAAU,CAEb,KADElhK,GACU2qE,EAAO,OAGnB,OAFAhjD,EAAK+gK,EAAMj5L,GACX8jJ,EAAI5rH,GACGA,EAIT,UADO+gK,EAAMxnB,GACTzxK,IAASyxK,EAEb,MAAQvxK,eAAe9B,KAAK66L,IAASj5L,OAMvCo5L,OAAQt1C,EACRpoH,MAAO,WACLnrB,EAAOtL,EAAQ,EACfjF,EAAO,EACPi5L,EAAQ55L,OAAOuB,OAAO,MACtB4D,EAAMnF,OAAOuB,OAAO,QCzCnB,SAAS89G,EAAQzhH,GACtB,IAAI,OACFm3I,EAAM,MACNl5D,GACE99E,UAAUzB,OAAS,QAAsB4B,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAGxE,OAFA89E,EAAiB,MAATA,EAAgBn2E,OAAOq/E,kBAAoBlJ,EACnDk5D,EAAmB,MAAVA,EAAiBtrI,KAAKC,UAAYqrI,EACpC,SAAS11B,IACe,iBAAlBA,EAAQtG,QACjBsG,EAAQtG,MAAQ,CACdpvG,OAAQ,IAAIw9D,IACZ6yH,IAAKL,EAAS99G,GAASn2E,OAAOq/E,qBAMlC,IAFA,IAAIjnF,EAAO,GAEFvB,EAAI,EAAGA,EAAIwB,UAAUzB,OAAQC,IACpCuB,EAAKvB,GAAKwB,UAAUxB,GAGtB,IAAI09L,EAAOllD,EAAOj3I,GAElB,GAAIuhH,EAAQtG,MAAMpvG,OAAOQ,IAAI8vL,GAE3B,OADA56E,EAAQtG,MAAMihF,IAAIH,IAAII,GACf56E,EAAQtG,MAAMpvG,OAAOjJ,IAAIu5L,GAGlC,IAAIC,EAASt8L,EAAGI,MAAMJ,EAAIE,GAG1B,OAFAuhH,EAAQtG,MAAMpvG,OAAO09D,IAAI4yH,EAAMC,GAC/B76E,EAAQtG,MAAMpvG,OAAOowL,OAAO16E,EAAQtG,MAAMihF,IAAIH,IAAII,IAC3CC,GAqDJ,SAASC,EAAiBv8L,GAC/B,OAAOoC,OAAOsE,KAAK1G,EAAGk5H,YAAc,IAAIxxH,QAAO,SAAUxH,EAAM84H,GAC7D,IAAIn/C,GAASm/C,EAAUn7C,MAAM,OAAS,IAAIn/E,OAAS,EACnD,OAAOuH,KAAKyJ,IAAIxP,EAAM25E,MACpB,G,wDC7FC,SAAS2iH,EAAS/1L,GACvB,MAAoB,iBAANA,EAET,SAAS+yI,EAAY/yI,GAC1B,OAAOA,IAA6C,IAAxCA,EAAE7C,YAAY3C,UAAUu4I,cAAwB,EAEvD,SAASijD,EAAUh2L,GACxB,OAAOA,GAAkB,iBAANA,IAAyD,IAAvCrE,OAAOc,eAAeuD,GAAGg2L,YAAsB,EAE/E,SAASC,EAAWj2L,GACzB,OAAOA,GAAkB,iBAANA,IAA0D,IAAxCrE,OAAOc,eAAeuD,GAAGi2L,aAAuB,EAEhF,SAASnrE,EAAO9qH,GACrB,OAAOA,IAAwC,IAAnCA,EAAE7C,YAAY3C,UAAUswH,SAAmB,EAElD,SAASxL,EAASt/G,GACvB,MAAoB,iBAANA,E,wWAET,IAAIxC,EAAUpF,MAAMoF,QACpB,SAASy1I,EAASjzI,GACvB,OAAOA,IAA0C,IAArCA,EAAE7C,YAAY3C,UAAUy4I,WAAqB,EAQpD,SAASijD,EAAal2L,GAC3B,OAAO5H,MAAMoF,QAAQwC,IAAMizI,EAASjzI,GAE/B,SAASi4I,EAAcj4I,GAC5B,OAAOA,GAAKA,EAAEi4I,gBAAsD,IAArCj4I,EAAE7C,YAAY3C,UAAUy4I,WAAqB,EAEvE,SAAS8U,EAAe/nJ,GAC7B,OAAOA,GAAKA,EAAE+nJ,iBAAuD,IAArC/nJ,EAAE7C,YAAY3C,UAAUy4I,WAAqB,EAExE,SAAS1C,EAAQvwI,GACtB,OAAOA,IAAyC,IAApCA,EAAE7C,YAAY3C,UAAU+1I,UAAoB,EAEnD,SAASvmC,EAAQhqG,GACtB,OAAOA,IAAyC,IAApCA,EAAE7C,YAAY3C,UAAUwvG,UAAoB,EAEnD,SAASmsF,EAAUn2L,GACxB,MAAoB,kBAANA,EAET,SAAS8vI,EAAY9vI,GAC1B,OAAOA,IAA6C,IAAxCA,EAAE7C,YAAY3C,UAAUs1I,cAAwB,EAEvD,SAASrU,EAAOz7H,GACrB,OAAOA,IAAwC,IAAnCA,EAAE7C,YAAY3C,UAAUihI,SAAmB,EAElD,SAASp2B,EAAWrlG,GACzB,MAAoB,mBAANA,EAET,SAASo2L,EAAOp2L,GACrB,OAAOA,aAAa4N,KAEf,SAASyoL,EAASr2L,GACvB,OAAOA,aAAa8vE,OAEf,SAASi8B,EAAS/rG,GACvB,SAAUA,GAAkB,iBAANA,GAAkBA,EAAE7C,cAAgBxB,QAAWq6L,EAAUh2L,IAAOi2L,EAAWj2L,IAE5F,SAASs2L,EAAOt2L,GACrB,OAAa,OAANA,EAEF,SAASqiF,EAAYriF,GAC1B,YAAanG,IAANmG,EAEF,SAASszH,EAAetzH,GAC7B,OAAOA,IAA0B,IAArBA,EAAEszH,iBAA8D,IAAnCtzH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE/E,SAASuB,EAAYtiH,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEsiH,cAA2D,IAAnCtiH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE5E,SAASyT,EAAiBx0H,GAC/B,OAAOA,IAA4B,IAAvBA,EAAEw0H,mBAAgE,IAAnCx0H,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAEjF,SAASkC,EAAYjjH,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEijH,cAA2D,IAAnCjjH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE5E,SAAS4N,EAAkB3uH,GAChC,OAAOA,IAA6B,IAAxBA,EAAE2uH,oBAAiE,IAAnC3uH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAElF,SAASkK,EAAejrH,GAC7B,OAAOA,IAA0B,IAArBA,EAAEirH,iBAA8D,IAAnCjrH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE/E,SAASqR,EAAyBpyH,GACvC,OAAOA,IAAoC,IAA/BA,EAAEoyH,2BAAwE,IAAnCpyH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAEzF,SAASwU,EAAev1H,GAC7B,OAAOA,IAA0B,IAArBA,EAAEu1H,iBAA8D,IAAnCv1H,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE/E,SAAS8S,EAAY7zH,GAC1B,OAAOA,IAAuB,IAAlBA,EAAE6zH,cAA2D,IAAnC7zH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE5E,SAASA,EAAO/gH,GACrB,OAAOA,IAAkB,IAAbA,EAAE+gH,SAAsD,IAAnC/gH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAEvE,SAASsK,EAAarrH,GAC3B,OAAOA,IAAwB,IAAnBA,EAAEqrH,eAA4D,IAAnCrrH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE7E,SAASyP,EAAexwH,GAC7B,OAAOA,IAA0B,IAArBA,EAAEwwH,iBAA8D,IAAnCxwH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE/E,SAAS6K,EAAkB5rH,GAChC,OAAOA,IAA6B,IAAxBA,EAAE4rH,oBAAiE,IAAnC5rH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAElF,SAAS4Q,EAAY3xH,GAC1B,OAAOA,IAAuB,IAAlBA,EAAE2xH,cAA2D,IAAnC3xH,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE5E,SAASoU,EAAan1H,GAC3B,OAAOA,IAAwB,IAAnBA,EAAEm1H,eAA4D,IAAnCn1H,EAAE7C,YAAY3C,UAAUumH,SAAmB,EAE7E,SAASgN,EAAQ/tH,GACtB,OAAOA,IAAyC,IAApCA,EAAE7C,YAAY3C,UAAUuzH,UAAoB,EAEnD,SAASqV,EAAOpjI,GACrB,IAAIujB,SAAWvjB,EAEf,MAAU,WAANujB,EAEQ,OAANvjB,EAAmB,OACnB5H,MAAMoF,QAAQwC,GAAW,QACzBA,aAAa4N,KAAa,OAC1B5N,aAAa8vE,OAAe,SAE5BijE,EAAY/yI,GAAW,YACvBg2L,EAAUh2L,GAAW,UACrBi2L,EAAWj2L,GAAW,WACtBizI,EAASjzI,GAAW,SACpB8qH,EAAO9qH,GAAW,OAClBgqG,EAAQhqG,GAAW,QACnBuwI,EAAQvwI,GAAW,QACnB8vI,EAAY9vI,GAAW,YACvB+gH,EAAO/gH,GAAWA,EAAEsR,KACpBy8G,EAAQ/tH,GAAW,QACnBy7H,EAAOz7H,GAAW,OACf,SAGC,aAANujB,EAAyB,WACtBA,I,4BC5JF,SAASgzK,IACd,MAAM,IAAI5wL,MAAM,2CAEX,SAAS6wL,IACd,MAAM,IAAI7wL,MAAM,0CAEX,SAAS8wL,IACd,MAAM,IAAI9wL,MAAM,wC,gPCIX,SAASmtD,EAAU75D,GACxB,MAAqB,kBAAVA,KAIJmiE,SAASniE,IAASA,IAAUuG,KAAKgD,MAAMvJ,GAQzC,IAAI4iG,EAAsBr8F,KAAKq8F,MAAQ,SAAU77F,GACtD,OAAIA,EAAI,EACC,EACEA,EAAI,GACL,EAED,GASAwhD,EAAsBhiD,KAAKgiD,MAAQ,SAAcxhD,GAC1D,OAAOR,KAAKiF,IAAIzE,GAAKR,KAAK+8H,KAQjB/+B,EAAuBh+F,KAAKg+F,OAAS,SAAex9F,GAC7D,OAAOR,KAAKiF,IAAIzE,GAAKR,KAAKyxF,MAQjBu3B,EAAuBhpH,KAAKgpH,OAAS,SAAUxoH,GACxD,OAAOR,KAAKiF,IAAIzE,EAAI,IAYX00F,EAAsBl1F,KAAKk1F,MAAQ,SAAc10F,GAC1D,GAAU,IAANA,EACF,OAAOA,EAGT,IACIglB,EADA0kI,EAAS1pJ,EAAI,EAejB,OAZI0pJ,IACF1pJ,GAAKA,GAMLglB,EAHEo2C,SAASp7D,IAGDA,IAFVglB,EAASxlB,KAAKoD,IAAIpD,KAAKiF,IAAIzE,GAAK,IAERglB,GAAU,EAAIA,GAAU,EAEvChlB,EAGJ0pJ,GAAU1kI,EAASA,GAQjBuyD,EAAuB/3E,KAAK+3E,OAAS,SAAev3E,GAC7D,OAAOA,GAAK,MAAQA,IAAM,KAAOR,KAAKoD,IAAI5C,GAAK,EAAIA,EAAIA,EAAIA,EAAI,EAAIA,EAAIA,EAAIA,EAAI,GAUjF,SAAS02L,EAAmB13L,EAAG1C,EAAMuQ,GACnC,IAKInF,EALW,CACb1E,EAAG,KACH2zL,EAAG,KACHC,GAAI,MAEgBt6L,GAClBykC,EAAS,GAEb,GAAIl0B,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAIlH,MAAM,kCAGlB,IAAKmtD,EAAUjmD,GACb,MAAM,IAAIlH,MAAM,2BAGlB,GAAI3G,EAAI,IAAM6N,EAAO,GAAK,GAAK7N,IAAM,IAAM6N,EAAO,IAChD,MAAM,IAAIlH,MAAM,8BAA8BT,OAAO2H,EAAO,EAAG,QAAQ3H,OAAO2H,EAAO,EAAG,QAG1F,IAAKimD,EAAU9zD,GACb,MAAM,IAAI2G,MAAM,4BAGd3G,EAAI,IACNA,GAAQ,GAAK6N,GAGfk0B,EAAS,IAAI77B,OAAO2H,GAGtB,IAAIgvF,EAAO,GAOX,OALI78F,EAAI,IACNA,GAAKA,EACL68F,EAAO,KAGF,GAAG32F,OAAO22F,GAAM32F,OAAOwC,GAAQxC,OAAOlG,EAAEC,SAAS3C,IAAO4I,OAAO67B,GAwFjE,SAAS8hG,EAAO5pI,EAAO0b,GAC5B,GAAuB,mBAAZA,EAET,OAAOA,EAAQ1b,GAIjB,GAAIA,IAAU4+E,IACZ,MAAO,WACF,GAAI5+E,KAAU,IACnB,MAAO,YACF,GAAIiJ,MAAMjJ,GACf,MAAO,MAIT,IACIk4F,EACAwvD,EAFAD,EAAW,OAIf,GAAI/rI,IAEEA,EAAQ+rI,WACVA,EAAW/rI,EAAQ+rI,WAIjB,QAAS/rI,GACXw8E,EAAYx8E,GACH,QAASA,EAAQw8E,aAC1BA,EAAYx8E,EAAQw8E,WAGlBx8E,EAAQgsI,UAGc,iBAFxBA,EAAWhsI,EAAQgsI,WAGjB,MAAM,IAAIh7I,MAAM,sCAMtB,OAAQ+6I,GACN,IAAK,QACH,OAAOn+I,EAAQtJ,EAAOk4F,GAExB,IAAK,cACH,OAAO4D,EAAc97F,EAAOk4F,GAE9B,IAAK,cACH,OAsEC,SAAuBl4F,EAAOk4F,GACnC,GAAIjvF,MAAMjJ,KAAWmiE,SAASniE,GAC5B,OAAO+K,OAAO/K,GAGhB,IACI49L,EAAUC,EADFC,EAAY99L,GACSk4F,GAC7Bx2F,EAAIk8L,EAAQrjC,SACZttJ,EAAI2wL,EAAQ3sD,aAEZ8sD,EAASr8L,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAE/D,IAAI,QAASw2F,GAEX,KAAOA,EAAYjrF,EAAEjO,QAAU0C,EAAIq8L,EAAS,EAAI9wL,EAAEjO,QAChDiO,EAAElL,KAAK,QAOT,IAFA,IAAIi8L,EAAez3L,KAAKgE,IAAI7I,EAAIq8L,IAAW9wL,EAAEjO,OAAS,GAE7CC,EAAI,EAAGA,EAAI++L,EAAc/+L,IAChCgO,EAAElL,KAAK,GAQX,IAHA,IAAIk8L,EAAU13L,KAAKgE,IAAI7I,EAAIq8L,GACvBG,EAAa,EAEVD,EAAU,GACfC,IACAD,IAKF,IAAI56C,EAAWp2I,EAAE5H,MAAM64L,GAAYvsK,KAAK,IACpCwsK,GAAa,QAASjmG,IAAcmrD,EAASrkJ,QAAUqkJ,EAASllE,MAAM,SAAW,IAAMklE,EAAW,GAClGlpI,EAAMlN,EAAE5H,MAAM,EAAG64L,GAAYvsK,KAAK,IAAMwsK,EAAa,KAAOz8L,GAAK,EAAI,IAAM,IAAMq8L,EAAO/3L,WAC5F,OAAO43L,EAAQh7F,KAAOzoF,EA/GXikL,CAAcp+L,EAAOk4F,GAE9B,IAAK,MACH,OAAOulG,EAAmBz9L,EAAO,EAAG0nJ,GAEtC,IAAK,MACH,OAAO+1C,EAAmBz9L,EAAO,EAAG0nJ,GAEtC,IAAK,MACH,OAAO+1C,EAAmBz9L,EAAO,GAAI0nJ,GAEvC,IAAK,OAEH,OA+KC,SAAqB1nJ,EAAOk4F,EAAWx8E,GAC5C,GAAIzS,MAAMjJ,KAAWmiE,SAASniE,GAC5B,OAAO+K,OAAO/K,GAIhB,IAAIq+L,EAAW3iL,QAAgC9a,IAArB8a,EAAQ2iL,SAAyB3iL,EAAQ2iL,UAAY,EAC3EC,EAAW5iL,QAAgC9a,IAArB8a,EAAQ4iL,SAAyB5iL,EAAQ4iL,SAAW,EAC1EjxK,EAAQywK,EAAY99L,GACpB49L,EAAU1lG,EAAY2lG,EAAYxwK,EAAO6qE,GAAa7qE,EAE1D,GAAIuwK,EAAQrjC,SAAW8jC,GAAYT,EAAQrjC,UAAY+jC,EAErD,OAAOxiG,EAAc97F,EAAOk4F,GAE5B,IAAIjrF,EAAI2wL,EAAQ3sD,aACZvvI,EAAIk8L,EAAQrjC,SAEZttJ,EAAEjO,OAASk5F,IACbjrF,EAAIA,EAAEhB,OAAOo8H,EAAMnwC,EAAYjrF,EAAEjO,UAKnCiO,EAAIA,EAAEhB,OAAOo8H,EAAM3mI,EAAIuL,EAAEjO,OAAS,GAAKiO,EAAEjO,OAASk5F,EAAYA,EAAYjrF,EAAEjO,OAAS,KAGrF,IAAIkpD,EAAMxmD,EAAI,EAAIA,EAAI,EAMtB,OAJIwmD,GAHJj7C,EAAIo7H,GAAO3mI,GAAGuK,OAAOgB,IAGTjO,OAAS,GACnBiO,EAAE40G,OAAO35D,EAAM,EAAG,EAAG,KAGhB01I,EAAQh7F,KAAO31F,EAAE0kB,KAAK,IAhNpByvE,CAAYphG,EAAOk4F,EAAWx8E,GAAWA,GAAS0K,QAAQ,uBAAuB,WACtF,IAAI1c,EAASjJ,UAAU,GACnBiB,EAAIjB,UAAU,GAClB,MAAkB,MAAXiJ,EAAiBA,EAAShI,EAAIA,KAGzC,QACE,MAAM,IAAIgL,MAAM,qBAAuB+6I,EAAvB,qEAUf,SAASq2C,EAAY99L,GAE1B,IAAIm+E,EAAQpzE,OAAO/K,GAAOw4E,cAAc2F,MAAM,sCAE9C,IAAKA,EACH,MAAM,IAAIN,YAAY,kBAAoB79E,GAG5C,IAAI4iG,EAAOzkB,EAAM,GACbz0E,EAASy0E,EAAM,GACfo8E,EAAW30I,WAAWu4D,EAAM,IAAM,KAClCj2B,EAAMx+C,EAAOb,QAAQ,KACzB0xJ,IAAqB,IAATryG,EAAaA,EAAM,EAAIx+C,EAAO1K,OAAS,EACnD,IAAIiyI,EAAevnI,EAAO0c,QAAQ,IAAK,IACtCA,QAAQ,OAAO,SAAUiiH,GAGxB,OADAkyB,GAAYlyB,EAAMrpI,OACX,MACNonB,QAAQ,MAAO,IACjBiH,MAAM,IAAIxlB,KAAI,SAAUoI,GACvB,OAAO5G,SAAS4G,MAQlB,OAL4B,IAAxBghI,EAAajyI,SACfiyI,EAAalvI,KAAK,GAClBw4J,KAGK,CACL33D,KAAMA,EACNquC,aAAcA,EACdspB,SAAUA,GA2DP,SAASjxJ,EAAQtJ,EAAOk4F,GAC7B,GAAIjvF,MAAMjJ,KAAWmiE,SAASniE,GAC5B,OAAO+K,OAAO/K,GAGhB,IAAIu+L,EAAaT,EAAY99L,GACzB49L,EAA+B,iBAAd1lG,EAAyB2lG,EAAYU,EAAYA,EAAWhkC,SAAW,EAAIriE,GAAaqmG,EACzGtxL,EAAI2wL,EAAQ3sD,aACZ5sI,EAAIu5L,EAAQrjC,SAAW,EAGvBikC,EAAKn6L,GAAK6zF,GAAa,GAiB3B,OAfIjrF,EAAEjO,OAASw/L,IACbvxL,EAAIA,EAAEhB,OAAOo8H,EAAMm2D,EAAKvxL,EAAEjO,UAIxBqF,EAAI,IACN4I,EAAIo7H,EAAW,EAAJhkI,GAAO4H,OAAOgB,GACzB5I,EAAI,GAIFA,EAAI4I,EAAEjO,QACRiO,EAAE40G,OAAOx9G,EAAG,EAAS,IAANA,EAAU,KAAO,KAG3Bu5L,EAAQh7F,KAAO31F,EAAE0kB,KAAK,IAUxB,SAASmqE,EAAc97F,EAAOk4F,GACnC,GAAIjvF,MAAMjJ,KAAWmiE,SAASniE,GAC5B,OAAO+K,OAAO/K,GAIhB,IAAIqtB,EAAQywK,EAAY99L,GACpB49L,EAAU1lG,EAAY2lG,EAAYxwK,EAAO6qE,GAAa7qE,EACtDpgB,EAAI2wL,EAAQ3sD,aACZvvI,EAAIk8L,EAAQrjC,SAEZttJ,EAAEjO,OAASk5F,IACbjrF,EAAIA,EAAEhB,OAAOo8H,EAAMnwC,EAAYjrF,EAAEjO,UAInC,IAAI86E,EAAQ7sE,EAAEkyF,QACd,OAAOy+F,EAAQh7F,KAAO9oB,GAAS7sE,EAAEjO,OAAS,EAAI,IAAMiO,EAAE0kB,KAAK,IAAM,IAAM,KAAOjwB,GAAK,EAAI,IAAM,IAAMA,EA0D9F,SAASm8L,EAAYxwK,EAAO6qE,GASjC,IAPA,IAAI0lG,EAAU,CACZh7F,KAAMv1E,EAAMu1E,KACZquC,aAAc5jH,EAAM4jH,aACpBspB,SAAUltI,EAAMktI,UAEdttJ,EAAI2wL,EAAQ3sD,aAET/4C,GAAa,GAClBjrF,EAAE6E,QAAQ,GACV8rL,EAAQrjC,WACRriE,IAGF,GAAIjrF,EAAEjO,OAASk5F,GACCjrF,EAAE40G,OAAO3pB,EAAWjrF,EAAEjO,OAASk5F,GAEjC,IAAM,EAAG,CACnB,IAAIj5F,EAAIi5F,EAAY,EAGpB,IAFAjrF,EAAEhO,KAEc,KAATgO,EAAEhO,IACPgO,EAAE8sD,MAEQ,IAAN96D,IACFgO,EAAE6E,QAAQ,GACV8rL,EAAQrjC,WACRt7J,KAIFgO,IADAhO,KAMN,OAAO2+L,EAQT,SAASv1D,EAAMrpI,GAGb,IAFA,IAAIF,EAAM,GAEDG,EAAI,EAAGA,EAAID,EAAQC,IAC1BH,EAAIiD,KAAK,GAGX,OAAOjD,EAeF,SAAS4K,EAAO1J,GACrB,OAAOA,EAAM87F,gBAAgB11E,QAAQ,OAAQ,IAC5CA,QAAQ,aAAc,IACtBpnB,OAMI,IAAIy/L,EAAcr2L,OAAO0pD,SAAW,qBAWpC,SAAS4sI,EAAY33L,EAAGe,EAAGq/G,GAEhC,GAAIA,QACF,OAAOpgH,IAAMe,EAGf,GAAIf,IAAMe,EACR,OAAO,EAIT,GAAImB,MAAMlC,IAAMkC,MAAMnB,GACpB,OAAO,EAIT,GAAIq6D,SAASp7D,IAAMo7D,SAASr6D,GAAI,CAE9B,IAAI0d,EAAOjf,KAAKgE,IAAIxD,EAAIe,GAExB,OAAI0d,EAAOi5K,GAIFj5K,GAAQjf,KAAKyJ,IAAIzJ,KAAKgE,IAAIxD,GAAIR,KAAKgE,IAAIzC,IAAMq/G,EAKxD,OAAO,EAQF,IAAI9nC,EAAQ94E,KAAK84E,OAAS,SAAUt4E,GACzC,OAAOR,KAAKiF,IAAIjF,KAAKC,KAAKO,EAAIA,EAAI,GAAKA,IAE9Bq4E,EAAQ74E,KAAK64E,OAAS,SAAUr4E,GACzC,OAAOR,KAAKiF,IAAIjF,KAAKC,KAAKO,EAAIA,EAAI,GAAKA,IAQ9Bo4E,EAAQ54E,KAAK44E,OAAS,SAAUp4E,GACzC,OAAOR,KAAKiF,KAAK,EAAIzE,IAAM,EAAIA,IAAM,GAQ5B22E,EAAOn3E,KAAKm3E,MAAQ,SAAU32E,GACvC,OAAQR,KAAKoD,IAAI5C,GAAKR,KAAKoD,KAAK5C,IAAM,GAQ7B42E,EAAOp3E,KAAKo3E,MAAQ,SAAU52E,GACvC,OAAQR,KAAKoD,IAAI5C,GAAKR,KAAKoD,KAAK5C,IAAM,GAQ7Bu2F,EAAO/2F,KAAK+2F,MAAQ,SAAUv2F,GACvC,IAAIrF,EAAI6E,KAAKoD,IAAI,EAAI5C,GACrB,OAAQrF,EAAI,IAAMA,EAAI,K,yGCjqBjB,SAAS8iG,EAAMz9F,GACpB,IAAIsR,SAActR,EAElB,GAAa,WAATsR,GAA8B,WAATA,GAA8B,YAATA,GAA1CA,MAAgEtR,EAClE,OAAOA,EAIT,GAAuB,mBAAZA,EAAEy9F,MACX,OAAOz9F,EAAEy9F,QAIX,GAAIrlG,MAAMoF,QAAQwC,GAChB,OAAOA,EAAEc,KAAI,SAAU7H,GACrB,OAAOwkG,EAAMxkG,MAIjB,GAAI+G,aAAa4N,KAAM,OAAO,IAAIA,KAAK5N,EAAEvF,WACzC,IAAI,QAAYuF,GAAI,OAAOA,EAE3B,GAAIA,aAAa8vE,OAAQ,MAAM,IAAI71E,UAAU,gBAAkB+F,GAG/D,OASK,SAAmBzD,EAAQsgC,GAChC,IAAI4gE,EAAQ,GAEZ,IAAK,IAAI3kG,KAAOyD,EACVC,EAAeD,EAAQzD,KACzB2kG,EAAM3kG,GAAO+jC,EAAStgC,EAAOzD,KAIjC,OAAO2kG,EAlBAm6F,CAAU53L,EAAGy9F,GA2Bf,SAASo6F,EAAO98L,EAAGmG,GACxB,IAAK,IAAI2xE,KAAQ3xE,EACX1E,EAAe0E,EAAG2xE,KACpB93E,EAAE83E,GAAQ3xE,EAAE2xE,IAIhB,OAAO93E,EA+CF,SAAS+8L,EAAgB/8L,EAAGmG,GACjC,IAAI2xE,EAAM36E,EAAGF,EAEb,GAAII,MAAMoF,QAAQzC,GAAI,CACpB,IAAK3C,MAAMoF,QAAQ0D,GACjB,OAAO,EAGT,GAAInG,EAAE9C,SAAWiJ,EAAEjJ,OACjB,OAAO,EAGT,IAAKC,EAAI,EAAGF,EAAM+C,EAAE9C,OAAQC,EAAIF,EAAKE,IACnC,IAAK4/L,EAAgB/8L,EAAE7C,GAAIgJ,EAAEhJ,IAC3B,OAAO,EAIX,OAAO,EACF,GAAiB,mBAAN6C,EAChB,OAAOA,IAAMmG,EACR,GAAInG,aAAaY,OAAQ,CAC9B,GAAIvD,MAAMoF,QAAQ0D,MAAQA,aAAavF,QACrC,OAAO,EAGT,IAAKk3E,KAAQ93E,EAEX,KAAM83E,KAAQ3xE,KAAO42L,EAAgB/8L,EAAE83E,GAAO3xE,EAAE2xE,IAC9C,OAAO,EAIX,IAAKA,KAAQ3xE,EAEX,KAAM2xE,KAAQ93E,KAAO+8L,EAAgB/8L,EAAE83E,GAAO3xE,EAAE2xE,IAC9C,OAAO,EAIX,OAAO,EAEP,OAAO93E,IAAMmG,EA2DV,SAAS62L,EAAKx7L,EAAQs2E,EAAMmlH,GACjC,IAEIt/C,EAFAu/C,GAAiB,EAIrBt8L,OAAOC,eAAeW,EAAQs2E,EAAM,CAClCx2E,IAAK,WAMH,OALI47L,IACFv/C,EAASs/C,IACTC,GAAiB,GAGZv/C,GAET11E,IAAK,SAAa/pE,GAChBy/I,EAASz/I,EACTg/L,GAAiB,GAEnBx8L,cAAc,EACdD,YAAY,IAsCT,SAASgB,EAAeD,EAAQJ,GACrC,OAAOI,GAAUZ,OAAOa,eAAe9B,KAAK6B,EAAQJ,GAgH/C,SAAS+7L,EAAY37L,EAAQ42C,GAGlC,IAFA,IAAIltB,EAAO,GAEF/tB,EAAI,EAAGA,EAAIi7C,EAAWl7C,OAAQC,IAAK,CAC1C,IAAIY,EAAMq6C,EAAWj7C,GACjBe,EAAQsD,EAAOzD,QAELe,IAAVZ,IACFgtB,EAAKntB,GAAOG,GAIhB,OAAOgtB,I,0GCzYT,SAASkyK,EAAsBn5L,EAAG1C,EAAMuQ,GACtC,IACIurL,EAAO,IAAIC,EADKr5L,EAAE7B,aACO,GACzB4jC,EAAS,GAEb,GAAIl0B,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAIlH,MAAM,kCAGlB,KAAK,OAAUkH,GACb,MAAM,IAAIlH,MAAM,2BAGlB,GAAI3G,EAAEy2F,YAAY2iG,EAAKj3L,IAAI0L,EAAO,GAAGqrF,IAAI,KAAOl5F,EAAE04F,SAAS0gG,EAAKj3L,IAAI0L,EAAO,GAAGosF,KAAK,IACjF,MAAM,IAAItzF,MAAM,8BAA8BT,OAAO2H,EAAO,EAAG,QAAQ3H,OAAO2H,EAAO,EAAG,QAG1F,IAAK7N,EAAE8zD,YACL,MAAM,IAAIntD,MAAM,4BAGd3G,EAAE04F,SAAS,KACb14F,EAAIA,EAAE+G,IAAIqyL,EAAKj3L,IAAI0L,KAGrBk0B,EAAS,IAAI77B,OAAO2H,GAGtB,OAAQvQ,GACN,KAAK,EACH,MAAO,GAAG4I,OAAOlG,EAAEm6F,YAAYj0F,OAAO67B,GAExC,KAAK,EACH,MAAO,GAAG77B,OAAOlG,EAAEi7F,WAAW/0F,OAAO67B,GAEvC,KAAK,GACH,MAAO,GAAG77B,OAAOlG,EAAE66F,iBAAiB30F,OAAO67B,GAE7C,QACE,MAAM,IAAIp7B,MAAM,QAAQT,OAAO5I,EAAM,qBA8MpC,SAASy4F,EAAc97F,EAAOk4F,GACnC,YAAkBt3F,IAAds3F,EACKl4F,EAAM87F,cAAc5D,EAAY,GAEhCl4F,EAAM87F,gBC1PV,SAASz4D,EAASvoB,EAAM4oF,GAC7B,IAAIvjF,EAAQrF,EAAK9b,OAAS0kG,EAAO1kG,OAC7BohB,EAAMtF,EAAK9b,OACf,OAAO8b,EAAK03B,UAAUryB,EAAOC,KAASsjF,EAsCjC,SAAS,EAAO1jG,EAAO0b,GAC5B,MAAqB,iBAAV1b,GACF,QAAaA,EAAO0b,IAGzB,EAAA2sG,EAAA,IAAYroH,GDgFX,SAAgBA,EAAO0b,GAC5B,GAAuB,mBAAZA,EAET,OAAOA,EAAQ1b,GAIjB,IAAKA,EAAMmiE,WACT,OAAOniE,EAAMiJ,QAAU,MAAQjJ,EAAMy8F,GAAG,GAAK,WAAa,YAI5D,IACIvE,EACAwvD,EAFAD,EAAW,OAIf,QAAgB7mJ,IAAZ8a,IAEEA,EAAQ+rI,WACVA,EAAW/rI,EAAQ+rI,UAIE,iBAAZ/rI,EACTw8E,EAAYx8E,EACHA,EAAQw8E,YACjBA,EAAYx8E,EAAQw8E,WAGlBx8E,EAAQgsI,UAGc,iBAFxBA,EAAWhsI,EAAQgsI,WAGjB,MAAM,IAAIh7I,MAAM,sCAMtB,OAAQ+6I,GACN,IAAK,QACH,OA6FC,SAAiBznJ,EAAOk4F,GAC7B,OAAOl4F,EAAMsJ,QAAQ4uF,GA9FV5uF,CAAQtJ,EAAOk4F,GAExB,IAAK,cACH,OAAO4D,EAAc97F,EAAOk4F,GAE9B,IAAK,cACH,OAkDC,SAAuBl4F,EAAOk4F,GAEnC,IAAIx2F,EAAI1B,EAAM0B,EACVq8L,EAASr8L,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAE3D29L,EAAkBr/L,EAAMggG,IAAIz5F,KAAK2B,IAAI,IAAK61L,IAC1CvgD,EAAW6hD,EAAgBj+F,YAAYlJ,GAM3C,OAJ+B,IAA3BslD,EAAS30I,QAAQ,OACnB20I,EAAW6hD,EAAgBr5L,YAGtBw3I,EAAW,KAAO97I,GAAK,EAAI,IAAM,IAAMq8L,EAAO/3L,WA9D1Co4L,CAAcp+L,EAAOk4F,GAE9B,IAAK,MACH,OAAOgnG,EAAsBl/L,EAAO,EAAG0nJ,GAEzC,IAAK,MACH,OAAOw3C,EAAsBl/L,EAAO,EAAG0nJ,GAEzC,IAAK,MACH,OAAOw3C,EAAsBl/L,EAAO,GAAI0nJ,GAE1C,IAAK,OAID,IAAI22C,EAAW3iL,QAAgC9a,IAArB8a,EAAQ2iL,SAAyB3iL,EAAQ2iL,UAAY,EAC3EC,EAAW5iL,QAAgC9a,IAArB8a,EAAQ4iL,SAAyB5iL,EAAQ4iL,SAAW,EAE9E,GAAIt+L,EAAM67F,SAAU,MAAO,IAG3B,IAAI+hG,EAAU59L,EAAMqhG,oBAAoBnJ,GACpCvuF,EAAMi0L,EAAQl8L,EAWlB,OATIiI,GAAO00L,GAAY10L,EAAM20L,EAErBV,EAAQt0L,UAGRwyF,EAAc97F,EAAOk4F,IAIlB9xE,QAAQ,uBAAuB,WACxC,IAAI1c,EAASjJ,UAAU,GACnBiB,EAAIjB,UAAU,GAClB,MAAkB,MAAXiJ,EAAiBA,EAAShI,EAAIA,KAI3C,QACE,MAAM,IAAIgL,MAAM,qBAAuB+6I,EAAvB,qECvKX7d,CAAgB5pI,EAAO0b,GA+HlC,SAA2B1b,GACzB,OAAOA,GAA0B,iBAAVA,GAAyC,iBAAZA,EAAMsmC,GAAqC,iBAAZtmC,EAAM+F,GAAqC,iBAAZ/F,EAAMiQ,IAAkB,EA3HtIqvL,CAAkBt/L,GACf0b,GAAgC,YAArBA,EAAQ0nH,SAKfpjI,EAAMgG,WAHNhG,EAAMsmC,EAAItmC,EAAM+F,EAAI,IAAM/F,EAAMiQ,EAOvC9Q,MAAMoF,QAAQvE,GACTu/L,EAAYv/L,EAAO0b,IAGxB,EAAA2sG,EAAA,IAASroH,GACJ,IAAMA,EAAQ,IAGF,mBAAVA,EACFA,EAAMu5H,OAASxuH,OAAO/K,EAAMu5H,QAAU,WAG3Cv5H,GAA0B,iBAAVA,EACU,mBAAjBA,EAAM4pI,OACR5pI,EAAM4pI,OAAOluH,GACX1b,GAASA,EAAMgG,SAAS0V,KAAa,GAAG1V,WAE1ChG,EAAMgG,SAAS0V,GAKf,IAHOhZ,OAAOsE,KAAKhH,GAAO6H,KAAIhI,GAC5B,IAAMA,EAAM,MAAQ,EAAOG,EAAMH,GAAM6b,KAE3BiW,KAAK,MAAQ,IAI/B5mB,OAAO/K,GAST,SAASoM,EAAUpM,GAKxB,IAJA,IAAI8a,EAAO/P,OAAO/K,GACdw/L,EAAU,GACVvgM,EAAI,EAEDA,EAAI6b,EAAK9b,QAAQ,CACtB,IAAIiO,EAAI6N,EAAKw/E,OAAOr7F,GAEV,OAANgO,GACFuyL,GAAWvyL,EACXhO,IAGU,MAFVgO,EAAI6N,EAAKw/E,OAAOr7F,MAE6B,IAA7B,aAAa4J,QAAQoE,KACnCuyL,GAAW,MAGbA,GAAWvyL,GAEXuyL,GADe,MAANvyL,EACE,MAEAA,EAGbhO,IAGF,MAAO,IAAMugM,EAAU,IAQlB,SAAS,EAAOx/L,GACrB,IAAI8a,EAAO/P,OAAO/K,GAElB,OADO8a,EAAKsL,QAAQ,KAAM,SAASA,QAAQ,KAAM,UAAUA,QAAQ,KAAM,SAASA,QAAQ,KAAM,QAAQA,QAAQ,KAAM,QAcxH,SAASm5K,EAAYj5L,EAAOoV,GAC1B,GAAIvc,MAAMoF,QAAQ+B,GAAQ,CAIxB,IAHA,IAAI6T,EAAM,IACNpb,EAAMuH,EAAMtH,OAEPC,EAAI,EAAGA,EAAIF,EAAKE,IACb,IAANA,IACFkb,GAAO,MAGTA,GAAOolL,EAAYj5L,EAAMrH,GAAIyc,GAI/B,OADAvB,EAAO,IAGP,OAAO,EAAO7T,EAAOoV,GAqBlB,SAASktH,EAAY7hI,EAAGe,GAE7B,KAAK,EAAAugH,EAAA,IAASthH,GACZ,MAAM,IAAI/F,UAAU,sGAA4G,QAAO+F,GAAK,eAG9I,KAAK,EAAAshH,EAAA,IAASvgH,GACZ,MAAM,IAAI9G,UAAU,sGAA4G,QAAO8G,GAAK,eAG9I,OAAOf,IAAMe,EAAI,EAAIf,EAAIe,EAAI,GAAK,I,SCrMpC,IAAIq7C,EAAW,SAAU/8C,GACvB,aAEA,IAEIxF,EAFA6+L,EAAK/8L,OAAOnB,UACZm+L,EAASD,EAAGl8L,eAEZo8L,EAA4B,mBAAXn7L,OAAwBA,OAAS,GAClDo7L,EAAiBD,EAAQl7L,UAAY,aACrCo7L,EAAsBF,EAAQG,eAAiB,kBAC/CC,EAAoBJ,EAAQtqF,aAAe,gBAE/C,SAAS2qF,EAAOh9L,EAAKnD,EAAKG,GAOxB,OANA0C,OAAOC,eAAeK,EAAKnD,EAAK,CAC9BG,MAAOA,EACPuC,YAAY,EACZC,cAAc,EACdC,UAAU,IAELO,EAAInD,GAEb,IAEEmgM,EAAO,GAAI,IACX,MAAOr/L,GACPq/L,EAAS,SAASh9L,EAAKnD,EAAKG,GAC1B,OAAOgD,EAAInD,GAAOG,GAItB,SAASigM,EAAKC,EAASC,EAAS9gM,EAAM+gM,GAEpC,IAAIC,EAAiBF,GAAWA,EAAQ5+L,qBAAqB++L,EAAYH,EAAUG,EAC/EC,EAAY79L,OAAOuB,OAAOo8L,EAAe9+L,WACzCgoH,EAAU,IAAIi3E,EAAQJ,GAAe,IAMzC,OAFAG,EAAUE,QAsMZ,SAA0BP,EAAS7gM,EAAMkqH,GACvC,IAAI32G,EAAQ8tL,EAEZ,OAAO,SAAgBv2I,EAAQrqD,GAC7B,GAAI8S,IAAU+tL,EACZ,MAAM,IAAIj0L,MAAM,gCAGlB,GAAIkG,IAAUguL,EAAmB,CAC/B,GAAe,UAAXz2I,EACF,MAAMrqD,EAKR,OAAO+gM,IAMT,IAHAt3E,EAAQp/D,OAASA,EACjBo/D,EAAQzpH,IAAMA,IAED,CACX,IAAIghM,EAAWv3E,EAAQu3E,SACvB,GAAIA,EAAU,CACZ,IAAIC,EAAiBC,EAAoBF,EAAUv3E,GACnD,GAAIw3E,EAAgB,CAClB,GAAIA,IAAmBE,EAAkB,SACzC,OAAOF,GAIX,GAAuB,SAAnBx3E,EAAQp/D,OAGVo/D,EAAQ23E,KAAO33E,EAAQ43E,MAAQ53E,EAAQzpH,SAElC,GAAuB,UAAnBypH,EAAQp/D,OAAoB,CACrC,GAAIv3C,IAAU8tL,EAEZ,MADA9tL,EAAQguL,EACFr3E,EAAQzpH,IAGhBypH,EAAQ63E,kBAAkB73E,EAAQzpH,SAEN,WAAnBypH,EAAQp/D,QACjBo/D,EAAQ83E,OAAO,SAAU93E,EAAQzpH,KAGnC8S,EAAQ+tL,EAER,IAAIW,EAASC,EAASrB,EAAS7gM,EAAMkqH,GACrC,GAAoB,WAAhB+3E,EAAOjpL,KAAmB,CAO5B,GAJAzF,EAAQ22G,EAAQrpH,KACZ0gM,EACAY,EAEAF,EAAOxhM,MAAQmhM,EACjB,SAGF,MAAO,CACLjhM,MAAOshM,EAAOxhM,IACdI,KAAMqpH,EAAQrpH,MAGS,UAAhBohM,EAAOjpL,OAChBzF,EAAQguL,EAGRr3E,EAAQp/D,OAAS,QACjBo/D,EAAQzpH,IAAMwhM,EAAOxhM,OA9QP2hM,CAAiBvB,EAAS7gM,EAAMkqH,GAE7Cg3E,EAcT,SAASgB,EAASjhM,EAAI0C,EAAKlD,GACzB,IACE,MAAO,CAAEuY,KAAM,SAAUvY,IAAKQ,EAAGmB,KAAKuB,EAAKlD,IAC3C,MAAOa,GACP,MAAO,CAAE0X,KAAM,QAASvY,IAAKa,IAhBjCyF,EAAQ65L,KAAOA,EAoBf,IAAIS,EAAyB,iBACzBc,EAAyB,iBACzBb,EAAoB,YACpBC,EAAoB,YAIpBK,EAAmB,GAMvB,SAASX,KACT,SAASoB,KACT,SAASC,KAIT,IAAIC,EAAoB,GACxBA,EAAkBhC,GAAkB,WAClC,OAAOr/L,MAGT,IAAIshM,EAAWn/L,OAAOc,eAClBs+L,EAA0BD,GAAYA,EAASA,EAASx1L,EAAO,MAC/Dy1L,GACAA,IAA4BrC,GAC5BC,EAAOj+L,KAAKqgM,EAAyBlC,KAGvCgC,EAAoBE,GAGtB,IAAIC,EAAKJ,EAA2BpgM,UAClC++L,EAAU/+L,UAAYmB,OAAOuB,OAAO29L,GAWtC,SAASI,EAAsBzgM,GAC7B,CAAC,OAAQ,QAAS,UAAU+b,SAAQ,SAAS6sC,GAC3C61I,EAAOz+L,EAAW4oD,GAAQ,SAASrqD,GACjC,OAAOS,KAAKkgM,QAAQt2I,EAAQrqD,SAkClC,SAASmiM,EAAc1B,EAAW2B,GAChC,SAASvyC,EAAOxlG,EAAQrqD,EAAKL,EAASC,GACpC,IAAI4hM,EAASC,EAAShB,EAAUp2I,GAASo2I,EAAWzgM,GACpD,GAAoB,UAAhBwhM,EAAOjpL,KAEJ,CACL,IAAI0T,EAASu1K,EAAOxhM,IAChBE,EAAQ+rB,EAAO/rB,MACnB,OAAIA,GACiB,iBAAVA,GACP0/L,EAAOj+L,KAAKzB,EAAO,WACdkiM,EAAYziM,QAAQO,EAAMmiM,SAAS/hM,MAAK,SAASJ,GACtD2vJ,EAAO,OAAQ3vJ,EAAOP,EAASC,MAC9B,SAASiB,GACVgvJ,EAAO,QAAShvJ,EAAKlB,EAASC,MAI3BwiM,EAAYziM,QAAQO,GAAOI,MAAK,SAASgiM,GAI9Cr2K,EAAO/rB,MAAQoiM,EACf3iM,EAAQssB,MACP,SAAS9rB,GAGV,OAAO0vJ,EAAO,QAAS1vJ,EAAOR,EAASC,MAvBzCA,EAAO4hM,EAAOxhM,KA4BlB,IAAIuiM,EAgCJ9hM,KAAKkgM,QA9BL,SAAiBt2I,EAAQrqD,GACvB,SAASwiM,IACP,OAAO,IAAIJ,GAAY,SAASziM,EAASC,GACvCiwJ,EAAOxlG,EAAQrqD,EAAKL,EAASC,MAIjC,OAAO2iM,EAaLA,EAAkBA,EAAgBjiM,KAChCkiM,EAGAA,GACEA,KAkHV,SAAStB,EAAoBF,EAAUv3E,GACrC,IAAIp/D,EAAS22I,EAASr8L,SAAS8kH,EAAQp/D,QACvC,GAAIA,IAAWvpD,EAAW,CAKxB,GAFA2oH,EAAQu3E,SAAW,KAEI,UAAnBv3E,EAAQp/D,OAAoB,CAE9B,GAAI22I,EAASr8L,SAAiB,SAG5B8kH,EAAQp/D,OAAS,SACjBo/D,EAAQzpH,IAAMc,EACdogM,EAAoBF,EAAUv3E,GAEP,UAAnBA,EAAQp/D,QAGV,OAAO82I,EAIX13E,EAAQp/D,OAAS,QACjBo/D,EAAQzpH,IAAM,IAAIkB,UAChB,kDAGJ,OAAOigM,EAGT,IAAIK,EAASC,EAASp3I,EAAQ22I,EAASr8L,SAAU8kH,EAAQzpH,KAEzD,GAAoB,UAAhBwhM,EAAOjpL,KAIT,OAHAkxG,EAAQp/D,OAAS,QACjBo/D,EAAQzpH,IAAMwhM,EAAOxhM,IACrBypH,EAAQu3E,SAAW,KACZG,EAGT,IAAIlhM,EAAOuhM,EAAOxhM,IAElB,OAAMC,EAOFA,EAAKG,MAGPqpH,EAAQu3E,EAASyB,YAAcxiM,EAAKC,MAGpCupH,EAAQvkH,KAAO87L,EAAS0B,QAQD,WAAnBj5E,EAAQp/D,SACVo/D,EAAQp/D,OAAS,OACjBo/D,EAAQzpH,IAAMc,GAUlB2oH,EAAQu3E,SAAW,KACZG,GANElhM,GA3BPwpH,EAAQp/D,OAAS,QACjBo/D,EAAQzpH,IAAM,IAAIkB,UAAU,oCAC5BuoH,EAAQu3E,SAAW,KACZG,GAoDX,SAASwB,EAAaC,GACpB,IAAI1yH,EAAQ,CAAE2yH,OAAQD,EAAK,IAEvB,KAAKA,IACP1yH,EAAM4yH,SAAWF,EAAK,IAGpB,KAAKA,IACP1yH,EAAM6yH,WAAaH,EAAK,GACxB1yH,EAAM8yH,SAAWJ,EAAK,IAGxBniM,KAAKwiM,WAAWhhM,KAAKiuE,GAGvB,SAASgzH,EAAchzH,GACrB,IAAIsxH,EAAStxH,EAAMizH,YAAc,GACjC3B,EAAOjpL,KAAO,gBACPipL,EAAOxhM,IACdkwE,EAAMizH,WAAa3B,EAGrB,SAASd,EAAQJ,GAIf7/L,KAAKwiM,WAAa,CAAC,CAAEJ,OAAQ,SAC7BvC,EAAY9iL,QAAQmlL,EAAcliM,MAClCA,KAAK2iM,OAAM,GA8Bb,SAAS72L,EAAOwxG,GACd,GAAIA,EAAU,CACZ,IAAIslF,EAAiBtlF,EAAS+hF,GAC9B,GAAIuD,EACF,OAAOA,EAAe1hM,KAAKo8G,GAG7B,GAA6B,mBAAlBA,EAAS74G,KAClB,OAAO64G,EAGT,IAAK50G,MAAM40G,EAAS7+G,QAAS,CAC3B,IAAIC,GAAK,EAAG+F,EAAO,SAASA,IAC1B,OAAS/F,EAAI4+G,EAAS7+G,QACpB,GAAI0gM,EAAOj+L,KAAKo8G,EAAU5+G,GAGxB,OAFA+F,EAAKhF,MAAQ69G,EAAS5+G,GACtB+F,EAAK9E,MAAO,EACL8E,EAOX,OAHAA,EAAKhF,MAAQY,EACboE,EAAK9E,MAAO,EAEL8E,GAGT,OAAOA,EAAKA,KAAOA,GAKvB,MAAO,CAAEA,KAAM67L,GAIjB,SAASA,IACP,MAAO,CAAE7gM,MAAOY,EAAWV,MAAM,GA+MnC,OA5mBAwhM,EAAkBngM,UAAYwgM,EAAG79L,YAAcy9L,EAC/CA,EAA2Bz9L,YAAcw9L,EACzCA,EAAkB0B,YAAcpD,EAC9B2B,EACA5B,EACA,qBAaF35L,EAAQi9L,oBAAsB,SAASC,GACrC,IAAIC,EAAyB,mBAAXD,GAAyBA,EAAOp/L,YAClD,QAAOq/L,IACHA,IAAS7B,GAG2B,uBAAnC6B,EAAKH,aAAeG,EAAKt9L,QAIhCG,EAAQyrJ,KAAO,SAASyxC,GAQtB,OAPI5gM,OAAOR,eACTQ,OAAOR,eAAeohM,EAAQ3B,IAE9B2B,EAAOz/L,UAAY89L,EACnB3B,EAAOsD,EAAQvD,EAAmB,sBAEpCuD,EAAO/hM,UAAYmB,OAAOuB,OAAO89L,GAC1BuB,GAOTl9L,EAAQo9L,MAAQ,SAAS1jM,GACvB,MAAO,CAAEqiM,QAASriM,IAsEpBkiM,EAAsBC,EAAc1gM,WACpC0gM,EAAc1gM,UAAUs+L,GAAuB,WAC7C,OAAOt/L,MAET6F,EAAQ67L,cAAgBA,EAKxB77L,EAAQq9L,MAAQ,SAASvD,EAASC,EAAS9gM,EAAM+gM,EAAa8B,QACxC,IAAhBA,IAAwBA,EAAc/hM,SAE1C,IAAIuF,EAAO,IAAIu8L,EACbhC,EAAKC,EAASC,EAAS9gM,EAAM+gM,GAC7B8B,GAGF,OAAO97L,EAAQi9L,oBAAoBlD,GAC/Bz6L,EACAA,EAAKV,OAAO5E,MAAK,SAAS2rB,GACxB,OAAOA,EAAO7rB,KAAO6rB,EAAO/rB,MAAQ0F,EAAKV,WAuKjDg9L,EAAsBD,GAEtB/B,EAAO+B,EAAIhC,EAAmB,aAO9BgC,EAAGnC,GAAkB,WACnB,OAAOr/L,MAGTwhM,EAAG/7L,SAAW,WACZ,MAAO,sBAkCTI,EAAQY,KAAO,SAAS1D,GACtB,IAAI0D,EAAO,GACX,IAAK,IAAInH,KAAOyD,EACd0D,EAAKjF,KAAKlC,GAMZ,OAJAmH,EAAKurB,UAIE,SAASvtB,IACd,KAAOgC,EAAKhI,QAAQ,CAClB,IAAIa,EAAMmH,EAAK+yD,MACf,GAAIl6D,KAAOyD,EAGT,OAFA0B,EAAKhF,MAAQH,EACbmF,EAAK9E,MAAO,EACL8E,EAQX,OADAA,EAAK9E,MAAO,EACL8E,IAsCXoB,EAAQiG,OAASA,EAMjBm0L,EAAQj/L,UAAY,CAClB2C,YAAas8L,EAEb0C,MAAO,SAASQ,GAcd,GAbAnjM,KAAKygF,KAAO,EACZzgF,KAAKyE,KAAO,EAGZzE,KAAK2gM,KAAO3gM,KAAK4gM,MAAQvgM,EACzBL,KAAKL,MAAO,EACZK,KAAKugM,SAAW,KAEhBvgM,KAAK4pD,OAAS,OACd5pD,KAAKT,IAAMc,EAEXL,KAAKwiM,WAAWzlL,QAAQ0lL,IAEnBU,EACH,IAAK,IAAIz9L,KAAQ1F,KAEQ,MAAnB0F,EAAKq0F,OAAO,IACZolG,EAAOj+L,KAAKlB,KAAM0F,KACjBgD,OAAOhD,EAAKZ,MAAM,MACrB9E,KAAK0F,GAAQrF,IAMrB+iM,KAAM,WACJpjM,KAAKL,MAAO,EAEZ,IACI0jM,EADYrjM,KAAKwiM,WAAW,GACLE,WAC3B,GAAwB,UAApBW,EAAWvrL,KACb,MAAMurL,EAAW9jM,IAGnB,OAAOS,KAAKsjM,MAGdzC,kBAAmB,SAAStnI,GAC1B,GAAIv5D,KAAKL,KACP,MAAM45D,EAGR,IAAIyvD,EAAUhpH,KACd,SAASujM,EAAOC,EAAKC,GAYnB,OAXA1C,EAAOjpL,KAAO,QACdipL,EAAOxhM,IAAMg6D,EACbyvD,EAAQvkH,KAAO++L,EAEXC,IAGFz6E,EAAQp/D,OAAS,OACjBo/D,EAAQzpH,IAAMc,KAGNojM,EAGZ,IAAK,IAAI/kM,EAAIsB,KAAKwiM,WAAW/jM,OAAS,EAAGC,GAAK,IAAKA,EAAG,CACpD,IAAI+wE,EAAQzvE,KAAKwiM,WAAW9jM,GACxBqiM,EAAStxH,EAAMizH,WAEnB,GAAqB,SAAjBjzH,EAAM2yH,OAIR,OAAOmB,EAAO,OAGhB,GAAI9zH,EAAM2yH,QAAUpiM,KAAKygF,KAAM,CAC7B,IAAIijH,EAAWvE,EAAOj+L,KAAKuuE,EAAO,YAC9Bk0H,EAAaxE,EAAOj+L,KAAKuuE,EAAO,cAEpC,GAAIi0H,GAAYC,EAAY,CAC1B,GAAI3jM,KAAKygF,KAAOhR,EAAM4yH,SACpB,OAAOkB,EAAO9zH,EAAM4yH,UAAU,GACzB,GAAIriM,KAAKygF,KAAOhR,EAAM6yH,WAC3B,OAAOiB,EAAO9zH,EAAM6yH,iBAGjB,GAAIoB,GACT,GAAI1jM,KAAKygF,KAAOhR,EAAM4yH,SACpB,OAAOkB,EAAO9zH,EAAM4yH,UAAU,OAG3B,KAAIsB,EAMT,MAAM,IAAIx3L,MAAM,0CALhB,GAAInM,KAAKygF,KAAOhR,EAAM6yH,WACpB,OAAOiB,EAAO9zH,EAAM6yH,gBAU9BxB,OAAQ,SAAShpL,EAAMvY,GACrB,IAAK,IAAIb,EAAIsB,KAAKwiM,WAAW/jM,OAAS,EAAGC,GAAK,IAAKA,EAAG,CACpD,IAAI+wE,EAAQzvE,KAAKwiM,WAAW9jM,GAC5B,GAAI+wE,EAAM2yH,QAAUpiM,KAAKygF,MACrB0+G,EAAOj+L,KAAKuuE,EAAO,eACnBzvE,KAAKygF,KAAOhR,EAAM6yH,WAAY,CAChC,IAAIsB,EAAen0H,EACnB,OAIAm0H,IACU,UAAT9rL,GACS,aAATA,IACD8rL,EAAaxB,QAAU7iM,GACvBA,GAAOqkM,EAAatB,aAGtBsB,EAAe,MAGjB,IAAI7C,EAAS6C,EAAeA,EAAalB,WAAa,GAItD,OAHA3B,EAAOjpL,KAAOA,EACdipL,EAAOxhM,IAAMA,EAETqkM,GACF5jM,KAAK4pD,OAAS,OACd5pD,KAAKyE,KAAOm/L,EAAatB,WAClB5B,GAGF1gM,KAAK6jM,SAAS9C,IAGvB8C,SAAU,SAAS9C,EAAQwB,GACzB,GAAoB,UAAhBxB,EAAOjpL,KACT,MAAMipL,EAAOxhM,IAcf,MAXoB,UAAhBwhM,EAAOjpL,MACS,aAAhBipL,EAAOjpL,KACT9X,KAAKyE,KAAOs8L,EAAOxhM,IACM,WAAhBwhM,EAAOjpL,MAChB9X,KAAKsjM,KAAOtjM,KAAKT,IAAMwhM,EAAOxhM,IAC9BS,KAAK4pD,OAAS,SACd5pD,KAAKyE,KAAO,OACa,WAAhBs8L,EAAOjpL,MAAqByqL,IACrCviM,KAAKyE,KAAO89L,GAGP7B,GAGToD,OAAQ,SAASxB,GACf,IAAK,IAAI5jM,EAAIsB,KAAKwiM,WAAW/jM,OAAS,EAAGC,GAAK,IAAKA,EAAG,CACpD,IAAI+wE,EAAQzvE,KAAKwiM,WAAW9jM,GAC5B,GAAI+wE,EAAM6yH,aAAeA,EAGvB,OAFAtiM,KAAK6jM,SAASp0H,EAAMizH,WAAYjzH,EAAM8yH,UACtCE,EAAchzH,GACPixH,IAKb,MAAS,SAAS0B,GAChB,IAAK,IAAI1jM,EAAIsB,KAAKwiM,WAAW/jM,OAAS,EAAGC,GAAK,IAAKA,EAAG,CACpD,IAAI+wE,EAAQzvE,KAAKwiM,WAAW9jM,GAC5B,GAAI+wE,EAAM2yH,SAAWA,EAAQ,CAC3B,IAAIrB,EAAStxH,EAAMizH,WACnB,GAAoB,UAAhB3B,EAAOjpL,KAAkB,CAC3B,IAAIisL,EAAShD,EAAOxhM,IACpBkjM,EAAchzH,GAEhB,OAAOs0H,GAMX,MAAM,IAAI53L,MAAM,0BAGlB63L,cAAe,SAAS1mF,EAAU0kF,EAAYC,GAa5C,OAZAjiM,KAAKugM,SAAW,CACdr8L,SAAU4H,EAAOwxG,GACjB0kF,WAAYA,EACZC,QAASA,GAGS,SAAhBjiM,KAAK4pD,SAGP5pD,KAAKT,IAAMc,GAGNqgM,IAQJ76L,EA7sBK,CAotBiBD,EAAOC,SAGtC,IACEo+L,mBAAqBrhJ,EACrB,MAAOshJ,GAUPziM,SAAS,IAAK,yBAAdA,CAAwCmhD,K,eC9tB1C,IAAIuhJ,EAAO,EAAQ,MAKfC,EAAS,EAAQ,MAKjBC,EAAS,EAAQ,KAQjBC,EAAY,EAAQ,MASpBC,EAAU,EAAQ,MAOlBC,EAAS,EAAQ,MAIjBC,EAAK,EAAQ,MAEjBA,EAAGN,KAAOA,EACVM,EAAGL,OAASA,EACZK,EAAGJ,OAASA,EACZI,EAAGH,UAAYA,EACfG,EAAGF,QAAUA,EACbE,EAAGD,OAASA,EAEZ5+L,EAAOC,QAAU4+L,G,qBC3DjB,OA2BA,SAAUC,EAAQ9+L,EAAQ65L,GAE1B,SAASkF,EAAK36C,GACZ,IAgDIxkJ,EAhDAs5I,EAAK9+I,KAAM4kM,GAgDXp/L,EAAI,WAEG,SAASqS,GAClBA,EAAOrN,OAAOqN,GACd,IAAK,IAAInZ,EAAI,EAAGA,EAAImZ,EAAKpZ,OAAQC,IAAK,CAEpC,IAAIw9C,EAAI,oBADR12C,GAAKqS,EAAKurF,WAAW1kG,IAGrBw9C,GADA12C,EAAI02C,IAAM,EAGV12C,GADA02C,GAAK12C,KACK,EAEVA,GAAS,YADT02C,GAAK12C,GAGP,OAAmB,wBAAXA,IAAM,KA5DhBs5I,EAAGr6I,KAAO,WACR,IAAIslB,EAAI,QAAU+0H,EAAG+lD,GAAY,uBAAP/lD,EAAGpyI,EAG7B,OAFAoyI,EAAG+lD,GAAK/lD,EAAGgmD,GACXhmD,EAAGgmD,GAAKhmD,EAAG8uC,GACJ9uC,EAAG8uC,GAAK7jK,GAAK+0H,EAAGpyI,EAAQ,EAAJqd,IAI7B+0H,EAAGpyI,EAAI,EACPoyI,EAAG+lD,GAAKD,EAAK,KACb9lD,EAAGgmD,GAAKF,EAAK,KACb9lD,EAAG8uC,GAAKgX,EAAK,KACb9lD,EAAG+lD,IAAMD,EAAK56C,GACVlL,EAAG+lD,GAAK,IAAK/lD,EAAG+lD,IAAM,GAC1B/lD,EAAGgmD,IAAMF,EAAK56C,GACVlL,EAAGgmD,GAAK,IAAKhmD,EAAGgmD,IAAM,GAC1BhmD,EAAG8uC,IAAMgX,EAAK56C,GACVlL,EAAG8uC,GAAK,IAAK9uC,EAAG8uC,IAAM,GAC1BgX,EAAO,KAGT,SAASn4K,EAAKlJ,EAAGwG,GAKf,OAJAA,EAAErd,EAAI6W,EAAE7W,EACRqd,EAAE86K,GAAKthL,EAAEshL,GACT96K,EAAE+6K,GAAKvhL,EAAEuhL,GACT/6K,EAAE6jK,GAAKrqK,EAAEqqK,GACF7jK,EAGT,SAASg7K,EAAK/6C,EAAMzlE,GAClB,IAAIygH,EAAK,IAAIL,EAAK36C,GACd33I,EAAQkyE,GAAQA,EAAKlyE,MACrB4yL,EAAOD,EAAGvgM,KAUd,OATAwgM,EAAKC,MAAQ,WAAa,OAAoB,WAAZF,EAAGvgM,OAAwB,GAC7DwgM,EAAKE,OAAS,WACZ,OAAOF,IAAmC,uBAAhB,QAATA,IAAoB,IAEvCA,EAAKG,MAAQH,EACT5yL,IACmB,iBAAX,GAAqBoa,EAAKpa,EAAO2yL,GAC3CC,EAAK5yL,MAAQ,WAAa,OAAOoa,EAAKu4K,EAAI,MAErCC,EAyBLr/L,GAAUA,EAAOC,QACnBD,EAAOC,QAAUk/L,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC/kM,KAAKmkM,KAAOY,EA7Ed,CAiFE/kM,E,WAEA,S,qBC9GF,OAIA,SAAU0kM,EAAQ9+L,EAAQ65L,GAE1B,SAAS4F,EAAOr7C,GACd,IAAIlL,EAAK9+I,KAAMslM,EAAU,GAGzBxmD,EAAGr6I,KAAO,WACR,IAAIiD,EAAIo3I,EAAGp3I,EAAGgF,EAAIoyI,EAAGpyI,EAAGgD,EAAIovI,EAAGpvI,EAAGnO,EAAIu9I,EAAGv9I,EAQzC,OAPAmG,EAAKA,GAAK,GAAOA,IAAM,EAAKgF,EAC5BA,EAAKA,EAAIgD,EAAK,EACdA,EAAKA,GAAK,GAAOA,IAAM,EAAKnO,EAC5BA,EAAKA,EAAImG,EAAK,EACdo3I,EAAGp3I,EAAIA,EAAKA,GAAK,GAAOA,IAAM,GAAMgF,EACpCoyI,EAAGpyI,EAAIA,EAAKA,EAAIgD,EAAK,EACrBovI,EAAGpvI,EAAKA,GAAK,GAAOhD,IAAM,GAAMnL,EACzBu9I,EAAGv9I,EAAKA,EAAImG,EAAK,GAmB1Bo3I,EAAGv9I,EAAI,EACPu9I,EAAGp3I,EAAI,EACPo3I,EAAGpyI,GAAI,WACPoyI,EAAGpvI,EAAI,WAEHs6I,IAAShkJ,KAAKiC,MAAM+hJ,IAEtBlL,EAAGv9I,EAAKyoJ,EAAO,WAAe,EAC9BlL,EAAGp3I,EAAW,EAAPsiJ,GAGPs7C,GAAWt7C,EAIb,IAAK,IAAItjJ,EAAI,EAAGA,EAAI4+L,EAAQ7mM,OAAS,GAAIiI,IACvCo4I,EAAGp3I,GAA6B,EAAxB49L,EAAQliG,WAAW18F,GAC3Bo4I,EAAGr6I,OAIP,SAASgoB,EAAKlJ,EAAGwG,GAKf,OAJAA,EAAExoB,EAAIgiB,EAAEhiB,EACRwoB,EAAEriB,EAAI6b,EAAE7b,EACRqiB,EAAErd,EAAI6W,EAAE7W,EACRqd,EAAEra,EAAI6T,EAAE7T,EACDqa,EAGT,SAASg7K,EAAK/6C,EAAMzlE,GAClB,IAAIygH,EAAK,IAAIK,EAAOr7C,GAChB33I,EAAQkyE,GAAQA,EAAKlyE,MACrB4yL,EAAO,WAAa,OAAQD,EAAGvgM,SAAW,GAAK,YAenD,OAdAwgM,EAAKE,OAAS,WACZ,GACE,IAEI35K,IAFMw5K,EAAGvgM,SAAW,KACbugM,EAAGvgM,SAAW,GAAK,aACF,GAAK,UACf,IAAX+mB,GACT,OAAOA,GAETy5K,EAAKC,MAAQF,EAAGvgM,KAChBwgM,EAAKG,MAAQH,EACT5yL,IACmB,iBAAX,GAAqBoa,EAAKpa,EAAO2yL,GAC3CC,EAAK5yL,MAAQ,WAAa,OAAOoa,EAAKu4K,EAAI,MAErCC,EAGLr/L,GAAUA,EAAOC,QACnBD,EAAOC,QAAUk/L,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC/kM,KAAKwkM,OAASO,EAzFhB,CA6FE/kM,E,WAEA,S,qBCnGF,OAGA,SAAU0kM,EAAQ9+L,EAAQ65L,GAE1B,SAAS4F,EAAOr7C,GACd,IAAIlL,EAAK9+I,KAAMslM,EAAU,GAEzBxmD,EAAGt4I,EAAI,EACPs4I,EAAGv3I,EAAI,EACPu3I,EAAG9vH,EAAI,EACP8vH,EAAGpuF,EAAI,EAGPouF,EAAGr6I,KAAO,WACR,IAAIslB,EAAI+0H,EAAGt4I,EAAKs4I,EAAGt4I,GAAK,GAIxB,OAHAs4I,EAAGt4I,EAAIs4I,EAAGv3I,EACVu3I,EAAGv3I,EAAIu3I,EAAG9vH,EACV8vH,EAAG9vH,EAAI8vH,EAAGpuF,EACHouF,EAAGpuF,GAAMouF,EAAGpuF,IAAM,GAAM3mC,EAAKA,IAAM,GAGxCigI,KAAiB,EAAPA,GAEZlL,EAAGt4I,EAAIwjJ,EAGPs7C,GAAWt7C,EAIb,IAAK,IAAItjJ,EAAI,EAAGA,EAAI4+L,EAAQ7mM,OAAS,GAAIiI,IACvCo4I,EAAGt4I,GAA6B,EAAxB8+L,EAAQliG,WAAW18F,GAC3Bo4I,EAAGr6I,OAIP,SAASgoB,EAAKlJ,EAAGwG,GAKf,OAJAA,EAAEvjB,EAAI+c,EAAE/c,EACRujB,EAAExiB,EAAIgc,EAAEhc,EACRwiB,EAAEiF,EAAIzL,EAAEyL,EACRjF,EAAE2mC,EAAIntC,EAAEmtC,EACD3mC,EAGT,SAASg7K,EAAK/6C,EAAMzlE,GAClB,IAAIygH,EAAK,IAAIK,EAAOr7C,GAChB33I,EAAQkyE,GAAQA,EAAKlyE,MACrB4yL,EAAO,WAAa,OAAQD,EAAGvgM,SAAW,GAAK,YAenD,OAdAwgM,EAAKE,OAAS,WACZ,GACE,IAEI35K,IAFMw5K,EAAGvgM,SAAW,KACbugM,EAAGvgM,SAAW,GAAK,aACF,GAAK,UACf,IAAX+mB,GACT,OAAOA,GAETy5K,EAAKC,MAAQF,EAAGvgM,KAChBwgM,EAAKG,MAAQH,EACT5yL,IACmB,iBAAX,GAAqBoa,EAAKpa,EAAO2yL,GAC3CC,EAAK5yL,MAAQ,WAAa,OAAOoa,EAAKu4K,EAAI,MAErCC,EAGLr/L,GAAUA,EAAOC,QACnBD,EAAOC,QAAUk/L,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC/kM,KAAKokM,OAASW,EApEhB,CAwEE/kM,E,WAEA,S,qBC7EF,OAyBA,SAAU0kM,EAAQ9+L,EAAQ65L,GAE1B,SAAS4F,EAAOr7C,GACd,IAAIlL,EAAK9+I,KAGT8+I,EAAGr6I,KAAO,WACR,IACwBslB,EAAGpjB,EADvB+pD,EAAIouF,EAAGpuF,EACP7pD,EAAIi4I,EAAGj4I,EAAGnI,EAAIogJ,EAAGpgJ,EAcrB,OAZAogJ,EAAGpuF,EAAIA,EAAKA,EAAI,WAAc,EAE9B/pD,EAAIE,EAAGnI,EAAI,GAAM,KACjBqrB,EAAIljB,EAAEnI,EAAMA,EAAI,EAAK,KACrBiI,GAAKA,GAAK,GACVojB,GAAKA,GAAK,GACVpjB,GAAKA,IAAM,GACXojB,GAAKA,IAAM,GAEXpjB,EAAIE,EAAEnI,GAAKiI,EAAIojB,EACf+0H,EAAGpgJ,EAAIA,EAECiI,GAAK+pD,EAAKA,IAAM,IAAQ,GAGlC,SAAcouF,EAAIkL,GAChB,IAAIjgI,EAAGpjB,EAAGjI,EAAG8I,EAAGkpD,EAAG7pD,EAAI,GAAIm3E,EAAQ,IAYnC,IAXIgsE,KAAiB,EAAPA,IAEZrjJ,EAAIqjJ,EACJA,EAAO,OAGPA,GAAc,KACdrjJ,EAAI,EACJq3E,EAAQh4E,KAAKyJ,IAAIuuE,EAAOgsE,EAAKvrJ,SAG1BC,EAAI,EAAG8I,GAAK,GAAIA,EAAIw2E,IAASx2E,EAE5BwiJ,IAAMrjJ,GAAKqjJ,EAAK5mD,YAAY57F,EAAI,IAAMwiJ,EAAKvrJ,SAErC,IAAN+I,IAASkpD,EAAI/pD,GACjBA,GAAKA,GAAK,GACVA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,GAAKA,IAAM,GACPa,GAAK,IACPkpD,EAAKA,EAAI,WAAc,EAEvBhyD,EAAK,IADLqrB,EAAKljB,EAAM,IAAJW,IAAab,EAAI+pD,GACThyD,EAAI,EAAI,GAW3B,IAPIA,GAAK,MACPmI,EAA+B,KAA5BmjJ,GAAQA,EAAKvrJ,QAAU,KAAa,GAKzCC,EAAI,IACC8I,EAAI,IAASA,EAAI,IAAKA,EACzBb,EAAIE,EAAGnI,EAAI,GAAM,KACjBqrB,EAAIljB,EAAEnI,EAAMA,EAAI,EAAK,KACrBiI,GAAKA,GAAK,GACVojB,GAAKA,GAAK,GACVpjB,GAAKA,IAAM,GACXojB,GAAKA,IAAM,GACXljB,EAAEnI,GAAKiI,EAAIojB,EAGb+0H,EAAGpuF,EAAIA,EACPouF,EAAGj4I,EAAIA,EACPi4I,EAAGpgJ,EAAIA,EAGTmrC,CAAKi1G,EAAIkL,GAGX,SAASv9H,EAAKlJ,EAAGwG,GAIf,OAHAA,EAAErrB,EAAI6kB,EAAE7kB,EACRqrB,EAAE2mC,EAAIntC,EAAEmtC,EACR3mC,EAAEljB,EAAI0c,EAAE1c,EAAE/B,QACHilB,EAGT,SAASg7K,EAAK/6C,EAAMzlE,GACN,MAARylE,IAAcA,GAAQ,IAAK51I,MAC/B,IAAI4wL,EAAK,IAAIK,EAAOr7C,GAChB33I,EAAQkyE,GAAQA,EAAKlyE,MACrB4yL,EAAO,WAAa,OAAQD,EAAGvgM,SAAW,GAAK,YAenD,OAdAwgM,EAAKE,OAAS,WACZ,GACE,IAEI35K,IAFMw5K,EAAGvgM,SAAW,KACbugM,EAAGvgM,SAAW,GAAK,aACF,GAAK,UACf,IAAX+mB,GACT,OAAOA,GAETy5K,EAAKC,MAAQF,EAAGvgM,KAChBwgM,EAAKG,MAAQH,EACT5yL,IACEA,EAAMxL,GAAG4lB,EAAKpa,EAAO2yL,GACzBC,EAAK5yL,MAAQ,WAAa,OAAOoa,EAAKu4K,EAAI,MAErCC,EAGLr/L,GAAUA,EAAOC,QACnBD,EAAOC,QAAUk/L,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC/kM,KAAKukM,QAAUQ,EAjHjB,CAqHE/kM,E,WAEA,S,qBChJF,OAKA,SAAU0kM,EAAQ9+L,EAAQ65L,GAE1B,SAAS4F,EAAOr7C,GACd,IAAIlL,EAAK9+I,KAGT8+I,EAAGr6I,KAAO,WAER,IAAwBslB,EAAGpjB,EAAvBE,EAAIi4I,EAAGt4I,EAAG9H,EAAIogJ,EAAGpgJ,EAQrB,OAPAqrB,EAAIljB,EAAEnI,GAAoBiI,GAAhBojB,GAAMA,IAAM,GAAaA,GAAK,GACpBpjB,IAApBojB,EAAIljB,EAAGnI,EAAI,EAAK,IAAcqrB,IAAM,GAChBpjB,IAApBojB,EAAIljB,EAAGnI,EAAI,EAAK,IAAcqrB,IAAM,EAChBpjB,IAApBojB,EAAIljB,EAAGnI,EAAI,EAAK,IAAcqrB,GAAK,EACnCA,EAAIljB,EAAGnI,EAAI,EAAK,GAAuBiI,IAAnBojB,GAASA,GAAK,IAAeA,GAAK,EACtDljB,EAAEnI,GAAKiI,EACPm4I,EAAGpgJ,EAAKA,EAAI,EAAK,EACViI,GAGT,SAAcm4I,EAAIkL,GAChB,IAAIxiJ,EAAMX,EAAI,GAEd,GAAImjJ,KAAiB,EAAPA,GAERnjJ,EAAE,GAAKmjJ,OAIX,IADAA,EAAO,GAAKA,EACPxiJ,EAAI,EAAGA,EAAIwiJ,EAAKvrJ,SAAU+I,EAC7BX,EAAM,EAAJW,GAAUX,EAAM,EAAJW,IAAU,GACnBwiJ,EAAK5mD,WAAW57F,GAAKX,EAAGW,EAAI,EAAK,IAAM,GAIhD,KAAOX,EAAEpI,OAAS,GAAGoI,EAAErF,KAAK,GAC5B,IAAKgG,EAAI,EAAGA,EAAI,GAAc,IAATX,EAAEW,KAAYA,GAOnC,IANS,GAALA,EAAYX,EAAE,IAAM,EAAYA,EAAEW,GAEtCs3I,EAAGt4I,EAAIK,EACPi4I,EAAGpgJ,EAAI,EAGF8I,EAAI,IAAKA,EAAI,IAAKA,EACrBs3I,EAAGr6I,OAIPolC,CAAKi1G,EAAIkL,GAGX,SAASv9H,EAAKlJ,EAAGwG,GAGf,OAFAA,EAAEvjB,EAAI+c,EAAE/c,EAAE1B,QACVilB,EAAErrB,EAAI6kB,EAAE7kB,EACDqrB,EAGT,SAASg7K,EAAK/6C,EAAMzlE,GACN,MAARylE,IAAcA,GAAQ,IAAK51I,MAC/B,IAAI4wL,EAAK,IAAIK,EAAOr7C,GAChB33I,EAAQkyE,GAAQA,EAAKlyE,MACrB4yL,EAAO,WAAa,OAAQD,EAAGvgM,SAAW,GAAK,YAenD,OAdAwgM,EAAKE,OAAS,WACZ,GACE,IAEI35K,IAFMw5K,EAAGvgM,SAAW,KACbugM,EAAGvgM,SAAW,GAAK,aACF,GAAK,UACf,IAAX+mB,GACT,OAAOA,GAETy5K,EAAKC,MAAQF,EAAGvgM,KAChBwgM,EAAKG,MAAQH,EACT5yL,IACEA,EAAM7L,GAAGimB,EAAKpa,EAAO2yL,GACzBC,EAAK5yL,MAAQ,WAAa,OAAOoa,EAAKu4K,EAAI,MAErCC,EAGLr/L,GAAUA,EAAOC,QACnBD,EAAOC,QAAUk/L,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC/kM,KAAKskM,UAAYS,EAnFnB,CAuFE/kM,E,WAEA,S,oBC9FF,OAGA,SAAU0kM,EAAQ9+L,EAAQ65L,GAE1B,SAAS4F,EAAOr7C,GACd,IAAIlL,EAAK9+I,KAAMslM,EAAU,GAGzBxmD,EAAGr6I,KAAO,WACR,IAAIslB,EAAK+0H,EAAGt4I,EAAKs4I,EAAGt4I,IAAM,EAE1B,OADAs4I,EAAGt4I,EAAIs4I,EAAGv3I,EAAGu3I,EAAGv3I,EAAIu3I,EAAG9vH,EAAG8vH,EAAG9vH,EAAI8vH,EAAGpuF,EAAGouF,EAAGpuF,EAAIouF,EAAGn4I,GACzCm4I,EAAGpvI,EAAKovI,EAAGpvI,EAAI,OAAS,IAC5BovI,EAAGn4I,EAAKm4I,EAAGn4I,EAAKm4I,EAAGn4I,GAAK,EAAOojB,EAAKA,GAAK,GAAO,GAGtD+0H,EAAGt4I,EAAI,EACPs4I,EAAGv3I,EAAI,EACPu3I,EAAG9vH,EAAI,EACP8vH,EAAGpuF,EAAI,EACPouF,EAAGn4I,EAAI,EAEHqjJ,KAAiB,EAAPA,GAEZlL,EAAGt4I,EAAIwjJ,EAGPs7C,GAAWt7C,EAIb,IAAK,IAAItjJ,EAAI,EAAGA,EAAI4+L,EAAQ7mM,OAAS,GAAIiI,IACvCo4I,EAAGt4I,GAA6B,EAAxB8+L,EAAQliG,WAAW18F,GACvBA,GAAK4+L,EAAQ7mM,SACfqgJ,EAAGpvI,EAAIovI,EAAGt4I,GAAK,GAAKs4I,EAAGt4I,IAAM,GAE/Bs4I,EAAGr6I,OAIP,SAASgoB,EAAKlJ,EAAGwG,GAOf,OANAA,EAAEvjB,EAAI+c,EAAE/c,EACRujB,EAAExiB,EAAIgc,EAAEhc,EACRwiB,EAAEiF,EAAIzL,EAAEyL,EACRjF,EAAE2mC,EAAIntC,EAAEmtC,EACR3mC,EAAEpjB,EAAI4c,EAAE5c,EACRojB,EAAEra,EAAI6T,EAAE7T,EACDqa,EAGT,SAASg7K,EAAK/6C,EAAMzlE,GAClB,IAAIygH,EAAK,IAAIK,EAAOr7C,GAChB33I,EAAQkyE,GAAQA,EAAKlyE,MACrB4yL,EAAO,WAAa,OAAQD,EAAGvgM,SAAW,GAAK,YAenD,OAdAwgM,EAAKE,OAAS,WACZ,GACE,IAEI35K,IAFMw5K,EAAGvgM,SAAW,KACbugM,EAAGvgM,SAAW,GAAK,aACF,GAAK,UACf,IAAX+mB,GACT,OAAOA,GAETy5K,EAAKC,MAAQF,EAAGvgM,KAChBwgM,EAAKG,MAAQH,EACT5yL,IACmB,iBAAX,GAAqBoa,EAAKpa,EAAO2yL,GAC3CC,EAAK5yL,MAAQ,WAAa,OAAOoa,EAAKu4K,EAAI,MAErCC,EAGLr/L,GAAUA,EAAOC,QACnBD,EAAOC,QAAUk/L,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC/kM,KAAKqkM,OAASU,EAzEhB,CA6EE/kM,E,WAEA,S,qBClFF,OAwBA,SAAW0kM,EAAQa,EAAM59E,GAKzB,IAQI69E,EARAz4L,EAAQ,IAIR04L,EAAa99E,EAAKhgH,IAAIoF,EAHb,GAIT24L,EAAe/9E,EAAKhgH,IAAI,EAHf,IAITg+L,EAA0B,EAAfD,EACXE,EAAO74L,IAOX,SAASg9I,EAAWC,EAAM7uI,EAASkoB,GACjC,IAAI/jC,EAAM,GAINumM,EAAYC,EAAOriH,GAHvBtoE,EAAsB,GAAXA,EAAmB,CAAE4qL,SAAS,GAAU5qL,GAAW,IAIpD4qL,QAAU,CAAC/7C,EAAMg8C,EAAST,IACzB,MAARv7C,EA8IL,WACE,IACE,IAAInnE,EAQJ,OAPI2iH,IAAe3iH,EAAM2iH,EAAW3hG,aAElChhB,EAAMA,EAAI91E,IAEV81E,EAAM,IAAIr+C,WAAWz3B,IACpB23L,EAAOrgK,QAAUqgK,EAAOuB,UAAUriG,gBAAgB/gB,IAE9CmjH,EAASnjH,GAChB,MAAO1hF,GACP,IAAI+kM,EAAUxB,EAAOyB,UACjBC,EAAUF,GAAWA,EAAQE,QACjC,MAAO,EAAE,IAAIhyL,KAAMswL,EAAQ0B,EAAS1B,EAAO2B,OAAQL,EAAST,KA5J3Ce,GAAat8C,EAAM,GAAI1qJ,GAGtCinM,EAAO,IAAIC,EAAKlnM,GAIhB2lM,EAAO,WAIT,IAHA,IAAIz/L,EAAI+gM,EAAKl3I,EA5BJ,GA6BL3/C,EAAI+1L,EACJj/L,EAAI,EACDhB,EAAIkgM,GACTlgM,GAAKA,EAAIgB,GAAKuG,EACd2C,GAAK3C,EACLvG,EAAI+/L,EAAKl3I,EAAE,GAEb,KAAO7pD,GAAKmgM,GACVngM,GAAK,EACLkK,GAAK,EACLlJ,KAAO,EAET,OAAQhB,EAAIgB,GAAKkJ,GAWnB,OARAu1L,EAAKC,MAAQ,WAAa,OAAmB,EAAZqB,EAAKl3I,EAAE,IACxC41I,EAAKG,MAAQ,WAAa,OAAOmB,EAAKl3I,EAAE,GAAK,YAC7C41I,EAAKE,OAASF,EAGda,EAAOE,EAASO,EAAK5hB,GAAI4gB,IAGjBpqL,EAAQsrL,MAAQpjK,GACpB,SAAS4hK,EAAMj7C,EAAM08C,EAAcr0L,GAUjC,OATIA,IAEEA,EAAMsyK,GAAKl4J,EAAKpa,EAAOk0L,GAE3BtB,EAAK5yL,MAAQ,WAAa,OAAOoa,EAAK85K,EAAM,MAK1CG,GAAgB/+E,EAAY,OAAIs9E,EAAaj7C,GAIrCi7C,IAElBA,EACAY,EACA,WAAY1qL,EAAUA,EAAQupL,OAAU1kM,MAAQ2nH,EAChDxsG,EAAQ9I,OAaV,SAASm0L,EAAKlnM,GACZ,IAAIyqB,EAAG48K,EAASrnM,EAAIb,OAChBqgJ,EAAK9+I,KAAMtB,EAAI,EAAG8I,EAAIs3I,EAAGpgJ,EAAIogJ,EAAGt3I,EAAI,EAAGu+B,EAAI+4G,EAAG6lC,EAAI,GAMtD,IAHKgiB,IAAUrnM,EAAM,CAACqnM,MAGfjoM,EAAIqO,GACTg5B,EAAErnC,GAAKA,IAET,IAAKA,EAAI,EAAGA,EAAIqO,EAAOrO,IACrBqnC,EAAErnC,GAAKqnC,EAAEv+B,EAAIo+L,EAAQp+L,EAAIlI,EAAIZ,EAAIioM,IAAW58K,EAAIgc,EAAErnC,KAClDqnC,EAAEv+B,GAAKuiB,GAIR+0H,EAAGzvF,EAAI,SAASuqB,GAIf,IAFA,IAAI7vD,EAAG3F,EAAI,EACP1lB,EAAIogJ,EAAGpgJ,EAAG8I,EAAIs3I,EAAGt3I,EAAGu+B,EAAI+4G,EAAG6lC,EACxB/qG,KACL7vD,EAAIgc,EAAErnC,EAAIknM,EAAQlnM,EAAI,GACtB0lB,EAAIA,EAAIrX,EAAQg5B,EAAE6/J,GAAS7/J,EAAErnC,GAAKqnC,EAAEv+B,EAAIo+L,EAAQp+L,EAAIuiB,KAAQgc,EAAEv+B,GAAKuiB,IAGrE,OADA+0H,EAAGpgJ,EAAIA,EAAGogJ,EAAGt3I,EAAIA,EACV4c,IAINrX,GAOL,SAAS0f,EAAKlJ,EAAGwG,GAIf,OAHAA,EAAErrB,EAAI6kB,EAAE7kB,EACRqrB,EAAEviB,EAAI+b,EAAE/b,EACRuiB,EAAE46J,EAAIphK,EAAEohK,EAAE7/K,QACHilB,EAOT,SAAS05D,EAAQhhF,EAAKsvB,GACpB,IAAqCsnD,EAAjC7tD,EAAS,GAAIo7K,SAAcnkM,EAC/B,GAAIsvB,GAAgB,UAAP60K,EACX,IAAKvtH,KAAQ52E,EACX,IAAM+oB,EAAOhqB,KAAKiiF,EAAQhhF,EAAI42E,GAAOtnD,EAAQ,IAAO,MAAO5wB,IAG/D,OAAQqqB,EAAO/sB,OAAS+sB,EAAgB,UAAPo7K,EAAkBnkM,EAAMA,EAAM,KAQjE,SAASqjM,EAAO97C,EAAM1qJ,GAEpB,IADA,IAA4BunM,EAAxBC,EAAa98C,EAAO,GAAWxiJ,EAAI,EAChCA,EAAIs/L,EAAWroM,QACpBa,EAAIsmM,EAAOp+L,GACTo+L,GAASiB,GAAyB,GAAhBvnM,EAAIsmM,EAAOp+L,IAAWs/L,EAAW1jG,WAAW57F,KAElE,OAAOw+L,EAAS1mM,GA8BlB,SAAS0mM,EAASzkM,GAChB,OAAOiJ,OAAOu8L,aAAa5mM,MAAM,EAAGoB,GAgBtC,GANAukM,EAAOn+E,EAAK5oF,SAAUwmK,GAMa3/L,EAAOC,QAAS,CACjDD,EAAOC,QAAUkkJ,EAEjB,IACEy7C,EAAa,EAAQ,MACrB,MAAOpoI,eAE+B,KAAxC,aAAoB,OAAO2sF,GAAa,8BAtN1C,CAiOmB,oBAATjrJ,KAAwBA,KAAOkB,KACvC,GACAgG,O,gCC3PF,aAYsB,0BAAP,EAUP,WAEN,SAAS+kK,IACP,OAAO,EAGT,SAASi8B,IACP,OAAO,EAGT,SAASprE,KA60CT,OAzyCA,SAASl4H,IAEP,IAAIujM,EAAS,CACX,CAAEvhM,KAAM,SAAaC,KAAM,SAAUa,GAAK,MAAoB,iBAANA,IACxD,CAAEd,KAAM,SAAaC,KAAM,SAAUa,GAAK,MAAoB,iBAANA,IACxD,CAAEd,KAAM,UAAaC,KAAM,SAAUa,GAAK,MAAoB,kBAANA,IACxD,CAAEd,KAAM,WAAaC,KAAM,SAAUa,GAAK,MAAoB,mBAANA,IACxD,CAAEd,KAAM,QAAaC,KAAM/G,MAAMoF,SACjC,CAAE0B,KAAM,OAAaC,KAAM,SAAUa,GAAK,OAAOA,aAAa4N,OAC9D,CAAE1O,KAAM,SAAaC,KAAM,SAAUa,GAAK,OAAOA,aAAa8vE,SAC9D,CAAE5wE,KAAM,SAAaC,KAAM,SAAUa,GACnC,MAAoB,iBAANA,GAAwB,OAANA,GAAcA,EAAE7C,cAAgBxB,SAElE,CAAEuD,KAAM,OAAaC,KAAM,SAAUa,GAAK,OAAa,OAANA,IACjD,CAAEd,KAAM,YAAaC,KAAM,SAAUa,GAAK,YAAanG,IAANmG,KAG/C0gM,EAAU,CACZxhM,KAAM,MACNC,KAAMolK,GAIJo8B,EAAU,GAGVC,EAAe,GAGf3uE,EAAQ,CACV98F,MAAOsrK,EACPxnD,YAAa2nD,EACb5zG,OAAQ2zG,GASV,SAASE,EAAgBC,GACvB,IAAI73H,EAAQ83H,EAAY9uE,EAAM98F,OAAO,SAAU8zC,GAC7C,OAAOA,EAAM/pE,OAAS4hM,KAGxB,GAAI73H,EACF,OAAOA,EAGT,GAAiB,QAAb63H,EACF,OAAOJ,EAGT,IAAIx+K,EAAO6+K,EAAY9uE,EAAM98F,OAAO,SAAU8zC,GAC5C,OAAOA,EAAM/pE,KAAKuyE,gBAAkBqvH,EAASrvH,iBAG/C,MAAM,IAAIx3E,UAAU,iBAAmB6mM,EAAW,KAC7C5+K,EAAQ,mBAAqBA,EAAKhjB,KAAO,KAAQ,KAQxD,SAAS8hM,EAAc1vL,GACrB,OAAIA,IAASovL,EACJ,IAGFzuE,EAAM98F,MAAMrzB,QAAQwP,GAS7B,SAAS2vL,EAAahoM,GACpB,IAAIgwE,EAAQ83H,EAAY9uE,EAAM98F,OAAO,SAAU8zC,GAC7C,OAAOA,EAAM9pE,KAAKlG,MAGpB,GAAIgwE,EACF,OAAOA,EAAM/pE,KAGf,MAAM,IAAIjF,UAAU,kCAAoChB,GA+E1D,SAASioM,EAAiBp6K,GACxB,OAAOA,EACFhmB,KAAI,SAAUqiH,GACb,IAAIg+E,EAAYh+E,EAAMhuF,MAAMr0B,IAAIsgM,GAEhC,OAAQj+E,EAAMk+E,UAAY,MAAQ,IAAMF,EAAUv2K,KAAK,QAExDA,KAAK,KASZ,SAAS02K,EAAYn+E,EAAO81B,GAC1B,IAAIooD,EAAqC,IAAzBl+E,EAAMrhH,QAAQ,OAO1Bq/L,GANUE,EAEPl+E,EAAMlrH,OAAS,EACZkrH,EAAM7kH,MAAM,GACZ,MAHJ6kH,GAKgB78F,MAAM,KAAKxlB,IAAI2lE,GAChC5kE,OAAO0/L,GACP1/L,OAAO2/L,GAERC,EA+cN,SAA2BxoD,EAAakoD,GACtC,IAAIl6D,EAAU,GAUd,OARAgS,EAAY1iI,SAAQ,SAAUmrL,IACgB,IAAxCP,EAAUr/L,QAAQ4/L,EAAW9iM,QACS,IAAtCuiM,EAAUr/L,QAAQ4/L,EAAWr6E,KAC5B4f,EAAQy6D,EAAW9iM,QACtBqoI,EAAQy6D,EAAW9iM,MAAQ8iM,MAIxB/lM,OAAOsE,KAAKgnI,GAASnmI,KAAI,SAAUlC,GACxC,OAAOqoI,EAAQroI,MA3dS+iM,CAAkB1oD,EAAakoD,GAErDS,EAAaT,EAAUrgM,KAAI,SAAUggM,GACvC,IAAIxvL,EAAOuvL,EAAeC,GAE1B,MAAO,CACL5hM,KAAM4hM,EACNe,UAAWb,EAAc1vL,GACzBnS,KAAMmS,EAAKnS,KACXuiM,WAAY,KACZI,iBAAkB,MAIlBC,EAAmBN,EAAoB3gM,KAAI,SAAU4gM,GACvD,IAAIpwL,EAAOuvL,EAAea,EAAW9iM,MAErC,MAAO,CACLM,KAAMwiM,EAAW9iM,KACjBijM,UAAWb,EAAc1vL,GACzBnS,KAAMmS,EAAKnS,KACXuiM,WAAYA,EACZI,gBAAiB7oD,EAAYn3I,QAAQ4/L,OAIzC,MAAO,CACLvsK,MAAOysK,EAAW18L,OAAO68L,GACzBV,UAAWA,GAgDf,SAASW,EAAal7K,GACpB,IAAIq8F,EAAQ7iC,EAAKx5D,GACjB,QAAOq8F,GAAQA,EAAMk+E,UASvB,SAASY,EAAe9+E,GACtB,OAAOA,EAAMhuF,MAAMpf,MAAK,SAAUzE,GAChC,OAA0B,MAAnBA,EAAKowL,cAUhB,SAASQ,EAAY/+E,GACnB,GAAKA,GAAgC,IAAvBA,EAAMhuF,MAAMl9B,OAIrB,IAA2B,IAAvBkrH,EAAMhuF,MAAMl9B,OACnB,OAAO4oM,EAAe19E,EAAMhuF,MAAM,GAAGj2B,MAAMC,KAExC,GAA2B,IAAvBgkH,EAAMhuF,MAAMl9B,OAAc,CACjC,IAAIkqM,EAAQtB,EAAe19E,EAAMhuF,MAAM,GAAGj2B,MAAMC,KAC5CijM,EAAQvB,EAAe19E,EAAMhuF,MAAM,GAAGj2B,MAAMC,KAChD,OAAO,SAAYa,GACjB,OAAOmiM,EAAMniM,IAAMoiM,EAAMpiM,IAI3B,IAAIqiM,EAAQl/E,EAAMhuF,MAAMr0B,KAAI,SAAUwQ,GACpC,OAAOuvL,EAAevvL,EAAKpS,MAAMC,QAEnC,OAAO,SAAYa,GACjB,IAAK,IAAI9H,EAAI,EAAGA,EAAImqM,EAAMpqM,OAAQC,IAChC,GAAImqM,EAAMnqM,GAAG8H,GACX,OAAO,EAGX,OAAO,GAtBT,OAAOukK,EAgCX,SAAS+9B,EAAax7K,GACpB,IAAIu7K,EAAOF,EAAOC,EAwvBHrqM,EAtvBf,GAAIiqM,EAAal7K,GAAS,CAGxB,IAAIy7K,GADJF,GAovBatqM,EApvBG+uB,EAqvBX/uB,EAAIuG,MAAM,EAAGvG,EAAIE,OAAS,IArvBP6I,IAAIohM,IACPjqM,OACjBuqM,EAAWN,EAAY5hH,EAAKx5D,IAUhC,OAAO,SAAkBrtB,GACvB,IAAK,IAAIvB,EAAI,EAAGA,EAAImqM,EAAMpqM,OAAQC,IAChC,IAAKmqM,EAAMnqM,GAAGuB,EAAKvB,IACjB,OAAO,EAGX,OAfkB,SAAUuB,GAC5B,IAAK,IAAIvB,EAAIqqM,EAAUrqM,EAAIuB,EAAKxB,OAAQC,IACtC,IAAKsqM,EAAS/oM,EAAKvB,IACjB,OAAO,EAGX,OAAO,EASAuqM,CAAchpM,IAAUA,EAAKxB,QAAUsqM,EAAW,GAK3D,OAAsB,IAAlBz7K,EAAO7uB,OACF,SAAkBwB,GACvB,OAAuB,IAAhBA,EAAKxB,QAGW,IAAlB6uB,EAAO7uB,QACdkqM,EAAQD,EAAYp7K,EAAO,IACpB,SAAkBrtB,GACvB,OAAO0oM,EAAM1oM,EAAK,KAAuB,IAAhBA,EAAKxB,SAGP,IAAlB6uB,EAAO7uB,QACdkqM,EAAQD,EAAYp7K,EAAO,IAC3Bs7K,EAAQF,EAAYp7K,EAAO,IACpB,SAAkBrtB,GACvB,OAAO0oM,EAAM1oM,EAAK,KAAO2oM,EAAM3oM,EAAK,KAAuB,IAAhBA,EAAKxB,UAIlDoqM,EAAQv7K,EAAOhmB,IAAIohM,GACZ,SAAkBzoM,GACvB,IAAK,IAAIvB,EAAI,EAAGA,EAAImqM,EAAMpqM,OAAQC,IAChC,IAAKmqM,EAAMnqM,GAAGuB,EAAKvB,IACjB,OAAO,EAGX,OAAOuB,EAAKxB,SAAWoqM,EAAMpqM,SAcrC,SAASyqM,EAAgBnwE,EAAWhxH,GAClC,OAAOA,EAAQgxH,EAAUzrG,OAAO7uB,OAC1Bs6H,EAAUzrG,OAAOvlB,GACjBygM,EAAazvE,EAAUzrG,QACnBw5D,EAAKiyC,EAAUzrG,QACf,KAUZ,SAAS67K,EAAsBpwE,EAAWhxH,EAAOqhM,GAC/C,IAAIz/E,EAAQu/E,EAAgBnwE,EAAWhxH,GAOvC,OANY4hH,EACNy/E,EACQz/E,EAAMhuF,MAAMtzB,OAAOghM,GACnB1/E,EAAMhuF,MACd,IAEOr0B,IAAIsgM,GAQnB,SAASA,EAAY9vL,GACnB,OAAOA,EAAKpS,KAQd,SAAS2jM,EAAYvxL,GACnB,OAA2B,OAApBA,EAAKowL,iBAA2C7nM,IAApByX,EAAKowL,WAU1C,SAASoB,EAAoBrwE,EAAYlxH,GACvC,IAAI4/L,EAwsBN,SAAcppM,GAEZ,IADA,IAAIgQ,EAAU,GACL7P,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9B6P,EAAQhQ,EAAIG,KAAM,EAEpB,OAAOyD,OAAOsE,KAAK8H,GA7sBHg7L,CAAKC,EAAQvwE,GAAY,SAAUF,GACjD,OAAOowE,EAAqBpwE,EAAWhxH,GAAO,OAGhD,OAAsC,IAA9B4/L,EAAUr/L,QAAQ,OAAiB,CAAC,OAASq/L,EAWvD,SAASjiG,EAAYhgG,EAAMzF,EAAMg5H,GAC/B,IAAI74H,EAAKo1L,EAKLztL,EAJA2sH,EAAQhvH,GAAQ,UAGhB+jM,EAAqBxwE,EAEzB,IAAKlxH,EAAQ,EAAGA,EAAQ9H,EAAKxB,OAAQsJ,IAAS,CAC5C,IAAI2hM,EAAmBD,EAAmBphM,QAAO,SAAU0wH,GACzD,IAAIpzH,EAAO+iM,EAAYQ,EAAgBnwE,EAAWhxH,IAClD,OAAQA,EAAQgxH,EAAUzrG,OAAO7uB,QAAU+pM,EAAazvE,EAAUzrG,UAC9D3nB,EAAK1F,EAAK8H,OAGhB,GAAgC,IAA5B2hM,EAAiBjrM,QAGnB,IADA+2L,EAAW8T,EAAoBG,EAAoB1hM,IACtCtJ,OAAS,EAAG,CACvB,IAAIkrM,EAAalC,EAAaxnM,EAAK8H,IAYnC,OAVA3H,EAAM,IAAIK,UAAU,2CAA6Ci0H,EAC7D,eAAiB8gE,EAASpkK,KAAK,QAC/B,aAAeu4K,EAAa,YAAc5hM,EAAQ,MAClD8P,KAAO,CACT8V,SAAU,YACV5tB,GAAI20H,EACJ3sH,MAAOA,EACPwtL,OAAQoU,EACRnU,SAAUA,GAELp1L,QAITqpM,EAAqBC,EAKzB,IAAIE,EAAUH,EAAmBniM,KAAI,SAAUyxH,GAC7C,OAAOyvE,EAAazvE,EAAUzrG,QAAU+wD,IAAW06C,EAAUzrG,OAAO7uB,UAEtE,GAAIwB,EAAKxB,OAASuH,KAAKwsB,IAAIryB,MAAM,KAAMypM,GAWrC,OAVApU,EAAW8T,EAAoBG,EAAoB1hM,IACnD3H,EAAM,IAAIK,UAAU,iCAAmCi0H,EACnD,eAAiB8gE,EAASpkK,KAAK,QAC/B,YAAcnxB,EAAKxB,OAAS,MAC5BoZ,KAAO,CACT8V,SAAU,aACV5tB,GAAI20H,EACJ3sH,MAAO9H,EAAKxB,OACZ+2L,SAAUA,GAELp1L,EAIT,IAAIypM,EAAY7jM,KAAKyJ,IAAItP,MAAM,KAAMypM,GACrC,OAAI3pM,EAAKxB,OAASorM,IAChBzpM,EAAM,IAAIK,UAAU,kCAAoCi0H,EACpD,eAAiBm1E,EAAY,aAAe5pM,EAAKxB,OAAS,MAC1DoZ,KAAO,CACT8V,SAAU,cACV5tB,GAAI20H,EACJ3sH,MAAO9H,EAAKxB,OACZqrM,eAAgBD,GAEXzpM,KAGTA,EAAM,IAAIK,UAAU,sBAAwBR,EAAKmxB,KAAK,MAClD,4DAA8DsjG,EAAQ,MACtE78G,KAAO,CACT8V,SAAU,WACV4nK,OAAQt1L,EAAKqH,IAAImgM,IAEZrnM,GAQT,SAAS2pM,EAAoBpgF,GAG3B,IAFA,IAAIn3F,EAAM,IAED9zB,EAAI,EAAGA,EAAIirH,EAAMhuF,MAAMl9B,OAAQC,IAClC2qM,EAAY1/E,EAAMhuF,MAAMj9B,MAC1B8zB,EAAMxsB,KAAKwsB,IAAIA,EAAKm3F,EAAMhuF,MAAMj9B,GAAG2pM,YAIvC,OAAO71K,EAST,SAASw3K,EAA0BrgF,GAGjC,IAFA,IAAIn3F,EAAM,IAED9zB,EAAI,EAAGA,EAAIirH,EAAMhuF,MAAMl9B,OAAQC,IACjC2qM,EAAY1/E,EAAMhuF,MAAMj9B,MAC3B8zB,EAAMxsB,KAAKwsB,IAAIA,EAAKm3F,EAAMhuF,MAAMj9B,GAAG4pM,kBAIvC,OAAO91K,EAWT,SAASy3K,EAAeC,EAAQC,GAC9B,IAAIz9L,EAIJ,OAAU,IADVA,EAAIw9L,EAAOrC,UAAYsC,EAAOtC,YAOpB,IADVn7L,EAAI+7L,EAAeyB,GAAUzB,EAAe0B,KAOlC,IADVz9L,EAAIq9L,EAAmBG,GAAUH,EAAmBI,IAV3Cz9L,EAgBFs9L,EAAyBE,GAAUF,EAAyBG,GAWrE,SAASC,EAAmBC,EAAYC,GACtC,IACI5rM,EACAgO,EAFAlO,EAAMwH,KAAKwsB,IAAI63K,EAAW/8K,OAAO7uB,OAAQ6rM,EAAWh9K,OAAO7uB,QAM/D,GAAU,IADViO,EAAI29L,EAAW/8K,OAAO/Q,KAAKksL,GAAkB6B,EAAWh9K,OAAO/Q,KAAKksL,IAElE,OAAO/7L,EAIT,IAAKhO,EAAI,EAAGA,EAAIF,EAAKE,IAEnB,GAAU,IADVgO,EAAI+7L,EAAe4B,EAAW/8K,OAAO5uB,IAAM+pM,EAAe6B,EAAWh9K,OAAO5uB,KAE1E,OAAOgO,EAKX,IAAKhO,EAAI,EAAGA,EAAIF,EAAKE,IAEnB,GAAU,KADVgO,EAAIu9L,EAAcI,EAAW/8K,OAAO5uB,GAAI4rM,EAAWh9K,OAAO5uB,KAExD,OAAOgO,EAKX,OAAO29L,EAAW/8K,OAAO7uB,OAAS6rM,EAAWh9K,OAAO7uB,OA6EtD,SAAS8rM,EAAqB5gF,GAC5B,IAAIg/E,EAAOC,EAAO4B,EAAaC,EAC3B5B,EAAQ,GACRppD,EAAc,GAUlB,OARA91B,EAAMhuF,MAAM5e,SAAQ,SAAUjF,GACxBA,EAAKowL,aACPW,EAAMrnM,KAAK6lM,EAAevvL,EAAKowL,WAAW9iM,MAAMO,MAChD85I,EAAYj+I,KAAKsW,EAAKowL,WAAW5pF,aAK7BmhC,EAAYhhJ,QAClB,KAAK,EACH,OAAO,SAAoBc,GACzB,OAAOA,GAGX,KAAK,EAGH,OAFAopM,EAAQE,EAAM,GACd2B,EAAc/qD,EAAY,GACnB,SAAoBlgJ,GACzB,OAAIopM,EAAMppM,GACDirM,EAAYjrM,GAEdA,GAGX,KAAK,EAKH,OAJAopM,EAAQE,EAAM,GACdD,EAAQC,EAAM,GACd2B,EAAc/qD,EAAY,GAC1BgrD,EAAchrD,EAAY,GACnB,SAAoBlgJ,GACzB,OAAIopM,EAAMppM,GACDirM,EAAYjrM,GAEjBqpM,EAAMrpM,GACDkrM,EAAYlrM,GAEdA,GAGX,QACE,OAAO,SAAoBA,GACzB,IAAK,IAAIb,EAAI,EAAGA,EAAI+gJ,EAAYhhJ,OAAQC,IACtC,GAAImqM,EAAMnqM,GAAGa,GACX,OAAOkgJ,EAAY/gJ,GAAGa,GAG1B,OAAOA,IA+Cf,SAASmrM,EAAYp9K,EAAQq9K,GA4C3B,OA3CA,SAASC,EAAat9K,EAAQvlB,EAAO4zB,GACnC,GAAI5zB,EAAQulB,EAAO7uB,OAAQ,CACzB,IAIIosM,EAJAlhF,EAAQr8F,EAAOvlB,GACf+iM,EAAgBH,EACdhhF,EAAMhuF,MAAMtzB,OAAOghM,GACnB1/E,EAAMhuF,MAGZ,GAAIguF,EAAMk+E,UAAW,CAGnB,IAAIO,EAAa0C,EAAcziM,OAAOghM,GACtCwB,EAAazC,EAAW3pM,OAASqsM,EAAcrsM,OACzC,CAAC2pM,EAAY0C,GACb,CAACA,QAKPD,EAAaC,EAAcxjM,KAAI,SAAUwQ,GACvC,MAAO,CAACA,MAKZ,OAAO0xL,EAAQqB,GAAY,SAAUE,GACnC,OAAOH,EAAat9K,EAAQvlB,EAAQ,EAAG4zB,EAAMjwB,OAAO,CAACq/L,QAavD,MAAO,CAPcpvK,EAAMr0B,KAAI,SAAUwQ,EAAMuwL,GAC7C,MAAO,CACL1sK,MAAO7jB,EACP+vL,UAAYQ,IAAc/6K,EAAO7uB,OAAS,GAAM+pM,EAAal7K,QAQ9Ds9K,CAAat9K,EAAQ,EAAG,IAyCjC,SAAS09K,EAAoBtlM,EAAMulM,GACjC,GAA0C,IAAtC9oM,OAAOsE,KAAKwkM,GAAexsM,OAC7B,MAAM,IAAI6+E,YAAY,0BAIxB,IAAI4tH,EAAmB,GACvB/oM,OAAOsE,KAAKwkM,GACP3jM,KAAI,SAAUyxH,GACb,OAzqBR,SAAyBA,EAAWh5H,EAAI0/I,GACtC,IAAInyH,EAAS,GAkBb,MAhByB,KAArByrG,EAAU9rD,SACZ3/C,EAASyrG,EACJjsG,MAAM,KACNxlB,IAAI2lE,GACJ3lE,KAAI,SAAUqiH,EAAO5hH,EAAOhC,GAC3B,IAAIolM,EAAcrD,EAAWn+E,EAAO81B,GAEpC,GAAI0rD,EAAYtD,WAAc9/L,IAAUhC,EAAMtH,OAAS,EACrD,MAAM,IAAI6+E,YAAY,8BAAgCqsC,EAAhC,0CAIxB,OAAOwhF,MAIX79K,EAAO/Q,KAAK6uL,GAGP,KAGF,CACL99K,OAAQA,EACRvtB,GAAIA,GA8oBOsrM,CAAetyE,EAAWkyE,EAAclyE,GAAYN,EAAMgnB,gBAElEp3I,OAAOijM,GACPvuL,SAAQ,SAAUwuL,GAEjB,IAAIC,EAAuBjE,EAAY2D,GAAkB,SAAUnlK,GACjE,OA/CV,SAA8BskK,EAAYC,GAGxC,IAFA,IAAI31D,EAAK3uI,KAAKyJ,IAAI46L,EAAW/8K,OAAO7uB,OAAQ6rM,EAAWh9K,OAAO7uB,QAErDC,EAAI,EAAGA,EAAIi2I,EAAIj2I,IAItB,IAAK+sM,EAHatC,EAAqBkB,EAAY3rM,GAAG,GACpCyqM,EAAqBmB,EAAY5rM,GAAG,IAGpD,OAAO,EAIX,IAAIgtM,EAAOrB,EAAW/8K,OAAO7uB,OACzBktM,EAAOrB,EAAWh9K,OAAO7uB,OACzBmtM,EAAapD,EAAa6B,EAAW/8K,QACrCu+K,EAAarD,EAAa8B,EAAWh9K,QAEzC,OAAOs+K,EACDC,EAAcH,IAASC,EAASA,GAAQD,EACxCG,EAAcH,GAAQC,EAAUD,IAASC,EA4BhCG,CAAqB/lK,EAAGwlK,MAEjC,GAAIC,EACF,MAAM,IAAI/qM,UAAU,2BAChBinM,EAAgB8D,EAAqBl+K,QAAU,UAC/Co6K,EAAgB6D,EAAgBj+K,QAAU,MAGhD49K,EAAiB1pM,KAAK+pM,MAI5B,IAAItyE,EAAauwE,EAAQ0B,GAAkB,SAAUK,GAGnD,OAFaA,EAAkBb,EAAYa,EAAgBj+K,QAAQ,GAAS,IAE9DhmB,KAAI,SAAUgmB,GAC1B,MAAO,CACLA,OAAQA,EACRvtB,GAAIwrM,EAAgBxrM,UAGvBsI,OAAOijM,GAEVryE,EAAWnxH,KAAKsiM,GAGhB,IAAI2B,EAAM9yE,EAAW,IAAMA,EAAW,GAAG3rG,OAAO7uB,QAAU,IAAM+pM,EAAavvE,EAAW,GAAG3rG,QACvF0+K,EAAM/yE,EAAW,IAAMA,EAAW,GAAG3rG,OAAO7uB,QAAU,IAAM+pM,EAAavvE,EAAW,GAAG3rG,QACvF2+K,EAAMhzE,EAAW,IAAMA,EAAW,GAAG3rG,OAAO7uB,QAAU,IAAM+pM,EAAavvE,EAAW,GAAG3rG,QACvF4+K,EAAMjzE,EAAW,IAAMA,EAAW,GAAG3rG,OAAO7uB,QAAU,IAAM+pM,EAAavvE,EAAW,GAAG3rG,QACvF6+K,EAAMlzE,EAAW,IAAMA,EAAW,GAAG3rG,OAAO7uB,QAAU,IAAM+pM,EAAavvE,EAAW,GAAG3rG,QACvF8+K,EAAMnzE,EAAW,IAAMA,EAAW,GAAG3rG,OAAO7uB,QAAU,IAAM+pM,EAAavvE,EAAW,GAAG3rG,QACvF++K,EAAQN,GAAOC,GAAOC,GAAOC,GAAOC,GAAOC,EAG3CvD,EAAQ5vE,EAAW3xH,KAAI,SAAUyxH,GACnC,OAAO+vE,EAAa/vE,EAAUzrG,WAG5Bg/K,EAASP,EAAMrD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtDuF,EAASP,EAAMtD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtDwF,EAASP,EAAMvD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtDyF,EAASP,EAAMxD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtD0F,EAASP,EAAMzD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtD2F,EAASP,EAAM1D,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EAEtD4F,EAASb,EAAMrD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtD6F,EAASb,EAAMtD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtD8F,EAASb,EAAMvD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtD+F,EAASb,EAAMxD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtDgG,EAASb,EAAMzD,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EACtDiG,EAASb,EAAM1D,EAAYzvE,EAAW,GAAG3rG,OAAO,IAAM05K,EAGtDkG,EAAMj0E,EAAW3xH,KAAI,SAASyxH,GAChC,OAvSJ,SAAkCzrG,EAAQvtB,GACxC,IAAIotM,EAAYptM,EAIhB,GAAIutB,EAAO/Q,KAAKksL,GAAiB,CAC/B,IAAIZ,EAAYW,EAAal7K,GACzB8/K,EAAsB9/K,EAAOhmB,IAAIijM,GAErC4C,EAAY,WAGV,IAFA,IAAIltM,EAAO,GACP6mF,EAAO+gH,EAAY3nM,UAAUzB,OAAS,EAAIyB,UAAUzB,OAC/CC,EAAI,EAAGA,EAAIooF,EAAMpoF,IACxBuB,EAAKvB,GAAK0uM,EAAoB1uM,GAAGwB,UAAUxB,IAM7C,OAJImpM,IACF5nM,EAAK6mF,GAAQ5mF,UAAU4mF,GAAMx/E,IAAI8lM,EAAoBtmH,KAGhD/mF,EAAGI,MAAMH,KAAMC,IAI1B,IAAIotM,EAAeF,EACnB,GAAI3E,EAAal7K,GAAS,CACxB,IAAIxN,EAASwN,EAAO7uB,OAAS,EAE7B4uM,EAAe,WACb,OAAOF,EAAUhtM,MAAMH,KACnB8E,EAAM5E,UAAW,EAAG4f,GAAQpU,OAAO,CAAC5G,EAAM5E,UAAW4f,OAI7D,OAAOutL,EAsQEC,CAAyBv0E,EAAUzrG,OAAQyrG,EAAUh5H,OAG1DwtM,EAAMxB,EAAMmB,EAAI,GAAKtxE,EACrB4xE,EAAMxB,EAAMkB,EAAI,GAAKtxE,EACrB6xE,EAAMxB,EAAMiB,EAAI,GAAKtxE,EACrB8xE,EAAMxB,EAAMgB,EAAI,GAAKtxE,EACrB+xE,EAAMxB,EAAMe,EAAI,GAAKtxE,EACrBgyE,EAAMxB,EAAMc,EAAI,GAAKtxE,EAErBiyE,EAAO9B,EAAM9yE,EAAW,GAAG3rG,OAAO7uB,QAAU,EAC5CitM,EAAOM,EAAM/yE,EAAW,GAAG3rG,OAAO7uB,QAAU,EAC5CktM,GAAOM,EAAMhzE,EAAW,GAAG3rG,OAAO7uB,QAAU,EAC5CqvM,GAAO5B,EAAMjzE,EAAW,GAAG3rG,OAAO7uB,QAAU,EAC5CsvM,GAAO5B,EAAMlzE,EAAW,GAAG3rG,OAAO7uB,QAAU,EAC5CuvM,GAAO5B,EAAMnzE,EAAW,GAAG3rG,OAAO7uB,QAAU,EAG5CwvM,GAAS5B,EAAQ,EAAI,EACrB6B,GAAOj1E,EAAWx6H,OAClB0vM,GAAU,WAGZ,IAAK,IAAIzvM,EAAIuvM,GAAQvvM,EAAIwvM,GAAMxvM,IAC7B,GAAImqM,EAAMnqM,GAAGwB,WACX,OAAOgtM,EAAIxuM,GAAGyB,MAAMH,KAAME,WAI9B,MAAMwlG,EAAYhgG,EAAMxF,UAAW+4H,IAKjCl5H,GAAK,SAASA,EAAG4sG,EAAM8nB,GAGzB,OAAIv0H,UAAUzB,SAAWovM,GAAQvB,EAAO3/F,IAASigG,EAAOn4E,GAAgB84E,EAAIptM,MAAMJ,EAAIG,WAClFA,UAAUzB,SAAWitM,GAAQa,EAAO5/F,IAASkgG,EAAOp4E,GAAgB+4E,EAAIrtM,MAAMJ,EAAIG,WAClFA,UAAUzB,SAAWktM,IAAQa,EAAO7/F,IAASmgG,EAAOr4E,GAAgBg5E,EAAIttM,MAAMJ,EAAIG,WAClFA,UAAUzB,SAAWqvM,IAAQrB,EAAO9/F,IAASogG,EAAOt4E,GAAgBi5E,EAAIvtM,MAAMJ,EAAIG,WAClFA,UAAUzB,SAAWsvM,IAAQrB,EAAO//F,IAASqgG,EAAOv4E,GAAgBk5E,EAAIxtM,MAAMJ,EAAIG,WAClFA,UAAUzB,SAAWuvM,IAAQrB,EAAOhgG,IAASsgG,EAAOx4E,GAAgBm5E,EAAIztM,MAAMJ,EAAIG,WAE/EiuM,GAAQhuM,MAAMJ,EAAIG,YAI3B,IACEiC,OAAOC,eAAerC,GAAI,OAAQ,CAACN,MAAOiG,IAE5C,MAAOtF,IASP,OAFAL,GAAGk5H,WApPL,SAA6BA,GAC3B,IAAIgyE,EAAgB,GASpB,OARAhyE,EAAWl8G,SAAQ,SAAUg8G,GACtBA,EAAUzrG,OAAO/Q,KAAKksL,IACzBiC,EAAY3xE,EAAUzrG,QAAQ,GAAMvQ,SAAQ,SAAUuQ,GACpD29K,EAAcvD,EAAgBp6K,IAAWyrG,EAAUh5H,SAKlDkrM,EA0OSmD,CAAoBn1E,GAE7Bl5H,GAQT,SAASioM,EAAUV,GACjB,OAA2C,IAApC7uE,EAAMjlC,OAAOlrF,QAAQg/L,GAQ9B,SAASr6H,EAAKrzD,GACZ,OAAOA,EAAIqzD,OAQb,SAAS86H,EAASnuL,GAChB,QAASA,EAQX,SAAS0xL,EAAQ7rM,GACf,OAAiB,OAAVA,EAQT,SAAS2rM,EAAgBzhF,GACvB,OAA8B,IAAvBA,EAAMhuF,MAAMl9B,OAiBrB,SAASqoF,EAAKvoF,GACZ,OAAOA,EAAIA,EAAIE,OAAS,GAU1B,SAASqG,EAAMvG,EAAKqhB,EAAOC,GACzB,OAAOjhB,MAAMoC,UAAU8D,MAAM5D,KAAK3C,EAAKqhB,EAAOC,GAmBhD,SAAS4rL,EAAW4C,EAAQC,GAC1B,IAAK,IAAI5vM,EAAI,EAAGA,EAAI2vM,EAAO5vM,OAAQC,IACjC,GAZcqH,EAYDuoM,EAZQlkJ,EAYAikJ,EAAO3vM,IAXE,IAAzBqH,EAAMuC,QAAQ8hD,GAYjB,OAAO,EAbb,IAAkBrkD,EAAOqkD,EAiBvB,OAAO,EAUT,SAASm9I,EAAYhpM,EAAKoH,GACxB,IAAK,IAAIjH,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9B,GAAIiH,EAAKpH,EAAIG,IACX,OAAOH,EAAIG,GA0BjB,SAAS8qM,EAAQjrM,EAAK8kC,GACpB,OAAOzkC,MAAMoC,UAAU0K,OAAOvL,MAAM,GAAI5B,EAAI+I,IAAI+7B,IAQlD,SAASkrK,EAASrB,GAGhB,IAFA,IAAIxnM,EAAO,GAEFhH,EAAI,EAAGA,EAAIwuM,EAAIzuM,OAAQC,IAAK,CACnC,IAAIqB,EAAKmtM,EAAIxuM,GAGb,IAA8B,iBAAlBqB,EAAGk5H,YAAmD,iBAAjBl5H,EAAGg5H,YAAuC,KAAZh5H,EAAG2F,KAChF,GAAa,KAATA,EACFA,EAAO3F,EAAG2F,UAEP,GAAIA,IAAS3F,EAAG2F,KAAM,CACzB,IAAItF,EAAM,IAAI+L,MAAM,0CAA4CzG,EAAO,aAAe3F,EAAG2F,KAAO,KAKhG,MAJAtF,EAAIyX,KAAO,CACT09K,OAAQx1L,EAAG2F,KACX8vL,SAAU9vL,GAENtF,GAKZ,OAAOsF,EAIT,SAAS8oM,EAAkBtB,GACzB,IAAI9sM,EACA6qM,EAAgB,GAEpB,SAASwD,EAAeC,EAAYC,GAClC,GAAI1D,EAAcjoM,eAAe0rM,IAAeC,IAAQ1D,EAAcyD,GAGpE,MAFAtuM,EAAM,IAAI+L,MAAM,cAAgBuiM,EAAa,uBACzC72L,KAAO,CAACkhH,UAAW21E,GACjBtuM,EAKV,IAAK,IAAI1B,EAAI,EAAGA,EAAIwuM,EAAIzuM,OAAQC,IAAK,CACnC,IAAIqB,EAAKmtM,EAAIxuM,GAGb,GAA6B,iBAAlBqB,EAAGk5H,WAEZ,IAAK,IAAIF,KAAah5H,EAAGk5H,WACnBl5H,EAAGk5H,WAAWj2H,eAAe+1H,KAC/B01E,EAAe11E,EAAWh5H,EAAGk5H,WAAWF,IACxCkyE,EAAclyE,GAAah5H,EAAGk5H,WAAWF,QAI1C,IAA4B,iBAAjBh5H,EAAGg5H,UAOjB,MAFA34H,EAAM,IAAIK,UAAU,yCAA2C/B,EAAI,MAC/DmZ,KAAO,CAAC9P,MAAOrJ,GACb0B,EANNquM,EAAe1uM,EAAGg5H,UAAWh5H,GAC7BkrM,EAAclrM,EAAGg5H,WAAah5H,GASlC,OAAOkrM,EAoET,OAjEAxyE,EAAQuyE,EAAoB,QAAS,CACnC,iBAAkBA,EAClB,OAAU,SAAUC,GAElB,IAAIiC,EAAM,GACV,IAAK,IAAIn0E,KAAakyE,EAChBA,EAAcjoM,eAAe+1H,IAC/Bm0E,EAAI1rM,KAAKypM,EAAclyE,IAI3B,OAAOiyE,EADIuD,EAAQrB,GACcjC,IAEnC,cAAe,SAAUiC,GACvB,OAAOlC,EAAoBuD,EAAQrB,GAAMsB,EAAkBtB,KAE7D,sBAAuB,SAAUxnM,EAAMwnM,GACrC,OAAOlC,EAAoBtlM,EAAM8oM,EAAkBtB,QAIjDxpM,OAASA,EACf+0H,EAAM98F,MAAQsrK,EACdxuE,EAAMgnB,YAAc2nD,EACpB3uE,EAAMjlC,OAAS2zG,EACf1uE,EAAMna,QA5mCN,SAAkB7+G,EAAOqY,GACvB,IAAI1S,EAAOqiM,EAAahoM,GAGxB,GAAIqY,IAAS1S,EACX,OAAO3F,EAGT,IAAK,IAAIf,EAAI,EAAGA,EAAI+5H,EAAMgnB,YAAYhhJ,OAAQC,IAAK,CACjD,IAAIwpM,EAAazvE,EAAMgnB,YAAY/gJ,GACnC,GAAIwpM,EAAW9iM,OAASA,GAAQ8iM,EAAWr6E,KAAO/1G,EAChD,OAAOowL,EAAW5pF,QAAQ7+G,GAI9B,MAAM,IAAI0M,MAAM,uBAAyB/G,EAAO,OAAS0S,IA8lC3D2gH,EAAM72E,KAnpCN,SAAe7hD,EAAIg5H,GACjB,IAAKh5H,EAAGk5H,WACN,MAAM,IAAIx4H,UAAU,iCAItB,IAAIlC,EACJ,GAAyB,iBAAdw6H,EAAwB,CACjCx6H,EAAMw6H,EAAUjsG,MAAM,KACtB,IAAK,IAAIpuB,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9BH,EAAIG,GAAKH,EAAIG,GAAGuuE,WAGf,KAAIruE,MAAMoF,QAAQ+0H,GAIrB,MAAM,IAAIt4H,UAAU,qDAHpBlC,EAAMw6H,EAMR,IAAIn/G,EAAMrb,EAAI6yB,KAAK,KAGfwsD,EAAQ79E,EAAGk5H,WAAWr/G,GAC1B,GAAIgkE,EACF,OAAOA,EAKT,MAAM,IAAIn9E,UAAU,oCAAsCV,EAAG2F,MAAQ,WAAa,IAAMnH,EAAI6yB,KAAK,MAAQ,OA+nC3GqnG,EAAMm2E,QAAU,SAAU92L,EAAM+2L,GAC9B,IAAK/2L,GAA6B,iBAAdA,EAAKpS,MAA0C,mBAAdoS,EAAKnS,KACxD,MAAM,IAAIlF,UAAU,kEAGtB,IAAyB,IAArBouM,EACF,IAAK,IAAInwM,EAAI,EAAGA,EAAI+5H,EAAM98F,MAAMl9B,OAAQC,IACtC,GAA4B,WAAxB+5H,EAAM98F,MAAMj9B,GAAGgH,KAEjB,YADA+yH,EAAM98F,MAAM2lF,OAAO5iH,EAAG,EAAGoZ,GAM/B2gH,EAAM98F,MAAMn6B,KAAKsW,IAInB2gH,EAAMq2E,cAAgB,SAAU5G,GAC9B,IAAKA,GAC6B,iBAApBA,EAAW9iM,MACO,iBAAlB8iM,EAAWr6E,IACY,mBAAvBq6E,EAAW5pF,QACvB,MAAM,IAAI79G,UAAU,iFAGtBg4H,EAAMgnB,YAAYj+I,KAAK0mM,IAGlBzvE,EAGF/0H,KAj2Ca,UAAX,IAAW,mB,aCXlBqrM,yBAA2B,GCD3BC,WACAC,kBDGJ,SAASC,oBAAoBC,GAE5B,IAAIC,EAAeL,yBAAyBI,GAC5C,QAAqB9uM,IAAjB+uM,EACH,OAAOA,EAAavpM,QAGrB,IAAID,EAASmpM,yBAAyBI,GAAY,CACjDn0K,GAAIm0K,EACJE,QAAQ,EACRxpM,QAAS,IAUV,OANAypM,oBAAoBH,GAAUjuM,KAAK0E,EAAOC,QAASD,EAAQA,EAAOC,QAASqpM,qBAG3EtpM,EAAOypM,QAAS,EAGTzpM,EAAOC,QAIfqpM,oBAAoB9+L,EAAIk/L,oBE5BxBJ,oBAAoBK,KAAO,WAC1B,MAAM,IAAIpjM,MAAM,mCCDjB+iM,oBAAoBM,KAAO,GCC3BN,oBAAoB1pM,EAAKI,IACxB,IAAI6pM,EAAS7pM,GAAUA,EAAO8pM,WAC7B,IAAO9pM,EAAiB,QACxB,IAAM,EAEP,OADAspM,oBAAoBx/L,EAAE+/L,EAAQ,CAAEluM,EAAGkuM,IAC5BA,GCLRP,oBAAoBx/L,EAAI,CAAC7J,EAAS8zD,KACjC,IAAI,IAAIr6D,KAAOq6D,EACXu1I,oBAAoB7rM,EAAEs2D,EAAYr6D,KAAS4vM,oBAAoB7rM,EAAEwC,EAASvG,IAC5E6C,OAAOC,eAAeyD,EAASvG,EAAK,CAAE0C,YAAY,EAAMa,IAAK82D,EAAWr6D,MCJ3E4vM,oBAAoB3rL,EAAI,GAGxB2rL,oBAAoB/tM,EAAKwuM,GACjB/vM,QAAQ2wJ,IAAIpuJ,OAAOsE,KAAKyoM,oBAAoB3rL,GAAG9b,QAAO,CAACmoM,EAAUtwM,KACvE4vM,oBAAoB3rL,EAAEjkB,GAAKqwM,EAASC,GAC7BA,IACL,KCNJV,oBAAoBxmI,EAAKinI,GAEZA,EAAU,MCHvBT,oBAAoB7/I,EAAI,WACvB,GAA0B,iBAAfxoC,WAAyB,OAAOA,WAC3C,IACC,OAAO7mB,MAAQ,IAAIyB,SAAS,cAAb,GACd,MAAON,GACR,GAAsB,iBAAX8K,OAAqB,OAAOA,QALjB,GCAxBijM,oBAAoB7rM,EAAI,CAACZ,EAAK42E,IAAUl3E,OAAOnB,UAAUgC,eAAe9B,KAAKuB,EAAK42E,GRA9E21H,WAAa,GACbC,kBAAoB,cAExBC,oBAAoBpkK,EAAI,CAACnlB,EAAKhmB,EAAML,EAAKqwM,KACxC,GAAGX,WAAWrpL,GAAQqpL,WAAWrpL,GAAKnkB,KAAK7B,OAA3C,CACA,IAAIkwM,EAAQC,EACZ,QAAWzvM,IAARf,EAEF,IADA,IAAIywM,EAAUpjM,SAASqjM,qBAAqB,UACpCtxM,EAAI,EAAGA,EAAIqxM,EAAQtxM,OAAQC,IAAK,CACvC,IAAIqnC,EAAIgqK,EAAQrxM,GAChB,GAAGqnC,EAAEzb,aAAa,QAAU3E,GAAOogB,EAAEzb,aAAa,iBAAmB2kL,kBAAoB3vM,EAAK,CAAEuwM,EAAS9pK,EAAG,OAG1G8pK,IACHC,GAAa,GACbD,EAASljM,SAASC,cAAc,WAEzBqjM,QAAU,QACjBJ,EAAO7hL,QAAU,IACbkhL,oBAAoBgB,IACvBL,EAAOlgM,aAAa,QAASu/L,oBAAoBgB,IAElDL,EAAOlgM,aAAa,eAAgBs/L,kBAAoB3vM,GACxDuwM,EAAO57L,IAAM0R,GAEdqpL,WAAWrpL,GAAO,CAAChmB,GACnB,IAAIwwM,EAAmB,CAAC1vH,EAAM3kE,KAE7B+zL,EAAOlnJ,QAAUknJ,EAAO37L,OAAS,KACjC2E,aAAamV,GACb,IAAIoiL,EAAUpB,WAAWrpL,GAIzB,UAHOqpL,WAAWrpL,GAClBkqL,EAAOr1K,YAAcq1K,EAAOr1K,WAAWvqB,YAAY4/L,GACnDO,GAAWA,EAAQrzL,SAAShd,GAAQA,EAAG+b,KACpC2kE,EAAM,OAAOA,EAAK3kE,IAGlBkS,EAAUlV,WAAWq3L,EAAiBzuM,KAAK,UAAMrB,EAAW,CAAEyX,KAAM,UAAWjW,OAAQguM,IAAW,MACtGA,EAAOlnJ,QAAUwnJ,EAAiBzuM,KAAK,KAAMmuM,EAAOlnJ,SACpDknJ,EAAO37L,OAASi8L,EAAiBzuM,KAAK,KAAMmuM,EAAO37L,QACnD47L,GAAcnjM,SAAS64B,KAAKz1B,YAAY8/L,KSvCzCX,oBAAoB9qL,EAAKve,IACH,oBAAX5B,QAA0BA,OAAO6wG,aAC1C3yG,OAAOC,eAAeyD,EAAS5B,OAAO6wG,YAAa,CAAEr1G,MAAO,WAE7D0C,OAAOC,eAAeyD,EAAS,aAAc,CAAEpG,OAAO,KCLvDyvM,oBAAoBmB,IAAOzqM,IAC1BA,EAAO4zG,MAAQ,GACV5zG,EAAOkL,WAAUlL,EAAOkL,SAAW,IACjClL,G,MCHR,IAAI0qM,EACApB,oBAAoB7/I,EAAEkhJ,gBAAeD,EAAYpB,oBAAoB7/I,EAAEtmB,SAAW,IACtF,IAAIp8B,EAAWuiM,oBAAoB7/I,EAAE1iD,SACrC,IAAK2jM,GAAa3jM,IACbA,EAASwpE,gBACZm6H,EAAY3jM,EAASwpE,cAAcliE,MAC/Bq8L,GAAW,CACf,IAAIP,EAAUpjM,EAASqjM,qBAAqB,UACzCD,EAAQtxM,SAAQ6xM,EAAYP,EAAQA,EAAQtxM,OAAS,GAAGwV,KAK7D,IAAKq8L,EAAW,MAAM,IAAInkM,MAAM,yDAChCmkM,EAAYA,EAAUzqL,QAAQ,OAAQ,IAAIA,QAAQ,QAAS,IAAIA,QAAQ,YAAa,KACpFqpL,oBAAoBprM,EAAIwsM,G,SCVxB,IAAIE,EAAkB,CACrBC,IAAK,EACLC,IAAK,GAGNxB,oBAAoB3rL,EAAE/b,EAAI,CAACmoM,EAASC,KAElC,IAAIe,EAAqBzB,oBAAoB7rM,EAAEmtM,EAAiBb,GAAWa,EAAgBb,QAAWtvM,EACtG,GAA0B,IAAvBswM,EAGF,GAAGA,EACFf,EAASpuM,KAAKmvM,EAAmB,QAC3B,CAGL,IAAIC,EAAU,IAAIhxM,SAAQ,CAACV,EAASC,IAAYwxM,EAAqBH,EAAgBb,GAAW,CAACzwM,EAASC,KAC1GywM,EAASpuM,KAAKmvM,EAAmB,GAAKC,GAGtC,IAAIjrL,EAAMupL,oBAAoBprM,EAAIorM,oBAAoBxmI,EAAEinI,GAEpDjwM,EAAQ,IAAIyM,MAgBhB+iM,oBAAoBpkK,EAAEnlB,GAfF7J,IACnB,GAAGozL,oBAAoB7rM,EAAEmtM,EAAiBb,KAEf,KAD1BgB,EAAqBH,EAAgBb,MACRa,EAAgBb,QAAWtvM,GACrDswM,GAAoB,CACtB,IAAIE,EAAY/0L,IAAyB,SAAfA,EAAMhE,KAAkB,UAAYgE,EAAMhE,MAChEg5L,EAAUh1L,GAASA,EAAMja,QAAUia,EAAMja,OAAOoS,IACpDvU,EAAMgmB,QAAU,iBAAmBiqL,EAAU,cAAgBkB,EAAY,KAAOC,EAAU,IAC1FpxM,EAAMgG,KAAO,iBACbhG,EAAMoY,KAAO+4L,EACbnxM,EAAMquB,QAAU+iL,EAChBH,EAAmB,GAAGjxM,MAIgB,SAAWiwM,EAASA,KAiBlE,IAAIoB,EAAuB,CAACC,EAA4Bn5L,KACvD,IAGIs3L,EAAUQ,GAHTsB,EAAUC,EAAatuJ,GAAW/qC,EAGhBnZ,EAAI,EAC3B,IAAIywM,KAAY+B,EACZhC,oBAAoB7rM,EAAE6tM,EAAa/B,KACrCD,oBAAoB9+L,EAAE++L,GAAY+B,EAAY/B,IAKhD,IAFGvsJ,GAASA,EAAQssJ,qBACjB8B,GAA4BA,EAA2Bn5L,GACrDnZ,EAAIuyM,EAASxyM,OAAQC,IACzBixM,EAAUsB,EAASvyM,GAChBwwM,oBAAoB7rM,EAAEmtM,EAAiBb,IAAYa,EAAgBb,IACrEa,EAAgBb,GAAS,KAE1Ba,EAAgBS,EAASvyM,IAAM,GAK7ByyM,EAAqBryM,KAA6B,uBAAIA,KAA6B,wBAAK,GAC5FqyM,EAAmBp0L,QAAQg0L,EAAqBrvM,KAAK,KAAM,IAC3DyvM,EAAmB3vM,KAAOuvM,EAAqBrvM,KAAK,KAAMyvM,EAAmB3vM,KAAKE,KAAKyvM,K,GCjFvF,IAAIC,oBAAsBlC,oBAAoB,O","file":"main.js","sourcesContent":["export default 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}","export default function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return self;\n}","function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n  try {\n    var info = gen[key](arg);\n    var value = info.value;\n  } catch (error) {\n    reject(error);\n    return;\n  }\n\n  if (info.done) {\n    resolve(value);\n  } else {\n    Promise.resolve(value).then(_next, _throw);\n  }\n}\n\nexport default function _asyncToGenerator(fn) {\n  return function () {\n    var self = this,\n        args = arguments;\n    return new Promise(function (resolve, reject) {\n      var gen = fn.apply(self, args);\n\n      function _next(value) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n      }\n\n      function _throw(err) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n      }\n\n      _next(undefined);\n    });\n  };\n}","export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}","export default function _isNativeReflectConstruct() {\n  if (typeof Reflect === \"undefined\" || !Reflect.construct) return false;\n  if (Reflect.construct.sham) return false;\n  if (typeof Proxy === \"function\") return true;\n\n  try {\n    Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));\n    return true;\n  } catch (e) {\n    return false;\n  }\n}","import setPrototypeOf from \"./setPrototypeOf.js\";\nimport isNativeReflectConstruct from \"./isNativeReflectConstruct.js\";\nexport default function _construct(Parent, args, Class) {\n  if (isNativeReflectConstruct()) {\n    _construct = Reflect.construct;\n  } else {\n    _construct = function _construct(Parent, args, Class) {\n      var a = [null];\n      a.push.apply(a, args);\n      var Constructor = Function.bind.apply(Parent, a);\n      var instance = new Constructor();\n      if (Class) setPrototypeOf(instance, Class.prototype);\n      return instance;\n    };\n  }\n\n  return _construct.apply(null, arguments);\n}","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\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}","export default 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}","import superPropBase from \"./superPropBase.js\";\nexport default function _get(target, property, receiver) {\n  if (typeof Reflect !== \"undefined\" && Reflect.get) {\n    _get = Reflect.get;\n  } else {\n    _get = function _get(target, property, receiver) {\n      var base = superPropBase(target, property);\n      if (!base) return;\n      var desc = Object.getOwnPropertyDescriptor(base, property);\n\n      if (desc.get) {\n        return desc.get.call(receiver);\n      }\n\n      return desc.value;\n    };\n  }\n\n  return _get(target, property, receiver || target);\n}","import getPrototypeOf from \"./getPrototypeOf.js\";\nexport default function _superPropBase(object, property) {\n  while (!Object.prototype.hasOwnProperty.call(object, property)) {\n    object = getPrototypeOf(object);\n    if (object === null) break;\n  }\n\n  return object;\n}","export default function _getPrototypeOf(o) {\n  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}","import setPrototypeOf from \"./setPrototypeOf.js\";\nexport default function _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}","import _typeof from \"@babel/runtime/helpers/typeof\";\nimport assertThisInitialized from \"./assertThisInitialized.js\";\nexport default function _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  }\n\n  return assertThisInitialized(self);\n}","export default function _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}","import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArrayLimit from \"./iterableToArrayLimit.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nexport default function _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}","export default function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}","export default function _iterableToArrayLimit(arr, i) {\n  if (typeof Symbol === \"undefined\" || !(Symbol.iterator in Object(arr))) return;\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n  var _e = undefined;\n\n  try {\n    for (var _i = arr[Symbol.iterator](), _s; !(_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}","export default 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}","export default function _taggedTemplateLiteral(strings, raw) {\n  if (!raw) {\n    raw = strings.slice(0);\n  }\n\n  return Object.freeze(Object.defineProperties(strings, {\n    raw: {\n      value: Object.freeze(raw)\n    }\n  }));\n}","import arrayWithoutHoles from \"./arrayWithoutHoles.js\";\nimport iterableToArray from \"./iterableToArray.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableSpread from \"./nonIterableSpread.js\";\nexport default function _toConsumableArray(arr) {\n  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return arrayLikeToArray(arr);\n}","export default function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && Symbol.iterator in Object(iter)) return Array.from(iter);\n}","export default 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}","export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _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}","module.exports = require(\"regenerator-runtime\");\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport { max_func, min_func, max_func_obj } from \"./renderer_util.js\";\n\n// Similar to the same class in python\nclass Entry {\n    constructor(entryobj) {\n        this.data = entryobj;\n    }\n\n    nodeid() {\n        return new Number(this.data.node) & 0xFFFF;\n        return this.data.node;\n    }\n\n    stateid() {\n        return (new Number(this.data.node) >> 16) & 0xFFFF;\n        return this.data.node;\n    }\n\n    thread() {\n        return this.data.thread;\n    }\n    iteration() {\n        return this.data.iteration;\n    }\n    values() {\n        return this.data.values;\n    }\n\n    getKeys() {\n        return this.data.values.map(x => ObjectHelper.listKeys(x)[0]);\n    }\n    getValue(papi_code, nofail = undefined) {\n        let vals = this.data.values;\n        for (let it of vals) {\n            let keys = Object.keys(it);\n            if (keys.some(x => x == papi_code)) {\n                return it[papi_code];\n            }\n        }\n        if(papi_code == \"-2147483589\") {\n            // Instead of TOT_CYC, we allow REF_CYC with a warning\n            console.warn(\"Fallback used (TOT_CYC => REF_CYC)\");\n            return this.getValue(\"-2147483541\");\n        }\n        if(nofail == undefined) {\n            ObjectHelper.logObject(\"this\", this);\n            ObjectHelper.logObject(\"keys\", this.getKeys());\n            ObjectHelper.assert(\"got value from key \" + papi_code, false);\n        }\n        return \"N/A\";\n    }\n}\n// Similar to the same class in Python\nclass Section {\n    constructor(sectionobj = null, flags = undefined) {\n        if (sectionobj == null) {\n            return;\n        }\n        if(sectionobj instanceof Section) {\n            \n            Object.assign(this, sectionobj);\n            this.private_fix_entries();\n            return;\n        }\n        if(flags == \"from_raw\") {\n            Object.assign(this, sectionobj);\n            this.private_fix_entries();\n            return;\n        }\n        this.node = sectionobj['entry_node'];\n        this.datasize = sectionobj['static_movement'];\n\n        ObjectHelper.assert(\"this is valid\", this != undefined);\n        let entries = sectionobj['entries']; // this is an array\n        if(entries == undefined) {\n            entries = sectionobj['_entries']; // Try with the other format\n            if(entries != undefined) {\n                ObjectHelper.logObject(\"sectionobj\", sectionobj);\n                console.trace(\"Dangerous assignment\");\n                Object.assign(this, sectionobj);\n                this.private_fix_entries();\n                ObjectHelper.assert(\"Correct subelements\", this._entries.every(x => x instanceof Entry));\n                return;\n            }\n            else {\n                // Throw exception.\n            }\n\n        }\n        ObjectHelper.assert(\"entries is valid\", entries != undefined && entries != \"undefined\" && typeof entries != \"function\");\n        this._entries = [];\n\n        for (let e of entries) {\n            // Construct and push\n            this._entries.push(new Entry(e));\n        }\n    }\n\n    private_fix_entries() {\n        if(this._entries == undefined) {\n            return;\n        }\n        if(!this._entries.every(x => x instanceof Entry)) {\n            // Fix the entries\n            this._entries = this._entries.map(x => new Entry(x.data));\n        }\n    }\n\n    nodeid() {\n        return new Number(this.node) & 0xFFFF;\n        return this.node;\n    }\n\n    stateid() {\n        return (new Number(this.node) >> 16) & 0xFFFF;\n        return this.node;\n    }\n\n    entries() {\n        return this._entries.map(x => x.data);\n    }\n\n    /* Returns true if this section is a serial section, i.e. only one thread \n       number occurs in all entries.\n       This does not mean that the section iself was not inside a parallel \n       block, but that the section itself was not parallelized.\n    */\n    isSerial() {\n        return this.threadid() != null;\n    }\n\n    threadid() {\n        if(this._entries.length == 0) {\n            return null;\n        }\n        let tid = this._entries[0].thread();\n        if(this._entries.every(x => x.thread() == tid)) {\n            return tid;\n        }\n        \n        return null; // Not everyone had the same thread\n    }\n\n    // Returns the full cost of this section on one particular CPU, grouped \n    // by nodeid.\n    sumIteration() {\n        ObjectHelper.assert(\"object is serial\", this.isSerial());\n\n        let ret = {\n            \"entry_node\": this.nodeid().toString(),\n            \"thread\": this.threadid(),\n            \"iteration\": \"mixed\",\n            \"flags\": \"mixed\",\n            \"values\": []\n        };\n\n        let keys = this.list_events();\n\n        let vals = keys.map(x => { \n            let ret = {}; \n            ret[x] = MathHelper.sum(this.select_event(x));\n            return ret;\n        });\n\n        ret['values'] = vals;\n\n        let e = new Entry(ret);\n\n        let retobj = new Section();\n        Object.assign(retobj, this);\n        retobj._entries = [e];\n\n        return retobj;\n    }\n\n    numIterations() {\n        let keys = this.list_events();\n\n        let entry_count = 0;\n        keys.forEach(x => { \n            entry_count = Math.max(entry_count, this.select_event(x).length);\n        });\n        return entry_count;\n    }\n\n    select_event(event, nofail = undefined) {\n\n        return this._entries.filter(x => x.getValue(event, nofail) != \"N/A\").map(x => x.getValue(event, nofail));\n    }\n\n    list_events() {\n        let keys = this._entries.map(x => x.getKeys());\n        if(keys.length == 0) {\n            return [];\n        }\n        let first = keys[0];\n        let all_equal = keys.every(x => ObjectHelper.arraysEqual(x, first));\n        if(!all_equal)\n        {\n            ObjectHelper.logObject(\"first\", first);\n            let first_different = keys.find(x => !ObjectHelper.arraysEqual(x, first));\n            ObjectHelper.logObject(\"first different\", first_different);\n        }\n        ObjectHelper.assert(\"same keys\", all_equal);\n\n        return first;\n    }\n\n    select_thread(threadnum) {\n        return this.filter(x => x.thread() == threadnum);\n    }\n    select_node(nodeid) {\n        return this.filter(x => x.nodeid() == nodeid);\n    }\n\n    get_max_thread_num() {\n        ObjectHelper.assert(\"entries are defined\", this._entries != undefined);\n        for(let x of this._entries)\n            ObjectHelper.assert(\"Must be correct object\", x.thread != undefined);\n        if(this._entries.length === 0)\n            return undefined;\n        return max_func(this._entries, x => x.thread());\n    }\n\n    get_min_thread_num() {\n        ObjectHelper.assert(\"entries are defined\", this._entries != undefined);\n        if(this._entries.length === 0)\n            return undefined;\n        return min_func(this._entries, x => x.thread());\n    }\n\n    filter(predicate) {\n        let ret = new Section();\n        ret.node = this.nodeid();\n        ObjectHelper.assert(\"entries valid\", this._entries.every(x => x instanceof Entry));\n        ret._entries = this._entries.filter(predicate);\n\n        return ret;\n    }\n}\n\nclass SuperSection {\n\n    constructor(supersection_obj = null) {\n        let s = supersection_obj;\n        if(s == null) {\n            return;\n        }\n\n        this._sections = supersection_obj.sections.map(x => new Section(x));\n        this._nodeid = supersection_obj.supernode;\n    }\n\n    // Downgrade to a section by flattening \n    toSection(nodeid = undefined, stateid = undefined) {\n        let input = this.sections().filter(x => (nodeid == undefined || x.nodeid() == nodeid) && (stateid == undefined || x.stateid() == stateid));\n        let rawobj = ObjectHelper.merge(input, {\"datasize\": (x, y) => x + y});\n        let ret =  new Section(rawobj, \"from_raw\");\n\n        let max_thread_num = 0;\n        if(ret._entries != undefined) {\n\n            max_thread_num = ret.get_max_thread_num();\n\n            if(max_thread_num === undefined) {\n                return undefined;\n            }\n        }\n\n        for(let t = 0; t < max_thread_num; ++t) {\n            let pre = input.map(x => x.select_thread(t).select_event('-2147483589'));\n            if(pre.length == 0) {\n                // We don't like it...\n                continue;\n            }\n            else {\n                let unwrapped = ObjectHelper.flatten(pre);\n                let oldsum = MathHelper.sum(unwrapped);\n                let newsum = MathHelper.sum(ret.select_thread(t).select_event('-2147483589'));\n                ObjectHelper.assert(\"sum cyc equal\", newsum == oldsum);\n            }\n        }\n\n        return ret;\n    }\n\n    getSections(nodeid, stateid = undefined) {\n        ObjectHelper.assert(\"nodeid provided\", nodeid != undefined);\n\n        let ret = this.sections();\n\n        return ret.filter(x => x.nodeid() == nodeid && (stateid == undefined || x.stateid() == stateid));\n    }\n\n    // Get mean of threads\n    toThreadMean(nodeid) {\n        ObjectHelper.assert(\"nodeid defined\", nodeid != undefined);\n\n        // If we have a supersection of many sections and each of the \n        // sections contains only one thread, we are inside a parallel section.\n        // Otherwise, if a supersection contains sections with mixed threads, \n        // we are outside.\n\n        let all_serial = this.sections().every(x => x.isSerial());\n        if(all_serial) {\n            console.log(\"all sections are serial\");\n        }\n        else {\n            console.log(\"not all subsections are serial.\");\n            // This operation does not make any sense then.\n            return null;\n        }\n\n        let means = this.sections().map(x => x.sumIteration());\n        // means now has the means of all super-iterations \n\n        return means;\n    }\n\n    get_max_thread_num() {\n        // Returns the maximum thread number of all sections\n        ObjectHelper.assert(\"sections are defined\", this.sections() != undefined);\n        return max_func(this.sections(), x => x.get_max_thread_num());\n    }\n\n    filter(predicate) {\n        let ret = new SuperSection();\n        ret._nodeid = this.nodeid();\n        \n        ret._sections = this.sections().filter(predicate);\n\n        return ret;\n    }\n\n    nodeid() {\n        return this._nodeid & 0xFFFF;\n    }\n\n    stateid() {\n        return new Number(this._nodeid) >> 16;\n    }\n\n    containsSection(nodeid, stateid = undefined) {\n        return this.sections().filter(x => x.nodeid() == nodeid && (stateid == undefined || x.stateid() == stateid)).length > 0;\n    }\n\n    sections() {\n        return this._sections;\n    }\n\n    allSectionNodeIds(for_state = undefined) {\n        if(for_state == undefined) {\n            return this.sections().map(x => x.nodeid());\n        }\n        else {\n            // Only return the nodes of a given state\n            return this.sections().filter(x => x.stateid() == for_state).map(x => x.nodeid());\n        }\n    }\n    allSectionStateIds() {\n        return this.sections().map(x => x.stateid());\n    }\n\n}\nclass MathHelper {\n    static stdev(array) {\n        return Math.sqrt(this.var(array));\n    }\n\n    static normalizedToHexByte(input) {\n        ObjectHelper.assert(\"Input is normalized\", input >= 0.0 && input <= 255.0);\n\n        let denorm = input * 255;\n\n        let tmp = denorm.toString(16).toUpperCase();\n        ObjectHelper.assert(\"Correct Length\", tmp.length == 1 || tmp.length == 2);\n        return tmp.length == 2 ? tmp : \"0\" + tmp;\n    }\n\n    static majority(array) {\n\n        ObjectHelper.assert(\"array valid\", array != undefined && array.length != undefined);\n        let i = 0;\n        let dict = {};\n        for (let x of array) {\n            if (dict[x] == undefined) {\n                dict[x] = 0;\n            }\n            dict[x]++;\n            i++;\n        }\n        let a = [];\n        for (let k of Object.keys(dict)) {\n            let v = dict[k];\n\n            a.push([k, v]);\n        }\n        ObjectHelper.assert(\"a sensible\", a.length > 0);\n        return max_func_obj(a, x => x[1], x => x[0]);\n    }\n\n    // Pearson's correlation coefficient\n    static corr(X, Y) {\n        return this.cov(X, Y) / (this.stdev(X) * this.stdev(Y));\n    }\n\n    // sample correlation\n    static sample_corr(X, Y) {\n        let xmean = this.mean(X);\n        let ymean = this.mean(Y);\n\n        let num = this.sum(this.zip(X, Y).map(x => (x[0] - xmean) * (x[1] - ymean)));\n        let denom = Math.sqrt(this.sum(X.map(x => (x - xmean) * (x - xmean))) * this.sum(Y.map(y => (y - ymean) * (y - ymean))));\n        return num / denom;\n    }\n\n    static cov(X, Y) {\n        let n = X.length;\n\n        let acc = 0;\n        for (let i = 0; i < n; ++i) {\n            for (let j = i + 1; j < n; ++j) {\n                let tmp = (X[i] - X[j]) * (Y[i] - Y[j]);\n                acc += tmp;\n            }\n        }\n        return tmp / (n * n);\n    }\n\n    static var(array) {\n        let mean = this.mean(array);\n        let sum = array.reduce((a, b) => a + Math.pow(b - mean, 2.0), 0);\n        return sum / array.length;\n    }\n\n    static mean(array) {\n        if (array.length != 0) {\n            return this.sum(array) / (array.length);\n        }\n        else {\n            return 0;\n        }\n    }\n\n    // This is the upper median\n    static median(array) {\n        if (array.length != 0) {\n            let sorted = array.map(x => new Number(x));\n            sorted.sort((a, b) => a - b);\n            let index = sorted.length / 2;\n            index = Math.floor(index);\n            let ret = sorted[index];\n\n            ret = new Number(ret);\n            \n            ObjectHelper.assert(\"is_number\", ret instanceof Number);\n            return ret;\n        }\n        else {\n            return 0;\n        }\n    }\n\n    static sum(array) {\n        ObjectHelper.assert(\"Input valid\", array != undefined && array != null);\n        return array.reduce((a, b) => Number(a) + Number(b), 0);\n    }\n    static sumArray(array_of_arrays) {\n        let base = null;\n        for(let x of array_of_arrays) {\n            if (base == null) {\n                base = x;\n            }\n            else {\n                for(let i = 0; i < base.length; ++i) {\n                    base[i] = base[i] + x[i];\n                }\n            }\n        }\n        return base;\n    }\n\n    // Zips all elements of a 2d array \n    // (example: zip2d([[a, b, c], [1,2,3]]) -> [[a, 1], [b, 2], [c, 3]]). \n    // Restrictions: All sumelements must be of the same size!\n    static zip2d(array) {\n        if (array == []) return [];\n\n        let ret = [];\n        let outersize = array.length;\n        let innersize = array[0].length;\n\n        for (let i = 0; i < innersize; ++i) {\n            let tmp = [];\n            for (let j = 0; j < outersize; ++j) {\n                tmp.push(array[j][i]);\n            }\n            ret.push(tmp);\n        }\n        return ret;\n    }\n\n    static zip(X, Y) {\n        let ret = [];\n        for (let i = 0; i < X.length; ++i) {\n            ret.push([X[i], Y[i]]);\n        }\n        return ret;\n    }\n\n    static unique(array) {\n        return array.filter((x, index, a) => a.indexOf(x) == index);\n    }\n}\n\nclass ObjectHelper {\n\n    static createChunks(in_array, chunksize, aggregate=undefined) {\n        ObjectHelper.assert(\"chunksize valid\", !isNaN(chunksize) && chunksize != 0.0 && chunksize != undefined);\n        let ret = []\n        if(aggregate === undefined) aggregate = x => x;\n        for(let i = 0; i < in_array.length; i += chunksize) {\n            let tmp = in_array.slice(i, i + chunksize);\n            ret.push(aggregate(tmp));\n        }\n        return ret;\n    }\n\n    static toUnicodeSuperscript(number) {\n        number = new Number(number);\n        const valarr = [\"\\u2070\",\"\\u00B9\", \"\\u00B2\", \"\\u00B3\", \"\\u2074\", \"\\u2075\", \"\\u2076\", \"\\u2077\", \"\\u2078\", \"\\u2079\"];\n        let valstr = \"\";\n\n        if(number == 0) {\n            valstr = valarr[0];\n        }\n        // Note: ~~(i / 10) is an integer division in JS\n        // (bitwise operators make sense only on ints, so JS casts the float to \n        // an int, and then negates twice, which gives the int again)\n        for(let i = parseInt(number.toFixed(0)); i > 0; i = ~~(i / 10)) {\n            let index = Math.round(i) % 10;\n            let c = valarr[index];\n            \n            valstr = c + valstr;\n        }\n        return valstr;\n    }\n\n    static toUnicodeSubscript(number) {\n        number = new Number(number);\n        const valarr = [\"\\u2080\",\"\\u2081\", \"\\u2082\", \"\\u2083\", \"\\u2084\", \"\\u2085\", \"\\u2086\", \"\\u2087\", \"\\u2088\", \"\\u2089\"];\n        let valstr = \"\";\n\n        if(number == 0) {\n            valstr = valarr[0];\n        }\n        \n        for(let i = parseInt(number.toFixed(0)); i > 0; i = ~~(i / 10)) {\n            let index = Math.round(i) % 10;\n            let c = valarr[index];\n            \n            valstr = c + valstr;\n        }\n        return valstr;\n    }\n\n    // Number to sensible String\n    static valueToSensibleString(value, mode=\"scientific\", unit=\"\", digits=4) {\n        // valid modes:\n        // scientific: x*10^(exp)\n        // programmer: Ki/Mi/Gi/...\n        value = new Number(value);\n        let exp = 0;\n        let base1024table = {\n            0: \"\",\n            1: \"Ki\",\n            2: \"Mi\",\n            3: \"Gi\",\n            4: \"Ti\",\n            5: \"Pi\"\n        };\n        let base1000table = {\n            0: \"\",\n            1: \"K\",\n            2: \"M\",\n            3: \"G\",\n            4: \"T\",\n            5: \"P\"\n        };\n        let ret = \"\";\n        if(mode == \"programmer\") {\n            // Go in 1024-Chunks\n            while(value >= 1024.) {\n                value = value / 1024.;\n                ++exp;\n            }\n            ret = value.toFixed(digits - 1);\n\n            ret += \" \" + base1024table[exp] + unit;\n        }\n        else if(mode == \"scientific\") {\n            // Normal Scientific notation\n            while(value >= 10.) {\n                value /= 10;\n                ++exp;\n            }\n            ret = value.toFixed(digits - 1);\n            let valstr = exp.toString();\n            // We need to replace numbers by their unicode equivalent for superscript\n            valstr = ObjectHelper.toUnicodeSuperscript(exp);\n            \n\n            ret += \" \\u22C5 10\" + valstr;\n        }\n        else if(mode == \"fraction\") {\n            // Transform value into fraction (makes sense mostly for values \\in [0, 1])\n\n            // Simple (and slow) algorithm: Just multiply by 10 until the numerator is (about) integer\n            const thresh = 0.00001;\n\n            let numerator = new Number(value);\n            let denominator = 1;\n            while(Math.abs(Math.round(numerator) - numerator) > thresh)\n            {\n                numerator *= 10;\n                denominator *= 10;\n            }\n            // Now it's really likely that the result is not rational (just a fraction, not normalized)\n            let gcd = (a, b) => { \n                a = Math.abs(Math.round(a));\n                b = Math.abs(Math.round(b));\n                if (b > a) {let temp = a; a = b; b = temp;}\n                while (a >= 0 && b >= 0) {\n                    if (b == 0) return a;\n                    a %= b;\n                    if (a == 0) return b;\n                    b %= a;\n                }\n                return 1;\n            };\n\n            let gcd_val = gcd(numerator, denominator);\n            numerator /= gcd_val;\n            denominator /= gcd_val;\n\n            // We have the values - now translate them to the unicode equivalents\n            let super_n = ObjectHelper.toUnicodeSuperscript(numerator.toString());\n            let sub_d = ObjectHelper.toUnicodeSubscript(denominator.toString());\n\n            ret = super_n + \"/\" + sub_d;\n\n        }\n        else {\n            ObjectHelper.assert(\"unknown mode\", false);\n        }\n\n        \n        return ret;\n    }\n\n    // Applies operations to a key recursively (i.e. find a key and apply a function to the corresponding value). This function is in-place\n    static modifyingMapRecursive(obj, key, func) {\n        if(obj == undefined || obj == null || obj instanceof String || typeof obj == \"string\") {\n            return;\n        }\n        if(obj instanceof Array) {\n            for(let x of obj) {\n                ObjectHelper.modifyingMapRecursive(x, key, func);\n            }\n            return;\n        }\n        let keys = ObjectHelper.listKeys(obj);\n        if(keys == undefined) {\n            return;\n        }\n        for(let k of keys) {\n            if(k == key) {\n                obj[k] = func(obj[k]);\n            }\n            else {\n                ObjectHelper.modifyingMapRecursive(obj[k], key, func);\n            }\n        }\n    }\n\n    static async valueFromPromise(obj) {\n        if (obj.then != undefined) {\n            let x = await obj;\n            return x;\n        }\n        else {\n            return obj;\n        }\n\n    }\n\n    // Same as valueFromPromise, but fully recursive (this will never return a promise)\n    static async valueFromPromiseFull(obj) {\n        if (obj.then != undefined) {\n            let x = await obj;\n            return await ObjectHelper.valueFromPromiseFull(x);\n        }\n        else {\n            return obj;\n        }\n\n    }\n\n    static async waitArray(obj_array) {\n        for(let i = 0; i < obj_array.length; ++i) {\n            obj_array[i] = await ObjectHelper.valueFromPromise(obj_array[i]);\n        }\n        return obj_array;\n    }\n\n    static arraysEqual(arr1, arr2) {\n        this.assert(\"1 is array\", arr1 instanceof Array);\n        this.assert(\"2 is array\", arr2 instanceof Array);\n        if(arr1.length != arr2.length) {\n            return false;\n        }\n\n        for(let i = 0; i < arr1.length; ++i) {\n            if(arr1[i] != arr2[i]) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    static listKeys(obj) {\n        let ret = [];\n        for (let k of Object.keys(obj)) {\n            ret.push(k);\n        }\n\n        return ret;\n    }\n\n    // Merges all objects together. Primitive values must be the same, and \n    // list elements will be appended. All prepended underscores of keys are\n    // removed.\n    static merge(in_array, onconflicts = {}) {\n        // onconflicts: dict of key -> function(x, y), where the function \n        // resolves conflicts if the values are not identical.\n        if(in_array.length == 0) return [];\n\n        let keys = this.listKeys(in_array[0]);\n\n        let ret = {};\n        // Prime by adding keys\n        for(let k of keys) {\n            ret[k] = undefined;\n        }\n        for(let x of in_array) {\n            for(let k of keys) {\n                let v = x[k];\n                if(v instanceof Array) {\n                    if(ret[k] == undefined) {\n                        ret[k] = [];\n                    }\n                    ret[k].push(...v);\n                }\n                else {\n                    if(ret[k] == undefined) {\n                        ret[k] = v;\n                    }\n                    if(ret[k] != v) {\n                        console.log(\"Different elements for key \" + k + \": \" + ret[k] + \" vs \" + v);\n                        if(onconflicts[k] != undefined) {\n                            ret[k] = onconflicts[k](ret[k], v);\n                            continue;\n                        }\n                    }\n                    this.assert(\"Same primitive values\", ret[k] == v);\n                }\n            }\n        }\n        return ret;\n    }\n\n    // Merges two objects into the return value. 'specials' applies the function in the value to the matching key.\n    static mergeRecursive(o1, o2, specials = {}) {\n        if(o1 == null || o1 == undefined) return o2;\n        if(o2 == null || o2 == undefined) return o1;\n        if(typeof o1 == \"string\") return o1;\n        if(((typeof o1 == \"array\") || (o1 instanceof Array)) && ((typeof o2 == \"array\") || (o2 instanceof Array))) {\n            if(o2.every(x => o1.includes(x))) {\n                // If every element of o2 is already in o1, why bother?\n                return o1;\n            }\n            return [...o1, ...o2];\n        }\n\n        let ret = o1;\n        let keys = ObjectHelper.listKeys(o2);\n\n        for(let k of keys) {\n            let v = o2[k];\n\n            if(specials[k] != undefined) {\n                let specfunc = specials[k];\n                ret[k] = specfunc(ret[k], v, specials);\n                continue;\n            }\n\n            let o1ref = ret[k];\n            if(o1ref == undefined) {\n                // If the key is not present in o1, just add key + value\n                ret[k] = v;\n            }\n            else {\n                ret[k] = ObjectHelper.mergeRecursive(ret[k], v);\n            }\n        }\n        return ret;\n    }\n\n    // Flattens an array of arrays to a single array\n    static flatten(in_array) {\n        return [].concat.apply([], in_array);\n    }\n\n    static logObject(title, obj) {\n        if(obj == undefined) {\n            obj = title;\n            title = \"(anon)\";\n        }\n        return console.log(title + \": \" + JSON.stringify(obj));\n    }\n\n    /* Groups elements by selecting a key using func(x) for every element x \n       in in_array. Returns a dict of key => [objects] */\n    static groupBy(in_array, func) {\n\n        let ret = {};\n\n        for(let x of in_array) {\n            ObjectHelper.assert(\"key not undefined\", func(x) !== undefined);\n            if(ObjectHelper.listKeys(ret).includes(func(x))) {\n                ret[func(x)].push(x);\n            }\n            else {\n                ret[func(x)] = [x];\n            }\n        }\n\n        return Object.values(ret);\n    }\n\n    static assert(name, expr) {\n        if(!expr) {\n            console.log(\"Assertion \\\"\" + name + \"\\\" failed\");\n            console.trace();\n            window.alert(\"Assertion failed. Check console\");\n            throw new Error();\n        }\n    }\n\n    static stringify_circular(obj) {\n        const getCircularReplacer = () => {\n            const seen = new WeakSet;\n            return (key, value) => {\n                if (typeof value === \"object\" && value !== null) {\n                    if (seen.has(value)) {\n                        return;\n                    }\n                    seen.add(value);\n                }\n                return value;\n            };\n        };\n\n        return JSON.stringify(obj, getCircularReplacer());\n    }\n}\n\n// Class providing analysis of threads (mainly used in balance)\nclass ThreadAnalysis {\n    constructor(section) {\n        if(section instanceof Section) {\n            this.section = section;\n        }\n        else if(section instanceof SuperSection) {\n            ObjectHelper.assert(\"this is undesired.\", false);\n            // A supersection has many subsections. For now, let's try if \n            // merging works for this.\n            this.section = section.toSection();\n        }\n        else if(section instanceof LazySuperSection) {\n            this.section = section;\n        }\n        else if(section instanceof LazySection) {\n            this.section = section;\n        }\n    }\n\n    judgement(analysis=null) {\n        return undefined;\n    }\n\n    analyze() {\n        let section = this.section;\n\n        let b_print_analysis = false;   // Set to true to debug.\n\n        let data = {};\n\n        let max_thread_num = Number(section.get_max_thread_num());\n        if (b_print_analysis)\n            console.log(\"max_thread_num: \" + max_thread_num);\n        let tot_cyc = [];\n        let tot_l3_miss = [];\n        let tot_l2_miss = [];\n        let t = 0;\n        for (t = 0; t < max_thread_num + 1; t++) {\n            let ts = section.select_thread(t);\n            let tc = ts.select_event('-2147483589'); // PAPI_TOT_CYC\n            tot_cyc.push(MathHelper.sum(tc));\n\n            let tl3 = ts.select_event('-2147483640'); // PAPI_L3_TCM\n            tot_l3_miss.push(MathHelper.sum(tl3));\n\n            let tl2 = ts.select_event('-2147483641');   //PAPI_L2_TCM\n            tot_l2_miss.push(MathHelper.sum(tl2));\n        }\n\n        //Now we can get the balance\n        let i = 0;\n        if (b_print_analysis)\n            for (let t of tot_cyc) {\n                console.log(\"Thread \" + i + \" took \" + t + \" cycles\");\n                i++;\n            }\n\n        data.cycles_per_thread = tot_cyc;\n\n        if(toplevel_use_mean)\n            data.balance_stdev = (MathHelper.stdev(tot_cyc) / MathHelper.mean(tot_cyc));\n        else if(toplevel_use_median) {\n            data.balance_stdev = (MathHelper.stdev(tot_cyc) / MathHelper.median(tot_cyc));\n        }\n        else ObjectHelper.assert(\"Undefined mode\", false);\n        if (b_print_analysis)\n            if (tot_cyc.length > 1 && MathHelper.mean(tot_cyc) != 0) {\n\n                console.log(\"stdev: \" + MathHelper.stdev(tot_cyc));\n                console.log(\"Balance (stdev): \" + data.balance_stdev);\n            }\n\n\n        // We need different means of balance calculations.\n        let max_elem = Math.max(...tot_cyc);\n        let min_elem = Math.min(...tot_cyc);\n        let max_diff = max_func(tot_cyc, x => Math.max(Math.abs(max_elem - x), Math.abs(min_elem - x)));\n        \n        let biggest_unbalance = 0;\n        if(toplevel_use_mean)\n            biggest_unbalance = max_diff / MathHelper.mean(tot_cyc);\n        else if(toplevel_use_median)\n            biggest_unbalance = max_diff / MathHelper.median(tot_cyc);\n        else ObjectHelper.assert(\"Undefined mode\", false);\n\n        if (b_print_analysis)\n            console.log(\"max_diff: \" + max_diff);\n        if (b_print_analysis)\n            console.log(\"Balance (max): \" + biggest_unbalance);\n\n        data.balance_max = biggest_unbalance;\n\n        i = 0;\n        if (b_print_analysis)\n            for (let t of tot_l3_miss) {\n                console.log(\"Thread \" + i + \" had \" + t + \" L3 misses\");\n                i++;\n            }\n        let sum_l3 = MathHelper.sum(tot_l3_miss);\n        if (b_print_analysis)\n            console.log(\"\\n\" + section.datasize + \" bytes (presumably) accessed\\n\" + sum_l3 + \" L3 misses over all threads\\n\" + (sum_l3 * 64) + \" bytes loaded from memory\");\n\n        i = 0;\n        if (b_print_analysis)\n            for (let t of tot_l2_miss) {\n                console.log(\"Thread \" + i + \" had \" + t + \" L2 misses\");\n                i++;\n            }\n\n        let sum_l2 = MathHelper.sum(tot_l2_miss);\n        if (b_print_analysis)\n            console.log(\"\\n\" + section.datasize + \" bytes (presumably) accessed\\n\" + sum_l2 + \" L3 misses over all threads\\n\" + (sum_l2 * 64) + \" bytes loaded from memory\");\n\n\n        return new DataBlock(data, \"thread\");\n    }\n\n\n}\n\nclass LazyThreadAnalysis extends ThreadAnalysis {\n\n    constructor(communicator, section) {\n        super(section);\n        this.section = section;\n        this.communicator = communicator;\n        ObjectHelper.assert(\"Parameter valid\", this.communicator != undefined);\n        ObjectHelper.assert(\"Parameter valid\", this.section != undefined);\n    }\n\n    async analyze() {\n        \n        let tmp = await this.communicator.runAnalysis(\"ThreadAnalysis\", [new Number(this.section.unified_id), new Number(this.section.supersection_id)]).get();\n\n        let data = tmp;\n\n        let ret = new DataBlock(data, \"thread\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nfunction AutoThreadAnalysis(communicator, section) {\n    if(section instanceof Section) {\n        return new ThreadAnalysis(section);\n    }\n    else {\n        return new LazyThreadAnalysis(communicator, section);\n    }\n}\n\nclass MemoryAnalysis {\n    constructor(section, target_bw) {\n        this.section = section;\n        this.analysis_result = null;\n        this.Memory_Target_Bandwidth = target_bw;\n        if(this.Memory_Target_Bandwidth == undefined) {\n            this.Memory_Target_Bandwidth = 20;\n        }\n    }\n\n    judgement(analysis = null) {\n        if (analysis == null) analysis = this.analysis_result;\n\n        return MemoryAnalysis.sjudgement(analysis);\n    }\n    static sjudgement(analysis) {\n        // We say memory was slow if the achieved bandwidth is below 50% of the target bandwidth\n        let bandwidth = analysis.data.expected_bandwidth;\n        let m = bandwidth / analysis.data.Memory_Target_Bandwidth;\n        if (m < 0.5) {\n            return -1;\n        }\n        // Otherwise, everything is fine\n        return 1;\n    }\n\n    analyze() {\n        let section = this.section;\n\n        ObjectHelper.assert(\"section is Section\", section instanceof Section);\n\n        let b_print_analysis = false;   // Set to true to debug.\n\n        let data = {};\n\n        data.expected_memory_movement = section.datasize;\n\n        if(b_print_analysis)\n            console.log(\"Expected data movement: \" + data.expected_memory_movement);\n\n        let max_thread_num = Number(section.get_max_thread_num());\n        let min_thread_num = Number(section.get_min_thread_num());\n\n        if(max_thread_num == undefined || min_thread_num == undefined) {\n            return undefined;\n        }\n        if (b_print_analysis)\n            console.log(\"max_thread_num: \" + max_thread_num);\n        let tot_cyc = [];\n        let tot_l3_miss = [];\n        let tot_l2_miss = [];\n\n        let mem_bw = []; // Bandwidth from mem to L3\n        let l3_bw = [];  // Bandwidth from L3 to L2\n\n        let critical_path_cyc = 0; // Critical path cycles\n\n        let t = 0;\n        for (t = min_thread_num; t < max_thread_num + 1; t++) {\n            let ts = section.select_thread(t);\n            let tc = ts.select_event('-2147483589'); // PAPI_TOT_CYC\n            let tc_sum = MathHelper.sum(tc);\n            tot_cyc.push(tc_sum);\n\n            let tl3 = ts.select_event('-2147483640'); // PAPI_L3_TCM\n            let tl3_sum = MathHelper.sum(tl3);\n            tot_l3_miss.push(tl3_sum);\n\n            let tl2 = ts.select_event('-2147483641');   //PAPI_L2_TCM\n            let tl2_sum = MathHelper.sum(tl2);\n            tot_l2_miss.push(tl2_sum);\n\n            // Add the bandwidths for this element\n            mem_bw.push(tl3_sum / tc_sum);\n            l3_bw.push(tl2_sum / tc_sum);\n        }\n\n        if(tot_cyc.length == 0) {\n            return undefined;\n        }\n        critical_path_cyc = max_func(tot_cyc, x => x);\n\n        data.critical_path_cyc = critical_path_cyc;\n\n        data.mem_bandwidth = mem_bw;\n        data.l3_bandwidth = l3_bw;\n\n        // Now we can get the balance\n        let i = 0;\n        if (b_print_analysis)\n            for (let t of tot_cyc) {\n                console.log(\"Thread \" + i + \" took \" + t + \" cycles\");\n                i++;\n            }\n\n        data.TOT_CYC = tot_cyc;\n        data.L3_TCM = tot_l3_miss;\n        data.L2_TCM = tot_l2_miss;\n\n\n        i = 0;\n        if (b_print_analysis)\n            for (let t of tot_l3_miss) {\n                console.log(\"Thread \" + i + \" had \" + t + \" L3 misses\");\n                i++;\n            }\n        let sum_l3 = MathHelper.sum(tot_l3_miss);\n        if (b_print_analysis)\n            console.log(\"\\n\" + section.datasize + \" bytes accessed\\n\" + sum_l3 + \" L3 misses over all threads\\n\" + (sum_l3 * 64) + \" bytes loaded from memory\");\n\n        i = 0;\n        if (b_print_analysis)\n            for (let t of tot_l2_miss) {\n                console.log(\"Thread \" + i + \" had \" + t + \" L2 misses\");\n                i++;\n            }\n\n        let sum_l2 = MathHelper.sum(tot_l2_miss);\n        if (b_print_analysis)\n            console.log(\"\\n\" + section.datasize + \" bytes accessed\\n\" + sum_l2 + \" L3 misses over all threads\\n\" + (sum_l2 * 64) + \" bytes loaded from memory\");\n\n        {\n            let datasize = data.expected_memory_movement;\n            let crit_cyc = data.critical_path_cyc;\n\n            let expected_bandwidth = datasize / crit_cyc;\n\n            data.expected_bandwidth = expected_bandwidth;\n        }\n        data.Memory_Target_Bandwidth = this.Memory_Target_Bandwidth;\n        let ret = new DataBlock(data, \"memory\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nclass SuperSectionMemoryAnalysis {\n    constructor(section, nodeid, stateid, target_bw) {\n        this.section = section;\n        this.for_node = nodeid;\n        this.for_state = stateid;\n        this.analysis_result = null;\n\n        this.Memory_Target_Bandwidth = target_bw;\n        if(this.Memory_Target_Bandwidth == undefined) {\n            this.Memory_Target_Bandwidth = 20;\n        }\n\n        if(!(stateid == 0xFFFF || stateid == 65535))\n            ObjectHelper.assert(\"for_node defined\", this.for_node != undefined && new Number(this.for_node) != NaN);\n    }\n\n    judgement(analysis = null) {\n        if (analysis == null) analysis = this.analysis_result;\n\n        // We say memory was slow if the achieved bandwidth is below 50% of \n        // the target bandwidth\n        let bandwidth = analysis.data.expected_bandwidth;\n\n        let m = bandwidth / analysis.data.Memory_Target_Bandwidth;\n        if (m < 0.5) {\n            return -1;\n        }\n        // Otherwise, everything is fine\n        return 1;\n    }\n\n    analyze() {\n        let section = this.section;\n\n        ObjectHelper.assert(\"section is SuperSection\", section instanceof SuperSection);\n\n        // We have a supersection, so we should try to get individual \n        // sections out.\n        section = section.toSection(this.for_node, this.for_state);\n        if(section == undefined) {\n            return null;\n        }\n        if(section['_entries'] == undefined) {\n            return null;\n        }\n\n        let b_print_analysis = false;   // Set to true to debug.\n\n        let data = {};\n\n        data.expected_memory_movement = section.datasize;\n\n        if(b_print_analysis)\n            console.log(\"Expected data movement: \" + data.expected_memory_movement);\n\n        \n\n        let max_thread_num = Number(section.get_max_thread_num());\n        let min_thread_num = Number(section.get_min_thread_num());\n        if (b_print_analysis)\n            console.log(\"max_thread_num: \" + max_thread_num);\n        let tot_cyc = [];\n        let tot_l3_miss = [];\n        let tot_l2_miss = [];\n\n        let mem_bw = []; // Bandwidth from mem to L3\n        let l3_bw = [];  // Bandwidth from L3 to L2\n\n        let critical_path_cyc = 0; // Critical path cycles\n\n        let t = 0;\n        for (t = min_thread_num; t < max_thread_num + 1; t++) {\n            //console.log(\"iteration \" + t);\n            let ts = section.select_thread(t);\n            let tc = ts.select_event('-2147483589'); // PAPI_TOT_CYC\n            //console.log(tc);\n            let tc_sum = MathHelper.sum(tc);\n            tot_cyc.push(tc_sum);\n\n            let tl3 = ts.select_event('-2147483640'); // PAPI_L3_TCM\n            let tl3_sum = MathHelper.sum(tl3);\n            tot_l3_miss.push(tl3_sum);\n\n            let tl2 = ts.select_event('-2147483641');   //PAPI_L2_TCM\n            let tl2_sum = MathHelper.sum(tl2);\n            tot_l2_miss.push(tl2_sum);\n\n            // Add the bandwidths for this element\n            mem_bw.push(tl3_sum / tc_sum);\n            l3_bw.push(tl2_sum / tc_sum);\n        }\n\n        critical_path_cyc = max_func(tot_cyc, x => x);\n\n        data.critical_path_cyc = critical_path_cyc;\n\n        data.mem_bandwidth = mem_bw;\n        data.l3_bandwidth = l3_bw;\n\n        let i = 0;\n        if (b_print_analysis)\n            for (let t of tot_cyc) {\n                console.log(\"Thread \" + i + \" took \" + t + \" cycles\");\n                i++;\n            }\n\n        data.TOT_CYC = tot_cyc;\n        data.L3_TCM = tot_l3_miss;\n        data.L2_TCM = tot_l2_miss;\n\n\n        i = 0;\n        if (b_print_analysis)\n            for (let t of tot_l3_miss) {\n                console.log(\"Thread \" + i + \" had \" + t + \" L3 misses\");\n                i++;\n            }\n        let sum_l3 = MathHelper.sum(tot_l3_miss);\n        if (b_print_analysis)\n            console.log(\"\\n\" + section.datasize + \" bytes accessed\\n\" + sum_l3 + \" L3 misses over all threads\\n\" + (sum_l3 * 64) + \" bytes loaded from memory\");\n\n        i = 0;\n        if (b_print_analysis)\n            for (let t of tot_l2_miss) {\n                console.log(\"Thread \" + i + \" had \" + t + \" L2 misses\");\n                i++;\n            }\n\n        let sum_l2 = MathHelper.sum(tot_l2_miss);\n        if (b_print_analysis)\n            console.log(\"\\n\" + section.datasize + \" bytes accessed\\n\" + sum_l2 + \" L3 misses over all threads\\n\" + (sum_l2 * 64) + \" bytes loaded from memory\");\n\n        {\n            let datasize = data.expected_memory_movement;\n            let crit_cyc = data.critical_path_cyc;\n\n            let expected_bandwidth = datasize / crit_cyc;\n\n            data.expected_bandwidth = expected_bandwidth;\n        }\n\n        data.Memory_Target_Bandwidth = this.Memory_Target_Bandwidth;\n        let ret = new DataBlock(data, \"memory\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nclass LazySuperSectionMemoryAnalysis extends SuperSectionMemoryAnalysis {\n    constructor(communicator, section, nodeid, stateid, target_bw) {\n        super(section, nodeid, stateid, target_bw);\n        this.communicator = communicator;\n    }\n\n    async analyze() {\n\n        // We differ from the eager analysis here: We let the python/sql-side do the hard work\n        let n = undefined;\n        let s = new Number(this.for_state);\n        if(this.for_node !== undefined)\n            n = new Number(this.for_node);\n        else\n        {\n            // Global\n            s = 0;\n            n = 0x0FFFFFFFF;\n        }\n        let tmp = await this.communicator.runAnalysis(\"MemoryAnalysis\", [(s << 16) | n, this.section.index]).get();\n\n        let data = tmp;\n\n        if(data == null) {\n            return null;\n        }\n\n        data.Memory_Target_Bandwidth = this.Memory_Target_Bandwidth;\n        let ret = new DataBlock(data, \"memory\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n}\n\nfunction AutoSuperSectionMemoryAnalysis(communicator, section, nodeid, stateid, target_bw) {\n\n    if(section instanceof LazySuperSection) {\n        return new LazySuperSectionMemoryAnalysis(communicator, section, nodeid, stateid, target_bw);\n    }\n    else {\n        return new SuperSectionMemoryAnalysis(section, nodeid, stateid, target_bw);\n    }\n}\n\nclass CriticalPathAnalysis {\n\n    constructor(rundata, entry_node, stateid) {\n        this.rundata = rundata;\n        this.analysis_result = null;\n        this.section_entry_node = entry_node;\n        this.for_state = stateid;\n    }\n\n    judgement(analysis = null) {\n        if (analysis == null) analysis = this.analysis_result;\n        \n        return CriticalPathAnalysis.sjudgement(analysis);\n    }\n\n    static sjudgement(analysis) {\n\n        let e = analysis.data.efficiency;\n        let max_thread_num = max_func(e, x => x.thread_num);\n\n        let eff = 0;\n\n        if(toplevel_use_mean) {\n            eff = MathHelper.mean(e.find(x => x.thread_num == max_thread_num).value);\n        }\n        else if(toplevel_use_median) {\n            eff = MathHelper.median(e.find(x => x.thread_num == max_thread_num).value);\n        }\n        else {\n            ObjectHelper.assert(\"Undefined mode\", false);\n        }\n        if (eff < 0.5) {\n            return -1;\n        }\n\n        return 1;\n    }\n\n    analyze() {\n        let data = {};\n\n        // We want to compare different runs.\n        let runs = this.rundata.map(x => x.data);\n\n        \n        if(this.section_entry_node !== undefined) {\n            let single_threaded = new SuperSection(runs[0][0]).toThreadMean(this.section_entry_node, this.for_state);\n        }\n\n        let filtered_to_section = runs.map(x => x.map(y => new SuperSection(y).toSection(this.section_entry_node, this.for_state)).filter(x => x != undefined && x._entries != undefined));\n        \n\n       let thread_analyzed = filtered_to_section.map(x => x.map(y => { \n           return new ThreadAnalysis(y).analyze(); \n        }));\n\n        // Now map to cycles_per_thread\n        let cycles_per_thread = thread_analyzed.map(x => x.map(y => y.data.cycles_per_thread));\n\n        // From here, we have all thread analyses (including tot_cyc for \n        // each element)\n        let critical_paths = cycles_per_thread.map(x => x.map(y => max_func(y, z => z)));\n\n        data.critical_paths = critical_paths.map((x, index) => ({ thread_num: index + 1, value: x }));\n\n        let T1 = data.critical_paths.find(x => x.thread_num == 1).value;\n        data.speedup = critical_paths.map((x, index) => ({ thread_num: index + 1, value: x.map((y, yi) => T1[yi] / y) }));\n\n        data.efficiency = data.speedup.map((x, index) => ({ thread_num: index + 1, value: x.value.map((y, yi) => y / (index + 1)) }));\n\n        let ret = new DataBlock(data, \"path\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n\n}\n\nclass LazyCriticalPathAnalysis extends CriticalPathAnalysis {\n\n    constructor(communicator, entry_node, stateid) {\n        super(undefined, entry_node, stateid);\n        this.communicator = communicator;\n    }\n\n    async analyze() {\n        // We differ from the eager analysis here: We let the python/sql-side do the hard work\n        ObjectHelper.assert(\"Valid state\", this.for_state !== undefined);\n        let p1 = undefined;\n        if(this.section_entry_node !== undefined)\n            p1 = new Number(this.section_entry_node);\n        let tmp = await this.communicator.runAnalysis(\"CriticalPathAnalysis\", [p1, new Number(this.for_state)]).get();\n\n        let data = tmp;\n\n        let ret = new DataBlock(data, \"path\");\n        this.analysis_result = ret;\n        ret.judgement = this.judgement();\n        return ret;\n    }\n    \n}\n\n\nfunction AutoCriticalPathAnalysis(communicator, rundata, entry_node, stateid) {\n\n    if(rundata != undefined) {\n        return new CriticalPathAnalysis(rundata, entry_node, stateid);\n    }\n    else {\n        // This is a lazy analysis.\n        return new LazyCriticalPathAnalysis(communicator, entry_node, stateid)\n    }\n}\n\n\n\n// Class to check if a result is reasonable\nclass ResultVerifier {\n    constructor(all_perf_data) {\n        this.all_data = all_perf_data;\n\n        // Extract the list of supersections from the runs\n        let rundata = this.all_data.map(x => x.data);\n\n        ObjectHelper.assert(\"Data received\", rundata.length > 0);\n        if(!global_disable_verifier)\n            ResultVerifier.assert_all_runs_same_number_of_entries(rundata);\n    }\n\n    static assert_all_runs_same_number_of_entries(runs) {\n        \n        ObjectHelper.assert(\"all_runs_same_number_of_supersection\", runs.every(x => x.length == runs[0].length));\n\n        // Now get all sections and check again.\n        ObjectHelper.assert(\"all_runs_same_number_of_sections\", runs.every(x => MathHelper.sum(x.map(y => new SuperSection(y).sections().length)) == MathHelper.sum(runs[0].map(y => new SuperSection(y).sections().length))));\n\n        // Now check number of entries (this must also be the same)\n        ObjectHelper.assert(\"all_runs_same_number_of_entries\", runs.every(x => MathHelper.sum(x.map(y => MathHelper.sum(new SuperSection(y).sections().map(x => x.entries().length)))) == MathHelper.sum(runs[0].map(y => MathHelper.sum(new SuperSection(y).sections().map(x => x.entries().length))))));\n\n    }\n\n\n}\n\nexport {Entry, Section, SuperSection, MathHelper, ObjectHelper,\nCriticalPathAnalysis, MemoryAnalysis};","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport {ObjectHelper, MathHelper} from \"./datahelper.js\"\nimport { DiodeWindow } from \"./windowing.js\";\n\n// Renderer utilities.\n\n// Render a button to a canvas and return an image\nfunction render_button_to_graphic(button, mode=\"canvas_element\") {\n    let button_class = button.constructor.name;\n    let c = document.createElement(\"canvas\");\n    let ctx = c.getContext(\"2d\");\n\n    c.width = button.button_subwindow.targetwidth;\n    c.height = button.button_subwindow.targetheight;\n\n    // Recreate the button\n    let new_obj = new button.constructor(ctx, ...(button.dataparams));\n\n    new_obj.button_subwindow_state = 'open';\n    new_obj.is_locked_open = true;\n    // Skip animation\n    new_obj.setFullyOpen();\n    let b = new Bracket(ctx);\n\n    b.setupEventListeners();\n\n    b.addButton(new_obj);\n\n    b.drawEx(new Pos(-20, 0), new Pos(0, 0), 0, 0, true);\n\n\n    let imgdat = c.toDataURL(\"image/jpeg\");\n\n    if(mode === \"canvas_element\")\n        return c;\n    \n    return imgdat;\n}\n\nfunction createImageDownload(brackets, prefix=\"\") {\n    // Some difficulties here: First, we have to merge the images to one big image.\n    // We default to the following convention:\n    // There are 10 columns with a width of 800px each. The first column is reserved to (textual) information about the node\n    // Any more buttons would be wrapping around to newlines.\n\n    // Every bracket begins a newline\n\n    // Assuming WebKit=Firefox, there's a maximum of 32767px in either direction, or a total of 472'907'776px (e.g., 22'528 x 20'992)\n\n    // TODO: Reevalutate this code and adjust to the case that there are more than 10 buttons (implement wrap-around, basically)\n\n    let c = document.createElement(\"canvas\");\n\n    let ctx = c.getContext(\"2d\");\n\n    const colsize = 700;\n    const rowsize = 500;\n    let ypos = 0;\n    let maxxpos = 0;\n\n    // Cut height\n    c.height = Object.entries(brackets).length * rowsize;\n\n    // Cut width\n    let tmp = Object.entries(brackets)[0][1];\n    c.width = (1 + tmp.buttons.length) * colsize;\n\n\n    // Fill white (will appear as transparent otherwise, which is viewer-dependent)\n    ctx.save();\n    ctx.fillStyle = \"white\";\n    ctx.fillRect(0, 0, c.width, c.height);\n    ctx.restore();\n\n    for(let bracket_entry of Object.entries(brackets)) {\n        \n        let key = bracket_entry[0];\n        let bracket = bracket_entry[1];\n\n        ctx.save();\n\n        ctx.textBaseline = \"middle\";\n        ctx.textAlign = \"center\";\n\n        ctx.font = \"60px Arial\";\n\n        let unified_id = new Number(key);\n        let stateid = (unified_id >> 16) & 0xFFFF;\n        let nodeid = (unified_id) & 0xFFFF;\n\n        ctx.fillText(\"Affected node \" + stateid.toString() + \"|\" + nodeid.toString(), colsize / 2.0, ypos + rowsize / 2.0);\n\n        ctx.restore();\n        \n        let xpos = colsize;\n        for(let button of bracket.buttons) {\n            // Draw the buttons accordingly\n\n            let src_canvas = render_button_to_graphic(button);\n\n            ctx.drawImage(src_canvas, xpos, ypos);\n\n            xpos += colsize;\n        }\n        maxxpos = Math.max(maxxpos, xpos);\n\n        ypos += rowsize;\n        xpos = 0;\n    }\n\n    let imgdat = c.toDataURL(\"image/jpeg\");\n    \n    let d = document.createElement(\"a\");\n    d.setAttribute(\"href\", imgdat);\n    d.setAttribute(\"download\", prefix + \"buttons.jpg\");\n\n    d.style.display = 'none';\n    document.body.appendChild(d);\n  \n    d.click();\n  \n    document.body.removeChild(d);\n\n}\n\nfunction max_func(array, func) {\n    if(array == undefined) {\n        console.trace(\"undefined parameter\");\n    }\n    ObjectHelper.assert(\"Array is non-empty\", array.length > 0);\n    let max_obj = null;\n    let max_val = func(array[0]);\n    for(let x of array) {\n        let m = func(x);\n        if(m > max_val) {\n            max_val = m;\n            max_obj = x;\n        }\n    }\n\n    return max_val;\n}\n\nfunction max_func_obj(array, func, objfunc) {\n    if(array.length == 0) {\n        return null;\n    }\n    let max_obj = objfunc(array[0]);\n    let max_val = func(array[0]);\n    for(let x of array) {\n        let m = func(x);\n        if(m > max_val) {\n            max_val = m;\n            max_obj = objfunc(x);\n        }\n    }\n\n    return max_obj;\n}\n\nfunction min_func(array, func) {\n    let min_obj = null;\n    let min_val = func(array[0]);\n    for(let x of array) {\n        let m = func(x);\n        if(m < min_val) {\n            min_val = m;\n            min_obj = x;\n        }\n    }\n\n    return min_val;\n}\n\nclass Pos {\n    constructor(x, y) {\n        this.x = x;\n        this.y = y;\n    }\n\n    toString() {\n        return \"(\" + this.x + \", \" + this.y + \")\";\n    }\n\n    minus(other) {\n        return new Pos(this.x - other.x, this.y - other.y);\n    }\n    plus(other) {\n        return new Pos(this.x + other.x, this.y + other.y);\n    }\n    times(other) {\n        return new Pos(this.x * other.x, this.y * other.y);\n    }\n    \n    multiply(num) {\n        return new Pos(this.x * num, this.y * num);\n    }\n\n    dist() {\n        return Math.sqrt(this.x * this.x + this.y * this.y);\n    }\n\n    inRect(topleft, bottomright) {\n        if (this.x < topleft.x || this.y < topleft.y) return false;\n        if (this.x > bottomright.x || this.y > bottomright.y) return false;\n        return true;\n    }\n}\n\n\nclass Clickable {\n\n    constructor() {\n\n        this.children = Array();\n\n        this.onEnterHover = function () { return false; }\n        this.onLeaveHover = function () { return false; }\n        this.onClick = function () { return false; }\n        this.onDoubleClick = function () { return false; }\n        this.onMouseMove = function () { return false; }\n        \n\n        this.clickable_state = \"not_hovered\";\n\n        this.enable_func = () => true;\n    }\n\n    destroy() {\n        this.children = [];\n    }\n\n    addChild(clickable) {\n        this.children.push(clickable);\n    }\n\n    addVIPChild(clickable) {\n        this.children.unshift(clickable);\n    }\n\n    setEnableFunc(func) {\n        this.enable_func = func;\n    }\n\n    onUpdateDoubleClick(mousepos, mb) {\n        if(!this.enable_func()) return false;\n        if(this.is_inside(mousepos)) {\n            if(this.onDoubleClick())\n                return true;\n        }\n        else {\n            // Deselect?\n        }\n\n        for(let c of this.children) {\n            if(c.onUpdateDoubleClick(mousepos, mb)) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n    onUpdateClick(mousepos, mb) {\n        if(!this.enable_func()) return false;\n        if(this.is_inside(mousepos)) {\n            if(this.onClick())\n                return true;\n        }\n        else {\n            // Deselect?\n        }\n\n        for(let c of this.children) {\n            if(c.onUpdateClick(mousepos, mb)) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n    onUpdateMove(mousepos) {\n        if(!this.enable_func()) return false;\n        if (this.is_inside(mousepos)) {\n            this.onMouseMove(mousepos);\n            if (this.clickable_state == \"not_hovered\") {\n                this.clickable_state = \"hovered\";\n                if (this.onEnterHover(mousepos)) {\n                    return true;\n                }\n            }\n        }\n        else {\n            if (this.clickable_state == \"hovered\") {\n                this.clickable_state = \"not_hovered\";\n                if (this.onLeaveHover()) {\n                    return true;\n                }\n            }\n        }\n        // Else pass to children\n        for (let c of this.children) {\n            if (c.onUpdateMove(mousepos)) {\n                return true;\n            }\n        }\n\n        return false;\n    }\n\n    is_inside(pos) {\n        // Abstract\n        console.log(\"Abstract function called (is_inside)\");\n        return false\n    }\n\n    setOnEnterHover(func) {\n        this.onEnterHover = func;\n    }\n\n    setOnLeaveHover(func) {\n        this.onLeaveHover = func;\n    }\n\n    setOnClick(func) {\n        this.onClick = func;\n    }\n\n    setOnDoubleClick(func) {\n        this.onDoubleClick = func;\n    }\n\n    setOnMouseMove(func) {\n        this.onMouseMove = func;\n    }\n\n}\n\nclass SubWindow extends Clickable {\n    constructor(ctx, x, y, width, height) {\n        super();\n\n        this.ctx = ctx;\n        this.topleft = new Pos(x, y);\n        this.targetwidth = width;\n        this.targetheight = height;\n        this._sizetrans = 0;\n\n        this.subwindow_trans_change = 10;\n\n        this.subwindow_popped_out = false;\n\n        this.layout = null;\n\n        this.background_color = \"white\"; // Set to \"transparent\" if no background is requested\n    }\n\n    setLayout(layout) {\n        this.layout = layout;\n        return this;\n    }\n\n    width() {\n        return this.targetwidth * this._sizetrans / 100.;\n    }\n\n    height() {\n        return this.targetheight * this._sizetrans / 100.;\n    }\n\n    draw(topleft, state, ctx_override = null) {\n\n        if (topleft != null)\n            this.topleft = topleft;\n\n        let ctx = this.ctx;\n        if(ctx_override) {\n            ctx = ctx_override;\n        }\n\n        ctx.save();\n\n        ctx.beginPath();\n        ctx.strokeStyle = \"black\";\n        ctx.lineWidth = 2;\n        let oldfill = ctx.fillStyle;\n        ctx.fillStyle = this.background_color;\n        ctx.rect(this.topleft.x, this.topleft.y, this.width(), this.height());\n        ctx.fill();\n        ctx.stroke();\n        ctx.fillStyle = oldfill;\n\n        if (state == 'open') {\n            this._sizetrans += this.subwindow_trans_change;\n            if (this._sizetrans > 100.)\n                this._sizetrans = 100.;\n        } else if (state == 'collapsed') {\n            this._sizetrans -= this.subwindow_trans_change;\n            if (this._sizetrans < 0.)\n                this._sizetrans = 0.;\n        }\n\n        if(this.layout != null) {\n            if(this._sizetrans != 0)\n                this.layout.draw(ctx);\n        }\n\n        ctx.restore();\n    }\n\n    is_inside(pos) {\n        let offsetpos = pos.minus(this.topleft);\n\n        if (offsetpos.x < 0 || offsetpos.y < 0) return false;\n        if (offsetpos.x > this.width() || this.height()) return false;\n        return true;\n    }\n\n\n}\n\nclass Button extends Clickable {\n    constructor(ctx) {\n        super();\n        this.ctx = ctx;\n        this.state = 0;\n        this.update = 0;\n\n        this.color = \"orange\";\n        this.button_subwindow_state = \"collapsed\";\n        this.button_subwindow = new SubWindow(ctx, 0, 0, 600, 400);\n        this.addChild(this.button_subwindow);\n        this.is_locked_open = false;\n\n        this.topleft = new Pos(0,0);\n        this.size = new Pos(0,0);\n\n        this.button_image = null;\n    }\n\n    setDefaultDblClick() {\n        this.setOnDoubleClick(p => {\n            let newwin = new DiodeWindow(window);\n            newwin.setSenderData({ \n                className: this.constructor.name,\n                dataParams: this.dataparams\n            });\n            let subwin = newwin.open(\"renderer_dir/subwindow.html\", \"_blank\");\n            if(!subwin) {\n                console.log(\"Failed to open subwindow\");\n                alert(\"failed to open subwindow\");\n            }\n            \n            return true;\n        });\n    }\n\n    // Bypass the opening animation (for saving results)\n    setFullyOpen() {\n        this.button_subwindow_state = \"open\";\n        this.button_subwindow._sizetrans = 100.0;\n        this.is_locked_open = true;\n    }\n\n    // Set a button image from data_url, and resize to the given side length (the image must be square)\n    setButtonImage(data_url, side_len = 100) {\n        if(data_url == undefined) {\n            return this;\n        }\n        \n        this.button_image = new Image();\n        this.button_image.src = data_url;\n\n        // Apparently you cannot assume that the image element is ready synchronously (without onload, it could happen that an empty image is set instead)\n        this.button_image.onload = () => {\n\n            let c = document.createElement(\"canvas\");\n            let ctx = c.getContext(\"2d\");\n\n            c.width = side_len;\n            c.height = side_len;\n\n            ctx.drawImage(this.button_image, 0, 0, side_len, side_len);\n\n            // Now set the resized image to gain some performance.\n            this.button_image.src = c.toDataURL();\n        }\n    }\n\n    is_inside(pos) {\n        let offsetpos = pos.minus(this.topleft);\n\n        if (offsetpos.x < 0 || offsetpos.y < 0) return false;\n        if (offsetpos.x > this.size.x || offsetpos.y > this.size.y) return false;\n        return true;\n    }\n\n    draw(topleft, size) {\n        this.update++;\n        let now = new Date();\n        let ctx = this.ctx;\n\n        this.topleft = topleft\n        this.size = size\n\n        // Draw the window first (this way, the button is not occluded)\n        this.button_subwindow.draw(topleft, this.button_subwindow_state);\n        ctx.save();\n\n        ctx.beginPath();\n        // Draw the rect\n        if(this.button_image == null) {\n            if (this.state == 0) {\n            \n                let cfseg = 2 * Math.PI / 1000.;\n                let mid = size.x / 2;\n                let fac = now.getMilliseconds();\n                let xval = Math.cos(cfseg * fac) * mid;\n                let yval = Math.sin(cfseg * fac) * mid;\n\n\n                let grad = ctx.createLinearGradient(topleft.x + mid + xval, topleft.y + mid + yval, topleft.x + mid - xval, topleft.y + mid - yval);\n                grad.addColorStop(0, this.color);\n                grad.addColorStop(1, \"white\");\n                ctx.fillStyle = grad;\n                \n            }\n\n            ctx.strokeStyle = \"#000000\";\n            ctx.lineWidth = 2;\n            ctx.rect(topleft.x, topleft.y, size.x, size.y);\n            ctx.stroke();\n            if (this.state == 0) {\n                ctx.fill();\n            }\n        }\n        else {\n            ctx.drawImage(this.button_image, topleft.x, topleft.y, size.x, size.y);\n            ctx.strokeStyle = \"#000000\";\n            ctx.lineWidth = 2;\n            ctx.rect(topleft.x, topleft.y, size.x, size.y);\n            ctx.stroke();\n        }\n\n        ctx.restore();\n\n        topleft = null;\n        size = null;\n        now = null;\n\n    }\n\n\n}\n\n// Class to specify where which elements are located\nclass Layout {\n    constructor(subwindow) {\n        this.parent = subwindow;\n        this._layout = {};\n        this.databinding = null;\n        let _this = this;\n        this._layout_clickable = new class extends Clickable {\n            is_inside(pos) {\n                for(let x of Object.keys(_this._layout)) {\n                    let val = _this._layout[x];\n                    let realsize = new Pos(_this.parent.width() * val.size.x / 100.0, _this.parent.height() * val.size.y / 100.0);\n                    let realtopleft = _this.parent.topleft.plus(val.topleft.times(new Pos(_this.parent.width() / 100.0, _this.parent.height() / 100.0)));\n\n                    let inside = realtopleft.x < pos.x && pos.x < (realtopleft.x + realsize.x) && realtopleft.y < pos.y && pos.y < (realtopleft.y + realsize.y);\n                    let has_handlers = true;\n                    if(inside && has_handlers) {\n                        this._tmp_hovered = x;\n                        this._mouse_pos = pos;\n                        return true;\n                    }\n                }\n                delete this._tmp_hovered;\n                return false;\n            }\n        }\n\n        this._layout_clickable.setOnClick(() => {\n            let target = this._layout_clickable._tmp_hovered;\n            let val = this._layout[target];\n\n            let realsize = new Pos(this.parent.width() * val.size.x / 100.0, this.parent.height() * val.size.y / 100.0);\n            let realtopleft = this.parent.topleft.plus(val.topleft.times(new Pos(this.parent.width() / 100.0, this.parent.height() / 100.0)));\n\n            let pos = this._layout_clickable._mouse_pos;\n\n            // check if the \"information-button\" is clicked\n            {\n                let dv = this.getCurrentDataView(target);\n                if(dv.information_button_pos != null) {\n                    if(dv.information_button_pos.x < pos.x && dv.information_button_pos.y < pos.y) {\n                        if(dv.information_button_pos.x + dv.information_button_size.x > pos.x && dv.information_button_pos.y + dv.information_button_size.y > pos.y) {\n                            console.log(\"Information Button clicked!\");\n                            dv.showOptimizationHints();\n                            return true;\n                        }\n                    }\n                }\n            }\n\n            let left = realtopleft.x + realsize.x - 20;\n            let right = realtopleft.x + realsize.x;\n            let top = realtopleft.y;\n            let bottom = realtopleft.y + 20;\n            if(val.is_multiview) {\n                if(left < pos.x && pos.x < right && top < pos.y && pos.y < bottom) {\n                    // Multiview switcher pressed\n                    val.multiview_selector = (val.multiview_selector + 1) % val.dataviews.length;\n                    return true;\n                }\n                else {\n                }\n            }\n            \n            return false; // Pass the event to the next handler\n            \n\n        });\n\n        this._layout_clickable.setOnMouseMove((pos) => {\n            // We want to know the position and which element is hovered so \n            // that we can forward events\n            let target = this._layout_clickable._tmp_hovered;\n            if(target) {\n                let val = this.getCurrentDataView(target);\n                val.mouseInside(pos);\n                return true;\n            }\n            else {\n            }\n        });\n\n        this._layout_clickable.setOnDoubleClick(() => {\n            let target = this._layout_clickable._tmp_hovered;\n            let val = this._layout[target];\n\n            let realsize = new Pos(this.parent.width() * val.size.x / 100.0, this.parent.height() * val.size.y / 100.0);\n            let realtopleft = this.parent.topleft.plus(val.topleft.times(new Pos(this.parent.width() / 100.0, this.parent.height() / 100.0)));\n\n            let pos = this._layout_clickable._mouse_pos;\n\n            let left = realtopleft.x + realsize.x - 20;\n            let right = realtopleft.x + realsize.x;\n            let top = realtopleft.y;\n            let bottom = realtopleft.y + 20;\n            if(val.is_multiview) {\n                if(left < pos.x && pos.x < right && top < pos.y && pos.y < bottom) {\n                    return false;\n                }\n                else {\n                    // Trigger the options for the underlying dataview\n                    let dv = val.dataviews[val.multiview_selector];\n\n                    dv.openSettingsWindow();\n                    return true;\n                }\n            }\n            else {\n                // Trigger the options for the underlying dataview\n                let dv = val.dataview;\n\n                dv.openSettingsWindow();\n\n                return true;\n            }\n            \n            return false; // Not reached, but leave here (in case the handling of above cases changes)\n            \n\n        });\n\n        subwindow.addVIPChild(this._layout_clickable);\n    }\n\n    setEventHandlers(click, enter, leave) {\n        this._layout_clickable.setOnClick(click);\n        this._layout_clickable.setOnEnterHover(enter);\n        this._layout_clickable.setOnLeaveHover(leave);\n    }\n\n    getCurrentDataView(rect_name) {\n        let val = this._layout[rect_name];\n        if(val.is_multiview) {\n            return val.dataviews[val.multiview_selector];\n        }\n        else {\n            return val.dataview;\n        }\n    }\n\n    getLayoutObject() {\n        let ret = {};\n        for(let k of Object.keys(this._layout)) {\n            if(k == 'dataview') continue;\n            if(k == 'dataviews') continue;\n            ret[k] = this._layout[k];\n        }\n        return this._layout;\n    }\n\n    // Sizes all must be in percentages.\n    setRect(name, topleft, size, dataview) {\n        this._layout[name] = {};\n        this._layout[name].topleft = topleft;\n        this._layout[name].size = size;\n        this._layout[name].dataview = dataview;\n    }\n\n    setMultiviewRect(name, topleft, size, dataview_array) {\n        if(dataview_array.length < 1) {\n            alert(\"You cannot set a multiview with no contents!\");\n            return;\n        }\n        this._layout[name] = {};\n        this._layout[name].topleft = topleft;\n        this._layout[name].size = size;\n        this._layout[name].dataviews = dataview_array;\n        this._layout[name].is_multiview = true;\n        this._layout[name].multiview_selector = dataview_array.length - 1;\n\n        // Set enable functions so that charts that are hidden behind others \n        // don't get the events propagated\n        for(let i = 0; i < dataview_array.length; ++i) {\n            let x = dataview_array[i];\n            if(x instanceof RU_DataViewBarGraph) {\n                x.dvbg_clickable.setEnableFunc(() => {\n                    return this._layout[name].multiview_selector == i;\n                });\n            }\n        }\n    }\n\n    setDataBinding(db) {\n        this.databinding = db;\n    }\n\n    draw(ctx) {\n        let databinding = this.databinding;\n        for(let x of Object.keys(this._layout)) {\n            let val = this._layout[x];\n\n            let realsize = new Pos(this.parent.width() * val.size.x / 100.0, this.parent.height() * val.size.y / 100.0);\n            let realtopleft = this.parent.topleft.plus(val.topleft.times(new Pos(this.parent.width() / 100.0, this.parent.height() / 100.0)));\n\n            let dv = null;\n            if(val.is_multiview) {\n                dv = val.dataviews[val.multiview_selector];\n            }\n            else {\n                dv = val.dataview;\n            }\n            if(dv == undefined) {\n                console.log(\"Undefined dv for key \" + x);\n            }\n            dv.setRect(realtopleft, realsize);\n\n            if(val.is_multiview) {\n                dv.draw(ctx, databinding[x][val.multiview_selector], this.parent._sizetrans / 100.);\n                ctx.save();\n                ctx.beginPath();\n                ctx.fillStyle=\"lime\";\n                ctx.rect(realtopleft.x + realsize.x - 20, realtopleft.y, 20, 20);\n                ctx.fill();\n                ctx.restore();\n            }\n            else {\n                dv.draw(ctx, databinding[x], this.parent._sizetrans / 100.);\n            }\n        }\n    }\n}\n\n// Class holding data\nclass DataBlock {\n    constructor(data, type) {\n        this.setData(data, type);\n    }\n    setData(data, type) {\n        this.data = data;\n        this.datatype = type;\n\n        return this;\n    }\n}\n\n// Class providing an interface to plug some graphs into.\nclass RU_DataView {\n    constructor() {\n        this.topleft = null;\n        this.size = null;\n        this.analyze = x => x;\n        this.color_scaling_func = x => x;\n\n        this.update_data = true;\n\n        /* String that contains an html markup with general information about \n           the implications of this dataview (i.e. how to interpret the \n           displayed results) */\n        this.information_html_string = \"\";\n\n        this.information_overlay_age = 0;\n        this.information_overlay_alpha = 0.0;\n        this.information_overlay_timer = null;\n\n        this.information_button_pos = null;\n        this.information_button_size = null;\n        this.optimization_hint_path = \"error\";\n    }\n\n    setInformationFilePath(path) {\n        this.optimization_hint_path = path;\n\n        return this;\n    }\n\n    showOptimizationHints() {\n        \n        console.log(\"Opening \" + this.optimization_hint_path);\n        let win = window.open(this.optimization_hint_path, \"\", \"width=800,height=600\");\n        \n        ObjectHelper.assert(\"win valid\", win != null);\n\n        return this;\n    }\n\n    mouseInside(pos) {\n        ObjectHelper.assert(\"pos valid\", pos);\n        ObjectHelper.assert(\"topleft valid\", this.topleft);\n        ObjectHelper.assert(\"size valid\", this.size);\n        \n        let diff = pos.minus(this.topleft.plus(new Pos(this.size.x / 2, 0)));\n\n        let dist = diff.dist();\n\n        if(dist <= 30) {\n            this.information_overlay_age = -1;\n            window.clearTimeout(this.information_overlay_timer);\n            this.information_overlay_timer = window.setTimeout(() => this.information_overlay_age = 0,  3000);\n        }\n        else {\n            this.information_overlay_age = 0;\n        }\n\n        if(dist <= 10) {\n            this.information_overlay_alpha = 1.0;\n        }\n        else {\n            // Scale squared\n            let d = (dist) / 10;\n            this.information_overlay_alpha = 1.0 / (d);\n        }\n    }\n\n    // Draw an overlay (containing the info-button at least). This function \n    // should be called by all subclasses after drawing.\n    drawOverlay(ctx, scale = 1.0) {\n\n        if(this.information_overlay_age >= 0) {\n\n            ++this.information_overlay_age;\n            if(this.information_overlay_age > 1) {\n                this.information_overlay_alpha -= 0.05;\n                if(this.information_overlay_alpha < 0) {\n                    this.information_overlay_alpha = 0;\n                }\n                this.information_overlay_age = 0; \n            }\n        }\n\n        let alpha = 0.9; // Transparency value\n        alpha *= this.information_overlay_alpha;\n        let subalpha = 1.0;\n        subalpha *= this.information_overlay_alpha;\n        \n        let information_sign = \"\\u{1F6C8}\"; // This is the circled information icon.\n        let base_fontsize = 18;\n        ctx.save();\n        ctx.beginPath();\n\n        // Setup font\n        ctx.textAlign = \"center\";\n        ctx.textBaseline = \"top\";\n        ctx.font = Math.round(base_fontsize * scale) + \"px sans-serif\";\n\n        // Get the textwidth\n        let textwidth = ctx.measureText(information_sign).width;\n        let textheight = textwidth;\n        // Draw background first\n        ctx.fillStyle = \"rgba(128, 128, 128, \" + alpha + \")\";\n        ctx.strokeStyle = \"rgba(128, 128, 128, \" + subalpha + \")\";\n        this.information_button_pos = new Pos(this.topleft.x + (this.size.x - textwidth) * scale / 2 - textwidth, this.topleft.y);\n        this.information_button_size = new Pos(textwidth * 3, textheight * 1.1);\n        ctx.rect(this.information_button_pos.x, this.information_button_pos.y, this.information_button_size.x, this.information_button_size.y);\n        ctx.fill();\n        ctx.stroke();\n\n        ctx.beginPath();\n        \n        alpha = 3.0 * this.information_overlay_alpha; \n        ctx.fillStyle = \"rgba(0, 0, 255, \" + alpha + \")\";\n        let center_x = this.topleft.x + this.size.x * scale / 2;\n        ctx.fillText(information_sign, center_x, this.topleft.y);\n\n\n        ctx.restore();\n    }\n\n    // Gets the settings (data analysis function and subclass-specific settings)\n    getSettingsDict() {\n        let ret = {\n            \"analysis_func\": {\n                type: \"code\",\n                value: this.analyze.toString(),\n                description: \"#TODO\"\n            }\n        };\n\n        return ret;\n    }\n\n    setSettingsDict(dict) {\n        let func = eval(dict['analysis_func'].value.toString());\n        ObjectHelper.assert(\"Object type function\", func instanceof Function);\n        this.setDataAnalysisFunction(func);\n        this.update_data = true; // Trigger an update request\n    }\n\n    setInformationHTMLString(str) {\n        this.information_html_string = str;\n        return this;\n    }\n\n    getInformationHTMLString() {\n        return this.information_html_string;\n    }\n\n    openSettingsWindow() {\n        let sw = new DiodeWindow(window);\n        // Set the callback function for user-defined data\n        sw.setCallback(x => {\n            \n            if(x.type == \"ClientOpened\") {\n                sw.reply(x.source, x.origin, {\n                    type: \"settings-data\",\n                    data: this.getSettingsDict()\n                });\n            }\n            else if(x.type == \"save-settings\") {\n                this.setSettingsDict(x.data);\n                console.log(\"Applied new settings\");\n            }\n            else {\n                console.log(\"Undefined operation reached! \" + JSON.stringify(x));\n            }\n        });\n        let cw = sw.open(\"DataViewSettings.html\", \"_blank\");\n        if(!cw) {\n            alert(\"Failed to open child window...\");\n        }\n    }\n\n    setTitle(title) {\n        // Abstract\n        return this;\n    }\n    draw(ctx, datablock, scale) {\n        console.log(\"Abstract function called\");\n    }\n\n    getSendableObject() {\n        return this;\n    }\n\n    fromSendableObject(object) {\n        console.log(\"Abstract function fromSendableObject() called\");\n        return this;\n    }\n\n    setDataAnalysisFunction(func) {\n        this.analyze = func;\n        return this;\n    }\n\n    setRect(topleft, size) {\n        this.topleft = topleft;\n        this.size = size;\n        return this;\n    }\n    \n    drawRect(ctx) {\n        ctx.beginPath();\n        ctx.rect(this.topleft.x, this.topleft.y, this.size.x, this.size.y);\n        ctx.stroke();\n    }\n}\n\n// Class to draw text\nclass RU_DataViewText extends RU_DataView {\n    constructor() {\n        super();\n    }\n\n    fromSendableObject(obj) {\n        // We don't need to do anything here because the data is in the datablock...\n        return this;\n    }\n    draw(ctx, datablock, scale) {\n\n        if(scale == 0.)\n            return;\n\n\n        ctx.save();\n\n        ctx.beginPath();\n\n\n        ctx.font = Math.round(scale * datablock.data.fontsize).toString() + \"px sans-serif\";\n        ctx.fillStyle = datablock.data.color;\n        ctx.textAlign=datablock.data.align;\n        let textheight = ctx.measureText('M').width;\n        ctx.fillText(datablock.data.text, this.topleft.x + this.size.x / 2, this.topleft.y + textheight);\n\n        ctx.restore();\n\n    }\n\n}\n\n// Class to bar graphs (using chart.js)\nclass RU_DataViewBarGraph extends RU_DataView {\n    constructor(optstruct = null) {\n        super();\n\n        let typevar = \"bar\";\n        let xAxisVar = undefined;\n        let yAxisVar = undefined;\n\n        this.dvbg_chart_data = null;\n\n        if(optstruct != null) {\n            if(optstruct.type != undefined) {\n                typevar = optstruct.type;\n            }\n            if(optstruct.xAxes != undefined) {\n                xAxisVar = optstruct.xAxes;\n            }\n            if(optstruct.yAxes != undefined) {\n                yAxisVar = optstruct.yAxes;\n            }\n        }\n\n        // We create a new canvas just for the chart (mainly to avoid \n        // potential trouble with different update handlers)\n        this.dvbg_canvas_scaler = document.createElement(\"div\");\n        this.dvbg_canvas = document.createElement(\"canvas\");\n        this.dvbg_ctx = this.dvbg_canvas.getContext(\"2d\");\n\n        this.dvbg_canvas_scaler.appendChild(this.dvbg_canvas);\n        document.body.appendChild(this.dvbg_canvas_scaler);\n\n        let chartsettings = {\n            type: typevar,\n            data: this.analyze(null),\n            options: {\n                responsive: true,\n                title: {\n                    display: true,\n                    text: \"Chart test...\"\n                },\n                tooltips: {\n                    mode: 'index',\n                    intersect: true\n                },\n                scales: {\n                    \n                }\n            }\n        };\n\n        if(xAxisVar != undefined) {\n            chartsettings.options.scales.xAxes = xAxisVar;\n        }\n        if(yAxisVar != undefined) {\n            chartsettings.options.scales.yAxes = yAxisVar;\n        }\n\n        this.dvbg_chart = new Chart(this.dvbg_ctx, chartsettings);\n\n        this.dvbg_canvas_scaler.style.visibility = \"hidden\";\n        this.dvbg_canvas_scaler.style.position = \"fixed\";\n\n        // A Clickable instance, for forwarding events.\n        let parent_this = this;\n        this.dvbg_clickable = new class extends Clickable {\n            constructor() {\n                super();\n            }\n\n            is_inside(pos) {\n                if(parent_this.topleft == null) return false;\n                return (parent_this.topleft.x < pos.x && pos.x < parent_this.topleft.x + parent_this.size.x) && (parent_this.topleft.y < pos.y && pos.y < parent_this.topleft.y + parent_this.size.y);\n            }\n\n            onUpdateMove(pos) {\n                if(!this.enable_func()) return false;\n                if(!this.is_inside(pos))\n                    return false;\n                // We have to translate the event to the target.\n                let rect = parent_this.dvbg_canvas.getBoundingClientRect();\n                let event = new MouseEvent(\"mousemove\", {\n                    offsetX: pos.x,\n                    offsetY: pos.y,\n                    clientX: rect.left + pos.x - parent_this.topleft.x,\n                    clientY: rect.top + pos.y - parent_this.topleft.y\n                });\n\n                // Now pass to other canvas\n                parent_this.dvbg_canvas.dispatchEvent(event);\n            }\n\n            onUpdateClick(pos) {\n                if(!this.enable_func()) return false;\n                if(!this.is_inside(pos))\n                    return false;\n                // We have to translate the event to the target.\n                let rect = parent_this.dvbg_canvas.getBoundingClientRect();\n                let event = new MouseEvent(\"click\", {\n                    offsetX: pos.x,\n                    offsetY: pos.y,\n                    clientX: rect.left + pos.x - parent_this.topleft.x,\n                    clientY: rect.top + pos.y - parent_this.topleft.y\n                });\n\n                // Now pass to other canvas\n                parent_this.dvbg_canvas.dispatchEvent(event);\n            }\n        }\n    }\n\n    getSettingsDict() {\n        let basedict = super.getSettingsDict();\n\n        // Collect the information\n        let xAxes = this.dvbg_chart.options.scales.xAxes;\n        let yAxes = this.dvbg_chart.options.scales.yAxes;\n        let display_xAxes = xAxes.some(x => x == undefined || x.display);\n        let display_yAxes = yAxes.some(x => x == undefined || x.display);\n\n        let display_legend = this.dvbg_chart.options.legend.display;\n\n        // Now we can append to the basedict\n        basedict['graph_general_options'] = {\n            type: \"group\", // Specify subgroup\n            value: {\n                // new subgroup of all graph options\n                \"display_horizonal_axis\": {\n                    type: \"bool\",\n                    value: display_xAxes,\n                    description: \"Display the horizontal axes\"\n                },\n                \"display_vertical_axis\": {\n                    type: \"bool\",\n                    value: display_yAxes,\n                    description: \"Display the vertical axes\"\n                },\n                \"display_legend\": {\n                    type: \"bool\",\n                    value: display_legend,\n                    description: \"Display the legend\"\n                }\n            },\n            description: \"General graph display options\"\n\n        };\n\n        return basedict;\n    }\n\n    setSettingsDict(dict) {\n        super.setSettingsDict(dict);\n\n        // Get the desired settings\n        let general_graph_options = dict['graph_general_options'].value;\n        let dha = general_graph_options['display_horizonal_axis'].value;\n        let dva = general_graph_options['display_vertical_axis'].value;\n        let dl = general_graph_options['display_legend'].value;\n\n        // Apply the settings\n        this.dvbg_chart.options.scales.xAxes.forEach(x => x.display = dha);\n        this.dvbg_chart.options.scales.yAxes.forEach(x => x.display = dva);\n\n        this.dvbg_chart.options.legend.display = dl;\n\n        this.dvbg_chart.update();\n    }\n\n    getSendableObject() {\n        let ret = {};\n\n        ret.chartsettings = this.dvbg_chart.options;\n        ret.analyze = this.analyze.toString();\n\n        return ret;\n    }\n\n    fromSendableObject(obj) {\n        this.setDataAnalysisFunction(new Function(obj.analyze));\n        return this;\n    }\n\n\n    // Provides an array of some pre-selected colors.\n    static colorList() {\n        let ret = new Array();\n\n        //ret.push(\"red\");\n        ret.push(\"rgba(255, 0, 0, 0.7)\");\n        //ret.push(\"green\");\n        ret.push(\"rgba(0, 128, 0, 0.7)\");\n        //ret.push(\"blue\");\n        ret.push(\"rgba(0, 0, 255, 0.7)\");\n        //ret.push(\"#E8ADAA\"); // rose\n        ret.push(\"rgba(232, 173, 170, 0.7)\");\n        //ret.push(\"cyan\");\n        ret.push(\"rgba(0, 255, 255, 0.7)\");\n        //ret.push(\"black\");\n        ret.push(\"rgba(0, 0, 0, 0.7)\");\n        //ret.push(\"aqua\");\n        ret.push(\"rgba(16, 255, 255, 0.7)\");\n        //ret.push(\"lime\");\n        ret.push(\"rgba(0, 255, 0, 0.7)\");\n        //ret.push(\"fuchsia\");\n        ret.push(\"rgba(255, 0, 255, 0.7)\");\n        //ret.push(\"navy\");\n        ret.push(\"rgba(0, 0, 128, 0.7)\");\n        //ret.push(\"purple\");\n        ret.push(\"rgba(128, 0, 128, 0.7)\");\n        //ret.push(\"gray\");\n        ret.push(\"rgba(128, 128, 128, 0.7)\");\n\n        return ret;\n    }\n\n    linkMouse(parent) {\n        parent.addChild(this.dvbg_clickable);\n        return this;\n    }\n\n    changeGraphOptions(func) {\n        func(this.dvbg_chart);\n        return this;\n    }\n\n    draw(ctx, datablock, scale) {\n        if(scale == 0.)\n            return;\n\n        let update = this.prev_scale != scale;\n        this.prev_scale = scale;\n        this.dvbg_canvas_scaler.style.height = Math.max(this.size.y * scale, 1) + \"px\";\n        this.dvbg_canvas_scaler.style.width = Math.max(this.size.x * scale, 1) + \"px\";\n\n\n        if(this.update_data)\n        {\n            this.dvbg_chart_data = this.analyze(datablock);\n            let datacpy = JSON.parse(JSON.stringify(this.dvbg_chart_data)); \n            this.dvbg_chart.data = datacpy;\n            this.update_data = false;\n            this.dvbg_chart.update();\n        }\n\n        if(datablock == this.dvbg_cached_data) {\n            // no update needed\n        }\n        else {\n            this.dvbg_cached_data = datablock;\n\n            this.dvbg_chart.update();\n        }\n\n        if(update) {\n            // Force refresh\n            this.dvbg_chart.resize();\n        }\n        \n        \n        ctx.save();\n\n        ctx.beginPath();\n\n        // Blit this onto our canvas\n        ctx.drawImage(this.dvbg_canvas, this.topleft.x, this.topleft.y, this.size.x, this.size.y);\n\n        ctx.restore();\n\n    }\n\n}\n\nclass RU_DataViewNumberBlock extends RU_DataView {\n    constructor() {\n        super();\n\n        this.opt = {\n            display_title: true,\n            text_align: \"center\",\n            draw_bar: undefined, // Defines where to draw a bar. Options: \"left\", \"right\", \"top\", \"bottom\" or any combination thereof\n            padding: undefined\n        };\n\n        this.dvnb_cached_data = undefined;\n    }\n\n    setTitle(title) {\n        this.title = title;\n        return this;\n    }\n\n    setOptions(opt) {\n        this.opt = opt;\n        return this;\n    }\n\n    setStringFormatter(func) {\n        this.stringformatter = func;\n    }\n\n    static percent2color(percent) {\n        let step = 255 / 100.;\n\n        let val = Math.floor(step * percent) * 2;\n\n        let ret = 0;\n\n        if(percent <= 50) {\n            ret = 0x0000ff00 + 0x00010000 * val;\n        }\n        else {\n            ret = 0x00ff0000 + 0x00000100 * Math.round(255.0 - val);\n        }\n        return '#' + ret.toString(16).padStart(6, '0');\n    }\n    setColorScaling(func) {\n        this.color_scaling_func = func;\n        return this;\n    }\n    draw(ctx, datablock, scale) {\n\n        if(this.update_data)\n        {\n            this.dvnb_cached_data = this.analyze(datablock);\n            this.update_data = false;\n        }\n\n        if(scale == 0.)\n            return; //Nothing to do if we are size 0\n        \n        ctx.save();\n\n        ctx.beginPath();\n        ctx.textAlign=\"center\";\n        ctx.font= Math.round(16 * scale).toString() + \"px sans-serif\";\n        \n        let textheight = ctx.measureText('M').width; // Approximating text height by width of M (which should be about square)\n        let x = this.topleft.x + this.size.x / 2;\n        let y = this.topleft.y + textheight;\n\n        if(this.opt.display_title) {\n            ctx.fillText(this.title, x, y); // Set the title\n        }\n\n        // We'll only be interested in balance_max.\n        let p = this.dvnb_cached_data;\n\n        ctx.beginPath();\n        ctx.textAlign = this.opt.text_align;\n        ctx.font=\"bold \" + (50 * scale).toString() + \"px sans-serif\";\n        ctx.fillStyle=RU_DataViewNumberBlock.percent2color(this.color_scaling_func(p));\n        textheight = ctx.measureText('M').width;\n        ctx.textBaseline = \"middle\";\n\n        let left_pad = 0;\n        if(this.opt.padding) {\n            if(this.opt.padding.left) {\n                left_pad = this.opt.padding.left;\n            }\n        }\n        if(this.opt.text_align == \"center\")\n            ctx.fillText(String(p) + \"%\", x + left_pad, this.topleft.y + this.size.y / 2);\n        else if(this.opt.text_align == \"left\")\n            ctx.fillText(String(p) + \"%\", this.topleft.x + left_pad, this.topleft.y + this.size.y / 2);\n        \n        \n        if(this.opt.draw_bar) {\n            for(x of this.opt.draw_bar) {\n                if(x == \"left\") {\n                    ctx.beginPath();\n                    ctx.strokeStyle=\"black\";\n                    ctx.lineWidth = 3;\n                    ctx.moveTo(this.topleft.x, this.topleft.y);\n                    ctx.lineTo(this.topleft.x, this.topleft.y + this.size.y * scale);\n                    ctx.stroke();\n                }\n                else {\n                    console.log(\"#TODO: Implement this other DataViewNumberBlock bar: \" + x);\n                }\n            }\n        }\n\n        this.drawOverlay(ctx, scale);\n\n        ctx.restore();\n    }\n}\n\n// Class to suggest actions based on input values\nclass RU_DataViewSuggestedActionBlock extends RU_DataView {\n    constructor() {\n        super();\n\n        this.opt = {\n            \n        };\n\n        let parent_this = this;\n        this.dvsa_clickable = new class extends Clickable {\n            constructor() {\n                super();\n            }\n\n            is_inside(pos) {\n                if(parent_this.topleft == null) return false;\n                return (parent_this.topleft.x < pos.x && pos.x < parent_this.topleft.x + parent_this.size.x) && (parent_this.topleft.y < pos.y && pos.y < parent_this.topleft.y + parent_this.size.y);\n            }\n\n            getButtonIndex(pos) {\n                // Wrapper to look up the index\n                let tl_x = parent_this.topleft.x;\n                let tl_y = parent_this.topleft.y;\n\n                let size_x = parent_this.size.x;\n                let size_y = parent_this.size.y;\n\n                let hp = parent_this.heightpadding;\n\n                let local_pos = {x: pos.x - tl_x, y: pos.y - tl_y};\n\n                if(local_pos.x < 0 || local_pos.x > size_x) return -1;\n                if(local_pos.y < 0 || local_pos.y > size_y) return -1;\n\n                // We can just divide through ellipseheight (approximated by a rect) + heightpadding\n                let eachheight = parent_this.textheight + parent_this.heightpadding;\n\n                let index = Math.floor(local_pos.y / eachheight);\n\n                return index;\n            }\n\n            onUpdateMove(pos) {\n                if(!this.enable_func()) return false;\n                if(!this.is_inside(pos))\n                {\n                    parent_this.dvsa_button_hovered = -1;\n                    return false;\n                }\n                \n                let index = this.getButtonIndex(pos);\n                // Pass to parent\n                parent_this.buttonHovered(index);\n\n                // No children here\n                return true;\n            }\n\n            onUpdateClick(pos) {\n                if(!this.enable_func()) return false;\n                if(!this.is_inside(pos))\n                    return false;\n                \n                return true;\n            }\n        };\n\n        this.hints = {}; // Dict of condition => hint text\n\n        this.dvsab_cached_data = [];\n\n        this.heightpadding = 20;\n\n        //this.analyze() expected return value:\n        //list of condition strings that evaluated to 'true' (those will be displayed)\n    }\n\n    buttonHovered(index) {\n        this.dvsa_button_hovered = index;\n    }\n\n    setTitle(title) {\n        this.title = title;\n        return this;\n    }\n\n    setHint(cond, text) {\n        this.hints[cond] = text;\n        return this;\n    }\n\n    setOptions(opt) {\n        this.opt = opt;\n        return this;\n    }\n\n    setStringFormatter(func) {\n        this.stringformatter = func;\n    }\n\n    linkMouse(parent) {\n        parent.addChild(this.dvsa_clickable);\n        return this;\n    }\n\n    \n    draw(ctx, datablock, scale) {\n\n        if(this.update_data)\n        {\n            this.dvsab_cached_data = this.analyze(datablock);\n            ObjectHelper.assert(\"Data evaluated to undefined\", this.dvsab_cached_data != undefined);\n            this.update_data = false;\n        }\n\n        if(scale == 0.)\n            return; //Nothing to do if we are size 0\n        \n        ctx.save();\n\n\n        ctx.textAlign = \"center\";\n        ctx.textBaseline = \"middle\";\n        ctx.strokeStyle = \"black\";\n        ctx.lineWidth = 3;\n\n\n        ctx.font = Math.round(12 * scale).toString() + \"px sans-serif\";\n\n\n        let textheight = ctx.measureText(\"M\").width; // Approximate height by width\n        this.textheight = textheight;\n\n        let xpos = this.topleft.x + this.size.x / 2.0;\n        let ypos = this.topleft.y + textheight;\n\n        let i = 0;\n        for(let x of this.dvsab_cached_data) {\n            let display_text = this.hints[x];\n\n            ctx.beginPath();\n            if(i == this.dvsa_button_hovered) {\n                ctx.strokeStyle = \"red\";\n            }\n            else {\n                ctx.strokeStyle = \"black\";\n            }\n            ctx.fillText(display_text, xpos, ypos);\n            ctx.ellipse(xpos, ypos, this.size.x / 2.0, (textheight + this.heightpadding / 2.0) / 2.0, 0.0, 0.0, 2 * Math.PI);\n            ctx.stroke();\n\n\n            ypos += (textheight + this.heightpadding) * scale;\n            ++i;\n        }\n\n        \n        this.drawOverlay(ctx, scale);\n\n        ctx.restore();\n    }\n}\n\n\n// This is a text-based \"form-layout\"-style dataview\nclass RU_DataViewFormLayout extends RU_DataView {\n    constructor() {\n        super();\n    }\n\n    draw(ctx, datablock_in, scale) {\n\n        if(scale == 0.) return;\n\n        ctx.save();\n        ctx.beginPath();\n\n        // Transform to drawable\n        let datablock = this.analyze(datablock_in);\n\n\n        let fontsize = datablock.fontsize;\n        let form_entries = datablock.rows;\n\n        let padding = datablock.padding;\n\n        let realfontsize = Math.round(fontsize * scale);\n\n        ctx.font = realfontsize + \"px sans-serif\";\n\n        // Determine the max width of the left side\n        let name_width = max_func(form_entries.map(x => x.title), x => ctx.measureText(x + \": \").width);\n\n        let text_height = ctx.measureText('M').width;\n        let line_spacing = 10;\n\n        // Determine the length of the right side (to allow for alignment)\n        let val_width = max_func(form_entries.map(x => x.val), x => ctx.measureText(x).width);\n\n        let i = 0;\n        for(let line of form_entries) {\n            let name = line.title;\n            let val = line.value;\n\n            // Draw title\n            ctx.beginPath();\n            ctx.textAlign = \"left\";\n            ctx.fillText(name, this.topleft.x + padding.left * scale, this.topleft.y + padding.top + (i+1) * (text_height + line_spacing));\n\n            // Align the text on the right side\n            ctx.beginPath();\n            ctx.textAlign = \"right\";\n            // Draw value\n            ctx.fillText(val, this.topleft.x + (this.size.x - padding.right) * scale, this.topleft.y + padding.top + (i+1) * (text_height + line_spacing));\n\n            i++;\n        }\n        ctx.restore();\n    }\n}\n\nclass Bracket extends Clickable {\n    constructor(ctx) {\n        super();\n        this.ctx = ctx;\n        this.buttons = [];\n\n        this.start = new Pos(0, 0);\n        this.end = new Pos(0, 0);\n        this.offset = 0;\n        this.startoffset = 0;\n\n        this.listeners = [];\n\n        this.button_alpha = 1.;\n        this.bracket_alpha = 1.;\n    }\n\n    hide() {\n        this.button_alpha = 0.;\n        this.bracket_alpha = 0.;\n    }\n\n    show(opacity = 1.0) {\n        this.button_alpha = opacity;\n        this.bracket_alpha = opacity;\n    }\n\n    setupEventListeners(canvas_draw_mgr=undefined) {\n        let canvas = this.ctx.canvas;\n\n        let mouseXtrans = x => x;\n        let mouseYtrans = y => y;\n\n        if(window.get_zoom != undefined) {\n            mouseXtrans = x => x / window.get_zoom();\n            mouseYtrans = y => y / window.get_zoom();\n        }\n\n        if(canvas_draw_mgr != undefined) {\n            mouseXtrans = x => canvas_draw_mgr.mapPixelToCoordsX(x);\n            mouseYtrans = y => canvas_draw_mgr.mapPixelToCoordsY(y);\n        }\n\n        let mm_lis = e => {\n            this.onUpdateMove(new Pos(mouseXtrans(e.offsetX), mouseYtrans(e.offsetY)));\n        };\n        let c_lis = e => {\n            this.onUpdateClick(new Pos(mouseXtrans(e.offsetX), mouseYtrans(e.offsetY)), e.button);\n        };\n        let dc_lis = e => {\n            this.onUpdateDoubleClick(new Pos(mouseXtrans(e.offsetX), mouseYtrans(e.offsetY)), e.button);\n        };\n\n        // Add all event listeners to an array (this allows for easier un-setting)\n        this.listeners.push(['mousemove', mm_lis]);\n        this.listeners.push(['click', c_lis]);\n        this.listeners.push(['dblclick', dc_lis]);\n\n        let ctx = this.ctx;\n        for(let lis of this.listeners) {\n            ctx.canvas.addEventListener(...lis);\n        }\n    }\n\n    destroy() {\n        super.destroy();\n\n        for(let lis of this.listeners) {\n            this.ctx.canvas.removeEventListener(...lis);\n        }\n\n        this.buttons = null;\n        this.start = null;\n        this.end = null;\n        this.ctx = null;\n    }\n\n    drawEx(start, end, offset, startoffset, animate, updatefunc) {\n        this.start = start;\n        this.end = end;\n        this.offset = offset;\n        this.startoffset = startoffset;\n        this.animate = animate;\n        this.updatefunc = updatefunc;\n\n        this.draw();\n    }\n\n    is_inside_buttons(pos) {\n        if(this.button_alpha == 0.) {\n            // Hidden buttons should not be clickable\n            return false;\n        }\n\n        let max_x = 0;\n        let max_y = 0;\n\n        for (let b of this.buttons) {\n            if(b == undefined) {\n                console.log(\"Undefined button!\");\n            }\n            else if(b.topleft == undefined) {\n                console.log(\"Undefined topleft\");\n            }\n            max_x = Math.max(b.topleft.x + b.size.x, max_x);\n            max_y = Math.max(b.topleft.y + b.size.y, max_y);\n        }\n\n        if (pos.inRect(this.start, new Pos(max_x, max_y))) {\n            return true;\n        }\n\n        return false;\n    }\n\n    bracket_clicked() {\n        if(this.button_alpha == 0.0) {\n            this.button_alpha = 1.0;\n        }\n        else {\n            this.button_alpha = 0.0;\n        }\n    }\n\n    is_inside_bracket(pos) {\n        const tol = 5;\n        if(pos.x < this.start.x + this.startoffset - tol || pos.x > this.start.x + this.offset + tol) {\n            return false;\n        }\n        if(pos.y < this.start.y - tol || pos.y > this.end.y + tol) {\n            console.log(\"outside y\");\n            return false;\n        }\n        \n        return true;\n    }\n\n    is_inside(pos) {\n        return this.is_inside_buttons(pos);\n    }\n\n    onUpdateClick(pos, mb) {\n        if(this.is_inside_bracket(pos, mb)) {\n            this.bracket_clicked();\n            return true;\n        }\n\n        if(this.button_alpha == 0.0) {\n            // Buttons are hidden, don't process events on them\n            return false;\n        }\n\n        return super.onUpdateClick(pos, mb);\n    }\n\n    onUpdateDoubleClick(pos, mb) {\n        if(this.is_inside_bracket(pos, mb)) {\n            this.bracket_clicked();\n            return true;\n        }\n\n        if(this.button_alpha == 0.0) {\n            // Buttons are hidden, don't process events on them\n            return false;\n        }\n\n        return super.onUpdateDoubleClick(pos, mb);\n    }\n\n    draw() {\n        let start = this.start;\n        let end = this.end;\n        let offset = this.offset;\n        let startoffset = this.startoffset;\n        let ctx = this.ctx;\n\n        if(this.animate && this.updatefunc == null)\n            ctx.clearRect(0, 0, ctx.canvas.width, ctx.canvas.height);\n\n        let button_offset = 20;\n\n        ctx.save();\n        ctx.beginPath();\n        ctx.lineWidth = 5;\n        ctx.strokeStyle = \"rgba(0,0,255,\" + this.bracket_alpha.toString() + \")\";\n        ctx.moveTo(start.x + startoffset, start.y);\n\n        ctx.lineTo(start.x + offset, start.y);\n        ctx.stroke();\n\n        ctx.lineTo(start.x + offset, end.y);\n        ctx.stroke();\n\n        ctx.lineTo(end.x + startoffset, end.y);\n        ctx.stroke();\n\n        ctx.restore();\n\n        let oldalpha = ctx.globalAlpha;\n        ctx.globalAlpha = this.button_alpha;\n\n        if(this.button_alpha > 0.0) {\n            // only draw if it is visible to humans.\n            this.drawButtons(new Pos(start.x + offset + button_offset, start.y));\n        }\n\n        ctx.globalAlpha = oldalpha;\n\n\n        if(this.animate) {\n            let _this = this;\n\n            \n            window.requestAnimationFrame(() => {\n                if(this.updatefunc == null) {\n                    _this.draw();\n                }\n                else {\n                    this.updatefunc();\n                }\n            });\n        }\n    }\n\n    drawButtons(startpos) {\n        let xpos = startpos.x;\n        let ypos = startpos.y;\n\n        startpos = null;\n\n        let size = 30;\n        let b;\n        let yoffset = 0;\n        for (b of this.buttons) {\n            let tl = new Pos(xpos, ypos);\n            let tl_higher = new Pos(xpos, ypos + yoffset); // Slightly offset position to avoid collisions\n\n            let tlsel = tl;\n            if(b.button_subwindow_state == \"open\") {\n                // Select the offset position (so that the buttons / windows don't overlap)\n                yoffset -= size + 5;\n            }\n            tlsel = tl_higher;\n            b.draw(tlsel, new Pos(size, size), this.ctx);\n            xpos += size + 10;\n        }\n    }\n\n    addButton(b) {\n        this.buttons.push(b);\n        this.addChild(b);\n    }\n\n};\n\nvar _canvas_manager_counter = 0;\n\n// Class to manage drawing of all resources. This ensures that one object \n// does not overwrite another by mistake.\nclass CanvasDrawManager {\n    static counter() {\n        return _canvas_manager_counter++;\n    }\n    constructor(ctx, ref_global_state) {\n        this.ctx = ctx;\n        this.anim_id = null;\n        this.drawables = [];\n        this.ref_global_state = ref_global_state;\n        this.indices = [];\n\n        this.request_scale = false;\n        this.scale_factor = {x: 1, y: 1};\n        this.last_scale_factor = {x: 1, y: 1};\n        \n        this._destroying = false;\n\n        this.scale_origin = {x: 0, y: 0};\n\n        this.contention = 0;\n\n        this._svg = document.createElementNS(\"http://www.w3.org/2000/svg\",'svg');\n\n        this.user_transform = this._svg.createSVGMatrix();\n\n        this.addCtxTransformTracking();\n    }\n\n    svgPoint(x, y) {\n        let pt  = this._svg.createSVGPoint();\n        pt.x=x; pt.y=y;\n        return pt;\n    }\n\n    applyUserTransform() {\n        let ut = this.user_transform;\n        this.ctx.setTransform(ut.a, ut.b, ut.c, ut.d, ut.e, ut.f);\n    }\n\n    get translation() {\n        return { x: this.user_transform.e, y: this.user_transform.f };\n    }\n\n    addCtxTransformTracking() {\n        /* This function is a hack to provide the non-standardized functionality\n        of getting the current transform from a RenderingContext.\n        When (if) this is standardized, the standard should be used instead.\n        This is made for \"easy\" transforms and does not support saving/restoring\n        */\n\n        let svg = document.createElementNS(\"http://www.w3.org/2000/svg\",'svg');\n        this.ctx._custom_transform_matrix = svg.createSVGMatrix();\n        // Save/Restore is not supported.\n\n        let checker = () => {\n            console.assert(!isNaN(this.ctx._custom_transform_matrix.f));\n        };\n        let _ctx = this.ctx;\n        let scale_func = _ctx.scale;\n        _ctx.scale = function(sx,sy) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.scaleNonUniform(sx,sy);\n            checker();\n            return scale_func.call(_ctx, sx, sy);\n        };\n        let translate_func = _ctx.translate;\n        _ctx.translate = function(sx,sy) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.translate(sx,sy);\n            checker();\n            return translate_func.call(_ctx, sx, sy);\n        };\n        let rotate_func = _ctx.rotate;\n        _ctx.rotate = function(r) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.rotate(r * 180.0 / Math.PI);\n            checker();\n            return rotate_func.call(_ctx, r);\n        };\n        let transform_func = _ctx.scale;\n        _ctx.transform = function(a,b,c,d,e,f){\n            let m2 = svg.createSVGMatrix();\n            m2.a=a; m2.b=b; m2.c=c; m2.d=d; m2.e=e; m2.f=f;\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.multiply(m2);\n            checker();\n            return transform_func.call(_ctx,a,b,c,d,e,f);\n        };\n\n        let setTransform_func = _ctx.setTransform;\n        _ctx.setTransform = function(a,b,c,d,e,f){\n            _ctx._custom_transform_matrix.a = a;\n            _ctx._custom_transform_matrix.b = b;\n            _ctx._custom_transform_matrix.c = c;\n            _ctx._custom_transform_matrix.d = d;\n            _ctx._custom_transform_matrix.e = e;\n            _ctx._custom_transform_matrix.f = f;\n            checker();\n            return setTransform_func.call(_ctx,a,b,c,d,e,f);\n        };\n        \n        _ctx.custom_inverseTransformMultiply = function(x,y){\n            let pt  = svg.createSVGPoint();\n            pt.x=x; pt.y=y;\n            checker();\n            return pt.matrixTransform(_ctx._custom_transform_matrix.inverse());\n        }\n    }\n\n    destroy() {\n        this._destroying = true;\n        this.clearDrawables();\n    }\n\n    addDrawable(obj) {\n        this.drawables.push(obj);\n        this.indices.push({\"c\": CanvasDrawManager.counter(), \"d\": obj});\n    }\n\n    removeDrawable(drawable) {\n        this.drawables = this.drawables.filter(x => x != drawable);\n    }\n\n    clearDrawables() {\n        for(let x of this.drawables) {\n            x.destroy();\n        }\n        this.drawables = [];\n        this.indices = [];\n    }\n\n    scale(diff, x=0, y=0) {\n        \n        if(this.request_scale || Math.abs(diff) < 0.0001 || this.contention > 0) {\n            console.log(\"Blocking potential race\");\n            return;\n        }\n        this.contention++;\n        this.request_scale = true;\n\n        this.scale_origin.x = x;\n        this.scale_origin.y = y;\n        this.scale_factor.x += diff;\n        this.scale_factor.y += diff;\n        \n        this.scale_factor.x = Math.max(0.001, this.scale_factor.x);\n        this.scale_factor.y = Math.max(0.001, this.scale_factor.y);\n        {\n            let sv = diff < 0 ? 0.9 : 1.1;\n            let pt = this.svgPoint(this.scale_origin.x, this.scale_origin.y).matrixTransform(this.user_transform.inverse());\n            this.user_transform = this.user_transform.translate(pt.x, pt.y);\n            this.user_transform = this.user_transform.scale(sv, sv, 1, 0, 0, 0);\n            this.user_transform = this.user_transform.translate(-pt.x, -pt.y);\n        }\n        this.contention--;\n    }\n\n    translate(x, y) {\n        this.user_transform = this.user_transform.translate(x / this.user_transform.a, y / this.user_transform.d);\n    }\n\n    mapPixelToCoordsX(xpos) {\n        return this.svgPoint(xpos, 0).matrixTransform(this.user_transform.inverse()).x;\n    }\n\n    mapPixelToCoordsY(ypos) {\n        return this.svgPoint(0, ypos).matrixTransform(this.user_transform.inverse()).y;\n    }\n\n    getScale() {\n        ObjectHelper.assert(\"Uniform scale\", this.scale_factor.x == this.scale_factor.y);\n        return this.noJitter(this.scale_factor.x); // We don't allow non-uniform scaling.\n    }\n\n    getLastScale() {\n        return this.noJitter(this.last_scale_factor.x); // We don't allow non-uniform scaling.\n    }\n\n    noJitter(x) {\n        x = parseFloat(x.toFixed(3));\n        x = Math.round(x * 100) / 100;\n        return x;\n    }\n\n\n    draw() {\n        if(this._destroying) {\n            return;\n        }\n        if(this.contention > 0) return;\n        this.contention += 1;\n        let ctx = this.ctx;\n\n        // Clear with default transform\n        ctx.save();\n        ctx.setTransform(1, 0, 0, 1, 0, 0);\n        ctx.clearRect(0, 0, ctx.canvas.width, ctx.canvas.height);\n        ctx.restore();\n\n        let mx = 0;\n        let my = 0;\n        if(this.request_scale && this.contention == 1) {\n            \n            mx = this.mapPixelToCoordsX(this.scale_origin.x);\n            my = this.mapPixelToCoordsY(this.scale_origin.y);\n\n            // Reset the translation\n            this.applyUserTransform();\n            this.request_scale = false;\n        }\n        else\n        {\n            mx = this.mapPixelToCoordsX(this.scale_origin.x);\n            my = this.mapPixelToCoordsY(this.scale_origin.y);\n            \n            \n        }\n        this.applyUserTransform();\n            \n        \n\n        this.ref_global_state.drawSDFG();\n        for(let d of this.drawables) {\n            d.draw();\n        }\n\n        if(false) // Comment this line to show debug values at cursor position\n        {\n            ctx.fillText(\"(\" + mx.toFixed(1) + \"|\" + my.toFixed(1) + \")\",  mx, my);\n            ctx.fillText(\"(\" + this.translation.x.toFixed(1) + \"|\" + this.translation.y.toFixed(1) + \")\",  mx, my + 10);\n            ctx.fillText(\"s:\" + this.getScale().toFixed(1),  mx, my + 20);\n        }\n        this.contention -= 1;\n    }\n\n    draw_async() {\n        let _this = this;\n        this.anim_id = window.requestAnimationFrame(() => _this.draw());\n    }\n}\n\nexport { CanvasDrawManager, Bracket, Button, Layout, Pos, min_func, max_func, max_func_obj,\nRU_DataView, RU_DataViewBarGraph, RU_DataViewFormLayout, RU_DataViewNumberBlock, RU_DataViewSuggestedActionBlock, RU_DataViewText,\ncreateImageDownload, DataBlock };\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport {ObjectHelper} from \"./datahelper.js\"\n// Contains resources used to provide a \"native\" multi-window interface\n\n// Class to create the window on the parent side\nclass DiodeWindow {\n    constructor(parent) {\n        this.parent = parent;\n        this.window = null;\n\n        this.message_userdef = null;\n\n        this._msg_func = x => this.message(x);\n        this.parent.addEventListener('message', this._msg_func);\n    }\n\n    open(url = '', target = '', features = '', replace = false) {\n        this.window = parent.open(url, target, features + \"width=800,height=600\", replace);\n\n        if(!this.window) return this.window; // some error occurred\n\n        return this.window;\n    }\n\n    setCallback(x) {\n        this.message_userdef = x;\n    }\n\n    passMessage(msg_obj) {\n        return this.window.postMessage(msg_obj, \"*\");\n    }\n\n    reply(win, origin, msg_obj) {\n        if(win != this.window && this.window != null) {\n            console.log(\"We do not talk to strangers\");\n        }\n        return this.passMessage(msg_obj);\n    }\n\n    setSenderData(data) {\n        this.window_data = data;\n    }\n\n    destroy() {\n        this.parent.removeEventListener('message', this._msg_func)\n    }\n\n    serialize_dataview(dv) {\n        return dv.getSendableObject();\n    }\n\n    serialize_array(arr) {\n        let ret = [];\n        for(let x of arr) {\n            ret.push(this.serialize(x));\n        }\n        return ret;\n    }\n    \n    serialize_function(func) {\n        return func.toString();\n    }\n\n    serialize_default(def) {\n        if(def == undefined) {\n            return \"\";\n        }\n        let ret = {};\n        let keys = ObjectHelper.listKeys(def);\n        for(let x of keys) {\n            let val = def[x];\n\n            ret[x] = this.serialize(val);\n        }\n\n        return ret;\n    }\n\n\n\n    serialize(obj) {\n        if(obj instanceof RU_DataView) {\n            return this.serialize_dataview(obj);\n        }\n        else if(obj instanceof Array) {\n            return this.serialize_array(obj);\n        }\n        else if(obj instanceof Object)\n            return this.serialize_default(obj);\n        else if(typeof obj == \"function\")\n            return this.serialize_function(obj);\n        else\n            return obj;\n    }\n\n    message(event) {\n        let _data = event.data;\n        if(event.source != this.window) {\n            return; \n        }\n\n        if(_data.type == \"ClientOpened\") {\n            // Respond with the data\n           \n            if(this.message_userdef == null) {\n                let answer = {\n                    type: \"DisplayData\",\n                    data: this.window_data\n                };\n                this.reply(event.source, event.origin, answer);\n            }\n            else {\n                // Pass to custom function.\n                this.message_userdef(_data);\n            }\n        }\n        else if(_data.type == \"close\") {\n            console.log(\"Parent received close message\");\n            this.window.close();\n            this.destroy();\n        }\n        else if(this.message_userdef != null) {\n            // Custom callback method.\n\n            \n            this.message_userdef(_data);\n        }\n        else {\n            console.log(\"Unknown type \" + JSON.stringify(_data));\n        }\n    }\n\n}\n\n\n// Class managing the client side\nclass ClientSide {\n    constructor(thiswindow, userfunc = null) {\n        this.thiswindow = thiswindow;\n\n        this.owner = thiswindow.opener;\n\n        this.thiswindow.addEventListener('message', x => this.message(x));\n\n        this.thiswindow.addEventListener('onbeforeunload', x => this.destroy(x));\n\n        this.subwindow = null;\n\n        this.message_userdef = userfunc;\n\n        this.passMessage({\n            type: \"ClientOpened\"\n        });\n    }\n\n    destroy(x) {\n        x.preventDefault();\n        x.returnValue = '';\n        console.log(\"Destroying client window\");\n    }\n\n    setCallback(x) {\n        this.message_userdef = x;\n    }\n\n    passMessage(msg_obj) {\n        return this.owner.postMessage(msg_obj, \"*\");\n    }\n\n    reply(win, origin, msg_obj) {\n        if(win != this.owner) {\n            return;\n        }\n        return this.passMessage(msg_obj);\n    }\n\n    // Reads the event coming from the parent window\n    message(event) {\n        \n        let data = event.data;\n\n        if(data.type == \"DisplayData\") {\n\n            let canvas = window.document.getElementById('subwindowcanvas');\n            if(!canvas) {\n                alert(\"Didn't find canvas!\");\n            }\n            let ctx = canvas.getContext('2d');\n            if(!ctx) {\n                alert(\"Didn't find context!\");\n            }\n            \n            let content = data.data;\n            let classname = content.className;\n            if(!classname) {\n                alert(\"Classname is not set!\");\n            }\n            let dataparams = content.dataParams;\n\n            let class_obj = null;\n            let loaded_module = null;\n            if(classname == \"ParallelizationButton\") {\n                loaded_module = import(\"./parallelization_button.js\").then(mod => {\n                    class_obj = mod.ParallelizationButton;\n                });\n            }\n            else if(classname == \"MemoryButton\") {\n                loaded_module = import(\"./memory_button.js\").then(mod => {\n                    class_obj = mod.MemoryButton;\n                });\n            }\n            else if(classname == \"VectorizationButton\") {\n                loaded_module = import(\"./vectorization_button.js\").then(mod => {\n                    class_obj = mod.VectorizationButton;\n                });\n            }\n            else if(classname == \"MemoryOpButton\") {\n                loaded_module = import(\"./memop_button.js\").then(mod => {\n                    class_obj = mod.MemoryOpButton;\n                });\n            }\n            else if(classname == \"CacheOpButton\") {\n                loaded_module = import(\"./cache_button.js\").then(mod => {\n                    class_obj = mod.CacheOpButton;\n                });\n            }\n            else {\n                ObjectHelper.assert(\"Missing definition\", false);\n            }\n            \n            \n\n            loaded_module.then(x =>\n            {\n                let new_obj = new class_obj(ctx, ...(dataparams));\n\n                if(!new_obj) {\n                    alert(\"Failed to instantiate class \" + classname);\n                }\n                let subwindow_width = new_obj.button_subwindow.targetwidth;\n                let subwindow_height = new_obj.button_subwindow.targetheight;\n                let subwindow_left = new_obj.topleft.x;\n                let subwindow_top = new_obj.topleft.y;\n\n                ctx.canvas.width = subwindow_width;\n                ctx.canvas.height = subwindow_height;\n\n                // The width is specified in outer-width. This code adjusts the differences accordingly.\n                // magic +10 (px): Avoid scrollbars\n                let diff_x = window.outerWidth - window.innerWidth + 10;\n                let diff_y = window.outerHeight - window.innerHeight + 10;\n                window.resizeTo(subwindow_width + diff_x, subwindow_height + diff_y);\n\n                new_obj.button_subwindow_state = 'open'; // Open Sesame\n                new_obj.is_locked_open = true;\n\n                import(\"./renderer_util.js\").then(mod => {\n                    let b = new mod.Bracket(ctx);\n                    b.setupEventListeners();\n                    b.addButton(new_obj);\n                    b.drawEx(new mod.Pos(-20, 0), new mod.Pos(0, 0), 0, 0, true);\n                });\n            });\n        }\n        else if(this.message_userdef != null) {\n            this.message_userdef(data);\n        }\n        else  {\n            console.log(\"Unknown event caught\");\n            ObjectHelper.logObject(\"message\", data);\n        }\n        \n    }\n}\n\nexport {DiodeWindow, ClientSide}\n","// Copyright 2019-2020 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { REST_request, FormBuilder, setup_drag_n_drop } from \"../main\";\nimport { Appearance } from \"./diode_appearance\";\nimport { SDFG_Parser } from \"../utils/sdfg/sdfg_parser\";\nimport { parse_sdfg, stringify_sdfg } from \"../utils/sdfg/json_serializer\";\nimport * as DiodeTables from \"./table\";\nimport { DIODE_Settings } from \"./diode_settings\";\nimport { DIODE_Project } from \"./diode_project\";\nconst { $ } = globalThis;\n\nexport class DIODE {\n    constructor() {\n        this._settings = new DIODE_Settings();\n        this._debouncing = {};\n\n        this._background_projects = [];\n        this._current_project = null;\n\n        this._stale_data_button = null;\n\n        this._shortcut_functions = {\n            /*\n            format:\n            key: {\n                .alt: Trigger if altKey is pressed\n                .ctrl: Trigger if ctrlKey is pressed\n                .function: Function to run\n                .state: Multi-key only: state in state machine\n                .expect: The state transitions (without the first state transition)\n            }\n            */\n        };\n\n        this._creation_counter = 0;\n\n        // Load a client_id\n        this._client_id = localStorage.getItem(\"diode_client_id\");\n        if (this._client_id == null) {\n            this._client_id = this.getPseudorandom();\n            localStorage.setItem(\"diode_client_id\", this._client_id);\n        }\n\n        // Initialize appearance\n        this._appearance = new Appearance(localStorage.getItem(\"DIODE/Appearance\"));\n        this._appearance.setOnChange(x => {\n            localStorage.setItem(\"DIODE/Appearance\", JSON.stringify(x.toStorable()))\n        });\n    }\n\n    setupEvents() {\n        this.goldenlayout.eventHub.on(this.project().eventString('-req-show_stale_data_button'), x => {\n            this.__impl_showStaleDataButton();\n        });\n        this.goldenlayout.eventHub.on(this.project().eventString('-req-remove_stale_data_button'), x => {\n            this.__impl_removeStaleDataButton();\n        });\n        this.goldenlayout.eventHub.on(this.project().eventString('-req-show_loading'), x => {\n            this.__impl_showIndeterminateLoading();\n        });\n        this.goldenlayout.eventHub.on(this.project().eventString('-req-hide_loading'), x => {\n            this.__impl_hideIndeterminateLoading();\n        });\n\n        // Install the hint mechanic on the whole window\n        window.addEventListener('contextmenu', ev => {\n            console.log(\"contextmenu requested on\", ev.target);\n\n            this.hint(ev);\n        });\n    }\n\n    getRunConfigs(name = undefined) {\n        let tmp = localStorage.getItem(\"diode_run_configs\");\n        if (tmp != null) {\n            tmp = JSON.parse(tmp);\n        } else {\n            // Create a default\n            tmp = [{\n                \"Configuration name\": \"default\",\n                \"Host\": \"localhost\",\n                \"Use SSH\": true,\n                \"SSH Key\": this.pubSSH(),\n                \"SSH Key override\": \"\",\n                \"Instrumentation\": \"off\",\n                \"Number of threads\": \"[0]\"\n            }];\n        }\n\n        if (name != undefined) {\n            const ret = tmp.filter(x => x['Configuration name'] == name);\n            if (ret.length == 0) {\n                // Error\n                console.error(\"Could not find a configuration with that name\", name);\n            } else {\n                return ret[0];\n            }\n        }\n        return tmp;\n    }\n\n    addToRunConfigs(config) {\n        delete config['SSH Key']; // Don't save large, unnecessary data\n        const existing = this.getRunConfigs();\n\n        let i = 0;\n        for (const x of existing) {\n            if (x['Configuration name'] == config['Configuration name']) {\n                // Replace\n                existing[i] = config;\n                break;\n            }\n            ++i;\n        }\n        if (i >= existing.length) {\n            existing.push(config);\n        }\n        existing.sort((a, b) => a['Configuration name'].localeCompare(b['Configuration name']));\n        localStorage.setItem(\"diode_run_configs\", JSON.stringify(existing));\n    }\n\n    setCurrentRunConfig(name) {\n        sessionStorage.setItem(\"diode_current_run_config\", name);\n    }\n\n    getCurrentRunConfigName() {\n        const tmp = sessionStorage.getItem(\"diode_current_run_config\");\n        if (tmp == null) {\n            return \"default\";\n        } else {\n            return tmp;\n        }\n    }\n\n    getCurrentRunConfig() {\n        const config = this.getRunConfigs(this.getCurrentRunConfigName());\n        return config;\n    }\n\n    applyCurrentRunConfig() {\n        const config = this.getCurrentRunConfig();\n\n        let new_settings = {};\n\n        new_settings = {\n            ...new_settings, ...{\n                \"execution/general/host\": config['Host']\n            }\n        };\n\n        // Apply the runconfig values to the dace config\n        if (config['Use SSH']) {\n\n\n            const keyfile_string = /\\S/.test(config['SSH Key override']) ? (\" -i \" + config['SSH Key override'] + \" \") : \" \";\n            new_settings = {\n                ...new_settings, ...{\n                    \"execution/general/execcmd\": (\"ssh -oBatchMode=yes\" + keyfile_string + \"${host} ${command}\"),\n                    \"execution/general/copycmd_r2l\": (\"scp -B\" + keyfile_string + \" ${host}:${srcfile} ${dstfile}\"),\n                    \"execution/general/copycmd_l2r\": (\"scp -B\" + keyfile_string + \" ${srcfile} ${host}:${dstfile}\"),\n                }\n            };\n        } else {\n            // Use standard / local commands\n            new_settings = {\n                ...new_settings, ...{\n                    \"execution/general/execcmd\": \"${command}\",\n                    \"execution/general/copycmd_r2l\": \"cp ${srcfile} ${dstfile}\",\n                    \"execution/general/copycmd_l2r\": \"cp ${srcfile} ${dstfile}\",\n                }\n            };\n        }\n\n        // Instrumentation settings are not to be applied here, but later when the run request is actually sent\n\n        const ret = new Promise((resolve, reject) => {\n            const post_params = {\n                client_id: this.getClientID(),\n                ...new_settings\n            };\n            REST_request(\"/dace/api/v1.0/preferences/set\", post_params, (xhr) => {\n                if (xhr.readyState === 4 && xhr.status === 200) {\n                    resolve(config);\n                } else if (xhr.status !== 0 && !(xhr.status + \"_\").startsWith(\"2\")) {\n                    reject();\n                }\n            });\n        });\n\n        return ret;\n    }\n\n    pubSSH() {\n        const cached = localStorage.getItem('diode_pubSSH');\n        if (cached != null) {\n            return cached;\n        }\n        REST_request(\"/dace/api/v1.0/getPubSSH/\", undefined, xhr => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n                const j = JSON.parse(xhr.response);\n                if (j.error == undefined) {\n                    const t = j.pubkey;\n                    localStorage.setItem('diode_pubSSH', t);\n                } else {\n                    alert(j.error);\n                }\n            }\n        }, 'GET');\n    }\n\n    static getHostList() {\n        const tmp = localStorage.getItem(\"diode_host_list\");\n        if (tmp == null) return ['localhost'];\n        else return JSON.parse(tmp);\n    }\n\n    static setHostList(list) {\n        localStorage.setItem(\"diode_host_list\", JSON.stringify(list));\n    }\n\n    hint(ev) {\n        /*\n            ev: Event triggering this hint.\n        */\n\n        const create_overlay = (_h, elem) => {\n            // Found hint data\n            const fulldata = JSON.parse(_h);\n\n            // #TODO: Link to documentation instead of using this placeholder\n            $(elem).w2overlay(\"<div><h2>Help for category \" + fulldata.type + \"</h2>\" + fulldata.name + \"</div>\");\n        };\n\n        const target = ev.target;\n        let _h = target.getAttribute(\"data-hint\");\n        if (_h == null) {\n            // Iterate chain\n            if (!ev.composed) return;\n            const x = ev.composedPath();\n            for (const e of x) {\n                if (e.getAttribute != undefined) {\n                    _h = e.getAttribute(\"data-hint\");\n                } else _h = null;\n\n                if (_h != null) {\n                    create_overlay(_h, e);\n                    ev.stopPropagation();\n                    ev.preventDefault();\n                    break;\n                }\n            }\n            return;\n        } else {\n            create_overlay(_h, target);\n            ev.stopPropagation();\n            ev.preventDefault();\n        }\n\n        console.log(\"Got hint data\", _h);\n\n    }\n\n    openUploader(purpose = \"\") {\n\n        w2popup.open({\n            title: \"Upload a code file\",\n            body: `\n<div class=\"w2ui-centered upload_flexbox\">\n    <label for=\"file-select\" style=\"flex-grow: 1\">\n        <div class=\"diode_uploader\" id='upload_box'>\n            <div class=\"uploader_text\">\n                Drop file here or click to select a file\n            </div>\n        </div>\n    </label>\n    <input id=\"file-select\" type=\"file\"  accept=\".py,.m,.sdfg\" style=\"position:absolute;\"/>\n</div>\n`,\n            buttons: '',\n            showMax: true\n        });\n        let x = $('#upload_box');\n        if (x.length == 0) {\n            throw \"Error: Element not available\";\n        }\n        x = x[0];\n\n        const file_handler = (data) => {\n            if (purpose == \"code-python\") {\n                this.newFile(data);\n            }\n        };\n\n        setup_drag_n_drop(x, (mime, data) => {\n            console.log(\"upload mime\", mime);\n\n            file_handler(data);\n\n            // Close the popup\n            w2popup.close();\n        }, null, {\n            readMode: \"text\"\n        });\n\n        let fuploader = $('#file-select');\n        if (fuploader.length == 0) {\n            throw \"Error: Element not available\";\n        }\n        fuploader = fuploader[0];\n\n        fuploader.style.opacity = 0;\n\n        fuploader.addEventListener(\"change\", x => {\n            const file = fuploader.files[0];\n\n            const reader = new FileReader();\n            reader.onload = y => {\n                file_handler(y.target.result);\n                // Close the popup\n                w2popup.close();\n            };\n            reader.readAsText(file);\n        });\n    }\n\n    getClientID() {\n        return this._client_id;\n    }\n\n    static hash(data) {\n        return btoa(crypto.subtle.digest('SHA-256', Uint8Array.from(data)));\n    }\n\n\n    initEnums() {\n        this.getEnum(\"ScheduleType\");\n        this.getEnum(\"StorageType\");\n        this.getEnum(\"AccessType\");\n        this.getEnum(\"Language\");\n    }\n\n    // Closes all open windows\n    closeAll() {\n        if (!this.goldenlayout.root)\n            return;\n        const comps = this.goldenlayout.root.getItemsByFilter(x => x.config.type == \"component\");\n        comps.forEach((comp) => comp.close());\n        this.project().clearClosedWindowsList();\n    }\n\n    addContentItem(config) {\n        // Remove all saved instances of this component type from the closed windows list\n        if (config.componentName) {\n            const cw = this.project()._closed_windows;\n            this.project().setClosedWindowsList(cw.filter(x => x[0] != config.componentName));\n        }\n\n        const root = this.goldenlayout.root;\n\n        // In case goldenlayout was not yet initialized, fail silently\n        if (!root)\n            return;\n\n        if (root.contentItems.length === 0) {\n            // Layout is completely missing, need to add one (row in this case)\n            const layout_config = {\n                type: 'row',\n                content: []\n            };\n            root.addChild(layout_config);\n\n            // retry with recursion\n            this.addContentItem(config);\n        } else {\n            if (this.goldenlayout.isSubWindow) {\n                // Subwindows don't usually have layouts, so send a request that only the main window should answer\n                this.goldenlayout.eventHub.emit('create-window-in-main', JSON.stringify(config));\n            } else {\n                for (const ci of root.contentItems) {\n                    if (ci.config.type != \"stack\") {\n                        ci.addChild(config);\n                        return;\n                    }\n\n                }\n                const copy = root.contentItems[0].contentItems.map(x => x.config);\n                root.contentItems[0].remove();\n                // retry with recursion\n                for (const ci of copy) {\n                    this.addContentItem(ci);\n                }\n                this.addContentItem(config);\n                //root.contentItems[0].addChild(config);\n            }\n        }\n    }\n\n    newFile(content = \"\") {\n        // Reset project state\n        this.closeAll();\n        this.createNewProject();\n\n        const millis = this.getPseudorandom();\n\n        // Assuming SDFG files start with {\n        if (content[0] == '{') {\n            // Prettify JSON object, if not pretty\n            if (content.split('\\n').length == 1)\n                content = JSON.stringify(JSON.parse(content), null, 2);\n        }\n\n\n        const config = {\n            title: \"Source Code\",\n            type: 'component',\n            componentName: 'CodeInComponent',\n            componentState: { created: millis, code_content: content }\n        };\n\n        this.addContentItem(config);\n\n        // Compile automatically after loading\n        this.gatherProjectElementsAndCompile(this, {}, { sdfg_over_code: true });\n    }\n\n    open_diode_settings() {\n        const millis = this.getPseudorandom();\n\n        const config = {\n            title: \"Settings\",\n            type: 'component',\n            componentName: 'SettingsComponent',\n            componentState: { created: millis }\n        };\n\n        this.addContentItem(config);\n    }\n\n    open_runqueue() {\n        const millis = this.getPseudorandom();\n\n        const config = {\n            title: \"Run Queue\",\n            type: 'component',\n            componentName: 'RunqueueComponent',\n            componentState: { created: millis }\n        };\n\n        this.addContentItem(config);\n    }\n\n    getEnum(name) {\n        const cached = localStorage.getItem('Enumeration:' + name);\n        if (cached == null || cached == undefined) {\n            // Request the enumeration from the server\n\n            REST_request(\"/dace/api/v1.0/getEnum/\" + name, undefined, xhr => {\n                if (xhr.readyState === 4 && xhr.status === 200) {\n                    console.log(name, xhr.response);\n                    const tmp = JSON.parse(xhr.response);\n                    if (name == \"Language\") {\n                        tmp.enum.push(\"NoCode\");\n                    }\n                    localStorage.setItem('Enumeration:' + name, JSON.stringify(tmp));\n                }\n            }, 'GET');\n\n            return null;\n        }\n\n        return JSON.parse(cached)['enum'];\n    }\n\n    renderProperties(transthis, node, params, parent, options = undefined) {\n        /*\n            Creates property visualizations in a 2-column table.\n        */\n        if (params == null) {\n            console.warn(\"renderProperties as nothing to render\");\n            return;\n        }\n        if (!Array.isArray(params)) {\n            const realparams = params;\n\n            // Format is different (diode to_json with seperate meta / value - fix before passing to renderer)\n            let params_keys = Object.keys(params).filter(x => !x.startsWith('_meta_'));\n            params_keys = params_keys.filter(x => Object.keys(params).includes('_meta_' + x));\n\n            const _lst = params_keys.map(x => {\n                const mx = JSON.parse(JSON.stringify(params['_meta_' + x]));\n\n                mx.name = x;\n                mx.value = params[x];\n\n                return { property: mx, category: mx.category, element: realparams, data: node.data };\n            });\n\n            params = _lst;\n        }\n\n        if (typeof (transthis) == 'string') {\n            // Event-based\n            const target_name = transthis;\n            transthis = {\n                propertyChanged: (element, name, value) => {\n                    // Modify in SDFG object first\n                    this.project().request(['property-changed-' + target_name], x => {\n\n                    }, {\n                        timeout: 200,\n                        params: {\n                            element: element,\n                            name: name,\n                            value: value,\n                            type: options ? options.type : options\n                        }\n                    });\n\n                    // No need to refresh SDFG if transformation\n                    if (options && options.type === 'transformation')\n                        return;\n\n                    this.refreshSDFG();\n                },\n                applyTransformation: () => {\n                    this.project().request(['apply-adv-transformation-' + target_name], x => {\n\n                    }, {\n                        timeout: 200,\n                        params: options == undefined ? undefined : options.apply_params\n                    })\n                },\n                locateTransformation: (opt_name, opt_pos, affects) => {\n                    this.project().request(['locate-transformation-' + options.sdfg_name], x => {\n\n                    }, {\n                        timeout: 200,\n                        params: JSON.stringify([opt_name, opt_pos, affects]),\n                    })\n                },\n                project: () => this.project()\n            };\n        }\n        const dt = new DiodeTables.Table();\n        let cur_dt = dt;\n\n        let dtc = null;\n        const categories = {};\n        for (const x of params) {\n\n            const cat = x.category;\n            if (categories[cat] == undefined) {\n                categories[cat] = [];\n            }\n            categories[cat].push(x);\n        }\n        if (!DIODE.debugDevMode()) {\n            delete categories[\"(Debug)\"]\n        }\n        for (const z of Object.entries(categories)) {\n\n            // Sort within category\n            const cat_name = z[0];\n            const y = z[1].sort((a, b) => a.property.name.localeCompare(b.property.name));\n\n\n            // Add Category header\n            cur_dt = dt;\n            const sp = document.createElement('span');\n            sp.innerText = cat_name;\n            const tr = cur_dt.addRow(sp);\n            tr.childNodes[0].colSpan = \"2\";\n\n            dtc = new DiodeTables.TableCategory(cur_dt, tr);\n\n            for (const propx of y) {\n                const title_part = document.createElement(\"span\");\n                const x = propx.property;\n                title_part.innerText = x.name;\n                title_part.title = x.desc;\n                const value_part = diode.getMatchingInput(transthis, x, propx);\n                const cr = cur_dt.addRow(title_part, value_part);\n                if (dtc != null) {\n                    dtc.addContentRow(cr);\n                }\n            }\n        }\n        dt.setCSSClass(\"diode_property_table\");\n\n        if (options && options.type == \"transformation\") {\n            // Append a title\n            const title = document.createElement(\"span\");\n            title.classList = \"\";\n            title.innerText = options.opt_name;\n            parent.appendChild(title);\n\n            // Append a \"locate\" button\n            const locate_button = document.createElement(\"span\");\n            locate_button.innerText = \"location_on\";\n            locate_button.classList = \"material-icons\";\n            locate_button.style = \"cursor: pointer;\";\n\n            locate_button.addEventListener(\"click\", () => {\n                // Highlight the affected elements (both transformation and nodes)\n                transthis.locateTransformation(options.opt_name, options.pos, options.apply_params[0].affects);\n            });\n            parent.appendChild(locate_button);\n        }\n        dt.createIn(parent);\n        if (options && options.type == \"transformation\") {\n            // Append an 'apply-transformation' button\n            const button = document.createElement('button');\n            button.innerText = \"Apply advanced transformation\";\n            button.addEventListener('click', _x => {\n                button.disabled = true;\n                this.project().request(['apply-adv-transformation-' + options.sdfg_name], _y => {\n                }, {\n                    params: JSON.stringify(options.apply_params)\n                });\n            });\n            parent.appendChild(button);\n\n        }\n    }\n\n    create_visual_access_representation(elems, data) {\n\n        const __access_indices = elems[0];\n        const __ranges = elems[1];\n        const __user_input = elems[2];\n        const __additional_defines = {};\n\n        // Add standard functions\n        __additional_defines['Min'] = \"(...x) => Math.min(...x)\";\n        __additional_defines['int_ceil'] = \"(a,b) => Math.ceil(a/b)\";\n\n        for (const x of __user_input) {\n            const _r = window.prompt(\"Enter a value for symbol \" + x);\n            if (_r != null) {\n\n                // Write the value \n                __additional_defines[x] = _r;\n            } else {\n                // Aborted\n                break;\n            }\n        }\n\n        // Read the data object properties\n        console.log(\"data\", data);\n        if (data.type != \"Array\") {\n            console.warn(\"Non-Array accessed\", data);\n            // #TODO: What to do here?\n        }\n        let __mem_dims = data.attributes.shape;\n        console.assert(__mem_dims != undefined);\n        // Try to eval the functions\n        const __eval_func = () => {\n            const __defs = Object.keys(__additional_defines).map(x => \"let \" + x + \" = \" + __additional_defines[x]).join(\";\") + \";\";\n            __mem_dims = __mem_dims.map(x => eval(__defs + x));\n        };\n        __eval_func();\n\n\n        const __tbl_container = document.createElement(\"div\");\n        const __tbl_hor = document.createElement(\"div\");\n        __tbl_hor.classList = \"flex_row\";\n        __tbl_hor.style = \"flex-wrap: nowrap; justify-content: flex-start;\";\n        const __axis_x_info = document.createElement(\"div\");\n        {\n            __axis_x_info.classList = \"flex_row\";\n            __axis_x_info.style = \"justify-content: space-between;\";\n\n\n            for (let __i = 0; __i < 2; ++__i) {\n                const __tmp = document.createElement(\"div\");\n                // Take the second dimension\n                try {\n                    __tmp.innerText = (__i == 0) ? \"0\" : __mem_dims[1];\n                } catch (__e) {\n                    __tmp.innerText = (__i == 0) ? \"Start\" : \"End\";\n                }\n                __axis_x_info.appendChild(__tmp);\n            }\n        }\n\n        const __axis_y_info = document.createElement(\"div\");\n        {\n            __axis_y_info.classList = \"flex_column\";\n            __axis_y_info.style = \"justify-content: space-between;\";\n\n\n            for (let __i = 0; __i < 2; ++__i) {\n                const __tmp = document.createElement(\"div\");\n                // Take the first dimension\n                try {\n                    __tmp.innerText = (__i == 0) ? \"0\" : __mem_dims[0];\n                } catch (__e) {\n                    __tmp.innerText = (__i == 0) ? \"Start\" : \"End\";\n                }\n                __axis_y_info.appendChild(__tmp);\n            }\n        }\n\n        const __tbl_vert = document.createElement(\"div\");\n        __tbl_vert.classList = \"flex_col\";\n        if (data != null) {\n            __tbl_vert.appendChild(__axis_x_info);\n            __tbl_hor.appendChild(__axis_y_info);\n        }\n        // Now create a table with the according cells for this\n        let __size = 10;\n        if (__mem_dims.some(x => x > 128)) __size = 5;\n\n        if (__mem_dims.length < 2) __mem_dims.push(1); // Force at least 2 dimensions (2nd dim size is trivial: 1)\n\n        console.log(\"access indices\", __access_indices);\n        console.log(\"ranges\", __ranges);\n\n        // This is very limited; future work can take place here\n        // The current implementation works only by fixing all but one range per dimension.\n        // This is done for 2 main reasons:\n        // 1) Performance. It is not possible to determine the access patterns in O(n) without either using an LSE\n        //        with range side conditions (which is hard to solve in \"naked\" JS). The only alternative is to actually\n        //        scan __all__ possible values, which is infeasible on a browser client.\n        // 2) Visual Cluttering. Seeing too much at once is not helpful. Implementing an easy-to-use UI solving this problem\n        //        is beyond the scope of the initial PoC.\n\n        // Obtain fixed ranges (all but smallest)\n        const __fixed_rngs = __ranges.map(x => x).sort((a, b) => a.depth - b.depth).slice(1).reverse();\n        // Get the variable range (smallest)\n        const __var_rng = __ranges[0];\n\n        const __rng_inputs = [];\n\n        let __create_func = () => null;\n\n        const __main = x => x.main != undefined ? x.main : x;\n        // Add inputs for every fixed range\n        {\n            const input_cont = document.createElement(\"div\");\n            let __defs = Object.keys(__additional_defines).map(x => \"let \" + x + \" = \" + __additional_defines[x]).join(\";\") + \";\";\n\n            const __global_slider = document.createElement(\"input\");\n            {\n                __global_slider.type = \"range\";\n                __global_slider.min = \"0\";\n                __global_slider.value = \"0\";\n                __global_slider.step = \"1\";\n\n                input_cont.appendChild(__global_slider);\n            }\n\n            let __total_rng_count = 1;\n            let __locked_range = false;\n\n            input_cont.classList = \"flex_column\";\n            for (const __r of __fixed_rngs) {\n                const _lbl = document.createElement(\"label\");\n                const _in = document.createElement(\"input\");\n                _in.type = \"number\";\n                _in.min = \"0\";\n                _in.step = \"1\";\n\n                _in.addEventListener(\"change\", _click => {\n                    // Trigger update\n\n                    // Move the slider position\n                    let __spos = 0;\n                    let __base = 1;\n                    for (const __r of __rng_inputs.map(x => x).reverse()) {\n                        const __s = parseInt(__r.max) - parseInt(__r.min) + 1;\n\n                        const __v = __r.value;\n\n                        __spos += parseInt(__v) * __base;\n                        __base *= parseInt(__s);\n                    }\n                    __global_slider.value = __spos;\n\n                    __create_func();\n                });\n                // Set limits\n                try {\n                    _in.min = eval(__defs + __main(__r.val.start));\n                } catch (e) {\n                    console.warn(\"Got error when resolving expression\", e);\n                }\n                try {\n                    _in.max = eval(__defs + __main(__r.val.end));\n                } catch (e) {\n                    console.warn(\"Got error when resolving expression\", e);\n                }\n                try {\n                    _in.value = eval(__defs + __main(__r.val.start));\n                } catch (e) {\n                    console.warn(\"Got error when resolving expression\", e);\n                }\n\n                // Add the starting value as an expression to defs\n                __defs += \"let \" + __r.var + \" = \" + __main(__r.val.start) + \";\";\n\n                _lbl.innerText = \"Range iterator \" + __r.var + \" over [\" + __main(__r.val.start) + \", \" + __main(__r.val.end) + \"] in steps of \" + __main(__r.val.step);\n                _in.setAttribute(\"data-rname\", __r.var);\n                _lbl.appendChild(_in);\n                __rng_inputs.push(_in);\n\n                input_cont.appendChild(_lbl);\n\n                if (__total_rng_count == 0) __total_rng_count = 1;\n\n                const __e_size = ((__x) => eval(__defs + \"(\" + __main(__x.val.end) + \" - \" + __main(__x.val.start) + \"+1) / \" + __main(__x.val.step)))(__r);\n                if (__e_size == 0 || __locked_range) {\n                    __locked_range = true;\n                } else {\n                    __total_rng_count *= __e_size;\n                }\n            }\n            console.log(\"__total_rng_count\", __total_rng_count);\n            {\n                __global_slider.max = __total_rng_count - 1; // Inclusive range\n\n                __global_slider.addEventListener(\"input\", __ev => {\n                    let __v = parseInt(__global_slider.value);\n\n                    for (const __r of __rng_inputs.map(x => x).reverse()) {\n                        const __s = parseInt(__r.max) - parseInt(__r.min) + 1;\n\n                        const __subval = __v % __s;\n\n                        __r.value = __subval;\n\n                        __v = Math.floor(__v / __s);\n                    }\n                });\n\n                const r = __var_rng;\n                const _lbl = document.createElement(\"label\");\n                const _in = document.createElement(\"span\");\n\n                __global_slider.addEventListener(\"input\", _ev => {\n                    __create_func();\n                });\n\n                _in.innerText = \"(whole range)\";\n                _lbl.innerText = \"Range iterator \" + r.var + \" over [\" + __main(r.val.start) + \", \" + __main(r.val.end) + \"] in steps of \" + __main(r.val.step);\n                _lbl.appendChild(_in);\n\n                input_cont.appendChild(_lbl);\n            }\n            __tbl_container.appendChild(input_cont);\n        }\n\n        __create_func = () => {\n            __tbl_vert.innerHTML = \"\";\n            __tbl_vert.appendChild(__axis_x_info);\n            const __all_fixed = {};\n            Object.assign(__all_fixed, __additional_defines);\n            // Get the fixed values\n            {\n                for (const i of __rng_inputs) {\n                    const rname = i.getAttribute(\"data-rname\");\n                    const val = i.value;\n\n                    __all_fixed[rname] = val;\n                }\n            }\n\n            const __defstring = Object.keys(__all_fixed).map(x => \"let \" + x + \" = \" + __all_fixed[x] + \";\").join(\"\");\n\n            const __ellision_thresh_y = 64;\n            const __ellision_thresh_x = 128;\n\n            const __mark_cells = {};\n\n            // Evaluate the range\n            {\n                const feval = (x) => {\n                    return eval(__defstring + x);\n                };\n                const __it = __var_rng.var;\n                const __r_s = __main(__var_rng.val.start);\n                const __r_e = __main(__var_rng.val.end);\n                const __r_step = __main(__var_rng.val.step);\n\n                // Remember: Inclusive ranges\n                for (let __x = feval(__r_s); __x <= feval(__r_e); __x += feval(__r_step)) {\n                    // Add this to the full evaluation\n                    let __a_i = __access_indices.map((x, i) => [x, i]).sort((a, b) => a[1] - b[1]).map(x => x[0]);\n\n\n                    __a_i = __a_i.map(__y => feval(\"let \" + __it + \" = \" + __x + \";\" + __y.var));\n\n                    const __tmp = __mark_cells[__a_i[1]];\n                    if (__tmp == undefined) {\n                        __mark_cells[__a_i[1]] = [];\n                    }\n                    __mark_cells[__a_i[1]].push(__a_i[0]);\n                }\n            }\n\n            for (let __dim_2 = 0; __dim_2 < __mem_dims[0]; ++__dim_2) {\n\n                // Check ellision\n                if (__mem_dims[0] > __ellision_thresh_y && __dim_2 > __ellision_thresh_y / 2 && __dim_2 < __mem_dims[0] - __ellision_thresh_y / 2) {\n                    // Elide\n                    if (__dim_2 - 1 == __ellision_thresh_y / 2) {\n                        // Add ellision info _once_\n                        const __row = document.createElement(\"div\");\n                        __row.classList = \"flex_row\";\n                        __row.style = \"justify-content: flex-start;flex-wrap: nowrap;\"\n                        __row.innerText = \"...\";\n                        __tbl_vert.appendChild(__row);\n                    }\n                    continue;\n                }\n                const __row = document.createElement(\"div\");\n                __row.classList = \"flex_row\";\n                __row.style = \"justify-content: flex-start;flex-wrap: nowrap;\"\n\n                for (let __i = 0; __i < __mem_dims[1]; ++__i) {\n                    // Check ellision\n                    if (__mem_dims[1] > __ellision_thresh_x && __i > __ellision_thresh_x / 2 && __i < __mem_dims[1] - __ellision_thresh_x / 2) {\n                        // Elide\n                        if (__i - 1 == __ellision_thresh_x / 2) {\n                            // Add ellision info _once_\n                            const __cell = document.createElement('div');\n                            __cell.style = \"line-height: 1px;\";\n                            //let __colorstr = \"background: white;\";\n                            //__cell.style = \"min-width: \" + __size + \"px; min-height: \" + __size + \"px;border: 1px solid black;\" + __colorstr;\n                            __cell.innerText = \"...\";\n                            __row.appendChild(__cell);\n                        }\n                        continue;\n                    }\n\n                    let __set_marking = false;\n                    {\n                        const __tmp = __mark_cells[__dim_2];\n                        if (__tmp != undefined) {\n                            if (__tmp.includes(__i)) __set_marking = true;\n                        }\n                    }\n\n                    const __cell = document.createElement('div');\n                    let __colorstr = \"background: white;\";\n                    if (__set_marking) {\n                        __colorstr = \"background: red;\";\n                    }\n\n                    __cell.style = \"min-width: \" + __size + \"px; min-height: \" + __size + \"px;border: 1px solid darkgray;\" + __colorstr;\n                    __row.appendChild(__cell);\n                }\n\n                __tbl_vert.appendChild(__row);\n            }\n            __tbl_hor.appendChild(__tbl_vert);\n        };\n        __tbl_container.appendChild(__tbl_hor);\n\n        __create_func();\n\n        return __tbl_container;\n    }\n\n    create_visual_range_representation(__starts, __ends, __steps, __tiles, __mayfail = true, __data = null) {\n        const __obj_to_arr = x => (x instanceof Array) ? x : [x];\n\n        __starts = __obj_to_arr(__starts);\n        __ends = __obj_to_arr(__ends);\n        __steps = __obj_to_arr(__steps);\n        __tiles = __obj_to_arr(__tiles);\n\n        // NOTE: This context is eval()'d. This means that all variables must be in the forbidden namespace (__*) or they might be erroneously evaluated.\n        const __symbols = {};\n\n        const __e_starts = [];\n        const __e_ends = [];\n        const __e_steps = [];\n        const __e_tiles = [];\n        const __e_sizes = [];\n\n        for (let __r_it = 0; __r_it < __starts.length; ++__r_it) {\n\n            const __start = __starts[__r_it];\n            const __end = __ends[__r_it];\n            const __step = __steps[__r_it];\n            const __tile = __tiles[__r_it];\n\n            let __e_start = null;\n            let __e_end = null;\n            let __e_step = null;\n            let __e_tile = null;\n\n            let __mem_dims = [];\n            while (true) {\n                let __failed = false;\n                const __symbol_setter = Object.entries(__symbols).map(x => \"let \" + x[0] + \"=\" + x[1] + \";\").join(\"\");\n                try {\n                    // Define a couple of dace-functions that are used here\n                    const Min = (...x) => Math.min(...x);\n                    const int_ceil = (a, b) => Math.ceil(a / b);\n\n                    __e_start = eval(__symbol_setter + __start);\n                    __e_end = eval(__symbol_setter + __end) + 1; // The DaCe ranges are inclusive - we want to exclusive here.\n                    __e_step = eval(__symbol_setter + __step);\n                    __e_tile = eval(__symbol_setter + __tile);\n\n                    if (__data != null) {\n                        const __shapedims = __data.attributes.shape.length;\n                        __mem_dims = [];\n                        for (let __s = 0; __s < __shapedims; ++__s) {\n                            __mem_dims.push(eval(__symbol_setter + __data.attributes.shape[__s]));\n                        }\n                    }\n                } catch (e) {\n                    if (e instanceof ReferenceError) {\n                        // Expected, let the user provide inputs\n                        if (__mayfail) {\n                            __failed = true;\n                            break;\n                        } else {\n                            // Prompt the user and retry\n                            const __sym_name = e.message.split(\" \")[0];\n                            const __ret = window.prompt(\"Enter a value for Symbol `\" + __sym_name + \"`\");\n                            if (__ret == null) throw e;\n                            __symbols[__sym_name] = parseInt(__ret);\n                            __failed = true;\n                        }\n                    } else {\n                        // Unexpected error, rethrow\n                        throw e;\n                    }\n                }\n                if (!__failed) {\n                    break;\n                }\n            }\n\n            const __e_size = __e_end - __e_start;\n\n            __e_starts.push(__e_start);\n            __e_ends.push(__e_end);\n            __e_steps.push(__e_step);\n            __e_tiles.push(__e_tile);\n            __e_sizes.push(__e_size);\n        }\n\n        const __tbl_container = document.createElement(\"div\");\n        const __tbl_hor = document.createElement(\"div\");\n        __tbl_hor.classList = \"flex_row\";\n        __tbl_hor.style = \"flex-wrap: nowrap;\";\n        const __axis_x_info = document.createElement(\"div\");\n        {\n            __axis_x_info.classList = \"flex_row\";\n            __axis_x_info.style = \"justify-content: space-between;\";\n\n\n            for (let __i = 0; __i < 2; ++__i) {\n                const __tmp = document.createElement(\"div\");\n                // Take the second dimension\n                try {\n                    __tmp.innerText = (__i == 0) ? \"0\" : __mem_dims[1];\n                } catch (__e) {\n                    __tmp.innerText = (__i == 0) ? \"Start\" : \"End\";\n                }\n                __axis_x_info.appendChild(__tmp);\n            }\n        }\n\n        const __axis_y_info = document.createElement(\"div\");\n        {\n            __axis_y_info.classList = \"flex_column\";\n            __axis_y_info.style = \"justify-content: space-between;\";\n\n\n            for (let __i = 0; __i < 2; ++__i) {\n                const __tmp = document.createElement(\"div\");\n                // Take the first dimension\n                try {\n                    __tmp.innerText = (__i == 0) ? \"0\" : __mem_dims[0];\n                } catch (__e) {\n                    __tmp.innerText = (__i == 0) ? \"Start\" : \"End\";\n                }\n                __axis_y_info.appendChild(__tmp);\n            }\n        }\n\n        if (__data != null) {\n            __tbl_container.appendChild(__axis_x_info);\n            __tbl_hor.appendChild(__axis_y_info);\n        }\n        // Now create a table with the according cells for this\n        // Since this is done on a per-dimension basis, the table only has to be 1D, so we use a flexbox for this (easier)\n        const __row = document.createElement(\"div\");\n        __row.classList = \"flex_row\";\n        __row.style = \"justify-content: flex-start;flex-wrap: nowrap;\"\n\n        let __size = 10;\n        const __e_size = __e_sizes[0]; // #TODO: Adapt for multi-dim ranges if those are requested\n        const __e_step = __e_steps[0];\n        const __e_tile = __e_tiles[0];\n\n        if (__e_size > 512) __size = 5;\n\n        for (let __i = 0; __i < __e_size; ++__i) {\n            const __cell = document.createElement('div');\n            let __colorstr = \"background: white;\";\n            if (Math.floor(__i / __e_step) % 2 == 0) {\n                if (__i % __e_step < __e_tile) {\n                    __colorstr = \"background: SpringGreen;\";\n                }\n            } else {\n                if (__i % __e_step < __e_tile) {\n                    __colorstr = \"background: Darkorange;\";\n                }\n            }\n            __cell.style = \"min-width: \" + __size + \"px; min-height: \" + __size + \"px;border: 1px solid black;\" + __colorstr;\n            __row.appendChild(__cell);\n        }\n\n        __tbl_hor.appendChild(__row);\n        __tbl_container.appendChild(__tbl_hor);\n        return __tbl_container;\n    }\n\n    getMatchingInput(transthis, x, node) {\n\n        const create_language_input = (value, onchange) => {\n            if (value == undefined) {\n                value = x.value;\n            }\n            if (onchange == undefined) {\n                onchange = (elem) => {\n                    transthis.propertyChanged(node, x.name, elem.value);\n                };\n            }\n            const language_types = this.getEnum('Language');\n            let qualified = value;\n            if (!language_types.includes(qualified)) {\n                qualified = \"Language.\" + qualified;\n            }\n            const elem = FormBuilder.createSelectInput(\"prop_\" + x.name, onchange, language_types, qualified);\n            return elem;\n        };\n\n        const __resolve_initials = (__initials, __syms) => {\n            \"use strict\";\n            delete window.i; // Whoever thought it was a good idea to define a global variable named 'i'...\n            // We have to operate in the forbidden namespace (__*)\n\n            // Filter out all constants first\n            __initials = __initials.filter(x => isNaN(x.var));\n\n            // Add a merger function\n            const __merger = (a, b) => {\n                const acpy = a.map(x => x);\n                for (const y of b) {\n                    if (acpy.filter(x => (x == y) || (x.var != undefined && (JSON.stringify(x.var) == JSON.stringify(y.var)))).length > 0) {\n                        continue;\n                    } else {\n                        acpy.push(y);\n                    }\n                }\n                return acpy;\n            };\n\n            let __needed_defs = [];\n            const __placeholder_defines = [];\n            let __user_input_needed = [];\n            while (true) {\n                let __retry = false;\n                let __placeholder_def_str = __placeholder_defines.map(x => \"let \" + x + \" = 1\").join(\";\");\n                // Inject the known functions as well\n                __placeholder_def_str += \";let Min = (...e) => Math.min(...e); let int_ceil = (a, b) => Math.ceil(a/b);\"\n                for (const __i of __initials) {\n                    // For every initial, find the first defining element (element with the same name that assigns an expression)\n                    try {\n                        const __test = eval(__placeholder_def_str + __i.var);\n                    } catch (e) {\n                        if (e instanceof ReferenceError) {\n                            const __sym_name = e.message.split(\" \")[0];\n                            const __defs = __syms.filter(x => x.var == __sym_name && x.val != null);\n                            if (__defs.length > 0) {\n                                // Found a matching definition\n                                __placeholder_defines.push(__sym_name);\n                                __needed_defs = __merger(__needed_defs, [__defs[0]]);\n\n                                let __j = 0;\n                                for (; __j < __syms.length; ++__j) {\n                                    if (JSON.stringify(__syms[__j]) == JSON.stringify(__defs[0])) {\n                                        break;\n                                    }\n                                }\n                                const __f = x => x.main != undefined ? x.main : x;\n\n                                // Recurse into range subelements (if applicable)\n                                if (__defs[0].val != null && __defs[0].val.start != undefined) {\n                                    // find the starting node\n\n                                    let __tmp = __resolve_initials([{\n                                        var: __f(__defs[0].val.start),\n                                        val: null\n                                    }], __syms.slice(__j));\n                                    __needed_defs = __merger(__needed_defs, __tmp[1]);\n                                    __user_input_needed = __merger(__user_input_needed, __tmp[2]);\n                                    __tmp = __resolve_initials([{\n                                        var: __f(__defs[0].val.end),\n                                        val: null\n                                    }], __syms.slice(__j));\n                                    __needed_defs = __merger(__needed_defs, __tmp[1]);\n                                    __user_input_needed = __merger(__user_input_needed, __tmp[2]);\n                                    __tmp = __resolve_initials([{\n                                        var: __f(__defs[0].val.step),\n                                        val: null\n                                    }], __syms.slice(__j));\n                                    __needed_defs = __merger(__needed_defs, __tmp[1]);\n                                    __user_input_needed = __merger(__user_input_needed, __tmp[2]);\n                                    __tmp = __resolve_initials([{\n                                        var: __f(__defs[0].val.tile),\n                                        val: null\n                                    }], __syms.slice(__j));\n                                    __needed_defs = __merger(__needed_defs, __tmp[1]);\n                                    __user_input_needed = __merger(__user_input_needed, __tmp[2]);\n                                } else {\n                                    // Recurse into the found value.\n                                    const __tmp = __resolve_initials([{\n                                        var: __f(__defs[0].val),\n                                        val: null\n                                    }], __syms.slice(__j));\n                                    console.log(\"rec\", __tmp);\n                                    // Add elements to lists\n                                    __needed_defs = __merger(__needed_defs, __tmp[1]);\n                                    __user_input_needed = __merger(__user_input_needed, __tmp[2]);\n                                }\n                            } else {\n                                // Need user input for this Symbol (defer actually requesting that info from the user)\n                                __user_input_needed.push(__sym_name);\n                                // Also promise to define the symbol later\n                                __placeholder_defines.push(__sym_name);\n                            }\n                            __retry = true;\n                            break;\n                        } else {\n                            // Rethrow unknown exceptions\n                            throw e;\n                        }\n                    }\n                    if (__retry) break;\n                }\n                if (__retry) continue;\n\n\n                break;\n            }\n            // Return a (cleaned) list of the required elements\n            return [__initials, __needed_defs, __user_input_needed];\n        };\n\n        const create_index_subset_input = (transthis, x, node) => {\n            // Similar to range, but actually binding values\n            // This therefore occurs in memlets inside Maps mostly\n            // (Except when accessing using constants)\n\n            // Because the indices are used to access data (arrays),\n            // there needs to be lookup by finding the parent nodes (potentially using connectors).\n            // A lookup may traverse to top-level and throw if the symbols are not resolved yet.\n\n            const cont = document.createElement(\"div\");\n\n            if (node.data === undefined)\n                return $(cont);\n\n\n            const indices = x.value.indices;\n\n            // Generate string from indices\n            let preview = '[';\n            for (const index of indices) {\n                preview += index + ', ';\n            }\n            preview = preview.slice(0, -2) + ']';\n\n            cont.innerText = preview + '  ';\n\n            const elem = document.createElement(\"button\");\n            elem.style.float = \"right\";\n            elem.innerText = \"Edit\";\n            cont.appendChild(elem);\n\n            elem.addEventListener(\"click\", (_click) => {\n                this.project().request(['sdfg_object'], resp => {\n                    const tmp = resp['sdfg_object'];\n                    let syms = [];\n                    for (const v of Object.values(tmp)) {\n                        const tsyms = SDFG_Parser.lookup_symbols(v, node.state_id, node.node_id, null);\n                        syms = [...syms, ...tsyms];\n                        console.log(\"syms\", syms);\n\n                        // Got the symbols, now resolve.\n\n                        // Resolve (ltr is inner-to-outer)\n                    }\n                    // Rationale here: Render the underlying data as a basis,\n                    // then use index and range information to find access patterns\n\n                    // Find the initial values\n                    const initials = [];\n                    for (const x of syms) {\n                        if (x.val != null) break;\n                        initials.push(x);\n                    }\n                    // initials contains the indices used. Resolve all ranges defining those\n\n                    const newelems = __resolve_initials(initials, syms);\n                    console.log(\"newelems\", newelems);\n\n                    let data = node.data().props.filter(x => x.name == \"data\")[0];\n\n                    let data_objs = [];\n                    for (const x of Object.values(tmp)) {\n                        data_objs.push(x.attributes._arrays[data.value]);\n                    }\n                    data_objs = data_objs.filter(x => x != undefined);\n                    if (data_objs.length > 0) {\n                        data = data_objs[0];\n                    }\n\n                    const popup_div = document.createElement('div');\n\n                    const popup_div_body = document.createElement('div');\n\n                    const value_input = document.createElement(\"input\");\n                    value_input.type = \"text\";\n                    value_input.value = JSON.stringify(x.value);\n\n                    const e = this.create_visual_access_representation(\n                        newelems, data\n                    );\n\n                    const apply_but = document.createElement(\"button\");\n                    apply_but.innerText = \"Apply changes\";\n                    apply_but.addEventListener(\"click\", _click => {\n                        transthis.propertyChanged(node, x.name, JSON.parse(value_input.value));\n                        w2popup.close();\n                    });\n                    popup_div_body.appendChild(value_input);\n\n                    popup_div_body.appendChild(e);\n                    popup_div.appendChild(popup_div_body);\n\n                    w2popup.open({\n                        title: \"Data access / Indices property\",\n                        body: popup_div,\n                        buttons: apply_but,\n                        width: 1280,\n                        height: 800,\n                    });\n                }, {});\n            });\n\n            return $(cont);\n        }\n\n        const create_range_input = (transthis, x, node) => {\n\n            // As ranges _usually_ operate on data, check if a property named \"data\" is in the same object.\n            // If it is, we can inform the design of visualizations with the shape of the data object (array)\n            // #TODO: Always update this when changed (in the current implementation, it is possible that stale values are read for different properties)\n            let data_obj = null;\n            if (node.data != undefined) {\n                const tmp = node.data().props.filter(x => x.name == \"data\");\n                if (tmp.length > 0) {\n                    // Found data (name only, will resolve when rendering is actually requested)\n                    data_obj = tmp[0];\n                }\n            }\n\n\n            const cont = document.createElement(\"div\");\n\n            const ranges = x.value.ranges;\n            const popup_div = document.createElement('div');\n\n            // Generate string from range\n            let preview = '[';\n            for (const range of ranges) {\n                preview += range.start + '..' + range.end;\n                if (range.step != 1) {\n                    preview += ':' + range.step;\n                    if (range.tile != 1)\n                        preview += ':' + range.tile;\n                } else if (range.tile != 1) {\n                    preview += '::' + range.tile;\n                }\n                preview += ', ';\n            }\n            preview = preview.slice(0, -2) + ']';\n\n            cont.innerText = preview + '  ';\n\n            const elem = document.createElement(\"button\");\n            elem.style.float = \"right\";\n            elem.innerText = \"Edit\";\n            cont.appendChild(elem);\n\n\n            const popup_div_body = document.createElement('div');\n\n\n            const range_elems = [];\n            for (const r of ranges) {\n                // Add a row for every range\n                const r_row = document.createElement('div');\n                r_row.classList = \"flex_row\";\n                r_row.style = \"flex-wrap: nowrap;\";\n                if (typeof (r.start) != 'string') r.start = r.start.main;\n                if (typeof (r.end) != 'string') r.end = r.end.main;\n                if (typeof (r.step) != 'string') r.step = r.step.main;\n                if (typeof (r.tile) != 'string') r.tile = r.tile.main;\n\n                {\n                    const input_refs = [];\n                    // Generate 4 text inputs and add them to the row\n                    for (let i = 0; i < 4; ++i) {\n                        // Generate the label first\n                        const lbl = document.createElement('label');\n                        const ti = document.createElement('input');\n                        ti.style = \"width:100px;\";\n                        ti.type = \"text\";\n                        switch (i) {\n                            case 0:\n                                ti.value = r.start;\n                                lbl.textContent = \"Start\";\n                                break;\n                            case 1:\n                                ti.value = r.end;\n                                lbl.textContent = \"End\";\n                                break;\n                            case 2:\n                                ti.value = r.step;\n                                lbl.textContent = \"Step\";\n                                break;\n                            case 3:\n                                ti.value = r.tile;\n                                lbl.textContent = \"Tile\";\n                                break;\n                        }\n                        input_refs.push(ti);\n                        lbl.appendChild(ti);\n                        r_row.appendChild(lbl);\n                    }\n                    range_elems.push(input_refs);\n                    const visbut = document.createElement('div');\n                    visbut.style = \"min-width: 200px; min-height: 1rem;flex-grow: 1;display: flex;\";\n                    visbut.addEventListener('click', () => {\n\n                        // Resolve the data name and set the object accordingly\n                        if (data_obj != null) {\n\n                            this.project().request(['sdfg_object'], sdfg_obj => {\n                                if (typeof sdfg_obj.sdfg_object === 'object')\n                                    sdfg_obj = sdfg_obj.sdfg_object;\n                                else\n                                    sdfg_obj = JSON.parse(sdfg_obj.sdfg_object);\n                                console.log(\"got sdfg object\", sdfg_obj);\n                                // Iterate over all SDFGs, checking arrays and returning matching data elements\n\n                                let data_objs = [];\n                                for (const x of Object.values(sdfg_obj)) {\n                                    data_objs.push(x.attributes._arrays[data_obj.value]);\n                                }\n                                data_objs = data_objs.filter(x => x != undefined);\n                                if (data_objs.length > 0) {\n                                    data_obj = data_objs[0];\n                                }\n\n                                const vis_elem = this.create_visual_range_representation(...input_refs.map(x => x.value), false, data_obj);\n                                visbut.innerHTML = \"\";\n                                visbut.appendChild(vis_elem);\n                            }, {});\n\n                        } else {\n                            const vis_elem = this.create_visual_range_representation(...input_refs.map(x => x.value), false, data_obj);\n                            visbut.innerHTML = \"\";\n                            visbut.appendChild(vis_elem);\n                        }\n\n                    });\n                    visbut.innerText = \"Click here for visual representation\";\n                    r_row.appendChild(visbut);\n                }\n\n\n                popup_div_body.appendChild(r_row);\n            }\n\n            popup_div.appendChild(popup_div_body);\n\n            const apply_but = document.createElement(\"button\");\n            apply_but.innerText = \"Apply\";\n            apply_but.addEventListener(\"click\", () => {\n                const ret = {\n                    ranges: [],\n                    type: x.value.type,\n                }\n                for (const re of range_elems) {\n                    ret.ranges.push({\n                        start: re[0].value,\n                        end: re[1].value,\n                        step: re[2].value,\n                        tile: re[3].value\n                    })\n                }\n                transthis.propertyChanged(node, x.name, ret);\n                w2popup.close();\n            });\n\n            elem.onclick = () => {\n                w2popup.open({\n                    title: \"Range property\",\n                    body: popup_div,\n                    buttons: apply_but,\n                    width: 1280,\n                    height: 800,\n                });\n            };\n            return $(cont);\n        };\n\n        // TODO: Handle enumeration types better\n        let elem = document.createElement('div');\n        if (x.metatype == \"bool\") {\n            let val = x.value;\n            if (typeof (val) == 'string') val = val == 'True';\n            elem = FormBuilder.createToggleSwitch(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.checked);\n\n            }, val);\n        } else if (\n            x.metatype == \"str\" || x.metatype == \"float\" || x.metatype == \"LambdaProperty\" || x.metatype == \"Property\"\n        ) {\n            elem = FormBuilder.createTextInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, x.value);\n        } else if (\n            x.metatype == \"tuple\" || x.metatype == \"dict\" ||\n            x.metatype == \"list\" || x.metatype == \"set\"\n        ) {\n            elem = FormBuilder.createTextInput(\"prop_\" + x.name, (elem) => {\n                let tmp = elem.value;\n                try {\n                    tmp = JSON.parse(elem.value);\n                } catch (e) {\n                    tmp = elem.value;\n                }\n                transthis.propertyChanged(node, x.name, tmp);\n            }, JSON.stringify(x.value));\n        } else if (x.metatype == \"Range\") {\n            elem = create_range_input(transthis, x, node);\n        } else if (x.metatype == \"DataProperty\") {\n            // The data list has to be fetched from the SDFG.\n            // Therefore, there needs to be a placeholder until data is ready\n            elem = document.createElement(\"span\");\n            elem.innerText = x.value;\n\n            elem = $(elem);\n            const cb = d => {\n                // Only show data for the inner SDFG (it's possible to input an arbitrary string, still)\n                const sdfg = node.sdfg;\n                const arrays = sdfg.attributes._arrays;\n                const array_names = Object.keys(arrays);\n\n                const new_elem = FormBuilder.createComboboxInput(\"prop_\" + x.name, (elem) => {\n                    transthis.propertyChanged(node, x.name, elem.value);\n                }, array_names, x.value);\n\n                // Replace the placeholder\n                elem[0].parentNode.replaceChild(new_elem[0], elem[0]);\n            };\n            this.project().request(['sdfg_object'], cb, {\n                on_timeout: cb,\n                timeout: 300\n            });\n\n        } else if (x.metatype == \"LibraryImplementationProperty\") {\n            // The list of implementations has to be fetched from\n            // the server directly.\n            elem = document.createElement(\"span\");\n            elem.innerText = x.value;\n\n            elem = $(elem);\n            $.getJSON(\"/dace/api/v1.0/getLibImpl/\" + node.element.classpath, available_implementations => {\n                const cb = d => {\n                    const new_elem = FormBuilder.createComboboxInput(\"prop_\" + x.name, (elem) => {\n                        transthis.propertyChanged(node, x.name, elem.value);\n                    }, available_implementations, x.value);\n\n                    // Add Expand button to transform the node\n                    const button = FormBuilder.createButton(\"prop_\" + x.name + \"_expand\",\n                        (elem) => {\n\n                            // Expand library node\n                            REST_request(\"/dace/api/v1.0/expand/\", {\n                                sdfg: node.sdfg,\n                                nodeid: [node.sdfg.sdfg_list_id, node.element.parent_id, node.element.id]\n                            }, (xhr) => {\n                                if (xhr.readyState === 4 && xhr.status === 200) {\n                                    const resp = parse_sdfg(xhr.response);\n                                    if (resp.error !== undefined) {\n                                        // Propagate error\n                                        this.handleErrors(this, resp);\n                                    }\n\n                                    // Add to history\n                                    this.project().request([\"append-history\"], x => {\n                                    }, {\n                                        params: {\n                                            new_sdfg: resp.sdfg,\n                                            item_name: \"Expand \" + node.element.label\n                                        }\n                                    });\n                                }\n                            });\n                        }, \"Expand\");\n\n\n                    // Replace the placeholder\n                    elem[0].parentNode.replaceChild(new_elem[0], elem[0]);\n                    new_elem[0].parentNode.appendChild(button[0]);\n                };\n                this.project().request(['sdfg_object'], cb, {\n                    on_timeout: cb,\n                    timeout: 300\n                });\n            });\n        } else if (x.metatype == \"CodeProperty\" || x.metatype == \"CodeBlock\") {\n            let codeelem = null;\n            let langelem = null;\n            const onchange = (elem) => {\n                transthis.propertyChanged(node, x.name, {\n                    'string_data': codeelem[0].value,\n                    'language': langelem[0].value\n                });\n            };\n            if (x.value == null) {\n                x.value = {};\n                x.value.language = \"NoCode\";\n                x.value.string_data = \"\";\n            }\n            codeelem = FormBuilder.createLongTextInput(\"prop_\" + x.name, onchange, x.value.string_data);\n            elem.appendChild(codeelem[0]);\n            langelem = create_language_input(x.value.language, onchange);\n            elem.appendChild(langelem[0]);\n            elem.classList.add(\"flex_column\");\n\n            return elem;\n        } else if (x.metatype == \"int\") {\n            elem = FormBuilder.createIntInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, parseInt(elem.value));\n            }, x.value);\n        } else if (x.metatype == 'ScheduleType') {\n            const schedule_types = this.getEnum('ScheduleType');\n            let qualified = x.value;\n            if (!schedule_types.includes(qualified)) {\n                qualified = \"ScheduleType.\" + qualified;\n            }\n            elem = FormBuilder.createSelectInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, schedule_types, qualified);\n        } else if (x.metatype == 'AllocationLifetime') {\n            const types = this.getEnum('AllocationLifetime');\n            let qualified = x.value;\n            if (!types.includes(qualified)) {\n                qualified = \"AllocationLifetime.\" + qualified;\n            }\n            elem = FormBuilder.createSelectInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, types, qualified);\n        } else if (x.metatype == 'AccessType') {\n            const access_types = this.getEnum('AccessType');\n            let qualified = x.value;\n            if (!access_types.includes(qualified)) {\n                qualified = \"AccessType.\" + qualified;\n            }\n            elem = FormBuilder.createSelectInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, access_types, qualified);\n        } else if (x.metatype == 'Language') {\n            elem = create_language_input();\n        } else if (x.metatype == 'None') {\n            // Not sure why the user would want to see this\n            console.log(\"Property with type 'None' ignored\", x);\n            return elem;\n        } else if (x.metatype == 'object' && x.name == 'identity') {\n            // This is an internal property - ignore\n            return elem;\n        } else if (x.metatype == 'OrderedDiGraph') {\n            // #TODO: What should we do with this?\n            elem = FormBuilder.createTextInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, x.value);\n        } else if (x.metatype == 'DebugInfo') {\n            // Special case: The DebugInfo contains information where this element was defined\n            // (in the original source).\n            let info_obj = x.value;\n            if (typeof (info_obj) == 'string')\n                info_obj = JSON.parse(info_obj);\n            elem = FormBuilder.createCodeReference(\"prop_\" + x.name, (elem) => {\n                // Clicked => highlight the corresponding code\n                transthis.project().request(['highlight-code'], msg => {\n                }, {\n                    params: info_obj\n                });\n            }, info_obj);\n        } else if (x.metatype == 'ListProperty') {\n            // #TODO: Find a better type for this\n            elem = FormBuilder.createTextInput(\"prop_\" + x.name, (elem) => {\n                let tmp = elem.value;\n                try {\n                    tmp = JSON.parse(elem.value);\n                } catch (e) {\n                    tmp = elem.value;\n                }\n                transthis.propertyChanged(node, x.name, tmp);\n            }, JSON.stringify(x.value));\n        } else if (x.metatype == \"StorageType\") {\n            const storage_types = this.getEnum('StorageType');\n            let qualified = x.value;\n            if (!storage_types.includes(qualified)) {\n                qualified = \"StorageType.\" + qualified;\n            }\n            elem = FormBuilder.createSelectInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, storage_types, qualified);\n        } else if (x.metatype == \"InstrumentationType\") {\n            const storage_types = this.getEnum('InstrumentationType');\n            let qualified = x.value;\n            if (!storage_types.includes(qualified)) {\n                qualified = \"InstrumentationType.\" + qualified;\n            }\n            elem = FormBuilder.createSelectInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, storage_types, qualified);\n        } else if (x.metatype == \"typeclass\") {\n            // #TODO: Type combobox\n            elem = FormBuilder.createTextInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, x.value);\n        } else if (x.metatype == \"hosttype\") {\n            elem = FormBuilder.createHostInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, DIODE.getHostList(), x.value);\n        } else if (x.metatype == \"selectinput\") {\n            elem = FormBuilder.createSelectInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, x.options, x.value);\n        } else if (x.metatype == \"combobox\") {\n            elem = FormBuilder.createComboboxInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, elem.value);\n            }, x.options, x.value);\n        } else if (x.metatype == \"font\") {\n            console.warn(\"Ignoring property type \", x.metatype);\n            return elem;\n        } else if (x.metatype == \"SDFGReferenceProperty\") {\n            // Nothing to display\n            return elem;\n        } else if (x.metatype == \"SubsetProperty\") {\n            if (x.value == null) {\n                elem = FormBuilder.createTextInput(\"prop_\" + x.name, (elem) => {\n                    transthis.propertyChanged(node, x.name, JSON.parse(elem.value));\n                }, JSON.stringify(x.value));\n            } else if (x.value.type == \"subsets.Indices\" || x.value.type == \"Indices\") {\n                elem = create_index_subset_input(transthis, x, node);\n            } else {\n                elem = create_range_input(transthis, x, node);\n            }\n        } else if (x.metatype == \"SymbolicProperty\") {\n            elem = FormBuilder.createTextInput(\"prop_\" + x.name, (elem) => {\n                transthis.propertyChanged(node, x.name, JSON.parse(elem.value));\n            }, JSON.stringify(x.value));\n        } else {\n            console.log(\"Unimplemented property type: \", x);\n            //alert(\"Unimplemented property type: \" + x.metatype);\n\n            return elem;\n        }\n        return elem[0];\n    }\n\n    renderPropertiesInWindow(transthis, node, params, options) {\n        const dobj = {\n            transthis: typeof (transthis) == 'string' ? transthis : transthis.created,\n            node: node,\n            params: params,\n            options: options\n        };\n        this.replaceOrCreate(['display-properties'], 'PropWinComponent', dobj,\n            () => {\n                const millis = this.getPseudorandom();\n                const config = {\n                    type: 'component',\n                    componentName: 'PropWinComponent',\n                    componentState: {\n                        created: millis,\n                        params: dobj\n                    }\n                };\n\n                this.addContentItem(config);\n            });\n    }\n\n    showStaleDataButton() {\n        this.project().request(['show_stale_data_button'], x => {\n        }, {});\n    }\n\n    removeStaleDataButton() {\n        this.project().request(['remove_stale_data_button'], x => {\n        }, {});\n    }\n\n    refreshSDFG() {\n        this.gatherProjectElementsAndCompile(diode, {}, { sdfg_over_code: true });\n    }\n\n    __impl_showStaleDataButton() {\n        /*\n            Show a hard-to-miss button hinting to recompile.\n        */\n\n        if (DIODE.recompileOnPropertyChange()) {\n            // Don't show a warning, just recompile directly\n            this.gatherProjectElementsAndCompile(this, {}, { sdfg_over_code: true });\n            return;\n        }\n        if (this._stale_data_button != null) {\n            return;\n        }\n        const stale_data_button = document.createElement(\"div\");\n        stale_data_button.classList = \"stale_data_button\";\n        stale_data_button.innerHTML = \"Stale project data. Click here or press <span class='key_combo'>Alt-R</span> to synchronize\";\n\n        stale_data_button.addEventListener('click', x => {\n            this.gatherProjectElementsAndCompile(diode, {}, { sdfg_over_code: true });\n        })\n\n        document.body.appendChild(stale_data_button);\n\n        this._stale_data_button = stale_data_button;\n    }\n\n    __impl_removeStaleDataButton() {\n        if (this._stale_data_button != null) {\n            const p = this._stale_data_button.parentNode;\n            p.removeChild(this._stale_data_button);\n            this._stale_data_button = null;\n        }\n    }\n\n\n    showIndeterminateLoading() {\n        this.project().request(['show_loading'], x => {\n        }, {});\n    }\n\n    hideIndeterminateLoading() {\n        this.project().request(['hide_loading'], x => {\n        }, {});\n    }\n\n    __impl_showIndeterminateLoading() {\n        $(\"#loading_indicator\").show();\n    }\n\n    __impl_hideIndeterminateLoading() {\n        $(\"#loading_indicator\").hide();\n    }\n\n    hideIndeterminateLoading() {\n        this.project().request(['hide_loading'], x => {\n        }, {});\n    }\n\n    static filterComponentTree(base, filterfunc = x => x) {\n        const ret = [];\n        for (const x of base.contentItems) {\n\n            ret.push(...this.filterComponentTree(x, filterfunc));\n        }\n\n        return ret.filter(filterfunc);\n    }\n\n    static filterComponentTreeByCname(base, componentName) {\n        const filterfunc = x => x.config.type == \"component\" && x.componentName == componentName;\n        return base.getItemsByFilter(filterfunc);\n    }\n\n    groupSDFGs() {\n        this.generic_group(x => x.config.type == \"component\" && x.componentName == \"SDFGComponent\");\n    }\n\n    groupCodeOuts() {\n        this.generic_group(x => x.config.type == \"component\" && x.componentName == \"CodeOutComponent\");\n    }\n\n    groupOptGraph() {\n        this.generic_group(x => x.config.type == \"component\" && x.componentName == \"OptGraphComponent\");\n    }\n\n    groupSDFGsAndCodeOutsTogether() {\n        let comps = this.goldenlayout.root.getItemsByFilter(x => x.config.type == \"component\" && x.componentName == 'SDFGComponent');\n\n        const names = []\n        for (const x of comps) {\n            names.push(x.config.componentState.sdfg_name);\n        }\n\n        for (const n of names) {\n            this.generic_group(x => x.config.type == \"component\" &&\n                (x.componentName == \"SDFGComponent\" || x.componentName == \"CodeOutComponent\") &&\n                x.config.componentState.sdfg_name == n);\n        }\n\n        // Get the SDFG elements again to set them active\n        comps = this.goldenlayout.root.getItemsByFilter(x => x.config.type == \"component\" && x.componentName == 'SDFGComponent');\n        comps.forEach(x => x.parent.setActiveContentItem(x));\n\n    }\n\n    groupLikeDIODE1() {\n        /*\n        |---------------------------------------------\n        | CodeIn  | Opt   |         SDFG             |\n        |         | Tree  |       Renderer           |\n        |---------------------------------------------\n        |         |          |                       |\n        | CodeOut | (Perf)   | Prop Renderer         |\n        |         |          |                       |\n        |         |          |                       |\n        ----------------------------------------------\n        */\n\n        this.goldenlayout.eventHub.emit(\"enter-programmatic-destroy\", \"\");\n\n        // Collect the components to add to the layout later\n        const code_ins = DIODE.filterComponentTreeByCname(this.goldenlayout.root, \"CodeInComponent\");\n        const opttrees = DIODE.filterComponentTreeByCname(this.goldenlayout.root, \"AvailableTransformationsComponent\");\n        const opthists = DIODE.filterComponentTreeByCname(this.goldenlayout.root, \"TransformationHistoryComponent\");\n        const sdfg_renderers = DIODE.filterComponentTreeByCname(this.goldenlayout.root, \"SDFGComponent\");\n        const code_outs = DIODE.filterComponentTreeByCname(this.goldenlayout.root, \"CodeOutComponent\");\n        const property_renderers = DIODE.filterComponentTreeByCname(this.goldenlayout.root, \"PropWinComponent\");\n\n        // Note that this only collects the _open_ elements and disregards closed or invalidated ones\n        // Base goldenlayout stretches everything to use the full space available, this makes stuff look bad in some constellations\n        // We compensate some easily replacable components here\n        if (property_renderers.length == 0) {\n            // Add an empty property window for spacing\n\n            const c = this.getPseudorandom();\n            property_renderers.push({\n                config: {\n                    type: 'component',\n                    componentName: \"PropWinComponent\",\n                    componentState: {\n                        created: c\n                    }\n                }\n            });\n        }\n\n        // Remove the contentItems already as a workaround for a goldenlayout bug(?) that calls destroy unpredictably\n        const to_remove = [code_ins, code_outs, opttrees, opthists, sdfg_renderers, property_renderers];\n        for (const y of to_remove) {\n            for (const x of y) {\n                if (x.componentName != undefined) {\n                    x.remove();\n                }\n                // Otherwise: Might be a raw config\n            }\n        }\n\n        // Remove existing content\n        const c = [...this.goldenlayout.root.contentItems];\n        for (const x of c) {\n            this.goldenlayout.root.removeChild(x);\n        }\n\n\n        // Create the stacks (such that elements are tabbed)\n        const code_in_stack = this.goldenlayout.createContentItem({\n            type: 'stack',\n            content: [/*...code_ins.map(x => x.config)*/]\n        });\n        const opttree_stack = this.goldenlayout.createContentItem({\n            type: 'stack',\n            content: [/*...opttrees.map(x => x.config)*/]\n        });\n        const sdfg_stack = this.goldenlayout.createContentItem({\n            type: 'stack',\n            content: [/*...sdfg_renderers.map(x => x.config)*/]\n        });\n        const code_out_stack = this.goldenlayout.createContentItem({\n            type: 'stack',\n            content: [/*...code_outs.map(x => x.config)*/]\n        });\n        const property_stack = this.goldenlayout.createContentItem({\n            type: 'stack',\n            content: [/*...property_renderers.map(x => x.config)*/]\n        });\n\n        const top_row = this.goldenlayout.createContentItem({\n            type: 'row',\n            content: [/*code_in_stack, opttree_stack, sdfg_stack*/]\n        });\n\n        const bottom_row = this.goldenlayout.createContentItem({\n            type: 'row',\n            content: [/*code_out_stack, property_stack*/]\n        });\n\n\n        const top_bottom = this.goldenlayout.createContentItem({\n            type: 'column',\n            content: [/*top_row, bottom_row*/]\n        });\n        // Now add the new layout construction\n        this.goldenlayout.root.addChild(top_bottom);\n\n        top_bottom.addChild(top_row);\n        top_bottom.addChild(bottom_row);\n\n\n        top_row.addChild(code_in_stack);\n        top_row.addChild(opttree_stack);\n        top_row.addChild(sdfg_stack);\n\n        bottom_row.addChild(code_out_stack)\n        bottom_row.addChild(property_stack);\n\n        sdfg_renderers.forEach(x => sdfg_stack.addChild(x.config));\n        property_renderers.forEach(x => property_stack.addChild(x.config));\n        code_outs.forEach(x => code_out_stack.addChild(x.config));\n        opttrees.forEach(x => opttree_stack.addChild(x.config));\n        opthists.forEach(x => opttree_stack.addChild(x.config));\n        code_ins.forEach(x => code_in_stack.addChild(x.config));\n\n        // Everything has been added, but maybe too much: There might be empty stacks.\n        // They should be removed to keep a \"clean\" appearance\n        for (const x of [opttree_stack, code_in_stack, sdfg_stack, property_stack]) {\n            if (x.contentItems.length == 0) {\n                x.remove();\n            }\n        }\n\n\n        this.goldenlayout.eventHub.emit(\"leave-programmatic-destroy\", \"\");\n    }\n\n    generic_group(predicate) {\n        /*\n            Groups the SDFGs into their own Stack\n\n        */\n        this.goldenlayout.eventHub.emit(\"enter-programmatic-destroy\", \"\");\n        const sdfg_components = this.goldenlayout.root.getItemsByFilter(predicate);\n\n        if (sdfg_components.length == 0) {\n            console.warn(\"Cannot group, no elements found\");\n        }\n        const new_container = this.goldenlayout.createContentItem({\n            type: 'stack',\n            contents: []\n        });\n\n        for (const x of sdfg_components) {\n            const config = x.config;\n            x.parent.removeChild(x);\n            new_container.addChild(config);\n        }\n\n        this.addContentItem(new_container);\n\n        this.goldenlayout.eventHub.emit(\"leave-programmatic-destroy\", \"\");\n    }\n\n\n    addKeyShortcut(key, func, alt = true, ctrl = false) {\n        const keys = [...key];\n        const c = {\n            'alt': alt,\n            'ctrl': ctrl,\n            'func': func,\n            'state': 0,\n            'expect': keys.slice(1)\n        };\n        if (this._shortcut_functions[keys[0]] === undefined) {\n            this._shortcut_functions[keys[0]] = [c];\n        } else {\n            this._shortcut_functions[keys[0]].push(c);\n        }\n    }\n\n    onKeyUp(ev) {\n        if (ev.altKey == false && ev.key == 'Alt') {\n            for (const cs of Object.values(this._shortcut_functions)) {\n                for (const c of cs) {\n                    c.state = 0;\n                }\n            }\n        }\n    }\n\n    onKeyDown(ev) {\n        for (const cs of Object.values(this._shortcut_functions)) {\n            for (const c of cs) {\n                if (ev.altKey == false) {\n                    c.state = 0;\n                    continue;\n                }\n                if (c.state > 0) {\n                    // Currently in a combo-state\n                    if (c.expect[c.state - 1] == ev.key) {\n                        c.state += 1;\n                        if (c.state > c.expect.length) {\n                            // Found multi-key combo, activate\n                            c.func();\n                            ev.stopPropagation();\n                            ev.preventDefault();\n\n                            // Clear the states\n                            this.onKeyUp({ altKey: false, key: 'Alt' });\n                            return;\n                        }\n                    }\n                }\n            }\n        }\n        const cs = this._shortcut_functions[ev.key];\n        if (cs === undefined) return;\n\n        let i = 0;\n        for (const c of cs) {\n            if (c.alt == ev.altKey && c.ctrl == ev.ctrlKey) {\n\n                if (c.expect.length > 0) {\n                    // Multi-key combo expected\n                    c.state += 1;\n                    console.log(\"dict value: \", this._shortcut_functions[ev.key][i]);\n                    ++i;\n                    continue;\n                }\n                c.func();\n\n                ev.stopPropagation();\n                ev.preventDefault();\n                // Clear the states\n                this.onKeyUp({ altKey: false, key: 'Alt' });\n            }\n            ++i;\n        }\n    }\n\n    createNewProject() {\n        this._current_project = new DIODE_Project(this);\n        this._current_project.clearTransformationHistory();\n        sessionStorage.clear();\n        window.sessionStorage.setItem(\"diode_project\", this._current_project._project_id);\n        this.setupEvents();\n    }\n\n    getProject() {\n        const proj_id = window.sessionStorage.getItem(\"diode_project\");\n        this._current_project = new DIODE_Project(this, proj_id);\n        if (proj_id == null || proj_id == undefined) {\n            // There was a new project ID assigned, which is stored again in the session storage\n            window.sessionStorage.setItem(\"diode_project\", this.getCurrentProject()._project_id);\n            this.setupEvents();\n        }\n    }\n\n    project() {\n        // Alias function to emulate context behavior\n        return this.getCurrentProject();\n    }\n\n    getCurrentProject() {\n        return this._current_project;\n    }\n\n    setLayout(gl) {\n        this.goldenlayout = gl;\n    }\n\n    settings() {\n        return this._settings;\n    }\n\n    getPseudorandom() {\n        const date = new Date();\n        const millis = date.getTime().toString() + Math.random().toFixed(10).toString() + this._creation_counter.toString();\n\n        ++this._creation_counter;\n\n        console.assert(millis !== undefined, \"Millis well-defined\");\n\n        return millis;\n    }\n\n    multiple_SDFGs_available(sdfgs) {\n\n        const sdfgs_obj = (typeof (sdfgs) == 'string') ? parse_sdfg(sdfgs) : sdfgs;\n\n        for (const x of Object.keys(sdfgs_obj.compounds)) {\n            // New sdfg\n            const value = sdfgs_obj.compounds[x];\n            this.SDFG_available(value, x);\n        }\n    }\n\n    SDFG_available(sdfg, name = \"sdfg\") {\n        // We create a new component and add it to the layout\n\n        // To provide some distinguation, milliseconds since epoch are used.\n        const millis = () => this.getPseudorandom();\n\n        sdfg.sdfg_name = name;\n\n        const create_sdfg_func = () => {\n            const new_sdfg_config = {\n                title: name,\n                type: 'component',\n                componentName: 'SDFGComponent',\n                componentState: { created: millis(), sdfg_data: sdfg, sdfg_name: name }\n            };\n            this.addContentItem(new_sdfg_config);\n        };\n        this.replaceOrCreate(['new-sdfg'], 'SDFGComponent', JSON.stringify(sdfg), create_sdfg_func);\n\n        const create_codeout_func = () => {\n            const new_codeout_config = {\n                title: \"Generated Code\",\n                type: 'component',\n                componentName: 'CodeOutComponent',\n                componentState: { created: millis(), code: sdfg, sdfg_name: name }\n            };\n            this.addContentItem(new_codeout_config);\n        }\n        if (sdfg.generated_code != undefined) {\n            console.log(\"requesting using ID\", this.project());\n            this.replaceOrCreate(['new-codeout'], 'CodeOutComponent', sdfg, create_codeout_func);\n        }\n    }\n\n    Error_available(error) {\n        const create_error_func = () => {\n            const new_error_config = {\n                title: \"Error\",\n                type: 'component',\n                componentName: 'ErrorComponent',\n                componentState: { error: error }\n            };\n            this.addContentItem(new_error_config);\n        };\n        this.replaceOrCreate(['new-error'], 'ErrorComponent', error, create_error_func);\n    }\n\n    OptGraph_available(optgraph, name = \"\") {\n\n        if (typeof optgraph != \"string\") {\n            optgraph = JSON.stringify(optgraph);\n        }\n\n        // To provide some distinction, milliseconds since epoch are used.\n        const millis = this.getPseudorandom();\n\n        const create_optgraph_func = () => {\n            const new_optgraph_config = {\n                type: \"column\",\n                content: [{\n                    title: name == \"\" ? \"Transformations\" : \"Transformations for `\" + name + \"`\",\n                    type: 'component',\n                    componentName: 'AvailableTransformationsComponent',\n                    componentState: { created: millis, for_sdfg: name, optgraph_data: optgraph }\n                }]\n            };\n            this.addContentItem(new_optgraph_config);\n        };\n        this.replaceOrCreate(['new-optgraph-' + name], 'AvailableTransformationsComponent',\n            optgraph, create_optgraph_func);\n\n        const create_history_func = () => {\n            const new_optgraph_config = {\n                type: \"column\",\n                content: [{\n                    title: \"History\",\n                    type: 'component',\n                    componentName: 'TransformationHistoryComponent',\n                    componentState: { created: millis, for_sdfg: name }\n                }]\n            };\n            this.addContentItem(new_optgraph_config);\n        };\n        this.replaceOrCreate(['new-history-' + name], 'TransformationHistoryComponent',\n            optgraph, create_history_func);\n\n    }\n\n    OptGraphs_available(optgraph) {\n        let o = optgraph;\n        if (typeof (o) == \"string\") {\n            o = JSON.parse(optgraph);\n        }\n\n        for (const x of Object.keys(o)) {\n            const elem = o[x];\n            this.OptGraph_available(elem, x);\n        }\n    }\n\n    gatherProjectElementsAndCompile(calling_context, direct_passing = {}, options = {},\n        on_success = undefined, on_failure = undefined) {\n        /*\n            This method collects all available elements that can be used for compilation.\n\n            direct_passing: Elements that do not have to be requested, but are available at call time\n                .code:          Input code\n                .sdfg_props:    SDFG properties deviating from default or changed\n                .optpath:       Optimization path to be applied\n\n            options\n                .run:           If set to true, the Program is run after compilation\n                .no_optgraph:   If set to true, the optgraph is not updated/created\n                .term_id        The terminal identifier (if output should be shown), required when run is `true`\n                .sdfg_over_code Use the existing SDFG-Serialization if available instead of recompiling from source\n                .collect_cb     If set, the collected elements are passed to this function\n                .dry_run        If `true`, no operation is passed to the server. This is useful when collecting elements for e.g. saving.\n        */\n\n        const code = direct_passing.code;\n        const sdfg_props = direct_passing.sdfg_props;\n        const optpath = direct_passing.optpath;\n\n        const reqlist = [];\n        if (code === undefined) {\n            if (options.sdfg_over_code) {\n                reqlist.push('sdfg_object');\n            }\n            reqlist.push('input_code');\n        }\n\n        if (optpath === undefined) reqlist.push('optpath');\n        /*if(optpath != undefined) {\n            optpath = undefined;\n            reqlist.push('optpath');\n        }*/\n\n\n        const on_collected = (values) => {\n            if (code != undefined) values['input_code'] = code;\n            if (sdfg_props != undefined) values['sdfg_props'] = sdfg_props;\n            if (optpath != undefined) values['optpath'] = optpath;\n\n            if (options.collect_cb != undefined)\n                options.collect_cb(values);\n\n            if (options.dry_run === true)\n                return;\n\n            let cis = values['sdfg_object'] != undefined;\n            let cval = values['input_code'];\n\n            // Assuming SDFG files start with {\n            if (!cis && cval[0] == '{') {\n                const sd = parse_sdfg(cval);\n                values['sdfg_object'] = {};\n                values['sdfg_object'][sd.attributes.name] = cval;\n\n                cis = true;\n            }\n\n            if (cis) {\n                cval = values['sdfg_object'];\n                if (typeof (cval) == 'string')\n                    cval = parse_sdfg(cval);\n            }\n\n            calling_context.project().request([\"clear-errors\"], () => {\n            });\n\n            if (options.run === true) {\n                const runopts = {};\n                if (options['perfmodes']) {\n                    runopts['perfmodes'] = options['perfmodes'];\n                }\n                runopts['repetitions'] = 5; // TODO(later): Allow users to configure number\n                runopts['code_is_sdfg'] = cis;\n                runopts['runnercode'] = values['input_code'];\n                this.compile_and_run(calling_context, options.term_id, cval, values['optpath'], values['sdfg_props'], runopts, on_success, on_failure);\n            } else {\n                let cb = (resp) => {\n                    this.replaceOrCreate(['extend-optgraph'], 'AvailableTransformationsComponent', resp, (_) => {\n                        this.OptGraphs_available(resp);\n                    });\n                };\n                if (options['no_optgraph'] === true) {\n                    cb = undefined;\n                }\n\n                this.compile(calling_context, cval, values['optpath'], values['sdfg_props'],\n                    {\n                        optpath_cb: cb,\n                        code_is_sdfg: cis,\n                    }, on_success, on_failure);\n\n            }\n        }\n\n        calling_context.project().request(reqlist, on_collected, { timeout: 500, on_timeout: on_collected });\n    }\n\n    compile(calling_context, code, optpath = undefined, sdfg_node_properties = undefined, options = {},\n        on_success = undefined, on_failure = undefined) {\n        /*\n            options:\n                .code_is_sdfg: If true, the code parameter is treated as a serialized SDFG\n                .runnercode: [opt] Provides the python code used to invoke the SDFG program if needed\n        */\n        let post_params = {};\n        if (options.code_is_sdfg === true) {\n            post_params = { \"sdfg\": stringify_sdfg(code) };\n\n            post_params['code'] = options.runnercode;\n        } else {\n            post_params = { \"code\": code };\n        }\n\n        if (optpath != undefined) {\n            post_params['optpath'] = optpath;\n        }\n        if (sdfg_node_properties != undefined) {\n            post_params['sdfg_props'] = sdfg_node_properties;\n        }\n        post_params['client_id'] = this.getClientID();\n        const version_string = \"1.0\";\n        REST_request(\"/dace/api/v\" + version_string + \"/compile/dace\", post_params, (xhr) => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n\n                const peek = parse_sdfg(xhr.response);\n                if (peek['error'] != undefined) {\n                    // There was at least one error - handle all of them\n                    this.handleErrors(calling_context, peek);\n                    if (on_failure !== undefined)\n                        on_failure();\n                } else {\n                    // Data is no longer stale\n                    this.removeStaleDataButton();\n\n                    const o = parse_sdfg(xhr.response);\n                    this.multiple_SDFGs_available(xhr.response);\n                    if (options.optpath_cb === undefined) {\n                        this.OptGraphs_available(o['compounds']);\n                    } else {\n                        options.optpath_cb(o['compounds']);\n                    }\n                    if (on_success !== undefined)\n                        on_success();\n                }\n            }\n        });\n    }\n\n    handleErrors(calling_context, object) {\n        let errors = object['error'];\n        if ('traceback' in object)\n            errors += '\\n\\n' + object.traceback;\n\n        this.Error_available(errors);\n\n        if (typeof (errors) == \"string\") {\n            console.warn(\"Error: \", errors);\n            //alert(JSON.stringify(errors));\n            return;\n        }\n        for (const error of errors) {\n\n            if (error.type === \"SyntaxError\") {\n                // This error is most likely caused exclusively by input code\n\n                calling_context.project().request(['new_error'], msg => {\n                },\n                    {\n                        params: error,\n                        timeout: 100,\n                    });\n            } else {\n                console.warn(\"Error: \", error);\n                //alert(JSON.stringify(error));\n            }\n        }\n    }\n\n    ui_compile_and_run(calling_context) {\n\n        const millis = this.getPseudorandom();\n\n        const terminal_identifier = \"terminal_\" + millis;\n\n        // create a new terminal\n        const terminal_config = {\n            title: \"Terminal\",\n            type: 'component',\n            componentName: 'TerminalComponent',\n            componentState: { created: millis }\n        };\n        this.addContentItem(terminal_config);\n\n\n        this.gatherProjectElementsAndCompile(this, {}, { run: true, term_id: terminal_identifier, sdfg_over_code: true });\n    }\n\n    load_perfdata() {\n        this.showIndeterminateLoading();\n        const client_id = this.getClientID();\n\n\n        const post_params = {\n            client_id: client_id\n        };\n        REST_request(\"/dace/api/v1.0/perfdata/get/\", post_params, (xhr) => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n                const pd = JSON.parse(xhr.response);\n                console.log(\"Got result\", pd);\n\n                const ondone = () => {\n                    this.hideIndeterminateLoading();\n                };\n\n                this.project().request(['draw-perfinfo'], x => {\n                    ondone();\n                }, {\n                    params: pd,\n                    on_timeout: ondone\n                });\n            }\n        });\n    }\n\n    show_exec_times() {\n        const config = {\n            type: 'component',\n            componentName: 'PerfTimesComponent',\n            componentState: {},\n            title: \"Execution times\",\n        };\n\n        this.addContentItem(config);\n    }\n\n    show_run_options(calling_context) {\n        const newconf = {\n            type: \"component\",\n            componentName: \"RunConfigComponent\",\n            title: \"Run Configuration\"\n        };\n\n        this.addContentItem(newconf);\n    }\n\n    show_inst_options(calling_context) {\n        const newconf = {\n            type: \"component\",\n            componentName: \"InstControlComponent\",\n            title: \"Instrumentation control\"\n        };\n\n        this.addContentItem(newconf);\n    }\n\n    show_roofline(calling_context) {\n        const newconf = {\n            type: \"component\",\n            componentName: \"RooflineComponent\",\n            title: \"Roofline\"\n        };\n\n        this.addContentItem(newconf);\n    }\n\n    compile_and_run(calling_context, terminal_identifier, code, optpath = undefined,\n        sdfg_node_properties = undefined, options = {}, on_success = undefined,\n        on_failure = undefined) {\n        /*\n            .runnercode: [opt] Code provided with SDFG to invoke the SDFG program. \n        */\n        let post_params = {};\n        if (options.code_is_sdfg === true) {\n            post_params = { \"sdfg\": stringify_sdfg(code) };\n            post_params['code'] = options.runnercode;\n        } else {\n            post_params = { \"code\": code };\n        }\n        if (optpath != undefined) {\n            post_params['optpath'] = optpath;\n        }\n        if (sdfg_node_properties != undefined) {\n            post_params['sdfg_props'] = sdfg_node_properties;\n        }\n        this.applyCurrentRunConfig().then((remaining_settings) => {\n            const client_id = this.getClientID();\n            post_params['client_id'] = client_id;\n            if (remaining_settings['Instrumentation'] == 'off') {\n                post_params['perfmodes'] = undefined;\n            } else if (remaining_settings['Instrumentation'] == 'minimal') {\n                post_params['perfmodes'] = [\"default\"];\n            } else if (remaining_settings['Instrumentation'] == 'full') {\n                post_params['perfmodes'] = [\"default\", \"vectorize\", \"memop\", \"cacheop\"];\n            } else {\n                alert(\"Error! Check console\");\n                console.error(\"Unknown instrumentation mode\", remaining_settings['Instrumentation']);\n                if (on_failure !== undefined) on_failure();\n                return;\n            }\n            //post_params['perfmodes'] = [\"default\", \"vectorize\", \"memop\", \"cacheop\"];\n            let not = remaining_settings['Number of threads'];\n            if (typeof (not) == \"string\") {\n                not = JSON.parse(not);\n            }\n            post_params['corecounts'] = not.map(x => parseInt(x));\n            post_params['repetitions'] = 5; // TODO(later): Allow users to configure number\n            //post_params['corecounts'] = [1,2,3,4];\n            const version_string = \"1.0\";\n            REST_request(\"/dace/api/v\" + version_string + \"/run/\", post_params, (xhr) => {\n                if (xhr.readyState === 4 && xhr.status === 200) {\n\n                    let tmp = xhr.response;\n                    if (typeof (tmp) == 'string') tmp = JSON.parse(tmp);\n                    if (tmp['error']) {\n                        // Normal, users should poll on a different channel now.\n                        this.display_current_execution_status(calling_context, terminal_identifier, client_id);\n                        if (on_failure !== undefined)\n                            on_failure();\n                    } else if (on_success !== undefined)\n                        on_success();\n                }\n            });\n        });\n    }\n\n    display_current_execution_status(calling_context, terminal_identifier, client_id, perf_mode = undefined) {\n        const post_params = {};\n        post_params['client_id'] = client_id;\n        post_params['perf_mode'] = perf_mode;\n        const version_string = \"1.0\";\n        REST_request(\"/dace/api/v\" + version_string + \"/run/status/\", post_params, (xhr) => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n                // Show success/error depending on the exit code\n                if (xhr.response.endsWith(\" 0\"))\n                    this.toast(\"Execution ended\", \"Run ended successfully\", 'info');\n                else\n                    this.toast(\"Execution ended\", \"Run failed\", 'error');\n\n                // Flush remaining outputs\n                const newdata = xhr.response.substr(xhr.seenBytes);\n                this.goldenlayout.eventHub.emit(terminal_identifier, newdata);\n                xhr.seenBytes = xhr.responseText.length;\n            }\n            if (xhr.readyState === 3) {\n                const newdata = xhr.response.substr(xhr.seenBytes);\n                this.goldenlayout.eventHub.emit(terminal_identifier, newdata);\n                xhr.seenBytes = xhr.responseText.length;\n            }\n        });\n    }\n\n    toast(title, text, type = 'info', timeout = 10000, icon = undefined, callback = undefined) {\n        const toast = VanillaToasts.create({\n            title: title,\n            text: text,\n            type: type, // #TODO: Maybe add check for exit codes as well? (to show success/error)\n            icon: icon,\n            timeout: timeout,\n            callback: callback\n        });\n\n        VanillaToasts.setTimeout(toast.id, timeout * 1.1);\n    }\n\n    optimize(calling_context, optpath) {\n        // The calling_context might be necessary when multiple, different programs are allowed\n\n        if (optpath === undefined) {\n            optpath = [];\n        }\n        const transthis = this;\n\n        const on_data_available = (code_data, sdfgprop_data, from_code) => {\n            let code = null;\n            if (from_code) {\n                code = code_data;\n            } else {\n                code = code_data;\n            }\n\n            let props = null;\n            if (sdfgprop_data != undefined)\n                props = sdfgprop_data.sdfg_props;\n            else\n                props = undefined;\n\n            const cb = (resp) => {\n                transthis.replaceOrCreate(['extend-optgraph'], 'AvailableTransformationsComponent', resp, (_) => {\n                    transthis.OptGraphs_available(resp);\n                });\n            };\n\n            transthis.compile(calling_context, code, optpath, props, {\n                optpath_cb: cb,\n                code_is_sdfg: !from_code\n            });\n\n        }\n\n\n        calling_context.project().request(['input_code', 'sdfg_object'], (data) => {\n\n            let from_code = true;\n            if (data['sdfg_object'] != undefined) {\n                from_code = false;\n                data = data['sdfg_object'];\n                data = JSON.parse(data);\n            } else {\n                data = data['input_code'];\n            }\n            on_data_available(data, undefined, from_code);\n\n        });\n    }\n\n    /*\n        Tries to talk to a pre-existing element to replace the contents.\n        If the addressed element does not exist, a new element is created.\n    */\n    replaceOrCreate(replace_request, window_name, replace_params, recreate_func) {\n        let open_windows = null;\n        if (this.goldenlayout.root)\n            open_windows = this.goldenlayout.root.getItemsByFilter(x => (x.config.type == \"component\" &&\n                x.componentName == window_name));\n\n        if (open_windows && open_windows.length > 0) {  // Replace\n            this.getCurrentProject().request(replace_request, (resp, tid) => {\n            },\n                {\n                    timeout: null,\n                    params: replace_params,\n                    timeout_id: null\n                });\n        } else {  // Create\n            recreate_func(replace_params);\n        }\n    }\n\n    /*\n        This function is used for debouncing, i.e. holding a task for a small amount of time\n        such that it can be replaced with a newer function call which would otherwise get queued.\n    */\n    debounce(group, func, timeout) {\n\n        if (this._debouncing === undefined) {\n            // The diode parent object was not created. The function cannot be debounced in this case.\n            return func;\n        }\n        const transthis = this;\n        const debounced = function () {\n            if (transthis._debouncing[group] !== undefined) {\n                clearTimeout(transthis._debouncing[group]);\n            }\n            transthis._debouncing[group] = setTimeout(func, timeout);\n        };\n\n        return debounced;\n    }\n\n    static editorTheme() {\n        const theme = localStorage.getItem('diode_ace_editor_theme');\n        if (theme === null) {\n            return \"github\";\n        }\n        return theme;\n    }\n\n    static themeString() {\n        return \"ace/theme/\" + DIODE.editorTheme();\n    }\n\n    static loadTheme() {\n        return $.getScript(\"external_lib/ace/theme-\" + DIODE.editorTheme() + \".js\");\n    }\n\n    static setTheme(name) {\n        localStorage.setItem('diode_ace_editor_theme', name);\n    }\n\n    static recompileOnPropertyChange() {\n        // Set a tendency towards 'false' \n        return localStorage.getItem('diode_recompile_on_prop_change') == \"true\";\n    }\n\n    static setRecompileOnPropertyChange(boolean_value) {\n        if (boolean_value) {\n            localStorage.setItem('diode_recompile_on_prop_change', \"true\");\n        } else {\n            localStorage.setItem('diode_recompile_on_prop_change', \"false\");\n        }\n    }\n\n    static setDebugDevMode(boolean_value) {\n        if (boolean_value) {\n            localStorage.setItem('diode_DebugDevMode', \"true\");\n        } else {\n            localStorage.setItem('diode_DebugDevMode', \"false\");\n        }\n    }\n\n    static debugDevMode() {\n        /*\n            The DebugDev mode determines if internal, not-crucial-for-user properties are shown.\n        */\n        const v = localStorage.getItem(\"diode_DebugDevMode\");\n        return v === \"true\";\n    }\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport class Appearance {\n\n    constructor(config) {\n        if (config === null) {\n            config = {};\n            config.style = Appearance.default();\n        }\n        if (typeof (config) == 'string')\n            config = JSON.parse(config);\n\n\n        this._change_callback = null;\n        this._config = config;\n        this.insertStylesheet(config.style);\n\n        this._constructor_values = {};\n        if (config.vals != undefined) {\n            this._constructor_values = config.vals;\n        }\n    }\n\n    static getClassProperties(cssclassname) {\n        const elem = document.createElement('div');\n        elem.classList = cssclassname;\n        elem.style = \"width: 0; height: 0;\";\n        document.body.appendChild(elem);\n\n        const style = JSON.parse(JSON.stringify(window.getComputedStyle(elem)));\n        document.body.removeChild(elem);\n\n        return style;\n    }\n\n\n    static fonts() {\n        return [\n            \"Georgia\", \"Palatino\", \"Times\",\n            \"Arial\", \"ArialBlack\", \"ComicSans\", \"Impact\", \"Lucida\", \"Tahoma\", \"Trebuchet\", \"Verdana\",\n            \"Courier\", \"LucidaConsole\"\n        ];\n    }\n\n    static font(shortname) {\n        switch (shortname) {\n            // Serif\n            case \"Georgia\": return 'Georgia, serif';\n            case \"Palatino\": return '\"Palatino Linotype\", \"Book Antiqua\", Palatino, serif';\n            case \"Times\": return '\"Times New Roman\", Times, serif';\n\n            // Sans-Serif\n            case \"Arial\": return \"Arial, Helvetica, sans-serif\";\n            case \"ArialBlack\": return '\"Arial Black\", Gadget, sans-serif';\n            case \"ComicSans\": return '\"Comic Sans MS\", cursive, sans-serif';\n            case \"Impact\": return 'Impact, Charcoal, sans-serif';\n            case \"Lucida\": return '\"Lucida Sans Unicode\", \"Lucida Grande\", sans-serif';\n            case \"Tahoma\": return 'Tahoma, Geneva, sans-serif';\n            case \"Trebuchet\": return '\"Trebuchet MS\", Helvetica, sans-serif';\n            case \"Verdana\": return 'Verdana, Geneva, sans-serif';\n\n            // Monospace\n            case \"Courier\": return '\"Courier New\", Courier, monospace';\n            case \"LucidaConsole\": return '\"Lucida Console\", Monaco, monospace';\n\n            default: throw \"Unknown font (not websafe?)\"\n        }\n    }\n\n    setOnChange(func) {\n        this._change_callback = func;\n    }\n\n    setChanged() {\n        if (this._change_callback != null) {\n            this._change_callback(this);\n        }\n    }\n\n    apply() {\n        this.insertStylesheet(this.getCSS());\n    }\n\n    insertStylesheet(stylestring) {\n\n        // This function does work in all browsers but IE (<= 8).\n        let stylesheet = document.getElementById(\"appearance-stylesheet\");\n        let update = true;\n        if (stylesheet == null || stylesheet == undefined) {\n            stylesheet = document.createElement('style');\n            update = false;\n            stylesheet.id = \"appearance-stylesheet\";\n            stylesheet.type = \"text/css\";\n        }\n\n        stylesheet.innerText = stylestring;\n\n        if (!update) {\n            document.head.appendChild(stylesheet);\n        }\n\n        this.setChanged();\n    }\n\n    setValue(css_type, css_value) {\n        this._constructor_values[css_type] = css_value;\n        return this;\n    }\n    setFont(shortname) {\n        const f = Appearance.font(shortname);\n        this._constructor_values['font-family'] = f;\n        return this;\n    }\n\n    toString() {\n        return JSON.stringify(this._config);\n    }\n\n    getCSS() {\n        let inner = \"\";\n\n        for (const x of Object.entries(this._constructor_values)) {\n            inner += x[0] + \": \" + x[1] + \";\";\n        }\n\n        let ret = \".diode_appearance { \";\n        ret += inner;\n        ret += \"}\";\n\n        // Since the lm_content overrides the background, we re-override the background\n        // Note that this is legal and works because local <style></style> always overrides imports from other files\n        ret += \".lm_content { \";\n        ret += inner;\n        ret += \"}\";\n        return ret;\n    }\n\n    toStorable() {\n        return {\n            style: this.getCSS(),\n            vals: this._constructor_values\n        };\n    }\n\n    setFromAceEditorTheme(theme_name) {\n        /*\n            Sets background and foreground according to the theme identifed by `theme_name`\n            Note: The css class selector used to determine current values is: '.ace-' + `theme_name`\n        */\n\n        const s = Appearance.getClassProperties(\"ace-\" + theme_name);\n\n        const bgc = s['background-color'];\n        const bg = s['background'];\n        if (bgc) this.setValue('background-color', bgc);\n        if (bg) this.setValue('background', bg + \" !important\");\n        this.setValue('color', s['color']);\n\n        this.insertStylesheet(this.getCSS());\n    }\n\n    static default() {\n        /*\n            Builds a default configuration\n        */\n        const cssstring = `\n        .diode_appearance {\n            font-family: ` + Appearance.font('Arial') + `\n        }\n        `;\n\n\n        return cssstring;\n    }\n\n}\n","/*\nCoordinates windows belonging to the same project.\n\n*/\nexport class DIODE_Project {\n    constructor(diode, project_id = undefined) {\n        this._diode = diode;\n        if (project_id === undefined || project_id === null) {\n            this._project_id = diode.getPseudorandom();\n        } else {\n            this._project_id = project_id;\n        }\n        this.setup();\n        this._callback = null;\n        this._rcvbuf = {};\n        this._waiter = {};\n\n        this._listeners = {};\n\n        this._closed_windows = [];\n\n        this._blob = null;\n    }\n\n    clearTransformationHistory() {\n        // Reset transformation history\n        sessionStorage.removeItem(\"transformation_snapshots\");\n    }\n\n    getTransformationSnapshots() {\n        let sdata = sessionStorage.getItem(\"transformation_snapshots\");\n        if (sdata == null) {\n            sdata = [];\n        } else\n            sdata = JSON.parse(sdata);\n\n        return sdata;\n    }\n\n    getTransformationHistory() {\n        const sdata = this.getTransformationSnapshots();\n        return sdata.map(x => x[0]);\n    }\n\n    discardTransformationsAfter(index) {\n        const sdata = this.getTransformationSnapshots();\n\n        // Cut the tail off and resave\n        sessionStorage.setItem(\"transformation_snapshots\", JSON.stringify(sdata.slice(0, index)));\n        // Send the update notification\n        this.request(['update-tfh'], x => x, {});\n    }\n\n    saveSnapshot(sdfgs, changing_transformation) {\n        /*\n            Saves the current snapshot, defined by sdfgs and the current (new) transformation.\n\n        */\n\n        const sdata = this.getTransformationSnapshots();\n        sdata.push([changing_transformation, sdfgs]);\n        sessionStorage.setItem(\"transformation_snapshots\", JSON.stringify(sdata));\n    }\n\n    reopenClosedWindow(name) {\n        const window = this.getConfigForClosedWindow(name, true);\n        this._diode.addContentItem(window);\n\n        // Emit the reopen event\n        this._diode.goldenlayout.eventHub.emit('window-reopened-' + name);\n    }\n\n    getConfigForClosedWindow(name, remove = true) {\n        const list = this.getClosedWindowsList();\n        const new_list = [];\n\n        const rets = [];\n\n        for (const x of list) {\n            const cname = x[0];\n            const state = x[1];\n\n            if (state.created === name) {\n                // Found the requested element\n\n                rets.push([cname, state]);\n\n                if (remove) {\n                    // Don't put into the new list\n                } else {\n                    new_list.push([cname, state]);\n                }\n            } else {\n                // Not found\n                new_list.push([cname, state]);\n            }\n        }\n\n        // Store back\n        this.setClosedWindowsList(new_list);\n\n        console.assert(rets.length === 1, \"Expected only 1 match!\");\n        const ret = rets[0];\n\n        // Build a config for this\n        const config = {\n            type: 'component',\n            componentName: ret[0],\n            componentState: ret[1]\n        };\n\n        return config;\n    }\n\n    setClosedWindowsList(new_list) {\n        this._closed_windows = new_list;\n        sessionStorage.setItem(this._project_id + \"-closed-window-list\", JSON.stringify(this._closed_windows));\n    }\n\n    clearClosedWindowsList() {\n        this._closed_windows = [];\n\n        sessionStorage.setItem(this._project_id + \"-closed-window-list\", JSON.stringify(this._closed_windows));\n    }\n\n    addToClosedWindowsList(componentName, state) {\n        this._closed_windows = this.getClosedWindowsList();\n        this._closed_windows.push([componentName, state]);\n\n        try {\n            sessionStorage.setItem(this._project_id + \"-closed-window-list\", JSON.stringify(this._closed_windows));\n        } catch (e) {\n            console.error(`Error when adding to closed windows list!`, e);\n            sessionStorage.clear();\n        }\n    }\n\n    getClosedWindowsList() {\n        let tmp = sessionStorage.getItem(this._project_id + \"-closed-window-list\");\n        if (typeof (tmp) === \"string\") {\n            tmp = JSON.parse(tmp);\n        }\n\n        if (tmp === null) {\n            return [];\n        }\n        return tmp;\n    }\n\n    eventString(suffix) {\n        console.assert(this._project_id != null, \"project id valid\");\n        return this._project_id + suffix;\n    }\n\n    startListening(event, id) {\n        const hub = this._diode.goldenlayout.eventHub;\n\n        const transthis = this;\n        const cb = (msg) => {\n            const tmp = transthis._rcvbuf[id][event];\n            if (tmp instanceof Array) {\n                transthis._rcvbuf[id][event].push(msg);\n            } else if (tmp instanceof Object) {\n                Object.assign(transthis._rcvbuf[id][event], msg);\n            } else {\n                transthis._rcvbuf[id][event] = msg;\n            }\n        };\n        const params = [this.eventString(event), cb, this];\n        hub.on(...params);\n\n        this._listeners[id].push(params);\n    }\n\n    stopListening(id) {\n        const hub = this._diode.goldenlayout.eventHub;\n        for (const x of this._listeners[id]) {\n            hub.unbind(...x);\n        }\n        delete this._listeners[id];\n    }\n\n\n    setup() {\n\n    }\n\n    static load(diode, project_name) {\n        const pdata = DIODE_Project.getProjectData(project_name);\n\n        const ret = new DIODE_Project(diode, pdata.project_id);\n\n\n        // For simplicity, we copy the saved config over the current config\n\n        // First, destroy the current layout\n        diode.goldenlayout.destroy();\n\n        // Then, we copy over the config\n        sessionStorage.setItem(\"savedState\", JSON.stringify(pdata.data));\n\n        // ... and the project id\n        sessionStorage.setItem(\"diode_project\", ret._project_id);\n\n        // ... and the transformation snapshots\n        sessionStorage.setItem(\"transformation_snapshots\", JSON.stringify(pdata.snapshots));\n\n        // Reload the page (This will create a new goldenlayout with the specified data)\n        window.location.reload();\n\n        return ret;\n    }\n\n    static getProjectData(project_name) {\n        const pdata = localStorage.getItem(\"project_\" + project_name);\n        if (pdata == null)\n            throw \"Project must exist\";\n\n        return JSON.parse(pdata);\n    }\n\n    static getSavedProjects() {\n        const tmp = localStorage.getItem(\"saved_projects\");\n        if (tmp == null)\n            return [];\n        return JSON.parse(tmp);\n    }\n\n    createblob(data) {\n        const blob = new Blob([data], {\n            type: 'text/plain'\n        });\n\n        // If we are replacing a previously generated file we need to\n        // manually revoke the object URL to avoid memory leaks.\n        if (this._blob !== null) {\n            window.URL.revokeObjectURL(this._blob);\n        }\n\n        this._blob = window.URL.createObjectURL(blob);\n\n        return this._blob;\n    }\n\n    save() {\n        // Save current open file as SDFG\n        this.request(['sdfg_object'], x => {\n            let sdfg = x.sdfg_object;\n            let filename = null;\n            if (typeof (sdfg) != 'string') {\n                filename = Object.keys(x.sdfg_object)[0];\n                sdfg = stringify_sdfg(Object.values(x.sdfg_object)[0]);\n            } else {\n                const sdfg_obj = parse_sdfg(sdfg);\n                filename = sdfg_obj.attributes.name;\n            }\n            filename += '.sdfg';\n\n            const link = document.createElement('a');\n            link.setAttribute('download', filename);\n            link.href = this.createblob(sdfg);\n            document.body.appendChild(link);\n            // wait for the link to be added to the document\n            window.requestAnimationFrame(() => {\n                const event = new MouseEvent('click');\n                link.dispatchEvent(event);\n                document.body.removeChild(link);\n            });\n        });\n    }\n\n    request(list, callback, options = {}) {\n        /*\n            options:\n                timeout: Number                 ms to wait until on_timeout is called\n                on_timeout: [opt] Function      Function called on timeout\n                params: [opt] object            Parameters to pass with the request\n        */\n        const tmp = new DIODE_Project(this._diode, this._project_id);\n        return tmp.__impl_request(list, callback, options);\n    }\n\n    __impl_request(list, callback, options = {}) {\n        /*\n            options:\n                timeout: Number                 ms to wait until on_timeout is called\n                on_timeout: [opt] Function      Function called on timeout\n                params: [opt] object            Parameters to pass with the request\n        */\n        this._callback = callback;\n        const params = options.params;\n        const reqid = \"id\" + this._diode.getPseudorandom();\n        // Clear potentially stale values\n        this._rcvbuf[reqid] = {};\n        this._listeners[reqid] = [];\n        for (const x of list) {\n            this.startListening(x, reqid);\n            this._diode.goldenlayout.eventHub.emit(this.eventString(\"-req-\" + x), params, this);\n        }\n\n        const transthis = this;\n        const interval_step = 100;\n        let timeout = options.timeout;\n\n        this._waiter[reqid] = setInterval(() => {\n            let missing = false;\n\n            for (const x of list) {\n                if (!(x in transthis._rcvbuf[reqid])) {\n                    missing = true;\n                    break;\n                }\n            }\n            if (!missing) {\n                clearInterval(transthis._waiter[reqid]);\n                transthis.stopListening(reqid);\n                transthis._waiter[reqid] = null;\n                const tmp = transthis._rcvbuf[reqid];\n                delete transthis._rcvbuf[reqid];\n                return transthis._callback(tmp, options.timeout_id);\n            } else if (timeout !== null) {\n                timeout -= interval_step;\n                if (timeout <= 0) {\n                    // Timed out - fail silently\n                    clearInterval(transthis._waiter[reqid]);\n                    transthis.stopListening(reqid);\n                    if (options.on_timeout != undefined) {\n                        options.on_timeout(transthis._rcvbuf[reqid]);\n                    }\n                    transthis._waiter[reqid] = null;\n                    delete transthis._rcvbuf[reqid];\n                }\n            }\n        }, interval_step);\n    }\n}\n","\nexport class DIODE_Settings {\n    constructor(denormalized = {}) {\n        this.settings_values = denormalized;\n        this.changed = {};\n    }\n\n    load() {\n        // Load the settings from localStorage\n        this.settings_values = window.localStorage.getItem(\"DIODE/Settings/confirmed\");\n        this.changed = window.localStorage.getItem(\"DIODE/Settings/changed\");\n    }\n\n    store() {\n        // Store the settings to localStorage\n        window.localStorage.setItem(\"DIODE/Settings/confirmed\", this.settings_values);\n        window.localStorage.setItem(\"DIODE/Settings/changed\", this.changed);\n    }\n\n    change(setting, value) {\n        this.changed[setting.join('/')] = value;\n    }\n\n    hasChanged() {\n        return this.changed != {};\n    }\n\n    changedValues() {\n        return this.changed;\n    }\n\n    clearChanged() {\n        this.changed = {};\n    }\n\n    values() {\n        return this.settings_values;\n    }\n\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport class TableCategory {\n\n    constructor(table, parent_row) {\n        this._table = table;\n        this._title_row = parent_row;\n        this._cat_rows = [];\n\n        this._title_row.classList.add(\"diode_property_header\");\n\n        this._title_row.addEventListener('click', ev => {\n            for (const x of this._cat_rows) {\n                if (x.style.display == \"none\") {\n                    x.style.display = null;\n                    this._title_row.classList.remove(\"collapsed\");\n                }\n                else {\n                    x.style.display = \"none\";\n                    this._title_row.classList.add(\"collapsed\");\n                }\n            }\n        });\n    }\n\n    addContentRow(row) {\n        this._cat_rows.push(row);\n    }\n\n}\n\n\nexport class Table {\n    constructor() {\n\n        this.init();\n    }\n\n    init() {\n        this._table = document.createElement('table');\n        this._thead = document.createElement('thead');\n        this._tbody = document.createElement('tbody');\n\n        this._table.appendChild(this._thead);\n        this._table.appendChild(this._tbody);\n\n        this._is_collapsed = false;\n    }\n\n    createIn(elem) {\n        elem.appendChild(this._table);\n    }\n\n    setHeaders(...columns) {\n        this._columns = columns;\n\n        this._thead.innerHTML = \"\";\n\n        const tr = document.createElement(\"tr\");\n        for (const x of this._columns) {\n            const th = document.createElement('th');\n            if (typeof (x) === 'string') {\n                th.innerText = x;\n            }\n            else {\n                th.appendChild(x);\n            }\n            tr.appendChild(th);\n        }\n        this._thead.appendChild(tr);\n        return tr;\n    }\n\n    addRow(...columns) {\n\n        const tmp = columns;\n\n        const tr = document.createElement(\"tr\");\n        for (const x of tmp) {\n            const td = document.createElement('td');\n            if (typeof (x) === 'string') {\n                td.innerText = x;\n            }\n            else {\n                td.appendChild(x);\n            }\n            tr.appendChild(td);\n        }\n\n        this._tbody.appendChild(tr);\n        return tr;\n    }\n\n    collapseVertically() {\n        this._table.style.display = \"none\";\n        this._is_collapsed = true;\n    }\n\n    expandVertically() {\n        this._table.style.display = null;\n        this._is_collapsed = false;\n    }\n\n    toggleVertically() {\n        if (this._is_collapsed) {\n            this.expandVertically();\n        }\n        else {\n            this.collapseVertically();\n        }\n    }\n\n    setCSSClass(classname) {\n        this._table.classList = classname;\n    }\n\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport class ValueTreeNode {\n\n    constructor(label, data = null) {\n        this._label = label;\n        this._prev = null;\n        this._data = data;\n        this._children = [];\n\n        this._on_activate = null;\n        this._representative = null;\n    }\n\n    label() { return this._label; }\n    setPathLabel(l) { this._path_label = l; }\n    pathLabel() { if (this._path_label === undefined) return this.label(); else return this._path_label; }\n    data() { return this._data; }\n    children() { return this._children; }\n    parent() { return this._prev; }\n\n    getChild(pred) {\n        for (const x of this.children()) {\n            if (pred(x)) return x;\n\n            const tmp = x.getChild(pred);\n            if (tmp != null) return tmp;\n        }\n        return null;\n    }\n\n    clearChildren() {\n        this._children = [];\n    }\n\n    head() {\n        let it = this;\n        while (it._prev != null) {\n            it = it._prev;\n        }\n        return it;\n    }\n\n    allLabelsInTree() {\n        return this.head().asPreOrderArray(x => x.pathLabel());\n    }\n\n    asPreOrderArray(f = x => x) {\n\n        const ret = [f(this)];\n\n        for (const x of this.children()) {\n            ret.push(...x.asPreOrderArray(f));\n        }\n\n        return ret;\n    }\n\n\n\n    path(map_func = undefined) {\n        let ret = [];\n        if (map_func === undefined) {\n            map_func = current => { return { 'name': current.pathLabel(), 'params': current.data() } };\n        }\n        let current = this;\n        while (current._prev != null) {\n            const e = map_func(current);\n            if (e.name != \" <virtual>\") {\n                // \" <virtual>\" (with the space) is a virtual identifier, i.e. do not include the node in the path\n                ret = [e, ...ret];\n            }\n            current = current._prev;\n        }\n\n        return ret;\n    }\n\n    addNode(label, data = null, options = {}) {\n        /*\n            options:\n                .LabelConflictSameLevel\n                    Function(new_node, labels) => new_node: \n                        Called before every new node is added to the list of children.\n                        Can be used to assign different names on conflict in the same\n                        group of children. (NOT globally!)\n                .LabelConflictGlobal\n                    Function(new_node, allNodeLabels) => new_node:\n                        Called before every new node is added to the list of children.\n                        Can be used to assign different names on conflict over all nodes.\n                        \n        */\n        let new_node = new ValueTreeNode(label, data);\n        new_node._prev = this;\n        if (options.LabelConflictSameLevel != undefined) {\n            new_node = options.LabelConflictSameLevel(new_node, this.children().map(x => x.label()));\n        }\n        if (options.LabelConflictGlobal != undefined) {\n            new_node = options.LabelConflictGlobal(new_node, this.allLabelsInTree());\n        }\n        new_node._prev = this; // Make sure that after potential reordering, the basic order is still enforced\n        this._children.push(new_node);\n        return new_node;\n    }\n\n    setHandler(type, handler) {\n        // type: 'activate'\n        // handler: function (this, level)\n        if (type == \"activate\") {\n            this._on_activate = handler;\n        }\n        else {\n            console.assert(false, \"type \" + type + \" is unknown\");\n        }\n    }\n\n    setRepresentative(obj) {\n        this._representative = obj;\n    }\n\n    representative() { return this._representative; }\n\n    activate(level) {\n        if (this._on_activate != null) {\n            this._on_activate(this, level);\n        }\n    }\n}\n\n/*\nClassic TreeView implementation\n*/\nexport class TreeView {\n    constructor(value_tree_node) {\n        this._tree = value_tree_node;\n        this._debouncing = null;\n    }\n\n    setDebouncing(obj) {\n        this._debouncing = obj;\n    }\n\n    /*\n        parent: Used for parent.append()\n        depth: Depth information - unused\n        node: Overriding the starting node. If undefined, this._tree is used\n    */\n    create_html_in(parent, depth = 0, node = undefined) {\n\n        const current = node === undefined ? this._tree : node;\n\n        const listitem = document.createElement(\"li\");\n        const listitemspan = document.createElement(\"span\");\n        listitemspan.innerText = current.label();\n        listitem.append(listitemspan);\n\n        const nextparent = document.createElement(\"ul\");\n        nextparent.classList.add(\"tree_view\");\n        nextparent.classList.add(\"collapsed_sublist\");\n\n        const onclickfunc = () => {\n            nextparent.classList.toggle(\"collapsed_sublist\");\n            current.activate(1);\n        };\n        const ondblclickfunc = () => {\n            current.activate(2);\n        };\n        let passed_click_func = onclickfunc;\n        let passed_dblclick_func = onclickfunc;\n\n        if (this._debouncing != null) {\n            passed_click_func = this._debouncing.debounce(\"treeview-click\", onclickfunc, 100);\n            passed_dblclick_func = this._debouncing.debounce(\"treeview-click\", ondblclickfunc, 10);\n        }\n        listitem.addEventListener(\"click\", passed_click_func);\n\n        listitem.addEventListener(\"mouseenter\", () => {\n            current.activate(0);\n        });\n        listitem.addEventListener(\"mouseleave\", () => {\n            current.activate(-1);\n        });\n\n        listitem.addEventListener(\"dblclick\", passed_dblclick_func);\n\n        current.setRepresentative(listitem);\n\n\n        nextparent.append(listitem);\n\n        const children = current.children();\n        if (children.length == 0) {\n            // current is a leaf node\n\n        }\n        else {\n            // current is the root of a non-trivial subtree\n            for (const n of children) {\n                this.create_html_in(nextparent, depth + 1, n);\n            }\n        }\n        parent.append(nextparent);\n    }\n\n}\n","import { DIODE_Project } from \"../diode_project\";\n\n\nexport class DIODE_Context {\n    constructor(diode, gl_container, state) {\n        this.diode = diode;\n        this.container = gl_container;\n        this.initial_state = state;\n\n        this.created = state.created;\n        if (this.created == undefined) {\n            this.created = this.diode.getPseudorandom();\n            this.saveToState({ created: this.created });\n        }\n        this._project = null;\n        if (state.project_id != undefined && state.project_id != null && state.project_id != \"null\") {\n            this._project = new DIODE_Project(this.diode, state.project_id);\n        }\n\n        this._event_listeners = [];\n        this._event_listeners_closed = []; // Listeners that are installed on closed windows (NOTE: These are NOT active on open windows)\n\n        this._no_user_destroy = false; // When true, all destroy()-events are assumed to be programmatic\n    }\n\n    project() {\n        console.assert(this._project != null, \"Project invalid\");\n        return this._project;\n    }\n\n    on(name, data, keep_alive_when_closed = false) {\n        const eh = this.diode.goldenlayout.eventHub;\n\n        const params = [name, data];\n        eh.on(...params);\n        this._event_listeners.push(params);\n\n        if (keep_alive_when_closed) {\n            // NOTE: The new function has to be created because the function cannot be identical\n            // (This is, because the handler is removed by (name, function) pairs)\n            this.closed_on(name, (x) => data(x));\n        }\n    }\n\n    // same as on(), but only active when the window is closed (in the closed windows list)\n    closed_on(name, data) {\n\n\n        const params = [name, data];\n        this._event_listeners_closed.push(params);\n    }\n\n    removeClosedWindowEvents() {\n        // This function has to be called when reopening from the closed windows list\n        // DO NOT call inside destroy()!\n        const eh = this.diode.goldenlayout.eventHub;\n        for (const x of this._event_listeners_closed) {\n            eh.unbind(...x);\n        }\n        this._event_listeners_closed = [];\n    }\n\n    destroy() {\n\n        console.log(\"destroying\", this);\n        // Unlink all event listeners\n        const eh = this.diode.goldenlayout.eventHub;\n        for (const x of this._event_listeners) {\n            eh.unbind(...x);\n        }\n        this._event_listeners = [];\n    }\n\n    close() {\n        /*\n            The difference to destroy: close() is called when the USER clicks close,\n            destroy will be called afterwards when the element is actually removed\n        */\n        // Add to closed-windows list\n        console.log(\"closing\", this);\n\n        this.project().addToClosedWindowsList(this.container._config.componentName, this.getState());\n\n        // Install the event listeners to listen when the window is closed\n        const eh = this.diode.goldenlayout.eventHub;\n        for (const params of this._event_listeners_closed) {\n            eh.on(...params);\n        }\n    }\n\n    setupEvents(project) {\n        if (this._project == null) {\n            this._project = project;\n        }\n\n        this.container.extendState({ 'project_id': this._project.eventString('') });\n\n        this.on('destroy-' + this.getState().created, msg => {\n            if (!this._no_user_destroy) {\n                // _might_ be a user destroy - call close\n                this.close();\n            }\n            this.destroy();\n        });\n\n        this.on('enter-programmatic-destroy', msg => {\n            this._no_user_destroy = true;\n            console.log(\"Entering programmatic reordering\", this);\n        });\n        this.on('leave-programmatic-destroy', msg => {\n            this._no_user_destroy = false;\n            console.log(\"Leaving programmatic reordering\", this);\n        });\n\n        this.closed_on('window-reopened-' + this.getState().created, x => {\n            this.removeClosedWindowEvents();\n        });\n    }\n\n    getState() {\n        return this.container.getState();\n    }\n\n    saveToState(dict_value) {\n        this.container.extendState(dict_value);\n    }\n\n    resetState(dict_value = {}) {\n        this.container.setState(dict_value);\n    }\n\n    saveToPersistentState(key, value) {\n        localStorage.setItem(key, value);\n    }\n\n    getPersistentState(key) {\n        return localStorage.getItem(key);\n    }\n}\n","import { REST_request } from \"../../main\";\nimport * as DiodeTables from \"../table\";\nimport { DIODE_Settings } from \"../diode_settings\";\nimport { TreeView, ValueTreeNode } from \"../treeview\";\nimport { DIODE_Context } from \"./context\";\nimport { DIODE } from \"../diode\";\nconst { $ } = globalThis;\n\nexport class DIODE_Context_Settings extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n    }\n\n    settings_change_callback(type, path, value) {\n\n        console.assert(value !== undefined, \"Undefined value\");\n\n        console.log(\"Setting changed\", path, value);\n        this.diode.settings().change(path, value);\n\n        this.set_settings();\n    }\n\n    link_togglable_onclick(element, toToggle) {\n        const toggleclassname = \"collapsed_container\";\n        element.on('click', () => {\n            if (toToggle.hasClass(toggleclassname)) {\n                toToggle.removeClass(toggleclassname);\n            } else {\n                toToggle.addClass(toggleclassname);\n            }\n        });\n    }\n\n    parse_settings2(settings, parent = undefined, path = []) {\n        let is_topmost = false;\n        if (parent === undefined) {\n            parent = new ValueTreeNode(\"Settings\", null);\n            is_topmost = true;\n        }\n\n        let dicts = [];\n        const values = [];\n\n\n        Object.entries(settings).forEach(\n            ([key, value]) => {\n                const meta = value.meta;\n                const val = value.value;\n\n                if (meta.type == 'dict') {\n                    dicts.push([key, value]);\n                } else {\n                    values.push([key, value]);\n                }\n            });\n\n        let settings_lookup = {};\n        // Create the elements that are not in subcategories (=dicts) here\n        const dt = new DiodeTables.Table();\n        {\n            let params = JSON.parse(JSON.stringify(values));\n            params = params.map(x => {\n                const key = x[0];\n                x = x[1];\n                const tmp = x.meta;\n                tmp.value = x.value;\n                tmp.name = tmp.title;\n                tmp.category = \"General\";\n                tmp.key = key;\n                return tmp;\n            });\n\n            let cur_dt = dt;\n\n            let dtc = null;\n            const categories = {};\n            for (const x of params) {\n\n                const cat = x.category;\n                if (categories[cat] == undefined) {\n                    categories[cat] = [];\n                }\n                categories[cat].push(x);\n            }\n            if (!DIODE.debugDevMode()) {\n                delete categories[\"(Debug)\"];\n            }\n            // INSERTED\n            const transthis = {\n                propertyChanged: (path, name, value) => {\n                    console.log(\"PropertyChanged\", path, name, value);\n                    this.settings_change_callback(undefined, path, value);\n                }\n            };\n            // !INSERTED\n            for (const z of Object.entries(categories)) {\n\n                // Sort within category\n                const cat_name = z[0];\n                const y = z[1].sort((a, b) => a.name.localeCompare(b.name));\n\n\n                // Add Category header\n                cur_dt = dt;\n                const sp = document.createElement('span');\n                sp.innerText = cat_name;\n                const tr = cur_dt.addRow(sp);\n                tr.childNodes[0].colSpan = \"2\";\n\n                dtc = new DiodeTables.TableCategory(cur_dt, tr);\n\n                for (const x of y) {\n\n                    settings_lookup[path] = x.value;\n\n                    const value_part = diode.getMatchingInput(transthis, x, [...path, x.key]);\n                    const cr = cur_dt.addRow(x.name, value_part);\n                    if (dtc != null) {\n                        dtc.addContentRow(cr);\n                    }\n                }\n            }\n            dt.setCSSClass(\"diode_property_table\");\n        }\n        // Link handlers\n        parent.setHandler(\"activate\", (node, level) => {\n            if (level == 1) {\n                const repr = node.representative();\n                // Clear all selections in this tree\n                node.head().asPreOrderArray(x => x.representative()).forEach(x => x.classList.remove(\"selected\"));\n                repr.classList.add(\"selected\");\n                const cont = $(\"#diode_settings_props_container\")[0];\n                cont.innerHTML = \"\";\n                dt.createIn(cont);\n            }\n        });\n\n        // Recurse into (sorted) dicts\n        dicts = dicts.sort((a, b) => a[1].meta.title.localeCompare(b[1].meta.title));\n\n        for (let d of dicts) {\n            const key = d[0];\n            d = d[1];\n            const setting_path = path.concat(key);\n            // Create the list element first\n            const newparent = parent.addNode(d.meta.title, null);\n            // The representative DOM node does not exist yet - add hints after half a second.\n            setTimeout(() => newparent.representative().title = d.meta.description, 500);\n\n            // Recurse\n            console.log(\"Setting path\", setting_path);\n            const tmp = this.parse_settings2(d.value, newparent, setting_path);\n            settings_lookup = { ...settings_lookup, ...tmp };\n        }\n\n        if (is_topmost) {\n            const _tree = new TreeView(parent);\n            _tree.create_html_in($(\"#diode_settings_container\")[0]);\n        }\n        return settings_lookup;\n    }\n\n    get_settings() {\n        const post_params = {\n            client_id: this.diode.getClientID()\n        };\n        REST_request(\"/dace/api/v1.0/preferences/get\", post_params, (xhr) => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n                const settings = this.parse_settings2(JSON.parse(xhr.response));\n\n                this.diode._settings = new DIODE_Settings(settings);\n                //this.diode._settings = null;\n            }\n        });\n    }\n\n    set_settings() {\n        if (!this.diode.settings().hasChanged()) {\n            // Do not update if nothing has changed\n            return;\n        }\n        // Find settings that changed and write them back\n        const changed_values = this.diode.settings().changedValues();\n        this.saveToState({\n            \"changed\": changed_values,\n            \"confirmed\": this.diode.settings().values()\n        });\n        // #TODO: Maybe only update when a \"save\"-Button is clicked?\n        const transthis = this;\n        const client_id = this.diode.getClientID();\n        const post_params = changed_values;\n        post_params['client_id'] = client_id;\n        // Debounce\n        const debounced = this.diode.debounce(\"settings-changed\", function () {\n\n            REST_request(\"/dace/api/v1.0/preferences/set\", post_params, (xhr) => {\n                if (xhr.readyState === 4 && xhr.status === 200) {\n                    transthis.diode.settings().clearChanged();\n                    this.diode.toast(\"Settings changed\", \"The changed settings were applied at remote server\", \"info\", 3000);\n                }\n            });\n        }, 1000);\n        debounced();\n    }\n}\n","import { REST_request, FormBuilder } from \"../../main\";\nimport { Appearance } from \"../diode_appearance\";\nimport { DIODE_Context } from \"./context\";\nimport { DIODE } from \"../diode\";\n\n\nexport class DIODE_Context_DIODESettings extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n        this._settings_container = null;\n\n        this._editor_themes = this.getThemes();\n    }\n\n    getThemes() {\n        REST_request('/dace/api/v1.0/diode/themes', undefined, xhr => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n                this._editor_themes = JSON.parse(xhr.response);\n                console.log(\"Got editor themes\", this._editor_themes);\n\n                this.create();\n            }\n        }, \"GET\");\n    }\n\n    themeNames() {\n        return this._editor_themes.map(x => x.substr(\"theme-\".length).slice(0, -3));\n    }\n\n    setContainer(elem) {\n        this._settings_container = elem;\n    }\n\n    create() {\n        // Editor theme\n        {\n            const cont = FormBuilder.createContainer(undefined);\n            const label = FormBuilder.createLabel(undefined, \"editor theme\", \"Sets the ace editor theme\");\n            const theme_names = this.themeNames();\n            const input = FormBuilder.createSelectInput(undefined, x => {\n                const val = x.value;\n\n                DIODE.setTheme(val);\n                DIODE.loadTheme().then(x => {\n                    this.diode._appearance.setFromAceEditorTheme(val);\n                }\n                );\n            }, theme_names, DIODE.editorTheme());\n\n            cont.append(label);\n            cont.append(input);\n\n            this._settings_container.append(cont);\n        }\n        // Auto-Compile\n        {\n            const cont = FormBuilder.createContainer(undefined);\n            const label = FormBuilder.createLabel(undefined, \"Compile on property change\", \"When false, the program is not recompiled after a property change\");\n\n            const input = FormBuilder.createToggleSwitch(undefined, x => {\n                const val = x.checked;\n                DIODE.setRecompileOnPropertyChange(val);\n            }, DIODE.recompileOnPropertyChange());\n\n            cont.append(label);\n            cont.append(input);\n\n            this._settings_container.append(cont);\n        }\n        // (Debug) mode\n        {\n            const cont = FormBuilder.createContainer(undefined);\n            const label = FormBuilder.createLabel(undefined, \"DaCe Debug mode\", \"When true, the program shows elements primarily useful for debugging and developing DaCe/DIODE.\");\n\n            const input = FormBuilder.createToggleSwitch(undefined, x => {\n                const val = x.checked;\n                DIODE.setDebugDevMode(val);\n            }, DIODE.debugDevMode());\n\n            cont.append(label);\n            cont.append(input);\n\n            this._settings_container.append(cont);\n        }\n        // UI font\n        {\n            const cont = FormBuilder.createContainer(undefined);\n            const label = FormBuilder.createLabel(undefined, \"UI Font\", \"Select the font used in the UI (does not affect code panes and SDFG renderers)\");\n\n            const current = Appearance.getClassProperties(\"diode_appearance\")['fontFamily'];\n\n            const input = FormBuilder.createSelectInput(undefined, x => {\n                const val = x.value;\n\n                this.diode._appearance.setFont(val);\n                this.diode._appearance.apply();\n            }, Appearance.fonts(), current);\n\n            cont.append(label);\n            cont.append(input);\n\n            this._settings_container.append(cont);\n        }\n    }\n\n}\n","import { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_CodeIn extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n        this.editor = null;\n        this._terminal_identifer = null;\n\n        this._markers = [];\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const transthis = this;\n\n        const eh = this.diode.goldenlayout.eventHub;\n        this.on(this._project.eventString('-req-input_code'), (msg) => {\n            // Echo with data\n            setTimeout(() => eh.emit(transthis._project.eventString('input_code'), this.getState()['code_content']), 1);\n            transthis.editor.clearSelection();\n        }, true);\n\n        this.on(this.project().eventString('-req-new_error'), msg => {\n            // Echo with data\n            setTimeout(() => eh.emit(transthis._project.eventString('new_error'), 'ok'), 1);\n            this.highlight_error(msg);\n        });\n\n        this.on(this.project().eventString('-req-highlight-code'), msg => {\n            setTimeout(() => eh.emit(transthis._project.eventString('highlight-code'), 'ok'), 1);\n            this.highlight_code(msg);\n        });\n\n        this.on(this.project().eventString('-req-set-inputcode'), msg => {\n            setTimeout(() => eh.emit(transthis._project.eventString('set-inputcode'), 'ok'), 1);\n\n            this.editor.setValue(msg);\n            this.editor.clearSelection();\n        });\n\n        this.on(this.project().eventString('-req-clear-errors'), msg => {\n            setTimeout(() => eh.emit(transthis._project.eventString('clear-errors'), 'ok'), 1);\n            this.clearErrors();\n        });\n\n    }\n\n    highlight_code(dbg_info) {\n        const s_c = dbg_info.start_col;\n        let e_c = dbg_info.end_col;\n        if (e_c <= s_c) {\n            // The source data is broken; work-around this limitation by setting the end-column has high as possible\n            e_c = 2000;\n        }\n        const markerrange = new ace.Range(dbg_info.start_line - 1, s_c, dbg_info.end_line - 1, e_c);\n        // Create a unique class to be able to select the marker later\n        const uc = \"chm_\" + this.diode.getPseudorandom();\n\n        const marker = this.editor.session.addMarker(\n            markerrange,\n            \"code_highlight \" + uc\n        );\n\n        this.editor.resize(true);\n        this.editor.scrollToLine(dbg_info.start_line, true, true, () => {\n        });\n        this.editor.gotoLine(dbg_info.start_line, 10, true);\n\n        setTimeout(() => {\n            this.editor.getSession().removeMarker(marker);\n        }, 5000);\n    }\n\n    clearErrors() {\n        for (const m of this._markers) {\n            this.editor.getSession().removeMarker(m);\n        }\n        this._markers = [];\n    }\n\n    highlight_error(error) {\n\n        if (error.type == \"SyntaxError\") {\n            let lineno = parseInt(error.line);\n            const offset = parseInt(error.offset);\n            const text = error.text;\n\n            lineno -= 1;\n\n            const lineval = this.editor.session.getLine(lineno);\n\n\n            const start = lineval.indexOf(text.substring(0, text.length - 1));\n\n            const markerrange = new ace.Range(lineno, start, lineno, start + text.length - 1);\n\n            // Create a unique class to be able to select the marker later\n            const uc = \"sem_\" + this.diode.getPseudorandom();\n\n            const marker = this.editor.session.addMarker(\n                markerrange,\n                \"syntax_error_highlight \" + uc\n            );\n\n            this._markers.push(marker);\n\n            // #TODO: Either find a way to display the error information directly as a tooltip (which ace does not seem to support trivially)\n            // #TODO: or add a dedicated error-view.\n        } else {\n            console.log(\"Untreated error type\", error);\n        }\n    }\n\n    terminal_identifier() {\n        return this._terminal_identifer;\n    }\n\n    compile(code) {\n        for (const m of this._markers) {\n            this.editor.getSession().removeMarker(m);\n        }\n        this._markers = [];\n        this.diode.compile(this, code);\n    }\n\n    setEditorReference(editor) {\n        this.editor = editor;\n\n        const elem = this.container.getElement()[0];\n        elem.addEventListener('resize', x => {\n            this.editor.resize();\n        });\n    }\n\n\n    compile_and_run(code) {\n\n        const millis = this.diode.getPseudorandom();\n\n        const terminal_identifier = \"terminal_\" + millis;\n\n        // create a new terminal\n        const terminal_config = {\n            title: \"Terminal\",\n            type: 'component',\n            componentName: 'TerminalComponent',\n            componentState: { created: millis }\n        };\n        this.diode.addContentItem(terminal_config);\n\n        console.log(\"Server emitting to \", terminal_identifier);\n\n        this._terminal_identifer = terminal_identifier;\n\n        this.diode.gatherProjectElementsAndCompile(this, {} /*{ 'code': code}*/, {\n            run: true,\n            term_id: terminal_identifier\n        });\n    }\n\n}\n","import { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_Terminal extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n    }\n\n    setEditorReference(editor) {\n        this.editor = editor;\n    }\n\n    append(output) {\n        const session = this.editor.getSession();\n        session.insert({\n            row: session.getLength(),\n            column: 0\n        }, output);\n\n        const curr_str = session.getValue();\n\n        // Extract performance information if available\n        const re = /~#~#([^\\n]+)/gm;\n        const matches = [...curr_str.matchAll(re)];\n        for (const m of matches) {\n            console.log(\"Got match\", m);\n            // We want to access the second element (index 1) because it contains the list\n            let perflist = m[1];\n            // Because this is a python list, it may contain \"'\" (single quotes), which is invalid json\n            perflist = perflist.replace(/\\'/g, '');\n            perflist = JSON.parse(perflist);\n            perflist.sort((a, b) => a - b);\n            const median_val = perflist[Math.floor(perflist.length / 2)];\n\n            console.log(\"Got median execution time\", median_val);\n            this.project().request(['new-time'], () => {\n            }, {\n                params: {\n                    time: median_val\n                }\n            });\n        }\n\n        this.container.extendState({\n            \"current_value\": curr_str\n        });\n        this.editor.clearSelection();\n    }\n\n}\n","import { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_CodeOut extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n        this.editor = null;\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const transthis = this;\n\n        const eh = this.diode.goldenlayout.eventHub;\n        this.on(this._project.eventString('-req-new-codeout'), (msg) => {\n\n            if (msg.sdfg_name != this.getState()['sdfg_name']) {\n                // Name mismatch; ignore\n                return;\n            }\n            // See DIODE Errata \"GoldenLayout:EventResponses\"\n            //eh.emit(transthis.project().eventString('new-codeout'), 'ok')\n            setTimeout(x => eh.emit(transthis.project().eventString('new-codeout'), 'ok'), 1);\n            const extracted = msg;\n            this.setCode(extracted);\n        });\n    }\n\n    cleanCode(codestr) {\n        // Removes '////DACE:'-comments in the output code\n        return codestr.replace(/\\s*\\/\\/\\/\\/\\_\\_DACE:[^\\n]*/gm, \"\");\n    }\n\n    setCode(extracted) {\n        const input = extracted;\n        if (typeof extracted === \"string\") {\n            extracted = JSON.parse(extracted);\n        }\n\n        if (typeof extracted.generated_code == \"string\") {\n            this.editor.setValue(this.cleanCode(extracted.generated_code));\n            this.editor.clearSelection();\n        } else {\n            // Probably an array type\n            this.editor.setValue(\"\");\n            this.editor.clearSelection();\n            for (const c of extracted.generated_code) {\n                let v = c;\n                if (extracted.generated_code.length > 1) {\n                    v = \"\\n\\n\\n\" + \"#########  NEXT CODE FILE ############\\n\\n\\n\" + v;\n                }\n                const session = this.editor.getSession();\n                session.insert({\n                    row: session.getLength(),\n                    column: 0\n                }, this.cleanCode(v));\n                this.editor.clearSelection();\n            }\n        }\n        this.saveToState({ 'code': input });\n    }\n\n    setEditorReference(editor) {\n        this.editor = editor;\n\n        const elem = this.container.getElement()[0];\n        elem.addEventListener('resize', x => {\n            this.editor.resize();\n        });\n    }\n}\n","import { SDFG_PropUtil } from \"../../utils/sdfg/sdfg_parser\";\nimport { find_exit_for_entry } from \"../../utils/sdfg/sdfg_utils\";\nimport { parse_sdfg } from \"../../utils/sdfg/json_serializer\";\nimport { ContextMenu } from \"../../utils/context_menu\";\nimport { DIODE_Context } from \"./context\";\nimport { SDFGRenderer } from \"../../renderer/renderer\";\n\n\nexport class DIODE_Context_SDFG extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n        this._message_handler = x => alert(x);\n\n        this.renderer_pane = null;\n\n        this._analysis_values = {};\n\n        console.log(\"state\", state);\n    }\n\n    saveToState(dict_value) {\n        const renamed_dict = {};\n        const json_list = ['sdfg_data', 'sdfg'];\n        for (const x of Object.entries(dict_value)) {\n            renamed_dict[x[0]] = (json_list.includes(x[0]) && typeof (x[1]) != 'string') ? JSON.stringify(x[1]) : x[1];\n        }\n        super.saveToState(renamed_dict);\n\n        console.assert(this.getState().sdfg == undefined);\n    }\n\n    resetState(dict_value) {\n        const renamed_dict = {};\n        const json_list = ['sdfg_data', 'sdfg'];\n        for (const x of Object.entries(dict_value)) {\n            renamed_dict[x[0]] = (json_list.includes(x[0]) && typeof (x[1]) != 'string') ? JSON.stringify(x[1]) : x[1];\n        }\n        super.resetState(renamed_dict);\n        console.assert(this.getState().sdfg == undefined);\n    }\n\n    getState() {\n        const _state = super.getState();\n        const _transformed_state = {};\n        const json_list = ['sdfg_data', 'sdfg'];\n        for (const x of Object.entries(_state)) {\n            _transformed_state[x[0]] = (typeof (x[1]) == 'string' && json_list.includes(x[0])) ? JSON.parse(x[1]) : x[1];\n        }\n        return _transformed_state;\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const transthis = this;\n\n        const eh = this.diode.goldenlayout.eventHub;\n        this.on(this._project.eventString('-req-new-sdfg'), (msg) => {\n\n            if (typeof (msg) == 'string')\n                msg = parse_sdfg(msg);\n            if (msg.sdfg_name === this.getState()['sdfg_name']) {\n                // Ok\n            } else {\n                // Names don't match - don't replace this one then.\n                // #TODO: This means that renamed SDFGs will not work as expected.\n                return;\n            }\n            setTimeout(() => eh.emit(this.project().eventString('new-sdfg'), 'ok'), 1);\n            this.create_renderer_pane(msg, true);\n        });\n\n        // #TODO: When multiple sdfgs are present, the event name\n        // should include a hash of the target context\n        this.on(this._project.eventString('-req-sdfg-msg'), msg => {\n\n            let ret = this.message_handler_filter(msg);\n            if (ret === undefined) {\n                ret = 'ok';\n            }\n            setTimeout(() => eh.emit(transthis._project.eventString('sdfg-msg'), ret), 1);\n        });\n\n        this.on(this._project.eventString('-req-sdfg_props'), msg => {\n            // Echo with data\n            if (msg != undefined) {\n                this.discardInvalidated(msg);\n            }\n            const resp = this.getChangedSDFGPropertiesFromState();\n            const named = {};\n            named[this.getState()['sdfg_name']] = resp;\n            setTimeout(() => eh.emit(transthis._project.eventString('sdfg_props'), named), 1);\n        }, true);\n\n        this.on(this.project().eventString('-req-property-changed-' + this.getState().created), (msg) => {\n            // Emit ok directly (to avoid caller timing out)\n            setTimeout(() => eh.emit(this.project().eventString(\"property-changed-\" + this.getState().created), \"ok\"), 1);\n\n            if (msg.type == \"symbol-properties\") {\n                this.symbolPropertyChanged(msg.element, msg.name, msg.value);\n            }\n            else\n                this.propertyChanged(msg.element, msg.name, msg.value);\n\n        }, true);\n\n        this.on(this.project().eventString('-req-delete-data-symbol-' + this.getState().created), (msg) => {\n            setTimeout(() => eh.emit(this.project().eventString(\"delete-data-symbol-\" + this.getState().created), \"ok\"), 1);\n\n            this.removeDataSymbol(msg);\n        });\n\n        this.on(this.project().eventString('-req-add-data-symbol-' + this.getState().created), (msg) => {\n            setTimeout(() => eh.emit(this.project().eventString(\"add-data-symbol-\" + this.getState().created), \"ok\"), 1);\n\n            this.addDataSymbol(msg.type, msg.name);\n        });\n\n        this.on(this.project().eventString('-req-draw-perfinfo'), (msg) => {\n            setTimeout(() => eh.emit(transthis._project.eventString('draw-perfinfo'), \"ok\"), 1);\n            this._analysis_values = msg.map(x => ({\n                forProgram: x[0],\n                AnalysisName: x[1],\n                runopts: x[2],\n                forUnifiedID: x[3],\n                forSuperSection: x[4],\n                forSection: x[5],\n                data: JSON.parse(x[6]),\n            }));\n            this.renderer_pane.drawAllPerfInfo();\n        });\n\n        this.on(this.project().eventString('-req-sdfg_object'), msg => {\n            // Return the entire serialized SDFG\n            const _state = this.getSDFGDataFromState();\n            const sdfg = _state.type == 'SDFG' ? _state : _state.sdfg;\n            const named = {};\n            named[this.getState()['sdfg_name']] = sdfg;\n            //named = JSON.stringify(named);\n            setTimeout(() => eh.emit(this.project().eventString(\"sdfg_object\"), named), 1);\n        }, true);\n    }\n\n    removeDataSymbol(aname) {\n\n        const o = this.getSDFGDataFromState();\n        const sdfg = o['sdfg'];\n\n        let found = false;\n        for (const x of Object.keys(sdfg.attributes._arrays)) {\n            if (x == aname) {\n                // Matching name\n                delete sdfg.attributes._arrays[x];\n                found = true;\n                break;\n            }\n        }\n        if (!found)\n            console.error(\"Did not find symbol \" + name + \" in SDFG, this is a fatal error\");\n\n        const old = this.getState();\n        if (old.type == \"SDFG\")\n            console.error(\"Defensive programming no longer allowed; change input\");\n\n        else\n            old.sdfg_data.sdfg = sdfg;\n\n        this.resetState(old);\n\n        this.diode.refreshSDFG();\n    }\n\n    addDataSymbol(type, aname) {\n\n        if (aname == \"\") {\n            alert(\"Invalid symbol name. Enter a symbol name in the input field\");\n            return;\n        }\n\n        // Create a dummy element, then allow changing later\n        let typestr = \"\";\n        if (type == \"Scalar\")\n            typestr = \"Scalar\";\n        else if (type == \"Array\")\n            typestr = \"Array\";\n        const data = {\n            type: typestr,\n            attributes: {\n                dtype: \"int32\",\n            }\n        };\n\n        const o = this.getSDFGDataFromState();\n        const sdfg = o['sdfg'];\n\n        let found = false;\n        for (const x of Object.keys(sdfg.attributes._arrays)) {\n            if (x == aname) {\n                // Matching name\n                found = true;\n                break;\n            }\n        }\n        if (found) {\n            this.diode.toast(\"Cannot add symbol\", \"A symbol with name \" + aname + \" does already exist.\", \"error\", 3000);\n            return;\n        }\n\n        sdfg.attributes._arrays[aname] = data;\n        const old = this.getState();\n        if (old.type == \"SDFG\")\n            console.error(\"Defensive programming no longer allowed; change input\");\n\n        else\n            old.sdfg_data.sdfg = sdfg;\n\n        this.resetState(old);\n\n\n        this.diode.refreshSDFG();\n    }\n\n    analysisProvider(aname, nodeinfo) {\n\n        let unified_id = null;\n        if (nodeinfo != null) {\n            unified_id = (parseInt(nodeinfo.stateid) << 16) | parseInt(nodeinfo.nodeid);\n        }\n        console.log(\"analysisProvider\", aname, nodeinfo);\n        if (aname == \"getstates\") {\n\n            const states = this._analysis_values.map(x => (x.forUnifiedID >> 16) & 0xFFFF);\n            return states;\n        } else if (aname == \"getnodes\") {\n            const nodes = this._analysis_values.map(x => (x.forUnifiedID) & 0xFFFF);\n            return nodes;\n        } else if (aname == \"all_vec_analyses\") {\n            const vec_analyses = this._analysis_values.filter(x => x.AnalysisName == 'VectorizationAnalysis');\n            const fltrd_vec_analyses = vec_analyses.filter(x => x.forUnifiedID == unified_id);\n            return fltrd_vec_analyses;\n        } else if (aname == 'CriticalPathAnalysis') {\n            const cpa = this._analysis_values.filter(x => x.AnalysisName == 'CriticalPathAnalysis');\n            const filtered = cpa.filter(x => x.forUnifiedID == unified_id);\n            return filtered;\n        } else if (aname == 'ParallelizationAnalysis') {\n            const pa = this._analysis_values.filter(x => x.AnalysisName == 'ThreadAnalysis');\n            const filtered = pa.filter(x => x.forUnifiedID == unified_id);\n            return filtered;\n        } else if (aname == 'MemoryAnalysis') {\n            const ma = this._analysis_values.filter(x => x.AnalysisName == 'MemoryAnalysis');\n            const filtered = ma.filter(x => x.forUnifiedID == unified_id);\n            return filtered;\n        } else if (aname == 'MemOpAnalysis') {\n            const moa = this._analysis_values.filter(x => x.AnalysisName == 'MemoryOpAnalysis');\n            const filtered = moa.filter(x => x.forUnifiedID == unified_id);\n            return filtered;\n        } else if (aname == 'CacheOpAnalysis') {\n            const coa = this._analysis_values.filter(x => x.AnalysisName == 'CacheOpAnalysis');\n            const filtered = coa.filter(x => x.forUnifiedID == unified_id);\n            return filtered;\n        } else if (aname == \"defaultRun\") {\n            // This pseudo-element returns a filter function that returns only elements from the \"default\" run configuration\n            // #TODO: Make the default run configurable.\n            // For now, the default run is the run with the most committed cores\n            //return x => x.filter(y => y.runopts == '# ;export OMP_NUM_THREADS=4; Running in multirun config');\n            return x => {\n                const tmp = x.map(y => {\n                    const r = [];\n                    y.runopts.replace(/OMP_NUM_THREADS=(\\d+)/gm, (m, p) => r.push(p));\n                    return r;\n                });\n                const max_num = Math.max(...tmp.map(x => parseInt(x)));\n                return x.filter(z => z.runopts == '# ;export OMP_NUM_THREADS=' + max_num + '; Running in multirun config');\n            };\n        } else {\n            throw \"#TODO\";\n        }\n    }\n\n    message_handler_filter(msg) {\n        /*\n            This function is a compatibility layer\n        */\n        msg = JSON.parse(msg);\n        if (msg.sdfg_name != this.getState()['sdfg_name']) {\n            return;\n        }\n        if (msg.type == 'clear-highlights') {\n            if (this.highlighted_elements)\n                this.highlighted_elements.forEach(e => {\n                    if (e)\n                        e.highlighted = false;\n                });\n            this.highlighted_elements = [];\n            this.renderer_pane.draw_async();\n        }\n        if (msg.type == 'highlight-elements') {\n            // Clear previously highlighted elements\n            if (this.highlighted_elements)\n                this.highlighted_elements.forEach(e => {\n                    if (e)\n                        e.highlighted = false;\n                });\n            this.highlighted_elements = [];\n\n            // The input contains a list of multiple elements\n            for (const x of msg.elements) {\n                const sdfg_id = x[0], sid = x[1], nid = x[2];\n                let elem = null;\n                let graph = null;\n                if (sdfg_id >= 0)\n                    graph = this.renderer_pane.sdfg_list[sdfg_id];\n\n                else\n                    graph = this.renderer_pane.graph;\n\n                // If graph is hidden, skip\n                if (graph === undefined)\n                    continue;\n\n                if (sid == -1)\n                    elem = graph.node(nid);\n                else {\n                    const state = graph.node(sid);\n                    // If state is hidden, skip\n                    if (state === undefined)\n                        continue;\n                    elem = state.data.graph.node(nid);\n                }\n                if (elem !== undefined)\n                    this.highlighted_elements.push(elem);\n            }\n            this.highlighted_elements.forEach(e => {\n                if (e)\n                    e.highlighted = true;\n            });\n            this.renderer_pane.draw_async();\n        } else {\n            // Default behavior is passing through (must be an object, not JSON-string)\n            //this._message_handler(msg);\n        }\n    }\n\n    // Returns a goldenlayout component if exists, or null if doesn't\n    has_component(comp_name, parent = null) {\n        // If parent component not provided, use root window\n        if (!parent)\n            parent = this.diode.goldenlayout.root;\n        if ('componentName' in parent && parent.componentName === comp_name)\n            return parent;\n        if ('contentItems' in parent) {\n            for (const ci of parent.contentItems) {\n                const result = this.has_component(comp_name, ci);\n                if (result)\n                    return result;\n            }\n        }\n        return null;\n    }\n\n    render_free_variables(force_open) {\n        let sdfg_dat = this.getSDFGDataFromState();\n        if (sdfg_dat.type != \"SDFG\")\n            sdfg_dat = sdfg_dat.sdfg;\n        this.diode.replaceOrCreate(['render-free-vars'], 'PropWinComponent', {\n            data: sdfg_dat,\n            calling_context: this.created\n        },\n            () => {\n                console.log(\"Calling recreation function\");\n                const config = {\n                    type: 'component',\n                    componentName: 'PropWinComponent',\n                    componentState: {}\n                };\n\n                this.diode.addContentItem(config);\n                setTimeout(() => this.render_free_variables(force_open), 1);\n            });\n    }\n\n    merge_properties(node_a, aprefix, node_b, bprefix) {\n        /*  Merges node_a and node_b into a single node, such that the rendered properties are identical\n            when selecting either node_a or node_b.\n        */\n        const en_attrs = SDFG_PropUtil.getAttributeNames(node_a);\n        const ex_attrs = SDFG_PropUtil.getAttributeNames(node_b);\n\n        const new_attrs = {};\n\n        for (const na of en_attrs) {\n            const meta = SDFG_PropUtil.getMetaFor(node_a, na);\n            if (meta.indirected) {\n                // Most likely shared. Don't change.\n                new_attrs['_meta_' + na] = meta;\n                new_attrs[na] = node_a.attributes[na];\n            } else {\n                // Private. Add, but force-set a new Category (in this case, MapEntry)\n                const mcpy = JSON.parse(JSON.stringify(meta));\n                mcpy['category'] = node_a.type + \" - \" + mcpy['category'];\n                new_attrs['_meta_' + aprefix + na] = mcpy;\n                new_attrs[aprefix + na] = node_a.attributes[na];\n            }\n\n        }\n        // Same for ex_attrs, but don't add if shared\n        for (const xa of ex_attrs) {\n            const meta = SDFG_PropUtil.getMetaFor(node_b, xa);\n            if (!meta.indirected) {\n                const mcpy = JSON.parse(JSON.stringify(meta));\n                mcpy['category'] = node_b.type + \" - \" + mcpy['category'];\n                mcpy['_noderef'] = node_b.node_id;\n                new_attrs['_meta_' + bprefix + xa] = mcpy;\n                new_attrs[bprefix + xa] = node_b.attributes[xa];\n            }\n        }\n        // Copy the first node for good measure\n        // TODO: Inhibits property update for map/array\n        const ecpy = JSON.parse(JSON.stringify(node_a));\n        ecpy.attributes = new_attrs;\n        return ecpy;\n    }\n\n    getSDFGPropertiesFromState() {\n        const o = this.getSDFGDataFromState();\n        const props = o['sdfg_props'];\n\n        return props;\n    }\n\n    getSDFGDataFromState() {\n        const _state = this.getState();\n        let o = null;\n        if (_state.sdfg != undefined) {\n            o = _state;\n        } else {\n            o = _state['sdfg_data'];\n        }\n        if ((typeof o) == 'string') {\n            o = JSON.parse(o);\n        }\n        while (typeof o.sdfg == 'string') {\n            o.sdfg = parse_sdfg(o.sdfg);\n        }\n        return o;\n    }\n\n    renderProperties(node) {\n        /*\n            node: object, duck-typed\n                \n        */\n        const params = node.data;\n        const transthis = this;\n\n        // Render in the (single, global) property window\n        this.diode.renderPropertiesInWindow(transthis, node, params);\n    }\n\n    getSDFGElementReference(node_id, state_id) {\n        if (node_id != null && node_id.constructor == Object) {\n            return this.getEdgeReference(node_id, state_id);\n        } else {\n            return this.getNodeReference(node_id, state_id);\n        }\n    }\n\n    getEdgeReference(node_id, state_id) {\n        const o = this.getSDFGDataFromState();\n        const sdfg = o['sdfg'];\n\n        if (state_id == undefined) {\n            // Look for sdfg-level edges\n            for (const e of sdfg.edges) {\n                if (e.src == node_id.src && e.dst == node_id.dst) {\n                    return [e.attributes.data, sdfg];\n                }\n            }\n        }\n\n        for (const x of sdfg.nodes) {\n            if (x.id == state_id) {\n                for (const e of x.edges) {\n\n                    if (e.src == node_id.src && e.dst == node_id.dst) {\n                        return [e.attributes.data, sdfg];\n                    }\n                }\n\n                break;\n            }\n        }\n    }\n\n    getNodeReference(node_id, state_id) {\n        const o = this.getSDFGDataFromState();\n        const sdfg = o['sdfg'];\n\n        for (const x of sdfg.nodes) {\n            if (x.id == state_id) {\n\n                if (node_id == null)\n                    return [x, sdfg];\n                for (const n of x.nodes) {\n\n                    if (n.id == node_id) {\n                        return [n, sdfg];\n                    }\n                }\n\n                break;\n            }\n        }\n    }\n\n\n    symbolPropertyChanged(node, name, value) {\n        /*\n            A data symbol was changed.\n        */\n        console.log(\"symbolPropertyChanged\", name, value);\n\n        // Search arrays first\n        const o = this.getSDFGDataFromState();\n        const sdfg = o['sdfg'];\n\n        let found = false;\n        const d = node.data();\n        for (const x of Object.keys(sdfg.attributes._arrays)) {\n            if (x == d[0]) {\n                // Matching name\n                sdfg.attributes._arrays[x].attributes[name] = value;\n                found = true;\n                break;\n            }\n        }\n        if (!found)\n            console.error(\"Did not find symbol \" + name + \" in SDFG, this is a fatal error\");\n\n        const old = this.getState();\n        if (old.type == \"SDFG\")\n            console.error(\"Defensive programming no longer allowed; change input\");\n\n        else\n            old.sdfg_data.sdfg = sdfg;\n\n        this.resetState(old);\n\n        this.diode.refreshSDFG();\n    }\n\n    propertyChanged(node, name, value) {\n        /*\n            When a node-property is changed, the changed data is written back\n            into the state.\n        */\n        const nref = node.element;\n\n        nref.attributes[name] = value;\n\n        const sdfg = this.renderer_pane.sdfg;\n        let old = this.getState();\n        if (old.type == \"SDFG\")\n            old = sdfg;\n\n        else\n            old.sdfg_data.sdfg = sdfg;\n\n        this.resetState(old);\n\n        this.diode.refreshSDFG();\n    }\n\n\n    create_renderer_pane(sdfg_data = undefined, update = false) {\n        if (sdfg_data == undefined) {\n            sdfg_data = this.getState()[\"sdfg_data\"];\n        }\n        let tmp = sdfg_data;\n        if ((typeof tmp) === 'string') {\n            tmp = parse_sdfg(sdfg_data);\n        } else {\n            if ('sdfg' in sdfg_data)\n                tmp = sdfg_data;\n\n            else\n                tmp = { sdfg: sdfg_data };\n        }\n\n        {\n            // Load the properties from json instead of loading the old properties\n            // This means deleting any property delivered\n            // This is just so we don't accidentally use the old format\n            console.assert(tmp.sdfg_props === undefined);\n\n        }\n\n        {\n            // Reset the state to avoid artifacts\n            const s = this.getState();\n            console.assert(s.sdfg_data != undefined);\n            delete s.sdfg_data;\n            this.resetState(s);\n        }\n        this.saveToState({\n            \"sdfg_data\": tmp\n        });\n\n        if (this.renderer_pane !== null)\n            this.renderer_pane.set_sdfg(tmp.sdfg);\n        else {\n            const sdfv = new SDFGRenderer(tmp.sdfg, this.container.getElement()[0],\n                (et, e, c, el, r, sle, ed) => this.on_renderer_mouse_event(et, e, c, el, r, sle, ed),\n                null, false, 'white');\n            this.renderer_pane = sdfv;\n        }\n\n        // Display data descriptors by default (in parallel to the creation of the renderer)\n        this.render_free_variables(true);\n    }\n\n    on_renderer_mouse_event(evtype, event, canvas_coords, elements, renderer, selected_elements, ends_drag) {\n        let state_only = false;\n        const clicked_states = elements.states;\n        const clicked_nodes = elements.nodes;\n        const clicked_edges = elements.edges;\n        const clicked_interstate_edges = elements.isedges;\n        const clicked_connectors = elements.connectors;\n        let total_elements = clicked_states.length + clicked_nodes.length + clicked_edges.length +\n            clicked_interstate_edges.length + clicked_connectors.length;\n        let foreground_elem = null;\n        if (selected_elements.length > 0)\n            foreground_elem = selected_elements[0];\n\n        else\n            total_elements = 0;\n\n\n        // Clear context menu\n        if (evtype === 'click' || evtype === 'doubleclick' || evtype === 'mousedown' || evtype === 'contextmenu' ||\n            evtype === 'wheel') {\n            if (this.contextmenu) {\n                this.contextmenu.destroy();\n                this.contextmenu = null;\n            }\n        }\n\n        // Check if anything was clicked at all\n        if (total_elements == 0 && evtype === 'click') {\n            // Clear highlighted elements\n            if (this.highlighted_elements)\n                this.highlighted_elements.forEach(e => {\n                    if (e)\n                        e.stroke_color = null;\n                });\n\n            // Nothing was selected\n            this.render_free_variables(false);\n            return true;\n        }\n        if (total_elements == 0 && evtype === 'contextmenu') {\n            const cmenu = new ContextMenu();\n            cmenu.addOption(\"SDFG Properties\", x => {\n                this.render_free_variables(true);\n            });\n            cmenu.show(event.x, event.y);\n            this.contextmenu = cmenu;\n            return false;\n        }\n\n        if ((clicked_nodes.length + clicked_edges.length + clicked_interstate_edges.length) === 0) {\n            // A state was selected\n            if (clicked_states.length > 0)\n                state_only = true;\n        }\n\n        let state_id = null, node_id = null;\n        if (clicked_states.length > 0)\n            state_id = clicked_states[0].id;\n        if (clicked_interstate_edges.length > 0)\n            node_id = clicked_interstate_edges[0].id;\n\n        if (clicked_nodes.length > 0)\n            node_id = clicked_nodes[0].id;\n        else if (clicked_edges.length > 0)\n            node_id = clicked_edges[0].id;\n\n\n        if (evtype === \"contextmenu\") {\n            // Context menu was requested\n            const spos = { x: event.x, y: event.y };\n            const sdfg_name = renderer.sdfg.attributes.name;\n\n            const cmenu = new ContextMenu();\n\n            ///////////////////////////////////////////////////////////\n            // Collapse/Expand\n            const sdfg = (foreground_elem ? foreground_elem.sdfg : null);\n            let sdfg_elem = null;\n            if (foreground_elem instanceof State)\n                sdfg_elem = foreground_elem.data.state;\n            else if (foreground_elem instanceof SDFGNode) {\n                sdfg_elem = foreground_elem.data.node;\n\n                // If a scope exit node, use entry instead\n                if (sdfg_elem.type.endsWith(\"Exit\"))\n                    sdfg_elem = sdfg.nodes[foreground_elem.parent_id].nodes[sdfg_elem.scope_entry];\n            }\n            else\n                sdfg_elem = null;\n\n            // Toggle collapsed state\n            if (sdfg_elem && 'is_collapsed' in sdfg_elem.attributes) {\n                cmenu.addOption((sdfg_elem.attributes.is_collapsed) ? 'Expand' : 'Collapse',\n                    x => {\n                        sdfg_elem.attributes.is_collapsed = !sdfg_elem.attributes.is_collapsed;\n                        this.renderer_pane.relayout();\n                        this.renderer_pane.draw_async();\n                    });\n            }\n            ///////////////////////////////////////////////////////////\n            cmenu.addOption(\"Show transformations\", x => {\n                console.log(\"'Show transformations' was clicked\");\n\n                this.project().request(['highlight-transformations-' + sdfg_name], x => {\n                }, {\n                    params: {\n                        state_id: state_id,\n                        node_id: node_id\n                    }\n                });\n            });\n            cmenu.addOption(\"Apply transformation \\u25B6\", x => {\n                console.log(\"'Apply transformation' was clicked\");\n\n                // Find available transformations for this node\n                this.project().request(['get-transformations-' + sdfg_name], x => {\n                    console.log(\"get-transformations response: \", x);\n\n                    const tmp = Object.values(x)[0];\n\n                    // Create a sub-menu at the correct position\n                    const submenu = new ContextMenu();\n\n                    for (const y of tmp) {\n                        submenu.addOption(y.opt_name, x => {\n                            this.project().request(['apply-transformation-' + sdfg_name], x => {\n                            },\n                                {\n                                    params: y.id_name\n                                });\n                        });\n                    }\n\n                    submenu.show(spos.x + cmenu.width(), spos.y);\n                }, {\n                    params: {\n                        state_id: state_id,\n                        node_id: node_id\n                    }\n                });\n\n\n                // Don't close the current context menu from this event\n                x.preventDefault();\n                x.stopPropagation();\n            });\n            cmenu.addOption(\"Show Source Code\", x => {\n                console.log(\"go to source code\");\n            });\n            cmenu.addOption(\"Show Generated Code\", x => {\n                console.log(\"go to generated code\");\n            });\n            cmenu.addOption(\"Properties\", x => {\n                console.log(\"Force-open property pane\");\n            });\n\n            cmenu.show(spos.x, spos.y);\n            this.contextmenu = cmenu;\n\n            return false;\n        }\n\n        if (evtype !== \"click\")\n            return false;\n\n        // Clear highlighted elements\n        if (this.highlighted_elements)\n            this.highlighted_elements.forEach(e => {\n                if (e)\n                    e.stroke_color = null;\n            });\n        // Mark this element red\n        this.highlighted_elements = selected_elements;\n\n        // Render properties asynchronously\n        setTimeout(() => {\n            // Get and render the properties from now on\n            console.log(\"sdfg\", foreground_elem.sdfg);\n\n            let dst_nodeid = null;\n            if (foreground_elem instanceof Edge && foreground_elem.parent_id !== null) {\n                const edge = foreground_elem.sdfg.nodes[state_id].edges[foreground_elem.id];\n                dst_nodeid = edge.dst;\n            }\n\n            const render_props = element_list => {\n                const properties = [];\n                element_list.forEach(element => {\n                    // Collect all properties and metadata for each element\n                    const attr = element.attributes;\n                    const akeys = Object.keys(attr).filter(x => !x.startsWith(\"_meta_\"));\n\n                    for (const k of akeys) {\n                        const value = attr[k];\n                        const meta = attr[\"_meta_\" + k];\n                        if (meta == undefined)\n                            continue;\n\n                        const pdata = JSON.parse(JSON.stringify(meta));\n                        pdata.value = value;\n                        pdata.name = k;\n\n                        properties.push({\n                            property: pdata, element: element, sdfg: foreground_elem.sdfg,\n                            category: element.type + ' - ' + pdata.category\n                        });\n                    }\n                });\n                this.renderProperties({\n                    data: properties\n                });\n            };\n\n            if (foreground_elem instanceof Edge)\n                render_props([foreground_elem.data]);\n            else if (foreground_elem instanceof SDFGNode) {\n                const n = foreground_elem.data.node;\n                // Set state ID, if exists\n                n.parent_id = foreground_elem.parent_id;\n                const state = foreground_elem.sdfg.nodes[foreground_elem.parent_id];\n                // Special case treatment for scoping nodes (i.e. Maps, Consumes, ...)\n                if (n.type.endsWith(\"Entry\")) {\n                    // Find the matching exit node\n                    const exit_node = find_exit_for_entry(state.nodes, n);\n\n                    // Highlight both entry and exit nodes\n                    const graph = renderer.sdfg_list[foreground_elem.sdfg.sdfg_list_id];\n                    const gstate = graph.node(foreground_elem.parent_id);\n                    const rnode = gstate.data.graph.node(exit_node.id);\n                    this.highlighted_elements.push(rnode);\n\n                    render_props([n, exit_node]);\n                } else if (n.type.endsWith(\"Exit\")) {\n                    // Find the matching entry node and continue with that\n                    const entry_id = parseInt(n.scope_entry);\n                    const entry_node = state.nodes[entry_id];\n\n                    // Highlight both entry and exit nodes\n                    const graph = renderer.sdfg_list[foreground_elem.sdfg.sdfg_list_id];\n                    const gstate = graph.node(foreground_elem.parent_id);\n                    const rnode = gstate.data.graph.node(entry_node.id);\n                    this.highlighted_elements.push(rnode);\n\n                    render_props([entry_node, n]);\n                } else if (n.type === \"AccessNode\") {\n                    // Find matching data descriptor and show that as well\n                    const ndesc = foreground_elem.sdfg.attributes._arrays[n.attributes.data];\n                    render_props([n, ndesc]);\n                }\n                else\n                    render_props([n]);\n            } else if (foreground_elem instanceof State)\n                render_props([foreground_elem.data.state]);\n\n            this.highlighted_elements.forEach(e => {\n                if (e)\n                    e.stroke_color = \"red\";\n            });\n            renderer.draw_async();\n        }, 0);\n\n        // Timeout handler draws asynchronously\n        return false;\n    }\n}\n","import { REST_request } from \"../../main\";\nimport { parse_sdfg } from \"../../utils/sdfg/json_serializer\";\nimport * as DiodeTables from \"../table.js\";\nimport { DIODE_Context } from \"./context\";\nconst { $ } = globalThis;\n\nexport class DIODE_Context_PropWindow extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n        this._html_container = null;\n\n        this.container.setTitle(\"Properties\");\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const eh = this.diode.goldenlayout.eventHub;\n        this.on(this.project().eventString('-req-display-properties'), (msg) => {\n            setTimeout(() => eh.emit(this.project().eventString(\"display-properties\"), 'ok'), 1);\n            this.getHTMLContainer().innerHTML = \"\";\n            let p = msg.params;\n            if (typeof (p) == 'string')\n                p = JSON.parse(p);\n            this.diode.renderProperties(msg.transthis, msg.node, p, this.getHTMLContainer(), msg.options);\n        });\n\n        this.on(this.project().eventString('-req-render-free-vars'), msg => {\n            setTimeout(() => eh.emit(this.project().eventString(\"render-free-vars\"), 'ok'), 1);\n            this.renderDataSymbols(msg.calling_context, msg.data);\n        });\n    }\n\n\n    renderDataSymbolProperties(caller_id, symbol) {\n        /*\n            caller_id: .created of calling context (SDFG Context, mainly)\n            symbol: [sym_name, {\n                    .attributes: <attr_obj>\n                    .type: <type name>\n                }]\n        */\n        const reduced_node = {};\n        reduced_node.data = () => symbol;\n        this.diode.renderPropertiesInWindow(caller_id, reduced_node, symbol[1].attributes, {\n            backaction: () => {\n                // #TODO: Implement a quick way of getting back from here\n            },\n            type: \"symbol-properties\"\n        });\n    }\n\n    removeDataSymbol(calling_context, data_name) {\n        this.project().request([\"delete-data-symbol-\" + calling_context], x => {\n        }, {\n            params: data_name\n        });\n    }\n\n    addDataSymbol(calling_context, data_type, data_name) {\n        this.project().request([\"add-data-symbol-\" + calling_context], x => {\n        }, {\n            params: {\n                name: data_name,\n                type: data_type\n            }\n        });\n    }\n\n    renderDataSymbols(calling_context, data) {\n        // #TODO: This creates the default state (as in same as render_free_symbols() in the old DIODE)\n        if (data == null) {\n            console.warn(\"Data has not been set - creating empty window\");\n            return;\n        }\n        const free_symbol_table = new DiodeTables.Table();\n        free_symbol_table.setHeaders(\"Symbol\", \"Type\", \"Dimensions\", \"Controls\");\n\n        // Go over the undefined symbols first, then over the arrays (SDFG::arrays)\n        const all_symbols = [...Object.keys(data.attributes.symbols), \"SwitchToArrays\", ...Object.entries(data.attributes._arrays)];\n\n        const caller_id = calling_context;\n        console.assert(caller_id != undefined && typeof (caller_id) == 'string');\n\n        for (const x of all_symbols) {\n\n            if (x == \"SwitchToArrays\") {\n                // Add a delimiter\n                const col = free_symbol_table.addRow(\"Arrays\");\n                col.childNodes.forEach(x => {\n                    x.colSpan = 4;\n                    x.style = \"text-align:center;\";\n                });\n                continue;\n            }\n            if (x[0] == \"null\" || x[1] == null || typeof x === 'string' || x instanceof String)\n                continue;\n            const edit_but = document.createElement('button');\n            edit_but.addEventListener('click', _x => {\n                this.renderDataSymbolProperties(caller_id, x);\n            });\n            edit_but.innerText = \"Edit\";\n            const del_but = document.createElement('button');\n            del_but.addEventListener('click', _x => {\n                this.removeDataSymbol(caller_id, x[0]);\n            });\n            del_but.innerText = \"Delete\";\n            const but_container = document.createElement('div');\n            but_container.appendChild(edit_but);\n            but_container.appendChild(del_but);\n            free_symbol_table.addRow(x[0], x[1].type, x[1].attributes.dtype + \"[\" + x[1].attributes.shape + \"]\", but_container);\n        }\n\n        free_symbol_table.addRow(\"Add data symbols\").childNodes.forEach(x => {\n            x.colSpan = 4;\n            x.style = \"text-align:center;\";\n        });\n        {\n            const input_name = document.createElement(\"input\");\n            input_name.type = \"text\";\n            input_name.placeholder = \"Symbol name\";\n            const add_scalar = document.createElement(\"button\");\n            add_scalar.innerText = \"Add Scalar\";\n            add_scalar.addEventListener(\"click\", () => {\n                this.addDataSymbol(caller_id, \"Scalar\", input_name.value);\n            });\n            const add_array = document.createElement(\"button\");\n            add_array.addEventListener(\"click\", () => {\n                this.addDataSymbol(caller_id, \"Array\", input_name.value);\n            });\n            add_array.innerText = \"Add Array\";\n\n            const but_container = document.createElement(\"div\");\n            but_container.appendChild(add_scalar);\n            but_container.appendChild(add_array);\n\n            free_symbol_table.addRow(input_name, but_container).childNodes.forEach(x => {\n                x.colSpan = 2;\n                x.style = \"text-align:center;\";\n            });\n\n            const libnode_container = document.createElement(\"div\");\n            const expand_all = document.createElement(\"button\");\n            expand_all.addEventListener(\"click\", () => {\n                // Expand all library nodes\n                REST_request(\"/dace/api/v1.0/expand/\", {\n                    sdfg: data,\n                }, (xhr) => {\n                    if (xhr.readyState === 4 && xhr.status === 200) {\n                        const resp = parse_sdfg(xhr.response);\n                        if (resp.error !== undefined) {\n                            // Propagate error\n                            this.diode.handleErrors(this, resp);\n                        }\n\n                        // Add to history\n                        this.project().request([\"append-history\"], x => {\n                        }, {\n                            params: {\n                                new_sdfg: resp.sdfg,\n                                item_name: \"Expand library nodes\"\n                            }\n                        });\n                    }\n                });\n            });\n            expand_all.innerText = \"Expand all library nodes\";\n            libnode_container.appendChild(expand_all);\n            free_symbol_table.addRow(libnode_container);\n        }\n\n        this.getHTMLContainer().innerHTML = \"\";\n\n        free_symbol_table.setCSSClass('free_symbol_table');\n        free_symbol_table.createIn(this.getHTMLContainer());\n    }\n\n    getHTMLContainer() {\n        const parent = $(this.container.getElement()).children(\".sdfgpropdiv\");\n        return parent[0];\n    }\n\n    createFromState() {\n        const p = this.getHTMLContainer();\n        p.setAttribute(\"data-hint\", '{\"type\": \"DIODE\", \"name\": \"Property_Window\"}');\n        const state = this.getState();\n        if (state.params != undefined && state.params.params != null) {\n            const p = state.params;\n            this.diode.renderProperties(p.transthis, p.node, JSON.parse(p.params), this.getHTMLContainer());\n        }\n    }\n\n}\n","import { REST_request } from \"../../main.js\";\nimport { DIODE_Context } from \"./context\";\nconst { $ } = globalThis;\n\nexport class DIODE_Context_Runqueue extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const transthis = this;\n\n        const eh = this.diode.goldenlayout.eventHub;\n\n        this._autorefresher = null;\n\n    }\n\n    destroy() {\n        clearInterval(this._autorefresher);\n        super.destroy();\n    }\n\n    refreshUI(data) {\n\n        if (typeof (data) == 'string') {\n            data = JSON.parse(data);\n        }\n\n        if (data.elements == undefined) {\n            data.elements = [];\n        }\n        const base_element = $(this.container.getElement())[0];\n        base_element.innerHTML = \"\";\n        const container = document.createElement(\"div\");\n        $(container).css(\"overflow\", \"auto\");\n        $(container).width(\"100%\");\n        $(container).height(\"100%\");\n        const table = document.createElement(\"table\");\n\n        // Build the header\n        const header = document.createElement(\"thead\");\n        const header_row = document.createElement(\"tr\");\n        const header_titles = ['position', 'clientID', 'state', 'options'];\n        header_titles.map(x => {\n            const h = document.createElement(\"th\");\n            h.innerText = x;\n            return h;\n        }).forEach(x => header_row.appendChild(x));\n\n        header.appendChild(header_row);\n        table.appendChild(header);\n\n        const tbody = document.createElement(\"tbody\");\n        for (const x of data.elements) {\n\n            let optparse = x.options;\n            if (typeof (optparse) == 'string') {\n            } else if (optparse == undefined) {\n                if (x.output != undefined && x.type == \"orphan\") {\n                    optparse = document.createElement(\"button\");\n                    optparse.onclick = click => {\n                        this.diode.addContentItem({\n                            'type': 'component',\n                            'componentName': 'TerminalComponent',\n                            'componentState': {\n                                current_value: x.output\n                            },\n                            'title': 'Output'\n                        });\n                    };\n                    optparse.innerText = \"Output\";\n                }\n            } else {\n                if (optparse.type == undefined) {\n                    optparse = optparse.perfopts;\n                }\n                optparse = optparse.mode + \", coresets \" + optparse.core_counts;\n            }\n            const values = [\n                x['index'],\n                x['client_id'],\n                x['state'],\n                optparse\n            ];\n            const row = document.createElement(\"tr\");\n            values.map(y => {\n                const c = document.createElement(\"td\");\n                if (typeof (y) == 'string' || typeof (y) == 'number')\n                    c.innerText = y;\n                else {\n                    c.appendChild(y);\n                }\n                return c;\n            }).forEach(y => row.appendChild(y));\n            tbody.appendChild(row);\n        }\n\n        table.appendChild(tbody);\n\n\n        container.appendChild(table);\n        base_element.appendChild(container);\n        $(table).DataTable();\n    }\n\n    create() {\n        this._autorefresher = setInterval(x => {\n            this.getCurrentQueue();\n        }, 2000);\n        $(this.container.getElement()).css(\"overflow\", \"auto\");\n        this.refreshUI({});\n    }\n\n    getCurrentQueue() {\n\n        const post_params = {};\n        REST_request(\"/dace/api/v1.0/dispatcher/list/\", post_params, xhr => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n                // Got response\n                this.refreshUI(xhr.response);\n            }\n        });\n    }\n\n}\n","import { DIODE_Context } from \"./context\";\nimport { DIODE_Project } from \"../diode_project\";\nconst { $ } = globalThis;\n\nexport class DIODE_Context_StartPage extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n    }\n\n    create() {\n        let plus = `<svg width=\"50\" height=\"50\" version=\"1.1\" viewBox=\"0 0 13.2 13.2\" xmlns=\"http://www.w3.org/2000/svg\"><g transform=\"translate(0 -284)\"><g fill=\"none\" stroke=\"#008000\" stroke-width=\"2.65\"><path d=\"m6.61 285v10.6\"/><path d=\"m1.32 290h10.6\"/></g></g></svg>`;\n        plus = \"data:image/svg+xml;base64,\" + btoa(plus);\n\n        this.container.setTitle(\"Start Page\");\n\n\n        const parent = $(this.container.getElement())[0];\n\n        const header = document.createElement('h1');\n        header.id = \"startpage_header\";\n        header.innerText = \"DIODE\";\n        parent.appendChild(header);\n\n        const startpage_container = document.createElement('div');\n        startpage_container.id = 'startpage_container';\n        startpage_container.classList = \"flex_row\";\n        startpage_container.style = \"width: 100%;height:100%;\";\n\n        const startpage_recent = document.createElement('div');\n        startpage_recent.id = 'startpage_recent';\n        {\n            const file_title = document.createElement('div');\n            file_title.innerText = \"New\";\n            file_title.classList = \"startpage_title\";\n            startpage_recent.appendChild(file_title);\n\n            startpage_recent.appendChild(this.createStartpageListElement(\"Create a new Project\", null, null, plus, x => {\n                this.container.close();\n\n                // Force creation of a new \"project\" instance (since we are explicitly creating a new project)\n                // (NOTE: Functionality moved to \"newFile\")\n                //this.diode.createNewProject();\n                this.diode.openUploader(\"code-python\");\n            }));\n\n\n            const recent_title = document.createElement('div');\n            recent_title.innerText = \"Recent\";\n            recent_title.classList = \"startpage_title\";\n            startpage_recent.appendChild(recent_title);\n        }\n        const startpage_resources = document.createElement('div');\n        startpage_resources.id = 'additional_resources';\n        {\n            const resource_title = document.createElement('div');\n            resource_title.innerText = \"Resources\";\n            resource_title.classList = \"startpage_title\";\n            startpage_resources.appendChild(resource_title);\n        }\n\n\n        // Load elements from list\n        {\n            const projects = DIODE_Project.getSavedProjects();\n            for (const p of projects) {\n                console.log(\"p\", p);\n\n                const pdata = DIODE_Project.getProjectData(p);\n\n                startpage_recent.appendChild(this.createStartpageListElement(p, pdata.last_saved, pdata.description, undefined, x => {\n                    DIODE_Project.load(this.diode, p);\n                }));\n            }\n\n        }\n\n        let dace_logo = `\n        <svg xmlns:dc=\"http://purl.org/dc/elements/1.1/\" xmlns:cc=\"http://creativecommons.org/ns#\" xmlns:rdf=\"http://www.w3.org/1999/02/22-rdf-syntax-ns#\" xmlns:svg=\"http://www.w3.org/2000/svg\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:sodipodi=\"http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd\" xmlns:inkscape=\"http://www.inkscape.org/namespaces/inkscape\" id=\"svg13\" height=\"60.891094\" width=\"57.565113\" version=\"1.0\" viewBox=\"0 0 143.91279 152.22773\" inkscape:version=\"0.92.3 (2405546, 2018-03-11)\">\n          \n          <metadata id=\"metadata17\">\n            \n          </metadata>\n          <defs id=\"defs3\">\n            <pattern y=\"0\" x=\"0\" height=\"6\" width=\"6\" patternUnits=\"userSpaceOnUse\" id=\"EMFhbasepattern\"/>\n          </defs>\n          <path id=\"path5\" d=\"m 0,0 h 71.95639 c 39.75591,0 71.95639,34.079345 71.95639,76.11387 0,42.05451 -32.20048,76.11387 -71.95639,76.11387 H 0 Z\" style=\"fill:#0070c0;fill-opacity:1;fill-rule:evenodd;stroke:none\"/>\n          <path id=\"path7\" d=\"M 76.913385,27.183525 115.29013,75.154451 76.913385,123.12538 Z\" style=\"fill:#ffffff;fill-opacity:1;fill-rule:evenodd;stroke:none\"/>\n          <path id=\"path9\" d=\"M 28.622652,27.183525 66.999394,50.049666 V 100.27923 L 28.622652,123.12538 Z\" style=\"fill:#ffffff;fill-opacity:1;fill-rule:evenodd;stroke:none\"/>\n          <path id=\"path11\" d=\"m 67.079345,75.234403 h 9.93398\" style=\"fill:none;stroke:#ffffff;stroke-width:3.99757719px;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:8;stroke-dasharray:none;stroke-opacity:1\"/>\n        </svg>`;\n\n        dace_logo = \"data:image/svg+xml;base64,\" + btoa(dace_logo);\n\n        startpage_resources.appendChild(this.createStartpageListElement(\"Visit DaCe on GitHub\", null, null, \"external_lib/GitHub-Mark.png\", x => {\n            window.open(\"https://github.com/spcl/dace\", \"_blank\");\n        }));\n        startpage_resources.appendChild(this.createStartpageListElement(\"Visit project page\", null, null, dace_logo, x => {\n            window.open(\"https://spcl.inf.ethz.ch/Research/DAPP/\", \"_blank\");\n        }));\n\n\n        startpage_container.appendChild(startpage_recent);\n        startpage_container.appendChild(startpage_resources);\n\n        parent.appendChild(startpage_container);\n    }\n\n    createStartpageListElement(name, time, info, image = undefined, onclick = x => x) {\n\n        const diode_image = `<svg width=\"50\" height=\"50\" version=\"1.1\" viewBox=\"0 0 13.229 13.229\" xmlns=\"http://www.w3.org/2000/svg\"><g transform=\"translate(0 -283.77)\" fill=\"none\" stroke=\"#000\" stroke-linecap=\"round\" stroke-width=\".68792\"><path d=\"m3.3994 287.29v6.9099l6.5603-3.7876-6.5644-3.7899z\" stroke-linejoin=\"round\"/><g><path d=\"m3.3191 290.39h-2.6127\"/><path d=\"m12.624 290.41h-2.6647v-3.3585\"/><path d=\"m9.9597 290.41v2.9962\"/></g></g></svg>`;\n        if (image == undefined) {\n            image = \"data:image/svg+xml;base64,\" + btoa(diode_image);\n        }\n        const elem = document.createElement(\"div\");\n        elem.classList = \"startpage_list_element\";\n\n        const cols = document.createElement('div');\n        {\n            cols.classList = \"flex_row\";\n            // Col 1: Image\n            const img = document.createElement('img');\n            img.src = image;\n            img.width = \"50\";\n            img.height = \"50\";\n            cols.appendChild(img);\n\n            // Col 2: Row\n            const col2 = document.createElement('div');\n            {\n                col2.classList = \"flex_column\";\n                // This row includes project name and details\n                const proj_name = document.createElement('span');\n                proj_name.innerText = name;\n                const proj_detail = document.createElement('span');\n                proj_detail.innerText = info;\n\n                col2.appendChild(proj_name);\n                if (info != null)\n                    col2.appendChild(proj_detail);\n                else {\n                    // We have space to use - use a bigger font\n                    proj_name.style.fontSize = \"1.2rem\";\n\n\n                    col2.style.justifyContent = \"center\";\n                }\n            }\n            cols.appendChild(col2);\n\n            const col3 = document.createElement('div');\n            {\n                col3.classList = \"flex_column\";\n                // This row includes project date\n                const proj_date = document.createElement('span');\n                proj_date.innerText = time;\n                const proj_unused = document.createElement('span');\n\n                if (proj_date != null) {\n                    col3.appendChild(proj_date);\n                    col3.appendChild(proj_unused);\n                }\n            }\n            cols.appendChild(col3);\n        }\n        elem.appendChild(cols);\n\n        elem.addEventListener('click', onclick);\n\n        return elem;\n    }\n}\n","import { DIODE_Context } from \"./context\";\nconst { $ } = globalThis;\n\nexport class DIODE_Context_TransformationHistory extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const eh = this.diode.goldenlayout.eventHub;\n\n        this.on(this.project().eventString('-req-update-tfh'), msg => {\n\n            // Load from project\n            const hist = this.project().getTransformationHistory();\n            this.create(hist);\n            setTimeout(() => eh.emit(this.project().eventString('update-tfh'), 'ok'), 1);\n        });\n    }\n\n    create(hist = []) {\n        let parent_element = this.container.getElement();\n        $(parent_element).css('overflow', 'auto');\n        $(parent_element)[0].setAttribute(\"data-hint\", '{\"type\": \"DIODE_Element\", \"name\": \"TransformationHistory\"}');\n\n        parent_element = $(parent_element)[0];\n\n        parent_element.innerHTML = '';\n\n        const history_base_div = document.createElement(\"div\");\n        history_base_div.classList = \"transformation_history_base\";\n\n        const history_scoll_div = document.createElement(\"div\");\n        history_scoll_div.classList = \"transformation_history_list\";\n\n        this._history_scroll_div = history_scoll_div;\n\n        history_base_div.appendChild(history_scoll_div);\n\n        parent_element.innerHTML = \"\";\n        parent_element.appendChild(history_base_div);\n\n        let i = 0;\n        for (const x of hist) {\n            this.addElementToHistory(x, i);\n            ++i;\n        }\n    }\n\n    addElementToHistory(simple_node, index) {\n        const hsd = this._history_scroll_div;\n\n        const elem = document.createElement(\"div\");\n        elem.classList = \"transformation_history_list_element\";\n\n        const title = document.createElement(\"div\");\n        title.classList = \"transformation_history_list_element_title\";\n        title.innerText = Object.values(simple_node)[0][0].name;\n\n        const ctrl = document.createElement(\"div\");\n        ctrl.classList = \"flex_row transformation_history_list_element_control\";\n\n        {\n            const revert = document.createElement(\"div\");\n            revert.classList = \"revert-button\";\n            revert.title = \"revert\";\n            revert.innerHTML = \"<i class='material-icons'>undo</i>\";\n            $(revert).hover(() => {\n                elem.classList.add(\"revert-hovered\");\n            }, () => {\n                elem.classList.remove(\"revert-hovered\");\n            });\n\n            revert.addEventListener('click', _x => {\n                // Reset to the associated checkpoint\n                const tsh = this.project().getTransformationSnapshots()[index];\n                this.diode.multiple_SDFGs_available({ compounds: tsh[1] });\n\n                // Remove the descending checkpoints\n                this.project().discardTransformationsAfter(index);\n\n                if (true) {\n                    this.diode.gatherProjectElementsAndCompile(this, {}, {\n                        sdfg_over_code: true,\n                    });\n                }\n            });\n\n            ctrl.appendChild(revert);\n        }\n\n        elem.appendChild(title);\n        elem.appendChild(ctrl);\n        hsd.appendChild(elem);\n\n    }\n}\n","import { stringify_sdfg } from \"../../utils/sdfg/json_serializer\";\nimport { DIODE_Context } from \"./context\";\nconst { $ } = globalThis;\n\nexport class DIODE_Context_AvailableTransformations extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n        this._tree_view = null;\n        this._current_root = null;\n\n        // Allow overflow\n        const parent_element = this.container.getElement();\n        $(parent_element).css('overflow', 'auto');\n\n        this.operation_running = false;\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const transthis = this;\n\n        const eh = this.diode.goldenlayout.eventHub;\n        this.on(this._project.eventString('-req-extend-optgraph'), (msg) => {\n\n            const o = msg;\n            if (typeof (o) == \"string\") {\n                JSON.parse(msg);\n            }\n            const sel = o[this.getState()['for_sdfg']];\n            if (sel === undefined) {\n                return;\n            }\n            setTimeout(() => eh.emit(transthis._project.eventString('extend-optgraph'), 'ok'), 1);\n\n            this.create(sel);\n        });\n\n        this.on(this._project.eventString('-req-optpath'), msg => {\n            const named = {};\n            named[this.getState()['for_sdfg']] = [];\n            setTimeout(() => eh.emit(transthis._project.eventString('optpath'), named), 1);\n        });\n\n        const sname = this.getState()['for_sdfg'];\n        this.on(this._project.eventString('-req-new-optgraph-' + sname), msg => {\n            // In any case, inform the requester that the request will be treated\n            const o = JSON.parse(msg);\n            const sel = o.matching_opts;\n            if (sel === undefined) {\n                //eh.emit(transthis._project.eventString('new-optgraph-' + sname), 'not ok');\n                return;\n            }\n            setTimeout(() => eh.emit(transthis._project.eventString('new-optgraph-' + sname), 'ok'), 1);\n\n            this.create(o);\n        });\n\n        this.on(this.project().eventString('-req-highlight-transformations-' + sname), msg => {\n\n            this.getTransformations(msg).forEach(x => this.highlightTransformation(x));\n\n        });\n\n        this.on(this.project().eventString('-req-get-transformations-' + sname), msg => {\n\n            const transforms = this.getTransformations(msg);\n\n            setTimeout(() => eh.emit(transthis._project.eventString('get-transformations-' + sname), transforms), 1);\n        });\n\n        this.on(this.project().eventString('-req-apply-transformation-' + sname), msg => {\n\n            const children = this.getState()['optstruct'];\n            for (const c of Object.values(children)) {\n                for (const d of c) {\n\n                    if (d === undefined)\n                        continue;\n                    if (d.id_name == msg) {\n                        // Call directly.\n                        // (The click handler invokes the simple transformation)\n                        d.representative.dispatchEvent(new Event('click'));\n                    }\n                }\n            }\n        });\n\n        this.on(this.project().eventString('-req-locate-transformation-' + sname), msg => {\n            this.locateTransformation(...JSON.parse(msg));\n        });\n\n        this.on(this.project().eventString('-req-apply-adv-transformation-' + sname), msg => {\n\n            const x = JSON.parse(msg);\n            this.applyTransformation(...x);\n        });\n        this.on(this.project().eventString('-req-append-history'), msg => {\n            this.appendHistoryItem(msg.new_sdfg, msg.item_name);\n        });\n\n        this.on(this.project().eventString('-req-property-changed-' + this.getState().created), (msg) => {\n            this.propertyChanged(msg.element, msg.name, msg.value);\n            setTimeout(() => eh.emit(this.project().eventString(\"property-changed-\" + this.getState().created), \"ok\"), 1);\n        });\n    }\n\n    getTransformations(affecting) {\n        const ret = [];\n        const selstring = \"s\" + affecting.state_id + \"_\" + affecting.node_id;\n        const children = this.getState()['optstruct'];\n        for (const c of Object.values(children)) {\n            for (const d of c) {\n\n                if (d === undefined)\n                    continue;\n                const affects = d.affects;\n\n                if (affects.includes(selstring)) {\n                    ret.push(d);\n                }\n            }\n        }\n        return ret;\n    }\n\n    highlightTransformation(node) {\n        const repr = node.representative;\n        let s = repr.parentNode;\n        while (s) {\n            s.classList.remove(\"at_collapse\");\n            s = s.previousElementSibling;\n        }\n\n        $(repr).css('color', 'red');\n        setTimeout(x => {\n            $(repr).css('color', '');\n        }, 5000);\n    }\n\n    propertyChanged(node, name, value) {\n        return this.propertyChanged2(node, name, value);\n    }\n\n    propertyChanged2(node, name, value) {\n        node.element[name] = value;\n    }\n\n    renderProperties(node, pos, apply_params) {\n        /*\n            node: The TreeNode for which to draw the properties.\n        */\n        const params = node.opt_params;\n\n        const transthis = this;\n\n        const reduced_node = {};\n        reduced_node.data = () => node.opt_params;\n        this.diode.renderPropertiesInWindow(transthis, reduced_node, params, {\n            type: \"transformation\",\n            sdfg_name: this.getState()['for_sdfg'],\n            opt_name: node.opt_name,\n            pos: pos,\n            apply_params: apply_params,\n        });\n    }\n\n\n    sendHighlightRequest(idstring_list) {\n        this._project.request(['sdfg-msg'], resp => {\n        }, {\n            params: JSON.stringify({\n                type: 'highlight-elements',\n                sdfg_name: this.getState()['for_sdfg'],\n                elements: idstring_list\n            }),\n            timeout: 1000\n        });\n    }\n\n    sendClearHighlightRequest() {\n        this._project.request(['sdfg-msg'], resp => {\n        }, {\n            params: JSON.stringify({\n                sdfg_name: this.getState()['for_sdfg'],\n                type: 'clear-highlights',\n            }),\n            timeout: 1000\n        });\n    }\n\n    addNodes(og) {\n\n        const full = {};\n        // Load the available data\n        for (const x of og) {\n            if (full[x.opt_name] === undefined) {\n                full[x.opt_name] = [];\n            }\n            full[x.opt_name].push(x);\n        }\n        const arrayed = [];\n        for (const x of Object.entries(full)) {\n            const k = x[0];\n            const v = x[1];\n            arrayed.push([k, v]);\n        }\n        const sorted = arrayed.sort((a, b) => a[0].localeCompare(b[0]));\n        for (const z of sorted) {\n            const y = z[0];\n            const x = z[1];\n\n            let i = 0;\n            let container_node = undefined;\n            if (x.length > 1) {\n\n                container_node = document.createElement('div');\n                container_node.classList = \"flex_column\";\n\n                const c_title = document.createElement('div');\n                {\n                    const c_title_span = document.createElement(\"span\");\n                    c_title_span.innerText = y;\n                    c_title.classList = \"at_group_header\";\n                    c_title.appendChild(c_title_span);\n\n                    c_title.addEventListener('click', x => {\n                        c_title.classList.toggle(\"at_collapse\");\n                    });\n                }\n\n                container_node.appendChild(c_title);\n\n                this._transformation_list.appendChild(container_node);\n            }\n            for (const n of x) {\n                this.addNode(n, i, container_node);\n                ++i;\n            }\n        }\n        const _s = this.getState();\n        _s.optstruct = full;\n        this.saveToState(_s);\n    }\n\n    locateTransformation(opt_name, opt_pos, affects) {\n        console.log(\"locateTransformation\", arguments);\n\n        this.sendHighlightRequest(affects);\n\n        const _state = this.getState();\n        const _repr = _state.optstruct[opt_name][opt_pos].representative;\n        $(_repr).css(\"background\", \"green\");\n\n        setTimeout(() => {\n            this.sendClearHighlightRequest();\n            $(_repr).css(\"background\", '');\n        }, 1000);\n    }\n\n    applyTransformation(x, pos, _title) {\n        if (this.operation_running)\n            return;\n        this.operation_running = true;\n        const _state = this.getState();\n        const optstruct = _state['optstruct'];\n        const named = {};\n        const cpy = JSON.parse(JSON.stringify(optstruct[x.opt_name][pos]));\n        named[this.getState()['for_sdfg']] = [{\n            name: _title,\n            params: {\n                props: cpy['opt_params']\n            }\n        }];\n\n        const tmp = (x) => {\n            // Compile after the transformation has been saved\n            this.diode.gatherProjectElementsAndCompile(this, {\n                optpath: named\n            }, {\n                sdfg_over_code: true\n            }, () => {\n                this.project().saveSnapshot(x['sdfg_object'], named);\n\n                this.project().request(['update-tfh'], x => {\n                    this.operation_running = false;\n                }, {\n                    on_timeout: () => {\n                        this.operation_running = false;\n                    }\n                });\n            }, () => {\n                // On failure\n                this.operation_running = false;\n            });\n        };\n\n        this.project().request(['sdfg_object'], x => {\n            console.log(\"Got snapshot\", x);\n            if (typeof (x.sdfg_object) == 'string')\n                x.sdfg_object = JSON.parse(x.sdfg_object);\n\n            setTimeout(tmp, 10, x);\n        }, {});\n    }\n\n    appendHistoryItem(new_sdfg, item_name) {\n        if (this.operation_running)\n            return;\n        this.operation_running = true;\n        const named = {};\n        named[this.getState()['for_sdfg']] = [{\n            name: item_name,\n            params: {}\n        }];\n\n        const tmp = () => {\n            // Update SDFG\n            this.diode.gatherProjectElementsAndCompile(this, {\n                code: stringify_sdfg(new_sdfg)\n            }, {});\n        };\n\n        this.project().request(['sdfg_object'], x => {\n            console.log(\"Got snapshot\", x);\n            if (typeof (x.sdfg_object) == 'string')\n                x.sdfg_object = JSON.parse(x.sdfg_object);\n\n            this.project().saveSnapshot(x['sdfg_object'], named);\n\n            this.project().request(['update-tfh'], x => {\n                this.operation_running = false;\n            }, {\n                on_timeout: () => {\n                    this.operation_running = false;\n                }\n            });\n\n            setTimeout(tmp, 10);\n        }, {});\n    }\n\n    addNode(x, pos = 0, parent_override = undefined) {\n\n        let _title = x.opt_name;\n\n        // Add a suffix\n        if (pos != 0) {\n            _title += \"$\" + pos;\n        }\n        x.id_name = _title;\n\n        const at_list = (parent_override === undefined) ?\n            this._transformation_list : parent_override;\n\n        // Create the element\n        const list_elem = document.createElement(\"div\");\n        list_elem.classList = \"flex_row at_element\";\n\n        // Add a title-div\n        const title = document.createElement(\"div\");\n        title.innerText = _title;\n\n        title.addEventListener('mouseenter', _x => {\n            this.sendHighlightRequest(x.affects);\n        });\n        title.addEventListener('mouseleave', _x => {\n            this.sendClearHighlightRequest();\n        });\n\n        title.addEventListener('click', _x => {\n\n            this.applyTransformation(x, pos, _title);\n        });\n\n        title.setAttribute('data-hint', '{\"type\": \"transformation\", \"name\": \"' + x.opt_name + '\"}');\n        x.representative = title;\n\n        // Add a control-div\n        const ctrl = document.createElement(\"div\");\n        // Advanced button\n        {\n            const adv_button = document.createElement('b');\n            adv_button.classList = \"\";\n            adv_button.innerText = '...';\n\n            adv_button.addEventListener('click', _x => {\n                // Clicking this reveals the transformation properties\n                this.renderProperties(x, pos, [x, pos, _title]);\n            });\n\n            ctrl.appendChild(adv_button);\n        }\n        // Help button\n        /*\n        {\n            let help_button = document.createElement('i');\n            help_button.classList = \"\";\n            help_button.innerText = '?';\n            help_button.setAttribute(\"data-hint\", '{\"type\": \"transformation\", \"name\": \"' + x.opt_name + '\"}');\n            help_button.addEventListener(\"click\", _ev => this.diode.hint(_ev));\n            ctrl.appendChild(help_button);\n        }*/\n        list_elem.appendChild(title);\n        list_elem.appendChild(ctrl);\n\n\n        at_list.appendChild(list_elem);\n    }\n\n    create(newstate = undefined) {\n        if (newstate != undefined) {\n\n            const _state = this.getState();\n            Object.assign(_state, newstate);\n            this.resetState(_state);\n        }\n        let _state = this.getState();\n        if (typeof (_state) == 'string') {\n            _state = JSON.parse(_state);\n        }\n        let matching_opts = undefined;\n        if (_state.matching_opts != undefined) {\n            matching_opts = _state.matching_opts;\n        } else if (_state.optgraph_data != undefined) {\n            const _data = JSON.parse(_state.optgraph_data);\n            matching_opts = _data.matching_opts;\n        }\n        const parent = (this.container.getElement())[0];\n        parent.innerHTML = '';\n\n        const at_div = document.createElement('div');\n        at_div.classList = \"at_container\";\n        const at_list = document.createElement('div');\n\n        this._transformation_list = at_list;\n\n        at_div.appendChild(at_list);\n\n        parent.appendChild(at_div);\n\n        if (matching_opts != undefined) {\n            this.addNodes(matching_opts);\n        }\n    }\n}\n","import { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_Error extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n        this.editor = null;\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const transthis = this;\n\n        const eh = this.diode.goldenlayout.eventHub;\n        this.on(this._project.eventString('-req-new-error'), (msg) => {\n\n            setTimeout(x => eh.emit(transthis.project().eventString('new-error'), 'ok'), 1);\n            const extracted = msg;\n            this.setError(extracted);\n        });\n    }\n\n    setError(error) {\n        console.log(\"error\", error);\n\n        let error_string = \"\";\n        if (typeof (error) == \"string\")\n            this.editor.setValue(error);\n        else if (Array.isArray(error)) {\n            for (const e of error) {\n                if (e.msg != undefined) {\n                    error_string += e.msg;\n                }\n                console.log(\"Error element\", e);\n            }\n            this.editor.setValue(error_string);\n        }\n        this.saveToState({ 'error': error });\n    }\n\n    setEditorReference(editor) {\n        this.editor = editor;\n\n        const elem = this.container.getElement()[0];\n        elem.addEventListener('resize', x => {\n            this.editor.resize();\n        });\n    }\n}\n","import { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_RunConfig extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n        this._settings_container = null;\n\n    }\n\n    create() {\n        const parent = this.container.getElement()[0];\n\n        const runopts_container = document.createElement(\"div\");\n\n        const runopts_general_container = document.createElement(\"div\");\n\n        let values = {\n            \"Configuration name\": \"\",\n            \"Host\": \"localhost\",\n            \"Use SSH\": true,\n            \"SSH Key\": this.diode.pubSSH(),\n            \"SSH Key override\": \"\",\n            \"Instrumentation\": \"off\",\n            \"Number of threads\": \"[0]\"\n        };\n\n        let params = [];\n        const node = null;\n        let transthis = null;\n\n        // Build the callback object\n        transthis = {\n            propertyChanged: (node, name, value) => {\n                if (name == \"Configuration name\") {\n                    if (this.diode.getRunConfigs().map(x => x['Configuration name']).includes(value)) {\n                        // Load values and reset inputs\n                        const copy = this.diode.getRunConfigs(value);\n                        for (const x of Object.keys(copy)) {\n                            const v = copy[x];\n                            const ps = params.find(y => y.name == x);\n                            ps.value = v;\n                        }\n                        values = copy;\n                        runopts_general_container.innerHTML = \"\";\n                        this.diode.renderProperties(transthis, node, params, runopts_general_container, {});\n                        return;\n                    }\n                }\n                values[name] = value;\n            }\n        };\n        /*\n        element structure:\n        {\n            name: <name>\n            desc: <description> (as tooltip)\n            category: <Category name>\n            type: <Type used to render>\n            value: <Value to store>\n        }\n        */\n        {\n            params = [{\n                name: \"Configuration name\",\n                type: \"combobox\",\n                value: values['Configuration name'],\n                options: this.diode.getRunConfigs().map(x => x['Configuration name']),\n                desc: \"Name of this configuration\",\n            }, {\n                name: \"Host\",\n                type: \"hosttype\",\n                value: values['Host'],\n                desc: \"Host executing the programs\",\n            },\n            ]; // Array of elements\n\n\n            // Add category (common to all elements)\n            params.forEach(x => x.category = \"General\");\n\n            const remoteparams = [{\n                name: \"Use SSH\",\n                type: \"bool\",\n                value: values['Use SSH'],\n                desc: \"Use SSH. Mandatory for remote hosts, optional for localhost.\",\n            }, {\n                name: \"SSH Key\",\n                type: \"str\",\n                value: values['SSH Key'],\n                desc: \"Public SSH key (id_rsa.pub) to add to remote authorized_keys. This key must not be password-protected!\",\n            }, {\n                name: \"SSH Key override\",\n                type: \"str\",\n                value: values['SSH Key override'],\n                desc: \"Override the identity key file (ssh option -i) with this value if your password-free key is not id_rsa\"\n            }\n            ];\n\n            // Add category (common to all elements)\n            remoteparams.forEach(x => x.category = \"Remote\");\n\n            const instrumentationparams = [{\n                name: \"Instrumentation\",\n                type: \"selectinput\",\n                value: values['Instrumentation'],\n                options: ['off', 'minimal', 'full'],\n                desc: \"Set instrumentation mode (CPU only)\",\n            },\n            {\n                name: \"Number of threads\",\n                type: \"list\",\n                value: values['Number of threads'],\n                desc: \"Sets the number of OpenMP threads.\" +\n                    \"If multiple numbers are specified, the program is executed once for every number of threads specified. Specify 0 to use system default\"\n            },\n\n            ];\n\n            // Add category (common to all elements)\n            instrumentationparams.forEach(x => x.category = \"Profiling\");\n\n\n            // Merge params\n            params = [...params, ...remoteparams, ...instrumentationparams];\n\n            const node = {\n                data: () => params\n            };\n\n            // Build the settings\n            this.diode.renderProperties(transthis, node, params, runopts_general_container, {});\n        }\n\n\n        runopts_container.appendChild(runopts_general_container);\n\n\n        parent.appendChild(runopts_container);\n\n        const apply_button = document.createElement(\"button\");\n        apply_button.innerText = \"Save\";\n        apply_button.addEventListener('click', _x => {\n            this.diode.addToRunConfigs(values);\n        });\n        parent.appendChild(apply_button);\n    }\n\n\n}\n","import { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_PerfTimes extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n        this._chart = null;\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const eh = this.diode.goldenlayout.eventHub;\n        const transthis = this;\n\n        this.on(this.project().eventString('-req-new-time'), (msg) => {\n            setTimeout(x => eh.emit(transthis.project().eventString('new-time'), 'ok'), 1);\n            this.addTime(msg.time);\n        });\n    }\n\n    create() {\n        const elem = this.container.getElement()[0];\n        elem.innerHTML = \"\";\n\n        // Create the graph\n        const canvas = document.createElement(\"canvas\");\n        elem.appendChild(canvas);\n\n        const oldstate = this.getState();\n        if (oldstate.runtimes === undefined) {\n            oldstate.runtimes = [];\n        }\n\n        console.log(\"Execution times loaded\", oldstate.runtimes);\n\n        const labels = [];\n        for (let i = 0; i < oldstate.runtimes.length; ++i) {\n            labels.push(i);\n        }\n\n        this._chart = new Chart(canvas.getContext(\"2d\"), {\n            type: 'bar',\n\n            data: {\n                labels: labels,\n                datasets: [{\n                    label: 'Exec. times in s',\n                    backgroundColor: \"blue\",\n                    data: oldstate.runtimes.map(x => x)\n                }]\n            },\n            options: {\n                responsive: true,\n                scales: {\n                    yAxes: [{\n                        display: true,\n                        ticks: {\n                            beginAtZero: true\n                        }\n                    }],\n                    xAxes: [{\n                        display: true,\n                        ticks: {\n                            autoSkip: true\n                        }\n                    }]\n                },\n                legend: {\n                    //display: false,\n                    position: 'top',\n                },\n                title: {\n                    display: true,\n                    text: 'Execution times'\n                }\n            }\n        });\n        this._chart.update();\n    }\n\n    addTime(runtime) {\n        const oldstate = this.getState();\n        if (oldstate.runtimes === undefined) {\n            oldstate.runtimes = [];\n        }\n        oldstate.runtimes.push(runtime);\n        this.resetState(oldstate);\n\n        this.create();\n    }\n\n}\n","import { REST_request } from \"../../main.js\";\nimport { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_InstrumentationControl extends DIODE_Context {\n    /*\n        This context shows status and controls for the current instrumentation run.\n        It is an interface and does not store data other than that needed to provide popouts.\n        In particular, it does not display instrumentation results (this is done in the SDFG component).\n    */\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        let started = false;\n\n        // Start updating interval\n        this._update_timeout = setInterval(() => {\n            REST_request(\"/dace/api/v1.0/dispatcher/list/\", {}, xhr => {\n                if (xhr.readyState === 4 && xhr.status === 200) {\n                    // Got response\n                    let done = true;\n                    const resp = JSON.parse(xhr.response);\n                    const elems = resp.elements;\n                    for (const e of elems) {\n                        const o = e.options;\n                        if (typeof (o) == 'string') {\n                            console.log(\"o is \", o);\n                            if (o == \"endgroup\") {\n                                // At least started, not done yet\n                                done = false;\n                                started = true;\n                            }\n                        }\n                    }\n\n                    if (started && done) {\n                        started = false;\n                        this.diode.load_perfdata();\n                    }\n                }\n\n            });\n        }, 2000);\n    }\n\n    close() {\n        clearInterval(this._update_timeout);\n        this._update_timeout = null;\n        super.close();\n    }\n\n    destroy() {\n        super.destroy();\n    }\n\n    create() {\n        const parent = this.container.getElement()[0];\n\n        parent.innerHTML = \"<h2>Instrumentation control</h2><p>Do not close this window while instrumented programs are running</p>\";\n\n        // Functionality provided in this context\n        // - Download perfdata database\n        // - Delete remote perfdata database (e.g. to run a new / different program)\n        // - Wait for tasks to be done (to auto-update performance information)\n        const download_but = document.createElement(\"a\");\n        download_but.innerText = \"Download perfdata database\";\n        download_but.href = base_url + \"/dace/api/v1.0/perfdata/download/\" + this.diode.getClientID() + \"/\";\n        download_but.download = \"perfdata.sqlite3\";\n\n        const download_can_but = document.createElement(\"a\");\n        download_can_but.innerText = \"Download CAN\";\n        download_can_but.href = base_url + \"/dace/api/v1.0/can/download/\" + this.diode.getClientID() + \"/\";\n        download_can_but.download = \"current.sqlite3\";\n\n        const delete_but = document.createElement(\"button\");\n        delete_but.innerText = \"Delete remote database\";\n        delete_but.addEventListener(\"click\", () => {\n            REST_request(\"/dace/api/v1.0/perfdata/reset/\", {\n                client_id: this.diode.getClientID()\n            }, x => {\n            });\n        });\n\n        const delete_can_but = document.createElement(\"button\");\n        delete_can_but.innerText = \"Delete remote CAN\";\n        delete_can_but.addEventListener(\"click\", () => {\n            REST_request(\"/dace/api/v1.0/can/reset/\", {\n                client_id: this.diode.getClientID()\n            }, x => {\n            });\n        });\n\n        const render_but = document.createElement(\"button\");\n        render_but.innerText = \"Display instrumentation results\";\n        render_but.addEventListener(\"click\", () => {\n            this.diode.load_perfdata();\n        });\n\n        const roofline_but = document.createElement(\"button\");\n        roofline_but.innerText = \"Show roofline\";\n        roofline_but.addEventListener(\"click\", () => {\n            this.diode.show_roofline();\n        });\n\n        const celem = document.createElement(\"div\");\n        celem.classList = \"flex_column\";\n\n        celem.appendChild(download_but);\n        celem.appendChild(download_can_but);\n        celem.appendChild(delete_but);\n        celem.appendChild(delete_can_but);\n        celem.appendChild(render_but);\n        celem.appendChild(roofline_but);\n\n        parent.appendChild(celem);\n    }\n\n}\n","import {ObjectHelper} from \"../datahelper.js\";\n\n\nvar roofline_socket = 0;\n\n\nfunction drawMarkersY(ctx, margin, options) {\n\n    let width = () => ctx.canvas.width;\n    let height = () => ctx.canvas.height;\n\n    let steps = options.steps;\n    let step_value_func = options.step_value_func;\n\n    let axis_len_x = height() - margin.top - margin.bottom;\n\n    let pix_step = axis_len_x / steps;\n\n\n    let start = {\n        x: margin.left,\n        y: height() - margin.bottom\n    };\n\n    let marker_height = 10;\n    ctx.save();\n    for(let i = 1; i < steps; ++i) {\n\n        let cur_val = step_value_func(i);\n        let pos = start.y - i * pix_step;\n\n        // Markers\n        ctx.beginPath();\n        ctx.strokeStyle = \"black\";\n        ctx.lineWidth = 2;\n        ctx.setLineDash([]);\n        ctx.moveTo(start.x - marker_height / 2.0, pos);\n        ctx.lineTo(start.x + marker_height / 2.0, pos);\n        ctx.stroke();\n\n\n        // Gridlines\n        ctx.beginPath();\n        ctx.strokeStyle = \"gray\";\n        ctx.setLineDash([5, 15]);\n        ctx.lineWidth = 1;\n        ctx.moveTo(margin.left, pos);\n        ctx.lineTo(width() - margin.right, pos);\n        ctx.stroke();\n\n        // Draw value indices\n        ctx.beginPath();\n        ctx.strokeStyle = \"black\";\n        ctx.setLineDash([]);\n        ctx.lineWidth = 1;\n        ctx.font = \"30px Arial\";\n        ctx.textAlign = \"right\";\n        ctx.textBaseline = \"middle\";\n\n\n        if(cur_val < 1) {\n            cur_val = ObjectHelper.valueToSensibleString(cur_val, \"fraction\");\n        }\n        ctx.fillText(cur_val.toString(), start.x - marker_height / 2.0, pos);\n\n    }\n    \n    let ypos = (height() - margin.bottom - margin.top) / 2.0 - margin.top;\n    // Draw axis title\n    ctx.beginPath();\n    ctx.strokeStyle = \"black\";\n    ctx.setLineDash([]);\n    ctx.lineWidth = 1;\n    ctx.font = \"40px Arial\";\n    ctx.textAlign = \"center\";\n    ctx.textBaseline = \"middle\";\n    ctx.translate(margin.left, 0);\n    ctx.rotate(Math.PI / -2.0);\n    ctx.fillText(\"Performance [FLOP/c]\", -height() / 2.0, -margin.left / 2);\n    ctx.translate(-margin.left, 0);\n\n    ctx.restore();\n}\n\nfunction drawMarkersX(ctx, margin, options) {\n\n    let width = () => ctx.canvas.width;\n    let height = () => ctx.canvas.height;\n\n    let steps = options.steps;\n    let step_value_func = options.step_value_func;\n\n    let axis_len_x = width() - margin.left - margin.right;\n\n    let pix_step = axis_len_x / steps;\n\n\n    let start = {\n        x: margin.left,\n        y: height() - margin.bottom\n    };\n\n    let marker_height = 10;\n    ctx.save();\n    for(let i = 1; i < steps; ++i) {\n\n        let cur_val = step_value_func(i);\n        let pos = start.x + i * pix_step;\n\n        // Markers\n        ctx.beginPath();\n        ctx.strokeStyle = \"black\";\n        ctx.lineWidth = 2;\n        ctx.setLineDash([]);\n        ctx.moveTo(pos, start.y - marker_height / 2.0);\n        ctx.lineTo(pos, start.y + marker_height / 2.0);\n        ctx.stroke();\n\n\n        // Gridlines\n        ctx.beginPath();\n        ctx.strokeStyle = \"gray\";\n        ctx.setLineDash([5, 15]);\n        ctx.lineWidth = 1;\n        ctx.moveTo(pos, margin.top);\n        ctx.lineTo(pos, height() - margin.bottom);\n        ctx.stroke();\n\n        // Draw value indices\n        ctx.beginPath();\n        ctx.strokeStyle = \"black\";\n        ctx.setLineDash([]);\n        ctx.lineWidth = 1;\n        ctx.font = \"30px Arial\";\n        ctx.textAlign = \"center\";\n        ctx.textBaseline = \"top\";\n\n        if(cur_val < 1) {\n            cur_val = ObjectHelper.valueToSensibleString(cur_val, \"fraction\");\n        }\n\n        ctx.fillText(cur_val.toString(), pos, start.y + marker_height / 2.0);\n    }\n    // Draw axis title\n    ctx.beginPath();\n    ctx.strokeStyle = \"black\";\n    ctx.setLineDash([]);\n    ctx.lineWidth = 1;\n    ctx.font = \"40px Arial\";\n    ctx.textAlign = \"center\";\n    ctx.textBaseline = \"top\";\n    ctx.fillText(\"Operational intensity [FLOP/byte]\", margin.left + (width() - margin.left - margin.right) / 2.0, height() - margin.bottom / 2.0);\n\n    ctx.restore();\n}\n\nfunction fillLine(ctx, margin, yoptions, gflops, mode=\"hard\") {\n    // For animations only\n    let end_scale = 1.0;\n    let start_scale = 1.0;\n\n    // Width function\n    let width = () => ctx.canvas.width;\n    let height = () => ctx.canvas.height;\n\n    // Draw the peak GFLOP/c line\n    ctx.save();\n\n    if(mode===\"soft\") {\n        ctx.setLineDash([15, 15]);\n    }\n    else {\n        ctx.setLineDash([]);\n    }\n    ctx.beginPath();\n    ctx.strokeStyle = \"black\";\n    ctx.lineWidth = 3;\n\n    let axis_len_y = height() - margin.top - margin.bottom;\n    let pix_step = axis_len_y / yoptions.steps;\n\n    let logval = yoptions.inv_step_value_func(gflops);\n    let y = height() - margin.bottom - pix_step * logval;\n\n    ctx.moveTo(margin.left, y);\n    ctx.lineTo(width() - margin.right, y);\n    ctx.stroke();\n\n    ctx.beginPath();\n\n    ctx.font = \"25px Arial\";\n    ctx.fillStyle = \"black\";\n\n    ctx.textAlign = \"right\";\n    ctx.textBaseline = \"bottom\";\n    ctx.fillText(gflops.toString() + \" FLOP/c\", width() - margin.right, y);\n\n    ctx.restore();\n}\n\nfunction options_max_val(options) {\n    return options.step_value_func((options.steps - 0) * options.value_per_step);\n}\n\nfunction options_min_val(options) {\n    return options.step_value_func(0);\n}\n\nfunction getYPixel(ctx, yoptions, margin, value) {\n    let height = () => ctx.canvas.height;\n    let axis_len_y = height() - margin.top - margin.bottom;\n    let pix_step_y = axis_len_y / yoptions.steps;\n\n    let val = yoptions.inv_step_value_func(value);\n    let y = height() - margin.bottom - pix_step_y * val;\n\n    return y;\n}\n\nfunction getXPixel(ctx, xoptions, margin, value) {\n    let width = () => ctx.canvas.width;\n    let axis_len_x = width() - margin.left - margin.right;\n    let pix_step_x = axis_len_x / xoptions.steps;\n\n    let val = xoptions.inv_step_value_func(value);\n    let x = margin.left + pix_step_x * val;\n\n    return x;\n}\n\nfunction fillBandwidthBound(ctx, margin, xoptions, yoptions, bytes_per_cycle) {\n    // For animations only\n    let end_scale = 1.0;\n    let start_scale = 1.0;\n\n    // Width function\n    let width = () => ctx.canvas.width;\n    let height = () => ctx.canvas.height;\n\n    ctx.save();\n\n    ctx.strokeStyle = \"black\";\n    ctx.lineWidth = 3;\n\n    let axis_len_y = height() - margin.top - margin.bottom;\n    let pix_step_y = axis_len_y / yoptions.steps;\n\n    let axis_len_x = width() - margin.left - margin.right;\n    let pix_step_x = axis_len_x / xoptions.steps;\n\n    let maxyval = options_max_val(yoptions);\n    let maxxval = options_max_val(xoptions);\n\n    // y = x + q\n    let yval = bytes_per_cycle * maxxval;\n    let xval = maxxval;\n\n    yval = Math.min(yval, maxyval);\n    xval = Math.min(yval / bytes_per_cycle, maxxval);\n\n    // Find the positions for yval and xval and draw lines to there.\n    let logvaly_start = yoptions.inv_step_value_func(options_min_val(xoptions) * bytes_per_cycle);\n    let y_start = height() - margin.bottom - pix_step_y * logvaly_start;\n\n    let logvaly = yoptions.inv_step_value_func(yval);\n    let y = height() - margin.bottom - pix_step_y * logvaly;\n\n    let logvalx = xoptions.inv_step_value_func(xval);\n    let x = margin.left + pix_step_x * logvalx;\n\n    // Move to zero\n    ctx.moveTo(margin.left, y_start);\n\n    ctx.lineTo(x, y);\n    ctx.stroke();\n\n\n    ctx.translate(x, -y + margin.top + margin.bottom);\n    let angle = Math.atan2(y - y_start, x - margin.left);\n    ctx.rotate(angle);\n    ctx.font = \"25px Arial\";\n    ctx.fillStyle = \"black\";\n\n    ctx.textAlign = \"right\";\n    ctx.textBaseline = \"bottom\";\n    ctx.fillText(bytes_per_cycle.toString() + \" B/c\", 0, 0);\n\n\n    ctx.restore();\n}\n\nvar dotdata = [];\nvar flopbounds = [];\nvar bandwidthbounds = [];\n\n\nfunction draw_full(ctx, painter)  {\n    ctx.clearRect(0, 0, ctx.canvas.width, ctx.canvas.height);\n    painter.drawAxes();\n\n    painter.drawComputeBounds();\n    painter.drawBandwidthBounds();\n\n    painter.connectDots();\n\n    painter.drawDots();\n\n};\n\nfunction drawDot(ctx, xoptions, yoptions, margin, flop_per_cyc, flop_per_byte, size = 5) {\n    ctx.save();\n\n    let x = getXPixel(ctx, xoptions, margin, flop_per_byte);\n    let y = getYPixel(ctx, yoptions, margin, flop_per_cyc);\n\n    let off = size;\n\n    ctx.fillStyle = \"red\";\n    ctx.fillRect(x - off, y - off, off * 2, off * 2);\n\n    ctx.restore();\n}\n\nfunction setDot(ctx, xoptions, yoptions, margin, flop_per_cyc, flop_per_byte, id) {\n    let x = getXPixel(ctx, xoptions, margin, flop_per_byte);\n    let y = getYPixel(ctx, yoptions, margin, flop_per_cyc);\n    dotdata.push({x: x, y: y, floppercyc: flop_per_cyc, flopperbyte: flop_per_byte, highlight: false, id: id});\n}\n\n\nfunction drawInfoBox(ctx, x, y, sidelen, id=undefined) {\n    \n    let triangle_size = 20;\n    let boxleft = x - sidelen;\n    let boxright = x + sidelen;\n    let boxbottom = y - triangle_size;\n    let boxtop = boxbottom - sidelen;\n\n    ctx.save();\n    ctx.fillStyle = \"cyan\";\n    ctx.moveTo(x, y);\n    \n    ctx.beginPath();\n\n    ctx.lineTo(x - triangle_size, boxbottom);\n    ctx.lineTo(boxleft, boxbottom);\n    ctx.lineTo(boxleft, boxtop);\n    ctx.lineTo(boxright, boxtop);\n    ctx.lineTo(boxright, boxbottom);\n    ctx.lineTo(x + triangle_size, boxbottom);\n    ctx.lineTo(x, y);\n\n    ctx.closePath();\n    ctx.stroke();\n    ctx.fill();\n\n    ctx.fillStyle = \"black\";\n    ctx.font = \"40px Arial\";\n    ctx.textBaseline = \"top\";\n    if(id !== undefined) {\n        ctx.fillText(\"id: \" + id, boxleft + triangle_size, boxtop + triangle_size);\n    }\n    ctx.restore();\n}\n\n\n\nclass RooflinePainter {\n\n    constructor(ctx, margin, xopts, yopts) {\n        this.ctx = ctx;\n        this.margin = margin;\n        this.xoptions = xopts;\n        this.yoptions = yopts;\n    }\n\n    drawAxes() {\n\n        let ctx = this.ctx;\n        let margin = this.margin;\n\n        let width = () => ctx.canvas.width;\n        let height = () => ctx.canvas.height;\n\n        // Draw the y-Axis\n        ctx.strokeStyle = \"black\";\n        ctx.lineWidth = 2;\n        ctx.beginPath();\n        ctx.moveTo(margin().left, height() - margin().bottom);\n        ctx.lineTo(margin().left, margin().top);\n        ctx.stroke();\n        ctx.closePath();\n\n        // Draw the x-Axis\n        ctx.beginPath();\n        ctx.moveTo(margin().left, height() - margin().bottom);\n        ctx.lineTo(width() - margin().right, height() - margin().bottom);\n        ctx.stroke();\n        ctx.closePath();\n\n        drawMarkersX(ctx, margin(), this.xoptions);\n        drawMarkersY(ctx, margin(), this.yoptions);\n    }\n\n    drawDots() {\n        let highlights = [];\n        for(let elem of dotdata) {\n            drawDot(this.ctx, this.xoptions, this.yoptions, this.margin(), elem.floppercyc, elem.flopperbyte, elem.highlight ? 10 : 5);\n            if(elem.highlight) {\n                highlights.push(elem);\n            }\n        }\n\n        for(let elem of highlights) {\n            elem.x = getXPixel(this.ctx, this.xoptions, this.margin(), elem.flopperbyte);\n            elem.y = getYPixel(this.ctx, this.yoptions, this.margin(), elem.floppercyc);\n            drawInfoBox(this.ctx, elem.x, elem.y, 200, elem.id);\n        }\n    }\n\n    drawComputeBounds() {\n        let i = 0;\n        for(let elem of flopbounds) {\n            if(i == 0) {\n                fillLine(this.ctx, this.margin(), this.yoptions, elem, \"hard\");\n            }\n            else {\n                fillLine(this.ctx, this.margin(), this.yoptions, elem, \"soft\");\n            }\n            ++i;\n        }\n    }\n\n    drawBandwidthBounds() {\n        for(let elem of bandwidthbounds) {\n            fillBandwidthBound(this.ctx, this.margin(), this.xoptions, this.yoptions, elem);\n        }\n    }\n\n    connectDots() {\n        let dot_x = undefined;\n        let dot_y = undefined;\n        this.ctx.beginPath();\n        for(let dot of dotdata) {\n            let x = dot.x;\n            let y = dot.y;\n            let first = dot_x === undefined;\n            if(first) {\n                this.ctx.moveTo(x, y);\n            }\n            else {\n                this.ctx.lineTo(x, y);\n                this.ctx.stroke();\n            }\n            dot_x = x;\n            dot_y = y;\n            \n        }\n    }\n}\n\n\n\nfunction main(canvas=undefined, message_source=undefined) {\n\n    if(canvas == undefined) canvas = document.getElementById(\"myCanvas\");\n    let ctx = canvas.getContext(\"2d\");\n\n    \n\n    let width = () => ctx.canvas.width;\n    let height = () => ctx.canvas.height;\n\n    let margin = () => { return {\n            top: 100,\n            bottom: 100,\n            left: 200,\n            right: 100\n        };\n    };\n\n    let xoptions = {\n        steps: 20,\n        value_per_step: 1,\n        step_value_func: (step) => {\n            return Math.pow(2.0, -6.0 + step);\n        },\n        inv_step_value_func: (step) => {\n            return 6.0 + Math.log2(step);\n        }\n    };\n    let yoptions = {\n        steps: 15,\n        value_per_step: 1,\n        step_value_func: (step) => {\n            return Math.pow(2.0, -8.0 + step);\n        },\n        inv_step_value_func: (step) => {\n            return 8.0 + Math.log2(step);\n        }\n    };\n\n    let painter = new RooflinePainter(ctx, margin, xoptions, yoptions);\n\n    canvas.addEventListener(\"mousemove\", (event) => {\n        let rect = canvas.getBoundingClientRect();\n        let x = (event.clientX - rect.left) / (rect.right - rect.left) * canvas.width;\n        let y = (event.clientY - rect.top) / (rect.bottom - rect.top) * canvas.height;\n\n        let tol = 15;\n        let pow2 = x => x*x;\n        \n        for(let elem of dotdata)\n        {\n            elem.x = getXPixel(ctx, xoptions, margin(), elem.flopperbyte);\n            elem.y = getYPixel(ctx, yoptions, margin(), elem.floppercyc);\n            if(pow2(elem.x - x) + pow2(elem.y - y) <= pow2(tol))\n            {\n                elem.highlight = true;\n            }\n            else\n                elem.highlight = false;\n        }\n\n        draw_full(ctx, painter);\n    });\n\n    /*\n    Clicking should cause the program with the given id to be highlighted. For that, a message has to be sent to the \"host\".\n    */\n    canvas.addEventListener(\"click\", (event) => {\n        let rect = canvas.getBoundingClientRect();\n        let x = (event.clientX - rect.left) / (rect.right - rect.left) * canvas.width;\n        let y = (event.clientY - rect.top) / (rect.bottom - rect.top) * canvas.height;\n\n        let tol = 15;\n        let pow2 = x => x*x;\n        \n        for(let elem of dotdata)\n        {\n            if(pow2(elem.x - x) + pow2(elem.y - y) <= pow2(tol))\n            {\n                roofline_socket.send(JSON.stringify({\"msg_type\": \"roofline\", \"command\": \"select-program\", \"programID\": elem.id}));\n                return; // Dots sadly could be interleaving. To not send too many select requests, we have to end it here\n            }\n            \n        }\n    });\n\n\n\n    fillLine(ctx, margin(), yoptions, 8.0);\n    fillBandwidthBound(ctx, margin(), xoptions, yoptions, 8);\n\n    flopbounds.push(64.0, 8.0);\n    bandwidthbounds.push(8.0);\n\n    setDot(ctx, xoptions, yoptions, margin(), 1, 1, 1);\n    setDot(ctx, xoptions, yoptions, margin(), 2, 3, 2);\n    setDot(ctx, xoptions, yoptions, margin(), 4, 6, 3);\n    setDot(ctx, xoptions, yoptions, margin(), 7, 7, 4);\n    setDot(ctx, xoptions, yoptions, margin(), 8, 8, 5);\n\n    draw_full(ctx, painter);\n\n    let data_proc = msg => {\n        if(msg[\"msg_type\"] == \"roofline-data\") {\n\n            dotdata = [];\n\n            let data = msg[\"data\"];\n\n            for(let x of data) {\n                let pid = x[\"ProgramID\"];\n                let flop_per_c = x[\"FLOP_C\"];\n                let in_b_per_c = x[\"INPUT_B_C\"];\n                let proc_b_per_c = x[\"PROC_B_C\"];\n                let mem_b_per_c = x[\"MEM_B_C\"];\n\n\n                let flop_per_byte = flop_per_c / mem_b_per_c;\n\n                // We'll use the in-memory (which is not quite accurate, since out-data usually has to be loaded as well)\n                setDot(ctx, xoptions, yoptions, margin(), flop_per_c, flop_per_byte, pid);\n            }\n        }\n    };\n    \n    let socksetup = () => {\n        roofline_socket = new WebSocket('ws://localhost:8024/');\n\n        roofline_socket.onopen = function (event) {\n            roofline_socket.send(JSON.stringify({\"msg_type\": \"roofline\", \"command\": \"connected\"}));\n        }\n        roofline_socket.onmessage = function (event) {\n\n            msg = JSON.parse(event.data);\n            data_proc(msg);\n        }\n        roofline_socket.onclose = function (event) {\n            console.log(\"ERROR: Connection closed!\");\n        }\n        roofline_socket.onerror = function (event) {\n            console.log(\"ERROR: There was an error with the connection.\");\n        }\n        \n    };\n\n    if(message_source == undefined)\n        socksetup();\n    else {\n        message_source(data_proc);\n    }\n\n    return () => draw_full(ctx, painter);\n}\n\nexport {main as main};","import { REST_request } from \"../../main\";\nimport * as Roofline from \"../../../renderer_dir/Roofline/main\";\nimport { DIODE_Context } from \"./context\";\n\n\nexport class DIODE_Context_Roofline extends DIODE_Context {\n    constructor(diode, gl_container, state) {\n        super(diode, gl_container, state);\n        this._proc_func = null;\n    }\n\n    setupEvents(project) {\n        super.setupEvents(project);\n\n        const eh = this.diode.goldenlayout.eventHub;\n        const transthis = this;\n\n        /*this.on(this.project().eventString('-req-new-time'), (msg) => {\n            setTimeout(x => eh.emit(transthis.project().eventString('new-time'), 'ok'), 1);\n            this.addTime(msg.time);\n        });*/\n    }\n\n    create() {\n        const parent = this.container.getElement()[0];\n        parent.style.width = \"100%\";\n        parent.style.height = \"100%\";\n\n        const canvas = document.createElement(\"canvas\");\n        canvas.width = 1920;\n        canvas.height = 1080;\n\n        const redraw_func = Roofline.main(canvas, proc_func => {\n            // Setup code, called on init. Incoming data must be passed to proc_func\n            this._proc_func = proc_func;\n        });\n\n        const on_resize = () => {\n            console.log(\"Resizing\");\n            canvas.width = parseInt(parent.style.width) - 20;\n            canvas.height = parseInt(parent.style.height) - 20;\n\n            // Reset then\n            redraw_func();\n        };\n\n        parent.addEventListener(\"resize\", on_resize);\n\n        if (window.ResizeObserver) {\n            new ResizeObserver(on_resize).observe(parent);\n        } else {\n            console.warn(\"ResizeObserver not available\");\n        }\n\n        parent.appendChild(canvas);\n\n        REST_request('/dace/api/v1.0/perfdata/roofline/', {\n            client_id: this.diode.getClientID()\n        }, xhr => {\n            if (xhr.readyState === 4 && xhr.status === 200) {\n                this._proc_func(JSON.parse(xhr.response));\n            }\n        });\n    }\n\n\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\nimport { DIODE } from \"./diode-ui/diode\"\nimport { DIODE_Context_Settings } from \"./diode-ui/contexts/settings\";\nimport { DIODE_Context_DIODESettings } from \"./diode-ui/contexts/diode_settings\";\nimport { DIODE_Context_CodeIn } from \"./diode-ui/contexts/code_in\";\nimport { DIODE_Context_Terminal } from \"./diode-ui/contexts/terminal\";\nimport { DIODE_Context_CodeOut } from \"./diode-ui/contexts/code_out\";\nimport { DIODE_Context_SDFG } from \"./diode-ui/contexts/sdfg\";\nimport { DIODE_Context_PropWindow } from \"./diode-ui/contexts/prop_window\";\nimport { DIODE_Context_Runqueue } from \"./diode-ui/contexts/runqueue\";\nimport { DIODE_Context_StartPage } from \"./diode-ui/contexts/start_page\";\nimport { DIODE_Context_TransformationHistory } from \"./diode-ui/contexts/transformation_history\";\nimport { DIODE_Context_AvailableTransformations } from \"./diode-ui/contexts/available_transformations\";\nimport { DIODE_Context_Error } from \"./diode-ui/contexts/error\";\nimport { DIODE_Context_RunConfig } from \"./diode-ui/contexts/run_config\";\nimport { DIODE_Context_PerfTimes } from \"./diode-ui/contexts/perf_times\";\nimport { DIODE_Context_InstrumentationControl } from \"./diode-ui/contexts/instrumentation_control\";\nimport { DIODE_Context_Roofline } from \"./diode-ui/contexts/roofline\";\n\nconst base_url = \"//\" + window.location.host;\nglobalThis.base_url = base_url;\n\n// we cannot import jQuery from npm because w2ui only hijacks the global jQuery instance and has no npm package available\nconst { $ } = globalThis;\n\nstart_DIODE();\n\n\nexport function find_object_cycles(obj) {\n    const found = [];\n\n    const detect = (x, path) => {\n        if (typeof (x) == \"string\") {\n\n        }\n        else if (x instanceof Array) {\n            let index = 0;\n            for (const y of x) {\n                detect(y, [...path, index])\n                ++index;\n            }\n        }\n        else if (x instanceof Object) {\n            if (found.indexOf(x) !== -1) {\n                // Cycle found\n                throw [\"Cycle\", path, x];\n            }\n            found.push(x);\n            for (const y of Object.keys(x)) {\n                if (x.hasOwnProperty(y)) {\n                    detect(x[y], [...path, y]);\n                }\n            }\n        }\n    }\n\n    return detect(obj, []);\n\n}\n\nexport function setup_drag_n_drop(elem, callbackSingle, callbackMultiple, options = { readMode: \"text\", condition: (elem) => true }) {\n\n    /*\n        callbackSingle: (mimetype: string, content: string) => mixed\n            Takes the file contents (text) and the mimetype.\n        callbackMultiple: reserved\n        options:\n            .readmode: \"text\" or \"binary\"\n            .condition: Function called with parameter \"elem\" determining if the current element should have the handler active\n    */\n\n    const drag_enter = (e) => {\n        if (!options.condition(elem)) return;\n        e.stopPropagation();\n        e.preventDefault();\n    };\n\n    const drag_over = e => {\n        if (!options.condition(elem)) return;\n        e.stopPropagation();\n        e.preventDefault();\n    };\n\n    const drag_drop = e => {\n        if (!options.condition(elem)) return;\n        const files = Array.from(e.dataTransfer.files);\n\n        if (files.length === 1) {\n            e.stopPropagation();\n            e.preventDefault();\n\n            // A single file was provided\n            const file = files[0];\n\n            const mime = file.type;\n\n            const reader = new FileReader();\n            reader.onload = ev => {\n                callbackSingle(mime, ev.target.result);\n            };\n            if (options.readMode == \"text\") {\n                reader.readAsText(file);\n            }\n            else if (options.readMode == \"binary\") {\n                reader.readAsArrayBuffer(file);\n            }\n            else {\n                throw \"Unimplemented read mode \" + options.readMode;\n            }\n\n        }\n        else if (files.length > 1) {\n            e.stopPropagation();\n            e.preventDefault();\n\n            // #TODO: Deferred \n            alert(\"Cannot handle more than 1 input file at this point\");\n            throw \"Previous alert caused here\";\n        }\n        else {\n            alert(\"Can only drop files at this point - everything else is user-agent-specific!\")\n            throw \"Previous alert caused here\";\n        }\n\n    };\n\n    elem.addEventListener(\"dragenter\", drag_enter, false);\n    elem.addEventListener(\"dragover\", drag_over, false);\n    elem.addEventListener(\"drop\", drag_drop, false);\n}\n\nexport function REST_request(command, payload, callback, method = \"POST\") {\n    const xhr = new XMLHttpRequest();\n    const url = base_url + command;\n    xhr.open(method, url, true);\n    xhr.setRequestHeader(\"Content-Type\", \"application/json\");\n    xhr.onreadystatechange = () => {\n        callback(xhr);\n    };\n    xhr.onerror = (e) => {\n        console.warn(\"Connection error\", e);\n        alert(\"Connection error\");\n    };\n    if (payload != undefined) {\n        const data = JSON.stringify(payload);\n        xhr.send(data);\n    }\n    else {\n        xhr.send();\n    }\n}\n\nexport class FormBuilder {\n\n    static createContainer(idstr) {\n        const elem = document.createElement(\"div\");\n        elem.id = idstr;\n        elem.classList = \"settings_key_value\";\n        return $(elem);\n    }\n\n    static createHostInput(id, onchange, known_list = ['localhost'], initial = \"localhost\") {\n        const elem = document.createElement('input');\n        elem.type = \"list\";\n        elem.id = id;\n        let dlist = document.getElementById(\"hosttype-dlist\");\n        if (!dlist) {\n            dlist = document.createElement(\"datalist\");\n            dlist.id = \"hosttype-dlist\";\n            document.body.appendChild(dlist);\n        }\n        $(elem).attr(\"list\", \"hosttype-dlist\");\n        dlist.innerHTML = \"\";\n        for (const x of known_list) {\n            dlist.innerHTML += '<option value=\"' + x + '\">'\n        }\n\n        elem.value = initial;\n        elem.onchange = () => {\n            onchange(elem);\n        };\n\n        return $(elem);\n    }\n\n    static createComboboxInput(id, onchange, known_list, initial) {\n        const elem = document.createElement('div');\n        const inputelem = document.createElement('input');\n        inputelem.type = \"list\";\n        inputelem.id = id;\n        inputelem.onfocus = () => {\n            // Clear (this will make it act more like a select)\n            const oldvalue = inputelem.value;\n            inputelem.onblur = () => {\n                inputelem.value = oldvalue;\n            }\n            inputelem.value = \"\";\n\n        }\n        const dlist = document.createElement(\"datalist\");\n        dlist.id = id + \"-dlist\";\n        elem.appendChild(dlist);\n\n        $(inputelem).attr(\"list\", id + \"-dlist\");\n        dlist.innerHTML = \"\";\n        for (const x of known_list) {\n            dlist.innerHTML += '<option value=\"' + x + '\">'\n        }\n\n        inputelem.value = initial;\n        inputelem.onchange = () => {\n            inputelem.onblur = null;\n            onchange(inputelem);\n        };\n\n        elem.appendChild(inputelem);\n\n        return $(elem);\n    }\n\n    static createCodeReference(id, onclick, obj) {\n        const elem = document.createElement('span');\n        elem.id = id;\n        elem.addEventListener('click', x => {\n            onclick(x);\n        });\n        elem.classList.add(\"code_ref\");\n\n        if (obj == null || obj.filename == null) {\n            elem.innerText = \"N/A\";\n            elem.title = \"The DebugInfo for this element is not defined\";\n        }\n        else {\n            const split = obj.filename.split(\"/\");\n            const fname = split[split.length - 1];\n\n            elem.innerText = fname + \":\" + obj.start_line;\n            elem.title = obj.filename;\n        }\n\n        return $(elem);\n    }\n\n    static createLabel(id, labeltext, tooltip) {\n        const elem = document.createElement(\"span\");\n        elem.id = id;\n        elem.innerHTML = labeltext;\n        elem.title = tooltip;\n        elem.classList = \"title\";\n\n        return $(elem);\n    }\n\n    static createToggleSwitch(id, onchange, initial = false) {\n        const legacy = false;\n        const elem = document.createElement(\"input\");\n        elem.onchange = () => {\n            onchange(elem);\n        }\n        elem.type = \"checkbox\";\n        elem.id = id;\n        elem.checked = initial;\n\n\n        if (!legacy) {\n            // Add CSS \"toggle-slider\" elements\n            // This requires more HTML.\n            const styled_elem = document.createElement(\"label\");\n            styled_elem.classList = \"switch\";\n            $(styled_elem).append(elem);\n            $(styled_elem).append($('<span class=\"slider round\"></span>'));\n            return $(styled_elem);\n        }\n\n        return $(elem);\n    }\n\n\n    static createTextInput(id, onchange, initial = '') {\n        const elem = document.createElement(\"input\");\n        // oninput triggers on every change (as opposed to onchange, which only changes on deselection)\n        elem.onchange = () => {\n            onchange(elem);\n        }\n        elem.type = \"text\";\n        elem.id = id;\n        elem.value = initial\n        return $(elem);\n    }\n\n    static createLongTextInput(id, onchange, initial = '') {\n        const elem = document.createElement(\"textarea\");\n        // oninput triggers on every change (as opposed to onchange, which only changes on deselection)\n        elem.onchange = () => {\n            onchange(elem.innerHTML);\n        }\n        elem.id = id;\n        elem.innerHTML = initial\n        return $(elem);\n    }\n\n    static createSelectInput(id, onchange, options, initial = '') {\n        const elem = document.createElement(\"select\");\n\n        for (const option of options) {\n            const option_elem = document.createElement('option');\n            option_elem.innerText = option;\n            elem.append(option_elem);\n        }\n\n        // oninput triggers on every change (as opposed to onchange, which only changes on deselection)\n        elem.oninput = () => {\n            onchange(elem);\n        }\n        elem.id = id;\n        elem.value = initial;\n        return $(elem);\n    }\n\n    static createIntInput(id, onchange, initial = 0) {\n        const elem = document.createElement(\"input\");\n        elem.oninput = () => {\n            onchange(elem);\n        }\n        elem.type = \"number\";\n        elem.step = 1;\n        elem.id = id;\n        elem.value = initial;\n        return $(elem);\n    }\n\n\n    static createFloatInput(id, onchange) {\n        const elem = document.createElement(\"input\");\n        elem.oninput = () => {\n            onchange(elem);\n        }\n        elem.type = \"number\";\n        elem.id = id;\n        return $(elem);\n    }\n\n    static createButton(id, onclick, label) {\n        const elem = document.createElement(\"button\");\n        elem.onclick = () => {\n            onclick(elem);\n        };\n        elem.innerHTML = label;\n        return $(elem);\n    }\n}\n\nfunction start_DIODE() {\n    const diode = new DIODE();\n    window.diode = diode;\n    diode.initEnums();\n    diode.pubSSH(true);\n\n    $(\"#toolbar\").w2toolbar({\n        name: \"toolbar\",\n        items: [\n            {\n                type: 'menu', id: 'file-menu', caption: 'File', icon: 'material-icons-outlined gmat-folder', items: [\n                    { text: 'Start', icon: 'material-icons-outlined gmat-new_folder', id: 'start' },\n                    { text: 'Open', icon: 'material-icons-outlined gmat-open', id: 'open-file' },\n                    { text: 'Save', icon: 'material-icons-outlined gmat-save', id: 'save' },\n                ]\n            },\n            { type: 'break', id: 'break0' },\n            {\n                type: 'menu', id: 'settings-menu', caption: 'Settings', icon: 'material-icons-outlined gmat-settings', items: [\n                    { text: 'DACE settings', icon: 'material-icons-outlined gmat-settings-cloud', id: 'diode-settings' },\n                    { text: 'DIODE settings', icon: 'material-icons-outlined gmat-settings-application', id: 'diode-settings' },\n                    { text: 'Run Configurations', icon: 'material-icons-outlined gmat-playlist_play', id: 'runoptions' },\n                    { text: 'Runqueue', icon: 'material-icons-outlined gmat-view_list', id: 'runqueue' },\n                    { text: 'Perfdata', id: 'perfdata' },\n                    { text: 'Perftimes', id: 'perftimes' },\n                ]\n            },\n            {\n                type: 'menu', icon: 'material-icons-outlined gmat-build', id: 'compile-menu', caption: 'Compile', items: [\n                    { text: 'Compile', id: 'compile', icon: 'material-icons-outlined gmat-gavel' },\n                    { text: 'Run', id: 'run', icon: 'material-icons-outlined gmat-play' },\n                    { text: 'Discard changes and compile source', id: 'compile-clean', icon: 'material-icons-outlined gmat-clear' },\n                ]\n            },\n            {\n                type: 'menu-radio', id: 'runconfig', text: function (item) {\n                    const t = (typeof (item.selected) == 'string') ? item.selected : item.selected(); const el = this.get('runconfig:' + t); return \"Config: \" + ((el == null) ? diode.getCurrentRunConfigName() : el.text);\n                }, selected: function (item) {\n                    return diode.getCurrentRunConfigName();\n                }, items: [{\n                    id: 'default', text: \"default\"\n                }\n                ]\n            },\n            {\n                type: 'menu', id: 'transformation-menu', caption: 'Transformations', items: [\n                    { text: 'History', id: 'history' },\n                    { text: 'Available Transformations', id: 'available' },\n\n                ]\n            },\n            {\n                type: 'menu', id: 'group-menu', caption: 'Group', icon: 'material-icons-outlined gmat-apps', items: [\n                    //{ text: 'Group by SDFGs', id: 'group-sdfgs' }, \n                    { text: 'Group default', id: 'group-diode1' }\n                ]\n            },\n            { type: 'menu', id: 'closed-windows', caption: 'Closed windows', icon: 'material-icons-outlined gmat-reopen', items: [] },\n        ],\n        onClick: function (event) {\n            if (event.target === 'file-menu:open-file') {\n                diode.openUploader(\"code-python\");\n            }\n            if (event.target === 'file-menu:start') {\n                // Close all windows before opening Start component\n                diode.closeAll();\n\n                const config = {\n                    type: 'component',\n                    componentName: 'StartPageComponent',\n                    componentState: {}\n                };\n\n                diode.addContentItem(config);\n            }\n            if (event.target === 'file-menu:save') {\n                diode.project().save();\n            }\n            if (event.target == \"settings-menu:diode-settings\") {\n                diode.open_diode_settings();\n            }\n            if (event.target == \"settings-menu:runqueue\") {\n                diode.open_runqueue();\n            }\n            if (event.target == \"settings-menu:perfdata\") {\n                //diode.load_perfdata();\n                diode.show_inst_options();\n            }\n            if (event.target == \"settings-menu:perftimes\") {\n                diode.show_exec_times();\n            }\n            if (event.target == \"group-menu:group-sdfgs\") {\n                diode.groupOptGraph(); diode.groupSDFGsAndCodeOutsTogether();\n            }\n            if (event.target == \"group-menu:group-diode1\") {\n                diode.groupLikeDIODE1();\n            }\n            if (event.target == \"runconfig\") {\n                const m = this.get(event.target);\n\n                const configs = diode.getRunConfigs();\n\n                m.items = [];\n\n                for (const c of configs) {\n                    const cname = c['Configuration name'];\n                    m.items.push({ id: cname, text: cname });\n                }\n            }\n            if (event.target.startsWith(\"runconfig:\")) {\n                const name = event.target.substr(\"runconfig:\".length);\n                diode.setCurrentRunConfig(name);\n            }\n            if (event.target == \"transformation-menu:history\") {\n                diode.addContentItem({\n                    type: 'component',\n                    componentName: 'TransformationHistoryComponent',\n                    title: \"Transformation History\",\n                    componentState: {}\n                });\n            }\n            if (event.target == \"transformation-menu:available\") {\n                diode.addContentItem({\n                    type: 'component',\n                    componentName: 'AvailableTransformationsComponent',\n                    componentState: {}\n                });\n            }\n            if (event.target == \"compile-menu:compile\") {\n                // \"Normal\" recompilation\n                diode.gatherProjectElementsAndCompile(diode, {}, {\n                    sdfg_over_code: true\n                });\n            }\n            if (event.target == \"compile-menu:compile-clean\") {\n                diode.project().request([\"clear-errors\"], () => { });\n                diode.project().discardTransformationsAfter(0);\n                // Compile, disregarding everything but the input code\n                diode.project().request(['input_code'], msg => {\n                    diode.compile(diode, msg['input_code']);\n                }, {\n                    timeout: 300,\n                    on_timeout: () => alert(\"No input code found, open a new file\")\n                });\n            }\n            if (event.target == \"settings-menu:runoptions\") {\n                diode.show_run_options(diode);\n            }\n            if (event.target == \"compile-menu:run\") {\n                // Running\n\n                diode.ui_compile_and_run(diode);\n            }\n            if (event.target == \"closed-windows\") {\n                const m = this.get(event.target);\n\n                // Clear the items first (they will be re-read from the project)\n                m.items = [];\n\n                // Add a \"clear all\"\n                m.items.push({ text: \"Clear all\", id: 'clear-closed-windows', icon: 'material-icons-outlined gmat-clear' });\n\n                const elems = diode.project().getClosedWindowsList();\n                for (const x of elems) {\n                    const name = x[0];\n\n                    m.items.push({ text: name, id: 'open-closed-' + x[1].created });\n                }\n\n                this.refresh();\n\n            }\n            if (event.target == 'closed-windows:clear-closed-windows') {\n                diode.project().clearClosedWindowsList();\n            }\n            if (event.target.startsWith(\"closed-windows:open-closed-\")) {\n                // This is a request to re-open a closed window\n                let name = event.target;\n                name = name.substr(\"closed-windows:open-closed-\".length);\n\n                diode.project().reopenClosedWindow(name);\n\n            }\n        }\n    });\n\n\n    const goldenlayout_config = {\n        content: [{\n            type: 'row',\n            content: [{\n                type: 'component',\n                componentName: 'StartPageComponent',\n                componentState: {}\n            }]\n        }]\n    };\n\n    const saved_config = sessionStorage.getItem('savedState');\n    //saved_config = null; // Don't save the config during development\n    let goldenlayout = null;\n    if (saved_config !== null) {\n        goldenlayout = new GoldenLayout(JSON.parse(saved_config), $('#diode_gl_container'));\n    }\n    else {\n        goldenlayout = new GoldenLayout(goldenlayout_config, $('#diode_gl_container'));\n    }\n\n    goldenlayout.on('stateChanged', diode.debounce(\"stateChanged\", () => {\n        if (!(goldenlayout.isInitialised && goldenlayout.openPopouts.every(popout => popout.isInitialised))) {\n            return;\n        }\n        // Don't serialize SubWindows\n        if (goldenlayout.isSubWindow)\n            return;\n        const tmp = goldenlayout.toConfig();\n        //find_object_cycles(tmp);\n        const state = JSON.stringify(tmp);\n        sessionStorage.setItem('savedState', state);\n    }, 500));\n\n    if (!goldenlayout.isSubWindow) {\n        goldenlayout.eventHub.on('create-window-in-main', x => {\n            const config = JSON.parse(x);\n\n            diode.addContentItem(config);\n        });\n    }\n\n    goldenlayout.registerComponent('testComponent', (container, componentState) => {\n        container.getElement().html('<h2>' + componentState.label + '</h2>');\n    });\n    goldenlayout.registerComponent('SettingsComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_Settings(diode, container, componentState);\n        $(container.getElement()).load(\"settings_view.html\", () => {\n            diode_context.get_settings();\n        });\n\n    });\n    goldenlayout.registerComponent('PerfTimesComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_PerfTimes(diode, container, componentState);\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.create();\n    });\n    goldenlayout.registerComponent('InstControlComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_InstrumentationControl(diode, container, componentState);\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.create();\n    });\n    goldenlayout.registerComponent('RooflineComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_Roofline(diode, container, componentState);\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.create();\n    });\n    goldenlayout.registerComponent('SDFGComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_SDFG(diode, container, componentState);\n\n        diode_context.create_renderer_pane(componentState[\"sdfg_data\"]);\n        diode_context.setupEvents(diode.getCurrentProject());\n    });\n    goldenlayout.registerComponent('TransformationHistoryComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_TransformationHistory(diode, container, componentState);\n        diode_context.setupEvents(diode.getCurrentProject());\n        const hist = diode_context.project().getTransformationHistory();\n        diode_context.create(hist);\n\n    });\n    goldenlayout.registerComponent('AvailableTransformationsComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_AvailableTransformations(diode, container, componentState);\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.create();\n\n    });\n    goldenlayout.registerComponent('CodeInComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_CodeIn(diode, container, componentState);\n        const editorstring = \"code_in_\" + diode_context.created;\n        const parent_element = $(container.getElement());\n        const new_element = $(\"<div id='\" + editorstring + \"' style='height: 100%; width: 100%; overflow-y:auto'></div>\");\n\n\n        parent_element.append(new_element);\n        parent_element.hide().show(0);\n\n        (function () {\n            const editor_div = new_element;\n            editor_div.attr(\"id\", editorstring);\n            editor_div.text(componentState.code_content);\n            editor_div.hide().show(0);\n            const editor = ace.edit(new_element[0]);\n            editor.setTheme(DIODE.themeString());\n            editor.session.setMode(\"ace/mode/python\");\n            editor.getSession().on('change', () => {\n                container.extendState({ \"code_content\": editor.getValue() });\n            });\n\n            setup_drag_n_drop(new_element[0], (mime, content) => {\n                // #TODO: Set session mode from mime type - but we need a switch to manually do that first\n                console.log(\"File dropped\", mime, content);\n\n                editor.setValue(content);\n                editor.clearSelection();\n            });\n\n            editor.resize();\n\n            editor.commands.addCommand({\n                name: 'Compile',\n                bindKey: { win: 'Ctrl-P', mac: 'Command-P' },\n                exec: function (editor) {\n                    alert(\"Compile pressed\");\n                    diode_context.compile(editor.getValue());\n                },\n                readOnly: true // false if this command should not apply in readOnly mode\n            });\n            editor.commands.addCommand({\n                name: 'Compile and Run',\n                bindKey: { win: 'Alt-R', mac: 'Alt-R' },\n                exec: function (editor) {\n                    alert(\"Compile & Run pressed\");\n                    diode_context.compile_and_run(editor.getValue());\n                },\n                readOnly: true // false if this command should not apply in readOnly mode\n            });\n            diode_context.setEditorReference(editor);\n            diode_context.setupEvents(diode.getCurrentProject());\n        })\n            ()\n            ;\n\n\n    });\n\n    goldenlayout.registerComponent('CodeOutComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_CodeOut(diode, container, componentState);\n        const editorstring = \"code_out_\" + diode_context.created;\n        const parent_element = $(container.getElement());\n        const new_element = $(\"<div id='\" + editorstring + \"' style='height: 100%; width: 100%; overflow:auto'></div>\");\n\n\n        parent_element.append(new_element);\n        parent_element.hide().show(0);\n\n        (() => {\n            const editor_div = new_element;\n            editor_div.attr(\"id\", editorstring);\n            editor_div.hide().show(0);\n            const editor = ace.edit(new_element[0]);\n            editor.setTheme(DIODE.themeString());\n            editor.session.setMode(\"ace/mode/c_cpp\");\n            editor.setReadOnly(true);\n\n\n            diode_context.setEditorReference(editor);\n            diode_context.setupEvents(diode.getCurrentProject());\n\n            const extracted = diode_context.getState().code;\n            diode_context.setCode(extracted);\n            editor.resize();\n        })\n            ()\n            ;\n\n\n    });\n\n    // Create an error component which is used for all errors originating in python.\n    // As such, the errors are usually tracebacks. The current implementation\n    // (just displaying the output) is rudimentary and can/should be improved.\n    // #TODO: Improve the error-out formatting\n    goldenlayout.registerComponent('ErrorComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_Error(diode, container, componentState);\n        const editorstring = \"error_\" + diode_context.created;\n        const parent_element = $(container.getElement());\n        const new_element = $(\"<div id='\" + editorstring + \"' style='height: 100%; width: 100%; overflow:auto'></div>\");\n\n\n        parent_element.append(new_element);\n        parent_element.hide().show(0);\n\n        (() => {\n            const editor_div = new_element;\n            editor_div.attr(\"id\", editorstring);\n            editor_div.hide().show(0);\n            const editor = ace.edit(new_element[0]);\n            editor.setTheme(DIODE.themeString());\n            editor.session.setMode(\"ace/mode/python\");\n\n\n            diode_context.setEditorReference(editor);\n            diode_context.setupEvents(diode.getCurrentProject());\n\n            const extracted = diode_context.getState().error;\n            diode_context.setError(extracted);\n            editor.resize();\n        })\n            ()\n            ;\n\n\n    });\n\n    goldenlayout.registerComponent('TerminalComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_Terminal(diode, container, componentState);\n        const editorstring = \"terminal_\" + diode_context.created;\n        const parent_element = $(container.getElement());\n        const new_element = $(\"<div id='\" + editorstring + \"' style='height: 100%; width: 100%; overflow:auto'></div>\");\n\n        parent_element.append(new_element);\n        parent_element.hide().show(0);\n\n\n        const editor_div = new_element;\n        editor_div.hide().show(0);\n        const editor = ace.edit(new_element[0]);\n        editor.setTheme(DIODE.themeString());\n        editor.session.setMode(\"ace/mode/sh\");\n        editor.setReadOnly(true);\n\n        const firstval = diode_context.getState().current_value;\n        if (firstval !== undefined)\n            editor.setValue(firstval);\n        editor.clearSelection();\n\n        diode_context.setEditorReference(editor);\n\n        console.log(\"Client listening to\", editorstring);\n\n        goldenlayout.eventHub.on(editorstring, (e) => {\n            diode_context.append(e);\n        });\n\n        diode_context.setupEvents(diode.getCurrentProject());\n    });\n\n    goldenlayout.registerComponent('DIODESettingsComponent', (container, componentState) => {\n        const diode_context = new DIODE_Context_DIODESettings(diode, container, componentState);\n        const divstring = \"diode_settings\" + diode_context.created;\n        const parent_element = $(container.getElement());\n        const new_element = $(\"<div id='\" + divstring + \"' style='height: 100%; width: 100%; overflow:auto'></div>\");\n\n        new_element.append(\"<h1>DIODE settings</h1>\");\n        diode_context.setContainer(new_element);\n        parent_element.append(new_element);\n\n    });\n\n    goldenlayout.registerComponent('RunConfigComponent', (container, componentState) => {\n        const diode_context = new DIODE_Context_RunConfig(diode, container, componentState);\n\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.create();\n    });\n\n    goldenlayout.registerComponent('PropWinComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_PropWindow(diode, container, componentState);\n\n        const elem = document.createElement('div');\n        elem.classList.add(\"sdfgpropdiv\");\n        elem.style = \"width: 100%; height: 100%\";\n        $(container.getElement()).append(elem);\n\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.createFromState();\n    });\n\n    goldenlayout.registerComponent('StartPageComponent', (container, componentState) => {\n        const diode_context = new DIODE_Context_StartPage(diode, container, componentState);\n\n\n\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.create();\n    });\n\n    goldenlayout.registerComponent('RunqueueComponent', (container, componentState) => {\n        // Wrap the component in a context \n        const diode_context = new DIODE_Context_Runqueue(diode, container, componentState);\n\n\n        diode_context.setupEvents(diode.getCurrentProject());\n        diode_context.create();\n    });\n\n    goldenlayout.on('itemDestroyed', e => {\n        if (e.config.componentState === undefined) {\n            // Skip non-components\n            return;\n        }\n        const x = e.config.componentState.created;\n        goldenlayout.eventHub.emit('destroy-' + x);\n        console.log(\"itemDestroyed\", e);\n    });\n\n    diode.setLayout(goldenlayout);\n    diode.getProject();\n\n\n    goldenlayout.init();\n\n    window.addEventListener('resize', x => {\n        // goldenlayout does not listen to resize events if it is not full-body\n        // So it must be notified manually\n        goldenlayout.updateSize();\n    });\n\n\n    document.body.addEventListener('keydown', (ev) => {\n        diode.onKeyDown(ev);\n    });\n    document.body.addEventListener('keyup', (ev) => {\n        diode.onKeyUp(ev);\n    });\n    diode.addKeyShortcut('gg', () => { diode.groupOptGraph(); diode.groupSDFGsAndCodeOutsTogether(); });\n    diode.addKeyShortcut('gd', () => { diode.groupLikeDIODE1(); });\n    diode.addKeyShortcut('0', () => {\n        diode.open_diode_settings();\n    });\n    diode.addKeyShortcut('r', () => { diode.gatherProjectElementsAndCompile(diode, {}, { sdfg_over_code: true }); });\n    diode.addKeyShortcut('s', () => { diode.project().save(); }, false, true);\n\n    diode.setupEvents();\n\n    // Add drag & drop for the empty goldenlayout container\n    const dgc = $(\"#diode_gl_container\");\n    const glc = dgc[0].firstChild;\n    setup_drag_n_drop(glc, (mime, content) => {\n        console.log(\"File dropped\", mime, content);\n\n        const config = {\n            type: \"component\",\n            componentName: \"CodeInComponent\",\n            componentState: {\n                code_content: content\n            }\n        };\n\n        diode.addContentItem(config);\n    }, undefined, {\n        readMode: \"text\",\n        condition: (elem) => elem.childNodes.length == 0 // Only if empty\n    });\n}\n","\nexport class GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        this.overlay_manager = overlay_manager;\n        this.symbol_resolver = this.overlay_manager.symbol_resolver;\n        this.renderer = renderer;\n        this.vscode = typeof vscode !== 'undefined' && vscode;\n\n        this.badness_scale_center = 5;\n    }\n\n    draw() {\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        return false;\n    }\n\n    refresh() {\n    }\n\n}\n","import { NestedSDFG } from '../renderer/renderer_elements';\nimport { GenericSdfgOverlay } from './generic_sdfg_overlay';\nimport { mean, median } from 'mathjs';\nimport { getTempColor } from '../renderer/renderer_elements';\n\n\nexport class MemoryVolumeOverlay extends GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        super(\n            overlay_manager,\n            renderer\n        );\n\n        this.refresh();\n    }\n\n    clear_cached_volume_values() {\n        this.renderer.for_all_elements(0, 0, 0, 0, (type, e, obj, isected) => {\n            if (obj.data) {\n                if (obj.data.volume !== undefined)\n                    obj.data.volume = undefined;\n            }\n        });\n    }\n\n    calculate_volume_edge(edge, symbol_map, volume_values) {\n        let volume_string = undefined;\n        if (edge.data && edge.data.attributes) {\n            volume_string = edge.data.attributes.volume;\n            if (volume_string !== undefined) {\n                volume_string = volume_string.replace(/\\*\\*/g, '^');\n                volume_string = volume_string.replace(/ceiling/g, 'ceil');\n            }\n        }\n        let volume = undefined;\n        if (volume_string !== undefined)\n            volume = this.symbol_resolver.parse_symbol_expression(\n                volume_string,\n                symbol_map\n            );\n\n        edge.data.volume = volume;\n\n        if (volume !== undefined && volume > 0)\n            volume_values.push(volume);\n\n        return volume;\n    }\n\n    calculate_volume_graph(g, symbol_map, volume_values) {\n        const that = this;\n        g.nodes().forEach(v => {\n            const state = g.node(v);\n            const state_graph = state.data.graph;\n            if (state_graph) {\n                state_graph.edges().forEach(e => {\n                    const edge = state_graph.edge(e);\n                    if (edge instanceof Edge)\n                        that.calculate_volume_edge(\n                            edge,\n                            symbol_map,\n                            volume_values\n                        );\n                });\n\n                state_graph.nodes().forEach(v => {\n                    const node = state_graph.node(v);\n                    if (node instanceof NestedSDFG) {\n                        const nested_symbols_map = {};\n                        const mapping = node.data.node.attributes.symbol_mapping;\n                        // Translate the symbol mappings for the nested SDFG\n                        // based on the mapping described on the node.\n                        Object.keys(mapping).forEach((symbol) => {\n                            nested_symbols_map[symbol] =\n                                that.symbol_resolver.parse_symbol_expression(\n                                    mapping[symbol],\n                                    symbol_map\n                                );\n                        });\n                        // Merge in the parent mappings.\n                        Object.keys(symbol_map).forEach((symbol) => {\n                            if (!(symbol in nested_symbols_map))\n                                nested_symbols_map[symbol] = symbol_map[symbol];\n                        });\n\n                        that.calculate_volume_graph(\n                            node.data.graph,\n                            nested_symbols_map,\n                            volume_values\n                        );\n                    }\n                });\n            }\n        });\n    }\n\n    recalculate_volume_values(graph) {\n        this.badness_scale_center = 5;\n\n        const volume_values = [0];\n        this.calculate_volume_graph(\n            graph,\n            this.symbol_resolver.symbol_value_map,\n            volume_values\n        );\n\n        switch (this.overlay_manager.badness_scale_method) {\n            case 'mean':\n                this.badness_scale_center = mean(volume_values);\n                break;\n            case 'median':\n            default:\n                this.badness_scale_center = median(volume_values);\n                break;\n        }\n    }\n\n    refresh() {\n        this.clear_cached_volume_values();\n        this.recalculate_volume_values(this.renderer.graph);\n\n        this.renderer.draw_async();\n    }\n\n    shade_edge(edge, ctx) {\n        const volume = edge.data.volume;\n        if (volume !== undefined) {\n            // Only draw positive volumes.\n            if (volume <= 0)\n                return;\n\n            let badness = (1 / (this.badness_scale_center * 2)) * volume;\n            if (badness < 0)\n                badness = 0;\n            if (badness > 1)\n                badness = 1;\n            const color = getTempColor(badness);\n\n            edge.shade(this.renderer, ctx, color);\n        }\n    }\n\n    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {\n        graph.nodes().forEach(v => {\n            const state = graph.node(v);\n\n            // If we're zoomed out enough that the contents aren't visible, we\n            // skip the state.\n            if (ctx.lod && (ppp >= STATE_LOD || state.width / ppp < STATE_LOD))\n                return;\n\n            // If the node's invisible, we skip it.\n            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,\n                visible_rect.w, visible_rect.h))\n                return;\n\n            const state_graph = state.data.graph;\n            if (state_graph && !state.data.state.attributes.is_collapsed) {\n                state_graph.nodes().forEach(v => {\n                    const node = state_graph.node(v);\n\n                    // Skip the node if it's not visible.\n                    if (ctx.lod && !node.intersect(visible_rect.x,\n                        visible_rect.y, visible_rect.w, visible_rect.h))\n                        return;\n\n                    // If we're zoomed out enough that the node's contents\n                    // aren't visible or the node is collapsed, we skip it.\n                    if (node.data.node.attributes.is_collapsed ||\n                        (ctx.lod && ppp >= NODE_LOD))\n                        return;\n\n                    if (node instanceof NestedSDFG)\n                        this.recursively_shade_sdfg(\n                            node.data.graph, ctx, ppp, visible_rect\n                        );\n                });\n\n                state_graph.edges().forEach(e => {\n                    const edge = state_graph.edge(e);\n\n                    if (ctx.lod && !edge.intersect(visible_rect.x,\n                        visible_rect.y, visible_rect.w, visible_rect.h))\n                        return;\n\n                    this.shade_edge(edge, ctx);\n                });\n            }\n        });\n    }\n\n    draw() {\n        this.recursively_shade_sdfg(\n            this.renderer.graph,\n            this.renderer.ctx,\n            this.renderer.canvas_manager.points_per_pixel(),\n            this.renderer.visible_rect\n        );\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        if (type === 'click' && !ends_drag) {\n            if (foreground_elem !== undefined &&\n                foreground_elem instanceof Edge) {\n                if (foreground_elem.data.volume === undefined) {\n                    if (foreground_elem.data.attributes.volume) {\n                        const that = this;\n                        this.symbol_resolver.parse_symbol_expression(\n                            foreground_elem.data.attributes.volume,\n                            that.symbol_resolver.symbol_value_map,\n                            true,\n                            () => {\n                                that.clear_cached_volume_values();\n                                that.recalculate_volume_values(\n                                    that.renderer.graph\n                                );\n                            }\n                        );\n                    }\n                }\n            }\n        }\n        return false;\n    }\n\n}\n","import { MapExit, NestedSDFG, SDFGNode, State } from '../renderer/renderer_elements';\nimport { GenericSdfgOverlay } from './generic_sdfg_overlay';\nimport { mean, median } from 'mathjs';\nimport { getTempColor } from '../renderer/renderer_elements';\n\n\nexport class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        super(\n            overlay_manager,\n            renderer\n        );\n\n        this.criterium = 'mean';\n        this.runtime_map = {};\n\n        this.badness_scale_center = 0;\n    }\n\n    get_element_uuid(element) {\n        const undefined_val = -1;\n        if (element instanceof State) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.id + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof NestedSDFG) {\n            const sdfg_id = element.data.node.attributes.sdfg.sdfg_list_id;\n            return (\n                sdfg_id + '/' +\n                undefined_val + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof MapExit) {\n            // For MapExit nodes, we want to get the uuid of the corresponding\n            // entry node instead, because the runtime is held there.\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.data.node.scope_entry + '/' +\n                undefined_val\n            );\n        } else if (element instanceof SDFGNode) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.id + '/' +\n                undefined_val\n            );\n        }\n        return (\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val\n        );\n    }\n\n    refresh() {\n        this.badness_scale_center = 5;\n\n        const micros_values = [0];\n\n        for (const key of Object.keys(this.runtime_map)) {\n            // Make sure the overall SDFG's runtime isn't included in this.\n            if (key !== '0/-1/-1/-1')\n                micros_values.push(this.runtime_map[key][this.criterium]);\n        }\n\n        switch (this.overlay_manager.badness_scale_method) {\n            case 'mean':\n                this.badness_scale_center = mean(micros_values);\n                break;\n            case 'median':\n            default:\n                this.badness_scale_center = median(micros_values);\n                break;\n        }\n\n        this.renderer.draw_async();\n    }\n\n    pretty_print_micros(micros) {\n        let unit = 'µs';\n        let value = micros;\n        if (micros > 1000) {\n            unit = 'ms';\n            const millis = micros / 1000;\n            value = millis;\n            if (millis > 1000) {\n                unit = 's';\n                const seconds = millis / 1000;\n                value = seconds;\n            }\n        }\n\n        value = Math.round((value + Number.EPSILON) * 100) / 100;\n        return value.toString() + ' ' + unit;\n    }\n\n    shade_node(node, ctx) {\n        const rt_summary = this.runtime_map[this.get_element_uuid(node)];\n\n        if (rt_summary === undefined)\n            return;\n\n        if (this.renderer.mousepos &&\n            node.intersect(this.renderer.mousepos.x, this.renderer.mousepos.y)) {\n            // Show the measured runtime.\n            if (rt_summary['min'] === rt_summary['max'])\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        this.pretty_print_micros(rt_summary['min'])\n                    );\n                };\n\n            else\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        'Min: ' + this.pretty_print_micros(rt_summary['min']) +\n                        '\\nMax: ' + this.pretty_print_micros(rt_summary['max']) +\n                        '\\nMean: ' + this.pretty_print_micros(rt_summary['mean']) +\n                        '\\nMedian: ' + this.pretty_print_micros(rt_summary['med']) +\n                        '\\nCount: ' + rt_summary['count']\n                    );\n                };\n        }\n\n        // Calculate the 'badness' color.\n        const micros = rt_summary[this.criterium];\n        let badness = (1 / (this.badness_scale_center * 2)) * micros;\n        if (badness < 0)\n            badness = 0;\n        if (badness > 1)\n            badness = 1;\n        const color = getTempColor(badness);\n\n        node.shade(this.renderer, ctx, color);\n    }\n\n    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {\n        // First go over visible states, skipping invisible ones. We only draw\n        // something if the state is collapsed or we're zoomed out far enough.\n        // In that case, we draw the measured runtime for the entire state.\n        // If it's expanded or zoomed in close enough, we traverse inside.\n        graph.nodes().forEach(v => {\n            const state = graph.node(v);\n\n            // If the node's invisible, we skip it.\n            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,\n                visible_rect.w, visible_rect.h))\n                return;\n\n            if ((ctx.lod && (ppp >= STATE_LOD ||\n                state.width / ppp <= STATE_LOD)) ||\n                state.data.state.attributes.is_collapsed) {\n                this.shade_node(state, ctx);\n            } else {\n                const state_graph = state.data.graph;\n                if (state_graph) {\n                    state_graph.nodes().forEach(v => {\n                        const node = state_graph.node(v);\n\n                        // Skip the node if it's not visible.\n                        if (ctx.lod && !node.intersect(visible_rect.x,\n                            visible_rect.y, visible_rect.w, visible_rect.h))\n                            return;\n\n                        if (node.data.node.attributes.is_collapsed ||\n                            (ctx.lod && ppp >= NODE_LOD)) {\n                            this.shade_node(node, ctx);\n                        } else {\n                            if (node instanceof NestedSDFG) {\n                                this.recursively_shade_sdfg(\n                                    node.data.graph, ctx, ppp, visible_rect\n                                );\n                            } else {\n                                this.shade_node(node, ctx);\n                            }\n                        }\n                    });\n                }\n            }\n        });\n    }\n\n    draw() {\n        this.recursively_shade_sdfg(\n            this.renderer.graph,\n            this.renderer.ctx,\n            this.renderer.canvas_manager.points_per_pixel(),\n            this.renderer.visible_rect\n        );\n    }\n\n}\n","import { MapExit, NestedSDFG, SDFGNode, State } from '../renderer/renderer_elements';\nimport { GenericSdfgOverlay } from './generic_sdfg_overlay';\nimport { mean, median } from 'mathjs';\nimport { getTempColor } from '../renderer/renderer_elements';\n\n\nexport class StaticFlopsOverlay extends GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        super(\n            overlay_manager,\n            renderer\n        );\n\n        this.flops_map = {};\n\n        if (this.vscode) {\n            vscode.postMessage({\n                type: 'dace.get_flops',\n            });\n        }\n    }\n\n    get_element_uuid(element) {\n        const undefined_val = -1;\n        if (element instanceof State) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.id + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof NestedSDFG) {\n            const sdfg_id = element.data.node.attributes.sdfg.sdfg_list_id;\n            return (\n                sdfg_id + '/' +\n                undefined_val + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof MapExit) {\n            // For MapExit nodes, we want to get the uuid of the corresponding\n            // entry node instead, because the FLOPS count is held there.\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.data.node.scope_entry + '/' +\n                undefined_val\n            );\n        } else if (element instanceof SDFGNode) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.id + '/' +\n                undefined_val\n            );\n        }\n        return (\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val\n        );\n    }\n\n    clear_cached_flops_values() {\n        this.renderer.for_all_elements(0, 0, 0, 0, (type, e, obj, isected) => {\n            if (obj.data) {\n                if (obj.data.flops !== undefined)\n                    obj.data.flops = undefined;\n                if (obj.data.flops_string !== undefined)\n                    obj.data.flops_string = undefined;\n            }\n        });\n    }\n\n    calculate_flops_node(node, symbol_map, flops_values) {\n        const flops_string = this.flops_map[this.get_element_uuid(node)];\n        let flops = undefined;\n        if (flops_string !== undefined)\n            flops = this.symbol_resolver.parse_symbol_expression(\n                flops_string,\n                symbol_map\n            );\n\n        node.data.flops_string = flops_string;\n        node.data.flops = flops;\n\n        if (flops !== undefined && flops > 0)\n            flops_values.push(flops);\n\n        return flops;\n    }\n\n    calculate_flops_graph(g, symbol_map, flops_values) {\n        const that = this;\n        g.nodes().forEach(v => {\n            const state = g.node(v);\n            that.calculate_flops_node(state, symbol_map, flops_values);\n            const state_graph = state.data.graph;\n            if (state_graph) {\n                state_graph.nodes().forEach(v => {\n                    const node = state_graph.node(v);\n                    if (node instanceof NestedSDFG) {\n                        const nested_symbols_map = {};\n                        const mapping = node.data.node.attributes.symbol_mapping;\n                        // Translate the symbol mappings for the nested SDFG\n                        // based on the mapping described on the node.\n                        Object.keys(mapping).forEach((symbol) => {\n                            nested_symbols_map[symbol] =\n                                that.symbol_resolver.parse_symbol_expression(\n                                    mapping[symbol],\n                                    symbol_map\n                                );\n                        });\n                        // Merge in the parent mappings.\n                        Object.keys(symbol_map).forEach((symbol) => {\n                            if (!(symbol in nested_symbols_map))\n                                nested_symbols_map[symbol] = symbol_map[symbol];\n                        });\n\n                        that.calculate_flops_node(\n                            node,\n                            nested_symbols_map,\n                            flops_values\n                        );\n                        that.calculate_flops_graph(\n                            node.data.graph,\n                            nested_symbols_map,\n                            flops_values\n                        );\n                    } else {\n                        that.calculate_flops_node(\n                            node,\n                            symbol_map,\n                            flops_values\n                        );\n                    }\n                });\n            }\n        });\n    }\n\n    recalculate_flops_values(graph) {\n        this.badness_scale_center = 5;\n\n        const flops_values = [0];\n        this.calculate_flops_graph(\n            graph,\n            this.symbol_resolver.symbol_value_map,\n            flops_values\n        );\n\n        switch (this.overlay_manager.badness_scale_method) {\n            case 'mean':\n                this.badness_scale_center = mean(flops_values);\n                break;\n            case 'median':\n            default:\n                this.badness_scale_center = median(flops_values);\n                break;\n        }\n    }\n\n    update_flops_map(flops_map) {\n        this.flops_map = flops_map;\n        this.refresh();\n    }\n\n    refresh() {\n        this.clear_cached_flops_values();\n        this.recalculate_flops_values(this.renderer.graph);\n\n        this.renderer.draw_async();\n    }\n\n    shade_node(node, ctx) {\n        const flops = node.data.flops;\n        const flops_string = node.data.flops_string;\n\n        if (flops_string !== undefined && this.renderer.mousepos &&\n            node.intersect(this.renderer.mousepos.x, this.renderer.mousepos.y)) {\n            // Show the computed FLOPS value if applicable.\n            if (isNaN(flops_string) && flops !== undefined)\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        'FLOPS: ' + flops_string + ' (' + flops + ')'\n                    );\n                };\n\n            else\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        'FLOPS: ' + flops_string\n                    );\n                };\n        }\n\n        if (flops === undefined) {\n            // If the FLOPS can't be calculated, but there's an entry for this\n            // node's FLOPS, that means that there's an unresolved symbol. Shade\n            // the node grey to indicate that.\n            if (flops_string !== undefined) {\n                node.shade(this.renderer, ctx, 'gray');\n                return;\n            } else {\n                return;\n            }\n        }\n\n        // Only draw positive FLOPS.\n        if (flops <= 0)\n            return;\n\n        // Calculate the 'badness' color.\n        let badness = (1 / (this.badness_scale_center * 2)) * flops;\n        if (badness < 0)\n            badness = 0;\n        if (badness > 1)\n            badness = 1;\n        const color = getTempColor(badness);\n\n        node.shade(this.renderer, ctx, color);\n    }\n\n    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {\n        // First go over visible states, skipping invisible ones. We only draw\n        // something if the state is collapsed or we're zoomed out far enough.\n        // In that case, we draw the FLOPS calculated for the entire state.\n        // If it's expanded or zoomed in close enough, we traverse inside.\n        graph.nodes().forEach(v => {\n            const state = graph.node(v);\n\n            // If the node's invisible, we skip it.\n            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,\n                visible_rect.w, visible_rect.h))\n                return;\n\n            if ((ctx.lod && (ppp >= STATE_LOD ||\n                state.width / ppp <= STATE_LOD)) ||\n                state.data.state.attributes.is_collapsed) {\n                this.shade_node(state, ctx);\n            } else {\n                const state_graph = state.data.graph;\n                if (state_graph) {\n                    state_graph.nodes().forEach(v => {\n                        const node = state_graph.node(v);\n\n                        // Skip the node if it's not visible.\n                        if (ctx.lod && !node.intersect(visible_rect.x,\n                            visible_rect.y, visible_rect.w, visible_rect.h))\n                            return;\n\n                        if (node.data.node.attributes.is_collapsed ||\n                            (ctx.lod && ppp >= NODE_LOD)) {\n                            this.shade_node(node, ctx);\n                        } else {\n                            if (node instanceof NestedSDFG) {\n                                this.recursively_shade_sdfg(\n                                    node.data.graph, ctx, ppp, visible_rect\n                                );\n                            } else {\n                                this.shade_node(node, ctx);\n                            }\n                        }\n                    });\n                }\n            }\n        });\n    }\n\n    draw() {\n        this.recursively_shade_sdfg(\n            this.renderer.graph,\n            this.renderer.ctx,\n            this.renderer.canvas_manager.points_per_pixel(),\n            this.renderer.visible_rect\n        );\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        if (type === 'click' && !ends_drag) {\n            if (foreground_elem !== undefined && foreground_elem !== null &&\n                !(foreground_elem instanceof Edge)) {\n                if (foreground_elem.data.flops === undefined) {\n                    const flops_string = this.flops_map[this.get_element_uuid(foreground_elem)];\n                    if (flops_string) {\n                        const that = this;\n                        this.symbol_resolver.parse_symbol_expression(\n                            flops_string,\n                            that.symbol_resolver.symbol_value_map,\n                            true,\n                            () => {\n                                that.clear_cached_flops_values();\n                                that.recalculate_flops_values(\n                                    that.renderer.graph\n                                );\n                            }\n                        );\n                    }\n                }\n            }\n        }\n        return false;\n    }\n\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport function calculateBoundingBox(g) {\n    // iterate over all objects, calculate the size of the bounding box\n    const bb = {};\n    bb.width = 0;\n    bb.height = 0;\n\n    g.nodes().forEach((v) => {\n        const x = g.node(v).x + g.node(v).width / 2.0;\n        const y = g.node(v).y + g.node(v).height / 2.0;\n        if (x > bb.width) bb.width = x;\n        if (y > bb.height) bb.height = y;\n    });\n\n    return bb;\n}\n\nexport function boundingBox(elements) {\n    const bb = { x1: null, y1: null, x2: null, y2: null };\n\n    elements.forEach((v) => {\n        const topleft = v.topleft();\n        if (bb.x1 === null || topleft.x < bb.x1) bb.x1 = topleft.x;\n        if (bb.y1 === null || topleft.y < bb.y1) bb.y1 = topleft.y;\n\n        const x2 = v.x + v.width / 2.0;\n        const y2 = v.y + v.height / 2.0;\n\n        if (bb.x2 === null || x2 > bb.x2) bb.x2 = x2;\n        if (bb.y2 === null || y2 > bb.y2) bb.y2 = y2;\n    });\n\n    return { x: bb.x1, y: bb.y1, width: bb.x2 - bb.x1, height: bb.y2 - bb.y1 };\n}\n\nexport function calculateEdgeBoundingBox(edge) {\n    // iterate over all points, calculate the size of the bounding box\n    let bb = {};\n    bb.x1 = edge.points[0].x;\n    bb.y1 = edge.points[0].y;\n    bb.x2 = edge.points[0].x;\n    bb.y2 = edge.points[0].y;\n\n    edge.points.forEach((p) => {\n        bb.x1 = p.x < bb.x1 ? p.x : bb.x1;\n        bb.y1 = p.y < bb.y1 ? p.y : bb.y1;\n        bb.x2 = p.x > bb.x2 ? p.x : bb.x2;\n        bb.y2 = p.y > bb.y2 ? p.y : bb.y2;\n    });\n\n    bb = {\n        'x': bb.x1, 'y': bb.y1, 'width': (bb.x2 - bb.x1),\n        'height': (bb.y2 - bb.y1)\n    };\n    if (bb.width <= 5) {\n        bb.width = 10;\n        bb.x -= 5;\n    }\n    if (bb.height <= 5) {\n        bb.height = 10;\n        bb.y -= 5;\n    }\n    return bb;\n}\n\nexport function updateEdgeBoundingBox(edge) {\n    const bb = calculateEdgeBoundingBox(edge);\n    edge.x = bb.x + bb.width / 2;\n    edge.y = bb.y + bb.height / 2;\n    edge.width = bb.width;\n    edge.height = bb.height;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { intersectRect } from 'dagre/lib/util';\nimport { Edge } from \"./renderer_elements\";\nimport { lerpMatrix } from '../utils/lerp_matrix';\nimport { updateEdgeBoundingBox } from '../utils/bounding_box';\nimport {\n    get_positioning_info,\n    initialize_positioning_info,\n} from \"../utils/sdfg/sdfg_utils\";\n\nconst animation_duration = 1000;\nconst animation_function = t => 1 - Math.pow(1 - t, 3);  // cubic ease out\n\nlet _canvas_manager_counter = 0;\n\nexport class CanvasManager {\n    // Manages translation and scaling of canvas rendering\n\n    static counter() {\n        return _canvas_manager_counter++;\n    }\n\n    constructor(ctx, renderer, canvas) {\n        this.ctx = ctx;\n        this.ctx.lod = true;\n        this.canvas = canvas;\n        this.anim_id = null;\n        this.prev_time = null;\n        this.drawables = [];\n        this.renderer = renderer;\n        this.indices = [];\n\n        this.animation_start = null;\n        this.animation_end = null;\n        this.animation_target = null;\n        /**\n         * Takes a number [0, 1] and returns a transformation matrix\n         */\n        this.animation = null;\n\n        this.request_scale = false;\n        this.scalef = 1.0;\n\n        this._destroying = false;\n\n        this.scale_origin = { x: 0, y: 0 };\n\n        this.contention = 0;\n\n        this._svg = document.createElementNS(\"http://www.w3.org/2000/svg\", 'svg');\n\n        this.user_transform = this._svg.createSVGMatrix();\n\n        this.addCtxTransformTracking();\n    }\n\n    stopAnimation() {\n        this.animation_start = null;\n        this.animation_end = null;\n        this.animation = null;\n        this.animation_target = null;\n    }\n\n    alreadyAnimatingTo(new_transform) {\n        if (this.animation_target) {\n            let result = true;\n            result &= this.animation_target.a == new_transform.a;\n            result &= this.animation_target.b == new_transform.b;\n            result &= this.animation_target.c == new_transform.c;\n            result &= this.animation_target.d == new_transform.d;\n            result &= this.animation_target.e == new_transform.e;\n            result &= this.animation_target.f == new_transform.f;\n            return result;\n        } else\n            return false;\n    }\n\n    animateTo(new_transform) {\n        // If was already animating to the same target, jump to it directly\n        if (this.alreadyAnimatingTo(new_transform)) {\n            this.stopAnimation();\n            this.user_transform = new_transform;\n            return;\n        }\n\n        this.stopAnimation();\n        this.animation = lerpMatrix(this.user_transform, new_transform);\n        this.animation_target = new_transform;\n    }\n\n    svgPoint(x, y) {\n        const pt = this._svg.createSVGPoint();\n        pt.x = x; pt.y = y;\n        return pt;\n    }\n\n    applyUserTransform() {\n        const ut = this.user_transform;\n        this.ctx.setTransform(ut.a, ut.b, ut.c, ut.d, ut.e, ut.f);\n    }\n\n    get translation() {\n        return { x: this.user_transform.e, y: this.user_transform.f };\n    }\n\n    addCtxTransformTracking() {\n        /* This function is a hack to provide the non-standardized functionality\n        of getting the current transform from a RenderingContext.\n        When (if) this is standardized, the standard should be used instead.\n        This is made for \"easy\" transforms and does not support saving/restoring\n        */\n\n        const svg = document.createElementNS(\"http://www.w3.org/2000/svg\", 'svg');\n        this.ctx._custom_transform_matrix = svg.createSVGMatrix();\n        // Save/Restore is not supported.\n\n        const checker = () => {\n            console.assert(!isNaN(this.ctx._custom_transform_matrix.f));\n        };\n        const _ctx = this.ctx;\n        const scale_func = _ctx.scale;\n        _ctx.scale = function (sx, sy) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.scaleNonUniform(sx, sy);\n            checker();\n            return scale_func.call(_ctx, sx, sy);\n        };\n        const translate_func = _ctx.translate;\n        _ctx.translate = function (sx, sy) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.translate(sx, sy);\n            checker();\n            return translate_func.call(_ctx, sx, sy);\n        };\n        const rotate_func = _ctx.rotate;\n        _ctx.rotate = function (r) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.rotate(r * 180.0 / Math.PI);\n            checker();\n            return rotate_func.call(_ctx, r);\n        };\n        const transform_func = _ctx.scale;\n        _ctx.transform = function (a, b, c, d, e, f) {\n            const m2 = svg.createSVGMatrix();\n            m2.a = a; m2.b = b; m2.c = c; m2.d = d; m2.e = e; m2.f = f;\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.multiply(m2);\n            checker();\n            return transform_func.call(_ctx, a, b, c, d, e, f);\n        };\n\n        const setTransform_func = _ctx.setTransform;\n        _ctx.setTransform = function (a, b, c, d, e, f) {\n            _ctx._custom_transform_matrix.a = a;\n            _ctx._custom_transform_matrix.b = b;\n            _ctx._custom_transform_matrix.c = c;\n            _ctx._custom_transform_matrix.d = d;\n            _ctx._custom_transform_matrix.e = e;\n            _ctx._custom_transform_matrix.f = f;\n            checker();\n            return setTransform_func.call(_ctx, a, b, c, d, e, f);\n        };\n\n        _ctx.custom_inverseTransformMultiply = function (x, y) {\n            const pt = svg.createSVGPoint();\n            pt.x = x; pt.y = y;\n            checker();\n            return pt.matrixTransform(_ctx._custom_transform_matrix.inverse());\n        }\n    }\n\n    destroy() {\n        this._destroying = true;\n        this.clearDrawables();\n    }\n\n    addDrawable(obj) {\n        this.drawables.push(obj);\n        this.indices.push({ \"c\": CanvasManager.counter(), \"d\": obj });\n    }\n\n    removeDrawable(drawable) {\n        this.drawables = this.drawables.filter(x => x != drawable);\n    }\n\n    clearDrawables() {\n        for (const x of this.drawables) {\n            x.destroy();\n        }\n        this.drawables = [];\n        this.indices = [];\n    }\n\n    isBlank() {\n        const ctx = this.canvas.getContext('2d');\n        const topleft = ctx.getImageData(0, 0, 1, 1).data;\n        if (topleft[0] != 0 || topleft[1] != 0 || topleft[2] != 0 || topleft[3] != 255)\n            return false;\n\n        const pixelBuffer = new Uint32Array(\n            ctx.getImageData(0, 0, this.canvas.width, this.canvas.height).data.buffer\n        );\n\n        return !pixelBuffer.some(color => color !== 0xff000000);\n    }\n\n    scale(diff, x = 0, y = 0) {\n        this.stopAnimation();\n        if (this.request_scale || this.contention > 0) {\n            return;\n        }\n        this.contention++;\n        this.request_scale = true;\n        if (this.isBlank()) {\n            this.renderer.bgcolor = 'black';\n            this.renderer.zoom_to_view(null, false);\n            diff = 0.01;\n        }\n\n        this.scale_origin.x = x;\n        this.scale_origin.y = y;\n\n        const sv = diff;\n        const pt = this.svgPoint(this.scale_origin.x, this.scale_origin.y).matrixTransform(this.user_transform.inverse());\n        this.user_transform = this.user_transform.translate(pt.x, pt.y);\n        this.user_transform = this.user_transform.scale(sv, sv, 1, 0, 0, 0);\n        this.scalef *= sv;\n        this.user_transform = this.user_transform.translate(-pt.x, -pt.y);\n\n        this.contention--;\n    }\n\n    // Sets the view to the square around the input rectangle\n    set_view(rect, animate = false) {\n        const canvas_w = this.canvas.width;\n        const canvas_h = this.canvas.height;\n        if (canvas_w == 0 || canvas_h == 0)\n            return;\n\n        let scale = 1, tx = 0, ty = 0;\n        if (rect.width > rect.height) {\n            scale = canvas_w / rect.width;\n            tx = -rect.x;\n            ty = -rect.y - (rect.height / 2) + (canvas_h / scale / 2);\n\n            // Now other dimension does not fit, scale it as well\n            if (rect.height * scale > canvas_h) {\n                scale = canvas_h / rect.height;\n                tx = -rect.x - (rect.width / 2) + (canvas_w / scale / 2);\n                ty = -rect.y;\n            }\n        } else {\n            scale = canvas_h / rect.height;\n            tx = -rect.x - (rect.width / 2) + (canvas_w / scale / 2);\n            ty = -rect.y;\n\n            // Now other dimension does not fit, scale it as well\n            if (rect.width * scale > canvas_w) {\n                scale = canvas_w / rect.width;\n                tx = -rect.x;\n                ty = -rect.y - (rect.height / 2) + (canvas_h / scale / 2);\n            }\n        }\n\n        // Uniform scaling\n        const new_transform = this._svg.createSVGMatrix().scale(scale, scale, 1, 0, 0, 0).translate(tx, ty);\n\n        if (animate && this.prev_time !== null) {\n            this.animateTo(new_transform);\n        } else {\n            this.stopAnimation();\n            this.user_transform = new_transform;\n        }\n\n        this.scale_origin = { x: 0, y: 0 };\n        this.scalef = 1.0;\n    }\n\n    translate(x, y) {\n        this.stopAnimation();\n        this.user_transform = this.user_transform.translate(x / this.user_transform.a, y / this.user_transform.d);\n    }\n\n    /**\n     * Move/translate an element in the graph by a change in x and y.\n     * @param {*} el                Element to move\n     * @param {*} old_mousepos      Old mouse position in canvas coordinates\n     * @param {*} new_mousepos      New mouse position in canvas coordinates\n     * @param {*} entire_graph      Reference to the entire graph\n     * @param {*} sdfg_list         List of SDFGs and nested SDFGs\n     * @param {*} state_parent_list List of parent elements to SDFG states\n     * // TODO: update doc comment with parameters\n     */\n    translate_element(\n        el, old_mousepos, new_mousepos, entire_graph, sdfg_list,\n        state_parent_list, drag_start, update_position_info = true,\n        move_entire_edge = false, edge_dpoints = undefined\n    ) {\n        this.stopAnimation();\n\n        // Edges connected to the moving element\n        let out_edges = [];\n        let in_edges = [];\n\n        // Find the parent graph in the list of available SDFGs\n        let parent_graph = sdfg_list[el.sdfg.sdfg_list_id];\n        let parent_element = null;\n\n        if (entire_graph !== parent_graph && (el.data.state || el.data.type == 'InterstateEdge')) {\n            // If the parent graph and the entire SDFG shown are not the same,\n            // we're currently in a nested SDFG. If we're also moving a state,\n            // this means that its parent element is found in the list of\n            // parents to states (state_parent_list)\n            parent_element = state_parent_list[el.sdfg.sdfg_list_id];\n        } else if (el.parent_id !== null && parent_graph) {\n            // If the parent_id isn't null and there is a parent graph, we can\n            // look up the parent node via the element's parent_id\n            parent_element = parent_graph.node(el.parent_id);\n            // If our parent element is a state, we want the state's graph\n            if (parent_element.data.state)\n                parent_graph = parent_element.data.graph;\n        }\n\n        if (parent_graph && !(el instanceof Edge)) {\n            // Find all the edges connected to the moving node\n            parent_graph.outEdges(el.id).forEach(edge_id => {\n                out_edges.push(parent_graph.edge(edge_id));\n            });\n            parent_graph.inEdges(el.id).forEach(edge_id => {\n                in_edges.push(parent_graph.edge(edge_id));\n            });\n        }\n\n        // Compute theoretical initial displacement/movement\n        let dx = new_mousepos.x - old_mousepos.x;\n        let dy = new_mousepos.y - old_mousepos.y;\n\n        // If edge, find closest point to drag start position\n        let pt = -1;\n        if (el instanceof Edge) {\n            if (move_entire_edge) {\n                pt = -2;\n            } else if (edge_dpoints && edge_dpoints.length > 0) {\n                pt = -3;\n            } else if (drag_start) {\n                // Find closest point to old mouse position\n                if (drag_start.edge_point === undefined) {\n                    let dist = null;\n                    el.points.forEach((p, i) => {\n                        // Only allow dragging if the memlet has more than two\n                        // points\n                        if (i == 0 || i == el.points.length - 1)\n                            return;\n                        let ddx = p.x - drag_start.cx;\n                        let ddy = p.y - drag_start.cy;\n                        let curdist = ddx*ddx + ddy*ddy;\n                        if (dist === null || curdist < dist) {\n                            dist = curdist;\n                            pt = i;\n                        }\n                    });\n                    drag_start.edge_point = pt;\n                } else {\n                    pt = drag_start.edge_point;\n                }\n            }\n        }\n\n        if (parent_element) {\n            // Calculate the box to bind the element to. This is given by\n            // the parent element, i.e. the element where out to-be-moved\n            // element is contained within\n            const parent_left_border =\n                (parent_element.x - (parent_element.width / 2));\n            const parent_right_border =\n                parent_left_border + parent_element.width;\n            const parent_top_border =\n                (parent_element.y - (parent_element.height / 2));\n            const parent_bottom_border =\n                parent_top_border + parent_element.height;\n\n            let el_h_margin = el.height / 2;\n            let el_w_margin = el.width / 2;\n            if (el instanceof Edge) {\n                el_h_margin = el_w_margin = 0;\n            }\n            const min_x = parent_left_border + el_w_margin;\n            const min_y = parent_top_border + el_h_margin;\n            const max_x = parent_right_border - el_w_margin;\n            const max_y = parent_bottom_border - el_h_margin;\n\n            // Make sure we don't move our element outside its parent's\n            // bounding box. If either the element or the mouse pointer are\n            // outside the parent, we clamp movement in that direction\n            if (el instanceof Edge) {\n                if (pt > 0) {\n                    let target_x = el.points[pt].x + dx;\n                    let target_y = el.points[pt].y + dy;\n                    if (target_x <= min_x ||\n                        new_mousepos.x <= parent_left_border) {\n                        dx = min_x - el.points[pt].x;\n                    } else if (target_x >= max_x ||\n                        new_mousepos.x >= parent_right_border) {\n                        dx = max_x - el.points[pt].x;\n                    }\n                    if (target_y <= min_y ||\n                        new_mousepos.y <= parent_top_border) {\n                        dy = min_y - el.points[pt].y;\n                    } else if (target_y >= max_y ||\n                        new_mousepos.y >= parent_bottom_border) {\n                        dy = max_y - el.points[pt].y;\n                    }\n                }\n            } else {\n                let target_x = el.x + dx;\n                let target_y = el.y + dy;\n                if (target_x <= min_x ||\n                    new_mousepos.x <= parent_left_border) {\n                    dx = min_x - el.x;\n                } else if (target_x >= max_x ||\n                    new_mousepos.x >= parent_right_border) {\n                    dx = max_x - el.x;\n                }\n                if (target_y <= min_y ||\n                    new_mousepos.y <= parent_top_border) {\n                    dy = min_y - el.y;\n                } else if (target_y >= max_y ||\n                    new_mousepos.y >= parent_bottom_border) {\n                    dy = max_y - el.y;\n                }\n            }\n        }\n\n        if (el instanceof Edge) {\n            let position;\n            if (update_position_info) {\n                position = get_positioning_info(el);\n\n                if (!position)\n                    position = initialize_positioning_info(el);\n            }\n            if (pt > 0) {\n                // Move point\n                el.points[pt].x += dx;\n                el.points[pt].y += dy;\n\n                // Move edge bounding box\n                updateEdgeBoundingBox(el);\n\n                if (update_position_info) {\n                    if (!position.points) {\n                        position.points = Array(el.points.length);\n                        for (let i = 0; i < el.points.length; i++) {\n                            position.points[i] = {dx: 0, dy: 0};\n                        }\n                    }\n\n                    position.points[pt].dx += dx;\n                    position.points[pt].dy += dy;\n                }\n            } else if (pt == -2) {\n                // Don't update first and last point (the connectors)\n                for (let i = 1; i < el.points.length - 1; i++) {\n                    el.points[i].x += dx;\n                    el.points[i].y += dy;\n                }\n\n                if (update_position_info) {\n                    for (let i = 1; i < el.points.length - 1; i++) {\n                        position.points[i].dx += dx;\n                        position.points[i].dy += dy;\n                    }\n                }\n            } else if (pt == -3) {\n                for (let i = 1; i < el.points.length - 1; i++) {\n                    el.points[i].x += edge_dpoints[i].dx;\n                    el.points[i].y += edge_dpoints[i].dy;\n                }\n            }\n            // The rest of the method doesn't apply to Edges\n            return;\n        }\n\n        // Move a node together with its connectors if it has any\n        function move_node_and_connectors(node) {\n            node.x += dx;\n            node.y += dy;\n            if (node.data.node && node.data.node.type === 'NestedSDFG')\n                translate_recursive(node.data.graph);\n            if (node.in_connectors)\n                node.in_connectors.forEach(c => {\n                    c.x += dx;\n                    c.y += dy;\n                });\n            if (node.out_connectors)\n                node.out_connectors.forEach(c => {\n                    c.x += dx;\n                    c.y += dy;\n                });\n        }\n\n        // Allow recursive translation of nested SDFGs\n        function translate_recursive(ng) {\n            ng.nodes().forEach(state_id => {\n                const state = ng.node(state_id);\n                state.x += dx;\n                state.y += dy;\n                const g = state.data.graph;\n                if (g) {\n                    g.nodes().forEach(node_id => {\n                        const node = g.node(node_id);\n                        move_node_and_connectors(node);\n                    });\n\n                    g.edges().forEach(edge_id => {\n                        const edge = g.edge(edge_id);\n                        edge.x += dx;\n                        edge.y += dy;\n                        edge.points.forEach(point => {\n                            point.x += dx;\n                            point.y += dy;\n                        });\n                        updateEdgeBoundingBox(edge);\n                    });\n                }\n            });\n            ng.edges().forEach(edge_id => {\n                const edge = ng.edge(edge_id);\n                edge.x += dx;\n                edge.y += dy;\n                edge.points.forEach(point => {\n                    point.x += dx;\n                    point.y += dy;\n                });\n                updateEdgeBoundingBox(edge);\n            });\n        }\n\n        // Move the node\n        move_node_and_connectors(el);\n\n        // Store movement information in element (for relayouting)\n        if (update_position_info) {\n            let position = get_positioning_info(el);\n            if (!position)\n                position = initialize_positioning_info(el);\n\n            position.dx += dx;\n            position.dy += dy;\n\n            // Store movement information if EntryNode for other nodes of the same scope\n            if (el instanceof EntryNode && el.data.node.attributes.is_collapsed) {\n                if (!position.scope_dx) {\n                    position.scope_dx = 0;\n                    position.scope_dy = 0;\n                }\n\n                position.scope_dx += dx;\n                position.scope_dy += dy;\n            }\n        }\n        \n        if (el.data.state && !el.data.state.attributes.is_collapsed) {\n            // We're moving a state, move all its contained elements\n            const graph = el.data.graph;\n            graph.nodes().forEach(node_id => {\n                const node = graph.node(node_id);\n                move_node_and_connectors(node);\n            });\n\n            // Drag all the edges along\n            graph.edges().forEach(edge_id => {\n                const edge = graph.edge(edge_id);\n                edge.x += dx;\n                edge.y += dy;\n                edge.points.forEach(point => {\n                    point.x += dx;\n                    point.y += dy;\n                });\n                updateEdgeBoundingBox(edge);\n            });\n        }\n\n        // Move the connected edges along with the element\n        out_edges.forEach(edge => {\n            const n = edge.points.length - 1;\n            let moved = false;\n            if (edge.src_connector !== null) {\n                for (let i = 0; i < el.out_connectors.length; i++) {\n                    if (el.out_connectors[i].data.name === edge.src_connector) {\n                        edge.points[0] = intersectRect(el.out_connectors[i], edge.points[1]);\n                        moved = true;\n                        break;\n                    }\n                }\n            }\n            if (!moved) {\n                edge.points[0].x += dx;\n                edge.points[0].y += dy;\n            }\n            // Also update destination point of edge\n            if (edge.dst_connector !== null) {\n                let e = parent_element?.data?.state?.edges[edge.id];\n                let dst_el = parent_graph.node(e?.dst);\n                if (dst_el) {\n                    for (let i = 0; i < dst_el.in_connectors.length; i++) {\n                        let dst_name = dst_el.in_connectors[i].data.name;\n                        if (dst_name === edge.dst_connector) {\n                            edge.points[n] = intersectRect(\n                                dst_el.in_connectors[i], edge.points[n - 1]\n                            );\n                            break;\n                        }\n                    }\n                }\n            }\n            updateEdgeBoundingBox(edge);\n        });\n        in_edges.forEach(edge => {\n            const n = edge.points.length - 1;\n            let moved = false;\n            if (edge.dst_connector !== null) {\n                for (let i = 0; i < el.in_connectors.length; i++) {\n                    if (el.in_connectors[i].data.name === edge.dst_connector) {\n                        edge.points[n] = intersectRect(\n                            el.in_connectors[i], edge.points[n-1]\n                        );\n                        moved = true;\n                        break;\n                    }\n                }\n            }\n            if (!moved) {\n                edge.points[n].x += dx;\n                edge.points[n].y += dy;\n            }\n            // Also update source point of edge\n            if (edge.src_connector !== null) {\n                let e = parent_element?.data?.state?.edges[edge.id];\n                let src_el = parent_graph.node(e?.src);\n                if (src_el) {\n                    for (let i = 0; i < src_el.out_connectors.length; i++) {\n                        let out_name = src_el.out_connectors[i].data.name;\n                        if (out_name === edge.src_connector) {\n                            edge.points[0] = intersectRect(\n                                src_el.out_connectors[i], edge.points[1]\n                            );\n                            break;\n                        }\n                    }\n                }\n            }\n            updateEdgeBoundingBox(edge);\n        });\n    }\n\n    mapPixelToCoordsX(xpos) {\n        return this.svgPoint(xpos, 0).matrixTransform(this.user_transform.inverse()).x;\n    }\n\n    mapPixelToCoordsY(ypos) {\n        return this.svgPoint(0, ypos).matrixTransform(this.user_transform.inverse()).y;\n    }\n\n    noJitter(x) {\n        x = parseFloat(x.toFixed(3));\n        x = Math.round(x * 100) / 100;\n        return x;\n    }\n\n    points_per_pixel() {\n        // Since we are using uniform scaling, (bottom-top)/height and\n        // (right-left)/width should be equivalent\n        const left = this.mapPixelToCoordsX(0);\n        const right = this.mapPixelToCoordsX(this.canvas.width);\n        return (right - left) / this.canvas.width;\n    }\n\n    animation_step(now) {\n        if (this.animation === null) {\n            return;\n        }\n\n        if (this.animation_start === null) {\n            this.animation_start = now;\n            this.animation_end = now + animation_duration;\n        }\n\n        if (now >= this.animation_end) {\n            this.user_transform = this.animation(1);\n            this.stopAnimation();\n            return;\n        }\n\n        const start = this.animation_start;\n        const end = this.animation_end;\n        this.user_transform = this.animation(animation_function((now - start) / (end - start)));\n    }\n\n    draw_now(now) {\n        if (this._destroying)\n            return;\n\n        let dt = now - this.prev_time;\n        if (!this.prev_time)\n            dt = null;\n        this.prev_time = now;\n\n        if (this.contention > 0) return;\n        this.contention += 1;\n        const ctx = this.ctx;\n\n        // Clear with default transform\n        ctx.save();\n        ctx.setTransform(1, 0, 0, 1, 0, 0);\n        ctx.clearRect(0, 0, ctx.canvas.width, ctx.canvas.height);\n        ctx.fillStyle = this.renderer.bgcolor;\n        ctx.fillRect(0, 0, ctx.canvas.width, ctx.canvas.height);\n        ctx.restore();\n\n        this.animation_step(now);\n\n        this.applyUserTransform();\n        if (this.request_scale)\n            this.request_scale = this.contention !== 1;\n\n        this.renderer.draw(dt);\n        this.contention -= 1;\n\n        if (this.animation_end !== null && now < this.animation_end)\n            this.draw_async();\n    }\n\n    draw_async() {\n        this.anim_id = window.requestAnimationFrame((now) => this.draw_now(now));\n    }\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\n/**\n * Returns a function taking a number from 0 to 1 which linearly interpolates between two matrices.\n * Uses the matrix interpolation algorithm for CSS animations\n * https://www.w3.org/TR/css-transforms-1/#decomposing-a-2d-matrix\n */\nexport function lerpMatrix(m1, m2) {\n    function decompose(m) {\n        const scale = [Math.sqrt(m.a * m.a + m.b * m.b), Math.sqrt(m.c * m.c + m.d * m.d)];\n\n        const det = m.a * m.d - m.b * m.c;\n        if (det < 0) {\n            if (m.a < m.d)\n                scale[0] = -scale[0];\n            else\n                scale[1] = -scale[1];\n        }\n\n        const row0x = m.a / (scale[0] || 1);\n        const row0y = m.b / (scale[0] || 1);\n        const row1x = m.c / (scale[1] || 1);\n        const row1y = m.d / (scale[1] || 1);\n\n        const skew11 = row0x * row0x - row0y * row1x;\n        const skew12 = row0x * row0y - row0y * row1y;\n        const skew21 = row0x * row1x - row0y * row0x;\n        const skew22 = row0x * row1y - row0y * row0y;\n\n        const angle = Math.atan2(m.b, m.a) * 180 / Math.PI;\n\n        return {\n            translate: [m.e, m.f],\n            scale,\n            skew11,\n            skew12,\n            skew21,\n            skew22,\n            angle,\n        };\n    }\n\n    function lerpDecomposed(d1, d2, t) {\n        function lerp(a, b) {\n            return (b - a) * t + a;\n        }\n\n        let d1Angle = d1.angle || 360;\n        let d2Angle = d2.angle || 360;\n        let d1Scale = d1.scale;\n\n        if ((d1.scale[0] < 0 && d2.scale[1] < 0) || (d1.scale[1] < 0 && d2.scale[0] < 0)) {\n            d1Scale = [-d1Scale[0], -d1Scale[1]];\n            d1Angle += d1Angle < 0 ? 180 : -180;\n        }\n\n        if (Math.abs(d1Angle - d2Angle) > 180) {\n            if (d1Angle > d2Angle) {\n                d1Angle -= 360;\n            } else {\n                d2Angle -= 360;\n            }\n        }\n\n\n        return {\n            translate: [\n                lerp(d1.translate[0], d2.translate[0]),\n                lerp(d1.translate[1], d2.translate[1]),\n            ],\n            scale: [\n                lerp(d1Scale[0], d2.scale[0]),\n                lerp(d1Scale[1], d2.scale[1]),\n            ],\n            skew11: lerp(d1.skew11, d2.skew11),\n            skew12: lerp(d1.skew12, d2.skew12),\n            skew21: lerp(d1.skew21, d2.skew21),\n            skew22: lerp(d1.skew22, d2.skew22),\n            angle: lerp(d1Angle, d2Angle),\n        };\n    }\n\n    function recompose(d) {\n        const matrix = document.createElementNS(\"http://www.w3.org/2000/svg\", 'svg').createSVGMatrix();\n        matrix.a = d.skew11;\n        matrix.b = d.skew12;\n        matrix.c = d.skew21;\n        matrix.d = d.skew22;\n        matrix.e = d.translate[0] * d.skew11 + d.translate[1] * d.skew21;\n        matrix.f = d.translate[0] * d.skew12 + d.translate[1] * d.skew22;\n        return matrix.rotate(0, 0, d.angle * Math.PI / 180).scale(d.scale[0], d.scale[1]);\n    }\n\n    const d1 = decompose(m1);\n    const d2 = decompose(m2);\n\n    return (t) => recompose(lerpDecomposed(d1, d2, t));\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { createElement } from \"./utils/utils\";\nimport { GenericSdfgOverlay } from './overlays/generic_sdfg_overlay';\nimport { RuntimeMicroSecondsOverlay } from './overlays/runtime_micro_seconds_overlay';\nimport { StaticFlopsOverlay } from './overlays/static_flops_overlay';\nimport { MemoryVolumeOverlay } from './overlays/memory_volume_overlay';\nimport { parse } from 'mathjs';\nimport { htmlSanitize } from \"./utils/sanitization\";\n\nclass SymbolResolver {\n\n    constructor(renderer) {\n        this.renderer = renderer;\n        this.sdfg = this.renderer.sdfg;\n        this.vscode = typeof vscode !== 'undefined' && vscode;\n\n        // Initialize the symbol mapping to the graph's symbol table.\n        this.symbol_value_map = {};\n        Object.keys(this.sdfg.attributes.symbols).forEach((s) => {\n            if (this.sdfg.attributes.constants_prop !== undefined &&\n                Object.keys(this.sdfg.attributes.constants_prop).includes(s) &&\n                this.sdfg.attributes.constants_prop[s][0]['type'] === 'Scalar')\n                this.symbol_value_map[s] = this.sdfg.attributes.constants_prop[\n                    s\n                ][1];\n            else\n                this.symbol_value_map[s] = undefined;\n        });\n        this.symbols_to_define = [];\n\n        this.init_overlay_popup_dialogue();\n    }\n\n    symbol_value_changed(symbol, value) {\n        if (symbol in this.symbol_value_map)\n            this.symbol_value_map[symbol] = value;\n    }\n\n    parse_symbol_expression(\n        expression_string,\n        mapping,\n        prompt_completion = false,\n        callback = undefined\n    ) {\n        let result = undefined;\n        try {\n            const expression_tree = parse(expression_string);\n            if (prompt_completion) {\n                this.recursive_find_undefined_symbol(expression_tree, mapping);\n                this.prompt_define_symbol(mapping, callback);\n            } else {\n                try {\n                    const evaluated =\n                        expression_tree.evaluate(mapping);\n                    if (evaluated !== undefined &&\n                        !isNaN(evaluated) &&\n                        Number.isInteger(+evaluated))\n                        result = +evaluated;\n                    else\n                        result = undefined;\n                } catch (e) {\n                    result = undefined;\n                }\n            }\n            return result;\n        } catch (exception) {\n            console.error(exception);\n        } finally {\n            return result;\n        }\n    }\n\n    prompt_define_symbol(mapping, callback = undefined) {\n        if (this.symbols_to_define.length > 0) {\n            const symbol = this.symbols_to_define.pop();\n            const that = this;\n            this.popup_dialogue._show(\n                symbol,\n                mapping,\n                () => {\n                    if (this.vscode)\n                        vscode.postMessage({\n                            type: 'analysis.define_symbol',\n                            symbol: symbol,\n                            definition: mapping[symbol],\n                        });\n                    if (callback !== undefined)\n                        callback();\n                    that.prompt_define_symbol(mapping, callback);\n                }\n            );\n        }\n    }\n\n    recursive_find_undefined_symbol(expression_tree, mapping) {\n        expression_tree.forEach((node, path, parent) => {\n            switch (node.type) {\n                case 'SymbolNode':\n                    if (node.name in mapping &&\n                        mapping[node.name] === undefined &&\n                        !this.symbols_to_define.includes(node.name)) {\n                        // This is an undefined symbol.\n                        // Ask for it to be defined.\n                        this.symbols_to_define.push(node.name);\n                    }\n                    break;\n                case 'OperatorNode':\n                case 'ParenthesisNode':\n                    this.recursive_find_undefined_symbol(node, mapping);\n                    break;\n                default:\n                    // Ignore\n                    break;\n            }\n        });\n    }\n\n    init_overlay_popup_dialogue() {\n        let dialogue_background = createElement('div', '',\n            ['sdfv_modal_background'], document.body);\n        dialogue_background._show = function () {\n            this.style.display = 'block';\n        };\n        dialogue_background._hide = function () {\n            this.style.display = 'none';\n        };\n\n        let popup_dialogue = createElement('div', 'sdfv_overlay_dialogue',\n            ['sdfv_modal'], dialogue_background);\n        popup_dialogue.addEventListener('click', (ev) => {\n            ev.stopPropagation();\n        });\n        popup_dialogue.style.display = 'none';\n        this.popup_dialogue = popup_dialogue;\n\n        let header_bar = createElement('div', '', ['sdfv_modal_title_bar'],\n            this.popup_dialogue);\n        this.popup_dialogue._title = createElement('span', '',\n            ['sdfv_modal_title'], header_bar);\n        let close_button = createElement('div', '', ['modal_close'],\n            header_bar);\n        close_button.innerHTML = htmlSanitize`<i class=\"material-icons\">close</i>`;\n        close_button.addEventListener('click', () => {\n            popup_dialogue._hide();\n        });\n\n        let content_box = createElement('div', '', ['sdfv_modal_content_box'],\n            this.popup_dialogue);\n        this.popup_dialogue._content = createElement('div', '',\n            ['sdfv_modal_content'], content_box);\n        this.popup_dialogue._input = createElement('input', 'symbol_input',\n            ['sdfv_modal_input_text'], this.popup_dialogue._content);\n        \n        function set_val() {\n            if (popup_dialogue._map && popup_dialogue._symbol) {\n                let val = popup_dialogue._input.value;\n                if (val && !isNaN(val) && Number.isInteger(+val) && val > 0) {\n                    popup_dialogue._map[popup_dialogue._symbol] = val;\n                    popup_dialogue._hide();\n                    if (popup_dialogue._callback)\n                        popup_dialogue._callback();\n                    return;\n                }\n            }\n            popup_dialogue._input.setCustomValidity('Invalid, not an integer');\n        }\n        this.popup_dialogue._input.addEventListener('keypress', (ev) => {\n            if (ev.which === 13)\n                set_val();\n        });\n\n        let footer_bar = createElement('div', '', ['sdfv_modal_footer_bar'],\n            this.popup_dialogue);\n        let confirm_button = createElement('div', '',\n            ['button', 'sdfv_modal_confirm_button'], footer_bar);\n        confirm_button.addEventListener('click', (ev) => { set_val(); });\n        let confirm_button_text = createElement('span', '', [], confirm_button);\n        confirm_button_text.innerText = 'Confirm';\n        createElement('div', '', ['clearfix'], footer_bar);\n\n        this.popup_dialogue._show = function (symbol, map, callback) {\n            this.style.display = 'block';\n            popup_dialogue._title.innerText = 'Define symbol ' + symbol;\n            popup_dialogue._symbol = symbol;\n            popup_dialogue._map = map;\n            popup_dialogue._callback = callback;\n            dialogue_background._show();\n        };\n        this.popup_dialogue._hide = function () {\n            this.style.display = 'none';\n            popup_dialogue._title.innerText = '';\n            popup_dialogue._input.value = '';\n            popup_dialogue._input.setCustomValidity('');\n            dialogue_background._hide();\n        };\n        dialogue_background.addEventListener('click', (ev) => {\n            popup_dialogue._hide();\n        });\n    }\n\n}\n\nexport class OverlayManager {\n\n    constructor(renderer) {\n        this.renderer = renderer;\n\n        this.badness_scale_method = 'median';\n\n        this.overlays = [];\n\n        this.symbol_resolver = new SymbolResolver(this.renderer);\n    }\n\n    register_overlay(type) {\n        switch (type) {\n            case MemoryVolumeOverlay:\n            case StaticFlopsOverlay:\n            case RuntimeMicroSecondsOverlay:\n                this.overlays.push(\n                    new type(this, this.renderer)\n                );\n                break;\n            default:\n                // Object overlay\n                this.overlays.push(type);\n                break;\n        }\n        this.renderer.draw_async();\n    }\n\n    deregister_overlay(type) {\n        this.overlays = this.overlays.filter(overlay => {\n            return !(overlay instanceof type);\n        });\n\n        this.renderer.draw_async();\n    }\n\n    is_overlay_active(type) {\n        return this.overlays.filter(overlay => {\n            return overlay instanceof type;\n        }).length > 0;\n    }\n\n    get_overlay(type) {\n        let overlay = undefined;\n        this.overlays.forEach(ol => {\n            if (ol instanceof type) {\n                overlay = ol;\n                return;\n            }\n        });\n        return overlay;\n    }\n\n    symbol_value_changed(symbol, value) {\n        this.symbol_resolver.symbol_value_changed(symbol, value);\n        this.overlays.forEach(overlay => {\n            overlay.refresh();\n        });\n    }\n\n    update_badness_scale_method(method) {\n        this.badness_scale_method = method;\n        this.overlays.forEach(overlay => {\n            overlay.refresh();\n        });\n    }\n\n    draw() {\n        this.overlays.forEach(overlay => {\n            overlay.draw();\n        });\n    }\n\n    refresh() {\n        this.overlays.forEach(overlay => {\n            overlay.refresh();\n        });\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        this.overlays.forEach(overlay => {\n            overlay.on_mouse_event(type, ev, mousepos, elements,\n                foreground_elem, ends_drag);\n        });\n    }\n\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport dagre from 'dagre';\nimport { intersectRect } from 'dagre/lib/util';\nimport {\n    find_exit_for_entry,\n    get_positioning_info,\n    delete_positioning_info,\n    get_uuid_graph_element,\n    find_graph_element_by_uuid,\n} from '../utils/sdfg/sdfg_utils';\nimport { deepCopy } from '../utils/utils.ts';\nimport { traverse_sdfg_scopes } from '../utils/sdfg/traversal';\nimport { ContextMenu } from '../utils/context_menu';\nimport {\n    Connector,\n    Edge,\n    offset_state,\n    SDFGElements,\n    draw_sdfg,\n    offset_sdfg,\n    NestedSDFG,\n} from './renderer_elements';\nimport { check_and_redirect_edge } from '../utils/sdfg/sdfg_utils';\nimport { memlet_tree_complete } from '../utils/sdfg/traversal';\nimport { CanvasManager } from './canvas_manager';\nimport {\n    boundingBox,\n    calculateBoundingBox,\n    calculateEdgeBoundingBox,\n} from '../utils/bounding_box';\nimport { OverlayManager } from '../overlay_manager';\nimport { fill_info } from '../sdfv';\nimport { MemoryVolumeOverlay } from '../overlays/memory_volume_overlay';\n\nfunction check_valid_add_position(type, foreground_elem, lib, mousepos) {\n    switch (type) {\n        case 'SDFGState':\n            return (foreground_elem instanceof NestedSDFG ||\n                    foreground_elem === null);\n        case 'Edge':\n            return (foreground_elem instanceof SDFGNode ||\n                    foreground_elem instanceof State);\n        case 'LibraryNode':\n            return (foreground_elem instanceof State && lib);\n        default:\n            return foreground_elem instanceof State;\n    }\n}\n\nexport class SDFGRenderer {\n    constructor(sdfg, container, on_mouse_event = null, user_transform = null,\n                debug_draw = false, background = null, mode_buttons = null) {\n        // DIODE/SDFV-related fields\n        this.sdfg = sdfg;\n        this.sdfg_list = {};\n        this.state_parent_list = {}; // List of all state's parent elements\n\n        // Rendering-related fields\n        this.container = container;\n        this.ctx = null;\n        this.canvas = null;\n        this.last_visible_elements = null;\n        this.last_hovered_elements = null;\n        this.last_clicked_elements = null;\n        this.last_dragged_element = null;\n        this.tooltip = null;\n        this.tooltip_container = null;\n\n        // Toolbar-related fields\n        this.menu = null;\n        this.toolbar = null;\n        this.panmode_btn = null;\n        this.movemode_btn = null;\n        this.selectmode_btn = null;\n        this.addmode_btns = null;\n        this.add_type = null;\n        this.add_mode_lib = null;\n        this.addmode_divs = null;\n        this.mode_selected_bg_color = \"#CCCCCC\";\n        this.mouse_follow_svgs = null;\n        this.mouse_follow_element = null;\n\n        // Memlet-Tree related fields\n        this.all_memlet_trees_sdfg = [];\n\n        // View options\n        this.inclusive_ranges = false;\n        this.omit_access_nodes = false;\n\n        // Mouse-related fields\n        this.mouse_mode = 'pan'; // Mouse mode - pan, move, select\n        this.box_select_rect = null;\n        this.mousepos = null; // Last position of the mouse pointer (in canvas coordinates)\n        this.realmousepos = null; // Last position of the mouse pointer (in pixel coordinates)\n        this.dragging = false;\n        this.drag_start = null; // Null if the mouse/touch is not activated\n        this.drag_second_start = null; // Null if two touch points are not activated\n        this.external_mouse_handler = on_mouse_event;\n        this.ctrl_key_selection = false;\n        this.shift_key_movement = false;\n        this.add_uuid = null;\n        this.add_position = null;\n        this.add_edge_start = null;\n\n        // Selection related fields\n        this.selected_elements = [];\n\n        // Overlay fields\n        try {\n            this.overlay_manager = new OverlayManager(this);\n        } catch (ex) {\n            this.overlay_manager = null;\n        }\n\n        this.in_vscode = false;\n        try {\n            vscode;\n            if (vscode)\n                this.in_vscode = true;\n        } catch (ex) { }\n\n        // Draw debug aids.\n        this.debug_draw = debug_draw;\n\n        this.init_elements(user_transform, background, mode_buttons);\n\n        this.relayout();\n\n        this.all_memlet_trees_sdfg = memlet_tree_complete(this.sdfg);\n\n        this.update_fast_memlet_lookup();\n    }\n\n    destroy() {\n        try {\n            if (this.menu)\n                this.menu.destroy();\n            this.canvas_manager.destroy();\n            this.container.removeChild(this.canvas);\n            this.container.removeChild(this.toolbar);\n            this.container.removeChild(this.tooltip_container);\n        } catch (ex) {\n            // Do nothing\n        }\n    }\n\n    view_settings() {\n        return { inclusive_ranges: this.inclusive_ranges };\n    }\n\n    // Updates buttons based on cursor mode\n    update_toggle_buttons() {\n        // First clear out of all modes, then jump in to the correct mode.\n        this.canvas.style.cursor = 'default';\n        this.interaction_info_box.style.display = 'none';\n        this.interaction_info_text.innerHTML = '';\n\n        this.panmode_btn.style = 'padding-bottom: 0px; user-select: none';\n        this.movemode_btn.style = 'padding-bottom: 0px; user-select: none';\n        this.selectmode_btn.style = 'padding-bottom: 0px; user-select: none';\n\n        this.mouse_follow_element.innerHTML = null;\n\n        for (let add_btn of this.addmode_btns) {\n            if (add_btn.getAttribute('type') == this.add_type) {\n                add_btn.style = 'user-select: none; background: ' +\n                    this.mode_selected_bg_color;\n                this.mouse_follow_element.innerHTML =\n                    this.mouse_follow_svgs[this.add_type];\n            } else {\n                add_btn.style = 'user-select: none;';\n            }\n        }\n\n        switch (this.mouse_mode) {\n            case 'move':\n                this.movemode_btn.style = 'padding-bottom: 0px; ' +\n                    'user-select: none; ' +\n                    'background: ' + this.mode_selected_bg_color;\n                this.interaction_info_box.style.display = 'block';\n                this.interaction_info_text.innerHTML =\n                    'Middle Mouse: Pan view<br>' +\n                    'Right Click: Reset position';\n                break;\n            case 'select':\n                this.selectmode_btn.style = 'padding-bottom: 0px; ' +\n                    'user-select: none; ' +\n                    'background: ' + this.mode_selected_bg_color;\n                this.interaction_info_box.style.display = 'block';\n                this.canvas.style.cursor = 'crosshair';\n                if (this.ctrl_key_selection) {\n                    this.interaction_info_text.innerHTML =\n                        'Middle Mouse: Pan view';\n                } else {\n                    this.interaction_info_text.innerHTML =\n                        'Shift: Add to selection<br>' +\n                        'Ctrl: Remove from selection<br>' +\n                        'Middle Mouse: Pan view';\n                }\n                break;\n            case 'add':\n                this.interaction_info_box.style.display = 'block';\n                if (this.add_type === 'Edge') {\n                    if (this.add_edge_start)\n                        this.interaction_info_text.innerHTML =\n                            'Left Click: Select second element (to)<br>' +\n                            'Middle Mouse: Pan view<br>' +\n                            'Right Click / Esc: Abort';\n                    else\n                        this.interaction_info_text.innerHTML =\n                            'Left Click: Select first element (from)<br>' +\n                            'Middle Mouse: Pan view<br>' +\n                            'Right Click / Esc: Abort';\n                } else {\n                    this.interaction_info_text.innerHTML =\n                        'Left Click: Place element<br>' +\n                        'Ctrl + Left Click: Place and stay in Add Mode<br>' +\n                        'Middle Mouse: Pan view<br>' +\n                        'Right Click / Esc: Abort';\n                }\n                break;\n            case 'pan':\n            default:\n                this.panmode_btn.style = 'padding-bottom: 0px; ' +\n                    'user-select: none; ' +\n                    'background: ' + this.mode_selected_bg_color;\n                break;\n        }\n    }\n\n    // Initializes the DOM\n    init_elements(user_transform, background, mode_buttons) {\n\n        this.canvas = document.createElement('canvas');\n        this.canvas.classList.add('sdfg_canvas')\n        if (background)\n            this.canvas.style.backgroundColor = background;\n        else\n            this.canvas.style.backgroundColor = 'inherit';\n        this.container.append(this.canvas);\n\n        if (this.debug_draw) {\n            this.dbg_info_box = document.createElement('div');\n            this.dbg_info_box.style.position = 'absolute';\n            this.dbg_info_box.style.bottom = '.5rem';\n            this.dbg_info_box.style.right = '.5rem';\n            this.dbg_info_box.style.backgroundColor = 'black';\n            this.dbg_info_box.style.padding = '.3rem';\n            this.dbg_mouse_coords = document.createElement('span');\n            this.dbg_mouse_coords.style.color = 'white';\n            this.dbg_mouse_coords.style.fontSize = '1rem';\n            this.dbg_mouse_coords.innerText = 'x: N/A / y: N/A';\n            this.dbg_info_box.appendChild(this.dbg_mouse_coords);\n            this.container.appendChild(this.dbg_info_box);\n        }\n\n        // Add an info box for interaction hints to the bottom left of the\n        // canvas.\n        this.interaction_info_box = document.createElement('div');\n        this.interaction_info_box.style.position = 'absolute';\n        this.interaction_info_box.style.bottom = '.5rem',\n        this.interaction_info_box.style.left = '.5rem',\n        this.interaction_info_box.style.backgroundColor = 'rgba(0, 0, 0, 0.5)';\n        this.interaction_info_box.style.borderRadius = '5px';\n        this.interaction_info_box.style.padding = '.3rem';\n        this.interaction_info_box.style.display = 'none';\n        this.interaction_info_text = document.createElement('span');\n        this.interaction_info_text.style.color = '#eeeeee';\n        this.interaction_info_text.innerHTML = '';\n        this.interaction_info_box.appendChild(this.interaction_info_text);\n        this.container.appendChild(this.interaction_info_box);\n\n        // Add buttons\n        this.toolbar = document.createElement('div');\n        this.toolbar.style = 'position:absolute; top:10px; left: 10px;';\n        let d;\n\n        // Menu bar\n        try {\n            ContextMenu;\n            d = document.createElement('button');\n            d.className = 'button';\n            d.innerHTML = '<i class=\"material-icons\">menu</i>';\n            d.style = 'padding-bottom: 0px; user-select: none';\n            let that = this;\n            d.onclick = function () {\n                if (that.menu && that.menu.visible()) {\n                    that.menu.destroy();\n                    return;\n                }\n                let rect = this.getBoundingClientRect();\n                let cmenu = new ContextMenu();\n                cmenu.addOption(\"Save view as PNG\", x => that.save_as_png());\n                if (that.has_pdf()) {\n                    cmenu.addOption(\"Save view as PDF\", x => that.save_as_pdf());\n                    cmenu.addOption(\"Save all as PDF\", x => that.save_as_pdf(true));\n                }\n                cmenu.addCheckableOption(\"Inclusive ranges\", that.inclusive_ranges, (x, checked) => { that.inclusive_ranges = checked; });\n                cmenu.addCheckableOption(\"Adaptive content hiding\", that.ctx.lod, (x, checked) => { that.ctx.lod = checked; });\n                if (!this.in_vscode)\n                    cmenu.addOption(\n                        'Overlays',\n                        () => {\n                            if (that.overlays_menu && that.overlays_menu.visible()) {\n                                that.overlays_menu.destroy();\n                                return;\n                            }\n                            let rect = cmenu._cmenu_elem.getBoundingClientRect();\n                            let overlays_cmenu = new ContextMenu();\n                            overlays_cmenu.addCheckableOption(\n                                'Memory volume analysis',\n                                that.overlay_manager.is_overlay_active(\n                                    MemoryVolumeOverlay\n                                ),\n                                (x, checked) => {\n                                    if (checked)\n                                        that.overlay_manager.register_overlay(\n                                            MemoryVolumeOverlay\n                                        );\n                                    else\n                                        that.overlay_manager.deregister_overlay(\n                                            MemoryVolumeOverlay\n                                        );\n                                    that.draw_async();\n                                    if (this.in_vscode)\n                                        refresh_analysis_pane();\n                                }\n                            );\n                            that.overlays_menu = overlays_cmenu;\n                            that.overlays_menu.show(rect.left, rect.top);\n                        }\n                    );\n                cmenu.addCheckableOption(\"Hide Access Nodes\", that.omit_access_nodes, (_, checked) => {\n                    that.omit_access_nodes = checked;\n                    that.relayout();\n                    that.draw_async();\n                });\n                cmenu.addOption(\"Reset positions\", () => that.reset_positions());\n                that.menu = cmenu;\n                that.menu.show(rect.left, rect.bottom);\n            };\n            d.title = 'Menu';\n            this.toolbar.appendChild(d);\n        } catch (ex) { }\n\n        // Zoom to fit\n        d = document.createElement('button');\n        d.className = 'button';\n        d.innerHTML = '<i class=\"material-icons\">filter_center_focus</i>';\n        d.style = 'padding-bottom: 0px; user-select: none';\n        d.onclick = () => this.zoom_to_view();\n        d.title = 'Zoom to fit SDFG';\n        this.toolbar.appendChild(d);\n\n        // Collapse all\n        d = document.createElement('button');\n        d.className = 'button';\n        d.innerHTML = '<i class=\"material-icons\">unfold_less</i>';\n        d.style = 'padding-bottom: 0px; user-select: none';\n        d.onclick = () => this.collapse_all();\n        d.title = 'Collapse all elements';\n        this.toolbar.appendChild(d);\n\n        // Expand all\n        d = document.createElement('button');\n        d.className = 'button';\n        d.innerHTML = '<i class=\"material-icons\">unfold_more</i>';\n        d.style = 'padding-bottom: 0px; user-select: none';\n        d.onclick = () => this.expand_all();\n        d.title = 'Expand all elements';\n        this.toolbar.appendChild(d);\n\n        if (mode_buttons) {\n            // If we get the \"external\" mode buttons we are in vscode and do\n            // not need to create them.\n            this.panmode_btn = mode_buttons.pan;\n            this.movemode_btn = mode_buttons.move;\n            this.selectmode_btn = mode_buttons.select;\n            this.addmode_btns = mode_buttons.add_btns;\n            for (let add_btn of this.addmode_btns) {\n                if (add_btn.getAttribute('type') === 'LibraryNode') {\n                    add_btn.onclick = () => {\n                        this.show_select_library_node_dialog(() => {\n                            this.mouse_mode = 'add';\n                            this.add_type = 'LibraryNode';\n                            this.add_edge_start = null;\n                            this.update_toggle_buttons()\n                        });\n                    };\n                } else {\n                    add_btn.onclick = () => {\n                        if (!daemon_connected) {\n                            this.show_no_daemon_dialog();\n                        } else {\n                            this.mouse_mode = 'add';\n                            this.add_type = add_btn.getAttribute('type');\n                            this.add_mode_lib = null;\n                            this.add_edge_start = null;\n                            this.update_toggle_buttons();\n                        }\n                    };\n                }\n            }\n            this.mode_selected_bg_color = '#22A4FE';\n        } else {\n            // Mode buttons are empty in standalone SDFV\n            this.addmode_btns = [];\n\n            // Create pan mode button\n            let pan_mode_btn = document.createElement('button');\n            pan_mode_btn.className = 'button';\n            pan_mode_btn.innerHTML = '<i class=\"material-icons\">pan_tool</i>';\n            pan_mode_btn.style = 'padding-bottom: 0px; user-select: none; background: ' + this.mode_selected_bg_color;\n            pan_mode_btn.title = 'Pan mode';\n            this.panmode_btn = pan_mode_btn;\n            this.toolbar.appendChild(pan_mode_btn);\n\n            // Create move mode button\n            let move_mode_btn = document.createElement('button');\n            move_mode_btn.className = 'button';\n            move_mode_btn.innerHTML = '<i class=\"material-icons\">open_with</i>';\n            move_mode_btn.style = 'padding-bottom: 0px; user-select: none';\n            move_mode_btn.title = 'Object moving mode';\n            this.movemode_btn = move_mode_btn;\n            this.toolbar.appendChild(move_mode_btn);\n\n            // Create select mode button\n            let box_select_btn = document.createElement('button');\n            box_select_btn.className = 'button';\n            box_select_btn.innerHTML = '<i class=\"material-icons\">border_style</i>';\n            box_select_btn.style = 'padding-bottom: 0px; user-select: none';\n            box_select_btn.title = 'Select mode';\n            this.selectmode_btn = box_select_btn;\n            this.toolbar.appendChild(box_select_btn);\n        }\n\n        // Enter pan mode\n        this.panmode_btn.onclick = () => {\n            this.mouse_mode = 'pan';\n            this.add_type = null;\n            this.add_mode_lib = null;\n            this.add_edge_start = null;\n            this.update_toggle_buttons();\n        };\n\n        // Enter object moving mode\n        this.movemode_btn.onclick = (_, shift_click) => {\n            // shift_click is false if shift key has been released and\n            // undefined if it has been a normal mouse click\n            if (this.shift_key_movement && shift_click === false)\n                this.mouse_mode = 'pan';\n            else\n                this.mouse_mode = 'move';\n            this.add_type = null;\n            this.add_mode_lib = null;\n            this.add_edge_start = null;\n            this.shift_key_movement = shift_click;\n            this.update_toggle_buttons();\n        };\n\n        // Enter box selection mode\n        this.selectmode_btn.onclick = (_, ctrl_click) => {\n            // ctrl_click is false if ctrl key has been released and\n            // undefined if it has been a normal mouse click\n            if (this.ctrl_key_selection && ctrl_click === false)\n                this.mouse_mode = 'pan';\n            else\n                this.mouse_mode = 'select';\n            this.add_type = null;\n            this.add_mode_lib = null;\n            this.add_edge_start = null;\n            this.ctrl_key_selection = ctrl_click;\n            this.update_toggle_buttons();\n        };\n\n        // React to ctrl and shift key presses\n        document.addEventListener('keydown', (e) => this.on_key_event(e));\n        document.addEventListener('keyup', (e) => this.on_key_event(e));\n\n        // Exit previewing mode\n        if (this.in_vscode) {\n            let exit_preview_btn = document.createElement('button');\n            exit_preview_btn.id = 'exit-preview-button';\n            exit_preview_btn.className = 'button hidden';\n            exit_preview_btn.innerHTML = '<i class=\"material-icons\">close</i>';\n            exit_preview_btn.style = 'padding-bottom: 0px; user-select: none';\n            exit_preview_btn.onclick = () => {\n                exit_preview_btn.className = 'button hidden';\n                window.viewing_history_state = false;\n                if (vscode) {\n                    vscode.postMessage({\n                        type: 'sdfv.get_current_sdfg',\n                        prevent_refreshes: true,\n                    });\n                    vscode.postMessage({\n                        type: 'transformation_history.refresh',\n                        reset_active: true,\n                    });\n                }\n            };\n            exit_preview_btn.title = 'Exit preview';\n            this.toolbar.appendChild(exit_preview_btn);\n        }\n\n        this.container.append(this.toolbar);\n        // End of buttons\n\n        // Tooltip HTML container\n        this.tooltip_container = document.createElement('div');\n        this.tooltip_container.innerHTML = '';\n        this.tooltip_container.className = 'sdfvtooltip';\n        this.tooltip_container.onmouseover = () => this.tooltip_container.style.display = \"none\";\n        this.container.appendChild(this.tooltip_container);\n\n        // HTML container for error popovers with invalid SDFGs\n        this.error_popover_container = document.createElement('div');\n        this.error_popover_container.innerHTML = '';\n        this.error_popover_container.className = 'invalid_popup';\n        this.error_popover_text = document.createElement('div');\n        let error_popover_dismiss = document.createElement('button');\n        let that = this;\n        error_popover_dismiss.onclick = () => {\n            that.sdfg.error = undefined;\n            that.error_popover_text.innerText = '';\n            that.error_popover_container.style.display = 'none';\n        };\n        error_popover_dismiss.style.float = 'right';\n        error_popover_dismiss.style.cursor = 'pointer';\n        error_popover_dismiss.style.color = 'white';\n        error_popover_dismiss.innerHTML = '<i class=\"material-icons\">close</i>';\n        this.error_popover_container.appendChild(error_popover_dismiss);\n        this.error_popover_container.appendChild(this.error_popover_text);\n        this.container.appendChild(this.error_popover_container);\n\n        this.ctx = this.canvas.getContext(\"2d\");\n\n        // Translation/scaling management\n        this.canvas_manager = new CanvasManager(this.ctx, this, this.canvas);\n        if (user_transform !== null)\n            this.canvas_manager.user_transform = user_transform;\n\n        // Resize event for container\n        let observer = new MutationObserver((mutations) => { this.onresize(); this.draw_async(); });\n        observer.observe(this.container, { attributes: true });\n\n        // Set inherited properties\n        if (background)\n            this.bgcolor = background;\n        else\n            this.bgcolor = window.getComputedStyle(this.canvas).backgroundColor;\n\n        // Create the initial SDFG layout\n        this.relayout();\n\n        // Set mouse event handlers\n        this.set_mouse_handlers();\n\n        // Set initial zoom, if not already set\n        if (user_transform === null)\n            this.zoom_to_view();\n\n        let svgs = {};\n        svgs['Map'] =\n            `<svg width=\"8rem\" height=\"2rem\" viewBox=\"0 0 800 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"10\" x2=\"190\" y1=\"190\" y2=\"10\"/>\n                <line x1=\"190\" x2=\"600\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"600\" x2=\"790\" y1=\"10\" y2=\"190\"/>\n                <line x1=\"790\" x2=\"10\" y1=\"190\" y2=\"190\"/>\n            </svg>`;\n        svgs['Consume'] =\n            `<svg width=\"8rem\" height=\"2rem\" viewBox=\"0 0 800 200\" stroke=\"black\" stroke-width=\"10\" stroke-dasharray=\"60,25\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"10\"x2=\"190\" y1=\"190\" y2=\"10\"/>\n                <line x1=\"190\" x2=\"600\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"600\" x2=\"790\" y1=\"10\" y2=\"190\"/>\n                <line x1=\"790\" x2=\"10\" y1=\"190\" y2=\"190\"/>\n            </svg>`;\n        svgs['Tasklet'] =\n            `<svg width=\"2.6rem\" height=\"1.3rem\" viewBox=\"0 0 400 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"10\" x2=\"70\" y1=\"130\" y2=\"190\"/>\n                <line x1=\"70\" x2=\"330\" y1=\"190\" y2=\"190\"/>\n                <line x1=\"330\" x2=\"390\" y1=\"190\" y2=\"130\"/>\n                <line x1=\"390\" x2=\"390\" y1=\"130\" y2=\"70\"/>\n                <line x1=\"390\" x2=\"330\" y1=\"70\" y2=\"10\"/>\n                <line x1=\"330\" x2=\"70\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"70\" x2=\"10\" y1=\"10\" y2=\"70\"/>\n                <line x1=\"10\" x2=\"10\" y1=\"70\" y2=\"130\"/>\n            </svg>`;\n        svgs['NestedSDFG'] =\n            `<svg width=\"2.6rem\" height=\"1.3rem\" viewBox=\"0 0 400 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"40\" x2=\"80\" y1=\"120\" y2=\"160\"/>\n                <line x1=\"80\" x2=\"320\" y1=\"160\" y2=\"160\"/>\n                <line x1=\"320\" x2=\"360\" y1=\"160\" y2=\"120\"/>\n                <line x1=\"360\" x2=\"360\" y1=\"120\" y2=\"80\"/>\n                <line x1=\"360\" x2=\"320\" y1=\"80\" y2=\"40\"/>\n                <line x1=\"320\" x2=\"80\" y1=\"40\" y2=\"40\"/>\n                <line x1=\"80\" x2=\"40\" y1=\"40\" y2=\"80\"/>\n                <line x1=\"40\" x2=\"40\" y1=\"80\" y2=\"120\"/>\n                \n                <line x1=\"10\" x2=\"70\" y1=\"130\" y2=\"190\"/>\n                <line x1=\"70\" x2=\"330\" y1=\"190\" y2=\"190\"/>\n                <line x1=\"330\" x2=\"390\" y1=\"190\" y2=\"130\"/>\n                <line x1=\"390\" x2=\"390\" y1=\"130\" y2=\"70\"/>\n                <line x1=\"390\" x2=\"330\" y1=\"70\" y2=\"10\"/>\n                <line x1=\"330\" x2=\"70\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"70\" x2=\"10\" y1=\"10\" y2=\"70\"/>\n                <line x1=\"10\" x2=\"10\" y1=\"70\" y2=\"130\"/>\n            </svg>`;\n        svgs['LibraryNode'] =\n            `<svg width=\"2.6rem\" height=\"1.3rem\" viewBox=\"0 0 400 200\" stroke=\"white\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                        <line x1=\"10\" x2=\"10\" y1=\"10\" y2=\"190\"/>\n                        <line x1=\"10\" x2=\"390\" y1=\"190\" y2=\"190\"/>\n                        <line x1=\"390\" x2=\"390\" y1=\"190\" y2=\"55\"/>\n                        <line x1=\"390\" x2=\"345\" y1=\"55\" y2=\"10\"/>\n                        <line x1=\"345\" x2=\"10\" y1=\"10\" y2=\"10\"/>\n                        <line x1=\"345\" x2=\"345\" y1=\"10\" y2=\"55\"/>\n                        <line x1=\"345\" x2=\"390\" y1=\"55\" y2=\"55\"/>\n            </svg>`;\n        svgs['AccessNode'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <circle cx=\"100\" cy=\"100\" r=\"90\" fill=\"none\"/>\n            </svg>`;\n        svgs['Stream'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <circle cx=\"100\" cy=\"100\" r=\"90\" fill=\"none\" stroke-dasharray=\"60,25\"/>\n            </svg>`;\n        svgs['SDFGState'] = \n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <rect x=\"20\" y=\"20\" width=\"160\" height=\"160\" style=\"fill:#deebf7;\" />\n            </svg>`;\n        svgs['Connector'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"white\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <circle cx=\"100\" cy=\"100\" r=\"40\" fill=\"none\"/>\n            </svg>`;\n        svgs['Edge'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"white\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <defs>\n                    <marker id=\"arrowhead\" markerWidth=\"10\" markerHeight=\"7\"  refX=\"0\" refY=\"3.5\" orient=\"auto\">\n                        <polygon points=\"0 0, 10 3.5, 0 7\" />\n                    </marker>\n                </defs>\n                <line x1=\"20\" y1=\"20\" x2=\"180\" y2=\"180\" marker-end=\"url(#arrowhead)\" />\n            </svg>`;\n\n        let el = document.createElement('div');\n        el.style = 'position: absolute; top: 0px; left: 0px; user-select: none; pointer-events: none;'\n        \n        this.container.appendChild(el);\n        \n        this.mouse_follow_element = el;\n        this.mouse_follow_svgs = svgs;\n\n        this.update_toggle_buttons();\n\n        // Queue first render\n        this.draw_async();\n    }\n\n    draw_async() {\n        this.canvas_manager.draw_async();\n    }\n\n    // --------------------------------------------------------------\n    // These functions are only implemented in the context of VSCode.\n\n    send_new_sdfg_to_vscode() {}\n\n    add_node_to_graph() {}\n\n    remove_graph_nodes() {}\n\n    update_new_element() {}\n\n    show_no_daemon_dialog() {}\n\n    show_select_library_node_dialog() {}\n\n    // END VSCode specific functions.\n    // --------------------------------------------------------------\n\n    set_sdfg(new_sdfg) {\n        this.sdfg = new_sdfg;\n\n        this.relayout();\n        this.draw_async();\n    \n        // Update info box\n        if (this.selected_elements.length == 1) {\n            let uuid = get_uuid_graph_element(this.selected_elements[0]);\n            fill_info(find_graph_element_by_uuid(this.graph, uuid).element);\n        }\n    }\n\n    // Set mouse events (e.g., click, drag, zoom)\n    set_mouse_handlers() {\n        let canvas = this.canvas;\n        let br = () => canvas.getBoundingClientRect();\n\n        let comp_x = event => this.canvas_manager.mapPixelToCoordsX(event.clientX - br().left);\n        let comp_y = event => this.canvas_manager.mapPixelToCoordsY(event.clientY - br().top);\n\n        // Mouse handler event types\n        for (let evtype of ['mousedown', 'mousemove', 'mouseup', 'touchstart', 'touchmove', 'touchend',\n            'wheel', 'click', 'dblclick', 'contextmenu']) {\n            canvas.addEventListener(evtype, x => {\n                let cancelled = this.on_mouse_event(x, comp_x, comp_y, evtype);\n                if (cancelled)\n                    return;\n                if (!this.in_vscode) {\n                    x.stopPropagation();\n                    x.preventDefault();\n                }\n            });\n        }\n    }\n\n    onresize() {\n        // Set canvas size\n        this.canvas.style.width = '99%';\n        this.canvas.style.height = '99%';\n        this.canvas.width = this.canvas.offsetWidth;\n        this.canvas.height = this.canvas.offsetHeight;\n    }\n\n    // Update memlet tree collection for faster lookup\n    update_fast_memlet_lookup() {\n        this.all_memlet_trees = [];\n        for (let tree of this.all_memlet_trees_sdfg) {\n            let s = new Set();\n            for (let edge of tree) {\n                s.add(edge.attributes.data.edge);\n            }\n            this.all_memlet_trees.push(s);\n        }\n    }\n\n    // Re-layout graph and nested graphs\n    relayout() {\n        this.sdfg_list = {};\n        this.graph = relayout_sdfg(this.ctx, this.sdfg, this.sdfg_list,\n            this.state_parent_list, this.omit_access_nodes);\n        this.onresize();\n\n        this.update_fast_memlet_lookup();\n\n        // Move the elements based on its positioning information\n        this.translate_moved_elements();\n\n        // Make sure all visible overlays get recalculated if there are any.\n        if (this.overlay_manager !== null)\n            this.overlay_manager.refresh();\n\n        // If we're in a VSCode context, we also want to refresh the outline.\n        try {\n            if (vscode)\n                outline(this, this.graph);\n        } catch (ex) { }\n\n        return this.graph;\n    }\n\n    translate_moved_elements() {\n        traverse_sdfg_scopes(this.graph, (node, graph) => {\n            let scope_dx = 0;\n            let scope_dy = 0;\n\n            function add_scope_movement(n) {\n                if (n.data.node.scope_entry) {\n                    let scope_entry_node = graph.node(n.data.node.scope_entry);\n                    let sp = get_positioning_info(scope_entry_node);\n                    if (sp && Number.isFinite(sp.scope_dx) &&\n                        Number.isFinite(sp.scope_dy)) {\n                        scope_dx += sp.scope_dx;\n                        scope_dy += sp.scope_dy;\n                    }\n                    if (scope_entry_node) {\n                        add_scope_movement(scope_entry_node);\n                    }\n                }\n            }\n\n            // Only add scope movement for nodes (and not states)\n            if (node instanceof Node)\n                add_scope_movement(node);\n\n            let dx = scope_dx;\n            let dy = scope_dy;\n\n            let position = get_positioning_info(node);\n            if (position) {\n                dx += position.dx;\n                dy += position.dy;\n            }\n\n            if (dx || dy) {\n                // Move the element\n                this.canvas_manager.translate_element(\n                    node, { x: node.x, y: node.y },\n                    { x: node.x + dx, y: node.y + dy }, this.graph,\n                    this.sdfg_list, this.state_parent_list, undefined, false\n                );\n            }\n\n            graph.inEdges(node.id).forEach(_ => {});\n\n            // Move edges (outgoing only)\n            graph.inEdges(node.id)?.forEach(e_id => {\n                let edge = graph.edge(e_id);\n                let edge_pos = get_positioning_info(edge);\n\n                let final_pos_d;\n                // If edges are moved within a given scope, update the point movements\n                if (scope_dx || scope_dy) {\n                    final_pos_d = [];\n                    final_pos_d.push({ dx: 0, dy: 0 }); // never move first (and last) point manually\n                    for (let i = 1; i < edge.points.length - 1; i++) {\n                        final_pos_d.push({ dx: scope_dx, dy: scope_dy });\n                        if (edge_pos?.points) {\n                            final_pos_d[i].dx += edge_pos.points[i].dx;\n                            final_pos_d[i].dx += edge_pos.points[i].dy;\n                        }\n                    }\n                    final_pos_d.push({ dx: 0, dy: 0 }); // never move last (and first) point manually\n                } else if (edge_pos?.points) {\n                    final_pos_d = edge_pos.points;\n                }\n                if (final_pos_d) {\n                    // Move the element\n                    this.canvas_manager.translate_element(edge, { x: 0, y: 0 },\n                        { x: 0, y: 0 }, this.graph, this.sdfg_list,\n                        this.state_parent_list, undefined, false, false, final_pos_d);\n                }\n            });\n            return true;\n        });\n    }\n\n    // Change translation and scale such that the chosen elements\n    // (or entire graph if null) is in view\n    zoom_to_view(elements = null, animate = true) {\n        if (!elements || elements.length == 0)\n            elements = this.graph.nodes().map(x => this.graph.node(x));\n\n        let bb = boundingBox(elements);\n        this.canvas_manager.set_view(bb, animate);\n\n        this.draw_async();\n    }\n\n    collapse_all() {\n        this.for_all_sdfg_elements((otype, odict, obj) => {\n            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit'))\n                obj.attributes.is_collapsed = true;\n        });\n\n        this.send_new_sdfg_to_vscode();\n\n        this.relayout();\n        this.draw_async();\n    }\n\n    expand_all() {\n        this.for_all_sdfg_elements((otype, odict, obj) => {\n            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit'))\n                obj.attributes.is_collapsed = false;\n        });\n\n        this.send_new_sdfg_to_vscode();\n\n        this.relayout();\n        this.draw_async();\n    }\n\n    reset_positions() {\n        this.for_all_sdfg_elements((otype, odict, obj) => {\n            delete_positioning_info(obj);\n        });\n\n        this.send_new_sdfg_to_vscode();\n\n        this.relayout();\n        this.draw_async();\n    }\n\n    // Save functions\n    save(filename, contents) {\n        var link = document.createElement('a');\n        link.setAttribute('download', filename);\n        link.href = contents;\n        document.body.appendChild(link);\n\n        // wait for the link to be added to the document\n        window.requestAnimationFrame(function () {\n            var event = new MouseEvent('click');\n            link.dispatchEvent(event);\n            document.body.removeChild(link);\n        });\n    }\n\n    save_as_png() {\n        this.save('sdfg.png', this.canvas.toDataURL('image/png'));\n    }\n\n    has_pdf() {\n        try {\n            blobStream;\n            canvas2pdf.PdfContext;\n            return true;\n        } catch (e) {\n            return false;\n        }\n    }\n\n    save_as_pdf(save_all = false) {\n        let stream = blobStream();\n\n        // Compute document size\n        let curx = this.canvas_manager.mapPixelToCoordsX(0);\n        let cury = this.canvas_manager.mapPixelToCoordsY(0);\n        let size;\n        if (save_all) {\n            // Get size of entire graph\n            let elements = this.graph.nodes().map(x => this.graph.node(x));\n            let bb = boundingBox(elements);\n            size = [bb.width, bb.height];\n        } else {\n            // Get size of current view\n            let endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);\n            let endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);\n            let curw = endx - curx, curh = endy - cury;\n            size = [curw, curh];\n        }\n        //\n\n        let ctx = new canvas2pdf.PdfContext(stream, {\n            size: size\n        });\n        let oldctx = this.ctx;\n        this.ctx = ctx;\n        this.ctx.lod = !save_all;\n        this.ctx.pdf = true;\n        // Center on saved region\n        if (!save_all)\n            this.ctx.translate(-curx, -cury);\n\n        this.draw_async();\n\n        ctx.stream.on('finish', () => {\n            this.save('sdfg.pdf', ctx.stream.toBlobURL('application/pdf'));\n            this.ctx = oldctx;\n            this.draw_async();\n        });\n    }\n\n    // Draw a debug grid on the canvas to indicate coordinates.\n    debug_draw_grid(curx, cury, endx, endy, grid_width = 100) {\n        const lim_x_min = Math.floor(curx / grid_width) * grid_width;\n        const lim_x_max = Math.ceil(endx / grid_width) * grid_width;\n        const lim_y_min = Math.floor(cury / grid_width) * grid_width;\n        const lim_y_max = Math.ceil(endy / grid_width) * grid_width;\n        for (var i = lim_x_min; i <= lim_x_max; i += grid_width) {\n            this.ctx.moveTo(i, lim_y_min);\n            this.ctx.lineTo(i, lim_y_max);\n        }\n        for (var i = lim_y_min; i <= lim_y_max; i += grid_width) {\n            this.ctx.moveTo(lim_x_min, i);\n            this.ctx.lineTo(lim_x_max, i);\n        }\n        this.ctx.strokeStyle = 'yellow';\n        this.ctx.stroke();\n\n        // Draw the zero-point.\n        this.ctx.beginPath();\n        this.ctx.arc(0, 0, 10, 0, 2 * Math.PI, false);\n        this.ctx.fillStyle = 'red';\n        this.ctx.fill();\n        this.ctx.strokeStyle = 'red';\n        this.ctx.stroke();\n    }\n\n    // Render SDFG\n    draw(dt) {\n        const ctx = this.ctx;\n        const g = this.graph;\n        const curx = this.canvas_manager.mapPixelToCoordsX(0);\n        const cury = this.canvas_manager.mapPixelToCoordsY(0);\n        const endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);\n        const endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);\n        const curw = endx - curx, curh = endy - cury;\n\n        this.visible_rect = { x: curx, y: cury, w: curw, h: curh };\n\n        this.on_pre_draw();\n\n        draw_sdfg(this, ctx, g, this.mousepos, this.debug_draw);\n\n        if (this.box_select_rect) {\n            this.ctx.beginPath();\n            const old_line_width = this.ctx.lineWidth;\n            this.ctx.lineWidth = this.canvas_manager.points_per_pixel();\n            this.ctx.strokeStyle = 'grey';\n            this.ctx.rect(this.box_select_rect.x_start, this.box_select_rect.y_start,\n                this.box_select_rect.x_end - this.box_select_rect.x_start,\n                this.box_select_rect.y_end - this.box_select_rect.y_start);\n            this.ctx.stroke();\n            this.ctx.lineWidth = old_line_width;\n        }\n\n        if (this.debug_draw) {\n            this.debug_draw_grid(curx, cury, endx, endy, 100);\n            if (this.mousepos) {\n                this.dbg_mouse_coords.innerText = 'x: ' + Math.floor(this.mousepos.x) +\n                    ' / y: ' + Math.floor(this.mousepos.y);\n            } else {\n                this.dbg_mouse_coords.innerText = 'x: N/A / y: N/A';\n            }\n        }\n\n        this.on_post_draw();\n    }\n\n    on_pre_draw() { }\n\n    on_post_draw() {\n        if (this.overlay_manager !== null)\n            this.overlay_manager.draw();\n\n        try {\n            this.ctx.end();\n        } catch (ex) {\n            // TODO make sure no error is thrown instead of catching and silently ignoring it?\n        }\n\n        if (this.tooltip) {\n            const br = this.canvas.getBoundingClientRect();\n            const pos = {\n                x: this.realmousepos.x - br.x,\n                y: this.realmousepos.y - br.y\n            };\n\n            // Clear style and contents\n            this.tooltip_container.style = '';\n            this.tooltip_container.innerHTML = '';\n            this.tooltip_container.style.display = 'block';\n\n            // Invoke custom container\n            this.tooltip(this.tooltip_container);\n\n            // Make visible near mouse pointer\n            this.tooltip_container.style.top = pos.y + 'px';\n            this.tooltip_container.style.left = (pos.x + 20) + 'px';\n        } else {\n            this.tooltip_container.style.display = 'none';\n        }\n\n        if (this.sdfg.error) {\n            const error = this.sdfg.error;\n\n            let type = '';\n            let state_id = -1;\n            let el_id = -1;\n            if (error.isedge_id !== undefined) {\n                type = 'isedge';\n                el_id = error.isedge_id;\n            } else if (error.state_id !== undefined) {\n                state_id = error.state_id;\n                if (error.node_id !== undefined) {\n                    type = 'node';\n                    el_id = error.node_id;\n                } else if (error.edge_id !== undefined) {\n                    type = 'edge';\n                    el_id = error.edge_id;\n                } else {\n                    type = 'state';\n                }\n            } else {\n                return;\n            }\n            const offending_element = find_graph_element(\n                this.graph, type, error.sdfg_id, state_id, el_id\n            );\n            if (offending_element) {\n                this.zoom_to_view([offending_element]);\n                this.error_popover_container.style.display = 'block';\n                this.error_popover_container.style.bottom = '5%';\n                this.error_popover_container.style.left = '5%';\n                this.error_popover_text.innerText = error.message;\n            }\n        } else {\n            this.error_popover_container.style.display = 'none';\n        }\n    }\n\n    visible_elements() {\n        const curx = this.canvas_manager.mapPixelToCoordsX(0);\n        const cury = this.canvas_manager.mapPixelToCoordsY(0);\n        const endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);\n        const endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);\n        const curw = endx - curx;\n        const curh = endy - cury;\n        const elements = [];\n        this.do_for_intersected_elements(curx, cury, curw, curh, (type, e, obj) => {\n            const state_id = e.state ? Number(e.state) : -1;\n            let el_type = 'other';\n            if (type === 'nodes')\n                el_type = 'node';\n            else if (type === 'states')\n                el_type = 'state';\n            else if (type === 'edges')\n                el_type = 'edge';\n            else if (type === 'isedges')\n                el_type = 'isedge';\n            else if (type === 'connectors')\n                el_type = 'connector';\n            elements.push({\n                type: el_type,\n                sdfg_id: Number(e.sdfg_id),\n                state_id: state_id,\n                id: Number(e.id),\n            });\n        });\n        return elements;\n    }\n\n    // Returns a dictionary of SDFG elements in a given rectangle. Used for\n    // selection, rendering, localized transformations, etc.\n    // The output is a dictionary of lists of dictionaries. The top-level keys are:\n    // states, nodes, connectors, edges, isedges (interstate edges). For example:\n    // {'states': [{sdfg: sdfg_name, state: 1}, ...], nodes: [sdfg: sdfg_name, state: 1, node: 5],\n    //              edges: [], isedges: [], connectors: []}\n    elements_in_rect(x, y, w, h) {\n        const elements = {\n            states: [], nodes: [], connectors: [],\n            edges: [], isedges: []\n        };\n        this.do_for_intersected_elements(x, y, w, h, (type, e, obj) => {\n            e.obj = obj;\n            elements[type].push(e);\n        });\n        return elements;\n    }\n\n    do_for_intersected_elements(x, y, w, h, func) {\n        // Traverse nested SDFGs recursively\n        function traverse_recursive(g, sdfg_name, sdfg_id) {\n            g.nodes().forEach(state_id => {\n                const state = g.node(state_id);\n                if (!state) return;\n\n                if (state.intersect(x, y, w, h)) {\n                    // States\n                    func('states', { sdfg: sdfg_name, sdfg_id: sdfg_id, id: state_id }, state);\n\n                    if (state.data.state.attributes.is_collapsed)\n                        return;\n\n                    const ng = state.data.graph;\n                    if (!ng)\n                        return;\n                    ng.nodes().forEach(node_id => {\n                        const node = ng.node(node_id);\n                        if (node.intersect(x, y, w, h)) {\n                            // Selected nodes\n                            func('nodes', { sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, id: node_id }, node);\n\n                            // If nested SDFG, traverse recursively\n                            if (node.data.node.type === \"NestedSDFG\")\n                                traverse_recursive(node.data.graph,\n                                    node.data.node.attributes.sdfg.attributes.name,\n                                    node.data.node.attributes.sdfg.sdfg_list_id);\n                        }\n                        // Connectors\n                        node.in_connectors.forEach((c, i) => {\n                            if (c.intersect(x, y, w, h))\n                                func('connectors', {\n                                    sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, node: node_id,\n                                    connector: i, conntype: \"in\"\n                                }, c);\n                        });\n                        node.out_connectors.forEach((c, i) => {\n                            if (c.intersect(x, y, w, h))\n                                func('connectors', {\n                                    sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, node: node_id,\n                                    connector: i, conntype: \"out\"\n                                }, c);\n                        });\n                    });\n\n                    // Selected edges\n                    ng.edges().forEach(edge_id => {\n                        const edge = ng.edge(edge_id);\n                        if (edge.intersect(x, y, w, h)) {\n                            func('edges', { sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, id: edge.id }, edge);\n                        }\n                    });\n                }\n            });\n\n            // Selected inter-state edges\n            g.edges().forEach(isedge_id => {\n                const isedge = g.edge(isedge_id);\n                if (isedge.intersect(x, y, w, h)) {\n                    func('isedges', { sdfg: sdfg_name, sdfg_id: sdfg_id, id: isedge.id }, isedge);\n                }\n            });\n        }\n\n        // Start with top-level SDFG\n        traverse_recursive(this.graph, this.sdfg.attributes.name,\n            this.sdfg.sdfg_list_id);\n    }\n\n    for_all_sdfg_elements(func) {\n        // Traverse nested SDFGs recursively\n        function traverse_recursive(sdfg) {\n            sdfg.nodes.forEach((state, state_id) => {\n                // States\n                func('states', { sdfg: sdfg, id: state_id }, state);\n\n                state.nodes.forEach((node, node_id) => {\n                    // Nodes\n                    func('nodes', { sdfg: sdfg, state: state_id, id: node_id }, node);\n\n                    // If nested SDFG, traverse recursively\n                    if (node.type === \"NestedSDFG\")\n                        traverse_recursive(node.attributes.sdfg);\n                });\n\n                // Edges\n                state.edges.forEach((edge, edge_id) => {\n                    func('edges', { sdfg: sdfg, state: state_id, id: edge_id }, edge);\n                });\n            });\n\n            // Selected inter-state edges\n            sdfg.edges.forEach((isedge, isedge_id) => {\n                func('isedges', { sdfg: sdfg, id: isedge_id }, isedge);\n            });\n        }\n\n        // Start with top-level SDFG\n        traverse_recursive(this.sdfg);\n    }\n\n    for_all_elements(x, y, w, h, func) {\n        // Traverse nested SDFGs recursively\n        function traverse_recursive(g, sdfg_name) {\n            g.nodes().forEach(state_id => {\n                const state = g.node(state_id);\n                if (!state) return;\n\n                // States\n                func('states', { sdfg: sdfg_name, id: state_id, graph: g }, state, state.intersect(x, y, w, h));\n\n                if (state.data.state.attributes.is_collapsed)\n                    return;\n\n                const ng = state.data.graph;\n                if (!ng)\n                    return;\n                ng.nodes().forEach(node_id => {\n                    const node = ng.node(node_id);\n                    // Selected nodes\n                    func('nodes', { sdfg: sdfg_name, state: state_id, id: node_id, graph: ng }, node, node.intersect(x, y, w, h));\n\n                    // If nested SDFG, traverse recursively\n                    if (node.data.node.type === \"NestedSDFG\")\n                        traverse_recursive(node.data.graph, node.data.node.attributes.sdfg.attributes.name);\n\n                    // Connectors\n                    node.in_connectors.forEach((c, i) => {\n                        func('connectors', {\n                            sdfg: sdfg_name, state: state_id, node: node_id,\n                            connector: i, conntype: \"in\", graph: ng\n                        }, c, c.intersect(x, y, w, h));\n                    });\n                    node.out_connectors.forEach((c, i) => {\n                        func('connectors', {\n                            sdfg: sdfg_name, state: state_id, node: node_id,\n                            connector: i, conntype: \"out\", graph: ng\n                        }, c, c.intersect(x, y, w, h));\n                    });\n                });\n\n                // Selected edges\n                ng.edges().forEach(edge_id => {\n                    const edge = ng.edge(edge_id);\n                    func('edges', { sdfg: sdfg_name, state: state_id, id: edge.id, graph: ng }, edge, edge.intersect(x, y, w, h));\n                });\n            });\n\n            // Selected inter-state edges\n            g.edges().forEach(isedge_id => {\n                const isedge = g.edge(isedge_id);\n                func('isedges', { sdfg: sdfg_name, id: isedge.id, graph: g }, isedge, isedge.intersect(x, y, w, h));\n            });\n        }\n\n        // Start with top-level SDFG\n        traverse_recursive(this.graph, this.sdfg.attributes.name);\n    }\n\n    get_nested_memlet_tree(edge) {\n        for (const tree of this.all_memlet_trees)\n            if (tree.has(edge))\n                return tree;\n        return [];\n    }\n\n    find_elements_under_cursor(mouse_pos_x, mouse_pos_y) {\n        // Find all elements under the cursor.\n        const elements = this.elements_in_rect(mouse_pos_x, mouse_pos_y, 0, 0);\n        const clicked_states = elements.states;\n        const clicked_nodes = elements.nodes;\n        const clicked_edges = elements.edges;\n        const clicked_interstate_edges = elements.isedges;\n        const clicked_connectors = elements.connectors;\n        const total_elements =\n            clicked_states.length + clicked_nodes.length +\n            clicked_edges.length + clicked_interstate_edges.length +\n            clicked_connectors.length;\n        let foreground_elem = null, foreground_surface = -1;\n\n        // Find the top-most element under the mouse cursor (i.e. the one with\n        // the smallest dimensions).\n        const categories = [\n            clicked_states,\n            clicked_interstate_edges,\n            clicked_nodes,\n            clicked_edges\n        ];\n        for (const category of categories) {\n            for (let i = 0; i < category.length; i++) {\n                const s = category[i].obj.width * category[i].obj.height;\n                if (foreground_surface < 0 || s < foreground_surface) {\n                    foreground_surface = s;\n                    foreground_elem = category[i].obj;\n                }\n            }\n        }\n\n        return {\n            total_elements,\n            elements,\n            foreground_elem,\n        };\n    }\n\n    on_key_event(event) {\n        // Prevent handling of the event if the event is designed for something\n        // other than the body, like an input element.\n        if (event.target !== document.body)\n            return;\n\n        if (this.ctrl_key_selection && !event.ctrlKey)\n            this.selectmode_btn.onclick(event, false);\n\n        if (this.shift_key_movement && !event.shiftKey)\n            this.movemode_btn.onclick(event, false);\n\n        if (this.mouse_mode !== 'pan') {\n            if (event.key === 'Escape' && !event.ctrlKey && !event.shiftKey)\n                this.panmode_btn.onclick();\n            return;\n        } else if (event.key === 'Escape') {\n            if (this.selected_elements.length > 0) {\n                this.selected_elements.forEach(el => {\n                    el.selected = false;\n                });\n                this.selected_elements = [];\n                this.draw_async();\n            }\n        } else if (event.key === 'Delete' && event.type === 'keyup') {\n            if (this.selected_elements.length > 0)\n                this.remove_graph_nodes(this.selected_elements);\n            this.selected_elements = [];\n        }\n\n        if (event.ctrlKey && !event.shiftKey)\n            this.selectmode_btn.onclick(event, true);\n\n        if (event.shiftKey && !event.ctrlKey)\n            this.movemode_btn.onclick(event, true);\n\n        return true;\n    }\n\n    on_mouse_event(event, comp_x_func, comp_y_func, evtype = \"other\") {\n        if (this.ctrl_key_selection || this.shift_key_movement)\n            this.on_key_event(event);\n\n        let dirty = false; // Whether to redraw at the end\n        // Whether the set of visible or selected elements changed\n        let element_focus_changed = false;\n        // Whether the current multi-selection changed\n        let multi_selection_changed = false;\n\n        if (evtype === \"mousedown\" || evtype === \"touchstart\") {\n            this.drag_start = event;\n        } else if (evtype === \"mouseup\") {\n            this.drag_start = null;\n            this.last_dragged_element = null;\n        } else if (evtype === \"touchend\") {\n            if (event.touches.length == 0)\n                this.drag_start = null;\n            else\n                this.drag_start = event;\n        } else if (evtype === \"mousemove\") {\n            // Calculate the change in mouse position in canvas coordinates\n            const old_mousepos = this.mousepos;\n            this.mousepos = { x: comp_x_func(event), y: comp_y_func(event) };\n            this.realmousepos = { x: event.clientX, y: event.clientY };\n\n            // Only accept the primary mouse button as dragging source\n            if (this.drag_start && event.buttons & 1) {\n                this.dragging = true;\n\n                if (this.mouse_mode === 'move') {\n                    if (this.last_dragged_element) {\n                        this.canvas.style.cursor = 'grabbing';\n                        this.drag_start.cx = comp_x_func(this.drag_start);\n                        this.drag_start.cy = comp_y_func(this.drag_start);\n                        let elements_to_move = [this.last_dragged_element];\n                        if (this.selected_elements.includes(\n                                this.last_dragged_element\n                            ) && this.selected_elements.length > 1) {\n                            elements_to_move = this.selected_elements.filter(\n                                el => {\n                                    // Do not move connectors (individually)\n                                    if (el instanceof Connector)\n                                        return false;\n                                    let list_id = el.sdfg.sdfg_list_id;\n\n                                    // Do not move element individually if it is\n                                    // moved together with a nested SDFG\n                                    let nested_sdfg_parent =\n                                        this.state_parent_list[list_id];\n                                    if (nested_sdfg_parent &&\n                                        this.selected_elements.includes(\n                                            nested_sdfg_parent\n                                        ))\n                                        return false;\n\n                                    // Do not move element individually if it is\n                                    // moved together with its parent state\n                                    let state_parent =\n                                        this.sdfg_list[list_id].node(\n                                            el.parent_id\n                                        );\n                                    if (state_parent &&\n                                        this.selected_elements.includes(\n                                            state_parent\n                                        ))\n                                        return false;\n\n                                    // Otherwise move individually\n                                    return true;\n                                }\n                            );\n                        }\n\n                        let move_entire_edge = elements_to_move.length > 1;\n                        for (let el of elements_to_move) {\n                            this.canvas_manager.translate_element(\n                                el,\n                                old_mousepos, this.mousepos,\n                                this.graph, this.sdfg_list,\n                                this.state_parent_list,\n                                this.drag_start,\n                                true,\n                                move_entire_edge\n                            );\n                        }\n\n                        dirty = true;\n                        this.draw_async();\n                        return false;\n                    } else {\n                        const mouse_elements = this.find_elements_under_cursor(\n                            this.mousepos.x, this.mousepos.y\n                        );\n                        if (mouse_elements.foreground_elem) {\n                            this.last_dragged_element =\n                                mouse_elements.foreground_elem;\n                            this.canvas.style.cursor = 'grabbing';\n                            return false;\n                        }\n                        return true;\n                    }\n                } else if (this.mouse_mode === 'select') {\n                    this.box_select_rect = {\n                        x_start: comp_x_func(this.drag_start),\n                        y_start: comp_y_func(this.drag_start),\n                        x_end: this.mousepos.x,\n                        y_end: this.mousepos.y,\n                    };\n\n                    // Mark for redraw\n                    dirty = true;\n                } else {\n                    this.canvas_manager.translate(event.movementX,\n                        event.movementY);\n\n                    // Mark for redraw\n                    dirty = true;\n                }\n            } else if (this.drag_start && event.buttons & 4) {\n                // Pan the view with the middle mouse button\n                this.dragging = true;\n                this.canvas_manager.translate(event.movementX, event.movementY);\n                dirty = true;\n                element_focus_changed = true;\n            } else {\n                this.drag_start = null;\n                this.last_dragged_element = null;\n                if (event.buttons & 1 || event.buttons & 4)\n                    return true; // Don't stop propagation\n            }\n        } else if (evtype === \"touchmove\") {\n            if (this.drag_start.touches.length != event.touches.length) {\n                // Different number of touches, ignore and reset drag_start\n                this.drag_start = event;\n            } else if (event.touches.length == 1) { // Move/drag\n                this.canvas_manager.translate(event.touches[0].clientX - this.drag_start.touches[0].clientX,\n                    event.touches[0].clientY - this.drag_start.touches[0].clientY);\n                this.drag_start = event;\n\n                // Mark for redraw\n                dirty = true;\n                this.draw_async();\n                return false;\n            } else if (event.touches.length == 2) {\n                // Find relative distance between two touches before and after.\n                // Then, center and zoom to their midpoint.\n                const touch1 = this.drag_start.touches[0];\n                const touch2 = this.drag_start.touches[1];\n                let x1 = touch1.clientX, x2 = touch2.clientX;\n                let y1 = touch1.clientY, y2 = touch2.clientY;\n                const oldCenter = [(x1 + x2) / 2.0, (y1 + y2) / 2.0];\n                const initialDistance = Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);\n                x1 = event.touches[0].clientX; x2 = event.touches[1].clientX;\n                y1 = event.touches[0].clientY; y2 = event.touches[1].clientY;\n                const currentDistance = Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);\n                const newCenter = [(x1 + x2) / 2.0, (y1 + y2) / 2.0];\n\n                // First, translate according to movement of center point\n                this.canvas_manager.translate(newCenter[0] - oldCenter[0],\n                    newCenter[1] - oldCenter[1]);\n                // Then scale\n                this.canvas_manager.scale(currentDistance / initialDistance,\n                    newCenter[0], newCenter[1]);\n\n                this.drag_start = event;\n\n                // Mark for redraw\n                dirty = true;\n                this.draw_async();\n                return false;\n            }\n        } else if (evtype === \"wheel\") {\n            // Get physical x,y coordinates (rather than canvas coordinates)\n            const br = this.canvas.getBoundingClientRect();\n            const x = event.clientX - br.x;\n            const y = event.clientY - br.y;\n            this.canvas_manager.scale(event.deltaY > 0 ? 0.9 : 1.1, x, y);\n            dirty = true;\n            element_focus_changed = true;\n        }\n        // End of mouse-move/touch-based events\n\n        if (!this.mousepos)\n            return true;\n\n        // Find elements under cursor\n        const elements_under_cursor = this.find_elements_under_cursor(\n            this.mousepos.x, this.mousepos.y\n        );\n        const elements = elements_under_cursor.elements;\n        const total_elements = elements_under_cursor.total_elements;\n        const foreground_elem = elements_under_cursor.foreground_elem;\n\n        if (this.mouse_mode == 'add') {\n            let el = this.mouse_follow_element;\n            if (check_valid_add_position(\n                this.add_type, foreground_elem, this.add_mode_lib, this.mousepos\n            ))\n                el.firstElementChild.setAttribute('stroke', 'green');\n            else\n                el.firstElementChild.setAttribute('stroke', 'red');\n\n            el.style.left =\n                (event.layerX - el.firstElementChild.clientWidth / 2) + 'px';\n            el.style.top =\n                (event.layerY - el.firstElementChild.clientHeight / 2) + 'px';\n        }\n\n        // Change mouse cursor accordingly\n        if (this.mouse_mode === 'select') {\n            this.canvas.style.cursor = 'crosshair';\n        } else if (total_elements > 0) {\n            if (this.mouse_mode === 'move' && this.drag_start) {\n                this.canvas.style.cursor = 'grabbing';\n            } else if (this.mouse_mode === 'move') {\n                this.canvas.style.cursor = 'grab';\n            } else {\n                // Hovering over an element while not in any specific mode.\n                if ((foreground_elem.data.state &&\n                     foreground_elem.data.state.attributes.is_collapsed) ||\n                    (foreground_elem.data.node &&\n                     foreground_elem.data.node.attributes.is_collapsed)) {\n                    // This is a collapsed node or state, show with the cursor\n                    // shape that this can be expanded.\n                    this.canvas.style.cursor = 'alias';\n                } else {\n                    this.canvas.style.cursor = 'pointer';\n                }\n            }\n        } else {\n            this.canvas.style.cursor = 'auto';\n        }\n\n        this.tooltip = null;\n        this.last_hovered_elements = elements;\n\n        // De-highlight all elements.\n        this.for_all_elements(this.mousepos.x, this.mousepos.y, 0, 0, (type, e, obj, intersected) => {\n            obj.hovered = false;\n            obj.highlighted = false;\n        });\n        // Mark hovered and highlighted elements.\n        this.for_all_elements(this.mousepos.x, this.mousepos.y, 0, 0, (type, e, obj, intersected) => {\n            // Highlight all edges of the memlet tree\n            if (intersected && obj instanceof Edge && obj.parent_id != null) {\n                const tree = this.get_nested_memlet_tree(obj);\n                tree.forEach(te => {\n                    if (te != obj && te !== undefined) {\n                        te.highlighted = true;\n                    }\n                });\n            }\n\n            // Highlight all access nodes with the same name in the same nested sdfg\n            if (intersected && obj instanceof AccessNode) {\n                traverse_sdfg_scopes(this.sdfg_list[obj.sdfg.sdfg_list_id], (node) => {\n                    // If node is a state, then visit sub-scope\n                    if (node instanceof State) {\n                        return true;\n                    }\n                    if (node instanceof AccessNode && node.data.node.label === obj.data.node.label) {\n                        node.highlighted = true;\n                    }\n                    // No need to visit sub-scope\n                    return false;\n                });\n            }\n\n            // Highlight all access nodes with the same name as the hovered connector in the nested sdfg\n            if (intersected && obj instanceof Connector) {\n                const nested_graph = e.graph.node(obj.parent_id).data.graph;\n                if (nested_graph) {\n                    traverse_sdfg_scopes(nested_graph, (node) => {\n                        // If node is a state, then visit sub-scope\n                        if (node instanceof State) {\n                            return true;\n                        }\n                        if (node instanceof AccessNode && node.data.node.label === obj.label()) {\n                            node.highlighted = true;\n                        }\n                        // No need to visit sub-scope\n                        return false;\n                    });\n                }\n            }\n\n            if (intersected)\n                obj.hovered = true;\n        });\n\n        // If adding an edge, mark/highlight the first/from element, if it has\n        // already been selected.\n        if (this.mouse_mode === 'add' && this.add_type === 'Edge' &&\n            this.add_edge_start) {\n            this.add_edge_start.highlighted = true;\n        }\n\n        if (evtype === \"mousemove\") {\n            // TODO: Draw only if elements have changed\n            dirty = true;\n        }\n\n        if (evtype === \"dblclick\") {\n            const sdfg = (foreground_elem ? foreground_elem.sdfg : null);\n            let sdfg_elem = null;\n            if (foreground_elem instanceof State)\n                sdfg_elem = foreground_elem.data.state;\n            else if (foreground_elem instanceof SDFGNode) {\n                sdfg_elem = foreground_elem.data.node;\n\n                // If a scope exit node, use entry instead\n                if (sdfg_elem.type.endsWith(\"Exit\"))\n                    sdfg_elem = sdfg.nodes[foreground_elem.parent_id].nodes[sdfg_elem.scope_entry];\n            } else\n                sdfg_elem = null;\n\n            // Toggle collapsed state\n            if (sdfg_elem && 'is_collapsed' in sdfg_elem.attributes) {\n                sdfg_elem.attributes.is_collapsed = !sdfg_elem.attributes.is_collapsed;\n\n                this.send_new_sdfg_to_vscode();\n\n                // Re-layout SDFG\n                this.relayout();\n                dirty = true;\n                element_focus_changed = true;\n            }\n        }\n\n        let ends_drag = false;\n        if (evtype === 'click') {\n            if (this.dragging) {\n                // This click ends a drag.\n                this.dragging = false;\n                ends_drag = true;\n\n                element_focus_changed = true;\n\n                if (this.box_select_rect) {\n                    let elements_in_selection = [];\n                    let start_x = Math.min(this.box_select_rect.x_start,\n                        this.box_select_rect.x_end);\n                    let end_x = Math.max(this.box_select_rect.x_start,\n                        this.box_select_rect.x_end);\n                    let start_y = Math.min(this.box_select_rect.y_start,\n                        this.box_select_rect.y_end);\n                    let end_y = Math.max(this.box_select_rect.y_start,\n                        this.box_select_rect.y_end);\n                    let w = end_x - start_x;\n                    let h = end_y - start_y;\n                    this.do_for_intersected_elements(start_x, start_y, w, h,\n                        (type, e, obj) => {\n                            if (obj.contained_in(start_x, start_y, w, h))\n                                elements_in_selection.push(obj);\n                        });\n                    if (event.shiftKey && !this.ctrl_key_selection) {\n                        elements_in_selection.forEach((el) => {\n                            if (!this.selected_elements.includes(el))\n                                this.selected_elements.push(el);\n                        });\n                    } else if (event.ctrlKey && !this.ctrl_key_selection) {\n                        elements_in_selection.forEach((el) => {\n                            if (this.selected_elements.includes(el)) {\n                                this.selected_elements =\n                                    this.selected_elements.filter((val) => {\n                                        val.selected = false;\n                                        return val !== el;\n                                    });\n                            }\n                        });\n                    } else {\n                        this.selected_elements.forEach((el) => {\n                            el.selected = false;\n                        });\n                        this.selected_elements = elements_in_selection;\n                    }\n                    this.box_select_rect = null;\n                    dirty = true;\n                    element_focus_changed = true;\n                    multi_selection_changed = true;\n                }\n\n                if (this.mouse_mode === 'move')\n                    this.send_new_sdfg_to_vscode();\n            } else {\n                if (this.mouse_mode === 'add') {\n                    if (check_valid_add_position(\n                        this.add_type, foreground_elem, this.add_mode_lib,\n                        this.mousepos\n                    )) {\n                        if (this.add_type === 'Edge') {\n                            if (this.add_edge_start) {\n                                let start = this.add_edge_start;\n                                this.add_edge_start = undefined;\n                                this.add_node_to_graph(\n                                    this.add_type,\n                                    get_uuid_graph_element(foreground_elem),\n                                    get_uuid_graph_element(start)\n                                );\n                            } else {\n                                this.add_edge_start = foreground_elem;\n                                this.update_toggle_buttons();\n                            }\n                        } else if (this.add_type === 'LibraryNode') {\n                            this.add_position = this.mousepos;\n\n                            this.add_node_to_graph(\n                                this.add_type + '|' + this.add_mode_lib,\n                                get_uuid_graph_element(foreground_elem)\n                            );\n                        } else {\n                            this.add_position = this.mousepos;\n\n                            this.add_node_to_graph(\n                                this.add_type,\n                                get_uuid_graph_element(foreground_elem)\n                            );\n                        }\n\n                        if (!event.ctrlKey && !(this.add_type === 'Edge' &&\n                                                this.add_edge_start)) {\n                            // Cancel add mode.\n                            this.panmode_btn.onclick();\n                        }\n                    }\n                }\n\n                if (foreground_elem) {\n                    if (event.ctrlKey) {\n                        // Ctrl + click on an object, add it, or remove it from\n                        // the selection if it was previously in it.\n                        if (this.selected_elements.includes(foreground_elem)) {\n                            foreground_elem.selected = false;\n                            this.selected_elements =\n                                this.selected_elements.filter((el) => {\n                                    return el !== foreground_elem;\n                                });\n                        } else {\n                            this.selected_elements.push(foreground_elem);\n                        }\n\n                        // Indicate that the multi-selection changed.\n                        multi_selection_changed = true;\n                    } else if (event.shiftKey) {\n                        // TODO: Implement shift-clicks for path selection.\n                    } else {\n                        // Clicked an element, select it and nothing else.\n\n                        // If there was a multi-selection prior to this,\n                        // indicate that it changed.\n                        if (this.selected_elements.length > 1)\n                            multi_selection_changed = true;\n\n                        this.selected_elements.forEach((el) => {\n                            el.selected = false;\n                        });\n                        this.selected_elements = [foreground_elem];\n                    }\n                } else {\n                    // Clicked nothing, clear the selection.\n\n                    // If there was a multi-selection prior to this, indicate\n                    // that it changed.\n                    if (this.selected_elements.length > 1)\n                        multi_selection_changed = true;\n\n                    this.selected_elements.forEach((el) => {\n                        el.selected = false;\n                    });\n                    this.selected_elements = [];\n                }\n                dirty = true;\n                element_focus_changed = true;\n            }\n        }\n        this.selected_elements.forEach((el) => {\n            el.selected = true;\n        });\n\n        if (evtype === \"contextmenu\") {\n            if (this.mouse_mode == 'move') {\n                let elements_to_reset = [foreground_elem];\n                if (this.selected_elements.includes(foreground_elem))\n                    elements_to_reset = this.selected_elements;\n\n                let element_moved = false;\n                let relayout_necessary = false;\n                for (let el of elements_to_reset) {\n                    let position = get_positioning_info(el);\n                    if (el && !(el instanceof Connector) && position) {\n                        // Reset the position of the element (if it has been\n                        // manually moved)\n                        if (el instanceof Edge) {\n                            if (!position.points)\n                                continue;\n\n                            // Create inverted points to move it back\n                            let new_points = new Array(el.points.length);\n                            for (let j = 1; j < el.points.length - 1; j++) {\n                                new_points[j] = {\n                                    dx: - position.points[j].dx,\n                                    dy: - position.points[j].dy\n                                };\n                                // Reset the point movement\n                                position.points[j].dx = 0;\n                                position.points[j].dy = 0;\n                            }\n\n                            // Move it to original position\n                            this.canvas_manager.translate_element(\n                                el, { x: 0, y: 0 }, { x: 0, y: 0 }, this.graph,\n                                this.sdfg_list, this.state_parent_list,\n                                undefined, false, false, new_points\n                            );\n\n                            element_moved = true;\n                        } else {\n                            let new_x, new_y;\n                            if (!position.dx && !position.dy)\n                                continue;\n\n                            // Calculate original position with the relative\n                            // movement\n                            new_x = el.x - position.dx;\n                            new_y = el.y - position.dy;\n\n                            position.dx = 0;\n                            position.dy = 0;\n\n                            // Move it to original position\n                            this.canvas_manager.translate_element(\n                                el, { x: el.x, y: el.y },\n                                { x: new_x, y: new_y }, this.graph,\n                                this.sdfg_list, this.state_parent_list,\n                                undefined, false, false, undefined\n                            );\n\n                            element_moved = true;\n                        }\n\n                        if (el instanceof EntryNode) {\n                            // Also update scope position\n                            position.scope_dx = 0;\n                            position.scope_dy = 0;\n\n                            if (!el.data.node.attributes.is_collapsed)\n                                relayout_necessary = true;\n                        }\n                    }\n                }\n\n                if (relayout_necessary)\n                    this.relayout();\n\n                this.draw_async();\n\n                if (element_moved)\n                    this.send_new_sdfg_to_vscode();\n\n            } else if (this.mouse_mode == 'add') {\n                // Cancel add mode\n                this.panmode_btn.onclick();\n            }\n        }\n\n        let mouse_x = comp_x_func(event);\n        let mouse_y = comp_y_func(event);\n        if (this.external_mouse_handler)\n            dirty |= this.external_mouse_handler(evtype, event, { x: mouse_x, y: mouse_y }, elements,\n                this, this.selected_elements, ends_drag);\n\n        if (this.overlay_manager !== null) {\n            dirty |= this.overlay_manager.on_mouse_event(\n                evtype,\n                event,\n                { x: mouse_x, y: mouse_y },\n                elements,\n                foreground_elem,\n                ends_drag\n            );\n        }\n\n        if (dirty) {\n            this.draw_async();\n        }\n\n        if (element_focus_changed) {\n            // If a listener in VSCode is present, update it about the new\n            // viewport and tell it to re-sort the shown transformations.\n            try {\n                if (vscode)\n                    vscode_handle_event(\n                        'on_renderer_selection_changed',\n                        {\n                            multi_selection_changed: multi_selection_changed,\n                        }\n                    );\n            } catch (ex) {\n                // Do nothing\n            }\n        }\n\n        return false;\n    }\n}\n\n\nfunction calculateNodeSize(sdfg_state, node, ctx) {\n    const labelsize = ctx.measureText(node.label).width;\n    const inconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.in_connectors).length - LINEHEIGHT;\n    const outconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.out_connectors).length - LINEHEIGHT;\n    const maxwidth = Math.max(labelsize, inconnsize, outconnsize);\n    let maxheight = 2 * LINEHEIGHT;\n    maxheight += 4 * LINEHEIGHT;\n\n    const size = { width: maxwidth, height: maxheight }\n\n    // add something to the size based on the shape of the node\n    if (node.type === \"AccessNode\") {\n        size.height -= 4 * LINEHEIGHT;\n        size.width += size.height;\n    }\n    else if (node.type.endsWith(\"Entry\")) {\n        size.width += 2.0 * size.height;\n        size.height /= 1.75;\n    }\n    else if (node.type.endsWith(\"Exit\")) {\n        size.width += 2.0 * size.height;\n        size.height /= 1.75;\n    }\n    else if (node.type === \"Tasklet\") {\n        size.width += 2.0 * (size.height / 3.0);\n        size.height /= 1.75;\n    }\n    else if (node.type === \"LibraryNode\") {\n        size.width += 2.0 * (size.height / 3.0);\n        size.height /= 1.75;\n    }\n    else if (node.type === \"Reduce\") {\n        size.height -= 4 * LINEHEIGHT;\n        size.width *= 2;\n        size.height = size.width / 3.0;\n    }\n    else {\n    }\n\n    return size;\n}\n\n// Layout SDFG elements (states, nodes, scopes, nested SDFGs)\nfunction relayout_sdfg(ctx, sdfg, sdfg_list, state_parent_list, omit_access_nodes) {\n    const STATE_MARGIN = 4 * LINEHEIGHT;\n\n    // Layout the SDFG as a dagre graph\n    const g = new dagre.graphlib.Graph();\n    g.setGraph({});\n    g.setDefaultEdgeLabel((u, v) => { return {}; });\n\n    // layout each state to get its size\n    sdfg.nodes.forEach((state) => {\n        let stateinfo = {};\n\n        stateinfo.label = state.id;\n        let state_g = null;\n        if (state.attributes.is_collapsed) {\n            stateinfo.width = ctx.measureText(stateinfo.label).width;\n            stateinfo.height = LINEHEIGHT;\n        }\n        else {\n            state_g = relayout_state(ctx, state, sdfg, sdfg_list,\n                state_parent_list, omit_access_nodes);\n            stateinfo = calculateBoundingBox(state_g);\n        }\n        stateinfo.width += 2 * STATE_MARGIN;\n        stateinfo.height += 2 * STATE_MARGIN;\n        g.setNode(state.id, new State({\n            state: state,\n            layout: stateinfo,\n            graph: state_g\n        }, state.id, sdfg));\n    });\n\n    sdfg.edges.forEach((edge, id) => {\n        g.setEdge(edge.src, edge.dst, new Edge(edge.attributes.data, id, sdfg));\n    });\n\n    dagre.layout(g);\n\n    // Annotate the sdfg with its layout info\n    sdfg.nodes.forEach((state) => {\n        const gnode = g.node(state.id);\n        state.attributes.layout = {};\n        state.attributes.layout.x = gnode.x;\n        state.attributes.layout.y = gnode.y;\n        state.attributes.layout.width = gnode.width;\n        state.attributes.layout.height = gnode.height;\n    });\n\n    sdfg.edges.forEach((edge) => {\n        const gedge = g.edge(edge.src, edge.dst);\n        const bb = calculateEdgeBoundingBox(gedge);\n        // Convert from top-left to center\n        bb.x += bb.width / 2.0;\n        bb.y += bb.height / 2.0;\n\n        gedge.x = bb.x;\n        gedge.y = bb.y;\n        gedge.width = bb.width;\n        gedge.height = bb.height;\n        edge.attributes.layout = {};\n        edge.attributes.layout.width = bb.width;\n        edge.attributes.layout.height = bb.height;\n        edge.attributes.layout.x = bb.x;\n        edge.attributes.layout.y = bb.y;\n        edge.attributes.layout.points = gedge.points;\n    });\n\n    // Offset node and edge locations to be in state margins\n    sdfg.nodes.forEach((s, sid) => {\n        if (s.attributes.is_collapsed)\n            return;\n\n        const state = g.node(sid);\n        const topleft = state.topleft();\n        offset_state(s, state, {\n            x: topleft.x + STATE_MARGIN,\n            y: topleft.y + STATE_MARGIN\n        });\n    });\n\n    const bb = calculateBoundingBox(g);\n    g.width = bb.width;\n    g.height = bb.height;\n\n    // Add SDFG to global store\n    sdfg_list[sdfg.sdfg_list_id] = g;\n\n    return g;\n}\n\nfunction relayout_state(ctx, sdfg_state, sdfg, sdfg_list, state_parent_list, omit_access_nodes) {\n    // layout the state as a dagre graph\n    const g = new dagre.graphlib.Graph({ multigraph: true });\n\n    // Set layout options and a simpler algorithm for large graphs\n    const layout_options = { ranksep: 30 };\n    if (sdfg_state.nodes.length >= 1000)\n        layout_options.ranker = 'longest-path';\n\n    g.setGraph(layout_options);\n\n\n    // Set an object for the graph label\n    g.setDefaultEdgeLabel((u, v) => { return {}; });\n\n    // Add nodes to the graph. The first argument is the node id. The\n    // second is metadata about the node (label, width, height),\n    // which will be updated by dagre.layout (will add x,y).\n\n    // Process nodes hierarchically\n    let toplevel_nodes = sdfg_state.scope_dict[-1];\n    if (toplevel_nodes === undefined)\n        toplevel_nodes = Object.keys(sdfg_state.nodes);\n    const drawn_nodes = new Set();\n    const hidden_nodes = new Map();\n\n    function layout_node(node) {\n        if (omit_access_nodes && node.type == \"AccessNode\") {\n            // add access node to hidden nodes; source and destinations will be set later\n            hidden_nodes.set(node.id.toString(), { node: node, src: null, dsts: [] });\n            return;\n        }\n\n        let nested_g = null;\n        node.attributes.layout = {};\n\n        // Set connectors prior to computing node size\n        node.attributes.layout.in_connectors = node.attributes.in_connectors;\n        if ('is_collapsed' in node.attributes && node.attributes.is_collapsed && node.type !== \"NestedSDFG\")\n            node.attributes.layout.out_connectors = find_exit_for_entry(sdfg_state.nodes, node).attributes.out_connectors;\n        else\n            node.attributes.layout.out_connectors = node.attributes.out_connectors;\n\n        const nodesize = calculateNodeSize(sdfg_state, node, ctx);\n        node.attributes.layout.width = nodesize.width;\n        node.attributes.layout.height = nodesize.height;\n        node.attributes.layout.label = node.label;\n\n        // Recursively lay out nested SDFGs\n        if (node.type === \"NestedSDFG\") {\n            nested_g = relayout_sdfg(ctx, node.attributes.sdfg, sdfg_list, state_parent_list, omit_access_nodes);\n            const sdfginfo = calculateBoundingBox(nested_g);\n            node.attributes.layout.width = sdfginfo.width + 2 * LINEHEIGHT;\n            node.attributes.layout.height = sdfginfo.height + 2 * LINEHEIGHT;\n        }\n\n        // Dynamically create node type\n        const obj = new SDFGElements[node.type]({ node: node, graph: nested_g }, node.id, sdfg, sdfg_state.id);\n\n        // If it's a nested SDFG, we need to record the node as all of its\n        // state's parent node\n        if (node.type === 'NestedSDFG')\n            state_parent_list[node.attributes.sdfg.sdfg_list_id] = obj;\n\n        // Add input connectors\n        let i = 0;\n        let conns;\n        if (Array.isArray(node.attributes.layout.in_connectors))\n            conns = node.attributes.layout.in_connectors;\n        else\n            conns = Object.keys(node.attributes.layout.in_connectors);\n        for (const cname of conns) {\n            const conn = new Connector({ name: cname }, i, sdfg, node.id);\n            obj.in_connectors.push(conn);\n            i += 1;\n        }\n\n        // Add output connectors -- if collapsed, uses exit node connectors\n        i = 0;\n        if (Array.isArray(node.attributes.layout.out_connectors))\n            conns = node.attributes.layout.out_connectors;\n        else\n            conns = Object.keys(node.attributes.layout.out_connectors);\n        for (const cname of conns) {\n            const conn = new Connector({ name: cname }, i, sdfg, node.id);\n            obj.out_connectors.push(conn);\n            i += 1;\n        }\n\n        g.setNode(node.id, obj);\n        drawn_nodes.add(node.id.toString());\n\n        // Recursively draw nodes\n        if (node.id in sdfg_state.scope_dict) {\n            if (node.attributes.is_collapsed)\n                return;\n            sdfg_state.scope_dict[node.id].forEach((nodeid) => {\n                const node = sdfg_state.nodes[nodeid];\n                layout_node(node);\n            });\n        }\n    }\n\n\n    toplevel_nodes.forEach((nodeid) => {\n        const node = sdfg_state.nodes[nodeid];\n        layout_node(node);\n    });\n\n    // add info to calculate shortcut edges\n    function add_edge_info_if_hidden(edge) {\n        const hidden_src = hidden_nodes.get(edge.src);\n        const hidden_dst = hidden_nodes.get(edge.dst);\n\n        if (hidden_src && hidden_dst) {\n            // if we have edges from an AccessNode to an AccessNode then just connect destinations\n            hidden_src.dsts = hidden_dst.dsts;\n            edge.attributes.data.attributes.shortcut = false;\n        } else if (hidden_src) {\n            // if edge starts at hidden node, then add it as destination\n            hidden_src.dsts.push(edge);\n            edge.attributes.data.attributes.shortcut = false;\n            return true;\n        } else if (hidden_dst) {\n            // if edge ends at hidden node, then add it as source\n            hidden_dst.src = edge;\n            edge.attributes.data.attributes.shortcut = false;\n            return true;\n        }\n\n        // if it is a shortcut edge, but we don't omit access nodes, then ignore this edge\n        if (!omit_access_nodes && edge.attributes.data.attributes.shortcut) return true;\n\n        return false;\n    }\n\n    sdfg_state.edges.forEach((edge, id) => {\n        if (add_edge_info_if_hidden(edge)) return;\n        edge = check_and_redirect_edge(edge, drawn_nodes, sdfg_state);\n        if (!edge) return;\n        const e = new Edge(edge.attributes.data, id, sdfg, sdfg_state.id);\n        edge.attributes.data.edge = e;\n        e.src_connector = edge.src_connector;\n        e.dst_connector = edge.dst_connector;\n        g.setEdge(edge.src, edge.dst, e, id);\n    });\n\n    hidden_nodes.forEach(hidden_node => {\n        if (hidden_node.src) {\n            hidden_node.dsts.forEach(e => {\n                // create shortcut edge with new destination\n                const tmp_edge = e.attributes.data.edge;\n                e.attributes.data.edge = null;\n                const shortcut_e = deepCopy(e);\n                e.attributes.data.edge = tmp_edge;\n                shortcut_e.src = hidden_node.src.src;\n                shortcut_e.src_connector = hidden_node.src.src_connector;\n                shortcut_e.dst_connector = e.dst_connector;\n                // attribute that only shortcut edges have; if it is explicitly false, then edge is ignored in omit access node mode\n                shortcut_e.attributes.data.attributes.shortcut = true;\n\n                // draw the redirected edge\n                const redirected_e = check_and_redirect_edge(shortcut_e, drawn_nodes, sdfg_state);\n                if (!redirected_e) return;\n\n                // abort if shortcut edge already exists\n                const edges = g.outEdges(redirected_e.src);\n                for (const oe of edges) {\n                    if (oe.w == e.dst && sdfg_state.edges[oe.name].dst_connector == e.dst_connector) {\n                        return;\n                    }\n                }\n\n                // add shortcut edge (redirection is not done in this list)\n                sdfg_state.edges.push(shortcut_e);\n\n                // add redirected shortcut edge to graph\n                const edge_id = sdfg_state.edges.length - 1;\n                const shortcut_edge = new Edge(deepCopy(redirected_e.attributes.data), edge_id, sdfg, sdfg_state.id);\n                shortcut_edge.src_connector = redirected_e.src_connector;\n                shortcut_edge.dst_connector = redirected_e.dst_connector;\n                shortcut_edge.data.attributes.shortcut = true;\n\n                g.setEdge(redirected_e.src, redirected_e.dst, shortcut_edge, edge_id);\n            });\n        }\n    });\n\n    dagre.layout(g);\n\n\n    // Layout connectors and nested SDFGs\n    sdfg_state.nodes.forEach((node, id) => {\n        const gnode = g.node(id);\n        if (!gnode || (omit_access_nodes && gnode instanceof AccessNode)) {\n            // ignore nodes that should not be drawn\n            return;\n        }\n        const topleft = gnode.topleft();\n\n        // Offset nested SDFG\n        if (node.type === \"NestedSDFG\") {\n\n            offset_sdfg(node.attributes.sdfg, gnode.data.graph, {\n                x: topleft.x + LINEHEIGHT,\n                y: topleft.y + LINEHEIGHT\n            });\n        }\n        // Connector management \n        const SPACING = LINEHEIGHT;\n        const iconn_length = (LINEHEIGHT + SPACING) * Object.keys(node.attributes.layout.in_connectors).length - SPACING;\n        const oconn_length = (LINEHEIGHT + SPACING) * Object.keys(node.attributes.layout.out_connectors).length - SPACING;\n        let iconn_x = gnode.x - iconn_length / 2.0 + LINEHEIGHT / 2.0;\n        let oconn_x = gnode.x - oconn_length / 2.0 + LINEHEIGHT / 2.0;\n\n        for (const c of gnode.in_connectors) {\n            c.width = LINEHEIGHT;\n            c.height = LINEHEIGHT;\n            c.x = iconn_x;\n            iconn_x += LINEHEIGHT + SPACING;\n            c.y = topleft.y;\n        }\n        for (const c of gnode.out_connectors) {\n            c.width = LINEHEIGHT;\n            c.height = LINEHEIGHT;\n            c.x = oconn_x;\n            oconn_x += LINEHEIGHT + SPACING;\n            c.y = topleft.y + gnode.height;\n        }\n    });\n\n    sdfg_state.edges.forEach((edge, id) => {\n        edge = check_and_redirect_edge(edge, drawn_nodes, sdfg_state);\n        if (!edge) return;\n        const gedge = g.edge(edge.src, edge.dst, id);\n        if (!gedge || (omit_access_nodes && gedge.data.attributes.shortcut === false\n            || !omit_access_nodes && gedge.data.attributes.shortcut)) {\n            // if access nodes omitted, don't draw non-shortcut edges and vice versa\n            return;\n        }\n\n        // Reposition first and last points according to connectors\n        let src_conn = null, dst_conn = null;\n        if (edge.src_connector) {\n            const src_node = g.node(edge.src);\n            let cindex = -1;\n            for (let i = 0; i < src_node.out_connectors.length; i++) {\n                if (src_node.out_connectors[i].data.name == edge.src_connector) {\n                    cindex = i;\n                    break;\n                }\n            }\n            if (cindex >= 0) {\n                gedge.points[0].x = src_node.out_connectors[cindex].x;\n                gedge.points[0].y = src_node.out_connectors[cindex].y;\n                src_conn = src_node.out_connectors[cindex];\n            }\n        }\n        if (edge.dst_connector) {\n            const dst_node = g.node(edge.dst);\n            let cindex = -1;\n            for (let i = 0; i < dst_node.in_connectors.length; i++) {\n                if (dst_node.in_connectors[i].data.name == edge.dst_connector) {\n                    cindex = i;\n                    break;\n                }\n            }\n            if (cindex >= 0) {\n                gedge.points[gedge.points.length - 1].x = dst_node.in_connectors[cindex].x;\n                gedge.points[gedge.points.length - 1].y = dst_node.in_connectors[cindex].y;\n                dst_conn = dst_node.in_connectors[cindex];\n            }\n        }\n\n        const n = gedge.points.length - 1;\n        if (src_conn !== null)\n            gedge.points[0] = intersectRect(src_conn, gedge.points[n]);\n        if (dst_conn !== null)\n            gedge.points[n] = intersectRect(dst_conn, gedge.points[0]);\n\n        if (gedge.points.length == 3 && gedge.points[0].x == gedge.points[n].x)\n            gedge.points = [gedge.points[0], gedge.points[n]];\n\n        const bb = calculateEdgeBoundingBox(gedge);\n        // Convert from top-left to center\n        bb.x += bb.width / 2.0;\n        bb.y += bb.height / 2.0;\n\n        edge.width = bb.width;\n        edge.height = bb.height;\n        edge.x = bb.x;\n        edge.y = bb.y;\n        gedge.width = bb.width;\n        gedge.height = bb.height;\n        gedge.x = bb.x;\n        gedge.y = bb.y;\n    });\n\n    return g;\n}\n\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { sdfg_range_elem_to_string } from '../utils/sdfg/display';\nimport { sdfg_property_to_string } from \"../utils/sdfg/display\";\nimport { check_and_redirect_edge } from \"../utils/sdfg/sdfg_utils\";\n\nexport class SDFGElement {\n    // Parent ID is the state ID, if relevant\n    constructor(elem, elem_id, sdfg, parent_id = null) {\n        this.data = elem;\n        this.id = elem_id;\n        this.parent_id = parent_id;\n        this.sdfg = sdfg;\n        this.in_connectors = [];\n        this.out_connectors = [];\n\n        // Indicate special drawing conditions based on interactions.\n        this.selected = false;\n        this.highlighted = false;\n        this.hovered = false;\n\n        this.set_layout();\n    }\n\n    set_layout() {\n        // dagre does not work well with properties, only fields\n        this.width = this.data.layout.width;\n        this.height = this.data.layout.height;\n    }\n\n    draw(renderer, ctx, mousepos) { }\n\n    shade(renderer, ctx, color, alpha = '0.6') { }\n\n    debug_draw(renderer, ctx) {\n        if (renderer.debug_draw) {\n            // Print the center and bounding box in debug mode.\n            ctx.beginPath();\n            ctx.arc(this.x, this.y, 1, 0, 2 * Math.PI, false);\n            ctx.fillStyle = 'red';\n            ctx.fill();\n            ctx.strokeStyle = 'red';\n            ctx.stroke();\n            ctx.strokeRect(this.x - (this.width / 2.0), this.y - (this.height / 2.0),\n                this.width, this.height);\n        }\n    }\n\n    attributes() {\n        return this.data.attributes;\n    }\n\n    type() {\n        return this.data.type;\n    }\n\n    label() {\n        return this.data.label;\n    }\n\n    long_label() {\n        return this.label();\n    }\n\n    // Produces HTML for a hover-tooltip\n    tooltip(container) {\n        container.className = 'sdfvtooltip';\n    }\n\n    topleft() {\n        return { x: this.x - this.width / 2, y: this.y - this.height / 2 };\n    }\n\n    strokeStyle(renderer = undefined) {\n        if (this.selected) {\n            if (this.hovered)\n                return this.getCssProperty(renderer, '--color-selected-hovered');\n            else if (this.highlighted)\n                return this.getCssProperty(renderer, '--color-selected-highlighted');\n            else\n                return this.getCssProperty(renderer, '--color-selected');\n        } else {\n            if (this.hovered)\n                return this.getCssProperty(renderer, '--color-hovered');\n            else if (this.highlighted)\n                return this.getCssProperty(renderer, '--color-highlighted');\n        }\n        return this.getCssProperty(renderer, '--color-default');\n    }\n\n    // General bounding-box intersection function. Returns true iff point or rectangle intersect element.\n    intersect(x, y, w = 0, h = 0) {\n        if (w == 0 || h == 0) {  // Point-element intersection\n            return (x >= this.x - this.width / 2.0) &&\n                (x <= this.x + this.width / 2.0) &&\n                (y >= this.y - this.height / 2.0) &&\n                (y <= this.y + this.height / 2.0);\n        } else {                 // Box-element intersection\n            return (x <= this.x + this.width / 2.0) &&\n                (x + w >= this.x - this.width / 2.0) &&\n                (y <= this.y + this.height / 2.0) &&\n                (y + h >= this.y - this.height / 2.0);\n        }\n    }\n\n    contained_in(x, y, w = 0, h = 0) {\n        if (w === 0 || h === 0)\n            return false;\n\n        const box_start_x = x;\n        const box_end_x = x + w;\n        const box_start_y = y;\n        const box_end_y = y + h;\n\n        const el_start_x = this.x - (this.width / 2.0);\n        const el_end_x = this.x + (this.width / 2.0);\n        const el_start_y = this.y - (this.height / 2.0);\n        const el_end_y = this.y + (this.height / 2.0);\n\n        return box_start_x <= el_start_x &&\n            box_end_x >= el_end_x &&\n            box_start_y <= el_start_y &&\n            box_end_y >= el_end_y;\n    }\n\n    getCssProperty(renderer, propertyName) {\n        return window.getComputedStyle(renderer.canvas).getPropertyValue(propertyName).trim();\n    }\n}\n\n// SDFG as an element (to support properties)\nexport class SDFG extends SDFGElement {\n    constructor(sdfg) {\n        super(sdfg, -1, sdfg);\n    }\n\n    set_layout() {\n    }\n\n    label() {\n        return this.data.attributes.name;\n    }\n}\n\nexport class State extends SDFGElement {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        const visible_rect = renderer.visible_rect;\n        let clamped = {\n            x: Math.max(topleft.x, visible_rect.x),\n            y: Math.max(topleft.y, visible_rect.y),\n            x2: Math.min(topleft.x + this.width,\n                visible_rect.x + visible_rect.w),\n            y2: Math.min(topleft.y + this.height,\n                visible_rect.y + visible_rect.h)\n        };\n        clamped.w = clamped.x2 - clamped.x;\n        clamped.h = clamped.y2 - clamped.y;\n        if (!ctx.lod)\n            clamped = {\n                x: topleft.x, y: topleft.y,\n                w: this.width, h: this.height\n            };\n\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-background-color');\n        ctx.fillRect(clamped.x, clamped.y, clamped.w, clamped.h);\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-foreground-color');\n\n        if (visible_rect.x <= topleft.x && visible_rect.y <= topleft.y + LINEHEIGHT)\n            ctx.fillText(this.label(), topleft.x, topleft.y + LINEHEIGHT);\n\n        // If this state is selected or hovered\n        if ((this.selected || this.highlighted || this.hovered) &&\n            (clamped.x === topleft.x ||\n                clamped.y === topleft.y ||\n                clamped.x2 === topleft.x + this.width ||\n                clamped.y2 === topleft.y + this.height)) {\n            ctx.strokeStyle = this.strokeStyle(renderer);\n            ctx.strokeRect(clamped.x, clamped.y, clamped.w, clamped.h);\n        }\n\n        // If collapsed, draw a \"+\" sign in the middle\n        if (this.data.state.attributes.is_collapsed) {\n            ctx.beginPath();\n            ctx.moveTo(this.x, this.y - LINEHEIGHT);\n            ctx.lineTo(this.x, this.y + LINEHEIGHT);\n            ctx.stroke();\n            ctx.beginPath();\n            ctx.moveTo(this.x - LINEHEIGHT, this.y);\n            ctx.lineTo(this.x + LINEHEIGHT, this.y);\n            ctx.stroke();\n        }\n\n        ctx.strokeStyle = \"black\";\n    }\n\n    simple_draw(renderer, ctx, mousepos) {\n        // Fast drawing function for small states\n        const topleft = this.topleft();\n\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-background-color');\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-text-color');\n\n        if (mousepos && this.intersect(mousepos.x, mousepos.y))\n            renderer.tooltip = (c) => this.tooltip(c);\n        // Draw state name in center without contents (does not look good)\n        /*\n        let FONTSIZE = Math.min(renderer.canvas_manager.points_per_pixel() * 16, 100);\n        let label = this.label();\n\n        let oldfont = ctx.font;\n        ctx.font = FONTSIZE + \"px Arial\";\n\n        let textmetrics = ctx.measureText(label);\n        ctx.fillText(label, this.x - textmetrics.width / 2.0, this.y - this.height / 6.0 + FONTSIZE / 2.0);\n\n        ctx.font = oldfont;\n        */\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    tooltip(container) {\n        container.innerText = 'State: ' + this.label();\n    }\n\n    attributes() {\n        return this.data.state.attributes;\n    }\n\n    label() {\n        return this.data.state.label;\n    }\n\n    type() {\n        return this.data.state.type;\n    }\n}\n\nexport class SDFGNode extends SDFGElement {\n    draw(renderer, ctx, mousepos, fgstyle = '--node-foreground-color', bgstyle = '--node-background-color') {\n        const topleft = this.topleft();\n        ctx.fillStyle = this.getCssProperty(renderer, bgstyle);\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        ctx.strokeRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.fillStyle = this.getCssProperty(renderer, fgstyle);\n        const textw = ctx.measureText(this.label()).width;\n        ctx.fillText(this.label(), this.x - textw / 2, this.y + LINEHEIGHT / 4);\n    }\n\n    simple_draw(renderer, ctx, mousepos) {\n        // Fast drawing function for small nodes\n        const topleft = this.topleft();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    label() {\n        return this.data.node.label;\n    }\n\n    attributes() {\n        return this.data.node.attributes;\n    }\n\n    type() {\n        return this.data.node.type;\n    }\n\n    set_layout() {\n        this.width = this.data.node.attributes.layout.width;\n        this.height = this.data.node.attributes.layout.height;\n    }\n}\n\nexport class Edge extends SDFGElement {\n\n    create_arrow_line(ctx) {\n        ctx.beginPath();\n        ctx.moveTo(this.points[0].x, this.points[0].y);\n        if (this.points.length === 2) {\n            // Straight line can be drawn\n            ctx.lineTo(this.points[1].x, this.points[1].y);\n        } else {\n            let i;\n            for (i = 1; i < this.points.length - 2; i++) {\n                const xm = (this.points[i].x + this.points[i + 1].x) / 2.0;\n                const ym = (this.points[i].y + this.points[i + 1].y) / 2.0;\n                ctx.quadraticCurveTo(this.points[i].x, this.points[i].y, xm, ym);\n            }\n            ctx.quadraticCurveTo(this.points[i].x, this.points[i].y,\n                this.points[i + 1].x, this.points[i + 1].y);\n        }\n    }\n\n    draw(renderer, ctx, mousepos) {\n        const edge = this;\n\n        this.create_arrow_line(ctx);\n\n        let style = this.strokeStyle(renderer);\n        if (this.hovered)\n            renderer.tooltip = (c) => this.tooltip(c, renderer);\n        if (this.parent_id == null && style === this.getCssProperty(renderer, '--color-default')) {  // Interstate edge\n            style = this.getCssProperty(renderer, '--interstate-edge-color');\n        }\n        ctx.fillStyle = ctx.strokeStyle = style;\n\n        // CR edges have dashed lines\n        if (this.parent_id != null && this.data.attributes.wcr != null)\n            ctx.setLineDash([2, 2]);\n        else\n            ctx.setLineDash([1, 0]);\n\n        ctx.stroke();\n\n        ctx.setLineDash([1, 0]);\n\n        if (edge.points.length < 2)\n            return;\n\n\n        // Show anchor points for moving\n        if (this.selected && renderer.mouse_mode === 'move') {\n            let i;\n            for (i = 1; i < this.points.length - 1; i++)\n                ctx.strokeRect(this.points[i].x - 5, this.points[i].y - 5, 8, 8);\n        }\n\n        drawArrow(ctx, edge.points[edge.points.length - 2], edge.points[edge.points.length - 1], 3);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        this.create_arrow_line(ctx);\n\n        // Save current style properties.\n        const orig_stroke_style = ctx.strokeStyle;\n        const orig_fill_style = ctx.fillStyle;\n        const orig_line_cap = ctx.lineCap;\n        const orig_line_width = ctx.lineWidth;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.lineWidth = orig_line_width + 1;\n        ctx.fillStyle = color;\n        ctx.strokeStyle = color;\n        ctx.lineCap = 'round';\n\n        ctx.stroke();\n\n        if (this.points.length < 2)\n            return;\n        drawArrow(ctx, this.points[this.points.length - 2],\n            this.points[this.points.length - 1], 3, 0, 2);\n\n        // Restore previous stroke style, width, and opacity.\n        ctx.strokeStyle = orig_stroke_style;\n        ctx.fillStyle = orig_fill_style;\n        ctx.lineCap = orig_line_cap;\n        ctx.lineWidth = orig_line_width;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    tooltip(container, renderer) {\n        super.tooltip(container);\n        const dsettings = renderer.view_settings();\n        const attr = this.attributes();\n        // Memlet\n        if (attr.subset !== undefined) {\n            if (attr.subset === null) {  // Empty memlet\n                container.style.display = 'none';\n                return;\n            }\n            let contents = attr.data;\n            contents += sdfg_property_to_string(attr.subset, dsettings);\n\n            if (attr.other_subset)\n                contents += ' -> ' + sdfg_property_to_string(attr.other_subset, dsettings);\n\n            if (attr.wcr)\n                contents += '<br /><b>CR: ' + sdfg_property_to_string(attr.wcr, dsettings) + '</b>';\n\n            let num_accesses = null;\n            if (attr.volume)\n                num_accesses = sdfg_property_to_string(attr.volume, dsettings);\n            else\n                num_accesses = sdfg_property_to_string(attr.num_accesses, dsettings);\n\n            if (attr.dynamic) {\n                if (num_accesses == 0 || num_accesses == -1)\n                    num_accesses = \"<b>Dynamic (unbounded)</b>\";\n                else\n                    num_accesses = \"<b>Dynamic</b> (up to \" + num_accesses + \")\";\n            } else if (num_accesses == -1) {\n                num_accesses = \"<b>Dynamic (unbounded)</b>\";\n            }\n\n            contents += '<br /><font style=\"font-size: 14px\">Volume: ' + num_accesses + '</font>';\n            container.innerHTML = contents;\n        } else {  // Interstate edge\n            container.classList.add('sdfvtooltip--interstate-edge');\n            container.innerText = this.label();\n            if (!this.label())\n                container.style.display = 'none';\n        }\n    }\n\n    set_layout() {\n        // NOTE: Setting this.width/height will disrupt dagre in self-edges\n    }\n\n    label() {\n        // Memlet\n        if (this.data.attributes.subset !== undefined)\n            return \"\";\n        return super.label();\n    }\n\n    intersect(x, y, w = 0, h = 0) {\n        // First, check bounding box\n        if (!super.intersect(x, y, w, h))\n            return false;\n\n        // Then (if point), check distance from line\n        if (w == 0 || h == 0) {\n            for (let i = 0; i < this.points.length - 1; i++) {\n                const dist = ptLineDistance({ x: x, y: y }, this.points[i], this.points[i + 1]);\n                if (dist <= 5.0)\n                    return true;\n            }\n            return false;\n        }\n        return true;\n    }\n}\n\nexport class Connector extends SDFGElement {\n    draw(renderer, ctx, mousepos) {\n        const scope_connector = (this.data.name.startsWith(\"IN_\") || this.data.name.startsWith(\"OUT_\"));\n        const topleft = this.topleft();\n        ctx.beginPath();\n        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n        ctx.closePath();\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        let fillColor;\n        if (scope_connector) {\n            let cname = this.data.name;\n            if (cname.startsWith(\"IN_\"))\n                cname = cname.substring(3);\n            else\n                cname = cname.substring(4);\n\n            ctx.lineWidth = 0.4;\n            ctx.stroke();\n            ctx.lineWidth = 1.0;\n            fillColor = this.getCssProperty(renderer, '--connector-scoped-color');\n        } else {\n            ctx.stroke();\n            fillColor = this.getCssProperty(renderer, '--connector-unscoped-color');\n        }\n        if (ctx.pdf) // PDFs do not support transparent fill colors\n            fillColor = fillColor.substr(0, 7);\n        ctx.fillStyle = fillColor;\n\n        if (ctx.pdf) { // PDFs do not support stroke and fill on the same object\n            ctx.beginPath();\n            drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n            ctx.closePath();\n        }\n        ctx.fill();\n        if (this.strokeStyle(renderer) !== this.getCssProperty(renderer, '--color-default'))\n            renderer.tooltip = (c) => this.tooltip(c);\n    }\n\n    attributes() {\n        return {};\n    }\n\n    set_layout() { }\n\n    label() { return this.data.name; }\n\n    tooltip(container) {\n        super.tooltip(container);\n        container.classList.add('sdfvtooltip--connector');\n        container.innerText = this.label();\n    }\n}\n\nexport class AccessNode extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        ctx.beginPath();\n        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n        ctx.closePath();\n        ctx.strokeStyle = this.strokeStyle(renderer);\n\n        const nodedesc = this.sdfg.attributes._arrays[this.data.node.attributes.data];\n        // Streams have dashed edges\n        if (nodedesc && nodedesc.type === \"Stream\") {\n            ctx.setLineDash([5, 3]);\n        } else {\n            ctx.setLineDash([1, 0]);\n        }\n\n        // Non-transient (external) data is thicker\n        if (nodedesc && nodedesc.attributes.transient === false) {\n            ctx.lineWidth = 3.0;\n        } else {\n            ctx.lineWidth = 1.0;\n        }\n        ctx.stroke();\n        ctx.lineWidth = 1.0;\n        ctx.setLineDash([1, 0]);\n\n        // Views are colored like connectors\n        if (nodedesc && nodedesc.type === \"View\") {\n            ctx.fillStyle = this.getCssProperty(renderer, '--connector-unscoped-color');\n        } else {\n            ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        }\n\n        if (ctx.pdf) { // PDFs do not support stroke and fill on the same object\n            ctx.beginPath();\n            drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n            ctx.closePath();\n        }\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n        const textmetrics = ctx.measureText(this.label());\n        ctx.fillText(this.label(), this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 4.0);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.beginPath();\n        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n        ctx.closePath();\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\nexport class ScopeNode extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        let draw_shape;\n        if (this.data.node.attributes.is_collapsed) {\n            draw_shape = () => drawHexagon(ctx, this.x, this.y, this.width, this.height);\n        } else {\n            draw_shape = () => drawTrapezoid(ctx, this.topleft(), this, this.scopeend());\n        }\n        ctx.strokeStyle = this.strokeStyle(renderer);\n\n        // Consume scopes have dashed edges\n        if (this.data.node.type.startsWith(\"Consume\"))\n            ctx.setLineDash([5, 3]);\n        else\n            ctx.setLineDash([1, 0]);\n\n        draw_shape();\n        ctx.stroke();\n        ctx.setLineDash([1, 0]);\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n            draw_shape();\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n\n        const far_label = this.far_label();\n        drawAdaptiveText(ctx, renderer, far_label,\n            this.close_label(renderer), this.x, this.y,\n            this.width, this.height,\n            SCOPE_LOD);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        if (this.data.node.attributes.is_collapsed)\n            drawHexagon(ctx, this.x, this.y, this.width, this.height);\n        else\n            drawTrapezoid(ctx, this.topleft(), this, this.scopeend());\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    far_label() {\n        let result = this.attributes().label;\n        if (this.scopeend()) {  // Get label from scope entry\n            const entry = this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];\n            if (entry !== undefined)\n                result = entry.attributes.label;\n            else {\n                result = this.data.node.label;\n                const ind = result.indexOf('[');\n                if (ind > 0)\n                    result = result.substring(0, ind);\n            }\n        }\n        return result;\n    }\n\n    close_label(renderer) {\n        if (!renderer.inclusive_ranges)\n            return this.label();\n\n        let result = this.far_label();\n        let attrs = this.attributes();\n        if (this.scopeend()) {\n            const entry = this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];\n            if (entry !== undefined)\n                attrs = entry.attributes;\n            else\n                return this.label();\n        }\n        result += ' [';\n\n        if (this instanceof ConsumeEntry || this instanceof ConsumeExit) {\n            result += attrs.pe_index + '=' + '0..' + (attrs.num_pes - 1).toString();\n        } else {\n            for (let i = 0; i < attrs.params.length; ++i) {\n                result += attrs.params[i] + '=';\n                result += sdfg_range_elem_to_string(attrs.range.ranges[i], renderer.view_settings()) + ', ';\n            }\n            result = result.substring(0, result.length - 2); // Remove trailing comma\n        }\n        return result + ']';\n    }\n}\n\nexport class EntryNode extends ScopeNode {\n    scopeend() { return false; }\n}\n\nexport class ExitNode extends ScopeNode {\n    scopeend() { return true; }\n}\n\nexport class MapEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([1, 0]); } }\nexport class MapExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([1, 0]); } }\nexport class ConsumeEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([5, 3]); } }\nexport class ConsumeExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([5, 3]); } }\nexport class PipelineEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([10, 3]); } }\nexport class PipelineExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([10, 3]); } }\n\nexport class Tasklet extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        drawOctagon(ctx, topleft, this.width, this.height);\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        ctx.stroke();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n            drawOctagon(ctx, topleft, this.width, this.height);\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n\n        const ppp = renderer.canvas_manager.points_per_pixel();\n        if (!ctx.lod || ppp < TASKLET_LOD) {\n            // If we are close to the tasklet, show its contents\n            const code = this.attributes().code.string_data;\n            const lines = code.split('\\n');\n            let maxline = 0, maxline_len = 0;\n            for (let i = 0; i < lines.length; i++) {\n                if (lines[i].length > maxline_len) {\n                    maxline = i;\n                    maxline_len = lines[i].length;\n                }\n            }\n            const oldfont = ctx.font;\n            ctx.font = \"10px courier new\";\n            const textmetrics = ctx.measureText(lines[maxline]);\n\n            // Fit font size to 80% height and width of tasklet\n            const height = lines.length * LINEHEIGHT * 1.05;\n            const width = textmetrics.width;\n            const TASKLET_WRATIO = 0.9, TASKLET_HRATIO = 0.5;\n            const hr = height / (this.height * TASKLET_HRATIO);\n            const wr = width / (this.width * TASKLET_WRATIO);\n            const FONTSIZE = Math.min(10 / hr, 10 / wr);\n            const text_yoffset = FONTSIZE / 4;\n\n            ctx.font = FONTSIZE + \"px courier new\";\n            // Set the start offset such that the middle row of the text is in this.y\n            const y = this.y + text_yoffset - ((lines.length - 1) / 2) * FONTSIZE * 1.05;\n            for (let i = 0; i < lines.length; i++)\n                ctx.fillText(lines[i], this.x - (this.width * TASKLET_WRATIO) / 2.0,\n                    y + i * FONTSIZE * 1.05);\n\n            ctx.font = oldfont;\n            return;\n        }\n\n        const textmetrics = ctx.measureText(this.label());\n        ctx.fillText(this.label(), this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 2.0);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        drawOctagon(ctx, this.topleft(), this.width, this.height);\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\nexport class Reduce extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        const draw_shape = () => {\n            ctx.beginPath();\n            ctx.moveTo(topleft.x, topleft.y);\n            ctx.lineTo(topleft.x + this.width / 2, topleft.y + this.height);\n            ctx.lineTo(topleft.x + this.width, topleft.y);\n            ctx.lineTo(topleft.x, topleft.y);\n            ctx.closePath();\n        };\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        draw_shape();\n        ctx.stroke();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n            draw_shape();\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n\n        const far_label = this.label().substring(4, this.label().indexOf(','));\n        drawAdaptiveText(ctx, renderer, far_label,\n            this.label(), this.x, this.y - this.height * 0.2,\n            this.width, this.height,\n            SCOPE_LOD);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.beginPath();\n        ctx.moveTo(topleft.x, topleft.y);\n        ctx.lineTo(topleft.x + this.width / 2, topleft.y + this.height);\n        ctx.lineTo(topleft.x + this.width, topleft.y);\n        ctx.lineTo(topleft.x, topleft.y);\n        ctx.closePath();\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\nexport class NestedSDFG extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        if (this.data.node.attributes.is_collapsed) {\n            const topleft = this.topleft();\n            drawOctagon(ctx, topleft, this.width, this.height);\n            ctx.strokeStyle = this.strokeStyle(renderer);\n            ctx.stroke();\n            drawOctagon(ctx, { x: topleft.x + 2.5, y: topleft.y + 2.5 }, this.width - 5, this.height - 5);\n            ctx.strokeStyle = this.strokeStyle(renderer);\n            ctx.stroke();\n            ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n            if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n                drawOctagon(ctx, { x: topleft.x + 2.5, y: topleft.y + 2.5 }, this.width - 5, this.height - 5);\n            ctx.fill();\n            ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n            const label = this.data.node.attributes.label;\n            const textmetrics = ctx.measureText(label);\n            ctx.fillText(label, this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 4.0);\n            return;\n        }\n\n        // Draw square around nested SDFG\n        super.draw(renderer, ctx, mousepos, '--nested-sdfg-foreground-color',\n            '--nested-sdfg-background-color');\n\n        // Draw nested graph\n        draw_sdfg(renderer, ctx, this.data.graph, mousepos);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        if (this.data.node.attributes.is_collapsed) {\n            // Save the current style properties.\n            const orig_fill_style = ctx.fillStyle;\n            const orig_alpha = ctx.globalAlpha;\n\n            ctx.globalAlpha = alpha;\n            ctx.fillStyle = color;\n\n            drawOctagon(ctx, this.topleft(), this.width, this.height);\n            ctx.fill();\n\n            // Restore the previous style properties.\n            ctx.fillStyle = orig_fill_style;\n            ctx.globalAlpha = orig_alpha;\n        } else {\n            super.shade(renderer, ctx, color, alpha);\n        }\n    }\n\n    set_layout() {\n        if (this.data.node.attributes.is_collapsed) {\n            const labelsize = this.data.node.attributes.label.length * LINEHEIGHT * 0.8;\n            const inconnsize = 2 * LINEHEIGHT * Object.keys(this.data.node.attributes.in_connectors).length - LINEHEIGHT;\n            const outconnsize = 2 * LINEHEIGHT * Object.keys(this.data.node.attributes.out_connectors).length - LINEHEIGHT;\n            const maxwidth = Math.max(labelsize, inconnsize, outconnsize);\n            let maxheight = 2 * LINEHEIGHT;\n            maxheight += 4 * LINEHEIGHT;\n\n            const size = { width: maxwidth, height: maxheight };\n            size.width += 2.0 * (size.height / 3.0);\n            size.height /= 1.75;\n\n            this.width = size.width;\n            this.height = size.height;\n        } else {\n            this.width = this.data.node.attributes.layout.width;\n            this.height = this.data.node.attributes.layout.height;\n        }\n    }\n\n\n    label() { return \"\"; }\n}\n\nexport class LibraryNode extends SDFGNode {\n    _path(ctx) {\n        const hexseg = this.height / 6.0;\n        const topleft = this.topleft();\n        ctx.beginPath();\n        ctx.moveTo(topleft.x, topleft.y);\n        ctx.lineTo(topleft.x + this.width - hexseg, topleft.y);\n        ctx.lineTo(topleft.x + this.width, topleft.y + hexseg);\n        ctx.lineTo(topleft.x + this.width, topleft.y + this.height);\n        ctx.lineTo(topleft.x, topleft.y + this.height);\n        ctx.closePath();\n    }\n\n    _path2(ctx) {\n        const hexseg = this.height / 6.0;\n        const topleft = this.topleft();\n        ctx.beginPath();\n        ctx.moveTo(topleft.x + this.width - hexseg, topleft.y);\n        ctx.lineTo(topleft.x + this.width - hexseg, topleft.y + hexseg);\n        ctx.lineTo(topleft.x + this.width, topleft.y + hexseg);\n    }\n\n    draw(renderer, ctx, mousepos) {\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        this._path(ctx);\n        ctx.fill();\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        this._path(ctx);\n        ctx.stroke();\n        this._path2(ctx);\n        ctx.stroke();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n        const textw = ctx.measureText(this.label()).width;\n        ctx.fillText(this.label(), this.x - textw / 2, this.y + LINEHEIGHT / 4);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        this._path(ctx);\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\n//////////////////////////////////////////////////////\n\n// Draw an entire SDFG\nexport function draw_sdfg(renderer, ctx, sdfg_dagre, mousepos) {\n    const ppp = renderer.canvas_manager.points_per_pixel();\n\n    // Render state machine\n    const g = sdfg_dagre;\n    if (!ctx.lod || ppp < EDGE_LOD)\n        g.edges().forEach(e => {\n            const edge = g.edge(e);\n            edge.draw(renderer, ctx, mousepos);\n            edge.debug_draw(renderer, ctx);\n        });\n\n\n    const visible_rect = renderer.visible_rect;\n\n    // Render each visible state's contents\n    g.nodes().forEach(v => {\n        const node = g.node(v);\n\n        if (ctx.lod && (ppp >= STATE_LOD || node.width / ppp < STATE_LOD)) {\n            node.simple_draw(renderer, ctx, mousepos);\n            node.debug_draw(renderer, ctx);\n            return;\n        }\n        // Skip invisible states\n        if (ctx.lod && !node.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))\n            return;\n\n        node.draw(renderer, ctx, mousepos);\n        node.debug_draw(renderer, ctx);\n\n        const ng = node.data.graph;\n\n        if (!node.data.state.attributes.is_collapsed && ng) {\n            ng.nodes().forEach(v => {\n                const n = ng.node(v);\n\n                if (ctx.lod && !n.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))\n                    return;\n                if (ctx.lod && ppp >= NODE_LOD) {\n                    n.simple_draw(renderer, ctx, mousepos);\n                    n.debug_draw(renderer, ctx);\n                    return;\n                }\n\n                n.draw(renderer, ctx, mousepos);\n                n.debug_draw(renderer, ctx);\n                n.in_connectors.forEach(c => {\n                    c.draw(renderer, ctx, mousepos);\n                    c.debug_draw(renderer, ctx);\n                });\n                n.out_connectors.forEach(c => {\n                    c.draw(renderer, ctx, mousepos);\n                    c.debug_draw(renderer, ctx);\n                });\n            });\n            if (ctx.lod && ppp >= EDGE_LOD)\n                return;\n            ng.edges().forEach(e => {\n                const edge = ng.edge(e);\n                if (ctx.lod && !edge.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))\n                    return;\n                edge.draw(renderer, ctx, mousepos);\n                edge.debug_draw(renderer, ctx);\n            });\n        }\n    });\n}\n\n// Translate an SDFG by a given offset\nexport function offset_sdfg(sdfg, sdfg_graph, offset) {\n    sdfg.nodes.forEach((state, id) => {\n        const g = sdfg_graph.node(id);\n        g.x += offset.x;\n        g.y += offset.y;\n        if (!state.attributes.is_collapsed)\n            offset_state(state, g, offset);\n    });\n    sdfg.edges.forEach((e, eid) => {\n        const edge = sdfg_graph.edge(e.src, e.dst);\n        edge.x += offset.x;\n        edge.y += offset.y;\n        edge.points.forEach((p) => {\n            p.x += offset.x;\n            p.y += offset.y;\n        });\n    });\n}\n\n// Translate nodes, edges, and connectors in a given SDFG state by an offset\nexport function offset_state(state, state_graph, offset) {\n    const drawn_nodes = new Set();\n\n    state.nodes.forEach((n, nid) => {\n        const node = state_graph.data.graph.node(nid);\n        if (!node) return;\n        drawn_nodes.add(nid.toString());\n\n        node.x += offset.x;\n        node.y += offset.y;\n        node.in_connectors.forEach(c => {\n            c.x += offset.x;\n            c.y += offset.y;\n        });\n        node.out_connectors.forEach(c => {\n            c.x += offset.x;\n            c.y += offset.y;\n        });\n\n        if (node.data.node.type === 'NestedSDFG')\n            offset_sdfg(node.data.node.attributes.sdfg, node.data.graph, offset);\n    });\n    state.edges.forEach((e, eid) => {\n        e = check_and_redirect_edge(e, drawn_nodes, state);\n        if (!e) return;\n        const edge = state_graph.data.graph.edge(e.src, e.dst, eid);\n        if (!edge) return;\n        edge.x += offset.x;\n        edge.y += offset.y;\n        edge.points.forEach((p) => {\n            p.x += offset.x;\n            p.y += offset.y;\n        });\n    });\n}\n\n\n///////////////////////////////////////////////////////\n\nexport function drawAdaptiveText(ctx, renderer, far_text, close_text,\n    x, y, w, h, ppp_thres, max_font_size = 50,\n    font_multiplier = 16) {\n    const ppp = renderer.canvas_manager.points_per_pixel();\n    let label = close_text;\n    let FONTSIZE = Math.min(ppp * font_multiplier, max_font_size);\n    let yoffset = LINEHEIGHT / 2.0;\n    const oldfont = ctx.font;\n    if (ctx.lod && ppp >= ppp_thres) { // Far text\n        ctx.font = FONTSIZE + \"px sans-serif\";\n        label = far_text;\n        yoffset = FONTSIZE / 2.0 - h / 6.0;\n    }\n\n    const textmetrics = ctx.measureText(label);\n    let tw = textmetrics.width;\n    if (ctx.lod && ppp >= ppp_thres && tw > w) {\n        FONTSIZE = FONTSIZE / (tw / w);\n        ctx.font = FONTSIZE + \"px sans-serif\";\n        yoffset = FONTSIZE / 2.0 - h / 6.0;\n        tw = w;\n    }\n\n    ctx.fillText(label, x - tw / 2.0, y + yoffset);\n\n    if (ctx.lod && ppp >= ppp_thres)\n        ctx.font = oldfont;\n}\n\nexport function drawHexagon(ctx, x, y, w, h, offset) {\n    const topleft = { x: x - w / 2.0, y: y - h / 2.0 };\n    const hexseg = h / 3.0;\n    ctx.beginPath();\n    ctx.moveTo(topleft.x, y);\n    ctx.lineTo(topleft.x + hexseg, topleft.y);\n    ctx.lineTo(topleft.x + w - hexseg, topleft.y);\n    ctx.lineTo(topleft.x + w, y);\n    ctx.lineTo(topleft.x + w - hexseg, topleft.y + h);\n    ctx.lineTo(topleft.x + hexseg, topleft.y + h);\n    ctx.lineTo(topleft.x, y);\n    ctx.closePath();\n}\n\nexport function drawOctagon(ctx, topleft, width, height) {\n    const octseg = height / 3.0;\n    ctx.beginPath();\n    ctx.moveTo(topleft.x, topleft.y + octseg);\n    ctx.lineTo(topleft.x + octseg, topleft.y);\n    ctx.lineTo(topleft.x + width - octseg, topleft.y);\n    ctx.lineTo(topleft.x + width, topleft.y + octseg);\n    ctx.lineTo(topleft.x + width, topleft.y + 2 * octseg);\n    ctx.lineTo(topleft.x + width - octseg, topleft.y + height);\n    ctx.lineTo(topleft.x + octseg, topleft.y + height);\n    ctx.lineTo(topleft.x, topleft.y + 2 * octseg);\n    ctx.lineTo(topleft.x, topleft.y + 1 * octseg);\n    ctx.closePath();\n}\n\n// Adapted from https://stackoverflow.com/a/2173084/6489142\nexport function drawEllipse(ctx, x, y, w, h) {\n    const kappa = .5522848,\n        ox = (w / 2) * kappa, // control point offset horizontal\n        oy = (h / 2) * kappa, // control point offset vertical\n        xe = x + w,           // x-end\n        ye = y + h,           // y-end\n        xm = x + w / 2,       // x-middle\n        ym = y + h / 2;       // y-middle\n\n    ctx.moveTo(x, ym);\n    ctx.bezierCurveTo(x, ym - oy, xm - ox, y, xm, y);\n    ctx.bezierCurveTo(xm + ox, y, xe, ym - oy, xe, ym);\n    ctx.bezierCurveTo(xe, ym + oy, xm + ox, ye, xm, ye);\n    ctx.bezierCurveTo(xm - ox, ye, x, ym + oy, x, ym);\n}\n\nexport function drawArrow(ctx, p1, p2, size, offset = 0, padding = 0) {\n    ctx.save();\n    // Rotate the context to point along the path\n    const dx = p2.x - p1.x;\n    const dy = p2.y - p1.y;\n    ctx.translate(p2.x, p2.y);\n    ctx.rotate(Math.atan2(dy, dx));\n\n    // arrowhead\n    ctx.beginPath();\n    ctx.moveTo(0 + padding + offset, 0);\n    ctx.lineTo(((-2 * size) - padding) - offset, -(size + padding));\n    ctx.lineTo(((-2 * size) - padding) - offset, (size + padding));\n    ctx.closePath();\n    ctx.fill();\n    ctx.restore();\n}\n\nexport function drawTrapezoid(ctx, topleft, node, inverted = false) {\n    ctx.beginPath();\n    if (inverted) {\n        ctx.moveTo(topleft.x, topleft.y);\n        ctx.lineTo(topleft.x + node.width, topleft.y);\n        ctx.lineTo(topleft.x + node.width - node.height, topleft.y + node.height);\n        ctx.lineTo(topleft.x + node.height, topleft.y + node.height);\n        ctx.lineTo(topleft.x, topleft.y);\n    } else {\n        ctx.moveTo(topleft.x, topleft.y + node.height);\n        ctx.lineTo(topleft.x + node.width, topleft.y + node.height);\n        ctx.lineTo(topleft.x + node.width - node.height, topleft.y);\n        ctx.lineTo(topleft.x + node.height, topleft.y);\n        ctx.lineTo(topleft.x, topleft.y + node.height);\n    }\n    ctx.closePath();\n}\n\n// Returns the distance from point p to line defined by two points (line1, line2)\nexport function ptLineDistance(p, line1, line2) {\n    const dx = (line2.x - line1.x);\n    const dy = (line2.y - line1.y);\n    const res = dy * p.x - dx * p.y + line2.x * line1.y - line2.y * line1.x;\n\n    return Math.abs(res) / Math.sqrt(dy * dy + dx * dx);\n}\n\n/**\n * Get the color on a green-red temperature scale based on a fractional value.\n * @param {Number} val Value between 0 and 1, 0 = green, .5 = yellow, 1 = red\n * @returns            HSL color string\n */\nexport function getTempColor(val) {\n    if (val < 0)\n        val = 0;\n    if (val > 1)\n        val = 1;\n    const hue = ((1 - val) * 120).toString(10);\n    return 'hsl(' + hue + ',100%,50%)';\n}\n\nexport const SDFGElements = {\n    SDFGElement, SDFG, State, SDFGNode, Edge, Connector, AccessNode, ScopeNode, EntryNode, ExitNode, MapEntry, MapExit,\n    ConsumeEntry, ConsumeExit, Tasklet, Reduce, PipelineEntry, PipelineExit, NestedSDFG, LibraryNode\n};\n\n// TODO remove this global variable assignment once DIODE is removed/no longer relies on it\nObject.assign(globalThis, SDFGElements);\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { sdfg_property_to_string } from \"./utils/sdfg/display\";\nimport { traverse_sdfg_scopes } from \"./utils/sdfg/traversal\";\nimport { htmlSanitize } from \"./utils/sanitization\";\nimport { globals } from \"./sdfv\";\n\nexport const SDFVUIHandlers = {\n    on_init_menu,\n    on_sidebar_set_title,\n    on_sidebar_show,\n    sidebar_get_contents,\n    on_close_menu,\n    on_outline,\n    on_fill_info,\n};\n\nfunction on_sidebar_set_title(title) {\n    // Modify sidebar header\n    document.getElementById(\"sidebar-header\").innerText = title;\n}\n\nfunction sidebar_get_contents() {\n    return document.getElementById(\"sidebar-contents\");\n}\n\nfunction on_sidebar_show() {\n    // Open sidebar if closed\n    document.getElementById(\"sidebar\").style.display = \"flex\";\n}\n\nfunction on_fill_info(elem) {\n    let contents = sidebar_get_contents();\n    let html = \"\";\n    if (elem instanceof Edge && elem.data.type === \"Memlet\") {\n        let sdfg_edge = elem.sdfg.nodes[elem.parent_id].edges[elem.id];\n        html += \"<h4>Connectors: \" + sdfg_edge.src_connector + \" &rarr; \" +\n            sdfg_edge.dst_connector + \"</h4>\";\n    }\n    html += \"<hr />\";\n\n    for (let attr of Object.entries(elem.attributes())) {\n        if (attr[0] === \"layout\" || attr[0] === \"sdfg\" ||\n            attr[0] === \"_arrays\" || attr[0].startsWith(\"_meta_\") ||\n            attr[0] == \"position\")\n            continue;\n        html += \"<b>\" + attr[0] + \"</b>:&nbsp;&nbsp;\";\n        html += sdfg_property_to_string(\n            attr[1], globals.daceRenderer.view_settings()\n        ) + \"</p>\";\n    }\n\n    // If access node, add array information too\n    if (elem instanceof AccessNode) {\n        let sdfg_array = elem.sdfg.attributes._arrays[elem.attributes().data];\n        html += \"<br /><h4>\" + sdfg_array.type + \" properties:</h4>\";\n        for (let attr of Object.entries(sdfg_array.attributes)) {\n            if (attr[0] === \"layout\" || attr[0] === \"sdfg\" ||\n                attr[0].startsWith(\"_meta_\"))\n                continue;\n            html += \"<b>\" + attr[0] + \"</b>:&nbsp;&nbsp;\";\n            html += sdfg_property_to_string(\n                attr[1], globals.daceRenderer.view_settings()\n            ) + \"</p>\";\n        }\n    }\n\n    contents.innerHTML = html;\n}\n\nfunction on_outline(renderer, sdfg) {\n    on_sidebar_set_title('SDFG Outline');\n\n    const sidebar = sidebar_get_contents();\n    sidebar.innerHTML = '';\n\n    // Entire SDFG\n    const d = document.createElement('div');\n    d.className = 'context_menu_option';\n    d.innerHTML = htmlSanitize`<i class=\"material-icons\" style=\"font-size: inherit\">filter_center_focus</i> SDFG ${renderer.sdfg.attributes.name}`;\n    d.onclick = () => renderer.zoom_to_view();\n    sidebar.appendChild(d);\n\n    const stack = [sidebar];\n\n    // Add elements to tree view in sidebar\n    traverse_sdfg_scopes(sdfg, (node, parent) => {\n        // Skip exit nodes when scopes are known\n        if (node.type().endsWith('Exit') && node.data.node.scope_entry >= 0) {\n            stack.push(null);\n            return true;\n        }\n\n        // Create element\n        const d = document.createElement('div');\n        d.className = 'context_menu_option';\n        let is_collapsed = node.attributes().is_collapsed;\n        is_collapsed = (is_collapsed === undefined) ? false : is_collapsed;\n        let node_type = node.type();\n\n        // If a scope has children, remove the name \"Entry\" from the type\n        if (node.type().endsWith('Entry')) {\n            const state = node.sdfg.nodes[node.parent_id];\n            if (state.scope_dict[node.id] !== undefined) {\n                node_type = node_type.slice(0, -5);\n            }\n        }\n\n        d.innerHTML = htmlSanitize`${node_type} ${node.label()}${is_collapsed ? \" (collapsed)\" : \"\"}`;\n        d.onclick = (e) => {\n            // Show node or entire scope\n            const nodes_to_display = [node];\n            if (node.type().endsWith('Entry')) {\n                const state = node.sdfg.nodes[node.parent_id];\n                if (state.scope_dict[node.id] !== undefined) {\n                    for (const subnode_id of state.scope_dict[node.id])\n                        nodes_to_display.push(parent.node(subnode_id));\n                }\n            }\n\n            renderer.zoom_to_view(nodes_to_display);\n\n            // Ensure that the innermost div is the one that handles the event\n            if (!e) e = window.event;\n            e.cancelBubble = true;\n            if (e.stopPropagation) e.stopPropagation();\n        };\n        stack.push(d);\n\n        // If is collapsed, don't traverse further\n        if (is_collapsed)\n            return false;\n\n    }, (node, parent) => {\n        // After scope ends, pop ourselves as the current element \n        // and add to parent\n        const elem = stack.pop();\n        if (elem)\n            stack[stack.length - 1].appendChild(elem);\n    });\n\n    on_sidebar_show();\n}\n\nfunction on_close_menu() {\n    document.getElementById(\"sidebar\").style.display = \"none\";\n}\n\nfunction on_init_menu() {\n    const right = document.getElementById('sidebar');\n    const bar = document.getElementById('dragbar');\n\n    const drag = (e) => {\n        document.selection ? document.selection.empty() : window.getSelection().removeAllRanges();\n        right.style.width = Math.max(((e.view.innerWidth - e.pageX)), 20) + 'px';\n    };\n\n    bar.addEventListener('mousedown', () => {\n        document.addEventListener('mousemove', drag);\n        document.addEventListener('mouseup', () => {\n            document.removeEventListener('mousemove', drag);\n        });\n    });\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { parse_sdfg, stringify_sdfg } from \"./utils/sdfg/json_serializer\";\nimport { mean, median } from 'mathjs';\nimport { SDFGRenderer } from './renderer/renderer';\nimport { GenericSdfgOverlay } from \"./overlays/generic_sdfg_overlay\";\nimport { SDFVUIHandlers } from \"./sdfv_ui_handlers\";\nimport { htmlSanitize } from \"./utils/sanitization\";\nimport { SDFGElements } from \"./renderer/renderer_elements\";\nimport { assignIfNotExists } from \"./utils/utils\"\nimport {\n    sdfg_property_to_string,\n    sdfg_range_elem_to_string,\n    sdfg_typeclass_to_string,\n    string_to_sdfg_typeclass,\n} from \"./utils/sdfg/display\";\nimport {\n    find_graph_element_by_uuid,\n    get_uuid_graph_element,\n} from \"./utils/sdfg/sdfg_utils\";\nimport { traverse_sdfg_scopes } from \"./utils/sdfg/traversal\";\nimport { RuntimeMicroSecondsOverlay } from \"./overlays/runtime_micro_seconds_overlay\";\nimport { MemoryVolumeOverlay } from \"./overlays/memory_volume_overlay\";\nimport { StaticFlopsOverlay } from \"./overlays/static_flops_overlay\";\nconst { $ } = globalThis;\n\nlet fr;\nlet file = null;\nlet instrumentation_file = null;\n\n\n// TODO: This is a workaround to utilize components of this module in non-ts\n// components of the vscode extension. This is subject to change when these\n// components are moved over from js to ts.\nexport const globals = assignIfNotExists(\n    /** @type {{}} */ (globalThis),\n    {\n        daceRenderer: null,\n        daceUIHandlers: SDFVUIHandlers,\n        daceInitSDFV: init_sdfv,\n        daceParseSDFG: parse_sdfg,\n        daceStringifySDFG: stringify_sdfg,\n        daceFindInGraph: find_in_graph,\n        daceSDFGPropertyToString: sdfg_property_to_string,\n        daceSDFGRangeElemToString: sdfg_range_elem_to_string,\n        daceGetUUIDGraphElement: get_uuid_graph_element,\n        daceFindGraphElementByUUID: find_graph_element_by_uuid,\n        daceTraverseSDFGScopes: traverse_sdfg_scopes,\n        daceSDFGTypeclassToString: sdfg_typeclass_to_string,\n        daceStringToSDFGTypeclass: string_to_sdfg_typeclass,\n        daceSDFGRenderer: SDFGRenderer,\n        daceSDFGElements: SDFGElements,\n        daceGenericSDFGOverlay: GenericSdfgOverlay,\n        daceMemoryVolumeOverlay: MemoryVolumeOverlay,\n        daceRuntimeMicroSecondsOverlay: RuntimeMicroSecondsOverlay,\n        daceStaticFlopsOverlay: StaticFlopsOverlay,\n        daceMouseEvent: mouse_event,\n    }\n);\n\n\n\nif (document.currentScript.hasAttribute('data-sdfg-json')) {\n    init_sdfv(parse_sdfg(document.currentScript.getAttribute('data-sdfg-json')));\n} else {\n    const url = getParameterByName('url');\n    if (url)\n        load_sdfg_from_url(url);\n    else\n        init_sdfv(null);\n}\n\n\nfunction init_sdfv(sdfg, user_transform = null, debug_draw = false) {\n    $('#sdfg-file-input').change((e) => {\n        if (e.target.files.length < 1)\n            return;\n        file = e.target.files[0];\n        reload_file();\n    });\n    $('#menuclose').click(() => close_menu());\n    $('#reload').click(() => {\n        reload_file();\n    });\n    $('#instrumentation-report-file-input').change((e) => {\n        if (e.target.files.length < 1)\n            return;\n        instrumentation_file = e.target.files[0];\n        load_instrumentation_report();\n    });\n    $('#outline').click(() => {\n        if (globals.daceRenderer)\n            setTimeout(() => outline(globals.daceRenderer, globals.daceRenderer.graph), 1);\n    });\n    $('#search-btn').click(() => {\n        if (globals.daceRenderer)\n            setTimeout(() => {\n                find_in_graph(globals.daceRenderer, globals.daceRenderer.graph, $('#search').val(),\n                    $('#search-case')[0].checked);\n            }, 1);\n    });\n    $('#search').on('keydown', (e) => {\n        if (e.key == 'Enter' || e.which == 13) {\n            start_find_in_graph();\n            e.preventDefault();\n        }\n    });\n\n    let mode_buttons = null;\n    let pan_btn = document.getElementById(\"pan-btn\");\n    let move_btn = document.getElementById(\"move-btn\");\n    let select_btn = document.getElementById(\"select-btn\");\n    let add_btns = [];\n    add_btns.push(document.getElementById('elem_map'));\n    add_btns.push(document.getElementById('elem_consume'));\n    add_btns.push(document.getElementById('elem_tasklet'));\n    add_btns.push(document.getElementById('elem_nested_sdfg'));\n    add_btns.push(document.getElementById('elem_access_node'));\n    add_btns.push(document.getElementById('elem_stream'));\n    add_btns.push(document.getElementById('elem_state'));\n    if (pan_btn)\n        mode_buttons = {\n            pan: pan_btn,\n            move: move_btn,\n            select: select_btn,\n            add_btns: add_btns,\n        };\n\n    if (sdfg !== null)\n        globals.daceRenderer = new SDFGRenderer(\n            sdfg, document.getElementById('contents'), mouse_event,\n            user_transform, debug_draw, null, mode_buttons\n        );\n}\n\nfunction start_find_in_graph() {\n    if (globals.daceRenderer)\n        setTimeout(() => {\n            find_in_graph(\n                globals.daceRenderer, globals.daceRenderer.graph,\n                $('#search').val(), $('#search-case')[0].checked\n            );\n        }, 1);\n}\n\nfunction reload_file() {\n    if (!file)\n        return;\n    fr = new FileReader();\n    fr.onload = file_read_complete;\n    fr.readAsText(file);\n}\n\nfunction file_read_complete() {\n    const sdfg = parse_sdfg(fr.result);\n    globals.daceRenderer?.destroy();\n    globals.daceRenderer = new SDFGRenderer(sdfg, document.getElementById('contents'), mouse_event);\n    close_menu();\n}\n\nfunction load_instrumentation_report() {\n    if (!instrumentation_file)\n        return;\n    fr = new FileReader();\n    fr.onload = load_instrumentation_report_callback;\n    fr.readAsText(instrumentation_file);\n}\n\nfunction load_instrumentation_report_callback() {\n    instrumentation_report_read_complete(JSON.parse(fr.result));\n}\n\n/**\n * Get the min/max values of an array.\n * This is more stable than Math.min/max for large arrays, since Math.min/max\n * is recursive and causes a too high stack-length with long arrays.\n */\nfunction get_minmax(arr) {\n    let max = -Number.MAX_VALUE;\n    let min = Number.MAX_VALUE;\n    arr.forEach(val => {\n        if (val > max)\n            max = val;\n        if (val < min)\n            min = val;\n    });\n    return [min, max];\n}\n\nfunction instrumentation_report_read_complete(report) {\n    const runtime_map = {};\n\n    if (report.traceEvents && globals.daceRenderer?.sdfg) {\n        for (const event of report.traceEvents) {\n            if (event.ph === 'X') {\n                let uuid = event.args.sdfg_id + '/';\n                if (event.args.state_id !== undefined) {\n                    uuid += event.args.state_id + '/';\n                    if (event.args.id !== undefined)\n                        uuid += event.args.id + '/-1';\n                    else\n                        uuid += '-1/-1';\n                } else {\n                    uuid += '-1/-1/-1';\n                }\n\n                if (runtime_map[uuid] !== undefined)\n                    runtime_map[uuid].push(event.dur);\n                else\n                    runtime_map[uuid] = [event.dur];\n            }\n        }\n\n        for (const key in runtime_map) {\n            const values = runtime_map[key];\n            const minmax = get_minmax(values);\n            const min = minmax[0];\n            const max = minmax[1];\n            const runtime_summary = {\n                'min': min,\n                'max': max,\n                'mean': mean(values),\n                'med': median(values),\n                'count': values.length,\n            };\n            runtime_map[key] = runtime_summary;\n        }\n\n        const renderer = globals.daceRenderer;\n\n        if (renderer.overlay_manager) {\n            if (!renderer.overlay_manager.is_overlay_active(\n                RuntimeMicroSecondsOverlay\n            )) {\n                renderer.overlay_manager.register_overlay(\n                    RuntimeMicroSecondsOverlay\n                );\n            }\n            const ol = renderer.overlay_manager.get_overlay(\n                RuntimeMicroSecondsOverlay\n            );\n            if (ol) {\n                ol.runtime_map = runtime_map;\n                ol.refresh();\n            }\n        }\n    }\n}\n\n// https://stackoverflow.com/a/901144/6489142\nfunction getParameterByName(name) {\n    const url = window.location.href;\n    name = name.replace(/[\\[\\]]/g, '\\\\$&');\n    const regex = new RegExp('[?&]' + name + '(=([^&#]*)|&|#|$)'),\n        results = regex.exec(url);\n    if (!results) return null;\n    if (!results[2]) return '';\n    return decodeURIComponent(results[2].replace(/\\+/g, ' '));\n}\n\nfunction load_sdfg_from_url(url) {\n    const request = new XMLHttpRequest();\n    request.responseType = 'text'; // Will be parsed as JSON by parse_sdfg\n    request.onload = () => {\n        if (request.status == 200) {\n            const sdfg = parse_sdfg(request.response);\n            if (globals.daceRenderer)\n                globals.daceRenderer.destroy();\n            init_sdfv(sdfg);\n        } else {\n            alert(\"Failed to load SDFG from URL\");\n            init_sdfv(null);\n        }\n    };\n    request.onerror = () => {\n        alert(\"Failed to load SDFG from URL: \" + request.status);\n        init_sdfv(null);\n    };\n    request.open('GET', url + ((/\\?/).test(url) ? \"&\" : \"?\") + (new Date()).getTime(), true);\n    request.send();\n}\n\nfunction find_recursive(graph, query, results, case_sensitive) {\n    for (const nodeid of graph.nodes()) {\n        const node = graph.node(nodeid);\n        let label = node.label();\n        if (!case_sensitive)\n            label = label.toLowerCase();\n        if (label.indexOf(query) !== -1)\n            results.push(node);\n        // Enter states or nested SDFGs recursively\n        if (node.data.graph)\n            find_recursive(node.data.graph, query, results, case_sensitive);\n    }\n    for (const edgeid of graph.edges()) {\n        const edge = graph.edge(edgeid);\n        let label = edge.label();\n        if (label !== undefined) {\n            if (!case_sensitive)\n                label = label.toLowerCase();\n            if (label.indexOf(query) !== -1)\n                results.push(edge);\n        }\n    }\n}\n\nfunction find_in_graph(renderer, sdfg, query, case_sensitive=false) {\n    sidebar_set_title('Search Results for \"' + query + '\"');\n\n    const results = [];\n    if (!case_sensitive)\n        query = query.toLowerCase();\n    find_recursive(sdfg, query, results, case_sensitive);\n\n    // Zoom to bounding box of all results first\n    if (results.length > 0)\n        renderer.zoom_to_view(results);\n\n    // Show clickable results in sidebar\n    const sidebar = sidebar_get_contents();\n    sidebar.innerHTML = '';\n    for (const result of results) {\n        const d = document.createElement('div');\n        d.className = 'context_menu_option';\n        d.innerHTML = htmlSanitize`${result.type()} ${result.label()}`;\n        d.onclick = () => { renderer.zoom_to_view([result]) };\n        d.onmouseenter = () => {\n            if (!result.highlighted) {\n                result.highlighted = true;\n                renderer.draw_async();\n            }\n        };\n        d.onmouseleave = () => {\n            if (result.highlighted) {\n                result.highlighted = false;\n                renderer.draw_async();\n            }\n        };\n        sidebar.appendChild(d);\n    }\n\n    sidebar_show();\n}\n\nfunction recursive_find_graph(graph, sdfg_id) {\n    let found = undefined;\n    graph.nodes().forEach(n_id => {\n        const n = graph.node(n_id);\n        if (n && n.sdfg.sdfg_list_id === sdfg_id) {\n            found = graph;\n            return found;\n        } else if (n && n.data.graph) {\n            found = recursive_find_graph(n.data.graph, sdfg_id);\n            if (found)\n                return found;\n        }\n    });\n    return found;\n}\n\nfunction find_state(graph, state_id) {\n    let state = undefined;\n    graph.nodes().forEach(s_id => {\n        if (Number(s_id) === state_id) {\n            state = graph.node(s_id);\n            return state;\n        }\n    });\n    return state;\n}\n\nfunction find_node(state, node_id) {\n    let node = undefined;\n    state.data.graph.nodes().forEach(n_id => {\n        if (Number(n_id) === node_id) {\n            node = state.data.graph.node(n_id);\n            return node;\n        }\n    });\n    return node;\n}\n\nfunction find_edge(state, edge_id) {\n    let edge = undefined;\n    state.data.graph.edges().forEach(e_id => {\n        if (Number(e_id.name) === edge_id) {\n            edge = state.data.graph.edge(e_id);\n            return edge;\n        }\n    });\n    return edge;\n}\n\nfunction find_graph_element(graph, type, sdfg_id, state_id = -1, el_id = -1) {\n    const requested_graph = recursive_find_graph(graph, sdfg_id);\n    let state;\n    if (requested_graph) {\n        switch (type) {\n            case 'edge':\n                state = find_state(requested_graph, state_id);\n                if (state)\n                    return find_edge(state, el_id);\n                break;\n            case 'state':\n                return find_state(requested_graph, state_id);\n            case 'node':\n                state = find_state(requested_graph, state_id);\n                if (state)\n                    return find_node(state, el_id);\n                break;\n            case 'isedge':\n                let isedge = undefined;\n                Object.values(requested_graph._edgeLabels).forEach(ise => {\n                    if (ise.id === el_id) {\n                        isedge = ise;\n                        return isedge;\n                    }\n                });\n                return isedge;\n            default:\n                return undefined;\n        }\n    }\n    return undefined;\n}\n\nfunction mouse_event(evtype, event, mousepos, elements, renderer,\n    selected_elements, ends_drag) {\n    if ((evtype === 'click' && !ends_drag) || evtype === 'dblclick') {\n        if (renderer.menu)\n            renderer.menu.destroy();\n        let element;\n        if (selected_elements.length === 0)\n            element = new SDFG(renderer.sdfg);\n        else if (selected_elements.length === 1)\n            element = selected_elements[0];\n        else\n            element = null;\n\n        if (element !== null) {\n            sidebar_set_title(element.type() + \" \" + element.label());\n            fill_info(element);\n        } else {\n            close_menu();\n            sidebar_set_title(\"Multiple elements selected\");\n        }\n        sidebar_show();\n\n    }\n}\n\nfunction init_menu() {\n    return globals.daceUIHandlers.on_init_menu();\n}\n\nfunction sidebar_set_title(title) {\n    return globals.daceUIHandlers.on_sidebar_set_title(title);\n}\n\nfunction sidebar_show() {\n    return globals.daceUIHandlers.on_sidebar_show();\n}\n\nfunction sidebar_get_contents() {\n    return globals.daceUIHandlers.sidebar_get_contents();\n}\n\nfunction close_menu() {\n    return globals.daceUIHandlers.on_close_menu();\n}\n\nfunction outline(renderer, sdfg) {\n    return globals.daceUIHandlers.on_outline(renderer, sdfg);\n}\n\nexport function fill_info(elem) {\n    return globals.daceUIHandlers.on_fill_info(elem);\n}\n\n$('document').ready(() => {\n    init_menu();\n});\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { htmlSanitize } from \"./sanitization\";\nconst { $ } = globalThis;\n\nexport class ContextMenu {\n    /*\n        Implementation for a custom context menu\n    */\n    constructor(html_content = null) {\n\n        this._html_content = html_content;\n        this._click_close_handlers = [];\n\n        this._ = setTimeout(() => {\n            this._click_close_handlers = [\n                ['click', x => {\n                    this.destroy();\n                }],\n                ['contextmenu', x => {\n                    this.destroy();\n                }]\n\n            ];\n\n            for (let x of this._click_close_handlers) {\n                window.addEventListener(...x);\n            }\n        }, 30);\n\n        this._options = [];\n        this._cmenu_elem = null;\n    }\n\n    width() {\n        return this._cmenu_elem.offsetWidth;\n    }\n\n    visible() { return this._cmenu_elem != null; }\n\n    addOption(name, onselect, onhover = null) {\n        this._options.push({\n            name: name,\n            func: onselect,\n            onhover: onhover\n        });\n    }\n\n    addCheckableOption(name, checked, onselect, onhover = null) {\n        this._options.push({\n            name: name,\n            checkbox: true,\n            checked: checked,\n            func: onselect,\n            onhover: onhover\n        });\n    }\n\n    destroy() {\n        if (!this._cmenu_elem)\n            return;\n        // Clear everything\n\n        // Remove the context menu\n\n        document.body.removeChild(this._cmenu_elem);\n\n        for (let x of this._click_close_handlers) {\n            window.removeEventListener(...x);\n        }\n\n        this._cmenu_elem = null;\n    }\n\n    show(x, y) {\n        /*\n            Shows the context menu originating at point (x,y)\n        */\n\n        let cmenu_div = document.createElement('div');\n        cmenu_div.id = \"contextmenu\";\n        $(cmenu_div).css('left', x + \"px\");\n        $(cmenu_div).css('top', y + \"px\");\n        cmenu_div.classList.add(\"context_menu\");\n\n\n        if (this._html_content == null) {\n            // Set default context menu\n\n            for (let x of this._options) {\n\n                let elem = document.createElement('div');\n                elem.addEventListener('click', x.func);\n                elem.classList.add(\"context_menu_option\");\n\n                if (x.checkbox) {\n                    let markelem = document.createElement('span');\n                    markelem.classList = x.checked ? 'checkmark_checked' : 'checkmark';\n                    elem.appendChild(markelem);\n                    elem.innerHTML += htmlSanitize`${x.name}`;\n                    elem.addEventListener('click', elem => {\n                        x.checked = !x.checked;\n                        x.func(elem, x.checked);\n                    });\n                } else {\n                    elem.innerText = x.name;\n                    elem.addEventListener('click', x.func);\n                }\n                cmenu_div.appendChild(elem);\n            }\n        }\n        else {\n            cmenu_div.innerHTML = this._html_content;\n        }\n\n        this._cmenu_elem = cmenu_div;\n        document.body.appendChild(cmenu_div);\n    }\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport function escapeHTML(s: string): string {\n    const escapeCharacters: Map<string, string> = new Map([\n        ['&', '&amp;'],\n        ['<', '&lt;'],\n        ['>', '&gt;'],\n        ['\"', '&quot;'],\n        [\"'\", '&#039;'],\n    ]);\n\n    return `${s}`.replace(/[&<>\"']/g, m => escapeCharacters.get(m)!);\n}\n\nexport function htmlSanitize(strings: TemplateStringsArray, ...values: any[]): string {\n    return strings.length === 1 ? strings[0]\n        : strings.reduce((s, n, i) => `${s}${escapeHTML(String(values[i - 1]))}${n}`);\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { simplify } from 'mathjs';\n\nexport function sdfg_range_elem_to_string(range, settings = null) {\n    let preview = '';\n    if (range.start == range.end && range.step == 1 && range.tile == 1)\n        preview += sdfg_property_to_string(range.start, settings);\n    else {\n        if (settings && settings.inclusive_ranges) {\n            preview += sdfg_property_to_string(range.start, settings) + '..' +\n                sdfg_property_to_string(range.end, settings);\n        } else {\n            let endp1 = sdfg_property_to_string(range.end, settings) + ' + 1';\n            try {\n                endp1 = simplify(endp1).toString();\n            } catch (e) { }\n            preview += sdfg_property_to_string(range.start, settings) + ':' +\n                endp1;\n        }\n        if (range.step != 1) {\n            preview += ':' + sdfg_property_to_string(range.step, settings);\n            if (range.tile != 1)\n                preview += ':' + sdfg_property_to_string(range.tile, settings);\n        } else if (range.tile != 1) {\n            preview += '::' + sdfg_property_to_string(range.tile, settings);\n        }\n    }\n    return preview;\n}\n\n\n// Includes various properties and returns their string representation\nexport function sdfg_property_to_string(prop, settings = null) {\n    if (prop === null) return prop;\n    if (typeof prop === 'boolean') {\n        if (prop)\n            return 'True';\n        return 'False';\n    } else if (prop.type === \"Indices\" || prop.type === \"subsets.Indices\") {\n        const indices = prop.indices;\n        let preview = '[';\n        for (const index of indices) {\n            preview += sdfg_property_to_string(index, settings) + ', ';\n        }\n        return preview.slice(0, -2) + ']';\n    } else if (prop.type === \"Range\" || prop.type === \"subsets.Range\") {\n        const ranges = prop.ranges;\n\n        // Generate string from range\n        let preview = '[';\n        for (const range of ranges) {\n            preview += sdfg_range_elem_to_string(range, settings) + ', ';\n        }\n        return preview.slice(0, -2) + ']';\n    } else if (prop.language !== undefined) {\n        // Code\n        if (prop.string_data !== '' && prop.string_data !== undefined && prop.string_data !== null)\n            return '<pre class=\"code\"><code>' + prop.string_data.trim() +\n                '</code></pre><div class=\"clearfix\"></div>';\n        return '';\n    } else if (prop.approx !== undefined && prop.main !== undefined) {\n        // SymExpr\n        return prop.main;\n    } else if (prop.constructor == Object) {\n        // General dictionary\n        return '<pre class=\"code\"><code>' + JSON.stringify(prop, undefined, 4) +\n            '</code></pre><div class=\"clearfix\"></div>';\n    } else if (prop.constructor == Array) {\n        // General array\n        let result = '[ ';\n        let first = true;\n        for (const subprop of prop) {\n            if (!first)\n                result += ', ';\n            result += sdfg_property_to_string(subprop, settings);\n            first = false;\n        }\n        return result + ' ]';\n    } else {\n        return prop;\n    }\n}\n\nexport function string_to_sdfg_typeclass(str) {\n    str.replace(/\\s+/g, '');\n\n    if (str === '' || str === 'null')\n        return null;\n\n    if (str.endsWith(')')) {\n        if (str.startsWith('vector(')) {\n            const argstring = str.substring(7, str.length - 1);\n            if (argstring) {\n                const splitidx = argstring.lastIndexOf(',');\n                if (splitidx) {\n                    const dtype = string_to_sdfg_typeclass(\n                        argstring.substring(0, splitidx)\n                    );\n                    const count = argstring.substring(splitidx);\n                    if (dtype && count)\n                        return {\n                            type: 'vector',\n                            dtype: dtype,\n                            elements: count,\n                        };\n                }\n            }\n        } else if (str.startsWith('pointer(')) {\n            const argstring = str.substring(8, str.length - 1);\n            if (argstring)\n                return {\n                    type: 'pointer',\n                    dtype: string_to_sdfg_typeclass(argstring),\n                };\n        } else if (str.startsWith('opaque(')) {\n            const argstring = str.substring(7, str.length - 1);\n            if (argstring)\n                return {\n                    type: 'opaque',\n                    name: argstring,\n                };\n        } else if (str.startsWith('callback(')) {\n            const argstring = str.substring(9, str.length - 1);\n            if (argstring) {\n                const splitidx = argstring.lastIndexOf(',');\n                if (splitidx) {\n                    const cb_argstring = argstring.substring(0, splitidx);\n                    if (cb_argstring.startsWith('[') &&\n                        cb_argstring.endsWith(']')) {\n                        const cb_args_raw = cb_argstring.substring(\n                            1, cb_argstring.length - 1\n                        ).split(',');\n                        const ret_type = string_to_sdfg_typeclass(\n                            argstring.substring(splitidx)\n                        );\n\n                        const cb_args = [];\n                        if (cb_args_raw)\n                            cb_args_raw.forEach(raw_arg => {\n                                cb_args.push(string_to_sdfg_typeclass(raw_arg));\n                            });\n\n                        if (cb_args && ret_type)\n                            return {\n                                type: 'callback',\n                                arguments: cb_args,\n                                returntype: ret_type,\n                            };\n                    }\n                }\n            }\n        }\n    }\n    return str;\n}\n\nexport function sdfg_typeclass_to_string(typeclass) {\n    if (typeclass === undefined || typeclass === null)\n        return 'null';\n\n    if (typeclass.constructor === Object) {\n        if (typeclass.type !== undefined) {\n            switch (typeclass.type) {\n                case 'vector':\n                    if (typeclass.elements !== undefined &&\n                        typeclass.dtype !== undefined)\n                        return 'vector(' + sdfg_typeclass_to_string(\n                            typeclass.dtype\n                        ) + ', ' + typeclass.elements + ')';\n                    break;\n                case 'pointer':\n                    if (typeclass.dtype !== undefined)\n                        return 'pointer(' + sdfg_typeclass_to_string(\n                            typeclass.dtype\n                        ) + ')';\n                    break;\n                case 'opaque':\n                    if (typeclass.name !== undefined)\n                        return 'opaque(' + typeclass.name + ')';\n                    break;\n                case 'callback':\n                    if (typeclass.arguments !== undefined) {\n                        let str = 'callback([';\n                        for (let i = 0; i < typeclass.arguments.length; i++) {\n                            str += sdfg_typeclass_to_string(\n                                typeclass.arguments[i]\n                            );\n                            if (i < typeclass.arguments.length - 1)\n                                str += ', ';\n                        }\n                        str += '], ';\n                        if (typeclass.returntype !== undefined)\n                            str += sdfg_typeclass_to_string(\n                                typeclass.returntype\n                            );\n                        else\n                            str += 'None';\n                        str += ')';\n                        return str;\n                    }\n                    break;\n            }\n        }\n\n        // This is an unknown typeclass, just show the entire JSON.\n        return sdfg_property_to_string(typeclass);\n    }\n\n    // This typeclass already is a regular string.\n    return typeclass;\n}\n\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\n// Recursively parse SDFG, including nested SDFG nodes\nexport function parse_sdfg(sdfg_json: string): unknown {\n    return JSON.parse(sdfg_json, reviver);\n}\n\nexport function stringify_sdfg(sdfg: unknown): string {\n    return JSON.stringify(sdfg, (name, val) => replacer(name, val, sdfg));\n}\n\nfunction reviver(name: string, val: unknown) {\n    if (name == 'sdfg' && val && typeof val === 'string' && val[0] === '{') {\n        return JSON.parse(val, reviver);\n    }\n    return val;\n}\n\nfunction isDict(v: unknown): v is Record<string, unknown> {\n    return typeof v === 'object' && v !== null && !(v instanceof Array) && !(v instanceof Date);\n}\n\nfunction replacer(name: string, val: unknown, orig_sdfg: unknown): unknown {\n    if (val && isDict(val) && val !== orig_sdfg && 'type' in val && val.type === 'SDFG') {\n        return JSON.stringify(val, (n, v) => replacer(n, v, val));\n    }\n    return val;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport class SDFG_Parser {\n    constructor(sdfg) {\n        this._sdfg = sdfg;\n    }\n\n    getStates() {\n\n        return this._sdfg.nodes.map(x => new SDFG_State_Parser(x));\n    }\n\n    static lookup_symbols(sdfg, state_id, elem, symbols_to_resolve, depth = 0) {\n        // Resolve used symbols by following connectors in reverse order\n        const state = sdfg.nodes[state_id];\n\n        let syms = [];\n\n        if (elem.constructor == Object) {\n            // Memlet\n            const memlets = state.edges.filter(x => x.dst == elem.dst && x.src == elem.src);\n\n            // Recurse into parent (since this a multigraph, all edges need to be looked at)\n            for (const m of memlets) {\n\n                // Find symbols used (may be Indices or Range)\n                const mdata = m.attributes.data.attributes.subset;\n                // Check for indices\n                if (mdata.type == \"subsets.Indices\") {\n                    // These are constants or variables\n                    // Reverse to have smallest unit first\n                    const tmp = mdata.indices.map(x => x).reverse();\n                    for (const x of tmp) {\n                        // Add the used variables as null and hope that they will be resolved\n                        depth += 1;\n                        syms.push({ var: x, val: null, depth: depth });\n                    }\n                }\n                else if (mdata.type == \"subsets.Range\") {\n                    // These are ranges\n\n                    // These ranges are not of interest, as they specify what is copied and don't define new variables \n                }\n\n                // Find parent nodes\n                const parent = sdfg.nodes[state_id].nodes[m.src];\n                const tmp = SDFG_Parser.lookup_symbols(sdfg, state_id, m.src, symbols_to_resolve, depth + 1);\n                syms = [...syms, ...tmp];\n            }\n        }\n        else {\n            // Node\n            const node = state.nodes[elem];\n\n            // Maps (and Consumes) define ranges, extract symbols from there\n            try {\n                const rngs = node.attributes.range.ranges.map(x => x); // The iterator ranges\n                const params = node.attributes.params.map(x => x); // The iterators\n\n                console.assert(rngs.length == params.length, \"Ranges and params should have the same count of elements\");\n\n                // Reverse from big -> little to little -> big (or outer -> inner to inner -> outer)\n                rngs.reverse();\n                params.reverse();\n\n                for (let i = 0; i < rngs.length; ++i) {\n                    // Check first if the variable is already defined, and if yes, if the value is the same\n                    const fltrd = syms.filter(x => x.var == params[i]);\n                    if (fltrd.length == 0) {\n                        depth += 1;\n                        syms.push({ var: params[i], val: rngs[i], depth: depth });\n                    }\n                    else {\n                        if (JSON.stringify(fltrd[0].val) != JSON.stringify(rngs[i])) {\n                            console.warn(\"Colliding definitions for var \" + params[i], fltrd[0].val, rngs[i]);\n                        }\n                    }\n                }\n            }\n            catch (e) {\n                // Not a node defining ranges (every node except maps / consumes)\n            }\n            // Find all incoming edges\n            const inc_edges = state.edges.filter(x => x.dst == elem);\n            for (const e of inc_edges) {\n                const tmp = SDFG_Parser.lookup_symbols(sdfg, state_id, e, symbols_to_resolve, depth + 1);\n                syms = [...syms, ...tmp];\n            }\n        }\n\n        return syms;\n    }\n}\n\nexport class SDFG_State_Parser {\n    constructor(sdfg_state) {\n        this._sdfg_state = sdfg_state;\n    }\n\n    getNodes() {\n        return this._sdfg_state.nodes.map(x => new SDFG_Node_Parser(x));\n    }\n}\n\nexport class SDFG_Node_Parser {\n    constructor(node) {\n        this._node = node;\n    }\n\n    isNodeType(node_type) {\n        return this._node.attributes.type === node_type;\n    }\n}\n\nexport class SDFG_PropUtil {\n    static getMetaFor(obj, attr_name) {\n        return obj.attributes['_meta_' + attr_name];\n    }\n\n    static getAttributeNames(obj) {\n        const keys = Object.keys(obj.attributes);\n        const list = keys.filter(x => keys.includes('_meta_' + x));\n        return list;\n    }\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { SDFGElements } from \"../../renderer/renderer_elements\";\n\nconst { NestedSDFG } = SDFGElements;\n\nexport function recursively_find_graph(graph, graph_id, ns_node = undefined) {\n    if (graph.node(0).sdfg.sdfg_list_id === graph_id) {\n        return {\n            graph: graph,\n            node: ns_node,\n        };\n    } else {\n        const result = {\n            graph: undefined,\n            node: undefined,\n        };\n        for (const state_id of graph.nodes()) {\n            const state = graph.node(state_id);\n            if (state.data.graph !== undefined && state.data.graph !== null)\n                for (const node_id of state.data.graph.nodes()) {\n                    const node = state.data.graph.node(node_id);\n                    if (node instanceof NestedSDFG) {\n                        const search_graph = recursively_find_graph(\n                            node.data.graph, graph_id, node\n                        );\n                        if (search_graph.graph !== undefined) {\n                            return search_graph;\n                        }\n                    }\n                }\n        }\n        return result;\n    }\n}\n\n\nexport function find_exit_for_entry(nodes, entry_node) {\n    for (const n of nodes) {\n        if (n.type.endsWith(\"Exit\") && parseInt(n.scope_entry) == entry_node.id) {\n            return n;\n        }\n    }\n    console.warn(\"Did not find corresponding exit\");\n    return null;\n}\n\n\n/**\n * Return the string UUID for an SDFG graph element.\n *\n * UUIDs have the form of \"G/S/N/E\", where:\n * G = Graph list id\n * S = State ID (-1 for (nested) SDFGs)\n * N = SDFGNode ID (-1 for States, SDFGs, and Edges)\n * E = Edge ID (-1 for States, SDFGs, and Nodes)\n *\n * @param {*} element   Element to generate the UUID for.\n *\n * @returns             String containing the UUID\n */\n export function get_uuid_graph_element(element) {\n    const undefined_val = -1;\n    if (element instanceof State) {\n        return (\n            element.sdfg.sdfg_list_id + '/' +\n            element.id + '/' +\n            undefined_val + '/' +\n            undefined_val\n        );\n    } else if (element instanceof SDFGNode) {\n        return (\n            element.sdfg.sdfg_list_id + '/' +\n            element.parent_id + '/' +\n            element.id + '/' +\n            undefined_val\n        );\n    } else if (element instanceof Edge) {\n        let parent_id = undefined_val;\n        if (element.parent_id !== null && element.parent_id !== undefined)\n            parent_id = element.parent_id;\n        return (\n            element.sdfg.sdfg_list_id + '/' +\n            parent_id + '/' +\n            undefined_val + '/' +\n            element.id\n        );\n    }\n    return (\n        undefined_val + '/' +\n        undefined_val + '/' +\n        undefined_val + '/' +\n        undefined_val\n    );\n}\n\n\nexport function check_and_redirect_edge(edge, drawn_nodes, sdfg_state) {\n    // If destination is not drawn, no need to draw the edge\n    if (!drawn_nodes.has(edge.dst))\n        return null;\n    // If both source and destination are in the graph, draw edge as-is\n    if (drawn_nodes.has(edge.src))\n        return edge;\n\n    // If immediate scope parent node is in the graph, redirect\n    const scope_src = sdfg_state.nodes[edge.src].scope_entry;\n    if (!drawn_nodes.has(scope_src))\n        return null;\n\n    // Clone edge for redirection, change source to parent\n    const new_edge = Object.assign({}, edge);\n    new_edge.src = scope_src;\n\n    return new_edge;\n}\n\nexport function find_graph_element_by_uuid(p_graph, uuid) {\n    const uuid_split = uuid.split('/');\n    \n    const graph_id = Number(uuid_split[0]);\n    const state_id = Number(uuid_split[1]);\n    const node_id = Number(uuid_split[2]);\n    const edge_id = Number(uuid_split[3]);\n    \n    let result = {\n        parent: undefined,\n        element: undefined,\n    };\n    \n    let graph = p_graph;\n    if (graph_id > 0) {\n        const found_graph = recursively_find_graph(graph, graph_id);\n        if (found_graph.graph === undefined)\n            throw new Error();\n\n        graph = found_graph.graph;\n        result = {\n            parent: graph,\n            element: found_graph.node,\n        };\n    }\n    \n    let state = undefined;\n    if (state_id !== -1 && graph !== undefined) {\n        state = graph.node(state_id);\n        result = {\n            parent: graph,\n            element: state,\n        };\n    }\n    \n    if (node_id !== -1 && state !== undefined && state.data.graph !== null) {\n        // Look for a node in a state.\n        result = {\n            parent: state.data.graph,\n            element: state.data.graph.node(node_id),\n        };\n    } else if (edge_id !== -1 && state !== undefined && state.data.graph !== null) {\n        // Look for an edge in a state.\n        result = {\n            parent: state.data.graph,\n            element: state.data.graph.edge(edge_id),\n        };\n    } else if (edge_id !== -1 && state === undefined) {\n        // Look for an inter-state edge.\n        result = {\n            parent: graph,\n            element: graph.edge(edge_id),\n        };\n    }\n    \n    return result;\n}\n\n/**\n * Initializes positioning information on the given element.\n *\n * @param {SDFGElement} elem    The element that gets new positioning information\n * @returns                     The initial positioning information that has been created\n */\nexport function initialize_positioning_info(elem) {\n    let position;\n    if (elem instanceof Edge || elem.type === \"MultiConnectorEdge\") {\n        let points = undefined;\n        if (elem.points)\n            points = Array(elem.points.length);\n\n        position = {\n            points: points,\n            scope_dx: 0,\n            scope_dy: 0\n        };\n\n        for (let i = 0; elem.points && i < elem.points.length; i++)\n            position.points[i] = { dx: 0, dy: 0 };\n    } else {\n        position = { dx: 0, dy: 0, scope_dx: 0, scope_dy: 0 };\n    }\n\n    set_positioning_info(elem, position);\n\n    return position;\n}\n\n/**\n * Sets the positioning information on a given element. Replaces old\n * positioning information.\n * \n * @param {SDFGElement} elem    The element that receives new positioning info\n * @param {*} position          The positioning information\n */\nexport function set_positioning_info(elem, position) {\n    if (elem instanceof State)\n        elem.data.state.attributes.position = position;\n    else if (elem instanceof SDFGNode)\n        elem.data.node.attributes.position = position;\n    else if (elem instanceof Edge)\n        elem.data.attributes.position = position;\n    else if (elem.type === \"MultiConnectorEdge\")\n        elem.attributes.data.attributes.position = position;\n    // Works also for other objects with attributes\n    else if (elem.attributes)\n        elem.attributes.position = position;\n}\n\n/**\n * Finds the positioning information of the given element\n *\n * @param {SDFGElement} elem    The element that contains the information\n * @returns                     The positioning information if available, undefined otherwise\n */\nexport function get_positioning_info(elem) {\n    if (elem instanceof State)\n        return elem.data.state.attributes.position;\n    if (elem instanceof SDFGNode)\n        return elem.data.node.attributes.position;\n    if (elem instanceof Edge)\n        return elem.data.attributes.position;\n    if (elem?.type === \"MultiConnectorEdge\")\n        return elem?.attributes?.data?.attributes?.position;\n    // Works also for other objects with attributes\n    if (elem?.attributes)\n        return elem.attributes.position;\n\n    return undefined;\n}\n\n/**\n * Deletes the positioning information of the given element\n *\n * @param {SDFGElement} elem    The element that contains the information\n */\nexport function delete_positioning_info(elem) {\n    if (elem instanceof State)\n        delete elem.data.state.attributes.position;\n    if (elem instanceof SDFGNode)\n        delete elem.data.node.attributes.position;\n    if (elem instanceof Edge)\n        delete elem.data.attributes.position;\n    if (elem?.type === \"MultiConnectorEdge\")\n        delete elem.attributes.data.attributes.position;\n    // Works also for other objects with attributes\n    if (elem?.attributes)\n        delete elem.attributes.position;\n}\n\n/**\n * Creates a new SDFGElement of the given type and adds it to the state.\n * Returns the new SDFG element on success, otherwise null.\n *\n * @param sdfg      the sdfg that contains the parent state\n * @param elem_type the type of the new element\n * @param state     the parent state\n * @returns         the new element or null when creation failed\n */\nexport function add_elem_to_sdfg(sdfg, elem_type, state) {\n    let new_elem = {};\n    let attributes = {};\n    attributes.in_construction = true;\n    new_elem.attributes = attributes;\n\n    switch (elem_type) {\n        case \"MapEntry\":\n            return null;\n        case \"ConsumeEntry\":\n            return null;\n        case \"Tasklet\":\n            return null;\n        case \"NestedSDFG\":\n            return null;\n        case \"AccessNode\":\n            attributes.access = \"ReadWrite\";\n            attributes.data = \"\";\n            attributes.debuginfo = null;\n            attributes.in_connectors = {};\n            attributes.out_connectors = {};\n            attributes.setzero = false;\n\n            new_elem.id = state.data.state.nodes.length;\n            new_elem.label = \"\";\n            new_elem.scope_entry = null;\n            new_elem.scope_exit = null;\n            new_elem.type = elem_type;\n            break;\n        case \"Stream\":\n            return null;\n        case \"SDFGState\":\n            return null;\n        default:\n            return null;\n    }\n\n    if (elem_type !== \"SDFGState\") {\n        state.data.state.scope_dict['-1'].push(new_elem.id);\n        state.data.state.nodes.push(new_elem);\n    }\n\n    return new_elem;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\n/**\n * Receives a callback that accepts (node, parent graph) and returns a value.\n * This function is invoked recursively per scope (including scope nodes), unless the return\n * value is false, upon which the sub-scope will not be visited.\n * The function also accepts an optional post-subscope callback (same signature as `func`).\n **/\n export function traverse_sdfg_scopes(sdfg, func, post_subscope_func = null) {\n    function scopes_recursive(graph, nodes, processed_nodes = null) {\n        if (processed_nodes === null)\n            processed_nodes = new Set();\n\n        for (const nodeid of nodes) {\n            const node = graph.node(nodeid);\n            if (node === undefined || processed_nodes.has(node.id.toString()))\n                continue;\n\n            // Invoke function\n            const result = func(node, graph);\n\n            // Skip in case of e.g., collapsed nodes\n            if (result !== false) {\n                // Traverse scopes recursively (if scope_dict provided)\n                if (node.type().endsWith('Entry')) {\n                    const state = node.sdfg.nodes[node.parent_id];\n                    if (state.scope_dict[node.id] !== undefined)\n                        scopes_recursive(graph, state.scope_dict[node.id], processed_nodes);\n                }\n\n                // Traverse states or nested SDFGs\n                if (node.data.graph) {\n                    const state = node.data.state;\n                    if (state !== undefined && state.scope_dict[-1] !== undefined)\n                        scopes_recursive(node.data.graph, state.scope_dict[-1]);\n                    else // No scope_dict, traverse all nodes as a flat hierarchy\n                        scopes_recursive(node.data.graph, node.data.graph.nodes());\n                }\n            }\n\n            if (post_subscope_func)\n                post_subscope_func(node, graph);\n\n            processed_nodes.add(node.id.toString());\n        }\n    }\n    scopes_recursive(sdfg, sdfg.nodes());\n}\n\n\n\n/**\n * Returns a partial memlet tree from a given edge, from the root node\n * through all children (without siblings). Calling this function with\n * the root edge returns the entire memlet tree.\n **/\nexport function memlet_tree(graph, edge, root_only = false) {\n    const result = [];\n    const graph_edges = {};\n    graph.edges().forEach(e => {\n        graph_edges[e.name] = e;\n    });\n\n\n    function src(e) {\n        const ge = graph_edges[e.id];\n        return graph.node(ge.v);\n    }\n    function dst(e) {\n        const ge = graph_edges[e.id];\n        return graph.node(ge.w);\n    }\n\n    // Determine direction\n    let propagate_forward = false, propagate_backward = false;\n    if ((edge.src_connector && src(edge) instanceof EntryNode) ||\n        (edge.dst_connector && dst(edge) instanceof EntryNode &&\n            edge.dst_connector.startsWith('IN_')))\n        propagate_forward = true;\n    if ((edge.src_connector && src(edge) instanceof ExitNode) ||\n        (edge.dst_connector && dst(edge) instanceof ExitNode))\n        propagate_backward = true;\n\n    result.push(edge);\n\n    // If either both are false (no scopes involved) or both are true\n    // (invalid SDFG), we return only the current edge as a degenerate tree\n    if (propagate_forward == propagate_backward)\n        return result;\n\n    // Ascend (find tree root) while prepending\n    let curedge = edge;\n    if (propagate_forward) {\n        let source = src(curedge);\n        while (source instanceof EntryNode && curedge && curedge.src_connector) {\n            if (source.attributes().is_collapsed)\n                break;\n\n            const cname = curedge.src_connector.substring(4);  // Remove OUT_\n            curedge = null;\n            graph.inEdges(source.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.dst_connector == 'IN_' + cname)\n                    curedge = ge;\n            });\n            if (curedge) {\n                result.unshift(curedge);\n                source = src(curedge);\n            }\n        }\n    } else if (propagate_backward) {\n        let dest = dst(curedge);\n        while (dest instanceof ExitNode && curedge && curedge.dst_connector) {\n            const cname = curedge.dst_connector.substring(3);  // Remove IN_\n            curedge = null;\n            graph.outEdges(dest.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.src_connector == 'OUT_' + cname)\n                    curedge = ge;\n            });\n            if (curedge) {\n                result.unshift(curedge);\n                dest = dst(curedge);\n            }\n        }\n    }\n\n    if (root_only)\n        return [result[0]];\n\n    // Descend recursively\n    function add_children(edge) {\n        const children = [];\n        if (propagate_forward) {\n            const next_node = dst(edge);\n            if (!(next_node instanceof EntryNode) ||\n                !edge.dst_connector || !edge.dst_connector.startsWith('IN_'))\n                return;\n            if (next_node.attributes().is_collapsed)\n                return;\n            const conn = edge.dst_connector.substring(3);\n            graph.outEdges(next_node.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.src_connector == 'OUT_' + conn) {\n                    children.push(ge);\n                    result.push(ge);\n                }\n            });\n        } else if (propagate_backward) {\n            const next_node = src(edge);\n            if (!(next_node instanceof ExitNode) || !edge.src_connector)\n                return;\n            const conn = edge.src_connector.substring(4);\n            graph.inEdges(next_node.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.dst_connector == 'IN_' + conn) {\n                    children.push(ge);\n                    result.push(ge);\n                }\n            });\n        }\n\n        for (const child of children)\n            add_children(child);\n    }\n\n    // Start from current edge\n    add_children(edge);\n\n    return result;\n}\n\n/**\n * Returns a partial memlet tree from a given edge. It descends into nested SDFGs.\n * @param visited_edges is used to speed up the computation of the memlet trees\n **/\nexport function memlet_tree_nested(sdfg, state, edge, visited_edges = []) {\n    if (visited_edges.includes(edge) || edge.attributes.data.attributes.shortcut) {\n        return [];\n    }\n\n    visited_edges.push(edge);\n\n    let result = [];\n\n    function src(e) {\n        return state.nodes[e.src];\n    }\n    function dst(e) {\n        return state.nodes[e.dst];\n    }\n    function isview(node) {\n        if (node.type == \"AccessNode\") {\n            const nodedesc = sdfg.attributes._arrays[node.attributes.data];\n            return (nodedesc && nodedesc.type === \"View\");\n        }\n        return false;\n    }\n\n    // Determine direction\n    let propagate_forward = false, propagate_backward = false;\n    if ((edge.src_connector && src(edge).type.endsWith(\"Entry\")) ||\n        (edge.dst_connector && dst(edge).type.endsWith(\"Entry\") &&\n            edge.dst_connector.startsWith('IN_')) ||\n        dst(edge).type == \"NestedSDFG\" ||\n        isview(dst(edge)))\n        propagate_forward = true;\n    if ((edge.src_connector && src(edge).type.endsWith(\"Exit\")) ||\n        (edge.dst_connector && dst(edge).type.endsWith(\"Exit\")) ||\n        src(edge).type == \"NestedSDFG\" ||\n        isview(src(edge)))\n        propagate_backward = true;\n\n    result.push(edge);\n\n    // If either both are false (no scopes involved), we \n    // return only the current edge as a degenerate tree\n    if (propagate_forward == propagate_backward && propagate_backward === false)\n        return result;\n\n    // Descend recursively\n    function add_children(edge) {\n        const children = [];\n\n        if (propagate_forward) {\n            const next_node = dst(edge);\n\n            // Descend into nested SDFG\n            if (next_node.type == \"NestedSDFG\") {\n                const name = edge.dst_connector;\n                const nested_sdfg = next_node.attributes.sdfg;\n\n                nested_sdfg.nodes.forEach(nstate => {\n                    nstate.edges.forEach(e => {\n                        const node = nstate.nodes[e.src];\n                        if (node.type == \"AccessNode\" && node.attributes.data === name) {\n                            result = result.concat(memlet_tree_nested(nested_sdfg, nstate, e, visited_edges));\n                        }\n                    });\n                });\n            }\n\n            if (isview(next_node)) {\n                state.edges.forEach(e => {\n                    if (e.src == next_node.id) {\n                        children.push(e);\n                        if (!e.attributes.data.attributes.shortcut) {\n                            result.push(e);\n                        }\n                    }\n                });\n            } else {\n                if (!(next_node.type.endsWith(\"Entry\")) ||\n                    !edge.dst_connector || !edge.dst_connector.startsWith('IN_'))\n                    return;\n                if (next_node.attributes.is_collapsed)\n                    return;\n                const conn = edge.dst_connector.substring(3);\n                state.edges.forEach(e => {\n                    if (e.src == next_node.id && e.src_connector == 'OUT_' + conn) {\n                        children.push(e);\n                        if (!e.attributes.data.attributes.shortcut) {\n                            result.push(e);\n                        }\n                    }\n                });\n            }\n        }\n        if (propagate_backward) {\n            const next_node = src(edge);\n\n            // Descend into nested SDFG\n            if (next_node.type == \"NestedSDFG\") {\n                const name = edge.src_connector;\n                const nested_sdfg = next_node.attributes.sdfg;\n\n                nested_sdfg.nodes.forEach(nstate => {\n                    nstate.edges.forEach(e => {\n                        const node = nstate.nodes[e.dst];\n                        if (node.type == \"AccessNode\" && node.attributes.data == name) {\n                            result = result.concat(memlet_tree_nested(nested_sdfg, nstate, e, visited_edges));\n                        }\n                    });\n                });\n            }\n\n            if (isview(next_node)) {\n                state.edges.forEach(e => {\n                    if (e.dst == next_node.id) {\n                        children.push(e);\n                        result.push(e);\n                    }\n                });\n            } else {\n                if (!(next_node.type.endsWith(\"Exit\")) || !edge.src_connector)\n                    return;\n\n                const conn = edge.src_connector.substring(4);\n                state.edges.forEach(e => {\n                    if (e.dst == next_node.id && e.dst_connector == 'IN_' + conn) {\n                        children.push(e);\n                        result.push(e);\n                    }\n                });\n            }\n        }\n\n        for (const child of children)\n            add_children(child);\n    }\n\n    // Start from current edge\n    add_children(edge);\n\n    return result;\n}\n\n/**\n * Calls memlet_tree_nested for every nested SDFG and its edges and returns a list with all memlet trees.\n * As edges are visited only in one direction (from outer SDFGs to inner SDFGs) a memlet can be split into several\n * arrays.\n */\nexport function memlet_tree_recursive(root_sdfg) {\n    let trees = [];\n    const visited_edges = [];\n\n    root_sdfg.nodes.forEach(state => {\n\n        state.edges.forEach(e => {\n            const tree = memlet_tree_nested(root_sdfg, state, e, visited_edges);\n            if (tree.length > 1) {\n                trees.push(tree);\n            }\n        });\n\n        state.nodes.forEach(n => {\n            if (n.type == \"NestedSDFG\") {\n                const t = memlet_tree_recursive(n.attributes.sdfg);\n                trees = trees.concat(t);\n            }\n        });\n\n    })\n\n    return trees;\n}\n\n/**\n * Returns all memlet trees as sets for the given graph.\n * \n * @param {Graph} root_graph The top level graph.\n */\nexport function memlet_tree_complete(sdfg) {\n    const all_memlet_trees = [];\n    const memlet_trees = memlet_tree_recursive(sdfg);\n\n    // combine trees as memlet_tree_recursive does not necessarily return the complete trees (they might be split into several trees)\n    memlet_trees.forEach(tree => {\n        let common_edge = false;\n        for (const mt of all_memlet_trees) {\n            for (const edge of tree) {\n                if (mt.has(edge)) {\n                    tree.forEach(e => mt.add(e));\n                    common_edge = true;\n                    break;\n                }\n            }\n            if (common_edge)\n                break;\n        }\n        if (!common_edge)\n            all_memlet_trees.push(new Set(tree));\n    });\n\n    return all_memlet_trees;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport function equals<T>(a: T, b: T): boolean {\n    return JSON.stringify(a) === JSON.stringify(b);\n}\n\n\nexport function deepCopy<T>(obj: T): T {\n    if (typeof obj !== 'object' || obj === null) return obj;\n    if (Array.isArray(obj)) {\n        return obj.map(o => deepCopy(o)) as any;\n    } else {\n        return Object.fromEntries(deepCopy([...Object.entries(obj)])) as any;\n    }\n}\n\n/**\n * Create a DOM element with an optional given ID and class list.\n *\n * If a parent is provided, the element is automatically added as a child.\n *\n * @param {*} type      Element tag (div, span, etc.)\n * @param {*} id        Optional element id\n * @param {*} classList Optional array of class names\n * @param {*} parent    Optional parent element\n *\n * @returns             The created DOM element\n */\nexport function createElement<K extends keyof HTMLElementTagNameMap>(\n    type: K,\n    id = '',\n    classList: string[] = [],\n    parent: Node | undefined = undefined\n): HTMLElementTagNameMap[K] {\n    const element = document.createElement(type);\n    if (id !== '')\n        element.id = id;\n    if (classList !== [])\n        classList.forEach(class_name => {\n            if (!element.classList.contains(class_name))\n                element.classList.add(class_name);\n        });\n    if (parent)\n        parent.appendChild(element);\n    return element;\n}\n\n/**\n * Similar to Object.assign, but skips properties that already exist in `obj`.\n */\nexport function assignIfNotExists<T, E>(obj: T, other: E): T & Omit<E, keyof T> {\n    const o = obj as any;\n    for (const [key, val] of Object.entries(other)) {\n        if (!(key in obj)) o[key] = val;\n    }\n    return o;\n}\n","/**\n * @license Complex.js v2.0.12 11/02/2016\n *\n * Copyright (c) 2016, 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.\n   *\n   * @param {number} x\n   * @returns {number} cos(x) - 1\n   */\n\n  var cosm1 = function(x) {\n    var limit = Math.PI/4;\n    if (x < -limit || x > limit) {\n      return (Math.cos(x) - 1.0);\n    }\n\n    var xx = x * x;\n    return xx *\n      (-0.5 + xx *\n        (1/24 + xx *\n          (-1/720 + xx *\n            (1/40320 + xx *\n              (-1/3628800 + xx *\n                (1/4790014600 + xx *\n                  (-1/87178291200 + xx *\n                    (1/20922789888000)\n                  )\n                )\n              )\n            )\n          )\n        )\n      )\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    return Math.log(a / Math.cos(Math.atan2(b, a)));\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) {\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(c) = (e^b - e^(-b)) / (2i)\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^b + e^(-b)) / 2\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(c) = (e^(ci) - e^(-ci)) / (i(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 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 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-16;\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","/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"./lib/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  var fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  _.forEach(fas, function(e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return function(e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (_.has(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function(e) {\n      if (_.has(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  _.forEach(g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  _.forEach(g.edges(), function(e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      _.forEach(children, dfs);\n    }\n\n    if (_.has(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (_.has(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (_.has(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n","/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nmodule.exports = List;\n\nfunction List() {\n  var sentinel = {};\n  sentinel._next = sentinel._prev = sentinel;\n  this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n  var sentinel = this._sentinel;\n  var entry = sentinel._prev;\n  if (entry !== sentinel) {\n    unlink(entry);\n    return entry;\n  }\n};\n\nList.prototype.enqueue = function(entry) {\n  var sentinel = this._sentinel;\n  if (entry._prev && entry._next) {\n    unlink(entry);\n  }\n  entry._next = sentinel._next;\n  sentinel._next._prev = entry;\n  sentinel._next = entry;\n  entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n  var strs = [];\n  var sentinel = this._sentinel;\n  var curr = sentinel._prev;\n  while (curr !== sentinel) {\n    strs.push(JSON.stringify(curr, filterOutLinks));\n    curr = curr._prev;\n  }\n  return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  var layerMatrix = util.buildLayerMatrix(g);\n\n  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  _.forEach(g.nodes(), function(v) {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  _.forEach(g.edges(), function(e) {\n    h.setEdge(e.v, e.w, {}, e.name);\n  });\n\n  _.forEach(layerMatrix, function(layer, i) {\n    var layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    _.reduce(layer, function(u, v) {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n","/* global window */\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n  try {\n    graphlib = require(\"graphlib\");\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!graphlib) {\n  graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(_.map(results, function(e) {\n    return g.outEdges(e.v, e.w);\n  }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function(v) {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function(e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function(v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", function() {\n    var layoutGraph = \n      time(\"  buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n    time(\"  runLayout\",        function() { runLayout(layoutGraph, time); });\n    time(\"  updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n  });\n}\n\nfunction runLayout(g, time) {\n  time(\"    makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n  time(\"    removeSelfEdges\",        function() { removeSelfEdges(g); });\n  time(\"    acyclic\",                function() { acyclic.run(g); });\n  time(\"    nestingGraph.run\",       function() { nestingGraph.run(g); });\n  time(\"    rank\",                   function() { rank(util.asNonCompoundGraph(g)); });\n  time(\"    injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n  time(\"    removeEmptyRanks\",       function() { removeEmptyRanks(g); });\n  time(\"    nestingGraph.cleanup\",   function() { nestingGraph.cleanup(g); });\n  time(\"    normalizeRanks\",         function() { normalizeRanks(g); });\n  time(\"    assignRankMinMax\",       function() { assignRankMinMax(g); });\n  time(\"    removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n  time(\"    normalize.run\",          function() { normalize.run(g); });\n  time(\"    parentDummyChains\",      function() { parentDummyChains(g); });\n  time(\"    addBorderSegments\",      function() { addBorderSegments(g); });\n  time(\"    order\",                  function() { order(g); });\n  time(\"    insertSelfEdges\",        function() { insertSelfEdges(g); });\n  time(\"    adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n  time(\"    position\",               function() { position(g); });\n  time(\"    positionSelfEdges\",      function() { positionSelfEdges(g); });\n  time(\"    removeBorderNodes\",      function() { removeBorderNodes(g); });\n  time(\"    normalize.undo\",         function() { normalize.undo(g); });\n  time(\"    fixupEdgeLabelCoords\",   function() { fixupEdgeLabelCoords(g); });\n  time(\"    undoCoordinateSystem\",   function() { coordinateSystem.undo(g); });\n  time(\"    translateGraph\",         function() { translateGraph(g); });\n  time(\"    assignNodeIntersects\",   function() { assignNodeIntersects(g); });\n  time(\"    reversePoints\",          function() { reversePointsForReversedEdges(g); });\n  time(\"    acyclic.undo\",           function() { acyclic.undo(g); });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  _.forEach(inputGraph.nodes(), function(v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (_.has(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(_.merge({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    _.pick(graph, graphAttrs)));\n\n  _.forEach(inputGraph.nodes(), function(v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, _.merge({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      _.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = _.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, function(p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (_.has(edge, \"x\")) { edge.x -= minX; }\n    if (_.has(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  _.forEach(g.nodes(), function(v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(_.last(node.borderLeft));\n      var r = g.node(_.last(node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  _.forEach(g.nodes(), function(v) {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  _.forEach(layers, function(layer) {\n    var orderShift = 0;\n    _.forEach(layer, function(v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      _.forEach(node.selfEdges, function(selfEdge) {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  _.forEach(attrs, function(v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\n}\n","/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      cloneDeep: require(\"lodash/cloneDeep\"),\n      constant: require(\"lodash/constant\"),\n      defaults: require(\"lodash/defaults\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      find: require(\"lodash/find\"),\n      flatten: require(\"lodash/flatten\"),\n      forEach: require(\"lodash/forEach\"),\n      forIn: require(\"lodash/forIn\"),\n      has:  require(\"lodash/has\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      last: require(\"lodash/last\"),\n      map: require(\"lodash/map\"),\n      mapValues: require(\"lodash/mapValues\"),\n      max: require(\"lodash/max\"),\n      merge: require(\"lodash/merge\"),\n      min: require(\"lodash/min\"),\n      minBy: require(\"lodash/minBy\"),\n      now: require(\"lodash/now\"),\n      pick: require(\"lodash/pick\"),\n      range: require(\"lodash/range\"),\n      reduce: require(\"lodash/reduce\"),\n      sortBy: require(\"lodash/sortBy\"),\n      uniqueId: require(\"lodash/uniqueId\"),\n      values: require(\"lodash/values\"),\n      zipObject: require(\"lodash/zipObject\"),\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  cleanup: cleanup\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  var depths = treeDepths(g);\n  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  _.forEach(g.children(), function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = util.addBorderNode(g, \"_bt\");\n  var bottom = util.addBorderNode(g, \"_bb\");\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  _.forEach(children, function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      _.forEach(children, function(child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  _.forEach(g.children(), function(v) { dfs(v, 1); });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(g.edges(), function(acc, e) {\n    return acc + g.edge(e).weight;\n  }, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n}\n\nfunction normalizeEdge(g, e) {\n  var v = e.v;\n  var vRank = g.node(v).rank;\n  var w = e.w;\n  var wRank = g.node(w).rank;\n  var name = e.name;\n  var edgeLabel = g.edge(e);\n  var labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  var dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var origLabel = node.edgeLabel;\n    var w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  var prev = {},\n    rootPrev;\n\n  _.forEach(vs, function(v) {\n    var child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      _.each(children, function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = barycenter;\n\nfunction barycenter(g, movable) {\n  return _.map(movable, function(v) {\n    var inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      var result = _.reduce(inV, function(acc, e) {\n        var edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n  var root = createRootNode(g),\n    result = new Graph({ compound: true }).setGraph({ root: root })\n      .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      _.forEach(g[relationship](v), function(e) {\n        var u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = !_.isUndefined(edge) ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (_.has(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = _.uniqueId(\"_root\"))));\n  return v;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  var cc = 0;\n  for (var i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  var southPos = _.zipObject(southLayer,\n    _.map(southLayer, function (v, i) { return i; }));\n  var southEntries = _.flatten(_.map(northLayer, function(v) {\n    return _.sortBy(_.map(g.outEdges(v), function(e) {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }), \"pos\");\n  }), true);\n\n  // Build the accumulator tree\n  var firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  var treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  var tree = _.map(new Array(treeSize), function() { return 0; });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  _.forEach(southEntries.forEach(function(entry) {\n    var index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    var weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  }));\n\n  return cc;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar initOrder = require(\"./init-order\");\nvar crossCount = require(\"./cross-count\");\nvar sortSubgraph = require(\"./sort-subgraph\");\nvar buildLayerGraph = require(\"./build-layer-graph\");\nvar addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g) {\n  var maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  var layering = initOrder(g);\n  assignOrder(g, layering);\n\n  var bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    var cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = _.cloneDeep(layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return _.map(ranks, function(rank) {\n    return buildLayerGraph(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  var cg = new Graph();\n  _.forEach(layerGraphs, function(lg) {\n    var root = lg.graph().root;\n    var sorted = sortSubgraph(lg, root, cg, biasRight);\n    _.forEach(sorted.vs, function(v, i) {\n      lg.node(v).order = i;\n    });\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, i) {\n      g.node(v).order = i;\n    });\n  });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  var visited = {};\n  var simpleNodes = _.filter(g.nodes(), function(v) {\n    return !g.children(v).length;\n  });\n  var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n  var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    var node = g.node(v);\n    layers[node.rank].push(v);\n    _.forEach(g.successors(v), dfs);\n  }\n\n  var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n  _.forEach(orderedVs, dfs);\n\n  return layers;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  var mappedEntries = {};\n  _.forEach(entries, function(entry, i) {\n    var tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (!_.isUndefined(entry.barycenter)) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  _.forEach(cg.edges(), function(e) {\n    var entryV = mappedEntries[e.v];\n    var entryW = mappedEntries[e.w];\n    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  var sourceSet = _.filter(mappedEntries, function(entry) {\n    return !entry.indegree;\n  });\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  var entries = [];\n\n  function handleIn(vEntry) {\n    return function(uEntry) {\n      if (uEntry.merged) {\n        return;\n      }\n      if (_.isUndefined(uEntry.barycenter) ||\n          _.isUndefined(vEntry.barycenter) ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return function(wEntry) {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    var entry = sourceSet.pop();\n    entries.push(entry);\n    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n    _.forEach(entry.out, handleOut(entry));\n  }\n\n  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n    function(entry) {\n      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n    });\n\n}\n\nfunction mergeEntries(target, source) {\n  var sum = 0;\n  var weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n","var _ = require(\"../lodash\");\nvar barycenter = require(\"./barycenter\");\nvar resolveConflicts = require(\"./resolve-conflicts\");\nvar sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  var movable = g.children(v);\n  var node = g.node(v);\n  var bl = node ? node.borderLeft : undefined;\n  var br = node ? node.borderRight: undefined;\n  var subgraphs = {};\n\n  if (bl) {\n    movable = _.filter(movable, function(w) {\n      return w !== bl && w !== br;\n    });\n  }\n\n  var barycenters = barycenter(g, movable);\n  _.forEach(barycenters, function(entry) {\n    if (g.children(entry.v).length) {\n      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (_.has(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  var entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  var result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = _.flatten([bl, result.vs, br], true);\n    if (g.predecessors(bl).length) {\n      var blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!_.has(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  _.forEach(entries, function(entry) {\n    entry.vs = _.flatten(entry.vs.map(function(v) {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    }), true);\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!_.isUndefined(target.barycenter)) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n","var _ = require(\"../lodash\");\nvar util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function(entry) {\n    return _.has(entry, \"barycenter\");\n  });\n  var sortable = parts.lhs,\n    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  _.forEach(sortable, function (entry) {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  var result = { vs: _.flatten(vs, true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  var last;\n  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return function(entryV, entryW) {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n","var _ = require(\"./lodash\");\n\nmodule.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  var postorderNums = postorder(g);\n\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var edgeObj = node.edgeObj;\n    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    var path = pathData.path;\n    var lca = pathData.lca;\n    var pathIdx = 0;\n    var pathV = path[pathIdx];\n    var ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  var vPath = [];\n  var wPath = [];\n  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  var parent;\n  var lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  var result = {};\n  var lim = 0;\n\n  function dfs(v) {\n    var low = lim;\n    _.forEach(g.children(v), dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  _.forEach(g.children(), dfs);\n\n  return result;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = _.last(layer);\n\n    _.forEach(layer, function(v, i) {\n      var w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n          _.forEach(g.predecessors(scanNode), function(u) {\n            var uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  var conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    var v;\n    _.forEach(_.range(southPos, southEnd), function(i) {\n      v = south[i];\n      if (g.node(v).dummy) {\n        _.forEach(g.predecessors(v), function(u) {\n          var uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    var prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    _.forEach(south, function(v, southLookahead) {\n      if (g.node(v).dummy === \"border\") {\n        var predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return _.find(g.predecessors(v), function(u) {\n      return g.node(u).dummy;\n    });\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  var conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return _.has(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  var root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, order) {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  _.forEach(layering, function(layer) {\n    var prevIdx = -1;\n    _.forEach(layer, function(v) {\n      var ws = neighborFn(v);\n      if (ws.length) {\n        ws = _.sortBy(ws, function(w) { return pos[w]; });\n        var mp = (ws.length - 1) / 2;\n        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          var w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  var xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    var stack = blockG.nodes();\n    var elem = stack.pop();\n    var visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    var min = blockG.outEdges(elem).reduce(function(acc, e) {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    var node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  _.forEach(align, function(v) {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  var blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  _.forEach(layering, function(layer) {\n    var u;\n    _.forEach(layer, function(v) {\n      var vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return _.minBy(_.values(xss), function (xs) {\n    var max = Number.NEGATIVE_INFINITY;\n    var min = Number.POSITIVE_INFINITY;\n\n    _.forIn(xs, function (x, v) {\n      var halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  var alignToVals = _.values(alignTo),\n    alignToMin = _.min(alignToVals),\n    alignToMax = _.max(alignToVals);\n\n  _.forEach([\"u\", \"d\"], function(vert) {\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      var alignment = vert + horiz,\n        xs = xss[alignment],\n        delta;\n      if (xs === alignTo) return;\n\n      var xsVals = _.values(xs);\n      delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n      if (delta) {\n        xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return _.mapValues(xss.ul, function(ignore, v) {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      var xs = _.sortBy(_.map(xss, v));\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  var layering = util.buildLayerMatrix(g);\n  var conflicts = _.merge(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  var xss = {};\n  var adjustedLayering;\n  _.forEach([\"u\", \"d\"], function(vert) {\n    adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      if (horiz === \"r\") {\n        adjustedLayering = _.map(adjustedLayering, function(inner) {\n          return _.values(inner).reverse();\n        });\n      }\n\n      var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      var xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = _.mapValues(xs, function(x) { return -x; });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  var smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return function(g, v, w) {\n    var vLabel = g.node(v);\n    var wLabel = g.node(w);\n    var sum = 0;\n    var delta;\n\n    sum += vLabel.width / 2;\n    if (_.has(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (_.has(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar util = require(\"../util\");\nvar positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  _.forEach(positionX(g), function(x, v) {\n    g.node(v).x = x;\n  });\n}\n\nfunction positionY(g) {\n  var layering = util.buildLayerMatrix(g);\n  var rankSep = g.graph().ranksep;\n  var prevY = 0;\n  _.forEach(layering, function(layer) {\n    var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n    _.forEach(layer, function(v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    _.forEach(g.nodeEdges(v), function(e) {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  _.forEach(t.nodes(), dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  return _.minBy(g.edges(), function(e) {\n    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n      return slack(g, e);\n    }\n  });\n}\n\nfunction shiftRanks(t, g, delta) {\n  _.forEach(t.nodes(), function(v) {\n    g.node(v).rank += delta;\n  });\n}\n","\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"../graphlib\").alg.preorder;\nvar postorder = require(\"../graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  _.forEach(vs, function(v) {\n    assignCutValue(t, g, v);\n  });\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  _.forEach(g.nodeEdges(child), function(e) {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  _.forEach(tree.neighbors(v), function(w) {\n    if (!_.has(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return _.find(tree.edges(), function(e) {\n    return tree.edge(e).cutvalue < 0;\n  });\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = _.filter(g.edges(), function(edge) {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return _.minBy(candidates, function(edge) { return slack(g, edge); });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  _.forEach(vs, function(v) {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (_.has(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = _.min(_.map(g.outEdges(v), function(e) {\n      return dfs(e.w) - g.edge(e).minlen;\n    }));\n\n    if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n        rank === undefined || // return value of _.map([]) for Lodash 4\n        rank === null) { // return value of _.map([null])\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  _.forEach(g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","/* eslint \"no-console\": off */\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  addDummyNode: addDummyNode,\n  simplify: simplify,\n  asNonCompoundGraph: asNonCompoundGraph,\n  successorWeights: successorWeights,\n  predecessorWeights: predecessorWeights,\n  intersectRect: intersectRect,\n  buildLayerMatrix: buildLayerMatrix,\n  normalizeRanks: normalizeRanks,\n  removeEmptyRanks: removeEmptyRanks,\n  addBorderNode: addBorderNode,\n  maxRank: maxRank,\n  partition: partition,\n  time: time,\n  notime: notime\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = _.uniqueId(name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new Graph().setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  _.forEach(g.edges(), function(e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var sucs = {};\n    _.forEach(g.outEdges(v), function(e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var preds = {};\n    _.forEach(g.inEdges(v), function(e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!_.isUndefined(rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (_.has(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n  var layers = [];\n  _.forEach(g.nodes(), function(v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  _.forEach(layers, function(vs, i) {\n    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      _.forEach(vs, function(v) { g.node(v).rank += delta; });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n  return _.max(_.map(g.nodes(), function(v) {\n    var rank = g.node(v).rank;\n    if (!_.isUndefined(rank)) {\n      return rank;\n    }\n  }));\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  _.forEach(collection, function(value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = _.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n","module.exports = \"0.8.5\";\n",";(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js v10.2.1\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js\r\n   *  Copyright (c) 2020 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\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 = { name: '[object Decimal]' };\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue             abs\r\n   *  ceil\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\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  /*\r\n  // Add aliases to match BigDecimal method names.\r\n  // P.add = P.plus;\r\n  P.subtract = P.minus;\r\n  P.multiply = P.times;\r\n  P.divide = P.div;\r\n  P.remainder = P.mod;\r\n  P.compareTo = P.cmp;\r\n  P.negate = P.neg;\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, y,\r\n      len = x.d.length;\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    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 === '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) return taylorSeries(Ctor, 2, x, x);\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   *  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   *  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   * 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 (v instanceof Decimal) {\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.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.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.name === '[object Decimal]' || 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 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\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","\"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};","/**\n * @license Fraction.js v4.0.12 09/09/2015\n * http://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2015, 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 createError(name) {\n\n    function errorConstructor() {\n      var temp = Error.apply(this, arguments);\n      temp['name'] = this['name'] = name;\n      this['stack'] = temp['stack'];\n      this['message'] = temp['message'];\n    }\n\n    /**\n     * Error constructor\n     *\n     * @constructor\n     */\n    function IntermediateInheritor() { }\n    IntermediateInheritor.prototype = Error.prototype;\n    errorConstructor.prototype = new IntermediateInheritor();\n\n    return errorConstructor;\n  }\n\n  var DivisionByZero = Fraction['DivisionByZero'] = createError('DivisionByZero');\n  var InvalidParameter = Fraction['InvalidParameter'] = createError('InvalidParameter');\n\n  function assign(n, s) {\n\n    if (isNaN(n = parseInt(n, 10))) {\n      throwInvalidParam();\n    }\n    return n * s;\n  }\n\n  function throwInvalidParam() {\n    throw new InvalidParameter();\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    } 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              throwInvalidParam();\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              throwInvalidParam();\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          throwInvalidParam();\n      }\n\n    if (d === 0) {\n      throw new 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    if (!(this instanceof Fraction)) {\n      return new Fraction(a, b);\n    }\n\n    parse(a, b);\n\n    if (Fraction['REDUCE']) {\n      a = gcd(P[\"d\"], P[\"n\"]); // Abuse a\n    } else {\n      a = 1;\n    }\n\n    this[\"s\"] = P[\"s\"];\n    this[\"n\"] = P[\"n\"] / a;\n    this[\"d\"] = P[\"d\"] / a;\n  }\n\n  /**\n   * Boolean global variable to be able to disable automatic reduction of the fraction\n   *\n   */\n  Fraction['REDUCE'] = 1;\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 new Fraction(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 new Fraction(-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 new Fraction(\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 new Fraction(\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 new Fraction(\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 new Fraction(\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 new Fraction(this);\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 new Fraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n      }\n\n      parse(a, b);\n      if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n        Fraction(0, 0); // Throw 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 new Fraction(\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 new Fraction(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 new Fraction;\n      }\n      return new Fraction(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 new Fraction(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 new Fraction(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 new Fraction(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 new Fraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n    },\n\n    /**\n     * Calculates the fraction to some integer exponent\n     *\n     * Ex: new Fraction(-1,2).pow(-3) => -8\n     */\n    \"pow\": function(m) {\n\n      if (m < 0) {\n        return new Fraction(Math.pow(this['s'] * this[\"d\"], -m), Math.pow(this[\"n\"], -m));\n      } else {\n        return new Fraction(Math.pow(this['s'] * this[\"n\"], m), Math.pow(this[\"d\"], m));\n      }\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      // First naive implementation, needs improvement\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return this;\n      }\n\n      var cont = this['abs']()['toContinued']();\n\n      eps = eps || 0.001;\n\n      function rec(a) {\n        if (a.length === 1)\n          return new Fraction(a[0]);\n        return rec(a.slice(1))['inverse']()['add'](a[0]);\n      }\n\n      for (var i = 0; i < cont.length; i++) {\n        var tmp = rec(cont.slice(0, i + 1));\n        if (tmp['sub'](this['abs']())['abs']().valueOf() < eps) {\n          return tmp['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() => \"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 g;\n      var N = this[\"n\"];\n      var D = this[\"d\"];\n\n      if (isNaN(N) || isNaN(D)) {\n        return \"NaN\";\n      }\n\n      if (!Fraction['REDUCE']) {\n        g = gcd(N, D);\n        N /= g;\n        D /= g;\n      }\n\n      dec = dec || 15; // 15 = decimal places when no repitation\n\n      var cycLen = cycleLen(N, D); // Cycle length\n      var cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n      var str = this['s'] === -1 ? \"-\" : \"\";\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","/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (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 lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n","var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    _.each(g.successors(v), dfs);\n    _.each(g.predecessors(v), dfs);\n  }\n\n  _.each(g.nodes(), function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n  if (!_.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n  var acc = [];\n  var visited = {};\n  _.each(vs, function(v) {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    doDfs(g, v, order === \"post\", visited, navigation, acc);\n  });\n  return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!_.has(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) { acc.push(v); }\n    _.each(navigation(v), function(w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) { acc.push(v); }\n  }\n}\n","var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return _.transform(g.nodes(), function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n  }, {});\n}\n","var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function(edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function(v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n","var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return _.filter(tarjan(g), function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function(v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function(w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function(edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function(k) {\n    var rowK = results[k];\n    nodes.forEach(function(i) {\n      var rowI = results[i];\n      nodes.forEach(function(j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n","module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n  var result = new Graph();\n  var parents = {};\n  var pq = new PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  _.each(g.nodes(), function(v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (_.has(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error(\"Input graph is not connected: \" + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++\n    };\n    stack.push(v);\n\n    g.successors(v).forEach(function(w) {\n      if (!_.has(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function(v) {\n    if (!_.has(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (_.has(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!_.has(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      _.each(g.predecessors(node), visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  _.each(g.sinks(), visit);\n\n  if (_.size(visited) !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing","var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nfunction PriorityQueue() {\n  this._arr = [];\n  this._keyIndices = {};\n}\n\n/**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\nPriorityQueue.prototype.size = function() {\n  return this._arr.length;\n};\n\n/**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\nPriorityQueue.prototype.keys = function() {\n  return this._arr.map(function(x) { return x.key; });\n};\n\n/**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\nPriorityQueue.prototype.has = function(key) {\n  return _.has(this._keyIndices, key);\n};\n\n/**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\nPriorityQueue.prototype.priority = function(key) {\n  var index = this._keyIndices[key];\n  if (index !== undefined) {\n    return this._arr[index].priority;\n  }\n};\n\n/**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\nPriorityQueue.prototype.min = function() {\n  if (this.size() === 0) {\n    throw new Error(\"Queue underflow\");\n  }\n  return this._arr[0].key;\n};\n\n/**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\nPriorityQueue.prototype.add = function(key, priority) {\n  var keyIndices = this._keyIndices;\n  key = String(key);\n  if (!_.has(keyIndices, key)) {\n    var arr = this._arr;\n    var index = arr.length;\n    keyIndices[key] = index;\n    arr.push({key: key, priority: priority});\n    this._decrease(index);\n    return true;\n  }\n  return false;\n};\n\n/**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\nPriorityQueue.prototype.removeMin = function() {\n  this._swap(0, this._arr.length - 1);\n  var min = this._arr.pop();\n  delete this._keyIndices[min.key];\n  this._heapify(0);\n  return min.key;\n};\n\n/**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\nPriorityQueue.prototype.decrease = function(key, priority) {\n  var index = this._keyIndices[key];\n  if (priority > this._arr[index].priority) {\n    throw new Error(\"New priority is greater than current priority. \" +\n        \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n  }\n  this._arr[index].priority = priority;\n  this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n  var arr = this._arr;\n  var l = 2 * i;\n  var r = l + 1;\n  var largest = i;\n  if (l < arr.length) {\n    largest = arr[l].priority < arr[largest].priority ? l : largest;\n    if (r < arr.length) {\n      largest = arr[r].priority < arr[largest].priority ? r : largest;\n    }\n    if (largest !== i) {\n      this._swap(i, largest);\n      this._heapify(largest);\n    }\n  }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n  var arr = this._arr;\n  var priority = arr[index].priority;\n  var parent;\n  while (index !== 0) {\n    parent = index >> 1;\n    if (arr[parent].priority < priority) {\n      break;\n    }\n    this._swap(index, parent);\n    index = parent;\n  }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n  var arr = this._arr;\n  var keyIndices = this._keyIndices;\n  var origArrI = arr[i];\n  var origArrJ = arr[j];\n  arr[i] = origArrJ;\n  arr[j] = origArrI;\n  keyIndices[origArrJ.key] = i;\n  keyIndices[origArrI.key] = j;\n};\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n  this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n  this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n  this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n  // Label for the graph itself\n  this._label = undefined;\n\n  // Defaults to be set when creating a new node\n  this._defaultNodeLabelFn = _.constant(undefined);\n\n  // Defaults to be set when creating a new edge\n  this._defaultEdgeLabelFn = _.constant(undefined);\n\n  // v -> label\n  this._nodes = {};\n\n  if (this._isCompound) {\n    // v -> parent\n    this._parent = {};\n\n    // v -> children\n    this._children = {};\n    this._children[GRAPH_NODE] = {};\n  }\n\n  // v -> edgeObj\n  this._in = {};\n\n  // u -> v -> Number\n  this._preds = {};\n\n  // v -> edgeObj\n  this._out = {};\n\n  // v -> w -> Number\n  this._sucs = {};\n\n  // e -> edgeObj\n  this._edgeObjs = {};\n\n  // e -> label\n  this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\n\n/* === Graph functions ========= */\n\nGraph.prototype.isDirected = function() {\n  return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n  return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n  return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n  this._label = label;\n  return this;\n};\n\nGraph.prototype.graph = function() {\n  return this._label;\n};\n\n\n/* === Node functions ========== */\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultNodeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.nodeCount = function() {\n  return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n  return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._in[v]);\n  });\n};\n\nGraph.prototype.sinks = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._out[v]);\n  });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n  var args = arguments;\n  var self = this;\n  _.each(vs, function(v) {\n    if (args.length > 1) {\n      self.setNode(v, value);\n    } else {\n      self.setNode(v);\n    }\n  });\n  return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n  if (_.has(this._nodes, v)) {\n    if (arguments.length > 1) {\n      this._nodes[v] = value;\n    }\n    return this;\n  }\n\n  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n  if (this._isCompound) {\n    this._parent[v] = GRAPH_NODE;\n    this._children[v] = {};\n    this._children[GRAPH_NODE][v] = true;\n  }\n  this._in[v] = {};\n  this._preds[v] = {};\n  this._out[v] = {};\n  this._sucs[v] = {};\n  ++this._nodeCount;\n  return this;\n};\n\nGraph.prototype.node = function(v) {\n  return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n  return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode =  function(v) {\n  var self = this;\n  if (_.has(this._nodes, v)) {\n    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n    delete this._nodes[v];\n    if (this._isCompound) {\n      this._removeFromParentsChildList(v);\n      delete this._parent[v];\n      _.each(this.children(v), function(child) {\n        self.setParent(child);\n      });\n      delete this._children[v];\n    }\n    _.each(_.keys(this._in[v]), removeEdge);\n    delete this._in[v];\n    delete this._preds[v];\n    _.each(_.keys(this._out[v]), removeEdge);\n    delete this._out[v];\n    delete this._sucs[v];\n    --this._nodeCount;\n  }\n  return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n  if (!this._isCompound) {\n    throw new Error(\"Cannot set parent in a non-compound graph\");\n  }\n\n  if (_.isUndefined(parent)) {\n    parent = GRAPH_NODE;\n  } else {\n    // Coerce parent to string\n    parent += \"\";\n    for (var ancestor = parent;\n      !_.isUndefined(ancestor);\n      ancestor = this.parent(ancestor)) {\n      if (ancestor === v) {\n        throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n                        \" would create a cycle\");\n      }\n    }\n\n    this.setNode(parent);\n  }\n\n  this.setNode(v);\n  this._removeFromParentsChildList(v);\n  this._parent[v] = parent;\n  this._children[parent][v] = true;\n  return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n  delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n  if (this._isCompound) {\n    var parent = this._parent[v];\n    if (parent !== GRAPH_NODE) {\n      return parent;\n    }\n  }\n};\n\nGraph.prototype.children = function(v) {\n  if (_.isUndefined(v)) {\n    v = GRAPH_NODE;\n  }\n\n  if (this._isCompound) {\n    var children = this._children[v];\n    if (children) {\n      return _.keys(children);\n    }\n  } else if (v === GRAPH_NODE) {\n    return this.nodes();\n  } else if (this.hasNode(v)) {\n    return [];\n  }\n};\n\nGraph.prototype.predecessors = function(v) {\n  var predsV = this._preds[v];\n  if (predsV) {\n    return _.keys(predsV);\n  }\n};\n\nGraph.prototype.successors = function(v) {\n  var sucsV = this._sucs[v];\n  if (sucsV) {\n    return _.keys(sucsV);\n  }\n};\n\nGraph.prototype.neighbors = function(v) {\n  var preds = this.predecessors(v);\n  if (preds) {\n    return _.union(preds, this.successors(v));\n  }\n};\n\nGraph.prototype.isLeaf = function (v) {\n  var neighbors;\n  if (this.isDirected()) {\n    neighbors = this.successors(v);\n  } else {\n    neighbors = this.neighbors(v);\n  }\n  return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n  var copy = new this.constructor({\n    directed: this._isDirected,\n    multigraph: this._isMultigraph,\n    compound: this._isCompound\n  });\n\n  copy.setGraph(this.graph());\n\n  var self = this;\n  _.each(this._nodes, function(value, v) {\n    if (filter(v)) {\n      copy.setNode(v, value);\n    }\n  });\n\n  _.each(this._edgeObjs, function(e) {\n    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n      copy.setEdge(e, self.edge(e));\n    }\n  });\n\n  var parents = {};\n  function findParent(v) {\n    var parent = self.parent(v);\n    if (parent === undefined || copy.hasNode(parent)) {\n      parents[v] = parent;\n      return parent;\n    } else if (parent in parents) {\n      return parents[parent];\n    } else {\n      return findParent(parent);\n    }\n  }\n\n  if (this._isCompound) {\n    _.each(copy.nodes(), function(v) {\n      copy.setParent(v, findParent(v));\n    });\n  }\n\n  return copy;\n};\n\n/* === Edge functions ========== */\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultEdgeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.edgeCount = function() {\n  return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n  return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n  var self = this;\n  var args = arguments;\n  _.reduce(vs, function(v, w) {\n    if (args.length > 1) {\n      self.setEdge(v, w, value);\n    } else {\n      self.setEdge(v, w);\n    }\n    return w;\n  });\n  return this;\n};\n\n/*\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n */\nGraph.prototype.setEdge = function() {\n  var v, w, name, value;\n  var valueSpecified = false;\n  var arg0 = arguments[0];\n\n  if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n    v = arg0.v;\n    w = arg0.w;\n    name = arg0.name;\n    if (arguments.length === 2) {\n      value = arguments[1];\n      valueSpecified = true;\n    }\n  } else {\n    v = arg0;\n    w = arguments[1];\n    name = arguments[3];\n    if (arguments.length > 2) {\n      value = arguments[2];\n      valueSpecified = true;\n    }\n  }\n\n  v = \"\" + v;\n  w = \"\" + w;\n  if (!_.isUndefined(name)) {\n    name = \"\" + name;\n  }\n\n  var e = edgeArgsToId(this._isDirected, v, w, name);\n  if (_.has(this._edgeLabels, e)) {\n    if (valueSpecified) {\n      this._edgeLabels[e] = value;\n    }\n    return this;\n  }\n\n  if (!_.isUndefined(name) && !this._isMultigraph) {\n    throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n  }\n\n  // It didn't exist, so we need to create it.\n  // First ensure the nodes exist.\n  this.setNode(v);\n  this.setNode(w);\n\n  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n  // Ensure we add undirected edges in a consistent way.\n  v = edgeObj.v;\n  w = edgeObj.w;\n\n  Object.freeze(edgeObj);\n  this._edgeObjs[e] = edgeObj;\n  incrementOrInitEntry(this._preds[w], v);\n  incrementOrInitEntry(this._sucs[v], w);\n  this._in[w][e] = edgeObj;\n  this._out[v][e] = edgeObj;\n  this._edgeCount++;\n  return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  var edge = this._edgeObjs[e];\n  if (edge) {\n    v = edge.v;\n    w = edge.w;\n    delete this._edgeLabels[e];\n    delete this._edgeObjs[e];\n    decrementOrRemoveEntry(this._preds[w], v);\n    decrementOrRemoveEntry(this._sucs[v], w);\n    delete this._in[w][e];\n    delete this._out[v][e];\n    this._edgeCount--;\n  }\n  return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n  var inV = this._in[v];\n  if (inV) {\n    var edges = _.values(inV);\n    if (!u) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.v === u; });\n  }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n  var outV = this._out[v];\n  if (outV) {\n    var edges = _.values(outV);\n    if (!w) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.w === w; });\n  }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n  var inEdges = this.inEdges(v, w);\n  if (inEdges) {\n    return inEdges.concat(this.outEdges(v, w));\n  }\n};\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return _.map(g.edges(), function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      clone: require(\"lodash/clone\"),\n      constant: require(\"lodash/constant\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      has:  require(\"lodash/has\"),\n      isArray: require(\"lodash/isArray\"),\n      isEmpty: require(\"lodash/isEmpty\"),\n      isFunction: require(\"lodash/isFunction\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      keys: require(\"lodash/keys\"),\n      map: require(\"lodash/map\"),\n      reduce: require(\"lodash/reduce\"),\n      size: require(\"lodash/size\"),\n      transform: require(\"lodash/transform\"),\n      union: require(\"lodash/union\"),\n      values: require(\"lodash/values\")\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n","module.exports = '2.1.8';\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 getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nmodule.exports = arrayEach;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n","/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nmodule.exports = arrayReduce;\n","/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arraySome;\n","var baseProperty = require('./_baseProperty');\n\n/**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignMergeValue(object, key, value) {\n  if ((value !== undefined && !eq(object[key], value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignMergeValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var copyObject = require('./_copyObject'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n","var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var Stack = require('./_Stack'),\n    arrayEach = require('./_arrayEach'),\n    assignValue = require('./_assignValue'),\n    baseAssign = require('./_baseAssign'),\n    baseAssignIn = require('./_baseAssignIn'),\n    cloneBuffer = require('./_cloneBuffer'),\n    copyArray = require('./_copyArray'),\n    copySymbols = require('./_copySymbols'),\n    copySymbolsIn = require('./_copySymbolsIn'),\n    getAllKeys = require('./_getAllKeys'),\n    getAllKeysIn = require('./_getAllKeysIn'),\n    getTag = require('./_getTag'),\n    initCloneArray = require('./_initCloneArray'),\n    initCloneByTag = require('./_initCloneByTag'),\n    initCloneObject = require('./_initCloneObject'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isMap = require('./isMap'),\n    isObject = require('./isObject'),\n    isSet = require('./isSet'),\n    keys = require('./keys'),\n    keysIn = require('./keysIn');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Deep clone\n *  2 - Flatten inherited properties\n *  4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n  var result,\n      isDeep = bitmask & CLONE_DEEP_FLAG,\n      isFlat = bitmask & CLONE_FLAT_FLAG,\n      isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n  if (customizer) {\n    result = object ? customizer(value, key, object, stack) : customizer(value);\n  }\n  if (result !== undefined) {\n    return result;\n  }\n  if (!isObject(value)) {\n    return value;\n  }\n  var isArr = isArray(value);\n  if (isArr) {\n    result = initCloneArray(value);\n    if (!isDeep) {\n      return copyArray(value, result);\n    }\n  } else {\n    var tag = getTag(value),\n        isFunc = tag == funcTag || tag == genTag;\n\n    if (isBuffer(value)) {\n      return cloneBuffer(value, isDeep);\n    }\n    if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n      result = (isFlat || isFunc) ? {} : initCloneObject(value);\n      if (!isDeep) {\n        return isFlat\n          ? copySymbolsIn(value, baseAssignIn(result, value))\n          : copySymbols(value, baseAssign(result, value));\n      }\n    } else {\n      if (!cloneableTags[tag]) {\n        return object ? value : {};\n      }\n      result = initCloneByTag(value, tag, isDeep);\n    }\n  }\n  // Check for circular references and return its corresponding clone.\n  stack || (stack = new Stack);\n  var stacked = stack.get(value);\n  if (stacked) {\n    return stacked;\n  }\n  stack.set(value, result);\n\n  if (isSet(value)) {\n    value.forEach(function(subValue) {\n      result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n    });\n  } else if (isMap(value)) {\n    value.forEach(function(subValue, key) {\n      result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n    });\n  }\n\n  var keysFunc = isFull\n    ? (isFlat ? getAllKeysIn : getAllKeys)\n    : (isFlat ? keysIn : keys);\n\n  var props = isArr ? undefined : keysFunc(value);\n  arrayEach(props || value, function(subValue, key) {\n    if (props) {\n      key = subValue;\n      subValue = value[key];\n    }\n    // Recursively populate clone (susceptible to call stack limits).\n    assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n  });\n  return result;\n}\n\nmodule.exports = baseClone;\n","var isObject = require('./isObject');\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\nmodule.exports = baseCreate;\n","var baseForOwn = require('./_baseForOwn'),\n    createBaseEach = require('./_createBaseEach');\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\n","var isSymbol = require('./isSymbol');\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n  var index = -1,\n      length = array.length;\n\n  while (++index < length) {\n    var value = array[index],\n        current = iteratee(value);\n\n    if (current != null && (computed === undefined\n          ? (current === current && !isSymbol(current))\n          : comparator(current, computed)\n        )) {\n      var computed = current,\n          result = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseExtremum;\n","var baseEach = require('./_baseEach');\n\n/**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction baseFilter(collection, predicate) {\n  var result = [];\n  baseEach(collection, function(value, index, collection) {\n    if (predicate(value, index, collection)) {\n      result.push(value);\n    }\n  });\n  return result;\n}\n\nmodule.exports = baseFilter;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","var arrayPush = require('./_arrayPush'),\n    isFlattenable = require('./_isFlattenable');\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseFlatten;\n","var createBaseFor = require('./_createBaseFor');\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nmodule.exports = baseFor;\n","var baseFor = require('./_baseFor'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nmodule.exports = baseForOwn;\n","var castPath = require('./_castPath'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n","var arrayPush = require('./_arrayPush'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","/**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n *  else `false`.\n */\nfunction baseGt(value, other) {\n  return value > other;\n}\n\nmodule.exports = baseGt;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHas(object, key) {\n  return object != null && hasOwnProperty.call(object, key);\n}\n\nmodule.exports = baseHas;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var baseIsEqualDeep = require('./_baseIsEqualDeep'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nmodule.exports = baseIsEqual;\n","var Stack = require('./_Stack'),\n    equalArrays = require('./_equalArrays'),\n    equalByTag = require('./_equalByTag'),\n    equalObjects = require('./_equalObjects'),\n    getTag = require('./_getTag'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nmodule.exports = baseIsEqualDeep;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\n\n/**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nmodule.exports = baseIsMap;\n","var Stack = require('./_Stack'),\n    baseIsEqual = require('./_baseIsEqual');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nmodule.exports = baseIsMatch;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\n\n/**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nmodule.exports = baseIsSet;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","var baseMatches = require('./_baseMatches'),\n    baseMatchesProperty = require('./_baseMatchesProperty'),\n    identity = require('./identity'),\n    isArray = require('./isArray'),\n    property = require('./property');\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nmodule.exports = baseIteratee;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","var isObject = require('./isObject'),\n    isPrototype = require('./_isPrototype'),\n    nativeKeysIn = require('./_nativeKeysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeysIn;\n","/**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n *  else `false`.\n */\nfunction baseLt(value, other) {\n  return value < other;\n}\n\nmodule.exports = baseLt;\n","var baseEach = require('./_baseEach'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nmodule.exports = baseMap;\n","var baseIsMatch = require('./_baseIsMatch'),\n    getMatchData = require('./_getMatchData'),\n    matchesStrictComparable = require('./_matchesStrictComparable');\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nmodule.exports = baseMatches;\n","var baseIsEqual = require('./_baseIsEqual'),\n    get = require('./get'),\n    hasIn = require('./hasIn'),\n    isKey = require('./_isKey'),\n    isStrictComparable = require('./_isStrictComparable'),\n    matchesStrictComparable = require('./_matchesStrictComparable'),\n    toKey = require('./_toKey');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nmodule.exports = baseMatchesProperty;\n","var Stack = require('./_Stack'),\n    assignMergeValue = require('./_assignMergeValue'),\n    baseFor = require('./_baseFor'),\n    baseMergeDeep = require('./_baseMergeDeep'),\n    isObject = require('./isObject'),\n    keysIn = require('./keysIn'),\n    safeGet = require('./_safeGet');\n\n/**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n  if (object === source) {\n    return;\n  }\n  baseFor(source, function(srcValue, key) {\n    stack || (stack = new Stack);\n    if (isObject(srcValue)) {\n      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n    }\n    else {\n      var newValue = customizer\n        ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      if (newValue === undefined) {\n        newValue = srcValue;\n      }\n      assignMergeValue(object, key, newValue);\n    }\n  }, keysIn);\n}\n\nmodule.exports = baseMerge;\n","var assignMergeValue = require('./_assignMergeValue'),\n    cloneBuffer = require('./_cloneBuffer'),\n    cloneTypedArray = require('./_cloneTypedArray'),\n    copyArray = require('./_copyArray'),\n    initCloneObject = require('./_initCloneObject'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    isBuffer = require('./isBuffer'),\n    isFunction = require('./isFunction'),\n    isObject = require('./isObject'),\n    isPlainObject = require('./isPlainObject'),\n    isTypedArray = require('./isTypedArray'),\n    safeGet = require('./_safeGet'),\n    toPlainObject = require('./toPlainObject');\n\n/**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n  var objValue = safeGet(object, key),\n      srcValue = safeGet(source, key),\n      stacked = stack.get(srcValue);\n\n  if (stacked) {\n    assignMergeValue(object, key, stacked);\n    return;\n  }\n  var newValue = customizer\n    ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n    : undefined;\n\n  var isCommon = newValue === undefined;\n\n  if (isCommon) {\n    var isArr = isArray(srcValue),\n        isBuff = !isArr && isBuffer(srcValue),\n        isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n    newValue = srcValue;\n    if (isArr || isBuff || isTyped) {\n      if (isArray(objValue)) {\n        newValue = objValue;\n      }\n      else if (isArrayLikeObject(objValue)) {\n        newValue = copyArray(objValue);\n      }\n      else if (isBuff) {\n        isCommon = false;\n        newValue = cloneBuffer(srcValue, true);\n      }\n      else if (isTyped) {\n        isCommon = false;\n        newValue = cloneTypedArray(srcValue, true);\n      }\n      else {\n        newValue = [];\n      }\n    }\n    else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n      newValue = objValue;\n      if (isArguments(objValue)) {\n        newValue = toPlainObject(objValue);\n      }\n      else if (!isObject(objValue) || isFunction(objValue)) {\n        newValue = initCloneObject(srcValue);\n      }\n    }\n    else {\n      isCommon = false;\n    }\n  }\n  if (isCommon) {\n    // Recursively merge objects and arrays (susceptible to call stack limits).\n    stack.set(srcValue, newValue);\n    mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n    stack['delete'](srcValue);\n  }\n  assignMergeValue(object, key, newValue);\n}\n\nmodule.exports = baseMergeDeep;\n","var arrayMap = require('./_arrayMap'),\n    baseGet = require('./_baseGet'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    baseSortBy = require('./_baseSortBy'),\n    baseUnary = require('./_baseUnary'),\n    compareMultiple = require('./_compareMultiple'),\n    identity = require('./identity'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\nfunction baseOrderBy(collection, iteratees, orders) {\n  if (iteratees.length) {\n    iteratees = arrayMap(iteratees, function(iteratee) {\n      if (isArray(iteratee)) {\n        return function(value) {\n          return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n        }\n      }\n      return iteratee;\n    });\n  } else {\n    iteratees = [identity];\n  }\n\n  var index = -1;\n  iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n  var result = baseMap(collection, function(value, key, collection) {\n    var criteria = arrayMap(iteratees, function(iteratee) {\n      return iteratee(value);\n    });\n    return { 'criteria': criteria, 'index': ++index, 'value': value };\n  });\n\n  return baseSortBy(result, function(object, other) {\n    return compareMultiple(object, other, orders);\n  });\n}\n\nmodule.exports = baseOrderBy;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = baseProperty;\n","var baseGet = require('./_baseGet');\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nmodule.exports = basePropertyDeep;\n","/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\nfunction baseRange(start, end, step, fromRight) {\n  var index = -1,\n      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n      result = Array(length);\n\n  while (length--) {\n    result[fromRight ? length : ++index] = start;\n    start += step;\n  }\n  return result;\n}\n\nmodule.exports = baseRange;\n","/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nmodule.exports = baseReduce;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var constant = require('./constant'),\n    defineProperty = require('./_defineProperty'),\n    identity = require('./identity');\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nmodule.exports = baseSetToString;\n","/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nmodule.exports = baseSortBy;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nmodule.exports = baseTrim;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var arrayMap = require('./_arrayMap');\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nmodule.exports = baseValues;\n","/**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\nfunction baseZipObject(props, values, assignFunc) {\n  var index = -1,\n      length = props.length,\n      valsLength = values.length,\n      result = {};\n\n  while (++index < length) {\n    var value = index < valsLength ? values[index] : undefined;\n    assignFunc(result, props[index], value);\n  }\n  return result;\n}\n\nmodule.exports = baseZipObject;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var identity = require('./identity');\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","var isArray = require('./isArray'),\n    isKey = require('./_isKey'),\n    stringToPath = require('./_stringToPath'),\n    toString = require('./toString');\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var Uint8Array = require('./_Uint8Array');\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var root = require('./_root');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nmodule.exports = cloneBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nmodule.exports = cloneDataView;\n","/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\nmodule.exports = cloneRegExp;\n","var Symbol = require('./_Symbol');\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nmodule.exports = cloneSymbol;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\n","var isSymbol = require('./isSymbol');\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = isSymbol(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = isSymbol(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\nmodule.exports = compareAscending;\n","var compareAscending = require('./_compareAscending');\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\nmodule.exports = compareMultiple;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nmodule.exports = copyArray;\n","var assignValue = require('./_assignValue'),\n    baseAssignValue = require('./_baseAssignValue');\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\nmodule.exports = copyObject;\n","var copyObject = require('./_copyObject'),\n    getSymbols = require('./_getSymbols');\n\n/**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\nmodule.exports = copySymbols;\n","var copyObject = require('./_copyObject'),\n    getSymbolsIn = require('./_getSymbolsIn');\n\n/**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbolsIn(source, object) {\n  return copyObject(source, getSymbolsIn(source), object);\n}\n\nmodule.exports = copySymbolsIn;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","var baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function(object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = (assigner.length > 3 && typeof customizer == 'function')\n      ? (length--, customizer)\n      : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\nmodule.exports = createAssigner;\n","var isArrayLike = require('./isArrayLike');\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nmodule.exports = createBaseEach;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nmodule.exports = createBaseFor;\n","var baseIteratee = require('./_baseIteratee'),\n    isArrayLike = require('./isArrayLike'),\n    keys = require('./keys');\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nmodule.exports = createFind;\n","var baseRange = require('./_baseRange'),\n    isIterateeCall = require('./_isIterateeCall'),\n    toFinite = require('./toFinite');\n\n/**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\nfunction createRange(fromRight) {\n  return function(start, end, step) {\n    if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n      end = step = undefined;\n    }\n    // Ensure the sign of `-0` is preserved.\n    start = toFinite(start);\n    if (end === undefined) {\n      end = start;\n      start = 0;\n    } else {\n      end = toFinite(end);\n    }\n    step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n    return baseRange(start, end, step, fromRight);\n  };\n}\n\nmodule.exports = createRange;\n","var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var SetCache = require('./_SetCache'),\n    arraySome = require('./_arraySome'),\n    cacheHas = require('./_cacheHas');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalArrays;\n","var Symbol = require('./_Symbol'),\n    Uint8Array = require('./_Uint8Array'),\n    eq = require('./eq'),\n    equalArrays = require('./_equalArrays'),\n    mapToArray = require('./_mapToArray'),\n    setToArray = require('./_setToArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nmodule.exports = equalByTag;\n","var getAllKeys = require('./_getAllKeys');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalObjects;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbolsIn = require('./_getSymbolsIn'),\n    keysIn = require('./keysIn');\n\n/**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeysIn(object) {\n  return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nmodule.exports = getAllKeysIn;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","var isStrictComparable = require('./_isStrictComparable'),\n    keys = require('./keys');\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nmodule.exports = getMatchData;\n","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","var arrayFilter = require('./_arrayFilter'),\n    stubArray = require('./stubArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nmodule.exports = getSymbols;\n","var arrayPush = require('./_arrayPush'),\n    getPrototype = require('./_getPrototype'),\n    getSymbols = require('./_getSymbols'),\n    stubArray = require('./stubArray');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n  var result = [];\n  while (object) {\n    arrayPush(result, getSymbols(object));\n    object = getPrototype(object);\n  }\n  return result;\n};\n\nmodule.exports = getSymbolsIn;\n","var DataView = require('./_DataView'),\n    Map = require('./_Map'),\n    Promise = require('./_Promise'),\n    Set = require('./_Set'),\n    WeakMap = require('./_WeakMap'),\n    baseGetTag = require('./_baseGetTag'),\n    toSource = require('./_toSource');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nmodule.exports = getTag;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = new array.constructor(length);\n\n  // Add properties assigned by `RegExp#exec`.\n  if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n    result.index = array.index;\n    result.input = array.input;\n  }\n  return result;\n}\n\nmodule.exports = initCloneArray;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer'),\n    cloneDataView = require('./_cloneDataView'),\n    cloneRegExp = require('./_cloneRegExp'),\n    cloneSymbol = require('./_cloneSymbol'),\n    cloneTypedArray = require('./_cloneTypedArray');\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, isDeep) {\n  var Ctor = object.constructor;\n  switch (tag) {\n    case arrayBufferTag:\n      return cloneArrayBuffer(object);\n\n    case boolTag:\n    case dateTag:\n      return new Ctor(+object);\n\n    case dataViewTag:\n      return cloneDataView(object, isDeep);\n\n    case float32Tag: case float64Tag:\n    case int8Tag: case int16Tag: case int32Tag:\n    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n      return cloneTypedArray(object, isDeep);\n\n    case mapTag:\n      return new Ctor;\n\n    case numberTag:\n    case stringTag:\n      return new Ctor(object);\n\n    case regexpTag:\n      return cloneRegExp(object);\n\n    case setTag:\n      return new Ctor;\n\n    case symbolTag:\n      return cloneSymbol(object);\n  }\n}\n\nmodule.exports = initCloneByTag;\n","var baseCreate = require('./_baseCreate'),\n    getPrototype = require('./_getPrototype'),\n    isPrototype = require('./_isPrototype');\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nmodule.exports = initCloneObject;\n","var Symbol = require('./_Symbol'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray');\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","var eq = require('./eq'),\n    isArrayLike = require('./isArrayLike'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject');\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\nmodule.exports = isIterateeCall;\n","var isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","var isObject = require('./isObject');\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nmodule.exports = isStrictComparable;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nmodule.exports = mapToArray;\n","/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nmodule.exports = matchesStrictComparable;\n","var memoize = require('./memoize');\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nmodule.exports = memoizeCapped;\n","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = nativeKeysIn;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nmodule.exports = overRest;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","/**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction safeGet(object, key) {\n  if (key === 'constructor' && typeof object[key] === 'function') {\n    return;\n  }\n\n  if (key == '__proto__') {\n    return;\n  }\n\n  return object[key];\n}\n\nmodule.exports = safeGet;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nmodule.exports = setToArray;\n","var baseSetToString = require('./_baseSetToString'),\n    shortOut = require('./_shortOut');\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nmodule.exports = shortOut;\n","var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var asciiSize = require('./_asciiSize'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeSize = require('./_unicodeSize');\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n  return hasUnicode(string)\n    ? unicodeSize(string)\n    : asciiSize(string);\n}\n\nmodule.exports = stringSize;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nmodule.exports = stringToPath;\n","var isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nfunction unicodeSize(string) {\n  var result = reUnicode.lastIndex = 0;\n  while (reUnicode.test(string)) {\n    ++result;\n  }\n  return result;\n}\n\nmodule.exports = unicodeSize;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = clone;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nmodule.exports = constant;\n","var baseRest = require('./_baseRest'),\n    eq = require('./eq'),\n    isIterateeCall = require('./_isIterateeCall'),\n    keysIn = require('./keysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar defaults = baseRest(function(object, sources) {\n  object = Object(object);\n\n  var index = -1;\n  var length = sources.length;\n  var guard = length > 2 ? sources[2] : undefined;\n\n  if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n    length = 1;\n  }\n\n  while (++index < length) {\n    var source = sources[index];\n    var props = keysIn(source);\n    var propsIndex = -1;\n    var propsLength = props.length;\n\n    while (++propsIndex < propsLength) {\n      var key = props[propsIndex];\n      var value = object[key];\n\n      if (value === undefined ||\n          (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        object[key] = source[key];\n      }\n    }\n  }\n\n  return object;\n});\n\nmodule.exports = defaults;\n","module.exports = require('./forEach');\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var arrayFilter = require('./_arrayFilter'),\n    baseFilter = require('./_baseFilter'),\n    baseIteratee = require('./_baseIteratee'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': true },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\nfunction filter(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nmodule.exports = filter;\n","var createFind = require('./_createFind'),\n    findIndex = require('./findIndex');\n\n/**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'age': 36, 'active': true },\n *   { 'user': 'fred',    'age': 40, 'active': false },\n *   { 'user': 'pebbles', 'age': 1,  'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\nvar find = createFind(findIndex);\n\nmodule.exports = find;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIteratee = require('./_baseIteratee'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nmodule.exports = findIndex;\n","var baseFlatten = require('./_baseFlatten');\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nmodule.exports = flatten;\n","var arrayEach = require('./_arrayEach'),\n    baseEach = require('./_baseEach'),\n    castFunction = require('./_castFunction'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n *   console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forEach(collection, iteratee) {\n  var func = isArray(collection) ? arrayEach : baseEach;\n  return func(collection, castFunction(iteratee));\n}\n\nmodule.exports = forEach;\n","var baseFor = require('./_baseFor'),\n    castFunction = require('./_castFunction'),\n    keysIn = require('./keysIn');\n\n/**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\nfunction forIn(object, iteratee) {\n  return object == null\n    ? object\n    : baseFor(object, castFunction(iteratee), keysIn);\n}\n\nmodule.exports = forIn;\n","var baseGet = require('./_baseGet');\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n","var baseHas = require('./_baseHas'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\nfunction has(object, path) {\n  return object != null && hasPath(object, path, baseHas);\n}\n\nmodule.exports = has;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","var baseKeys = require('./_baseKeys'),\n    getTag = require('./_getTag'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLike = require('./isArrayLike'),\n    isBuffer = require('./isBuffer'),\n    isPrototype = require('./_isPrototype'),\n    isTypedArray = require('./isTypedArray');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\nfunction isEmpty(value) {\n  if (value == null) {\n    return true;\n  }\n  if (isArrayLike(value) &&\n      (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n        isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n    return !value.length;\n  }\n  var tag = getTag(value);\n  if (tag == mapTag || tag == setTag) {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !baseKeys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nmodule.exports = isEmpty;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","var baseIsMap = require('./_baseIsMap'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nmodule.exports = isMap;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseGetTag = require('./_baseGetTag'),\n    getPrototype = require('./_getPrototype'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","var baseIsSet = require('./_baseIsSet'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n","var baseGetTag = require('./_baseGetTag'),\n    isArray = require('./isArray'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","/**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\nfunction isUndefined(value) {\n  return value === undefined;\n}\n\nmodule.exports = isUndefined;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeysIn = require('./_baseKeysIn'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nmodule.exports = last;\n","var arrayMap = require('./_arrayMap'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    isArray = require('./isArray');\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nmodule.exports = map;\n","var baseAssignValue = require('./_baseAssignValue'),\n    baseForOwn = require('./_baseForOwn'),\n    baseIteratee = require('./_baseIteratee');\n\n/**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n *   'fred':    { 'user': 'fred',    'age': 40 },\n *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\nfunction mapValues(object, iteratee) {\n  var result = {};\n  iteratee = baseIteratee(iteratee, 3);\n\n  baseForOwn(object, function(value, key, object) {\n    baseAssignValue(result, key, iteratee(value, key, object));\n  });\n  return result;\n}\n\nmodule.exports = mapValues;\n","var baseExtremum = require('./_baseExtremum'),\n    baseGt = require('./_baseGt'),\n    identity = require('./identity');\n\n/**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\nfunction max(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseGt)\n    : undefined;\n}\n\nmodule.exports = max;\n","var MapCache = require('./_MapCache');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","var baseMerge = require('./_baseMerge'),\n    createAssigner = require('./_createAssigner');\n\n/**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n *   'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n *   'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\nvar merge = createAssigner(function(object, source, srcIndex) {\n  baseMerge(object, source, srcIndex);\n});\n\nmodule.exports = merge;\n","var baseExtremum = require('./_baseExtremum'),\n    baseLt = require('./_baseLt'),\n    identity = require('./identity');\n\n/**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\nfunction min(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseLt)\n    : undefined;\n}\n\nmodule.exports = min;\n","var baseExtremum = require('./_baseExtremum'),\n    baseIteratee = require('./_baseIteratee'),\n    baseLt = require('./_baseLt');\n\n/**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\nfunction minBy(array, iteratee) {\n  return (array && array.length)\n    ? baseExtremum(array, baseIteratee(iteratee, 2), baseLt)\n    : undefined;\n}\n\nmodule.exports = minBy;\n","/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nmodule.exports = noop;\n","var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","var baseProperty = require('./_baseProperty'),\n    basePropertyDeep = require('./_basePropertyDeep'),\n    isKey = require('./_isKey'),\n    toKey = require('./_toKey');\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nmodule.exports = property;\n","var createRange = require('./_createRange');\n\n/**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\nvar range = createRange();\n\nmodule.exports = range;\n","var arrayReduce = require('./_arrayReduce'),\n    baseEach = require('./_baseEach'),\n    baseIteratee = require('./_baseIteratee'),\n    baseReduce = require('./_baseReduce'),\n    isArray = require('./isArray');\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nmodule.exports = reduce;\n","var baseKeys = require('./_baseKeys'),\n    getTag = require('./_getTag'),\n    isArrayLike = require('./isArrayLike'),\n    isString = require('./isString'),\n    stringSize = require('./_stringSize');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\nfunction size(collection) {\n  if (collection == null) {\n    return 0;\n  }\n  if (isArrayLike(collection)) {\n    return isString(collection) ? stringSize(collection) : collection.length;\n  }\n  var tag = getTag(collection);\n  if (tag == mapTag || tag == setTag) {\n    return collection.size;\n  }\n  return baseKeys(collection).length;\n}\n\nmodule.exports = size;\n","var baseFlatten = require('./_baseFlatten'),\n    baseOrderBy = require('./_baseOrderBy'),\n    baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n *  The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n *   { 'user': 'fred',   'age': 48 },\n *   { 'user': 'barney', 'age': 36 },\n *   { 'user': 'fred',   'age': 30 },\n *   { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\nvar sortBy = baseRest(function(collection, iteratees) {\n  if (collection == null) {\n    return [];\n  }\n  var length = iteratees.length;\n  if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n    iteratees = [];\n  } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n    iteratees = [iteratees[0]];\n  }\n  return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n});\n\nmodule.exports = sortBy;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nmodule.exports = stubArray;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\nfunction toPlainObject(value) {\n  return copyObject(value, keysIn(value));\n}\n\nmodule.exports = toPlainObject;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","var arrayEach = require('./_arrayEach'),\n    baseCreate = require('./_baseCreate'),\n    baseForOwn = require('./_baseForOwn'),\n    baseIteratee = require('./_baseIteratee'),\n    getPrototype = require('./_getPrototype'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isFunction = require('./isFunction'),\n    isObject = require('./isObject'),\n    isTypedArray = require('./isTypedArray');\n\n/**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n *   result.push(n *= n);\n *   return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\nfunction transform(object, iteratee, accumulator) {\n  var isArr = isArray(object),\n      isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n  iteratee = baseIteratee(iteratee, 4);\n  if (accumulator == null) {\n    var Ctor = object && object.constructor;\n    if (isArrLike) {\n      accumulator = isArr ? new Ctor : [];\n    }\n    else if (isObject(object)) {\n      accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n    }\n    else {\n      accumulator = {};\n    }\n  }\n  (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n    return iteratee(accumulator, value, index, object);\n  });\n  return accumulator;\n}\n\nmodule.exports = transform;\n","var baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    baseUniq = require('./_baseUniq'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\nvar union = baseRest(function(arrays) {\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nmodule.exports = union;\n","var toString = require('./toString');\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","var baseValues = require('./_baseValues'),\n    keys = require('./keys');\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","var assignValue = require('./_assignValue'),\n    baseZipObject = require('./_baseZipObject');\n\n/**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction zipObject(props, values) {\n  return baseZipObject(props || [], values || [], assignValue);\n}\n\nmodule.exports = zipObject;\n","export var DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  epsilon: 1e-12,\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n  // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction\n  number: 'number',\n  // number of significant digits in BigNumbers\n  precision: 64,\n  // predictable output type of functions. When true, output type depends only\n  // on the input types. When false (default), output type can vary depending\n  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n  // predictable is false, and returns `NaN` when true.\n  predictable: false,\n  // random seed for seeded pseudo random number generation\n  // null = randomly seed\n  randomSeed: null\n};","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); }\n\nimport { DEFAULT_CONFIG } from '../core/config.js';\nimport { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js'; // create a read-only version of config\n\nexport var config = /* #__PURE__ */function config(options) {\n  if (options) {\n    throw new Error('The global config is readonly. \\n' + 'Please create a mathjs instance if you want to change the default configuration. \\n' + 'Example:\\n' + '\\n' + '  import { create, all } from \\'mathjs\\';\\n' + '  const mathjs = create(all);\\n' + '  mathjs.config({ number: \\'BigNumber\\' });\\n');\n  }\n\n  return Object.freeze(DEFAULT_CONFIG);\n};\n\n_extends(config, DEFAULT_CONFIG, {\n  MATRIX_OPTIONS,\n  NUMBER_OPTIONS\n});","import { clone, mapObject, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\n\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number\n\nexport function configFactory(config, emit) {\n  /**\n   * Set configuration options for math.js, and get current options.\n   * Will emit a 'config' event, with arguments (curr, prev, changes).\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *\n   *     import { create, all } from 'mathjs'\n   *\n   *     // create a mathjs instance\n   *     const math = create(all)\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.evaluate('0.4')                // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.evaluate('0.4')                // outputs Fraction 2/5\n   *\n   * @param {Object} [options] Available options:\n   *                            {number} epsilon\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {string} matrix\n   *                              A string 'Matrix' (default) or 'Array'.\n   *                            {string} number\n   *                              A string 'number' (default), 'BigNumber', or 'Fraction'\n   *                            {number} precision\n   *                              The number of significant digits for BigNumbers.\n   *                              Not applicable for Numbers.\n   *                            {string} parenthesis\n   *                              How to display parentheses in LaTeX and string\n   *                              output.\n   *                            {string} randomSeed\n   *                              Random seed for seeded pseudo random number generator.\n   *                              Set to null to randomly seed.\n   * @return {Object} Returns the current configuration\n   */\n  function _config(options) {\n    if (options) {\n      var prev = mapObject(config, clone); // validate some of the options\n\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS); // merge options\n\n      deepExtend(config, options);\n      var curr = mapObject(config, clone);\n      var changes = mapObject(options, clone); // emit 'config' event\n\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return mapObject(config, clone);\n    }\n  } // attach the valid options to the function so they can be extended\n\n\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS; // attach the config properties as readonly properties to the config function\n\n  Object.keys(DEFAULT_CONFIG).forEach(key => {\n    Object.defineProperty(_config, key, {\n      get: () => config[key],\n      enumerable: true,\n      configurable: true\n    });\n  });\n  return _config;\n}\n/**\n * Test whether an Array contains a specific item.\n * @param {Array.<string>} array\n * @param {string} item\n * @return {boolean}\n */\n\nfunction contains(array, item) {\n  return array.indexOf(item) !== -1;\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 */\n\n\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !contains(values, options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n  }\n}","// Reserved keywords not allowed to use in the parser\nexport var keywords = {\n  end: true\n};","import { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { deepStrictEqual, hasOwnProperty } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Node';\nvar dependencies = ['mathWithTransform'];\nexport var createNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    mathWithTransform\n  } = _ref;\n\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   * Evaluate the node\n   * @param {Object} [scope]  Scope to read/write variables\n   * @return {*}              Returns the result\n   */\n\n\n  Node.prototype.evaluate = function (scope) {\n    return this.compile().evaluate(scope);\n  };\n\n  Node.prototype.type = 'Node';\n  Node.prototype.isNode = true;\n  Node.prototype.comment = '';\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\n  Node.prototype.compile = function () {\n    var expr = this._compile(mathWithTransform, {});\n\n    var args = {};\n    var context = null;\n\n    function evaluate(scope) {\n      var s = scope || {};\n\n      _validateScope(s);\n\n      return expr(s, args, context);\n    }\n\n    return {\n      evaluate\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\n\n  Node.prototype._compile = function (math, argNames) {\n    throw new Error('Method _compile should be implemented by type ' + this.type);\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\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   * 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\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   * 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\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   * 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\n\n  Node.prototype.traverse = function (callback) {\n    // execute callback for itself\n    // eslint-disable-next-line\n    callback(this, null, null); // recursively traverse over all childs of a node\n\n    function _traverse(node, callback) {\n      node.forEach(function (child, path, parent) {\n        callback(child, path, parent);\n\n        _traverse(child, callback);\n      });\n    }\n\n    _traverse(this, callback);\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\n\n  Node.prototype.transform = function (callback) {\n    function _transform(child, path, parent) {\n      var 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   * 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\n\n  Node.prototype.filter = function (callback) {\n    var nodes = [];\n    this.traverse(function (node, path, parent) {\n      if (callback(node, path, parent)) {\n        nodes.push(node);\n      }\n    });\n    return nodes;\n  };\n  /**\n   * Create a shallow clone of this node\n   * @return {Node}\n   */\n\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   * Create a deep clone of this node\n   * @return {Node}\n   */\n\n\n  Node.prototype.cloneDeep = function () {\n    return this.map(function (node) {\n      return node.cloneDeep();\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\n\n  Node.prototype.equals = function (other) {\n    return other ? deepStrictEqual(this, other) : false;\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\n\n  Node.prototype.toString = function (options) {\n    var customString = this._getCustomString(options);\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this._toString(options);\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\n\n  Node.prototype.toJSON = function () {\n    throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);\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\n\n  Node.prototype.toHTML = function (options) {\n    var customString = this._getCustomString(options);\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this.toHTML(options);\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\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   * 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\n\n  Node.prototype.toTex = function (options) {\n    var customString = this._getCustomString(options);\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this._toTex(options);\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\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   * Helper used by `to...` functions.\n   */\n\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\n        case 'function':\n          return options.handler(this, options);\n\n        default:\n          throw new TypeError('Object or function expected as callback');\n      }\n    }\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  Node.prototype.getIdentifier = function () {\n    return this.type;\n  };\n  /**\n   * Get the content of the current Node.\n   * @return {Node} node\n   **/\n\n\n  Node.prototype.getContent = function () {\n    return this;\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\n\n  function _validateScope(scope) {\n    for (var symbol in scope) {\n      if (hasOwnProperty(scope, symbol)) {\n        if (symbol in keywords) {\n          throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n        }\n      }\n    }\n  }\n\n  return Node;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ArrayNode';\nvar dependencies = ['Node'];\nexport var createArrayNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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 || []; // validate input\n\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  ArrayNode.prototype.type = 'ArrayNode';\n  ArrayNode.prototype.isArrayNode = true;\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\n  ArrayNode.prototype._compile = function (math, argNames) {\n    var evalItems = map(this.items, function (item) {\n      return item._compile(math, argNames);\n    });\n    var asMatrix = math.config.matrix !== 'Array';\n\n    if (asMatrix) {\n      var 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   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ArrayNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.items.length; i++) {\n      var node = this.items[i];\n      callback(node, 'items[' + i + ']', this);\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\n\n  ArrayNode.prototype.map = function (callback) {\n    var items = [];\n\n    for (var i = 0; i < this.items.length; i++) {\n      items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));\n    }\n\n    return new ArrayNode(items);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ArrayNode}\n   */\n\n\n  ArrayNode.prototype.clone = function () {\n    return new ArrayNode(this.items.slice(0));\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ArrayNode.prototype._toString = function (options) {\n    var items = this.items.map(function (node) {\n      return node.toString(options);\n    });\n    return '[' + items.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ArrayNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ArrayNode',\n      items: this.items\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\n\n  ArrayNode.fromJSON = function (json) {\n    return new ArrayNode(json.items);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ArrayNode.prototype.toHTML = function (options) {\n    var 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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ArrayNode.prototype._toTex = function (options) {\n    var s = '\\\\begin{bmatrix}';\n    this.items.forEach(function (node) {\n      if (node.items) {\n        s += node.items.map(function (childNode) {\n          return childNode.toTex(options);\n        }).join('&');\n      } else {\n        s += node.toTex(options);\n      } // new line\n\n\n      s += '\\\\\\\\';\n    });\n    s += '\\\\end{bmatrix}';\n    return s;\n  };\n\n  return ArrayNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\nimport { forEach, map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BlockNode';\nvar dependencies = ['ResultSet', 'Node'];\nexport var createBlockNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    ResultSet,\n    Node\n  } = _ref;\n\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    } // validate input, copy blocks\n\n\n    if (!Array.isArray(blocks)) throw new Error('Array expected');\n    this.blocks = blocks.map(function (block) {\n      var node = block && block.node;\n      var visible = block && block.visible !== undefined ? block.visible : true;\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      return {\n        node: node,\n        visible: visible\n      };\n    });\n  }\n\n  BlockNode.prototype = new Node();\n  BlockNode.prototype.type = 'BlockNode';\n  BlockNode.prototype.isBlockNode = true;\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\n  BlockNode.prototype._compile = function (math, argNames) {\n    var evalBlocks = map(this.blocks, function (block) {\n      return {\n        evaluate: block.node._compile(math, argNames),\n        visible: block.visible\n      };\n    });\n    return function evalBlockNodes(scope, args, context) {\n      var results = [];\n      forEach(evalBlocks, function evalBlockNode(block) {\n        var result = block.evaluate(scope, args, context);\n\n        if (block.visible) {\n          results.push(result);\n        }\n      });\n      return new ResultSet(results);\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\n\n  BlockNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.blocks.length; i++) {\n      callback(this.blocks[i].node, 'blocks[' + i + '].node', this);\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\n\n  BlockNode.prototype.map = function (callback) {\n    var blocks = [];\n\n    for (var i = 0; i < this.blocks.length; i++) {\n      var block = this.blocks[i];\n\n      var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));\n\n      blocks[i] = {\n        node: node,\n        visible: block.visible\n      };\n    }\n\n    return new BlockNode(blocks);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {BlockNode}\n   */\n\n\n  BlockNode.prototype.clone = function () {\n    var blocks = this.blocks.map(function (block) {\n      return {\n        node: block.node,\n        visible: block.visible\n      };\n    });\n    return new BlockNode(blocks);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  BlockNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'BlockNode',\n      blocks: this.blocks\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\n\n  BlockNode.fromJSON = function (json) {\n    return new BlockNode(json.blocks);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\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}, {\n  isClass: true,\n  isNode: true\n});","/* eslint no-template-curly-in-string: \"off\" */\nimport escapeLatexLib from 'escape-latex';\nimport { hasOwnProperty } from './object.js';\nexport var 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',\n  // 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};\nexport var latexOperators = {\n  transpose: '^\\\\top',\n  ctranspose: '^H',\n  factorial: '!',\n  pow: '^',\n  dotPow: '.^\\\\wedge',\n  // TODO find ideal solution\n  unaryPlus: '+',\n  unaryMinus: '-',\n  bitNot: '\\\\~',\n  // TODO find ideal solution\n  not: '\\\\neg',\n  multiply: '\\\\cdot',\n  divide: '\\\\frac',\n  // TODO how to handle that properly?\n  dotMultiply: '.\\\\cdot',\n  // TODO find ideal solution\n  dotDivide: '.:',\n  // 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};\nexport var latexFunctions = {\n  // arithmetic\n  abs: {\n    1: '\\\\left|${args[0]}\\\\right|'\n  },\n  add: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.add, \"${args[1]}\\\\right)\")\n  },\n  cbrt: {\n    1: '\\\\sqrt[3]{${args[0]}}'\n  },\n  ceil: {\n    1: '\\\\left\\\\lceil${args[0]}\\\\right\\\\rceil'\n  },\n  cube: {\n    1: '\\\\left(${args[0]}\\\\right)^3'\n  },\n  divide: {\n    2: '\\\\frac{${args[0]}}{${args[1]}}'\n  },\n  dotDivide: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotDivide, \"${args[1]}\\\\right)\")\n  },\n  dotMultiply: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotMultiply, \"${args[1]}\\\\right)\")\n  },\n  dotPow: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotPow, \"${args[1]}\\\\right)\")\n  },\n  exp: {\n    1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n  },\n  expm1: \"\\\\left(e\".concat(latexOperators.pow, \"{${args[0]}}-1\\\\right)\"),\n  fix: {\n    1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n  },\n  floor: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rfloor'\n  },\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: {\n    1: '\\\\log_{10}\\\\left(${args[0]}\\\\right)'\n  },\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: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.mod, \"${args[1]}\\\\right)\")\n  },\n  multiply: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.multiply, \"${args[1]}\\\\right)\")\n  },\n  norm: {\n    1: '\\\\left\\\\|${args[0]}\\\\right\\\\|',\n    2: undefined // use default template\n\n  },\n  nthRoot: {\n    2: '\\\\sqrt[${args[1]}]{${args[0]}}'\n  },\n  nthRoots: {\n    2: '\\\\{y : $y^{args[1]} = {${args[0]}}\\\\}'\n  },\n  pow: {\n    2: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.pow, \"{${args[1]}}\")\n  },\n  round: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rceil',\n    2: undefined // use default template\n\n  },\n  sign: {\n    1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n  },\n  sqrt: {\n    1: '\\\\sqrt{${args[0]}}'\n  },\n  square: {\n    1: '\\\\left(${args[0]}\\\\right)^2'\n  },\n  subtract: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.subtract, \"${args[1]}\\\\right)\")\n  },\n  unaryMinus: {\n    1: \"\".concat(latexOperators.unaryMinus, \"\\\\left(${args[0]}\\\\right)\")\n  },\n  unaryPlus: {\n    1: \"\".concat(latexOperators.unaryPlus, \"\\\\left(${args[0]}\\\\right)\")\n  },\n  // bitwise\n  bitAnd: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitAnd, \"${args[1]}\\\\right)\")\n  },\n  bitNot: {\n    1: latexOperators.bitNot + '\\\\left(${args[0]}\\\\right)'\n  },\n  bitOr: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitOr, \"${args[1]}\\\\right)\")\n  },\n  bitXor: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitXor, \"${args[1]}\\\\right)\")\n  },\n  leftShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.leftShift, \"${args[1]}\\\\right)\")\n  },\n  rightArithShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.rightArithShift, \"${args[1]}\\\\right)\")\n  },\n  rightLogShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.rightLogShift, \"${args[1]}\\\\right)\")\n  },\n  // combinatorics\n  bellNumbers: {\n    1: '\\\\mathrm{B}_{${args[0]}}'\n  },\n  catalan: {\n    1: '\\\\mathrm{C}_{${args[0]}}'\n  },\n  stirlingS2: {\n    2: '\\\\mathrm{S}\\\\left(${args}\\\\right)'\n  },\n  // complex\n  arg: {\n    1: '\\\\arg\\\\left(${args[0]}\\\\right)'\n  },\n  conj: {\n    1: '\\\\left(${args[0]}\\\\right)^*'\n  },\n  im: {\n    1: '\\\\Im\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n  },\n  re: {\n    1: '\\\\Re\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n  },\n  // logical\n  and: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.and, \"${args[1]}\\\\right)\")\n  },\n  not: {\n    1: latexOperators.not + '\\\\left(${args[0]}\\\\right)'\n  },\n  or: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.or, \"${args[1]}\\\\right)\")\n  },\n  xor: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.xor, \"${args[1]}\\\\right)\")\n  },\n  // matrix\n  cross: {\n    2: '\\\\left(${args[0]}\\\\right)\\\\times\\\\left(${args[1]}\\\\right)'\n  },\n  ctranspose: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.ctranspose)\n  },\n  det: {\n    1: '\\\\det\\\\left(${args[0]}\\\\right)'\n  },\n  dot: {\n    2: '\\\\left(${args[0]}\\\\cdot${args[1]}\\\\right)'\n  },\n  expm: {\n    1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n  },\n  inv: {\n    1: '\\\\left(${args[0]}\\\\right)^{-1}'\n  },\n  sqrtm: {\n    1: \"{${args[0]}}\".concat(latexOperators.pow, \"{\\\\frac{1}{2}}\")\n  },\n  trace: {\n    1: '\\\\mathrm{tr}\\\\left(${args[0]}\\\\right)'\n  },\n  transpose: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.transpose)\n  },\n  // probability\n  combinations: {\n    2: '\\\\binom{${args[0]}}{${args[1]}}'\n  },\n  combinationsWithRep: {\n    2: '\\\\left(\\\\!\\\\!{\\\\binom{${args[0]}}{${args[1]}}}\\\\!\\\\!\\\\right)'\n  },\n  factorial: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.factorial)\n  },\n  gamma: {\n    1: '\\\\Gamma\\\\left(${args[0]}\\\\right)'\n  },\n  // relational\n  equal: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.equal, \"${args[1]}\\\\right)\")\n  },\n  larger: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.larger, \"${args[1]}\\\\right)\")\n  },\n  largerEq: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.largerEq, \"${args[1]}\\\\right)\")\n  },\n  smaller: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.smaller, \"${args[1]}\\\\right)\")\n  },\n  smallerEq: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.smallerEq, \"${args[1]}\\\\right)\")\n  },\n  unequal: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.unequal, \"${args[1]}\\\\right)\")\n  },\n  // special\n  erf: {\n    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  // trigonometry\n  acos: {\n    1: '\\\\cos^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acosh: {\n    1: '\\\\cosh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acot: {\n    1: '\\\\cot^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acoth: {\n    1: '\\\\coth^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acsc: {\n    1: '\\\\csc^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acsch: {\n    1: '\\\\mathrm{csch}^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asec: {\n    1: '\\\\sec^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asech: {\n    1: '\\\\mathrm{sech}^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asin: {\n    1: '\\\\sin^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asinh: {\n    1: '\\\\sinh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  atan: {\n    1: '\\\\tan^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  atan2: {\n    2: '\\\\mathrm{atan2}\\\\left(${args}\\\\right)'\n  },\n  atanh: {\n    1: '\\\\tanh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  cos: {\n    1: '\\\\cos\\\\left(${args[0]}\\\\right)'\n  },\n  cosh: {\n    1: '\\\\cosh\\\\left(${args[0]}\\\\right)'\n  },\n  cot: {\n    1: '\\\\cot\\\\left(${args[0]}\\\\right)'\n  },\n  coth: {\n    1: '\\\\coth\\\\left(${args[0]}\\\\right)'\n  },\n  csc: {\n    1: '\\\\csc\\\\left(${args[0]}\\\\right)'\n  },\n  csch: {\n    1: '\\\\mathrm{csch}\\\\left(${args[0]}\\\\right)'\n  },\n  sec: {\n    1: '\\\\sec\\\\left(${args[0]}\\\\right)'\n  },\n  sech: {\n    1: '\\\\mathrm{sech}\\\\left(${args[0]}\\\\right)'\n  },\n  sin: {\n    1: '\\\\sin\\\\left(${args[0]}\\\\right)'\n  },\n  sinh: {\n    1: '\\\\sinh\\\\left(${args[0]}\\\\right)'\n  },\n  tan: {\n    1: '\\\\tan\\\\left(${args[0]}\\\\right)'\n  },\n  tanh: {\n    1: '\\\\tanh\\\\left(${args[0]}\\\\right)'\n  },\n  // unit\n  to: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.to, \"${args[1]}\\\\right)\")\n  },\n  // utils\n  numeric: function numeric(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  // 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)+\".concat(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};\nexport var defaultTemplate = '\\\\mathrm{${name}}\\\\left(${args}\\\\right)';\nvar latexUnits = {\n  deg: '^\\\\circ'\n};\nexport function escapeLatex(string) {\n  return escapeLatexLib(string, {\n    preserveFormatting: true\n  });\n} // @param {string} name\n// @param {boolean} isUnit\n\nexport function toSymbol(name, isUnit) {\n  isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n\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}","import { format } from '../../utils/string.js';\nimport { typeOf } from '../../utils/is.js';\nimport { escapeLatex } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ConstantNode';\nvar dependencies = ['Node'];\nexport var createConstantNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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  ConstantNode.prototype.type = 'ConstantNode';\n  ConstantNode.prototype.isConstantNode = true;\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\n  ConstantNode.prototype._compile = function (math, argNames) {\n    var value = this.value;\n    return function evalConstantNode() {\n      return value;\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\n\n  ConstantNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs\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\n\n  ConstantNode.prototype.map = function (callback) {\n    return this.clone();\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConstantNode}\n   */\n\n\n  ConstantNode.prototype.clone = function () {\n    return new ConstantNode(this.value);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype._toString = function (options) {\n    return format(this.value, options);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype.toHTML = function (options) {\n    var 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\n      case 'string':\n        return '<span class=\"math-string\">' + value + '</span>';\n\n      case 'boolean':\n        return '<span class=\"math-boolean\">' + value + '</span>';\n\n      case 'null':\n        return '<span class=\"math-null-symbol\">' + value + '</span>';\n\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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ConstantNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ConstantNode',\n      value: this.value\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\n\n  ConstantNode.fromJSON = function (json) {\n    return new ConstantNode(json.value);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype._toTex = function (options) {\n    var 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 ? '-\\\\infty' : '\\\\infty';\n          }\n\n          var index = value.toLowerCase().indexOf('e');\n\n          if (index !== -1) {\n            return value.substring(0, index) + '\\\\cdot10^{' + value.substring(index + 1) + '}';\n          }\n        }\n        return value;\n\n      case 'Fraction':\n        return this.value.toLatex();\n\n      default:\n        return value;\n    }\n  };\n\n  return ConstantNode;\n}, {\n  isClass: true,\n  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';\nvar name = 'ObjectNode';\nvar dependencies = ['Node'];\nexport var createObjectNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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 || {}; // validate input\n\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  ObjectNode.prototype.type = 'ObjectNode';\n  ObjectNode.prototype.isObjectNode = true;\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\n  ObjectNode.prototype._compile = function (math, argNames) {\n    var evalEntries = {};\n\n    for (var 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        var stringifiedKey = stringify(key);\n        var parsedKey = JSON.parse(stringifiedKey);\n\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      var obj = {};\n\n      for (var _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   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ObjectNode.prototype.forEach = function (callback) {\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        callback(this.properties[key], 'properties[' + stringify(key) + ']', this);\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\n\n  ObjectNode.prototype.map = function (callback) {\n    var properties = {};\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + stringify(key) + ']', this));\n      }\n    }\n\n    return new ObjectNode(properties);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ObjectNode}\n   */\n\n\n  ObjectNode.prototype.clone = function () {\n    var properties = {};\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        properties[key] = this.properties[key];\n      }\n    }\n\n    return new ObjectNode(properties);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ObjectNode.prototype._toString = function (options) {\n    var entries = [];\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        entries.push(stringify(key) + ': ' + this.properties[key].toString(options));\n      }\n    }\n\n    return '{' + entries.join(', ') + '}';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ObjectNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ObjectNode',\n      properties: this.properties\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\n\n  ObjectNode.fromJSON = function (json) {\n    return new ObjectNode(json.properties);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ObjectNode.prototype.toHTML = function (options) {\n    var entries = [];\n\n    for (var 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\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ObjectNode.prototype._toTex = function (options) {\n    var entries = [];\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        entries.push('\\\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\\\\\');\n      }\n    }\n\n    return \"\\\\left\\\\{\\\\begin{array}{ll}\".concat(entries.join('\\n'), \"\\\\end{array}\\\\right\\\\}\");\n  };\n\n  return ObjectNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ParenthesisNode';\nvar dependencies = ['Node'];\nexport var createParenthesisNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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    } // validate input\n\n\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  ParenthesisNode.prototype.type = 'ParenthesisNode';\n  ParenthesisNode.prototype.isParenthesisNode = true;\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\n  ParenthesisNode.prototype._compile = function (math, argNames) {\n    return this.content._compile(math, argNames);\n  };\n  /**\n   * Get the content of the current Node.\n   * @return {Node} content\n   * @override\n   **/\n\n\n  ParenthesisNode.prototype.getContent = function () {\n    return this.content.getContent();\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\n\n  ParenthesisNode.prototype.forEach = function (callback) {\n    callback(this.content, 'content', this);\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\n\n  ParenthesisNode.prototype.map = function (callback) {\n    var content = callback(this.content, 'content', this);\n    return new ParenthesisNode(content);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ParenthesisNode}\n   */\n\n\n  ParenthesisNode.prototype.clone = function () {\n    return new ParenthesisNode(this.content);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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\n    return this.content.toString(options);\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ParenthesisNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ParenthesisNode',\n      content: this.content\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\n\n  ParenthesisNode.fromJSON = function (json) {\n    return new ParenthesisNode(json.content);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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\n    return this.content.toHTML(options);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ParenthesisNode.prototype._toTex = function (options) {\n    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n      return \"\\\\left(\".concat(this.content.toTex(options), \"\\\\right)\");\n    }\n\n    return this.content.toTex(options);\n  };\n\n  return ParenthesisNode;\n}, {\n  isClass: true,\n  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';\nexport var properties = [{\n  // assignment\n  AssignmentNode: {},\n  FunctionAssignmentNode: {}\n}, {\n  // conditional expression\n  ConditionalNode: {\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false // conditionals don't need parentheses in LaTeX because\n    // they are 2 dimensional\n\n  }\n}, {\n  // logical or\n  'OperatorNode:or': {\n    associativity: 'left',\n    associativeWith: []\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: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n  },\n  'OperatorNode:divide': {\n    associativity: 'left',\n    associativeWith: [],\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false // fractions don't require parentheses because\n    // they're 2 dimensional, so parens aren't needed\n    // in LaTeX\n\n  },\n  'OperatorNode:dotMultiply': {\n    associativity: 'left',\n    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']\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 // the exponent doesn't need parentheses in\n    // LaTeX because it's 2 dimensional\n    // (it's on top)\n\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 * 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 */\n\nexport function getPrecedence(_node, parenthesis) {\n  var node = _node;\n\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n\n  var identifier = node.getIdentifier();\n\n  for (var i = 0; i < properties.length; i++) {\n    if (identifier in properties[i]) {\n      return i;\n    }\n  }\n\n  return null;\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 */\n\nexport function getAssociativity(_node, parenthesis) {\n  var node = _node;\n\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n\n  var identifier = node.getIdentifier();\n  var index = getPrecedence(node, parenthesis);\n\n  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n\n  var property = properties[index][identifier];\n\n  if (hasOwnProperty(property, 'associativity')) {\n    if (property.associativity === 'left') {\n      return 'left';\n    }\n\n    if (property.associativity === 'right') {\n      return 'right';\n    } // associativity is invalid\n\n\n    throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' + property.associativity + '\\'.');\n  } // associativity is undefined\n\n\n  return null;\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 */\n\nexport function isAssociativeWith(nodeA, nodeB, parenthesis) {\n  // ParenthesisNodes are only ignored when not in 'keep' mode\n  var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;\n  var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;\n  var identifierA = a.getIdentifier();\n  var identifierB = b.getIdentifier();\n  var index = getPrecedence(a, parenthesis);\n\n  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n\n  var property = properties[index][identifierA];\n\n  if (hasOwnProperty(property, 'associativeWith') && property.associativeWith instanceof Array) {\n    for (var i = 0; i < property.associativeWith.length; i++) {\n      if (property.associativeWith[i] === identifierB) {\n        return true;\n      }\n    }\n\n    return false;\n  } // associativeWith is not defined\n\n\n  return null;\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';\nvar name = 'RelationalNode';\nvar dependencies = ['Node'];\nexport var createRelationalNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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\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    this.conditionals = conditionals;\n    this.params = params;\n  }\n\n  RelationalNode.prototype = new Node();\n  RelationalNode.prototype.type = 'RelationalNode';\n  RelationalNode.prototype.isRelationalNode = true;\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\n  RelationalNode.prototype._compile = function (math, argNames) {\n    var self = this;\n    var compiled = this.params.map(p => p._compile(math, argNames));\n    return function evalRelationalNode(scope, args, context) {\n      var evalLhs;\n      var evalRhs = compiled[0](scope, args, context);\n\n      for (var i = 0; i < self.conditionals.length; i++) {\n        evalLhs = evalRhs;\n        evalRhs = compiled[i + 1](scope, args, context);\n        var condFn = getSafeProperty(math, self.conditionals[i]);\n\n        if (!condFn(evalLhs, evalRhs)) {\n          return false;\n        }\n      }\n\n      return true;\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\n\n  RelationalNode.prototype.forEach = function (callback) {\n    this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);\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\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   * Create a clone of this node, a shallow copy\n   * @return {RelationalNode}\n   */\n\n\n  RelationalNode.prototype.clone = function () {\n    return new RelationalNode(this.conditionals, this.params);\n  };\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = getPrecedence(p, parenthesis);\n      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);\n    });\n    var operatorMap = {\n      equal: '==',\n      unequal: '!=',\n      smaller: '<',\n      larger: '>',\n      smallerEq: '<=',\n      largerEq: '>='\n    };\n    var ret = paramStrings[0];\n\n    for (var i = 0; i < this.conditionals.length; i++) {\n      ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1];\n    }\n\n    return ret;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  RelationalNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'RelationalNode',\n      conditionals: this.conditionals,\n      params: this.params\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\n\n  RelationalNode.fromJSON = function (json) {\n    return new RelationalNode(json.conditionals, json.params);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = getPrecedence(p, parenthesis);\n      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);\n    });\n    var operatorMap = {\n      equal: '==',\n      unequal: '!=',\n      smaller: '<',\n      larger: '>',\n      smallerEq: '<=',\n      largerEq: '>='\n    };\n    var ret = paramStrings[0];\n\n    for (var 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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = getPrecedence(p, parenthesis);\n      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\\\left(' + p.toTex(options) + '\\right)' : p.toTex(options);\n    });\n    var ret = paramStrings[0];\n\n    for (var 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}, {\n  isClass: true,\n  isNode: 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';\nvar name = 'Chain';\nvar dependencies = ['?on', 'math'];\nexport var createChainClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    on,\n    math\n  } = _ref;\n\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   * Attach type information\n   */\n\n\n  Chain.prototype.type = 'Chain';\n  Chain.prototype.isChain = true;\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method valueOf()\n   * @returns {*} value\n   */\n\n  Chain.prototype.done = function () {\n    return this.value;\n  };\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method done()\n   * @returns {*} value\n   */\n\n\n  Chain.prototype.valueOf = function () {\n    return this.value;\n  };\n  /**\n   * Get a string representation of the value in the chain\n   * @returns {string}\n   */\n\n\n  Chain.prototype.toString = function () {\n    return format(this.value);\n  };\n  /**\n   * Get a JSON representation of the chain\n   * @returns {Object}\n   */\n\n\n  Chain.prototype.toJSON = function () {\n    return {\n      mathjs: 'Chain',\n      value: this.value\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\n\n  Chain.fromJSON = function (json) {\n    return new Chain(json.value);\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\n\n  function createProxy(name, fn) {\n    if (typeof fn === 'function') {\n      Chain.prototype[name] = chainify(fn);\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\n\n  function createLazyProxy(name, resolver) {\n    lazy(Chain.prototype, name, function outerResolver() {\n      var fn = resolver();\n\n      if (typeof fn === 'function') {\n        return chainify(fn);\n      }\n\n      return undefined; // if not a function, ignore\n    });\n  }\n  /**\n   * Make a function chainable\n   * @param {function} fn\n   * @return {Function} chain function\n   * @private\n   */\n\n\n  function chainify(fn) {\n    return function () {\n      var args = [this.value]; // `this` will be the context of a Chain instance\n\n      for (var 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   * 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\n\n  Chain.createProxy = function (arg0, arg1) {\n    if (typeof arg0 === 'string') {\n      // createProxy(name, value)\n      createProxy(arg0, arg1);\n    } else {\n      var _loop = function _loop(_name) {\n        if (hasOwnProperty(arg0, _name) && excludedNames[_name] === undefined) {\n          createLazyProxy(_name, () => arg0[_name]);\n        }\n      };\n\n      // createProxy(values)\n      for (var _name in arg0) {\n        _loop(_name);\n      }\n    }\n  };\n\n  var 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  }; // create proxy for everything that is in math.js\n\n  Chain.createProxy(math); // register on the import event, automatically add a proxy for every imported function.\n\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}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nvar name = 'reviver';\nvar dependencies = ['classes'];\nexport var createReviver = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    classes\n  } = _ref;\n\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    var 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});","import { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'ConditionalNode';\nvar dependencies = ['Node'];\nexport var createConditionalNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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\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    this.condition = condition;\n    this.trueExpr = trueExpr;\n    this.falseExpr = falseExpr;\n  }\n\n  ConditionalNode.prototype = new Node();\n  ConditionalNode.prototype.type = 'ConditionalNode';\n  ConditionalNode.prototype.isConditionalNode = true;\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\n  ConditionalNode.prototype._compile = function (math, argNames) {\n    var evalCondition = this.condition._compile(math, argNames);\n\n    var evalTrueExpr = this.trueExpr._compile(math, argNames);\n\n    var evalFalseExpr = this.falseExpr._compile(math, argNames);\n\n    return function evalConditionalNode(scope, args, context) {\n      return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);\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\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   * 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\n\n  ConditionalNode.prototype.map = function (callback) {\n    return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConditionalNode}\n   */\n\n\n  ConditionalNode.prototype.clone = function () {\n    return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis); // 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\n    var condition = this.condition.toString(options);\n    var conditionPrecedence = getPrecedence(this.condition, parenthesis);\n\n    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n      condition = '(' + condition + ')';\n    }\n\n    var trueExpr = this.trueExpr.toString(options);\n    var truePrecedence = getPrecedence(this.trueExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n      trueExpr = '(' + trueExpr + ')';\n    }\n\n    var falseExpr = this.falseExpr.toString(options);\n    var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n      falseExpr = '(' + falseExpr + ')';\n    }\n\n    return condition + ' ? ' + trueExpr + ' : ' + falseExpr;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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   * 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\n\n  ConditionalNode.fromJSON = function (json) {\n    return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis); // 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\n    var condition = this.condition.toHTML(options);\n    var conditionPrecedence = getPrecedence(this.condition, parenthesis);\n\n    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || 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    var trueExpr = this.trueExpr.toHTML(options);\n    var truePrecedence = getPrecedence(this.trueExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || 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    var falseExpr = this.falseExpr.toHTML(options);\n    var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || 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\n    return condition + '<span class=\"math-operator math-conditional-operator\">?</span>' + trueExpr + '<span class=\"math-operator math-conditional-operator\">:</span>' + falseExpr;\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype._toTex = function (options) {\n    return '\\\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\\\quad{\\\\text{if }\\\\;' + this.condition.toTex(options) + '}\\\\\\\\{' + this.falseExpr.toTex(options) + '}, &\\\\quad{\\\\text{otherwise}}\\\\end{cases}';\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\n\n  function testCondition(condition) {\n    if (typeof condition === 'number' || typeof condition === 'boolean' || 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}, {\n  isClass: true,\n  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';\nvar name = 'OperatorNode';\nvar dependencies = ['Node'];\nexport var createOperatorNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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   */\n  function OperatorNode(op, fn, args, implicit) {\n    if (!(this instanceof OperatorNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (typeof op !== 'string') {\n      throw new TypeError('string expected for parameter \"op\"');\n    }\n\n    if (typeof fn !== 'string') {\n      throw new TypeError('string expected for parameter \"fn\"');\n    }\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.op = op;\n    this.fn = fn;\n    this.args = args || [];\n  }\n\n  OperatorNode.prototype = new Node();\n  OperatorNode.prototype.type = 'OperatorNode';\n  OperatorNode.prototype.isOperatorNode = true;\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\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    var fn = getSafeProperty(math, this.fn);\n    var evalArgs = map(this.args, function (arg) {\n      return arg._compile(math, argNames);\n    });\n\n    if (evalArgs.length === 1) {\n      var 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      var _evalArg = evalArgs[0];\n      var evalArg1 = evalArgs[1];\n      return function evalOperatorNode(scope, args, context) {\n        return fn(_evalArg(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   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  OperatorNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this);\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\n\n  OperatorNode.prototype.map = function (callback) {\n    var args = [];\n\n    for (var i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n    }\n\n    return new OperatorNode(this.op, this.fn, args, this.implicit);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {OperatorNode}\n   */\n\n\n  OperatorNode.prototype.clone = function () {\n    return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit);\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\n\n  OperatorNode.prototype.isUnary = function () {\n    return this.args.length === 1;\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\n\n  OperatorNode.prototype.isBinary = function () {\n    return this.args.length === 2;\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\n\n  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {\n    // precedence of the root OperatorNode\n    var precedence = getPrecedence(root, parenthesis);\n    var 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) {\n          // Nodes that don't need extra parentheses\n          case 'ArrayNode':\n          case 'ConstantNode':\n          case 'SymbolNode':\n          case 'ParenthesisNode':\n            return false;\n\n          default:\n            return true;\n        }\n      });\n    }\n\n    var result;\n\n    switch (args.length) {\n      case 0:\n        result = [];\n        break;\n\n      case 1:\n        // unary operators\n        {\n          // precedence of the operand\n          var operandPrecedence = getPrecedence(args[0], parenthesis); // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n          if (latex && operandPrecedence !== null) {\n            var operandIdentifier;\n            var rootIdentifier;\n\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\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          } // otherwise, no parens needed\n\n\n          result = [false];\n        }\n        break;\n\n      case 2:\n        // binary operators\n        {\n          var lhsParens; // left hand side needs parenthesis?\n          // precedence of the left hand side\n\n          var lhsPrecedence = getPrecedence(args[0], parenthesis); // is the root node associative with the left hand side\n\n          var 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          var rhsParens; // right hand side needs parenthesis?\n          // precedence of the right hand side\n\n          var rhsPrecedence = getPrecedence(args[1], parenthesis); // is the root node associative with the right hand side?\n\n          var 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          } // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n\n          if (latex) {\n            var _rootIdentifier;\n\n            var lhsIdentifier;\n            var rhsIdentifier;\n\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            var argPrecedence = getPrecedence(arg, parenthesis);\n            var assocWithArg = isAssociativeWith(root, arg, parenthesis);\n            var argAssociativity = getAssociativity(arg, parenthesis);\n\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\n        break;\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\n\n    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis === 'auto' && implicit === 'hide') {\n      result = args.map(function (arg, index) {\n        var isParenthesisNode = arg.getIdentifier() === 'ParenthesisNode';\n\n        if (result[index] || isParenthesisNode) {\n          // put in parenthesis?\n          return true;\n        }\n\n        return false;\n      });\n    }\n\n    return result;\n  }\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = getAssociativity(this, parenthesis);\n      var operand = args[0].toString(options);\n\n      if (parens[0]) {\n        operand = '(' + operand + ')';\n      } // for example for \"not\", we want a space between operand and argument\n\n\n      var opIsNamed = /[a-zA-Z]+/.test(this.op);\n\n      if (assoc === 'right') {\n        // prefix operator\n        return this.op + (opIsNamed ? ' ' : '') + operand;\n      } else if (assoc === 'left') {\n        // postfix\n        return operand + (opIsNamed ? ' ' : '') + this.op;\n      } // fall back to postfix\n\n\n      return operand + this.op;\n    } else if (args.length === 2) {\n      var lhs = args[0].toString(options); // left hand side\n\n      var rhs = args[1].toString(options); // right hand side\n\n      if (parens[0]) {\n        // left hand side in parenthesis?\n        lhs = '(' + lhs + ')';\n      }\n\n      if (parens[1]) {\n        // 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      var stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toString(options);\n\n        if (parens[index]) {\n          // 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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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    };\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}`,\n   *                       where mathjs is optional\n   * @returns {OperatorNode}\n   */\n\n\n  OperatorNode.fromJSON = function (json) {\n    return new OperatorNode(json.op, json.fn, json.args, json.implicit);\n  };\n  /**\n   * Get HTML representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = getAssociativity(this, parenthesis);\n      var operand = args[0].toHTML(options);\n\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') {\n        // prefix operator\n        return '<span class=\"math-operator math-unary-operator math-lefthand-unary-operator\">' + escape(this.op) + '</span>' + operand;\n      } else {\n        // 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) {\n      // binary operatoes\n      var lhs = args[0].toHTML(options); // left hand side\n\n      var rhs = args[1].toHTML(options); // right hand side\n\n      if (parens[0]) {\n        // 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\n      if (parens[1]) {\n        // 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      var stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toHTML(options);\n\n        if (parens[index]) {\n          // 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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);\n    var op = latexOperators[this.fn];\n    op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = getAssociativity(this, parenthesis);\n      var operand = args[0].toTex(options);\n\n      if (parens[0]) {\n        operand = \"\\\\left(\".concat(operand, \"\\\\right)\");\n      }\n\n      if (assoc === 'right') {\n        // prefix operator\n        return op + operand;\n      } else if (assoc === 'left') {\n        // postfix operator\n        return operand + op;\n      } // fall back to postfix\n\n\n      return operand + op;\n    } else if (args.length === 2) {\n      // binary operators\n      var lhs = args[0]; // left hand side\n\n      var lhsTex = lhs.toTex(options);\n\n      if (parens[0]) {\n        lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n      }\n\n      var rhs = args[1]; // right hand side\n\n      var rhsTex = rhs.toTex(options);\n\n      if (parens[1]) {\n        rhsTex = \"\\\\left(\".concat(rhsTex, \"\\\\right)\");\n      } // handle some exceptions (due to the way LaTeX works)\n\n\n      var lhsIdentifier;\n\n      if (parenthesis === 'keep') {\n        lhsIdentifier = lhs.getIdentifier();\n      } else {\n        // Ignore ParenthesisNodes if in 'keep' mode\n        lhsIdentifier = lhs.getContent().getIdentifier();\n      }\n\n      switch (this.getIdentifier()) {\n        case 'OperatorNode:divide':\n          // op contains '\\\\frac' at this point\n          return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';\n\n        case 'OperatorNode:pow':\n          lhsTex = '{' + lhsTex + '}';\n          rhsTex = '{' + rhsTex + '}';\n\n          switch (lhsIdentifier) {\n            case 'ConditionalNode': //\n\n            case 'OperatorNode:divide':\n              lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n          }\n\n          break;\n\n        case 'OperatorNode:multiply':\n          if (this.implicit && implicit === 'hide') {\n            return lhsTex + '~' + rhsTex;\n          }\n\n      }\n\n      return lhsTex + op + rhsTex;\n    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n      var texifiedArgs = args.map(function (arg, index) {\n        arg = arg.toTex(options);\n\n        if (parens[index]) {\n          arg = \"\\\\left(\".concat(arg, \"\\\\right)\");\n        }\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(' + args.map(function (arg) {\n        return arg.toTex(options);\n      }).join(',') + '\\\\right)';\n    }\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  OperatorNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.fn;\n  };\n\n  return OperatorNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode, isSymbolNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'RangeNode';\nvar dependencies = ['Node'];\nexport var createRangeNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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    } // validate inputs\n\n\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    this.start = start; // included lower-bound\n\n    this.end = end; // included upper-bound\n\n    this.step = step || null; // optional step\n  }\n\n  RangeNode.prototype = new Node();\n  RangeNode.prototype.type = 'RangeNode';\n  RangeNode.prototype.isRangeNode = true;\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\n  RangeNode.prototype.needsEnd = function () {\n    // find all `end` symbols in this RangeNode\n    var endSymbols = this.filter(function (node) {\n      return isSymbolNode(node) && node.name === 'end';\n    });\n    return endSymbols.length > 0;\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\n\n  RangeNode.prototype._compile = function (math, argNames) {\n    var range = math.range;\n\n    var evalStart = this.start._compile(math, argNames);\n\n    var evalEnd = this.end._compile(math, argNames);\n\n    if (this.step) {\n      var evalStep = this.step._compile(math, argNames);\n\n      return function evalRangeNode(scope, args, context) {\n        return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));\n      };\n    } else {\n      return function evalRangeNode(scope, args, context) {\n        return range(evalStart(scope, args, context), evalEnd(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\n\n  RangeNode.prototype.forEach = function (callback) {\n    callback(this.start, 'start', this);\n    callback(this.end, 'end', this);\n\n    if (this.step) {\n      callback(this.step, 'step', this);\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\n\n  RangeNode.prototype.map = function (callback) {\n    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)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {RangeNode}\n   */\n\n\n  RangeNode.prototype.clone = function () {\n    return new RangeNode(this.start, this.end, this.step && this.step);\n  };\n  /**\n   * Calculate the necessary parentheses\n   * @param {Node} node\n   * @param {string} parenthesis\n   * @return {Object} parentheses\n   * @private\n   */\n\n\n  function calculateNecessaryParentheses(node, parenthesis) {\n    var precedence = getPrecedence(node, parenthesis);\n    var parens = {};\n    var startPrecedence = getPrecedence(node.start, parenthesis);\n    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n\n    if (node.step) {\n      var stepPrecedence = getPrecedence(node.step, parenthesis);\n      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n    }\n\n    var endPrecedence = getPrecedence(node.end, parenthesis);\n    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n    return parens;\n  }\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n    var str;\n    var start = this.start.toString(options);\n\n    if (parens.start) {\n      start = '(' + start + ')';\n    }\n\n    str = start;\n\n    if (this.step) {\n      var step = this.step.toString(options);\n\n      if (parens.step) {\n        step = '(' + step + ')';\n      }\n\n      str += ':' + step;\n    }\n\n    var end = this.end.toString(options);\n\n    if (parens.end) {\n      end = '(' + end + ')';\n    }\n\n    str += ':' + end;\n    return str;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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   * 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\n\n  RangeNode.fromJSON = function (json) {\n    return new RangeNode(json.start, json.end, json.step);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n    var str;\n    var start = this.start.toHTML(options);\n\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\n    str = start;\n\n    if (this.step) {\n      var step = this.step.toHTML(options);\n\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\n      str += '<span class=\"math-operator math-range-operator\">:</span>' + step;\n    }\n\n    var end = this.end.toHTML(options);\n\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\n    str += '<span class=\"math-operator math-range-operator\">:</span>' + end;\n    return str;\n  };\n  /**\n   * Get LaTeX representation\n   * @params {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis);\n    var str = this.start.toTex(options);\n\n    if (parens.start) {\n      str = \"\\\\left(\".concat(str, \"\\\\right)\");\n    }\n\n    if (this.step) {\n      var step = this.step.toTex(options);\n\n      if (parens.step) {\n        step = \"\\\\left(\".concat(step, \"\\\\right)\");\n      }\n\n      str += ':' + step;\n    }\n\n    var end = this.end.toTex(options);\n\n    if (parens.end) {\n      end = \"\\\\left(\".concat(end, \"\\\\right)\");\n    }\n\n    str += ':' + end;\n    return str;\n  };\n\n  return RangeNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\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 { setSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'FunctionAssignmentNode';\nvar dependencies = ['typed', 'Node'];\nexport var createFunctionAssignmentNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Node\n  } = _ref;\n\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    } // validate input\n\n\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 (name in keywords) throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\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  FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode';\n  FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true;\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\n  FunctionAssignmentNode.prototype._compile = function (math, argNames) {\n    var childArgNames = Object.create(argNames);\n    forEach(this.params, function (param) {\n      childArgNames[param] = true;\n    }); // compile the function expression with the child args\n\n    var evalExpr = this.expr._compile(math, childArgNames);\n\n    var name = this.name;\n    var params = this.params;\n    var signature = join(this.types, ',');\n    var syntax = name + '(' + join(this.params, ', ') + ')';\n    return function evalFunctionAssignmentNode(scope, args, context) {\n      var signatures = {};\n\n      signatures[signature] = function () {\n        var childArgs = Object.create(args);\n\n        for (var i = 0; i < params.length; i++) {\n          childArgs[params[i]] = arguments[i];\n        }\n\n        return evalExpr(scope, childArgs, context);\n      };\n\n      var fn = typed(name, signatures);\n      fn.syntax = syntax;\n      setSafeProperty(scope, name, fn);\n      return fn;\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\n\n  FunctionAssignmentNode.prototype.forEach = function (callback) {\n    callback(this.expr, 'expr', this);\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\n\n  FunctionAssignmentNode.prototype.map = function (callback) {\n    var expr = this._ifNode(callback(this.expr, 'expr', this));\n\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionAssignmentNode}\n   */\n\n\n  FunctionAssignmentNode.prototype.clone = function () {\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);\n  };\n  /**\n   * Is parenthesis needed?\n   * @param {Node} node\n   * @param {Object} parenthesis\n   * @private\n   */\n\n\n  function needParenthesis(node, parenthesis) {\n    var precedence = getPrecedence(node, parenthesis);\n    var exprPrecedence = getPrecedence(node.expr, parenthesis);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  /**\n   * get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var expr = this.expr.toString(options);\n\n    if (needParenthesis(this, parenthesis)) {\n      expr = '(' + expr + ')';\n    }\n\n    return this.name + '(' + this.params.join(', ') + ') = ' + expr;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  FunctionAssignmentNode.prototype.toJSON = function () {\n    var types = this.types;\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   * 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\n\n  FunctionAssignmentNode.fromJSON = function (json) {\n    return new FunctionAssignmentNode(json.name, json.params, json.expr);\n  };\n  /**\n   * get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var params = [];\n\n    for (var i = 0; i < this.params.length; i++) {\n      params.push('<span class=\"math-symbol math-parameter\">' + escape(this.params[i]) + '</span>');\n    }\n\n    var expr = this.expr.toHTML(options);\n\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\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   * get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var expr = this.expr.toTex(options);\n\n    if (needParenthesis(this, parenthesis)) {\n      expr = \"\\\\left(\".concat(expr, \"\\\\right)\");\n    }\n\n    return '\\\\mathrm{' + this.name + '}\\\\left(' + this.params.map(toSymbol).join(',') + '\\\\right):=' + expr;\n  };\n\n  return FunctionAssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'chain';\nvar dependencies = ['typed', 'Chain'];\nexport var createChain = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Chain\n  } = _ref;\n\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    any: function any(value) {\n      return new Chain(value);\n    }\n  });\n});","import { IndexError } from '../../../error/IndexError.js';\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 */\n\nexport function errorTransform(err) {\n  if (err && err.isIndexError) {\n    return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\n  }\n\n  return err;\n}","import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { getSafeProperty } from '../../../utils/customs.js';\nexport function accessFactory(_ref) {\n  var {\n    subset\n  } = _ref;\n\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') {\n        // 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}","import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isNode, isObjectNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { accessFactory } from './utils/access.js';\nvar name = 'AccessorNode';\nvar dependencies = ['subset', 'Node'];\nexport var createAccessorNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    subset,\n    Node\n  } = _ref;\n  var access = accessFactory({\n    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\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\n    if (!isIndexNode(index)) {\n      throw new TypeError('IndexNode expected for parameter \"index\"');\n    }\n\n    this.object = object || null;\n    this.index = index; // readonly property name\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  AccessorNode.prototype = new Node();\n  AccessorNode.prototype.type = 'AccessorNode';\n  AccessorNode.prototype.isAccessorNode = true;\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\n  AccessorNode.prototype._compile = function (math, argNames) {\n    var evalObject = this.object._compile(math, argNames);\n\n    var evalIndex = this.index._compile(math, argNames);\n\n    if (this.index.isObjectProperty()) {\n      var prop = this.index.getObjectProperty();\n      return function evalAccessorNode(scope, args, context) {\n        return getSafeProperty(evalObject(scope, args, context), prop);\n      };\n    } else {\n      return function evalAccessorNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        var index = evalIndex(scope, args, object); // we pass object here instead of context\n\n        return access(object, index);\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\n\n  AccessorNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this);\n    callback(this.index, 'index', this);\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\n\n  AccessorNode.prototype.map = function (callback) {\n    return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AccessorNode}\n   */\n\n\n  AccessorNode.prototype.clone = function () {\n    return new AccessorNode(this.object, this.index);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype._toString = function (options) {\n    var object = this.object.toString(options);\n\n    if (needParenthesis(this.object)) {\n      object = '(' + object + ')';\n    }\n\n    return object + this.index.toString(options);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype.toHTML = function (options) {\n    var object = this.object.toHTML(options);\n\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype._toTex = function (options) {\n    var object = this.object.toTex(options);\n\n    if (needParenthesis(this.object)) {\n      object = '\\\\left(\\' + object + \\'\\\\right)';\n    }\n\n    return object + this.index.toTex(options);\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  AccessorNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'AccessorNode',\n      object: this.object,\n      index: this.index\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\n\n  AccessorNode.fromJSON = function (json) {\n    return new AccessorNode(json.object, json.index);\n  };\n  /**\n   * Are parenthesis needed?\n   * @private\n   */\n\n\n  function needParenthesis(node) {\n    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n    return !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));\n  }\n\n  return AccessorNode;\n}, {\n  isClass: true,\n  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';\nvar name = 'IndexNode';\nvar dependencies = ['Range', 'Node', 'size'];\nexport var createIndexNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Range,\n    Node,\n    size\n  } = _ref;\n\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; // validate input\n\n    if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"');\n    }\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  IndexNode.prototype.type = 'IndexNode';\n  IndexNode.prototype.isIndexNode = true;\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\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    // TODO: Optimization: when the range values are ConstantNodes,\n    //       we can beforehand resolve the zero-based value\n    // optimization for a simple object property\n    var 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          var childArgNames = Object.create(argNames);\n          childArgNames.end = true;\n\n          var evalStart = range.start._compile(math, childArgNames);\n\n          var evalEnd = range.end._compile(math, childArgNames);\n\n          var evalStep = range.step ? range.step._compile(math, childArgNames) : function () {\n            return 1;\n          };\n          return function evalDimension(scope, args, context) {\n            var s = size(context).valueOf();\n            var childArgs = Object.create(args);\n            childArgs.end = s[i];\n            return createRange(evalStart(scope, childArgs, context), evalEnd(scope, childArgs, context), evalStep(scope, childArgs, context));\n          };\n        } else {\n          // create range\n          var _evalStart = range.start._compile(math, argNames);\n\n          var _evalEnd = range.end._compile(math, argNames);\n\n          var _evalStep = range.step ? range.step._compile(math, argNames) : function () {\n            return 1;\n          };\n\n          return function evalDimension(scope, args, context) {\n            return createRange(_evalStart(scope, args, context), _evalEnd(scope, args, context), _evalStep(scope, args, context));\n          };\n        }\n      } else if (isSymbolNode(range) && range.name === 'end') {\n        // SymbolNode 'end'\n        var _childArgNames = Object.create(argNames);\n\n        _childArgNames.end = true;\n\n        var evalRange = range._compile(math, _childArgNames);\n\n        return function evalDimension(scope, args, context) {\n          var s = size(context).valueOf();\n          var childArgs = Object.create(args);\n          childArgs.end = s[i];\n          return evalRange(scope, childArgs, context);\n        };\n      } else {\n        // ConstantNode\n        var _evalRange = range._compile(math, argNames);\n\n        return function evalDimension(scope, args, context) {\n          return _evalRange(scope, args, context);\n        };\n      }\n    });\n    var index = getSafeProperty(math, 'index');\n    return function evalIndexNode(scope, args, context) {\n      var dimensions = map(evalDimensions, function (evalDimension) {\n        return evalDimension(scope, args, context);\n      });\n      return index(...dimensions);\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\n\n  IndexNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.dimensions.length; i++) {\n      callback(this.dimensions[i], 'dimensions[' + i + ']', this);\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\n\n  IndexNode.prototype.map = function (callback) {\n    var dimensions = [];\n\n    for (var 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   * Create a clone of this node, a shallow copy\n   * @return {IndexNode}\n   */\n\n\n  IndexNode.prototype.clone = function () {\n    return new IndexNode(this.dimensions.slice(0), this.dotNotation);\n  };\n  /**\n   * Test whether this IndexNode contains a single property name\n   * @return {boolean}\n   */\n\n\n  IndexNode.prototype.isObjectProperty = function () {\n    return this.dimensions.length === 1 && isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';\n  };\n  /**\n   * Returns the property name if IndexNode contains a property.\n   * If not, returns null.\n   * @return {string | null}\n   */\n\n\n  IndexNode.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this.dimensions[0].value : null;\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype._toString = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  IndexNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'IndexNode',\n      dimensions: this.dimensions,\n      dotNotation: this.dotNotation\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\n\n  IndexNode.fromJSON = function (json) {\n    return new IndexNode(json.dimensions, json.dotNotation);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype.toHTML = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    var dimensions = [];\n\n    for (var i = 0; i < this.dimensions.length; i++) {\n      dimensions[i] = this.dimensions[i].toHTML();\n    }\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype._toTex = function (options) {\n    var dimensions = this.dimensions.map(function (range) {\n      return range.toTex(options);\n    });\n    return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';\n  }; // helper function to create a Range from start, step and end\n\n\n  function createRange(start, end, step) {\n    return new Range(isBigNumber(start) ? start.toNumber() : start, isBigNumber(end) ? end.toNumber() : end, isBigNumber(step) ? step.toNumber() : step);\n  }\n\n  return IndexNode;\n}, {\n  isClass: true,\n  isNode: true\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';\nvar name = 'AssignmentNode';\nvar dependencies = ['subset', '?matrix', // FIXME: should not be needed at all, should be handled by subset\n'Node'];\nexport var createAssignmentNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    subset,\n    matrix,\n    Node\n  } = _ref;\n  var access = accessFactory({\n    subset\n  });\n  var assign = assignFactory({\n    subset,\n    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\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; // validate input\n\n    if (!isSymbolNode(object) && !isAccessorNode(object)) {\n      throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n    }\n\n    if (isSymbolNode(object) && object.name === 'end') {\n      throw new Error('Cannot assign to symbol \"end\"');\n    }\n\n    if (this.index && !isIndexNode(this.index)) {\n      // index is optional\n      throw new TypeError('IndexNode expected as \"index\"');\n    }\n\n    if (!isNode(this.value)) {\n      throw new TypeError('Node expected as \"value\"');\n    } // readonly property name\n\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  AssignmentNode.prototype = new Node();\n  AssignmentNode.prototype.type = 'AssignmentNode';\n  AssignmentNode.prototype.isAssignmentNode = true;\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\n  AssignmentNode.prototype._compile = function (math, argNames) {\n    var evalObject = this.object._compile(math, argNames);\n\n    var evalIndex = this.index ? this.index._compile(math, argNames) : null;\n\n    var evalValue = this.value._compile(math, argNames);\n\n    var 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        return setSafeProperty(scope, name, evalValue(scope, args, context));\n      };\n    } else if (this.index.isObjectProperty()) {\n      // apply an object property for example `a.b=2`\n      var prop = this.index.getObjectProperty();\n      return function evalAssignmentNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        var value = evalValue(scope, args, context);\n        return setSafeProperty(object, prop, 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        var childObject = evalObject(scope, args, context);\n        var value = evalValue(scope, args, context);\n        var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context\n\n        setSafeProperty(scope, name, assign(childObject, index, value));\n        return value;\n      };\n    } else {\n      // isAccessorNode(node.object) === true\n      // update a matrix subset, for example `a.b[2]=3`\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      var evalParentObject = this.object.object._compile(math, argNames);\n\n      if (this.object.index.isObjectProperty()) {\n        var parentProp = this.object.index.getObjectProperty();\n        return function evalAssignmentNode(scope, args, context) {\n          var parent = evalParentObject(scope, args, context);\n          var childObject = getSafeProperty(parent, parentProp);\n          var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context\n\n          var 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        var evalParentIndex = this.object.index._compile(math, argNames);\n\n        return function evalAssignmentNode(scope, args, context) {\n          var parent = evalParentObject(scope, args, context);\n          var parentIndex = evalParentIndex(scope, args, parent); // Important: we pass parent instead of context\n\n          var childObject = access(parent, parentIndex);\n          var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context\n\n          var value = evalValue(scope, args, context);\n          assign(parent, parentIndex, assign(childObject, index, value));\n          return value;\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\n\n  AssignmentNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this);\n\n    if (this.index) {\n      callback(this.index, 'index', this);\n    }\n\n    callback(this.value, 'value', this);\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\n\n  AssignmentNode.prototype.map = function (callback) {\n    var object = this._ifNode(callback(this.object, 'object', this));\n\n    var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;\n\n    var value = this._ifNode(callback(this.value, 'value', this));\n\n    return new AssignmentNode(object, index, value);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AssignmentNode}\n   */\n\n\n  AssignmentNode.prototype.clone = function () {\n    return new AssignmentNode(this.object, this.index, this.value);\n  };\n  /*\n   * Is parenthesis needed?\n   * @param {node} node\n   * @param {string} [parenthesis='keep']\n   * @private\n   */\n\n\n  function needParenthesis(node, parenthesis) {\n    if (!parenthesis) {\n      parenthesis = 'keep';\n    }\n\n    var precedence = getPrecedence(node, parenthesis);\n    var exprPrecedence = getPrecedence(node.value, parenthesis);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype._toString = function (options) {\n    var object = this.object.toString(options);\n    var index = this.index ? this.index.toString(options) : '';\n    var value = this.value.toString(options);\n\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = '(' + value + ')';\n    }\n\n    return object + index + ' = ' + value;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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   * 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\n\n  AssignmentNode.fromJSON = function (json) {\n    return new AssignmentNode(json.object, json.index, json.value);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype.toHTML = function (options) {\n    var object = this.object.toHTML(options);\n    var index = this.index ? this.index.toHTML(options) : '';\n    var value = this.value.toHTML(options);\n\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype._toTex = function (options) {\n    var object = this.object.toTex(options);\n    var index = this.index ? this.index.toTex(options) : '';\n    var value = this.value.toTex(options);\n\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = \"\\\\left(\".concat(value, \"\\\\right)\");\n    }\n\n    return object + index + ':=' + value;\n  };\n\n  return AssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { setSafeProperty } from '../../../utils/customs.js';\nexport function assignFactory(_ref) {\n  var {\n    subset,\n    matrix\n  } = _ref;\n\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') {\n        // 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\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}","import { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { toSymbol } from '../../utils/latex.js';\nvar name = 'SymbolNode';\nvar dependencies = ['math', '?Unit', 'Node'];\nexport var createSymbolNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    math,\n    Unit,\n    Node\n  } = _ref;\n\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   * @constructor SymbolNode\n   * @extends {Node}\n   * A symbol node can hold and resolve a symbol\n   * @param {string} name\n   * @extends {Node}\n   */\n\n\n  function SymbolNode(name) {\n    if (!(this instanceof SymbolNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"');\n    this.name = name;\n  }\n\n  SymbolNode.prototype = new Node();\n  SymbolNode.prototype.type = 'SymbolNode';\n  SymbolNode.prototype.isSymbolNode = true;\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\n  SymbolNode.prototype._compile = function (math, argNames) {\n    var 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 name in scope ? getSafeProperty(scope, name) : getSafeProperty(math, name);\n      };\n    } else {\n      var isUnit = isValuelessUnit(name);\n      return function (scope, args, context) {\n        return name in scope ? getSafeProperty(scope, name) : isUnit ? new Unit(null, name) : undef(name);\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\n\n  SymbolNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs\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\n\n  SymbolNode.prototype.map = function (callback) {\n    return this.clone();\n  };\n  /**\n   * Throws an error 'Undefined symbol {name}'\n   * @param {string} name\n   */\n\n\n  function undef(name) {\n    throw new Error('Undefined symbol ' + name);\n  }\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {SymbolNode}\n   */\n\n\n  SymbolNode.prototype.clone = function () {\n    return new SymbolNode(this.name);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype._toString = function (options) {\n    return this.name;\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype.toHTML = function (options) {\n    var 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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  SymbolNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'SymbolNode',\n      name: this.name\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\n\n  SymbolNode.fromJSON = function (json) {\n    return new SymbolNode(json.name);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype._toTex = function (options) {\n    var isUnit = false;\n\n    if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n      isUnit = true;\n    }\n\n    var symbol = toSymbol(this.name, isUnit);\n\n    if (symbol[0] === '\\\\') {\n      // no space needed if the symbol starts with '\\'\n      return symbol;\n    } // the space prevents symbols from breaking stuff like '\\cdot' if it's written right before the symbol\n\n\n    return ' ' + symbol;\n  };\n\n  return SymbolNode;\n}, {\n  isClass: true,\n  isNode: true\n});","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); }\n\nimport { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { escape } from '../../utils/string.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { map } from '../../utils/array.js';\nimport { getSafeProperty, validateSafeMethod } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { defaultTemplate, latexFunctions } from '../../utils/latex.js';\nvar name = 'FunctionNode';\nvar dependencies = ['math', 'Node', 'SymbolNode'];\nexport var createFunctionNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    math,\n    Node,\n    SymbolNode\n  } = _ref;\n\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    } // validate input\n\n\n    if (!isNode(fn)) throw new TypeError('Node expected as 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.fn = fn;\n    this.args = args || []; // readonly property name\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        return this.fn.name || '';\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  FunctionNode.prototype = new Node();\n  FunctionNode.prototype.type = 'FunctionNode';\n  FunctionNode.prototype.isFunctionNode = true;\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\n  FunctionNode.prototype._compile = function (math, argNames) {\n    if (!(this instanceof FunctionNode)) {\n      throw new TypeError('No valid FunctionNode');\n    } // compile arguments\n\n\n    var evalArgs = map(this.args, function (arg) {\n      return arg._compile(math, argNames);\n    });\n\n    if (isSymbolNode(this.fn)) {\n      // we can statically determine whether the function has an rawArgs property\n      var _name = this.fn.name;\n      var fn = _name in math ? getSafeProperty(math, _name) : undefined;\n      var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n\n      if (isRaw) {\n        // pass unevaluated parameters (nodes) to the function\n        // \"raw\" evaluation\n        var rawArgs = this.args;\n        return function evalFunctionNode(scope, args, context) {\n          return (_name in scope ? getSafeProperty(scope, _name) : fn)(rawArgs, math, _extends({}, scope, args));\n        };\n      } else {\n        // \"regular\" evaluation\n        if (evalArgs.length === 1) {\n          var evalArg0 = evalArgs[0];\n          return function evalFunctionNode(scope, args, context) {\n            return (_name in scope ? getSafeProperty(scope, _name) : fn)(evalArg0(scope, args, context));\n          };\n        } else if (evalArgs.length === 2) {\n          var _evalArg = evalArgs[0];\n          var evalArg1 = evalArgs[1];\n          return function evalFunctionNode(scope, args, context) {\n            return (_name in scope ? getSafeProperty(scope, _name) : fn)(_evalArg(scope, args, context), evalArg1(scope, args, context));\n          };\n        } else {\n          return function evalFunctionNode(scope, args, context) {\n            return (_name in scope ? getSafeProperty(scope, _name) : fn).apply(null, map(evalArgs, function (evalArg) {\n              return evalArg(scope, args, context);\n            }));\n          };\n        }\n      }\n    } else if (isAccessorNode(this.fn) && isIndexNode(this.fn.index) && this.fn.index.isObjectProperty()) {\n      // execute the function with the right context: the object of the AccessorNode\n      var evalObject = this.fn.object._compile(math, argNames);\n\n      var prop = this.fn.index.getObjectProperty();\n      var _rawArgs = this.args;\n      return function evalFunctionNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        validateSafeMethod(object, prop);\n        var isRaw = object[prop] && object[prop].rawArgs;\n        return isRaw ? object[prop](_rawArgs, math, _extends({}, scope, args)) // \"raw\" evaluation\n        : object[prop].apply(object, map(evalArgs, function (evalArg) {\n          // \"regular\" evaluation\n          return evalArg(scope, args, context);\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      var evalFn = this.fn._compile(math, argNames);\n\n      var _rawArgs2 = this.args;\n      return function evalFunctionNode(scope, args, context) {\n        var fn = evalFn(scope, args, context);\n        var isRaw = fn && fn.rawArgs;\n        return isRaw ? fn(_rawArgs2, math, _extends({}, scope, args)) // \"raw\" evaluation\n        : fn.apply(fn, map(evalArgs, function (evalArg) {\n          // \"regular\" evaluation\n          return evalArg(scope, args, context);\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\n\n  FunctionNode.prototype.forEach = function (callback) {\n    callback(this.fn, 'fn', this);\n\n    for (var i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this);\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\n\n  FunctionNode.prototype.map = function (callback) {\n    var fn = this._ifNode(callback(this.fn, 'fn', this));\n\n    var args = [];\n\n    for (var i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n    }\n\n    return new FunctionNode(fn, args);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionNode}\n   */\n\n\n  FunctionNode.prototype.clone = function () {\n    return new FunctionNode(this.fn, this.args.slice(0));\n  }; // backup Node's toString function\n  // @private\n\n\n  var nodeToString = FunctionNode.prototype.toString;\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\n  FunctionNode.prototype.toString = function (options) {\n    var customString;\n    var name = this.fn.toString(options);\n\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    } // fall back to Node's toString\n\n\n    return nodeToString.call(this, options);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype._toString = function (options) {\n    var args = this.args.map(function (arg) {\n      return arg.toString(options);\n    });\n    var fn = isFunctionAssignmentNode(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options); // format the arguments like \"add(2, 4.2)\"\n\n    return fn + '(' + args.join(', ') + ')';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  FunctionNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'FunctionNode',\n      fn: this.fn,\n      args: this.args\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\n\n  FunctionNode.fromJSON = function (json) {\n    return new FunctionNode(json.fn, json.args);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype.toHTML = function (options) {\n    var args = this.args.map(function (arg) {\n      return arg.toHTML(options);\n    }); // format the arguments like \"add(2, 4.2)\"\n\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   * Expand a LaTeX template\n   *\n   * @param {string} template\n   * @param {Node} node\n   * @param {Object} options\n   * @private\n   **/\n\n\n  function expandTemplate(template, node, options) {\n    var latex = ''; // Match everything of the form ${identifier} or ${identifier[2]} or $$\n    // while submatching identifier and 2 (in the second case)\n\n    var regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi;\n    var inputPos = 0; // position in the input string\n\n    var match;\n\n    while ((match = regex.exec(template)) !== null) {\n      // 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] === '$$') {\n        // escaped dollar sign\n        latex += '$';\n        inputPos++;\n      } else {\n        // template parameter\n        inputPos += match[0].length;\n        var property = node[match[1]];\n\n        if (!property) {\n          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');\n        }\n\n        if (match[2] === undefined) {\n          // no square brackets\n          switch (typeof property) {\n            case 'string':\n              latex += property;\n              break;\n\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\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\n              break;\n\n            default:\n              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n          }\n        } else {\n          // 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\n    latex += template.slice(inputPos); // append rest of the template\n\n    return latex;\n  } // backup Node's toTex function\n  // @private\n\n\n  var nodeToTex = FunctionNode.prototype.toTex;\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\n  FunctionNode.prototype.toTex = function (options) {\n    var customTex;\n\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    } // fall back to Node's toTex\n\n\n    return nodeToTex.call(this, options);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype._toTex = function (options) {\n    var args = this.args.map(function (arg) {\n      // get LaTeX of the arguments\n      return arg.toTex(options);\n    });\n    var latexConverter;\n\n    if (latexFunctions[this.name]) {\n      latexConverter = latexFunctions[this.name];\n    } // toTex property on the function itself\n\n\n    if (math[this.name] && (typeof math[this.name].toTex === 'function' || typeof math[this.name].toTex === 'object' || typeof math[this.name].toTex === 'string')) {\n      // .toTex is a callback function\n      latexConverter = math[this.name].toTex;\n    }\n\n    var customToTex;\n\n    switch (typeof latexConverter) {\n      case 'function':\n        // a callback function\n        customToTex = latexConverter(this, options);\n        break;\n\n      case 'string':\n        // a template string\n        customToTex = expandTemplate(latexConverter, this, options);\n        break;\n\n      case 'object':\n        // 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\n          case 'string':\n            customToTex = expandTemplate(latexConverter[args.length], this, options);\n            break;\n        }\n\n    }\n\n    if (typeof customToTex !== 'undefined') {\n      return customToTex;\n    }\n\n    return expandTemplate(defaultTemplate, this, options);\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  FunctionNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.name;\n  };\n\n  return FunctionNode;\n}, {\n  isClass: true,\n  isNode: true\n});","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); }\n\nimport { 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';\nvar name = 'parse';\nvar dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];\nexport var createParse = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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  var parse = typed(name, {\n    string: function string(expression) {\n      return parseStart(expression, {});\n    },\n    'Array | Matrix': function ArrayMatrix(expressions) {\n      return parseMultiple(expressions, {});\n    },\n    'string, Object': function stringObject(expression, options) {\n      var extraNodes = options.nodes !== undefined ? options.nodes : {};\n      return parseStart(expression, extraNodes);\n    },\n    'Array | Matrix, Object': parseMultiple\n  });\n\n  function parseMultiple(expressions) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var extraNodes = options.nodes !== undefined ? options.nodes : {}; // parse an array or matrix with expressions\n\n    return deepMap(expressions, function (elem) {\n      if (typeof elem !== 'string') throw new TypeError('String expected');\n      return parseStart(elem, extraNodes);\n    });\n  } // token types enumeration\n\n\n  var TOKENTYPE = {\n    NULL: 0,\n    DELIMITER: 1,\n    NUMBER: 2,\n    SYMBOL: 3,\n    UNKNOWN: 4\n  }; // map with all delimiters\n\n  var DELIMITERS = {\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    '^': 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    '>>': true,\n    '>>>': true\n  }; // map with all named delimiters\n\n  var 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  var CONSTANTS = {\n    true: true,\n    false: false,\n    null: null,\n    undefined: undefined\n  };\n  var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];\n\n  function initialState() {\n    return {\n      extraNodes: {},\n      // current extra nodes, must be careful not to mutate\n      expression: '',\n      // current expression\n      comment: '',\n      // last parsed comment\n      index: 0,\n      // current index in expr\n      token: '',\n      // current token\n      tokenType: TOKENTYPE.NULL,\n      // type of the token\n      nestingLevel: 0,\n      // 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\n\n  function currentString(state, length) {\n    return state.expression.substr(state.index, length);\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\n\n  function currentCharacter(state) {\n    return currentString(state, 1);\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\n\n  function next(state) {\n    state.index++;\n  }\n  /**\n   * Preview the previous character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n\n\n  function prevCharacter(state) {\n    return state.expression.charAt(state.index - 1);\n  }\n  /**\n   * Preview the next character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n\n\n  function nextCharacter(state) {\n    return state.expression.charAt(state.index + 1);\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\n\n  function getToken(state) {\n    state.tokenType = TOKENTYPE.NULL;\n    state.token = '';\n    state.comment = ''; // skip over whitespaces\n    // space, tab, and newline when inside parameters\n\n    while (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n      next(state);\n    } // skip comment\n\n\n    if (currentCharacter(state) === '#') {\n      while (currentCharacter(state) !== '\\n' && currentCharacter(state) !== '') {\n        state.comment += currentCharacter(state);\n        next(state);\n      }\n    } // check for end of expression\n\n\n    if (currentCharacter(state) === '') {\n      // token is still empty\n      state.tokenType = TOKENTYPE.DELIMITER;\n      return;\n    } // check for new line character\n\n\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    var c1 = currentCharacter(state);\n    var c2 = currentString(state, 2);\n    var c3 = currentString(state, 3);\n\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    } // check for delimiters consisting of 2 characters\n\n\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    } // check for delimiters consisting of 1 character\n\n\n    if (DELIMITERS[c1]) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = c1;\n      next(state);\n      return;\n    } // check for a number\n\n\n    if (parse.isDigitDot(c1)) {\n      state.tokenType = TOKENTYPE.NUMBER; // check for binary, octal, or hex\n\n      var _c = currentString(state, 2);\n\n      if (_c === '0b' || _c === '0o' || _c === '0x') {\n        state.token += currentCharacter(state);\n        next(state);\n        state.token += currentCharacter(state);\n        next(state);\n\n        while (parse.isHexDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state);\n          next(state);\n        }\n\n        if (currentCharacter(state) === '.') {\n          // this number has a radix point\n          state.token += '.';\n          next(state); // get the digits after the radix\n\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); // get the word size\n\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state);\n            next(state);\n          }\n        }\n\n        return;\n      } // get number, can have a single dot\n\n\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        }\n      } else {\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          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      } // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n\n\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          } // Scientific notation MUST be followed by an exponent\n\n\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    } // check for variables, functions, named operators\n\n\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    } // something unknown is found, wrong characters -> a syntax error\n\n\n    state.tokenType = TOKENTYPE.UNKNOWN;\n\n    while (currentCharacter(state) !== '') {\n      state.token += currentCharacter(state);\n      next(state);\n    }\n\n    throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"');\n  }\n  /**\n   * Get next token and skip newline tokens\n   */\n\n\n  function getTokenSkipNewline(state) {\n    do {\n      getToken(state);\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\n\n  function openParams(state) {\n    state.nestingLevel++;\n  }\n  /**\n   * Close parameters.\n   * New line characters will no longer be ignored\n   */\n\n\n  function closeParams(state) {\n    state.nestingLevel--;\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\n\n  parse.isAlpha = function isAlpha(c, cPrev, cNext) {\n    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);\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\n\n  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {\n    return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c);\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\n\n  parse.isValidMathSymbol = function isValidMathSymbol(high, low) {\n    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);\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\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   * 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\n\n  parse.isDecimalMark = function isDecimalMark(c, cNext) {\n    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';\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\n\n  parse.isDigitDot = function isDigitDot(c) {\n    return c >= '0' && c <= '9' || c === '.';\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\n\n  parse.isDigit = function isDigit(c) {\n    return c >= '0' && c <= '9';\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\n\n  parse.isHexDigit = function isHexDigit(c) {\n    return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';\n  };\n  /**\n   * Start of the parse levels below, in order of precedence\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseStart(expression, extraNodes) {\n    var state = initialState();\n\n    _extends(state, {\n      expression,\n      extraNodes\n    });\n\n    getToken(state);\n    var node = parseBlock(state); // check for garbage at the end of the expression\n    // an expression ends with a empty character '' and tokenType DELIMITER\n\n    if (state.token !== '') {\n      if (state.tokenType === TOKENTYPE.DELIMITER) {\n        // user entered a not existing operator like \"//\"\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   * 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\n\n  function parseBlock(state) {\n    var node;\n    var blocks = [];\n    var visible;\n\n    if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n      node = parseAssignment(state);\n      node.comment = state.comment;\n    } // TODO: simplify this loop\n\n\n    while (state.token === '\\n' || state.token === ';') {\n      // 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\n      if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n        node = parseAssignment(state);\n        node.comment = state.comment;\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   * 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\n\n  function parseAssignment(state) {\n    var name, args, value, valid;\n    var 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        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   * conditional operation\n   *\n   *     condition ? truePart : falsePart\n   *\n   * Note: conditional operator is right-associative\n   *\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseConditional(state) {\n    var node = parseLogicalOr(state);\n\n    while (state.token === '?') {\n      // 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      var prev = state.conditionalLevel;\n      state.conditionalLevel = state.nestingLevel;\n      getTokenSkipNewline(state);\n      var condition = node;\n      var trueExpr = parseAssignment(state);\n      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');\n      state.conditionalLevel = null;\n      getTokenSkipNewline(state);\n      var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity\n\n      node = new ConditionalNode(condition, trueExpr, falseExpr); // restore the previous conditional level\n\n      state.conditionalLevel = prev;\n    }\n\n    return node;\n  }\n  /**\n   * logical or, 'x or y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalOr(state) {\n    var node = parseLogicalXor(state);\n\n    while (state.token === 'or') {\n      // 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   * logical exclusive or, 'x xor y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalXor(state) {\n    var node = parseLogicalAnd(state);\n\n    while (state.token === 'xor') {\n      // 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   * logical and, 'x and y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalAnd(state) {\n    var node = parseBitwiseOr(state);\n\n    while (state.token === 'and') {\n      // 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   * bitwise or, 'x | y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseOr(state) {\n    var node = parseBitwiseXor(state);\n\n    while (state.token === '|') {\n      // 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   * bitwise exclusive or (xor), 'x ^| y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseXor(state) {\n    var node = parseBitwiseAnd(state);\n\n    while (state.token === '^|') {\n      // 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   * bitwise and, 'x & y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseAnd(state) {\n    var node = parseRelational(state);\n\n    while (state.token === '&') {\n      // 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   * Parse a chained conditional, like 'a > b >= c'\n   * @return {Node} node\n   */\n\n\n  function parseRelational(state) {\n    var params = [parseShift(state)];\n    var conditionals = [];\n    var operators = {\n      '==': 'equal',\n      '!=': 'unequal',\n      '<': 'smaller',\n      '>': 'larger',\n      '<=': 'smallerEq',\n      '>=': 'largerEq'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      // eslint-disable-line no-unmodified-loop-condition\n      var cond = {\n        name: state.token,\n        fn: operators[state.token]\n      };\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   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseShift(state) {\n    var node, name, fn, params;\n    node = parseConversion(state);\n    var operators = {\n      '<<': 'leftShift',\n      '>>': 'rightArithShift',\n      '>>>': 'rightLogShift'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      params = [node, parseConversion(state)];\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * conversion operators 'to' and 'in'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseConversion(state) {\n    var node, name, fn, params;\n    node = parseRange(state);\n    var operators = {\n      to: 'to',\n      in: 'to' // alias of 'to'\n\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\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   * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseRange(state) {\n    var node;\n    var 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); // parse step and end\n\n      while (state.token === ':' && params.length < 3) {\n        // 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 {\n        // 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   * add or subtract\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseAddSubtract(state) {\n    var node, name, fn, params;\n    node = parseMultiplyDivide(state);\n    var operators = {\n      '+': 'add',\n      '-': 'subtract'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      params = [node, parseMultiplyDivide(state)];\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * multiply, divide, modulus\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseMultiplyDivide(state) {\n    var node, last, name, fn;\n    node = parseImplicitMultiplication(state);\n    last = node;\n    var operators = {\n      '*': 'multiply',\n      '.*': 'dotMultiply',\n      '/': 'divide',\n      './': 'dotDivide',\n      '%': 'mod',\n      mod: 'mod'\n    };\n\n    while (true) {\n      if (hasOwnProperty(operators, state.token)) {\n        // explicit operators\n        name = state.token;\n        fn = operators[name];\n        getTokenSkipNewline(state);\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   * implicit multiplication\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseImplicitMultiplication(state) {\n    var node, last;\n    node = parseRule2(state);\n    last = node;\n\n    while (true) {\n      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && isConstantNode(node) || state.tokenType === TOKENTYPE.NUMBER && !isConstantNode(last) && (!isOperatorNode(last) || last.op === '!') || 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\n        /* implicit */\n        );\n      } else {\n        break;\n      }\n    }\n\n    return node;\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\n\n  function parseRule2(state) {\n    var node = parseUnary(state);\n    var last = node;\n    var 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(_extends({}, state));\n        getTokenSkipNewline(state); // Match the \"number / number\" part of the pattern\n\n        if (state.tokenType === TOKENTYPE.NUMBER) {\n          // Look ahead again\n          tokenStates.push(_extends({}, state));\n          getTokenSkipNewline(state); // Match the \"symbol\" part of the pattern, or a left parenthesis\n\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            _extends(state, tokenStates.pop());\n\n            tokenStates.pop();\n            last = parseUnary(state);\n            node = new OperatorNode('/', 'divide', [node, last]);\n          } else {\n            // Not a match, so rewind\n            tokenStates.pop();\n\n            _extends(state, tokenStates.pop());\n\n            break;\n          }\n        } else {\n          // Not a match, so rewind\n          _extends(state, tokenStates.pop());\n\n          break;\n        }\n      } else {\n        break;\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Unary plus and minus, and logical and bitwise not\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseUnary(state) {\n    var name, params, fn;\n    var 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      getTokenSkipNewline(state);\n      params = [parseUnary(state)];\n      return new OperatorNode(name, fn, params);\n    }\n\n    return parsePow(state);\n  }\n  /**\n   * power\n   * Note: power operator is right associative\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parsePow(state) {\n    var node, name, fn, params;\n    node = parseLeftHandOperators(state);\n\n    if (state.token === '^' || state.token === '.^') {\n      name = state.token;\n      fn = name === '^' ? 'pow' : 'dotPow';\n      getTokenSkipNewline(state);\n      params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'\n\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * Left hand operators: factorial x!, ctranspose x'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLeftHandOperators(state) {\n    var node, name, fn, params;\n    node = parseCustomNodes(state);\n    var operators = {\n      '!': 'factorial',\n      '\\'': 'ctranspose'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getToken(state);\n      params = [node];\n      node = new OperatorNode(name, fn, params);\n      node = parseAccessors(state, node);\n    }\n\n    return node;\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\n\n  function parseCustomNodes(state) {\n    var params = [];\n\n    if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {\n      var CustomNode = state.extraNodes[state.token];\n      getToken(state); // parse parameters\n\n      if (state.token === '(') {\n        params = [];\n        openParams(state);\n        getToken(state);\n\n        if (state.token !== ')') {\n          params.push(parseAssignment(state)); // parse a list with parameters\n\n          while (state.token === ',') {\n            // 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\n        closeParams(state);\n        getToken(state);\n      } // create a new custom node\n      // noinspection JSValidateTypes\n\n\n      return new CustomNode(params);\n    }\n\n    return parseSymbol(state);\n  }\n  /**\n   * parse symbols: functions, variables, constants, units\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseSymbol(state) {\n    var node, name;\n\n    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n      name = state.token;\n      getToken(state);\n\n      if (hasOwnProperty(CONSTANTS, name)) {\n        // true, false, null, ...\n        node = new ConstantNode(CONSTANTS[name]);\n      } else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) {\n        // NaN, Infinity\n        node = new ConstantNode(numeric(name, 'number'));\n      } else {\n        node = new SymbolNode(name);\n      } // parse function parameters and matrix index\n\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseDoubleQuotesString(state);\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\n\n  function parseAccessors(state, node, types) {\n    var params;\n\n    while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.indexOf(state.token) !== -1)) {\n      // 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)); // parse a list with parameters\n\n            while (state.token === ',') {\n              // 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\n          closeParams(state);\n          getToken(state);\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)); // parse a list with parameters\n\n          while (state.token === ',') {\n            // 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\n        closeParams(state);\n        getToken(state);\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\n        params.push(new ConstantNode(state.token));\n        getToken(state);\n        var dotNotation = true;\n        node = new AccessorNode(node, new IndexNode(params, dotNotation));\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Parse a double quotes string.\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseDoubleQuotesString(state) {\n    var node, str;\n\n    if (state.token === '\"') {\n      str = parseDoubleQuotesStringToken(state); // create constant\n\n      node = new ConstantNode(str); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseSingleQuotesString(state);\n  }\n  /**\n   * Parse a string surrounded by double quotes \"...\"\n   * @return {string}\n   */\n\n\n  function parseDoubleQuotesStringToken(state) {\n    var 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\n    if (state.token !== '\"') {\n      throw createSyntaxError(state, 'End of string \" expected');\n    }\n\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n  /**\n   * Parse a single quotes string.\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseSingleQuotesString(state) {\n    var node, str;\n\n    if (state.token === '\\'') {\n      str = parseSingleQuotesStringToken(state); // create constant\n\n      node = new ConstantNode(str); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseMatrix(state);\n  }\n  /**\n   * Parse a string surrounded by single quotes '...'\n   * @return {string}\n   */\n\n\n  function parseSingleQuotesStringToken(state) {\n    var 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\n    if (state.token !== '\\'') {\n      throw createSyntaxError(state, 'End of string \\' expected');\n    }\n\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n  /**\n   * parse the matrix\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseMatrix(state) {\n    var 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        var row = parseRow(state);\n\n        if (state.token === ';') {\n          // 2 dimensional array\n          rows = 1;\n          params = [row]; // the rows of the matrix are separated by dot-comma's\n\n          while (state.token === ';') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params[rows] = parseRow(state);\n            rows++;\n          }\n\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected');\n          }\n\n          closeParams(state);\n          getToken(state); // check if the number of columns matches in all rows\n\n          cols = params[0].items.length;\n\n          for (var r = 1; r < rows; r++) {\n            if (params[r].items.length !== cols) {\n              throw createError(state, 'Column dimensions mismatch ' + '(' + 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\n          closeParams(state);\n          getToken(state);\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   * Parse a single comma-separated row from a matrix, like 'a, b, c'\n   * @return {ArrayNode} node\n   */\n\n\n  function parseRow(state) {\n    var params = [parseAssignment(state)];\n    var len = 1;\n\n    while (state.token === ',') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getToken(state); // parse expression\n\n      params[len] = parseAssignment(state);\n      len++;\n    }\n\n    return new ArrayNode(params);\n  }\n  /**\n   * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseObject(state) {\n    if (state.token === '{') {\n      openParams(state);\n      var key;\n      var properties = {};\n\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          } // parse key/value separator\n\n\n          if (state.token !== ':') {\n            throw createSyntaxError(state, 'Colon : expected after object key');\n          }\n\n          getToken(state); // parse key\n\n          properties[key] = parseAssignment(state);\n        }\n      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition\n\n\n      if (state.token !== '}') {\n        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');\n      }\n\n      closeParams(state);\n      getToken(state);\n      var node = new ObjectNode(properties); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseNumber(state);\n  }\n  /**\n   * parse a number\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseNumber(state) {\n    var numberStr;\n\n    if (state.tokenType === TOKENTYPE.NUMBER) {\n      // this is a number\n      numberStr = state.token;\n      getToken(state);\n      return new ConstantNode(numeric(numberStr, config.number));\n    }\n\n    return parseParentheses(state);\n  }\n  /**\n   * parentheses\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseParentheses(state) {\n    var node; // check if it is a parenthesized expression\n\n    if (state.token === '(') {\n      // parentheses (...)\n      openParams(state);\n      getToken(state);\n      node = parseAssignment(state); // start again\n\n      if (state.token !== ')') {\n        throw createSyntaxError(state, 'Parenthesis ) expected');\n      }\n\n      closeParams(state);\n      getToken(state);\n      node = new ParenthesisNode(node);\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseEnd(state);\n  }\n  /**\n   * Evaluated when the expression is not yet ended but expected to end\n   * @return {Node} res\n   * @private\n   */\n\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   * Shortcut for getting the current row value (one based)\n   * Returns the line of the currently handled expression\n   * @private\n   */\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\n\n  function col(state) {\n    return state.index - state.token.length + 1;\n  }\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {SyntaxError} instantiated error\n   * @private\n   */\n\n\n  function createSyntaxError(state, message) {\n    var c = col(state);\n    var error = new SyntaxError(message + ' (char ' + c + ')');\n    error.char = c;\n    return error;\n  }\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {Error} instantiated error\n   * @private\n   */\n\n\n  function createError(state, message) {\n    var c = col(state);\n    var error = new SyntaxError(message + ' (char ' + c + ')');\n    error.char = c;\n    return error;\n  }\n\n  return parse;\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'evaluate';\nvar dependencies = ['typed', 'parse'];\nexport var createEvaluate = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    parse\n  } = _ref;\n\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 string(expr) {\n      var scope = {};\n      return parse(expr).compile().evaluate(scope);\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return parse(expr).compile().evaluate(scope);\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      var scope = {};\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\n    },\n    'Array | Matrix, Object': function ArrayMatrixObject(expr, scope) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\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';\nvar name = 'Help';\nvar dependencies = ['parse'];\nexport var createHelpClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    parse\n  } = _ref;\n\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    this.doc = doc;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Help.prototype.type = 'Help';\n  Help.prototype.isHelp = true;\n  /**\n   * Generate a string representation of the Help object\n   * @return {string} Returns a string\n   * @private\n   */\n\n  Help.prototype.toString = function () {\n    var doc = this.doc || {};\n    var desc = '\\n';\n\n    if (doc.name) {\n      desc += 'Name: ' + doc.name + '\\n\\n';\n    }\n\n    if (doc.category) {\n      desc += 'Category: ' + doc.category + '\\n\\n';\n    }\n\n    if (doc.description) {\n      desc += 'Description:\\n    ' + doc.description + '\\n\\n';\n    }\n\n    if (doc.syntax) {\n      desc += 'Syntax:\\n    ' + doc.syntax.join('\\n    ') + '\\n\\n';\n    }\n\n    if (doc.examples) {\n      desc += 'Examples:\\n';\n      var scope = {};\n\n      for (var i = 0; i < doc.examples.length; i++) {\n        var expr = doc.examples[i];\n        desc += '    ' + expr + '\\n';\n        var res = void 0;\n\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\n        if (res !== undefined && !isHelp(res)) {\n          desc += '        ' + format(res, {\n            precision: 14\n          }) + '\\n';\n        }\n      }\n\n      desc += '\\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   * Export the help object to JSON\n   */\n\n\n  Help.prototype.toJSON = function () {\n    var obj = clone(this.doc);\n    obj.mathjs = 'Help';\n    return obj;\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\n\n  Help.fromJSON = function (json) {\n    var doc = {};\n    Object.keys(json).filter(prop => prop !== 'mathjs').forEach(prop => {\n      doc[prop] = json[prop];\n    });\n    return new Help(doc);\n  };\n  /**\n   * Returns a string representation of the Help object\n   */\n\n\n  Help.prototype.valueOf = Help.prototype.toString;\n  return Help;\n}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nimport { extend, hasOwnProperty } from '../utils/object.js';\nimport { getSafeProperty, setSafeProperty } from '../utils/customs.js';\nvar name = 'Parser';\nvar dependencies = ['parse'];\nexport var createParserClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    parse\n  } = _ref;\n\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('function 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('Constructor must be called with the new operator');\n    }\n\n    this.scope = {};\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Parser.prototype.type = 'Parser';\n  Parser.prototype.isParser = true;\n  /**\n   * Parse and evaluate the given expression\n   * @param {string} expr   A string containing an expression, for example \"2+3\"\n   * @return {*} result     The result, or undefined when the expression was empty\n   * @throws {Error}\n   */\n\n  Parser.prototype.evaluate = function (expr) {\n    // TODO: validate arguments\n    return parse(expr).compile().evaluate(this.scope);\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\n\n  Parser.prototype.get = function (name) {\n    // TODO: validate arguments\n    return name in this.scope ? getSafeProperty(this.scope, name) : undefined;\n  };\n  /**\n   * Get a map with all defined variables\n   * @return {Object} values\n   */\n\n\n  Parser.prototype.getAll = function () {\n    return extend({}, this.scope);\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\n\n  Parser.prototype.set = function (name, value) {\n    // TODO: validate arguments\n    return setSafeProperty(this.scope, name, value);\n  };\n  /**\n   * Remove a variable from the parsers scope\n   * @param {string} name\n   */\n\n\n  Parser.prototype.remove = function (name) {\n    // TODO: validate arguments\n    delete this.scope[name];\n  };\n  /**\n   * Clear the scope with variables and functions\n   */\n\n\n  Parser.prototype.clear = function () {\n    for (var _name in this.scope) {\n      if (hasOwnProperty(this.scope, _name)) {\n        delete this.scope[_name];\n      }\n    }\n  };\n\n  return Parser;\n}, {\n  isClass: true\n});","export var piDocs = {\n  name: 'pi',\n  category: 'Constants',\n  syntax: ['pi'],\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: ['pi', 'sin(pi/2)'],\n  seealso: ['tau']\n};","export var eDocs = {\n  name: 'e',\n  category: 'Constants',\n  syntax: ['e'],\n  description: 'Euler\\'s number, the base of the natural logarithm. Approximately equal to 2.71828',\n  examples: ['e', 'e ^ 2', 'exp(2)', 'log(e)'],\n  seealso: ['exp']\n};","import { bignumberDocs } from './construction/bignumber.js';\nimport { typeOfDocs } from './function/utils/typeOf.js';\nimport { isZeroDocs } from './function/utils/isZero.js';\nimport { isPrimeDocs } from './function/utils/isPrime.js';\nimport { isPositiveDocs } from './function/utils/isPositive.js';\nimport { isNumericDocs } from './function/utils/isNumeric.js';\nimport { hasNumericValueDocs } from './function/utils/hasNumericValue.js';\nimport { isNegativeDocs } from './function/utils/isNegative.js';\nimport { isIntegerDocs } from './function/utils/isInteger.js';\nimport { isNaNDocs } from './function/utils/isNaN.js';\nimport { formatDocs } from './function/utils/format.js';\nimport { binDocs } from './function/utils/bin.js';\nimport { octDocs } from './function/utils/oct.js';\nimport { hexDocs } from './function/utils/hex.js';\nimport { cloneDocs } from './function/utils/clone.js';\nimport { toDocs } from './function/units/to.js';\nimport { tanhDocs } from './function/trigonometry/tanh.js';\nimport { tanDocs } from './function/trigonometry/tan.js';\nimport { sinhDocs } from './function/trigonometry/sinh.js';\nimport { sechDocs } from './function/trigonometry/sech.js';\nimport { secDocs } from './function/trigonometry/sec.js';\nimport { cschDocs } from './function/trigonometry/csch.js';\nimport { cscDocs } from './function/trigonometry/csc.js';\nimport { cothDocs } from './function/trigonometry/coth.js';\nimport { cotDocs } from './function/trigonometry/cot.js';\nimport { coshDocs } from './function/trigonometry/cosh.js';\nimport { cosDocs } from './function/trigonometry/cos.js';\nimport { atan2Docs } from './function/trigonometry/atan2.js';\nimport { atanhDocs } from './function/trigonometry/atanh.js';\nimport { atanDocs } from './function/trigonometry/atan.js';\nimport { asinhDocs } from './function/trigonometry/asinh.js';\nimport { asinDocs } from './function/trigonometry/asin.js';\nimport { asechDocs } from './function/trigonometry/asech.js';\nimport { asecDocs } from './function/trigonometry/asec.js';\nimport { acschDocs } from './function/trigonometry/acsch.js';\nimport { acscDocs } from './function/trigonometry/acsc.js';\nimport { acothDocs } from './function/trigonometry/acoth.js';\nimport { acotDocs } from './function/trigonometry/acot.js';\nimport { acoshDocs } from './function/trigonometry/acosh.js';\nimport { acosDocs } from './function/trigonometry/acos.js';\nimport { sumDocs } from './function/statistics/sum.js';\nimport { stdDocs } from './function/statistics/std.js';\nimport { quantileSeqDocs } from './function/statistics/quantileSeq.js';\nimport { prodDocs } from './function/statistics/prod.js';\nimport { modeDocs } from './function/statistics/mode.js';\nimport { minDocs } from './function/statistics/min.js';\nimport { medianDocs } from './function/statistics/median.js';\nimport { meanDocs } from './function/statistics/mean.js';\nimport { maxDocs } from './function/statistics/max.js';\nimport { madDocs } from './function/statistics/mad.js';\nimport { erfDocs } from './function/special/erf.js';\nimport { setUnionDocs } from './function/set/setUnion.js';\nimport { setSymDifferenceDocs } from './function/set/setSymDifference.js';\nimport { setSizeDocs } from './function/set/setSize.js';\nimport { setPowersetDocs } from './function/set/setPowerset.js';\nimport { setMultiplicityDocs } from './function/set/setMultiplicity.js';\nimport { setIsSubsetDocs } from './function/set/setIsSubset.js';\nimport { setIntersectDocs } from './function/set/setIntersect.js';\nimport { setDistinctDocs } from './function/set/setDistinct.js';\nimport { setDifferenceDocs } from './function/set/setDifference.js';\nimport { setCartesianDocs } from './function/set/setCartesian.js';\nimport { unequalDocs } from './function/relational/unequal.js';\nimport { smallerEqDocs } from './function/relational/smallerEq.js';\nimport { smallerDocs } from './function/relational/smaller.js';\nimport { largerEqDocs } from './function/relational/largerEq.js';\nimport { largerDocs } from './function/relational/larger.js';\nimport { equalTextDocs } from './function/relational/equalText.js';\nimport { equalDocs } from './function/relational/equal.js';\nimport { deepEqualDocs } from './function/relational/deepEqual.js';\nimport { compareTextDocs } from './function/relational/compareText.js';\nimport { compareNaturalDocs } from './function/relational/compareNatural.js';\nimport { compareDocs } from './function/relational/compare.js';\nimport { randomIntDocs } from './function/probability/randomInt.js';\nimport { randomDocs } from './function/probability/random.js';\nimport { pickRandomDocs } from './function/probability/pickRandom.js';\nimport { permutationsDocs } from './function/probability/permutations.js';\nimport { multinomialDocs } from './function/probability/multinomial.js';\nimport { kldivergenceDocs } from './function/probability/kldivergence.js';\nimport { gammaDocs } from './function/probability/gamma.js';\nimport { factorialDocs } from './function/probability/factorial.js';\nimport { combinationsDocs } from './function/probability/combinations.js';\nimport { combinationsWithRepDocs } from './function/probability/combinationsWithRep.js';\nimport { zerosDocs } from './function/matrix/zeros.js';\nimport { transposeDocs } from './function/matrix/transpose.js';\nimport { traceDocs } from './function/matrix/trace.js';\nimport { subsetDocs } from './function/matrix/subset.js';\nimport { squeezeDocs } from './function/matrix/squeeze.js';\nimport { sortDocs } from './function/matrix/sort.js';\nimport { sizeDocs } from './function/matrix/size.js';\nimport { diffDocs } from './function/matrix/diff.js';\nimport { reshapeDocs } from './function/matrix/reshape.js';\nimport { resizeDocs } from './function/matrix/resize.js';\nimport { rangeDocs } from './function/matrix/range.js';\nimport { partitionSelectDocs } from './function/matrix/partitionSelect.js';\nimport { onesDocs } from './function/matrix/ones.js';\nimport { mapDocs } from './function/matrix/map.js';\nimport { kronDocs } from './function/matrix/kron.js';\nimport { invDocs } from './function/matrix/inv.js';\nimport { forEachDocs } from './function/matrix/forEach.js';\nimport { flattenDocs } from './function/matrix/flatten.js';\nimport { filterDocs } from './function/matrix/filter.js';\nimport { identityDocs } from './function/matrix/identity.js';\nimport { getMatrixDataTypeDocs } from './function/matrix/getMatrixDataType.js';\nimport { dotDocs } from './function/matrix/dot.js';\nimport { diagDocs } from './function/matrix/diag.js';\nimport { detDocs } from './function/matrix/det.js';\nimport { ctransposeDocs } from './function/matrix/ctranspose.js';\nimport { crossDocs } from './function/matrix/cross.js';\nimport { concatDocs } from './function/matrix/concat.js';\nimport { countDocs } from './function/matrix/count.js';\nimport { xorDocs } from './function/logical/xor.js';\nimport { orDocs } from './function/logical/or.js';\nimport { notDocs } from './function/logical/not.js';\nimport { andDocs } from './function/logical/and.js';\nimport { intersectDocs } from './function/geometry/intersect.js';\nimport { distanceDocs } from './function/geometry/distance.js';\nimport { helpDocs } from './function/expression/help.js';\nimport { evaluateDocs } from './function/expression/evaluate.js';\nimport { imDocs } from './function/complex/im.js';\nimport { reDocs } from './function/complex/re.js';\nimport { conjDocs } from './function/complex/conj.js';\nimport { argDocs } from './function/complex/arg.js';\nimport { typedDocs } from './core/typed.js';\nimport { importDocs } from './core/import.js';\nimport { configDocs } from './core/config.js';\nimport { stirlingS2Docs } from './function/combinatorics/stirlingS2.js';\nimport { compositionDocs } from './function/combinatorics/composition.js';\nimport { catalanDocs } from './function/combinatorics/catalan.js';\nimport { bellNumbersDocs } from './function/combinatorics/bellNumbers.js';\nimport { rightLogShiftDocs } from './function/bitwise/rightLogShift.js';\nimport { rightArithShiftDocs } from './function/bitwise/rightArithShift.js';\nimport { leftShiftDocs } from './function/bitwise/leftShift.js';\nimport { bitXorDocs } from './function/bitwise/bitXor.js';\nimport { bitOrDocs } from './function/bitwise/bitOr.js';\nimport { bitNotDocs } from './function/bitwise/bitNot.js';\nimport { bitAndDocs } from './function/bitwise/bitAnd.js';\nimport { xgcdDocs } from './function/arithmetic/xgcd.js';\nimport { unaryPlusDocs } from './function/arithmetic/unaryPlus.js';\nimport { unaryMinusDocs } from './function/arithmetic/unaryMinus.js';\nimport { squareDocs } from './function/arithmetic/square.js';\nimport { sqrtmDocs } from './function/arithmetic/sqrtm.js';\nimport { sqrtDocs } from './function/arithmetic/sqrt.js';\nimport { signDocs } from './function/arithmetic/sign.js';\nimport { roundDocs } from './function/arithmetic/round.js';\nimport { powDocs } from './function/arithmetic/pow.js';\nimport { nthRootsDocs } from './function/arithmetic/nthRoots.js';\nimport { nthRootDocs } from './function/arithmetic/nthRoot.js';\nimport { normDocs } from './function/arithmetic/norm.js';\nimport { multiplyDocs } from './function/arithmetic/multiply.js';\nimport { modDocs } from './function/arithmetic/mod.js';\nimport { log10Docs } from './function/arithmetic/log10.js';\nimport { log1pDocs } from './function/arithmetic/log1p.js';\nimport { log2Docs } from './function/arithmetic/log2.js';\nimport { logDocs } from './function/arithmetic/log.js';\nimport { lcmDocs } from './function/arithmetic/lcm.js';\nimport { hypotDocs } from './function/arithmetic/hypot.js';\nimport { gcdDocs } from './function/arithmetic/gcd.js';\nimport { floorDocs } from './function/arithmetic/floor.js';\nimport { fixDocs } from './function/arithmetic/fix.js';\nimport { expm1Docs } from './function/arithmetic/expm1.js';\nimport { expmDocs } from './function/arithmetic/expm.js';\nimport { eigsDocs } from './function/matrix/eigs.js';\nimport { expDocs } from './function/arithmetic/exp.js';\nimport { dotMultiplyDocs } from './function/arithmetic/dotMultiply.js';\nimport { dotDivideDocs } from './function/arithmetic/dotDivide.js';\nimport { divideDocs } from './function/arithmetic/divide.js';\nimport { cubeDocs } from './function/arithmetic/cube.js';\nimport { ceilDocs } from './function/arithmetic/ceil.js';\nimport { cbrtDocs } from './function/arithmetic/cbrt.js';\nimport { addDocs } from './function/arithmetic/add.js';\nimport { absDocs } from './function/arithmetic/abs.js';\nimport { qrDocs } from './function/algebra/qr.js';\nimport { usolveDocs } from './function/algebra/usolve.js';\nimport { usolveAllDocs } from './function/algebra/usolveAll.js';\nimport { sluDocs } from './function/algebra/slu.js';\nimport { rationalizeDocs } from './function/algebra/rationalize.js';\nimport { simplifyDocs } from './function/algebra/simplify.js';\nimport { lupDocs } from './function/algebra/lup.js';\nimport { lsolveDocs } from './function/algebra/lsolve.js';\nimport { lsolveAllDocs } from './function/algebra/lsolveAll.js';\nimport { derivativeDocs } from './function/algebra/derivative.js';\nimport { versionDocs } from './constants/version.js';\nimport { trueDocs } from './constants/true.js';\nimport { tauDocs } from './constants/tau.js';\nimport { SQRT2Docs } from './constants/SQRT2.js';\nimport { SQRT12Docs } from './constants/SQRT1_2.js';\nimport { phiDocs } from './constants/phi.js';\nimport { piDocs } from './constants/pi.js';\nimport { nullDocs } from './constants/null.js';\nimport { NaNDocs } from './constants/NaN.js';\nimport { LOG10EDocs } from './constants/LOG10E.js';\nimport { LOG2EDocs } from './constants/LOG2E.js';\nimport { LN10Docs } from './constants/LN10.js';\nimport { LN2Docs } from './constants/LN2.js';\nimport { InfinityDocs } from './constants/Infinity.js';\nimport { iDocs } from './constants/i.js';\nimport { falseDocs } from './constants/false.js';\nimport { eDocs } from './constants/e.js';\nimport { unitDocs } from './construction/unit.js';\nimport { stringDocs } from './construction/string.js';\nimport { splitUnitDocs } from './construction/splitUnit.js';\nimport { sparseDocs } from './construction/sparse.js';\nimport { numberDocs } from './construction/number.js';\nimport { matrixDocs } from './construction/matrix.js';\nimport { indexDocs } from './construction/index.js';\nimport { fractionDocs } from './construction/fraction.js';\nimport { createUnitDocs } from './construction/createUnit.js';\nimport { complexDocs } from './construction/complex.js';\nimport { booleanDocs } from './construction/boolean.js';\nimport { dotPowDocs } from './function/arithmetic/dotPow.js';\nimport { lusolveDocs } from './function/algebra/lusolve.js';\nimport { subtractDocs } from './function/arithmetic/subtract.js';\nimport { varianceDocs } from './function/statistics/variance.js';\nimport { sinDocs } from './function/trigonometry/sin.js';\nimport { numericDocs } from './function/utils/numeric.js';\nimport { columnDocs } from './function/matrix/column.js';\nimport { rowDocs } from './function/matrix/row.js';\nimport { rotationMatrixDocs } from './function/matrix/rotationMatrix.js';\nimport { rotateDocs } from './function/matrix/rotate.js';\nexport var embeddedDocs = {\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  // 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  // physical constants\n  // TODO: more detailed docs for physical constants\n  speedOfLight: {\n    description: 'Speed of light in vacuum',\n    examples: ['speedOfLight']\n  },\n  gravitationConstant: {\n    description: 'Newtonian constant of gravitation',\n    examples: ['gravitationConstant']\n  },\n  planckConstant: {\n    description: 'Planck constant',\n    examples: ['planckConstant']\n  },\n  reducedPlanckConstant: {\n    description: 'Reduced Planck constant',\n    examples: ['reducedPlanckConstant']\n  },\n  magneticConstant: {\n    description: 'Magnetic constant (vacuum permeability)',\n    examples: ['magneticConstant']\n  },\n  electricConstant: {\n    description: 'Electric constant (vacuum permeability)',\n    examples: ['electricConstant']\n  },\n  vacuumImpedance: {\n    description: 'Characteristic impedance of vacuum',\n    examples: ['vacuumImpedance']\n  },\n  coulomb: {\n    description: 'Coulomb\\'s constant',\n    examples: ['coulomb']\n  },\n  elementaryCharge: {\n    description: 'Elementary charge',\n    examples: ['elementaryCharge']\n  },\n  bohrMagneton: {\n    description: 'Borh magneton',\n    examples: ['bohrMagneton']\n  },\n  conductanceQuantum: {\n    description: 'Conductance quantum',\n    examples: ['conductanceQuantum']\n  },\n  inverseConductanceQuantum: {\n    description: 'Inverse conductance quantum',\n    examples: ['inverseConductanceQuantum']\n  },\n  // josephson: {description: 'Josephson constant', examples: ['josephson']},\n  magneticFluxQuantum: {\n    description: 'Magnetic flux quantum',\n    examples: ['magneticFluxQuantum']\n  },\n  nuclearMagneton: {\n    description: 'Nuclear magneton',\n    examples: ['nuclearMagneton']\n  },\n  klitzing: {\n    description: 'Von Klitzing constant',\n    examples: ['klitzing']\n  },\n  bohrRadius: {\n    description: 'Borh radius',\n    examples: ['bohrRadius']\n  },\n  classicalElectronRadius: {\n    description: 'Classical electron radius',\n    examples: ['classicalElectronRadius']\n  },\n  electronMass: {\n    description: 'Electron mass',\n    examples: ['electronMass']\n  },\n  fermiCoupling: {\n    description: 'Fermi coupling constant',\n    examples: ['fermiCoupling']\n  },\n  fineStructure: {\n    description: 'Fine-structure constant',\n    examples: ['fineStructure']\n  },\n  hartreeEnergy: {\n    description: 'Hartree energy',\n    examples: ['hartreeEnergy']\n  },\n  protonMass: {\n    description: 'Proton mass',\n    examples: ['protonMass']\n  },\n  deuteronMass: {\n    description: 'Deuteron Mass',\n    examples: ['deuteronMass']\n  },\n  neutronMass: {\n    description: 'Neutron mass',\n    examples: ['neutronMass']\n  },\n  quantumOfCirculation: {\n    description: 'Quantum of circulation',\n    examples: ['quantumOfCirculation']\n  },\n  rydberg: {\n    description: 'Rydberg constant',\n    examples: ['rydberg']\n  },\n  thomsonCrossSection: {\n    description: 'Thomson cross section',\n    examples: ['thomsonCrossSection']\n  },\n  weakMixingAngle: {\n    description: 'Weak mixing angle',\n    examples: ['weakMixingAngle']\n  },\n  efimovFactor: {\n    description: 'Efimov factor',\n    examples: ['efimovFactor']\n  },\n  atomicMass: {\n    description: 'Atomic mass constant',\n    examples: ['atomicMass']\n  },\n  avogadro: {\n    description: 'Avogadro\\'s number',\n    examples: ['avogadro']\n  },\n  boltzmann: {\n    description: 'Boltzmann constant',\n    examples: ['boltzmann']\n  },\n  faraday: {\n    description: 'Faraday constant',\n    examples: ['faraday']\n  },\n  firstRadiation: {\n    description: 'First radiation constant',\n    examples: ['firstRadiation']\n  },\n  loschmidt: {\n    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',\n    examples: ['loschmidt']\n  },\n  gasConstant: {\n    description: 'Gas constant',\n    examples: ['gasConstant']\n  },\n  molarPlanckConstant: {\n    description: 'Molar Planck constant',\n    examples: ['molarPlanckConstant']\n  },\n  molarVolume: {\n    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',\n    examples: ['molarVolume']\n  },\n  sackurTetrode: {\n    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',\n    examples: ['sackurTetrode']\n  },\n  secondRadiation: {\n    description: 'Second radiation constant',\n    examples: ['secondRadiation']\n  },\n  stefanBoltzmann: {\n    description: 'Stefan-Boltzmann constant',\n    examples: ['stefanBoltzmann']\n  },\n  wienDisplacement: {\n    description: 'Wien displacement law constant',\n    examples: ['wienDisplacement']\n  },\n  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},\n  molarMass: {\n    description: 'Molar mass constant',\n    examples: ['molarMass']\n  },\n  molarMassC12: {\n    description: 'Molar mass constant of carbon-12',\n    examples: ['molarMassC12']\n  },\n  gravity: {\n    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',\n    examples: ['gravity']\n  },\n  planckLength: {\n    description: 'Planck length',\n    examples: ['planckLength']\n  },\n  planckMass: {\n    description: 'Planck mass',\n    examples: ['planckMass']\n  },\n  planckTime: {\n    description: 'Planck time',\n    examples: ['planckTime']\n  },\n  planckCharge: {\n    description: 'Planck charge',\n    examples: ['planckCharge']\n  },\n  planckTemperature: {\n    description: 'Planck temperature',\n    examples: ['planckTemperature']\n  },\n  // functions - algebra\n  derivative: derivativeDocs,\n  lsolve: lsolveDocs,\n  lsolveAll: lsolveAllDocs,\n  lup: lupDocs,\n  lusolve: lusolveDocs,\n  simplify: simplifyDocs,\n  rationalize: rationalizeDocs,\n  slu: sluDocs,\n  usolve: usolveDocs,\n  usolveAll: usolveAllDocs,\n  qr: qrDocs,\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  // functions - bitwise\n  bitAnd: bitAndDocs,\n  bitNot: bitNotDocs,\n  bitOr: bitOrDocs,\n  bitXor: bitXorDocs,\n  leftShift: leftShiftDocs,\n  rightArithShift: rightArithShiftDocs,\n  rightLogShift: rightLogShiftDocs,\n  // functions - combinatorics\n  bellNumbers: bellNumbersDocs,\n  catalan: catalanDocs,\n  composition: compositionDocs,\n  stirlingS2: stirlingS2Docs,\n  // functions - core\n  config: configDocs,\n  import: importDocs,\n  typed: typedDocs,\n  // functions - complex\n  arg: argDocs,\n  conj: conjDocs,\n  re: reDocs,\n  im: imDocs,\n  // functions - expression\n  evaluate: evaluateDocs,\n  help: helpDocs,\n  // functions - geometry\n  distance: distanceDocs,\n  intersect: intersectDocs,\n  // functions - logical\n  and: andDocs,\n  not: notDocs,\n  or: orDocs,\n  xor: xorDocs,\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  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  // 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  // 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  // 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  // functions - special\n  erf: erfDocs,\n  // functions - statistics\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  // 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  // functions - units\n  to: toDocs,\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 // TODO: add documentation for print as soon as the parser supports objects.\n  typeOf: typeOfDocs,\n  numeric: numericDocs\n};","export var bignumberDocs = {\n  name: 'bignumber',\n  category: 'Construction',\n  syntax: ['bignumber(x)'],\n  description: 'Create a big number from a number or string.',\n  examples: ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber(\"7.2\")', 'bignumber(\"7.2e500\")', 'bignumber([0.1, 0.2, 0.3])'],\n  seealso: ['boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};","export var booleanDocs = {\n  name: 'boolean',\n  category: 'Construction',\n  syntax: ['x', 'boolean(x)'],\n  description: 'Convert a string or number into a boolean.',\n  examples: ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean(\"true\")', 'boolean(\"false\")', 'boolean([1, 0, 1, 1])'],\n  seealso: ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']\n};","export var complexDocs = {\n  name: 'complex',\n  category: 'Construction',\n  syntax: ['complex()', 'complex(re, im)', 'complex(string)'],\n  description: 'Create a complex number.',\n  examples: ['complex()', 'complex(2, 3)', 'complex(\"7 - 2i\")'],\n  seealso: ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']\n};","export var createUnitDocs = {\n  name: 'createUnit',\n  category: 'Construction',\n  syntax: ['createUnit(definitions)', 'createUnit(name, definition)'],\n  description: 'Create a user-defined unit and register it with the Unit type.',\n  examples: ['createUnit(\"foo\")', 'createUnit(\"knot\", {definition: \"0.514444444 m/s\", aliases: [\"knots\", \"kt\", \"kts\"]})', 'createUnit(\"mph\", \"1 mile/hour\")'],\n  seealso: ['unit', 'splitUnit']\n};","export var fractionDocs = {\n  name: 'fraction',\n  category: 'Construction',\n  syntax: ['fraction(num)', 'fraction(num,den)'],\n  description: 'Create a fraction from a number or from a numerator and denominator.',\n  examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']\n};","export var indexDocs = {\n  name: 'index',\n  category: 'Construction',\n  syntax: ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],\n  description: 'Create an index to get or replace a subset of a matrix',\n  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)'],\n  seealso: ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']\n};","export var matrixDocs = {\n  name: 'matrix',\n  category: 'Construction',\n  syntax: ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix(\"dense\")', 'matrix([...])'],\n  description: 'Create a matrix.',\n  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\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']\n};","export var numberDocs = {\n  name: 'number',\n  category: 'Construction',\n  syntax: ['x', 'number(x)', 'number(unit, valuelessUnit)'],\n  description: 'Create a number or convert a string or boolean into a number.',\n  examples: ['2', '2e3', '4.05', 'number(2)', 'number(\"7.2\")', 'number(true)', 'number([true, false, true, true])', 'number(unit(\"52cm\"), \"m\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};","export var sparseDocs = {\n  name: 'sparse',\n  category: 'Construction',\n  syntax: ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], \"number\")'],\n  description: 'Create a sparse matrix.',\n  examples: ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], \"number\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']\n};","export var splitUnitDocs = {\n  name: 'splitUnit',\n  category: 'Construction',\n  syntax: ['splitUnit(unit: Unit, parts: Unit[])'],\n  description: 'Split a unit in an array of units whose sum is equal to the original unit.',\n  examples: ['splitUnit(1 m, [\"feet\", \"inch\"])'],\n  seealso: ['unit', 'createUnit']\n};","export var stringDocs = {\n  name: 'string',\n  category: 'Construction',\n  syntax: ['\"text\"', 'string(x)'],\n  description: 'Create a string or convert a value to a string',\n  examples: ['\"Hello World!\"', 'string(4.2)', 'string(3 + 2i)'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']\n};","export var unitDocs = {\n  name: 'unit',\n  category: 'Construction',\n  syntax: ['value unit', 'unit(value, unit)', 'unit(string)'],\n  description: 'Create a unit.',\n  examples: ['5.5 mm', '3 inch', 'unit(7.1, \"kilogram\")', 'unit(\"23 deg\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']\n};","export var falseDocs = {\n  name: 'false',\n  category: 'Constants',\n  syntax: ['false'],\n  description: 'Boolean value false',\n  examples: ['false'],\n  seealso: ['true']\n};","export var iDocs = {\n  name: 'i',\n  category: 'Constants',\n  syntax: ['i'],\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: ['i', 'i * i', 'sqrt(-1)'],\n  seealso: []\n};","export var InfinityDocs = {\n  name: 'Infinity',\n  category: 'Constants',\n  syntax: ['Infinity'],\n  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',\n  examples: ['Infinity', '1 / 0'],\n  seealso: []\n};","export var LN2Docs = {\n  name: 'LN2',\n  category: 'Constants',\n  syntax: ['LN2'],\n  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',\n  examples: ['LN2', 'log(2)'],\n  seealso: []\n};","export var LN10Docs = {\n  name: 'LN10',\n  category: 'Constants',\n  syntax: ['LN10'],\n  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',\n  examples: ['LN10', 'log(10)'],\n  seealso: []\n};","export var LOG2EDocs = {\n  name: 'LOG2E',\n  category: 'Constants',\n  syntax: ['LOG2E'],\n  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',\n  examples: ['LOG2E', 'log(e, 2)'],\n  seealso: []\n};","export var LOG10EDocs = {\n  name: 'LOG10E',\n  category: 'Constants',\n  syntax: ['LOG10E'],\n  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',\n  examples: ['LOG10E', 'log(e, 10)'],\n  seealso: []\n};","export var NaNDocs = {\n  name: 'NaN',\n  category: 'Constants',\n  syntax: ['NaN'],\n  description: 'Not a number',\n  examples: ['NaN', '0 / 0'],\n  seealso: []\n};","export var nullDocs = {\n  name: 'null',\n  category: 'Constants',\n  syntax: ['null'],\n  description: 'Value null',\n  examples: ['null'],\n  seealso: ['true', 'false']\n};","export var phiDocs = {\n  name: 'phi',\n  category: 'Constants',\n  syntax: ['phi'],\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: ['phi'],\n  seealso: []\n};","export var SQRT12Docs = {\n  name: 'SQRT1_2',\n  category: 'Constants',\n  syntax: ['SQRT1_2'],\n  description: 'Returns the square root of 1/2, approximately equal to 0.707',\n  examples: ['SQRT1_2', 'sqrt(1/2)'],\n  seealso: []\n};","export var SQRT2Docs = {\n  name: 'SQRT2',\n  category: 'Constants',\n  syntax: ['SQRT2'],\n  description: 'Returns the square root of 2, approximately equal to 1.414',\n  examples: ['SQRT2', 'sqrt(2)'],\n  seealso: []\n};","export var tauDocs = {\n  name: 'tau',\n  category: 'Constants',\n  syntax: ['tau'],\n  description: 'Tau is the ratio constant of a circle\\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',\n  examples: ['tau', '2 * pi'],\n  seealso: ['pi']\n};","export var trueDocs = {\n  name: 'true',\n  category: 'Constants',\n  syntax: ['true'],\n  description: 'Boolean value true',\n  examples: ['true'],\n  seealso: ['false']\n};","export var versionDocs = {\n  name: 'version',\n  category: 'Constants',\n  syntax: ['version'],\n  description: 'A string with the version number of math.js',\n  examples: ['version'],\n  seealso: []\n};","export var derivativeDocs = {\n  name: 'derivative',\n  category: 'Algebra',\n  syntax: ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],\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: ['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})'],\n  seealso: ['simplify', 'parse', 'evaluate']\n};","export var lsolveDocs = {\n  name: 'lsolve',\n  category: 'Algebra',\n  syntax: ['x=lsolve(L, b)'],\n  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.',\n  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],\n  seealso: ['lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']\n};","export var lsolveAllDocs = {\n  name: 'lsolveAll',\n  category: 'Algebra',\n  syntax: ['x=lsolveAll(L, b)'],\n  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.',\n  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],\n  seealso: ['lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']\n};","export var lupDocs = {\n  name: 'lup',\n  category: 'Algebra',\n  syntax: ['lup(m)'],\n  description: '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: ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],\n  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']\n};","export var lusolveDocs = {\n  name: 'lusolve',\n  category: 'Algebra',\n  syntax: ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],\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: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],\n  seealso: ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']\n};","export var simplifyDocs = {\n  name: 'simplify',\n  category: 'Algebra',\n  syntax: ['simplify(expr)', 'simplify(expr, rules)'],\n  description: 'Simplify an expression tree.',\n  examples: ['simplify(\"3 + 2 / 4\")', 'simplify(\"2x + x\")', 'f = parse(\"x * (x + 2 + x)\")', 'simplified = simplify(f)', 'simplified.evaluate({x: 2})'],\n  seealso: ['derivative', 'parse', 'evaluate']\n};","export var rationalizeDocs = {\n  name: 'rationalize',\n  category: 'Algebra',\n  syntax: ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],\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: ['rationalize(\"2x/y - y/(x+1)\")', 'rationalize(\"2x/y - y/(x+1)\", true)'],\n  seealso: ['simplify']\n};","export var sluDocs = {\n  name: 'slu',\n  category: 'Algebra',\n  syntax: ['slu(A, order, threshold)'],\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: ['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  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']\n};","export var usolveDocs = {\n  name: 'usolve',\n  category: 'Algebra',\n  syntax: ['x=usolve(U, b)'],\n  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.',\n  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],\n  seealso: ['usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']\n};","export var usolveAllDocs = {\n  name: 'usolveAll',\n  category: 'Algebra',\n  syntax: ['x=usolve(U, b)'],\n  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.',\n  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],\n  seealso: ['usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']\n};","export var qrDocs = {\n  name: 'qr',\n  category: 'Algebra',\n  syntax: ['qr(A)'],\n  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.',\n  examples: ['qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'],\n  seealso: ['lup', 'slu', 'matrix']\n};","export var absDocs = {\n  name: 'abs',\n  category: 'Arithmetic',\n  syntax: ['abs(x)'],\n  description: 'Compute the absolute value.',\n  examples: ['abs(3.5)', 'abs(-4.2)'],\n  seealso: ['sign']\n};","export var addDocs = {\n  name: 'add',\n  category: 'Operators',\n  syntax: ['x + y', 'add(x, y)'],\n  description: 'Add two values.',\n  examples: ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '\"2.3\" + \"4\"'],\n  seealso: ['subtract']\n};","export var cbrtDocs = {\n  name: 'cbrt',\n  category: 'Arithmetic',\n  syntax: ['cbrt(x)', 'cbrt(x, allRoots)'],\n  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',\n  examples: ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],\n  seealso: ['square', 'sqrt', 'cube', 'multiply']\n};","export var ceilDocs = {\n  name: 'ceil',\n  category: 'Arithmetic',\n  syntax: ['ceil(x)'],\n  description: 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',\n  examples: ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)'],\n  seealso: ['floor', 'fix', 'round']\n};","export var cubeDocs = {\n  name: 'cube',\n  category: 'Arithmetic',\n  syntax: ['cube(x)'],\n  description: 'Compute the cube of a value. The cube of x is x * x * x.',\n  examples: ['cube(2)', '2^3', '2 * 2 * 2'],\n  seealso: ['multiply', 'square', 'pow']\n};","export var divideDocs = {\n  name: 'divide',\n  category: 'Operators',\n  syntax: ['x / y', 'divide(x, y)'],\n  description: 'Divide two values.',\n  examples: ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],\n  seealso: ['multiply']\n};","export var dotDivideDocs = {\n  name: 'dotDivide',\n  category: 'Operators',\n  syntax: ['x ./ y', 'dotDivide(x, y)'],\n  description: 'Divide two values element wise.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],\n  seealso: ['multiply', 'dotMultiply', 'divide']\n};","export var dotMultiplyDocs = {\n  name: 'dotMultiply',\n  category: 'Operators',\n  syntax: ['x .* y', 'dotMultiply(x, y)'],\n  description: 'Multiply two values element wise.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],\n  seealso: ['multiply', 'divide', 'dotDivide']\n};","export var dotPowDocs = {\n  name: 'dotPow',\n  category: 'Operators',\n  syntax: ['x .^ y', 'dotPow(x, y)'],\n  description: 'Calculates the power of x to y element wise.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],\n  seealso: ['pow']\n};","export var expDocs = {\n  name: 'exp',\n  category: 'Arithmetic',\n  syntax: ['exp(x)'],\n  description: 'Calculate the exponent of a value.',\n  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'],\n  seealso: ['expm', 'expm1', 'pow', 'log']\n};","export var expmDocs = {\n  name: 'expm',\n  category: 'Arithmetic',\n  syntax: ['exp(x)'],\n  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.',\n  examples: ['expm([[0,2],[0,0]])'],\n  seealso: ['exp']\n};","export var expm1Docs = {\n  name: 'expm1',\n  category: 'Arithmetic',\n  syntax: ['expm1(x)'],\n  description: 'Calculate the value of subtracting 1 from the exponential value.',\n  examples: ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],\n  seealso: ['exp', 'pow', 'log']\n};","export var fixDocs = {\n  name: 'fix',\n  category: 'Arithmetic',\n  syntax: ['fix(x)'],\n  description: 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',\n  examples: ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)'],\n  seealso: ['ceil', 'floor', 'round']\n};","export var floorDocs = {\n  name: 'floor',\n  category: 'Arithmetic',\n  syntax: ['floor(x)'],\n  description: 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',\n  examples: ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)'],\n  seealso: ['ceil', 'fix', 'round']\n};","export var gcdDocs = {\n  name: 'gcd',\n  category: 'Arithmetic',\n  syntax: ['gcd(a, b)', 'gcd(a, b, c, ...)'],\n  description: 'Compute the greatest common divisor.',\n  examples: ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],\n  seealso: ['lcm', 'xgcd']\n};","export var hypotDocs = {\n  name: 'hypot',\n  category: 'Arithmetic',\n  syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],\n  description: 'Calculate the hypotenusa of a list with values. ',\n  examples: ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],\n  seealso: ['abs', 'norm']\n};","export var lcmDocs = {\n  name: 'lcm',\n  category: 'Arithmetic',\n  syntax: ['lcm(x, y)'],\n  description: 'Compute the least common multiple.',\n  examples: ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],\n  seealso: ['gcd']\n};","export var logDocs = {\n  name: 'log',\n  category: 'Arithmetic',\n  syntax: ['log(x)', 'log(x, base)'],\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: ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],\n  seealso: ['exp', 'log1p', 'log2', 'log10']\n};","export var log2Docs = {\n  name: 'log2',\n  category: 'Arithmetic',\n  syntax: ['log2(x)'],\n  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',\n  examples: ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],\n  seealso: ['exp', 'log1p', 'log', 'log10']\n};","export var log1pDocs = {\n  name: 'log1p',\n  category: 'Arithmetic',\n  syntax: ['log1p(x)', 'log1p(x, base)'],\n  description: 'Calculate the logarithm of a `value+1`',\n  examples: ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],\n  seealso: ['exp', 'log', 'log2', 'log10']\n};","export var log10Docs = {\n  name: 'log10',\n  category: 'Arithmetic',\n  syntax: ['log10(x)'],\n  description: 'Compute the 10-base logarithm of a value.',\n  examples: ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],\n  seealso: ['exp', 'log']\n};","export var modDocs = {\n  name: 'mod',\n  category: 'Operators',\n  syntax: ['x % y', 'x mod y', 'mod(x, y)'],\n  description: 'Calculates the modulus, the remainder of an integer division.',\n  examples: ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],\n  seealso: ['divide']\n};","export var multiplyDocs = {\n  name: 'multiply',\n  category: 'Operators',\n  syntax: ['x * y', 'multiply(x, y)'],\n  description: 'multiply two values.',\n  examples: ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],\n  seealso: ['divide']\n};","export var normDocs = {\n  name: 'norm',\n  category: 'Arithmetic',\n  syntax: ['norm(x)', 'norm(x, p)'],\n  description: 'Calculate the norm of a number, vector or matrix.',\n  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\")']\n};","export var nthRootDocs = {\n  name: 'nthRoot',\n  category: 'Arithmetic',\n  syntax: ['nthRoot(a)', 'nthRoot(a, root)'],\n  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\".',\n  examples: ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],\n  seealso: ['nthRoots', 'pow', 'sqrt']\n};","export var nthRootsDocs = {\n  name: 'nthRoots',\n  category: 'Arithmetic',\n  syntax: ['nthRoots(A)', 'nthRoots(A, root)'],\n  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.',\n  examples: ['nthRoots(1)', 'nthRoots(1, 3)'],\n  seealso: ['sqrt', 'pow', 'nthRoot']\n};","export var powDocs = {\n  name: 'pow',\n  category: 'Operators',\n  syntax: ['x ^ y', 'pow(x, y)'],\n  description: 'Calculates the power of x to y, x^y.',\n  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)'],\n  seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']\n};","export var roundDocs = {\n  name: 'round',\n  category: 'Arithmetic',\n  syntax: ['round(x)', 'round(x, n)'],\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.',\n  examples: ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)'],\n  seealso: ['ceil', 'floor', 'fix']\n};","export var signDocs = {\n  name: 'sign',\n  category: 'Arithmetic',\n  syntax: ['sign(x)'],\n  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.',\n  examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],\n  seealso: ['abs']\n};","export var sqrtDocs = {\n  name: 'sqrt',\n  category: 'Arithmetic',\n  syntax: ['sqrt(x)'],\n  description: 'Compute the square root value. If x = y * y, then y is the square root of x.',\n  examples: ['sqrt(25)', '5 * 5', 'sqrt(-1)'],\n  seealso: ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']\n};","export var sqrtmDocs = {\n  name: 'sqrtm',\n  category: 'Arithmetic',\n  syntax: ['sqrtm(x)'],\n  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`.',\n  examples: ['sqrtm([[1, 2], [3, 4]])'],\n  seealso: ['sqrt', 'abs', 'square', 'multiply']\n};","export var squareDocs = {\n  name: 'square',\n  category: 'Arithmetic',\n  syntax: ['square(x)'],\n  description: 'Compute the square of a value. The square of x is x * x.',\n  examples: ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],\n  seealso: ['multiply', 'pow', 'sqrt', 'cube']\n};","export var subtractDocs = {\n  name: 'subtract',\n  category: 'Operators',\n  syntax: ['x - y', 'subtract(x, y)'],\n  description: 'subtract two values.',\n  examples: ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],\n  seealso: ['add']\n};","export var unaryMinusDocs = {\n  name: 'unaryMinus',\n  category: 'Operators',\n  syntax: ['-x', 'unaryMinus(x)'],\n  description: 'Inverse the sign of a value. Converts booleans and strings to numbers.',\n  examples: ['-4.5', '-(-5.6)', '-\"22\"'],\n  seealso: ['add', 'subtract', 'unaryPlus']\n};","export var unaryPlusDocs = {\n  name: 'unaryPlus',\n  category: 'Operators',\n  syntax: ['+x', 'unaryPlus(x)'],\n  description: 'Converts booleans and strings to numbers.',\n  examples: ['+true', '+\"2\"'],\n  seealso: ['add', 'subtract', 'unaryMinus']\n};","export var xgcdDocs = {\n  name: 'xgcd',\n  category: 'Arithmetic',\n  syntax: ['xgcd(a, b)'],\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: ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],\n  seealso: ['gcd', 'lcm']\n};","export var bitAndDocs = {\n  name: 'bitAnd',\n  category: 'Bitwise',\n  syntax: ['x & y', 'bitAnd(x, y)'],\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: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],\n  seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var bitNotDocs = {\n  name: 'bitNot',\n  category: 'Bitwise',\n  syntax: ['~x', 'bitNot(x)'],\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: ['~1', '~2', 'bitNot([2, -3, 4])'],\n  seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var bitOrDocs = {\n  name: 'bitOr',\n  category: 'Bitwise',\n  syntax: ['x | y', 'bitOr(x, y)'],\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: ['5 | 3', 'bitOr([1, 2, 3], 4)'],\n  seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var bitXorDocs = {\n  name: 'bitXor',\n  category: 'Bitwise',\n  syntax: ['bitXor(x, y)'],\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: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var leftShiftDocs = {\n  name: 'leftShift',\n  category: 'Bitwise',\n  syntax: ['x << y', 'leftShift(x, y)'],\n  description: 'Bitwise left logical shift of a value x by y number of bits.',\n  examples: ['4 << 1', '8 >> 1'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']\n};","export var rightArithShiftDocs = {\n  name: 'rightArithShift',\n  category: 'Bitwise',\n  syntax: ['x >> y', 'rightArithShift(x, y)'],\n  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',\n  examples: ['8 >> 1', '4 << 1', '-12 >> 2'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']\n};","export var rightLogShiftDocs = {\n  name: 'rightLogShift',\n  category: 'Bitwise',\n  syntax: ['x >>> y', 'rightLogShift(x, y)'],\n  description: 'Bitwise right logical shift of a value x by y number of bits.',\n  examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']\n};","export var bellNumbersDocs = {\n  name: 'bellNumbers',\n  category: 'Combinatorics',\n  syntax: ['bellNumbers(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: ['bellNumbers(3)', 'bellNumbers(8)'],\n  seealso: ['stirlingS2']\n};","export var catalanDocs = {\n  name: 'catalan',\n  category: 'Combinatorics',\n  syntax: ['catalan(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: ['catalan(3)', 'catalan(8)'],\n  seealso: ['bellNumbers']\n};","export var compositionDocs = {\n  name: 'composition',\n  category: 'Combinatorics',\n  syntax: ['composition(n, k)'],\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: ['composition(5, 3)'],\n  seealso: ['combinations']\n};","export var stirlingS2Docs = {\n  name: 'stirlingS2',\n  category: 'Combinatorics',\n  syntax: ['stirlingS2(n, k)'],\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: ['stirlingS2(5, 3)'],\n  seealso: ['bellNumbers']\n};","export var configDocs = {\n  name: 'config',\n  category: 'Core',\n  syntax: ['config()', 'config(options)'],\n  description: 'Get configuration or change configuration.',\n  examples: ['config()', '1/3 + 1/4', 'config({number: \"Fraction\"})', '1/3 + 1/4'],\n  seealso: []\n};","export var importDocs = {\n  name: 'import',\n  category: 'Core',\n  syntax: ['import(functions)', 'import(functions, options)'],\n  description: 'Import functions or constants from an object.',\n  examples: ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],\n  seealso: []\n};","export var typedDocs = {\n  name: 'typed',\n  category: 'Core',\n  syntax: ['typed(signatures)', 'typed(name, signatures)'],\n  description: 'Create a typed function.',\n  examples: ['double = typed({ \"number, number\": f(x)=x+x })', 'double(2)', 'double(\"hello\")'],\n  seealso: []\n};","export var argDocs = {\n  name: 'arg',\n  category: 'Complex',\n  syntax: ['arg(x)'],\n  description: 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',\n  examples: ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],\n  seealso: ['re', 'im', 'conj', 'abs']\n};","export var conjDocs = {\n  name: 'conj',\n  category: 'Complex',\n  syntax: ['conj(x)'],\n  description: 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',\n  examples: ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],\n  seealso: ['re', 'im', 'abs', 'arg']\n};","export var reDocs = {\n  name: 're',\n  category: 'Complex',\n  syntax: ['re(x)'],\n  description: 'Get the real part of a complex number.',\n  examples: ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],\n  seealso: ['im', 'conj', 'abs', 'arg']\n};","export var imDocs = {\n  name: 'im',\n  category: 'Complex',\n  syntax: ['im(x)'],\n  description: 'Get the imaginary part of a complex number.',\n  examples: ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],\n  seealso: ['re', 'conj', 'abs', 'arg']\n};","export var evaluateDocs = {\n  name: 'evaluate',\n  category: 'Expression',\n  syntax: ['evaluate(expression)', 'evaluate([expr1, expr2, expr3, ...])'],\n  description: 'Evaluate an expression or an array with expressions.',\n  examples: ['evaluate(\"2 + 3\")', 'evaluate(\"sqrt(\" + 4 + \")\")'],\n  seealso: []\n};","export var helpDocs = {\n  name: 'help',\n  category: 'Expression',\n  syntax: ['help(object)', 'help(string)'],\n  description: 'Display documentation on a function or data type.',\n  examples: ['help(sqrt)', 'help(\"complex\")'],\n  seealso: []\n};","export var distanceDocs = {\n  name: 'distance',\n  category: 'Geometry',\n  syntax: ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2]])'],\n  description: 'Calculates the Euclidean distance between two points.',\n  examples: ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],\n  seealso: []\n};","export var intersectDocs = {\n  name: 'intersect',\n  category: 'Geometry',\n  syntax: ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],\n  description: 'Computes the intersection point of lines and/or planes.',\n  examples: ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'],\n  seealso: []\n};","export var andDocs = {\n  name: 'and',\n  category: 'Logical',\n  syntax: ['x and y', 'and(x, y)'],\n  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',\n  examples: ['true and false', 'true and true', '2 and 4'],\n  seealso: ['not', 'or', 'xor']\n};","export var notDocs = {\n  name: 'not',\n  category: 'Logical',\n  syntax: ['not x', 'not(x)'],\n  description: 'Logical not. Flips the boolean value of given argument.',\n  examples: ['not true', 'not false', 'not 2', 'not 0'],\n  seealso: ['and', 'or', 'xor']\n};","export var orDocs = {\n  name: 'or',\n  category: 'Logical',\n  syntax: ['x or y', 'or(x, y)'],\n  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',\n  examples: ['true or false', 'false or false', '0 or 4'],\n  seealso: ['not', 'and', 'xor']\n};","export var xorDocs = {\n  name: 'xor',\n  category: 'Logical',\n  syntax: ['x xor y', 'xor(x, y)'],\n  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',\n  examples: ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],\n  seealso: ['not', 'and', 'or']\n};","export var concatDocs = {\n  name: 'concat',\n  category: 'Matrix',\n  syntax: ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],\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: ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],\n  seealso: ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var countDocs = {\n  name: 'count',\n  category: 'Matrix',\n  syntax: ['count(x)'],\n  description: 'Count the number of elements of a matrix, array or string.',\n  examples: ['a = [1, 2; 3, 4; 5, 6]', 'count(a)', 'size(a)', 'count(\"hello world\")'],\n  seealso: ['size']\n};","export var crossDocs = {\n  name: 'cross',\n  category: 'Matrix',\n  syntax: ['cross(A, B)'],\n  description: 'Calculate the cross product for two vectors in three dimensional space.',\n  examples: ['cross([1, 1, 0],  [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4],  [5, 6, 7])'],\n  seealso: ['multiply', 'dot']\n};","export var columnDocs = {\n  name: 'column',\n  category: 'Matrix',\n  syntax: ['column(x, index)'],\n  description: 'Return a column from a matrix or array.',\n  examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],\n  seealso: ['row']\n};","export var ctransposeDocs = {\n  name: 'ctranspose',\n  category: 'Matrix',\n  syntax: ['x\\'', 'ctranspose(x)'],\n  description: 'Complex Conjugate and Transpose a matrix',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\\'', 'ctranspose(a)'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']\n};","export var detDocs = {\n  name: 'det',\n  category: 'Matrix',\n  syntax: ['det(x)'],\n  description: 'Calculate the determinant of a matrix',\n  examples: ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],\n  seealso: ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var diagDocs = {\n  name: 'diag',\n  category: 'Matrix',\n  syntax: ['diag(x)', 'diag(x, k)'],\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: ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],\n  seealso: ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var diffDocs = {\n  name: 'diff',\n  category: 'Matrix',\n  syntax: ['diff(arr)', 'diff(arr, dim)'],\n  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'],\n  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)'],\n  seealso: ['subtract', 'partitionSelect']\n};","export var dotDocs = {\n  name: 'dot',\n  category: 'Matrix',\n  syntax: ['dot(A, B)', 'A * B'],\n  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',\n  examples: ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],\n  seealso: ['multiply', 'cross']\n};","export var getMatrixDataTypeDocs = {\n  name: 'getMatrixDataType',\n  category: 'Matrix',\n  syntax: ['getMatrixDataType(x)'],\n  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\".',\n  examples: ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, \"text\"])', 'getMatrixDataType([1, bignumber(4)])'],\n  seealso: ['matrix', 'sparse', 'typeOf']\n};","export var identityDocs = {\n  name: 'identity',\n  category: 'Matrix',\n  syntax: ['identity(n)', 'identity(m, n)', 'identity([m, n])'],\n  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',\n  examples: ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],\n  seealso: ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var filterDocs = {\n  name: 'filter',\n  category: 'Matrix',\n  syntax: ['filter(x, test)'],\n  description: 'Filter items in a matrix.',\n  examples: ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],\n  seealso: ['sort', 'map', 'forEach']\n};","export var flattenDocs = {\n  name: 'flatten',\n  category: 'Matrix',\n  syntax: ['flatten(x)'],\n  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],\n  seealso: ['concat', 'resize', 'size', 'squeeze']\n};","export var forEachDocs = {\n  name: 'forEach',\n  category: 'Matrix',\n  syntax: ['forEach(x, callback)'],\n  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',\n  examples: ['forEach([1, 2, 3], function(val) { console.log(val) })'],\n  seealso: ['map', 'sort', 'filter']\n};","export var invDocs = {\n  name: 'inv',\n  category: 'Matrix',\n  syntax: ['inv(x)'],\n  description: 'Calculate the inverse of a matrix',\n  examples: ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var eigsDocs = {\n  name: 'eigs',\n  category: 'Matrix',\n  syntax: ['eigs(x)'],\n  description: 'Calculate the eigenvalues and eigenvectors of a real symmetric matrix',\n  examples: ['eigs([[5, 2.3], [2.3, 1]])'],\n  seealso: ['inv']\n};","export var kronDocs = {\n  name: 'kron',\n  category: 'Matrix',\n  syntax: ['kron(x, y)'],\n  description: 'Calculates the kronecker product of 2 matrices or vectors.',\n  examples: ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],\n  seealso: ['multiply', 'dot', 'cross']\n};","export var mapDocs = {\n  name: 'map',\n  category: 'Matrix',\n  syntax: ['map(x, callback)'],\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: ['map([1, 2, 3], square)'],\n  seealso: ['filter', 'forEach']\n};","export var onesDocs = {\n  name: 'ones',\n  category: 'Matrix',\n  syntax: ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],\n  description: 'Create a matrix containing ones.',\n  examples: ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var partitionSelectDocs = {\n  name: 'partitionSelect',\n  category: 'Matrix',\n  syntax: ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],\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: ['partitionSelect([5, 10, 1], 2)', 'partitionSelect([\"C\", \"B\", \"A\", \"D\"], 1)'],\n  seealso: ['sort']\n};","export var rangeDocs = {\n  name: 'range',\n  category: 'Type',\n  syntax: ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],\n  description: 'Create a range. Lower bound of the range is included, upper bound is excluded.',\n  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]'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var resizeDocs = {\n  name: 'resize',\n  category: 'Matrix',\n  syntax: ['resize(x, size)', 'resize(x, size, defaultValue)'],\n  description: 'Resize a matrix.',\n  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], \"!\")'],\n  seealso: ['size', 'subset', 'squeeze', 'reshape']\n};","export var reshapeDocs = {\n  name: 'reshape',\n  category: 'Matrix',\n  syntax: ['reshape(x, sizes)'],\n  description: 'Reshape a multi dimensional array to fit the specified dimensions.',\n  examples: ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])'],\n  seealso: ['size', 'squeeze', 'resize']\n};","export var rotateDocs = {\n  name: 'rotate',\n  category: 'Matrix',\n  syntax: ['rotate(w, theta)', 'rotate(w, theta, v)'],\n  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.',\n  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]))'],\n  seealso: ['matrix', 'rotationMatrix']\n};","export var rotationMatrixDocs = {\n  name: 'rotationMatrix',\n  category: 'Matrix',\n  syntax: ['rotationMatrix(theta)', 'rotationMatrix(theta, v)', 'rotationMatrix(theta, v, format)'],\n  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.',\n  examples: ['rotationMatrix(pi / 2)', 'rotationMatrix(unit(\"45deg\"), [0, 0, 1])', 'rotationMatrix(1, matrix([0, 0, 1]), \"sparse\")'],\n  seealso: ['cos', 'sin']\n};","export var rowDocs = {\n  name: 'row',\n  category: 'Matrix',\n  syntax: ['row(x, index)'],\n  description: 'Return a row from a matrix or array.',\n  examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],\n  seealso: ['column']\n};","export var sizeDocs = {\n  name: 'size',\n  category: 'Matrix',\n  syntax: ['size(x)'],\n  description: 'Calculate the size of a matrix.',\n  examples: ['size(2.3)', 'size(\"hello world\")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],\n  seealso: ['concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var sortDocs = {\n  name: 'sort',\n  category: 'Matrix',\n  syntax: ['sort(x)', 'sort(x, compare)'],\n  description: 'Sort the items in a matrix. Compare can be a string \"asc\", \"desc\", \"natural\", or a custom sort function.',\n  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\")'],\n  seealso: ['map', 'filter', 'forEach']\n};","export var squeezeDocs = {\n  name: 'squeeze',\n  category: 'Matrix',\n  syntax: ['squeeze(x)'],\n  description: 'Remove inner and outer singleton dimensions from a matrix.',\n  examples: ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']\n};","export var subsetDocs = {\n  name: 'subset',\n  category: 'Matrix',\n  syntax: ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],\n  description: 'Get or set a subset of a matrix or string. ' + 'Indexes are one-based. ' + 'Both the ranges lower-bound and upper-bound are included.',\n  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]'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']\n};","export var traceDocs = {\n  name: 'trace',\n  category: 'Matrix',\n  syntax: ['trace(A)'],\n  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',\n  examples: ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']\n};","export var transposeDocs = {\n  name: 'transpose',\n  category: 'Matrix',\n  syntax: ['x\\'', 'transpose(x)'],\n  description: 'Transpose a matrix',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\\'', 'transpose(a)'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']\n};","export var zerosDocs = {\n  name: 'zeros',\n  category: 'Matrix',\n  syntax: ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],\n  description: 'Create a matrix containing zeros.',\n  examples: ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']\n};","export var combinationsDocs = {\n  name: 'combinations',\n  category: 'Probability',\n  syntax: ['combinations(n, k)'],\n  description: 'Compute the number of combinations of n items taken k at a time',\n  examples: ['combinations(7, 5)'],\n  seealso: ['combinationsWithRep', 'permutations', 'factorial']\n};","export var combinationsWithRepDocs = {\n  name: 'combinationsWithRep',\n  category: 'Probability',\n  syntax: ['combinationsWithRep(n, k)'],\n  description: 'Compute the number of combinations of n items taken k at a time with replacements.',\n  examples: ['combinationsWithRep(7, 5)'],\n  seealso: ['combinations', 'permutations', 'factorial']\n};","export var factorialDocs = {\n  name: 'factorial',\n  category: 'Probability',\n  syntax: ['n!', 'factorial(n)'],\n  description: 'Compute the factorial of a value',\n  examples: ['5!', '5 * 4 * 3 * 2 * 1', '3!'],\n  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']\n};","export var gammaDocs = {\n  name: 'gamma',\n  category: 'Probability',\n  syntax: ['gamma(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: ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],\n  seealso: ['factorial']\n};","export var kldivergenceDocs = {\n  name: 'kldivergence',\n  category: 'Probability',\n  syntax: ['kldivergence(x, y)'],\n  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',\n  examples: ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],\n  seealso: []\n};","export var multinomialDocs = {\n  name: 'multinomial',\n  category: 'Probability',\n  syntax: ['multinomial(A)'],\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: ['multinomial([1, 2, 1])'],\n  seealso: ['combinations', 'factorial']\n};","export var permutationsDocs = {\n  name: 'permutations',\n  category: 'Probability',\n  syntax: ['permutations(n)', 'permutations(n, k)'],\n  description: 'Compute the number of permutations of n items taken k at a time',\n  examples: ['permutations(5)', 'permutations(5, 3)'],\n  seealso: ['combinations', 'combinationsWithRep', 'factorial']\n};","export var pickRandomDocs = {\n  name: 'pickRandom',\n  category: 'Probability',\n  syntax: ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],\n  description: 'Pick a random entry from a given array.',\n  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)'],\n  seealso: ['random', 'randomInt']\n};","export var randomDocs = {\n  name: 'random',\n  category: 'Probability',\n  syntax: ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],\n  description: 'Return a random number.',\n  examples: ['random()', 'random(10, 20)', 'random([2, 3])'],\n  seealso: ['pickRandom', 'randomInt']\n};","export var randomIntDocs = {\n  name: 'randomInt',\n  category: 'Probability',\n  syntax: ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],\n  description: 'Return a random integer number',\n  examples: ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],\n  seealso: ['pickRandom', 'random']\n};","export var compareDocs = {\n  name: 'compare',\n  category: 'Relational',\n  syntax: ['compare(x, y)'],\n  description: 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],\n  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']\n};","export var compareNaturalDocs = {\n  name: 'compareNatural',\n  category: 'Relational',\n  syntax: ['compareNatural(x, y)'],\n  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.',\n  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})'],\n  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']\n};","export var compareTextDocs = {\n  name: 'compareText',\n  category: 'Relational',\n  syntax: ['compareText(x, y)'],\n  description: 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  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\"])'],\n  seealso: ['compare', 'compareNatural']\n};","export var deepEqualDocs = {\n  name: 'deepEqual',\n  category: 'Relational',\n  syntax: ['deepEqual(x, y)'],\n  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.',\n  examples: ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],\n  seealso: ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']\n};","export var equalDocs = {\n  name: 'equal',\n  category: 'Relational',\n  syntax: ['x == y', 'equal(x, y)'],\n  description: 'Check equality of two values. Returns true if the values are equal, and false if not.',\n  examples: ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],\n  seealso: ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']\n};","export var equalTextDocs = {\n  name: 'equalText',\n  category: 'Relational',\n  syntax: ['equalText(x, y)'],\n  description: 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',\n  examples: ['equalText(\"Hello\", \"Hello\")', 'equalText(\"a\", \"A\")', 'equal(\"2e3\", \"2000\")', 'equalText(\"2e3\", \"2000\")', 'equalText(\"B\", [\"A\", \"B\", \"C\"])'],\n  seealso: ['compare', 'compareNatural', 'compareText', 'equal']\n};","export var largerDocs = {\n  name: 'larger',\n  category: 'Relational',\n  syntax: ['x > y', 'larger(x, y)'],\n  description: 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.',\n  examples: ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],\n  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']\n};","export var largerEqDocs = {\n  name: 'largerEq',\n  category: 'Relational',\n  syntax: ['x >= y', 'largerEq(x, y)'],\n  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.',\n  examples: ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],\n  seealso: ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']\n};","export var smallerDocs = {\n  name: 'smaller',\n  category: 'Relational',\n  syntax: ['x < y', 'smaller(x, y)'],\n  description: 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.',\n  examples: ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],\n  seealso: ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']\n};","export var smallerEqDocs = {\n  name: 'smallerEq',\n  category: 'Relational',\n  syntax: ['x <= y', 'smallerEq(x, y)'],\n  description: '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: ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],\n  seealso: ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']\n};","export var unequalDocs = {\n  name: 'unequal',\n  category: 'Relational',\n  syntax: ['x != y', 'unequal(x, y)'],\n  description: 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',\n  examples: ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],\n  seealso: ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']\n};","export var setCartesianDocs = {\n  name: 'setCartesian',\n  category: 'Set',\n  syntax: ['setCartesian(set1, set2)'],\n  description: 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setCartesian([1, 2], [3, 4])'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']\n};","export var setDifferenceDocs = {\n  name: 'setDifference',\n  category: 'Set',\n  syntax: ['setDifference(set1, set2)'],\n  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.',\n  examples: ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setUnion', 'setIntersect', 'setSymDifference']\n};","export var setDistinctDocs = {\n  name: 'setDistinct',\n  category: 'Set',\n  syntax: ['setDistinct(set)'],\n  description: 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: ['setDistinct([1, 1, 1, 2, 2, 3])'],\n  seealso: ['setMultiplicity']\n};","export var setIntersectDocs = {\n  name: 'setIntersect',\n  category: 'Set',\n  syntax: ['setIntersect(set1, set2)'],\n  description: 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setUnion', 'setDifference']\n};","export var setIsSubsetDocs = {\n  name: 'setIsSubset',\n  category: 'Set',\n  syntax: ['setIsSubset(set1, set2)'],\n  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.',\n  examples: ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference']\n};","export var setMultiplicityDocs = {\n  name: 'setMultiplicity',\n  category: 'Set',\n  syntax: ['setMultiplicity(element, set)'],\n  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.',\n  examples: ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],\n  seealso: ['setDistinct', 'setSize']\n};","export var setPowersetDocs = {\n  name: 'setPowerset',\n  category: 'Set',\n  syntax: ['setPowerset(set)'],\n  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.',\n  examples: ['setPowerset([1, 2, 3])'],\n  seealso: ['setCartesian']\n};","export var setSizeDocs = {\n  name: 'setSize',\n  category: 'Set',\n  syntax: ['setSize(set)', 'setSize(set, unique)'],\n  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.',\n  examples: ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference']\n};","export var setSymDifferenceDocs = {\n  name: 'setSymDifference',\n  category: 'Set',\n  syntax: ['setSymDifference(set1, set2)'],\n  description: 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference']\n};","export var setUnionDocs = {\n  name: 'setUnion',\n  category: 'Set',\n  syntax: ['setUnion(set1, set2)'],\n  description: 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setIntersect', 'setDifference']\n};","export var erfDocs = {\n  name: 'erf',\n  category: 'Special',\n  syntax: ['erf(x)'],\n  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',\n  examples: ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],\n  seealso: []\n};","export var madDocs = {\n  name: 'mad',\n  category: 'Statistics',\n  syntax: ['mad(a, b, c, ...)', 'mad(A)'],\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: ['mad(10, 20, 30)', 'mad([1, 2, 3])'],\n  seealso: ['mean', 'median', 'std', 'abs']\n};","export var maxDocs = {\n  name: 'max',\n  category: 'Statistics',\n  syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dim)'],\n  description: 'Compute the maximum value of a list of values.',\n  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)'],\n  seealso: ['mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']\n};","export var meanDocs = {\n  name: 'mean',\n  category: 'Statistics',\n  syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dim)'],\n  description: 'Compute the arithmetic mean of a list of values.',\n  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])'],\n  seealso: ['max', 'median', 'min', 'prod', 'std', 'sum', 'variance']\n};","export var medianDocs = {\n  name: 'median',\n  category: 'Statistics',\n  syntax: ['median(a, b, c, ...)', 'median(A)'],\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: ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],\n  seealso: ['max', 'mean', 'min', 'prod', 'std', 'sum', 'variance', 'quantileSeq']\n};","export var minDocs = {\n  name: 'min',\n  category: 'Statistics',\n  syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dim)'],\n  description: 'Compute the minimum value of a list of values.',\n  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)'],\n  seealso: ['max', 'mean', 'median', 'prod', 'std', 'sum', 'variance']\n};","export var modeDocs = {\n  name: 'mode',\n  category: 'Statistics',\n  syntax: ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],\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: ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],\n  seealso: ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'variance']\n};","export var prodDocs = {\n  name: 'prod',\n  category: 'Statistics',\n  syntax: ['prod(a, b, c, ...)', 'prod(A)'],\n  description: 'Compute the product of all values.',\n  examples: ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],\n  seealso: ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'variance']\n};","export var quantileSeqDocs = {\n  name: 'quantileSeq',\n  category: 'Statistics',\n  syntax: ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],\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: ['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)'],\n  seealso: ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'variance']\n};","export var stdDocs = {\n  name: 'std',\n  category: 'Statistics',\n  syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, normalization)'],\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: ['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])'],\n  seealso: ['max', 'mean', 'min', 'median', 'prod', 'sum', 'variance']\n};","export var sumDocs = {\n  name: 'sum',\n  category: 'Statistics',\n  syntax: ['sum(a, b, c, ...)', 'sum(A)'],\n  description: 'Compute the sum of all values.',\n  examples: ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],\n  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']\n};","export var varianceDocs = {\n  name: 'variance',\n  category: 'Statistics',\n  syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, normalization)'],\n  description: 'Compute the variance of all values. Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  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])'],\n  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']\n};","export var acosDocs = {\n  name: 'acos',\n  category: 'Trigonometry',\n  syntax: ['acos(x)'],\n  description: 'Compute the inverse cosine of a value in radians.',\n  examples: ['acos(0.5)', 'acos(cos(2.3))'],\n  seealso: ['cos', 'atan', 'asin']\n};","export var acoshDocs = {\n  name: 'acosh',\n  category: 'Trigonometry',\n  syntax: ['acosh(x)'],\n  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',\n  examples: ['acosh(1.5)'],\n  seealso: ['cosh', 'asinh', 'atanh']\n};","export var acotDocs = {\n  name: 'acot',\n  category: 'Trigonometry',\n  syntax: ['acot(x)'],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],\n  seealso: ['cot', 'atan']\n};","export var acothDocs = {\n  name: 'acoth',\n  category: 'Trigonometry',\n  syntax: ['acoth(x)'],\n  description: 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',\n  examples: ['acoth(2)', 'acoth(0.5)'],\n  seealso: ['acsch', 'asech']\n};","export var acscDocs = {\n  name: 'acsc',\n  category: 'Trigonometry',\n  syntax: ['acsc(x)'],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],\n  seealso: ['csc', 'asin', 'asec']\n};","export var acschDocs = {\n  name: 'acsch',\n  category: 'Trigonometry',\n  syntax: ['acsch(x)'],\n  description: 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',\n  examples: ['acsch(0.5)'],\n  seealso: ['asech', 'acoth']\n};","export var asecDocs = {\n  name: 'asec',\n  category: 'Trigonometry',\n  syntax: ['asec(x)'],\n  description: 'Calculate the inverse secant of a value.',\n  examples: ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],\n  seealso: ['acos', 'acot', 'acsc']\n};","export var asechDocs = {\n  name: 'asech',\n  category: 'Trigonometry',\n  syntax: ['asech(x)'],\n  description: 'Calculate the inverse secant of a value.',\n  examples: ['asech(0.5)'],\n  seealso: ['acsch', 'acoth']\n};","export var asinDocs = {\n  name: 'asin',\n  category: 'Trigonometry',\n  syntax: ['asin(x)'],\n  description: 'Compute the inverse sine of a value in radians.',\n  examples: ['asin(0.5)', 'asin(sin(0.5))'],\n  seealso: ['sin', 'acos', 'atan']\n};","export var asinhDocs = {\n  name: 'asinh',\n  category: 'Trigonometry',\n  syntax: ['asinh(x)'],\n  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',\n  examples: ['asinh(0.5)'],\n  seealso: ['acosh', 'atanh']\n};","export var atanDocs = {\n  name: 'atan',\n  category: 'Trigonometry',\n  syntax: ['atan(x)'],\n  description: 'Compute the inverse tangent of a value in radians.',\n  examples: ['atan(0.5)', 'atan(tan(0.5))'],\n  seealso: ['tan', 'acos', 'asin']\n};","export var atanhDocs = {\n  name: 'atanh',\n  category: 'Trigonometry',\n  syntax: ['atanh(x)'],\n  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',\n  examples: ['atanh(0.5)'],\n  seealso: ['acosh', 'asinh']\n};","export var atan2Docs = {\n  name: 'atan2',\n  category: 'Trigonometry',\n  syntax: ['atan2(y, x)'],\n  description: 'Computes the principal value of the arc tangent of y/x in radians.',\n  examples: ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],\n  seealso: ['sin', 'cos', 'tan']\n};","export var cosDocs = {\n  name: 'cos',\n  category: 'Trigonometry',\n  syntax: ['cos(x)'],\n  description: 'Compute the cosine of x in radians.',\n  examples: ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],\n  seealso: ['acos', 'sin', 'tan']\n};","export var coshDocs = {\n  name: 'cosh',\n  category: 'Trigonometry',\n  syntax: ['cosh(x)'],\n  description: 'Compute the hyperbolic cosine of x in radians.',\n  examples: ['cosh(0.5)'],\n  seealso: ['sinh', 'tanh', 'coth']\n};","export var cotDocs = {\n  name: 'cot',\n  category: 'Trigonometry',\n  syntax: ['cot(x)'],\n  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',\n  examples: ['cot(2)', '1 / tan(2)'],\n  seealso: ['sec', 'csc', 'tan']\n};","export var cothDocs = {\n  name: 'coth',\n  category: 'Trigonometry',\n  syntax: ['coth(x)'],\n  description: 'Compute the hyperbolic cotangent of x in radians.',\n  examples: ['coth(2)', '1 / tanh(2)'],\n  seealso: ['sech', 'csch', 'tanh']\n};","export var cscDocs = {\n  name: 'csc',\n  category: 'Trigonometry',\n  syntax: ['csc(x)'],\n  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',\n  examples: ['csc(2)', '1 / sin(2)'],\n  seealso: ['sec', 'cot', 'sin']\n};","export var cschDocs = {\n  name: 'csch',\n  category: 'Trigonometry',\n  syntax: ['csch(x)'],\n  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',\n  examples: ['csch(2)', '1 / sinh(2)'],\n  seealso: ['sech', 'coth', 'sinh']\n};","export var secDocs = {\n  name: 'sec',\n  category: 'Trigonometry',\n  syntax: ['sec(x)'],\n  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',\n  examples: ['sec(2)', '1 / cos(2)'],\n  seealso: ['cot', 'csc', 'cos']\n};","export var sechDocs = {\n  name: 'sech',\n  category: 'Trigonometry',\n  syntax: ['sech(x)'],\n  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',\n  examples: ['sech(2)', '1 / cosh(2)'],\n  seealso: ['coth', 'csch', 'cosh']\n};","export var sinDocs = {\n  name: 'sin',\n  category: 'Trigonometry',\n  syntax: ['sin(x)'],\n  description: 'Compute the sine of x in radians.',\n  examples: ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],\n  seealso: ['asin', 'cos', 'tan']\n};","export var sinhDocs = {\n  name: 'sinh',\n  category: 'Trigonometry',\n  syntax: ['sinh(x)'],\n  description: 'Compute the hyperbolic sine of x in radians.',\n  examples: ['sinh(0.5)'],\n  seealso: ['cosh', 'tanh']\n};","export var tanDocs = {\n  name: 'tan',\n  category: 'Trigonometry',\n  syntax: ['tan(x)'],\n  description: 'Compute the tangent of x in radians.',\n  examples: ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],\n  seealso: ['atan', 'sin', 'cos']\n};","export var tanhDocs = {\n  name: 'tanh',\n  category: 'Trigonometry',\n  syntax: ['tanh(x)'],\n  description: 'Compute the hyperbolic tangent of x in radians.',\n  examples: ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],\n  seealso: ['sinh', 'cosh']\n};","export var toDocs = {\n  name: 'to',\n  category: 'Units',\n  syntax: ['x to unit', 'to(x, unit)'],\n  description: 'Change the unit of a value.',\n  examples: ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],\n  seealso: []\n};","export var cloneDocs = {\n  name: 'clone',\n  category: 'Utils',\n  syntax: ['clone(x)'],\n  description: 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices',\n  examples: ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone(\"hello world\")'],\n  seealso: []\n};","export var formatDocs = {\n  name: 'format',\n  category: 'Utils',\n  syntax: ['format(value)', 'format(value, precision)'],\n  description: 'Format a value of any type as string.',\n  examples: ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],\n  seealso: ['print']\n};","export var binDocs = {\n  name: 'bin',\n  category: 'Utils',\n  syntax: ['bin(value)'],\n  description: 'Format a number as binary',\n  examples: ['bin(2)'],\n  seealso: ['oct', 'hex']\n};","export var octDocs = {\n  name: 'oct',\n  category: 'Utils',\n  syntax: ['oct(value)'],\n  description: 'Format a number as octal',\n  examples: ['oct(56)'],\n  seealso: ['bin', 'hex']\n};","export var hexDocs = {\n  name: 'hex',\n  category: 'Utils',\n  syntax: ['hex(value)'],\n  description: 'Format a number as hexadecimal',\n  examples: ['hex(240)'],\n  seealso: ['bin', 'oct']\n};","export var isNaNDocs = {\n  name: 'isNaN',\n  category: 'Utils',\n  syntax: ['isNaN(x)'],\n  description: 'Test whether a value is NaN (not a number)',\n  examples: ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n};","export var isIntegerDocs = {\n  name: 'isInteger',\n  category: 'Utils',\n  syntax: ['isInteger(x)'],\n  description: 'Test whether a value is an integer number.',\n  examples: ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n};","export var isNegativeDocs = {\n  name: 'isNegative',\n  category: 'Utils',\n  syntax: ['isNegative(x)'],\n  description: 'Test whether a value is negative: smaller than zero.',\n  examples: ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],\n  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']\n};","export var isNumericDocs = {\n  name: 'isNumeric',\n  category: 'Utils',\n  syntax: ['isNumeric(x)'],\n  description: 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',\n  examples: ['isNumeric(2)', 'isNumeric(\"2\")', 'hasNumericValue(\"2\")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, \"foo\", false])'],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']\n};","export var hasNumericValueDocs = {\n  name: 'hasNumericValue',\n  category: 'Utils',\n  syntax: ['hasNumericValue(x)'],\n  description: 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',\n  examples: ['hasNumericValue(2)', 'hasNumericValue(\"2\")', 'isNumeric(\"2\")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, \"foo\", false])'],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']\n};","export var isPositiveDocs = {\n  name: 'isPositive',\n  category: 'Utils',\n  syntax: ['isPositive(x)'],\n  description: 'Test whether a value is positive: larger than zero.',\n  examples: ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n};","export var isPrimeDocs = {\n  name: 'isPrime',\n  category: 'Utils',\n  syntax: ['isPrime(x)'],\n  description: 'Test whether a value is prime: has no divisors other than itself and one.',\n  examples: ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n};","export var isZeroDocs = {\n  name: 'isZero',\n  category: 'Utils',\n  syntax: ['isZero(x)'],\n  description: 'Test whether a value is zero.',\n  examples: ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']\n};","export var typeOfDocs = {\n  name: 'typeOf',\n  category: 'Utils',\n  syntax: ['typeOf(x)'],\n  description: 'Get the type of a variable.',\n  examples: ['typeOf(3.5)', 'typeOf(2 - 4i)', 'typeOf(45 deg)', 'typeOf(\"hello world\")'],\n  seealso: ['getMatrixDataType']\n};","export var numericDocs = {\n  name: 'numeric',\n  category: 'Utils',\n  syntax: ['numeric(x)'],\n  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.',\n  examples: ['numeric(\"4\")', 'numeric(\"4\", \"number\")', 'numeric(\"4\", \"BigNumber\")', 'numeric(\"4\", \"Fraction)', 'numeric(4, \"Fraction\")', 'numeric(fraction(2, 5), \"number)'],\n  seealso: ['number', 'fraction', 'bignumber', 'string', 'format']\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';\nvar name = 'help';\nvar dependencies = ['typed', 'mathWithTransform', 'Help'];\nexport var createHelp = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    mathWithTransform,\n    Help\n  } = _ref;\n\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 any(search) {\n      var prop;\n      var 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        /* 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\n      var doc = getSafeProperty(embeddedDocs, searchName);\n\n      if (!doc) {\n        var searchText = typeof searchName === 'function' ? searchName.name : searchName;\n        throw new Error('No documentation found on \"' + searchText + '\"');\n      }\n\n      return new Help(doc);\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'compile';\nvar dependencies = ['typed', 'parse'];\nexport var createCompile = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    parse\n  } = _ref;\n\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 string(expr) {\n      return parse(expr).compile();\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile();\n      });\n    }\n  });\n});","import { isOperatorNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nimport { hasOwnProperty } from '../../../utils/object.js';\nvar name = 'simplifyUtil';\nvar dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];\nexport var createUtil = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  } = _ref;\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  var commutative = {\n    add: true,\n    multiply: true\n  };\n  var associative = {\n    add: true,\n    multiply: true\n  };\n\n  function isCommutative(node, context) {\n    if (!isOperatorNode(node)) {\n      return true;\n    }\n\n    var name = node.fn.toString();\n\n    if (context && hasOwnProperty(context, name) && hasOwnProperty(context[name], 'commutative')) {\n      return context[name].commutative;\n    }\n\n    return commutative[name] || false;\n  }\n\n  function isAssociative(node, context) {\n    if (!isOperatorNode(node)) {\n      return false;\n    }\n\n    var name = node.fn.toString();\n\n    if (context && hasOwnProperty(context, name) && hasOwnProperty(context[name], 'associative')) {\n      return context[name].associative;\n    }\n\n    return associative[name] || false;\n  }\n  /**\n   * Flatten all associative operators in an expression tree.\n   * Assumes parentheses have already been removed.\n   */\n\n\n  function flatten(node) {\n    if (!node.args || node.args.length === 0) {\n      return node;\n    }\n\n    node.args = allChildren(node);\n\n    for (var i = 0; i < node.args.length; i++) {\n      flatten(node.args[i]);\n    }\n  }\n  /**\n   * Get the children of a node as if it has been flattened.\n   * TODO implement for FunctionNodes\n   */\n\n\n  function allChildren(node) {\n    var op;\n    var children = [];\n\n    var findChildren = function findChildren(node) {\n      for (var i = 0; i < node.args.length; i++) {\n        var child = node.args[i];\n\n        if (isOperatorNode(child) && op === child.op) {\n          findChildren(child);\n        } else {\n          children.push(child);\n        }\n      }\n    };\n\n    if (isAssociative(node)) {\n      op = node.op;\n      findChildren(node);\n      return children;\n    } else {\n      return node.args;\n    }\n  }\n  /**\n   *  Unflatten all flattened operators to a right-heavy binary tree.\n   */\n\n\n  function unflattenr(node) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n\n    for (var i = 0; i < l; i++) {\n      unflattenr(node.args[i]);\n    }\n\n    if (l > 2 && isAssociative(node)) {\n      var curnode = node.args.pop();\n\n      while (node.args.length > 0) {\n        curnode = makeNode([node.args.pop(), curnode]);\n      }\n\n      node.args = curnode.args;\n    }\n  }\n  /**\n   *  Unflatten all flattened operators to a left-heavy binary tree.\n   */\n\n\n  function unflattenl(node) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n\n    for (var i = 0; i < l; i++) {\n      unflattenl(node.args[i]);\n    }\n\n    if (l > 2 && isAssociative(node)) {\n      var curnode = node.args.shift();\n\n      while (node.args.length > 0) {\n        curnode = makeNode([curnode, node.args.shift()]);\n      }\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    isCommutative,\n    isAssociative,\n    flatten,\n    allChildren,\n    unflattenr,\n    unflattenl\n  };\n});","import { isConstantNode, isFunctionNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'simplifyCore';\nvar dependencies = ['equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'ParenthesisNode'];\nexport var createSimplifyCore = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    ParenthesisNode\n  } = _ref;\n  var node0 = new ConstantNode(0);\n  var node1 = new ConstantNode(1);\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   *     simplify.simplifyCore(expr)\n   *\n   * Examples:\n   *\n   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')\n   *     math.simplify.simpifyCore(f)                          // Node {2 * x}\n   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplify.simpifyCore]) // Node {2 * x}\n   *\n   * See also:\n   *\n   *     derivative\n   *\n   * @param {Node} node\n   *     The expression to be simplified\n   */\n\n  function simplifyCore(node) {\n    if (isOperatorNode(node) && node.isUnary()) {\n      var a0 = simplifyCore(node.args[0]);\n\n      if (node.op === '+') {\n        // unary plus\n        return a0;\n      }\n\n      if (node.op === '-') {\n        // 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\n        return new OperatorNode(node.op, node.fn, [a0]);\n      }\n    } else if (isOperatorNode(node) && node.isBinary()) {\n      var _a = simplifyCore(node.args[0]);\n\n      var a1 = simplifyCore(node.args[1]);\n\n      if (node.op === '+') {\n        if (isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return a1;\n          } else if (isConstantNode(a1)) {\n            return new ConstantNode(add(_a.value, a1.value));\n          }\n        }\n\n        if (isConstantNode(a1) && isZero(a1.value)) {\n          return _a;\n        }\n\n        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n          return new OperatorNode('-', 'subtract', [_a, a1.args[0]]);\n        }\n\n        return new OperatorNode(node.op, node.fn, a1 ? [_a, a1] : [_a]);\n      } else if (node.op === '-') {\n        if (isConstantNode(_a) && a1) {\n          if (isConstantNode(a1)) {\n            return new ConstantNode(subtract(_a.value, a1.value));\n          } else if (isZero(_a.value)) {\n            return new OperatorNode('-', 'unaryMinus', [a1]);\n          }\n        } // if (node.fn === \"subtract\" && node.args.length === 2) {\n\n\n        if (node.fn === 'subtract') {\n          if (isConstantNode(a1) && isZero(a1.value)) {\n            return _a;\n          }\n\n          if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n            return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]));\n          }\n\n          return new OperatorNode(node.op, node.fn, [_a, a1]);\n        }\n      } else if (node.op === '*') {\n        if (isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (equal(_a.value, 1)) {\n            return a1;\n          } else if (isConstantNode(a1)) {\n            return new ConstantNode(multiply(_a.value, a1.value));\n          }\n        }\n\n        if (isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node0;\n          } else if (equal(a1.value, 1)) {\n            return _a;\n          } else if (isOperatorNode(_a) && _a.isBinary() && _a.op === node.op) {\n            var a00 = _a.args[0];\n\n            if (isConstantNode(a00)) {\n              var a00a1 = new ConstantNode(multiply(a00.value, a1.value));\n              return new OperatorNode(node.op, node.fn, [a00a1, _a.args[1]], node.implicit); // constants on left\n            }\n          }\n\n          return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);\n      } else if (node.op === '/') {\n        if (isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (isConstantNode(a1) && (equal(a1.value, 1) || equal(a1.value, 2) || equal(a1.value, 4))) {\n            return new ConstantNode(divide(_a.value, a1.value));\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, 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 _a;\n          } else {\n            if (isConstantNode(_a)) {\n              // fold constant\n              return new ConstantNode(pow(_a.value, a1.value));\n            } else if (isOperatorNode(_a) && _a.isBinary() && _a.op === '^') {\n              var a01 = _a.args[1];\n\n              if (isConstantNode(a01)) {\n                return new OperatorNode(node.op, node.fn, [_a.args[0], new ConstantNode(multiply(a01.value, a1.value))]);\n              }\n            }\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1]);\n      }\n    } else if (isParenthesisNode(node)) {\n      var c = simplifyCore(node.content);\n\n      if (isParenthesisNode(c) || isSymbolNode(c) || isConstantNode(c)) {\n        return c;\n      }\n\n      return new ParenthesisNode(c);\n    } else if (isFunctionNode(node)) {\n      var args = node.args.map(simplifyCore).map(function (arg) {\n        return isParenthesisNode(arg) ? arg.content : arg;\n      });\n      return new FunctionNode(simplifyCore(node.fn), args);\n    } else {// cannot simplify\n    }\n\n    return node;\n  }\n\n  return simplifyCore;\n});","// TODO this could be improved by simplifying seperated constants under associative and commutative operators\nimport { isFraction, isNode, isOperatorNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nimport { createUtil } from './util.js';\nimport { noBignumber, noFraction } from '../../../utils/noop.js';\nvar name = 'simplifyConstant';\nvar dependencies = ['typed', 'config', 'mathWithTransform', '?fraction', '?bignumber', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'SymbolNode'];\nexport var createSimplifyConstant = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    mathWithTransform,\n    fraction,\n    bignumber,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode\n  } = _ref;\n  var {\n    isCommutative,\n    isAssociative,\n    allChildren,\n    createMakeNodeFunction\n  } = createUtil({\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  });\n\n  function simplifyConstant(expr, options) {\n    var res = foldFraction(expr, options);\n    return isNode(res) ? res : _toNode(res);\n  }\n\n  function _eval(fnname, args, options) {\n    try {\n      return _toNumber(mathWithTransform[fnname].apply(null, args), options);\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(function (x) {\n        if (isFraction(x)) {\n          return x.valueOf();\n        }\n\n        return x;\n      });\n      return _toNumber(mathWithTransform[fnname].apply(null, args), options);\n    }\n  }\n\n  var _toNode = typed({\n    Fraction: _fractionToNode,\n    number: function number(n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n\n      return new ConstantNode(n);\n    },\n    BigNumber: function BigNumber(n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n\n      return new ConstantNode(n); // old parameters: (n.toString(), 'number')\n    },\n    Complex: function Complex(s) {\n      throw new Error('Cannot convert Complex number to Node');\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\n\n  function _exactFraction(n, options) {\n    var exactFractions = options && options.exactFractions !== false;\n\n    if (exactFractions && isFinite(n) && fraction) {\n      var f = fraction(n);\n      var fractionsLimit = options && typeof options.fractionsLimit === 'number' ? options.fractionsLimit : Infinity; // no limit by default\n\n      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {\n        return f;\n      }\n    }\n\n    return n;\n  } // Convert numbers to a preferred number type in preference order: Fraction, number, Complex\n  // BigNumbers are left alone\n\n\n  var _toNumber = typed({\n    'string, Object': function stringObject(s, options) {\n      if (config.number === 'BigNumber') {\n        if (bignumber === undefined) {\n          noBignumber();\n        }\n\n        return bignumber(s);\n      } else if (config.number === 'Fraction') {\n        if (fraction === undefined) {\n          noFraction();\n        }\n\n        return fraction(s);\n      } else {\n        var n = parseFloat(s);\n        return _exactFraction(n, options);\n      }\n    },\n    'Fraction, Object': function FractionObject(s, options) {\n      return s;\n    },\n    // we don't need options here\n    'BigNumber, Object': function BigNumberObject(s, options) {\n      return s;\n    },\n    // we don't need options here\n    'number, Object': function numberObject(s, options) {\n      return _exactFraction(s, options);\n    },\n    'Complex, Object': function ComplexObject(s, options) {\n      if (s.im !== 0) {\n        return s;\n      }\n\n      return _exactFraction(s.re, options);\n    }\n  });\n\n  function unaryMinusNode(n) {\n    return new OperatorNode('-', 'unaryMinus', [n]);\n  }\n\n  function _fractionToNode(f) {\n    var n;\n    var vn = f.s * f.n;\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\n    return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)]);\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\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\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  } // destroys the original node and returns a folded one\n\n\n  function foldFraction(node, options) {\n    switch (node.type) {\n      case 'SymbolNode':\n        return node;\n\n      case 'ConstantNode':\n        if (typeof node.value === 'number' || !isNaN(node.value)) {\n          return _toNumber(node.value, options);\n        }\n\n        return node;\n\n      case 'FunctionNode':\n        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {\n          return node;\n        }\n\n        {\n          // Process operators as OperatorNode\n          var operatorFunctions = ['add', 'multiply'];\n\n          if (operatorFunctions.indexOf(node.name) === -1) {\n            var args = node.args.map(arg => foldFraction(arg, options)); // If all args are numbers\n\n            if (!args.some(isNode)) {\n              try {\n                return _eval(node.name, args, options);\n              } catch (ignoreandcontine) {}\n            } // Convert all args to nodes and construct a symbolic function call\n\n\n            args = args.map(function (arg) {\n              return isNode(arg) ? arg : _toNode(arg);\n            });\n            return new FunctionNode(node.name, args);\n          } else {// treat as operator\n          }\n        }\n\n      /* falls through */\n\n      case 'OperatorNode':\n        {\n          var fn = node.fn.toString();\n\n          var _args;\n\n          var res;\n          var makeNode = createMakeNodeFunction(node);\n\n          if (isOperatorNode(node) && node.isUnary()) {\n            _args = [foldFraction(node.args[0], options)];\n\n            if (!isNode(_args[0])) {\n              res = _eval(fn, _args, options);\n            } else {\n              res = makeNode(_args);\n            }\n          } else if (isAssociative(node)) {\n            _args = allChildren(node);\n            _args = _args.map(arg => foldFraction(arg, options));\n\n            if (isCommutative(fn)) {\n              // commutative binary operator\n              var consts = [];\n              var vars = [];\n\n              for (var 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\n          return res;\n        }\n\n      case 'ParenthesisNode':\n        // remove the uneccessary parenthesis\n        return foldFraction(node.content, options);\n\n      case 'AccessorNode':\n      /* falls through */\n\n      case 'ArrayNode':\n      /* falls through */\n\n      case 'AssignmentNode':\n      /* falls through */\n\n      case 'BlockNode':\n      /* falls through */\n\n      case 'FunctionAssignmentNode':\n      /* falls through */\n\n      case 'IndexNode':\n      /* falls through */\n\n      case 'ObjectNode':\n      /* falls through */\n\n      case 'RangeNode':\n      /* falls through */\n\n      case 'ConditionalNode':\n      /* falls through */\n\n      default:\n        throw new Error(\"Unimplemented node type in simplifyConstant: \".concat(node.type));\n    }\n  }\n\n  return simplifyConstant;\n});","import { isFunctionNode, isNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'resolve';\nvar dependencies = ['parse', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];\nexport var createResolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    parse,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode\n  } = _ref;\n\n  /**\n   * resolve(expr, scope) replaces variable nodes with their scoped values\n   *\n   * Syntax:\n   *\n   *     simplify.resolve(expr, scope)\n   *\n   * Examples:\n   *\n   *     math.simplify.resolve('x + y', {x:1, y:2})           // Node {1 + 2}\n   *     math.simplify.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   * @param {Node} node\n   *     The expression tree to be simplified\n   * @param {Object} scope with variables to be resolved\n   */\n  function resolve(node, scope) {\n    if (!scope) {\n      return node;\n    }\n\n    if (isSymbolNode(node)) {\n      var value = scope[node.name];\n\n      if (isNode(value)) {\n        return resolve(value, scope);\n      } else if (typeof value === 'number') {\n        return parse(String(value));\n      }\n    } else if (isOperatorNode(node)) {\n      var args = node.args.map(function (arg) {\n        return resolve(arg, scope);\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));\n    } else if (isFunctionNode(node)) {\n      var _args = node.args.map(function (arg) {\n        return resolve(arg, scope);\n      });\n\n      return new FunctionNode(node.name, _args);\n    }\n\n    return node;\n  }\n\n  return resolve;\n});","import { isConstantNode, isParenthesisNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { createUtil } from './simplify/util.js';\nimport { createSimplifyCore } from './simplify/simplifyCore.js';\nimport { createSimplifyConstant } from './simplify/simplifyConstant.js';\nimport { createResolve } from './simplify/resolve.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nvar name = 'simplify';\nvar dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', '?fraction', '?bignumber', 'mathWithTransform', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nexport var createSimplify = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    parse,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    isZero,\n    equal,\n    fraction,\n    bignumber,\n    mathWithTransform,\n    ConstantNode,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode,\n    SymbolNode\n  } = _ref;\n  var simplifyConstant = createSimplifyConstant({\n    typed,\n    config,\n    mathWithTransform,\n    fraction,\n    bignumber,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode\n  });\n  var simplifyCore = createSimplifyCore({\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    ParenthesisNode\n  });\n  var resolve = createResolve({\n    parse,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode\n  });\n  var {\n    isCommutative,\n    isAssociative,\n    flatten,\n    unflattenr,\n    unflattenl,\n    createMakeNodeFunction\n  } = createUtil({\n    FunctionNode,\n    OperatorNode,\n    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   * 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   *  There is currently one option available:\n   *  - `exactFractions`: a boolean which is `true` by default.\n   *  - `fractionsLimit`: when `exactFractions` is true, a fraction will be returned\n   *    only when both numerator and denominator are smaller than `fractionsLimit`.\n   *    Default value is 10000.\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   *     derivative, parse, evaluate, rationalize\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\n  var simplify = typed('simplify', {\n    string: function string(expr) {\n      return this(parse(expr), this.rules, {}, {});\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return this(parse(expr), this.rules, scope, {});\n    },\n    'string, Object, Object': function stringObjectObject(expr, scope, options) {\n      return this(parse(expr), this.rules, scope, options);\n    },\n    'string, Array': function stringArray(expr, rules) {\n      return this(parse(expr), rules, {}, {});\n    },\n    'string, Array, Object': function stringArrayObject(expr, rules, scope) {\n      return this(parse(expr), rules, scope, {});\n    },\n    'string, Array, Object, Object': function stringArrayObjectObject(expr, rules, scope, options) {\n      return this(parse(expr), rules, scope, options);\n    },\n    'Node, Object': function NodeObject(expr, scope) {\n      return this(expr, this.rules, scope, {});\n    },\n    'Node, Object, Object': function NodeObjectObject(expr, scope, options) {\n      return this(expr, this.rules, scope, options);\n    },\n    Node: function Node(expr) {\n      return this(expr, this.rules, {}, {});\n    },\n    'Node, Array': function NodeArray(expr, rules) {\n      return this(expr, rules, {}, {});\n    },\n    'Node, Array, Object': function NodeArrayObject(expr, rules, scope) {\n      return this(expr, rules, scope, {});\n    },\n    'Node, Array, Object, Object': function NodeArrayObjectObject(expr, rules, scope, options) {\n      rules = _buildRules(rules);\n      var res = resolve(expr, scope);\n      res = removeParens(res);\n      var visited = {};\n      var str = res.toString({\n        parenthesis: 'all'\n      });\n\n      while (!visited[str]) {\n        visited[str] = true;\n        _lastsym = 0; // counter for placeholder symbols\n\n        for (var i = 0; i < rules.length; i++) {\n          if (typeof rules[i] === 'function') {\n            res = rules[i](res, options);\n          } else {\n            flatten(res);\n            res = applyRule(res, rules[i]);\n          }\n\n          unflattenl(res); // using left-heavy binary tree here since custom rule functions may expect it\n        }\n\n        str = res.toString({\n          parenthesis: 'all'\n        });\n      }\n\n      return res;\n    }\n  });\n  simplify.simplifyCore = simplifyCore;\n  simplify.resolve = resolve;\n\n  function removeParens(node) {\n    return node.transform(function (node, path, parent) {\n      return isParenthesisNode(node) ? removeParens(node.content) : node;\n    });\n  } // All constants that are allowed in rules\n\n\n  var 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 // null: false,\n    // undefined: false,\n    // version: false,\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\n  simplify.rules = [simplifyCore, // { 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  {\n    l: 'log(e)',\n    r: '1'\n  }, // temporary rules\n  {\n    l: 'n-n1',\n    r: 'n+-n1'\n  }, // temporarily replace 'subtract' so we can further flatten the 'add' operator\n  {\n    l: '-(c*v)',\n    r: '(-c) * v'\n  }, // make non-constant terms positive\n  {\n    l: '-v',\n    r: '(-1) * v'\n  }, {\n    l: 'n/n1^n2',\n    r: 'n*n1^-n2'\n  }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator\n  {\n    l: 'n/n1',\n    r: 'n*n1^-1'\n  }, // expand nested exponentiation\n  {\n    l: '(n ^ n1) ^ n2',\n    r: 'n ^ (n1 * n2)'\n  }, // collect like factors\n  {\n    l: 'n*n',\n    r: 'n^2'\n  }, {\n    l: 'n * n^n1',\n    r: 'n^(n1+1)'\n  }, {\n    l: 'n^n1 * n^n2',\n    r: 'n^(n1+n2)'\n  }, // collect like terms\n  {\n    l: 'n+n',\n    r: '2*n'\n  }, {\n    l: 'n+-n',\n    r: '0'\n  }, {\n    l: 'n1*n2 + n2',\n    r: '(n1+1)*n2'\n  }, {\n    l: 'n1*n3 + n2*n3',\n    r: '(n1+n2)*n3'\n  }, // remove parenthesis in the case of negating a quantitiy\n  {\n    l: 'n1 + -1 * (n2 + n3)',\n    r: 'n1 + -1 * n2 + -1 * n3'\n  }, simplifyConstant, {\n    l: '(-n)*n1',\n    r: '-(n*n1)'\n  }, // make factors positive (and undo 'make non-constant terms positive')\n  // ordering of constants\n  {\n    l: 'c+v',\n    r: 'v+c',\n    context: {\n      add: {\n        commutative: false\n      }\n    }\n  }, {\n    l: 'v*c',\n    r: 'c*v',\n    context: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, // undo temporary rules\n  // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant\n  {\n    l: 'n+-n1',\n    r: 'n-n1'\n  }, // undo replace 'subtract'\n  {\n    l: 'n*(n1^-1)',\n    r: 'n/n1'\n  }, // undo replace 'divide'\n  {\n    l: 'n*n1^-n2',\n    r: 'n/n1^n2'\n  }, {\n    l: 'n1^-1',\n    r: '1/n1'\n  }, {\n    l: 'n*(n1/n2)',\n    r: '(n*n1)/n2'\n  }, // '*' before '/'\n  {\n    l: 'n-(n1+n2)',\n    r: 'n-n1-n2'\n  }, // '-' before '+'\n  // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },\n  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },\n  {\n    l: '1*n',\n    r: 'n'\n  }, // this pattern can be produced by simplifyConstant\n  {\n    l: 'n1/(n2/n3)',\n    r: '(n1*n3)/n2'\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\n  function _buildRules(rules) {\n    // Array of rules to be used to simplify expressions\n    var ruleSet = [];\n\n    for (var i = 0; i < rules.length; i++) {\n      var rule = rules[i];\n      var newRule = void 0;\n      var ruleType = typeof rule;\n\n      switch (ruleType) {\n        case 'string':\n          {\n            var lr = rule.split('->');\n\n            if (lr.length === 2) {\n              rule = {\n                l: lr[0],\n                r: lr[1]\n              };\n            } else {\n              throw SyntaxError('Could not parse rule: ' + rule);\n            }\n          }\n\n        /* falls through */\n\n        case 'object':\n          newRule = {\n            l: removeParens(parse(rule.l)),\n            r: removeParens(parse(rule.r))\n          };\n\n          if (rule.context) {\n            newRule.evaluate = rule.context;\n          }\n\n          if (rule.evaluate) {\n            newRule.evaluate = parse(rule.evaluate);\n          }\n\n          if (isAssociative(newRule.l)) {\n            var makeNode = createMakeNodeFunction(newRule.l);\n\n            var expandsym = _getExpandPlaceholderSymbol();\n\n            newRule.expanded = {};\n            newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.\n            // This helps to match the newRule against nodes returned from getSplits() later on.\n\n            flatten(newRule.expanded.l);\n            unflattenr(newRule.expanded.l);\n            newRule.expanded.r = makeNode([newRule.r, expandsym]);\n          }\n\n          break;\n\n        case 'function':\n          newRule = rule;\n          break;\n\n        default:\n          throw TypeError('Unsupported type of rule: ' + ruleType);\n      } // console.log('Adding rule: ' + rules[i])\n      // console.log(newRule)\n\n\n      ruleSet.push(newRule);\n    }\n\n    return ruleSet;\n  }\n\n  var _lastsym = 0;\n\n  function _getExpandPlaceholderSymbol() {\n    return new SymbolNode('_p' + _lastsym++);\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   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.\n   */\n\n\n  var applyRule = typed('applyRule', {\n    'Node, Object': function NodeObject(node, rule) {\n      // console.log('Entering applyRule(' + node.toString() + ')')\n      // Do not clone node unless we find a match\n      var res = node; // First replace our child nodes with their simplified versions\n      // If a child could not be simplified, the assignments will have\n      // no effect since the node is returned unchanged\n\n      if (res instanceof OperatorNode || res instanceof FunctionNode) {\n        if (res.args) {\n          for (var i = 0; i < res.args.length; i++) {\n            res.args[i] = applyRule(res.args[i], rule);\n          }\n        }\n      } else if (res instanceof ParenthesisNode) {\n        if (res.content) {\n          res.content = applyRule(res.content, rule);\n        }\n      } // Try to match a rule against this node\n\n\n      var repl = rule.r;\n\n      var matches = _ruleMatch(rule.l, res)[0]; // 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\n\n      if (!matches && rule.expanded) {\n        repl = rule.expanded.r;\n        matches = _ruleMatch(rule.expanded.l, res)[0];\n      }\n\n      if (matches) {\n        // const before = res.toString({parenthesis: 'all'})\n        // Create a new node by cloning the rhs of the matched rule\n        // we keep any implicit multiplication state if relevant\n        var implicit = res.implicit;\n        res = repl.clone();\n\n        if (implicit && 'implicit' in repl) {\n          res.implicit = true;\n        } // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes\n\n\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        }); // const after = res.toString({parenthesis: 'all'})\n        // console.log('Simplified ' + before + ' to ' + after)\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\n  function getSplits(node, context) {\n    var res = [];\n    var right, rightArgs;\n    var makeNode = createMakeNodeFunction(node);\n\n    if (isCommutative(node, context)) {\n      for (var 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      rightArgs = node.args.slice(1);\n      right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);\n      res.push(makeNode([node.args[0], right]));\n    }\n\n    return res;\n  }\n  /**\n   * Returns the set union of two match-placeholders or null if there is a conflict.\n   */\n\n\n  function mergeMatch(match1, match2) {\n    var res = {\n      placeholders: {}\n    }; // Some matches may not have placeholders; this is OK\n\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    } // Placeholders with the same key must match exactly\n\n\n    for (var 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 (var _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   * 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\n\n  function combineChildMatches(list1, list2) {\n    var res = [];\n\n    if (list1.length === 0 || list2.length === 0) {\n      return res;\n    }\n\n    var merged;\n\n    for (var i1 = 0; i1 < list1.length; i1++) {\n      for (var i2 = 0; i2 < list2.length; i2++) {\n        merged = mergeMatch(list1[i1], list2[i2]);\n\n        if (merged) {\n          res.push(merged);\n        }\n      }\n    }\n\n    return res;\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\n\n  function mergeChildMatches(childMatches) {\n    if (childMatches.length === 0) {\n      return childMatches;\n    }\n\n    var sets = childMatches.reduce(combineChildMatches);\n    var uniqueSets = [];\n    var unique = {};\n\n    for (var i = 0; i < sets.length; i++) {\n      var s = JSON.stringify(sets[i]);\n\n      if (!unique[s]) {\n        unique[s] = true;\n        uniqueSets.push(sets[i]);\n      }\n    }\n\n    return uniqueSets;\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   * @return {Object} Information about the match, if it exists.\n   */\n\n\n  function _ruleMatch(rule, node, isSplit) {\n    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')\n    //    console.log('rule = ' + rule)\n    //    console.log('node = ' + node)\n    //    console.log('Entering _ruleMatch(' + rule.toString() + ', ' + node.toString() + ')')\n    var res = [{\n      placeholders: {}\n    }];\n\n    if (rule instanceof OperatorNode && node instanceof OperatorNode || 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      } // rule and node match. Search the children of rule and node.\n\n\n      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node) && node.args.length === rule.args.length || isSplit) {\n        // Expect non-associative operators to match exactly\n        var childMatches = [];\n\n        for (var i = 0; i < rule.args.length; i++) {\n          var childMatch = _ruleMatch(rule.args[i], node.args[i]);\n\n          if (childMatch.length === 0) {\n            // Child did not match, so stop searching immediately\n            return [];\n          } // The child matched, so add the information returned from the child to our result\n\n\n          childMatches.push(childMatch);\n        }\n\n        res = mergeChildMatches(childMatches);\n      } else if (node.args.length >= 2 && rule.args.length === 2) {\n        // 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        var splits = getSplits(node, rule.context);\n        var splitMatches = [];\n\n        for (var _i = 0; _i < splits.length; _i++) {\n          var matchSet = _ruleMatch(rule, splits[_i], true); // recursing at the same tree depth here\n\n\n          splitMatches = splitMatches.concat(matchSet);\n        }\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\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    } // It's a match!\n    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')\n\n\n    return res;\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\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 || 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 (var 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});","import { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createSimplifyConstant } from './simplify/simplifyConstant.js';\nimport { createSimplifyCore } from './simplify/simplifyCore.js';\nvar name = 'rationalize';\nvar dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'SymbolNode', 'ParenthesisNode'];\nexport var createRationalize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    parse,\n    simplify,\n    fraction,\n    bignumber,\n    mathWithTransform,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode,\n    ParenthesisNode\n  } = _ref;\n  var simplifyConstant = createSimplifyConstant({\n    typed,\n    config,\n    mathWithTransform,\n    fraction,\n    bignumber,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode\n  });\n  var simplifyCore = createSimplifyCore({\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    ParenthesisNode\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 na object\n   *            {Object}\n   *              {Expression Node} expression: node simplified expression\n   *              {Expression Node} numerator: simplified numerator of expression\n   *              {Expression Node | boolean} denominator: simplified denominator or false (if there is no denominator)\n   *              {Array}           variables:  variable names\n   *              {Array}           coefficients: coefficients of numerator sorted by increased exponent\n   *           {Expression Node}  node simplified expression\n   *\n   */\n\n  return typed(name, {\n    string: function string(expr) {\n      return this(parse(expr), {}, false);\n    },\n    'string, boolean': function stringBoolean(expr, detailed) {\n      return this(parse(expr), {}, detailed);\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return this(parse(expr), scope, false);\n    },\n    'string, Object, boolean': function stringObjectBoolean(expr, scope, detailed) {\n      return this(parse(expr), scope, detailed);\n    },\n    Node: function Node(expr) {\n      return this(expr, {}, false);\n    },\n    'Node, boolean': function NodeBoolean(expr, detailed) {\n      return this(expr, {}, detailed);\n    },\n    'Node, Object': function NodeObject(expr, scope) {\n      return this(expr, scope, false);\n    },\n    'Node, Object, boolean': function NodeObjectBoolean(expr, scope, detailed) {\n      var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form\n\n      var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial\n\n      var nVars = polyRet.variables.length;\n      expr = polyRet.expression;\n\n      if (nVars >= 1) {\n        // If expression in not a constant\n        expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)\n\n        var sBefore; // Previous expression\n\n        var rules;\n        var eDistrDiv = true;\n        var redoInic = false;\n        expr = simplify(expr, setRules.firstRules, {}, {\n          exactFractions: false\n        }); // Apply the initial rules, including succ div rules\n\n        var s;\n\n        while (true) {\n          // Apply alternately  successive division rules and distr.div.rules\n          rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;\n          expr = simplify(expr, rules); // until no more changes\n\n          eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules\n\n          s = expr.toString();\n\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) {\n          // Apply first rules again without succ div rules (if there are changes)\n          expr = simplify(expr, setRules.firstRulesAgain, {}, {\n            exactFractions: false\n          });\n        }\n\n        expr = simplify(expr, setRules.finalRules, {}, {\n          exactFractions: false\n        }); // Apply final rules\n      } // NVars >= 1\n\n\n      var coefficients = [];\n      var retRationalize = {};\n\n      if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {\n        // 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\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\n        if (detailed) {\n          retRationalize.numerator = expr;\n          retRationalize.denominator = null;\n        }\n      } // nVars\n\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\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\n  function polynomial(expr, scope, extended, rules) {\n    var variables = [];\n    var node = simplify(expr, rules, scope, {\n      exactFractions: false\n    }); // Resolves any variables and functions with all defined parameters\n\n    extended = !!extended;\n    var oper = '+-*' + (extended ? '/' : '');\n    recPoly(node);\n    var retFunc = {};\n    retFunc.expression = node;\n    retFunc.variables = variables;\n    return retFunc; // -------------------------------------------------------------------------------------------------------\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\n    function recPoly(node) {\n      var tp = node.type; // node type\n\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\n          for (var i = 0; i < node.args.length; i++) {\n            recPoly(node.args[i]);\n          }\n        } // type of operator\n\n      } else if (tp === 'SymbolNode') {\n        var _name = node.name; // variable name\n\n        var pos = variables.indexOf(_name);\n\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\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\n\n  function rulesRationalize() {\n    var oldRules = [simplifyCore, // sCore\n    {\n      l: 'n+n',\n      r: '2*n'\n    }, {\n      l: 'n+-n',\n      r: '0'\n    }, simplifyConstant, // sConstant\n    {\n      l: 'n*(n1^-1)',\n      r: 'n/n1'\n    }, {\n      l: 'n*n1^-n2',\n      r: 'n/n1^n2'\n    }, {\n      l: 'n1^-1',\n      r: '1/n1'\n    }, {\n      l: 'n*(n1/n2)',\n      r: '(n*n1)/n2'\n    }, {\n      l: '1*n',\n      r: 'n'\n    }];\n    var rulesFirst = [{\n      l: '(-n1)/(-n2)',\n      r: 'n1/n2'\n    }, // Unary division\n    {\n      l: '(-n1)*(-n2)',\n      r: 'n1*n2'\n    }, // Unary multiplication\n    {\n      l: 'n1--n2',\n      r: 'n1+n2'\n    }, // '--' elimination\n    {\n      l: 'n1-n2',\n      r: 'n1+(-n2)'\n    }, // Subtraction turn into add with un�ry minus\n    {\n      l: '(n1+n2)*n3',\n      r: '(n1*n3 + n2*n3)'\n    }, // Distributive 1\n    {\n      l: 'n1*(n2+n3)',\n      r: '(n1*n2+n1*n3)'\n    }, // Distributive 2\n    {\n      l: 'c1*n + c2*n',\n      r: '(c1+c2)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n + n',\n      r: '(c1+1)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n - c2*n',\n      r: '(c1-c2)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n - n',\n      r: '(c1-1)*n'\n    }, // Joining constants\n    {\n      l: 'v/c',\n      r: '(1/c)*v'\n    }, // variable/constant (new!)\n    {\n      l: 'v/-c',\n      r: '-(1/c)*v'\n    }, // variable/constant (new!)\n    {\n      l: '-v*-c',\n      r: 'c*v'\n    }, // Inversion constant and variable 1\n    {\n      l: '-v*c',\n      r: '-c*v'\n    }, // Inversion constant and variable 2\n    {\n      l: 'v*-c',\n      r: '-c*v'\n    }, // Inversion constant and variable 3\n    {\n      l: 'v*c',\n      r: 'c*v'\n    }, // Inversion constant and variable 4\n    {\n      l: '-(-n1*n2)',\n      r: '(n1*n2)'\n    }, // Unary propagation\n    {\n      l: '-(n1*n2)',\n      r: '(-n1*n2)'\n    }, // Unary propagation\n    {\n      l: '-(-n1+n2)',\n      r: '(n1-n2)'\n    }, // Unary propagation\n    {\n      l: '-(n1+n2)',\n      r: '(-n1-n2)'\n    }, // Unary propagation\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))'\n    }, // Power to Power\n    {\n      l: '-(-n1/n2)',\n      r: '(n1/n2)'\n    }, // Division and Unary\n    {\n      l: '-(n1/n2)',\n      r: '(-n1/n2)'\n    }]; // Divisao and Unary\n\n    var rulesDistrDiv = [{\n      l: '(n1/n2 + n3/n4)',\n      r: '((n1*n4 + n3*n2)/(n2*n4))'\n    }, // Sum of fractions\n    {\n      l: '(n1/n2 + n3)',\n      r: '((n1 + n3*n2)/n2)'\n    }, // Sum fraction with number 1\n    {\n      l: '(n1 + n2/n3)',\n      r: '((n1*n3 + n2)/n3)'\n    }]; // Sum fraction with number 1\n\n    var rulesSucDiv = [{\n      l: '(n1/(n2/n3))',\n      r: '((n1*n3)/n2)'\n    }, // Division simplification\n    {\n      l: '(n1/n2/n3)',\n      r: '(n1/(n2*n3))'\n    }];\n    var setRules = {}; // rules set in 4 steps.\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\n    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules\n\n    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules\n\n    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.\n    // Division simplification\n    // Second rule set.\n    // There is no aggregate expression with parentesis, but the only variable can be scattered.\n\n    setRules.finalRules = [simplifyCore, // simplify.rules[0]\n    {\n      l: 'n*-n',\n      r: '-n^2'\n    }, // Joining multiply with power 1\n    {\n      l: 'n*n',\n      r: 'n^2'\n    }, // Joining multiply with power 2\n    simplifyConstant, // simplify.rules[14] old 3rd index in oldRules\n    {\n      l: 'n*-n^n1',\n      r: '-n^(n1+1)'\n    }, // Joining multiply with power 3\n    {\n      l: 'n*n^n1',\n      r: 'n^(n1+1)'\n    }, // Joining multiply with power 4\n    {\n      l: 'n^n1*-n^n2',\n      r: '-n^(n1+n2)'\n    }, // Joining multiply with power 5\n    {\n      l: 'n^n1*n^n2',\n      r: 'n^(n1+n2)'\n    }, // Joining multiply with power 6\n    {\n      l: 'n^n1*-n',\n      r: '-n^(n1+1)'\n    }, // Joining multiply with power 7\n    {\n      l: 'n^n1*n',\n      r: 'n^(n1+1)'\n    }, // Joining multiply with power 8\n    {\n      l: 'n^n1/-n',\n      r: '-n^(n1-1)'\n    }, // Joining multiply with power 8\n    {\n      l: 'n^n1/n',\n      r: 'n^(n1-1)'\n    }, // Joining division with power 1\n    {\n      l: 'n/-n^n1',\n      r: '-n^(1-n1)'\n    }, // Joining division with power 2\n    {\n      l: 'n/n^n1',\n      r: 'n^(1-n1)'\n    }, // Joining division with power 3\n    {\n      l: 'n^n1/-n^n2',\n      r: 'n^(n1-n2)'\n    }, // Joining division with power 4\n    {\n      l: 'n^n1/n^n2',\n      r: 'n^(n1-n2)'\n    }, // Joining division with power 5\n    {\n      l: 'n1+(-n2*n3)',\n      r: 'n1-n2*n3'\n    }, // Solving useless parenthesis 1\n    {\n      l: 'v*(-c)',\n      r: '-c*v'\n    }, // Solving useless unary 2\n    {\n      l: 'n1+-n2',\n      r: 'n1-n2'\n    }, // Solving +- together (new!)\n    {\n      l: 'v*c',\n      r: 'c*v'\n    }, // inversion constant with variable\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))'\n    } // Power to Power\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\n\n  function expandPower(node, parent, indParent) {\n    var tp = node.type;\n    var internal = arguments.length > 1; // TRUE in internal calls\n\n    if (tp === 'OperatorNode' && node.isBinary()) {\n      var does = false;\n      var val;\n\n      if (node.op === '^') {\n        // First operator: Parenthesis or UnaryMinus\n        if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {\n          // Second operator: Constant\n          val = parseFloat(node.args[1].value);\n          does = val >= 2 && isInteger(val);\n        }\n      }\n\n      if (does) {\n        // Exponent >= 2\n        // Before:\n        //            operator A --> Subtree\n        // parent pow\n        //            constant\n        //\n        if (val > 2) {\n          // 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          var nEsqTopo = node.args[0];\n          var nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);\n          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);\n        } else {\n          // 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') {\n            parent.content = node;\n          } else {\n            parent.args[indParent] = node;\n          }\n        }\n      } // does\n\n    } // binary OperatorNode\n\n\n    if (tp === 'ParenthesisNode') {\n      // Recursion\n      expandPower(node.content, node, 'content');\n    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {\n      for (var 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\n\n  function polyToCanonical(node, coefficients) {\n    if (coefficients === undefined) {\n      coefficients = [];\n    } // coefficients.\n\n\n    coefficients[0] = 0; // index is the exponent\n\n    var o = {};\n    o.cte = 1;\n    o.oper = '+'; // 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\n    o.fire = '';\n    var maxExpo = 0; // maximum exponent\n\n    var varname = ''; // variable name\n\n    recurPol(node, null, o);\n    maxExpo = coefficients.length - 1;\n    var first = true;\n    var no;\n\n    for (var i = maxExpo; i >= 0; i--) {\n      if (coefficients[i] === 0) continue;\n      var n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));\n      var op = coefficients[i] < 0 ? '-' : '+';\n\n      if (i > 0) {\n        // Is not a constant without variable\n        var n2 = new SymbolNode(varname);\n\n        if (i > 1) {\n          var n3 = new ConstantNode(i);\n          n2 = new OperatorNode('^', 'pow', [n2, n3]);\n        }\n\n        if (coefficients[i] === -1 && first) {\n          n1 = new OperatorNode('-', 'unaryMinus', [n2]);\n        } else if (Math.abs(coefficients[i]) === 1) {\n          n1 = n2;\n        } else {\n          n1 = new OperatorNode('*', 'multiply', [n1, n2]);\n        }\n      }\n\n      if (first) {\n        no = n1;\n      } else if (op === '+') {\n        no = new OperatorNode('+', 'add', [no, n1]);\n      } else {\n        no = new OperatorNode('-', 'subtract', [no, n1]);\n      }\n\n      first = false;\n    } // for\n\n\n    if (first) {\n      return new ConstantNode(0);\n    } else {\n      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\n\n    function recurPol(node, noPai, o) {\n      var tp = node.type;\n\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' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {\n            throw new Error('Invalid ' + node.op + ' placing');\n          } // -,+,* : children of +,-\n\n\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {\n            throw new Error('Invalid ' + node.op + ' placing');\n          } // -,+ : first child\n\n\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {\n            throw new Error('Invalid ' + node.op + ' placing');\n          }\n        } // Has parent\n        // Firers: ^,*       Old:   ^,&,-(unary): firers\n\n\n        if (node.op === '^' || node.op === '*') {\n          o.fire = node.op;\n        }\n\n        for (var _i = 0; _i < node.args.length; _i++) {\n          // +,-: reset fire\n          if (node.fn === 'unaryMinus') o.oper = '-';\n\n          if (node.op === '+' || node.fn === 'subtract') {\n            o.fire = '';\n            o.cte = 1; // default if there is no constant\n\n            o.oper = _i === 0 ? '+' : node.op;\n          }\n\n          o.noFil = _i; // number of son\n\n          recurPol(node.args[_i], node, o);\n        } // for in children\n\n      } else if (tp === 'SymbolNode') {\n        // ***** SymbolName *****\n        if (node.name !== varname && varname !== '') {\n          throw new Error('There is more than one variable');\n        }\n\n        varname = node.name;\n\n        if (noPai === null) {\n          coefficients[1] = 1;\n          return;\n        } // ^: Symbol is First child\n\n\n        if (noPai.op === '^' && o.noFil !== 0) {\n          throw new Error('In power the variable should be the first parameter');\n        } // *: Symbol is Second child\n\n\n        if (noPai.op === '*' && o.noFil !== 1) {\n          throw new Error('In multiply the variable should be the second parameter');\n        } // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)\n\n\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        var valor = parseFloat(node.value);\n\n        if (noPai === null) {\n          coefficients[0] = valor;\n          return;\n        }\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) {\n            throw new Error('Non-integer exponent is not allowed');\n          }\n\n          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) {\n            coefficients[_i2] = 0;\n          }\n\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\n        o.cte = valor; // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.\n\n        if (o.fire === '') {\n          coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);\n        }\n      } else {\n        throw new Error('Type ' + tp + ' is not allowed');\n      }\n    } // End of recurPol\n\n  } // End of polyToCanonical\n\n});","import { factory } from '../../utils/factory.js';\nvar name = 'parser';\nvar dependencies = ['typed', 'Parser'];\nexport var createParser = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Parser\n  } = _ref;\n\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('function 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});","import { isConstantNode, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'derivative';\nvar dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nexport var createDerivative = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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  var derivative = typed('derivative', {\n    'Node, SymbolNode, Object': function NodeSymbolNodeObject(expr, variable, options) {\n      var constNodes = {};\n      constTag(constNodes, expr, variable.name);\n\n      var res = _derivative(expr, constNodes);\n\n      return options.simplify ? simplify(res) : res;\n    },\n    'Node, SymbolNode': function NodeSymbolNode(expr, variable) {\n      return this(expr, variable, {\n        simplify: true\n      });\n    },\n    'string, SymbolNode': function stringSymbolNode(expr, variable) {\n      return this(parse(expr), variable);\n    },\n    'string, SymbolNode, Object': function stringSymbolNodeObject(expr, variable, options) {\n      return this(parse(expr), variable, options);\n    },\n    'string, string': function stringString(expr, variable) {\n      return this(parse(expr), parse(variable));\n    },\n    'string, string, Object': function stringStringObject(expr, variable, options) {\n      return this(parse(expr), parse(variable), options);\n    },\n    'Node, string': function NodeString(expr, variable) {\n      return this(expr, parse(variable));\n    },\n    'Node, string, Object': function NodeStringObject(expr, variable, options) {\n      return this(expr, parse(variable), options);\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  }; // 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\n\n  var _derivTex = typed('_derivTex', {\n    'Node, SymbolNode': function NodeSymbolNode(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 NodeConstantNode(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 NodeSymbolNodeConstantNode(expr, x, order) {\n      return _derivTex(expr.toString(), x.name, order.value);\n    },\n    'string, string, number': function stringStringNumber(expr, x, order) {\n      var d;\n\n      if (order === 1) {\n        d = '{d\\\\over d' + x + '}';\n      } else {\n        d = '{d^{' + order + '}\\\\over d' + x + '^{' + order + '}}';\n      }\n\n      return d + \"\\\\left[\".concat(expr, \"\\\\right]\");\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\n\n  var constTag = typed('constTag', {\n    'Object, ConstantNode, string': function ObjectConstantNodeString(constNodes, node) {\n      constNodes[node] = true;\n      return true;\n    },\n    'Object, SymbolNode, string': function ObjectSymbolNodeString(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\n      return false;\n    },\n    'Object, ParenthesisNode, string': function ObjectParenthesisNodeString(constNodes, node, varName) {\n      return constTag(constNodes, node.content, varName);\n    },\n    'Object, FunctionAssignmentNode, string': function ObjectFunctionAssignmentNodeString(constNodes, node, varName) {\n      if (node.params.indexOf(varName) === -1) {\n        constNodes[node] = true;\n        return true;\n      }\n\n      return constTag(constNodes, node.expr, varName);\n    },\n    'Object, FunctionNode | OperatorNode, string': function ObjectFunctionNodeOperatorNodeString(constNodes, node, varName) {\n      if (node.args.length > 0) {\n        var isConst = constTag(constNodes, node.args[0], varName);\n\n        for (var 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\n      return false;\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\n  var _derivative = typed('_derivative', {\n    'ConstantNode, Object': function ConstantNodeObject(node) {\n      return createConstantNode(0);\n    },\n    'SymbolNode, Object': function SymbolNodeObject(node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      return createConstantNode(1);\n    },\n    'ParenthesisNode, Object': function ParenthesisNodeObject(node, constNodes) {\n      return new ParenthesisNode(_derivative(node.content, constNodes));\n    },\n    'FunctionAssignmentNode, Object': function FunctionAssignmentNodeObject(node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      return _derivative(node.expr, constNodes);\n    },\n    'FunctionNode, Object': function FunctionNodeObject(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      var arg0 = node.args[0];\n      var arg1;\n      var div = false; // is output a fraction?\n\n      var negative = false; // is output negative?\n\n      var funcDerivative;\n\n      switch (node.name) {\n        case 'cbrt':\n          // d/dx(cbrt(x)) = 1 / (3x^(2/3))\n          div = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);\n          break;\n\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', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);\n          } else if (node.args.length === 2) {\n            // Rearrange from nthRoot(x, a) -> x^(1/a)\n            arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]); // Is a variable?\n\n            constNodes[arg1] = constNodes[node.args[1]];\n            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes);\n          }\n\n          break;\n\n        case 'log10':\n          arg1 = createConstantNode(10);\n\n        /* fall through! */\n\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 || node.args.length === 2 && constNodes[node.args[1]] !== undefined) {\n            // d/dx(log(x, c)) = 1 / (x*ln(c))\n            funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);\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', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), constNodes);\n          }\n\n          break;\n\n        case 'pow':\n          constNodes[arg1] = constNodes[node.args[1]]; // Pass to pow operator node parser\n\n          return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes);\n\n        case 'exp':\n          // d/dx(e^x) = e^x\n          funcDerivative = new FunctionNode('exp', [arg0.clone()]);\n          break;\n\n        case 'sin':\n          // d/dx(sin(x)) = cos(x)\n          funcDerivative = new FunctionNode('cos', [arg0.clone()]);\n          break;\n\n        case 'cos':\n          // d/dx(cos(x)) = -sin(x)\n          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);\n          break;\n\n        case 'tan':\n          // d/dx(tan(x)) = sec(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'sec':\n          // d/dx(sec(x)) = sec(x)tan(x)\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);\n          break;\n\n        case 'csc':\n          // d/dx(csc(x)) = -csc(x)cot(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);\n          break;\n\n        case 'cot':\n          // d/dx(cot(x)) = -csc(x)^2\n          negative = true;\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'asin':\n          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)\n          div = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);\n          break;\n\n        case 'acos':\n          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)\n          div = true;\n          negative = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);\n          break;\n\n        case 'atan':\n          // d/dx(atan(x)) = 1 / (x^2 + 1)\n          div = true;\n          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);\n          break;\n\n        case 'asec':\n          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))\n          div = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\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', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\n        case 'acot':\n          // d/dx(acot(x)) = -1 / (x^2 + 1)\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);\n          break;\n\n        case 'sinh':\n          // d/dx(sinh(x)) = cosh(x)\n          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);\n          break;\n\n        case 'cosh':\n          // d/dx(cosh(x)) = sinh(x)\n          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);\n          break;\n\n        case 'tanh':\n          // d/dx(tanh(x)) = sech(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'sech':\n          // d/dx(sech(x)) = -sech(x)tanh(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);\n          break;\n\n        case 'csch':\n          // d/dx(csch(x)) = -csch(x)coth(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);\n          break;\n\n        case 'coth':\n          // d/dx(coth(x)) = -csch(x)^2\n          negative = true;\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'asinh':\n          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)\n          div = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);\n          break;\n\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', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);\n          break;\n\n        case 'atanh':\n          // d/dx(atanh(x)) = 1 / (1 - x^2)\n          div = true;\n          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);\n          break;\n\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', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);\n          break;\n\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', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\n        case 'acoth':\n          // d/dx(acoth(x)) = -1 / (1 - x^2)\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);\n          break;\n\n        case 'abs':\n          // d/dx(abs(x)) = abs(x)/x\n          funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);\n          break;\n\n        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)\n\n        default:\n          throw new Error('Function \"' + node.name + '\" is not supported by derivative, or a wrong number of arguments is passed');\n      }\n\n      var op, func;\n\n      if (div) {\n        op = '/';\n        func = 'divide';\n      } else {\n        op = '*';\n        func = 'multiply';\n      }\n      /* Apply chain rule to all functions:\n         F(x)  = f(g(x))\n         F'(x) = g'(x)*f'(g(x)) */\n\n\n      var chainDerivative = _derivative(arg0, constNodes);\n\n      if (negative) {\n        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);\n      }\n\n      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);\n    },\n    'OperatorNode, Object': function OperatorNodeObject(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, [_derivative(node.args[0], constNodes)]);\n        } // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)\n\n\n        if (node.isBinary()) {\n          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes), _derivative(node.args[1], constNodes)]);\n        }\n      }\n\n      if (node.op === '*') {\n        // d/dx(c*f(x)) = c*f'(x)\n        var constantTerms = node.args.filter(function (arg) {\n          return constNodes[arg] !== undefined;\n        });\n\n        if (constantTerms.length > 0) {\n          var nonConstantTerms = node.args.filter(function (arg) {\n            return constNodes[arg] === undefined;\n          });\n          var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);\n          var newArgs = constantTerms.concat(_derivative(nonConstantNode, constNodes));\n          return new OperatorNode('*', 'multiply', newArgs);\n        } // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)\n\n\n        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {\n          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {\n            return argInner === argOuter ? _derivative(argInner, constNodes) : argInner.clone();\n          }));\n        }));\n      }\n\n      if (node.op === '/' && node.isBinary()) {\n        var arg0 = node.args[0];\n        var arg1 = node.args[1]; // d/dx(f(x) / c) = f'(x) / c\n\n        if (constNodes[arg1] !== undefined) {\n          return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1]);\n        } // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)\n\n\n        if (constNodes[arg0] !== undefined) {\n          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, constNodes), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);\n        } // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2\n\n\n        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)])]);\n      }\n\n      if (node.op === '^' && node.isBinary()) {\n        var _arg = node.args[0];\n        var _arg2 = node.args[1];\n\n        if (constNodes[_arg] !== undefined) {\n          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1\n          if (isConstantNode(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {\n            return createConstantNode(0);\n          } // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)\n\n\n          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), constNodes)])]);\n        }\n\n        if (constNodes[_arg2] !== undefined) {\n          if (isConstantNode(_arg2)) {\n            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0\n            if (isZero(_arg2.value)) {\n              return createConstantNode(0);\n            } // Ignore exponent; f(x)^1 = f(x)\n\n\n            if (equal(_arg2.value, 1)) {\n              return _derivative(_arg, constNodes);\n            }\n          } // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)\n\n\n          var powMinusOne = new OperatorNode('^', 'pow', [_arg.clone(), new OperatorNode('-', 'subtract', [_arg2, createConstantNode(1)])]);\n          return new OperatorNode('*', 'multiply', [_arg2.clone(), new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), powMinusOne])]);\n        } // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]\n\n\n        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()])])])]);\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   * Ensures the number of arguments for a function are correct,\n   * and will throw an error otherwise.\n   *\n   * @param {FunctionNode} node\n   */\n\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    } // There should be an incorrect number of arguments if we reach here\n    // Change all args to constants to avoid unidentified\n    // symbol error when compiling function\n\n\n    for (var 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   * 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\n\n  function createConstantNode(value, valueType) {\n    return new ConstantNode(numeric(value, valueType || config.number));\n  }\n\n  return derivative;\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';\nvar name = 'apply';\nvar dependencies = ['typed', 'isInteger'];\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 */\n\nexport var createApplyTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n  var apply = createApply({\n    typed,\n    isInteger\n  }); // @see: comment of concat itself\n\n  return typed('apply', {\n    '...any': function any(args) {\n      // change dim from one-based to zero-based\n      var 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}, {\n  isTransformFunction: true\n});","import { isSymbolNode } from '../../../utils/is.js';\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 */\n\nexport function compileInlineExpression(expression, math, scope) {\n  // find an undefined symbol\n  var symbol = expression.filter(function (node) {\n    return isSymbolNode(node) && !(node.name in math) && !(node.name in scope);\n  })[0];\n\n  if (!symbol) {\n    throw new Error('No undefined variable found in inline expression \"' + expression + '\"');\n  } // create a test function for this equation\n\n\n  var name = symbol.name; // variable name\n\n  var subScope = Object.create(scope);\n  var eq = expression.compile();\n  return function inlineExpression(x) {\n    subScope[name] = x;\n    return eq.evaluate(subScope);\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';\nvar name = 'filter';\nvar dependencies = ['typed'];\nexport var createFilterTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var 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\n  filterTransform.rawArgs = true; // one based version of function filter\n\n  var filter = typed('filter', {\n    'Array, function': _filter,\n    'Matrix, function': function MatrixFunction(x, test) {\n      return x.create(_filter(x.toArray(), test));\n    },\n    'Array, RegExp': filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return x.create(filterRegExp(x.toArray(), test));\n    }\n  });\n  return filterTransform;\n}, {\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 */\n\nfunction _filter(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\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 {\n      // 3 or -1\n      return callback(value, [index + 1], array);\n    }\n  });\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';\nvar name = 'map';\nvar dependencies = ['typed'];\nexport var createMapTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var 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\n  mapTransform.rawArgs = true; // one-based version of map function\n\n  var map = typed('map', {\n    'Array, function': function ArrayFunction(x, callback) {\n      return _map(x, callback, x);\n    },\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.create(_map(x.valueOf(), callback, x));\n    }\n  });\n  return mapTransform;\n}, {\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 */\n\nfunction _map(array, callback, orig) {\n  // figure out what number of arguments the callback function expects\n  var 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 {\n        // 3 or -1\n        return callback(value, index, orig);\n      }\n    }\n  }\n\n  return recurse(array, []);\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';\nvar name = 'forEach';\nvar dependencies = ['typed'];\nexport var createForEachTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var 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\n  forEachTransform.rawArgs = true; // one-based version of forEach\n\n  var _forEach = typed('forEach', {\n    'Array | Matrix, function': function ArrayMatrixFunction(array, callback) {\n      // figure out what number of arguments the callback function expects\n      var args = maxArgumentCount(callback);\n\n      var recurse = function recurse(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 {\n            // 3 or -1\n            callback(value, index, array);\n          }\n        }\n      };\n\n      recurse(array.valueOf(), []); // pass Array\n    }\n  });\n\n  return forEachTransform;\n}, {\n  isTransformFunction: true\n});","import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createSubset } from '../../function/matrix/subset.js';\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix'];\nexport var createSubsetTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var subset = createSubset({\n    typed,\n    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\n  return typed('subset', {\n    '...any': function any(args) {\n      try {\n        return subset.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});","import { isArray, isBigNumber, isMatrix, isNumber, isRange } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'index';\nvar dependencies = ['Index'];\nexport var createIndexTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Index\n  } = _ref;\n\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    var args = [];\n\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i]; // change from one-based to zero based, and convert BigNumber to number\n\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) {\n          return v - 1;\n        });\n      } else if (isArray(arg) || isMatrix(arg)) {\n        arg = arg.map(function (v) {\n          return v - 1;\n        });\n      } else if (isNumber(arg)) {\n        arg--;\n      } else if (isBigNumber(arg)) {\n        arg = arg.toNumber() - 1;\n      } else if (typeof arg === 'string') {// 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    var res = new Index();\n    Index.apply(res, args);\n    return res;\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';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcatTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n  var concat = createConcat({\n    typed,\n    matrix,\n    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\n  return typed('concat', {\n    '...any': function any(args) {\n      // change last argument from one-based to zero-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\n  isTransformFunction: true\n});","import { isBigNumber, isCollection, isNumber } from '../../../utils/is.js';\n/**\n * Change last argument dim from one-based to zero-based.\n */\n\nexport function lastDimToZeroBase(args) {\n  if (args.length === 2 && isCollection(args[0])) {\n    args = args.slice();\n    var 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\n  return args;\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';\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger'];\nexport var createMaxTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    larger\n  } = _ref;\n  var max = createMax({\n    typed,\n    config,\n    numeric,\n    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\n  return typed('max', {\n    '...any': function any(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}, {\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';\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller'];\nexport var createMinTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    smaller\n  } = _ref;\n  var min = createMin({\n    typed,\n    config,\n    numeric,\n    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\n  return typed('min', {\n    '...any': function any(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}, {\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 * 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 mean\n * from one-based to zero based\n */\n\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nexport var createSumTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    add,\n    numeric\n  } = _ref;\n  var sum = createSum({\n    typed,\n    config,\n    add,\n    numeric\n  });\n  return typed(name, {\n    '...any': function any(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}, {\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';\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\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 */\n\nexport var createColumnTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  var column = createColumn({\n    typed,\n    Index,\n    matrix,\n    range\n  }); // @see: comment of column itself\n\n  return typed('column', {\n    '...any': function any(args) {\n      // change last argument from zero-based to one-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\n  isTransformFunction: true\n});","import { factory } from '../../utils/factory.js';\nimport { createRange } from '../../function/matrix/range.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];\nexport var createRangeTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq\n  } = _ref;\n  var range = createRange({\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    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\n  return typed('range', {\n    '...any': function any(args) {\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\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';\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];\nexport var createDiffTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    number,\n    bignumber\n  } = _ref;\n  var diff = createDiff({\n    typed,\n    matrix,\n    subtract,\n    number,\n    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\n  return typed(name, {\n    '...any': function any(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}, {\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';\nvar name = 'row';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\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 */\n\nexport var createRowTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  var row = createRow({\n    typed,\n    Index,\n    matrix,\n    range\n  }); // @see: comment of row itself\n\n  return typed('row', {\n    '...any': function any(args) {\n      // change last argument from zero-based to one-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\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';\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nexport var createMeanTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide\n  } = _ref;\n  var mean = createMean({\n    typed,\n    add,\n    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\n  return typed('mean', {\n    '...any': function any(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}, {\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';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];\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 */\n\nexport var createVarianceTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    apply,\n    isNaN\n  } = _ref;\n  var variance = createVariance({\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    apply,\n    isNaN\n  });\n  return typed(name, {\n    '...any': function any(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}, {\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';\nvar name = 'std';\nvar dependencies = ['typed', 'sqrt', 'variance'];\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 */\n\nexport var createStdTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    sqrt,\n    variance\n  } = _ref;\n  var std = createStd({\n    typed,\n    sqrt,\n    variance\n  });\n  return typed('std', {\n    '...any': function any(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}, {\n  isTransformFunction: true\n});","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); }\n\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createNode, createArrayNode, createBlockNode, createConstantNode, createObjectNode, createParenthesisNode, createRelationalNode, createChainClass, createReviver, createConditionalNode, createOperatorNode, createRangeNode, createFunctionAssignmentNode, createChain, createAccessorNode, createIndexNode, createAssignmentNode, createSymbolNode, createFunctionNode, createParse, createEvaluate, createHelpClass, createParserClass, createHelp, createCompile, createSimplify, createRationalize, createParser, createDerivative, createApplyTransform, createFilterTransform, createMapTransform, createForEachTransform, createSubsetTransform, createIndexTransform, createConcatTransform, createMaxTransform, createMinTransform, createSumTransform, createColumnTransform, createRangeTransform, createDiffTransform, createRowTransform, createMeanTransform, createVarianceTransform, createStdTransform } from '../factoriesAny.js';\nimport { ResultSet, Complex, Range, _false, _null, _true, BigNumber, Matrix, replacer, i, LN10, LOG10E, _NaN, pi, SQRT1_2 // eslint-disable-line camelcase\n, tau, efimovFactor, fineStructure, sackurTetrode, weakMixingAngle, Fraction, e, _Infinity, LOG2E, version, DenseMatrix, phi, typed, isInteger, isNumeric, isPositive, isNaN, equalScalar, number, boolean, complex, splitUnit, unaryPlus, apply, cube, expm1, log10, multiplyScalar, sign, square, bitNot, arg, im, not, filter, forEach, map, erf, format, oct, print, isPrime, acos, acot, acsc, asec, asin, atan, atanh, cosh, coth, csch, sech, sinh, tanh, combinations, pickRandom, randomInt, LN2, clone, hasNumericValue, typeOf, string, fraction, unaryMinus, addScalar, exp, log2, sqrt, conj, getMatrixDataType, mode, bin, acosh, acsch, asinh, cos, csc, sin, combinationsWithRep, random, SQRT2, isNegative, SparseMatrix, matrix, cbrt, gcd, mod, nthRoot, xgcd, bitAnd, bitXor, or, concat, diag, identity, ones, reshape, size, subset, zeros, hex, round, leftShift, rightLogShift, compare, compareText, smaller, larger, unequal, ImmutableDenseMatrix, FibonacciHeap, sparse, acoth, atan2, sec, add, dot, composition, isZero, abs, floor, multiply, dotMultiply, re, flatten, resize, squeeze, to, pow, dotPow, rightArithShift, compareNatural, equalText, largerEq, partitionSelect, Index, asech, tan, setDifference, setIntersect, setMultiplicity, setSize, trace, quantileSeq, gamma, bignumber, lcm, bitOr, kron, transpose, numeric, and, smallerEq, sort, min, cot, setDistinct, setPowerset, index, sum, factorial, permutations, ceil, subtract, cross, range, row, prod, equal, max, setCartesian, setSymDifference, fix, column, diff, ctranspose, deepEqual, setIsSubset, xor, divideScalar, nthRoots, lsolve, lsolveAll, Spa, setUnion, lup, slu, det, distance, stirlingS2, catalan, count, log, dotDivide, usolveAll, hypot, qr, inv, expm, divide, mean, variance, kldivergence, bellNumbers, log1p, Unit, createUnit, eigs, intersect, std, atomicMass, bohrMagneton, boltzmann, conductanceQuantum, deuteronMass, electronMass, faraday, firstRadiation, gravitationConstant, hartreeEnergy, klitzing, magneticConstant, molarMass, molarPlanckConstant, neutronMass, planckCharge, planckLength, planckTemperature, protonMass, reducedPlanckConstant, secondRadiation, stefanBoltzmann, vacuumImpedance, usolve, norm, lusolve, sqrtm, multinomial, avogadro, classicalElectronRadius, electricConstant, fermiCoupling, gravity, loschmidt, molarMassC12, nuclearMagneton, planckMass, quantumOfCirculation, speedOfLight, wienDisplacement, rotationMatrix, median, bohrRadius, elementaryCharge, inverseConductanceQuantum, molarVolume, planckTime, thomsonCrossSection, rotate, mad, coulomb, magneticFluxQuantum, rydberg, unit, gasConstant, planckConstant } from './pureFunctionsAny.generated.js';\nvar math = {}; // NOT pure!\n\nvar mathWithTransform = {}; // NOT pure!\n\nvar classes = {}; // NOT pure!\n\nexport var Node = createNode({\n  mathWithTransform\n});\nexport var ArrayNode = createArrayNode({\n  Node\n});\nexport var BlockNode = createBlockNode({\n  Node,\n  ResultSet\n});\nexport var ConstantNode = createConstantNode({\n  Node\n});\nexport var ObjectNode = createObjectNode({\n  Node\n});\nexport var ParenthesisNode = createParenthesisNode({\n  Node\n});\nexport var RelationalNode = createRelationalNode({\n  Node\n});\nexport var Chain = createChainClass({\n  math\n});\nexport var reviver = createReviver({\n  classes\n});\nexport var ConditionalNode = createConditionalNode({\n  Node\n});\nexport var OperatorNode = createOperatorNode({\n  Node\n});\nexport var RangeNode = createRangeNode({\n  Node\n});\nexport var FunctionAssignmentNode = createFunctionAssignmentNode({\n  Node,\n  typed\n});\nexport var chain = createChain({\n  Chain,\n  typed\n});\nexport var AccessorNode = createAccessorNode({\n  Node,\n  subset\n});\nexport var IndexNode = createIndexNode({\n  Node,\n  Range,\n  size\n});\nexport var AssignmentNode = createAssignmentNode({\n  matrix,\n  Node,\n  subset\n});\nexport var SymbolNode = createSymbolNode({\n  Unit,\n  Node,\n  math\n});\nexport var FunctionNode = createFunctionNode({\n  Node,\n  SymbolNode,\n  math\n});\nexport var parse = createParse({\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  config,\n  numeric,\n  typed\n});\nexport var evaluate = createEvaluate({\n  parse,\n  typed\n});\nexport var Help = createHelpClass({\n  parse\n});\nexport var Parser = createParserClass({\n  parse\n});\nexport var help = createHelp({\n  Help,\n  mathWithTransform,\n  typed\n});\nexport var compile = createCompile({\n  parse,\n  typed\n});\nexport var simplify = createSimplify({\n  bignumber,\n  fraction,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  add,\n  config,\n  divide,\n  equal,\n  isZero,\n  mathWithTransform,\n  multiply,\n  parse,\n  pow,\n  subtract,\n  typed\n});\nexport var rationalize = createRationalize({\n  bignumber,\n  fraction,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  add,\n  config,\n  divide,\n  equal,\n  isZero,\n  mathWithTransform,\n  multiply,\n  parse,\n  pow,\n  simplify,\n  subtract,\n  typed\n});\nexport var parser = createParser({\n  Parser,\n  typed\n});\nexport var derivative = createDerivative({\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  config,\n  equal,\n  isZero,\n  numeric,\n  parse,\n  simplify,\n  typed\n});\n\n_extends(math, {\n  reviver,\n  false: _false,\n  null: _null,\n  true: _true,\n  replacer,\n  i,\n  LN10,\n  LOG10E,\n  NaN: _NaN,\n  pi,\n  SQRT1_2,\n  tau,\n  efimovFactor,\n  fineStructure,\n  sackurTetrode,\n  weakMixingAngle,\n  e,\n  Infinity: _Infinity,\n  LOG2E,\n  'PI': pi,\n  version,\n  'E': e,\n  phi,\n  typed,\n  isInteger,\n  isNumeric,\n  isPositive,\n  isNaN,\n  equalScalar,\n  number,\n  boolean,\n  complex,\n  splitUnit,\n  unaryPlus,\n  apply,\n  cube,\n  expm1,\n  log10,\n  multiplyScalar,\n  sign,\n  square,\n  bitNot,\n  arg,\n  im,\n  not,\n  filter,\n  forEach,\n  map,\n  erf,\n  format,\n  oct,\n  print,\n  isPrime,\n  acos,\n  acot,\n  acsc,\n  asec,\n  asin,\n  atan,\n  atanh,\n  cosh,\n  coth,\n  csch,\n  sech,\n  sinh,\n  tanh,\n  chain,\n  combinations,\n  pickRandom,\n  randomInt,\n  LN2,\n  clone,\n  hasNumericValue,\n  typeOf,\n  string,\n  fraction,\n  unaryMinus,\n  addScalar,\n  exp,\n  log2,\n  sqrt,\n  conj,\n  getMatrixDataType,\n  mode,\n  bin,\n  acosh,\n  acsch,\n  asinh,\n  cos,\n  csc,\n  sin,\n  combinationsWithRep,\n  random,\n  SQRT2,\n  isNegative,\n  matrix,\n  cbrt,\n  gcd,\n  mod,\n  nthRoot,\n  xgcd,\n  bitAnd,\n  bitXor,\n  or,\n  concat,\n  diag,\n  identity,\n  ones,\n  reshape,\n  size,\n  subset,\n  zeros,\n  hex,\n  round,\n  leftShift,\n  rightLogShift,\n  compare,\n  compareText,\n  smaller,\n  larger,\n  unequal,\n  sparse,\n  acoth,\n  atan2,\n  sec,\n  add,\n  dot,\n  composition,\n  isZero,\n  abs,\n  floor,\n  multiply,\n  dotMultiply,\n  re,\n  flatten,\n  resize,\n  squeeze,\n  to,\n  pow,\n  dotPow,\n  rightArithShift,\n  compareNatural,\n  equalText,\n  largerEq,\n  partitionSelect,\n  asech,\n  tan,\n  setDifference,\n  setIntersect,\n  setMultiplicity,\n  setSize,\n  trace,\n  quantileSeq,\n  gamma,\n  bignumber,\n  lcm,\n  bitOr,\n  kron,\n  transpose,\n  numeric,\n  and,\n  smallerEq,\n  sort,\n  min,\n  cot,\n  setDistinct,\n  setPowerset,\n  index,\n  sum,\n  factorial,\n  permutations,\n  ceil,\n  subtract,\n  cross,\n  range,\n  row,\n  prod,\n  equal,\n  max,\n  setCartesian,\n  setSymDifference,\n  fix,\n  column,\n  diff,\n  ctranspose,\n  deepEqual,\n  setIsSubset,\n  xor,\n  divideScalar,\n  nthRoots,\n  lsolve,\n  lsolveAll,\n  setUnion,\n  lup,\n  slu,\n  det,\n  distance,\n  stirlingS2,\n  catalan,\n  count,\n  log,\n  dotDivide,\n  usolveAll,\n  hypot,\n  qr,\n  inv,\n  expm,\n  divide,\n  mean,\n  variance,\n  kldivergence,\n  bellNumbers,\n  log1p,\n  createUnit,\n  eigs,\n  intersect,\n  std,\n  atomicMass,\n  bohrMagneton,\n  boltzmann,\n  conductanceQuantum,\n  deuteronMass,\n  electronMass,\n  faraday,\n  firstRadiation,\n  gravitationConstant,\n  hartreeEnergy,\n  klitzing,\n  magneticConstant,\n  molarMass,\n  molarPlanckConstant,\n  neutronMass,\n  planckCharge,\n  planckLength,\n  planckTemperature,\n  protonMass,\n  reducedPlanckConstant,\n  secondRadiation,\n  stefanBoltzmann,\n  vacuumImpedance,\n  usolve,\n  norm,\n  lusolve,\n  sqrtm,\n  multinomial,\n  avogadro,\n  classicalElectronRadius,\n  electricConstant,\n  fermiCoupling,\n  gravity,\n  loschmidt,\n  molarMassC12,\n  nuclearMagneton,\n  planckMass,\n  quantumOfCirculation,\n  speedOfLight,\n  wienDisplacement,\n  rotationMatrix,\n  median,\n  bohrRadius,\n  elementaryCharge,\n  inverseConductanceQuantum,\n  molarVolume,\n  planckTime,\n  thomsonCrossSection,\n  rotate,\n  parse,\n  evaluate,\n  mad,\n  coulomb,\n  magneticFluxQuantum,\n  rydberg,\n  unit,\n  help,\n  gasConstant,\n  compile,\n  simplify,\n  rationalize,\n  parser,\n  planckConstant,\n  derivative,\n  config\n});\n\n_extends(mathWithTransform, math, {\n  apply: createApplyTransform({\n    isInteger,\n    typed\n  }),\n  filter: createFilterTransform({\n    typed\n  }),\n  map: createMapTransform({\n    typed\n  }),\n  forEach: createForEachTransform({\n    typed\n  }),\n  subset: createSubsetTransform({\n    matrix,\n    typed\n  }),\n  index: createIndexTransform({\n    Index\n  }),\n  concat: createConcatTransform({\n    isInteger,\n    matrix,\n    typed\n  }),\n  max: createMaxTransform({\n    config,\n    larger,\n    numeric,\n    typed\n  }),\n  min: createMinTransform({\n    config,\n    numeric,\n    smaller,\n    typed\n  }),\n  sum: createSumTransform({\n    add,\n    config,\n    numeric,\n    typed\n  }),\n  column: createColumnTransform({\n    Index,\n    matrix,\n    range,\n    typed\n  }),\n  range: createRangeTransform({\n    bignumber,\n    matrix,\n    config,\n    larger,\n    largerEq,\n    smaller,\n    smallerEq,\n    typed\n  }),\n  diff: createDiffTransform({\n    bignumber,\n    matrix,\n    number,\n    subtract,\n    typed\n  }),\n  row: createRowTransform({\n    Index,\n    matrix,\n    range,\n    typed\n  }),\n  mean: createMeanTransform({\n    add,\n    divide,\n    typed\n  }),\n  variance: createVarianceTransform({\n    add,\n    apply,\n    divide,\n    isNaN,\n    multiply,\n    subtract,\n    typed\n  }),\n  std: createStdTransform({\n    sqrt,\n    typed,\n    variance\n  })\n});\n\n_extends(classes, {\n  ResultSet,\n  Complex,\n  Range,\n  Node,\n  ArrayNode,\n  BlockNode,\n  ConstantNode,\n  ObjectNode,\n  ParenthesisNode,\n  RelationalNode,\n  Chain,\n  BigNumber,\n  Matrix,\n  ConditionalNode,\n  OperatorNode,\n  Fraction,\n  RangeNode,\n  DenseMatrix,\n  FunctionAssignmentNode,\n  SparseMatrix,\n  ImmutableDenseMatrix,\n  FibonacciHeap,\n  AccessorNode,\n  IndexNode,\n  Index,\n  AssignmentNode,\n  Spa,\n  Unit,\n  SymbolNode,\n  FunctionNode,\n  Help,\n  Parser\n});\n\nChain.createProxy(math);\nexport { embeddedDocs as docs } from '../expression/embeddedDocs/embeddedDocs.js';","import { factory } from '../../utils/factory.js';\nvar name = 'ResultSet';\nvar dependencies = [];\nexport var 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   * Attach type information\n   */\n\n\n  ResultSet.prototype.type = 'ResultSet';\n  ResultSet.prototype.isResultSet = true;\n  /**\n   * Returns the array with results hold by this ResultSet\n   * @memberof ResultSet\n   * @returns {Array} entries\n   */\n\n  ResultSet.prototype.valueOf = function () {\n    return this.entries;\n  };\n  /**\n   * Returns the stringified results of the ResultSet\n   * @memberof ResultSet\n   * @returns {string} string\n   */\n\n\n  ResultSet.prototype.toString = function () {\n    return '[' + this.entries.join(', ') + ']';\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\n\n  ResultSet.prototype.toJSON = function () {\n    return {\n      mathjs: 'ResultSet',\n      entries: this.entries\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\n\n  ResultSet.fromJSON = function (json) {\n    return new ResultSet(json.entries);\n  };\n\n  return ResultSet;\n}, {\n  isClass: true\n});","import Complex from 'complex.js';\nimport { format } from '../../utils/number.js';\nimport { isNumber, isUnit } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Complex';\nvar dependencies = [];\nexport var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Complex.prototype.type = 'Complex';\n  Complex.prototype.isComplex = true;\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\n  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\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\n\n  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\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\n\n  Complex.prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = format(this.re, options);\n    var strIm = format(this.im, options); // round either re or im when smaller than the configured precision\n\n    var precision = isNumber(options) ? options : options ? options.precision : null;\n\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\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\n    return str;\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\n\n  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\n\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\n      case 2:\n        {\n          var r = arguments[0];\n          var phi = arguments[1];\n\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({\n                r: r,\n                phi: phi\n              });\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   * 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\n  Complex.fromJSON = function (json) {\n    return new Complex(json);\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\n\n  Complex.compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n\n    if (a.re < b.re) {\n      return -1;\n    }\n\n    if (a.im > b.im) {\n      return 1;\n    }\n\n    if (a.im < b.im) {\n      return -1;\n    }\n\n    return 0;\n  };\n\n  return Complex;\n}, {\n  isClass: true\n});","import { isBigNumber } from '../../utils/is.js';\nimport { format, sign } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Range';\nvar dependencies = [];\nexport var 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    var hasStart = start !== null && start !== undefined;\n    var hasEnd = end !== null && end !== undefined;\n    var 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\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\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   * Attach type information\n   */\n\n\n  Range.prototype.type = 'Range';\n  Range.prototype.isRange = true;\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\n  Range.parse = function (str) {\n    if (typeof str !== 'string') {\n      return null;\n    }\n\n    var args = str.split(':');\n    var nums = args.map(function (arg) {\n      return parseFloat(arg);\n    });\n    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\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\n      case 3:\n        return new Range(nums[0], nums[2], nums[1]);\n\n      default:\n        return null;\n    }\n  };\n  /**\n   * Create a clone of the range\n   * @return {Range} clone\n   */\n\n\n  Range.prototype.clone = function () {\n    return new Range(this.start, this.end, this.step);\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\n\n  Range.prototype.size = function () {\n    var len = 0;\n    var start = this.start;\n    var step = this.step;\n    var end = this.end;\n    var 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\n    return [len];\n  };\n  /**\n   * Calculate the minimum value in the range\n   * @memberof Range\n   * @return {number | undefined} min\n   */\n\n\n  Range.prototype.min = function () {\n    var 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   * Calculate the maximum value in the range\n   * @memberof Range\n   * @return {number | undefined} max\n   */\n\n\n  Range.prototype.max = function () {\n    var 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   * 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\n\n  Range.prototype.forEach = function (callback) {\n    var x = this.start;\n    var step = this.step;\n    var end = this.end;\n    var 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   * 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\n\n  Range.prototype.map = function (callback) {\n    var array = [];\n    this.forEach(function (value, index, obj) {\n      array[index[0]] = callback(value, index, obj);\n    });\n    return array;\n  };\n  /**\n   * Create an Array with a copy of the Ranges data\n   * @memberof Range\n   * @returns {Array} array\n   */\n\n\n  Range.prototype.toArray = function () {\n    var array = [];\n    this.forEach(function (value, index) {\n      array[index[0]] = value;\n    });\n    return array;\n  };\n  /**\n   * Get the primitive value of the Range, a one dimensional array\n   * @memberof Range\n   * @returns {Array} array\n   */\n\n\n  Range.prototype.valueOf = function () {\n    // TODO: implement a caching mechanism for range.valueOf()\n    return this.toArray();\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\n\n  Range.prototype.format = function (options) {\n    var str = format(this.start, options);\n\n    if (this.step !== 1) {\n      str += ':' + format(this.step, options);\n    }\n\n    str += ':' + format(this.end, options);\n    return str;\n  };\n  /**\n   * Get a string representation of the range.\n   * @memberof Range\n   * @returns {string}\n   */\n\n\n  Range.prototype.toString = function () {\n    return this.format();\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\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   * 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\n\n  Range.fromJSON = function (json) {\n    return new Range(json.start, json.end, json.step);\n  };\n\n  return Range;\n}, {\n  isClass: true\n});","import { memoize } from '../function.js';\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns e\n */\n\nexport var createBigNumberE = memoize(function (BigNumber) {\n  return new BigNumber(1).exp();\n}, {\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 */\n\nexport var createBigNumberPhi = memoize(function (BigNumber) {\n  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, {\n  hasher\n});\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\n\nexport var createBigNumberPi = memoize(function (BigNumber) {\n  return BigNumber.acos(-1);\n}, {\n  hasher\n});\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\n\nexport var createBigNumberTau = memoize(function (BigNumber) {\n  return createBigNumberPi(BigNumber).times(2);\n}, {\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 */\n\nfunction hasher(args) {\n  return args[0].precision;\n}","export var pi = Math.PI;\nexport var tau = 2 * Math.PI;\nexport var e = Math.E;\nexport var phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision","import { factory } from './utils/factory.js';\nimport { version } from './version.js';\nimport { createBigNumberE, createBigNumberPhi, createBigNumberPi, createBigNumberTau } from './utils/bignumber/constants.js';\nimport { pi, tau, e, phi } from './plain/number/index.js';\nexport var createTrue = /* #__PURE__ */factory('true', [], () => true);\nexport var createFalse = /* #__PURE__ */factory('false', [], () => false);\nexport var createNull = /* #__PURE__ */factory('null', [], () => null);\nexport var createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], (_ref) => {\n  var {\n    config,\n    BigNumber\n  } = _ref;\n  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;\n});\nexport var createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], (_ref2) => {\n  var {\n    config,\n    BigNumber\n  } = _ref2;\n  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;\n});\nexport var createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], (_ref3) => {\n  var {\n    config,\n    BigNumber\n  } = _ref3;\n  return config.number === 'BigNumber' ? createBigNumberPi(BigNumber) : pi;\n});\nexport var createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], (_ref4) => {\n  var {\n    config,\n    BigNumber\n  } = _ref4;\n  return config.number === 'BigNumber' ? createBigNumberTau(BigNumber) : tau;\n});\nexport var createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], (_ref5) => {\n  var {\n    config,\n    BigNumber\n  } = _ref5;\n  return config.number === 'BigNumber' ? createBigNumberE(BigNumber) : e;\n}); // golden ratio, (1+sqrt(5))/2\n\nexport var createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], (_ref6) => {\n  var {\n    config,\n    BigNumber\n  } = _ref6;\n  return config.number === 'BigNumber' ? createBigNumberPhi(BigNumber) : phi;\n});\nexport var createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], (_ref7) => {\n  var {\n    config,\n    BigNumber\n  } = _ref7;\n  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;\n});\nexport var createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], (_ref8) => {\n  var {\n    config,\n    BigNumber\n  } = _ref8;\n  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;\n});\nexport var createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], (_ref9) => {\n  var {\n    config,\n    BigNumber\n  } = _ref9;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;\n});\nexport var createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], (_ref10) => {\n  var {\n    config,\n    BigNumber\n  } = _ref10;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;\n});\nexport var createSQRT1_2 = /* #__PURE__ */recreateFactory( // eslint-disable-line camelcase\n'SQRT1_2', ['config', '?BigNumber'], (_ref11) => {\n  var {\n    config,\n    BigNumber\n  } = _ref11;\n  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;\n});\nexport var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], (_ref12) => {\n  var {\n    config,\n    BigNumber\n  } = _ref12;\n  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;\n});\nexport var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], (_ref13) => {\n  var {\n    Complex\n  } = _ref13;\n  return Complex.I;\n}); // for backward compatibility with v5\n\nexport var createUppercasePi = /* #__PURE__ */factory('PI', ['pi'], (_ref14) => {\n  var {\n    pi\n  } = _ref14;\n  return pi;\n});\nexport var createUppercaseE = /* #__PURE__ */factory('E', ['e'], (_ref15) => {\n  var {\n    e\n  } = _ref15;\n  return e;\n});\nexport var createVersion = /* #__PURE__ */factory('version', [], () => version); // 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?\n\nfunction recreateFactory(name, dependencies, create) {\n  return factory(name, dependencies, create, {\n    recreateOnConfigChange: true\n  });\n}","export var version = '9.3.0'; // Note: This file is automatically generated when building math.js.\n// Changes made in this file will be overwritten.","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nexport var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    on,\n    config\n  } = _ref;\n  var EUCLID = 9; // Use euclidian division for mod calculation\n\n  var BigNumber = Decimal.clone({\n    precision: config.precision,\n    modulo: EUCLID\n  });\n  /**\n   * Attach type information\n   */\n\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\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\n  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\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\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({\n          precision: curr.precision\n        });\n      }\n    });\n  }\n\n  return BigNumber;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Matrix';\nvar dependencies = [];\nexport var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * @constructor Matrix\n   *\n   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n   * array. A matrix can be constructed as:\n   *\n   *     let matrix = math.matrix(data)\n   *\n   * Matrix contains the functions to resize, get and set values, get the size,\n   * clone the matrix and to convert the matrix to a vector, array, or scalar.\n   * Furthermore, one can iterate over the matrix using map and forEach.\n   * The internal Array of the Matrix can be accessed using the function valueOf.\n   *\n   * Example usage:\n   *\n   *     let matrix = math.matrix([[1, 2], [3, 4]])\n   *     matix.size()              // [2, 2]\n   *     matrix.resize([3, 2], 5)\n   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]\n   *     matrix.subset([1,2])       // 3 (indexes are zero-based)\n   *\n   */\n  function Matrix() {\n    if (!(this instanceof Matrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\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\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   * 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\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   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n\n\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\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\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   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n\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   * 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\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   * 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\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   * 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\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   * Create a clone of the matrix\n   * @return {Matrix} clone\n   */\n\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   * Retrieve the size of the matrix.\n   * @returns {number[]} size\n   */\n\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   * 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\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   * 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\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   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\n   */\n\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   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\n   */\n\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   * 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\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   * Get a string representation of the matrix\n   * @returns {string} str\n   */\n\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}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nvar name = 'replacer';\nvar dependencies = [];\nexport var 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});","import { factory } from '../../utils/factory.js'; // Source: https://en.wikipedia.org/wiki/Physical_constant\n// Universal constants\n\nexport var createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');\nexport var createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');\nexport var createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');\nexport var createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s'); // Electromagnetic constants\n\nexport var createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');\nexport var createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');\nexport var createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');\nexport var createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2');\nexport var createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');\nexport var createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');\nexport var createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');\nexport var createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');\nexport var createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');\nexport var createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');\nexport var createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');\nexport var createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed\n// Atomic and nuclear constants\n\nexport var createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');\nexport var createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');\nexport var createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');\nexport var createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');\nexport var createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);\nexport var createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');\nexport var createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');\nexport var createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');\nexport var createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');\nexport var createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');\nexport var createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');\nexport var createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');\nexport var createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);\nexport var createEfimovFactor = numberFactory('efimovFactor', 22.7); // Physico-chemical constants\n\nexport var createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');\nexport var createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');\nexport var createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');\nexport var createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');\nexport 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\n\nexport var createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');\nexport var createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');\nexport var createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');\nexport var createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');\nexport var createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);\nexport var createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');\nexport var createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');\nexport var createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K'); // Adopted values\n\nexport var createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');\nexport var createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');\nexport var createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2'); // atm is defined in Unit.js\n// Natural units\n\nexport var createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');\nexport var createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');\nexport var createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');\nexport var createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');\nexport var createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K'); // 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\n\nfunction unitFactory(name, valueStr, unitStr) {\n  var dependencies = ['config', 'Unit', 'BigNumber'];\n  return factory(name, dependencies, (_ref) => {\n    var {\n      config,\n      Unit,\n      BigNumber\n    } = _ref;\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    var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);\n    var unit = new Unit(value, unitStr);\n    unit.fixPrefix = true;\n    return unit;\n  });\n} // helper function to create a factory function which creates a numeric constant,\n// either a number or BigNumber depending on the configuration\n\n\nfunction numberFactory(name, value) {\n  var dependencies = ['config', 'BigNumber'];\n  return factory(name, dependencies, (_ref2) => {\n    var {\n      config,\n      BigNumber\n    } = _ref2;\n    return config.number === 'BigNumber' ? new BigNumber(value) : value;\n  });\n}","import Fraction from 'fraction.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Fraction';\nvar dependencies = [];\nexport var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Fraction.prototype.type = 'Fraction';\n  Fraction.prototype.isFraction = true;\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\n  Fraction.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: this.s * this.n,\n      d: this.d\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\n\n  Fraction.fromJSON = function (json) {\n    return new Fraction(json);\n  };\n\n  return Fraction;\n}, {\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';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Matrix\n  } = _ref;\n\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   */\n  function DenseMatrix(data, datatype) {\n    if (!(this instanceof DenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\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; // verify the dimensions of the array\n\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); // get the dimensions of the array\n\n      this._size = arraySize(this._data); // verify the dimensions of the array, TODO: compute size while processing array\n\n      validate(this._data, this._size); // data type unknown\n\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   * Create a new DenseMatrix\n   */\n\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n  /**\n   * Attach type information\n   */\n\n\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\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\n  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data, typeOf);\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\n\n  DenseMatrix.prototype.storage = function () {\n    return 'dense';\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\n\n  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n\n\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\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\n\n  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n      // intentional fall through\n\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   * Get a single element from the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n\n\n  DenseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check index\n\n\n    for (var x = 0; x < index.length; x++) {\n      validateIndex(index[x], this._size[x]);\n    }\n\n    var data = this._data;\n\n    for (var i = 0, ii = index.length; i < ii; i++) {\n      var indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n\n    return data;\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\n\n  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length < this._size.length) {\n      throw new DimensionError(index.length, this._size.length, '<');\n    }\n\n    var i, ii, indexI; // enlarge matrix when needed\n\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n\n    _fit(this, size, defaultValue); // traverse over the dimensions\n\n\n    var data = this._data;\n\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    } // set new value\n\n\n    indexI = index[index.length - 1];\n    validateIndex(indexI, data.length);\n    data[indexI] = value;\n    return this;\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\n\n  function _get(matrix, index) {\n    if (!isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n\n    var isScalar = index.isScalar();\n\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length);\n      } // validate if any of the ranges in the index is out of range\n\n\n      var min = index.min();\n      var max = index.max();\n\n      for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n        validateIndex(min[i], matrix._size[i]);\n        validateIndex(max[i], matrix._size[i]);\n      } // retrieve submatrix\n      // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n\n\n      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\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\n\n  function _getSubmatrix(data, index, dims, dim) {\n    var last = dim === dims - 1;\n    var 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        var child = data[i];\n        return _getSubmatrix(child, index, dims, dim + 1);\n      }).valueOf();\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\n\n  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    } // get index size and check whether the index contains a single value\n\n\n    var iSize = index.size();\n    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n    var sSize;\n\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      // 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      // 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        var i = 0;\n        var outer = 0;\n\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        } // unsqueeze both outer and inner dimensions\n\n\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      } // check whether the size of the submatrix matches the index size\n\n\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      } // enlarge matrix when needed\n\n\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n\n      _fit(matrix, size, defaultValue); // insert the sub matrix\n\n\n      var dims = iSize.length;\n      var dim = 0;\n\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n    }\n\n    return matrix;\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\n\n  function _setSubmatrix(data, index, submatrix, dims, dim) {\n    var last = dim === dims - 1;\n    var 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\n        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\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\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    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n\n\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    }); // matrix to resize\n\n    var m = copy ? this.clone() : this; // resize matrix\n\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      var v = matrix._data; // go deep\n\n      while (isArray(v)) {\n        v = v[0];\n      }\n\n      return v;\n    } // resize matrix\n\n\n    matrix._size = size.slice(0); // copy the array\n\n    matrix._data = resize(matrix._data, matrix._size, defaultValue); // return matrix\n\n    return matrix;\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\n\n  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = reshape(m._data, size);\n\n    var currentLength = m._size.reduce((length, size) => length * size);\n\n    m._size = processSizesWildcard(size, currentLength);\n    return m;\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\n\n  function _fit(matrix, size, defaultValue) {\n    var // copy the array\n    newSize = matrix._size.slice(0);\n\n    var changed = false; // add dimensions when needed\n\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    } // enlarge size when needed\n\n\n    for (var i = 0, ii = size.length; i < ii; i++) {\n      if (size[i] > newSize[i]) {\n        newSize[i] = size[i];\n        changed = true;\n      }\n    }\n\n    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n\n\n  DenseMatrix.prototype.clone = function () {\n    var m = new DenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n\n\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\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\n\n  DenseMatrix.prototype.map = function (callback) {\n    // matrix instance\n    var me = this;\n\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        return value.map(function (child, i) {\n          return recurse(child, index.concat(i));\n        });\n      } else {\n        return callback(value, index, me);\n      }\n    }; // determine the new datatype when the original matrix has datatype defined\n    // TODO: should be done in matrix constructor instead\n\n\n    var data = recurse(this._data, []);\n    var datatype = this._datatype !== undefined ? getArrayDataType(data, typeOf) : undefined;\n    return new DenseMatrix(data, datatype);\n  };\n  /**\n   * 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\n\n  DenseMatrix.prototype.forEach = function (callback) {\n    // matrix instance\n    var me = this;\n\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        value.forEach(function (child, i) {\n          recurse(child, index.concat(i));\n        });\n      } else {\n        callback(value, index, me);\n      }\n    };\n\n    recurse(this._data, []);\n  };\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n\n\n  DenseMatrix.prototype.toArray = function () {\n    return clone(this._data);\n  };\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n\n\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\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\n\n  DenseMatrix.prototype.format = function (options) {\n    return format(this._data, options);\n  };\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n\n\n  DenseMatrix.prototype.toString = function () {\n    return format(this._data);\n  };\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\n   */\n\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   * 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\n\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // number diagonal values\n\n    var n = Math.min(rows - kSub, columns - kSuper); // x is a matrix get diagonal from matrix\n\n    var data = []; // loop rows\n\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    } // create DenseMatrix\n\n\n    return new DenseMatrix({\n      data: data,\n      size: [n],\n      datatype: this._datatype\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\n\n  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // map size & validate\n\n\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      } // validate arguments\n\n\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n\n      return s;\n    }); // validate k if any\n\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows and columns\n\n    var rows = size[0];\n    var columns = size[1]; // number of non-zero items\n\n    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n    var _value; // check value\n\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size(); // validate matrix\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    } // discover default value if needed\n\n\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero\n      : 0;\n    } // empty array\n\n\n    var data = []; // check we need to resize array\n\n    if (size.length > 0) {\n      // resize array\n      data = resize(data, size, defaultValue); // fill diagonal\n\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    } // create DenseMatrix\n\n\n    return new DenseMatrix({\n      data: data,\n      size: [rows, columns]\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\n\n  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\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\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    } // check dimensions\n\n\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    } // validate index\n\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]); // swap rows\n\n    DenseMatrix._swapRows(i, j, this._data); // return current instance\n\n\n    return this;\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\n\n  DenseMatrix._swapRows = function (i, j, data) {\n    // swap values i <-> j\n    var vi = data[i];\n    data[i] = data[j];\n    data[j] = vi;\n  };\n  /**\n   * 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\n\n  function preprocess(data) {\n    for (var i = 0, ii = data.length; i < ii; i++) {\n      var elem = data[i];\n\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}, {\n  isClass: true\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 */\nimport { 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';\nimport typedFunction from 'typed-function';\nimport { digits } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js'; // returns a new instance of typed-function\n\nvar _createTyped2 = function _createTyped() {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped2 = typedFunction.create;\n  return typedFunction;\n};\n\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\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 */\n\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n  var {\n    BigNumber,\n    Complex,\n    DenseMatrix,\n    Fraction\n  } = _ref;\n\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n  // get a new instance of typed-function\n  var typed = _createTyped2(); // 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\n\n  typed.types = [{\n    name: 'number',\n    test: isNumber\n  }, {\n    name: 'Complex',\n    test: isComplex\n  }, {\n    name: 'BigNumber',\n    test: isBigNumber\n  }, {\n    name: 'Fraction',\n    test: isFraction\n  }, {\n    name: 'Unit',\n    test: isUnit\n  }, {\n    name: 'string',\n    test: isString\n  }, {\n    name: 'Chain',\n    test: isChain\n  }, {\n    name: 'Array',\n    test: isArray\n  }, {\n    name: 'Matrix',\n    test: isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: isSparseMatrix\n  }, {\n    name: 'Range',\n    test: isRange\n  }, {\n    name: 'Index',\n    test: isIndex\n  }, {\n    name: 'boolean',\n    test: isBoolean\n  }, {\n    name: 'ResultSet',\n    test: isResultSet\n  }, {\n    name: 'Help',\n    test: isHelp\n  }, {\n    name: 'function',\n    test: isFunction\n  }, {\n    name: 'Date',\n    test: isDate\n  }, {\n    name: 'RegExp',\n    test: isRegExp\n  }, {\n    name: 'null',\n    test: isNull\n  }, {\n    name: 'undefined',\n    test: isUndefined\n  }, {\n    name: 'AccessorNode',\n    test: isAccessorNode\n  }, {\n    name: 'ArrayNode',\n    test: isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: isConditionalNode\n  }, {\n    name: 'ConstantNode',\n    test: isConstantNode\n  }, {\n    name: 'FunctionNode',\n    test: isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: isFunctionAssignmentNode\n  }, {\n    name: 'IndexNode',\n    test: isIndexNode\n  }, {\n    name: 'Node',\n    test: isNode\n  }, {\n    name: 'ObjectNode',\n    test: isObjectNode\n  }, {\n    name: 'OperatorNode',\n    test: isOperatorNode\n  }, {\n    name: 'ParenthesisNode',\n    test: isParenthesisNode\n  }, {\n    name: 'RangeNode',\n    test: isRangeNode\n  }, {\n    name: 'SymbolNode',\n    test: isSymbolNode\n  }, {\n    name: 'Object',\n    test: isObject\n  } // order 'Object' last, it matches on other classes too\n  ];\n  typed.conversions = [{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      } // note: conversion from number to BigNumber can fail if x has >15 digits\n\n\n      if (digits(x) > 15) {\n        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n      }\n\n      return new BigNumber(x);\n    }\n  }, {\n    from: 'number',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n\n      return new Complex(x, 0);\n    }\n  }, {\n    from: 'number',\n    to: 'string',\n    convert: function convert(x) {\n      return x + '';\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(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 convert(x) {\n      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n    }\n  }, {\n    from: 'Fraction',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n\n      return new Complex(x.valueOf(), 0);\n    }\n  }, {\n    from: 'number',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n\n      var f = new Fraction(x);\n\n      if (f.valueOf() !== x) {\n        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n      }\n\n      return f;\n    }\n  }, {\n    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n    //  from: 'Fraction',\n    //  to: 'number',\n    //  convert: function (x) {\n    //    return x.valueOf()\n    //  }\n    // }, {\n    from: 'string',\n    to: 'number',\n    convert: function convert(x) {\n      var n = Number(x);\n\n      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\n      }\n\n      return n;\n    }\n  }, {\n    from: 'string',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      try {\n        return new BigNumber(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n\n      try {\n        return new Fraction(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Fraction');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n\n      try {\n        return new Complex(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Complex');\n      }\n    }\n  }, {\n    from: 'boolean',\n    to: 'number',\n    convert: function convert(x) {\n      return +x;\n    }\n  }, {\n    from: 'boolean',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      return new BigNumber(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n\n      return new Fraction(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'string',\n    convert: function convert(x) {\n      return String(x);\n    }\n  }, {\n    from: 'Array',\n    to: 'Matrix',\n    convert: function convert(array) {\n      if (!DenseMatrix) {\n        throwNoMatrix();\n      }\n\n      return new DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }];\n  return typed;\n});\n\nfunction throwNoBignumber(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\n\nfunction throwNoComplex(x) {\n  throw new Error(\"Cannot convert value \".concat(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 \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","import { deepMap } from '../../utils/collection.js';\nimport { isInteger as isIntegerNumber } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isInteger';\nvar dependencies = ['typed'];\nexport var createIsInteger = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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,\n    // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n    BigNumber: function BigNumber(x) {\n      return x.isInt();\n    },\n    Fraction: function Fraction(x) {\n      return x.d === 1 && isFinite(x.n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isNumeric';\nvar dependencies = ['typed'];\nexport var createIsNumeric = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 numberBigNumberFractionBoolean() {\n      return true;\n    },\n    'Complex | Unit | string | null | undefined | Node': function ComplexUnitStringNullUndefinedNode() {\n      return false;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nexport function isIntegerNumber(x) {\n  return isInteger(x);\n}\nisIntegerNumber.signature = n1;\nexport function isNegativeNumber(x) {\n  return x < 0;\n}\nisNegativeNumber.signature = n1;\nexport function isPositiveNumber(x) {\n  return x > 0;\n}\nisPositiveNumber.signature = n1;\nexport function isZeroNumber(x) {\n  return x === 0;\n}\nisZeroNumber.signature = n1;\nexport function isNaNNumber(x) {\n  return Number.isNaN(x);\n}\nisNaNNumber.signature = n1;","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isPositiveNumber } from '../../plain/number/index.js';\nvar name = 'isPositive';\nvar dependencies = ['typed'];\nexport var createIsPositive = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return !x.isNeg() && !x.isZero() && !x.isNaN();\n    },\n    Fraction: function Fraction(x) {\n      return x.s > 0 && x.n > 0;\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNaNNumber } from '../../plain/number/index.js';\nvar name = 'isNaN';\nvar dependencies = ['typed'];\nexport var createIsNaN = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return x.isNaN();\n    },\n    Fraction: function Fraction(x) {\n      return false;\n    },\n    Complex: function Complex(x) {\n      return x.isNaN();\n    },\n    Unit: function Unit(x) {\n      return Number.isNaN(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, Number.isNaN);\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  } // use \"==\" operator, handles infinities\n\n\n  if (x.eq(y)) {\n    return true;\n  } // NaN\n\n\n  if (x.isNaN() || y.isNaN()) {\n    return false;\n  } // at this point x and y should be finite\n\n\n  if (x.isFinite() && y.isFinite()) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = x.minus(y).abs();\n\n    if (diff.isZero()) {\n      return true;\n    } else {\n      // use relative error\n      var max = x.constructor.max(x.abs(), y.abs());\n      return diff.lte(max.times(epsilon));\n    }\n  } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n  return false;\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';\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nexport var createEqualScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config\n  } = _ref;\n\n  /**\n   * Test whether two scalar values are nearly equal.\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex} y          Second value to compare\n   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false\n   * @private\n   */\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.equals(y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return complexEquals(x, y, config.epsilon);\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    }\n  });\n});\nexport var createEqualScalarNumber = factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { nearlyEqual } from './number.js';\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 */\n\nexport function complexEquals(x, y, epsilon) {\n  return nearlyEqual(x.re, y.re, epsilon) && nearlyEqual(x.im, y.im, epsilon);\n}","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\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 */\n\nfunction getNonDecimalNumberParts(input) {\n  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\n\n  if (nonDecimalWithRadixMatch) {\n    var radix = {\n      '0b': 2,\n      '0o': 8,\n      '0x': 16\n    }[nonDecimalWithRadixMatch[1]];\n    var integerPart = nonDecimalWithRadixMatch[2];\n    var fractionalPart = nonDecimalWithRadixMatch[3];\n    return {\n      input,\n      radix,\n      integerPart,\n      fractionalPart\n    };\n  } else {\n    return null;\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 */\n\n\nfunction makeNumberFromNonDecimalParts(parts) {\n  var n = parseInt(parts.integerPart, parts.radix);\n  var f = 0;\n\n  for (var i = 0; i < parts.fractionalPart.length; i++) {\n    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);\n    f += digitValue / Math.pow(parts.radix, i + 1);\n  }\n\n  var result = n + f;\n\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is no valid number');\n  }\n\n  return result;\n}\n\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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  var number = typed('number', {\n    '': function _() {\n      return 0;\n    },\n    number: function number(x) {\n      return x;\n    },\n    string: function string(x) {\n      if (x === 'NaN') return NaN;\n      var nonDecimalNumberParts = getNonDecimalNumberParts(x);\n\n      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n      }\n\n      var size = 0;\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n\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\n      var num = Number(x);\n\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is no valid number');\n      }\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 \\\"\".concat(x, \"\\\" is out of range\"));\n        } // check if the bit at index size - 1 is set and if so do the twos complement\n\n\n        if (num >= 2 ** (size - 1)) {\n          num = num - 2 ** size;\n        }\n      }\n\n      return num;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.toNumber();\n    },\n    Fraction: function Fraction(x) {\n      return x.valueOf();\n    },\n    Unit: function Unit(x) {\n      throw new Error('Second argument with valueless unit expected');\n    },\n    null: function _null(x) {\n      return 0;\n    },\n    'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\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\n  number.fromJSON = function (json) {\n    return parseFloat(json.value);\n  };\n\n  return number;\n});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'boolean';\nvar dependencies = ['typed'];\nexport var createBoolean = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    boolean: function boolean(x) {\n      return x;\n    },\n    number: function number(x) {\n      return !!x;\n    },\n    null: function _null(x) {\n      return false;\n    },\n    BigNumber: function BigNumber(x) {\n      return !x.isZero();\n    },\n    string: function string(x) {\n      // try case insensitive\n      var lcase = x.toLowerCase();\n\n      if (lcase === 'true') {\n        return true;\n      } else if (lcase === 'false') {\n        return false;\n      } // test whether value is a valid number\n\n\n      var num = Number(x);\n\n      if (x !== '' && !isNaN(num)) {\n        return !!num;\n      }\n\n      throw new Error('Cannot convert \"' + x + '\" to a boolean');\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'complex';\nvar dependencies = ['typed', 'Complex'];\nexport var createComplex = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Complex\n  } = _ref;\n\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    number: function number(x) {\n      return new Complex(x, 0);\n    },\n    'number, number': function numberNumber(re, im) {\n      return new Complex(re, im);\n    },\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {\n      return new Complex(re.toNumber(), im.toNumber());\n    },\n    Fraction: function Fraction(x) {\n      return new Complex(x.valueOf(), 0);\n    },\n    Complex: function Complex(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      return Complex(x); // for example '2 + 3i'\n    },\n    null: function _null(x) {\n      return Complex(0);\n    },\n    Object: function Object(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'splitUnit';\nvar dependencies = ['typed'];\nexport var createSplitUnit = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 UnitArray(unit, parts) {\n      return unit.splitUnit(parts);\n    }\n  });\n});","import { isInteger, log2, log10, cbrt, expm1, sign, toFixed, log1p } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n  return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n  return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n  return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n  return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n  return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n  return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n  return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n  return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function ceilNumber(x) {\n  return Math.ceil(x);\n}\nceilNumber.signature = n1;\nexport function cubeNumber(x) {\n  return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n  return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n  return expm1(x);\n}\nexpm1Number.signature = n1;\nexport function fixNumber(x) {\n  return x > 0 ? Math.floor(x) : Math.ceil(x);\n}\nfixNumber.signature = n1;\nexport function floorNumber(x) {\n  return Math.floor(x);\n}\nfloorNumber.signature = n1;\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 */\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  } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n  var r;\n\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n\n  return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\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 */\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  } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n\n\n  var t;\n  var prod = a * b;\n\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n\n  return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n/**\n * Calculate the logarithm of a value.\n * @param {number} x\n * @return {number}\n */\n\nexport function logNumber(x) {\n  return Math.log(x);\n}\nlogNumber.signature = n1;\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\n\nexport function log10Number(x) {\n  return log10(x);\n}\nlog10Number.signature = n1;\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\n\nexport function log2Number(x) {\n  return log2(x);\n}\nlog2Number.signature = n1;\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\n\nexport function log1pNumber(x) {\n  return log1p(x);\n}\nlog1pNumber.signature = n1;\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\n\nexport function modNumber(x, y) {\n  if (y > 0) {\n    // We don't use JavaScript's % operator here as this doesn't work\n    // correctly for x < 0 and x === 0\n    // see https://en.wikipedia.org/wiki/Modulo_operation\n    return x - y * Math.floor(x / y);\n  } else if (y === 0) {\n    return x;\n  } else {\n    // y < 0\n    // TODO: implement mod for a negative divisor\n    throw new Error('Cannot calculate mod for a negative divisor');\n  }\n}\nmodNumber.signature = n2;\n/**\n * 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 */\n\nexport function nthRootNumber(a, root) {\n  var inv = root < 0;\n\n  if (inv) {\n    root = -root;\n  }\n\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  } // edge cases zero and infinity\n\n\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n\n  var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x; // 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  /*\n  let x = 1 // Initial guess\n  let xPrev = 1\n  let i = 0\n  const iMax = 10000\n  do {\n    const delta = (a / Math.pow(x, root - 1) - x) / root\n    xPrev = x\n    x = x + delta\n    i++\n  }\n  while (xPrev !== x && i < iMax)\n   if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n   return inv ? 1 / x : x\n  */\n}\nnthRootNumber.signature = n2;\nexport function signNumber(x) {\n  return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n  return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n  return x * x;\n}\nsquareNumber.signature = n1;\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\n\nexport function xgcdNumber(a, b) {\n  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n  var t; // used to swap two variables\n\n  var q; // quotient\n\n  var r; // remainder\n\n  var x = 0;\n  var lastx = 1;\n  var y = 1;\n  var 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    t = x;\n    x = lastx - q * x;\n    lastx = t;\n    t = y;\n    y = lasty - q * y;\n    lasty = t;\n    a = b;\n    b = r;\n  }\n\n  var res;\n\n  if (a < 0) {\n    res = [-a, -lastx, -lasty];\n  } else {\n    res = [a, a ? lastx : 0, lasty];\n  }\n\n  return res;\n}\nxgcdNumber.signature = n2;\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 */\n\nexport function powNumber(x, y) {\n  // x^Infinity === 0 if -1 < x < 1\n  // A real number 0 is returned instead of complex(0)\n  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n    return 0;\n  }\n\n  return Math.pow(x, y);\n}\npowNumber.signature = n2;\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 */\n\nexport function roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  return parseFloat(toFixed(value, decimals));\n}\nroundNumber.signature = n2;\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\n\nexport function normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryPlusNumber } from '../../plain/number/index.js';\nvar name = 'unaryPlus';\nvar dependencies = ['typed', 'config', 'BigNumber'];\nexport var createUnaryPlus = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x; // complex numbers are immutable\n    },\n    BigNumber: function BigNumber(x) {\n      return x; // bignumbers are immutable\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    Unit: function Unit(x) {\n      return x.clone();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since unaryPlus(0) = 0\n      return deepMap(x, this, true);\n    },\n    'boolean | string': function booleanString(x) {\n      // convert to a number or bignumber\n      return config.number === 'BigNumber' ? new BigNumber(+x) : +x;\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cubeNumber } from '../../plain/number/index.js';\nvar name = 'cube';\nvar dependencies = ['typed'];\nexport var createCube = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.mul(x).mul(x); // Is faster than pow(x, 3)\n    },\n    BigNumber: function BigNumber(x) {\n      return x.times(x).times(x);\n    },\n    Fraction: function Fraction(x) {\n      return x.pow(3); // Is faster than mul()mul()mul()\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since cube(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return x.pow(3);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { expm1Number } from '../../plain/number/index.js';\nvar name = 'expm1';\nvar dependencies = ['typed', 'Complex'];\nexport var createExpm1 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Complex: _Complex\n  } = _ref;\n\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    Complex: function Complex(x) {\n      var r = Math.exp(x.re);\n      return new _Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));\n    },\n    BigNumber: function BigNumber(x) {\n      return x.exp().minus(1);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { log10Number } from '../../plain/number/index.js';\nvar name = 'log10';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createLog10 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex: _Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return new _Complex(x).log().div(Math.LN10);\n    },\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { multiplyNumber } from '../../plain/number/index.js';\nvar name = 'multiplyScalar';\nvar dependencies = ['typed'];\nexport var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\n   * Multiply two scalar values, `x * y`.\n   * This function is meant for internal use: it is used by the public function\n   * `multiply`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to multiply\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to multiply\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Multiplication of `x` and `y`\n   * @private\n   */\n  return typed('multiplyScalar', {\n    'number, number': multiplyNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.mul(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.times(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.mul(y);\n    },\n    'number | Fraction | BigNumber | Complex, Unit': function numberFractionBigNumberComplexUnit(x, y) {\n      var res = y.clone();\n      res.value = res.value === null ? res._normalize(x) : this(res.value, x);\n      return res;\n    },\n    'Unit, number | Fraction | BigNumber | Complex': function UnitNumberFractionBigNumberComplex(x, y) {\n      var res = x.clone();\n      res.value = res.value === null ? res._normalize(y) : this(res.value, y);\n      return res;\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return x.multiply(y);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { signNumber } from '../../plain/number/index.js';\nvar name = 'sign';\nvar dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];\nexport var createSign = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber,\n    complex,\n    Fraction: _Fraction\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.im === 0 ? complex(signNumber(x.re)) : x.sign();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x.cmp(0));\n    },\n    Fraction: function Fraction(x) {\n      return new _Fraction(x.s, 1);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sign(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { squareNumber } from '../../plain/number/index.js';\nvar name = 'square';\nvar dependencies = ['typed'];\nexport var createSquare = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.mul(x);\n    },\n    BigNumber: function BigNumber(x) {\n      return x.times(x);\n    },\n    Fraction: function Fraction(x) {\n      return x.mul(x);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since square(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return x.pow(2);\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  var BigNumber = x.constructor;\n\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\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\n      return new BigNumber(0);\n    }\n\n    if (!x.isFinite()) {\n      if (y.isNegative()) {\n        return x;\n      }\n\n      if (x.isNegative()) {\n        return new BigNumber(0);\n      }\n\n      return y;\n    }\n\n    if (!y.isFinite()) {\n      if (x.isNegative()) {\n        return y;\n      }\n\n      if (y.isNegative()) {\n        return new BigNumber(0);\n      }\n\n      return x;\n    }\n  }\n\n  return bitwise(x, y, function (a, b) {\n    return a & b;\n  });\n}\n/**\n * Bitwise not\n * @param {BigNumber} x\n * @return {BigNumber} Result of ~`x`, fully precise\n *\n */\n\nexport function bitNotBigNumber(x) {\n  if (x.isFinite() && !x.isInteger()) {\n    throw new Error('Integer expected in function bitNot');\n  }\n\n  var BigNumber = x.constructor;\n  var prevPrec = BigNumber.precision;\n  BigNumber.config({\n    precision: 1E9\n  });\n  var result = x.plus(new BigNumber(1));\n  result.s = -result.s || null;\n  BigNumber.config({\n    precision: prevPrec\n  });\n  return result;\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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n\n  var negOne = new BigNumber(-1);\n\n  if (x.isZero() || y.eq(negOne) || x.eq(y)) {\n    return y;\n  }\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() || x.isNegative() && !y.isNegative() && !y.isFinite()) {\n      return negOne;\n    }\n\n    if (x.isNegative() && y.isNegative()) {\n      return x.isFinite() ? x : y;\n    }\n\n    return x.isFinite() ? y : x;\n  }\n\n  return bitwise(x, y, function (a, b) {\n    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 */\n\nexport function bitwise(x, y, func) {\n  var BigNumber = x.constructor;\n  var xBits, yBits;\n  var xSign = +(x.s < 0);\n  var ySign = +(y.s < 0);\n\n  if (xSign) {\n    xBits = decCoefficientToBinaryString(bitNotBigNumber(x));\n\n    for (var i = 0; i < xBits.length; ++i) {\n      xBits[i] ^= 1;\n    }\n  } else {\n    xBits = decCoefficientToBinaryString(x);\n  }\n\n  if (ySign) {\n    yBits = decCoefficientToBinaryString(bitNotBigNumber(y));\n\n    for (var _i = 0; _i < yBits.length; ++_i) {\n      yBits[_i] ^= 1;\n    }\n  } else {\n    yBits = decCoefficientToBinaryString(y);\n  }\n\n  var minBits, maxBits, minSign;\n\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  var shortLen = minBits.length;\n  var longLen = maxBits.length;\n  var expFuncVal = func(xSign, ySign) ^ 1;\n  var outVal = new BigNumber(expFuncVal ^ 1);\n  var twoPower = new BigNumber(1);\n  var two = new BigNumber(2);\n  var prevPrec = BigNumber.precision;\n  BigNumber.config({\n    precision: 1E9\n  });\n\n  while (shortLen > 0) {\n    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n\n    twoPower = twoPower.times(two);\n  }\n\n  while (longLen > 0) {\n    if (func(minSign, maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n\n    twoPower = twoPower.times(two);\n  }\n\n  BigNumber.config({\n    precision: prevPrec\n  });\n\n  if (expFuncVal === 0) {\n    outVal.s = -outVal.s;\n  }\n\n  return outVal;\n}\n/* Extracted from decimal.js, and edited to specialize. */\n\nfunction decCoefficientToBinaryString(x) {\n  // Convert to string\n  var a = x.d; // array with digits\n\n  var r = a[0] + '';\n\n  for (var i = 1; i < a.length; ++i) {\n    var s = a[i] + '';\n\n    for (var z = 7 - s.length; z--;) {\n      s = '0' + s;\n    }\n\n    r += s;\n  }\n\n  var j = r.length;\n\n  while (r.charAt(j) === '0') {\n    j--;\n  }\n\n  var xe = x.e;\n  var str = r.slice(0, j + 1 || 1);\n  var strL = str.length;\n\n  if (xe > 0) {\n    if (++xe > strL) {\n      // Append zeros.\n      xe -= strL;\n\n      while (xe--) {\n        str += '0';\n      }\n    } else if (xe < strL) {\n      str = str.slice(0, xe) + '.' + str.slice(xe);\n    }\n  } // Convert from base 10 (decimal) to base 2\n\n\n  var arr = [0];\n\n  for (var _i2 = 0; _i2 < str.length;) {\n    var arrL = arr.length;\n\n    while (arrL--) {\n      arr[arrL] *= 10;\n    }\n\n    arr[0] += parseInt(str.charAt(_i2++)); // convert to int\n\n    for (var _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 * 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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero()) {\n    return y;\n  }\n\n  if (y.isZero()) {\n    return x;\n  }\n\n  if (x.eq(y)) {\n    return new BigNumber(0);\n  }\n\n  var negOne = new BigNumber(-1);\n\n  if (x.eq(negOne)) {\n    return bitNotBigNumber(y);\n  }\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\n    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);\n  }\n\n  return bitwise(x, y, function (a, b) {\n    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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n\n  if (!x.isFinite() && !y.isFinite()) {\n    return new BigNumber(NaN);\n  } // Math.pow(2, y) is fully precise for y < 55, and fast\n\n\n  if (y.lt(55)) {\n    return x.times(Math.pow(2, y.toNumber()) + '');\n  }\n\n  return x.times(new BigNumber(2).pow(y));\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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n\n  if (!y.isFinite()) {\n    if (x.isNegative()) {\n      return new BigNumber(-1);\n    }\n\n    if (!x.isFinite()) {\n      return new BigNumber(NaN);\n    }\n\n    return new BigNumber(0);\n  } // Math.pow(2, y) is fully precise for y < 55, and fast\n\n\n  if (y.lt(55)) {\n    return x.div(Math.pow(2, y.toNumber()) + '').floor();\n  }\n\n  return x.div(new BigNumber(2).pow(y)).floor();\n}","import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\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;\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;\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;\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;\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;\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;\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;","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';\nvar name = 'bitNot';\nvar dependencies = ['typed'];\nexport var createBitNot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: bitNotBigNumber,\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'arg';\nvar dependencies = ['typed'];\nexport var createArg = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return Math.atan2(0, x);\n    },\n    BigNumber: function BigNumber(x) {\n      return x.constructor.atan2(0, x);\n    },\n    Complex: function Complex(x) {\n      return x.arg();\n    },\n    // TODO: implement BigNumber support for function arg\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'im';\nvar dependencies = ['typed'];\nexport var createIm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return 0;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.mul(0);\n    },\n    Complex: function Complex(x) {\n      return x.im;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","var n1 = 'number';\nvar n2 = 'number, number';\nexport function notNumber(x) {\n  return !x;\n}\nnotNumber.signature = n1;\nexport function orNumber(x, y) {\n  return !!(x || y);\n}\norNumber.signature = n2;\nexport function xorNumber(x, y) {\n  return !!x !== !!y;\n}\nxorNumber.signature = n2;\nexport function andNumber(x, y) {\n  return !!(x && y);\n}\nandNumber.signature = n2;","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { notNumber } from '../../plain/number/index.js';\nvar name = 'not';\nvar dependencies = ['typed'];\nexport var createNot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.re === 0 && x.im === 0;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.isZero() || x.isNaN();\n    },\n    Unit: function Unit(x) {\n      return x.value !== null ? this(x.value) : true;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { filter, filterRegExp } from '../../utils/array.js';\nimport { maxArgumentCount } from '../../utils/function.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'filter';\nvar dependencies = ['typed'];\nexport var createFilter = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    'Matrix, function': function MatrixFunction(x, test) {\n      return x.create(_filterCallback(x.toArray(), test));\n    },\n    'Array, RegExp': filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return x.create(filterRegExp(x.toArray(), test));\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 */\n\nfunction _filterCallback(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\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 {\n      // 3 or -1\n      return callback(value, [index], array);\n    }\n  });\n}","import { maxArgumentCount } from '../../utils/function.js';\nimport { forEach as forEachArray } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'forEach';\nvar dependencies = ['typed'];\nexport var createForEach = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.forEach(callback);\n    }\n  });\n});\n/**\n * forEach for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @private\n */\n\nfunction _forEach(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n\n  var recurse = function recurse(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 {\n        // 3 or -1\n        callback(value, index, array);\n      }\n    }\n  };\n\n  recurse(array, []);\n}","import { maxArgumentCount } from '../../utils/function.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'map';\nvar dependencies = ['typed'];\nexport var createMap = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\n   * Create a new matrix or array with the results of the callback function executed on\n   * each entry of the matrix/array.\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   * See also:\n   *\n   *    filter, forEach, sort\n   *\n   * @param {Matrix | Array} x    The matrix to iterate on.\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   * @return {Matrix | array}     Transformed map of x\n   */\n  return typed(name, {\n    'Array, function': _map,\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.map(callback);\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 */\n\nfunction _map(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n\n  var recurse = function recurse(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      // invoke the callback function with the right number of arguments\n      if (args === 1) {\n        return callback(value);\n      } else if (args === 2) {\n        return callback(value, index);\n      } else {\n        // 3 or -1\n        return callback(value, index, array);\n      }\n    }\n  };\n\n  return recurse(array, []);\n}","/* eslint-disable no-loss-of-precision */\nimport { deepMap } from '../../utils/collection.js';\nimport { sign } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'erf';\nvar dependencies = ['typed'];\nexport var createErf = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      var y = Math.abs(x);\n\n      if (y >= MAX_NUM) {\n        return sign(x);\n      }\n\n      if (y <= THRESH) {\n        return sign(x) * erf1(y);\n      }\n\n      if (y <= 4.0) {\n        return sign(x) * (1 - erfc2(y));\n      }\n\n      return sign(x) * (1 - erfc3(y));\n    },\n    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, this);\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   * 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\n  function erf1(y) {\n    var ysq = y * y;\n    var xnum = P[0][4] * ysq;\n    var xden = ysq;\n    var 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\n    return y * (xnum + P[0][3]) / (xden + Q[0][3]);\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\n\n  function erfc2(y) {\n    var xnum = P[1][8] * y;\n    var xden = y;\n    var 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\n    var result = (xnum + P[1][7]) / (xden + Q[1][7]);\n    var ysq = parseInt(y * 16) / 16;\n    var del = (y - ysq) * (y + ysq);\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;\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\n\n  function erfc3(y) {\n    var ysq = 1 / (y * y);\n    var xnum = P[2][5] * ysq;\n    var xden = ysq;\n    var 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\n    var result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);\n    result = (SQRPI - result) / y;\n    ysq = parseInt(y * 16) / 16;\n    var del = (y - ysq) * (y + ysq);\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;\n  }\n});\n/**\n * Upper bound for the first approximation interval, 0 <= x <= THRESH\n * @constant\n */\n\nvar THRESH = 0.46875;\n/**\n * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)\n * @constant\n */\n\nvar SQRPI = 5.6418958354775628695e-1;\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 */\n\nvar 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]];\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 */\n\nvar 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]];\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 */\n\nvar MAX_NUM = Math.pow(2, 53);","import { format as formatString } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'format';\nvar dependencies = ['typed'];\nexport var createFormat = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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   *      A number between 0 and 16 to round the digits of the number. In case\n   *      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   * - `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});","import { factory } from '../../utils/factory.js';\nvar name = 'oct';\nvar dependencies = ['typed', 'format'];\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 var createOct = factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'oct'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'oct',\n        wordSize: wordSize\n      });\n    }\n  });\n});","import { format } from '../../utils/string.js';\nimport { isString } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'print';\nvar dependencies = ['typed'];\nexport var createPrint = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 * 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 */\n\nfunction _print(template, values, options) {\n  return template.replace(/\\$([\\w.]+)/g, function (original, key) {\n    var keys = key.split('.');\n    var value = values[keys.shift()];\n\n    while (keys.length && value !== undefined) {\n      var 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}","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isPrime';\nvar dependencies = ['typed'];\nexport var createIsPrime = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      if (x * 0 !== 0) {\n        return false;\n      }\n\n      if (x <= 3) {\n        return x > 1;\n      }\n\n      if (x % 2 === 0 || x % 3 === 0) {\n        return false;\n      }\n\n      for (var i = 5; i * i <= x; i += 6) {\n        if (x % i === 0 || x % (i + 2) === 0) {\n          return false;\n        }\n      }\n\n      return true;\n    },\n    BigNumber: function BigNumber(n) {\n      if (n.toNumber() * 0 !== 0) {\n        return false;\n      }\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\n      for (var i = 5; n.gte(i * i); i += 6) {\n        if (n.mod(i).eq(0) || n.mod(i + 2).eq(0)) {\n          return false;\n        }\n      }\n\n      return true;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'acos';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAcos = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return x.acos();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.acos();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { acosh, asinh, atanh, cosh, sign, sinh, tanh } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function acosNumber(x) {\n  return Math.acos(x);\n}\nacosNumber.signature = n1;\nexport function acoshNumber(x) {\n  return acosh(x);\n}\nacoshNumber.signature = n1;\nexport function acotNumber(x) {\n  return Math.atan(1 / x);\n}\nacotNumber.signature = n1;\nexport function acothNumber(x) {\n  return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;\n}\nacothNumber.signature = n1;\nexport function acscNumber(x) {\n  return Math.asin(1 / x);\n}\nacscNumber.signature = n1;\nexport function acschNumber(x) {\n  var xInv = 1 / x;\n  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));\n}\nacschNumber.signature = n1;\nexport function asecNumber(x) {\n  return Math.acos(1 / x);\n}\nasecNumber.signature = n1;\nexport function asechNumber(x) {\n  var xInv = 1 / x;\n  var ret = Math.sqrt(xInv * xInv - 1);\n  return Math.log(ret + xInv);\n}\nasechNumber.signature = n1;\nexport function asinNumber(x) {\n  return Math.asin(x);\n}\nasinNumber.signature = n1;\nexport function asinhNumber(x) {\n  return asinh(x);\n}\nasinhNumber.signature = n1;\nexport function atanNumber(x) {\n  return Math.atan(x);\n}\natanNumber.signature = n1;\nexport function atan2Number(y, x) {\n  return Math.atan2(y, x);\n}\natan2Number.signature = n2;\nexport function atanhNumber(x) {\n  return atanh(x);\n}\natanhNumber.signature = n1;\nexport function cosNumber(x) {\n  return Math.cos(x);\n}\ncosNumber.signature = n1;\nexport function coshNumber(x) {\n  return cosh(x);\n}\ncoshNumber.signature = n1;\nexport function cotNumber(x) {\n  return 1 / Math.tan(x);\n}\ncotNumber.signature = n1;\nexport function cothNumber(x) {\n  var e = Math.exp(2 * x);\n  return (e + 1) / (e - 1);\n}\ncothNumber.signature = n1;\nexport function cscNumber(x) {\n  return 1 / Math.sin(x);\n}\ncscNumber.signature = n1;\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;\nexport function secNumber(x) {\n  return 1 / Math.cos(x);\n}\nsecNumber.signature = n1;\nexport function sechNumber(x) {\n  return 2 / (Math.exp(x) + Math.exp(-x));\n}\nsechNumber.signature = n1;\nexport function sinNumber(x) {\n  return Math.sin(x);\n}\nsinNumber.signature = n1;\nexport function sinhNumber(x) {\n  return sinh(x);\n}\nsinhNumber.signature = n1;\nexport function tanNumber(x) {\n  return Math.tan(x);\n}\ntanNumber.signature = n1;\nexport function tanhNumber(x) {\n  return tanh(x);\n}\ntanhNumber.signature = n1;","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acotNumber } from '../../plain/number/index.js';\nvar name = 'acot';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createAcot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.acot();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).atan();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acscNumber } from '../../plain/number/index.js';\nvar name = 'acsc';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAcsc = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return acscNumber(x);\n      }\n\n      return new Complex(x, 0).acsc();\n    },\n    Complex: function Complex(x) {\n      return x.acsc();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).asin();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { asecNumber } from '../../plain/number/index.js';\nvar name = 'asec';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAsec = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return asecNumber(x);\n      }\n\n      return new Complex(x, 0).asec();\n    },\n    Complex: function Complex(x) {\n      return x.asec();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).acos();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'asin';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAsin = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return x.asin();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.asin();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since asin(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'atan';\nvar dependencies = ['typed'];\nexport var createAtan = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return Math.atan(x);\n    },\n    Complex: function Complex(x) {\n      return x.atan();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.atan();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since atan(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { atanhNumber } from '../../plain/number/index.js';\nvar name = 'atanh';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAtanh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        return atanhNumber(x);\n      }\n\n      return new Complex(x, 0).atanh();\n    },\n    Complex: function Complex(x) {\n      return x.atanh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.atanh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since atanh(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cosh as coshNumber } from '../../utils/number.js';\nvar name = 'cosh';\nvar dependencies = ['typed'];\nexport var createCosh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.cosh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.cosh();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cosh is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cothNumber } from '../../plain/number/index.js';\nvar name = 'coth';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCoth = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.coth();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.tanh());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function coth is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cschNumber } from '../../plain/number/index.js';\nvar name = 'csch';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCsch = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.csch();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.sinh());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csch is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { sechNumber } from '../../plain/number/index.js';\nvar name = 'sech';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createSech = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sech();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.cosh());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sech is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { sinhNumber } from '../../plain/number/index.js';\nvar name = 'sinh';\nvar dependencies = ['typed'];\nexport var createSinh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sinh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.sinh();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sinh is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sinh(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { tanh as _tanh } from '../../utils/number.js';\nvar name = 'tanh';\nvar dependencies = ['typed'];\nexport var createTanh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.tanh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.tanh();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tanh is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since tanh(0) = 0\n      return deepMap(x, this, true);\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  var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer\n\n  return product(i, half) * product(half + 1, n);\n}","import { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function combinationsNumber(n, k) {\n  if (!isInteger(n) || n < 0) {\n    throw new TypeError('Positive integer value expected in function combinations');\n  }\n\n  if (!isInteger(k) || k < 0) {\n    throw new TypeError('Positive integer value expected in function combinations');\n  }\n\n  if (k > n) {\n    throw new TypeError('k must be less than or equal to n');\n  }\n\n  var nMinusk = n - k;\n  var prodrange;\n\n  if (k < nMinusk) {\n    prodrange = product(nMinusk + 1, n);\n    return prodrange / product(1, k);\n  }\n\n  prodrange = product(k + 1, n);\n  return prodrange / product(1, nMinusk);\n}\ncombinationsNumber.signature = 'number, number';","import { factory } from '../../utils/factory.js';\nimport { combinationsNumber } from '../../plain/number/combinations.js';\nvar name = 'combinations';\nvar dependencies = ['typed'];\nexport var createCombinations = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var BigNumber = n.constructor;\n      var result, i;\n      var nMinusk = n.minus(k);\n      var one = new BigNumber(1);\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinations');\n      }\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\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    } // 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 */\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}","import seedrandom from 'seedrandom';\nvar singletonRandom = /* #__PURE__ */seedrandom(Date.now());\nexport function createRng(randomSeed) {\n  var random; // create a new random generator with given seed\n\n  function setSeed(seed) {\n    random = seed === null ? singletonRandom : seedrandom(String(seed));\n  } // initialize a seeded pseudo random number generator with config's random seed\n\n\n  setSeed(randomSeed); // wrapper function so the rng can be updated via generator\n\n  function rng() {\n    return random();\n  }\n\n  return rng;\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';\nvar name = 'pickRandom';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createPickRandom = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var 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   * 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\n\n  return typed({\n    'Array | Matrix': function ArrayMatrix(possibles) {\n      return _pickRandom(possibles, {});\n    },\n    'Array | Matrix, Object': function ArrayMatrixObject(possibles, options) {\n      return _pickRandom(possibles, options);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(possibles, number) {\n      return _pickRandom(possibles, {\n        number\n      });\n    },\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(possibles, weights) {\n      return _pickRandom(possibles, {\n        weights\n      });\n    },\n    'Array | Matrix, Array | Matrix, number': function ArrayMatrixArrayMatrixNumber(possibles, weights, number) {\n      return _pickRandom(possibles, {\n        number,\n        weights\n      });\n    },\n    'Array | Matrix, number, Array | Matrix': function ArrayMatrixNumberArrayMatrix(possibles, number, weights) {\n      return _pickRandom(possibles, {\n        number,\n        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\n  function _pickRandom(possibles, _ref2) {\n    var {\n      number,\n      weights,\n      elementWise = true\n    } = _ref2;\n    var single = typeof number === 'undefined';\n\n    if (single) {\n      number = 1;\n    }\n\n    var createMatrix = isMatrix(possibles) ? possibles.create : isMatrix(weights) ? weights.create : null;\n    possibles = possibles.valueOf(); // get Array\n\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    var 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 (var 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    var length = possibles.length;\n    var result = [];\n    var pick;\n\n    while (result.length < number) {\n      if (typeof weights === 'undefined') {\n        pick = possibles[Math.floor(rng() * length)];\n      } else {\n        var randKey = rng() * totalWeights;\n\n        for (var _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 ? result[0] : createMatrix ? createMatrix(result) : result;\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  var data = [];\n  size = size.slice(0);\n\n  if (size.length > 1) {\n    for (var i = 0, length = size.shift(); i < length; i++) {\n      data.push(randomMatrix(size, random));\n    }\n  } else {\n    for (var _i = 0, _length = size.shift(); _i < _length; _i++) {\n      data.push(random());\n    }\n  }\n\n  return data;\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';\nvar name = 'randomInt';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createRandomInt = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var 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 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\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    var 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});","import { clone as objectClone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'clone';\nvar dependencies = ['typed'];\nexport var createClone = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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});","import { factory } from '../../utils/factory.js';\nvar name = 'hasNumericValue';\nvar dependencies = ['typed', 'isNumeric'];\nexport var createHasNumericValue = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isNumeric\n  } = _ref;\n\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 string(x) {\n      return x.trim().length > 0 && !isNaN(Number(x));\n    },\n    any: function any(x) {\n      return isNumeric(x);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { typeOf as _typeOf } from '../../utils/is.js';\nvar name = 'typeOf';\nvar dependencies = ['typed'];\nexport var createTypeOf = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nimport { format } from '../utils/number.js';\nvar name = 'string';\nvar dependencies = ['typed'];\nexport var createString = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    number: format,\n    null: function _null(x) {\n      return 'null';\n    },\n    boolean: function boolean(x) {\n      return x + '';\n    },\n    string: function string(x) {\n      return x;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    },\n    any: function any(x) {\n      return String(x);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'fraction';\nvar dependencies = ['typed', 'Fraction'];\nexport var createFraction = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Fraction\n  } = _ref;\n\n  /**\n   * Create a fraction convert a value to a fraction.\n   *\n   * Syntax:\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)         Turn all matrix entries\n   *                                                   into fractions\n   *\n   * Examples:\n   *\n   *     math.fraction(1, 3)\n   *     math.fraction('2/3')\n   *     math.fraction({n: 2, d: 3})\n   *     math.fraction([0.2, 0.25, 1.25])\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]\n   *            Arguments specifying the numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  return typed('fraction', {\n    number: function number(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    string: function string(x) {\n      return new Fraction(x);\n    },\n    'number, number': function numberNumber(numerator, denominator) {\n      return new Fraction(numerator, denominator);\n    },\n    null: function _null(x) {\n      return new Fraction(0);\n    },\n    BigNumber: function BigNumber(x) {\n      return new Fraction(x.toString());\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    Object: function Object(x) {\n      return new Fraction(x);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryMinusNumber } from '../../plain/number/index.js';\nvar name = 'unaryMinus';\nvar dependencies = ['typed'];\nexport var createUnaryMinus = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.neg();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.neg();\n    },\n    Fraction: function Fraction(x) {\n      return x.neg();\n    },\n    Unit: function Unit(x) {\n      var res = x.clone();\n      res.value = this(x.value);\n      return res;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since unaryMinus(0) = 0\n      return deepMap(x, this, true);\n    } // TODO: add support for string\n\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { addNumber } from '../../plain/number/index.js';\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nexport var createAddScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\n   * Add two scalar values, `x + y`.\n   * This function is meant for internal use: it is used by the public function\n   * `add`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Sum of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': addNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.add(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.plus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.add(y);\n    },\n    'Unit, Unit': function UnitUnit(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      var res = x.clone();\n      res.value = this(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { expNumber } from '../../plain/number/index.js';\nvar name = 'exp';\nvar dependencies = ['typed'];\nexport var createExp = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.exp();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.exp();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // TODO: exp(sparse) should return a dense matrix since exp(0)==1\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { log2Number } from '../../plain/number/index.js';\nvar name = 'log2';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createLog2 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(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    Complex: _log2Complex,\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n  /**\n   * Calculate log2 for a complex value\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n\n  function _log2Complex(x) {\n    var newX = Math.sqrt(x.re * x.re + x.im * x.im);\n    return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'sqrt';\nvar dependencies = ['config', 'typed', 'Complex'];\nexport var createSqrt = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    Complex\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sqrt();\n    },\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sqrt(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      // Someday will work for complex units when they are implemented\n      return x.pow(0.5);\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\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});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'conj';\nvar dependencies = ['typed'];\nexport var createConj = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\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 number(x) {\n      return x;\n    },\n    BigNumber: function BigNumber(x) {\n      return x;\n    },\n    Complex: function Complex(x) {\n      return x.conjugate();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { getArrayDataType } from '../../utils/array.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'getMatrixDataType';\nvar dependencies = ['typed'];\nexport var createGetMatrixDataType = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 Array(x) {\n      return getArrayDataType(x, typeOf);\n    },\n    Matrix: function Matrix(x) {\n      return x.getDataType();\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'mode';\nvar dependencies = ['typed', 'isNaN', 'isNumeric'];\nexport var createMode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isNaN,\n    isNumeric\n  } = _ref;\n\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    '...': function _(args) {\n      return _mode(args);\n    }\n  });\n  /**\n   * Calculates the mode in an 1-dimensional array\n   * @param {Array} values\n   * @return {Array} mode\n   * @private\n   */\n\n  function _mode(values) {\n    values = flatten(values.valueOf());\n    var num = values.length;\n\n    if (num === 0) {\n      throw new Error('Cannot calculate mode of an empty array');\n    }\n\n    var count = {};\n    var mode = [];\n    var max = 0;\n\n    for (var i = 0; i < values.length; i++) {\n      var 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\n    return mode;\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'bin';\nvar dependencies = ['typed', 'format'];\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 */\n\nexport var createBin = factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'bin'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'bin',\n        wordSize: wordSize\n      });\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acoshNumber } from '../../plain/number/index.js';\nvar name = 'acosh';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAcosh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(x) {\n      if (x >= 1 || config.predictable) {\n        return acoshNumber(x);\n      }\n\n      if (x <= -1) {\n        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);\n      }\n\n      return new Complex(x, 0).acosh();\n    },\n    Complex: function Complex(x) {\n      return x.acosh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.acosh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acschNumber } from '../../plain/number/index.js';\nvar name = 'acsch';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createAcsch = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.acsch();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).asinh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { asinhNumber } from '../../plain/number/index.js';\nvar name = 'asinh';\nvar dependencies = ['typed'];\nexport var createAsinh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.asinh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.asinh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since asinh(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'cos';\nvar dependencies = ['typed'];\nexport var createCos = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.cos();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.cos();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cos is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cscNumber } from '../../plain/number/index.js';\nvar name = 'csc';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCsc = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.csc();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.sin());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csc is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'sin';\nvar dependencies = ['typed'];\nexport var createSin = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sin();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.sin();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sin is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sin(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nvar name = 'combinationsWithRep';\nvar dependencies = ['typed'];\nexport var createCombinationsWithRep = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 numberNumber(n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\n\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\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        var _prodrange = product(n, n + k - 1);\n\n        return _prodrange / product(1, k);\n      }\n\n      var prodrange = product(k + 1, n + k - 1);\n      return prodrange / product(1, n - 1);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var BigNumber = n.constructor;\n      var result, i;\n      var one = new BigNumber(1);\n      var nMinusOne = n.minus(one);\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\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\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 * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\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';\nvar name = 'random';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createRandom = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var 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 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\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    var 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}); // 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?\n\nexport var createRandomNumber = /* #__PURE__ */factory(name, ['typed', 'config', '?on'], (_ref2) => {\n  var {\n    typed,\n    config,\n    on,\n    matrix\n  } = _ref2;\n  // seeded pseudo random number generator1\n  var 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});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNegativeNumber } from '../../plain/number/index.js';\nvar name = 'isNegative';\nvar dependencies = ['typed'];\nexport var createIsNegative = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return x.isNeg() && !x.isZero() && !x.isNaN();\n    },\n    Fraction: function Fraction(x) {\n      return x.s < 0; // It's enough to decide on the sign\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nexport var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar,\n    Matrix\n  } = _ref;\n\n  /**\n   * Sparse Matrix implementation. This type implements a Compressed Column Storage format\n   * for sparse matrices.\n   * @class SparseMatrix\n   */\n  function SparseMatrix(data, datatype) {\n    if (!(this instanceof SparseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\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; // discover rows & columns, do not use math.size() to avoid looping array twice\n\n    var rows = data.length;\n    var columns = 0; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, datatype);\n    } // check we have rows (empty array)\n\n\n    if (rows > 0) {\n      // column index\n      var j = 0;\n\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length); // loop rows\n\n\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i]; // check row is an array\n\n          if (isArray(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) {\n              columns = row.length;\n            } // check row has column\n\n\n            if (j < row.length) {\n              // value\n              var v = row[j]; // check value != 0\n\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v); // index\n\n\n                matrix._index.push(i);\n              }\n            }\n          } else {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < 1) {\n              columns = 1;\n            } // check value != 0 (row is a scalar)\n\n\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row); // index\n\n\n              matrix._index.push(i);\n            }\n          }\n        } // increment index\n\n\n        j++;\n      } while (j < columns);\n    } // store number of values in ptr\n\n\n    matrix._ptr.push(matrix._index.length); // size\n\n\n    matrix._size = [rows, columns];\n  }\n\n  SparseMatrix.prototype = new Matrix();\n  /**\n   * Create a new SparseMatrix\n   */\n\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n  /**\n   * Attach type information\n   */\n\n\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\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\n  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values, typeOf);\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\n\n  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\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\n\n  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n\n\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\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\n\n  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1]; // calculate density\n\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\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\n\n  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke subset on a Pattern only matrix');\n    } // check arguments\n\n\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n      // intentional fall through\n\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    var isScalar = idx.isScalar();\n\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    } // validate dimensions\n\n\n    var size = idx.size();\n\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length);\n    } // vars\n\n\n    var i, ii, k, kk; // validate if any of the ranges in the index is out of range\n\n    var min = idx.min();\n    var max = idx.max();\n\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    } // matrix arrays\n\n\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr; // rows & columns dimensions for result matrix\n\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1); // workspace & permutation vector\n\n    var w = [];\n    var pv = []; // loop rows in resulting matrix\n\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0]; // mark i in workspace\n\n      w[i] = true;\n    }); // result matrix arrays\n\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = []; // loop columns in result matrix\n\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length); // loop values in column j\n\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k]; // check row is in result matrix\n\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]); // check we need to process values\n\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    }); // update ptr\n\n    ptr.push(index.length); // return matrix\n\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    } // get index size and check whether the index contains a single value\n\n\n    var iSize = index.size();\n    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n    var sSize;\n\n    if (isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size(); // use array representation\n\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = arraySize(submatrix);\n    } // check index is a scalar\n\n\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      } // set value\n\n\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      } // check submatrix and index have the same dimensions\n\n\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        } // unsqueeze both outer and inner dimensions\n\n\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      } // check whether the size of the submatrix matches the index size\n\n\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      } // offsets\n\n\n      var x0 = index.min()[0];\n      var y0 = index.min()[1]; // submatrix rows and columns\n\n      var m = sSize[0];\n      var n = sSize[1]; // loop submatrix\n\n      for (var x = 0; x < m; x++) {\n        // loop columns\n        for (var y = 0; y < n; y++) {\n          // value at i, j\n          var v = submatrix[x][y]; // invoke set (zero value will remove entry from matrix)\n\n          matrix.set([x + x0, y + y0], v, defaultValue);\n        }\n      }\n    }\n\n    return matrix;\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\n\n  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check it is a pattern matrix\n\n\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    } // row and column\n\n\n    var i = index[0];\n    var j = index[1]; // check i, j are valid\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[1]); // find value index\n\n    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\n\n\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n\n    return 0;\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\n\n  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check it is a pattern matrix\n\n\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    } // row and column\n\n\n    var i = index[0];\n    var j = index[1]; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var 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; // convert 0 to the same datatype\n\n      zero = typed.convert(0, this._datatype);\n    } // check we need to resize matrix\n\n\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); // update rows & columns\n\n\n      rows = this._size[0];\n      columns = this._size[1];\n    } // check i, j are valid\n\n\n    validateIndex(i, rows);\n    validateIndex(j, columns); // find value index\n\n    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\n\n\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) {\n      return bottom;\n    } // loop rows [top, bottom[\n\n\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    } // we did not find row\n\n\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); // update pointers\n\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v); // update row for k\n\n    index.splice(k, 0, i); // update column pointers\n\n    for (var x = j + 1; x < ptr.length; x++) {\n      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   * @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\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    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n\n\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n\n    if (sizeArray.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // check sizes\n\n\n    sizeArray.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');\n      }\n    }); // matrix to resize\n\n    var m = copy ? this.clone() : this; // resize matrix\n\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    var value = defaultValue || 0; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var 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; // convert 0 to the same datatype\n\n      zero = typed.convert(0, matrix._datatype); // convert value to the same datatype\n\n      value = typed.convert(value, matrix._datatype);\n    } // should we insert the value?\n\n\n    var ins = !eq(value, zero); // old columns and rows\n\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k; // check we need to increase columns\n\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; // check we need to insert matrix._values\n\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value); // update matrix._index\n\n\n            matrix._index.push(i);\n          }\n        }\n      } // store number of matrix._values in matrix._ptr\n\n\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns); // truncate matrix._values and matrix._index\n\n\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    } // update columns\n\n\n    c = columns; // check we need to increase rows\n\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0; // loop columns\n\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n; // where to insert matrix._values\n\n          k = matrix._ptr[j + 1] + n; // pointer\n\n          var p = 0; // loop new rows, initialize pointer\n\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value); // update matrix._index\n\n\n            matrix._index.splice(k + p, 0, i); // increment inserts\n\n\n            n++;\n          }\n        } // store number of matrix._values in matrix._ptr\n\n\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0; // loop columns\n\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d; // where matrix._values start for next column\n\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d; // loop matrix._index\n\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k]; // check we need to delete value and matrix._index\n\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1); // remove item from matrix._index\n\n\n            matrix._index.splice(k, 1); // increase deletes\n\n\n            d++;\n          }\n        }\n      } // update matrix._ptr for current column\n\n\n      matrix._ptr[j] = matrix._values.length;\n    } // update matrix._size\n\n\n    matrix._size[0] = rows;\n    matrix._size[1] = columns; // return matrix\n\n    return matrix;\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   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n\n\n  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!isArray(sizes)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (sizes.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    } // check sizes\n\n\n    sizes.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');\n      }\n    });\n    var currentLength = this._size[0] * this._size[1];\n    sizes = processSizesWildcard(sizes, currentLength);\n    var newLength = sizes[0] * sizes[1]; // m * n must not change\n\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    } // matrix to reshape\n\n\n    var m = copy ? this.clone() : this; // return unchanged if the same shape\n\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m;\n    } // Convert to COO format (generate a column index)\n\n\n    var colIndex = [];\n\n    for (var i = 0; i < m._ptr.length; i++) {\n      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i);\n      }\n    } // Clone the values array\n\n\n    var values = m._values.slice(); // Clone the row index array\n\n\n    var rowIndex = m._index.slice(); // Transform the (row, column) indices\n\n\n    for (var _i = 0; _i < m._index.length; _i++) {\n      var r1 = rowIndex[_i];\n      var c1 = colIndex[_i];\n      var flat = r1 * m._size[1] + c1;\n      colIndex[_i] = flat % sizes[1];\n      rowIndex[_i] = Math.floor(flat / sizes[1]);\n    } // 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    // OR, we could easily just:\n    // 1. Remove all values from the matrix\n\n\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = sizes[1] + 1;\n    m._size = sizes.slice();\n\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\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\n\n    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    } // The value indices are inserted out of order, but apparently that's... still OK?\n\n\n    return m;\n  };\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n\n\n  SparseMatrix.prototype.clone = function () {\n    var m = new SparseMatrix({\n      values: this._values ? clone(this._values) : undefined,\n      index: clone(this._index),\n      ptr: clone(this._ptr),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n\n\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\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\n\n  SparseMatrix.prototype.map = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke map on a Pattern only matrix');\n    } // matrix instance\n\n\n    var me = this; // rows and columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // invoke callback\n\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      return callback(v, [i, j], me);\n    }; // invoke _map\n\n\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\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\n\n  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = []; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var 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; // convert 0 to the same datatype\n\n      zero = typed.convert(0, matrix._datatype);\n    } // invoke callback\n\n\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      v = callback(v, x, y); // check value != 0\n\n      if (!eq(v, zero)) {\n        // store value\n        values.push(v); // index\n\n        index.push(x);\n      }\n    }; // loop columns\n\n\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = matrix._index[k]; // check i is in range\n\n          if (i >= minRow && i <= maxRow) {\n            // value @ k\n            invoke(matrix._values[k], i - minRow, j - minColumn);\n          }\n        }\n      } else {\n        // create a cache holding all defined values\n        var _values = {};\n\n        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        } // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n\n\n        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {\n          var value = _i5 in _values ? _values[_i5] : 0;\n          invoke(value, _i5 - minRow, j - minColumn);\n        }\n      }\n    } // store number of values in ptr\n\n\n    ptr.push(values.length); // return sparse matrix\n\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   * 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   */\n\n\n  SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke forEach on a Pattern only matrix');\n    } // matrix instance\n\n\n    var me = this; // rows and columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = this._index[k]; // value @ k\n\n          callback(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        } // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n\n\n        for (var _i7 = 0; _i7 < rows; _i7++) {\n          var value = _i7 in values ? values[_i7] : 0;\n          callback(value, [_i7, j], me);\n        }\n      }\n    }\n  };\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n\n\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n\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    var rows = size[0];\n    var columns = size[1]; // result\n\n    var a = []; // vars\n\n    var i, j; // initialize array\n\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    } // loop columns\n\n\n    for (j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // loop k within [k0, k1[\n\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k]; // set value (use one for pattern matrix)\n\n        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;\n      }\n    }\n\n    return a;\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\n\n  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1]; // density\n\n    var density = this.density(); // rows & columns\n\n    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n'; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1]; // loop k within [k0, k1[\n\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k]; // append value\n\n        str += '\\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');\n      }\n    }\n\n    return str;\n  };\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n\n\n  SparseMatrix.prototype.toString = function () {\n    return format(this.toArray());\n  };\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\n   */\n\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   * 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\n\n  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // number diagonal values\n\n    var n = Math.min(rows - kSub, columns - kSuper); // diagonal arrays\n\n    var values = [];\n    var index = [];\n    var ptr = []; // initial ptr value\n\n    ptr[0] = 0; // loop columns\n\n    for (var j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1]; // loop x within [k0, k1[\n\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x]; // check row\n\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]); // store row\n\n          index[values.length - 1] = i - kSub; // exit loop\n\n          break;\n        }\n      }\n    } // close ptr\n\n\n    ptr.push(values.length); // return matrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [n, 1]\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\n\n  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\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\n\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // map size & validate\n\n\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      } // validate arguments\n\n\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n\n      return s;\n    }); // validate k if any\n\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    } // equal signature to use\n\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, datatype);\n    }\n\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows and columns\n\n    var rows = size[0];\n    var columns = size[1]; // number of non-zero items\n\n    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n    var _value; // check value\n\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size(); // validate matrix\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    } // create arrays\n\n\n    var values = [];\n    var index = [];\n    var ptr = []; // loop items\n\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length); // diagonal index\n\n      var i = j - kSuper; // check we need to set diagonal value\n\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i); // check for zero\n\n\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub); // add value\n\n          values.push(v);\n        }\n      }\n    } // last value should be number of values\n\n\n    ptr.push(values.length); // create SparseMatrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [rows, columns]\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\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    } // check dimensions\n\n\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    } // validate index\n\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]); // swap rows\n\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); // return current instance\n\n\n    return this;\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\n\n  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1]; // loop\n\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\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\n\n  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // find value index @ x\n\n      var kx = _getValueIndex(x, k0, k1, index); // find value index @ x\n\n\n      var ky = _getValueIndex(y, k0, k1, index); // check both rows exist in matrix\n\n\n      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n        // swap values (check for pattern matrix)\n        if (values) {\n          var v = values[kx];\n          values[kx] = values[ky];\n          values[ky] = v;\n        } // next column\n\n\n        continue;\n      } // check x row exist & no y row\n\n\n      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n        // value @ x (check for pattern matrix)\n        var vx = values ? values[kx] : undefined; // insert value @ y\n\n        index.splice(ky, 0, y);\n\n        if (values) {\n          values.splice(ky, 0, vx);\n        } // remove value @ x (adjust array index if needed)\n\n\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        } // next column\n\n\n        continue;\n      } // check y row exist & no x row\n\n\n      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n        // value @ y (check for pattern matrix)\n        var vy = values ? values[ky] : undefined; // insert value @ x\n\n        index.splice(kx, 0, x);\n\n        if (values) {\n          values.splice(kx, 0, vy);\n        } // remove value @ y (adjust array index if needed)\n\n\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  };\n\n  return SparseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createMatrix = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n\n  /**\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\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function _() {\n      return _create([]);\n    },\n    string: function string(format) {\n      return _create([], format);\n    },\n    'string, string': function stringString(format, datatype) {\n      return _create([], format, datatype);\n    },\n    Array: function Array(data) {\n      return _create(data);\n    },\n    Matrix: function Matrix(data) {\n      return _create(data, data.storage());\n    },\n    'Array | Matrix, string': _create,\n    'Array | Matrix, string, string': _create\n  });\n  /**\n   * 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\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});","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';\nvar name = 'cbrt';\nvar dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];\nexport var createCbrt = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    isNegative,\n    unaryMinus,\n    matrix,\n    Complex,\n    BigNumber,\n    Fraction\n  } = _ref;\n\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    Complex: _cbrtComplex,\n    'Complex, boolean': _cbrtComplex,\n    BigNumber: function BigNumber(x) {\n      return x.cbrt();\n    },\n    Unit: _cbrtUnit,\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since cbrt(0) = 0\n      return deepMap(x, this, true);\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\n  function _cbrtComplex(x, allRoots) {\n    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers\n    var arg3 = x.arg() / 3;\n    var abs = x.abs(); // principal root:\n\n    var principal = new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp());\n\n    if (allRoots) {\n      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())];\n      return config.matrix === 'Array' ? all : matrix(all);\n    } else {\n      return principal;\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\n\n  function _cbrtUnit(x) {\n    if (x.value && isComplex(x.value)) {\n      var result = x.clone();\n      result.value = 1.0;\n      result = result.pow(1.0 / 3); // Compute the units\n\n      result.value = _cbrtComplex(x.value); // Compute the value\n\n      return result;\n    } else {\n      var negate = isNegative(x.value);\n\n      if (negate) {\n        x.value = unaryMinus(x.value);\n      } // TODO: create a helper function for this\n\n\n      var third;\n\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      var _result = x.pow(third);\n\n      if (negate) {\n        _result.value = unaryMinus(_result.value);\n      }\n\n      return _result;\n    }\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm01';\nvar dependencies = ['typed'];\nexport var createAlgorithm01 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // process data types\n\n    var dt = typeof adt === 'string' && adt === bdt ? adt : undefined; // callback function\n\n    var cf = dt ? typed.find(callback, [dt, dt]) : callback; // vars\n\n    var i, j; // result (DenseMatrix)\n\n    var cdata = []; // initialize c\n\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    } // workspace\n\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns in b\n\n    for (j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // update workspace\n\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // mark i as updated\n\n        w[i] = mark;\n      } // loop rows\n\n\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    } // return dense matrix\n\n\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm04';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm04 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspace\n\n    var xa = avalues && bvalues ? [] : undefined;\n    var xb = avalues && bvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // vars\n\n    var i, j, k, k0, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop A(:,j)\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // update c\n\n        cindex.push(i); // update workspace\n\n        wa[i] = mark; // check we need to process values\n\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      } // loop B(:,j)\n\n\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // check row exists in A\n\n        if (wa[i] === mark) {\n          // update record in xa @ i\n          if (xa) {\n            // invoke callback\n            var v = cf(xa[i], bvalues[k]); // check for zero\n\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); // update workspace\n\n          wb[i] = mark; // check we need to process values\n\n          if (xb) {\n            xb[i] = bvalues[k];\n          }\n        }\n      } // check we need to process values (non pattern matrix)\n\n\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]; // check workspace has value @ i\n\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i]; // increment pointer\n\n            k++;\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i]; // increment pointer\n\n            k++;\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1);\n          }\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm10';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm10 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n\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    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cdata = []; // workspaces\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k]; // update workspace\n\n        x[r] = avalues[k];\n        w[r] = mark;\n      } // loop rows\n\n\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        } // check sparse matrix has a value @ i,j\n\n\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    } // return dense matrix\n\n\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm13';\nvar dependencies = ['typed'];\nexport var createAlgorithm13 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b arrays\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // c arrays\n\n    var csize = []; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // validate each one of the dimension sizes\n\n\n    for (var s = 0; s < asize.length; s++) {\n      // must match\n      if (asize[s] !== bsize[s]) {\n        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n      } // update dimension in c\n\n\n      csize[s] = asize[s];\n    } // datatype\n\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // populate cdata, iterate through dimensions\n\n\n    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []; // c matrix\n\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    });\n  }; // recursive function\n\n  function _iterate(f, level, s, n, av, bv) {\n    // initialize array for this level\n    var cv = []; // check we reach the last level\n\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = f(av[i], bv[i]);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);\n      }\n    }\n\n    return cv;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'algorithm14';\nvar dependencies = ['typed'];\nexport var createAlgorithm14 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // populate cdata, iterate through dimensions\n\n\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []; // c matrix\n\n    return a.createDenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    });\n  }; // recursive function\n\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = []; // check we reach the last level\n\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);\n      }\n    }\n\n    return cv;\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';\nvar name = 'gcd';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];\nexport var createGcd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm04 = createAlgorithm04({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': gcdNumber,\n    'BigNumber, BigNumber': _gcdBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.gcd(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm10(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    },\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {\n      var res = this(a, b);\n\n      for (var i = 0; i < args.length; i++) {\n        res = this(res, args[i]);\n      }\n\n      return res;\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\n  function _gcdBigNumber(a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function gcd must be integer numbers');\n    } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n    var zero = new BigNumber(0);\n\n    while (!b.isZero()) {\n      var r = a.mod(b);\n      a = b;\n      b = r;\n    }\n\n    return a.lt(zero) ? a.neg() : a;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm02';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm02 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result (SparseMatrix)\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // loop columns in b\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k]; // update C(i,j)\n\n        var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // check for nonzero\n\n        if (!eq(cij, zero)) {\n          // push i & v\n          cindex.push(i);\n          cvalues.push(cij);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return sparseMatrix.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm03';\nvar dependencies = ['typed'];\nexport var createAlgorithm03 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result (DenseMatrix)\n\n\n    var cdata = []; // initialize dense matrix\n\n    for (var z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = [];\n    } // workspace\n\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns in b\n\n    for (var j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k]; // update workspace\n\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        w[i] = mark;\n      } // process workspace\n\n\n      for (var 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    } // return dense matrix\n\n\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm05';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm05 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspaces\n\n    var xa = cvalues ? [] : undefined;\n    var xb = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // vars\n\n    var i, j, k, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop values A(:,j)\n\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k]; // push index\n\n        cindex.push(i); // update workspace\n\n        wa[i] = mark; // check we need to process values\n\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      } // loop values B(:,j)\n\n\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k]; // check row existed in A\n\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i);\n        } // update workspace\n\n\n        wb[i] = mark; // check we need to process values\n\n        if (xb) {\n          xb[i] = bvalues[k];\n        }\n      } // check we need to process values (non pattern matrix)\n\n\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]; // marks\n\n          var wai = wa[i];\n          var wbi = wb[i]; // check Aij or Bij are nonzero\n\n          if (wai === mark || wbi === mark) {\n            // matrix values @ i,j\n            var va = wai === mark ? xa[i] : zero;\n            var vb = wbi === mark ? xb[i] : zero; // Cij\n\n            var vc = cf(va, vb); // check for zero\n\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc); // increment pointer\n\n              k++;\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1);\n            }\n          }\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm11';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm11 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k]; // invoke callback\n\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b); // check value is zero\n\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    } // update ptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return s.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm12';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm12 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n\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    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cdata = []; // workspaces\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k]; // update workspace\n\n        x[r] = avalues[k];\n        w[r] = mark;\n      } // loop rows\n\n\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        } // check sparse matrix has a value @ i,j\n\n\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    } // return dense matrix\n\n\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\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';\nvar name = 'mod';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createMod = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': modNumber,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      if (y.isNeg()) {\n        throw new Error('Cannot calculate mod for a negative divisor');\n      }\n\n      return y.isZero() ? x : x.mod(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      if (y.compare(0) < 0) {\n        throw new Error('Cannot calculate mod for a negative divisor');\n      } // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend\n\n\n      return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nimport { scatter } from '../../../utils/collection.js';\nvar name = 'algorithm06';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm06 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspaces\n\n    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var w = []; // marks indicating value in a given row has been updated\n\n    var u = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // scatter the values of A(:,j) into workspace\n\n      scatter(a, j, w, x, u, mark, cindex, cf); // scatter the values of B(:,j) into workspace\n\n      scatter(b, j, w, x, u, mark, cindex, cf); // check we need to process values (non pattern matrix)\n\n      if (x) {\n        // initialize first index in j\n        var k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          var i = cindex[k]; // check function was invoked on current row (Aij !=0 && Bij != 0)\n\n          if (u[i] === mark) {\n            // value @ i\n            var v = x[i]; // check for zero value\n\n            if (!eq(v, zero)) {\n              // push value\n              cvalues.push(v); // increment pointer\n\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        var p = cptr[j]; // loop index in j\n\n        while (p < cindex.length) {\n          // row\n          var r = cindex[p]; // check function was invoked on current row (Aij !=0 && Bij != 0)\n\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    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { 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';\nvar name = 'nthRoot';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber'];\nexport var createNthRoot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber: _BigNumber\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  var complexErr = '' + 'Complex number not supported in function nthRoot. ' + 'Use nthRoots instead.';\n  return typed(name, {\n    number: function number(x) {\n      return nthRootNumber(x, 2);\n    },\n    'number, number': nthRootNumber,\n    BigNumber: function BigNumber(x) {\n      return _bigNthRoot(x, new _BigNumber(2));\n    },\n    Complex: function Complex(x) {\n      throw new Error(complexErr);\n    },\n    'Complex, number': function ComplexNumber(x, y) {\n      throw new Error(complexErr);\n    },\n    'BigNumber, BigNumber': _bigNthRoot,\n    'Array | Matrix': function ArrayMatrix(x) {\n      return this(x, 2);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(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    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(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    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(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    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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\n  function _bigNthRoot(a, root) {\n    var precision = _BigNumber.precision;\n\n    var Big = _BigNumber.clone({\n      precision: precision + 2\n    });\n\n    var zero = new _BigNumber(0);\n    var one = new Big(1);\n    var inv = root.isNegative();\n\n    if (inv) {\n      root = root.neg();\n    }\n\n    if (root.isZero()) {\n      throw new Error('Root must be non-zero');\n    }\n\n    if (a.isNegative() && !root.abs().mod(2).equals(1)) {\n      throw new Error('Root must be odd when a is negative.');\n    } // edge cases zero and infinity\n\n\n    if (a.isZero()) {\n      return inv ? new Big(Infinity) : 0;\n    }\n\n    if (!a.isFinite()) {\n      return inv ? zero : a;\n    }\n\n    var x = a.abs().pow(one.div(root)); // If a < 0, we require that root is an odd integer,\n    // so (-1) ^ (1/root) = -1\n\n    x = a.isNeg() ? x.neg() : x;\n    return new _BigNumber((inv ? one.div(x) : x).toPrecision(precision));\n  }\n});\nexport var createNthRootNumber = /* #__PURE__ */factory(name, ['typed'], (_ref2) => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, {\n    number: nthRootNumber,\n    'number, number': nthRootNumber\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { xgcdNumber } from '../../plain/number/index.js';\nvar name = 'xgcd';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createXgcd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\n\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 numberNumber(a, b) {\n      var res = xgcdNumber(a, b);\n      return config.matrix === 'Array' ? res : matrix(res);\n    },\n    'BigNumber, BigNumber': _xgcdBigNumber // 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\n  function _xgcdBigNumber(a, b) {\n    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n    var // used to swap two variables\n    t;\n    var // quotient\n    q;\n    var // remainder\n    r;\n    var zero = new BigNumber(0);\n    var one = new BigNumber(1);\n    var x = zero;\n    var lastx = one;\n    var y = one;\n    var 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      t = x;\n      x = lastx.minus(q.times(x));\n      lastx = t;\n      t = y;\n      y = lasty.minus(q.times(y));\n      lasty = t;\n      a = b;\n      b = r;\n    }\n\n    var res;\n\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\n    return config.matrix === 'Array' ? res : matrix(res);\n  }\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';\nvar name = 'bitAnd';\nvar dependencies = ['typed', 'matrix', 'equalScalar'];\nexport var createBitAnd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': bitAndNumber,\n    'BigNumber, BigNumber': bitAndBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm07';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm07 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n\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    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // vars\n\n\n    var i, j; // result arrays\n\n    var cdata = []; // initialize c\n\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    } // workspaces\n\n\n    var xa = [];\n    var xb = []; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // scatter the values of A(:,j) into workspace\n\n      _scatter(a, j, wa, xa, mark); // scatter the values of B(:,j) into workspace\n\n\n      _scatter(b, j, wb, xb, mark); // loop rows\n\n\n      for (i = 0; i < rows; i++) {\n        // matrix values @ i,j\n        var va = wa[i] === mark ? xa[i] : zero;\n        var vb = wb[i] === mark ? xb[i] : zero; // invoke callback\n\n        cdata[i][j] = cf(va, vb);\n      }\n    } // return dense matrix\n\n\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    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // loop values in column j\n\n    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      var i = index[k]; // update workspace\n\n      w[i] = mark;\n      x[i] = values[k];\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';\nvar name = 'bitXor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix'];\nexport var createBitXor = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': bitXorNumber,\n    'BigNumber, BigNumber': bigBitXor,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'or';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createOr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': orNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return this(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'diag';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createDiag = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n\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    Array: function Array(x) {\n      return _diag(x, 0, arraySize(x), null);\n    },\n    'Array, number': function ArrayNumber(x, k) {\n      return _diag(x, k, arraySize(x), null);\n    },\n    'Array, BigNumber': function ArrayBigNumber(x, k) {\n      return _diag(x, k.toNumber(), arraySize(x), null);\n    },\n    'Array, string': function ArrayString(x, format) {\n      return _diag(x, 0, arraySize(x), format);\n    },\n    'Array, number, string': function ArrayNumberString(x, k, format) {\n      return _diag(x, k, arraySize(x), format);\n    },\n    'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), arraySize(x), format);\n    },\n    Matrix: function Matrix(x) {\n      return _diag(x, 0, x.size(), x.storage());\n    },\n    'Matrix, number': function MatrixNumber(x, k) {\n      return _diag(x, k, x.size(), x.storage());\n    },\n    'Matrix, BigNumber': function MatrixBigNumber(x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage());\n    },\n    'Matrix, string': function MatrixString(x, format) {\n      return _diag(x, 0, x.size(), format);\n    },\n    'Matrix, number, string': function MatrixNumberString(x, k, format) {\n      return _diag(x, k, x.size(), format);\n    },\n    'Matrix, BigNumber, string': function MatrixBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), x.size(), format);\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\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // check dimensions\n\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);\n\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper);\n    }\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    var ms = [l + kSub, l + kSuper];\n\n    if (format && format !== 'sparse' && format !== 'dense') {\n      throw new TypeError(\"Unknown matrix type \".concat(format, \"\\\"\"));\n    } // create diagonal matrix\n\n\n    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k); // check we need to return a matrix\n\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      var dm = x.diagonal(k); // check we need to return a matrix\n\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) {\n          return matrix(dm, format);\n        }\n\n        return dm;\n      }\n\n      return dm.valueOf();\n    } // vector size\n\n\n    var n = Math.min(s[0] - kSub, s[1] - kSuper); // diagonal values\n\n    var vector = []; // loop diagonal\n\n    for (var i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper];\n    } // check we need to return a matrix\n\n\n    return format !== null ? matrix(vector) : vector;\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';\nvar name = 'identity';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];\nexport var createIdentity = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n\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    string: function string(format) {\n      return matrix(format);\n    },\n    'number | BigNumber': function numberBigNumber(rows) {\n      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, string': function numberBigNumberString(rows, format) {\n      return _identity(rows, rows, format);\n    },\n    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(rows, cols) {\n      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, number | BigNumber, string': function numberBigNumberNumberBigNumberString(rows, cols, format) {\n      return _identity(rows, cols, format);\n    },\n    Array: function Array(size) {\n      return _identityVector(size);\n    },\n    'Array, string': function ArrayString(size, format) {\n      return _identityVector(size, format);\n    },\n    Matrix: function Matrix(size) {\n      return _identityVector(size.valueOf(), size.storage());\n    },\n    'Matrix, string': function MatrixString(size, format) {\n      return _identityVector(size.valueOf(), format);\n    }\n  });\n\n  function _identityVector(size, format) {\n    switch (size.length) {\n      case 0:\n        return format ? matrix(format) : [];\n\n      case 1:\n        return _identity(size[0], size[0], format);\n\n      case 2:\n        return _identity(size[0], size[1], format);\n\n      default:\n        throw new Error('Vector containing two values expected');\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\n\n  function _identity(rows, cols, format) {\n    // BigNumber constructor with the right precision\n    var Big = isBigNumber(rows) || isBigNumber(cols) ? BigNumber : null;\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\n    if (!isInteger(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n\n    var one = Big ? new BigNumber(1) : 1;\n    var defaultValue = Big ? new Big(0) : 0;\n    var size = [rows, cols]; // check we need to return a matrix\n\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\n      if (format === 'dense') {\n        return DenseMatrix.diagonal(size, one, 0, defaultValue);\n      }\n\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    } // create and resize array\n\n\n    var res = resize([], size, defaultValue); // fill in ones on the diagonal\n\n    var minimum = rows < cols ? rows : cols; // fill diagonal\n\n    for (var d = 0; d < minimum; d++) {\n      res[d][d] = one;\n    }\n\n    return res;\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';\nvar name = 'ones';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createOnes = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\n\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' ? _ones([]) : _ones([], 'default');\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 numberBigNumberString(size) {\n      var last = size[size.length - 1];\n\n      if (typeof last === 'string') {\n        var 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    Array: _ones,\n    Matrix: function Matrix(size) {\n      var format = size.storage();\n      return _ones(size.valueOf(), format);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(size, format) {\n      return _ones(size.valueOf(), format);\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\n  function _ones(size, format) {\n    var hasBigNumbers = _normalize(size);\n\n    var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;\n\n    _validate(size);\n\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n\n      return arr;\n    }\n  } // replace BigNumbers with numbers, returns true if size contained BigNumbers\n\n\n  function _normalize(size) {\n    var 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  } // validate arguments\n\n\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});","import { reshape as arrayReshape } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'reshape';\nvar dependencies = ['typed', 'isInteger', 'matrix'];\nexport var createReshape = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n\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    'Matrix, Array': function MatrixArray(x, sizes) {\n      return x.reshape(sizes);\n    },\n    'Array, Array': function ArrayArray(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});","import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { noMatrix } from '../../utils/noop.js';\nvar name = 'size';\nvar dependencies = ['typed', 'config', '?matrix'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix\n  } = _ref;\n\n  /**\n   * Calculate the size of a matrix or scalar.\n   *\n   * Syntax:\n   *\n   *     math.size(x)\n   *\n   * Examples:\n   *\n   *     math.size(2.3)                  // returns []\n   *     math.size('hello world')        // returns [11]\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.size(A)                    // returns [2, 3]\n   *     math.size(math.range(1,6))      // returns [5]\n   *\n   * See also:\n   *\n   *     count, resize, squeeze, subset\n   *\n   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix\n   * @return {Array | Matrix} A vector with size of `x`.\n   */\n  return typed(name, {\n    Matrix: function Matrix(x) {\n      return x.create(x.size());\n    },\n    Array: arraySize,\n    string: function string(x) {\n      return config.matrix === 'Array' ? [x.length] : matrix([x.length]);\n    },\n    'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {\n      // scalar\n      return config.matrix === 'Array' ? [] : matrix ? matrix([]) : noMatrix();\n    }\n  });\n});","import { isBigNumber } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { resize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'zeros';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createZeros = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\n\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' ? _zeros([]) : _zeros([], 'default');\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 numberBigNumberString(size) {\n      var last = size[size.length - 1];\n\n      if (typeof last === 'string') {\n        var 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    Array: _zeros,\n    Matrix: function Matrix(size) {\n      var format = size.storage();\n      return _zeros(size.valueOf(), format);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(size, format) {\n      return _zeros(size.valueOf(), format);\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\n  function _zeros(size, format) {\n    var hasBigNumbers = _normalize(size);\n\n    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;\n\n    _validate(size);\n\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n\n      return arr;\n    }\n  } // replace BigNumbers with numbers, returns true if size contained BigNumbers\n\n\n  function _normalize(size) {\n    var 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  } // validate arguments\n\n\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}); // TODO: zeros contains almost the same code as ones. Reuse this?","import { factory } from '../../utils/factory.js';\nvar name = 'hex';\nvar dependencies = ['typed', 'format'];\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 */\n\nexport var createHex = factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'hex'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'hex',\n        wordSize: wordSize\n      });\n    }\n  });\n});","function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _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; }\n\nimport { 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';\nvar NO_INT = 'Number of decimals in function round must be an integer';\nvar name = 'round';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];\nexport var createRound = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    BigNumber,\n    DenseMatrix\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, _objectSpread(_objectSpread({}, roundNumberSignatures), {}, {\n    Complex: function Complex(x) {\n      return x.round();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.round(n);\n    },\n    'Complex, BigNumber': function ComplexBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      var _n = n.toNumber();\n\n      return x.round(_n);\n    },\n    'number, BigNumber': function numberBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      return new BigNumber(x).toDecimalPlaces(n.toNumber());\n    },\n    BigNumber: function BigNumber(x) {\n      return x.toDecimalPlaces(0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.toDecimalPlaces(n.toNumber());\n    },\n    Fraction: function Fraction(x) {\n      return x.round();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.round(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, this, true);\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | Complex | BigNumber, SparseMatrix': function numberComplexBigNumberSparseMatrix(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\n      return algorithm12(y, x, this, true);\n    },\n    'number | Complex | BigNumber, DenseMatrix': function numberComplexBigNumberDenseMatrix(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\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  }));\n});\nvar roundNumberSignatures = {\n  number: roundNumber,\n  'number, number': function numberNumber(x, n) {\n    if (!isInteger(n)) {\n      throw new TypeError(NO_INT);\n    }\n\n    if (n < 0 || n > 15) {\n      throw new Error('Number of decimals in function round must be in te range of 0-15');\n    }\n\n    return roundNumber(x, n);\n  }\n};\nexport var createRoundNumber = /* #__PURE__ */factory(name, ['typed'], (_ref2) => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, roundNumberSignatures);\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm08';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm08 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!avalues || !bvalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrices');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // workspace\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // vars\n\n    var k, k0, k1, i; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop values in a\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // mark workspace\n\n        w[i] = mark; // set value\n\n        x[i] = avalues[k]; // add index\n\n        cindex.push(i);\n      } // loop values in b\n\n\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // check value exists in workspace\n\n        if (w[i] === mark) {\n          // evaluate callback\n          x[i] = cf(x[i], bvalues[k]);\n        }\n      } // initialize first index in j\n\n\n      k = cptr[j]; // loop index in j\n\n      while (k < cindex.length) {\n        // row\n        i = cindex[k]; // value @ i\n\n        var v = x[i]; // check for zero value\n\n        if (!eq(v, zero)) {\n          // push value\n          cvalues.push(v); // increment pointer\n\n          k++;\n        } else {\n          // remove value @ i, do not increment pointer\n          cindex.splice(k, 1);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\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';\nvar name = 'leftShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nexport var createLeftShift = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm08 = createAlgorithm08({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': leftShiftNumber,\n    'BigNumber, BigNumber': leftShiftBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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';\nvar name = 'rightLogShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nexport var createRightLogShift = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm08 = createAlgorithm08({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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    'number, number': rightLogShiftNumber,\n    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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';\nvar name = 'compare';\nvar dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix'];\nexport var createCompare = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    equalScalar,\n    matrix,\n    BigNumber,\n    Fraction,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y ? 0 : x > y ? 1 : -1;\n    },\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return bigNearlyEqual(x, y, config.epsilon) ? new BigNumber(0) : new BigNumber(x.cmp(y));\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return new Fraction(x.compare(y));\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createCompareNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;\n    }\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';\nvar name = 'compareText';\nvar dependencies = ['typed', 'matrix'];\nexport var createCompareText = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': _compareText,\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, _compareText);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, _compareText, false);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, _compareText, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _compareText, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, _compareText, true).valueOf();\n    }\n  });\n});\nexport var createCompareTextNumber = /* #__PURE__ */factory(name, ['typed'], (_ref2) => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, {\n    'any, any': _compareText\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';\nvar name = 'smaller';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createSmaller = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x < y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x < y && !nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) === -1;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createSmallerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x < y && !nearlyEqual(x, y, config.epsilon);\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';\nvar name = 'larger';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createLarger = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x > y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x > y && !nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) === 1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createLargerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x > y && !nearlyEqual(x, y, config.epsilon);\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';\nvar name = 'unequal';\nvar dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix'];\nexport var createUnequal = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    equalScalar,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('unequal', {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y !== null;\n      }\n\n      if (y === null) {\n        return x !== null;\n      }\n\n      if (x === undefined) {\n        return y !== undefined;\n      }\n\n      if (y === undefined) {\n        return x !== undefined;\n      }\n\n      return _unequal(x, y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, _unequal);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, _unequal, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, _unequal, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, _unequal);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, _unequal, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, _unequal, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, _unequal, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, _unequal, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _unequal, false).valueOf();\n    },\n    'any, Array': function anyArray(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});\nexport var createUnequalNumber = factory(name, ['typed', 'equalScalar'], (_ref2) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref2;\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y !== null;\n      }\n\n      if (y === null) {\n        return x !== null;\n      }\n\n      if (x === undefined) {\n        return y !== undefined;\n      }\n\n      if (y === undefined) {\n        return x !== undefined;\n      }\n\n      return !equalScalar(x, y);\n    }\n  });\n});","import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ImmutableDenseMatrix';\nvar dependencies = ['smaller', 'DenseMatrix'];\nexport var createImmutableDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    smaller,\n    DenseMatrix\n  } = _ref;\n\n  function ImmutableDenseMatrix(data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n\n    if (isMatrix(data) || isArray(data)) {\n      // use DenseMatrix implementation\n      var matrix = new DenseMatrix(data, datatype); // internal structures\n\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   * Attach type information\n   */\n\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;\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\n  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n        {\n          // use base implementation\n          var m = DenseMatrix.prototype.subset.call(this, index); // check result is a matrix\n\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\n          return m;\n        }\n      // intentional fall through\n\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   * 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\n\n  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance');\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\n\n  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance');\n  };\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n\n\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');\n  };\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n\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   * Get a JSON representation of the matrix\n   * @returns {Object}\n   */\n\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   * 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\n\n  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json);\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\n\n  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');\n  };\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n\n\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      var m = null; // compute min\n\n      this.forEach(function (v) {\n        if (m === null || smaller(v, m)) {\n          m = v;\n        }\n      });\n      this._min = m !== null ? m : undefined;\n    }\n\n    return this._min;\n  };\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n\n\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      var m = null; // compute max\n\n      this.forEach(function (v) {\n        if (m === null || smaller(m, v)) {\n          m = v;\n        }\n      });\n      this._max = m !== null ? m : undefined;\n    }\n\n    return this._max;\n  };\n\n  return ImmutableDenseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'FibonacciHeap';\nvar dependencies = ['smaller', 'larger'];\nexport var createFibonacciHeapClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    smaller,\n    larger\n  } = _ref;\n  var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);\n  /**\n   * Fibonacci Heap implementation, used interally for Matrix math.\n   * @class FibonacciHeap\n   * @constructor FibonacciHeap\n   */\n\n  function FibonacciHeap() {\n    if (!(this instanceof FibonacciHeap)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // initialize fields\n\n\n    this._minimum = null;\n    this._size = 0;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  FibonacciHeap.prototype.type = 'FibonacciHeap';\n  FibonacciHeap.prototype.isFibonacciHeap = true;\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\n  FibonacciHeap.prototype.insert = function (key, value) {\n    // create node\n    var node = {\n      key: key,\n      value: value,\n      degree: 0\n    }; // check we have a node in the minimum\n\n    if (this._minimum) {\n      // minimum node\n      var minimum = this._minimum; // update left & right of node\n\n      node.left = minimum;\n      node.right = minimum.right;\n      minimum.right = node;\n      node.right.left = node; // update minimum node in heap if needed\n\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; // this is the first node\n\n      this._minimum = node;\n    } // increment number of nodes in heap\n\n\n    this._size++; // return node\n\n    return node;\n  };\n  /**\n   * Returns the number of nodes in heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.size = function () {\n    return this._size;\n  };\n  /**\n   * Removes all elements from this heap.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.clear = function () {\n    this._minimum = null;\n    this._size = 0;\n  };\n  /**\n   * Returns true if the heap is empty, otherwise false.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.isEmpty = function () {\n    return this._size === 0;\n  };\n  /**\n   * Extracts the node with minimum key from heap. Amortized running\n   * time: O(log n).\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.extractMinimum = function () {\n    // node to remove\n    var node = this._minimum; // check we have a minimum\n\n    if (node === null) {\n      return node;\n    } // current minimum\n\n\n    var minimum = this._minimum; // get number of children\n\n    var numberOfChildren = node.degree; // pointer to the first child\n\n    var x = node.child; // for each child of node do...\n\n    while (numberOfChildren > 0) {\n      // store node in right side\n      var tempRight = x.right; // remove x from child list\n\n      x.left.right = x.right;\n      x.right.left = x.left; // add x to root list of heap\n\n      x.left = minimum;\n      x.right = minimum.right;\n      minimum.right = x;\n      x.right.left = x; // set Parent[x] to null\n\n      x.parent = null;\n      x = tempRight;\n      numberOfChildren--;\n    } // remove node from root list of heap\n\n\n    node.left.right = node.right;\n    node.right.left = node.left; // update minimum\n\n    if (node === node.right) {\n      // empty\n      minimum = null;\n    } else {\n      // update minimum\n      minimum = node.right; // we need to update the pointer to the root with minimum key\n\n      minimum = _findMinimumNode(minimum, this._size);\n    } // decrement size of heap\n\n\n    this._size--; // update minimum\n\n    this._minimum = minimum; // return node\n\n    return node;\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\n\n  FibonacciHeap.prototype.remove = function (node) {\n    // decrease key value\n    this._minimum = _decreaseKey(this._minimum, node, -1); // remove the smallest\n\n    this.extractMinimum();\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\n\n  function _decreaseKey(minimum, node, key) {\n    // set node key\n    node.key = key; // get parent node\n\n    var parent = node.parent;\n\n    if (parent && smaller(node.key, parent.key)) {\n      // remove node from parent\n      _cut(minimum, node, parent); // remove all nodes from parent to the root parent\n\n\n      _cascadingCut(minimum, parent);\n    } // update minimum node if needed\n\n\n    if (smaller(node.key, minimum.key)) {\n      minimum = node;\n    } // return minimum\n\n\n    return minimum;\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\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--; // reset y.child if necessary\n\n    if (parent.child === node) {\n      parent.child = node.right;\n    } // remove child if degree is 0\n\n\n    if (parent.degree === 0) {\n      parent.child = null;\n    } // add node to root list of heap\n\n\n    node.left = minimum;\n    node.right = minimum.right;\n    minimum.right = node;\n    node.right.left = node; // set parent[node] to null\n\n    node.parent = null; // set mark[node] to false\n\n    node.mark = false;\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\n\n  function _cascadingCut(minimum, node) {\n    // store parent node\n    var parent = node.parent; // if there's a parent...\n\n    if (!parent) {\n      return;\n    } // if node is unmarked, set it marked\n\n\n    if (!node.mark) {\n      node.mark = true;\n    } else {\n      // it's marked, cut it from parent\n      _cut(minimum, node, parent); // cut its parent as well\n\n\n      _cascadingCut(parent);\n    }\n  }\n  /**\n   * Make the first node a child of the second one. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n\n\n  var _linkNodes = function _linkNodes(node, parent) {\n    // remove node from root list of heap\n    node.left.right = node.right;\n    node.right.left = node.left; // make node a Child of parent\n\n    node.parent = parent;\n\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    } // increase degree[parent]\n\n\n    parent.degree++; // set mark[node] false\n\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    var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; // create list with initial capacity\n\n    var array = new Array(arraySize); // find the number of root nodes.\n\n    var numRoots = 0;\n    var x = minimum;\n\n    if (x) {\n      numRoots++;\n      x = x.right;\n\n      while (x !== minimum) {\n        numRoots++;\n        x = x.right;\n      }\n    } // vars\n\n\n    var y; // For each node in root list do...\n\n    while (numRoots > 0) {\n      // access this node's degree..\n      var d = x.degree; // get next node\n\n      var next = x.right; // check if there is a node already in array with the same degree\n\n      while (true) {\n        // get node with the same degree is any\n        y = array[d];\n\n        if (!y) {\n          break;\n        } // make one node with the same degree a child of the other, do this based on the key value.\n\n\n        if (larger(x.key, y.key)) {\n          var temp = y;\n          y = x;\n          x = temp;\n        } // make y a child of x\n\n\n        _linkNodes(y, x); // we have handled this degree, go to next one.\n\n\n        array[d] = null;\n        d++;\n      } // save this node for later when we might encounter another of the same degree.\n\n\n      array[d] = x; // move forward through list.\n\n      x = next;\n      numRoots--;\n    } // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].\n\n\n    minimum = null; // loop nodes in array\n\n    for (var i = 0; i < arraySize; i++) {\n      // get current node\n      y = array[i];\n\n      if (!y) {\n        continue;\n      } // check if we have a linked list\n\n\n      if (minimum) {\n        // First remove node from root list.\n        y.left.right = y.right;\n        y.right.left = y.left; // now add to root list, again.\n\n        y.left = minimum;\n        y.right = minimum.right;\n        minimum.right = y;\n        y.right.left = y; // check if this is a new min.\n\n        if (smaller(y.key, minimum.key)) {\n          minimum = y;\n        }\n      } else {\n        minimum = y;\n      }\n    }\n\n    return minimum;\n  }\n\n  return FibonacciHeap;\n}, {\n  isClass: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'sparse';\nvar dependencies = ['typed', 'SparseMatrix'];\nexport var createSparse = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    SparseMatrix\n  } = _ref;\n\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    string: function string(datatype) {\n      return new SparseMatrix([], datatype);\n    },\n    'Array | Matrix': function ArrayMatrix(data) {\n      return new SparseMatrix(data);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(data, datatype) {\n      return new SparseMatrix(data, datatype);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acothNumber } from '../../plain/number/index.js';\nvar name = 'acoth';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAcoth = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x >= 1 || x <= -1 || config.predictable) {\n        return acothNumber(x);\n      }\n\n      return new Complex(x, 0).acoth();\n    },\n    Complex: function Complex(x) {\n      return x.acoth();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).atanh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm09';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm09 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspaces\n\n    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var w = []; // vars\n\n    var i, j, k, k0, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // column mark\n\n      var mark = j + 1; // check we need to process values\n\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]; // update workspace\n\n          w[i] = mark;\n          x[i] = bvalues[k];\n        }\n      } // loop A(:,j)\n\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // check we need to process values\n\n        if (x) {\n          // b value @ i,j\n          var vb = w[i] === mark ? x[i] : zero; // invoke f\n\n          var vc = cf(avalues[k], vb); // check zero value\n\n          if (!eq(vc, zero)) {\n            // push index\n            cindex.push(i); // push value\n\n            cvalues.push(vc);\n          }\n        } else {\n          // push index\n          cindex.push(i);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { 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';\nvar name = 'atan2';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];\nexport var createAtan2 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber,\n    DenseMatrix\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm09 = createAlgorithm09({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': Math.atan2,\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    'BigNumber, BigNumber': function BigNumberBigNumber(y, x) {\n      return BigNumber.atan2(y, x);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm09(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      // mind the order of y and x!\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // mind the order of y and x\n      return algorithm12(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // mind the order of y and x\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { secNumber } from '../../plain/number/index.js';\nvar name = 'sec';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createSec = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sec();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.cos());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sec is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\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';\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];\nexport var createAdd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    equalScalar,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm04 = createAlgorithm04({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, extend({\n    // we extend the signatures of addScalar with signatures dealing with matrices\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, addScalar);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, addScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, addScalar, true);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, addScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, addScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, y, addScalar, false);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, addScalar, true);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, addScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, addScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, addScalar, true).valueOf();\n    },\n    'any, any': addScalar,\n    'any, any, ...any': function anyAnyAny(x, y, rest) {\n      var result = this(x, y);\n\n      for (var i = 0; i < rest.length; i++) {\n        result = this(result, rest[i]);\n      }\n\n      return result;\n    }\n  }, addScalar.signatures));\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'dot';\nvar dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];\nexport var createDot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    multiplyScalar,\n    conj,\n    size\n  } = _ref;\n\n  /**\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    var xSize = _size(x);\n\n    var ySize = _size(y);\n\n    var 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    return xLen;\n  }\n\n  function _denseDot(a, b) {\n    var N = _validateDim(a, b);\n\n    var adata = isMatrix(a) ? a._data : a;\n    var adt = isMatrix(a) ? a._datatype : undefined;\n    var bdata = isMatrix(b) ? b._data : b;\n    var bdt = isMatrix(b) ? b._datatype : undefined; // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n\n    var aIsColumn = _size(a).length === 2;\n    var bIsColumn = _size(b).length === 2;\n    var add = addScalar;\n    var mul = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      var dt = adt; // find signatures that matches (dt, dt)\n\n      add = typed.find(addScalar, [dt, dt]);\n      mul = typed.find(multiplyScalar, [dt, dt]);\n    } // both vectors 1-dimensional\n\n\n    if (!aIsColumn && !bIsColumn) {\n      var c = mul(conj(adata[0]), bdata[0]);\n\n      for (var i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i]));\n      }\n\n      return c;\n    } // a is 1-dim, b is column\n\n\n    if (!aIsColumn && bIsColumn) {\n      var _c = mul(conj(adata[0]), bdata[0][0]);\n\n      for (var _i = 1; _i < N; _i++) {\n        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));\n      }\n\n      return _c;\n    } // a is column, b is 1-dim\n\n\n    if (aIsColumn && !bIsColumn) {\n      var _c2 = mul(conj(adata[0][0]), bdata[0]);\n\n      for (var _i2 = 1; _i2 < N; _i2++) {\n        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));\n      }\n\n      return _c2;\n    } // both vectors are column\n\n\n    if (aIsColumn && bIsColumn) {\n      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);\n\n      for (var _i3 = 1; _i3 < N; _i3++) {\n        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));\n      }\n\n      return _c3;\n    }\n  }\n\n  function _sparseDot(x, y) {\n    _validateDim(x, y);\n\n    var xindex = x._index;\n    var xvalues = x._values;\n    var yindex = y._index;\n    var yvalues = y._values; // TODO optimize add & mul using datatype\n\n    var c = 0;\n    var add = addScalar;\n    var mul = multiplyScalar;\n    var i = 0;\n    var j = 0;\n\n    while (i < xindex.length && j < yindex.length) {\n      var I = xindex[i];\n      var J = yindex[j];\n\n      if (I < J) {\n        i++;\n        continue;\n      }\n\n      if (I > J) {\n        j++;\n        continue;\n      }\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  } // TODO remove this once #1771 is fixed\n\n\n  function _size(x) {\n    return isMatrix(x) ? x.size() : size(x);\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'composition';\nvar dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];\nexport var createComposition = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    combinations,\n    isPositive,\n    isNegative,\n    isInteger,\n    larger\n  } = _ref;\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 numberBigNumberNumberBigNumber(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});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isZeroNumber } from '../../plain/number/index.js';\nvar name = 'isZero';\nvar dependencies = ['typed'];\nexport var createIsZero = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return x.isZero();\n    },\n    Complex: function Complex(x) {\n      return x.re === 0 && x.im === 0;\n    },\n    Fraction: function Fraction(x) {\n      return x.d === 1 && x.n === 0;\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { absNumber } from '../../plain/number/index.js';\nvar name = 'abs';\nvar dependencies = ['typed'];\nexport var createAbs = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.abs();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.abs();\n    },\n    Fraction: function Fraction(x) {\n      return x.abs();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since abs(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return x.abs();\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';\nvar name = 'floor';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];\nexport var createFloor = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('floor', {\n    number: function number(x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return Math.floor(x);\n      }\n    },\n    'number, number': function numberNumber(x, n) {\n      if (nearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        var [number, exponent] = \"\".concat(x, \"e\").split('e');\n        var result = Math.floor(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n        [number, exponent] = \"\".concat(result, \"e\").split('e');\n        return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n      }\n    },\n    Complex: function Complex(x) {\n      return x.floor();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      return x.floor(n);\n    },\n    BigNumber: function BigNumber(x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.floor();\n      }\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(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    Fraction: function Fraction(x) {\n      return x.floor();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      return x.floor(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, this, true);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => this(i, n), true);\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'multiply';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];\nexport var createMultiply = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    multiplyScalar,\n    equalScalar,\n    dot\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    typed\n  });\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\n            break;\n\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\n            break;\n\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n\n        break;\n\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\n            break;\n\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\n            break;\n\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n\n        break;\n\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   * 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\n\n  function _multiplyVectorVector(a, b, n) {\n    // check empty vector\n    if (n === 0) {\n      throw new Error('Cannot multiply two empty vectors');\n    }\n\n    return dot(a, b);\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\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\n    return _multiplyVectorDenseMatrix(a, b);\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\n\n  function _multiplyVectorDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // rows & columns\n\n    var alength = asize[0];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix columns\n\n    for (var j = 0; j < bcolumns; j++) {\n      // sum (do not initialize it with zero)\n      var sum = mf(adata[0], bdata[0][j]); // loop vector\n\n      for (var i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]));\n      }\n\n      c[j] = sum;\n    } // return matrix\n\n\n    return a.createDenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: dt\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\n\n  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\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\n\n  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  });\n  /**\n   * 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\n\n  function _multiplyDenseMatrixVector(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = asize[0];\n    var acolumns = asize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix a rows\n\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i]; // sum (do not initialize it with zero)\n\n      var sum = mf(row[0], bdata[0]); // loop matrix a columns\n\n      for (var j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]));\n      }\n\n      c[i] = sum;\n    } // return matrix\n\n\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: dt\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\n\n  function _multiplyDenseMatrixDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = asize[0];\n    var acolumns = asize[1];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix a rows\n\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i]; // initialize row array\n\n      c[i] = []; // loop matrix b columns\n\n      for (var j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        var sum = mf(row[0], bdata[0][j]); // loop matrix a columns\n\n        for (var x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]));\n        }\n\n        c[i][j] = sum;\n      }\n    } // return matrix\n\n\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: dt\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\n\n  function _multiplyDenseMatrixSparseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b sparse\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate b matrix\n\n    if (!bvalues) {\n      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n    } // rows & columns\n\n\n    var arows = asize[0];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // result\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = b.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // indeces in column jb\n\n      var kb0 = bptr[jb];\n      var kb1 = bptr[jb + 1]; // do not process column jb if no data exists\n\n      if (kb1 > kb0) {\n        // last row mark processed\n        var last = 0; // loop a rows\n\n        for (var i = 0; i < arows; i++) {\n          // column mark\n          var mark = i + 1; // C[i, jb]\n\n          var cij = void 0; // values in b column j\n\n          for (var kb = kb0; kb < kb1; kb++) {\n            // row\n            var ib = bindex[kb]; // check value has been initialized\n\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb]); // update mark\n\n              last = mark;\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n            }\n          } // check column has been processed and value != 0\n\n\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i);\n            cvalues.push(cij);\n          }\n        }\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\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\n\n  function _multiplySparseMatrixVector(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // validate a matrix\n\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    } // b dense\n\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var brows = b._size[0]; // result\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // workspace\n\n\n    var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // update ptr\n\n    cptr[0] = 0; // rows in b\n\n    for (var ib = 0; ib < brows; ib++) {\n      // b[ib]\n      var vbi = bdata[ib]; // check b[ib] != 0, avoid loops\n\n      if (!eq(vbi, zero)) {\n        // A values & index in ib column\n        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n          // a row\n          var ia = aindex[ka]; // check value exists in current j\n\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true; // add i to pattern of C\n\n            cindex.push(ia); // x(ia) = A\n\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    } // copy values from x to column jb of c\n\n\n    for (var p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      var ic = cindex[p]; // copy value\n\n      cvalues[p] = x[ic];\n    } // update ptr\n\n\n    cptr[1] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: dt\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\n\n  function _multiplySparseMatrixDenseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // validate a matrix\n\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    } // b dense\n\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var brows = b._size[0];\n    var bcolumns = b._size[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // result\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // workspace\n\n    var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // mark in workspace for current column\n\n      var mark = jb + 1; // rows in jb\n\n      for (var ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        var vbij = bdata[ib][jb]; // check b[ib, jb] != 0, avoid loops\n\n        if (!eq(vbij, zero)) {\n          // A values & index in ib column\n          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // a row\n            var ia = aindex[ka]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia); // x(ia) = A\n\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      } // copy values from x to column jb of c\n\n\n      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n        // row\n        var ic = cindex[p]; // copy value\n\n        cvalues[p] = x[ic];\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\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\n\n  function _multiplySparseMatrixSparseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // b sparse\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var bcolumns = b._size[1]; // flag indicating both matrices (a & b) contain data\n\n    var values = avalues && bvalues; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // workspace\n\n    var x = values ? [] : undefined; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // variables\n\n    var ka, ka0, ka1, kb, kb0, kb1, ia, ib; // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // mark in workspace for current column\n\n      var mark = jb + 1; // B values & index in j\n\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb]; // check we need to process values\n\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]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia); // x(ia) = A\n\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]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia);\n            }\n          }\n        }\n      } // check we need to process matrix values (pattern matrix)\n\n\n      if (values) {\n        // copy values from x to column jb of c\n        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n          // row\n          var ic = cindex[p]; // copy value\n\n          cvalues[p] = x[ic];\n        }\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\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\n\n  return typed(name, extend({\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n    'Array, Array': function ArrayArray(x, y) {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y)); // use dense matrix implementation\n\n\n      var m = this(matrix(x), matrix(y)); // return array or scalar\n\n      return isMatrix(m) ? m.valueOf() : m;\n    },\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // dimensions\n      var xsize = x.size();\n      var ysize = y.size(); // check dimensions\n\n      _validateMatrixDimensions(xsize, ysize); // process dimensions\n\n\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        } // Vector * Matrix\n\n\n        return _multiplyVectorMatrix(x, y);\n      } // process y dimensions\n\n\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y);\n      } // Matrix * Matrix\n\n\n      return _multiplyMatrixMatrix(x, y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use Matrix * Matrix implementation\n      return this(x, matrix(y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use Matrix * Matrix implementation\n      return this(matrix(x, y.storage()), y);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();\n    },\n    'any, any': multiplyScalar,\n    'any, any, ...any': function anyAnyAny(x, y, rest) {\n      var result = this(x, y);\n\n      for (var i = 0; i < rest.length; i++) {\n        result = this(result, rest[i]);\n      }\n\n      return result;\n    }\n  }, multiplyScalar.signatures));\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';\nvar name = 'dotMultiply';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar'];\nexport var createDotMultiply = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    multiplyScalar\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm09 = createAlgorithm09({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': multiplyScalar,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm09(x, y, multiplyScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, multiplyScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, multiplyScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 're';\nvar dependencies = ['typed'];\nexport var createRe = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return x;\n    },\n    BigNumber: function BigNumber(x) {\n      return x;\n    },\n    Complex: function Complex(x) {\n      return x.re;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { clone } from '../../utils/object.js';\nimport { flatten as flattenArray } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'flatten';\nvar dependencies = ['typed', 'matrix'];\nexport var createFlatten = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\n  /**\n   * Flatten a multi dimensional matrix into a single dimensional matrix.\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 Array(x) {\n      return flattenArray(clone(x));\n    },\n    Matrix: function Matrix(x) {\n      var flat = flattenArray(clone(x.toArray())); // TODO: return the same matrix type as x\n\n      return matrix(flat);\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  this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';\n  this.stack = new Error().stack;\n}\nArgumentsError.prototype = new Error();\nArgumentsError.prototype.constructor = Error;\nArgumentsError.prototype.name = 'ArgumentsError';\nArgumentsError.prototype.isArgumentsError = true;","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';\nvar name = 'resize';\nvar dependencies = ['config', 'matrix'];\nexport var createResize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    matrix\n  } = _ref;\n\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    } // check x is a Matrix\n\n\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    } // check result should be a matrix\n\n\n    var 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\n      x = clone(x);\n      var res = arrayResize(x, size, defaultValue);\n      return asMatrix ? matrix(res) : res;\n    }\n  };\n  /**\n   * Resize a string\n   * @param {string} str\n   * @param {number[]} size\n   * @param {string} [defaultChar=' ']\n   * @private\n   */\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\n    var len = size[0];\n\n    if (typeof len !== 'number' || !isInteger(len)) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n\n    if (str.length > len) {\n      return str.substring(0, len);\n    } else if (str.length < len) {\n      var res = str;\n\n      for (var i = 0, ii = len - str.length; i < ii; i++) {\n        res += defaultChar;\n      }\n\n      return res;\n    } else {\n      return str;\n    }\n  }\n});","import { clone } from '../../utils/object.js';\nimport { squeeze as arraySqueeze } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'squeeze';\nvar dependencies = ['typed', 'matrix'];\nexport var createSqueeze = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\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 Array(x) {\n      return arraySqueeze(clone(x));\n    },\n    Matrix: function Matrix(x) {\n      var res = arraySqueeze(x.toArray()); // FIXME: return the same type of matrix as the input\n\n      return Array.isArray(res) ? matrix(res) : res;\n    },\n    any: function any(x) {\n      // scalar\n      return clone(x);\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';\nvar name = 'to';\nvar dependencies = ['typed', 'matrix'];\nexport var createTo = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'Unit, Unit | string': function UnitUnitString(x, unit) {\n      return x.to(unit);\n    },\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'Matrix, any': function MatrixAny(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(x, y, this, false);\n    },\n    'any, Matrix': function anyMatrix(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'pow';\nvar dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'fraction', 'number', 'Complex'];\nexport var createPow = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    identity,\n    multiply,\n    matrix,\n    number,\n    fraction,\n    Complex\n  } = _ref;\n\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    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.pow(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(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    'Fraction, Fraction': function FractionFraction(x, y) {\n      if (y.d !== 1) {\n        if (config.predictable) {\n          throw new Error('Function pow does not support non-integer exponents for fractions.');\n        } else {\n          return _pow(x.valueOf(), y.valueOf());\n        }\n      } else {\n        return x.pow(y);\n      }\n    },\n    'Array, number': _powArray,\n    'Array, BigNumber': function ArrayBigNumber(x, y) {\n      return _powArray(x, y.toNumber());\n    },\n    'Matrix, number': _powMatrix,\n    'Matrix, BigNumber': function MatrixBigNumber(x, y) {\n      return _powMatrix(x, y.toNumber());\n    },\n    'Unit, number | BigNumber': function UnitNumberBigNumber(x, y) {\n      return x.pow(y);\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\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        var yFrac = fraction(y);\n        var yNum = number(yFrac);\n\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) {// fraction() throws an error if y is Infinity, etc.\n      } // Unable to express y as a fraction, so continue on\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\n\n    if (config.predictable && (x < -1 && y === Infinity || 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      // x^Infinity === 0 if -1 < x < 1\n      // A real number 0 is returned instead of complex(0)\n      if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n        return 0;\n      }\n\n      return new Complex(x, 0).pow(y, 0);\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\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    } // verify that A is a 2 dimensional square matrix\n\n\n    var s = size(x);\n\n    if (s.length !== 2) {\n      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');\n    }\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    var res = identity(s[0]).valueOf();\n    var px = x;\n\n    while (y >= 1) {\n      if ((y & 1) === 1) {\n        res = multiply(px, res);\n      }\n\n      y >>= 1;\n      px = multiply(px, px);\n    }\n\n    return res;\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\n\n  function _powMatrix(x, y) {\n    return matrix(_powArray(x.valueOf(), y));\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';\nvar name = 'dotPow';\nvar dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix'];\nexport var createDotPow = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar,\n    matrix,\n    pow,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': pow,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, pow, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, pow, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, pow, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, pow);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'rightArithShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nexport var createRightArithShift = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm08 = createAlgorithm08({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': rightArithShiftNumber,\n    'BigNumber, BigNumber': rightArithShiftBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\n    }\n  });\n});","import naturalSort from 'javascript-natural-sort';\nimport { isDenseMatrix, isSparseMatrix, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'compareNatural';\nvar dependencies = ['typed', 'compare'];\nexport var createCompareNatural = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    compare\n  } = _ref;\n  var compareBooleans = compare.signatures['boolean,boolean'];\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\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      var typeX = typeOf(x);\n      var typeY = typeOf(y);\n      var c; // numeric types\n\n      if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {\n        c = compare(x, y);\n\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      } // matrix types\n\n\n      if (typeX === 'Array' || typeX === 'Matrix' || typeY === 'Array' || typeY === 'Matrix') {\n        c = compareMatricesAndArrays(this, x, y);\n\n        if (c !== 0) {\n          return c;\n        } else {\n          return naturalSort(typeX, typeY);\n        }\n      } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'\n\n\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        } // compare by units\n\n\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      } // this should not occur...\n\n\n      throw new TypeError('Unsupported type of value \"' + typeX + '\"');\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\n  function compareMatricesAndArrays(compareNatural, x, y) {\n    if (isSparseMatrix(x) && isSparseMatrix(y)) {\n      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);\n    }\n\n    if (isSparseMatrix(x)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x.toArray(), y);\n    }\n\n    if (isSparseMatrix(y)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x, y.toArray());\n    } // convert DenseArray into Array\n\n\n    if (isDenseMatrix(x)) {\n      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);\n    }\n\n    if (isDenseMatrix(y)) {\n      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);\n    } // convert scalars to array\n\n\n    if (!Array.isArray(x)) {\n      return compareMatricesAndArrays(compareNatural, [x], y);\n    }\n\n    if (!Array.isArray(y)) {\n      return compareMatricesAndArrays(compareNatural, x, [y]);\n    }\n\n    return compareArrays(compareNatural, x, y);\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\n\n  function compareArrays(compareNatural, x, y) {\n    // compare each value\n    for (var i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {\n      var v = compareNatural(x[i], y[i]);\n\n      if (v !== 0) {\n        return v;\n      }\n    } // compare the size of the arrays\n\n\n    if (x.length > y.length) {\n      return 1;\n    }\n\n    if (x.length < y.length) {\n      return -1;\n    } // both Arrays have equal size and content\n\n\n    return 0;\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\n\n  function compareObjects(compareNatural, x, y) {\n    var keysX = Object.keys(x);\n    var keysY = Object.keys(y); // compare keys\n\n    keysX.sort(naturalSort);\n    keysY.sort(naturalSort);\n    var c = compareArrays(compareNatural, keysX, keysY);\n\n    if (c !== 0) {\n      return c;\n    } // compare values\n\n\n    for (var i = 0; i < keysX.length; i++) {\n      var v = compareNatural(x[keysX[i]], y[keysY[i]]);\n\n      if (v !== 0) {\n        return v;\n      }\n    }\n\n    return 0;\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 */\n\nfunction compareComplexNumbers(x, y) {\n  if (x.re > y.re) {\n    return 1;\n  }\n\n  if (x.re < y.re) {\n    return -1;\n  }\n\n  if (x.im > y.im) {\n    return 1;\n  }\n\n  if (x.im < y.im) {\n    return -1;\n  }\n\n  return 0;\n}","import { factory } from '../../utils/factory.js';\nvar name = 'equalText';\nvar dependencies = ['typed', 'compareText', 'isZero'];\nexport var createEqualText = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    compareText,\n    isZero\n  } = _ref;\n\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 anyAny(x, y) {\n      return isZero(compareText(x, y));\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';\nvar name = 'largerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createLargerEq = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x >= y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x >= y || nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) !== -1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createLargerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x >= y || nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { isMatrix } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'partitionSelect';\nvar dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];\nexport var createPartitionSelect = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isNumeric,\n    isNaN,\n    compare\n  } = _ref;\n  var asc = compare;\n\n  var desc = (a, b) => -compare(a, b);\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\n\n  return typed(name, {\n    'Array | Matrix, number': function ArrayMatrixNumber(x, k) {\n      return _partitionSelect(x, k, asc);\n    },\n    'Array | Matrix, number, string': function ArrayMatrixNumberString(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    '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      var size = x.size();\n\n      if (size.length > 1) {\n        throw new Error('Only one dimensional matrices supported');\n      }\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   * 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\n\n  function quickSelect(arr, k, compare) {\n    if (k >= arr.length) {\n      throw new Error('k out of bounds');\n    } // check for NaN values since these can cause an infinite while loop\n\n\n    for (var i = 0; i < arr.length; i++) {\n      if (isNumeric(arr[i]) && isNaN(arr[i])) {\n        return arr[i]; // return NaN\n      }\n    }\n\n    var from = 0;\n    var to = arr.length - 1; // if from == to we reached the kth element\n\n    while (from < to) {\n      var r = from;\n      var w = to;\n      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]; // stop if the reader and writer meets\n\n      while (r < w) {\n        // arr[r] >= pivot\n        if (compare(arr[r], pivot) >= 0) {\n          // put the large values at the end\n          var tmp = arr[w];\n          arr[w] = arr[r];\n          arr[r] = tmp;\n          --w;\n        } else {\n          // the value is smaller than the pivot, skip\n          ++r;\n        }\n      } // if we stepped up (r++) we need to step one down (arr[r] > pivot)\n\n\n      if (compare(arr[r], pivot) > 0) {\n        --r;\n      } // the r pointer is on the end of the first k elements\n\n\n      if (k <= r) {\n        to = r;\n      } else {\n        from = r + 1;\n      }\n    }\n\n    return arr[k];\n  }\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';\nvar name = 'Index';\nvar dependencies = ['ImmutableDenseMatrix'];\nexport var createIndexClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    ImmutableDenseMatrix\n  } = _ref;\n\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 (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i];\n\n      if (isRange(arg)) {\n        this._dimensions.push(arg);\n\n        this._isScalar = false;\n      } else if (Array.isArray(arg) || isMatrix(arg)) {\n        // create matrix\n        var m = _createImmutableMatrix(arg.valueOf());\n\n        this._dimensions.push(m); // size\n\n\n        var size = m.size(); // scalar\n\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      } // TODO: implement support for wildcard '*'\n\n    }\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Index.prototype.type = 'Index';\n  Index.prototype.isIndex = true;\n\n  function _createImmutableMatrix(arg) {\n    // loop array elements\n    for (var 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    } // create matrix\n\n\n    return new ImmutableDenseMatrix(arg);\n  }\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n\n\n  Index.prototype.clone = function () {\n    var index = new Index();\n    index._dimensions = clone(this._dimensions);\n    index._isScalar = this._isScalar;\n    return index;\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\n\n  Index.create = function (ranges) {\n    var index = new Index();\n    Index.apply(index, ranges);\n    return index;\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\n\n  Index.prototype.size = function () {\n    var size = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var d = this._dimensions[i];\n      size[i] = typeof d === 'string' ? 1 : d.size()[0];\n    }\n\n    return size;\n  };\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n\n\n  Index.prototype.max = function () {\n    var values = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.max();\n    }\n\n    return values;\n  };\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n\n\n  Index.prototype.min = function () {\n    var values = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.min();\n    }\n\n    return values;\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\n\n  Index.prototype.forEach = function (callback) {\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      callback(this._dimensions[i], i, this);\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\n\n  Index.prototype.dimension = function (dim) {\n    return this._dimensions[dim] || null;\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\n\n  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';\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\n\n  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null;\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\n\n  Index.prototype.isScalar = function () {\n    return this._isScalar;\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\n\n  Index.prototype.toArray = function () {\n    var array = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());\n    }\n\n    return array;\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\n\n  Index.prototype.valueOf = Index.prototype.toArray;\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\n  Index.prototype.toString = function () {\n    var strings = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n\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   * 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\n\n  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\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\n\n  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions);\n  };\n\n  return Index;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { asechNumber } from '../../plain/number/index.js';\nvar name = 'asech';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAsech = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        var xInv = 1 / x;\n\n        if (xInv > 0 || config.predictable) {\n          return asechNumber(x);\n        }\n\n        var 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    Complex: function Complex(x) {\n      return x.asech();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).acosh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'tan';\nvar dependencies = ['typed'];\nexport var createTan = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.tan();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.tan();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tan is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since tan(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { flatten, generalize, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setDifference';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetDifference = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n\n      if (subset(size(a1), new Index(0)) === 0) {\n        // empty-anything=empty\n        result = [];\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        // anything-empty=anything\n        return flatten(a1.toArray());\n      } else {\n        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n        var inb2;\n\n        for (var i = 0; i < b1.length; i++) {\n          inb2 = false;\n\n          for (var j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n              // the identifier is always a decimal int\n              inb2 = true;\n              break;\n            }\n          }\n\n          if (!inb2) {\n            result.push(b1[i]);\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result);\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(generalize(result));\n    }\n  });\n});","import { flatten, generalize, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setIntersect';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetIntersect = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n\n      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {\n        // of any of them is empty, return empty\n        result = [];\n      } else {\n        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n\n        for (var i = 0; i < b1.length; i++) {\n          for (var j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n              // the identifier is always a decimal int\n              result.push(b1[i]);\n              break;\n            }\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result);\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(generalize(result));\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setMultiplicity';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetMultiplicity = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\n\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 numberBigNumberFractionComplexArrayMatrix(e, a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return 0\n        return 0;\n      }\n\n      var b = flatten(Array.isArray(a) ? a : a.toArray());\n      var count = 0;\n\n      for (var i = 0; i < b.length; i++) {\n        if (compareNatural(b[i], e) === 0) {\n          count++;\n        }\n      }\n\n      return count;\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setSize';\nvar dependencies = ['typed', 'compareNatural'];\nexport var createSetSize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    compareNatural\n  } = _ref;\n\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 ArrayMatrix(a) {\n      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n    },\n    'Array | Matrix, boolean': function ArrayMatrixBoolean(a, unique) {\n      if (unique === false || a.length === 0) {\n        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n      } else {\n        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        var count = 1;\n\n        for (var i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            count++;\n          }\n        }\n\n        return count;\n      }\n    }\n  });\n});","import { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'trace';\nvar dependencies = ['typed', 'matrix', 'add'];\nexport var createTrace = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    add\n  } = _ref;\n\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    SparseMatrix: _sparseTrace,\n    DenseMatrix: _denseTrace,\n    any: clone\n  });\n\n  function _denseTrace(m) {\n    // matrix size & data\n    var size = m._size;\n    var data = m._data; // process dimensions\n\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\n        throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\n\n      case 2:\n        {\n          // two dimensional\n          var rows = size[0];\n          var cols = size[1];\n\n          if (rows === cols) {\n            // calulate sum\n            var sum = 0; // loop diagonal\n\n            for (var i = 0; i < rows; i++) {\n              sum = add(sum, data[i][i]);\n            } // return trace\n\n\n            return sum;\n          } else {\n            throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\n          }\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    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n    var size = m._size; // check dimensions\n\n    var rows = size[0];\n    var columns = size[1]; // matrix must be square\n\n    if (rows === columns) {\n      // calulate sum\n      var sum = 0; // check we have data (avoid looping columns)\n\n      if (values.length > 0) {\n        // loop columns\n        for (var j = 0; j < columns; j++) {\n          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n          var k0 = ptr[j];\n          var k1 = ptr[j + 1]; // loop k within [k0, k1[\n\n          for (var k = k0; k < k1; k++) {\n            // row index\n            var i = index[k]; // check row\n\n            if (i === j) {\n              // accumulate value\n              sum = add(sum, values[k]); // exit loop\n\n              break;\n            }\n\n            if (i > j) {\n              // exit loop, no value on the diagonal for column j\n              break;\n            }\n          }\n        }\n      } // return trace\n\n\n      return sum;\n    }\n\n    throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\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';\nvar name = 'quantileSeq';\nvar dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare'];\nexport var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    multiply,\n    partitionSelect,\n    compare\n  } = _ref;\n\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    var 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\n      if (typeof sorted === 'boolean') {\n        dataArr = data.valueOf();\n\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            var nPlusOne = probOrN + 1;\n            probArr = new Array(probOrN);\n\n            for (var i = 0; i < probOrN;) {\n              probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);\n            }\n\n            return probArr;\n          }\n        }\n\n        if (isBigNumber(probOrN)) {\n          var 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            } // largest possible Array length is 2^32-1\n            // 2^32 < 10^15, thus safe conversion guaranteed\n\n\n            var intN = probOrN.toNumber();\n\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            var _nPlusOne = new BigNumber(intN + 1);\n\n            probArr = new Array(intN);\n\n            for (var _i = 0; _i < intN;) {\n              probArr[_i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++_i).div(_nPlusOne), sorted));\n            }\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\n          for (var _i2 = 0; _i2 < probArr.length; ++_i2) {\n            var currProb = probOrN[_i2];\n\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\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[_i2] = _quantileSeq(dataArr, currProb, sorted);\n          }\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   * 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\n\n  function _quantileSeq(array, prob, sorted) {\n    var flat = flatten(array);\n    var len = flat.length;\n\n    if (len === 0) {\n      throw new Error('Cannot calculate quantile of an empty sequence');\n    }\n\n    if (isNumber(prob)) {\n      var _index = prob * (len - 1);\n\n      var _fracPart = _index % 1;\n\n      if (_fracPart === 0) {\n        var value = sorted ? flat[_index] : partitionSelect(flat, _index);\n        validate(value);\n        return value;\n      }\n\n      var _integerPart = Math.floor(_index);\n\n      var _left;\n\n      var _right;\n\n      if (sorted) {\n        _left = flat[_integerPart];\n        _right = flat[_integerPart + 1];\n      } else {\n        _right = partitionSelect(flat, _integerPart + 1); // max of partition is kth largest\n\n        _left = flat[_integerPart];\n\n        for (var 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); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n\n      return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));\n    } // If prob is a BigNumber\n\n\n    var index = prob.times(len - 1);\n\n    if (index.isInteger()) {\n      index = index.toNumber();\n\n      var _value = sorted ? flat[index] : partitionSelect(flat, index);\n\n      validate(_value);\n      return _value;\n    }\n\n    var integerPart = index.floor();\n    var fracPart = index.minus(integerPart);\n    var integerPartNumber = integerPart.toNumber();\n    var left;\n    var right;\n\n    if (sorted) {\n      left = flat[integerPartNumber];\n      right = flat[integerPartNumber + 1];\n    } else {\n      right = partitionSelect(flat, integerPartNumber + 1); // max of partition is kth largest\n\n      left = flat[integerPartNumber];\n\n      for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {\n        if (compare(flat[_i3], left) > 0) {\n          left = flat[_i3];\n        }\n      }\n    }\n\n    validate(left);\n    validate(right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n\n    var one = new fracPart.constructor(1);\n    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));\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\n\n  var validate = typed({\n    'number | BigNumber | Unit': function numberBigNumberUnit(x) {\n      return x;\n    }\n  });\n  return quantileSeq;\n});","/* eslint-disable no-loss-of-precision */\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function gammaNumber(n) {\n  var 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) {\n    // Extended Stirling Approx\n    var twoN = n * n;\n    var threeN = twoN * n;\n    var fourN = threeN * n;\n    var fiveN = fourN * n;\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  }\n\n  --n;\n  x = gammaP[0];\n\n  for (var i = 1; i < gammaP.length; ++i) {\n    x += gammaP[i] / (n + i);\n  }\n\n  var 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'; // TODO: comment on the variables g and p\n\nexport var gammaG = 4.7421875;\nexport 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];","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js';\nvar name = 'gamma';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];\nexport var createGamma = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    pow,\n    BigNumber: _BigNumber,\n    Complex: _Complex\n  } = _ref;\n\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  return typed(name, {\n    number: gammaNumber,\n    Complex: function Complex(n) {\n      if (n.im === 0) {\n        return this(n.re);\n      }\n\n      n = new _Complex(n.re - 1, n.im);\n      var x = new _Complex(gammaP[0], 0);\n\n      for (var i = 1; i < gammaP.length; ++i) {\n        var real = n.re + i; // x += p[i]/(n+i)\n\n        var den = real * real + n.im * n.im;\n\n        if (den !== 0) {\n          x.re += gammaP[i] * real / den;\n          x.im += -(gammaP[i] * n.im) / den;\n        } else {\n          x.re = gammaP[i] < 0 ? -Infinity : Infinity;\n        }\n      }\n\n      var t = new _Complex(n.re + gammaG + 0.5, n.im);\n      var twoPiSqrt = Math.sqrt(2 * Math.PI);\n      n.re += 0.5;\n      var result = pow(t, n);\n\n      if (result.im === 0) {\n        // sqrt(2*PI)*result\n        result.re *= twoPiSqrt;\n      } else if (result.re === 0) {\n        result.im *= twoPiSqrt;\n      } else {\n        result.re *= twoPiSqrt;\n        result.im *= twoPiSqrt;\n      }\n\n      var r = Math.exp(-t.re); // exp(-t)\n\n      t.re = r * Math.cos(-t.im);\n      t.im = r * Math.sin(-t.im);\n      return multiplyScalar(multiplyScalar(result, t), x);\n    },\n    BigNumber: function BigNumber(n) {\n      if (n.isInteger()) {\n        return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : 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    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, this);\n    }\n  });\n  /**\n   * Calculate factorial for a BigNumber\n   * @param {BigNumber} n\n   * @returns {BigNumber} Returns the factorial of n\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    var precision = config.precision + (Math.log(n.toNumber()) | 0);\n\n    var Big = _BigNumber.clone({\n      precision: precision\n    });\n\n    if (n % 2 === 1) {\n      return n.times(bigFactorial(new _BigNumber(n - 1)));\n    }\n\n    var p = n;\n    var prod = new Big(n);\n    var 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});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'bignumber';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createBignumber = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber\n  } = _ref;\n\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    number: function number(x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new BigNumber(x + '');\n    },\n    string: function string(x) {\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n\n      if (wordSizeSuffixMatch) {\n        // x has a word size suffix\n        var size = wordSizeSuffixMatch[2];\n        var n = BigNumber(wordSizeSuffixMatch[1]);\n        var twoPowSize = new BigNumber(2).pow(Number(size));\n\n        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n\n        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);\n\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize);\n        } else {\n          return n;\n        }\n      }\n\n      return new BigNumber(x);\n    },\n    BigNumber: function BigNumber(x) {\n      // we assume a BigNumber is immutable\n      return x;\n    },\n    Fraction: function Fraction(x) {\n      return new BigNumber(x.n).div(x.d).times(x.s);\n    },\n    null: function _null(x) {\n      return new BigNumber(0);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\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';\nvar name = 'lcm';\nvar dependencies = ['typed', 'matrix', 'equalScalar'];\nexport var createLcm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': lcmNumber,\n    'BigNumber, BigNumber': _lcmBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.lcm(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      return algorithm11(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    },\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {\n      var res = this(a, b);\n\n      for (var i = 0; i < args.length; i++) {\n        res = this(res, args[i]);\n      }\n\n      return res;\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\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\n    if (b.isZero()) {\n      return b;\n    } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    // evaluate lcm here inline to reduce overhead\n\n\n    var prod = a.times(b);\n\n    while (!b.isZero()) {\n      var t = b;\n      b = a.mod(t);\n      a = t;\n    }\n\n    return prod.div(a).abs();\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';\nvar name = 'bitOr';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createBitOr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm04 = createAlgorithm04({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': bitOrNumber,\n    'BigNumber, BigNumber': bitOrBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { arraySize as size } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'kron';\nvar dependencies = ['typed', 'matrix', 'multiplyScalar'];\nexport var createKron = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    multiplyScalar\n  } = _ref;\n\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 MatrixMatrix(x, y) {\n      return matrix(_kron(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return matrix(_kron(x.toArray(), y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return matrix(_kron(x, y.toArray()));\n    },\n    'Array, Array': _kron\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\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\n    if (size(b).length === 1) {\n      // Wrap it in a 2D Matrix\n      b = [b];\n    }\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 ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');\n    }\n\n    var t = [];\n    var r = [];\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});","import { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'transpose';\nvar dependencies = ['typed', 'matrix'];\nexport var createTranspose = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\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    Array: function Array(x) {\n      // use dense matrix implementation\n      return this(matrix(x)).valueOf();\n    },\n    Matrix: function Matrix(x) {\n      // matrix size\n      var size = x.size(); // result\n\n      var c; // process dimensions\n\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            var rows = size[0];\n            var columns = size[1]; // check columns\n\n            if (columns === 0) {\n              // throw exception\n              throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')');\n            } // process storage format\n\n\n            switch (x.storage()) {\n              case 'dense':\n                c = _denseTranspose(x, rows, columns);\n                break;\n\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\n      return c;\n    },\n    // scalars\n    any: function any(x) {\n      return clone(x);\n    }\n  });\n\n  function _denseTranspose(m, rows, columns) {\n    // matrix array\n    var data = m._data; // transposed matrix data\n\n    var transposed = [];\n    var transposedRow; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // initialize row\n      transposedRow = transposed[j] = []; // loop rows\n\n      for (var i = 0; i < rows; i++) {\n        // set data\n        transposedRow[i] = clone(data[i][j]);\n      }\n    } // return matrix\n\n\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    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // result matrices\n\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // row counts\n\n    var w = [];\n\n    for (var x = 0; x < rows; x++) {\n      w[x] = 0;\n    } // vars\n\n\n    var p, l, j; // loop values in matrix\n\n    for (p = 0, l = index.length; p < l; p++) {\n      // number of values in row\n      w[index[p]]++;\n    } // cumulative sum\n\n\n    var sum = 0; // initialize cptr with the cummulative sum of row counts\n\n    for (var i = 0; i < rows; i++) {\n      // update cptr\n      cptr.push(sum); // update sum\n\n      sum += w[i]; // update w\n\n      w[i] = cptr[i];\n    } // update cptr\n\n\n    cptr.push(sum); // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // values & index in column\n      for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {\n        // C values & index\n        var q = w[index[k]]++; // C[j, i] = A[i, j]\n\n        cindex[q] = j; // check we need to process values (pattern matrix)\n\n        if (values) {\n          cvalues[q] = clone(values[k]);\n        }\n      }\n    } // return matrix\n\n\n    return m.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [columns, rows],\n      datatype: m._datatype\n    });\n  }\n});","import { typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { noBignumber, noFraction } from '../../utils/noop.js';\nvar name = 'numeric';\nvar dependencies = ['number', '?bignumber', '?fraction'];\nexport var createNumeric = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    number: _number,\n    bignumber,\n    fraction\n  } = _ref;\n  var validInputTypes = {\n    string: true,\n    number: true,\n    BigNumber: true,\n    Fraction: true\n  }; // Load the conversion functions for each output type\n\n  var validOutputTypes = {\n    number: x => _number(x),\n    BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n    Fraction: fraction ? x => fraction(x) : noFraction\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\n  return function numeric(value, outputType) {\n    var 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\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});","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';\nvar name = 'and';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not'];\nexport var createAnd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    not\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': andNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return this(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm11(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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';\nvar name = 'smallerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createSmallerEq = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x <= y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x <= y || nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) !== 1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createSmallerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x <= y || nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { arraySize as size } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'sort';\nvar dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];\nexport var createSort = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    compare,\n    compareNatural\n  } = _ref;\n  var compareAsc = compare;\n\n  var compareDesc = (a, b) => -compare(a, b);\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\n\n  return typed(name, {\n    Array: function Array(x) {\n      _arrayIsVector(x);\n\n      return x.sort(compareAsc);\n    },\n    Matrix: function Matrix(x) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(compareAsc), x.storage());\n    },\n    'Array, function': function ArrayFunction(x, _comparator) {\n      _arrayIsVector(x);\n\n      return x.sort(_comparator);\n    },\n    'Matrix, function': function MatrixFunction(x, _comparator) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(_comparator), x.storage());\n    },\n    'Array, string': function ArrayString(x, order) {\n      _arrayIsVector(x);\n\n      return x.sort(_comparator(order));\n    },\n    'Matrix, string': function MatrixString(x, order) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(_comparator(order)), x.storage());\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\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   * 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\n\n  function _arrayIsVector(array) {\n    if (size(array).length !== 1) {\n      throw new Error('One dimensional array expected');\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\n\n  function _matrixIsVector(matrix) {\n    if (matrix.size().length !== 1) {\n      throw new Error('One dimensional matrix expected');\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cotNumber } from '../../plain/number/index.js';\nvar name = 'cot';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.cot();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.tan());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cot is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setDistinct';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetDistinct = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\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 ArrayMatrix(a) {\n      var result;\n\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return empty\n        result = [];\n      } else {\n        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        result = [];\n        result.push(b[0]);\n\n        for (var i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            result.push(b[i]);\n          }\n        }\n      } // return an array, if the input was an array\n\n\n      if (Array.isArray(a)) {\n        return result;\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(result);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setPowerset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetPowerset = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\n\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 ArrayMatrix(a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return empty\n        return [];\n      }\n\n      var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n      var result = [];\n      var number = 0;\n\n      while (number.toString(2).length <= b.length) {\n        result.push(_subset(b, number.toString(2).split('').reverse()));\n        number++;\n      } // can not return a matrix, because of the different size of the subarrays\n\n\n      return _sort(result);\n    }\n  }); // create subset\n\n  function _subset(array, bitarray) {\n    var result = [];\n\n    for (var i = 0; i < bitarray.length; i++) {\n      if (bitarray[i] === '1') {\n        result.push(array[i]);\n      }\n    }\n\n    return result;\n  } // sort subsests by length\n\n\n  function _sort(array) {\n    var temp = [];\n\n    for (var i = array.length - 1; i > 0; i--) {\n      for (var 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\n    return array;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { isBigNumber, isMatrix } from '../../../utils/is.js';\nvar name = 'index';\nvar dependencies = ['typed', 'Index'];\nexport var createIndex = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index\n  } = _ref;\n\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 numberStringBigNumberRangeArrayMatrix(args) {\n      var 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      var res = new Index();\n      Index.apply(res, ranges);\n      return res;\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'factorial';\nvar dependencies = ['typed', 'gamma'];\nexport var createFactorial = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    gamma\n  } = _ref;\n\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 number(n) {\n      if (n < 0) {\n        throw new Error('Value must be non-negative');\n      }\n\n      return gamma(n + 1);\n    },\n    BigNumber: function BigNumber(n) {\n      if (n.isNegative()) {\n        throw new Error('Value must be non-negative');\n      }\n\n      return gamma(n.plus(1));\n    },\n    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, this);\n    }\n  });\n});","import { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'permutations';\nvar dependencies = ['typed', 'factorial'];\nexport var createPermutations = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    factorial\n  } = _ref;\n\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 numberNumber(n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n\n      if (k > n) {\n        throw new TypeError('second argument k must be less than or equal to first argument n');\n      } // Permute n objects, k at a time\n\n\n      return product(n - k + 1, n);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var result, i;\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\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      var one = n.mul(0).add(1);\n      result = one;\n\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    } // 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 */\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\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';\nvar name = 'ceil';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];\nexport var createCeil = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('ceil', {\n    number: function number(x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return ceilNumber(x);\n      }\n    },\n    'number, number': function numberNumber(x, n) {\n      if (nearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        var [number, exponent] = \"\".concat(x, \"e\").split('e');\n        var result = Math.ceil(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n        [number, exponent] = \"\".concat(result, \"e\").split('e');\n        return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n      }\n    },\n    Complex: function Complex(x) {\n      return x.ceil();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      return x.ceil(n);\n    },\n    BigNumber: function BigNumber(x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.ceil();\n      }\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(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    Fraction: function Fraction(x) {\n      return x.ceil();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      return x.ceil(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, this, true);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => this(i, n), true);\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'subtract';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'addScalar', 'unaryMinus', 'DenseMatrix'];\nexport var createSubtract = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    addScalar,\n    unaryMinus,\n    DenseMatrix\n  } = _ref;\n  // TODO: split function subtract in two: subtract and subtractScalar\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x - y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.sub(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.minus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.sub(y);\n    },\n    'Unit, Unit': function UnitUnit(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      var res = x.clone();\n      res.value = this(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm05(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, unaryMinus(y), addScalar);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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 */\n\nfunction checkEqualDimensions(x, y) {\n  var xsize = x.size();\n  var ysize = y.size();\n\n  if (xsize.length !== ysize.length) {\n    throw new DimensionError(xsize.length, ysize.length);\n  }\n}","import { arraySize, squeeze } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'cross';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply'];\nexport var createCross = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    multiply\n  } = _ref;\n\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 MatrixMatrix(x, y) {\n      return matrix(_cross(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return matrix(_cross(x.toArray(), y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return matrix(_cross(x, y.toArray()));\n    },\n    'Array, Array': _cross\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\n  function _cross(x, y) {\n    var highestDimension = Math.max(arraySize(x).length, arraySize(y).length);\n    x = squeeze(x);\n    y = squeeze(y);\n    var xSize = arraySize(x);\n    var 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 ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');\n    }\n\n    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]))];\n\n    if (highestDimension > 1) {\n      return [product];\n    } else {\n      return product;\n    }\n  }\n});","import { deepForEach } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'prod';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];\nexport var createProd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    numeric\n  } = _ref;\n\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    // prod([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      // TODO: implement prod(A, dim)\n      throw new Error('prod(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], math.prod)\n    },\n    // prod(a, b, c, d, ...)\n    '...': function _(args) {\n      return _prod(args);\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\n  function _prod(array) {\n    var prod;\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    }); // make sure returning numeric value: parse a string into a numeric value\n\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});","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';\nvar name = 'equal';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createEqual = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y === null;\n      }\n\n      if (y === null) {\n        return x === null;\n      }\n\n      if (x === undefined) {\n        return y === undefined;\n      }\n\n      if (y === undefined) {\n        return x === undefined;\n      }\n\n      return equalScalar(x, y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, equalScalar);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, equalScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, equalScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, equalScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, equalScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, equalScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, equalScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, equalScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, equalScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, equalScalar, true).valueOf();\n    }\n  });\n});\nexport var createEqualNumber = factory(name, ['typed', 'equalScalar'], (_ref2) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref2;\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y === null;\n      }\n\n      if (y === null) {\n        return x === null;\n      }\n\n      if (x === undefined) {\n        return y === undefined;\n      }\n\n      if (y === undefined) {\n        return x === undefined;\n      }\n\n      return equalScalar(x, y);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setCartesian';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetCartesian = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\n  /**\n   * Create the cartesian product of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays 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   *\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 ArrayMatrixArrayMatrix(a1, a2) {\n      var result = [];\n\n      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {\n        // if any of them is empty, return empty\n        var b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);\n        var b2 = flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);\n        result = [];\n\n        for (var i = 0; i < b1.length; i++) {\n          for (var j = 0; j < b2.length; j++) {\n            result.push([b1[i], b2[j]]);\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return result;\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(result);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setSymDifference';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];\nexport var createSetSymDifference = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    concat,\n    subset,\n    setDifference,\n    Index\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // 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\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setDifference(b1, b2), setDifference(b2, b1));\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'fix';\nvar dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor'];\nexport var createFix = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Complex: _Complex,\n    matrix,\n    ceil,\n    floor\n  } = _ref;\n  var algorithm14 = createAlgorithm14({\n    typed\n  });\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\n  return typed('fix', {\n    number: function number(x) {\n      return x > 0 ? floor(x) : ceil(x);\n    },\n    'number, number | BigNumber': function numberNumberBigNumber(x, n) {\n      return x > 0 ? floor(x, n) : ceil(x, n);\n    },\n    Complex: function Complex(x) {\n      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));\n    },\n    'Complex, number | BigNumber': function ComplexNumberBigNumber(x, n) {\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));\n    },\n    BigNumber: function BigNumber(x) {\n      return x.isNegative() ? ceil(x) : floor(x);\n    },\n    'BigNumber, number | BigNumber': function BigNumberNumberBigNumber(x, n) {\n      return x.isNegative() ? ceil(x, n) : floor(x, n);\n    },\n    Fraction: function Fraction(x) {\n      return x.s < 0 ? x.ceil() : x.floor();\n    },\n    'Fraction, number | BigNumber': function FractionNumberBigNumber(x, n) {\n      return x.s < 0 ? x.ceil(n) : x.floor(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, this, true);\n    },\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(x, n) {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, i => this(i, n), true);\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'ctranspose';\nvar dependencies = ['typed', 'transpose', 'conj'];\nexport var createCtranspose = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    transpose,\n    conj\n  } = _ref;\n\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 any(x) {\n      return conj(transpose(x));\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'deepEqual';\nvar dependencies = ['typed', 'equal'];\nexport var createDeepEqual = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equal\n  } = _ref;\n\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 anyAny(x, y) {\n      return _deepEqual(x.valueOf(), y.valueOf());\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\n  function _deepEqual(x, y) {\n    if (Array.isArray(x)) {\n      if (Array.isArray(y)) {\n        var len = x.length;\n\n        if (len !== y.length) {\n          return false;\n        }\n\n        for (var 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});","import { flatten, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setIsSubset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // empty is a subset of anything\n        return true;\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        // anything is not a subset of empty\n        return false;\n      }\n\n      var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n      var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n      var inb2;\n\n      for (var i = 0; i < b1.length; i++) {\n        inb2 = false;\n\n        for (var j = 0; j < b2.length; j++) {\n          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n            // the identifier is always a decimal int\n            inb2 = true;\n            break;\n          }\n        }\n\n        if (inb2 === false) {\n          return false;\n        }\n      }\n\n      return true;\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';\nvar name = 'xor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix'];\nexport var createXor = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': xorNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return this(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'divideScalar';\nvar dependencies = ['typed', 'numeric'];\nexport var createDivideScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    numeric\n  } = _ref;\n\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 numberNumber(x, y) {\n      return x / y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.div(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.div(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.div(y);\n    },\n    'Unit, number | Fraction | BigNumber': function UnitNumberFractionBigNumber(x, y) {\n      var res = x.clone(); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n      var one = numeric(1, typeOf(y));\n      res.value = this(res.value === null ? res._normalize(one) : res.value, y);\n      return res;\n    },\n    'number | Fraction | BigNumber, Unit': function numberFractionBigNumberUnit(x, y) {\n      var res = y.clone();\n      res = res.pow(-1); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n      var one = numeric(1, typeOf(x));\n      res.value = this(x, y.value === null ? y._normalize(one) : y.value);\n      return res;\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return x.divide(y);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'nthRoots';\nvar dependencies = ['config', 'typed', 'divideScalar', 'Complex'];\nexport var createNthRoots = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    Complex\n  } = _ref;\n\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  var _calculateExactResult = [function realPos(val) {\n    return new Complex(val, 0);\n  }, function imagPos(val) {\n    return new Complex(0, val);\n  }, function realNeg(val) {\n    return new Complex(-val, 0);\n  }, function imagNeg(val) {\n    return new Complex(0, -val);\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\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    var aIsNumeric = typeof a === 'number';\n    var offset; // determine the offset (argument of a)/(pi/2)\n\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\n    var arg = a.arg();\n    var abs = a.abs();\n    var roots = [];\n    var r = Math.pow(abs, 1 / root);\n\n    for (var k = 0; k < root; k++) {\n      var 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\n      if (halfPiFactor === Math.round(halfPiFactor)) {\n        roots.push(_calculateExactResult[halfPiFactor % 4](r));\n        continue;\n      }\n\n      roots.push(new Complex({\n        r: r,\n        phi: (arg + 2 * Math.PI * k) / root\n      }));\n    }\n\n    return roots;\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\n\n  return typed(name, {\n    Complex: function Complex(x) {\n      return _nthComplexRoots(x, 2);\n    },\n    'Complex, number': _nthComplexRoots\n  });\n});","import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js';\nimport { arraySize } from '../../../../utils/array.js';\nimport { format } from '../../../../utils/string.js';\nexport function createSolveValidation(_ref) {\n  var {\n    DenseMatrix\n  } = _ref;\n\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    var mSize = m.size();\n\n    if (mSize.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')');\n    }\n\n    var rows = mSize[0];\n    var columns = mSize[1];\n\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')');\n    }\n\n    var data = [];\n\n    if (isMatrix(b)) {\n      var bSize = b.size();\n      var bdata = b._data; // 1-dim vector\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 (var 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      } // 2-dim column\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        if (isDenseMatrix(b)) {\n          if (copy) {\n            data = [];\n\n            for (var _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 (var _i2 = 0; _i2 < rows; _i2++) {\n            data[_i2] = [0];\n          }\n\n          var values = b._values;\n          var index = b._index;\n          var ptr = b._ptr;\n\n          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n            var _i3 = index[k];\n            data[_i3][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      var 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 (var _i4 = 0; _i4 < rows; _i4++) {\n          data[_i4] = [b[_i4]];\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 (var _i5 = 0; _i5 < rows; _i5++) {\n          data[_i5] = [b[_i5][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}","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'lsolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createLsolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var r = _denseForwardSubstitution(m, b);\n\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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // result\n\n    var x = [];\n    var mdata = m._data; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      var bj = bdata[j][0] || 0;\n      var xj = void 0;\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n        var 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); // loop rows\n\n        for (var 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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // result\n\n    var x = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      var bj = bdata[j][0] || 0;\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n        var vjj = 0; // matrix values & indices (column j)\n\n        var jValues = [];\n        var jIndices = []; // first and last index in the column\n\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j]\n\n        for (var k = firstIndex; k < lastIndex; k++) {\n          var i = index[k]; // check row (rows are not sorted!)\n\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        } // at this point we must have a value in vjj\n\n\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n\n        var xj = divideScalar(bj, vjj);\n\n        for (var _k = 0, l = jIndices.length; _k < l; _k++) {\n          var _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});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'lsolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createLsolveAll = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var R = _denseForwardSubstitution(m, b);\n\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/project/5e6c87c554a3190001a3fc93\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // loop columns\n\n    for (var i = 0; i < columns; i++) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n          b[i] = divideScalar(b[i], M[i][i]);\n\n          for (var 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          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          var bNew = [...b];\n          bNew[i] = 1;\n\n          for (var _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({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n\n  function _sparseForwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // loop columns\n\n    for (var i = 0; i < columns; i++) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k]; // values & indices (column i)\n\n        var iValues = [];\n        var iIndices = []; // first & last indeces in column\n\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1]; // find the value at [i, i]\n\n        var Mii = 0;\n\n        for (var j = firstIndex; j < lastIndex; j++) {\n          var J = index[j]; // check row\n\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          b[i] = divideScalar(b[i], Mii);\n\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\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          var bNew = [...b];\n          bNew[i] = 1;\n\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);\n          }\n\n          B.push(bNew);\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Spa';\nvar dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];\nexport var createSpaClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    addScalar,\n    equalScalar,\n    FibonacciHeap\n  } = _ref;\n\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)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // allocate vector, TODO use typed arrays\n\n\n    this._values = [];\n    this._heap = new FibonacciHeap();\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Spa.prototype.type = 'Spa';\n  Spa.prototype.isSpa = true;\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\n  Spa.prototype.set = function (i, v) {\n    // check we have a value @ i\n    if (!this._values[i]) {\n      // insert in heap\n      var node = this._heap.insert(i, v); // set the value @ i\n\n\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    var node = this._values[i];\n\n    if (node) {\n      return node.value;\n    }\n\n    return 0;\n  };\n\n  Spa.prototype.accumulate = function (i, v) {\n    // node @ i\n    var node = this._values[i];\n\n    if (!node) {\n      // insert in heap\n      node = this._heap.insert(i, v); // initialize value\n\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    var heap = this._heap;\n    var values = this._values; // nodes\n\n    var nodes = []; // node with minimum key, save it\n\n    var node = heap.extractMinimum();\n\n    if (node) {\n      nodes.push(node);\n    } // extract nodes from heap (ordered)\n\n\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      } // extract next node, save it\n\n\n      node = heap.extractMinimum();\n\n      if (node) {\n        nodes.push(node);\n      }\n    } // reinsert all nodes in heap\n\n\n    for (var i = 0; i < nodes.length; i++) {\n      // current node\n      var n = nodes[i]; // insert node in heap\n\n      node = heap.insert(n.key, n.value); // update values\n\n      values[node.key] = node;\n    }\n  };\n\n  Spa.prototype.swap = function (i, j) {\n    // node @ i and j\n    var nodei = this._values[i];\n    var nodej = this._values[j]; // check we need to insert indeces\n\n    if (!nodei && nodej) {\n      // insert in heap\n      nodei = this._heap.insert(i, nodej.value); // remove from heap\n\n      this._heap.remove(nodej); // set values\n\n\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); // remove from heap\n\n      this._heap.remove(nodei); // set values\n\n\n      this._values[j] = nodej;\n      this._values[i] = undefined;\n    } else if (nodei && nodej) {\n      // swap values\n      var v = nodei.value;\n      nodei.value = nodej.value;\n      nodej.value = v;\n    }\n  };\n\n  return Spa;\n}, {\n  isClass: true\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setUnion';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];\nexport var createSetUnion = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    concat,\n    subset,\n    setIntersect,\n    setSymDifference,\n    Index\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // 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\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));\n    }\n  });\n});","import { clone } from '../../../utils/object.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'lup';\nvar dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];\nexport var createLup = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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    DenseMatrix: function DenseMatrix(m) {\n      return _denseLUP(m);\n    },\n    SparseMatrix: function SparseMatrix(m) {\n      return _sparseLUP(m);\n    },\n    Array: function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a); // lup, use matrix implementation\n\n      var r = _denseLUP(m); // result\n\n\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    var rows = m._size[0];\n    var columns = m._size[1]; // minimum rows and columns\n\n    var n = Math.min(rows, columns); // matrix array, clone original data\n\n    var data = clone(m._data); // l matrix arrays\n\n    var ldata = [];\n    var lsize = [rows, n]; // u matrix arrays\n\n    var udata = [];\n    var usize = [n, columns]; // vars\n\n    var i, j, k; // permutation vector\n\n    var p = [];\n\n    for (i = 0; i < rows; i++) {\n      p[i] = i;\n    } // loop columns\n\n\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          var min = Math.min(i, j); // v[i, j]\n\n          var s = 0; // loop up to min\n\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\n          data[i][j] = subtract(data[i][j], s);\n        }\n      } // row with larger value in cvector, row >= j\n\n\n      var pi = j;\n      var pabsv = 0;\n      var vjj = 0; // loop rows\n\n      for (i = j; i < rows; i++) {\n        // data @ i, j\n        var v = data[i][j]; // absolute value\n\n        var absv = abs(v); // value is greater than pivote value\n\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = i; // update max value\n\n          pabsv = absv; // value @ [j, j]\n\n          vjj = v;\n        }\n      } // swap rows (j <-> pi)\n\n\n      if (j !== pi) {\n        // swap values j <-> pi in p\n        p[j] = [p[pi], p[pi] = p[j]][0]; // swap j <-> pi in data\n\n        DenseMatrix._swapRows(j, pi, data);\n      } // check column is in lower triangular matrix\n\n\n      if (j < rows) {\n        // loop rows (lower triangular matrix)\n        for (i = j + 1; i < rows; i++) {\n          // value @ i, j\n          var vij = data[i][j];\n\n          if (!equalScalar(vij, 0)) {\n            // update data\n            data[i][j] = divideScalar(data[i][j], vjj);\n          }\n        }\n      }\n    } // loop columns\n\n\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          } // L\n\n\n          ldata[i] = [];\n        } // check we are in the upper triangular matrix\n\n\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          } // check column exists in lower triangular matrix\n\n\n          if (j < rows) {\n            // L\n            ldata[i][j] = 0;\n          }\n\n          continue;\n        } // diagonal value\n\n\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          } // check column exists in lower triangular matrix\n\n\n          if (j < rows) {\n            // L\n            ldata[i][j] = 1;\n          }\n\n          continue;\n        } // check row exists in upper triangular matrix\n\n\n        if (i < columns) {\n          // U\n          udata[i][j] = 0;\n        } // check column exists in lower triangular matrix\n\n\n        if (j < rows) {\n          // L\n          ldata[i][j] = data[i][j];\n        }\n      }\n    } // l matrix\n\n\n    var l = new DenseMatrix({\n      data: ldata,\n      size: lsize\n    }); // u matrix\n\n    var u = new DenseMatrix({\n      data: udata,\n      size: usize\n    }); // p vector\n\n    var pv = [];\n\n    for (i = 0, n = p.length; i < n; i++) {\n      pv[p[i]] = i;\n    } // return matrices\n\n\n    return {\n      L: l,\n      U: u,\n      p: pv,\n      toString: function toString() {\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    var rows = m._size[0];\n    var columns = m._size[1]; // minimum rows and columns\n\n    var n = Math.min(rows, columns); // matrix arrays (will not be modified, thanks to permutation vector)\n\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // l matrix arrays\n\n    var lvalues = [];\n    var lindex = [];\n    var lptr = [];\n    var lsize = [rows, n]; // u matrix arrays\n\n    var uvalues = [];\n    var uindex = [];\n    var uptr = [];\n    var usize = [n, columns]; // vars\n\n    var i, j, k; // permutation vectors, (current index -> original index) and (original index -> current index)\n\n    var pvCo = [];\n    var pvOc = [];\n\n    for (i = 0; i < rows; i++) {\n      pvCo[i] = i;\n      pvOc[i] = i;\n    } // swap indices in permutation vectors (condition x < y)!\n\n\n    var swapIndeces = function swapIndeces(x, y) {\n      // find pv indeces getting data from x and y\n      var kx = pvOc[x];\n      var ky = pvOc[y]; // update permutation vector current -> original\n\n      pvCo[kx] = y;\n      pvCo[ky] = x; // update permutation vector original -> current\n\n      pvOc[x] = ky;\n      pvOc[y] = kx;\n    }; // loop columns\n\n\n    var _loop = function _loop() {\n      // sparse accumulator\n      var spa = new Spa(); // check lower triangular matrix has a value @ column j\n\n      if (j < rows) {\n        // update ptr\n        lptr.push(lvalues.length); // first value in j column for lower triangular matrix\n\n        lvalues.push(1);\n        lindex.push(j);\n      } // update ptr\n\n\n      uptr.push(uvalues.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // copy column j into sparse accumulator\n\n      for (k = k0; k < k1; k++) {\n        // row\n        i = index[k]; // copy column values into sparse accumulator (use permutation vector)\n\n        spa.set(pvCo[i], values[k]);\n      } // skip first column in upper triangular matrix\n\n\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      } // row with larger value in spa, row >= j\n\n\n      var pi = j;\n      var vjj = spa.get(j);\n      var pabsv = abs(vjj); // loop values in spa (order by row, below diagonal)\n\n      spa.forEach(j + 1, rows - 1, function (x, v) {\n        // absolute value\n        var absv = abs(v); // value is greater than pivote value\n\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = x; // update max value\n\n          pabsv = absv; // value @ [j, j]\n\n          vjj = v;\n        }\n      }); // swap rows (j <-> pi)\n\n      if (j !== pi) {\n        // swap values j <-> pi in L\n        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); // swap values j <-> pi in U\n\n\n        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); // swap values in spa\n\n\n        spa.swap(j, pi); // update permutation vector (swap values @ j, pi)\n\n        swapIndeces(j, pi);\n      } // loop values in spa (order by row)\n\n\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); // check value is non zero\n\n          if (!equalScalar(v, 0)) {\n            // update lower triangular matrix\n            lvalues.push(v);\n            lindex.push(x);\n          }\n        }\n      });\n    };\n\n    for (j = 0; j < columns; j++) {\n      _loop();\n    } // update ptrs\n\n\n    uptr.push(uvalues.length);\n    lptr.push(lvalues.length); // return matrices\n\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 toString() {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p;\n      }\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  var top = 0; // place j on the stack\n\n  w[stack] = j; // while (stack is not empty)\n\n  while (top >= 0) {\n    // p = top of stack\n    var p = w[stack + top]; // i = youngest child of p\n\n    var i = w[head + p];\n\n    if (i === -1) {\n      // p has no unordered children left\n      top--; // node p is the kth postordered node\n\n      post[k++] = p;\n    } else {\n      // remove i from children of p\n      w[head + p] = w[next + i]; // increment top\n\n      ++top; // start dfs on child node i\n\n      w[stack + top] = i;\n    }\n  }\n\n  return k;\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}","import { factory } from '../../../utils/factory.js';\nimport { csFkeep } from './csFkeep.js';\nimport { csFlip } from './csFlip.js';\nimport { csTdfs } from './csTdfs.js';\nvar name = 'csAmd';\nvar dependencies = ['add', 'multiply', 'transpose'];\nexport var createCsAmd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    add,\n    multiply,\n    transpose\n  } = _ref;\n\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) {\n      return null;\n    } // a matrix arrays\n\n\n    var asize = a._size; // rows and columns\n\n    var m = asize[0];\n    var n = asize[1]; // initialize vars\n\n    var lemax = 0; // dense threshold\n\n    var dense = Math.max(16, 10 * Math.sqrt(n));\n    dense = Math.min(n - 2, dense); // create target matrix C\n\n    var cm = _createTargetMatrix(order, a, m, n, dense); // drop diagonal entries\n\n\n    csFkeep(cm, _diag, null); // C matrix arrays\n\n    var cindex = cm._index;\n    var cptr = cm._ptr; // number of nonzero elements in C\n\n    var cnz = cptr[n]; // allocate result (n+1)\n\n    var P = []; // create workspace (8 * (n + 1))\n\n    var W = [];\n    var len = 0; // first n + 1 entries\n\n    var nv = n + 1; // next n + 1 entries\n\n    var next = 2 * (n + 1); // next n + 1 entries\n\n    var head = 3 * (n + 1); // next n + 1 entries\n\n    var elen = 4 * (n + 1); // next n + 1 entries\n\n    var degree = 5 * (n + 1); // next n + 1 entries\n\n    var w = 6 * (n + 1); // next n + 1 entries\n\n    var hhead = 7 * (n + 1); // last n + 1 entries\n    // use P as workspace for last\n\n    var last = P; // initialize quotient graph\n\n    var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree); // initialize degree lists\n\n\n    var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next); // minimum degree node\n\n\n    var mindeg = 0; // vars\n\n    var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d; // while (selecting pivots) do\n\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        ;\n      }\n\n      if (W[next + k] !== -1) {\n        last[W[next + k]] = -1;\n      } // remove k from degree list\n\n\n      W[head + mindeg] = W[next + k]; // elenk = |Ek|\n\n      var elenk = W[elen + k]; // # of nodes k represents\n\n      var nvk = W[nv + k]; // W[nv + k] nodes of A eliminated\n\n      nel += nvk; // 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\n      var dk = 0; // flag k as in Lk\n\n      W[nv + k] = -nvk;\n      var p = cptr[k]; // do in place if W[elen + k] === 0\n\n      var pk1 = elenk === 0 ? p : cnz;\n      var pk2 = pk1;\n\n      for (k1 = 1; k1 <= elenk + 1; k1++) {\n        if (k1 > elenk) {\n          // search the nodes in k\n          e = k; // list of nodes starts at cindex[pj]\n\n          pj = p; // length of list of nodes in k\n\n          ln = W[len + k] - elenk;\n        } else {\n          // search the nodes in e\n          e = cindex[p++];\n          pj = cptr[e]; // length of list of nodes in e\n\n          ln = W[len + e];\n        }\n\n        for (k2 = 1; k2 <= ln; k2++) {\n          i = cindex[pj++]; // check  node i dead, or seen\n\n          if ((nvi = W[nv + i]) <= 0) {\n            continue;\n          } // W[degree + Lk] += size of node i\n\n\n          dk += nvi; // negate W[nv + i] to denote i in Lk\n\n          W[nv + i] = -nvi; // place i in Lk\n\n          cindex[pk2++] = i;\n\n          if (W[next + i] !== -1) {\n            last[W[next + i]] = last[i];\n          } // check we need to remove i from degree list\n\n\n          if (last[i] !== -1) {\n            W[next + last[i]] = W[next + i];\n          } else {\n            W[head + W[degree + i]] = W[next + i];\n          }\n        }\n\n        if (e !== k) {\n          // absorb e into k\n          cptr[e] = csFlip(k); // e is now a dead element\n\n          W[w + e] = 0;\n        }\n      } // cindex[cnz...nzmax] is free\n\n\n      if (elenk !== 0) {\n        cnz = pk2;\n      } // external degree of k - |Lk\\i|\n\n\n      W[degree + k] = dk; // element k is in cindex[pk1..pk2-1]\n\n      cptr[k] = pk1;\n      W[len + k] = pk2 - pk1; // k is now an element\n\n      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\n      // scan, no entry in the w array is greater than or equal to mark.\n      // clear w if necessary\n\n      mark = _wclear(mark, lemax, W, w, n); // scan 1: find |Le\\Lk|\n\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check if W[elen + i] empty, skip it\n\n        if ((eln = W[elen + i]) <= 0) {\n          continue;\n        } // W[nv + i] was negated\n\n\n        nvi = -W[nv + i];\n        var wnvi = mark - nvi; // scan Ei\n\n        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {\n          e = cindex[p];\n\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      } // 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      // scan2: degree update\n\n\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; // scan Ei\n\n        for (h = 0, d = 0, p = p1; p <= p2; p++) {\n          e = cindex[p]; // check e is an unabsorbed element\n\n          if (W[w + e] !== 0) {\n            // dext = |Le\\Lk|\n            var dext = W[w + e] - mark;\n\n            if (dext > 0) {\n              // sum up the set differences\n              d += dext; // keep e in Ei\n\n              cindex[pn++] = e; // compute the hash of node i\n\n              h += e;\n            } else {\n              // aggressive absorb. e->k\n              cptr[e] = csFlip(k); // e is a dead element\n\n              W[w + e] = 0;\n            }\n          }\n        } // W[elen + i] = |Ei|\n\n\n        W[elen + i] = pn - p1 + 1;\n        var p3 = pn;\n        var p4 = p1 + W[len + i]; // prune edges in Ai\n\n        for (p = p2 + 1; p < p4; p++) {\n          j = cindex[p]; // check node j dead or in Lk\n\n          var nvj = W[nv + j];\n\n          if (nvj <= 0) {\n            continue;\n          } // degree(i) += |j|\n\n\n          d += nvj; // place j in node list of i\n\n          cindex[pn++] = j; // compute hash for node i\n\n          h += j;\n        } // check for mass elimination\n\n\n        if (d === 0) {\n          // absorb i into k\n          cptr[i] = csFlip(k);\n          nvi = -W[nv + i]; // |Lk| -= |i|\n\n          dk -= nvi; // |k| += W[nv + i]\n\n          nvk += nvi;\n          nel += nvi;\n          W[nv + i] = 0; // node i is dead\n\n          W[elen + i] = -1;\n        } else {\n          // update degree(i)\n          W[degree + i] = Math.min(W[degree + i], d); // move first node to end\n\n          cindex[pn] = cindex[p3]; // move 1st el. to end of Ei\n\n          cindex[p3] = cindex[p1]; // add k as 1st element in of Ei\n\n          cindex[p1] = k; // new len of adj. list of node i\n\n          W[len + i] = pn - p1 + 1; // finalize hash of i\n\n          h = (h < 0 ? -h : h) % n; // place i in hash bucket\n\n          W[next + i] = W[hhead + h];\n          W[hhead + h] = i; // save hash of i in last[i]\n\n          last[i] = h;\n        }\n      } // finalize |Lk|\n\n\n      W[degree + k] = dk;\n      lemax = Math.max(lemax, dk); // clear w\n\n      mark = _wclear(mark + lemax, lemax, W, w, 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\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check i is dead, skip it\n\n        if (W[nv + i] >= 0) {\n          continue;\n        } // scan hash bucket of node i\n\n\n        h = last[i];\n        i = W[hhead + h]; // hash bucket will be empty\n\n        W[hhead + h] = -1;\n\n        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {\n          ln = W[len + i];\n          eln = W[elen + i];\n\n          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {\n            W[w + cindex[p]] = mark;\n          }\n\n          var jlast = i; // compare i with all j\n\n          for (j = W[next + i]; j !== -1;) {\n            var ok = W[len + j] === ln && W[elen + j] === eln;\n\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) {\n                ok = 0;\n              }\n            } // check i and j are identical\n\n\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; // node j is dead\n\n              W[elen + j] = -1; // delete j from hash bucket\n\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      } // 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\n\n      for (p = pk1, pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check  i is dead, skip it\n\n        if ((nvi = -W[nv + i]) <= 0) {\n          continue;\n        } // restore W[nv + i]\n\n\n        W[nv + i] = nvi; // compute external degree(i)\n\n        d = W[degree + i] + dk - nvi;\n        d = Math.min(d, n - nel - nvi);\n\n        if (W[head + d] !== -1) {\n          last[W[head + d]] = i;\n        } // put i back in degree list\n\n\n        W[next + i] = W[head + d];\n        last[i] = -1;\n        W[head + d] = i; // find new minimum degree\n\n        mindeg = Math.min(mindeg, d);\n        W[degree + i] = d; // place i in Lk\n\n        cindex[p++] = i;\n      } // # nodes absorbed into k\n\n\n      W[nv + k] = nvk; // length of adj list of element k\n\n      if ((W[len + k] = p - pk1) === 0) {\n        // k is a root of the tree\n        cptr[k] = -1; // k is now a dead element\n\n        W[w + k] = 0;\n      }\n\n      if (elenk !== 0) {\n        // free unused space in Lk\n        cnz = p;\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    // fix assembly tree\n\n\n    for (i = 0; i < n; i++) {\n      cptr[i] = csFlip(cptr[i]);\n    }\n\n    for (j = 0; j <= n; j++) {\n      W[head + j] = -1;\n    } // place unordered nodes in lists\n\n\n    for (j = n; j >= 0; j--) {\n      // skip if j is an element\n      if (W[nv + j] > 0) {\n        continue;\n      } // place j in list of its parent\n\n\n      W[next + j] = W[head + cptr[j]];\n      W[head + cptr[j]] = j;\n    } // place elements in lists\n\n\n    for (e = n; e >= 0; e--) {\n      // skip unless e is an element\n      if (W[nv + e] <= 0) {\n        continue;\n      }\n\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    } // postorder the assembly tree\n\n\n    for (k = 0, i = 0; i <= n; i++) {\n      if (cptr[i] === -1) {\n        k = csTdfs(i, k, W, head, next, P, w);\n      }\n    } // remove last item in array\n\n\n    P.splice(P.length - 1, 1); // return P\n\n    return P;\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\n  function _createTargetMatrix(order, a, m, n, dense) {\n    // compute A'\n    var at = transpose(a); // check order = 1, matrix must be square\n\n    if (order === 1 && n === m) {\n      // C = A + A'\n      return add(a, at);\n    } // check order = 2, drop dense columns from M'\n\n\n    if (order === 2) {\n      // transpose arrays\n      var tindex = at._index;\n      var tptr = at._ptr; // new column index\n\n      var p2 = 0; // loop A' columns (rows)\n\n      for (var j = 0; j < m; j++) {\n        // column j of AT starts here\n        var p = tptr[j]; // new column j starts here\n\n        tptr[j] = p2; // skip dense col j\n\n        if (tptr[j + 1] - p > dense) {\n          continue;\n        } // map rows in column j of A\n\n\n        for (var p1 = tptr[j + 1]; p < p1; p++) {\n          tindex[p2++] = tindex[p];\n        }\n      } // finalize AT\n\n\n      tptr[m] = p2; // recreate A from new transpose matrix\n\n      a = transpose(at); // use A' * A\n\n      return multiply(at, a);\n    } // use A' * A, square or rectangular matrix\n\n\n    return multiply(at, a);\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\n\n  function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {\n    // Initialize quotient graph\n    for (var k = 0; k < n; k++) {\n      W[len + k] = cptr[k + 1] - cptr[k];\n    }\n\n    W[len + n] = 0; // initialize workspace\n\n    for (var 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; // hash list i is empty\n\n      W[hhead + i] = -1; // node i is just one node\n\n      W[nv + i] = 1; // node i is alive\n\n      W[w + i] = 1; // Ek of node i is empty\n\n      W[elen + i] = 0; // degree of node i\n\n      W[degree + i] = W[len + i];\n    } // clear w\n\n\n    var mark = _wclear(0, 0, W, w, n); // n is a dead element\n\n\n    W[elen + n] = -2; // n is a root of assembly tree\n\n    cptr[n] = -1; // n is a dead element\n\n    W[w + n] = 0; // return mark\n\n    return mark;\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\n\n  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {\n    // result\n    var nel = 0; // loop columns\n\n    for (var i = 0; i < n; i++) {\n      // degree @ i\n      var d = W[degree + i]; // check node i is empty\n\n      if (d === 0) {\n        // element i is dead\n        W[elen + i] = -2;\n        nel++; // i is a root of assembly tree\n\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; // node i is dead\n\n        W[elen + i] = -1;\n        nel++;\n        cptr[i] = csFlip(n);\n        W[nv + n]++;\n      } else {\n        var h = W[head + d];\n\n        if (h !== -1) {\n          last[h] = i;\n        } // put node i in degree list d\n\n\n        W[next + i] = W[head + d];\n        W[head + d] = i;\n      }\n    }\n\n    return nel;\n  }\n\n  function _wclear(mark, lemax, W, w, n) {\n    if (mark < 2 || mark + lemax < 0) {\n      for (var k = 0; k < n; k++) {\n        if (W[w + k] !== 0) {\n          W[w + k] = 1;\n        }\n      }\n\n      mark = 2;\n    } // at this point, W [0..n-1] < mark holds\n\n\n    return mark;\n  }\n\n  function _diag(i, j) {\n    return i !== j;\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  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size; // columns\n\n  var n = asize[1]; // nonzero items\n\n  var nz = 0; // loop columns\n\n  for (var j = 0; j < n; j++) {\n    // get current location of col j\n    var p = aptr[j]; // record new location of col j\n\n    aptr[j] = nz;\n\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]; // check we need to process values (pattern only)\n\n        if (avalues) {\n          avalues[nz] = avalues[p];\n        } // increment nonzero items\n\n\n        nz++;\n      }\n    }\n  } // finalize A\n\n\n  aptr[n] = nz; // trim arrays\n\n  aindex.splice(nz, aindex.length - nz); // check we need to process values (pattern only)\n\n  if (avalues) {\n    avalues.splice(nz, avalues.length - nz);\n  } // return number of nonzero items\n\n\n  return nz;\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  var s, sparent; // our result\n\n  var jleaf = 0;\n  var q; // check j is a leaf\n\n  if (i <= j || w[first + j] <= w[maxfirst + i]) {\n    return -1;\n  } // update max first[j] seen so far\n\n\n  w[maxfirst + i] = w[first + j]; // jprev = previous leaf of ith subtree\n\n  var jprev = w[prevleaf + i];\n  w[prevleaf + i] = j; // check j is first or subsequent leaf\n\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; // q = least common ancester (jprev,j)\n\n    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]) {\n      ;\n    }\n\n    for (s = jprev; s !== q; s = sparent) {\n      // path compression\n      sparent = w[ancestor + s];\n      w[ancestor + s] = q;\n    }\n  }\n\n  return {\n    jleaf: jleaf,\n    q: q\n  };\n}","import { factory } from '../../../utils/factory.js';\nimport { csLeaf } from './csLeaf.js';\nvar name = 'csCounts';\nvar dependencies = ['transpose'];\nexport var createCsCounts = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    transpose\n  } = _ref;\n\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) {\n      return null;\n    } // a matrix arrays\n\n\n    var asize = a._size; // rows and columns\n\n    var m = asize[0];\n    var n = asize[1]; // variables\n\n    var i, j, k, J, p, p0, p1; // workspace size\n\n    var s = 4 * n + (ata ? n + m + 1 : 0); // allocate workspace\n\n    var w = []; // (s)\n\n    var ancestor = 0; // first n entries\n\n    var maxfirst = n; // next n entries\n\n    var prevleaf = 2 * n; // next n entries\n\n    var first = 3 * n; // next n entries\n\n    var head = 4 * n; // next n + 1 entries (used when ata is true)\n\n    var next = 5 * n + 1; // last entries in workspace\n    // clear workspace w[0..s-1]\n\n    for (k = 0; k < s; k++) {\n      w[k] = -1;\n    } // allocate result\n\n\n    var colcount = []; // (n)\n    // AT = A'\n\n    var at = transpose(a); // at arrays\n\n    var tindex = at._index;\n    var tptr = at._ptr; // find w[first + j]\n\n    for (k = 0; k < n; k++) {\n      j = post[k]; // colcount[j]=1 if j is a leaf\n\n      colcount[j] = w[first + j] === -1 ? 1 : 0;\n\n      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {\n        w[first + j] = k;\n      }\n    } // initialize ata if needed\n\n\n    if (ata) {\n      // invert post\n      for (k = 0; k < n; k++) {\n        w[post[k]] = k;\n      } // loop rows (columns in AT)\n\n\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++) {\n          k = Math.min(k, w[tindex[p]]);\n        } // place row i in linked list k\n\n\n        w[next + i] = w[head + k];\n        w[head + k] = i;\n      }\n    } // each node in its own set\n\n\n    for (i = 0; i < n; i++) {\n      w[ancestor + i] = i;\n    }\n\n    for (k = 0; k < n; k++) {\n      // j is the kth node in postordered etree\n      j = post[k]; // check j is not a root\n\n      if (parent[j] !== -1) {\n        colcount[parent[j]]--;\n      } // J=j for LL'=A case\n\n\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          var r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor); // check A(i,j) is in skeleton\n\n          if (r.jleaf >= 1) {\n            colcount[j]++;\n          } // check account for overlap in q\n\n\n          if (r.jleaf === 2) {\n            colcount[r.q]--;\n          }\n        }\n      }\n\n      if (parent[j] !== -1) {\n        w[ancestor + j] = parent[j];\n      }\n    } // sum up colcount's of each child\n\n\n    for (j = 0; j < n; j++) {\n      if (parent[j] !== -1) {\n        colcount[parent[j]] += colcount[j];\n      }\n    }\n\n    return colcount;\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';\nvar name = 'csSqr';\nvar dependencies = ['add', 'multiply', 'transpose'];\nexport var createCsSqr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    add,\n    multiply,\n    transpose\n  } = _ref;\n  var csAmd = createCsAmd({\n    add,\n    multiply,\n    transpose\n  });\n  var csCounts = createCsCounts({\n    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\n  return function csSqr(order, a, qr) {\n    // a arrays\n    var aptr = a._ptr;\n    var asize = a._size; // columns\n\n    var n = asize[1]; // vars\n\n    var k; // symbolic analysis result\n\n    var s = {}; // fill-reducing ordering\n\n    s.q = csAmd(order, a); // validate results\n\n    if (order && !s.q) {\n      return null;\n    } // QR symbolic analysis\n\n\n    if (qr) {\n      // apply permutations if needed\n      var c = order ? csPermute(a, null, s.q, 0) : a; // etree of C'*C, where C=A(:,q)\n\n      s.parent = csEtree(c, 1); // post order elimination tree\n\n      var post = csPost(s.parent, n); // col counts chol(C'*C)\n\n      s.cp = csCounts(c, s.parent, post, 1); // check we have everything needed to calculate number of nonzero elements\n\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++) {\n          s.unz += s.cp[k];\n        }\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    } // return result S\n\n\n    return s;\n  };\n  /**\n   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent\n   */\n\n  function _vcount(a, s) {\n    // a arrays\n    var aptr = a._ptr;\n    var aindex = a._index;\n    var asize = a._size; // rows & columns\n\n    var m = asize[0];\n    var n = asize[1]; // initialize s arrays\n\n    s.pinv = []; // (m + n)\n\n    s.leftmost = []; // (m)\n    // vars\n\n    var parent = s.parent;\n    var pinv = s.pinv;\n    var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n\n    var w = []; // (m + 3 * n)\n\n    var next = 0;\n    var head = m;\n    var tail = m + n;\n    var nque = m + 2 * n; // vars\n\n    var i, k, p, p0, p1; // initialize w\n\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    } // initialize row arrays\n\n\n    for (i = 0; i < m; i++) {\n      leftmost[i] = -1;\n    } // loop columns backwards\n\n\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    } // scan rows in reverse order\n\n\n    for (i = m - 1; i >= 0; i--) {\n      // row i is not yet ordered\n      pinv[i] = -1;\n      k = leftmost[i]; // check row i is empty\n\n      if (k === -1) {\n        continue;\n      } // first row in queue k\n\n\n      if (w[nque + k]++ === 0) {\n        w[tail + k] = i;\n      } // put i at head of queue k\n\n\n      w[next + i] = w[head + k];\n      w[head + k] = i;\n    }\n\n    s.lnz = 0;\n    s.m2 = m; // find row permutation and nnz(V)\n\n    for (k = 0; k < n; k++) {\n      // remove row i from queue k\n      i = w[head + k]; // count V(k,k) as nonzero\n\n      s.lnz++; // add a fictitious row\n\n      if (i < 0) {\n        i = s.m2++;\n      } // associate row i with V(:,k)\n\n\n      pinv[i] = k; // skip if V(k+1:m,k) is empty\n\n      if (--nque[k] <= 0) {\n        continue;\n      } // nque[k] is nnz (V(k+1:m,k))\n\n\n      s.lnz += w[nque + k]; // move all rows to parent of k\n\n      var pa = parent[k];\n\n      if (pa !== -1) {\n        if (w[nque + pa] === 0) {\n          w[tail + pa] = w[tail + k];\n        }\n\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\n    for (i = 0; i < m; i++) {\n      if (pinv[i] < 0) {\n        pinv[i] = k++;\n      }\n    }\n\n    return true;\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  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size;\n  var adt = a._datatype; // rows & columns\n\n  var m = asize[0];\n  var n = asize[1]; // c arrays\n\n  var cvalues = values && a._values ? [] : null;\n  var cindex = []; // (aptr[n])\n\n  var cptr = []; // (n + 1)\n  // initialize vars\n\n  var nz = 0; // loop columns\n\n  for (var k = 0; k < n; k++) {\n    // column k of C is column q[k] of A\n    cptr[k] = nz; // apply column permutation\n\n    var j = q ? q[k] : k; // loop values in column j of A\n\n    for (var t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {\n      // row i of A is row pinv[i] of C\n      var r = pinv ? pinv[aindex[t]] : aindex[t]; // index\n\n      cindex[nz] = r; // check we need to populate values\n\n      if (cvalues) {\n        cvalues[nz] = avalues[t];\n      } // increment number of nonzero elements\n\n\n      nz++;\n    }\n  } // finalize the last column of C\n\n\n  cptr[n] = nz; // return C matrix\n\n  return a.createSparseMatrix({\n    values: cvalues,\n    index: cindex,\n    ptr: cptr,\n    size: [m, n],\n    datatype: adt\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) {\n    return null;\n  } // a arrays\n\n\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size; // rows & columns\n\n  var m = asize[0];\n  var n = asize[1]; // allocate result\n\n  var parent = []; // (n)\n  // allocate workspace\n\n  var w = []; // (n + (ata ? m : 0))\n\n  var ancestor = 0; // first n entries in w\n\n  var prev = n; // last m entries (ata = true)\n\n  var i, inext; // check we are calculating A'A\n\n  if (ata) {\n    // initialize workspace\n    for (i = 0; i < m; i++) {\n      w[prev + i] = -1;\n    }\n  } // loop columns\n\n\n  for (var k = 0; k < n; k++) {\n    // node k has no parent yet\n    parent[k] = -1; // nor does k have an ancestor\n\n    w[ancestor + k] = -1; // values in column k\n\n    for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n      // row\n      var r = aindex[p]; // node\n\n      i = ata ? w[prev + r] : r; // traverse from i to k\n\n      for (; i !== -1 && i < k; i = inext) {\n        // inext = ancestor of i\n        inext = w[ancestor + i]; // path compression\n\n        w[ancestor + i] = k; // check no anc., parent is k\n\n        if (inext === -1) {\n          parent[i] = k;\n        }\n      }\n\n      if (ata) {\n        w[prev + r] = k;\n      }\n    }\n  }\n\n  return parent;\n}","import { csTdfs } from './csTdfs.js';\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 */\n\nexport function csPost(parent, n) {\n  // check inputs\n  if (!parent) {\n    return null;\n  } // vars\n\n\n  var k = 0;\n  var j; // allocate result\n\n  var post = []; // (n)\n  // workspace, head: first n entries, next: next n entries, stack: last n entries\n\n  var w = []; // (3 * n)\n\n  var head = 0;\n  var next = n;\n  var stack = 2 * n; // initialize workspace\n\n  for (j = 0; j < n; j++) {\n    // empty linked lists\n    w[head + j] = -1;\n  } // traverse nodes in reverse order\n\n\n  for (j = n - 1; j >= 0; j--) {\n    // check j is a root\n    if (parent[j] === -1) {\n      continue;\n    } // add j to list of its parent\n\n\n    w[next + j] = w[head + parent[j]];\n    w[head + parent[j]] = j;\n  } // loop nodes\n\n\n  for (j = 0; j < n; j++) {\n    // skip j if it is not a root\n    if (parent[j] !== -1) {\n      continue;\n    } // depth-first search\n\n\n    k = csTdfs(j, k, w, head, next, post, stack);\n  }\n\n  return post;\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}","import { csFlip } from './csFlip.js';\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 */\n\nexport function csMark(w, j) {\n  // mark w[j]\n  w[j] = csFlip(w[j]);\n}","import { csFlip } from './csFlip.js';\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 */\n\nexport function csUnflip(i) {\n  // flip the value if it is negative\n  return i < 0 ? csFlip(i) : i;\n}","import { csMarked } from './csMarked.js';\nimport { csMark } from './csMark.js';\nimport { csUnflip } from './csUnflip.js';\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 */\n\nexport function csDfs(j, g, top, xi, pinv) {\n  // g arrays\n  var index = g._index;\n  var ptr = g._ptr;\n  var size = g._size; // columns\n\n  var n = size[1]; // vars\n\n  var i, p, p2; // initialize head\n\n  var head = 0; // initialize the recursion stack\n\n  xi[0] = j; // loop\n\n  while (head >= 0) {\n    // get j from the top of the recursion stack\n    j = xi[head]; // apply permutation vector\n\n    var jnew = pinv ? pinv[j] : j; // check node j is marked\n\n    if (!csMarked(ptr, j)) {\n      // mark node j as visited\n      csMark(ptr, j); // update stack (last n entries in xi)\n\n      xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew]);\n    } // node j done if no unvisited neighbors\n\n\n    var done = 1; // examine all neighbors of j, stack (last n entries in xi)\n\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]; // check we have visited node i, skip it\n\n      if (csMarked(ptr, i)) {\n        continue;\n      } // pause depth-first search of node j, update stack (last n entries in xi)\n\n\n      xi[n + head] = p; // start dfs at node i\n\n      xi[++head] = i; // node j is not done\n\n      done = 0; // break, to start dfs(i)\n\n      break;\n    } // check depth-first search at node j is done\n\n\n    if (done) {\n      // remove j from the recursion stack\n      head--; // and place in the output stack\n\n      xi[--top] = j;\n    }\n  }\n\n  return top;\n}","import { csReach } from './csReach.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'csSpsolve';\nvar dependencies = ['divideScalar', 'multiply', 'subtract'];\nexport var createCsSpsolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    divideScalar,\n    multiply,\n    subtract\n  } = _ref;\n\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    var gvalues = g._values;\n    var gindex = g._index;\n    var gptr = g._ptr;\n    var gsize = g._size; // columns\n\n    var n = gsize[1]; // b arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr; // vars\n\n    var p, p0, p1, q; // xi[top..n-1] = csReach(B(:,k))\n\n    var top = csReach(g, b, k, xi, pinv); // clear x\n\n    for (p = top; p < n; p++) {\n      x[xi[p]] = 0;\n    } // scatter b\n\n\n    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n      x[bindex[p]] = bvalues[p];\n    } // loop columns\n\n\n    for (var px = top; px < n; px++) {\n      // x array index for px\n      var j = xi[px]; // apply permutation vector (U x = b), j maps to column J of G\n\n      var J = pinv ? pinv[j] : j; // check column J is empty\n\n      if (J < 0) {\n        continue;\n      } // column value indeces in G, p0 <= p < p1\n\n\n      p0 = gptr[J];\n      p1 = gptr[J + 1]; // x(j) /= G(j,j)\n\n      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]); // first entry L(j,j)\n\n      p = lo ? p0 + 1 : p0;\n      q = lo ? p1 : p1 - 1; // loop\n\n      for (; p < q; p++) {\n        // row\n        var i = gindex[p]; // x(i) -= G(i,j) * x(j)\n\n        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));\n      }\n    } // return top of stack\n\n\n    return top;\n  };\n});","import { csMarked } from './csMarked.js';\nimport { csMark } from './csMark.js';\nimport { csDfs } from './csDfs.js';\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 */\n\nexport function csReach(g, b, k, xi, pinv) {\n  // g arrays\n  var gptr = g._ptr;\n  var gsize = g._size; // b arrays\n\n  var bindex = b._index;\n  var bptr = b._ptr; // columns\n\n  var n = gsize[1]; // vars\n\n  var p, p0, p1; // initialize top\n\n  var top = n; // loop column indeces in B\n\n  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n    // node i\n    var i = bindex[p]; // check node i is marked\n\n    if (!csMarked(gptr, i)) {\n      // start a dfs at unmarked node i\n      top = csDfs(i, g, top, xi, pinv);\n    }\n  } // loop columns from top -> n - 1\n\n\n  for (p = top; p < n; p++) {\n    // restore G\n    csMark(gptr, xi[p]);\n  }\n\n  return top;\n}","import { factory } from '../../../utils/factory.js';\nimport { createCsSpsolve } from './csSpsolve.js';\nvar name = 'csLu';\nvar dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nexport var createCsLu = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    abs,\n    divideScalar,\n    multiply,\n    subtract,\n    larger,\n    largerEq,\n    SparseMatrix\n  } = _ref;\n  var csSpsolve = createCsSpsolve({\n    divideScalar,\n    multiply,\n    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\n  return function csLu(m, s, tol) {\n    // validate input\n    if (!m) {\n      return null;\n    } // m arrays\n\n\n    var size = m._size; // columns\n\n    var n = size[1]; // symbolic analysis result\n\n    var q;\n    var lnz = 100;\n    var unz = 100; // update symbolic analysis parameters\n\n    if (s) {\n      q = s.q;\n      lnz = s.lnz || lnz;\n      unz = s.unz || unz;\n    } // L arrays\n\n\n    var lvalues = []; // (lnz)\n\n    var lindex = []; // (lnz)\n\n    var lptr = []; // (n + 1)\n    // L\n\n    var L = new SparseMatrix({\n      values: lvalues,\n      index: lindex,\n      ptr: lptr,\n      size: [n, n]\n    }); // U arrays\n\n    var uvalues = []; // (unz)\n\n    var uindex = []; // (unz)\n\n    var uptr = []; // (n + 1)\n    // U\n\n    var U = new SparseMatrix({\n      values: uvalues,\n      index: uindex,\n      ptr: uptr,\n      size: [n, n]\n    }); // inverse of permutation vector\n\n    var pinv = []; // (n)\n    // vars\n\n    var i, p; // allocate arrays\n\n    var x = []; // (n)\n\n    var xi = []; // (2 * n)\n    // initialize variables\n\n    for (i = 0; i < n; i++) {\n      // clear workspace\n      x[i] = 0; // no rows pivotal yet\n\n      pinv[i] = -1; // no cols of L yet\n\n      lptr[i + 1] = 0;\n    } // reset number of nonzero elements in L and U\n\n\n    lnz = 0;\n    unz = 0; // compute L(:,k) and U(:,k)\n\n    for (var k = 0; k < n; k++) {\n      // update ptr\n      lptr[k] = lnz;\n      uptr[k] = unz; // apply column permutations if needed\n\n      var col = q ? q[k] : k; // solve triangular system, x = L\\A(:,col)\n\n      var top = csSpsolve(L, m, col, xi, x, pinv, 1); // find pivot\n\n      var ipiv = -1;\n      var a = -1; // loop xi[] from top -> n\n\n      for (p = top; p < n; p++) {\n        // x[i] is nonzero\n        i = xi[p]; // check row i is not yet pivotal\n\n        if (pinv[i] < 0) {\n          // absolute value of x[i]\n          var xabs = abs(x[i]); // check absoulte value is greater than pivot value\n\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      } // validate we found a valid pivot\n\n\n      if (ipiv === -1 || a <= 0) {\n        return null;\n      } // update actual pivot column, give preference to diagonal value\n\n\n      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {\n        ipiv = col;\n      } // the chosen pivot\n\n\n      var pivot = x[ipiv]; // last entry in U(:,k) is U(k,k)\n\n      uindex[unz] = k;\n      uvalues[unz++] = pivot; // ipiv is the kth pivot row\n\n      pinv[ipiv] = k; // first entry in L(:,k) is L(k,k) = 1\n\n      lindex[lnz] = ipiv;\n      lvalues[lnz++] = 1; // L(k+1:n,k) = x / pivot\n\n      for (p = top; p < n; p++) {\n        // row\n        i = xi[p]; // check x(i) is an entry in L(:,k)\n\n        if (pinv[i] < 0) {\n          // save unpermuted row in L\n          lindex[lnz] = i; // scale pivot column\n\n          lvalues[lnz++] = divideScalar(x[i], pivot);\n        } // x[0..n-1] = 0 for next k\n\n\n        x[i] = 0;\n      }\n    } // update ptr\n\n\n    lptr[n] = lnz;\n    uptr[n] = unz; // fix row indices of L for final pinv\n\n    for (p = 0; p < lnz; p++) {\n      lindex[p] = pinv[lindex[p]];\n    } // trim arrays\n\n\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); // return LU factor\n\n    return {\n      L: L,\n      U: U,\n      pinv: pinv\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';\nvar name = 'slu';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nexport var createSlu = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    add,\n    multiply,\n    transpose,\n    divideScalar,\n    subtract,\n    larger,\n    largerEq,\n    SparseMatrix\n  } = _ref;\n  var csSqr = createCsSqr({\n    add,\n    multiply,\n    transpose\n  });\n  var csLu = createCsLu({\n    abs,\n    divideScalar,\n    multiply,\n    subtract,\n    larger,\n    largerEq,\n    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\n  return typed(name, {\n    'SparseMatrix, number, number': function SparseMatrixNumberNumber(a, order, threshold) {\n      // verify order\n      if (!isInteger(order) || order < 0 || order > 3) {\n        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');\n      } // verify threshold\n\n\n      if (threshold < 0 || threshold > 1) {\n        throw new Error('Partial pivoting threshold must be a number from 0 to 1');\n      } // perform symbolic ordering and analysis\n\n\n      var s = csSqr(order, a, false); // perform lu decomposition\n\n      var f = csLu(a, s, threshold); // return decomposition\n\n      return {\n        L: f.L,\n        U: f.U,\n        p: f.pinv,\n        q: s.q,\n        toString: function toString() {\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});","import { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'det';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];\nexport var createDet = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    multiply,\n    unaryMinus,\n    lup\n  } = _ref;\n\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 any(x) {\n      return clone(x);\n    },\n    'Array | Matrix': function det(x) {\n      var size;\n\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 ' + '(size: ' + format(size) + ')');\n          }\n\n        case 2:\n          {\n            // two dimensional array\n            var rows = size[0];\n            var cols = size[1];\n\n            if (rows === cols) {\n              return _det(x.clone().valueOf(), rows, cols);\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\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\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(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));\n    } else {\n      // Compute the LU decomposition\n      var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)\n\n      var det = decomp.U[0][0];\n\n      for (var _i = 1; _i < rows; _i++) {\n        det = multiply(det, decomp.U[_i][_i]);\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\n\n      var evenCycles = 0;\n      var i = 0;\n      var visited = [];\n\n      while (true) {\n        while (visited[i]) {\n          i++;\n        }\n\n        if (i >= rows) break;\n        var j = i;\n        var cycleLen = 0;\n\n        while (!visited[decomp.p[j]]) {\n          visited[decomp.p[j]] = true;\n          j = decomp.p[j];\n          cycleLen++;\n        }\n\n        if (cycleLen % 2 === 0) {\n          evenCycles++;\n        }\n      }\n\n      return evenCycles % 2 === 0 ? det : unaryMinus(det);\n    }\n  }\n});","import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'distance';\nvar dependencies = ['typed', 'addScalar', 'subtract', 'divideScalar', 'multiplyScalar', 'unaryMinus', 'sqrt', 'abs'];\nexport var createDistance = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    subtract,\n    multiplyScalar,\n    divideScalar,\n    unaryMinus,\n    sqrt,\n    abs\n  } = _ref;\n\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 ArrayArrayArray(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)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n        }\n\n        var m = divideScalar(subtract(z[1], z[0]), subtract(y[1], y[0]));\n        var xCoeff = multiplyScalar(multiplyScalar(m, m), y[0]);\n        var yCoeff = unaryMinus(multiplyScalar(m, y[0]));\n        var constant = x[1];\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 ObjectObjectObject(x, y, z) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');\n        }\n\n        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {\n          var m = divideScalar(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX));\n          var xCoeff = multiplyScalar(multiplyScalar(m, m), y.lineOnePtX);\n          var yCoeff = unaryMinus(multiplyScalar(m, y.lineOnePtX));\n          var constant = x.pointX;\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 ArrayArray(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\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\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\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 ObjectObject(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\n        if (!_3d(y)) {\n          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');\n        }\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\n        if (!_parametricLine(y)) {\n          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');\n        }\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\n        if (!_2d(y)) {\n          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');\n        }\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\n        if (!_3d(y)) {\n          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');\n        }\n\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {\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 Array(arr) {\n      if (!_pairwise(arr)) {\n        throw new TypeError('Incorrect array format entered for pairwise distance calculation');\n      }\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\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\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\n    return a.every(_isNumber);\n  }\n\n  function _parametricLine(a) {\n    if (a.constructor !== Array) {\n      a = _objectToArray(a);\n    }\n\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);\n  }\n\n  function _objectToArray(o) {\n    var keys = Object.keys(o);\n    var a = [];\n\n    for (var i = 0; i < keys.length; i++) {\n      a.push(o[keys[i]]);\n    }\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\n    return true;\n  }\n\n  function _distancePointLine2D(x, y, a, b, c) {\n    var num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));\n    var 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    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))];\n    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));\n    var 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    var vectorSize = x.length;\n    var result = 0;\n    var diff = 0;\n\n    for (var i = 0; i < vectorSize; i++) {\n      diff = subtract(x[i], y[i]);\n      result = addScalar(multiplyScalar(diff, diff), result);\n    }\n\n    return sqrt(result);\n  }\n\n  function _distancePairwise(a) {\n    var result = [];\n    var pointA = [];\n    var pointB = [];\n\n    for (var i = 0; i < a.length - 1; i++) {\n      for (var 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\n        result.push(_euclideanDistance(pointA, pointB));\n      }\n    }\n\n    return result;\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'stirlingS2';\nvar dependencies = ['typed', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'larger'];\nexport var createStirlingS2 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    subtract,\n    multiplyScalar,\n    divideScalar,\n    pow,\n    factorial,\n    combinations,\n    isNegative,\n    isInteger,\n    larger\n  } = _ref;\n\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, then s(n,k) = 1\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 numberBigNumberNumberBigNumber(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      } // 1/k! Sum(i=0 -> k) [(-1)^(k-i)*C(k,j)* i^n]\n\n\n      var kFactorial = factorial(k);\n      var result = 0;\n\n      for (var i = 0; i <= k; i++) {\n        var negativeOne = pow(-1, subtract(k, i));\n        var kChooseI = combinations(k, i);\n        var iPower = pow(i, n);\n        result = addScalar(result, multiplyScalar(multiplyScalar(kChooseI, iPower), negativeOne));\n      }\n\n      return divideScalar(result, kFactorial);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'catalan';\nvar dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];\nexport var createCatalan = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    combinations,\n    isNegative,\n    isInteger\n  } = _ref;\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 numberBigNumber(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});","import { factory } from '../../utils/factory.js';\nvar name = 'count';\nvar dependencies = ['typed', 'size', 'prod'];\nexport var createCount = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    prod\n  } = _ref;\n\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 string(x) {\n      return x.length;\n    },\n    'Matrix | Array': function MatrixArray(x) {\n      return prod(size(x));\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { logNumber } from '../../plain/number/index.js';\nvar name = 'log';\nvar dependencies = ['config', 'typed', 'divideScalar', 'Complex'];\nexport var createLog = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return x.log();\n    },\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    },\n    'any, any': function anyAny(x, base) {\n      // calculate logarithm for a specified base, log(x, base)\n      return divideScalar(this(x), this(base));\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';\nvar name = 'dotDivide';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix'];\nexport var createDotDivide = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    divideScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': divideScalar,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, divideScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, divideScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, divideScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, divideScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, divideScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, divideScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, divideScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, divideScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, divideScalar, true).valueOf();\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createUsolveAll = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var R = _denseBackwardSubstitution(m, b);\n\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/project/5e6c87c554a3190001a3fc93\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // loop columns backwards\n\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n          b[i] = divideScalar(b[i], M[i][i]);\n\n          for (var 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          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          var bNew = [...b];\n          bNew[i] = 1;\n\n          for (var _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({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n\n  function _sparseBackwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // loop columns backwards\n\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k]; // values & indices (column i)\n\n        var iValues = [];\n        var iIndices = []; // first & last indeces in column\n\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1]; // find the value at [i, i]\n\n        var Mii = 0;\n\n        for (var j = lastIndex - 1; j >= firstIndex; j--) {\n          var J = index[j]; // check row\n\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          b[i] = divideScalar(b[i], Mii); // loop upper triangular\n\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\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          var bNew = [...b];\n          bNew[i] = 1; // loop upper triangular\n\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);\n          }\n\n          B.push(bNew);\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { flatten } from '../../utils/array.js';\nvar name = 'hypot';\nvar dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];\nexport var createHypot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    sqrt,\n    smaller,\n    isPositive\n  } = _ref;\n\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    Array: function Array(x) {\n      return this.apply(this, flatten(x));\n    },\n    Matrix: function Matrix(x) {\n      return this.apply(this, flatten(x.toArray()));\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\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    var result = 0;\n    var largest = 0;\n\n    for (var i = 0; i < args.length; i++) {\n      var value = abs(args[i]);\n\n      if (smaller(largest, value)) {\n        result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));\n        result = addScalar(result, 1);\n        largest = value;\n      } else {\n        result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);\n      }\n    }\n\n    return multiplyScalar(largest, sqrt(result));\n  }\n});","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); }\n\nimport { factory } from '../../../utils/factory.js';\nvar name = 'qr';\nvar dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'complex'];\nexport var createQr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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 _extends(typed(name, {\n    DenseMatrix: function DenseMatrix(m) {\n      return _denseQR(m);\n    },\n    SparseMatrix: function SparseMatrix(m) {\n      return _sparseQR(m);\n    },\n    Array: function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a); // lup, use matrix implementation\n\n      var r = _denseQR(m); // result\n\n\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      };\n    }\n  }), {\n    _denseQRimpl\n  });\n\n  function _denseQRimpl(m) {\n    // rows & columns (m x n)\n    var rows = m._size[0]; // m\n\n    var cols = m._size[1]; // n\n\n    var Q = identity([rows], 'dense');\n    var Qdata = Q._data;\n    var R = m.clone();\n    var Rdata = R._data; // vars\n\n    var i, j, k;\n    var 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      var pivot = Rdata[k][k];\n      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));\n      var conjSgn = conj(sgn);\n      var 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      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));\n\n      if (!isZero(alpha)) {\n        // first element in vector u\n        var u1 = subtract(pivot, alpha); // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n\n        w[k] = 1;\n\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1);\n        } // tau = - conj(u1 / alpha)\n\n\n        var tau = unaryMinus(conj(divideScalar(u1, alpha)));\n        var s = void 0;\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\n        for (j = k; j < cols; j++) {\n          s = 0.0; // calculate jth element of [tranpose(w) * R]\n\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));\n          } // calculate the jth element of [tau * transpose(w) * R]\n\n\n          s = multiplyScalar(s, tau);\n\n          for (i = k; i < rows; i++) {\n            Rdata[i][j] = multiplyScalar(subtract(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);\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\n\n        for (i = 0; i < rows; i++) {\n          s = 0.0; // calculate ith element of [Q * w]\n\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));\n          } // calculate the ith element of [tau * Q * w]\n\n\n          s = multiplyScalar(s, tau);\n\n          for (j = k; j < rows; ++j) {\n            Qdata[i][j] = divideScalar(subtract(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);\n          }\n        }\n      }\n    } // return matrices\n\n\n    return {\n      Q: Q,\n      R: R,\n      toString: function toString() {\n        return 'Q: ' + this.Q.toString() + '\\nR: ' + this.R.toString();\n      }\n    };\n  }\n\n  function _denseQR(m) {\n    var ret = _denseQRimpl(m);\n\n    var Rdata = ret.R._data;\n\n    if (m._data.length > 0) {\n      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;\n\n      for (var i = 0; i < Rdata.length; ++i) {\n        for (var 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});","import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nvar name = 'inv';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];\nexport var createInv = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    addScalar,\n    multiply,\n    unaryMinus,\n    det,\n    identity,\n    abs\n  } = _ref;\n\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 ArrayMatrix(x) {\n      var size = isMatrix(x) ? x.size() : arraySize(x);\n\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if (isMatrix(x)) {\n              return matrix([divideScalar(1, x.valueOf()[0])]);\n            } else {\n              return [divideScalar(1, x[0])];\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n          }\n\n        case 2:\n          // two dimensional array\n          {\n            var rows = size[0];\n            var cols = size[1];\n\n            if (rows === cols) {\n              if (isMatrix(x)) {\n                return matrix(_inv(x.valueOf(), rows, cols), x.storage());\n              } else {\n                // return an Array\n                return _inv(x, rows, cols);\n              }\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\n      }\n    },\n    any: function any(x) {\n      // scalar\n      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers\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\n  function _inv(mat, rows, cols) {\n    var r, s, f, value, temp;\n\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0];\n\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n\n      return [[divideScalar(1, value)]];\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      var d = det(mat);\n\n      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n\n      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];\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      // make a copy of the matrix (only the arrays, not of the elements)\n      var A = mat.concat();\n\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat();\n      } // create an identity matrix which in the end will contain the\n      // matrix inverse\n\n\n      var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions\n\n      for (var c = 0; c < cols; c++) {\n        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]\n        var ABig = abs(A[c][c]);\n        var rBig = c;\n        r = c + 1;\n\n        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c]);\n            rBig = r;\n          }\n\n          r++;\n        }\n\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero');\n        }\n\n        r = rBig;\n\n        if (r !== c) {\n          temp = A[c];\n          A[c] = A[r];\n          A[r] = temp;\n          temp = B[c];\n          B[c] = B[r];\n          B[r] = temp;\n        } // eliminate non-zero values on the other rows at column c\n\n\n        var Ac = A[c];\n        var Bc = B[c];\n\n        for (r = 0; r < rows; r++) {\n          var Ar = A[r];\n          var Br = B[r];\n\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]); // add (f * row c) to row r to eliminate the value\n              // at column c\n\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));\n              }\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\n            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f);\n            }\n\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f);\n            }\n          }\n        }\n      }\n\n      return B;\n    }\n  }\n});","import { isSparseMatrix } from '../../utils/is.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'expm';\nvar dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];\nexport var createExpm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    add,\n    identity,\n    inv,\n    multiply\n  } = _ref;\n\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    Matrix: function Matrix(A) {\n      // Check matrix size\n      var size = A.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      var n = size[0]; // Desired accuracy of the approximant (The actual accuracy\n      // will be affected by round-off error)\n\n      var eps = 1e-15; // 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      // Compute infinity-norm of A, ||A||, to see how \"big\" it is\n\n      var infNorm = infinityNorm(A); // Find the optimal scaling factor and number of terms in the\n      // Padé approximant to reach the desired accuracy\n\n      var params = findParams(infNorm, eps);\n      var q = params.q;\n      var j = params.j; // 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      // Scale A by 1 / 2^j\n\n      var Apos = multiply(A, Math.pow(2, -j)); // The i=0 term is just the identity matrix\n\n      var N = identity(n);\n      var D = identity(n); // Initialization (i=0)\n\n      var factor = 1; // Initialization (i=1)\n\n      var AposToI = Apos; // Cloning not necessary\n\n      var alternate = -1;\n\n      for (var i = 1; i <= q; i++) {\n        if (i > 1) {\n          AposToI = multiply(AposToI, Apos);\n          alternate = -alternate;\n        }\n\n        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);\n        N = add(N, multiply(factor, AposToI));\n        D = add(D, multiply(factor * alternate, AposToI));\n      }\n\n      var R = multiply(inv(D), N); // Square j times\n\n      for (var _i = 0; _i < j; _i++) {\n        R = multiply(R, R);\n      }\n\n      return isSparseMatrix(A) ? A.createSparseMatrix(R) : R;\n    }\n  });\n\n  function infinityNorm(A) {\n    var n = A.size()[0];\n    var infNorm = 0;\n\n    for (var i = 0; i < n; i++) {\n      var rowSum = 0;\n\n      for (var j = 0; j < n; j++) {\n        rowSum += abs(A.get([i, j]));\n      }\n\n      infNorm = Math.max(rowSum, infNorm);\n    }\n\n    return infNorm;\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\n\n  function findParams(infNorm, eps) {\n    var maxSearchSize = 30;\n\n    for (var k = 0; k < maxSearchSize; k++) {\n      for (var q = 0; q <= k; q++) {\n        var j = k - q;\n\n        if (errorEstimate(infNorm, q, j) < eps) {\n          return {\n            q: q,\n            j: j\n          };\n        }\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   * Returns the estimated error of the Pade approximant for the given\n   * parameters.\n   */\n\n\n  function errorEstimate(infNorm, q, j) {\n    var qfac = 1;\n\n    for (var i = 2; i <= q; i++) {\n      qfac *= i;\n    }\n\n    var twoqfac = qfac;\n\n    for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {\n      twoqfac *= _i2;\n    }\n\n    var twoqp1fac = twoqfac * (2 * q + 1);\n    return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);\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';\nvar name = 'divide';\nvar dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];\nexport var createDivide = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    multiply,\n    equalScalar,\n    divideScalar,\n    inv\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('divide', extend({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(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    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, divideScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, divideScalar, false);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array | Matrix': function anyArrayMatrix(x, y) {\n      return multiply(x, inv(y));\n    }\n  }, divideScalar.signatures));\n});","import { factory } from '../../utils/factory.js';\nvar name = 'kldivergence';\nvar dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric'];\nexport var createKldivergence = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divide,\n    sum,\n    multiply,\n    dotDivide,\n    log,\n    isNumeric\n  } = _ref;\n\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 ArrayArray(q, p) {\n      return _kldiv(matrix(q), matrix(p));\n    },\n    'Matrix, Array': function MatrixArray(q, p) {\n      return _kldiv(q, matrix(p));\n    },\n    'Array, Matrix': function ArrayMatrix(q, p) {\n      return _kldiv(matrix(q), p);\n    },\n    'Matrix, Matrix': function MatrixMatrix(q, p) {\n      return _kldiv(q, p);\n    }\n  });\n\n  function _kldiv(q, p) {\n    var plength = p.size().length;\n    var qlength = q.size().length;\n\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    } // Before calculation, apply normalization\n\n\n    var sumq = sum(q);\n\n    if (sumq === 0) {\n      throw new Error('Sum of elements in first object must be non zero');\n    }\n\n    var sump = sum(p);\n\n    if (sump === 0) {\n      throw new Error('Sum of elements in second object must be non zero');\n    }\n\n    var qnorm = divide(q, sum(q));\n    var pnorm = divide(p, sum(p));\n    var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));\n\n    if (isNumeric(result)) {\n      return result;\n    } else {\n      return Number.NaN;\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'bellNumbers';\nvar dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];\nexport var createBellNumbers = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    isNegative,\n    isInteger,\n    stirlingS2\n  } = _ref;\n\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 numberBigNumber(n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function bellNumbers');\n      } // Sum (k=0, n) S(n,k).\n\n\n      var result = 0;\n\n      for (var i = 0; i <= n; i++) {\n        result = addScalar(result, stirlingS2(n, i));\n      }\n\n      return result;\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { log1p as _log1p } from '../../utils/number.js';\nvar name = 'log1p';\nvar dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];\nexport var createLog1p = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    log,\n    Complex\n  } = _ref;\n\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 number(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    Complex: _log1pComplex,\n    BigNumber: function BigNumber(x) {\n      var y = x.plus(1);\n\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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    },\n    'any, any': function anyAny(x, base) {\n      // calculate logarithm for a specified base, log1p(x, base)\n      return divideScalar(this(x), log(base));\n    }\n  });\n  /**\n   * Calculate the natural logarithm of a complex number + 1\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n\n  function _log1pComplex(x) {\n    var xRe1p = x.re + 1;\n    return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));\n  }\n});","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); }\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _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; }\n\nimport { 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';\nvar name = 'Unit';\nvar dependencies = ['?on', 'config', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];\nexport var createUnitClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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: _BigNumber,\n    Fraction: _Fraction\n  } = _ref;\n  var 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\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\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      var u = Unit.parse(name);\n      this.units = u.units;\n      this.dimensions = u.dimensions;\n    } else {\n      this.units = [{\n        unit: UNIT_NONE,\n        prefix: PREFIXES.NONE,\n        // link to a list with supported prefixes\n        power: 0\n      }];\n      this.dimensions = [];\n\n      for (var 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    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    // 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\n    this.skipAutomaticSimplification = true;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Unit.prototype.type = 'Unit';\n  Unit.prototype.isUnit = true; // private variables and functions for the Unit parser\n\n  var 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    var number = '';\n    var 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    } // get number, can have a single dot\n\n\n    if (c === '.') {\n      number += c;\n      next();\n\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\n      if (c === '.') {\n        number += c;\n        next();\n      }\n    }\n\n    while (isDigit(c)) {\n      number += c;\n      next();\n    } // check for exponential notation like \"2.3e-4\" or \"1.23e50\"\n\n\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      var tentativeNumber = '';\n      var tentativeIndex = index;\n      tentativeNumber += c;\n      next();\n\n      if (c === '+' || c === '-') {\n        tentativeNumber += c;\n        next();\n      } // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)\n\n\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      } // We can now safely say that this is scientific notation.\n\n\n      number = number + tentativeNumber;\n\n      while (isDigit(c)) {\n        number += c;\n        next();\n      }\n    }\n\n    return number;\n  }\n\n  function parseUnit() {\n    var unitName = ''; // Alphanumeric characters only; matches [a-zA-Z0-9]\n\n    while (isDigit(c) || Unit.isValidAlpha(c)) {\n      unitName += c;\n      next();\n    } // Must begin with [a-zA-Z]\n\n\n    var firstC = unitName.charAt(0);\n\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   * 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\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    var unit = new Unit();\n    unit.units = [];\n    var powerMultiplierCurrent = 1;\n    var expectingUnit = false; // A unit should follow this pattern:\n    // [number] ...[ [*/] unit[^number] ]\n    // unit[^number] ... [ [*/] unit[^number] ]\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(); // Optional number at the start of the string\n\n    var valueStr = parseNumber();\n    var value = null;\n\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 {\n        // number\n        value = parseFloat(valueStr);\n      }\n\n      skipWhitespace(); // Whitespace is not required here\n      // handle multiplication or division right after the value, like '1/s'\n\n      if (parseCharacter('*')) {\n        powerMultiplierCurrent = 1;\n        expectingUnit = true;\n      } else if (parseCharacter('/')) {\n        powerMultiplierCurrent = -1;\n        expectingUnit = true;\n      }\n    } // Stack to keep track of powerMultipliers applied to each parentheses group\n\n\n    var powerMultiplierStack = []; // Running product of all elements in powerMultiplierStack\n\n    var powerMultiplierStackProduct = 1;\n\n    while (true) {\n      skipWhitespace(); // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack\n      // A '(' will always appear directly before a unit.\n\n      while (c === '(') {\n        powerMultiplierStack.push(powerMultiplierCurrent);\n        powerMultiplierStackProduct *= powerMultiplierCurrent;\n        powerMultiplierCurrent = 1;\n        next();\n        skipWhitespace();\n      } // Is there something here?\n\n\n      var uStr = void 0;\n\n      if (c) {\n        var oldC = c;\n        uStr = parseUnit();\n\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      } // Verify the unit exists and get the prefix (if any)\n\n\n      var res = _findUnit(uStr);\n\n      if (res === null) {\n        // Unit not found.\n        throw new SyntaxError('Unit \"' + uStr + '\" not found.');\n      }\n\n      var power = powerMultiplierCurrent * powerMultiplierStackProduct; // Is there a \"^ number\"?\n\n      skipWhitespace();\n\n      if (parseCharacter('^')) {\n        skipWhitespace();\n        var p = parseNumber();\n\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\n        power *= p;\n      } // Add the unit to the list\n\n\n      unit.units.push({\n        unit: res.unit,\n        prefix: res.prefix,\n        power: power\n      });\n\n      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;\n      } // Check for and consume closing parentheses, popping from the stack.\n      // A ')' will always follow a unit.\n\n\n      skipWhitespace();\n\n      while (c === ')') {\n        if (powerMultiplierStack.length === 0) {\n          throw new SyntaxError('Unmatched \")\" in \"' + text + '\" at index ' + index.toString());\n        }\n\n        powerMultiplierStackProduct /= powerMultiplierStack.pop();\n        next();\n        skipWhitespace();\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\n\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      } // Replace the unit into the auto unit system\n\n\n      if (res.unit.base) {\n        var baseDim = res.unit.base.key;\n        UNIT_SYSTEMS.auto[baseDim] = {\n          unit: res.unit,\n          prefix: res.prefix\n        };\n      }\n    } // Has the string been entirely consumed?\n\n\n    skipWhitespace();\n\n    if (c) {\n      throw new SyntaxError('Could not parse: \"' + str + '\"');\n    } // Is there a trailing slash?\n\n\n    if (expectingUnit) {\n      throw new SyntaxError('Trailing characters: \"' + str + '\"');\n    } // Is the parentheses stack empty?\n\n\n    if (powerMultiplierStack.length !== 0) {\n      throw new SyntaxError('Unmatched \"(\" in \"' + text + '\"');\n    } // Are there any units at all?\n\n\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   * create a copy of this unit\n   * @memberof Unit\n   * @return {Unit} Returns a cloned version of the unit\n   */\n\n\n  Unit.prototype.clone = function () {\n    var unit = new Unit();\n    unit.fixPrefix = this.fixPrefix;\n    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;\n    unit.value = clone(this.value);\n    unit.dimensions = this.dimensions.slice(0);\n    unit.units = [];\n\n    for (var i = 0; i < this.units.length; i++) {\n      unit.units[i] = {};\n\n      for (var 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   * 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\n\n  Unit.prototype._isDerived = function () {\n    if (this.units.length === 0) {\n      return false;\n    }\n\n    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;\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\n\n  Unit.prototype._normalize = function (value) {\n    var unitValue, unitOffset, unitPower, unitPrefixValue;\n    var convert;\n\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    } else if (this._isDerived()) {\n      // This is a derived unit, so do not apply offsets.\n      // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n      var res = value;\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      for (var i = 0; i < this.units.length; i++) {\n        unitValue = convert(this.units[i].unit.value);\n        unitPrefixValue = convert(this.units[i].prefix.value);\n        unitPower = convert(this.units[i].power);\n        res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n      }\n\n      return res;\n    } else {\n      // This is a single unit of power 1, like kg or degC\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      unitValue = convert(this.units[0].unit.value);\n      unitOffset = convert(this.units[0].unit.offset);\n      unitPrefixValue = convert(this.units[0].prefix.value);\n      return multiplyScalar(addScalar(value, unitOffset), multiplyScalar(unitValue, unitPrefixValue));\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\n\n  Unit.prototype._denormalize = function (value, prefixValue) {\n    var unitValue, unitOffset, unitPower, unitPrefixValue;\n    var convert;\n\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    } else if (this._isDerived()) {\n      // This is a derived unit, so do not apply offsets.\n      // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n      // Also, prefixValue is ignored--but we will still use the prefix value stored in each unit, since kg is usually preferable to g unless the user decides otherwise.\n      var res = value;\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      for (var i = 0; i < this.units.length; i++) {\n        unitValue = convert(this.units[i].unit.value);\n        unitPrefixValue = convert(this.units[i].prefix.value);\n        unitPower = convert(this.units[i].power);\n        res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n      }\n\n      return res;\n    } else {\n      // This is a single unit of power 1, like kg or degC\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      unitValue = convert(this.units[0].unit.value);\n      unitPrefixValue = convert(this.units[0].prefix.value);\n      unitOffset = convert(this.units[0].unit.offset);\n\n      if (prefixValue === undefined || prefixValue === null) {\n        return subtract(divideScalar(divideScalar(value, unitValue), unitPrefixValue), unitOffset);\n      } else {\n        return subtract(divideScalar(divideScalar(value, unitValue), prefixValue), unitOffset);\n      }\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\n\n  var _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      var unit = UNITS[str];\n      var prefix = unit.prefixes[''];\n      return {\n        unit,\n        prefix\n      };\n    }\n\n    for (var _name in UNITS) {\n      if (hasOwnProperty(UNITS, _name)) {\n        if (endsWith(str, _name)) {\n          var _unit = UNITS[_name];\n          var prefixLen = str.length - _name.length;\n          var prefixName = str.substring(0, prefixLen);\n\n          var _prefix = hasOwnProperty(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;\n\n          if (_prefix !== undefined) {\n            // store unit, prefix, and value\n            return {\n              unit: _unit,\n              prefix: _prefix\n            };\n          }\n        }\n      }\n    }\n\n    return null;\n  }, {\n    hasher: args => args[0],\n    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\n\n  Unit.isValuelessUnit = function (name) {\n    return _findUnit(name) !== null;\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\n\n  Unit.prototype.hasBase = function (base) {\n    if (typeof base === 'string') {\n      base = BASE_UNITS[base];\n    }\n\n    if (!base) {\n      return false;\n    } // All dimensions must be the same\n\n\n    for (var 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\n    return true;\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\n\n  Unit.prototype.equalBase = function (other) {\n    // All dimensions must be the same\n    for (var 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\n    return true;\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\n\n  Unit.prototype.equals = function (other) {\n    return this.equalBase(other) && equal(this.value, other.value);\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\n\n  Unit.prototype.multiply = function (other) {\n    var res = this.clone();\n\n    for (var 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    } // Append other's units list onto res\n\n\n    for (var _i = 0; _i < other.units.length; _i++) {\n      // Make a shallow copy of every unit\n      var inverted = _objectSpread({}, other.units[_i]);\n\n      res.units.push(inverted);\n    } // If at least one operand has a value, then the result should also have a value\n\n\n    if (this.value !== null || other.value !== null) {\n      var valThis = this.value === null ? this._normalize(1) : this.value;\n      var 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    return getNumericIfUnitless(res);\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\n\n  Unit.prototype.divide = function (other) {\n    var res = this.clone();\n\n    for (var 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    } // Invert and append other's units list onto res\n\n\n    for (var _i2 = 0; _i2 < other.units.length; _i2++) {\n      // Make a shallow copy of every unit\n      var inverted = _objectSpread(_objectSpread({}, other.units[_i2]), {}, {\n        power: -other.units[_i2].power\n      });\n\n      res.units.push(inverted);\n    } // If at least one operand has a value, the result should have a value\n\n\n    if (this.value !== null || other.value !== null) {\n      var valThis = this.value === null ? this._normalize(1) : this.value;\n      var 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    return getNumericIfUnitless(res);\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\n\n  Unit.prototype.pow = function (p) {\n    var res = this.clone();\n\n    for (var 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    } // Adjust the power of each unit in the list\n\n\n    for (var _i3 = 0; _i3 < res.units.length; _i3++) {\n      res.units[_i3].power *= p;\n    }\n\n    if (res.value !== null) {\n      res.value = pow(res.value, p); // 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    return getNumericIfUnitless(res);\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\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   * 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\n\n  Unit.prototype.abs = function () {\n    // This gives correct, but unexpected, results for units with an offset.\n    // For example, abs(-283.15 degC) = -263.15 degC !!!\n    var ret = this.clone();\n    ret.value = ret.value !== null ? abs(ret.value) : null;\n\n    for (var 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   * 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\n\n  Unit.prototype.to = function (valuelessUnit) {\n    var other;\n    var value = this.value === null ? this._normalize(1) : this.value;\n\n    if (typeof valuelessUnit === 'string') {\n      // other = new Unit(null, valuelessUnit)\n      other = Unit.parse(valuelessUnit);\n\n      if (!this.equalBase(other)) {\n        throw new Error(\"Units do not match ('\".concat(other.toString(), \"' != '\").concat(this.toString(), \"')\"));\n      }\n\n      if (other.value !== null) {\n        throw new Error('Cannot convert to a unit with a value');\n      }\n\n      other.value = clone(value);\n      other.fixPrefix = true;\n      other.skipAutomaticSimplification = true;\n      return other;\n    } else if (isUnit(valuelessUnit)) {\n      if (!this.equalBase(valuelessUnit)) {\n        throw new Error(\"Units do not match ('\".concat(valuelessUnit.toString(), \"' != '\").concat(this.toString(), \"')\"));\n      }\n\n      if (valuelessUnit.value !== null) {\n        throw new Error('Cannot convert to a unit with a value');\n      }\n\n      other = valuelessUnit.clone();\n      other.value = clone(value);\n      other.fixPrefix = true;\n      other.skipAutomaticSimplification = true;\n      return other;\n    } else {\n      throw new Error('String or Unit expected as parameter');\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\n\n  Unit.prototype.toNumber = function (valuelessUnit) {\n    return toNumber(this.toNumeric(valuelessUnit));\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\n\n  Unit.prototype.toNumeric = function (valuelessUnit) {\n    var other;\n\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   * Get a string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n\n\n  Unit.prototype.toString = function () {\n    return this.format();\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\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   * 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\n\n  Unit.fromJSON = function (json) {\n    var unit = new Unit(json.value, json.unit);\n    unit.fixPrefix = json.fixPrefix || false;\n    return unit;\n  };\n  /**\n   * Returns the string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n\n\n  Unit.prototype.valueOf = Unit.prototype.toString;\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\n  Unit.prototype.simplify = function () {\n    var ret = this.clone();\n    var proposedUnitList = []; // Search for a matching base\n\n    var matchingBase;\n\n    for (var 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      var matchingUnit;\n\n      if (matchingBase) {\n        // Does the unit system have a matching unit?\n        if (hasOwnProperty(currentUnitSystem, matchingBase)) {\n          matchingUnit = currentUnitSystem[matchingBase];\n        }\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        var missingBaseDim = false;\n\n        for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n          var baseDim = BASE_DIMENSIONS[i];\n\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        } // Is the proposed unit list \"simpler\" than the existing one?\n\n\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   * Returns a new Unit in the SI system with the same value as this one\n   */\n\n\n  Unit.prototype.toSI = function () {\n    var ret = this.clone();\n    var proposedUnitList = []; // 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\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      var baseDim = BASE_DIMENSIONS[i];\n\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    } // Replace this unit list with the proposed list\n\n\n    ret.units = proposedUnitList;\n    ret.fixPrefix = true;\n    ret.skipAutomaticSimplification = true;\n    return ret;\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\n\n  Unit.prototype.formatUnits = function () {\n    var strNum = '';\n    var strDen = '';\n    var nNum = 0;\n    var nDen = 0;\n\n    for (var 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\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 (var _i4 = 0; _i4 < this.units.length; _i4++) {\n        if (this.units[_i4].power < 0) {\n          if (nNum > 0) {\n            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n\n            if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {\n              strDen += '^' + -this.units[_i4].power;\n            }\n          } else {\n            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n            strDen += '^' + this.units[_i4].power;\n          }\n        }\n      }\n    } // Remove leading \" \"\n\n\n    strNum = strNum.substr(1);\n    strDen = strDen.substr(1); // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting\n\n    if (nNum > 1 && nDen > 0) {\n      strNum = '(' + strNum + ')';\n    }\n\n    if (nDen > 1 && nNum > 0) {\n      strDen = '(' + strDen + ')';\n    }\n\n    var str = strNum;\n\n    if (nNum > 0 && nDen > 0) {\n      str += ' / ';\n    }\n\n    str += strDen;\n    return str;\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\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    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.\n\n    var isImaginary = false;\n\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 (var 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    } // Now apply the best prefix\n    // Units must have only one unit and not have the fixPrefix flag set\n\n\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    var value = simp._denormalize(simp.value);\n\n    var str = simp.value !== null ? format(value, options || {}) : '';\n    var unitStr = simp.formatUnits();\n\n    if (simp.value && isComplex(simp.value)) {\n      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing\n    }\n\n    if (unitStr.length > 0 && str.length > 0) {\n      str += ' ';\n    }\n\n    str += unitStr;\n    return str;\n  };\n  /**\n   * Calculate the best prefix using current value.\n   * @memberof Unit\n   * @returns {Object} prefix\n   * @private\n   */\n\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\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    } // 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    // 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\n\n    var absValue = this.value !== null ? abs(this.value) : 0;\n    var absUnitValue = abs(this.units[0].unit.value);\n    var bestPrefix = this.units[0].prefix;\n\n    if (absValue === 0) {\n      return bestPrefix;\n    }\n\n    var power = this.units[0].power;\n    var 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\n    bestDiff = Math.abs(bestDiff);\n    var prefixes = this.units[0].unit.prefixes;\n\n    for (var p in prefixes) {\n      if (hasOwnProperty(prefixes, p)) {\n        var prefix = prefixes[p];\n\n        if (prefix.scientific) {\n          var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);\n\n          if (diff < bestDiff || 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   * 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\n\n  Unit.prototype.splitUnit = function (parts) {\n    var x = this.clone();\n    var ret = [];\n\n    for (var 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; // Get the numeric value of this unit\n\n      var xNumeric = x.toNumeric(); // 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\n      var xRounded = round(xNumeric);\n      var xFixed = void 0;\n      var isNearlyEqual = equal(xRounded, xNumeric);\n\n      if (isNearlyEqual) {\n        xFixed = xRounded;\n      } else {\n        xFixed = fix(x.toNumeric());\n      }\n\n      var y = new Unit(xFixed, parts[i].toString());\n      ret.push(y);\n      x = subtract(x, y);\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\n\n    var testSum = 0;\n\n    for (var _i5 = 0; _i5 < ret.length; _i5++) {\n      testSum = addScalar(testSum, ret[_i5].value);\n    }\n\n    if (equal(testSum, this.value)) {\n      x.value = 0;\n    }\n\n    ret.push(x);\n    return ret;\n  };\n\n  var PREFIXES = {\n    NONE: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      }\n    },\n    SHORT: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      da: {\n        name: 'da',\n        value: 1e1,\n        scientific: false\n      },\n      h: {\n        name: 'h',\n        value: 1e2,\n        scientific: false\n      },\n      k: {\n        name: 'k',\n        value: 1e3,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e6,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e9,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e12,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e15,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e18,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e21,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e24,\n        scientific: true\n      },\n      d: {\n        name: 'd',\n        value: 1e-1,\n        scientific: false\n      },\n      c: {\n        name: 'c',\n        value: 1e-2,\n        scientific: false\n      },\n      m: {\n        name: 'm',\n        value: 1e-3,\n        scientific: true\n      },\n      u: {\n        name: 'u',\n        value: 1e-6,\n        scientific: true\n      },\n      n: {\n        name: 'n',\n        value: 1e-9,\n        scientific: true\n      },\n      p: {\n        name: 'p',\n        value: 1e-12,\n        scientific: true\n      },\n      f: {\n        name: 'f',\n        value: 1e-15,\n        scientific: true\n      },\n      a: {\n        name: 'a',\n        value: 1e-18,\n        scientific: true\n      },\n      z: {\n        name: 'z',\n        value: 1e-21,\n        scientific: true\n      },\n      y: {\n        name: 'y',\n        value: 1e-24,\n        scientific: true\n      }\n    },\n    LONG: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      deca: {\n        name: 'deca',\n        value: 1e1,\n        scientific: false\n      },\n      hecto: {\n        name: 'hecto',\n        value: 1e2,\n        scientific: false\n      },\n      kilo: {\n        name: 'kilo',\n        value: 1e3,\n        scientific: true\n      },\n      mega: {\n        name: 'mega',\n        value: 1e6,\n        scientific: true\n      },\n      giga: {\n        name: 'giga',\n        value: 1e9,\n        scientific: true\n      },\n      tera: {\n        name: 'tera',\n        value: 1e12,\n        scientific: true\n      },\n      peta: {\n        name: 'peta',\n        value: 1e15,\n        scientific: true\n      },\n      exa: {\n        name: 'exa',\n        value: 1e18,\n        scientific: true\n      },\n      zetta: {\n        name: 'zetta',\n        value: 1e21,\n        scientific: true\n      },\n      yotta: {\n        name: 'yotta',\n        value: 1e24,\n        scientific: true\n      },\n      deci: {\n        name: 'deci',\n        value: 1e-1,\n        scientific: false\n      },\n      centi: {\n        name: 'centi',\n        value: 1e-2,\n        scientific: false\n      },\n      milli: {\n        name: 'milli',\n        value: 1e-3,\n        scientific: true\n      },\n      micro: {\n        name: 'micro',\n        value: 1e-6,\n        scientific: true\n      },\n      nano: {\n        name: 'nano',\n        value: 1e-9,\n        scientific: true\n      },\n      pico: {\n        name: 'pico',\n        value: 1e-12,\n        scientific: true\n      },\n      femto: {\n        name: 'femto',\n        value: 1e-15,\n        scientific: true\n      },\n      atto: {\n        name: 'atto',\n        value: 1e-18,\n        scientific: true\n      },\n      zepto: {\n        name: 'zepto',\n        value: 1e-21,\n        scientific: true\n      },\n      yocto: {\n        name: 'yocto',\n        value: 1e-24,\n        scientific: true\n      }\n    },\n    SQUARED: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      da: {\n        name: 'da',\n        value: 1e2,\n        scientific: false\n      },\n      h: {\n        name: 'h',\n        value: 1e4,\n        scientific: false\n      },\n      k: {\n        name: 'k',\n        value: 1e6,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e12,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e18,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e24,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e30,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e36,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e42,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e48,\n        scientific: true\n      },\n      d: {\n        name: 'd',\n        value: 1e-2,\n        scientific: false\n      },\n      c: {\n        name: 'c',\n        value: 1e-4,\n        scientific: false\n      },\n      m: {\n        name: 'm',\n        value: 1e-6,\n        scientific: true\n      },\n      u: {\n        name: 'u',\n        value: 1e-12,\n        scientific: true\n      },\n      n: {\n        name: 'n',\n        value: 1e-18,\n        scientific: true\n      },\n      p: {\n        name: 'p',\n        value: 1e-24,\n        scientific: true\n      },\n      f: {\n        name: 'f',\n        value: 1e-30,\n        scientific: true\n      },\n      a: {\n        name: 'a',\n        value: 1e-36,\n        scientific: true\n      },\n      z: {\n        name: 'z',\n        value: 1e-42,\n        scientific: true\n      },\n      y: {\n        name: 'y',\n        value: 1e-48,\n        scientific: true\n      }\n    },\n    CUBIC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      da: {\n        name: 'da',\n        value: 1e3,\n        scientific: false\n      },\n      h: {\n        name: 'h',\n        value: 1e6,\n        scientific: false\n      },\n      k: {\n        name: 'k',\n        value: 1e9,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e18,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e27,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e36,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e45,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e54,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e63,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e72,\n        scientific: true\n      },\n      d: {\n        name: 'd',\n        value: 1e-3,\n        scientific: false\n      },\n      c: {\n        name: 'c',\n        value: 1e-6,\n        scientific: false\n      },\n      m: {\n        name: 'm',\n        value: 1e-9,\n        scientific: true\n      },\n      u: {\n        name: 'u',\n        value: 1e-18,\n        scientific: true\n      },\n      n: {\n        name: 'n',\n        value: 1e-27,\n        scientific: true\n      },\n      p: {\n        name: 'p',\n        value: 1e-36,\n        scientific: true\n      },\n      f: {\n        name: 'f',\n        value: 1e-45,\n        scientific: true\n      },\n      a: {\n        name: 'a',\n        value: 1e-54,\n        scientific: true\n      },\n      z: {\n        name: 'z',\n        value: 1e-63,\n        scientific: true\n      },\n      y: {\n        name: 'y',\n        value: 1e-72,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      k: {\n        name: 'k',\n        value: 1e3,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e6,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e9,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e12,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e15,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e18,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e21,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      Ki: {\n        name: 'Ki',\n        value: 1024,\n        scientific: true\n      },\n      Mi: {\n        name: 'Mi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      Gi: {\n        name: 'Gi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      Ti: {\n        name: 'Ti',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      Pi: {\n        name: 'Pi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      Ei: {\n        name: 'Ei',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      Zi: {\n        name: 'Zi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      Yi: {\n        name: 'Yi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BINARY_LONG_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      kilo: {\n        name: 'kilo',\n        value: 1e3,\n        scientific: true\n      },\n      mega: {\n        name: 'mega',\n        value: 1e6,\n        scientific: true\n      },\n      giga: {\n        name: 'giga',\n        value: 1e9,\n        scientific: true\n      },\n      tera: {\n        name: 'tera',\n        value: 1e12,\n        scientific: true\n      },\n      peta: {\n        name: 'peta',\n        value: 1e15,\n        scientific: true\n      },\n      exa: {\n        name: 'exa',\n        value: 1e18,\n        scientific: true\n      },\n      zetta: {\n        name: 'zetta',\n        value: 1e21,\n        scientific: true\n      },\n      yotta: {\n        name: 'yotta',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_LONG_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      kibi: {\n        name: 'kibi',\n        value: 1024,\n        scientific: true\n      },\n      mebi: {\n        name: 'mebi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      gibi: {\n        name: 'gibi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      tebi: {\n        name: 'tebi',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      pebi: {\n        name: 'pebi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      exi: {\n        name: 'exi',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      zebi: {\n        name: 'zebi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      yobi: {\n        name: 'yobi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BTU: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      MM: {\n        name: 'MM',\n        value: 1e6,\n        scientific: true\n      }\n    }\n  };\n  PREFIXES.SHORTLONG = _extends({}, PREFIXES.SHORT, PREFIXES.LONG);\n  PREFIXES.BINARY_SHORT = _extends({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);\n  PREFIXES.BINARY_LONG = _extends({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);\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  var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];\n  var 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    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    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    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 (var key in BASE_UNITS) {\n    if (hasOwnProperty(BASE_UNITS, key)) {\n      BASE_UNITS[key].key = key;\n    }\n  }\n\n  var BASE_UNIT_NONE = {};\n  var UNIT_NONE = {\n    name: '',\n    base: BASE_UNIT_NONE,\n    value: 1,\n    offset: 0,\n    dimensions: BASE_DIMENSIONS.map(x => 0)\n  };\n  var 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    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    },\n    // 1/1000 inch\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\n    // 10000 m2\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    },\n    // litre\n    l: {\n      name: 'l',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\n    // 0.05 mL = 5e-8 m3\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\n    // 238.4810 L\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    // 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    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    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    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    // 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,\n      // 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,\n      // Julian year\n      offset: 0\n    },\n    decade: {\n      name: 'decade',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 315576000,\n      // Julian decade\n      offset: 0\n    },\n    century: {\n      name: 'century',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3155760000,\n      // Julian century\n      offset: 0\n    },\n    millennium: {\n      name: 'millennium',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600000,\n      // Julian millennium\n      offset: 0\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    // 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,\n      // 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,\n      // 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,\n      // 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,\n      // 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,\n      // 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,\n      // 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,\n      // will be filled in by calculateAngleValues()\n      offset: 0\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    // 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    // 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    // 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    // 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    // 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    // 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    // 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    VA: {\n      name: 'VA',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\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    // 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,\n      // Both Mohm and megaohm are acceptable\n      value: 1,\n      offset: 0\n    },\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    // 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  }; // aliases (formerly plurals)\n\n  var 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    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    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    kips: 'kip',\n    kgf: 'kilogramforce',\n    acres: 'acre',\n    hectares: 'hectare',\n    sqfeet: 'sqft',\n    sqyard: 'sqyd',\n    sqmile: 'sqmi',\n    sqmiles: 'sqmi',\n    mmhg: 'mmHg',\n    mmh2o: 'mmH2O',\n    cmh2o: 'cmH2O',\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    hertz: 'hertz',\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    BTUs: 'BTU',\n    watts: 'watt',\n    joules: 'joule',\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    bit: 'bits',\n    byte: 'bytes'\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\n  function calculateAngleValues(config) {\n    if (config.number === 'BigNumber') {\n      var pi = createPi(_BigNumber);\n      UNITS.rad.value = new _BigNumber(1);\n      UNITS.deg.value = pi.div(180); // 2 * pi / 360\n\n      UNITS.grad.value = pi.div(200); // 2 * pi / 400\n\n      UNITS.cycle.value = pi.times(2); // 2 * pi\n\n      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600\n\n      UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60\n    } else {\n      // number\n      UNITS.rad.value = 1;\n      UNITS.deg.value = Math.PI / 180; // 2 * pi / 360\n\n      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400\n\n      UNITS.cycle.value = Math.PI * 2; // 2 * pi\n\n      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600\n\n      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60\n    } // copy to the full names of the angles\n\n\n    UNITS.radian.value = UNITS.rad.value;\n    UNITS.degree.value = UNITS.deg.value;\n    UNITS.gradian.value = UNITS.grad.value;\n  } // apply the angle values now\n\n\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   * 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\n\n  var UNIT_SYSTEMS = {\n    si: {\n      // Base units\n      NONE: {\n        unit: UNIT_NONE,\n        prefix: PREFIXES.NONE['']\n      },\n      LENGTH: {\n        unit: UNITS.m,\n        prefix: PREFIXES.SHORT['']\n      },\n      MASS: {\n        unit: UNITS.g,\n        prefix: PREFIXES.SHORT.k\n      },\n      TIME: {\n        unit: UNITS.s,\n        prefix: PREFIXES.SHORT['']\n      },\n      CURRENT: {\n        unit: UNITS.A,\n        prefix: PREFIXES.SHORT['']\n      },\n      TEMPERATURE: {\n        unit: UNITS.K,\n        prefix: PREFIXES.SHORT['']\n      },\n      LUMINOUS_INTENSITY: {\n        unit: UNITS.cd,\n        prefix: PREFIXES.SHORT['']\n      },\n      AMOUNT_OF_SUBSTANCE: {\n        unit: UNITS.mol,\n        prefix: PREFIXES.SHORT['']\n      },\n      ANGLE: {\n        unit: UNITS.rad,\n        prefix: PREFIXES.SHORT['']\n      },\n      BIT: {\n        unit: UNITS.bits,\n        prefix: PREFIXES.SHORT['']\n      },\n      // Derived units\n      FORCE: {\n        unit: UNITS.N,\n        prefix: PREFIXES.SHORT['']\n      },\n      ENERGY: {\n        unit: UNITS.J,\n        prefix: PREFIXES.SHORT['']\n      },\n      POWER: {\n        unit: UNITS.W,\n        prefix: PREFIXES.SHORT['']\n      },\n      PRESSURE: {\n        unit: UNITS.Pa,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CHARGE: {\n        unit: UNITS.C,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CAPACITANCE: {\n        unit: UNITS.F,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_POTENTIAL: {\n        unit: UNITS.V,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_RESISTANCE: {\n        unit: UNITS.ohm,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_INDUCTANCE: {\n        unit: UNITS.H,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CONDUCTANCE: {\n        unit: UNITS.S,\n        prefix: PREFIXES.SHORT['']\n      },\n      MAGNETIC_FLUX: {\n        unit: UNITS.Wb,\n        prefix: PREFIXES.SHORT['']\n      },\n      MAGNETIC_FLUX_DENSITY: {\n        unit: UNITS.T,\n        prefix: PREFIXES.SHORT['']\n      },\n      FREQUENCY: {\n        unit: UNITS.Hz,\n        prefix: PREFIXES.SHORT['']\n      }\n    }\n  }; // Clone to create the other unit systems\n\n  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));\n  UNIT_SYSTEMS.cgs.LENGTH = {\n    unit: UNITS.m,\n    prefix: PREFIXES.SHORT.c\n  };\n  UNIT_SYSTEMS.cgs.MASS = {\n    unit: UNITS.g,\n    prefix: PREFIXES.SHORT['']\n  };\n  UNIT_SYSTEMS.cgs.FORCE = {\n    unit: UNITS.dyn,\n    prefix: PREFIXES.SHORT['']\n  };\n  UNIT_SYSTEMS.cgs.ENERGY = {\n    unit: UNITS.erg,\n    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 = {\n    unit: UNITS.ft,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.MASS = {\n    unit: UNITS.lbm,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.TEMPERATURE = {\n    unit: UNITS.degF,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.FORCE = {\n    unit: UNITS.lbf,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.ENERGY = {\n    unit: UNITS.BTU,\n    prefix: PREFIXES.BTU['']\n  };\n  UNIT_SYSTEMS.us.POWER = {\n    unit: UNITS.hp,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.PRESSURE = {\n    unit: UNITS.psi,\n    prefix: PREFIXES.NONE['']\n  }; // Add additional unit systems here.\n  // Choose a unit system to seed the auto unit system.\n\n  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si)); // Set the current unit system\n\n  var currentUnitSystem = UNIT_SYSTEMS.auto;\n  /**\n   * Set a unit system for formatting derived units.\n   * @param {string} [name] The name of the unit system.\n   */\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   * Return the current unit system.\n   * @return {string} The current unit system.\n   */\n\n\n  Unit.getUnitSystem = function () {\n    for (var _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   * Converters to convert from number to an other numeric type like BigNumber\n   * or Fraction\n   */\n\n\n  Unit.typeConverters = {\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x + ''); // stringify to prevent constructor error\n    },\n    Fraction: function Fraction(x) {\n      return new _Fraction(x);\n    },\n    Complex: function Complex(x) {\n      return x;\n    },\n    number: function number(x) {\n      return x;\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\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  }; // Add dimensions to each built-in unit\n\n\n  for (var _key2 in UNITS) {\n    if (hasOwnProperty(UNITS, _key2)) {\n      var unit = UNITS[_key2];\n      unit.dimensions = unit.base.dimensions;\n    }\n  } // Create aliases\n\n\n  for (var _name2 in ALIASES) {\n    if (hasOwnProperty(ALIASES, _name2)) {\n      var _unit2 = UNITS[ALIASES[_name2]];\n      var alias = {};\n\n      for (var _key3 in _unit2) {\n        if (hasOwnProperty(_unit2, _key3)) {\n          alias[_key3] = _unit2[_key3];\n        }\n      }\n\n      alias.name = _name2;\n      UNITS[_name2] = alias;\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\n\n  Unit.isValidAlpha = function isValidAlpha(c) {\n    return /^[a-zA-Z]$/.test(c);\n  };\n\n  function assertUnitNameIsValid(name) {\n    for (var i = 0; i < name.length; i++) {\n      c = name.charAt(i);\n\n      if (i === 0 && !Unit.isValidAlpha(c)) {\n        throw new Error('Invalid unit name (must begin with alpha character): \"' + name + '\"');\n      }\n\n      if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {\n        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\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    } // Remove all units and aliases we are overriding\n\n\n    if (options && options.override) {\n      for (var _key4 in obj) {\n        if (hasOwnProperty(obj, _key4)) {\n          Unit.deleteUnit(_key4);\n        }\n\n        if (obj[_key4].aliases) {\n          for (var i = 0; i < obj[_key4].aliases.length; i++) {\n            Unit.deleteUnit(obj[_key4].aliases[i]);\n          }\n        }\n      }\n    } // TODO: traverse multiple times until all units have been added\n\n\n    var lastUnit;\n\n    for (var _key5 in obj) {\n      if (hasOwnProperty(obj, _key5)) {\n        lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);\n      }\n    }\n\n    return lastUnit;\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\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    } // Check collisions with existing units\n\n\n    if (hasOwnProperty(UNITS, name)) {\n      throw new Error('Cannot create unit \"' + name + '\": a unit with that name already exists');\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\n    assertUnitNameIsValid(name);\n    var defUnit = null; // The Unit from which the new unit will be created.\n\n    var aliases = [];\n    var offset = 0;\n    var definition;\n    var prefixes;\n    var baseName;\n\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\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 (var 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, {\n          allowNoUnits: true\n        });\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\n    if (prefixes && prefixes.toUpperCase) {\n      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;\n    } else {\n      prefixes = PREFIXES.NONE;\n    } // If defUnit is null, it is because the user did not\n    // specify a defintion. So create a new base dimension.\n\n\n    var newUnit = {};\n\n    if (!defUnit) {\n      // Add a new base dimension\n      baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\n\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\n      BASE_DIMENSIONS.push(baseName); // Push 0 onto existing base units\n\n      for (var b in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, b)) {\n          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;\n        }\n      } // Add the new base unit\n\n\n      var newBaseUnit = {\n        dimensions: []\n      };\n\n      for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {\n        newBaseUnit.dimensions[_i6] = 0;\n      }\n\n      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;\n      newBaseUnit.key = baseName;\n      BASE_UNITS[baseName] = newBaseUnit;\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      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      }; // Create a new base if no matching base exists\n\n      var anyMatch = false;\n\n      for (var _i7 in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, _i7)) {\n          var match = true;\n\n          for (var j = 0; j < BASE_DIMENSIONS.length; j++) {\n            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {\n              match = false;\n              break;\n            }\n          }\n\n          if (match) {\n            anyMatch = true;\n            newUnit.base = BASE_UNITS[_i7];\n            break;\n          }\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\n        var _newBaseUnit = {\n          dimensions: defUnit.dimensions.slice(0)\n        };\n        _newBaseUnit.key = baseName;\n        BASE_UNITS[baseName] = _newBaseUnit;\n        currentUnitSystem[baseName] = {\n          unit: newUnit,\n          prefix: PREFIXES.NONE['']\n        };\n        newUnit.base = BASE_UNITS[baseName];\n      }\n    }\n\n    Unit.UNITS[name] = newUnit;\n\n    for (var _i8 = 0; _i8 < aliases.length; _i8++) {\n      var aliasName = aliases[_i8];\n      var _alias = {};\n\n      for (var _key6 in newUnit) {\n        if (hasOwnProperty(newUnit, _key6)) {\n          _alias[_key6] = newUnit[_key6];\n        }\n      }\n\n      _alias.name = aliasName;\n      Unit.UNITS[aliasName] = _alias;\n    } // delete the memoization cache, since adding a new unit to the array\n    // invalidates all old results\n\n\n    delete _findUnit.cache;\n    return new Unit(null, name);\n  };\n\n  Unit.deleteUnit = function (name) {\n    delete Unit.UNITS[name];\n  }; // expose arrays with prefixes, dimensions, units, systems\n\n\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  return Unit;\n}, {\n  isClass: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'createUnit';\nvar dependencies = ['typed', 'Unit'];\nexport var createCreateUnit = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Unit\n  } = _ref;\n\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    // 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 ObjectObject(obj, options) {\n      return Unit.createUnit(obj, options);\n    },\n    // Same as above but without the options.\n    Object: function Object(obj) {\n      return Unit.createUnit(obj, {});\n    },\n    // Shortcut method for creating one unit.\n    'string, Unit | string | Object, Object': function stringUnitStringObjectObject(name, def, options) {\n      var obj = {};\n      obj[name] = def;\n      return Unit.createUnit(obj, options);\n    },\n    // Same as above but without the options.\n    'string, Unit | string | Object': function stringUnitStringObject(name, def) {\n      var obj = {};\n      obj[name] = def;\n      return Unit.createUnit(obj, {});\n    },\n    // Without a definition, creates a base unit.\n    string: function string(name) {\n      var obj = {};\n      obj[name] = {};\n      return Unit.createUnit(obj, {});\n    }\n  });\n});","import { clone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nvar name = 'eigs';\nvar dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'inv', 'bignumber', 'multiply', 'add'];\nexport var createEigs = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    matrix,\n    addScalar,\n    subtract,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    multiply,\n    add\n  } = _ref;\n\n  /**\n   * Compute eigenvalue and eigenvector of a real symmetric matrix.\n   * Only applicable to two dimensional symmetric matrices. Uses Jacobi\n   * Algorithm. Matrix containing mixed type ('number', 'bignumber', 'fraction')\n   * of elements are not supported. Input matrix or 2D array should contain all elements\n   * of either 'number', 'bignumber' or 'fraction' type. For 'number' and 'fraction', the\n   * eigenvalues are of 'number' type. For 'bignumber' the eigenvalues are of ''bignumber' type.\n   * Eigenvectors are always of 'number' type.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x)\n   *\n   * Examples:\n   *\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = math.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   *     math.multiply(H, math.column(U, 0)) // returns math.multiply(E[0], math.column(U, 0))\n   *     const UTxHxU = math.multiply(math.transpose(U), H, U) // rotates H to the eigen-representation\n   *     E[0] == UTxHxU[0][0]  // returns true\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   * @return {{values: Array, vectors: Array} | {values: Matrix, vectors: Matrix}} Object containing eigenvalues (Array or Matrix) and eigenvectors (2D Array/Matrix with eigenvectors as columns).\n   */\n  return typed('eigs', {\n    Array: function Array(x) {\n      // check array size\n      var mat = matrix(x);\n      var 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      } // use dense 2D matrix implementation\n\n\n      var ans = checkAndSubmit(mat, size[0]);\n      return {\n        values: ans[0],\n        vectors: ans[1]\n      };\n    },\n    Matrix: function Matrix(x) {\n      // use dense 2D array implementation\n      // dense matrix\n      var size = x.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      var ans = checkAndSubmit(x, size[0]);\n      return {\n        values: matrix(ans[0]),\n        vectors: matrix(ans[1])\n      };\n    }\n  }); // Is the matrix\n  // symmetric ?\n\n  function isSymmetric(x, n) {\n    for (var i = 0; i < n; i++) {\n      for (var j = i; j < n; j++) {\n        // not symmtric\n        if (!equal(x[i][j], x[j][i])) {\n          throw new TypeError('Input matrix is not symmetric');\n        }\n      }\n    }\n  } // check input for possible problems\n  // and perform diagonalization efficiently for\n  // specific type of number\n\n\n  function checkAndSubmit(x, n) {\n    var type = x.datatype(); // type check\n\n    if (type === undefined) {\n      type = x.getDataType();\n    }\n\n    if (type !== 'number' && type !== 'BigNumber' && type !== 'Fraction') {\n      if (type === 'mixed') {\n        throw new TypeError('Mixed matrix element type is not supported');\n      } else {\n        throw new TypeError('Matrix element type not supported (' + type + ')');\n      }\n    } else {\n      isSymmetric(x.toArray(), n);\n    } // perform efficient calculation for 'numbers'\n\n\n    if (type === 'number') {\n      return diag(x.toArray());\n    } else if (type === 'Fraction') {\n      var xArr = x.toArray(); // convert fraction to numbers\n\n      for (var i = 0; i < n; i++) {\n        for (var j = i; j < n; j++) {\n          xArr[i][j] = xArr[i][j].valueOf();\n          xArr[j][i] = xArr[i][j];\n        }\n      }\n\n      return diag(x.toArray());\n    } else if (type === 'BigNumber') {\n      return diagBig(x.toArray());\n    }\n  } // diagonalization implementation for number (efficient)\n\n\n  function diag(x) {\n    var N = x.length;\n    var e0 = Math.abs(config.epsilon / N);\n    var psi;\n    var Sij = new Array(N); // Sij is Identity Matrix\n\n    for (var i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0);\n      Sij[i][i] = 1.0;\n    } // initial error\n\n\n    var Vab = getAij(x);\n\n    while (Math.abs(Vab[1]) >= Math.abs(e0)) {\n      var _i = Vab[0][0];\n      var 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\n    var Ei = createArray(N, 0); // eigenvalues\n\n    for (var _i2 = 0; _i2 < N; _i2++) {\n      Ei[_i2] = x[_i2][_i2];\n    }\n\n    return sorting(clone(Ei), clone(Sij));\n  } // diagonalization implementation for bigNumber\n\n\n  function diagBig(x) {\n    var N = x.length;\n    var e0 = abs(config.epsilon / N);\n    var psi;\n    var Sij = new Array(N); // Sij is Identity Matrix\n\n    for (var i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0);\n      Sij[i][i] = 1.0;\n    } // initial error\n\n\n    var Vab = getAijBig(x);\n\n    while (abs(Vab[1]) >= abs(e0)) {\n      var _i3 = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);\n      x = x1Big(x, psi, _i3, j);\n      Sij = Sij1Big(Sij, psi, _i3, j);\n      Vab = getAijBig(x);\n    }\n\n    var Ei = createArray(N, 0); // eigenvalues\n\n    for (var _i4 = 0; _i4 < N; _i4++) {\n      Ei[_i4] = x[_i4][_i4];\n    } // return [clone(Ei), clone(Sij)]\n\n\n    return sorting(clone(Ei), clone(Sij));\n  } // get angle\n\n\n  function getTheta(aii, ajj, aij) {\n    var denom = ajj - aii;\n\n    if (Math.abs(denom) <= config.epsilon) {\n      return Math.PI / 4;\n    } else {\n      return 0.5 * Math.atan(2 * aij / (ajj - aii));\n    }\n  } // get angle\n\n\n  function getThetaBig(aii, ajj, aij) {\n    var denom = subtract(ajj, aii);\n\n    if (abs(denom) <= config.epsilon) {\n      return bignumber(-1).acos().div(4);\n    } else {\n      return multiplyScalar(0.5, atan(multiply(2, aij, inv(denom))));\n    }\n  } // update eigvec\n\n\n  function Sij1(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var Ski = createArray(N, 0);\n    var Skj = createArray(N, 0);\n\n    for (var 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\n    for (var _k = 0; _k < N; _k++) {\n      Sij[_k][i] = Ski[_k];\n      Sij[_k][j] = Skj[_k];\n    }\n\n    return Sij;\n  } // update eigvec for overlap\n\n\n  function Sij1Big(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = cos(theta);\n    var s = sin(theta);\n    var Ski = createArray(N, bignumber(0));\n    var Skj = createArray(N, bignumber(0));\n\n    for (var 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\n    for (var _k2 = 0; _k2 < N; _k2++) {\n      Sij[_k2][i] = Ski[_k2];\n      Sij[_k2][j] = Skj[_k2];\n    }\n\n    return Sij;\n  } // update matrix\n\n\n  function x1Big(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = bignumber(cos(theta));\n    var s = bignumber(sin(theta));\n    var c2 = multiplyScalar(c, c);\n    var s2 = multiplyScalar(s, s);\n    var Aki = createArray(N, bignumber(0));\n    var Akj = createArray(N, bignumber(0)); // 2cs Hij\n\n    var csHij = multiply(bignumber(2), c, s, Hij[i][j]); //  Aii\n\n    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));\n    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j])); // 0  to i\n\n    for (var 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    } // Modify Hij\n\n\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = bignumber(0);\n    Hij[j][i] = bignumber(0); // 0  to i\n\n    for (var _k3 = 0; _k3 < N; _k3++) {\n      if (_k3 !== i && _k3 !== j) {\n        Hij[i][_k3] = Aki[_k3];\n        Hij[_k3][i] = Aki[_k3];\n        Hij[j][_k3] = Akj[_k3];\n        Hij[_k3][j] = Akj[_k3];\n      }\n    }\n\n    return Hij;\n  } // update matrix\n\n\n  function x1(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var c2 = c * c;\n    var s2 = s * s;\n    var Aki = createArray(N, 0);\n    var Akj = createArray(N, 0); //  Aii\n\n    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];\n    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j]; // 0  to i\n\n    for (var 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    } // Modify Hij\n\n\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = 0;\n    Hij[j][i] = 0; // 0  to i\n\n    for (var _k4 = 0; _k4 < N; _k4++) {\n      if (_k4 !== i && _k4 !== j) {\n        Hij[i][_k4] = Aki[_k4];\n        Hij[_k4][i] = Aki[_k4];\n        Hij[j][_k4] = Akj[_k4];\n        Hij[_k4][j] = Akj[_k4];\n      }\n    }\n\n    return Hij;\n  } // get max off-diagonal value from Upper Diagonal\n\n\n  function getAij(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n\n    for (var i = 0; i < N; i++) {\n      for (var 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\n    return [maxIJ, maxMij];\n  } // get max off-diagonal value from Upper Diagonal\n\n\n  function getAijBig(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n\n    for (var i = 0; i < N; i++) {\n      for (var 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\n    return [maxIJ, maxMij];\n  } // sort results\n\n\n  function sorting(E, S) {\n    var N = E.length;\n    var Ef = Array(N);\n    var Sf = Array(N);\n\n    for (var k = 0; k < N; k++) {\n      Sf[k] = Array(N);\n    }\n\n    for (var i = 0; i < N; i++) {\n      var minID = 0;\n      var minE = E[0];\n\n      for (var j = 0; j < E.length; j++) {\n        if (E[j] < minE) {\n          minID = j;\n          minE = E[minID];\n        }\n      }\n\n      Ef[i] = E.splice(minID, 1)[0];\n\n      for (var _k5 = 0; _k5 < N; _k5++) {\n        Sf[_k5][i] = S[_k5][minID];\n\n        S[_k5].splice(minID, 1);\n      }\n    }\n\n    return [clone(Ef), clone(Sf)];\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\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    var array = new Array(size);\n\n    for (var i = 0; i < size; i++) {\n      array[i] = value;\n    }\n\n    return array;\n  }\n});","import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'intersect';\nvar dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar'];\nexport var createIntersect = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    abs,\n    add,\n    addScalar,\n    matrix,\n    multiply,\n    multiplyScalar,\n    divideScalar,\n    subtract,\n    smaller,\n    equalScalar\n  } = _ref;\n\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 null 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': function ArrayArrayArray(x, y, plane) {\n      if (!_3d(x)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n      }\n\n      if (!_3d(y)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n      }\n\n      if (!_4d(plane)) {\n        throw new TypeError('Array with 4 numbers expected as third argument');\n      }\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    'Array, Array, Array, Array': function ArrayArrayArrayArray(w, x, y, z) {\n      if (w.length === 2) {\n        if (!_2d(w)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');\n        }\n\n        return _intersect2d(w, x, y, z);\n      } else if (w.length === 3) {\n        if (!_3d(w)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_3d(x)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');\n        }\n\n        if (!_3d(z)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');\n        }\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    'Matrix, Matrix, Matrix': function MatrixMatrixMatrix(x, y, plane) {\n      return matrix(this(x.valueOf(), y.valueOf(), plane.valueOf()));\n    },\n    'Matrix, Matrix, Matrix, Matrix': function MatrixMatrixMatrixMatrix(w, x, y, z) {\n      // TODO: output matrix type should match input matrix type\n      return matrix(this(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf()));\n    }\n  });\n\n  function _isNumeric(a) {\n    // intersect supports numbers and bignumbers\n    return typeof a === 'number' || isBigNumber(a);\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    var o1 = p1a;\n    var o2 = p2a;\n    var d1 = subtract(o1, p1b);\n    var d2 = subtract(o2, p2b);\n    var det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));\n\n    if (smaller(abs(det), config.epsilon)) {\n      return null;\n    }\n\n    var d20o11 = multiplyScalar(d2[0], o1[1]);\n    var d21o10 = multiplyScalar(d2[1], o1[0]);\n    var d20o21 = multiplyScalar(d2[0], o2[1]);\n    var d21o20 = multiplyScalar(d2[1], o2[0]);\n    var 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    var add1 = multiplyScalar(subtract(a, b), subtract(c, d));\n    var add2 = multiplyScalar(subtract(e, f), subtract(g, h));\n    var 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    var d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);\n\n    var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);\n\n    var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);\n\n    var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);\n\n    var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);\n\n    var ta = divideScalar(subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343)), subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321)));\n    var tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);\n    var pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));\n    var pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));\n    var paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));\n    var pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));\n    var pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));\n    var pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));\n\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    var x1x = multiplyScalar(x1, x);\n    var x2x = multiplyScalar(x2, x);\n    var y1y = multiplyScalar(y1, y);\n    var y2y = multiplyScalar(y2, y);\n    var z1z = multiplyScalar(z1, z);\n    var z2z = multiplyScalar(z2, z);\n    var t = divideScalar(subtract(subtract(subtract(c, x1x), y1y), z1z), subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z));\n    var px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));\n    var py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));\n    var pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));\n    return [px, py, pz]; // TODO: Add cases when line is parallel to the plane:\n    //       (a) no intersection,\n    //       (b) line contained in plane\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createUsolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var r = _denseBackwardSubstitution(m, b);\n\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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // result\n\n    var x = [];\n    var mdata = m._data; // loop columns backwards\n\n    for (var j = columns - 1; j >= 0; j--) {\n      // b[j]\n      var bj = bdata[j][0] || 0; // x[j]\n\n      var xj = void 0;\n\n      if (!equalScalar(bj, 0)) {\n        // value at [j, j]\n        var 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); // loop rows\n\n        for (var 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      } // update x\n\n\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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // result\n\n    var x = []; // loop columns backwards\n\n    for (var j = columns - 1; j >= 0; j--) {\n      var bj = bdata[j][0] || 0;\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n        var vjj = 0; // upper triangular matrix values & index (column j)\n\n        var jValues = [];\n        var jIndices = []; // first & last indeces in column\n\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j], loop backwards\n\n        for (var k = lastIndex - 1; k >= firstIndex; k--) {\n          var i = index[k]; // check row (rows are not sorted!)\n\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        } // at this point we must have a value in vjj\n\n\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n\n        var xj = divideScalar(bj, vjj);\n\n        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {\n          var _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});","import { factory } from '../../utils/factory.js';\nvar name = 'norm';\nvar dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];\nexport var createNorm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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    Complex: function Complex(x) {\n      return x.abs();\n    },\n    BigNumber: function BigNumber(x) {\n      // norm(x) = abs(x)\n      return x.abs();\n    },\n    boolean: function boolean(x) {\n      // norm(x) = abs(x)\n      return Math.abs(x);\n    },\n    Array: function Array(x) {\n      return _norm(matrix(x), 2);\n    },\n    Matrix: function Matrix(x) {\n      return _norm(x, 2);\n    },\n    'number | Complex | BigNumber | boolean, number | BigNumber | string': function numberComplexBigNumberBooleanNumberBigNumberString(x) {\n      // ignore second parameter, TODO: remove the option of second parameter for these types\n      return this(x);\n    },\n    'Array, number | BigNumber | string': function ArrayNumberBigNumberString(x, p) {\n      return _norm(matrix(x), p);\n    },\n    'Matrix, number | BigNumber | string': function MatrixNumberBigNumberString(x, p) {\n      return _norm(x, p);\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\n  function _vectorNormPlusInfinity(x) {\n    // norm(x, Infinity) = max(abs(x))\n    var pinf = 0; // skip zeros since abs(0) === 0\n\n    x.forEach(function (value) {\n      var v = abs(value);\n\n      if (larger(v, pinf)) {\n        pinf = v;\n      }\n    }, true);\n    return pinf;\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\n\n  function _vectorNormMinusInfinity(x) {\n    // norm(x, -Infinity) = min(abs(x))\n    var ninf; // skip zeros since abs(0) === 0\n\n    x.forEach(function (value) {\n      var v = abs(value);\n\n      if (!ninf || smaller(v, ninf)) {\n        ninf = v;\n      }\n    }, true);\n    return ninf || 0;\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\n\n  function _vectorNorm(x, p) {\n    // check p\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _vectorNormPlusInfinity(x);\n    }\n\n    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {\n      return _vectorNormMinusInfinity(x);\n    }\n\n    if (p === 'fro') {\n      return _norm(x, 2);\n    }\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        var n = 0; // skip zeros since abs(0) === 0\n\n        x.forEach(function (value) {\n          n = add(pow(abs(value), p), n);\n        }, true);\n        return pow(n, 1 / p);\n      }\n\n      return Number.POSITIVE_INFINITY;\n    } // invalid parameter value\n\n\n    throw new Error('Unsupported parameter value');\n  }\n  /**\n   * Calculate the Frobenius norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormFrobenius(x) {\n    // norm(x) = sqrt(sum(diag(x'x)))\n    var 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   * Calculate the norm L1 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormOne(x) {\n    // norm(x) = the largest column sum\n    var c = []; // result\n\n    var maxc = 0; // skip zeros since abs(0) == 0\n\n    x.forEach(function (value, index) {\n      var j = index[1];\n      var cj = add(c[j] || 0, abs(value));\n\n      if (larger(cj, maxc)) {\n        maxc = cj;\n      }\n\n      c[j] = cj;\n    }, true);\n    return maxc;\n  }\n  /**\n   * Calculate the norm L2 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormTwo(x) {\n    // norm(x) = sqrt( max eigenvalue of A*.A)\n    var sizeX = x.size();\n\n    if (sizeX[0] !== sizeX[1]) {\n      throw new RangeError('Invalid matrix dimensions');\n    }\n\n    var tx = ctranspose(x);\n    var squaredX = multiply(tx, x);\n    var eigenVals = eigs(squaredX).values;\n    var rho = eigenVals.get([eigenVals.size()[0] - 1]);\n    return abs(sqrt(rho));\n  }\n  /**\n   * Calculate the infinity norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormInfinity(x) {\n    // norm(x) = the largest row sum\n    var r = []; // result\n\n    var maxr = 0; // skip zeros since abs(0) == 0\n\n    x.forEach(function (value, index) {\n      var i = index[0];\n      var ri = add(r[i] || 0, abs(value));\n\n      if (larger(ri, maxr)) {\n        maxr = ri;\n      }\n\n      r[i] = ri;\n    }, true);\n    return maxr;\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\n\n  function _matrixNorm(x, p) {\n    // check p\n    if (p === 1) {\n      return _matrixNormOne(x);\n    }\n\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _matrixNormInfinity(x);\n    }\n\n    if (p === 'fro') {\n      return _matrixNormFrobenius(x);\n    }\n\n    if (p === 2) {\n      return _matrixNormTwo(x);\n    } // invalid parameter value\n\n\n    throw new Error('Unsupported parameter value ' + p);\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\n\n  function _norm(x, p) {\n    // size\n    var sizeX = x.size(); // check if it is a vector\n\n    if (sizeX.length === 1) {\n      return _vectorNorm(x, p);\n    } // MxN matrix\n\n\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 * 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  var k;\n  var n = b.length;\n  var x = []; // check permutation vector was provided, p = null denotes identity\n\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\n  return x;\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';\nvar name = 'lusolve';\nvar dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];\nexport var createLusolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    lup,\n    slu,\n    usolve,\n    lsolve,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      a = matrix(a);\n      var d = lup(a);\n\n      var x = _lusolve(d.L, d.U, d.p, null, b);\n\n      return x.valueOf();\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(a, b) {\n      var d = lup(a);\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(a, b) {\n      var d = lup(a);\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix, number, number': function SparseMatrixArrayMatrixNumberNumber(a, b, order, threshold) {\n      var d = slu(a, order, threshold);\n      return _lusolve(d.L, d.U, d.p, d.q, b);\n    },\n    'Object, Array | Matrix': function ObjectArrayMatrix(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)) {\n      return a;\n    }\n\n    if (isArray(a)) {\n      return matrix(a);\n    }\n\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); // apply row permutations if needed (b is a DenseMatrix)\n\n    if (p) {\n      b = solveValidation(l, b, true);\n      b._data = csIpvec(p, b._data);\n    } // use forward substitution to resolve L * y = b\n\n\n    var y = lsolve(l, b); // use backward substitution to resolve U * x = y\n\n    var x = usolve(u, y); // apply column permutations if needed (x is a DenseMatrix)\n\n    if (q) {\n      x._data = csIpvec(q, x._data);\n    }\n\n    return x;\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';\nvar name = 'sqrtm';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];\nexport var createSqrtm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    add,\n    multiply,\n    sqrt,\n    subtract,\n    inv,\n    size,\n    max,\n    identity\n  } = _ref;\n  var _maxIterations = 1e3;\n  var _tolerance = 1e-6;\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\n  function _denmanBeavers(A) {\n    var error;\n    var iterations = 0;\n    var Y = A;\n    var Z = identity(size(A));\n\n    do {\n      var Yk = Y;\n      Y = multiply(0.5, add(Yk, inv(Z)));\n      Z = multiply(0.5, add(Z, inv(Yk)));\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   * 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\n\n  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(A) {\n      var size = isMatrix(A) ? A.size() : arraySize(A);\n\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 ' + '(size: ' + format(size) + ')');\n          }\n\n        case 2:\n          {\n            // Two-dimensional Array | Matrix\n            var rows = size[0];\n            var cols = size[1];\n\n            if (rows === cols) {\n              return _denmanBeavers(A);\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n\n        default:\n          // Multi dimensional array\n          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + format(size) + ')');\n      }\n    }\n  });\n});","import { deepForEach } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'multinomial';\nvar dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];\nexport var createMultinomial = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide,\n    multiply,\n    factorial,\n    isInteger,\n    isPositive\n  } = _ref;\n\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 ArrayMatrix(a) {\n      var sum = 0;\n      var denom = 1;\n      deepForEach(a, function (ai) {\n        if (!isInteger(ai) || !isPositive(ai)) {\n          throw new TypeError('Positive integer value expected in function multinomial');\n        }\n\n        sum = add(sum, ai);\n        denom = multiply(denom, factorial(ai));\n      });\n      return divide(factorial(sum), denom);\n    }\n  });\n});","import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'rotationMatrix';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];\nexport var createRotationMatrix = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    addScalar,\n    unaryMinus,\n    norm,\n    BigNumber,\n    matrix,\n    DenseMatrix,\n    SparseMatrix,\n    cos,\n    sin\n  } = _ref;\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  return typed(name, {\n    '': function _() {\n      return config.matrix === 'Matrix' ? matrix([]) : [];\n    },\n    string: function string(format) {\n      return matrix(format);\n    },\n    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(theta) {\n      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber | Complex | Unit, string': function numberBigNumberComplexUnitString(theta, format) {\n      return _rotationMatrix2x2(theta, format);\n    },\n    'number | BigNumber | Complex | Unit, Array': function numberBigNumberComplexUnitArray(theta, v) {\n      var matrixV = matrix(v);\n\n      _validateVector(matrixV);\n\n      return _rotationMatrix3x3(theta, matrixV, undefined);\n    },\n    'number | BigNumber | Complex | Unit, Matrix': function numberBigNumberComplexUnitMatrix(theta, v) {\n      _validateVector(v);\n\n      var storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined);\n      return _rotationMatrix3x3(theta, v, storageType);\n    },\n    'number | BigNumber | Complex | Unit, Array, string': function numberBigNumberComplexUnitArrayString(theta, v, format) {\n      var matrixV = matrix(v);\n\n      _validateVector(matrixV);\n\n      return _rotationMatrix3x3(theta, matrixV, format);\n    },\n    'number | BigNumber | Complex | Unit, Matrix, string': function numberBigNumberComplexUnitMatrixString(theta, v, format) {\n      _validateVector(v);\n\n      return _rotationMatrix3x3(theta, v, format);\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\n  function _rotationMatrix2x2(theta, format) {\n    var Big = isBigNumber(theta);\n    var minusOne = Big ? new BigNumber(-1) : -1;\n    var cosTheta = cos(theta);\n    var sinTheta = sin(theta);\n    var data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]];\n    return _convertToFormat(data, format);\n  }\n\n  function _validateVector(v) {\n    var size = v.size();\n\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\n      if (format === 'dense') {\n        return new DenseMatrix(data);\n      }\n\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    }\n\n    return data;\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\n\n  function _rotationMatrix3x3(theta, v, format) {\n    var normV = norm(v);\n\n    if (normV === 0) {\n      throw new RangeError('Rotation around zero vector');\n    }\n\n    var Big = isBigNumber(theta) ? BigNumber : null;\n    var one = Big ? new Big(1) : 1;\n    var minusOne = Big ? new Big(-1) : -1;\n    var vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV;\n    var vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV;\n    var vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV;\n    var c = cos(theta);\n    var oneMinusC = addScalar(one, unaryMinus(c));\n    var s = sin(theta);\n    var r11 = addScalar(c, _mul([vx, vx, oneMinusC]));\n    var r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]));\n    var r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]));\n    var r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]));\n    var r22 = addScalar(c, _mul([vy, vy, oneMinusC]));\n    var r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]));\n    var r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]));\n    var r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]));\n    var r33 = addScalar(c, _mul([vz, vz, oneMinusC]));\n    var data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]];\n    return _convertToFormat(data, format);\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';\nvar name = 'median';\nvar dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];\nexport var createMedian = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide,\n    compare,\n    partitionSelect\n  } = _ref;\n\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      var num = array.length;\n\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        var mid = num / 2 - 1;\n        var right = partitionSelect(array, mid + 1); // array now partitioned at mid + 1, take max of left part\n\n        var left = array[mid];\n\n        for (var 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        var m = partitionSelect(array, (num - 1) / 2);\n        return middle(m);\n      }\n    } catch (err) {\n      throw improveErrorMessage(err, 'median');\n    }\n  } // helper function to type check the middle value of the array\n\n\n  var middle = typed({\n    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(value) {\n      return value;\n    }\n  }); // helper function to type check the two middle value of the array\n\n  var middle2 = typed({\n    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function numberBigNumberComplexUnitNumberBigNumberComplexUnit(left, right) {\n      return divide(add(left, right), 2);\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\n  return typed(name, {\n    // median([a, b, c, d, ...])\n    'Array | Matrix': _median,\n    // median([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      // TODO: implement median(A, dim)\n      throw new Error('median(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], ...)\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});","import { factory } from '../../utils/factory.js';\nimport { arraySize } from '../../utils/array.js';\nvar name = 'rotate';\nvar dependencies = ['typed', 'multiply', 'rotationMatrix'];\nexport var createRotate = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    multiply,\n    rotationMatrix\n  } = _ref;\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 ArrayNumberBigNumberComplexUnit(w, theta) {\n      _validateSize(w, 2);\n\n      var matrixRes = multiply(rotationMatrix(theta), w);\n      return matrixRes.toArray();\n    },\n    'Matrix , number | BigNumber | Complex | Unit': function MatrixNumberBigNumberComplexUnit(w, theta) {\n      _validateSize(w, 2);\n\n      return multiply(rotationMatrix(theta), w);\n    },\n    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function ArrayNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {\n      _validateSize(w, 3);\n\n      var matrixRes = multiply(rotationMatrix(theta, v), w);\n      return matrixRes;\n    },\n    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function MatrixNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {\n      _validateSize(w, 3);\n\n      return multiply(rotationMatrix(theta, v), w);\n    }\n  });\n\n  function _validateSize(v, expectedSize) {\n    var actualSize = Array.isArray(v) ? arraySize(v) : v.size();\n\n    if (actualSize.length > 2) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n\n    if (actualSize.length === 2 && actualSize[1] !== 1) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n\n    if (actualSize[0] !== expectedSize) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n  }\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'mad';\nvar dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];\nexport var createMad = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    map,\n    median,\n    subtract\n  } = _ref;\n\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    // 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      var 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});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'unit';\nvar dependencies = ['typed', 'Unit']; // This function is named createUnitFunction to prevent a naming conflict with createUnit\n\nexport var createUnitFunction = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Unit\n  } = _ref;\n\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  return typed(name, {\n    Unit: function Unit(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      if (Unit.isValuelessUnit(x)) {\n        return new Unit(null, x); // a pure unit\n      }\n\n      return Unit.parse(x, {\n        allowNoUnits: true\n      }); // a unit with value, like '5cm'\n    },\n    'number | BigNumber | Fraction | Complex, string': function numberBigNumberFractionComplexString(value, unit) {\n      return new Unit(value, unit);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createResultSet, createComplexClass, createRangeClass, createFalse, createNull, createTrue, createBigNumberClass, createMatrixClass, createReplacer, createI, createLN10, createLOG10E, createNaN, createPi, createSQRT1_2 // eslint-disable-line camelcase\n, createTau, createEfimovFactor, createFineStructure, createSackurTetrode, createWeakMixingAngle, createFractionClass, createE, createInfinity, createLOG2E, createVersion, createDenseMatrixClass, createPhi, createTyped, createIsInteger, createIsNumeric, createIsPositive, createIsNaN, createEqualScalar, createNumber, createBoolean, createComplex, createSplitUnit, createUnaryPlus, createApply, createCube, createExpm1, createLog10, createMultiplyScalar, createSign, createSquare, createBitNot, createArg, createIm, createNot, createFilter, createForEach, createMap, createErf, createFormat, createOct, createPrint, createIsPrime, createAcos, createAcot, createAcsc, createAsec, createAsin, createAtan, createAtanh, createCosh, createCoth, createCsch, createSech, createSinh, createTanh, createCombinations, createPickRandom, createRandomInt, createLN2, createClone, createHasNumericValue, createTypeOf, createString, createFraction, createUnaryMinus, createAddScalar, createExp, createLog2, createSqrt, createConj, createGetMatrixDataType, createMode, createBin, createAcosh, createAcsch, createAsinh, createCos, createCsc, createSin, createCombinationsWithRep, createRandom, createSQRT2, createIsNegative, createSparseMatrixClass, createMatrix, createCbrt, createGcd, createMod, createNthRoot, createXgcd, createBitAnd, createBitXor, createOr, createConcat, createDiag, createIdentity, createOnes, createReshape, createSize, createSubset, createZeros, createHex, createRound, createLeftShift, createRightLogShift, createCompare, createCompareText, createSmaller, createLarger, createUnequal, createImmutableDenseMatrixClass, createFibonacciHeapClass, createSparse, createAcoth, createAtan2, createSec, createAdd, createDot, createComposition, createIsZero, createAbs, createFloor, createMultiply, createDotMultiply, createRe, createFlatten, createResize, createSqueeze, createTo, createPow, createDotPow, createRightArithShift, createCompareNatural, createEqualText, createLargerEq, createPartitionSelect, createIndexClass, createAsech, createTan, createSetDifference, createSetIntersect, createSetMultiplicity, createSetSize, createTrace, createQuantileSeq, createGamma, createBignumber, createLcm, createBitOr, createKron, createTranspose, createNumeric, createAnd, createSmallerEq, createSort, createMin, createCot, createSetDistinct, createSetPowerset, createIndex, createSum, createFactorial, createPermutations, createCeil, createSubtract, createCross, createRange, createRow, createProd, createEqual, createMax, createSetCartesian, createSetSymDifference, createFix, createColumn, createDiff, createCtranspose, createDeepEqual, createSetIsSubset, createXor, createDivideScalar, createNthRoots, createLsolve, createLsolveAll, createSpaClass, createSetUnion, createLup, createSlu, createDet, createDistance, createStirlingS2, createCatalan, createCount, createLog, createDotDivide, createUsolveAll, createHypot, createQr, createInv, createExpm, createDivide, createMean, createVariance, createKldivergence, createBellNumbers, createLog1p, createUnitClass, createCreateUnit, createEigs, createIntersect, createStd, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createDeuteronMass, createElectronMass, createFaraday, createFirstRadiation, createGravitationConstant, createHartreeEnergy, createKlitzing, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createPlanckCharge, createPlanckLength, createPlanckTemperature, createProtonMass, createReducedPlanckConstant, createSecondRadiation, createStefanBoltzmann, createVacuumImpedance, createUsolve, createNorm, createLusolve, createSqrtm, createMultinomial, createAvogadro, createClassicalElectronRadius, createElectricConstant, createFermiCoupling, createGravity, createLoschmidt, createMolarMassC12, createNuclearMagneton, createPlanckMass, createQuantumOfCirculation, createSpeedOfLight, createWienDisplacement, createRotationMatrix, createMedian, createBohrRadius, createElementaryCharge, createInverseConductanceQuantum, createMolarVolume, createPlanckTime, createThomsonCrossSection, createRotate, createMad, createCoulomb, createMagneticFluxQuantum, createRydberg, createUnitFunction, createGasConstant, createPlanckConstant } from '../factoriesAny.js';\nexport var ResultSet = /* #__PURE__ */createResultSet({});\nexport var Complex = /* #__PURE__ */createComplexClass({});\nexport var Range = /* #__PURE__ */createRangeClass({});\nexport var _false = /* #__PURE__ */createFalse({});\nexport var _null = /* #__PURE__ */createNull({});\nexport var _true = /* #__PURE__ */createTrue({});\nexport var BigNumber = /* #__PURE__ */createBigNumberClass({\n  config\n});\nexport var Matrix = /* #__PURE__ */createMatrixClass({});\nexport var replacer = /* #__PURE__ */createReplacer({});\nexport var i = /* #__PURE__ */createI({\n  Complex\n});\nexport var LN10 = /* #__PURE__ */createLN10({\n  BigNumber,\n  config\n});\nexport var LOG10E = /* #__PURE__ */createLOG10E({\n  BigNumber,\n  config\n});\nexport var _NaN = /* #__PURE__ */createNaN({\n  BigNumber,\n  config\n});\nexport var pi = /* #__PURE__ */createPi({\n  BigNumber,\n  config\n});\nexport var SQRT1_2 = /* #__PURE__ */createSQRT1_2({\n  BigNumber,\n  config\n});\nexport var tau = /* #__PURE__ */createTau({\n  BigNumber,\n  config\n});\nexport var efimovFactor = /* #__PURE__ */createEfimovFactor({\n  BigNumber,\n  config\n});\nexport var fineStructure = /* #__PURE__ */createFineStructure({\n  BigNumber,\n  config\n});\nexport var sackurTetrode = /* #__PURE__ */createSackurTetrode({\n  BigNumber,\n  config\n});\nexport var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({\n  BigNumber,\n  config\n});\nexport var Fraction = /* #__PURE__ */createFractionClass({});\nexport var e = /* #__PURE__ */createE({\n  BigNumber,\n  config\n});\nexport var _Infinity = /* #__PURE__ */createInfinity({\n  BigNumber,\n  config\n});\nexport var LOG2E = /* #__PURE__ */createLOG2E({\n  BigNumber,\n  config\n});\nexport var version = /* #__PURE__ */createVersion({});\nexport var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({\n  Matrix\n});\nexport var phi = /* #__PURE__ */createPhi({\n  BigNumber,\n  config\n});\nexport var typed = /* #__PURE__ */createTyped({\n  BigNumber,\n  Complex,\n  DenseMatrix,\n  Fraction\n});\nexport var isInteger = /* #__PURE__ */createIsInteger({\n  typed\n});\nexport var isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  typed\n});\nexport var isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var equalScalar = /* #__PURE__ */createEqualScalar({\n  config,\n  typed\n});\nexport var number = /* #__PURE__ */createNumber({\n  typed\n});\nexport var boolean = /* #__PURE__ */createBoolean({\n  typed\n});\nexport var complex = /* #__PURE__ */createComplex({\n  Complex,\n  typed\n});\nexport var splitUnit = /* #__PURE__ */createSplitUnit({\n  typed\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  BigNumber,\n  config,\n  typed\n});\nexport var apply = /* #__PURE__ */createApply({\n  isInteger,\n  typed\n});\nexport var cube = /* #__PURE__ */createCube({\n  typed\n});\nexport var expm1 = /* #__PURE__ */createExpm1({\n  Complex,\n  typed\n});\nexport var log10 = /* #__PURE__ */createLog10({\n  Complex,\n  config,\n  typed\n});\nexport var multiplyScalar = /* #__PURE__ */createMultiplyScalar({\n  typed\n});\nexport var sign = /* #__PURE__ */createSign({\n  BigNumber,\n  Fraction,\n  complex,\n  typed\n});\nexport var square = /* #__PURE__ */createSquare({\n  typed\n});\nexport var bitNot = /* #__PURE__ */createBitNot({\n  typed\n});\nexport var arg = /* #__PURE__ */createArg({\n  typed\n});\nexport var im = /* #__PURE__ */createIm({\n  typed\n});\nexport var not = /* #__PURE__ */createNot({\n  typed\n});\nexport var filter = /* #__PURE__ */createFilter({\n  typed\n});\nexport var forEach = /* #__PURE__ */createForEach({\n  typed\n});\nexport var map = /* #__PURE__ */createMap({\n  typed\n});\nexport var erf = /* #__PURE__ */createErf({\n  typed\n});\nexport var format = /* #__PURE__ */createFormat({\n  typed\n});\nexport var oct = /* #__PURE__ */createOct({\n  format,\n  typed\n});\nexport var print = /* #__PURE__ */createPrint({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var acos = /* #__PURE__ */createAcos({\n  Complex,\n  config,\n  typed\n});\nexport var acot = /* #__PURE__ */createAcot({\n  BigNumber,\n  typed\n});\nexport var acsc = /* #__PURE__ */createAcsc({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asec = /* #__PURE__ */createAsec({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asin = /* #__PURE__ */createAsin({\n  Complex,\n  config,\n  typed\n});\nexport var atan = /* #__PURE__ */createAtan({\n  typed\n});\nexport var atanh = /* #__PURE__ */createAtanh({\n  Complex,\n  config,\n  typed\n});\nexport var cosh = /* #__PURE__ */createCosh({\n  typed\n});\nexport var coth = /* #__PURE__ */createCoth({\n  BigNumber,\n  typed\n});\nexport var csch = /* #__PURE__ */createCsch({\n  BigNumber,\n  typed\n});\nexport var sech = /* #__PURE__ */createSech({\n  BigNumber,\n  typed\n});\nexport var sinh = /* #__PURE__ */createSinh({\n  typed\n});\nexport var tanh = /* #__PURE__ */createTanh({\n  typed\n});\nexport var combinations = /* #__PURE__ */createCombinations({\n  typed\n});\nexport var pickRandom = /* #__PURE__ */createPickRandom({\n  config,\n  typed\n});\nexport var randomInt = /* #__PURE__ */createRandomInt({\n  config,\n  typed\n});\nexport var LN2 = /* #__PURE__ */createLN2({\n  BigNumber,\n  config\n});\nexport var clone = /* #__PURE__ */createClone({\n  typed\n});\nexport var hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\n});\nexport var typeOf = /* #__PURE__ */createTypeOf({\n  typed\n});\nexport var string = /* #__PURE__ */createString({\n  typed\n});\nexport var fraction = /* #__PURE__ */createFraction({\n  Fraction,\n  typed\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\n  typed\n});\nexport var addScalar = /* #__PURE__ */createAddScalar({\n  typed\n});\nexport var exp = /* #__PURE__ */createExp({\n  typed\n});\nexport var log2 = /* #__PURE__ */createLog2({\n  Complex,\n  config,\n  typed\n});\nexport var sqrt = /* #__PURE__ */createSqrt({\n  Complex,\n  config,\n  typed\n});\nexport var conj = /* #__PURE__ */createConj({\n  typed\n});\nexport var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({\n  typed\n});\nexport var mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var bin = /* #__PURE__ */createBin({\n  format,\n  typed\n});\nexport var acosh = /* #__PURE__ */createAcosh({\n  Complex,\n  config,\n  typed\n});\nexport var acsch = /* #__PURE__ */createAcsch({\n  BigNumber,\n  typed\n});\nexport var asinh = /* #__PURE__ */createAsinh({\n  typed\n});\nexport var cos = /* #__PURE__ */createCos({\n  typed\n});\nexport var csc = /* #__PURE__ */createCsc({\n  BigNumber,\n  typed\n});\nexport var sin = /* #__PURE__ */createSin({\n  typed\n});\nexport var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({\n  typed\n});\nexport var random = /* #__PURE__ */createRandom({\n  config,\n  typed\n});\nexport var SQRT2 = /* #__PURE__ */createSQRT2({\n  BigNumber,\n  config\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  typed\n});\nexport var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({\n  Matrix,\n  equalScalar,\n  typed\n});\nexport var matrix = /* #__PURE__ */createMatrix({\n  DenseMatrix,\n  Matrix,\n  SparseMatrix,\n  typed\n});\nexport var cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var gcd = /* #__PURE__ */createGcd({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var mod = /* #__PURE__ */createMod({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var xgcd = /* #__PURE__ */createXgcd({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var bitAnd = /* #__PURE__ */createBitAnd({\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitXor = /* #__PURE__ */createBitXor({\n  DenseMatrix,\n  matrix,\n  typed\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\n  typed\n});\nexport var diag = /* #__PURE__ */createDiag({\n  DenseMatrix,\n  SparseMatrix,\n  matrix,\n  typed\n});\nexport var identity = /* #__PURE__ */createIdentity({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var ones = /* #__PURE__ */createOnes({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\n});\nexport var size = /* #__PURE__ */createSize({\n  matrix,\n  config,\n  typed\n});\nexport var subset = /* #__PURE__ */createSubset({\n  matrix,\n  typed\n});\nexport var zeros = /* #__PURE__ */createZeros({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var hex = /* #__PURE__ */createHex({\n  format,\n  typed\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var leftShift = /* #__PURE__ */createLeftShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var compare = /* #__PURE__ */createCompare({\n  BigNumber,\n  DenseMatrix,\n  Fraction,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var compareText = /* #__PURE__ */createCompareText({\n  matrix,\n  typed\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var unequal = /* #__PURE__ */createUnequal({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({\n  DenseMatrix,\n  smaller\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var sparse = /* #__PURE__ */createSparse({\n  SparseMatrix,\n  typed\n});\nexport var acoth = /* #__PURE__ */createAcoth({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var atan2 = /* #__PURE__ */createAtan2({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var sec = /* #__PURE__ */createSec({\n  BigNumber,\n  typed\n});\nexport var add = /* #__PURE__ */createAdd({\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var composition = /* #__PURE__ */createComposition({\n  addScalar,\n  combinations,\n  isInteger,\n  isNegative,\n  isPositive,\n  larger,\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  typed\n});\nexport var abs = /* #__PURE__ */createAbs({\n  typed\n});\nexport var floor = /* #__PURE__ */createFloor({\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed\n});\nexport var multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var dotMultiply = /* #__PURE__ */createDotMultiply({\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var re = /* #__PURE__ */createRe({\n  typed\n});\nexport var flatten = /* #__PURE__ */createFlatten({\n  matrix,\n  typed\n});\nexport var resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var squeeze = /* #__PURE__ */createSqueeze({\n  matrix,\n  typed\n});\nexport var to = /* #__PURE__ */createTo({\n  matrix,\n  typed\n});\nexport var pow = /* #__PURE__ */createPow({\n  Complex,\n  config,\n  fraction,\n  identity,\n  matrix,\n  multiply,\n  number,\n  typed\n});\nexport var dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\n  typed\n});\nexport var equalText = /* #__PURE__ */createEqualText({\n  compareText,\n  isZero,\n  typed\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var Index = /* #__PURE__ */createIndexClass({\n  ImmutableDenseMatrix\n});\nexport var asech = /* #__PURE__ */createAsech({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var tan = /* #__PURE__ */createTan({\n  typed\n});\nexport var setDifference = /* #__PURE__ */createSetDifference({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setMultiplicity = /* #__PURE__ */createSetMultiplicity({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSize = /* #__PURE__ */createSetSize({\n  compareNatural,\n  typed\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\n  typed\n});\nexport var quantileSeq = /* #__PURE__ */createQuantileSeq({\n  add,\n  compare,\n  multiply,\n  partitionSelect,\n  typed\n});\nexport var gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var bignumber = /* #__PURE__ */createBignumber({\n  BigNumber,\n  typed\n});\nexport var lcm = /* #__PURE__ */createLcm({\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitOr = /* #__PURE__ */createBitOr({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var transpose = /* #__PURE__ */createTranspose({\n  matrix,\n  typed\n});\nexport var numeric = /* #__PURE__ */createNumeric({\n  bignumber,\n  fraction,\n  number\n});\nexport var and = /* #__PURE__ */createAnd({\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  numeric,\n  smaller,\n  typed\n});\nexport var cot = /* #__PURE__ */createCot({\n  BigNumber,\n  typed\n});\nexport var setDistinct = /* #__PURE__ */createSetDistinct({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setPowerset = /* #__PURE__ */createSetPowerset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\n  typed\n});\nexport var sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\n});\nexport var factorial = /* #__PURE__ */createFactorial({\n  gamma,\n  typed\n});\nexport var permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  addScalar,\n  equalScalar,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var cross = /* #__PURE__ */createCross({\n  matrix,\n  multiply,\n  subtract,\n  typed\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  config,\n  larger,\n  largerEq,\n  smaller,\n  smallerEq,\n  typed\n});\nexport var row = /* #__PURE__ */createRow({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var prod = /* #__PURE__ */createProd({\n  config,\n  multiplyScalar,\n  numeric,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  larger,\n  numeric,\n  typed\n});\nexport var setCartesian = /* #__PURE__ */createSetCartesian({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSymDifference = /* #__PURE__ */createSetSymDifference({\n  Index,\n  concat,\n  setDifference,\n  size,\n  subset,\n  typed\n});\nexport var fix = /* #__PURE__ */createFix({\n  Complex,\n  ceil,\n  floor,\n  matrix,\n  typed\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var diff = /* #__PURE__ */createDiff({\n  matrix,\n  number,\n  subtract,\n  typed\n});\nexport var ctranspose = /* #__PURE__ */createCtranspose({\n  conj,\n  transpose,\n  typed\n});\nexport var deepEqual = /* #__PURE__ */createDeepEqual({\n  equal,\n  typed\n});\nexport var setIsSubset = /* #__PURE__ */createSetIsSubset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var xor = /* #__PURE__ */createXor({\n  DenseMatrix,\n  matrix,\n  typed\n});\nexport var divideScalar = /* #__PURE__ */createDivideScalar({\n  numeric,\n  typed\n});\nexport var nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var lsolveAll = /* #__PURE__ */createLsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\n});\nexport var setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var lup = /* #__PURE__ */createLup({\n  DenseMatrix,\n  Spa,\n  SparseMatrix,\n  abs,\n  addScalar,\n  divideScalar,\n  equalScalar,\n  larger,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var slu = /* #__PURE__ */createSlu({\n  SparseMatrix,\n  abs,\n  add,\n  divideScalar,\n  larger,\n  largerEq,\n  multiply,\n  subtract,\n  transpose,\n  typed\n});\nexport var det = /* #__PURE__ */createDet({\n  lup,\n  matrix,\n  multiply,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var distance = /* #__PURE__ */createDistance({\n  abs,\n  addScalar,\n  divideScalar,\n  multiplyScalar,\n  sqrt,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var stirlingS2 = /* #__PURE__ */createStirlingS2({\n  addScalar,\n  combinations,\n  divideScalar,\n  factorial,\n  isInteger,\n  isNegative,\n  larger,\n  multiplyScalar,\n  pow,\n  subtract,\n  typed\n});\nexport var catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var count = /* #__PURE__ */createCount({\n  prod,\n  size,\n  typed\n});\nexport var log = /* #__PURE__ */createLog({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var dotDivide = /* #__PURE__ */createDotDivide({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var usolveAll = /* #__PURE__ */createUsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var hypot = /* #__PURE__ */createHypot({\n  abs,\n  addScalar,\n  divideScalar,\n  isPositive,\n  multiplyScalar,\n  smaller,\n  sqrt,\n  typed\n});\nexport var qr = /* #__PURE__ */createQr({\n  addScalar,\n  complex,\n  conj,\n  divideScalar,\n  equal,\n  identity,\n  isZero,\n  matrix,\n  multiplyScalar,\n  sign,\n  sqrt,\n  subtract,\n  typed,\n  unaryMinus,\n  zeros\n});\nexport var inv = /* #__PURE__ */createInv({\n  abs,\n  addScalar,\n  det,\n  divideScalar,\n  identity,\n  matrix,\n  multiply,\n  typed,\n  unaryMinus\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var mean = /* #__PURE__ */createMean({\n  add,\n  divide,\n  typed\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  apply,\n  divide,\n  isNaN,\n  multiply,\n  subtract,\n  typed\n});\nexport var kldivergence = /* #__PURE__ */createKldivergence({\n  divide,\n  dotDivide,\n  isNumeric,\n  log,\n  matrix,\n  multiply,\n  sum,\n  typed\n});\nexport var bellNumbers = /* #__PURE__ */createBellNumbers({\n  addScalar,\n  isInteger,\n  isNegative,\n  stirlingS2,\n  typed\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\n  typed\n});\nexport var Unit = /* #__PURE__ */createUnitClass({\n  BigNumber,\n  Complex,\n  Fraction,\n  abs,\n  addScalar,\n  config,\n  divideScalar,\n  equal,\n  fix,\n  format,\n  isNumeric,\n  multiplyScalar,\n  number,\n  pow,\n  round,\n  subtract\n});\nexport var createUnit = /* #__PURE__ */createCreateUnit({\n  Unit,\n  typed\n});\nexport var eigs = /* #__PURE__ */createEigs({\n  abs,\n  add,\n  addScalar,\n  atan,\n  bignumber,\n  config,\n  cos,\n  equal,\n  inv,\n  matrix,\n  multiply,\n  multiplyScalar,\n  sin,\n  subtract,\n  typed\n});\nexport var intersect = /* #__PURE__ */createIntersect({\n  abs,\n  add,\n  addScalar,\n  config,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiply,\n  multiplyScalar,\n  smaller,\n  subtract,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  sqrt,\n  typed,\n  variance\n});\nexport var atomicMass = /* #__PURE__ */createAtomicMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrMagneton = /* #__PURE__ */createBohrMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var boltzmann = /* #__PURE__ */createBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var deuteronMass = /* #__PURE__ */createDeuteronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var electronMass = /* #__PURE__ */createElectronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\n});\nexport var firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var klitzing = /* #__PURE__ */createKlitzing({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticConstant = /* #__PURE__ */createMagneticConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMass = /* #__PURE__ */createMolarMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var secondRadiation = /* #__PURE__ */createSecondRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var usolve = /* #__PURE__ */createUsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var norm = /* #__PURE__ */createNorm({\n  abs,\n  add,\n  conj,\n  ctranspose,\n  eigs,\n  equalScalar,\n  larger,\n  matrix,\n  multiply,\n  pow,\n  smaller,\n  sqrt,\n  typed\n});\nexport var lusolve = /* #__PURE__ */createLusolve({\n  DenseMatrix,\n  lsolve,\n  lup,\n  matrix,\n  slu,\n  typed,\n  usolve\n});\nexport var sqrtm = /* #__PURE__ */createSqrtm({\n  abs,\n  add,\n  identity,\n  inv,\n  max,\n  multiply,\n  size,\n  sqrt,\n  subtract,\n  typed\n});\nexport var multinomial = /* #__PURE__ */createMultinomial({\n  add,\n  divide,\n  factorial,\n  isInteger,\n  isPositive,\n  multiply,\n  typed\n});\nexport var avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\n});\nexport var loschmidt = /* #__PURE__ */createLoschmidt({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var speedOfLight = /* #__PURE__ */createSpeedOfLight({\n  BigNumber,\n  Unit,\n  config\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotationMatrix = /* #__PURE__ */createRotationMatrix({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  config,\n  cos,\n  matrix,\n  multiplyScalar,\n  norm,\n  sin,\n  typed,\n  unaryMinus\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTime = /* #__PURE__ */createPlanckTime({\n  BigNumber,\n  Unit,\n  config\n});\nexport var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var coulomb = /* #__PURE__ */createCoulomb({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rydberg = /* #__PURE__ */createRydberg({\n  BigNumber,\n  Unit,\n  config\n});\nexport var unit = /* #__PURE__ */createUnitFunction({\n  Unit,\n  typed\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\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  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n  this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","/**\n * Create a range error with the message:\n *     'Index out of range (index < min)'\n *     'Index out of range (index < max)'\n *\n * @param {number} index     The actual index\n * @param {number} [min=0]   Minimum index (included)\n * @param {number} [max]     Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n\n  this.index = index;\n\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}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","import { factory } from '../../utils/factory.js';\nimport { arraySize } from '../../utils/array.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { IndexError } from '../../error/IndexError.js';\nvar name = 'apply';\nvar dependencies = ['typed', 'isInteger'];\nexport var createApply = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n\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 ArrayMatrixNumberBigNumberFunction(mat, dim, callback) {\n      if (!isInteger(dim)) {\n        throw new TypeError('Integer number expected for dimension');\n      }\n\n      var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n\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 * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\n\nfunction _apply(mat, dim, callback) {\n  var 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\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _apply(tran[i], dim - 1, callback);\n      }\n\n      return ret;\n    }\n  } else {\n    ret = [];\n\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _apply(mat[i], dim - 1, callback);\n    }\n\n    return ret;\n  }\n}\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n\n    ret.push(tmp);\n  }\n\n  return ret;\n}","import { factory } from '../../utils/factory.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createColumn = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n\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    'Array, number': function ArrayNumber(value, column) {\n      return _column(matrix(clone(value)), column).valueOf();\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\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    var rowRange = range(0, value.size()[0]);\n    var index = new Index(rowRange, column);\n    return value.subset(index);\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';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcat = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n\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 ArrayMatrixNumberBigNumber(args) {\n      var i;\n      var len = args.length;\n      var dim = -1; // zero-based dimension\n\n      var prevDim;\n      var asMatrix = false;\n      var matrices = []; // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        var arg = args[i]; // test whether we need to return a Matrix (if not we return an Array)\n\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          } // last argument contains the dimension on which to concatenate\n\n\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          var m = clone(arg).valueOf();\n          var size = arraySize(m);\n          matrices[i] = m;\n          prevDim = dim;\n          dim = size.length - 1; // verify whether each of the matrices has the same number of dimensions\n\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      var res = matrices.shift();\n\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim, 0);\n      }\n\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\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 */\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    var c = [];\n\n    for (var i = 0; i < a.length; i++) {\n      c[i] = _concat(a[i], b[i], concatDim, dim + 1);\n    }\n\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}","import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number'];\nexport var createDiff = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    number\n  } = _ref;\n\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 ArrayMatrix(arr) {\n      // 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 ArrayMatrixNumber(arr, dim) {\n      if (!isInteger(dim)) throw new RangeError('Dimension must be a whole number');\n\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 ArrayMatrixBigNumber(arr, dim) {\n      return this(arr, number(dim));\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\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\n    if (!Array.isArray(arr)) {\n      throw RangeError('Array/Matrix does not have that many dimensions');\n    }\n\n    if (dim > 0) {\n      var 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   * Difference between elements in the array\n   *\n   * @param {Array} arr      An array\n   * @return {Array}         resulting array\n   */\n\n\n  function _diff(arr) {\n    var result = [];\n    var size = arr.length;\n\n    if (size < 2) {\n      return arr;\n    }\n\n    for (var i = 1; i < size; i++) {\n      result.push(_ElementDiff(arr[i - 1], arr[i]));\n    }\n\n    return result;\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\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    var obj1IsArray = Array.isArray(obj1);\n    var obj2IsArray = Array.isArray(obj2);\n\n    if (obj1IsArray && obj2IsArray) {\n      return _ArrayDiff(obj1, obj2);\n    }\n\n    if (!obj1IsArray && !obj2IsArray) {\n      return subtract(obj2, obj1); // Difference is (second - first) NOT (first - second)\n    }\n\n    throw TypeError('Cannot calculate difference between 1 array and 1 non-array');\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\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\n    var result = [];\n    var size = arr1.length;\n\n    for (var i = 0; i < size; i++) {\n      result.push(_ElementDiff(arr1[i], arr2[i]));\n    }\n\n    return result;\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { noBignumber, noMatrix } from '../../utils/noop.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];\nexport var createRange = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq\n  } = _ref;\n\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    // TODO: a number or boolean should not be converted to string here\n    string: _strRange,\n    'string, boolean': _strRange,\n    'number, number': function numberNumber(start, end) {\n      return _out(_rangeEx(start, end, 1));\n    },\n    'number, number, number': function numberNumberNumber(start, end, step) {\n      return _out(_rangeEx(start, end, step));\n    },\n    'number, number, boolean': function numberNumberBoolean(start, end, includeEnd) {\n      return includeEnd ? _out(_rangeInc(start, end, 1)) : _out(_rangeEx(start, end, 1));\n    },\n    'number, number, number, boolean': function numberNumberNumberBoolean(start, end, step, includeEnd) {\n      return includeEnd ? _out(_rangeInc(start, end, step)) : _out(_rangeEx(start, end, step));\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(start, end) {\n      var BigNumber = start.constructor;\n      return _out(_bigRangeEx(start, end, new BigNumber(1)));\n    },\n    'BigNumber, BigNumber, BigNumber': function BigNumberBigNumberBigNumber(start, end, step) {\n      return _out(_bigRangeEx(start, end, step));\n    },\n    'BigNumber, BigNumber, boolean': function BigNumberBigNumberBoolean(start, end, includeEnd) {\n      var BigNumber = start.constructor;\n      return includeEnd ? _out(_bigRangeInc(start, end, new BigNumber(1))) : _out(_bigRangeEx(start, end, new BigNumber(1)));\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function BigNumberBigNumberBigNumberBoolean(start, end, step, includeEnd) {\n      return includeEnd ? _out(_bigRangeInc(start, end, step)) : _out(_bigRangeEx(start, end, step));\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    var r = _parse(str);\n\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range');\n    }\n\n    var fn;\n\n    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        noBignumber();\n      }\n\n      fn = includeEnd ? _bigRangeInc : _bigRangeEx;\n      return _out(fn(bignumber(r.start), bignumber(r.end), bignumber(r.step)));\n    } else {\n      fn = includeEnd ? _rangeInc : _rangeEx;\n      return _out(fn(r.start, r.end, r.step));\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\n\n  function _rangeEx(start, end, step) {\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _rangeInc(start, end, step) {\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _bigRangeEx(start, end, step) {\n    var zero = bignumber(0);\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _bigRangeInc(start, end, step) {\n    var zero = bignumber(0);\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _parse(str) {\n    var args = str.split(':'); // number\n\n    var 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    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\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});","import { factory } from '../../utils/factory.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'row';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createRow = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n\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    'Array, number': function ArrayNumber(value, row) {\n      return _row(matrix(clone(value)), row).valueOf();\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\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    var columnRange = range(0, value.size()[1]);\n    var index = new Index(row, columnRange);\n    return value.subset(index);\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';\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix'];\nexport var createSubset = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\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]]\n   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 6], [0, 7]]\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                     An index containing ranges for each\n   *                                          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 ArrayIndex(value, index) {\n      var m = matrix(value);\n      var subset = m.subset(index); // returns a Matrix\n\n      return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)\n    },\n    'Matrix, Index': function MatrixIndex(value, index) {\n      return value.subset(index);\n    },\n    'Object, Index': _getObjectProperty,\n    'string, Index': _getSubstring,\n    // set subset\n    'Array, Index, any': function ArrayIndexAny(value, index, replacement) {\n      return matrix(clone(value)).subset(index, replacement, undefined).valueOf();\n    },\n    'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {\n      return matrix(clone(value)).subset(index, replacement, defaultValue).valueOf();\n    },\n    'Matrix, Index, any': function MatrixIndexAny(value, index, replacement) {\n      return value.clone().subset(index, replacement);\n    },\n    'Matrix, Index, any, any': function MatrixIndexAnyAny(value, index, replacement, defaultValue) {\n      return value.clone().subset(index, replacement, defaultValue);\n    },\n    'string, Index, string': _setSubstring,\n    'string, Index, string, string': _setSubstring,\n    'Object, Index, any': _setObjectProperty\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 containing ranges for each dimension\n * @returns {string} substring\n * @private\n */\n\nfunction _getSubstring(str, index) {\n  if (!isIndex(index)) {\n    // TODO: better error message\n    throw new TypeError('Index expected');\n  }\n\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1);\n  } // validate whether the range is out of range\n\n\n  var strLen = str.length;\n  validateIndex(index.min()[0], strLen);\n  validateIndex(index.max()[0], strLen);\n  var range = index.dimension(0);\n  var substr = '';\n  range.forEach(function (v) {\n    substr += str.charAt(v);\n  });\n  return substr;\n}\n/**\n * Replace a substring in a string\n * @param {string} str            string to be replaced\n * @param {Index} index           An index containing ranges for each dimension\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 */\n\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\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1);\n  }\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  var range = index.dimension(0);\n  var len = range.size()[0];\n\n  if (len !== replacement.length) {\n    throw new DimensionError(range.size()[0], replacement.length);\n  } // validate whether the range is out of range\n\n\n  var strLen = str.length;\n  validateIndex(index.min()[0]);\n  validateIndex(index.max()[0]); // copy the string into an array with characters\n\n  var chars = [];\n\n  for (var 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  }); // initialize undefined characters with a space\n\n  if (chars.length > strLen) {\n    for (var _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 * 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 */\n\n\nfunction _getObjectProperty(object, index) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1);\n  }\n\n  var key = index.dimension(0);\n\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 * 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 */\n\n\nfunction _setObjectProperty(object, index, replacement) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1);\n  }\n\n  var key = index.dimension(0);\n\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property');\n  } // clone the object, and apply the property to the clone\n\n\n  var updated = clone(object);\n  setSafeProperty(updated, key, replacement);\n  return updated;\n}","import { deepForEach, reduce, containsCollections } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger'];\nexport var createMax = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    larger\n  } = _ref;\n\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    // max([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _largest);\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   * 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\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   * Recursively calculate the maximum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} max\n   * @private\n   */\n\n\n  function _max(array) {\n    var res;\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    } // make sure returning numeric value: parse a string into a numeric value\n\n\n    if (typeof res === 'string') {\n      res = numeric(res, config.number);\n    }\n\n    return res;\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';\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nexport var createMean = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide\n  } = _ref;\n\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    // mean([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nmeanDim,\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   * 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\n  function _nmeanDim(array, dim) {\n    try {\n      var sum = reduce(array, dim, add);\n      var 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   * Recursively calculate the mean value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} mean\n   * @private\n   */\n\n\n  function _mean(array) {\n    var sum;\n    var num = 0;\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\n    return divide(sum, num);\n  }\n});","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller'];\nexport var createMin = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    smaller\n  } = _ref;\n\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    // min([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _smallest);\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   * 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\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   * Recursively calculate the minimum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} min\n   * @private\n   */\n\n\n  function _min(array) {\n    var min;\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    } // make sure returning numeric value: parse a string into a numeric value\n\n\n    if (typeof min === 'string') {\n      min = numeric(min, config.number);\n    }\n\n    return min;\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'std';\nvar dependencies = ['typed', 'sqrt', 'variance'];\nexport var createStd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    sqrt,\n    variance\n  } = _ref;\n\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    // std([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _std,\n    // std([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': _std,\n    // std([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _std,\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});","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nexport var createSum = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    add,\n    numeric\n  } = _ref;\n\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\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    // sum([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nsumDim,\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   * Recursively calculate the sum of an n-dimensional array\n   * @param {Array | Matrix} array\n   * @return {number} sum\n   * @private\n   */\n\n  function _sum(array) {\n    var sum;\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    }); // make sure returning numeric value: parse a string into a numeric value\n\n    if (sum === undefined) {\n      sum = numeric(0, config.number);\n    }\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      var sum = reduce(array, dim, add);\n      return sum;\n    } catch (err) {\n      throw improveErrorMessage(err, 'sum');\n    }\n  }\n});","import { typeOf } from '../../../utils/is.js';\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 */\n\nexport function improveErrorMessage(err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  var details;\n\n  if (String(err).indexOf('Unexpected type') !== -1) {\n    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';\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 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : '';\n    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);\n  }\n\n  return err;\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';\nvar DEFAULT_NORMALIZATION = 'unbiased';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];\nexport var createVariance = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    apply,\n    isNaN\n  } = _ref;\n\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 ArrayMatrix(array) {\n      return _var(array, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _var,\n    // variance([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return _varDim(array, dim, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _varDim,\n    // variance(a, b, c, d, ...)\n    '...': function _(args) {\n      return _var(args, DEFAULT_NORMALIZATION);\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\n  function _var(array, normalization) {\n    var sum;\n    var num = 0;\n\n    if (array.length === 0) {\n      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');\n    } // calculate the mean and number of elements\n\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, 'variance', value);\n      }\n    });\n    if (num === 0) throw new Error('Cannot calculate variance of an empty array');\n    var mean = divide(sum, num); // calculate the variance\n\n    sum = undefined;\n    deepForEach(array, function (value) {\n      var 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          var 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 + '\". ' + '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\n      return apply(array, dim, x => _var(x, normalization));\n    } catch (err) {\n      throw improveErrorMessage(err, 'variance');\n    }\n  }\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 * 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 */\n\nexport function arraySize(x) {\n  var s = [];\n\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n\n  return s;\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 */\n\nfunction _validate(array, size, dim) {\n  var i;\n  var 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    var dimNext = dim + 1;\n\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n\n      if (!Array.isArray(child)) {\n        throw new DimensionError(size.length - 1, size.length, '<');\n      }\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 * 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 */\n\n\nexport function validate(array, size) {\n  var isScalar = size.length === 0;\n\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 * 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 */\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\n  if (index < 0 || typeof length === 'number' && index >= length) {\n    throw new IndexError(index, length);\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 */\n\nexport function resize(array, size, defaultValue) {\n  // TODO: add support for scalars, having size=[] ?\n  // check the type of the arguments\n  if (!Array.isArray(array) || !Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  } // check whether size contains positive integers\n\n\n  size.forEach(function (value) {\n    if (!isNumber(value) || !isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n  }); // recursively resize the array\n\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n\n  _resize(array, size, 0, _defaultValue);\n\n  return array;\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 */\n\nfunction _resize(array, size, dim, defaultValue) {\n  var i;\n  var elem;\n  var oldLen = array.length;\n  var newLen = size[dim];\n  var minLen = Math.min(oldLen, newLen); // apply new length\n\n  array.length = newLen;\n\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1; // resize existing child arrays\n\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n\n        array[i] = elem;\n      }\n\n      _resize(elem, size, dimNext, defaultValue);\n    } // create new child arrays\n\n\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem; // resize new child array\n\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\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    } // fill new elements with the default value\n\n\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\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 */\n\n\nexport function reshape(array, sizes) {\n  var flatArray = flatten(array);\n  var 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  var newLength = product(sizes);\n\n  if (currentLength !== newLength) {\n    throw new DimensionError(newLength, currentLength, '!=');\n  }\n\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(newLength, currentLength, '!=');\n    }\n\n    throw e;\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 */\n\nexport function processSizesWildcard(sizes, currentLength) {\n  var newLength = product(sizes);\n  var processedSizes = sizes.slice();\n  var WILDCARD = -1;\n  var wildCardIndex = sizes.indexOf(WILDCARD);\n  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes');\n  }\n\n  var hasWildcard = wildCardIndex >= 0;\n  var 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\n  return processedSizes;\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 */\n\nfunction product(array) {\n  return array.reduce((prev, curr) => prev * curr, 1);\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\n\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2; // for each dimensions starting by the last one and ignoring the first one\n\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = []; // aggregate the elements of the current tmpArray in elements of the requested size\n\n    var length = tmpArray.length / size;\n\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    } // set it as the new tmpArray for the next loop turn or for return\n\n\n    tmpArray = tmpArray2;\n  }\n\n  return tmpArray;\n}\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\n\n\nexport function squeeze(array, size) {\n  var s = size || arraySize(array); // squeeze outer dimensions\n\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  } // find the first dimension to be squeezed\n\n\n  var dims = s.length;\n\n  while (s[dims - 1] === 1) {\n    dims--;\n  } // squeeze inner dimensions\n\n\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n\n  return array;\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 */\n\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n\n  if (dim < dims) {\n    var next = dim + 1;\n\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 * 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 */\n\n\nexport function unsqueeze(array, dims, outer, size) {\n  var s = size || arraySize(array); // unsqueeze outer dimensions\n\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  } // unsqueeze inner dimensions\n\n\n  array = _unsqueeze(array, dims, 0);\n\n  while (s.length < dims) {\n    s.push(1);\n  }\n\n  return array;\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 */\n\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n\n  if (Array.isArray(array)) {\n    var next = dim + 1;\n\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _unsqueeze(array[i], dims, next);\n    }\n  } else {\n    for (var d = dim; d < dims; d++) {\n      array = [array];\n    }\n  }\n\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 */\n\n\nexport function flatten(array) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\n  }\n\n  var flat = [];\n  array.forEach(function callback(value) {\n    if (Array.isArray(value)) {\n      value.forEach(callback); // traverse through sub-arrays recursively\n    } else {\n      flat.push(value);\n    }\n  });\n  return flat;\n}\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\n\nexport function map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\n\nexport function forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\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 * 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 */\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 * A safe join\n * @param {Array} array\n * @param {string} separator\n */\n\nexport function join(array, separator) {\n  return Array.prototype.join.call(array, separator);\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 */\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  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\n  };\n\n  for (var i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++;\n    } else {\n      count = 0;\n    }\n\n    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n\n  return b;\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 */\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  var b = [];\n\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n\n  return b;\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 */\n\nexport function getArrayDataType(array, typeOf) {\n  var type; // to hold type info\n\n  var length = 0; // to hold length value to ensure it has consistent sizes\n\n  for (var i = 0; i < array.length; i++) {\n    var item = array[i];\n    var isArray = Array.isArray(item); // Saving the target matrix row size\n\n    if (i === 0 && isArray) {\n      length = item.length;\n    } // If the current item is an array but the length does not equal the targetVectorSize\n\n\n    if (isArray && item.length !== length) {\n      return undefined;\n    }\n\n    var itemType = isArray ? 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 {// we're good, everything has the same type so far\n    }\n  }\n\n  return type;\n}\n/**\n * Return the last item from an array\n * @param array\n * @returns {*}\n */\n\nexport function last(array) {\n  return array[array.length - 1];\n}\n/**\n * Get all but the last element of array.\n */\n\nexport function initial(array) {\n  return array.slice(0, array.length - 1);\n}\n/**\n * Test whether an array or string contains an item\n * @param {Array | string} array\n * @param {*} item\n * @return {boolean}\n */\n\nexport function contains(array, item) {\n  return array.indexOf(item) !== -1;\n}","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize } from './array.js';\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 */\n\nexport function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true;\n    }\n  }\n\n  return false;\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 */\n\nexport function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array = array.valueOf();\n  }\n\n  for (var i = 0, ii = array.length; i < ii; i++) {\n    var value = array[i];\n\n    if (Array.isArray(value)) {\n      deepForEach(value, callback);\n    } else {\n      callback(value);\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 */\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 * 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 */\n\nexport function reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n\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 * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\n\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n\n      return val;\n    } else {\n      tran = _switch(mat);\n      ret = [];\n\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n\n      return ret;\n    }\n  } else {\n    ret = [];\n\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n\n    return ret;\n  }\n}\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n\n    ret.push(tmp);\n  }\n\n  return ret;\n} // TODO: document function scatter\n\n\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr; // vars\n\n  var k, k0, k1, i; // check we need to process values (pattern matrix)\n\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]; // check value exists in current j\n\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark; // add i to pattern of C\n\n        cindex.push(i); // x(i) = A, check we need to call function this time\n\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]); // function was called on current row\n\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]); // function was called on current row\n\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]; // check value exists in current j\n\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark; // add i to pattern of C\n\n        cindex.push(i);\n      } else {\n        // indicate function was called on current row\n        u[i] = mark;\n      }\n    }\n  }\n}","import { hasOwnProperty } from './object.js';\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 */\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 * 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?\n\n\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/**\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 */\n\n\nfunction isSafeProperty(object, prop) {\n  if (!object || typeof object !== 'object') {\n    return false;\n  } // SAFE: whitelisted\n  // e.g length\n\n\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true;\n  } // UNSAFE: inherited from Object prototype\n  // e.g constructor\n\n\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  } // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n\n\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\n  return true;\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?\n\n\nfunction validateSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\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 */\n\n\nfunction isSafeMethod(object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false;\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\n\n  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  } // SAFE: whitelisted\n  // e.g toString\n\n\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true;\n  } // UNSAFE: inherited from Object prototype\n  // e.g constructor\n\n\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  } // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n\n\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\n  return true;\n}\n\nfunction isPlainObject(object) {\n  return typeof object === 'object' && object && object.constructor === Object;\n}\n\nvar safeNativeProperties = {\n  length: true,\n  name: true\n};\nvar safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { validateSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { contains } from './array.js';\nimport { pickShallow } from './object.js';\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 */\n\nexport function factory(name, dependencies, create, meta) {\n  function assertAndCreate(scope) {\n    // we only pass the requested dependencies to the factory function\n    // to prevent functions to rely on dependencies that are not explicitly\n    // requested.\n    var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n    assertDependencies(name, dependencies, scope);\n    return create(deps);\n  }\n\n  assertAndCreate.isFactory = true;\n  assertAndCreate.fn = name;\n  assertAndCreate.dependencies = dependencies.slice().sort();\n\n  if (meta) {\n    assertAndCreate.meta = meta;\n  }\n\n  return assertAndCreate;\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 */\n\nexport function sortFactories(factories) {\n  var factoriesByName = {};\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  var sorted = [];\n\n  function addFactory(factory) {\n    var index = 0;\n\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++;\n    }\n\n    sorted.splice(index, 0, factory);\n  } // sort regular factory functions\n\n\n  factories.filter(isFactory).forEach(addFactory); // sort legacy factory functions AFTER the regular factory functions\n\n  factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n  return sorted;\n} // TODO: comment or cleanup if unused in the end\n\nexport function create(factories) {\n  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  sortFactories(factories).forEach(factory => factory(scope));\n  return scope;\n}\n/**\n * 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 */\n\nexport function isFactory(obj) {\n  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\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 */\n\nexport function assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n  .every(dependency => scope[dependency] !== undefined);\n\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined); // TODO: create a custom error class for this, a MathjsError or something like that\n\n    throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n  }\n}\nexport function isOptionalDependency(dependency) {\n  return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","// (c) 2018, Mariusz Nowak\n// SPDX-License-Identifier: ISC\n// Derived from https://github.com/medikoo/lru-queue\nexport function lruQueue(limit) {\n  var size = 0;\n  var base = 1;\n  var queue = Object.create(null);\n  var map = Object.create(null);\n  var index = 0;\n\n  var del = function del(id) {\n    var oldIndex = map[id];\n    if (!oldIndex) return;\n    delete queue[oldIndex];\n    delete map[id];\n    --size;\n    if (base !== oldIndex) return;\n\n    if (!size) {\n      index = 0;\n      base = 1;\n      return;\n    }\n\n    while (!hasOwnProperty.call(queue, ++base)) {\n      continue;\n    }\n  };\n\n  limit = Math.abs(limit);\n  return {\n    hit: function hit(id) {\n      var oldIndex = map[id];\n      var nuIndex = ++index;\n      queue[nuIndex] = id;\n      map[id] = nuIndex;\n\n      if (!oldIndex) {\n        ++size;\n        if (size <= limit) return undefined;\n        id = queue[base];\n        del(id);\n        return id;\n      }\n\n      delete queue[oldIndex];\n      if (base !== oldIndex) return undefined;\n\n      while (!hasOwnProperty.call(queue, ++base)) {\n        continue;\n      }\n\n      return undefined;\n    },\n    delete: del,\n    clear: function clear() {\n      size = index = 0;\n      base = 1;\n      queue = Object.create(null);\n      map = Object.create(null);\n    }\n  };\n}\n;","// function utils\nimport { lruQueue } from './lruQueue.js';\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 */\n\nexport function memoize(fn) {\n  var {\n    hasher,\n    limit\n  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n  hasher = hasher == null ? JSON.stringify : hasher;\n  return function memoize() {\n    if (typeof memoize.cache !== 'object') {\n      memoize.cache = {\n        values: new Map(),\n        lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n      };\n    }\n\n    var args = [];\n\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    var 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    var newVal = fn.apply(fn, args);\n    memoize.cache.values.set(hash, newVal);\n    memoize.cache.values.delete(memoize.cache.lru.hit(hash));\n    return newVal;\n  };\n}\n/**\n * 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 */\n\nexport function memoizeCompare(fn, isEqual) {\n  var memoize = function memoize() {\n    var args = [];\n\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    for (var c = 0; c < memoize.cache.length; c++) {\n      var 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    var res = fn.apply(fn, args);\n    memoize.cache.unshift({\n      args,\n      res\n    });\n    return res;\n  };\n\n  memoize.cache = [];\n  return memoize;\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 */\n\nexport function maxArgumentCount(fn) {\n  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {\n    var count = (signature.match(/,/g) || []).length + 1;\n    return Math.max(args, count);\n  }, -1);\n}","// 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.\nexport function isNumber(x) {\n  return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n  return x && x.constructor.prototype.isBigNumber === true || false;\n}\nexport function isComplex(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n  return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n  return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n  return x && x.constructor.prototype.isMatrix === true || false;\n}\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\n\nexport function isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n  return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n  return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n  return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n  return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n  return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n  return typeof x === 'function';\n}\nexport function isDate(x) {\n  return x instanceof Date;\n}\nexport function isRegExp(x) {\n  return x instanceof RegExp;\n}\nexport function isObject(x) {\n  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\nexport function isNull(x) {\n  return x === null;\n}\nexport function isUndefined(x) {\n  return x === undefined;\n}\nexport function isAccessorNode(x) {\n  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionAssignmentNode(x) {\n  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n  return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n  var t = typeof x;\n\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'; // math.js types\n\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    return 'Object';\n  }\n\n  if (t === 'function') return 'Function';\n  return t; // can be 'string', 'number', 'boolean', ...\n}","export function noBignumber() {\n  throw new Error('No \"bignumber\" implementation available');\n}\nexport function noFraction() {\n  throw new Error('No \"fraction\" implementation available');\n}\nexport function noMatrix() {\n  throw new Error('No \"matrix\" implementation available');\n}\nexport function noIndex() {\n  throw new Error('No \"index\" implementation available');\n}\nexport function noSubset() {\n  throw new Error('No \"matrix\" implementation available');\n}","import { isNumber } from './is.js';\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 */\n\nexport function isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n\n  return isFinite(value) ? value === Math.round(value) : false;\n}\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var sign = /* #__PURE__ */Math.sign || function (x) {\n  if (x > 0) {\n    return 1;\n  } else if (x < 0) {\n    return -1;\n  } else {\n    return 0;\n  }\n};\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var log2 = /* #__PURE__ */Math.log2 || function log2(x) {\n  return Math.log(x) / Math.LN2;\n};\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var log10 = /* #__PURE__ */Math.log10 || function log10(x) {\n  return Math.log(x) / Math.LN10;\n};\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\n\nexport var log1p = /* #__PURE__ */Math.log1p || function (x) {\n  return Math.log(x + 1);\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 */\n\nexport var cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {\n  if (x === 0) {\n    return x;\n  }\n\n  var negate = x < 0;\n  var result;\n\n  if (negate) {\n    x = -x;\n  }\n\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3); // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n\n  return negate ? -result : result;\n};\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\n\nexport var expm1 = /* #__PURE__ */Math.expm1 || function expm1(x) {\n  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\n\nfunction formatNumberToBase(n, base, size) {\n  var prefixes = {\n    2: '0b',\n    8: '0o',\n    16: '0x'\n  };\n  var prefix = prefixes[base];\n  var suffix = '';\n\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n\n    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n\n    if (!isInteger(n)) {\n      throw new Error('Value must be an integer');\n    }\n\n    if (n < 0) {\n      n = n + 2 ** size;\n    }\n\n    suffix = \"i\".concat(size);\n  }\n\n  var sign = '';\n\n  if (n < 0) {\n    n = -n;\n    sign = '-';\n  }\n\n  return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\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 */\n\n\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  } // handle special cases\n\n\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  } // default values for options\n\n\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n\n  if (options) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    } // determine precision from options\n\n\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\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  } // handle the various notations\n\n\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).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n/**\n * 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 */\n\nexport function splitNumber(value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^0*?(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\n  }\n\n  var sign = match[1];\n  var digits = match[2];\n  var exponent = parseFloat(match[4] || '0');\n  var dot = digits.indexOf('.');\n  exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n  .replace(/^0*/, function (zeros) {\n    // remove leading zeros, add their count to the exponent\n    exponent -= zeros.length;\n    return '';\n  }).replace(/0*$/, '') // remove trailing zeros\n  .split('').map(function (d) {\n    return parseInt(d);\n  });\n\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 * 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 */\n\nexport function toEngineering(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  var split = splitNumber(value);\n  var rounded = roundDigits(split, precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients; // find nearest lower multiple of 3 for exponent\n\n  var 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    var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n\n    for (var i = 0; i < missingZeros; i++) {\n      c.push(0);\n    }\n  } // find difference in exponents\n\n\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1; // push decimal index over by expDiff times\n\n  while (expDiff > 0) {\n    decimalIdx++;\n    expDiff--;\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\n\n  var decimals = c.slice(decimalIdx).join('');\n  var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n  return rounded.sign + str;\n}\n/**\n * 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 */\n\nexport function toFixed(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  var splitValue = splitNumber(value);\n  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n  var c = rounded.coefficients;\n  var p = rounded.exponent + 1; // exponent may have changed\n  // append zeros if needed\n\n  var pp = p + (precision || 0);\n\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  } // prepend zeros if needed\n\n\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  } // insert a dot if needed\n\n\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n\n  return rounded.sign + c.join('');\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 */\n\nexport function toExponential(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  } // round if needed, else create a clone\n\n\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent; // append zeros if needed\n\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  } // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n\n\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\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 */\n\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  } // determine lower and upper bound for exponential notation.\n\n\n  var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n  var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n\n  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n    // exponential notation\n    return toExponential(value, precision);\n  } else {\n    var c = rounded.coefficients;\n    var e = rounded.exponent; // append trailing zeros\n\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    } // append trailing zeros\n    // TODO: simplify the next statement\n\n\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0))); // prepend zeros\n\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n\n    return rounded.sign + c.join('');\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 */\n\nexport function roundDigits(split, precision) {\n  // create a clone\n  var rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  };\n  var c = rounded.coefficients; // prepend zeros if needed\n\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n\n      while (c[i] === 10) {\n        c.pop();\n\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n\n        i--;\n        c[i]++;\n      }\n    }\n  }\n\n  return rounded;\n}\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\n\nfunction zeros(length) {\n  var arr = [];\n\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n\n  return arr;\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 */\n\n\nexport function digits(value) {\n  return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n  .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n  .length;\n}\n/**\n * Minimum number added to one that makes the result different than one\n */\n\nexport var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\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*/\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  } // NaN\n\n\n  if (isNaN(x) || isNaN(y)) {\n    return false;\n  } // at this point x and y should be finite\n\n\n  if (isFinite(x) && isFinite(y)) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = Math.abs(x - y);\n\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  } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n  return false;\n}\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\n\nexport var acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n  return Math.log(Math.sqrt(x * x + 1) + x);\n};\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\n\nexport var atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};","import { isBigNumber } from './is.js';\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 */\n\nexport function clone(x) {\n  var type = typeof x; // immutable primitive types\n\n  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  } // use clone function of the object when available\n\n\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  } // array\n\n\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\n  if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp\n  // object\n\n  return mapObject(x, clone);\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 */\n\nexport function mapObject(object, callback) {\n  var clone = {};\n\n  for (var key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n\n  return clone;\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 */\n\nexport function extend(a, b) {\n  for (var prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n\n  return a;\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 */\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 (var prop in b) {\n    // We check against prop not being in Object.prototype or Function.prototype\n    // to prevent polluting for example Object.__proto__.\n    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {};\n        }\n\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\n  return a;\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 */\n\nexport function deepStrictEqual(a, b) {\n  var prop, i, len;\n\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\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\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a) || !deepStrictEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n\n    return true;\n  } else {\n    return a === b;\n  }\n}\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\n\nexport function deepFlatten(nestedObject) {\n  var flattenedObject = {};\n\n  _deepFlatten(nestedObject, flattenedObject);\n\n  return flattenedObject;\n} // helper function used by deepFlatten\n\nfunction _deepFlatten(nestedObject, flattenedObject) {\n  for (var prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      var value = nestedObject[prop];\n\n      if (typeof value === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject);\n      } else {\n        flattenedObject[prop] = value;\n      }\n    }\n  }\n}\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\n\n\nexport function canDefineProperty() {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', {\n        get: function get() {}\n      });\n      return true;\n    }\n  } catch (e) {}\n\n  return false;\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 */\n\nexport function lazy(object, prop, valueResolver) {\n  var _uninitialized = true;\n\n  var _value;\n\n  Object.defineProperty(object, prop, {\n    get: function get() {\n      if (_uninitialized) {\n        _value = valueResolver();\n        _uninitialized = false;\n      }\n\n      return _value;\n    },\n    set: function set(value) {\n      _value = value;\n      _uninitialized = false;\n    },\n    configurable: true,\n    enumerable: true\n  });\n}\n/**\n * 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 */\n\nexport function traverse(object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'));\n  }\n\n  var obj = object;\n\n  if (path) {\n    for (var i = 0; i < path.length; i++) {\n      var key = path[i];\n\n      if (!(key in obj)) {\n        obj[key] = {};\n      }\n\n      obj = obj[key];\n    }\n  }\n\n  return obj;\n}\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\n\nexport function hasOwnProperty(object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\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 */\n\nexport function isLegacyFactory(object) {\n  return object && typeof object.factory === 'function';\n}\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\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  var child = object;\n\n  for (var i = 0; i < path.length; i++) {\n    var key = path[i];\n    child = child ? child[key] : undefined;\n  }\n\n  return child;\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 */\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  var child = object;\n\n  for (var i = 0; i < path.length - 1; i++) {\n    var key = path[i];\n\n    if (child[key] === undefined) {\n      child[key] = {};\n    }\n\n    child = child[key];\n  }\n\n  if (path.length > 0) {\n    var lastKey = path[path.length - 1];\n    child[lastKey] = value;\n  }\n\n  return object;\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 */\n\nexport function pick(object, properties, transform) {\n  var copy = {};\n\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = get(object, key);\n\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value);\n    }\n  }\n\n  return copy;\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 */\n\nexport function pickShallow(object, properties) {\n  var copy = {};\n\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = object[key];\n\n    if (value !== undefined) {\n      copy[key] = value;\n    }\n  }\n\n  return copy;\n}\nexport function values(object) {\n  return Object.keys(object).map(key => object[key]);\n} // helper function to test whether a string contains a path like 'user.name'\n\nfunction isPath(str) {\n  return str.indexOf('.') !== -1;\n}","import { isInteger } from '../number.js';\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 */\n\nfunction formatBigNumberToBase(n, base, size) {\n  var BigNumberCtor = n.constructor;\n  var big2 = new BigNumberCtor(2);\n  var suffix = '';\n\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n\n    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n\n    if (!n.isInteger()) {\n      throw new Error('Value must be an integer');\n    }\n\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size));\n    }\n\n    suffix = \"i\".concat(size);\n  }\n\n  switch (base) {\n    case 2:\n      return \"\".concat(n.toBinary()).concat(suffix);\n\n    case 8:\n      return \"\".concat(n.toOctal()).concat(suffix);\n\n    case 16:\n      return \"\".concat(n.toHexadecimal()).concat(suffix);\n\n    default:\n      throw new Error(\"Base \".concat(base, \" not supported \"));\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 */\n\n\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  } // handle special cases\n\n\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  } // default values for options\n\n\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n\n  if (options !== undefined) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    } // determine precision from options\n\n\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\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  } // handle the various notations\n\n\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        var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n        var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5; // handle special case zero\n\n        if (value.isZero()) return '0'; // determine whether or not to output exponential notation\n\n        var str;\n        var rounded = value.toSignificantDigits(precision);\n        var exp = rounded.e;\n\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        } // remove trailing zeros after the decimal point\n\n\n        return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n          var digits = arguments[2];\n          var e = arguments[4];\n          return digits !== '.' ? digits + e : e;\n        });\n      }\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\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 */\n\nexport function toEngineering(value, precision) {\n  // find nearest lower multiple of 3 for exponent\n  var e = value.e;\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3; // find difference in exponents, and calculate the value without exponent\n\n  var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n  var valueStr = valueWithoutExp.toPrecision(precision);\n\n  if (valueStr.indexOf('e') !== -1) {\n    valueStr = valueWithoutExp.toString();\n  }\n\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\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 */\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 * 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 */\n\nexport function toFixed(value, precision) {\n  return value.toFixed(precision);\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\n\nexport function endsWith(text, search) {\n  var start = text.length - search.length;\n  var end = text.length;\n  return text.substring(start, end) === search;\n}\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\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]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @return {string} str\n */\n\nexport function 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  } // 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\n\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      var entries = Object.keys(value).map(key => {\n        return '\"' + key + '\": ' + format(value[key], options);\n      });\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n\n  return String(value);\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 */\n\nexport function stringify(value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n\n  while (i < text.length) {\n    var c = text.charAt(i);\n\n    if (c === '\\\\') {\n      escaped += c;\n      i++;\n      c = text.charAt(i);\n\n      if (c === '' || '\"\\\\/bfnrtu'.indexOf(c) === -1) {\n        escaped += '\\\\'; // no valid escape character -> escape it\n      }\n\n      escaped += c;\n    } else if (c === '\"') {\n      escaped += '\\\\\"';\n    } else {\n      escaped += c;\n    }\n\n    i++;\n  }\n\n  return '\"' + escaped + '\"';\n}\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\n\nexport function escape(value) {\n  var text = String(value);\n  text = text.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');\n  return text;\n}\n/**\n * 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 */\n\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n\n      str += formatArray(array[i], options);\n    }\n\n    str += ']';\n    return str;\n  } else {\n    return format(array, options);\n  }\n}\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\n\n\nfunction looksLikeFraction(value) {\n  return value && typeof value === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;\n}\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\n\n\nexport function compareText(x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!isString(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n  }\n\n  if (!isString(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n  }\n\n  return x === y ? 0 : x > y ? 1 : -1;\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  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 = Gp.constructor = GeneratorFunctionPrototype;\n  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  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  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  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, 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  Function(\"r\", \"regeneratorRuntime = r\")(runtime);\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","// 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 \"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","// 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 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 \"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 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","/*\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","/**\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        throw createError(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     * 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.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","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n// expose the modules object (__webpack_modules__)\n__webpack_require__.m = __webpack_modules__;\n\n","var inProgress = {};\nvar dataWebpackPrefix = \"@spcl/sdfv:\";\n// loadScript function to load a script via script tag\n__webpack_require__.l = (url, done, key, chunkId) => {\n\tif(inProgress[url]) { inProgress[url].push(done); return; }\n\tvar script, needAttach;\n\tif(key !== undefined) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tfor(var i = 0; i < scripts.length; i++) {\n\t\t\tvar s = scripts[i];\n\t\t\tif(s.getAttribute(\"src\") == url || s.getAttribute(\"data-webpack\") == dataWebpackPrefix + key) { script = s; break; }\n\t\t}\n\t}\n\tif(!script) {\n\t\tneedAttach = true;\n\t\tscript = document.createElement('script');\n\n\t\tscript.charset = 'utf-8';\n\t\tscript.timeout = 120;\n\t\tif (__webpack_require__.nc) {\n\t\t\tscript.setAttribute(\"nonce\", __webpack_require__.nc);\n\t\t}\n\t\tscript.setAttribute(\"data-webpack\", dataWebpackPrefix + key);\n\t\tscript.src = url;\n\t}\n\tinProgress[url] = [done];\n\tvar onScriptComplete = (prev, event) => {\n\t\t// avoid mem leaks in IE.\n\t\tscript.onerror = script.onload = null;\n\t\tclearTimeout(timeout);\n\t\tvar doneFns = inProgress[url];\n\t\tdelete inProgress[url];\n\t\tscript.parentNode && script.parentNode.removeChild(script);\n\t\tdoneFns && doneFns.forEach((fn) => (fn(event)));\n\t\tif(prev) return prev(event);\n\t}\n\t;\n\tvar timeout = setTimeout(onScriptComplete.bind(null, undefined, { type: 'timeout', target: script }), 120000);\n\tscript.onerror = onScriptComplete.bind(null, script.onerror);\n\tscript.onload = onScriptComplete.bind(null, script.onload);\n\tneedAttach && document.head.appendChild(script);\n};","__webpack_require__.amdD = function () {\n\tthrow new Error('define cannot be used indirect');\n};","__webpack_require__.amdO = {};","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.f = {};\n// This file contains only the entry chunk.\n// The chunk loading function for additional chunks\n__webpack_require__.e = (chunkId) => {\n\treturn Promise.all(Object.keys(__webpack_require__.f).reduce((promises, key) => {\n\t\t__webpack_require__.f[key](chunkId, promises);\n\t\treturn promises;\n\t}, []));\n};","// This function allow to reference async chunks\n__webpack_require__.u = (chunkId) => {\n\t// return url for filenames based on template\n\treturn \"\" + chunkId + \".js\";\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","var scriptUrl;\nif (__webpack_require__.g.importScripts) scriptUrl = __webpack_require__.g.location + \"\";\nvar document = __webpack_require__.g.document;\nif (!scriptUrl && document) {\n\tif (document.currentScript)\n\t\tscriptUrl = document.currentScript.src\n\tif (!scriptUrl) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tif(scripts.length) scriptUrl = scripts[scripts.length - 1].src\n\t}\n}\n// When supporting browsers where an automatic publicPath is not supported you must specify an output.publicPath manually via configuration\n// or pass an empty string (\"\") and set the __webpack_public_path__ variable from your code to use your own logic.\nif (!scriptUrl) throw new Error(\"Automatic publicPath is not supported in this browser\");\nscriptUrl = scriptUrl.replace(/#.*$/, \"\").replace(/\\?.*$/, \"\").replace(/\\/[^\\/]+$/, \"/\");\n__webpack_require__.p = scriptUrl;","// no baseURI\n\n// object to store loaded and loading chunks\n// undefined = chunk not loaded, null = chunk preloaded/prefetched\n// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded\nvar installedChunks = {\n\t179: 0,\n\t529: 0\n};\n\n__webpack_require__.f.j = (chunkId, promises) => {\n\t\t// JSONP chunk loading for javascript\n\t\tvar installedChunkData = __webpack_require__.o(installedChunks, chunkId) ? installedChunks[chunkId] : undefined;\n\t\tif(installedChunkData !== 0) { // 0 means \"already installed\".\n\n\t\t\t// a Promise means \"currently loading\".\n\t\t\tif(installedChunkData) {\n\t\t\t\tpromises.push(installedChunkData[2]);\n\t\t\t} else {\n\t\t\t\tif(true) { // all chunks have JS\n\t\t\t\t\t// setup Promise in chunk cache\n\t\t\t\t\tvar promise = new Promise((resolve, reject) => (installedChunkData = installedChunks[chunkId] = [resolve, reject]));\n\t\t\t\t\tpromises.push(installedChunkData[2] = promise);\n\n\t\t\t\t\t// start chunk loading\n\t\t\t\t\tvar url = __webpack_require__.p + __webpack_require__.u(chunkId);\n\t\t\t\t\t// create error before stack unwound to get useful stacktrace later\n\t\t\t\t\tvar error = new Error();\n\t\t\t\t\tvar loadingEnded = (event) => {\n\t\t\t\t\t\tif(__webpack_require__.o(installedChunks, chunkId)) {\n\t\t\t\t\t\t\tinstalledChunkData = installedChunks[chunkId];\n\t\t\t\t\t\t\tif(installedChunkData !== 0) installedChunks[chunkId] = undefined;\n\t\t\t\t\t\t\tif(installedChunkData) {\n\t\t\t\t\t\t\t\tvar errorType = event && (event.type === 'load' ? 'missing' : event.type);\n\t\t\t\t\t\t\t\tvar realSrc = event && event.target && event.target.src;\n\t\t\t\t\t\t\t\terror.message = 'Loading chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';\n\t\t\t\t\t\t\t\terror.name = 'ChunkLoadError';\n\t\t\t\t\t\t\t\terror.type = errorType;\n\t\t\t\t\t\t\t\terror.request = realSrc;\n\t\t\t\t\t\t\t\tinstalledChunkData[1](error);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t};\n\t\t\t\t\t__webpack_require__.l(url, loadingEnded, \"chunk-\" + chunkId, chunkId);\n\t\t\t\t} else installedChunks[chunkId] = 0;\n\t\t\t}\n\t\t}\n};\n\n// no prefetching\n\n// no preloaded\n\n// no HMR\n\n// no HMR manifest\n\n// no on chunks loaded\n\n// install a JSONP callback for chunk loading\nvar webpackJsonpCallback = (parentChunkLoadingFunction, data) => {\n\tvar [chunkIds, moreModules, runtime] = data;\n\t// add \"moreModules\" to the modules object,\n\t// then flag all \"chunkIds\" as loaded and fire callback\n\tvar moduleId, chunkId, i = 0;\n\tfor(moduleId in moreModules) {\n\t\tif(__webpack_require__.o(moreModules, moduleId)) {\n\t\t\t__webpack_require__.m[moduleId] = moreModules[moduleId];\n\t\t}\n\t}\n\tif(runtime) runtime(__webpack_require__);\n\tif(parentChunkLoadingFunction) parentChunkLoadingFunction(data);\n\tfor(;i < chunkIds.length; i++) {\n\t\tchunkId = chunkIds[i];\n\t\tif(__webpack_require__.o(installedChunks, chunkId) && installedChunks[chunkId]) {\n\t\t\tinstalledChunks[chunkId][0]();\n\t\t}\n\t\tinstalledChunks[chunkIds[i]] = 0;\n\t}\n\n}\n\nvar chunkLoadingGlobal = self[\"webpackChunk_spcl_sdfv\"] = self[\"webpackChunk_spcl_sdfv\"] || [];\nchunkLoadingGlobal.forEach(webpackJsonpCallback.bind(null, 0));\nchunkLoadingGlobal.push = webpackJsonpCallback.bind(null, chunkLoadingGlobal.push.bind(chunkLoadingGlobal));","// startup\n// Load entry module and return exports\n// This entry module is referenced by other modules so it can't be inlined\nvar __webpack_exports__ = __webpack_require__(4316);\n"],"sourceRoot":""}
\ No newline at end of file
diff --git a/dist/sdfv.js b/dist/sdfv.js
deleted file mode 100755
index dd2094ec..00000000
--- a/dist/sdfv.js
+++ /dev/null
@@ -1,3 +0,0 @@
-/*! For license information please see sdfv.js.LICENSE.txt */
-(()=>{var e={676:(e,t,r)=>{"use strict";function n(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}r.d(t,{Z:()=>n})},3349:(e,t,r)=>{"use strict";function n(e){if(void 0===e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return e}r.d(t,{Z:()=>n})},6610:(e,t,r)=>{"use strict";function n(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}r.d(t,{Z:()=>n})},5991:(e,t,r)=>{"use strict";function n(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)}}function i(e,t,r){return t&&n(e.prototype,t),r&&n(e,r),e}r.d(t,{Z:()=>i})},6213:(e,t,r)=>{"use strict";r.d(t,{Z:()=>i});var n=r(7608);function i(e,t,r){return(i="undefined"!=typeof Reflect&&Reflect.get?Reflect.get:function(e,t,r){var i=function(e,t){for(;!Object.prototype.hasOwnProperty.call(e,t)&&null!==(e=(0,n.Z)(e)););return e}(e,t);if(i){var a=Object.getOwnPropertyDescriptor(i,t);return a.get?a.get.call(r):a.value}})(e,t,r||e)}},7608:(e,t,r)=>{"use strict";function n(e){return(n=Object.setPrototypeOf?Object.getPrototypeOf:function(e){return e.__proto__||Object.getPrototypeOf(e)})(e)}r.d(t,{Z:()=>n})},379:(e,t,r)=>{"use strict";r.d(t,{Z:()=>i});var n=r(4665);function i(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),t&&(0,n.Z)(e,t)}},6070:(e,t,r)=>{"use strict";r.d(t,{Z:()=>a});var n=r(484),i=r(3349);function a(e,t){return!t||"object"!==(0,n.Z)(t)&&"function"!=typeof t?(0,i.Z)(e):t}},4665:(e,t,r)=>{"use strict";function n(e,t){return(n=Object.setPrototypeOf||function(e,t){return e.__proto__=t,e})(e,t)}r.d(t,{Z:()=>n})},4699:(e,t,r)=>{"use strict";r.d(t,{Z:()=>i});var n=r(2961);function i(e,t){return function(e){if(Array.isArray(e))return e}(e)||function(e,t){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(e)){var r=[],n=!0,i=!1,a=void 0;try{for(var o,s=e[Symbol.iterator]();!(n=(o=s.next()).done)&&(r.push(o.value),!t||r.length!==t);n=!0);}catch(e){i=!0,a=e}finally{try{n||null==s.return||s.return()}finally{if(i)throw a}}return r}}(e,t)||(0,n.Z)(e,t)||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.")}()}},2465:(e,t,r)=>{"use strict";function n(e,t){return t||(t=e.slice(0)),Object.freeze(Object.defineProperties(e,{raw:{value:Object.freeze(t)}}))}r.d(t,{Z:()=>n})},7329:(e,t,r)=>{"use strict";r.d(t,{Z:()=>a});var n=r(676),i=r(2961);function a(e){return function(e){if(Array.isArray(e))return(0,n.Z)(e)}(e)||function(e){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(e))return Array.from(e)}(e)||(0,i.Z)(e)||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.")}()}},484:(e,t,r)=>{"use strict";function n(e){return(n="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)}r.d(t,{Z:()=>n})},2961:(e,t,r)=>{"use strict";r.d(t,{Z:()=>i});var n=r(676);function i(e,t){if(e){if("string"==typeof e)return(0,n.Z)(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)?(0,n.Z)(e,t):void 0}}},3216:(e,t,r)=>{"use strict";r.d(t,{F:()=>a});var n=r(6610),i=r(5991),a=function(){function e(t,r){(0,n.Z)(this,e),this.overlay_manager=t,this.symbol_resolver=this.overlay_manager.symbol_resolver,this.renderer=r,this.vscode="undefined"!=typeof vscode&&vscode,this.badness_scale_center=5}return(0,i.Z)(e,[{key:"draw",value:function(){}},{key:"on_mouse_event",value:function(e,t,r,n,i,a){return!1}},{key:"refresh",value:function(){}}]),e}()},4707:(e,t,r)=>{"use strict";r.d(t,{n:()=>f});var n=r(6610),i=r(5991),a=r(379),o=r(6070),s=r(7608),u=r(5994),c=r(3216),l=r(1538);var f=function(e){(0,a.Z)(f,e);var t,r,c=(t=f,r=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,n=(0,s.Z)(t);if(r){var i=(0,s.Z)(this).constructor;e=Reflect.construct(n,arguments,i)}else e=n.apply(this,arguments);return(0,o.Z)(this,e)});function f(e,t){var r;return(0,n.Z)(this,f),(r=c.call(this,e,t)).refresh(),r}return(0,i.Z)(f,[{key:"clear_cached_volume_values",value:function(){this.renderer.for_all_elements(0,0,0,0,(function(e,t,r,n){r.data&&void 0!==r.data.volume&&(r.data.volume=void 0)}))}},{key:"calculate_volume_edge",value:function(e,t,r){var n=void 0;e.data&&e.data.attributes&&void 0!==(n=e.data.attributes.volume)&&(n=(n=n.replace(/\*\*/g,"^")).replace(/ceiling/g,"ceil"));var i=void 0;return void 0!==n&&(i=this.symbol_resolver.parse_symbol_expression(n,t)),e.data.volume=i,void 0!==i&&i>0&&r.push(i),i}},{key:"calculate_volume_graph",value:function(e,t,r){var n=this;e.nodes().forEach((function(i){var a=e.node(i).data.graph;a&&(a.edges().forEach((function(e){var i=a.edge(e);i instanceof Edge&&n.calculate_volume_edge(i,t,r)})),a.nodes().forEach((function(e){var i=a.node(e);if(i instanceof u.gE){var o={},s=i.data.node.attributes.symbol_mapping;Object.keys(s).forEach((function(e){o[e]=n.symbol_resolver.parse_symbol_expression(s[e],t)})),Object.keys(t).forEach((function(e){e in o||(o[e]=t[e])})),n.calculate_volume_graph(i.data.graph,o,r)}})))}))}},{key:"recalculate_volume_values",value:function(e){this.badness_scale_center=5;var t=[0];switch(this.calculate_volume_graph(e,this.symbol_resolver.symbol_value_map,t),this.overlay_manager.badness_scale_method){case"mean":this.badness_scale_center=(0,l.J69)(t);break;case"median":default:this.badness_scale_center=(0,l.C2o)(t)}}},{key:"refresh",value:function(){this.clear_cached_volume_values(),this.recalculate_volume_values(this.renderer.graph),this.renderer.draw_async()}},{key:"shade_edge",value:function(e,t){var r=e.data.volume;if(void 0!==r){if(r<=0)return;var n=1/(2*this.badness_scale_center)*r;n<0&&(n=0),n>1&&(n=1);var i=(0,u.jD)(n);e.shade(this.renderer,t,i)}}},{key:"recursively_shade_sdfg",value:function(e,t,r,n){var i=this;e.nodes().forEach((function(a){var o=e.node(a);if((!t.lod||!(r>=STATE_LOD||o.width/r<STATE_LOD))&&(!t.lod||o.intersect(n.x,n.y,n.w,n.h))){var s=o.data.graph;s&&!o.data.state.attributes.is_collapsed&&(s.nodes().forEach((function(e){var a=s.node(e);t.lod&&!a.intersect(n.x,n.y,n.w,n.h)||a.data.node.attributes.is_collapsed||t.lod&&r>=NODE_LOD||a instanceof u.gE&&i.recursively_shade_sdfg(a.data.graph,t,r,n)})),s.edges().forEach((function(e){var r=s.edge(e);t.lod&&!r.intersect(n.x,n.y,n.w,n.h)||i.shade_edge(r,t)})))}}))}},{key:"draw",value:function(){this.recursively_shade_sdfg(this.renderer.graph,this.renderer.ctx,this.renderer.canvas_manager.points_per_pixel(),this.renderer.visible_rect)}},{key:"on_mouse_event",value:function(e,t,r,n,i,a){if("click"===e&&!a&&void 0!==i&&i instanceof Edge&&void 0===i.data.volume&&i.data.attributes.volume){var o=this;this.symbol_resolver.parse_symbol_expression(i.data.attributes.volume,o.symbol_resolver.symbol_value_map,!0,(function(){o.clear_cached_volume_values(),o.recalculate_volume_values(o.renderer.graph)}))}return!1}}]),f}(c.F)},8934:(e,t,r)=>{"use strict";r.d(t,{P:()=>f});var n=r(6610),i=r(5991),a=r(379),o=r(6070),s=r(7608),u=r(5994),c=r(3216),l=r(1538);var f=function(e){(0,a.Z)(f,e);var t,r,c=(t=f,r=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,n=(0,s.Z)(t);if(r){var i=(0,s.Z)(this).constructor;e=Reflect.construct(n,arguments,i)}else e=n.apply(this,arguments);return(0,o.Z)(this,e)});function f(e,t){var r;return(0,n.Z)(this,f),(r=c.call(this,e,t)).criterium="mean",r.runtime_map={},r.badness_scale_center=0,r}return(0,i.Z)(f,[{key:"get_element_uuid",value:function(e){return e instanceof u.ZM?e.sdfg.sdfg_list_id+"/"+e.id+"/-1/"+-1:e instanceof u.gE?e.data.node.attributes.sdfg.sdfg_list_id+"/-1/-1/"+-1:e instanceof u.u7?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.data.node.scope_entry+"/"+-1:e instanceof u.zO?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.id+"/"+-1:"-1/-1/-1/-1"}},{key:"refresh",value:function(){this.badness_scale_center=5;for(var e=[0],t=0,r=Object.keys(this.runtime_map);t<r.length;t++){var n=r[t];"0/-1/-1/-1"!==n&&e.push(this.runtime_map[n][this.criterium])}switch(this.overlay_manager.badness_scale_method){case"mean":this.badness_scale_center=(0,l.J69)(e);break;case"median":default:this.badness_scale_center=(0,l.C2o)(e)}this.renderer.draw_async()}},{key:"pretty_print_micros",value:function(e){var t="µs",r=e;if(e>1e3){t="ms";var n=e/1e3;r=n,n>1e3&&(t="s",r=n/1e3)}return(r=Math.round(100*(r+Number.EPSILON))/100).toString()+" "+t}},{key:"shade_node",value:function(e,t){var r=this,n=this.runtime_map[this.get_element_uuid(e)];if(void 0!==n){this.renderer.mousepos&&e.intersect(this.renderer.mousepos.x,this.renderer.mousepos.y)&&(n.min===n.max?this.renderer.tooltip=function(){r.renderer.tooltip_container.innerText=r.pretty_print_micros(n.min)}:this.renderer.tooltip=function(){r.renderer.tooltip_container.innerText="Min: "+r.pretty_print_micros(n.min)+"\nMax: "+r.pretty_print_micros(n.max)+"\nMean: "+r.pretty_print_micros(n.mean)+"\nMedian: "+r.pretty_print_micros(n.med)+"\nCount: "+n.count});var i=n[this.criterium],a=1/(2*this.badness_scale_center)*i;a<0&&(a=0),a>1&&(a=1);var o=(0,u.jD)(a);e.shade(this.renderer,t,o)}}},{key:"recursively_shade_sdfg",value:function(e,t,r,n){var i=this;e.nodes().forEach((function(a){var o=e.node(a);if(!t.lod||o.intersect(n.x,n.y,n.w,n.h))if(t.lod&&(r>=STATE_LOD||o.width/r<=STATE_LOD)||o.data.state.attributes.is_collapsed)i.shade_node(o,t);else{var s=o.data.graph;s&&s.nodes().forEach((function(e){var a=s.node(e);t.lod&&!a.intersect(n.x,n.y,n.w,n.h)||(a.data.node.attributes.is_collapsed||t.lod&&r>=NODE_LOD?i.shade_node(a,t):a instanceof u.gE?i.recursively_shade_sdfg(a.data.graph,t,r,n):i.shade_node(a,t))}))}}))}},{key:"draw",value:function(){this.recursively_shade_sdfg(this.renderer.graph,this.renderer.ctx,this.renderer.canvas_manager.points_per_pixel(),this.renderer.visible_rect)}}]),f}(c.F)},1699:(e,t,r)=>{"use strict";r.d(t,{C:()=>f});var n=r(6610),i=r(5991),a=r(379),o=r(6070),s=r(7608),u=r(5994),c=r(3216),l=r(1538);var f=function(e){(0,a.Z)(f,e);var t,r,c=(t=f,r=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}(),function(){var e,n=(0,s.Z)(t);if(r){var i=(0,s.Z)(this).constructor;e=Reflect.construct(n,arguments,i)}else e=n.apply(this,arguments);return(0,o.Z)(this,e)});function f(e,t){var r;return(0,n.Z)(this,f),(r=c.call(this,e,t)).flops_map={},r.vscode&&vscode.postMessage({type:"dace.get_flops"}),r}return(0,i.Z)(f,[{key:"get_element_uuid",value:function(e){return e instanceof u.ZM?e.sdfg.sdfg_list_id+"/"+e.id+"/-1/"+-1:e instanceof u.gE?e.data.node.attributes.sdfg.sdfg_list_id+"/-1/-1/"+-1:e instanceof u.u7?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.data.node.scope_entry+"/"+-1:e instanceof u.zO?e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.id+"/"+-1:"-1/-1/-1/-1"}},{key:"clear_cached_flops_values",value:function(){this.renderer.for_all_elements(0,0,0,0,(function(e,t,r,n){r.data&&(void 0!==r.data.flops&&(r.data.flops=void 0),void 0!==r.data.flops_string&&(r.data.flops_string=void 0))}))}},{key:"calculate_flops_node",value:function(e,t,r){var n=this.flops_map[this.get_element_uuid(e)],i=void 0;return void 0!==n&&(i=this.symbol_resolver.parse_symbol_expression(n,t)),e.data.flops_string=n,e.data.flops=i,void 0!==i&&i>0&&r.push(i),i}},{key:"calculate_flops_graph",value:function(e,t,r){var n=this;e.nodes().forEach((function(i){var a=e.node(i);n.calculate_flops_node(a,t,r);var o=a.data.graph;o&&o.nodes().forEach((function(e){var i=o.node(e);if(i instanceof u.gE){var a={},s=i.data.node.attributes.symbol_mapping;Object.keys(s).forEach((function(e){a[e]=n.symbol_resolver.parse_symbol_expression(s[e],t)})),Object.keys(t).forEach((function(e){e in a||(a[e]=t[e])})),n.calculate_flops_node(i,a,r),n.calculate_flops_graph(i.data.graph,a,r)}else n.calculate_flops_node(i,t,r)}))}))}},{key:"recalculate_flops_values",value:function(e){this.badness_scale_center=5;var t=[0];switch(this.calculate_flops_graph(e,this.symbol_resolver.symbol_value_map,t),this.overlay_manager.badness_scale_method){case"mean":this.badness_scale_center=(0,l.J69)(t);break;case"median":default:this.badness_scale_center=(0,l.C2o)(t)}}},{key:"update_flops_map",value:function(e){this.flops_map=e,this.refresh()}},{key:"refresh",value:function(){this.clear_cached_flops_values(),this.recalculate_flops_values(this.renderer.graph),this.renderer.draw_async()}},{key:"shade_node",value:function(e,t){var r=this,n=e.data.flops,i=e.data.flops_string;if(void 0!==i&&this.renderer.mousepos&&e.intersect(this.renderer.mousepos.x,this.renderer.mousepos.y)&&(isNaN(i)&&void 0!==n?this.renderer.tooltip=function(){r.renderer.tooltip_container.innerText="FLOPS: "+i+" ("+n+")"}:this.renderer.tooltip=function(){r.renderer.tooltip_container.innerText="FLOPS: "+i}),void 0===n)return void 0!==i?void e.shade(this.renderer,t,"gray"):void 0;if(!(n<=0)){var a=1/(2*this.badness_scale_center)*n;a<0&&(a=0),a>1&&(a=1);var o=(0,u.jD)(a);e.shade(this.renderer,t,o)}}},{key:"recursively_shade_sdfg",value:function(e,t,r,n){var i=this;e.nodes().forEach((function(a){var o=e.node(a);if(!t.lod||o.intersect(n.x,n.y,n.w,n.h))if(t.lod&&(r>=STATE_LOD||o.width/r<=STATE_LOD)||o.data.state.attributes.is_collapsed)i.shade_node(o,t);else{var s=o.data.graph;s&&s.nodes().forEach((function(e){var a=s.node(e);t.lod&&!a.intersect(n.x,n.y,n.w,n.h)||(a.data.node.attributes.is_collapsed||t.lod&&r>=NODE_LOD?i.shade_node(a,t):a instanceof u.gE?i.recursively_shade_sdfg(a.data.graph,t,r,n):i.shade_node(a,t))}))}}))}},{key:"draw",value:function(){this.recursively_shade_sdfg(this.renderer.graph,this.renderer.ctx,this.renderer.canvas_manager.points_per_pixel(),this.renderer.visible_rect)}},{key:"on_mouse_event",value:function(e,t,r,n,i,a){if(!("click"!==e||a||null==i||i instanceof Edge||void 0!==i.data.flops)){var o=this.flops_map[this.get_element_uuid(i)];if(o){var s=this;this.symbol_resolver.parse_symbol_expression(o,s.symbol_resolver.symbol_value_map,!0,(function(){s.clear_cached_flops_values(),s.recalculate_flops_values(s.renderer.graph)}))}}return!1}}]),f}(c.F)},8560:(e,t,r)=>{"use strict";r.d(t,{U:()=>D});var n=r(6610),i=r(5991),a=r(681),o=r.n(a),s=r(1138),u=r(6310),c=r(5096),l=r(4194),f=r(3371),p=r(5994);function d(e){var t={width:0,height:0};return e.nodes().forEach((function(r){var n=e.node(r).x+e.node(r).width/2,i=e.node(r).y+e.node(r).height/2;n>t.width&&(t.width=n),i>t.height&&(t.height=i)})),t}function h(e){var t={x1:null,y1:null,x2:null,y2:null};return e.forEach((function(e){var r=e.topleft();(null===t.x1||r.x<t.x1)&&(t.x1=r.x),(null===t.y1||r.y<t.y1)&&(t.y1=r.y);var n=e.x+e.width/2,i=e.y+e.height/2;(null===t.x2||n>t.x2)&&(t.x2=n),(null===t.y2||i>t.y2)&&(t.y2=i)})),{x:t.x1,y:t.y1,width:t.x2-t.x1,height:t.y2-t.y1}}function m(e){var t={};return t.x1=e.points[0].x,t.y1=e.points[0].y,t.x2=e.points[0].x,t.y2=e.points[0].y,e.points.forEach((function(e){t.x1=e.x<t.x1?e.x:t.x1,t.y1=e.y<t.y1?e.y:t.y1,t.x2=e.x>t.x2?e.x:t.x2,t.y2=e.y>t.y2?e.y:t.y2})),(t={x:t.x1,y:t.y1,width:t.x2-t.x1,height:t.y2-t.y1}).width<=5&&(t.width=10,t.x-=5),t.height<=5&&(t.height=10,t.y-=5),t}function v(e){var t=m(e);e.x=t.x+t.width/2,e.y=t.y+t.height/2,e.width=t.width,e.height=t.height}function y(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 g,x=0,b=function(){function e(t,r,i){(0,n.Z)(this,e),this.ctx=t,this.ctx.lod=!0,this.canvas=i,this.anim_id=null,this.prev_time=null,this.drawables=[],this.renderer=r,this.indices=[],this.animation_start=null,this.animation_end=null,this.animation_target=null,this.animation=null,this.request_scale=!1,this.scalef=1,this._destroying=!1,this.scale_origin={x:0,y:0},this.contention=0,this._svg=document.createElementNS("http://www.w3.org/2000/svg","svg"),this.user_transform=this._svg.createSVGMatrix(),this.addCtxTransformTracking()}return(0,i.Z)(e,[{key:"stopAnimation",value:function(){this.animation_start=null,this.animation_end=null,this.animation=null,this.animation_target=null}},{key:"alreadyAnimatingTo",value:function(e){if(this.animation_target){var t=!0;return t&=this.animation_target.a==e.a,t&=this.animation_target.b==e.b,t&=this.animation_target.c==e.c,t&=this.animation_target.d==e.d,(t&=this.animation_target.e==e.e)&this.animation_target.f==e.f}return!1}},{key:"animateTo",value:function(e){if(this.alreadyAnimatingTo(e))return this.stopAnimation(),void(this.user_transform=e);this.stopAnimation(),this.animation=function(e,t){function r(e){var t=[Math.sqrt(e.a*e.a+e.b*e.b),Math.sqrt(e.c*e.c+e.d*e.d)];e.a*e.d-e.b*e.c<0&&(e.a<e.d?t[0]=-t[0]:t[1]=-t[1]);var r=e.a/(t[0]||1),n=e.b/(t[0]||1),i=e.c/(t[1]||1),a=e.d/(t[1]||1),o=r*r-n*i,s=r*n-n*a,u=r*i-n*r,c=r*a-n*n,l=180*Math.atan2(e.b,e.a)/Math.PI;return{translate:[e.e,e.f],scale:t,skew11:o,skew12:s,skew21:u,skew22:c,angle:l}}var n=r(e),i=r(t);return function(e){return t=function(e,t,r){function n(e,t){return(t-e)*r+e}var i=e.angle||360,a=t.angle||360,o=e.scale;return(e.scale[0]<0&&t.scale[1]<0||e.scale[1]<0&&t.scale[0]<0)&&(o=[-o[0],-o[1]],i+=i<0?180:-180),Math.abs(i-a)>180&&(i>a?i-=360:a-=360),{translate:[n(e.translate[0],t.translate[0]),n(e.translate[1],t.translate[1])],scale:[n(o[0],t.scale[0]),n(o[1],t.scale[1])],skew11:n(e.skew11,t.skew11),skew12:n(e.skew12,t.skew12),skew21:n(e.skew21,t.skew21),skew22:n(e.skew22,t.skew22),angle:n(i,a)}}(n,i,e),(r=document.createElementNS("http://www.w3.org/2000/svg","svg").createSVGMatrix()).a=t.skew11,r.b=t.skew12,r.c=t.skew21,r.d=t.skew22,r.e=t.translate[0]*t.skew11+t.translate[1]*t.skew21,r.f=t.translate[0]*t.skew12+t.translate[1]*t.skew22,r.rotate(0,0,t.angle*Math.PI/180).scale(t.scale[0],t.scale[1]);var t,r}}(this.user_transform,e),this.animation_target=e}},{key:"svgPoint",value:function(e,t){var r=this._svg.createSVGPoint();return r.x=e,r.y=t,r}},{key:"applyUserTransform",value:function(){var e=this.user_transform;this.ctx.setTransform(e.a,e.b,e.c,e.d,e.e,e.f)}},{key:"translation",get:function(){return{x:this.user_transform.e,y:this.user_transform.f}}},{key:"addCtxTransformTracking",value:function(){var e=this,t=document.createElementNS("http://www.w3.org/2000/svg","svg");this.ctx._custom_transform_matrix=t.createSVGMatrix();var r=function(){console.assert(!isNaN(e.ctx._custom_transform_matrix.f))},n=this.ctx,i=n.scale;n.scale=function(e,t){return n._custom_transform_matrix=n._custom_transform_matrix.scaleNonUniform(e,t),r(),i.call(n,e,t)};var a=n.translate;n.translate=function(e,t){return n._custom_transform_matrix=n._custom_transform_matrix.translate(e,t),r(),a.call(n,e,t)};var o=n.rotate;n.rotate=function(e){return n._custom_transform_matrix=n._custom_transform_matrix.rotate(180*e/Math.PI),r(),o.call(n,e)};var s=n.scale;n.transform=function(e,i,a,o,u,c){var l=t.createSVGMatrix();return l.a=e,l.b=i,l.c=a,l.d=o,l.e=u,l.f=c,n._custom_transform_matrix=n._custom_transform_matrix.multiply(l),r(),s.call(n,e,i,a,o,u,c)};var u=n.setTransform;n.setTransform=function(e,t,i,a,o,s){return n._custom_transform_matrix.a=e,n._custom_transform_matrix.b=t,n._custom_transform_matrix.c=i,n._custom_transform_matrix.d=a,n._custom_transform_matrix.e=o,n._custom_transform_matrix.f=s,r(),u.call(n,e,t,i,a,o,s)},n.custom_inverseTransformMultiply=function(e,i){var a=t.createSVGPoint();return a.x=e,a.y=i,r(),a.matrixTransform(n._custom_transform_matrix.inverse())}}},{key:"destroy",value:function(){this._destroying=!0,this.clearDrawables()}},{key:"addDrawable",value:function(t){this.drawables.push(t),this.indices.push({c:e.counter(),d:t})}},{key:"removeDrawable",value:function(e){this.drawables=this.drawables.filter((function(t){return t!=e}))}},{key:"clearDrawables",value:function(){var e,t=function(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return y(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)?y(e,t):void 0}}(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=e[Symbol.iterator]()},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}}}}(this.drawables);try{for(t.s();!(e=t.n()).done;)e.value.destroy()}catch(e){t.e(e)}finally{t.f()}this.drawables=[],this.indices=[]}},{key:"isBlank",value:function(){var e=this.canvas.getContext("2d"),t=e.getImageData(0,0,1,1).data;return 0==t[0]&&0==t[1]&&0==t[2]&&255==t[3]&&!new Uint32Array(e.getImageData(0,0,this.canvas.width,this.canvas.height).data.buffer).some((function(e){return 4278190080!==e}))}},{key:"scale",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0,r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0;if(this.stopAnimation(),!(this.request_scale||this.contention>0)){this.contention++,this.request_scale=!0,this.isBlank()&&(this.renderer.bgcolor="black",this.renderer.zoom_to_view(null,!1),e=.01),this.scale_origin.x=t,this.scale_origin.y=r;var n=e,i=this.svgPoint(this.scale_origin.x,this.scale_origin.y).matrixTransform(this.user_transform.inverse());this.user_transform=this.user_transform.translate(i.x,i.y),this.user_transform=this.user_transform.scale(n,n,1,0,0,0),this.scalef*=n,this.user_transform=this.user_transform.translate(-i.x,-i.y),this.contention--}}},{key:"set_view",value:function(e){var t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],r=this.canvas.width,n=this.canvas.height;if(0!=r&&0!=n){var i=1,a=0,o=0;e.width>e.height?(i=r/e.width,a=-e.x,o=-e.y-e.height/2+n/i/2,e.height*i>n&&(i=n/e.height,a=-e.x-e.width/2+r/i/2,o=-e.y)):(i=n/e.height,a=-e.x-e.width/2+r/i/2,o=-e.y,e.width*i>r&&(i=r/e.width,a=-e.x,o=-e.y-e.height/2+n/i/2));var s=this._svg.createSVGMatrix().scale(i,i,1,0,0,0).translate(a,o);t&&null!==this.prev_time?this.animateTo(s):(this.stopAnimation(),this.user_transform=s),this.scale_origin={x:0,y:0},this.scalef=1}}},{key:"translate",value:function(e,t){this.stopAnimation(),this.user_transform=this.user_transform.translate(e/this.user_transform.a,t/this.user_transform.d)}},{key:"translate_element",value:function(e,t,r,n,i,a,o){var c=!(arguments.length>7&&void 0!==arguments[7])||arguments[7],l=arguments.length>8&&void 0!==arguments[8]&&arguments[8],f=arguments.length>9&&void 0!==arguments[9]?arguments[9]:void 0;this.stopAnimation();var d=[],h=[],m=i[e.sdfg.sdfg_list_id],y=null;n===m||!e.data.state&&"InterstateEdge"!=e.data.type?null!==e.parent_id&&m&&(y=m.node(e.parent_id)).data.state&&(m=y.data.graph):y=a[e.sdfg.sdfg_list_id],!m||e instanceof p.kS||(m.outEdges(e.id).forEach((function(e){d.push(m.edge(e))})),m.inEdges(e.id).forEach((function(e){h.push(m.edge(e))})));var g=r.x-t.x,x=r.y-t.y,b=-1;if(e instanceof p.kS)if(l)b=-2;else if(f&&f.length>0)b=-3;else if(o)if(void 0===o.edge_point){var w=null;e.points.forEach((function(t,r){if(0!=r&&r!=e.points.length-1){var n=t.x-o.cx,i=t.y-o.cy,a=n*n+i*i;(null===w||a<w)&&(w=a,b=r)}})),o.edge_point=b}else b=o.edge_point;if(y){var _=y.x-y.width/2,N=_+y.width,E=y.y-y.height/2,M=E+y.height,S=e.height/2,A=e.width/2;e instanceof p.kS&&(S=A=0);var O=_+A,k=E+S,T=N-A,C=M-S;if(e instanceof p.kS){if(b>0){var I=e.points[b].x+g,D=e.points[b].y+x;I<=O||r.x<=_?g=O-e.points[b].x:(I>=T||r.x>=N)&&(g=T-e.points[b].x),D<=k||r.y<=E?x=k-e.points[b].y:(D>=C||r.y>=M)&&(x=C-e.points[b].y)}}else{var z=e.x+g,B=e.y+x;z<=O||r.x<=_?g=O-e.x:(z>=T||r.x>=N)&&(g=T-e.x),B<=k||r.y<=E?x=k-e.y:(B>=C||r.y>=M)&&(x=C-e.y)}}if(e instanceof p.kS){var j;if(c&&((j=(0,u.Wp)(e))||(j=(0,u._T)(e))),b>0){if(e.points[b].x+=g,e.points[b].y+=x,v(e),c){if(!j.points){j.points=Array(e.points.length);for(var U=0;U<e.points.length;U++)j.points[U]={dx:0,dy:0}}j.points[b].dx+=g,j.points[b].dy+=x}}else if(-2==b){for(var R=1;R<e.points.length-1;R++)e.points[R].x+=g,e.points[R].y+=x;if(c)for(var q=1;q<e.points.length-1;q++)j.points[q].dx+=g,j.points[q].dy+=x}else if(-3==b)for(var F=1;F<e.points.length-1;F++)e.points[F].x+=f[F].dx,e.points[F].y+=f[F].dy}else{if(H(e),c){var P=(0,u.Wp)(e);P||(P=(0,u._T)(e)),P.dx+=g,P.dy+=x,e instanceof EntryNode&&e.data.node.attributes.is_collapsed&&(P.scope_dx||(P.scope_dx=0,P.scope_dy=0),P.scope_dx+=g,P.scope_dy+=x)}if(e.data.state&&!e.data.state.attributes.is_collapsed){var L=e.data.graph;L.nodes().forEach((function(e){H(L.node(e))})),L.edges().forEach((function(e){var t=L.edge(e);t.x+=g,t.y+=x,t.points.forEach((function(e){e.x+=g,e.y+=x})),v(t)}))}d.forEach((function(t){var r=t.points.length-1,n=!1;if(null!==t.src_connector)for(var i=0;i<e.out_connectors.length;i++)if(e.out_connectors[i].data.name===t.src_connector){t.points[0]=(0,s.intersectRect)(e.out_connectors[i],t.points[1]),n=!0;break}if(n||(t.points[0].x+=g,t.points[0].y+=x),null!==t.dst_connector){var a,o,u,c=null===(a=y)||void 0===a||null===(o=a.data)||void 0===o||null===(u=o.state)||void 0===u?void 0:u.edges[t.id],l=m.node(null==c?void 0:c.dst);if(l)for(var f=0;f<l.in_connectors.length;f++)if(l.in_connectors[f].data.name===t.dst_connector){t.points[r]=(0,s.intersectRect)(l.in_connectors[f],t.points[r-1]);break}}v(t)})),h.forEach((function(t){var r=t.points.length-1,n=!1;if(null!==t.dst_connector)for(var i=0;i<e.in_connectors.length;i++)if(e.in_connectors[i].data.name===t.dst_connector){t.points[r]=(0,s.intersectRect)(e.in_connectors[i],t.points[r-1]),n=!0;break}if(n||(t.points[r].x+=g,t.points[r].y+=x),null!==t.src_connector){var a,o,u,c=null===(a=y)||void 0===a||null===(o=a.data)||void 0===o||null===(u=o.state)||void 0===u?void 0:u.edges[t.id],l=m.node(null==c?void 0:c.src);if(l)for(var f=0;f<l.out_connectors.length;f++)if(l.out_connectors[f].data.name===t.src_connector){t.points[0]=(0,s.intersectRect)(l.out_connectors[f],t.points[1]);break}}v(t)}))}function H(e){e.x+=g,e.y+=x,e.data.node&&"NestedSDFG"===e.data.node.type&&G(e.data.graph),e.in_connectors&&e.in_connectors.forEach((function(e){e.x+=g,e.y+=x})),e.out_connectors&&e.out_connectors.forEach((function(e){e.x+=g,e.y+=x}))}function G(e){e.nodes().forEach((function(t){var r=e.node(t);r.x+=g,r.y+=x;var n=r.data.graph;n&&(n.nodes().forEach((function(e){H(n.node(e))})),n.edges().forEach((function(e){var t=n.edge(e);t.x+=g,t.y+=x,t.points.forEach((function(e){e.x+=g,e.y+=x})),v(t)})))})),e.edges().forEach((function(t){var r=e.edge(t);r.x+=g,r.y+=x,r.points.forEach((function(e){e.x+=g,e.y+=x})),v(r)}))}}},{key:"mapPixelToCoordsX",value:function(e){return this.svgPoint(e,0).matrixTransform(this.user_transform.inverse()).x}},{key:"mapPixelToCoordsY",value:function(e){return this.svgPoint(0,e).matrixTransform(this.user_transform.inverse()).y}},{key:"noJitter",value:function(e){return e=parseFloat(e.toFixed(3)),Math.round(100*e)/100}},{key:"points_per_pixel",value:function(){var e=this.mapPixelToCoordsX(0);return(this.mapPixelToCoordsX(this.canvas.width)-e)/this.canvas.width}},{key:"animation_step",value:function(e){if(null!==this.animation){if(null===this.animation_start&&(this.animation_start=e,this.animation_end=e+1e3),e>=this.animation_end)return this.user_transform=this.animation(1),void this.stopAnimation();var t,r=this.animation_start,n=this.animation_end;this.user_transform=this.animation((t=(e-r)/(n-r),1-Math.pow(1-t,3)))}}},{key:"draw_now",value:function(e){if(!this._destroying){var t=e-this.prev_time;if(this.prev_time||(t=null),this.prev_time=e,!(this.contention>0)){this.contention+=1;var r=this.ctx;r.save(),r.setTransform(1,0,0,1,0,0),r.clearRect(0,0,r.canvas.width,r.canvas.height),r.fillStyle=this.renderer.bgcolor,r.fillRect(0,0,r.canvas.width,r.canvas.height),r.restore(),this.animation_step(e),this.applyUserTransform(),this.request_scale&&(this.request_scale=1!==this.contention),this.renderer.draw(t),this.contention-=1,null!==this.animation_end&&e<this.animation_end&&this.draw_async()}}}},{key:"draw_async",value:function(){var e=this;this.anim_id=window.requestAnimationFrame((function(t){return e.draw_now(t)}))}}],[{key:"counter",value:function(){return x++}}]),e}(),w=r(2465),_=r(8934),N=r(1699),E=r(4707),M=r(400),S=r(1762),A=function(){function e(t){var r=this;(0,n.Z)(this,e),this.renderer=t,this.sdfg=this.renderer.sdfg,this.vscode="undefined"!=typeof vscode&&vscode,this.symbol_value_map={},Object.keys(this.sdfg.attributes.symbols).forEach((function(e){void 0!==r.sdfg.attributes.constants_prop&&Object.keys(r.sdfg.attributes.constants_prop).includes(e)&&"Scalar"===r.sdfg.attributes.constants_prop[e][0].type?r.symbol_value_map[e]=r.sdfg.attributes.constants_prop[e][1]:r.symbol_value_map[e]=void 0})),this.symbols_to_define=[],this.init_overlay_popup_dialogue()}return(0,i.Z)(e,[{key:"symbol_value_changed",value:function(e,t){e in this.symbol_value_map&&(this.symbol_value_map[e]=t)}},{key:"parse_symbol_expression",value:function(e,t){var r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,i=void 0;try{var a=(0,M.Qc)(e);if(r)this.recursive_find_undefined_symbol(a,t),this.prompt_define_symbol(t,n);else try{var o=a.evaluate(t);i=void 0!==o&&!isNaN(o)&&Number.isInteger(+o)?+o:void 0}catch(e){i=void 0}return i}catch(e){console.error(e)}finally{return i}}},{key:"prompt_define_symbol",value:function(e){var t=this,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:void 0;if(this.symbols_to_define.length>0){var n=this.symbols_to_define.pop(),i=this;this.popup_dialogue._show(n,e,(function(){t.vscode&&vscode.postMessage({type:"analysis.define_symbol",symbol:n,definition:e[n]}),void 0!==r&&r(),i.prompt_define_symbol(e,r)}))}}},{key:"recursive_find_undefined_symbol",value:function(e,t){var r=this;e.forEach((function(e,n,i){switch(e.type){case"SymbolNode":e.name in t&&void 0===t[e.name]&&!r.symbols_to_define.includes(e.name)&&r.symbols_to_define.push(e.name);break;case"OperatorNode":case"ParenthesisNode":r.recursive_find_undefined_symbol(e,t)}}))}},{key:"init_overlay_popup_dialogue",value:function(){var e=(0,c.az)("div","",["sdfv_modal_background"],document.body);e._show=function(){this.style.display="block"},e._hide=function(){this.style.display="none"};var t=(0,c.az)("div","sdfv_overlay_dialogue",["sdfv_modal"],e);t.addEventListener("click",(function(e){e.stopPropagation()})),t.style.display="none",this.popup_dialogue=t;var r=(0,c.az)("div","",["sdfv_modal_title_bar"],this.popup_dialogue);this.popup_dialogue._title=(0,c.az)("span","",["sdfv_modal_title"],r);var n=(0,c.az)("div","",["modal_close"],r);n.innerHTML=(0,S.v)(g||(g=(0,w.Z)(['<i class="material-icons">close</i>']))),n.addEventListener("click",(function(){t._hide()}));var i=(0,c.az)("div","",["sdfv_modal_content_box"],this.popup_dialogue);function a(){if(t._map&&t._symbol){var e=t._input.value;if(e&&!isNaN(e)&&Number.isInteger(+e)&&e>0)return t._map[t._symbol]=e,t._hide(),void(t._callback&&t._callback())}t._input.setCustomValidity("Invalid, not an integer")}this.popup_dialogue._content=(0,c.az)("div","",["sdfv_modal_content"],i),this.popup_dialogue._input=(0,c.az)("input","symbol_input",["sdfv_modal_input_text"],this.popup_dialogue._content),this.popup_dialogue._input.addEventListener("keypress",(function(e){13===e.which&&a()}));var o=(0,c.az)("div","",["sdfv_modal_footer_bar"],this.popup_dialogue),s=(0,c.az)("div","",["button","sdfv_modal_confirm_button"],o);s.addEventListener("click",(function(e){a()})),(0,c.az)("span","",[],s).innerText="Confirm",(0,c.az)("div","",["clearfix"],o),this.popup_dialogue._show=function(r,n,i){this.style.display="block",t._title.innerText="Define symbol "+r,t._symbol=r,t._map=n,t._callback=i,e._show()},this.popup_dialogue._hide=function(){this.style.display="none",t._title.innerText="",t._input.value="",t._input.setCustomValidity(""),e._hide()},e.addEventListener("click",(function(e){t._hide()}))}}]),e}(),O=function(){function e(t){(0,n.Z)(this,e),this.renderer=t,this.badness_scale_method="median",this.overlays=[],this.symbol_resolver=new A(this.renderer)}return(0,i.Z)(e,[{key:"register_overlay",value:function(e){switch(e){case E.n:case N.C:case _.P:this.overlays.push(new e(this,this.renderer));break;default:this.overlays.push(e)}this.renderer.draw_async()}},{key:"deregister_overlay",value:function(e){this.overlays=this.overlays.filter((function(t){return!(t instanceof e)})),this.renderer.draw_async()}},{key:"is_overlay_active",value:function(e){return this.overlays.filter((function(t){return t instanceof e})).length>0}},{key:"get_overlay",value:function(e){var t=void 0;return this.overlays.forEach((function(r){r instanceof e&&(t=r)})),t}},{key:"symbol_value_changed",value:function(e,t){this.symbol_resolver.symbol_value_changed(e,t),this.overlays.forEach((function(e){e.refresh()}))}},{key:"update_badness_scale_method",value:function(e){this.badness_scale_method=e,this.overlays.forEach((function(e){e.refresh()}))}},{key:"draw",value:function(){this.overlays.forEach((function(e){e.draw()}))}},{key:"refresh",value:function(){this.overlays.forEach((function(e){e.refresh()}))}},{key:"on_mouse_event",value:function(e,t,r,n,i,a){this.overlays.forEach((function(o){o.on_mouse_event(e,t,r,n,i,a)}))}}]),e}(),k=r(6323);function T(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return C(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)?C(e,t):void 0}}(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=e[Symbol.iterator]()},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 C(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 I(e,t,r,n){switch(e){case"SDFGState":return t instanceof p.gE||null===t;case"Edge":return t instanceof SDFGNode||t instanceof State;case"LibraryNode":return t instanceof State&&r;default:return t instanceof State}}var D=function(){function e(t,r){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null,a=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null,o=arguments.length>4&&void 0!==arguments[4]&&arguments[4],s=arguments.length>5&&void 0!==arguments[5]?arguments[5]:null,u=arguments.length>6&&void 0!==arguments[6]?arguments[6]:null;(0,n.Z)(this,e),this.sdfg=t,this.sdfg_list={},this.state_parent_list={},this.container=r,this.ctx=null,this.canvas=null,this.last_visible_elements=null,this.last_hovered_elements=null,this.last_clicked_elements=null,this.last_dragged_element=null,this.tooltip=null,this.tooltip_container=null,this.menu=null,this.toolbar=null,this.panmode_btn=null,this.movemode_btn=null,this.selectmode_btn=null,this.addmode_btns=null,this.add_type=null,this.add_mode_lib=null,this.addmode_divs=null,this.mode_selected_bg_color="#CCCCCC",this.mouse_follow_svgs=null,this.mouse_follow_element=null,this.all_memlet_trees_sdfg=[],this.inclusive_ranges=!1,this.omit_access_nodes=!1,this.mouse_mode="pan",this.box_select_rect=null,this.mousepos=null,this.realmousepos=null,this.dragging=!1,this.drag_start=null,this.drag_second_start=null,this.external_mouse_handler=i,this.ctrl_key_selection=!1,this.shift_key_movement=!1,this.add_uuid=null,this.add_position=null,this.add_edge_start=null,this.selected_elements=[];try{this.overlay_manager=new O(this)}catch(e){this.overlay_manager=null}this.in_vscode=!1;try{vscode,vscode&&(this.in_vscode=!0)}catch(e){}this.debug_draw=o,this.init_elements(a,s,u),this.relayout(),this.all_memlet_trees_sdfg=(0,l.KV)(this.sdfg),this.update_fast_memlet_lookup()}return(0,i.Z)(e,[{key:"destroy",value:function(){try{this.menu&&this.menu.destroy(),this.canvas_manager.destroy(),this.container.removeChild(this.canvas),this.container.removeChild(this.toolbar),this.container.removeChild(this.tooltip_container)}catch(e){}}},{key:"view_settings",value:function(){return{inclusive_ranges:this.inclusive_ranges}}},{key:"update_toggle_buttons",value:function(){this.canvas.style.cursor="default",this.interaction_info_box.style.display="none",this.interaction_info_text.innerHTML="",this.panmode_btn.style="padding-bottom: 0px; user-select: none",this.movemode_btn.style="padding-bottom: 0px; user-select: none",this.selectmode_btn.style="padding-bottom: 0px; user-select: none",this.mouse_follow_element.innerHTML=null;var e,t=T(this.addmode_btns);try{for(t.s();!(e=t.n()).done;){var r=e.value;r.getAttribute("type")==this.add_type?(r.style="user-select: none; background: "+this.mode_selected_bg_color,this.mouse_follow_element.innerHTML=this.mouse_follow_svgs[this.add_type]):r.style="user-select: none;"}}catch(e){t.e(e)}finally{t.f()}switch(this.mouse_mode){case"move":this.movemode_btn.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color,this.interaction_info_box.style.display="block",this.interaction_info_text.innerHTML="Middle Mouse: Pan view<br>Right Click: Reset position";break;case"select":this.selectmode_btn.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color,this.interaction_info_box.style.display="block",this.canvas.style.cursor="crosshair",this.ctrl_key_selection?this.interaction_info_text.innerHTML="Middle Mouse: Pan view":this.interaction_info_text.innerHTML="Shift: Add to selection<br>Ctrl: Remove from selection<br>Middle Mouse: Pan view";break;case"add":this.interaction_info_box.style.display="block","Edge"===this.add_type?this.add_edge_start?this.interaction_info_text.innerHTML="Left Click: Select second element (to)<br>Middle Mouse: Pan view<br>Right Click / Esc: Abort":this.interaction_info_text.innerHTML="Left Click: Select first element (from)<br>Middle Mouse: Pan view<br>Right Click / Esc: Abort":this.interaction_info_text.innerHTML="Left Click: Place element<br>Ctrl + Left Click: Place and stay in Add Mode<br>Middle Mouse: Pan view<br>Right Click / Esc: Abort";break;case"pan":default:this.panmode_btn.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color}}},{key:"init_elements",value:function(e,t,r){var n,i=this;this.canvas=document.createElement("canvas"),this.canvas.classList.add("sdfg_canvas"),this.canvas.style.backgroundColor=t||"inherit",this.container.append(this.canvas),this.debug_draw&&(this.dbg_info_box=document.createElement("div"),this.dbg_info_box.style.position="absolute",this.dbg_info_box.style.bottom=".5rem",this.dbg_info_box.style.right=".5rem",this.dbg_info_box.style.backgroundColor="black",this.dbg_info_box.style.padding=".3rem",this.dbg_mouse_coords=document.createElement("span"),this.dbg_mouse_coords.style.color="white",this.dbg_mouse_coords.style.fontSize="1rem",this.dbg_mouse_coords.innerText="x: N/A / y: N/A",this.dbg_info_box.appendChild(this.dbg_mouse_coords),this.container.appendChild(this.dbg_info_box)),this.interaction_info_box=document.createElement("div"),this.interaction_info_box.style.position="absolute",this.interaction_info_box.style.bottom=".5rem",this.interaction_info_box.style.left=".5rem",this.interaction_info_box.style.backgroundColor="rgba(0, 0, 0, 0.5)",this.interaction_info_box.style.borderRadius="5px",this.interaction_info_box.style.padding=".3rem",this.interaction_info_box.style.display="none",this.interaction_info_text=document.createElement("span"),this.interaction_info_text.style.color="#eeeeee",this.interaction_info_text.innerHTML="",this.interaction_info_box.appendChild(this.interaction_info_text),this.container.appendChild(this.interaction_info_box),this.toolbar=document.createElement("div"),this.toolbar.style="position:absolute; top:10px; left: 10px;";try{f.x,(n=document.createElement("button")).className="button",n.innerHTML='<i class="material-icons">menu</i>',n.style="padding-bottom: 0px; user-select: none";var a=this;n.onclick=function(){var e=this;if(a.menu&&a.menu.visible())a.menu.destroy();else{var t=this.getBoundingClientRect(),r=new f.x;r.addOption("Save view as PNG",(function(e){return a.save_as_png()})),a.has_pdf()&&(r.addOption("Save view as PDF",(function(e){return a.save_as_pdf()})),r.addOption("Save all as PDF",(function(e){return a.save_as_pdf(!0)}))),r.addCheckableOption("Inclusive ranges",a.inclusive_ranges,(function(e,t){a.inclusive_ranges=t})),r.addCheckableOption("Adaptive content hiding",a.ctx.lod,(function(e,t){a.ctx.lod=t})),this.in_vscode||r.addOption("Overlays",(function(){if(a.overlays_menu&&a.overlays_menu.visible())a.overlays_menu.destroy();else{var t=r._cmenu_elem.getBoundingClientRect(),n=new f.x;n.addCheckableOption("Memory volume analysis",a.overlay_manager.is_overlay_active(E.n),(function(t,r){r?a.overlay_manager.register_overlay(E.n):a.overlay_manager.deregister_overlay(E.n),a.draw_async(),e.in_vscode&&refresh_analysis_pane()})),a.overlays_menu=n,a.overlays_menu.show(t.left,t.top)}})),r.addCheckableOption("Hide Access Nodes",a.omit_access_nodes,(function(e,t){a.omit_access_nodes=t,a.relayout(),a.draw_async()})),r.addOption("Reset positions",(function(){return a.reset_positions()})),a.menu=r,a.menu.show(t.left,t.bottom)}},n.title="Menu",this.toolbar.appendChild(n)}catch(e){}if((n=document.createElement("button")).className="button",n.innerHTML='<i class="material-icons">filter_center_focus</i>',n.style="padding-bottom: 0px; user-select: none",n.onclick=function(){return i.zoom_to_view()},n.title="Zoom to fit SDFG",this.toolbar.appendChild(n),(n=document.createElement("button")).className="button",n.innerHTML='<i class="material-icons">unfold_less</i>',n.style="padding-bottom: 0px; user-select: none",n.onclick=function(){return i.collapse_all()},n.title="Collapse all elements",this.toolbar.appendChild(n),(n=document.createElement("button")).className="button",n.innerHTML='<i class="material-icons">unfold_more</i>',n.style="padding-bottom: 0px; user-select: none",n.onclick=function(){return i.expand_all()},n.title="Expand all elements",this.toolbar.appendChild(n),r){this.panmode_btn=r.pan,this.movemode_btn=r.move,this.selectmode_btn=r.select,this.addmode_btns=r.add_btns;var o,s=T(this.addmode_btns);try{var u=function(){var e=o.value;"LibraryNode"===e.getAttribute("type")?e.onclick=function(){i.show_select_library_node_dialog((function(){i.mouse_mode="add",i.add_type="LibraryNode",i.add_edge_start=null,i.update_toggle_buttons()}))}:e.onclick=function(){daemon_connected?(i.mouse_mode="add",i.add_type=e.getAttribute("type"),i.add_mode_lib=null,i.add_edge_start=null,i.update_toggle_buttons()):i.show_no_daemon_dialog()}};for(s.s();!(o=s.n()).done;)u()}catch(e){s.e(e)}finally{s.f()}this.mode_selected_bg_color="#22A4FE"}else{this.addmode_btns=[];var c=document.createElement("button");c.className="button",c.innerHTML='<i class="material-icons">pan_tool</i>',c.style="padding-bottom: 0px; user-select: none; background: "+this.mode_selected_bg_color,c.title="Pan mode",this.panmode_btn=c,this.toolbar.appendChild(c);var l=document.createElement("button");l.className="button",l.innerHTML='<i class="material-icons">open_with</i>',l.style="padding-bottom: 0px; user-select: none",l.title="Object moving mode",this.movemode_btn=l,this.toolbar.appendChild(l);var p=document.createElement("button");p.className="button",p.innerHTML='<i class="material-icons">border_style</i>',p.style="padding-bottom: 0px; user-select: none",p.title="Select mode",this.selectmode_btn=p,this.toolbar.appendChild(p)}if(this.panmode_btn.onclick=function(){i.mouse_mode="pan",i.add_type=null,i.add_mode_lib=null,i.add_edge_start=null,i.update_toggle_buttons()},this.movemode_btn.onclick=function(e,t){i.shift_key_movement&&!1===t?i.mouse_mode="pan":i.mouse_mode="move",i.add_type=null,i.add_mode_lib=null,i.add_edge_start=null,i.shift_key_movement=t,i.update_toggle_buttons()},this.selectmode_btn.onclick=function(e,t){i.ctrl_key_selection&&!1===t?i.mouse_mode="pan":i.mouse_mode="select",i.add_type=null,i.add_mode_lib=null,i.add_edge_start=null,i.ctrl_key_selection=t,i.update_toggle_buttons()},document.addEventListener("keydown",(function(e){return i.on_key_event(e)})),document.addEventListener("keyup",(function(e){return i.on_key_event(e)})),this.in_vscode){var d=document.createElement("button");d.id="exit-preview-button",d.className="button hidden",d.innerHTML='<i class="material-icons">close</i>',d.style="padding-bottom: 0px; user-select: none",d.onclick=function(){d.className="button hidden",window.viewing_history_state=!1,vscode&&(vscode.postMessage({type:"sdfv.get_current_sdfg",prevent_refreshes:!0}),vscode.postMessage({type:"transformation_history.refresh",reset_active:!0}))},d.title="Exit preview",this.toolbar.appendChild(d)}this.container.append(this.toolbar),this.tooltip_container=document.createElement("div"),this.tooltip_container.innerHTML="",this.tooltip_container.className="sdfvtooltip",this.tooltip_container.onmouseover=function(){return i.tooltip_container.style.display="none"},this.container.appendChild(this.tooltip_container),this.error_popover_container=document.createElement("div"),this.error_popover_container.innerHTML="",this.error_popover_container.className="invalid_popup",this.error_popover_text=document.createElement("div");var h=document.createElement("button"),m=this;h.onclick=function(){m.sdfg.error=void 0,m.error_popover_text.innerText="",m.error_popover_container.style.display="none"},h.style.float="right",h.style.cursor="pointer",h.style.color="white",h.innerHTML='<i class="material-icons">close</i>',this.error_popover_container.appendChild(h),this.error_popover_container.appendChild(this.error_popover_text),this.container.appendChild(this.error_popover_container),this.ctx=this.canvas.getContext("2d"),this.canvas_manager=new b(this.ctx,this,this.canvas),null!==e&&(this.canvas_manager.user_transform=e),new MutationObserver((function(e){i.onresize(),i.draw_async()})).observe(this.container,{attributes:!0}),this.bgcolor=t||window.getComputedStyle(this.canvas).backgroundColor,this.relayout(),this.set_mouse_handlers(),null===e&&this.zoom_to_view();var v=document.createElement("div");v.style="position: absolute; top: 0px; left: 0px; user-select: none; pointer-events: none;",this.container.appendChild(v),this.mouse_follow_element=v,this.mouse_follow_svgs={Map:'<svg width="8rem" height="2rem" viewBox="0 0 800 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="10" x2="190" y1="190" y2="10"/>\n                <line x1="190" x2="600" y1="10" y2="10"/>\n                <line x1="600" x2="790" y1="10" y2="190"/>\n                <line x1="790" x2="10" y1="190" y2="190"/>\n            </svg>',Consume:'<svg width="8rem" height="2rem" viewBox="0 0 800 200" stroke="black" stroke-width="10" stroke-dasharray="60,25" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="10"x2="190" y1="190" y2="10"/>\n                <line x1="190" x2="600" y1="10" y2="10"/>\n                <line x1="600" x2="790" y1="10" y2="190"/>\n                <line x1="790" x2="10" y1="190" y2="190"/>\n            </svg>',Tasklet:'<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="10" x2="70" y1="130" y2="190"/>\n                <line x1="70" x2="330" y1="190" y2="190"/>\n                <line x1="330" x2="390" y1="190" y2="130"/>\n                <line x1="390" x2="390" y1="130" y2="70"/>\n                <line x1="390" x2="330" y1="70" y2="10"/>\n                <line x1="330" x2="70" y1="10" y2="10"/>\n                <line x1="70" x2="10" y1="10" y2="70"/>\n                <line x1="10" x2="10" y1="70" y2="130"/>\n            </svg>',NestedSDFG:'<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <line x1="40" x2="80" y1="120" y2="160"/>\n                <line x1="80" x2="320" y1="160" y2="160"/>\n                <line x1="320" x2="360" y1="160" y2="120"/>\n                <line x1="360" x2="360" y1="120" y2="80"/>\n                <line x1="360" x2="320" y1="80" y2="40"/>\n                <line x1="320" x2="80" y1="40" y2="40"/>\n                <line x1="80" x2="40" y1="40" y2="80"/>\n                <line x1="40" x2="40" y1="80" y2="120"/>\n                \n                <line x1="10" x2="70" y1="130" y2="190"/>\n                <line x1="70" x2="330" y1="190" y2="190"/>\n                <line x1="330" x2="390" y1="190" y2="130"/>\n                <line x1="390" x2="390" y1="130" y2="70"/>\n                <line x1="390" x2="330" y1="70" y2="10"/>\n                <line x1="330" x2="70" y1="10" y2="10"/>\n                <line x1="70" x2="10" y1="10" y2="70"/>\n                <line x1="10" x2="10" y1="70" y2="130"/>\n            </svg>',LibraryNode:'<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                        <line x1="10" x2="10" y1="10" y2="190"/>\n                        <line x1="10" x2="390" y1="190" y2="190"/>\n                        <line x1="390" x2="390" y1="190" y2="55"/>\n                        <line x1="390" x2="345" y1="55" y2="10"/>\n                        <line x1="345" x2="10" y1="10" y2="10"/>\n                        <line x1="345" x2="345" y1="10" y2="55"/>\n                        <line x1="345" x2="390" y1="55" y2="55"/>\n            </svg>',AccessNode:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <circle cx="100" cy="100" r="90" fill="none"/>\n            </svg>',Stream:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <circle cx="100" cy="100" r="90" fill="none" stroke-dasharray="60,25"/>\n            </svg>',SDFGState:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <rect x="20" y="20" width="160" height="160" style="fill:#deebf7;" />\n            </svg>',Connector:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <circle cx="100" cy="100" r="40" fill="none"/>\n            </svg>',Edge:'<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">\n                <defs>\n                    <marker id="arrowhead" markerWidth="10" markerHeight="7"  refX="0" refY="3.5" orient="auto">\n                        <polygon points="0 0, 10 3.5, 0 7" />\n                    </marker>\n                </defs>\n                <line x1="20" y1="20" x2="180" y2="180" marker-end="url(#arrowhead)" />\n            </svg>'},this.update_toggle_buttons(),this.draw_async()}},{key:"draw_async",value:function(){this.canvas_manager.draw_async()}},{key:"send_new_sdfg_to_vscode",value:function(){}},{key:"add_node_to_graph",value:function(){}},{key:"remove_graph_nodes",value:function(){}},{key:"update_new_element",value:function(){}},{key:"show_no_daemon_dialog",value:function(){}},{key:"show_select_library_node_dialog",value:function(){}},{key:"set_sdfg",value:function(e){if(this.sdfg=e,this.relayout(),this.draw_async(),1==this.selected_elements.length){var t=(0,u.FK)(this.selected_elements[0]);(0,k.e)((0,u.sC)(this.graph,t).element)}}},{key:"set_mouse_handlers",value:function(){for(var e=this,t=this.canvas,r=function(){return t.getBoundingClientRect()},n=function(t){return e.canvas_manager.mapPixelToCoordsX(t.clientX-r().left)},i=function(t){return e.canvas_manager.mapPixelToCoordsY(t.clientY-r().top)},a=function(){var r=s[o];t.addEventListener(r,(function(t){e.on_mouse_event(t,n,i,r)||e.in_vscode||(t.stopPropagation(),t.preventDefault())}))},o=0,s=["mousedown","mousemove","mouseup","touchstart","touchmove","touchend","wheel","click","dblclick","contextmenu"];o<s.length;o++)a()}},{key:"onresize",value:function(){this.canvas.style.width="99%",this.canvas.style.height="99%",this.canvas.width=this.canvas.offsetWidth,this.canvas.height=this.canvas.offsetHeight}},{key:"update_fast_memlet_lookup",value:function(){this.all_memlet_trees=[];var e,t=T(this.all_memlet_trees_sdfg);try{for(t.s();!(e=t.n()).done;){var r,n=e.value,i=new Set,a=T(n);try{for(a.s();!(r=a.n()).done;){var o=r.value;i.add(o.attributes.data.edge)}}catch(e){a.e(e)}finally{a.f()}this.all_memlet_trees.push(i)}}catch(e){t.e(e)}finally{t.f()}}},{key:"relayout",value:function(){this.sdfg_list={},this.graph=z(this.ctx,this.sdfg,this.sdfg_list,this.state_parent_list,this.omit_access_nodes),this.onresize(),this.update_fast_memlet_lookup(),this.translate_moved_elements(),null!==this.overlay_manager&&this.overlay_manager.refresh();try{vscode&&outline(this,this.graph)}catch(e){}return this.graph}},{key:"translate_moved_elements",value:function(){var e=this;(0,l.LY)(this.graph,(function(t,r){var n,i=0,a=0;t instanceof Node&&function e(t){if(t.data.node.scope_entry){var n=r.node(t.data.node.scope_entry),o=(0,u.Wp)(n);o&&Number.isFinite(o.scope_dx)&&Number.isFinite(o.scope_dy)&&(i+=o.scope_dx,a+=o.scope_dy),n&&e(n)}}(t);var o=i,s=a,c=(0,u.Wp)(t);return c&&(o+=c.dx,s+=c.dy),(o||s)&&e.canvas_manager.translate_element(t,{x:t.x,y:t.y},{x:t.x+o,y:t.y+s},e.graph,e.sdfg_list,e.state_parent_list,void 0,!1),r.inEdges(t.id).forEach((function(e){})),null===(n=r.inEdges(t.id))||void 0===n||n.forEach((function(t){var n,o=r.edge(t),s=(0,u.Wp)(o);if(i||a){(n=[]).push({dx:0,dy:0});for(var c=1;c<o.points.length-1;c++)n.push({dx:i,dy:a}),null!=s&&s.points&&(n[c].dx+=s.points[c].dx,n[c].dx+=s.points[c].dy);n.push({dx:0,dy:0})}else null!=s&&s.points&&(n=s.points);n&&e.canvas_manager.translate_element(o,{x:0,y:0},{x:0,y:0},e.graph,e.sdfg_list,e.state_parent_list,void 0,!1,!1,n)})),!0}))}},{key:"zoom_to_view",value:function(){var e=this,t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null,r=!(arguments.length>1&&void 0!==arguments[1])||arguments[1];t&&0!=t.length||(t=this.graph.nodes().map((function(t){return e.graph.node(t)})));var n=h(t);this.canvas_manager.set_view(n,r),this.draw_async()}},{key:"collapse_all",value:function(){this.for_all_sdfg_elements((function(e,t,r){"is_collapsed"in r.attributes&&!r.type.endsWith("Exit")&&(r.attributes.is_collapsed=!0)})),this.send_new_sdfg_to_vscode(),this.relayout(),this.draw_async()}},{key:"expand_all",value:function(){this.for_all_sdfg_elements((function(e,t,r){"is_collapsed"in r.attributes&&!r.type.endsWith("Exit")&&(r.attributes.is_collapsed=!1)})),this.send_new_sdfg_to_vscode(),this.relayout(),this.draw_async()}},{key:"reset_positions",value:function(){this.for_all_sdfg_elements((function(e,t,r){(0,u.lU)(r)})),this.send_new_sdfg_to_vscode(),this.relayout(),this.draw_async()}},{key:"save",value:function(e,t){var r=document.createElement("a");r.setAttribute("download",e),r.href=t,document.body.appendChild(r),window.requestAnimationFrame((function(){var e=new MouseEvent("click");r.dispatchEvent(e),document.body.removeChild(r)}))}},{key:"save_as_png",value:function(){this.save("sdfg.png",this.canvas.toDataURL("image/png"))}},{key:"has_pdf",value:function(){try{return blobStream,canvas2pdf.PdfContext,!0}catch(e){return!1}}},{key:"save_as_pdf",value:function(){var e,t=this,r=arguments.length>0&&void 0!==arguments[0]&&arguments[0],n=blobStream(),i=this.canvas_manager.mapPixelToCoordsX(0),a=this.canvas_manager.mapPixelToCoordsY(0);if(r){var o=this.graph.nodes().map((function(e){return t.graph.node(e)})),s=h(o);e=[s.width,s.height]}else{var u=this.canvas_manager.mapPixelToCoordsX(this.canvas.width),c=this.canvas_manager.mapPixelToCoordsY(this.canvas.height),l=u-i,f=c-a;e=[l,f]}var p=new canvas2pdf.PdfContext(n,{size:e}),d=this.ctx;this.ctx=p,this.ctx.lod=!r,this.ctx.pdf=!0,r||this.ctx.translate(-i,-a),this.draw_async(),p.stream.on("finish",(function(){t.save("sdfg.pdf",p.stream.toBlobURL("application/pdf")),t.ctx=d,t.draw_async()}))}},{key:"debug_draw_grid",value:function(e,t,r,n){for(var i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:100,a=Math.floor(e/i)*i,o=Math.ceil(r/i)*i,s=Math.floor(t/i)*i,u=Math.ceil(n/i)*i,c=a;c<=o;c+=i)this.ctx.moveTo(c,s),this.ctx.lineTo(c,u);for(c=s;c<=u;c+=i)this.ctx.moveTo(a,c),this.ctx.lineTo(o,c);this.ctx.strokeStyle="yellow",this.ctx.stroke(),this.ctx.beginPath(),this.ctx.arc(0,0,10,0,2*Math.PI,!1),this.ctx.fillStyle="red",this.ctx.fill(),this.ctx.strokeStyle="red",this.ctx.stroke()}},{key:"draw",value:function(e){var t=this.ctx,r=this.graph,n=this.canvas_manager.mapPixelToCoordsX(0),i=this.canvas_manager.mapPixelToCoordsY(0),a=this.canvas_manager.mapPixelToCoordsX(this.canvas.width),o=this.canvas_manager.mapPixelToCoordsY(this.canvas.height),s=a-n,u=o-i;if(this.visible_rect={x:n,y:i,w:s,h:u},this.on_pre_draw(),(0,p.tl)(this,t,r,this.mousepos,this.debug_draw),this.box_select_rect){this.ctx.beginPath();var c=this.ctx.lineWidth;this.ctx.lineWidth=this.canvas_manager.points_per_pixel(),this.ctx.strokeStyle="grey",this.ctx.rect(this.box_select_rect.x_start,this.box_select_rect.y_start,this.box_select_rect.x_end-this.box_select_rect.x_start,this.box_select_rect.y_end-this.box_select_rect.y_start),this.ctx.stroke(),this.ctx.lineWidth=c}this.debug_draw&&(this.debug_draw_grid(n,i,a,o,100),this.mousepos?this.dbg_mouse_coords.innerText="x: "+Math.floor(this.mousepos.x)+" / y: "+Math.floor(this.mousepos.y):this.dbg_mouse_coords.innerText="x: N/A / y: N/A"),this.on_post_draw()}},{key:"on_pre_draw",value:function(){}},{key:"on_post_draw",value:function(){null!==this.overlay_manager&&this.overlay_manager.draw();try{this.ctx.end()}catch(e){}if(this.tooltip){var e=this.canvas.getBoundingClientRect(),t={x:this.realmousepos.x-e.x,y:this.realmousepos.y-e.y};this.tooltip_container.style="",this.tooltip_container.innerHTML="",this.tooltip_container.style.display="block",this.tooltip(this.tooltip_container),this.tooltip_container.style.top=t.y+"px",this.tooltip_container.style.left=t.x+20+"px"}else this.tooltip_container.style.display="none";if(this.sdfg.error){var r=this.sdfg.error,n="",i=-1,a=-1;if(void 0!==r.isedge_id)n="isedge",a=r.isedge_id;else{if(void 0===r.state_id)return;i=r.state_id,void 0!==r.node_id?(n="node",a=r.node_id):void 0!==r.edge_id?(n="edge",a=r.edge_id):n="state"}var o=find_graph_element(this.graph,n,r.sdfg_id,i,a);o&&(this.zoom_to_view([o]),this.error_popover_container.style.display="block",this.error_popover_container.style.bottom="5%",this.error_popover_container.style.left="5%",this.error_popover_text.innerText=r.message)}else this.error_popover_container.style.display="none"}},{key:"visible_elements",value:function(){var e=this.canvas_manager.mapPixelToCoordsX(0),t=this.canvas_manager.mapPixelToCoordsY(0),r=this.canvas_manager.mapPixelToCoordsX(this.canvas.width)-e,n=this.canvas_manager.mapPixelToCoordsY(this.canvas.height)-t,i=[];return this.do_for_intersected_elements(e,t,r,n,(function(e,t,r){var n=t.state?Number(t.state):-1,a="other";"nodes"===e?a="node":"states"===e?a="state":"edges"===e?a="edge":"isedges"===e?a="isedge":"connectors"===e&&(a="connector"),i.push({type:a,sdfg_id:Number(t.sdfg_id),state_id:n,id:Number(t.id)})})),i}},{key:"elements_in_rect",value:function(e,t,r,n){var i={states:[],nodes:[],connectors:[],edges:[],isedges:[]};return this.do_for_intersected_elements(e,t,r,n,(function(e,t,r){t.obj=r,i[e].push(t)})),i}},{key:"do_for_intersected_elements",value:function(e,t,r,n,i){!function a(o,s,u){o.nodes().forEach((function(c){var l=o.node(c);if(l&&l.intersect(e,t,r,n)){if(i("states",{sdfg:s,sdfg_id:u,id:c},l),l.data.state.attributes.is_collapsed)return;var f=l.data.graph;if(!f)return;f.nodes().forEach((function(o){var l=f.node(o);l.intersect(e,t,r,n)&&(i("nodes",{sdfg:s,sdfg_id:u,state:c,id:o},l),"NestedSDFG"===l.data.node.type&&a(l.data.graph,l.data.node.attributes.sdfg.attributes.name,l.data.node.attributes.sdfg.sdfg_list_id)),l.in_connectors.forEach((function(a,l){a.intersect(e,t,r,n)&&i("connectors",{sdfg:s,sdfg_id:u,state:c,node:o,connector:l,conntype:"in"},a)})),l.out_connectors.forEach((function(a,l){a.intersect(e,t,r,n)&&i("connectors",{sdfg:s,sdfg_id:u,state:c,node:o,connector:l,conntype:"out"},a)}))})),f.edges().forEach((function(a){var o=f.edge(a);o.intersect(e,t,r,n)&&i("edges",{sdfg:s,sdfg_id:u,state:c,id:o.id},o)}))}})),o.edges().forEach((function(a){var c=o.edge(a);c.intersect(e,t,r,n)&&i("isedges",{sdfg:s,sdfg_id:u,id:c.id},c)}))}(this.graph,this.sdfg.attributes.name,this.sdfg.sdfg_list_id)}},{key:"for_all_sdfg_elements",value:function(e){!function t(r){r.nodes.forEach((function(n,i){e("states",{sdfg:r,id:i},n),n.nodes.forEach((function(n,a){e("nodes",{sdfg:r,state:i,id:a},n),"NestedSDFG"===n.type&&t(n.attributes.sdfg)})),n.edges.forEach((function(t,n){e("edges",{sdfg:r,state:i,id:n},t)}))})),r.edges.forEach((function(t,n){e("isedges",{sdfg:r,id:n},t)}))}(this.sdfg)}},{key:"for_all_elements",value:function(e,t,r,n,i){!function a(o,s){o.nodes().forEach((function(u){var c=o.node(u);if(c&&(i("states",{sdfg:s,id:u,graph:o},c,c.intersect(e,t,r,n)),!c.data.state.attributes.is_collapsed)){var l=c.data.graph;l&&(l.nodes().forEach((function(o){var c=l.node(o);i("nodes",{sdfg:s,state:u,id:o,graph:l},c,c.intersect(e,t,r,n)),"NestedSDFG"===c.data.node.type&&a(c.data.graph,c.data.node.attributes.sdfg.attributes.name),c.in_connectors.forEach((function(a,c){i("connectors",{sdfg:s,state:u,node:o,connector:c,conntype:"in",graph:l},a,a.intersect(e,t,r,n))})),c.out_connectors.forEach((function(a,c){i("connectors",{sdfg:s,state:u,node:o,connector:c,conntype:"out",graph:l},a,a.intersect(e,t,r,n))}))})),l.edges().forEach((function(a){var o=l.edge(a);i("edges",{sdfg:s,state:u,id:o.id,graph:l},o,o.intersect(e,t,r,n))})))}})),o.edges().forEach((function(a){var u=o.edge(a);i("isedges",{sdfg:s,id:u.id,graph:o},u,u.intersect(e,t,r,n))}))}(this.graph,this.sdfg.attributes.name)}},{key:"get_nested_memlet_tree",value:function(e){var t,r=T(this.all_memlet_trees);try{for(r.s();!(t=r.n()).done;){var n=t.value;if(n.has(e))return n}}catch(e){r.e(e)}finally{r.f()}return[]}},{key:"find_elements_under_cursor",value:function(e,t){for(var r=this.elements_in_rect(e,t,0,0),n=r.states,i=r.nodes,a=r.edges,o=r.isedges,s=r.connectors,u=n.length+i.length+a.length+o.length+s.length,c=null,l=-1,f=0,p=[n,o,i,a];f<p.length;f++)for(var d=p[f],h=0;h<d.length;h++){var m=d[h].obj.width*d[h].obj.height;(l<0||m<l)&&(l=m,c=d[h].obj)}return{total_elements:u,elements:r,foreground_elem:c}}},{key:"on_key_event",value:function(e){if(e.target===document.body){if(this.ctrl_key_selection&&!e.ctrlKey&&this.selectmode_btn.onclick(e,!1),this.shift_key_movement&&!e.shiftKey&&this.movemode_btn.onclick(e,!1),"pan"===this.mouse_mode)return"Escape"===e.key?this.selected_elements.length>0&&(this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=[],this.draw_async()):"Delete"===e.key&&"keyup"===e.type&&(this.selected_elements.length>0&&this.remove_graph_nodes(this.selected_elements),this.selected_elements=[]),e.ctrlKey&&!e.shiftKey&&this.selectmode_btn.onclick(e,!0),e.shiftKey&&!e.ctrlKey&&this.movemode_btn.onclick(e,!0),!0;"Escape"!==e.key||e.ctrlKey||e.shiftKey||this.panmode_btn.onclick()}}},{key:"on_mouse_event",value:function(e,t,r){var n=this,i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"other";(this.ctrl_key_selection||this.shift_key_movement)&&this.on_key_event(e);var a=!1,o=!1,s=!1;if("mousedown"===i||"touchstart"===i)this.drag_start=e;else if("mouseup"===i)this.drag_start=null,this.last_dragged_element=null;else if("touchend"===i)0==e.touches.length?this.drag_start=null:this.drag_start=e;else if("mousemove"===i){var c=this.mousepos;if(this.mousepos={x:t(e),y:r(e)},this.realmousepos={x:e.clientX,y:e.clientY},this.drag_start&&1&e.buttons){if(this.dragging=!0,"move"===this.mouse_mode){if(this.last_dragged_element){this.canvas.style.cursor="grabbing",this.drag_start.cx=t(this.drag_start),this.drag_start.cy=r(this.drag_start);var f=[this.last_dragged_element];this.selected_elements.includes(this.last_dragged_element)&&this.selected_elements.length>1&&(f=this.selected_elements.filter((function(e){if(e instanceof p.wR)return!1;var t=e.sdfg.sdfg_list_id,r=n.state_parent_list[t];if(r&&n.selected_elements.includes(r))return!1;var i=n.sdfg_list[t].node(e.parent_id);return!i||!n.selected_elements.includes(i)})));var d,h=f.length>1,m=T(f);try{for(m.s();!(d=m.n()).done;){var v=d.value;this.canvas_manager.translate_element(v,c,this.mousepos,this.graph,this.sdfg_list,this.state_parent_list,this.drag_start,!0,h)}}catch(e){m.e(e)}finally{m.f()}return a=!0,this.draw_async(),!1}var y=this.find_elements_under_cursor(this.mousepos.x,this.mousepos.y);return!y.foreground_elem||(this.last_dragged_element=y.foreground_elem,this.canvas.style.cursor="grabbing",!1)}"select"===this.mouse_mode?(this.box_select_rect={x_start:t(this.drag_start),y_start:r(this.drag_start),x_end:this.mousepos.x,y_end:this.mousepos.y},a=!0):(this.canvas_manager.translate(e.movementX,e.movementY),a=!0)}else if(this.drag_start&&4&e.buttons)this.dragging=!0,this.canvas_manager.translate(e.movementX,e.movementY),a=!0,o=!0;else if(this.drag_start=null,this.last_dragged_element=null,1&e.buttons||4&e.buttons)return!0}else if("touchmove"===i)if(this.drag_start.touches.length!=e.touches.length)this.drag_start=e;else{if(1==e.touches.length)return this.canvas_manager.translate(e.touches[0].clientX-this.drag_start.touches[0].clientX,e.touches[0].clientY-this.drag_start.touches[0].clientY),this.drag_start=e,a=!0,this.draw_async(),!1;if(2==e.touches.length){var g=this.drag_start.touches[0],x=this.drag_start.touches[1],b=g.clientX,w=x.clientX,_=g.clientY,N=x.clientY,E=[(b+w)/2,(_+N)/2],M=Math.sqrt(Math.pow(b-w,2)+Math.pow(_-N,2));b=e.touches[0].clientX,w=e.touches[1].clientX,_=e.touches[0].clientY,N=e.touches[1].clientY;var S=Math.sqrt(Math.pow(b-w,2)+Math.pow(_-N,2)),A=[(b+w)/2,(_+N)/2];return this.canvas_manager.translate(A[0]-E[0],A[1]-E[1]),this.canvas_manager.scale(S/M,A[0],A[1]),this.drag_start=e,a=!0,this.draw_async(),!1}}else if("wheel"===i){var O=this.canvas.getBoundingClientRect(),k=e.clientX-O.x,C=e.clientY-O.y;this.canvas_manager.scale(e.deltaY>0?.9:1.1,k,C),a=!0,o=!0}if(!this.mousepos)return!0;var D=this.find_elements_under_cursor(this.mousepos.x,this.mousepos.y),z=D.elements,B=D.total_elements,j=D.foreground_elem;if("add"==this.mouse_mode){var U=this.mouse_follow_element;I(this.add_type,j,this.add_mode_lib,this.mousepos)?U.firstElementChild.setAttribute("stroke","green"):U.firstElementChild.setAttribute("stroke","red"),U.style.left=e.layerX-U.firstElementChild.clientWidth/2+"px",U.style.top=e.layerY-U.firstElementChild.clientHeight/2+"px"}if("select"===this.mouse_mode?this.canvas.style.cursor="crosshair":B>0?"move"===this.mouse_mode&&this.drag_start?this.canvas.style.cursor="grabbing":"move"===this.mouse_mode?this.canvas.style.cursor="grab":j.data.state&&j.data.state.attributes.is_collapsed||j.data.node&&j.data.node.attributes.is_collapsed?this.canvas.style.cursor="alias":this.canvas.style.cursor="pointer":this.canvas.style.cursor="auto",this.tooltip=null,this.last_hovered_elements=z,this.for_all_elements(this.mousepos.x,this.mousepos.y,0,0,(function(e,t,r,n){r.hovered=!1,r.highlighted=!1})),this.for_all_elements(this.mousepos.x,this.mousepos.y,0,0,(function(e,t,r,i){if(i&&r instanceof p.kS&&null!=r.parent_id&&n.get_nested_memlet_tree(r).forEach((function(e){e!=r&&void 0!==e&&(e.highlighted=!0)})),i&&r instanceof AccessNode&&(0,l.LY)(n.sdfg_list[r.sdfg.sdfg_list_id],(function(e){return e instanceof State||(e instanceof AccessNode&&e.data.node.label===r.data.node.label&&(e.highlighted=!0),!1)})),i&&r instanceof p.wR){var a=t.graph.node(r.parent_id).data.graph;a&&(0,l.LY)(a,(function(e){return e instanceof State||(e instanceof AccessNode&&e.data.node.label===r.label()&&(e.highlighted=!0),!1)}))}i&&(r.hovered=!0)})),"add"===this.mouse_mode&&"Edge"===this.add_type&&this.add_edge_start&&(this.add_edge_start.highlighted=!0),"mousemove"===i&&(a=!0),"dblclick"===i){var R=j?j.sdfg:null,q=null;j instanceof State?q=j.data.state:j instanceof SDFGNode?(q=j.data.node).type.endsWith("Exit")&&(q=R.nodes[j.parent_id].nodes[q.scope_entry]):q=null,q&&"is_collapsed"in q.attributes&&(q.attributes.is_collapsed=!q.attributes.is_collapsed,this.send_new_sdfg_to_vscode(),this.relayout(),a=!0,o=!0)}var F=!1;if("click"===i)if(this.dragging){if(this.dragging=!1,F=!0,o=!0,this.box_select_rect){var P=[],L=Math.min(this.box_select_rect.x_start,this.box_select_rect.x_end),H=Math.max(this.box_select_rect.x_start,this.box_select_rect.x_end),G=Math.min(this.box_select_rect.y_start,this.box_select_rect.y_end),Z=Math.max(this.box_select_rect.y_start,this.box_select_rect.y_end),W=H-L,$=Z-G;this.do_for_intersected_elements(L,G,W,$,(function(e,t,r){r.contained_in(L,G,W,$)&&P.push(r)})),e.shiftKey&&!this.ctrl_key_selection?P.forEach((function(e){n.selected_elements.includes(e)||n.selected_elements.push(e)})):e.ctrlKey&&!this.ctrl_key_selection?P.forEach((function(e){n.selected_elements.includes(e)&&(n.selected_elements=n.selected_elements.filter((function(t){return t.selected=!1,t!==e})))})):(this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=P),this.box_select_rect=null,a=!0,o=!0,s=!0}"move"===this.mouse_mode&&this.send_new_sdfg_to_vscode()}else{if("add"===this.mouse_mode&&I(this.add_type,j,this.add_mode_lib,this.mousepos)){if("Edge"===this.add_type)if(this.add_edge_start){var V=this.add_edge_start;this.add_edge_start=void 0,this.add_node_to_graph(this.add_type,(0,u.FK)(j),(0,u.FK)(V))}else this.add_edge_start=j,this.update_toggle_buttons();else"LibraryNode"===this.add_type?(this.add_position=this.mousepos,this.add_node_to_graph(this.add_type+"|"+this.add_mode_lib,(0,u.FK)(j))):(this.add_position=this.mousepos,this.add_node_to_graph(this.add_type,(0,u.FK)(j)));e.ctrlKey||"Edge"===this.add_type&&this.add_edge_start||this.panmode_btn.onclick()}j?e.ctrlKey?(this.selected_elements.includes(j)?(j.selected=!1,this.selected_elements=this.selected_elements.filter((function(e){return e!==j}))):this.selected_elements.push(j),s=!0):e.shiftKey||(this.selected_elements.length>1&&(s=!0),this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=[j]):(this.selected_elements.length>1&&(s=!0),this.selected_elements.forEach((function(e){e.selected=!1})),this.selected_elements=[]),a=!0,o=!0}if(this.selected_elements.forEach((function(e){e.selected=!0})),"contextmenu"===i)if("move"==this.mouse_mode){var J=[j];this.selected_elements.includes(j)&&(J=this.selected_elements);var Y,X=!1,Q=!1,K=T(J);try{for(K.s();!(Y=K.n()).done;){var ee=Y.value,te=(0,u.Wp)(ee);if(ee&&!(ee instanceof p.wR)&&te){if(ee instanceof p.kS){if(!te.points)continue;for(var re=new Array(ee.points.length),ne=1;ne<ee.points.length-1;ne++)re[ne]={dx:-te.points[ne].dx,dy:-te.points[ne].dy},te.points[ne].dx=0,te.points[ne].dy=0;this.canvas_manager.translate_element(ee,{x:0,y:0},{x:0,y:0},this.graph,this.sdfg_list,this.state_parent_list,void 0,!1,!1,re),X=!0}else{var ie=void 0,ae=void 0;if(!te.dx&&!te.dy)continue;ie=ee.x-te.dx,ae=ee.y-te.dy,te.dx=0,te.dy=0,this.canvas_manager.translate_element(ee,{x:ee.x,y:ee.y},{x:ie,y:ae},this.graph,this.sdfg_list,this.state_parent_list,void 0,!1,!1,void 0),X=!0}ee instanceof EntryNode&&(te.scope_dx=0,te.scope_dy=0,ee.data.node.attributes.is_collapsed||(Q=!0))}}}catch(e){K.e(e)}finally{K.f()}Q&&this.relayout(),this.draw_async(),X&&this.send_new_sdfg_to_vscode()}else"add"==this.mouse_mode&&this.panmode_btn.onclick();var oe=t(e),se=r(e);if(this.external_mouse_handler&&(a|=this.external_mouse_handler(i,e,{x:oe,y:se},z,this,this.selected_elements,F)),null!==this.overlay_manager&&(a|=this.overlay_manager.on_mouse_event(i,e,{x:oe,y:se},z,j,F)),a&&this.draw_async(),o)try{vscode&&vscode_handle_event("on_renderer_selection_changed",{multi_selection_changed:s})}catch(e){}return!1}}]),e}();function z(e,t,r,n,i){var a=4*LINEHEIGHT,l=new(o().graphlib.Graph);l.setGraph({}),l.setDefaultEdgeLabel((function(e,t){return{}})),t.nodes.forEach((function(f){var h={};h.label=f.id;var v=null;f.attributes.is_collapsed?(h.width=e.measureText(h.label).width,h.height=LINEHEIGHT):(v=function(e,t,r,n,i,a){var l=new(o().graphlib.Graph)({multigraph:!0}),f={ranksep:30};t.nodes.length>=1e3&&(f.ranker="longest-path"),l.setGraph(f),l.setDefaultEdgeLabel((function(e,t){return{}}));var h=t.scope_dict[-1];void 0===h&&(h=Object.keys(t.nodes));var v=new Set,y=new Map;function g(o){if(a&&"AccessNode"==o.type)y.set(o.id.toString(),{node:o,src:null,dsts:[]});else{var s=null;o.attributes.layout={},o.attributes.layout.in_connectors=o.attributes.in_connectors,"is_collapsed"in o.attributes&&o.attributes.is_collapsed&&"NestedSDFG"!==o.type?o.attributes.layout.out_connectors=(0,u.GS)(t.nodes,o).attributes.out_connectors:o.attributes.layout.out_connectors=o.attributes.out_connectors;var c=function(e,t,r){var n=r.measureText(t.label).width,i=2*LINEHEIGHT*Object.keys(t.attributes.layout.in_connectors).length-LINEHEIGHT,a=2*LINEHEIGHT*Object.keys(t.attributes.layout.out_connectors).length-LINEHEIGHT,o=Math.max(n,i,a),s=2*LINEHEIGHT,u={width:o,height:s+=4*LINEHEIGHT};return"AccessNode"===t.type?(u.height-=4*LINEHEIGHT,u.width+=u.height):t.type.endsWith("Entry")||t.type.endsWith("Exit")?(u.width+=2*u.height,u.height/=1.75):"Tasklet"===t.type||"LibraryNode"===t.type?(u.width+=u.height/3*2,u.height/=1.75):"Reduce"===t.type&&(u.height-=4*LINEHEIGHT,u.width*=2,u.height=u.width/3),u}(0,o,e);if(o.attributes.layout.width=c.width,o.attributes.layout.height=c.height,o.attributes.layout.label=o.label,"NestedSDFG"===o.type){var f=d(s=z(e,o.attributes.sdfg,n,i,a));o.attributes.layout.width=f.width+2*LINEHEIGHT,o.attributes.layout.height=f.height+2*LINEHEIGHT}var h=new p.LF[o.type]({node:o,graph:s},o.id,r,t.id);"NestedSDFG"===o.type&&(i[o.attributes.sdfg.sdfg_list_id]=h);var m,x=0,b=T(Array.isArray(o.attributes.layout.in_connectors)?o.attributes.layout.in_connectors:Object.keys(o.attributes.layout.in_connectors));try{for(b.s();!(m=b.n()).done;){var w=m.value,_=new p.wR({name:w},x,r,o.id);h.in_connectors.push(_),x+=1}}catch(e){b.e(e)}finally{b.f()}x=0;var N,E=T(Array.isArray(o.attributes.layout.out_connectors)?o.attributes.layout.out_connectors:Object.keys(o.attributes.layout.out_connectors));try{for(E.s();!(N=E.n()).done;){var M=N.value,S=new p.wR({name:M},x,r,o.id);h.out_connectors.push(S),x+=1}}catch(e){E.e(e)}finally{E.f()}if(l.setNode(o.id,h),v.add(o.id.toString()),o.id in t.scope_dict){if(o.attributes.is_collapsed)return;t.scope_dict[o.id].forEach((function(e){g(t.nodes[e])}))}}}return h.forEach((function(e){g(t.nodes[e])})),t.edges.forEach((function(e,n){if(!function(e){var t=y.get(e.src),r=y.get(e.dst);if(t&&r)t.dsts=r.dsts,e.attributes.data.attributes.shortcut=!1;else{if(t)return t.dsts.push(e),e.attributes.data.attributes.shortcut=!1,!0;if(r)return r.src=e,e.attributes.data.attributes.shortcut=!1,!0}return!(a||!e.attributes.data.attributes.shortcut)}(e)&&(e=(0,u.RI)(e,v,t))){var i=new p.kS(e.attributes.data,n,r,t.id);e.attributes.data.edge=i,i.src_connector=e.src_connector,i.dst_connector=e.dst_connector,l.setEdge(e.src,e.dst,i,n)}})),y.forEach((function(e){e.src&&e.dsts.forEach((function(n){var i=n.attributes.data.edge;n.attributes.data.edge=null;var a=(0,c.p$)(n);n.attributes.data.edge=i,a.src=e.src.src,a.src_connector=e.src.src_connector,a.dst_connector=n.dst_connector,a.attributes.data.attributes.shortcut=!0;var o=(0,u.RI)(a,v,t);if(o){var s,f=T(l.outEdges(o.src));try{for(f.s();!(s=f.n()).done;){var d=s.value;if(d.w==n.dst&&t.edges[d.name].dst_connector==n.dst_connector)return}}catch(e){f.e(e)}finally{f.f()}t.edges.push(a);var h=t.edges.length-1,m=new p.kS((0,c.p$)(o.attributes.data),h,r,t.id);m.src_connector=o.src_connector,m.dst_connector=o.dst_connector,m.data.attributes.shortcut=!0,l.setEdge(o.src,o.dst,m,h)}}))})),o().layout(l),t.nodes.forEach((function(e,t){var r=l.node(t);if(r&&!(a&&r instanceof AccessNode)){var n=r.topleft();"NestedSDFG"===e.type&&(0,p.LC)(e.attributes.sdfg,r.data.graph,{x:n.x+LINEHEIGHT,y:n.y+LINEHEIGHT});var i,o=LINEHEIGHT,s=(LINEHEIGHT+o)*Object.keys(e.attributes.layout.in_connectors).length-o,u=(LINEHEIGHT+o)*Object.keys(e.attributes.layout.out_connectors).length-o,c=r.x-s/2+LINEHEIGHT/2,f=r.x-u/2+LINEHEIGHT/2,d=T(r.in_connectors);try{for(d.s();!(i=d.n()).done;){var h=i.value;h.width=LINEHEIGHT,h.height=LINEHEIGHT,h.x=c,c+=LINEHEIGHT+o,h.y=n.y}}catch(e){d.e(e)}finally{d.f()}var m,v=T(r.out_connectors);try{for(v.s();!(m=v.n()).done;){var y=m.value;y.width=LINEHEIGHT,y.height=LINEHEIGHT,y.x=f,f+=LINEHEIGHT+o,y.y=n.y+r.height}}catch(e){v.e(e)}finally{v.f()}}})),t.edges.forEach((function(e,r){if(e=(0,u.RI)(e,v,t)){var n=l.edge(e.src,e.dst,r);if(!(!n||a&&!1===n.data.attributes.shortcut||!a&&n.data.attributes.shortcut)){var i=null,o=null;if(e.src_connector){for(var c=l.node(e.src),f=-1,p=0;p<c.out_connectors.length;p++)if(c.out_connectors[p].data.name==e.src_connector){f=p;break}f>=0&&(n.points[0].x=c.out_connectors[f].x,n.points[0].y=c.out_connectors[f].y,i=c.out_connectors[f])}if(e.dst_connector){for(var d=l.node(e.dst),h=-1,y=0;y<d.in_connectors.length;y++)if(d.in_connectors[y].data.name==e.dst_connector){h=y;break}h>=0&&(n.points[n.points.length-1].x=d.in_connectors[h].x,n.points[n.points.length-1].y=d.in_connectors[h].y,o=d.in_connectors[h])}var g=n.points.length-1;null!==i&&(n.points[0]=(0,s.intersectRect)(i,n.points[g])),null!==o&&(n.points[g]=(0,s.intersectRect)(o,n.points[0])),3==n.points.length&&n.points[0].x==n.points[g].x&&(n.points=[n.points[0],n.points[g]]);var x=m(n);x.x+=x.width/2,x.y+=x.height/2,e.width=x.width,e.height=x.height,e.x=x.x,e.y=x.y,n.width=x.width,n.height=x.height,n.x=x.x,n.y=x.y}}})),l}(e,f,t,r,n,i),h=d(v)),h.width+=2*a,h.height+=2*a,l.setNode(f.id,new State({state:f,layout:h,graph:v},f.id,t))})),t.edges.forEach((function(e,r){l.setEdge(e.src,e.dst,new p.kS(e.attributes.data,r,t))})),o().layout(l),t.nodes.forEach((function(e){var t=l.node(e.id);e.attributes.layout={},e.attributes.layout.x=t.x,e.attributes.layout.y=t.y,e.attributes.layout.width=t.width,e.attributes.layout.height=t.height})),t.edges.forEach((function(e){var t=l.edge(e.src,e.dst),r=m(t);r.x+=r.width/2,r.y+=r.height/2,t.x=r.x,t.y=r.y,t.width=r.width,t.height=r.height,e.attributes.layout={},e.attributes.layout.width=r.width,e.attributes.layout.height=r.height,e.attributes.layout.x=r.x,e.attributes.layout.y=r.y,e.attributes.layout.points=t.points})),t.nodes.forEach((function(e,t){if(!e.attributes.is_collapsed){var r=l.node(t),n=r.topleft();(0,p.hY)(e,r,{x:n.x+a,y:n.y+a})}}));var f=d(l);return l.width=f.width,l.height=f.height,r[t.sdfg_list_id]=l,l}},5994:(e,t,r)=>{"use strict";r.d(t,{ZM:()=>h,zO:()=>m,kS:()=>v,wR:()=>y,u7:()=>N,gE:()=>T,tl:()=>C,LC:()=>I,hY:()=>D,jD:()=>P,LF:()=>L});var n=r(6213),i=r(379),a=r(6070),o=r(7608),s=r(6610),u=r(5991),c=r(9590),l=r(6310);function f(e){var t=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(e){return!1}}();return function(){var r,n=(0,o.Z)(e);if(t){var i=(0,o.Z)(this).constructor;r=Reflect.construct(n,arguments,i)}else r=n.apply(this,arguments);return(0,a.Z)(this,r)}}var p=function(){function e(t,r,n){var i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null;(0,s.Z)(this,e),this.data=t,this.id=r,this.parent_id=i,this.sdfg=n,this.in_connectors=[],this.out_connectors=[],this.selected=!1,this.highlighted=!1,this.hovered=!1,this.set_layout()}return(0,u.Z)(e,[{key:"set_layout",value:function(){this.width=this.data.layout.width,this.height=this.data.layout.height}},{key:"draw",value:function(e,t,r){}},{key:"shade",value:function(e,t,r){}},{key:"debug_draw",value:function(e,t){e.debug_draw&&(t.beginPath(),t.arc(this.x,this.y,1,0,2*Math.PI,!1),t.fillStyle="red",t.fill(),t.strokeStyle="red",t.stroke(),t.strokeRect(this.x-this.width/2,this.y-this.height/2,this.width,this.height))}},{key:"attributes",value:function(){return this.data.attributes}},{key:"type",value:function(){return this.data.type}},{key:"label",value:function(){return this.data.label}},{key:"long_label",value:function(){return this.label()}},{key:"tooltip",value:function(e){e.className="sdfvtooltip"}},{key:"topleft",value:function(){return{x:this.x-this.width/2,y:this.y-this.height/2}}},{key:"strokeStyle",value:function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:void 0;return this.selected?this.hovered?this.getCssProperty(e,"--color-selected-hovered"):this.highlighted?this.getCssProperty(e,"--color-selected-highlighted"):this.getCssProperty(e,"--color-selected"):this.hovered?this.getCssProperty(e,"--color-hovered"):this.highlighted?this.getCssProperty(e,"--color-highlighted"):this.getCssProperty(e,"--color-default")}},{key:"intersect",value:function(e,t){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0,n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;return 0==r||0==n?e>=this.x-this.width/2&&e<=this.x+this.width/2&&t>=this.y-this.height/2&&t<=this.y+this.height/2:e<=this.x+this.width/2&&e+r>=this.x-this.width/2&&t<=this.y+this.height/2&&t+n>=this.y-this.height/2}},{key:"contained_in",value:function(e,t){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0,n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;if(0===r||0===n)return!1;var i=e,a=e+r,o=t,s=t+n,u=this.x-this.width/2,c=this.x+this.width/2,l=this.y-this.height/2,f=this.y+this.height/2;return i<=u&&a>=c&&o<=l&&s>=f}},{key:"getCssProperty",value:function(e,t){return window.getComputedStyle(e.canvas).getPropertyValue(t).trim()}}]),e}(),d=function(e){(0,i.Z)(r,e);var t=f(r);function r(e){return(0,s.Z)(this,r),t.call(this,e,-1,e)}return(0,u.Z)(r,[{key:"set_layout",value:function(){}},{key:"label",value:function(){return this.data.attributes.name}}]),r}(p),h=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,r){var n=this.topleft(),i=e.visible_rect,a={x:Math.max(n.x,i.x),y:Math.max(n.y,i.y),x2:Math.min(n.x+this.width,i.x+i.w),y2:Math.min(n.y+this.height,i.y+i.h)};a.w=a.x2-a.x,a.h=a.y2-a.y,t.lod||(a={x:n.x,y:n.y,w:this.width,h:this.height}),t.fillStyle=this.getCssProperty(e,"--state-background-color"),t.fillRect(a.x,a.y,a.w,a.h),t.fillStyle=this.getCssProperty(e,"--state-foreground-color"),i.x<=n.x&&i.y<=n.y+LINEHEIGHT&&t.fillText(this.label(),n.x,n.y+LINEHEIGHT),!(this.selected||this.highlighted||this.hovered)||a.x!==n.x&&a.y!==n.y&&a.x2!==n.x+this.width&&a.y2!==n.y+this.height||(t.strokeStyle=this.strokeStyle(e),t.strokeRect(a.x,a.y,a.w,a.h)),this.data.state.attributes.is_collapsed&&(t.beginPath(),t.moveTo(this.x,this.y-LINEHEIGHT),t.lineTo(this.x,this.y+LINEHEIGHT),t.stroke(),t.beginPath(),t.moveTo(this.x-LINEHEIGHT,this.y),t.lineTo(this.x+LINEHEIGHT,this.y),t.stroke()),t.strokeStyle="black"}},{key:"simple_draw",value:function(e,t,r){var n=this,i=this.topleft();t.fillStyle=this.getCssProperty(e,"--state-background-color"),t.fillRect(i.x,i.y,this.width,this.height),t.fillStyle=this.getCssProperty(e,"--state-text-color"),r&&this.intersect(r.x,r.y)&&(e.tooltip=function(e){return n.tooltip(e)})}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=n,t.fillStyle=r;var o=this.topleft();t.fillRect(o.x,o.y,this.width,this.height),t.fillStyle=i,t.globalAlpha=a}},{key:"tooltip",value:function(e){e.innerText="State: "+this.label()}},{key:"attributes",value:function(){return this.data.state.attributes}},{key:"label",value:function(){return this.data.state.label}},{key:"type",value:function(){return this.data.state.type}}]),r}(p),m=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"--node-foreground-color",i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:"--node-background-color",a=this.topleft();t.fillStyle=this.getCssProperty(e,i),t.fillRect(a.x,a.y,this.width,this.height),t.strokeStyle=this.strokeStyle(e),t.strokeRect(a.x,a.y,this.width,this.height),t.fillStyle=this.getCssProperty(e,n);var o=t.measureText(this.label()).width;t.fillText(this.label(),this.x-o/2,this.y+LINEHEIGHT/4)}},{key:"simple_draw",value:function(e,t,r){var n=this.topleft();t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.fillRect(n.x,n.y,this.width,this.height),t.fillStyle=this.getCssProperty(e,"--node-foreground-color")}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=n,t.fillStyle=r;var o=this.topleft();t.fillRect(o.x,o.y,this.width,this.height),t.fillStyle=i,t.globalAlpha=a}},{key:"label",value:function(){return this.data.node.label}},{key:"attributes",value:function(){return this.data.node.attributes}},{key:"type",value:function(){return this.data.node.type}},{key:"set_layout",value:function(){this.width=this.data.node.attributes.layout.width,this.height=this.data.node.attributes.layout.height}}]),r}(p),v=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"create_arrow_line",value:function(e){if(e.beginPath(),e.moveTo(this.points[0].x,this.points[0].y),2===this.points.length)e.lineTo(this.points[1].x,this.points[1].y);else{var t;for(t=1;t<this.points.length-2;t++){var r=(this.points[t].x+this.points[t+1].x)/2,n=(this.points[t].y+this.points[t+1].y)/2;e.quadraticCurveTo(this.points[t].x,this.points[t].y,r,n)}e.quadraticCurveTo(this.points[t].x,this.points[t].y,this.points[t+1].x,this.points[t+1].y)}}},{key:"draw",value:function(e,t,r){var n=this,i=this;this.create_arrow_line(t);var a=this.strokeStyle(e);if(this.hovered&&(e.tooltip=function(t){return n.tooltip(t,e)}),null==this.parent_id&&a===this.getCssProperty(e,"--color-default")&&(a=this.getCssProperty(e,"--interstate-edge-color")),t.fillStyle=t.strokeStyle=a,null!=this.parent_id&&null!=this.data.attributes.wcr?t.setLineDash([2,2]):t.setLineDash([1,0]),t.stroke(),t.setLineDash([1,0]),!(i.points.length<2)){var o;if(this.selected&&"move"===e.mouse_mode)for(o=1;o<this.points.length-1;o++)t.strokeRect(this.points[o].x-5,this.points[o].y-5,8,8);R(t,i.points[i.points.length-2],i.points[i.points.length-1],3)}}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6";this.create_arrow_line(t);var i=t.strokeStyle,a=t.fillStyle,o=t.lineCap,s=t.lineWidth,u=t.globalAlpha;t.globalAlpha=n,t.lineWidth=s+1,t.fillStyle=r,t.strokeStyle=r,t.lineCap="round",t.stroke(),this.points.length<2||(R(t,this.points[this.points.length-2],this.points[this.points.length-1],3,0,2),t.strokeStyle=i,t.fillStyle=a,t.lineCap=o,t.lineWidth=s,t.globalAlpha=u)}},{key:"tooltip",value:function(e,t){(0,n.Z)((0,o.Z)(r.prototype),"tooltip",this).call(this,e);var i=t.view_settings(),a=this.attributes();if(void 0!==a.subset){if(null===a.subset)return void(e.style.display="none");var s=a.data;s+=(0,c.Ev)(a.subset,i),a.other_subset&&(s+=" -> "+(0,c.Ev)(a.other_subset,i)),a.wcr&&(s+="<br /><b>CR: "+(0,c.Ev)(a.wcr,i)+"</b>");var u=null;u=a.volume?(0,c.Ev)(a.volume,i):(0,c.Ev)(a.num_accesses,i),a.dynamic?u=0==u||-1==u?"<b>Dynamic (unbounded)</b>":"<b>Dynamic</b> (up to "+u+")":-1==u&&(u="<b>Dynamic (unbounded)</b>"),s+='<br /><font style="font-size: 14px">Volume: '+u+"</font>",e.innerHTML=s}else e.classList.add("sdfvtooltip--interstate-edge"),e.innerText=this.label(),this.label()||(e.style.display="none")}},{key:"set_layout",value:function(){}},{key:"label",value:function(){return void 0!==this.data.attributes.subset?"":(0,n.Z)((0,o.Z)(r.prototype),"label",this).call(this)}},{key:"intersect",value:function(e,t){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0,a=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;if(!(0,n.Z)((0,o.Z)(r.prototype),"intersect",this).call(this,e,t,i,a))return!1;if(0==i||0==a){for(var s=0;s<this.points.length-1;s++){var u=F({x:e,y:t},this.points[s],this.points[s+1]);if(u<=5)return!0}return!1}return!0}}]),r}(p),y=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,r){var n,i=this,a=this.data.name.startsWith("IN_")||this.data.name.startsWith("OUT_"),o=this.topleft();if(t.beginPath(),U(t,o.x,o.y,this.width,this.height),t.closePath(),t.strokeStyle=this.strokeStyle(e),a){var s=this.data.name;s=s.startsWith("IN_")?s.substring(3):s.substring(4),t.lineWidth=.4,t.stroke(),t.lineWidth=1,n=this.getCssProperty(e,"--connector-scoped-color")}else t.stroke(),n=this.getCssProperty(e,"--connector-unscoped-color");t.pdf&&(n=n.substr(0,7)),t.fillStyle=n,t.pdf&&(t.beginPath(),U(t,o.x,o.y,this.width,this.height),t.closePath()),t.fill(),this.strokeStyle(e)!==this.getCssProperty(e,"--color-default")&&(e.tooltip=function(e){return i.tooltip(e)})}},{key:"attributes",value:function(){return{}}},{key:"set_layout",value:function(){}},{key:"label",value:function(){return this.data.name}},{key:"tooltip",value:function(e){(0,n.Z)((0,o.Z)(r.prototype),"tooltip",this).call(this,e),e.classList.add("sdfvtooltip--connector"),e.innerText=this.label()}}]),r}(p),g=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,r){var n=this.topleft();t.beginPath(),U(t,n.x,n.y,this.width,this.height),t.closePath(),t.strokeStyle=this.strokeStyle(e);var i=this.sdfg.attributes._arrays[this.data.node.attributes.data];i&&"Stream"===i.type?t.setLineDash([5,3]):t.setLineDash([1,0]),i&&!1===i.attributes.transient?t.lineWidth=3:t.lineWidth=1,t.stroke(),t.lineWidth=1,t.setLineDash([1,0]),i&&"View"===i.type?t.fillStyle=this.getCssProperty(e,"--connector-unscoped-color"):t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&(t.beginPath(),U(t,n.x,n.y,this.width,this.height),t.closePath()),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var a=t.measureText(this.label());t.fillText(this.label(),this.x-a.width/2,this.y+LINEHEIGHT/4)}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=n,t.fillStyle=r;var o=this.topleft();t.beginPath(),U(t,o.x,o.y,this.width,this.height),t.closePath(),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),r}(m),x=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,r){var n,i=this;n=this.data.node.attributes.is_collapsed?function(){return B(t,i.x,i.y,i.width,i.height)}:function(){return q(t,i.topleft(),i,i.scopeend())},t.strokeStyle=this.strokeStyle(e),this.data.node.type.startsWith("Consume")?t.setLineDash([5,3]):t.setLineDash([1,0]),n(),t.stroke(),t.setLineDash([1,0]),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&n(),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var a=this.far_label();z(t,e,a,this.close_label(e),this.x,this.y,this.width,this.height,SCOPE_LOD)}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=n,t.fillStyle=r,this.data.node.attributes.is_collapsed?B(t,this.x,this.y,this.width,this.height):q(t,this.topleft(),this,this.scopeend()),t.fill(),t.fillStyle=i,t.globalAlpha=a}},{key:"far_label",value:function(){var e=this.attributes().label;if(this.scopeend()){var t=this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];if(void 0!==t)e=t.attributes.label;else{var r=(e=this.data.node.label).indexOf("[");r>0&&(e=e.substring(0,r))}}return e}},{key:"close_label",value:function(e){if(!e.inclusive_ranges)return this.label();var t=this.far_label(),r=this.attributes();if(this.scopeend()){var n=this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];if(void 0===n)return this.label();r=n.attributes}if(t+=" [",this instanceof E||this instanceof M)t+=r.pe_index+"=0.."+(r.num_pes-1).toString();else{for(var i=0;i<r.params.length;++i)t+=r.params[i]+"=",t+=(0,c.Pn)(r.range.ranges[i],e.view_settings())+", ";t=t.substring(0,t.length-2)}return t+"]"}}]),r}(m),b=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"scopeend",value:function(){return!1}}]),r}(x),w=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"scopeend",value:function(){return!0}}]),r}(x),_=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"stroketype",value:function(e){e.setLineDash([1,0])}}]),r}(b),N=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"stroketype",value:function(e){e.setLineDash([1,0])}}]),r}(w),E=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"stroketype",value:function(e){e.setLineDash([5,3])}}]),r}(b),M=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"stroketype",value:function(e){e.setLineDash([5,3])}}]),r}(w),S=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"stroketype",value:function(e){e.setLineDash([10,3])}}]),r}(b),A=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"stroketype",value:function(e){e.setLineDash([10,3])}}]),r}(w),O=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,r){var n=this.topleft();j(t,n,this.width,this.height),t.strokeStyle=this.strokeStyle(e),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&j(t,n,this.width,this.height),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var i=e.canvas_manager.points_per_pixel();if(!t.lod||i<TASKLET_LOD){for(var a=this.attributes().code.string_data.split("\n"),o=0,s=0,u=0;u<a.length;u++)a[u].length>s&&(o=u,s=a[u].length);var c=t.font;t.font="10px courier new";var l=t.measureText(a[o]),f=a.length*LINEHEIGHT*1.05,p=l.width,d=f/(.5*this.height),h=p/(.9*this.width),m=Math.min(10/d,10/h),v=m/4;t.font=m+"px courier new";for(var y=this.y+v-(a.length-1)/2*m*1.05,g=0;g<a.length;g++)t.fillText(a[g],this.x-.9*this.width/2,y+g*m*1.05);t.font=c}else{var x=t.measureText(this.label());t.fillText(this.label(),this.x-x.width/2,this.y+LINEHEIGHT/2)}}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=n,t.fillStyle=r,j(t,this.topleft(),this.width,this.height),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),r}(m),k=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,r){var n=this,i=this.topleft(),a=function(){t.beginPath(),t.moveTo(i.x,i.y),t.lineTo(i.x+n.width/2,i.y+n.height),t.lineTo(i.x+n.width,i.y),t.lineTo(i.x,i.y),t.closePath()};t.strokeStyle=this.strokeStyle(e),a(),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&a(),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var o=this.label().substring(4,this.label().indexOf(","));z(t,e,o,this.label(),this.x,this.y-.2*this.height,this.width,this.height,SCOPE_LOD)}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=n,t.fillStyle=r;var o=this.topleft();t.beginPath(),t.moveTo(o.x,o.y),t.lineTo(o.x+this.width/2,o.y+this.height),t.lineTo(o.x+this.width,o.y),t.lineTo(o.x,o.y),t.closePath(),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),r}(m),T=function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"draw",value:function(e,t,i){if(this.data.node.attributes.is_collapsed){var a=this.topleft();j(t,a,this.width,this.height),t.strokeStyle=this.strokeStyle(e),t.stroke(),j(t,{x:a.x+2.5,y:a.y+2.5},this.width-5,this.height-5),t.strokeStyle=this.strokeStyle(e),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-background-color"),t.pdf&&j(t,{x:a.x+2.5,y:a.y+2.5},this.width-5,this.height-5),t.fill(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var s=this.data.node.attributes.label,u=t.measureText(s);t.fillText(s,this.x-u.width/2,this.y+LINEHEIGHT/4)}else(0,n.Z)((0,o.Z)(r.prototype),"draw",this).call(this,e,t,i,"--nested-sdfg-foreground-color","--nested-sdfg-background-color"),C(e,t,this.data.graph,i)}},{key:"shade",value:function(e,t,i){var a=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6";if(this.data.node.attributes.is_collapsed){var s=t.fillStyle,u=t.globalAlpha;t.globalAlpha=a,t.fillStyle=i,j(t,this.topleft(),this.width,this.height),t.fill(),t.fillStyle=s,t.globalAlpha=u}else(0,n.Z)((0,o.Z)(r.prototype),"shade",this).call(this,e,t,i,a)}},{key:"set_layout",value:function(){if(this.data.node.attributes.is_collapsed){var e=this.data.node.attributes.label.length*LINEHEIGHT*.8,t=2*LINEHEIGHT*Object.keys(this.data.node.attributes.in_connectors).length-LINEHEIGHT,r=2*LINEHEIGHT*Object.keys(this.data.node.attributes.out_connectors).length-LINEHEIGHT,n=Math.max(e,t,r),i=2*LINEHEIGHT,a={width:n,height:i+=4*LINEHEIGHT};a.width+=a.height/3*2,a.height/=1.75,this.width=a.width,this.height=a.height}else this.width=this.data.node.attributes.layout.width,this.height=this.data.node.attributes.layout.height}},{key:"label",value:function(){return""}}]),r}(m);function C(e,t,r,n){var i=e.canvas_manager.points_per_pixel(),a=r;(!t.lod||i<EDGE_LOD)&&a.edges().forEach((function(r){var i=a.edge(r);i.draw(e,t,n),i.debug_draw(e,t)}));var o=e.visible_rect;a.nodes().forEach((function(r){var s=a.node(r);if(t.lod&&(i>=STATE_LOD||s.width/i<STATE_LOD))return s.simple_draw(e,t,n),void s.debug_draw(e,t);if(!t.lod||s.intersect(o.x,o.y,o.w,o.h)){s.draw(e,t,n),s.debug_draw(e,t);var u=s.data.graph;if(!s.data.state.attributes.is_collapsed&&u){if(u.nodes().forEach((function(r){var a=u.node(r);if(!t.lod||a.intersect(o.x,o.y,o.w,o.h)){if(t.lod&&i>=NODE_LOD)return a.simple_draw(e,t,n),void a.debug_draw(e,t);a.draw(e,t,n),a.debug_draw(e,t),a.in_connectors.forEach((function(r){r.draw(e,t,n),r.debug_draw(e,t)})),a.out_connectors.forEach((function(r){r.draw(e,t,n),r.debug_draw(e,t)}))}})),t.lod&&i>=EDGE_LOD)return;u.edges().forEach((function(r){var i=u.edge(r);t.lod&&!i.intersect(o.x,o.y,o.w,o.h)||(i.draw(e,t,n),i.debug_draw(e,t))}))}}}))}function I(e,t,r){e.nodes.forEach((function(e,n){var i=t.node(n);i.x+=r.x,i.y+=r.y,e.attributes.is_collapsed||D(e,i,r)})),e.edges.forEach((function(e,n){var i=t.edge(e.src,e.dst);i.x+=r.x,i.y+=r.y,i.points.forEach((function(e){e.x+=r.x,e.y+=r.y}))}))}function D(e,t,r){var n=new Set;e.nodes.forEach((function(e,i){var a=t.data.graph.node(i);a&&(n.add(i.toString()),a.x+=r.x,a.y+=r.y,a.in_connectors.forEach((function(e){e.x+=r.x,e.y+=r.y})),a.out_connectors.forEach((function(e){e.x+=r.x,e.y+=r.y})),"NestedSDFG"===a.data.node.type&&I(a.data.node.attributes.sdfg,a.data.graph,r))})),e.edges.forEach((function(i,a){if(i=(0,l.RI)(i,n,e)){var o=t.data.graph.edge(i.src,i.dst,a);o&&(o.x+=r.x,o.y+=r.y,o.points.forEach((function(e){e.x+=r.x,e.y+=r.y})))}}))}function z(e,t,r,n,i,a,o,s,u){var c=arguments.length>9&&void 0!==arguments[9]?arguments[9]:50,l=arguments.length>10&&void 0!==arguments[10]?arguments[10]:16,f=t.canvas_manager.points_per_pixel(),p=n,d=Math.min(f*l,c),h=LINEHEIGHT/2,m=e.font;e.lod&&f>=u&&(e.font=d+"px sans-serif",p=r,h=d/2-s/6);var v=e.measureText(p),y=v.width;e.lod&&f>=u&&y>o&&(d/=y/o,e.font=d+"px sans-serif",h=d/2-s/6,y=o),e.fillText(p,i-y/2,a+h),e.lod&&f>=u&&(e.font=m)}function B(e,t,r,n,i,a){var o={x:t-n/2,y:r-i/2},s=i/3;e.beginPath(),e.moveTo(o.x,r),e.lineTo(o.x+s,o.y),e.lineTo(o.x+n-s,o.y),e.lineTo(o.x+n,r),e.lineTo(o.x+n-s,o.y+i),e.lineTo(o.x+s,o.y+i),e.lineTo(o.x,r),e.closePath()}function j(e,t,r,n){var i=n/3;e.beginPath(),e.moveTo(t.x,t.y+i),e.lineTo(t.x+i,t.y),e.lineTo(t.x+r-i,t.y),e.lineTo(t.x+r,t.y+i),e.lineTo(t.x+r,t.y+2*i),e.lineTo(t.x+r-i,t.y+n),e.lineTo(t.x+i,t.y+n),e.lineTo(t.x,t.y+2*i),e.lineTo(t.x,t.y+1*i),e.closePath()}function U(e,t,r,n,i){var a=.5522848,o=n/2*a,s=i/2*a,u=t+n,c=r+i,l=t+n/2,f=r+i/2;e.moveTo(t,f),e.bezierCurveTo(t,f-s,l-o,r,l,r),e.bezierCurveTo(l+o,r,u,f-s,u,f),e.bezierCurveTo(u,f+s,l+o,c,l,c),e.bezierCurveTo(l-o,c,t,f+s,t,f)}function R(e,t,r,n){var i=arguments.length>4&&void 0!==arguments[4]?arguments[4]:0,a=arguments.length>5&&void 0!==arguments[5]?arguments[5]:0;e.save();var o=r.x-t.x,s=r.y-t.y;e.translate(r.x,r.y),e.rotate(Math.atan2(s,o)),e.beginPath(),e.moveTo(0+a+i,0),e.lineTo(-2*n-a-i,-(n+a)),e.lineTo(-2*n-a-i,n+a),e.closePath(),e.fill(),e.restore()}function q(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]&&arguments[3];e.beginPath(),n?(e.moveTo(t.x,t.y),e.lineTo(t.x+r.width,t.y),e.lineTo(t.x+r.width-r.height,t.y+r.height),e.lineTo(t.x+r.height,t.y+r.height),e.lineTo(t.x,t.y)):(e.moveTo(t.x,t.y+r.height),e.lineTo(t.x+r.width,t.y+r.height),e.lineTo(t.x+r.width-r.height,t.y),e.lineTo(t.x+r.height,t.y),e.lineTo(t.x,t.y+r.height)),e.closePath()}function F(e,t,r){var n=r.x-t.x,i=r.y-t.y,a=i*e.x-n*e.y+r.x*t.y-r.y*t.x;return Math.abs(a)/Math.sqrt(i*i+n*n)}function P(e){return e<0&&(e=0),e>1&&(e=1),"hsl("+(120*(1-e)).toString(10)+",100%,50%)"}var L={SDFGElement:p,SDFG:d,State:h,SDFGNode:m,Edge:v,Connector:y,AccessNode:g,ScopeNode:x,EntryNode:b,ExitNode:w,MapEntry:_,MapExit:N,ConsumeEntry:E,ConsumeExit:M,Tasklet:O,Reduce:k,PipelineEntry:S,PipelineExit:A,NestedSDFG:T,LibraryNode:function(e){(0,i.Z)(r,e);var t=f(r);function r(){return(0,s.Z)(this,r),t.apply(this,arguments)}return(0,u.Z)(r,[{key:"_path",value:function(e){var t=this.height/6,r=this.topleft();e.beginPath(),e.moveTo(r.x,r.y),e.lineTo(r.x+this.width-t,r.y),e.lineTo(r.x+this.width,r.y+t),e.lineTo(r.x+this.width,r.y+this.height),e.lineTo(r.x,r.y+this.height),e.closePath()}},{key:"_path2",value:function(e){var t=this.height/6,r=this.topleft();e.beginPath(),e.moveTo(r.x+this.width-t,r.y),e.lineTo(r.x+this.width-t,r.y+t),e.lineTo(r.x+this.width,r.y+t)}},{key:"draw",value:function(e,t,r){t.fillStyle=this.getCssProperty(e,"--node-background-color"),this._path(t),t.fill(),t.strokeStyle=this.strokeStyle(e),this._path(t),t.stroke(),this._path2(t),t.stroke(),t.fillStyle=this.getCssProperty(e,"--node-foreground-color");var n=t.measureText(this.label()).width;t.fillText(this.label(),this.x-n/2,this.y+LINEHEIGHT/4)}},{key:"shade",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:"0.6",i=t.fillStyle,a=t.globalAlpha;t.globalAlpha=n,t.fillStyle=r,this._path(t),t.fill(),t.fillStyle=i,t.globalAlpha=a}}]),r}(m)};Object.assign(globalThis,L)},6323:(e,t,r)=>{"use strict";r.d(t,{e:()=>V,l:()=>C});var n,i,a=r(2465),o=r(9018),s=r(1538),u=r(8560),c=r(3216),l=r(9590),f=r(4194),p=r(1762);function d(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 h={on_init_menu:function(){var e=document.getElementById("sidebar"),t=document.getElementById("dragbar"),r=function(t){document.selection?document.selection.empty():window.getSelection().removeAllRanges(),e.style.width=Math.max(t.view.innerWidth-t.pageX,20)+"px"};t.addEventListener("mousedown",(function(){document.addEventListener("mousemove",r),document.addEventListener("mouseup",(function(){document.removeEventListener("mousemove",r)}))}))},on_sidebar_set_title:m,on_sidebar_show:y,sidebar_get_contents:v,on_close_menu:function(){document.getElementById("sidebar").style.display="none"},on_outline:function(e,t){m("SDFG Outline");var r=v();r.innerHTML="";var o=document.createElement("div");o.className="context_menu_option",o.innerHTML=(0,p.v)(n||(n=(0,a.Z)(['<i class="material-icons" style="font-size: inherit">filter_center_focus</i> SDFG ',""])),e.sdfg.attributes.name),o.onclick=function(){return e.zoom_to_view()},r.appendChild(o);var s=[r];(0,f.LY)(t,(function(t,r){if(t.type().endsWith("Exit")&&t.data.node.scope_entry>=0)return s.push(null),!0;var n=document.createElement("div");n.className="context_menu_option";var o=t.attributes().is_collapsed;o=void 0!==o&&o;var u=t.type();return t.type().endsWith("Entry")&&void 0!==t.sdfg.nodes[t.parent_id].scope_dict[t.id]&&(u=u.slice(0,-5)),n.innerHTML=(0,p.v)(i||(i=(0,a.Z)([""," ","",""])),u,t.label(),o?" (collapsed)":""),n.onclick=function(n){var i=[t];if(t.type().endsWith("Entry")){var a=t.sdfg.nodes[t.parent_id];if(void 0!==a.scope_dict[t.id]){var o,s=function(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return d(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)?d(e,t):void 0}}(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=e[Symbol.iterator]()},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}}}}(a.scope_dict[t.id]);try{for(s.s();!(o=s.n()).done;){var u=o.value;i.push(r.node(u))}}catch(e){s.e(e)}finally{s.f()}}}e.zoom_to_view(i),n||(n=window.event),n.cancelBubble=!0,n.stopPropagation&&n.stopPropagation()},s.push(n),!o&&void 0}),(function(e,t){var r=s.pop();r&&s[s.length-1].appendChild(r)})),y()},on_fill_info:function(e){var t=v(),r="";if(e instanceof Edge&&"Memlet"===e.data.type){var n=e.sdfg.nodes[e.parent_id].edges[e.id];r+="<h4>Connectors: "+n.src_connector+" &rarr; "+n.dst_connector+"</h4>"}r+="<hr />";for(var i=0,a=Object.entries(e.attributes());i<a.length;i++){var o=a[i];"layout"===o[0]||"sdfg"===o[0]||"_arrays"===o[0]||o[0].startsWith("_meta_")||"position"==o[0]||(r+="<b>"+o[0]+"</b>:&nbsp;&nbsp;",r+=(0,l.Ev)(o[1],C.daceRenderer.view_settings())+"</p>")}if(e instanceof AccessNode){var s=e.sdfg.attributes._arrays[e.attributes().data];r+="<br /><h4>"+s.type+" properties:</h4>";for(var u=0,c=Object.entries(s.attributes);u<c.length;u++){var f=c[u];"layout"===f[0]||"sdfg"===f[0]||f[0].startsWith("_meta_")||(r+="<b>"+f[0]+"</b>:&nbsp;&nbsp;",r+=(0,l.Ev)(f[1],C.daceRenderer.view_settings())+"</p>")}}t.innerHTML=r}};function m(e){document.getElementById("sidebar-header").innerText=e}function v(){return document.getElementById("sidebar-contents")}function y(){document.getElementById("sidebar").style.display="flex"}var g,x=r(5994),b=r(5096),w=r(6310),_=r(8934),N=r(4707),E=r(1699);function M(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return S(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)?S(e,t):void 0}}(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=e[Symbol.iterator]()},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 S(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 A,O=globalThis.$,k=null,T=null,C=(0,b._W)(globalThis,{daceRenderer:null,daceUIHandlers:h,daceInitSDFV:D,daceParseSDFG:o.a,daceStringifySDFG:o.n,daceFindInGraph:P,daceSDFGPropertyToString:l.Ev,daceSDFGRangeElemToString:l.Pn,daceGetUUIDGraphElement:w.FK,daceFindGraphElementByUUID:w.sC,daceTraverseSDFGScopes:f.LY,daceSDFGTypeclassToString:l.oi,daceStringToSDFGTypeclass:l.K5,daceSDFGRenderer:u.U,daceSDFGElements:x.LF,daceGenericSDFGOverlay:c.F,daceMemoryVolumeOverlay:N.n,daceRuntimeMicroSecondsOverlay:_.P,daceStaticFlopsOverlay:E.C,daceMouseEvent:L});if(document.currentScript.hasAttribute("data-sdfg-json"))D((0,o.a)(document.currentScript.getAttribute("data-sdfg-json")));else{var I=function(e){var t=window.location.href;e=e.replace(/[\[\]]/g,"\\$&");var r=new RegExp("[?&]"+e+"(=([^&#]*)|&|#|$)").exec(t);return r?r[2]?decodeURIComponent(r[2].replace(/\+/g," ")):"":null}("url");I?function(e){var t=new XMLHttpRequest;t.responseType="text",t.onload=function(){if(200==t.status){var e=(0,o.a)(t.response);C.daceRenderer&&C.daceRenderer.destroy(),D(e)}else alert("Failed to load SDFG from URL"),D(null)},t.onerror=function(){alert("Failed to load SDFG from URL: "+t.status),D(null)},t.open("GET",e+(/\?/.test(e)?"&":"?")+(new Date).getTime(),!0),t.send()}(I):D(null)}function D(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];O("#sdfg-file-input").change((function(e){e.target.files.length<1||(k=e.target.files[0],B())})),O("#menuclose").click((function(){return W()})),O("#reload").click((function(){B()})),O("#instrumentation-report-file-input").change((function(e){e.target.files.length<1||(T=e.target.files[0],U())})),O("#outline").click((function(){C.daceRenderer&&setTimeout((function(){return $(C.daceRenderer,C.daceRenderer.graph)}),1)})),O("#search-btn").click((function(){C.daceRenderer&&setTimeout((function(){P(C.daceRenderer,C.daceRenderer.graph,O("#search").val(),O("#search-case")[0].checked)}),1)})),O("#search").on("keydown",(function(e){"Enter"!=e.key&&13!=e.which||(z(),e.preventDefault())}));var n=null,i=document.getElementById("pan-btn"),a=document.getElementById("move-btn"),o=document.getElementById("select-btn"),s=[];s.push(document.getElementById("elem_map")),s.push(document.getElementById("elem_consume")),s.push(document.getElementById("elem_tasklet")),s.push(document.getElementById("elem_nested_sdfg")),s.push(document.getElementById("elem_access_node")),s.push(document.getElementById("elem_stream")),s.push(document.getElementById("elem_state")),i&&(n={pan:i,move:a,select:o,add_btns:s}),null!==e&&(C.daceRenderer=new u.U(e,document.getElementById("contents"),L,t,r,null,n))}function z(){C.daceRenderer&&setTimeout((function(){P(C.daceRenderer,C.daceRenderer.graph,O("#search").val(),O("#search-case")[0].checked)}),1)}function B(){k&&((A=new FileReader).onload=j,A.readAsText(k))}function j(){var e,t=(0,o.a)(A.result);null===(e=C.daceRenderer)||void 0===e||e.destroy(),C.daceRenderer=new u.U(t,document.getElementById("contents"),L),W()}function U(){T&&((A=new FileReader).onload=R,A.readAsText(T))}function R(){!function(e){var t,r={};if(e.traceEvents&&null!==(t=C.daceRenderer)&&void 0!==t&&t.sdfg){var n,i=M(e.traceEvents);try{for(i.s();!(n=i.n()).done;){var a=n.value;if("X"===a.ph){var o=a.args.sdfg_id+"/";void 0!==a.args.state_id?(o+=a.args.state_id+"/",void 0!==a.args.id?o+=a.args.id+"/-1":o+="-1/-1"):o+="-1/-1/-1",void 0!==r[o]?r[o].push(a.dur):r[o]=[a.dur]}}}catch(e){i.e(e)}finally{i.f()}for(var u in r){var c=r[u],l=q(c),f={min:l[0],max:l[1],mean:(0,s.J69)(c),med:(0,s.C2o)(c),count:c.length};r[u]=f}var p=C.daceRenderer;if(p.overlay_manager){p.overlay_manager.is_overlay_active(_.P)||p.overlay_manager.register_overlay(_.P);var d=p.overlay_manager.get_overlay(_.P);d&&(d.runtime_map=r,d.refresh())}}}(JSON.parse(A.result))}function q(e){var t=-Number.MAX_VALUE,r=Number.MAX_VALUE;return e.forEach((function(e){e>t&&(t=e),e<r&&(r=e)})),[r,t]}function F(e,t,r,n){var i,a=M(e.nodes());try{for(a.s();!(i=a.n()).done;){var o=i.value,s=e.node(o),u=s.label();n||(u=u.toLowerCase()),-1!==u.indexOf(t)&&r.push(s),s.data.graph&&F(s.data.graph,t,r,n)}}catch(e){a.e(e)}finally{a.f()}var c,l=M(e.edges());try{for(l.s();!(c=l.n()).done;){var f=c.value,p=e.edge(f),d=p.label();void 0!==d&&(n||(d=d.toLowerCase()),-1!==d.indexOf(t)&&r.push(p))}}catch(e){l.e(e)}finally{l.f()}}function P(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]&&arguments[3];H('Search Results for "'+r+'"');var i=[];n||(r=r.toLowerCase()),F(t,r,i,n),i.length>0&&e.zoom_to_view(i);var o=Z();o.innerHTML="";for(var s=function(){var t=c[u],r=document.createElement("div");r.className="context_menu_option",r.innerHTML=(0,p.v)(g||(g=(0,a.Z)([""," ",""])),t.type(),t.label()),r.onclick=function(){e.zoom_to_view([t])},r.onmouseenter=function(){t.highlighted||(t.highlighted=!0,e.draw_async())},r.onmouseleave=function(){t.highlighted&&(t.highlighted=!1,e.draw_async())},o.appendChild(r)},u=0,c=i;u<c.length;u++)s();G()}function L(e,t,r,n,i,a,o){var s;("click"===e&&!o||"dblclick"===e)&&(i.menu&&i.menu.destroy(),null!==(s=0===a.length?new SDFG(i.sdfg):1===a.length?a[0]:null)?(H(s.type()+" "+s.label()),V(s)):(W(),H("Multiple elements selected")),G())}function H(e){return C.daceUIHandlers.on_sidebar_set_title(e)}function G(){return C.daceUIHandlers.on_sidebar_show()}function Z(){return C.daceUIHandlers.sidebar_get_contents()}function W(){return C.daceUIHandlers.on_close_menu()}function $(e,t){return C.daceUIHandlers.on_outline(e,t)}function V(e){return C.daceUIHandlers.on_fill_info(e)}O("document").ready((function(){C.daceUIHandlers.on_init_menu()}))},3371:(e,t,r)=>{"use strict";r.d(t,{x:()=>p});var n,i=r(2465),a=r(7329),o=r(6610),s=r(5991),u=r(1762);function c(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return l(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)?l(e,t):void 0}}(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=e[Symbol.iterator]()},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 l(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 f=globalThis.$,p=function(){function e(){var t=this,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null;(0,o.Z)(this,e),this._html_content=r,this._click_close_handlers=[],this._=setTimeout((function(){t._click_close_handlers=[["click",function(e){t.destroy()}],["contextmenu",function(e){t.destroy()}]];var e,r=c(t._click_close_handlers);try{for(r.s();!(e=r.n()).done;){var n,i=e.value;(n=window).addEventListener.apply(n,(0,a.Z)(i))}}catch(e){r.e(e)}finally{r.f()}}),30),this._options=[],this._cmenu_elem=null}return(0,s.Z)(e,[{key:"width",value:function(){return this._cmenu_elem.offsetWidth}},{key:"visible",value:function(){return null!=this._cmenu_elem}},{key:"addOption",value:function(e,t){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;this._options.push({name:e,func:t,onhover:r})}},{key:"addCheckableOption",value:function(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null;this._options.push({name:e,checkbox:!0,checked:t,func:r,onhover:n})}},{key:"destroy",value:function(){if(this._cmenu_elem){document.body.removeChild(this._cmenu_elem);var e,t=c(this._click_close_handlers);try{for(t.s();!(e=t.n()).done;){var r,n=e.value;(r=window).removeEventListener.apply(r,(0,a.Z)(n))}}catch(e){t.e(e)}finally{t.f()}this._cmenu_elem=null}}},{key:"show",value:function(e,t){var r=document.createElement("div");if(r.id="contextmenu",f(r).css("left",e+"px"),f(r).css("top",t+"px"),r.classList.add("context_menu"),null==this._html_content){var a,o=c(this._options);try{var s=function(){var e=a.value,t=document.createElement("div");if(t.addEventListener("click",e.func),t.classList.add("context_menu_option"),e.checkbox){var o=document.createElement("span");o.classList=e.checked?"checkmark_checked":"checkmark",t.appendChild(o),t.innerHTML+=(0,u.v)(n||(n=(0,i.Z)(["",""])),e.name),t.addEventListener("click",(function(t){e.checked=!e.checked,e.func(t,e.checked)}))}else t.innerText=e.name,t.addEventListener("click",e.func);r.appendChild(t)};for(o.s();!(a=o.n()).done;)s()}catch(e){o.e(e)}finally{o.f()}}else r.innerHTML=this._html_content;this._cmenu_elem=r,document.body.appendChild(r)}}]),e}()},1762:(e,t,r)=>{"use strict";function n(e){var t=new Map([["&","&amp;"],["<","&lt;"],[">","&gt;"],['"',"&quot;"],["'","&#039;"]]);return"".concat(e).replace(/[&<>"']/g,(function(e){return t.get(e)}))}function i(e){for(var t=arguments.length,r=new Array(t>1?t-1:0),i=1;i<t;i++)r[i-1]=arguments[i];return 1===e.length?e[0]:e.reduce((function(e,t,i){return"".concat(e).concat(n(String(r[i-1]))).concat(t)}))}r.d(t,{v:()=>i})},9590:(e,t,r)=>{"use strict";r.d(t,{Pn:()=>o,Ev:()=>s,K5:()=>u,oi:()=>c});var n=r(400);function i(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return a(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)?a(e,t):void 0}}(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 o,s=!0,u=!1;return{s:function(){r=e[Symbol.iterator]()},n:function(){var e=r.next();return s=e.done,e},e:function(e){u=!0,o=e},f:function(){try{s||null==r.return||r.return()}finally{if(u)throw o}}}}function a(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 o(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,r="";if(e.start==e.end&&1==e.step&&1==e.tile)r+=s(e.start,t);else{if(t&&t.inclusive_ranges)r+=s(e.start,t)+".."+s(e.end,t);else{var i=s(e.end,t)+" + 1";try{i=(0,n.og)(i).toString()}catch(e){}r+=s(e.start,t)+":"+i}1!=e.step?(r+=":"+s(e.step,t),1!=e.tile&&(r+=":"+s(e.tile,t))):1!=e.tile&&(r+="::"+s(e.tile,t))}return r}function s(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;if(null===e)return e;if("boolean"==typeof e)return e?"True":"False";if("Indices"===e.type||"subsets.Indices"===e.type){var r,n=e.indices,a="[",u=i(n);try{for(u.s();!(r=u.n()).done;){var c=r.value;a+=s(c,t)+", "}}catch(e){u.e(e)}finally{u.f()}return a.slice(0,-2)+"]"}if("Range"===e.type||"subsets.Range"===e.type){var l,f=e.ranges,p="[",d=i(f);try{for(d.s();!(l=d.n()).done;){var h=l.value;p+=o(h,t)+", "}}catch(e){d.e(e)}finally{d.f()}return p.slice(0,-2)+"]"}if(void 0!==e.language)return""!==e.string_data&&void 0!==e.string_data&&null!==e.string_data?'<pre class="code"><code>'+e.string_data.trim()+'</code></pre><div class="clearfix"></div>':"";if(void 0!==e.approx&&void 0!==e.main)return e.main;if(e.constructor==Object)return'<pre class="code"><code>'+JSON.stringify(e,void 0,4)+'</code></pre><div class="clearfix"></div>';if(e.constructor==Array){var m,v="[ ",y=!0,g=i(e);try{for(g.s();!(m=g.n()).done;){var x=m.value;y||(v+=", "),v+=s(x,t),y=!1}}catch(e){g.e(e)}finally{g.f()}return v+" ]"}return e}function u(e){if(e.replace(/\s+/g,""),""===e||"null"===e)return null;if(e.endsWith(")"))if(e.startsWith("vector(")){var t=e.substring(7,e.length-1);if(t){var r=t.lastIndexOf(",");if(r){var n=u(t.substring(0,r)),i=t.substring(r);if(n&&i)return{type:"vector",dtype:n,elements:i}}}}else if(e.startsWith("pointer(")){var a=e.substring(8,e.length-1);if(a)return{type:"pointer",dtype:u(a)}}else if(e.startsWith("opaque(")){var o=e.substring(7,e.length-1);if(o)return{type:"opaque",name:o}}else if(e.startsWith("callback(")){var s=e.substring(9,e.length-1);if(s){var c=s.lastIndexOf(",");if(c){var l=s.substring(0,c);if(l.startsWith("[")&&l.endsWith("]")){var f=l.substring(1,l.length-1).split(","),p=u(s.substring(c)),d=[];if(f&&f.forEach((function(e){d.push(u(e))})),d&&p)return{type:"callback",arguments:d,returntype:p}}}}}return e}function c(e){if(null==e)return"null";if(e.constructor===Object){if(void 0!==e.type)switch(e.type){case"vector":if(void 0!==e.elements&&void 0!==e.dtype)return"vector("+c(e.dtype)+", "+e.elements+")";break;case"pointer":if(void 0!==e.dtype)return"pointer("+c(e.dtype)+")";break;case"opaque":if(void 0!==e.name)return"opaque("+e.name+")";break;case"callback":if(void 0!==e.arguments){for(var t="callback([",r=0;r<e.arguments.length;r++)t+=c(e.arguments[r]),r<e.arguments.length-1&&(t+=", ");return t+="], ",void 0!==e.returntype?t+=c(e.returntype):t+="None",t+")"}}return s(e)}return e}},9018:(e,t,r)=>{"use strict";r.d(t,{a:()=>i,n:()=>a});var n=r(484);function i(e){return JSON.parse(e,o)}function a(e){return JSON.stringify(e,(function(t,r){return s(0,r,e)}))}function o(e,t){return"sdfg"==e&&t&&"string"==typeof t&&"{"===t[0]?JSON.parse(t,o):t}function s(e,t,r){return!t||(i=t,"object"!==(0,n.Z)(i)||null===i||i instanceof Array||i instanceof Date)||t===r||!("type"in t)||"SDFG"!==t.type?t:JSON.stringify(t,(function(e,r){return s(0,r,t)}));var i}},6310:(e,t,r)=>{"use strict";function n(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return i(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)?i(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,a=function(){};return{s:a,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:a}}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 o,s=!0,u=!1;return{s:function(){r=e[Symbol.iterator]()},n:function(){var e=r.next();return s=e.done,e},e:function(e){u=!0,o=e},f:function(){try{s||null==r.return||r.return()}finally{if(u)throw o}}}}function i(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}r.d(t,{GS:()=>s,FK:()=>u,RI:()=>c,sC:()=>l,_T:()=>f,Wp:()=>p,lU:()=>d});var a=r(5994).LF.NestedSDFG;function o(e,t){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:void 0;if(e.node(0).sdfg.sdfg_list_id===t)return{graph:e,node:r};var i,s={graph:void 0,node:void 0},u=n(e.nodes());try{for(u.s();!(i=u.n()).done;){var c=i.value,l=e.node(c);if(void 0!==l.data.graph&&null!==l.data.graph){var f,p=n(l.data.graph.nodes());try{for(p.s();!(f=p.n()).done;){var d=f.value,h=l.data.graph.node(d);if(h instanceof a){var m=o(h.data.graph,t,h);if(void 0!==m.graph)return m}}}catch(e){p.e(e)}finally{p.f()}}}}catch(e){u.e(e)}finally{u.f()}return s}function s(e,t){var r,i=n(e);try{for(i.s();!(r=i.n()).done;){var a=r.value;if(a.type.endsWith("Exit")&&parseInt(a.scope_entry)==t.id)return a}}catch(e){i.e(e)}finally{i.f()}return console.warn("Did not find corresponding exit"),null}function u(e){if(e instanceof State)return e.sdfg.sdfg_list_id+"/"+e.id+"/-1/"+-1;if(e instanceof SDFGNode)return e.sdfg.sdfg_list_id+"/"+e.parent_id+"/"+e.id+"/"+-1;if(e instanceof Edge){var t=-1;return null!==e.parent_id&&void 0!==e.parent_id&&(t=e.parent_id),e.sdfg.sdfg_list_id+"/"+t+"/-1/"+e.id}return"-1/-1/-1/-1"}function c(e,t,r){if(!t.has(e.dst))return null;if(t.has(e.src))return e;var n=r.nodes[e.src].scope_entry;if(!t.has(n))return null;var i=Object.assign({},e);return i.src=n,i}function l(e,t){var r=t.split("/"),n=Number(r[0]),i=Number(r[1]),a=Number(r[2]),s=Number(r[3]),u={parent:void 0,element:void 0},c=e;if(n>0){var l=o(c,n);if(void 0===l.graph)throw new Error;u={parent:c=l.graph,element:l.node}}var f=void 0;return-1!==i&&void 0!==c&&(f=c.node(i),u={parent:c,element:f}),-1!==a&&void 0!==f&&null!==f.data.graph?u={parent:f.data.graph,element:f.data.graph.node(a)}:-1!==s&&void 0!==f&&null!==f.data.graph?u={parent:f.data.graph,element:f.data.graph.edge(s)}:-1!==s&&void 0===f&&(u={parent:c,element:c.edge(s)}),u}function f(e){var t;if(e instanceof Edge||"MultiConnectorEdge"===e.type){var r=void 0;e.points&&(r=Array(e.points.length)),t={points:r,scope_dx:0,scope_dy:0};for(var n=0;e.points&&n<e.points.length;n++)t.points[n]={dx:0,dy:0}}else t={dx:0,dy:0,scope_dx:0,scope_dy:0};return function(e,t){e instanceof State?e.data.state.attributes.position=t:e instanceof SDFGNode?e.data.node.attributes.position=t:e instanceof Edge?e.data.attributes.position=t:"MultiConnectorEdge"===e.type?e.attributes.data.attributes.position=t:e.attributes&&(e.attributes.position=t)}(e,t),t}function p(e){var t,r,n;return e instanceof State?e.data.state.attributes.position:e instanceof SDFGNode?e.data.node.attributes.position:e instanceof Edge?e.data.attributes.position:"MultiConnectorEdge"===(null==e?void 0:e.type)?null==e||null===(t=e.attributes)||void 0===t||null===(r=t.data)||void 0===r||null===(n=r.attributes)||void 0===n?void 0:n.position:null!=e&&e.attributes?e.attributes.position:void 0}function d(e){e instanceof State&&delete e.data.state.attributes.position,e instanceof SDFGNode&&delete e.data.node.attributes.position,e instanceof Edge&&delete e.data.attributes.position,"MultiConnectorEdge"===(null==e?void 0:e.type)&&delete e.attributes.data.attributes.position,null!=e&&e.attributes&&delete e.attributes.position}},4194:(e,t,r)=>{"use strict";function n(e,t){var r;if("undefined"==typeof Symbol||null==e[Symbol.iterator]){if(Array.isArray(e)||(r=function(e,t){if(e){if("string"==typeof e)return i(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)?i(e,t):void 0}}(e))||t&&e&&"number"==typeof e.length){r&&(e=r);var n=0,a=function(){};return{s:a,n:function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}},e:function(e){throw e},f:a}}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 o,s=!0,u=!1;return{s:function(){r=e[Symbol.iterator]()},n:function(){var e=r.next();return s=e.done,e},e:function(e){u=!0,o=e},f:function(){try{s||null==r.return||r.return()}finally{if(u)throw o}}}}function i(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 a(e,t){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;function i(e,a){var o=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;null===o&&(o=new Set);var s,u=n(a);try{for(u.s();!(s=u.n()).done;){var c=s.value,l=e.node(c);if(void 0!==l&&!o.has(l.id.toString())){var f=t(l,e);if(!1!==f){if(l.type().endsWith("Entry")){var p=l.sdfg.nodes[l.parent_id];void 0!==p.scope_dict[l.id]&&i(e,p.scope_dict[l.id],o)}if(l.data.graph){var d=l.data.state;void 0!==d&&void 0!==d.scope_dict[-1]?i(l.data.graph,d.scope_dict[-1]):i(l.data.graph,l.data.graph.nodes())}}r&&r(l,e),o.add(l.id.toString())}}}catch(e){u.e(e)}finally{u.f()}}i(e,e.nodes())}function o(e,t,r){var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:[];if(n.includes(r)||r.attributes.data.attributes.shortcut)return[];n.push(r);var i=[];function a(e){return t.nodes[e.src]}function s(e){return t.nodes[e.dst]}function u(t){if("AccessNode"==t.type){var r=e.attributes._arrays[t.attributes.data];return r&&"View"===r.type}return!1}var c=!1,l=!1;if((r.src_connector&&a(r).type.endsWith("Entry")||r.dst_connector&&s(r).type.endsWith("Entry")&&r.dst_connector.startsWith("IN_")||"NestedSDFG"==s(r).type||u(s(r)))&&(c=!0),(r.src_connector&&a(r).type.endsWith("Exit")||r.dst_connector&&s(r).type.endsWith("Exit")||"NestedSDFG"==a(r).type||u(a(r)))&&(l=!0),i.push(r),c==l&&!1===l)return i;function f(e){var r=[];if(c){var p=s(e);if("NestedSDFG"==p.type){var d=e.dst_connector,h=p.attributes.sdfg;h.nodes.forEach((function(e){e.edges.forEach((function(t){var r=e.nodes[t.src];"AccessNode"==r.type&&r.attributes.data===d&&(i=i.concat(o(h,e,t,n)))}))}))}if(u(p))t.edges.forEach((function(e){e.src==p.id&&(r.push(e),e.attributes.data.attributes.shortcut||i.push(e))}));else{if(!p.type.endsWith("Entry")||!e.dst_connector||!e.dst_connector.startsWith("IN_"))return;if(p.attributes.is_collapsed)return;var m=e.dst_connector.substring(3);t.edges.forEach((function(e){e.src==p.id&&e.src_connector=="OUT_"+m&&(r.push(e),e.attributes.data.attributes.shortcut||i.push(e))}))}}if(l){var v=a(e);if("NestedSDFG"==v.type){var y=e.src_connector,g=v.attributes.sdfg;g.nodes.forEach((function(e){e.edges.forEach((function(t){var r=e.nodes[t.dst];"AccessNode"==r.type&&r.attributes.data==y&&(i=i.concat(o(g,e,t,n)))}))}))}if(u(v))t.edges.forEach((function(e){e.dst==v.id&&(r.push(e),i.push(e))}));else{if(!v.type.endsWith("Exit")||!e.src_connector)return;var x=e.src_connector.substring(4);t.edges.forEach((function(e){e.dst==v.id&&e.dst_connector=="IN_"+x&&(r.push(e),i.push(e))}))}}for(var b=0,w=r;b<w.length;b++)f(w[b])}return f(r),i}function s(e){var t=[],r=[];return e.nodes.forEach((function(n){n.edges.forEach((function(i){var a=o(e,n,i,r);a.length>1&&t.push(a)})),n.nodes.forEach((function(e){if("NestedSDFG"==e.type){var r=s(e.attributes.sdfg);t=t.concat(r)}}))})),t}function u(e){var t=[];return s(e).forEach((function(e){var r,i=!1,a=n(t);try{var o=function(){var t,a=r.value,o=n(e);try{for(o.s();!(t=o.n()).done;){var s=t.value;if(a.has(s)){e.forEach((function(e){return a.add(e)})),i=!0;break}}}catch(e){o.e(e)}finally{o.f()}if(i)return"break"};for(a.s();!(r=a.n()).done&&"break"!==o(););}catch(e){a.e(e)}finally{a.f()}i||t.push(new Set(e))})),t}r.d(t,{LY:()=>a,KV:()=>u})},5096:(e,t,r)=>{"use strict";r.d(t,{p$:()=>o,az:()=>s,_W:()=>u});var n=r(4699),i=r(7329),a=r(484);function o(e){return"object"!==(0,a.Z)(e)||null===e?e:Array.isArray(e)?e.map((function(e){return o(e)})):Object.fromEntries(o((0,i.Z)(Object.entries(e))))}function s(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"",r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:[],n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:void 0,i=document.createElement(e);return""!==t&&(i.id=t),r!==[]&&r.forEach((function(e){i.classList.contains(e)||i.classList.add(e)})),n&&n.appendChild(i),i}function u(e,t){for(var r=e,i=0,a=Object.entries(t);i<a.length;i++){var o=(0,n.Z)(a[i],2),s=o[0],u=o[1];s in e||(r[s]=u)}return r}},1977:function(e,t){var r;!function(n){"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):Math.log(e/Math.cos(Math.atan2(t,e)))}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)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(e<-t||e>t)return Math.cos(e)-1;var r=e*e;return r*(r*(1/24+r*(-1/720+r*(1/40320+r*(-1/3628800+r*(1/4790014600+r*(-1/87178291200+r*(1/20922789888e3)))))))-.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":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-16,void 0===(r=function(){return u}.apply(t,[]))||(e.exports=r)}()},681:(e,t,r)=>{e.exports={graphlib:r(574),layout:r(8123),debug:r(7570),util:{time:r(1138).time,notime:r(1138).notime},version:r(8177)}},2188:(e,t,r)=>{"use strict";var n=r(8436),i=r(4079);e.exports={run:function(e){var t="greedy"===e.graph().acyclicer?i(e,function(e){return function(t){return e.edge(t).weight}}(e)):function(e){var t=[],r={},i={};return n.forEach(e.nodes(),(function a(o){n.has(i,o)||(i[o]=!0,r[o]=!0,n.forEach(e.outEdges(o),(function(e){n.has(r,e.w)?t.push(e):a(e.w)})),delete r[o])})),t}(e);n.forEach(t,(function(t){var r=e.edge(t);e.removeEdge(t),r.forwardName=t.name,r.reversed=!0,e.setEdge(t.w,t.v,r,n.uniqueId("rev"))}))},undo:function(e){n.forEach(e.edges(),(function(t){var r=e.edge(t);if(r.reversed){e.removeEdge(t);var n=r.forwardName;delete r.reversed,delete r.forwardName,e.setEdge(t.w,t.v,r,n)}}))}}},1133:(e,t,r)=>{var n=r(8436),i=r(1138);function a(e,t,r,n,a,o){var s={width:0,height:0,rank:o,borderType:t},u=a[t][o-1],c=i.addDummyNode(e,"border",s,r);a[t][o]=c,e.setParent(c,n),u&&e.setEdge(u,c,{weight:1})}e.exports=function(e){n.forEach(e.children(),(function t(r){var i=e.children(r),o=e.node(r);if(i.length&&n.forEach(i,t),n.has(o,"minRank")){o.borderLeft=[],o.borderRight=[];for(var s=o.minRank,u=o.maxRank+1;s<u;++s)a(e,"borderLeft","_bl",r,o,s),a(e,"borderRight","_br",r,o,s)}}))}},3258:(e,t,r)=>{"use strict";var n=r(8436);function i(e){n.forEach(e.nodes(),(function(t){a(e.node(t))})),n.forEach(e.edges(),(function(t){a(e.edge(t))}))}function a(e){var t=e.width;e.width=e.height,e.height=t}function o(e){e.y=-e.y}function s(e){var t=e.x;e.x=e.y,e.y=t}e.exports={adjust:function(e){var t=e.graph().rankdir.toLowerCase();"lr"!==t&&"rl"!==t||i(e)},undo:function(e){var t=e.graph().rankdir.toLowerCase();"bt"!==t&&"rl"!==t||function(e){n.forEach(e.nodes(),(function(t){o(e.node(t))})),n.forEach(e.edges(),(function(t){var r=e.edge(t);n.forEach(r.points,o),n.has(r,"y")&&o(r)}))}(e),"lr"!==t&&"rl"!==t||(function(e){n.forEach(e.nodes(),(function(t){s(e.node(t))})),n.forEach(e.edges(),(function(t){var r=e.edge(t);n.forEach(r.points,s),n.has(r,"x")&&s(r)}))}(e),i(e))}}},7822:e=>{function t(){var e={};e._next=e._prev=e,this._sentinel=e}function r(e){e._prev._next=e._next,e._next._prev=e._prev,delete e._next,delete e._prev}function n(e,t){if("_next"!==e&&"_prev"!==e)return t}e.exports=t,t.prototype.dequeue=function(){var e=this._sentinel,t=e._prev;if(t!==e)return r(t),t},t.prototype.enqueue=function(e){var t=this._sentinel;e._prev&&e._next&&r(e),e._next=t._next,t._next._prev=e,t._next=e,e._prev=t},t.prototype.toString=function(){for(var e=[],t=this._sentinel,r=t._prev;r!==t;)e.push(JSON.stringify(r,n)),r=r._prev;return"["+e.join(", ")+"]"}},7570:(e,t,r)=>{var n=r(8436),i=r(1138),a=r(574).Graph;e.exports={debugOrdering:function(e){var t=i.buildLayerMatrix(e),r=new a({compound:!0,multigraph:!0}).setGraph({});return n.forEach(e.nodes(),(function(t){r.setNode(t,{label:t}),r.setParent(t,"layer"+e.node(t).rank)})),n.forEach(e.edges(),(function(e){r.setEdge(e.v,e.w,{},e.name)})),n.forEach(t,(function(e,t){var i="layer"+t;r.setNode(i,{rank:"same"}),n.reduce(e,(function(e,t){return r.setEdge(e,t,{style:"invis"}),t}))})),r}}},574:(e,t,r)=>{var n;try{n=r(8282)}catch(e){}n||(n=window.graphlib),e.exports=n},4079:(e,t,r)=>{var n=r(8436),i=r(574).Graph,a=r(7822);e.exports=function(e,t){if(e.nodeCount()<=1)return[];var r=function(e,t){var r=new i,o=0,s=0;n.forEach(e.nodes(),(function(e){r.setNode(e,{v:e,in:0,out:0})})),n.forEach(e.edges(),(function(e){var n=r.edge(e.v,e.w)||0,i=t(e),a=n+i;r.setEdge(e.v,e.w,a),s=Math.max(s,r.node(e.v).out+=i),o=Math.max(o,r.node(e.w).in+=i)}));var c=n.range(s+o+3).map((function(){return new a})),l=o+1;return n.forEach(r.nodes(),(function(e){u(c,l,r.node(e))})),{graph:r,buckets:c,zeroIdx:l}}(e,t||o),c=function(e,t,r){for(var n,i=[],a=t[t.length-1],o=t[0];e.nodeCount();){for(;n=o.dequeue();)s(e,t,r,n);for(;n=a.dequeue();)s(e,t,r,n);if(e.nodeCount())for(var u=t.length-2;u>0;--u)if(n=t[u].dequeue()){i=i.concat(s(e,t,r,n,!0));break}}return i}(r.graph,r.buckets,r.zeroIdx);return n.flatten(n.map(c,(function(t){return e.outEdges(t.v,t.w)})),!0)};var o=n.constant(1);function s(e,t,r,i,a){var o=a?[]:void 0;return n.forEach(e.inEdges(i.v),(function(n){var i=e.edge(n),s=e.node(n.v);a&&o.push({v:n.v,w:n.w}),s.out-=i,u(t,r,s)})),n.forEach(e.outEdges(i.v),(function(n){var i=e.edge(n),a=n.w,o=e.node(a);o.in-=i,u(t,r,o)})),e.removeNode(i.v),o}function u(e,t,r){r.out?r.in?e[r.out-r.in+t].enqueue(r):e[e.length-1].enqueue(r):e[0].enqueue(r)}},8123:(e,t,r)=>{"use strict";var n=r(8436),i=r(2188),a=r(5995),o=r(8093),s=r(1138).normalizeRanks,u=r(4219),c=r(1138).removeEmptyRanks,l=r(2981),f=r(1133),p=r(3258),d=r(3408),h=r(7873),m=r(1138),v=r(574).Graph;e.exports=function(e,t){var r=t&&t.debugTiming?m.time:m.notime;r("layout",(function(){var t=r("  buildLayoutGraph",(function(){return function(e){var t=new v({multigraph:!0,compound:!0}),r=S(e.graph());return t.setGraph(n.merge({},g,M(r,y),n.pick(r,x))),n.forEach(e.nodes(),(function(r){var i=S(e.node(r));t.setNode(r,n.defaults(M(i,b),w)),t.setParent(r,e.parent(r))})),n.forEach(e.edges(),(function(r){var i=S(e.edge(r));t.setEdge(r,n.merge({},N,M(i,_),n.pick(i,E)))})),t}(e)}));r("  runLayout",(function(){!function(e,t){t("    makeSpaceForEdgeLabels",(function(){!function(e){var t=e.graph();t.ranksep/=2,n.forEach(e.edges(),(function(r){var n=e.edge(r);n.minlen*=2,"c"!==n.labelpos.toLowerCase()&&("TB"===t.rankdir||"BT"===t.rankdir?n.width+=n.labeloffset:n.height+=n.labeloffset)}))}(e)})),t("    removeSelfEdges",(function(){!function(e){n.forEach(e.edges(),(function(t){if(t.v===t.w){var r=e.node(t.v);r.selfEdges||(r.selfEdges=[]),r.selfEdges.push({e:t,label:e.edge(t)}),e.removeEdge(t)}}))}(e)})),t("    acyclic",(function(){i.run(e)})),t("    nestingGraph.run",(function(){l.run(e)})),t("    rank",(function(){o(m.asNonCompoundGraph(e))})),t("    injectEdgeLabelProxies",(function(){!function(e){n.forEach(e.edges(),(function(t){var r=e.edge(t);if(r.width&&r.height){var n=e.node(t.v),i={rank:(e.node(t.w).rank-n.rank)/2+n.rank,e:t};m.addDummyNode(e,"edge-proxy",i,"_ep")}}))}(e)})),t("    removeEmptyRanks",(function(){c(e)})),t("    nestingGraph.cleanup",(function(){l.cleanup(e)})),t("    normalizeRanks",(function(){s(e)})),t("    assignRankMinMax",(function(){!function(e){var t=0;n.forEach(e.nodes(),(function(r){var i=e.node(r);i.borderTop&&(i.minRank=e.node(i.borderTop).rank,i.maxRank=e.node(i.borderBottom).rank,t=n.max(t,i.maxRank))})),e.graph().maxRank=t}(e)})),t("    removeEdgeLabelProxies",(function(){!function(e){n.forEach(e.nodes(),(function(t){var r=e.node(t);"edge-proxy"===r.dummy&&(e.edge(r.e).labelRank=r.rank,e.removeNode(t))}))}(e)})),t("    normalize.run",(function(){a.run(e)})),t("    parentDummyChains",(function(){u(e)})),t("    addBorderSegments",(function(){f(e)})),t("    order",(function(){d(e)})),t("    insertSelfEdges",(function(){!function(e){var t=m.buildLayerMatrix(e);n.forEach(t,(function(t){var r=0;n.forEach(t,(function(t,i){var a=e.node(t);a.order=i+r,n.forEach(a.selfEdges,(function(t){m.addDummyNode(e,"selfedge",{width:t.label.width,height:t.label.height,rank:a.rank,order:i+ ++r,e:t.e,label:t.label},"_se")})),delete a.selfEdges}))}))}(e)})),t("    adjustCoordinateSystem",(function(){p.adjust(e)})),t("    position",(function(){h(e)})),t("    positionSelfEdges",(function(){!function(e){n.forEach(e.nodes(),(function(t){var r=e.node(t);if("selfedge"===r.dummy){var n=e.node(r.e.v),i=n.x+n.width/2,a=n.y,o=r.x-i,s=n.height/2;e.setEdge(r.e,r.label),e.removeNode(t),r.label.points=[{x:i+2*o/3,y:a-s},{x:i+5*o/6,y:a-s},{x:i+o,y:a},{x:i+5*o/6,y:a+s},{x:i+2*o/3,y:a+s}],r.label.x=r.x,r.label.y=r.y}}))}(e)})),t("    removeBorderNodes",(function(){!function(e){n.forEach(e.nodes(),(function(t){if(e.children(t).length){var r=e.node(t),i=e.node(r.borderTop),a=e.node(r.borderBottom),o=e.node(n.last(r.borderLeft)),s=e.node(n.last(r.borderRight));r.width=Math.abs(s.x-o.x),r.height=Math.abs(a.y-i.y),r.x=o.x+r.width/2,r.y=i.y+r.height/2}})),n.forEach(e.nodes(),(function(t){"border"===e.node(t).dummy&&e.removeNode(t)}))}(e)})),t("    normalize.undo",(function(){a.undo(e)})),t("    fixupEdgeLabelCoords",(function(){!function(e){n.forEach(e.edges(),(function(t){var r=e.edge(t);if(n.has(r,"x"))switch("l"!==r.labelpos&&"r"!==r.labelpos||(r.width-=r.labeloffset),r.labelpos){case"l":r.x-=r.width/2+r.labeloffset;break;case"r":r.x+=r.width/2+r.labeloffset}}))}(e)})),t("    undoCoordinateSystem",(function(){p.undo(e)})),t("    translateGraph",(function(){!function(e){var t=Number.POSITIVE_INFINITY,r=0,i=Number.POSITIVE_INFINITY,a=0,o=e.graph(),s=o.marginx||0,u=o.marginy||0;function c(e){var n=e.x,o=e.y,s=e.width,u=e.height;t=Math.min(t,n-s/2),r=Math.max(r,n+s/2),i=Math.min(i,o-u/2),a=Math.max(a,o+u/2)}n.forEach(e.nodes(),(function(t){c(e.node(t))})),n.forEach(e.edges(),(function(t){var r=e.edge(t);n.has(r,"x")&&c(r)})),t-=s,i-=u,n.forEach(e.nodes(),(function(r){var n=e.node(r);n.x-=t,n.y-=i})),n.forEach(e.edges(),(function(r){var a=e.edge(r);n.forEach(a.points,(function(e){e.x-=t,e.y-=i})),n.has(a,"x")&&(a.x-=t),n.has(a,"y")&&(a.y-=i)})),o.width=r-t+s,o.height=a-i+u}(e)})),t("    assignNodeIntersects",(function(){!function(e){n.forEach(e.edges(),(function(t){var r,n,i=e.edge(t),a=e.node(t.v),o=e.node(t.w);i.points?(r=i.points[0],n=i.points[i.points.length-1]):(i.points=[],r=o,n=a),i.points.unshift(m.intersectRect(a,r)),i.points.push(m.intersectRect(o,n))}))}(e)})),t("    reversePoints",(function(){!function(e){n.forEach(e.edges(),(function(t){var r=e.edge(t);r.reversed&&r.points.reverse()}))}(e)})),t("    acyclic.undo",(function(){i.undo(e)}))}(t,r)})),r("  updateInputGraph",(function(){!function(e,t){n.forEach(e.nodes(),(function(r){var n=e.node(r),i=t.node(r);n&&(n.x=i.x,n.y=i.y,t.children(r).length&&(n.width=i.width,n.height=i.height))})),n.forEach(e.edges(),(function(r){var i=e.edge(r),a=t.edge(r);i.points=a.points,n.has(a,"x")&&(i.x=a.x,i.y=a.y)})),e.graph().width=t.graph().width,e.graph().height=t.graph().height}(e,t)}))}))};var y=["nodesep","edgesep","ranksep","marginx","marginy"],g={ranksep:50,edgesep:20,nodesep:50,rankdir:"tb"},x=["acyclicer","ranker","rankdir","align"],b=["width","height"],w={width:0,height:0},_=["minlen","weight","width","height","labeloffset"],N={minlen:1,weight:1,width:0,height:0,labeloffset:10,labelpos:"r"},E=["labelpos"];function M(e,t){return n.mapValues(n.pick(e,t),Number)}function S(e){var t={};return n.forEach(e,(function(e,r){t[r.toLowerCase()]=e})),t}},8436:(e,t,r)=>{var n;try{n={cloneDeep:r(361),constant:r(5703),defaults:r(1747),each:r(6073),filter:r(3105),find:r(3311),flatten:r(5564),forEach:r(4486),forIn:r(2620),has:r(8721),isUndefined:r(2353),last:r(928),map:r(5161),mapValues:r(6604),max:r(6162),merge:r(3857),min:r(3632),minBy:r(2762),now:r(7771),pick:r(9722),range:r(6026),reduce:r(4061),sortBy:r(9734),uniqueId:r(3955),values:r(2628),zipObject:r(7287)}}catch(e){}n||(n=window._),e.exports=n},2981:(e,t,r)=>{var n=r(8436),i=r(1138);function a(e,t,r,o,s,u,c){var l=e.children(c);if(l.length){var f=i.addBorderNode(e,"_bt"),p=i.addBorderNode(e,"_bb"),d=e.node(c);e.setParent(f,c),d.borderTop=f,e.setParent(p,c),d.borderBottom=p,n.forEach(l,(function(n){a(e,t,r,o,s,u,n);var i=e.node(n),l=i.borderTop?i.borderTop:n,d=i.borderBottom?i.borderBottom:n,h=i.borderTop?o:2*o,m=l!==d?1:s-u[c]+1;e.setEdge(f,l,{weight:h,minlen:m,nestingEdge:!0}),e.setEdge(d,p,{weight:h,minlen:m,nestingEdge:!0})})),e.parent(c)||e.setEdge(t,f,{weight:0,minlen:s+u[c]})}else c!==t&&e.setEdge(t,c,{weight:0,minlen:r})}e.exports={run:function(e){var t=i.addDummyNode(e,"root",{},"_root"),r=function(e){var t={};function r(i,a){var o=e.children(i);o&&o.length&&n.forEach(o,(function(e){r(e,a+1)})),t[i]=a}return n.forEach(e.children(),(function(e){r(e,1)})),t}(e),o=n.max(n.values(r))-1,s=2*o+1;e.graph().nestingRoot=t,n.forEach(e.edges(),(function(t){e.edge(t).minlen*=s}));var u=function(e){return n.reduce(e.edges(),(function(t,r){return t+e.edge(r).weight}),0)}(e)+1;n.forEach(e.children(),(function(n){a(e,t,s,u,o,r,n)})),e.graph().nodeRankFactor=s},cleanup:function(e){var t=e.graph();e.removeNode(t.nestingRoot),delete t.nestingRoot,n.forEach(e.edges(),(function(t){e.edge(t).nestingEdge&&e.removeEdge(t)}))}}},5995:(e,t,r)=>{"use strict";var n=r(8436),i=r(1138);e.exports={run:function(e){e.graph().dummyChains=[],n.forEach(e.edges(),(function(t){!function(e,t){var r,n,a,o=t.v,s=e.node(o).rank,u=t.w,c=e.node(u).rank,l=t.name,f=e.edge(t),p=f.labelRank;if(c!==s+1){for(e.removeEdge(t),a=0,++s;s<c;++a,++s)f.points=[],n={width:0,height:0,edgeLabel:f,edgeObj:t,rank:s},r=i.addDummyNode(e,"edge",n,"_d"),s===p&&(n.width=f.width,n.height=f.height,n.dummy="edge-label",n.labelpos=f.labelpos),e.setEdge(o,r,{weight:f.weight},l),0===a&&e.graph().dummyChains.push(r),o=r;e.setEdge(o,u,{weight:f.weight},l)}}(e,t)}))},undo:function(e){n.forEach(e.graph().dummyChains,(function(t){var r,n=e.node(t),i=n.edgeLabel;for(e.setEdge(n.edgeObj,i);n.dummy;)r=e.successors(t)[0],e.removeNode(t),i.points.push({x:n.x,y:n.y}),"edge-label"===n.dummy&&(i.x=n.x,i.y=n.y,i.width=n.width,i.height=n.height),t=r,n=e.node(t)}))}}},5093:(e,t,r)=>{var n=r(8436);e.exports=function(e,t,r){var i,a={};n.forEach(r,(function(r){for(var n,o,s=e.parent(r);s;){if((n=e.parent(s))?(o=a[n],a[n]=s):(o=i,i=s),o&&o!==s)return void t.setEdge(o,s);s=n}}))}},5439:(e,t,r)=>{var n=r(8436);e.exports=function(e,t){return n.map(t,(function(t){var r=e.inEdges(t);if(r.length){var i=n.reduce(r,(function(t,r){var n=e.edge(r),i=e.node(r.v);return{sum:t.sum+n.weight*i.order,weight:t.weight+n.weight}}),{sum:0,weight:0});return{v:t,barycenter:i.sum/i.weight,weight:i.weight}}return{v:t}}))}},3128:(e,t,r)=>{var n=r(8436),i=r(574).Graph;e.exports=function(e,t,r){var a=function(e){for(var t;e.hasNode(t=n.uniqueId("_root")););return t}(e),o=new i({compound:!0}).setGraph({root:a}).setDefaultNodeLabel((function(t){return e.node(t)}));return n.forEach(e.nodes(),(function(i){var s=e.node(i),u=e.parent(i);(s.rank===t||s.minRank<=t&&t<=s.maxRank)&&(o.setNode(i),o.setParent(i,u||a),n.forEach(e[r](i),(function(t){var r=t.v===i?t.w:t.v,a=o.edge(r,i),s=n.isUndefined(a)?0:a.weight;o.setEdge(r,i,{weight:e.edge(t).weight+s})})),n.has(s,"minRank")&&o.setNode(i,{borderLeft:s.borderLeft[t],borderRight:s.borderRight[t]}))})),o}},6630:(e,t,r)=>{"use strict";var n=r(8436);function i(e,t,r){for(var i=n.zipObject(r,n.map(r,(function(e,t){return t}))),a=n.flatten(n.map(t,(function(t){return n.sortBy(n.map(e.outEdges(t),(function(t){return{pos:i[t.w],weight:e.edge(t).weight}})),"pos")})),!0),o=1;o<r.length;)o<<=1;var s=2*o-1;o-=1;var u=n.map(new Array(s),(function(){return 0})),c=0;return n.forEach(a.forEach((function(e){var t=e.pos+o;u[t]+=e.weight;for(var r=0;t>0;)t%2&&(r+=u[t+1]),u[t=t-1>>1]+=e.weight;c+=e.weight*r}))),c}e.exports=function(e,t){for(var r=0,n=1;n<t.length;++n)r+=i(e,t[n-1],t[n]);return r}},3408:(e,t,r)=>{"use strict";var n=r(8436),i=r(2588),a=r(6630),o=r(1026),s=r(3128),u=r(5093),c=r(574).Graph,l=r(1138);function f(e,t,r){return n.map(t,(function(t){return s(e,t,r)}))}function p(e,t){var r=new c;n.forEach(e,(function(e){var i=e.graph().root,a=o(e,i,r,t);n.forEach(a.vs,(function(t,r){e.node(t).order=r})),u(e,r,a.vs)}))}function d(e,t){n.forEach(t,(function(t){n.forEach(t,(function(t,r){e.node(t).order=r}))}))}e.exports=function(e){var t=l.maxRank(e),r=f(e,n.range(1,t+1),"inEdges"),o=f(e,n.range(t-1,-1,-1),"outEdges"),s=i(e);d(e,s);for(var u,c=Number.POSITIVE_INFINITY,h=0,m=0;m<4;++h,++m){p(h%2?r:o,h%4>=2),s=l.buildLayerMatrix(e);var v=a(e,s);v<c&&(m=0,u=n.cloneDeep(s),c=v)}d(e,u)}},2588:(e,t,r)=>{"use strict";var n=r(8436);e.exports=function(e){var t={},r=n.filter(e.nodes(),(function(t){return!e.children(t).length})),i=n.max(n.map(r,(function(t){return e.node(t).rank}))),a=n.map(n.range(i+1),(function(){return[]})),o=n.sortBy(r,(function(t){return e.node(t).rank}));return n.forEach(o,(function r(i){if(!n.has(t,i)){t[i]=!0;var o=e.node(i);a[o.rank].push(i),n.forEach(e.successors(i),r)}})),a}},9567:(e,t,r)=>{"use strict";var n=r(8436);e.exports=function(e,t){var r={};return n.forEach(e,(function(e,t){var i=r[e.v]={indegree:0,in:[],out:[],vs:[e.v],i:t};n.isUndefined(e.barycenter)||(i.barycenter=e.barycenter,i.weight=e.weight)})),n.forEach(t.edges(),(function(e){var t=r[e.v],i=r[e.w];n.isUndefined(t)||n.isUndefined(i)||(i.indegree++,t.out.push(r[e.w]))})),function(e){var t=[];function r(e){return function(t){var r,i,a,o;t.merged||(n.isUndefined(t.barycenter)||n.isUndefined(e.barycenter)||t.barycenter>=e.barycenter)&&(i=t,a=0,o=0,(r=e).weight&&(a+=r.barycenter*r.weight,o+=r.weight),i.weight&&(a+=i.barycenter*i.weight,o+=i.weight),r.vs=i.vs.concat(r.vs),r.barycenter=a/o,r.weight=o,r.i=Math.min(i.i,r.i),i.merged=!0)}}function i(t){return function(r){r.in.push(t),0==--r.indegree&&e.push(r)}}for(;e.length;){var a=e.pop();t.push(a),n.forEach(a.in.reverse(),r(a)),n.forEach(a.out,i(a))}return n.map(n.filter(t,(function(e){return!e.merged})),(function(e){return n.pick(e,["vs","i","barycenter","weight"])}))}(n.filter(r,(function(e){return!e.indegree})))}},1026:(e,t,r)=>{var n=r(8436),i=r(5439),a=r(9567),o=r(7304);e.exports=function e(t,r,s,u){var c=t.children(r),l=t.node(r),f=l?l.borderLeft:void 0,p=l?l.borderRight:void 0,d={};f&&(c=n.filter(c,(function(e){return e!==f&&e!==p})));var h=i(t,c);n.forEach(h,(function(r){if(t.children(r.v).length){var i=e(t,r.v,s,u);d[r.v]=i,n.has(i,"barycenter")&&(a=r,o=i,n.isUndefined(a.barycenter)?(a.barycenter=o.barycenter,a.weight=o.weight):(a.barycenter=(a.barycenter*a.weight+o.barycenter*o.weight)/(a.weight+o.weight),a.weight+=o.weight))}var a,o}));var m=a(h,s);!function(e,t){n.forEach(e,(function(e){e.vs=n.flatten(e.vs.map((function(e){return t[e]?t[e].vs:e})),!0)}))}(m,d);var v=o(m,u);if(f&&(v.vs=n.flatten([f,v.vs,p],!0),t.predecessors(f).length)){var y=t.node(t.predecessors(f)[0]),g=t.node(t.predecessors(p)[0]);n.has(v,"barycenter")||(v.barycenter=0,v.weight=0),v.barycenter=(v.barycenter*v.weight+y.order+g.order)/(v.weight+2),v.weight+=2}return v}},7304:(e,t,r)=>{var n=r(8436),i=r(1138);function a(e,t,r){for(var i;t.length&&(i=n.last(t)).i<=r;)t.pop(),e.push(i.vs),r++;return r}e.exports=function(e,t){var r,o=i.partition(e,(function(e){return n.has(e,"barycenter")})),s=o.lhs,u=n.sortBy(o.rhs,(function(e){return-e.i})),c=[],l=0,f=0,p=0;s.sort((r=!!t,function(e,t){return e.barycenter<t.barycenter?-1:e.barycenter>t.barycenter?1:r?t.i-e.i:e.i-t.i})),p=a(c,u,p),n.forEach(s,(function(e){p+=e.vs.length,c.push(e.vs),l+=e.barycenter*e.weight,f+=e.weight,p=a(c,u,p)}));var d={vs:n.flatten(c,!0)};return f&&(d.barycenter=l/f,d.weight=f),d}},4219:(e,t,r)=>{var n=r(8436);e.exports=function(e){var t=function(e){var t={},r=0;return n.forEach(e.children(),(function i(a){var o=r;n.forEach(e.children(a),i),t[a]={low:o,lim:r++}})),t}(e);n.forEach(e.graph().dummyChains,(function(r){for(var n=e.node(r),i=n.edgeObj,a=function(e,t,r,n){var i,a,o=[],s=[],u=Math.min(t[r].low,t[n].low),c=Math.max(t[r].lim,t[n].lim);i=r;do{i=e.parent(i),o.push(i)}while(i&&(t[i].low>u||c>t[i].lim));for(a=i,i=n;(i=e.parent(i))!==a;)s.push(i);return{path:o.concat(s.reverse()),lca:a}}(e,t,i.v,i.w),o=a.path,s=a.lca,u=0,c=o[u],l=!0;r!==i.w;){if(n=e.node(r),l){for(;(c=o[u])!==s&&e.node(c).maxRank<n.rank;)u++;c===s&&(l=!1)}if(!l){for(;u<o.length-1&&e.node(c=o[u+1]).minRank<=n.rank;)u++;c=o[u]}e.setParent(r,c),r=e.successors(r)[0]}}))}},3573:(e,t,r)=>{"use strict";var n=r(8436),i=r(574).Graph,a=r(1138);function o(e,t){var r={};return n.reduce(t,(function(t,i){var a=0,o=0,s=t.length,c=n.last(i);return n.forEach(i,(function(t,l){var f=function(e,t){if(e.node(t).dummy)return n.find(e.predecessors(t),(function(t){return e.node(t).dummy}))}(e,t),p=f?e.node(f).order:s;(f||t===c)&&(n.forEach(i.slice(o,l+1),(function(t){n.forEach(e.predecessors(t),(function(n){var i=e.node(n),o=i.order;!(o<a||p<o)||i.dummy&&e.node(t).dummy||u(r,n,t)}))})),o=l+1,a=p)})),i})),r}function s(e,t){var r={};function i(t,i,a,o,s){var c;n.forEach(n.range(i,a),(function(i){c=t[i],e.node(c).dummy&&n.forEach(e.predecessors(c),(function(t){var n=e.node(t);n.dummy&&(n.order<o||n.order>s)&&u(r,t,c)}))}))}return n.reduce(t,(function(t,r){var a,o=-1,s=0;return n.forEach(r,(function(n,u){if("border"===e.node(n).dummy){var c=e.predecessors(n);c.length&&(a=e.node(c[0]).order,i(r,s,u,o,a),s=u,o=a)}i(r,s,r.length,a,t.length)})),r})),r}function u(e,t,r){if(t>r){var n=t;t=r,r=n}var i=e[t];i||(e[t]=i={}),i[r]=!0}function c(e,t,r){if(t>r){var i=t;t=r,r=i}return n.has(e[t],r)}function l(e,t,r,i){var a={},o={},s={};return n.forEach(t,(function(e){n.forEach(e,(function(e,t){a[e]=e,o[e]=e,s[e]=t}))})),n.forEach(t,(function(e){var t=-1;n.forEach(e,(function(e){var u=i(e);if(u.length)for(var l=((u=n.sortBy(u,(function(e){return s[e]}))).length-1)/2,f=Math.floor(l),p=Math.ceil(l);f<=p;++f){var d=u[f];o[e]===e&&t<s[d]&&!c(r,e,d)&&(o[d]=e,o[e]=a[e]=a[d],t=s[d])}}))})),{root:a,align:o}}function f(e,t,r,a,o){var s={},u=function(e,t,r,a){var o=new i,s=e.graph(),u=function(e,t,r){return function(i,a,o){var s,u=i.node(a),c=i.node(o),l=0;if(l+=u.width/2,n.has(u,"labelpos"))switch(u.labelpos.toLowerCase()){case"l":s=-u.width/2;break;case"r":s=u.width/2}if(s&&(l+=r?s:-s),s=0,l+=(u.dummy?t:e)/2,l+=(c.dummy?t:e)/2,l+=c.width/2,n.has(c,"labelpos"))switch(c.labelpos.toLowerCase()){case"l":s=c.width/2;break;case"r":s=-c.width/2}return s&&(l+=r?s:-s),s=0,l}}(s.nodesep,s.edgesep,a);return n.forEach(t,(function(t){var i;n.forEach(t,(function(t){var n=r[t];if(o.setNode(n),i){var a=r[i],s=o.edge(a,n);o.setEdge(a,n,Math.max(u(e,t,i),s||0))}i=t}))})),o}(e,t,r,o),c=o?"borderLeft":"borderRight";function l(e,t){for(var r=u.nodes(),n=r.pop(),i={};n;)i[n]?e(n):(i[n]=!0,r.push(n),r=r.concat(t(n))),n=r.pop()}return l((function(e){s[e]=u.inEdges(e).reduce((function(e,t){return Math.max(e,s[t.v]+u.edge(t))}),0)}),u.predecessors.bind(u)),l((function(t){var r=u.outEdges(t).reduce((function(e,t){return Math.min(e,s[t.w]-u.edge(t))}),Number.POSITIVE_INFINITY),n=e.node(t);r!==Number.POSITIVE_INFINITY&&n.borderType!==c&&(s[t]=Math.max(s[t],r))}),u.successors.bind(u)),n.forEach(a,(function(e){s[e]=s[r[e]]})),s}function p(e,t){return n.minBy(n.values(t),(function(t){var r=Number.NEGATIVE_INFINITY,i=Number.POSITIVE_INFINITY;return n.forIn(t,(function(t,n){var a=function(e,t){return e.node(t).width}(e,n)/2;r=Math.max(t+a,r),i=Math.min(t-a,i)})),r-i}))}function d(e,t){var r=n.values(t),i=n.min(r),a=n.max(r);n.forEach(["u","d"],(function(r){n.forEach(["l","r"],(function(o){var s,u=r+o,c=e[u];if(c!==t){var l=n.values(c);(s="l"===o?i-n.min(l):a-n.max(l))&&(e[u]=n.mapValues(c,(function(e){return e+s})))}}))}))}function h(e,t){return n.mapValues(e.ul,(function(r,i){if(t)return e[t.toLowerCase()][i];var a=n.sortBy(n.map(e,i));return(a[1]+a[2])/2}))}e.exports={positionX:function(e){var t,r=a.buildLayerMatrix(e),i=n.merge(o(e,r),s(e,r)),u={};n.forEach(["u","d"],(function(a){t="u"===a?r:n.values(r).reverse(),n.forEach(["l","r"],(function(r){"r"===r&&(t=n.map(t,(function(e){return n.values(e).reverse()})));var o=("u"===a?e.predecessors:e.successors).bind(e),s=l(0,t,i,o),c=f(e,t,s.root,s.align,"r"===r);"r"===r&&(c=n.mapValues(c,(function(e){return-e}))),u[a+r]=c}))}));var c=p(e,u);return d(u,c),h(u,e.graph().align)},findType1Conflicts:o,findType2Conflicts:s,addConflict:u,hasConflict:c,verticalAlignment:l,horizontalCompaction:f,alignCoordinates:d,findSmallestWidthAlignment:p,balance:h}},7873:(e,t,r)=>{"use strict";var n=r(8436),i=r(1138),a=r(3573).positionX;e.exports=function(e){(function(e){var t=i.buildLayerMatrix(e),r=e.graph().ranksep,a=0;n.forEach(t,(function(t){var i=n.max(n.map(t,(function(t){return e.node(t).height})));n.forEach(t,(function(t){e.node(t).y=a+i/2})),a+=i+r}))})(e=i.asNonCompoundGraph(e)),n.forEach(a(e),(function(t,r){e.node(r).x=t}))}},300:(e,t,r)=>{"use strict";var n=r(8436),i=r(574).Graph,a=r(6681).slack;function o(e,t){return n.forEach(e.nodes(),(function r(i){n.forEach(t.nodeEdges(i),(function(n){var o=n.v,s=i===o?n.w:o;e.hasNode(s)||a(t,n)||(e.setNode(s,{}),e.setEdge(i,s,{}),r(s))}))})),e.nodeCount()}function s(e,t){return n.minBy(t.edges(),(function(r){if(e.hasNode(r.v)!==e.hasNode(r.w))return a(t,r)}))}function u(e,t,r){n.forEach(e.nodes(),(function(e){t.node(e).rank+=r}))}e.exports=function(e){var t,r,n=new i({directed:!1}),c=e.nodes()[0],l=e.nodeCount();for(n.setNode(c,{});o(n,e)<l;)t=s(n,e),r=n.hasNode(t.v)?a(e,t):-a(e,t),u(n,e,r);return n}},8093:(e,t,r)=>{"use strict";var n=r(6681).longestPath,i=r(300),a=r(2472);e.exports=function(e){switch(e.graph().ranker){case"network-simplex":s(e);break;case"tight-tree":!function(e){n(e),i(e)}(e);break;case"longest-path":o(e);break;default:s(e)}};var o=n;function s(e){a(e)}},2472:(e,t,r)=>{"use strict";var n=r(8436),i=r(300),a=r(6681).slack,o=r(6681).longestPath,s=r(574).alg.preorder,u=r(574).alg.postorder,c=r(1138).simplify;function l(e){e=c(e),o(e);var t,r=i(e);for(d(r),f(r,e);t=m(r);)y(r,e,t,v(r,e,t))}function f(e,t){var r=u(e,e.nodes());r=r.slice(0,r.length-1),n.forEach(r,(function(r){!function(e,t,r){var n=e.node(r).parent;e.edge(r,n).cutvalue=p(e,t,r)}(e,t,r)}))}function p(e,t,r){var i=e.node(r).parent,a=!0,o=t.edge(r,i),s=0;return o||(a=!1,o=t.edge(i,r)),s=o.weight,n.forEach(t.nodeEdges(r),(function(n){var o,u,c=n.v===r,l=c?n.w:n.v;if(l!==i){var f=c===a,p=t.edge(n).weight;if(s+=f?p:-p,o=r,u=l,e.hasEdge(o,u)){var d=e.edge(r,l).cutvalue;s+=f?-d:d}}})),s}function d(e,t){arguments.length<2&&(t=e.nodes()[0]),h(e,{},1,t)}function h(e,t,r,i,a){var o=r,s=e.node(i);return t[i]=!0,n.forEach(e.neighbors(i),(function(a){n.has(t,a)||(r=h(e,t,r,a,i))})),s.low=o,s.lim=r++,a?s.parent=a:delete s.parent,r}function m(e){return n.find(e.edges(),(function(t){return e.edge(t).cutvalue<0}))}function v(e,t,r){var i=r.v,o=r.w;t.hasEdge(i,o)||(i=r.w,o=r.v);var s=e.node(i),u=e.node(o),c=s,l=!1;s.lim>u.lim&&(c=u,l=!0);var f=n.filter(t.edges(),(function(t){return l===g(0,e.node(t.v),c)&&l!==g(0,e.node(t.w),c)}));return n.minBy(f,(function(e){return a(t,e)}))}function y(e,t,r,i){var a=r.v,o=r.w;e.removeEdge(a,o),e.setEdge(i.v,i.w,{}),d(e),f(e,t),function(e,t){var r=n.find(e.nodes(),(function(e){return!t.node(e).parent})),i=s(e,r);i=i.slice(1),n.forEach(i,(function(r){var n=e.node(r).parent,i=t.edge(r,n),a=!1;i||(i=t.edge(n,r),a=!0),t.node(r).rank=t.node(n).rank+(a?i.minlen:-i.minlen)}))}(e,t)}function g(e,t,r){return r.low<=t.lim&&t.lim<=r.lim}e.exports=l,l.initLowLimValues=d,l.initCutValues=f,l.calcCutValue=p,l.leaveEdge=m,l.enterEdge=v,l.exchangeEdges=y},6681:(e,t,r)=>{"use strict";var n=r(8436);e.exports={longestPath:function(e){var t={};n.forEach(e.sources(),(function r(i){var a=e.node(i);if(n.has(t,i))return a.rank;t[i]=!0;var o=n.min(n.map(e.outEdges(i),(function(t){return r(t.w)-e.edge(t).minlen})));return o!==Number.POSITIVE_INFINITY&&null!=o||(o=0),a.rank=o}))},slack:function(e,t){return e.node(t.w).rank-e.node(t.v).rank-e.edge(t).minlen}}},1138:(e,t,r)=>{"use strict";var n=r(8436),i=r(574).Graph;function a(e,t,r,i){var a;do{a=n.uniqueId(i)}while(e.hasNode(a));return r.dummy=t,e.setNode(a,r),a}function o(e){return n.max(n.map(e.nodes(),(function(t){var r=e.node(t).rank;if(!n.isUndefined(r))return r})))}e.exports={addDummyNode:a,simplify:function(e){var t=(new i).setGraph(e.graph());return n.forEach(e.nodes(),(function(r){t.setNode(r,e.node(r))})),n.forEach(e.edges(),(function(r){var n=t.edge(r.v,r.w)||{weight:0,minlen:1},i=e.edge(r);t.setEdge(r.v,r.w,{weight:n.weight+i.weight,minlen:Math.max(n.minlen,i.minlen)})})),t},asNonCompoundGraph:function(e){var t=new i({multigraph:e.isMultigraph()}).setGraph(e.graph());return n.forEach(e.nodes(),(function(r){e.children(r).length||t.setNode(r,e.node(r))})),n.forEach(e.edges(),(function(r){t.setEdge(r,e.edge(r))})),t},successorWeights:function(e){var t=n.map(e.nodes(),(function(t){var r={};return n.forEach(e.outEdges(t),(function(t){r[t.w]=(r[t.w]||0)+e.edge(t).weight})),r}));return n.zipObject(e.nodes(),t)},predecessorWeights:function(e){var t=n.map(e.nodes(),(function(t){var r={};return n.forEach(e.inEdges(t),(function(t){r[t.v]=(r[t.v]||0)+e.edge(t).weight})),r}));return n.zipObject(e.nodes(),t)},intersectRect:function(e,t){var r,n,i=e.x,a=e.y,o=t.x-i,s=t.y-a,u=e.width/2,c=e.height/2;if(!o&&!s)throw new Error("Not possible to find intersection inside of the rectangle");return Math.abs(s)*u>Math.abs(o)*c?(s<0&&(c=-c),r=c*o/s,n=c):(o<0&&(u=-u),r=u,n=u*s/o),{x:i+r,y:a+n}},buildLayerMatrix:function(e){var t=n.map(n.range(o(e)+1),(function(){return[]}));return n.forEach(e.nodes(),(function(r){var i=e.node(r),a=i.rank;n.isUndefined(a)||(t[a][i.order]=r)})),t},normalizeRanks:function(e){var t=n.min(n.map(e.nodes(),(function(t){return e.node(t).rank})));n.forEach(e.nodes(),(function(r){var i=e.node(r);n.has(i,"rank")&&(i.rank-=t)}))},removeEmptyRanks:function(e){var t=n.min(n.map(e.nodes(),(function(t){return e.node(t).rank}))),r=[];n.forEach(e.nodes(),(function(n){var i=e.node(n).rank-t;r[i]||(r[i]=[]),r[i].push(n)}));var i=0,a=e.graph().nodeRankFactor;n.forEach(r,(function(t,r){n.isUndefined(t)&&r%a!=0?--i:i&&n.forEach(t,(function(t){e.node(t).rank+=i}))}))},addBorderNode:function(e,t,r,n){var i={width:0,height:0};return arguments.length>=4&&(i.rank=r,i.order=n),a(e,"border",i,t)},maxRank:o,partition:function(e,t){var r={lhs:[],rhs:[]};return n.forEach(e,(function(e){t(e)?r.lhs.push(e):r.rhs.push(e)})),r},time:function(e,t){var r=n.now();try{return t()}finally{console.log(e+" time: "+(n.now()-r)+"ms")}},notime:function(e,t){return t()}}},8177:e=>{e.exports="0.8.5"},3776:function(e,t,r){var n;!function(i){"use strict";var a,o,s,u=9e15,c=1e9,l="0123456789abcdef",f="2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058",p="3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789",d={precision:20,rounding:4,modulo:1,toExpNeg:-7,toExpPos:21,minE:-u,maxE:u,crypto:!1},h=!0,m="[DecimalError] ",v=m+"Invalid argument: ",y=m+"Precision limit exceeded",g=m+"crypto unavailable",x=Math.floor,b=Math.pow,w=/^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,_=/^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,N=/^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,E=/^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,M=1e7,S=f.length-1,A=p.length-1,O={name:"[object Decimal]"};function k(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+=F(r)),a+=n;(r=7-(n=(o=e[t])+"").length)&&(a+=F(r))}else if(0===o)return"0";for(;o%10==0;)o/=10;return a+o}function T(e,t,r){if(e!==~~e||e<t||e>r)throw Error(v+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=b(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)==b(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)==b(10,t-3)-1,o}function I(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]+=l.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()}O.absoluteValue=O.abs=function(){var e=new this.constructor(this);return e.s<0&&(e.s=1),z(e)},O.ceil=function(){return z(new this.constructor(this),this.e+1,2)},O.comparedTo=O.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},O.cosine=O.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=t.d.length;i<32?n=(1/Y(4,r=Math.ceil(i/3))).toString():(r=16,n="2.3283064365386962890625e-10"),e.precision+=r,t=J(e,1,t.times(n),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,X(n,r)),n.precision=e,n.rounding=t,z(2==s||3==s?r.neg():r,e,t,!0)):new n(1):new n(NaN)},O.cubeRoot=O.cbrt=function(){var e,t,r,n,i,a,o,s,u,c,l=this,f=l.constructor;if(!l.isFinite()||l.isZero())return new f(l);for(h=!1,(a=l.s*b(l.s*l,1/3))&&Math.abs(a)!=1/0?n=new f(a.toString()):(r=k(l.d),(a=((e=l.e)-r.length+1)%3)&&(r+=1==a||-2==a?"0":"00"),a=b(r,1/3),e=x((e+1)/3)-(e%3==(e<0?-1:2)),(n=new f(r=a==1/0?"5e"+e:(r=a.toExponential()).slice(0,r.indexOf("e")+1)+e)).s=l.s),o=(e=f.precision)+3;;)if(c=(u=(s=n).times(s).times(s)).plus(l),n=D(c.plus(l).times(s),c.plus(u),o+2,1),k(s.d).slice(0,o)===(r=k(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))||(z(n,e+1,1),t=!n.times(n).times(n).eq(l));break}if(!i&&(z(s,e+1,0),s.times(s).times(s).eq(l))){n=s;break}o+=4,i=1}return h=!0,z(n,e,f.rounding,t)},O.decimalPlaces=O.dp=function(){var e,t=this.d,r=NaN;if(t){if(r=7*((e=t.length-1)-x(this.e/7)),e=t[e])for(;e%10==0;e/=10)r--;r<0&&(r=0)}return r},O.dividedBy=O.div=function(e){return D(this,new this.constructor(e))},O.dividedToIntegerBy=O.divToInt=function(e){var t=this.constructor;return z(D(this,new t(e),0,1,1),t.precision,t.rounding)},O.equals=O.eq=function(e){return 0===this.cmp(e)},O.floor=function(){return z(new this.constructor(this),this.e+1,3)},O.greaterThan=O.gt=function(e){return this.cmp(e)>0},O.greaterThanOrEqualTo=O.gte=function(e){var t=this.cmp(e);return 1==t||0===t},O.hyperbolicCosine=O.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/Y(4,e=Math.ceil(i/3))).toString():(e=16,t="2.3283064365386962890625e-10"),a=J(o,1,a.times(t),new o(1),!0);for(var u,c=e,l=new o(8);c--;)u=a.times(a),a=s.minus(u.times(l.minus(u.times(l))));return z(a,o.precision=r,o.rounding=n,!0)},O.hyperbolicSine=O.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=J(a,2,i,i,!0);else{e=(e=1.4*Math.sqrt(n))>16?16:0|e,i=J(a,2,i=i.times(1/Y(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,z(i,t,r,!0)},O.hyperbolicTangent=O.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,D(r.sinh(),r.cosh(),n.precision=e,n.rounding=t)):new n(r.s)},O.inverseCosine=O.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))},O.inverseHyperbolicCosine=O.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,h=!1,r=r.times(r).minus(1).sqrt().plus(r),h=!0,n.precision=e,n.rounding=t,r.ln()):new n(r)},O.inverseHyperbolicSine=O.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,h=!1,r=r.times(r).plus(1).sqrt().plus(r),h=!0,n.precision=e,n.rounding=t,r.ln())},O.inverseHyperbolicTangent=O.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?z(new a(i),e,t,!0):(a.precision=r=n-i.e,i=D(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)},O.inverseSine=O.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)))},O.inverseTangent=O.atan=function(){var e,t,r,n,i,a,o,s,u,c=this,l=c.constructor,f=l.precision,p=l.rounding;if(c.isFinite()){if(c.isZero())return new l(c);if(c.abs().eq(1)&&f+4<=A)return(o=R(l,f+4,p).times(.25)).s=c.s,o}else{if(!c.s)return new l(NaN);if(f+4<=A)return(o=R(l,f+4,p).times(.5)).s=c.s,o}for(l.precision=s=f+10,l.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(h=!1,t=Math.ceil(s/7),n=1,u=c.times(c),o=new l(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)),h=!0,z(o,l.precision=f,l.rounding=p,!0)},O.isFinite=function(){return!!this.d},O.isInteger=O.isInt=function(){return!!this.d&&x(this.e/7)>this.d.length-2},O.isNaN=function(){return!this.s},O.isNegative=O.isNeg=function(){return this.s<0},O.isPositive=O.isPos=function(){return this.s>0},O.isZero=function(){return!!this.d&&0===this.d[0]},O.lessThan=O.lt=function(e){return this.cmp(e)<0},O.lessThanOrEqualTo=O.lte=function(e){return this.cmp(e)<1},O.logarithm=O.log=function(e){var t,r,n,i,a,o,s,u,c=this,l=c.constructor,f=l.precision,p=l.rounding;if(null==e)e=new l(10),t=!0;else{if(r=(e=new l(e)).d,e.s<0||!r||!r[0]||e.eq(1))return new l(NaN);t=e.eq(10)}if(r=c.d,c.s<0||!r||!r[0]||c.eq(1))return new l(r&&!r[0]?-1/0:1!=c.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(h=!1,o=Z(c,s=f+5),n=t?U(l,s+10):Z(e,s),C((u=D(o,n,s,1)).d,i=f,p))do{if(o=Z(c,s+=10),n=t?U(l,s+10):Z(e,s),u=D(o,n,s,1),!a){+k(u.d).slice(i+1,i+15)+1==1e14&&(u=z(u,f+1,0));break}}while(C(u.d,i+=10,p));return h=!0,z(u,f,p)},O.minus=O.sub=function(e){var t,r,n,i,a,o,s,u,c,l,f,p,d=this,m=d.constructor;if(e=new m(e),!d.d||!e.d)return d.s&&e.s?d.d?e.s=-e.s:e=new m(e.d||d.s!==e.s?d:NaN):e=new m(NaN),e;if(d.s!=e.s)return e.s=-e.s,d.plus(e);if(c=d.d,p=e.d,s=m.precision,u=m.rounding,!c[0]||!p[0]){if(p[0])e.s=-e.s;else{if(!c[0])return new m(3===u?-0:0);e=new m(d)}return h?z(e,s,u):e}if(r=x(e.e/7),l=x(d.e/7),c=c.slice(),a=l-r){for((f=a<0)?(t=c,a=-a,o=p.length):(t=p,r=l,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((f=(n=c.length)<(o=p.length))&&(o=n),n=0;n<o;n++)if(c[n]!=p[n]){f=c[n]<p[n];break}a=0}for(f&&(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]=M-1;--c[i],c[n]+=M}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=j(c,r),h?z(e,s,u):e):new m(3===u?-0:0)},O.modulo=O.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]?z(new n(r),n.precision,n.rounding):(h=!1,9==n.modulo?(t=D(r,e.abs(),0,3,1)).s*=e.s:t=D(r,e,0,n.modulo,1),t=t.times(e),h=!0,r.minus(t))},O.naturalExponential=O.exp=function(){return G(this)},O.naturalLogarithm=O.ln=function(){return Z(this)},O.negated=O.neg=function(){var e=new this.constructor(this);return e.s=-e.s,z(e)},O.plus=O.add=function(e){var t,r,n,i,a,o,s,u,c,l,f=this,p=f.constructor;if(e=new p(e),!f.d||!e.d)return f.s&&e.s?f.d||(e=new p(e.d||f.s===e.s?f:NaN)):e=new p(NaN),e;if(f.s!=e.s)return e.s=-e.s,f.minus(e);if(c=f.d,l=e.d,s=p.precision,u=p.rounding,!c[0]||!l[0])return l[0]||(e=new p(f)),h?z(e,s,u):e;if(a=x(f.e/7),n=x(e.e/7),c=c.slice(),i=a-n){for(i<0?(r=c,i=-i,o=l.length):(r=l,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=l.length)<0&&(i=o,r=l,l=c,c=r),t=0;i;)t=(c[--i]=c[i]+l[i]+t)/M|0,c[i]%=M;for(t&&(c.unshift(t),++n),o=c.length;0==c[--o];)c.pop();return e.d=c,e.e=j(c,n),h?z(e,s,u):e},O.precision=O.sd=function(e){var t,r=this;if(void 0!==e&&e!==!!e&&1!==e&&0!==e)throw Error(v+e);return r.d?(t=q(r.d),e&&r.e+1>t&&(t=r.e+1)):t=NaN,t},O.round=function(){var e=this,t=e.constructor;return z(new t(e),e.e+1,t.rounding)},O.sine=O.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 J(e,2,t,t);r=(r=1.4*Math.sqrt(n))>16?16:0|r,t=J(e,2,t=t.times(1/Y(5,r)),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,X(n,r)),n.precision=e,n.rounding=t,z(s>2?r.neg():r,e,t,!0)):new n(NaN)},O.squareRoot=O.sqrt=function(){var e,t,r,n,i,a,o=this,s=o.d,u=o.e,c=o.s,l=o.constructor;if(1!==c||!s||!s[0])return new l(!c||c<0&&(!s||s[0])?NaN:s?o:1/0);for(h=!1,0==(c=Math.sqrt(+o))||c==1/0?(((t=k(s)).length+u)%2==0&&(t+="0"),c=Math.sqrt(t),u=x((u+1)/2)-(u<0||u%2),n=new l(t=c==1/0?"5e"+u:(t=c.toExponential()).slice(0,t.indexOf("e")+1)+u)):n=new l(c.toString()),r=(u=l.precision)+3;;)if(n=(a=n).plus(D(o,a,r+2,1)).times(.5),k(a.d).slice(0,r)===(t=k(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))||(z(n,u+1,1),e=!n.times(n).eq(o));break}if(!i&&(z(a,u+1,0),a.times(a).eq(o))){n=a;break}r+=4,i=1}return h=!0,z(n,u,l.rounding,e)},O.tangent=O.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=D(r,new n(1).minus(r.times(r)).sqrt(),e+10,0),n.precision=e,n.rounding=t,z(2==s||4==s?r.neg():r,e,t,!0)):new n(NaN)},O.times=O.mul=function(e){var t,r,n,i,a,o,s,u,c,l=this,f=l.constructor,p=l.d,d=(e=new f(e)).d;if(e.s*=l.s,!(p&&p[0]&&d&&d[0]))return new f(!e.s||p&&!p[0]&&!d||d&&!d[0]&&!p?NaN:p&&d?0*e.s:e.s/0);for(r=x(l.e/7)+x(e.e/7),(u=p.length)<(c=d.length)&&(a=p,p=d,d=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]+d[n]*p[i-n-1]+t,a[i--]=s%M|0,t=s/M|0;a[i]=(a[i]+t)%M|0}for(;!a[--o];)a.pop();return t?++r:a.shift(),e.d=a,e.e=j(a,r),h?z(e,f.precision,f.rounding):e},O.toBinary=function(e,t){return Q(this,2,e,t)},O.toDecimalPlaces=O.toDP=function(e,t){var r=this,n=r.constructor;return r=new n(r),void 0===e?r:(T(e,0,c),void 0===t?t=n.rounding:T(t,0,8),z(r,e+r.e+1,t))},O.toExponential=function(e,t){var r,n=this,i=n.constructor;return void 0===e?r=B(n,!0):(T(e,0,c),void 0===t?t=i.rounding:T(t,0,8),r=B(n=z(new i(n),e+1,t),!0,e+1)),n.isNeg()&&!n.isZero()?"-"+r:r},O.toFixed=function(e,t){var r,n,i=this,a=i.constructor;return void 0===e?r=B(i):(T(e,0,c),void 0===t?t=a.rounding:T(t,0,8),r=B(n=z(new a(i),e+i.e+1,t),!1,e+n.e+1)),i.isNeg()&&!i.isZero()?"-"+r:r},O.toFraction=function(e){var t,r,n,i,a,o,s,u,c,l,f,p,d=this,m=d.d,y=d.constructor;if(!m)return new y(d);if(c=r=new y(1),n=u=new y(0),o=(a=(t=new y(n)).e=q(m)-d.e-1)%7,t.d[0]=b(10,o<0?7+o:o),null==e)e=a>0?t:c;else{if(!(s=new y(e)).isInt()||s.lt(c))throw Error(v+s);e=s.gt(t)?a>0?t:c:s}for(h=!1,s=new y(k(m)),l=y.precision,y.precision=a=7*m.length*2;f=D(s,t,0,1,1),1!=(i=r.plus(f.times(n))).cmp(e);)r=n,n=i,i=c,c=u.plus(f.times(i)),u=i,i=t,t=s.minus(f.times(i)),s=i;return i=D(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=D(c,n,a,1).minus(d).abs().cmp(D(u,r,a,1).minus(d).abs())<1?[c,n]:[u,r],y.precision=l,h=!0,p},O.toHexadecimal=O.toHex=function(e,t){return Q(this,16,e,t)},O.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:T(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]?(h=!1,r=D(r,e,0,t,1).times(e),h=!0,z(r)):(e.s=r.s,r=e),r},O.toNumber=function(){return+this},O.toOctal=function(e,t){return Q(this,8,e,t)},O.toPower=O.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(b(+s,c));if((s=new u(s)).eq(1))return s;if(n=u.precision,a=u.rounding,e.eq(1))return z(s,n,a);if((t=x(e.e/7))>=e.d.length-1&&(r=c<0?-c:c)<=9007199254740991)return i=P(u,s,r,n),e.s<0?new u(1).div(i):z(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=b(+s,c))&&isFinite(r)?new u(r+"").e:x(c*(Math.log("0."+k(s.d))/Math.LN10+s.e+1)))>u.maxE+1||t<u.minE-1?new u(t>0?o/0:0):(h=!1,u.rounding=s.s=1,r=Math.min(12,(t+"").length),(i=G(e.times(Z(s,n+r)),n)).d&&C((i=z(i,n+5,1)).d,n,a)&&(t=n+10,+k((i=z(G(e.times(Z(s,t+r)),t),t+5,1)).d).slice(n+1,n+15)+1==1e14&&(i=z(i,n+1,0))),i.s=o,h=!0,u.rounding=a,z(i,n,a))},O.toPrecision=function(e,t){var r,n=this,i=n.constructor;return void 0===e?r=B(n,n.e<=i.toExpNeg||n.e>=i.toExpPos):(T(e,1,c),void 0===t?t=i.rounding:T(t,0,8),r=B(n=z(new i(n),e,t),e<=n.e||n.e<=i.toExpNeg,e)),n.isNeg()&&!n.isZero()?"-"+r:r},O.toSignificantDigits=O.toSD=function(e,t){var r=this.constructor;return void 0===e?(e=r.precision,t=r.rounding):(T(e,1,c),void 0===t?t=r.rounding:T(t,0,8)),z(new r(this),e,t)},O.toString=function(){var e=this,t=e.constructor,r=B(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()&&!e.isZero()?"-"+r:r},O.truncated=O.trunc=function(){return z(new this.constructor(this),this.e+1,1)},O.valueOf=O.toJSON=function(){var e=this,t=e.constructor,r=B(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()?"-"+r:r};var D=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 l,f,p,d,h,m,v,y,g,b,w,_,N,E,S,A,O,k,T,C,I=n.constructor,D=n.s==i.s?1:-1,B=n.d,j=i.d;if(!(B&&B[0]&&j&&j[0]))return new I(n.s&&i.s&&(B?!j||B[0]!=j[0]:j)?B&&0==B[0]||!j?0*D:D/0:NaN);for(c?(h=1,f=n.e-i.e):(c=M,h=7,f=x(n.e/h)-x(i.e/h)),T=j.length,O=B.length,b=(g=new I(D)).d=[],p=0;j[p]==(B[p]||0);p++);if(j[p]>(B[p]||0)&&f--,null==a?(E=a=I.precision,s=I.rounding):E=u?a+(n.e-i.e)+1:a,E<0)b.push(1),m=!0;else{if(E=E/h+2|0,p=0,1==T){for(d=0,j=j[0],E++;(p<O||d)&&E--;p++)S=d*c+(B[p]||0),b[p]=S/j|0,d=S%j|0;m=d||p<O}else{for((d=c/(j[0]+1)|0)>1&&(j=e(j,d,c),B=e(B,d,c),T=j.length,O=B.length),A=T,_=(w=B.slice(0,T)).length;_<T;)w[_++]=0;(C=j.slice()).unshift(0),k=j[0],j[1]>=c/2&&++k;do{d=0,(l=t(j,w,T,_))<0?(N=w[0],T!=_&&(N=N*c+(w[1]||0)),(d=N/k|0)>1?(d>=c&&(d=c-1),1==(l=t(v=e(j,d,c),w,y=v.length,_=w.length))&&(d--,r(v,T<y?C:j,y,c))):(0==d&&(l=d=1),v=j.slice()),(y=v.length)<_&&v.unshift(0),r(w,v,_,c),-1==l&&(l=t(j,w,T,_=w.length))<1&&(d++,r(w,T<_?C:j,_,c)),_=w.length):0===l&&(d++,w=[0]),b[p++]=d,l&&w[0]?w[_++]=B[A]||0:(w=[B[A]],_=1)}while((A++<O||void 0!==w[0])&&E--);m=void 0!==w[0]}b[0]||b.shift()}if(1==h)g.e=f,o=m;else{for(p=1,d=b[0];d>=10;d/=10)p++;g.e=p+f*h-1,z(g,u?a+g.e+1:a,s,m)}return g}}();function z(e,t,r,n){var i,a,o,s,u,c,l,f,p,d=e.constructor;e:if(null!=t){if(!(f=e.d))return e;for(i=1,s=f[0];s>=10;s/=10)i++;if((a=t-i)<0)a+=7,o=t,u=(l=f[p=0])/b(10,i-o-1)%10|0;else if((p=Math.ceil((a+1)/7))>=(s=f.length)){if(!n)break e;for(;s++<=p;)f.push(0);l=u=0,i=1,o=(a%=7)-7+1}else{for(l=s=f[p],i=1;s>=10;s/=10)i++;u=(o=(a%=7)-7+i)<0?0:l/b(10,i-o-1)%10|0}if(n=n||t<0||void 0!==f[p+1]||(o<0?l:l%b(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?l/b(10,i-o):0:f[p-1])%10&1||r==(e.s<0?8:7)),t<1||!f[0])return f.length=0,c?(t-=e.e+1,f[0]=b(10,(7-t%7)%7),e.e=-t||0):f[0]=e.e=0,e;if(0==a?(f.length=p,s=1,p--):(f.length=p+1,s=b(10,7-a),f[p]=o>0?(l/b(10,i-o)%b(10,o)|0)*s:0),c)for(;;){if(0==p){for(a=1,o=f[0];o>=10;o/=10)a++;for(o=f[0]+=s,s=1;o>=10;o/=10)s++;a!=s&&(e.e++,f[0]==M&&(f[0]=1));break}if(f[p]+=s,f[p]!=M)break;f[p--]=0,s=1}for(a=f.length;0===f[--a];)f.pop()}return h&&(e.e>d.maxE?(e.d=null,e.e=NaN):e.e<d.minE&&(e.e=0,e.d=[0])),e}function B(e,t,r){if(!e.isFinite())return W(e);var n,i=e.e,a=k(e.d),o=a.length;return t?(r&&(n=r-o)>0?a=a.charAt(0)+"."+a.slice(1)+F(n):o>1&&(a=a.charAt(0)+"."+a.slice(1)),a=a+(e.e<0?"e":"e+")+e.e):i<0?(a="0."+F(-i-1)+a,r&&(n=r-o)>0&&(a+=F(n))):i>=o?(a+=F(i+1-o),r&&(n=r-i-1)>0&&(a=a+"."+F(n))):((n=i+1)<o&&(a=a.slice(0,n)+"."+a.slice(n)),r&&(n=r-o)>0&&(i+1===o&&(a+="."),a+=F(n))),a}function j(e,t){var r=e[0];for(t*=7;r>=10;r/=10)t++;return t}function U(e,t,r){if(t>S)throw h=!0,r&&(e.precision=r),Error(y);return z(new e(f),t,1,!0)}function R(e,t,r){if(t>A)throw Error(y);return z(new e(p),t,r,!0)}function q(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 F(e){for(var t="";e--;)t+="0";return t}function P(e,t,r,n){var i,a=new e(1),o=Math.ceil(n/7+4);for(h=!1;;){if(r%2&&K((a=a.times(t)).d,o)&&(i=!0),0===(r=x(r/2))){r=a.d.length-1,i&&0===a.d[r]&&++a.d[r];break}K((t=t.times(t)).d,o)}return h=!0,a}function L(e){return 1&e.d[e.d.length-1]}function H(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 G(e,t){var r,n,i,a,o,s,u,c=0,l=0,f=0,p=e.constructor,d=p.rounding,m=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?(h=!1,u=m):u=t,s=new p(.03125);e.e>-2;)e=e.times(s),f+=5;for(u+=n=Math.log(b(2,f))/Math.LN10*2+5|0,r=a=o=new p(1),p.precision=u;;){if(a=z(a.times(e),u,1),r=r.times(++l),k((s=o.plus(D(a,r,u,1))).d).slice(0,u)===k(o.d).slice(0,u)){for(i=f;i--;)o=z(o.times(o),u,1);if(null!=t)return p.precision=m,o;if(!(c<3&&C(o.d,u-n,d,c)))return z(o,p.precision=m,d,h=!0);p.precision=u+=10,r=a=s=new p(1),l=0,c++}o=s}}function Z(e,t){var r,n,i,a,o,s,u,c,l,f,p,d=1,m=e,v=m.d,y=m.constructor,g=y.rounding,x=y.precision;if(m.s<0||!v||!v[0]||!m.e&&1==v[0]&&1==v.length)return new y(v&&!v[0]?-1/0:1!=m.s?NaN:v?0:m);if(null==t?(h=!1,l=x):l=t,y.precision=l+=10,n=(r=k(v)).charAt(0),!(Math.abs(a=m.e)<15e14))return c=U(y,l+2,x).times(a+""),m=Z(new y(n+"."+r.slice(1)),l-10).plus(c),y.precision=x,null==t?z(m,x,g,h=!0):m;for(;n<7&&1!=n||1==n&&r.charAt(1)>3;)n=(r=k((m=m.times(e)).d)).charAt(0),d++;for(a=m.e,n>1?(m=new y("0."+r),a++):m=new y(n+"."+r.slice(1)),f=m,u=o=m=D(m.minus(1),m.plus(1),l,1),p=z(m.times(m),l,1),i=3;;){if(o=z(o.times(p),l,1),k((c=u.plus(D(o,new y(i),l,1))).d).slice(0,l)===k(u.d).slice(0,l)){if(u=u.times(2),0!==a&&(u=u.plus(U(y,l+2,x).times(a+""))),u=D(u,new y(d),l,1),null!=t)return y.precision=x,u;if(!C(u.d,l-10,g,s))return z(u,y.precision=x,g,h=!0);y.precision=l+=10,c=o=m=D(f.minus(1),f.plus(1),l,1),p=z(m.times(m),l,1),i=s=1}u=c,i+=2}}function W(e){return String(e.s*e.s/0)}function $(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),h&&(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 V(e,t){var r,n,i,o,s,u,c,l,f;if("Infinity"===t||"NaN"===t)return+t||(e.s=NaN),e.e=NaN,e.d=null,e;if(_.test(t))r=16,t=t.toLowerCase();else if(w.test(t))r=2;else{if(!N.test(t))throw Error(v+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=P(n,new n(r),o,2*o)),o=f=(l=I(t,r,M)).length-1;0===l[o];--o)l.pop();return o<0?new n(0*e.s):(e.e=j(l,f),e.d=l,h=!1,s&&(e=D(e,i,4*u)),c&&(e=e.times(Math.abs(c)<54?b(2,c):a.pow(2,c))),h=!0,e)}function J(e,t,r,n,i){var a,o,s,u,c=e.precision,l=Math.ceil(c/7);for(h=!1,u=r.times(r),s=new e(n);;){if(o=D(s.times(u),new e(t++*t++),c,1),s=i?n.plus(o):n.minus(o),n=D(o.times(u),new e(t++*t++),c,1),void 0!==(o=s.plus(n)).d[l]){for(a=l;o.d[a]===s.d[a]&&a--;);if(-1==a)break}a=s,s=n,n=o,o=a}return h=!0,o.d.length=l+1,o}function Y(e,t){for(var r=e;--t;)r*=e;return r}function X(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=L(r)?n?2:3:n?4:1,t;s=L(r)?n?1:4:n?3:2}return t.minus(i).abs()}function Q(e,t,r,n){var i,a,s,u,f,p,d,h,m,v=e.constructor,y=void 0!==r;if(y?(T(r,1,c),void 0===n?n=v.rounding:T(n,0,8)):(r=v.precision,n=v.rounding),e.isFinite()){for(y?(i=2,16==t?r=4*r-3:8==t&&(r=3*r-2)):i=t,(s=(d=B(e)).indexOf("."))>=0&&(d=d.replace(".",""),(m=new v(1)).e=d.length-s,m.d=I(B(m),10,i),m.e=m.d.length),a=f=(h=I(d,10,i)).length;0==h[--f];)h.pop();if(h[0]){if(s<0?a--:((e=new v(e)).d=h,e.e=a,h=(e=D(e,m,r,n,0,i)).d,a=e.e,p=o),s=h[r],u=i/2,p=p||void 0!==h[r+1],p=n<4?(void 0!==s||p)&&(0===n||n===(e.s<0?3:2)):s>u||s===u&&(4===n||p||6===n&&1&h[r-1]||n===(e.s<0?8:7)),h.length=r,p)for(;++h[--r]>i-1;)h[r]=0,r||(++a,h.unshift(1));for(f=h.length;!h[f-1];--f);for(s=0,d="";s<f;s++)d+=l.charAt(h[s]);if(y){if(f>1)if(16==t||8==t){for(s=16==t?4:3,--f;f%s;f++)d+="0";for(f=(h=I(d,i,t)).length;!h[f-1];--f);for(s=1,d="1.";s<f;s++)d+=l.charAt(h[s])}else d=d.charAt(0)+"."+d.slice(1);d=d+(a<0?"p":"p+")+a}else if(a<0){for(;++a;)d="0"+d;d="0."+d}else if(++a>f)for(a-=f;a--;)d+="0";else a<f&&(d=d.slice(0,a)+"."+d.slice(a))}else d=y?"0p+0":"0";d=(16==t?"0x":2==t?"0b":8==t?"0o":"")+d}else d=W(e);return e.s<0?"-"+d:d}function K(e,t){if(e.length>t)return e.length=t,!0}function ee(e){return new this(e).abs()}function te(e){return new this(e).acos()}function re(e){return new this(e).acosh()}function ne(e,t){return new this(e).plus(t)}function ie(e){return new this(e).asin()}function ae(e){return new this(e).asinh()}function oe(e){return new this(e).atan()}function se(e){return new this(e).atanh()}function ue(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(D(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(D(e,t,a,1)):(r=R(this,a,1).times(t.s>0?.25:.75)).s=e.s:r=new this(NaN),r}function ce(e){return new this(e).cbrt()}function le(e){return z(e=new this(e),e.e+1,2)}function fe(e){if(!e||"object"!=typeof e)throw Error(m+"Object expected");var t,r,n,i=!0===e.defaults,a=["precision",1,c,"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]=d[r]),void 0!==(n=e[r])){if(!(x(n)===n&&n>=a[t+1]&&n<=a[t+2]))throw Error(v+r+": "+n);this[r]=n}if(r="crypto",i&&(this[r]=d[r]),void 0!==(n=e[r])){if(!0!==n&&!1!==n&&0!==n&&1!==n)throw Error(v+r+": "+n);if(n){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw Error(g);this[r]=!0}else this[r]=!1}return this}function pe(e){return new this(e).cos()}function de(e){return new this(e).cosh()}function he(e,t){return new this(e).div(t)}function me(e){return new this(e).exp()}function ve(e){return z(e=new this(e),e.e+1,3)}function ye(){var e,t,r=new this(0);for(h=!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 h=!0,new this(1/0);r=t}return h=!0,r.sqrt()}function ge(e){return e instanceof a||e&&"[object Decimal]"===e.name||!1}function xe(e){return new this(e).ln()}function be(e,t){return new this(e).log(t)}function we(e){return new this(e).log(2)}function _e(e){return new this(e).log(10)}function Ne(){return H(this,arguments,"lt")}function Ee(){return H(this,arguments,"gt")}function Me(e,t){return new this(e).mod(t)}function Se(e,t){return new this(e).mul(t)}function Ae(e,t){return new this(e).pow(t)}function Oe(e){var t,r,n,i,a=0,o=new this(1),s=[];if(void 0===e?e=this.precision:T(e,1,c),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(g);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=b(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 ke(e){return z(e=new this(e),e.e+1,this.rounding)}function Te(e){return(e=new this(e)).d?e.d[0]?e.s:0*e.s:e.s||NaN}function Ce(e){return new this(e).sin()}function Ie(e){return new this(e).sinh()}function De(e){return new this(e).sqrt()}function ze(e,t){return new this(e).sub(t)}function Be(e){return new this(e).tan()}function je(e){return new this(e).tanh()}function Ue(e){return z(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,e instanceof a)return i.s=e.s,void(h?!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(h?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)):$(i,e.toString())}if("string"!==n)throw Error(v+e);return 45===(r=e.charCodeAt(0))?(e=e.slice(1),i.s=-1):(43===r&&(e=e.slice(1)),i.s=1),E.test(e)?$(i,e):V(i,e)}if(a.prototype=O,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=fe,a.clone=e,a.isDecimal=ge,a.abs=ee,a.acos=te,a.acosh=re,a.add=ne,a.asin=ie,a.asinh=ae,a.atan=oe,a.atanh=se,a.atan2=ue,a.cbrt=ce,a.ceil=le,a.cos=pe,a.cosh=de,a.div=he,a.exp=me,a.floor=ve,a.hypot=ye,a.ln=xe,a.log=be,a.log10=_e,a.log2=we,a.max=Ne,a.min=Ee,a.mod=Me,a.mul=Se,a.pow=Ae,a.random=Oe,a.round=ke,a.sign=Te,a.sin=Ce,a.sinh=Ie,a.sqrt=De,a.sub=ze,a.tan=Be,a.tanh=je,a.trunc=Ue,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}(d)).default=a.Decimal=a,f=new a(f),p=new a(p),void 0===(n=function(){return a}.call(t,r,t,e))||(e.exports=n)}()},7928:e=>{"use strict";var t=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},r={"{":"\\{","}":"\\}","\\":"\\textbackslash{}","#":"\\#",$:"\\$","%":"\\%","&":"\\&","^":"\\textasciicircum{}",_:"\\_","~":"\\textasciitilde{}"},n={"–":"\\--","—":"\\---"," ":"~","\t":"\\qquad{}","\r\n":"\\newline{}","\n":"\\newline{}"},i=function(e,r){return t({},e,r)};e.exports=function(e){for(var a=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},o=a.preserveFormatting,s=void 0!==o&&o,u=a.escapeMapFn,c=void 0===u?i:u,l=String(e),f="",p=c(t({},r),s?t({},n):{}),d=Object.keys(p),h=function(){var e=!1;d.forEach((function(t,r){e||l.length>=t.length&&l.slice(0,t.length)===t&&(f+=p[d[r]],l=l.slice(t.length,l.length),e=!0)})),e||(f+=l.slice(0,1),l=l.slice(1,l.length))};l;)h();return f}},5628:function(e,t){var r;!function(n){"use strict";var i={s:1,n:0,d:1};function a(e){function t(){var t=Error.apply(this,arguments);t.name=this.name=e,this.stack=t.stack,this.message=t.message}function r(){}return r.prototype=Error.prototype,t.prototype=new r,t}var o=p.DivisionByZero=a("DivisionByZero"),s=p.InvalidParameter=a("InvalidParameter");function u(e,t){return isNaN(e=parseInt(e,10))&&c(),e*t}function c(){throw new s}var l=function(e,t){var r,n=0,a=1,s=1,l=0,f=0,p=0,d=1,h=1,m=0,v=1,y=1,g=1,x=1e7;if(null==e);else if(void 0!==t)s=(n=e)*(a=t);else switch(typeof e){case"object":"d"in e&&"n"in e?(n=e.n,a=e.d,"s"in e&&(n*=e.s)):0 in e?(n=e[0],1 in e&&(a=e[1])):c(),s=n*a;break;case"number":if(e<0&&(s=e,e=-e),e%1==0)n=e;else if(e>0){for(e>=1&&(e/=h=Math.pow(10,Math.floor(1+Math.log(e)/Math.LN10)));v<=x&&g<=x;){if(e===(r=(m+y)/(v+g))){v+g<=x?(n=m+y,a=v+g):g>v?(n=y,a=g):(n=m,a=v);break}e>r?(m+=y,v+=g):(y+=m,g+=v),v>x?(n=y,a=g):(n=m,a=v)}n*=h}else(isNaN(e)||isNaN(t))&&(a=n=NaN);break;case"string":if(null===(v=e.match(/\d+|./g))&&c(),"-"===v[m]?(s=-1,m++):"+"===v[m]&&m++,v.length===m+1?f=u(v[m++],s):"."===v[m+1]||"."===v[m]?("."!==v[m]&&(l=u(v[m++],s)),(1+ ++m===v.length||"("===v[m+1]&&")"===v[m+3]||"'"===v[m+1]&&"'"===v[m+3])&&(f=u(v[m],s),d=Math.pow(10,v[m].length),m++),("("===v[m]&&")"===v[m+2]||"'"===v[m]&&"'"===v[m+2])&&(p=u(v[m+1],s),h=Math.pow(10,v[m+1].length)-1,m+=3)):"/"===v[m+1]||":"===v[m+1]?(f=u(v[m],s),d=u(v[m+2],1),m+=3):"/"===v[m+3]&&" "===v[m+1]&&(l=u(v[m],s),f=u(v[m+2],s),d=u(v[m+4],1),m+=5),v.length<=m){s=n=p+(a=d*h)*l+h*f;break}default:c()}if(0===a)throw new o;i.s=s<0?-1:1,i.n=Math.abs(n),i.d=Math.abs(a)};function f(e,t){if(!e)return t;if(!t)return e;for(;;){if(!(e%=t))return t;if(!(t%=e))return e}}function p(e,t){if(!(this instanceof p))return new p(e,t);l(e,t),e=p.REDUCE?f(i.d,i.n):1,this.s=i.s,this.n=i.n/e,this.d=i.d/e}p.REDUCE=1,p.prototype={s:1,n:0,d:1,abs:function(){return new p(this.n,this.d)},neg:function(){return new p(-this.s*this.n,this.d)},add:function(e,t){return l(e,t),new p(this.s*this.n*i.d+i.s*this.d*i.n,this.d*i.d)},sub:function(e,t){return l(e,t),new p(this.s*this.n*i.d-i.s*this.d*i.n,this.d*i.d)},mul:function(e,t){return l(e,t),new p(this.s*i.s*this.n*i.n,this.d*i.d)},div:function(e,t){return l(e,t),new p(this.s*i.s*this.n*i.d,this.d*i.n)},clone:function(){return new p(this)},mod:function(e,t){return isNaN(this.n)||isNaN(this.d)?new p(NaN):void 0===e?new p(this.s*this.n%this.d,1):(l(e,t),0===i.n&&0===this.d&&p(0,0),new p(this.s*(i.d*this.n)%(i.n*this.d),i.d*this.d))},gcd:function(e,t){return l(e,t),new p(f(i.n,this.n)*f(i.d,this.d),i.d*this.d)},lcm:function(e,t){return l(e,t),0===i.n&&0===this.n?new p:new p(i.n*this.n,f(i.n,this.n)*f(i.d,this.d))},ceil:function(e){return e=Math.pow(10,e||0),isNaN(this.n)||isNaN(this.d)?new p(NaN):new p(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 p(NaN):new p(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 p(NaN):new p(Math.round(e*this.s*this.n/this.d),e)},inverse:function(){return new p(this.s*this.d,this.n)},pow:function(e){return e<0?new p(Math.pow(this.s*this.d,-e),Math.pow(this.n,-e)):new p(Math.pow(this.s*this.n,e),Math.pow(this.d,e))},equals:function(e,t){return l(e,t),this.s*this.n*i.d==i.s*i.n*this.d},compare:function(e,t){l(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;var t=this.abs().toContinued();function r(e){return 1===e.length?new p(e[0]):r(e.slice(1)).inverse().add(e[0])}e=e||.001;for(var n=0;n<t.length;n++){var i=r(t.slice(0,n+1));if(i.sub(this.abs()).abs().valueOf()<e)return i.mul(this.s)}return this},divisible:function(e,t){return l(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,r=this.n,n=this.d;if(isNaN(r)||isNaN(n))return"NaN";p.REDUCE||(r/=t=f(r,n),n/=t),e=e||15;var i=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,n),a=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,n,i),o=-1===this.s?"-":"";if(o+=r/n|0,r%=n,(r*=10)&&(o+="."),i){for(var s=a;s--;)o+=r/n|0,r%=n,r*=10;for(o+="(",s=i;s--;)o+=r/n|0,r%=n,r*=10;o+=")"}else for(s=e;r&&s--;)o+=r/n|0,r%=n,r*=10;return o}},void 0===(r=function(){return p}.apply(t,[]))||(e.exports=r)}()},8282:(e,t,r)=>{var n=r(2354);e.exports={Graph:n.Graph,json:r(8974),alg:r(2440),version:n.version}},2842:(e,t,r)=>{var n=r(9126);e.exports=function(e){var t,r={},i=[];function a(i){n.has(r,i)||(r[i]=!0,t.push(i),n.each(e.successors(i),a),n.each(e.predecessors(i),a))}return n.each(e.nodes(),(function(e){t=[],a(e),t.length&&i.push(t)})),i}},3984:(e,t,r)=>{var n=r(9126);function i(e,t,r,a,o,s){n.has(a,t)||(a[t]=!0,r||s.push(t),n.each(o(t),(function(t){i(e,t,r,a,o,s)})),r&&s.push(t))}e.exports=function(e,t,r){n.isArray(t)||(t=[t]);var a=(e.isDirected()?e.successors:e.neighbors).bind(e),o=[],s={};return n.each(t,(function(t){if(!e.hasNode(t))throw new Error("Graph does not have node: "+t);i(e,t,"post"===r,s,a,o)})),o}},4847:(e,t,r)=>{var n=r(3763),i=r(9126);e.exports=function(e,t,r){return i.transform(e.nodes(),(function(i,a){i[a]=n(e,a,t,r)}),{})}},3763:(e,t,r)=>{var n=r(9126),i=r(9675);e.exports=function(e,t,r,n){return function(e,t,r,n){var a,o,s={},u=new i,c=function(e){var t=e.v!==a?e.v:e.w,n=s[t],i=r(e),c=o.distance+i;if(i<0)throw new Error("dijkstra does not allow negative edge weights. Bad edge: "+e+" Weight: "+i);c<n.distance&&(n.distance=c,n.predecessor=a,u.decrease(t,c))};for(e.nodes().forEach((function(e){var r=e===t?0:Number.POSITIVE_INFINITY;s[e]={distance:r},u.add(e,r)}));u.size()>0&&(a=u.removeMin(),(o=s[a]).distance!==Number.POSITIVE_INFINITY);)n(a).forEach(c);return s}(e,String(t),r||a,n||function(t){return e.outEdges(t)})};var a=n.constant(1)},9096:(e,t,r)=>{var n=r(9126),i=r(5023);e.exports=function(e){return n.filter(i(e),(function(t){return t.length>1||1===t.length&&e.hasEdge(t[0],t[0])}))}},8924:(e,t,r)=>{var n=r(9126);e.exports=function(e,t,r){return function(e,t,r){var n={},i=e.nodes();return i.forEach((function(e){n[e]={},n[e][e]={distance:0},i.forEach((function(t){e!==t&&(n[e][t]={distance:Number.POSITIVE_INFINITY})})),r(e).forEach((function(r){var i=r.v===e?r.w:r.v,a=t(r);n[e][i]={distance:a,predecessor:e}}))})),i.forEach((function(e){var t=n[e];i.forEach((function(r){var a=n[r];i.forEach((function(r){var n=a[e],i=t[r],o=a[r],s=n.distance+i.distance;s<o.distance&&(o.distance=s,o.predecessor=i.predecessor)}))}))})),n}(e,t||i,r||function(t){return e.outEdges(t)})};var i=n.constant(1)},2440:(e,t,r)=>{e.exports={components:r(2842),dijkstra:r(3763),dijkstraAll:r(4847),findCycles:r(9096),floydWarshall:r(8924),isAcyclic:r(2707),postorder:r(8828),preorder:r(2648),prim:r(514),tarjan:r(5023),topsort:r(2166)}},2707:(e,t,r)=>{var n=r(2166);e.exports=function(e){try{n(e)}catch(e){if(e instanceof n.CycleException)return!1;throw e}return!0}},8828:(e,t,r)=>{var n=r(3984);e.exports=function(e,t){return n(e,t,"post")}},2648:(e,t,r)=>{var n=r(3984);e.exports=function(e,t){return n(e,t,"pre")}},514:(e,t,r)=>{var n=r(9126),i=r(771),a=r(9675);e.exports=function(e,t){var r,o=new i,s={},u=new a;function c(e){var n=e.v===r?e.w:e.v,i=u.priority(n);if(void 0!==i){var a=t(e);a<i&&(s[n]=r,u.decrease(n,a))}}if(0===e.nodeCount())return o;n.each(e.nodes(),(function(e){u.add(e,Number.POSITIVE_INFINITY),o.setNode(e)})),u.decrease(e.nodes()[0],0);for(var l=!1;u.size()>0;){if(r=u.removeMin(),n.has(s,r))o.setEdge(r,s[r]);else{if(l)throw new Error("Input graph is not connected: "+e);l=!0}e.nodeEdges(r).forEach(c)}return o}},5023:(e,t,r)=>{var n=r(9126);e.exports=function(e){var t=0,r=[],i={},a=[];function o(s){var u=i[s]={onStack:!0,lowlink:t,index:t++};if(r.push(s),e.successors(s).forEach((function(e){n.has(i,e)?i[e].onStack&&(u.lowlink=Math.min(u.lowlink,i[e].index)):(o(e),u.lowlink=Math.min(u.lowlink,i[e].lowlink))})),u.lowlink===u.index){var c,l=[];do{c=r.pop(),i[c].onStack=!1,l.push(c)}while(s!==c);a.push(l)}}return e.nodes().forEach((function(e){n.has(i,e)||o(e)})),a}},2166:(e,t,r)=>{var n=r(9126);function i(e){var t={},r={},i=[];if(n.each(e.sinks(),(function o(s){if(n.has(r,s))throw new a;n.has(t,s)||(r[s]=!0,t[s]=!0,n.each(e.predecessors(s),o),delete r[s],i.push(s))})),n.size(t)!==e.nodeCount())throw new a;return i}function a(){}e.exports=i,i.CycleException=a,a.prototype=new Error},9675:(e,t,r)=>{var n=r(9126);function i(){this._arr=[],this._keyIndices={}}e.exports=i,i.prototype.size=function(){return this._arr.length},i.prototype.keys=function(){return this._arr.map((function(e){return e.key}))},i.prototype.has=function(e){return n.has(this._keyIndices,e)},i.prototype.priority=function(e){var t=this._keyIndices[e];if(void 0!==t)return this._arr[t].priority},i.prototype.min=function(){if(0===this.size())throw new Error("Queue underflow");return this._arr[0].key},i.prototype.add=function(e,t){var r=this._keyIndices;if(e=String(e),!n.has(r,e)){var i=this._arr,a=i.length;return r[e]=a,i.push({key:e,priority:t}),this._decrease(a),!0}return!1},i.prototype.removeMin=function(){this._swap(0,this._arr.length-1);var e=this._arr.pop();return delete this._keyIndices[e.key],this._heapify(0),e.key},i.prototype.decrease=function(e,t){var r=this._keyIndices[e];if(t>this._arr[r].priority)throw new Error("New priority is greater than current priority. Key: "+e+" Old: "+this._arr[r].priority+" New: "+t);this._arr[r].priority=t,this._decrease(r)},i.prototype._heapify=function(e){var t=this._arr,r=2*e,n=r+1,i=e;r<t.length&&(i=t[r].priority<t[i].priority?r:i,n<t.length&&(i=t[n].priority<t[i].priority?n:i),i!==e&&(this._swap(e,i),this._heapify(i)))},i.prototype._decrease=function(e){for(var t,r=this._arr,n=r[e].priority;0!==e&&!(r[t=e>>1].priority<n);)this._swap(e,t),e=t},i.prototype._swap=function(e,t){var r=this._arr,n=this._keyIndices,i=r[e],a=r[t];r[e]=a,r[t]=i,n[a.key]=e,n[i.key]=t}},771:(e,t,r)=>{"use strict";var n=r(9126);e.exports=a;var i="\0";function a(e){this._isDirected=!n.has(e,"directed")||e.directed,this._isMultigraph=!!n.has(e,"multigraph")&&e.multigraph,this._isCompound=!!n.has(e,"compound")&&e.compound,this._label=void 0,this._defaultNodeLabelFn=n.constant(void 0),this._defaultEdgeLabelFn=n.constant(void 0),this._nodes={},this._isCompound&&(this._parent={},this._children={},this._children["\0"]={}),this._in={},this._preds={},this._out={},this._sucs={},this._edgeObjs={},this._edgeLabels={}}function o(e,t){e[t]?e[t]++:e[t]=1}function s(e,t){--e[t]||delete e[t]}function u(e,t,r,i){var a=""+t,o=""+r;if(!e&&a>o){var s=a;a=o,o=s}return a+"
"+o+"
"+(n.isUndefined(i)?"\0":i)}function c(e,t,r,n){var i=""+t,a=""+r;if(!e&&i>a){var o=i;i=a,a=o}var s={v:i,w:a};return n&&(s.name=n),s}function l(e,t){return u(e,t.v,t.w,t.name)}a.prototype._nodeCount=0,a.prototype._edgeCount=0,a.prototype.isDirected=function(){return this._isDirected},a.prototype.isMultigraph=function(){return this._isMultigraph},a.prototype.isCompound=function(){return this._isCompound},a.prototype.setGraph=function(e){return this._label=e,this},a.prototype.graph=function(){return this._label},a.prototype.setDefaultNodeLabel=function(e){return n.isFunction(e)||(e=n.constant(e)),this._defaultNodeLabelFn=e,this},a.prototype.nodeCount=function(){return this._nodeCount},a.prototype.nodes=function(){return n.keys(this._nodes)},a.prototype.sources=function(){var e=this;return n.filter(this.nodes(),(function(t){return n.isEmpty(e._in[t])}))},a.prototype.sinks=function(){var e=this;return n.filter(this.nodes(),(function(t){return n.isEmpty(e._out[t])}))},a.prototype.setNodes=function(e,t){var r=arguments,i=this;return n.each(e,(function(e){r.length>1?i.setNode(e,t):i.setNode(e)})),this},a.prototype.setNode=function(e,t){return n.has(this._nodes,e)?(arguments.length>1&&(this._nodes[e]=t),this):(this._nodes[e]=arguments.length>1?t:this._defaultNodeLabelFn(e),this._isCompound&&(this._parent[e]=i,this._children[e]={},this._children["\0"][e]=!0),this._in[e]={},this._preds[e]={},this._out[e]={},this._sucs[e]={},++this._nodeCount,this)},a.prototype.node=function(e){return this._nodes[e]},a.prototype.hasNode=function(e){return n.has(this._nodes,e)},a.prototype.removeNode=function(e){var t=this;if(n.has(this._nodes,e)){var r=function(e){t.removeEdge(t._edgeObjs[e])};delete this._nodes[e],this._isCompound&&(this._removeFromParentsChildList(e),delete this._parent[e],n.each(this.children(e),(function(e){t.setParent(e)})),delete this._children[e]),n.each(n.keys(this._in[e]),r),delete this._in[e],delete this._preds[e],n.each(n.keys(this._out[e]),r),delete this._out[e],delete this._sucs[e],--this._nodeCount}return this},a.prototype.setParent=function(e,t){if(!this._isCompound)throw new Error("Cannot set parent in a non-compound graph");if(n.isUndefined(t))t=i;else{for(var r=t+="";!n.isUndefined(r);r=this.parent(r))if(r===e)throw new Error("Setting "+t+" as parent of "+e+" would create a cycle");this.setNode(t)}return this.setNode(e),this._removeFromParentsChildList(e),this._parent[e]=t,this._children[t][e]=!0,this},a.prototype._removeFromParentsChildList=function(e){delete this._children[this._parent[e]][e]},a.prototype.parent=function(e){if(this._isCompound){var t=this._parent[e];if(t!==i)return t}},a.prototype.children=function(e){if(n.isUndefined(e)&&(e=i),this._isCompound){var t=this._children[e];if(t)return n.keys(t)}else{if(e===i)return this.nodes();if(this.hasNode(e))return[]}},a.prototype.predecessors=function(e){var t=this._preds[e];if(t)return n.keys(t)},a.prototype.successors=function(e){var t=this._sucs[e];if(t)return n.keys(t)},a.prototype.neighbors=function(e){var t=this.predecessors(e);if(t)return n.union(t,this.successors(e))},a.prototype.isLeaf=function(e){return 0===(this.isDirected()?this.successors(e):this.neighbors(e)).length},a.prototype.filterNodes=function(e){var t=new this.constructor({directed:this._isDirected,multigraph:this._isMultigraph,compound:this._isCompound});t.setGraph(this.graph());var r=this;n.each(this._nodes,(function(r,n){e(n)&&t.setNode(n,r)})),n.each(this._edgeObjs,(function(e){t.hasNode(e.v)&&t.hasNode(e.w)&&t.setEdge(e,r.edge(e))}));var i={};function a(e){var n=r.parent(e);return void 0===n||t.hasNode(n)?(i[e]=n,n):n in i?i[n]:a(n)}return this._isCompound&&n.each(t.nodes(),(function(e){t.setParent(e,a(e))})),t},a.prototype.setDefaultEdgeLabel=function(e){return n.isFunction(e)||(e=n.constant(e)),this._defaultEdgeLabelFn=e,this},a.prototype.edgeCount=function(){return this._edgeCount},a.prototype.edges=function(){return n.values(this._edgeObjs)},a.prototype.setPath=function(e,t){var r=this,i=arguments;return n.reduce(e,(function(e,n){return i.length>1?r.setEdge(e,n,t):r.setEdge(e,n),n})),this},a.prototype.setEdge=function(){var e,t,r,i,a=!1,s=arguments[0];"object"==typeof s&&null!==s&&"v"in s?(e=s.v,t=s.w,r=s.name,2===arguments.length&&(i=arguments[1],a=!0)):(e=s,t=arguments[1],r=arguments[3],arguments.length>2&&(i=arguments[2],a=!0)),e=""+e,t=""+t,n.isUndefined(r)||(r=""+r);var l=u(this._isDirected,e,t,r);if(n.has(this._edgeLabels,l))return a&&(this._edgeLabels[l]=i),this;if(!n.isUndefined(r)&&!this._isMultigraph)throw new Error("Cannot set a named edge when isMultigraph = false");this.setNode(e),this.setNode(t),this._edgeLabels[l]=a?i:this._defaultEdgeLabelFn(e,t,r);var f=c(this._isDirected,e,t,r);return e=f.v,t=f.w,Object.freeze(f),this._edgeObjs[l]=f,o(this._preds[t],e),o(this._sucs[e],t),this._in[t][l]=f,this._out[e][l]=f,this._edgeCount++,this},a.prototype.edge=function(e,t,r){var n=1===arguments.length?l(this._isDirected,arguments[0]):u(this._isDirected,e,t,r);return this._edgeLabels[n]},a.prototype.hasEdge=function(e,t,r){var i=1===arguments.length?l(this._isDirected,arguments[0]):u(this._isDirected,e,t,r);return n.has(this._edgeLabels,i)},a.prototype.removeEdge=function(e,t,r){var n=1===arguments.length?l(this._isDirected,arguments[0]):u(this._isDirected,e,t,r),i=this._edgeObjs[n];return i&&(e=i.v,t=i.w,delete this._edgeLabels[n],delete this._edgeObjs[n],s(this._preds[t],e),s(this._sucs[e],t),delete this._in[t][n],delete this._out[e][n],this._edgeCount--),this},a.prototype.inEdges=function(e,t){var r=this._in[e];if(r){var i=n.values(r);return t?n.filter(i,(function(e){return e.v===t})):i}},a.prototype.outEdges=function(e,t){var r=this._out[e];if(r){var i=n.values(r);return t?n.filter(i,(function(e){return e.w===t})):i}},a.prototype.nodeEdges=function(e,t){var r=this.inEdges(e,t);if(r)return r.concat(this.outEdges(e,t))}},2354:(e,t,r)=>{e.exports={Graph:r(771),version:r(9631)}},8974:(e,t,r)=>{var n=r(9126),i=r(771);function a(e){return n.map(e.nodes(),(function(t){var r=e.node(t),i=e.parent(t),a={v:t};return n.isUndefined(r)||(a.value=r),n.isUndefined(i)||(a.parent=i),a}))}function o(e){return n.map(e.edges(),(function(t){var r=e.edge(t),i={v:t.v,w:t.w};return n.isUndefined(t.name)||(i.name=t.name),n.isUndefined(r)||(i.value=r),i}))}e.exports={write:function(e){var t={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:a(e),edges:o(e)};return n.isUndefined(e.graph())||(t.value=n.clone(e.graph())),t},read:function(e){var t=new i(e.options).setGraph(e.value);return n.each(e.nodes,(function(e){t.setNode(e.v,e.value),e.parent&&t.setParent(e.v,e.parent)})),n.each(e.edges,(function(e){t.setEdge({v:e.v,w:e.w,name:e.name},e.value)})),t}}},9126:(e,t,r)=>{var n;try{n={clone:r(6678),constant:r(5703),each:r(6073),filter:r(3105),has:r(8721),isArray:r(1469),isEmpty:r(1609),isFunction:r(3560),isUndefined:r(2353),keys:r(3674),map:r(5161),reduce:r(4061),size:r(4238),transform:r(8718),union:r(3386),values:r(2628)}}catch(e){}n||(n=window._),e.exports=n},9631:e=>{e.exports="2.1.8"},3228:e=>{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/,l=function(t){return e.insensitive&&(""+t).toLowerCase()||""+t},f=l(t).replace(o,"")||"",p=l(r).replace(o,"")||"",d=f.replace(a,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),h=p.replace(a,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),m=parseInt(f.match(u),16)||1!==d.length&&f.match(s)&&Date.parse(f),v=parseInt(p.match(u),16)||m&&p.match(s)&&Date.parse(p)||null;if(v){if(m<v)return-1;if(m>v)return 1}for(var y=0,g=Math.max(d.length,h.length);y<g;y++){if(n=!(d[y]||"").match(c)&&parseFloat(d[y])||d[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}},8552:(e,t,r)=>{var n=r(852)(r(5639),"DataView");e.exports=n},1989:(e,t,r)=>{var n=r(1789),i=r(401),a=r(7667),o=r(1327),s=r(1866);function u(e){var t=-1,r=null==e?0:e.length;for(this.clear();++t<r;){var n=e[t];this.set(n[0],n[1])}}u.prototype.clear=n,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,e.exports=u},8407:(e,t,r)=>{var n=r(7040),i=r(4125),a=r(2117),o=r(7518),s=r(4705);function u(e){var t=-1,r=null==e?0:e.length;for(this.clear();++t<r;){var n=e[t];this.set(n[0],n[1])}}u.prototype.clear=n,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,e.exports=u},7071:(e,t,r)=>{var n=r(852)(r(5639),"Map");e.exports=n},3369:(e,t,r)=>{var n=r(4785),i=r(1285),a=r(6e3),o=r(9916),s=r(5265);function u(e){var t=-1,r=null==e?0:e.length;for(this.clear();++t<r;){var n=e[t];this.set(n[0],n[1])}}u.prototype.clear=n,u.prototype.delete=i,u.prototype.get=a,u.prototype.has=o,u.prototype.set=s,e.exports=u},3818:(e,t,r)=>{var n=r(852)(r(5639),"Promise");e.exports=n},8525:(e,t,r)=>{var n=r(852)(r(5639),"Set");e.exports=n},8668:(e,t,r)=>{var n=r(3369),i=r(619),a=r(2385);function o(e){var t=-1,r=null==e?0:e.length;for(this.__data__=new n;++t<r;)this.add(e[t])}o.prototype.add=o.prototype.push=i,o.prototype.has=a,e.exports=o},6384:(e,t,r)=>{var n=r(8407),i=r(7465),a=r(3779),o=r(7599),s=r(4758),u=r(4309);function c(e){var t=this.__data__=new n(e);this.size=t.size}c.prototype.clear=i,c.prototype.delete=a,c.prototype.get=o,c.prototype.has=s,c.prototype.set=u,e.exports=c},2705:(e,t,r)=>{var n=r(5639).Symbol;e.exports=n},1149:(e,t,r)=>{var n=r(5639).Uint8Array;e.exports=n},577:(e,t,r)=>{var n=r(852)(r(5639),"WeakMap");e.exports=n},6874:e=>{e.exports=function(e,t,r){switch(r.length){case 0:return e.call(t);case 1:return e.call(t,r[0]);case 2:return e.call(t,r[0],r[1]);case 3:return e.call(t,r[0],r[1],r[2])}return e.apply(t,r)}},7412:e=>{e.exports=function(e,t){for(var r=-1,n=null==e?0:e.length;++r<n&&!1!==t(e[r],r,e););return e}},4963:e=>{e.exports=function(e,t){for(var r=-1,n=null==e?0:e.length,i=0,a=[];++r<n;){var o=e[r];t(o,r,e)&&(a[i++]=o)}return a}},7443:(e,t,r)=>{var n=r(2118);e.exports=function(e,t){return!(null==e||!e.length)&&n(e,t,0)>-1}},1196:e=>{e.exports=function(e,t,r){for(var n=-1,i=null==e?0:e.length;++n<i;)if(r(t,e[n]))return!0;return!1}},4636:(e,t,r)=>{var n=r(2545),i=r(5694),a=r(1469),o=r(4144),s=r(5776),u=r(6719),c=Object.prototype.hasOwnProperty;e.exports=function(e,t){var r=a(e),l=!r&&i(e),f=!r&&!l&&o(e),p=!r&&!l&&!f&&u(e),d=r||l||f||p,h=d?n(e.length,String):[],m=h.length;for(var v in e)!t&&!c.call(e,v)||d&&("length"==v||f&&("offset"==v||"parent"==v)||p&&("buffer"==v||"byteLength"==v||"byteOffset"==v)||s(v,m))||h.push(v);return h}},9932:e=>{e.exports=function(e,t){for(var r=-1,n=null==e?0:e.length,i=Array(n);++r<n;)i[r]=t(e[r],r,e);return i}},2488:e=>{e.exports=function(e,t){for(var r=-1,n=t.length,i=e.length;++r<n;)e[i+r]=t[r];return e}},2663:e=>{e.exports=function(e,t,r,n){var i=-1,a=null==e?0:e.length;for(n&&a&&(r=e[++i]);++i<a;)r=t(r,e[i],i,e);return r}},2908:e=>{e.exports=function(e,t){for(var r=-1,n=null==e?0:e.length;++r<n;)if(t(e[r],r,e))return!0;return!1}},8983:(e,t,r)=>{var n=r(371)("length");e.exports=n},6556:(e,t,r)=>{var n=r(9465),i=r(7813);e.exports=function(e,t,r){(void 0!==r&&!i(e[t],r)||void 0===r&&!(t in e))&&n(e,t,r)}},4865:(e,t,r)=>{var n=r(9465),i=r(7813),a=Object.prototype.hasOwnProperty;e.exports=function(e,t,r){var o=e[t];a.call(e,t)&&i(o,r)&&(void 0!==r||t in e)||n(e,t,r)}},8470:(e,t,r)=>{var n=r(7813);e.exports=function(e,t){for(var r=e.length;r--;)if(n(e[r][0],t))return r;return-1}},4037:(e,t,r)=>{var n=r(8363),i=r(3674);e.exports=function(e,t){return e&&n(t,i(t),e)}},3886:(e,t,r)=>{var n=r(8363),i=r(1704);e.exports=function(e,t){return e&&n(t,i(t),e)}},9465:(e,t,r)=>{var n=r(8777);e.exports=function(e,t,r){"__proto__"==t&&n?n(e,t,{configurable:!0,enumerable:!0,value:r,writable:!0}):e[t]=r}},5990:(e,t,r)=>{var n=r(6384),i=r(7412),a=r(4865),o=r(4037),s=r(3886),u=r(4626),c=r(278),l=r(8805),f=r(1911),p=r(8234),d=r(6904),h=r(4160),m=r(3824),v=r(9148),y=r(8517),g=r(1469),x=r(4144),b=r(6688),w=r(3218),_=r(2928),N=r(3674),E=r(1704),M="[object Arguments]",S="[object Function]",A="[object Object]",O={};O[M]=O["[object Array]"]=O["[object ArrayBuffer]"]=O["[object DataView]"]=O["[object Boolean]"]=O["[object Date]"]=O["[object Float32Array]"]=O["[object Float64Array]"]=O["[object Int8Array]"]=O["[object Int16Array]"]=O["[object Int32Array]"]=O["[object Map]"]=O["[object Number]"]=O[A]=O["[object RegExp]"]=O["[object Set]"]=O["[object String]"]=O["[object Symbol]"]=O["[object Uint8Array]"]=O["[object Uint8ClampedArray]"]=O["[object Uint16Array]"]=O["[object Uint32Array]"]=!0,O["[object Error]"]=O[S]=O["[object WeakMap]"]=!1,e.exports=function e(t,r,k,T,C,I){var D,z=1&r,B=2&r,j=4&r;if(k&&(D=C?k(t,T,C,I):k(t)),void 0!==D)return D;if(!w(t))return t;var U=g(t);if(U){if(D=m(t),!z)return c(t,D)}else{var R=h(t),q=R==S||"[object GeneratorFunction]"==R;if(x(t))return u(t,z);if(R==A||R==M||q&&!C){if(D=B||q?{}:y(t),!z)return B?f(t,s(D,t)):l(t,o(D,t))}else{if(!O[R])return C?t:{};D=v(t,R,z)}}I||(I=new n);var F=I.get(t);if(F)return F;I.set(t,D),_(t)?t.forEach((function(n){D.add(e(n,r,k,n,t,I))})):b(t)&&t.forEach((function(n,i){D.set(i,e(n,r,k,i,t,I))}));var P=U?void 0:(j?B?d:p:B?E:N)(t);return i(P||t,(function(n,i){P&&(n=t[i=n]),a(D,i,e(n,r,k,i,t,I))})),D}},3118:(e,t,r)=>{var n=r(3218),i=Object.create,a=function(){function e(){}return function(t){if(!n(t))return{};if(i)return i(t);e.prototype=t;var r=new e;return e.prototype=void 0,r}}();e.exports=a},9881:(e,t,r)=>{var n=r(7816),i=r(9291)(n);e.exports=i},6029:(e,t,r)=>{var n=r(3448);e.exports=function(e,t,r){for(var i=-1,a=e.length;++i<a;){var o=e[i],s=t(o);if(null!=s&&(void 0===u?s==s&&!n(s):r(s,u)))var u=s,c=o}return c}},760:(e,t,r)=>{var n=r(9881);e.exports=function(e,t){var r=[];return n(e,(function(e,n,i){t(e,n,i)&&r.push(e)})),r}},1848:e=>{e.exports=function(e,t,r,n){for(var i=e.length,a=r+(n?1:-1);n?a--:++a<i;)if(t(e[a],a,e))return a;return-1}},1078:(e,t,r)=>{var n=r(2488),i=r(7285);e.exports=function e(t,r,a,o,s){var u=-1,c=t.length;for(a||(a=i),s||(s=[]);++u<c;){var l=t[u];r>0&&a(l)?r>1?e(l,r-1,a,o,s):n(s,l):o||(s[s.length]=l)}return s}},8483:(e,t,r)=>{var n=r(5063)();e.exports=n},7816:(e,t,r)=>{var n=r(8483),i=r(3674);e.exports=function(e,t){return e&&n(e,t,i)}},7786:(e,t,r)=>{var n=r(1811),i=r(327);e.exports=function(e,t){for(var r=0,a=(t=n(t,e)).length;null!=e&&r<a;)e=e[i(t[r++])];return r&&r==a?e:void 0}},8866:(e,t,r)=>{var n=r(2488),i=r(1469);e.exports=function(e,t,r){var a=t(e);return i(e)?a:n(a,r(e))}},4239:(e,t,r)=>{var n=r(2705),i=r(9607),a=r(2333),o=n?n.toStringTag:void 0;e.exports=function(e){return null==e?void 0===e?"[object Undefined]":"[object Null]":o&&o in Object(e)?i(e):a(e)}},3325:e=>{e.exports=function(e,t){return e>t}},8565:e=>{var t=Object.prototype.hasOwnProperty;e.exports=function(e,r){return null!=e&&t.call(e,r)}},13:e=>{e.exports=function(e,t){return null!=e&&t in Object(e)}},2118:(e,t,r)=>{var n=r(1848),i=r(2722),a=r(2351);e.exports=function(e,t,r){return t==t?a(e,t,r):n(e,i,r)}},9454:(e,t,r)=>{var n=r(4239),i=r(7005);e.exports=function(e){return i(e)&&"[object Arguments]"==n(e)}},939:(e,t,r)=>{var n=r(2492),i=r(7005);e.exports=function e(t,r,a,o,s){return t===r||(null==t||null==r||!i(t)&&!i(r)?t!=t&&r!=r:n(t,r,a,o,e,s))}},2492:(e,t,r)=>{var n=r(6384),i=r(7114),a=r(8351),o=r(6096),s=r(4160),u=r(1469),c=r(4144),l=r(6719),f="[object Arguments]",p="[object Array]",d="[object Object]",h=Object.prototype.hasOwnProperty;e.exports=function(e,t,r,m,v,y){var g=u(e),x=u(t),b=g?p:s(e),w=x?p:s(t),_=(b=b==f?d:b)==d,N=(w=w==f?d:w)==d,E=b==w;if(E&&c(e)){if(!c(t))return!1;g=!0,_=!1}if(E&&!_)return y||(y=new n),g||l(e)?i(e,t,r,m,v,y):a(e,t,b,r,m,v,y);if(!(1&r)){var M=_&&h.call(e,"__wrapped__"),S=N&&h.call(t,"__wrapped__");if(M||S){var A=M?e.value():e,O=S?t.value():t;return y||(y=new n),v(A,O,r,m,y)}}return!!E&&(y||(y=new n),o(e,t,r,m,v,y))}},5588:(e,t,r)=>{var n=r(4160),i=r(7005);e.exports=function(e){return i(e)&&"[object Map]"==n(e)}},2958:(e,t,r)=>{var n=r(6384),i=r(939);e.exports=function(e,t,r,a){var o=r.length,s=o,u=!a;if(null==e)return!s;for(e=Object(e);o--;){var c=r[o];if(u&&c[2]?c[1]!==e[c[0]]:!(c[0]in e))return!1}for(;++o<s;){var l=(c=r[o])[0],f=e[l],p=c[1];if(u&&c[2]){if(void 0===f&&!(l in e))return!1}else{var d=new n;if(a)var h=a(f,p,l,e,t,d);if(!(void 0===h?i(p,f,3,a,d):h))return!1}}return!0}},2722:e=>{e.exports=function(e){return e!=e}},8458:(e,t,r)=>{var n=r(3560),i=r(5346),a=r(3218),o=r(346),s=/^\[object .+?Constructor\]$/,u=Function.prototype,c=Object.prototype,l=u.toString,f=c.hasOwnProperty,p=RegExp("^"+l.call(f).replace(/[\\^$.*+?()[\]{}|]/g,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$");e.exports=function(e){return!(!a(e)||i(e))&&(n(e)?p:s).test(o(e))}},9221:(e,t,r)=>{var n=r(4160),i=r(7005);e.exports=function(e){return i(e)&&"[object Set]"==n(e)}},8749:(e,t,r)=>{var n=r(4239),i=r(1780),a=r(7005),o={};o["[object Float32Array]"]=o["[object Float64Array]"]=o["[object Int8Array]"]=o["[object Int16Array]"]=o["[object Int32Array]"]=o["[object Uint8Array]"]=o["[object Uint8ClampedArray]"]=o["[object Uint16Array]"]=o["[object Uint32Array]"]=!0,o["[object Arguments]"]=o["[object Array]"]=o["[object ArrayBuffer]"]=o["[object Boolean]"]=o["[object DataView]"]=o["[object Date]"]=o["[object Error]"]=o["[object Function]"]=o["[object Map]"]=o["[object Number]"]=o["[object Object]"]=o["[object RegExp]"]=o["[object Set]"]=o["[object String]"]=o["[object WeakMap]"]=!1,e.exports=function(e){return a(e)&&i(e.length)&&!!o[n(e)]}},7206:(e,t,r)=>{var n=r(1573),i=r(6432),a=r(6557),o=r(1469),s=r(9601);e.exports=function(e){return"function"==typeof e?e:null==e?a:"object"==typeof e?o(e)?i(e[0],e[1]):n(e):s(e)}},280:(e,t,r)=>{var n=r(5726),i=r(6916),a=Object.prototype.hasOwnProperty;e.exports=function(e){if(!n(e))return i(e);var t=[];for(var r in Object(e))a.call(e,r)&&"constructor"!=r&&t.push(r);return t}},313:(e,t,r)=>{var n=r(3218),i=r(5726),a=r(3498),o=Object.prototype.hasOwnProperty;e.exports=function(e){if(!n(e))return a(e);var t=i(e),r=[];for(var s in e)("constructor"!=s||!t&&o.call(e,s))&&r.push(s);return r}},433:e=>{e.exports=function(e,t){return e<t}},9199:(e,t,r)=>{var n=r(9881),i=r(8612);e.exports=function(e,t){var r=-1,a=i(e)?Array(e.length):[];return n(e,(function(e,n,i){a[++r]=t(e,n,i)})),a}},1573:(e,t,r)=>{var n=r(2958),i=r(1499),a=r(2634);e.exports=function(e){var t=i(e);return 1==t.length&&t[0][2]?a(t[0][0],t[0][1]):function(r){return r===e||n(r,e,t)}}},6432:(e,t,r)=>{var n=r(939),i=r(7361),a=r(9095),o=r(5403),s=r(9162),u=r(2634),c=r(327);e.exports=function(e,t){return o(e)&&s(t)?u(c(e),t):function(r){var o=i(r,e);return void 0===o&&o===t?a(r,e):n(t,o,3)}}},2980:(e,t,r)=>{var n=r(6384),i=r(6556),a=r(8483),o=r(9783),s=r(3218),u=r(1704),c=r(6390);e.exports=function e(t,r,l,f,p){t!==r&&a(r,(function(a,u){if(p||(p=new n),s(a))o(t,r,u,l,e,f,p);else{var d=f?f(c(t,u),a,u+"",t,r,p):void 0;void 0===d&&(d=a),i(t,u,d)}}),u)}},9783:(e,t,r)=>{var n=r(6556),i=r(4626),a=r(7133),o=r(278),s=r(8517),u=r(5694),c=r(1469),l=r(9246),f=r(4144),p=r(3560),d=r(3218),h=r(8630),m=r(6719),v=r(6390),y=r(3678);e.exports=function(e,t,r,g,x,b,w){var _=v(e,r),N=v(t,r),E=w.get(N);if(E)n(e,r,E);else{var M=b?b(_,N,r+"",e,t,w):void 0,S=void 0===M;if(S){var A=c(N),O=!A&&f(N),k=!A&&!O&&m(N);M=N,A||O||k?c(_)?M=_:l(_)?M=o(_):O?(S=!1,M=i(N,!0)):k?(S=!1,M=a(N,!0)):M=[]:h(N)||u(N)?(M=_,u(_)?M=y(_):d(_)&&!p(_)||(M=s(N))):S=!1}S&&(w.set(N,M),x(M,N,g,b,w),w.delete(N)),n(e,r,M)}}},9556:(e,t,r)=>{var n=r(9932),i=r(7786),a=r(7206),o=r(9199),s=r(1131),u=r(1717),c=r(5022),l=r(6557),f=r(1469);e.exports=function(e,t,r){t=t.length?n(t,(function(e){return f(e)?function(t){return i(t,1===e.length?e[0]:e)}:e})):[l];var p=-1;t=n(t,u(a));var d=o(e,(function(e,r,i){return{criteria:n(t,(function(t){return t(e)})),index:++p,value:e}}));return s(d,(function(e,t){return c(e,t,r)}))}},5970:(e,t,r)=>{var n=r(3012),i=r(9095);e.exports=function(e,t){return n(e,t,(function(t,r){return i(e,r)}))}},3012:(e,t,r)=>{var n=r(7786),i=r(611),a=r(1811);e.exports=function(e,t,r){for(var o=-1,s=t.length,u={};++o<s;){var c=t[o],l=n(e,c);r(l,c)&&i(u,a(c,e),l)}return u}},371:e=>{e.exports=function(e){return function(t){return null==t?void 0:t[e]}}},9152:(e,t,r)=>{var n=r(7786);e.exports=function(e){return function(t){return n(t,e)}}},98:e=>{var t=Math.ceil,r=Math.max;e.exports=function(e,n,i,a){for(var o=-1,s=r(t((n-e)/(i||1)),0),u=Array(s);s--;)u[a?s:++o]=e,e+=i;return u}},107:e=>{e.exports=function(e,t,r,n,i){return i(e,(function(e,i,a){r=n?(n=!1,e):t(r,e,i,a)})),r}},5976:(e,t,r)=>{var n=r(6557),i=r(5357),a=r(61);e.exports=function(e,t){return a(i(e,t,n),e+"")}},611:(e,t,r)=>{var n=r(4865),i=r(1811),a=r(5776),o=r(3218),s=r(327);e.exports=function(e,t,r,u){if(!o(e))return e;for(var c=-1,l=(t=i(t,e)).length,f=l-1,p=e;null!=p&&++c<l;){var d=s(t[c]),h=r;if("__proto__"===d||"constructor"===d||"prototype"===d)return e;if(c!=f){var m=p[d];void 0===(h=u?u(m,d,p):void 0)&&(h=o(m)?m:a(t[c+1])?[]:{})}n(p,d,h),p=p[d]}return e}},6560:(e,t,r)=>{var n=r(5703),i=r(8777),a=r(6557),o=i?function(e,t){return i(e,"toString",{configurable:!0,enumerable:!1,value:n(t),writable:!0})}:a;e.exports=o},1131:e=>{e.exports=function(e,t){var r=e.length;for(e.sort(t);r--;)e[r]=e[r].value;return e}},2545:e=>{e.exports=function(e,t){for(var r=-1,n=Array(e);++r<e;)n[r]=t(r);return n}},531:(e,t,r)=>{var n=r(2705),i=r(9932),a=r(1469),o=r(3448),s=n?n.prototype:void 0,u=s?s.toString:void 0;e.exports=function e(t){if("string"==typeof t)return t;if(a(t))return i(t,e)+"";if(o(t))return u?u.call(t):"";var r=t+"";return"0"==r&&1/t==-1/0?"-0":r}},7561:(e,t,r)=>{var n=r(7990),i=/^\s+/;e.exports=function(e){return e?e.slice(0,n(e)+1).replace(i,""):e}},1717:e=>{e.exports=function(e){return function(t){return e(t)}}},5652:(e,t,r)=>{var n=r(8668),i=r(7443),a=r(1196),o=r(4757),s=r(3593),u=r(1814);e.exports=function(e,t,r){var c=-1,l=i,f=e.length,p=!0,d=[],h=d;if(r)p=!1,l=a;else if(f>=200){var m=t?null:s(e);if(m)return u(m);p=!1,l=o,h=new n}else h=t?[]:d;e:for(;++c<f;){var v=e[c],y=t?t(v):v;if(v=r||0!==v?v:0,p&&y==y){for(var g=h.length;g--;)if(h[g]===y)continue e;t&&h.push(y),d.push(v)}else l(h,y,r)||(h!==d&&h.push(y),d.push(v))}return d}},7415:(e,t,r)=>{var n=r(9932);e.exports=function(e,t){return n(t,(function(t){return e[t]}))}},1757:e=>{e.exports=function(e,t,r){for(var n=-1,i=e.length,a=t.length,o={};++n<i;){var s=n<a?t[n]:void 0;r(o,e[n],s)}return o}},4757:e=>{e.exports=function(e,t){return e.has(t)}},4290:(e,t,r)=>{var n=r(6557);e.exports=function(e){return"function"==typeof e?e:n}},1811:(e,t,r)=>{var n=r(1469),i=r(5403),a=r(5514),o=r(9833);e.exports=function(e,t){return n(e)?e:i(e,t)?[e]:a(o(e))}},4318:(e,t,r)=>{var n=r(1149);e.exports=function(e){var t=new e.constructor(e.byteLength);return new n(t).set(new n(e)),t}},4626:(e,t,r)=>{e=r.nmd(e);var n=r(5639),i=t&&!t.nodeType&&t,a=i&&e&&!e.nodeType&&e,o=a&&a.exports===i?n.Buffer:void 0,s=o?o.allocUnsafe:void 0;e.exports=function(e,t){if(t)return e.slice();var r=e.length,n=s?s(r):new e.constructor(r);return e.copy(n),n}},7157:(e,t,r)=>{var n=r(4318);e.exports=function(e,t){var r=t?n(e.buffer):e.buffer;return new e.constructor(r,e.byteOffset,e.byteLength)}},3147:e=>{var t=/\w*$/;e.exports=function(e){var r=new e.constructor(e.source,t.exec(e));return r.lastIndex=e.lastIndex,r}},419:(e,t,r)=>{var n=r(2705),i=n?n.prototype:void 0,a=i?i.valueOf:void 0;e.exports=function(e){return a?Object(a.call(e)):{}}},7133:(e,t,r)=>{var n=r(4318);e.exports=function(e,t){var r=t?n(e.buffer):e.buffer;return new e.constructor(r,e.byteOffset,e.length)}},6393:(e,t,r)=>{var n=r(3448);e.exports=function(e,t){if(e!==t){var r=void 0!==e,i=null===e,a=e==e,o=n(e),s=void 0!==t,u=null===t,c=t==t,l=n(t);if(!u&&!l&&!o&&e>t||o&&s&&c&&!u&&!l||i&&s&&c||!r&&c||!a)return 1;if(!i&&!o&&!l&&e<t||l&&r&&a&&!i&&!o||u&&r&&a||!s&&a||!c)return-1}return 0}},5022:(e,t,r)=>{var n=r(6393);e.exports=function(e,t,r){for(var i=-1,a=e.criteria,o=t.criteria,s=a.length,u=r.length;++i<s;){var c=n(a[i],o[i]);if(c)return i>=u?c:c*("desc"==r[i]?-1:1)}return e.index-t.index}},278:e=>{e.exports=function(e,t){var r=-1,n=e.length;for(t||(t=Array(n));++r<n;)t[r]=e[r];return t}},8363:(e,t,r)=>{var n=r(4865),i=r(9465);e.exports=function(e,t,r,a){var o=!r;r||(r={});for(var s=-1,u=t.length;++s<u;){var c=t[s],l=a?a(r[c],e[c],c,r,e):void 0;void 0===l&&(l=e[c]),o?i(r,c,l):n(r,c,l)}return r}},8805:(e,t,r)=>{var n=r(8363),i=r(9551);e.exports=function(e,t){return n(e,i(e),t)}},1911:(e,t,r)=>{var n=r(8363),i=r(1442);e.exports=function(e,t){return n(e,i(e),t)}},4429:(e,t,r)=>{var n=r(5639)["__core-js_shared__"];e.exports=n},1463:(e,t,r)=>{var n=r(5976),i=r(6612);e.exports=function(e){return n((function(t,r){var n=-1,a=r.length,o=a>1?r[a-1]:void 0,s=a>2?r[2]:void 0;for(o=e.length>3&&"function"==typeof o?(a--,o):void 0,s&&i(r[0],r[1],s)&&(o=a<3?void 0:o,a=1),t=Object(t);++n<a;){var u=r[n];u&&e(t,u,n,o)}return t}))}},9291:(e,t,r)=>{var n=r(8612);e.exports=function(e,t){return function(r,i){if(null==r)return r;if(!n(r))return e(r,i);for(var a=r.length,o=t?a:-1,s=Object(r);(t?o--:++o<a)&&!1!==i(s[o],o,s););return r}}},5063:e=>{e.exports=function(e){return function(t,r,n){for(var i=-1,a=Object(t),o=n(t),s=o.length;s--;){var u=o[e?s:++i];if(!1===r(a[u],u,a))break}return t}}},7740:(e,t,r)=>{var n=r(7206),i=r(8612),a=r(3674);e.exports=function(e){return function(t,r,o){var s=Object(t);if(!i(t)){var u=n(r,3);t=a(t),r=function(e){return u(s[e],e,s)}}var c=e(t,r,o);return c>-1?s[u?t[c]:c]:void 0}}},7445:(e,t,r)=>{var n=r(98),i=r(6612),a=r(8601);e.exports=function(e){return function(t,r,o){return o&&"number"!=typeof o&&i(t,r,o)&&(r=o=void 0),t=a(t),void 0===r?(r=t,t=0):r=a(r),o=void 0===o?t<r?1:-1:a(o),n(t,r,o,e)}}},3593:(e,t,r)=>{var n=r(8525),i=r(308),a=r(1814),o=n&&1/a(new n([,-0]))[1]==1/0?function(e){return new n(e)}:i;e.exports=o},8777:(e,t,r)=>{var n=r(852),i=function(){try{var e=n(Object,"defineProperty");return e({},"",{}),e}catch(e){}}();e.exports=i},7114:(e,t,r)=>{var n=r(8668),i=r(2908),a=r(4757);e.exports=function(e,t,r,o,s,u){var c=1&r,l=e.length,f=t.length;if(l!=f&&!(c&&f>l))return!1;var p=u.get(e),d=u.get(t);if(p&&d)return p==t&&d==e;var h=-1,m=!0,v=2&r?new n:void 0;for(u.set(e,t),u.set(t,e);++h<l;){var y=e[h],g=t[h];if(o)var x=c?o(g,y,h,t,e,u):o(y,g,h,e,t,u);if(void 0!==x){if(x)continue;m=!1;break}if(v){if(!i(t,(function(e,t){if(!a(v,t)&&(y===e||s(y,e,r,o,u)))return v.push(t)}))){m=!1;break}}else if(y!==g&&!s(y,g,r,o,u)){m=!1;break}}return u.delete(e),u.delete(t),m}},8351:(e,t,r)=>{var n=r(2705),i=r(1149),a=r(7813),o=r(7114),s=r(8776),u=r(1814),c=n?n.prototype:void 0,l=c?c.valueOf:void 0;e.exports=function(e,t,r,n,c,f,p){switch(r){case"[object DataView]":if(e.byteLength!=t.byteLength||e.byteOffset!=t.byteOffset)return!1;e=e.buffer,t=t.buffer;case"[object ArrayBuffer]":return!(e.byteLength!=t.byteLength||!f(new i(e),new i(t)));case"[object Boolean]":case"[object Date]":case"[object Number]":return a(+e,+t);case"[object Error]":return e.name==t.name&&e.message==t.message;case"[object RegExp]":case"[object String]":return e==t+"";case"[object Map]":var d=s;case"[object Set]":var h=1&n;if(d||(d=u),e.size!=t.size&&!h)return!1;var m=p.get(e);if(m)return m==t;n|=2,p.set(e,t);var v=o(d(e),d(t),n,c,f,p);return p.delete(e),v;case"[object Symbol]":if(l)return l.call(e)==l.call(t)}return!1}},6096:(e,t,r)=>{var n=r(8234),i=Object.prototype.hasOwnProperty;e.exports=function(e,t,r,a,o,s){var u=1&r,c=n(e),l=c.length;if(l!=n(t).length&&!u)return!1;for(var f=l;f--;){var p=c[f];if(!(u?p in t:i.call(t,p)))return!1}var d=s.get(e),h=s.get(t);if(d&&h)return d==t&&h==e;var m=!0;s.set(e,t),s.set(t,e);for(var v=u;++f<l;){var y=e[p=c[f]],g=t[p];if(a)var x=u?a(g,y,p,t,e,s):a(y,g,p,e,t,s);if(!(void 0===x?y===g||o(y,g,r,a,s):x)){m=!1;break}v||(v="constructor"==p)}if(m&&!v){var b=e.constructor,w=t.constructor;b==w||!("constructor"in e)||!("constructor"in t)||"function"==typeof b&&b instanceof b&&"function"==typeof w&&w instanceof w||(m=!1)}return s.delete(e),s.delete(t),m}},9021:(e,t,r)=>{var n=r(5564),i=r(5357),a=r(61);e.exports=function(e){return a(i(e,void 0,n),e+"")}},1957:(e,t,r)=>{var n="object"==typeof r.g&&r.g&&r.g.Object===Object&&r.g;e.exports=n},8234:(e,t,r)=>{var n=r(8866),i=r(9551),a=r(3674);e.exports=function(e){return n(e,a,i)}},6904:(e,t,r)=>{var n=r(8866),i=r(1442),a=r(1704);e.exports=function(e){return n(e,a,i)}},5050:(e,t,r)=>{var n=r(7019);e.exports=function(e,t){var r=e.__data__;return n(t)?r["string"==typeof t?"string":"hash"]:r.map}},1499:(e,t,r)=>{var n=r(9162),i=r(3674);e.exports=function(e){for(var t=i(e),r=t.length;r--;){var a=t[r],o=e[a];t[r]=[a,o,n(o)]}return t}},852:(e,t,r)=>{var n=r(8458),i=r(7801);e.exports=function(e,t){var r=i(e,t);return n(r)?r:void 0}},5924:(e,t,r)=>{var n=r(5569)(Object.getPrototypeOf,Object);e.exports=n},9607:(e,t,r)=>{var n=r(2705),i=Object.prototype,a=i.hasOwnProperty,o=i.toString,s=n?n.toStringTag:void 0;e.exports=function(e){var t=a.call(e,s),r=e[s];try{e[s]=void 0;var n=!0}catch(e){}var i=o.call(e);return n&&(t?e[s]=r:delete e[s]),i}},9551:(e,t,r)=>{var n=r(4963),i=r(479),a=Object.prototype.propertyIsEnumerable,o=Object.getOwnPropertySymbols,s=o?function(e){return null==e?[]:(e=Object(e),n(o(e),(function(t){return a.call(e,t)})))}:i;e.exports=s},1442:(e,t,r)=>{var n=r(2488),i=r(5924),a=r(9551),o=r(479),s=Object.getOwnPropertySymbols?function(e){for(var t=[];e;)n(t,a(e)),e=i(e);return t}:o;e.exports=s},4160:(e,t,r)=>{var n=r(8552),i=r(7071),a=r(3818),o=r(8525),s=r(577),u=r(4239),c=r(346),l="[object Map]",f="[object Promise]",p="[object Set]",d="[object WeakMap]",h="[object DataView]",m=c(n),v=c(i),y=c(a),g=c(o),x=c(s),b=u;(n&&b(new n(new ArrayBuffer(1)))!=h||i&&b(new i)!=l||a&&b(a.resolve())!=f||o&&b(new o)!=p||s&&b(new s)!=d)&&(b=function(e){var t=u(e),r="[object Object]"==t?e.constructor:void 0,n=r?c(r):"";if(n)switch(n){case m:return h;case v:return l;case y:return f;case g:return p;case x:return d}return t}),e.exports=b},7801:e=>{e.exports=function(e,t){return null==e?void 0:e[t]}},222:(e,t,r)=>{var n=r(1811),i=r(5694),a=r(1469),o=r(5776),s=r(1780),u=r(327);e.exports=function(e,t,r){for(var c=-1,l=(t=n(t,e)).length,f=!1;++c<l;){var p=u(t[c]);if(!(f=null!=e&&r(e,p)))break;e=e[p]}return f||++c!=l?f:!!(l=null==e?0:e.length)&&s(l)&&o(p,l)&&(a(e)||i(e))}},2689:e=>{var t=RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");e.exports=function(e){return t.test(e)}},1789:(e,t,r)=>{var n=r(4536);e.exports=function(){this.__data__=n?n(null):{},this.size=0}},401:e=>{e.exports=function(e){var t=this.has(e)&&delete this.__data__[e];return this.size-=t?1:0,t}},7667:(e,t,r)=>{var n=r(4536),i=Object.prototype.hasOwnProperty;e.exports=function(e){var t=this.__data__;if(n){var r=t[e];return"__lodash_hash_undefined__"===r?void 0:r}return i.call(t,e)?t[e]:void 0}},1327:(e,t,r)=>{var n=r(4536),i=Object.prototype.hasOwnProperty;e.exports=function(e){var t=this.__data__;return n?void 0!==t[e]:i.call(t,e)}},1866:(e,t,r)=>{var n=r(4536);e.exports=function(e,t){var r=this.__data__;return this.size+=this.has(e)?0:1,r[e]=n&&void 0===t?"__lodash_hash_undefined__":t,this}},3824:e=>{var t=Object.prototype.hasOwnProperty;e.exports=function(e){var r=e.length,n=new e.constructor(r);return r&&"string"==typeof e[0]&&t.call(e,"index")&&(n.index=e.index,n.input=e.input),n}},9148:(e,t,r)=>{var n=r(4318),i=r(7157),a=r(3147),o=r(419),s=r(7133);e.exports=function(e,t,r){var u=e.constructor;switch(t){case"[object ArrayBuffer]":return n(e);case"[object Boolean]":case"[object Date]":return new u(+e);case"[object DataView]":return i(e,r);case"[object Float32Array]":case"[object Float64Array]":case"[object Int8Array]":case"[object Int16Array]":case"[object Int32Array]":case"[object Uint8Array]":case"[object Uint8ClampedArray]":case"[object Uint16Array]":case"[object Uint32Array]":return s(e,r);case"[object Map]":return new u;case"[object Number]":case"[object String]":return new u(e);case"[object RegExp]":return a(e);case"[object Set]":return new u;case"[object Symbol]":return o(e)}}},8517:(e,t,r)=>{var n=r(3118),i=r(5924),a=r(5726);e.exports=function(e){return"function"!=typeof e.constructor||a(e)?{}:n(i(e))}},7285:(e,t,r)=>{var n=r(2705),i=r(5694),a=r(1469),o=n?n.isConcatSpreadable:void 0;e.exports=function(e){return a(e)||i(e)||!!(o&&e&&e[o])}},5776:e=>{var t=/^(?:0|[1-9]\d*)$/;e.exports=function(e,r){var n=typeof e;return!!(r=null==r?9007199254740991:r)&&("number"==n||"symbol"!=n&&t.test(e))&&e>-1&&e%1==0&&e<r}},6612:(e,t,r)=>{var n=r(7813),i=r(8612),a=r(5776),o=r(3218);e.exports=function(e,t,r){if(!o(r))return!1;var s=typeof t;return!!("number"==s?i(r)&&a(t,r.length):"string"==s&&t in r)&&n(r[t],e)}},5403:(e,t,r)=>{var n=r(1469),i=r(3448),a=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,o=/^\w*$/;e.exports=function(e,t){if(n(e))return!1;var r=typeof e;return!("number"!=r&&"symbol"!=r&&"boolean"!=r&&null!=e&&!i(e))||o.test(e)||!a.test(e)||null!=t&&e in Object(t)}},7019:e=>{e.exports=function(e){var t=typeof e;return"string"==t||"number"==t||"symbol"==t||"boolean"==t?"__proto__"!==e:null===e}},5346:(e,t,r)=>{var n,i=r(4429),a=(n=/[^.]+$/.exec(i&&i.keys&&i.keys.IE_PROTO||""))?"Symbol(src)_1."+n:"";e.exports=function(e){return!!a&&a in e}},5726:e=>{var t=Object.prototype;e.exports=function(e){var r=e&&e.constructor;return e===("function"==typeof r&&r.prototype||t)}},9162:(e,t,r)=>{var n=r(3218);e.exports=function(e){return e==e&&!n(e)}},7040:e=>{e.exports=function(){this.__data__=[],this.size=0}},4125:(e,t,r)=>{var n=r(8470),i=Array.prototype.splice;e.exports=function(e){var t=this.__data__,r=n(t,e);return!(r<0||(r==t.length-1?t.pop():i.call(t,r,1),--this.size,0))}},2117:(e,t,r)=>{var n=r(8470);e.exports=function(e){var t=this.__data__,r=n(t,e);return r<0?void 0:t[r][1]}},7518:(e,t,r)=>{var n=r(8470);e.exports=function(e){return n(this.__data__,e)>-1}},4705:(e,t,r)=>{var n=r(8470);e.exports=function(e,t){var r=this.__data__,i=n(r,e);return i<0?(++this.size,r.push([e,t])):r[i][1]=t,this}},4785:(e,t,r)=>{var n=r(1989),i=r(8407),a=r(7071);e.exports=function(){this.size=0,this.__data__={hash:new n,map:new(a||i),string:new n}}},1285:(e,t,r)=>{var n=r(5050);e.exports=function(e){var t=n(this,e).delete(e);return this.size-=t?1:0,t}},6e3:(e,t,r)=>{var n=r(5050);e.exports=function(e){return n(this,e).get(e)}},9916:(e,t,r)=>{var n=r(5050);e.exports=function(e){return n(this,e).has(e)}},5265:(e,t,r)=>{var n=r(5050);e.exports=function(e,t){var r=n(this,e),i=r.size;return r.set(e,t),this.size+=r.size==i?0:1,this}},8776:e=>{e.exports=function(e){var t=-1,r=Array(e.size);return e.forEach((function(e,n){r[++t]=[n,e]})),r}},2634:e=>{e.exports=function(e,t){return function(r){return null!=r&&r[e]===t&&(void 0!==t||e in Object(r))}}},4523:(e,t,r)=>{var n=r(8306);e.exports=function(e){var t=n(e,(function(e){return 500===r.size&&r.clear(),e})),r=t.cache;return t}},4536:(e,t,r)=>{var n=r(852)(Object,"create");e.exports=n},6916:(e,t,r)=>{var n=r(5569)(Object.keys,Object);e.exports=n},3498:e=>{e.exports=function(e){var t=[];if(null!=e)for(var r in Object(e))t.push(r);return t}},1167:(e,t,r)=>{e=r.nmd(e);var n=r(1957),i=t&&!t.nodeType&&t,a=i&&e&&!e.nodeType&&e,o=a&&a.exports===i&&n.process,s=function(){try{return a&&a.require&&a.require("util").types||o&&o.binding&&o.binding("util")}catch(e){}}();e.exports=s},2333:e=>{var t=Object.prototype.toString;e.exports=function(e){return t.call(e)}},5569:e=>{e.exports=function(e,t){return function(r){return e(t(r))}}},5357:(e,t,r)=>{var n=r(6874),i=Math.max;e.exports=function(e,t,r){return t=i(void 0===t?e.length-1:t,0),function(){for(var a=arguments,o=-1,s=i(a.length-t,0),u=Array(s);++o<s;)u[o]=a[t+o];o=-1;for(var c=Array(t+1);++o<t;)c[o]=a[o];return c[t]=r(u),n(e,this,c)}}},5639:(e,t,r)=>{var n=r(1957),i="object"==typeof self&&self&&self.Object===Object&&self,a=n||i||Function("return this")();e.exports=a},6390:e=>{e.exports=function(e,t){if(("constructor"!==t||"function"!=typeof e[t])&&"__proto__"!=t)return e[t]}},619:e=>{e.exports=function(e){return this.__data__.set(e,"__lodash_hash_undefined__"),this}},2385:e=>{e.exports=function(e){return this.__data__.has(e)}},1814:e=>{e.exports=function(e){var t=-1,r=Array(e.size);return e.forEach((function(e){r[++t]=e})),r}},61:(e,t,r)=>{var n=r(6560),i=r(1275)(n);e.exports=i},1275:e=>{var t=Date.now;e.exports=function(e){var r=0,n=0;return function(){var i=t(),a=16-(i-n);if(n=i,a>0){if(++r>=800)return arguments[0]}else r=0;return e.apply(void 0,arguments)}}},7465:(e,t,r)=>{var n=r(8407);e.exports=function(){this.__data__=new n,this.size=0}},3779:e=>{e.exports=function(e){var t=this.__data__,r=t.delete(e);return this.size=t.size,r}},7599:e=>{e.exports=function(e){return this.__data__.get(e)}},4758:e=>{e.exports=function(e){return this.__data__.has(e)}},4309:(e,t,r)=>{var n=r(8407),i=r(7071),a=r(3369);e.exports=function(e,t){var r=this.__data__;if(r instanceof n){var o=r.__data__;if(!i||o.length<199)return o.push([e,t]),this.size=++r.size,this;r=this.__data__=new a(o)}return r.set(e,t),this.size=r.size,this}},2351:e=>{e.exports=function(e,t,r){for(var n=r-1,i=e.length;++n<i;)if(e[n]===t)return n;return-1}},8016:(e,t,r)=>{var n=r(8983),i=r(2689),a=r(1903);e.exports=function(e){return i(e)?a(e):n(e)}},5514:(e,t,r)=>{var n=r(4523),i=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g,a=/\\(\\)?/g,o=n((function(e){var t=[];return 46===e.charCodeAt(0)&&t.push(""),e.replace(i,(function(e,r,n,i){t.push(n?i.replace(a,"$1"):r||e)})),t}));e.exports=o},327:(e,t,r)=>{var n=r(3448);e.exports=function(e){if("string"==typeof e||n(e))return e;var t=e+"";return"0"==t&&1/e==-1/0?"-0":t}},346:e=>{var t=Function.prototype.toString;e.exports=function(e){if(null!=e){try{return t.call(e)}catch(e){}try{return e+""}catch(e){}}return""}},7990:e=>{var t=/\s/;e.exports=function(e){for(var r=e.length;r--&&t.test(e.charAt(r)););return r}},1903:e=>{var t="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",r="\\ud83c[\\udffb-\\udfff]",n="[^\\ud800-\\udfff]",i="(?:\\ud83c[\\udde6-\\uddff]){2}",a="[\\ud800-\\udbff][\\udc00-\\udfff]",o="(?:"+t+"|"+r+")?",s="[\\ufe0e\\ufe0f]?",u=s+o+"(?:\\u200d(?:"+[n,i,a].join("|")+")"+s+o+")*",c="(?:"+[n+t+"?",t,i,a,"[\\ud800-\\udfff]"].join("|")+")",l=RegExp(r+"(?="+r+")|"+c+u,"g");e.exports=function(e){for(var t=l.lastIndex=0;l.test(e);)++t;return t}},6678:(e,t,r)=>{var n=r(5990);e.exports=function(e){return n(e,4)}},361:(e,t,r)=>{var n=r(5990);e.exports=function(e){return n(e,5)}},5703:e=>{e.exports=function(e){return function(){return e}}},1747:(e,t,r)=>{var n=r(5976),i=r(7813),a=r(6612),o=r(1704),s=Object.prototype,u=s.hasOwnProperty,c=n((function(e,t){e=Object(e);var r=-1,n=t.length,c=n>2?t[2]:void 0;for(c&&a(t[0],t[1],c)&&(n=1);++r<n;)for(var l=t[r],f=o(l),p=-1,d=f.length;++p<d;){var h=f[p],m=e[h];(void 0===m||i(m,s[h])&&!u.call(e,h))&&(e[h]=l[h])}return e}));e.exports=c},6073:(e,t,r)=>{e.exports=r(4486)},7813:e=>{e.exports=function(e,t){return e===t||e!=e&&t!=t}},3105:(e,t,r)=>{var n=r(4963),i=r(760),a=r(7206),o=r(1469);e.exports=function(e,t){return(o(e)?n:i)(e,a(t,3))}},3311:(e,t,r)=>{var n=r(7740)(r(998));e.exports=n},998:(e,t,r)=>{var n=r(1848),i=r(7206),a=r(554),o=Math.max;e.exports=function(e,t,r){var s=null==e?0:e.length;if(!s)return-1;var u=null==r?0:a(r);return u<0&&(u=o(s+u,0)),n(e,i(t,3),u)}},5564:(e,t,r)=>{var n=r(1078);e.exports=function(e){return null!=e&&e.length?n(e,1):[]}},4486:(e,t,r)=>{var n=r(7412),i=r(9881),a=r(4290),o=r(1469);e.exports=function(e,t){return(o(e)?n:i)(e,a(t))}},2620:(e,t,r)=>{var n=r(8483),i=r(4290),a=r(1704);e.exports=function(e,t){return null==e?e:n(e,i(t),a)}},7361:(e,t,r)=>{var n=r(7786);e.exports=function(e,t,r){var i=null==e?void 0:n(e,t);return void 0===i?r:i}},8721:(e,t,r)=>{var n=r(8565),i=r(222);e.exports=function(e,t){return null!=e&&i(e,t,n)}},9095:(e,t,r)=>{var n=r(13),i=r(222);e.exports=function(e,t){return null!=e&&i(e,t,n)}},6557:e=>{e.exports=function(e){return e}},5694:(e,t,r)=>{var n=r(9454),i=r(7005),a=Object.prototype,o=a.hasOwnProperty,s=a.propertyIsEnumerable,u=n(function(){return arguments}())?n:function(e){return i(e)&&o.call(e,"callee")&&!s.call(e,"callee")};e.exports=u},1469:e=>{var t=Array.isArray;e.exports=t},8612:(e,t,r)=>{var n=r(3560),i=r(1780);e.exports=function(e){return null!=e&&i(e.length)&&!n(e)}},9246:(e,t,r)=>{var n=r(8612),i=r(7005);e.exports=function(e){return i(e)&&n(e)}},4144:(e,t,r)=>{e=r.nmd(e);var n=r(5639),i=r(5062),a=t&&!t.nodeType&&t,o=a&&e&&!e.nodeType&&e,s=o&&o.exports===a?n.Buffer:void 0,u=(s?s.isBuffer:void 0)||i;e.exports=u},1609:(e,t,r)=>{var n=r(280),i=r(4160),a=r(5694),o=r(1469),s=r(8612),u=r(4144),c=r(5726),l=r(6719),f=Object.prototype.hasOwnProperty;e.exports=function(e){if(null==e)return!0;if(s(e)&&(o(e)||"string"==typeof e||"function"==typeof e.splice||u(e)||l(e)||a(e)))return!e.length;var t=i(e);if("[object Map]"==t||"[object Set]"==t)return!e.size;if(c(e))return!n(e).length;for(var r in e)if(f.call(e,r))return!1;return!0}},3560:(e,t,r)=>{var n=r(4239),i=r(3218);e.exports=function(e){if(!i(e))return!1;var t=n(e);return"[object Function]"==t||"[object GeneratorFunction]"==t||"[object AsyncFunction]"==t||"[object Proxy]"==t}},1780:e=>{e.exports=function(e){return"number"==typeof e&&e>-1&&e%1==0&&e<=9007199254740991}},6688:(e,t,r)=>{var n=r(5588),i=r(1717),a=r(1167),o=a&&a.isMap,s=o?i(o):n;e.exports=s},3218:e=>{e.exports=function(e){var t=typeof e;return null!=e&&("object"==t||"function"==t)}},7005:e=>{e.exports=function(e){return null!=e&&"object"==typeof e}},8630:(e,t,r)=>{var n=r(4239),i=r(5924),a=r(7005),o=Function.prototype,s=Object.prototype,u=o.toString,c=s.hasOwnProperty,l=u.call(Object);e.exports=function(e){if(!a(e)||"[object Object]"!=n(e))return!1;var t=i(e);if(null===t)return!0;var r=c.call(t,"constructor")&&t.constructor;return"function"==typeof r&&r instanceof r&&u.call(r)==l}},2928:(e,t,r)=>{var n=r(9221),i=r(1717),a=r(1167),o=a&&a.isSet,s=o?i(o):n;e.exports=s},7037:(e,t,r)=>{var n=r(4239),i=r(1469),a=r(7005);e.exports=function(e){return"string"==typeof e||!i(e)&&a(e)&&"[object String]"==n(e)}},3448:(e,t,r)=>{var n=r(4239),i=r(7005);e.exports=function(e){return"symbol"==typeof e||i(e)&&"[object Symbol]"==n(e)}},6719:(e,t,r)=>{var n=r(8749),i=r(1717),a=r(1167),o=a&&a.isTypedArray,s=o?i(o):n;e.exports=s},2353:e=>{e.exports=function(e){return void 0===e}},3674:(e,t,r)=>{var n=r(4636),i=r(280),a=r(8612);e.exports=function(e){return a(e)?n(e):i(e)}},1704:(e,t,r)=>{var n=r(4636),i=r(313),a=r(8612);e.exports=function(e){return a(e)?n(e,!0):i(e)}},928:e=>{e.exports=function(e){var t=null==e?0:e.length;return t?e[t-1]:void 0}},5161:(e,t,r)=>{var n=r(9932),i=r(7206),a=r(9199),o=r(1469);e.exports=function(e,t){return(o(e)?n:a)(e,i(t,3))}},6604:(e,t,r)=>{var n=r(9465),i=r(7816),a=r(7206);e.exports=function(e,t){var r={};return t=a(t,3),i(e,(function(e,i,a){n(r,i,t(e,i,a))})),r}},6162:(e,t,r)=>{var n=r(6029),i=r(3325),a=r(6557);e.exports=function(e){return e&&e.length?n(e,a,i):void 0}},8306:(e,t,r)=>{var n=r(3369);function i(e,t){if("function"!=typeof e||null!=t&&"function"!=typeof t)throw new TypeError("Expected a function");var r=function(){var n=arguments,i=t?t.apply(this,n):n[0],a=r.cache;if(a.has(i))return a.get(i);var o=e.apply(this,n);return r.cache=a.set(i,o)||a,o};return r.cache=new(i.Cache||n),r}i.Cache=n,e.exports=i},3857:(e,t,r)=>{var n=r(2980),i=r(1463)((function(e,t,r){n(e,t,r)}));e.exports=i},3632:(e,t,r)=>{var n=r(6029),i=r(433),a=r(6557);e.exports=function(e){return e&&e.length?n(e,a,i):void 0}},2762:(e,t,r)=>{var n=r(6029),i=r(7206),a=r(433);e.exports=function(e,t){return e&&e.length?n(e,i(t,2),a):void 0}},308:e=>{e.exports=function(){}},7771:(e,t,r)=>{var n=r(5639);e.exports=function(){return n.Date.now()}},9722:(e,t,r)=>{var n=r(5970),i=r(9021)((function(e,t){return null==e?{}:n(e,t)}));e.exports=i},9601:(e,t,r)=>{var n=r(371),i=r(9152),a=r(5403),o=r(327);e.exports=function(e){return a(e)?n(o(e)):i(e)}},6026:(e,t,r)=>{var n=r(7445)();e.exports=n},4061:(e,t,r)=>{var n=r(2663),i=r(9881),a=r(7206),o=r(107),s=r(1469);e.exports=function(e,t,r){var u=s(e)?n:o,c=arguments.length<3;return u(e,a(t,4),r,c,i)}},4238:(e,t,r)=>{var n=r(280),i=r(4160),a=r(8612),o=r(7037),s=r(8016);e.exports=function(e){if(null==e)return 0;if(a(e))return o(e)?s(e):e.length;var t=i(e);return"[object Map]"==t||"[object Set]"==t?e.size:n(e).length}},9734:(e,t,r)=>{var n=r(1078),i=r(9556),a=r(5976),o=r(6612),s=a((function(e,t){if(null==e)return[];var r=t.length;return r>1&&o(e,t[0],t[1])?t=[]:r>2&&o(t[0],t[1],t[2])&&(t=[t[0]]),i(e,n(t,1),[])}));e.exports=s},479:e=>{e.exports=function(){return[]}},5062:e=>{e.exports=function(){return!1}},8601:(e,t,r)=>{var n=r(4841);e.exports=function(e){return e?Infinity===(e=n(e))||e===-1/0?17976931348623157e292*(e<0?-1:1):e==e?e:0:0===e?e:0}},554:(e,t,r)=>{var n=r(8601);e.exports=function(e){var t=n(e),r=t%1;return t==t?r?t-r:t:0}},4841:(e,t,r)=>{var n=r(7561),i=r(3218),a=r(3448),o=/^[-+]0x[0-9a-f]+$/i,s=/^0b[01]+$/i,u=/^0o[0-7]+$/i,c=parseInt;e.exports=function(e){if("number"==typeof e)return e;if(a(e))return NaN;if(i(e)){var t="function"==typeof e.valueOf?e.valueOf():e;e=i(t)?t+"":t}if("string"!=typeof e)return 0===e?e:+e;e=n(e);var r=s.test(e);return r||u.test(e)?c(e.slice(2),r?2:8):o.test(e)?NaN:+e}},3678:(e,t,r)=>{var n=r(8363),i=r(1704);e.exports=function(e){return n(e,i(e))}},9833:(e,t,r)=>{var n=r(531);e.exports=function(e){return null==e?"":n(e)}},8718:(e,t,r)=>{var n=r(7412),i=r(3118),a=r(7816),o=r(7206),s=r(5924),u=r(1469),c=r(4144),l=r(3560),f=r(3218),p=r(6719);e.exports=function(e,t,r){var d=u(e),h=d||c(e)||p(e);if(t=o(t,4),null==r){var m=e&&e.constructor;r=h?d?new m:[]:f(e)&&l(m)?i(s(e)):{}}return(h?n:a)(e,(function(e,n,i){return t(r,e,n,i)})),r}},3386:(e,t,r)=>{var n=r(1078),i=r(5976),a=r(5652),o=r(9246),s=i((function(e){return a(n(e,1,o,!0))}));e.exports=s},3955:(e,t,r)=>{var n=r(9833),i=0;e.exports=function(e){var t=++i;return n(e)+t}},2628:(e,t,r)=>{var n=r(7415),i=r(3674);e.exports=function(e){return null==e?[]:n(e,i(e))}},7287:(e,t,r)=>{var n=r(4865),i=r(1757);e.exports=function(e,t){return i(e||[],t||[],n)}},2191:(e,t,r)=>{"use strict";r.d(t,{v:()=>a});var n={epsilon:1e-12,matrix:"Matrix",number:"number",precision:64,predictable:!1,randomSeed:null};function i(){return(i=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}).apply(this,arguments)}var a=function(e){if(e)throw new Error("The global config is readonly. \nPlease create a mathjs instance if you want to change the default configuration. \nExample:\n\n  import { create, all } from 'mathjs';\n  const mathjs = create(all);\n  mathjs.config({ number: 'BigNumber' });\n");return Object.freeze(n)};i(a,n,{MATRIX_OPTIONS:["Matrix","Array"],NUMBER_OPTIONS:["number","BigNumber","Fraction"]})},400:(e,t,r)=>{"use strict";r.d(t,{Qc:()=>_r,og:()=>Or});var n=r(2191),i=r(5542),a={end:!0},o=r(5254),s=r(8794),u=["mathWithTransform"],c=(0,s.d5)("Node",u,(e=>{var{mathWithTransform:t}=e;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=t||{};return function(e){for(var t in e)if((0,o.nr)(e,t)&&t in a)throw new Error('Scope contains an illegal symbol, "'+t+'" 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(!(0,i.UG)(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&&(0,o.J5)(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"==typeof e)switch(typeof 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}),l=r(4444),f=["Node"],p=(0,s.d5)("ArrayNode",f,(e=>{var{Node:t}=e;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(i.UG))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=(0,l.UI)(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((0,l.UI)(r,(function(r){return r(e,t,i)})))}}return function(e,t,n){return(0,l.UI)(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){var t="\\begin{bmatrix}";return this.items.forEach((function(r){r.items?t+=r.items.map((function(t){return t.toTex(e)})).join("&"):t+=r.toTex(e),t+="\\\\"})),t+="\\end{bmatrix}"},r}),{isClass:!0,isNode:!0}),d=["ResultSet","Node"],h=(0,s.d5)("BlockNode",d,(e=>{var{ResultSet:t,Node:r}=e;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(!(0,i.UG)(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=(0,l.UI)(this.blocks,(function(t){return{evaluate:t.node._compile(e,r),visible:t.visible}}));return function(e,r,i){var a=[];return(0,l.Ed)(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}),m=r(3014),v=r(7928),y={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{?}"},g={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"},x={abs:{1:"\\left|${args[0]}\\right|"},add:{2:"\\left(${args[0]}".concat(g.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(g.dotDivide,"${args[1]}\\right)")},dotMultiply:{2:"\\left(${args[0]}".concat(g.dotMultiply,"${args[1]}\\right)")},dotPow:{2:"\\left(${args[0]}".concat(g.dotPow,"${args[1]}\\right)")},exp:{1:"\\exp\\left(${args[0]}\\right)"},expm1:"\\left(e".concat(g.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(g.mod,"${args[1]}\\right)")},multiply:{2:"\\left(${args[0]}".concat(g.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(g.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(g.subtract,"${args[1]}\\right)")},unaryMinus:{1:"".concat(g.unaryMinus,"\\left(${args[0]}\\right)")},unaryPlus:{1:"".concat(g.unaryPlus,"\\left(${args[0]}\\right)")},bitAnd:{2:"\\left(${args[0]}".concat(g.bitAnd,"${args[1]}\\right)")},bitNot:{1:g.bitNot+"\\left(${args[0]}\\right)"},bitOr:{2:"\\left(${args[0]}".concat(g.bitOr,"${args[1]}\\right)")},bitXor:{2:"\\left(${args[0]}".concat(g.bitXor,"${args[1]}\\right)")},leftShift:{2:"\\left(${args[0]}".concat(g.leftShift,"${args[1]}\\right)")},rightArithShift:{2:"\\left(${args[0]}".concat(g.rightArithShift,"${args[1]}\\right)")},rightLogShift:{2:"\\left(${args[0]}".concat(g.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(g.and,"${args[1]}\\right)")},not:{1:g.not+"\\left(${args[0]}\\right)"},or:{2:"\\left(${args[0]}".concat(g.or,"${args[1]}\\right)")},xor:{2:"\\left(${args[0]}".concat(g.xor,"${args[1]}\\right)")},cross:{2:"\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)"},ctranspose:{1:"\\left(${args[0]}\\right)".concat(g.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(g.pow,"{\\frac{1}{2}}")},trace:{1:"\\mathrm{tr}\\left(${args[0]}\\right)"},transpose:{1:"\\left(${args[0]}\\right)".concat(g.transpose)},combinations:{2:"\\binom{${args[0]}}{${args[1]}}"},combinationsWithRep:{2:"\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)"},factorial:{1:"\\left(${args[0]}\\right)".concat(g.factorial)},gamma:{1:"\\Gamma\\left(${args[0]}\\right)"},equal:{2:"\\left(${args[0]}".concat(g.equal,"${args[1]}\\right)")},larger:{2:"\\left(${args[0]}".concat(g.larger,"${args[1]}\\right)")},largerEq:{2:"\\left(${args[0]}".concat(g.largerEq,"${args[1]}\\right)")},smaller:{2:"\\left(${args[0]}".concat(g.smaller,"${args[1]}\\right)")},smallerEq:{2:"\\left(${args[0]}".concat(g.smallerEq,"${args[1]}\\right)")},unequal:{2:"\\left(${args[0]}".concat(g.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(g.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(y.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)"}},b={deg:"^\\circ"};function w(e){return v(e,{preserveFormatting:!0})}function _(e,t){return(t=void 0!==t&&t)?(0,o.nr)(b,e)?b[e]:"\\mathrm{"+w(e)+"}":(0,o.nr)(y,e)?y[e]:w(e)}var N=["Node"],E=(0,s.d5)("ConstantNode",N,(e=>{var{Node:t}=e;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(0,m.WU)(this.value,e)},r.prototype.toHTML=function(e){var t=this._toString(e);switch((0,i.kM)(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((0,i.kM)(this.value)){case"string":return"\\mathtt{"+w(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}),M=r(3068),S=["Node"],A=(0,s.d5)("ObjectNode",S,(e=>{var{Node:t}=e;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(this.properties=e||{},e&&("object"!=typeof e||!Object.keys(e).every((function(t){return(0,i.UG)(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((0,o.nr)(this.properties,n)){var i=(0,m.Pz)(n),a=JSON.parse(i);if(!(0,M.pp)(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)(0,o.nr)(r,a)&&(i[a]=r[a](e,t,n));return i}},r.prototype.forEach=function(e){for(var t in this.properties)(0,o.nr)(this.properties,t)&&e(this.properties[t],"properties["+(0,m.Pz)(t)+"]",this)},r.prototype.map=function(e){var t={};for(var n in this.properties)(0,o.nr)(this.properties,n)&&(t[n]=this._ifNode(e(this.properties[n],"properties["+(0,m.Pz)(n)+"]",this)));return new r(t)},r.prototype.clone=function(){var e={};for(var t in this.properties)(0,o.nr)(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)(0,o.nr)(this.properties,r)&&t.push((0,m.Pz)(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)(0,o.nr)(this.properties,r)&&t.push('<span class="math-symbol math-property">'+(0,m.YU)(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)(0,o.nr)(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}),O=["Node"],k=(0,s.d5)("ParenthesisNode",O,(e=>{var{Node:t}=e;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(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}),T=[{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 C(e,t){var r=e;"keep"!==t&&(r=e.getContent());for(var n=r.getIdentifier(),i=0;i<T.length;i++)if(n in T[i])return i;return null}function I(e,t){var r=e;"keep"!==t&&(r=e.getContent());var n=r.getIdentifier(),i=C(r,t);if(null===i)return null;var a=T[i][n];if((0,o.nr)(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 D(e,t,r){var n="keep"!==r?e.getContent():e,i="keep"!==r?e.getContent():t,a=n.getIdentifier(),s=i.getIdentifier(),u=C(n,r);if(null===u)return null;var c=T[u][a];if((0,o.nr)(c,"associativeWith")&&c.associativeWith instanceof Array){for(var l=0;l<c.associativeWith.length;l++)if(c.associativeWith[l]===s)return!0;return!1}return null}var z=["Node"],B=(0,s.d5)("RelationalNode",z,(e=>{var{Node:t}=e;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((r=>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),!(0,M.YF)(e,r.conditionals[u])(o,s))return!1;return!0}},r.prototype.forEach=function(e){this.params.forEach(((t,r)=>e(t,"params["+r+"]",this)),this)},r.prototype.map=function(e){return new r(this.conditionals.slice(),this.params.map(((t,r)=>this._ifNode(e(t,"params["+r+"]",this))),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=C(this,t),n=this.params.map((function(n,i){var a=C(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=C(this,t),n=this.params.map((function(n,i){var a=C(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">'+(0,m.YU)(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=C(this,t),n=this.params.map((function(n,i){var a=C(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+=g[this.conditionals[a]]+n[a+1];return i},r}),{isClass:!0,isNode:!0}),j=["?on","math"],U=(0,s.d5)("Chain",j,(e=>{var{on:t,math:r}=e;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");(0,i.qg)(e)?this.value=e.value:this.value=e}function a(e,t){(0,o.Vo)(n.prototype,e,(function(){var e=t();if("function"==typeof e)return s(e)}))}function s(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(0,m.WU)(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)c=e,"function"==typeof(l=t)&&(n.prototype[c]=s(l));else{var r=function(t){(0,o.nr)(e,t)&&void 0===u[t]&&a(t,(()=>e[t]))};for(var i in e)r(i)}var c,l};var u={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||a(e,t)})),n}),{isClass:!0}),R=["classes"],q=(0,s.d5)("reviver",R,(e=>{var{classes:t}=e;return function(e,r){var n=t[r&&r.mathjs];return n&&"function"==typeof n.fromJSON?n.fromJSON(r):r}})),F=["Node"],P=(0,s.d5)("ConditionalNode",F,(e=>{var{Node:t}=e;function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(e))throw new TypeError("Parameter condition must be a Node");if(!(0,i.UG)(t))throw new TypeError("Parameter trueExpr must be a Node");if(!(0,i.UG)(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),a=this.falseExpr._compile(e,t);return function(e,t,o){return function(e){if("number"==typeof e||"boolean"==typeof e||"string"==typeof e)return!!e;if(e){if((0,i.l9)(e))return!e.isZero();if((0,i.Mc)(e))return!(!e.re&&!e.im);if((0,i.wr)(e))return!!e.value}if(null==e)return!1;throw new TypeError('Unsupported type of condition "'+(0,i.kM)(e)+'"')}(r(e,t,o))?n(e,t,o):a(e,t,o)}},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=C(this,t),n=this.condition.toString(e),i=C(this.condition,t);("all"===t||"OperatorNode"===this.condition.type||null!==i&&i<=r)&&(n="("+n+")");var a=this.trueExpr.toString(e),o=C(this.trueExpr,t);("all"===t||"OperatorNode"===this.trueExpr.type||null!==o&&o<=r)&&(a="("+a+")");var s=this.falseExpr.toString(e),u=C(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=C(this,t),n=this.condition.toHTML(e),i=C(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=C(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=C(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}),L=["Node"],H=(0,s.d5)("OperatorNode",L,(e=>{var{Node:t}=e;function r(e,t,n,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(i.UG))throw new TypeError('Array containing Nodes expected for parameter "args"');this.implicit=!0===a,this.op=e,this.fn=t,this.args=n||[]}function n(e,t,r,n,i){var a,o=C(e,t),s=I(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=C(n[0],t);if(i&&null!==u){var c,l;if("keep"===t?(c=n[0].getIdentifier(),l=e.getIdentifier()):(c=n[0].getContent().getIdentifier(),l=e.getContent().getIdentifier()),!1===T[o][l].latexLeftParens){a=[!1];break}if(!1===T[u][c].latexParens){a=[!1];break}}if(null===u){a=[!1];break}if(u<=o){a=[!0];break}a=[!1];break;case 2:var f,p,d=C(n[0],t),h=D(e,n[0],t);f=null!==d&&(d===o&&"right"===s&&!h||d<o);var m,v,y,g=C(n[1],t),x=D(e,n[1],t);p=null!==g&&(g===o&&"left"===s&&!x||g<o),i&&("keep"===t?(m=e.getIdentifier(),v=e.args[0].getIdentifier(),y=e.args[1].getIdentifier()):(m=e.getContent().getIdentifier(),v=e.args[0].getContent().getIdentifier(),y=e.args[1].getContent().getIdentifier()),null!==d&&(!1===T[o][m].latexLeftParens&&(f=!1),!1===T[d][v].latexParens&&(f=!1)),null!==g&&(!1===T[o][m].latexRightParens&&(p=!1),!1===T[g][y].latexParens&&(p=!1))),a=[f,p];break;default:"OperatorNode:add"!==e.getIdentifier()&&"OperatorNode:multiply"!==e.getIdentifier()||(a=n.map((function(r){var n=C(r,t),i=D(e,r,t),a=I(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||!(0,M.OJ)(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=(0,M.YF)(e,this.fn),n=(0,l.UI)(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,(0,l.UI)(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)},r.prototype.clone=function(){return new r(this.op,this.fn,this.args.slice(0),this.implicit)},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=I(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),l=i[1].toString(e);return a[0]&&(c="("+c+")"),a[1]&&(l="("+l+")"),this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===r?c+" "+l:c+" "+this.op+" "+l}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){var f=i.map((function(t,r){return t=t.toString(e),a[r]&&(t="("+t+")"),t}));return this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===r?f.join(" "):f.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}},r.fromJSON=function(e){return new r(e.op,e.fn,e.args,e.implicit)},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=I(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">'+(0,m.YU)(this.op)+"</span>"+s:s+'<span class="math-operator math-unary-operator math-righthand-unary-operator">'+(0,m.YU)(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">'+(0,m.YU)(this.op)+"</span>"+c}var l=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?l.join('<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>'):l.join('<span class="math-operator math-binary-operator math-explicit-binary-operator">'+(0,m.YU)(this.op)+"</span>"):'<span class="math-function">'+(0,m.YU)(this.fn)+'</span><span class="math-paranthesis math-round-parenthesis">(</span>'+l.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=g[this.fn];if(o=void 0===o?this.op:o,1===i.length){var s=I(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],l=c.toTex(e);a[0]&&(l="\\left(".concat(l,"\\right)"));var f,p=i[1].toTex(e);switch(a[1]&&(p="\\left(".concat(p,"\\right)")),f="keep"===t?c.getIdentifier():c.getContent().getIdentifier(),this.getIdentifier()){case"OperatorNode:divide":return o+"{"+l+"}{"+p+"}";case"OperatorNode:pow":switch(l="{"+l+"}",p="{"+p+"}",f){case"ConditionalNode":case"OperatorNode:divide":l="\\left(".concat(l,"\\right)")}break;case"OperatorNode:multiply":if(this.implicit&&"hide"===r)return l+"~"+p}return l+o+p}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){var d=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?d.join("~"):d.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}),G=["Node"],Z=(0,s.d5)("RangeNode",G,(e=>{var{Node:t}=e;function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(e))throw new TypeError("Node expected");if(!(0,i.UG)(t))throw new TypeError("Node expected");if(n&&!(0,i.UG)(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=C(e,t),n={},i=C(e.start,t);if(n.start=null!==i&&i<=r||"all"===t,e.step){var a=C(e.step,t);n.step=null!==a&&a<=r||"all"===t}var o=C(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(0,i.FG)(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}),W=["typed","Node"],$=(0,s.d5)("FunctionAssignmentNode",W,(e=>{var{typed:t,Node:r}=e;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(!(0,i.UG)(r))throw new TypeError('Node expected for parameter "expr"');if(e in a)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 o(e,t){var r=C(e,t),n=C(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);(0,l.Ed)(this.params,(function(e){n[e]=!0}));var i=this.expr._compile(e,n),a=this.name,o=this.params,s=(0,l.v_)(this.types,","),u=a+"("+(0,l.v_)(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 l=t(a,c);return l.syntax=u,(0,M.nI)(e,a,l),l}},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 o(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">'+(0,m.YU)(this.params[n])+"</span>");var i=this.expr.toHTML(e);return o(this,t)&&(i='<span class="math-parenthesis math-round-parenthesis">(</span>'+i+'<span class="math-parenthesis math-round-parenthesis">)</span>'),'<span class="math-function">'+(0,m.YU)(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>'+i},n.prototype._toTex=function(e){var t=e&&e.parenthesis?e.parenthesis:"keep",r=this.expr.toTex(e);return o(this,t)&&(r="\\left(".concat(r,"\\right)")),"\\mathrm{"+this.name+"}\\left("+this.params.map(_).join(",")+"\\right):="+r},n}),{isClass:!0,isNode:!0}),V="chain",J=["typed","Chain"],Y=(0,s.d5)(V,J,(e=>{var{typed:t,Chain:r}=e;return t(V,{"":function(){return new r},any:function(e){return new r(e)}})})),X=r(1647);function Q(e){return e&&e.isIndexError?new X.c(e.index+1,e.min+1,void 0!==e.max?e.max+1:void 0):e}function K(e){var{subset:t}=e;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"==typeof e){if(!r.isObjectProperty())throw new TypeError("Cannot apply a numeric index as object property");return(0,M.YF)(e,r.getObjectProperty())}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw Q(e)}}}var ee=["subset","Node"],te=(0,s.d5)("AccessorNode",ee,(e=>{var{subset:t,Node:r}=e,n=K({subset:t});function a(e,t){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");if(!(0,i.UG)(e))throw new TypeError('Node expected for parameter "object"');if(!(0,i.Cl)(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 o(e){return!((0,i.Yz)(e)||(0,i.j0)(e)||(0,i.nu)(e)||(0,i.VO)(e)||(0,i.Lr)(e)||(0,i.Ig)(e)||(0,i.FG)(e))}return a.prototype=new r,a.prototype.type="AccessorNode",a.prototype.isAccessorNode=!0,a.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(0,M.YF)(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)}},a.prototype.forEach=function(e){e(this.object,"object",this),e(this.index,"index",this)},a.prototype.map=function(e){return new a(this._ifNode(e(this.object,"object",this)),this._ifNode(e(this.index,"index",this)))},a.prototype.clone=function(){return new a(this.object,this.index)},a.prototype._toString=function(e){var t=this.object.toString(e);return o(this.object)&&(t="("+t+")"),t+this.index.toString(e)},a.prototype.toHTML=function(e){var t=this.object.toHTML(e);return o(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)},a.prototype._toTex=function(e){var t=this.object.toTex(e);return o(this.object)&&(t="\\left(' + object + '\\right)"),t+this.index.toTex(e)},a.prototype.toJSON=function(){return{mathjs:"AccessorNode",object:this.object,index:this.index}},a.fromJSON=function(e){return new a(e.object,e.index)},a}),{isClass:!0,isNode:!0}),re=["Range","Node","size"],ne=(0,s.d5)("IndexNode",re,(e=>{var{Range:t,Node:r,size:n}=e;function a(e,t){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");if(this.dimensions=e,this.dotNotation=t||!1,!Array.isArray(e)||!e.every(i.UG))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 o(e,r,n){return new t((0,i.l9)(e)?e.toNumber():e,(0,i.l9)(r)?r.toNumber():r,(0,i.l9)(n)?n.toNumber():n)}return a.prototype=new r,a.prototype.type="IndexNode",a.prototype.isIndexNode=!0,a.prototype._compile=function(e,t){var r=(0,l.UI)(this.dimensions,(function(r,a){if((0,i.ex)(r)){if(r.needsEnd()){var s=Object.create(t);s.end=!0;var u=r.start._compile(e,s),c=r.end._compile(e,s),l=r.step?r.step._compile(e,s):function(){return 1};return function(e,t,r){var i=n(r).valueOf(),s=Object.create(t);return s.end=i[a],o(u(e,s,r),c(e,s,r),l(e,s,r))}}var f=r.start._compile(e,t),p=r.end._compile(e,t),d=r.step?r.step._compile(e,t):function(){return 1};return function(e,t,r){return o(f(e,t,r),p(e,t,r),d(e,t,r))}}if((0,i.FG)(r)&&"end"===r.name){var h=Object.create(t);h.end=!0;var m=r._compile(e,h);return function(e,t,r){var i=n(r).valueOf(),o=Object.create(t);return o.end=i[a],m(e,o,r)}}var v=r._compile(e,t);return function(e,t,r){return v(e,t,r)}})),a=(0,M.YF)(e,"index");return function(e,t,n){var i=(0,l.UI)(r,(function(r){return r(e,t,n)}));return a(...i)}},a.prototype.forEach=function(e){for(var t=0;t<this.dimensions.length;t++)e(this.dimensions[t],"dimensions["+t+"]",this)},a.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 a(t,this.dotNotation)},a.prototype.clone=function(){return new a(this.dimensions.slice(0),this.dotNotation)},a.prototype.isObjectProperty=function(){return 1===this.dimensions.length&&(0,i.nu)(this.dimensions[0])&&"string"==typeof this.dimensions[0].value},a.prototype.getObjectProperty=function(){return this.isObjectProperty()?this.dimensions[0].value:null},a.prototype._toString=function(e){return this.dotNotation?"."+this.getObjectProperty():"["+this.dimensions.join(", ")+"]"},a.prototype.toJSON=function(){return{mathjs:"IndexNode",dimensions:this.dimensions,dotNotation:this.dotNotation}},a.fromJSON=function(e){return new a(e.dimensions,e.dotNotation)},a.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">'+(0,m.YU)(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>'},a.prototype._toTex=function(e){var t=this.dimensions.map((function(t){return t.toTex(e)}));return this.dotNotation?"."+this.getObjectProperty():"_{"+t.join(",")+"}"},a}),{isClass:!0,isNode:!0}),ie=["subset","?matrix","Node"],ae=(0,s.d5)("AssignmentNode",ie,(e=>{var{subset:t,matrix:r,Node:n}=e,a=K({subset:t}),o=function(e){var{subset:t,matrix:r}=e;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"==typeof e){if(!n.isObjectProperty())throw TypeError("Cannot apply a numeric index as object property");return(0,M.nI)(e,n.getObjectProperty(),i),e}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw Q(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,!(0,i.FG)(e)&&!(0,i.Yz)(e))throw new TypeError('SymbolNode or AccessorNode expected as "object"');if((0,i.FG)(e)&&"end"===e.name)throw new Error('Cannot assign to symbol "end"');if(this.index&&!(0,i.Cl)(this.index))throw new TypeError('IndexNode expected as "index"');if(!(0,i.UG)(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=C(e,t),n=C(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,s=this.value._compile(e,t),u=this.object.name;if(this.index){if(this.index.isObjectProperty()){var c=this.index.getObjectProperty();return function(e,t,n){var i=r(e,t,n),a=s(e,t,n);return(0,M.nI)(i,c,a)}}if((0,i.FG)(this.object))return function(e,t,i){var a=r(e,t,i),c=s(e,t,i),l=n(e,t,a);return(0,M.nI)(e,u,o(a,l,c)),c};var l=this.object.object._compile(e,t);if(this.object.index.isObjectProperty()){var f=this.object.index.getObjectProperty();return function(e,t,r){var i=l(e,t,r),a=(0,M.YF)(i,f),u=n(e,t,a),c=s(e,t,r);return(0,M.nI)(i,f,o(a,u,c)),c}}var p=this.object.index._compile(e,t);return function(e,t,r){var i=l(e,t,r),u=p(e,t,i),c=a(i,u),f=n(e,t,c),d=s(e,t,r);return o(i,u,o(c,f,d)),d}}if(!(0,i.FG)(this.object))throw new TypeError("SymbolNode expected as object");return function(e,t,r){return(0,M.nI)(e,u,s(e,t,r))}},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}),oe=["math","?Unit","Node"],se=(0,s.d5)("SymbolNode",oe,(e=>{var{math:t,Unit:r,Node:n}=e;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 n in t?(0,M.YF)(t,n):(0,M.YF)(e,n)};var a=i(n);return function(e,t,i){return n in e?(0,M.YF)(e,n):a?new r(null,n):function(e){throw new Error("Undefined symbol "+e)}(n)}},a.prototype.forEach=function(e){},a.prototype.map=function(e){return this.clone()},a.prototype.clone=function(){return new a(this.name)},a.prototype._toString=function(e){return this.name},a.prototype.toHTML=function(e){var t=(0,m.YU)(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=_(this.name,r);return"\\"===n[0]?n:" "+n},a}),{isClass:!0,isNode:!0});function ue(){return(ue=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}).apply(this,arguments)}var ce=["math","Node","SymbolNode"],le=(0,s.d5)("FunctionNode",ce,(e=>{var{math:t,Node:r,SymbolNode:n}=e;function a(e,t){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");if("string"==typeof e&&(e=new n(e)),!(0,i.UG)(e))throw new TypeError('Node expected as parameter "fn"');if(!Array.isArray(t)||!t.every(i.UG))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")}})}a.prototype=new r,a.prototype.type="FunctionNode",a.prototype.isFunctionNode=!0,a.prototype._compile=function(e,t){if(!(this instanceof a))throw new TypeError("No valid FunctionNode");var r=(0,l.UI)(this.args,(function(r){return r._compile(e,t)}));if((0,i.FG)(this.fn)){var n=this.fn.name,o=n in e?(0,M.YF)(e,n):void 0;if("function"==typeof o&&!0===o.rawArgs){var s=this.args;return function(t,r,i){return(n in t?(0,M.YF)(t,n):o)(s,e,ue({},t,r))}}if(1===r.length){var u=r[0];return function(e,t,r){return(n in e?(0,M.YF)(e,n):o)(u(e,t,r))}}if(2===r.length){var c=r[0],f=r[1];return function(e,t,r){return(n in e?(0,M.YF)(e,n):o)(c(e,t,r),f(e,t,r))}}return function(e,t,i){return(n in e?(0,M.YF)(e,n):o).apply(null,(0,l.UI)(r,(function(r){return r(e,t,i)})))}}if((0,i.Yz)(this.fn)&&(0,i.Cl)(this.fn.index)&&this.fn.index.isObjectProperty()){var p=this.fn.object._compile(e,t),d=this.fn.index.getObjectProperty(),h=this.args;return function(t,n,i){var a=p(t,n,i);return(0,M.np)(a,d),a[d]&&a[d].rawArgs?a[d](h,e,ue({},t,n)):a[d].apply(a,(0,l.UI)(r,(function(e){return e(t,n,i)})))}}var m=this.fn._compile(e,t),v=this.args;return function(t,n,i){var a=m(t,n,i);return a&&a.rawArgs?a(v,e,ue({},t,n)):a.apply(a,(0,l.UI)(r,(function(e){return e(t,n,i)})))}},a.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)},a.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 a(t,r)},a.prototype.clone=function(){return new a(this.fn,this.args.slice(0))};var s=a.prototype.toString;function u(e,t,r){for(var n,a="",o=/\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi,s=0;null!==(n=o.exec(e));)if(a+=e.substring(s,n.index),s=n.index,"$$"===n[0])a+="$",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(typeof u){case"string":a+=u;break;case"object":if((0,i.UG)(u))a+=u.toTex(r);else{if(!Array.isArray(u))throw new TypeError("Template: "+n[1]+" has to be a Node, String or array of Nodes");a+=u.map((function(e,t){if((0,i.UG)(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(!(0,i.UG)(u[n[2]]&&u[n[2]]))throw new TypeError("Template: "+n[1]+"["+n[2]+"] is not a Node.");a+=u[n[2]].toTex(r)}}return a+e.slice(s)}a.prototype.toString=function(e){var t,r=this.fn.toString(e);return e&&"object"==typeof e.handler&&(0,o.nr)(e.handler,r)&&(t=e.handler[r](this,e)),void 0!==t?t:s.call(this,e)},a.prototype._toString=function(e){var t=this.args.map((function(t){return t.toString(e)}));return((0,i.l7)(this.fn)?"("+this.fn.toString(e)+")":this.fn.toString(e))+"("+t.join(", ")+")"},a.prototype.toJSON=function(){return{mathjs:"FunctionNode",fn:this.fn,args:this.args}},a.fromJSON=function(e){return new a(e.fn,e.args)},a.prototype.toHTML=function(e){var t=this.args.map((function(t){return t.toHTML(e)}));return'<span class="math-function">'+(0,m.YU)(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=a.prototype.toTex;return a.prototype.toTex=function(e){var t;return e&&"object"==typeof e.handler&&(0,o.nr)(e.handler,this.name)&&(t=e.handler[this.name](this,e)),void 0!==t?t:c.call(this,e)},a.prototype._toTex=function(e){var r,n,i=this.args.map((function(t){return t.toTex(e)}));switch(x[this.name]&&(r=x[this.name]),!t[this.name]||"function"!=typeof t[this.name].toTex&&"object"!=typeof t[this.name].toTex&&"string"!=typeof t[this.name].toTex||(r=t[this.name].toTex),typeof r){case"function":n=r(this,e);break;case"string":n=u(r,this,e);break;case"object":switch(typeof 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)},a.prototype.getIdentifier=function(){return this.type+":"+this.name},a}),{isClass:!0,isNode:!0}),fe=r(4344);function pe(){return(pe=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}).apply(this,arguments)}var de="parse",he=["typed","numeric","config","AccessorNode","ArrayNode","AssignmentNode","BlockNode","ConditionalNode","ConstantNode","FunctionAssignmentNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","RangeNode","RelationalNode","SymbolNode"],me=(0,s.d5)(de,he,(e=>{var{typed:t,numeric:r,config:n,AccessorNode:a,ArrayNode:s,AssignmentNode:u,BlockNode:c,ConditionalNode:l,ConstantNode:f,FunctionAssignmentNode:p,FunctionNode:d,IndexNode:h,ObjectNode:m,OperatorNode:v,ParenthesisNode:y,RangeNode:g,RelationalNode:x,SymbolNode:b}=e,w=t(de,{string:function(e){return j(e,{})},"Array | Matrix":function(e){return _(e,{})},"string, Object":function(e,t){return j(e,void 0!==t.nodes?t.nodes:{})},"Array | Matrix, Object":_});function _(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},r=void 0!==t.nodes?t.nodes:{};return(0,fe.Fh)(e,(function(e){if("string"!=typeof e)throw new TypeError("String expected");return j(e,r)}))}var N={",":!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},E={mod:!0,to:!0,in:!0,and:!0,xor:!0,or:!0,not:!0},M={true:!0,false:!1,null:null,undefined:void 0},S=["NaN","Infinity"];function A(e,t){return e.expression.substr(e.index,t)}function O(e){return A(e,1)}function k(e){e.index++}function T(e){return e.expression.charAt(e.index-1)}function C(e){return e.expression.charAt(e.index+1)}function I(e){for(e.tokenType=0,e.token="",e.comment="";w.isWhitespace(O(e),e.nestingLevel);)k(e);if("#"===O(e))for(;"\n"!==O(e)&&""!==O(e);)e.comment+=O(e),k(e);if(""!==O(e)){if("\n"===O(e)&&!e.nestingLevel)return e.tokenType=1,e.token=O(e),void k(e);var t=O(e),r=A(e,2),n=A(e,3);if(3===n.length&&N[n])return e.tokenType=1,e.token=n,k(e),k(e),void k(e);if(2===r.length&&N[r])return e.tokenType=1,e.token=r,k(e),void k(e);if(N[t])return e.tokenType=1,e.token=t,void k(e);if(w.isDigitDot(t)){e.tokenType=2;var i=A(e,2);if("0b"===i||"0o"===i||"0x"===i){for(e.token+=O(e),k(e),e.token+=O(e),k(e);w.isHexDigit(O(e));)e.token+=O(e),k(e);if("."===O(e))for(e.token+=".",k(e);w.isHexDigit(O(e));)e.token+=O(e),k(e);else if("i"===O(e))for(e.token+="i",k(e);w.isDigit(O(e));)e.token+=O(e),k(e);return}if("."===O(e))e.token+=O(e),k(e),w.isDigit(O(e))||(e.tokenType=1);else{for(;w.isDigit(O(e));)e.token+=O(e),k(e);w.isDecimalMark(O(e),C(e))&&(e.token+=O(e),k(e))}for(;w.isDigit(O(e));)e.token+=O(e),k(e);if("E"===O(e)||"e"===O(e))if(w.isDigit(C(e))||"-"===C(e)||"+"===C(e)){if(e.token+=O(e),k(e),"+"!==O(e)&&"-"!==O(e)||(e.token+=O(e),k(e)),!w.isDigit(O(e)))throw ne(e,'Digit expected, got "'+O(e)+'"');for(;w.isDigit(O(e));)e.token+=O(e),k(e);if(w.isDecimalMark(O(e),C(e)))throw ne(e,'Digit expected, got "'+O(e)+'"')}else if("."===C(e))throw k(e),ne(e,'Digit expected, got "'+O(e)+'"')}else{if(!w.isAlpha(O(e),T(e),C(e))){for(e.tokenType=4;""!==O(e);)e.token+=O(e),k(e);throw ne(e,'Syntax error in part "'+e.token+'"')}for(;w.isAlpha(O(e),T(e),C(e))||w.isDigit(O(e));)e.token+=O(e),k(e);(0,o.nr)(E,e.token)?e.tokenType=1:e.tokenType=3}}else e.tokenType=1}function D(e){do{I(e)}while("\n"===e.token)}function z(e){e.nestingLevel++}function B(e){e.nestingLevel--}function j(e,t){var r={extraNodes:{},expression:"",comment:"",index:0,token:"",tokenType:0,nestingLevel:0,conditionalLevel:null};pe(r,{expression:e,extraNodes:t}),I(r);var n=function(e){var t,r,n=[];for(""!==e.token&&"\n"!==e.token&&";"!==e.token&&((t=U(e)).comment=e.comment);"\n"===e.token||";"===e.token;)0===n.length&&t&&(r=";"!==e.token,n.push({node:t,visible:r})),I(e),"\n"!==e.token&&";"!==e.token&&""!==e.token&&((t=U(e)).comment=e.comment,r=";"!==e.token,n.push({node:t,visible:r}));return n.length>0?new c(n):(t||((t=new f(void 0)).comment=e.comment),t)}(r);if(""!==r.token)throw 1===r.tokenType?ie(r,"Unexpected operator "+r.token):ne(r,'Unexpected part "'+r.token+'"');return n}function U(e){var t,r,n,a,o=function(e){for(var t=function(e){for(var t=R(e);"or"===e.token;)D(e),t=new v("or","or",[t,R(e)]);return t}(e);"?"===e.token;){var r=e.conditionalLevel;e.conditionalLevel=e.nestingLevel,D(e);var n=t,i=U(e);if(":"!==e.token)throw ne(e,"False part of conditional expression expected");e.conditionalLevel=null,D(e);var a=U(e);t=new l(n,i,a),e.conditionalLevel=r}return t}(e);if("="===e.token){if((0,i.FG)(o))return t=o.name,D(e),n=U(e),new u(new b(t),n);if((0,i.Yz)(o))return D(e),n=U(e),new u(o.object,o.index,n);if((0,i.VO)(o)&&(0,i.FG)(o.fn)&&(a=!0,r=[],t=o.name,o.args.forEach((function(e,t){(0,i.FG)(e)?r[t]=e.name:a=!1})),a))return D(e),n=U(e),new p(t,r,n);throw ne(e,"Invalid left hand side of assignment operator =")}return o}function R(e){for(var t=q(e);"xor"===e.token;)D(e),t=new v("xor","xor",[t,q(e)]);return t}function q(e){for(var t=F(e);"and"===e.token;)D(e),t=new v("and","and",[t,F(e)]);return t}function F(e){for(var t=P(e);"|"===e.token;)D(e),t=new v("|","bitOr",[t,P(e)]);return t}function P(e){for(var t=L(e);"^|"===e.token;)D(e),t=new v("^|","bitXor",[t,L(e)]);return t}function L(e){for(var t=H(e);"&"===e.token;)D(e),t=new v("&","bitAnd",[t,H(e)]);return t}function H(e){for(var t=[G(e)],r=[],n={"==":"equal","!=":"unequal","<":"smaller",">":"larger","<=":"smallerEq",">=":"largerEq"};(0,o.nr)(n,e.token);){var i={name:e.token,fn:n[e.token]};r.push(i),D(e),t.push(G(e))}return 1===t.length?t[0]:2===t.length?new v(r[0].name,r[0].fn,t):new x(r.map((e=>e.fn)),t)}function G(e){var t,r,n,i;t=Z(e);for(var a={"<<":"leftShift",">>":"rightArithShift",">>>":"rightLogShift"};(0,o.nr)(a,e.token);)n=a[r=e.token],D(e),i=[t,Z(e)],t=new v(r,n,i);return t}function Z(e){var t,r,n,i;t=W(e);for(var a={to:"to",in:"to"};(0,o.nr)(a,e.token);)n=a[r=e.token],D(e),"in"===r&&""===e.token?t=new v("*","multiply",[t,new b("in")],!0):(i=[t,W(e)],t=new v(r,n,i));return t}function W(e){var t,r=[];if(t=":"===e.token?new f(1):$(e),":"===e.token&&e.conditionalLevel!==e.nestingLevel){for(r.push(t);":"===e.token&&r.length<3;)D(e),")"===e.token||"]"===e.token||","===e.token||""===e.token?r.push(new b("end")):r.push($(e));t=3===r.length?new g(r[0],r[2],r[1]):new g(r[0],r[1])}return t}function $(e){var t,r,n,i;t=V(e);for(var a={"+":"add","-":"subtract"};(0,o.nr)(a,e.token);)n=a[r=e.token],D(e),i=[t,V(e)],t=new v(r,n,i);return t}function V(e){var t,r,n,i;r=t=J(e);for(var a={"*":"multiply",".*":"dotMultiply","/":"divide","./":"dotDivide","%":"mod",mod:"mod"};(0,o.nr)(a,e.token);)i=a[n=e.token],D(e),r=J(e),t=new v(n,i,[t,r]);return t}function J(e){var t,r;for(r=t=Y(e);3===e.tokenType||"in"===e.token&&(0,i.nu)(t)||!(2!==e.tokenType||(0,i.nu)(r)||(0,i.bV)(r)&&"!"!==r.op)||"("===e.token;)r=Y(e),t=new v("*","multiply",[t,r],!0);return t}function Y(e){for(var t=X(e),r=t,n=[];"/"===e.token&&(0,i.nu)(r);){if(n.push(pe({},e)),D(e),2!==e.tokenType){pe(e,n.pop());break}if(n.push(pe({},e)),D(e),3!==e.tokenType&&"("!==e.token){n.pop(),pe(e,n.pop());break}pe(e,n.pop()),n.pop(),r=X(e),t=new v("/","divide",[t,r])}return t}function X(e){var t,i,a,u={"-":"unaryMinus","+":"unaryPlus","~":"bitNot",not:"not"};return(0,o.nr)(u,e.token)?(a=u[e.token],t=e.token,D(e),i=[X(e)],new v(t,a,i)):function(e){var t,i,a,u;return t=function(e){var t,i,a;t=function(e){var t=[];if(3===e.tokenType&&(0,o.nr)(e.extraNodes,e.token)){var i=e.extraNodes[e.token];if(I(e),"("===e.token){if(t=[],z(e),I(e),")"!==e.token)for(t.push(U(e));","===e.token;)I(e),t.push(U(e));if(")"!==e.token)throw ne(e,"Parenthesis ) expected");B(e),I(e)}return new i(t)}return function(e){var t;return 3===e.tokenType||1===e.tokenType&&e.token in E?(t=e.token,I(e),Q(e,(0,o.nr)(M,t)?new f(M[t]):-1!==S.indexOf(t)?new f(r(t,"number")):new b(t))):function(e){var t;return'"'===e.token?(t=K(e),Q(e,new f(t))):function(e){var t;return"'"===e.token?(t=ee(e),Q(e,new f(t))):function(e){var t,i,a,o;if("["===e.token){if(z(e),I(e),"]"!==e.token){var u=te(e);if(";"===e.token){for(a=1,i=[u];";"===e.token;)I(e),i[a]=te(e),a++;if("]"!==e.token)throw ne(e,"End of matrix ] expected");B(e),I(e),o=i[0].items.length;for(var c=1;c<a;c++)if(i[c].items.length!==o)throw ie(e,"Column dimensions mismatch ("+i[c].items.length+" !== "+o+")");t=new s(i)}else{if("]"!==e.token)throw ne(e,"End of matrix ] expected");B(e),I(e),t=u}}else B(e),I(e),t=new s([]);return Q(e,t)}return function(e){if("{"===e.token){var t;z(e);var i={};do{if(I(e),"}"!==e.token){if('"'===e.token)t=K(e);else if("'"===e.token)t=ee(e);else{if(!(3===e.tokenType||1===e.tokenType&&e.token in E))throw ne(e,"Symbol or string expected as object key");t=e.token,I(e)}if(":"!==e.token)throw ne(e,"Colon : expected after object key");I(e),i[t]=U(e)}}while(","===e.token);if("}"!==e.token)throw ne(e,"Comma , or bracket } expected after object value");B(e),I(e);var a=new m(i);return Q(e,a)}return function(e){var t;return 2===e.tokenType?(t=e.token,I(e),new f(r(t,n.number))):function(e){var t;if("("===e.token){if(z(e),I(e),t=U(e),")"!==e.token)throw ne(e,"Parenthesis ) expected");return B(e),I(e),Q(e,t=new y(t))}return function(e){throw""===e.token?ne(e,"Unexpected end of expression"):ne(e,"Value expected")}(e)}(e)}(e)}(e)}(e)}(e)}(e)}(e)}(e);for(var u={"!":"factorial","'":"ctranspose"};(0,o.nr)(u,e.token);)a=u[i=e.token],I(e),t=Q(e,t=new v(i,a,[t]));return t}(e),("^"===e.token||".^"===e.token)&&(a="^"===(i=e.token)?"pow":"dotPow",D(e),u=[t,X(e)],t=new v(i,a,u)),t}(e)}function Q(e,t,r){for(var n;!("("!==e.token&&"["!==e.token&&"."!==e.token||r&&-1===r.indexOf(e.token));)if(n=[],"("===e.token){if(!(0,i.FG)(t)&&!(0,i.Yz)(t))return t;if(z(e),I(e),")"!==e.token)for(n.push(U(e));","===e.token;)I(e),n.push(U(e));if(")"!==e.token)throw ne(e,"Parenthesis ) expected");B(e),I(e),t=new d(t,n)}else if("["===e.token){if(z(e),I(e),"]"!==e.token)for(n.push(U(e));","===e.token;)I(e),n.push(U(e));if("]"!==e.token)throw ne(e,"Parenthesis ] expected");B(e),I(e),t=new a(t,new h(n))}else{if(I(e),3!==e.tokenType)throw ne(e,"Property name expected after dot");n.push(new f(e.token)),I(e),t=new a(t,new h(n,!0))}return t}function K(e){for(var t="";""!==O(e)&&'"'!==O(e);)"\\"===O(e)&&(t+=O(e),k(e)),t+=O(e),k(e);if(I(e),'"'!==e.token)throw ne(e,'End of string " expected');return I(e),JSON.parse('"'+t+'"')}function ee(e){for(var t="";""!==O(e)&&"'"!==O(e);)"\\"===O(e)&&(t+=O(e),k(e)),t+=O(e),k(e);if(I(e),"'"!==e.token)throw ne(e,"End of string ' expected");return I(e),JSON.parse('"'+t+'"')}function te(e){for(var t=[U(e)],r=1;","===e.token;)I(e),t[r]=U(e),r++;return new s(t)}function re(e){return e.index-e.token.length+1}function ne(e,t){var r=re(e),n=new SyntaxError(t+" (char "+r+")");return n.char=r,n}function ie(e,t){var r=re(e),n=new SyntaxError(t+" (char "+r+")");return n.char=r,n}return w.isAlpha=function(e,t,r){return w.isValidLatinOrGreek(e)||w.isValidMathSymbol(e,r)||w.isValidMathSymbol(t,e)},w.isValidLatinOrGreek=function(e){return/^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(e)},w.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)},w.isWhitespace=function(e,t){return" "===e||"\t"===e||"\n"===e&&t>0},w.isDecimalMark=function(e,t){return"."===e&&"/"!==t&&"*"!==t&&"^"!==t},w.isDigitDot=function(e){return e>="0"&&e<="9"||"."===e},w.isDigit=function(e){return e>="0"&&e<="9"},w.isHexDigit=function(e){return e>="0"&&e<="9"||e>="a"&&e<="f"||e>="A"&&e<="F"},w})),ve="evaluate",ye=["typed","parse"],ge=(0,s.d5)(ve,ye,(e=>{var{typed:t,parse:r}=e;return t(ve,{string:function(e){return r(e).compile().evaluate({})},"string, Object":function(e,t){return r(e).compile().evaluate(t)},"Array | Matrix":function(e){var t={};return(0,fe.Fh)(e,(function(e){return r(e).compile().evaluate(t)}))},"Array | Matrix, Object":function(e,t){return(0,fe.Fh)(e,(function(e){return r(e).compile().evaluate(t)}))}})})),xe=["parse"],be=(0,s.d5)("Help",xe,(e=>{var{parse:t}=e;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={},a=0;a<e.examples.length;a++){var o=e.examples[a];r+="    "+o+"\n";var s=void 0;try{s=t(o).compile().evaluate(n)}catch(e){s=e}void 0===s||(0,i.x1)(s)||(r+="        "+(0,m.WU)(s,{precision:14})+"\n")}r+="\n"}return e.seealso&&e.seealso.length&&(r+="See also: "+e.seealso.join(", ")+"\n"),r},r.prototype.toJSON=function(){var e=(0,o.d9)(this.doc);return e.mathjs="Help",e},r.fromJSON=function(e){var t={};return Object.keys(e).filter((e=>"mathjs"!==e)).forEach((r=>{t[r]=e[r]})),new r(t)},r.prototype.valueOf=r.prototype.toString,r}),{isClass:!0}),we=["parse"],_e=(0,s.d5)("Parser",we,(e=>{var{parse:t}=e;function r(){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.scope={}}return r.prototype.type="Parser",r.prototype.isParser=!0,r.prototype.evaluate=function(e){return t(e).compile().evaluate(this.scope)},r.prototype.get=function(e){return e in this.scope?(0,M.YF)(this.scope,e):void 0},r.prototype.getAll=function(){return(0,o.l7)({},this.scope)},r.prototype.set=function(e,t){return(0,M.nI)(this.scope,e,t)},r.prototype.remove=function(e){delete this.scope[e]},r.prototype.clear=function(){for(var e in this.scope)(0,o.nr)(this.scope,e)&&delete this.scope[e]},r}),{isClass:!0}),Ne={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"]},Ee={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"]},Me={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(num,den)"],description:"Create a fraction from a number or from a numerator and denominator.",examples:["fraction(0.125)","fraction(1, 3) + fraction(2, 5)"],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:Ee,E:Ee,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:Ne,PI:Ne,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"]},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:["derivative","parse","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"]},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, 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"]},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:["forEach([1, 2, 3], function(val) { console.log(val) })"],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"]},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"]},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 a matrix or string. Indexes are one-based. Both the ranges lower-bound and upper-bound are included.",examples:["d = [1, 2; 3, 4]","e = []","e[1, 1:2] = [5, 6]","e[2, :] = [7, 8]","f = d * e","f[2, 1]","f[:, 1]"],seealso:["concat","det","diag","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 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:[]},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"]},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"]}},Se="help",Ae=["typed","mathWithTransform","Help"],Oe=(0,s.d5)(Se,Ae,(e=>{var{typed:t,mathWithTransform:r,Help:n}=e;return t(Se,{any:function(e){var t,i=e;if("string"!=typeof e)for(t in r)if((0,o.nr)(r,t)&&e===r[t]){i=t;break}var a=(0,M.YF)(Me,i);if(!a){var s="function"==typeof i?i.name:i;throw new Error('No documentation found on "'+s+'"')}return new n(a)}})})),ke="compile",Te=["typed","parse"],Ce=(0,s.d5)(ke,Te,(e=>{var{typed:t,parse:r}=e;return t(ke,{string:function(e){return r(e).compile()},"Array | Matrix":function(e){return(0,fe.Fh)(e,(function(e){return r(e).compile()}))}})})),Ie=["FunctionNode","OperatorNode","SymbolNode"],De=(0,s.d5)("simplifyUtil",Ie,(e=>{var{FunctionNode:t,OperatorNode:r,SymbolNode:n}=e,a={add:!0,multiply:!0},s={add:!0,multiply:!0};function u(e,t){if(!(0,i.bV)(e))return!1;var r=e.fn.toString();return t&&(0,o.nr)(t,r)&&(0,o.nr)(t[r],"associative")?t[r].associative:s[r]||!1}function c(e){var t,r=[];return u(e)?(t=e.op,function e(n){for(var a=0;a<n.args.length;a++){var o=n.args[a];(0,i.bV)(o)&&t===o.op?e(o):r.push(o)}}(e),r):e.args}function l(e){return(0,i.bV)(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:l,isCommutative:function(e,t){if(!(0,i.bV)(e))return!0;var r=e.fn.toString();return t&&(0,o.nr)(t,r)&&(0,o.nr)(t[r],"commutative")?t[r].commutative:a[r]||!1},isAssociative:u,flatten:function e(t){if(!t.args||0===t.args.length)return t;t.args=c(t);for(var r=0;r<t.args.length;r++)e(t.args[r])},allChildren:c,unflattenr:function e(t){if(t.args&&0!==t.args.length){for(var r=l(t),n=t.args.length,i=0;i<n;i++)e(t.args[i]);if(n>2&&u(t)){for(var a=t.args.pop();t.args.length>0;)a=r([t.args.pop(),a]);t.args=a.args}}},unflattenl:function e(t){if(t.args&&0!==t.args.length){for(var r=l(t),n=t.args.length,i=0;i<n;i++)e(t.args[i]);if(n>2&&u(t)){for(var a=t.args.shift();t.args.length>0;)a=r([a,t.args.shift()]);t.args=a.args}}}}})),ze=["equal","isZero","add","subtract","multiply","divide","pow","ConstantNode","OperatorNode","FunctionNode","ParenthesisNode"],Be=(0,s.d5)("simplifyCore",ze,(e=>{var{equal:t,isZero:r,add:n,subtract:a,multiply:o,divide:s,pow:u,ConstantNode:c,OperatorNode:l,FunctionNode:f,ParenthesisNode:p}=e,d=new c(0),h=new c(1);return function e(m){if((0,i.bV)(m)&&m.isUnary()){var v=e(m.args[0]);if("+"===m.op)return v;if("-"===m.op){if((0,i.bV)(v)){if(v.isUnary()&&"-"===v.op)return v.args[0];if(v.isBinary()&&"subtract"===v.fn)return new l("-","subtract",[v.args[1],v.args[0]])}return new l(m.op,m.fn,[v])}}else if((0,i.bV)(m)&&m.isBinary()){var y=e(m.args[0]),g=e(m.args[1]);if("+"===m.op){if((0,i.nu)(y)){if(r(y.value))return g;if((0,i.nu)(g))return new c(n(y.value,g.value))}return(0,i.nu)(g)&&r(g.value)?y:(0,i.bV)(g)&&g.isUnary()&&"-"===g.op?new l("-","subtract",[y,g.args[0]]):new l(m.op,m.fn,g?[y,g]:[y])}if("-"===m.op){if((0,i.nu)(y)&&g){if((0,i.nu)(g))return new c(a(y.value,g.value));if(r(y.value))return new l("-","unaryMinus",[g])}if("subtract"===m.fn)return(0,i.nu)(g)&&r(g.value)?y:(0,i.bV)(g)&&g.isUnary()&&"-"===g.op?e(new l("+","add",[y,g.args[0]])):new l(m.op,m.fn,[y,g])}else{if("*"===m.op){if((0,i.nu)(y)){if(r(y.value))return d;if(t(y.value,1))return g;if((0,i.nu)(g))return new c(o(y.value,g.value))}if((0,i.nu)(g)){if(r(g.value))return d;if(t(g.value,1))return y;if((0,i.bV)(y)&&y.isBinary()&&y.op===m.op){var x=y.args[0];if((0,i.nu)(x)){var b=new c(o(x.value,g.value));return new l(m.op,m.fn,[b,y.args[1]],m.implicit)}}return new l(m.op,m.fn,[g,y],m.implicit)}return new l(m.op,m.fn,[y,g],m.implicit)}if("/"===m.op){if((0,i.nu)(y)){if(r(y.value))return d;if((0,i.nu)(g)&&(t(g.value,1)||t(g.value,2)||t(g.value,4)))return new c(s(y.value,g.value))}return new l(m.op,m.fn,[y,g])}if("^"===m.op){if((0,i.nu)(g)){if(r(g.value))return h;if(t(g.value,1))return y;if((0,i.nu)(y))return new c(u(y.value,g.value));if((0,i.bV)(y)&&y.isBinary()&&"^"===y.op){var w=y.args[1];if((0,i.nu)(w))return new l(m.op,m.fn,[y.args[0],new c(o(w.value,g.value))])}}return new l(m.op,m.fn,[y,g])}}}else{if((0,i.Ig)(m)){var _=e(m.content);return(0,i.Ig)(_)||(0,i.FG)(_)||(0,i.nu)(_)?_:new p(_)}if((0,i.VO)(m)){var N=m.args.map(e).map((function(e){return(0,i.Ig)(e)?e.content:e}));return new f(e(m.fn),N)}}return m}})),je=r(5180),Ue=["typed","config","mathWithTransform","?fraction","?bignumber","ConstantNode","OperatorNode","FunctionNode","SymbolNode"],Re=(0,s.d5)("simplifyConstant",Ue,(e=>{var{typed:t,config:r,mathWithTransform:n,fraction:a,bignumber:o,ConstantNode:s,OperatorNode:u,FunctionNode:c,SymbolNode:l}=e,{isCommutative:f,isAssociative:p,allChildren:d,createMakeNodeFunction:h}=De({FunctionNode:c,OperatorNode:u,SymbolNode:l});function m(e,t,r){try{return g(n[e].apply(null,t),r)}catch(a){return t=t.map((function(e){return(0,i.yQ)(e)?e.valueOf():e})),g(n[e].apply(null,t),r)}}var v=t({Fraction:function(e){var t,r=e.s*e.n;return t=r<0?new u("-","unaryMinus",[new s(-r)]):new s(r),1===e.d?t:new u("/","divide",[t,new s(e.d)])},number:function(e){return e<0?x(new s(-e)):new s(e)},BigNumber:function(e){return e<0?x(new s(-e)):new s(e)},Complex:function(e){throw new Error("Cannot convert Complex number to Node")}});function y(e,t){if(t&&!1!==t.exactFractions&&isFinite(e)&&a){var r=a(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 g=t({"string, Object":function(e,t){return"BigNumber"===r.number?(void 0===o&&(0,je.R3)(),o(e)):"Fraction"===r.number?(void 0===a&&(0,je.nG)(),a(e)):y(parseFloat(e),t)},"Fraction, Object":function(e,t){return e},"BigNumber, Object":function(e,t){return e},"number, Object":function(e,t){return y(e,t)},"Complex, Object":function(e,t){return 0!==e.im?e:y(e.re,t)}});function x(e){return new u("-","unaryMinus",[e])}function b(e,t,r,n){return t.reduce((function(t,a){if((0,i.UG)(t)||(0,i.UG)(a))(0,i.UG)(t)?(0,i.UG)(a)||(a=v(a)):t=v(t);else{try{return m(e,[t,a],n)}catch(e){}t=v(t),a=v(a)}return r([t,a])}))}function w(e,t){switch(e.type){case"SymbolNode":return e;case"ConstantNode":return"number"!=typeof e.value&&isNaN(e.value)?e:g(e.value,t);case"FunctionNode":if(n[e.name]&&n[e.name].rawArgs)return e;if(-1===["add","multiply"].indexOf(e.name)){var r=e.args.map((e=>w(e,t)));if(!r.some(i.UG))try{return m(e.name,r,t)}catch(e){}return r=r.map((function(e){return(0,i.UG)(e)?e:v(e)})),new c(e.name,r)}case"OperatorNode":var a,o,s=e.fn.toString(),u=h(e);if((0,i.bV)(e)&&e.isUnary())a=[w(e.args[0],t)],o=(0,i.UG)(a[0])?u(a):m(s,a,t);else if(p(e))if(a=(a=d(e)).map((e=>w(e,t))),f(s)){for(var l=[],y=[],x=0;x<a.length;x++)(0,i.UG)(a[x])?y.push(a[x]):l.push(a[x]);l.length>1?(o=b(s,l,u,t),y.unshift(o),o=b(s,y,u,t)):o=b(s,a,u,t)}else o=b(s,a,u,t);else o=b(s,a=e.args.map((e=>w(e,t))),u,t);return o;case"ParenthesisNode":return w(e.content,t);case"AccessorNode":case"ArrayNode":case"AssignmentNode":case"BlockNode":case"FunctionAssignmentNode":case"IndexNode":case"ObjectNode":case"RangeNode":case"ConditionalNode":default:throw new Error("Unimplemented node type in simplifyConstant: ".concat(e.type))}}return function(e,t){var r=w(e,t);return(0,i.UG)(r)?r:v(r)}})),qe=["parse","FunctionNode","OperatorNode","ParenthesisNode"],Fe=(0,s.d5)("resolve",qe,(e=>{var{parse:t,FunctionNode:r,OperatorNode:n,ParenthesisNode:a}=e;return function e(o,s){if(!s)return o;if((0,i.FG)(o)){var u=s[o.name];if((0,i.UG)(u))return e(u,s);if("number"==typeof u)return t(String(u))}else{if((0,i.bV)(o)){var c=o.args.map((function(t){return e(t,s)}));return new n(o.op,o.fn,c,o.implicit)}if((0,i.Ig)(o))return new a(e(o.content,s));if((0,i.VO)(o)){var l=o.args.map((function(t){return e(t,s)}));return new r(o.name,l)}}return o}})),Pe=["config","typed","parse","add","subtract","multiply","divide","pow","isZero","equal","?fraction","?bignumber","mathWithTransform","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode","SymbolNode"],Le=(0,s.d5)("simplify",Pe,(e=>{var{config:t,typed:r,parse:n,add:a,subtract:s,multiply:u,divide:c,pow:l,isZero:f,equal:p,fraction:d,bignumber:h,mathWithTransform:m,ConstantNode:v,FunctionNode:y,OperatorNode:g,ParenthesisNode:x,SymbolNode:b}=e,w=Re({typed:r,config:t,mathWithTransform:m,fraction:d,bignumber:h,ConstantNode:v,OperatorNode:g,FunctionNode:y,SymbolNode:b}),_=Be({equal:p,isZero:f,add:a,subtract:s,multiply:u,divide:c,pow:l,ConstantNode:v,OperatorNode:g,FunctionNode:y,ParenthesisNode:x}),N=Fe({parse:n,FunctionNode:y,OperatorNode:g,ParenthesisNode:x}),{isCommutative:E,isAssociative:M,flatten:S,unflattenr:A,unflattenl:O,createMakeNodeFunction:k}=De({FunctionNode:y,OperatorNode:g,SymbolNode:b}),T=r("simplify",{string:function(e){return this(n(e),this.rules,{},{})},"string, Object":function(e,t){return this(n(e),this.rules,t,{})},"string, Object, Object":function(e,t,r){return this(n(e),this.rules,t,r)},"string, Array":function(e,t){return this(n(e),t,{},{})},"string, Array, Object":function(e,t,r){return this(n(e),t,r,{})},"string, Array, Object, Object":function(e,t,r,i){return this(n(e),t,r,i)},"Node, Object":function(e,t){return this(e,this.rules,t,{})},"Node, Object, Object":function(e,t,r){return this(e,this.rules,t,r)},Node:function(e){return this(e,this.rules,{},{})},"Node, Array":function(e,t){return this(e,t,{},{})},"Node, Array, Object":function(e,t,r){return this(e,t,r,{})},"Node, Array, Object, Object":function(e,t,r,i){t=function(e){for(var t=[],r=0;r<e.length;r++){var i=e[r],a=void 0,o=typeof i;switch(o){case"string":var s=i.split("->");if(2!==s.length)throw SyntaxError("Could not parse rule: "+i);i={l:s[0],r:s[1]};case"object":if(a={l:C(n(i.l)),r:C(n(i.r))},i.context&&(a.evaluate=i.context),i.evaluate&&(a.evaluate=n(i.evaluate)),M(a.l)){var u=k(a.l),c=new b("_p"+D++);a.expanded={},a.expanded.l=u([a.l.clone(),c]),S(a.expanded.l),A(a.expanded.l),a.expanded.r=u([a.r,c])}break;case"function":a=i;break;default:throw TypeError("Unsupported type of rule: "+o)}t.push(a)}return t}(t);for(var a=N(e,r),o={},s=(a=C(a)).toString({parenthesis:"all"});!o[s];){o[s]=!0,D=0;for(var u=0;u<t.length;u++)"function"==typeof t[u]?a=t[u](a,i):(S(a),a=z(a,t[u])),O(a);s=a.toString({parenthesis:"all"})}return a}});function C(e){return e.transform((function(e,t,r){return(0,i.Ig)(e)?C(e.content):e}))}T.simplifyCore=_,T.resolve=N;var I={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};T.rules=[_,{l:"log(e)",r:"1"},{l:"n-n1",r:"n+-n1"},{l:"-(c*v)",r:"(-c) * v"},{l:"-v",r:"(-1) * v"},{l:"n/n1^n2",r:"n*n1^-n2"},{l:"n/n1",r:"n*n1^-1"},{l:"(n ^ n1) ^ n2",r:"n ^ (n1 * n2)"},{l:"n*n",r:"n^2"},{l:"n * n^n1",r:"n^(n1+1)"},{l:"n^n1 * n^n2",r:"n^(n1+n2)"},{l:"n+n",r:"2*n"},{l:"n+-n",r:"0"},{l:"n1*n2 + n2",r:"(n1+1)*n2"},{l:"n1*n3 + n2*n3",r:"(n1+n2)*n3"},{l:"n1 + -1 * (n2 + n3)",r:"n1 + -1 * n2 + -1 * n3"},w,{l:"(-n)*n1",r:"-(n*n1)"},{l:"c+v",r:"v+c",context:{add:{commutative:!1}}},{l:"v*c",r:"c*v",context:{multiply:{commutative:!1}}},{l:"n+-n1",r:"n-n1"},{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:"n-(n1+n2)",r:"n-n1-n2"},{l:"1*n",r:"n"},{l:"n1/(n2/n3)",r:"(n1*n3)/n2"}];var D=0;var z=r("applyRule",{"Node, Object":function(e,t){var r=e;if(r instanceof g||r instanceof y){if(r.args)for(var n=0;n<r.args.length;n++)r.args[n]=z(r.args[n],t)}else r instanceof x&&r.content&&(r.content=z(r.content,t));var i=t.r,a=U(t.l,r)[0];if(!a&&t.expanded&&(i=t.expanded.r,a=U(t.expanded.l,r)[0]),a){var s=r.implicit;r=i.clone(),s&&"implicit"in i&&(r.implicit=!0),r=r.transform((function(e){return e.isSymbolNode&&(0,o.nr)(a.placeholders,e.name)?a.placeholders[e.name].clone():e}))}return r}});function B(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((0,o.nr)(e.placeholders,n)&&(r.placeholders[n]=e.placeholders[n],(0,o.nr)(t.placeholders,n)&&!R(e.placeholders[n],t.placeholders[n])))return null;for(var i in t.placeholders)(0,o.nr)(t.placeholders,i)&&(r.placeholders[i]=t.placeholders[i]);return r}function j(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=B(e[i],t[a]))&&n.push(r);return n}function U(e,t,r){var n=[{placeholders:{}}];if(e instanceof g&&t instanceof g||e instanceof y&&t instanceof y){if(e instanceof g){if(e.op!==t.op||e.fn!==t.fn)return[]}else if(e instanceof y&&e.name!==t.name)return[];if(!(1===t.args.length&&1===e.args.length||!M(t)&&t.args.length===e.args.length||r)){if(t.args.length>=2&&2===e.args.length){for(var a=function(e,t){var r,n,i=[],a=k(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 r=1===(n=e.args.slice(1)).length?n[0]:a(n),i.push(a([e.args[0],r]));return i}(t,e.context),o=[],s=0;s<a.length;s++){var u=U(e,a[s],!0);o=o.concat(u)}return o}if(e.args.length>2)throw Error("Unexpected non-binary associative function: "+e.toString());return[]}for(var c=[],l=0;l<e.args.length;l++){var f=U(e.args[l],t.args[l]);if(0===f.length)return[];c.push(f)}n=function(e){if(0===e.length)return e;for(var t=e.reduce(j),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}(c)}else if(e instanceof b){if(0===e.name.length)throw new Error("Symbol in rule has 0 length...!?");if(I[e.name]){if(e.name!==t.name)return[]}else if("n"===e.name[0]||"_p"===e.name.substring(0,2))n[0].placeholders[e.name]=t;else if("v"===e.name[0]){if((0,i.nu)(t))return[];n[0].placeholders[e.name]=t}else{if("c"!==e.name[0])throw new Error("Invalid symbol in rule: "+e.name);if(!(t instanceof v))return[];n[0].placeholders[e.name]=t}}else{if(!(e instanceof v))return[];if(!p(e.value,t.value))return[]}return n}function R(e,t){if(e instanceof v&&t instanceof v){if(!p(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 y&&t instanceof y))return!1;if(e instanceof g){if(e.op!==t.op||e.fn!==t.fn)return!1}else if(e instanceof y&&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(!R(e.args[r],t.args[r]))return!1}return!0}return T})),He=r(9139),Ge="rationalize",Ze=["config","typed","equal","isZero","add","subtract","multiply","divide","pow","parse","simplify","?bignumber","?fraction","mathWithTransform","ConstantNode","OperatorNode","FunctionNode","SymbolNode","ParenthesisNode"],We=(0,s.d5)(Ge,Ze,(e=>{var{config:t,typed:r,equal:n,isZero:i,add:a,subtract:o,multiply:s,divide:u,pow:c,parse:l,simplify:f,fraction:p,bignumber:d,mathWithTransform:h,ConstantNode:m,OperatorNode:v,FunctionNode:y,SymbolNode:g,ParenthesisNode:x}=e,b=Re({typed:r,config:t,mathWithTransform:h,fraction:p,bignumber:d,ConstantNode:m,OperatorNode:v,FunctionNode:y,SymbolNode:g}),w=Be({equal:n,isZero:i,add:a,subtract:o,multiply:s,divide:u,pow:c,ConstantNode:m,OperatorNode:v,FunctionNode:y,ParenthesisNode:x});return r(Ge,{string:function(e){return this(l(e),{},!1)},"string, boolean":function(e,t){return this(l(e),{},t)},"string, Object":function(e,t){return this(l(e),t,!1)},"string, Object, boolean":function(e,t,r){return this(l(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=[w,{l:"n+n",r:"2*n"},{l:"n+-n",r:"0"},b,{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=[w,{l:"n*-n",r:"-n^2"},{l:"n*n",r:"n^2"},b,{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}(),i=function(e,t,r,n){var i=[],a=f(e,n,t,{exactFractions:!1}),o="+-*"+((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||!(0,He.U)(parseFloat(t.args[1].value)))throw new Error("There is a non-integer exponent");e(t.args[0])}else{if(-1===o.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")}(a);var s={};return s.expression=a,s.variables=i,s}(e,t,!0,n.firstRules),a=i.variables.length;if(e=i.expression,a>=1){var o,s;e=_(e);var u,c=!0,l=!1;for(e=f(e,n.firstRules,{},{exactFractions:!1});s=c?n.distrDivRules:n.sucDivRules,c=!c,(u=(e=f(e,s)).toString())!==o;)l=!0,o=u;l&&(e=f(e,n.firstRulesAgain,{},{exactFractions:!1})),e=f(e,n.finalRules,{},{exactFractions:!1})}var p=[],d={};return"OperatorNode"===e.type&&e.isBinary()&&"/"===e.op?(1===a&&(e.args[0]=N(e.args[0],p),e.args[1]=N(e.args[1])),r&&(d.numerator=e.args[0],d.denominator=e.args[1])):(1===a&&(e=N(e,p)),r&&(d.numerator=e,d.denominator=null)),r?(d.coefficients=p,d.variables=i.variables,d.expression=e,d):e}});function _(e,t,r){var n=e.type,i=arguments.length>1;if("OperatorNode"===n&&e.isBinary()){var a,o=!1;if("^"===e.op&&("ParenthesisNode"!==e.args[0].type&&"OperatorNode"!==e.args[0].type||"ConstantNode"!==e.args[1].type||(o=(a=parseFloat(e.args[1].value))>=2&&(0,He.U)(a))),o){if(a>2){var s=e.args[0],u=new v("^","pow",[e.args[0].cloneDeep(),new m(a-1)]);e=new v("*","multiply",[s,u])}else e=new v("*","multiply",[e.args[0],e.args[0].cloneDeep()]);i&&("content"===r?t.content=e:t.args[r]=e)}}if("ParenthesisNode"===n)_(e.content,e,"content");else if("ConstantNode"!==n&&"SymbolNode"!==n)for(var c=0;c<e.args.length;c++)_(e.args[c],e,c);if(!i)return e}function N(e,t){void 0===t&&(t=[]),t[0]=0;var r=0,n="";!function e(i,a,o){var s=i.type;if("FunctionNode"===s)throw new Error("There is an unsolved function call");if("OperatorNode"===s){if(-1==="+-*^".indexOf(i.op))throw new Error("Operator "+i.op+" invalid");if(null!==a){if(("unaryMinus"===i.fn||"pow"===i.fn)&&"add"!==a.fn&&"subtract"!==a.fn&&"multiply"!==a.fn)throw new Error("Invalid "+i.op+" placing");if(("subtract"===i.fn||"add"===i.fn||"multiply"===i.fn)&&"add"!==a.fn&&"subtract"!==a.fn)throw new Error("Invalid "+i.op+" placing");if(("subtract"===i.fn||"add"===i.fn||"unaryMinus"===i.fn)&&0!==o.noFil)throw new Error("Invalid "+i.op+" placing")}"^"!==i.op&&"*"!==i.op||(o.fire=i.op);for(var u=0;u<i.args.length;u++)"unaryMinus"===i.fn&&(o.oper="-"),"+"!==i.op&&"subtract"!==i.fn||(o.fire="",o.cte=1,o.oper=0===u?"+":i.op),o.noFil=u,e(i.args[u],i,o)}else if("SymbolNode"===s){if(i.name!==n&&""!==n)throw new Error("There is more than one variable");if(n=i.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||(r<1&&(t[1]=0),t[1]+=o.cte*("+"===o.oper?1:-1),r=Math.max(1,r))}else{if("ConstantNode"!==s)throw new Error("Type "+s+" is not allowed");var c=parseFloat(i.value);if(null===a)return void(t[0]=c);if("^"===a.op){if(1!==o.noFil)throw new Error("Constant cannot be powered");if(!(0,He.U)(c)||c<=0)throw new Error("Non-integer exponent is not allowed");for(var l=r+1;l<c;l++)t[l]=0;return c>r&&(t[c]=0),t[c]+=o.cte*("+"===o.oper?1:-1),void(r=Math.max(c,r))}o.cte=c,""===o.fire&&(t[0]+=o.cte*("+"===o.oper?1:-1))}}(e,null,{cte:1,oper:"+",fire:""});for(var i,a=!0,o=r=t.length-1;o>=0;o--)if(0!==t[o]){var s=new m(a?t[o]:Math.abs(t[o])),u=t[o]<0?"-":"+";if(o>0){var c=new g(n);if(o>1){var l=new m(o);c=new v("^","pow",[c,l])}s=-1===t[o]&&a?new v("-","unaryMinus",[c]):1===Math.abs(t[o])?c:new v("*","multiply",[s,c])}i=a?s:"+"===u?new v("+","add",[i,s]):new v("-","subtract",[i,s]),a=!1}return a?new m(0):i}})),$e="parser",Ve=["typed","Parser"],Je=(0,s.d5)($e,Ve,(e=>{var{typed:t,Parser:r}=e;return t($e,{"":function(){return new r}})})),Ye=["typed","config","parse","simplify","equal","isZero","numeric","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode","SymbolNode"],Xe=(0,s.d5)("derivative",Ye,(e=>{var{typed:t,config:r,parse:n,simplify:a,equal:o,isZero:s,numeric:u,ConstantNode:c,FunctionNode:l,OperatorNode:f,ParenthesisNode:p,SymbolNode:d}=e,h=t("derivative",{"Node, SymbolNode, Object":function(e,t,r){var n={};v(n,e,t.name);var i=y(e,n);return r.simplify?a(i):i},"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)}});h._simplify=!0,h.toTex=function(e){return m.apply(null,e.args)};var m=t("_derivTex",{"Node, SymbolNode":function(e,t){return(0,i.nu)(e)&&"string"===(0,i.kM)(e.value)?m(n(e.value).toString(),t.toString(),1):m(e.toString(),t.toString(),1)},"Node, ConstantNode":function(e,t){if("string"===(0,i.kM)(t.value))return m(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 m(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]")}}),v=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 v(e,t.content,r)},"Object, FunctionAssignmentNode, string":function(e,t,r){return-1===t.params.indexOf(r)?(e[t]=!0,!0):v(e,t.expr,r)},"Object, FunctionNode | OperatorNode, string":function(e,t,r){if(t.args.length>0){for(var n=v(e,t.args[0],r),i=1;i<t.args.length;++i)n=v(e,t.args[i],r)&&n;if(n)return e[t]=!0,!0}return!1}}),y=t("_derivative",{"ConstantNode, Object":function(e){return g(0)},"SymbolNode, Object":function(e,t){return void 0!==t[e]?g(0):g(1)},"ParenthesisNode, Object":function(e,t){return new p(y(e.content,t))},"FunctionAssignmentNode, Object":function(e,t){return void 0!==t[e]?g(0):y(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){for(var t=0;t<e.args.length;++t)e.args[t]=g(0);throw e.compile().evaluate(),new Error("Expected TypeError, but none found")}}(e),void 0!==t[e])return g(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",[g(3),new f("^","pow",[o,new f("/","divide",[g(2),g(3)])])]);break;case"sqrt":case"nthRoot":if(1===e.args.length)s=!0,n=new f("*","multiply",[g(2),new l("sqrt",[o])]);else if(2===e.args.length)return t[r=new f("/","divide",[g(1),e.args[1]])]=t[e.args[1]],y(new f("^","pow",[o,r]),t);break;case"log10":r=g(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 l("log",[r||e.args[1]])]),s=!0;else if(2===e.args.length)return y(new f("/","divide",[new l("log",[o]),new l("log",[e.args[1]])]),t)}else n=o.clone(),s=!0;break;case"pow":return t[r]=t[e.args[1]],y(new f("^","pow",[o,e.args[1]]),t);case"exp":n=new l("exp",[o.clone()]);break;case"sin":n=new l("cos",[o.clone()]);break;case"cos":n=new f("-","unaryMinus",[new l("sin",[o.clone()])]);break;case"tan":n=new f("^","pow",[new l("sec",[o.clone()]),g(2)]);break;case"sec":n=new f("*","multiply",[e,new l("tan",[o.clone()])]);break;case"csc":u=!0,n=new f("*","multiply",[e,new l("cot",[o.clone()])]);break;case"cot":u=!0,n=new f("^","pow",[new l("csc",[o.clone()]),g(2)]);break;case"asin":s=!0,n=new l("sqrt",[new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])])]);break;case"acos":s=!0,u=!0,n=new l("sqrt",[new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])])]);break;case"atan":s=!0,n=new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)]);break;case"asec":s=!0,n=new f("*","multiply",[new l("abs",[o.clone()]),new l("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),g(2)]),g(1)])])]);break;case"acsc":s=!0,u=!0,n=new f("*","multiply",[new l("abs",[o.clone()]),new l("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),g(2)]),g(1)])])]);break;case"acot":s=!0,u=!0,n=new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)]);break;case"sinh":n=new l("cosh",[o.clone()]);break;case"cosh":n=new l("sinh",[o.clone()]);break;case"tanh":n=new f("^","pow",[new l("sech",[o.clone()]),g(2)]);break;case"sech":u=!0,n=new f("*","multiply",[e,new l("tanh",[o.clone()])]);break;case"csch":u=!0,n=new f("*","multiply",[e,new l("coth",[o.clone()])]);break;case"coth":u=!0,n=new f("^","pow",[new l("csch",[o.clone()]),g(2)]);break;case"asinh":s=!0,n=new l("sqrt",[new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)])]);break;case"acosh":s=!0,n=new l("sqrt",[new f("-","subtract",[new f("^","pow",[o.clone(),g(2)]),g(1)])]);break;case"atanh":s=!0,n=new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])]);break;case"asech":s=!0,u=!0,n=new f("*","multiply",[o.clone(),new l("sqrt",[new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])])])]);break;case"acsch":s=!0,u=!0,n=new f("*","multiply",[new l("abs",[o.clone()]),new l("sqrt",[new f("+","add",[new f("^","pow",[o.clone(),g(2)]),g(1)])])]);break;case"acoth":s=!0,u=!0,n=new f("-","subtract",[g(1),new f("^","pow",[o.clone(),g(2)])]);break;case"abs":n=new f("/","divide",[new l(new d("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 c=y(o,t);return u&&(c=new f("-","unaryMinus",[c])),new f(i,a,[c,n])},"OperatorNode, Object":function(e,t){if(void 0!==t[e])return g(0);if("+"===e.op)return new f(e.op,e.fn,e.args.map((function(e){return y(e,t)})));if("-"===e.op){if(e.isUnary())return new f(e.op,e.fn,[y(e.args[0],t)]);if(e.isBinary())return new f(e.op,e.fn,[y(e.args[0],t),y(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]})),a=1===n.length?n[0]:new f("*","multiply",n),u=r.concat(y(a,t));return new f("*","multiply",u)}return new f("+","add",e.args.map((function(r){return new f("*","multiply",e.args.map((function(e){return e===r?y(e,t):e.clone()})))})))}if("/"===e.op&&e.isBinary()){var c=e.args[0],p=e.args[1];return void 0!==t[p]?new f("/","divide",[y(c,t),p]):void 0!==t[c]?new f("*","multiply",[new f("-","unaryMinus",[c]),new f("/","divide",[y(p,t),new f("^","pow",[p.clone(),g(2)])])]):new f("/","divide",[new f("-","subtract",[new f("*","multiply",[y(c,t),p.clone()]),new f("*","multiply",[c.clone(),y(p,t)])]),new f("^","pow",[p.clone(),g(2)])])}if("^"===e.op&&e.isBinary()){var d=e.args[0],h=e.args[1];if(void 0!==t[d])return(0,i.nu)(d)&&(s(d.value)||o(d.value,1))?g(0):new f("*","multiply",[e,new f("*","multiply",[new l("log",[d.clone()]),y(h.clone(),t)])]);if(void 0!==t[h]){if((0,i.nu)(h)){if(s(h.value))return g(0);if(o(h.value,1))return y(d,t)}var m=new f("^","pow",[d.clone(),new f("-","subtract",[h,g(1)])]);return new f("*","multiply",[h.clone(),new f("*","multiply",[y(d,t),m])])}return new f("*","multiply",[new f("^","pow",[d.clone(),h.clone()]),new f("+","add",[new f("*","multiply",[y(d,t),new f("/","divide",[h.clone(),d.clone()])]),new f("*","multiply",[y(h,t),new l("log",[d.clone()])])])])}throw new Error('Operator "'+e.op+'" is not supported by derivative, or a wrong number of arguments is passed')}});function g(e,t){return new c(u(e,t||r.number))}return h})),Qe=r(7773),Ke=["typed","isInteger"],et=(0,s.d5)("apply",Ke,(e=>{var{typed:t,isInteger:r}=e,n=(0,Qe.j)({typed:t,isInteger:r});return t("apply",{"...any":function(e){var t=e[1];(0,i.hj)(t)?e[1]=t-1:(0,i.l9)(t)&&(e[1]=t.minus(1));try{return n.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),tt=r(77);function rt(e,t,r){var n=e.filter((function(e){return(0,i.FG)(e)&&!(e.name in t)&&!(e.name in r)}))[0];if(!n)throw new Error('No undefined variable found in inline expression "'+e+'"');var a=n.name,o=Object.create(r),s=e.compile();return function(e){return o[a]=e,s.evaluate(o)}}var nt=["typed"],it=(0,s.d5)("filter",nt,(e=>{var{typed:t}=e;function r(e,t,r){var a,o;return e[0]&&(a=e[0].compile().evaluate(r)),e[1]&&(o=(0,i.FG)(e[1])||(0,i.l7)(e[1])?e[1].compile().evaluate(r):rt(e[1],t,r)),n(a,o)}r.rawArgs=!0;var n=t("filter",{"Array, function":at,"Matrix, function":function(e,t){return e.create(at(e.toArray(),t))},"Array, RegExp":l.U_,"Matrix, RegExp":function(e,t){return e.create((0,l.U_)(e.toArray(),t))}});return r}),{isTransformFunction:!0});function at(e,t){var r=(0,tt.oV)(t);return(0,l.hX)(e,(function(e,n,i){return 1===r?t(e):2===r?t(e,[n+1]):t(e,[n+1],i)}))}var ot=["typed"],st=(0,s.d5)("map",ot,(e=>{var{typed:t}=e;function r(e,t,r){var a,o;return e[0]&&(a=e[0].compile().evaluate(r)),e[1]&&(o=(0,i.FG)(e[1])||(0,i.l7)(e[1])?e[1].compile().evaluate(r):rt(e[1],t,r)),n(a,o)}r.rawArgs=!0;var n=t("map",{"Array, function":function(e,t){return ut(e,t,e)},"Matrix, function":function(e,t){return e.create(ut(e.valueOf(),t,e))}});return r}),{isTransformFunction:!0});function ut(e,t,r){var n=(0,tt.oV)(t);return function e(i,a){return Array.isArray(i)?(0,l.UI)(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,[])}var ct=["typed"],lt=(0,s.d5)("forEach",ct,(e=>{var{typed:t}=e;function r(e,t,r){var a,o;return e[0]&&(a=e[0].compile().evaluate(r)),e[1]&&(o=(0,i.FG)(e[1])||(0,i.l7)(e[1])?e[1].compile().evaluate(r):rt(e[1],t,r)),n(a,o)}r.rawArgs=!0;var n=t("forEach",{"Array | Matrix, function":function(e,t){var r=(0,tt.oV)(t);!function n(i,a){Array.isArray(i)?(0,l.Ed)(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}),ft=r(7238),pt=["typed","matrix"],dt=(0,s.d5)("subset",pt,(e=>{var{typed:t,matrix:r}=e,n=(0,ft.q)({typed:t,matrix:r});return t("subset",{"...any":function(e){try{return n.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),ht=["Index"],mt=(0,s.d5)("index",ht,(e=>{var{Index:t}=e;return function(){for(var e=[],r=0,n=arguments.length;r<n;r++){var a=arguments[r];if((0,i.bR)(a))a.start--,a.end-=a.step>0?0:2;else if(a&&!0===a.isSet)a=a.map((function(e){return e-1}));else if((0,i.kJ)(a)||(0,i.SW)(a))a=a.map((function(e){return e-1}));else if((0,i.hj)(a))a--;else if((0,i.l9)(a))a=a.toNumber()-1;else if("string"!=typeof a)throw new TypeError("Dimension must be an Array, Matrix, number, string, or Range");e[r]=a}var o=new t;return t.apply(o,e),o}}),{isTransformFunction:!0}),vt=r(7592),yt=["typed","matrix","isInteger"],gt=(0,s.d5)("concat",yt,(e=>{var{typed:t,matrix:r,isInteger:n}=e,a=(0,vt.k)({typed:t,matrix:r,isInteger:n});return t("concat",{"...any":function(e){var t=e.length-1,r=e[t];(0,i.hj)(r)?e[t]=r-1:(0,i.l9)(r)&&(e[t]=r.minus(1));try{return a.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),xt=r(8911);function bt(e){if(2===e.length&&(0,i.uZ)(e[0])){var t=(e=e.slice())[1];(0,i.hj)(t)?e[1]=t-1:(0,i.l9)(t)&&(e[1]=t.minus(1))}return e}var wt=["typed","config","numeric","larger"],_t=(0,s.d5)("max",wt,(e=>{var{typed:t,config:r,numeric:n,larger:i}=e,a=(0,xt.J)({typed:t,config:r,numeric:n,larger:i});return t("max",{"...any":function(e){e=bt(e);try{return a.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),Nt=r(3685),Et=["typed","config","numeric","smaller"],Mt=(0,s.d5)("min",Et,(e=>{var{typed:t,config:r,numeric:n,smaller:i}=e,a=(0,Nt.D)({typed:t,config:r,numeric:n,smaller:i});return t("min",{"...any":function(e){e=bt(e);try{return a.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),St=r(7726),At=["typed","config","add","numeric"],Ot=(0,s.d5)("sum",At,(e=>{var{typed:t,config:r,add:n,numeric:i}=e,a=(0,St.O)({typed:t,config:r,add:n,numeric:i});return t("sum",{"...any":function(e){e=bt(e);try{return a.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),kt=r(7797),Tt=["typed","Index","matrix","range"],Ct=(0,s.d5)("column",Tt,(e=>{var{typed:t,Index:r,matrix:n,range:a}=e,o=(0,kt.w)({typed:t,Index:r,matrix:n,range:a});return t("column",{"...any":function(e){var t=e.length-1,r=e[t];(0,i.hj)(r)&&(e[t]=r-1);try{return o.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),It=r(1598),Dt=["typed","config","?matrix","?bignumber","smaller","smallerEq","larger","largerEq"],zt=(0,s.d5)("range",Dt,(e=>{var{typed:t,config:r,matrix:n,bignumber:i,smaller:a,smallerEq:o,larger:s,largerEq:u}=e,c=(0,It.M)({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}),Bt=r(6012),jt="diff",Ut=["typed","matrix","subtract","number","bignumber"],Rt=(0,s.d5)(jt,Ut,(e=>{var{typed:t,matrix:r,subtract:n,number:i,bignumber:a}=e,o=(0,Bt.J)({typed:t,matrix:r,subtract:n,number:i,bignumber:a});return t(jt,{"...any":function(e){e=bt(e);try{return o.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),qt=r(2349),Ft=["typed","Index","matrix","range"],Pt=(0,s.d5)("row",Ft,(e=>{var{typed:t,Index:r,matrix:n,range:a}=e,o=(0,qt.v)({typed:t,Index:r,matrix:n,range:a});return t("row",{"...any":function(e){var t=e.length-1,r=e[t];(0,i.hj)(r)&&(e[t]=r-1);try{return o.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),Lt=r(8980),Ht=["typed","add","divide"],Gt=(0,s.d5)("mean",Ht,(e=>{var{typed:t,add:r,divide:n}=e,i=(0,Lt.Q)({typed:t,add:r,divide:n});return t("mean",{"...any":function(e){e=bt(e);try{return i.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),Zt=r(7359),Wt="variance",$t=["typed","add","subtract","multiply","divide","apply","isNaN"],Vt=(0,s.d5)(Wt,$t,(e=>{var{typed:t,add:r,subtract:n,multiply:i,divide:a,apply:o,isNaN:s}=e,u=(0,Zt.F)({typed:t,add:r,subtract:n,multiply:i,divide:a,apply:o,isNaN:s});return t(Wt,{"...any":function(e){e=bt(e);try{return u.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),Jt=r(4723),Yt=["typed","sqrt","variance"],Xt=(0,s.d5)("std",Yt,(e=>{var{typed:t,sqrt:r,variance:n}=e,i=(0,Jt.X)({typed:t,sqrt:r,variance:n});return t("std",{"...any":function(e){e=bt(e);try{return i.apply(null,e)}catch(e){throw Q(e)}}})}),{isTransformFunction:!0}),Qt=r(1538);function Kt(){return(Kt=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}).apply(this,arguments)}var er={},tr={},rr={},nr=c({mathWithTransform:tr}),ir=p({Node:nr}),ar=h({Node:nr,ResultSet:Qt.Z0z}),or=E({Node:nr}),sr=A({Node:nr}),ur=k({Node:nr}),cr=B({Node:nr}),lr=U({math:er}),fr=q({classes:rr}),pr=P({Node:nr}),dr=H({Node:nr}),hr=Z({Node:nr}),mr=$({Node:nr,typed:Qt.Gzl}),vr=Y({Chain:lr,typed:Qt.Gzl}),yr=te({Node:nr,subset:Qt.P9L}),gr=ne({Node:nr,Range:Qt.e6w,size:Qt.dpJ}),xr=ae({matrix:Qt.pIu,Node:nr,subset:Qt.P9L}),br=se({Unit:Qt.fbc,Node:nr,math:er}),wr=le({Node:nr,SymbolNode:br,math:er}),_r=me({AccessorNode:yr,ArrayNode:ir,AssignmentNode:xr,BlockNode:ar,ConditionalNode:pr,ConstantNode:or,FunctionAssignmentNode:mr,FunctionNode:wr,IndexNode:gr,ObjectNode:sr,OperatorNode:dr,ParenthesisNode:ur,RangeNode:hr,RelationalNode:cr,SymbolNode:br,config:n.v,numeric:Qt.uRn,typed:Qt.Gzl}),Nr=ge({parse:_r,typed:Qt.Gzl}),Er=be({parse:_r}),Mr=_e({parse:_r}),Sr=Oe({Help:Er,mathWithTransform:tr,typed:Qt.Gzl}),Ar=Ce({parse:_r,typed:Qt.Gzl}),Or=Le({bignumber:Qt.edS,fraction:Qt.Pj$,ConstantNode:or,FunctionNode:wr,OperatorNode:dr,ParenthesisNode:ur,SymbolNode:br,add:Qt.IHx,config:n.v,divide:Qt.csF,equal:Qt.DgJ,isZero:Qt.Fr9,mathWithTransform:tr,multiply:Qt.JpY,parse:_r,pow:Qt.sQ3,subtract:Qt.$XF,typed:Qt.Gzl}),kr=We({bignumber:Qt.edS,fraction:Qt.Pj$,ConstantNode:or,FunctionNode:wr,OperatorNode:dr,ParenthesisNode:ur,SymbolNode:br,add:Qt.IHx,config:n.v,divide:Qt.csF,equal:Qt.DgJ,isZero:Qt.Fr9,mathWithTransform:tr,multiply:Qt.JpY,parse:_r,pow:Qt.sQ3,simplify:Or,subtract:Qt.$XF,typed:Qt.Gzl}),Tr=Je({Parser:Mr,typed:Qt.Gzl}),Cr=Xe({ConstantNode:or,FunctionNode:wr,OperatorNode:dr,ParenthesisNode:ur,SymbolNode:br,config:n.v,equal:Qt.DgJ,isZero:Qt.Fr9,numeric:Qt.uRn,parse:_r,simplify:Or,typed:Qt.Gzl});Kt(er,{reviver:fr,false:Qt.WJv,null:Qt.OSG,true:Qt.wcc,replacer:Qt.PHU,i:Qt.i,LN10:Qt.cw7,LOG10E:Qt.doM,NaN:Qt.xOA,pi:Qt.pi,SQRT1_2:Qt.PNl,tau:Qt.BZ_,efimovFactor:Qt.dvW,fineStructure:Qt.Oyo,sackurTetrode:Qt.KO_,weakMixingAngle:Qt.Uud,e:Qt.e,Infinity:Qt.OvO,LOG2E:Qt.wwJ,PI:Qt.pi,version:Qt.i83,E:Qt.e,phi:Qt.Skb,typed:Qt.Gzl,isInteger:Qt.UaK,isNumeric:Qt.kEn,isPositive:Qt.xPR,isNaN:Qt.i2d,equalScalar:Qt.kuq,number:Qt.Rxh,boolean:Qt.O72,complex:Qt.PYB,splitUnit:Qt.jLI,unaryPlus:Qt.uKN,apply:Qt.nnj,cube:Qt.kOm,expm1:Qt.t$B,log10:Qt.mvw,multiplyScalar:Qt.cfl,sign:Qt.Xxe,square:Qt.h62,bitNot:Qt.Pfe,arg:Qt.R91,im:Qt.im,not:Qt.ffD,filter:Qt.hXT,forEach:Qt.Ed_,map:Qt.UID,erf:Qt.qNN,format:Qt.WUZ,oct:Qt.jfK,print:Qt.S0v,isPrime:Qt.e47,acos:Qt.Khb,acot:Qt.C6L,acsc:Qt.rcO,asec:Qt.PUJ,asin:Qt.ZRM,atan:Qt.z4N,atanh:Qt.C80,cosh:Qt.f9Y,coth:Qt.h6M,csch:Qt.RhL,sech:Qt.Fbd,sinh:Qt.R_K,tanh:Qt.AEp,chain:vr,combinations:Qt.BjO,pickRandom:Qt.sDj,randomInt:Qt.Iyf,LN2:Qt.bZs,clone:Qt.d9v,hasNumericValue:Qt.Hdk,typeOf:Qt.kM2,string:Qt.Z_8,fraction:Qt.Pj$,unaryMinus:Qt.T8F,addScalar:Qt.scv,exp:Qt.Qqt,log2:Qt.k3Q,sqrt:Qt._b3,conj:Qt.ruJ,getMatrixDataType:Qt.mOi,mode:Qt.xJM,bin:Qt.Ly_,acosh:Qt.__u,acsch:Qt.KLC,asinh:Qt.VfV,cos:Qt.mCk,csc:Qt.QBQ,sin:Qt.O$l,combinationsWithRep:Qt.d4C,random:Qt.MXc,SQRT2:Qt.vNo,isNegative:Qt.nMy,matrix:Qt.pIu,cbrt:Qt.eKn,gcd:Qt.thl,mod:Qt.wQq,nthRoot:Qt.C7f,xgcd:Qt.NpV,bitAnd:Qt.hx9,bitXor:Qt.nNS,or:Qt.or,concat:Qt.zoF,diag:Qt.Ka3,identity:Qt.yRu,ones:Qt.iUs,reshape:Qt.XLQ,size:Qt.dpJ,subset:Qt.P9L,zeros:Qt.lls,hex:Qt.$v1,round:Qt.NMM,leftShift:Qt.w57,rightLogShift:Qt.LdX,compare:Qt.quX,compareText:Qt.cdM,smaller:Qt.Nyh,larger:Qt.TWx,unequal:Qt.KPr,sparse:Qt.rVs,acoth:Qt.trc,atan2:Qt.fvJ,sec:Qt.BEc,add:Qt.IHx,dot:Qt.AKD,composition:Qt.ift,isZero:Qt.Fr9,abs:Qt.WnP,floor:Qt.GWj,multiply:Qt.JpY,dotMultiply:Qt.iOk,re:Qt.re,flatten:Qt.xHg,resize:Qt.SIr,squeeze:Qt.L9e,to:Qt.to,pow:Qt.sQ3,dotPow:Qt.qgo,rightArithShift:Qt.nq0,compareNatural:Qt.rn1,equalText:Qt.eZD,largerEq:Qt.Cr4,partitionSelect:Qt.JeQ,asech:Qt.lo8,tan:Qt.ORZ,setDifference:Qt.TVT,setIntersect:Qt.ff9,setMultiplicity:Qt.oNG,setSize:Qt.yk3,trace:Qt.g49,quantileSeq:Qt.pAO,gamma:Qt.yiU,bignumber:Qt.edS,lcm:Qt.uqG,bitOr:Qt.wKT,kron:Qt.JvE,transpose:Qt.p4s,numeric:Qt.uRn,and:Qt.xDy,smallerEq:Qt.Sq_,sort:Qt.DYV,min:Qt.VV$,cot:Qt.oHe,setDistinct:Qt.Z41,setPowerset:Qt.ljT,index:Qt.KzB,sum:Qt.Smz,factorial:Qt.bLN,permutations:Qt.DW7,ceil:Qt.mDi,subtract:Qt.$XF,cross:Qt.kCc,range:Qt.w6H,row:Qt.O7B,prod:Qt.WVs,equal:Qt.DgJ,max:Qt.Fp7,setCartesian:Qt.$ZK,setSymDifference:Qt.V4s,fix:Qt.zG0,column:Qt.$QP,diff:Qt.Hgg,ctranspose:Qt.NZC,deepEqual:Qt.vZr,setIsSubset:Qt.TT1,xor:Qt.dlQ,divideScalar:Qt.QgA,nthRoots:Qt.$$R,lsolve:Qt.wtJ,lsolveAll:Qt.ER9,setUnion:Qt.uyX,lup:Qt.xly,slu:Qt.cEy,det:Qt.Q8I,distance:Qt.TE$,stirlingS2:Qt.bAb,catalan:Qt.tjo,count:Qt.QXW,log:Qt.cM7,dotDivide:Qt.yVo,usolveAll:Qt.bJ2,hypot:Qt._mT,qr:Qt.qr,inv:Qt.JBn,expm:Qt.Ege,divide:Qt.csF,mean:Qt.J69,variance:Qt.CAK,kldivergence:Qt.mYz,bellNumbers:Qt.O7j,log1p:Qt.Krr,createUnit:Qt.JP7,eigs:Qt.Gq_,intersect:Qt.wfr,std:Qt.qoR,atomicMass:Qt.uzo,bohrMagneton:Qt.Cl$,boltzmann:Qt.Rhk,conductanceQuantum:Qt.xk2,deuteronMass:Qt.dEt,electronMass:Qt._G2,faraday:Qt.Am2,firstRadiation:Qt.Vvs,gravitationConstant:Qt.H9q,hartreeEnergy:Qt.HQL,klitzing:Qt.$$$,magneticConstant:Qt.$nU,molarMass:Qt.ak$,molarPlanckConstant:Qt.kEb,neutronMass:Qt.li8,planckCharge:Qt.JaK,planckLength:Qt.gil,planckTemperature:Qt.XAT,protonMass:Qt.CxM,reducedPlanckConstant:Qt.vAu,secondRadiation:Qt.ahj,stefanBoltzmann:Qt.yO5,vacuumImpedance:Qt.tnB,usolve:Qt.LDk,norm:Qt.KOy,lusolve:Qt.DU,sqrtm:Qt.jXX,multinomial:Qt.SJ_,avogadro:Qt._vz,classicalElectronRadius:Qt._fe,electricConstant:Qt.dXo,fermiCoupling:Qt.cIy,gravity:Qt.QXX,loschmidt:Qt.PUn,molarMassC12:Qt.esS,nuclearMagneton:Qt._A2,planckMass:Qt.kc5,quantumOfCirculation:Qt.TYM,speedOfLight:Qt.bl5,wienDisplacement:Qt.bGh,rotationMatrix:Qt.k8z,median:Qt.C2o,bohrRadius:Qt.tUn,elementaryCharge:Qt.iMQ,inverseConductanceQuantum:Qt.WSk,molarVolume:Qt.n4B,planckTime:Qt.oTb,thomsonCrossSection:Qt.bej,rotate:Qt.U1s,parse:_r,evaluate:Nr,mad:Qt.UFs,coulomb:Qt.JPg,magneticFluxQuantum:Qt.oLv,rydberg:Qt.rMB,unit:Qt.bfT,help:Sr,gasConstant:Qt.eOQ,compile:Ar,simplify:Or,rationalize:kr,parser:Tr,planckConstant:Qt.whQ,derivative:Cr,config:n.v}),Kt(tr,er,{apply:et({isInteger:Qt.UaK,typed:Qt.Gzl}),filter:it({typed:Qt.Gzl}),map:st({typed:Qt.Gzl}),forEach:lt({typed:Qt.Gzl}),subset:dt({matrix:Qt.pIu,typed:Qt.Gzl}),index:mt({Index:Qt.gmE}),concat:gt({isInteger:Qt.UaK,matrix:Qt.pIu,typed:Qt.Gzl}),max:_t({config:n.v,larger:Qt.TWx,numeric:Qt.uRn,typed:Qt.Gzl}),min:Mt({config:n.v,numeric:Qt.uRn,smaller:Qt.Nyh,typed:Qt.Gzl}),sum:Ot({add:Qt.IHx,config:n.v,numeric:Qt.uRn,typed:Qt.Gzl}),column:Ct({Index:Qt.gmE,matrix:Qt.pIu,range:Qt.w6H,typed:Qt.Gzl}),range:zt({bignumber:Qt.edS,matrix:Qt.pIu,config:n.v,larger:Qt.TWx,largerEq:Qt.Cr4,smaller:Qt.Nyh,smallerEq:Qt.Sq_,typed:Qt.Gzl}),diff:Rt({bignumber:Qt.edS,matrix:Qt.pIu,number:Qt.Rxh,subtract:Qt.$XF,typed:Qt.Gzl}),row:Pt({Index:Qt.gmE,matrix:Qt.pIu,range:Qt.w6H,typed:Qt.Gzl}),mean:Gt({add:Qt.IHx,divide:Qt.csF,typed:Qt.Gzl}),variance:Vt({add:Qt.IHx,apply:Qt.nnj,divide:Qt.csF,isNaN:Qt.i2d,multiply:Qt.JpY,subtract:Qt.$XF,typed:Qt.Gzl}),std:Xt({sqrt:Qt._b3,typed:Qt.Gzl,variance:Qt.CAK})}),Kt(rr,{ResultSet:Qt.Z0z,Complex:Qt.Zz9,Range:Qt.e6w,Node:nr,ArrayNode:ir,BlockNode:ar,ConstantNode:or,ObjectNode:sr,ParenthesisNode:ur,RelationalNode:cr,Chain:lr,BigNumber:Qt.O$v,Matrix:Qt.y3G,ConditionalNode:pr,OperatorNode:dr,Fraction:Qt.iAi,RangeNode:hr,DenseMatrix:Qt.JfM,FunctionAssignmentNode:mr,SparseMatrix:Qt.A7i,ImmutableDenseMatrix:Qt.MUK,FibonacciHeap:Qt.Q3n,AccessorNode:yr,IndexNode:gr,Index:Qt.gmE,AssignmentNode:xr,Spa:Qt.HJh,Unit:Qt.fbc,SymbolNode:br,FunctionNode:wr,Help:Er,Parser:Mr}),lr.createProxy(er)},1538:(e,t,r)=>{"use strict";r.d(t,{O$v:()=>$d,Zz9:()=>Ld,JfM:()=>ph,Q3n:()=>av,iAi:()=>sh,MUK:()=>iv,gmE:()=>Tv,cw7:()=>Xd,bZs:()=>om,doM:()=>Qd,wwJ:()=>lh,y3G:()=>Vd,e6w:()=>Hd,Z0z:()=>Pd,PNl:()=>th,vNo:()=>km,HJh:()=>Ey,A7i:()=>Cm,fbc:()=>Wy,OvO:()=>ch,xOA:()=>Kd,WJv:()=>Gd,OSG:()=>Zd,wcc:()=>Wd,WnP:()=>hv,Khb:()=>Gh,__u:()=>wm,C6L:()=>Zh,trc:()=>sv,rcO:()=>Wh,KLC:()=>_m,IHx:()=>lv,scv:()=>dm,xDy:()=>Wv,nnj:()=>Mh,R91:()=>Dh,PUJ:()=>$h,lo8:()=>Cv,ZRM:()=>Vh,VfV:()=>Nm,z4N:()=>Jh,fvJ:()=>uv,C80:()=>Yh,uzo:()=>Xy,_vz:()=>Mg,O7j:()=>Gy,edS:()=>Fv,Ly_:()=>bm,hx9:()=>Rm,Pfe:()=>Ih,wKT:()=>Lv,nNS:()=>qm,Cl$:()=>Qy,tUn:()=>qg,Rhk:()=>Ky,O72:()=>wh,tjo:()=>Cy,eKn:()=>Dm,mDi:()=>ny,_fe:()=>Sg,d9v:()=>sm,$QP:()=>hy,BjO:()=>nm,d4C:()=>Am,quX:()=>Km,rn1:()=>Sv,cdM:()=>ev,PYB:()=>_h,ift:()=>pv,zoF:()=>Pm,xk2:()=>eg,ruJ:()=>ym,mCk:()=>Em,f9Y:()=>Xh,oHe:()=>Yv,h6M:()=>Qh,JPg:()=>$g,QXW:()=>Iy,JP7:()=>$y,kCc:()=>ay,QBQ:()=>Mm,RhL:()=>Kh,NZC:()=>vy,kOm:()=>Sh,vZr:()=>yy,Q8I:()=>Oy,dEt:()=>tg,Ka3:()=>Lm,Hgg:()=>my,TE$:()=>ky,csF:()=>Fy,QgA:()=>by,AKD:()=>fv,yVo:()=>zy,iOk:()=>yv,qgo:()=>Ev,e:()=>uh,dvW:()=>nh,Gq_:()=>Vy,dXo:()=>Ag,_G2:()=>rg,iMQ:()=>Fg,DgJ:()=>cy,kuq:()=>xh,eZD:()=>Av,qNN:()=>qh,Qqt:()=>hm,Ege:()=>qy,t$B:()=>Ah,bLN:()=>ty,Am2:()=>ng,cIy:()=>Og,hXT:()=>jh,Oyo:()=>ih,Vvs:()=>ig,zG0:()=>dy,xHg:()=>xv,GWj:()=>mv,Ed_:()=>Uh,WUZ:()=>Fh,Pj$:()=>fm,yiU:()=>qv,eOQ:()=>Xg,thl:()=>zm,mOi:()=>gm,H9q:()=>ag,QXX:()=>kg,HQL:()=>og,Hdk:()=>um,$v1:()=>Jm,_mT:()=>jy,i:()=>Yd,yRu:()=>Hm,im:()=>zh,KzB:()=>Kv,wfr:()=>Jy,JBn:()=>Ry,WSk:()=>Pg,UaK:()=>mh,i2d:()=>gh,nMy:()=>Tm,kEn:()=>vh,xPR:()=>yh,e47:()=>Hh,Fr9:()=>dv,mYz:()=>Hy,$$$:()=>sg,JvE:()=>Hv,TWx:()=>rv,Cr4:()=>Ov,uqG:()=>Pv,w57:()=>Xm,cM7:()=>Dy,mvw:()=>Oh,Krr:()=>Zy,k3Q:()=>mm,PUn:()=>Tg,wtJ:()=>_y,ER9:()=>Ny,xly:()=>Sy,DU:()=>_g,UFs:()=>Wg,$nU:()=>ug,oLv:()=>Vg,UID:()=>Rh,pIu:()=>Im,Fp7:()=>ly,J69:()=>Py,C2o:()=>Rg,VV$:()=>Jv,wQq:()=>Bm,xJM:()=>xm,ak$:()=>cg,esS:()=>Cg,kEb:()=>lg,n4B:()=>Lg,SJ_:()=>Eg,JpY:()=>vv,cfl:()=>kh,li8:()=>fg,KOy:()=>wg,ffD:()=>Bh,C7f:()=>jm,$$R:()=>wy,_A2:()=>Ig,Rxh:()=>bh,uRn:()=>Zv,jfK:()=>Ph,iUs:()=>Gm,or:()=>Fm,JeQ:()=>kv,DW7:()=>ry,Skb:()=>dh,pi:()=>eh,sDj:()=>im,JaK:()=>pg,whQ:()=>Qg,gil:()=>dg,kc5:()=>Dg,XAT:()=>hg,oTb:()=>Hg,sQ3:()=>Nv,S0v:()=>Lh,WVs:()=>uy,CxM:()=>mg,qr:()=>Uy,pAO:()=>Rv,TYM:()=>zg,MXc:()=>Om,Iyf:()=>am,w6H:()=>oy,re:()=>gv,vAu:()=>vg,PHU:()=>Jd,XLQ:()=>Zm,SIr:()=>bv,nq0:()=>Mv,LdX:()=>Qm,U1s:()=>Zg,k8z:()=>Ug,NMM:()=>Ym,O7B:()=>sy,rMB:()=>Jg,KO_:()=>ah,BEc:()=>cv,Fbd:()=>em,ahj:()=>yg,$ZK:()=>fy,TVT:()=>Dv,Z41:()=>Xv,ff9:()=>zv,TT1:()=>gy,oNG:()=>Bv,ljT:()=>Qv,yk3:()=>jv,V4s:()=>py,uyX:()=>My,Xxe:()=>Th,O$l:()=>Sm,R_K:()=>tm,dpJ:()=>Wm,cEy:()=>Ay,Nyh:()=>tv,Sq_:()=>$v,DYV:()=>Vv,rVs:()=>ov,bl5:()=>Bg,jLI:()=>Nh,_b3:()=>vm,jXX:()=>Ng,h62:()=>Ch,L9e:()=>wv,qoR:()=>Yy,yO5:()=>gg,bAb:()=>Ty,Z_8:()=>lm,P9L:()=>$m,$XF:()=>iy,Smz:()=>ey,ORZ:()=>Iv,AEp:()=>rm,BZ_:()=>rh,bej:()=>Gg,to:()=>_v,g49:()=>Uv,p4s:()=>Gv,kM2:()=>cm,Gzl:()=>hh,T8F:()=>pm,uKN:()=>Eh,KPr:()=>nv,bfT:()=>Yg,LDk:()=>bg,bJ2:()=>By,tnB:()=>xg,CAK:()=>Ly,i83:()=>fh,Uud:()=>oh,bGh:()=>jg,NpV:()=>Um,dlQ:()=>xy,lls:()=>Vm});var n=r(2191),i=r(8794),a=[],o=(0,i.d5)("ResultSet",a,(()=>{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}),s=r(1977),u=r(9139),c=r(5542),l=[],f=(0,i.d5)("Complex",l,(()=>(s.prototype.type="Complex",s.prototype.isComplex=!0,s.prototype.toJSON=function(){return{mathjs:"Complex",re:this.re,im:this.im}},s.prototype.toPolar=function(){return{r:this.abs(),phi:this.arg()}},s.prototype.format=function(e){var t=this.im,r=this.re,n=(0,u.WU)(this.re,e),i=(0,u.WU)(this.im,e),a=(0,c.hj)(e)?e:e?e.precision:null;if(null!==a){var o=Math.pow(10,-a);Math.abs(r/t)<o&&(r=0),Math.abs(t/r)<o&&(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"},s.fromPolar=function(e){switch(arguments.length){case 1:var t=arguments[0];if("object"==typeof t)return s(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((0,c.hj)(r)){if((0,c.wr)(n)&&n.hasBase("ANGLE")&&(n=n.toNumber("rad")),(0,c.hj)(n))return new s({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")}},s.prototype.valueOf=s.prototype.toString,s.fromJSON=function(e){return new s(e)},s.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},s)),{isClass:!0}),p=[],d=(0,i.d5)("Range",p,(()=>{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((0,c.l9)(t))t=t.toNumber();else if("number"!=typeof t)throw new TypeError("Parameter start must be a number");if(a)if((0,c.l9)(r))r=r.toNumber();else if("number"!=typeof r)throw new TypeError("Parameter end must be a number");if(o)if((0,c.l9)(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(0,u.Xx)(r)===(0,u.Xx)(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=(0,u.WU)(this.start,e);return 1!==this.step&&(t+=":"+(0,u.WU)(this.step,e)),t+":"+(0,u.WU)(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}),h=r(77),m=(0,h.HP)((function(e){return new e(1).exp()}),{hasher:x}),v=(0,h.HP)((function(e){return new e(1).plus(new e(5).sqrt()).div(2)}),{hasher:x}),y=(0,h.HP)((function(e){return e.acos(-1)}),{hasher:x}),g=(0,h.HP)((function(e){return y(e).times(2)}),{hasher:x});function x(e){return e[0].precision}var b=Math.PI,w=2*Math.PI,_=Math.E,N=(0,i.d5)("true",[],(()=>!0)),E=(0,i.d5)("false",[],(()=>!1)),M=(0,i.d5)("null",[],(()=>null)),S=F("Infinity",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r(1/0):1/0})),A=F("NaN",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r(NaN):NaN})),O=F("pi",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?y(r):b})),k=F("tau",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?g(r):w})),T=F("e",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?m(r):_})),C=F("phi",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?v(r):1.618033988749895})),I=F("LN2",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r(2).ln():Math.LN2})),D=F("LN10",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r(10).ln():Math.LN10})),z=F("LOG2E",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r(1).div(new r(2).ln()):Math.LOG2E})),B=F("LOG10E",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r(1).div(new r(10).ln()):Math.LOG10E})),j=F("SQRT1_2",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r("0.5").sqrt():Math.SQRT1_2})),U=F("SQRT2",["config","?BigNumber"],(e=>{var{config:t,BigNumber:r}=e;return"BigNumber"===t.number?new r(2).sqrt():Math.SQRT2})),R=F("i",["Complex"],(e=>{var{Complex:t}=e;return t.I})),q=(0,i.d5)("version",[],(()=>"9.3.0"));function F(e,t,r){return(0,i.d5)(e,t,r,{recreateOnConfigChange:!0})}var P=r(3776),L=["?on","config"],H=(0,i.d5)("BigNumber",L,(e=>{var{on:t,config:r}=e,n=P.clone({precision:r.precision,modulo:9});return 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}),G=[],Z=(0,i.d5)("Matrix",G,(()=>{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.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}),W=[],$=(0,i.d5)("replacer",W,(()=>function(e,t){return"number"!=typeof t||isFinite(t)&&!isNaN(t)?t:{mathjs:"number",value:String(t)}})),V=Ge("speedOfLight","299792458","m s^-1"),J=Ge("gravitationConstant","6.67430e-11","m^3 kg^-1 s^-2"),Y=Ge("planckConstant","6.62607015e-34","J s"),X=Ge("reducedPlanckConstant","1.0545718176461565e-34","J s"),Q=Ge("magneticConstant","1.25663706212e-6","N A^-2"),K=Ge("electricConstant","8.8541878128e-12","F m^-1"),ee=Ge("vacuumImpedance","376.730313667","ohm"),te=Ge("coulomb","8.987551792261171e9","N m^2 C^-2"),re=Ge("elementaryCharge","1.602176634e-19","C"),ne=Ge("bohrMagneton","9.2740100783e-24","J T^-1"),ie=Ge("conductanceQuantum","7.748091729863649e-5","S"),ae=Ge("inverseConductanceQuantum","12906.403729652257","ohm"),oe=Ge("magneticFluxQuantum","2.0678338484619295e-15","Wb"),se=Ge("nuclearMagneton","5.0507837461e-27","J T^-1"),ue=Ge("klitzing","25812.807459304513","ohm"),ce=Ge("bohrRadius","5.29177210903e-11","m"),le=Ge("classicalElectronRadius","2.8179403262e-15","m"),fe=Ge("electronMass","9.1093837015e-31","kg"),pe=Ge("fermiCoupling","1.1663787e-5","GeV^-2"),de=Ze("fineStructure",.0072973525693),he=Ge("hartreeEnergy","4.3597447222071e-18","J"),me=Ge("protonMass","1.67262192369e-27","kg"),ve=Ge("deuteronMass","3.3435830926e-27","kg"),ye=Ge("neutronMass","1.6749271613e-27","kg"),ge=Ge("quantumOfCirculation","3.6369475516e-4","m^2 s^-1"),xe=Ge("rydberg","10973731.568160","m^-1"),be=Ge("thomsonCrossSection","6.6524587321e-29","m^2"),we=Ze("weakMixingAngle",.2229),_e=Ze("efimovFactor",22.7),Ne=Ge("atomicMass","1.66053906660e-27","kg"),Ee=Ge("avogadro","6.02214076e23","mol^-1"),Me=Ge("boltzmann","1.380649e-23","J K^-1"),Se=Ge("faraday","96485.33212331001","C mol^-1"),Ae=Ge("firstRadiation","3.7417718521927573e-16","W m^2"),Oe=Ge("loschmidt","2.686780111798444e25","m^-3"),ke=Ge("gasConstant","8.31446261815324","J K^-1 mol^-1"),Te=Ge("molarPlanckConstant","3.990312712893431e-10","J s mol^-1"),Ce=Ge("molarVolume","0.022413969545014137","m^3 mol^-1"),Ie=Ze("sackurTetrode",-1.16487052358),De=Ge("secondRadiation","0.014387768775039337","m K"),ze=Ge("stefanBoltzmann","5.67037441918443e-8","W m^-2 K^-4"),Be=Ge("wienDisplacement","2.897771955e-3","m K"),je=Ge("molarMass","0.99999999965e-3","kg mol^-1"),Ue=Ge("molarMassC12","11.9999999958e-3","kg mol^-1"),Re=Ge("gravity","9.80665","m s^-2"),qe=Ge("planckLength","1.616255e-35","m"),Fe=Ge("planckMass","2.176435e-8","kg"),Pe=Ge("planckTime","5.391245e-44","s"),Le=Ge("planckCharge","1.87554603778e-18","C"),He=Ge("planckTemperature","1.416785e+32","K");function Ge(e,t,r){return(0,i.d5)(e,["config","Unit","BigNumber"],(e=>{var{config:n,Unit:i,BigNumber:a}=e,o=new i("BigNumber"===n.number?new a(t):parseFloat(t),r);return o.fixPrefix=!0,o}))}function Ze(e,t){return(0,i.d5)(e,["config","BigNumber"],(e=>{var{config:r,BigNumber:n}=e;return"BigNumber"===r.number?new n(t):t}))}var We=r(5628),$e=[],Ve=(0,i.d5)("Fraction",$e,(()=>(We.prototype.type="Fraction",We.prototype.isFraction=!0,We.prototype.toJSON=function(){return{mathjs:"Fraction",n:this.s*this.n,d:this.d}},We.fromJSON=function(e){return new We(e)},We)),{isClass:!0}),Je=r(4444),Ye=r(3014),Xe=r(5254),Qe=r(4961),Ke=["Matrix"],et=(0,i.d5)("DenseMatrix",Ke,(e=>{var{Matrix:t}=e;function r(e,t){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!(0,c.HD)(t))throw new Error("Invalid datatype: "+t);if((0,c.SW)(e))"DenseMatrix"===e.type?(this._data=(0,Xe.d9)(e._data),this._size=(0,Xe.d9)(e._size),this._datatype=t||e._datatype):(this._data=e.toArray(),this._size=e.size(),this._datatype=t||e._datatype);else if(e&&(0,c.kJ)(e.data)&&(0,c.kJ)(e.size))this._data=e.data,this._size=e.size,(0,Je.Gu)(this._data,this._size),this._datatype=t||e.datatype;else if((0,c.kJ)(e))this._data=f(e),this._size=(0,Je.aJ)(this._data),(0,Je.Gu)(this._data,this._size),this._datatype=t;else{if(e)throw new TypeError("Unsupported type of data ("+(0,c.kM)(e)+")");this._data=[],this._size=[0],this._datatype=t}}function n(e,t){if(!(0,c.dh)(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 Qe.m(n.length,e._size.length);for(var a=t.min(),o=t.max(),s=0,u=e._size.length;s<u;s++)(0,Je.Ls)(a[s],e._size[s]),(0,Je.Ls)(o[s],e._size[s]);return new r(i(e._data,t,n.length,0),e._datatype)}function i(e,t,r,n){var a=n===r-1,o=t.dimension(n);return a?o.map((function(t){return(0,Je.Ls)(t,e.length),e[t]})).valueOf():o.map((function(a){return(0,Je.Ls)(a,e.length),i(e[a],t,r,n+1)})).valueOf()}function a(e,t,r,n){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");var i,a=t.size(),s=t.isScalar();if((0,c.SW)(r)?(i=r.size(),r=r.valueOf()):i=(0,Je.aJ)(r),s){if(0!==i.length)throw new TypeError("Scalar expected");e.set(t.min(),r,n)}else{if(a.length<e._size.length)throw new Qe.m(a.length,e._size.length,"<");if(i.length<a.length){for(var u=0,f=0;1===a[u]&&1===i[u];)u++;for(;1===a[u];)f++,u++;r=(0,Je.f4)(r,a.length,f,i)}if(!(0,Xe.J5)(a,i))throw new Qe.m(a,i,">");l(e,t.max().map((function(e){return e+1})),n);var p=a.length;o(e._data,t,r,p,0)}return e}function o(e,t,r,n,i){var a=i===n-1,s=t.dimension(i);a?s.forEach((function(t,n){(0,Je.Ls)(t),e[t]=r[n[0]]})):s.forEach((function(a,s){(0,Je.Ls)(a),o(e[a],t,r[s[0]],n,i+1)}))}function s(e,t,r){if(0===t.length){for(var n=e._data;(0,c.kJ)(n);)n=n[0];return n}return e._size=t.slice(0),e._data=(0,Je.SI)(e._data,e._size,r),e}function l(e,t,r){for(var n=e._size.slice(0),i=!1;n.length<t.length;)n.push(0),i=!0;for(var a=0,o=t.length;a<o;a++)t[a]>n[a]&&(n[a]=t[a],i=!0);i&&s(e,n,r)}function f(e){for(var t=0,r=e.length;t<r;t++){var n=e[t];(0,c.kJ)(n)?e[t]=f(n):n&&!0===n.isMatrix&&(e[t]=f(n.valueOf()))}return e}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(0,Je.$q)(this._data,c.kM)},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 a(this,e,t,r);default:throw new SyntaxError("Wrong number of arguments")}},r.prototype.get=function(e){if(!(0,c.kJ)(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Qe.m(e.length,this._size.length);for(var t=0;t<e.length;t++)(0,Je.Ls)(e[t],this._size[t]);for(var r=this._data,n=0,i=e.length;n<i;n++){var a=e[n];(0,Je.Ls)(a,r.length),r=r[a]}return r},r.prototype.set=function(e,t,r){if(!(0,c.kJ)(e))throw new TypeError("Array expected");if(e.length<this._size.length)throw new Qe.m(e.length,this._size.length,"<");var n,i,a;l(this,e.map((function(e){return e+1})),r);var o=this._data;for(n=0,i=e.length-1;n<i;n++)a=e[n],(0,Je.Ls)(a,o.length),o=o[a];return a=e[e.length-1],(0,Je.Ls)(a,o.length),o[a]=t,this},r.prototype.resize=function(e,t,r){if(!(0,c.uZ)(e))throw new TypeError("Array or Matrix expected");var n=e.valueOf().map((e=>Array.isArray(e)&&1===e.length?e[0]:e));return s(r?this.clone():this,n,t)},r.prototype.reshape=function(e,t){var r=t?this.clone():this;r._data=(0,Je.XL)(r._data,e);var n=r._size.reduce(((e,t)=>e*t));return r._size=(0,Je.eu)(e,n),r},r.prototype.clone=function(){return new r({data:(0,Xe.d9)(this._data),size:(0,Xe.d9)(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(0,c.kJ)(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?(0,Je.$q)(n,c.kM):void 0)},r.prototype.forEach=function(e){var t=this;!function r(n,i){(0,c.kJ)(n)?n.forEach((function(e,t){r(e,i.concat(t))})):e(n,i,t)}(this._data,[])},r.prototype.toArray=function(){return(0,Xe.d9)(this._data)},r.prototype.valueOf=function(){return this._data},r.prototype.format=function(e){return(0,Ye.WU)(this._data,e)},r.prototype.toString=function(){return(0,Ye.WU)(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((0,c.l9)(e)&&(e=e.toNumber()),!(0,c.hj)(e)||!(0,u.U)(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],o=Math.min(i-n,a-t),s=[],l=0;l<o;l++)s[l]=this._data[l+n][l+t];return new r({data:s,size:[o],datatype:this._datatype})},r.diagonal=function(e,t,n,i){if(!(0,c.kJ)(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((0,c.l9)(e)&&(e=e.toNumber()),!(0,c.hj)(e)||!(0,u.U)(e)||e<1)throw new Error("Size values must be positive integers");return e})),n){if((0,c.l9)(n)&&(n=n.toNumber()),!(0,c.hj)(n)||!(0,u.U)(n))throw new TypeError("The parameter k must be an integer number")}else n=0;var a,o=n>0?n:0,s=n<0?-n:0,l=e[0],f=e[1],p=Math.min(l-s,f-o);if((0,c.kJ)(t)){if(t.length!==p)throw new Error("Invalid value array length");a=function(e){return t[e]}}else if((0,c.SW)(t)){var d=t.size();if(1!==d.length||d[0]!==p)throw new Error("Invalid matrix length");a=function(e){return t.get([e])}}else a=function(){return t};i||(i=(0,c.l9)(a(0))?a(0).mul(0):0);var h=[];if(e.length>0){h=(0,Je.SI)(h,e,i);for(var m=0;m<p;m++)h[m+s][m+o]=a(m)}return new r({data:h,size:[l,f]})},r.fromJSON=function(e){return new r(e)},r.prototype.swapRows=function(e,t){if(!((0,c.hj)(e)&&(0,u.U)(e)&&(0,c.hj)(t)&&(0,u.U)(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(0,Je.Ls)(e,this._size[0]),(0,Je.Ls)(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}),tt=r(2287),rt=function(){return rt=tt.create,tt},nt=["?BigNumber","?Complex","?DenseMatrix","?Fraction"],it=(0,i.d5)("typed",nt,(function(e){var{BigNumber:t,Complex:r,DenseMatrix:n,Fraction:i}=e,a=rt();return a.types=[{name:"number",test:c.hj},{name:"Complex",test:c.Mc},{name:"BigNumber",test:c.l9},{name:"Fraction",test:c.yQ},{name:"Unit",test:c.wr},{name:"string",test:c.HD},{name:"Chain",test:c.qg},{name:"Array",test:c.kJ},{name:"Matrix",test:c.SW},{name:"DenseMatrix",test:c.jH},{name:"SparseMatrix",test:c.sA},{name:"Range",test:c.bR},{name:"Index",test:c.dh},{name:"boolean",test:c.jn},{name:"ResultSet",test:c.cB},{name:"Help",test:c.x1},{name:"function",test:c.mf},{name:"Date",test:c.J_},{name:"RegExp",test:c.Kj},{name:"null",test:c.Ft},{name:"undefined",test:c.o8},{name:"AccessorNode",test:c.Yz},{name:"ArrayNode",test:c.j0},{name:"AssignmentNode",test:c.Bp},{name:"BlockNode",test:c.zh},{name:"ConditionalNode",test:c.tS},{name:"ConstantNode",test:c.nu},{name:"FunctionNode",test:c.VO},{name:"FunctionAssignmentNode",test:c.l7},{name:"IndexNode",test:c.Cl},{name:"Node",test:c.UG},{name:"ObjectNode",test:c.Lr},{name:"OperatorNode",test:c.bV},{name:"ParenthesisNode",test:c.Ig},{name:"RangeNode",test:c.ex},{name:"SymbolNode",test:c.FG},{name:"Object",test:c.Kn}],a.conversions=[{from:"number",to:"BigNumber",convert:function(e){if(t||at(e),(0,u.nz)(e)>15)throw new TypeError("Cannot implicitly convert a number with >15 significant digits to BigNumber (value: "+e+"). Use function bignumber(x) to convert to BigNumber.");return new t(e)}},{from:"number",to:"Complex",convert:function(e){return r||ot(e),new r(e,0)}},{from:"number",to:"string",convert:function(e){return e+""}},{from:"BigNumber",to:"Complex",convert:function(e){return r||ot(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||ot(e),new r(e.valueOf(),0)}},{from:"number",to:"Fraction",convert:function(e){i||st(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||at(e);try{return new t(e)}catch(t){throw new Error('Cannot convert "'+e+'" to BigNumber')}}},{from:"string",to:"Fraction",convert:function(e){i||st(e);try{return new i(e)}catch(t){throw new Error('Cannot convert "'+e+'" to Fraction')}}},{from:"string",to:"Complex",convert:function(e){r||ot(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||at(e),new t(+e)}},{from:"boolean",to:"Fraction",convert:function(e){return i||st(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 at(e){throw new Error("Cannot convert value ".concat(e," into a BigNumber: no class 'BigNumber' provided"))}function ot(e){throw new Error("Cannot convert value ".concat(e," into a Complex number: no class 'Complex' provided"))}function st(e){throw new Error("Cannot convert value ".concat(e," into a Fraction, no class 'Fraction' provided."))}var ut=r(4344),ct="isInteger",lt=["typed"],ft=(0,i.d5)(ct,lt,(e=>{var{typed:t}=e;return t(ct,{number:u.U,BigNumber:function(e){return e.isInt()},Fraction:function(e){return 1===e.d&&isFinite(e.n)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),pt="isNumeric",dt=["typed"],ht=(0,i.d5)(pt,dt,(e=>{var{typed:t}=e;return t(pt,{"number | BigNumber | Fraction | boolean":function(){return!0},"Complex | Unit | string | null | undefined | Node":function(){return!1},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),mt="number";function vt(e){return e<0}function yt(e){return e>0}function gt(e){return 0===e}function xt(e){return Number.isNaN(e)}vt.signature=mt,yt.signature=mt,gt.signature=mt,xt.signature=mt;var bt="isPositive",wt=["typed"],_t=(0,i.d5)(bt,wt,(e=>{var{typed:t}=e;return t(bt,{number:yt,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(0,ut.Fh)(e,this)}})})),Nt="isNaN",Et=["typed"],Mt=(0,i.d5)(Nt,Et,(e=>{var{typed:t}=e;return t(Nt,{number:xt,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(0,ut.Fh)(e,Number.isNaN)}})}));function St(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 At="equalScalar",Ot=["typed","config"],kt=(0,i.d5)(At,Ot,(e=>{var{typed:t,config:r}=e;return t(At,{"boolean, boolean":function(e,t){return e===t},"number, number":function(e,t){return(0,u.RI)(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.eq(t)||St(e,t,r.epsilon)},"Fraction, Fraction":function(e,t){return e.equals(t)},"Complex, Complex":function(e,t){return function(e,t,r){return(0,u.RI)(e.re,t.re,r)&&(0,u.RI)(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)}})})),Tt=((0,i.d5)(At,["typed","config"],(e=>{var{typed:t,config:r}=e;return t(At,{"number, number":function(e,t){return(0,u.RI)(e,t,r.epsilon)}})})),["typed"]),Ct=(0,i.d5)("number",Tt,(e=>{var{typed:t}=e,r=t("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>2**i-1)throw new SyntaxError('String "'.concat(e,'" is out of range'));o>=2**(i-1)&&(o-=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(0,ut.Fh)(e,this)}});return r.fromJSON=function(e){return parseFloat(e.value)},r})),It="boolean",Dt=["typed"],zt=(0,i.d5)(It,Dt,(e=>{var{typed:t}=e;return t(It,{"":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(0,ut.Fh)(e,this)}})})),Bt=["typed","Complex"],jt=(0,i.d5)("complex",Bt,(e=>{var{typed:t,Complex:r}=e;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(0,ut.Fh)(e,this)}})})),Ut="splitUnit",Rt=["typed"],qt=(0,i.d5)(Ut,Rt,(e=>{var{typed:t}=e;return t(Ut,{"Unit, Array":function(e,t){return e.splitUnit(t)}})})),Ft="number",Pt="number, number";function Lt(e){return Math.abs(e)}function Ht(e,t){return e+t}function Gt(e,t){return e*t}function Zt(e){return-e}function Wt(e){return e}function $t(e){return(0,u.eK)(e)}function Vt(e){return Math.ceil(e)}function Jt(e){return e*e*e}function Yt(e){return Math.exp(e)}function Xt(e){return(0,u.t$)(e)}function Qt(e,t){if(!(0,u.U)(e)||!(0,u.U)(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 Kt(e,t){if(!(0,u.U)(e)||!(0,u.U)(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 er(e){return Math.log(e)}function tr(e){return(0,u.mv)(e)}function rr(e){return(0,u.k3)(e)}function nr(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 ir(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 ar(e){return(0,u.Xx)(e)}function or(e){return e*e}function sr(e,t){var r,n,i,a=0,o=1,s=1,c=0;if(!(0,u.U)(e)||!(0,u.U)(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=c-n*s,c=r,e=t,t=i;return e<0?[-e,-o,-c]:[e,e?o:0,c]}function ur(e,t){return e*e<1&&t===1/0||e*e>1&&t===-1/0?0:Math.pow(e,t)}function cr(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;return parseFloat((0,u.FH)(e,t))}Lt.signature=Ft,Ht.signature=Pt,Gt.signature=Pt,Zt.signature=Ft,Wt.signature=Ft,$t.signature=Ft,Vt.signature=Ft,Jt.signature=Ft,Yt.signature=Ft,Xt.signature=Ft,Qt.signature=Pt,Kt.signature=Pt,er.signature=Ft,tr.signature=Ft,rr.signature=Ft,nr.signature=Pt,ir.signature=Pt,ar.signature=Ft,or.signature=Ft,sr.signature=Pt,ur.signature=Pt,cr.signature=Pt;var lr="unaryPlus",fr=["typed","config","BigNumber"],pr=(0,i.d5)(lr,fr,(e=>{var{typed:t,config:r,BigNumber:n}=e;return t(lr,{number:Wt,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(0,ut.Fh)(e,this,!0)},"boolean | string":function(e){return"BigNumber"===r.number?new n(+e):+e}})})),dr="cube",hr=["typed"],mr=(0,i.d5)(dr,hr,(e=>{var{typed:t}=e;return t(dr,{number:Jt,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(0,ut.Fh)(e,this,!0)},Unit:function(e){return e.pow(3)}})})),vr="expm1",yr=["typed","Complex"],gr=(0,i.d5)(vr,yr,(e=>{var{typed:t,Complex:r}=e;return t(vr,{number:Xt,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(0,ut.Fh)(e,this)}})})),xr="log10",br=["typed","config","Complex"],wr=(0,i.d5)(xr,br,(e=>{var{typed:t,config:r,Complex:n}=e;return t(xr,{number:function(e){return e>=0||r.predictable?tr(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(0,ut.Fh)(e,this)}})})),_r=["typed"],Nr=(0,i.d5)("multiplyScalar",_r,(e=>{var{typed:t}=e;return t("multiplyScalar",{"number, number":Gt,"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)}})})),Er="sign",Mr=["typed","BigNumber","Fraction","complex"],Sr=(0,i.d5)(Er,Mr,(e=>{var{typed:t,BigNumber:r,complex:n,Fraction:i}=e;return t(Er,{number:ar,Complex:function(e){return 0===e.im?n(ar(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(0,ut.Fh)(e,this,!0)},Unit:function(e){return this(e.value)}})})),Ar="square",Or=["typed"],kr=(0,i.d5)(Ar,Or,(e=>{var{typed:t}=e;return t(Ar,{number:or,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(0,ut.Fh)(e,this,!0)},Unit:function(e){return e.pow(2)}})}));function Tr(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 Dr(e,t,(function(e,t){return e&t}))}function Cr(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 Ir(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()?Dr(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 Dr(e,t,r){var n,i,a,o,s,u=e.constructor,c=+(e.s<0),l=+(t.s<0);if(c){n=zr(Cr(e));for(var f=0;f<n.length;++f)n[f]^=1}else n=zr(e);if(l){i=zr(Cr(t));for(var p=0;p<i.length;++p)i[p]^=1}else i=zr(t);n.length<=i.length?(a=n,o=i,s=c):(a=i,o=n,s=l);var d=a.length,h=o.length,m=1^r(c,l),v=new u(1^m),y=new u(1),g=new u(2),x=u.precision;for(u.config({precision:1e9});d>0;)r(a[--d],o[--h])===m&&(v=v.plus(y)),y=y.times(g);for(;h>0;)r(s,o[--h])===m&&(v=v.plus(y)),y=y.times(g);return u.config({precision:x}),0===m&&(v.s=-v.s),v}function zr(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 l=[0],f=0;f<u.length;){for(var p=l.length;p--;)l[p]*=10;l[0]+=parseInt(u.charAt(f++));for(var d=0;d<l.length;++d)l[d]>1&&(null!==l[d+1]&&void 0!==l[d+1]||(l[d+1]=0),l[d+1]+=l[d]>>1,l[d]&=1)}return l.reverse()}function Br(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)?Cr(t):t.eq(n)?Cr(e):e.isFinite()&&t.isFinite()?Dr(e,t,(function(e,t){return e^t})):e.isFinite()||t.isFinite()?new r(e.isNegative()===t.isNegative()?1/0:-1/0):n}function jr(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 Ur(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 Rr="number, number";function qr(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function bitAnd");return e&t}function Fr(e){if(!(0,u.U)(e))throw new Error("Integer expected in function bitNot");return~e}function Pr(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function bitOr");return e|t}function Lr(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function bitXor");return e^t}function Hr(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function leftShift");return e<<t}function Gr(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function rightArithShift");return e>>t}function Zr(e,t){if(!(0,u.U)(e)||!(0,u.U)(t))throw new Error("Integers expected in function rightLogShift");return e>>>t}qr.signature=Rr,Fr.signature="number",Pr.signature=Rr,Lr.signature=Rr,Hr.signature=Rr,Gr.signature=Rr,Zr.signature=Rr;var Wr="bitNot",$r=["typed"],Vr=(0,i.d5)(Wr,$r,(e=>{var{typed:t}=e;return t(Wr,{number:Fr,BigNumber:Cr,"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Jr=["typed"],Yr=(0,i.d5)("arg",Jr,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this)}})})),Xr=["typed"],Qr=(0,i.d5)("im",Xr,(e=>{var{typed:t}=e;return t("im",{number:function(e){return 0},BigNumber:function(e){return e.mul(0)},Complex:function(e){return e.im},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Kr="number, number";function en(e){return!e}function tn(e,t){return!(!e&&!t)}function rn(e,t){return!!e!=!!t}function nn(e,t){return!(!e||!t)}en.signature="number",tn.signature=Kr,rn.signature=Kr,nn.signature=Kr;var an=["typed"],on=(0,i.d5)("not",an,(e=>{var{typed:t}=e;return t("not",{number:en,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(0,ut.Fh)(e,this)}})})),sn=["typed"],un=(0,i.d5)("filter",sn,(e=>{var{typed:t}=e;return t("filter",{"Array, function":cn,"Matrix, function":function(e,t){return e.create(cn(e.toArray(),t))},"Array, RegExp":Je.U_,"Matrix, RegExp":function(e,t){return e.create((0,Je.U_)(e.toArray(),t))}})}));function cn(e,t){var r=(0,h.oV)(t);return(0,Je.hX)(e,(function(e,n,i){return 1===r?t(e):2===r?t(e,[n]):t(e,[n],i)}))}var ln="forEach",fn=["typed"],pn=(0,i.d5)(ln,fn,(e=>{var{typed:t}=e;return t(ln,{"Array, function":dn,"Matrix, function":function(e,t){return e.forEach(t)}})}));function dn(e,t){var r=(0,h.oV)(t);!function n(i,a){Array.isArray(i)?(0,Je.Ed)(i,(function(e,t){n(e,a.concat(t))})):1===r?t(i):2===r?t(i,a):t(i,a,e)}(e,[])}var hn=["typed"],mn=(0,i.d5)("map",hn,(e=>{var{typed:t}=e;return t("map",{"Array, function":vn,"Matrix, function":function(e,t){return e.map(t)}})}));function vn(e,t){var r=(0,h.oV)(t);return function n(i,a){return Array.isArray(i)?i.map((function(e,t){return n(e,a.concat(t))})):1===r?t(i):2===r?t(i,a):t(i,a,e)}(e,[])}var yn=["typed"],gn=(0,i.d5)("erf",yn,(e=>{var{typed:t}=e;return t("name",{number:function(e){var t=Math.abs(e);return t>=Nn?(0,u.Xx)(e):t<=xn?(0,u.Xx)(e)*function(e){var t,r=e*e,n=wn[0][4]*r,i=r;for(t=0;t<3;t+=1)n=(n+wn[0][t])*r,i=(i+_n[0][t])*r;return e*(n+wn[0][3])/(i+_n[0][3])}(t):t<=4?(0,u.Xx)(e)*(1-function(e){var t,r=wn[1][8]*e,n=e;for(t=0;t<7;t+=1)r=(r+wn[1][t])*e,n=(n+_n[1][t])*e;var i=(r+wn[1][7])/(n+_n[1][7]),a=parseInt(16*e)/16,o=(e-a)*(e+a);return Math.exp(-a*a)*Math.exp(-o)*i}(t)):(0,u.Xx)(e)*(1-function(e){var t,r=1/(e*e),n=wn[2][5]*r,i=r;for(t=0;t<4;t+=1)n=(n+wn[2][t])*r,i=(i+_n[2][t])*r;var a=r*(n+wn[2][4])/(i+_n[2][4]);a=(bn-a)/e;var o=(e-(r=parseInt(16*e)/16))*(e+r);return Math.exp(-r*r)*Math.exp(-o)*a}(t))},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),xn=.46875,bn=.5641895835477563,wn=[[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]],_n=[[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]],Nn=Math.pow(2,53),En="format",Mn=["typed"],Sn=(0,i.d5)(En,Mn,(e=>{var{typed:t}=e;return t(En,{any:Ye.WU,"any, Object | function | number":Ye.WU})})),An=(0,i.d5)("oct",["typed","format"],(e=>{var{typed:t,format:r}=e;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})}})})),On="print",kn=["typed"],Tn=(0,i.d5)(On,kn,(e=>{var{typed:t}=e;return t(On,{"string, Object | Array":Cn,"string, Object | Array, number | Object":Cn})}));function Cn(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?(0,c.HD)(a)?a:(0,Ye.WU)(a,r):e}))}var In="isPrime",Dn=["typed"],zn=(0,i.d5)(In,Dn,(e=>{var{typed:t}=e;return t(In,{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;for(var t=5;e.gte(t*t);t+=6)if(e.mod(t).eq(0)||e.mod(t+2).eq(0))return!1;return!0},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Bn="acos",jn=["typed","config","Complex"],Un=(0,i.d5)(Bn,jn,(e=>{var{typed:t,config:r,Complex:n}=e;return t(Bn,{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(0,ut.Fh)(e,this)}})})),Rn="number";function qn(e){return(0,u.__)(e)}function Fn(e){return Math.atan(1/e)}function Pn(e){return isFinite(e)?(Math.log((e+1)/e)+Math.log(e/(e-1)))/2:0}function Ln(e){return Math.asin(1/e)}function Hn(e){var t=1/e;return Math.log(t+Math.sqrt(t*t+1))}function Gn(e){return Math.acos(1/e)}function Zn(e){var t=1/e,r=Math.sqrt(t*t-1);return Math.log(r+t)}function Wn(e){return(0,u.Vf)(e)}function $n(e){return(0,u.C8)(e)}function Vn(e){return 1/Math.tan(e)}function Jn(e){var t=Math.exp(2*e);return(t+1)/(t-1)}function Yn(e){return 1/Math.sin(e)}function Xn(e){return 0===e?Number.POSITIVE_INFINITY:Math.abs(2/(Math.exp(e)-Math.exp(-e)))*(0,u.Xx)(e)}function Qn(e){return 1/Math.cos(e)}function Kn(e){return 2/(Math.exp(e)+Math.exp(-e))}function ei(e){return(0,u.R_)(e)}qn.signature=Rn,Fn.signature=Rn,Pn.signature=Rn,Ln.signature=Rn,Hn.signature=Rn,Gn.signature=Rn,Zn.signature=Rn,Wn.signature=Rn,$n.signature=Rn,Vn.signature=Rn,Jn.signature=Rn,Yn.signature=Rn,Xn.signature=Rn,Qn.signature=Rn,Kn.signature=Rn,ei.signature=Rn;var ti="acot",ri=["typed","BigNumber"],ni=(0,i.d5)(ti,ri,(e=>{var{typed:t,BigNumber:r}=e;return t(ti,{number:Fn,Complex:function(e){return e.acot()},BigNumber:function(e){return new r(1).div(e).atan()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ii="acsc",ai=["typed","config","Complex","BigNumber"],oi=(0,i.d5)(ii,ai,(e=>{var{typed:t,config:r,Complex:n,BigNumber:i}=e;return t(ii,{number:function(e){return e<=-1||e>=1||r.predictable?Ln(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(0,ut.Fh)(e,this)}})})),si="asec",ui=["typed","config","Complex","BigNumber"],ci=(0,i.d5)(si,ui,(e=>{var{typed:t,config:r,Complex:n,BigNumber:i}=e;return t(si,{number:function(e){return e<=-1||e>=1||r.predictable?Gn(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(0,ut.Fh)(e,this)}})})),li="asin",fi=["typed","config","Complex"],pi=(0,i.d5)(li,fi,(e=>{var{typed:t,config:r,Complex:n}=e;return t(li,{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(0,ut.Fh)(e,this,!0)}})})),di=["typed"],hi=(0,i.d5)("atan",di,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this,!0)}})})),mi="atanh",vi=["typed","config","Complex"],yi=(0,i.d5)(mi,vi,(e=>{var{typed:t,config:r,Complex:n}=e;return t(mi,{number:function(e){return e<=1&&e>=-1||r.predictable?$n(e):new n(e,0).atanh()},Complex:function(e){return e.atanh()},BigNumber:function(e){return e.atanh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)}})})),gi="cosh",xi=["typed"],bi=(0,i.d5)(gi,xi,(e=>{var{typed:t}=e;return t(gi,{number:u.f9,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(0,ut.Fh)(e,this)}})})),wi="coth",_i=["typed","BigNumber"],Ni=(0,i.d5)(wi,_i,(e=>{var{typed:t,BigNumber:r}=e;return t(wi,{number:Jn,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(0,ut.Fh)(e,this)}})})),Ei="csch",Mi=["typed","BigNumber"],Si=(0,i.d5)(Ei,Mi,(e=>{var{typed:t,BigNumber:r}=e;return t(Ei,{number:Xn,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(0,ut.Fh)(e,this)}})})),Ai="sech",Oi=["typed","BigNumber"],ki=(0,i.d5)(Ai,Oi,(e=>{var{typed:t,BigNumber:r}=e;return t(Ai,{number:Kn,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(0,ut.Fh)(e,this)}})})),Ti="sinh",Ci=["typed"],Ii=(0,i.d5)(Ti,Ci,(e=>{var{typed:t}=e;return t(Ti,{number:ei,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(0,ut.Fh)(e,this,!0)}})})),Di=["typed"],zi=(0,i.d5)("tanh",Di,(e=>{var{typed:t}=e;return t("tanh",{number:u.AE,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(0,ut.Fh)(e,this,!0)}})}));function Bi(e,t){if(t<e)return 1;if(t===e)return t;var r=t+e>>1;return Bi(e,r)*Bi(r+1,t)}function ji(e,t){if(!(0,u.U)(e)||e<0)throw new TypeError("Positive integer value expected in function combinations");if(!(0,u.U)(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");var r=e-t;return t<r?Bi(r+1,e)/Bi(1,t):Bi(t+1,e)/Bi(1,r)}ji.signature="number, number";var Ui="combinations",Ri=["typed"],qi=(0,i.d5)(Ui,Ri,(e=>{var{typed:t}=e;return t(Ui,{"number, number":ji,"BigNumber, BigNumber":function(e,t){var r,n,i=e.constructor,a=e.minus(t),o=new i(1);if(!Fi(e)||!Fi(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 Fi(e){return e.isInteger()&&e.gte(0)}var Pi=r(6377),Li=Pi(Date.now());function Hi(e){var t,r;return t=null===(r=e)?Li:Pi(String(r)),function(){return t()}}var Gi=["typed","config","?on"],Zi=(0,i.d5)("pickRandom",Gi,(e=>{var{typed:t,config:r,on:n}=e,i=Hi(r.randomSeed);return n&&n("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Hi(e.randomSeed))})),t({"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{number:r,weights:n,elementWise:a=!0}=t,o=void 0===r;o&&(r=1);var s=(0,c.SW)(e)?e.create:(0,c.SW)(n)?n.create:null;e=e.valueOf(),n&&(n=n.valueOf()),!0===a&&(e=(0,Je.xH)(e),n=(0,Je.xH)(n));var u=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,f=n.length;l<f;l++){if(!(0,c.hj)(n[l])||n[l]<0)throw new Error("Weights must be an array of positive numbers");u+=n[l]}}for(var p,d=e.length,h=[];h.length<r;){if(void 0===n)p=e[Math.floor(i()*d)];else for(var m=i()*u,v=0,y=e.length;v<y;v++)if((m-=n[v])<0){p=e[v];break}h.push(p)}return o?h[0]:s?s(h):h}}));function Wi(e,t){var r=[];if((e=e.slice(0)).length>1)for(var n=0,i=e.shift();n<i;n++)r.push(Wi(e,t));else for(var a=0,o=e.shift();a<o;a++)r.push(t());return r}var $i="randomInt",Vi=["typed","config","?on"],Ji=(0,i.d5)($i,Vi,(e=>{var{typed:t,config:r,on:n}=e,i=Hi(r.randomSeed);return n&&n("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Hi(e.randomSeed))})),t($i,{"":()=>o(0,1),number:e=>o(0,e),"number, number":(e,t)=>o(e,t),"Array | Matrix":e=>a(e,0,1),"Array | Matrix, number":(e,t)=>a(e,0,t),"Array | Matrix, number, number":(e,t,r)=>a(e,t,r)});function a(e,t,r){var n=Wi(e.valueOf(),(()=>o(t,r)));return(0,c.SW)(e)?e.create(n):n}function o(e,t){return Math.floor(e+i()*(t-e))}})),Yi="clone",Xi=["typed"],Qi=(0,i.d5)(Yi,Xi,(e=>{var{typed:t}=e;return t(Yi,{any:Xe.d9})})),Ki="hasNumericValue",ea=["typed","isNumeric"],ta=(0,i.d5)(Ki,ea,(e=>{var{typed:t,isNumeric:r}=e;return t(Ki,{string:function(e){return e.trim().length>0&&!isNaN(Number(e))},any:function(e){return r(e)}})})),ra="typeOf",na=["typed"],ia=(0,i.d5)(ra,na,(e=>{var{typed:t}=e;return t(ra,{any:c.kM})})),aa="string",oa=["typed"],sa=(0,i.d5)(aa,oa,(e=>{var{typed:t}=e;return t(aa,{"":function(){return""},number:u.WU,null:function(e){return"null"},boolean:function(e){return e+""},string:function(e){return e},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)},any:function(e){return String(e)}})})),ua=["typed","Fraction"],ca=(0,i.d5)("fraction",ua,(e=>{var{typed:t,Fraction:r}=e;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(0,ut.Fh)(e,this)}})})),la="unaryMinus",fa=["typed"],pa=(0,i.d5)(la,fa,(e=>{var{typed:t}=e;return t(la,{number:Zt,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(0,ut.Fh)(e,this,!0)}})})),da="addScalar",ha=["typed"],ma=(0,i.d5)(da,ha,(e=>{var{typed:t}=e;return t(da,{"number, number":Ht,"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}})})),va=["typed"],ya=(0,i.d5)("exp",va,(e=>{var{typed:t}=e;return t("exp",{number:Yt,Complex:function(e){return e.exp()},BigNumber:function(e){return e.exp()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),ga="log2",xa=["typed","config","Complex"],ba=(0,i.d5)(ga,xa,(e=>{var{typed:t,config:r,Complex:n}=e;return t(ga,{number:function(e){return e>=0||r.predictable?rr(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(0,ut.Fh)(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)}})),wa=["config","typed","Complex"],_a=(0,i.d5)("sqrt",wa,(e=>{var{config:t,typed:r,Complex:n}=e;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(0,ut.Fh)(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()}})),Na="conj",Ea=["typed"],Ma=(0,i.d5)(Na,Ea,(e=>{var{typed:t}=e;return t(Na,{number:function(e){return e},BigNumber:function(e){return e},Complex:function(e){return e.conjugate()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Sa="getMatrixDataType",Aa=["typed"],Oa=(0,i.d5)(Sa,Aa,(e=>{var{typed:t}=e;return t(Sa,{Array:function(e){return(0,Je.$q)(e,c.kM)},Matrix:function(e){return e.getDataType()}})})),ka="mode",Ta=["typed","isNaN","isNumeric"],Ca=(0,i.d5)(ka,Ta,(e=>{var{typed:t,isNaN:r,isNumeric:n}=e;return t(ka,{"Array | Matrix":i,"...":function(e){return i(e)}});function i(e){if(0===(e=(0,Je.xH)(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}})),Ia=(0,i.d5)("bin",["typed","format"],(e=>{var{typed:t,format:r}=e;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})}})})),Da="acosh",za=["typed","config","Complex"],Ba=(0,i.d5)(Da,za,(e=>{var{typed:t,config:r,Complex:n}=e;return t(Da,{number:function(e){return e>=1||r.predictable?qn(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(0,ut.Fh)(e,this)}})})),ja="acsch",Ua=["typed","BigNumber"],Ra=(0,i.d5)(ja,Ua,(e=>{var{typed:t,BigNumber:r}=e;return t(ja,{number:Hn,Complex:function(e){return e.acsch()},BigNumber:function(e){return new r(1).div(e).asinh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),qa=["typed"],Fa=(0,i.d5)("asinh",qa,(e=>{var{typed:t}=e;return t("asinh",{number:Wn,Complex:function(e){return e.asinh()},BigNumber:function(e){return e.asinh()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)}})})),Pa=["typed"],La=(0,i.d5)("cos",Pa,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this)}})})),Ha=["typed","BigNumber"],Ga=(0,i.d5)("csc",Ha,(e=>{var{typed:t,BigNumber:r}=e;return t("csc",{number:Yn,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(0,ut.Fh)(e,this)}})})),Za=["typed"],Wa=(0,i.d5)("sin",Za,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this,!0)}})})),$a="combinationsWithRep",Va=["typed"],Ja=(0,i.d5)($a,Va,(e=>{var{typed:t}=e;return t($a,{"number, number":function(e,t){if(!(0,u.U)(e)||e<0)throw new TypeError("Positive integer value expected in function combinationsWithRep");if(!(0,u.U)(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?Bi(e,e+t-1)/Bi(1,t):Bi(t+1,e+t-1)/Bi(1,e-1)},"BigNumber, BigNumber":function(e,t){var r,n,i=new(0,e.constructor)(1),a=e.minus(i);if(!Ya(e)||!Ya(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 Ya(e){return e.isInteger()&&e.gte(0)}var Xa="random",Qa=["typed","config","?on"],Ka=(0,i.d5)(Xa,Qa,(e=>{var{typed:t,config:r,on:n}=e,i=Hi(r.randomSeed);return n&&n("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Hi(e.randomSeed))})),t(Xa,{"":()=>o(0,1),number:e=>o(0,e),"number, number":(e,t)=>o(e,t),"Array | Matrix":e=>a(e,0,1),"Array | Matrix, number":(e,t)=>a(e,0,t),"Array | Matrix, number, number":(e,t,r)=>a(e,t,r)});function a(e,t,r){var n=Wi(e.valueOf(),(()=>o(t,r)));return(0,c.SW)(e)?e.create(n):n}function o(e,t){return e+i()*(t-e)}})),eo="isNegative",to=["typed"],ro=(0,i.d5)(eo,to,(e=>{var{typed:t}=e;return t(eo,{number:vt,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(0,ut.Fh)(e,this)}})})),no=["typed","equalScalar","Matrix"],io=(0,i.d5)("SparseMatrix",no,(e=>{var{typed:t,equalScalar:r,Matrix:n}=e;function i(e,t){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!(0,c.HD)(t))throw new Error("Invalid datatype: "+t);if((0,c.SW)(e))!function(e,t,r){"SparseMatrix"===t.type?(e._values=t._values?(0,Xe.d9)(t._values):void 0,e._index=(0,Xe.d9)(t._index),e._ptr=(0,Xe.d9)(t._ptr),e._size=(0,Xe.d9)(t._size),e._datatype=r||t._datatype):a(e,t.valueOf(),r||t._datatype)}(this,e,t);else if(e&&(0,c.kJ)(e.index)&&(0,c.kJ)(e.ptr)&&(0,c.kJ)(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((0,c.kJ)(e))a(this,e,t);else{if(e)throw new TypeError("Unsupported type of data ("+(0,c.kM)(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((0,c.HD)(i)&&(s=t.find(r,[i,i])||r,u=t.convert(0,i)),a>0){var l=0;do{e._ptr.push(e._index.length);for(var f=0;f<a;f++){var p=n[f];if((0,c.kJ)(p)){if(0===l&&o<p.length&&(o=p.length),l<p.length){var d=p[l];s(d,u)||(e._values.push(d),e._index.push(f))}}else 0===l&&o<1&&(o=1),s(p,u)||(e._values.push(p),e._index.push(f))}l++}while(l<o)}e._ptr.push(e._index.length),e._size=[a,o]}function o(e,t){if(!(0,c.dh)(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 Qe.m(s.length,e._size.length);var u=t.min(),l=t.max();for(r=0,n=e._size.length;r<n;r++)(0,Je.Ls)(u[r],e._size[r]),(0,Je.Ls)(l[r],e._size[r]);var f=e._values,p=e._index,d=e._ptr,h=t.dimension(0),m=t.dimension(1),v=[],y=[];h.forEach((function(e,t){y[e]=t[0],v[e]=!0}));var g=f?[]:void 0,x=[],b=[];return m.forEach((function(e){for(b.push(x.length),a=d[e],o=d[e+1];a<o;a++)r=p[a],!0===v[r]&&(x.push(y[r]),g&&g.push(f[a]))})),b.push(x.length),new i({values:g,index:x,ptr:b,size:s,datatype:e._datatype})}function s(e,t,r,n){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");var i,a=t.size(),o=t.isScalar();if((0,c.SW)(r)?(i=r.size(),r=r.toArray()):i=(0,Je.aJ)(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 Qe.m(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=(0,Je.f4)(r,a.length,u,i)}if(!(0,Xe.J5)(a,i))throw new Qe.m(a,i,">");for(var l=t.min()[0],f=t.min()[1],p=i[0],d=i[1],h=0;h<p;h++)for(var m=0;m<d;m++){var v=r[h][m];e.set([h+l,m+f],v,n)}}return e}function l(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 f(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 p(e,n,i,a){var o=a||0,s=r,u=0;(0,c.HD)(e._datatype)&&(s=t.find(r,[e._datatype,e._datatype])||r,u=t.convert(0,e._datatype),o=t.convert(o,e._datatype));var l,f,p,d=!s(o,u),h=e._size[0],m=e._size[1];if(i>m){for(f=m;f<i;f++)if(e._ptr[f]=e._values.length,d)for(l=0;l<h;l++)e._values.push(o),e._index.push(l);e._ptr[i]=e._values.length}else i<m&&(e._ptr.splice(i+1,m-i),e._values.splice(e._ptr[i],e._values.length),e._index.splice(e._ptr[i],e._index.length));if(m=i,n>h){if(d){var v=0;for(f=0;f<m;f++){e._ptr[f]=e._ptr[f]+v,p=e._ptr[f+1]+v;var y=0;for(l=h;l<n;l++,y++)e._values.splice(p+y,0,o),e._index.splice(p+y,0,l),v++}e._ptr[m]=e._values.length}}else if(n<h){var g=0;for(f=0;f<m;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++)(l=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 d(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 l=r[o],f=r[o+1],p=l;p<f;p++)c[a=t[p]][o]=e?i?(0,Xe.d9)(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(0,Je.$q)(this._values,c.kM)},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 o(this,e);case 2:case 3:return s(this,e,t,r);default:throw new SyntaxError("Wrong number of arguments")}},i.prototype.get=function(e){if(!(0,c.kJ)(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Qe.m(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];(0,Je.Ls)(t,this._size[0]),(0,Je.Ls)(r,this._size[1]);var n=l(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(!(0,c.kJ)(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new Qe.m(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],d=r,h=0;(0,c.HD)(this._datatype)&&(d=t.find(r,[this._datatype,this._datatype])||r,h=t.convert(0,this._datatype)),(a>s-1||o>u-1)&&(p(this,Math.max(a+1,s),Math.max(o+1,u),i),s=this._size[0],u=this._size[1]),(0,Je.Ls)(a,s),(0,Je.Ls)(o,u);var m=l(a,this._ptr[o],this._ptr[o+1],this._index);return m<this._ptr[o+1]&&this._index[m]===a?d(n,h)?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]--}(m,o,this._values,this._index,this._ptr):this._values[m]=n:f(m,a,o,n,this._values,this._index,this._ptr),this},i.prototype.resize=function(e,t,r){if(!(0,c.uZ)(e))throw new TypeError("Array or Matrix expected");var n=e.valueOf().map((e=>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(!(0,c.hj)(e)||!(0,u.U)(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+(0,Ye.WU)(n)+")")})),p(r?this.clone():this,n[0],n[1],t)},i.prototype.reshape=function(e,t){if(!(0,c.kJ)(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(!(0,c.hj)(t)||!(0,u.U)(t)||t<=-2||0===t)throw new TypeError("Invalid size, must contain positive integers or -1 (size: "+(0,Ye.WU)(e)+")")}));var r=this._size[0]*this._size[1];if(r!==(e=(0,Je.eu)(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 o=0;o<n._ptr[a+1]-n._ptr[a];o++)i.push(a);for(var s=n._values.slice(),p=n._index.slice(),d=0;d<n._index.length;d++){var h=p[d],m=i[d],v=h*n._size[1]+m;i[d]=v%e[1],p[d]=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<s.length;g++){var x=p[g],b=i[g],w=s[g];f(l(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?(0,Xe.d9)(this._values):void 0,index:(0,Xe.d9)(this._index),ptr:(0,Xe.d9)(this._ptr),size:(0,Xe.d9)(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,l){var f=[],p=[],d=[],h=r,m=0;(0,c.HD)(e._datatype)&&(h=t.find(r,[e._datatype,e._datatype])||r,m=t.convert(0,e._datatype));for(var v=function(e,t,r){e=u(e,t,r),h(e,m)||(f.push(e),p.push(t))},y=0;y<=s;y++){d.push(f.length);var g=e._ptr[y],x=e._ptr[y+1];if(l)for(var b=g;b<x;b++){var w=e._index[b];w>=0&&w<=a&&v(e._values[b],w-0,y-0)}else{for(var _={},N=g;N<x;N++)_[e._index[N]]=e._values[N];for(var E=0;E<=a;E++)v(E in _?_[E]:0,E-0,y-0)}}return d.push(f.length),new i({values:f,index:p,ptr:d,size:[a-0+1,s-0+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={},l=a;l<o;l++)c[this._index[l]]=this._values[l];for(var f=0;f<r;f++)e(f in c?c[f]:0,[f,i],this)}}},i.prototype.toArray=function(){return d(this._values,this._index,this._ptr,this._size,!0)},i.prototype.valueOf=function(){return d(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 ["+(0,Ye.WU)(t,e)+" x "+(0,Ye.WU)(r,e)+"] density: "+(0,Ye.WU)(n,e)+"\n",a=0;a<r;a++)for(var o=this._ptr[a],s=this._ptr[a+1],u=o;u<s;u++){var c=this._index[u];i+="\n    ("+(0,Ye.WU)(c,e)+", "+(0,Ye.WU)(a,e)+") ==> "+(this._values?(0,Ye.WU)(this._values[u],e):"X")}return i},i.prototype.toString=function(){return(0,Ye.WU)(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((0,c.l9)(e)&&(e=e.toNumber()),!(0,c.hj)(e)||!(0,u.U)(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],o=Math.min(n-r,a-t),s=[],l=[],f=[];f[0]=0;for(var p=t;p<a&&s.length<o;p++)for(var d=this._ptr[p],h=this._ptr[p+1],m=d;m<h;m++){var v=this._index[m];if(v===p-t+r){s.push(this._values[m]),l[s.length-1]=v-r;break}}return f.push(s.length),new i({values:s,index:l,ptr:f,size:[o,1]})},i.fromJSON=function(e){return new i(e)},i.diagonal=function(e,n,a,o,s){if(!(0,c.kJ)(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((0,c.l9)(e)&&(e=e.toNumber()),!(0,c.hj)(e)||!(0,u.U)(e)||e<1)throw new Error("Size values must be positive integers");return e})),a){if((0,c.l9)(a)&&(a=a.toNumber()),!(0,c.hj)(a)||!(0,u.U)(a))throw new TypeError("The parameter k must be an integer number")}else a=0;var l=r,f=0;(0,c.HD)(s)&&(l=t.find(r,[s,s])||r,f=t.convert(0,s));var p,d=a>0?a:0,h=a<0?-a:0,m=e[0],v=e[1],y=Math.min(m-h,v-d);if((0,c.kJ)(n)){if(n.length!==y)throw new Error("Invalid value array length");p=function(e){return n[e]}}else if((0,c.SW)(n)){var g=n.size();if(1!==g.length||g[0]!==y)throw new Error("Invalid matrix length");p=function(e){return n.get([e])}}else p=function(){return n};for(var x=[],b=[],w=[],_=0;_<v;_++){w.push(x.length);var N=_-d;if(N>=0&&N<y){var E=p(N);l(E,f)||(b.push(N+h),x.push(E))}}return w.push(x.length),new i({values:x,index:b,ptr:w,size:[m,v]})},i.prototype.swapRows=function(e,t){if(!((0,c.hj)(e)&&(0,u.U)(e)&&(0,c.hj)(t)&&(0,u.U)(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(0,Je.Ls)(e,this._size[0]),(0,Je.Ls)(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=l(e,s,u,i),f=l(t,s,u,i);if(c<u&&f<u&&i[c]===e&&i[f]===t){if(n){var p=n[c];n[c]=n[f],n[f]=p}}else if(c<u&&i[c]===e&&(f>=u||i[f]!==t)){var d=n?n[c]:void 0;i.splice(f,0,t),n&&n.splice(f,0,d),i.splice(f<=c?c+1:c,1),n&&n.splice(f<=c?c+1:c,1)}else if(f<u&&i[f]===t&&(c>=u||i[c]!==e)){var h=n?n[f]:void 0;i.splice(c,0,e),n&&n.splice(c,0,h),i.splice(c<=f?f+1:f,1),n&&n.splice(c<=f?f+1:f,1)}}},i}),{isClass:!0}),ao="matrix",oo=["typed","Matrix","DenseMatrix","SparseMatrix"],so=(0,i.d5)(ao,oo,(e=>{var{typed:t,Matrix:r,DenseMatrix:n,SparseMatrix:i}=e;return t(ao,{"":function(){return a([])},string:function(e){return a([],e)},"string, string":function(e,t){return a([],e,t)},Array:function(e){return a(e)},Matrix:function(e){return a(e,e.storage())},"Array | Matrix, string":a,"Array | Matrix, string, string":a});function a(e,t,r){if("dense"===t||"default"===t||void 0===t)return new n(e,r);if("sparse"===t)return new i(e,r);throw new TypeError("Unknown matrix type "+JSON.stringify(t)+".")}})),uo="cbrt",co=["config","typed","isNegative","unaryMinus","matrix","Complex","BigNumber","Fraction"],lo=(0,i.d5)(uo,co,(e=>{var{config:t,typed:r,isNegative:n,unaryMinus:i,matrix:a,Complex:o,BigNumber:s,Fraction:u}=e;return r(uo,{number:$t,Complex:l,"Complex, boolean":l,BigNumber:function(e){return e.cbrt()},Unit:function(e){if(e.value&&(0,c.Mc)(e.value)){var t=e.clone();return t.value=1,(t=t.pow(1/3)).value=l(e.value),t}var r,a=n(e.value);a&&(e.value=i(e.value)),r=(0,c.l9)(e.value)?new s(1).div(3):(0,c.yQ)(e.value)?new u(1,3):1/3;var o=e.pow(r);return a&&(o.value=i(o.value)),o},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)}});function l(e,r){var n=e.arg()/3,i=e.abs(),s=new o($t(i),0).mul(new o(0,n).exp());if(r){var u=[s,new o($t(i),0).mul(new o(0,n+2*Math.PI/3).exp()),new o($t(i),0).mul(new o(0,n-2*Math.PI/3).exp())];return"Array"===t.matrix?u:a(u)}return s}})),fo=["typed"],po=(0,i.d5)("algorithm01",fo,(e=>{var{typed:t}=e;return function(e,r,n,i){var a=e._data,o=e._size,s=e._datatype,u=r._values,c=r._index,l=r._ptr,f=r._size,p=r._datatype;if(o.length!==f.length)throw new Qe.m(o.length,f.length);if(o[0]!==f[0]||o[1]!==f[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+f+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var d,h,m=o[0],v=o[1],y="string"==typeof s&&s===p?s:void 0,g=y?t.find(n,[y,y]):n,x=[];for(d=0;d<m;d++)x[d]=[];var b=[],w=[];for(h=0;h<v;h++){for(var _=h+1,N=l[h],E=l[h+1],M=N;M<E;M++)b[d=c[M]]=i?g(u[M],a[d][h]):g(a[d][h],u[M]),w[d]=_;for(d=0;d<m;d++)w[d]===_?x[d][h]=b[d]:x[d][h]=a[d][h]}return e.createDenseMatrix({data:x,size:[m,v],datatype:y})}})),ho=["typed","equalScalar"],mo=(0,i.d5)("algorithm04",ho,(e=>{var{typed:t,equalScalar:r}=e;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,l=n._values,f=n._index,p=n._ptr,d=n._size,h=n._datatype;if(u.length!==d.length)throw new Qe.m(u.length,d.length);if(u[0]!==d[0]||u[1]!==d[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+d+")");var m,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(m=c,g=t.find(r,[m,m]),x=t.convert(0,m),b=t.find(i,[m,m]));var w,_,N,E,M,S=a&&l?[]:void 0,A=[],O=[],k=a&&l?[]:void 0,T=a&&l?[]:void 0,C=[],I=[];for(_=0;_<y;_++){O[_]=A.length;var D=_+1;for(E=s[_],M=s[_+1],N=E;N<M;N++)w=o[N],A.push(w),C[w]=D,k&&(k[w]=a[N]);for(E=p[_],M=p[_+1],N=E;N<M;N++)if(C[w=f[N]]===D){if(k){var z=b(k[w],l[N]);g(z,x)?C[w]=null:k[w]=z}}else A.push(w),I[w]=D,T&&(T[w]=l[N]);if(k&&T)for(N=O[_];N<A.length;)C[w=A[N]]===D?(S[N]=k[w],N++):I[w]===D?(S[N]=T[w],N++):A.splice(N,1)}return O[y]=A.length,e.createSparseMatrix({values:S,index:A,ptr:O,size:[v,y],datatype:m})}})),vo=["typed","DenseMatrix"],yo=(0,i.d5)("algorithm10",vo,(e=>{var{typed:t,DenseMatrix:r}=e;return function(e,n,i,a){var o=e._values,s=e._index,u=e._ptr,c=e._size,l=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var f,p=c[0],d=c[1],h=i;"string"==typeof l&&(f=l,n=t.convert(n,f),h=t.find(i,[f,f]));for(var m=[],v=[],y=[],g=0;g<d;g++){for(var x=g+1,b=u[g],w=u[g+1],_=b;_<w;_++){var N=s[_];v[N]=o[_],y[N]=x}for(var E=0;E<p;E++)0===g&&(m[E]=[]),y[E]===x?m[E][g]=a?h(n,v[E]):h(v[E],n):m[E][g]=n}return new r({data:m,size:[p,d],datatype:f})}})),go=["typed"],xo=(0,i.d5)("algorithm13",go,(e=>{var{typed:t}=e;return function(e,n,i){var a,o=e._data,s=e._size,u=e._datatype,c=n._data,l=n._size,f=n._datatype,p=[];if(s.length!==l.length)throw new Qe.m(s.length,l.length);for(var d=0;d<s.length;d++){if(s[d]!==l[d])throw new RangeError("Dimension mismatch. Matrix A ("+s+") must match Matrix B ("+l+")");p[d]=s[d]}var h=i;"string"==typeof u&&u===f&&(a=u,h=t.find(i,[a,a]));var m=p.length>0?r(h,0,p,p[0],o,c):[];return e.createDenseMatrix({data:m,size:p,datatype:a})};function r(e,t,n,i,a,o){var s=[];if(t===n.length-1)for(var u=0;u<i;u++)s[u]=e(a[u],o[u]);else for(var c=0;c<i;c++)s[c]=r(e,t+1,n,n[t+1],a[c],o[c]);return s}})),bo=["typed"],wo=(0,i.d5)("algorithm14",bo,(e=>{var{typed:t}=e;return function(e,n,i,a){var o,s=e._data,u=e._size,c=e._datatype,l=i;"string"==typeof c&&(o=c,n=t.convert(n,o),l=t.find(i,[o,o]));var f=u.length>0?r(l,0,u,u[0],s,n,a):[];return e.createDenseMatrix({data:f,size:(0,Xe.d9)(u),datatype:o})};function r(e,t,n,i,a,o,s){var u=[];if(t===n.length-1)for(var c=0;c<i;c++)u[c]=s?e(o,a[c]):e(a[c],o);else for(var l=0;l<i;l++)u[l]=r(e,t+1,n,n[t+1],a[l],o,s);return u}})),_o=["typed","matrix","equalScalar","BigNumber","DenseMatrix"],No=(0,i.d5)("gcd",_o,(e=>{var{typed:t,matrix:r,equalScalar:n,BigNumber:i,DenseMatrix:a}=e,o=po({typed:t}),s=mo({typed:t,equalScalar:n}),u=yo({typed:t,DenseMatrix:a}),c=xo({typed:t}),l=wo({typed:t});return t("gcd",{"number, number":Qt,"BigNumber, BigNumber":function(e,t){if(!e.isInt()||!t.isInt())throw new Error("Parameters in function gcd must be integer numbers");for(var r=new i(0);!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 l(e,t,this,!1)},"number | BigNumber, SparseMatrix":function(e,t){return u(t,e,this,!0)},"number | BigNumber, DenseMatrix":function(e,t){return l(t,e,this,!0)},"Array, number | BigNumber":function(e,t){return l(r(e),t,this,!1).valueOf()},"number | BigNumber, Array":function(e,t){return l(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}})})),Eo=["typed","equalScalar"],Mo=(0,i.d5)("algorithm02",Eo,(e=>{var{typed:t,equalScalar:r}=e;return function(e,n,i,a){var o=e._data,s=e._size,u=e._datatype,c=n._values,l=n._index,f=n._ptr,p=n._size,d=n._datatype;if(s.length!==p.length)throw new Qe.m(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,m=s[0],v=s[1],y=r,g=0,x=i;"string"==typeof u&&u===d&&(h=u,y=t.find(r,[h,h]),g=t.convert(0,h),x=t.find(i,[h,h]));for(var b=[],w=[],_=[],N=0;N<v;N++){_[N]=w.length;for(var E=f[N],M=f[N+1],S=E;S<M;S++){var A=l[S],O=a?x(c[S],o[A][N]):x(o[A][N],c[S]);y(O,g)||(w.push(A),b.push(O))}}return _[v]=w.length,n.createSparseMatrix({values:b,index:w,ptr:_,size:[m,v],datatype:h})}})),So=["typed"],Ao=(0,i.d5)("algorithm03",So,(e=>{var{typed:t}=e;return function(e,r,n,i){var a=e._data,o=e._size,s=e._datatype,u=r._values,c=r._index,l=r._ptr,f=r._size,p=r._datatype;if(o.length!==f.length)throw new Qe.m(o.length,f.length);if(o[0]!==f[0]||o[1]!==f[1])throw new RangeError("Dimension mismatch. Matrix A ("+o+") must match Matrix B ("+f+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");var d,h=o[0],m=o[1],v=0,y=n;"string"==typeof s&&s===p&&(d=s,v=t.convert(0,d),y=t.find(n,[d,d]));for(var g=[],x=0;x<h;x++)g[x]=[];for(var b=[],w=[],_=0;_<m;_++){for(var N=_+1,E=l[_],M=l[_+1],S=E;S<M;S++){var A=c[S];b[A]=i?y(u[S],a[A][_]):y(a[A][_],u[S]),w[A]=N}for(var O=0;O<h;O++)w[O]===N?g[O][_]=b[O]:g[O][_]=i?y(v,a[O][_]):y(a[O][_],v)}return e.createDenseMatrix({data:g,size:[h,m],datatype:d})}})),Oo=["typed","equalScalar"],ko=(0,i.d5)("algorithm05",Oo,(e=>{var{typed:t,equalScalar:r}=e;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,l=n._values,f=n._index,p=n._ptr,d=n._size,h=n._datatype;if(u.length!==d.length)throw new Qe.m(u.length,d.length);if(u[0]!==d[0]||u[1]!==d[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+d+")");var m,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(m=c,g=t.find(r,[m,m]),x=t.convert(0,m),b=t.find(i,[m,m]));var w,_,N,E,M=a&&l?[]:void 0,S=[],A=[],O=M?[]:void 0,k=M?[]:void 0,T=[],C=[];for(_=0;_<y;_++){A[_]=S.length;var I=_+1;for(N=s[_],E=s[_+1];N<E;N++)w=o[N],S.push(w),T[w]=I,O&&(O[w]=a[N]);for(N=p[_],E=p[_+1];N<E;N++)T[w=f[N]]!==I&&S.push(w),C[w]=I,k&&(k[w]=l[N]);if(M)for(N=A[_];N<S.length;){var D=T[w=S[N]],z=C[w];if(D===I||z===I){var B=b(D===I?O[w]:x,z===I?k[w]:x);g(B,x)?S.splice(N,1):(M.push(B),N++)}}}return A[y]=S.length,e.createSparseMatrix({values:M,index:S,ptr:A,size:[v,y],datatype:m})}})),To=["typed","equalScalar"],Co=(0,i.d5)("algorithm11",To,(e=>{var{typed:t,equalScalar:r}=e;return function(e,n,i,a){var o=e._values,s=e._index,u=e._ptr,c=e._size,l=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var f,p=c[0],d=c[1],h=r,m=0,v=i;"string"==typeof l&&(f=l,h=t.find(r,[f,f]),m=t.convert(0,f),n=t.convert(n,f),v=t.find(i,[f,f]));for(var y=[],g=[],x=[],b=0;b<d;b++){x[b]=g.length;for(var w=u[b],_=u[b+1],N=w;N<_;N++){var E=s[N],M=a?v(n,o[N]):v(o[N],n);h(M,m)||(g.push(E),y.push(M))}}return x[d]=g.length,e.createSparseMatrix({values:y,index:g,ptr:x,size:[p,d],datatype:f})}})),Io=["typed","DenseMatrix"],Do=(0,i.d5)("algorithm12",Io,(e=>{var{typed:t,DenseMatrix:r}=e;return function(e,n,i,a){var o=e._values,s=e._index,u=e._ptr,c=e._size,l=e._datatype;if(!o)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");var f,p=c[0],d=c[1],h=i;"string"==typeof l&&(f=l,n=t.convert(n,f),h=t.find(i,[f,f]));for(var m=[],v=[],y=[],g=0;g<d;g++){for(var x=g+1,b=u[g],w=u[g+1],_=b;_<w;_++){var N=s[_];v[N]=o[_],y[N]=x}for(var E=0;E<p;E++)0===g&&(m[E]=[]),y[E]===x?m[E][g]=a?h(n,v[E]):h(v[E],n):m[E][g]=a?h(n,0):h(0,n)}return new r({data:m,size:[p,d],datatype:f})}})),zo=["typed","matrix","equalScalar","DenseMatrix"],Bo=(0,i.d5)("mod",zo,(e=>{var{typed:t,matrix:r,equalScalar:n,DenseMatrix:i}=e,a=Mo({typed:t,equalScalar:n}),o=Ao({typed:t}),s=ko({typed:t,equalScalar:n}),u=Co({typed:t,equalScalar:n}),c=Do({typed:t,DenseMatrix:i}),l=xo({typed:t}),f=wo({typed:t});return t("mod",{"number, number":nr,"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 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 u(e,t,this,!1)},"DenseMatrix, any":function(e,t){return f(e,t,this,!1)},"any, SparseMatrix":function(e,t){return c(t,e,this,!0)},"any, DenseMatrix":function(e,t){return f(t,e,this,!0)},"Array, any":function(e,t){return f(r(e),t,this,!1).valueOf()},"any, Array":function(e,t){return f(r(t),e,this,!0).valueOf()}})})),jo=["typed","equalScalar"],Uo=(0,i.d5)("algorithm06",jo,(e=>{var{typed:t,equalScalar:r}=e;return function(e,n,i){var a=e._values,o=e._size,s=e._datatype,u=n._values,c=n._size,l=n._datatype;if(o.length!==c.length)throw new Qe.m(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 f,p=o[0],d=o[1],h=r,m=0,v=i;"string"==typeof s&&s===l&&(f=s,h=t.find(r,[f,f]),m=t.convert(0,f),v=t.find(i,[f,f]));for(var y=a&&u?[]:void 0,g=[],x=[],b=y?[]:void 0,w=[],_=[],N=0;N<d;N++){x[N]=g.length;var E=N+1;if((0,ut.U6)(e,N,w,b,_,E,g,v),(0,ut.U6)(n,N,w,b,_,E,g,v),b)for(var M=x[N];M<g.length;){var S=g[M];if(_[S]===E){var A=b[S];h(A,m)?g.splice(M,1):(y.push(A),M++)}else g.splice(M,1)}else for(var O=x[N];O<g.length;)_[g[O]]!==E?g.splice(O,1):O++}return x[d]=g.length,e.createSparseMatrix({values:y,index:g,ptr:x,size:[p,d],datatype:f})}})),Ro="nthRoot",qo=["typed","matrix","equalScalar","BigNumber"],Fo=(0,i.d5)(Ro,qo,(e=>{var{typed:t,matrix:r,equalScalar:n,BigNumber:i}=e,a=po({typed:t}),o=Mo({typed:t,equalScalar:n}),s=Uo({typed:t,equalScalar:n}),u=Co({typed:t,equalScalar:n}),c=xo({typed:t}),l=wo({typed:t}),f="Complex number not supported in function nthRoot. Use nthRoots instead.";return t(Ro,{number:function(e){return ir(e,2)},"number, number":ir,BigNumber:function(e){return p(e,new i(2))},Complex:function(e){throw new Error(f)},"Complex, number":function(e,t){throw new Error(f)},"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 l(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 l(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))}})),Po="xgcd",Lo=["typed","config","matrix","BigNumber"],Ho=(0,i.d5)(Po,Lo,(e=>{var{typed:t,config:r,matrix:n,BigNumber:i}=e;return t(Po,{"number, number":function(e,t){var i=sr(e,t);return"Array"===r.matrix?i:n(i)},"BigNumber, BigNumber":function(e,t){var a,o,s,u,c=new i(0),l=new i(1),f=c,p=l,d=l,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=f,f=p.minus(o.times(f)),p=a,a=d,d=h.minus(o.times(d)),h=a,e=t,t=s;return u=e.lt(c)?[e.neg(),p.neg(),h.neg()]:[e,e.isZero()?0:p,h],"Array"===r.matrix?u:n(u)}})})),Go="bitAnd",Zo=["typed","matrix","equalScalar"],Wo=(0,i.d5)(Go,Zo,(e=>{var{typed:t,matrix:r,equalScalar:n}=e,i=Mo({typed:t,equalScalar:n}),a=Uo({typed:t,equalScalar:n}),o=Co({typed:t,equalScalar:n}),s=xo({typed:t}),u=wo({typed:t});return t(Go,{"number, number":qr,"BigNumber, BigNumber":Tr,"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()}})})),$o=["typed","DenseMatrix"],Vo=(0,i.d5)("algorithm07",$o,(e=>{var{typed:t,DenseMatrix:r}=e;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 Qe.m(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 l,f,p,d=o[0],h=o[1],m=0,v=a;"string"==typeof s&&s===c&&(l=s,m=t.convert(0,l),v=t.find(a,[l,l]));var y=[];for(f=0;f<d;f++)y[f]=[];var g=[],x=[],b=[],w=[];for(p=0;p<h;p++){var _=p+1;for(n(e,p,b,g,_),n(i,p,w,x,_),f=0;f<d;f++){var N=b[f]===_?g[f]:m,E=w[f]===_?x[f]:m;y[f][p]=v(N,E)}}return new r({data:y,size:[d,h],datatype:l})};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 l=o[u];r[l]=i,n[l]=a[u]}}})),Jo="bitXor",Yo=["typed","matrix","DenseMatrix"],Xo=(0,i.d5)(Jo,Yo,(e=>{var{typed:t,matrix:r,DenseMatrix:n}=e,i=Ao({typed:t}),a=Vo({typed:t,DenseMatrix:n}),o=Do({typed:t,DenseMatrix:n}),s=xo({typed:t}),u=wo({typed:t});return t(Jo,{"number, number":Lr,"BigNumber, BigNumber":Br,"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()}})})),Qo=["typed","matrix","equalScalar","DenseMatrix"],Ko=(0,i.d5)("or",Qo,(e=>{var{typed:t,matrix:r,equalScalar:n,DenseMatrix:i}=e,a=Ao({typed:t}),o=ko({typed:t,equalScalar:n}),s=Do({typed:t,DenseMatrix:i}),u=xo({typed:t}),c=wo({typed:t});return t("or",{"number, number":tn,"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()}})})),es="diag",ts=["typed","matrix","DenseMatrix","SparseMatrix"],rs=(0,i.d5)(es,ts,(e=>{var{typed:t,matrix:r,DenseMatrix:n,SparseMatrix:i}=e;return t(es,{Array:function(e){return a(e,0,(0,Je.aJ)(e),null)},"Array, number":function(e,t){return a(e,t,(0,Je.aJ)(e),null)},"Array, BigNumber":function(e,t){return a(e,t.toNumber(),(0,Je.aJ)(e),null)},"Array, string":function(e,t){return a(e,0,(0,Je.aJ)(e),t)},"Array, number, string":function(e,t,r){return a(e,t,(0,Je.aJ)(e),r)},"Array, BigNumber, string":function(e,t,r){return a(e,t.toNumber(),(0,Je.aJ)(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(!(0,u.U)(t))throw new TypeError("Second parameter in function diag must be an integer");var s=t>0?t:0,l=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],l,s);case 2:return function(e,t,n,i,a,o){if((0,c.SW)(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),l=[],f=0;f<u;f++)l[f]=e[f+a][f+o];return null!==n?r(l):l}(e,t,o,a,l,s)}throw new RangeError("Matrix for function diag must be 2 dimensional")}})),ns="identity",is=["typed","config","matrix","BigNumber","DenseMatrix","SparseMatrix"],as=(0,i.d5)(ns,is,(e=>{var{typed:t,config:r,matrix:n,BigNumber:i,DenseMatrix:a,SparseMatrix:o}=e;return t(ns,{"":function(){return"Matrix"===r.matrix?n([]):[]},string:function(e){return n(e)},"number | BigNumber":function(e){return l(e,e,"Matrix"===r.matrix?"dense":void 0)},"number | BigNumber, string":function(e,t){return l(e,e,t)},"number | BigNumber, number | BigNumber":function(e,t){return l(e,t,"Matrix"===r.matrix?"dense":void 0)},"number | BigNumber, number | BigNumber, string":function(e,t,r){return l(e,t,r)},Array:function(e){return s(e)},"Array, string":function(e,t){return s(e,t)},Matrix:function(e){return s(e.valueOf(),e.storage())},"Matrix, string":function(e,t){return s(e.valueOf(),t)}});function s(e,t){switch(e.length){case 0:return t?n(t):[];case 1:return l(e[0],e[0],t);case 2:return l(e[0],e[1],t);default:throw new Error("Vector containing two values expected")}}function l(e,t,r){var n=(0,c.l9)(e)||(0,c.l9)(t)?i:null;if((0,c.l9)(e)&&(e=e.toNumber()),(0,c.l9)(t)&&(t=t.toNumber()),!(0,u.U)(e)||e<1)throw new Error("Parameters in function identity must be positive integers");if(!(0,u.U)(t)||t<1)throw new Error("Parameters in function identity must be positive integers");var s=n?new i(1):1,l=n?new n(0):0,f=[e,t];if(r){if("sparse"===r)return o.diagonal(f,s,0,l);if("dense"===r)return a.diagonal(f,s,0,l);throw new TypeError('Unknown matrix type "'.concat(r,'"'))}for(var p=(0,Je.SI)([],f,l),d=e<t?e:t,h=0;h<d;h++)p[h][h]=s;return p}})),os=["typed","config","matrix","BigNumber"],ss=(0,i.d5)("ones",os,(e=>{var{typed:t,config:r,matrix:n,BigNumber:i}=e;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){(0,c.l9)(e)&&(t=!0,n[r]=e.toNumber())})),t}(e)?new i(1):1;if(function(e){e.forEach((function(e){if("number"!=typeof e||!(0,u.U)(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?(0,Je.SI)(o,e,r):o}})),us="reshape",cs=["typed","isInteger","matrix"],ls=(0,i.d5)(us,cs,(e=>{var{typed:t,isInteger:r}=e;return t(us,{"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)})),(0,Je.XL)(e,t)}})})),fs=r(5180),ps="size",ds=["typed","config","?matrix"],hs=(0,i.d5)(ps,ds,(e=>{var{typed:t,config:r,matrix:n}=e;return t(ps,{Matrix:function(e){return e.create(e.size())},Array:Je.aJ,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([]):(0,fs.kX)()}})})),ms="zeros",vs=["typed","config","matrix","BigNumber"],ys=(0,i.d5)(ms,vs,(e=>{var{typed:t,config:r,matrix:n,BigNumber:i}=e;return t(ms,{"":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){(0,c.l9)(e)&&(t=!0,n[r]=e.toNumber())})),t}(e)?new i(0):0;if(function(e){e.forEach((function(e){if("number"!=typeof e||!(0,u.U)(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?(0,Je.SI)(o,e,r):o}})),gs=(0,i.d5)("hex",["typed","format"],(e=>{var{typed:t,format:r}=e;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})}})}));function xs(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 bs(e){for(var t=1;t<arguments.length;t++){var r=null!=arguments[t]?arguments[t]:{};t%2?xs(Object(r),!0).forEach((function(t){ws(e,t,r[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(r)):xs(Object(r)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(r,t))}))}return e}function ws(e,t,r){return t in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}var _s="Number of decimals in function round must be an integer",Ns="round",Es=["typed","matrix","equalScalar","zeros","BigNumber","DenseMatrix"],Ms=(0,i.d5)(Ns,Es,(e=>{var{typed:t,matrix:r,equalScalar:n,zeros:i,BigNumber:a,DenseMatrix:o}=e,s=Co({typed:t,equalScalar:n}),u=Do({typed:t,DenseMatrix:o}),c=wo({typed:t});return t(Ns,bs(bs({},Ss),{},{Complex:function(e){return e.round()},"Complex, number":function(e,t){if(t%1)throw new TypeError(_s);return e.round(t)},"Complex, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(_s);var r=t.toNumber();return e.round(r)},"number, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(_s);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(_s);return e.toDecimalPlaces(t.toNumber())},Fraction:function(e){return e.round()},"Fraction, number":function(e,t){if(t%1)throw new TypeError(_s);return e.round(t)},"Array | Matrix":function(e){return(0,ut.Fh)(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()}}))})),Ss={number:cr,"number, number":function(e,t){if(!(0,u.U)(t))throw new TypeError(_s);if(t<0||t>15)throw new Error("Number of decimals in function round must be in te range of 0-15");return cr(e,t)}},As=["typed","equalScalar"],Os=(0,i.d5)("algorithm08",As,(e=>{var{typed:t,equalScalar:r}=e;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,l=n._values,f=n._index,p=n._ptr,d=n._size,h=n._datatype;if(u.length!==d.length)throw new Qe.m(u.length,d.length);if(u[0]!==d[0]||u[1]!==d[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+d+")");if(!a||!l)throw new Error("Cannot perform operation on Pattern Sparse Matrices");var m,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(m=c,g=t.find(r,[m,m]),x=t.convert(0,m),b=t.find(i,[m,m]));for(var w,_,N,E,M=[],S=[],A=[],O=[],k=[],T=0;T<y;T++){A[T]=S.length;var C=T+1;for(_=s[T],N=s[T+1],w=_;w<N;w++)k[E=o[w]]=C,O[E]=a[w],S.push(E);for(_=p[T],N=p[T+1],w=_;w<N;w++)k[E=f[w]]===C&&(O[E]=b(O[E],l[w]));for(w=A[T];w<S.length;){var I=O[E=S[w]];g(I,x)?S.splice(w,1):(M.push(I),w++)}}return A[y]=S.length,e.createSparseMatrix({values:M,index:S,ptr:A,size:[v,y],datatype:m})}})),ks="leftShift",Ts=["typed","matrix","equalScalar","zeros","DenseMatrix"],Cs=(0,i.d5)(ks,Ts,(e=>{var{typed:t,matrix:r,equalScalar:n,zeros:i,DenseMatrix:a}=e,o=po({typed:t}),s=Mo({typed:t,equalScalar:n}),u=Os({typed:t,equalScalar:n}),c=yo({typed:t,DenseMatrix:a}),l=Co({typed:t,equalScalar:n}),f=xo({typed:t}),p=wo({typed:t});return t(ks,{"number, number":Hr,"BigNumber, BigNumber":jr,"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 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, number | BigNumber":function(e,t){return n(t,0)?e.clone():l(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()}})})),Is="rightLogShift",Ds=["typed","matrix","equalScalar","zeros","DenseMatrix"],zs=(0,i.d5)(Is,Ds,(e=>{var{typed:t,matrix:r,equalScalar:n,zeros:i,DenseMatrix:a}=e,o=po({typed:t}),s=Mo({typed:t,equalScalar:n}),u=Os({typed:t,equalScalar:n}),c=yo({typed:t,DenseMatrix:a}),l=Co({typed:t,equalScalar:n}),f=xo({typed:t}),p=wo({typed:t});return t(Is,{"number, number":Zr,"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 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, number | BigNumber":function(e,t){return n(t,0)?e.clone():l(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()}})})),Bs="compare",js=["typed","config","matrix","equalScalar","BigNumber","Fraction","DenseMatrix"],Us=(0,i.d5)(Bs,js,(e=>{var{typed:t,config:r,equalScalar:n,matrix:i,BigNumber:a,Fraction:o,DenseMatrix:s}=e,c=Ao({typed:t}),l=ko({typed:t,equalScalar:n}),f=Do({typed:t,DenseMatrix:s}),p=xo({typed:t}),d=wo({typed:t});return t(Bs,{"boolean, boolean":function(e,t){return e===t?0:e>t?1:-1},"number, number":function(e,t){return(0,u.RI)(e,t,r.epsilon)?0:e>t?1:-1},"BigNumber, BigNumber":function(e,t){return St(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 l(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return c(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return c(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return p(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 d(e,t,this,!1)},"any, SparseMatrix":function(e,t){return f(t,e,this,!0)},"any, DenseMatrix":function(e,t){return d(t,e,this,!0)},"Array, any":function(e,t){return d(i(e),t,this,!1).valueOf()},"any, Array":function(e,t){return d(i(t),e,this,!0).valueOf()}})})),Rs="compareText",qs=["typed","matrix"],Fs=(0,i.d5)(Rs,qs,(e=>{var{typed:t,matrix:r}=e,n=xo({typed:t}),i=wo({typed:t});return t(Rs,{"any, any":Ye.cd,"DenseMatrix, DenseMatrix":function(e,t){return n(e,t,Ye.cd)},"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,Ye.cd,!1)},"any, DenseMatrix":function(e,t){return i(t,e,Ye.cd,!0)},"Array, any":function(e,t){return i(r(e),t,Ye.cd,!1).valueOf()},"any, Array":function(e,t){return i(r(t),e,Ye.cd,!0).valueOf()}})})),Ps="smaller",Ls=["typed","config","matrix","DenseMatrix"],Hs=(0,i.d5)(Ps,Ls,(e=>{var{typed:t,config:r,matrix:n,DenseMatrix:i}=e,a=Ao({typed:t}),o=Vo({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),c=xo({typed:t}),l=wo({typed:t});return t(Ps,{"boolean, boolean":function(e,t){return e<t},"number, number":function(e,t){return e<t&&!(0,u.RI)(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lt(t)&&!St(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 c(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 l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(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()}})})),Gs="larger",Zs=["typed","config","matrix","DenseMatrix"],Ws=(0,i.d5)(Gs,Zs,(e=>{var{typed:t,config:r,matrix:n,DenseMatrix:i}=e,a=Ao({typed:t}),o=Vo({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),c=xo({typed:t}),l=wo({typed:t});return t(Gs,{"boolean, boolean":function(e,t){return e>t},"number, number":function(e,t){return e>t&&!(0,u.RI)(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gt(t)&&!St(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 c(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 l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(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()}})})),$s="unequal",Vs=["typed","config","equalScalar","matrix","DenseMatrix"],Js=(0,i.d5)($s,Vs,(e=>{var{typed:t,config:r,equalScalar:n,matrix:i,DenseMatrix:a}=e,o=Ao({typed:t}),s=Vo({typed:t,DenseMatrix:a}),u=Do({typed:t,DenseMatrix:a}),c=xo({typed:t}),l=wo({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 s(e,t,f)},"SparseMatrix, DenseMatrix":function(e,t){return o(t,e,f,!0)},"DenseMatrix, SparseMatrix":function(e,t){return o(e,t,f,!1)},"DenseMatrix, DenseMatrix":function(e,t){return c(e,t,f)},"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 u(e,t,f,!1)},"DenseMatrix, any":function(e,t){return l(e,t,f,!1)},"any, SparseMatrix":function(e,t){return u(t,e,f,!0)},"any, DenseMatrix":function(e,t){return l(t,e,f,!0)},"Array, any":function(e,t){return l(i(e),t,f,!1).valueOf()},"any, Array":function(e,t){return l(i(t),e,f,!0).valueOf()}});function f(e,t){return!n(e,t)}})),Ys=((0,i.d5)($s,["typed","equalScalar"],(e=>{var{typed:t,equalScalar:r}=e;return t($s,{"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)}})})),["smaller","DenseMatrix"]),Xs=(0,i.d5)("ImmutableDenseMatrix",Ys,(e=>{var{smaller:t,DenseMatrix:r}=e;function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!(0,c.HD)(t))throw new Error("Invalid datatype: "+t);if((0,c.SW)(e)||(0,c.kJ)(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&&(0,c.kJ)(e.data)&&(0,c.kJ)(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 ("+(0,c.kM)(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(0,c.SW)(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:(0,Xe.d9)(this._data),size:(0,Xe.d9)(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}),Qs=["smaller","larger"],Ks=(0,i.d5)("FibonacciHeap",Qs,(e=>{var{smaller:t,larger:r}=e,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}function o(e,t){var r=t.parent;r&&(t.mark?(a(e,t,r),o(r)):t.mark=!0)}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,o=e.child;a>0;){var u=o.right;o.left.right=o.right,o.right.left=o.left,o.left=i,o.right=i.right,i.right=o,o.right.left=o,o.parent=null,o=u,a--}return e.left.right=e.right,e.right.left=e.left,i=e===e.right?null:function(e,i){var a,o=Math.floor(Math.log(i)*n)+1,u=new Array(o),c=0,l=e;if(l)for(c++,l=l.right;l!==e;)c++,l=l.right;for(;c>0;){for(var f=l.degree,p=l.right;a=u[f];){if(r(l.key,a.key)){var d=a;a=l,l=d}s(a,l),u[f]=null,f++}u[f]=l,l=p,c--}e=null;for(var h=0;h<o;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=-1;var i=r.parent;return i&&t(r.key,i.key)&&(a(e,r,i),o(e,i)),t(r.key,e.key)&&(e=r),e}(this._minimum,e),this.extractMinimum()};var s=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}),eu="sparse",tu=["typed","SparseMatrix"],ru=(0,i.d5)(eu,tu,(e=>{var{typed:t,SparseMatrix:r}=e;return t(eu,{"":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)}})})),nu="acoth",iu=["typed","config","Complex","BigNumber"],au=(0,i.d5)(nu,iu,(e=>{var{typed:t,config:r,Complex:n,BigNumber:i}=e;return t(nu,{number:function(e){return e>=1||e<=-1||r.predictable?Pn(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(0,ut.Fh)(e,this)}})})),ou=["typed","equalScalar"],su=(0,i.d5)("algorithm09",ou,(e=>{var{typed:t,equalScalar:r}=e;return function(e,n,i){var a=e._values,o=e._index,s=e._ptr,u=e._size,c=e._datatype,l=n._values,f=n._index,p=n._ptr,d=n._size,h=n._datatype;if(u.length!==d.length)throw new Qe.m(u.length,d.length);if(u[0]!==d[0]||u[1]!==d[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+d+")");var m,v=u[0],y=u[1],g=r,x=0,b=i;"string"==typeof c&&c===h&&(m=c,g=t.find(r,[m,m]),x=t.convert(0,m),b=t.find(i,[m,m]));var w,_,N,E,M,S=a&&l?[]:void 0,A=[],O=[],k=S?[]:void 0,T=[];for(_=0;_<y;_++){O[_]=A.length;var C=_+1;if(k)for(E=p[_],M=p[_+1],N=E;N<M;N++)T[w=f[N]]=C,k[w]=l[N];for(E=s[_],M=s[_+1],N=E;N<M;N++)if(w=o[N],k){var I=T[w]===C?k[w]:x,D=b(a[N],I);g(D,x)||(A.push(w),S.push(D))}else A.push(w)}return O[y]=A.length,e.createSparseMatrix({values:S,index:A,ptr:O,size:[v,y],datatype:m})}})),uu="atan2",cu=["typed","matrix","equalScalar","BigNumber","DenseMatrix"],lu=(0,i.d5)(uu,cu,(e=>{var{typed:t,matrix:r,equalScalar:n,BigNumber:i,DenseMatrix:a}=e,o=Mo({typed:t,equalScalar:n}),s=Ao({typed:t}),u=su({typed:t,equalScalar:n}),c=Co({typed:t,equalScalar:n}),l=Do({typed:t,DenseMatrix:a}),f=xo({typed:t}),p=wo({typed:t});return t(uu,{"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 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, 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 l(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()}})})),fu=["typed","BigNumber"],pu=(0,i.d5)("sec",fu,(e=>{var{typed:t,BigNumber:r}=e;return t("sec",{number:Qn,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(0,ut.Fh)(e,this)}})})),du=["typed","matrix","addScalar","equalScalar","DenseMatrix","SparseMatrix"],hu=(0,i.d5)("add",du,(e=>{var{typed:t,matrix:r,addScalar:n,equalScalar:i,DenseMatrix:a,SparseMatrix:o}=e,s=po({typed:t}),u=mo({typed:t,equalScalar:i}),c=yo({typed:t,DenseMatrix:a}),l=xo({typed:t}),f=wo({typed:t});return t("add",(0,Xe.l7)({"DenseMatrix, DenseMatrix":function(e,t){return l(e,t,n)},"DenseMatrix, SparseMatrix":function(e,t){return s(e,t,n,!1)},"SparseMatrix, DenseMatrix":function(e,t){return s(t,e,n,!0)},"SparseMatrix, SparseMatrix":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))},"DenseMatrix, any":function(e,t){return f(e,t,n,!1)},"SparseMatrix, any":function(e,t){return c(e,t,n,!1)},"any, DenseMatrix":function(e,t){return f(t,e,n,!0)},"any, SparseMatrix":function(e,t){return c(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))})),mu=["typed","addScalar","multiplyScalar","conj","size"],vu=(0,i.d5)("dot",mu,(e=>{var{typed:t,addScalar:r,multiplyScalar:n,conj:i,size:a}=e;return t("dot",{"Array | DenseMatrix, Array | DenseMatrix":function(e,a){var u=o(e,a),l=(0,c.SW)(e)?e._data:e,f=(0,c.SW)(e)?e._datatype:void 0,p=(0,c.SW)(a)?a._data:a,d=(0,c.SW)(a)?a._datatype:void 0,h=2===s(e).length,m=2===s(a).length,v=r,y=n;if(f&&d&&f===d&&"string"==typeof f){var g=f;v=t.find(r,[g,g]),y=t.find(n,[g,g])}if(!h&&!m){for(var x=y(i(l[0]),p[0]),b=1;b<u;b++)x=v(x,y(i(l[b]),p[b]));return x}if(!h&&m){for(var w=y(i(l[0]),p[0][0]),_=1;_<u;_++)w=v(w,y(i(l[_]),p[_][0]));return w}if(h&&!m){for(var N=y(i(l[0][0]),p[0]),E=1;E<u;E++)N=v(N,y(i(l[E][0]),p[E]));return N}if(h&&m){for(var M=y(i(l[0][0]),p[0][0]),S=1;S<u;S++)M=v(M,y(i(l[S][0]),p[S][0]));return M}},"SparseMatrix, SparseMatrix":function(e,t){o(e,t);for(var i=e._index,a=e._values,s=t._index,u=t._values,c=0,l=r,f=n,p=0,d=0;p<i.length&&d<s.length;){var h=i[p],m=s[d];h<m?p++:h>m?d++:h===m&&(c=l(c,f(a[p],u[d])),p++,d++)}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(0,c.SW)(e)?e.size():a(e)}})),yu="composition",gu=["typed","addScalar","combinations","isNegative","isPositive","isInteger","larger"],xu=(0,i.d5)(yu,gu,(e=>{var{typed:t,addScalar:r,combinations:n,isPositive:i,isNegative:a,isInteger:o,larger:s}=e;return t(yu,{"number | BigNumber, number | BigNumber":function(e,t){if(!(o(e)&&i(e)&&o(t)&&i(t)))throw new TypeError("Positive integer value expected in function composition");if(s(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))}})})),bu="isZero",wu=["typed"],_u=(0,i.d5)(bu,wu,(e=>{var{typed:t}=e;return t(bu,{number:gt,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(0,ut.Fh)(e,this)}})})),Nu=["typed"],Eu=(0,i.d5)("abs",Nu,(e=>{var{typed:t}=e;return t("abs",{number:Lt,Complex:function(e){return e.abs()},BigNumber:function(e){return e.abs()},Fraction:function(e){return e.abs()},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},Unit:function(e){return e.abs()}})})),Mu=["typed","config","round","matrix","equalScalar"],Su=(0,i.d5)("floor",Mu,(e=>{var{typed:t,config:r,round:n,matrix:i,equalScalar:a}=e,o=Co({typed:t,equalScalar:a}),s=wo({typed:t});return t("floor",{number:function(e){return(0,u.RI)(e,n(e),r.epsilon)?n(e):Math.floor(e)},"number, number":function(e,t){if((0,u.RI)(e,n(e,t),r.epsilon))return n(e,t);var[i,a]="".concat(e,"e").split("e"),o=Math.floor(Number("".concat(i,"e").concat(Number(a)+t)));return[i,a]="".concat(o,"e").split("e"),Number("".concat(i,"e").concat(Number(a)-t))},Complex:function(e){return e.floor()},"Complex, number":function(e,t){return e.floor(t)},BigNumber:function(e){return St(e,n(e),r.epsilon)?n(e):e.floor()},"BigNumber, BigNumber":function(e,t){return St(e,n(e,t),r.epsilon)?n(e,t):e.toDecimalPlaces(t.toNumber(),P.ROUND_FLOOR)},Fraction:function(e){return e.floor()},"Fraction, number":function(e,t){return e.floor(t)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},"Array | Matrix, number":function(e,t){return(0,ut.Fh)(e,(e=>this(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()}})})),Au="multiply",Ou=["typed","matrix","addScalar","multiplyScalar","equalScalar","dot"],ku=(0,i.d5)(Au,Ou,(e=>{var{typed:t,matrix:r,addScalar:n,multiplyScalar:i,equalScalar:a,dot:o}=e,s=Co({typed:t,equalScalar:a}),u=wo({typed:t});function l(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)")}}var f=t("_multiplyMatrixVector",{"DenseMatrix, any":function(e,r){var a,o=e._data,s=e._size,u=e._datatype,c=r._data,l=r._datatype,f=s[0],p=s[1],d=n,h=i;u&&l&&u===l&&"string"==typeof u&&(a=u,d=t.find(n,[a,a]),h=t.find(i,[a,a]));for(var m=[],v=0;v<f;v++){for(var y=o[v],g=h(y[0],c[0]),x=1;x<p;x++)g=d(g,h(y[x],c[x]));m[v]=g}return e.createDenseMatrix({data:m,size:[f],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 l,f=r._data,p=r._datatype,d=e._size[0],h=r._size[0],m=[],v=[],y=[],g=n,x=i,b=a,w=0;c&&p&&c===p&&"string"==typeof c&&(l=c,g=t.find(n,[l,l]),x=t.find(i,[l,l]),b=t.find(a,[l,l]),w=t.convert(0,l));var _=[],N=[];y[0]=0;for(var E=0;E<h;E++){var M=f[E];if(!b(M,w))for(var S=u[E],A=u[E+1],O=S;O<A;O++){var k=s[O];N[k]?_[k]=g(_[k],x(M,o[O])):(N[k]=!0,v.push(k),_[k]=x(M,o[O]))}}for(var T=v.length,C=0;C<T;C++){var I=v[C];m[C]=_[I]}return y[1]=v.length,e.createSparseMatrix({values:m,index:v,ptr:y,size:[d,1],datatype:l})}}),p=t("_multiplyMatrixMatrix",{"DenseMatrix, DenseMatrix":function(e,r){var a,o=e._data,s=e._size,u=e._datatype,c=r._data,l=r._size,f=r._datatype,p=s[0],d=s[1],h=l[1],m=n,v=i;u&&f&&u===f&&"string"==typeof u&&(a=u,m=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]),_=1;_<d;_++)w=m(w,v(x[_],c[_][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,l=r._index,f=r._ptr,p=r._size,d=r._datatype;if(!c)throw new Error("Cannot multiply Dense Matrix times Pattern only Matrix");var h,m=s[0],v=p[1],y=n,g=i,x=a,b=0;u&&d&&u===d&&"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=[],E=r.createSparseMatrix({values:w,index:_,ptr:N,size:[m,v],datatype:h}),M=0;M<v;M++){N[M]=_.length;var S=f[M],A=f[M+1];if(A>S)for(var O=0,k=0;k<m;k++){for(var T=k+1,C=void 0,I=S;I<A;I++){var D=l[I];O!==T?(C=g(o[k][D],c[I]),O=T):C=y(C,g(o[k][D],c[I]))}O!==T||x(C,b)||(_.push(k),w.push(C))}}return N[v]=_.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 l,f=r._data,p=r._datatype,d=e._size[0],h=r._size[0],m=r._size[1],v=n,y=i,g=a,x=0;c&&p&&c===p&&"string"==typeof c&&(l=c,v=t.find(n,[l,l]),y=t.find(i,[l,l]),g=t.find(a,[l,l]),x=t.convert(0,l));for(var b=[],w=[],_=[],N=e.createSparseMatrix({values:b,index:w,ptr:_,size:[d,m],datatype:l}),E=[],M=[],S=0;S<m;S++){_[S]=w.length;for(var A=S+1,O=0;O<h;O++){var k=f[O][S];if(!g(k,x))for(var T=u[O],C=u[O+1],I=T;I<C;I++){var D=s[I];M[D]!==A?(M[D]=A,w.push(D),E[D]=y(k,o[I])):E[D]=v(E[D],y(k,o[I]))}}for(var z=_[S],B=w.length,j=z;j<B;j++){var U=w[j];b[j]=E[U]}}return _[m]=w.length,N},"SparseMatrix, SparseMatrix":function(e,r){var a,o=e._values,s=e._index,u=e._ptr,c=e._datatype,l=r._values,f=r._index,p=r._ptr,d=r._datatype,h=e._size[0],m=r._size[1],v=o&&l,y=n,g=i;c&&d&&c===d&&"string"==typeof c&&(a=c,y=t.find(n,[a,a]),g=t.find(i,[a,a]));for(var x,b,w,_,N,E,M,S,A=v?[]:void 0,O=[],k=[],T=e.createSparseMatrix({values:A,index:O,ptr:k,size:[h,m],datatype:a}),C=v?[]:void 0,I=[],D=0;D<m;D++){k[D]=O.length;var z=D+1;for(N=p[D],E=p[D+1],_=N;_<E;_++)if(S=f[_],v)for(b=u[S],w=u[S+1],x=b;x<w;x++)I[M=s[x]]!==z?(I[M]=z,O.push(M),C[M]=g(l[_],o[x])):C[M]=y(C[M],g(l[_],o[x]));else for(b=u[S],w=u[S+1],x=b;x<w;x++)I[M=s[x]]!==z&&(I[M]=z,O.push(M));if(v)for(var B=k[D],j=O.length,U=B;U<j;U++){var R=O[U];A[U]=C[R]}}return k[m]=O.length,T}});return t(Au,(0,Xe.l7)({"Array, Array":function(e,t){l((0,Je.aJ)(e),(0,Je.aJ)(t));var n=this(r(e),r(t));return(0,c.SW)(n)?n.valueOf():n},"Matrix, Matrix":function(e,r){var a=e.size(),s=r.size();return l(a,s),1===a.length?1===s.length?function(e,t,r){if(0===r)throw new Error("Cannot multiply two empty vectors");return o(e,t)}(e,r,a[0]):function(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,l=r._size,f=r._datatype,p=s[0],d=l[1],h=n,m=i;u&&f&&u===f&&"string"==typeof u&&(a=u,h=t.find(n,[a,a]),m=t.find(i,[a,a]));for(var v=[],y=0;y<d;y++){for(var g=m(o[0],c[0][y]),x=1;x<p;x++)g=h(g,m(o[x],c[x][y]));v[y]=g}return e.createDenseMatrix({data:v,size:[d],datatype:a})}(e,r)}(e,r):1===s.length?f(e,r):p(e,r)},"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))})),Tu="dotMultiply",Cu=["typed","matrix","equalScalar","multiplyScalar"],Iu=(0,i.d5)(Tu,Cu,(e=>{var{typed:t,matrix:r,equalScalar:n,multiplyScalar:i}=e,a=Mo({typed:t,equalScalar:n}),o=su({typed:t,equalScalar:n}),s=Co({typed:t,equalScalar:n}),u=xo({typed:t}),c=wo({typed:t});return t(Tu,{"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()}})})),Du=["typed"],zu=(0,i.d5)("re",Du,(e=>{var{typed:t}=e;return t("re",{number:function(e){return e},BigNumber:function(e){return e},Complex:function(e){return e.re},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}})})),Bu="flatten",ju=["typed","matrix"],Uu=(0,i.d5)(Bu,ju,(e=>{var{typed:t,matrix:r}=e;return t(Bu,{Array:function(e){return(0,Je.xH)((0,Xe.d9)(e))},Matrix:function(e){var t=(0,Je.xH)((0,Xe.d9)(e.toArray()));return r(t)}})}));function Ru(e,t,r,n){if(!(this instanceof Ru))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}Ru.prototype=new Error,Ru.prototype.constructor=Error,Ru.prototype.name="ArgumentsError",Ru.prototype.isArgumentsError=!0;var qu=["config","matrix"],Fu=(0,i.d5)("resize",qu,(e=>{var{config:t,matrix:r}=e;return function(e,i,a){if(2!==arguments.length&&3!==arguments.length)throw new Ru("resize",arguments.length,2,3);if((0,c.SW)(i)&&(i=i.valueOf()),(0,c.l9)(i[0])&&(i=i.map((function(e){return(0,c.l9)(e)?e.toNumber():e}))),(0,c.SW)(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(0,Xe.d9)(e)}Array.isArray(e)||(e=[e]),e=(0,Xe.d9)(e);var s=(0,Je.SI)(e,i,a);return o?r(s):s};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 Qe.m(t.length,1);var n=t[0];if("number"!=typeof n||!(0,u.U)(n))throw new TypeError("Invalid size, must contain positive integers (size: "+(0,Ye.WU)(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}})),Pu="squeeze",Lu=["typed","matrix"],Hu=(0,i.d5)(Pu,Lu,(e=>{var{typed:t,matrix:r}=e;return t(Pu,{Array:function(e){return(0,Je.L9)((0,Xe.d9)(e))},Matrix:function(e){var t=(0,Je.L9)(e.toArray());return Array.isArray(t)?r(t):t},any:function(e){return(0,Xe.d9)(e)}})})),Gu=["typed","matrix"],Zu=(0,i.d5)("to",Gu,(e=>{var{typed:t,matrix:r}=e,n=xo({typed:t}),i=wo({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()}})})),Wu=["typed","config","identity","multiply","matrix","fraction","number","Complex"],$u=(0,i.d5)("pow",Wu,(e=>{var{typed:t,config:r,identity:n,multiply:i,matrix:a,number:o,fraction:s,Complex:c}=e;return t("pow",{"number, number":l,"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 c(e.toNumber(),0).pow(t.toNumber(),0)},"Fraction, Fraction":function(e,t){if(1!==t.d){if(r.predictable)throw new Error("Function pow does not support non-integer exponents for fractions.");return l(e.valueOf(),t.valueOf())}return e.pow(t)},"Array, number":f,"Array, BigNumber":function(e,t){return f(e,t.toNumber())},"Matrix, number":p,"Matrix, BigNumber":function(e,t){return p(e,t.toNumber())},"Unit, number | BigNumber":function(e,t){return e.pow(t)}});function l(e,t){if(r.predictable&&!(0,u.U)(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:(0,u.U)(t)||e>=0||r.predictable?ur(e,t):e*e<1&&t===1/0||e*e>1&&t===-1/0?0:new c(e,0).pow(t,0)}function f(e,t){if(!(0,u.U)(t)||t<0)throw new TypeError("For A^b, b must be a positive integer (value is "+t+")");var r=(0,Je.aJ)(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 p(e,t){return a(f(e.valueOf(),t))}})),Vu="dotPow",Ju=["typed","equalScalar","matrix","pow","DenseMatrix"],Yu=(0,i.d5)(Vu,Ju,(e=>{var{typed:t,equalScalar:r,matrix:n,pow:i,DenseMatrix:a}=e,o=Ao({typed:t}),s=Vo({typed:t,DenseMatrix:a}),u=Co({typed:t,equalScalar:r}),c=Do({typed:t,DenseMatrix:a}),l=xo({typed:t}),f=wo({typed:t});return t(Vu,{"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 l(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 f(e,t,this,!1)},"any, SparseMatrix":function(e,t){return c(t,e,this,!0)},"any, DenseMatrix":function(e,t){return f(t,e,this,!0)},"Array, any":function(e,t){return f(n(e),t,this,!1).valueOf()},"any, Array":function(e,t){return f(n(t),e,this,!0).valueOf()}})})),Xu="rightArithShift",Qu=["typed","matrix","equalScalar","zeros","DenseMatrix"],Ku=(0,i.d5)(Xu,Qu,(e=>{var{typed:t,matrix:r,equalScalar:n,zeros:i,DenseMatrix:a}=e,o=po({typed:t}),s=Mo({typed:t,equalScalar:n}),u=Os({typed:t,equalScalar:n}),c=yo({typed:t,DenseMatrix:a}),l=Co({typed:t,equalScalar:n}),f=xo({typed:t}),p=wo({typed:t});return t(Xu,{"number, number":Gr,"BigNumber, BigNumber":Ur,"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 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, number | BigNumber":function(e,t){return n(t,0)?e.clone():l(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()}})})),ec=r(3228),tc="compareNatural",rc=["typed","compare"],nc=(0,i.d5)(tc,rc,(e=>{var{typed:t,compare:r}=e,n=r.signatures["boolean,boolean"];return t(tc,{"any, any":function(e,t){var o,s=(0,c.kM)(e),u=(0,c.kM)(t);if(!("number"!==s&&"BigNumber"!==s&&"Fraction"!==s||"number"!==u&&"BigNumber"!==u&&"Fraction"!==u))return"0"!==(o=r(e,t)).toString()?o>0?1:-1:ec(s,u);if("Array"===s||"Matrix"===s||"Array"===u||"Matrix"===u)return 0!==(o=i(this,e,t))?o:ec(s,u);if(s!==u)return ec(s,u);if("Complex"===s)return 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}(e,t);if("Unit"===s)return e.equalBase(t)?this(e.value,t.value):a(this,e.formatUnits(),t.formatUnits());if("boolean"===s)return n(e,t);if("string"===s)return ec(e,t);if("Object"===s)return function(e,t,r){var n=Object.keys(t),i=Object.keys(r);n.sort(ec),i.sort(ec);var o=a(e,n,i);if(0!==o)return o;for(var s=0;s<n.length;s++){var u=e(t[n[s]],r[i[s]]);if(0!==u)return u}return 0}(this,e,t);if("null"===s)return 0;if("undefined"===s)return 0;throw new TypeError('Unsupported type of value "'+s+'"')}});function i(e,t,r){return(0,c.sA)(t)&&(0,c.sA)(r)?a(e,t.toJSON().values,r.toJSON().values):(0,c.sA)(t)?i(e,t.toArray(),r):(0,c.sA)(r)?i(e,t,r.toArray()):(0,c.jH)(t)?i(e,t.toJSON().data,r):(0,c.jH)(r)?i(e,t,r.toJSON().data):Array.isArray(t)?Array.isArray(r)?a(e,t,r):i(e,t,[r]):i(e,[t],r)}function a(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}})),ic="equalText",ac=["typed","compareText","isZero"],oc=(0,i.d5)(ic,ac,(e=>{var{typed:t,compareText:r,isZero:n}=e;return t(ic,{"any, any":function(e,t){return n(r(e,t))}})})),sc="largerEq",uc=["typed","config","matrix","DenseMatrix"],cc=(0,i.d5)(sc,uc,(e=>{var{typed:t,config:r,matrix:n,DenseMatrix:i}=e,a=Ao({typed:t}),o=Vo({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),c=xo({typed:t}),l=wo({typed:t});return t(sc,{"boolean, boolean":function(e,t){return e>=t},"number, number":function(e,t){return e>=t||(0,u.RI)(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gte(t)||St(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 c(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 l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(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()}})})),lc="partitionSelect",fc=["typed","isNumeric","isNaN","compare"],pc=(0,i.d5)(lc,fc,(e=>{var{typed:t,isNumeric:r,isNaN:n,compare:i}=e,a=i,o=(e,t)=>-i(e,t);return t(lc,{"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(!(0,u.U)(t)||t<0)throw new Error("k must be a non-negative integer");if((0,c.SW)(e)){if(e.size().length>1)throw new Error("Only one dimensional matrices supported");return l(e.valueOf(),t,r)}if(Array.isArray(e))return l(e,t,r)}function l(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,l=e[Math.floor(Math.random()*(s-o+1))+o];u<c;)if(i(e[u],l)>=0){var f=e[c];e[c]=e[u],e[u]=f,--c}else++u;i(e[u],l)>0&&--u,t<=u?s=u:o=u+1}return e[t]}})),dc=["ImmutableDenseMatrix"],hc=(0,i.d5)("Index",dc,(e=>{var{ImmutableDenseMatrix:t}=e;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((0,c.bR)(a))this._dimensions.push(a),this._isScalar=!1;else if(Array.isArray(a)||(0,c.SW)(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]||!(0,u.U)(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=(0,Xe.d9)(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}),mc="asech",vc=["typed","config","Complex","BigNumber"],yc=(0,i.d5)(mc,vc,(e=>{var{typed:t,config:r,Complex:n,BigNumber:i}=e;return t(mc,{number:function(e){if(e<=1&&e>=-1||r.predictable){var t=1/e;if(t>0||r.predictable)return Zn(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(0,ut.Fh)(e,this)}})})),gc=["typed"],xc=(0,i.d5)("tan",gc,(e=>{var{typed:t}=e;return t("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(0,ut.Fh)(e,this,!0)}})})),bc="setDifference",wc=["typed","size","subset","compareNatural","Index","DenseMatrix"],_c=(0,i.d5)(bc,wc,(e=>{var{typed:t,size:r,subset:n,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(bc,{"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(0,Je.xH)(e.toArray());var u,c=(0,Je.yV)((0,Je.xH)(Array.isArray(e)?e:e.toArray()).sort(i)),l=(0,Je.yV)((0,Je.xH)(Array.isArray(t)?t:t.toArray()).sort(i));s=[];for(var f=0;f<c.length;f++){u=!1;for(var p=0;p<l.length;p++)if(0===i(c[f].value,l[p].value)&&c[f].identifier===l[p].identifier){u=!0;break}u||s.push(c[f])}}return Array.isArray(e)&&Array.isArray(t)?(0,Je.D$)(s):new o((0,Je.D$)(s))}})})),Nc="setIntersect",Ec=["typed","size","subset","compareNatural","Index","DenseMatrix"],Mc=(0,i.d5)(Nc,Ec,(e=>{var{typed:t,size:r,subset:n,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(Nc,{"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=(0,Je.yV)((0,Je.xH)(Array.isArray(e)?e:e.toArray()).sort(i)),c=(0,Je.yV)((0,Je.xH)(Array.isArray(t)?t:t.toArray()).sort(i));s=[];for(var l=0;l<u.length;l++)for(var f=0;f<c.length;f++)if(0===i(u[l].value,c[f].value)&&u[l].identifier===c[f].identifier){s.push(u[l]);break}}return Array.isArray(e)&&Array.isArray(t)?(0,Je.D$)(s):new o((0,Je.D$)(s))}})})),Sc="setMultiplicity",Ac=["typed","size","subset","compareNatural","Index"],Oc=(0,i.d5)(Sc,Ac,(e=>{var{typed:t,size:r,subset:n,compareNatural:i,Index:a}=e;return t(Sc,{"number | BigNumber | Fraction | Complex, Array | Matrix":function(e,t){if(0===n(r(t),new a(0)))return 0;for(var o=(0,Je.xH)(Array.isArray(t)?t:t.toArray()),s=0,u=0;u<o.length;u++)0===i(o[u],e)&&s++;return s}})})),kc="setSize",Tc=["typed","compareNatural"],Cc=(0,i.d5)(kc,Tc,(e=>{var{typed:t,compareNatural:r}=e;return t(kc,{"Array | Matrix":function(e){return Array.isArray(e)?(0,Je.xH)(e).length:(0,Je.xH)(e.toArray()).length},"Array | Matrix, boolean":function(e,t){if(!1===t||0===e.length)return Array.isArray(e)?(0,Je.xH)(e).length:(0,Je.xH)(e.toArray()).length;for(var n=(0,Je.xH)(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}})})),Ic=["typed","matrix","add"],Dc=(0,i.d5)("trace",Ic,(e=>{var{typed:t,matrix:r,add:n}=e;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 l=i[c],f=i[c+1],p=l;p<f;p++){var d=r[p];if(d===c){u=n(u,t[p]);break}if(d>c)break}return u}throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(a)+")")},DenseMatrix:i,any:Xe.d9});function i(e){var t=e._size,r=e._data;switch(t.length){case 1:if(1===t[0])return(0,Xe.d9)(r[0]);throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(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: "+(0,Ye.WU)(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+(0,Ye.WU)(t)+")")}}})),zc=["typed","add","multiply","partitionSelect","compare"],Bc=(0,i.d5)("quantileSeq",zc,(e=>{var{typed:t,add:r,multiply:n,partitionSelect:i,compare:a}=e;function o(e,t,o){var u=(0,Je.xH)(e),l=u.length;if(0===l)throw new Error("Cannot calculate quantile of an empty sequence");if((0,c.hj)(t)){var f=t*(l-1),p=f%1;if(0===p){var d=o?u[f]:i(u,f);return s(d),d}var h,m,v=Math.floor(f);if(o)h=u[v],m=u[v+1];else{m=i(u,v+1),h=u[v];for(var y=0;y<v;++y)a(u[y],h)>0&&(h=u[y])}return s(h),s(m),r(n(h,1-p),n(m,p))}var g=t.times(l-1);if(g.isInteger()){g=g.toNumber();var x=o?u[g]:i(u,g);return s(x),x}var b,w,_=g.floor(),N=g.minus(_),E=_.toNumber();if(o)b=u[E],w=u[E+1];else{w=i(u,E+1),b=u[E];for(var M=0;M<E;++M)a(u[M],b)>0&&(b=u[M])}s(b),s(w);var S=new N.constructor(1);return r(n(b,S.minus(N)),n(w,N))}var s=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((0,c.uZ)(e)){if("boolean"==typeof(r=r||!1)){if(i=e.valueOf(),(0,c.hj)(t)){if(t<0)throw new Error("N/prob must be non-negative");if(t<=1)return o(i,t,r);if(t>1){if(!(0,u.U)(t))throw new Error("N must be a positive integer");var s=t+1;n=new Array(t);for(var l=0;l<t;)n[l]=o(i,++l/s,r);return n}}if((0,c.l9)(t)){var f=t.constructor;if(t.isNegative())throw new Error("N/prob must be non-negative");if(a=new f(1),t.lte(a))return new f(o(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 d=new f(p+1);n=new Array(p);for(var h=0;h<p;)n[h]=new f(o(i,new f(++h).div(d),r));return n}}if(Array.isArray(t)){n=new Array(t.length);for(var m=0;m<n.length;++m){var v=t[m];if((0,c.hj)(v)){if(v<0||v>1)throw new Error("Probability must be between 0 and 1, inclusive")}else{if(!(0,c.l9)(v))throw new TypeError("Unexpected type of argument in function quantileSeq");if(a=new v.constructor(1),v.isNegative()||v.gt(a))throw new Error("Probability must be between 0 and 1, inclusive")}n[m]=o(i,v,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")}}));function jc(e){var t;if((0,u.U)(e))return e<=0?isFinite(e)?1/0:NaN:e>171?1/0:Bi(1,e-1);if(e<.5)return Math.PI/(Math.sin(Math.PI*e)*jc(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=Rc[0];for(var o=1;o<Rc.length;++o)t+=Rc[o]/(e+o);var s=e+Uc+.5;return Math.sqrt(2*Math.PI)*Math.pow(s,e+.5)*Math.exp(-s)*t}jc.signature="number";var Uc=4.7421875,Rc=[.9999999999999971,57.15623566586292,-59.59796035547549,14.136097974741746,-.4919138160976202,3399464998481189e-20,4652362892704858e-20,-9837447530487956e-20,.0001580887032249125,-.00021026444172410488,.00021743961811521265,-.0001643181065367639,8441822398385275e-20,-26190838401581408e-21,36899182659531625e-22],qc="gamma",Fc=["typed","config","multiplyScalar","pow","BigNumber","Complex"],Pc=(0,i.d5)(qc,Fc,(e=>{var{typed:t,config:r,multiplyScalar:n,pow:i,BigNumber:a,Complex:o}=e;return t(qc,{number:jc,Complex:function(e){if(0===e.im)return this(e.re);e=new o(e.re-1,e.im);for(var t=new o(Rc[0],0),r=1;r<Rc.length;++r){var a=e.re+r,s=a*a+e.im*e.im;0!==s?(t.re+=Rc[r]*a/s,t.im+=-Rc[r]*e.im/s):t.re=Rc[r]<0?-1/0:1/0}var u=new o(e.re+Uc+.5,e.im),c=Math.sqrt(2*Math.PI);e.re+=.5;var l=i(u,e);0===l.im?l.re*=c:(0===l.re||(l.re*=c),l.im*=c);var f=Math.exp(-u.re);return u.re=f*Math.cos(-u.im),u.im=f*Math.sin(-u.im),n(n(l,u),t)},BigNumber:function(e){if(e.isInteger())return e.isNegative()||e.isZero()?new a(1/0):s(e.minus(1));if(!e.isFinite())return new a(e.isNegative()?NaN:1/0);throw new Error("Integer BigNumber expected")},"Array | Matrix":function(e){return(0,ut.Fh)(e,this)}});function s(e){if(e<8)return new a([1,1,2,6,24,120,720,5040][e]);var t=r.precision+(0|Math.log(e.toNumber())),n=a.clone({precision:t});if(e%2==1)return e.times(s(new a(e-1)));for(var i=e,o=new n(e),u=e.toNumber();i>2;)u+=i-=2,o=o.times(u);return new a(o.toPrecision(a.precision))}})),Lc=["typed","BigNumber"],Hc=(0,i.d5)("bignumber",Lc,(e=>{var{typed:t,BigNumber:r}=e;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(0,ut.Fh)(e,this)}})})),Gc=["typed","matrix","equalScalar"],Zc=(0,i.d5)("lcm",Gc,(e=>{var{typed:t,matrix:r,equalScalar:n}=e,i=Mo({typed:t,equalScalar:n}),a=Uo({typed:t,equalScalar:n}),o=Co({typed:t,equalScalar:n}),s=xo({typed:t}),u=wo({typed:t});return t("lcm",{"number, number":Kt,"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;for(var r=e.times(t);!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}})})),Wc="bitOr",$c=["typed","matrix","equalScalar","DenseMatrix"],Vc=(0,i.d5)(Wc,$c,(e=>{var{typed:t,matrix:r,equalScalar:n,DenseMatrix:i}=e,a=po({typed:t}),o=mo({typed:t,equalScalar:n}),s=yo({typed:t,DenseMatrix:i}),u=xo({typed:t}),c=wo({typed:t});return t(Wc,{"number, number":Pr,"BigNumber, BigNumber":Ir,"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()}})})),Jc="kron",Yc=["typed","matrix","multiplyScalar"],Xc=(0,i.d5)(Jc,Yc,(e=>{var{typed:t,matrix:r,multiplyScalar:n}=e;return t(Jc,{"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===(0,Je.aJ)(e).length&&(e=[e]),1===(0,Je.aJ)(t).length&&(t=[t]),(0,Je.aJ)(e).length>2||(0,Je.aJ)(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}})),Qc=["typed","matrix"],Kc=(0,i.d5)("transpose",Qc,(e=>{var{typed:t,matrix:r}=e;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: "+(0,Ye.WU)(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]=(0,Xe.d9)(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,l=[],f=[],p=[],d=0;d<t;d++)p[d]=0;for(n=0,i=s.length;n<i;n++)p[s[n]]++;for(var h=0,m=0;m<t;m++)f.push(h),h+=p[m],p[m]=f[m];for(f.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]]++;l[x]=a,o&&(c[x]=(0,Xe.d9)(o[g]))}return e.createSparseMatrix({values:c,index:l,ptr:f,size:[r,t],datatype:e._datatype})}(e,n,i)}break;default:throw new RangeError("Matrix must be a vector or two dimensional (size: "+(0,Ye.WU)(this._size)+")")}return t},any:function(e){return(0,Xe.d9)(e)}})})),el=["number","?bignumber","?fraction"],tl=(0,i.d5)("numeric",el,(e=>{var{number:t,bignumber:r,fraction:n}=e,i={string:!0,number:!0,BigNumber:!0,Fraction:!0},a={number:e=>t(e),BigNumber:r?e=>r(e):fs.R3,Fraction:n?e=>n(e):fs.nG};return function(e,t){var r=(0,c.kM)(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)}})),rl=["typed","matrix","equalScalar","zeros","not"],nl=(0,i.d5)("and",rl,(e=>{var{typed:t,matrix:r,equalScalar:n,zeros:i,not:a}=e,o=Mo({typed:t,equalScalar:n}),s=Uo({typed:t,equalScalar:n}),u=Co({typed:t,equalScalar:n}),c=xo({typed:t}),l=wo({typed:t});return t("and",{"number, number":nn,"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()):l(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()):l(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()}})})),il="smallerEq",al=["typed","config","matrix","DenseMatrix"],ol=(0,i.d5)(il,al,(e=>{var{typed:t,config:r,matrix:n,DenseMatrix:i}=e,a=Ao({typed:t}),o=Vo({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),c=xo({typed:t}),l=wo({typed:t});return t(il,{"boolean, boolean":function(e,t){return e<=t},"number, number":function(e,t){return e<=t||(0,u.RI)(e,t,r.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lte(t)||St(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 c(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 l(e,t,this,!1)},"any, SparseMatrix":function(e,t){return s(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()}})})),sl="sort",ul=["typed","matrix","compare","compareNatural"],cl=(0,i.d5)(sl,ul,(e=>{var{typed:t,matrix:r,compare:n,compareNatural:i}=e,a=n,o=(e,t)=>-n(e,t);return t(sl,{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!==(0,Je.aJ)(e).length)throw new Error("One dimensional array expected")}function c(e){if(1!==e.size().length)throw new Error("One dimensional matrix expected")}})),ll=["typed","BigNumber"],fl=(0,i.d5)("cot",ll,(e=>{var{typed:t,BigNumber:r}=e;return t("cot",{number:Vn,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(0,ut.Fh)(e,this)}})})),pl="setDistinct",dl=["typed","size","subset","compareNatural","Index","DenseMatrix"],hl=(0,i.d5)(pl,dl,(e=>{var{typed:t,size:r,subset:n,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(pl,{"Array | Matrix":function(e){var t;if(0===n(r(e),new a(0)))t=[];else{var s=(0,Je.xH)(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)}})})),ml="setPowerset",vl=["typed","size","subset","compareNatural","Index"],yl=(0,i.d5)(ml,vl,(e=>{var{typed:t,size:r,subset:n,compareNatural:i,Index:a}=e;return t(ml,{"Array | Matrix":function(e){if(0===n(r(e),new a(0)))return[];for(var t=(0,Je.xH)(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}})),gl="index",xl=["typed","Index"],bl=(0,i.d5)(gl,xl,(e=>{var{typed:t,Index:r}=e;return t(gl,{"...number | string | BigNumber | Range | Array | Matrix":function(e){var t=e.map((function(e){return(0,c.l9)(e)?e.toNumber():Array.isArray(e)||(0,c.SW)(e)?e.map((function(e){return(0,c.l9)(e)?e.toNumber():e})):e})),n=new r;return r.apply(n,t),n}})})),wl="factorial",_l=["typed","gamma"],Nl=(0,i.d5)(wl,_l,(e=>{var{typed:t,gamma:r}=e;return t(wl,{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(0,ut.Fh)(e,this)}})})),El="permutations",Ml=["typed","factorial"],Sl=(0,i.d5)(El,Ml,(e=>{var{typed:t,factorial:r}=e;return t(El,{"number | BigNumber":r,"number, number":function(e,t){if(!(0,u.U)(e)||e<0)throw new TypeError("Positive integer value expected in function permutations");if(!(0,u.U)(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 Bi(e-t+1,e)},"BigNumber, BigNumber":function(e,t){var r,n;if(!Al(e)||!Al(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 Al(e){return e.isInteger()&&e.gte(0)}var Ol=["typed","config","round","matrix","equalScalar"],kl=(0,i.d5)("ceil",Ol,(e=>{var{typed:t,config:r,round:n,matrix:i,equalScalar:a}=e,o=Co({typed:t,equalScalar:a}),s=wo({typed:t});return t("ceil",{number:function(e){return(0,u.RI)(e,n(e),r.epsilon)?n(e):Vt(e)},"number, number":function(e,t){if((0,u.RI)(e,n(e,t),r.epsilon))return n(e,t);var[i,a]="".concat(e,"e").split("e"),o=Math.ceil(Number("".concat(i,"e").concat(Number(a)+t)));return[i,a]="".concat(o,"e").split("e"),Number("".concat(i,"e").concat(Number(a)-t))},Complex:function(e){return e.ceil()},"Complex, number":function(e,t){return e.ceil(t)},BigNumber:function(e){return St(e,n(e),r.epsilon)?n(e):e.ceil()},"BigNumber, BigNumber":function(e,t){return St(e,n(e,t),r.epsilon)?n(e,t):e.toDecimalPlaces(t.toNumber(),P.ROUND_CEIL)},Fraction:function(e){return e.ceil()},"Fraction, number":function(e,t){return e.ceil(t)},"Array | Matrix":function(e){return(0,ut.Fh)(e,this,!0)},"Array | Matrix, number":function(e,t){return(0,ut.Fh)(e,(e=>this(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()}})})),Tl="subtract",Cl=["typed","matrix","equalScalar","addScalar","unaryMinus","DenseMatrix"],Il=(0,i.d5)(Tl,Cl,(e=>{var{typed:t,matrix:r,equalScalar:n,addScalar:i,unaryMinus:a,DenseMatrix:o}=e,s=po({typed:t}),u=Ao({typed:t}),c=ko({typed:t,equalScalar:n}),l=yo({typed:t,DenseMatrix:o}),f=xo({typed:t}),p=wo({typed:t});return t(Tl,{"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 Dl(e,t),c(e,t,this)},"SparseMatrix, DenseMatrix":function(e,t){return Dl(e,t),u(t,e,this,!0)},"DenseMatrix, SparseMatrix":function(e,t){return Dl(e,t),s(e,t,this,!1)},"DenseMatrix, DenseMatrix":function(e,t){return Dl(e,t),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 l(e,a(t),i)},"DenseMatrix, any":function(e,t){return p(e,t,this)},"any, SparseMatrix":function(e,t){return l(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 Dl(e,t){var r=e.size(),n=t.size();if(r.length!==n.length)throw new Qe.m(r.length,n.length)}var zl="cross",Bl=["typed","matrix","subtract","multiply"],jl=(0,i.d5)(zl,Bl,(e=>{var{typed:t,matrix:r,subtract:n,multiply:i}=e;return t(zl,{"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((0,Je.aJ)(e).length,(0,Je.aJ)(t).length);e=(0,Je.L9)(e),t=(0,Je.L9)(t);var a=(0,Je.aJ)(e),o=(0,Je.aJ)(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}})),Ul=r(7635),Rl="prod",ql=["typed","config","multiplyScalar","numeric"],Fl=(0,i.d5)(Rl,ql,(e=>{var{typed:t,config:r,multiplyScalar:n,numeric:i}=e;return t(Rl,{"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((0,ut.Et)(e,(function(e){try{t=void 0===t?e:n(t,e)}catch(t){throw(0,Ul.x)(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}})),Pl="equal",Ll=["typed","matrix","equalScalar","DenseMatrix"],Hl=(0,i.d5)(Pl,Ll,(e=>{var{typed:t,matrix:r,equalScalar:n,DenseMatrix:i}=e,a=Ao({typed:t}),o=Vo({typed:t,DenseMatrix:i}),s=Do({typed:t,DenseMatrix:i}),u=xo({typed:t}),c=wo({typed:t});return t(Pl,{"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()}})})),Gl=((0,i.d5)(Pl,["typed","equalScalar"],(e=>{var{typed:t,equalScalar:r}=e;return t(Pl,{"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)}})})),"setCartesian"),Zl=["typed","size","subset","compareNatural","Index","DenseMatrix"],Wl=(0,i.d5)(Gl,Zl,(e=>{var{typed:t,size:r,subset:n,compareNatural:i,Index:a,DenseMatrix:o}=e;return t(Gl,{"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=(0,Je.xH)(Array.isArray(e)?e:e.toArray()).sort(i),c=(0,Je.xH)(Array.isArray(t)?t:t.toArray()).sort(i);s=[];for(var l=0;l<u.length;l++)for(var f=0;f<c.length;f++)s.push([u[l],c[f]])}return Array.isArray(e)&&Array.isArray(t)?s:new o(s)}})})),$l="setSymDifference",Vl=["typed","size","concat","subset","setDifference","Index"],Jl=(0,i.d5)($l,Vl,(e=>{var{typed:t,size:r,concat:n,subset:i,setDifference:a,Index:o}=e;return t($l,{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(r(e),new o(0)))return(0,Je.xH)(t);if(0===i(r(t),new o(0)))return(0,Je.xH)(e);var s=(0,Je.xH)(e),u=(0,Je.xH)(t);return n(a(s,u),a(u,s))}})})),Yl=["typed","Complex","matrix","ceil","floor"],Xl=(0,i.d5)("fix",Yl,(e=>{var{typed:t,Complex:r,matrix:n,ceil:i,floor:a}=e,o=wo({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(0,ut.Fh)(e,this,!0)},"Array | Matrix, number | BigNumber":function(e,t){return(0,ut.Fh)(e,(e=>this(e,t)),!0)},"number | Complex | BigNumber, Array":function(e,t){return o(n(t),e,this,!0).valueOf()}})})),Ql="ctranspose",Kl=["typed","transpose","conj"],ef=(0,i.d5)(Ql,Kl,(e=>{var{typed:t,transpose:r,conj:n}=e;return t(Ql,{any:function(e){return n(r(e))}})})),tf="deepEqual",rf=["typed","equal"],nf=(0,i.d5)(tf,rf,(e=>{var{typed:t,equal:r}=e;return t(tf,{"any, any":function(e,t){return n(e.valueOf(),t.valueOf())}});function n(e,t){if(Array.isArray(e)){if(Array.isArray(t)){var i=e.length;if(i!==t.length)return!1;for(var a=0;a<i;a++)if(!n(e[a],t[a]))return!1;return!0}return!1}return!Array.isArray(t)&&r(e,t)}})),af="setIsSubset",of=["typed","size","subset","compareNatural","Index"],sf=(0,i.d5)(af,of,(e=>{var{typed:t,size:r,subset:n,compareNatural:i,Index:a}=e;return t(af,{"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=(0,Je.yV)((0,Je.xH)(Array.isArray(e)?e:e.toArray()).sort(i)),u=(0,Je.yV)((0,Je.xH)(Array.isArray(t)?t:t.toArray()).sort(i)),c=0;c<s.length;c++){o=!1;for(var l=0;l<u.length;l++)if(0===i(s[c].value,u[l].value)&&s[c].identifier===u[l].identifier){o=!0;break}if(!1===o)return!1}return!0}})})),uf=["typed","matrix","DenseMatrix"],cf=(0,i.d5)("xor",uf,(e=>{var{typed:t,matrix:r,DenseMatrix:n}=e,i=Ao({typed:t}),a=Vo({typed:t,DenseMatrix:n}),o=Do({typed:t,DenseMatrix:n}),s=xo({typed:t}),u=wo({typed:t});return t("xor",{"number, number":rn,"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()}})})),lf="divideScalar",ff=["typed","numeric"],pf=(0,i.d5)(lf,ff,(e=>{var{typed:t,numeric:r}=e;return t(lf,{"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,(0,c.kM)(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,(0,c.kM)(e));return n.value=this(e,null===t.value?t._normalize(i):t.value),n},"Unit, Unit":function(e,t){return e.divide(t)}})})),df="nthRoots",hf=["config","typed","divideScalar","Complex"],mf=(0,i.d5)(df,hf,(e=>{var{typed:t,config:r,divideScalar:n,Complex:i}=e,a=[function(e){return new i(e,0)},function(e){return new i(0,e)},function(e){return new i(-e,0)},function(e){return new i(0,-e)}];function o(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 i(0,0)];var r,n="number"==typeof e;(n||0===e.re||0===e.im)&&(r=n?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),l=0;l<t;l++){var f=(r+4*l)/t;f!==Math.round(f)?u.push(new i({r:c,phi:(o+2*Math.PI*l)/t})):u.push(a[f%4](c))}return u}return t(df,{Complex:function(e){return o(e,2)},"Complex, number":o})}));function vf(e){var{DenseMatrix:t}=e;return function(e,r,n){var i=e.size();if(2!==i.length)throw new RangeError("Matrix must be two dimensional (size: "+(0,Ye.WU)(i)+")");var a=i[0];if(a!==i[1])throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(i)+")");var o=[];if((0,c.SW)(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 l=0;l<a;l++)o[l]=[u[l]];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((0,c.jH)(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((0,c.sA)(r)){for(var p=0;p<a;p++)o[p]=[0];for(var d=r._values,h=r._index,m=r._ptr,v=m[1],y=m[0];y<v;y++)o[h[y]][0]=d[y];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((0,c.kJ)(r)){var g=(0,Je.aJ)(r);if(1===g.length){if(g[0]!==a)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(var x=0;x<a;x++)o[x]=[r[x]];return new t({data:o,size:[a,1]})}if(2===g.length){if(g[0]!==a||1!==g[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(var b=0;b<a;b++)o[b]=[r[b][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 yf="lsolve",gf=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],xf=(0,i.d5)(yf,gf,(e=>{var{typed:t,matrix:r,divideScalar:n,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(yf,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=(t=u(e,t,!0))._data,c=e._size[0],l=e._size[1],f=e._values,p=e._index,d=e._ptr,h=[],m=0;m<l;m++){var v=r[m][0]||0;if(o(v,0))h[m]=[0];else{for(var y=0,g=[],x=[],b=d[m],w=d[m+1],_=b;_<w;_++){var N=p[_];N===m?y=f[_]:N>m&&(g.push(f[_]),x.push(N))}if(o(y,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var E=n(v,y),M=0,S=x.length;M<S;M++){var A=x[M];r[A]=[a(r[A][0]||0,i(E,g[M]))]}h[m]=[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],l=e._size[1],f=[],p=e._data,d=0;d<l;d++){var h=r[d][0]||0,m=void 0;if(o(h,0))m=0;else{var v=p[d][d];if(o(v,0))throw new Error("Linear system cannot be solved since matrix is singular");m=n(h,v);for(var y=d+1;y<c;y++)r[y]=[a(r[y][0]||0,i(m,p[y][d]))]}f[d]=[m]}return new s({data:f,size:[c,1]})}})),bf="lsolveAll",wf=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],_f=(0,i.d5)(bf,wf,(e=>{var{typed:t,matrix:r,divideScalar:n,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(bf,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=[u(e,t,!0)._data.map((e=>e[0]))],c=e._size[0],l=e._size[1],f=e._values,p=e._index,d=e._ptr,h=0;h<l;h++)for(var m=r.length,v=0;v<m;v++){for(var y=r[v],g=[],x=[],b=d[h],w=d[h+1],_=0,N=b;N<w;N++){var E=p[N];E===h?_=f[N]:E>h&&(g.push(f[N]),x.push(E))}if(o(_,0))if(o(y[h],0)){if(0===v){var M=[...y];M[h]=1;for(var S=0,A=x.length;S<A;S++){var O=x[S];M[O]=a(M[O],g[S])}r.push(M)}}else{if(0===v)return[];r.splice(v,1),v-=1,m-=1}else{y[h]=n(y[h],_);for(var k=0,T=x.length;k<T;k++){var C=x[k];y[C]=a(y[C],i(y[h],g[k]))}}}return r.map((e=>new s({data:e.map((e=>[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((e=>e.valueOf()))}});function c(e,t){for(var r=[u(e,t,!0)._data.map((e=>e[0]))],c=e._data,l=e._size[0],f=e._size[1],p=0;p<f;p++)for(var d=r.length,h=0;h<d;h++){var m=r[h];if(o(c[p][p],0))if(o(m[p],0)){if(0===h){var v=[...m];v[p]=1;for(var y=p+1;y<f;y++)v[y]=a(v[y],c[y][p]);r.push(v)}}else{if(0===h)return[];r.splice(h,1),h-=1,d-=1}else{m[p]=n(m[p],c[p][p]);for(var g=p+1;g<f;g++)m[g]=a(m[g],i(m[p],c[g][p]))}}return r.map((e=>new s({data:e.map((e=>[e])),size:[l,1]})))}})),Nf=["addScalar","equalScalar","FibonacciHeap"],Ef=(0,i.d5)("Spa",Nf,(e=>{var{addScalar:t,equalScalar:r,FibonacciHeap:n}=e;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}),Mf="setUnion",Sf=["typed","size","concat","subset","setIntersect","setSymDifference","Index"],Af=(0,i.d5)(Mf,Sf,(e=>{var{typed:t,size:r,concat:n,subset:i,setIntersect:a,setSymDifference:o,Index:s}=e;return t(Mf,{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(r(e),new s(0)))return(0,Je.xH)(t);if(0===i(r(t),new s(0)))return(0,Je.xH)(e);var u=(0,Je.xH)(e),c=(0,Je.xH)(t);return n(o(u,c),a(u,c))}})})),Of=["typed","matrix","abs","addScalar","divideScalar","multiplyScalar","subtract","larger","equalScalar","unaryMinus","DenseMatrix","SparseMatrix","Spa"],kf=(0,i.d5)("lup",Of,(e=>{var{typed:t,matrix:r,abs:n,addScalar:i,divideScalar:a,multiplyScalar:o,subtract:s,larger:u,equalScalar:c,unaryMinus:l,DenseMatrix:f,SparseMatrix:p,Spa:d}=e;return t("lup",{DenseMatrix:function(e){return h(e)},SparseMatrix:function(e){return function(e){var t,r,i,s=e._size[0],f=e._size[1],h=Math.min(s,f),m=e._values,v=e._index,y=e._ptr,g=[],x=[],b=[],w=[s,h],_=[],N=[],E=[],M=[h,f],S=[],A=[];for(t=0;t<s;t++)S[t]=t,A[t]=t;var O=function(){var e=new d;r<s&&(b.push(g.length),g.push(1),x.push(r)),E.push(_.length);var f=y[r],h=y[r+1];for(i=f;i<h;i++)t=v[i],e.set(S[t],m[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,l(o(i,r)))}))}));var O,k,T,C,I=r,D=e.get(r),z=n(D);e.forEach(r+1,s-1,(function(e,t){var r=n(t);u(r,z)&&(I=e,z=r,D=t)})),r!==I&&(p._swapRows(r,I,w[1],g,x,b),p._swapRows(r,I,M[1],_,N,E),e.swap(r,I),k=I,T=A[O=r],C=A[k],S[T]=k,S[C]=O,A[O]=C,A[k]=T),e.forEach(0,s-1,(function(e,t){e<=r?(_.push(t),N.push(e)):(t=a(t,D),c(t,0)||(g.push(t),x.push(e)))}))};for(r=0;r<f;r++)O();return E.push(_.length),b.push(g.length),{L:new p({values:g,index:x,ptr:b,size:w}),U:new p({values:_,index:N,ptr:E,size:M}),p:S,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}(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,l,p=e._size[0],d=e._size[1],h=Math.min(p,d),m=(0,Xe.d9)(e._data),v=[],y=[p,h],g=[],x=[h,d],b=[];for(t=0;t<p;t++)b[t]=t;for(r=0;r<d;r++){if(r>0)for(t=0;t<p;t++){var w=Math.min(t,r),_=0;for(l=0;l<w;l++)_=i(_,o(m[t][l],m[l][r]));m[t][r]=s(m[t][r],_)}var N=r,E=0,M=0;for(t=r;t<p;t++){var S=m[t][r],A=n(S);u(A,E)&&(N=t,E=A,M=S)}if(r!==N&&(b[r]=[b[N],b[N]=b[r]][0],f._swapRows(r,N,m)),r<p)for(t=r+1;t<p;t++){var O=m[t][r];c(O,0)||(m[t][r]=a(m[t][r],M))}}for(r=0;r<d;r++)for(t=0;t<p;t++)0===r&&(t<d&&(g[t]=[]),v[t]=[]),t<r?(t<d&&(g[t][r]=m[t][r]),r<p&&(v[t][r]=0)):t!==r?(t<d&&(g[t][r]=0),r<p&&(v[t][r]=m[t][r])):(t<d&&(g[t][r]=m[t][r]),r<p&&(v[t][r]=1));var k=new f({data:v,size:y}),T=new f({data:g,size:x}),C=[];for(t=0,h=b.length;t<h;t++)C[b[t]]=t;return{L:k,U:T,p:C,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}}));function Tf(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 Cf(e){return-e-2}var If=["add","multiply","transpose"],Df=(0,i.d5)("csAmd",If,(e=>{var{add:t,multiply:r,transpose:n}=e;return function(e,o){if(!o||e<=0||e>3)return null;var s=o._size,u=s[0],c=s[1],l=0,f=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,l=u._ptr,f=0,p=0;p<a;p++){var d=l[p];if(l[p]=f,!(l[p+1]-d>s))for(var h=l[p+1];d<h;d++)c[f++]=c[d]}return l[a]=f,i=n(u),r(u,i)}return r(u,i)}(e,o,u,c,f=Math.min(c-2,f));!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,null)&&(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);for(var d,h,m,v,y,g,x,b,w,_,N,E,M,S,A,O,k=p._index,T=p._ptr,C=T[c],I=[],D=[],z=c+1,B=2*(c+1),j=3*(c+1),U=4*(c+1),R=5*(c+1),q=6*(c+1),F=7*(c+1),P=I,L=function(e,t,r,n,a,o,s,u,c,l,f,p){for(var d=0;d<e;d++)r[0+d]=t[d+1]-t[d];r[0+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[l+h]=1,r[f+h]=0,r[p+h]=r[0+h];var m=i(0,0,r,l,e);return r[f+e]=-2,t[e]=-1,r[l+e]=0,m}(c,T,D,0,j,P,B,F,z,q,U,R),H=function(e,t,r,n,i,a,o,s,u,c,l){for(var f=0,p=0;p<e;p++){var d=r[n+p];if(0===d)r[i+p]=-2,f++,t[p]=-1,r[a+p]=0;else if(d>o)r[s+p]=0,r[i+p]=-1,f++,t[p]=Cf(e),r[s+e]++;else{var h=r[u+d];-1!==h&&(c[h]=p),r[l+p]=r[u+d],r[u+d]=p}}return f}(c,T,D,R,U,q,f,z,j,P,B),G=0;H<c;){for(m=-1;G<c&&-1===(m=D[j+G]);G++);-1!==D[B+m]&&(P[D[B+m]]=-1),D[j+G]=D[B+m];var Z=D[U+m],W=D[z+m];H+=W;var $=0;D[z+m]=-W;var V=T[m],J=0===Z?V:C,Y=J;for(v=1;v<=Z+1;v++){for(v>Z?(g=m,x=V,b=D[0+m]-Z):(x=T[g=k[V++]],b=D[0+g]),y=1;y<=b;y++)(w=D[z+(d=k[x++])])<=0||($+=w,D[z+d]=-w,k[Y++]=d,-1!==D[B+d]&&(P[D[B+d]]=P[d]),-1!==P[d]?D[B+P[d]]=D[B+d]:D[j+D[R+d]]=D[B+d]);g!==m&&(T[g]=Cf(m),D[q+g]=0)}for(0!==Z&&(C=Y),D[R+m]=$,T[m]=J,D[0+m]=Y-J,D[U+m]=-2,L=i(L,l,D,q,c),_=J;_<Y;_++)if(!((N=D[U+(d=k[_])])<=0)){var X=L-(w=-D[z+d]);for(V=T[d],E=T[d]+N-1;V<=E;V++)D[q+(g=k[V])]>=L?D[q+g]-=w:0!==D[q+g]&&(D[q+g]=D[R+g]+X)}for(_=J;_<Y;_++){for(M=(E=T[d=k[_]])+D[U+d]-1,S=E,A=0,O=0,V=E;V<=M;V++)if(0!==D[q+(g=k[V])]){var Q=D[q+g]-L;Q>0?(O+=Q,k[S++]=g,A+=g):(T[g]=Cf(m),D[q+g]=0)}D[U+d]=S-E+1;var K=S,ee=E+D[0+d];for(V=M+1;V<ee;V++){var te=D[z+(h=k[V])];te<=0||(O+=te,k[S++]=h,A+=h)}0===O?(T[d]=Cf(m),$-=w=-D[z+d],W+=w,H+=w,D[z+d]=0,D[U+d]=-1):(D[R+d]=Math.min(D[R+d],O),k[S]=k[K],k[K]=k[E],k[E]=m,D[0+d]=S-E+1,A=(A<0?-A:A)%c,D[B+d]=D[F+A],D[F+A]=d,P[d]=A)}for(D[R+m]=$,L=i(L+(l=Math.max(l,$)),l,D,q,c),_=J;_<Y;_++)if(!(D[z+(d=k[_])]>=0))for(d=D[F+(A=P[d])],D[F+A]=-1;-1!==d&&-1!==D[B+d];d=D[B+d],L++){for(b=D[0+d],N=D[U+d],V=T[d]+1;V<=T[d]+b-1;V++)D[q+k[V]]=L;var re=d;for(h=D[B+d];-1!==h;){var ne=D[0+h]===b&&D[U+h]===N;for(V=T[h]+1;ne&&V<=T[h]+b-1;V++)D[q+k[V]]!==L&&(ne=0);ne?(T[h]=Cf(d),D[z+d]+=D[z+h],D[z+h]=0,D[U+h]=-1,h=D[B+h],D[B+re]=h):(re=h,h=D[B+h])}}for(V=J,_=J;_<Y;_++)(w=-D[z+(d=k[_])])<=0||(D[z+d]=w,O=D[R+d]+$-w,-1!==D[j+(O=Math.min(O,c-H-w))]&&(P[D[j+O]]=d),D[B+d]=D[j+O],P[d]=-1,D[j+O]=d,G=Math.min(G,O),D[R+d]=O,k[V++]=d);D[z+m]=W,0==(D[0+m]=V-J)&&(T[m]=-1,D[q+m]=0),0!==Z&&(C=V)}for(d=0;d<c;d++)T[d]=Cf(T[d]);for(h=0;h<=c;h++)D[j+h]=-1;for(h=c;h>=0;h--)D[z+h]>0||(D[B+h]=D[j+T[h]],D[j+T[h]]=h);for(g=c;g>=0;g--)D[z+g]<=0||-1!==T[g]&&(D[B+g]=D[j+T[g]],D[j+T[g]]=g);for(m=0,d=0;d<=c;d++)-1===T[d]&&(m=Tf(d,m,D,j,B,I,q));return I.splice(I.length-1,1),I};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 zf(e,t,r,n,i,a,o){var s,u,c,l=0;if(e<=t||r[n+t]<=r[i+e])return-1;r[i+e]=r[n+t];var f=r[a+e];if(r[a+e]=t,-1===f)l=1,c=e;else{for(l=2,c=f;c!==r[o+c];c=r[o+c]);for(s=f;s!==c;s=u)u=r[o+s],r[o+s]=c}return{jleaf:l,q:c}}var Bf=["transpose"],jf=(0,i.d5)("csCounts",Bf,(e=>{var{transpose:t}=e;return function(e,r,n,i){if(!e||!r||!n)return null;var a,o,s,u,c,l,f,p=e._size,d=p[0],h=p[1],m=4*h+(i?h+d+1:0),v=[],y=h,g=2*h,x=3*h,b=4*h,w=5*h+1;for(s=0;s<m;s++)v[s]=-1;var _=[],N=t(e),E=N._index,M=N._ptr;for(s=0;s<h;s++)for(_[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<d;a++){for(s=h,l=M[a],f=M[a+1],c=l;c<f;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]]&&_[r[o]]--,u=i?v[b+s]:o;-1!==u;u=i?v[w+u]:-1)for(c=M[u];c<M[u+1];c++){var S=zf(a=E[c],o,v,x,y,g,0);S.jleaf>=1&&_[o]++,2===S.jleaf&&_[S.q]--}-1!==r[o]&&(v[0+o]=r[o])}for(o=0;o<h;o++)-1!==r[o]&&(_[r[o]]+=_[o]);return _}})),Uf=["add","multiply","transpose"],Rf=(0,i.d5)("csSqr",Uf,(e=>{var{add:t,multiply:r,transpose:n}=e,i=Df({add:t,multiply:r,transpose:n}),a=jf({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],l=s[1],f=null,p=[],d=[],h=0,m=0;m<l;m++){d[m]=h;for(var v=r?r[m]:m,y=o[v],g=o[v+1],x=y;x<g;x++){var b=a[x];p[h]=b,f&&(f[h]=i[x]),h++}}return d[l]=h,e.createSparseMatrix({values:f,index:p,ptr:d,size:[c,l],datatype:u})}(t,0,u.q):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=[],l=[],f=u;for(r=0;r<s;r++)l[f+r]=-1;for(var p=0;p<u;p++){c[p]=-1,l[0+p]=-1;for(var d=a[p],h=a[p+1],m=d;m<h;m++){var v=i[m];for(r=l[f+v];-1!==r&&r<p;r=n)n=l[0+r],l[0+r]=p,-1===n&&(c[r]=p);l[f+v]=p}}return c}(c);var l=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=Tf(r,n,a,0,o,i,s));return i}(u.parent,s);if(u.cp=a(c,u.parent,l,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,l,f,p=t.parent,d=t.pinv,h=t.leftmost,m=[],v=a,y=a+o,g=a+2*o;for(u=0;u<o;u++)m[v+u]=-1,m[y+u]=-1,m[g+u]=0;for(s=0;s<a;s++)h[s]=-1;for(u=o-1;u>=0;u--)for(l=r[u],f=r[u+1],c=l;c<f;c++)h[n[c]]=u;for(s=a-1;s>=0;s--)d[s]=-1,-1!==(u=h[s])&&(0==m[g+u]++&&(m[y+u]=s),m[0+s]=m[v+u],m[v+u]=s);for(t.lnz=0,t.m2=a,u=0;u<o;u++)if(s=m[v+u],t.lnz++,s<0&&(s=t.m2++),d[s]=u,!(--g[u]<=0)){t.lnz+=m[g+u];var x=p[u];-1!==x&&(0===m[g+x]&&(m[y+x]=m[y+u]),m[0+m[y+u]]=m[v+x],m[v+x]=m[0+s],m[g+x]+=m[g+u])}for(s=0;s<a;s++)d[s]<0&&(d[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 qf(e,t){return e[t]<0}function Ff(e,t){e[t]=Cf(e[t])}function Pf(e){return e<0?Cf(e):e}function Lf(e,t,r,n,i){var a,o,s,u=t._index,c=t._ptr,l=t._size[1],f=0;for(n[0]=e;f>=0;){e=n[f];var p=i?i[e]:e;qf(c,e)||(Ff(c,e),n[l+f]=p<0?0:Pf(c[p]));var d=1;for(o=n[l+f],s=p<0?0:Pf(c[p+1]);o<s;o++)if(!qf(c,a=u[o])){n[l+f]=o,n[++f]=a,d=0;break}d&&(f--,n[--r]=e)}return r}var Hf=["divideScalar","multiply","subtract"],Gf=(0,i.d5)("csSpsolve",Hf,(e=>{var{divideScalar:t,multiply:r,subtract:n}=e;return function(e,i,a,o,s,u,c){var l,f,p,d,h=e._values,m=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,l=t._index,f=t._ptr,p=c[1],d=p;for(o=f[r],s=f[r+1],a=o;a<s;a++){var h=l[a];qf(u,h)||(d=Lf(h,e,d,n,i))}for(a=d;a<p;a++)Ff(u,n[a]);return d}(e,i,a,o,u);for(l=w;l<y;l++)s[o[l]]=0;for(f=b[a],p=b[a+1],l=f;l<p;l++)s[x[l]]=g[l];for(var _=w;_<y;_++){var N=o[_],E=u?u[N]:N;if(!(E<0))for(f=v[E],p=v[E+1],s[N]=t(s[N],h[c?f:p-1]),l=c?f+1:f,d=c?p:p-1;l<d;l++){var M=m[l];s[M]=n(s[M],r(h[l],s[N]))}}return w}})),Zf=["abs","divideScalar","multiply","subtract","larger","largerEq","SparseMatrix"],Wf=(0,i.d5)("csLu",Zf,(e=>{var{abs:t,divideScalar:r,multiply:n,subtract:i,larger:a,largerEq:o,SparseMatrix:s}=e,u=Gf({divideScalar:r,multiply:n,subtract:i});return function(e,i,c){if(!e)return null;var l,f=e._size[1],p=100,d=100;i&&(l=i.q,p=i.lnz||p,d=i.unz||d);var h,m,v=[],y=[],g=[],x=new s({values:v,index:y,ptr:g,size:[f,f]}),b=[],w=[],_=[],N=new s({values:b,index:w,ptr:_,size:[f,f]}),E=[],M=[],S=[];for(h=0;h<f;h++)M[h]=0,E[h]=-1,g[h+1]=0;p=0,d=0;for(var A=0;A<f;A++){g[A]=p,_[A]=d;var O=l?l[A]:A,k=u(x,e,O,S,M,E,1),T=-1,C=-1;for(m=k;m<f;m++)if(E[h=S[m]]<0){var I=t(M[h]);a(I,C)&&(C=I,T=h)}else w[d]=E[h],b[d++]=M[h];if(-1===T||C<=0)return null;E[O]<0&&o(t(M[O]),n(C,c))&&(T=O);var D=M[T];for(w[d]=A,b[d++]=D,E[T]=A,y[p]=T,v[p++]=1,m=k;m<f;m++)E[h=S[m]]<0&&(y[p]=h,v[p++]=r(M[h],D)),M[h]=0}for(g[f]=p,_[f]=d,m=0;m<p;m++)y[m]=E[y[m]];return v.splice(p,v.length-p),y.splice(p,y.length-p),b.splice(d,b.length-d),w.splice(d,w.length-d),{L:x,U:N,pinv:E}}})),$f=["typed","abs","add","multiply","transpose","divideScalar","subtract","larger","largerEq","SparseMatrix"],Vf=(0,i.d5)("slu",$f,(e=>{var{typed:t,abs:r,add:n,multiply:i,transpose:a,divideScalar:o,subtract:s,larger:c,largerEq:l,SparseMatrix:f}=e,p=Rf({add:n,multiply:i,transpose:a}),d=Wf({abs:r,divideScalar:o,multiply:i,subtract:s,larger:c,largerEq:l,SparseMatrix:f});return t("slu",{"SparseMatrix, number, number":function(e,t,r){if(!(0,u.U)(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=p(t,e,!1),i=d(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"}}}})})),Jf=["typed","matrix","subtract","multiply","unaryMinus","lup"],Yf=(0,i.d5)("det",Jf,(e=>{var{typed:t,matrix:r,subtract:n,multiply:i,unaryMinus:a,lup:o}=e;return t("det",{any:function(e){return(0,Xe.d9)(e)},"Array | Matrix":function(e){var t;switch((t=(0,c.SW)(e)?e.size():Array.isArray(e)?(e=r(e)).size():[]).length){case 0:return(0,Xe.d9)(e);case 1:if(1===t[0])return(0,Xe.d9)(e.valueOf()[0]);throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");case 2:var s=t[0];if(s===t[1])return function(e,t,r){if(1===t)return(0,Xe.d9)(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 l=0,f=0,p=[];;){for(;p[f];)f++;if(f>=t)break;for(var d=f,h=0;!p[s.p[d]];)p[s.p[d]]=!0,d=s.p[d],h++;h%2==0&&l++}return l%2==0?u:a(u)}(e.clone().valueOf(),s);throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+(0,Ye.WU)(t)+")")}}})})),Xf="distance",Qf=["typed","addScalar","subtract","divideScalar","multiplyScalar","unaryMinus","sqrt","abs"],Kf=(0,i.d5)(Xf,Qf,(e=>{var{typed:t,addScalar:r,subtract:n,multiplyScalar:i,divideScalar:a,unaryMinus:o,sqrt:s,abs:u}=e;return t(Xf,{"Array, Array, Array":function(e,t,r){if(2===e.length&&2===t.length&&2===r.length){if(!f(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!f(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!f(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])),l=e[1];return v(e[0],e[1],u,c,l)}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(!f(e))throw new TypeError("Values of pointX and pointY should be numbers or BigNumbers");if(!f(t))throw new TypeError("Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers");if(!f(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)),l=e.pointX;return v(e.pointX,e.pointY,u,c,l)}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(!f(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(!d(e))throw new TypeError("All values of an array should be numbers or BigNumbers");if(!d(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(!f(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(!f(e))throw new TypeError("Values of pointOneX and pointOneY should be numbers or BigNumbers");if(!f(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&&l(e[0][0])&&l(e[0][1])){if(e.some((e=>2!==e.length||!l(e[0])||!l(e[1]))))return!1}else{if(!(3===e[0].length&&l(e[0][0])&&l(e[0][1])&&l(e[0][2])))return!1;if(e.some((e=>3!==e.length||!l(e[0])||!l(e[1])||!l(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 l(e){return"number"==typeof e||(0,c.l9)(e)}function f(e){return e.constructor!==Array&&(e=m(e)),l(e[0])&&l(e[1])}function p(e){return e.constructor!==Array&&(e=m(e)),l(e[0])&&l(e[1])&&l(e[2])}function d(e){return Array.isArray(e)||(e=m(e)),e.every(l)}function h(e){return e.constructor!==Array&&(e=m(e)),l(e[0])&&l(e[1])&&l(e[2])&&l(e[3])&&l(e[4])&&l(e[5])}function m(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,c){var l=u(r(r(i(n,e),i(o,t)),c)),f=s(r(i(n,n),i(o,o)));return a(l,f)}function y(e,t,o,u,c,l,f,p,d){var h=[n(i(n(c,t),d),i(n(l,o),p)),n(i(n(l,o),f),i(n(u,e),d)),n(i(n(u,e),p),i(n(c,t),f))];h=s(r(r(i(h[0],h[0]),i(h[1],h[1])),i(h[2],h[2])));var m=s(r(r(i(f,f),i(p,p)),i(d,d)));return a(h,m)}function g(e,t){for(var a=e.length,o=0,u=0,c=0;c<a;c++)u=n(e[c],t[c]),o=r(i(u,u),o);return s(o)}})),ep="stirlingS2",tp=["typed","addScalar","subtract","multiplyScalar","divideScalar","pow","factorial","combinations","isNegative","isInteger","larger"],rp=(0,i.d5)(ep,tp,(e=>{var{typed:t,addScalar:r,subtract:n,multiplyScalar:i,divideScalar:a,pow:o,factorial:s,combinations:u,isNegative:c,isInteger:l,larger:f}=e;return t(ep,{"number | BigNumber, number | BigNumber":function(e,t){if(!l(e)||c(e)||!l(t)||c(t))throw new TypeError("Non-negative integer value expected in function stirlingS2");if(f(t,e))throw new TypeError("k must be less than or equal to n in function stirlingS2");for(var p=s(t),d=0,h=0;h<=t;h++){var m=o(-1,n(t,h)),v=u(t,h),y=o(h,e);d=r(d,i(i(v,y),m))}return a(d,p)}})})),np="catalan",ip=["typed","addScalar","divideScalar","multiplyScalar","combinations","isNegative","isInteger"],ap=(0,i.d5)(np,ip,(e=>{var{typed:t,addScalar:r,divideScalar:n,multiplyScalar:i,combinations:a,isNegative:o,isInteger:s}=e;return t(np,{"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))}})})),op="count",sp=["typed","size","prod"],up=(0,i.d5)(op,sp,(e=>{var{typed:t,size:r,prod:n}=e;return t(op,{string:function(e){return e.length},"Matrix | Array":function(e){return n(r(e))}})})),cp=["config","typed","divideScalar","Complex"],lp=(0,i.d5)("log",cp,(e=>{var{typed:t,config:r,divideScalar:n,Complex:i}=e;return t("log",{number:function(e){return e>=0||r.predictable?er(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(0,ut.Fh)(e,this)},"any, any":function(e,t){return n(this(e),this(t))}})})),fp="dotDivide",pp=["typed","matrix","equalScalar","divideScalar","DenseMatrix"],dp=(0,i.d5)(fp,pp,(e=>{var{typed:t,matrix:r,equalScalar:n,divideScalar:i,DenseMatrix:a}=e,o=Mo({typed:t,equalScalar:n}),s=Ao({typed:t}),u=Vo({typed:t,DenseMatrix:a}),c=Co({typed:t,equalScalar:n}),l=Do({typed:t,DenseMatrix:a}),f=xo({typed:t}),p=wo({typed:t});return t(fp,{"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 f(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 l(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()}})})),hp="usolveAll",mp=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],vp=(0,i.d5)(hp,mp,(e=>{var{typed:t,matrix:r,divideScalar:n,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(hp,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=[u(e,t,!0)._data.map((e=>e[0]))],c=e._size[0],l=e._size[1],f=e._values,p=e._index,d=e._ptr,h=l-1;h>=0;h--)for(var m=r.length,v=0;v<m;v++){for(var y=r[v],g=[],x=[],b=d[h],w=0,_=d[h+1]-1;_>=b;_--){var N=p[_];N===h?w=f[_]:N<h&&(g.push(f[_]),x.push(N))}if(o(w,0))if(o(y[h],0)){if(0===v){var E=[...y];E[h]=1;for(var M=0,S=x.length;M<S;M++){var A=x[M];E[A]=a(E[A],g[M])}r.push(E)}}else{if(0===v)return[];r.splice(v,1),v-=1,m-=1}else{y[h]=n(y[h],w);for(var O=0,k=x.length;O<k;O++){var T=x[O];y[T]=a(y[T],i(y[h],g[O]))}}}return r.map((e=>new s({data:e.map((e=>[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((e=>e.valueOf()))}});function c(e,t){for(var r=[u(e,t,!0)._data.map((e=>e[0]))],c=e._data,l=e._size[0],f=e._size[1]-1;f>=0;f--)for(var p=r.length,d=0;d<p;d++){var h=r[d];if(o(c[f][f],0))if(o(h[f],0)){if(0===d){var m=[...h];m[f]=1;for(var v=f-1;v>=0;v--)m[v]=a(m[v],c[v][f]);r.push(m)}}else{if(0===d)return[];r.splice(d,1),d-=1,p-=1}else{h[f]=n(h[f],c[f][f]);for(var y=f-1;y>=0;y--)h[y]=a(h[y],i(h[f],c[y][f]))}}return r.map((e=>new s({data:e.map((e=>[e])),size:[l,1]})))}})),yp="hypot",gp=["typed","abs","addScalar","divideScalar","multiplyScalar","sqrt","smaller","isPositive"],xp=(0,i.d5)(yp,gp,(e=>{var{typed:t,abs:r,addScalar:n,divideScalar:i,multiplyScalar:a,sqrt:o,smaller:s,isPositive:u}=e;return t(yp,{"... number | BigNumber":function(e){for(var t=0,c=0,l=0;l<e.length;l++){var f=r(e[l]);s(c,f)?(t=a(t,a(i(c,f),i(c,f))),t=n(t,1),c=f):t=n(t,u(f)?a(i(f,c),i(f,c)):f)}return a(c,o(t))},Array:function(e){return this.apply(this,(0,Je.xH)(e))},Matrix:function(e){return this.apply(this,(0,Je.xH)(e.toArray()))}})}));function bp(){return(bp=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}).apply(this,arguments)}var wp=["typed","matrix","zeros","identity","isZero","equal","sign","sqrt","conj","unaryMinus","addScalar","divideScalar","multiplyScalar","subtract","complex"],_p=(0,i.d5)("qr",wp,(e=>{var{typed:t,matrix:r,zeros:n,identity:i,isZero:a,equal:o,sign:s,sqrt:u,conj:c,unaryMinus:l,addScalar:f,divideScalar:p,multiplyScalar:d,subtract:h,complex:m}=e;return bp(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,m,v=e._size[0],y=e._size[1],g=i([v],"dense"),x=g._data,b=e.clone(),w=b._data,_=n([v],"");for(m=0;m<Math.min(y,v);++m){var N=w[m][m],E=l(o(N,0)?1:s(N)),M=c(E),S=0;for(t=m;t<v;t++)S=f(S,d(w[t][m],c(w[t][m])));var A=d(E,u(S));if(!a(A)){var O=h(N,A);for(_[m]=1,t=m+1;t<v;t++)_[t]=p(w[t][m],O);var k=l(c(p(O,A))),T=void 0;for(r=m;r<y;r++){for(T=0,t=m;t<v;t++)T=f(T,d(c(_[t]),w[t][r]));for(T=d(T,k),t=m;t<v;t++)w[t][r]=d(h(w[t][r],d(_[t],T)),M)}for(t=0;t<v;t++){for(T=0,r=m;r<v;r++)T=f(T,d(x[t][r],_[r]));for(T=d(T,k),r=m;r<v;++r)x[t][r]=p(h(x[t][r],d(T,c(_[r]))),M)}}}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?m(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}})),Np=["typed","matrix","divideScalar","addScalar","multiply","unaryMinus","det","identity","abs"],Ep=(0,i.d5)("inv",Np,(e=>{var{typed:t,matrix:r,divideScalar:n,addScalar:i,multiply:a,unaryMinus:o,det:s,identity:u,abs:l}=e;return t("inv",{"Array | Matrix":function(e){var t=(0,c.SW)(e)?e.size():(0,Je.aJ)(e);switch(t.length){case 1:if(1===t[0])return(0,c.SW)(e)?r([n(1,e.valueOf()[0])]):[n(1,e[0])];throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");case 2:var i=t[0],a=t[1];if(i===a)return(0,c.SW)(e)?r(f(e.valueOf(),i,a),e.storage()):f(e,i,a);throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+(0,Ye.WU)(t)+")")}},any:function(e){return n(1,e)}});function f(e,t,r){var c,f,p,d,h;if(1===t){if(0===(d=e[0][0]))throw Error("Cannot calculate inverse, determinant is zero");return[[n(1,d)]]}if(2===t){var m=s(e);if(0===m)throw Error("Cannot calculate inverse, determinant is zero");return[[n(e[1][1],m),n(o(e[0][1]),m)],[n(o(e[1][0]),m),n(e[0][0],m)]]}var v=e.concat();for(c=0;c<t;c++)v[c]=v[c].concat();for(var y=u(t).valueOf(),g=0;g<r;g++){var x=l(v[g][g]),b=g;for(c=g+1;c<t;)l(v[c][g])>x&&(x=l(v[c][g]),b=c),c++;if(0===x)throw Error("Cannot calculate inverse, determinant is zero");(c=b)!==g&&(h=v[g],v[g]=v[c],v[c]=h,h=y[g],y[g]=y[c],y[c]=h);var w=v[g],_=y[g];for(c=0;c<t;c++){var N=v[c],E=y[c];if(c!==g){if(0!==N[g]){for(p=n(o(N[g]),w[g]),f=g;f<r;f++)N[f]=i(N[f],a(p,w[f]));for(f=0;f<r;f++)E[f]=i(E[f],a(p,_[f]))}}else{for(p=w[g],f=g;f<r;f++)N[f]=n(N[f],p);for(f=0;f<r;f++)E[f]=n(E[f],p)}}}return y}})),Mp="expm",Sp=["typed","abs","add","identity","inv","multiply"],Ap=(0,i.d5)(Mp,Sp,(e=>{var{typed:t,abs:r,add:n,identity:i,inv:a,multiply:o}=e;return t(Mp,{Matrix:function(e){var t=e.size();if(2!==t.length||t[0]!==t[1])throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");for(var u=t[0],l=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)<1e-15)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)),f=l.q,p=l.j,d=o(e,Math.pow(2,-p)),h=i(u),m=i(u),v=1,y=d,g=-1,x=1;x<=f;x++)x>1&&(y=o(y,d),g=-g),h=n(h,o(v=v*(f-x+1)/((2*f-x+1)*x),y)),m=n(m,o(v*g,y));for(var b=o(a(m),h),w=0;w<p;w++)b=o(b,b);return(0,c.sA)(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)}})),Op=["typed","matrix","multiply","equalScalar","divideScalar","inv"],kp=(0,i.d5)("divide",Op,(e=>{var{typed:t,matrix:r,multiply:n,equalScalar:i,divideScalar:a,inv:o}=e,s=Co({typed:t,equalScalar:i}),u=wo({typed:t});return t("divide",(0,Xe.l7)({"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))})),Tp="kldivergence",Cp=["typed","matrix","divide","sum","multiply","dotDivide","log","isNumeric"],Ip=(0,i.d5)(Tp,Cp,(e=>{var{typed:t,matrix:r,divide:n,sum:i,multiply:a,dotDivide:o,log:s,isNumeric:u}=e;return t(Tp,{"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 l=n(e,i(e)),f=n(t,i(t)),p=i(a(l,s(o(l,f))));return u(p)?p:Number.NaN}})),Dp="bellNumbers",zp=["typed","addScalar","isNegative","isInteger","stirlingS2"],Bp=(0,i.d5)(Dp,zp,(e=>{var{typed:t,addScalar:r,isNegative:n,isInteger:i,stirlingS2:a}=e;return t(Dp,{"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}})})),jp="log1p",Up=["typed","config","divideScalar","log","Complex"],Rp=(0,i.d5)(jp,Up,(e=>{var{typed:t,config:r,divideScalar:n,log:i,Complex:a}=e;return t(jp,{number:function(e){return e>=-1||r.predictable?(0,u.Kr)(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(0,ut.Fh)(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))}}));function qp(){return(qp=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}).apply(this,arguments)}function Fp(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 Pp(e){for(var t=1;t<arguments.length;t++){var r=null!=arguments[t]?arguments[t]:{};t%2?Fp(Object(r),!0).forEach((function(t){Lp(e,t,r[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(r)):Fp(Object(r)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(r,t))}))}return e}function Lp(e,t,r){return t in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}var Hp=["?on","config","addScalar","subtract","multiplyScalar","divideScalar","pow","abs","fix","round","equal","isNumeric","format","number","Complex","BigNumber","Fraction"],Gp=(0,i.d5)("Unit",Hp,(e=>{var t,r,n,{on:i,config:a,addScalar:o,subtract:s,multiplyScalar:u,divideScalar:l,pow:f,abs:p,fix:d,round:m,equal:v,isNumeric:g,format:x,number:b,Complex:w,BigNumber:_,Fraction:N}=e,E=b;function M(e,t){if(!(this instanceof M))throw new Error("Constructor must be called with the new operator");if(null!=e&&!g(e)&&!(0,c.Mc)(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=M.parse(t);this.units=r.units,this.dimensions=r.dimensions}else{this.units=[{unit:q,prefix:B.NONE,power:0}],this.dimensions=[];for(var n=0;n<j.length;n++)this.dimensions[n]=0}this.value=null!=e?this._normalize(e):null,this.fixPrefix=!1,this.skipAutomaticSimplification=!0}function S(){for(;" "===n||"\t"===n;)O()}function A(e){return e>="0"&&e<="9"}function O(){r++,n=t.charAt(r)}function k(e){r=e,n=t.charAt(r)}function T(){var e="",t=r;if("+"===n?O():"-"===n&&(e+=n,O()),!function(e){return e>="0"&&e<="9"||"."===e}(n))return k(t),null;if("."===n){if(e+=n,O(),!A(n))return k(t),null}else{for(;A(n);)e+=n,O();"."===n&&(e+=n,O())}for(;A(n);)e+=n,O();if("E"===n||"e"===n){var i="",a=r;if(i+=n,O(),"+"!==n&&"-"!==n||(i+=n,O()),!A(n))return k(a),e;for(e+=i;A(n);)e+=n,O()}return e}function C(){for(var e="";A(n)||M.isValidAlpha(n);)e+=n,O();var t=e.charAt(0);return M.isValidAlpha(t)?e:null}function I(e){return n===e?(O(),e):null}M.prototype.type="Unit",M.prototype.isUnit=!0,M.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 o=new M;o.units=[];var s=1,u=!1;O(),S();var c=T(),l=null;if(c){if("BigNumber"===a.number)l=new _(c);else if("Fraction"===a.number)try{l=new N(c)}catch(e){l=parseFloat(c)}else l=parseFloat(c);S(),I("*")?(s=1,u=!0):I("/")&&(s=-1,u=!0)}for(var f=[],p=1;;){for(S();"("===n;)f.push(s),p*=s,s=1,O(),S();var d;if(!n)break;var h=n;if(null===(d=C()))throw new SyntaxError('Unexpected "'+h+'" in "'+t+'" at index '+r.toString());var m=D(d);if(null===m)throw new SyntaxError('Unit "'+d+'" not found.');var v=s*p;if(S(),I("^")){S();var y=T();if(null===y)throw new SyntaxError('In "'+e+'", "^" must be followed by a floating-point number');v*=y}o.units.push({unit:m.unit,prefix:m.prefix,power:v});for(var g=0;g<j.length;g++)o.dimensions[g]+=(m.unit.dimensions[g]||0)*v;for(S();")"===n;){if(0===f.length)throw new SyntaxError('Unmatched ")" in "'+t+'" at index '+r.toString());p/=f.pop(),O(),S()}if(u=!1,I("*")?(s=1,u=!0):I("/")?(s=-1,u=!0):s=1,m.unit.base){var x=m.unit.base.key;H.auto[x]={unit:m.unit,prefix:m.prefix}}}if(S(),n)throw new SyntaxError('Could not parse: "'+e+'"');if(u)throw new SyntaxError('Trailing characters: "'+e+'"');if(0!==f.length)throw new SyntaxError('Unmatched "(" in "'+t+'"');if(0===o.units.length&&!i.allowNoUnits)throw new SyntaxError('"'+e+'" contains no units');return o.value=void 0!==l?o._normalize(l):null,o},M.prototype.clone=function(){var e=new M;e.fixPrefix=this.fixPrefix,e.skipAutomaticSimplification=this.skipAutomaticSimplification,e.value=(0,Xe.d9)(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])(0,Xe.nr)(this.units[t],r)&&(e.units[t][r]=this.units[t][r]);return e},M.prototype._isDerived=function(){return 0!==this.units.length&&(this.units.length>1||Math.abs(this.units[0].power-1)>1e-15)},M.prototype._normalize=function(e){var t,r,n,i,a;if(null==e||0===this.units.length)return e;if(this._isDerived()){var s=e;a=M._getNumberConverter((0,c.kM)(e));for(var l=0;l<this.units.length;l++)t=a(this.units[l].unit.value),i=a(this.units[l].prefix.value),n=a(this.units[l].power),s=u(s,f(u(t,i),n));return s}return t=(a=M._getNumberConverter((0,c.kM)(e)))(this.units[0].unit.value),r=a(this.units[0].unit.offset),i=a(this.units[0].prefix.value),u(o(e,r),u(t,i))},M.prototype._denormalize=function(e,t){var r,n,i,a,o;if(null==e||0===this.units.length)return e;if(this._isDerived()){var p=e;o=M._getNumberConverter((0,c.kM)(e));for(var d=0;d<this.units.length;d++)r=o(this.units[d].unit.value),a=o(this.units[d].prefix.value),i=o(this.units[d].power),p=l(p,f(u(r,a),i));return p}return r=(o=M._getNumberConverter((0,c.kM)(e)))(this.units[0].unit.value),a=o(this.units[0].prefix.value),n=o(this.units[0].unit.offset),s(l(l(e,r),null==t?a:t),n)};var D=(0,h.HP)((e=>{if((0,Xe.nr)(F,e)){var t=F[e];return{unit:t,prefix:t.prefixes[""]}}for(var r in F)if((0,Xe.nr)(F,r)&&(0,Ye.pn)(e,r)){var n=F[r],i=e.length-r.length,a=e.substring(0,i),o=(0,Xe.nr)(n.prefixes,a)?n.prefixes[a]:void 0;if(void 0!==o)return{unit:n,prefix:o}}return null}),{hasher:e=>e[0],limit:100});function z(e){return e.equalBase(U.NONE)&&null!==e.value&&!a.predictable?e.value:e}M.isValuelessUnit=function(e){return null!==D(e)},M.prototype.hasBase=function(e){if("string"==typeof e&&(e=U[e]),!e)return!1;for(var t=0;t<j.length;t++)if(Math.abs((this.dimensions[t]||0)-(e.dimensions[t]||0))>1e-12)return!1;return!0},M.prototype.equalBase=function(e){for(var t=0;t<j.length;t++)if(Math.abs((this.dimensions[t]||0)-(e.dimensions[t]||0))>1e-12)return!1;return!0},M.prototype.equals=function(e){return this.equalBase(e)&&v(this.value,e.value)},M.prototype.multiply=function(e){for(var t=this.clone(),r=0;r<j.length;r++)t.dimensions[r]=(this.dimensions[r]||0)+(e.dimensions[r]||0);for(var n=0;n<e.units.length;n++){var i=Pp({},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=u(a,o)}else t.value=null;return t.skipAutomaticSimplification=!1,z(t)},M.prototype.divide=function(e){for(var t=this.clone(),r=0;r<j.length;r++)t.dimensions[r]=(this.dimensions[r]||0)-(e.dimensions[r]||0);for(var n=0;n<e.units.length;n++){var i=Pp(Pp({},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=l(a,o)}else t.value=null;return t.skipAutomaticSimplification=!1,z(t)},M.prototype.pow=function(e){for(var t=this.clone(),r=0;r<j.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=f(t.value,e):t.value=null,t.skipAutomaticSimplification=!1,z(t)},M.prototype.abs=function(){var e=this.clone();for(var t in e.value=null!==e.value?p(e.value):null,e.units)"VA"!==e.units[t].unit.name&&"VAR"!==e.units[t].unit.name||(e.units[t].unit=F.W);return e},M.prototype.to=function(e){var t,r=null===this.value?this._normalize(1):this.value;if("string"==typeof e){if(t=M.parse(e),!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");return t.value=(0,Xe.d9)(r),t.fixPrefix=!0,t.skipAutomaticSimplification=!0,t}if((0,c.wr)(e)){if(!this.equalBase(e))throw new Error("Units do not match ('".concat(e.toString(),"' != '").concat(this.toString(),"')"));if(null!==e.value)throw new Error("Cannot convert to a unit with a value");return(t=e.clone()).value=(0,Xe.d9)(r),t.fixPrefix=!0,t.skipAutomaticSimplification=!0,t}throw new Error("String or Unit expected as parameter")},M.prototype.toNumber=function(e){return E(this.toNumeric(e))},M.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)},M.prototype.toString=function(){return this.format()},M.prototype.toJSON=function(){return{mathjs:"Unit",value:this._denormalize(this.value),unit:this.formatUnits(),fixPrefix:this.fixPrefix}},M.fromJSON=function(e){var t=new M(e.value,e.unit);return t.fixPrefix=e.fixPrefix||!1,t},M.prototype.valueOf=M.prototype.toString,M.prototype.simplify=function(){var e,t,r=this.clone(),n=[];for(var i in G)if((0,Xe.nr)(G,i)&&r.hasBase(U[i])){e=i;break}if("NONE"===e)r.units=[];else if(e&&(0,Xe.nr)(G,e)&&(t=G[e]),t)r.units=[{unit:t.unit,prefix:t.prefix,power:1}];else{for(var a=!1,o=0;o<j.length;o++){var s=j[o];Math.abs(r.dimensions[o]||0)>1e-12&&((0,Xe.nr)(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},M.prototype.toSI=function(){for(var e=this.clone(),t=[],r=0;r<j.length;r++){var n=j[r];if(Math.abs(e.dimensions[r]||0)>1e-12){if(!(0,Xe.nr)(H.si,n))throw new Error("Cannot express custom unit "+n+" in SI units");t.push({unit:H.si[n].unit,prefix:H.si[n].prefix,power:e.dimensions[r]||0})}}return e.units=t,e.fixPrefix=!0,e.skipAutomaticSimplification=!0,e},M.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},M.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&&(0,c.Mc)(t.value)&&(r=Math.abs(t.value.re)<1e-14),t.units)(0,Xe.nr)(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&&(0,c.Mc)(t.value)&&(a="("+a+")"),o.length>0&&a.length>0&&(a+=" "),a+o},M.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?p(this.value):0,t=p(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((0,Xe.nr)(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},M.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=m(i),u=new M(v(a,i)?a:d(t.toNumeric()),e[n].toString());r.push(u),t=s(t,u)}for(var c=0,l=0;l<r.length;l++)c=o(c,r[l].value);return v(c,this.value)&&(t.value=0),r.push(t),r};var B={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}}};B.SHORTLONG=qp({},B.SHORT,B.LONG),B.BINARY_SHORT=qp({},B.BINARY_SHORT_SI,B.BINARY_SHORT_IEC),B.BINARY_LONG=qp({},B.BINARY_LONG_SI,B.BINARY_LONG_IEC);var j=["MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","ANGLE","BIT"],U={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 R in U)(0,Xe.nr)(U,R)&&(U[R].key=R);var q={name:"",base:{},value:1,offset:0,dimensions:j.map((e=>0))},F={meter:{name:"meter",base:U.LENGTH,prefixes:B.LONG,value:1,offset:0},inch:{name:"inch",base:U.LENGTH,prefixes:B.NONE,value:.0254,offset:0},foot:{name:"foot",base:U.LENGTH,prefixes:B.NONE,value:.3048,offset:0},yard:{name:"yard",base:U.LENGTH,prefixes:B.NONE,value:.9144,offset:0},mile:{name:"mile",base:U.LENGTH,prefixes:B.NONE,value:1609.344,offset:0},link:{name:"link",base:U.LENGTH,prefixes:B.NONE,value:.201168,offset:0},rod:{name:"rod",base:U.LENGTH,prefixes:B.NONE,value:5.0292,offset:0},chain:{name:"chain",base:U.LENGTH,prefixes:B.NONE,value:20.1168,offset:0},angstrom:{name:"angstrom",base:U.LENGTH,prefixes:B.NONE,value:1e-10,offset:0},m:{name:"m",base:U.LENGTH,prefixes:B.SHORT,value:1,offset:0},in:{name:"in",base:U.LENGTH,prefixes:B.NONE,value:.0254,offset:0},ft:{name:"ft",base:U.LENGTH,prefixes:B.NONE,value:.3048,offset:0},yd:{name:"yd",base:U.LENGTH,prefixes:B.NONE,value:.9144,offset:0},mi:{name:"mi",base:U.LENGTH,prefixes:B.NONE,value:1609.344,offset:0},li:{name:"li",base:U.LENGTH,prefixes:B.NONE,value:.201168,offset:0},rd:{name:"rd",base:U.LENGTH,prefixes:B.NONE,value:5.02921,offset:0},ch:{name:"ch",base:U.LENGTH,prefixes:B.NONE,value:20.1168,offset:0},mil:{name:"mil",base:U.LENGTH,prefixes:B.NONE,value:254e-7,offset:0},m2:{name:"m2",base:U.SURFACE,prefixes:B.SQUARED,value:1,offset:0},sqin:{name:"sqin",base:U.SURFACE,prefixes:B.NONE,value:64516e-8,offset:0},sqft:{name:"sqft",base:U.SURFACE,prefixes:B.NONE,value:.09290304,offset:0},sqyd:{name:"sqyd",base:U.SURFACE,prefixes:B.NONE,value:.83612736,offset:0},sqmi:{name:"sqmi",base:U.SURFACE,prefixes:B.NONE,value:2589988.110336,offset:0},sqrd:{name:"sqrd",base:U.SURFACE,prefixes:B.NONE,value:25.29295,offset:0},sqch:{name:"sqch",base:U.SURFACE,prefixes:B.NONE,value:404.6873,offset:0},sqmil:{name:"sqmil",base:U.SURFACE,prefixes:B.NONE,value:6.4516e-10,offset:0},acre:{name:"acre",base:U.SURFACE,prefixes:B.NONE,value:4046.86,offset:0},hectare:{name:"hectare",base:U.SURFACE,prefixes:B.NONE,value:1e4,offset:0},m3:{name:"m3",base:U.VOLUME,prefixes:B.CUBIC,value:1,offset:0},L:{name:"L",base:U.VOLUME,prefixes:B.SHORT,value:.001,offset:0},l:{name:"l",base:U.VOLUME,prefixes:B.SHORT,value:.001,offset:0},litre:{name:"litre",base:U.VOLUME,prefixes:B.LONG,value:.001,offset:0},cuin:{name:"cuin",base:U.VOLUME,prefixes:B.NONE,value:16387064e-12,offset:0},cuft:{name:"cuft",base:U.VOLUME,prefixes:B.NONE,value:.028316846592,offset:0},cuyd:{name:"cuyd",base:U.VOLUME,prefixes:B.NONE,value:.764554857984,offset:0},teaspoon:{name:"teaspoon",base:U.VOLUME,prefixes:B.NONE,value:5e-6,offset:0},tablespoon:{name:"tablespoon",base:U.VOLUME,prefixes:B.NONE,value:15e-6,offset:0},drop:{name:"drop",base:U.VOLUME,prefixes:B.NONE,value:5e-8,offset:0},gtt:{name:"gtt",base:U.VOLUME,prefixes:B.NONE,value:5e-8,offset:0},minim:{name:"minim",base:U.VOLUME,prefixes:B.NONE,value:6.161152e-8,offset:0},fluiddram:{name:"fluiddram",base:U.VOLUME,prefixes:B.NONE,value:36966911e-13,offset:0},fluidounce:{name:"fluidounce",base:U.VOLUME,prefixes:B.NONE,value:2957353e-11,offset:0},gill:{name:"gill",base:U.VOLUME,prefixes:B.NONE,value:.0001182941,offset:0},cc:{name:"cc",base:U.VOLUME,prefixes:B.NONE,value:1e-6,offset:0},cup:{name:"cup",base:U.VOLUME,prefixes:B.NONE,value:.0002365882,offset:0},pint:{name:"pint",base:U.VOLUME,prefixes:B.NONE,value:.0004731765,offset:0},quart:{name:"quart",base:U.VOLUME,prefixes:B.NONE,value:.0009463529,offset:0},gallon:{name:"gallon",base:U.VOLUME,prefixes:B.NONE,value:.003785412,offset:0},beerbarrel:{name:"beerbarrel",base:U.VOLUME,prefixes:B.NONE,value:.1173478,offset:0},oilbarrel:{name:"oilbarrel",base:U.VOLUME,prefixes:B.NONE,value:.1589873,offset:0},hogshead:{name:"hogshead",base:U.VOLUME,prefixes:B.NONE,value:.238481,offset:0},fldr:{name:"fldr",base:U.VOLUME,prefixes:B.NONE,value:36966911e-13,offset:0},floz:{name:"floz",base:U.VOLUME,prefixes:B.NONE,value:2957353e-11,offset:0},gi:{name:"gi",base:U.VOLUME,prefixes:B.NONE,value:.0001182941,offset:0},cp:{name:"cp",base:U.VOLUME,prefixes:B.NONE,value:.0002365882,offset:0},pt:{name:"pt",base:U.VOLUME,prefixes:B.NONE,value:.0004731765,offset:0},qt:{name:"qt",base:U.VOLUME,prefixes:B.NONE,value:.0009463529,offset:0},gal:{name:"gal",base:U.VOLUME,prefixes:B.NONE,value:.003785412,offset:0},bbl:{name:"bbl",base:U.VOLUME,prefixes:B.NONE,value:.1173478,offset:0},obl:{name:"obl",base:U.VOLUME,prefixes:B.NONE,value:.1589873,offset:0},g:{name:"g",base:U.MASS,prefixes:B.SHORT,value:.001,offset:0},gram:{name:"gram",base:U.MASS,prefixes:B.LONG,value:.001,offset:0},ton:{name:"ton",base:U.MASS,prefixes:B.SHORT,value:907.18474,offset:0},t:{name:"t",base:U.MASS,prefixes:B.SHORT,value:1e3,offset:0},tonne:{name:"tonne",base:U.MASS,prefixes:B.LONG,value:1e3,offset:0},grain:{name:"grain",base:U.MASS,prefixes:B.NONE,value:6479891e-11,offset:0},dram:{name:"dram",base:U.MASS,prefixes:B.NONE,value:.0017718451953125,offset:0},ounce:{name:"ounce",base:U.MASS,prefixes:B.NONE,value:.028349523125,offset:0},poundmass:{name:"poundmass",base:U.MASS,prefixes:B.NONE,value:.45359237,offset:0},hundredweight:{name:"hundredweight",base:U.MASS,prefixes:B.NONE,value:45.359237,offset:0},stick:{name:"stick",base:U.MASS,prefixes:B.NONE,value:.115,offset:0},stone:{name:"stone",base:U.MASS,prefixes:B.NONE,value:6.35029318,offset:0},gr:{name:"gr",base:U.MASS,prefixes:B.NONE,value:6479891e-11,offset:0},dr:{name:"dr",base:U.MASS,prefixes:B.NONE,value:.0017718451953125,offset:0},oz:{name:"oz",base:U.MASS,prefixes:B.NONE,value:.028349523125,offset:0},lbm:{name:"lbm",base:U.MASS,prefixes:B.NONE,value:.45359237,offset:0},cwt:{name:"cwt",base:U.MASS,prefixes:B.NONE,value:45.359237,offset:0},s:{name:"s",base:U.TIME,prefixes:B.SHORT,value:1,offset:0},min:{name:"min",base:U.TIME,prefixes:B.NONE,value:60,offset:0},h:{name:"h",base:U.TIME,prefixes:B.NONE,value:3600,offset:0},second:{name:"second",base:U.TIME,prefixes:B.LONG,value:1,offset:0},sec:{name:"sec",base:U.TIME,prefixes:B.LONG,value:1,offset:0},minute:{name:"minute",base:U.TIME,prefixes:B.NONE,value:60,offset:0},hour:{name:"hour",base:U.TIME,prefixes:B.NONE,value:3600,offset:0},day:{name:"day",base:U.TIME,prefixes:B.NONE,value:86400,offset:0},week:{name:"week",base:U.TIME,prefixes:B.NONE,value:604800,offset:0},month:{name:"month",base:U.TIME,prefixes:B.NONE,value:2629800,offset:0},year:{name:"year",base:U.TIME,prefixes:B.NONE,value:31557600,offset:0},decade:{name:"decade",base:U.TIME,prefixes:B.NONE,value:315576e3,offset:0},century:{name:"century",base:U.TIME,prefixes:B.NONE,value:315576e4,offset:0},millennium:{name:"millennium",base:U.TIME,prefixes:B.NONE,value:315576e5,offset:0},hertz:{name:"Hertz",base:U.FREQUENCY,prefixes:B.LONG,value:1,offset:0,reciprocal:!0},Hz:{name:"Hz",base:U.FREQUENCY,prefixes:B.SHORT,value:1,offset:0,reciprocal:!0},rad:{name:"rad",base:U.ANGLE,prefixes:B.SHORT,value:1,offset:0},radian:{name:"radian",base:U.ANGLE,prefixes:B.LONG,value:1,offset:0},deg:{name:"deg",base:U.ANGLE,prefixes:B.SHORT,value:null,offset:0},degree:{name:"degree",base:U.ANGLE,prefixes:B.LONG,value:null,offset:0},grad:{name:"grad",base:U.ANGLE,prefixes:B.SHORT,value:null,offset:0},gradian:{name:"gradian",base:U.ANGLE,prefixes:B.LONG,value:null,offset:0},cycle:{name:"cycle",base:U.ANGLE,prefixes:B.NONE,value:null,offset:0},arcsec:{name:"arcsec",base:U.ANGLE,prefixes:B.NONE,value:null,offset:0},arcmin:{name:"arcmin",base:U.ANGLE,prefixes:B.NONE,value:null,offset:0},A:{name:"A",base:U.CURRENT,prefixes:B.SHORT,value:1,offset:0},ampere:{name:"ampere",base:U.CURRENT,prefixes:B.LONG,value:1,offset:0},K:{name:"K",base:U.TEMPERATURE,prefixes:B.NONE,value:1,offset:0},degC:{name:"degC",base:U.TEMPERATURE,prefixes:B.NONE,value:1,offset:273.15},degF:{name:"degF",base:U.TEMPERATURE,prefixes:B.NONE,value:1/1.8,offset:459.67},degR:{name:"degR",base:U.TEMPERATURE,prefixes:B.NONE,value:1/1.8,offset:0},kelvin:{name:"kelvin",base:U.TEMPERATURE,prefixes:B.NONE,value:1,offset:0},celsius:{name:"celsius",base:U.TEMPERATURE,prefixes:B.NONE,value:1,offset:273.15},fahrenheit:{name:"fahrenheit",base:U.TEMPERATURE,prefixes:B.NONE,value:1/1.8,offset:459.67},rankine:{name:"rankine",base:U.TEMPERATURE,prefixes:B.NONE,value:1/1.8,offset:0},mol:{name:"mol",base:U.AMOUNT_OF_SUBSTANCE,prefixes:B.SHORT,value:1,offset:0},mole:{name:"mole",base:U.AMOUNT_OF_SUBSTANCE,prefixes:B.LONG,value:1,offset:0},cd:{name:"cd",base:U.LUMINOUS_INTENSITY,prefixes:B.SHORT,value:1,offset:0},candela:{name:"candela",base:U.LUMINOUS_INTENSITY,prefixes:B.LONG,value:1,offset:0},N:{name:"N",base:U.FORCE,prefixes:B.SHORT,value:1,offset:0},newton:{name:"newton",base:U.FORCE,prefixes:B.LONG,value:1,offset:0},dyn:{name:"dyn",base:U.FORCE,prefixes:B.SHORT,value:1e-5,offset:0},dyne:{name:"dyne",base:U.FORCE,prefixes:B.LONG,value:1e-5,offset:0},lbf:{name:"lbf",base:U.FORCE,prefixes:B.NONE,value:4.4482216152605,offset:0},poundforce:{name:"poundforce",base:U.FORCE,prefixes:B.NONE,value:4.4482216152605,offset:0},kip:{name:"kip",base:U.FORCE,prefixes:B.LONG,value:4448.2216,offset:0},kilogramforce:{name:"kilogramforce",base:U.FORCE,prefixes:B.NONE,value:9.80665,offset:0},J:{name:"J",base:U.ENERGY,prefixes:B.SHORT,value:1,offset:0},joule:{name:"joule",base:U.ENERGY,prefixes:B.SHORT,value:1,offset:0},erg:{name:"erg",base:U.ENERGY,prefixes:B.NONE,value:1e-7,offset:0},Wh:{name:"Wh",base:U.ENERGY,prefixes:B.SHORT,value:3600,offset:0},BTU:{name:"BTU",base:U.ENERGY,prefixes:B.BTU,value:1055.05585262,offset:0},eV:{name:"eV",base:U.ENERGY,prefixes:B.SHORT,value:1602176565e-28,offset:0},electronvolt:{name:"electronvolt",base:U.ENERGY,prefixes:B.LONG,value:1602176565e-28,offset:0},W:{name:"W",base:U.POWER,prefixes:B.SHORT,value:1,offset:0},watt:{name:"watt",base:U.POWER,prefixes:B.LONG,value:1,offset:0},hp:{name:"hp",base:U.POWER,prefixes:B.NONE,value:745.6998715386,offset:0},VAR:{name:"VAR",base:U.POWER,prefixes:B.SHORT,value:w.I,offset:0},VA:{name:"VA",base:U.POWER,prefixes:B.SHORT,value:1,offset:0},Pa:{name:"Pa",base:U.PRESSURE,prefixes:B.SHORT,value:1,offset:0},psi:{name:"psi",base:U.PRESSURE,prefixes:B.NONE,value:6894.75729276459,offset:0},atm:{name:"atm",base:U.PRESSURE,prefixes:B.NONE,value:101325,offset:0},bar:{name:"bar",base:U.PRESSURE,prefixes:B.SHORTLONG,value:1e5,offset:0},torr:{name:"torr",base:U.PRESSURE,prefixes:B.NONE,value:133.322,offset:0},mmHg:{name:"mmHg",base:U.PRESSURE,prefixes:B.NONE,value:133.322,offset:0},mmH2O:{name:"mmH2O",base:U.PRESSURE,prefixes:B.NONE,value:9.80665,offset:0},cmH2O:{name:"cmH2O",base:U.PRESSURE,prefixes:B.NONE,value:98.0665,offset:0},coulomb:{name:"coulomb",base:U.ELECTRIC_CHARGE,prefixes:B.LONG,value:1,offset:0},C:{name:"C",base:U.ELECTRIC_CHARGE,prefixes:B.SHORT,value:1,offset:0},farad:{name:"farad",base:U.ELECTRIC_CAPACITANCE,prefixes:B.LONG,value:1,offset:0},F:{name:"F",base:U.ELECTRIC_CAPACITANCE,prefixes:B.SHORT,value:1,offset:0},volt:{name:"volt",base:U.ELECTRIC_POTENTIAL,prefixes:B.LONG,value:1,offset:0},V:{name:"V",base:U.ELECTRIC_POTENTIAL,prefixes:B.SHORT,value:1,offset:0},ohm:{name:"ohm",base:U.ELECTRIC_RESISTANCE,prefixes:B.SHORTLONG,value:1,offset:0},henry:{name:"henry",base:U.ELECTRIC_INDUCTANCE,prefixes:B.LONG,value:1,offset:0},H:{name:"H",base:U.ELECTRIC_INDUCTANCE,prefixes:B.SHORT,value:1,offset:0},siemens:{name:"siemens",base:U.ELECTRIC_CONDUCTANCE,prefixes:B.LONG,value:1,offset:0},S:{name:"S",base:U.ELECTRIC_CONDUCTANCE,prefixes:B.SHORT,value:1,offset:0},weber:{name:"weber",base:U.MAGNETIC_FLUX,prefixes:B.LONG,value:1,offset:0},Wb:{name:"Wb",base:U.MAGNETIC_FLUX,prefixes:B.SHORT,value:1,offset:0},tesla:{name:"tesla",base:U.MAGNETIC_FLUX_DENSITY,prefixes:B.LONG,value:1,offset:0},T:{name:"T",base:U.MAGNETIC_FLUX_DENSITY,prefixes:B.SHORT,value:1,offset:0},b:{name:"b",base:U.BIT,prefixes:B.BINARY_SHORT,value:1,offset:0},bits:{name:"bits",base:U.BIT,prefixes:B.BINARY_LONG,value:1,offset:0},B:{name:"B",base:U.BIT,prefixes:B.BINARY_SHORT,value:8,offset:0},bytes:{name:"bytes",base:U.BIT,prefixes:B.BINARY_LONG,value:8,offset:0}},P={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=y(_);F.rad.value=new _(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(a),i&&i("config",(function(e,t){e.number!==t.number&&L(e)}));var H={si:{NONE:{unit:q,prefix:B.NONE[""]},LENGTH:{unit:F.m,prefix:B.SHORT[""]},MASS:{unit:F.g,prefix:B.SHORT.k},TIME:{unit:F.s,prefix:B.SHORT[""]},CURRENT:{unit:F.A,prefix:B.SHORT[""]},TEMPERATURE:{unit:F.K,prefix:B.SHORT[""]},LUMINOUS_INTENSITY:{unit:F.cd,prefix:B.SHORT[""]},AMOUNT_OF_SUBSTANCE:{unit:F.mol,prefix:B.SHORT[""]},ANGLE:{unit:F.rad,prefix:B.SHORT[""]},BIT:{unit:F.bits,prefix:B.SHORT[""]},FORCE:{unit:F.N,prefix:B.SHORT[""]},ENERGY:{unit:F.J,prefix:B.SHORT[""]},POWER:{unit:F.W,prefix:B.SHORT[""]},PRESSURE:{unit:F.Pa,prefix:B.SHORT[""]},ELECTRIC_CHARGE:{unit:F.C,prefix:B.SHORT[""]},ELECTRIC_CAPACITANCE:{unit:F.F,prefix:B.SHORT[""]},ELECTRIC_POTENTIAL:{unit:F.V,prefix:B.SHORT[""]},ELECTRIC_RESISTANCE:{unit:F.ohm,prefix:B.SHORT[""]},ELECTRIC_INDUCTANCE:{unit:F.H,prefix:B.SHORT[""]},ELECTRIC_CONDUCTANCE:{unit:F.S,prefix:B.SHORT[""]},MAGNETIC_FLUX:{unit:F.Wb,prefix:B.SHORT[""]},MAGNETIC_FLUX_DENSITY:{unit:F.T,prefix:B.SHORT[""]},FREQUENCY:{unit:F.Hz,prefix:B.SHORT[""]}}};H.cgs=JSON.parse(JSON.stringify(H.si)),H.cgs.LENGTH={unit:F.m,prefix:B.SHORT.c},H.cgs.MASS={unit:F.g,prefix:B.SHORT[""]},H.cgs.FORCE={unit:F.dyn,prefix:B.SHORT[""]},H.cgs.ENERGY={unit:F.erg,prefix:B.NONE[""]},H.us=JSON.parse(JSON.stringify(H.si)),H.us.LENGTH={unit:F.ft,prefix:B.NONE[""]},H.us.MASS={unit:F.lbm,prefix:B.NONE[""]},H.us.TEMPERATURE={unit:F.degF,prefix:B.NONE[""]},H.us.FORCE={unit:F.lbf,prefix:B.NONE[""]},H.us.ENERGY={unit:F.BTU,prefix:B.BTU[""]},H.us.POWER={unit:F.hp,prefix:B.NONE[""]},H.us.PRESSURE={unit:F.psi,prefix:B.NONE[""]},H.auto=JSON.parse(JSON.stringify(H.si));var G=H.auto;for(var Z in M.setUnitSystem=function(e){if(!(0,Xe.nr)(H,e))throw new Error("Unit system "+e+" does not exist. Choices are: "+Object.keys(H).join(", "));G=H[e]},M.getUnitSystem=function(){for(var e in H)if((0,Xe.nr)(H,e)&&H[e]===G)return e},M.typeConverters={BigNumber:function(e){return new _(e+"")},Fraction:function(e){return new N(e)},Complex:function(e){return e},number:function(e){return e}},M._getNumberConverter=function(e){if(!M.typeConverters[e])throw new TypeError('Unsupported type "'+e+'"');return M.typeConverters[e]},F)if((0,Xe.nr)(F,Z)){var W=F[Z];W.dimensions=W.base.dimensions}for(var $ in P)if((0,Xe.nr)(P,$)){var V=F[P[$]],J={};for(var Y in V)(0,Xe.nr)(V,Y)&&(J[Y]=V[Y]);J.name=$,F[$]=J}return M.isValidAlpha=function(e){return/^[a-zA-Z]$/.test(e)},M.createUnit=function(e,t){if("object"!=typeof e)throw new TypeError("createUnit expects first parameter to be of type 'Object'");if(t&&t.override)for(var r in e)if((0,Xe.nr)(e,r)&&M.deleteUnit(r),e[r].aliases)for(var n=0;n<e[r].aliases.length;n++)M.deleteUnit(e[r].aliases[n]);var i;for(var a in e)(0,Xe.nr)(e,a)&&(i=M.createUnitSingle(a,e[a]));return i},M.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((0,Xe.nr)(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&&!M.isValidAlpha(n))throw new Error('Invalid unit name (must begin with alpha character): "'+e+'"');if(t>0&&!M.isValidAlpha(n)&&!A(n))throw new Error('Invalid unit name (only alphanumeric characters are allowed): "'+e+'"')}}(e);var i,a,o,s=null,u=[],c=0;if(t&&"Unit"===t.type)s=t.clone();else if("string"==typeof t)""!==t&&(i=t);else{if("object"!=typeof t)throw new TypeError('Cannot create unit "'+e+'" from "'+t.toString()+'": expecting "string" or "Unit" or "Object"');i=t.definition,a=t.prefixes,c=t.offset,o=t.baseName,t.aliases&&(u=t.aliases.valueOf())}if(u)for(var l=0;l<u.length;l++)if((0,Xe.nr)(F,u[l]))throw new Error('Cannot create alias "'+u[l]+'": a unit with that name already exists');if(i&&"string"==typeof i&&!s)try{s=M.parse(i,{allowNoUnits:!0})}catch(t){throw t.message='Could not create unit "'+e+'" from "'+i+'": '+t.message,t}else i&&"Unit"===i.type&&(s=i.clone());u=u||[],c=c||0,a=a&&a.toUpperCase&&B[a.toUpperCase()]||B.NONE;var f={};if(s){f={name:e,value:s.value,dimensions:s.dimensions.slice(0),prefixes:a,offset:c};var p=!1;for(var d in U)if((0,Xe.nr)(U,d)){for(var h=!0,m=0;m<j.length;m++)if(Math.abs((f.dimensions[m]||0)-(U[d].dimensions[m]||0))>1e-12){h=!1;break}if(h){p=!0,f.base=U[d];break}}if(!p){o=o||e+"_STUFF";var v={dimensions:s.dimensions.slice(0)};v.key=o,U[o]=v,G[o]={unit:f,prefix:B.NONE[""]},f.base=U[o]}}else{if(o=o||e+"_STUFF",j.indexOf(o)>=0)throw new Error('Cannot create new base unit "'+e+'": a base unit with that name already exists (and cannot be overridden)');for(var y in j.push(o),U)(0,Xe.nr)(U,y)&&(U[y].dimensions[j.length-1]=0);for(var g={dimensions:[]},x=0;x<j.length;x++)g.dimensions[x]=0;g.dimensions[j.length-1]=1,g.key=o,U[o]=g,f={name:e,value:1,dimensions:U[o].dimensions.slice(0),prefixes:a,offset:c,base:U[o]},G[o]={unit:f,prefix:B.NONE[""]}}M.UNITS[e]=f;for(var b=0;b<u.length;b++){var w=u[b],_={};for(var N in f)(0,Xe.nr)(f,N)&&(_[N]=f[N]);_.name=w,M.UNITS[w]=_}return delete D.cache,new M(null,e)},M.deleteUnit=function(e){delete M.UNITS[e]},M.PREFIXES=B,M.BASE_DIMENSIONS=j,M.BASE_UNITS=U,M.UNIT_SYSTEMS=H,M.UNITS=F,M}),{isClass:!0}),Zp="createUnit",Wp=["typed","Unit"],$p=(0,i.d5)(Zp,Wp,(e=>{var{typed:t,Unit:r}=e;return t(Zp,{"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,{})}})})),Vp=["config","typed","matrix","addScalar","equal","subtract","abs","atan","cos","sin","multiplyScalar","inv","bignumber","multiply","add"],Jp=(0,i.d5)("eigs",Vp,(e=>{var{config:t,typed:r,matrix:n,addScalar:i,subtract:a,equal:o,abs:s,atan:u,cos:c,sin:l,multiplyScalar:f,inv:p,bignumber:d,multiply:h,add:m}=e;return r("eigs",{Array:function(e){var t=n(e),r=t.size();if(2!==r.length||r[0]!==r[1])throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(r)+")");var i=v(t,r[0]);return{values:i[0],vectors:i[1]}},Matrix:function(e){var t=e.size();if(2!==t.length||t[0]!==t[1])throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");var r=v(e,t[0]);return{values:n(r[0]),vectors:n(r[1])}}});function v(e,r){var n=e.datatype();if(void 0===n&&(n=e.getDataType()),"number"!==n&&"BigNumber"!==n&&"Fraction"!==n)throw"mixed"===n?new TypeError("Mixed matrix element type is not supported"):new TypeError("Matrix element type not supported ("+n+")");if(function(e,t){for(var r=0;r<t;r++)for(var n=r;n<t;n++)if(!o(e[r][n],e[n][r]))throw new TypeError("Input matrix is not symmetric")}(e.toArray(),r),"number"===n)return y(e.toArray());if("Fraction"===n){for(var i=e.toArray(),c=0;c<r;c++)for(var l=c;l<r;l++)i[c][l]=i[c][l].valueOf(),i[l][c]=i[c][l];return y(e.toArray())}return"BigNumber"===n?function(e){for(var r,n=e.length,i=s(t.epsilon/n),o=new Array(n),c=0;c<n;c++)o[c]=M(n,0),o[c][c]=1;for(var l,m,v,y,g=N(e);s(g[1])>=s(i);){var w=g[0][0],_=g[0][1];e=b(e,(l=e[w][w],m=e[_][_],v=e[w][_],y=void 0,y=a(m,l),r=s(y)<=t.epsilon?d(-1).acos().div(4):f(.5,u(h(2,v,p(y))))),w,_),o=x(o,r,w,_),g=N(e)}for(var S=M(n,0),A=0;A<n;A++)S[A]=e[A][A];return E((0,Xe.d9)(S),(0,Xe.d9)(o))}(e.toArray()):void 0}function y(e){for(var r,n=e.length,i=Math.abs(t.epsilon/n),a=new Array(n),o=0;o<n;o++)a[o]=M(n,0),a[o][o]=1;for(var s=_(e);Math.abs(s[1])>=Math.abs(i);){var u=s[0][0],c=s[0][1];e=w(e,(l=e[u][u],f=e[c][c],p=e[u][c],d=void 0,d=f-l,r=Math.abs(d)<=t.epsilon?Math.PI/4:.5*Math.atan(2*p/(f-l))),u,c),a=g(a,r,u,c),s=_(e)}for(var l,f,p,d,h=M(n,0),m=0;m<n;m++)h[m]=e[m][m];return E((0,Xe.d9)(h),(0,Xe.d9)(a))}function g(e,t,r,n){for(var i=e.length,a=Math.cos(t),o=Math.sin(t),s=M(i,0),u=M(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 l=0;l<i;l++)e[l][r]=s[l],e[l][n]=u[l];return e}function x(e,t,r,n){for(var o=e.length,s=c(t),u=l(t),p=M(o,d(0)),h=M(o,d(0)),m=0;m<o;m++)p[m]=a(f(s,e[m][r]),f(u,e[m][n])),h[m]=i(f(u,e[m][r]),f(s,e[m][n]));for(var v=0;v<o;v++)e[v][r]=p[v],e[v][n]=h[v];return e}function b(e,t,r,n){for(var o=e.length,s=d(c(t)),u=d(l(t)),p=f(s,s),v=f(u,u),y=M(o,d(0)),g=M(o,d(0)),x=h(d(2),s,u,e[r][n]),b=i(a(f(p,e[r][r]),x),f(v,e[n][n])),w=m(f(v,e[r][r]),x,f(p,e[n][n])),_=0;_<o;_++)y[_]=a(f(s,e[r][_]),f(u,e[n][_])),g[_]=i(f(u,e[r][_]),f(s,e[n][_]));e[r][r]=b,e[n][n]=w,e[r][n]=d(0),e[n][r]=d(0);for(var N=0;N<o;N++)N!==r&&N!==n&&(e[r][N]=y[N],e[N][r]=y[N],e[n][N]=g[N],e[N][n]=g[N]);return e}function w(e,t,r,n){for(var i=e.length,a=Math.cos(t),o=Math.sin(t),s=a*a,u=o*o,c=M(i,0),l=M(i,0),f=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],d=0;d<i;d++)c[d]=a*e[r][d]-o*e[n][d],l[d]=o*e[r][d]+a*e[n][d];e[r][r]=f,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]=l[h],e[h][n]=l[h]);return e}function _(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],i=0;i<t;i++)for(var a=i+1;a<t;a++)s(r)<s(e[i][a])&&(r=s(e[i][a]),n=[i,a]);return[n,r]}function E(e,t){for(var r=e.length,n=Array(r),i=Array(r),a=0;a<r;a++)i[a]=Array(r);for(var o=0;o<r;o++){for(var s=0,u=e[0],c=0;c<e.length;c++)e[c]<u&&(u=e[s=c]);n[o]=e.splice(s,1)[0];for(var l=0;l<r;l++)i[l][o]=t[l][s],t[l].splice(s,1)}return[(0,Xe.d9)(n),(0,Xe.d9)(i)]}function M(e,t){for(var r=new Array(e),n=0;n<e;n++)r[n]=t;return r}})),Yp=["typed","config","abs","add","addScalar","matrix","multiply","multiplyScalar","divideScalar","subtract","smaller","equalScalar"],Xp=(0,i.d5)("intersect",Yp,(e=>{var{typed:t,config:r,abs:n,add:i,addScalar:a,matrix:o,multiply:s,multiplyScalar:u,divideScalar:l,subtract:f,smaller:p,equalScalar:d}=e;return t("intersect",{"Array, Array, Array":function(e,t,r){if(!v(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!v(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!function(e){return 4===e.length&&h(e[0])&&h(e[1])&&h(e[2])&&h(e[3])}(r))throw new TypeError("Array with 4 numbers expected as third argument");return function(e,t,r,n,i,o,s,c,p,d){var h=u(e,s),m=u(n,s),v=u(t,c),y=u(i,c),g=u(r,p),x=u(o,p),b=l(f(f(f(d,h),v),g),f(f(f(a(a(m,y),x),h),v),g));return[a(e,u(b,f(n,e))),a(t,u(b,f(i,t))),a(r,u(b,f(o,r)))]}(e[0],e[1],e[2],t[0],t[1],t[2],r[0],r[1],r[2],r[3])},"Array, Array, Array, Array":function(e,t,o,c){if(2===e.length){if(!m(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!m(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!m(o))throw new TypeError("Array with 2 numbers or BigNumbers expected for third argument");if(!m(c))throw new TypeError("Array with 2 numbers or BigNumbers expected for fourth argument");return function(e,t,o,c){var d=e,h=o,m=f(d,t),v=f(h,c),y=f(u(m[0],v[1]),u(v[0],m[1]));if(p(n(y),r.epsilon))return null;var g=u(v[0],d[1]),x=u(v[1],d[0]),b=u(v[0],h[1]),w=u(v[1],h[0]),_=l(a(f(f(g,x),b),w),y);return i(s(m,_),d)}(e,t,o,c)}if(3===e.length){if(!v(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!v(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!v(o))throw new TypeError("Array with 3 numbers or BigNumbers expected for third argument");if(!v(c))throw new TypeError("Array with 3 numbers or BigNumbers expected for fourth argument");return h=e[0],g=e[1],x=e[2],b=t[0],w=t[1],_=t[2],N=o[0],E=o[1],M=o[2],k=y(h,N,S=c[0],N,g,E,A=c[1],E,x,M,O=c[2],M),T=y(S,N,b,h,A,E,w,g,O,M,_,x),C=y(h,N,b,h,g,E,w,g,x,M,_,x),I=y(S,N,S,N,A,E,A,E,O,M,O,M),D=y(b,h,b,h,w,g,w,g,_,x,_,x),z=l(f(u(k,T),u(C,I)),f(u(D,I),u(T,T))),B=l(a(k,u(z,T)),I),j=a(h,u(z,f(b,h))),U=a(g,u(z,f(w,g))),R=a(x,u(z,f(_,x))),q=a(N,u(B,f(S,N))),F=a(E,u(B,f(A,E))),P=a(M,u(B,f(O,M))),d(j,q)&&d(U,F)&&d(R,P)?[j,U,R]:null}throw new TypeError("Arrays with two or thee dimensional points expected");var h,g,x,b,w,_,N,E,M,S,A,O,k,T,C,I,D,z,B,j,U,R,q,F,P},"Matrix, Matrix, Matrix":function(e,t,r){return o(this(e.valueOf(),t.valueOf(),r.valueOf()))},"Matrix, Matrix, Matrix, Matrix":function(e,t,r,n){return o(this(e.valueOf(),t.valueOf(),r.valueOf(),n.valueOf()))}});function h(e){return"number"==typeof e||(0,c.l9)(e)}function m(e){return 2===e.length&&h(e[0])&&h(e[1])}function v(e){return 3===e.length&&h(e[0])&&h(e[1])&&h(e[2])}function y(e,t,r,n,i,o,s,c,l,p,d,h){var m=u(f(e,t),f(r,n)),v=u(f(i,o),f(s,c)),y=u(f(l,p),f(d,h));return a(a(m,v),y)}})),Qp="usolve",Kp=["typed","matrix","divideScalar","multiplyScalar","subtract","equalScalar","DenseMatrix"],ed=(0,i.d5)(Qp,Kp,(e=>{var{typed:t,matrix:r,divideScalar:n,multiplyScalar:i,subtract:a,equalScalar:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(Qp,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){for(var r=(t=u(e,t,!0))._data,c=e._size[0],l=e._size[1],f=e._values,p=e._index,d=e._ptr,h=[],m=l-1;m>=0;m--){var v=r[m][0]||0;if(o(v,0))h[m]=[0];else{for(var y=0,g=[],x=[],b=d[m],w=d[m+1]-1;w>=b;w--){var _=p[w];_===m?y=f[w]:_<m&&(g.push(f[w]),x.push(_))}if(o(y,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var N=n(v,y),E=0,M=x.length;E<M;E++){var S=x[E];r[S]=[a(r[S][0],i(N,g[E]))]}h[m]=[N]}}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],l=e._size[1],f=[],p=e._data,d=l-1;d>=0;d--){var h=r[d][0]||0,m=void 0;if(o(h,0))m=0;else{var v=p[d][d];if(o(v,0))throw new Error("Linear system cannot be solved since matrix is singular");m=n(h,v);for(var y=d-1;y>=0;y--)r[y]=[a(r[y][0]||0,i(m,p[y][d]))]}f[d]=[m]}return new s({data:f,size:[c,1]})}})),td="norm",rd=["typed","abs","add","pow","conj","sqrt","multiply","equalScalar","larger","smaller","matrix","ctranspose","eigs"],nd=(0,i.d5)(td,rd,(e=>{var{typed:t,abs:r,add:n,pow:i,conj:a,sqrt:o,multiply:s,equalScalar:u,larger:c,smaller:l,matrix:f,ctranspose:p,eigs:d}=e;return t(td,{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 h(f(e),2)},Matrix:function(e){return h(e,2)},"number | Complex | BigNumber | boolean, number | BigNumber | string":function(e){return this(e)},"Array, number | BigNumber | string":function(e,t){return h(f(e),t)},"Matrix, number | BigNumber | string":function(e,t){return h(e,t)}});function h(e,t){var f=e.size();if(1===f.length)return function(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&&!l(n,t)||(t=n)}),!0),t||0}(e);if("fro"===t)return h(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")}(e,t);if(2===f.length){if(f[0]&&f[1])return function(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=d(i).values,u=a.get([a.size()[0]-1]);return r(o(u))}(e);throw new Error("Unsupported parameter value "+t)}(e,t);throw new RangeError("Invalid matrix dimensions")}}}));function id(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 ad="lusolve",od=["typed","matrix","lup","slu","usolve","lsolve","DenseMatrix"],sd=(0,i.d5)(ad,od,(e=>{var{typed:t,matrix:r,lup:n,slu:i,usolve:a,lsolve:o,DenseMatrix:s}=e,u=vf({DenseMatrix:s});return t(ad,{"Array, Array | Matrix":function(e,t){e=r(e);var i=n(e);return f(i.L,i.U,i.p,null,t).valueOf()},"DenseMatrix, Array | Matrix":function(e,t){var r=n(e);return f(r.L,r.U,r.p,null,t)},"SparseMatrix, Array | Matrix":function(e,t){var r=n(e);return f(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 f(a.L,a.U,a.p,a.q,t)},"Object, Array | Matrix":function(e,t){return f(e.L,e.U,e.p,e.q,t)}});function l(e){if((0,c.SW)(e))return e;if((0,c.kJ)(e))return r(e);throw new TypeError("Invalid Matrix LU decomposition")}function f(e,t,r,n,i){e=l(e),t=l(t),r&&((i=u(e,i,!0))._data=id(r,i._data));var s=o(e,i),c=a(t,s);return n&&(c._data=id(n,c._data)),c}})),ud="sqrtm",cd=["typed","abs","add","multiply","sqrt","subtract","inv","size","max","identity"],ld=(0,i.d5)(ud,cd,(e=>{var{typed:t,abs:r,add:n,multiply:i,sqrt:a,subtract:o,inv:s,size:u,max:l,identity:f}=e,p=1e-6;function d(e){var t,a=0,c=e,d=f(u(e));do{var h=c;if(c=i(.5,n(h,s(d))),d=i(.5,n(d,s(h))),(t=l(r(o(c,h))))>p&&++a>1e3)throw new Error("computing square root of matrix: iterative method could not converge")}while(t>p);return c}return t(ud,{"Array | Matrix":function(e){var t=(0,c.SW)(e)?e.size():(0,Je.aJ)(e);switch(t.length){case 1:if(1===t[0])return a(e);throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");case 2:if(t[0]===t[1])return d(e);throw new RangeError("Matrix must be square (size: "+(0,Ye.WU)(t)+")");default:throw new RangeError("Matrix must be at most two dimensional (size: "+(0,Ye.WU)(t)+")")}}})})),fd="multinomial",pd=["typed","add","divide","multiply","factorial","isInteger","isPositive"],dd=(0,i.d5)(fd,pd,(e=>{var{typed:t,add:r,divide:n,multiply:i,factorial:a,isInteger:o,isPositive:s}=e;return t(fd,{"Array | Matrix":function(e){var t=0,u=1;return(0,ut.Et)(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)}})})),hd="rotationMatrix",md=["typed","config","multiplyScalar","addScalar","unaryMinus","norm","matrix","BigNumber","DenseMatrix","SparseMatrix","cos","sin"],vd=(0,i.d5)(hd,md,(e=>{var{typed:t,config:r,multiplyScalar:n,addScalar:i,unaryMinus:a,norm:o,BigNumber:s,matrix:u,DenseMatrix:l,SparseMatrix:f,cos:p,sin:d}=e;return t(hd,{"":function(){return"Matrix"===r.matrix?u([]):[]},string:function(e){return u(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=u(t);return m(r),g(e,r,void 0)},"number | BigNumber | Complex | Unit, Matrix":function(e,t){m(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=u(t);return m(n),g(e,n,r)},"number | BigNumber | Complex | Unit, Matrix, string":function(e,t,r){return m(t),g(e,t,r)}});function h(e,t){var r=(0,c.l9)(e)?new s(-1):-1,i=p(e),a=d(e);return y([[i,n(r,a)],[a,i]],t)}function m(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(((e,t)=>n(e,t)))}function y(e,t){if(t){if("sparse"===t)return new f(e);if("dense"===t)return new l(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 u=(0,c.l9)(e)?s:null,l=u?new u(1):1,f=u?new u(-1):-1,h=u?new u(t.get([0])/n):t.get([0])/n,m=u?new u(t.get([1])/n):t.get([1])/n,g=u?new u(t.get([2])/n):t.get([2])/n,x=p(e),b=i(l,a(x)),w=d(e);return y([[i(x,v([h,h,b])),i(v([h,m,b]),v([f,g,w])),i(v([h,g,b]),v([m,w]))],[i(v([h,m,b]),v([g,w])),i(x,v([m,m,b])),i(v([m,g,b]),v([f,h,w]))],[i(v([h,g,b]),v([f,m,w])),i(v([m,g,b]),v([h,w])),i(x,v([g,g,b]))]],r)}})),yd="median",gd=["typed","add","divide","compare","partitionSelect"],xd=(0,i.d5)(yd,gd,(e=>{var{typed:t,add:r,divide:n,compare:i,partitionSelect:a}=e;function o(e){try{var t=(e=(0,Je.xH)(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 l=a(e,(t-1)/2);return s(l)}catch(e){throw(0,Ul.x)(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(yd,{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("median(A, dim) is not yet supported")},"...":function(e){if((0,ut.CQ)(e))throw new TypeError("Scalar values expected in function median");return o(e)}})})),bd="rotate",wd=["typed","multiply","rotationMatrix"],_d=(0,i.d5)(bd,wd,(e=>{var{typed:t,multiply:r,rotationMatrix:n}=e;return t(bd,{"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)?(0,Je.aJ)(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))}})),Nd=["typed","abs","map","median","subtract"],Ed=(0,i.d5)("mad",Nd,(e=>{var{typed:t,abs:r,map:n,median:i,subtract:a}=e;return t("mad",{"Array | Matrix":o,"...":function(e){return o(e)}});function o(e){if(0===(e=(0,Je.xH)(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")):(0,Ul.x)(e,"mad")}}})),Md="unit",Sd=["typed","Unit"],Ad=(0,i.d5)(Md,Sd,(e=>{var{typed:t,Unit:r}=e;return t(Md,{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(0,ut.Fh)(e,this)}})})),Od=r(7773),kd=r(7592),Td=r(7238),Cd=r(3685),Id=r(7726),Dd=r(1598),zd=r(2349),Bd=r(8911),jd=r(7797),Ud=r(6012),Rd=r(8980),qd=r(7359),Fd=r(4723),Pd=o({}),Ld=f({}),Hd=d({}),Gd=E({}),Zd=M({}),Wd=N({}),$d=H({config:n.v}),Vd=Z({}),Jd=$({}),Yd=R({Complex:Ld}),Xd=D({BigNumber:$d,config:n.v}),Qd=B({BigNumber:$d,config:n.v}),Kd=A({BigNumber:$d,config:n.v}),eh=O({BigNumber:$d,config:n.v}),th=j({BigNumber:$d,config:n.v}),rh=k({BigNumber:$d,config:n.v}),nh=_e({BigNumber:$d,config:n.v}),ih=de({BigNumber:$d,config:n.v}),ah=Ie({BigNumber:$d,config:n.v}),oh=we({BigNumber:$d,config:n.v}),sh=Ve({}),uh=T({BigNumber:$d,config:n.v}),ch=S({BigNumber:$d,config:n.v}),lh=z({BigNumber:$d,config:n.v}),fh=q({}),ph=et({Matrix:Vd}),dh=C({BigNumber:$d,config:n.v}),hh=it({BigNumber:$d,Complex:Ld,DenseMatrix:ph,Fraction:sh}),mh=ft({typed:hh}),vh=ht({typed:hh}),yh=_t({typed:hh}),gh=Mt({typed:hh}),xh=kt({config:n.v,typed:hh}),bh=Ct({typed:hh}),wh=zt({typed:hh}),_h=jt({Complex:Ld,typed:hh}),Nh=qt({typed:hh}),Eh=pr({BigNumber:$d,config:n.v,typed:hh}),Mh=(0,Od.j)({isInteger:mh,typed:hh}),Sh=mr({typed:hh}),Ah=gr({Complex:Ld,typed:hh}),Oh=wr({Complex:Ld,config:n.v,typed:hh}),kh=Nr({typed:hh}),Th=Sr({BigNumber:$d,Fraction:sh,complex:_h,typed:hh}),Ch=kr({typed:hh}),Ih=Vr({typed:hh}),Dh=Yr({typed:hh}),zh=Qr({typed:hh}),Bh=on({typed:hh}),jh=un({typed:hh}),Uh=pn({typed:hh}),Rh=mn({typed:hh}),qh=gn({typed:hh}),Fh=Sn({typed:hh}),Ph=An({format:Fh,typed:hh}),Lh=Tn({typed:hh}),Hh=zn({typed:hh}),Gh=Un({Complex:Ld,config:n.v,typed:hh}),Zh=ni({BigNumber:$d,typed:hh}),Wh=oi({BigNumber:$d,Complex:Ld,config:n.v,typed:hh}),$h=ci({BigNumber:$d,Complex:Ld,config:n.v,typed:hh}),Vh=pi({Complex:Ld,config:n.v,typed:hh}),Jh=hi({typed:hh}),Yh=yi({Complex:Ld,config:n.v,typed:hh}),Xh=bi({typed:hh}),Qh=Ni({BigNumber:$d,typed:hh}),Kh=Si({BigNumber:$d,typed:hh}),em=ki({BigNumber:$d,typed:hh}),tm=Ii({typed:hh}),rm=zi({typed:hh}),nm=qi({typed:hh}),im=Zi({config:n.v,typed:hh}),am=Ji({config:n.v,typed:hh}),om=I({BigNumber:$d,config:n.v}),sm=Qi({typed:hh}),um=ta({isNumeric:vh,typed:hh}),cm=ia({typed:hh}),lm=sa({typed:hh}),fm=ca({Fraction:sh,typed:hh}),pm=pa({typed:hh}),dm=ma({typed:hh}),hm=ya({typed:hh}),mm=ba({Complex:Ld,config:n.v,typed:hh}),vm=_a({Complex:Ld,config:n.v,typed:hh}),ym=Ma({typed:hh}),gm=Oa({typed:hh}),xm=Ca({isNaN:gh,isNumeric:vh,typed:hh}),bm=Ia({format:Fh,typed:hh}),wm=Ba({Complex:Ld,config:n.v,typed:hh}),_m=Ra({BigNumber:$d,typed:hh}),Nm=Fa({typed:hh}),Em=La({typed:hh}),Mm=Ga({BigNumber:$d,typed:hh}),Sm=Wa({typed:hh}),Am=Ja({typed:hh}),Om=Ka({config:n.v,typed:hh}),km=U({BigNumber:$d,config:n.v}),Tm=ro({typed:hh}),Cm=io({Matrix:Vd,equalScalar:xh,typed:hh}),Im=so({DenseMatrix:ph,Matrix:Vd,SparseMatrix:Cm,typed:hh}),Dm=lo({BigNumber:$d,Complex:Ld,Fraction:sh,config:n.v,isNegative:Tm,matrix:Im,typed:hh,unaryMinus:pm}),zm=No({BigNumber:$d,DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh}),Bm=Bo({DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh}),jm=Fo({BigNumber:$d,equalScalar:xh,matrix:Im,typed:hh}),Um=Ho({BigNumber:$d,config:n.v,matrix:Im,typed:hh}),Rm=Wo({equalScalar:xh,matrix:Im,typed:hh}),qm=Xo({DenseMatrix:ph,matrix:Im,typed:hh}),Fm=Ko({DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh}),Pm=(0,kd.k)({isInteger:mh,matrix:Im,typed:hh}),Lm=rs({DenseMatrix:ph,SparseMatrix:Cm,matrix:Im,typed:hh}),Hm=as({BigNumber:$d,DenseMatrix:ph,SparseMatrix:Cm,config:n.v,matrix:Im,typed:hh}),Gm=ss({BigNumber:$d,config:n.v,matrix:Im,typed:hh}),Zm=ls({isInteger:mh,matrix:Im,typed:hh}),Wm=hs({matrix:Im,config:n.v,typed:hh}),$m=(0,Td.q)({matrix:Im,typed:hh}),Vm=ys({BigNumber:$d,config:n.v,matrix:Im,typed:hh}),Jm=gs({format:Fh,typed:hh}),Ym=Ms({BigNumber:$d,DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh,zeros:Vm}),Xm=Cs({DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh,zeros:Vm}),Qm=zs({DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh,zeros:Vm}),Km=Us({BigNumber:$d,DenseMatrix:ph,Fraction:sh,config:n.v,equalScalar:xh,matrix:Im,typed:hh}),ev=Fs({matrix:Im,typed:hh}),tv=Hs({DenseMatrix:ph,config:n.v,matrix:Im,typed:hh}),rv=Ws({DenseMatrix:ph,config:n.v,matrix:Im,typed:hh}),nv=Js({DenseMatrix:ph,config:n.v,equalScalar:xh,matrix:Im,typed:hh}),iv=Xs({DenseMatrix:ph,smaller:tv}),av=Ks({larger:rv,smaller:tv}),ov=ru({SparseMatrix:Cm,typed:hh}),sv=au({BigNumber:$d,Complex:Ld,config:n.v,typed:hh}),uv=lu({BigNumber:$d,DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh}),cv=pu({BigNumber:$d,typed:hh}),lv=hu({DenseMatrix:ph,SparseMatrix:Cm,addScalar:dm,equalScalar:xh,matrix:Im,typed:hh}),fv=vu({addScalar:dm,conj:ym,multiplyScalar:kh,size:Wm,typed:hh}),pv=xu({addScalar:dm,combinations:nm,isInteger:mh,isNegative:Tm,isPositive:yh,larger:rv,typed:hh}),dv=_u({typed:hh}),hv=Eu({typed:hh}),mv=Su({config:n.v,equalScalar:xh,matrix:Im,round:Ym,typed:hh}),vv=ku({addScalar:dm,dot:fv,equalScalar:xh,matrix:Im,multiplyScalar:kh,typed:hh}),yv=Iu({equalScalar:xh,matrix:Im,multiplyScalar:kh,typed:hh}),gv=zu({typed:hh}),xv=Uu({matrix:Im,typed:hh}),bv=Fu({config:n.v,matrix:Im}),wv=Hu({matrix:Im,typed:hh}),_v=Zu({matrix:Im,typed:hh}),Nv=$u({Complex:Ld,config:n.v,fraction:fm,identity:Hm,matrix:Im,multiply:vv,number:bh,typed:hh}),Ev=Yu({DenseMatrix:ph,equalScalar:xh,matrix:Im,pow:Nv,typed:hh}),Mv=Ku({DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh,zeros:Vm}),Sv=nc({compare:Km,typed:hh}),Av=oc({compareText:ev,isZero:dv,typed:hh}),Ov=cc({DenseMatrix:ph,config:n.v,matrix:Im,typed:hh}),kv=pc({compare:Km,isNaN:gh,isNumeric:vh,typed:hh}),Tv=hc({ImmutableDenseMatrix:iv}),Cv=yc({BigNumber:$d,Complex:Ld,config:n.v,typed:hh}),Iv=xc({typed:hh}),Dv=_c({DenseMatrix:ph,Index:Tv,compareNatural:Sv,size:Wm,subset:$m,typed:hh}),zv=Mc({DenseMatrix:ph,Index:Tv,compareNatural:Sv,size:Wm,subset:$m,typed:hh}),Bv=Oc({Index:Tv,compareNatural:Sv,size:Wm,subset:$m,typed:hh}),jv=Cc({compareNatural:Sv,typed:hh}),Uv=Dc({add:lv,matrix:Im,typed:hh}),Rv=Bc({add:lv,compare:Km,multiply:vv,partitionSelect:kv,typed:hh}),qv=Pc({BigNumber:$d,Complex:Ld,config:n.v,multiplyScalar:kh,pow:Nv,typed:hh}),Fv=Hc({BigNumber:$d,typed:hh}),Pv=Zc({equalScalar:xh,matrix:Im,typed:hh}),Lv=Vc({DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh}),Hv=Xc({matrix:Im,multiplyScalar:kh,typed:hh}),Gv=Kc({matrix:Im,typed:hh}),Zv=tl({bignumber:Fv,fraction:fm,number:bh}),Wv=nl({equalScalar:xh,matrix:Im,not:Bh,typed:hh,zeros:Vm}),$v=ol({DenseMatrix:ph,config:n.v,matrix:Im,typed:hh}),Vv=cl({compare:Km,compareNatural:Sv,matrix:Im,typed:hh}),Jv=(0,Cd.D)({config:n.v,numeric:Zv,smaller:tv,typed:hh}),Yv=fl({BigNumber:$d,typed:hh}),Xv=hl({DenseMatrix:ph,Index:Tv,compareNatural:Sv,size:Wm,subset:$m,typed:hh}),Qv=yl({Index:Tv,compareNatural:Sv,size:Wm,subset:$m,typed:hh}),Kv=bl({Index:Tv,typed:hh}),ey=(0,Id.O)({add:lv,config:n.v,numeric:Zv,typed:hh}),ty=Nl({gamma:qv,typed:hh}),ry=Sl({factorial:ty,typed:hh}),ny=kl({config:n.v,equalScalar:xh,matrix:Im,round:Ym,typed:hh}),iy=Il({DenseMatrix:ph,addScalar:dm,equalScalar:xh,matrix:Im,typed:hh,unaryMinus:pm}),ay=jl({matrix:Im,multiply:vv,subtract:iy,typed:hh}),oy=(0,Dd.M)({bignumber:Fv,matrix:Im,config:n.v,larger:rv,largerEq:Ov,smaller:tv,smallerEq:$v,typed:hh}),sy=(0,zd.v)({Index:Tv,matrix:Im,range:oy,typed:hh}),uy=Fl({config:n.v,multiplyScalar:kh,numeric:Zv,typed:hh}),cy=Hl({DenseMatrix:ph,equalScalar:xh,matrix:Im,typed:hh}),ly=(0,Bd.J)({config:n.v,larger:rv,numeric:Zv,typed:hh}),fy=Wl({DenseMatrix:ph,Index:Tv,compareNatural:Sv,size:Wm,subset:$m,typed:hh}),py=Jl({Index:Tv,concat:Pm,setDifference:Dv,size:Wm,subset:$m,typed:hh}),dy=Xl({Complex:Ld,ceil:ny,floor:mv,matrix:Im,typed:hh}),hy=(0,jd.w)({Index:Tv,matrix:Im,range:oy,typed:hh}),my=(0,Ud.J)({matrix:Im,number:bh,subtract:iy,typed:hh}),vy=ef({conj:ym,transpose:Gv,typed:hh}),yy=nf({equal:cy,typed:hh}),gy=sf({Index:Tv,compareNatural:Sv,size:Wm,subset:$m,typed:hh}),xy=cf({DenseMatrix:ph,matrix:Im,typed:hh}),by=pf({numeric:Zv,typed:hh}),wy=mf({Complex:Ld,config:n.v,divideScalar:by,typed:hh}),_y=xf({DenseMatrix:ph,divideScalar:by,equalScalar:xh,matrix:Im,multiplyScalar:kh,subtract:iy,typed:hh}),Ny=_f({DenseMatrix:ph,divideScalar:by,equalScalar:xh,matrix:Im,multiplyScalar:kh,subtract:iy,typed:hh}),Ey=Ef({FibonacciHeap:av,addScalar:dm,equalScalar:xh}),My=Af({Index:Tv,concat:Pm,setIntersect:zv,setSymDifference:py,size:Wm,subset:$m,typed:hh}),Sy=kf({DenseMatrix:ph,Spa:Ey,SparseMatrix:Cm,abs:hv,addScalar:dm,divideScalar:by,equalScalar:xh,larger:rv,matrix:Im,multiplyScalar:kh,subtract:iy,typed:hh,unaryMinus:pm}),Ay=Vf({SparseMatrix:Cm,abs:hv,add:lv,divideScalar:by,larger:rv,largerEq:Ov,multiply:vv,subtract:iy,transpose:Gv,typed:hh}),Oy=Yf({lup:Sy,matrix:Im,multiply:vv,subtract:iy,typed:hh,unaryMinus:pm}),ky=Kf({abs:hv,addScalar:dm,divideScalar:by,multiplyScalar:kh,sqrt:vm,subtract:iy,typed:hh,unaryMinus:pm}),Ty=rp({addScalar:dm,combinations:nm,divideScalar:by,factorial:ty,isInteger:mh,isNegative:Tm,larger:rv,multiplyScalar:kh,pow:Nv,subtract:iy,typed:hh}),Cy=ap({addScalar:dm,combinations:nm,divideScalar:by,isInteger:mh,isNegative:Tm,multiplyScalar:kh,typed:hh}),Iy=up({prod:uy,size:Wm,typed:hh}),Dy=lp({Complex:Ld,config:n.v,divideScalar:by,typed:hh}),zy=dp({DenseMatrix:ph,divideScalar:by,equalScalar:xh,matrix:Im,typed:hh}),By=vp({DenseMatrix:ph,divideScalar:by,equalScalar:xh,matrix:Im,multiplyScalar:kh,subtract:iy,typed:hh}),jy=xp({abs:hv,addScalar:dm,divideScalar:by,isPositive:yh,multiplyScalar:kh,smaller:tv,sqrt:vm,typed:hh}),Uy=_p({addScalar:dm,complex:_h,conj:ym,divideScalar:by,equal:cy,identity:Hm,isZero:dv,matrix:Im,multiplyScalar:kh,sign:Th,sqrt:vm,subtract:iy,typed:hh,unaryMinus:pm,zeros:Vm}),Ry=Ep({abs:hv,addScalar:dm,det:Oy,divideScalar:by,identity:Hm,matrix:Im,multiply:vv,typed:hh,unaryMinus:pm}),qy=Ap({abs:hv,add:lv,identity:Hm,inv:Ry,multiply:vv,typed:hh}),Fy=kp({divideScalar:by,equalScalar:xh,inv:Ry,matrix:Im,multiply:vv,typed:hh}),Py=(0,Rd.Q)({add:lv,divide:Fy,typed:hh}),Ly=(0,qd.F)({add:lv,apply:Mh,divide:Fy,isNaN:gh,multiply:vv,subtract:iy,typed:hh}),Hy=Ip({divide:Fy,dotDivide:zy,isNumeric:vh,log:Dy,matrix:Im,multiply:vv,sum:ey,typed:hh}),Gy=Bp({addScalar:dm,isInteger:mh,isNegative:Tm,stirlingS2:Ty,typed:hh}),Zy=Rp({Complex:Ld,config:n.v,divideScalar:by,log:Dy,typed:hh}),Wy=Gp({BigNumber:$d,Complex:Ld,Fraction:sh,abs:hv,addScalar:dm,config:n.v,divideScalar:by,equal:cy,fix:dy,format:Fh,isNumeric:vh,multiplyScalar:kh,number:bh,pow:Nv,round:Ym,subtract:iy}),$y=$p({Unit:Wy,typed:hh}),Vy=Jp({abs:hv,add:lv,addScalar:dm,atan:Jh,bignumber:Fv,config:n.v,cos:Em,equal:cy,inv:Ry,matrix:Im,multiply:vv,multiplyScalar:kh,sin:Sm,subtract:iy,typed:hh}),Jy=Xp({abs:hv,add:lv,addScalar:dm,config:n.v,divideScalar:by,equalScalar:xh,matrix:Im,multiply:vv,multiplyScalar:kh,smaller:tv,subtract:iy,typed:hh}),Yy=(0,Fd.X)({sqrt:vm,typed:hh,variance:Ly}),Xy=Ne({BigNumber:$d,Unit:Wy,config:n.v}),Qy=ne({BigNumber:$d,Unit:Wy,config:n.v}),Ky=Me({BigNumber:$d,Unit:Wy,config:n.v}),eg=ie({BigNumber:$d,Unit:Wy,config:n.v}),tg=ve({BigNumber:$d,Unit:Wy,config:n.v}),rg=fe({BigNumber:$d,Unit:Wy,config:n.v}),ng=Se({BigNumber:$d,Unit:Wy,config:n.v}),ig=Ae({BigNumber:$d,Unit:Wy,config:n.v}),ag=J({BigNumber:$d,Unit:Wy,config:n.v}),og=he({BigNumber:$d,Unit:Wy,config:n.v}),sg=ue({BigNumber:$d,Unit:Wy,config:n.v}),ug=Q({BigNumber:$d,Unit:Wy,config:n.v}),cg=je({BigNumber:$d,Unit:Wy,config:n.v}),lg=Te({BigNumber:$d,Unit:Wy,config:n.v}),fg=ye({BigNumber:$d,Unit:Wy,config:n.v}),pg=Le({BigNumber:$d,Unit:Wy,config:n.v}),dg=qe({BigNumber:$d,Unit:Wy,config:n.v}),hg=He({BigNumber:$d,Unit:Wy,config:n.v}),mg=me({BigNumber:$d,Unit:Wy,config:n.v}),vg=X({BigNumber:$d,Unit:Wy,config:n.v}),yg=De({BigNumber:$d,Unit:Wy,config:n.v}),gg=ze({BigNumber:$d,Unit:Wy,config:n.v}),xg=ee({BigNumber:$d,Unit:Wy,config:n.v}),bg=ed({DenseMatrix:ph,divideScalar:by,equalScalar:xh,matrix:Im,multiplyScalar:kh,subtract:iy,typed:hh}),wg=nd({abs:hv,add:lv,conj:ym,ctranspose:vy,eigs:Vy,equalScalar:xh,larger:rv,matrix:Im,multiply:vv,pow:Nv,smaller:tv,sqrt:vm,typed:hh}),_g=sd({DenseMatrix:ph,lsolve:_y,lup:Sy,matrix:Im,slu:Ay,typed:hh,usolve:bg}),Ng=ld({abs:hv,add:lv,identity:Hm,inv:Ry,max:ly,multiply:vv,size:Wm,sqrt:vm,subtract:iy,typed:hh}),Eg=dd({add:lv,divide:Fy,factorial:ty,isInteger:mh,isPositive:yh,multiply:vv,typed:hh}),Mg=Ee({BigNumber:$d,Unit:Wy,config:n.v}),Sg=le({BigNumber:$d,Unit:Wy,config:n.v}),Ag=K({BigNumber:$d,Unit:Wy,config:n.v}),Og=pe({BigNumber:$d,Unit:Wy,config:n.v}),kg=Re({BigNumber:$d,Unit:Wy,config:n.v}),Tg=Oe({BigNumber:$d,Unit:Wy,config:n.v}),Cg=Ue({BigNumber:$d,Unit:Wy,config:n.v}),Ig=se({BigNumber:$d,Unit:Wy,config:n.v}),Dg=Fe({BigNumber:$d,Unit:Wy,config:n.v}),zg=ge({BigNumber:$d,Unit:Wy,config:n.v}),Bg=V({BigNumber:$d,Unit:Wy,config:n.v}),jg=Be({BigNumber:$d,Unit:Wy,config:n.v}),Ug=vd({BigNumber:$d,DenseMatrix:ph,SparseMatrix:Cm,addScalar:dm,config:n.v,cos:Em,matrix:Im,multiplyScalar:kh,norm:wg,sin:Sm,typed:hh,unaryMinus:pm}),Rg=xd({add:lv,compare:Km,divide:Fy,partitionSelect:kv,typed:hh}),qg=ce({BigNumber:$d,Unit:Wy,config:n.v}),Fg=re({BigNumber:$d,Unit:Wy,config:n.v}),Pg=ae({BigNumber:$d,Unit:Wy,config:n.v}),Lg=Ce({BigNumber:$d,Unit:Wy,config:n.v}),Hg=Pe({BigNumber:$d,Unit:Wy,config:n.v}),Gg=be({BigNumber:$d,Unit:Wy,config:n.v}),Zg=_d({multiply:vv,rotationMatrix:Ug,typed:hh}),Wg=Ed({abs:hv,map:Rh,median:Rg,subtract:iy,typed:hh}),$g=te({BigNumber:$d,Unit:Wy,config:n.v}),Vg=oe({BigNumber:$d,Unit:Wy,config:n.v}),Jg=xe({BigNumber:$d,Unit:Wy,config:n.v}),Yg=Ad({Unit:Wy,typed:hh}),Xg=ke({BigNumber:$d,Unit:Wy,config:n.v}),Qg=Y({BigNumber:$d,Unit:Wy,config:n.v})},4961:(e,t,r)=>{"use strict";function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.actual=e,this.expected=t,this.relation=r,this.message="Dimension mismatch ("+(Array.isArray(e)?"["+e.join(", ")+"]":e)+" "+(this.relation||"!=")+" "+(Array.isArray(t)?"["+t.join(", ")+"]":t)+")",this.stack=(new Error).stack}r.d(t,{m:()=>n}),n.prototype=new RangeError,n.prototype.constructor=RangeError,n.prototype.name="DimensionError",n.prototype.isDimensionError=!0},1647:(e,t,r)=>{"use strict";function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.index=e,arguments.length<3?(this.min=0,this.max=t):(this.min=t,this.max=r),void 0!==this.min&&this.index<this.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}r.d(t,{c:()=>n}),n.prototype=new RangeError,n.prototype.constructor=RangeError,n.prototype.name="IndexError",n.prototype.isIndexError=!0},7773:(e,t,r)=>{"use strict";r.d(t,{j:()=>c});var n=r(8794),i=r(4444),a=r(5542),o=r(1647),s="apply",u=["typed","isInteger"],c=(0,n.d5)(s,u,(e=>{var{typed:t,isInteger:r}=e;return t(s,{"Array | Matrix, number | BigNumber, function":function(e,t,n){if(!r(t))throw new TypeError("Integer number expected for dimension");var s=Array.isArray(e)?(0,i.aJ)(e):e.size();if(t<0||t>=s.length)throw new o.c(t,s.length);return(0,a.SW)(e)?e.create(l(e.valueOf(),t,n)):l(e,t,n)}})}));function l(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]=l(a[n],t-1,r);return i}return r(e)}for(i=[],n=0;n<e.length;n++)i[n]=l(e[n],t-1,r);return i}},7797:(e,t,r)=>{"use strict";r.d(t,{w:()=>u});var n=r(8794),i=r(5254),a=r(4444),o="column",s=["typed","Index","matrix","range"],u=(0,n.d5)(o,s,(e=>{var{typed:t,Index:r,matrix:n,range:s}=e;return t(o,{"Matrix, number":u,"Array, number":function(e,t){return u(n((0,i.d9)(e)),t).valueOf()}});function u(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");(0,a.Ls)(t,e.size()[1]);var n=s(0,e.size()[0]),i=new r(n,t);return e.subset(i)}}))},7592:(e,t,r)=>{"use strict";r.d(t,{k:()=>f});var n=r(5542),i=r(5254),a=r(4444),o=r(1647),s=r(4961),u=r(8794),c="concat",l=["typed","matrix","isInteger"],f=(0,u.d5)(c,l,(e=>{var{typed:t,matrix:r,isInteger:u}=e;return t(c,{"...Array | Matrix | number | BigNumber":function(e){var t,c,l=e.length,f=-1,d=!1,h=[];for(t=0;t<l;t++){var m=e[t];if((0,n.SW)(m)&&(d=!0),(0,n.hj)(m)||(0,n.l9)(m)){if(t!==l-1)throw new Error("Dimension must be specified as last argument");if(c=f,f=m.valueOf(),!u(f))throw new TypeError("Integer number expected for dimension");if(f<0||t>0&&f>c)throw new o.c(f,c+1)}else{var v=(0,i.d9)(m).valueOf(),y=(0,a.aJ)(v);if(h[t]=v,c=f,f=y.length-1,t>0&&f!==c)throw new s.m(c+1,f+1)}}if(0===h.length)throw new SyntaxError("At least one matrix expected");for(var g=h.shift();h.length;)g=p(g,h.shift(),f,0);return d?r(g):g},"...string":function(e){return e.join("")}})}));function p(e,t,r,n){if(n<r){if(e.length!==t.length)throw new s.m(e.length,t.length);for(var i=[],a=0;a<e.length;a++)i[a]=p(e[a],t[a],r,n+1);return i}return e.concat(t)}},6012:(e,t,r)=>{"use strict";r.d(t,{J:()=>u});var n=r(8794),i=r(9139),a=r(5542),o="diff",s=["typed","matrix","subtract","number"],u=(0,n.d5)(o,s,(e=>{var{typed:t,matrix:r,subtract:n,number:s}=e;return t(o,{"Array | Matrix":function(e){return(0,a.SW)(e)?r(c(e.toArray())):c(e)},"Array | Matrix, number":function(e,t){if(!(0,i.U)(t))throw new RangeError("Dimension must be a whole number");return(0,a.SW)(e)?r(u(e.toArray(),t)):u(e,t)},"Array | Matrix, BigNumber":function(e,t){return this(e,s(t))}});function u(e,t){if((0,a.SW)(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((e=>{r.push(u(e,t-1))})),r}if(0===t)return c(e);throw RangeError("Cannot have negative dimension")}function c(e){var t=[],r=e.length;if(r<2)return e;for(var n=1;n<r;n++)t.push(l(e[n-1],e[n]));return t}function l(e,t){(0,a.SW)(e)&&(e=e.toArray()),(0,a.SW)(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(l(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")}}))},1598:(e,t,r)=>{"use strict";r.d(t,{M:()=>s});var n=r(8794),i=r(5180),a="range",o=["typed","config","?matrix","?bignumber","smaller","smallerEq","larger","largerEq"],s=(0,n.d5)(a,o,(e=>{var{typed:t,config:r,matrix:n,bignumber:o,smaller:s,smallerEq:u,larger:c,largerEq:l}=e;return t(a,{string:p,"string, boolean":p,"number, number":function(e,t){return f(d(e,t,1))},"number, number, number":function(e,t,r){return f(d(e,t,r))},"number, number, boolean":function(e,t,r){return f(r?h(e,t,1):d(e,t,1))},"number, number, number, boolean":function(e,t,r,n){return f(n?h(e,t,r):d(e,t,r))},"BigNumber, BigNumber":function(e,t){return f(m(e,t,new(0,e.constructor)(1)))},"BigNumber, BigNumber, BigNumber":function(e,t,r){return f(m(e,t,r))},"BigNumber, BigNumber, boolean":function(e,t,r){var n=e.constructor;return f(r?v(e,t,new n(1)):m(e,t,new n(1)))},"BigNumber, BigNumber, BigNumber, boolean":function(e,t,r,n){return f(n?v(e,t,r):m(e,t,r))}});function f(e){return"Matrix"===r.matrix?n?n(e):(0,i.kX)():e}function p(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===o&&(0,i.R3)(),f((t?v:m)(o(n.start),o(n.end),o(n.step)))):f((t?h:d)(n.start,n.end,n.step))}function d(e,t,r){var n=[],i=e;if(r>0)for(;s(i,t);)n.push(i),i+=r;else if(r<0)for(;c(i,t);)n.push(i),i+=r;return n}function h(e,t,r){var n=[],i=e;if(r>0)for(;u(i,t);)n.push(i),i+=r;else if(r<0)for(;l(i,t);)n.push(i),i+=r;return n}function m(e,t,r){var n=o(0),i=[],a=e;if(r.gt(n))for(;s(a,t);)i.push(a),a=a.plus(r);else if(r.lt(n))for(;c(a,t);)i.push(a),a=a.plus(r);return i}function v(e,t,r){var n=o(0),i=[],a=e;if(r.gt(n))for(;u(a,t);)i.push(a),a=a.plus(r);else if(r.lt(n))for(;l(a,t);)i.push(a),a=a.plus(r);return i}}))},2349:(e,t,r)=>{"use strict";r.d(t,{v:()=>s});var n=r(8794),i=r(5254),a=r(4444),o=["typed","Index","matrix","range"],s=(0,n.d5)("row",o,(e=>{var{typed:t,Index:r,matrix:n,range:o}=e;return t("row",{"Matrix, number":s,"Array, number":function(e,t){return s(n((0,i.d9)(e)),t).valueOf()}});function s(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");(0,a.Ls)(t,e.size()[0]);var n=o(0,e.size()[1]),i=new r(t,n);return e.subset(i)}}))},7238:(e,t,r)=>{"use strict";r.d(t,{q:()=>f});var n=r(5542),i=r(5254),a=r(4444),o=r(3068),s=r(4961),u=r(8794),c="subset",l=["typed","matrix"],f=(0,u.d5)(c,l,(e=>{var{typed:t,matrix:r}=e;return t(c,{"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":h,"string, Index":p,"Array, Index, any":function(e,t,n){return r((0,i.d9)(e)).subset(t,n,void 0).valueOf()},"Array, Index, any, any":function(e,t,n,a){return r((0,i.d9)(e)).subset(t,n,a).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":d,"string, Index, string, string":d,"Object, Index, any":m})}));function p(e,t){if(!(0,n.dh)(t))throw new TypeError("Index expected");if(1!==t.size().length)throw new s.m(t.size().length,1);var r=e.length;(0,a.Ls)(t.min()[0],r),(0,a.Ls)(t.max()[0],r);var i=t.dimension(0),o="";return i.forEach((function(t){o+=e.charAt(t)})),o}function d(e,t,r,n){if(!t||!0!==t.isIndex)throw new TypeError("Index expected");if(1!==t.size().length)throw new s.m(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 s.m(i.size()[0],r.length);var o=e.length;(0,a.Ls)(t.min()[0]),(0,a.Ls)(t.max()[0]);for(var u=[],c=0;c<o;c++)u[c]=e.charAt(c);if(i.forEach((function(e,t){u[e]=r.charAt(t[0])})),u.length>o)for(var l=o-1,f=u.length;l<f;l++)u[l]||(u[l]=n);return u.join("")}function h(e,t){if(1!==t.size().length)throw new s.m(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(0,o.YF)(e,r)}function m(e,t,r){if(1!==t.size().length)throw new s.m(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 a=(0,i.d9)(e);return(0,o.nI)(a,n,r),a}},8911:(e,t,r)=>{"use strict";r.d(t,{J:()=>s});var n=r(4344),i=r(8794),a=r(7635),o=["typed","config","numeric","larger"],s=(0,i.d5)("max",o,(e=>{var{typed:t,config:r,numeric:i,larger:o}=e;return t("max",{"Array | Matrix":u,"Array | Matrix, number | BigNumber":function(e,t){return(0,n.u4)(e,t.valueOf(),s)},"...":function(e){if((0,n.CQ)(e))throw new TypeError("Scalar values expected in function max");return u(e)}});function s(e,t){try{return o(e,t)?e:t}catch(e){throw(0,a.x)(e,"max",t)}}function u(e){var t;if((0,n.Et)(e,(function(e){try{isNaN(e)&&"number"==typeof e?t=NaN:(void 0===t||o(e,t))&&(t=e)}catch(t){throw(0,a.x)(t,"max",e)}})),void 0===t)throw new Error("Cannot calculate max of an empty array");return"string"==typeof t&&(t=i(t,r.number)),t}}))},8980:(e,t,r)=>{"use strict";r.d(t,{Q:()=>c});var n=r(4344),i=r(4444),a=r(8794),o=r(7635),s="mean",u=["typed","add","divide"],c=(0,a.d5)(s,u,(e=>{var{typed:t,add:r,divide:a}=e;return t(s,{"Array | Matrix":u,"Array | Matrix, number | BigNumber":function(e,t){try{var s=(0,n.u4)(e,t,r),u=Array.isArray(e)?(0,i.aJ)(e):e.size();return a(s,u[t])}catch(e){throw(0,o.x)(e,"mean")}},"...":function(e){if((0,n.CQ)(e))throw new TypeError("Scalar values expected in function mean");return u(e)}});function u(e){var t,i=0;if((0,n.Et)(e,(function(e){try{t=void 0===t?e:r(t,e),i++}catch(t){throw(0,o.x)(t,"mean",e)}})),0===i)throw new Error("Cannot calculate the mean of an empty array");return a(t,i)}}))},3685:(e,t,r)=>{"use strict";r.d(t,{D:()=>s});var n=r(4344),i=r(8794),a=r(7635),o=["typed","config","numeric","smaller"],s=(0,i.d5)("min",o,(e=>{var{typed:t,config:r,numeric:i,smaller:o}=e;return t("min",{"Array | Matrix":u,"Array | Matrix, number | BigNumber":function(e,t){return(0,n.u4)(e,t.valueOf(),s)},"...":function(e){if((0,n.CQ)(e))throw new TypeError("Scalar values expected in function min");return u(e)}});function s(e,t){try{return o(e,t)?e:t}catch(e){throw(0,a.x)(e,"min",t)}}function u(e){var t;if((0,n.Et)(e,(function(e){try{isNaN(e)&&"number"==typeof e?t=NaN:(void 0===t||o(e,t))&&(t=e)}catch(t){throw(0,a.x)(t,"min",e)}})),void 0===t)throw new Error("Cannot calculate min of an empty array");return"string"==typeof t&&(t=i(t,r.number)),t}}))},4723:(e,t,r)=>{"use strict";r.d(t,{X:()=>i});var n=["typed","sqrt","variance"],i=(0,r(8794).d5)("std",n,(e=>{var{typed:t,sqrt:r,variance:n}=e;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}}}))},7726:(e,t,r)=>{"use strict";r.d(t,{O:()=>s});var n=r(4344),i=r(8794),a=r(7635),o=["typed","config","add","numeric"],s=(0,i.d5)("sum",o,(e=>{var{typed:t,config:r,add:i,numeric:o}=e;return t("sum",{"Array | Matrix":s,"Array | Matrix, number | BigNumber":function(e,t){try{return(0,n.u4)(e,t,i)}catch(e){throw(0,a.x)(e,"sum")}},"...":function(e){if((0,n.CQ)(e))throw new TypeError("Scalar values expected in function sum");return s(e)}});function s(e){var t;return(0,n.Et)(e,(function(e){try{t=void 0===t?e:i(t,e)}catch(t){throw(0,a.x)(t,"sum",e)}})),void 0===t&&(t=o(0,r.number)),"string"==typeof t&&(t=o(t,r.number)),t}}))},7635:(e,t,r)=>{"use strict";r.d(t,{x:()=>i});var n=r(5542);function i(e,t,r){var i;return-1!==String(e).indexOf("Unexpected type")?(i=arguments.length>2?" (type: "+(0,n.kM)(r)+", value: "+JSON.stringify(r)+")":" (type: "+e.data.actual+")",new TypeError("Cannot calculate "+t+", unexpected type of argument"+i)):-1!==String(e).indexOf("complex numbers")?(i=arguments.length>2?" (type: "+(0,n.kM)(r)+", value: "+JSON.stringify(r)+")":"",new TypeError("Cannot calculate "+t+", no ordering relation is defined for complex numbers"+i)):e}},7359:(e,t,r)=>{"use strict";r.d(t,{F:()=>l});var n=r(4344),i=r(5542),a=r(8794),o=r(7635),s="unbiased",u="variance",c=["typed","add","subtract","multiply","divide","apply","isNaN"],l=(0,a.d5)(u,c,(e=>{var{typed:t,add:r,subtract:a,multiply:c,divide:l,apply:f,isNaN:p}=e;return t(u,{"Array | Matrix":function(e){return d(e,s)},"Array | Matrix, string":d,"Array | Matrix, number | BigNumber":function(e,t){return h(e,t,s)},"Array | Matrix, number | BigNumber, string":h,"...":function(e){return d(e,s)}});function d(e,t){var s,u=0;if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");if((0,n.Et)(e,(function(e){try{s=void 0===s?e:r(s,e),u++}catch(t){throw(0,o.x)(t,"variance",e)}})),0===u)throw new Error("Cannot calculate variance of an empty array");var f=l(s,u);if(s=void 0,(0,n.Et)(e,(function(e){var t=a(e,f);s=void 0===s?c(t,t):r(s,c(t,t))})),p(s))return s;switch(t){case"uncorrected":return l(s,u);case"biased":return l(s,u+1);case"unbiased":var d=(0,i.l9)(s)?s.mul(0):0;return 1===u?d:l(s,u-1);default:throw new Error('Unknown normalization "'+t+'". Choose "unbiased" (default), "uncorrected", or "biased".')}}function h(e,t,r){try{if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");return f(e,t,(e=>d(e,r)))}catch(e){throw(0,o.x)(e,"variance")}}}))},4444:(e,t,r)=>{"use strict";r.d(t,{aJ:()=>u,Gu:()=>l,Ls:()=>f,SI:()=>p,XL:()=>h,eu:()=>m,L9:()=>y,f4:()=>x,xH:()=>w,UI:()=>_,Ed:()=>N,hX:()=>E,U_:()=>M,v_:()=>S,yV:()=>A,D$:()=>O,$q:()=>k});var n=r(9139),i=r(5542),a=r(3014),o=r(4961),s=r(1647);function u(e){for(var t=[];Array.isArray(e);)t.push(e.length),e=e[0];return t}function c(e,t,r){var n,i=e.length;if(i!==t[r])throw new o.m(i,t[r]);if(r<t.length-1){var a=r+1;for(n=0;n<i;n++){var s=e[n];if(!Array.isArray(s))throw new o.m(t.length-1,t.length,"<");c(e[n],t,a)}}else for(n=0;n<i;n++)if(Array.isArray(e[n]))throw new o.m(t.length+1,t.length,">")}function l(e,t){if(0===t.length){if(Array.isArray(e))throw new o.m(e.length,0)}else c(e,t,0)}function f(e,t){if(!(0,i.hj)(e)||!(0,n.U)(e))throw new TypeError("Index must be an integer (value: "+e+")");if(e<0||"number"==typeof t&&e>=t)throw new s.c(e,t)}function p(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(!(0,i.hj)(e)||!(0,n.U)(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+(0,a.WU)(t)+")")})),d(e,t,0,void 0!==r?r:0),e}function d(e,t,r,n){var i,a,o=e.length,s=t[r],u=Math.min(o,s);if(e.length=s,r<t.length-1){var c=r+1;for(i=0;i<u;i++)a=e[i],Array.isArray(a)||(a=[a],e[i]=a),d(a,t,c,n);for(i=u;i<s;i++)a=[],e[i]=a,d(a,t,c,n)}else{for(i=0;i<u;i++)for(;Array.isArray(e[i]);)e[i]=e[i][0];for(i=u;i<s;i++)e[i]=n}}function h(e,t){var r=w(e),n=r.length;if(!Array.isArray(e)||!Array.isArray(t))throw new TypeError("Array expected");if(0===t.length)throw new o.m(0,n,"!=");var i=v(t=m(t,n));if(n!==i)throw new o.m(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 o.m)throw new o.m(i,n,"!=");throw e}}function m(e,t){var r=v(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 v(e){return e.reduce(((e,t)=>e*t),1)}function y(e,t){for(var r=t||u(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=g(e,n,0),r.length=n),e}function g(e,t,r){var n,i;if(r<t){var a=r+1;for(n=0,i=e.length;n<i;n++)e[n]=g(e[n],t,a)}else for(;Array.isArray(e);)e=e[0];return e}function x(e,t,r,n){var i=n||u(e);if(r)for(var a=0;a<r;a++)e=[e],i.unshift(1);for(e=b(e,t,0);i.length<t;)i.push(1);return e}function b(e,t,r){var n,i;if(Array.isArray(e)){var a=r+1;for(n=0,i=e.length;n<i;n++)e[n]=b(e[n],t,a)}else for(var o=r;o<t;o++)e=[e];return e}function w(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 _(e,t){return Array.prototype.map.call(e,t)}function N(e,t){Array.prototype.forEach.call(e,t)}function E(e,t){if(1!==u(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,t)}function M(e,t){if(1!==u(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,(e=>t.test(e)))}function S(e,t){return Array.prototype.join.call(e,t)}function A(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 O(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 k(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?k(a,t):t(a);if(void 0===r)r=s;else if(r!==s)return"mixed"}return r}},4344:(e,t,r)=>{"use strict";r.d(t,{CQ:()=>o,Et:()=>s,Fh:()=>u,u4:()=>c,U6:()=>f});var n=r(5542),i=r(1647),a=r(4444);function o(e){for(var t=0;t<e.length;t++)if((0,n.uZ)(e[t]))return!0;return!1}function s(e,t){(0,n.SW)(e)&&(e=e.valueOf());for(var r=0,i=e.length;r<i;r++){var a=e[r];Array.isArray(a)?s(a,t):t(a)}}function u(e,t,r){return e&&"function"==typeof e.map?e.map((function(e){return u(e,t,r)})):t(e)}function c(e,t,r){var o=Array.isArray(e)?(0,a.aJ)(e):e.size();if(t<0||t>=o.length)throw new i.c(t,o.length);return(0,n.SW)(e)?e.create(l(e.valueOf(),t,r)):l(e,t,r)}function l(e,t,r){var n,i,a,o;if(t<=0){if(Array.isArray(e[0])){for(o=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<o.length;n++)i[n]=l(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]=l(e[n],t-1,r);return i}function f(e,t,r,n,i,a,o,s,u,c,l){var f,p,d,h,m=e._values,v=e._index,y=e._ptr;if(n)for(p=y[t],d=y[t+1],f=p;f<d;f++)r[h=v[f]]!==a?(r[h]=a,o.push(h),c?(n[h]=u?s(m[f],l):s(l,m[f]),i[h]=a):n[h]=m[f]):(n[h]=u?s(m[f],n[h]):s(n[h],m[f]),i[h]=a);else for(p=y[t],d=y[t+1],f=p;f<d;f++)r[h=v[f]]!==a?(r[h]=a,o.push(h)):i[h]=a}},3068:(e,t,r)=>{"use strict";r.d(t,{YF:()=>i,nI:()=>a,pp:()=>o,np:()=>s,OJ:()=>u});var n=r(5254);function i(e,t){if(c(e)&&o(e,t))return e[t];if("function"==typeof e[t]&&u(e,t))throw new Error('Cannot access method "'+t+'" as a property');throw new Error('No access to property "'+t+'"')}function a(e,t,r){if(c(e)&&o(e,t))return e[t]=r,r;throw new Error('No access to property "'+t+'"')}function o(e,t){return!(!e||"object"!=typeof e||!(0,n.nr)(l,t)&&(t in Object.prototype||t in Function.prototype))}function s(e,t){if(!u(e,t))throw new Error('No access to method "'+t+'"')}function u(e,t){return!(null==e||"function"!=typeof e[t]||(0,n.nr)(e,t)&&Object.getPrototypeOf&&t in Object.getPrototypeOf(e)||!(0,n.nr)(f,t)&&(t in Object.prototype||t in Function.prototype))}function c(e){return"object"==typeof e&&e&&e.constructor===Object}var l={length:!0,name:!0},f={toString:!0,valueOf:!0,toLocaleString:!0}},8794:(e,t,r)=>{"use strict";r.d(t,{d5:()=>i});var n=r(5254);function i(e,t,r,i){function o(i){var o=(0,n.W6)(i,t.map(a));return function(e,t,r){if(!t.filter((e=>!function(e){return e&&"?"===e[0]}(e))).every((e=>void 0!==r[e]))){var n=t.filter((e=>void 0===r[e]));throw new Error('Cannot create function "'.concat(e,'", ')+"some dependencies are missing: ".concat(n.map((e=>'"'.concat(e,'"'))).join(", "),"."))}}(e,t,i),r(o)}return o.isFactory=!0,o.fn=e,o.dependencies=t.slice().sort(),i&&(o.meta=i),o}function a(e){return e&&"?"===e[0]?e.slice(1):e}},77:(e,t,r)=>{"use strict";function n(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 i(e){var{hasher:t,limit:r}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};return r=null==r?Number.POSITIVE_INFINITY:r,t=null==t?JSON.stringify:t,function i(){"object"!=typeof i.cache&&(i.cache={values:new Map,lru:n(r||Number.POSITIVE_INFINITY)});for(var a=[],o=0;o<arguments.length;o++)a[o]=arguments[o];var s=t(a);if(i.cache.values.has(s))return i.cache.lru.hit(s),i.cache.values.get(s);var u=e.apply(e,a);return i.cache.values.set(s,u),i.cache.values.delete(i.cache.lru.hit(s)),u}}function a(e){return Object.keys(e.signatures||{}).reduce((function(e,t){var r=(t.match(/,/g)||[]).length+1;return Math.max(e,r)}),-1)}r.d(t,{oV:()=>a,HP:()=>i})},5542:(e,t,r)=>{"use strict";function n(e){return"number"==typeof e}function i(e){return e&&!0===e.constructor.prototype.isBigNumber||!1}function a(e){return e&&"object"==typeof e&&!0===Object.getPrototypeOf(e).isComplex||!1}function o(e){return e&&"object"==typeof e&&!0===Object.getPrototypeOf(e).isFraction||!1}function s(e){return e&&!0===e.constructor.prototype.isUnit||!1}function u(e){return"string"==typeof e}r.d(t,{hj:()=>n,l9:()=>i,Mc:()=>a,yQ:()=>o,wr:()=>s,HD:()=>u,kJ:()=>c,SW:()=>l,uZ:()=>f,jH:()=>p,sA:()=>d,bR:()=>h,dh:()=>m,jn:()=>v,cB:()=>y,x1:()=>g,mf:()=>x,J_:()=>b,Kj:()=>w,Kn:()=>_,Ft:()=>N,o8:()=>E,Yz:()=>M,j0:()=>S,Bp:()=>A,zh:()=>O,tS:()=>k,nu:()=>T,l7:()=>C,VO:()=>I,Cl:()=>D,UG:()=>z,Lr:()=>B,bV:()=>j,Ig:()=>U,ex:()=>R,FG:()=>q,qg:()=>F,kM:()=>P});var c=Array.isArray;function l(e){return e&&!0===e.constructor.prototype.isMatrix||!1}function f(e){return Array.isArray(e)||l(e)}function p(e){return e&&e.isDenseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function d(e){return e&&e.isSparseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function h(e){return e&&!0===e.constructor.prototype.isRange||!1}function m(e){return e&&!0===e.constructor.prototype.isIndex||!1}function v(e){return"boolean"==typeof e}function y(e){return e&&!0===e.constructor.prototype.isResultSet||!1}function g(e){return e&&!0===e.constructor.prototype.isHelp||!1}function x(e){return"function"==typeof e}function b(e){return e instanceof Date}function w(e){return e instanceof RegExp}function _(e){return!(!e||"object"!=typeof e||e.constructor!==Object||a(e)||o(e))}function N(e){return null===e}function E(e){return void 0===e}function M(e){return e&&!0===e.isAccessorNode&&!0===e.constructor.prototype.isNode||!1}function S(e){return e&&!0===e.isArrayNode&&!0===e.constructor.prototype.isNode||!1}function A(e){return e&&!0===e.isAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function O(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 T(e){return e&&!0===e.isConstantNode&&!0===e.constructor.prototype.isNode||!1}function C(e){return e&&!0===e.isFunctionAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function I(e){return e&&!0===e.isFunctionNode&&!0===e.constructor.prototype.isNode||!1}function D(e){return e&&!0===e.isIndexNode&&!0===e.constructor.prototype.isNode||!1}function z(e){return e&&!0===e.isNode&&!0===e.constructor.prototype.isNode||!1}function B(e){return e&&!0===e.isObjectNode&&!0===e.constructor.prototype.isNode||!1}function j(e){return e&&!0===e.isOperatorNode&&!0===e.constructor.prototype.isNode||!1}function U(e){return e&&!0===e.isParenthesisNode&&!0===e.constructor.prototype.isNode||!1}function R(e){return e&&!0===e.isRangeNode&&!0===e.constructor.prototype.isNode||!1}function q(e){return e&&!0===e.isSymbolNode&&!0===e.constructor.prototype.isNode||!1}function F(e){return e&&!0===e.constructor.prototype.isChain||!1}function P(e){var t=typeof e;return"object"===t?null===e?"null":Array.isArray(e)?"Array":e instanceof Date?"Date":e instanceof RegExp?"RegExp":i(e)?"BigNumber":a(e)?"Complex":o(e)?"Fraction":l(e)?"Matrix":s(e)?"Unit":m(e)?"Index":h(e)?"Range":y(e)?"ResultSet":z(e)?e.type:F(e)?"Chain":g(e)?"Help":"Object":"function"===t?"Function":t}},5180:(e,t,r)=>{"use strict";function n(){throw new Error('No "bignumber" implementation available')}function i(){throw new Error('No "fraction" implementation available')}function a(){throw new Error('No "matrix" implementation available')}r.d(t,{R3:()=>n,nG:()=>i,kX:()=>a})},9139:(e,t,r)=>{"use strict";r.d(t,{U:()=>i,Xx:()=>a,k3:()=>o,mv:()=>s,Kr:()=>u,eK:()=>c,t$:()=>l,WU:()=>p,FH:()=>h,nz:()=>g,RI:()=>b,__:()=>w,Vf:()=>_,C8:()=>N,f9:()=>E,R_:()=>M,AE:()=>S});var n=r(5542);function i(e){return"boolean"==typeof e||!!isFinite(e)&&e===Math.round(e)}var a=Math.sign||function(e){return e>0?1:e<0?-1:0},o=Math.log2||function(e){return Math.log(e)/Math.LN2},s=Math.log10||function(e){return Math.log(e)/Math.LN10},u=Math.log1p||function(e){return Math.log(e+1)},c=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},l=Math.expm1||function(e){return e>=2e-4||e<=-2e-4?Math.exp(e)-1:e+e*e/2+e*e*e/6};function f(e,t,r){var n={2:"0b",8:"0o",16:"0x"}[t],a="";if(r){if(r<1)throw new Error("size must be in greater than 0");if(!i(r))throw new Error("size must be an integer");if(e>2**(r-1)-1||e<-(2**(r-1)))throw new Error("Value must be in range [-2^".concat(r-1,", 2^").concat(r-1,"-1]"));if(!i(e))throw new Error("Value must be an integer");e<0&&(e+=2**r),a="i".concat(r)}var o="";return e<0&&(e=-e,o="-"),"".concat(o).concat(n).concat(e.toString(t)).concat(a)}function p(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,i,a="auto";if(t&&(t.notation&&(a=t.notation),(0,n.hj)(t)?r=t:(0,n.hj)(t.precision)&&(r=t.precision),t.wordSize&&"number"!=typeof(i=t.wordSize)))throw new Error('Option "wordSize" must be a number');switch(a){case"fixed":return h(e,r);case"exponential":return m(e,r);case"engineering":return function(e,t){if(isNaN(e)||!isFinite(e))return String(e);var r=v(d(e),t),i=r.exponent,a=r.coefficients,o=i%3==0?i:i<0?i-3-i%3:i-i%3;if((0,n.hj)(t))for(;t>a.length||i-o+1>a.length;)a.push(0);else for(var s=Math.abs(i-o)-(a.length-1),u=0;u<s;u++)a.push(0);for(var c=Math.abs(i-o),l=1;c>0;)l++,c--;var f=a.slice(l).join(""),p=(0,n.hj)(t)&&f.length||f.match(/[1-9]/)?"."+f:"",h=a.slice(0,l).join("")+p+"e"+(i>=0?"+":"")+o.toString();return r.sign+h}(e,r);case"bin":return f(e,2,i);case"oct":return f(e,8,i);case"hex":return f(e,16,i);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=d(e),o=t?v(a,t):a;if(o.exponent<n||o.exponent>=i)return m(e,t);var s=o.coefficients,u=o.exponent;s.length<t&&(s=s.concat(y(t-s.length))),s=s.concat(y(u-s.length+1+(s.length<t?t-s.length:0)));var c=u>0?u:0;return c<(s=y(-u).concat(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 "'+a+'". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.')}}function d(e){var t=String(e).toLowerCase().match(/^0*?(-?)(\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 h(e,t){if(isNaN(e)||!isFinite(e))return String(e);var r=d(e),n="number"==typeof t?v(r,r.exponent+1+t):r,i=n.coefficients,a=n.exponent+1,o=a+(t||0);return i.length<o&&(i=i.concat(y(o-i.length))),a<0&&(i=y(1-a).concat(i),a=1),a<i.length&&i.splice(a,0,0===a?"0.":"."),n.sign+i.join("")}function m(e,t){if(isNaN(e)||!isFinite(e))return String(e);var r=d(e),n=t?v(r,t):r,i=n.coefficients,a=n.exponent;i.length<t&&(i=i.concat(y(t-i.length)));var o=i.shift();return n.sign+o+(i.length>0?"."+i.join(""):"")+"e"+(a>=0?"+":"")+a}function v(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 y(e){for(var t=[],r=0;r<e;r++)t.push(0);return t}function g(e){return e.toExponential().replace(/e.*$/,"").replace(/^0\.?0*|\./,"").length}var x=Number.EPSILON||2220446049250313e-31;function b(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<x||n<=Math.max(Math.abs(e),Math.abs(t))*r}return!1}var w=Math.acosh||function(e){return Math.log(Math.sqrt(e*e-1)+e)},_=Math.asinh||function(e){return Math.log(Math.sqrt(e*e+1)+e)},N=Math.atanh||function(e){return Math.log((1+e)/(1-e))/2},E=Math.cosh||function(e){return(Math.exp(e)+Math.exp(-e))/2},M=Math.sinh||function(e){return(Math.exp(e)-Math.exp(-e))/2},S=Math.tanh||function(e){var t=Math.exp(2*e);return(t-1)/(t+1)}},5254:(e,t,r)=>{"use strict";r.d(t,{d9:()=>i,l7:()=>a,J5:()=>o,Vo:()=>s,nr:()=>u,W6:()=>c});var n=r(5542);function i(e){var t=typeof 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 i(e)}));if(e instanceof Date)return new Date(e.valueOf());if((0,n.l9)(e))return e;if(e instanceof RegExp)throw new TypeError("Cannot clone "+e);return function(e,t){var r={};for(var n in e)u(e,n)&&(r[n]=t(e[n]));return r}(e,i)}function a(e,t){for(var r in t)u(t,r)&&(e[r]=t[r]);return e}function o(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(!o(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)||!o(e[r],t[r]))return!1;for(r in t)if(!(r in e)||!o(e[r],t[r]))return!1;return!0}return e===t}function s(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 u(e,t){return e&&Object.hasOwnProperty.call(e,t)}function c(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}},3014:(e,t,r)=>{"use strict";r.d(t,{cd:()=>p,pn:()=>s,YU:()=>l,WU:()=>u,Pz:()=>c});var n=r(5542),i=r(9139);function a(e,t,r){var n=new(0,e.constructor)(2),a="";if(r){if(r<1)throw new Error("size must be in greater than 0");if(!(0,i.U)(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))),a="i".concat(r)}switch(t){case 2:return"".concat(e.toBinary()).concat(a);case 8:return"".concat(e.toOctal()).concat(a);case 16:return"".concat(e.toHexadecimal()).concat(a);default:throw new Error("Base ".concat(t," not supported "))}}function o(e,t){return void 0!==t?e.toExponential(t-1):e.toExponential()}function s(e,t){var r=e.length-t.length,n=e.length;return e.substring(r,n)===t}function u(e,t){return"number"==typeof e?(0,i.WU)(e,t):(0,n.l9)(e)?function(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 o(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);return-1!==a.indexOf("e")&&(a=i.toString()),a+"e"+(r>=0?"+":"")+n.toString()}(e,r);case"bin":return a(e,2,n);case"oct":return a(e,8,n);case"hex":return a(e,16,n);case"auto":var s=t&&void 0!==t.lowerExp?t.lowerExp:-3,u=t&&void 0!==t.upperExp?t.upperExp:5;if(e.isZero())return"0";var c=e.toSignificantDigits(r),l=c.e;return(l>=s&&l<u?c.toFixed():o(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.')}}(e,t):function(e){return e&&"object"==typeof e&&"number"==typeof e.s&&"number"==typeof e.n&&"number"==typeof e.d||!1}(e)?t&&"decimal"===t.fraction?e.toString():e.s*e.n+"/"+e.d:Array.isArray(e)?f(e,t):(0,n.HD)(e)?'"'+e+'"':"function"==typeof e?e.syntax?String(e.syntax):"function":e&&"object"==typeof e?"function"==typeof e.format?e.format(t):e&&e.toString(t)!=={}.toString()?e.toString(t):"{"+Object.keys(e).map((r=>'"'+r+'": '+u(e[r],t))).join(", ")+"}":String(e)}function c(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 l(e){var t=String(e);return t.replace(/&/g,"&amp;").replace(/"/g,"&quot;").replace(/'/g,"&#39;").replace(/</g,"&lt;").replace(/>/g,"&gt;")}function f(e,t){if(Array.isArray(e)){for(var r="[",n=e.length,i=0;i<n;i++)0!==i&&(r+=", "),r+=f(e[i],t);return r+"]"}return u(e,t)}function p(e,t){if(!(0,n.HD)(e))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+(0,n.kM)(e)+", index: 0)");if(!(0,n.HD)(t))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+(0,n.kM)(t)+", index: 1)");return e===t?0:e>t?1:-1}},6377:(e,t,r)=>{var n=r(4832),i=r(8652),a=r(801),o=r(2030),s=r(3618),u=r(9049),c=r(1971);c.alea=n,c.xor128=i,c.xorwow=a,c.xorshift7=o,c.xor4096=s,c.tychei=u,e.exports=c},4832:function(e,t,r){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.amdD&&r.amdO?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.alea=u}(0,e=r.nmd(e),r.amdD)},9049:function(e,t,r){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.amdD&&r.amdO?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.tychei=u}(0,e=r.nmd(e),r.amdD)},8652:function(e,t,r){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.amdD&&r.amdO?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xor128=u}(0,e=r.nmd(e),r.amdD)},3618:function(e,t,r){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.amdD&&r.amdO?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xor4096=u}(0,e=r.nmd(e),r.amdD)},2030:function(e,t,r){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.amdD&&r.amdO?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xorshift7=u}(0,e=r.nmd(e),r.amdD)},801:function(e,t,r){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.amdD&&r.amdO?void 0===(n=function(){return u}.call(t,r,t,i))||(i.exports=n):this.xorwow=u}(0,e=r.nmd(e),r.amdD)},1971:function(e,t,r){var n;!function(i,a,o){var s,u=256,c=o.pow(u,6),l=o.pow(2,52),f=2*l,p=255;function d(e,t,r){var n=[],p=y(v((t=1==t?{entropy:!0}:t||{}).entropy?[e,g(a)]:null==e?function(){try{var e;return s&&(e=s.randomBytes)?e=e(u):(e=new Uint8Array(u),(i.crypto||i.msCrypto).getRandomValues(e)),g(e)}catch(e){var t=i.navigator,r=t&&t.plugins;return[+new Date,i,r,i.screen,g(a)]}}():e,3),n),d=new h(n),x=function(){for(var e=d.g(6),t=c,r=0;e<l;)e=(e+r)*u,t*=u,r=d.g(1);for(;e>=f;)e/=2,t/=2,r>>>=1;return(e+r)/t};return x.int32=function(){return 0|d.g(4)},x.quick=function(){return d.g(4)/4294967296},x.double=x,y(g(d.S),a),(t.pass||r||function(e,t,r,n){return n&&(n.S&&m(n,d),e.state=function(){return m(d,{})}),r?(o.random=e,t):e})(x,p,"global"in t?t.global:this==o,t.state)}function h(e){var t,r=e.length,n=this,i=0,a=n.i=n.j=0,o=n.S=[];for(r||(e=[r++]);i<u;)o[i]=i++;for(i=0;i<u;i++)o[i]=o[a=p&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=p&i+1],r=r*u+o[p&(o[i]=o[a=p&a+t])+(o[a]=t)];return n.i=i,n.j=a,r})(u)}function m(e,t){return t.i=e.i,t.j=e.j,t.S=e.S.slice(),t}function v(e,t){var r,n=[],i=typeof e;if(t&&"object"==i)for(r in e)try{n.push(v(e[r],t-1))}catch(e){}return n.length?n:"string"==i?e:e+"\0"}function y(e,t){for(var r,n=e+"",i=0;i<n.length;)t[p&i]=p&(r^=19*t[p&i])+n.charCodeAt(i++);return g(t)}function g(e){return String.fromCharCode.apply(0,e)}if(y(o.random(),a),e.exports){e.exports=d;try{s=r(5042)}catch(e){}}else void 0===(n=function(){return d}.call(t,r,t,e))||(e.exports=n)}("undefined"!=typeof self?self:this,[],Math)},2287:function(e,t){"use strict";var r,n;void 0===(n="function"==typeof(r=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=q(u.types,(function(t){return t.name===e}));if(t)return t;if("any"===e)return a;var r=q(u.types,(function(t){return t.name.toLowerCase()===e.toLowerCase()}));throw new TypeError('Unknown type "'+e+'"'+(r?'. Did you mean "'+r.name+'"?':""))}function l(e){return e===a?999:u.types.indexOf(e)}function f(e){var t=q(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 d(e,t){var r=0===e.indexOf("..."),n=(r?e.length>3?e.slice(3):"any":e).split("|").map(I).filter(D).filter(C),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:l(t),test:t.test,conversion:null,conversionIndex:-1}})),o=i.map((function(e){var r=c(e.from);return{name:e.from,typeIndex:l(r),test:r.test,conversion:e,conversionIndex:t.indexOf(e)}}));return{types:a.concat(o),restParam:r}}function h(e){var t=j(e);return!!t&&t.restParam}function m(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(j(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)?j(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 _(e,t){var r=function(e){for(var t={},r=0;r<e.length;r++)t[e[r]]=!0;return Object.keys(t)}(F(e,(function(e){return x(e,t,!1)})));return-1!==r.indexOf("any")?["any"]:r}function N(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=_(s,a)).length>0){var c=f(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 l=s.map((function(e){return h(e.params)?1/0:e.params.length}));if(t.length<Math.min.apply(null,l))return i=_(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,l);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(f)},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 M(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 S(e,t){var r;return 0!=(r=e.restParam-t.restParam)||0!=(r=m(e)-m(t))||0!=(r=E(e)-E(t))?r:M(e)-M(t)}function A(e,t){var r,n,i=Math.min(e.params.length,t.params.length);if(0!=(n=e.params.some(m)-t.params.some(m)))return n;for(r=0;r<i;r++)if(0!=(n=m(e.params[r])-m(t.params[r])))return n;for(r=0;r<i;r++)if(0!==(n=S(e.params[r],t.params[r])))return n;return e.params.length-t.params.length}function O(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 k(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 F(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(I).map((function(e,t,n){var i=d(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(z).forEach((function(e){var t=q(i,(function(t){return function(e,t){for(var r=Math.max(e.params.length,t.params.length),n=0;n<r;n++)if(!R(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=F(i,(function(e){return(e?k(e.params,!1):[]).map((function(t){return{params:t,fn:e.fn}}))})).filter(z);a.sort(A);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),l=a[3]&&a[3].params.length<=2&&!h(a[3].params),f=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&&l&&f&&g,w=a.map((function(e){return y(e.params)})),_=o?v(a[0].params[0]):t,E=s?v(a[1].params[0]):t,M=c?v(a[2].params[0]):t,S=l?v(a[3].params[0]):t,T=f?v(a[4].params[0]):t,C=g?v(a[5].params[0]):t,D=o?v(a[0].params[1]):t,j=s?v(a[1].params[1]):t,P=c?v(a[2].params[1]):t,L=l?v(a[3].params[1]):t,H=f?v(a[4].params[1]):t,G=g?v(a[5].params[1]):t,Z=a.map((function(e){return function(e,t){var r=t;if(e.some(m)){var n=h(e),i=e.map(O);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,U(arguments,0,o).concat([U(arguments,o)]))}}return a}(e.params,e.fn)})),W=o?Z[0]:r,$=s?Z[1]:r,V=c?Z[2]:r,J=l?Z[3]:r,Y=f?Z[4]:r,X=g?Z[5]:r,Q=o?a[0].params.length:-1,K=s?a[1].params.length:-1,ee=c?a[2].params.length:-1,te=l?a[3].params.length:-1,re=f?a[4].params.length:-1,ne=g?a[5].params.length:-1,ie=b?6:0,ae=a.length,oe=function(){for(var t=ie;t<ae;t++)if(w[t](arguments))return Z[t].apply(this,arguments);throw N(e,arguments,a)},se=function e(t,r){return arguments.length===Q&&_(t)&&D(r)?W.apply(e,arguments):arguments.length===K&&E(t)&&j(r)?$.apply(e,arguments):arguments.length===ee&&M(t)&&P(r)?V.apply(e,arguments):arguments.length===te&&S(t)&&L(r)?J.apply(e,arguments):arguments.length===re&&T(t)&&H(r)?Y.apply(e,arguments):arguments.length===ne&&C(t)&&G(r)?X.apply(e,arguments):oe.apply(e,arguments)};try{Object.defineProperty(se,"name",{value:e})}catch(e){}return se.signatures=function(e){var t={};return e.forEach((function(e){e.params.some(m)||k(e.params,!0).forEach((function(r){t[p(r)]=e.fn}))})),t}(a),se}function C(e){return-1===u.ignore.indexOf(e)}function I(e){return e.trim()}function D(e){return!!e}function z(e){return null!==e}function B(e){return 0===e.types.length}function j(e){return e[e.length-1]}function U(e,t,r){return Array.prototype.slice.call(e,t,r)}function R(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 q(e,t){for(var r=0;r<e.length;r++)if(t(e[r]))return e[r]}function F(e,t){return Array.prototype.concat.apply([],e.map(t))}function P(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 L(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(P(t),e)},"...Function":function(e){return T(P(e),L(e))},"string, ...Function":function(e,t){return T(e,L(t))}})).create=n,u.types=i,u.conversions=s,u.ignore=o,u.convert=function(e,t){var r=f(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}()})?r.apply(t,[]):r)||(e.exports=n)},5042:()=>{}},t={};function r(n){var i=t[n];if(void 0!==i)return i.exports;var a=t[n]={id:n,loaded:!1,exports:{}};return e[n].call(a.exports,a,a.exports,r),a.loaded=!0,a.exports}r.amdD=function(){throw new Error("define cannot be used indirect")},r.amdO={},r.n=e=>{var t=e&&e.__esModule?()=>e.default:()=>e;return r.d(t,{a:t}),t},r.d=(e,t)=>{for(var n in t)r.o(t,n)&&!r.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:t[n]})},r.g=function(){if("object"==typeof globalThis)return globalThis;try{return this||new Function("return this")()}catch(e){if("object"==typeof window)return window}}(),r.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),r.nmd=e=>(e.paths=[],e.children||(e.children=[]),e),r(6323)})();
-//# sourceMappingURL=sdfv.js.map
\ No newline at end of file
diff --git a/dist/sdfv.js.LICENSE.txt b/dist/sdfv.js.LICENSE.txt
deleted file mode 100755
index 82c1b784..00000000
--- a/dist/sdfv.js.LICENSE.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-/**
- * @license Complex.js v2.0.12 11/02/2016
- *
- * Copyright (c) 2016, Robert Eisele (robert@xarg.org)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- **/
-
-/**
- * @license Fraction.js v4.0.12 09/09/2015
- * http://www.xarg.org/2014/03/rational-numbers-in-javascript/
- *
- * Copyright (c) 2015, Robert Eisele (robert@xarg.org)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- **/
diff --git a/dist/sdfv.js.map b/dist/sdfv.js.map
deleted file mode 100755
index b200447f..00000000
--- a/dist/sdfv.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/classCallCheck.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/createClass.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/get.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/superPropBase.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/inherits.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/slicedToArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/nonIterableRest.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/iterableToArray.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/typeof.js","webpack://@spcl/sdfv/./node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js","webpack://@spcl/sdfv/./src/overlays/generic_sdfg_overlay.js","webpack://@spcl/sdfv/./src/overlays/memory_volume_overlay.js","webpack://@spcl/sdfv/./src/overlays/runtime_micro_seconds_overlay.js","webpack://@spcl/sdfv/./src/overlays/static_flops_overlay.js","webpack://@spcl/sdfv/./src/utils/bounding_box.js","webpack://@spcl/sdfv/./src/renderer/canvas_manager.js","webpack://@spcl/sdfv/./src/utils/lerp_matrix.js","webpack://@spcl/sdfv/./src/overlay_manager.js","webpack://@spcl/sdfv/./src/renderer/renderer.js","webpack://@spcl/sdfv/./src/renderer/renderer_elements.js","webpack://@spcl/sdfv/./src/sdfv_ui_handlers.js","webpack://@spcl/sdfv/./src/sdfv.js","webpack://@spcl/sdfv/./src/utils/context_menu.js","webpack://@spcl/sdfv/./src/utils/sanitization.ts","webpack://@spcl/sdfv/./src/utils/sdfg/display.js","webpack://@spcl/sdfv/./src/utils/sdfg/json_serializer.ts","webpack://@spcl/sdfv/./src/utils/sdfg/sdfg_utils.js","webpack://@spcl/sdfv/./src/utils/sdfg/traversal.js","webpack://@spcl/sdfv/./src/utils/utils.ts","webpack://@spcl/sdfv/./node_modules/complex.js/complex.js","webpack://@spcl/sdfv/./node_modules/dagre/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/acyclic.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/add-border-segments.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/coordinate-system.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/data/list.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/debug.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/graphlib.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/greedy-fas.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/layout.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/lodash.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/nesting-graph.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/normalize.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/add-subgraph-constraints.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/barycenter.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/build-layer-graph.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/cross-count.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/init-order.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/resolve-conflicts.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/sort-subgraph.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/order/sort.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/parent-dummy-chains.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/position/bk.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/position/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/feasible-tree.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/index.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/network-simplex.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/rank/util.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/util.js","webpack://@spcl/sdfv/./node_modules/dagre/lib/version.js","webpack://@spcl/sdfv/./node_modules/decimal.js/decimal.js","webpack://@spcl/sdfv/./node_modules/escape-latex/dist/index.js","webpack://@spcl/sdfv/./node_modules/fraction.js/fraction.js","webpack://@spcl/sdfv/./node_modules/graphlib/index.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/components.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/dfs.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/dijkstra-all.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/dijkstra.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/find-cycles.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/floyd-warshall.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/index.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/is-acyclic.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/postorder.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/preorder.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/prim.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/tarjan.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/alg/topsort.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/data/priority-queue.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/graph.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/index.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/json.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/lodash.js","webpack://@spcl/sdfv/./node_modules/graphlib/lib/version.js","webpack://@spcl/sdfv/./node_modules/javascript-natural-sort/naturalSort.js","webpack://@spcl/sdfv/./node_modules/lodash/_DataView.js","webpack://@spcl/sdfv/./node_modules/lodash/_Hash.js","webpack://@spcl/sdfv/./node_modules/lodash/_ListCache.js","webpack://@spcl/sdfv/./node_modules/lodash/_Map.js","webpack://@spcl/sdfv/./node_modules/lodash/_MapCache.js","webpack://@spcl/sdfv/./node_modules/lodash/_Promise.js","webpack://@spcl/sdfv/./node_modules/lodash/_Set.js","webpack://@spcl/sdfv/./node_modules/lodash/_SetCache.js","webpack://@spcl/sdfv/./node_modules/lodash/_Stack.js","webpack://@spcl/sdfv/./node_modules/lodash/_Symbol.js","webpack://@spcl/sdfv/./node_modules/lodash/_Uint8Array.js","webpack://@spcl/sdfv/./node_modules/lodash/_WeakMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_apply.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayEach.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayFilter.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayIncludes.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayIncludesWith.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayLikeKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayPush.js","webpack://@spcl/sdfv/./node_modules/lodash/_arrayReduce.js","webpack://@spcl/sdfv/./node_modules/lodash/_arraySome.js","webpack://@spcl/sdfv/./node_modules/lodash/_asciiSize.js","webpack://@spcl/sdfv/./node_modules/lodash/_assignMergeValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_assignValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_assocIndexOf.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseAssign.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseAssignIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseAssignValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseClone.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseCreate.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseEach.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseExtremum.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFilter.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFindIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFlatten.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseFor.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseForOwn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGetAllKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGetTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseGt.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseHasIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIndexOf.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsArguments.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsEqual.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsEqualDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsMatch.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsNaN.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsNative.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIsTypedArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseIteratee.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseKeysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseLt.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMap.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMatches.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMatchesProperty.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMerge.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseMergeDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseOrderBy.js","webpack://@spcl/sdfv/./node_modules/lodash/_basePick.js","webpack://@spcl/sdfv/./node_modules/lodash/_basePickBy.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseProperty.js","webpack://@spcl/sdfv/./node_modules/lodash/_basePropertyDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseRange.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseReduce.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseRest.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseSetToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseSortBy.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseTimes.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseTrim.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseUnary.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseUniq.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseValues.js","webpack://@spcl/sdfv/./node_modules/lodash/_baseZipObject.js","webpack://@spcl/sdfv/./node_modules/lodash/_cacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_castFunction.js","webpack://@spcl/sdfv/./node_modules/lodash/_castPath.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneArrayBuffer.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneBuffer.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneDataView.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneRegExp.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneSymbol.js","webpack://@spcl/sdfv/./node_modules/lodash/_cloneTypedArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_compareAscending.js","webpack://@spcl/sdfv/./node_modules/lodash/_compareMultiple.js","webpack://@spcl/sdfv/./node_modules/lodash/_copyArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_copyObject.js","webpack://@spcl/sdfv/./node_modules/lodash/_copySymbols.js","webpack://@spcl/sdfv/./node_modules/lodash/_copySymbolsIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_coreJsData.js","webpack://@spcl/sdfv/./node_modules/lodash/_createAssigner.js","webpack://@spcl/sdfv/./node_modules/lodash/_createBaseEach.js","webpack://@spcl/sdfv/./node_modules/lodash/_createBaseFor.js","webpack://@spcl/sdfv/./node_modules/lodash/_createFind.js","webpack://@spcl/sdfv/./node_modules/lodash/_createRange.js","webpack://@spcl/sdfv/./node_modules/lodash/_createSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_defineProperty.js","webpack://@spcl/sdfv/./node_modules/lodash/_equalArrays.js","webpack://@spcl/sdfv/./node_modules/lodash/_equalByTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_equalObjects.js","webpack://@spcl/sdfv/./node_modules/lodash/_flatRest.js","webpack://@spcl/sdfv/./node_modules/lodash/_freeGlobal.js","webpack://@spcl/sdfv/./node_modules/lodash/_getAllKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_getAllKeysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_getMapData.js","webpack://@spcl/sdfv/./node_modules/lodash/_getMatchData.js","webpack://@spcl/sdfv/./node_modules/lodash/_getNative.js","webpack://@spcl/sdfv/./node_modules/lodash/_getPrototype.js","webpack://@spcl/sdfv/./node_modules/lodash/_getRawTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_getSymbols.js","webpack://@spcl/sdfv/./node_modules/lodash/_getSymbolsIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_getTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_getValue.js","webpack://@spcl/sdfv/./node_modules/lodash/_hasPath.js","webpack://@spcl/sdfv/./node_modules/lodash/_hasUnicode.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_hashSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_initCloneArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_initCloneByTag.js","webpack://@spcl/sdfv/./node_modules/lodash/_initCloneObject.js","webpack://@spcl/sdfv/./node_modules/lodash/_isFlattenable.js","webpack://@spcl/sdfv/./node_modules/lodash/_isIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/_isIterateeCall.js","webpack://@spcl/sdfv/./node_modules/lodash/_isKey.js","webpack://@spcl/sdfv/./node_modules/lodash/_isKeyable.js","webpack://@spcl/sdfv/./node_modules/lodash/_isMasked.js","webpack://@spcl/sdfv/./node_modules/lodash/_isPrototype.js","webpack://@spcl/sdfv/./node_modules/lodash/_isStrictComparable.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_listCacheSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapCacheSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_mapToArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_matchesStrictComparable.js","webpack://@spcl/sdfv/./node_modules/lodash/_memoizeCapped.js","webpack://@spcl/sdfv/./node_modules/lodash/_nativeCreate.js","webpack://@spcl/sdfv/./node_modules/lodash/_nativeKeys.js","webpack://@spcl/sdfv/./node_modules/lodash/_nativeKeysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/_nodeUtil.js","webpack://@spcl/sdfv/./node_modules/lodash/_objectToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_overArg.js","webpack://@spcl/sdfv/./node_modules/lodash/_overRest.js","webpack://@spcl/sdfv/./node_modules/lodash/_root.js","webpack://@spcl/sdfv/./node_modules/lodash/_safeGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_setCacheAdd.js","webpack://@spcl/sdfv/./node_modules/lodash/_setCacheHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_setToArray.js","webpack://@spcl/sdfv/./node_modules/lodash/_setToString.js","webpack://@spcl/sdfv/./node_modules/lodash/_shortOut.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackClear.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackDelete.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackGet.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackHas.js","webpack://@spcl/sdfv/./node_modules/lodash/_stackSet.js","webpack://@spcl/sdfv/./node_modules/lodash/_strictIndexOf.js","webpack://@spcl/sdfv/./node_modules/lodash/_stringSize.js","webpack://@spcl/sdfv/./node_modules/lodash/_stringToPath.js","webpack://@spcl/sdfv/./node_modules/lodash/_toKey.js","webpack://@spcl/sdfv/./node_modules/lodash/_toSource.js","webpack://@spcl/sdfv/./node_modules/lodash/_trimmedEndIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/_unicodeSize.js","webpack://@spcl/sdfv/./node_modules/lodash/clone.js","webpack://@spcl/sdfv/./node_modules/lodash/cloneDeep.js","webpack://@spcl/sdfv/./node_modules/lodash/constant.js","webpack://@spcl/sdfv/./node_modules/lodash/defaults.js","webpack://@spcl/sdfv/./node_modules/lodash/each.js","webpack://@spcl/sdfv/./node_modules/lodash/eq.js","webpack://@spcl/sdfv/./node_modules/lodash/filter.js","webpack://@spcl/sdfv/./node_modules/lodash/find.js","webpack://@spcl/sdfv/./node_modules/lodash/findIndex.js","webpack://@spcl/sdfv/./node_modules/lodash/flatten.js","webpack://@spcl/sdfv/./node_modules/lodash/forEach.js","webpack://@spcl/sdfv/./node_modules/lodash/forIn.js","webpack://@spcl/sdfv/./node_modules/lodash/get.js","webpack://@spcl/sdfv/./node_modules/lodash/has.js","webpack://@spcl/sdfv/./node_modules/lodash/hasIn.js","webpack://@spcl/sdfv/./node_modules/lodash/identity.js","webpack://@spcl/sdfv/./node_modules/lodash/isArguments.js","webpack://@spcl/sdfv/./node_modules/lodash/isArray.js","webpack://@spcl/sdfv/./node_modules/lodash/isArrayLike.js","webpack://@spcl/sdfv/./node_modules/lodash/isArrayLikeObject.js","webpack://@spcl/sdfv/./node_modules/lodash/isBuffer.js","webpack://@spcl/sdfv/./node_modules/lodash/isEmpty.js","webpack://@spcl/sdfv/./node_modules/lodash/isFunction.js","webpack://@spcl/sdfv/./node_modules/lodash/isLength.js","webpack://@spcl/sdfv/./node_modules/lodash/isMap.js","webpack://@spcl/sdfv/./node_modules/lodash/isObject.js","webpack://@spcl/sdfv/./node_modules/lodash/isObjectLike.js","webpack://@spcl/sdfv/./node_modules/lodash/isPlainObject.js","webpack://@spcl/sdfv/./node_modules/lodash/isSet.js","webpack://@spcl/sdfv/./node_modules/lodash/isString.js","webpack://@spcl/sdfv/./node_modules/lodash/isSymbol.js","webpack://@spcl/sdfv/./node_modules/lodash/isTypedArray.js","webpack://@spcl/sdfv/./node_modules/lodash/isUndefined.js","webpack://@spcl/sdfv/./node_modules/lodash/keys.js","webpack://@spcl/sdfv/./node_modules/lodash/keysIn.js","webpack://@spcl/sdfv/./node_modules/lodash/last.js","webpack://@spcl/sdfv/./node_modules/lodash/map.js","webpack://@spcl/sdfv/./node_modules/lodash/mapValues.js","webpack://@spcl/sdfv/./node_modules/lodash/max.js","webpack://@spcl/sdfv/./node_modules/lodash/memoize.js","webpack://@spcl/sdfv/./node_modules/lodash/merge.js","webpack://@spcl/sdfv/./node_modules/lodash/min.js","webpack://@spcl/sdfv/./node_modules/lodash/minBy.js","webpack://@spcl/sdfv/./node_modules/lodash/noop.js","webpack://@spcl/sdfv/./node_modules/lodash/now.js","webpack://@spcl/sdfv/./node_modules/lodash/pick.js","webpack://@spcl/sdfv/./node_modules/lodash/property.js","webpack://@spcl/sdfv/./node_modules/lodash/range.js","webpack://@spcl/sdfv/./node_modules/lodash/reduce.js","webpack://@spcl/sdfv/./node_modules/lodash/size.js","webpack://@spcl/sdfv/./node_modules/lodash/sortBy.js","webpack://@spcl/sdfv/./node_modules/lodash/stubArray.js","webpack://@spcl/sdfv/./node_modules/lodash/stubFalse.js","webpack://@spcl/sdfv/./node_modules/lodash/toFinite.js","webpack://@spcl/sdfv/./node_modules/lodash/toInteger.js","webpack://@spcl/sdfv/./node_modules/lodash/toNumber.js","webpack://@spcl/sdfv/./node_modules/lodash/toPlainObject.js","webpack://@spcl/sdfv/./node_modules/lodash/toString.js","webpack://@spcl/sdfv/./node_modules/lodash/transform.js","webpack://@spcl/sdfv/./node_modules/lodash/union.js","webpack://@spcl/sdfv/./node_modules/lodash/uniqueId.js","webpack://@spcl/sdfv/./node_modules/lodash/values.js","webpack://@spcl/sdfv/./node_modules/lodash/zipObject.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/core/config.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/entry/configReadonly.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/core/function/config.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/keywords.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/Node.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ArrayNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/BlockNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/latex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ConstantNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ObjectNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/operators.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/RelationalNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/chain/Chain.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/json/reviver.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/OperatorNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/RangeNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/chain/function/chain.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/utils/access.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/AccessorNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/IndexNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/utils/assign.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/SymbolNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/node/FunctionNode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/parse.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/evaluate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/Help.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/Parser.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/help.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/compile.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/util.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/simplifyCore.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/simplifyConstant.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify/resolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/simplify.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/rationalize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/function/parser.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/derivative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/apply.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/filter.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/map.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/subset.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/index.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/concat.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/max.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/min.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/sum.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/column.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/range.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/diff.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/row.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/mean.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/variance.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/expression/transform/std.transform.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/resultset/ResultSet.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/complex/Complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/Range.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/constants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/constants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/constants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/version.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/Matrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/json/replacer.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/physicalConstants.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/fraction/Fraction.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/core/function/typed.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isInteger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isNumeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/utils.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isPositive.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isNaN.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/equalScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/number.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/boolean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/complex/function/complex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/arithmetic.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/cube.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/expm1.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/sign.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/square.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/bitwise.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitNot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/arg.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/im.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/logical.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/not.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/filter.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/forEach.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/map.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/special/erf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/format.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/oct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/print.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isPrime.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/trigonometry.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acsc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/atan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/atanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/cosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/coth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/csch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/tanh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/product.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/combinations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/combinations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/pickRandom.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/randomInt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/clone.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/typeOf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/string.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/fraction/function/fraction.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/exp.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/conj.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/mode.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/bin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acosh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acsch.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asinh.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/cos.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/csc.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sin.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/random.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isNegative.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm01.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm04.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm10.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm13.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm14.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/gcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm02.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm03.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm05.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm11.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm12.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/mod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm06.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm07.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitXor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/or.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/diag.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/identity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/ones.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/reshape.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/size.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/zeros.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/string/hex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/round.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm08.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/leftShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/compare.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/compareText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/smaller.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/larger.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/unequal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/function/sparse.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/acoth.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm09.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/atan2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/sec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/add.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/dot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/composition.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/isZero.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/abs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/floor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/multiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/complex/re.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/flatten.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/error/ArgumentsError.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/resize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/squeeze.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/unit/to.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/pow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/compareNatural.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/equalText.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/largerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/asech.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/tan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setIntersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setMultiplicity.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setSize.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/trace.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/plain/number/probability.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/gamma.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/lcm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/bitwise/bitOr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/kron.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/transpose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/utils/numeric.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/and.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/smallerEq.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/sort.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/trigonometry/cot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setDistinct.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setPowerset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/function/index.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/factorial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/permutations.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/ceil.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/subtract.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/cross.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/prod.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/equal.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setCartesian.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setSymDifference.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/fix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/ctranspose.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/relational/deepEqual.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setIsSubset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/logical/xor.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/matrix/Spa.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/set/setUnion.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/det.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/geometry/distance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/catalan.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/count.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/hypot.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/inv.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/expm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/divide.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/kldivergence.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/log1p.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/Unit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/function/createUnit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/eigs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/geometry/intersect.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/arithmetic/norm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/sqrtm.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/probability/multinomial.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/median.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/rotate.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/mad.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/type/unit/function/unit.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/error/DimensionError.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/error/IndexError.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/apply.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/column.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/concat.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/diff.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/range.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/row.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/matrix/subset.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/max.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/mean.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/min.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/std.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/sum.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/function/statistics/variance.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/array.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/collection.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/customs.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/factory.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/lruQueue.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/function.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/is.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/noop.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/number.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/object.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","webpack://@spcl/sdfv/./node_modules/mathjs/lib/esm/utils/string.js","webpack://@spcl/sdfv/./node_modules/seedrandom/index.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/alea.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/tychei.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xor128.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xor4096.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xorshift7.js","webpack://@spcl/sdfv/./node_modules/seedrandom/lib/xorwow.js","webpack://@spcl/sdfv/./node_modules/seedrandom/seedrandom.js","webpack://@spcl/sdfv/./node_modules/typed-function/typed-function.js","webpack://@spcl/sdfv/webpack/bootstrap","webpack://@spcl/sdfv/webpack/runtime/amd define","webpack://@spcl/sdfv/webpack/runtime/amd options","webpack://@spcl/sdfv/webpack/runtime/compat get default export","webpack://@spcl/sdfv/webpack/runtime/define property getters","webpack://@spcl/sdfv/webpack/runtime/global","webpack://@spcl/sdfv/webpack/runtime/hasOwnProperty shorthand","webpack://@spcl/sdfv/webpack/runtime/node module decorator","webpack://@spcl/sdfv/webpack/startup"],"names":["_arrayLikeToArray","arr","len","length","i","arr2","Array","_assertThisInitialized","self","ReferenceError","_classCallCheck","instance","Constructor","TypeError","_defineProperties","target","props","descriptor","enumerable","configurable","writable","Object","defineProperty","key","_createClass","protoProps","staticProps","prototype","_get","property","receiver","Reflect","get","base","object","hasOwnProperty","call","getPrototypeOf","desc","getOwnPropertyDescriptor","value","_getPrototypeOf","o","setPrototypeOf","__proto__","_inherits","subClass","superClass","create","constructor","_possibleConstructorReturn","_setPrototypeOf","p","_slicedToArray","isArray","Symbol","iterator","_arr","_n","_d","_e","undefined","_s","_i","next","done","push","err","unsupportedIterableToArray","_taggedTemplateLiteral","strings","raw","slice","freeze","defineProperties","_toConsumableArray","arrayLikeToArray","iter","from","_typeof","obj","_unsupportedIterableToArray","minLen","n","toString","name","test","GenericSdfgOverlay","overlay_manager","renderer","this","symbol_resolver","vscode","badness_scale_center","type","ev","mousepos","elements","foreground_elem","ends_drag","MemoryVolumeOverlay","refresh","for_all_elements","e","isected","data","volume","edge","symbol_map","volume_values","volume_string","attributes","replace","parse_symbol_expression","g","that","nodes","forEach","v","state_graph","node","graph","edges","Edge","calculate_volume_edge","NestedSDFG","nested_symbols_map","mapping","symbol_mapping","keys","symbol","calculate_volume_graph","symbol_value_map","badness_scale_method","mean","median","clear_cached_volume_values","recalculate_volume_values","draw_async","ctx","badness","color","getTempColor","shade","ppp","visible_rect","state","lod","STATE_LOD","width","intersect","x","y","w","h","is_collapsed","NODE_LOD","recursively_shade_sdfg","shade_edge","canvas_manager","points_per_pixel","RuntimeMicroSecondsOverlay","criterium","runtime_map","element","State","sdfg","sdfg_list_id","id","sdfg_id","MapExit","parent_id","scope_entry","SDFGNode","undefined_val","micros_values","micros","unit","millis","Math","round","Number","EPSILON","rt_summary","get_element_uuid","tooltip","tooltip_container","innerText","pretty_print_micros","shade_node","StaticFlopsOverlay","flops_map","postMessage","flops","flops_string","flops_values","calculate_flops_node","calculate_flops_graph","clear_cached_flops_values","recalculate_flops_values","isNaN","calculateBoundingBox","bb","height","boundingBox","x1","y1","x2","y2","topleft","calculateEdgeBoundingBox","points","updateEdgeBoundingBox","_canvas_manager_counter","CanvasManager","canvas","anim_id","prev_time","drawables","indices","animation_start","animation_end","animation_target","animation","request_scale","scalef","_destroying","scale_origin","contention","_svg","document","createElementNS","user_transform","createSVGMatrix","addCtxTransformTracking","new_transform","result","a","b","c","d","f","alreadyAnimatingTo","stopAnimation","m1","m2","decompose","m","scale","sqrt","row0x","row0y","row1x","row1y","skew11","skew12","skew21","skew22","angle","atan2","PI","translate","d1","d2","t","lerp","d1Angle","d2Angle","d1Scale","abs","lerpDecomposed","matrix","rotate","lerpMatrix","pt","createSVGPoint","ut","setTransform","svg","_custom_transform_matrix","checker","console","assert","_ctx","scale_func","sx","sy","scaleNonUniform","translate_func","rotate_func","r","transform_func","transform","multiply","setTransform_func","custom_inverseTransformMultiply","matrixTransform","inverse","clearDrawables","counter","drawable","filter","destroy","getContext","getImageData","Uint32Array","buffer","some","diff","isBlank","bgcolor","zoom_to_view","sv","svgPoint","rect","animate","canvas_w","canvas_h","tx","ty","animateTo","el","old_mousepos","new_mousepos","entire_graph","sdfg_list","state_parent_list","drag_start","update_position_info","move_entire_edge","edge_dpoints","out_edges","in_edges","parent_graph","parent_element","outEdges","edge_id","inEdges","dx","dy","edge_point","dist","ddx","cx","ddy","cy","curdist","parent_left_border","parent_right_border","parent_top_border","parent_bottom_border","el_h_margin","el_w_margin","min_x","min_y","max_x","max_y","target_x","target_y","position","get_positioning_info","initialize_positioning_info","move_node_and_connectors","EntryNode","scope_dx","scope_dy","node_id","point","moved","src_connector","out_connectors","intersectRect","dst_connector","dst_el","dst","in_connectors","src_el","src","translate_recursive","ng","state_id","xpos","ypos","parseFloat","toFixed","left","mapPixelToCoordsX","now","start","end","pow","dt","save","clearRect","fillStyle","fillRect","restore","animation_step","applyUserTransform","draw","window","requestAnimationFrame","draw_now","SymbolResolver","symbols","s","constants_prop","includes","symbols_to_define","init_overlay_popup_dialogue","expression_string","prompt_completion","callback","expression_tree","parse","recursive_find_undefined_symbol","prompt_define_symbol","evaluated","evaluate","isInteger","exception","error","pop","popup_dialogue","_show","definition","path","parent","dialogue_background","createElement","body","style","display","_hide","addEventListener","stopPropagation","header_bar","_title","close_button","innerHTML","htmlSanitize","content_box","set_val","_map","_symbol","val","_input","_callback","setCustomValidity","_content","which","footer_bar","confirm_button","map","OverlayManager","overlays","overlay","ol","symbol_value_changed","method","on_mouse_event","check_valid_add_position","lib","SDFGRenderer","container","debug_draw","background","mode_buttons","last_visible_elements","last_hovered_elements","last_clicked_elements","last_dragged_element","menu","toolbar","panmode_btn","movemode_btn","selectmode_btn","addmode_btns","add_type","add_mode_lib","addmode_divs","mode_selected_bg_color","mouse_follow_svgs","mouse_follow_element","all_memlet_trees_sdfg","inclusive_ranges","omit_access_nodes","mouse_mode","box_select_rect","realmousepos","dragging","drag_second_start","external_mouse_handler","ctrl_key_selection","shift_key_movement","add_uuid","add_position","add_edge_start","selected_elements","ex","in_vscode","init_elements","relayout","memlet_tree_complete","update_fast_memlet_lookup","removeChild","cursor","interaction_info_box","interaction_info_text","add_btn","getAttribute","classList","add","backgroundColor","append","dbg_info_box","bottom","right","padding","dbg_mouse_coords","fontSize","appendChild","borderRadius","ContextMenu","className","onclick","visible","getBoundingClientRect","cmenu","addOption","save_as_png","has_pdf","save_as_pdf","addCheckableOption","checked","overlays_menu","_cmenu_elem","overlays_cmenu","is_overlay_active","register_overlay","deregister_overlay","refresh_analysis_pane","show","top","_","reset_positions","title","collapse_all","expand_all","pan","move","select","add_btns","show_select_library_node_dialog","update_toggle_buttons","daemon_connected","show_no_daemon_dialog","pan_mode_btn","move_mode_btn","box_select_btn","shift_click","ctrl_click","on_key_event","exit_preview_btn","viewing_history_state","prevent_refreshes","reset_active","onmouseover","error_popover_container","error_popover_text","error_popover_dismiss","MutationObserver","mutations","onresize","observe","getComputedStyle","set_mouse_handlers","svgs","new_sdfg","uuid","get_uuid_graph_element","fill_info","find_graph_element_by_uuid","br","comp_x","event","clientX","comp_y","mapPixelToCoordsY","clientY","evtype","preventDefault","offsetWidth","offsetHeight","all_memlet_trees","tree","Set","relayout_sdfg","translate_moved_elements","outline","traverse_sdfg_scopes","Node","add_scope_movement","scope_entry_node","sp","isFinite","translate_element","e_id","final_pos_d","edge_pos","set_view","for_all_sdfg_elements","otype","odict","endsWith","send_new_sdfg_to_vscode","delete_positioning_info","filename","contents","link","setAttribute","href","MouseEvent","dispatchEvent","toDataURL","blobStream","canvas2pdf","PdfContext","size","save_all","stream","curx","cury","endx","endy","curw","curh","oldctx","pdf","on","toBlobURL","grid_width","lim_x_min","floor","lim_x_max","ceil","lim_y_min","lim_y_max","moveTo","lineTo","strokeStyle","stroke","beginPath","arc","fill","on_pre_draw","draw_sdfg","old_line_width","lineWidth","x_start","y_start","x_end","y_end","debug_draw_grid","on_post_draw","pos","el_id","isedge_id","offending_element","find_graph_element","message","do_for_intersected_elements","el_type","states","connectors","isedges","func","traverse_recursive","sdfg_name","connector","conntype","isedge","has","mouse_pos_x","mouse_pos_y","elements_in_rect","clicked_states","clicked_nodes","clicked_edges","clicked_interstate_edges","clicked_connectors","total_elements","foreground_surface","category","ctrlKey","shiftKey","selected","remove_graph_nodes","comp_x_func","comp_y_func","dirty","element_focus_changed","multi_selection_changed","touches","buttons","elements_to_move","Connector","list_id","nested_sdfg_parent","state_parent","mouse_elements","find_elements_under_cursor","movementX","movementY","touch1","touch2","oldCenter","initialDistance","currentDistance","newCenter","deltaY","elements_under_cursor","firstElementChild","layerX","clientWidth","layerY","clientHeight","intersected","hovered","highlighted","get_nested_memlet_tree","te","AccessNode","label","nested_graph","sdfg_elem","elements_in_selection","start_x","min","end_x","max","start_y","end_y","contained_in","add_node_to_graph","elements_to_reset","element_moved","relayout_necessary","new_points","j","new_x","new_y","mouse_x","mouse_y","vscode_handle_event","STATE_MARGIN","LINEHEIGHT","dagre","setGraph","setDefaultEdgeLabel","u","stateinfo","state_g","measureText","sdfg_state","multigraph","layout_options","ranksep","ranker","toplevel_nodes","scope_dict","drawn_nodes","hidden_nodes","Map","layout_node","set","dsts","nested_g","layout","find_exit_for_entry","nodesize","labelsize","inconnsize","outconnsize","maxwidth","maxheight","calculateNodeSize","sdfginfo","SDFGElements","cname","conn","setNode","nodeid","hidden_src","hidden_dst","shortcut","add_edge_info_if_hidden","check_and_redirect_edge","setEdge","hidden_node","tmp_edge","shortcut_e","deepCopy","redirected_e","oe","shortcut_edge","gnode","offset_sdfg","SPACING","iconn_length","oconn_length","iconn_x","oconn_x","gedge","src_conn","dst_conn","src_node","cindex","dst_node","relayout_state","sid","offset_state","SDFGElement","elem","elem_id","set_layout","strokeRect","getCssProperty","box_start_x","box_end_x","box_start_y","box_end_y","el_start_x","el_end_x","el_start_y","el_end_y","propertyName","getPropertyValue","trim","SDFG","clamped","fillText","alpha","orig_fill_style","orig_alpha","globalAlpha","fgstyle","bgstyle","textw","xm","ym","quadraticCurveTo","create_arrow_line","wcr","setLineDash","drawArrow","orig_stroke_style","orig_line_cap","lineCap","orig_line_width","dsettings","view_settings","attr","subset","sdfg_property_to_string","other_subset","num_accesses","dynamic","ptLineDistance","fillColor","scope_connector","startsWith","drawEllipse","closePath","substring","substr","nodedesc","_arrays","textmetrics","ScopeNode","draw_shape","drawHexagon","drawTrapezoid","scopeend","far_label","drawAdaptiveText","close_label","SCOPE_LOD","entry","ind","indexOf","attrs","ConsumeEntry","ConsumeExit","pe_index","num_pes","params","sdfg_range_elem_to_string","range","ranges","ExitNode","MapEntry","PipelineEntry","PipelineExit","Tasklet","drawOctagon","TASKLET_LOD","lines","code","string_data","split","maxline","maxline_len","oldfont","font","hr","wr","FONTSIZE","text_yoffset","Reduce","sdfg_dagre","EDGE_LOD","simple_draw","sdfg_graph","offset","eid","nid","far_text","close_text","ppp_thres","max_font_size","font_multiplier","yoffset","tw","hexseg","octseg","kappa","ox","oy","xe","ye","bezierCurveTo","p1","p2","inverted","line1","line2","res","LibraryNode","_path","_path2","assign","globalThis","SDFVUIHandlers","on_init_menu","getElementById","bar","drag","selection","empty","getSelection","removeAllRanges","view","innerWidth","pageX","removeEventListener","on_sidebar_set_title","on_sidebar_show","sidebar_get_contents","on_close_menu","on_outline","sidebar","stack","node_type","nodes_to_display","subnode_id","cancelBubble","on_fill_info","html","sdfg_edge","entries","globals","daceRenderer","sdfg_array","fr","$","file","instrumentation_file","assignIfNotExists","daceUIHandlers","daceInitSDFV","init_sdfv","daceParseSDFG","parse_sdfg","daceStringifySDFG","stringify_sdfg","daceFindInGraph","find_in_graph","daceSDFGPropertyToString","daceSDFGRangeElemToString","daceGetUUIDGraphElement","daceFindGraphElementByUUID","daceTraverseSDFGScopes","daceSDFGTypeclassToString","sdfg_typeclass_to_string","daceStringToSDFGTypeclass","string_to_sdfg_typeclass","daceSDFGRenderer","daceSDFGElements","daceGenericSDFGOverlay","daceMemoryVolumeOverlay","daceRuntimeMicroSecondsOverlay","daceStaticFlopsOverlay","daceMouseEvent","mouse_event","currentScript","hasAttribute","url","location","results","RegExp","exec","decodeURIComponent","getParameterByName","request","XMLHttpRequest","responseType","onload","status","response","alert","onerror","open","Date","getTime","send","load_sdfg_from_url","change","files","reload_file","click","close_menu","load_instrumentation_report","setTimeout","start_find_in_graph","pan_btn","move_btn","select_btn","FileReader","file_read_complete","readAsText","load_instrumentation_report_callback","report","traceEvents","ph","args","dur","values","minmax","get_minmax","runtime_summary","get_overlay","instrumentation_report_read_complete","JSON","MAX_VALUE","find_recursive","query","case_sensitive","toLowerCase","edgeid","sidebar_set_title","onmouseenter","onmouseleave","sidebar_show","ready","html_content","_html_content","_click_close_handlers","_options","onselect","onhover","checkbox","cmenu_div","css","markelem","escapeHTML","escapeCharacters","reduce","String","settings","preview","step","tile","endp1","simplify","prop","index","language","approx","main","stringify","first","subprop","str","argstring","splitidx","lastIndexOf","dtype","count","cb_argstring","cb_args_raw","ret_type","cb_args","raw_arg","arguments","returntype","typeclass","sdfg_json","reviver","replacer","orig_sdfg","recursively_find_graph","graph_id","ns_node","search_graph","entry_node","parseInt","warn","scope_src","new_edge","p_graph","uuid_split","found_graph","Error","set_positioning_info","post_subscope_func","scopes_recursive","processed_nodes","memlet_tree_nested","visited_edges","isview","propagate_forward","propagate_backward","add_children","children","next_node","nested_sdfg","nstate","concat","memlet_tree_recursive","root_sdfg","trees","common_edge","mt","fromEntries","class_name","contains","other","root","cosh","exp","sinh","parser_exit","SyntaxError","logHypot","_a","_b","log","cos","Complex","z","sin","tokens","match","plus","minus","arg","loh","re","im","tmp","expm1","limit","xx","cosm1","t1","t2","Infinity","atan","acos","asin","noIM","oneMinus","onePlus","temp","atanh","asinh","acosh","places","ret","E","NaN","module","exports","graphlib","debug","util","time","notime","version","greedyFAS","run","fas","acyclicer","weight","weightFn","visited","dfs","dfsFAS","removeEdge","forwardName","reversed","uniqueId","undo","addBorderNode","prefix","sg","sgNode","rank","borderType","prev","curr","addDummyNode","setParent","borderLeft","borderRight","minRank","maxRank","swapWidthHeight","swapWidthHeightOne","reverseYOne","swapXYOne","adjust","rankDir","rankdir","reverseY","swapXY","List","sentinel","_next","_prev","_sentinel","unlink","filterOutLinks","k","dequeue","enqueue","strs","join","Graph","debugOrdering","layerMatrix","buildLayerMatrix","compound","layer","layerV","nodeCount","fasGraph","maxIn","maxOut","out","prevWeight","edgeWeight","buckets","zeroIdx","assignBucket","buildState","DEFAULT_WEIGHT_FN","sources","sinks","removeNode","doGreedyFAS","flatten","constant","collectPredecessors","uEntry","wEntry","acyclic","normalize","normalizeRanks","parentDummyChains","removeEmptyRanks","nestingGraph","addBorderSegments","coordinateSystem","order","opts","debugTiming","layoutGraph","inputGraph","canonicalize","merge","graphDefaults","selectNumberAttrs","graphNumAttrs","pick","graphAttrs","defaults","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","minlen","labelpos","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","asNonCompoundGraph","injectEdgeLabelProxies","cleanup","borderTop","borderBottom","assignRankMinMax","dummy","labelRank","removeEdgeLabelProxies","layers","orderShift","selfEdge","insertSelfEdges","selfNode","positionSelfEdges","l","last","removeBorderNodes","fixupEdgeLabelCoords","minX","POSITIVE_INFINITY","maxX","minY","maxY","graphLabel","marginX","marginx","marginY","marginy","getExtremes","translateGraph","nodeV","nodeW","unshift","assignNodeIntersects","reverse","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","edgesep","nodesep","mapValues","newAttrs","lodash","cloneDeep","each","find","forIn","isUndefined","minBy","sortBy","zipObject","nodeSep","depths","child","childNode","childTop","childBottom","thisWeight","nestingEdge","depth","treeDepths","nestingRoot","acc","sumWeights","nodeRankFactor","dummyChains","vRank","wRank","edgeLabel","edgeObj","normalizeEdge","origLabel","successors","cg","vs","rootPrev","prevChild","movable","inV","nodeU","sum","barycenter","relationship","hasNode","createRootNode","setDefaultNodeLabel","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","firstIndex","treeSize","cc","weightSum","layering","initOrder","crossCount","sortSubgraph","buildLayerGraph","addSubgraphConstraints","buildLayerGraphs","ranks","sweepLayerGraphs","layerGraphs","biasRight","lg","sorted","assignOrder","downLayerGraphs","upLayerGraphs","best","bestCC","lastBest","simpleNodes","orderedVs","mappedEntries","indegree","entryV","entryW","sourceSet","handleIn","vEntry","source","merged","handleOut","doResolveConflicts","resolveConflicts","sort","bl","subgraphs","barycenters","subgraphResult","expandSubgraphs","predecessors","blPred","brPred","consumeUnsortable","unsortable","bias","parts","partition","sortable","lhs","rhs","vsIndex","postorderNums","lim","low","postorder","pathData","lca","vPath","wPath","findPath","pathIdx","pathV","ascending","findType1Conflicts","conflicts","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","addConflict","findType2Conflicts","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","conflictsV","hasConflict","verticalAlignment","neighborFn","align","prevIdx","ws","mp","il","horizontalCompaction","reverseSep","xs","blockG","blockGraph","sepFn","edgeSep","delta","vLabel","wLabel","sep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","bind","findSmallestWidthAlignment","xss","NEGATIVE_INFINITY","halfWidth","alignCoordinates","alignTo","alignToVals","alignToMin","alignToMax","vert","horiz","alignment","xsVals","balance","ul","ignore","positionX","adjustedLayering","inner","smallestWidth","rankSep","prevY","maxHeight","positionY","slack","tightTree","nodeEdges","edgeV","findMinSlackEdge","shiftRanks","directed","longestPath","feasibleTree","networkSimplex","networkSimplexRanker","tightTreeRanker","longestPathRanker","initRank","preorder","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","cutvalue","calcCutValue","assignCutValue","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","hasEdge","otherCutValue","dfsAssignLowLim","nextLim","neighbors","tailLabel","flip","candidates","isDescendant","flipped","updateRanks","rootLabel","simplified","simpleLabel","isMultigraph","successorWeights","weightMap","sucs","predecessorWeights","preds","collection","fn","globalScope","Decimal","inexact","quadrant","EXP_LIMIT","MAX_DIGITS","NUMERALS","LN10","DEFAULTS","precision","rounding","modulo","toExpNeg","toExpPos","minE","maxE","crypto","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LN10_PRECISION","PI_PRECISION","P","digitsToString","indexOfLastWord","getZeroString","checkInt32","checkRoundingDigits","rm","repeating","di","rd","convertBase","baseIn","baseOut","arrL","strL","charAt","absoluteValue","finalise","comparedTo","cmp","xdL","ydL","xd","yd","ys","cosine","pr","Ctor","sd","tinyPow","taylorSeries","times","cos2x","toLessThanHalfPi","neg","cubeRoot","cbrt","rep","t3","t3plusx","isZero","toExponential","divide","eq","decimalPlaces","dp","dividedBy","div","dividedToIntegerBy","divToInt","equals","greaterThan","gt","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","isInt","isNegative","isPositive","isPos","lessThan","lt","lessThanOrEqualTo","logarithm","isBase10","denominator","inf","num","naturalLogarithm","getLn10","sub","xLTy","shift","getBase10Exponent","mod","q","naturalExponential","negated","carry","getPrecision","sine","sin2_x","squareRoot","tangent","tan","mul","rL","toBinary","toStringBinary","toDecimalPlaces","toDP","finiteToString","toFraction","maxD","d0","n0","n1","toHexadecimal","toHex","toNearest","toNumber","toOctal","toPower","yn","intPow","toPrecision","toSignificantDigits","toSD","truncated","trunc","valueOf","toJSON","multiplyInteger","compare","aL","bL","subtract","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","sign","isTruncated","digits","roundUp","xdi","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","ltgt","guard","c0","numerator","parseDecimal","search","charCodeAt","parseOther","divisor","isFloat","isHyperbolic","pi","config","useDefaults","ps","getRandomValues","randomBytes","hypot","isDecimalInstance","log2","log10","random","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","_extends","defaultEscapes","formatEscapes","defaultEscapeMapFn","_ref","_ref$preserveFormatti","preserveFormatting","_ref$escapeMapFn","escapeMapFn","runningStr","escapes","escapeKeys","_loop","specialCharFound","createError","errorConstructor","apply","IntermediateInheritor","DivisionByZero","Fraction","InvalidParameter","throwInvalidParam","M","A","B","C","D","N","gcd","eps","cont","rec","excludeWhole","whole","dec","cycLen","cycleLen","cycOff","rem1","rem2","modpow","cycleStart","json","alg","cmpt","cmpts","doDfs","navigation","isDirected","dijkstra","weightFunc","edgeFunc","PriorityQueue","edgeFn","pq","updateNeighbors","distance","predecessor","decrease","removeMin","runDijkstra","DEFAULT_WEIGHT_FUNC","tarjan","rowK","rowI","ik","kj","ij","altDistance","runFloydWarshall","components","dijkstraAll","findCycles","floydWarshall","isAcyclic","prim","topsort","CycleException","parents","pri","priority","init","onStack","lowlink","visit","_keyIndices","keyIndices","_decrease","_swap","_heapify","largest","origArrI","origArrJ","GRAPH_NODE","_isDirected","_isMultigraph","_isCompound","_label","_defaultNodeLabelFn","_defaultEdgeLabelFn","_nodes","_parent","_children","_in","_preds","_out","_sucs","_edgeObjs","_edgeLabels","incrementOrInitEntry","decrementOrRemoveEntry","edgeArgsToId","v_","w_","edgeArgsToObj","edgeObjToId","_nodeCount","_edgeCount","isCompound","newDefault","isFunction","isEmpty","setNodes","_removeFromParentsChildList","ancestor","predsV","sucsV","union","isLeaf","filterNodes","findParent","edgeCount","setPath","valueSpecified","arg0","outV","writeNodes","nodeValue","writeEdges","edgeValue","write","options","read","naturalSort","oFxNcL","oFyNcL","sre","dre","hre","ore","insensitive","xN","yN","xD","yD","cLoc","numS","DataView","getNative","hashClear","hashDelete","hashGet","hashHas","hashSet","Hash","clear","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","ListCache","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","Promise","setCacheAdd","setCacheHas","SetCache","__data__","stackClear","stackDelete","stackGet","stackHas","stackSet","Stack","Uint8Array","WeakMap","thisArg","array","iteratee","predicate","resIndex","baseIndexOf","comparator","baseTimes","isArguments","isBuffer","isIndex","isTypedArray","inherited","isArr","isArg","isBuff","isType","skipIndexes","accumulator","initAccum","asciiSize","baseProperty","baseAssignValue","objValue","copyObject","keysIn","arrayEach","assignValue","baseAssign","baseAssignIn","cloneBuffer","copyArray","copySymbols","copySymbolsIn","getAllKeys","getAllKeysIn","getTag","initCloneArray","initCloneByTag","initCloneObject","isMap","isObject","isSet","argsTag","funcTag","objectTag","cloneableTags","baseClone","bitmask","customizer","isDeep","isFlat","isFull","tag","isFunc","stacked","subValue","objectCreate","baseCreate","proto","baseForOwn","baseEach","createBaseEach","isSymbol","current","computed","fromIndex","fromRight","arrayPush","isFlattenable","baseFlatten","isStrict","baseFor","createBaseFor","castPath","toKey","keysFunc","symbolsFunc","getRawTag","objectToString","symToStringTag","toStringTag","baseFindIndex","baseIsNaN","strictIndexOf","baseGetTag","isObjectLike","baseIsEqualDeep","baseIsEqual","equalArrays","equalByTag","equalObjects","arrayTag","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","isMasked","toSource","reIsHostCtor","funcProto","Function","objectProto","funcToString","reIsNative","isLength","typedArrayTags","baseMatches","baseMatchesProperty","identity","isPrototype","nativeKeys","nativeKeysIn","isProto","isArrayLike","baseIsMatch","getMatchData","matchesStrictComparable","hasIn","isKey","isStrictComparable","assignMergeValue","baseMergeDeep","safeGet","baseMerge","srcIndex","newValue","cloneTypedArray","isArrayLikeObject","isPlainObject","toPlainObject","mergeFunc","isCommon","isTyped","arrayMap","baseGet","baseIteratee","baseMap","baseSortBy","baseUnary","compareMultiple","iteratees","orders","basePickBy","paths","baseSet","nativeCeil","nativeMax","eachFunc","overRest","setToString","lastIndex","nested","baseSetToString","string","comparer","symbolProto","symbolToString","baseToString","trimmedEndIndex","reTrimStart","arrayIncludes","arrayIncludesWith","cacheHas","createSet","setToArray","seen","outer","seenIndex","assignFunc","valsLength","cache","stringToPath","arrayBuffer","byteLength","freeExports","nodeType","freeModule","Buffer","allocUnsafe","cloneArrayBuffer","dataView","byteOffset","reFlags","regexp","symbolValueOf","typedArray","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","compareAscending","objCriteria","criteria","othCriteria","ordersLength","isNew","getSymbols","getSymbolsIn","coreJsData","baseRest","isIterateeCall","assigner","iterable","findIndexFunc","baseRange","toFinite","noop","arraySome","isPartial","arrLength","othLength","arrStacked","othStacked","arrValue","othValue","compared","othIndex","mapToArray","convert","objProps","objLength","objStacked","skipCtor","objCtor","othCtor","freeGlobal","baseGetAllKeys","isKeyable","baseIsNative","getValue","getPrototype","overArg","nativeObjectToString","isOwn","unmasked","arrayFilter","stubArray","propertyIsEnumerable","nativeGetSymbols","getOwnPropertySymbols","mapTag","promiseTag","setTag","weakMapTag","dataViewTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","ArrayBuffer","resolve","ctorString","hasFunc","reHasUnicode","nativeCreate","input","cloneDataView","cloneRegExp","cloneSymbol","spreadableSymbol","isConcatSpreadable","reIsUint","reIsDeepProp","reIsPlainProp","uid","maskSrcKey","IE_PROTO","assocIndexOf","splice","getMapData","memoize","freeProcess","process","nodeUtil","require","types","binding","otherArgs","freeSelf","shortOut","nativeNow","lastCalled","stamp","remaining","pairs","LARGE_ARRAY_SIZE","hasUnicode","unicodeSize","memoizeCapped","rePropName","reEscapeChar","number","quote","subString","reWhitespace","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","rsSymbol","reUnicode","CLONE_DEEP_FLAG","propsIndex","propsLength","baseFilter","createFind","toInteger","castFunction","defaultValue","baseHas","hasPath","baseHasIn","baseIsArguments","stubFalse","baseKeys","baseIsMap","nodeIsMap","objectCtorString","baseIsSet","nodeIsSet","baseIsTypedArray","nodeIsTypedArray","arrayLikeKeys","baseKeysIn","baseExtremum","baseGt","resolver","memoized","Cache","createAssigner","baseLt","basePick","flatRest","basePropertyDeep","createRange","arrayReduce","baseReduce","isString","stringSize","baseOrderBy","remainder","baseTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","isArrLike","baseUniq","arrays","idCounter","baseValues","baseZipObject","epsilon","predictable","randomSeed","MATRIX_OPTIONS","NUMBER_OPTIONS","keywords","dependencies","createNode","factory","mathWithTransform","scope","compile","isNode","comment","expr","_compile","_validateScope","math","argNames","_ifNode","is","traverse","_traverse","_transform","replacement","customString","_getCustomString","_toString","toHTML","toTex","_toTex","handler","getIdentifier","getContent","isClass","createArrayNode","ArrayNode","items","every","isArrayNode","evalItems","item","context","evalItem","mathjs","fromJSON","createBlockNode","ResultSet","BlockNode","blocks","block","isBlockNode","evalBlocks","param","latexSymbols","Alpha","Beta","beta","Gamma","gamma","Delta","Epsilon","varepsilon","Zeta","zeta","Eta","eta","Theta","theta","vartheta","Iota","iota","Kappa","varkappa","Lambda","lambda","Mu","mu","Nu","nu","Xi","Omicron","omicron","Pi","varpi","Rho","rho","varrho","Sigma","sigma","varsigma","Tau","tau","Upsilon","upsilon","Phi","phi","varphi","Chi","chi","Psi","psi","Omega","omega","true","false","Inf","infinity","oo","latexOperators","transpose","ctranspose","factorial","dotPow","unaryPlus","unaryMinus","bitNot","not","dotMultiply","dotDivide","to","leftShift","rightArithShift","rightLogShift","equal","unequal","smaller","larger","smallerEq","largerEq","bitAnd","bitXor","bitOr","and","xor","or","latexFunctions","1","2","cube","fix","log1p","norm","nthRoot","nthRoots","square","bellNumbers","catalan","stirlingS2","conj","cross","det","dot","expm","inv","sqrtm","trace","combinations","combinationsWithRep","erf","variance","acot","acoth","acsc","acsch","asec","asech","cot","coth","csc","csch","sec","sech","numeric","0","bignumber","complex","sparse","latexUnits","deg","escapeLatex","toSymbol","isUnit","createConstantNode","ConstantNode","isConstantNode","toLatex","createObjectNode","ObjectNode","properties","isObjectNode","evalEntries","stringifiedKey","parsedKey","_key","createParenthesisNode","ParenthesisNode","content","isParenthesisNode","parenthesis","AssignmentNode","FunctionAssignmentNode","ConditionalNode","latexLeftParens","latexRightParens","latexParens","associativity","associativeWith","RelationalNode","RangeNode","getPrecedence","_node","identifier","getAssociativity","isAssociativeWith","nodeA","nodeB","identifierA","identifierB","createRelationalNode","conditionals","isRelationalNode","compiled","evalLhs","evalRhs","condFn","precedence","paramStrings","paramPrecedence","operatorMap","createChainClass","Chain","createLazyProxy","chainify","isChain","createProxy","arg1","_name","excludedNames","expression","docs","classes","createReviver","createConditionalNode","condition","trueExpr","falseExpr","isConditionalNode","evalCondition","evalTrueExpr","evalFalseExpr","testCondition","conditionPrecedence","truePrecedence","falsePrecedence","createOperatorNode","OperatorNode","op","implicit","calculateNecessaryParentheses","latex","operandPrecedence","operandIdentifier","rootIdentifier","lhsParens","rhsParens","lhsPrecedence","assocWithLhs","_rootIdentifier","lhsIdentifier","rhsIdentifier","rhsPrecedence","assocWithRhs","argPrecedence","assocWithArg","argAssociativity","isOperatorNode","evalArgs","evalArg0","_evalArg","evalArg1","evalArg","isUnary","parens","assoc","operand","opIsNamed","stringifiedArgs","lhsTex","rhsTex","texifiedArgs","createRangeNode","startPrecedence","stepPrecedence","endPrecedence","isRangeNode","needsEnd","evalStart","evalEnd","evalStep","createFunctionAssignmentNode","typed","needParenthesis","exprPrecedence","isFunctionAssignmentNode","childArgNames","evalExpr","signature","syntax","signatures","childArgs","createChain","any","errorTransform","isIndexError","IndexError","accessFactory","isObjectProperty","getObjectProperty","createAccessorNode","access","AccessorNode","isAccessorNode","evalObject","evalIndex","createIndexNode","Range","IndexNode","dimensions","dotNotation","isIndexNode","evalDimensions","_evalStart","_evalEnd","_evalStep","_childArgNames","evalRange","_evalRange","evalDimension","createAssignmentNode","assignFactory","isAssignmentNode","evalValue","childObject","evalParentObject","parentProp","evalParentIndex","parentIndex","createSymbolNode","Unit","isValuelessUnit","SymbolNode","isSymbolNode","undef","createFunctionNode","FunctionNode","isFunctionNode","rawArgs","_rawArgs","evalFn","_rawArgs2","nodeToString","expandTemplate","template","regex","inputPos","nodeToTex","customTex","latexConverter","customToTex","createParse","parseStart","expressions","parseMultiple","extraNodes","DELIMITERS","'","NAMED_DELIMITERS","in","CONSTANTS","null","NUMERIC_CONSTANTS","currentString","currentCharacter","prevCharacter","nextCharacter","getToken","tokenType","token","isWhitespace","nestingLevel","c1","c2","c3","isDigitDot","_c","isHexDigit","isDigit","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","parseImplicitMultiplication","parseRule2","parseUnary","tokenStates","CustomNode","parseAccessors","parseDoubleQuotesStringToken","parseSingleQuotesStringToken","rows","cols","row","parseRow","numberStr","parseEnd","parseParentheses","parseNumber","parseObject","parseMatrix","parseSingleQuotesString","parseDoubleQuotesString","parseSymbol","parseCustomNodes","parseLeftHandOperators","parsePow","col","char","cPrev","cNext","isValidLatinOrGreek","isValidMathSymbol","high","createEvaluate","createHelpClass","Help","doc","isHelp","description","examples","seealso","createParserClass","Parser","isParser","getAll","remove","piDocs","eDocs","embeddedDocs","boolean","createUnit","fraction","splitUnit","LN2","LOG2E","LOG10E","SQRT1_2","SQRT2","speedOfLight","gravitationConstant","planckConstant","reducedPlanckConstant","magneticConstant","electricConstant","vacuumImpedance","coulomb","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","lsolve","lsolveAll","lup","lusolve","rationalize","slu","usolve","usolveAll","qr","lcm","xgcd","composition","import","help","column","diag","getMatrixDataType","eigs","kron","ones","partitionSelect","resize","reshape","rotationMatrix","squeeze","zeros","kldivergence","multinomial","permutations","pickRandom","randomInt","compareNatural","compareText","deepEqual","equalText","setCartesian","setDifference","setDistinct","setIntersect","setIsSubset","setMultiplicity","setPowerset","setSize","setSymDifference","setUnion","mad","mode","quantileSeq","std","format","bin","oct","hex","isNumeric","hasNumericValue","isPrime","typeOf","createHelp","searchName","searchText","createCompile","createUtil","commutative","associative","isAssociative","allChildren","findChildren","createMakeNodeFunction","isCommutative","unflattenr","makeNode","curnode","unflattenl","createSimplifyCore","node0","node1","simplifyCore","a0","a1","a00","a00a1","a01","createSimplifyConstant","_eval","fnname","_toNumber","_toNode","vn","unaryMinusNode","BigNumber","_exactFraction","exactFractions","fractionsLimit","foldOp","ignoreandcontinue","foldFraction","ignoreandcontine","_args","consts","vars","createResolve","createSimplify","simplifyConstant","rules","ruleSet","rule","newRule","ruleType","lr","removeParens","expandsym","_lastsym","expanded","_buildRules","applyRule","SUPPORTED_CONSTANTS","repl","matches","_ruleMatch","placeholders","mergeMatch","match1","match2","_exactMatch","combineChildMatches","list1","list2","i1","i2","isSplit","splits","rightArgs","getSplits","splitMatches","matchSet","childMatches","childMatch","sets","uniqueSets","unique","mergeChildMatches","createRationalize","detailed","setRules","oldRules","rulesFirst","rulesSucDiv","firstRules","distrDivRules","sucDivRules","firstRulesAgain","finalRules","rulesRationalize","polyRet","extended","variables","oper","recPoly","tp","retFunc","polynomial","nVars","sBefore","expandPower","eDistrDiv","redoInic","coefficients","retRationalize","polyToCanonical","indParent","internal","does","nEsqTopo","nDirTopo","maxExpo","varname","recurPol","noPai","noFil","fire","cte","valor","_i2","no","n2","n3","createParser","createDerivative","variable","constNodes","constTag","_derivative","_simplify","deriv","_derivTex","varName","isConst","funcArgsCheck","funcDerivative","negative","chainDerivative","constantTerms","nonConstantTerms","nonConstantNode","newArgs","argOuter","argInner","_arg","_arg2","powMinusOne","valueType","createApplyTransform","dim","isTransformFunction","compileInlineExpression","subScope","createFilterTransform","filterTransform","_filter","toArray","createMapTransform","mapTransform","orig","argsCount","recurse","createForEachTransform","forEachTransform","_forEach","createSubsetTransform","createIndexTransform","Index","ii","createConcatTransform","lastDimToZeroBase","createMaxTransform","createMinTransform","createSumTransform","createColumnTransform","createRangeTransform","createDiffTransform","createRowTransform","createMeanTransform","createVarianceTransform","createStdTransform","chain","parser","equalScalar","multiplyScalar","print","addScalar","divideScalar","Matrix","DenseMatrix","SparseMatrix","ImmutableDenseMatrix","FibonacciHeap","Spa","createResultSet","isResultSet","createComplexClass","strRe","strIm","hasBase","createRangeClass","hasStart","hasEnd","hasStep","isRange","nums","createBigNumberE","hasher","createBigNumberPhi","createBigNumberPi","createBigNumberTau","createTrue","createFalse","createNull","createInfinity","recreateFactory","createNaN","_ref2","createPi","_ref3","createTau","_ref4","createE","_ref5","createPhi","_ref6","createLN2","_ref7","createLN10","_ref8","createLOG2E","_ref9","createLOG10E","_ref10","createSQRT1_2","_ref11","createSQRT2","_ref12","createI","_ref13","I","createVersion","recreateOnConfigChange","createBigNumberClass","isBigNumber","createMatrixClass","isMatrix","storage","datatype","skipZeros","createReplacer","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","valueStr","unitStr","fixPrefix","createFractionClass","createDenseMatrixClass","_data","_size","_datatype","preprocess","isScalar","DimensionError","_getSubmatrix","dims","dimension","_set","submatrix","sSize","iSize","_fit","_setSubmatrix","dataIndex","subIndex","_resize","newSize","changed","createDenseMatrix","isDenseMatrix","getDataType","indexI","sizeArray","currentLength","me","diagonal","kSuper","kSub","columns","_value","ms","swapRows","_swapRows","vi","_createTyped2","createTyped","conversions","throwNoBignumber","throwNoComplex","throwNoFraction","throwNoMatrix","createIsInteger","createIsNumeric","isNegativeNumber","isPositiveNumber","isZeroNumber","isNaNNumber","createIsPositive","createIsNaN","createEqualScalar","complexEquals","equalBase","createNumber","nonDecimalWithRadixMatch","nonDecimalNumberParts","radix","integerPart","fractionalPart","makeNumberFromNonDecimalParts","wordSizeSuffixMatch","valuelessUnit","createBoolean","lcase","createComplex","ZERO","createSplitUnit","absNumber","addNumber","multiplyNumber","unaryMinusNumber","unaryPlusNumber","cbrtNumber","ceilNumber","cubeNumber","expNumber","expm1Number","gcdNumber","lcmNumber","logNumber","log10Number","log2Number","modNumber","signNumber","squareNumber","xgcdNumber","lastx","lasty","powNumber","roundNumber","decimals","createUnaryPlus","createCube","createExpm1","_Complex","createLog10","createMultiplyScalar","_normalize","createSign","_BigNumber","_Fraction","createSquare","bitAndBigNumber","bitwise","bitNotBigNumber","prevPrec","bitOrBigNumber","negOne","xBits","yBits","minBits","maxBits","minSign","xSign","ySign","decCoefficientToBinaryString","shortLen","longLen","expFuncVal","outVal","twoPower","two","_j","leftShiftBigNumber","rightArithShiftBigNumber","bitAndNumber","bitNotNumber","bitOrNumber","bitXorNumber","leftShiftNumber","rightArithShiftNumber","rightLogShiftNumber","createBitNot","createArg","createIm","notNumber","orNumber","xorNumber","andNumber","createNot","createFilter","_filterCallback","createForEach","createMap","createErf","MAX_NUM","THRESH","ysq","xnum","xden","Q","erf1","del","erfc2","SQRPI","erfc3","createFormat","createOct","notation","wordSize","createPrint","_print","original","createIsPrime","createAcos","acoshNumber","acotNumber","acothNumber","acscNumber","acschNumber","xInv","asecNumber","asechNumber","asinhNumber","atanhNumber","cotNumber","cothNumber","cscNumber","cschNumber","secNumber","sechNumber","sinhNumber","createAcot","createAcsc","createAsec","createAsin","createAtan","createAtanh","createCosh","BASE_UNITS","ANGLE","createCoth","createCsch","createSech","createSinh","createTanh","product","half","combinationsNumber","nMinusk","createCombinations","isPositiveInteger","singletonRandom","seedrandom","seed","createPickRandom","rng","possibles","_pickRandom","weights","elementWise","single","createMatrix","totalWeights","randKey","_len","randomMatrix","_length","createRandomInt","_randomInt","_randomIntMatrix","createClone","createHasNumericValue","createTypeOf","createString","createFraction","createUnaryMinus","createAddScalar","createExp","createLog2","_log2Complex","newX","createSqrt","_sqrtNumber","createConj","conjugate","createGetMatrixDataType","createMode","_mode","createBin","createAcosh","createAcsch","createAsinh","createCos","createCsc","createSin","createCombinationsWithRep","nMinusOne","createRandom","_random","_randomMatrix","createIsNegative","createSparseMatrixClass","_values","_index","_ptr","_createFromArray","_createFromMatrix","ptr","zero","_getsubset","idx","kk","mvalues","mindex","mptr","pv","_setsubset","x0","y0","_getValueIndex","_insert","ins","_toArray","createSparseMatrix","isSparseMatrix","density","_remove","sizes","colIndex","rowIndex","r1","flat","_i3","minRow","maxRow","minColumn","maxColumn","invoke","_k","_i5","_k2","_i7","_forEachRow","kx","ky","vx","vy","_create","createCbrt","_cbrtComplex","third","negate","_result","allRoots","arg3","principal","all","createAlgorithm01","denseMatrix","sparseMatrix","adata","asize","adt","bvalues","bindex","bptr","bsize","bdt","RangeError","cf","cdata","mark","createAlgorithm04","avalues","aindex","aptr","cvalues","cptr","xa","xb","wa","wb","createAlgorithm10","createAlgorithm13","bdata","csize","_iterate","level","av","bv","cv","createAlgorithm14","createGcd","algorithm01","algorithm04","algorithm10","algorithm13","algorithm14","createAlgorithm02","cij","createAlgorithm03","createAlgorithm05","wai","wbi","vc","createAlgorithm11","createAlgorithm12","createMod","algorithm02","algorithm03","algorithm05","algorithm11","algorithm12","createAlgorithm06","createNthRoot","algorithm06","complexErr","_bigNthRoot","Big","createXgcd","createBitAnd","createAlgorithm07","_scatter","va","vb","createBitXor","algorithm07","createOr","createDiag","_diag","_createDiagonalMatrix","dm","vector","_getDiagonal","createIdentity","_identity","_identityVector","minimum","createOnes","_ones","hasBigNumbers","_validate","createReshape","createSize","createZeros","_zeros","createHex","ownKeys","enumerableOnly","sym","_objectSpread","_defineProperty","getOwnPropertyDescriptors","NO_INT","createRound","roundNumberSignatures","createAlgorithm08","createLeftShift","algorithm08","createRightLogShift","createCompare","createCompareText","createSmaller","createLarger","createUnequal","_unequal","createImmutableDenseMatrixClass","_min","_max","isImmutableDenseMatrix","createFibonacciHeapClass","oneOverLogPhi","_minimum","_cut","degree","_cascadingCut","isFibonacciHeap","insert","extractMinimum","numberOfChildren","tempRight","arraySize","numRoots","_linkNodes","_findMinimumNode","_decreaseKey","createSparse","createAcoth","createAlgorithm09","createAtan2","algorithm09","createSec","createAdd","rest","createDot","_validateDim","aIsColumn","bIsColumn","_c2","_c3","xindex","xvalues","yindex","yvalues","J","xLen","yLen","xSize","ySize","createComposition","createIsZero","createAbs","createFloor","exponent","createMultiply","_validateMatrixDimensions","size1","size2","_multiplyMatrixVector","arows","acolumns","af","mf","brows","ib","vbi","ka0","ka1","ka","ia","ic","_multiplyMatrixMatrix","bcolumns","jb","kb0","kb1","kb","vbij","p0","xsize","ysize","_multiplyVectorVector","alength","_multiplyVectorDenseMatrix","_multiplyVectorMatrix","createDotMultiply","createRe","createFlatten","ArgumentsError","isArgumentsError","createResize","_resizeString","asMatrix","defaultChar","createSqueeze","createTo","createPow","_pow","_powArray","_powMatrix","yFrac","yNum","createDotPow","createRightArithShift","createCompareNatural","compareBooleans","typeX","typeY","compareMatricesAndArrays","compareComplexNumbers","compareArrays","formatUnits","keysX","keysY","compareObjects","createEqualText","createLargerEq","createPartitionSelect","asc","_partitionSelect","quickSelect","pivot","createIndexClass","_dimensions","_isScalar","_createImmutableMatrix","createAsech","createTan","createSetDifference","a2","inb2","b1","b2","createSetIntersect","createSetMultiplicity","createSetSize","createTrace","_denseTrace","createQuantileSeq","_quantileSeq","prob","_fracPart","validate","_left","_right","_integerPart","fracPart","integerPartNumber","probOrN","probArr","dataArr","nPlusOne","intN","_nPlusOne","currProb","gammaNumber","twoN","threeN","fourN","fiveN","gammaP","gammaG","createGamma","real","den","twoPiSqrt","bigFactorial","createBignumber","twoPowSize","twoPowSizeSubOne","createLcm","createBitOr","createKron","_kron","createTranspose","transposedRow","transposed","_denseTranspose","_sparseTranspose","createNumeric","_number","validInputTypes","validOutputTypes","outputType","inputType","createAnd","createSmallerEq","createSort","compareAsc","compareDesc","_arrayIsVector","_matrixIsVector","_comparator","createCot","createSetDistinct","createSetPowerset","_subset","_sort","bitarray","createIndex","createFactorial","createPermutations","createCeil","createSubtract","checkEqualDimensions","createCross","_cross","highestDimension","createProd","_prod","improveErrorMessage","createEqual","createSetCartesian","createSetSymDifference","createFix","createCtranspose","createDeepEqual","_deepEqual","createSetIsSubset","createXor","createDivideScalar","createNthRoots","_calculateExactResult","_nthComplexRoots","aIsNumeric","roots","halfPiFactor","createSolveValidation","mSize","bSize","_i4","createLsolve","solveValidation","bj","vjj","jValues","jIndices","xj","_sparseForwardSubstitution","_denseForwardSubstitution","mdata","createLsolveAll","b_","L","iValues","iIndices","Mii","bNew","_j3","_lastIndex2","_J2","_j2","_lastIndex","_J","createSpaClass","_heap","isSpa","accumulate","heap","swap","nodei","nodej","createSetUnion","createLup","_denseLUP","lvalues","lindex","lptr","lsize","uvalues","uindex","uptr","usize","pvCo","pvOc","spa","vkj","vik","pabsv","absv","U","_sparseLUP","ldata","udata","vij","csTdfs","head","post","csFlip","createCsAmd","lemax","dense","cm","at","tindex","tptr","_createTargetMatrix","nz","csFkeep","k2","pj","nvi","pk","eln","pn","cnz","W","nv","elen","hhead","_wclear","_initializeQuotientGraph","nel","_initializeDegreeLists","mindeg","elenk","nvk","dk","pk1","pk2","wnvi","dext","p3","p4","nvj","jlast","ok","csLeaf","maxfirst","prevleaf","sparent","jleaf","jprev","createCsCounts","ata","colcount","createCsSqr","csAmd","csCounts","pinv","t0","csPermute","inext","csEtree","csPost","cp","leftmost","tail","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","createDet","decomp","evenCycles","_det","createDistance","_2d","xCoeff","yCoeff","_distancePointLine2D","lineTwoPtY","lineTwoPtX","lineOnePtY","lineOnePtX","pointX","pointY","_3d","_parametricLine","_distancePointLine3D","_containsOnlyNumbers","_euclideanDistance","xCoeffLine","yCoeffLine","pointZ","z0","pointOneX","pointOneY","pointTwoX","pointTwoY","pointOneZ","pointTwoZ","_isNumber","aI","_pairwise","pointA","pointB","_distancePairwise","_objectToArray","vectorSize","createStirlingS2","kFactorial","negativeOne","kChooseI","iPower","createCatalan","createCount","createLog","createDotDivide","createUsolveAll","_sparseBackwardSubstitution","_denseBackwardSubstitution","createHypot","createQr","_denseQR","_sparseQR","R","_denseQRimpl","Qdata","Rdata","sgn","conjSgn","alphaSquared","u1","createInv","_inv","mat","ABig","rBig","Ac","Bc","Ar","Br","createExpm","infNorm","errorEstimate","findParams","rowSum","infinityNorm","Apos","factor","AposToI","alternate","qfac","twoqfac","twoqp1fac","createDivide","createKldivergence","_kldiv","plength","qlength","qnorm","pnorm","createBellNumbers","createLog1p","_log1pComplex","xRe1p","createUnitClass","text","units","UNIT_NONE","PREFIXES","NONE","power","BASE_DIMENSIONS","skipAutomaticSimplification","skipWhitespace","revert","oldIndex","tentativeNumber","tentativeIndex","parseUnit","unitName","isValidAlpha","firstC","parseCharacter","toFind","powerMultiplierCurrent","expectingUnit","powerMultiplierStack","powerMultiplierStackProduct","uStr","oldC","_findUnit","baseDim","UNIT_SYSTEMS","auto","allowNoUnits","_isDerived","unitValue","unitOffset","unitPower","unitPrefixValue","_getNumberConverter","_denormalize","prefixValue","UNITS","prefixes","_unit","prefixLen","prefixName","_prefix","getNumericIfUnitless","valThis","valOther","toNumeric","matchingBase","matchingUnit","proposedUnitList","currentUnitSystem","missingBaseDim","toSI","si","strNum","strDen","nNum","nDen","simp","isImaginary","VAR","VA","_bestPrefix","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","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","BIT","meter","inch","foot","yard","mile","rod","angstrom","ft","mi","li","ch","mil","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","acre","hectare","m3","litre","cuin","cuft","cuyd","teaspoon","tablespoon","drop","gtt","minim","fluiddram","fluidounce","gill","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","fldr","floz","gi","qt","gal","bbl","obl","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","stone","gr","dr","oz","lbm","cwt","second","minute","hour","day","week","month","year","decade","century","millennium","hertz","reciprocal","Hz","rad","radian","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","atm","torr","mmHg","mmH2O","cmH2O","farad","F","volt","V","ohm","henry","H","siemens","S","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","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","cgs","us","_key2","setUnitSystem","getUnitSystem","typeConverters","_name2","_unit2","alias","_key3","override","_key4","deleteUnit","aliases","lastUnit","_key5","createUnitSingle","assertUnitNameIsValid","baseName","defUnit","toUpperCase","newUnit","anyMatch","_newBaseUnit","newBaseUnit","_i6","_i8","aliasName","_alias","_key6","createCreateUnit","def","createEigs","ans","checkAndSubmit","vectors","isSymmetric","xArr","e0","Sij","createArray","aii","ajj","aij","denom","Vab","getAijBig","x1Big","Sij1Big","sorting","diagBig","getAij","Sij1","Ski","Skj","Hij","s2","Aki","Akj","csHij","Aii","Ajj","_k3","_k4","Mij","maxMij","maxIJ","Ef","Sf","minID","_k5","createIntersect","plane","_isNumeric","_4d","z1","z2","x1x","x2x","y1y","y2y","z1z","z2z","_intersectLinePlane","p1a","p1b","p2a","p2b","o1","o2","d20o11","d21o10","d20o21","d21o20","_intersect2d","x3","y3","z3","d1343","_intersect3dHelper","x4","y4","z4","d4321","d1321","d4343","d2121","ta","tb","pax","pay","paz","pbx","pby","pbz","add1","add2","add3","createUsolve","createNorm","_norm","sizeX","pinf","_vectorNormPlusInfinity","ninf","_vectorNormMinusInfinity","_vectorNorm","maxc","cj","_matrixNormOne","maxr","ri","_matrixNormInfinity","fro","_matrixNormFrobenius","squaredX","eigenVals","_matrixNormTwo","_matrixNorm","csIpvec","createLusolve","_lusolve","_toMatrix","createSqrtm","_tolerance","_denmanBeavers","iterations","Yk","createMultinomial","ai","createRotationMatrix","_rotationMatrix2x2","matrixV","_validateVector","_rotationMatrix3x3","storageType","minusOne","cosTheta","sinTheta","_convertToFormat","_mul","normV","vz","oneMinusC","createMedian","_median","mid","middle2","middle","createRotate","_validateSize","expectedSize","actualSize","createMad","_mad","med","createUnitFunction","_false","_null","_true","_NaN","_Infinity","actual","expected","relation","isDimensionError","createApply","_apply","tran","_switch","createColumn","_column","rowRange","createConcat","prevDim","matrices","_concat","concatDim","createDiff","_diff","_recursive","_ElementDiff","obj1","obj2","obj1IsArray","obj2IsArray","arr1","_ArrayDiff","_strRange","_rangeEx","includeEnd","_rangeInc","_bigRangeEx","_bigRangeInc","_parse","createRow","_row","columnRange","createSubset","_getObjectProperty","_getSubstring","_setSubstring","_setObjectProperty","strLen","chars","updated","createMax","_largest","createMean","_mean","createMin","_smallest","createStd","_std","normalization","createSum","_sum","fnName","details","DEFAULT_NORMALIZATION","createVariance","_var","_varDim","dimNext","validateIndex","oldLen","newLen","flatArray","newLength","processSizesWildcard","tmpArray2","tmpArray","sizeIndex","_reshape","processedSizes","wildCardIndex","_squeeze","unsqueeze","_unsqueeze","filterRegExp","separator","identify","generalize","getArrayDataType","itemType","containsCollections","deepForEach","deepMap","_reduce","scatter","update","getSafeProperty","isSafeProperty","isSafeMethod","setSafeProperty","safeNativeProperties","validateSafeMethod","safeNativeMethods","toLocaleString","meta","assertAndCreate","deps","stripOptionalNotation","dependency","isOptionalDependency","missingDependencies","assertDependencies","isFactory","lruQueue","queue","hit","nuIndex","delete","lru","hash","newVal","maxArgumentCount","isNumber","isComplex","isFraction","isCollection","isBoolean","isDate","isRegExp","isNull","noBignumber","noFraction","noMatrix","formatNumberToBase","8","16","suffix","rounded","roundDigits","splitNumber","newExp","missingZeros","expDiff","decimalIdx","decimalVal","toEngineering","lowerExp","upperExp","splitValue","pp","DBL_EPSILON","nearlyEqual","mapObject","extend","deepStrictEqual","lazy","valueResolver","_uninitialized","pickShallow","formatBigNumberToBase","big2","BigNumberCtor","valueWithoutExp","looksLikeFraction","formatArray","escaped","alea","xor128","xorwow","xorshift7","xor4096","tychei","sr","global","define","Alea","mash","s0","s1","impl","xg","prng","int32","double","quick","XorGen","strseed","X","pool","nodecrypto","startdenom","significance","overflow","mask","shortseed","mixkey","entropy","tostring","msCrypto","browser","navigator","plugins","screen","autoseed","arc4","ARC4","pass","is_math_call","keylen","typ","smear","stringseed","fromCharCode","notOk","_types","anyType","_ignore","_conversions","findTypeByName","typeName","findInArray","hint","findTypeIndex","findTypeName","stringifyParams","typeNames","getTypeName","restParam","parseParam","notEmpty","notIgnore","matchingConversions","conversion","filterConversions","exactTypes","typeIndex","conversionIndex","convertibleTypes","hasRestParam","hasConversions","compileTest","test0","test1","tests","compileTests","varIndex","lastTest","testRestParam","getParamAtIndex","getExpectedTypeNames","excludeConversions","isExactType","mergeExpectedParams","uniq","flatMap","matchingSignatures","nextMatchingDefs","actualType","lengths","maxLength","expectedLength","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","compareSignatures","signature1","signature2","compileArgConversion","conversion0","conversion1","splitParams","ignoreConversionTypes","_splitParams","typeGroups","filteredTypes","typeGroup","createTypedFunction","signaturesMap","parsedSignatures","parsedParam","isInvalidParam","parseSignature","notNull","parsedSignature","conflictingSignature","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","createSignaturesMap","array1","array2","getName","extractSignatures","validateUnique","_signature","_fn","addType","beforeObjectTest","addConversion","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","amdD","amdO","getter","__esModule","nmd"],"mappings":";wCAAe,SAASA,EAAkBC,EAAKC,IAClC,MAAPA,GAAeA,EAAMD,EAAIE,UAAQD,EAAMD,EAAIE,QAE/C,IAAK,IAAIC,EAAI,EAAGC,EAAO,IAAIC,MAAMJ,GAAME,EAAIF,EAAKE,IAC9CC,EAAKD,GAAKH,EAAIG,GAGhB,OAAOC,E,8CCPM,SAASE,EAAuBC,GAC7C,QAAa,IAATA,EACF,MAAM,IAAIC,eAAe,6DAG3B,OAAOD,E,8CCLM,SAASE,EAAgBC,EAAUC,GAChD,KAAMD,aAAoBC,GACxB,MAAM,IAAIC,UAAU,qC,8CCFxB,SAASC,EAAkBC,EAAQC,GACjC,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMb,OAAQC,IAAK,CACrC,IAAIa,EAAaD,EAAMZ,GACvBa,EAAWC,WAAaD,EAAWC,aAAc,EACjDD,EAAWE,cAAe,EACtB,UAAWF,IAAYA,EAAWG,UAAW,GACjDC,OAAOC,eAAeP,EAAQE,EAAWM,IAAKN,IAInC,SAASO,EAAaZ,EAAaa,EAAYC,GAG5D,OAFID,GAAYX,EAAkBF,EAAYe,UAAWF,GACrDC,GAAaZ,EAAkBF,EAAac,GACzCd,E,6ECZM,SAASgB,EAAKb,EAAQc,EAAUC,GAiB7C,OAfEF,EADqB,oBAAZG,SAA2BA,QAAQC,IACrCD,QAAQC,IAER,SAAcjB,EAAQc,EAAUC,GACrC,IAAIG,ECLK,SAAwBC,EAAQL,GAC7C,MAAQR,OAAOM,UAAUQ,eAAeC,KAAKF,EAAQL,IAEpC,QADfK,GAAS,EAAAG,EAAA,GAAeH,MAI1B,OAAOA,EDDQ,CAAcnB,EAAQc,GACjC,GAAKI,EAAL,CACA,IAAIK,EAAOjB,OAAOkB,yBAAyBN,EAAMJ,GAEjD,OAAIS,EAAKN,IACAM,EAAKN,IAAII,KAAKN,GAGhBQ,EAAKE,SAIJzB,EAAQc,EAAUC,GAAYf,K,4BElB7B,SAAS0B,EAAgBC,GAItC,OAHAD,EAAkBpB,OAAOsB,eAAiBtB,OAAOgB,eAAiB,SAAyBK,GACzF,OAAOA,EAAEE,WAAavB,OAAOgB,eAAeK,KAEvBA,G,4ECHV,SAASG,EAAUC,EAAUC,GAC1C,GAA0B,mBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIlC,UAAU,sDAGtBiC,EAASnB,UAAYN,OAAO2B,OAAOD,GAAcA,EAAWpB,UAAW,CACrEsB,YAAa,CACXT,MAAOM,EACP1B,UAAU,EACVD,cAAc,KAGd4B,IAAY,OAAeD,EAAUC,K,oECX5B,SAASG,EAA2B1C,EAAM4B,GACvD,OAAIA,GAA2B,YAAlB,OAAQA,IAAsC,mBAATA,GAI3C,OAAsB5B,GAHpB4B,I,4BCJI,SAASe,EAAgBT,EAAGU,GAMzC,OALAD,EAAkB9B,OAAOsB,gBAAkB,SAAyBD,EAAGU,GAErE,OADAV,EAAEE,UAAYQ,EACPV,IAGcA,EAAGU,G,6ECFb,SAASC,EAAepD,EAAKG,GAC1C,OCLa,SAAyBH,GACtC,GAAIK,MAAMgD,QAAQrD,GAAM,OAAOA,EDIxB,CAAeA,IELT,SAA+BA,EAAKG,GACjD,GAAsB,oBAAXmD,QAA4BA,OAAOC,YAAYnC,OAAOpB,GAAjE,CACA,IAAIwD,EAAO,GACPC,GAAK,EACLC,GAAK,EACLC,OAAKC,EAET,IACE,IAAK,IAAiCC,EAA7BC,EAAK9D,EAAIsD,OAAOC,cAAmBE,GAAMI,EAAKC,EAAGC,QAAQC,QAChER,EAAKS,KAAKJ,EAAGtB,QAETpC,GAAKqD,EAAKtD,SAAWC,GAH8CsD,GAAK,IAK9E,MAAOS,GACPR,GAAK,EACLC,EAAKO,EACL,QACA,IACOT,GAAsB,MAAhBK,EAAW,QAAWA,EAAW,SAC5C,QACA,GAAIJ,EAAI,MAAMC,GAIlB,OAAOH,GFnBuB,CAAqBxD,EAAKG,KAAM,EAAAgE,EAAA,GAA2BnE,EAAKG,IGLjF,WACb,MAAM,IAAIS,UAAU,6IHIgF,K,4BILvF,SAASwD,EAAuBC,EAASC,GAKtD,OAJKA,IACHA,EAAMD,EAAQE,MAAM,IAGfnD,OAAOoD,OAAOpD,OAAOqD,iBAAiBJ,EAAS,CACpDC,IAAK,CACH/B,MAAOnB,OAAOoD,OAAOF,O,sFCHZ,SAASI,EAAmB1E,GACzC,OCJa,SAA4BA,GACzC,GAAIK,MAAMgD,QAAQrD,GAAM,OAAO,EAAA2E,EAAA,GAAiB3E,GDGzC,CAAkBA,IELZ,SAA0B4E,GACvC,GAAsB,oBAAXtB,QAA0BA,OAAOC,YAAYnC,OAAOwD,GAAO,OAAOvE,MAAMwE,KAAKD,GFIvD,CAAgB5E,KAAQ,EAAAmE,EAAA,GAA2BnE,IGLvE,WACb,MAAM,IAAIY,UAAU,wIHIwE,K,2BIL/E,SAASkE,EAAQC,GAa9B,OATED,EADoB,mBAAXxB,QAAoD,iBAApBA,OAAOC,SACtC,SAAiBwB,GACzB,cAAcA,GAGN,SAAiBA,GACzB,OAAOA,GAAyB,mBAAXzB,QAAyByB,EAAI/B,cAAgBM,QAAUyB,IAAQzB,OAAO5B,UAAY,gBAAkBqD,IAI9GA,G,4ECZF,SAASC,EAA4BvC,EAAGwC,GACrD,GAAKxC,EAAL,CACA,GAAiB,iBAANA,EAAgB,OAAO,OAAiBA,EAAGwC,GACtD,IAAIC,EAAI9D,OAAOM,UAAUyD,SAAShD,KAAKM,GAAG8B,MAAM,GAAI,GAEpD,MADU,WAANW,GAAkBzC,EAAEO,cAAakC,EAAIzC,EAAEO,YAAYoC,MAC7C,QAANF,GAAqB,QAANA,EAAoB7E,MAAMwE,KAAKpC,GACxC,cAANyC,GAAqB,2CAA2CG,KAAKH,IAAW,OAAiBzC,EAAGwC,QAAxG,K,qECNWK,EAAb,WAEI,WAAYC,EAAiBC,IAAU,eACnCC,KAAKF,gBAAkBA,EACvBE,KAAKC,gBAAkBD,KAAKF,gBAAgBG,gBAC5CD,KAAKD,SAAWA,EAChBC,KAAKE,OAA2B,oBAAXA,QAA0BA,OAE/CF,KAAKG,qBAAuB,EARpC,mCAWI,cAXJ,4BAcI,SAAeC,EAAMC,EAAIC,EAAUC,EAAUC,EAAiBC,GAC1D,OAAO,IAff,qBAkBI,gBAlBJ,M,gICKO,IAAMC,EAAb,6B,IAAA,G,EAAA,E,gaAEI,WAAYZ,EAAiBC,GAAU,6BACnC,cACID,EACAC,IAGCY,UAN8B,EAF3C,yDAWI,WACIX,KAAKD,SAASa,iBAAiB,EAAG,EAAG,EAAG,GAAG,SAACR,EAAMS,EAAGvB,EAAKwB,GAClDxB,EAAIyB,WACoB5C,IAApBmB,EAAIyB,KAAKC,SACT1B,EAAIyB,KAAKC,YAAS7C,QAftC,mCAoBI,SAAsB8C,EAAMC,EAAYC,GACpC,IAAIC,OAAgBjD,EAChB8C,EAAKF,MAAQE,EAAKF,KAAKM,iBAEDlD,KADtBiD,EAAgBH,EAAKF,KAAKM,WAAWL,UAGjCI,GADAA,EAAgBA,EAAcE,QAAQ,QAAS,MACjBA,QAAQ,WAAY,SAG1D,IAAIN,OAAS7C,EAYb,YAXsBA,IAAlBiD,IACAJ,EAAShB,KAAKC,gBAAgBsB,wBAC1BH,EACAF,IAGRD,EAAKF,KAAKC,OAASA,OAEJ7C,IAAX6C,GAAwBA,EAAS,GACjCG,EAAc3C,KAAKwC,GAEhBA,IAzCf,oCA4CI,SAAuBQ,EAAGN,EAAYC,GAClC,IAAMM,EAAOzB,KACbwB,EAAEE,QAAQC,SAAQ,SAAAC,GACd,IACMC,EADQL,EAAEM,KAAKF,GACKb,KAAKgB,MAC3BF,IACAA,EAAYG,QAAQL,SAAQ,SAAAd,GACxB,IAAMI,EAAOY,EAAYZ,KAAKJ,GAC1BI,aAAgBgB,MAChBR,EAAKS,sBACDjB,EACAC,EACAC,MAIZU,EAAYH,QAAQC,SAAQ,SAAAC,GACxB,IAAME,EAAOD,EAAYC,KAAKF,GAC9B,GAAIE,aAAgBK,KAAY,CAC5B,IAAMC,EAAqB,GACrBC,EAAUP,EAAKf,KAAKe,KAAKT,WAAWiB,eAG1C3G,OAAO4G,KAAKF,GAASV,SAAQ,SAACa,GAC1BJ,EAAmBI,GACff,EAAKxB,gBAAgBsB,wBACjBc,EAAQG,GACRtB,MAIZvF,OAAO4G,KAAKrB,GAAYS,SAAQ,SAACa,GACvBA,KAAUJ,IACZA,EAAmBI,GAAUtB,EAAWsB,OAGhDf,EAAKgB,uBACDX,EAAKf,KAAKgB,MACVK,EACAjB,aAnF5B,uCA2FI,SAA0BY,GACtB/B,KAAKG,qBAAuB,EAE5B,IAAMgB,EAAgB,CAAC,GAOvB,OANAnB,KAAKyC,uBACDV,EACA/B,KAAKC,gBAAgByC,iBACrBvB,GAGInB,KAAKF,gBAAgB6C,sBACzB,IAAK,OACD3C,KAAKG,sBAAuByC,SAAKzB,GACjC,MACJ,IAAK,SACL,QACInB,KAAKG,sBAAuB0C,SAAO1B,MA3GnD,qBAgHI,WACInB,KAAK8C,6BACL9C,KAAK+C,0BAA0B/C,KAAKD,SAASgC,OAE7C/B,KAAKD,SAASiD,eApHtB,wBAuHI,SAAW/B,EAAMgC,GACb,IAAMjC,EAASC,EAAKF,KAAKC,OACzB,QAAe7C,IAAX6C,EAAsB,CAEtB,GAAIA,GAAU,EACV,OAEJ,IAAIkC,EAAW,GAAiC,EAA5BlD,KAAKG,sBAA6Ba,EAClDkC,EAAU,IACVA,EAAU,GACVA,EAAU,IACVA,EAAU,GACd,IAAMC,GAAQC,QAAaF,GAE3BjC,EAAKoC,MAAMrD,KAAKD,SAAUkD,EAAKE,MArI3C,oCAyII,SAAuBpB,EAAOkB,EAAKK,EAAKC,GAAc,WAClDxB,EAAML,QAAQC,SAAQ,SAAAC,GAClB,IAAM4B,EAAQzB,EAAMD,KAAKF,GAIzB,KAAIqB,EAAIQ,OAAQH,GAAOI,WAAaF,EAAMG,MAAQL,EAAMI,eAIpDT,EAAIQ,KAAQD,EAAMI,UAAUL,EAAaM,EAAGN,EAAaO,EACzDP,EAAaQ,EAAGR,EAAaS,IADjC,CAIA,IAAMnC,EAAc2B,EAAMzC,KAAKgB,MAC3BF,IAAgB2B,EAAMzC,KAAKyC,MAAMnC,WAAW4C,eAC5CpC,EAAYH,QAAQC,SAAQ,SAAAC,GACxB,IAAME,EAAOD,EAAYC,KAAKF,GAG1BqB,EAAIQ,MAAQ3B,EAAK8B,UAAUL,EAAaM,EACxCN,EAAaO,EAAGP,EAAaQ,EAAGR,EAAaS,IAK7ClC,EAAKf,KAAKe,KAAKT,WAAW4C,cACzBhB,EAAIQ,KAAOH,GAAOY,UAGnBpC,aAAgBK,MAChB,EAAKgC,uBACDrC,EAAKf,KAAKgB,MAAOkB,EAAKK,EAAKC,MAIvC1B,EAAYG,QAAQL,SAAQ,SAAAd,GACxB,IAAMI,EAAOY,EAAYZ,KAAKJ,GAE1BoC,EAAIQ,MAAQxC,EAAK2C,UAAUL,EAAaM,EACxCN,EAAaO,EAAGP,EAAaQ,EAAGR,EAAaS,IAGjD,EAAKI,WAAWnD,EAAMgC,aApL1C,kBA0LI,WACIjD,KAAKmE,uBACDnE,KAAKD,SAASgC,MACd/B,KAAKD,SAASkD,IACdjD,KAAKD,SAASsE,eAAeC,mBAC7BtE,KAAKD,SAASwD,gBA/L1B,4BAmMI,SAAenD,EAAMC,EAAIC,EAAUC,EAAUC,EAAiBC,GAC1D,GAAa,UAATL,IAAqBK,QACGtC,IAApBqC,GACAA,aAA2ByB,WACS9D,IAAhCqC,EAAgBO,KAAKC,QACjBR,EAAgBO,KAAKM,WAAWL,OAAQ,CACxC,IAAMS,EAAOzB,KACbA,KAAKC,gBAAgBsB,wBACjBf,EAAgBO,KAAKM,WAAWL,OAChCS,EAAKxB,gBAAgByC,kBACrB,GACA,WACIjB,EAAKqB,6BACLrB,EAAKsB,0BACDtB,EAAK1B,SAASgC,UAQ1C,OAAO,MAzNf,GAAyClC,M,gICAlC,IAAM0E,EAAb,6B,IAAA,G,EAAA,E,gaAEI,WAAYzE,EAAiBC,GAAU,6BACnC,cACID,EACAC,IAGCyE,UAAY,OACjB,EAAKC,YAAc,GAEnB,EAAKtE,qBAAuB,EATO,EAF3C,+CAcI,SAAiBuE,GAEb,OAAIA,aAAmBC,KAEfD,EAAQE,KAAKC,aAAe,IAC5BH,EAAQI,GADRJ,QAHc,EAQXA,aAAmBvC,KACVuC,EAAQ3D,KAAKe,KAAKT,WAAWuD,KAAKC,aAE9CE,WAXc,EAgBXL,aAAmBM,KAItBN,EAAQE,KAAKC,aAAe,IAC5BH,EAAQO,UAAY,IACpBP,EAAQ3D,KAAKe,KAAKoD,YAAc,KAtBlB,EAyBXR,aAAmBS,KAEtBT,EAAQE,KAAKC,aAAe,IAC5BH,EAAQO,UAAY,IACpBP,EAAQI,GAAK,KA7BC,EAkClBM,gBAjDZ,qBAwDI,WACIpF,KAAKG,qBAAuB,EAI5B,IAFA,IAAMkF,EAAgB,CAAC,GAEvB,MAAkB1J,OAAO4G,KAAKvC,KAAKyE,aAAnC,eAAiD,CAA5C,IAAM5I,EAAG,KAEE,eAARA,GACAwJ,EAAc7G,KAAKwB,KAAKyE,YAAY5I,GAAKmE,KAAKwE,YAGtD,OAAQxE,KAAKF,gBAAgB6C,sBACzB,IAAK,OACD3C,KAAKG,sBAAuByC,SAAKyC,GACjC,MACJ,IAAK,SACL,QACIrF,KAAKG,sBAAuB0C,SAAOwC,GAI3CrF,KAAKD,SAASiD,eA7EtB,iCAgFI,SAAoBsC,GAChB,IAAIC,EAAO,KACPzI,EAAQwI,EACZ,GAAIA,EAAS,IAAM,CACfC,EAAO,KACP,IAAMC,EAASF,EAAS,IACxBxI,EAAQ0I,EACJA,EAAS,MACTD,EAAO,IAEPzI,EADgB0I,EAAS,KAMjC,OADA1I,EAAQ2I,KAAKC,MAAiC,KAA1B5I,EAAQ6I,OAAOC,UAAkB,KACxClG,WAAa,IAAM6F,IA/FxC,wBAkGI,SAAWzD,EAAMmB,GAAK,WACZ4C,EAAa7F,KAAKyE,YAAYzE,KAAK8F,iBAAiBhE,IAE1D,QAAmB3D,IAAf0H,EAAJ,CAGI7F,KAAKD,SAASO,UACdwB,EAAK8B,UAAU5D,KAAKD,SAASO,SAASuD,EAAG7D,KAAKD,SAASO,SAASwD,KAE5D+B,EAAU,MAAYA,EAAU,IAChC7F,KAAKD,SAASgG,QAAU,WACpB,EAAKhG,SAASiG,kBAAkBC,UAC5B,EAAKC,oBAAoBL,EAAU,MAK3C7F,KAAKD,SAASgG,QAAU,WACpB,EAAKhG,SAASiG,kBAAkBC,UAC5B,QAAU,EAAKC,oBAAoBL,EAAU,KAC7C,UAAY,EAAKK,oBAAoBL,EAAU,KAC/C,WAAa,EAAKK,oBAAoBL,EAAU,MAChD,aAAe,EAAKK,oBAAoBL,EAAU,KAClD,YAAcA,EAAU,QAMxC,IAAMP,EAASO,EAAW7F,KAAKwE,WAC3BtB,EAAW,GAAiC,EAA5BlD,KAAKG,sBAA6BmF,EAClDpC,EAAU,IACVA,EAAU,GACVA,EAAU,IACVA,EAAU,GACd,IAAMC,GAAQC,QAAaF,GAE3BpB,EAAKuB,MAAMrD,KAAKD,SAAUkD,EAAKE,MAvIvC,oCA0II,SAAuBpB,EAAOkB,EAAKK,EAAKC,GAAc,WAKlDxB,EAAML,QAAQC,SAAQ,SAAAC,GAClB,IAAM4B,EAAQzB,EAAMD,KAAKF,GAGzB,IAAIqB,EAAIQ,KAAQD,EAAMI,UAAUL,EAAaM,EAAGN,EAAaO,EACzDP,EAAaQ,EAAGR,EAAaS,GAGjC,GAAKf,EAAIQ,MAAQH,GAAOI,WACpBF,EAAMG,MAAQL,GAAOI,YACrBF,EAAMzC,KAAKyC,MAAMnC,WAAW4C,aAC5B,EAAKkC,WAAW3C,EAAOP,OACpB,CACH,IAAMpB,EAAc2B,EAAMzC,KAAKgB,MAC3BF,GACAA,EAAYH,QAAQC,SAAQ,SAAAC,GACxB,IAAME,EAAOD,EAAYC,KAAKF,GAG1BqB,EAAIQ,MAAQ3B,EAAK8B,UAAUL,EAAaM,EACxCN,EAAaO,EAAGP,EAAaQ,EAAGR,EAAaS,KAG7ClC,EAAKf,KAAKe,KAAKT,WAAW4C,cACzBhB,EAAIQ,KAAOH,GAAOY,SACnB,EAAKiC,WAAWrE,EAAMmB,GAElBnB,aAAgBK,KAChB,EAAKgC,uBACDrC,EAAKf,KAAKgB,MAAOkB,EAAKK,EAAKC,GAG/B,EAAK4C,WAAWrE,EAAMmB,aA/KtD,kBAwLI,WACIjD,KAAKmE,uBACDnE,KAAKD,SAASgC,MACd/B,KAAKD,SAASkD,IACdjD,KAAKD,SAASsE,eAAeC,mBAC7BtE,KAAKD,SAASwD,kBA7L1B,GAAgD1D,M,gICAzC,IAAMuG,EAAb,6B,IAAA,G,EAAA,E,gaAEI,WAAYtG,EAAiBC,GAAU,6BACnC,cACID,EACAC,IAGCsG,UAAY,GAEb,EAAKnG,QACLA,OAAOoG,YAAY,CACflG,KAAM,mBAVqB,EAF3C,+CAiBI,SAAiBsE,GAEb,OAAIA,aAAmBC,KAEfD,EAAQE,KAAKC,aAAe,IAC5BH,EAAQI,GADRJ,QAHc,EAQXA,aAAmBvC,KACVuC,EAAQ3D,KAAKe,KAAKT,WAAWuD,KAAKC,aAE9CE,WAXc,EAgBXL,aAAmBM,KAItBN,EAAQE,KAAKC,aAAe,IAC5BH,EAAQO,UAAY,IACpBP,EAAQ3D,KAAKe,KAAKoD,YAAc,KAtBlB,EAyBXR,aAAmBS,KAEtBT,EAAQE,KAAKC,aAAe,IAC5BH,EAAQO,UAAY,IACpBP,EAAQI,GAAK,KA7BC,EAkClBM,gBApDZ,uCA2DI,WACIpF,KAAKD,SAASa,iBAAiB,EAAG,EAAG,EAAG,GAAG,SAACR,EAAMS,EAAGvB,EAAKwB,GAClDxB,EAAIyB,YACmB5C,IAAnBmB,EAAIyB,KAAKwF,QACTjH,EAAIyB,KAAKwF,WAAQpI,QACSA,IAA1BmB,EAAIyB,KAAKyF,eACTlH,EAAIyB,KAAKyF,kBAAerI,SAjE5C,kCAsEI,SAAqB2D,EAAMZ,EAAYuF,GACnC,IAAMD,EAAexG,KAAKqG,UAAUrG,KAAK8F,iBAAiBhE,IACtDyE,OAAQpI,EAaZ,YAZqBA,IAAjBqI,IACAD,EAAQvG,KAAKC,gBAAgBsB,wBACzBiF,EACAtF,IAGRY,EAAKf,KAAKyF,aAAeA,EACzB1E,EAAKf,KAAKwF,MAAQA,OAEJpI,IAAVoI,GAAuBA,EAAQ,GAC/BE,EAAajI,KAAK+H,GAEfA,IArFf,mCAwFI,SAAsB/E,EAAGN,EAAYuF,GACjC,IAAMhF,EAAOzB,KACbwB,EAAEE,QAAQC,SAAQ,SAAAC,GACd,IAAM4B,EAAQhC,EAAEM,KAAKF,GACrBH,EAAKiF,qBAAqBlD,EAAOtC,EAAYuF,GAC7C,IAAM5E,EAAc2B,EAAMzC,KAAKgB,MAC3BF,GACAA,EAAYH,QAAQC,SAAQ,SAAAC,GACxB,IAAME,EAAOD,EAAYC,KAAKF,GAC9B,GAAIE,aAAgBK,KAAY,CAC5B,IAAMC,EAAqB,GACrBC,EAAUP,EAAKf,KAAKe,KAAKT,WAAWiB,eAG1C3G,OAAO4G,KAAKF,GAASV,SAAQ,SAACa,GAC1BJ,EAAmBI,GACff,EAAKxB,gBAAgBsB,wBACjBc,EAAQG,GACRtB,MAIZvF,OAAO4G,KAAKrB,GAAYS,SAAQ,SAACa,GACvBA,KAAUJ,IACZA,EAAmBI,GAAUtB,EAAWsB,OAGhDf,EAAKiF,qBACD5E,EACAM,EACAqE,GAEJhF,EAAKkF,sBACD7E,EAAKf,KAAKgB,MACVK,EACAqE,QAGJhF,EAAKiF,qBACD5E,EACAZ,EACAuF,WAjI5B,sCAyII,SAAyB1E,GACrB/B,KAAKG,qBAAuB,EAE5B,IAAMsG,EAAe,CAAC,GAOtB,OANAzG,KAAK2G,sBACD5E,EACA/B,KAAKC,gBAAgByC,iBACrB+D,GAGIzG,KAAKF,gBAAgB6C,sBACzB,IAAK,OACD3C,KAAKG,sBAAuByC,SAAK6D,GACjC,MACJ,IAAK,SACL,QACIzG,KAAKG,sBAAuB0C,SAAO4D,MAzJnD,8BA8JI,SAAiBJ,GACbrG,KAAKqG,UAAYA,EACjBrG,KAAKW,YAhKb,qBAmKI,WACIX,KAAK4G,4BACL5G,KAAK6G,yBAAyB7G,KAAKD,SAASgC,OAE5C/B,KAAKD,SAASiD,eAvKtB,wBA0KI,SAAWlB,EAAMmB,GAAK,WACZsD,EAAQzE,EAAKf,KAAKwF,MAClBC,EAAe1E,EAAKf,KAAKyF,aAoB/B,QAlBqBrI,IAAjBqI,GAA8BxG,KAAKD,SAASO,UAC5CwB,EAAK8B,UAAU5D,KAAKD,SAASO,SAASuD,EAAG7D,KAAKD,SAASO,SAASwD,KAE5DgD,MAAMN,SAA2BrI,IAAVoI,EACvBvG,KAAKD,SAASgG,QAAU,WACpB,EAAKhG,SAASiG,kBAAkBC,UAC5B,UAAYO,EAAe,KAAOD,EAAQ,KAKlDvG,KAAKD,SAASgG,QAAU,WACpB,EAAKhG,SAASiG,kBAAkBC,UAC5B,UAAYO,SAKdrI,IAAVoI,EAIA,YAAqBpI,IAAjBqI,OACA1E,EAAKuB,MAAMrD,KAAKD,SAAUkD,EAAK,aAG/B,EAKR,KAAIsD,GAAS,GAAb,CAIA,IAAIrD,EAAW,GAAiC,EAA5BlD,KAAKG,sBAA6BoG,EAClDrD,EAAU,IACVA,EAAU,GACVA,EAAU,IACVA,EAAU,GACd,IAAMC,GAAQC,QAAaF,GAE3BpB,EAAKuB,MAAMrD,KAAKD,SAAUkD,EAAKE,MAxNvC,oCA2NI,SAAuBpB,EAAOkB,EAAKK,EAAKC,GAAc,WAKlDxB,EAAML,QAAQC,SAAQ,SAAAC,GAClB,IAAM4B,EAAQzB,EAAMD,KAAKF,GAGzB,IAAIqB,EAAIQ,KAAQD,EAAMI,UAAUL,EAAaM,EAAGN,EAAaO,EACzDP,EAAaQ,EAAGR,EAAaS,GAGjC,GAAKf,EAAIQ,MAAQH,GAAOI,WACpBF,EAAMG,MAAQL,GAAOI,YACrBF,EAAMzC,KAAKyC,MAAMnC,WAAW4C,aAC5B,EAAKkC,WAAW3C,EAAOP,OACpB,CACH,IAAMpB,EAAc2B,EAAMzC,KAAKgB,MAC3BF,GACAA,EAAYH,QAAQC,SAAQ,SAAAC,GACxB,IAAME,EAAOD,EAAYC,KAAKF,GAG1BqB,EAAIQ,MAAQ3B,EAAK8B,UAAUL,EAAaM,EACxCN,EAAaO,EAAGP,EAAaQ,EAAGR,EAAaS,KAG7ClC,EAAKf,KAAKe,KAAKT,WAAW4C,cACzBhB,EAAIQ,KAAOH,GAAOY,SACnB,EAAKiC,WAAWrE,EAAMmB,GAElBnB,aAAgBK,KAChB,EAAKgC,uBACDrC,EAAKf,KAAKgB,MAAOkB,EAAKK,EAAKC,GAG/B,EAAK4C,WAAWrE,EAAMmB,aAhQtD,kBAyQI,WACIjD,KAAKmE,uBACDnE,KAAKD,SAASgC,MACd/B,KAAKD,SAASkD,IACdjD,KAAKD,SAASsE,eAAeC,mBAC7BtE,KAAKD,SAASwD,gBA9Q1B,4BAkRI,SAAenD,EAAMC,EAAIC,EAAUC,EAAUC,EAAiBC,GAC1D,KAAa,UAATL,GAAqBK,GACjBD,SACEA,aAA2ByB,WACM9D,IAA/BqC,EAAgBO,KAAKwF,OAAqB,CAC1C,IAAMC,EAAexG,KAAKqG,UAAUrG,KAAK8F,iBAAiBtF,IAC1D,GAAIgG,EAAc,CACd,IAAM/E,EAAOzB,KACbA,KAAKC,gBAAgBsB,wBACjBiF,EACA/E,EAAKxB,gBAAgByC,kBACrB,GACA,WACIjB,EAAKmF,4BACLnF,EAAKoF,yBACDpF,EAAK1B,SAASgC,WAQ1C,OAAO,MAzSf,GAAwClC,M,mJCJjC,SAASkH,EAAqBvF,GAEjC,IAAMwF,EAAK,CACXA,MAAW,EACXA,OAAY,GASZ,OAPAxF,EAAEE,QAAQC,SAAQ,SAACC,GACf,IAAMiC,EAAIrC,EAAEM,KAAKF,GAAGiC,EAAIrC,EAAEM,KAAKF,GAAG+B,MAAQ,EACpCG,EAAItC,EAAEM,KAAKF,GAAGkC,EAAItC,EAAEM,KAAKF,GAAGqF,OAAS,EACvCpD,EAAImD,EAAGrD,QAAOqD,EAAGrD,MAAQE,GACzBC,EAAIkD,EAAGC,SAAQD,EAAGC,OAASnD,MAG5BkD,EAGJ,SAASE,EAAY3G,GACxB,IAAMyG,EAAK,CAAEG,GAAI,KAAMC,GAAI,KAAMC,GAAI,KAAMC,GAAI,MAc/C,OAZA/G,EAASoB,SAAQ,SAACC,GACd,IAAM2F,EAAU3F,EAAE2F,WACJ,OAAVP,EAAGG,IAAeI,EAAQ1D,EAAImD,EAAGG,MAAIH,EAAGG,GAAKI,EAAQ1D,IAC3C,OAAVmD,EAAGI,IAAeG,EAAQzD,EAAIkD,EAAGI,MAAIJ,EAAGI,GAAKG,EAAQzD,GAEzD,IAAMuD,EAAKzF,EAAEiC,EAAIjC,EAAE+B,MAAQ,EACrB2D,EAAK1F,EAAEkC,EAAIlC,EAAEqF,OAAS,GAEd,OAAVD,EAAGK,IAAeA,EAAKL,EAAGK,MAAIL,EAAGK,GAAKA,IAC5B,OAAVL,EAAGM,IAAeA,EAAKN,EAAGM,MAAIN,EAAGM,GAAKA,MAGvC,CAAEzD,EAAGmD,EAAGG,GAAIrD,EAAGkD,EAAGI,GAAIzD,MAAOqD,EAAGK,GAAKL,EAAGG,GAAIF,OAAQD,EAAGM,GAAKN,EAAGI,IAGnE,SAASI,EAAyBvG,GAErC,IAAI+F,EAAK,GAyBT,OAxBAA,EAAGG,GAAKlG,EAAKwG,OAAO,GAAG5D,EACvBmD,EAAGI,GAAKnG,EAAKwG,OAAO,GAAG3D,EACvBkD,EAAGK,GAAKpG,EAAKwG,OAAO,GAAG5D,EACvBmD,EAAGM,GAAKrG,EAAKwG,OAAO,GAAG3D,EAEvB7C,EAAKwG,OAAO9F,SAAQ,SAACjE,GACjBsJ,EAAGG,GAAKzJ,EAAEmG,EAAImD,EAAGG,GAAKzJ,EAAEmG,EAAImD,EAAGG,GAC/BH,EAAGI,GAAK1J,EAAEoG,EAAIkD,EAAGI,GAAK1J,EAAEoG,EAAIkD,EAAGI,GAC/BJ,EAAGK,GAAK3J,EAAEmG,EAAImD,EAAGK,GAAK3J,EAAEmG,EAAImD,EAAGK,GAC/BL,EAAGM,GAAK5J,EAAEoG,EAAIkD,EAAGM,GAAK5J,EAAEoG,EAAIkD,EAAGM,OAGnCN,EAAK,CACD,EAAKA,EAAGG,GAAI,EAAKH,EAAGI,GAAI,MAAUJ,EAAGK,GAAKL,EAAGG,GAC7C,OAAWH,EAAGM,GAAKN,EAAGI,KAEnBzD,OAAS,IACZqD,EAAGrD,MAAQ,GACXqD,EAAGnD,GAAK,GAERmD,EAAGC,QAAU,IACbD,EAAGC,OAAS,GACZD,EAAGlD,GAAK,GAELkD,EAGJ,SAASU,EAAsBzG,GAClC,IAAM+F,EAAKQ,EAAyBvG,GACpCA,EAAK4C,EAAImD,EAAGnD,EAAImD,EAAGrD,MAAQ,EAC3B1C,EAAK6C,EAAIkD,EAAGlD,EAAIkD,EAAGC,OAAS,EAC5BhG,EAAK0C,MAAQqD,EAAGrD,MAChB1C,EAAKgG,OAASD,EAAGC,O,0GC5DrB,I,EAGIU,EAA0B,EAEjBC,EAAb,WAOI,WAAY3E,EAAKlD,EAAU8H,IAAQ,eAC/B7H,KAAKiD,IAAMA,EACXjD,KAAKiD,IAAIQ,KAAM,EACfzD,KAAK6H,OAASA,EACd7H,KAAK8H,QAAU,KACf9H,KAAK+H,UAAY,KACjB/H,KAAKgI,UAAY,GACjBhI,KAAKD,SAAWA,EAChBC,KAAKiI,QAAU,GAEfjI,KAAKkI,gBAAkB,KACvBlI,KAAKmI,cAAgB,KACrBnI,KAAKoI,iBAAmB,KAIxBpI,KAAKqI,UAAY,KAEjBrI,KAAKsI,eAAgB,EACrBtI,KAAKuI,OAAS,EAEdvI,KAAKwI,aAAc,EAEnBxI,KAAKyI,aAAe,CAAE5E,EAAG,EAAGC,EAAG,GAE/B9D,KAAK0I,WAAa,EAElB1I,KAAK2I,KAAOC,SAASC,gBAAgB,6BAA8B,OAEnE7I,KAAK8I,eAAiB9I,KAAK2I,KAAKI,kBAEhC/I,KAAKgJ,0BAtCb,4CAyCI,WACIhJ,KAAKkI,gBAAkB,KACvBlI,KAAKmI,cAAgB,KACrBnI,KAAKqI,UAAY,KACjBrI,KAAKoI,iBAAmB,OA7ChC,gCAgDI,SAAmBa,GACf,GAAIjJ,KAAKoI,iBAAkB,CACvB,IAAIc,GAAS,EAOb,OANAA,GAAUlJ,KAAKoI,iBAAiBe,GAAKF,EAAcE,EACnDD,GAAUlJ,KAAKoI,iBAAiBgB,GAAKH,EAAcG,EACnDF,GAAUlJ,KAAKoI,iBAAiBiB,GAAKJ,EAAcI,EACnDH,GAAUlJ,KAAKoI,iBAAiBkB,GAAKL,EAAcK,GACnDJ,GAAUlJ,KAAKoI,iBAAiBvH,GAAKoI,EAAcpI,GACzCb,KAAKoI,iBAAiBmB,GAAKN,EAAcM,EAGnD,OAAO,IA3DnB,uBA8DI,SAAUN,GAEN,GAAIjJ,KAAKwJ,mBAAmBP,GAGxB,OAFAjJ,KAAKyJ,qBACLzJ,KAAK8I,eAAiBG,GAI1BjJ,KAAKyJ,gBACLzJ,KAAKqI,UChFN,SAAoBqB,EAAIC,GAC3B,SAASC,EAAUC,GACf,IAAMC,EAAQ,CAACrE,KAAKsE,KAAKF,EAAEV,EAAIU,EAAEV,EAAIU,EAAET,EAAIS,EAAET,GAAI3D,KAAKsE,KAAKF,EAAER,EAAIQ,EAAER,EAAIQ,EAAEP,EAAIO,EAAEP,IAEnEO,EAAEV,EAAIU,EAAEP,EAAIO,EAAET,EAAIS,EAAER,EACtB,IACFQ,EAAEV,EAAIU,EAAEP,EACRQ,EAAM,IAAMA,EAAM,GAElBA,EAAM,IAAMA,EAAM,IAG1B,IAAME,EAAQH,EAAEV,GAAKW,EAAM,IAAM,GAC3BG,EAAQJ,EAAET,GAAKU,EAAM,IAAM,GAC3BI,EAAQL,EAAER,GAAKS,EAAM,IAAM,GAC3BK,EAAQN,EAAEP,GAAKQ,EAAM,IAAM,GAE3BM,EAASJ,EAAQA,EAAQC,EAAQC,EACjCG,EAASL,EAAQC,EAAQA,EAAQE,EACjCG,EAASN,EAAQE,EAAQD,EAAQD,EACjCO,EAASP,EAAQG,EAAQF,EAAQA,EAEjCO,EAA+B,IAAvB/E,KAAKgF,MAAMZ,EAAET,EAAGS,EAAEV,GAAW1D,KAAKiF,GAEhD,MAAO,CACHC,UAAW,CAACd,EAAEhJ,EAAGgJ,EAAEN,GACnBO,QACAM,SACAC,SACAC,SACAC,SACAC,SAuDR,IAAMI,EAAKhB,EAAUF,GACfmB,EAAKjB,EAAUD,GAErB,OAAO,SAACmB,GAAD,OAdYxB,EAxCnB,SAAwBsB,EAAIC,EAAIC,GAC5B,SAASC,EAAK5B,EAAGC,GACb,OAAQA,EAAID,GAAK2B,EAAI3B,EAGzB,IAAI6B,EAAUJ,EAAGJ,OAAS,IACtBS,EAAUJ,EAAGL,OAAS,IACtBU,EAAUN,EAAGd,MAgBjB,OAdKc,EAAGd,MAAM,GAAK,GAAKe,EAAGf,MAAM,GAAK,GAAOc,EAAGd,MAAM,GAAK,GAAKe,EAAGf,MAAM,GAAK,KAC1EoB,EAAU,EAAEA,EAAQ,IAAKA,EAAQ,IACjCF,GAAWA,EAAU,EAAI,KAAO,KAGhCvF,KAAK0F,IAAIH,EAAUC,GAAW,MAC1BD,EAAUC,EACVD,GAAW,IAEXC,GAAW,KAKZ,CACHN,UAAW,CACPI,EAAKH,EAAGD,UAAU,GAAIE,EAAGF,UAAU,IACnCI,EAAKH,EAAGD,UAAU,GAAIE,EAAGF,UAAU,KAEvCb,MAAO,CACHiB,EAAKG,EAAQ,GAAIL,EAAGf,MAAM,IAC1BiB,EAAKG,EAAQ,GAAIL,EAAGf,MAAM,KAE9BM,OAAQW,EAAKH,EAAGR,OAAQS,EAAGT,QAC3BC,OAAQU,EAAKH,EAAGP,OAAQQ,EAAGR,QAC3BC,OAAQS,EAAKH,EAAGN,OAAQO,EAAGP,QAC3BC,OAAQQ,EAAKH,EAAGL,OAAQM,EAAGN,QAC3BC,MAAOO,EAAKC,EAASC,IAkBLG,CAAeR,EAAIC,EAAIC,IAbrCO,EAASzC,SAASC,gBAAgB,6BAA8B,OAAOE,mBACtEI,EAAIG,EAAEc,OACbiB,EAAOjC,EAAIE,EAAEe,OACbgB,EAAOhC,EAAIC,EAAEgB,OACbe,EAAO/B,EAAIA,EAAEiB,OACbc,EAAOxK,EAAIyI,EAAEqB,UAAU,GAAKrB,EAAEc,OAASd,EAAEqB,UAAU,GAAKrB,EAAEgB,OAC1De,EAAO9B,EAAID,EAAEqB,UAAU,GAAKrB,EAAEe,OAASf,EAAEqB,UAAU,GAAKrB,EAAEiB,OACnDc,EAAOC,OAAO,EAAG,EAAGhC,EAAEkB,MAAQ/E,KAAKiF,GAAK,KAAKZ,MAAMR,EAAEQ,MAAM,GAAIR,EAAEQ,MAAM,IARlF,IAAmBR,EACT+B,GDIWE,CAAWvL,KAAK8I,eAAgBG,GACjDjJ,KAAKoI,iBAAmBa,IAxEhC,sBA2EI,SAASpF,EAAGC,GACR,IAAM0H,EAAKxL,KAAK2I,KAAK8C,iBAErB,OADAD,EAAG3H,EAAIA,EAAG2H,EAAG1H,EAAIA,EACV0H,IA9Ef,gCAiFI,WACI,IAAME,EAAK1L,KAAK8I,eAChB9I,KAAKiD,IAAI0I,aAAaD,EAAGvC,EAAGuC,EAAGtC,EAAGsC,EAAGrC,EAAGqC,EAAGpC,EAAGoC,EAAG7K,EAAG6K,EAAGnC,KAnF/D,uBAsFI,WACI,MAAO,CAAE1F,EAAG7D,KAAK8I,eAAejI,EAAGiD,EAAG9D,KAAK8I,eAAeS,KAvFlE,qCA0FI,WAA0B,WAOhBqC,EAAMhD,SAASC,gBAAgB,6BAA8B,OACnE7I,KAAKiD,IAAI4I,yBAA2BD,EAAI7C,kBAGxC,IAAM+C,EAAU,WACZC,QAAQC,QAAQlF,MAAM,EAAK7D,IAAI4I,yBAAyBtC,KAEtD0C,EAAOjM,KAAKiD,IACZiJ,EAAaD,EAAKnC,MACxBmC,EAAKnC,MAAQ,SAAUqC,EAAIC,GAGvB,OAFAH,EAAKJ,yBAA2BI,EAAKJ,yBAAyBQ,gBAAgBF,EAAIC,GAClFN,IACOI,EAAWxP,KAAKuP,EAAME,EAAIC,IAErC,IAAME,EAAiBL,EAAKtB,UAC5BsB,EAAKtB,UAAY,SAAUwB,EAAIC,GAG3B,OAFAH,EAAKJ,yBAA2BI,EAAKJ,yBAAyBlB,UAAUwB,EAAIC,GAC5EN,IACOQ,EAAe5P,KAAKuP,EAAME,EAAIC,IAEzC,IAAMG,EAAcN,EAAKX,OACzBW,EAAKX,OAAS,SAAUkB,GAGpB,OAFAP,EAAKJ,yBAA2BI,EAAKJ,yBAAyBP,OAAW,IAAJkB,EAAY/G,KAAKiF,IACtFoB,IACOS,EAAY7P,KAAKuP,EAAMO,IAElC,IAAMC,EAAiBR,EAAKnC,MAC5BmC,EAAKS,UAAY,SAAUvD,EAAGC,EAAGC,EAAGC,EAAGzI,EAAG0I,GACtC,IAAMI,EAAKiC,EAAI7C,kBAIf,OAHAY,EAAGR,EAAIA,EAAGQ,EAAGP,EAAIA,EAAGO,EAAGN,EAAIA,EAAGM,EAAGL,EAAIA,EAAGK,EAAG9I,EAAIA,EAAG8I,EAAGJ,EAAIA,EACzD0C,EAAKJ,yBAA2BI,EAAKJ,yBAAyBc,SAAShD,GACvEmC,IACOW,EAAe/P,KAAKuP,EAAM9C,EAAGC,EAAGC,EAAGC,EAAGzI,EAAG0I,IAGpD,IAAMqD,EAAoBX,EAAKN,aAC/BM,EAAKN,aAAe,SAAUxC,EAAGC,EAAGC,EAAGC,EAAGzI,EAAG0I,GAQzC,OAPA0C,EAAKJ,yBAAyB1C,EAAIA,EAClC8C,EAAKJ,yBAAyBzC,EAAIA,EAClC6C,EAAKJ,yBAAyBxC,EAAIA,EAClC4C,EAAKJ,yBAAyBvC,EAAIA,EAClC2C,EAAKJ,yBAAyBhL,EAAIA,EAClCoL,EAAKJ,yBAAyBtC,EAAIA,EAClCuC,IACOc,EAAkBlQ,KAAKuP,EAAM9C,EAAGC,EAAGC,EAAGC,EAAGzI,EAAG0I,IAGvD0C,EAAKY,gCAAkC,SAAUhJ,EAAGC,GAChD,IAAM0H,EAAKI,EAAIH,iBAGf,OAFAD,EAAG3H,EAAIA,EAAG2H,EAAG1H,EAAIA,EACjBgI,IACON,EAAGsB,gBAAgBb,EAAKJ,yBAAyBkB,cApJpE,qBAwJI,WACI/M,KAAKwI,aAAc,EACnBxI,KAAKgN,mBA1Jb,yBA6JI,SAAY1N,GACRU,KAAKgI,UAAUxJ,KAAKc,GACpBU,KAAKiI,QAAQzJ,KAAK,CAAE,EAAKoJ,EAAcqF,UAAW,EAAK3N,MA/J/D,4BAkKI,SAAe4N,GACXlN,KAAKgI,UAAYhI,KAAKgI,UAAUmF,QAAO,SAAAtJ,GAAC,OAAIA,GAAKqJ,OAnKzD,4BAsKI,WAAiB,Q,w5BAAA,CACGlN,KAAKgI,WADR,IACb,2BAAgC,QAC1BoF,UAFO,8BAIbpN,KAAKgI,UAAY,GACjBhI,KAAKiI,QAAU,KA3KvB,qBA8KI,WACI,IAAMhF,EAAMjD,KAAK6H,OAAOwF,WAAW,MAC7B9F,EAAUtE,EAAIqK,aAAa,EAAG,EAAG,EAAG,GAAGvM,KAC7C,OAAkB,GAAdwG,EAAQ,IAAyB,GAAdA,EAAQ,IAAyB,GAAdA,EAAQ,IAAyB,KAAdA,EAAQ,KAGjD,IAAIgG,YACpBtK,EAAIqK,aAAa,EAAG,EAAGtN,KAAK6H,OAAOlE,MAAO3D,KAAK6H,OAAOZ,QAAQlG,KAAKyM,QAGnDC,MAAK,SAAAtK,GAAK,OAAc,aAAVA,OAxL1C,mBA2LI,SAAMuK,GAAoB,IAAd7J,EAAc,uDAAV,EAAGC,EAAO,uDAAH,EAEnB,GADA9D,KAAKyJ,kBACDzJ,KAAKsI,eAAiBtI,KAAK0I,WAAa,GAA5C,CAGA1I,KAAK0I,aACL1I,KAAKsI,eAAgB,EACjBtI,KAAK2N,YACL3N,KAAKD,SAAS6N,QAAU,QACxB5N,KAAKD,SAAS8N,aAAa,MAAM,GACjCH,EAAO,KAGX1N,KAAKyI,aAAa5E,EAAIA,EACtB7D,KAAKyI,aAAa3E,EAAIA,EAEtB,IAAMgK,EAAKJ,EACLlC,EAAKxL,KAAK+N,SAAS/N,KAAKyI,aAAa5E,EAAG7D,KAAKyI,aAAa3E,GAAGgJ,gBAAgB9M,KAAK8I,eAAeiE,WACvG/M,KAAK8I,eAAiB9I,KAAK8I,eAAe6B,UAAUa,EAAG3H,EAAG2H,EAAG1H,GAC7D9D,KAAK8I,eAAiB9I,KAAK8I,eAAegB,MAAMgE,EAAIA,EAAI,EAAG,EAAG,EAAG,GACjE9N,KAAKuI,QAAUuF,EACf9N,KAAK8I,eAAiB9I,KAAK8I,eAAe6B,WAAWa,EAAG3H,GAAI2H,EAAG1H,GAE/D9D,KAAK0I,gBAlNb,sBAsNI,SAASsF,GAAuB,IAAjBC,EAAiB,wDACtBC,EAAWlO,KAAK6H,OAAOlE,MACvBwK,EAAWnO,KAAK6H,OAAOZ,OAC7B,GAAgB,GAAZiH,GAA6B,GAAZC,EAArB,CAGA,IAAIrE,EAAQ,EAAGsE,EAAK,EAAGC,EAAK,EACxBL,EAAKrK,MAAQqK,EAAK/G,QAClB6C,EAAQoE,EAAWF,EAAKrK,MACxByK,GAAMJ,EAAKnK,EACXwK,GAAML,EAAKlK,EAAKkK,EAAK/G,OAAS,EAAMkH,EAAWrE,EAAQ,EAGnDkE,EAAK/G,OAAS6C,EAAQqE,IACtBrE,EAAQqE,EAAWH,EAAK/G,OACxBmH,GAAMJ,EAAKnK,EAAKmK,EAAKrK,MAAQ,EAAMuK,EAAWpE,EAAQ,EACtDuE,GAAML,EAAKlK,KAGfgG,EAAQqE,EAAWH,EAAK/G,OACxBmH,GAAMJ,EAAKnK,EAAKmK,EAAKrK,MAAQ,EAAMuK,EAAWpE,EAAQ,EACtDuE,GAAML,EAAKlK,EAGPkK,EAAKrK,MAAQmG,EAAQoE,IACrBpE,EAAQoE,EAAWF,EAAKrK,MACxByK,GAAMJ,EAAKnK,EACXwK,GAAML,EAAKlK,EAAKkK,EAAK/G,OAAS,EAAMkH,EAAWrE,EAAQ,IAK/D,IAAMb,EAAgBjJ,KAAK2I,KAAKI,kBAAkBe,MAAMA,EAAOA,EAAO,EAAG,EAAG,EAAG,GAAGa,UAAUyD,EAAIC,GAE5FJ,GAA8B,OAAnBjO,KAAK+H,UAChB/H,KAAKsO,UAAUrF,IAEfjJ,KAAKyJ,gBACLzJ,KAAK8I,eAAiBG,GAG1BjJ,KAAKyI,aAAe,CAAE5E,EAAG,EAAGC,EAAG,GAC/B9D,KAAKuI,OAAS,KAhQtB,uBAmQI,SAAU1E,EAAGC,GACT9D,KAAKyJ,gBACLzJ,KAAK8I,eAAiB9I,KAAK8I,eAAe6B,UAAU9G,EAAI7D,KAAK8I,eAAeK,EAAGrF,EAAI9D,KAAK8I,eAAeQ,KArQ/G,+BAkRI,SACIiF,EAAIC,EAAcC,EAAcC,EAAcC,EAC9CC,EAAmBC,GAErB,IAFiCC,IAEjC,yDADEC,EACF,wDAD4BC,EAC5B,4DAD2C7Q,EAEzC6B,KAAKyJ,gBAGL,IAAIwF,EAAY,GACZC,EAAW,GAGXC,EAAeR,EAAUJ,EAAG3J,KAAKC,cACjCuK,EAAiB,KAEjBV,IAAiBS,IAAiBZ,EAAGxN,KAAKyC,OAAyB,kBAAhB+K,EAAGxN,KAAKX,KAMnC,OAAjBmO,EAAGtJ,WAAsBkK,IAGhCC,EAAiBD,EAAarN,KAAKyM,EAAGtJ,YAEnBlE,KAAKyC,QACpB2L,EAAeC,EAAerO,KAAKgB,OAPvCqN,EAAiBR,EAAkBL,EAAG3J,KAAKC,eAU3CsK,GAAkBZ,aAActM,OAEhCkN,EAAaE,SAASd,EAAGzJ,IAAInD,SAAQ,SAAA2N,GACjCL,EAAUzQ,KAAK2Q,EAAalO,KAAKqO,OAErCH,EAAaI,QAAQhB,EAAGzJ,IAAInD,SAAQ,SAAA2N,GAChCJ,EAAS1Q,KAAK2Q,EAAalO,KAAKqO,QAKxC,IAAIE,EAAKf,EAAa5K,EAAI2K,EAAa3K,EACnC4L,EAAKhB,EAAa3K,EAAI0K,EAAa1K,EAGnC0H,GAAM,EACV,GAAI+C,aAActM,KACd,GAAI8M,EACAvD,GAAM,OACH,GAAIwD,GAAgBA,EAAavU,OAAS,EAC7C+Q,GAAM,OACH,GAAIqD,EAEP,QAA8B1Q,IAA1B0Q,EAAWa,WAA0B,CACrC,IAAIC,EAAO,KACXpB,EAAG9G,OAAO9F,SAAQ,SAACjE,EAAGhD,GAGlB,GAAS,GAALA,GAAUA,GAAK6T,EAAG9G,OAAOhN,OAAS,EAAtC,CAEA,IAAImV,EAAMlS,EAAEmG,EAAIgL,EAAWgB,GACvBC,EAAMpS,EAAEoG,EAAI+K,EAAWkB,GACvBC,EAAUJ,EAAIA,EAAME,EAAIA,GACf,OAATH,GAAiBK,EAAUL,KAC3BA,EAAOK,EACPxE,EAAK9Q,OAGbmU,EAAWa,WAAalE,OAExBA,EAAKqD,EAAWa,WAK5B,GAAIN,EAAgB,CAIhB,IAAMa,EACDb,EAAevL,EAAKuL,EAAezL,MAAQ,EAC1CuM,EACFD,EAAqBb,EAAezL,MAClCwM,EACDf,EAAetL,EAAKsL,EAAenI,OAAS,EAC3CmJ,EACFD,EAAoBf,EAAenI,OAEnCoJ,EAAc9B,EAAGtH,OAAS,EAC1BqJ,EAAc/B,EAAG5K,MAAQ,EACzB4K,aAActM,OACdoO,EAAcC,EAAc,GAEhC,IAAMC,EAAQN,EAAqBK,EAC7BE,EAAQL,EAAoBE,EAC5BI,EAAQP,EAAsBI,EAC9BI,EAAQN,EAAuBC,EAKrC,GAAI9B,aAActM,MACd,GAAIuJ,EAAK,EAAG,CACR,IAAImF,EAAWpC,EAAG9G,OAAO+D,GAAI3H,EAAI2L,EAC7BoB,EAAWrC,EAAG9G,OAAO+D,GAAI1H,EAAI2L,EAC7BkB,GAAYJ,GACZ9B,EAAa5K,GAAKoM,EAClBT,EAAKe,EAAQhC,EAAG9G,OAAO+D,GAAI3H,GACpB8M,GAAYF,GACnBhC,EAAa5K,GAAKqM,KAClBV,EAAKiB,EAAQlC,EAAG9G,OAAO+D,GAAI3H,GAE3B+M,GAAYJ,GACZ/B,EAAa3K,GAAKqM,EAClBV,EAAKe,EAAQjC,EAAG9G,OAAO+D,GAAI1H,GACpB8M,GAAYF,GACnBjC,EAAa3K,GAAKsM,KAClBX,EAAKiB,EAAQnC,EAAG9G,OAAO+D,GAAI1H,QAGhC,CACH,IAAI6M,EAAWpC,EAAG1K,EAAI2L,EAClBoB,EAAWrC,EAAGzK,EAAI2L,EAClBkB,GAAYJ,GACZ9B,EAAa5K,GAAKoM,EAClBT,EAAKe,EAAQhC,EAAG1K,GACT8M,GAAYF,GACnBhC,EAAa5K,GAAKqM,KAClBV,EAAKiB,EAAQlC,EAAG1K,GAEhB+M,GAAYJ,GACZ/B,EAAa3K,GAAKqM,EAClBV,EAAKe,EAAQjC,EAAGzK,GACT8M,GAAYF,GACnBjC,EAAa3K,GAAKsM,KAClBX,EAAKiB,EAAQnC,EAAGzK,IAK5B,GAAIyK,aAActM,KAAlB,CACI,IAAI4O,EAOJ,GANI/B,KACA+B,GAAWC,QAAqBvC,MAG5BsC,GAAWE,QAA4BxC,KAE3C/C,EAAK,GAQL,GANA+C,EAAG9G,OAAO+D,GAAI3H,GAAK2L,EACnBjB,EAAG9G,OAAO+D,GAAI1H,GAAK2L,EAGnB/H,EAAsB6G,GAElBO,EAAsB,CACtB,IAAK+B,EAASpJ,OAAQ,CAClBoJ,EAASpJ,OAAS7M,MAAM2T,EAAG9G,OAAOhN,QAClC,IAAK,IAAIC,EAAI,EAAGA,EAAI6T,EAAG9G,OAAOhN,OAAQC,IAClCmW,EAASpJ,OAAO/M,GAAK,CAAC8U,GAAI,EAAGC,GAAI,GAIzCoB,EAASpJ,OAAO+D,GAAIgE,IAAMA,EAC1BqB,EAASpJ,OAAO+D,GAAIiE,IAAMA,QAE3B,IAAW,GAAPjE,EAAU,CAEjB,IAAK,IAAI9Q,EAAI,EAAGA,EAAI6T,EAAG9G,OAAOhN,OAAS,EAAGC,IACtC6T,EAAG9G,OAAO/M,GAAGmJ,GAAK2L,EAClBjB,EAAG9G,OAAO/M,GAAGoJ,GAAK2L,EAGtB,GAAIX,EACA,IAAK,IAAIpU,EAAI,EAAGA,EAAI6T,EAAG9G,OAAOhN,OAAS,EAAGC,IACtCmW,EAASpJ,OAAO/M,GAAG8U,IAAMA,EACzBqB,EAASpJ,OAAO/M,GAAG+U,IAAMA,OAG9B,IAAW,GAAPjE,EACP,IAAK,IAAI9Q,EAAI,EAAGA,EAAI6T,EAAG9G,OAAOhN,OAAS,EAAGC,IACtC6T,EAAG9G,OAAO/M,GAAGmJ,GAAKmL,EAAatU,GAAG8U,GAClCjB,EAAG9G,OAAO/M,GAAGoJ,GAAKkL,EAAatU,GAAG+U,OA3C9C,CA6GA,GAHAuB,EAAyBzC,GAGrBO,EAAsB,CACtB,IAAI+B,GAAWC,QAAqBvC,GAC/BsC,IACDA,GAAWE,QAA4BxC,IAE3CsC,EAASrB,IAAMA,EACfqB,EAASpB,IAAMA,EAGXlB,aAAc0C,WAAa1C,EAAGxN,KAAKe,KAAKT,WAAW4C,eAC9C4M,EAASK,WACVL,EAASK,SAAW,EACpBL,EAASM,SAAW,GAGxBN,EAASK,UAAY1B,EACrBqB,EAASM,UAAY1B,GAI7B,GAAIlB,EAAGxN,KAAKyC,QAAU+K,EAAGxN,KAAKyC,MAAMnC,WAAW4C,aAAc,CAEzD,IAAMlC,EAAQwM,EAAGxN,KAAKgB,MACtBA,EAAML,QAAQC,SAAQ,SAAAyP,GAElBJ,EADajP,EAAMD,KAAKsP,OAK5BrP,EAAMC,QAAQL,SAAQ,SAAA2N,GAClB,IAAMrO,EAAOc,EAAMd,KAAKqO,GACxBrO,EAAK4C,GAAK2L,EACVvO,EAAK6C,GAAK2L,EACVxO,EAAKwG,OAAO9F,SAAQ,SAAA0P,GAChBA,EAAMxN,GAAK2L,EACX6B,EAAMvN,GAAK2L,KAEf/H,EAAsBzG,MAK9BgO,EAAUtN,SAAQ,SAAAV,GACd,IAAMxB,EAAIwB,EAAKwG,OAAOhN,OAAS,EAC3B6W,GAAQ,EACZ,GAA2B,OAAvBrQ,EAAKsQ,cACL,IAAK,IAAI7W,EAAI,EAAGA,EAAI6T,EAAGiD,eAAe/W,OAAQC,IAC1C,GAAI6T,EAAGiD,eAAe9W,GAAGqG,KAAKpB,OAASsB,EAAKsQ,cAAe,CACvDtQ,EAAKwG,OAAO,IAAKgK,mBAAclD,EAAGiD,eAAe9W,GAAIuG,EAAKwG,OAAO,IACjE6J,GAAQ,EACR,MASZ,GALKA,IACDrQ,EAAKwG,OAAO,GAAG5D,GAAK2L,EACpBvO,EAAKwG,OAAO,GAAG3D,GAAK2L,GAGG,OAAvBxO,EAAKyQ,cAAwB,WACzB7Q,EAAC,UAAGuO,SAAH,iBAAG,EAAgBrO,YAAnB,iBAAG,EAAsByC,aAAzB,aAAG,EAA6BxB,MAAMf,EAAK6D,IAC5C6M,EAASxC,EAAarN,KAAKjB,aAAlB,EAAkBA,EAAG+Q,KAClC,GAAID,EACA,IAAK,IAAIjX,EAAI,EAAGA,EAAIiX,EAAOE,cAAcpX,OAAQC,IAE7C,GADeiX,EAAOE,cAAcnX,GAAGqG,KAAKpB,OAC3BsB,EAAKyQ,cAAe,CACjCzQ,EAAKwG,OAAOhI,IAAKgS,mBACbE,EAAOE,cAAcnX,GAAIuG,EAAKwG,OAAOhI,EAAI,IAE7C,OAKhBiI,EAAsBzG,MAE1BiO,EAASvN,SAAQ,SAAAV,GACb,IAAMxB,EAAIwB,EAAKwG,OAAOhN,OAAS,EAC3B6W,GAAQ,EACZ,GAA2B,OAAvBrQ,EAAKyQ,cACL,IAAK,IAAIhX,EAAI,EAAGA,EAAI6T,EAAGsD,cAAcpX,OAAQC,IACzC,GAAI6T,EAAGsD,cAAcnX,GAAGqG,KAAKpB,OAASsB,EAAKyQ,cAAe,CACtDzQ,EAAKwG,OAAOhI,IAAKgS,mBACblD,EAAGsD,cAAcnX,GAAIuG,EAAKwG,OAAOhI,EAAE,IAEvC6R,GAAQ,EACR,MASZ,GALKA,IACDrQ,EAAKwG,OAAOhI,GAAGoE,GAAK2L,EACpBvO,EAAKwG,OAAOhI,GAAGqE,GAAK2L,GAGG,OAAvBxO,EAAKsQ,cAAwB,WACzB1Q,EAAC,UAAGuO,SAAH,iBAAG,EAAgBrO,YAAnB,iBAAG,EAAsByC,aAAzB,aAAG,EAA6BxB,MAAMf,EAAK6D,IAC5CgN,EAAS3C,EAAarN,KAAKjB,aAAlB,EAAkBA,EAAGkR,KAClC,GAAID,EACA,IAAK,IAAIpX,EAAI,EAAGA,EAAIoX,EAAON,eAAe/W,OAAQC,IAE9C,GADeoX,EAAON,eAAe9W,GAAGqG,KAAKpB,OAC5BsB,EAAKsQ,cAAe,CACjCtQ,EAAKwG,OAAO,IAAKgK,mBACbK,EAAON,eAAe9W,GAAIuG,EAAKwG,OAAO,IAE1C,OAKhBC,EAAsBzG,MAxK1B,SAAS+P,EAAyBlP,GAC9BA,EAAK+B,GAAK2L,EACV1N,EAAKgC,GAAK2L,EACN3N,EAAKf,KAAKe,MAAgC,eAAxBA,EAAKf,KAAKe,KAAK1B,MACjC4R,EAAoBlQ,EAAKf,KAAKgB,OAC9BD,EAAK+P,eACL/P,EAAK+P,cAAclQ,SAAQ,SAAA0H,GACvBA,EAAExF,GAAK2L,EACPnG,EAAEvF,GAAK2L,KAEX3N,EAAK0P,gBACL1P,EAAK0P,eAAe7P,SAAQ,SAAA0H,GACxBA,EAAExF,GAAK2L,EACPnG,EAAEvF,GAAK2L,KAKnB,SAASuC,EAAoBC,GACzBA,EAAGvQ,QAAQC,SAAQ,SAAAuQ,GACf,IAAM1O,EAAQyO,EAAGnQ,KAAKoQ,GACtB1O,EAAMK,GAAK2L,EACXhM,EAAMM,GAAK2L,EACX,IAAMjO,EAAIgC,EAAMzC,KAAKgB,MACjBP,IACAA,EAAEE,QAAQC,SAAQ,SAAAyP,GAEdJ,EADaxP,EAAEM,KAAKsP,OAIxB5P,EAAEQ,QAAQL,SAAQ,SAAA2N,GACd,IAAMrO,EAAOO,EAAEP,KAAKqO,GACpBrO,EAAK4C,GAAK2L,EACVvO,EAAK6C,GAAK2L,EACVxO,EAAKwG,OAAO9F,SAAQ,SAAA0P,GAChBA,EAAMxN,GAAK2L,EACX6B,EAAMvN,GAAK2L,KAEf/H,EAAsBzG,UAIlCgR,EAAGjQ,QAAQL,SAAQ,SAAA2N,GACf,IAAMrO,EAAOgR,EAAGhR,KAAKqO,GACrBrO,EAAK4C,GAAK2L,EACVvO,EAAK6C,GAAK2L,EACVxO,EAAKwG,OAAO9F,SAAQ,SAAA0P,GAChBA,EAAMxN,GAAK2L,EACX6B,EAAMvN,GAAK2L,KAEf/H,EAAsBzG,SAngBtC,+BA6nBI,SAAkBkR,GACd,OAAOnS,KAAK+N,SAASoE,EAAM,GAAGrF,gBAAgB9M,KAAK8I,eAAeiE,WAAWlJ,IA9nBrF,+BAioBI,SAAkBuO,GACd,OAAOpS,KAAK+N,SAAS,EAAGqE,GAAMtF,gBAAgB9M,KAAK8I,eAAeiE,WAAWjJ,IAloBrF,sBAqoBI,SAASD,GAGL,OAFAA,EAAIwO,WAAWxO,EAAEyO,QAAQ,IACrB7M,KAAKC,MAAU,IAAJ7B,GAAW,MAvoBlC,8BA2oBI,WAGI,IAAM0O,EAAOvS,KAAKwS,kBAAkB,GAEpC,OADcxS,KAAKwS,kBAAkBxS,KAAK6H,OAAOlE,OACjC4O,GAAQvS,KAAK6H,OAAOlE,QAhpB5C,4BAmpBI,SAAe8O,GACX,GAAuB,OAAnBzS,KAAKqI,UAAT,CASA,GAL6B,OAAzBrI,KAAKkI,kBACLlI,KAAKkI,gBAAkBuK,EACvBzS,KAAKmI,cAAgBsK,EA/pBN,KAkqBfA,GAAOzS,KAAKmI,cAGZ,OAFAnI,KAAK8I,eAAiB9I,KAAKqI,UAAU,QACrCrI,KAAKyJ,gBAIT,IAvqBmBqB,EAuqBb4H,EAAQ1S,KAAKkI,gBACbyK,EAAM3S,KAAKmI,cACjBnI,KAAK8I,eAAiB9I,KAAKqI,WAzqBRyC,GAyqBsC2H,EAAMC,IAAUC,EAAMD,GAzqBvD,EAAIjN,KAAKmN,IAAI,EAAI9H,EAAG,QAIpD,sBAwqBI,SAAS2H,GACL,IAAIzS,KAAKwI,YAAT,CAGA,IAAIqK,EAAKJ,EAAMzS,KAAK+H,UAKpB,GAJK/H,KAAK+H,YACN8K,EAAK,MACT7S,KAAK+H,UAAY0K,IAEbzS,KAAK0I,WAAa,GAAtB,CACA1I,KAAK0I,YAAc,EACnB,IAAMzF,EAAMjD,KAAKiD,IAGjBA,EAAI6P,OACJ7P,EAAI0I,aAAa,EAAG,EAAG,EAAG,EAAG,EAAG,GAChC1I,EAAI8P,UAAU,EAAG,EAAG9P,EAAI4E,OAAOlE,MAAOV,EAAI4E,OAAOZ,QACjDhE,EAAI+P,UAAYhT,KAAKD,SAAS6N,QAC9B3K,EAAIgQ,SAAS,EAAG,EAAGhQ,EAAI4E,OAAOlE,MAAOV,EAAI4E,OAAOZ,QAChDhE,EAAIiQ,UAEJlT,KAAKmT,eAAeV,GAEpBzS,KAAKoT,qBACDpT,KAAKsI,gBACLtI,KAAKsI,cAAoC,IAApBtI,KAAK0I,YAE9B1I,KAAKD,SAASsT,KAAKR,GACnB7S,KAAK0I,YAAc,EAEQ,OAAvB1I,KAAKmI,eAA0BsK,EAAMzS,KAAKmI,eAC1CnI,KAAKgD,iBAvsBjB,wBA0sBI,WAAa,WACThD,KAAK8H,QAAUwL,OAAOC,uBAAsB,SAACd,GAAD,OAAS,EAAKe,SAASf,SA3sB3E,sBAGI,WACI,OAAO9K,QAJf,K,2DENM8L,E,WAEF,WAAY1T,GAAU,2BAClBC,KAAKD,SAAWA,EAChBC,KAAK4E,KAAO5E,KAAKD,SAAS6E,KAC1B5E,KAAKE,OAA2B,oBAAXA,QAA0BA,OAG/CF,KAAK0C,iBAAmB,GACxB/G,OAAO4G,KAAKvC,KAAK4E,KAAKvD,WAAWqS,SAAS/R,SAAQ,SAACgS,QACHxV,IAAxC,EAAKyG,KAAKvD,WAAWuS,gBACrBjY,OAAO4G,KAAK,EAAKqC,KAAKvD,WAAWuS,gBAAgBC,SAASF,IACJ,WAAtD,EAAK/O,KAAKvD,WAAWuS,eAAeD,GAAG,GAAvC,KACA,EAAKjR,iBAAiBiR,GAAK,EAAK/O,KAAKvD,WAAWuS,eAC5CD,GACF,GAEF,EAAKjR,iBAAiBiR,QAAKxV,KAEnC6B,KAAK8T,kBAAoB,GAEzB9T,KAAK+T,8B,mDAGT,SAAqBvR,EAAQ1F,GACrB0F,KAAUxC,KAAK0C,mBACf1C,KAAK0C,iBAAiBF,GAAU1F,K,qCAGxC,SACIkX,EACA3R,GAGF,IAFE4R,EAEF,wDADEC,EACF,4DADa/V,EAEP+K,OAAS/K,EACb,IACI,IAAMgW,GAAkBC,QAAMJ,GAC9B,GAAIC,EACAjU,KAAKqU,gCAAgCF,EAAiB9R,GACtDrC,KAAKsU,qBAAqBjS,EAAS6R,QAEnC,IACI,IAAMK,EACFJ,EAAgBK,SAASnS,GAIzB6G,OAHc/K,IAAdoW,IACCzN,MAAMyN,IACP5O,OAAO8O,WAAWF,IACRA,OAEDpW,EACf,MAAO0C,GACLqI,OAAS/K,EAGjB,OAAO+K,EACT,MAAOwL,GACL3I,QAAQ4I,MAAMD,GArBlB,QAuBI,OAAOxL,K,kCAIf,SAAqB7G,GAA+B,WAAtB6R,EAAsB,4DAAX/V,EACrC,GAAI6B,KAAK8T,kBAAkBrZ,OAAS,EAAG,CACnC,IAAM+H,EAASxC,KAAK8T,kBAAkBc,MAChCnT,EAAOzB,KACbA,KAAK6U,eAAeC,MAChBtS,EACAH,GACA,WACQ,EAAKnC,QACLA,OAAOoG,YAAY,CACflG,KAAM,yBACNoC,OAAQA,EACRuS,WAAY1S,EAAQG,UAEXrE,IAAb+V,GACAA,IACJzS,EAAK6S,qBAAqBjS,EAAS6R,S,6CAMnD,SAAgCC,EAAiB9R,GAAS,WACtD8R,EAAgBxS,SAAQ,SAACG,EAAMkT,EAAMC,GACjC,OAAQnT,EAAK1B,MACT,IAAK,aACG0B,EAAKnC,QAAQ0C,QACUlE,IAAvBkE,EAAQP,EAAKnC,QACZ,EAAKmU,kBAAkBD,SAAS/R,EAAKnC,OAGtC,EAAKmU,kBAAkBtV,KAAKsD,EAAKnC,MAErC,MACJ,IAAK,eACL,IAAK,kBACD,EAAK0U,gCAAgCvS,EAAMO,S,yCAS3D,WACI,IAAI6S,GAAsBC,QAAc,MAAO,GAC3C,CAAC,yBAA0BvM,SAASwM,MACxCF,EAAoBJ,MAAQ,WACxB9U,KAAKqV,MAAMC,QAAU,SAEzBJ,EAAoBK,MAAQ,WACxBvV,KAAKqV,MAAMC,QAAU,QAGzB,IAAIT,GAAiBM,QAAc,MAAO,wBACtC,CAAC,cAAeD,GACpBL,EAAeW,iBAAiB,SAAS,SAACnV,GACtCA,EAAGoV,qBAEPZ,EAAeQ,MAAMC,QAAU,OAC/BtV,KAAK6U,eAAiBA,EAEtB,IAAIa,GAAaP,QAAc,MAAO,GAAI,CAAC,wBACvCnV,KAAK6U,gBACT7U,KAAK6U,eAAec,QAASR,QAAc,OAAQ,GAC/C,CAAC,oBAAqBO,GAC1B,IAAIE,GAAeT,QAAc,MAAO,GAAI,CAAC,eACzCO,GACJE,EAAaC,WAAYC,OAAzB,yDACAF,EAAaJ,iBAAiB,SAAS,WACnCX,EAAeU,WAGnB,IAAIQ,GAAcZ,QAAc,MAAO,GAAI,CAAC,0BACxCnV,KAAK6U,gBAMT,SAASmB,IACL,GAAInB,EAAeoB,MAAQpB,EAAeqB,QAAS,CAC/C,IAAIC,EAAMtB,EAAeuB,OAAOtZ,MAChC,GAAIqZ,IAAQrP,MAAMqP,IAAQxQ,OAAO8O,WAAW0B,IAAQA,EAAM,EAKtD,OAJAtB,EAAeoB,KAAKpB,EAAeqB,SAAWC,EAC9CtB,EAAeU,aACXV,EAAewB,WACfxB,EAAewB,aAI3BxB,EAAeuB,OAAOE,kBAAkB,2BAhB5CtW,KAAK6U,eAAe0B,UAAWpB,QAAc,MAAO,GAChD,CAAC,sBAAuBY,GAC5B/V,KAAK6U,eAAeuB,QAASjB,QAAc,QAAS,eAChD,CAAC,yBAA0BnV,KAAK6U,eAAe0B,UAenDvW,KAAK6U,eAAeuB,OAAOZ,iBAAiB,YAAY,SAACnV,GACpC,KAAbA,EAAGmW,OACHR,OAGR,IAAIS,GAAatB,QAAc,MAAO,GAAI,CAAC,yBACvCnV,KAAK6U,gBACL6B,GAAiBvB,QAAc,MAAO,GACtC,CAAC,SAAU,6BAA8BsB,GAC7CC,EAAelB,iBAAiB,SAAS,SAACnV,GAAS2V,QACzBb,QAAc,OAAQ,GAAI,GAAIuB,GACpCzQ,UAAY,WAChCkP,QAAc,MAAO,GAAI,CAAC,YAAasB,GAEvCzW,KAAK6U,eAAeC,MAAQ,SAAUtS,EAAQmU,EAAKzC,GAC/ClU,KAAKqV,MAAMC,QAAU,QACrBT,EAAec,OAAO1P,UAAY,iBAAmBzD,EACrDqS,EAAeqB,QAAU1T,EACzBqS,EAAeoB,KAAOU,EACtB9B,EAAewB,UAAYnC,EAC3BgB,EAAoBJ,SAExB9U,KAAK6U,eAAeU,MAAQ,WACxBvV,KAAKqV,MAAMC,QAAU,OACrBT,EAAec,OAAO1P,UAAY,GAClC4O,EAAeuB,OAAOtZ,MAAQ,GAC9B+X,EAAeuB,OAAOE,kBAAkB,IACxCpB,EAAoBK,SAExBL,EAAoBM,iBAAiB,SAAS,SAACnV,GAC3CwU,EAAeU,e,KAMdqB,EAAb,WAEI,WAAY7W,IAAU,eAClBC,KAAKD,SAAWA,EAEhBC,KAAK2C,qBAAuB,SAE5B3C,KAAK6W,SAAW,GAEhB7W,KAAKC,gBAAkB,IAAIwT,EAAezT,KAAKD,UATvD,+CAYI,SAAiBK,GACb,OAAQA,GACJ,KAAKM,IACL,KAAK0F,IACL,KAAK7B,IACDvE,KAAK6W,SAASrY,KACV,IAAI4B,EAAKJ,KAAMA,KAAKD,WAExB,MACJ,QAEIC,KAAK6W,SAASrY,KAAK4B,GAG3BJ,KAAKD,SAASiD,eA1BtB,gCA6BI,SAAmB5C,GACfJ,KAAK6W,SAAW7W,KAAK6W,SAAS1J,QAAO,SAAA2J,GACjC,QAASA,aAAmB1W,MAGhCJ,KAAKD,SAASiD,eAlCtB,+BAqCI,SAAkB5C,GACd,OAAOJ,KAAK6W,SAAS1J,QAAO,SAAA2J,GACxB,OAAOA,aAAmB1W,KAC3B3F,OAAS,IAxCpB,yBA2CI,SAAY2F,GACR,IAAI0W,OAAU3Y,EAOd,OANA6B,KAAK6W,SAASlV,SAAQ,SAAAoV,GACdA,aAAc3W,IACd0W,EAAUC,MAIXD,IAnDf,kCAsDI,SAAqBtU,EAAQ1F,GACzBkD,KAAKC,gBAAgB+W,qBAAqBxU,EAAQ1F,GAClDkD,KAAK6W,SAASlV,SAAQ,SAAAmV,GAClBA,EAAQnW,eAzDpB,yCA6DI,SAA4BsW,GACxBjX,KAAK2C,qBAAuBsU,EAC5BjX,KAAK6W,SAASlV,SAAQ,SAAAmV,GAClBA,EAAQnW,eAhEpB,kBAoEI,WACIX,KAAK6W,SAASlV,SAAQ,SAAAmV,GAClBA,EAAQzD,YAtEpB,qBA0EI,WACIrT,KAAK6W,SAASlV,SAAQ,SAAAmV,GAClBA,EAAQnW,eA5EpB,4BAgFI,SAAeP,EAAMC,EAAIC,EAAUC,EAAUC,EAAiBC,GAC1DT,KAAK6W,SAASlV,SAAQ,SAAAmV,GAClBA,EAAQI,eAAe9W,EAAMC,EAAIC,EAAUC,EACvCC,EAAiBC,UAnFjC,K,8gCCxKA,SAAS0W,EAAyB/W,EAAMI,EAAiB4W,EAAK9W,GAC1D,OAAQF,GACJ,IAAK,YACD,OAAQI,aAA2B2B,MACP,OAApB3B,EACZ,IAAK,OACD,OAAQA,aAA2B2E,UAC3B3E,aAA2BmE,MACvC,IAAK,cACD,OAAQnE,aAA2BmE,OAASyS,EAChD,QACI,OAAO5W,aAA2BmE,OAIvC,IAAM0S,EAAb,WACI,WAAYzS,EAAM0S,GACsD,IAD3CJ,EAC2C,uDAD1B,KAAMpO,EACoB,uDADH,KACzDyO,EAA4D,wDAAxCC,EAAwC,uDAA3B,KAAMC,EAAqB,uDAAN,MAAM,eAEpEzX,KAAK4E,KAAOA,EACZ5E,KAAK2O,UAAY,GACjB3O,KAAK4O,kBAAoB,GAGzB5O,KAAKsX,UAAYA,EACjBtX,KAAKiD,IAAM,KACXjD,KAAK6H,OAAS,KACd7H,KAAK0X,sBAAwB,KAC7B1X,KAAK2X,sBAAwB,KAC7B3X,KAAK4X,sBAAwB,KAC7B5X,KAAK6X,qBAAuB,KAC5B7X,KAAK+F,QAAU,KACf/F,KAAKgG,kBAAoB,KAGzBhG,KAAK8X,KAAO,KACZ9X,KAAK+X,QAAU,KACf/X,KAAKgY,YAAc,KACnBhY,KAAKiY,aAAe,KACpBjY,KAAKkY,eAAiB,KACtBlY,KAAKmY,aAAe,KACpBnY,KAAKoY,SAAW,KAChBpY,KAAKqY,aAAe,KACpBrY,KAAKsY,aAAe,KACpBtY,KAAKuY,uBAAyB,UAC9BvY,KAAKwY,kBAAoB,KACzBxY,KAAKyY,qBAAuB,KAG5BzY,KAAK0Y,sBAAwB,GAG7B1Y,KAAK2Y,kBAAmB,EACxB3Y,KAAK4Y,mBAAoB,EAGzB5Y,KAAK6Y,WAAa,MAClB7Y,KAAK8Y,gBAAkB,KACvB9Y,KAAKM,SAAW,KAChBN,KAAK+Y,aAAe,KACpB/Y,KAAKgZ,UAAW,EAChBhZ,KAAK6O,WAAa,KAClB7O,KAAKiZ,kBAAoB,KACzBjZ,KAAKkZ,uBAAyBhC,EAC9BlX,KAAKmZ,oBAAqB,EAC1BnZ,KAAKoZ,oBAAqB,EAC1BpZ,KAAKqZ,SAAW,KAChBrZ,KAAKsZ,aAAe,KACpBtZ,KAAKuZ,eAAiB,KAGtBvZ,KAAKwZ,kBAAoB,GAGzB,IACIxZ,KAAKF,gBAAkB,IAAI8W,EAAe5W,MAC5C,MAAOyZ,GACLzZ,KAAKF,gBAAkB,KAG3BE,KAAK0Z,WAAY,EACjB,IACIxZ,OACIA,SACAF,KAAK0Z,WAAY,GACvB,MAAOD,IAGTzZ,KAAKuX,WAAaA,EAElBvX,KAAK2Z,cAAc7Q,EAAgB0O,EAAYC,GAE/CzX,KAAK4Z,WAEL5Z,KAAK0Y,uBAAwBmB,QAAqB7Z,KAAK4E,MAEvD5E,KAAK8Z,4BAjFb,sCAoFI,WACI,IACQ9Z,KAAK8X,MACL9X,KAAK8X,KAAK1K,UACdpN,KAAKqE,eAAe+I,UACpBpN,KAAKsX,UAAUyC,YAAY/Z,KAAK6H,QAChC7H,KAAKsX,UAAUyC,YAAY/Z,KAAK+X,SAChC/X,KAAKsX,UAAUyC,YAAY/Z,KAAKgG,mBAClC,MAAOyT,OA5FjB,2BAiGI,WACI,MAAO,CAAEd,iBAAkB3Y,KAAK2Y,oBAlGxC,mCAsGI,WAEI3Y,KAAK6H,OAAOwN,MAAM2E,OAAS,UAC3Bha,KAAKia,qBAAqB5E,MAAMC,QAAU,OAC1CtV,KAAKka,sBAAsBrE,UAAY,GAEvC7V,KAAKgY,YAAY3C,MAAQ,yCACzBrV,KAAKiY,aAAa5C,MAAQ,yCAC1BrV,KAAKkY,eAAe7C,MAAQ,yCAE5BrV,KAAKyY,qBAAqB5C,UAAY,KAVlB,UAYA7V,KAAKmY,cAZL,IAYpB,2BAAuC,KAA9BgC,EAA8B,QAC/BA,EAAQC,aAAa,SAAWpa,KAAKoY,UACrC+B,EAAQ9E,MAAQ,kCACZrV,KAAKuY,uBACTvY,KAAKyY,qBAAqB5C,UACtB7V,KAAKwY,kBAAkBxY,KAAKoY,WAEhC+B,EAAQ9E,MAAQ,sBAnBJ,8BAuBpB,OAAQrV,KAAK6Y,YACT,IAAK,OACD7Y,KAAKiY,aAAa5C,MAAQ,uDAELrV,KAAKuY,uBAC1BvY,KAAKia,qBAAqB5E,MAAMC,QAAU,QAC1CtV,KAAKka,sBAAsBrE,UACvB,wDAEJ,MACJ,IAAK,SACD7V,KAAKkY,eAAe7C,MAAQ,uDAEPrV,KAAKuY,uBAC1BvY,KAAKia,qBAAqB5E,MAAMC,QAAU,QAC1CtV,KAAK6H,OAAOwN,MAAM2E,OAAS,YACvBha,KAAKmZ,mBACLnZ,KAAKka,sBAAsBrE,UACvB,yBAEJ7V,KAAKka,sBAAsBrE,UACvB,mFAIR,MACJ,IAAK,MACD7V,KAAKia,qBAAqB5E,MAAMC,QAAU,QACpB,SAAlBtV,KAAKoY,SACDpY,KAAKuZ,eACLvZ,KAAKka,sBAAsBrE,UACvB,+FAIJ7V,KAAKka,sBAAsBrE,UACvB,gGAIR7V,KAAKka,sBAAsBrE,UACvB,mIAKR,MACJ,IAAK,MACL,QACI7V,KAAKgY,YAAY3C,MAAQ,uDAEJrV,KAAKuY,0BAhL1C,2BAsLI,SAAczP,EAAgB0O,EAAYC,GAAc,IA4ChDnO,EA5CgD,OAEpDtJ,KAAK6H,OAASe,SAASuM,cAAc,UACrCnV,KAAK6H,OAAOwS,UAAUC,IAAI,eAEtBta,KAAK6H,OAAOwN,MAAMkF,gBADlB/C,GAGoC,UACxCxX,KAAKsX,UAAUkD,OAAOxa,KAAK6H,QAEvB7H,KAAKuX,aACLvX,KAAKya,aAAe7R,SAASuM,cAAc,OAC3CnV,KAAKya,aAAapF,MAAMxE,SAAW,WACnC7Q,KAAKya,aAAapF,MAAMqF,OAAS,QACjC1a,KAAKya,aAAapF,MAAMsF,MAAQ,QAChC3a,KAAKya,aAAapF,MAAMkF,gBAAkB,QAC1Cva,KAAKya,aAAapF,MAAMuF,QAAU,QAClC5a,KAAK6a,iBAAmBjS,SAASuM,cAAc,QAC/CnV,KAAK6a,iBAAiBxF,MAAMlS,MAAQ,QACpCnD,KAAK6a,iBAAiBxF,MAAMyF,SAAW,OACvC9a,KAAK6a,iBAAiB5U,UAAY,kBAClCjG,KAAKya,aAAaM,YAAY/a,KAAK6a,kBACnC7a,KAAKsX,UAAUyD,YAAY/a,KAAKya,eAKpCza,KAAKia,qBAAuBrR,SAASuM,cAAc,OACnDnV,KAAKia,qBAAqB5E,MAAMxE,SAAW,WAC3C7Q,KAAKia,qBAAqB5E,MAAMqF,OAAS,QACzC1a,KAAKia,qBAAqB5E,MAAM9C,KAAO,QACvCvS,KAAKia,qBAAqB5E,MAAMkF,gBAAkB,qBAClDva,KAAKia,qBAAqB5E,MAAM2F,aAAe,MAC/Chb,KAAKia,qBAAqB5E,MAAMuF,QAAU,QAC1C5a,KAAKia,qBAAqB5E,MAAMC,QAAU,OAC1CtV,KAAKka,sBAAwBtR,SAASuM,cAAc,QACpDnV,KAAKka,sBAAsB7E,MAAMlS,MAAQ,UACzCnD,KAAKka,sBAAsBrE,UAAY,GACvC7V,KAAKia,qBAAqBc,YAAY/a,KAAKka,uBAC3Cla,KAAKsX,UAAUyD,YAAY/a,KAAKia,sBAGhCja,KAAK+X,QAAUnP,SAASuM,cAAc,OACtCnV,KAAK+X,QAAQ1C,MAAQ,2CAIrB,IACI4F,KACA3R,EAAIV,SAASuM,cAAc,WACzB+F,UAAY,SACd5R,EAAEuM,UAAY,qCACdvM,EAAE+L,MAAQ,yCACV,IAAI5T,EAAOzB,KACXsJ,EAAE6R,QAAU,WAAY,WACpB,GAAI1Z,EAAKqW,MAAQrW,EAAKqW,KAAKsD,UACvB3Z,EAAKqW,KAAK1K,cADd,CAIA,IAAIY,EAAOhO,KAAKqb,wBACZC,EAAQ,IAAIL,IAChBK,EAAMC,UAAU,oBAAoB,SAAA1X,GAAC,OAAIpC,EAAK+Z,iBAC1C/Z,EAAKga,YACLH,EAAMC,UAAU,oBAAoB,SAAA1X,GAAC,OAAIpC,EAAKia,iBAC9CJ,EAAMC,UAAU,mBAAmB,SAAA1X,GAAC,OAAIpC,EAAKia,aAAY,OAE7DJ,EAAMK,mBAAmB,mBAAoBla,EAAKkX,kBAAkB,SAAC9U,EAAG+X,GAAcna,EAAKkX,iBAAmBiD,KAC9GN,EAAMK,mBAAmB,0BAA2Bla,EAAKwB,IAAIQ,KAAK,SAACI,EAAG+X,GAAcna,EAAKwB,IAAIQ,IAAMmY,KAC9F5b,KAAK0Z,WACN4B,EAAMC,UACF,YACA,WACI,GAAI9Z,EAAKoa,eAAiBpa,EAAKoa,cAAcT,UACzC3Z,EAAKoa,cAAczO,cADvB,CAIA,IAAIY,EAAOsN,EAAMQ,YAAYT,wBACzBU,EAAiB,IAAId,IACzBc,EAAeJ,mBACX,yBACAla,EAAK3B,gBAAgBkc,kBACjBtb,MAEJ,SAACmD,EAAG+X,GACIA,EACAna,EAAK3B,gBAAgBmc,iBACjBvb,KAGJe,EAAK3B,gBAAgBoc,mBACjBxb,KAERe,EAAKuB,aACD,EAAK0W,WACLyC,2BAGZ1a,EAAKoa,cAAgBE,EACrBta,EAAKoa,cAAcO,KAAKpO,EAAKuE,KAAMvE,EAAKqO,SAGpDf,EAAMK,mBAAmB,oBAAqBla,EAAKmX,mBAAmB,SAAC0D,EAAGV,GACtEna,EAAKmX,kBAAoBgD,EACzBna,EAAKmY,WACLnY,EAAKuB,gBAETsY,EAAMC,UAAU,mBAAmB,kBAAM9Z,EAAK8a,qBAC9C9a,EAAKqW,KAAOwD,EACZ7Z,EAAKqW,KAAKsE,KAAKpO,EAAKuE,KAAMvE,EAAK0M,UAEnCpR,EAAEkT,MAAQ,OACVxc,KAAK+X,QAAQgD,YAAYzR,GAC3B,MAAOmQ,IA6BT,IA1BAnQ,EAAIV,SAASuM,cAAc,WACzB+F,UAAY,SACd5R,EAAEuM,UAAY,oDACdvM,EAAE+L,MAAQ,yCACV/L,EAAE6R,QAAU,kBAAM,EAAKtN,gBACvBvE,EAAEkT,MAAQ,mBACVxc,KAAK+X,QAAQgD,YAAYzR,IAGzBA,EAAIV,SAASuM,cAAc,WACzB+F,UAAY,SACd5R,EAAEuM,UAAY,4CACdvM,EAAE+L,MAAQ,yCACV/L,EAAE6R,QAAU,kBAAM,EAAKsB,gBACvBnT,EAAEkT,MAAQ,wBACVxc,KAAK+X,QAAQgD,YAAYzR,IAGzBA,EAAIV,SAASuM,cAAc,WACzB+F,UAAY,SACd5R,EAAEuM,UAAY,4CACdvM,EAAE+L,MAAQ,yCACV/L,EAAE6R,QAAU,kBAAM,EAAKuB,cACvBpT,EAAEkT,MAAQ,sBACVxc,KAAK+X,QAAQgD,YAAYzR,GAErBmO,EAAc,CAGdzX,KAAKgY,YAAcP,EAAakF,IAChC3c,KAAKiY,aAAeR,EAAamF,KACjC5c,KAAKkY,eAAiBT,EAAaoF,OACnC7c,KAAKmY,aAAeV,EAAaqF,SANnB,UAOM9c,KAAKmY,cAPX,yBAOLgC,EAPK,QAQ2B,gBAAjCA,EAAQC,aAAa,QACrBD,EAAQgB,QAAU,WACd,EAAK4B,iCAAgC,WACjC,EAAKlE,WAAa,MAClB,EAAKT,SAAW,cAChB,EAAKmB,eAAiB,KACtB,EAAKyD,4BAIb7C,EAAQgB,QAAU,WACT8B,kBAGD,EAAKpE,WAAa,MAClB,EAAKT,SAAW+B,EAAQC,aAAa,QACrC,EAAK/B,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKyD,yBANL,EAAKE,0BAbrB,2BAAuC,IAPzB,8BA+Bdld,KAAKuY,uBAAyB,cAC3B,CAEHvY,KAAKmY,aAAe,GAGpB,IAAIgF,EAAevU,SAASuM,cAAc,UAC1CgI,EAAajC,UAAY,SACzBiC,EAAatH,UAAY,yCACzBsH,EAAa9H,MAAQ,uDAAyDrV,KAAKuY,uBACnF4E,EAAaX,MAAQ,WACrBxc,KAAKgY,YAAcmF,EACnBnd,KAAK+X,QAAQgD,YAAYoC,GAGzB,IAAIC,EAAgBxU,SAASuM,cAAc,UAC3CiI,EAAclC,UAAY,SAC1BkC,EAAcvH,UAAY,0CAC1BuH,EAAc/H,MAAQ,yCACtB+H,EAAcZ,MAAQ,qBACtBxc,KAAKiY,aAAemF,EACpBpd,KAAK+X,QAAQgD,YAAYqC,GAGzB,IAAIC,EAAiBzU,SAASuM,cAAc,UAC5CkI,EAAenC,UAAY,SAC3BmC,EAAexH,UAAY,6CAC3BwH,EAAehI,MAAQ,yCACvBgI,EAAeb,MAAQ,cACvBxc,KAAKkY,eAAiBmF,EACtBrd,KAAK+X,QAAQgD,YAAYsC,GA+C7B,GA3CArd,KAAKgY,YAAYmD,QAAU,WACvB,EAAKtC,WAAa,MAClB,EAAKT,SAAW,KAChB,EAAKC,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKyD,yBAIThd,KAAKiY,aAAakD,QAAU,SAACmB,EAAGgB,GAGxB,EAAKlE,qBAAsC,IAAhBkE,EAC3B,EAAKzE,WAAa,MAElB,EAAKA,WAAa,OACtB,EAAKT,SAAW,KAChB,EAAKC,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKH,mBAAqBkE,EAC1B,EAAKN,yBAIThd,KAAKkY,eAAeiD,QAAU,SAACmB,EAAGiB,GAG1B,EAAKpE,qBAAqC,IAAfoE,EAC3B,EAAK1E,WAAa,MAElB,EAAKA,WAAa,SACtB,EAAKT,SAAW,KAChB,EAAKC,aAAe,KACpB,EAAKkB,eAAiB,KACtB,EAAKJ,mBAAqBoE,EAC1B,EAAKP,yBAITpU,SAAS4M,iBAAiB,WAAW,SAAC3U,GAAD,OAAO,EAAK2c,aAAa3c,MAC9D+H,SAAS4M,iBAAiB,SAAS,SAAC3U,GAAD,OAAO,EAAK2c,aAAa3c,MAGxDb,KAAK0Z,UAAW,CAChB,IAAI+D,EAAmB7U,SAASuM,cAAc,UAC9CsI,EAAiB3Y,GAAK,sBACtB2Y,EAAiBvC,UAAY,gBAC7BuC,EAAiB5H,UAAY,sCAC7B4H,EAAiBpI,MAAQ,yCACzBoI,EAAiBtC,QAAU,WACvBsC,EAAiBvC,UAAY,gBAC7B5H,OAAOoK,uBAAwB,EAC3Bxd,SACAA,OAAOoG,YAAY,CACflG,KAAM,wBACNud,mBAAmB,IAEvBzd,OAAOoG,YAAY,CACflG,KAAM,iCACNwd,cAAc,MAI1BH,EAAiBjB,MAAQ,eACzBxc,KAAK+X,QAAQgD,YAAY0C,GAG7Bzd,KAAKsX,UAAUkD,OAAOxa,KAAK+X,SAI3B/X,KAAKgG,kBAAoB4C,SAASuM,cAAc,OAChDnV,KAAKgG,kBAAkB6P,UAAY,GACnC7V,KAAKgG,kBAAkBkV,UAAY,cACnClb,KAAKgG,kBAAkB6X,YAAc,kBAAM,EAAK7X,kBAAkBqP,MAAMC,QAAU,QAClFtV,KAAKsX,UAAUyD,YAAY/a,KAAKgG,mBAGhChG,KAAK8d,wBAA0BlV,SAASuM,cAAc,OACtDnV,KAAK8d,wBAAwBjI,UAAY,GACzC7V,KAAK8d,wBAAwB5C,UAAY,gBACzClb,KAAK+d,mBAAqBnV,SAASuM,cAAc,OACjD,IAAI6I,EAAwBpV,SAASuM,cAAc,UAC/C1T,EAAOzB,KACXge,EAAsB7C,QAAU,WAC5B1Z,EAAKmD,KAAK+P,WAAQxW,EAClBsD,EAAKsc,mBAAmB9X,UAAY,GACpCxE,EAAKqc,wBAAwBzI,MAAMC,QAAU,QAEjD0I,EAAsB3I,MAAtB,MAAoC,QACpC2I,EAAsB3I,MAAM2E,OAAS,UACrCgE,EAAsB3I,MAAMlS,MAAQ,QACpC6a,EAAsBnI,UAAY,sCAClC7V,KAAK8d,wBAAwB/C,YAAYiD,GACzChe,KAAK8d,wBAAwB/C,YAAY/a,KAAK+d,oBAC9C/d,KAAKsX,UAAUyD,YAAY/a,KAAK8d,yBAEhC9d,KAAKiD,IAAMjD,KAAK6H,OAAOwF,WAAW,MAGlCrN,KAAKqE,eAAiB,IAAIuD,EAAc5H,KAAKiD,IAAKjD,KAAMA,KAAK6H,QACtC,OAAnBiB,IACA9I,KAAKqE,eAAeyE,eAAiBA,GAG1B,IAAImV,kBAAiB,SAACC,GAAgB,EAAKC,WAAY,EAAKnb,gBAClEob,QAAQpe,KAAKsX,UAAW,CAAEjW,YAAY,IAI3CrB,KAAK4N,QADL4J,GAGelE,OAAO+K,iBAAiBre,KAAK6H,QAAQ0S,gBAGxDva,KAAK4Z,WAGL5Z,KAAKse,qBAGkB,OAAnBxV,GACA9I,KAAK6N,eAET,IAkFIU,EAAK3F,SAASuM,cAAc,OAChC5G,EAAG8G,MAAQ,oFAEXrV,KAAKsX,UAAUyD,YAAYxM,GAE3BvO,KAAKyY,qBAAuBlK,EAC5BvO,KAAKwY,kBAxFM,CACX+F,IAAA,6YAOAA,QAAA,qaAOAA,QAAA,2nBAWAA,WAAA,qmCAoBAA,YAAA,wnBAUAA,WAAA,mOAIAA,OAAA,4PAIAA,UAAA,0PAIAA,UAAA,mOAIAA,KAAA,8fAkBAve,KAAKgd,wBAGLhd,KAAKgD,eA7lBb,wBAgmBI,WACIhD,KAAKqE,eAAerB,eAjmB5B,qCAumBI,cAvmBJ,+BAymBI,cAzmBJ,gCA2mBI,cA3mBJ,gCA6mBI,cA7mBJ,mCA+mBI,cA/mBJ,6CAinBI,cAjnBJ,sBAsnBI,SAASwb,GAOL,GANAxe,KAAK4E,KAAO4Z,EAEZxe,KAAK4Z,WACL5Z,KAAKgD,aAGgC,GAAjChD,KAAKwZ,kBAAkB/e,OAAa,CACpC,IAAIgkB,GAAOC,QAAuB1e,KAAKwZ,kBAAkB,KACzDmF,QAAUC,QAA2B5e,KAAK+B,MAAO0c,GAAM/Z,YA/nBnE,gCAooBI,WAQI,IARiB,WACbmD,EAAS7H,KAAK6H,OACdgX,EAAK,kBAAMhX,EAAOwT,yBAElByD,EAAS,SAAAC,GAAK,OAAI,EAAK1a,eAAemO,kBAAkBuM,EAAMC,QAAUH,IAAKtM,OAC7E0M,EAAS,SAAAF,GAAK,OAAI,EAAK1a,eAAe6a,kBAAkBH,EAAMI,QAAUN,IAAKxC,MALhE,aAQZ,IAAI+C,EAAM,KAEXvX,EAAO2N,iBAAiB4J,GAAQ,SAAAvb,GACZ,EAAKqT,eAAerT,EAAGib,EAAQG,EAAQG,IAGlD,EAAK1F,YACN7V,EAAE4R,kBACF5R,EAAEwb,sBARd,MAAmB,CAAC,YAAa,YAAa,UAAW,aAAc,YAAa,WAChF,QAAS,QAAS,WAAY,eADlC,eACkD,MA7oB1D,sBA0pBI,WAEIrf,KAAK6H,OAAOwN,MAAM1R,MAAQ,MAC1B3D,KAAK6H,OAAOwN,MAAMpO,OAAS,MAC3BjH,KAAK6H,OAAOlE,MAAQ3D,KAAK6H,OAAOyX,YAChCtf,KAAK6H,OAAOZ,OAASjH,KAAK6H,OAAO0X,eA/pBzC,uCAmqBI,WACIvf,KAAKwf,iBAAmB,GADA,UAEPxf,KAAK0Y,uBAFE,IAExB,2BAA6C,OAApC+G,EAAoC,QACrC9L,EAAI,IAAI+L,IAD6B,IAExBD,GAFwB,IAEzC,2BAAuB,KAAdxe,EAAc,QACnB0S,EAAE2G,IAAIrZ,EAAKI,WAAWN,KAAKE,OAHU,8BAKzCjB,KAAKwf,iBAAiBhhB,KAAKmV,IAPP,iCAnqBhC,sBA+qBI,WACI3T,KAAK2O,UAAY,GACjB3O,KAAK+B,MAAQ4d,EAAc3f,KAAKiD,IAAKjD,KAAK4E,KAAM5E,KAAK2O,UACjD3O,KAAK4O,kBAAmB5O,KAAK4Y,mBACjC5Y,KAAKme,WAELne,KAAK8Z,4BAGL9Z,KAAK4f,2BAGwB,OAAzB5f,KAAKF,iBACLE,KAAKF,gBAAgBa,UAGzB,IACQT,QACA2f,QAAQ7f,KAAMA,KAAK+B,OACzB,MAAO0X,IAET,OAAOzZ,KAAK+B,QApsBpB,sCAusBI,WAA2B,YACvB+d,QAAqB9f,KAAK+B,OAAO,SAACD,EAAMC,GAAU,MAC1CmP,EAAW,EACXC,EAAW,EAkBXrP,aAAgBie,MAhBpB,SAASC,EAAmBvgB,GACxB,GAAIA,EAAEsB,KAAKe,KAAKoD,YAAa,CACzB,IAAI+a,EAAmBle,EAAMD,KAAKrC,EAAEsB,KAAKe,KAAKoD,aAC1Cgb,GAAKpP,QAAqBmP,GAC1BC,GAAMva,OAAOwa,SAASD,EAAGhP,WACzBvL,OAAOwa,SAASD,EAAG/O,YACnBD,GAAYgP,EAAGhP,SACfC,GAAY+O,EAAG/O,UAEf8O,GACAD,EAAmBC,IAO3BD,CAAmBle,GAEvB,IAAI0N,EAAK0B,EACLzB,EAAK0B,EAELN,GAAWC,QAAqBhP,GA6CpC,OA5CI+O,IACArB,GAAMqB,EAASrB,GACfC,GAAMoB,EAASpB,KAGfD,GAAMC,IAEN,EAAKpL,eAAe+b,kBAChBte,EAAM,CAAE+B,EAAG/B,EAAK+B,EAAGC,EAAGhC,EAAKgC,GAC3B,CAAED,EAAG/B,EAAK+B,EAAI2L,EAAI1L,EAAGhC,EAAKgC,EAAI2L,GAAM,EAAK1N,MACzC,EAAK4M,UAAW,EAAKC,uBAAmBzQ,GAAW,GAI3D4D,EAAMwN,QAAQzN,EAAKgD,IAAInD,SAAQ,SAAA2a,OAG/B,UAAAva,EAAMwN,QAAQzN,EAAKgD,WAAnB,SAAwBnD,SAAQ,SAAA0e,GAC5B,IAGIC,EAHArf,EAAOc,EAAMd,KAAKof,GAClBE,GAAWzP,QAAqB7P,GAIpC,GAAIiQ,GAAYC,EAAU,EACtBmP,EAAc,IACF9hB,KAAK,CAAEgR,GAAI,EAAGC,GAAI,IAC9B,IAAK,IAAI/U,EAAI,EAAGA,EAAIuG,EAAKwG,OAAOhN,OAAS,EAAGC,IACxC4lB,EAAY9hB,KAAK,CAAEgR,GAAI0B,EAAUzB,GAAI0B,IACjCoP,WAAU9Y,SACV6Y,EAAY5lB,GAAG8U,IAAM+Q,EAAS9Y,OAAO/M,GAAG8U,GACxC8Q,EAAY5lB,GAAG8U,IAAM+Q,EAAS9Y,OAAO/M,GAAG+U,IAGhD6Q,EAAY9hB,KAAK,CAAEgR,GAAI,EAAGC,GAAI,SACvB8Q,WAAU9Y,SACjB6Y,EAAcC,EAAS9Y,QAEvB6Y,GAEA,EAAKjc,eAAe+b,kBAAkBnf,EAAM,CAAE4C,EAAG,EAAGC,EAAG,GACnD,CAAED,EAAG,EAAGC,EAAG,GAAK,EAAK/B,MAAO,EAAK4M,UACjC,EAAKC,uBAAmBzQ,GAAW,GAAO,EAAOmiB,OAGtD,OA/wBnB,0BAqxBI,WAA8C,WAAjC/f,EAAiC,uDAAtB,KAAM0N,IAAgB,yDACrC1N,GAA+B,GAAnBA,EAAS9F,SACtB8F,EAAWP,KAAK+B,MAAML,QAAQiV,KAAI,SAAA9S,GAAC,OAAI,EAAK9B,MAAMD,KAAK+B,OAE3D,IAAImD,EAAKE,EAAY3G,GACrBP,KAAKqE,eAAemc,SAASxZ,EAAIiH,GAEjCjO,KAAKgD,eA5xBb,0BA+xBI,WACIhD,KAAKygB,uBAAsB,SAACC,EAAOC,EAAOrhB,GAClC,iBAAkBA,EAAI+B,aAAe/B,EAAIc,KAAKwgB,SAAS,UACvDthB,EAAI+B,WAAW4C,cAAe,MAGtCjE,KAAK6gB,0BAEL7gB,KAAK4Z,WACL5Z,KAAKgD,eAxyBb,wBA2yBI,WACIhD,KAAKygB,uBAAsB,SAACC,EAAOC,EAAOrhB,GAClC,iBAAkBA,EAAI+B,aAAe/B,EAAIc,KAAKwgB,SAAS,UACvDthB,EAAI+B,WAAW4C,cAAe,MAGtCjE,KAAK6gB,0BAEL7gB,KAAK4Z,WACL5Z,KAAKgD,eApzBb,6BAuzBI,WACIhD,KAAKygB,uBAAsB,SAACC,EAAOC,EAAOrhB,IACtCwhB,QAAwBxhB,MAG5BU,KAAK6gB,0BAEL7gB,KAAK4Z,WACL5Z,KAAKgD,eA/zBb,kBAm0BI,SAAK+d,EAAUC,GACX,IAAIC,EAAOrY,SAASuM,cAAc,KAClC8L,EAAKC,aAAa,WAAYH,GAC9BE,EAAKE,KAAOH,EACZpY,SAASwM,KAAK2F,YAAYkG,GAG1B3N,OAAOC,uBAAsB,WACzB,IAAIwL,EAAQ,IAAIqC,WAAW,SAC3BH,EAAKI,cAActC,GACnBnW,SAASwM,KAAK2E,YAAYkH,QA70BtC,yBAi1BI,WACIjhB,KAAK8S,KAAK,WAAY9S,KAAK6H,OAAOyZ,UAAU,gBAl1BpD,qBAq1BI,WACI,IAGI,OAFAC,WACAC,WAAWC,YACJ,EACT,MAAO5gB,GACL,OAAO,KA31BnB,yBA+1BI,WAA8B,IAMtB6gB,EANsB,OAAlBC,EAAkB,wDACtBC,EAASL,aAGTM,EAAO7hB,KAAKqE,eAAemO,kBAAkB,GAC7CsP,EAAO9hB,KAAKqE,eAAe6a,kBAAkB,GAEjD,GAAIyC,EAAU,CAEV,IAAIphB,EAAWP,KAAK+B,MAAML,QAAQiV,KAAI,SAAA9S,GAAC,OAAI,EAAK9B,MAAMD,KAAK+B,MACvDmD,EAAKE,EAAY3G,GACrBmhB,EAAO,CAAC1a,EAAGrD,MAAOqD,EAAGC,YAClB,CAEH,IAAI8a,EAAO/hB,KAAKqE,eAAemO,kBAAkBxS,KAAK6H,OAAOlE,OACzDqe,EAAOhiB,KAAKqE,eAAe6a,kBAAkBlf,KAAK6H,OAAOZ,QACzDgb,EAAOF,EAAOF,EAAMK,EAAOF,EAAOF,EACtCJ,EAAO,CAACO,EAAMC,GAIlB,IAAIjf,EAAM,IAAIue,WAAWC,WAAWG,EAAQ,CACxCF,KAAMA,IAENS,EAASniB,KAAKiD,IAClBjD,KAAKiD,IAAMA,EACXjD,KAAKiD,IAAIQ,KAAOke,EAChB3hB,KAAKiD,IAAImf,KAAM,EAEVT,GACD3hB,KAAKiD,IAAI0H,WAAWkX,GAAOC,GAE/B9hB,KAAKgD,aAELC,EAAI2e,OAAOS,GAAG,UAAU,WACpB,EAAKvP,KAAK,WAAY7P,EAAI2e,OAAOU,UAAU,oBAC3C,EAAKrf,IAAMkf,EACX,EAAKnf,kBAp4BjB,6BAy4BI,SAAgB6e,EAAMC,EAAMC,EAAMC,GAK9B,IALsD,IAAlBO,EAAkB,uDAAL,IAC3CC,EAAY/c,KAAKgd,MAAMZ,EAAOU,GAAcA,EAC5CG,EAAYjd,KAAKkd,KAAKZ,EAAOQ,GAAcA,EAC3CK,EAAYnd,KAAKgd,MAAMX,EAAOS,GAAcA,EAC5CM,EAAYpd,KAAKkd,KAAKX,EAAOO,GAAcA,EACxC7nB,EAAI8nB,EAAW9nB,GAAKgoB,EAAWhoB,GAAK6nB,EACzCviB,KAAKiD,IAAI6f,OAAOpoB,EAAGkoB,GACnB5iB,KAAKiD,IAAI8f,OAAOroB,EAAGmoB,GAEvB,IAASnoB,EAAIkoB,EAAWloB,GAAKmoB,EAAWnoB,GAAK6nB,EACzCviB,KAAKiD,IAAI6f,OAAON,EAAW9nB,GAC3BsF,KAAKiD,IAAI8f,OAAOL,EAAWhoB,GAE/BsF,KAAKiD,IAAI+f,YAAc,SACvBhjB,KAAKiD,IAAIggB,SAGTjjB,KAAKiD,IAAIigB,YACTljB,KAAKiD,IAAIkgB,IAAI,EAAG,EAAG,GAAI,EAAG,EAAI1d,KAAKiF,IAAI,GACvC1K,KAAKiD,IAAI+P,UAAY,MACrBhT,KAAKiD,IAAImgB,OACTpjB,KAAKiD,IAAI+f,YAAc,MACvBhjB,KAAKiD,IAAIggB,WA/5BjB,kBAm6BI,SAAKpQ,GACD,IAAM5P,EAAMjD,KAAKiD,IACXzB,EAAIxB,KAAK+B,MACT8f,EAAO7hB,KAAKqE,eAAemO,kBAAkB,GAC7CsP,EAAO9hB,KAAKqE,eAAe6a,kBAAkB,GAC7C6C,EAAO/hB,KAAKqE,eAAemO,kBAAkBxS,KAAK6H,OAAOlE,OACzDqe,EAAOhiB,KAAKqE,eAAe6a,kBAAkBlf,KAAK6H,OAAOZ,QACzDgb,EAAOF,EAAOF,EAAMK,EAAOF,EAAOF,EAQxC,GANA9hB,KAAKuD,aAAe,CAAEM,EAAGge,EAAM/d,EAAGge,EAAM/d,EAAGke,EAAMje,EAAGke,GAEpDliB,KAAKqjB,eAELC,QAAUtjB,KAAMiD,EAAKzB,EAAGxB,KAAKM,SAAUN,KAAKuX,YAExCvX,KAAK8Y,gBAAiB,CACtB9Y,KAAKiD,IAAIigB,YACT,IAAMK,EAAiBvjB,KAAKiD,IAAIugB,UAChCxjB,KAAKiD,IAAIugB,UAAYxjB,KAAKqE,eAAeC,mBACzCtE,KAAKiD,IAAI+f,YAAc,OACvBhjB,KAAKiD,IAAI+K,KAAKhO,KAAK8Y,gBAAgB2K,QAASzjB,KAAK8Y,gBAAgB4K,QAC7D1jB,KAAK8Y,gBAAgB6K,MAAQ3jB,KAAK8Y,gBAAgB2K,QAClDzjB,KAAK8Y,gBAAgB8K,MAAQ5jB,KAAK8Y,gBAAgB4K,SACtD1jB,KAAKiD,IAAIggB,SACTjjB,KAAKiD,IAAIugB,UAAYD,EAGrBvjB,KAAKuX,aACLvX,KAAK6jB,gBAAgBhC,EAAMC,EAAMC,EAAMC,EAAM,KACzChiB,KAAKM,SACLN,KAAK6a,iBAAiB5U,UAAY,MAAQR,KAAKgd,MAAMziB,KAAKM,SAASuD,GAC/D,SAAW4B,KAAKgd,MAAMziB,KAAKM,SAASwD,GAExC9D,KAAK6a,iBAAiB5U,UAAY,mBAI1CjG,KAAK8jB,iBAx8Bb,yBA28BI,cA38BJ,0BA68BI,WACiC,OAAzB9jB,KAAKF,iBACLE,KAAKF,gBAAgBuT,OAEzB,IACIrT,KAAKiD,IAAI0P,MACX,MAAO8G,IAIT,GAAIzZ,KAAK+F,QAAS,CACd,IAAM8Y,EAAK7e,KAAK6H,OAAOwT,wBACjB0I,EAAM,CACRlgB,EAAG7D,KAAK+Y,aAAalV,EAAIgb,EAAGhb,EAC5BC,EAAG9D,KAAK+Y,aAAajV,EAAI+a,EAAG/a,GAIhC9D,KAAKgG,kBAAkBqP,MAAQ,GAC/BrV,KAAKgG,kBAAkB6P,UAAY,GACnC7V,KAAKgG,kBAAkBqP,MAAMC,QAAU,QAGvCtV,KAAK+F,QAAQ/F,KAAKgG,mBAGlBhG,KAAKgG,kBAAkBqP,MAAMgH,IAAM0H,EAAIjgB,EAAI,KAC3C9D,KAAKgG,kBAAkBqP,MAAM9C,KAAQwR,EAAIlgB,EAAI,GAAM,UAEnD7D,KAAKgG,kBAAkBqP,MAAMC,QAAU,OAG3C,GAAItV,KAAK4E,KAAK+P,MAAO,CACjB,IAAMA,EAAQ3U,KAAK4E,KAAK+P,MAEpBvU,EAAO,GACP8R,GAAY,EACZ8R,GAAS,EACb,QAAwB7lB,IAApBwW,EAAMsP,UACN7jB,EAAO,SACP4jB,EAAQrP,EAAMsP,cACX,SAAuB9lB,IAAnBwW,EAAMzC,SAYb,OAXAA,EAAWyC,EAAMzC,cACK/T,IAAlBwW,EAAMvD,SACNhR,EAAO,OACP4jB,EAAQrP,EAAMvD,cACWjT,IAAlBwW,EAAMrF,SACblP,EAAO,OACP4jB,EAAQrP,EAAMrF,SAEdlP,EAAO,QAKf,IAAM8jB,EAAoBC,mBACtBnkB,KAAK+B,MAAO3B,EAAMuU,EAAM5P,QAASmN,EAAU8R,GAE3CE,IACAlkB,KAAK6N,aAAa,CAACqW,IACnBlkB,KAAK8d,wBAAwBzI,MAAMC,QAAU,QAC7CtV,KAAK8d,wBAAwBzI,MAAMqF,OAAS,KAC5C1a,KAAK8d,wBAAwBzI,MAAM9C,KAAO,KAC1CvS,KAAK+d,mBAAmB9X,UAAY0O,EAAMyP,cAG9CpkB,KAAK8d,wBAAwBzI,MAAMC,QAAU,SA/gCzD,8BAmhCI,WACI,IAAMuM,EAAO7hB,KAAKqE,eAAemO,kBAAkB,GAC7CsP,EAAO9hB,KAAKqE,eAAe6a,kBAAkB,GAG7C+C,EAFOjiB,KAAKqE,eAAemO,kBAAkBxS,KAAK6H,OAAOlE,OAE3Cke,EACdK,EAFOliB,KAAKqE,eAAe6a,kBAAkBlf,KAAK6H,OAAOZ,QAE3C6a,EACdvhB,EAAW,GAqBjB,OApBAP,KAAKqkB,4BAA4BxC,EAAMC,EAAMG,EAAMC,GAAM,SAAC9hB,EAAMS,EAAGvB,GAC/D,IAAM4S,EAAWrR,EAAE2C,MAAQmC,OAAO9E,EAAE2C,QAAU,EAC1C8gB,EAAU,QACD,UAATlkB,EACAkkB,EAAU,OACI,WAATlkB,EACLkkB,EAAU,QACI,UAATlkB,EACLkkB,EAAU,OACI,YAATlkB,EACLkkB,EAAU,SACI,eAATlkB,IACLkkB,EAAU,aACd/jB,EAAS/B,KAAK,CACV4B,KAAMkkB,EACNvf,QAASY,OAAO9E,EAAEkE,SAClBmN,SAAUA,EACVpN,GAAIa,OAAO9E,EAAEiE,SAGdvE,IA/iCf,8BAwjCI,SAAiBsD,EAAGC,EAAGC,EAAGC,GACtB,IAAMzD,EAAW,CACbgkB,OAAQ,GAAI7iB,MAAO,GAAI8iB,WAAY,GACnCxiB,MAAO,GAAIyiB,QAAS,IAMxB,OAJAzkB,KAAKqkB,4BAA4BxgB,EAAGC,EAAGC,EAAGC,GAAG,SAAC5D,EAAMS,EAAGvB,GACnDuB,EAAEvB,IAAMA,EACRiB,EAASH,GAAM5B,KAAKqC,MAEjBN,IAjkCf,yCAokCI,SAA4BsD,EAAGC,EAAGC,EAAGC,EAAG0gB,IAEpC,SAASC,EAAmBnjB,EAAGojB,EAAW7f,GACtCvD,EAAEE,QAAQC,SAAQ,SAAAuQ,GACd,IAAM1O,EAAQhC,EAAEM,KAAKoQ,GACrB,GAAK1O,GAEDA,EAAMI,UAAUC,EAAGC,EAAGC,EAAGC,GAAI,CAI7B,GAFA0gB,EAAK,SAAU,CAAE9f,KAAMggB,EAAW7f,QAASA,EAASD,GAAIoN,GAAY1O,GAEhEA,EAAMzC,KAAKyC,MAAMnC,WAAW4C,aAC5B,OAEJ,IAAMgO,EAAKzO,EAAMzC,KAAKgB,MACtB,IAAKkQ,EACD,OACJA,EAAGvQ,QAAQC,SAAQ,SAAAyP,GACf,IAAMtP,EAAOmQ,EAAGnQ,KAAKsP,GACjBtP,EAAK8B,UAAUC,EAAGC,EAAGC,EAAGC,KAExB0gB,EAAK,QAAS,CAAE9f,KAAMggB,EAAW7f,QAASA,EAASvB,MAAO0O,EAAUpN,GAAIsM,GAAWtP,GAGvD,eAAxBA,EAAKf,KAAKe,KAAK1B,MACfukB,EAAmB7iB,EAAKf,KAAKgB,MACzBD,EAAKf,KAAKe,KAAKT,WAAWuD,KAAKvD,WAAW1B,KAC1CmC,EAAKf,KAAKe,KAAKT,WAAWuD,KAAKC,eAG3C/C,EAAK+P,cAAclQ,SAAQ,SAAC0H,EAAG3O,GACvB2O,EAAEzF,UAAUC,EAAGC,EAAGC,EAAGC,IACrB0gB,EAAK,aAAc,CACf9f,KAAMggB,EAAW7f,QAASA,EAASvB,MAAO0O,EAAUpQ,KAAMsP,EAC1DyT,UAAWnqB,EAAGoqB,SAAU,MACzBzb,MAEXvH,EAAK0P,eAAe7P,SAAQ,SAAC0H,EAAG3O,GACxB2O,EAAEzF,UAAUC,EAAGC,EAAGC,EAAGC,IACrB0gB,EAAK,aAAc,CACf9f,KAAMggB,EAAW7f,QAASA,EAASvB,MAAO0O,EAAUpQ,KAAMsP,EAC1DyT,UAAWnqB,EAAGoqB,SAAU,OACzBzb,SAKf4I,EAAGjQ,QAAQL,SAAQ,SAAA2N,GACf,IAAMrO,EAAOgR,EAAGhR,KAAKqO,GACjBrO,EAAK2C,UAAUC,EAAGC,EAAGC,EAAGC,IACxB0gB,EAAK,QAAS,CAAE9f,KAAMggB,EAAW7f,QAASA,EAASvB,MAAO0O,EAAUpN,GAAI7D,EAAK6D,IAAM7D,UAOnGO,EAAEQ,QAAQL,SAAQ,SAAAsiB,GACd,IAAMc,EAASvjB,EAAEP,KAAKgjB,GAClBc,EAAOnhB,UAAUC,EAAGC,EAAGC,EAAGC,IAC1B0gB,EAAK,UAAW,CAAE9f,KAAMggB,EAAW7f,QAASA,EAASD,GAAIigB,EAAOjgB,IAAMigB,MAMlFJ,CAAmB3kB,KAAK+B,MAAO/B,KAAK4E,KAAKvD,WAAW1B,KAChDK,KAAK4E,KAAKC,gBAvoCtB,mCA0oCI,SAAsB6f,IAElB,SAASC,EAAmB/f,GACxBA,EAAKlD,MAAMC,SAAQ,SAAC6B,EAAO0O,GAEvBwS,EAAK,SAAU,CAAE9f,KAAMA,EAAME,GAAIoN,GAAY1O,GAE7CA,EAAM9B,MAAMC,SAAQ,SAACG,EAAMsP,GAEvBsT,EAAK,QAAS,CAAE9f,KAAMA,EAAMpB,MAAO0O,EAAUpN,GAAIsM,GAAWtP,GAG1C,eAAdA,EAAK1B,MACLukB,EAAmB7iB,EAAKT,WAAWuD,SAI3CpB,EAAMxB,MAAML,SAAQ,SAACV,EAAMqO,GACvBoV,EAAK,QAAS,CAAE9f,KAAMA,EAAMpB,MAAO0O,EAAUpN,GAAIwK,GAAWrO,SAKpE2D,EAAK5C,MAAML,SAAQ,SAACojB,EAAQd,GACxBS,EAAK,UAAW,CAAE9f,KAAMA,EAAME,GAAImf,GAAac,MAKvDJ,CAAmB3kB,KAAK4E,QAvqChC,8BA0qCI,SAAiBf,EAAGC,EAAGC,EAAGC,EAAG0gB,IAEzB,SAASC,EAAmBnjB,EAAGojB,GAC3BpjB,EAAEE,QAAQC,SAAQ,SAAAuQ,GACd,IAAM1O,EAAQhC,EAAEM,KAAKoQ,GACrB,GAAK1O,IAGLkhB,EAAK,SAAU,CAAE9f,KAAMggB,EAAW9f,GAAIoN,EAAUnQ,MAAOP,GAAKgC,EAAOA,EAAMI,UAAUC,EAAGC,EAAGC,EAAGC,KAExFR,EAAMzC,KAAKyC,MAAMnC,WAAW4C,cAAhC,CAGA,IAAMgO,EAAKzO,EAAMzC,KAAKgB,MACjBkQ,IAELA,EAAGvQ,QAAQC,SAAQ,SAAAyP,GACf,IAAMtP,EAAOmQ,EAAGnQ,KAAKsP,GAErBsT,EAAK,QAAS,CAAE9f,KAAMggB,EAAWphB,MAAO0O,EAAUpN,GAAIsM,EAASrP,MAAOkQ,GAAMnQ,EAAMA,EAAK8B,UAAUC,EAAGC,EAAGC,EAAGC,IAG9E,eAAxBlC,EAAKf,KAAKe,KAAK1B,MACfukB,EAAmB7iB,EAAKf,KAAKgB,MAAOD,EAAKf,KAAKe,KAAKT,WAAWuD,KAAKvD,WAAW1B,MAGlFmC,EAAK+P,cAAclQ,SAAQ,SAAC0H,EAAG3O,GAC3BgqB,EAAK,aAAc,CACf9f,KAAMggB,EAAWphB,MAAO0O,EAAUpQ,KAAMsP,EACxCyT,UAAWnqB,EAAGoqB,SAAU,KAAM/iB,MAAOkQ,GACtC5I,EAAGA,EAAEzF,UAAUC,EAAGC,EAAGC,EAAGC,OAE/BlC,EAAK0P,eAAe7P,SAAQ,SAAC0H,EAAG3O,GAC5BgqB,EAAK,aAAc,CACf9f,KAAMggB,EAAWphB,MAAO0O,EAAUpQ,KAAMsP,EACxCyT,UAAWnqB,EAAGoqB,SAAU,MAAO/iB,MAAOkQ,GACvC5I,EAAGA,EAAEzF,UAAUC,EAAGC,EAAGC,EAAGC,UAKnCiO,EAAGjQ,QAAQL,SAAQ,SAAA2N,GACf,IAAMrO,EAAOgR,EAAGhR,KAAKqO,GACrBoV,EAAK,QAAS,CAAE9f,KAAMggB,EAAWphB,MAAO0O,EAAUpN,GAAI7D,EAAK6D,GAAI/C,MAAOkQ,GAAMhR,EAAMA,EAAK2C,UAAUC,EAAGC,EAAGC,EAAGC,YAKlHxC,EAAEQ,QAAQL,SAAQ,SAAAsiB,GACd,IAAMc,EAASvjB,EAAEP,KAAKgjB,GACtBS,EAAK,UAAW,CAAE9f,KAAMggB,EAAW9f,GAAIigB,EAAOjgB,GAAI/C,MAAOP,GAAKujB,EAAQA,EAAOnhB,UAAUC,EAAGC,EAAGC,EAAGC,OAKxG2gB,CAAmB3kB,KAAK+B,MAAO/B,KAAK4E,KAAKvD,WAAW1B,QAjuC5D,oCAouCI,SAAuBsB,GAAM,UACNjB,KAAKwf,kBADC,IACzB,gCAAWC,EAAX,QACI,GAAIA,EAAKuF,IAAI/jB,GACT,OAAOwe,GAHU,8BAIzB,MAAO,KAxuCf,wCA2uCI,SAA2BwF,EAAaC,GAsBpC,IApBA,IAAM3kB,EAAWP,KAAKmlB,iBAAiBF,EAAaC,EAAa,EAAG,GAC9DE,EAAiB7kB,EAASgkB,OAC1Bc,EAAgB9kB,EAASmB,MACzB4jB,EAAgB/kB,EAASyB,MACzBujB,EAA2BhlB,EAASkkB,QACpCe,EAAqBjlB,EAASikB,WAC9BiB,EACFL,EAAe3qB,OAAS4qB,EAAc5qB,OACtC6qB,EAAc7qB,OAAS8qB,EAAyB9qB,OAChD+qB,EAAmB/qB,OACnB+F,EAAkB,KAAMklB,GAAsB,EAUlD,MANmB,CACfN,EACAG,EACAF,EACAC,GAEJ,eACI,IADC,IAAMK,EAAQ,KACNjrB,EAAI,EAAGA,EAAIirB,EAASlrB,OAAQC,IAAK,CACtC,IAAMiZ,EAAIgS,EAASjrB,GAAG4E,IAAIqE,MAAQgiB,EAASjrB,GAAG4E,IAAI2H,QAC9Cye,EAAqB,GAAK/R,EAAI+R,KAC9BA,EAAqB/R,EACrBnT,EAAkBmlB,EAASjrB,GAAG4E,KAK1C,MAAO,CACHmmB,iBACAllB,WACAC,qBA9wCZ,0BAkxCI,SAAaue,GAGT,GAAIA,EAAM1jB,SAAWuN,SAASwM,KAA9B,CASA,GANIpV,KAAKmZ,qBAAuB4F,EAAM6G,SAClC5lB,KAAKkY,eAAeiD,QAAQ4D,GAAO,GAEnC/e,KAAKoZ,qBAAuB2F,EAAM8G,UAClC7lB,KAAKiY,aAAakD,QAAQ4D,GAAO,GAEb,QAApB/e,KAAK6Y,WAwBT,MApByB,WAAdkG,EAAMljB,IACTmE,KAAKwZ,kBAAkB/e,OAAS,IAChCuF,KAAKwZ,kBAAkB7X,SAAQ,SAAA4M,GAC3BA,EAAGuX,UAAW,KAElB9lB,KAAKwZ,kBAAoB,GACzBxZ,KAAKgD,cAEY,WAAd+b,EAAMljB,KAAmC,UAAfkjB,EAAM3e,OACnCJ,KAAKwZ,kBAAkB/e,OAAS,GAChCuF,KAAK+lB,mBAAmB/lB,KAAKwZ,mBACjCxZ,KAAKwZ,kBAAoB,IAGzBuF,EAAM6G,UAAY7G,EAAM8G,UACxB7lB,KAAKkY,eAAeiD,QAAQ4D,GAAO,GAEnCA,EAAM8G,WAAa9G,EAAM6G,SACzB5lB,KAAKiY,aAAakD,QAAQ4D,GAAO,IAE9B,EAvBe,WAAdA,EAAMljB,KAAqBkjB,EAAM6G,SAAY7G,EAAM8G,UACnD7lB,KAAKgY,YAAYmD,aAhyCjC,4BAyzCI,SAAe4D,EAAOiH,EAAaC,GAA+B,WAAlB7G,EAAkB,uDAAT,SACjDpf,KAAKmZ,oBAAsBnZ,KAAKoZ,qBAChCpZ,KAAKwd,aAAauB,GAEtB,IAAImH,GAAQ,EAERC,GAAwB,EAExBC,GAA0B,EAE9B,GAAe,cAAXhH,GAAqC,eAAXA,EAC1Bpf,KAAK6O,WAAakQ,OACf,GAAe,YAAXK,EACPpf,KAAK6O,WAAa,KAClB7O,KAAK6X,qBAAuB,UACzB,GAAe,aAAXuH,EACqB,GAAxBL,EAAMsH,QAAQ5rB,OACduF,KAAK6O,WAAa,KAElB7O,KAAK6O,WAAakQ,OACnB,GAAe,cAAXK,EAAwB,CAE/B,IAAM5Q,EAAexO,KAAKM,SAK1B,GAJAN,KAAKM,SAAW,CAAEuD,EAAGmiB,EAAYjH,GAAQjb,EAAGmiB,EAAYlH,IACxD/e,KAAK+Y,aAAe,CAAElV,EAAGkb,EAAMC,QAASlb,EAAGib,EAAMI,SAG7Cnf,KAAK6O,YAA8B,EAAhBkQ,EAAMuH,QAAa,CAGtC,GAFAtmB,KAAKgZ,UAAW,EAEQ,SAApBhZ,KAAK6Y,WAAuB,CAC5B,GAAI7Y,KAAK6X,qBAAsB,CAC3B7X,KAAK6H,OAAOwN,MAAM2E,OAAS,WAC3Bha,KAAK6O,WAAWgB,GAAKmW,EAAYhmB,KAAK6O,YACtC7O,KAAK6O,WAAWkB,GAAKkW,EAAYjmB,KAAK6O,YACtC,IAAI0X,EAAmB,CAACvmB,KAAK6X,sBACzB7X,KAAKwZ,kBAAkB3F,SACnB7T,KAAK6X,uBACJ7X,KAAKwZ,kBAAkB/e,OAAS,IACrC8rB,EAAmBvmB,KAAKwZ,kBAAkBrM,QACtC,SAAAoB,GAEI,GAAIA,aAAciY,KACd,OAAO,EACX,IAAIC,EAAUlY,EAAG3J,KAAKC,aAIlB6hB,EACA,EAAK9X,kBAAkB6X,GAC3B,GAAIC,GACA,EAAKlN,kBAAkB3F,SACnB6S,GAEJ,OAAO,EAIX,IAAIC,EACA,EAAKhY,UAAU8X,GAAS3kB,KACpByM,EAAGtJ,WAEX,OAAI0hB,IACA,EAAKnN,kBAAkB3F,SACnB8S,OAUpB,IA3C2B,EA2CvB5X,EAAmBwX,EAAiB9rB,OAAS,EA3CtB,IA4CZ8rB,GA5CY,IA4C3B,2BAAiC,KAAxBhY,EAAwB,QAC7BvO,KAAKqE,eAAe+b,kBAChB7R,EACAC,EAAcxO,KAAKM,SACnBN,KAAK+B,MAAO/B,KAAK2O,UACjB3O,KAAK4O,kBACL5O,KAAK6O,YACL,EACAE,IApDmB,8BA0D3B,OAFAmX,GAAQ,EACRlmB,KAAKgD,cACE,EAEP,IAAM4jB,EAAiB5mB,KAAK6mB,2BACxB7mB,KAAKM,SAASuD,EAAG7D,KAAKM,SAASwD,GAEnC,OAAI8iB,EAAepmB,kBACfR,KAAK6X,qBACD+O,EAAepmB,gBACnBR,KAAK6H,OAAOwN,MAAM2E,OAAS,YACpB,GAIY,WAApBha,KAAK6Y,YACZ7Y,KAAK8Y,gBAAkB,CACnB2K,QAASuC,EAAYhmB,KAAK6O,YAC1B6U,QAASuC,EAAYjmB,KAAK6O,YAC1B8U,MAAO3jB,KAAKM,SAASuD,EACrB+f,MAAO5jB,KAAKM,SAASwD,GAIzBoiB,GAAQ,IAERlmB,KAAKqE,eAAesG,UAAUoU,EAAM+H,UAChC/H,EAAMgI,WAGVb,GAAQ,QAET,GAAIlmB,KAAK6O,YAA8B,EAAhBkQ,EAAMuH,QAEhCtmB,KAAKgZ,UAAW,EAChBhZ,KAAKqE,eAAesG,UAAUoU,EAAM+H,UAAW/H,EAAMgI,WACrDb,GAAQ,EACRC,GAAwB,OAIxB,GAFAnmB,KAAK6O,WAAa,KAClB7O,KAAK6X,qBAAuB,KACR,EAAhBkH,EAAMuH,SAA+B,EAAhBvH,EAAMuH,QAC3B,OAAO,OAEZ,GAAe,cAAXlH,EACP,GAAIpf,KAAK6O,WAAWwX,QAAQ5rB,QAAUskB,EAAMsH,QAAQ5rB,OAEhDuF,KAAK6O,WAAakQ,MACf,IAA4B,GAAxBA,EAAMsH,QAAQ5rB,OAQrB,OAPAuF,KAAKqE,eAAesG,UAAUoU,EAAMsH,QAAQ,GAAGrH,QAAUhf,KAAK6O,WAAWwX,QAAQ,GAAGrH,QAChFD,EAAMsH,QAAQ,GAAGlH,QAAUnf,KAAK6O,WAAWwX,QAAQ,GAAGlH,SAC1Dnf,KAAK6O,WAAakQ,EAGlBmH,GAAQ,EACRlmB,KAAKgD,cACE,EACJ,GAA4B,GAAxB+b,EAAMsH,QAAQ5rB,OAAa,CAGlC,IAAMusB,EAAShnB,KAAK6O,WAAWwX,QAAQ,GACjCY,EAASjnB,KAAK6O,WAAWwX,QAAQ,GACnClf,EAAK6f,EAAOhI,QAAS3X,EAAK4f,EAAOjI,QACjC5X,EAAK4f,EAAO7H,QAAS7X,EAAK2f,EAAO9H,QAC/B+H,EAAY,EAAE/f,EAAKE,GAAM,GAAMD,EAAKE,GAAM,GAC1C6f,EAAkB1hB,KAAKsE,KAAK,SAAC5C,EAAKE,EAAO,GAAb,SAAkBD,EAAKE,EAAO,IAChEH,EAAK4X,EAAMsH,QAAQ,GAAGrH,QAAS3X,EAAK0X,EAAMsH,QAAQ,GAAGrH,QACrD5X,EAAK2X,EAAMsH,QAAQ,GAAGlH,QAAS7X,EAAKyX,EAAMsH,QAAQ,GAAGlH,QACrD,IAAMiI,EAAkB3hB,KAAKsE,KAAK,SAAC5C,EAAKE,EAAO,GAAb,SAAkBD,EAAKE,EAAO,IAC1D+f,EAAY,EAAElgB,EAAKE,GAAM,GAAMD,EAAKE,GAAM,GAchD,OAXAtH,KAAKqE,eAAesG,UAAU0c,EAAU,GAAKH,EAAU,GACnDG,EAAU,GAAKH,EAAU,IAE7BlnB,KAAKqE,eAAeyF,MAAMsd,EAAkBD,EACxCE,EAAU,GAAIA,EAAU,IAE5BrnB,KAAK6O,WAAakQ,EAGlBmH,GAAQ,EACRlmB,KAAKgD,cACE,QAER,GAAe,UAAXoc,EAAoB,CAE3B,IAAMP,EAAK7e,KAAK6H,OAAOwT,wBACjBxX,EAAIkb,EAAMC,QAAUH,EAAGhb,EACvBC,EAAIib,EAAMI,QAAUN,EAAG/a,EAC7B9D,KAAKqE,eAAeyF,MAAMiV,EAAMuI,OAAS,EAAI,GAAM,IAAKzjB,EAAGC,GAC3DoiB,GAAQ,EACRC,GAAwB,EAI5B,IAAKnmB,KAAKM,SACN,OAAO,EAGX,IAAMinB,EAAwBvnB,KAAK6mB,2BAC/B7mB,KAAKM,SAASuD,EAAG7D,KAAKM,SAASwD,GAE7BvD,EAAWgnB,EAAsBhnB,SACjCklB,EAAiB8B,EAAsB9B,eACvCjlB,EAAkB+mB,EAAsB/mB,gBAE9C,GAAuB,OAAnBR,KAAK6Y,WAAqB,CAC1B,IAAItK,EAAKvO,KAAKyY,qBACVtB,EACAnX,KAAKoY,SAAU5X,EAAiBR,KAAKqY,aAAcrY,KAAKM,UAExDiO,EAAGiZ,kBAAkBtG,aAAa,SAAU,SAE5C3S,EAAGiZ,kBAAkBtG,aAAa,SAAU,OAEhD3S,EAAG8G,MAAM9C,KACJwM,EAAM0I,OAASlZ,EAAGiZ,kBAAkBE,YAAc,EAAK,KAC5DnZ,EAAG8G,MAAMgH,IACJ0C,EAAM4I,OAASpZ,EAAGiZ,kBAAkBI,aAAe,EAAK,KAiGjE,GA7FwB,WAApB5nB,KAAK6Y,WACL7Y,KAAK6H,OAAOwN,MAAM2E,OAAS,YACpByL,EAAiB,EACA,SAApBzlB,KAAK6Y,YAAyB7Y,KAAK6O,WACnC7O,KAAK6H,OAAOwN,MAAM2E,OAAS,WACA,SAApBha,KAAK6Y,WACZ7Y,KAAK6H,OAAOwN,MAAM2E,OAAS,OAGtBxZ,EAAgBO,KAAKyC,OACrBhD,EAAgBO,KAAKyC,MAAMnC,WAAW4C,cACtCzD,EAAgBO,KAAKe,MACrBtB,EAAgBO,KAAKe,KAAKT,WAAW4C,aAGtCjE,KAAK6H,OAAOwN,MAAM2E,OAAS,QAE3Bha,KAAK6H,OAAOwN,MAAM2E,OAAS,UAInCha,KAAK6H,OAAOwN,MAAM2E,OAAS,OAG/Bha,KAAK+F,QAAU,KACf/F,KAAK2X,sBAAwBpX,EAG7BP,KAAKY,iBAAiBZ,KAAKM,SAASuD,EAAG7D,KAAKM,SAASwD,EAAG,EAAG,GAAG,SAAC1D,EAAMS,EAAGvB,EAAKuoB,GACzEvoB,EAAIwoB,SAAU,EACdxoB,EAAIyoB,aAAc,KAGtB/nB,KAAKY,iBAAiBZ,KAAKM,SAASuD,EAAG7D,KAAKM,SAASwD,EAAG,EAAG,GAAG,SAAC1D,EAAMS,EAAGvB,EAAKuoB,GA2BzE,GAzBIA,GAAevoB,aAAe2C,MAAyB,MAAjB3C,EAAI2F,WAC7B,EAAK+iB,uBAAuB1oB,GACpCqC,SAAQ,SAAAsmB,GACLA,GAAM3oB,QAAcnB,IAAP8pB,IACbA,EAAGF,aAAc,MAMzBF,GAAevoB,aAAe4oB,aAC9BpI,QAAqB,EAAKnR,UAAUrP,EAAIsF,KAAKC,eAAe,SAAC/C,GAEzD,OAAIA,aAAgB6C,QAGhB7C,aAAgBomB,YAAcpmB,EAAKf,KAAKe,KAAKqmB,QAAU7oB,EAAIyB,KAAKe,KAAKqmB,QACrErmB,EAAKimB,aAAc,IAGhB,MAKXF,GAAevoB,aAAeknB,KAAW,CACzC,IAAM4B,EAAevnB,EAAEkB,MAAMD,KAAKxC,EAAI2F,WAAWlE,KAAKgB,MAClDqmB,IACAtI,QAAqBsI,GAAc,SAACtmB,GAEhC,OAAIA,aAAgB6C,QAGhB7C,aAAgBomB,YAAcpmB,EAAKf,KAAKe,KAAKqmB,QAAU7oB,EAAI6oB,UAC3DrmB,EAAKimB,aAAc,IAGhB,MAKfF,IACAvoB,EAAIwoB,SAAU,MAKE,QAApB9nB,KAAK6Y,YAA0C,SAAlB7Y,KAAKoY,UAClCpY,KAAKuZ,iBACLvZ,KAAKuZ,eAAewO,aAAc,GAGvB,cAAX3I,IAEA8G,GAAQ,GAGG,aAAX9G,EAAuB,CACvB,IAAMxa,EAAQpE,EAAkBA,EAAgBoE,KAAO,KACnDyjB,EAAY,KACZ7nB,aAA2BmE,MAC3B0jB,EAAY7nB,EAAgBO,KAAKyC,MAC5BhD,aAA2B2E,UAChCkjB,EAAY7nB,EAAgBO,KAAKe,MAGnB1B,KAAKwgB,SAAS,UACxByH,EAAYzjB,EAAKlD,MAAMlB,EAAgByE,WAAWvD,MAAM2mB,EAAUnjB,cAEtEmjB,EAAY,KAGZA,GAAa,iBAAkBA,EAAUhnB,aACzCgnB,EAAUhnB,WAAW4C,cAAgBokB,EAAUhnB,WAAW4C,aAE1DjE,KAAK6gB,0BAGL7gB,KAAK4Z,WACLsM,GAAQ,EACRC,GAAwB,GAIhC,IAAI1lB,GAAY,EAChB,GAAe,UAAX2e,EACA,GAAIpf,KAAKgZ,SAAU,CAOf,GALAhZ,KAAKgZ,UAAW,EAChBvY,GAAY,EAEZ0lB,GAAwB,EAEpBnmB,KAAK8Y,gBAAiB,CACtB,IAAIwP,EAAwB,GACxBC,EAAU9iB,KAAK+iB,IAAIxoB,KAAK8Y,gBAAgB2K,QACxCzjB,KAAK8Y,gBAAgB6K,OACrB8E,EAAQhjB,KAAKijB,IAAI1oB,KAAK8Y,gBAAgB2K,QACtCzjB,KAAK8Y,gBAAgB6K,OACrBgF,EAAUljB,KAAK+iB,IAAIxoB,KAAK8Y,gBAAgB4K,QACxC1jB,KAAK8Y,gBAAgB8K,OACrBgF,EAAQnjB,KAAKijB,IAAI1oB,KAAK8Y,gBAAgB4K,QACtC1jB,KAAK8Y,gBAAgB8K,OACrB7f,EAAI0kB,EAAQF,EACZvkB,EAAI4kB,EAAQD,EAChB3oB,KAAKqkB,4BAA4BkE,EAASI,EAAS5kB,EAAGC,GAClD,SAAC5D,EAAMS,EAAGvB,GACFA,EAAIupB,aAAaN,EAASI,EAAS5kB,EAAGC,IACtCskB,EAAsB9pB,KAAKc,MAEnCyf,EAAM8G,WAAa7lB,KAAKmZ,mBACxBmP,EAAsB3mB,SAAQ,SAAC4M,GACtB,EAAKiL,kBAAkB3F,SAAStF,IACjC,EAAKiL,kBAAkBhb,KAAK+P,MAE7BwQ,EAAM6G,UAAY5lB,KAAKmZ,mBAC9BmP,EAAsB3mB,SAAQ,SAAC4M,GACvB,EAAKiL,kBAAkB3F,SAAStF,KAChC,EAAKiL,kBACD,EAAKA,kBAAkBrM,QAAO,SAACgJ,GAE3B,OADAA,EAAI2P,UAAW,EACR3P,IAAQ5H,UAK/BvO,KAAKwZ,kBAAkB7X,SAAQ,SAAC4M,GAC5BA,EAAGuX,UAAW,KAElB9lB,KAAKwZ,kBAAoB8O,GAE7BtoB,KAAK8Y,gBAAkB,KACvBoN,GAAQ,EACRC,GAAwB,EACxBC,GAA0B,EAGN,SAApBpmB,KAAK6Y,YACL7Y,KAAK6gB,8BACN,CACH,GAAwB,QAApB7gB,KAAK6Y,YACD1B,EACAnX,KAAKoY,SAAU5X,EAAiBR,KAAKqY,aACrCrY,KAAKM,UACN,CACC,GAAsB,SAAlBN,KAAKoY,SACL,GAAIpY,KAAKuZ,eAAgB,CACrB,IAAI7G,EAAQ1S,KAAKuZ,eACjBvZ,KAAKuZ,oBAAiBpb,EACtB6B,KAAK8oB,kBACD9oB,KAAKoY,UACLsG,QAAuBle,IACvBke,QAAuBhM,SAG3B1S,KAAKuZ,eAAiB/Y,EACtBR,KAAKgd,4BAEgB,gBAAlBhd,KAAKoY,UACZpY,KAAKsZ,aAAetZ,KAAKM,SAEzBN,KAAK8oB,kBACD9oB,KAAKoY,SAAW,IAAMpY,KAAKqY,cAC3BqG,QAAuBle,MAG3BR,KAAKsZ,aAAetZ,KAAKM,SAEzBN,KAAK8oB,kBACD9oB,KAAKoY,UACLsG,QAAuBle,KAI1Bue,EAAM6G,SAA+B,SAAlB5lB,KAAKoY,UACLpY,KAAKuZ,gBAEzBvZ,KAAKgY,YAAYmD,UAKzB3a,EACIue,EAAM6G,SAGF5lB,KAAKwZ,kBAAkB3F,SAASrT,IAChCA,EAAgBslB,UAAW,EAC3B9lB,KAAKwZ,kBACDxZ,KAAKwZ,kBAAkBrM,QAAO,SAACoB,GAC3B,OAAOA,IAAO/N,MAGtBR,KAAKwZ,kBAAkBhb,KAAKgC,GAIhC4lB,GAA0B,GACnBrH,EAAM8G,WAOT7lB,KAAKwZ,kBAAkB/e,OAAS,IAChC2rB,GAA0B,GAE9BpmB,KAAKwZ,kBAAkB7X,SAAQ,SAAC4M,GAC5BA,EAAGuX,UAAW,KAElB9lB,KAAKwZ,kBAAoB,CAAChZ,KAO1BR,KAAKwZ,kBAAkB/e,OAAS,IAChC2rB,GAA0B,GAE9BpmB,KAAKwZ,kBAAkB7X,SAAQ,SAAC4M,GAC5BA,EAAGuX,UAAW,KAElB9lB,KAAKwZ,kBAAoB,IAE7B0M,GAAQ,EACRC,GAAwB,EAOhC,GAJAnmB,KAAKwZ,kBAAkB7X,SAAQ,SAAC4M,GAC5BA,EAAGuX,UAAW,KAGH,gBAAX1G,EACA,GAAuB,QAAnBpf,KAAK6Y,WAAsB,CAC3B,IAAIkQ,EAAoB,CAACvoB,GACrBR,KAAKwZ,kBAAkB3F,SAASrT,KAChCuoB,EAAoB/oB,KAAKwZ,mBAE7B,IAL2B,EAKvBwP,GAAgB,EAChBC,GAAqB,EANE,IAOZF,GAPY,IAO3B,2BAAkC,KAAzBxa,GAAyB,QAC1BsC,IAAWC,QAAqBvC,IACpC,GAAIA,MAAQA,cAAciY,OAAc3V,GAAU,CAG9C,GAAItC,cAActM,KAAM,CACpB,IAAK4O,GAASpJ,OACV,SAIJ,IADA,IAAIyhB,GAAa,IAAItuB,MAAM2T,GAAG9G,OAAOhN,QAC5B0uB,GAAI,EAAGA,GAAI5a,GAAG9G,OAAOhN,OAAS,EAAG0uB,KACtCD,GAAWC,IAAK,CACZ3Z,IAAMqB,GAASpJ,OAAO0hB,IAAG3Z,GACzBC,IAAMoB,GAASpJ,OAAO0hB,IAAG1Z,IAG7BoB,GAASpJ,OAAO0hB,IAAG3Z,GAAK,EACxBqB,GAASpJ,OAAO0hB,IAAG1Z,GAAK,EAI5BzP,KAAKqE,eAAe+b,kBAChB7R,GAAI,CAAE1K,EAAG,EAAGC,EAAG,GAAK,CAAED,EAAG,EAAGC,EAAG,GAAK9D,KAAK+B,MACzC/B,KAAK2O,UAAW3O,KAAK4O,uBACrBzQ,GAAW,GAAO,EAAO+qB,IAG7BF,GAAgB,MACb,CACH,IAAII,QAAK,EAAEC,QAAK,EAChB,IAAKxY,GAASrB,KAAOqB,GAASpB,GAC1B,SAIJ2Z,GAAQ7a,GAAG1K,EAAIgN,GAASrB,GACxB6Z,GAAQ9a,GAAGzK,EAAI+M,GAASpB,GAExBoB,GAASrB,GAAK,EACdqB,GAASpB,GAAK,EAGdzP,KAAKqE,eAAe+b,kBAChB7R,GAAI,CAAE1K,EAAG0K,GAAG1K,EAAGC,EAAGyK,GAAGzK,GACrB,CAAED,EAAGulB,GAAOtlB,EAAGulB,IAASrpB,KAAK+B,MAC7B/B,KAAK2O,UAAW3O,KAAK4O,uBACrBzQ,GAAW,GAAO,OAAOA,GAG7B6qB,GAAgB,EAGhBza,cAAc0C,YAEdJ,GAASK,SAAW,EACpBL,GAASM,SAAW,EAEf5C,GAAGxN,KAAKe,KAAKT,WAAW4C,eACzBglB,GAAqB,MAlEV,8BAuEvBA,GACAjpB,KAAK4Z,WAET5Z,KAAKgD,aAEDgmB,GACAhpB,KAAK6gB,8BAEiB,OAAnB7gB,KAAK6Y,YAEZ7Y,KAAKgY,YAAYmD,UAIzB,IAAImO,GAAUtD,EAAYjH,GACtBwK,GAAUtD,EAAYlH,GAoB1B,GAnBI/e,KAAKkZ,yBACLgN,GAASlmB,KAAKkZ,uBAAuBkG,EAAQL,EAAO,CAAElb,EAAGylB,GAASxlB,EAAGylB,IAAWhpB,EAC5EP,KAAMA,KAAKwZ,kBAAmB/Y,IAET,OAAzBT,KAAKF,kBACLomB,GAASlmB,KAAKF,gBAAgBoX,eAC1BkI,EACAL,EACA,CAAElb,EAAGylB,GAASxlB,EAAGylB,IACjBhpB,EACAC,EACAC,IAIJylB,GACAlmB,KAAKgD,aAGLmjB,EAGA,IACQjmB,QACAspB,oBACI,gCACA,CACIpD,wBAAyBA,IAGvC,MAAO3M,IAKb,OAAO,MAp5Df,KAo8DA,SAASkG,EAAc1c,EAAK2B,EAAM+J,EAAWC,EAAmBgK,GAC5D,IAAM6Q,EAAe,EAAIC,WAGnBloB,EAAI,IAAImoB,oBACdnoB,EAAEooB,SAAS,IACXpoB,EAAEqoB,qBAAoB,SAACC,EAAGloB,GAAQ,MAAO,MAGzCgD,EAAKlD,MAAMC,SAAQ,SAAC6B,GAChB,IAAIumB,EAAY,GAEhBA,EAAU5B,MAAQ3kB,EAAMsB,GACxB,IAAIklB,EAAU,KACVxmB,EAAMnC,WAAW4C,cACjB8lB,EAAUpmB,MAAQV,EAAIgnB,YAAYF,EAAU5B,OAAOxkB,MACnDomB,EAAU9iB,OAASyiB,aAGnBM,EAuEZ,SAAwB/mB,EAAKinB,EAAYtlB,EAAM+J,EAAWC,EAAmBgK,GAEzE,IAAMpX,EAAI,IAAImoB,oBAAqB,CAAEQ,YAAY,IAG3CC,EAAiB,CAAEC,QAAS,IAC9BH,EAAWxoB,MAAMjH,QAAU,MAC3B2vB,EAAeE,OAAS,gBAE5B9oB,EAAEooB,SAASQ,GAIX5oB,EAAEqoB,qBAAoB,SAACC,EAAGloB,GAAQ,MAAO,MAOzC,IAAI2oB,EAAiBL,EAAWM,YAAY,QACrBrsB,IAAnBosB,IACAA,EAAiB5uB,OAAO4G,KAAK2nB,EAAWxoB,QAC5C,IAAM+oB,EAAc,IAAI/K,IAClBgL,EAAe,IAAIC,IAEzB,SAASC,EAAY9oB,GACjB,GAAI8W,GAAkC,cAAb9W,EAAK1B,KAE1BsqB,EAAaG,IAAI/oB,EAAKgD,GAAGpF,WAAY,CAAEoC,KAAMA,EAAMiQ,IAAK,KAAM+Y,KAAM,SAFxE,CAMA,IAAIC,EAAW,KACfjpB,EAAKT,WAAW2pB,OAAS,GAGzBlpB,EAAKT,WAAW2pB,OAAOnZ,cAAgB/P,EAAKT,WAAWwQ,cACnD,iBAAkB/P,EAAKT,YAAcS,EAAKT,WAAW4C,cAA8B,eAAdnC,EAAK1B,KAC1E0B,EAAKT,WAAW2pB,OAAOxZ,gBAAiByZ,QAAoBf,EAAWxoB,MAAOI,GAAMT,WAAWmQ,eAE/F1P,EAAKT,WAAW2pB,OAAOxZ,eAAiB1P,EAAKT,WAAWmQ,eAE5D,IAAM0Z,EAhLd,SAA2BhB,EAAYpoB,EAAMmB,GACzC,IAAMkoB,EAAYloB,EAAIgnB,YAAYnoB,EAAKqmB,OAAOxkB,MACxCynB,EAAa,EAAI1B,WAAa/tB,OAAO4G,KAAKT,EAAKT,WAAW2pB,OAAOnZ,eAAepX,OAASivB,WACzF2B,EAAc,EAAI3B,WAAa/tB,OAAO4G,KAAKT,EAAKT,WAAW2pB,OAAOxZ,gBAAgB/W,OAASivB,WAC3F4B,EAAW7lB,KAAKijB,IAAIyC,EAAWC,EAAYC,GAC7CE,EAAY,EAAI7B,WAGdhI,EAAO,CAAE/d,MAAO2nB,EAAUrkB,OAFhCskB,GAAa,EAAI7B,YAiCjB,MA5BkB,eAAd5nB,EAAK1B,MACLshB,EAAKza,QAAU,EAAIyiB,WACnBhI,EAAK/d,OAAS+d,EAAKza,QAEdnF,EAAK1B,KAAKwgB,SAAS,UAInB9e,EAAK1B,KAAKwgB,SAAS,SAHxBc,EAAK/d,OAAS,EAAM+d,EAAKza,OACzBya,EAAKza,QAAU,MAMI,YAAdnF,EAAK1B,MAIS,gBAAd0B,EAAK1B,MAHVshB,EAAK/d,OAAgB+d,EAAKza,OAAS,EAArB,EACdya,EAAKza,QAAU,MAMI,WAAdnF,EAAK1B,OACVshB,EAAKza,QAAU,EAAIyiB,WACnBhI,EAAK/d,OAAS,EACd+d,EAAKza,OAASya,EAAK/d,MAAQ,GAKxB+d,EAyIc8J,CAAkBtB,EAAYpoB,EAAMmB,GAMrD,GALAnB,EAAKT,WAAW2pB,OAAOrnB,MAAQunB,EAASvnB,MACxC7B,EAAKT,WAAW2pB,OAAO/jB,OAASikB,EAASjkB,OACzCnF,EAAKT,WAAW2pB,OAAO7C,MAAQrmB,EAAKqmB,MAGlB,eAAdrmB,EAAK1B,KAAuB,CAE5B,IAAMqrB,EAAW1kB,EADjBgkB,EAAWpL,EAAc1c,EAAKnB,EAAKT,WAAWuD,KAAM+J,EAAWC,EAAmBgK,IAElF9W,EAAKT,WAAW2pB,OAAOrnB,MAAQ8nB,EAAS9nB,MAAQ,EAAI+lB,WACpD5nB,EAAKT,WAAW2pB,OAAO/jB,OAASwkB,EAASxkB,OAAS,EAAIyiB,WAI1D,IAAMpqB,EAAM,IAAIosB,KAAa5pB,EAAK1B,MAAM,CAAE0B,KAAMA,EAAMC,MAAOgpB,GAAYjpB,EAAKgD,GAAIF,EAAMslB,EAAWplB,IAIjF,eAAdhD,EAAK1B,OACLwO,EAAkB9M,EAAKT,WAAWuD,KAAKC,cAAgBvF,GAG3D,IAvCuB,EAuCnB5E,EAAI,EAvCe,IAyCnBE,MAAMgD,QAAQkE,EAAKT,WAAW2pB,OAAOnZ,eAC7B/P,EAAKT,WAAW2pB,OAAOnZ,cAEvBlW,OAAO4G,KAAKT,EAAKT,WAAW2pB,OAAOnZ,gBA5CxB,IA6CvB,2BAA2B,KAAhB8Z,EAAgB,QACjBC,EAAO,IAAIpF,KAAU,CAAE7mB,KAAMgsB,GAASjxB,EAAGkK,EAAM9C,EAAKgD,IAC1DxF,EAAIuS,cAAcrT,KAAKotB,GACvBlxB,GAAK,GAhDc,8BAoDvBA,EAAI,EApDmB,UAqDnBE,MAAMgD,QAAQkE,EAAKT,WAAW2pB,OAAOxZ,gBAC7B1P,EAAKT,WAAW2pB,OAAOxZ,eAEvB7V,OAAO4G,KAAKT,EAAKT,WAAW2pB,OAAOxZ,iBAxDxB,IAyDvB,2BAA2B,KAAhBma,EAAgB,QACjBC,EAAO,IAAIpF,KAAU,CAAE7mB,KAAMgsB,GAASjxB,EAAGkK,EAAM9C,EAAKgD,IAC1DxF,EAAIkS,eAAehT,KAAKotB,GACxBlxB,GAAK,GA5Dc,8BAmEvB,GAJA8G,EAAEqqB,QAAQ/pB,EAAKgD,GAAIxF,GACnBmrB,EAAYnQ,IAAIxY,EAAKgD,GAAGpF,YAGpBoC,EAAKgD,MAAMolB,EAAWM,WAAY,CAClC,GAAI1oB,EAAKT,WAAW4C,aAChB,OACJimB,EAAWM,WAAW1oB,EAAKgD,IAAInD,SAAQ,SAACmqB,GAEpClB,EADaV,EAAWxoB,MAAMoqB,SAyM1C,OAlMAvB,EAAe5oB,SAAQ,SAACmqB,GAEpBlB,EADaV,EAAWxoB,MAAMoqB,OA+BlC5B,EAAWloB,MAAML,SAAQ,SAACV,EAAM6D,GAC5B,IA3BJ,SAAiC7D,GAC7B,IAAM8qB,EAAarB,EAAapuB,IAAI2E,EAAK8Q,KACnCia,EAAatB,EAAapuB,IAAI2E,EAAK2Q,KAEzC,GAAIma,GAAcC,EAEdD,EAAWjB,KAAOkB,EAAWlB,KAC7B7pB,EAAKI,WAAWN,KAAKM,WAAW4qB,UAAW,MACxC,IAAIF,EAIP,OAFAA,EAAWjB,KAAKtsB,KAAKyC,GACrBA,EAAKI,WAAWN,KAAKM,WAAW4qB,UAAW,GACpC,EACJ,GAAID,EAIP,OAFAA,EAAWja,IAAM9Q,EACjBA,EAAKI,WAAWN,KAAKM,WAAW4qB,UAAW,GACpC,EAIX,QAAKrT,IAAqB3X,EAAKI,WAAWN,KAAKM,WAAW4qB,UAMtDC,CAAwBjrB,KAC5BA,GAAOkrB,QAAwBlrB,EAAMwpB,EAAaP,IAClD,CACA,IAAMrpB,EAAI,IAAIoB,KAAKhB,EAAKI,WAAWN,KAAM+D,EAAIF,EAAMslB,EAAWplB,IAC9D7D,EAAKI,WAAWN,KAAKE,KAAOJ,EAC5BA,EAAE0Q,cAAgBtQ,EAAKsQ,cACvB1Q,EAAE6Q,cAAgBzQ,EAAKyQ,cACvBlQ,EAAE4qB,QAAQnrB,EAAK8Q,IAAK9Q,EAAK2Q,IAAK/Q,EAAGiE,OAGrC4lB,EAAa/oB,SAAQ,SAAA0qB,GACbA,EAAYta,KACZsa,EAAYvB,KAAKnpB,SAAQ,SAAAd,GAErB,IAAMyrB,EAAWzrB,EAAEQ,WAAWN,KAAKE,KACnCJ,EAAEQ,WAAWN,KAAKE,KAAO,KACzB,IAAMsrB,GAAaC,QAAS3rB,GAC5BA,EAAEQ,WAAWN,KAAKE,KAAOqrB,EACzBC,EAAWxa,IAAMsa,EAAYta,IAAIA,IACjCwa,EAAWhb,cAAgB8a,EAAYta,IAAIR,cAC3Cgb,EAAW7a,cAAgB7Q,EAAE6Q,cAE7B6a,EAAWlrB,WAAWN,KAAKM,WAAW4qB,UAAW,EAGjD,IAAMQ,GAAeN,QAAwBI,EAAY9B,EAAaP,GACtE,GAAKuC,EAAL,CAGA,IAjB0B,MAiBZjrB,EAAE6N,SAASod,EAAa1a,MAjBZ,IAkB1B,2BAAwB,KAAb2a,EAAa,QACpB,GAAIA,EAAG3oB,GAAKlD,EAAE+Q,KAAOsY,EAAWloB,MAAM0qB,EAAG/sB,MAAM+R,eAAiB7Q,EAAE6Q,cAC9D,QApBkB,8BAyB1BwY,EAAWloB,MAAMxD,KAAK+tB,GAGtB,IAAMjd,EAAU4a,EAAWloB,MAAMvH,OAAS,EACpCkyB,EAAgB,IAAI1qB,MAAKuqB,QAASC,EAAaprB,WAAWN,MAAOuO,EAAS1K,EAAMslB,EAAWplB,IACjG6nB,EAAcpb,cAAgBkb,EAAalb,cAC3Cob,EAAcjb,cAAgB+a,EAAa/a,cAC3Cib,EAAc5rB,KAAKM,WAAW4qB,UAAW,EAEzCzqB,EAAE4qB,QAAQK,EAAa1a,IAAK0a,EAAa7a,IAAK+a,EAAerd,UAKzEqa,WAAanoB,GAIb0oB,EAAWxoB,MAAMC,SAAQ,SAACG,EAAMgD,GAC5B,IAAM8nB,EAAQprB,EAAEM,KAAKgD,GACrB,GAAK8nB,KAAUhU,GAAqBgU,aAAiB1E,YAArD,CAIA,IAAM3gB,EAAUqlB,EAAMrlB,UAGJ,eAAdzF,EAAK1B,OAELysB,QAAY/qB,EAAKT,WAAWuD,KAAMgoB,EAAM7rB,KAAKgB,MAAO,CAChD8B,EAAG0D,EAAQ1D,EAAI6lB,WACf5lB,EAAGyD,EAAQzD,EAAI4lB,aAIvB,IAjBmC,EAiB7BoD,EAAUpD,WACVqD,GAAgBrD,WAAaoD,GAAWnxB,OAAO4G,KAAKT,EAAKT,WAAW2pB,OAAOnZ,eAAepX,OAASqyB,EACnGE,GAAgBtD,WAAaoD,GAAWnxB,OAAO4G,KAAKT,EAAKT,WAAW2pB,OAAOxZ,gBAAgB/W,OAASqyB,EACtGG,EAAUL,EAAM/oB,EAAIkpB,EAAe,EAAMrD,WAAa,EACtDwD,EAAUN,EAAM/oB,EAAImpB,EAAe,EAAMtD,WAAa,EArBvB,IAuBnBkD,EAAM/a,eAvBa,IAuBnC,2BAAqC,KAA1BxI,EAA0B,QACjCA,EAAE1F,MAAQ+lB,WACVrgB,EAAEpC,OAASyiB,WACXrgB,EAAExF,EAAIopB,EACNA,GAAWvD,WAAaoD,EACxBzjB,EAAEvF,EAAIyD,EAAQzD,GA5BiB,wCA8BnB8oB,EAAMpb,gBA9Ba,IA8BnC,2BAAsC,KAA3BnI,EAA2B,QAClCA,EAAE1F,MAAQ+lB,WACVrgB,EAAEpC,OAASyiB,WACXrgB,EAAExF,EAAIqpB,EACNA,GAAWxD,WAAaoD,EACxBzjB,EAAEvF,EAAIyD,EAAQzD,EAAI8oB,EAAM3lB,QAnCO,mCAuCvCijB,EAAWloB,MAAML,SAAQ,SAACV,EAAM6D,GAE5B,GADA7D,GAAOkrB,QAAwBlrB,EAAMwpB,EAAaP,GAClD,CACA,IAAMiD,EAAQ3rB,EAAEP,KAAKA,EAAK8Q,IAAK9Q,EAAK2Q,IAAK9M,GACzC,MAAKqoB,GAAUvU,IAAwD,IAAnCuU,EAAMpsB,KAAKM,WAAW4qB,WAClDrT,GAAqBuU,EAAMpsB,KAAKM,WAAW4qB,UADnD,CAOA,IAAImB,EAAW,KAAMC,EAAW,KAChC,GAAIpsB,EAAKsQ,cAAe,CAGpB,IAFA,IAAM+b,EAAW9rB,EAAEM,KAAKb,EAAK8Q,KACzBwb,GAAU,EACL7yB,EAAI,EAAGA,EAAI4yB,EAAS9b,eAAe/W,OAAQC,IAChD,GAAI4yB,EAAS9b,eAAe9W,GAAGqG,KAAKpB,MAAQsB,EAAKsQ,cAAe,CAC5Dgc,EAAS7yB,EACT,MAGJ6yB,GAAU,IACVJ,EAAM1lB,OAAO,GAAG5D,EAAIypB,EAAS9b,eAAe+b,GAAQ1pB,EACpDspB,EAAM1lB,OAAO,GAAG3D,EAAIwpB,EAAS9b,eAAe+b,GAAQzpB,EACpDspB,EAAWE,EAAS9b,eAAe+b,IAG3C,GAAItsB,EAAKyQ,cAAe,CAGpB,IAFA,IAAM8b,EAAWhsB,EAAEM,KAAKb,EAAK2Q,KACzB2b,GAAU,EACL7yB,EAAI,EAAGA,EAAI8yB,EAAS3b,cAAcpX,OAAQC,IAC/C,GAAI8yB,EAAS3b,cAAcnX,GAAGqG,KAAKpB,MAAQsB,EAAKyQ,cAAe,CAC3D6b,EAAS7yB,EACT,MAGJ6yB,GAAU,IACVJ,EAAM1lB,OAAO0lB,EAAM1lB,OAAOhN,OAAS,GAAGoJ,EAAI2pB,EAAS3b,cAAc0b,GAAQ1pB,EACzEspB,EAAM1lB,OAAO0lB,EAAM1lB,OAAOhN,OAAS,GAAGqJ,EAAI0pB,EAAS3b,cAAc0b,GAAQzpB,EACzEupB,EAAWG,EAAS3b,cAAc0b,IAI1C,IAAM9tB,EAAI0tB,EAAM1lB,OAAOhN,OAAS,EACf,OAAb2yB,IACAD,EAAM1lB,OAAO,IAAKgK,mBAAc2b,EAAUD,EAAM1lB,OAAOhI,KAC1C,OAAb4tB,IACAF,EAAM1lB,OAAOhI,IAAKgS,mBAAc4b,EAAUF,EAAM1lB,OAAO,KAEhC,GAAvB0lB,EAAM1lB,OAAOhN,QAAe0yB,EAAM1lB,OAAO,GAAG5D,GAAKspB,EAAM1lB,OAAOhI,GAAGoE,IACjEspB,EAAM1lB,OAAS,CAAC0lB,EAAM1lB,OAAO,GAAI0lB,EAAM1lB,OAAOhI,KAElD,IAAMuH,EAAKQ,EAAyB2lB,GAEpCnmB,EAAGnD,GAAKmD,EAAGrD,MAAQ,EACnBqD,EAAGlD,GAAKkD,EAAGC,OAAS,EAEpBhG,EAAK0C,MAAQqD,EAAGrD,MAChB1C,EAAKgG,OAASD,EAAGC,OACjBhG,EAAK4C,EAAImD,EAAGnD,EACZ5C,EAAK6C,EAAIkD,EAAGlD,EACZqpB,EAAMxpB,MAAQqD,EAAGrD,MACjBwpB,EAAMlmB,OAASD,EAAGC,OAClBkmB,EAAMtpB,EAAImD,EAAGnD,EACbspB,EAAMrpB,EAAIkD,EAAGlD,OAGVtC,EAjXWisB,CAAexqB,EAAKO,EAAOoB,EAAM+J,EACvCC,EAAmBgK,GACvBmR,EAAYhjB,EAAqBijB,IAErCD,EAAUpmB,OAAS,EAAI8lB,EACvBM,EAAU9iB,QAAU,EAAIwiB,EACxBjoB,EAAEqqB,QAAQroB,EAAMsB,GAAI,IAAIH,MAAM,CAC1BnB,MAAOA,EACPwnB,OAAQjB,EACRhoB,MAAOioB,GACRxmB,EAAMsB,GAAIF,OAGjBA,EAAK5C,MAAML,SAAQ,SAACV,EAAM6D,GACtBtD,EAAE4qB,QAAQnrB,EAAK8Q,IAAK9Q,EAAK2Q,IAAK,IAAI3P,KAAKhB,EAAKI,WAAWN,KAAM+D,EAAIF,OAGrE+kB,WAAanoB,GAGboD,EAAKlD,MAAMC,SAAQ,SAAC6B,GAChB,IAAMopB,EAAQprB,EAAEM,KAAK0B,EAAMsB,IAC3BtB,EAAMnC,WAAW2pB,OAAS,GAC1BxnB,EAAMnC,WAAW2pB,OAAOnnB,EAAI+oB,EAAM/oB,EAClCL,EAAMnC,WAAW2pB,OAAOlnB,EAAI8oB,EAAM9oB,EAClCN,EAAMnC,WAAW2pB,OAAOrnB,MAAQipB,EAAMjpB,MACtCH,EAAMnC,WAAW2pB,OAAO/jB,OAAS2lB,EAAM3lB,UAG3CrC,EAAK5C,MAAML,SAAQ,SAACV,GAChB,IAAMksB,EAAQ3rB,EAAEP,KAAKA,EAAK8Q,IAAK9Q,EAAK2Q,KAC9B5K,EAAKQ,EAAyB2lB,GAEpCnmB,EAAGnD,GAAKmD,EAAGrD,MAAQ,EACnBqD,EAAGlD,GAAKkD,EAAGC,OAAS,EAEpBkmB,EAAMtpB,EAAImD,EAAGnD,EACbspB,EAAMrpB,EAAIkD,EAAGlD,EACbqpB,EAAMxpB,MAAQqD,EAAGrD,MACjBwpB,EAAMlmB,OAASD,EAAGC,OAClBhG,EAAKI,WAAW2pB,OAAS,GACzB/pB,EAAKI,WAAW2pB,OAAOrnB,MAAQqD,EAAGrD,MAClC1C,EAAKI,WAAW2pB,OAAO/jB,OAASD,EAAGC,OACnChG,EAAKI,WAAW2pB,OAAOnnB,EAAImD,EAAGnD,EAC9B5C,EAAKI,WAAW2pB,OAAOlnB,EAAIkD,EAAGlD,EAC9B7C,EAAKI,WAAW2pB,OAAOvjB,OAAS0lB,EAAM1lB,UAI1C7C,EAAKlD,MAAMC,SAAQ,SAACgS,EAAG+Z,GACnB,IAAI/Z,EAAEtS,WAAW4C,aAAjB,CAGA,IAAMT,EAAQhC,EAAEM,KAAK4rB,GACfnmB,EAAU/D,EAAM+D,WACtBomB,QAAaha,EAAGnQ,EAAO,CACnBK,EAAG0D,EAAQ1D,EAAI4lB,EACf3lB,EAAGyD,EAAQzD,EAAI2lB,QAIvB,IAAMziB,EAAKD,EAAqBvF,GAOhC,OANAA,EAAEmC,MAAQqD,EAAGrD,MACbnC,EAAEyF,OAASD,EAAGC,OAGd0H,EAAU/J,EAAKC,cAAgBrD,EAExBA,I,mpBCvkEJ,IAAMosB,EAAb,WAEI,WAAYC,EAAMC,EAASlpB,GAAwB,IAAlBK,EAAkB,uDAAN,MAAM,eAC/CjF,KAAKe,KAAO8sB,EACZ7tB,KAAK8E,GAAKgpB,EACV9tB,KAAKiF,UAAYA,EACjBjF,KAAK4E,KAAOA,EACZ5E,KAAK6R,cAAgB,GACrB7R,KAAKwR,eAAiB,GAGtBxR,KAAK8lB,UAAW,EAChB9lB,KAAK+nB,aAAc,EACnB/nB,KAAK8nB,SAAU,EAEf9nB,KAAK+tB,aAfb,yCAkBI,WAEI/tB,KAAK2D,MAAQ3D,KAAKe,KAAKiqB,OAAOrnB,MAC9B3D,KAAKiH,OAASjH,KAAKe,KAAKiqB,OAAO/jB,SArBvC,kBAwBI,SAAKlH,EAAUkD,EAAK3C,MAxBxB,mBA0BI,SAAMP,EAAUkD,EAAKE,MA1BzB,wBA4BI,SAAWpD,EAAUkD,GACblD,EAASwX,aAETtU,EAAIigB,YACJjgB,EAAIkgB,IAAInjB,KAAK6D,EAAG7D,KAAK8D,EAAG,EAAG,EAAG,EAAI2B,KAAKiF,IAAI,GAC3CzH,EAAI+P,UAAY,MAChB/P,EAAImgB,OACJngB,EAAI+f,YAAc,MAClB/f,EAAIggB,SACJhgB,EAAI+qB,WAAWhuB,KAAK6D,EAAK7D,KAAK2D,MAAQ,EAAM3D,KAAK8D,EAAK9D,KAAKiH,OAAS,EAChEjH,KAAK2D,MAAO3D,KAAKiH,WAtCjC,wBA0CI,WACI,OAAOjH,KAAKe,KAAKM,aA3CzB,kBA8CI,WACI,OAAOrB,KAAKe,KAAKX,OA/CzB,mBAkDI,WACI,OAAOJ,KAAKe,KAAKonB,QAnDzB,wBAsDI,WACI,OAAOnoB,KAAKmoB,UAvDpB,qBA2DI,SAAQ7Q,GACJA,EAAU4D,UAAY,gBA5D9B,qBA+DI,WACI,MAAO,CAAErX,EAAG7D,KAAK6D,EAAI7D,KAAK2D,MAAQ,EAAGG,EAAG9D,KAAK8D,EAAI9D,KAAKiH,OAAS,KAhEvE,yBAmEI,WAAkC,IAAtBlH,EAAsB,4DAAX5B,EACnB,OAAI6B,KAAK8lB,SACD9lB,KAAK8nB,QACE9nB,KAAKiuB,eAAeluB,EAAU,4BAChCC,KAAK+nB,YACH/nB,KAAKiuB,eAAeluB,EAAU,gCAE9BC,KAAKiuB,eAAeluB,EAAU,oBAErCC,KAAK8nB,QACE9nB,KAAKiuB,eAAeluB,EAAU,mBAChCC,KAAK+nB,YACH/nB,KAAKiuB,eAAeluB,EAAU,uBAEtCC,KAAKiuB,eAAeluB,EAAU,qBAjF7C,uBAqFI,SAAU8D,EAAGC,GAAiB,IAAdC,EAAc,uDAAV,EAAGC,EAAO,uDAAH,EACvB,OAAS,GAALD,GAAe,GAALC,EACFH,GAAK7D,KAAK6D,EAAI7D,KAAK2D,MAAQ,GAC9BE,GAAK7D,KAAK6D,EAAI7D,KAAK2D,MAAQ,GAC3BG,GAAK9D,KAAK8D,EAAI9D,KAAKiH,OAAS,GAC5BnD,GAAK9D,KAAK8D,EAAI9D,KAAKiH,OAAS,EAEzBpD,GAAK7D,KAAK6D,EAAI7D,KAAK2D,MAAQ,GAC9BE,EAAIE,GAAK/D,KAAK6D,EAAI7D,KAAK2D,MAAQ,GAC/BG,GAAK9D,KAAK8D,EAAI9D,KAAKiH,OAAS,GAC5BnD,EAAIE,GAAKhE,KAAK8D,EAAI9D,KAAKiH,OAAS,IA/FjD,0BAmGI,SAAapD,EAAGC,GAAiB,IAAdC,EAAc,uDAAV,EAAGC,EAAO,uDAAH,EAC1B,GAAU,IAAND,GAAiB,IAANC,EACX,OAAO,EAEX,IAAMkqB,EAAcrqB,EACdsqB,EAAYtqB,EAAIE,EAChBqqB,EAActqB,EACduqB,EAAYvqB,EAAIE,EAEhBsqB,EAAatuB,KAAK6D,EAAK7D,KAAK2D,MAAQ,EACpC4qB,EAAWvuB,KAAK6D,EAAK7D,KAAK2D,MAAQ,EAClC6qB,EAAaxuB,KAAK8D,EAAK9D,KAAKiH,OAAS,EACrCwnB,EAAWzuB,KAAK8D,EAAK9D,KAAKiH,OAAS,EAEzC,OAAOinB,GAAeI,GAClBH,GAAaI,GACbH,GAAeI,GACfH,GAAaI,IApHzB,4BAuHI,SAAe1uB,EAAU2uB,GACrB,OAAOpb,OAAO+K,iBAAiBte,EAAS8H,QAAQ8mB,iBAAiBD,GAAcE,WAxHvF,KA6HaC,EAAb,oCACI,WAAYjqB,GAAM,kCACRA,GAAO,EAAGA,GAFxB,yCAKI,cALJ,mBAQI,WACI,OAAO5E,KAAKe,KAAKM,WAAW1B,SATpC,GAA0BiuB,GAabjpB,EAAb,kIACI,SAAK5E,EAAUkD,EAAK3C,GAChB,IAAMiH,EAAUvH,KAAKuH,UACfhE,EAAexD,EAASwD,aAC1BurB,EAAU,CACVjrB,EAAG4B,KAAKijB,IAAInhB,EAAQ1D,EAAGN,EAAaM,GACpCC,EAAG2B,KAAKijB,IAAInhB,EAAQzD,EAAGP,EAAaO,GACpCuD,GAAI5B,KAAK+iB,IAAIjhB,EAAQ1D,EAAI7D,KAAK2D,MAC1BJ,EAAaM,EAAIN,EAAaQ,GAClCuD,GAAI7B,KAAK+iB,IAAIjhB,EAAQzD,EAAI9D,KAAKiH,OAC1B1D,EAAaO,EAAIP,EAAaS,IAEtC8qB,EAAQ/qB,EAAI+qB,EAAQznB,GAAKynB,EAAQjrB,EACjCirB,EAAQ9qB,EAAI8qB,EAAQxnB,GAAKwnB,EAAQhrB,EAC5Bb,EAAIQ,MACLqrB,EAAU,CACNjrB,EAAG0D,EAAQ1D,EAAGC,EAAGyD,EAAQzD,EACzBC,EAAG/D,KAAK2D,MAAOK,EAAGhE,KAAKiH,SAG/BhE,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,4BAC9CkD,EAAIgQ,SAAS6b,EAAQjrB,EAAGirB,EAAQhrB,EAAGgrB,EAAQ/qB,EAAG+qB,EAAQ9qB,GACtDf,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,4BAE1CwD,EAAaM,GAAK0D,EAAQ1D,GAAKN,EAAaO,GAAKyD,EAAQzD,EAAI4lB,YAC7DzmB,EAAI8rB,SAAS/uB,KAAKmoB,QAAS5gB,EAAQ1D,EAAG0D,EAAQzD,EAAI4lB,cAGjD1pB,KAAK8lB,UAAY9lB,KAAK+nB,aAAe/nB,KAAK8nB,UAC1CgH,EAAQjrB,IAAM0D,EAAQ1D,GACnBirB,EAAQhrB,IAAMyD,EAAQzD,GACtBgrB,EAAQznB,KAAOE,EAAQ1D,EAAI7D,KAAK2D,OAChCmrB,EAAQxnB,KAAOC,EAAQzD,EAAI9D,KAAKiH,SACpChE,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GACnCkD,EAAI+qB,WAAWc,EAAQjrB,EAAGirB,EAAQhrB,EAAGgrB,EAAQ/qB,EAAG+qB,EAAQ9qB,IAIxDhE,KAAKe,KAAKyC,MAAMnC,WAAW4C,eAC3BhB,EAAIigB,YACJjgB,EAAI6f,OAAO9iB,KAAK6D,EAAG7D,KAAK8D,EAAI4lB,YAC5BzmB,EAAI8f,OAAO/iB,KAAK6D,EAAG7D,KAAK8D,EAAI4lB,YAC5BzmB,EAAIggB,SACJhgB,EAAIigB,YACJjgB,EAAI6f,OAAO9iB,KAAK6D,EAAI6lB,WAAY1pB,KAAK8D,GACrCb,EAAI8f,OAAO/iB,KAAK6D,EAAI6lB,WAAY1pB,KAAK8D,GACrCb,EAAIggB,UAGRhgB,EAAI+f,YAAc,UAjD1B,yBAoDI,SAAYjjB,EAAUkD,EAAK3C,GAAU,WAE3BiH,EAAUvH,KAAKuH,UAErBtE,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,4BAC9CkD,EAAIgQ,SAAS1L,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACpDhE,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,sBAE1CO,GAAYN,KAAK4D,UAAUtD,EAASuD,EAAGvD,EAASwD,KAChD/D,EAASgG,QAAU,SAACsD,GAAD,OAAO,EAAKtD,QAAQsD,OA7DnD,mBA6EI,SAAMtJ,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAE1BC,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEhB,IAAMoE,EAAUvH,KAAKuH,UACrBtE,EAAIgQ,SAAS1L,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QAGpDhE,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,IA1F1B,qBA6FI,SAAQ5X,GACJA,EAAUrR,UAAY,UAAYjG,KAAKmoB,UA9F/C,wBAiGI,WACI,OAAOnoB,KAAKe,KAAKyC,MAAMnC,aAlG/B,mBAqGI,WACI,OAAOrB,KAAKe,KAAKyC,MAAM2kB,QAtG/B,kBAyGI,WACI,OAAOnoB,KAAKe,KAAKyC,MAAMpD,SA1G/B,GAA2BwtB,GA8GdzoB,EAAb,kIACI,SAAKpF,EAAUkD,EAAK3C,GAAoF,IAA1E8uB,EAA0E,uDAAhE,0BAA2BC,EAAqC,uDAA3B,0BACnE9nB,EAAUvH,KAAKuH,UACrBtE,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAUsvB,GAC9CpsB,EAAIgQ,SAAS1L,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACpDhE,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GACnCkD,EAAI+qB,WAAWzmB,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACtDhE,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAUqvB,GAC9C,IAAME,EAAQrsB,EAAIgnB,YAAYjqB,KAAKmoB,SAASxkB,MAC5CV,EAAI8rB,SAAS/uB,KAAKmoB,QAASnoB,KAAK6D,EAAIyrB,EAAQ,EAAGtvB,KAAK8D,EAAI4lB,WAAa,KAT7E,yBAYI,SAAY3pB,EAAUkD,EAAK3C,GAEvB,IAAMiH,EAAUvH,KAAKuH,UACrBtE,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC9CkD,EAAIgQ,SAAS1L,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACpDhE,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,6BAjBtD,mBAoBI,SAAMA,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAE1BC,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEhB,IAAMoE,EAAUvH,KAAKuH,UACrBtE,EAAIgQ,SAAS1L,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QAGpDhE,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,IAjC1B,mBAoCI,WACI,OAAOlvB,KAAKe,KAAKe,KAAKqmB,QArC9B,wBAwCI,WACI,OAAOnoB,KAAKe,KAAKe,KAAKT,aAzC9B,kBA4CI,WACI,OAAOrB,KAAKe,KAAKe,KAAK1B,OA7C9B,wBAgDI,WACIJ,KAAK2D,MAAQ3D,KAAKe,KAAKe,KAAKT,WAAW2pB,OAAOrnB,MAC9C3D,KAAKiH,OAASjH,KAAKe,KAAKe,KAAKT,WAAW2pB,OAAO/jB,WAlDvD,GAA8B2mB,GAsDjB3rB,EAAb,+IAEI,SAAkBgB,GAGd,GAFAA,EAAIigB,YACJjgB,EAAI6f,OAAO9iB,KAAKyH,OAAO,GAAG5D,EAAG7D,KAAKyH,OAAO,GAAG3D,GACjB,IAAvB9D,KAAKyH,OAAOhN,OAEZwI,EAAI8f,OAAO/iB,KAAKyH,OAAO,GAAG5D,EAAG7D,KAAKyH,OAAO,GAAG3D,OACzC,CACH,IAAIpJ,EACJ,IAAKA,EAAI,EAAGA,EAAIsF,KAAKyH,OAAOhN,OAAS,EAAGC,IAAK,CACzC,IAAM60B,GAAMvvB,KAAKyH,OAAO/M,GAAGmJ,EAAI7D,KAAKyH,OAAO/M,EAAI,GAAGmJ,GAAK,EACjD2rB,GAAMxvB,KAAKyH,OAAO/M,GAAGoJ,EAAI9D,KAAKyH,OAAO/M,EAAI,GAAGoJ,GAAK,EACvDb,EAAIwsB,iBAAiBzvB,KAAKyH,OAAO/M,GAAGmJ,EAAG7D,KAAKyH,OAAO/M,GAAGoJ,EAAGyrB,EAAIC,GAEjEvsB,EAAIwsB,iBAAiBzvB,KAAKyH,OAAO/M,GAAGmJ,EAAG7D,KAAKyH,OAAO/M,GAAGoJ,EAClD9D,KAAKyH,OAAO/M,EAAI,GAAGmJ,EAAG7D,KAAKyH,OAAO/M,EAAI,GAAGoJ,MAhBzD,kBAoBI,SAAK/D,EAAUkD,EAAK3C,GAAU,WACpBW,EAAOjB,KAEbA,KAAK0vB,kBAAkBzsB,GAEvB,IAAIoS,EAAQrV,KAAKgjB,YAAYjjB,GAkB7B,GAjBIC,KAAK8nB,UACL/nB,EAASgG,QAAU,SAACsD,GAAD,OAAO,EAAKtD,QAAQsD,EAAGtJ,KACxB,MAAlBC,KAAKiF,WAAqBoQ,IAAUrV,KAAKiuB,eAAeluB,EAAU,qBAClEsV,EAAQrV,KAAKiuB,eAAeluB,EAAU,4BAE1CkD,EAAI+P,UAAY/P,EAAI+f,YAAc3N,EAGZ,MAAlBrV,KAAKiF,WAAiD,MAA5BjF,KAAKe,KAAKM,WAAWsuB,IAC/C1sB,EAAI2sB,YAAY,CAAC,EAAG,IAEpB3sB,EAAI2sB,YAAY,CAAC,EAAG,IAExB3sB,EAAIggB,SAEJhgB,EAAI2sB,YAAY,CAAC,EAAG,MAEhB3uB,EAAKwG,OAAOhN,OAAS,GAAzB,CAMI,IAAIC,EADR,GAAIsF,KAAK8lB,UAAoC,SAAxB/lB,EAAS8Y,WAE1B,IAAKne,EAAI,EAAGA,EAAIsF,KAAKyH,OAAOhN,OAAS,EAAGC,IACpCuI,EAAI+qB,WAAWhuB,KAAKyH,OAAO/M,GAAGmJ,EAAI,EAAG7D,KAAKyH,OAAO/M,GAAGoJ,EAAI,EAAG,EAAG,GAGtE+rB,EAAU5sB,EAAKhC,EAAKwG,OAAOxG,EAAKwG,OAAOhN,OAAS,GAAIwG,EAAKwG,OAAOxG,EAAKwG,OAAOhN,OAAS,GAAI,MAtDjG,mBAyDI,SAAMsF,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAChChvB,KAAK0vB,kBAAkBzsB,GAGvB,IAAM6sB,EAAoB7sB,EAAI+f,YACxBiM,EAAkBhsB,EAAI+P,UACtB+c,EAAgB9sB,EAAI+sB,QACpBC,EAAkBhtB,EAAIugB,UACtB0L,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAIugB,UAAYyM,EAAkB,EAClChtB,EAAI+P,UAAY7P,EAChBF,EAAI+f,YAAc7f,EAClBF,EAAI+sB,QAAU,QAEd/sB,EAAIggB,SAEAjjB,KAAKyH,OAAOhN,OAAS,IAEzBo1B,EAAU5sB,EAAKjD,KAAKyH,OAAOzH,KAAKyH,OAAOhN,OAAS,GAC5CuF,KAAKyH,OAAOzH,KAAKyH,OAAOhN,OAAS,GAAI,EAAG,EAAG,GAG/CwI,EAAI+f,YAAc8M,EAClB7sB,EAAI+P,UAAYic,EAChBhsB,EAAI+sB,QAAUD,EACd9sB,EAAIugB,UAAYyM,EAChBhtB,EAAIksB,YAAcD,KArF1B,qBAwFI,SAAQ5X,EAAWvX,IACf,sDAAcuX,GACd,IAAM4Y,EAAYnwB,EAASowB,gBACrBC,EAAOpwB,KAAKqB,aAElB,QAAoBlD,IAAhBiyB,EAAKC,OAAsB,CAC3B,GAAoB,OAAhBD,EAAKC,OAEL,YADA/Y,EAAUjC,MAAMC,QAAU,QAG9B,IAAI0L,EAAWoP,EAAKrvB,KACpBigB,IAAYsP,QAAwBF,EAAKC,OAAQH,GAE7CE,EAAKG,eACLvP,GAAY,QAASsP,QAAwBF,EAAKG,aAAcL,IAEhEE,EAAKT,MACL3O,GAAY,iBAAkBsP,QAAwBF,EAAKT,IAAKO,GAAa,QAEjF,IAAIM,EAAe,KAEfA,EADAJ,EAAKpvB,QACUsvB,QAAwBF,EAAKpvB,OAAQkvB,IAErCI,QAAwBF,EAAKI,aAAcN,GAE1DE,EAAKK,QAEDD,EADgB,GAAhBA,IAAsC,GAAjBA,EACN,6BAEA,yBAA2BA,EAAe,KACrC,GAAjBA,IACPA,EAAe,8BAGnBxP,GAAY,+CAAiDwP,EAAe,UAC5ElZ,EAAUzB,UAAYmL,OAEtB1J,EAAU+C,UAAUC,IAAI,gCACxBhD,EAAUrR,UAAYjG,KAAKmoB,QACtBnoB,KAAKmoB,UACN7Q,EAAUjC,MAAMC,QAAU,UAhI1C,wBAoII,cApIJ,mBAwII,WAEI,YAAoCnX,IAAhC6B,KAAKe,KAAKM,WAAWgvB,OACd,IACX,uDA5IR,uBA+II,SAAUxsB,EAAGC,GAAiB,IAAdC,EAAc,uDAAV,EAAGC,EAAO,uDAAH,EAEvB,KAAK,wDAAgBH,EAAGC,EAAGC,EAAGC,GAC1B,OAAO,EAGX,GAAS,GAALD,GAAe,GAALC,EAAQ,CAClB,IAAK,IAAItJ,EAAI,EAAGA,EAAIsF,KAAKyH,OAAOhN,OAAS,EAAGC,IAAK,CAC7C,IAAMiV,EAAO+gB,EAAe,CAAE7sB,EAAGA,EAAGC,EAAGA,GAAK9D,KAAKyH,OAAO/M,GAAIsF,KAAKyH,OAAO/M,EAAI,IAC5E,GAAIiV,GAAQ,EACR,OAAO,EAEf,OAAO,EAEX,OAAO,MA7Jf,GAA0Bie,GAiKbpH,EAAb,kIACI,SAAKzmB,EAAUkD,EAAK3C,GAAU,IAOtBqwB,EAPsB,OACpBC,EAAmB5wB,KAAKe,KAAKpB,KAAKkxB,WAAW,QAAU7wB,KAAKe,KAAKpB,KAAKkxB,WAAW,QACjFtpB,EAAUvH,KAAKuH,UAMrB,GALAtE,EAAIigB,YACJ4N,EAAY7tB,EAAKsE,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACxDhE,EAAI8tB,YACJ9tB,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GAE/B6wB,EAAiB,CACjB,IAAIjF,EAAQ3rB,KAAKe,KAAKpB,KAElBgsB,EADAA,EAAMkF,WAAW,OACTlF,EAAMqF,UAAU,GAEhBrF,EAAMqF,UAAU,GAE5B/tB,EAAIugB,UAAY,GAChBvgB,EAAIggB,SACJhgB,EAAIugB,UAAY,EAChBmN,EAAY3wB,KAAKiuB,eAAeluB,EAAU,iCAE1CkD,EAAIggB,SACJ0N,EAAY3wB,KAAKiuB,eAAeluB,EAAU,8BAE1CkD,EAAImf,MACJuO,EAAYA,EAAUM,OAAO,EAAG,IACpChuB,EAAI+P,UAAY2d,EAEZ1tB,EAAImf,MACJnf,EAAIigB,YACJ4N,EAAY7tB,EAAKsE,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACxDhE,EAAI8tB,aAER9tB,EAAImgB,OACApjB,KAAKgjB,YAAYjjB,KAAcC,KAAKiuB,eAAeluB,EAAU,qBAC7DA,EAASgG,QAAU,SAACsD,GAAD,OAAO,EAAKtD,QAAQsD,OAnCnD,wBAsCI,WACI,MAAO,KAvCf,wBA0CI,cA1CJ,mBA4CI,WAAU,OAAOrJ,KAAKe,KAAKpB,OA5C/B,qBA8CI,SAAQ2X,IACJ,sDAAcA,GACdA,EAAU+C,UAAUC,IAAI,0BACxBhD,EAAUrR,UAAYjG,KAAKmoB,YAjDnC,GAA+ByF,GAqDlB1F,EAAb,kIACI,SAAKnoB,EAAUkD,EAAK3C,GAChB,IAAMiH,EAAUvH,KAAKuH,UACrBtE,EAAIigB,YACJ4N,EAAY7tB,EAAKsE,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACxDhE,EAAI8tB,YACJ9tB,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GAEnC,IAAMmxB,EAAWlxB,KAAK4E,KAAKvD,WAAW8vB,QAAQnxB,KAAKe,KAAKe,KAAKT,WAAWN,MAEpEmwB,GAA8B,WAAlBA,EAAS9wB,KACrB6C,EAAI2sB,YAAY,CAAC,EAAG,IAEpB3sB,EAAI2sB,YAAY,CAAC,EAAG,IAIpBsB,IAA8C,IAAlCA,EAAS7vB,WAAT,UACZ4B,EAAIugB,UAAY,EAEhBvgB,EAAIugB,UAAY,EAEpBvgB,EAAIggB,SACJhgB,EAAIugB,UAAY,EAChBvgB,EAAI2sB,YAAY,CAAC,EAAG,IAGhBsB,GAA8B,SAAlBA,EAAS9wB,KACrB6C,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,8BAE9CkD,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAG9CkD,EAAImf,MACJnf,EAAIigB,YACJ4N,EAAY7tB,EAAKsE,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACxDhE,EAAI8tB,aAER9tB,EAAImgB,OACJngB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC9C,IAAMqxB,EAAcnuB,EAAIgnB,YAAYjqB,KAAKmoB,SACzCllB,EAAI8rB,SAAS/uB,KAAKmoB,QAASnoB,KAAK6D,EAAIutB,EAAYztB,MAAQ,EAAK3D,KAAK8D,EAAI4lB,WAAa,KAzC3F,mBA4CI,SAAM3pB,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAE1BC,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEhB,IAAMoE,EAAUvH,KAAKuH,UACrBtE,EAAIigB,YACJ4N,EAAY7tB,EAAKsE,EAAQ1D,EAAG0D,EAAQzD,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QACxDhE,EAAI8tB,YACJ9tB,EAAImgB,OAGJngB,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,MA5D1B,GAAgC/pB,GAiEnBksB,EAAb,kIACI,SAAKtxB,EAAUkD,EAAK3C,GAAU,IACtBgxB,EADsB,OAGtBA,EADAtxB,KAAKe,KAAKe,KAAKT,WAAW4C,aACb,kBAAMstB,EAAYtuB,EAAK,EAAKY,EAAG,EAAKC,EAAG,EAAKH,MAAO,EAAKsD,SAExD,kBAAMuqB,EAAcvuB,EAAK,EAAKsE,UAAW,EAAM,EAAKkqB,aAErExuB,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GAG/BC,KAAKe,KAAKe,KAAK1B,KAAKywB,WAAW,WAC/B5tB,EAAI2sB,YAAY,CAAC,EAAG,IAEpB3sB,EAAI2sB,YAAY,CAAC,EAAG,IAExB0B,IACAruB,EAAIggB,SACJhgB,EAAI2sB,YAAY,CAAC,EAAG,IACpB3sB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC1CkD,EAAImf,KACJkP,IACJruB,EAAImgB,OACJngB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAE9C,IAAM2xB,EAAY1xB,KAAK0xB,YACvBC,EAAiB1uB,EAAKlD,EAAU2xB,EAC5B1xB,KAAK4xB,YAAY7xB,GAAWC,KAAK6D,EAAG7D,KAAK8D,EACzC9D,KAAK2D,MAAO3D,KAAKiH,OACjB4qB,aA7BZ,mBAgCI,SAAM9xB,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAE1BC,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEZnD,KAAKe,KAAKe,KAAKT,WAAW4C,aAC1BstB,EAAYtuB,EAAKjD,KAAK6D,EAAG7D,KAAK8D,EAAG9D,KAAK2D,MAAO3D,KAAKiH,QAElDuqB,EAAcvuB,EAAKjD,KAAKuH,UAAWvH,KAAMA,KAAKyxB,YAClDxuB,EAAImgB,OAGJngB,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,IAhD1B,uBAmDI,WACI,IAAIhmB,EAASlJ,KAAKqB,aAAa8mB,MAC/B,GAAInoB,KAAKyxB,WAAY,CACjB,IAAMK,EAAQ9xB,KAAK4E,KAAKlD,MAAM1B,KAAKiF,WAAWvD,MAAM1B,KAAKe,KAAKe,KAAKoD,aACnE,QAAc/G,IAAV2zB,EACA5oB,EAAS4oB,EAAMzwB,WAAW8mB,UACzB,CAED,IAAM4J,GADN7oB,EAASlJ,KAAKe,KAAKe,KAAKqmB,OACL6J,QAAQ,KACvBD,EAAM,IACN7oB,EAASA,EAAO8nB,UAAU,EAAGe,KAGzC,OAAO7oB,IAhEf,yBAmEI,SAAYnJ,GACR,IAAKA,EAAS4Y,iBACV,OAAO3Y,KAAKmoB,QAEhB,IAAIjf,EAASlJ,KAAK0xB,YACdO,EAAQjyB,KAAKqB,aACjB,GAAIrB,KAAKyxB,WAAY,CACjB,IAAMK,EAAQ9xB,KAAK4E,KAAKlD,MAAM1B,KAAKiF,WAAWvD,MAAM1B,KAAKe,KAAKe,KAAKoD,aACnE,QAAc/G,IAAV2zB,EAGA,OAAO9xB,KAAKmoB,QAFZ8J,EAAQH,EAAMzwB,WAMtB,GAFA6H,GAAU,KAENlJ,gBAAgBkyB,GAAgBlyB,gBAAgBmyB,EAChDjpB,GAAU+oB,EAAMG,SAANH,QAAgCA,EAAMI,QAAU,GAAG3yB,eAC1D,CACH,IAAK,IAAIhF,EAAI,EAAGA,EAAIu3B,EAAMK,OAAO73B,SAAUC,EACvCwO,GAAU+oB,EAAMK,OAAO53B,GAAK,IAC5BwO,IAAUqpB,QAA0BN,EAAMO,MAAMC,OAAO/3B,GAAIqF,EAASowB,iBAAmB,KAE3FjnB,EAASA,EAAO8nB,UAAU,EAAG9nB,EAAOzO,OAAS,GAEjD,OAAOyO,EAAS,QA3FxB,GAA+B/D,GA+FlB8L,EAAb,sIACI,WAAa,OAAO,MADxB,GAA+BogB,GAIlBqB,EAAb,sIACI,WAAa,OAAO,MADxB,GAA8BrB,GAIjBsB,EAAb,wIAA0C,SAAW1vB,GAAOA,EAAI2sB,YAAY,CAAC,EAAG,QAAhF,GAA8B3e,GACjBjM,EAAb,wIAAwC,SAAW/B,GAAOA,EAAI2sB,YAAY,CAAC,EAAG,QAA9E,GAA6B8C,GAChBR,EAAb,wIAA8C,SAAWjvB,GAAOA,EAAI2sB,YAAY,CAAC,EAAG,QAApF,GAAkC3e,GACrBkhB,EAAb,wIAA4C,SAAWlvB,GAAOA,EAAI2sB,YAAY,CAAC,EAAG,QAAlF,GAAiC8C,GACpBE,EAAb,wIAA+C,SAAW3vB,GAAOA,EAAI2sB,YAAY,CAAC,GAAI,QAAtF,GAAmC3e,GACtB4hB,EAAb,wIAA6C,SAAW5vB,GAAOA,EAAI2sB,YAAY,CAAC,GAAI,QAApF,GAAkC8C,GAErBI,EAAb,kIACI,SAAK/yB,EAAUkD,EAAK3C,GAChB,IAAMiH,EAAUvH,KAAKuH,UACrBwrB,EAAY9vB,EAAKsE,EAASvH,KAAK2D,MAAO3D,KAAKiH,QAC3ChE,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GACnCkD,EAAIggB,SACJhgB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC1CkD,EAAImf,KACJ2Q,EAAY9vB,EAAKsE,EAASvH,KAAK2D,MAAO3D,KAAKiH,QAC/ChE,EAAImgB,OACJngB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAE9C,IAAMuD,EAAMvD,EAASsE,eAAeC,mBACpC,IAAKrB,EAAIQ,KAAOH,EAAM0vB,YAAtB,CAKI,IAHA,IACMC,EADOjzB,KAAKqB,aAAa6xB,KAAKC,YACjBC,MAAM,MACrBC,EAAU,EAAGC,EAAc,EACtB54B,EAAI,EAAGA,EAAIu4B,EAAMx4B,OAAQC,IAC1Bu4B,EAAMv4B,GAAGD,OAAS64B,IAClBD,EAAU34B,EACV44B,EAAcL,EAAMv4B,GAAGD,QAG/B,IAAM84B,EAAUtwB,EAAIuwB,KACpBvwB,EAAIuwB,KAAO,mBACX,IAAMpC,EAAcnuB,EAAIgnB,YAAYgJ,EAAMI,IAGpCpsB,EAASgsB,EAAMx4B,OAASivB,WAAa,KACrC/lB,EAAQytB,EAAYztB,MAEpB8vB,EAAKxsB,GADkC,GACxBjH,KAAKiH,QACpBysB,EAAK/vB,GAFY,GAEH3D,KAAK2D,OACnBgwB,EAAWluB,KAAK+iB,IAAI,GAAKiL,EAAI,GAAKC,GAClCE,EAAeD,EAAW,EAEhC1wB,EAAIuwB,KAAOG,EAAW,iBAGtB,IADA,IAAM7vB,EAAI9D,KAAK8D,EAAI8vB,GAAiBX,EAAMx4B,OAAS,GAAK,EAAKk5B,EAAW,KAC/Dj5B,EAAI,EAAGA,EAAIu4B,EAAMx4B,OAAQC,IAC9BuI,EAAI8rB,SAASkE,EAAMv4B,GAAIsF,KAAK6D,EAVT,GAUc7D,KAAK2D,MAA0B,EAC5DG,EAAIpJ,EAAIi5B,EAAW,MAE3B1wB,EAAIuwB,KAAOD,MA/Bf,CAmCA,IAAMnC,EAAcnuB,EAAIgnB,YAAYjqB,KAAKmoB,SACzCllB,EAAI8rB,SAAS/uB,KAAKmoB,QAASnoB,KAAK6D,EAAIutB,EAAYztB,MAAQ,EAAK3D,KAAK8D,EAAI4lB,WAAa,MAjD3F,mBAoDI,SAAM3pB,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAE1BC,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEhB4vB,EAAY9vB,EAAKjD,KAAKuH,UAAWvH,KAAK2D,MAAO3D,KAAKiH,QAClDhE,EAAImgB,OAGJngB,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,MAjE1B,GAA6B/pB,GAsEhB0uB,EAAb,kIACI,SAAK9zB,EAAUkD,EAAK3C,GAAU,WACpBiH,EAAUvH,KAAKuH,UACf+pB,EAAa,WACfruB,EAAIigB,YACJjgB,EAAI6f,OAAOvb,EAAQ1D,EAAG0D,EAAQzD,GAC9Bb,EAAI8f,OAAOxb,EAAQ1D,EAAI,EAAKF,MAAQ,EAAG4D,EAAQzD,EAAI,EAAKmD,QACxDhE,EAAI8f,OAAOxb,EAAQ1D,EAAI,EAAKF,MAAO4D,EAAQzD,GAC3Cb,EAAI8f,OAAOxb,EAAQ1D,EAAG0D,EAAQzD,GAC9Bb,EAAI8tB,aAER9tB,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GACnCuxB,IACAruB,EAAIggB,SACJhgB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC1CkD,EAAImf,KACJkP,IACJruB,EAAImgB,OACJngB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAE9C,IAAM2xB,EAAY1xB,KAAKmoB,QAAQ6I,UAAU,EAAGhxB,KAAKmoB,QAAQ6J,QAAQ,MACjEL,EAAiB1uB,EAAKlD,EAAU2xB,EAC5B1xB,KAAKmoB,QAASnoB,KAAK6D,EAAG7D,KAAK8D,EAAkB,GAAd9D,KAAKiH,OACpCjH,KAAK2D,MAAO3D,KAAKiH,OACjB4qB,aAxBZ,mBA2BI,SAAM9xB,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAE1BC,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEhB,IAAMoE,EAAUvH,KAAKuH,UACrBtE,EAAIigB,YACJjgB,EAAI6f,OAAOvb,EAAQ1D,EAAG0D,EAAQzD,GAC9Bb,EAAI8f,OAAOxb,EAAQ1D,EAAI7D,KAAK2D,MAAQ,EAAG4D,EAAQzD,EAAI9D,KAAKiH,QACxDhE,EAAI8f,OAAOxb,EAAQ1D,EAAI7D,KAAK2D,MAAO4D,EAAQzD,GAC3Cb,EAAI8f,OAAOxb,EAAQ1D,EAAG0D,EAAQzD,GAC9Bb,EAAI8tB,YACJ9tB,EAAImgB,OAGJngB,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,MA9C1B,GAA4B/pB,GAmDfhD,EAAb,kIACI,SAAKpC,EAAUkD,EAAK3C,GAChB,GAAIN,KAAKe,KAAKe,KAAKT,WAAW4C,aAA9B,CACI,IAAMsD,EAAUvH,KAAKuH,UACrBwrB,EAAY9vB,EAAKsE,EAASvH,KAAK2D,MAAO3D,KAAKiH,QAC3ChE,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GACnCkD,EAAIggB,SACJ8P,EAAY9vB,EAAK,CAAEY,EAAG0D,EAAQ1D,EAAI,IAAKC,EAAGyD,EAAQzD,EAAI,KAAO9D,KAAK2D,MAAQ,EAAG3D,KAAKiH,OAAS,GAC3FhE,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GACnCkD,EAAIggB,SACJhgB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC1CkD,EAAImf,KACJ2Q,EAAY9vB,EAAK,CAAEY,EAAG0D,EAAQ1D,EAAI,IAAKC,EAAGyD,EAAQzD,EAAI,KAAO9D,KAAK2D,MAAQ,EAAG3D,KAAKiH,OAAS,GAC/FhE,EAAImgB,OACJngB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC9C,IAAMooB,EAAQnoB,KAAKe,KAAKe,KAAKT,WAAW8mB,MAClCiJ,EAAcnuB,EAAIgnB,YAAY9B,GACpCllB,EAAI8rB,SAAS5G,EAAOnoB,KAAK6D,EAAIutB,EAAYztB,MAAQ,EAAK3D,KAAK8D,EAAI4lB,WAAa,QAKhF,mDAAW3pB,EAAUkD,EAAK3C,EAAU,iCAChC,kCAGJgjB,EAAUvjB,EAAUkD,EAAKjD,KAAKe,KAAKgB,MAAOzB,KA1BlD,mBA6BI,SAAMP,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAChC,GAAIhvB,KAAKe,KAAKe,KAAKT,WAAW4C,aAAc,CAExC,IAAMgrB,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEhB4vB,EAAY9vB,EAAKjD,KAAKuH,UAAWvH,KAAK2D,MAAO3D,KAAKiH,QAClDhE,EAAImgB,OAGJngB,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,OAElB,oDAAYnvB,EAAUkD,EAAKE,EAAO6rB,KA7C9C,wBAiDI,WACI,GAAIhvB,KAAKe,KAAKe,KAAKT,WAAW4C,aAAc,CACxC,IAAMknB,EAAYnrB,KAAKe,KAAKe,KAAKT,WAAW8mB,MAAM1tB,OAASivB,WAAa,GAClE0B,EAAa,EAAI1B,WAAa/tB,OAAO4G,KAAKvC,KAAKe,KAAKe,KAAKT,WAAWwQ,eAAepX,OAASivB,WAC5F2B,EAAc,EAAI3B,WAAa/tB,OAAO4G,KAAKvC,KAAKe,KAAKe,KAAKT,WAAWmQ,gBAAgB/W,OAASivB,WAC9F4B,EAAW7lB,KAAKijB,IAAIyC,EAAWC,EAAYC,GAC7CE,EAAY,EAAI7B,WAGdhI,EAAO,CAAE/d,MAAO2nB,EAAUrkB,OAFhCskB,GAAa,EAAI7B,YAGjBhI,EAAK/d,OAAgB+d,EAAKza,OAAS,EAArB,EACdya,EAAKza,QAAU,KAEfjH,KAAK2D,MAAQ+d,EAAK/d,MAClB3D,KAAKiH,OAASya,EAAKza,YAEnBjH,KAAK2D,MAAQ3D,KAAKe,KAAKe,KAAKT,WAAW2pB,OAAOrnB,MAC9C3D,KAAKiH,OAASjH,KAAKe,KAAKe,KAAKT,WAAW2pB,OAAO/jB,SAlE3D,mBAuEI,WAAU,MAAO,OAvErB,GAAgC9B,GAmIzB,SAASme,EAAUvjB,EAAUkD,EAAK6wB,EAAYxzB,GACjD,IAAMgD,EAAMvD,EAASsE,eAAeC,mBAG9B9C,EAAIsyB,IACL7wB,EAAIQ,KAAOH,EAAMywB,WAClBvyB,EAAEQ,QAAQL,SAAQ,SAAAd,GACd,IAAMI,EAAOO,EAAEP,KAAKJ,GACpBI,EAAKoS,KAAKtT,EAAUkD,EAAK3C,GACzBW,EAAKsW,WAAWxX,EAAUkD,MAIlC,IAAMM,EAAexD,EAASwD,aAG9B/B,EAAEE,QAAQC,SAAQ,SAAAC,GACd,IAAME,EAAON,EAAEM,KAAKF,GAEpB,GAAIqB,EAAIQ,MAAQH,GAAOI,WAAa5B,EAAK6B,MAAQL,EAAMI,WAGnD,OAFA5B,EAAKkyB,YAAYj0B,EAAUkD,EAAK3C,QAChCwB,EAAKyV,WAAWxX,EAAUkD,GAI9B,IAAIA,EAAIQ,KAAQ3B,EAAK8B,UAAUL,EAAaM,EAAGN,EAAaO,EAAGP,EAAaQ,EAAGR,EAAaS,GAA5F,CAGAlC,EAAKuR,KAAKtT,EAAUkD,EAAK3C,GACzBwB,EAAKyV,WAAWxX,EAAUkD,GAE1B,IAAMgP,EAAKnQ,EAAKf,KAAKgB,MAErB,IAAKD,EAAKf,KAAKyC,MAAMnC,WAAW4C,cAAgBgO,EAAI,CAuBhD,GAtBAA,EAAGvQ,QAAQC,SAAQ,SAAAC,GACf,IAAMnC,EAAIwS,EAAGnQ,KAAKF,GAElB,IAAIqB,EAAIQ,KAAQhE,EAAEmE,UAAUL,EAAaM,EAAGN,EAAaO,EAAGP,EAAaQ,EAAGR,EAAaS,GAAzF,CAEA,GAAIf,EAAIQ,KAAOH,GAAOY,SAGlB,OAFAzE,EAAEu0B,YAAYj0B,EAAUkD,EAAK3C,QAC7Bb,EAAE8X,WAAWxX,EAAUkD,GAI3BxD,EAAE4T,KAAKtT,EAAUkD,EAAK3C,GACtBb,EAAE8X,WAAWxX,EAAUkD,GACvBxD,EAAEoS,cAAclQ,SAAQ,SAAA0H,GACpBA,EAAEgK,KAAKtT,EAAUkD,EAAK3C,GACtB+I,EAAEkO,WAAWxX,EAAUkD,MAE3BxD,EAAE+R,eAAe7P,SAAQ,SAAA0H,GACrBA,EAAEgK,KAAKtT,EAAUkD,EAAK3C,GACtB+I,EAAEkO,WAAWxX,EAAUkD,UAG3BA,EAAIQ,KAAOH,GAAOywB,SAClB,OACJ9hB,EAAGjQ,QAAQL,SAAQ,SAAAd,GACf,IAAMI,EAAOgR,EAAGhR,KAAKJ,GACjBoC,EAAIQ,MAAQxC,EAAK2C,UAAUL,EAAaM,EAAGN,EAAaO,EAAGP,EAAaQ,EAAGR,EAAaS,KAE5F/C,EAAKoS,KAAKtT,EAAUkD,EAAK3C,GACzBW,EAAKsW,WAAWxX,EAAUkD,YAOnC,SAAS4pB,EAAYjoB,EAAMqvB,EAAYC,GAC1CtvB,EAAKlD,MAAMC,SAAQ,SAAC6B,EAAOsB,GACvB,IAAMtD,EAAIyyB,EAAWnyB,KAAKgD,GAC1BtD,EAAEqC,GAAKqwB,EAAOrwB,EACdrC,EAAEsC,GAAKowB,EAAOpwB,EACTN,EAAMnC,WAAW4C,cAClB0pB,EAAanqB,EAAOhC,EAAG0yB,MAE/BtvB,EAAK5C,MAAML,SAAQ,SAACd,EAAGszB,GACnB,IAAMlzB,EAAOgzB,EAAWhzB,KAAKJ,EAAEkR,IAAKlR,EAAE+Q,KACtC3Q,EAAK4C,GAAKqwB,EAAOrwB,EACjB5C,EAAK6C,GAAKowB,EAAOpwB,EACjB7C,EAAKwG,OAAO9F,SAAQ,SAACjE,GACjBA,EAAEmG,GAAKqwB,EAAOrwB,EACdnG,EAAEoG,GAAKowB,EAAOpwB,QAMnB,SAAS6pB,EAAanqB,EAAO3B,EAAaqyB,GAC7C,IAAMzJ,EAAc,IAAI/K,IAExBlc,EAAM9B,MAAMC,SAAQ,SAAClC,EAAG20B,GACpB,IAAMtyB,EAAOD,EAAYd,KAAKgB,MAAMD,KAAKsyB,GACpCtyB,IACL2oB,EAAYnQ,IAAI8Z,EAAI10B,YAEpBoC,EAAK+B,GAAKqwB,EAAOrwB,EACjB/B,EAAKgC,GAAKowB,EAAOpwB,EACjBhC,EAAK+P,cAAclQ,SAAQ,SAAA0H,GACvBA,EAAExF,GAAKqwB,EAAOrwB,EACdwF,EAAEvF,GAAKowB,EAAOpwB,KAElBhC,EAAK0P,eAAe7P,SAAQ,SAAA0H,GACxBA,EAAExF,GAAKqwB,EAAOrwB,EACdwF,EAAEvF,GAAKowB,EAAOpwB,KAGU,eAAxBhC,EAAKf,KAAKe,KAAK1B,MACfysB,EAAY/qB,EAAKf,KAAKe,KAAKT,WAAWuD,KAAM9C,EAAKf,KAAKgB,MAAOmyB,OAErE1wB,EAAMxB,MAAML,SAAQ,SAACd,EAAGszB,GAEpB,GADAtzB,GAAIsrB,QAAwBtrB,EAAG4pB,EAAajnB,GAC5C,CACA,IAAMvC,EAAOY,EAAYd,KAAKgB,MAAMd,KAAKJ,EAAEkR,IAAKlR,EAAE+Q,IAAKuiB,GAClDlzB,IACLA,EAAK4C,GAAKqwB,EAAOrwB,EACjB5C,EAAK6C,GAAKowB,EAAOpwB,EACjB7C,EAAKwG,OAAO9F,SAAQ,SAACjE,GACjBA,EAAEmG,GAAKqwB,EAAOrwB,EACdnG,EAAEoG,GAAKowB,EAAOpwB,UAQnB,SAAS6tB,EAAiB1uB,EAAKlD,EAAUs0B,EAAUC,EACtDzwB,EAAGC,EAAGC,EAAGC,EAAGuwB,GACU,IADCC,EACD,uDADiB,GACvCC,EAAsB,0DAAJ,GACZnxB,EAAMvD,EAASsE,eAAeC,mBAChC6jB,EAAQmM,EACRX,EAAWluB,KAAK+iB,IAAIllB,EAAMmxB,EAAiBD,GAC3CE,EAAUhL,WAAa,EACrB6J,EAAUtwB,EAAIuwB,KAChBvwB,EAAIQ,KAAOH,GAAOixB,IAClBtxB,EAAIuwB,KAAOG,EAAW,gBACtBxL,EAAQkM,EACRK,EAAUf,EAAW,EAAM3vB,EAAI,GAGnC,IAAMotB,EAAcnuB,EAAIgnB,YAAY9B,GAChCwM,EAAKvD,EAAYztB,MACjBV,EAAIQ,KAAOH,GAAOixB,GAAaI,EAAK5wB,IACpC4vB,GAAuBgB,EAAK5wB,EAC5Bd,EAAIuwB,KAAOG,EAAW,gBACtBe,EAAUf,EAAW,EAAM3vB,EAAI,EAC/B2wB,EAAK5wB,GAGTd,EAAI8rB,SAAS5G,EAAOtkB,EAAI8wB,EAAK,EAAK7wB,EAAI4wB,GAElCzxB,EAAIQ,KAAOH,GAAOixB,IAClBtxB,EAAIuwB,KAAOD,GAGZ,SAAShC,EAAYtuB,EAAKY,EAAGC,EAAGC,EAAGC,EAAGkwB,GACzC,IAAM3sB,EAAU,CAAE1D,EAAGA,EAAIE,EAAI,EAAKD,EAAGA,EAAIE,EAAI,GACvC4wB,EAAS5wB,EAAI,EACnBf,EAAIigB,YACJjgB,EAAI6f,OAAOvb,EAAQ1D,EAAGC,GACtBb,EAAI8f,OAAOxb,EAAQ1D,EAAI+wB,EAAQrtB,EAAQzD,GACvCb,EAAI8f,OAAOxb,EAAQ1D,EAAIE,EAAI6wB,EAAQrtB,EAAQzD,GAC3Cb,EAAI8f,OAAOxb,EAAQ1D,EAAIE,EAAGD,GAC1Bb,EAAI8f,OAAOxb,EAAQ1D,EAAIE,EAAI6wB,EAAQrtB,EAAQzD,EAAIE,GAC/Cf,EAAI8f,OAAOxb,EAAQ1D,EAAI+wB,EAAQrtB,EAAQzD,EAAIE,GAC3Cf,EAAI8f,OAAOxb,EAAQ1D,EAAGC,GACtBb,EAAI8tB,YAGD,SAASgC,EAAY9vB,EAAKsE,EAAS5D,EAAOsD,GAC7C,IAAM4tB,EAAS5tB,EAAS,EACxBhE,EAAIigB,YACJjgB,EAAI6f,OAAOvb,EAAQ1D,EAAG0D,EAAQzD,EAAI+wB,GAClC5xB,EAAI8f,OAAOxb,EAAQ1D,EAAIgxB,EAAQttB,EAAQzD,GACvCb,EAAI8f,OAAOxb,EAAQ1D,EAAIF,EAAQkxB,EAAQttB,EAAQzD,GAC/Cb,EAAI8f,OAAOxb,EAAQ1D,EAAIF,EAAO4D,EAAQzD,EAAI+wB,GAC1C5xB,EAAI8f,OAAOxb,EAAQ1D,EAAIF,EAAO4D,EAAQzD,EAAI,EAAI+wB,GAC9C5xB,EAAI8f,OAAOxb,EAAQ1D,EAAIF,EAAQkxB,EAAQttB,EAAQzD,EAAImD,GACnDhE,EAAI8f,OAAOxb,EAAQ1D,EAAIgxB,EAAQttB,EAAQzD,EAAImD,GAC3ChE,EAAI8f,OAAOxb,EAAQ1D,EAAG0D,EAAQzD,EAAI,EAAI+wB,GACtC5xB,EAAI8f,OAAOxb,EAAQ1D,EAAG0D,EAAQzD,EAAI,EAAI+wB,GACtC5xB,EAAI8tB,YAID,SAASD,EAAY7tB,EAAKY,EAAGC,EAAGC,EAAGC,GACtC,IAAM8wB,EAAQ,SACVC,EAAMhxB,EAAI,EAAK+wB,EACfE,EAAMhxB,EAAI,EAAK8wB,EACfG,EAAKpxB,EAAIE,EACTmxB,EAAKpxB,EAAIE,EACTurB,EAAK1rB,EAAIE,EAAI,EACbyrB,EAAK1rB,EAAIE,EAAI,EAEjBf,EAAI6f,OAAOjf,EAAG2rB,GACdvsB,EAAIkyB,cAActxB,EAAG2rB,EAAKwF,EAAIzF,EAAKwF,EAAIjxB,EAAGyrB,EAAIzrB,GAC9Cb,EAAIkyB,cAAc5F,EAAKwF,EAAIjxB,EAAGmxB,EAAIzF,EAAKwF,EAAIC,EAAIzF,GAC/CvsB,EAAIkyB,cAAcF,EAAIzF,EAAKwF,EAAIzF,EAAKwF,EAAIG,EAAI3F,EAAI2F,GAChDjyB,EAAIkyB,cAAc5F,EAAKwF,EAAIG,EAAIrxB,EAAG2rB,EAAKwF,EAAInxB,EAAG2rB,GAG3C,SAASK,EAAU5sB,EAAKmyB,EAAIC,EAAI3T,GAA+B,IAAzBwS,EAAyB,uDAAhB,EAAGtZ,EAAa,uDAAH,EAC/D3X,EAAI6P,OAEJ,IAAMtD,EAAK6lB,EAAGxxB,EAAIuxB,EAAGvxB,EACf4L,EAAK4lB,EAAGvxB,EAAIsxB,EAAGtxB,EACrBb,EAAI0H,UAAU0qB,EAAGxxB,EAAGwxB,EAAGvxB,GACvBb,EAAIqI,OAAO7F,KAAKgF,MAAMgF,EAAID,IAG1BvM,EAAIigB,YACJjgB,EAAI6f,OAAO,EAAIlI,EAAUsZ,EAAQ,GACjCjxB,EAAI8f,QAAU,EAAIrB,EAAQ9G,EAAWsZ,IAAUxS,EAAO9G,IACtD3X,EAAI8f,QAAU,EAAIrB,EAAQ9G,EAAWsZ,EAASxS,EAAO9G,GACrD3X,EAAI8tB,YACJ9tB,EAAImgB,OACJngB,EAAIiQ,UAGD,SAASse,EAAcvuB,EAAKsE,EAASzF,GAAwB,IAAlBwzB,EAAkB,wDAChEryB,EAAIigB,YACAoS,GACAryB,EAAI6f,OAAOvb,EAAQ1D,EAAG0D,EAAQzD,GAC9Bb,EAAI8f,OAAOxb,EAAQ1D,EAAI/B,EAAK6B,MAAO4D,EAAQzD,GAC3Cb,EAAI8f,OAAOxb,EAAQ1D,EAAI/B,EAAK6B,MAAQ7B,EAAKmF,OAAQM,EAAQzD,EAAIhC,EAAKmF,QAClEhE,EAAI8f,OAAOxb,EAAQ1D,EAAI/B,EAAKmF,OAAQM,EAAQzD,EAAIhC,EAAKmF,QACrDhE,EAAI8f,OAAOxb,EAAQ1D,EAAG0D,EAAQzD,KAE9Bb,EAAI6f,OAAOvb,EAAQ1D,EAAG0D,EAAQzD,EAAIhC,EAAKmF,QACvChE,EAAI8f,OAAOxb,EAAQ1D,EAAI/B,EAAK6B,MAAO4D,EAAQzD,EAAIhC,EAAKmF,QACpDhE,EAAI8f,OAAOxb,EAAQ1D,EAAI/B,EAAK6B,MAAQ7B,EAAKmF,OAAQM,EAAQzD,GACzDb,EAAI8f,OAAOxb,EAAQ1D,EAAI/B,EAAKmF,OAAQM,EAAQzD,GAC5Cb,EAAI8f,OAAOxb,EAAQ1D,EAAG0D,EAAQzD,EAAIhC,EAAKmF,SAE3ChE,EAAI8tB,YAID,SAASL,EAAehzB,EAAG63B,EAAOC,GACrC,IAAMhmB,EAAMgmB,EAAM3xB,EAAI0xB,EAAM1xB,EACtB4L,EAAM+lB,EAAM1xB,EAAIyxB,EAAMzxB,EACtB2xB,EAAMhmB,EAAK/R,EAAEmG,EAAI2L,EAAK9R,EAAEoG,EAAI0xB,EAAM3xB,EAAI0xB,EAAMzxB,EAAI0xB,EAAM1xB,EAAIyxB,EAAM1xB,EAEtE,OAAO4B,KAAK0F,IAAIsqB,GAAOhwB,KAAKsE,KAAK0F,EAAKA,EAAKD,EAAKA,GAQ7C,SAASpM,EAAa+S,GAMzB,OALIA,EAAM,IACNA,EAAM,GACNA,EAAM,IACNA,EAAM,GAEH,QADkB,KAAX,EAAIA,IAAYzW,SAAS,IACjB,aAGnB,IAAMgsB,EAAe,CACxBkC,cAAaiB,OAAMlqB,QAAOQ,WAAUlD,OAAMukB,YAAW0B,aAAYmJ,YAAWpgB,YAAWyhB,WAAUC,WAAU3tB,UAC3GktB,eAAcC,cAAaW,UAASe,SAAQjB,gBAAeC,eAAc1wB,aAAYuzB,YAlUzF,mIACI,SAAMzyB,GACF,IAAM2xB,EAAS50B,KAAKiH,OAAS,EACvBM,EAAUvH,KAAKuH,UACrBtE,EAAIigB,YACJjgB,EAAI6f,OAAOvb,EAAQ1D,EAAG0D,EAAQzD,GAC9Bb,EAAI8f,OAAOxb,EAAQ1D,EAAI7D,KAAK2D,MAAQixB,EAAQrtB,EAAQzD,GACpDb,EAAI8f,OAAOxb,EAAQ1D,EAAI7D,KAAK2D,MAAO4D,EAAQzD,EAAI8wB,GAC/C3xB,EAAI8f,OAAOxb,EAAQ1D,EAAI7D,KAAK2D,MAAO4D,EAAQzD,EAAI9D,KAAKiH,QACpDhE,EAAI8f,OAAOxb,EAAQ1D,EAAG0D,EAAQzD,EAAI9D,KAAKiH,QACvChE,EAAI8tB,cAVZ,oBAaI,SAAO9tB,GACH,IAAM2xB,EAAS50B,KAAKiH,OAAS,EACvBM,EAAUvH,KAAKuH,UACrBtE,EAAIigB,YACJjgB,EAAI6f,OAAOvb,EAAQ1D,EAAI7D,KAAK2D,MAAQixB,EAAQrtB,EAAQzD,GACpDb,EAAI8f,OAAOxb,EAAQ1D,EAAI7D,KAAK2D,MAAQixB,EAAQrtB,EAAQzD,EAAI8wB,GACxD3xB,EAAI8f,OAAOxb,EAAQ1D,EAAI7D,KAAK2D,MAAO4D,EAAQzD,EAAI8wB,KAnBvD,kBAsBI,SAAK70B,EAAUkD,EAAK3C,GAChB2C,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC9CC,KAAK21B,MAAM1yB,GACXA,EAAImgB,OACJngB,EAAI+f,YAAchjB,KAAKgjB,YAAYjjB,GACnCC,KAAK21B,MAAM1yB,GACXA,EAAIggB,SACJjjB,KAAK41B,OAAO3yB,GACZA,EAAIggB,SACJhgB,EAAI+P,UAAYhT,KAAKiuB,eAAeluB,EAAU,2BAC9C,IAAMuvB,EAAQrsB,EAAIgnB,YAAYjqB,KAAKmoB,SAASxkB,MAC5CV,EAAI8rB,SAAS/uB,KAAKmoB,QAASnoB,KAAK6D,EAAIyrB,EAAQ,EAAGtvB,KAAK8D,EAAI4lB,WAAa,KAjC7E,mBAoCI,SAAM3pB,EAAUkD,EAAKE,GAAsB,IAAf6rB,EAAe,uDAAP,MAE1BC,EAAkBhsB,EAAI+P,UACtBkc,EAAajsB,EAAIksB,YAEvBlsB,EAAIksB,YAAcH,EAClB/rB,EAAI+P,UAAY7P,EAEhBnD,KAAK21B,MAAM1yB,GACXA,EAAImgB,OAGJngB,EAAI+P,UAAYic,EAChBhsB,EAAIksB,YAAcD,MAjD1B,GAAiC/pB,IAsUjCxJ,OAAOk6B,OAAOC,WAAYpK,I,uPC3rCnB,IAAMqK,EAAiB,CAC1BC,aA4IJ,WACI,IAAMrb,EAAQ/R,SAASqtB,eAAe,WAChCC,EAAMttB,SAASqtB,eAAe,WAE9BE,EAAO,SAACt1B,GACV+H,SAASwtB,UAAYxtB,SAASwtB,UAAUC,QAAU/iB,OAAOgjB,eAAeC,kBACxE5b,EAAMtF,MAAM1R,MAAQ8B,KAAKijB,IAAM7nB,EAAE21B,KAAKC,WAAa51B,EAAE61B,MAAS,IAAM,MAGxER,EAAI1gB,iBAAiB,aAAa,WAC9B5M,SAAS4M,iBAAiB,YAAa2gB,GACvCvtB,SAAS4M,iBAAiB,WAAW,WACjC5M,SAAS+tB,oBAAoB,YAAaR,UAvJlDS,uBACAC,kBACAC,uBACAC,cAoIJ,WACInuB,SAASqtB,eAAe,WAAW5gB,MAAMC,QAAU,QApInD0hB,WAyDJ,SAAoBj3B,EAAU6E,GAC1BgyB,EAAqB,gBAErB,IAAMK,EAAUH,IAChBG,EAAQphB,UAAY,GAGpB,IAAMvM,EAAIV,SAASuM,cAAc,OACjC7L,EAAE4R,UAAY,sBACd5R,EAAEuM,WAAYC,OAAd,0GAA+G/V,EAAS6E,KAAKvD,WAAW1B,MACxI2J,EAAE6R,QAAU,kBAAMpb,EAAS8N,gBAC3BopB,EAAQlc,YAAYzR,GAEpB,IAAM4tB,EAAQ,CAACD,IAGfnX,QAAqBlb,GAAM,SAAC9C,EAAMmT,GAE9B,GAAInT,EAAK1B,OAAOwgB,SAAS,SAAW9e,EAAKf,KAAKe,KAAKoD,aAAe,EAE9D,OADAgyB,EAAM14B,KAAK,OACJ,EAIX,IAAM8K,EAAIV,SAASuM,cAAc,OACjC7L,EAAE4R,UAAY,sBACd,IAAIjX,EAAenC,EAAKT,aAAa4C,aACrCA,OAAiC9F,IAAjB8F,GAAsCA,EACtD,IAAIkzB,EAAYr1B,EAAK1B,OAgCrB,OA7BI0B,EAAK1B,OAAOwgB,SAAS,eAEaziB,IADpB2D,EAAK8C,KAAKlD,MAAMI,EAAKmD,WACzBulB,WAAW1oB,EAAKgD,MACtBqyB,EAAYA,EAAUr4B,MAAM,GAAI,IAIxCwK,EAAEuM,WAAYC,OAAd,+BAA6BqhB,EAAar1B,EAAKqmB,QAAUlkB,EAAe,eAAiB,IACzFqF,EAAE6R,QAAU,SAACta,GAET,IAAMu2B,EAAmB,CAACt1B,GAC1B,GAAIA,EAAK1B,OAAOwgB,SAAS,SAAU,CAC/B,IAAMpd,EAAQ1B,EAAK8C,KAAKlD,MAAMI,EAAKmD,WACnC,QAAkC9G,IAA9BqF,EAAMgnB,WAAW1oB,EAAKgD,IAAmB,S,w5BAAA,CAChBtB,EAAMgnB,WAAW1oB,EAAKgD,KADN,IACzC,gCAAWuyB,EAAX,QACID,EAAiB54B,KAAKyW,EAAOnT,KAAKu1B,KAFG,gCAMjDt3B,EAAS8N,aAAaupB,GAGjBv2B,IAAGA,EAAIyS,OAAOyL,OACnBle,EAAEy2B,cAAe,EACbz2B,EAAE4U,iBAAiB5U,EAAE4U,mBAE7ByhB,EAAM14B,KAAK8K,IAGPrF,QAAJ,KAGD,SAACnC,EAAMmT,GAGN,IAAM4Y,EAAOqJ,EAAMtiB,MACfiZ,GACAqJ,EAAMA,EAAMz8B,OAAS,GAAGsgB,YAAY8S,MAG5CgJ,KA/HAU,aAiBJ,SAAsB1J,GAClB,IAAI7M,EAAW8V,IACXU,EAAO,GACX,GAAI3J,aAAgB5rB,MAA2B,WAAnB4rB,EAAK9sB,KAAKX,KAAmB,CACrD,IAAIq3B,EAAY5J,EAAKjpB,KAAKlD,MAAMmsB,EAAK5oB,WAAWjD,MAAM6rB,EAAK/oB,IAC3D0yB,GAAQ,mBAAqBC,EAAUlmB,cAAgB,WACnDkmB,EAAU/lB,cAAgB,QAElC8lB,GAAQ,SAER,cAAiB77B,OAAO+7B,QAAQ7J,EAAKxsB,cAArC,eAAoD,CAA/C,IAAI+uB,EAAI,KACO,WAAZA,EAAK,IAA+B,SAAZA,EAAK,IACjB,YAAZA,EAAK,IAAoBA,EAAK,GAAGS,WAAW,WACjC,YAAXT,EAAK,KAEToH,GAAQ,MAAQpH,EAAK,GAAK,oBAC1BoH,IAAQlH,QACJF,EAAK,GAAIuH,EAAQC,aAAazH,iBAC9B,QAIR,GAAItC,aAAgB3F,WAAY,CAC5B,IAAI2P,EAAahK,EAAKjpB,KAAKvD,WAAW8vB,QAAQtD,EAAKxsB,aAAaN,MAChEy2B,GAAQ,aAAeK,EAAWz3B,KAAO,oBACzC,cAAiBzE,OAAO+7B,QAAQG,EAAWx2B,YAA3C,eAAwD,CAAnD,IAAI+uB,EAAI,KACO,WAAZA,EAAK,IAA+B,SAAZA,EAAK,IAC7BA,EAAK,GAAGS,WAAW,YAEvB2G,GAAQ,MAAQpH,EAAK,GAAK,oBAC1BoH,IAAQlH,QACJF,EAAK,GAAIuH,EAAQC,aAAazH,iBAC9B,SAIZnP,EAASnL,UAAY2hB,IAlDzB,SAASZ,EAAqBpa,GAE1B5T,SAASqtB,eAAe,kBAAkBhwB,UAAYuW,EAG1D,SAASsa,IACL,OAAOluB,SAASqtB,eAAe,oBAGnC,SAASY,IAELjuB,SAASqtB,eAAe,WAAW5gB,MAAMC,QAAU,O,0kCCFnDwiB,EAFIC,EAAMjC,WAANiC,EAGJC,EAAO,KACPC,EAAuB,KAMdN,GAAUO,QACApC,WACnB,CACI8B,aAAc,KACdO,eAAgBpC,EAChBqC,aAAcC,EACdC,cAAeC,IACfC,kBAAmBC,IACnBC,gBAAiBC,EACjBC,yBAA0BtI,KAC1BuI,0BAA2BtG,KAC3BuG,wBAAyBpa,KACzBqa,2BAA4Bna,KAC5Boa,uBAAwBlZ,KACxBmZ,0BAA2BC,KAC3BC,0BAA2BC,KAC3BC,iBAAkBhiB,IAClBiiB,iBAAkB5N,KAClB6N,uBAAwB15B,IACxB25B,wBAAyB94B,IACzB+4B,+BAAgCl1B,IAChCm1B,uBAAwBtzB,IACxBuzB,eAAgBC,IAMxB,GAAIhxB,SAASixB,cAAcC,aAAa,kBACpCzB,GAAUE,OAAW3vB,SAASixB,cAAczf,aAAa,wBACtD,CACH,IAAM2f,EAyLV,SAA4Bp6B,GACxB,IAAMo6B,EAAMzmB,OAAO0mB,SAAS7Y,KAC5BxhB,EAAOA,EAAK2B,QAAQ,UAAW,QAC/B,IACI24B,EADU,IAAIC,OAAO,OAASv6B,EAAO,qBACrBw6B,KAAKJ,GACzB,OAAKE,EACAA,EAAQ,GACNG,mBAAmBH,EAAQ,GAAG34B,QAAQ,MAAO,MAD5B,GADH,KA9LT+4B,CAAmB,OAC3BN,EAkMR,SAA4BA,GACxB,IAAMO,EAAU,IAAIC,eACpBD,EAAQE,aAAe,OACvBF,EAAQG,OAAS,WACb,GAAsB,KAAlBH,EAAQI,OAAe,CACvB,IAAM91B,GAAO2zB,OAAW+B,EAAQK,UAC5BhD,EAAQC,cACRD,EAAQC,aAAaxqB,UACzBirB,EAAUzzB,QAEVg2B,MAAM,gCACNvC,EAAU,OAGlBiC,EAAQO,QAAU,WACdD,MAAM,iCAAmCN,EAAQI,QACjDrC,EAAU,OAEdiC,EAAQQ,KAAK,MAAOf,GAAQ,KAAMn6B,KAAKm6B,GAAO,IAAM,MAAQ,IAAIgB,MAAQC,WAAW,GACnFV,EAAQW,OApNJC,CAAmBnB,GAEnB1B,EAAU,MAIlB,SAASA,EAAUzzB,GAAiD,IAA3CkE,EAA2C,uDAA1B,KAAMyO,EAAoB,wDAChEwgB,EAAE,oBAAoBoD,QAAO,SAACt6B,GACtBA,EAAExF,OAAO+/B,MAAM3gC,OAAS,IAE5Bu9B,EAAOn3B,EAAExF,OAAO+/B,MAAM,GACtBC,QAEJtD,EAAE,cAAcuD,OAAM,kBAAMC,OAC5BxD,EAAE,WAAWuD,OAAM,WACfD,OAEJtD,EAAE,sCAAsCoD,QAAO,SAACt6B,GACxCA,EAAExF,OAAO+/B,MAAM3gC,OAAS,IAE5Bw9B,EAAuBp3B,EAAExF,OAAO+/B,MAAM,GACtCI,QAEJzD,EAAE,YAAYuD,OAAM,WACZ3D,EAAQC,cACR6D,YAAW,kBAAM5b,EAAQ8X,EAAQC,aAAcD,EAAQC,aAAa71B,SAAQ,MAEpFg2B,EAAE,eAAeuD,OAAM,WACf3D,EAAQC,cACR6D,YAAW,WACP9C,EAAchB,EAAQC,aAAcD,EAAQC,aAAa71B,MAAOg2B,EAAE,WAAW5hB,MACzE4hB,EAAE,gBAAgB,GAAGnc,WAC1B,MAEXmc,EAAE,WAAW1V,GAAG,WAAW,SAACxhB,GACX,SAATA,EAAEhF,KAA6B,IAAXgF,EAAE2V,QACtBklB,IACA76B,EAAEwe,qBAIV,IAAI5H,EAAe,KACfkkB,EAAU/yB,SAASqtB,eAAe,WAClC2F,EAAWhzB,SAASqtB,eAAe,YACnC4F,EAAajzB,SAASqtB,eAAe,cACrCnZ,EAAW,GACfA,EAASte,KAAKoK,SAASqtB,eAAe,aACtCnZ,EAASte,KAAKoK,SAASqtB,eAAe,iBACtCnZ,EAASte,KAAKoK,SAASqtB,eAAe,iBACtCnZ,EAASte,KAAKoK,SAASqtB,eAAe,qBACtCnZ,EAASte,KAAKoK,SAASqtB,eAAe,qBACtCnZ,EAASte,KAAKoK,SAASqtB,eAAe,gBACtCnZ,EAASte,KAAKoK,SAASqtB,eAAe,eAClC0F,IACAlkB,EAAe,CACXkF,IAAKgf,EACL/e,KAAMgf,EACN/e,OAAQgf,EACR/e,SAAUA,IAGL,OAATlY,IACA+yB,EAAQC,aAAe,IAAIvgB,IACvBzS,EAAMgE,SAASqtB,eAAe,YAAa2D,EAC3C9wB,EAAgByO,EAAY,KAAME,IAI9C,SAASikB,IACD/D,EAAQC,cACR6D,YAAW,WACP9C,EACIhB,EAAQC,aAAcD,EAAQC,aAAa71B,MAC3Cg2B,EAAE,WAAW5hB,MAAO4hB,EAAE,gBAAgB,GAAGnc,WAE9C,GAGX,SAASyf,IACArD,KAELF,EAAK,IAAIgE,YACNrB,OAASsB,EACZjE,EAAGkE,WAAWhE,IAGlB,SAAS+D,IAAqB,MACpBn3B,GAAO2zB,OAAWT,EAAG5uB,QAC3B,UAAAyuB,EAAQC,oBAAR,SAAsBxqB,UACtBuqB,EAAQC,aAAe,IAAIvgB,IAAazS,EAAMgE,SAASqtB,eAAe,YAAa2D,GACnF2B,IAGJ,SAASC,IACAvD,KAELH,EAAK,IAAIgE,YACNrB,OAASwB,EACZnE,EAAGkE,WAAW/D,IAGlB,SAASgE,KAqBT,SAA8CC,GAAQ,MAC5Cz3B,EAAc,GAEpB,GAAIy3B,EAAOC,aAAP,UAAsBxE,EAAQC,oBAA9B,OAAsB,EAAsBhzB,KAAM,WAC9Bs3B,EAAOC,aADuB,IAClD,2BAAwC,KAA7Bpd,EAA6B,QACpC,GAAiB,MAAbA,EAAMqd,GAAY,CAClB,IAAI3d,EAAOM,EAAMsd,KAAKt3B,QAAU,SACJ5G,IAAxB4gB,EAAMsd,KAAKnqB,UACXuM,GAAQM,EAAMsd,KAAKnqB,SAAW,SACR/T,IAAlB4gB,EAAMsd,KAAKv3B,GACX2Z,GAAQM,EAAMsd,KAAKv3B,GAAK,MAExB2Z,GAAQ,SAEZA,GAAQ,gBAGctgB,IAAtBsG,EAAYga,GACZha,EAAYga,GAAMjgB,KAAKugB,EAAMud,KAE7B73B,EAAYga,GAAQ,CAACM,EAAMud,OAjBW,8BAqBlD,IAAK,IAAMzgC,KAAO4I,EAAa,CAC3B,IAAM83B,EAAS93B,EAAY5I,GACrB2gC,EAASC,EAAWF,GAGpBG,EAAkB,CACpB,IAHQF,EAAO,GAIf,IAHQA,EAAO,GAIf,MAAQ55B,SAAK25B,GACb,KAAO15B,SAAO05B,GACd,MAASA,EAAO9hC,QAEpBgK,EAAY5I,GAAO6gC,EAGvB,IAAM38B,EAAW43B,EAAQC,aAEzB,GAAI73B,EAASD,gBAAiB,CACrBC,EAASD,gBAAgBkc,kBAC1BzX,MAEAxE,EAASD,gBAAgBmc,iBACrB1X,KAGR,IAAMwS,EAAKhX,EAASD,gBAAgB68B,YAChCp4B,KAEAwS,IACAA,EAAGtS,YAAcA,EACjBsS,EAAGpW,aA1Efi8B,CAAqCC,KAAKzoB,MAAM0jB,EAAG5uB,SAQvD,SAASuzB,EAAWliC,GAChB,IAAImuB,GAAO/iB,OAAOm3B,UACdtU,EAAM7iB,OAAOm3B,UAOjB,OANAviC,EAAIoH,SAAQ,SAAAwU,GACJA,EAAMuS,IACNA,EAAMvS,GACNA,EAAMqS,IACNA,EAAMrS,MAEP,CAACqS,EAAKE,GAgGjB,SAASqU,EAAeh7B,EAAOi7B,EAAO/C,EAASgD,GAAgB,UACtCl7B,EAAML,SADgC,IAC3D,2BAAoC,KAAzBoqB,EAAyB,QAC1BhqB,EAAOC,EAAMD,KAAKgqB,GACpB3D,EAAQrmB,EAAKqmB,QACZ8U,IACD9U,EAAQA,EAAM+U,gBACY,IAA1B/U,EAAM6J,QAAQgL,IACd/C,EAAQz7B,KAAKsD,GAEbA,EAAKf,KAAKgB,OACVg7B,EAAej7B,EAAKf,KAAKgB,MAAOi7B,EAAO/C,EAASgD,IAVG,wCAYtCl7B,EAAMC,SAZgC,IAY3D,2BAAoC,KAAzBm7B,EAAyB,QAC1Bl8B,EAAOc,EAAMd,KAAKk8B,GACpBhV,EAAQlnB,EAAKknB,aACHhqB,IAAVgqB,IACK8U,IACD9U,EAAQA,EAAM+U,gBACY,IAA1B/U,EAAM6J,QAAQgL,IACd/C,EAAQz7B,KAAKyC,KAnBkC,+BAwB/D,SAAS03B,EAAc54B,EAAU6E,EAAMo4B,GAA6B,IAAtBC,EAAsB,wDAChEG,EAAkB,uBAAyBJ,EAAQ,KAEnD,IAAM/C,EAAU,GACXgD,IACDD,EAAQA,EAAME,eAClBH,EAAen4B,EAAMo4B,EAAO/C,EAASgD,GAGjChD,EAAQx/B,OAAS,GACjBsF,EAAS8N,aAAaosB,GAG1B,IAAMhD,EAAUH,IAChBG,EAAQphB,UAAY,GACpB,IAfgE,iBAe3D,IAAM3M,EAAM,KACPI,EAAIV,SAASuM,cAAc,OACjC7L,EAAE4R,UAAY,sBACd5R,EAAEuM,WAAYC,OAAd,4BAA6B5M,EAAO9I,OAAU8I,EAAOif,SACrD7e,EAAE6R,QAAU,WAAQpb,EAAS8N,aAAa,CAAC3E,KAC3CI,EAAE+zB,aAAe,WACRn0B,EAAO6e,cACR7e,EAAO6e,aAAc,EACrBhoB,EAASiD,eAGjBsG,EAAEg0B,aAAe,WACTp0B,EAAO6e,cACP7e,EAAO6e,aAAc,EACrBhoB,EAASiD,eAGjBi0B,EAAQlc,YAAYzR,IAjBxB,MAAqB2wB,EAArB,eAA8B,IAoB9BsD,IAqFJ,SAAS3D,EAAYxa,EAAQL,EAAOze,EAAUC,EAAUR,EACpDyZ,EAAmB/Y,GAIf,IAAIiE,GAHQ,UAAX0a,IAAuB3e,GAAyB,aAAX2e,KAClCrf,EAAS+X,MACT/X,EAAS+X,KAAK1K,UASF,QANZ1I,EAD6B,IAA7B8U,EAAkB/e,OACR,IAAIo0B,KAAK9uB,EAAS6E,MACM,IAA7B4U,EAAkB/e,OACb+e,EAAkB,GAElB,OAGV4jB,EAAkB14B,EAAQtE,OAAS,IAAMsE,EAAQyjB,SACjDxJ,EAAUja,KAEV62B,IACA6B,EAAkB,+BAEtBG,KASR,SAASH,EAAkB5gB,GACvB,OAAOmb,EAAQQ,eAAevB,qBAAqBpa,GAGvD,SAAS+gB,IACL,OAAO5F,EAAQQ,eAAetB,kBAGlC,SAASC,IACL,OAAOa,EAAQQ,eAAerB,uBAGlC,SAASyE,IACL,OAAO5D,EAAQQ,eAAepB,gBAGlC,SAASlX,EAAQ9f,EAAU6E,GACvB,OAAO+yB,EAAQQ,eAAenB,WAAWj3B,EAAU6E,GAGhD,SAAS+Z,EAAUkP,GACtB,OAAO8J,EAAQQ,eAAeZ,aAAa1J,GAG/CkK,EAAE,YAAYyF,OAAM,WA3BT7F,EAAQQ,eAAenC,mB,6mCCjc1B+B,EAAMjC,WAANiC,EAEK9c,EAAb,WAII,aAAiC,WAArBwiB,EAAqB,uDAAN,MAAM,eAE7Bz9B,KAAK09B,cAAgBD,EACrBz9B,KAAK29B,sBAAwB,GAE7B39B,KAAKsc,EAAImf,YAAW,WAChB,EAAKkC,sBAAwB,CACzB,CAAC,QAAS,SAAA95B,GACN,EAAKuJ,YAET,CAAC,cAAe,SAAAvJ,GACZ,EAAKuJ,aANS,UAWR,EAAKuwB,uBAXG,IAWtB,2BAA0C,OAAjC95B,EAAiC,SACtC,EAAAyP,QAAOkC,iBAAP,gBAA2B3R,KAZT,iCAcvB,IAEH7D,KAAK49B,SAAW,GAChB59B,KAAK8b,YAAc,KA1B3B,oCA6BI,WACI,OAAO9b,KAAK8b,YAAYwD,cA9BhC,qBAiCI,WAAY,OAA2B,MAApBtf,KAAK8b,cAjC5B,uBAmCI,SAAUnc,EAAMk+B,GAA0B,IAAhBC,EAAgB,uDAAN,KAChC99B,KAAK49B,SAASp/B,KAAK,CACfmB,KAAMA,EACN+kB,KAAMmZ,EACNC,QAASA,MAvCrB,gCA2CI,SAAmBn+B,EAAMic,EAASiiB,GAA0B,IAAhBC,EAAgB,uDAAN,KAClD99B,KAAK49B,SAASp/B,KAAK,CACfmB,KAAMA,EACNo+B,UAAU,EACVniB,QAASA,EACT8I,KAAMmZ,EACNC,QAASA,MAjDrB,qBAqDI,WACI,GAAK99B,KAAK8b,YAAV,CAMAlT,SAASwM,KAAK2E,YAAY/Z,KAAK8b,aAPzB,UASQ9b,KAAK29B,uBATb,IASN,2BAA0C,OAAjC95B,EAAiC,SACtC,EAAAyP,QAAOqjB,oBAAP,gBAA8B9yB,KAV5B,8BAaN7D,KAAK8b,YAAc,QAlE3B,kBAqEI,SAAKjY,EAAGC,GAKJ,IAAIk6B,EAAYp1B,SAASuM,cAAc,OAOvC,GANA6oB,EAAUl5B,GAAK,cACfizB,EAAEiG,GAAWC,IAAI,OAAQp6B,EAAI,MAC7Bk0B,EAAEiG,GAAWC,IAAI,MAAOn6B,EAAI,MAC5Bk6B,EAAU3jB,UAAUC,IAAI,gBAGE,MAAtBta,KAAK09B,cAAuB,WAGd19B,KAAK49B,UAHS,yBAGnB/5B,EAHmB,QAKpBgqB,EAAOjlB,SAASuM,cAAc,OAIlC,GAHA0Y,EAAKrY,iBAAiB,QAAS3R,EAAE6gB,MACjCmJ,EAAKxT,UAAUC,IAAI,uBAEfzW,EAAEk6B,SAAU,CACZ,IAAIG,EAAWt1B,SAASuM,cAAc,QACtC+oB,EAAS7jB,UAAYxW,EAAE+X,QAAU,oBAAsB,YACvDiS,EAAK9S,YAAYmjB,GACjBrQ,EAAKhY,YAAaC,OAAlB,wBAAiCjS,EAAElE,MACnCkuB,EAAKrY,iBAAiB,SAAS,SAAAqY,GAC3BhqB,EAAE+X,SAAW/X,EAAE+X,QACf/X,EAAE6gB,KAAKmJ,EAAMhqB,EAAE+X,iBAGnBiS,EAAK5nB,UAAYpC,EAAElE,KACnBkuB,EAAKrY,iBAAiB,QAAS3R,EAAE6gB,MAErCsZ,EAAUjjB,YAAY8S,IAnB1B,2BAA6B,IAHD,oCA0B5BmQ,EAAUnoB,UAAY7V,KAAK09B,cAG/B19B,KAAK8b,YAAckiB,EACnBp1B,SAASwM,KAAK2F,YAAYijB,OA/GlC,M,4BCHO,SAASG,EAAWxqB,GACvB,IAAMyqB,EAAwC,IAAIzT,IAAI,CAClD,CAAC,IAAK,SACN,CAAC,IAAK,QACN,CAAC,IAAK,QACN,CAAC,IAAK,UACN,CAAC,IAAK,YAGV,MAAO,UAAGhX,GAAIrS,QAAQ,YAAY,SAAAuI,GAAC,OAAIu0B,EAAiB9hC,IAAIuN,MAGzD,SAASiM,EAAalX,GAAyD,2BAAvB29B,EAAuB,iCAAvBA,EAAuB,kBAClF,OAA0B,IAAnB39B,EAAQnE,OAAemE,EAAQ,GAChCA,EAAQy/B,QAAO,SAAC1qB,EAAGlU,EAAG/E,GAAP,gBAAgBiZ,GAAhB,OAAoBwqB,EAAWG,OAAO/B,EAAO7hC,EAAI,MAAjD,OAAwD+E,M,4mCCZ1E,SAAS8yB,EAA0BC,GAAwB,IAAjB+L,EAAiB,uDAAN,KACpDC,EAAU,GACd,GAAIhM,EAAM9f,OAAS8f,EAAM7f,KAAqB,GAAd6f,EAAMiM,MAA2B,GAAdjM,EAAMkM,KACrDF,GAAWlO,EAAwBkC,EAAM9f,MAAO6rB,OAC/C,CACD,GAAIA,GAAYA,EAAS5lB,iBACrB6lB,GAAWlO,EAAwBkC,EAAM9f,MAAO6rB,GAAY,KACxDjO,EAAwBkC,EAAM7f,IAAK4rB,OACpC,CACH,IAAII,EAAQrO,EAAwBkC,EAAM7f,IAAK4rB,GAAY,OAC3D,IACII,GAAQC,QAASD,GAAOj/B,WAC1B,MAAOmB,IACT29B,GAAWlO,EAAwBkC,EAAM9f,MAAO6rB,GAAY,IACxDI,EAEU,GAAdnM,EAAMiM,MACND,GAAW,IAAMlO,EAAwBkC,EAAMiM,KAAMF,GACnC,GAAd/L,EAAMkM,OACNF,GAAW,IAAMlO,EAAwBkC,EAAMkM,KAAMH,KACpC,GAAd/L,EAAMkM,OACbF,GAAW,KAAOlO,EAAwBkC,EAAMkM,KAAMH,IAG9D,OAAOC,EAKJ,SAASlO,EAAwBuO,GAAuB,IAAjBN,EAAiB,uDAAN,KACrD,GAAa,OAATM,EAAe,OAAOA,EAC1B,GAAoB,kBAATA,EACP,OAAIA,EACO,OACJ,QACJ,GAAkB,YAAdA,EAAKz+B,MAAoC,oBAAdy+B,EAAKz+B,KAA4B,CACnE,IADmE,EAC7D6H,EAAU42B,EAAK52B,QACjBu2B,EAAU,IAFqD,IAG/Cv2B,GAH+C,IAGnE,2BAA6B,KAAlB62B,EAAkB,QACzBN,GAAWlO,EAAwBwO,EAAOP,GAAY,MAJS,8BAMnE,OAAOC,EAAQ1/B,MAAM,GAAI,GAAK,IAC3B,GAAkB,UAAd+/B,EAAKz+B,MAAkC,kBAAdy+B,EAAKz+B,KAA0B,CAC/D,IAD+D,EACzDqyB,EAASoM,EAAKpM,OAGhB+L,EAAU,IAJiD,IAK3C/L,GAL2C,IAK/D,2BAA4B,KAAjBD,EAAiB,QACxBgM,GAAWjM,EAA0BC,EAAO+L,GAAY,MANG,8BAQ/D,OAAOC,EAAQ1/B,MAAM,GAAI,GAAK,IAC3B,QAAsBX,IAAlB0gC,EAAKE,SAEZ,MAAyB,KAArBF,EAAK1L,kBAA2Ch1B,IAArB0gC,EAAK1L,aAAkD,OAArB0L,EAAK1L,YAC3D,2BAA6B0L,EAAK1L,YAAYvE,OACjD,4CACD,GACJ,QAAoBzwB,IAAhB0gC,EAAKG,aAAsC7gC,IAAd0gC,EAAKI,KAEzC,OAAOJ,EAAKI,KACT,GAAIJ,EAAKthC,aAAe5B,OAE3B,MAAO,2BAA6BkhC,KAAKqC,UAAUL,OAAM1gC,EAAW,GAChE,4CACD,GAAI0gC,EAAKthC,aAAe3C,MAAO,CAElC,IAFkC,EAE9BsO,EAAS,KACTi2B,GAAQ,EAHsB,IAIZN,GAJY,IAIlC,2BAA4B,KAAjBO,EAAiB,QACnBD,IACDj2B,GAAU,MACdA,GAAUonB,EAAwB8O,EAASb,GAC3CY,GAAQ,GARsB,8BAUlC,OAAOj2B,EAAS,KAEhB,OAAO21B,EAIR,SAASzF,EAAyBiG,GAGrC,GAFAA,EAAI/9B,QAAQ,OAAQ,IAER,KAAR+9B,GAAsB,SAARA,EACd,OAAO,KAEX,GAAIA,EAAIze,SAAS,KACb,GAAIye,EAAIxO,WAAW,WAAY,CAC3B,IAAMyO,EAAYD,EAAIrO,UAAU,EAAGqO,EAAI5kC,OAAS,GAChD,GAAI6kC,EAAW,CACX,IAAMC,EAAWD,EAAUE,YAAY,KACvC,GAAID,EAAU,CACV,IAAME,EAAQrG,EACVkG,EAAUtO,UAAU,EAAGuO,IAErBG,EAAQJ,EAAUtO,UAAUuO,GAClC,GAAIE,GAASC,EACT,MAAO,CACHt/B,KAAM,SACNq/B,MAAOA,EACPl/B,SAAUm/B,UAIvB,GAAIL,EAAIxO,WAAW,YAAa,CACnC,IAAMyO,EAAYD,EAAIrO,UAAU,EAAGqO,EAAI5kC,OAAS,GAChD,GAAI6kC,EACA,MAAO,CACHl/B,KAAM,UACNq/B,MAAOrG,EAAyBkG,SAErC,GAAID,EAAIxO,WAAW,WAAY,CAClC,IAAMyO,EAAYD,EAAIrO,UAAU,EAAGqO,EAAI5kC,OAAS,GAChD,GAAI6kC,EACA,MAAO,CACHl/B,KAAM,SACNT,KAAM2/B,QAEX,GAAID,EAAIxO,WAAW,aAAc,CACpC,IAAMyO,EAAYD,EAAIrO,UAAU,EAAGqO,EAAI5kC,OAAS,GAChD,GAAI6kC,EAAW,CACX,IAAMC,EAAWD,EAAUE,YAAY,KACvC,GAAID,EAAU,CACV,IAAMI,EAAeL,EAAUtO,UAAU,EAAGuO,GAC5C,GAAII,EAAa9O,WAAW,MACxB8O,EAAa/e,SAAS,KAAM,CAC5B,IAAMgf,EAAcD,EAAa3O,UAC7B,EAAG2O,EAAallC,OAAS,GAC3B24B,MAAM,KACFyM,EAAWzG,EACbkG,EAAUtO,UAAUuO,IAGlBO,EAAU,GAMhB,GALIF,GACAA,EAAYj+B,SAAQ,SAAAo+B,GAChBD,EAAQthC,KAAK46B,EAAyB2G,OAG1CD,GAAWD,EACX,MAAO,CACHz/B,KAAM,WACN4/B,UAAWF,EACXG,WAAYJ,MAOxC,OAAOR,EAGJ,SAASnG,EAAyBgH,GACrC,GAAIA,QACA,MAAO,OAEX,GAAIA,EAAU3iC,cAAgB5B,OAAQ,CAClC,QAAuBwC,IAAnB+hC,EAAU9/B,KACV,OAAQ8/B,EAAU9/B,MACd,IAAK,SACD,QAA2BjC,IAAvB+hC,EAAU3/B,eACUpC,IAApB+hC,EAAUT,MACV,MAAO,UAAYvG,EACfgH,EAAUT,OACV,KAAOS,EAAU3/B,SAAW,IACpC,MACJ,IAAK,UACD,QAAwBpC,IAApB+hC,EAAUT,MACV,MAAO,WAAavG,EAChBgH,EAAUT,OACV,IACR,MACJ,IAAK,SACD,QAAuBthC,IAAnB+hC,EAAUvgC,KACV,MAAO,UAAYugC,EAAUvgC,KAAO,IACxC,MACJ,IAAK,WACD,QAA4BxB,IAAxB+hC,EAAUF,UAAyB,CAEnC,IADA,IAAIX,EAAM,aACD3kC,EAAI,EAAGA,EAAIwlC,EAAUF,UAAUvlC,OAAQC,IAC5C2kC,GAAOnG,EACHgH,EAAUF,UAAUtlC,IAEpBA,EAAIwlC,EAAUF,UAAUvlC,OAAS,IACjC4kC,GAAO,MAUf,OARAA,GAAO,WACsBlhC,IAAzB+hC,EAAUD,WACVZ,GAAOnG,EACHgH,EAAUD,YAGdZ,GAAO,OACXA,EAAO,KAQvB,OAAO/O,EAAwB4P,GAInC,OAAOA,I,kEC/MJ,SAAS3H,EAAW4H,GACvB,OAAOtD,KAAKzoB,MAAM+rB,EAAWC,GAG1B,SAAS3H,EAAe7zB,GAC3B,OAAOi4B,KAAKqC,UAAUt6B,GAAM,SAACjF,EAAMwW,GAAP,OAAekqB,EAAS1gC,EAAMwW,EAAKvR,MAGnE,SAASw7B,EAAQzgC,EAAcwW,GAC3B,MAAY,QAARxW,GAAkBwW,GAAsB,iBAARA,GAA+B,MAAXA,EAAI,GACjD0mB,KAAKzoB,MAAM+B,EAAKiqB,GAEpBjqB,EAOX,SAASkqB,EAAS1gC,EAAcwW,EAAcmqB,GAC1C,OAAInqB,IALQvU,EAKMuU,EAJE,YAAb,OAAOvU,IAAwB,OAANA,GAAgBA,aAAahH,OAAYgH,aAAam5B,OAI5D5kB,IAAQmqB,KAAa,SAAUnqB,IAAoB,SAAbA,EAAI/V,KAG7D+V,EAFI0mB,KAAKqC,UAAU/oB,GAAK,SAAC1W,EAAGmC,GAAJ,OAAUy+B,EAAS5gC,EAAGmC,EAAGuU,MAN5D,IAAgBvU,I,4mCCdRO,E,QAAeupB,cAEhB,SAAS6U,EAAuBx+B,EAAOy+B,GAA+B,IAArBC,EAAqB,4DAAXtiC,EAC9D,GAAI4D,EAAMD,KAAK,GAAG8C,KAAKC,eAAiB27B,EACpC,MAAO,CACHz+B,MAAOA,EACPD,KAAM2+B,GAGV,IADG,EACGv3B,EAAS,CACXnH,WAAO5D,EACP2D,UAAM3D,GAHP,IAKoB4D,EAAML,SAL1B,IAKH,2BAAsC,KAA3BwQ,EAA2B,QAC5B1O,EAAQzB,EAAMD,KAAKoQ,GACzB,QAAyB/T,IAArBqF,EAAMzC,KAAKgB,OAA4C,OAArByB,EAAMzC,KAAKgB,MAAjD,WAC0ByB,EAAMzC,KAAKgB,MAAML,SAD3C,IACI,2BAAgD,KAArC0P,EAAqC,QACtCtP,EAAO0B,EAAMzC,KAAKgB,MAAMD,KAAKsP,GACnC,GAAItP,aAAgBK,EAAY,CAC5B,IAAMu+B,EAAeH,EACjBz+B,EAAKf,KAAKgB,MAAOy+B,EAAU1+B,GAE/B,QAA2B3D,IAAvBuiC,EAAa3+B,MACb,OAAO2+B,IARvB,iCAPD,8BAoBH,OAAOx3B,EAKR,SAAS+hB,EAAoBvpB,EAAOi/B,GAAY,UACnCj/B,GADmC,IACnD,2BAAuB,KAAZjC,EAAY,QACnB,GAAIA,EAAEW,KAAKwgB,SAAS,SAAWggB,SAASnhC,EAAEyF,cAAgBy7B,EAAW77B,GACjE,OAAOrF,GAHoC,8BAOnD,OADAsM,QAAQ80B,KAAK,mCACN,KAiBH,SAASniB,EAAuBha,GAEpC,GAAIA,aAAmBC,MACnB,OACID,EAAQE,KAAKC,aAAe,IAC5BH,EAAQI,GADRJ,QAHc,EAQf,GAAIA,aAAmBS,SAC1B,OACIT,EAAQE,KAAKC,aAAe,IAC5BH,EAAQO,UAAY,IACpBP,EAAQI,GAAK,KAZC,EAef,GAAIJ,aAAmBzC,KAAM,CAChC,IAAIgD,GAhBc,EAmBlB,OAF0B,OAAtBP,EAAQO,gBAA4C9G,IAAtBuG,EAAQO,YACtCA,EAAYP,EAAQO,WAEpBP,EAAQE,KAAKC,aAAe,IAC5BI,EADAP,OAGAA,EAAQI,GAGhB,MACIM,cAQD,SAAS+mB,EAAwBlrB,EAAMwpB,EAAaP,GAEvD,IAAKO,EAAYzF,IAAI/jB,EAAK2Q,KACtB,OAAO,KAEX,GAAI6Y,EAAYzF,IAAI/jB,EAAK8Q,KACrB,OAAO9Q,EAGX,IAAM6/B,EAAY5W,EAAWxoB,MAAMT,EAAK8Q,KAAK7M,YAC7C,IAAKulB,EAAYzF,IAAI8b,GACjB,OAAO,KAGX,IAAMC,EAAWplC,OAAOk6B,OAAO,GAAI50B,GAGnC,OAFA8/B,EAAShvB,IAAM+uB,EAERC,EAGJ,SAASniB,EAA2BoiB,EAASviB,GAChD,IAAMwiB,EAAaxiB,EAAK2U,MAAM,KAExBoN,EAAW76B,OAAOs7B,EAAW,IAC7B/uB,EAAWvM,OAAOs7B,EAAW,IAC7B7vB,EAAUzL,OAAOs7B,EAAW,IAC5B3xB,EAAU3J,OAAOs7B,EAAW,IAE9B/3B,EAAS,CACT+L,YAAQ9W,EACRuG,aAASvG,GAGT4D,EAAQi/B,EACZ,GAAIR,EAAW,EAAG,CACd,IAAMU,EAAcX,EAAuBx+B,EAAOy+B,GAClD,QAA0BriC,IAAtB+iC,EAAYn/B,MACZ,MAAM,IAAIo/B,MAGdj4B,EAAS,CACL+L,OAFJlT,EAAQm/B,EAAYn/B,MAGhB2C,QAASw8B,EAAYp/B,MAI7B,IAAI0B,OAAQrF,EA6BZ,OA5BkB,IAAd+T,QAA6B/T,IAAV4D,IACnByB,EAAQzB,EAAMD,KAAKoQ,GACnBhJ,EAAS,CACL+L,OAAQlT,EACR2C,QAASlB,KAIA,IAAb4N,QAA4BjT,IAAVqF,GAA4C,OAArBA,EAAMzC,KAAKgB,MAEpDmH,EAAS,CACL+L,OAAQzR,EAAMzC,KAAKgB,MACnB2C,QAASlB,EAAMzC,KAAKgB,MAAMD,KAAKsP,KAEf,IAAb9B,QAA4BnR,IAAVqF,GAA4C,OAArBA,EAAMzC,KAAKgB,MAE3DmH,EAAS,CACL+L,OAAQzR,EAAMzC,KAAKgB,MACnB2C,QAASlB,EAAMzC,KAAKgB,MAAMd,KAAKqO,KAEf,IAAbA,QAA4BnR,IAAVqF,IAEzB0F,EAAS,CACL+L,OAAQlT,EACR2C,QAAS3C,EAAMd,KAAKqO,KAIrBpG,EASJ,SAAS6H,EAA4B8c,GACxC,IAAIhd,EACJ,GAAIgd,aAAgB5rB,MAAsB,uBAAd4rB,EAAKztB,KAA+B,CAC5D,IAAIqH,OAAStJ,EACT0vB,EAAKpmB,SACLA,EAAS7M,MAAMizB,EAAKpmB,OAAOhN,SAE/BoW,EAAW,CACPpJ,OAAQA,EACRyJ,SAAU,EACVC,SAAU,GAGd,IAAK,IAAIzW,EAAI,EAAGmzB,EAAKpmB,QAAU/M,EAAImzB,EAAKpmB,OAAOhN,OAAQC,IACnDmW,EAASpJ,OAAO/M,GAAK,CAAE8U,GAAI,EAAGC,GAAI,QAEtCoB,EAAW,CAAErB,GAAI,EAAGC,GAAI,EAAGyB,SAAU,EAAGC,SAAU,GAKtD,OAUG,SAA8B0c,EAAMhd,GACnCgd,aAAgBlpB,MAChBkpB,EAAK9sB,KAAKyC,MAAMnC,WAAWwP,SAAWA,EACjCgd,aAAgB1oB,SACrB0oB,EAAK9sB,KAAKe,KAAKT,WAAWwP,SAAWA,EAChCgd,aAAgB5rB,KACrB4rB,EAAK9sB,KAAKM,WAAWwP,SAAWA,EACb,uBAAdgd,EAAKztB,KACVytB,EAAKxsB,WAAWN,KAAKM,WAAWwP,SAAWA,EAEtCgd,EAAKxsB,aACVwsB,EAAKxsB,WAAWwP,SAAWA,GAvB/BuwB,CAAqBvT,EAAMhd,GAEpBA,EA8BJ,SAASC,EAAqB+c,GAAM,UACvC,OAAIA,aAAgBlpB,MACTkpB,EAAK9sB,KAAKyC,MAAMnC,WAAWwP,SAClCgd,aAAgB1oB,SACT0oB,EAAK9sB,KAAKe,KAAKT,WAAWwP,SACjCgd,aAAgB5rB,KACT4rB,EAAK9sB,KAAKM,WAAWwP,SACb,wBAAfgd,aAAA,EAAAA,EAAMztB,MACCytB,SAAP,UAAOA,EAAMxsB,kBAAb,iBAAO,EAAkBN,YAAzB,iBAAO,EAAwBM,kBAA/B,aAAO,EAAoCwP,SAE3Cgd,WAAMxsB,WACCwsB,EAAKxsB,WAAWwP,cAD3B,EAWG,SAASiQ,EAAwB+M,GAChCA,aAAgBlpB,cACTkpB,EAAK9sB,KAAKyC,MAAMnC,WAAWwP,SAClCgd,aAAgB1oB,iBACT0oB,EAAK9sB,KAAKe,KAAKT,WAAWwP,SACjCgd,aAAgB5rB,aACT4rB,EAAK9sB,KAAKM,WAAWwP,SACb,wBAAfgd,aAAA,EAAAA,EAAMztB,cACCytB,EAAKxsB,WAAWN,KAAKM,WAAWwP,SAEvCgd,WAAMxsB,mBACCwsB,EAAKxsB,WAAWwP,W,giCChQvB,SAASiP,EAAqBlb,EAAM8f,GAAiC,IAA3B2c,EAA2B,uDAAN,KACnE,SAASC,EAAiBv/B,EAAOL,GAA+B,IAAxB6/B,EAAwB,uDAAN,KAC9B,OAApBA,IACAA,EAAkB,IAAI7hB,KAFkC,UAIvChe,GAJuC,IAI5D,2BAA4B,KAAjBoqB,EAAiB,QAClBhqB,EAAOC,EAAMD,KAAKgqB,GACxB,QAAa3tB,IAAT2D,IAAsBy/B,EAAgBvc,IAAIljB,EAAKgD,GAAGpF,YAAtD,CAIA,IAAMwJ,EAASwb,EAAK5iB,EAAMC,GAG1B,IAAe,IAAXmH,EAAkB,CAElB,GAAIpH,EAAK1B,OAAOwgB,SAAS,SAAU,CAC/B,IAAMpd,EAAQ1B,EAAK8C,KAAKlD,MAAMI,EAAKmD,gBACD9G,IAA9BqF,EAAMgnB,WAAW1oB,EAAKgD,KACtBw8B,EAAiBv/B,EAAOyB,EAAMgnB,WAAW1oB,EAAKgD,IAAKy8B,GAI3D,GAAIz/B,EAAKf,KAAKgB,MAAO,CACjB,IAAMyB,EAAQ1B,EAAKf,KAAKyC,WACVrF,IAAVqF,QAAgDrF,IAAzBqF,EAAMgnB,YAAY,GACzC8W,EAAiBx/B,EAAKf,KAAKgB,MAAOyB,EAAMgnB,YAAY,IAEpD8W,EAAiBx/B,EAAKf,KAAKgB,MAAOD,EAAKf,KAAKgB,MAAML,UAI1D2/B,GACAA,EAAmBv/B,EAAMC,GAE7Bw/B,EAAgBjnB,IAAIxY,EAAKgD,GAAGpF,cAlC4B,+BAqChE4hC,EAAiB18B,EAAMA,EAAKlD,SAkIzB,SAAS8/B,EAAmB58B,EAAMpB,EAAOvC,GAA0B,IAApBwgC,EAAoB,uDAAJ,GAClE,GAAIA,EAAc5tB,SAAS5S,IAASA,EAAKI,WAAWN,KAAKM,WAAW4qB,SAChE,MAAO,GAGXwV,EAAcjjC,KAAKyC,GAEnB,IAAIiI,EAAS,GAEb,SAAS6I,EAAIlR,GACT,OAAO2C,EAAM9B,MAAMb,EAAEkR,KAEzB,SAASH,EAAI/Q,GACT,OAAO2C,EAAM9B,MAAMb,EAAE+Q,KAEzB,SAAS8vB,EAAO5/B,GACZ,GAAiB,cAAbA,EAAK1B,KAAsB,CAC3B,IAAM8wB,EAAWtsB,EAAKvD,WAAW8vB,QAAQrvB,EAAKT,WAAWN,MACzD,OAAQmwB,GAA8B,SAAlBA,EAAS9wB,KAEjC,OAAO,EAIX,IAAIuhC,GAAoB,EAAOC,GAAqB,EAiBpD,IAhBK3gC,EAAKsQ,eAAiBQ,EAAI9Q,GAAMb,KAAKwgB,SAAS,UAC9C3f,EAAKyQ,eAAiBE,EAAI3Q,GAAMb,KAAKwgB,SAAS,UAC3C3f,EAAKyQ,cAAcmf,WAAW,QAChB,cAAlBjf,EAAI3Q,GAAMb,MACVshC,EAAO9vB,EAAI3Q,OACX0gC,GAAoB,IACnB1gC,EAAKsQ,eAAiBQ,EAAI9Q,GAAMb,KAAKwgB,SAAS,SAC9C3f,EAAKyQ,eAAiBE,EAAI3Q,GAAMb,KAAKwgB,SAAS,SAC7B,cAAlB7O,EAAI9Q,GAAMb,MACVshC,EAAO3vB,EAAI9Q,OACX2gC,GAAqB,GAEzB14B,EAAO1K,KAAKyC,GAIR0gC,GAAqBC,IAA6C,IAAvBA,EAC3C,OAAO14B,EAGX,SAAS24B,EAAa5gC,GAClB,IAAM6gC,EAAW,GAEjB,GAAIH,EAAmB,CACnB,IAAMI,EAAYnwB,EAAI3Q,GAGtB,GAAsB,cAAlB8gC,EAAU3hC,KAAsB,CAChC,IAAMT,EAAOsB,EAAKyQ,cACZswB,EAAcD,EAAU1gC,WAAWuD,KAEzCo9B,EAAYtgC,MAAMC,SAAQ,SAAAsgC,GACtBA,EAAOjgC,MAAML,SAAQ,SAAAd,GACjB,IAAMiB,EAAOmgC,EAAOvgC,MAAMb,EAAEkR,KACX,cAAbjQ,EAAK1B,MAAwB0B,EAAKT,WAAWN,OAASpB,IACtDuJ,EAASA,EAAOg5B,OAAOV,EAAmBQ,EAAaC,EAAQphC,EAAG4gC,WAMlF,GAAIC,EAAOK,GACPv+B,EAAMxB,MAAML,SAAQ,SAAAd,GACZA,EAAEkR,KAAOgwB,EAAUj9B,KACnBg9B,EAAStjC,KAAKqC,GACTA,EAAEQ,WAAWN,KAAKM,WAAW4qB,UAC9B/iB,EAAO1K,KAAKqC,WAIrB,CACH,IAAMkhC,EAAU3hC,KAAKwgB,SAAS,WACzB3f,EAAKyQ,gBAAkBzQ,EAAKyQ,cAAcmf,WAAW,OACtD,OACJ,GAAIkR,EAAU1gC,WAAW4C,aACrB,OACJ,IAAM2nB,EAAO3qB,EAAKyQ,cAAcsf,UAAU,GAC1CxtB,EAAMxB,MAAML,SAAQ,SAAAd,GACZA,EAAEkR,KAAOgwB,EAAUj9B,IAAMjE,EAAE0Q,eAAiB,OAASqa,IACrDkW,EAAStjC,KAAKqC,GACTA,EAAEQ,WAAWN,KAAKM,WAAW4qB,UAC9B/iB,EAAO1K,KAAKqC,QAMhC,GAAI+gC,EAAoB,CACpB,IAAMG,EAAYhwB,EAAI9Q,GAGtB,GAAsB,cAAlB8gC,EAAU3hC,KAAsB,CAChC,IAAMT,EAAOsB,EAAKsQ,cACZywB,EAAcD,EAAU1gC,WAAWuD,KAEzCo9B,EAAYtgC,MAAMC,SAAQ,SAAAsgC,GACtBA,EAAOjgC,MAAML,SAAQ,SAAAd,GACjB,IAAMiB,EAAOmgC,EAAOvgC,MAAMb,EAAE+Q,KACX,cAAb9P,EAAK1B,MAAwB0B,EAAKT,WAAWN,MAAQpB,IACrDuJ,EAASA,EAAOg5B,OAAOV,EAAmBQ,EAAaC,EAAQphC,EAAG4gC,WAMlF,GAAIC,EAAOK,GACPv+B,EAAMxB,MAAML,SAAQ,SAAAd,GACZA,EAAE+Q,KAAOmwB,EAAUj9B,KACnBg9B,EAAStjC,KAAKqC,GACdqI,EAAO1K,KAAKqC,WAGjB,CACH,IAAMkhC,EAAU3hC,KAAKwgB,SAAS,UAAa3f,EAAKsQ,cAC5C,OAEJ,IAAMqa,EAAO3qB,EAAKsQ,cAAcyf,UAAU,GAC1CxtB,EAAMxB,MAAML,SAAQ,SAAAd,GACZA,EAAE+Q,KAAOmwB,EAAUj9B,IAAMjE,EAAE6Q,eAAiB,MAAQka,IACpDkW,EAAStjC,KAAKqC,GACdqI,EAAO1K,KAAKqC,QAM5B,cAAoBihC,EAApB,eACID,EADY,MAOpB,OAFAA,EAAa5gC,GAENiI,EAQJ,SAASi5B,EAAsBC,GAClC,IAAIC,EAAQ,GACNZ,EAAgB,GAoBtB,OAlBAW,EAAU1gC,MAAMC,SAAQ,SAAA6B,GAEpBA,EAAMxB,MAAML,SAAQ,SAAAd,GAChB,IAAM4e,EAAO+hB,EAAmBY,EAAW5+B,EAAO3C,EAAG4gC,GACjDhiB,EAAKhlB,OAAS,GACd4nC,EAAM7jC,KAAKihB,MAInBjc,EAAM9B,MAAMC,SAAQ,SAAAlC,GAChB,GAAc,cAAVA,EAAEW,KAAsB,CACxB,IAAM0K,EAAIq3B,EAAsB1iC,EAAE4B,WAAWuD,MAC7Cy9B,EAAQA,EAAMH,OAAOp3B,UAM1Bu3B,EAQJ,SAASxoB,EAAqBjV,GACjC,IAAM4a,EAAmB,GAqBzB,OApBqB2iB,EAAsBv9B,GAG9BjD,SAAQ,SAAA8d,GACjB,IADyB,EACrB6iB,GAAc,EADO,IAER9iB,GAFQ,2BAEd+iB,EAFc,YAGF9iB,GAHE,IAGrB,2BAAyB,KAAdxe,EAAc,QACrB,GAAIshC,EAAGvd,IAAI/jB,GAAO,CACdwe,EAAK9d,SAAQ,SAAAd,GAAC,OAAI0hC,EAAGjoB,IAAIzZ,MACzByhC,GAAc,EACd,QAPa,8BAUrB,GAAIA,EACA,eATR,2BAAmC,iBAFV,8BAapBA,GACD9iB,EAAiBhhB,KAAK,IAAIkhB,IAAID,OAG/BD,E,6HC/WJ,SAASgN,EAAYltB,GACxB,MAAmB,YAAf,OAAOA,IAA4B,OAARA,EAAqBA,EAChD1E,MAAMgD,QAAQ0B,GACPA,EAAIqX,KAAI,SAAA3Z,GAAC,OAAIwvB,EAASxvB,MAEtBrB,OAAO6mC,YAAYhW,GAAS,OAAI7wB,OAAO+7B,QAAQp4B,MAgBvD,SAAS6V,EACZ/U,GAIwB,IAHxB0E,EAGwB,uDAHnB,GACLuV,EAEwB,uDAFF,GACtBpF,EACwB,4DADG9W,EAErBuG,EAAUkE,SAASuM,cAAc/U,GAUvC,MATW,KAAP0E,IACAJ,EAAQI,GAAKA,GACbuV,IAAc,IACdA,EAAU1Y,SAAQ,SAAA8gC,GACT/9B,EAAQ2V,UAAUqoB,SAASD,IAC5B/9B,EAAQ2V,UAAUC,IAAImoB,MAE9BxtB,GACAA,EAAO8F,YAAYrW,GAChBA,EAMJ,SAASwzB,EAAwB54B,EAAQqjC,GAE5C,IADA,IAAM3lC,EAAIsC,EACV,MAAyB3D,OAAO+7B,QAAQiL,GAAxC,eAAgD,uBAApC9mC,EAAoC,KAA/Bsa,EAA+B,KACtCta,KAAOyD,IAAMtC,EAAEnB,GAAOsa,GAEhC,OAAOnZ,I,mBCvDX,OAmCA,SAAU4lC,GAER,aAEA,IAAIC,EAAO,SAASh/B,GAClB,MAAsC,IAA9B4B,KAAKq9B,IAAIj/B,GAAK4B,KAAKq9B,KAAKj/B,KAG9Bk/B,EAAO,SAASl/B,GAClB,MAAsC,IAA9B4B,KAAKq9B,IAAIj/B,GAAK4B,KAAKq9B,KAAKj/B,KAqD9Bm/B,EAAc,WAChB,MAAMC,YAAY,kBAUpB,SAASC,EAAS/5B,EAAGC,GAEnB,IAAI+5B,EAAK19B,KAAK0F,IAAIhC,GACdi6B,EAAK39B,KAAK0F,IAAI/B,GAElB,OAAU,IAAND,EACK1D,KAAK49B,IAAID,GAGR,IAANh6B,EACK3D,KAAK49B,IAAIF,GAGdA,EAAK,KAAQC,EAAK,IACa,GAA1B39B,KAAK49B,IAAIl6B,EAAIA,EAAIC,EAAIA,GAmCvB3D,KAAK49B,IAAIl6B,EAAI1D,KAAK69B,IAAI79B,KAAKgF,MAAMrB,EAAGD,KAyH7C,SAASo6B,EAAQp6B,EAAGC,GAElB,KAAMpJ,gBAAgBujC,GACpB,OAAO,IAAIA,EAAQp6B,EAAGC,GAGxB,IAAIo6B,EA5HM,SAASr6B,EAAGC,GAEtB,IAAIo6B,EAAI,CAAC,GAAM,EAAG,GAAM,GAExB,GAAIr6B,QACFq6B,EAAM,GACEA,EAAM,GAAI,OACb,QAAUrlC,IAANiL,EACTo6B,EAAM,GAAIr6B,EACVq6B,EAAM,GAAIp6B,OAEV,cAAeD,GAEb,IAAK,SAEH,GAAI,OAAQA,GAAK,OAAQA,EACvBq6B,EAAM,GAAIr6B,EAAM,GAChBq6B,EAAM,GAAIr6B,EAAM,QACX,GAAI,QAASA,GAAK,QAASA,EAAG,CACnC,IAAKxD,OAAOwa,SAAShX,EAAO,MAAMxD,OAAOwa,SAAShX,EAAO,KACvD,OAAOo6B,EAAkB,SAE3BC,EAAM,GAAIr6B,EAAO,IAAI1D,KAAK69B,IAAIn6B,EAAO,KACrCq6B,EAAM,GAAIr6B,EAAO,IAAI1D,KAAKg+B,IAAIt6B,EAAO,UAChC,GAAI,MAAOA,GAAK,QAASA,EAAG,CACjC,IAAKxD,OAAOwa,SAAShX,EAAK,IAAMxD,OAAOwa,SAAShX,EAAO,KACrD,OAAOo6B,EAAkB,SAE3BC,EAAM,GAAIr6B,EAAK,EAAI1D,KAAK69B,IAAIn6B,EAAO,KACnCq6B,EAAM,GAAIr6B,EAAK,EAAI1D,KAAKg+B,IAAIt6B,EAAO,UACb,IAAbA,EAAE1O,QACX+oC,EAAM,GAAIr6B,EAAE,GACZq6B,EAAM,GAAIr6B,EAAE,IAEZ65B,IAEF,MAEF,IAAK,SAEHQ,EAAM,GACEA,EAAM,GAAI,EAElB,IAAIE,EAASv6B,EAAEw6B,MAAM,yCACjBC,EAAO,EACPC,EAAQ,EAEG,OAAXH,GACFV,IAGF,IAAK,IAAItoC,EAAI,EAAGA,EAAIgpC,EAAOjpC,OAAQC,IAAK,CAEtC,IAAI2O,EAAIq6B,EAAOhpC,GAEL,MAAN2O,GAAmB,OAANA,GAAoB,OAANA,IAEd,MAANA,EACTu6B,IACe,MAANv6B,EACTw6B,IACe,MAANx6B,GAAmB,MAANA,GAElBu6B,EAAOC,IAAU,GACnBb,IAGoB,MAAlBU,EAAOhpC,EAAI,IAAeoM,MAAM48B,EAAOhpC,EAAI,IAI7C8oC,EAAM,IAAKnxB,YAAYwxB,EAAQ,EAAI,IAAM,IAAM,MAH/CL,EAAM,IAAKnxB,YAAYwxB,EAAQ,EAAI,IAAM,IAAMH,EAAOhpC,EAAI,IAC1DA,KAIFkpC,EAAOC,EAAQ,KAIXD,EAAOC,IAAU,GAAK/8B,MAAMuC,KAC9B25B,IAGoB,MAAlBU,EAAOhpC,EAAI,IAAgC,MAAlBgpC,EAAOhpC,EAAI,IACtC8oC,EAAM,IAAKnxB,YAAYwxB,EAAQ,EAAI,IAAM,IAAMx6B,GAC/C3O,KAEA8oC,EAAM,IAAKnxB,YAAYwxB,EAAQ,EAAI,IAAM,IAAMx6B,GAEjDu6B,EAAOC,EAAQ,IAKfD,EAAOC,EAAQ,GACjBb,IAEF,MAEF,IAAK,SACHQ,EAAM,GAAI,EACVA,EAAM,GAAIr6B,EACV,MAEF,QACE65B,IAQN,OALIl8B,MAAM08B,EAAM,KAAM18B,MAAM08B,EAAM,IAK3BA,EAaCpvB,CAAMjL,EAAGC,GAEjBpJ,KAAS,GAAIwjC,EAAM,GACnBxjC,KAAS,GAAIwjC,EAAM,GAGrBD,EAAQtnC,UAAY,CAElB,GAAM,EACN,GAAM,EAON,KAAQ,WAEN,IAAIkP,EAAMnL,KAAU,MAEpB,OAAO,IAAIujC,EACHvjC,KAAS,GAAImL,EACbnL,KAAS,GAAImL,IAQvB,IAAO,SAAShC,EAAGC,GAEjB,IAAIo6B,EAAI,IAAID,EAAQp6B,EAAGC,GAGvB,OAAIpJ,KAAiB,cAAOwjC,EAAc,aACjCD,EAAa,IAIlBvjC,KAAiB,cAAOwjC,EAAc,aACjCD,EAAkB,SAGpB,IAAIA,EACHvjC,KAAS,GAAIwjC,EAAM,GACnBxjC,KAAS,GAAIwjC,EAAM,KAQ7B,IAAO,SAASr6B,EAAGC,GAEjB,IAAIo6B,EAAI,IAAID,EAAQp6B,EAAGC,GAGvB,OAAIpJ,KAAiB,cAAOwjC,EAAc,aACjCD,EAAa,IAIlBvjC,KAAiB,cAAOwjC,EAAc,aACjCD,EAAkB,SAGpB,IAAIA,EACHvjC,KAAS,GAAIwjC,EAAM,GACnBxjC,KAAS,GAAIwjC,EAAM,KAQ7B,IAAO,SAASr6B,EAAGC,GAEjB,IAAIo6B,EAAI,IAAID,EAAQp6B,EAAGC,GAGvB,OAAKpJ,KAAiB,cAAOwjC,EAAU,UAASxjC,KAAa,UAAOwjC,EAAc,aACzED,EAAa,IAIlBvjC,KAAiB,cAAOwjC,EAAc,aACjCD,EAAkB,SAIX,IAAZC,EAAM,IAA0B,IAAfxjC,KAAS,GACrB,IAAIujC,EAAQvjC,KAAS,GAAIwjC,EAAM,GAAG,GAGpC,IAAID,EACHvjC,KAAS,GAAIwjC,EAAM,GAAIxjC,KAAS,GAAIwjC,EAAM,GAC1CxjC,KAAS,GAAIwjC,EAAM,GAAIxjC,KAAS,GAAIwjC,EAAM,KAQpD,IAAO,SAASr6B,EAAGC,GAEjB,IAAIo6B,EAAI,IAAID,EAAQp6B,EAAGC,GAGvB,GAAKpJ,KAAa,UAAOwjC,EAAU,UAASxjC,KAAiB,cAAOwjC,EAAc,aAChF,OAAOD,EAAa,IAItB,GAAIvjC,KAAiB,cAAOwjC,EAAU,SACpC,OAAOD,EAAkB,SAI3B,GAAIvjC,KAAa,UAAOwjC,EAAc,aACpC,OAAOD,EAAc,KAGvBp6B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEb,IAEI8K,EAAGjH,EAFHwF,EAAIm6B,EAAM,GACVl6B,EAAIk6B,EAAM,GAGd,OAAI,IAAMl6B,EAED,IAAIi6B,EAAQp6B,EAAIE,EAAGD,EAAIC,GAG5B5D,KAAK0F,IAAI9B,GAAK5D,KAAK0F,IAAI7B,GAKlB,IAAIi6B,GACFp6B,GAJTtF,EAAIwF,EAAIC,GAISF,IAHjB0B,EAAIzB,EAAIxF,EAAIyF,IAIHF,EAAIvF,EAAIsF,GAAK2B,GAOf,IAAIy4B,GACFp6B,EAAIC,GAJbvF,EAAIyF,EAAID,KACRyB,EAAIxB,EAAIzF,EAAIwF,IAIHD,EAAID,EAAItF,GAAKiH,IAS1B,IAAO,SAAS3B,EAAGC,GAEjB,IAAIo6B,EAAI,IAAID,EAAQp6B,EAAGC,GAKvB,GAHAD,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAETwjC,EAAU,SACZ,OAAOD,EAAa,IAItB,GAAgB,IAAZC,EAAM,GAAS,CAEjB,GAAU,IAANp6B,EAEF,OAAO,IAAIm6B,EAAQ99B,KAAKmN,IAAIzJ,EAAGq6B,EAAM,IAAI,GAEpC,GAAU,IAANr6B,EAET,QAASq6B,EAAM,GAAI,EAAI,GAAK,GAC1B,KAAK,EACH,OAAO,IAAID,EAAQ99B,KAAKmN,IAAIxJ,EAAGo6B,EAAM,IAAI,GAC3C,KAAK,EACH,OAAO,IAAID,EAAQ,EAAG99B,KAAKmN,IAAIxJ,EAAGo6B,EAAM,KAC1C,KAAK,EACH,OAAO,IAAID,GAAS99B,KAAKmN,IAAIxJ,EAAGo6B,EAAM,IAAI,GAC5C,KAAK,EACH,OAAO,IAAID,EAAQ,GAAI99B,KAAKmN,IAAIxJ,EAAGo6B,EAAM,MAwBjD,GAAU,IAANr6B,GAAiB,IAANC,GAAWo6B,EAAM,GAAI,GAAKA,EAAM,IAAK,EAClD,OAAOD,EAAc,KAGvB,IAAIO,EAAMr+B,KAAKgF,MAAMrB,EAAGD,GACpB46B,EAAMb,EAAS/5B,EAAGC,GAItB,OAFAD,EAAI1D,KAAKq9B,IAAIU,EAAM,GAAIO,EAAMP,EAAM,GAAIM,GACvC16B,EAAIo6B,EAAM,GAAIO,EAAMP,EAAM,GAAIM,EACvB,IAAIP,EACHp6B,EAAI1D,KAAK69B,IAAIl6B,GACbD,EAAI1D,KAAKg+B,IAAIr6B,KAQvB,KAAQ,WAEN,IAII46B,EAAIC,EAJJ96B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GACbwM,EAAIxM,KAAU,MAIlB,GAAImJ,GAAK,EAAG,CAEV,GAAU,IAANC,EACF,OAAO,IAAIm6B,EAAQ99B,KAAKsE,KAAKZ,GAAI,GAGnC66B,EAAK,GAAMv+B,KAAKsE,KAAK,GAAOyC,EAAIrD,SAEhC66B,EAAKv+B,KAAK0F,IAAI/B,GAAK3D,KAAKsE,KAAK,GAAKyC,EAAIrD,IASxC,OALE86B,EADE96B,GAAK,EACF,GAAM1D,KAAKsE,KAAK,GAAOyC,EAAIrD,IAE3B1D,KAAK0F,IAAI/B,GAAK3D,KAAKsE,KAAK,GAAKyC,EAAIrD,IAGjC,IAAIo6B,EAAQS,EAAI56B,EAAI,GAAK66B,EAAKA,IAQvC,IAAO,WAEL,IAAIC,EAAMz+B,KAAKq9B,IAAI9iC,KAAS,IAK5B,OAHIA,KAAS,GAGN,IAAIujC,EACHW,EAAMz+B,KAAK69B,IAAItjC,KAAS,IACxBkkC,EAAMz+B,KAAKg+B,IAAIzjC,KAAS,MAWlC,MAAS,WAQP,IAAImJ,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,OAAO,IAAIujC,EACH99B,KAAK0+B,MAAMh7B,GAAK1D,KAAK69B,IAAIl6B,GAjhBzB,SAASvF,GACnB,IAAIugC,EAAQ3+B,KAAKiF,GAAG,EACpB,GAAI7G,GAAKugC,GAASvgC,EAAIugC,EACpB,OAAQ3+B,KAAK69B,IAAIz/B,GAAK,EAGxB,IAAIwgC,EAAKxgC,EAAIA,EACb,OAAOwgC,GACGA,GACL,EAAE,GAAKA,IACJ,EAAE,IAAMA,GACP,EAAE,MAAQA,IACP,EAAE,QAAUA,GACX,EAAE,WAAaA,IACZ,EAAE,YAAcA,GACf,EAAE,qBAPf,IAygBoCC,CAAMl7B,GACpC3D,KAAKq9B,IAAI35B,GAAK1D,KAAKg+B,IAAIr6B,KAQjC,IAAO,WAEL,IAAID,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAMjB,OAAO,IAAIujC,EACHL,EAAS/5B,EAAGC,GACZ3D,KAAKgF,MAAMrB,EAAGD,KAQxB,IAAO,WAEL,OAthBiBtF,EAshBJ7D,KAAS,GAthBF8D,EAshBK9D,KAAS,GAphBhCmJ,EAAI1D,KAAK0F,IAAItH,GACbuF,EAAI3D,KAAK0F,IAAIrH,GAEbqF,EAAI,KAAQC,EAAI,IACX3D,KAAKsE,KAAKZ,EAAIA,EAAIC,EAAIA,IAG3BD,EAAIC,GACND,EAAIC,EACJA,EAAIvF,EAAIC,GAERsF,EAAItF,EAAID,EAEHsF,EAAI1D,KAAKsE,KAAK,EAAIX,EAAIA,IAfnB,IAASvF,EAAGC,EAElBqF,EACAC,GA2hBJ,IAAO,WAEL,OAAO3D,KAAKgF,MAAMzK,KAAS,GAAGA,KAAS,KAQzC,IAAO,WAIL,IAAImJ,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,OAAO,IAAIujC,EACH99B,KAAKg+B,IAAIt6B,GAAK05B,EAAKz5B,GACnB3D,KAAK69B,IAAIn6B,GAAK45B,EAAK35B,KAQ7B,IAAO,WAIL,IAAID,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,OAAO,IAAIujC,EACH99B,KAAK69B,IAAIn6B,GAAK05B,EAAKz5B,IAClB3D,KAAKg+B,IAAIt6B,GAAK45B,EAAK35B,KAQ9B,IAAO,WAIL,IAAID,EAAI,EAAInJ,KAAS,GACjBoJ,EAAI,EAAIpJ,KAAS,GACjBsJ,EAAI7D,KAAK69B,IAAIn6B,GAAK05B,EAAKz5B,GAE3B,OAAO,IAAIm6B,EACH99B,KAAKg+B,IAAIt6B,GAAKG,EACdy5B,EAAK35B,GAAKE,IAQpB,IAAO,WAIL,IAAIH,EAAI,EAAInJ,KAAS,GACjBoJ,EAAI,EAAIpJ,KAAS,GACjBsJ,EAAI7D,KAAK69B,IAAIn6B,GAAK05B,EAAKz5B,GAE3B,OAAO,IAAIm6B,GACF99B,KAAKg+B,IAAIt6B,GAAKG,EACfy5B,EAAK35B,GAAKE,IAQpB,IAAO,WAIL,IAAIH,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GACbsJ,EAAI,GAAMu5B,EAAK,EAAIz5B,GAAK,GAAM3D,KAAK69B,IAAI,EAAIn6B,GAE/C,OAAO,IAAIo6B,EACH99B,KAAK69B,IAAIn6B,GAAK05B,EAAKz5B,GAAKE,EACxB7D,KAAKg+B,IAAIt6B,GAAK45B,EAAK35B,GAAKE,IAQlC,IAAO,WAIL,IAAIH,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GACbsJ,EAAI,GAAMu5B,EAAK,EAAIz5B,GAAK,GAAM3D,KAAK69B,IAAI,EAAIn6B,GAE/C,OAAO,IAAIo6B,EACH99B,KAAKg+B,IAAIt6B,GAAK05B,EAAKz5B,GAAKE,GACvB7D,KAAK69B,IAAIn6B,GAAK45B,EAAK35B,GAAKE,IAQnC,KAAQ,WAIN,IAAIH,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEbukC,EAAK,IAAIhB,EACLn6B,EAAIA,EAAID,EAAIA,EAAI,GACf,EAAIA,EAAIC,GAAS,OAEtBo7B,EAAK,IAAIjB,EACLgB,EAAO,GAAIn7B,EACXm7B,EAAO,GAAIp7B,GAAQ,MAE3B,OAAO,IAAIo6B,EAAQiB,EAAO,IAAIA,EAAO,KAQvC,KAAQ,WAIN,IAAIr7B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEbukC,EAAK,IAAIhB,EACLn6B,EAAIA,EAAID,EAAIA,EAAI,GACf,EAAIA,EAAIC,GAAS,OAEtBo7B,EAAK,IAAIjB,EACLgB,EAAO,GAAIn7B,EACXm7B,EAAO,GAAIp7B,GAAQ,MAE3B,OAAO,IAAIo6B,EAAQ99B,KAAKiF,GAAK,EAAI85B,EAAO,GAAGA,EAAO,KAQpD,KAAQ,WAIN,IAAIr7B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,GAAU,IAANmJ,EAAS,CAEX,GAAU,IAANC,EACF,OAAO,IAAIm6B,EAAQ,EAAGkB,KAGxB,IAAW,IAAPr7B,EACF,OAAO,IAAIm6B,EAAQ,GAAG,KAI1B,IAAIj6B,EAAIH,EAAIA,GAAK,EAAMC,IAAM,EAAMA,GAE/Bm7B,EAAK,IAAIhB,GACJ,EAAIn6B,EAAIA,EAAID,EAAIA,GAAKG,GACrB,EAAIH,EAAIG,GAAG+5B,MAEpB,OAAO,IAAIE,GAAS,GAAMgB,EAAO,GAAG,GAAMA,EAAO,KAQnD,KAAQ,WAIN,IAAIp7B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,GAAU,IAANoJ,EACF,OAAO,IAAIm6B,EAAQ99B,KAAKgF,MAAM,EAAGtB,GAAI,GAGvC,IAAIG,EAAIH,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANE,EACE,IAAIi6B,EACEp6B,EAAIG,GACHF,EAAIE,GAAGo7B,OACd,IAAInB,EACS,IAANp6B,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGs7B,QAQ1C,KAAQ,WAIN,IAAIv7B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,GAAU,IAANmJ,GAAiB,IAANC,EACb,OAAO,IAAIm6B,EAAQ,EAAGkB,KAGxB,IAAIn7B,EAAIH,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANE,EACE,IAAIi6B,EACEp6B,EAAIG,GACHF,EAAIE,GAAGq7B,OACd,IAAIpB,EACS,IAANp6B,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGu7B,QAQ1C,KAAQ,WAIN,IAAIx7B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,GAAU,IAANmJ,GAAiB,IAANC,EACb,OAAO,IAAIm6B,EAAQ99B,KAAKiF,GAAK,EAAG+5B,KAGlC,IAAIn7B,EAAIH,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANE,EACE,IAAIi6B,EACEp6B,EAAIG,GACHF,EAAIE,GAAGs7B,OACd,IAAIrB,EACS,IAANp6B,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGw7B,QAQ1C,KAAQ,WAIN,IAAIz7B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,OAAO,IAAIujC,EACHR,EAAK55B,GAAK1D,KAAK69B,IAAIl6B,GACnBy5B,EAAK15B,GAAK1D,KAAKg+B,IAAIr6B,KAQ7B,KAAQ,WAIN,IAAID,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,OAAO,IAAIujC,EACHV,EAAK15B,GAAK1D,KAAK69B,IAAIl6B,GACnB25B,EAAK55B,GAAK1D,KAAKg+B,IAAIr6B,KAQ7B,KAAQ,WAIN,IAAID,EAAI,EAAInJ,KAAS,GACjBoJ,EAAI,EAAIpJ,KAAS,GACjBsJ,EAAIu5B,EAAK15B,GAAK1D,KAAK69B,IAAIl6B,GAE3B,OAAO,IAAIm6B,EACHR,EAAK55B,GAAKG,EACV7D,KAAKg+B,IAAIr6B,GAAKE,IAQxB,KAAQ,WAIN,IAAIH,EAAI,EAAInJ,KAAS,GACjBoJ,EAAI,EAAIpJ,KAAS,GACjBsJ,EAAIu5B,EAAK15B,GAAK1D,KAAK69B,IAAIl6B,GAE3B,OAAO,IAAIm6B,EACHR,EAAK55B,GAAKG,GACT7D,KAAKg+B,IAAIr6B,GAAKE,IAQzB,KAAQ,WAIN,IAAIH,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GACbsJ,EAAI7D,KAAK69B,IAAI,EAAIl6B,GAAKy5B,EAAK,EAAI15B,GAEnC,OAAO,IAAIo6B,GACF,EAAIR,EAAK55B,GAAK1D,KAAK69B,IAAIl6B,GAAKE,EAC7B,EAAIu5B,EAAK15B,GAAK1D,KAAKg+B,IAAIr6B,GAAKE,IAQtC,KAAQ,WAIN,IAAIH,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GACbsJ,EAAI7D,KAAK69B,IAAI,EAAIl6B,GAAKy5B,EAAK,EAAI15B,GAEnC,OAAO,IAAIo6B,EACH,EAAIV,EAAK15B,GAAK1D,KAAK69B,IAAIl6B,GAAKE,GAC3B,EAAIy5B,EAAK55B,GAAK1D,KAAKg+B,IAAIr6B,GAAKE,IAQvC,MAAS,WAIP,IAAI46B,EAAMlkC,KAAS,GACnBA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAIkkC,EACb,IAAIzO,EAAMz1B,KAAW,OAQrB,OANAA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAIkkC,EACbA,EAAMzO,EAAQ,GAEdA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIyO,EACLzO,GAQT,MAAS,WAIP,IAAIA,EAAMz1B,KAAW,OACrB,GAAIy1B,EAAQ,IAAK,EAAG,CAClB,IAAIyO,EAAMzO,EAAQ,GAClBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIyO,OAERA,EAAMzO,EAAQ,GAClBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAIyO,EAEd,OAAOzO,GAQT,MAAS,WAIP,IAAItsB,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEb6kC,EAAO17B,EAAI,GAAW,IAANC,EAChB07B,EAAW,EAAI37B,EACf47B,EAAU,EAAI57B,EACdG,EAAIw7B,EAAWA,EAAW17B,EAAIA,EAE9BvF,EAAW,IAANyF,EACC,IAAIi6B,GACGwB,EAAUD,EAAW17B,EAAIA,GAAKE,GAC9BF,EAAI07B,EAAWC,EAAU37B,GAAKE,GACrC,IAAIi6B,GACU,IAAPp6B,EAAaA,EAAI,EAAK,EAChB,IAANC,EAAYA,EAAI,EAAK,GAElC47B,EAAOnhC,EAAM,GAMjB,OALAA,EAAM,GAAIq/B,EAASr/B,EAAM,GAAGA,EAAM,IAAK,EACvCA,EAAM,GAAI4B,KAAKgF,MAAM5G,EAAM,GAAGmhC,GAAQ,EAClCH,IACFhhC,EAAM,IAAKA,EAAM,IAEZA,GAQT,MAAS,WAIP,IAAIsF,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,GAAU,IAANmJ,GAAiB,IAANC,EACb,OAAO,IAAIm6B,EAAQ,EAAG99B,KAAKiF,GAAK,GAGlC,IAAIpB,EAAIH,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANE,EACE,IAAIi6B,EACEp6B,EAAIG,GACHF,EAAIE,GAAG27B,QACd,IAAI1B,EACS,IAANp6B,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG67B,SAQ1C,MAAS,WAIP,IAAI97B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,GAAU,IAANoJ,EAEF,OAAO,IAAIm6B,EACI,IAANp6B,EACC1D,KAAK49B,IAAIl6B,EAAI1D,KAAKsE,KAAKZ,EAAIA,EAAI,IAC/Bs7B,IAAU,GAGtB,IAAIn7B,EAAIH,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANE,EACE,IAAIi6B,EACEp6B,EAAIG,GACHF,EAAIE,GAAG47B,QACd,IAAI3B,EACS,IAANp6B,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG87B,SAQ1C,MAAS,WAIP,IAAI/7B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEjB,GAAIA,KAAa,SACf,OAAOujC,EAAkB,SAG3B,IAAIj6B,EAAIH,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANE,EACE,IAAIi6B,EACEp6B,EAAIG,GACHF,EAAIE,GAAG67B,QACd,IAAI5B,EACS,IAANp6B,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG+7B,SAQ1C,QAAW,WAGT,GAAInlC,KAAa,SACf,OAAOujC,EAAkB,SAG3B,GAAIvjC,KAAiB,aACnB,OAAOujC,EAAc,KAGvB,IAAIp6B,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GAEbsJ,EAAIH,EAAIA,EAAIC,EAAIA,EAEpB,OAAO,IAAIm6B,EAAQp6B,EAAIG,GAAIF,EAAIE,IAQjC,UAAa,WAEX,OAAO,IAAIi6B,EAAQvjC,KAAS,IAAIA,KAAS,KAQ3C,IAAO,WAEL,OAAO,IAAIujC,GAASvjC,KAAS,IAAIA,KAAS,KAQ5C,KAAQ,SAASolC,GAIf,OAFAA,EAAS3/B,KAAKmN,IAAI,GAAIwyB,GAAU,GAEzB,IAAI7B,EACH99B,KAAKkd,KAAK3iB,KAAS,GAAIolC,GAAUA,EACjC3/B,KAAKkd,KAAK3iB,KAAS,GAAIolC,GAAUA,IAQ3C,MAAS,SAASA,GAIhB,OAFAA,EAAS3/B,KAAKmN,IAAI,GAAIwyB,GAAU,GAEzB,IAAI7B,EACH99B,KAAKgd,MAAMziB,KAAS,GAAIolC,GAAUA,EAClC3/B,KAAKgd,MAAMziB,KAAS,GAAIolC,GAAUA,IAQ5C,MAAS,SAASA,GAIhB,OAFAA,EAAS3/B,KAAKmN,IAAI,GAAIwyB,GAAU,GAEzB,IAAI7B,EACH99B,KAAKC,MAAM1F,KAAS,GAAIolC,GAAUA,EAClC3/B,KAAKC,MAAM1F,KAAS,GAAIolC,GAAUA,IAU5C,OAAU,SAASj8B,EAAGC,GAEpB,IAAIo6B,EAAI,IAAID,EAAQp6B,EAAGC,GAEvB,OAAO3D,KAAK0F,IAAIq4B,EAAM,GAAIxjC,KAAS,KAAMujC,EAAiB,SAClD99B,KAAK0F,IAAIq4B,EAAM,GAAIxjC,KAAS,KAAMujC,EAAiB,SAQ7D,MAAS,WAEP,OAAO,IAAIA,EAAQvjC,KAAS,GAAGA,KAAS,KAQ1C,SAAY,WAEV,IAAImJ,EAAInJ,KAAS,GACboJ,EAAIpJ,KAAS,GACbqlC,EAAM,GAEV,OAAIrlC,KAAY,QACP,MAGLA,KAAiB,aACZ,WAIC,IAANoJ,EACKi8B,EAAMl8B,GAGL,IAANA,GACFk8B,GAAMl8B,EACNk8B,GAAM,IACFj8B,EAAI,GACNA,GAAKA,EACLi8B,GAAM,KAENA,GAAM,IAERA,GAAM,KACGj8B,EAAI,IACbA,GAAKA,EACLi8B,GAAM,KAGJ,IAAMj8B,IACRi8B,GAAMj8B,GAEDi8B,EAAM,MAQf,SAAY,WAEV,MAAO,CAACrlC,KAAS,GAAGA,KAAS,KAQ/B,QAAW,WAET,OAAmB,IAAfA,KAAS,GACJA,KAAS,GAEX,MAQT,MAAS,WACP,OAAO8G,MAAM9G,KAAS,KAAM8G,MAAM9G,KAAS,KAS7C,OAAU,WACR,OAAsB,IAAfA,KAAS,IAA0B,IAAfA,KAAS,IAStC,SAAY,WACV,OAAOmgB,SAASngB,KAAS,KAAMmgB,SAASngB,KAAS,KASnD,WAAc,WACZ,QAASA,KAAY,SAAOA,KAAe,cAI/CujC,EAAc,KAAI,IAAIA,EAAQ,EAAG,GACjCA,EAAa,IAAI,IAAIA,EAAQ,EAAG,GAChCA,EAAW,EAAI,IAAIA,EAAQ,EAAG,GAC9BA,EAAY,GAAI,IAAIA,EAAQ99B,KAAKiF,GAAI,GACrC64B,EAAW,EAAI,IAAIA,EAAQ99B,KAAK6/B,EAAG,GACnC/B,EAAkB,SAAI,IAAIA,EAAQkB,IAAUA,KAC5ClB,EAAa,IAAI,IAAIA,EAAQgC,IAAKA,KAClChC,EAAiB,QAAI,WAKlB,KAFU,EAAF,WACP,OAAOA,GACR,QAFM,OAEN,aAv0CL,I,cCbAiC,EAAOC,QAAU,CACfC,SAAU,EAAQ,KAElB1a,OAAQ,EAAQ,MAChB2a,MAAO,EAAQ,MACfC,KAAM,CACJC,KAAM,aACNC,OAAQ,gBAEVC,QAAS,EAAQ,Q,4BC7BnB,IAAIzpB,EAAI,EAAQ,MACZ0pB,EAAY,EAAQ,MAExBR,EAAOC,QAAU,CACfQ,IAIF,SAAazkC,GACX,IAAI0kC,EAA+B,WAAxB1kC,EAAEO,QAAQokC,UACjBH,EAAUxkC,EAUd,SAAkBA,GAChB,OAAO,SAASX,GACd,OAAOW,EAAEP,KAAKJ,GAAGulC,QAZJC,CAAS7kC,IAiB5B,SAAgBA,GACd,IAAI0kC,EAAM,GACNhP,EAAQ,GACRoP,EAAU,GAmBd,OADAhqB,EAAE3a,QAAQH,EAAEE,SAhBZ,SAAS6kC,EAAI3kC,GACP0a,EAAE0I,IAAIshB,EAAS1kC,KAGnB0kC,EAAQ1kC,IAAK,EACbs1B,EAAMt1B,IAAK,EACX0a,EAAE3a,QAAQH,EAAE6N,SAASzN,IAAI,SAASf,GAC5Byb,EAAE0I,IAAIkS,EAAOr2B,EAAEkD,GACjBmiC,EAAI1nC,KAAKqC,GAET0lC,EAAI1lC,EAAEkD,aAGHmzB,EAAMt1B,OAIRskC,EAtCHM,CAAOhlC,GACX8a,EAAE3a,QAAQukC,GAAK,SAASrlC,GACtB,IAAIsnB,EAAQ3mB,EAAEP,KAAKJ,GACnBW,EAAEilC,WAAW5lC,GACbsnB,EAAMue,YAAc7lC,EAAElB,KACtBwoB,EAAMwe,UAAW,EACjBnlC,EAAE4qB,QAAQvrB,EAAEkD,EAAGlD,EAAEe,EAAGumB,EAAO7L,EAAEsqB,SAAS,YAZxCC,KA+CF,SAAcrlC,GACZ8a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAIsnB,EAAQ3mB,EAAEP,KAAKJ,GACnB,GAAIsnB,EAAMwe,SAAU,CAClBnlC,EAAEilC,WAAW5lC,GAEb,IAAI6lC,EAAcve,EAAMue,mBACjBve,EAAMwe,gBACNxe,EAAMue,YACbllC,EAAE4qB,QAAQvrB,EAAEkD,EAAGlD,EAAEe,EAAGumB,EAAOue,U,eC/DjC,IAAIpqB,EAAI,EAAQ,MACZspB,EAAO,EAAQ,MA2BnB,SAASkB,EAActlC,EAAGq9B,EAAMkI,EAAQC,EAAIC,EAAQC,GAClD,IAAI/e,EAAQ,CAAExkB,MAAO,EAAGsD,OAAQ,EAAGigC,KAAMA,EAAMC,WAAYtI,GACvDuI,EAAOH,EAAOpI,GAAMqI,EAAO,GAC3BG,EAAOzB,EAAK0B,aAAa9lC,EAAG,SAAU2mB,EAAO4e,GACjDE,EAAOpI,GAAMqI,GAAQG,EACrB7lC,EAAE+lC,UAAUF,EAAML,GACdI,GACF5lC,EAAE4qB,QAAQgb,EAAMC,EAAM,CAAEjB,OAAQ,IAhCpCZ,EAAOC,QAEP,SAA2BjkC,GAoBzB8a,EAAE3a,QAAQH,EAAEsgC,YAnBZ,SAASyE,EAAI3kC,GACX,IAAIkgC,EAAWtgC,EAAEsgC,SAASlgC,GACtBE,EAAON,EAAEM,KAAKF,GAKlB,GAJIkgC,EAASrnC,QACX6hB,EAAE3a,QAAQmgC,EAAUyE,GAGlBjqB,EAAE0I,IAAIljB,EAAM,WAAY,CAC1BA,EAAK0lC,WAAa,GAClB1lC,EAAK2lC,YAAc,GACnB,IAAK,IAAIP,EAAOplC,EAAK4lC,QAASC,EAAU7lC,EAAK6lC,QAAU,EACrDT,EAAOS,IACLT,EACFJ,EAActlC,EAAG,aAAc,MAAOI,EAAGE,EAAMolC,GAC/CJ,EAActlC,EAAG,cAAe,MAAOI,EAAGE,EAAMolC,S,4BClBxD,IAAI5qB,EAAI,EAAQ,MA0BhB,SAASsrB,EAAgBpmC,GACvB8a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAAKimC,EAAmBrmC,EAAEM,KAAKF,OAC7D0a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAAKgnC,EAAmBrmC,EAAEP,KAAKJ,OAG/D,SAASgnC,EAAmB5V,GAC1B,IAAIluB,EAAIkuB,EAAMtuB,MACdsuB,EAAMtuB,MAAQsuB,EAAMhrB,OACpBgrB,EAAMhrB,OAASlD,EAejB,SAAS+jC,EAAY7V,GACnBA,EAAMnuB,GAAKmuB,EAAMnuB,EAenB,SAASikC,EAAU9V,GACjB,IAAIpuB,EAAIouB,EAAMpuB,EACdouB,EAAMpuB,EAAIouB,EAAMnuB,EAChBmuB,EAAMnuB,EAAID,EAlEZ2hC,EAAOC,QAAU,CACfuC,OAIF,SAAgBxmC,GACd,IAAIymC,EAAUzmC,EAAEO,QAAQmmC,QAAQhL,cAChB,OAAZ+K,GAAgC,OAAZA,GACtBL,EAAgBpmC,IANlBqlC,KAUF,SAAcrlC,GACZ,IAAIymC,EAAUzmC,EAAEO,QAAQmmC,QAAQhL,cAChB,OAAZ+K,GAAgC,OAAZA,GAqB1B,SAAkBzmC,GAChB8a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAAKkmC,EAAYtmC,EAAEM,KAAKF,OAEtD0a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GAClByb,EAAE3a,QAAQV,EAAKwG,OAAQqgC,GACnBxrB,EAAE0I,IAAI/jB,EAAM,MACd6mC,EAAY7mC,MA3BdknC,CAAS3mC,GAGK,OAAZymC,GAAgC,OAAZA,IAiC1B,SAAgBzmC,GACd8a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAAKmmC,EAAUvmC,EAAEM,KAAKF,OAEpD0a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GAClByb,EAAE3a,QAAQV,EAAKwG,OAAQsgC,GACnBzrB,EAAE0I,IAAI/jB,EAAM,MACd8mC,EAAU9mC,MAvCZmnC,CAAO5mC,GACPomC,EAAgBpmC,O,SCjBpB,SAAS6mC,IACP,IAAIC,EAAW,GACfA,EAASC,MAAQD,EAASE,MAAQF,EAClCtoC,KAAKyoC,UAAYH,EAkCnB,SAASI,EAAO5W,GACdA,EAAM0W,MAAMD,MAAQzW,EAAMyW,MAC1BzW,EAAMyW,MAAMC,MAAQ1W,EAAM0W,aACnB1W,EAAMyW,aACNzW,EAAM0W,MAGf,SAASG,EAAeC,EAAGhnC,GACzB,GAAU,UAANgnC,GAAuB,UAANA,EACnB,OAAOhnC,EAhDX4jC,EAAOC,QAAU4C,EAQjBA,EAAKpsC,UAAU4sC,QAAU,WACvB,IAAIP,EAAWtoC,KAAKyoC,UAChB3W,EAAQwW,EAASE,MACrB,GAAI1W,IAAUwW,EAEZ,OADAI,EAAO5W,GACAA,GAIXuW,EAAKpsC,UAAU6sC,QAAU,SAAShX,GAChC,IAAIwW,EAAWtoC,KAAKyoC,UAChB3W,EAAM0W,OAAS1W,EAAMyW,OACvBG,EAAO5W,GAETA,EAAMyW,MAAQD,EAASC,MACvBD,EAASC,MAAMC,MAAQ1W,EACvBwW,EAASC,MAAQzW,EACjBA,EAAM0W,MAAQF,GAGhBD,EAAKpsC,UAAUyD,SAAW,WAIxB,IAHA,IAAIqpC,EAAO,GACPT,EAAWtoC,KAAKyoC,UAChBpB,EAAOiB,EAASE,MACbnB,IAASiB,GACdS,EAAKvqC,KAAKq+B,KAAKqC,UAAUmI,EAAMsB,IAC/BtB,EAAOA,EAAKmB,MAEd,MAAO,IAAMO,EAAKC,KAAK,MAAQ,M,eCzCjC,IAAI1sB,EAAI,EAAQ,MACZspB,EAAO,EAAQ,MACfqD,EAAQ,aAEZzD,EAAOC,QAAU,CACfyD,cAIF,SAAuB1nC,GACrB,IAAI2nC,EAAcvD,EAAKwD,iBAAiB5nC,GAEpCwC,EAAI,IAAIilC,EAAM,CAAEI,UAAU,EAAMlf,YAAY,IAAQP,SAAS,IAoBjE,OAlBAtN,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5BoC,EAAE6nB,QAAQjqB,EAAG,CAAEumB,MAAOvmB,IACtBoC,EAAEujC,UAAU3lC,EAAG,QAAUJ,EAAEM,KAAKF,GAAGslC,SAGrC5qB,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5BmD,EAAEooB,QAAQvrB,EAAEe,EAAGf,EAAEkD,EAAG,GAAIlD,EAAElB,SAG5B2c,EAAE3a,QAAQwnC,GAAa,SAASG,EAAO5uC,GACrC,IAAI6uC,EAAS,QAAU7uC,EACvBsJ,EAAE6nB,QAAQ0d,EAAQ,CAAErC,KAAM,SAC1B5qB,EAAE+hB,OAAOiL,GAAO,SAASxf,EAAGloB,GAE1B,OADAoC,EAAEooB,QAAQtC,EAAGloB,EAAG,CAAEyT,MAAO,UAClBzT,QAIJoC,K,cC9BT,IAAI0hC,EAGF,IACEA,EAAW,EAAQ,MACnB,MAAO7kC,IAKN6kC,IACHA,EAAWpyB,OAAOoyB,UAGpBF,EAAOC,QAAUC,G,eChBjB,IAAIppB,EAAI,EAAQ,MACZ2sB,EAAQ,aACRZ,EAAO,EAAQ,MASnB7C,EAAOC,QAIP,SAAmBjkC,EAAG6kC,GACpB,GAAI7kC,EAAEgoC,aAAe,EACnB,MAAO,GAET,IAAIhmC,EA4DN,SAAoBhC,EAAG6kC,GACrB,IAAIoD,EAAW,IAAIR,EACfS,EAAQ,EACRC,EAAS,EAEbrtB,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B6nC,EAAS5d,QAAQjqB,EAAG,CAAEA,EAAGA,EAAG,GAAM,EAAGgoC,IAAK,OAK5CttB,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAIgpC,EAAaJ,EAASxoC,KAAKJ,EAAEe,EAAGf,EAAEkD,IAAM,EACxCqiC,EAASC,EAASxlC,GAClBipC,EAAaD,EAAazD,EAC9BqD,EAASrd,QAAQvrB,EAAEe,EAAGf,EAAEkD,EAAG+lC,GAC3BH,EAASlkC,KAAKijB,IAAIihB,EAAQF,EAAS3nC,KAAKjB,EAAEe,GAAGgoC,KAAOxD,GACpDsD,EAASjkC,KAAKijB,IAAIghB,EAAQD,EAAS3nC,KAAKjB,EAAEkD,GAAO,IAAMqiC,MAGzD,IAAI2D,EAAUztB,EAAEkW,MAAMmX,EAASD,EAAQ,GAAG/yB,KAAI,WAAa,OAAO,IAAI0xB,KAClE2B,EAAUN,EAAQ,EAMtB,OAJAptB,EAAE3a,QAAQ8nC,EAAS/nC,SAAS,SAASE,GACnCqoC,EAAaF,EAASC,EAASP,EAAS3nC,KAAKF,OAGxC,CAAEG,MAAO0nC,EAAUM,QAASA,EAASC,QAASA,GAvFzCE,CAAW1oC,EAAG6kC,GAAY8D,GAClClQ,EAQN,SAAqBz4B,EAAGuoC,EAASC,GAM/B,IALA,IAIIlY,EAJAmI,EAAU,GACVmQ,EAAUL,EAAQA,EAAQtvC,OAAS,GACnC4vC,EAAQN,EAAQ,GAGbvoC,EAAEgoC,aAAa,CACpB,KAAQ1X,EAAQuY,EAAMxB,WAAgByB,EAAW9oC,EAAGuoC,EAASC,EAASlY,GACtE,KAAQA,EAAQsY,EAAQvB,WAAcyB,EAAW9oC,EAAGuoC,EAASC,EAASlY,GACtE,GAAItwB,EAAEgoC,YACJ,IAAK,IAAI9uC,EAAIqvC,EAAQtvC,OAAS,EAAGC,EAAI,IAAKA,EAExC,GADAo3B,EAAQiY,EAAQrvC,GAAGmuC,UACR,CACT5O,EAAUA,EAAQiI,OAAOoI,EAAW9oC,EAAGuoC,EAASC,EAASlY,GAAO,IAChE,OAMR,OAAOmI,EA5BOsQ,CAAY/mC,EAAMzB,MAAOyB,EAAMumC,QAASvmC,EAAMwmC,SAG5D,OAAO1tB,EAAEkuB,QAAQluB,EAAE3F,IAAIsjB,GAAS,SAASp5B,GACvC,OAAOW,EAAE6N,SAASxO,EAAEe,EAAGf,EAAEkD,OACvB,IAZN,IAAIomC,EAAoB7tB,EAAEmuB,SAAS,GAsCnC,SAASH,EAAW9oC,EAAGuoC,EAASC,EAASlY,EAAO4Y,GAC9C,IAAIzQ,EAAUyQ,EAAsB,QAAKvsC,EAwBzC,OAtBAme,EAAE3a,QAAQH,EAAE+N,QAAQuiB,EAAMlwB,IAAI,SAASX,GACrC,IAAImlC,EAAS5kC,EAAEP,KAAKA,GAChB0pC,EAASnpC,EAAEM,KAAKb,EAAKW,GAErB8oC,GACFzQ,EAAQz7B,KAAK,CAAEoD,EAAGX,EAAKW,EAAGmC,EAAG9C,EAAK8C,IAGpC4mC,EAAOf,KAAOxD,EACd6D,EAAaF,EAASC,EAASW,MAGjCruB,EAAE3a,QAAQH,EAAE6N,SAASyiB,EAAMlwB,IAAI,SAASX,GACtC,IAAImlC,EAAS5kC,EAAEP,KAAKA,GAChB8C,EAAI9C,EAAK8C,EACT6mC,EAASppC,EAAEM,KAAKiC,GACpB6mC,EAAW,IAAKxE,EAChB6D,EAAaF,EAASC,EAASY,MAGjCppC,EAAE8oC,WAAWxY,EAAMlwB,GAEZq4B,EAiCT,SAASgQ,EAAaF,EAASC,EAASlY,GACjCA,EAAM8X,IAEC9X,EAAU,GAGpBiY,EAAQjY,EAAM8X,IAAM9X,EAAU,GAAIkY,GAASlB,QAAQhX,GAFnDiY,EAAQA,EAAQtvC,OAAS,GAAGquC,QAAQhX,GAFpCiY,EAAQ,GAAGjB,QAAQhX,K,4BC7GvB,IAAIxV,EAAI,EAAQ,MACZuuB,EAAU,EAAQ,MAClBC,EAAY,EAAQ,MACpB5D,EAAO,EAAQ,MACf6D,EAAiB,uBACjBC,EAAoB,EAAQ,MAC5BC,EAAmB,yBACnBC,EAAe,EAAQ,MACvBC,EAAoB,EAAQ,MAC5BC,EAAmB,EAAQ,MAC3BC,EAAQ,EAAQ,MAChBx6B,EAAW,EAAQ,MACnB+0B,EAAO,EAAQ,MACfqD,EAAQ,aAEZzD,EAAOC,QAEP,SAAgBjkC,EAAG8pC,GACjB,IAAIzF,EAAOyF,GAAQA,EAAKC,YAAc3F,EAAKC,KAAOD,EAAKE,OACvDD,EAAK,UAAU,WACb,IAAI2F,EACF3F,EAAK,sBAAsB,WAAa,OA2F9C,SAA0B4F,GACxB,IAAIjqC,EAAI,IAAIynC,EAAM,CAAE9e,YAAY,EAAMkf,UAAU,IAC5CtnC,EAAQ2pC,EAAaD,EAAW1pC,SAqBpC,OAnBAP,EAAEooB,SAAStN,EAAEqvB,MAAM,GACjBC,EACAC,EAAkB9pC,EAAO+pC,GACzBxvB,EAAEyvB,KAAKhqC,EAAOiqC,KAEhB1vB,EAAE3a,QAAQ8pC,EAAW/pC,SAAS,SAASE,GACrC,IAAIE,EAAO4pC,EAAaD,EAAW3pC,KAAKF,IACxCJ,EAAEqqB,QAAQjqB,EAAG0a,EAAE2vB,SAASJ,EAAkB/pC,EAAMoqC,GAAeC,IAC/D3qC,EAAE+lC,UAAU3lC,EAAG6pC,EAAWx2B,OAAOrT,OAGnC0a,EAAE3a,QAAQ8pC,EAAWzpC,SAAS,SAASnB,GACrC,IAAII,EAAOyqC,EAAaD,EAAWxqC,KAAKJ,IACxCW,EAAE4qB,QAAQvrB,EAAGyb,EAAEqvB,MAAM,GACnBS,EACAP,EAAkB5qC,EAAMorC,GACxB/vB,EAAEyvB,KAAK9qC,EAAMqrC,QAGV9qC,EAlH4C+qC,CAAiB/qC,MAClEqkC,EAAK,eAAsB,YAK/B,SAAmBrkC,EAAGqkC,GACpBA,EAAK,8BAA8B,YAsHrC,SAAgCrkC,GAC9B,IAAIO,EAAQP,EAAEO,QACdA,EAAMsoB,SAAW,EACjB/N,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GAClBI,EAAKurC,QAAU,EACqB,MAAhCvrC,EAAKwrC,SAASvP,gBACM,OAAlBn7B,EAAMmmC,SAAsC,OAAlBnmC,EAAMmmC,QAClCjnC,EAAK0C,OAAS1C,EAAKyrC,YAEnBzrC,EAAKgG,QAAUhG,EAAKyrC,gBAhIsBC,CAAuBnrC,MACvEqkC,EAAK,uBAA8B,YAmSrC,SAAyBrkC,GACvB8a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,GAAIA,EAAEe,IAAMf,EAAEkD,EAAG,CACf,IAAIjC,EAAON,EAAEM,KAAKjB,EAAEe,GACfE,EAAK8qC,YACR9qC,EAAK8qC,UAAY,IAEnB9qC,EAAK8qC,UAAUpuC,KAAK,CAAEqC,EAAGA,EAAGsnB,MAAO3mB,EAAEP,KAAKJ,KAC1CW,EAAEilC,WAAW5lC,OA3S+BgsC,CAAgBrrC,MAChEqkC,EAAK,eAA8B,WAAagF,EAAQ5E,IAAIzkC,MAC5DqkC,EAAK,wBAA8B,WAAaqF,EAAajF,IAAIzkC,MACjEqkC,EAAK,YAA8B,WAAaqB,EAAKtB,EAAKkH,mBAAmBtrC,OAC7EqkC,EAAK,8BAA8B,YAuIrC,SAAgCrkC,GAC9B8a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GAClB,GAAII,EAAK0C,OAAS1C,EAAKgG,OAAQ,CAC7B,IAAIrF,EAAIJ,EAAEM,KAAKjB,EAAEe,GAEbumB,EAAQ,CAAE+e,MADN1lC,EAAEM,KAAKjB,EAAEkD,GACMmjC,KAAOtlC,EAAEslC,MAAQ,EAAItlC,EAAEslC,KAAMrmC,EAAGA,GACvD+kC,EAAK0B,aAAa9lC,EAAG,aAAc2mB,EAAO,WA9IE4kB,CAAuBvrC,MACvEqkC,EAAK,wBAA8B,WAAaoF,EAAiBzpC,MACjEqkC,EAAK,4BAA8B,WAAaqF,EAAa8B,QAAQxrC,MACrEqkC,EAAK,sBAA8B,WAAakF,EAAevpC,MAC/DqkC,EAAK,wBAA8B,YA+IrC,SAA0BrkC,GACxB,IAAImmC,EAAU,EACdrrB,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIE,EAAON,EAAEM,KAAKF,GACdE,EAAKmrC,YACPnrC,EAAK4lC,QAAUlmC,EAAEM,KAAKA,EAAKmrC,WAAW/F,KACtCplC,EAAK6lC,QAAUnmC,EAAEM,KAAKA,EAAKorC,cAAchG,KACzCS,EAAUrrB,EAAEoM,IAAIif,EAAS7lC,EAAK6lC,aAGlCnmC,EAAEO,QAAQ4lC,QAAUA,EAzJ4BwF,CAAiB3rC,MACjEqkC,EAAK,8BAA8B,YA2JrC,SAAgCrkC,GAC9B8a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIE,EAAON,EAAEM,KAAKF,GACC,eAAfE,EAAKsrC,QACP5rC,EAAEP,KAAKa,EAAKjB,GAAGwsC,UAAYvrC,EAAKolC,KAChC1lC,EAAE8oC,WAAW1oC,OAhK+B0rC,CAAuB9rC,MACvEqkC,EAAK,qBAA8B,WAAaiF,EAAU7E,IAAIzkC,MAC9DqkC,EAAK,yBAA8B,WAAamF,EAAkBxpC,MAClEqkC,EAAK,yBAA8B,WAAasF,EAAkB3pC,MAClEqkC,EAAK,aAA8B,WAAawF,EAAM7pC,MACtDqkC,EAAK,uBAA8B,YAkSrC,SAAyBrkC,GACvB,IAAI+rC,EAAS3H,EAAKwD,iBAAiB5nC,GACnC8a,EAAE3a,QAAQ4rC,GAAQ,SAASjE,GACzB,IAAIkE,EAAa,EACjBlxB,EAAE3a,QAAQ2nC,GAAO,SAAS1nC,EAAGlH,GAC3B,IAAIoH,EAAON,EAAEM,KAAKF,GAClBE,EAAKupC,MAAQ3wC,EAAI8yC,EACjBlxB,EAAE3a,QAAQG,EAAK8qC,WAAW,SAASa,GACjC7H,EAAK0B,aAAa9lC,EAAG,WAAY,CAC/BmC,MAAO8pC,EAAStlB,MAAMxkB,MACtBsD,OAAQwmC,EAAStlB,MAAMlhB,OACvBigC,KAAMplC,EAAKolC,KACXmE,MAAO3wC,KAAO8yC,EACd3sC,EAAG4sC,EAAS5sC,EACZsnB,MAAOslB,EAAStlB,OACf,iBAEErmB,EAAK8qC,gBAnTgCc,CAAgBlsC,MAChEqkC,EAAK,8BAA8B,WAAauF,EAAiBpD,OAAOxmC,MACxEqkC,EAAK,gBAA8B,WAAah1B,EAASrP,MACzDqkC,EAAK,yBAA8B,YAqTrC,SAA2BrkC,GACzB8a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIE,EAAON,EAAEM,KAAKF,GAClB,GAAmB,aAAfE,EAAKsrC,MAAsB,CAC7B,IAAIO,EAAWnsC,EAAEM,KAAKA,EAAKjB,EAAEe,GACzBiC,EAAI8pC,EAAS9pC,EAAI8pC,EAAShqC,MAAQ,EAClCG,EAAI6pC,EAAS7pC,EACb0L,EAAK1N,EAAK+B,EAAIA,EACd4L,EAAKk+B,EAAS1mC,OAAS,EAC3BzF,EAAE4qB,QAAQtqB,EAAKjB,EAAGiB,EAAKqmB,OACvB3mB,EAAE8oC,WAAW1oC,GACbE,EAAKqmB,MAAM1gB,OAAS,CAClB,CAAE5D,EAAGA,EAAI,EAAI2L,EAAK,EAAG1L,EAAGA,EAAI2L,GAC5B,CAAE5L,EAAGA,EAAI,EAAI2L,EAAK,EAAG1L,EAAGA,EAAI2L,GAC5B,CAAE5L,EAAGA,EAAQ2L,EAAQ1L,EAAGA,GACxB,CAAED,EAAGA,EAAI,EAAI2L,EAAK,EAAG1L,EAAGA,EAAI2L,GAC5B,CAAE5L,EAAGA,EAAI,EAAI2L,EAAK,EAAG1L,EAAGA,EAAI2L,IAE9B3N,EAAKqmB,MAAMtkB,EAAI/B,EAAK+B,EACpB/B,EAAKqmB,MAAMrkB,EAAIhC,EAAKgC,MAxUwB8pC,CAAkBpsC,MAClEqkC,EAAK,yBAA8B,YA0PrC,SAA2BrkC,GACzB8a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,GAAIJ,EAAEsgC,SAASlgC,GAAGnH,OAAQ,CACxB,IAAIqH,EAAON,EAAEM,KAAKF,GACdkJ,EAAItJ,EAAEM,KAAKA,EAAKmrC,WAChB7jC,EAAI5H,EAAEM,KAAKA,EAAKorC,cAChBW,EAAIrsC,EAAEM,KAAKwa,EAAEwxB,KAAKhsC,EAAK0lC,aACvBh7B,EAAIhL,EAAEM,KAAKwa,EAAEwxB,KAAKhsC,EAAK2lC,cAE3B3lC,EAAK6B,MAAQ8B,KAAK0F,IAAIqB,EAAE3I,EAAIgqC,EAAEhqC,GAC9B/B,EAAKmF,OAASxB,KAAK0F,IAAI/B,EAAEtF,EAAIgH,EAAEhH,GAC/BhC,EAAK+B,EAAIgqC,EAAEhqC,EAAI/B,EAAK6B,MAAQ,EAC5B7B,EAAKgC,EAAIgH,EAAEhH,EAAIhC,EAAKmF,OAAS,MAIjCqV,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GACJ,WAApBJ,EAAEM,KAAKF,GAAGwrC,OACZ5rC,EAAE8oC,WAAW1oC,MA5Q+BmsC,CAAkBvsC,MAClEqkC,EAAK,sBAA8B,WAAaiF,EAAUjE,KAAKrlC,MAC/DqkC,EAAK,4BAA8B,YAgOrC,SAA8BrkC,GAC5B8a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GAClB,GAAIyb,EAAE0I,IAAI/jB,EAAM,KAId,OAHsB,MAAlBA,EAAKwrC,UAAsC,MAAlBxrC,EAAKwrC,WAChCxrC,EAAK0C,OAAS1C,EAAKyrC,aAEbzrC,EAAKwrC,UACb,IAAK,IAAKxrC,EAAK4C,GAAK5C,EAAK0C,MAAQ,EAAI1C,EAAKyrC,YAAa,MACvD,IAAK,IAAKzrC,EAAK4C,GAAK5C,EAAK0C,MAAQ,EAAI1C,EAAKyrC,gBAzOEsB,CAAqBxsC,MACrEqkC,EAAK,4BAA8B,WAAauF,EAAiBvE,KAAKrlC,MACtEqkC,EAAK,sBAA8B,YAwJrC,SAAwBrkC,GACtB,IAAIysC,EAAOtoC,OAAOuoC,kBACdC,EAAO,EACPC,EAAOzoC,OAAOuoC,kBACdG,EAAO,EACPC,EAAa9sC,EAAEO,QACfwsC,EAAUD,EAAWE,SAAW,EAChCC,EAAUH,EAAWI,SAAW,EAEpC,SAASC,EAAY1c,GACnB,IAAIpuB,EAAIouB,EAAMpuB,EACVC,EAAImuB,EAAMnuB,EACVC,EAAIkuB,EAAMtuB,MACVK,EAAIiuB,EAAMhrB,OACdgnC,EAAOxoC,KAAK+iB,IAAIylB,EAAMpqC,EAAIE,EAAI,GAC9BoqC,EAAO1oC,KAAKijB,IAAIylB,EAAMtqC,EAAIE,EAAI,GAC9BqqC,EAAO3oC,KAAK+iB,IAAI4lB,EAAMtqC,EAAIE,EAAI,GAC9BqqC,EAAO5oC,KAAKijB,IAAI2lB,EAAMvqC,EAAIE,EAAI,GAGhCsY,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAAK+sC,EAAYntC,EAAEM,KAAKF,OACtD0a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GACdyb,EAAE0I,IAAI/jB,EAAM,MACd0tC,EAAY1tC,MAIhBgtC,GAAQM,EACRH,GAAQK,EAERnyB,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIE,EAAON,EAAEM,KAAKF,GAClBE,EAAK+B,GAAKoqC,EACVnsC,EAAKgC,GAAKsqC,KAGZ9xB,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GAClByb,EAAE3a,QAAQV,EAAKwG,QAAQ,SAAS/J,GAC9BA,EAAEmG,GAAKoqC,EACPvwC,EAAEoG,GAAKsqC,KAEL9xB,EAAE0I,IAAI/jB,EAAM,OAAQA,EAAK4C,GAAKoqC,GAC9B3xB,EAAE0I,IAAI/jB,EAAM,OAAQA,EAAK6C,GAAKsqC,MAGpCE,EAAW3qC,MAAQwqC,EAAOF,EAAOM,EACjCD,EAAWrnC,OAASonC,EAAOD,EAAOK,EAxMcG,CAAeptC,MAC/DqkC,EAAK,4BAA8B,YA0MrC,SAA8BrkC,GAC5B8a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAGIu0B,EAAIC,EAHJp0B,EAAOO,EAAEP,KAAKJ,GACdguC,EAAQrtC,EAAEM,KAAKjB,EAAEe,GACjBktC,EAAQttC,EAAEM,KAAKjB,EAAEkD,GAEhB9C,EAAKwG,QAKR2tB,EAAKn0B,EAAKwG,OAAO,GACjB4tB,EAAKp0B,EAAKwG,OAAOxG,EAAKwG,OAAOhN,OAAS,KALtCwG,EAAKwG,OAAS,GACd2tB,EAAK0Z,EACLzZ,EAAKwZ,GAKP5tC,EAAKwG,OAAOsnC,QAAQnJ,EAAKn0B,cAAco9B,EAAOzZ,IAC9Cn0B,EAAKwG,OAAOjJ,KAAKonC,EAAKn0B,cAAcq9B,EAAOzZ,OAzNG2Z,CAAqBxtC,MACrEqkC,EAAK,qBAA8B,YA2OrC,SAAuCrkC,GACrC8a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAII,EAAOO,EAAEP,KAAKJ,GACdI,EAAK0lC,UACP1lC,EAAKwG,OAAOwnC,aA/OgCC,CAA8B1tC,MAC9EqkC,EAAK,oBAA8B,WAAagF,EAAQhE,KAAKrlC,MAhCnB2tC,CAAU3D,EAAa3F,MAC/DA,EAAK,sBAAsB,YAwC/B,SAA0B4F,EAAYD,GACpClvB,EAAE3a,QAAQ8pC,EAAW/pC,SAAS,SAASE,GACrC,IAAIwtC,EAAa3D,EAAW3pC,KAAKF,GAC7BytC,EAAc7D,EAAY1pC,KAAKF,GAE/BwtC,IACFA,EAAWvrC,EAAIwrC,EAAYxrC,EAC3BurC,EAAWtrC,EAAIurC,EAAYvrC,EAEvB0nC,EAAY1J,SAASlgC,GAAGnH,SAC1B20C,EAAWzrC,MAAQ0rC,EAAY1rC,MAC/ByrC,EAAWnoC,OAASooC,EAAYpoC,YAKtCqV,EAAE3a,QAAQ8pC,EAAWzpC,SAAS,SAASnB,GACrC,IAAIuuC,EAAa3D,EAAWxqC,KAAKJ,GAC7BwuC,EAAc7D,EAAYvqC,KAAKJ,GAEnCuuC,EAAW3nC,OAAS4nC,EAAY5nC,OAC5B6U,EAAE0I,IAAIqqB,EAAa,OACrBD,EAAWvrC,EAAIwrC,EAAYxrC,EAC3BurC,EAAWtrC,EAAIurC,EAAYvrC,MAI/B2nC,EAAW1pC,QAAQ4B,MAAQ6nC,EAAYzpC,QAAQ4B,MAC/C8nC,EAAW1pC,QAAQkF,OAASukC,EAAYzpC,QAAQkF,OApENqoC,CAAiB9tC,EAAGgqC,UAuEhE,IAAIM,EAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,EAAgB,CAAEvhB,QAAS,GAAIklB,QAAS,GAAIC,QAAS,GAAItH,QAAS,MAClE8D,EAAa,CAAC,YAAa,SAAU,UAAW,SAChDE,EAAe,CAAC,QAAS,UACzBC,EAAe,CAAExoC,MAAO,EAAGsD,OAAQ,GACnColC,EAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,EAAe,CACjBI,OAAQ,EAAGpG,OAAQ,EAAGziC,MAAO,EAAGsD,OAAQ,EACxCylC,YAAa,GAAID,SAAU,KAEzBH,EAAY,CAAC,YAmRjB,SAAST,EAAkBvsC,EAAK2yB,GAC9B,OAAO3V,EAAEmzB,UAAUnzB,EAAEyvB,KAAKzsC,EAAK2yB,GAAQtsB,QAGzC,SAAS+lC,EAAazZ,GACpB,IAAIyd,EAAW,GAIf,OAHApzB,EAAE3a,QAAQswB,GAAO,SAASrwB,EAAGgnC,GAC3B8G,EAAS9G,EAAE1L,eAAiBt7B,KAEvB8tC,I,eCpYT,IAAIC,EAGF,IACEA,EAAS,CACPC,UAAW,EAAQ,KACnBnF,SAAU,EAAQ,MAClBwB,SAAU,EAAQ,MAClB4D,KAAM,EAAQ,MACd1iC,OAAQ,EAAQ,MAChB2iC,KAAM,EAAQ,MACdtF,QAAS,EAAQ,MACjB7oC,QAAS,EAAQ,MACjBouC,MAAO,EAAQ,MACf/qB,IAAM,EAAQ,MACdgrB,YAAa,EAAQ,MACrBlC,KAAM,EAAQ,KACdn3B,IAAK,EAAQ,MACb84B,UAAW,EAAQ,MACnB/mB,IAAK,EAAQ,MACbijB,MAAO,EAAQ,MACfnjB,IAAK,EAAQ,MACbynB,MAAO,EAAQ,MACfx9B,IAAK,EAAQ,MACbs5B,KAAM,EAAQ,MACdvZ,MAAO,EAAQ,MACf6L,OAAQ,EAAQ,MAChB6R,OAAQ,EAAQ,MAChBtJ,SAAU,EAAQ,MAClBrK,OAAQ,EAAQ,MAChB4T,UAAW,EAAQ,OAErB,MAAOtvC,IAKN8uC,IACHA,EAASr8B,OAAOgJ,GAGlBkpB,EAAOC,QAAUkK,G,eC3CjB,IAAIrzB,EAAI,EAAQ,MACZspB,EAAO,EAAQ,MAsDnB,SAASW,EAAI/kC,EAAGohC,EAAMwN,EAAShK,EAAQn/B,EAAQopC,EAAQzuC,GACrD,IAAIkgC,EAAWtgC,EAAEsgC,SAASlgC,GAC1B,GAAKkgC,EAASrnC,OAAd,CAOA,IAAI4hB,EAAMupB,EAAKkB,cAActlC,EAAG,OAC5BkZ,EAASkrB,EAAKkB,cAActlC,EAAG,OAC/B2mB,EAAQ3mB,EAAEM,KAAKF,GAEnBJ,EAAE+lC,UAAUlrB,EAAKza,GACjBumB,EAAM8kB,UAAY5wB,EAClB7a,EAAE+lC,UAAU7sB,EAAQ9Y,GACpBumB,EAAM+kB,aAAexyB,EAErB4B,EAAE3a,QAAQmgC,GAAU,SAASwO,GAC3B/J,EAAI/kC,EAAGohC,EAAMwN,EAAShK,EAAQn/B,EAAQopC,EAAQC,GAE9C,IAAIC,EAAY/uC,EAAEM,KAAKwuC,GACnBE,EAAWD,EAAUtD,UAAYsD,EAAUtD,UAAYqD,EACvDG,EAAcF,EAAUrD,aAAeqD,EAAUrD,aAAeoD,EAChEI,EAAaH,EAAUtD,UAAY7G,EAAS,EAAIA,EAChDoG,EAASgE,IAAaC,EAAc,EAAIxpC,EAASopC,EAAOzuC,GAAK,EAEjEJ,EAAE4qB,QAAQ/P,EAAKm0B,EAAU,CACvBpK,OAAQsK,EACRlE,OAAQA,EACRmE,aAAa,IAGfnvC,EAAE4qB,QAAQqkB,EAAa/1B,EAAQ,CAC7B0rB,OAAQsK,EACRlE,OAAQA,EACRmE,aAAa,OAIZnvC,EAAEyT,OAAOrT,IACZJ,EAAE4qB,QAAQwW,EAAMvmB,EAAK,CAAE+pB,OAAQ,EAAGoG,OAAQvlC,EAASopC,EAAOzuC,UAtCtDA,IAAMghC,GACRphC,EAAE4qB,QAAQwW,EAAMhhC,EAAG,CAAEwkC,OAAQ,EAAGoG,OAAQ4D,IAxD9C5K,EAAOC,QAAU,CACfQ,IA2BF,SAAazkC,GACX,IAAIohC,EAAOgD,EAAK0B,aAAa9lC,EAAG,OAAQ,GAAI,SACxC6uC,EAmEN,SAAoB7uC,GAClB,IAAI6uC,EAAS,GACb,SAAS9J,EAAI3kC,EAAGgvC,GACd,IAAI9O,EAAWtgC,EAAEsgC,SAASlgC,GACtBkgC,GAAYA,EAASrnC,QACvB6hB,EAAE3a,QAAQmgC,GAAU,SAASwO,GAC3B/J,EAAI+J,EAAOM,EAAQ,MAGvBP,EAAOzuC,GAAKgvC,EAGd,OADAt0B,EAAE3a,QAAQH,EAAEsgC,YAAY,SAASlgC,GAAK2kC,EAAI3kC,EAAG,MACtCyuC,EA/EMQ,CAAWrvC,GACpByF,EAASqV,EAAEoM,IAAIpM,EAAEigB,OAAO8T,IAAW,EACnCD,EAAU,EAAInpC,EAAS,EAE3BzF,EAAEO,QAAQ+uC,YAAclO,EAGxBtmB,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAAKW,EAAEP,KAAKJ,GAAG2rC,QAAU4D,KAGvD,IAAIhK,EAwEN,SAAoB5kC,GAClB,OAAO8a,EAAE+hB,OAAO78B,EAAEQ,SAAS,SAAS+uC,EAAKlwC,GACvC,OAAOkwC,EAAMvvC,EAAEP,KAAKJ,GAAGulC,SACtB,GA3EU4K,CAAWxvC,GAAK,EAG7B8a,EAAE3a,QAAQH,EAAEsgC,YAAY,SAASwO,GAC/B/J,EAAI/kC,EAAGohC,EAAMwN,EAAShK,EAAQn/B,EAAQopC,EAAQC,MAKhD9uC,EAAEO,QAAQkvC,eAAiBb,GA/C3BpD,QAoHF,SAAiBxrC,GACf,IAAI8sC,EAAa9sC,EAAEO,QACnBP,EAAE8oC,WAAWgE,EAAWwC,oBACjBxC,EAAWwC,YAClBx0B,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GACjBW,EAAEP,KAAKJ,GACT8vC,aACPnvC,EAAEilC,WAAW5lC,S,4BC9HnB,IAAIyb,EAAI,EAAQ,MACZspB,EAAO,EAAQ,MAEnBJ,EAAOC,QAAU,CACfQ,IAoBF,SAAazkC,GACXA,EAAEO,QAAQmvC,YAAc,GACxB50B,EAAE3a,QAAQH,EAAEQ,SAAS,SAASf,IAGhC,SAAuBO,EAAGX,GACxB,IAYIusC,EAAOnb,EAAOv3B,EAZdkH,EAAIf,EAAEe,EACNuvC,EAAQ3vC,EAAEM,KAAKF,GAAGslC,KAClBnjC,EAAIlD,EAAEkD,EACNqtC,EAAQ5vC,EAAEM,KAAKiC,GAAGmjC,KAClBvnC,EAAOkB,EAAElB,KACT0xC,EAAY7vC,EAAEP,KAAKJ,GACnBwsC,EAAYgE,EAAUhE,UAE1B,GAAI+D,IAAUD,EAAQ,EAAtB,CAKA,IAHA3vC,EAAEilC,WAAW5lC,GAGRnG,EAAI,IAAKy2C,EAAOA,EAAQC,IAAS12C,IAAKy2C,EACzCE,EAAU5pC,OAAS,GACnBwqB,EAAQ,CACNtuB,MAAO,EAAGsD,OAAQ,EAClBoqC,UAAWA,EAAWC,QAASzwC,EAC/BqmC,KAAMiK,GAER/D,EAAQxH,EAAK0B,aAAa9lC,EAAG,OAAQywB,EAAO,MACxCkf,IAAU9D,IACZpb,EAAMtuB,MAAQ0tC,EAAU1tC,MACxBsuB,EAAMhrB,OAASoqC,EAAUpqC,OACzBgrB,EAAMmb,MAAQ,aACdnb,EAAMwa,SAAW4E,EAAU5E,UAE7BjrC,EAAE4qB,QAAQxqB,EAAGwrC,EAAO,CAAEhH,OAAQiL,EAAUjL,QAAUzmC,GACxC,IAANjF,GACF8G,EAAEO,QAAQmvC,YAAY1yC,KAAK4uC,GAE7BxrC,EAAIwrC,EAGN5rC,EAAE4qB,QAAQxqB,EAAGmC,EAAG,CAAEqiC,OAAQiL,EAAUjL,QAAUzmC,IAtCR4xC,CAAc/vC,EAAGP,OArBvD4lC,KA8DF,SAAcrlC,GACZ8a,EAAE3a,QAAQH,EAAEO,QAAQmvC,aAAa,SAAStvC,GACxC,IAEImC,EAFAjC,EAAON,EAAEM,KAAKF,GACd4vC,EAAY1vC,EAAKuvC,UAGrB,IADA7vC,EAAE4qB,QAAQtqB,EAAKwvC,QAASE,GACjB1vC,EAAKsrC,OACVrpC,EAAIvC,EAAEiwC,WAAW7vC,GAAG,GACpBJ,EAAE8oC,WAAW1oC,GACb4vC,EAAU/pC,OAAOjJ,KAAK,CAAEqF,EAAG/B,EAAK+B,EAAGC,EAAGhC,EAAKgC,IACxB,eAAfhC,EAAKsrC,QACPoE,EAAU3tC,EAAI/B,EAAK+B,EACnB2tC,EAAU1tC,EAAIhC,EAAKgC,EACnB0tC,EAAU7tC,MAAQ7B,EAAK6B,MACvB6tC,EAAUvqC,OAASnF,EAAKmF,QAE1BrF,EAAImC,EACJjC,EAAON,EAAEM,KAAKF,S,eCtFpB,IAAI0a,EAAI,EAAQ,MAEhBkpB,EAAOC,QAEP,SAAgCjkC,EAAGkwC,EAAIC,GACrC,IACEC,EADExK,EAAO,GAGX9qB,EAAE3a,QAAQgwC,GAAI,SAAS/vC,GAIrB,IAHA,IACEqT,EACA48B,EAFEvB,EAAQ9uC,EAAEyT,OAAOrT,GAGd0uC,GAAO,CASZ,IARAr7B,EAASzT,EAAEyT,OAAOq7B,KAEhBuB,EAAYzK,EAAKnyB,GACjBmyB,EAAKnyB,GAAUq7B,IAEfuB,EAAYD,EACZA,EAAWtB,GAETuB,GAAaA,IAAcvB,EAE7B,YADAoB,EAAGtlB,QAAQylB,EAAWvB,GAGxBA,EAAQr7B,Q,eCzBd,IAAIqH,EAAI,EAAQ,MAEhBkpB,EAAOC,QAEP,SAAoBjkC,EAAGswC,GACrB,OAAOx1B,EAAE3F,IAAIm7B,GAAS,SAASlwC,GAC7B,IAAImwC,EAAMvwC,EAAE+N,QAAQ3N,GACpB,GAAKmwC,EAAIt3C,OAEF,CACL,IAAIyO,EAASoT,EAAE+hB,OAAO0T,GAAK,SAAShB,EAAKlwC,GACvC,IAAII,EAAOO,EAAEP,KAAKJ,GAChBmxC,EAAQxwC,EAAEM,KAAKjB,EAAEe,GACnB,MAAO,CACLqwC,IAAKlB,EAAIkB,IAAOhxC,EAAKmlC,OAAS4L,EAAM3G,MACpCjF,OAAQ2K,EAAI3K,OAASnlC,EAAKmlC,UAE3B,CAAE6L,IAAK,EAAG7L,OAAQ,IAErB,MAAO,CACLxkC,EAAGA,EACHswC,WAAYhpC,EAAO+oC,IAAM/oC,EAAOk9B,OAChCA,OAAQl9B,EAAOk9B,QAdjB,MAAO,CAAExkC,EAAGA,Q,eCRlB,IAAI0a,EAAI,EAAQ,MACZ2sB,EAAQ,aAEZzD,EAAOC,QAgCP,SAAyBjkC,EAAG0lC,EAAMiL,GAChC,IAAIvP,EAgCN,SAAwBphC,GAEtB,IADA,IAAII,EACGJ,EAAE4wC,QAASxwC,EAAI0a,EAAEsqB,SAAS,YACjC,OAAOhlC,EAnCIywC,CAAe7wC,GACxB0H,EAAS,IAAI+/B,EAAM,CAAEI,UAAU,IAAQzf,SAAS,CAAEgZ,KAAMA,IACrD0P,qBAAoB,SAAS1wC,GAAK,OAAOJ,EAAEM,KAAKF,MA2BrD,OAzBA0a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIE,EAAON,EAAEM,KAAKF,GAChBqT,EAASzT,EAAEyT,OAAOrT,IAEhBE,EAAKolC,OAASA,GAAQplC,EAAK4lC,SAAWR,GAAQA,GAAQplC,EAAK6lC,WAC7Dz+B,EAAO2iB,QAAQjqB,GACfsH,EAAOq+B,UAAU3lC,EAAGqT,GAAU2tB,GAG9BtmB,EAAE3a,QAAQH,EAAE2wC,GAAcvwC,IAAI,SAASf,GACrC,IAAIipB,EAAIjpB,EAAEe,IAAMA,EAAIf,EAAEkD,EAAIlD,EAAEe,EAC1BX,EAAOiI,EAAOjI,KAAK6oB,EAAGloB,GACtBwkC,EAAU9pB,EAAE0zB,YAAY/uC,GAAsB,EAAdA,EAAKmlC,OACvCl9B,EAAOkjB,QAAQtC,EAAGloB,EAAG,CAAEwkC,OAAQ5kC,EAAEP,KAAKJ,GAAGulC,OAASA,OAGhD9pB,EAAE0I,IAAIljB,EAAM,YACdoH,EAAO2iB,QAAQjqB,EAAG,CAChB4lC,WAAY1lC,EAAK0lC,WAAWN,GAC5BO,YAAa3lC,EAAK2lC,YAAYP,SAM/Bh+B,I,4BC/DT,IAAIoT,EAAI,EAAQ,MA4BhB,SAASi2B,EAAmB/wC,EAAGgxC,EAAYC,GAczC,IAVA,IAAIC,EAAWp2B,EAAE6zB,UAAUsC,EACzBn2B,EAAE3F,IAAI87B,GAAY,SAAU7wC,EAAGlH,GAAK,OAAOA,MACzCi4C,EAAer2B,EAAEkuB,QAAQluB,EAAE3F,IAAI67B,GAAY,SAAS5wC,GACtD,OAAO0a,EAAE4zB,OAAO5zB,EAAE3F,IAAInV,EAAE6N,SAASzN,IAAI,SAASf,GAC5C,MAAO,CAAEkjB,IAAK2uB,EAAS7xC,EAAEkD,GAAIqiC,OAAQ5kC,EAAEP,KAAKJ,GAAGulC,WAC7C,WACF,GAGAwM,EAAa,EACVA,EAAaH,EAAWh4C,QAAQm4C,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAInzB,EAAOnD,EAAE3F,IAAI,IAAI/b,MAAMi4C,IAAW,WAAa,OAAO,KAGtDC,EAAK,EAeT,OAdAx2B,EAAE3a,QAAQgxC,EAAahxC,SAAQ,SAASmwB,GACtC,IAAIgN,EAAQhN,EAAM/N,IAAM6uB,EACxBnzB,EAAKqf,IAAUhN,EAAMsU,OAErB,IADA,IAAI2M,EAAY,EACTjU,EAAQ,GACTA,EAAQ,IACViU,GAAatzB,EAAKqf,EAAQ,IAG5Brf,EADAqf,EAASA,EAAQ,GAAM,IACRhN,EAAMsU,OAEvB0M,GAAMhhB,EAAMsU,OAAS2M,MAGhBD,EA7DTtN,EAAOC,QAkBP,SAAoBjkC,EAAGwxC,GAErB,IADA,IAAIF,EAAK,EACAp4C,EAAI,EAAGA,EAAIs4C,EAASv4C,SAAUC,EACrCo4C,GAAMP,EAAmB/wC,EAAGwxC,EAASt4C,EAAE,GAAIs4C,EAASt4C,IAEtD,OAAOo4C,I,4BCzBT,IAAIx2B,EAAI,EAAQ,MACZ22B,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAkB,EAAQ,MAC1BC,EAAyB,EAAQ,MACjCpK,EAAQ,aACRrD,EAAO,EAAQ,MA6CnB,SAAS0N,EAAiB9xC,EAAG+xC,EAAOpB,GAClC,OAAO71B,EAAE3F,IAAI48B,GAAO,SAASrM,GAC3B,OAAOkM,EAAgB5xC,EAAG0lC,EAAMiL,MAIpC,SAASqB,EAAiBC,EAAaC,GACrC,IAAIhC,EAAK,IAAIzI,EACb3sB,EAAE3a,QAAQ8xC,GAAa,SAASE,GAC9B,IAAI/Q,EAAO+Q,EAAG5xC,QAAQ6gC,KAClBgR,EAAST,EAAaQ,EAAI/Q,EAAM8O,EAAIgC,GACxCp3B,EAAE3a,QAAQiyC,EAAOjC,IAAI,SAAS/vC,EAAGlH,GAC/Bi5C,EAAG7xC,KAAKF,GAAGypC,MAAQ3wC,KAErB24C,EAAuBM,EAAIjC,EAAIkC,EAAOjC,OAI1C,SAASkC,EAAYryC,EAAGwxC,GACtB12B,EAAE3a,QAAQqxC,GAAU,SAAS1J,GAC3BhtB,EAAE3a,QAAQ2nC,GAAO,SAAS1nC,EAAGlH,GAC3B8G,EAAEM,KAAKF,GAAGypC,MAAQ3wC,QAhExB8qC,EAAOC,QAiBP,SAAejkC,GACb,IAAImmC,EAAU/B,EAAK+B,QAAQnmC,GACzBsyC,EAAkBR,EAAiB9xC,EAAG8a,EAAEkW,MAAM,EAAGmV,EAAU,GAAI,WAC/DoM,EAAgBT,EAAiB9xC,EAAG8a,EAAEkW,MAAMmV,EAAU,GAAI,GAAI,GAAI,YAEhEqL,EAAWC,EAAUzxC,GACzBqyC,EAAYryC,EAAGwxC,GAKf,IAHA,IACEgB,EADEC,EAAStuC,OAAOuoC,kBAGXxzC,EAAI,EAAGw5C,EAAW,EAAGA,EAAW,IAAKx5C,IAAKw5C,EAAU,CAC3DV,EAAiB94C,EAAI,EAAIo5C,EAAkBC,EAAer5C,EAAI,GAAK,GAEnEs4C,EAAWpN,EAAKwD,iBAAiB5nC,GACjC,IAAIsxC,EAAKI,EAAW1xC,EAAGwxC,GACnBF,EAAKmB,IACPC,EAAW,EACXF,EAAO13B,EAAEszB,UAAUoD,GACnBiB,EAASnB,GAIbe,EAAYryC,EAAGwyC,K,4BCjDjB,IAAI13B,EAAI,EAAQ,MAEhBkpB,EAAOC,QAaP,SAAmBjkC,GACjB,IAAI8kC,EAAU,GACV6N,EAAc73B,EAAEnP,OAAO3L,EAAEE,SAAS,SAASE,GAC7C,OAAQJ,EAAEsgC,SAASlgC,GAAGnH,UAEpBktC,EAAUrrB,EAAEoM,IAAIpM,EAAE3F,IAAIw9B,GAAa,SAASvyC,GAAK,OAAOJ,EAAEM,KAAKF,GAAGslC,SAClEqG,EAASjxB,EAAE3F,IAAI2F,EAAEkW,MAAMmV,EAAU,IAAI,WAAa,MAAO,MAUzDyM,EAAY93B,EAAE4zB,OAAOiE,GAAa,SAASvyC,GAAK,OAAOJ,EAAEM,KAAKF,GAAGslC,QAGrE,OAFA5qB,EAAE3a,QAAQyyC,GATV,SAAS7N,EAAI3kC,GACX,IAAI0a,EAAE0I,IAAIshB,EAAS1kC,GAAnB,CACA0kC,EAAQ1kC,IAAK,EACb,IAAIE,EAAON,EAAEM,KAAKF,GAClB2rC,EAAOzrC,EAAKolC,MAAM1oC,KAAKoD,GACvB0a,EAAE3a,QAAQH,EAAEiwC,WAAW7vC,GAAI2kC,OAMtBgH,I,4BClCT,IAAIjxB,EAAI,EAAQ,MAEhBkpB,EAAOC,QA2BP,SAA0B/N,EAASga,GACjC,IAAI2C,EAAgB,GA4BpB,OA3BA/3B,EAAE3a,QAAQ+1B,GAAS,SAAS5F,EAAOp3B,GACjC,IAAIwpC,EAAMmQ,EAAcviB,EAAMlwB,GAAK,CACjC0yC,SAAU,EACV,GAAM,GACN1K,IAAK,GACL+H,GAAI,CAAC7f,EAAMlwB,GACXlH,EAAGA,GAEA4hB,EAAE0zB,YAAYle,EAAMogB,cACvBhO,EAAIgO,WAAapgB,EAAMogB,WACvBhO,EAAIkC,OAAStU,EAAMsU,WAIvB9pB,EAAE3a,QAAQ+vC,EAAG1vC,SAAS,SAASnB,GAC7B,IAAI0zC,EAASF,EAAcxzC,EAAEe,GACzB4yC,EAASH,EAAcxzC,EAAEkD,GACxBuY,EAAE0zB,YAAYuE,IAAYj4B,EAAE0zB,YAAYwE,KAC3CA,EAAOF,WACPC,EAAO3K,IAAIprC,KAAK61C,EAAcxzC,EAAEkD,QAWtC,SAA4B0wC,GAC1B,IAAI/c,EAAU,GAEd,SAASgd,EAASC,GAChB,OAAO,SAAShK,GAmCpB,IAAsBtvC,EAAQu5C,EACxB3C,EACA7L,EApCIuE,EAAOkK,SAGPv4B,EAAE0zB,YAAYrF,EAAOuH,aACrB51B,EAAE0zB,YAAY2E,EAAOzC,aACrBvH,EAAOuH,YAAcyC,EAAOzC,cA6BR0C,EA5BDjK,EA6BvBsH,EAAM,EACN7L,EAAS,GAFO/qC,EA5BDs5C,GAgCRvO,SACT6L,GAAO52C,EAAO62C,WAAa72C,EAAO+qC,OAClCA,GAAU/qC,EAAO+qC,QAGfwO,EAAOxO,SACT6L,GAAO2C,EAAO1C,WAAa0C,EAAOxO,OAClCA,GAAUwO,EAAOxO,QAGnB/qC,EAAOs2C,GAAKiD,EAAOjD,GAAGzP,OAAO7mC,EAAOs2C,IACpCt2C,EAAO62C,WAAaD,EAAM7L,EAC1B/qC,EAAO+qC,OAASA,EAChB/qC,EAAOX,EAAI+K,KAAK+iB,IAAIosB,EAAOl6C,EAAGW,EAAOX,GACrCk6C,EAAOC,QAAS,IAzChB,SAASC,EAAUH,GACjB,OAAO,SAAS/J,GACdA,EAAW,GAAEpsC,KAAKm2C,GACQ,KAApB/J,EAAO0J,UACXG,EAAUj2C,KAAKosC,IAKrB,KAAO6J,EAAUh6C,QAAQ,CACvB,IAAIq3B,EAAQ2iB,EAAU7/B,MACtB8iB,EAAQl5B,KAAKszB,GACbxV,EAAE3a,QAAQmwB,EAAU,GAAEmd,UAAWyF,EAAS5iB,IAC1CxV,EAAE3a,QAAQmwB,EAAM8X,IAAKkL,EAAUhjB,IAGjC,OAAOxV,EAAE3F,IAAI2F,EAAEnP,OAAOuqB,GAAS,SAAS5F,GAAS,OAAQA,EAAM+iB,WAC7D,SAAS/iB,GACP,OAAOxV,EAAEyvB,KAAKja,EAAO,CAAC,KAAM,IAAK,aAAc,cArC5CijB,CAJSz4B,EAAEnP,OAAOknC,GAAe,SAASviB,GAC/C,OAAQA,EAAMwiB,e,eCzDlB,IAAIh4B,EAAI,EAAQ,MACZ41B,EAAa,EAAQ,MACrB8C,EAAmB,EAAQ,MAC3BC,EAAO,EAAQ,MAEnBzP,EAAOC,QAEP,SAAS0N,EAAa3xC,EAAGI,EAAG8vC,EAAIgC,GAC9B,IAAI5B,EAAUtwC,EAAEsgC,SAASlgC,GACrBE,EAAON,EAAEM,KAAKF,GACdszC,EAAKpzC,EAAOA,EAAK0lC,gBAAarpC,EAC9B0gB,EAAK/c,EAAOA,EAAK2lC,iBAAatpC,EAC9Bg3C,EAAY,GAEZD,IACFpD,EAAUx1B,EAAEnP,OAAO2kC,GAAS,SAAS/tC,GACnC,OAAOA,IAAMmxC,GAAMnxC,IAAM8a,MAI7B,IAAIu2B,EAAclD,EAAW1wC,EAAGswC,GAChCx1B,EAAE3a,QAAQyzC,GAAa,SAAStjB,GAC9B,GAAItwB,EAAEsgC,SAAShQ,EAAMlwB,GAAGnH,OAAQ,CAC9B,IAAI46C,EAAiBlC,EAAa3xC,EAAGswB,EAAMlwB,EAAG8vC,EAAIgC,GAClDyB,EAAUrjB,EAAMlwB,GAAKyzC,EACjB/4B,EAAE0I,IAAIqwB,EAAgB,gBAwCNh6C,EAvCDy2B,EAuCS6Q,EAvCF0S,EAwCzB/4B,EAAE0zB,YAAY30C,EAAO62C,aAMxB72C,EAAO62C,WAAavP,EAAMuP,WAC1B72C,EAAO+qC,OAASzD,EAAMyD,SANtB/qC,EAAO62C,YAAc72C,EAAO62C,WAAa72C,EAAO+qC,OAC3BzD,EAAMuP,WAAavP,EAAMyD,SACzB/qC,EAAO+qC,OAASzD,EAAMyD,QAC3C/qC,EAAO+qC,QAAUzD,EAAMyD,SAL3B,IAA0B/qC,EAAQsnC,KAlChC,IAAIjL,EAAUsd,EAAiBI,EAAa1D,IAuB9C,SAAyBha,EAASyd,GAChC74B,EAAE3a,QAAQ+1B,GAAS,SAAS5F,GAC1BA,EAAM6f,GAAKr1B,EAAEkuB,QAAQ1Y,EAAM6f,GAAGh7B,KAAI,SAAS/U,GACzC,OAAIuzC,EAAUvzC,GACLuzC,EAAUvzC,GAAG+vC,GAEf/vC,MACL,MA7BN0zC,CAAgB5d,EAASyd,GAEzB,IAAIjsC,EAAS+rC,EAAKvd,EAASgc,GAE3B,GAAIwB,IACFhsC,EAAOyoC,GAAKr1B,EAAEkuB,QAAQ,CAAC0K,EAAIhsC,EAAOyoC,GAAI9yB,IAAK,GACvCrd,EAAE+zC,aAAaL,GAAIz6C,QAAQ,CAC7B,IAAI+6C,EAASh0C,EAAEM,KAAKN,EAAE+zC,aAAaL,GAAI,IACrCO,EAASj0C,EAAEM,KAAKN,EAAE+zC,aAAa12B,GAAI,IAChCvC,EAAE0I,IAAI9b,EAAQ,gBACjBA,EAAOgpC,WAAa,EACpBhpC,EAAOk9B,OAAS,GAElBl9B,EAAOgpC,YAAchpC,EAAOgpC,WAAahpC,EAAOk9B,OAC3BoP,EAAOnK,MAAQoK,EAAOpK,QAAUniC,EAAOk9B,OAAS,GACrEl9B,EAAOk9B,QAAU,EAIrB,OAAOl9B,I,eCnDT,IAAIoT,EAAI,EAAQ,MACZspB,EAAO,EAAQ,MAmCnB,SAAS8P,EAAkB/D,EAAIgE,EAAY7W,GAEzC,IADA,IAAIgP,EACG6H,EAAWl7C,SAAWqzC,EAAOxxB,EAAEwxB,KAAK6H,IAAaj7C,GAAKokC,GAC3D6W,EAAW/gC,MACX+8B,EAAGnzC,KAAKsvC,EAAK6D,IACb7S,IAEF,OAAOA,EAxCT0G,EAAOC,QAEP,SAAc/N,EAASgc,GACrB,IAwCuBkC,EAxCnBC,EAAQjQ,EAAKkQ,UAAUpe,GAAS,SAAS5F,GAC3C,OAAOxV,EAAE0I,IAAI8M,EAAO,iBAElBikB,EAAWF,EAAMG,IACnBL,EAAar5B,EAAE4zB,OAAO2F,EAAMI,KAAK,SAASnkB,GAAS,OAAQA,EAAMp3B,KACjEi3C,EAAK,GACLM,EAAM,EACN7L,EAAS,EACT8P,EAAU,EAEZH,EAASd,MA8BcW,IA9BSlC,EA+BzB,SAASa,EAAQC,GACtB,OAAID,EAAOrC,WAAasC,EAAOtC,YACrB,EACCqC,EAAOrC,WAAasC,EAAOtC,WAC7B,EAGD0D,EAA6BpB,EAAO95C,EAAI65C,EAAO75C,EAAxC65C,EAAO75C,EAAI85C,EAAO95C,KApCnCw7C,EAAUR,EAAkB/D,EAAIgE,EAAYO,GAE5C55B,EAAE3a,QAAQo0C,GAAU,SAAUjkB,GAC5BokB,GAAWpkB,EAAM6f,GAAGl3C,OACpBk3C,EAAGnzC,KAAKszB,EAAM6f,IACdM,GAAOngB,EAAMogB,WAAapgB,EAAMsU,OAChCA,GAAUtU,EAAMsU,OAChB8P,EAAUR,EAAkB/D,EAAIgE,EAAYO,MAG9C,IAAIhtC,EAAS,CAAEyoC,GAAIr1B,EAAEkuB,QAAQmH,GAAI,IAKjC,OAJIvL,IACFl9B,EAAOgpC,WAAaD,EAAM7L,EAC1Bl9B,EAAOk9B,OAASA,GAEXl9B,I,eCjCT,IAAIoT,EAAI,EAAQ,MAEhBkpB,EAAOC,QAEP,SAA2BjkC,GACzB,IAAI20C,EAoEN,SAAmB30C,GACjB,IAAI0H,EAAS,GACTktC,EAAM,EASV,OAFA95B,EAAE3a,QAAQH,EAAEsgC,YALZ,SAASyE,EAAI3kC,GACX,IAAIy0C,EAAMD,EACV95B,EAAE3a,QAAQH,EAAEsgC,SAASlgC,GAAI2kC,GACzBr9B,EAAOtH,GAAK,CAAEy0C,IAAKA,EAAKD,IAAKA,QAIxBltC,EA/EaotC,CAAU90C,GAE9B8a,EAAE3a,QAAQH,EAAEO,QAAQmvC,aAAa,SAAStvC,GAUxC,IATA,IAAIE,EAAON,EAAEM,KAAKF,GACd0vC,EAAUxvC,EAAKwvC,QACfiF,EAqCR,SAAkB/0C,EAAG20C,EAAev0C,EAAGmC,GACrC,IAIIkR,EACAuhC,EALAC,EAAQ,GACRC,EAAQ,GACRL,EAAM5wC,KAAK+iB,IAAI2tB,EAAcv0C,GAAGy0C,IAAKF,EAAcpyC,GAAGsyC,KACtDD,EAAM3wC,KAAKijB,IAAIytB,EAAcv0C,GAAGw0C,IAAKD,EAAcpyC,GAAGqyC,KAK1DnhC,EAASrT,EACT,GACEqT,EAASzT,EAAEyT,OAAOA,GAClBwhC,EAAMj4C,KAAKyW,SACJA,IACCkhC,EAAclhC,GAAQohC,IAAMA,GAAOD,EAAMD,EAAclhC,GAAQmhC,MAKzE,IAJAI,EAAMvhC,EAGNA,EAASlR,GACDkR,EAASzT,EAAEyT,OAAOA,MAAauhC,GACrCE,EAAMl4C,KAAKyW,GAGb,MAAO,CAAED,KAAMyhC,EAAMvU,OAAOwU,EAAMzH,WAAYuH,IAAKA,GA5DlCG,CAASn1C,EAAG20C,EAAe7E,EAAQ1vC,EAAG0vC,EAAQvtC,GACzDiR,EAAOuhC,EAASvhC,KAChBwhC,EAAMD,EAASC,IACfI,EAAU,EACVC,EAAQ7hC,EAAK4hC,GACbE,GAAY,EAETl1C,IAAM0vC,EAAQvtC,GAAG,CAGtB,GAFAjC,EAAON,EAAEM,KAAKF,GAEVk1C,EAAW,CACb,MAAQD,EAAQ7hC,EAAK4hC,MAAcJ,GAC5Bh1C,EAAEM,KAAK+0C,GAAOlP,QAAU7lC,EAAKolC,MAClC0P,IAGEC,IAAUL,IACZM,GAAY,GAIhB,IAAKA,EAAW,CACd,KAAOF,EAAU5hC,EAAKva,OAAS,GACxB+G,EAAEM,KAAK+0C,EAAQ7hC,EAAK4hC,EAAU,IAAIlP,SAAW5lC,EAAKolC,MACvD0P,IAEFC,EAAQ7hC,EAAK4hC,GAGfp1C,EAAE+lC,UAAU3lC,EAAGi1C,GACfj1C,EAAIJ,EAAEiwC,WAAW7vC,GAAG,S,4BCtC1B,IAAI0a,EAAI,EAAQ,MACZ2sB,EAAQ,aACRrD,EAAO,EAAQ,MAqCnB,SAASmR,EAAmBv1C,EAAGwxC,GAC7B,IAAIgE,EAAY,GAqChB,OADA16B,EAAE+hB,OAAO2U,GAlCT,SAAoBiE,EAAW3N,GAC7B,IAGE4N,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAUx8C,OAC5B48C,EAAW/6B,EAAEwxB,KAAKxE,GAsBpB,OApBAhtB,EAAE3a,QAAQ2nC,GAAO,SAAS1nC,EAAGlH,GAC3B,IAAIqJ,EAuEV,SAAmCvC,EAAGI,GACpC,GAAIJ,EAAEM,KAAKF,GAAGwrC,MACZ,OAAO9wB,EAAEwzB,KAAKtuC,EAAE+zC,aAAa3zC,IAAI,SAASkoB,GACxC,OAAOtoB,EAAEM,KAAKgoB,GAAGsjB,SA1ETkK,CAA0B91C,EAAGI,GACnC21C,EAAKxzC,EAAIvC,EAAEM,KAAKiC,GAAGsnC,MAAQ+L,GAEzBrzC,GAAKnC,IAAMy1C,KACb/6B,EAAE3a,QAAQ2nC,EAAMxqC,MAAMq4C,EAASz8C,EAAG,IAAI,SAAS88C,GAC7Cl7B,EAAE3a,QAAQH,EAAE+zC,aAAaiC,IAAW,SAAS1tB,GAC3C,IAAI2tB,EAASj2C,EAAEM,KAAKgoB,GAClB4tB,EAAOD,EAAOpM,QACXqM,EAAOR,GAAMK,EAAKG,IACjBD,EAAOrK,OAAS5rC,EAAEM,KAAK01C,GAAUpK,OACrCuK,EAAYX,EAAWltB,EAAG0tB,SAIhCL,EAAUz8C,EAAI,EACdw8C,EAAKK,MAIFjO,KAIF0N,EAGT,SAASY,EAAmBp2C,EAAGwxC,GAC7B,IAAIgE,EAAY,GAEhB,SAASa,EAAKC,EAAOpF,EAAUqF,EAAUC,EAAiBC,GACxD,IAAIr2C,EACJ0a,EAAE3a,QAAQ2a,EAAEkW,MAAMkgB,EAAUqF,IAAW,SAASr9C,GAC9CkH,EAAIk2C,EAAMp9C,GACN8G,EAAEM,KAAKF,GAAGwrC,OACZ9wB,EAAE3a,QAAQH,EAAE+zC,aAAa3zC,IAAI,SAASkoB,GACpC,IAAIouB,EAAQ12C,EAAEM,KAAKgoB,GACfouB,EAAM9K,QACL8K,EAAM7M,MAAQ2M,GAAmBE,EAAM7M,MAAQ4M,IAClDN,EAAYX,EAAWltB,EAAGloB,SA8BpC,OADA0a,EAAE+hB,OAAO2U,GArBT,SAAoBmF,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElB3F,EAAW,EAeb,OAbAp2B,EAAE3a,QAAQm2C,GAAO,SAASl2C,EAAG02C,GAC3B,GAAwB,WAApB92C,EAAEM,KAAKF,GAAGwrC,MAAoB,CAChC,IAAImI,EAAe/zC,EAAE+zC,aAAa3zC,GAC9B2zC,EAAa96C,SACf29C,EAAe52C,EAAEM,KAAKyzC,EAAa,IAAIlK,MACvCwM,EAAKC,EAAOpF,EAAU4F,EAAgBD,EAAcD,GACpD1F,EAAW4F,EACXD,EAAeD,GAGnBP,EAAKC,EAAOpF,EAAUoF,EAAMr9C,OAAQ29C,EAAcD,EAAM19C,WAGnDq9C,KAIFd,EAWT,SAASW,EAAYX,EAAWp1C,EAAGmC,GACjC,GAAInC,EAAImC,EAAG,CACT,IAAImgC,EAAMtiC,EACVA,EAAImC,EACJA,EAAImgC,EAGN,IAAIqU,EAAavB,EAAUp1C,GACtB22C,IACHvB,EAAUp1C,GAAK22C,EAAa,IAE9BA,EAAWx0C,IAAK,EAGlB,SAASy0C,EAAYxB,EAAWp1C,EAAGmC,GACjC,GAAInC,EAAImC,EAAG,CACT,IAAImgC,EAAMtiC,EACVA,EAAImC,EACJA,EAAImgC,EAEN,OAAO5nB,EAAE0I,IAAIgyB,EAAUp1C,GAAImC,GAW7B,SAAS00C,EAAkBj3C,EAAGwxC,EAAUgE,EAAW0B,GACjD,IAAI9V,EAAO,GACT+V,EAAQ,GACR50B,EAAM,GAkCR,OA7BAzH,EAAE3a,QAAQqxC,GAAU,SAAS1J,GAC3BhtB,EAAE3a,QAAQ2nC,GAAO,SAAS1nC,EAAGypC,GAC3BzI,EAAKhhC,GAAKA,EACV+2C,EAAM/2C,GAAKA,EACXmiB,EAAIniB,GAAKypC,QAIb/uB,EAAE3a,QAAQqxC,GAAU,SAAS1J,GAC3B,IAAIsP,GAAW,EACft8B,EAAE3a,QAAQ2nC,GAAO,SAAS1nC,GACxB,IAAIi3C,EAAKH,EAAW92C,GACpB,GAAIi3C,EAAGp+C,OAGL,IADA,IAAIq+C,IADJD,EAAKv8B,EAAE4zB,OAAO2I,GAAI,SAAS90C,GAAK,OAAOggB,EAAIhgB,OAC9BtJ,OAAS,GAAK,EAClBC,EAAI+K,KAAKgd,MAAMq2B,GAAKC,EAAKtzC,KAAKkd,KAAKm2B,GAAKp+C,GAAKq+C,IAAMr+C,EAAG,CAC7D,IAAIqJ,EAAI80C,EAAGn+C,GACPi+C,EAAM/2C,KAAOA,GACbg3C,EAAU70B,EAAIhgB,KACby0C,EAAYxB,EAAWp1C,EAAGmC,KAC7B40C,EAAM50C,GAAKnC,EACX+2C,EAAM/2C,GAAKghC,EAAKhhC,GAAKghC,EAAK7+B,GAC1B60C,EAAU70B,EAAIhgB,WAOjB,CAAE6+B,KAAMA,EAAM+V,MAAOA,GAG9B,SAASK,EAAqBx3C,EAAGwxC,EAAUpQ,EAAM+V,EAAOM,GAMtD,IAAIC,EAAK,GACPC,EAmDJ,SAAyB33C,EAAGwxC,EAAUpQ,EAAMqW,GAC1C,IAAIG,EAAa,IAAInQ,EACnBqF,EAAa9sC,EAAEO,QACfs3C,EA+GJ,SAAajJ,EAASkJ,EAASL,GAC7B,OAAO,SAASz3C,EAAGI,EAAGmC,GACpB,IAGIw1C,EAHAC,EAASh4C,EAAEM,KAAKF,GAChB63C,EAASj4C,EAAEM,KAAKiC,GAChBkuC,EAAM,EAIV,GADAA,GAAOuH,EAAO71C,MAAQ,EAClB2Y,EAAE0I,IAAIw0B,EAAQ,YAChB,OAAQA,EAAO/M,SAASvP,eACxB,IAAK,IAAKqc,GAASC,EAAO71C,MAAQ,EAAG,MACrC,IAAK,IAAK41C,EAAQC,EAAO71C,MAAQ,EAYnC,GATI41C,IACFtH,GAAOgH,EAAaM,GAASA,GAE/BA,EAAQ,EAERtH,IAAQuH,EAAOpM,MAAQkM,EAAUlJ,GAAW,EAC5C6B,IAAQwH,EAAOrM,MAAQkM,EAAUlJ,GAAW,EAE5C6B,GAAOwH,EAAO91C,MAAQ,EAClB2Y,EAAE0I,IAAIy0B,EAAQ,YAChB,OAAQA,EAAOhN,SAASvP,eACxB,IAAK,IAAKqc,EAAQE,EAAO91C,MAAQ,EAAG,MACpC,IAAK,IAAK41C,GAASE,EAAO91C,MAAQ,EAQpC,OALI41C,IACFtH,GAAOgH,EAAaM,GAASA,GAE/BA,EAAQ,EAEDtH,GAjJCyH,CAAIpL,EAAWkB,QAASlB,EAAWiB,QAAS0J,GAgBtD,OAdA38B,EAAE3a,QAAQqxC,GAAU,SAAS1J,GAC3B,IAAIxf,EACJxN,EAAE3a,QAAQ2nC,GAAO,SAAS1nC,GACxB,IAAI+3C,EAAQ/W,EAAKhhC,GAEjB,GADAw3C,EAAWvtB,QAAQ8tB,GACf7vB,EAAG,CACL,IAAI8vB,EAAQhX,EAAK9Y,GACf+vB,EAAUT,EAAWn4C,KAAK24C,EAAOD,GACnCP,EAAWhtB,QAAQwtB,EAAOD,EAAOl0C,KAAKijB,IAAI2wB,EAAM73C,EAAGI,EAAGkoB,GAAI+vB,GAAW,IAEvE/vB,EAAIloB,QAIDw3C,EAtEIU,CAAgBt4C,EAAGwxC,EAAUpQ,EAAMqW,GAC5C9R,EAAa8R,EAAa,aAAe,cAE3C,SAASc,EAAQC,EAAWC,GAI1B,IAHA,IAAI/iB,EAAQiiB,EAAOz3C,QACfmsB,EAAOqJ,EAAMtiB,MACb0xB,EAAU,GACPzY,GACDyY,EAAQzY,GACVmsB,EAAUnsB,IAEVyY,EAAQzY,IAAQ,EAChBqJ,EAAM14B,KAAKqvB,GACXqJ,EAAQA,EAAMgL,OAAO+X,EAAcpsB,KAGrCA,EAAOqJ,EAAMtiB,MA+BjB,OARAmlC,GAlBA,SAAelsB,GACbqrB,EAAGrrB,GAAQsrB,EAAO5pC,QAAQse,GAAMwQ,QAAO,SAAS0S,EAAKlwC,GACnD,OAAO4E,KAAKijB,IAAIqoB,EAAKmI,EAAGr4C,EAAEe,GAAKu3C,EAAOl4C,KAAKJ,MAC1C,KAeUs4C,EAAO5D,aAAa2E,KAAKf,IACxCY,GAZA,SAAelsB,GACb,IAAIrF,EAAM2wB,EAAO9pC,SAASwe,GAAMwQ,QAAO,SAAS0S,EAAKlwC,GACnD,OAAO4E,KAAK+iB,IAAIuoB,EAAKmI,EAAGr4C,EAAEkD,GAAKo1C,EAAOl4C,KAAKJ,MAC1C8E,OAAOuoC,mBAENpsC,EAAON,EAAEM,KAAK+rB,GACdrF,IAAQ7iB,OAAOuoC,mBAAqBpsC,EAAKqlC,aAAeA,IAC1D+R,EAAGrrB,GAAQpoB,KAAKijB,IAAIwwB,EAAGrrB,GAAOrF,MAKnB2wB,EAAO1H,WAAWyI,KAAKf,IAGtC78B,EAAE3a,QAAQg3C,GAAO,SAAS/2C,GACxBs3C,EAAGt3C,GAAKs3C,EAAGtW,EAAKhhC,OAGXs3C,EA6BT,SAASiB,EAA2B34C,EAAG44C,GACrC,OAAO99B,EAAE2zB,MAAM3zB,EAAEigB,OAAO6d,IAAM,SAAUlB,GACtC,IAAIxwB,EAAM/iB,OAAO00C,kBACb7xB,EAAM7iB,OAAOuoC,kBASjB,OAPA5xB,EAAEyzB,MAAMmJ,GAAI,SAAUr1C,EAAGjC,GACvB,IAAI04C,EAyHV,SAAe94C,EAAGI,GAChB,OAAOJ,EAAEM,KAAKF,GAAG+B,MA1HGA,CAAMnC,EAAGI,GAAK,EAE9B8mB,EAAMjjB,KAAKijB,IAAI7kB,EAAIy2C,EAAW5xB,GAC9BF,EAAM/iB,KAAK+iB,IAAI3kB,EAAIy2C,EAAW9xB,MAGzBE,EAAMF,KAWjB,SAAS+xB,EAAiBH,EAAKI,GAC7B,IAAIC,EAAcn+B,EAAEigB,OAAOie,GACzBE,EAAap+B,EAAEkM,IAAIiyB,GACnBE,EAAar+B,EAAEoM,IAAI+xB,GAErBn+B,EAAE3a,QAAQ,CAAC,IAAK,MAAM,SAASi5C,GAC7Bt+B,EAAE3a,QAAQ,CAAC,IAAK,MAAM,SAASk5C,GAC7B,IAEEtB,EAFEuB,EAAYF,EAAOC,EACrB3B,EAAKkB,EAAIU,GAEX,GAAI5B,IAAOsB,EAAX,CAEA,IAAIO,EAASz+B,EAAEigB,OAAO2c,IACtBK,EAAkB,MAAVsB,EAAgBH,EAAap+B,EAAEkM,IAAIuyB,GAAUJ,EAAar+B,EAAEoM,IAAIqyB,MAGtEX,EAAIU,GAAax+B,EAAEmzB,UAAUyJ,GAAI,SAASr1C,GAAK,OAAOA,EAAI01C,aAMlE,SAASyB,EAAQZ,EAAKzB,GACpB,OAAOr8B,EAAEmzB,UAAU2K,EAAIa,IAAI,SAASC,EAAQt5C,GAC1C,GAAI+2C,EACF,OAAOyB,EAAIzB,EAAMzb,eAAet7B,GAEhC,IAAIs3C,EAAK58B,EAAE4zB,OAAO5zB,EAAE3F,IAAIyjC,EAAKx4C,IAC7B,OAAQs3C,EAAG,GAAKA,EAAG,IAAM,KAzU/B1T,EAAOC,QAAU,CACf0V,UA6UF,SAAmB35C,GACjB,IAMI45C,EANApI,EAAWpN,EAAKwD,iBAAiB5nC,GACjCw1C,EAAY16B,EAAEqvB,MAChBoL,EAAmBv1C,EAAGwxC,GACtB4E,EAAmBp2C,EAAGwxC,IAEpBoH,EAAM,GAEV99B,EAAE3a,QAAQ,CAAC,IAAK,MAAM,SAASi5C,GAC7BQ,EAA4B,MAATR,EAAe5H,EAAW12B,EAAEigB,OAAOyW,GAAU/D,UAChE3yB,EAAE3a,QAAQ,CAAC,IAAK,MAAM,SAASk5C,GACf,MAAVA,IACFO,EAAmB9+B,EAAE3F,IAAIykC,GAAkB,SAASC,GAClD,OAAO/+B,EAAEigB,OAAO8e,GAAOpM,cAI3B,IAAIyJ,GAAuB,MAATkC,EAAep5C,EAAE+zC,aAAe/zC,EAAEiwC,YAAYyI,KAAK14C,GACjEm3C,EAAQF,EAAkBj3C,EAAG45C,EAAkBpE,EAAW0B,GAC1DQ,EAAKF,EAAqBx3C,EAAG45C,EAC/BzC,EAAM/V,KAAM+V,EAAMA,MAAiB,MAAVkC,GACb,MAAVA,IACF3B,EAAK58B,EAAEmzB,UAAUyJ,GAAI,SAASr1C,GAAK,OAAQA,MAE7Cu2C,EAAIQ,EAAOC,GAAS3B,QAIxB,IAAIoC,EAAgBnB,EAA2B34C,EAAG44C,GAElD,OADAG,EAAiBH,EAAKkB,GACfN,EAAQZ,EAAK54C,EAAEO,QAAQ42C,QA1W9B5B,mBAAoBA,EACpBa,mBAAoBA,EACpBD,YAAaA,EACba,YAAaA,EACbC,kBAAmBA,EACnBO,qBAAsBA,EACtBuB,iBAAkBA,EAClBJ,2BAA4BA,EAC5Ba,QAASA,I,4BCnBX,IAAI1+B,EAAI,EAAQ,MACZspB,EAAO,EAAQ,MACfuV,EAAY,kBAEhB3V,EAAOC,QAEP,SAAkBjkC,IASlB,SAAmBA,GACjB,IAAIwxC,EAAWpN,EAAKwD,iBAAiB5nC,GACjC+5C,EAAU/5C,EAAEO,QAAQsoB,QACpBmxB,EAAQ,EACZl/B,EAAE3a,QAAQqxC,GAAU,SAAS1J,GAC3B,IAAImS,EAAYn/B,EAAEoM,IAAIpM,EAAE3F,IAAI2yB,GAAO,SAAS1nC,GAAK,OAAOJ,EAAEM,KAAKF,GAAGqF,WAClEqV,EAAE3a,QAAQ2nC,GAAO,SAAS1nC,GACxBJ,EAAEM,KAAKF,GAAGkC,EAAI03C,EAAQC,EAAY,KAEpCD,GAASC,EAAYF,MAfvBG,CAFAl6C,EAAIokC,EAAKkH,mBAAmBtrC,IAG5B8a,EAAE3a,QAAQw5C,EAAU35C,IAAI,SAASqC,EAAGjC,GAClCJ,EAAEM,KAAKF,GAAGiC,EAAIA,O,2BCXlB,IAAIyY,EAAI,EAAQ,MACZ2sB,EAAQ,aACR0S,EAAQ,cAmDZ,SAASC,EAAU9wC,EAAGtJ,GAcpB,OADA8a,EAAE3a,QAAQmJ,EAAEpJ,SAZZ,SAAS6kC,EAAI3kC,GACX0a,EAAE3a,QAAQH,EAAEq6C,UAAUj6C,IAAI,SAASf,GACjC,IAAIi7C,EAAQj7C,EAAEe,EACZmC,EAAKnC,IAAMk6C,EAASj7C,EAAEkD,EAAI+3C,EACvBhxC,EAAEsnC,QAAQruC,IAAO43C,EAAMn6C,EAAGX,KAC7BiK,EAAE+gB,QAAQ9nB,EAAG,IACb+G,EAAEshB,QAAQxqB,EAAGmC,EAAG,IAChBwiC,EAAIxiC,UAMH+G,EAAE0+B,YAOX,SAASuS,EAAiBjxC,EAAGtJ,GAC3B,OAAO8a,EAAE2zB,MAAMzuC,EAAEQ,SAAS,SAASnB,GACjC,GAAIiK,EAAEsnC,QAAQvxC,EAAEe,KAAOkJ,EAAEsnC,QAAQvxC,EAAEkD,GACjC,OAAO43C,EAAMn6C,EAAGX,MAKtB,SAASm7C,EAAWlxC,EAAGtJ,EAAG+3C,GACxBj9B,EAAE3a,QAAQmJ,EAAEpJ,SAAS,SAASE,GAC5BJ,EAAEM,KAAKF,GAAGslC,MAAQqS,KAhFtB/T,EAAOC,QA2BP,SAAsBjkC,GACpB,IAOIP,EAAMs4C,EAPNzuC,EAAI,IAAIm+B,EAAM,CAAEgT,UAAU,IAG1BvpC,EAAQlR,EAAEE,QAAQ,GAClBggB,EAAOlgB,EAAEgoC,YAIb,IAHA1+B,EAAE+gB,QAAQnZ,EAAO,IAGVkpC,EAAU9wC,EAAGtJ,GAAKkgB,GACvBzgB,EAAO86C,EAAiBjxC,EAAGtJ,GAC3B+3C,EAAQzuC,EAAEsnC,QAAQnxC,EAAKW,GAAK+5C,EAAMn6C,EAAGP,IAAS06C,EAAMn6C,EAAGP,GACvD+6C,EAAWlxC,EAAGtJ,EAAG+3C,GAGnB,OAAOzuC,I,4BC9CT,IACIoxC,EADW,EAAQ,MACIA,YACvBC,EAAe,EAAQ,KACvBC,EAAiB,EAAQ,MAE7B5W,EAAOC,QAqBP,SAAcjkC,GACZ,OAAOA,EAAEO,QAAQuoB,QACjB,IAAK,kBAAmB+xB,EAAqB76C,GAAI,MACjD,IAAK,cASP,SAAyBA,GACvB06C,EAAY16C,GACZ26C,EAAa36C,GAXM86C,CAAgB96C,GAAI,MACvC,IAAK,eAAgB+6C,EAAkB/6C,GAAI,MAC3C,QAAS66C,EAAqB76C,KAKhC,IAAI+6C,EAAoBL,EAOxB,SAASG,EAAqB76C,GAC5B46C,EAAe56C,K,4BC5CjB,IAAI8a,EAAI,EAAQ,MACZ6/B,EAAe,EAAQ,KACvBR,EAAQ,cACRa,EAAW,oBACXC,EAAW,oBACXnG,EAAY,qBACZ1X,EAAW,iBA6Cf,SAASwd,EAAe56C,GACtBA,EAAIo9B,EAASp9B,GACbg7C,EAASh7C,GACT,IAIIX,EAJAiK,EAAIqxC,EAAa36C,GAKrB,IAJAk7C,EAAiB5xC,GACjB6xC,EAAc7xC,EAAGtJ,GAGTX,EAAI+7C,EAAU9xC,IAEpB+xC,EAAc/xC,EAAGtJ,EAAGX,EADhBi8C,EAAUhyC,EAAGtJ,EAAGX,IAQxB,SAAS87C,EAAc7xC,EAAGtJ,GACxB,IAAImwC,EAAK2E,EAAUxrC,EAAGA,EAAEpJ,SACxBiwC,EAAKA,EAAG7yC,MAAM,EAAG6yC,EAAGl3C,OAAS,GAC7B6hB,EAAE3a,QAAQgwC,GAAI,SAAS/vC,IAKzB,SAAwBkJ,EAAGtJ,EAAG8uC,GAC5B,IACIr7B,EADWnK,EAAEhJ,KAAKwuC,GACAr7B,OACtBnK,EAAE7J,KAAKqvC,EAAOr7B,GAAQ8nC,SAAWC,EAAalyC,EAAGtJ,EAAG8uC,GAPlD2M,CAAenyC,EAAGtJ,EAAGI,MAczB,SAASo7C,EAAalyC,EAAGtJ,EAAG8uC,GAC1B,IACIr7B,EADWnK,EAAEhJ,KAAKwuC,GACAr7B,OAElBioC,GAAc,EAEdC,EAAY37C,EAAEP,KAAKqvC,EAAOr7B,GAE1BmoC,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAY37C,EAAEP,KAAKgU,EAAQq7B,IAG7B8M,EAAWD,EAAU/W,OAErB9pB,EAAE3a,QAAQH,EAAEq6C,UAAUvL,IAAQ,SAASzvC,GACrC,IAqHsBipB,EAAGloB,EArHrBy7C,EAAYx8C,EAAEe,IAAM0uC,EACtB3N,EAAQ0a,EAAYx8C,EAAEkD,EAAIlD,EAAEe,EAE9B,GAAI+gC,IAAU1tB,EAAQ,CACpB,IAAIqoC,EAAeD,IAAcH,EAC/BK,EAAc/7C,EAAEP,KAAKJ,GAAGulC,OAG1B,GADAgX,GAAYE,EAAeC,GAAeA,EA8GtBzzB,EA7GFwmB,EA6GK1uC,EA7GE+gC,EAAV73B,EA8GP0yC,QAAQ1zB,EAAGloB,GA9Gc,CAC/B,IAAI67C,EAAgB3yC,EAAE7J,KAAKqvC,EAAO3N,GAAOoa,SACzCK,GAAYE,GAAgBG,EAAgBA,OAK3CL,EAGT,SAASV,EAAiBj9B,EAAMmjB,GAC1B5C,UAAUvlC,OAAS,IACrBmoC,EAAOnjB,EAAK/d,QAAQ,IAEtBg8C,EAAgBj+B,EAAM,GAAI,EAAGmjB,GAG/B,SAAS8a,EAAgBj+B,EAAM6mB,EAASqX,EAAS/7C,EAAGqT,GAClD,IAAIohC,EAAMsH,EACNx1B,EAAQ1I,EAAK3d,KAAKF,GAkBtB,OAhBA0kC,EAAQ1kC,IAAK,EACb0a,EAAE3a,QAAQ8d,EAAKm+B,UAAUh8C,IAAI,SAASmC,GAC/BuY,EAAE0I,IAAIshB,EAASviC,KAClB45C,EAAUD,EAAgBj+B,EAAM6mB,EAASqX,EAAS55C,EAAGnC,OAIzDumB,EAAMkuB,IAAMA,EACZluB,EAAMiuB,IAAMuH,IACR1oC,EACFkT,EAAMlT,OAASA,SAGRkT,EAAMlT,OAGR0oC,EAGT,SAASf,EAAUn9B,GACjB,OAAOnD,EAAEwzB,KAAKrwB,EAAKzd,SAAS,SAASnB,GACnC,OAAO4e,EAAKxe,KAAKJ,GAAGk8C,SAAW,KAInC,SAASD,EAAUhyC,EAAGtJ,EAAGP,GACvB,IAAIW,EAAIX,EAAKW,EACTmC,EAAI9C,EAAK8C,EAKRvC,EAAEg8C,QAAQ57C,EAAGmC,KAChBnC,EAAIX,EAAK8C,EACTA,EAAI9C,EAAKW,GAGX,IAAI43C,EAAS1uC,EAAEhJ,KAAKF,GAChB63C,EAAS3uC,EAAEhJ,KAAKiC,GAChB85C,EAAYrE,EACZsE,GAAO,EAIPtE,EAAOpD,IAAMqD,EAAOrD,MACtByH,EAAYpE,EACZqE,GAAO,GAGT,IAAIC,EAAazhC,EAAEnP,OAAO3L,EAAEQ,SAAS,SAASf,GAC5C,OAAO68C,IAASE,EAAalzC,EAAGA,EAAEhJ,KAAKb,EAAKW,GAAIi8C,IACzCC,IAASE,EAAalzC,EAAGA,EAAEhJ,KAAKb,EAAK8C,GAAI85C,MAGlD,OAAOvhC,EAAE2zB,MAAM8N,GAAY,SAAS98C,GAAQ,OAAO06C,EAAMn6C,EAAGP,MAG9D,SAAS47C,EAAc/xC,EAAGtJ,EAAGX,EAAG0I,GAC9B,IAAI3H,EAAIf,EAAEe,EACNmC,EAAIlD,EAAEkD,EACV+G,EAAE27B,WAAW7kC,EAAGmC,GAChB+G,EAAEshB,QAAQ7iB,EAAE3H,EAAG2H,EAAExF,EAAG,IACpB24C,EAAiB5xC,GACjB6xC,EAAc7xC,EAAGtJ,GAInB,SAAqBsJ,EAAGtJ,GACtB,IAAIohC,EAAOtmB,EAAEwzB,KAAKhlC,EAAEpJ,SAAS,SAASE,GAAK,OAAQJ,EAAEM,KAAKF,GAAGqT,UACzD08B,EAAK8K,EAAS3xC,EAAG83B,GACrB+O,EAAKA,EAAG7yC,MAAM,GACdwd,EAAE3a,QAAQgwC,GAAI,SAAS/vC,GACrB,IAAIqT,EAASnK,EAAEhJ,KAAKF,GAAGqT,OACrBhU,EAAOO,EAAEP,KAAKW,EAAGqT,GACjBgpC,GAAU,EAEPh9C,IACHA,EAAOO,EAAEP,KAAKgU,EAAQrT,GACtBq8C,GAAU,GAGZz8C,EAAEM,KAAKF,GAAGslC,KAAO1lC,EAAEM,KAAKmT,GAAQiyB,MAAQ+W,EAAUh9C,EAAKurC,QAAUvrC,EAAKurC,WAjBxE0R,CAAYpzC,EAAGtJ,GAgCjB,SAASw8C,EAAav+B,EAAM+5B,EAAQ2E,GAClC,OAAOA,EAAU9H,KAAOmD,EAAOpD,KAAOoD,EAAOpD,KAAO+H,EAAU/H,IA9NhE5Q,EAAOC,QAAU2W,EAGjBA,EAAeM,iBAAmBA,EAClCN,EAAeO,cAAgBA,EAC/BP,EAAeY,aAAeA,EAC9BZ,EAAeQ,UAAYA,EAC3BR,EAAeU,UAAYA,EAC3BV,EAAeS,cAAgBA,G,4BChB/B,IAAIvgC,EAAI,EAAQ,MAEhBkpB,EAAOC,QAAU,CACfyW,YAyBF,SAAqB16C,GACnB,IAAI8kC,EAAU,GAsBdhqB,EAAE3a,QAAQH,EAAE4oC,WApBZ,SAAS7D,EAAI3kC,GACX,IAAIumB,EAAQ3mB,EAAEM,KAAKF,GACnB,GAAI0a,EAAE0I,IAAIshB,EAAS1kC,GACjB,OAAOumB,EAAM+e,KAEfZ,EAAQ1kC,IAAK,EAEb,IAAIslC,EAAO5qB,EAAEkM,IAAIlM,EAAE3F,IAAInV,EAAE6N,SAASzN,IAAI,SAASf,GAC7C,OAAO0lC,EAAI1lC,EAAEkD,GAAKvC,EAAEP,KAAKJ,GAAG2rC,WAS9B,OANItF,IAASvhC,OAAOuoC,mBAAhBhH,MACAA,IAEFA,EAAO,GAGD/e,EAAM+e,KAAOA,MA5CvByU,MAsDF,SAAen6C,EAAGX,GAChB,OAAOW,EAAEM,KAAKjB,EAAEkD,GAAGmjC,KAAO1lC,EAAEM,KAAKjB,EAAEe,GAAGslC,KAAO1lC,EAAEP,KAAKJ,GAAG2rC,U,4BCzDzD,IAAIlwB,EAAI,EAAQ,MACZ2sB,EAAQ,aAsBZ,SAAS3B,EAAa9lC,EAAGpB,EAAM6xB,EAAOtyB,GACpC,IAAIiC,EACJ,GACEA,EAAI0a,EAAEsqB,SAASjnC,SACR6B,EAAE4wC,QAAQxwC,IAInB,OAFAqwB,EAAMmb,MAAQhtC,EACdoB,EAAEqqB,QAAQjqB,EAAGqwB,GACNrwB,EAiKT,SAAS+lC,EAAQnmC,GACf,OAAO8a,EAAEoM,IAAIpM,EAAE3F,IAAInV,EAAEE,SAAS,SAASE,GACrC,IAAIslC,EAAO1lC,EAAEM,KAAKF,GAAGslC,KACrB,IAAK5qB,EAAE0zB,YAAY9I,GACjB,OAAOA,MAjMb1B,EAAOC,QAAU,CACf6B,aAAcA,EACd1I,SAiCF,SAAkBp9B,GAChB,IAAI48C,GAAa,IAAInV,GAAQrf,SAASpoB,EAAEO,SAUxC,OATAua,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAAKw8C,EAAWvyB,QAAQjqB,EAAGJ,EAAEM,KAAKF,OAChE0a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5B,IAAIw9C,EAAcD,EAAWn9C,KAAKJ,EAAEe,EAAGf,EAAEkD,IAAM,CAAEqiC,OAAQ,EAAGoG,OAAQ,GAChErkB,EAAQ3mB,EAAEP,KAAKJ,GACnBu9C,EAAWhyB,QAAQvrB,EAAEe,EAAGf,EAAEkD,EAAG,CAC3BqiC,OAAQiY,EAAYjY,OAASje,EAAMie,OACnCoG,OAAQ/mC,KAAKijB,IAAI21B,EAAY7R,OAAQrkB,EAAMqkB,aAGxC4R,GA3CPtR,mBA8CF,SAA4BtrC,GAC1B,IAAI48C,EAAa,IAAInV,EAAM,CAAE9e,WAAY3oB,EAAE88C,iBAAkB10B,SAASpoB,EAAEO,SASxE,OARAua,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GACvBJ,EAAEsgC,SAASlgC,GAAGnH,QACjB2jD,EAAWvyB,QAAQjqB,EAAGJ,EAAEM,KAAKF,OAGjC0a,EAAE3a,QAAQH,EAAEQ,SAAS,SAASnB,GAC5Bu9C,EAAWhyB,QAAQvrB,EAAGW,EAAEP,KAAKJ,OAExBu9C,GAvDPG,iBA0DF,SAA0B/8C,GACxB,IAAIg9C,EAAYliC,EAAE3F,IAAInV,EAAEE,SAAS,SAASE,GACxC,IAAI68C,EAAO,GAIX,OAHAniC,EAAE3a,QAAQH,EAAE6N,SAASzN,IAAI,SAASf,GAChC49C,EAAK59C,EAAEkD,IAAM06C,EAAK59C,EAAEkD,IAAM,GAAKvC,EAAEP,KAAKJ,GAAGulC,UAEpCqY,KAET,OAAOniC,EAAE6zB,UAAU3uC,EAAEE,QAAS88C,IAjE9BE,mBAoEF,SAA4Bl9C,GAC1B,IAAIg9C,EAAYliC,EAAE3F,IAAInV,EAAEE,SAAS,SAASE,GACxC,IAAI+8C,EAAQ,GAIZ,OAHAriC,EAAE3a,QAAQH,EAAE+N,QAAQ3N,IAAI,SAASf,GAC/B89C,EAAM99C,EAAEe,IAAM+8C,EAAM99C,EAAEe,IAAM,GAAKJ,EAAEP,KAAKJ,GAAGulC,UAEtCuY,KAET,OAAOriC,EAAE6zB,UAAU3uC,EAAEE,QAAS88C,IA3E9B/sC,cAkFF,SAAuBzD,EAAMqD,GAC3B,IAcIlF,EAAIC,EAdJvI,EAAImK,EAAKnK,EACTC,EAAIkK,EAAKlK,EAIT0L,EAAK6B,EAAMxN,EAAIA,EACf4L,EAAK4B,EAAMvN,EAAIA,EACfC,EAAIiK,EAAKrK,MAAQ,EACjBK,EAAIgK,EAAK/G,OAAS,EAEtB,IAAKuI,IAAOC,EACV,MAAM,IAAI0xB,MAAM,6DAoBlB,OAhBI17B,KAAK0F,IAAIsE,GAAM1L,EAAI0B,KAAK0F,IAAIqE,GAAMxL,GAEhCyL,EAAK,IACPzL,GAAKA,GAEPmI,EAAKnI,EAAIwL,EAAKC,EACdrD,EAAKpI,IAGDwL,EAAK,IACPzL,GAAKA,GAEPoI,EAAKpI,EACLqI,EAAKrI,EAAI0L,EAAKD,GAGT,CAAE3L,EAAGA,EAAIsI,EAAIrI,EAAGA,EAAIsI,IAjH3Bg9B,iBAwHF,SAA0B5nC,GACxB,IAAIwxC,EAAW12B,EAAE3F,IAAI2F,EAAEkW,MAAMmV,EAAQnmC,GAAK,IAAI,WAAa,MAAO,MAQlE,OAPA8a,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIE,EAAON,EAAEM,KAAKF,GACdslC,EAAOplC,EAAKolC,KACX5qB,EAAE0zB,YAAY9I,KACjB8L,EAAS9L,GAAMplC,EAAKupC,OAASzpC,MAG1BoxC,GAhIPjI,eAuIF,SAAwBvpC,GACtB,IAAIgnB,EAAMlM,EAAEkM,IAAIlM,EAAE3F,IAAInV,EAAEE,SAAS,SAASE,GAAK,OAAOJ,EAAEM,KAAKF,GAAGslC,SAChE5qB,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIE,EAAON,EAAEM,KAAKF,GACd0a,EAAE0I,IAAIljB,EAAM,UACdA,EAAKolC,MAAQ1e,OA3IjByiB,iBAgJF,SAA0BzpC,GAExB,IAAI0yB,EAAS5X,EAAEkM,IAAIlM,EAAE3F,IAAInV,EAAEE,SAAS,SAASE,GAAK,OAAOJ,EAAEM,KAAKF,GAAGslC,SAE/DqG,EAAS,GACbjxB,EAAE3a,QAAQH,EAAEE,SAAS,SAASE,GAC5B,IAAIslC,EAAO1lC,EAAEM,KAAKF,GAAGslC,KAAOhT,EACvBqZ,EAAOrG,KACVqG,EAAOrG,GAAQ,IAEjBqG,EAAOrG,GAAM1oC,KAAKoD,MAGpB,IAAI23C,EAAQ,EACRtI,EAAiBzvC,EAAEO,QAAQkvC,eAC/B30B,EAAE3a,QAAQ4rC,GAAQ,SAASoE,EAAIj3C,GACzB4hB,EAAE0zB,YAAY2B,IAAOj3C,EAAIu2C,GAAmB,IAC5CsI,EACOA,GACTj9B,EAAE3a,QAAQgwC,GAAI,SAAS/vC,GAAKJ,EAAEM,KAAKF,GAAGslC,MAAQqS,SAlKlDzS,cAuKF,SAAuBtlC,EAAGulC,EAAQG,EAAMmE,GACtC,IAAIvpC,EAAO,CACT6B,MAAO,EACPsD,OAAQ,GAMV,OAJI+4B,UAAUvlC,QAAU,IACtBqH,EAAKolC,KAAOA,EACZplC,EAAKupC,MAAQA,GAER/D,EAAa9lC,EAAG,SAAUM,EAAMilC,IA/KvCY,QAASA,EACTmO,UA+LF,SAAmB8I,EAAYC,GAC7B,IAAI31C,EAAS,CAAE8sC,IAAK,GAAIC,IAAK,IAQ7B,OAPA35B,EAAE3a,QAAQi9C,GAAY,SAAS9hD,GACzB+hD,EAAG/hD,GACLoM,EAAO8sC,IAAIx3C,KAAK1B,GAEhBoM,EAAO+sC,IAAIz3C,KAAK1B,MAGboM,GAvMP28B,KA8MF,SAAclmC,EAAMk/C,GAClB,IAAInsC,EAAQ4J,EAAE7J,MACd,IACE,OAAOosC,IACP,QACA9yC,QAAQs3B,IAAI1jC,EAAO,WAAa2c,EAAE7J,MAAQC,GAAS,QAlNrDozB,OAsNF,SAAgBnmC,EAAMk/C,GACpB,OAAOA,O,SC5OTrZ,EAAOC,QAAU,S,qBCAjB,OAAC,SAAWqZ,GACV,aAiBA,IAkFEC,EAASC,EAAqBC,EAlF5BC,EAAY,KAIdC,EAAa,IAGbC,EAAW,mBAGXC,EAAO,qgCAGP30C,EAAK,qgCAIL40C,EAAW,CAOTC,UAAW,GAiBXC,SAAU,EAeVC,OAAQ,EAIRC,UAAW,EAIXC,SAAW,GAIXC,MAAOV,EAIPW,KAAMX,EAGNY,QAAQ,GAQVC,GAAW,EAEXC,EAAe,kBACfC,EAAkBD,EAAe,qBACjCE,EAAyBF,EAAe,2BACxCG,EAAoBH,EAAe,qBAEnCI,EAAY36C,KAAKgd,MACjB49B,EAAU56C,KAAKmN,IAEf0tC,EAAW,6CACXC,EAAQ,yDACRC,EAAU,gDACVC,EAAY,qCAEZC,EAAO,IAIPC,EAAiBtB,EAAK5kD,OAAS,EAC/BmmD,EAAel2C,EAAGjQ,OAAS,EAG3BomD,EAAI,CAAElhD,KAAM,oBAg1Ed,SAASmhD,EAAex3C,GACtB,IAAI5O,EAAGkuC,EAAGiQ,EACRkI,EAAkBz3C,EAAE7O,OAAS,EAC7B4kC,EAAM,GACNt7B,EAAIuF,EAAE,GAER,GAAIy3C,EAAkB,EAAG,CAEvB,IADA1hB,GAAOt7B,EACFrJ,EAAI,EAAGA,EAAIqmD,EAAiBrmD,KAE/BkuC,EAj2EO,GAg2EPiQ,EAAKvvC,EAAE5O,GAAK,IACMD,UACX4kC,GAAO2hB,EAAcpY,IAC5BvJ,GAAOwZ,GAKTjQ,EAx2ES,GAu2ETiQ,GADA90C,EAAIuF,EAAE5O,IACG,IACSD,UACX4kC,GAAO2hB,EAAcpY,SACvB,GAAU,IAAN7kC,EACT,MAAO,IAIT,KAAOA,EAAI,IAAO,GAAIA,GAAK,GAE3B,OAAOs7B,EAAMt7B,EAIf,SAASk9C,EAAWvmD,EAAG8tB,EAAKE,GAC1B,GAAIhuB,MAAQA,GAAKA,EAAI8tB,GAAO9tB,EAAIguB,EAC9B,MAAMyY,MAAM8e,EAAkBvlD,GAUlC,SAASwmD,EAAoB53C,EAAG5O,EAAGymD,EAAIC,GACrC,IAAIC,EAAIzY,EAAGp8B,EAAG80C,EAGd,IAAK1Y,EAAIt/B,EAAE,GAAIs/B,GAAK,GAAIA,GAAK,KAAMluC,EAwCnC,QArCMA,EAAI,GACRA,GAz4ES,EA04ET2mD,EAAK,IAELA,EAAK57C,KAAKkd,MAAMjoB,EAAI,GA54EX,GA64ETA,GA74ES,GAm5EXkuC,EAAIyX,EAAQ,GAn5ED,EAm5EgB3lD,GAC3B4mD,EAAKh4C,EAAE+3C,GAAMzY,EAAI,EAEA,MAAbwY,EACE1mD,EAAI,GACG,GAALA,EAAQ4mD,EAAKA,EAAK,IAAM,EACd,GAAL5mD,IAAQ4mD,EAAKA,EAAK,GAAK,GAChC90C,EAAI20C,EAAK,GAAW,OAANG,GAAeH,EAAK,GAAW,OAANG,GAAqB,KAANA,GAAqB,GAANA,GAErE90C,GAAK20C,EAAK,GAAKG,EAAK,GAAK1Y,GAAKuY,EAAK,GAAKG,EAAK,GAAK1Y,EAAI,KACnDt/B,EAAE+3C,EAAK,GAAKzY,EAAI,IAAM,IAAMyX,EAAQ,GAAI3lD,EAAI,GAAK,IAC/C4mD,GAAM1Y,EAAI,GAAW,GAAN0Y,IAAyC,IAA5Bh4C,EAAE+3C,EAAK,GAAKzY,EAAI,IAAM,GAGrDluC,EAAI,GACG,GAALA,EAAQ4mD,EAAKA,EAAK,IAAO,EACf,GAAL5mD,EAAQ4mD,EAAKA,EAAK,IAAM,EACnB,GAAL5mD,IAAQ4mD,EAAKA,EAAK,GAAK,GAChC90C,GAAK40C,GAAaD,EAAK,IAAY,MAANG,IAAeF,GAAaD,EAAK,GAAW,MAANG,GAEnE90C,IAAM40C,GAAaD,EAAK,IAAMG,EAAK,GAAK1Y,IACtCwY,GAAaD,EAAK,GAAMG,EAAK,GAAK1Y,EAAI,KACrCt/B,EAAE+3C,EAAK,GAAKzY,EAAI,IAAO,IAAMyX,EAAQ,GAAI3lD,EAAI,GAAK,EAIlD8R,EAOT,SAAS+0C,EAAYliB,EAAKmiB,EAAQC,GAOhC,IANA,IAAIt4B,EAEFu4B,EADAnnD,EAAM,CAAC,GAEPG,EAAI,EACJinD,EAAOtiB,EAAI5kC,OAENC,EAAIinD,GAAO,CAChB,IAAKD,EAAOnnD,EAAIE,OAAQinD,KAASnnD,EAAImnD,IAASF,EAE9C,IADAjnD,EAAI,IAAM6kD,EAASptB,QAAQqN,EAAIuiB,OAAOlnD,MACjCyuB,EAAI,EAAGA,EAAI5uB,EAAIE,OAAQ0uB,IACtB5uB,EAAI4uB,GAAKs4B,EAAU,SACF,IAAflnD,EAAI4uB,EAAI,KAAe5uB,EAAI4uB,EAAI,GAAK,GACxC5uB,EAAI4uB,EAAI,IAAM5uB,EAAI4uB,GAAKs4B,EAAU,EACjClnD,EAAI4uB,IAAMs4B,GAKhB,OAAOlnD,EAAI00C,UAv3Eb4R,EAAEgB,cAAgBhB,EAAE11C,IAAM,WACxB,IAAItH,EAAI,IAAI7D,KAAKzC,YAAYyC,MAE7B,OADI6D,EAAE8P,EAAI,IAAG9P,EAAE8P,EAAI,GACZmuC,EAASj+C,IASlBg9C,EAAEl+B,KAAO,WACP,OAAOm/B,EAAS,IAAI9hD,KAAKzC,YAAYyC,MAAOA,KAAKa,EAAI,EAAG,IAY1DggD,EAAEkB,WAAalB,EAAEmB,IAAM,SAAUl+C,GAC/B,IAAIpJ,EAAGyuB,EAAG84B,EAAKC,EACbr+C,EAAI7D,KACJmiD,EAAKt+C,EAAEyF,EACP84C,GAAMt+C,EAAI,IAAID,EAAEtG,YAAYuG,IAAIwF,EAChC4vC,EAAKr1C,EAAE8P,EACP0uC,EAAKv+C,EAAE6P,EAGT,IAAKwuC,IAAOC,EACV,OAAQlJ,GAAOmJ,EAAWnJ,IAAOmJ,EAAKnJ,EAAKiJ,IAAOC,EAAK,GAAKD,EAAKjJ,EAAK,EAAI,GAAK,EAA3D3T,IAItB,IAAK4c,EAAG,KAAOC,EAAG,GAAI,OAAOD,EAAG,GAAKjJ,EAAKkJ,EAAG,IAAMC,EAAK,EAGxD,GAAInJ,IAAOmJ,EAAI,OAAOnJ,EAGtB,GAAIr1C,EAAEhD,IAAMiD,EAAEjD,EAAG,OAAOgD,EAAEhD,EAAIiD,EAAEjD,EAAIq4C,EAAK,EAAI,GAAK,EAMlD,IAAKx+C,EAAI,EAAGyuB,GAJZ84B,EAAME,EAAG1nD,SACTynD,EAAME,EAAG3nD,QAGmBwnD,EAAMC,EAAKxnD,EAAIyuB,IAAKzuB,EAC9C,GAAIynD,EAAGznD,KAAO0nD,EAAG1nD,GAAI,OAAOynD,EAAGznD,GAAK0nD,EAAG1nD,GAAKw+C,EAAK,EAAI,GAAK,EAI5D,OAAO+I,IAAQC,EAAM,EAAID,EAAMC,EAAMhJ,EAAK,EAAI,GAAK,GAiBrD2H,EAAEyB,OAASzB,EAAEvd,IAAM,WACjB,IAAIif,EAAIpB,EACNt9C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAKsG,EAAEyF,EAGFzF,EAAEyF,EAAE,IAETi5C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK98C,KAAKijB,IAAI7kB,EAAEhD,EAAGgD,EAAE4+C,MArK3B,EAsKXD,EAAKhD,SAAW,EAEhB37C,EAwyEF,SAAgB2+C,EAAM3+C,GACpB,IAAI+kC,EAAG9kC,EACLtJ,EAAMqJ,EAAEyF,EAAE7O,OAMRD,EAAM,GAERsJ,GAAK,EAAI4+C,EAAQ,EADjB9Z,EAAInjC,KAAKkd,KAAKnoB,EAAM,KACIkF,YAExBkpC,EAAI,GACJ9kC,EAAI,gCAGN0+C,EAAKjD,WAAa3W,EAElB/kC,EAAI8+C,EAAaH,EAAM,EAAG3+C,EAAE++C,MAAM9+C,GAAI,IAAI0+C,EAAK,IAG/C,IAAK,IAAI9nD,EAAIkuC,EAAGluC,KAAM,CACpB,IAAImoD,EAAQh/C,EAAE++C,MAAM/+C,GACpBA,EAAIg/C,EAAMD,MAAMC,GAAOhf,MAAMgf,GAAOD,MAAM,GAAGhf,KAAK,GAKpD,OAFA4e,EAAKjD,WAAa3W,EAEX/kC,EAp0EHy+C,CAAOE,EAAMM,EAAiBN,EAAM3+C,IAExC2+C,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETW,EAAqB,GAAZ7C,GAA6B,GAAZA,EAAgBp7C,EAAEk/C,MAAQl/C,EAAG0+C,EAAIpB,GAAI,IAZlD,IAAIqB,EAAK,GAHZ,IAAIA,EAAKjd,MAmC5Bsb,EAAEmC,SAAWnC,EAAEoC,KAAO,WACpB,IAAIpiD,EAAGgJ,EAAGpK,EAAG+M,EAAG02C,EAAKvvC,EAAG8uC,EAAI33C,EAAGq4C,EAAIC,EACjCv/C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,IAAKsG,EAAEsc,YAActc,EAAEw/C,SAAU,OAAO,IAAIb,EAAK3+C,GAoCjD,IAnCAk8C,GAAW,GAGXpsC,EAAI9P,EAAE8P,EAAI0sC,EAAQx8C,EAAE8P,EAAI9P,EAAG,EAAI,KAIrB4B,KAAK0F,IAAIwI,IAAM,IAqBvBnH,EAAI,IAAIg2C,EAAK7uC,EAAEjU,aApBfD,EAAIqhD,EAAej9C,EAAEyF,IAIjBqK,IAHJ9S,EAAIgD,EAAEhD,GAGOpB,EAAEhF,OAAS,GAAK,KAAGgF,GAAW,GAALkU,IAAgB,GAANA,EAAU,IAAM,MAChEA,EAAI0sC,EAAQ5gD,EAAG,EAAI,GAGnBoB,EAAIu/C,GAAWv/C,EAAI,GAAK,IAAMA,EAAI,IAAMA,EAAI,GAAK,EAAI,KASrD2L,EAAI,IAAIg2C,EANN/iD,EADEkU,GAAK,IACH,KAAO9S,GAEXpB,EAAIkU,EAAE2vC,iBACAxkD,MAAM,EAAGW,EAAEuyB,QAAQ,KAAO,GAAKnxB,IAIrC8S,EAAI9P,EAAE8P,GAKV8uC,GAAM5hD,EAAI2hD,EAAKjD,WAAa,IAW1B,GAJA6D,GADAD,GADAr4C,EAAI0B,GACGo2C,MAAM93C,GAAG83C,MAAM93C,IACT84B,KAAK//B,GAClB2I,EAAI+2C,EAAOH,EAAQxf,KAAK//B,GAAG++C,MAAM93C,GAAIs4C,EAAQxf,KAAKuf,GAAKV,EAAK,EAAG,GAG3D3B,EAAeh2C,EAAExB,GAAGxK,MAAM,EAAG2jD,MAAShjD,EAAIqhD,EAAet0C,EAAElD,IAAIxK,MAAM,EAAG2jD,GAAK,CAK/E,GAAS,SAJThjD,EAAIA,EAAEX,MAAM2jD,EAAK,EAAGA,EAAK,MAILS,GAAY,QAALzjD,GAepB,EAICA,KAAOA,EAAEX,MAAM,IAAqB,KAAfW,EAAEmiD,OAAO,MAGlCE,EAASt1C,EAAG3L,EAAI,EAAG,GACnBgJ,GAAK2C,EAAEo2C,MAAMp2C,GAAGo2C,MAAMp2C,GAAGg3C,GAAG3/C,IAG9B,MAtBA,IAAKq/C,IACHpB,EAASh3C,EAAGjK,EAAI,EAAG,GAEfiK,EAAE83C,MAAM93C,GAAG83C,MAAM93C,GAAG04C,GAAG3/C,IAAI,CAC7B2I,EAAI1B,EACJ,MAIJ23C,GAAM,EACNS,EAAM,EAmBZ,OAFAnD,GAAW,EAEJ+B,EAASt1C,EAAG3L,EAAG2hD,EAAKhD,SAAU31C,IAQvCg3C,EAAE4C,cAAgB5C,EAAE6C,GAAK,WACvB,IAAI3/C,EACFuF,EAAItJ,KAAKsJ,EACT7J,EAAI8lC,IAEN,GAAIj8B,EAAG,CAML,GAJA7J,EAtSS,IAqSTsE,EAAIuF,EAAE7O,OAAS,GACN2lD,EAAUpgD,KAAKa,EAtSf,IAySTkD,EAAIuF,EAAEvF,GACC,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAItE,IAChCA,EAAI,IAAGA,EAAI,GAGjB,OAAOA,GAyBTohD,EAAE8C,UAAY9C,EAAE+C,IAAM,SAAU9/C,GAC9B,OAAOy/C,EAAOvjD,KAAM,IAAIA,KAAKzC,YAAYuG,KAS3C+8C,EAAEgD,mBAAqBhD,EAAEiD,SAAW,SAAUhgD,GAC5C,IACE0+C,EADMxiD,KACGzC,YACX,OAAOukD,EAASyB,EAFRvjD,KAEkB,IAAIwiD,EAAK1+C,GAAI,EAAG,EAAG,GAAI0+C,EAAKjD,UAAWiD,EAAKhD,WAQxEqB,EAAEkD,OAASlD,EAAE2C,GAAK,SAAU1/C,GAC1B,OAAuB,IAAhB9D,KAAKgiD,IAAIl+C,IASlB+8C,EAAEp+B,MAAQ,WACR,OAAOq/B,EAAS,IAAI9hD,KAAKzC,YAAYyC,MAAOA,KAAKa,EAAI,EAAG,IAS1DggD,EAAEmD,YAAcnD,EAAEoD,GAAK,SAAUngD,GAC/B,OAAO9D,KAAKgiD,IAAIl+C,GAAK,GASvB+8C,EAAEqD,qBAAuBrD,EAAEsD,IAAM,SAAUrgD,GACzC,IAAI8kC,EAAI5oC,KAAKgiD,IAAIl+C,GACjB,OAAY,GAAL8kC,GAAgB,IAANA,GA6BnBiY,EAAEuD,iBAAmBvD,EAAEhe,KAAO,WAC5B,IAAI+F,EAAGnpC,EAAG8iD,EAAIpB,EAAI3mD,EAChBqJ,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YACT8mD,EAAM,IAAI7B,EAAK,GAEjB,IAAK3+C,EAAEsc,WAAY,OAAO,IAAIqiC,EAAK3+C,EAAE8P,EAAI,IAAQ4xB,KACjD,GAAI1hC,EAAEw/C,SAAU,OAAOgB,EAEvB9B,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK98C,KAAKijB,IAAI7kB,EAAEhD,EAAGgD,EAAE4+C,MAAQ,EAC9CD,EAAKhD,SAAW,GAChBhlD,EAAMqJ,EAAEyF,EAAE7O,QAOA,GAERgF,GAAK,EAAIijD,EAAQ,EADjB9Z,EAAInjC,KAAKkd,KAAKnoB,EAAM,KACIkF,YAExBkpC,EAAI,GACJnpC,EAAI,gCAGNoE,EAAI8+C,EAAaH,EAAM,EAAG3+C,EAAE++C,MAAMnjD,GAAI,IAAI+iD,EAAK,IAAI,GAMnD,IAHA,IAAI8B,EACF5pD,EAAIkuC,EACJ2b,EAAK,IAAI/B,EAAK,GACT9nD,KACL4pD,EAAUzgD,EAAE++C,MAAM/+C,GAClBA,EAAIwgD,EAAIxgB,MAAMygB,EAAQ1B,MAAM2B,EAAG1gB,MAAMygB,EAAQ1B,MAAM2B,MAGrD,OAAOzC,EAASj+C,EAAG2+C,EAAKjD,UAAYgD,EAAIC,EAAKhD,SAAW2B,GAAI,IAkC9DN,EAAE2D,eAAiB3D,EAAE9d,KAAO,WAC1B,IAAI6F,EAAG2Z,EAAIpB,EAAI3mD,EACbqJ,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,IAAKsG,EAAEsc,YAActc,EAAEw/C,SAAU,OAAO,IAAIb,EAAK3+C,GAQjD,GANA0+C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK98C,KAAKijB,IAAI7kB,EAAEhD,EAAGgD,EAAE4+C,MAAQ,EAC9CD,EAAKhD,SAAW,GAChBhlD,EAAMqJ,EAAEyF,EAAE7O,QAEA,EACRoJ,EAAI8+C,EAAaH,EAAM,EAAG3+C,EAAGA,GAAG,OAC3B,CAYL+kC,GADAA,EAAI,IAAMnjC,KAAKsE,KAAKvP,IACZ,GAAK,GAAS,EAAJouC,EAGlB/kC,EAAI8+C,EAAaH,EAAM,EADvB3+C,EAAIA,EAAE++C,MAAM,EAAIF,EAAQ,EAAG9Z,IACE/kC,GAAG,GAOhC,IAJA,IAAI4gD,EACFC,EAAK,IAAIlC,EAAK,GACdmC,EAAM,IAAInC,EAAK,IACfoC,EAAM,IAAIpC,EAAK,IACV5Z,KACL6b,EAAU5gD,EAAE++C,MAAM/+C,GAClBA,EAAIA,EAAE++C,MAAM8B,EAAG9gB,KAAK6gB,EAAQ7B,MAAM+B,EAAI/B,MAAM6B,GAAS7gB,KAAKghB,MAO9D,OAHApC,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETW,EAASj+C,EAAG0+C,EAAIpB,GAAI,IAoB7BN,EAAEgE,kBAAoBhE,EAAEiE,KAAO,WAC7B,IAAIvC,EAAIpB,EACNt9C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAKsG,EAAEsc,WACHtc,EAAEw/C,SAAiB,IAAIb,EAAK3+C,IAEhC0+C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK,EACtBC,EAAKhD,SAAW,EAET+D,EAAO1/C,EAAEk/B,OAAQl/B,EAAEg/B,OAAQ2f,EAAKjD,UAAYgD,EAAIC,EAAKhD,SAAW2B,IAR7C,IAAIqB,EAAK3+C,EAAE8P,IA+BvCktC,EAAEkE,cAAgBlE,EAAElc,KAAO,WACzB,IAAIqgB,EACFnhD,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YACTqrC,EAAI/kC,EAAEsH,MAAM62C,IAAI,GAChBO,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SAEZ,OAAW,IAAP5W,EACW,IAANA,EAEH/kC,EAAEohD,QAAUC,EAAM1C,EAAMD,EAAIpB,GAAM,IAAIqB,EAAK,GAE3C,IAAIA,EAAKjd,KAGX1hC,EAAEw/C,SAAiB6B,EAAM1C,EAAMD,EAAK,EAAGpB,GAAIyB,MAAM,KAIrDJ,EAAKjD,UAAYgD,EAAK,EACtBC,EAAKhD,SAAW,EAEhB37C,EAAIA,EAAE+gC,OACNogB,EAASE,EAAM1C,EAAMD,EAAK,EAAGpB,GAAIyB,MAAM,IAEvCJ,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAET6D,EAAOnhB,MAAMhgC,KAuBtBg9C,EAAEsE,wBAA0BtE,EAAE1b,MAAQ,WACpC,IAAIod,EAAIpB,EACNt9C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAIsG,EAAEuhD,IAAI,GAAW,IAAI5C,EAAK3+C,EAAE2/C,GAAG,GAAK,EAAIje,KACvC1hC,EAAEsc,YAEPoiC,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK98C,KAAKijB,IAAIjjB,KAAK0F,IAAItH,EAAEhD,GAAIgD,EAAE4+C,MAAQ,EACxDD,EAAKhD,SAAW,EAChBO,GAAW,EAEXl8C,EAAIA,EAAE++C,MAAM/+C,GAAGggC,MAAM,GAAG95B,OAAO65B,KAAK//B,GAEpCk8C,GAAW,EACXyC,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETt9C,EAAEwhD,MAdiB,IAAI7C,EAAK3+C,IAkCrCg9C,EAAEyE,sBAAwBzE,EAAE3b,MAAQ,WAClC,IAAIqd,EAAIpB,EACNt9C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAKsG,EAAEsc,YAActc,EAAEw/C,SAAiB,IAAIb,EAAK3+C,IAEjD0+C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK,EAAI98C,KAAKijB,IAAIjjB,KAAK0F,IAAItH,EAAEhD,GAAIgD,EAAE4+C,MAAQ,EAC5DD,EAAKhD,SAAW,EAChBO,GAAW,EAEXl8C,EAAIA,EAAE++C,MAAM/+C,GAAG+/B,KAAK,GAAG75B,OAAO65B,KAAK//B,GAEnCk8C,GAAW,EACXyC,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETt9C,EAAEwhD,OAuBXxE,EAAE0E,yBAA2B1E,EAAE5b,MAAQ,WACrC,IAAIsd,EAAIpB,EAAIqE,EAAKC,EACf5hD,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAKsG,EAAEsc,WACHtc,EAAEhD,GAAK,EAAU,IAAI2hD,EAAK3+C,EAAEsH,MAAMq4C,GAAG,GAAK3/C,EAAE8P,EAAI,EAAI9P,EAAEw/C,SAAWx/C,EAAI0hC,MAEzEgd,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACViG,EAAM5hD,EAAE4+C,KAEJh9C,KAAKijB,IAAI+8B,EAAKlD,GAAM,GAAK1+C,EAAEhD,EAAI,EAAUihD,EAAS,IAAIU,EAAK3+C,GAAI0+C,EAAIpB,GAAI,IAE3EqB,EAAKjD,UAAYiG,EAAMC,EAAM5hD,EAAEhD,EAE/BgD,EAAI0/C,EAAO1/C,EAAE+/B,KAAK,GAAI,IAAI4e,EAAK,GAAG3e,MAAMhgC,GAAI2hD,EAAMjD,EAAI,GAEtDC,EAAKjD,UAAYgD,EAAK,EACtBC,EAAKhD,SAAW,EAEhB37C,EAAIA,EAAEwhD,KAEN7C,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETt9C,EAAE++C,MAAM,MArBW,IAAIJ,EAAKjd,MA8CrCsb,EAAE6E,YAAc7E,EAAEjc,KAAO,WACvB,IAAIogB,EAAQpc,EACV2Z,EAAIpB,EACJt9C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAIsG,EAAEw/C,SAAiB,IAAIb,EAAK3+C,IAEhC+kC,EAAI/kC,EAAEsH,MAAM62C,IAAI,GAChBO,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,UAEC,IAAP5W,EAGQ,IAANA,IACFoc,EAASE,EAAM1C,EAAMD,EAAK,EAAGpB,GAAIyB,MAAM,KAChCjvC,EAAI9P,EAAE8P,EACNqxC,GAIF,IAAIxC,EAAKjd,MAKlBid,EAAKjD,UAAYgD,EAAK,EACtBC,EAAKhD,SAAW,EAEhB37C,EAAIA,EAAE+/C,IAAI,IAAIpB,EAAK,GAAG3e,MAAMhgC,EAAE++C,MAAM/+C,IAAIkG,OAAO65B,KAAK,IAAIc,OAExD8d,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETt9C,EAAE++C,MAAM,MAsBjB/B,EAAE8E,eAAiB9E,EAAEnc,KAAO,WAC1B,IAAIhqC,EAAGyuB,EAAGyf,EAAGnpC,EAAGmmD,EAAI96C,EAAG0B,EAAGg5C,EAAKn+C,EAC7BxD,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YACTglD,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SAEZ,GAAK37C,EAAEsc,WAOA,IAAItc,EAAEw/C,SACX,OAAO,IAAIb,EAAK3+C,GACX,GAAIA,EAAEsH,MAAMq4C,GAAG,IAAMjB,EAAK,GAAK3B,EAGpC,OAFAp0C,EAAI04C,EAAM1C,EAAMD,EAAK,EAAGpB,GAAIyB,MAAM,MAChCjvC,EAAI9P,EAAE8P,EACDnH,MAZU,CACjB,IAAK3I,EAAE8P,EAAG,OAAO,IAAI6uC,EAAKjd,KAC1B,GAAIgd,EAAK,GAAK3B,EAGZ,OAFAp0C,EAAI04C,EAAM1C,EAAMD,EAAK,EAAGpB,GAAIyB,MAAM,KAChCjvC,EAAI9P,EAAE8P,EACDnH,EAqBX,IAXAg2C,EAAKjD,UAAYiG,EAAMjD,EAAK,GAC5BC,EAAKhD,SAAW,EAUX9kD,EAFLkuC,EAAInjC,KAAK+iB,IAAI,GAAIg9B,EAz1BN,EAy1BuB,EAAI,GAE1B9qD,IAAKA,EAAGmJ,EAAIA,EAAE+/C,IAAI//C,EAAE++C,MAAM/+C,GAAG+/B,KAAK,GAAG75B,OAAO65B,KAAK,IAW7D,IATAmc,GAAW,EAEX52B,EAAI1jB,KAAKkd,KAAK6iC,EA/1BH,GAg2BX/lD,EAAI,EACJ4H,EAAKxD,EAAE++C,MAAM/+C,GACb2I,EAAI,IAAIg2C,EAAK3+C,GACb+hD,EAAK/hD,GAGS,IAAPnJ,GAOL,GANAkrD,EAAKA,EAAGhD,MAAMv7C,GACdyD,EAAI0B,EAAEq3B,MAAM+hB,EAAGhC,IAAInkD,GAAK,IAExBmmD,EAAKA,EAAGhD,MAAMv7C,QAGC,KAFfmF,EAAI1B,EAAE84B,KAAKgiB,EAAGhC,IAAInkD,GAAK,KAEjB6J,EAAE6f,GAAe,IAAKzuB,EAAIyuB,EAAG3c,EAAElD,EAAE5O,KAAOoQ,EAAExB,EAAE5O,IAAMA,MAO1D,OAJIkuC,IAAGp8B,EAAIA,EAAEo2C,MAAM,GAAMha,EAAI,IAE7BmX,GAAW,EAEJ+B,EAASt1C,EAAGg2C,EAAKjD,UAAYgD,EAAIC,EAAKhD,SAAW2B,GAAI,IAQ9DN,EAAE1gC,SAAW,WACX,QAASngB,KAAKsJ,GAQhBu3C,EAAEpsC,UAAYosC,EAAEgF,MAAQ,WACtB,QAAS7lD,KAAKsJ,GAAK82C,EAAUpgD,KAAKa,EAt4BvB,GAs4BuCb,KAAKsJ,EAAE7O,OAAS,GAQpEomD,EAAE/5C,MAAQ,WACR,OAAQ9G,KAAK2T,GAQfktC,EAAEiF,WAAajF,EAAEoE,MAAQ,WACvB,OAAOjlD,KAAK2T,EAAI,GAQlBktC,EAAEkF,WAAalF,EAAEmF,MAAQ,WACvB,OAAOhmD,KAAK2T,EAAI,GAQlBktC,EAAEwC,OAAS,WACT,QAASrjD,KAAKsJ,GAAmB,IAAdtJ,KAAKsJ,EAAE,IAQ5Bu3C,EAAEoF,SAAWpF,EAAEqF,GAAK,SAAUpiD,GAC5B,OAAO9D,KAAKgiD,IAAIl+C,GAAK,GAQvB+8C,EAAEsF,kBAAoBtF,EAAEuE,IAAM,SAAUthD,GACtC,OAAO9D,KAAKgiD,IAAIl+C,GAAK,GAkCvB+8C,EAAEuF,UAAYvF,EAAExd,IAAM,SAAU9mC,GAC9B,IAAI8pD,EAAU/8C,EAAGg9C,EAAa1d,EAAG2d,EAAKC,EAAK/D,EAAIj2C,EAC7Cs3B,EAAM9jC,KACNwiD,EAAO1e,EAAIvmC,YACXglD,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SAIZ,GAAY,MAARjjD,EACFA,EAAO,IAAIimD,EAAK,IAChB6D,GAAW,MACN,CAKL,GAHA/8C,GADA/M,EAAO,IAAIimD,EAAKjmD,IACP+M,EAGL/M,EAAKoX,EAAI,IAAMrK,IAAMA,EAAE,IAAM/M,EAAKinD,GAAG,GAAI,OAAO,IAAIhB,EAAKjd,KAE7D8gB,EAAW9pD,EAAKinD,GAAG,IAMrB,GAHAl6C,EAAIw6B,EAAIx6B,EAGJw6B,EAAInwB,EAAI,IAAMrK,IAAMA,EAAE,IAAMw6B,EAAI0f,GAAG,GACrC,OAAO,IAAIhB,EAAKl5C,IAAMA,EAAE,IAAK,IAAkB,GAATw6B,EAAInwB,EAAS4xB,IAAMj8B,EAAI,EAAI,KAKnE,GAAI+8C,EACF,GAAI/8C,EAAE7O,OAAS,EACb8rD,GAAM,MACD,CACL,IAAK3d,EAAIt/B,EAAE,GAAIs/B,EAAI,IAAO,GAAIA,GAAK,GACnC2d,EAAY,IAAN3d,EA0BV,GAtBAmX,GAAW,EAEXyG,EAAMC,EAAiB3iB,EADvB2e,EAAKF,EAnCK,GAqCV+D,EAAcD,EAAWK,EAAQlE,EAAMC,EAAK,IAAMgE,EAAiBlqD,EAAMkmD,GAmBrEvB,GAhBJ10C,EAAI+2C,EAAOiD,EAAKF,EAAa7D,EAAI,IAgBPn5C,EAAGs/B,EAAI2Z,EAAIpB,GAEnC,GAME,GAJAqF,EAAMC,EAAiB3iB,EADvB2e,GAAM,IAEN6D,EAAcD,EAAWK,EAAQlE,EAAMC,EAAK,IAAMgE,EAAiBlqD,EAAMkmD,GACzEj2C,EAAI+2C,EAAOiD,EAAKF,EAAa7D,EAAI,IAE5B8D,EAAK,EAGHzF,EAAet0C,EAAElD,GAAGxK,MAAM8pC,EAAI,EAAGA,EAAI,IAAM,GAAK,OACnDp8B,EAAIs1C,EAASt1C,EAAG+1C,EAAK,EAAG,IAG1B,aAEKrB,EAAoB10C,EAAElD,EAAGs/B,GAAK,GAAIuY,IAK7C,OAFApB,GAAW,EAEJ+B,EAASt1C,EAAG+1C,EAAIpB,IAiDzBN,EAAEhd,MAAQgd,EAAE8F,IAAM,SAAU7iD,GAC1B,IAAIwF,EAAGzI,EAAGnG,EAAGyuB,EAAGyf,EAAGpuC,EAAK+nD,EAAIpB,EAAIgB,EAAIltB,EAAI2xB,EAAMxE,EAC5Cv+C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAKX,GAHAuG,EAAI,IAAI0+C,EAAK1+C,IAGRD,EAAEyF,IAAMxF,EAAEwF,EAab,OAVKzF,EAAE8P,GAAM7P,EAAE6P,EAGN9P,EAAEyF,EAAGxF,EAAE6P,GAAK7P,EAAE6P,EAKlB7P,EAAI,IAAI0+C,EAAK1+C,EAAEwF,GAAKzF,EAAE8P,IAAM7P,EAAE6P,EAAI9P,EAAI0hC,KARzBzhC,EAAI,IAAI0+C,EAAKjd,KAUxBzhC,EAIT,GAAID,EAAE8P,GAAK7P,EAAE6P,EAEX,OADA7P,EAAE6P,GAAK7P,EAAE6P,EACF9P,EAAE+/B,KAAK9/B,GAShB,GANAq+C,EAAKt+C,EAAEyF,EACP84C,EAAKt+C,EAAEwF,EACPi5C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,UAGL2C,EAAG,KAAOC,EAAG,GAAI,CAGpB,GAAIA,EAAG,GAAIt+C,EAAE6P,GAAK7P,EAAE6P,MAGf,KAAIwuC,EAAG,GAIP,OAAO,IAAIK,EAAY,IAAPrB,GAAY,EAAI,GAJrBr9C,EAAI,IAAI0+C,EAAK3+C,GAM7B,OAAOk8C,EAAW+B,EAASh+C,EAAGy+C,EAAIpB,GAAMr9C,EAa1C,GAPAjD,EAAIu/C,EAAUt8C,EAAEjD,EAzpCL,GA0pCXo0B,EAAKmrB,EAAUv8C,EAAEhD,EA1pCN,GA4pCXshD,EAAKA,EAAGrjD,QACR8pC,EAAI3T,EAAKp0B,EAGF,CAyBL,KAxBA+lD,EAAOhe,EAAI,IAGTt/B,EAAI64C,EACJvZ,GAAKA,EACLpuC,EAAM4nD,EAAG3nD,SAET6O,EAAI84C,EACJvhD,EAAIo0B,EACJz6B,EAAM2nD,EAAG1nD,QAQPmuC,GAFJluC,EAAI+K,KAAKijB,IAAIjjB,KAAKkd,KAAK4/B,EAhrCd,GAgrC8B/nD,GAAO,KAG5CouC,EAAIluC,EACJ4O,EAAE7O,OAAS,GAIb6O,EAAE2lC,UACGv0C,EAAIkuC,EAAGluC,KAAM4O,EAAE9K,KAAK,GACzB8K,EAAE2lC,cAGG,CASL,KAHA2X,GAFAlsD,EAAIynD,EAAG1nD,SACPD,EAAM4nD,EAAG3nD,WAECD,EAAME,GAEXA,EAAI,EAAGA,EAAIF,EAAKE,IACnB,GAAIynD,EAAGznD,IAAM0nD,EAAG1nD,GAAI,CAClBksD,EAAOzE,EAAGznD,GAAK0nD,EAAG1nD,GAClB,MAIJkuC,EAAI,EAcN,IAXIge,IACFt9C,EAAI64C,EACJA,EAAKC,EACLA,EAAK94C,EACLxF,EAAE6P,GAAK7P,EAAE6P,GAGXnZ,EAAM2nD,EAAG1nD,OAIJC,EAAI0nD,EAAG3nD,OAASD,EAAKE,EAAI,IAAKA,EAAGynD,EAAG3nD,KAAS,EAGlD,IAAKE,EAAI0nD,EAAG3nD,OAAQC,EAAIkuC,GAAI,CAE1B,GAAIuZ,IAAKznD,GAAK0nD,EAAG1nD,GAAI,CACnB,IAAKyuB,EAAIzuB,EAAGyuB,GAAiB,IAAZg5B,IAAKh5B,IAAWg5B,EAAGh5B,GAAKu3B,EAAO,IAC9CyB,EAAGh5B,GACLg5B,EAAGznD,IAAMgmD,EAGXyB,EAAGznD,IAAM0nD,EAAG1nD,GAId,KAAqB,IAAdynD,IAAK3nD,IAAa2nD,EAAGvtC,MAG5B,KAAiB,IAAVutC,EAAG,GAAUA,EAAG0E,UAAWhmD,EAGlC,OAAKshD,EAAG,IAERr+C,EAAEwF,EAAI64C,EACNr+C,EAAEjD,EAAIimD,EAAkB3E,EAAIthD,GAErBk/C,EAAW+B,EAASh+C,EAAGy+C,EAAIpB,GAAMr9C,GALrB,IAAI0+C,EAAY,IAAPrB,GAAY,EAAI,IAiC9CN,EAAEpB,OAASoB,EAAEkG,IAAM,SAAUjjD,GAC3B,IAAIkjD,EACFnjD,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAKX,OAHAuG,EAAI,IAAI0+C,EAAK1+C,IAGRD,EAAEyF,IAAMxF,EAAE6P,GAAK7P,EAAEwF,IAAMxF,EAAEwF,EAAE,GAAW,IAAIk5C,EAAKjd,MAG/CzhC,EAAEwF,GAAKzF,EAAEyF,IAAMzF,EAAEyF,EAAE,GACfw4C,EAAS,IAAIU,EAAK3+C,GAAI2+C,EAAKjD,UAAWiD,EAAKhD,WAIpDO,GAAW,EAEQ,GAAfyC,EAAK/C,QAIPuH,EAAIzD,EAAO1/C,EAAGC,EAAEqH,MAAO,EAAG,EAAG,IAC3BwI,GAAK7P,EAAE6P,EAETqzC,EAAIzD,EAAO1/C,EAAGC,EAAG,EAAG0+C,EAAK/C,OAAQ,GAGnCuH,EAAIA,EAAEpE,MAAM9+C,GAEZi8C,GAAW,EAEJl8C,EAAEggC,MAAMmjB,KAUjBnG,EAAEoG,mBAAqBpG,EAAE/d,IAAM,WAC7B,OAAOmkB,EAAmBjnD,OAS5B6gD,EAAE4F,iBAAmB5F,EAAEwE,GAAK,WAC1B,OAAOoB,EAAiBzmD,OAS1B6gD,EAAEqG,QAAUrG,EAAEkC,IAAM,WAClB,IAAIl/C,EAAI,IAAI7D,KAAKzC,YAAYyC,MAE7B,OADA6D,EAAE8P,GAAK9P,EAAE8P,EACFmuC,EAASj+C,IAyBlBg9C,EAAEjd,KAAOid,EAAEvmC,IAAM,SAAUxW,GACzB,IAAIqjD,EAAO79C,EAAGzI,EAAGnG,EAAGkuC,EAAGpuC,EAAK+nD,EAAIpB,EAAIgB,EAAIC,EACtCv+C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAKX,GAHAuG,EAAI,IAAI0+C,EAAK1+C,IAGRD,EAAEyF,IAAMxF,EAAEwF,EAWb,OARKzF,EAAE8P,GAAM7P,EAAE6P,EAML9P,EAAEyF,IAAGxF,EAAI,IAAI0+C,EAAK1+C,EAAEwF,GAAKzF,EAAE8P,IAAM7P,EAAE6P,EAAI9P,EAAI0hC,MANnCzhC,EAAI,IAAI0+C,EAAKjd,KAQxBzhC,EAIT,GAAID,EAAE8P,GAAK7P,EAAE6P,EAEX,OADA7P,EAAE6P,GAAK7P,EAAE6P,EACF9P,EAAEggC,MAAM//B,GASjB,GANAq+C,EAAKt+C,EAAEyF,EACP84C,EAAKt+C,EAAEwF,EACPi5C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,UAGL2C,EAAG,KAAOC,EAAG,GAMhB,OAFKA,EAAG,KAAIt+C,EAAI,IAAI0+C,EAAK3+C,IAElBk8C,EAAW+B,EAASh+C,EAAGy+C,EAAIpB,GAAMr9C,EAa1C,GAPA8kC,EAAIwX,EAAUv8C,EAAEhD,EAz5CL,GA05CXA,EAAIu/C,EAAUt8C,EAAEjD,EA15CL,GA45CXshD,EAAKA,EAAGrjD,QACRpE,EAAIkuC,EAAI/nC,EAGD,CAuBL,IArBInG,EAAI,GACN4O,EAAI64C,EACJznD,GAAKA,EACLF,EAAM4nD,EAAG3nD,SAET6O,EAAI84C,EACJvhD,EAAI+nC,EACJpuC,EAAM2nD,EAAG1nD,QAOPC,GAFJF,GADAouC,EAAInjC,KAAKkd,KAAK4/B,EA76CL,IA86CC/nD,EAAMouC,EAAI,EAAIpuC,EAAM,KAG5BE,EAAIF,EACJ8O,EAAE7O,OAAS,GAIb6O,EAAE2lC,UACKv0C,KAAM4O,EAAE9K,KAAK,GACpB8K,EAAE2lC,UAeJ,KAZAz0C,EAAM2nD,EAAG1nD,SACTC,EAAI0nD,EAAG3nD,QAGO,IACZC,EAAIF,EACJ8O,EAAI84C,EACJA,EAAKD,EACLA,EAAK74C,GAIF69C,EAAQ,EAAGzsD,GACdysD,GAAShF,IAAKznD,GAAKynD,EAAGznD,GAAK0nD,EAAG1nD,GAAKysD,GAASzG,EAAO,EACnDyB,EAAGznD,IAAMgmD,EAUX,IAPIyG,IACFhF,EAAGpT,QAAQoY,KACTtmD,GAKCrG,EAAM2nD,EAAG1nD,OAAqB,GAAb0nD,IAAK3nD,IAAY2nD,EAAGvtC,MAK1C,OAHA9Q,EAAEwF,EAAI64C,EACNr+C,EAAEjD,EAAIimD,EAAkB3E,EAAIthD,GAErBk/C,EAAW+B,EAASh+C,EAAGy+C,EAAIpB,GAAMr9C,GAU1C+8C,EAAEtB,UAAYsB,EAAE4B,GAAK,SAAUjf,GAC7B,IAAIoF,EACF/kC,EAAI7D,KAEN,QAAU,IAANwjC,GAAgBA,MAAQA,GAAW,IAANA,GAAiB,IAANA,EAAS,MAAMrC,MAAM8e,EAAkBzc,GASnF,OAPI3/B,EAAEyF,GACJs/B,EAAIwe,EAAavjD,EAAEyF,GACfk6B,GAAK3/B,EAAEhD,EAAI,EAAI+nC,IAAGA,EAAI/kC,EAAEhD,EAAI,IAEhC+nC,EAAIrD,IAGCqD,GASTiY,EAAEn7C,MAAQ,WACR,IAAI7B,EAAI7D,KACNwiD,EAAO3+C,EAAEtG,YAEX,OAAOukD,EAAS,IAAIU,EAAK3+C,GAAIA,EAAEhD,EAAI,EAAG2hD,EAAKhD,WAmB7CqB,EAAEwG,KAAOxG,EAAEpd,IAAM,WACf,IAAI8e,EAAIpB,EACNt9C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAKsG,EAAEsc,WACHtc,EAAEw/C,SAAiB,IAAIb,EAAK3+C,IAEhC0+C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK98C,KAAKijB,IAAI7kB,EAAEhD,EAAGgD,EAAE4+C,MAzhD3B,EA0hDXD,EAAKhD,SAAW,EAEhB37C,EA67DF,SAAc2+C,EAAM3+C,GAClB,IAAI+kC,EACFpuC,EAAMqJ,EAAEyF,EAAE7O,OAEZ,GAAID,EAAM,EAAG,OAAOmoD,EAAaH,EAAM,EAAG3+C,EAAGA,GAQ7C+kC,GADAA,EAAI,IAAMnjC,KAAKsE,KAAKvP,IACZ,GAAK,GAAS,EAAJouC,EAGlB/kC,EAAI8+C,EAAaH,EAAM,EADvB3+C,EAAIA,EAAE++C,MAAM,EAAIF,EAAQ,EAAG9Z,IACE/kC,GAO7B,IAJA,IAAIyjD,EACF5C,EAAK,IAAIlC,EAAK,GACdmC,EAAM,IAAInC,EAAK,IACfoC,EAAM,IAAIpC,EAAK,IACV5Z,KACL0e,EAASzjD,EAAE++C,MAAM/+C,GACjBA,EAAIA,EAAE++C,MAAM8B,EAAG9gB,KAAK0jB,EAAO1E,MAAM+B,EAAI/B,MAAM0E,GAAQzjB,MAAM+gB,MAG3D,OAAO/gD,EAx9DHwjD,CAAK7E,EAAMM,EAAiBN,EAAM3+C,IAEtC2+C,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETW,EAAS7C,EAAW,EAAIp7C,EAAEk/C,MAAQl/C,EAAG0+C,EAAIpB,GAAI,IAb1B,IAAIqB,EAAKjd,MA6BrCsb,EAAE0G,WAAa1G,EAAE92C,KAAO,WACtB,IAAIF,EAAGpK,EAAGgjD,EAAIj2C,EAAG02C,EAAKp4C,EACpBjH,EAAI7D,KACJsJ,EAAIzF,EAAEyF,EACNzI,EAAIgD,EAAEhD,EACN8S,EAAI9P,EAAE8P,EACN6uC,EAAO3+C,EAAEtG,YAGX,GAAU,IAANoW,IAAYrK,IAAMA,EAAE,GACtB,OAAO,IAAIk5C,GAAM7uC,GAAKA,EAAI,KAAOrK,GAAKA,EAAE,IAAMi8B,IAAMj8B,EAAIzF,EAAI,KAgC9D,IA7BAk8C,GAAW,EAOF,IAJTpsC,EAAIlO,KAAKsE,MAAMlG,KAID8P,GAAK,OACjBlU,EAAIqhD,EAAex3C,IAEZ7O,OAASoG,GAAK,GAAK,IAAGpB,GAAK,KAClCkU,EAAIlO,KAAKsE,KAAKtK,GACdoB,EAAIu/C,GAAWv/C,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS3C2L,EAAI,IAAIg2C,EANN/iD,EADEkU,GAAK,IACH,KAAO9S,GAEXpB,EAAIkU,EAAE2vC,iBACAxkD,MAAM,EAAGW,EAAEuyB,QAAQ,KAAO,GAAKnxB,IAKvC2L,EAAI,IAAIg2C,EAAK7uC,EAAEjU,YAGjB+iD,GAAM5hD,EAAI2hD,EAAKjD,WAAa,IAQ1B,GAHA/yC,GADA1B,EAAI0B,GACEo3B,KAAK2f,EAAO1/C,EAAGiH,EAAG23C,EAAK,EAAG,IAAIG,MAAM,IAGtC9B,EAAeh2C,EAAExB,GAAGxK,MAAM,EAAG2jD,MAAShjD,EAAIqhD,EAAet0C,EAAElD,IAAIxK,MAAM,EAAG2jD,GAAK,CAK/E,GAAS,SAJThjD,EAAIA,EAAEX,MAAM2jD,EAAK,EAAGA,EAAK,MAILS,GAAY,QAALzjD,GAepB,EAICA,KAAOA,EAAEX,MAAM,IAAqB,KAAfW,EAAEmiD,OAAO,MAGlCE,EAASt1C,EAAG3L,EAAI,EAAG,GACnBgJ,GAAK2C,EAAEo2C,MAAMp2C,GAAGg3C,GAAG3/C,IAGrB,MAtBA,IAAKq/C,IACHpB,EAASh3C,EAAGjK,EAAI,EAAG,GAEfiK,EAAE83C,MAAM93C,GAAG04C,GAAG3/C,IAAI,CACpB2I,EAAI1B,EACJ,MAIJ23C,GAAM,EACNS,EAAM,EAmBZ,OAFAnD,GAAW,EAEJ+B,EAASt1C,EAAG3L,EAAG2hD,EAAKhD,SAAU31C,IAiBvCg3C,EAAE2G,QAAU3G,EAAE4G,IAAM,WAClB,IAAIlF,EAAIpB,EACNt9C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAEX,OAAKsG,EAAEsc,WACHtc,EAAEw/C,SAAiB,IAAIb,EAAK3+C,IAEhC0+C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SACVgD,EAAKjD,UAAYgD,EAAK,GACtBC,EAAKhD,SAAW,GAEhB37C,EAAIA,EAAE4/B,OACJ9vB,EAAI,EACN9P,EAAI0/C,EAAO1/C,EAAG,IAAI2+C,EAAK,GAAG3e,MAAMhgC,EAAE++C,MAAM/+C,IAAIkG,OAAQw4C,EAAK,GAAI,GAE7DC,EAAKjD,UAAYgD,EACjBC,EAAKhD,SAAW2B,EAETW,EAAqB,GAAZ7C,GAA6B,GAAZA,EAAgBp7C,EAAEk/C,MAAQl/C,EAAG0+C,EAAIpB,GAAI,IAf5C,IAAIqB,EAAKjd,MAwCrCsb,EAAE+B,MAAQ/B,EAAE6G,IAAM,SAAU5jD,GAC1B,IAAIqjD,EAAOtmD,EAAGnG,EAAGkuC,EAAGp8B,EAAGm7C,EAAI78C,EAAGm3C,EAAKC,EACjCr+C,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YACT4kD,EAAKt+C,EAAEyF,EACP84C,GAAMt+C,EAAI,IAAI0+C,EAAK1+C,IAAIwF,EAKzB,GAHAxF,EAAE6P,GAAK9P,EAAE8P,IAGJwuC,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAII,GAAM1+C,EAAE6P,GAAKwuC,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAI5D5c,IAIC4c,GAAOC,EAAqB,EAANt+C,EAAE6P,EAAZ7P,EAAE6P,EAAI,GAoBzB,IAjBA9S,EAAIu/C,EAAUv8C,EAAEhD,EA3tDL,GA2tDqBu/C,EAAUt8C,EAAEjD,EA3tDjC,IA4tDXohD,EAAME,EAAG1nD,SACTynD,EAAME,EAAG3nD,UAIP+R,EAAI21C,EACJA,EAAKC,EACLA,EAAK51C,EACLm7C,EAAK1F,EACLA,EAAMC,EACNA,EAAMyF,GAIRn7C,EAAI,GAEC9R,EADLitD,EAAK1F,EAAMC,EACExnD,KAAM8R,EAAEhO,KAAK,GAG1B,IAAK9D,EAAIwnD,IAAOxnD,GAAK,GAAI,CAEvB,IADAysD,EAAQ,EACHve,EAAIqZ,EAAMvnD,EAAGkuC,EAAIluC,GACpBoQ,EAAI0B,EAAEo8B,GAAKwZ,EAAG1nD,GAAKynD,EAAGvZ,EAAIluC,EAAI,GAAKysD,EACnC36C,EAAEo8B,KAAO99B,EAAI41C,EAAO,EACpByG,EAAQr8C,EAAI41C,EAAO,EAGrBl0C,EAAEo8B,IAAMp8B,EAAEo8B,GAAKue,GAASzG,EAAO,EAIjC,MAAQl0C,IAAIm7C,IAAMn7C,EAAEoI,MAQpB,OANIuyC,IAAStmD,EACR2L,EAAEq6C,QAEP/iD,EAAEwF,EAAIkD,EACN1I,EAAEjD,EAAIimD,EAAkBt6C,EAAG3L,GAEpBk/C,EAAW+B,EAASh+C,EAAG0+C,EAAKjD,UAAWiD,EAAKhD,UAAY17C,GAcjE+8C,EAAE+G,SAAW,SAAUnF,EAAItB,GACzB,OAAO0G,EAAe7nD,KAAM,EAAGyiD,EAAItB,IAcrCN,EAAEiH,gBAAkBjH,EAAEkH,KAAO,SAAUrE,EAAIvC,GACzC,IAAIt9C,EAAI7D,KACNwiD,EAAO3+C,EAAEtG,YAGX,OADAsG,EAAI,IAAI2+C,EAAK3+C,QACF,IAAP6/C,EAAsB7/C,GAE1Bo9C,EAAWyC,EAAI,EAAGvE,QAEP,IAAPgC,EAAeA,EAAKqB,EAAKhD,SACxByB,EAAWE,EAAI,EAAG,GAEhBW,EAASj+C,EAAG6/C,EAAK7/C,EAAEhD,EAAI,EAAGsgD,KAYnCN,EAAEyC,cAAgB,SAAUI,EAAIvC,GAC9B,IAAI9hB,EACFx7B,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAcX,YAZW,IAAPmmD,EACFrkB,EAAM2oB,EAAenkD,GAAG,IAExBo9C,EAAWyC,EAAI,EAAGvE,QAEP,IAAPgC,EAAeA,EAAKqB,EAAKhD,SACxByB,EAAWE,EAAI,EAAG,GAGvB9hB,EAAM2oB,EADNnkD,EAAIi+C,EAAS,IAAIU,EAAK3+C,GAAI6/C,EAAK,EAAGvC,IACV,EAAMuC,EAAK,IAG9B7/C,EAAEohD,UAAYphD,EAAEw/C,SAAW,IAAMhkB,EAAMA,GAoBhDwhB,EAAEvuC,QAAU,SAAUoxC,EAAIvC,GACxB,IAAI9hB,EAAKv7B,EACPD,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAgBX,YAdW,IAAPmmD,EACFrkB,EAAM2oB,EAAenkD,IAErBo9C,EAAWyC,EAAI,EAAGvE,QAEP,IAAPgC,EAAeA,EAAKqB,EAAKhD,SACxByB,EAAWE,EAAI,EAAG,GAGvB9hB,EAAM2oB,EADNlkD,EAAIg+C,EAAS,IAAIU,EAAK3+C,GAAI6/C,EAAK7/C,EAAEhD,EAAI,EAAGsgD,IAChB,EAAOuC,EAAK5/C,EAAEjD,EAAI,IAKrCgD,EAAEohD,UAAYphD,EAAEw/C,SAAW,IAAMhkB,EAAMA,GAehDwhB,EAAEoH,WAAa,SAAUC,GACvB,IAAI5+C,EAAG6+C,EAAIv9C,EAAIC,EAAIhK,EAAG+nC,EAAGnpC,EAAG2oD,EAAIC,EAAI9F,EAAIyE,EAAGx6C,EACzC3I,EAAI7D,KACJmiD,EAAKt+C,EAAEyF,EACPk5C,EAAO3+C,EAAEtG,YAEX,IAAK4kD,EAAI,OAAO,IAAIK,EAAK3+C,GAUzB,GARAwkD,EAAKF,EAAK,IAAI3F,EAAK,GACnB53C,EAAKw9C,EAAK,IAAI5F,EAAK,GAInB5Z,GADA/nC,GADAyI,EAAI,IAAIk5C,EAAK53C,IACP/J,EAAIumD,EAAajF,GAAMt+C,EAAEhD,EAAI,GA34DxB,EA64DXyI,EAAEA,EAAE,GAAK+2C,EAAQ,GAAIzX,EAAI,EA74Dd,EA64D6BA,EAAIA,GAEhC,MAARsf,EAGFA,EAAOrnD,EAAI,EAAIyI,EAAI++C,MACd,CAEL,KADA5oD,EAAI,IAAI+iD,EAAK0F,IACNrC,SAAWpmD,EAAEymD,GAAGmC,GAAK,MAAMlnB,MAAM8e,EAAkBxgD,GAC1DyoD,EAAOzoD,EAAEwkD,GAAG36C,GAAMzI,EAAI,EAAIyI,EAAI++C,EAAM5oD,EAQtC,IALAsgD,GAAW,EACXtgD,EAAI,IAAI+iD,EAAK1B,EAAeqB,IAC5BI,EAAKC,EAAKjD,UACViD,EAAKjD,UAAY1+C,EA55DN,EA45DUshD,EAAG1nD,OAAoB,EAG1CusD,EAAIzD,EAAO9jD,EAAG6J,EAAG,EAAG,EAAG,GAEH,IADpBuB,EAAKs9C,EAAGvkB,KAAKojB,EAAEpE,MAAMh4C,KACdo3C,IAAIkG,IACXC,EAAKv9C,EACLA,EAAKC,EACLA,EAAKw9C,EACLA,EAAKD,EAAGxkB,KAAKojB,EAAEpE,MAAM/3C,IACrBu9C,EAAKv9C,EACLA,EAAKvB,EACLA,EAAI7J,EAAEokC,MAAMmjB,EAAEpE,MAAM/3C,IACpBpL,EAAIoL,EAeN,OAZAA,EAAK04C,EAAO2E,EAAKrkB,MAAMskB,GAAKv9C,EAAI,EAAG,EAAG,GACtCw9C,EAAKA,EAAGxkB,KAAK/4B,EAAG+3C,MAAMyF,IACtBF,EAAKA,EAAGvkB,KAAK/4B,EAAG+3C,MAAMh4C,IACtBw9C,EAAGz0C,EAAI00C,EAAG10C,EAAI9P,EAAE8P,EAGhBnH,EAAI+2C,EAAO8E,EAAIz9C,EAAI/J,EAAG,GAAGgjC,MAAMhgC,GAAGsH,MAAM62C,IAAIuB,EAAO6E,EAAID,EAAItnD,EAAG,GAAGgjC,MAAMhgC,GAAGsH,OAAS,EAC7E,CAACk9C,EAAIz9C,GAAM,CAACw9C,EAAID,GAEtB3F,EAAKjD,UAAYgD,EACjBxC,GAAW,EAEJvzC,GAcTq0C,EAAEyH,cAAgBzH,EAAE0H,MAAQ,SAAU9F,EAAItB,GACxC,OAAO0G,EAAe7nD,KAAM,GAAIyiD,EAAItB,IAoBtCN,EAAE2H,UAAY,SAAU1kD,EAAGq9C,GACzB,IAAIt9C,EAAI7D,KACNwiD,EAAO3+C,EAAEtG,YAIX,GAFAsG,EAAI,IAAI2+C,EAAK3+C,GAEJ,MAALC,EAAW,CAGb,IAAKD,EAAEyF,EAAG,OAAOzF,EAEjBC,EAAI,IAAI0+C,EAAK,GACbrB,EAAKqB,EAAKhD,aACL,CASL,GARA17C,EAAI,IAAI0+C,EAAK1+C,QACF,IAAPq9C,EACFA,EAAKqB,EAAKhD,SAEVyB,EAAWE,EAAI,EAAG,IAIft9C,EAAEyF,EAAG,OAAOxF,EAAE6P,EAAI9P,EAAIC,EAG3B,IAAKA,EAAEwF,EAEL,OADIxF,EAAE6P,IAAG7P,EAAE6P,EAAI9P,EAAE8P,GACV7P,EAiBX,OAZIA,EAAEwF,EAAE,IACNy2C,GAAW,EACXl8C,EAAI0/C,EAAO1/C,EAAGC,EAAG,EAAGq9C,EAAI,GAAGyB,MAAM9+C,GACjCi8C,GAAW,EACX+B,EAASj+C,KAITC,EAAE6P,EAAI9P,EAAE8P,EACR9P,EAAIC,GAGCD,GASTg9C,EAAE4H,SAAW,WACX,OAAQzoD,MAcV6gD,EAAE6H,QAAU,SAAUjG,EAAItB,GACxB,OAAO0G,EAAe7nD,KAAM,EAAGyiD,EAAItB,IA+CrCN,EAAE8H,QAAU9H,EAAEjuC,IAAM,SAAU9O,GAC5B,IAAIjD,EAAG+nC,EAAG2Z,EAAI/1C,EAAG20C,EAAIxtC,EACnB9P,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YACTqrD,IAAO9kD,EAAI,IAAI0+C,EAAK1+C,IAGtB,KAAKD,EAAEyF,GAAMxF,EAAEwF,GAAMzF,EAAEyF,EAAE,IAAOxF,EAAEwF,EAAE,IAAI,OAAO,IAAIk5C,EAAKnC,GAASx8C,EAAG+kD,IAIpE,IAFA/kD,EAAI,IAAI2+C,EAAK3+C,IAEP2/C,GAAG,GAAI,OAAO3/C,EAKpB,GAHA0+C,EAAKC,EAAKjD,UACV4B,EAAKqB,EAAKhD,SAEN17C,EAAE0/C,GAAG,GAAI,OAAO1B,EAASj+C,EAAG0+C,EAAIpB,GAMpC,IAHAtgD,EAAIu/C,EAAUt8C,EAAEjD,EAlmEL,KAqmEFiD,EAAEwF,EAAE7O,OAAS,IAAMmuC,EAAIggB,EAAK,GAAKA,EAAKA,IApmE5B,iBAsmEjB,OADAp8C,EAAIq8C,EAAOrG,EAAM3+C,EAAG+kC,EAAG2Z,GAChBz+C,EAAE6P,EAAI,EAAI,IAAI6uC,EAAK,GAAGoB,IAAIp3C,GAAKs1C,EAASt1C,EAAG+1C,EAAIpB,GAMxD,IAHAxtC,EAAI9P,EAAE8P,GAGE,EAAG,CAGT,GAAI9S,EAAIiD,EAAEwF,EAAE7O,OAAS,EAAG,OAAO,IAAI+nD,EAAKjd,KAMxC,GAHoB,IAAN,EAATzhC,EAAEwF,EAAEzI,MAAc8S,EAAI,GAGhB,GAAP9P,EAAEhD,GAAoB,GAAVgD,EAAEyF,EAAE,IAAyB,GAAdzF,EAAEyF,EAAE7O,OAEjC,OADAoJ,EAAE8P,EAAIA,EACC9P,EAgBX,OAPAhD,EAAS,IADT+nC,EAAIyX,GAASx8C,EAAG+kD,KACDzoC,SAASyoB,GAEpB,IAAI4Z,EAAK5Z,EAAI,IAAI/nC,EADjBu/C,EAAUwI,GAAMnjD,KAAK49B,IAAI,KAAOyd,EAAej9C,EAAEyF,IAAM7D,KAAK45C,KAAOx7C,EAAEhD,EAAI,KAMrE2hD,EAAK3C,KAAO,GAAKh/C,EAAI2hD,EAAK5C,KAAO,EAAU,IAAI4C,EAAK3hD,EAAI,EAAI8S,EAAI,EAAI,IAE5EosC,GAAW,EACXyC,EAAKhD,SAAW37C,EAAE8P,EAAI,EAMtBi1B,EAAInjC,KAAK+iB,IAAI,IAAK3nB,EAAI,IAAIpG,SAG1B+R,EAAIy6C,EAAmBnjD,EAAE8+C,MAAM6D,EAAiB5iD,EAAG0+C,EAAK3Z,IAAK2Z,IAGvDj5C,GAOA43C,GAJJ10C,EAAIs1C,EAASt1C,EAAG+1C,EAAK,EAAG,IAIEj5C,EAAGi5C,EAAIpB,KAC/BtgD,EAAI0hD,EAAK,IAMJzB,GAHLt0C,EAAIs1C,EAASmF,EAAmBnjD,EAAE8+C,MAAM6D,EAAiB5iD,EAAGhD,EAAI+nC,IAAK/nC,GAAIA,EAAI,EAAG,IAG1DyI,GAAGxK,MAAMyjD,EAAK,EAAGA,EAAK,IAAM,GAAK,OACrD/1C,EAAIs1C,EAASt1C,EAAG+1C,EAAK,EAAG,KAK9B/1C,EAAEmH,EAAIA,EACNosC,GAAW,EACXyC,EAAKhD,SAAW2B,EAETW,EAASt1C,EAAG+1C,EAAIpB,KAezBN,EAAEiI,YAAc,SAAUrG,EAAItB,GAC5B,IAAI9hB,EACFx7B,EAAI7D,KACJwiD,EAAO3+C,EAAEtG,YAcX,YAZW,IAAPklD,EACFpjB,EAAM2oB,EAAenkD,EAAGA,EAAEhD,GAAK2hD,EAAK9C,UAAY77C,EAAEhD,GAAK2hD,EAAK7C,WAE5DsB,EAAWwB,EAAI,EAAGtD,QAEP,IAAPgC,EAAeA,EAAKqB,EAAKhD,SACxByB,EAAWE,EAAI,EAAG,GAGvB9hB,EAAM2oB,EADNnkD,EAAIi+C,EAAS,IAAIU,EAAK3+C,GAAI4+C,EAAItB,GACNsB,GAAM5+C,EAAEhD,GAAKgD,EAAEhD,GAAK2hD,EAAK9C,SAAU+C,IAGtD5+C,EAAEohD,UAAYphD,EAAEw/C,SAAW,IAAMhkB,EAAMA,GAkBhDwhB,EAAEkI,oBAAsBlI,EAAEmI,KAAO,SAAUvG,EAAItB,GAC7C,IACEqB,EADMxiD,KACGzC,YAYX,YAVW,IAAPklD,GACFA,EAAKD,EAAKjD,UACV4B,EAAKqB,EAAKhD,WAEVyB,EAAWwB,EAAI,EAAGtD,QAEP,IAAPgC,EAAeA,EAAKqB,EAAKhD,SACxByB,EAAWE,EAAI,EAAG,IAGlBW,EAAS,IAAIU,EAbZxiD,MAaqByiD,EAAItB,IAWnCN,EAAEnhD,SAAW,WACX,IAAImE,EAAI7D,KACNwiD,EAAO3+C,EAAEtG,YACT8hC,EAAM2oB,EAAenkD,EAAGA,EAAEhD,GAAK2hD,EAAK9C,UAAY77C,EAAEhD,GAAK2hD,EAAK7C,UAE9D,OAAO97C,EAAEohD,UAAYphD,EAAEw/C,SAAW,IAAMhkB,EAAMA,GAQhDwhB,EAAEoI,UAAYpI,EAAEqI,MAAQ,WACtB,OAAOpH,EAAS,IAAI9hD,KAAKzC,YAAYyC,MAAOA,KAAKa,EAAI,EAAG,IAS1DggD,EAAEsI,QAAUtI,EAAEuI,OAAS,WACrB,IAAIvlD,EAAI7D,KACNwiD,EAAO3+C,EAAEtG,YACT8hC,EAAM2oB,EAAenkD,EAAGA,EAAEhD,GAAK2hD,EAAK9C,UAAY77C,EAAEhD,GAAK2hD,EAAK7C,UAE9D,OAAO97C,EAAEohD,QAAU,IAAM5lB,EAAMA,GA6NjC,IAAIkkB,EAAS,WAGX,SAAS8F,EAAgBxlD,EAAG+kC,EAAGrsC,GAC7B,IAAIyoC,EACFmiB,EAAQ,EACRzsD,EAAImJ,EAAEpJ,OAER,IAAKoJ,EAAIA,EAAE/E,QAASpE,KAClBsqC,EAAOnhC,EAAEnJ,GAAKkuC,EAAIue,EAClBtjD,EAAEnJ,GAAKsqC,EAAOzoC,EAAO,EACrB4qD,EAAQniB,EAAOzoC,EAAO,EAKxB,OAFI4qD,GAAOtjD,EAAEkrC,QAAQoY,GAEdtjD,EAGT,SAASylD,EAAQngD,EAAGC,EAAGmgD,EAAIC,GACzB,IAAI9uD,EAAG8R,EAEP,GAAI+8C,GAAMC,EACRh9C,EAAI+8C,EAAKC,EAAK,GAAK,OAEnB,IAAK9uD,EAAI8R,EAAI,EAAG9R,EAAI6uD,EAAI7uD,IACtB,GAAIyO,EAAEzO,IAAM0O,EAAE1O,GAAI,CAChB8R,EAAIrD,EAAEzO,GAAK0O,EAAE1O,GAAK,GAAK,EACvB,MAKN,OAAO8R,EAGT,SAASi9C,EAAStgD,EAAGC,EAAGmgD,EAAIhtD,GAI1B,IAHA,IAAI7B,EAAI,EAGD6uD,KACLpgD,EAAEogD,IAAO7uD,EACTA,EAAIyO,EAAEogD,GAAMngD,EAAEmgD,GAAM,EAAI,EACxBpgD,EAAEogD,GAAM7uD,EAAI6B,EAAO4M,EAAEogD,GAAMngD,EAAEmgD,GAI/B,MAAQpgD,EAAE,IAAMA,EAAE1O,OAAS,GAAI0O,EAAE09C,QAGnC,OAAO,SAAUhjD,EAAGC,EAAGy+C,EAAIpB,EAAIuC,EAAInnD,GACjC,IAAIylD,EAAKnhD,EAAGnG,EAAGkuC,EAAG8gB,EAASC,EAAMC,EAAMC,EAAO7C,EAAG8C,EAAIC,EAAKC,EAAMC,EAAMxH,EAAI33C,EAAGo/C,EAAIC,EAAIC,EACnFC,EAAIC,EACJ9H,EAAO3+C,EAAEtG,YACTgtD,EAAO1mD,EAAE8P,GAAK7P,EAAE6P,EAAI,GAAK,EACzBwuC,EAAKt+C,EAAEyF,EACP84C,EAAKt+C,EAAEwF,EAGT,KAAK64C,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAII,EACR3+C,EAAE8P,GAAM7P,EAAE6P,IAAMwuC,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG9CD,GAAe,GAATA,EAAG,KAAYC,EAAY,EAAPmI,EAAWA,EAAO,EAHQhlB,KAsBxD,IAhBIhpC,GACFmtD,EAAU,EACV7oD,EAAIgD,EAAEhD,EAAIiD,EAAEjD,IAEZtE,EAAOmkD,EACPgJ,EA5jFO,EA6jFP7oD,EAAIu/C,EAAUv8C,EAAEhD,EAAI6oD,GAAWtJ,EAAUt8C,EAAEjD,EAAI6oD,IAGjDW,EAAKjI,EAAG3nD,OACR0vD,EAAKhI,EAAG1nD,OAERqvD,GADA9C,EAAI,IAAIxE,EAAK+H,IACNjhD,EAAI,GAIN5O,EAAI,EAAG0nD,EAAG1nD,KAAOynD,EAAGznD,IAAM,GAAIA,KAanC,GAXI0nD,EAAG1nD,IAAMynD,EAAGznD,IAAM,IAAImG,IAEhB,MAAN0hD,GACFE,EAAKF,EAAKC,EAAKjD,UACf4B,EAAKqB,EAAKhD,UAEViD,EADSiB,EACJnB,GAAM1+C,EAAEhD,EAAIiD,EAAEjD,GAAK,EAEnB0hD,EAGHE,EAAK,EACPqH,EAAGtrD,KAAK,GACRmrD,GAAO,MACF,CAOL,GAJAlH,EAAKA,EAAKiH,EAAU,EAAI,EACxBhvD,EAAI,EAGM,GAAN2vD,EAAS,CAMX,IALAzhB,EAAI,EACJwZ,EAAKA,EAAG,GACRK,KAGQ/nD,EAAIyvD,GAAMvhB,IAAM6Z,IAAM/nD,IAC5BoQ,EAAI89B,EAAIrsC,GAAQ4lD,EAAGznD,IAAM,GACzBovD,EAAGpvD,GAAKoQ,EAAIs3C,EAAK,EACjBxZ,EAAI99B,EAAIs3C,EAAK,EAGfuH,EAAO/gB,GAAKluC,EAAIyvD,MAGX,CAiBL,KAdAvhB,EAAIrsC,GAAQ6lD,EAAG,GAAK,GAAK,GAEjB,IACNA,EAAKiH,EAAgBjH,EAAIxZ,EAAGrsC,GAC5B4lD,EAAKkH,EAAgBlH,EAAIvZ,EAAGrsC,GAC5B8tD,EAAKjI,EAAG3nD,OACR0vD,EAAKhI,EAAG1nD,QAGVyvD,EAAKG,EAELL,GADAD,EAAM5H,EAAGrjD,MAAM,EAAGurD,IACP5vD,OAGJuvD,EAAOK,GAAKN,EAAIC,KAAU,GAEjCM,EAAKlI,EAAGtjD,SACLiwC,QAAQ,GACXqb,EAAMhI,EAAG,GAELA,EAAG,IAAM7lD,EAAO,KAAK6tD,EAEzB,GACExhB,EAAI,GAGJoZ,EAAMsH,EAAQlH,EAAI2H,EAAKM,EAAIL,IAGjB,GAGRC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAO1tD,GAAQwtD,EAAI,IAAM,KAGhDnhB,EAAIqhB,EAAOG,EAAM,GAUT,GACFxhB,GAAKrsC,IAAMqsC,EAAIrsC,EAAO,GAWf,IAHXylD,EAAMsH,EALNM,EAAOP,EAAgBjH,EAAIxZ,EAAGrsC,GAKVwtD,EAJpBF,EAAQD,EAAKnvD,OACbuvD,EAAOD,EAAItvD,WAOTmuC,IAGA6gB,EAASG,EAAMS,EAAKR,EAAQS,EAAKlI,EAAIyH,EAAOttD,MAOrC,GAALqsC,IAAQoZ,EAAMpZ,EAAI,GACtBghB,EAAOxH,EAAGtjD,UAGZ+qD,EAAQD,EAAKnvD,QACDuvD,GAAMJ,EAAK7a,QAAQ,GAG/B0a,EAASM,EAAKH,EAAMI,EAAMztD,IAGd,GAARylD,IAIFA,EAAMsH,EAAQlH,EAAI2H,EAAKM,EAHvBL,EAAOD,EAAItvD,SAMD,IACRmuC,IAGA6gB,EAASM,EAAKM,EAAKL,EAAOM,EAAKlI,EAAI4H,EAAMztD,IAI7CytD,EAAOD,EAAItvD,QACM,IAARunD,IACTpZ,IACAmhB,EAAM,CAAC,IAITD,EAAGpvD,KAAOkuC,EAGNoZ,GAAO+H,EAAI,GACbA,EAAIC,KAAU7H,EAAG+H,IAAO,GAExBH,EAAM,CAAC5H,EAAG+H,IACVF,EAAO,UAGDE,IAAOC,QAAiB,IAAXJ,EAAI,KAAkBtH,KAE7CkH,OAAkB,IAAXI,EAAI,GAIRD,EAAG,IAAIA,EAAGjD,QAIjB,GAAe,GAAX6C,EACF1C,EAAEnmD,EAAIA,EACNm+C,EAAU2K,MACL,CAGL,IAAKjvD,EAAI,EAAGkuC,EAAIkhB,EAAG,GAAIlhB,GAAK,GAAIA,GAAK,GAAIluC,IACzCssD,EAAEnmD,EAAInG,EAAImG,EAAI6oD,EAAU,EAExB5H,EAASkF,EAAGtD,EAAKnB,EAAKyE,EAAEnmD,EAAI,EAAI0hD,EAAIpB,EAAIwI,GAG1C,OAAO3C,GAnQE,GA4QZ,SAASlF,EAASj+C,EAAG4+C,EAAItB,EAAIqJ,GAC5B,IAAIC,EAAQ/vD,EAAGyuB,EAAGyf,EAAG0Y,EAAIoJ,EAAS3mD,EAAGo+C,EAAIwI,EACvCnI,EAAO3+C,EAAEtG,YAGXqsC,EAAK,GAAU,MAAN6Y,EAAY,CAInB,KAHAN,EAAKt+C,EAAEyF,GAGE,OAAOzF,EAWhB,IAAK4mD,EAAS,EAAG7hB,EAAIuZ,EAAG,GAAIvZ,GAAK,GAAIA,GAAK,GAAI6hB,IAI9C,IAHA/vD,EAAI+nD,EAAKgI,GAGD,EACN/vD,GAxxFO,EAyxFPyuB,EAAIs5B,EAIJnB,GAHAv9C,EAAIo+C,EAAGwI,EAAM,IAGJtK,EAAQ,GAAIoK,EAASthC,EAAI,GAAK,GAAK,OAI5C,IAFAwhC,EAAMllD,KAAKkd,MAAMjoB,EAAI,GA/xFd,MAgyFPkuC,EAAIuZ,EAAG1nD,QACO,CACZ,IAAI+vD,EASF,MAAM5gB,EANN,KAAOhB,KAAO+hB,GAAMxI,EAAG3jD,KAAK,GAC5BuF,EAAIu9C,EAAK,EACTmJ,EAAS,EAETthC,GADAzuB,GAxyFG,KAyyFgB,MAIhB,CAIL,IAHAqJ,EAAI6kC,EAAIuZ,EAAGwI,GAGNF,EAAS,EAAG7hB,GAAK,GAAIA,GAAK,GAAI6hB,IAUnCnJ,GAHAn4B,GAJAzuB,GApzFK,KAwzFc+vD,GAGV,EAAI,EAAI1mD,EAAIs8C,EAAQ,GAAIoK,EAASthC,EAAI,GAAK,GAAK,EAoB5D,GAfAqhC,EAAcA,GAAe/H,EAAK,QAChB,IAAhBN,EAAGwI,EAAM,KAAkBxhC,EAAI,EAAIplB,EAAIA,EAAIs8C,EAAQ,GAAIoK,EAASthC,EAAI,IAMtEuhC,EAAUvJ,EAAK,GACVG,GAAMkJ,KAAuB,GAANrJ,GAAWA,IAAOt9C,EAAE8P,EAAI,EAAI,EAAI,IACxD2tC,EAAK,GAAW,GAANA,IAAkB,GAANH,GAAWqJ,GAAqB,GAANrJ,IAG9CzmD,EAAI,EAAIyuB,EAAI,EAAIplB,EAAIs8C,EAAQ,GAAIoK,EAASthC,GAAK,EAAIg5B,EAAGwI,EAAM,IAAM,GAAM,GACvExJ,IAAOt9C,EAAE8P,EAAI,EAAI,EAAI,IAEvB8uC,EAAK,IAAMN,EAAG,GAgBhB,OAfAA,EAAG1nD,OAAS,EACRiwD,GAGFjI,GAAM5+C,EAAEhD,EAAI,EAGZshD,EAAG,GAAK9B,EAAQ,IAv1FX,EAu1F2BoC,EAv1F3B,MAw1FL5+C,EAAEhD,GAAK4hD,GAAM,GAIbN,EAAG,GAAKt+C,EAAEhD,EAAI,EAGTgD,EAiBT,GAbS,GAALnJ,GACFynD,EAAG1nD,OAASkwD,EACZ/hB,EAAI,EACJ+hB,MAEAxI,EAAG1nD,OAASkwD,EAAM,EAClB/hB,EAAIyX,EAAQ,GAz2FL,EAy2FoB3lD,GAI3BynD,EAAGwI,GAAOxhC,EAAI,GAAKplB,EAAIs8C,EAAQ,GAAIoK,EAASthC,GAAKk3B,EAAQ,GAAIl3B,GAAK,GAAKyf,EAAI,GAGzE8hB,EACF,OAAS,CAGP,GAAW,GAAPC,EAAU,CAGZ,IAAKjwD,EAAI,EAAGyuB,EAAIg5B,EAAG,GAAIh5B,GAAK,GAAIA,GAAK,GAAIzuB,IAEzC,IADAyuB,EAAIg5B,EAAG,IAAMvZ,EACRA,EAAI,EAAGzf,GAAK,GAAIA,GAAK,GAAIyf,IAG1BluC,GAAKkuC,IACP/kC,EAAEhD,IACEshD,EAAG,IAAMzB,IAAMyB,EAAG,GAAK,IAG7B,MAGA,GADAA,EAAGwI,IAAQ/hB,EACPuZ,EAAGwI,IAAQjK,EAAM,MACrByB,EAAGwI,KAAS,EACZ/hB,EAAI,EAMV,IAAKluC,EAAIynD,EAAG1nD,OAAoB,IAAZ0nD,IAAKznD,IAAWynD,EAAGvtC,MAsBzC,OAnBImrC,IAGEl8C,EAAEhD,EAAI2hD,EAAK3C,MAGbh8C,EAAEyF,EAAI,KACNzF,EAAEhD,EAAI0kC,KAGG1hC,EAAEhD,EAAI2hD,EAAK5C,OAGpB/7C,EAAEhD,EAAI,EACNgD,EAAEyF,EAAI,CAAC,KAKJzF,EAIT,SAASmkD,EAAenkD,EAAG+mD,EAAOnI,GAChC,IAAK5+C,EAAEsc,WAAY,OAAO0qC,EAAkBhnD,GAC5C,IAAI+kC,EACF/nC,EAAIgD,EAAEhD,EACNw+B,EAAMyhB,EAAej9C,EAAEyF,GACvB9O,EAAM6kC,EAAI5kC,OAwBZ,OAtBImwD,GACEnI,IAAO7Z,EAAI6Z,EAAKjoD,GAAO,EACzB6kC,EAAMA,EAAIuiB,OAAO,GAAK,IAAMviB,EAAIvgC,MAAM,GAAKkiD,EAAcpY,GAChDpuC,EAAM,IACf6kC,EAAMA,EAAIuiB,OAAO,GAAK,IAAMviB,EAAIvgC,MAAM,IAGxCugC,EAAMA,GAAOx7B,EAAEhD,EAAI,EAAI,IAAM,MAAQgD,EAAEhD,GAC9BA,EAAI,GACbw+B,EAAM,KAAO2hB,GAAengD,EAAI,GAAKw+B,EACjCojB,IAAO7Z,EAAI6Z,EAAKjoD,GAAO,IAAG6kC,GAAO2hB,EAAcpY,KAC1C/nC,GAAKrG,GACd6kC,GAAO2hB,EAAcngD,EAAI,EAAIrG,GACzBioD,IAAO7Z,EAAI6Z,EAAK5hD,EAAI,GAAK,IAAGw+B,EAAMA,EAAM,IAAM2hB,EAAcpY,OAE3DA,EAAI/nC,EAAI,GAAKrG,IAAK6kC,EAAMA,EAAIvgC,MAAM,EAAG8pC,GAAK,IAAMvJ,EAAIvgC,MAAM8pC,IAC3D6Z,IAAO7Z,EAAI6Z,EAAKjoD,GAAO,IACrBqG,EAAI,IAAMrG,IAAK6kC,GAAO,KAC1BA,GAAO2hB,EAAcpY,KAIlBvJ,EAKT,SAASynB,EAAkB2D,EAAQ5pD,GACjC,IAAIkD,EAAI0mD,EAAO,GAGf,IAAM5pD,GA58FK,EA48FUkD,GAAK,GAAIA,GAAK,GAAIlD,IACvC,OAAOA,EAIT,SAAS6lD,EAAQlE,EAAMC,EAAIF,GACzB,GAAIE,EAAK9B,EAKP,MAFAZ,GAAW,EACPwC,IAAIC,EAAKjD,UAAYgD,GACnBphB,MAAM+e,GAEd,OAAO4B,EAAS,IAAIU,EAAKnD,GAAOoD,EAAI,GAAG,GAIzC,SAASyC,EAAM1C,EAAMC,EAAItB,GACvB,GAAIsB,EAAK7B,EAAc,MAAMzf,MAAM+e,GACnC,OAAO4B,EAAS,IAAIU,EAAK93C,GAAK+3C,EAAItB,GAAI,GAIxC,SAASiG,EAAaqD,GACpB,IAAI1mD,EAAI0mD,EAAOhwD,OAAS,EACtBD,EAr+FS,EAq+FHuJ,EAAe,EAKvB,GAHAA,EAAI0mD,EAAO1mD,GAGJ,CAGL,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIvJ,IAG7B,IAAKuJ,EAAI0mD,EAAO,GAAI1mD,GAAK,GAAIA,GAAK,GAAIvJ,IAGxC,OAAOA,EAIT,SAASwmD,EAAcpY,GAErB,IADA,IAAIkiB,EAAK,GACFliB,KAAMkiB,GAAM,IACnB,OAAOA,EAWT,SAASjC,EAAOrG,EAAM3+C,EAAGpE,EAAG8iD,GAC1B,IAAIiI,EACFh+C,EAAI,IAAIg2C,EAAK,GAIb5Z,EAAInjC,KAAKkd,KAAK4/B,EA3gGL,EA2gGqB,GAIhC,IAFAxC,GAAW,IAEF,CAOP,GANItgD,EAAI,GAEFsrD,GADJv+C,EAAIA,EAAEo2C,MAAM/+C,IACGyF,EAAGs/B,KAAI4hB,GAAc,GAI5B,KADV/qD,EAAI2gD,EAAU3gD,EAAI,IACL,CAGXA,EAAI+M,EAAElD,EAAE7O,OAAS,EACb+vD,GAA0B,IAAXh+C,EAAElD,EAAE7J,MAAY+M,EAAElD,EAAE7J,GACvC,MAIFsrD,GADAlnD,EAAIA,EAAE++C,MAAM/+C,IACDyF,EAAGs/B,GAKhB,OAFAmX,GAAW,EAEJvzC,EAIT,SAASw+C,EAAMvrD,GACb,OAA6B,EAAtBA,EAAE6J,EAAE7J,EAAE6J,EAAE7O,OAAS,GAO1B,SAASwwD,EAASzI,EAAMnmB,EAAM6uB,GAK5B,IAJA,IAAIpnD,EACFD,EAAI,IAAI2+C,EAAKnmB,EAAK,IAClB3hC,EAAI,IAEGA,EAAI2hC,EAAK5hC,QAAS,CAEzB,KADAqJ,EAAI,IAAI0+C,EAAKnmB,EAAK3hC,KACXiZ,EAAG,CACR9P,EAAIC,EACJ,MACSD,EAAEqnD,GAAMpnD,KACjBD,EAAIC,GAIR,OAAOD,EAmCT,SAASojD,EAAmBpjD,EAAG4+C,GAC7B,IAAI6D,EAAa6E,EAAOhiC,EAAGvW,EAAKq/B,EAAKnnC,EAAG06C,EACtCtC,EAAM,EACNxoD,EAAI,EACJkuC,EAAI,EACJ4Z,EAAO3+C,EAAEtG,YACT4jD,EAAKqB,EAAKhD,SACV+C,EAAKC,EAAKjD,UAGZ,IAAK17C,EAAEyF,IAAMzF,EAAEyF,EAAE,IAAMzF,EAAEhD,EAAI,GAE3B,OAAO,IAAI2hD,EAAK3+C,EAAEyF,EACbzF,EAAEyF,EAAE,GAASzF,EAAE8P,EAAI,EAAI,EAAI,IAAlB,EACV9P,EAAE8P,EAAI9P,EAAE8P,EAAI,EAAI,EAAI9P,EAAI,KAa9B,IAVU,MAAN4+C,GACF1C,GAAW,EACXyF,EAAMjD,GAENiD,EAAM/C,EAGR33C,EAAI,IAAI03C,EAAK,QAGN3+C,EAAEhD,GAAK,GAGZgD,EAAIA,EAAE++C,MAAM93C,GACZ89B,GAAK,EAUP,IAJA4c,GADA2F,EAAQ1lD,KAAK49B,IAAIgd,EAAQ,EAAGzX,IAAMnjC,KAAK45C,KAAO,EAAI,EAAI,EAEtDiH,EAAc1zC,EAAMq/B,EAAM,IAAIuQ,EAAK,GACnCA,EAAKjD,UAAYiG,IAER,CAKP,GAJA5yC,EAAMkvC,EAASlvC,EAAIgwC,MAAM/+C,GAAI2hD,EAAK,GAClCc,EAAcA,EAAY1D,QAAQloD,GAG9BomD,GAFJh2C,EAAImnC,EAAIrO,KAAK2f,EAAO3wC,EAAK0zC,EAAad,EAAK,KAEtBl8C,GAAGxK,MAAM,EAAG0mD,KAAS1E,EAAe7O,EAAI3oC,GAAGxK,MAAM,EAAG0mD,GAAM,CAE7E,IADAr8B,EAAIyf,EACGzf,KAAK8oB,EAAM6P,EAAS7P,EAAI2Q,MAAM3Q,GAAMuT,EAAK,GAOhD,GAAU,MAAN/C,EAYF,OADAD,EAAKjD,UAAYgD,EACVtQ,EAVP,KAAIiR,EAAM,GAAKhC,EAAoBjP,EAAI3oC,EAAGk8C,EAAM2F,EAAOhK,EAAI+B,IAMzD,OAAOpB,EAAS7P,EAAKuQ,EAAKjD,UAAYgD,EAAIpB,EAAIpB,GAAW,GALzDyC,EAAKjD,UAAYiG,GAAO,GACxBc,EAAc1zC,EAAM9H,EAAI,IAAI03C,EAAK,GACjC9nD,EAAI,EACJwoD,IAUNjR,EAAMnnC,GAoBV,SAAS27C,EAAiB3iD,EAAG2+C,GAC3B,IAAIp5C,EAAG+hD,EAAI9E,EAAazlD,EAAGwqD,EAAWnI,EAAKjR,EAAKnnC,EAAG06C,EAAKr+C,EAAIE,EAC1D5H,EAAI,EAEJoE,EAAIC,EACJq+C,EAAKt+C,EAAEyF,EACPk5C,EAAO3+C,EAAEtG,YACT4jD,EAAKqB,EAAKhD,SACV+C,EAAKC,EAAKjD,UAGZ,GAAI17C,EAAE8P,EAAI,IAAMwuC,IAAOA,EAAG,KAAOt+C,EAAEhD,GAAc,GAATshD,EAAG,IAAwB,GAAbA,EAAG1nD,OACvD,OAAO,IAAI+nD,EAAKL,IAAOA,EAAG,IAAK,IAAgB,GAAPt+C,EAAE8P,EAAS4xB,IAAM4c,EAAK,EAAIt+C,GAcpE,GAXU,MAAN4+C,GACF1C,GAAW,EACXyF,EAAMjD,GAENiD,EAAM/C,EAGRD,EAAKjD,UAAYiG,GAnBP,GAqBV4F,GADA/hD,EAAIy3C,EAAeqB,IACZP,OAAO,KAEVn8C,KAAK0F,IAAItK,EAAIgD,EAAEhD,GAAK,OAqCtB,OAJAiK,EAAI47C,EAAQlE,EAAMgD,EAAM,EAAGjD,GAAIK,MAAM/hD,EAAI,IACzCgD,EAAI4iD,EAAiB,IAAIjE,EAAK4I,EAAK,IAAM/hD,EAAEvK,MAAM,IAAK0mD,EAzD9C,IAyD2D5hB,KAAK94B,GACxE03C,EAAKjD,UAAYgD,EAEJ,MAANE,EAAaX,EAASj+C,EAAG0+C,EAAIpB,EAAIpB,GAAW,GAAQl8C,EAxB3D,KAAOunD,EAAK,GAAW,GAANA,GAAiB,GAANA,GAAW/hD,EAAEu4C,OAAO,GAAK,GAGnDwJ,GADA/hD,EAAIy3C,GADJj9C,EAAIA,EAAE++C,MAAM9+C,IACSwF,IACds4C,OAAO,GACdniD,IAiCJ,IA9BEoB,EAAIgD,EAAEhD,EAEFuqD,EAAK,GACPvnD,EAAI,IAAI2+C,EAAK,KAAOn5C,GACpBxI,KAEAgD,EAAI,IAAI2+C,EAAK4I,EAAK,IAAM/hD,EAAEvK,MAAM,IAepCqI,EAAKtD,EAKLouC,EAAMoZ,EAAYxnD,EAAI0/C,EAAO1/C,EAAEggC,MAAM,GAAIhgC,EAAE+/B,KAAK,GAAI4hB,EAAK,GACzDn+C,EAAKy6C,EAASj+C,EAAE++C,MAAM/+C,GAAI2hD,EAAK,GAC/Bc,EAAc,IAEL,CAIP,GAHA+E,EAAYvJ,EAASuJ,EAAUzI,MAAMv7C,GAAKm+C,EAAK,GAG3C1E,GAFJh2C,EAAImnC,EAAIrO,KAAK2f,EAAO8H,EAAW,IAAI7I,EAAK8D,GAAcd,EAAK,KAEtCl8C,GAAGxK,MAAM,EAAG0mD,KAAS1E,EAAe7O,EAAI3oC,GAAGxK,MAAM,EAAG0mD,GAAM,CAc7E,GAbAvT,EAAMA,EAAI2Q,MAAM,GAIN,IAAN/hD,IAASoxC,EAAMA,EAAIrO,KAAK8iB,EAAQlE,EAAMgD,EAAM,EAAGjD,GAAIK,MAAM/hD,EAAI,MACjEoxC,EAAMsR,EAAOtR,EAAK,IAAIuQ,EAAK/iD,GAAI+lD,EAAK,GAQ1B,MAAN/C,EAWF,OADAD,EAAKjD,UAAYgD,EACVtQ,EAVP,IAAIiP,EAAoBjP,EAAI3oC,EAAGk8C,EA5F3B,GA4FwCrE,EAAI+B,GAM9C,OAAOpB,EAAS7P,EAAKuQ,EAAKjD,UAAYgD,EAAIpB,EAAIpB,GAAW,GALzDyC,EAAKjD,UAAYiG,GA7Ff,GA8FF16C,EAAIugD,EAAYxnD,EAAI0/C,EAAOp8C,EAAG08B,MAAM,GAAI18B,EAAGy8B,KAAK,GAAI4hB,EAAK,GACzDn+C,EAAKy6C,EAASj+C,EAAE++C,MAAM/+C,GAAI2hD,EAAK,GAC/Bc,EAAcpD,EAAM,EAU1BjR,EAAMnnC,EACNw7C,GAAe,GAMnB,SAASuE,EAAkBhnD,GAEzB,OAAOy6B,OAAOz6B,EAAE8P,EAAI9P,EAAE8P,EAAI,GAO5B,SAAS23C,EAAaznD,EAAGw7B,GACvB,IAAIx+B,EAAGnG,EAAGF,EAmBV,KAhBKqG,EAAIw+B,EAAIrN,QAAQ,OAAS,IAAGqN,EAAMA,EAAI/9B,QAAQ,IAAK,MAGnD5G,EAAI2kC,EAAIksB,OAAO,OAAS,GAGvB1qD,EAAI,IAAGA,EAAInG,GACfmG,IAAMw+B,EAAIvgC,MAAMpE,EAAI,GACpB2kC,EAAMA,EAAIrO,UAAU,EAAGt2B,IACdmG,EAAI,IAGbA,EAAIw+B,EAAI5kC,QAILC,EAAI,EAAyB,KAAtB2kC,EAAImsB,WAAW9wD,GAAWA,KAGtC,IAAKF,EAAM6kC,EAAI5kC,OAAoC,KAA5B4kC,EAAImsB,WAAWhxD,EAAM,KAAaA,GAGzD,GAFA6kC,EAAMA,EAAIvgC,MAAMpE,EAAGF,GAEV,CAYP,GAXAA,GAAOE,EACPmJ,EAAEhD,EAAIA,EAAIA,EAAInG,EAAI,EAClBmJ,EAAEyF,EAAI,GAMN5O,GAAKmG,EAAI,GA71GA,EA81GLA,EAAI,IAAGnG,GA91GF,GAg2GLA,EAAIF,EAAK,CAEX,IADIE,GAAGmJ,EAAEyF,EAAE9K,MAAM6gC,EAAIvgC,MAAM,EAAGpE,IACzBF,GAl2GE,EAk2GeE,EAAIF,GAAMqJ,EAAEyF,EAAE9K,MAAM6gC,EAAIvgC,MAAMpE,EAAGA,GAl2GhD,IAo2GPA,EAp2GO,GAm2GP2kC,EAAMA,EAAIvgC,MAAMpE,IACGD,YAEnBC,GAAKF,EAGP,KAAOE,KAAM2kC,GAAO,IACpBx7B,EAAEyF,EAAE9K,MAAM6gC,GAEN0gB,IAGEl8C,EAAEhD,EAAIgD,EAAEtG,YAAYsiD,MAGtBh8C,EAAEyF,EAAI,KACNzF,EAAEhD,EAAI0kC,KAGG1hC,EAAEhD,EAAIgD,EAAEtG,YAAYqiD,OAG7B/7C,EAAEhD,EAAI,EACNgD,EAAEyF,EAAI,CAAC,UAOXzF,EAAEhD,EAAI,EACNgD,EAAEyF,EAAI,CAAC,GAGT,OAAOzF,EAOT,SAAS4nD,EAAW5nD,EAAGw7B,GACrB,IAAI9iC,EAAMimD,EAAMkJ,EAAShxD,EAAGixD,EAASnxD,EAAKkD,EAAGykD,EAAIltB,EAEjD,GAAY,aAARoK,GAA8B,QAARA,EAIxB,OAHMA,IAAKx7B,EAAE8P,EAAI4xB,KACjB1hC,EAAEhD,EAAI0kC,IACN1hC,EAAEyF,EAAI,KACCzF,EAGT,GAAI08C,EAAM3gD,KAAKy/B,GACb9iC,EAAO,GACP8iC,EAAMA,EAAInC,mBACL,GAAIojB,EAAS1gD,KAAKy/B,GACvB9iC,EAAO,MACF,KAAIikD,EAAQ5gD,KAAKy/B,GAGtB,MAAM8B,MAAM8e,EAAkB5gB,GAF9B9iC,EAAO,EAkCT,KA5BA7B,EAAI2kC,EAAIksB,OAAO,OAEP,GACN7tD,GAAK2hC,EAAIvgC,MAAMpE,EAAI,GACnB2kC,EAAMA,EAAIrO,UAAU,EAAGt2B,IAEvB2kC,EAAMA,EAAIvgC,MAAM,GAMlB6sD,GADAjxD,EAAI2kC,EAAIrN,QAAQ,OACD,EACfwwB,EAAO3+C,EAAEtG,YAELouD,IAGFjxD,GADAF,GADA6kC,EAAMA,EAAI/9B,QAAQ,IAAK,KACb7G,QACAC,EAGVgxD,EAAU7C,EAAOrG,EAAM,IAAIA,EAAKjmD,GAAO7B,EAAO,EAAJA,IAOvCA,EAHLu6B,GADAktB,EAAKZ,EAAYliB,EAAK9iC,EAAMmkD,IACpBjmD,OAAS,EAGM,IAAV0nD,EAAGznD,KAAYA,EAAGynD,EAAGvtC,MAClC,OAAIla,EAAI,EAAU,IAAI8nD,EAAW,EAAN3+C,EAAE8P,IAC7B9P,EAAEhD,EAAIimD,EAAkB3E,EAAIltB,GAC5BpxB,EAAEyF,EAAI64C,EACNpC,GAAW,EAQP4L,IAAS9nD,EAAI0/C,EAAO1/C,EAAG6nD,EAAe,EAANlxD,IAGhCkD,IAAGmG,EAAIA,EAAE++C,MAAMn9C,KAAK0F,IAAIzN,GAAK,GAAK2iD,EAAQ,EAAG3iD,GAAKqhD,EAAQnsC,IAAI,EAAGlV,KACrEqiD,GAAW,EAEJl8C,GAyCT,SAAS8+C,EAAaH,EAAM/iD,EAAGoE,EAAGC,EAAG8nD,GACnC,IAAIziC,EAAGre,EAAGgf,EAAGziB,EAEXk7C,EAAKC,EAAKjD,UACV3W,EAAInjC,KAAKkd,KAAK4/B,EA7/GL,GAmgHX,IAJAxC,GAAW,EACX14C,EAAKxD,EAAE++C,MAAM/+C,GACbimB,EAAI,IAAI04B,EAAK1+C,KAEJ,CAMP,GALAgH,EAAIy4C,EAAOz5B,EAAE84B,MAAMv7C,GAAK,IAAIm7C,EAAK/iD,IAAMA,KAAM8iD,EAAI,GACjDz4B,EAAI8hC,EAAe9nD,EAAE8/B,KAAK94B,GAAKhH,EAAE+/B,MAAM/4B,GACvChH,EAAIy/C,EAAOz4C,EAAE83C,MAAMv7C,GAAK,IAAIm7C,EAAK/iD,IAAMA,KAAM8iD,EAAI,QAGlC,KAFfz3C,EAAIgf,EAAE8Z,KAAK9/B,IAELwF,EAAEs/B,GAAe,CACrB,IAAKzf,EAAIyf,EAAG99B,EAAExB,EAAE6f,KAAOW,EAAExgB,EAAE6f,IAAMA,MACjC,IAAU,GAANA,EAAS,MAGfA,EAAIW,EACJA,EAAIhmB,EACJA,EAAIgH,EACJA,EAAIqe,EAON,OAHA42B,GAAW,EACXj1C,EAAExB,EAAE7O,OAASmuC,EAAI,EAEV99B,EAKT,SAAS43C,EAAQt5C,EAAGvI,GAElB,IADA,IAAIpB,EAAI2J,IACCvI,GAAGpB,GAAK2J,EACjB,OAAO3J,EAKT,SAASqjD,EAAiBN,EAAM3+C,GAC9B,IAAIiH,EACFm6C,EAAQphD,EAAE8P,EAAI,EACdk4C,EAAK3G,EAAM1C,EAAMA,EAAKjD,UAAW,GACjCyF,EAAS6G,EAAGjJ,MAAM,IAIpB,IAFA/+C,EAAIA,EAAEsH,OAEAi6C,IAAIJ,GAER,OADA/F,EAAWgG,EAAQ,EAAI,EAChBphD,EAKT,IAFAiH,EAAIjH,EAAEigD,SAAS+H,IAETxI,SACJpE,EAAWgG,EAAQ,EAAI,MAClB,CAIL,IAHAphD,EAAIA,EAAEggC,MAAM/4B,EAAE83C,MAAMiJ,KAGdzG,IAAIJ,GAER,OADA/F,EAAW+L,EAAMlgD,GAAMm6C,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAC9CphD,EAGTo7C,EAAW+L,EAAMlgD,GAAMm6C,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAGvD,OAAOphD,EAAEggC,MAAMgoB,GAAI1gD,MASrB,SAAS08C,EAAehkD,EAAG49C,EAASgB,EAAItB,GACtC,IAAI5kD,EAAMsE,EAAGnG,EAAGkuC,EAAGpuC,EAAKkwD,EAASrrB,EAAK8iB,EAAIr+C,EACxC0+C,EAAO3+C,EAAEtG,YACTqtD,OAAe,IAAPnI,EAWV,GATImI,GACF3J,EAAWwB,EAAI,EAAGtD,QACP,IAAPgC,EAAeA,EAAKqB,EAAKhD,SACxByB,EAAWE,EAAI,EAAG,KAEvBsB,EAAKD,EAAKjD,UACV4B,EAAKqB,EAAKhD,UAGP37C,EAAEsc,WAEA,CAoCL,IA3BIyqC,GACFruD,EAAO,EACQ,IAAXklD,EACFgB,EAAU,EAALA,EAAS,EACM,GAAXhB,IACTgB,EAAU,EAALA,EAAS,IAGhBlmD,EAAOklD,GAfT/mD,GADA2kC,EAAM2oB,EAAenkD,IACbmuB,QAAQ,OAsBP,IACPqN,EAAMA,EAAI/9B,QAAQ,IAAK,KACvBwC,EAAI,IAAI0+C,EAAK,IACX3hD,EAAIw+B,EAAI5kC,OAASC,EACnBoJ,EAAEwF,EAAIi4C,EAAYyG,EAAelkD,GAAI,GAAIvH,GACzCuH,EAAEjD,EAAIiD,EAAEwF,EAAE7O,QAIZoG,EAAIrG,GADJ2nD,EAAKZ,EAAYliB,EAAK,GAAI9iC,IACb9B,OAGO,GAAb0nD,IAAK3nD,IAAY2nD,EAAGvtC,MAE3B,GAAKutC,EAAG,GAED,CAyBL,GAxBIznD,EAAI,EACNmG,MAEAgD,EAAI,IAAI2+C,EAAK3+C,IACXyF,EAAI64C,EACNt+C,EAAEhD,EAAIA,EAENshD,GADAt+C,EAAI0/C,EAAO1/C,EAAGC,EAAG2+C,EAAItB,EAAI,EAAG5kD,IACrB+M,EACPzI,EAAIgD,EAAEhD,EACN6pD,EAAU1L,GAIZtkD,EAAIynD,EAAGM,GACP7Z,EAAIrsC,EAAO,EACXmuD,EAAUA,QAA0B,IAAfvI,EAAGM,EAAK,GAE7BiI,EAAUvJ,EAAK,QACJ,IAANzmD,GAAgBgwD,KAAoB,IAAPvJ,GAAYA,KAAQt9C,EAAE8P,EAAI,EAAI,EAAI,IAChEjZ,EAAIkuC,GAAKluC,IAAMkuC,IAAa,IAAPuY,GAAYuJ,GAAkB,IAAPvJ,GAAyB,EAAbgB,EAAGM,EAAK,IAChEtB,KAAQt9C,EAAE8P,EAAI,EAAI,EAAI,IAE1BwuC,EAAG1nD,OAASgoD,EAERiI,EAGF,OAASvI,IAAKM,GAAMlmD,EAAO,GACzB4lD,EAAGM,GAAM,EACJA,MACD5hD,EACFshD,EAAGpT,QAAQ,IAMjB,IAAKv0C,EAAM2nD,EAAG1nD,QAAS0nD,EAAG3nD,EAAM,KAAMA,GAGtC,IAAKE,EAAI,EAAG2kC,EAAM,GAAI3kC,EAAIF,EAAKE,IAAK2kC,GAAO+f,EAASwC,OAAOO,EAAGznD,IAG9D,GAAIkwD,EAAO,CACT,GAAIpwD,EAAM,EACR,GAAe,IAAXinD,GAA4B,GAAXA,EAAc,CAEjC,IADA/mD,EAAe,IAAX+mD,EAAgB,EAAI,IACjBjnD,EAAKA,EAAME,EAAGF,IAAO6kC,GAAO,IAEnC,IAAK7kC,GADL2nD,EAAKZ,EAAYliB,EAAK9iC,EAAMklD,IACdhnD,QAAS0nD,EAAG3nD,EAAM,KAAMA,GAGtC,IAAKE,EAAI,EAAG2kC,EAAM,KAAM3kC,EAAIF,EAAKE,IAAK2kC,GAAO+f,EAASwC,OAAOO,EAAGznD,SAEhE2kC,EAAMA,EAAIuiB,OAAO,GAAK,IAAMviB,EAAIvgC,MAAM,GAI1CugC,EAAOA,GAAOx+B,EAAI,EAAI,IAAM,MAAQA,OAC/B,GAAIA,EAAI,EAAG,CAChB,OAASA,GAAIw+B,EAAM,IAAMA,EACzBA,EAAM,KAAOA,OAEb,KAAMx+B,EAAIrG,EAAK,IAAKqG,GAAKrG,EAAKqG,KAAOw+B,GAAO,SACnCx+B,EAAIrG,IAAK6kC,EAAMA,EAAIvgC,MAAM,EAAG+B,GAAK,IAAMw+B,EAAIvgC,MAAM+B,SAlE5Dw+B,EAAMurB,EAAQ,OAAS,IAsEzBvrB,GAAkB,IAAXoiB,EAAgB,KAAkB,GAAXA,EAAe,KAAkB,GAAXA,EAAe,KAAO,IAAMpiB,OA9GhFA,EAAMwrB,EAAkBhnD,GAiH1B,OAAOA,EAAE8P,EAAI,EAAI,IAAM0rB,EAAMA,EAK/B,SAAS0rB,EAASxwD,EAAKC,GACrB,GAAID,EAAIE,OAASD,EAEf,OADAD,EAAIE,OAASD,GACN,EAyDX,SAAS2Q,GAAItH,GACX,OAAO,IAAI7D,KAAK6D,GAAGsH,MAUrB,SAASw5B,GAAK9gC,GACZ,OAAO,IAAI7D,KAAK6D,GAAG8gC,OAWrB,SAASQ,GAAMthC,GACb,OAAO,IAAI7D,KAAK6D,GAAGshC,QAYrB,SAAS7qB,GAAIzW,EAAGC,GACd,OAAO,IAAI9D,KAAK6D,GAAG+/B,KAAK9/B,GAW1B,SAAS8gC,GAAK/gC,GACZ,OAAO,IAAI7D,KAAK6D,GAAG+gC,OAWrB,SAASM,GAAMrhC,GACb,OAAO,IAAI7D,KAAK6D,GAAGqhC,QAWrB,SAASR,GAAK7gC,GACZ,OAAO,IAAI7D,KAAK6D,GAAG6gC,OAWrB,SAASO,GAAMphC,GACb,OAAO,IAAI7D,KAAK6D,GAAGohC,QA6BrB,SAASx6B,GAAM3G,EAAGD,GAChBC,EAAI,IAAI9D,KAAK8D,GACbD,EAAI,IAAI7D,KAAK6D,GACb,IAAI2I,EACF+1C,EAAKviD,KAAKu/C,UACV4B,EAAKnhD,KAAKw/C,SACVgG,EAAMjD,EAAK,EAkCb,OA/BKz+C,EAAE6P,GAAM9P,EAAE8P,EAIH7P,EAAEwF,GAAMzF,EAAEyF,GAKVzF,EAAEyF,GAAKxF,EAAEu/C,UACnB72C,EAAI3I,EAAE8P,EAAI,EAAIuxC,EAAMllD,KAAMuiD,EAAIpB,GAAM,IAAInhD,KAAK,IAC3C2T,EAAI7P,EAAE6P,GAGE7P,EAAEwF,GAAKzF,EAAEw/C,UACnB72C,EAAI04C,EAAMllD,KAAMwlD,EAAK,GAAG5C,MAAM,KAC5BjvC,EAAI7P,EAAE6P,EAGC9P,EAAE8P,EAAI,GACf3T,KAAKu/C,UAAYiG,EACjBxlD,KAAKw/C,SAAW,EAChBhzC,EAAIxM,KAAK0kC,KAAK6e,EAAOz/C,EAAGD,EAAG2hD,EAAK,IAChC3hD,EAAIqhD,EAAMllD,KAAMwlD,EAAK,GACrBxlD,KAAKu/C,UAAYgD,EACjBviD,KAAKw/C,SAAW2B,EAChB30C,EAAI1I,EAAE6P,EAAI,EAAInH,EAAEq3B,MAAMhgC,GAAK2I,EAAEo3B,KAAK//B,IAElC2I,EAAIxM,KAAK0kC,KAAK6e,EAAOz/C,EAAGD,EAAG2hD,EAAK,KAvBhCh5C,EAAI04C,EAAMllD,KAAMwlD,EAAK,GAAG5C,MAAM/+C,EAAE8P,EAAI,EAAI,IAAO,MAC7CA,EAAI7P,EAAE6P,EALRnH,EAAI,IAAIxM,KAAKulC,KA8BR/4B,EAWT,SAASy2C,GAAKp/C,GACZ,OAAO,IAAI7D,KAAK6D,GAAGo/C,OAUrB,SAAStgC,GAAK9e,GACZ,OAAOi+C,EAASj+C,EAAI,IAAI7D,KAAK6D,GAAIA,EAAEhD,EAAI,EAAG,GAsB5C,SAASirD,GAAOxsD,GACd,IAAKA,GAAsB,iBAARA,EAAkB,MAAM6hC,MAAM6e,EAAe,mBAChE,IAAItlD,EAAGgD,EAAGkE,EACRmqD,GAA+B,IAAjBzsD,EAAI2sC,SAClB+f,EAAK,CACH,YAAa,EAAG7M,EAChB,WAAY,EAAG,EACf,YAAaD,EAAW,EACxB,WAAY,EAAGA,EACf,OAAQ,EAAGA,EACX,QAASA,EAAW,EACpB,SAAU,EAAG,GAGjB,IAAKxkD,EAAI,EAAGA,EAAIsxD,EAAGvxD,OAAQC,GAAK,EAE9B,GADIgD,EAAIsuD,EAAGtxD,GAAIqxD,IAAa/rD,KAAKtC,GAAK4hD,EAAS5hD,SAC1B,KAAhBkE,EAAItC,EAAI5B,IAAgB,CAC3B,KAAI0iD,EAAUx+C,KAAOA,GAAKA,GAAKoqD,EAAGtxD,EAAI,IAAMkH,GAAKoqD,EAAGtxD,EAAI,IACnD,MAAMymC,MAAM8e,EAAkBviD,EAAI,KAAOkE,GADc5B,KAAKtC,GAAKkE,EAM1E,GADIlE,EAAI,SAAUquD,IAAa/rD,KAAKtC,GAAK4hD,EAAS5hD,SAC7B,KAAhBkE,EAAItC,EAAI5B,IAAgB,CAC3B,IAAU,IAANkE,IAAoB,IAANA,GAAqB,IAANA,GAAiB,IAANA,EAY1C,MAAMu/B,MAAM8e,EAAkBviD,EAAI,KAAOkE,GAXzC,GAAIA,EAAG,CACL,GAAqB,oBAAVk+C,SAAyBA,SACjCA,OAAOmM,kBAAmBnM,OAAOoM,YAGlC,MAAM/qB,MAAMgf,GAFZngD,KAAKtC,IAAK,OAKZsC,KAAKtC,IAAK,EAOhB,OAAOsC,KAWT,SAASsjC,GAAIz/B,GACX,OAAO,IAAI7D,KAAK6D,GAAGy/B,MAWrB,SAAST,GAAKh/B,GACZ,OAAO,IAAI7D,KAAK6D,GAAGg/B,OAuMrB,SAAS+gB,GAAI//C,EAAGC,GACd,OAAO,IAAI9D,KAAK6D,GAAG+/C,IAAI9/C,GAWzB,SAASg/B,GAAIj/B,GACX,OAAO,IAAI7D,KAAK6D,GAAGi/B,MAUrB,SAASrgB,GAAM5e,GACb,OAAOi+C,EAASj+C,EAAI,IAAI7D,KAAK6D,GAAIA,EAAEhD,EAAI,EAAG,GAa5C,SAASsrD,KACP,IAAIzxD,EAAG+E,EACLqL,EAAI,IAAI9K,KAAK,GAIf,IAFA+/C,GAAW,EAENrlD,EAAI,EAAGA,EAAIslC,UAAUvlC,QAExB,IADAgF,EAAI,IAAIO,KAAKggC,UAAUtlC,OAChB4O,EAMIwB,EAAExB,IACXwB,EAAIA,EAAE84B,KAAKnkC,EAAEmjD,MAAMnjD,SAPX,CACR,GAAIA,EAAEkU,EAEJ,OADAosC,GAAW,EACJ,IAAI//C,KAAK,KAElB8K,EAAIrL,EAQR,OAFAsgD,GAAW,EAEJj1C,EAAEf,OASX,SAASqiD,GAAkB9sD,GACzB,OAAOA,aAAey/C,GAAWz/C,GAAoB,qBAAbA,EAAIK,OAA+B,EAW7E,SAAS0lD,GAAGxhD,GACV,OAAO,IAAI7D,KAAK6D,GAAGwhD,KAcrB,SAAShiB,GAAIx/B,EAAGC,GACd,OAAO,IAAI9D,KAAK6D,GAAGw/B,IAAIv/B,GAWzB,SAASuoD,GAAKxoD,GACZ,OAAO,IAAI7D,KAAK6D,GAAGw/B,IAAI,GAWzB,SAASipB,GAAMzoD,GACb,OAAO,IAAI7D,KAAK6D,GAAGw/B,IAAI,IAUzB,SAAS3a,KACP,OAAOuiC,EAASjrD,KAAMggC,UAAW,MAUnC,SAASxX,KACP,OAAOyiC,EAASjrD,KAAMggC,UAAW,MAYnC,SAAS+mB,GAAIljD,EAAGC,GACd,OAAO,IAAI9D,KAAK6D,GAAGkjD,IAAIjjD,GAYzB,SAAS4jD,GAAI7jD,EAAGC,GACd,OAAO,IAAI9D,KAAK6D,GAAG6jD,IAAI5jD,GAYzB,SAAS8O,GAAI/O,EAAGC,GACd,OAAO,IAAI9D,KAAK6D,GAAG+O,IAAI9O,GAYzB,SAASyoD,GAAO9J,GACd,IAAIn5C,EAAGzI,EAAG+nC,EAAGnpC,EACX/E,EAAI,EACJ8R,EAAI,IAAIxM,KAAK,GACbshD,EAAK,GAOP,QALW,IAAPmB,EAAeA,EAAKziD,KAAKu/C,UACxB0B,EAAWwB,EAAI,EAAGtD,GAEvBvW,EAAInjC,KAAKkd,KAAK8/B,EAn6IH,GAq6INziD,KAAK8/C,OAIH,GAAIA,OAAOmM,gBAGhB,IAFA3iD,EAAIw2C,OAAOmM,gBAAgB,IAAI1+C,YAAYq7B,IAEpCluC,EAAIkuC,IACTnpC,EAAI6J,EAAE5O,KAIG,MACP4O,EAAE5O,GAAKolD,OAAOmM,gBAAgB,IAAI1+C,YAAY,IAAI,GAKlD+zC,EAAG5mD,KAAO+E,EAAI,QAKb,KAAIqgD,OAAOoM,YAwBhB,MAAM/qB,MAAMgf,GAnBZ,IAFA72C,EAAIw2C,OAAOoM,YAAYtjB,GAAK,GAErBluC,EAAIkuC,IAGTnpC,EAAI6J,EAAE5O,IAAM4O,EAAE5O,EAAI,IAAM,IAAM4O,EAAE5O,EAAI,IAAM,MAAmB,IAAX4O,EAAE5O,EAAI,KAAc,MAG7D,MACPolD,OAAOoM,YAAY,GAAGM,KAAKljD,EAAG5O,IAK9B4mD,EAAG9iD,KAAKiB,EAAI,KACZ/E,GAAK,GAITA,EAAIkuC,EAAI,OA5CR,KAAOluC,EAAIkuC,GAAI0Y,EAAG5mD,KAAuB,IAAhB+K,KAAK8mD,SAAiB,EA2DjD,IATA9J,GAx9IW,GAu9IX7Z,EAAI0Y,IAAK5mD,KAIA+nD,IACPhjD,EAAI4gD,EAAQ,GA59IH,EA49IkBoC,GAC3BnB,EAAG5mD,IAAMkuC,EAAInpC,EAAI,GAAKA,GAIP,IAAV6hD,EAAG5mD,GAAUA,IAAK4mD,EAAG1sC,MAG5B,GAAIla,EAAI,EACNmG,EAAI,EACJygD,EAAK,CAAC,OACD,CAIL,IAHAzgD,GAAK,EAGY,IAAVygD,EAAG,GAAUzgD,GA3+IX,EA2+I0BygD,EAAGuF,QAGtC,IAAKje,EAAI,EAAGnpC,EAAI6hD,EAAG,GAAI7hD,GAAK,GAAIA,GAAK,GAAImpC,IAGrCA,EAj/IK,IAi/IS/nC,GAj/IT,EAi/IyB+nC,GAMpC,OAHAp8B,EAAE3L,EAAIA,EACN2L,EAAElD,EAAIg4C,EAEC90C,EAYT,SAAS9G,GAAM7B,GACb,OAAOi+C,EAASj+C,EAAI,IAAI7D,KAAK6D,GAAIA,EAAEhD,EAAI,EAAGb,KAAKw/C,UAejD,SAAS+K,GAAK1mD,GAEZ,OADAA,EAAI,IAAI7D,KAAK6D,IACJyF,EAAKzF,EAAEyF,EAAE,GAAKzF,EAAE8P,EAAI,EAAI9P,EAAE8P,EAAK9P,EAAE8P,GAAK4xB,IAWjD,SAAS9B,GAAI5/B,GACX,OAAO,IAAI7D,KAAK6D,GAAG4/B,MAWrB,SAASV,GAAKl/B,GACZ,OAAO,IAAI7D,KAAK6D,GAAGk/B,OAWrB,SAASh5B,GAAKlG,GACZ,OAAO,IAAI7D,KAAK6D,GAAGkG,OAYrB,SAAS48C,GAAI9iD,EAAGC,GACd,OAAO,IAAI9D,KAAK6D,GAAG8iD,IAAI7iD,GAWzB,SAAS2jD,GAAI5jD,GACX,OAAO,IAAI7D,KAAK6D,GAAG4jD,MAWrB,SAAS3C,GAAKjhD,GACZ,OAAO,IAAI7D,KAAK6D,GAAGihD,OAUrB,SAASoE,GAAMrlD,GACb,OAAOi+C,EAASj+C,EAAI,IAAI7D,KAAK6D,GAAIA,EAAEhD,EAAI,EAAG,IAK5Ck+C,EAllBA,SAAS0N,EAAMntD,GACb,IAAI5E,EAAGgD,EAAGsuD,EASV,SAASjN,EAAQn9C,GACf,IAAIf,EAAGnG,EAAGoQ,EACRjH,EAAI7D,KAGN,KAAM6D,aAAak7C,GAAU,OAAO,IAAIA,EAAQn9C,GAOhD,GAHAiC,EAAEtG,YAAcwhD,EAGZn9C,aAAam9C,EAuBf,OAtBAl7C,EAAE8P,EAAI/R,EAAE+R,OAEJosC,GACGn+C,EAAE0H,GAAK1H,EAAEf,EAAIk+C,EAAQc,MAGxBh8C,EAAEhD,EAAI0kC,IACN1hC,EAAEyF,EAAI,MACG1H,EAAEf,EAAIk+C,EAAQa,MAGvB/7C,EAAEhD,EAAI,EACNgD,EAAEyF,EAAI,CAAC,KAEPzF,EAAEhD,EAAIe,EAAEf,EACRgD,EAAEyF,EAAI1H,EAAE0H,EAAExK,UAGZ+E,EAAEhD,EAAIe,EAAEf,EACRgD,EAAEyF,EAAI1H,EAAE0H,EAAI1H,EAAE0H,EAAExK,QAAU8C,EAAE0H,IAQhC,GAAU,WAFVwB,SAAWlJ,GAES,CAClB,GAAU,IAANA,EAIF,OAHAiC,EAAE8P,EAAI,EAAI/R,EAAI,GAAK,EAAI,EACvBiC,EAAEhD,EAAI,OACNgD,EAAEyF,EAAI,CAAC,IAYT,GARI1H,EAAI,GACNA,GAAKA,EACLiC,EAAE8P,GAAK,GAEP9P,EAAE8P,EAAI,EAIJ/R,MAAQA,GAAKA,EAAI,IAAK,CACxB,IAAKf,EAAI,EAAGnG,EAAIkH,EAAGlH,GAAK,GAAIA,GAAK,GAAImG,IAkBrC,YAhBIk/C,EACEl/C,EAAIk+C,EAAQc,MACdh8C,EAAEhD,EAAI0kC,IACN1hC,EAAEyF,EAAI,MACGzI,EAAIk+C,EAAQa,MACrB/7C,EAAEhD,EAAI,EACNgD,EAAEyF,EAAI,CAAC,KAEPzF,EAAEhD,EAAIA,EACNgD,EAAEyF,EAAI,CAAC1H,KAGTiC,EAAEhD,EAAIA,EACNgD,EAAEyF,EAAI,CAAC1H,KAMJ,OAAQ,EAAJA,GAAU,GACdA,IAAGiC,EAAE8P,EAAI4xB,KACd1hC,EAAEhD,EAAI0kC,SACN1hC,EAAEyF,EAAI,OAIDgiD,EAAaznD,EAAGjC,EAAElC,YAEpB,GAAU,WAANoL,EACT,MAAMq2B,MAAM8e,EAAkBr+C,GAahC,OAT8B,MAAzBlH,EAAIkH,EAAE4pD,WAAW,KACpB5pD,EAAIA,EAAE9C,MAAM,GACZ+E,EAAE8P,GAAK,IAGG,KAANjZ,IAAUkH,EAAIA,EAAE9C,MAAM,IAC1B+E,EAAE8P,EAAI,GAGD8sC,EAAU7gD,KAAKgC,GAAK0pD,EAAaznD,EAAGjC,GAAK6pD,EAAW5nD,EAAGjC,GA0DhE,GAvDAm9C,EAAQ9iD,UAAY4kD,EAEpB9B,EAAQ2N,SAAW,EACnB3N,EAAQ4N,WAAa,EACrB5N,EAAQ6N,WAAa,EACrB7N,EAAQ8N,YAAc,EACtB9N,EAAQ+N,cAAgB,EACxB/N,EAAQgO,gBAAkB,EAC1BhO,EAAQiO,gBAAkB,EAC1BjO,EAAQkO,gBAAkB,EAC1BlO,EAAQmO,iBAAmB,EAC3BnO,EAAQoO,OAAS,EAEjBpO,EAAQ+M,OAAS/M,EAAQl0B,IAAMihC,GAC/B/M,EAAQ0N,MAAQA,EAChB1N,EAAQ0B,UAAY2L,GAEpBrN,EAAQ5zC,IAAMA,GACd4zC,EAAQpa,KAAOA,GACfoa,EAAQ5Z,MAAQA,GAChB4Z,EAAQzkC,IAAMA,GACdykC,EAAQna,KAAOA,GACfma,EAAQ7Z,MAAQA,GAChB6Z,EAAQra,KAAOA,GACfqa,EAAQ9Z,MAAQA,GAChB8Z,EAAQt0C,MAAQA,GAChBs0C,EAAQkE,KAAOA,GACflE,EAAQp8B,KAAOA,GACfo8B,EAAQzb,IAAMA,GACdyb,EAAQlc,KAAOA,GACfkc,EAAQ6E,IAAMA,GACd7E,EAAQjc,IAAMA,GACdic,EAAQt8B,MAAQA,GAChBs8B,EAAQoN,MAAQA,GAChBpN,EAAQsG,GAAKA,GACbtG,EAAQ1b,IAAMA,GACd0b,EAAQuN,MAAQA,GAChBvN,EAAQsN,KAAOA,GACftN,EAAQr2B,IAAMA,GACdq2B,EAAQv2B,IAAMA,GACdu2B,EAAQgI,IAAMA,GACdhI,EAAQ2I,IAAMA,GACd3I,EAAQnsC,IAAMA,GACdmsC,EAAQwN,OAASA,GACjBxN,EAAQr5C,MAAQA,GAChBq5C,EAAQwL,KAAOA,GACfxL,EAAQtb,IAAMA,GACdsb,EAAQhc,KAAOA,GACfgc,EAAQh1C,KAAOA,GACfg1C,EAAQ4H,IAAMA,GACd5H,EAAQ0I,IAAMA,GACd1I,EAAQ+F,KAAOA,GACf/F,EAAQmK,MAAQA,QAEJ,IAAR5pD,IAAgBA,EAAM,IACtBA,IACmB,IAAjBA,EAAI2sC,SAEN,IADA+f,EAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,UAC5EtxD,EAAI,EAAGA,EAAIsxD,EAAGvxD,QAAc6E,EAAI7C,eAAeiB,EAAIsuD,EAAGtxD,QAAO4E,EAAI5B,GAAKsC,KAAKtC,IAMpF,OAFAqhD,EAAQ+M,OAAOxsD,GAERy/C,EAgaC0N,CAAMnN,IAEC,QAAIP,EAAQA,QAAUA,EAGvCM,EAAO,IAAIN,EAAQM,GACnB30C,EAAK,IAAIq0C,EAAQr0C,QAUd,KAFD,aACE,OAAOq0C,GACR,8BAnvJJ,I,sBCKD,IAAIqO,EAAWzxD,OAAOk6B,QAAU,SAAUx6B,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAS5U,UAAUtlC,GAAI,IAAK,IAAImB,KAAO+4C,EAAcj5C,OAAOM,UAAUQ,eAAeC,KAAKk4C,EAAQ/4C,KAAQR,EAAOQ,GAAO+4C,EAAO/4C,IAAY,OAAOR,GAEnPgyD,EAAiB,CACnB,IAAK,MACL,IAAK,MACL,KAAM,oBACN,IAAK,MACLt1B,EAAG,MACH,IAAK,MACL,IAAK,MACL,IAAK,sBACLzb,EAAG,MACH,IAAK,sBAEHgxC,EAAgB,CAClB,IAAU,OACV,IAAU,QACV,IAAK,IACL,KAAM,YACN,OAAQ,cACR,KAAM,eAGJC,EAAqB,SAA4BF,EAAgBC,GACnE,OAAOF,EAAS,GAAIC,EAAgBC,IAWtC9nB,EAAOC,QAAU,SAAUpG,GAmCzB,IAlCA,IAAImuB,EAAOxtB,UAAUvlC,OAAS,QAAsB0D,IAAjB6hC,UAAU,GAAmBA,UAAU,GAAK,GAC3EytB,EAAwBD,EAAKE,mBAC7BA,OAA+CvvD,IAA1BsvD,GAA8CA,EACnEE,EAAmBH,EAAKI,YACxBA,OAAmCzvD,IAArBwvD,EAAiCJ,EAAqBI,EAEpEE,EAAavvB,OAAOe,GACpBn2B,EAAS,GAET4kD,EAAUF,EAAYR,EAAS,GAAIC,GAAiBK,EAAqBN,EAAS,GAAIE,GAAiB,IACvGS,EAAapyD,OAAO4G,KAAKurD,GAMzBE,EAAQ,WACV,IAAIC,GAAmB,EACvBF,EAAWpsD,SAAQ,SAAU9F,EAAKijC,GAC5BmvB,GAGAJ,EAAWpzD,QAAUoB,EAAIpB,QAAUozD,EAAW/uD,MAAM,EAAGjD,EAAIpB,UAAYoB,IACzEqN,GAAU4kD,EAAQC,EAAWjvB,IAC7B+uB,EAAaA,EAAW/uD,MAAMjD,EAAIpB,OAAQozD,EAAWpzD,QACrDwzD,GAAmB,MAGlBA,IACH/kD,GAAU2kD,EAAW/uD,MAAM,EAAG,GAC9B+uD,EAAaA,EAAW/uD,MAAM,EAAG+uD,EAAWpzD,UAIzCozD,GACLG,IAEF,OAAO9kD,I,mBC9ET,OAuCA,SAAU05B,GAER,aAKA,IAGIie,EAAI,CACN,EAAK,EACL,EAAK,EACL,EAAK,GAGP,SAASqN,EAAYvuD,GAEnB,SAASwuD,IACP,IAAInpB,EAAO7D,MAAMitB,MAAMpuD,KAAMggC,WAC7BgF,EAAW,KAAIhlC,KAAW,KAAIL,EAC9BK,KAAY,MAAIglC,EAAY,MAC5BhlC,KAAc,QAAIglC,EAAc,QAQlC,SAASqpB,KAIT,OAHAA,EAAsBpyD,UAAYklC,MAAMllC,UACxCkyD,EAAiBlyD,UAAY,IAAIoyD,EAE1BF,EAGT,IAAIG,EAAiBC,EAAyB,eAAIL,EAAY,kBAC1DM,EAAmBD,EAA2B,iBAAIL,EAAY,oBAElE,SAASr4B,EAAOp2B,EAAGkU,GAKjB,OAHI7M,MAAMrH,EAAImhC,SAASnhC,EAAG,MACxBgvD,IAEKhvD,EAAIkU,EAGb,SAAS86C,IACP,MAAM,IAAID,EAGZ,IAAIp6C,EAAQ,SAASghB,EAAIC,GAEvB,IAOIq5B,EAPAjvD,EAAI,EAAG6J,EAAI,EAAGqK,EAAI,EAClB/R,EAAI,EAAGmC,EAAI,EAAGF,EAAI,EAAGC,EAAI,EAAG0/B,EAAI,EAEhCmrB,EAAI,EAAGC,EAAI,EACXC,EAAI,EAAGC,EAAI,EAEXC,EAAI,IAGR,GAAI35B,cAEG,QAAWj3B,IAAPk3B,EAGT1hB,GAFAlU,EAAI21B,IACJ9rB,EAAI+rB,QAGJ,cAAeD,GAEb,IAAK,SAEG,MAAOA,GAAM,MAAOA,GACtB31B,EAAI21B,EAAM,EACV9rB,EAAI8rB,EAAM,EACN,MAAOA,IACT31B,GAAK21B,EAAM,IACJ,KAAKA,GACd31B,EAAI21B,EAAG,GACH,KAAKA,IACP9rB,EAAI8rB,EAAG,KAETq5B,IAEF96C,EAAIlU,EAAI6J,EACR,MAEJ,IAAK,SAOD,GALI8rB,EAAK,IACPzhB,EAAIyhB,EACJA,GAAMA,GAGJA,EAAK,GAAM,EACb31B,EAAI21B,OACC,GAAIA,EAAK,EAAG,CAUjB,IARIA,GAAM,IAERA,GADAoO,EAAI/9B,KAAKmN,IAAI,GAAInN,KAAKgd,MAAM,EAAIhd,KAAK49B,IAAIjO,GAAM3vB,KAAK45C,QAO/CuP,GAAKG,GAAKD,GAAKC,GAAG,CAGvB,GAAI35B,KAFJs5B,GAAKC,EAAIE,IAAMD,EAAIE,IAEL,CACRF,EAAIE,GAAKC,GACXtvD,EAAIkvD,EAAIE,EACRvlD,EAAIslD,EAAIE,GACCA,EAAIF,GACbnvD,EAAIovD,EACJvlD,EAAIwlD,IAEJrvD,EAAIkvD,EACJrlD,EAAIslD,GAEN,MAIIx5B,EAAKs5B,GACPC,GAAKE,EACLD,GAAKE,IAELD,GAAKF,EACLG,GAAKF,GAGHA,EAAIG,GACNtvD,EAAIovD,EACJvlD,EAAIwlD,IAEJrvD,EAAIkvD,EACJrlD,EAAIslD,GAIVnvD,GAAK+jC,OACI18B,MAAMsuB,IAAOtuB,MAAMuuB,MAC5B/rB,EAAI7J,EAAI8lC,KAEV,MAEJ,IAAK,SAgDD,GA5CU,QAFVqpB,EAAIx5B,EAAGuO,MAAM,YAGX8qB,IAEW,MAATG,EAAED,IACJh7C,GAAK,EACLg7C,KACkB,MAATC,EAAED,IACXA,IAGEC,EAAEn0D,SAAWk0D,EAAI,EACnB5qD,EAAI8xB,EAAO+4B,EAAED,KAAMh7C,GACG,MAAbi7C,EAAED,EAAI,IAAuB,MAATC,EAAED,IAElB,MAATC,EAAED,KACJ/sD,EAAIi0B,EAAO+4B,EAAED,KAAMh7C,KAKb,KAHRg7C,IAGcC,EAAEn0D,QAAuB,MAAbm0D,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,MAC1F5qD,EAAI8xB,EAAO+4B,EAAED,GAAIh7C,GACjB7P,EAAI2B,KAAKmN,IAAI,GAAIg8C,EAAED,GAAGl0D,QACtBk0D,MAIW,MAATC,EAAED,IAA2B,MAAbC,EAAED,EAAI,IAAuB,MAATC,EAAED,IAA2B,MAAbC,EAAED,EAAI,MAC5D9qD,EAAIgyB,EAAO+4B,EAAED,EAAI,GAAIh7C,GACrB6vB,EAAI/9B,KAAKmN,IAAI,GAAIg8C,EAAED,EAAI,GAAGl0D,QAAU,EACpCk0D,GAAK,IAGe,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IACnC5qD,EAAI8xB,EAAO+4B,EAAED,GAAIh7C,GACjB7P,EAAI+xB,EAAO+4B,EAAED,EAAI,GAAI,GACrBA,GAAK,GACiB,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,KACnC/sD,EAAIi0B,EAAO+4B,EAAED,GAAIh7C,GACjB5P,EAAI8xB,EAAO+4B,EAAED,EAAI,GAAIh7C,GACrB7P,EAAI+xB,EAAO+4B,EAAED,EAAI,GAAI,GACrBA,GAAK,GAGHC,EAAEn0D,QAAUk0D,EAAG,CAEjBh7C,EACAlU,EAAIoE,GAFJyF,EAAIxF,EAAI0/B,GAEI5hC,EAAI4hC,EAAIz/B,EACpB,MAKN,QACE0qD,IAGN,GAAU,IAANnlD,EACF,MAAM,IAAIglD,EAGZzN,EAAK,EAAIltC,EAAI,GAAK,EAAI,EACtBktC,EAAK,EAAIp7C,KAAK0F,IAAI1L,GAClBohD,EAAK,EAAIp7C,KAAK0F,IAAI7B,IAgEpB,SAAS0lD,EAAI7lD,EAAGC,GAEd,IAAKD,EACH,OAAOC,EACT,IAAKA,EACH,OAAOD,EAET,OAAU,CAER,KADAA,GAAKC,GAEH,OAAOA,EAET,KADAA,GAAKD,GAEH,OAAOA,GAWb,SAASolD,EAASplD,EAAGC,GAEnB,KAAMpJ,gBAAgBuuD,GACpB,OAAO,IAAIA,EAASplD,EAAGC,GAGzBgL,EAAMjL,EAAGC,GAGPD,EADEolD,EAAiB,OACfS,EAAInO,EAAK,EAAGA,EAAK,GAEjB,EAGN7gD,KAAQ,EAAI6gD,EAAK,EACjB7gD,KAAQ,EAAI6gD,EAAK,EAAI13C,EACrBnJ,KAAQ,EAAI6gD,EAAK,EAAI13C,EAOvBolD,EAAiB,OAAI,EAErBA,EAAStyD,UAAY,CAEnB,EAAK,EACL,EAAK,EACL,EAAK,EAOL,IAAO,WAEL,OAAO,IAAIsyD,EAASvuD,KAAQ,EAAGA,KAAQ,IAQzC,IAAO,WAEL,OAAO,IAAIuuD,GAAUvuD,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,IAQtD,IAAO,SAASmJ,EAAGC,GAGjB,OADAgL,EAAMjL,EAAGC,GACF,IAAImlD,EACTvuD,KAAQ,EAAIA,KAAQ,EAAI6gD,EAAK,EAAIA,EAAK,EAAI7gD,KAAQ,EAAI6gD,EAAK,EAC3D7gD,KAAQ,EAAI6gD,EAAK,IASrB,IAAO,SAAS13C,EAAGC,GAGjB,OADAgL,EAAMjL,EAAGC,GACF,IAAImlD,EACTvuD,KAAQ,EAAIA,KAAQ,EAAI6gD,EAAK,EAAIA,EAAK,EAAI7gD,KAAQ,EAAI6gD,EAAK,EAC3D7gD,KAAQ,EAAI6gD,EAAK,IASrB,IAAO,SAAS13C,EAAGC,GAGjB,OADAgL,EAAMjL,EAAGC,GACF,IAAImlD,EACTvuD,KAAQ,EAAI6gD,EAAK,EAAI7gD,KAAQ,EAAI6gD,EAAK,EACtC7gD,KAAQ,EAAI6gD,EAAK,IASrB,IAAO,SAAS13C,EAAGC,GAGjB,OADAgL,EAAMjL,EAAGC,GACF,IAAImlD,EACTvuD,KAAQ,EAAI6gD,EAAK,EAAI7gD,KAAQ,EAAI6gD,EAAK,EACtC7gD,KAAQ,EAAI6gD,EAAK,IASrB,MAAS,WACP,OAAO,IAAI0N,EAASvuD,OAQtB,IAAO,SAASmJ,EAAGC,GAEjB,OAAItC,MAAM9G,KAAQ,IAAM8G,MAAM9G,KAAQ,GAC7B,IAAIuuD,EAAShpB,UAGZpnC,IAANgL,EACK,IAAIolD,EAASvuD,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,EAAG,IAGzDoU,EAAMjL,EAAGC,GACL,IAAMy3C,EAAK,GAAK,IAAM7gD,KAAQ,GAChCuuD,EAAS,EAAG,GAiBP,IAAIA,EACTvuD,KAAQ,GAAK6gD,EAAK,EAAI7gD,KAAQ,IAAM6gD,EAAK,EAAI7gD,KAAQ,GACrD6gD,EAAK,EAAI7gD,KAAQ,KASrB,IAAO,SAASmJ,EAAGC,GAMjB,OAJAgL,EAAMjL,EAAGC,GAIF,IAAImlD,EAASS,EAAInO,EAAK,EAAG7gD,KAAQ,GAAKgvD,EAAInO,EAAK,EAAG7gD,KAAQ,GAAI6gD,EAAK,EAAI7gD,KAAQ,IAQxF,IAAO,SAASmJ,EAAGC,GAMjB,OAJAgL,EAAMjL,EAAGC,GAIM,IAAXy3C,EAAK,GAAyB,IAAd7gD,KAAQ,EACnB,IAAIuuD,EAEN,IAAIA,EAAS1N,EAAK,EAAI7gD,KAAQ,EAAGgvD,EAAInO,EAAK,EAAG7gD,KAAQ,GAAKgvD,EAAInO,EAAK,EAAG7gD,KAAQ,KAQvF,KAAQ,SAASolC,GAIf,OAFAA,EAAS3/B,KAAKmN,IAAI,GAAIwyB,GAAU,GAE5Bt+B,MAAM9G,KAAQ,IAAM8G,MAAM9G,KAAQ,GAC7B,IAAIuuD,EAAShpB,KAEf,IAAIgpB,EAAS9oD,KAAKkd,KAAKyiB,EAASplC,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAIolC,IAQ7E,MAAS,SAASA,GAIhB,OAFAA,EAAS3/B,KAAKmN,IAAI,GAAIwyB,GAAU,GAE5Bt+B,MAAM9G,KAAQ,IAAM8G,MAAM9G,KAAQ,GAC7B,IAAIuuD,EAAShpB,KAEf,IAAIgpB,EAAS9oD,KAAKgd,MAAM2iB,EAASplC,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAIolC,IAQ9E,MAAS,SAASA,GAIhB,OAFAA,EAAS3/B,KAAKmN,IAAI,GAAIwyB,GAAU,GAE5Bt+B,MAAM9G,KAAQ,IAAM8G,MAAM9G,KAAQ,GAC7B,IAAIuuD,EAAShpB,KAEf,IAAIgpB,EAAS9oD,KAAKC,MAAM0/B,EAASplC,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAIolC,IAQ9E,QAAW,WAET,OAAO,IAAImpB,EAASvuD,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,IAQrD,IAAO,SAAS6J,GAEd,OAAIA,EAAI,EACC,IAAI0kD,EAAS9oD,KAAKmN,IAAI5S,KAAQ,EAAIA,KAAQ,GAAI6J,GAAIpE,KAAKmN,IAAI5S,KAAQ,GAAI6J,IAEvE,IAAI0kD,EAAS9oD,KAAKmN,IAAI5S,KAAQ,EAAIA,KAAQ,EAAG6J,GAAIpE,KAAKmN,IAAI5S,KAAQ,EAAG6J,KAShF,OAAU,SAASV,EAAGC,GAGpB,OADAgL,EAAMjL,EAAGC,GACFpJ,KAAQ,EAAIA,KAAQ,EAAI6gD,EAAK,GAAMA,EAAK,EAAIA,EAAK,EAAI7gD,KAAQ,GAQtE,QAAW,SAASmJ,EAAGC,GAErBgL,EAAMjL,EAAGC,GACT,IAAI0B,EAAK9K,KAAQ,EAAIA,KAAQ,EAAI6gD,EAAK,EAAIA,EAAK,EAAIA,EAAK,EAAI7gD,KAAQ,EACpE,OAAQ,EAAI8K,IAAMA,EAAI,IAGxB,SAAY,SAASmkD,GAInB,GAAInoD,MAAM9G,KAAQ,IAAM8G,MAAM9G,KAAQ,GACpC,OAAOA,KAGT,IAAIkvD,EAAOlvD,KAAU,MAAiB,cAItC,SAASmvD,EAAIhmD,GACX,OAAiB,IAAbA,EAAE1O,OACG,IAAI8zD,EAASplD,EAAE,IACjBgmD,EAAIhmD,EAAErK,MAAM,IAAa,UAAS,IAAEqK,EAAE,IAL/C8lD,EAAMA,GAAO,KAQb,IAAK,IAAIv0D,EAAI,EAAGA,EAAIw0D,EAAKz0D,OAAQC,IAAK,CACpC,IAAIwpC,EAAMirB,EAAID,EAAKpwD,MAAM,EAAGpE,EAAI,IAChC,GAAIwpC,EAAS,IAAElkC,KAAU,OAAU,MAAImpD,UAAY8F,EACjD,OAAO/qB,EAAS,IAAElkC,KAAQ,GAG9B,OAAOA,MAQT,UAAa,SAASmJ,EAAGC,GAGvB,OADAgL,EAAMjL,EAAGC,OACEy3C,EAAK,EAAI7gD,KAAQ,IAAQA,KAAQ,EAAI6gD,EAAK,GAAMA,EAAK,EAAI7gD,KAAQ,KAQ9E,QAAW,WAET,OAAOA,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAQzC,WAAc,SAASovD,GAErB,IAAIC,EAAOhwB,EAAM,GACb5/B,EAAIO,KAAQ,EACZsJ,EAAItJ,KAAQ,EAmBhB,OAlBIA,KAAQ,EAAI,IACdq/B,GAAO,KAGC,IAAN/1B,EACF+1B,GAAO5/B,GAGH2vD,IAAiBC,EAAQ5pD,KAAKgd,MAAMhjB,EAAI6J,IAAM,IAChD+1B,GAAOgwB,EACPhwB,GAAO,IACP5/B,GAAK6J,GAGP+1B,GAAO5/B,EACP4/B,GAAO,IACPA,GAAO/1B,GAEF+1B,GAQT,QAAW,SAAS+vB,GAElB,IAAIC,EAAOhwB,EAAM,GACb5/B,EAAIO,KAAQ,EACZsJ,EAAItJ,KAAQ,EAoBhB,OAnBIA,KAAQ,EAAI,IACdq/B,GAAO,KAGC,IAAN/1B,EACF+1B,GAAO5/B,GAGH2vD,IAAiBC,EAAQ5pD,KAAKgd,MAAMhjB,EAAI6J,IAAM,IAChD+1B,GAAOgwB,EACP5vD,GAAK6J,GAGP+1B,GAAO,UACPA,GAAO5/B,EACP4/B,GAAO,KACPA,GAAO/1B,EACP+1B,GAAO,KAEFA,GAQT,YAAe,WAEb,IAAIv0B,EACA3B,EAAInJ,KAAQ,EACZoJ,EAAIpJ,KAAQ,EACZy1B,EAAM,GAEV,GAAI3uB,MAAMqC,IAAMrC,MAAMsC,GACpB,OAAOqsB,EAGT,GACEA,EAAIj3B,KAAKiH,KAAKgd,MAAMtZ,EAAIC,IACxB0B,EAAI3B,EAAIC,EACRD,EAAIC,EACJA,EAAI0B,QACS,IAAN3B,GAET,OAAOssB,GAQT,SAAY,SAAS65B,GAEnB,IAAI9tD,EACAutD,EAAI/uD,KAAQ,EACZ8uD,EAAI9uD,KAAQ,EAEhB,GAAI8G,MAAMioD,IAAMjoD,MAAMgoD,GACpB,MAAO,MAGJP,EAAiB,SAEpBQ,GADAvtD,EAAIwtD,EAAID,EAAGD,GAEXA,GAAKttD,GAGP8tD,EAAMA,GAAO,GAEb,IAAIC,EA/fR,SAAkB9vD,EAAG6J,GAEnB,KAAOA,EAAI,GAAM,EACfA,GAAK,GAGP,KAAOA,EAAI,GAAM,EACfA,GAAK,GAGP,GAAU,IAANA,EACF,OAAO,EAUT,IAHA,IAAIygD,EAAM,GAAKzgD,EACXwB,EAAI,EAEO,IAARi/C,EAAWj/C,IAGhB,GAFAi/C,EAAY,GAANA,EAAWzgD,EAEbwB,EAzPY,IA0Pd,OAAO,EAEX,OAAOA,EAoeQ0kD,CAAST,EAAGD,GACrBW,EAjeR,SAAoBhwD,EAAG6J,EAAG9O,GAKxB,IAHA,IAAIk1D,EAAO,EACPC,EA/CN,SAAgBvmD,EAAGvI,EAAGgJ,GAGpB,IADA,IAAI2C,EAAI,EACD3L,EAAI,EAAGuI,EAAKA,EAAIA,EAAKS,EAAGhJ,IAAM,EAE3B,EAAJA,IACF2L,EAAKA,EAAIpD,EAAKS,GAGlB,OAAO2C,EAsCIojD,CAAO,GAAIp1D,EAAK8O,GAElBwB,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAG5B,GAAI4kD,IAASC,EACX,OAAO7kD,EAET4kD,EAAc,GAAPA,EAAYpmD,EACnBqmD,EAAc,GAAPA,EAAYrmD,EAErB,OAAO,EAmdQumD,CAAWd,EAAGD,EAAGS,GAE1BlwB,GAAqB,IAAfr/B,KAAQ,EAAW,IAAM,GAUnC,GARAq/B,GAAO0vB,EAAID,EAAI,EAEfC,GAAKD,GACLC,GAAK,MAGH1vB,GAAO,KAELkwB,EAAQ,CAEV,IAAK,IAAI70D,EAAI+0D,EAAQ/0D,KACnB2kC,GAAO0vB,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAGP,IADA1vB,GAAO,IACE3kC,EAAI60D,EAAQ70D,KACnB2kC,GAAO0vB,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAEP1vB,GAAO,SAEP,IAAS3kC,EAAI40D,EAAKP,GAAKr0D,KACrB2kC,GAAO0vB,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAGT,OAAO1vB,SAOR,KAFU,EAAF,WACP,OAAOkvB,GACR,QAFM,OAEN,aAhxBL,I,eCTA,IAAIn3C,EAAM,EAAQ,MAElBouB,EAAOC,QAAU,CACfwD,MAAO7xB,EAAI6xB,MACX6mB,KAAM,EAAQ,MACdC,IAAK,EAAQ,MACbhqB,QAAS3uB,EAAI2uB,U,eCpCf,IAAIzpB,EAAI,EAAQ,MAEhBkpB,EAAOC,QAEP,SAAoBjkC,GAClB,IAEIwuD,EAFA1pB,EAAU,GACV2pB,EAAQ,GAGZ,SAAS1pB,EAAI3kC,GACP0a,EAAE0I,IAAIshB,EAAS1kC,KACnB0kC,EAAQ1kC,IAAK,EACbouD,EAAKxxD,KAAKoD,GACV0a,EAAEuzB,KAAKruC,EAAEiwC,WAAW7vC,GAAI2kC,GACxBjqB,EAAEuzB,KAAKruC,EAAE+zC,aAAa3zC,GAAI2kC,IAW5B,OARAjqB,EAAEuzB,KAAKruC,EAAEE,SAAS,SAASE,GACzBouD,EAAO,GACPzpB,EAAI3kC,GACAouD,EAAKv1D,QACPw1D,EAAMzxD,KAAKwxD,MAIRC,I,eCzBT,IAAI3zC,EAAI,EAAQ,MA+BhB,SAAS4zC,EAAM1uD,EAAGI,EAAG00C,EAAWhQ,EAAS6pB,EAAYpf,GAC9Cz0B,EAAE0I,IAAIshB,EAAS1kC,KAClB0kC,EAAQ1kC,IAAK,EAER00C,GAAavF,EAAIvyC,KAAKoD,GAC3B0a,EAAEuzB,KAAKsgB,EAAWvuD,IAAI,SAASmC,GAC7BmsD,EAAM1uD,EAAGuC,EAAGuyC,EAAWhQ,EAAS6pB,EAAYpf,MAE1CuF,GAAavF,EAAIvyC,KAAKoD,IArC9B4jC,EAAOC,QAUP,SAAajkC,EAAGmwC,EAAItG,GACb/uB,EAAE1e,QAAQ+zC,KACbA,EAAK,CAACA,IAGR,IAAIwe,GAAc3uD,EAAE4uD,aAAe5uD,EAAEiwC,WAAajwC,EAAEo8C,WAAW1D,KAAK14C,GAEhEuvC,EAAM,GACNzK,EAAU,GAQd,OAPAhqB,EAAEuzB,KAAK8B,GAAI,SAAS/vC,GAClB,IAAKJ,EAAE4wC,QAAQxwC,GACb,MAAM,IAAIu/B,MAAM,6BAA+Bv/B,GAGjDsuD,EAAM1uD,EAAGI,EAAa,SAAVypC,EAAkB/E,EAAS6pB,EAAYpf,MAE9CA,I,eC5BT,IAAIsf,EAAW,EAAQ,MACnB/zC,EAAI,EAAQ,MAEhBkpB,EAAOC,QAEP,SAAqBjkC,EAAG8uD,EAAYC,GAClC,OAAOj0C,EAAE5P,UAAUlL,EAAEE,SAAS,SAASqvC,EAAKnvC,GAC1CmvC,EAAInvC,GAAKyuD,EAAS7uD,EAAGI,EAAG0uD,EAAYC,KACnC,M,eCRL,IAAIj0C,EAAI,EAAQ,MACZk0C,EAAgB,EAAQ,MAE5BhrB,EAAOC,QAIP,SAAkBjkC,EAAGozC,EAAQvO,EAAUoqB,GACrC,OAKF,SAAqBjvD,EAAGozC,EAAQvO,EAAUoqB,GACxC,IAEI7uD,EAAG+yC,EAFH1a,EAAU,GACVy2B,EAAK,IAAIF,EAGTG,EAAkB,SAAS1vD,GAC7B,IAAI8C,EAAI9C,EAAKW,IAAMA,EAAIX,EAAKW,EAAIX,EAAK8C,EACjC6mC,EAAS3Q,EAAQl2B,GACjBqiC,EAASC,EAASplC,GAClB2vD,EAAWjc,EAAOic,SAAWxqB,EAEjC,GAAIA,EAAS,EACX,MAAM,IAAIjF,MAAM,4DACelgC,EAAO,YAAcmlC,GAGlDwqB,EAAWhmB,EAAOgmB,WACpBhmB,EAAOgmB,SAAWA,EAClBhmB,EAAOimB,YAAcjvD,EACrB8uD,EAAGI,SAAS/sD,EAAG6sD,KAUnB,IANApvD,EAAEE,QAAQC,SAAQ,SAASC,GACzB,IAAIgvD,EAAWhvD,IAAMgzC,EAAS,EAAIjvC,OAAOuoC,kBACzCjU,EAAQr4B,GAAK,CAAEgvD,SAAUA,GACzBF,EAAGp2C,IAAI1Y,EAAGgvD,MAGLF,EAAGhvC,OAAS,IACjB9f,EAAI8uD,EAAGK,aACPpc,EAAS1a,EAAQr4B,IACNgvD,WAAajrD,OAAOuoC,oBAI/BuiB,EAAO7uD,GAAGD,QAAQgvD,GAGpB,OAAO12B,EA5CA+2B,CAAYxvD,EAAG88B,OAAOsW,GAC3BvO,GAAY4qB,EACZR,GAAU,SAAS7uD,GAAK,OAAOJ,EAAE6N,SAASzN,MAL9C,IAAIqvD,EAAsB30C,EAAEmuB,SAAS,I,eCLrC,IAAInuB,EAAI,EAAQ,MACZ40C,EAAS,EAAQ,MAErB1rB,EAAOC,QAEP,SAAoBjkC,GAClB,OAAO8a,EAAEnP,OAAO+jD,EAAO1vD,IAAI,SAASwuD,GAClC,OAAOA,EAAKv1D,OAAS,GAAsB,IAAhBu1D,EAAKv1D,QAAgB+G,EAAEg8C,QAAQwS,EAAK,GAAIA,EAAK,S,eCP5E,IAAI1zC,EAAI,EAAQ,MAEhBkpB,EAAOC,QAIP,SAAuBjkC,EAAG6kC,EAAUoqB,GAClC,OAKF,SAA0BjvD,EAAG6kC,EAAUoqB,GACrC,IAAIx2B,EAAU,GACVv4B,EAAQF,EAAEE,QAkCd,OAhCAA,EAAMC,SAAQ,SAASC,GACrBq4B,EAAQr4B,GAAK,GACbq4B,EAAQr4B,GAAGA,GAAK,CAAEgvD,SAAU,GAC5BlvD,EAAMC,SAAQ,SAASoC,GACjBnC,IAAMmC,IACRk2B,EAAQr4B,GAAGmC,GAAK,CAAE6sD,SAAUjrD,OAAOuoC,uBAGvCuiB,EAAO7uD,GAAGD,SAAQ,SAASV,GACzB,IAAI8C,EAAI9C,EAAKW,IAAMA,EAAIX,EAAK8C,EAAI9C,EAAKW,EACjC0H,EAAI+8B,EAASplC,GACjBg5B,EAAQr4B,GAAGmC,GAAK,CAAE6sD,SAAUtnD,EAAGunD,YAAajvD,SAIhDF,EAAMC,SAAQ,SAASinC,GACrB,IAAIuoB,EAAOl3B,EAAQ2O,GACnBlnC,EAAMC,SAAQ,SAASjH,GACrB,IAAI02D,EAAOn3B,EAAQv/B,GACnBgH,EAAMC,SAAQ,SAASwnB,GACrB,IAAIkoC,EAAKD,EAAKxoB,GACV0oB,EAAKH,EAAKhoC,GACVooC,EAAKH,EAAKjoC,GACVqoC,EAAcH,EAAGT,SAAWU,EAAGV,SAC/BY,EAAcD,EAAGX,WACnBW,EAAGX,SAAWY,EACdD,EAAGV,YAAcS,EAAGT,sBAMrB52B,EAzCAw3B,CAAiBjwD,EACtB6kC,GAAY4qB,EACZR,GAAU,SAAS7uD,GAAK,OAAOJ,EAAE6N,SAASzN,MAL9C,IAAIqvD,EAAsB30C,EAAEmuB,SAAS,I,eCJrCjF,EAAOC,QAAU,CACfisB,WAAY,EAAQ,MACpBrB,SAAU,EAAQ,MAClBsB,YAAa,EAAQ,MACrBC,WAAY,EAAQ,MACpBC,cAAe,EAAQ,MACvBC,UAAW,EAAQ,MACnBxb,UAAW,EAAQ,MACnBmG,SAAU,EAAQ,MAClBsV,KAAM,EAAQ,KACdb,OAAQ,EAAQ,MAChBc,QAAS,EAAQ,Q,eCXnB,IAAIA,EAAU,EAAQ,MAEtBxsB,EAAOC,QAEP,SAAmBjkC,GACjB,IACEwwD,EAAQxwD,GACR,MAAOX,GACP,GAAIA,aAAamxD,EAAQC,eACvB,OAAO,EAET,MAAMpxD,EAER,OAAO,I,eCbT,IAAI0lC,EAAM,EAAQ,MAElBf,EAAOC,QAEP,SAAmBjkC,EAAGmwC,GACpB,OAAOpL,EAAI/kC,EAAGmwC,EAAI,U,eCLpB,IAAIpL,EAAM,EAAQ,MAElBf,EAAOC,QAEP,SAAkBjkC,EAAGmwC,GACnB,OAAOpL,EAAI/kC,EAAGmwC,EAAI,S,cCLpB,IAAIr1B,EAAI,EAAQ,MACZ2sB,EAAQ,EAAQ,KAChBunB,EAAgB,EAAQ,MAE5BhrB,EAAOC,QAEP,SAAcjkC,EAAG8uD,GACf,IAGI1uD,EAHAsH,EAAS,IAAI+/B,EACbipB,EAAU,GACVxB,EAAK,IAAIF,EAGb,SAASG,EAAgB1vD,GACvB,IAAI8C,EAAI9C,EAAKW,IAAMA,EAAIX,EAAK8C,EAAI9C,EAAKW,EACjCuwD,EAAMzB,EAAG0B,SAASruD,GACtB,QAAY5F,IAARg0D,EAAmB,CACrB,IAAIroB,EAAawmB,EAAWrvD,GACxB6oC,EAAaqoB,IACfD,EAAQnuD,GAAKnC,EACb8uD,EAAGI,SAAS/sD,EAAG+lC,KAKrB,GAAsB,IAAlBtoC,EAAEgoC,YACJ,OAAOtgC,EAGToT,EAAEuzB,KAAKruC,EAAEE,SAAS,SAASE,GACzB8uD,EAAGp2C,IAAI1Y,EAAG+D,OAAOuoC,mBACjBhlC,EAAO2iB,QAAQjqB,MAIjB8uD,EAAGI,SAAStvD,EAAEE,QAAQ,GAAI,GAG1B,IADA,IAAI2wD,GAAO,EACJ3B,EAAGhvC,OAAS,GAAG,CAEpB,GADA9f,EAAI8uD,EAAGK,YACHz0C,EAAE0I,IAAIktC,EAAStwD,GACjBsH,EAAOkjB,QAAQxqB,EAAGswD,EAAQtwD,QACrB,IAAIywD,EACT,MAAM,IAAIlxB,MAAM,iCAAmC3/B,GAEnD6wD,GAAO,EAGT7wD,EAAEq6C,UAAUj6C,GAAGD,QAAQgvD,GAGzB,OAAOznD,I,eClDT,IAAIoT,EAAI,EAAQ,MAEhBkpB,EAAOC,QAEP,SAAgBjkC,GACd,IAAIs9B,EAAQ,EACR5H,EAAQ,GACRoP,EAAU,GACVrM,EAAU,GAEd,SAASsM,EAAI3kC,GACX,IAAIkwB,EAAQwU,EAAQ1kC,GAAK,CACvB0wD,SAAS,EACTC,QAASzzB,EACTA,MAAOA,KAaT,GAXA5H,EAAM14B,KAAKoD,GAEXJ,EAAEiwC,WAAW7vC,GAAGD,SAAQ,SAASoC,GAC1BuY,EAAE0I,IAAIshB,EAASviC,GAGTuiC,EAAQviC,GAAGuuD,UACpBxgC,EAAMygC,QAAU9sD,KAAK+iB,IAAIsJ,EAAMygC,QAASjsB,EAAQviC,GAAG+6B,SAHnDyH,EAAIxiC,GACJ+tB,EAAMygC,QAAU9sD,KAAK+iB,IAAIsJ,EAAMygC,QAASjsB,EAAQviC,GAAGwuD,aAMnDzgC,EAAMygC,UAAYzgC,EAAMgN,MAAO,CACjC,IACI/6B,EADAisD,EAAO,GAEX,GACEjsD,EAAImzB,EAAMtiB,MACV0xB,EAAQviC,GAAGuuD,SAAU,EACrBtC,EAAKxxD,KAAKuF,SACHnC,IAAMmC,GACfk2B,EAAQz7B,KAAKwxD,IAUjB,OANAxuD,EAAEE,QAAQC,SAAQ,SAASC,GACpB0a,EAAE0I,IAAIshB,EAAS1kC,IAClB2kC,EAAI3kC,MAIDq4B,I,eC7CT,IAAI3d,EAAI,EAAQ,MAKhB,SAAS01C,EAAQxwD,GACf,IAAI8kC,EAAU,GACVpP,EAAQ,GACR+C,EAAU,GAkBd,GAFA3d,EAAEuzB,KAAKruC,EAAE6oC,SAdT,SAASmoB,EAAM1wD,GACb,GAAIwa,EAAE0I,IAAIkS,EAAOp1B,GACf,MAAM,IAAImwD,EAGP31C,EAAE0I,IAAIshB,EAASxkC,KAClBo1B,EAAMp1B,IAAQ,EACdwkC,EAAQxkC,IAAQ,EAChBwa,EAAEuzB,KAAKruC,EAAE+zC,aAAazzC,GAAO0wD,UACtBt7B,EAAMp1B,GACbm4B,EAAQz7B,KAAKsD,OAMbwa,EAAEoF,KAAK4kB,KAAa9kC,EAAEgoC,YACxB,MAAM,IAAIyoB,EAGZ,OAAOh4B,EAGT,SAASg4B,KA/BTzsB,EAAOC,QAAUusB,EACjBA,EAAQC,eAAiBA,EA+BzBA,EAAeh2D,UAAY,IAAIklC,O,eClC/B,IAAI7kB,EAAI,EAAQ,MAWhB,SAASk0C,IACPxwD,KAAKjC,KAAO,GACZiC,KAAKyyD,YAAc,GAXrBjtB,EAAOC,QAAU+qB,EAiBjBA,EAAcv0D,UAAUylB,KAAO,WAC7B,OAAO1hB,KAAKjC,KAAKtD,QAMnB+1D,EAAcv0D,UAAUsG,KAAO,WAC7B,OAAOvC,KAAKjC,KAAK4Y,KAAI,SAAS9S,GAAK,OAAOA,EAAEhI,QAM9C20D,EAAcv0D,UAAU+oB,IAAM,SAASnpB,GACrC,OAAOygB,EAAE0I,IAAIhlB,KAAKyyD,YAAa52D,IASjC20D,EAAcv0D,UAAUm2D,SAAW,SAASv2D,GAC1C,IAAIijC,EAAQ9+B,KAAKyyD,YAAY52D,GAC7B,QAAcsC,IAAV2gC,EACF,OAAO9+B,KAAKjC,KAAK+gC,GAAOszB,UAQ5B5B,EAAcv0D,UAAUusB,IAAM,WAC5B,GAAoB,IAAhBxoB,KAAK0hB,OACP,MAAM,IAAIyf,MAAM,mBAElB,OAAOnhC,KAAKjC,KAAK,GAAGlC,KAWtB20D,EAAcv0D,UAAUqe,IAAM,SAASze,EAAKu2D,GAC1C,IAAIM,EAAa1yD,KAAKyyD,YAEtB,GADA52D,EAAMyiC,OAAOziC,IACRygB,EAAE0I,IAAI0tC,EAAY72D,GAAM,CAC3B,IAAItB,EAAMyF,KAAKjC,KACX+gC,EAAQvkC,EAAIE,OAIhB,OAHAi4D,EAAW72D,GAAOijC,EAClBvkC,EAAIiE,KAAK,CAAC3C,IAAKA,EAAKu2D,SAAUA,IAC9BpyD,KAAK2yD,UAAU7zB,IACR,EAET,OAAO,GAMT0xB,EAAcv0D,UAAU80D,UAAY,WAClC/wD,KAAK4yD,MAAM,EAAG5yD,KAAKjC,KAAKtD,OAAS,GACjC,IAAI+tB,EAAMxoB,KAAKjC,KAAK6W,MAGpB,cAFO5U,KAAKyyD,YAAYjqC,EAAI3sB,KAC5BmE,KAAK6yD,SAAS,GACPrqC,EAAI3sB,KAUb20D,EAAcv0D,UAAU60D,SAAW,SAASj1D,EAAKu2D,GAC/C,IAAItzB,EAAQ9+B,KAAKyyD,YAAY52D,GAC7B,GAAIu2D,EAAWpyD,KAAKjC,KAAK+gC,GAAOszB,SAC9B,MAAM,IAAIjxB,MAAM,uDACFtlC,EAAM,SAAWmE,KAAKjC,KAAK+gC,GAAOszB,SAAW,SAAWA,GAExEpyD,KAAKjC,KAAK+gC,GAAOszB,SAAWA,EAC5BpyD,KAAK2yD,UAAU7zB,IAGjB0xB,EAAcv0D,UAAU42D,SAAW,SAASn4D,GAC1C,IAAIH,EAAMyF,KAAKjC,KACX8vC,EAAI,EAAInzC,EACR8R,EAAIqhC,EAAI,EACRilB,EAAUp4D,EACVmzC,EAAItzC,EAAIE,SACVq4D,EAAUv4D,EAAIszC,GAAGukB,SAAW73D,EAAIu4D,GAASV,SAAWvkB,EAAIilB,EACpDtmD,EAAIjS,EAAIE,SACVq4D,EAAUv4D,EAAIiS,GAAG4lD,SAAW73D,EAAIu4D,GAASV,SAAW5lD,EAAIsmD,GAEtDA,IAAYp4D,IACdsF,KAAK4yD,MAAMl4D,EAAGo4D,GACd9yD,KAAK6yD,SAASC,MAKpBtC,EAAcv0D,UAAU02D,UAAY,SAAS7zB,GAI3C,IAHA,IAEI7pB,EAFA1a,EAAMyF,KAAKjC,KACXq0D,EAAW73D,EAAIukC,GAAOszB,SAET,IAAVtzB,KAEDvkC,EADJ0a,EAAS6pB,GAAS,GACFszB,SAAWA,IAG3BpyD,KAAK4yD,MAAM9zB,EAAO7pB,GAClB6pB,EAAQ7pB,GAIZu7C,EAAcv0D,UAAU22D,MAAQ,SAASl4D,EAAGyuB,GAC1C,IAAI5uB,EAAMyF,KAAKjC,KACX20D,EAAa1yD,KAAKyyD,YAClBM,EAAWx4D,EAAIG,GACfs4D,EAAWz4D,EAAI4uB,GACnB5uB,EAAIG,GAAKs4D,EACTz4D,EAAI4uB,GAAK4pC,EACTL,EAAWM,EAASn3D,KAAOnB,EAC3Bg4D,EAAWK,EAASl3D,KAAOstB,I,2BCpJ7B,IAAI7M,EAAI,EAAQ,MAEhBkpB,EAAOC,QAAUwD,EAEjB,IACIgqB,EAAa,KAajB,SAAShqB,EAAMqC,GACbtrC,KAAKkzD,aAAc52C,EAAE0I,IAAIsmB,EAAM,aAAcA,EAAK2Q,SAClDj8C,KAAKmzD,gBAAgB72C,EAAE0I,IAAIsmB,EAAM,eAAgBA,EAAKnhB,WACtDnqB,KAAKozD,cAAc92C,EAAE0I,IAAIsmB,EAAM,aAAcA,EAAKjC,SAGlDrpC,KAAKqzD,YAASl1D,EAGd6B,KAAKszD,oBAAsBh3C,EAAEmuB,cAAStsC,GAGtC6B,KAAKuzD,oBAAsBj3C,EAAEmuB,cAAStsC,GAGtC6B,KAAKwzD,OAAS,GAEVxzD,KAAKozD,cAEPpzD,KAAKyzD,QAAU,GAGfzzD,KAAK0zD,UAAY,GACjB1zD,KAAK0zD,UAAUT,MAAc,IAI/BjzD,KAAK2zD,IAAM,GAGX3zD,KAAK4zD,OAAS,GAGd5zD,KAAK6zD,KAAO,GAGZ7zD,KAAK8zD,MAAQ,GAGb9zD,KAAK+zD,UAAY,GAGjB/zD,KAAKg0D,YAAc,GA4arB,SAASC,EAAqBt9C,EAAKiyB,GAC7BjyB,EAAIiyB,GACNjyB,EAAIiyB,KAEJjyB,EAAIiyB,GAAK,EAIb,SAASsrB,EAAuBv9C,EAAKiyB,KAC5BjyB,EAAIiyB,WAAajyB,EAAIiyB,GAG9B,SAASurB,EAAa/D,EAAYgE,EAAIC,EAAI10D,GACxC,IAAIiC,EAAI,GAAKwyD,EACTrwD,EAAI,GAAKswD,EACb,IAAKjE,GAAcxuD,EAAImC,EAAG,CACxB,IAAImgC,EAAMtiC,EACVA,EAAImC,EACJA,EAAImgC,EAEN,OAAOtiC,EAtfY,IAsfSmC,EAtfT,KAufPuY,EAAE0zB,YAAYrwC,GAzfJ,KAyfgCA,GAGxD,SAAS20D,EAAclE,EAAYgE,EAAIC,EAAI10D,GACzC,IAAIiC,EAAI,GAAKwyD,EACTrwD,EAAI,GAAKswD,EACb,IAAKjE,GAAcxuD,EAAImC,EAAG,CACxB,IAAImgC,EAAMtiC,EACVA,EAAImC,EACJA,EAAImgC,EAEN,IAAIoN,EAAW,CAAE1vC,EAAGA,EAAGmC,EAAGA,GAI1B,OAHIpE,IACF2xC,EAAQ3xC,KAAOA,GAEV2xC,EAGT,SAASijB,EAAYnE,EAAY9e,GAC/B,OAAO6iB,EAAa/D,EAAY9e,EAAQ1vC,EAAG0vC,EAAQvtC,EAAGutC,EAAQ3xC,MAhdhEspC,EAAMhtC,UAAUu4D,WAAa,EAG7BvrB,EAAMhtC,UAAUw4D,WAAa,EAK7BxrB,EAAMhtC,UAAUm0D,WAAa,WAC3B,OAAOpwD,KAAKkzD,aAGdjqB,EAAMhtC,UAAUqiD,aAAe,WAC7B,OAAOt+C,KAAKmzD,eAGdlqB,EAAMhtC,UAAUy4D,WAAa,WAC3B,OAAO10D,KAAKozD,aAGdnqB,EAAMhtC,UAAU2tB,SAAW,SAASzB,GAElC,OADAnoB,KAAKqzD,OAASlrC,EACPnoB,MAGTipC,EAAMhtC,UAAU8F,MAAQ,WACtB,OAAO/B,KAAKqzD,QAMdpqB,EAAMhtC,UAAUq2C,oBAAsB,SAASqiB,GAK7C,OAJKr4C,EAAEs4C,WAAWD,KAChBA,EAAar4C,EAAEmuB,SAASkqB,IAE1B30D,KAAKszD,oBAAsBqB,EACpB30D,MAGTipC,EAAMhtC,UAAUutC,UAAY,WAC1B,OAAOxpC,KAAKw0D,YAGdvrB,EAAMhtC,UAAUyF,MAAQ,WACtB,OAAO4a,EAAE/Z,KAAKvC,KAAKwzD,SAGrBvqB,EAAMhtC,UAAUmuC,QAAU,WACxB,IAAItvC,EAAOkF,KACX,OAAOsc,EAAEnP,OAAOnN,KAAK0B,SAAS,SAASE,GACrC,OAAO0a,EAAEu4C,QAAQ/5D,EAAK64D,IAAI/xD,QAI9BqnC,EAAMhtC,UAAUouC,MAAQ,WACtB,IAAIvvC,EAAOkF,KACX,OAAOsc,EAAEnP,OAAOnN,KAAK0B,SAAS,SAASE,GACrC,OAAO0a,EAAEu4C,QAAQ/5D,EAAK+4D,KAAKjyD,QAI/BqnC,EAAMhtC,UAAU64D,SAAW,SAASnjB,EAAI70C,GACtC,IAAIu/B,EAAO2D,UACPllC,EAAOkF,KAQX,OAPAsc,EAAEuzB,KAAK8B,GAAI,SAAS/vC,GACdy6B,EAAK5hC,OAAS,EAChBK,EAAK+wB,QAAQjqB,EAAG9E,GAEhBhC,EAAK+wB,QAAQjqB,MAGV5B,MAGTipC,EAAMhtC,UAAU4vB,QAAU,SAASjqB,EAAG9E,GACpC,OAAIwf,EAAE0I,IAAIhlB,KAAKwzD,OAAQ5xD,IACjBo+B,UAAUvlC,OAAS,IACrBuF,KAAKwzD,OAAO5xD,GAAK9E,GAEZkD,OAGTA,KAAKwzD,OAAO5xD,GAAKo+B,UAAUvlC,OAAS,EAAIqC,EAAQkD,KAAKszD,oBAAoB1xD,GACrE5B,KAAKozD,cACPpzD,KAAKyzD,QAAQ7xD,GAAKqxD,EAClBjzD,KAAK0zD,UAAU9xD,GAAK,GACpB5B,KAAK0zD,UAAUT,MAAYrxD,IAAK,GAElC5B,KAAK2zD,IAAI/xD,GAAK,GACd5B,KAAK4zD,OAAOhyD,GAAK,GACjB5B,KAAK6zD,KAAKjyD,GAAK,GACf5B,KAAK8zD,MAAMlyD,GAAK,KACd5B,KAAKw0D,WACAx0D,OAGTipC,EAAMhtC,UAAU6F,KAAO,SAASF,GAC9B,OAAO5B,KAAKwzD,OAAO5xD,IAGrBqnC,EAAMhtC,UAAUm2C,QAAU,SAASxwC,GACjC,OAAO0a,EAAE0I,IAAIhlB,KAAKwzD,OAAQ5xD,IAG5BqnC,EAAMhtC,UAAUquC,WAAc,SAAS1oC,GACrC,IAAI9G,EAAOkF,KACX,GAAIsc,EAAE0I,IAAIhlB,KAAKwzD,OAAQ5xD,GAAI,CACzB,IAAI6kC,EAAa,SAAS5lC,GAAK/F,EAAK2rC,WAAW3rC,EAAKi5D,UAAUlzD,YACvDb,KAAKwzD,OAAO5xD,GACf5B,KAAKozD,cACPpzD,KAAK+0D,4BAA4BnzD,UAC1B5B,KAAKyzD,QAAQ7xD,GACpB0a,EAAEuzB,KAAK7vC,KAAK8hC,SAASlgC,IAAI,SAAS0uC,GAChCx1C,EAAKysC,UAAU+I,aAEVtwC,KAAK0zD,UAAU9xD,IAExB0a,EAAEuzB,KAAKvzB,EAAE/Z,KAAKvC,KAAK2zD,IAAI/xD,IAAK6kC,UACrBzmC,KAAK2zD,IAAI/xD,UACT5B,KAAK4zD,OAAOhyD,GACnB0a,EAAEuzB,KAAKvzB,EAAE/Z,KAAKvC,KAAK6zD,KAAKjyD,IAAK6kC,UACtBzmC,KAAK6zD,KAAKjyD,UACV5B,KAAK8zD,MAAMlyD,KAChB5B,KAAKw0D,WAET,OAAOx0D,MAGTipC,EAAMhtC,UAAUsrC,UAAY,SAAS3lC,EAAGqT,GACtC,IAAKjV,KAAKozD,YACR,MAAM,IAAIjyB,MAAM,6CAGlB,GAAI7kB,EAAE0zB,YAAY/6B,GAChBA,EAASg+C,MACJ,CAGL,IAAK,IAAI+B,EADT//C,GAAU,IAEPqH,EAAE0zB,YAAYglB,GACfA,EAAWh1D,KAAKiV,OAAO+/C,GACvB,GAAIA,IAAapzD,EACf,MAAM,IAAIu/B,MAAM,WAAalsB,EAAQ,iBAAmBrT,EACxC,yBAIpB5B,KAAK6rB,QAAQ5W,GAOf,OAJAjV,KAAK6rB,QAAQjqB,GACb5B,KAAK+0D,4BAA4BnzD,GACjC5B,KAAKyzD,QAAQ7xD,GAAKqT,EAClBjV,KAAK0zD,UAAUz+C,GAAQrT,IAAK,EACrB5B,MAGTipC,EAAMhtC,UAAU84D,4BAA8B,SAASnzD,UAC9C5B,KAAK0zD,UAAU1zD,KAAKyzD,QAAQ7xD,IAAIA,IAGzCqnC,EAAMhtC,UAAUgZ,OAAS,SAASrT,GAChC,GAAI5B,KAAKozD,YAAa,CACpB,IAAIn+C,EAASjV,KAAKyzD,QAAQ7xD,GAC1B,GAAIqT,IAAWg+C,EACb,OAAOh+C,IAKbg0B,EAAMhtC,UAAU6lC,SAAW,SAASlgC,GAKlC,GAJI0a,EAAE0zB,YAAYpuC,KAChBA,EAAIqxD,GAGFjzD,KAAKozD,YAAa,CACpB,IAAItxB,EAAW9hC,KAAK0zD,UAAU9xD,GAC9B,GAAIkgC,EACF,OAAOxlB,EAAE/Z,KAAKu/B,OAEX,IAAIlgC,IAAMqxD,EACf,OAAOjzD,KAAK0B,QACP,GAAI1B,KAAKoyC,QAAQxwC,GACtB,MAAO,KAIXqnC,EAAMhtC,UAAUs5C,aAAe,SAAS3zC,GACtC,IAAIqzD,EAASj1D,KAAK4zD,OAAOhyD,GACzB,GAAIqzD,EACF,OAAO34C,EAAE/Z,KAAK0yD,IAIlBhsB,EAAMhtC,UAAUw1C,WAAa,SAAS7vC,GACpC,IAAIszD,EAAQl1D,KAAK8zD,MAAMlyD,GACvB,GAAIszD,EACF,OAAO54C,EAAE/Z,KAAK2yD,IAIlBjsB,EAAMhtC,UAAU2hD,UAAY,SAASh8C,GACnC,IAAI+8C,EAAQ3+C,KAAKu1C,aAAa3zC,GAC9B,GAAI+8C,EACF,OAAOriC,EAAE64C,MAAMxW,EAAO3+C,KAAKyxC,WAAW7vC,KAI1CqnC,EAAMhtC,UAAUm5D,OAAS,SAAUxzD,GAOjC,OAA4B,KALxB5B,KAAKowD,aACKpwD,KAAKyxC,WAAW7vC,GAEhB5B,KAAK49C,UAAUh8C,IAEZnH,QAGnBwuC,EAAMhtC,UAAUo5D,YAAc,SAASloD,GACrC,IAAIq/C,EAAO,IAAIxsD,KAAKzC,YAAY,CAC9B0+C,SAAUj8C,KAAKkzD,YACf/oC,WAAYnqB,KAAKmzD,cACjB9pB,SAAUrpC,KAAKozD,cAGjB5G,EAAK5iC,SAAS5pB,KAAK+B,SAEnB,IAAIjH,EAAOkF,KACXsc,EAAEuzB,KAAK7vC,KAAKwzD,QAAQ,SAAS12D,EAAO8E,GAC9BuL,EAAOvL,IACT4qD,EAAK3gC,QAAQjqB,EAAG9E,MAIpBwf,EAAEuzB,KAAK7vC,KAAK+zD,WAAW,SAASlzD,GAC1B2rD,EAAKpa,QAAQvxC,EAAEe,IAAM4qD,EAAKpa,QAAQvxC,EAAEkD,IACtCyoD,EAAKpgC,QAAQvrB,EAAG/F,EAAKmG,KAAKJ,OAI9B,IAAIqxD,EAAU,GACd,SAASoD,EAAW1zD,GAClB,IAAIqT,EAASna,EAAKma,OAAOrT,GACzB,YAAezD,IAAX8W,GAAwBu3C,EAAKpa,QAAQn9B,IACvCi9C,EAAQtwD,GAAKqT,EACNA,GACEA,KAAUi9C,EACZA,EAAQj9C,GAERqgD,EAAWrgD,GAUtB,OANIjV,KAAKozD,aACP92C,EAAEuzB,KAAK2c,EAAK9qD,SAAS,SAASE,GAC5B4qD,EAAKjlB,UAAU3lC,EAAG0zD,EAAW1zD,OAI1B4qD,GAKTvjB,EAAMhtC,UAAU4tB,oBAAsB,SAAS8qC,GAK7C,OAJKr4C,EAAEs4C,WAAWD,KAChBA,EAAar4C,EAAEmuB,SAASkqB,IAE1B30D,KAAKuzD,oBAAsBoB,EACpB30D,MAGTipC,EAAMhtC,UAAUs5D,UAAY,WAC1B,OAAOv1D,KAAKy0D,YAGdxrB,EAAMhtC,UAAU+F,MAAQ,WACtB,OAAOsa,EAAEigB,OAAOv8B,KAAK+zD,YAGvB9qB,EAAMhtC,UAAUu5D,QAAU,SAAS7jB,EAAI70C,GACrC,IAAIhC,EAAOkF,KACPq8B,EAAO2D,UASX,OARA1jB,EAAE+hB,OAAOsT,GAAI,SAAS/vC,EAAGmC,GAMvB,OALIs4B,EAAK5hC,OAAS,EAChBK,EAAKsxB,QAAQxqB,EAAGmC,EAAGjH,GAEnBhC,EAAKsxB,QAAQxqB,EAAGmC,GAEXA,KAEF/D,MAOTipC,EAAMhtC,UAAUmwB,QAAU,WACxB,IAAIxqB,EAAGmC,EAAGpE,EAAM7C,EACZ24D,GAAiB,EACjBC,EAAO11B,UAAU,GAED,iBAAT01B,GAA8B,OAATA,GAAiB,MAAOA,GACtD9zD,EAAI8zD,EAAK9zD,EACTmC,EAAI2xD,EAAK3xD,EACTpE,EAAO+1D,EAAK/1D,KACa,IAArBqgC,UAAUvlC,SACZqC,EAAQkjC,UAAU,GAClBy1B,GAAiB,KAGnB7zD,EAAI8zD,EACJ3xD,EAAIi8B,UAAU,GACdrgC,EAAOqgC,UAAU,GACbA,UAAUvlC,OAAS,IACrBqC,EAAQkjC,UAAU,GAClBy1B,GAAiB,IAIrB7zD,EAAI,GAAKA,EACTmC,EAAI,GAAKA,EACJuY,EAAE0zB,YAAYrwC,KACjBA,EAAO,GAAKA,GAGd,IAAIkB,EAAIszD,EAAan0D,KAAKkzD,YAAatxD,EAAGmC,EAAGpE,GAC7C,GAAI2c,EAAE0I,IAAIhlB,KAAKg0D,YAAanzD,GAI1B,OAHI40D,IACFz1D,KAAKg0D,YAAYnzD,GAAK/D,GAEjBkD,KAGT,IAAKsc,EAAE0zB,YAAYrwC,KAAUK,KAAKmzD,cAChC,MAAM,IAAIhyB,MAAM,qDAKlBnhC,KAAK6rB,QAAQjqB,GACb5B,KAAK6rB,QAAQ9nB,GAEb/D,KAAKg0D,YAAYnzD,GAAK40D,EAAiB34D,EAAQkD,KAAKuzD,oBAAoB3xD,EAAGmC,EAAGpE,GAE9E,IAAI2xC,EAAUgjB,EAAct0D,KAAKkzD,YAAatxD,EAAGmC,EAAGpE,GAYpD,OAVAiC,EAAI0vC,EAAQ1vC,EACZmC,EAAIutC,EAAQvtC,EAEZpI,OAAOoD,OAAOuyC,GACdtxC,KAAK+zD,UAAUlzD,GAAKywC,EACpB2iB,EAAqBj0D,KAAK4zD,OAAO7vD,GAAInC,GACrCqyD,EAAqBj0D,KAAK8zD,MAAMlyD,GAAImC,GACpC/D,KAAK2zD,IAAI5vD,GAAGlD,GAAKywC,EACjBtxC,KAAK6zD,KAAKjyD,GAAGf,GAAKywC,EAClBtxC,KAAKy0D,aACEz0D,MAGTipC,EAAMhtC,UAAUgF,KAAO,SAASW,EAAGmC,EAAGpE,GACpC,IAAIkB,EAA0B,IAArBm/B,UAAUvlC,OACf85D,EAAYv0D,KAAKkzD,YAAalzB,UAAU,IACxCm0B,EAAan0D,KAAKkzD,YAAatxD,EAAGmC,EAAGpE,GACzC,OAAOK,KAAKg0D,YAAYnzD,IAG1BooC,EAAMhtC,UAAUuhD,QAAU,SAAS57C,EAAGmC,EAAGpE,GACvC,IAAIkB,EAA0B,IAArBm/B,UAAUvlC,OACf85D,EAAYv0D,KAAKkzD,YAAalzB,UAAU,IACxCm0B,EAAan0D,KAAKkzD,YAAatxD,EAAGmC,EAAGpE,GACzC,OAAO2c,EAAE0I,IAAIhlB,KAAKg0D,YAAanzD,IAGjCooC,EAAMhtC,UAAUwqC,WAAa,SAAS7kC,EAAGmC,EAAGpE,GAC1C,IAAIkB,EAA0B,IAArBm/B,UAAUvlC,OACf85D,EAAYv0D,KAAKkzD,YAAalzB,UAAU,IACxCm0B,EAAan0D,KAAKkzD,YAAatxD,EAAGmC,EAAGpE,GACrCsB,EAAOjB,KAAK+zD,UAAUlzD,GAY1B,OAXII,IACFW,EAAIX,EAAKW,EACTmC,EAAI9C,EAAK8C,SACF/D,KAAKg0D,YAAYnzD,UACjBb,KAAK+zD,UAAUlzD,GACtBqzD,EAAuBl0D,KAAK4zD,OAAO7vD,GAAInC,GACvCsyD,EAAuBl0D,KAAK8zD,MAAMlyD,GAAImC,UAC/B/D,KAAK2zD,IAAI5vD,GAAGlD,UACZb,KAAK6zD,KAAKjyD,GAAGf,GACpBb,KAAKy0D,cAEAz0D,MAGTipC,EAAMhtC,UAAUsT,QAAU,SAAS3N,EAAGkoB,GACpC,IAAIioB,EAAM/xC,KAAK2zD,IAAI/xD,GACnB,GAAImwC,EAAK,CACP,IAAI/vC,EAAQsa,EAAEigB,OAAOwV,GACrB,OAAKjoB,EAGExN,EAAEnP,OAAOnL,GAAO,SAASf,GAAQ,OAAOA,EAAKW,IAAMkoB,KAFjD9nB,IAMbinC,EAAMhtC,UAAUoT,SAAW,SAASzN,EAAGmC,GACrC,IAAI4xD,EAAO31D,KAAK6zD,KAAKjyD,GACrB,GAAI+zD,EAAM,CACR,IAAI3zD,EAAQsa,EAAEigB,OAAOo5B,GACrB,OAAK5xD,EAGEuY,EAAEnP,OAAOnL,GAAO,SAASf,GAAQ,OAAOA,EAAK8C,IAAMA,KAFjD/B,IAMbinC,EAAMhtC,UAAU4/C,UAAY,SAASj6C,EAAGmC,GACtC,IAAIwL,EAAUvP,KAAKuP,QAAQ3N,EAAGmC,GAC9B,GAAIwL,EACF,OAAOA,EAAQ2yB,OAAOliC,KAAKqP,SAASzN,EAAGmC,M,eCre3CyhC,EAAOC,QAAU,CACfwD,MAAO,EAAQ,KACflD,QAAS,EAAQ,Q,eCHnB,IAAIzpB,EAAI,EAAQ,MACZ2sB,EAAQ,EAAQ,KAuBpB,SAAS2sB,EAAWp0D,GAClB,OAAO8a,EAAE3F,IAAInV,EAAEE,SAAS,SAASE,GAC/B,IAAIi0D,EAAYr0D,EAAEM,KAAKF,GACnBqT,EAASzT,EAAEyT,OAAOrT,GAClBE,EAAO,CAAEF,EAAGA,GAOhB,OANK0a,EAAE0zB,YAAY6lB,KACjB/zD,EAAKhF,MAAQ+4D,GAEVv5C,EAAE0zB,YAAY/6B,KACjBnT,EAAKmT,OAASA,GAETnT,KAIX,SAASg0D,EAAWt0D,GAClB,OAAO8a,EAAE3F,IAAInV,EAAEQ,SAAS,SAASnB,GAC/B,IAAIk1D,EAAYv0D,EAAEP,KAAKJ,GACnBI,EAAO,CAAEW,EAAGf,EAAEe,EAAGmC,EAAGlD,EAAEkD,GAO1B,OANKuY,EAAE0zB,YAAYnvC,EAAElB,QACnBsB,EAAKtB,KAAOkB,EAAElB,MAEX2c,EAAE0zB,YAAY+lB,KACjB90D,EAAKnE,MAAQi5D,GAER90D,KA9CXukC,EAAOC,QAAU,CACfuwB,MAIF,SAAex0D,GACb,IAAIsuD,EAAO,CACTmG,QAAS,CACPha,SAAUz6C,EAAE4uD,aACZjmC,WAAY3oB,EAAE88C,eACdjV,SAAU7nC,EAAEkzD,cAEdhzD,MAAOk0D,EAAWp0D,GAClBQ,MAAO8zD,EAAWt0D,IAKpB,OAHK8a,EAAE0zB,YAAYxuC,EAAEO,WACnB+tD,EAAKhzD,MAAQwf,EAAEmwC,MAAMjrD,EAAEO,UAElB+tD,GAhBPoG,KAgDF,SAAcpG,GACZ,IAAItuD,EAAI,IAAIynC,EAAM6mB,EAAKmG,SAASrsC,SAASkmC,EAAKhzD,OAU9C,OATAwf,EAAEuzB,KAAKigB,EAAKpuD,OAAO,SAASowB,GAC1BtwB,EAAEqqB,QAAQiG,EAAMlwB,EAAGkwB,EAAMh1B,OACrBg1B,EAAM7c,QACRzT,EAAE+lC,UAAUzV,EAAMlwB,EAAGkwB,EAAM7c,WAG/BqH,EAAEuzB,KAAKigB,EAAK9tD,OAAO,SAAS8vB,GAC1BtwB,EAAE4qB,QAAQ,CAAExqB,EAAGkwB,EAAMlwB,EAAGmC,EAAG+tB,EAAM/tB,EAAGpE,KAAMmyB,EAAMnyB,MAAQmyB,EAAMh1B,UAEzD0E,K,eC9DT,IAAImuC,EAGF,IACEA,EAAS,CACP8c,MAAO,EAAQ,MACfhiB,SAAU,EAAQ,MAClBoF,KAAM,EAAQ,MACd1iC,OAAQ,EAAQ,MAChB6X,IAAM,EAAQ,MACdpnB,QAAS,EAAQ,MACjBi3D,QAAS,EAAQ,MACjBD,WAAY,EAAQ,MACpB5kB,YAAa,EAAQ,MACrBztC,KAAM,EAAQ,MACdoU,IAAK,EAAQ,MACb0nB,OAAQ,EAAQ,MAChB3c,KAAM,EAAQ,MACdhV,UAAW,EAAQ,MACnByoD,MAAO,EAAQ,MACf54B,OAAQ,EAAQ,OAElB,MAAO17B,IAKN8uC,IACHA,EAASr8B,OAAOgJ,GAGlBkpB,EAAOC,QAAUkK,G,SCjCjBnK,EAAOC,QAAU,S,SCKjBD,EAAOC,QAAU,SAAS0wB,EAAahtD,EAAGC,GACzC,aACA,IAeCgtD,EAAQC,EAfLryB,EAAK,8EACRsyB,EAAM,iBACNC,EAAM,iHACNC,EAAM,iBACNC,EAAM,KACN/7D,EAAI,SAASiZ,GAAK,OAAOwiD,EAAYO,cAAgB,GAAK/iD,GAAGupB,eAAiB,GAAKvpB,GAEnF9P,EAAInJ,EAAEyO,GAAG7H,QAAQg1D,EAAK,KAAO,GAC7BxyD,EAAIpJ,EAAE0O,GAAG9H,QAAQg1D,EAAK,KAAO,GAE7BK,EAAK9yD,EAAEvC,QAAQ0iC,EAAI,UAAU1iC,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAI8xB,MAAM,MACvEwjC,EAAK9yD,EAAExC,QAAQ0iC,EAAI,UAAU1iC,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAI8xB,MAAM,MAEvEyjC,EAAKj2B,SAAS/8B,EAAE8/B,MAAM6yB,GAAM,KAAsB,IAAdG,EAAGl8D,QAAgBoJ,EAAE8/B,MAAM4yB,IAAQx7B,KAAK3mB,MAAMvQ,GAClFizD,EAAKl2B,SAAS98B,EAAE6/B,MAAM6yB,GAAM,KAAOK,GAAM/yD,EAAE6/B,MAAM4yB,IAAQx7B,KAAK3mB,MAAMtQ,IAAM,KAG3E,GAAIgzD,EAAI,CACP,GAAKD,EAAKC,EAAO,OAAQ,EACpB,GAAKD,EAAKC,EAAO,OAAO,EAG9B,IAAI,IAAIC,EAAK,EAAGC,EAAKvxD,KAAKijB,IAAIiuC,EAAGl8D,OAAQm8D,EAAGn8D,QAASs8D,EAAOC,EAAMD,IAAQ,CAKzE,GAHAX,IAAWO,EAAGI,IAAS,IAAIpzB,MAAM8yB,IAAQpkD,WAAWskD,EAAGI,KAAUJ,EAAGI,IAAS,EAC7EV,IAAWO,EAAGG,IAAS,IAAIpzB,MAAM8yB,IAAQpkD,WAAWukD,EAAGG,KAAUH,EAAGG,IAAS,EAEzEjwD,MAAMsvD,KAAYtvD,MAAMuvD,GAAW,OAAQvvD,MAAMsvD,GAAW,GAAK,EAMrE,UAJgBA,UAAkBC,IACjCD,GAAU,GACVC,GAAU,IAEPD,EAASC,EAAU,OAAQ,EAC/B,GAAID,EAASC,EAAU,OAAO,EAE/B,OAAO,I,eC3CR,IAIIY,EAJY,EAAQ,IAITC,CAHJ,EAAQ,MAGY,YAE/B1xB,EAAOC,QAAUwxB,G,eCNjB,IAAIE,EAAY,EAAQ,MACpBC,EAAa,EAAQ,KACrBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAStB,SAASC,EAAK9/B,GACZ,IAAIoH,GAAS,EACTrkC,EAAoB,MAAXi9B,EAAkB,EAAIA,EAAQj9B,OAG3C,IADAuF,KAAKy3D,UACI34B,EAAQrkC,GAAQ,CACvB,IAAIq3B,EAAQ4F,EAAQoH,GACpB9+B,KAAK6qB,IAAIiH,EAAM,GAAIA,EAAM,KAK7B0lC,EAAKv7D,UAAUw7D,MAAQN,EACvBK,EAAKv7D,UAAkB,OAAIm7D,EAC3BI,EAAKv7D,UAAUK,IAAM+6D,EACrBG,EAAKv7D,UAAU+oB,IAAMsyC,EACrBE,EAAKv7D,UAAU4uB,IAAM0sC,EAErB/xB,EAAOC,QAAU+xB,G,eC/BjB,IAAIE,EAAiB,EAAQ,MACzBC,EAAkB,EAAQ,MAC1BC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,MAS3B,SAASC,EAAUrgC,GACjB,IAAIoH,GAAS,EACTrkC,EAAoB,MAAXi9B,EAAkB,EAAIA,EAAQj9B,OAG3C,IADAuF,KAAKy3D,UACI34B,EAAQrkC,GAAQ,CACvB,IAAIq3B,EAAQ4F,EAAQoH,GACpB9+B,KAAK6qB,IAAIiH,EAAM,GAAIA,EAAM,KAK7BimC,EAAU97D,UAAUw7D,MAAQC,EAC5BK,EAAU97D,UAAkB,OAAI07D,EAChCI,EAAU97D,UAAUK,IAAMs7D,EAC1BG,EAAU97D,UAAU+oB,IAAM6yC,EAC1BE,EAAU97D,UAAU4uB,IAAMitC,EAE1BtyB,EAAOC,QAAUsyB,G,eC/BjB,IAIIptC,EAJY,EAAQ,IAIdusC,CAHC,EAAQ,MAGO,OAE1B1xB,EAAOC,QAAU9a,G,eCNjB,IAAIqtC,EAAgB,EAAQ,MACxBC,EAAiB,EAAQ,MACzBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,MACtBC,EAAc,EAAQ,MAS1B,SAASC,EAAS3gC,GAChB,IAAIoH,GAAS,EACTrkC,EAAoB,MAAXi9B,EAAkB,EAAIA,EAAQj9B,OAG3C,IADAuF,KAAKy3D,UACI34B,EAAQrkC,GAAQ,CACvB,IAAIq3B,EAAQ4F,EAAQoH,GACpB9+B,KAAK6qB,IAAIiH,EAAM,GAAIA,EAAM,KAK7BumC,EAASp8D,UAAUw7D,MAAQO,EAC3BK,EAASp8D,UAAkB,OAAIg8D,EAC/BI,EAASp8D,UAAUK,IAAM47D,EACzBG,EAASp8D,UAAU+oB,IAAMmzC,EACzBE,EAASp8D,UAAU4uB,IAAMutC,EAEzB5yB,EAAOC,QAAU4yB,G,eC/BjB,IAIIC,EAJY,EAAQ,IAIVpB,CAHH,EAAQ,MAGW,WAE9B1xB,EAAOC,QAAU6yB,G,eCNjB,IAII54C,EAJY,EAAQ,IAIdw3C,CAHC,EAAQ,MAGO,OAE1B1xB,EAAOC,QAAU/lB,G,eCNjB,IAAI24C,EAAW,EAAQ,MACnBE,EAAc,EAAQ,KACtBC,EAAc,EAAQ,MAU1B,SAASC,EAASl8B,GAChB,IAAIuC,GAAS,EACTrkC,EAAmB,MAAV8hC,EAAiB,EAAIA,EAAO9hC,OAGzC,IADAuF,KAAK04D,SAAW,IAAIL,IACXv5B,EAAQrkC,GACfuF,KAAKsa,IAAIiiB,EAAOuC,IAKpB25B,EAASx8D,UAAUqe,IAAMm+C,EAASx8D,UAAUuC,KAAO+5D,EACnDE,EAASx8D,UAAU+oB,IAAMwzC,EAEzBhzB,EAAOC,QAAUgzB,G,eC1BjB,IAAIV,EAAY,EAAQ,MACpBY,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MACtBC,EAAW,EAAQ,MACnBC,EAAW,EAAQ,MACnBC,EAAW,EAAQ,MASvB,SAASC,EAAMthC,GACb,IAAI32B,EAAOf,KAAK04D,SAAW,IAAIX,EAAUrgC,GACzC13B,KAAK0hB,KAAO3gB,EAAK2gB,KAInBs3C,EAAM/8D,UAAUw7D,MAAQkB,EACxBK,EAAM/8D,UAAkB,OAAI28D,EAC5BI,EAAM/8D,UAAUK,IAAMu8D,EACtBG,EAAM/8D,UAAU+oB,IAAM8zC,EACtBE,EAAM/8D,UAAU4uB,IAAMkuC,EAEtBvzB,EAAOC,QAAUuzB,G,eC1BjB,IAGIn7D,EAHO,EAAQ,MAGDA,OAElB2nC,EAAOC,QAAU5nC,G,eCLjB,IAGIo7D,EAHO,EAAQ,MAGGA,WAEtBzzB,EAAOC,QAAUwzB,G,cCLjB,IAIIC,EAJY,EAAQ,IAIVhC,CAHH,EAAQ,MAGW,WAE9B1xB,EAAOC,QAAUyzB,G,SCcjB1zB,EAAOC,QAVP,SAAe/gB,EAAMy0C,EAAS98B,GAC5B,OAAQA,EAAK5hC,QACX,KAAK,EAAG,OAAOiqB,EAAKhoB,KAAKy8D,GACzB,KAAK,EAAG,OAAOz0C,EAAKhoB,KAAKy8D,EAAS98B,EAAK,IACvC,KAAK,EAAG,OAAO3X,EAAKhoB,KAAKy8D,EAAS98B,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAO3X,EAAKhoB,KAAKy8D,EAAS98B,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAO3X,EAAK0pC,MAAM+K,EAAS98B,K,SCI7BmJ,EAAOC,QAZP,SAAmB2zB,EAAOC,GAIxB,IAHA,IAAIv6B,GAAS,EACTrkC,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,SAE9BqkC,EAAQrkC,IAC8B,IAAzC4+D,EAASD,EAAMt6B,GAAQA,EAAOs6B,KAIpC,OAAOA,I,SCMT5zB,EAAOC,QAfP,SAAqB2zB,EAAOE,GAM1B,IALA,IAAIx6B,GAAS,EACTrkC,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,OACnC8+D,EAAW,EACXrwD,EAAS,KAEJ41B,EAAQrkC,GAAQ,CACvB,IAAIqC,EAAQs8D,EAAMt6B,GACdw6B,EAAUx8D,EAAOgiC,EAAOs6B,KAC1BlwD,EAAOqwD,KAAcz8D,GAGzB,OAAOoM,I,eCrBT,IAAIswD,EAAc,EAAQ,MAgB1Bh0B,EAAOC,QALP,SAAuB2zB,EAAOt8D,GAE5B,QADsB,MAATs8D,IAAoBA,EAAM3+D,SACpB++D,EAAYJ,EAAOt8D,EAAO,IAAM,I,SCQrD0oC,EAAOC,QAZP,SAA2B2zB,EAAOt8D,EAAO28D,GAIvC,IAHA,IAAI36B,GAAS,EACTrkC,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,SAE9BqkC,EAAQrkC,GACf,GAAIg/D,EAAW38D,EAAOs8D,EAAMt6B,IAC1B,OAAO,EAGX,OAAO,I,eClBT,IAAI46B,EAAY,EAAQ,MACpBC,EAAc,EAAQ,MACtB/7D,EAAU,EAAQ,MAClBg8D,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MAMvBr9D,EAHcd,OAAOM,UAGQQ,eAqCjC+oC,EAAOC,QA3BP,SAAuB3oC,EAAOi9D,GAC5B,IAAIC,EAAQp8D,EAAQd,GAChBm9D,GAASD,GAASL,EAAY78D,GAC9Bo9D,GAAUF,IAAUC,GAASL,EAAS98D,GACtCq9D,GAAUH,IAAUC,IAAUC,GAAUJ,EAAah9D,GACrDs9D,EAAcJ,GAASC,GAASC,GAAUC,EAC1CjxD,EAASkxD,EAAcV,EAAU58D,EAAMrC,OAAQ6jC,QAAU,GACzD7jC,EAASyO,EAAOzO,OAEpB,IAAK,IAAIoB,KAAOiB,GACTi9D,IAAat9D,EAAeC,KAAKI,EAAOjB,IACvCu+D,IAEQ,UAAPv+D,GAECq+D,IAAkB,UAAPr+D,GAA0B,UAAPA,IAE9Bs+D,IAAkB,UAAPt+D,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDg+D,EAAQh+D,EAAKpB,KAElByO,EAAO1K,KAAK3C,GAGhB,OAAOqN,I,SCzBTs8B,EAAOC,QAXP,SAAkB2zB,EAAOC,GAKvB,IAJA,IAAIv6B,GAAS,EACTrkC,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,OACnCyO,EAAStO,MAAMH,KAEVqkC,EAAQrkC,GACfyO,EAAO41B,GAASu6B,EAASD,EAAMt6B,GAAQA,EAAOs6B,GAEhD,OAAOlwD,I,SCETs8B,EAAOC,QAXP,SAAmB2zB,EAAO78B,GAKxB,IAJA,IAAIuC,GAAS,EACTrkC,EAAS8hC,EAAO9hC,OAChBy5B,EAASklC,EAAM3+D,SAEVqkC,EAAQrkC,GACf2+D,EAAMllC,EAAS4K,GAASvC,EAAOuC,GAEjC,OAAOs6B,I,SCST5zB,EAAOC,QAbP,SAAqB2zB,EAAOC,EAAUgB,EAAaC,GACjD,IAAIx7B,GAAS,EACTrkC,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,OAKvC,IAHI6/D,GAAa7/D,IACf4/D,EAAcjB,IAAQt6B,MAEfA,EAAQrkC,GACf4/D,EAAchB,EAASgB,EAAajB,EAAMt6B,GAAQA,EAAOs6B,GAE3D,OAAOiB,I,SCAT70B,EAAOC,QAZP,SAAmB2zB,EAAOE,GAIxB,IAHA,IAAIx6B,GAAS,EACTrkC,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,SAE9BqkC,EAAQrkC,GACf,GAAI6+D,EAAUF,EAAMt6B,GAAQA,EAAOs6B,GACjC,OAAO,EAGX,OAAO,I,eCnBT,IASImB,EATe,EAAQ,IASXC,CAAa,UAE7Bh1B,EAAOC,QAAU80B,G,eCXjB,IAAIE,EAAkB,EAAQ,MAC1BjX,EAAK,EAAQ,MAkBjBhe,EAAOC,QAPP,SAA0BjpC,EAAQX,EAAKiB,SACtBqB,IAAVrB,IAAwB0mD,EAAGhnD,EAAOX,GAAMiB,SAC9BqB,IAAVrB,KAAyBjB,KAAOW,KACnCi+D,EAAgBj+D,EAAQX,EAAKiB,K,eCfjC,IAAI29D,EAAkB,EAAQ,MAC1BjX,EAAK,EAAQ,MAMb/mD,EAHcd,OAAOM,UAGQQ,eAoBjC+oC,EAAOC,QARP,SAAqBjpC,EAAQX,EAAKiB,GAChC,IAAI49D,EAAWl+D,EAAOX,GAChBY,EAAeC,KAAKF,EAAQX,IAAQ2nD,EAAGkX,EAAU59D,UACxCqB,IAAVrB,GAAyBjB,KAAOW,IACnCi+D,EAAgBj+D,EAAQX,EAAKiB,K,eCvBjC,IAAI0mD,EAAK,EAAQ,MAoBjBhe,EAAOC,QAVP,SAAsB2zB,EAAOv9D,GAE3B,IADA,IAAIpB,EAAS2+D,EAAM3+D,OACZA,KACL,GAAI+oD,EAAG4V,EAAM3+D,GAAQ,GAAIoB,GACvB,OAAOpB,EAGX,OAAQ,I,eCjBV,IAAIkgE,EAAa,EAAQ,MACrBp4D,EAAO,EAAQ,MAenBijC,EAAOC,QAJP,SAAoBjpC,EAAQo4C,GAC1B,OAAOp4C,GAAUm+D,EAAW/lB,EAAQryC,EAAKqyC,GAASp4C,K,eCbpD,IAAIm+D,EAAa,EAAQ,MACrBC,EAAS,EAAQ,MAerBp1B,EAAOC,QAJP,SAAsBjpC,EAAQo4C,GAC5B,OAAOp4C,GAAUm+D,EAAW/lB,EAAQgmB,EAAOhmB,GAASp4C,K,eCbtD,IAAIZ,EAAiB,EAAQ,MAwB7B4pC,EAAOC,QAbP,SAAyBjpC,EAAQX,EAAKiB,GACzB,aAAPjB,GAAsBD,EACxBA,EAAeY,EAAQX,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASiB,EACT,UAAY,IAGdN,EAAOX,GAAOiB,I,eCpBlB,IAAIk8D,EAAQ,EAAQ,MAChB6B,EAAY,EAAQ,MACpBC,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAc,EAAQ,MACtBC,EAAY,EAAQ,KACpBC,EAAc,EAAQ,MACtBC,EAAgB,EAAQ,MACxBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAS,EAAQ,MACjBC,EAAiB,EAAQ,MACzBC,EAAiB,EAAQ,MACzBC,EAAkB,EAAQ,MAC1B99D,EAAU,EAAQ,MAClBg8D,EAAW,EAAQ,MACnB+B,EAAQ,EAAQ,MAChBC,EAAW,EAAQ,MACnBC,EAAQ,EAAQ,MAChBt5D,EAAO,EAAQ,MACfq4D,EAAS,EAAQ,MAQjBkB,EAAU,qBAKVC,EAAU,oBAIVC,EAAY,kBAoBZC,EAAgB,GACpBA,EAAcH,GAAWG,EA7BV,kBA8BfA,EAfqB,wBAeWA,EAdd,qBAelBA,EA9Bc,oBA8BWA,EA7BX,iBA8BdA,EAfiB,yBAeWA,EAdX,yBAejBA,EAdc,sBAcWA,EAbV,uBAcfA,EAbe,uBAaWA,EA5Bb,gBA6BbA,EA5BgB,mBA4BWA,EAAcD,GACzCC,EA3BgB,mBA2BWA,EA1Bd,gBA2BbA,EA1BgB,mBA0BWA,EAzBX,mBA0BhBA,EAhBe,uBAgBWA,EAfJ,8BAgBtBA,EAfgB,wBAeWA,EAdX,yBAcsC,EACtDA,EArCe,kBAqCWA,EAAcF,GACxCE,EA5BiB,qBA4BW,EA8F5Bz2B,EAAOC,QA5EP,SAASy2B,EAAUp/D,EAAOq/D,EAASC,EAAYvgE,EAAKW,EAAQ06B,GAC1D,IAAIhuB,EACAmzD,EAnEgB,EAmEPF,EACTG,EAnEgB,EAmEPH,EACTI,EAnEmB,EAmEVJ,EAKb,GAHIC,IACFlzD,EAAS1M,EAAS4/D,EAAWt/D,EAAOjB,EAAKW,EAAQ06B,GAASklC,EAAWt/D,SAExDqB,IAAX+K,EACF,OAAOA,EAET,IAAK0yD,EAAS9+D,GACZ,OAAOA,EAET,IAAIk9D,EAAQp8D,EAAQd,GACpB,GAAIk9D,GAEF,GADA9wD,EAASsyD,EAAe1+D,IACnBu/D,EACH,OAAOnB,EAAUp+D,EAAOoM,OAErB,CACL,IAAIszD,EAAMjB,EAAOz+D,GACb2/D,EAASD,GAAOT,GA7EX,8BA6EsBS,EAE/B,GAAI5C,EAAS98D,GACX,OAAOm+D,EAAYn+D,EAAOu/D,GAE5B,GAAIG,GAAOR,GAAaQ,GAAOV,GAAYW,IAAWjgE,GAEpD,GADA0M,EAAUozD,GAAUG,EAAU,GAAKf,EAAgB5+D,IAC9Cu/D,EACH,OAAOC,EACHlB,EAAct+D,EAAOk+D,EAAa9xD,EAAQpM,IAC1Cq+D,EAAYr+D,EAAOi+D,EAAW7xD,EAAQpM,QAEvC,CACL,IAAKm/D,EAAcO,GACjB,OAAOhgE,EAASM,EAAQ,GAE1BoM,EAASuyD,EAAe3+D,EAAO0/D,EAAKH,IAIxCnlC,IAAUA,EAAQ,IAAI8hC,GACtB,IAAI0D,EAAUxlC,EAAM56B,IAAIQ,GACxB,GAAI4/D,EACF,OAAOA,EAETxlC,EAAMrM,IAAI/tB,EAAOoM,GAEb2yD,EAAM/+D,GACRA,EAAM6E,SAAQ,SAASg7D,GACrBzzD,EAAOoR,IAAI4hD,EAAUS,EAAUR,EAASC,EAAYO,EAAU7/D,EAAOo6B,OAE9DykC,EAAM7+D,IACfA,EAAM6E,SAAQ,SAASg7D,EAAU9gE,GAC/BqN,EAAO2hB,IAAIhvB,EAAKqgE,EAAUS,EAAUR,EAASC,EAAYvgE,EAAKiB,EAAOo6B,OAIzE,IAII57B,EAAQ0+D,OAAQ77D,GAJLo+D,EACVD,EAAShB,EAAeD,EACxBiB,EAAS1B,EAASr4D,GAEkBzF,GASzC,OARA+9D,EAAUv/D,GAASwB,GAAO,SAAS6/D,EAAU9gE,GACvCP,IAEFqhE,EAAW7/D,EADXjB,EAAM8gE,IAIR7B,EAAY5xD,EAAQrN,EAAKqgE,EAAUS,EAAUR,EAASC,EAAYvgE,EAAKiB,EAAOo6B,OAEzEhuB,I,eClKT,IAAI0yD,EAAW,EAAQ,MAGnBgB,EAAejhE,OAAO2B,OAUtBu/D,EAAc,WAChB,SAASrgE,KACT,OAAO,SAASsgE,GACd,IAAKlB,EAASkB,GACZ,MAAO,GAET,GAAIF,EACF,OAAOA,EAAaE,GAEtBtgE,EAAOP,UAAY6gE,EACnB,IAAI5zD,EAAS,IAAI1M,EAEjB,OADAA,EAAOP,eAAYkC,EACZ+K,GAZM,GAgBjBs8B,EAAOC,QAAUo3B,G,eC7BjB,IAAIE,EAAa,EAAQ,MAWrBC,EAViB,EAAQ,KAUdC,CAAeF,GAE9Bv3B,EAAOC,QAAUu3B,G,eCbjB,IAAIE,EAAW,EAAQ,MA+BvB13B,EAAOC,QAnBP,SAAsB2zB,EAAOC,EAAUI,GAIrC,IAHA,IAAI36B,GAAS,EACTrkC,EAAS2+D,EAAM3+D,SAEVqkC,EAAQrkC,GAAQ,CACvB,IAAIqC,EAAQs8D,EAAMt6B,GACdq+B,EAAU9D,EAASv8D,GAEvB,GAAe,MAAXqgE,SAAiCh/D,IAAbi/D,EACfD,GAAYA,IAAYD,EAASC,GAClC1D,EAAW0D,EAASC,IAE1B,IAAIA,EAAWD,EACXj0D,EAASpM,EAGjB,OAAOoM,I,cC5BT,IAAI8zD,EAAW,EAAQ,MAoBvBx3B,EAAOC,QAVP,SAAoBmZ,EAAY0a,GAC9B,IAAIpwD,EAAS,GAMb,OALA8zD,EAASpe,GAAY,SAAS9hD,EAAOgiC,EAAO8f,GACtC0a,EAAUx8D,EAAOgiC,EAAO8f,IAC1B11C,EAAO1K,KAAK1B,MAGToM,I,SCMTs8B,EAAOC,QAZP,SAAuB2zB,EAAOE,EAAW+D,EAAWC,GAIlD,IAHA,IAAI7iE,EAAS2+D,EAAM3+D,OACfqkC,EAAQu+B,GAAaC,EAAY,GAAK,GAElCA,EAAYx+B,MAAYA,EAAQrkC,GACtC,GAAI6+D,EAAUF,EAAMt6B,GAAQA,EAAOs6B,GACjC,OAAOt6B,EAGX,OAAQ,I,eCpBV,IAAIy+B,EAAY,EAAQ,MACpBC,EAAgB,EAAQ,MAoC5Bh4B,EAAOC,QAvBP,SAASg4B,EAAYrE,EAAOxoB,EAAO0oB,EAAWoE,EAAUx0D,GACtD,IAAI41B,GAAS,EACTrkC,EAAS2+D,EAAM3+D,OAKnB,IAHA6+D,IAAcA,EAAYkE,GAC1Bt0D,IAAWA,EAAS,MAEX41B,EAAQrkC,GAAQ,CACvB,IAAIqC,EAAQs8D,EAAMt6B,GACd8R,EAAQ,GAAK0oB,EAAUx8D,GACrB8zC,EAAQ,EAEV6sB,EAAY3gE,EAAO8zC,EAAQ,EAAG0oB,EAAWoE,EAAUx0D,GAEnDq0D,EAAUr0D,EAAQpM,GAEV4gE,IACVx0D,EAAOA,EAAOzO,QAAUqC,GAG5B,OAAOoM,I,eClCT,IAaIy0D,EAbgB,EAAQ,KAadC,GAEdp4B,EAAOC,QAAUk4B,G,eCfjB,IAAIA,EAAU,EAAQ,MAClBp7D,EAAO,EAAQ,MAcnBijC,EAAOC,QAJP,SAAoBjpC,EAAQ68D,GAC1B,OAAO78D,GAAUmhE,EAAQnhE,EAAQ68D,EAAU92D,K,eCZ7C,IAAIs7D,EAAW,EAAQ,MACnBC,EAAQ,EAAQ,KAsBpBt4B,EAAOC,QAZP,SAAiBjpC,EAAQwY,GAMvB,IAHA,IAAI8pB,EAAQ,EACRrkC,GAHJua,EAAO6oD,EAAS7oD,EAAMxY,IAGJ/B,OAED,MAAV+B,GAAkBsiC,EAAQrkC,GAC/B+B,EAASA,EAAOshE,EAAM9oD,EAAK8pB,OAE7B,OAAQA,GAASA,GAASrkC,EAAU+B,OAAS2B,I,eCpB/C,IAAIo/D,EAAY,EAAQ,MACpB3/D,EAAU,EAAQ,MAkBtB4nC,EAAOC,QALP,SAAwBjpC,EAAQuhE,EAAUC,GACxC,IAAI90D,EAAS60D,EAASvhE,GACtB,OAAOoB,EAAQpB,GAAU0M,EAASq0D,EAAUr0D,EAAQ80D,EAAYxhE,M,eChBlE,IAAIqB,EAAS,EAAQ,MACjBogE,EAAY,EAAQ,MACpBC,EAAiB,EAAQ,MAOzBC,EAAiBtgE,EAASA,EAAOugE,iBAAcjgE,EAkBnDqnC,EAAOC,QATP,SAAoB3oC,GAClB,OAAa,MAATA,OACeqB,IAAVrB,EAdQ,qBADL,gBAiBJqhE,GAAkBA,KAAkBxiE,OAAOmB,GAC/CmhE,EAAUnhE,GACVohE,EAAephE,K,SCXrB0oC,EAAOC,QAJP,SAAgB3oC,EAAO6lC,GACrB,OAAO7lC,EAAQ6lC,I,SCTjB,IAGIlmC,EAHcd,OAAOM,UAGQQ,eAcjC+oC,EAAOC,QAJP,SAAiBjpC,EAAQX,GACvB,OAAiB,MAAVW,GAAkBC,EAAeC,KAAKF,EAAQX,K,OCHvD2pC,EAAOC,QAJP,SAAmBjpC,EAAQX,GACzB,OAAiB,MAAVW,GAAkBX,KAAOF,OAAOa,K,eCTzC,IAAI6hE,EAAgB,EAAQ,MACxBC,EAAY,EAAQ,MACpBC,EAAgB,EAAQ,MAiB5B/4B,EAAOC,QANP,SAAqB2zB,EAAOt8D,EAAOugE,GACjC,OAAOvgE,GAAUA,EACbyhE,EAAcnF,EAAOt8D,EAAOugE,GAC5BgB,EAAcjF,EAAOkF,EAAWjB,K,eChBtC,IAAImB,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MAgB3Bj5B,EAAOC,QAJP,SAAyB3oC,GACvB,OAAO2hE,EAAa3hE,IAVR,sBAUkB0hE,EAAW1hE,K,cCd3C,IAAI4hE,EAAkB,EAAQ,MAC1BD,EAAe,EAAQ,MA0B3Bj5B,EAAOC,QAVP,SAASk5B,EAAY7hE,EAAO6lC,EAAOw5B,EAASC,EAAYllC,GACtD,OAAIp6B,IAAU6lC,IAGD,MAAT7lC,GAA0B,MAAT6lC,IAAmB87B,EAAa3hE,KAAW2hE,EAAa97B,GACpE7lC,GAAUA,GAAS6lC,GAAUA,EAE/B+7B,EAAgB5hE,EAAO6lC,EAAOw5B,EAASC,EAAYuC,EAAaznC,M,eCxBzE,IAAI8hC,EAAQ,EAAQ,MAChB4F,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBvD,EAAS,EAAQ,MACjB39D,EAAU,EAAQ,MAClBg8D,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MAMvBgC,EAAU,qBACViD,EAAW,iBACX/C,EAAY,kBAMZv/D,EAHcd,OAAOM,UAGQQ,eA6DjC+oC,EAAOC,QA7CP,SAAyBjpC,EAAQmmC,EAAOw5B,EAASC,EAAY4C,EAAW9nC,GACtE,IAAI+nC,EAAWrhE,EAAQpB,GACnB0iE,EAAWthE,EAAQ+kC,GACnBw8B,EAASF,EAAWF,EAAWxD,EAAO/+D,GACtC4iE,EAASF,EAAWH,EAAWxD,EAAO54B,GAKtC08B,GAHJF,EAASA,GAAUrD,EAAUE,EAAYmD,IAGhBnD,EACrBsD,GAHJF,EAASA,GAAUtD,EAAUE,EAAYoD,IAGhBpD,EACrBuD,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa3F,EAASp9D,GAAS,CACjC,IAAKo9D,EAASj3B,GACZ,OAAO,EAETs8B,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAnoC,IAAUA,EAAQ,IAAI8hC,GACdiG,GAAYnF,EAAat9D,GAC7BoiE,EAAYpiE,EAAQmmC,EAAOw5B,EAASC,EAAY4C,EAAW9nC,GAC3D2nC,EAAWriE,EAAQmmC,EAAOw8B,EAAQhD,EAASC,EAAY4C,EAAW9nC,GAExE,KArDyB,EAqDnBilC,GAAiC,CACrC,IAAIqD,EAAeH,GAAY5iE,EAAeC,KAAKF,EAAQ,eACvDijE,EAAeH,GAAY7iE,EAAeC,KAAKimC,EAAO,eAE1D,GAAI68B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAehjE,EAAOM,QAAUN,EAC/CmjE,EAAeF,EAAe98B,EAAM7lC,QAAU6lC,EAGlD,OADAzL,IAAUA,EAAQ,IAAI8hC,GACfgG,EAAUU,EAAcC,EAAcxD,EAASC,EAAYllC,IAGtE,QAAKqoC,IAGLroC,IAAUA,EAAQ,IAAI8hC,GACf8F,EAAatiE,EAAQmmC,EAAOw5B,EAASC,EAAY4C,EAAW9nC,M,eC/ErE,IAAIqkC,EAAS,EAAQ,MACjBkD,EAAe,EAAQ,MAgB3Bj5B,EAAOC,QAJP,SAAmB3oC,GACjB,OAAO2hE,EAAa3hE,IAVT,gBAUmBy+D,EAAOz+D,K,eCdvC,IAAIk8D,EAAQ,EAAQ,MAChB2F,EAAc,EAAQ,KA4D1Bn5B,EAAOC,QA5CP,SAAqBjpC,EAAQo4C,EAAQgrB,EAAWxD,GAC9C,IAAIt9B,EAAQ8gC,EAAUnlE,OAClBA,EAASqkC,EACT+gC,GAAgBzD,EAEpB,GAAc,MAAV5/D,EACF,OAAQ/B,EAGV,IADA+B,EAASb,OAAOa,GACTsiC,KAAS,CACd,IAAI/9B,EAAO6+D,EAAU9gC,GACrB,GAAK+gC,GAAgB9+D,EAAK,GAClBA,EAAK,KAAOvE,EAAOuE,EAAK,MACtBA,EAAK,KAAMvE,GAEnB,OAAO,EAGX,OAASsiC,EAAQrkC,GAAQ,CAEvB,IAAIoB,GADJkF,EAAO6+D,EAAU9gC,IACF,GACX47B,EAAWl+D,EAAOX,GAClBikE,EAAW/+D,EAAK,GAEpB,GAAI8+D,GAAgB9+D,EAAK,IACvB,QAAiB5C,IAAbu8D,KAA4B7+D,KAAOW,GACrC,OAAO,MAEJ,CACL,IAAI06B,EAAQ,IAAI8hC,EAChB,GAAIoD,EACF,IAAIlzD,EAASkzD,EAAW1B,EAAUoF,EAAUjkE,EAAKW,EAAQo4C,EAAQ1d,GAEnE,UAAiB/4B,IAAX+K,EACEy1D,EAAYmB,EAAUpF,EAAUqF,EAA+C3D,EAAYllC,GAC3FhuB,GAEN,OAAO,GAIb,OAAO,I,SC/CTs8B,EAAOC,QAJP,SAAmB3oC,GACjB,OAAOA,GAAUA,I,eCRnB,IAAI83D,EAAa,EAAQ,MACrBoL,EAAW,EAAQ,MACnBpE,EAAW,EAAQ,MACnBqE,EAAW,EAAQ,KASnBC,EAAe,8BAGfC,EAAYC,SAASnkE,UACrBokE,EAAc1kE,OAAOM,UAGrBqkE,EAAeH,EAAUzgE,SAGzBjD,EAAiB4jE,EAAY5jE,eAG7B8jE,EAAarmC,OAAO,IACtBomC,EAAa5jE,KAAKD,GAAgB6E,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhFkkC,EAAOC,QARP,SAAsB3oC,GACpB,SAAK8+D,EAAS9+D,IAAUkjE,EAASljE,MAGnB83D,EAAW93D,GAASyjE,EAAaL,GAChCtgE,KAAKqgE,EAASnjE,M,eC3C/B,IAAIy+D,EAAS,EAAQ,MACjBkD,EAAe,EAAQ,MAgB3Bj5B,EAAOC,QAJP,SAAmB3oC,GACjB,OAAO2hE,EAAa3hE,IAVT,gBAUmBy+D,EAAOz+D,K,eCdvC,IAAI0hE,EAAa,EAAQ,MACrBgC,EAAW,EAAQ,MACnB/B,EAAe,EAAQ,MA8BvBgC,EAAiB,GACrBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7Bj7B,EAAOC,QALP,SAA0B3oC,GACxB,OAAO2hE,EAAa3hE,IAClB0jE,EAAS1jE,EAAMrC,WAAagmE,EAAejC,EAAW1hE,M,eCxD1D,IAAI4jE,EAAc,EAAQ,MACtBC,EAAsB,EAAQ,MAC9BC,EAAW,EAAQ,MACnBhjE,EAAU,EAAQ,MAClBzB,EAAW,EAAQ,MA0BvBqpC,EAAOC,QAjBP,SAAsB3oC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK8jE,EAEW,iBAAT9jE,EACFc,EAAQd,GACX6jE,EAAoB7jE,EAAM,GAAIA,EAAM,IACpC4jE,EAAY5jE,GAEXX,EAASW,K,cC3BlB,IAAI+jE,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MAMrBrkE,EAHcd,OAAOM,UAGQQ,eAsBjC+oC,EAAOC,QAbP,SAAkBjpC,GAChB,IAAKqkE,EAAYrkE,GACf,OAAOskE,EAAWtkE,GAEpB,IAAI0M,EAAS,GACb,IAAK,IAAIrN,KAAOF,OAAOa,GACjBC,EAAeC,KAAKF,EAAQX,IAAe,eAAPA,GACtCqN,EAAO1K,KAAK3C,GAGhB,OAAOqN,I,cC1BT,IAAI0yD,EAAW,EAAQ,MACnBiF,EAAc,EAAQ,MACtBE,EAAe,EAAQ,MAMvBtkE,EAHcd,OAAOM,UAGQQ,eAwBjC+oC,EAAOC,QAfP,SAAoBjpC,GAClB,IAAKo/D,EAASp/D,GACZ,OAAOukE,EAAavkE,GAEtB,IAAIwkE,EAAUH,EAAYrkE,GACtB0M,EAAS,GAEb,IAAK,IAAIrN,KAAOW,GACD,eAAPX,IAAyBmlE,GAAYvkE,EAAeC,KAAKF,EAAQX,KACrEqN,EAAO1K,KAAK3C,GAGhB,OAAOqN,I,QChBTs8B,EAAOC,QAJP,SAAgB3oC,EAAO6lC,GACrB,OAAO7lC,EAAQ6lC,I,eCVjB,IAAIq6B,EAAW,EAAQ,MACnBiE,EAAc,EAAQ,MAoB1Bz7B,EAAOC,QAVP,SAAiBmZ,EAAYya,GAC3B,IAAIv6B,GAAS,EACT51B,EAAS+3D,EAAYriB,GAAchkD,MAAMgkD,EAAWnkD,QAAU,GAKlE,OAHAuiE,EAASpe,GAAY,SAAS9hD,EAAOjB,EAAK+iD,GACxC11C,IAAS41B,GAASu6B,EAASv8D,EAAOjB,EAAK+iD,MAElC11C,I,eClBT,IAAIg4D,EAAc,EAAQ,MACtBC,EAAe,EAAQ,MACvBC,EAA0B,EAAQ,MAmBtC57B,EAAOC,QAVP,SAAqBmP,GACnB,IAAIgrB,EAAYuB,EAAavsB,GAC7B,OAAwB,GAApBgrB,EAAUnlE,QAAemlE,EAAU,GAAG,GACjCwB,EAAwBxB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASpjE,GACd,OAAOA,IAAWo4C,GAAUssB,EAAY1kE,EAAQo4C,EAAQgrB,M,eCjB5D,IAAIjB,EAAc,EAAQ,KACtBriE,EAAM,EAAQ,MACd+kE,EAAQ,EAAQ,MAChBC,EAAQ,EAAQ,MAChBC,EAAqB,EAAQ,MAC7BH,EAA0B,EAAQ,MAClCtD,EAAQ,EAAQ,KA0BpBt4B,EAAOC,QAZP,SAA6BzwB,EAAM8qD,GACjC,OAAIwB,EAAMtsD,IAASusD,EAAmBzB,GAC7BsB,EAAwBtD,EAAM9oD,GAAO8qD,GAEvC,SAAStjE,GACd,IAAIk+D,EAAWp+D,EAAIE,EAAQwY,GAC3B,YAAqB7W,IAAbu8D,GAA0BA,IAAaoF,EAC3CuB,EAAM7kE,EAAQwY,GACd2pD,EAAYmB,EAAUpF,EAAUqF,M,eC5BxC,IAAI/G,EAAQ,EAAQ,MAChBwI,EAAmB,EAAQ,MAC3B7D,EAAU,EAAQ,MAClB8D,EAAgB,EAAQ,MACxB7F,EAAW,EAAQ,MACnBhB,EAAS,EAAQ,MACjB8G,EAAU,EAAQ,MAmCtBl8B,EAAOC,QAtBP,SAASk8B,EAAUnlE,EAAQo4C,EAAQgtB,EAAUxF,EAAYllC,GACnD16B,IAAWo4C,GAGf+oB,EAAQ/oB,GAAQ,SAASkrB,EAAUjkE,GAEjC,GADAq7B,IAAUA,EAAQ,IAAI8hC,GAClB4C,EAASkE,GACX2B,EAAcjlE,EAAQo4C,EAAQ/4C,EAAK+lE,EAAUD,EAAWvF,EAAYllC,OAEjE,CACH,IAAI2qC,EAAWzF,EACXA,EAAWsF,EAAQllE,EAAQX,GAAMikE,EAAWjkE,EAAM,GAAKW,EAAQo4C,EAAQ1d,QACvE/4B,OAEaA,IAAb0jE,IACFA,EAAW/B,GAEb0B,EAAiBhlE,EAAQX,EAAKgmE,MAE/BjH,K,eCtCL,IAAI4G,EAAmB,EAAQ,MAC3BvG,EAAc,EAAQ,MACtB6G,EAAkB,EAAQ,MAC1B5G,EAAY,EAAQ,KACpBQ,EAAkB,EAAQ,MAC1B/B,EAAc,EAAQ,MACtB/7D,EAAU,EAAQ,MAClBmkE,EAAoB,EAAQ,MAC5BnI,EAAW,EAAQ,MACnBhF,EAAa,EAAQ,MACrBgH,EAAW,EAAQ,MACnBoG,EAAgB,EAAQ,MACxBlI,EAAe,EAAQ,MACvB4H,EAAU,EAAQ,MAClBO,EAAgB,EAAQ,MA+E5Bz8B,EAAOC,QA9DP,SAAuBjpC,EAAQo4C,EAAQ/4C,EAAK+lE,EAAUM,EAAW9F,EAAYllC,GAC3E,IAAIwjC,EAAWgH,EAAQllE,EAAQX,GAC3BikE,EAAW4B,EAAQ9sB,EAAQ/4C,GAC3B6gE,EAAUxlC,EAAM56B,IAAIwjE,GAExB,GAAIpD,EACF8E,EAAiBhlE,EAAQX,EAAK6gE,OADhC,CAIA,IAAImF,EAAWzF,EACXA,EAAW1B,EAAUoF,EAAWjkE,EAAM,GAAKW,EAAQo4C,EAAQ1d,QAC3D/4B,EAEAgkE,OAAwBhkE,IAAb0jE,EAEf,GAAIM,EAAU,CACZ,IAAInI,EAAQp8D,EAAQkiE,GAChB5F,GAAUF,GAASJ,EAASkG,GAC5BsC,GAAWpI,IAAUE,GAAUJ,EAAagG,GAEhD+B,EAAW/B,EACP9F,GAASE,GAAUkI,EACjBxkE,EAAQ88D,GACVmH,EAAWnH,EAEJqH,EAAkBrH,GACzBmH,EAAW3G,EAAUR,GAEdR,GACPiI,GAAW,EACXN,EAAW5G,EAAY6E,GAAU,IAE1BsC,GACPD,GAAW,EACXN,EAAWC,EAAgBhC,GAAU,IAGrC+B,EAAW,GAGNG,EAAclC,IAAanG,EAAYmG,IAC9C+B,EAAWnH,EACPf,EAAYe,GACdmH,EAAWI,EAAcvH,GAEjBkB,EAASlB,KAAa9F,EAAW8F,KACzCmH,EAAWnG,EAAgBoE,KAI7BqC,GAAW,EAGXA,IAEFjrC,EAAMrM,IAAIi1C,EAAU+B,GACpBK,EAAUL,EAAU/B,EAAU8B,EAAUxF,EAAYllC,GACpDA,EAAc,OAAE4oC,IAElB0B,EAAiBhlE,EAAQX,EAAKgmE,M,eC1FhC,IAAIQ,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClBC,EAAa,EAAQ,MACrBC,EAAY,EAAQ,MACpBC,EAAkB,EAAQ,MAC1B/B,EAAW,EAAQ,MACnBhjE,EAAU,EAAQ,MAwCtB4nC,EAAOC,QA7BP,SAAqBmZ,EAAYgkB,EAAWC,GAExCD,EADEA,EAAUnoE,OACA4nE,EAASO,GAAW,SAASvJ,GACvC,OAAIz7D,EAAQy7D,GACH,SAASv8D,GACd,OAAOwlE,EAAQxlE,EAA2B,IAApBu8D,EAAS5+D,OAAe4+D,EAAS,GAAKA,IAGzDA,KAGG,CAACuH,GAGf,IAAI9hC,GAAS,EACb8jC,EAAYP,EAASO,EAAWF,EAAUH,IAE1C,IAAIr5D,EAASs5D,EAAQ5jB,GAAY,SAAS9hD,EAAOjB,EAAK+iD,GAIpD,MAAO,CAAE,SAHMyjB,EAASO,GAAW,SAASvJ,GAC1C,OAAOA,EAASv8D,MAEa,QAAWgiC,EAAO,MAAShiC,MAG5D,OAAO2lE,EAAWv5D,GAAQ,SAAS1M,EAAQmmC,GACzC,OAAOggC,EAAgBnmE,EAAQmmC,EAAOkgC,Q,eC5C1C,IAAIC,EAAa,EAAQ,MACrBzB,EAAQ,EAAQ,MAiBpB77B,EAAOC,QANP,SAAkBjpC,EAAQumE,GACxB,OAAOD,EAAWtmE,EAAQumE,GAAO,SAASjmE,EAAOkY,GAC/C,OAAOqsD,EAAM7kE,EAAQwY,Q,eCdzB,IAAIstD,EAAU,EAAQ,MAClBU,EAAU,EAAQ,KAClBnF,EAAW,EAAQ,MA2BvBr4B,EAAOC,QAhBP,SAAoBjpC,EAAQumE,EAAOzJ,GAKjC,IAJA,IAAIx6B,GAAS,EACTrkC,EAASsoE,EAAMtoE,OACfyO,EAAS,KAEJ41B,EAAQrkC,GAAQ,CACvB,IAAIua,EAAO+tD,EAAMjkC,GACbhiC,EAAQwlE,EAAQ9lE,EAAQwY,GAExBskD,EAAUx8D,EAAOkY,IACnBguD,EAAQ95D,EAAQ20D,EAAS7oD,EAAMxY,GAASM,GAG5C,OAAOoM,I,QCbTs8B,EAAOC,QANP,SAAsB5pC,GACpB,OAAO,SAASW,GACd,OAAiB,MAAVA,OAAiB2B,EAAY3B,EAAOX,M,eCT/C,IAAIymE,EAAU,EAAQ,MAetB98B,EAAOC,QANP,SAA0BzwB,GACxB,OAAO,SAASxY,GACd,OAAO8lE,EAAQ9lE,EAAQwY,M,OCV3B,IAAIiuD,EAAax9D,KAAKkd,KAClBugD,EAAYz9D,KAAKijB,IAyBrB8c,EAAOC,QAZP,SAAmB/yB,EAAOC,EAAK8rB,EAAM6+B,GAKnC,IAJA,IAAIx+B,GAAS,EACTrkC,EAASyoE,EAAUD,GAAYtwD,EAAMD,IAAU+rB,GAAQ,IAAK,GAC5Dv1B,EAAStO,MAAMH,GAEZA,KACLyO,EAAOo0D,EAAY7iE,IAAWqkC,GAASpsB,EACvCA,GAAS+rB,EAEX,OAAOv1B,I,QCFTs8B,EAAOC,QATP,SAAoBmZ,EAAYya,EAAUgB,EAAaC,EAAW6I,GAMhE,OALAA,EAASvkB,GAAY,SAAS9hD,EAAOgiC,EAAO8f,GAC1Cyb,EAAcC,GACTA,GAAY,EAAOx9D,GACpBu8D,EAASgB,EAAav9D,EAAOgiC,EAAO8f,MAEnCyb,I,eCnBT,IAAIuG,EAAW,EAAQ,MACnBwC,EAAW,EAAQ,MACnBC,EAAc,EAAQ,IAc1B79B,EAAOC,QAJP,SAAkB/gB,EAAMhS,GACtB,OAAO2wD,EAAYD,EAAS1+C,EAAMhS,EAAOkuD,GAAWl8C,EAAO,M,cCb7D,IAAIo2C,EAAc,EAAQ,MACtB+C,EAAW,EAAQ,MACnBhE,EAAU,EAAQ,MAClB+B,EAAW,EAAQ,MACnBkC,EAAQ,EAAQ,KA8CpBt4B,EAAOC,QAlCP,SAAiBjpC,EAAQwY,EAAMlY,EAAOs/D,GACpC,IAAKR,EAASp/D,GACZ,OAAOA,EAST,IALA,IAAIsiC,GAAS,EACTrkC,GAHJua,EAAO6oD,EAAS7oD,EAAMxY,IAGJ/B,OACd6oE,EAAY7oE,EAAS,EACrB8oE,EAAS/mE,EAEI,MAAV+mE,KAAoBzkC,EAAQrkC,GAAQ,CACzC,IAAIoB,EAAMiiE,EAAM9oD,EAAK8pB,IACjB+iC,EAAW/kE,EAEf,GAAY,cAARjB,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOW,EAGT,GAAIsiC,GAASwkC,EAAW,CACtB,IAAI5I,EAAW6I,EAAO1nE,QAELsC,KADjB0jE,EAAWzF,EAAaA,EAAW1B,EAAU7+D,EAAK0nE,QAAUplE,KAE1D0jE,EAAWjG,EAASlB,GAChBA,EACCb,EAAQ7kD,EAAK8pB,EAAQ,IAAM,GAAK,IAGzCg8B,EAAYyI,EAAQ1nE,EAAKgmE,GACzB0B,EAASA,EAAO1nE,GAElB,OAAOW,I,eC/CT,IAAIiuC,EAAW,EAAQ,MACnB7uC,EAAiB,EAAQ,MACzBglE,EAAW,EAAQ,MAUnB4C,EAAmB5nE,EAA4B,SAAS8oB,EAAM++C,GAChE,OAAO7nE,EAAe8oB,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAAS+lB,EAASg5B,GAClB,UAAY,KALwB7C,EASxCp7B,EAAOC,QAAU+9B,G,SCDjBh+B,EAAOC,QAVP,SAAoB2zB,EAAOsK,GACzB,IAAIjpE,EAAS2+D,EAAM3+D,OAGnB,IADA2+D,EAAMnkB,KAAKyuB,GACJjpE,KACL2+D,EAAM3+D,GAAU2+D,EAAM3+D,GAAQqC,MAEhC,OAAOs8D,I,SCET5zB,EAAOC,QAVP,SAAmBhmC,EAAG45D,GAIpB,IAHA,IAAIv6B,GAAS,EACT51B,EAAStO,MAAM6E,KAEVq/B,EAAQr/B,GACfyJ,EAAO41B,GAASu6B,EAASv6B,GAE3B,OAAO51B,I,cChBT,IAAIrL,EAAS,EAAQ,MACjBwkE,EAAW,EAAQ,MACnBzkE,EAAU,EAAQ,MAClBs/D,EAAW,EAAQ,MAMnByG,EAAc9lE,EAASA,EAAO5B,eAAYkC,EAC1CylE,EAAiBD,EAAcA,EAAYjkE,cAAWvB,EA0B1DqnC,EAAOC,QAhBP,SAASo+B,EAAa/mE,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIc,EAAQd,GAEV,OAAOulE,EAASvlE,EAAO+mE,GAAgB,GAEzC,GAAI3G,EAASpgE,GACX,OAAO8mE,EAAiBA,EAAelnE,KAAKI,GAAS,GAEvD,IAAIoM,EAAUpM,EAAQ,GACtB,MAAkB,KAAVoM,GAAkB,EAAIpM,IA3BjB,IA2BwC,KAAOoM,I,eCjC9D,IAAI46D,EAAkB,EAAQ,MAG1BC,EAAc,OAelBv+B,EAAOC,QANP,SAAkBg+B,GAChB,OAAOA,EACHA,EAAO3kE,MAAM,EAAGglE,EAAgBL,GAAU,GAAGniE,QAAQyiE,EAAa,IAClEN,I,SCFNj+B,EAAOC,QANP,SAAmB/gB,GACjB,OAAO,SAAS5nB,GACd,OAAO4nB,EAAK5nB,M,eCThB,IAAI27D,EAAW,EAAQ,MACnBuL,EAAgB,EAAQ,MACxBC,EAAoB,EAAQ,MAC5BC,EAAW,EAAQ,MACnBC,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MAkEzB5+B,EAAOC,QApDP,SAAkB2zB,EAAOC,EAAUI,GACjC,IAAI36B,GAAS,EACTjrB,EAAWmwD,EACXvpE,EAAS2+D,EAAM3+D,OACf0nE,GAAW,EACXj5D,EAAS,GACTm7D,EAAOn7D,EAEX,GAAIuwD,EACF0I,GAAW,EACXtuD,EAAWowD,OAER,GAAIxpE,GAvBY,IAuBgB,CACnC,IAAIowB,EAAMwuC,EAAW,KAAO8K,EAAU/K,GACtC,GAAIvuC,EACF,OAAOu5C,EAAWv5C,GAEpBs3C,GAAW,EACXtuD,EAAWqwD,EACXG,EAAO,IAAI5L,OAGX4L,EAAOhL,EAAW,GAAKnwD,EAEzBo7D,EACA,OAASxlC,EAAQrkC,GAAQ,CACvB,IAAIqC,EAAQs8D,EAAMt6B,GACds+B,EAAW/D,EAAWA,EAASv8D,GAASA,EAG5C,GADAA,EAAS28D,GAAwB,IAAV38D,EAAeA,EAAQ,EAC1CqlE,GAAY/E,GAAaA,EAAU,CAErC,IADA,IAAImH,EAAYF,EAAK5pE,OACd8pE,KACL,GAAIF,EAAKE,KAAenH,EACtB,SAASkH,EAGTjL,GACFgL,EAAK7lE,KAAK4+D,GAEZl0D,EAAO1K,KAAK1B,QAEJ+W,EAASwwD,EAAMjH,EAAU3D,KAC7B4K,IAASn7D,GACXm7D,EAAK7lE,KAAK4+D,GAEZl0D,EAAO1K,KAAK1B,IAGhB,OAAOoM,I,eCpET,IAAIm5D,EAAW,EAAQ,MAkBvB78B,EAAOC,QANP,SAAoBjpC,EAAQlB,GAC1B,OAAO+mE,EAAS/mE,GAAO,SAASO,GAC9B,OAAOW,EAAOX,Q,SCQlB2pC,EAAOC,QAbP,SAAuBnqC,EAAOihC,EAAQioC,GAMpC,IALA,IAAI1lC,GAAS,EACTrkC,EAASa,EAAMb,OACfgqE,EAAaloC,EAAO9hC,OACpByO,EAAS,KAEJ41B,EAAQrkC,GAAQ,CACvB,IAAIqC,EAAQgiC,EAAQ2lC,EAAaloC,EAAOuC,QAAS3gC,EACjDqmE,EAAWt7D,EAAQ5N,EAAMwjC,GAAQhiC,GAEnC,OAAOoM,I,SCPTs8B,EAAOC,QAJP,SAAkBi/B,EAAO7oE,GACvB,OAAO6oE,EAAM1/C,IAAInpB,K,eCTnB,IAAI+kE,EAAW,EAAQ,MAavBp7B,EAAOC,QAJP,SAAsB3oC,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ8jE,I,eCV9C,IAAIhjE,EAAU,EAAQ,MAClB0jE,EAAQ,EAAQ,MAChBqD,EAAe,EAAQ,MACvBjlE,EAAW,EAAQ,MAiBvB8lC,EAAOC,QAPP,SAAkB3oC,EAAON,GACvB,OAAIoB,EAAQd,GACHA,EAEFwkE,EAAMxkE,EAAON,GAAU,CAACM,GAAS6nE,EAAajlE,EAAS5C,M,eCjBhE,IAAIm8D,EAAa,EAAQ,MAezBzzB,EAAOC,QANP,SAA0Bm/B,GACxB,IAAI17D,EAAS,IAAI07D,EAAYrnE,YAAYqnE,EAAYC,YAErD,OADA,IAAI5L,EAAW/vD,GAAQ2hB,IAAI,IAAIouC,EAAW2L,IACnC17D,I,0BCZT,IAAI05B,EAAO,EAAQ,MAGfkiC,EAA4Cr/B,IAAYA,EAAQs/B,UAAYt/B,EAG5Eu/B,EAAaF,GAA4Ct/B,IAAWA,EAAOu/B,UAAYv/B,EAMvFy/B,EAHgBD,GAAcA,EAAWv/B,UAAYq/B,EAG5BliC,EAAKqiC,YAAS9mE,EACvC+mE,EAAcD,EAASA,EAAOC,iBAAc/mE,EAqBhDqnC,EAAOC,QAXP,SAAqBj4B,EAAQ6uD,GAC3B,GAAIA,EACF,OAAO7uD,EAAO1O,QAEhB,IAAIrE,EAAS+S,EAAO/S,OAChByO,EAASg8D,EAAcA,EAAYzqE,GAAU,IAAI+S,EAAOjQ,YAAY9C,GAGxE,OADA+S,EAAOg/C,KAAKtjD,GACLA,I,eC/BT,IAAIi8D,EAAmB,EAAQ,MAe/B3/B,EAAOC,QALP,SAAuB2/B,EAAU/I,GAC/B,IAAI7uD,EAAS6uD,EAAS8I,EAAiBC,EAAS53D,QAAU43D,EAAS53D,OACnE,OAAO,IAAI43D,EAAS7nE,YAAYiQ,EAAQ43D,EAASC,WAAYD,EAASP,c,SCXxE,IAAIS,EAAU,OAed9/B,EAAOC,QANP,SAAqB8/B,GACnB,IAAIr8D,EAAS,IAAIq8D,EAAOhoE,YAAYgoE,EAAO3wB,OAAQ0wB,EAAQnrC,KAAKorC,IAEhE,OADAr8D,EAAOo6D,UAAYiC,EAAOjC,UACnBp6D,I,cCbT,IAAIrL,EAAS,EAAQ,MAGjB8lE,EAAc9lE,EAASA,EAAO5B,eAAYkC,EAC1CqnE,EAAgB7B,EAAcA,EAAYxa,aAAUhrD,EAaxDqnC,EAAOC,QAJP,SAAqBjjC,GACnB,OAAOgjE,EAAgB7pE,OAAO6pE,EAAc9oE,KAAK8F,IAAW,K,eCd9D,IAAI2iE,EAAmB,EAAQ,MAe/B3/B,EAAOC,QALP,SAAyBggC,EAAYpJ,GACnC,IAAI7uD,EAAS6uD,EAAS8I,EAAiBM,EAAWj4D,QAAUi4D,EAAWj4D,OACvE,OAAO,IAAIi4D,EAAWloE,YAAYiQ,EAAQi4D,EAAWJ,WAAYI,EAAWhrE,U,eCZ9E,IAAIyiE,EAAW,EAAQ,MAwCvB13B,EAAOC,QA9BP,SAA0B3oC,EAAO6lC,GAC/B,GAAI7lC,IAAU6lC,EAAO,CACnB,IAAI+iC,OAAyBvnE,IAAVrB,EACf6oE,EAAsB,OAAV7oE,EACZ8oE,EAAiB9oE,GAAUA,EAC3B+oE,EAAc3I,EAASpgE,GAEvBgpE,OAAyB3nE,IAAVwkC,EACfojC,EAAsB,OAAVpjC,EACZqjC,EAAiBrjC,GAAUA,EAC3BsjC,EAAc/I,EAASv6B,GAE3B,IAAMojC,IAAcE,IAAgBJ,GAAe/oE,EAAQ6lC,GACtDkjC,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAenpE,EAAQ6lC,GACtDsjC,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,EAGZ,OAAO,I,eCrCT,IAAIE,EAAmB,EAAQ,MA2C/B1gC,EAAOC,QA3BP,SAAyBjpC,EAAQmmC,EAAOkgC,GAOtC,IANA,IAAI/jC,GAAS,EACTqnC,EAAc3pE,EAAO4pE,SACrBC,EAAc1jC,EAAMyjC,SACpB3rE,EAAS0rE,EAAY1rE,OACrB6rE,EAAezD,EAAOpoE,SAEjBqkC,EAAQrkC,GAAQ,CACvB,IAAIyO,EAASg9D,EAAiBC,EAAYrnC,GAAQunC,EAAYvnC,IAC9D,GAAI51B,EACF,OAAI41B,GAASwnC,EACJp9D,EAGFA,GAAmB,QADd25D,EAAO/jC,IACiB,EAAI,GAU5C,OAAOtiC,EAAOsiC,MAAQ6D,EAAM7D,Q,QCrB9B0G,EAAOC,QAXP,SAAmBmP,EAAQwkB,GACzB,IAAIt6B,GAAS,EACTrkC,EAASm6C,EAAOn6C,OAGpB,IADA2+D,IAAUA,EAAQx+D,MAAMH,MACfqkC,EAAQrkC,GACf2+D,EAAMt6B,GAAS8V,EAAO9V,GAExB,OAAOs6B,I,eChBT,IAAI0B,EAAc,EAAQ,MACtBL,EAAkB,EAAQ,MAsC9Bj1B,EAAOC,QA1BP,SAAoBmP,EAAQt5C,EAAOkB,EAAQ4/D,GACzC,IAAImK,GAAS/pE,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAIsiC,GAAS,EACTrkC,EAASa,EAAMb,SAEVqkC,EAAQrkC,GAAQ,CACvB,IAAIoB,EAAMP,EAAMwjC,GAEZ+iC,EAAWzF,EACXA,EAAW5/D,EAAOX,GAAM+4C,EAAO/4C,GAAMA,EAAKW,EAAQo4C,QAClDz2C,OAEaA,IAAb0jE,IACFA,EAAWjtB,EAAO/4C,IAEhB0qE,EACF9L,EAAgBj+D,EAAQX,EAAKgmE,GAE7B/G,EAAYt+D,EAAQX,EAAKgmE,GAG7B,OAAOrlE,I,eCpCT,IAAIm+D,EAAa,EAAQ,MACrB6L,EAAa,EAAQ,MAczBhhC,EAAOC,QAJP,SAAqBmP,EAAQp4C,GAC3B,OAAOm+D,EAAW/lB,EAAQ4xB,EAAW5xB,GAASp4C,K,eCZhD,IAAIm+D,EAAa,EAAQ,MACrB8L,EAAe,EAAQ,MAc3BjhC,EAAOC,QAJP,SAAuBmP,EAAQp4C,GAC7B,OAAOm+D,EAAW/lB,EAAQ6xB,EAAa7xB,GAASp4C,K,eCZlD,IAGIkqE,EAHO,EAAQ,MAGG,sBAEtBlhC,EAAOC,QAAUihC,G,eCLjB,IAAIC,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MAmC7BphC,EAAOC,QA1BP,SAAwBohC,GACtB,OAAOF,GAAS,SAASnqE,EAAQ4tC,GAC/B,IAAItL,GAAS,EACTrkC,EAAS2vC,EAAQ3vC,OACjB2hE,EAAa3hE,EAAS,EAAI2vC,EAAQ3vC,EAAS,QAAK0D,EAChDgtD,EAAQ1wD,EAAS,EAAI2vC,EAAQ,QAAKjsC,EAWtC,IATAi+D,EAAcyK,EAASpsE,OAAS,GAA0B,mBAAd2hE,GACvC3hE,IAAU2hE,QACXj+D,EAEAgtD,GAASyb,EAAex8B,EAAQ,GAAIA,EAAQ,GAAI+gB,KAClDiR,EAAa3hE,EAAS,OAAI0D,EAAYi+D,EACtC3hE,EAAS,GAEX+B,EAASb,OAAOa,KACPsiC,EAAQrkC,GAAQ,CACvB,IAAIm6C,EAASxK,EAAQtL,GACjB8V,GACFiyB,EAASrqE,EAAQo4C,EAAQ9V,EAAOs9B,GAGpC,OAAO5/D,O,eChCX,IAAIykE,EAAc,EAAQ,MA+B1Bz7B,EAAOC,QArBP,SAAwB09B,EAAU7F,GAChC,OAAO,SAAS1e,EAAYya,GAC1B,GAAkB,MAAdza,EACF,OAAOA,EAET,IAAKqiB,EAAYriB,GACf,OAAOukB,EAASvkB,EAAYya,GAM9B,IAJA,IAAI5+D,EAASmkD,EAAWnkD,OACpBqkC,EAAQw+B,EAAY7iE,GAAU,EAC9BqsE,EAAWnrE,OAAOijD,IAEd0e,EAAYx+B,MAAYA,EAAQrkC,KACa,IAA/C4+D,EAASyN,EAAShoC,GAAQA,EAAOgoC,KAIvC,OAAOloB,K,SCHXpZ,EAAOC,QAjBP,SAAuB63B,GACrB,OAAO,SAAS9gE,EAAQ68D,EAAU0E,GAMhC,IALA,IAAIj/B,GAAS,EACTgoC,EAAWnrE,OAAOa,GAClBlB,EAAQyiE,EAASvhE,GACjB/B,EAASa,EAAMb,OAEZA,KAAU,CACf,IAAIoB,EAAMP,EAAMgiE,EAAY7iE,IAAWqkC,GACvC,IAA+C,IAA3Cu6B,EAASyN,EAASjrE,GAAMA,EAAKirE,GAC/B,MAGJ,OAAOtqE,K,eCpBX,IAAI+lE,EAAe,EAAQ,MACvBtB,EAAc,EAAQ,MACtB1+D,EAAO,EAAQ,MAsBnBijC,EAAOC,QAbP,SAAoBshC,GAClB,OAAO,SAASnoB,EAAY0a,EAAW+D,GACrC,IAAIyJ,EAAWnrE,OAAOijD,GACtB,IAAKqiB,EAAYriB,GAAa,CAC5B,IAAIya,EAAWkJ,EAAajJ,EAAW,GACvC1a,EAAar8C,EAAKq8C,GAClB0a,EAAY,SAASz9D,GAAO,OAAOw9D,EAASyN,EAASjrE,GAAMA,EAAKirE,IAElE,IAAIhoC,EAAQioC,EAAcnoB,EAAY0a,EAAW+D,GACjD,OAAOv+B,GAAS,EAAIgoC,EAASzN,EAAWza,EAAW9f,GAASA,QAAS3gC,K,eCpBzE,IAAI6oE,EAAY,EAAQ,IACpBJ,EAAiB,EAAQ,MACzBK,EAAW,EAAQ,MA2BvBzhC,EAAOC,QAlBP,SAAqB63B,GACnB,OAAO,SAAS5qD,EAAOC,EAAK8rB,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBmoC,EAAel0D,EAAOC,EAAK8rB,KAChE9rB,EAAM8rB,OAAOtgC,GAGfuU,EAAQu0D,EAASv0D,QACLvU,IAARwU,GACFA,EAAMD,EACNA,EAAQ,GAERC,EAAMs0D,EAASt0D,GAEjB8rB,OAAgBtgC,IAATsgC,EAAsB/rB,EAAQC,EAAM,GAAK,EAAKs0D,EAASxoC,GACvDuoC,EAAUt0D,EAAOC,EAAK8rB,EAAM6+B,M,eCzBvC,IAAI59C,EAAM,EAAQ,MACdwnD,EAAO,EAAQ,KACf9C,EAAa,EAAQ,MAYrBD,EAAczkD,GAAQ,EAAI0kD,EAAW,IAAI1kD,EAAI,CAAC,EAAE,KAAK,IAT1C,IASoE,SAAS6c,GAC1F,OAAO,IAAI7c,EAAI6c,IAD2D2qC,EAI5E1hC,EAAOC,QAAU0+B,G,eClBjB,IAAIjN,EAAY,EAAQ,KAEpBt7D,EAAkB,WACpB,IACE,IAAI8oB,EAAOwyC,EAAUv7D,OAAQ,kBAE7B,OADA+oB,EAAK,GAAI,GAAI,IACNA,EACP,MAAO7jB,KALU,GAQrB2kC,EAAOC,QAAU7pC,G,eCVjB,IAAI68D,EAAW,EAAQ,MACnB0O,EAAY,EAAQ,MACpBjD,EAAW,EAAQ,MAiFvB1+B,EAAOC,QA9DP,SAAqB2zB,EAAOz2B,EAAOw5B,EAASC,EAAY4C,EAAW9nC,GACjE,IAAIkwC,EAjBqB,EAiBTjL,EACZkL,EAAYjO,EAAM3+D,OAClB6sE,EAAY3kC,EAAMloC,OAEtB,GAAI4sE,GAAaC,KAAeF,GAAaE,EAAYD,GACvD,OAAO,EAGT,IAAIE,EAAarwC,EAAM56B,IAAI88D,GACvBoO,EAAatwC,EAAM56B,IAAIqmC,GAC3B,GAAI4kC,GAAcC,EAChB,OAAOD,GAAc5kC,GAAS6kC,GAAcpO,EAE9C,IAAIt6B,GAAS,EACT51B,GAAS,EACTm7D,EA/BuB,EA+BflI,EAAoC,IAAI1D,OAAWt6D,EAM/D,IAJA+4B,EAAMrM,IAAIuuC,EAAOz2B,GACjBzL,EAAMrM,IAAI8X,EAAOy2B,KAGRt6B,EAAQuoC,GAAW,CAC1B,IAAII,EAAWrO,EAAMt6B,GACjB4oC,EAAW/kC,EAAM7D,GAErB,GAAIs9B,EACF,IAAIuL,EAAWP,EACXhL,EAAWsL,EAAUD,EAAU3oC,EAAO6D,EAAOy2B,EAAOliC,GACpDklC,EAAWqL,EAAUC,EAAU5oC,EAAOs6B,EAAOz2B,EAAOzL,GAE1D,QAAiB/4B,IAAbwpE,EAAwB,CAC1B,GAAIA,EACF,SAEFz+D,GAAS,EACT,MAGF,GAAIm7D,GACF,IAAK8C,EAAUxkC,GAAO,SAAS+kC,EAAUE,GACnC,IAAK1D,EAASG,EAAMuD,KACfH,IAAaC,GAAY1I,EAAUyI,EAAUC,EAAUvL,EAASC,EAAYllC,IAC/E,OAAOmtC,EAAK7lE,KAAKopE,MAEjB,CACN1+D,GAAS,EACT,YAEG,GACDu+D,IAAaC,IACX1I,EAAUyI,EAAUC,EAAUvL,EAASC,EAAYllC,GACpD,CACLhuB,GAAS,EACT,OAKJ,OAFAguB,EAAc,OAAEkiC,GAChBliC,EAAc,OAAEyL,GACTz5B,I,eChFT,IAAIrL,EAAS,EAAQ,MACjBo7D,EAAa,EAAQ,MACrBzV,EAAK,EAAQ,MACbob,EAAc,EAAQ,MACtBiJ,EAAa,EAAQ,MACrBzD,EAAa,EAAQ,MAqBrBT,EAAc9lE,EAASA,EAAO5B,eAAYkC,EAC1CqnE,EAAgB7B,EAAcA,EAAYxa,aAAUhrD,EAoFxDqnC,EAAOC,QAjEP,SAAoBjpC,EAAQmmC,EAAO65B,EAAKL,EAASC,EAAY4C,EAAW9nC,GACtE,OAAQslC,GACN,IAzBc,oBA0BZ,GAAKhgE,EAAOqoE,YAAcliC,EAAMkiC,YAC3BroE,EAAO6oE,YAAc1iC,EAAM0iC,WAC9B,OAAO,EAET7oE,EAASA,EAAOgR,OAChBm1B,EAAQA,EAAMn1B,OAEhB,IAlCiB,uBAmCf,QAAKhR,EAAOqoE,YAAcliC,EAAMkiC,aAC3B7F,EAAU,IAAI/F,EAAWz8D,GAAS,IAAIy8D,EAAWt2B,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAO6gB,GAAIhnD,GAASmmC,GAEtB,IAxDW,iBAyDT,OAAOnmC,EAAOmD,MAAQgjC,EAAMhjC,MAAQnD,EAAO4nB,SAAWue,EAAMve,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAO5nB,GAAWmmC,EAAQ,GAE5B,IAjES,eAkEP,IAAImlC,EAAUD,EAEhB,IAjES,eAkEP,IAAIT,EA5EiB,EA4ELjL,EAGhB,GAFA2L,IAAYA,EAAU1D,GAElB5nE,EAAOklB,MAAQihB,EAAMjhB,OAAS0lD,EAChC,OAAO,EAGT,IAAI1K,EAAUxlC,EAAM56B,IAAIE,GACxB,GAAIkgE,EACF,OAAOA,GAAW/5B,EAEpBw5B,GAtFuB,EAyFvBjlC,EAAMrM,IAAIruB,EAAQmmC,GAClB,IAAIz5B,EAAS01D,EAAYkJ,EAAQtrE,GAASsrE,EAAQnlC,GAAQw5B,EAASC,EAAY4C,EAAW9nC,GAE1F,OADAA,EAAc,OAAE16B,GACT0M,EAET,IAnFY,kBAoFV,GAAIs8D,EACF,OAAOA,EAAc9oE,KAAKF,IAAWgpE,EAAc9oE,KAAKimC,GAG9D,OAAO,I,eC5GT,IAAI04B,EAAa,EAAQ,MASrB5+D,EAHcd,OAAOM,UAGQQ,eAgFjC+oC,EAAOC,QAjEP,SAAsBjpC,EAAQmmC,EAAOw5B,EAASC,EAAY4C,EAAW9nC,GACnE,IAAIkwC,EAtBqB,EAsBTjL,EACZ4L,EAAW1M,EAAW7+D,GACtBwrE,EAAYD,EAASttE,OAIzB,GAAIutE,GAHW3M,EAAW14B,GACDloC,SAEM2sE,EAC7B,OAAO,EAGT,IADA,IAAItoC,EAAQkpC,EACLlpC,KAAS,CACd,IAAIjjC,EAAMksE,EAASjpC,GACnB,KAAMsoC,EAAYvrE,KAAO8mC,EAAQlmC,EAAeC,KAAKimC,EAAO9mC,IAC1D,OAAO,EAIX,IAAIosE,EAAa/wC,EAAM56B,IAAIE,GACvBgrE,EAAatwC,EAAM56B,IAAIqmC,GAC3B,GAAIslC,GAAcT,EAChB,OAAOS,GAActlC,GAAS6kC,GAAchrE,EAE9C,IAAI0M,GAAS,EACbguB,EAAMrM,IAAIruB,EAAQmmC,GAClBzL,EAAMrM,IAAI8X,EAAOnmC,GAGjB,IADA,IAAI0rE,EAAWd,IACNtoC,EAAQkpC,GAAW,CAE1B,IAAItN,EAAWl+D,EADfX,EAAMksE,EAASjpC,IAEX4oC,EAAW/kC,EAAM9mC,GAErB,GAAIugE,EACF,IAAIuL,EAAWP,EACXhL,EAAWsL,EAAUhN,EAAU7+D,EAAK8mC,EAAOnmC,EAAQ06B,GACnDklC,EAAW1B,EAAUgN,EAAU7rE,EAAKW,EAAQmmC,EAAOzL,GAGzD,UAAmB/4B,IAAbwpE,EACGjN,IAAagN,GAAY1I,EAAUtE,EAAUgN,EAAUvL,EAASC,EAAYllC,GAC7EywC,GACD,CACLz+D,GAAS,EACT,MAEFg/D,IAAaA,EAAkB,eAAPrsE,GAE1B,GAAIqN,IAAWg/D,EAAU,CACvB,IAAIC,EAAU3rE,EAAOe,YACjB6qE,EAAUzlC,EAAMplC,YAGhB4qE,GAAWC,KACV,gBAAiB5rE,MAAU,gBAAiBmmC,IACzB,mBAAXwlC,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDl/D,GAAS,GAKb,OAFAguB,EAAc,OAAE16B,GAChB06B,EAAc,OAAEyL,GACTz5B,I,eCtFT,IAAIshC,EAAU,EAAQ,MAClB44B,EAAW,EAAQ,MACnBC,EAAc,EAAQ,IAa1B79B,EAAOC,QAJP,SAAkB/gB,GAChB,OAAO2+C,EAAYD,EAAS1+C,OAAMvmB,EAAWqsC,GAAU9lB,EAAO,M,eCXhE,IAAI2jD,EAA8B,iBAAV,EAAA7mE,GAAsB,EAAAA,GAAU,EAAAA,EAAO7F,SAAWA,QAAU,EAAA6F,EAEpFgkC,EAAOC,QAAU4iC,G,eCHjB,IAAIC,EAAiB,EAAQ,MACzB9B,EAAa,EAAQ,MACrBjkE,EAAO,EAAQ,MAanBijC,EAAOC,QAJP,SAAoBjpC,GAClB,OAAO8rE,EAAe9rE,EAAQ+F,EAAMikE,K,eCZtC,IAAI8B,EAAiB,EAAQ,MACzB7B,EAAe,EAAQ,MACvB7L,EAAS,EAAQ,MAcrBp1B,EAAOC,QAJP,SAAsBjpC,GACpB,OAAO8rE,EAAe9rE,EAAQo+D,EAAQ6L,K,eCbxC,IAAI8B,EAAY,EAAQ,MAiBxB/iC,EAAOC,QAPP,SAAoB9uB,EAAK9a,GACvB,IAAIkF,EAAO4V,EAAI+hD,SACf,OAAO6P,EAAU1sE,GACbkF,EAAmB,iBAAPlF,EAAkB,SAAW,QACzCkF,EAAK4V,M,eCdX,IAAI4qD,EAAqB,EAAQ,MAC7Bh/D,EAAO,EAAQ,MAsBnBijC,EAAOC,QAbP,SAAsBjpC,GAIpB,IAHA,IAAI0M,EAAS3G,EAAK/F,GACd/B,EAASyO,EAAOzO,OAEbA,KAAU,CACf,IAAIoB,EAAMqN,EAAOzO,GACbqC,EAAQN,EAAOX,GAEnBqN,EAAOzO,GAAU,CAACoB,EAAKiB,EAAOykE,EAAmBzkE,IAEnD,OAAOoM,I,cCpBT,IAAIs/D,EAAe,EAAQ,MACvBC,EAAW,EAAQ,MAevBjjC,EAAOC,QALP,SAAmBjpC,EAAQX,GACzB,IAAIiB,EAAQ2rE,EAASjsE,EAAQX,GAC7B,OAAO2sE,EAAa1rE,GAASA,OAAQqB,I,eCbvC,IAGIuqE,EAHU,EAAQ,KAGHC,CAAQhtE,OAAOgB,eAAgBhB,QAElD6pC,EAAOC,QAAUijC,G,eCLjB,IAAI7qE,EAAS,EAAQ,MAGjBwiE,EAAc1kE,OAAOM,UAGrBQ,EAAiB4jE,EAAY5jE,eAO7BmsE,EAAuBvI,EAAY3gE,SAGnCy+D,EAAiBtgE,EAASA,EAAOugE,iBAAcjgE,EA6BnDqnC,EAAOC,QApBP,SAAmB3oC,GACjB,IAAI+rE,EAAQpsE,EAAeC,KAAKI,EAAOqhE,GACnC3B,EAAM1/D,EAAMqhE,GAEhB,IACErhE,EAAMqhE,QAAkBhgE,EACxB,IAAI2qE,GAAW,EACf,MAAOjoE,IAET,IAAIqI,EAAS0/D,EAAqBlsE,KAAKI,GAQvC,OAPIgsE,IACED,EACF/rE,EAAMqhE,GAAkB3B,SAEjB1/D,EAAMqhE,IAGVj1D,I,eC1CT,IAAI6/D,EAAc,EAAQ,MACtBC,EAAY,EAAQ,KAMpBC,EAHcttE,OAAOM,UAGcgtE,qBAGnCC,EAAmBvtE,OAAOwtE,sBAS1B3C,EAAc0C,EAA+B,SAAS1sE,GACxD,OAAc,MAAVA,EACK,IAETA,EAASb,OAAOa,GACTusE,EAAYG,EAAiB1sE,IAAS,SAASgG,GACpD,OAAOymE,EAAqBvsE,KAAKF,EAAQgG,QANRwmE,EAUrCxjC,EAAOC,QAAU+gC,G,eC7BjB,IAAIjJ,EAAY,EAAQ,MACpBmL,EAAe,EAAQ,MACvBlC,EAAa,EAAQ,MACrBwC,EAAY,EAAQ,KAYpBvC,EATmB9qE,OAAOwtE,sBASqB,SAAS3sE,GAE1D,IADA,IAAI0M,EAAS,GACN1M,GACL+gE,EAAUr0D,EAAQs9D,EAAWhqE,IAC7BA,EAASksE,EAAalsE,GAExB,OAAO0M,GAN8B8/D,EASvCxjC,EAAOC,QAAUghC,G,eCxBjB,IAAIxP,EAAW,EAAQ,MACnBtsC,EAAM,EAAQ,MACd2tC,EAAU,EAAQ,MAClB54C,EAAM,EAAQ,MACdw5C,EAAU,EAAQ,KAClBsF,EAAa,EAAQ,MACrByB,EAAW,EAAQ,KAGnBmJ,EAAS,eAETC,EAAa,mBACbC,EAAS,eACTC,EAAa,mBAEbC,EAAc,oBAGdC,EAAqBxJ,EAAShJ,GAC9ByS,EAAgBzJ,EAASt1C,GACzBg/C,EAAoB1J,EAAS3H,GAC7BsR,EAAgB3J,EAASvgD,GACzBmqD,EAAoB5J,EAAS/G,GAS7BqC,EAASiD,GAGRvH,GAAYsE,EAAO,IAAItE,EAAS,IAAI6S,YAAY,MAAQN,GACxD7+C,GAAO4wC,EAAO,IAAI5wC,IAAQy+C,GAC1B9Q,GAAWiD,EAAOjD,EAAQyR,YAAcV,GACxC3pD,GAAO67C,EAAO,IAAI77C,IAAQ4pD,GAC1BpQ,GAAWqC,EAAO,IAAIrC,IAAYqQ,KACrChO,EAAS,SAASz+D,GAChB,IAAIoM,EAASs1D,EAAW1hE,GACpB0lD,EA/BQ,mBA+BDt5C,EAAsBpM,EAAMS,iBAAcY,EACjD6rE,EAAaxnB,EAAOyd,EAASzd,GAAQ,GAEzC,GAAIwnB,EACF,OAAQA,GACN,KAAKP,EAAoB,OAAOD,EAChC,KAAKE,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAC/B,KAAKO,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAGnC,OAAOrgE,IAIXs8B,EAAOC,QAAU81B,G,SC7CjB/1B,EAAOC,QAJP,SAAkBjpC,EAAQX,GACxB,OAAiB,MAAVW,OAAiB2B,EAAY3B,EAAOX,K,cCT7C,IAAIgiE,EAAW,EAAQ,MACnBlE,EAAc,EAAQ,MACtB/7D,EAAU,EAAQ,MAClBi8D,EAAU,EAAQ,MAClB2G,EAAW,EAAQ,MACnB1C,EAAQ,EAAQ,KAiCpBt4B,EAAOC,QAtBP,SAAiBjpC,EAAQwY,EAAMi1D,GAO7B,IAJA,IAAInrC,GAAS,EACTrkC,GAHJua,EAAO6oD,EAAS7oD,EAAMxY,IAGJ/B,OACdyO,GAAS,IAEJ41B,EAAQrkC,GAAQ,CACvB,IAAIoB,EAAMiiE,EAAM9oD,EAAK8pB,IACrB,KAAM51B,EAAmB,MAAV1M,GAAkBytE,EAAQztE,EAAQX,IAC/C,MAEFW,EAASA,EAAOX,GAElB,OAAIqN,KAAY41B,GAASrkC,EAChByO,KAETzO,EAAmB,MAAV+B,EAAiB,EAAIA,EAAO/B,SAClB+lE,EAAS/lE,IAAWo/D,EAAQh+D,EAAKpB,KACjDmD,EAAQpB,IAAWm9D,EAAYn9D,M,SClCpC,IAWI0tE,EAAehwC,OAAO,uFAa1BsL,EAAOC,QAJP,SAAoBg+B,GAClB,OAAOyG,EAAatqE,KAAK6jE,K,eCtB3B,IAAI0G,EAAe,EAAQ,MAc3B3kC,EAAOC,QALP,WACEzlC,KAAK04D,SAAWyR,EAAeA,EAAa,MAAQ,GACpDnqE,KAAK0hB,KAAO,I,QCKd8jB,EAAOC,QANP,SAAoB5pC,GAClB,IAAIqN,EAASlJ,KAAKglB,IAAInpB,WAAemE,KAAK04D,SAAS78D,GAEnD,OADAmE,KAAK0hB,MAAQxY,EAAS,EAAI,EACnBA,I,eCbT,IAAIihE,EAAe,EAAQ,MASvB1tE,EAHcd,OAAOM,UAGQQ,eAoBjC+oC,EAAOC,QATP,SAAiB5pC,GACf,IAAIkF,EAAOf,KAAK04D,SAChB,GAAIyR,EAAc,CAChB,IAAIjhE,EAASnI,EAAKlF,GAClB,MArBiB,8BAqBVqN,OAA4B/K,EAAY+K,EAEjD,OAAOzM,EAAeC,KAAKqE,EAAMlF,GAAOkF,EAAKlF,QAAOsC,I,eC1BtD,IAAIgsE,EAAe,EAAQ,MAMvB1tE,EAHcd,OAAOM,UAGQQ,eAgBjC+oC,EAAOC,QALP,SAAiB5pC,GACf,IAAIkF,EAAOf,KAAK04D,SAChB,OAAOyR,OAA8BhsE,IAAd4C,EAAKlF,GAAsBY,EAAeC,KAAKqE,EAAMlF,K,eCnB9E,IAAIsuE,EAAe,EAAQ,MAsB3B3kC,EAAOC,QAPP,SAAiB5pC,EAAKiB,GACpB,IAAIiE,EAAOf,KAAK04D,SAGhB,OAFA14D,KAAK0hB,MAAQ1hB,KAAKglB,IAAInpB,GAAO,EAAI,EACjCkF,EAAKlF,GAAQsuE,QAA0BhsE,IAAVrB,EAfV,4BAekDA,EAC9DkD,O,SClBT,IAGIvD,EAHcd,OAAOM,UAGQQ,eAqBjC+oC,EAAOC,QAZP,SAAwB2zB,GACtB,IAAI3+D,EAAS2+D,EAAM3+D,OACfyO,EAAS,IAAIkwD,EAAM77D,YAAY9C,GAOnC,OAJIA,GAA6B,iBAAZ2+D,EAAM,IAAkB38D,EAAeC,KAAK08D,EAAO,WACtElwD,EAAO41B,MAAQs6B,EAAMt6B,MACrB51B,EAAOkhE,MAAQhR,EAAMgR,OAEhBlhE,I,eCtBT,IAAIi8D,EAAmB,EAAQ,MAC3BkF,EAAgB,EAAQ,MACxBC,EAAc,EAAQ,MACtBC,EAAc,EAAQ,KACtBzI,EAAkB,EAAQ,MAwE9Bt8B,EAAOC,QApCP,SAAwBjpC,EAAQggE,EAAKH,GACnC,IAAI7Z,EAAOhmD,EAAOe,YAClB,OAAQi/D,GACN,IA3BiB,uBA4Bf,OAAO2I,EAAiB3oE,GAE1B,IAvCU,mBAwCV,IAvCU,gBAwCR,OAAO,IAAIgmD,GAAMhmD,GAEnB,IAjCc,oBAkCZ,OAAO6tE,EAAc7tE,EAAQ6/D,GAE/B,IAnCa,wBAmCI,IAlCJ,wBAmCb,IAlCU,qBAkCI,IAjCH,sBAiCkB,IAhClB,sBAiCX,IAhCW,sBAgCI,IA/BG,6BA+BmB,IA9BzB,uBA8ByC,IA7BzC,uBA8BV,OAAOyF,EAAgBtlE,EAAQ6/D,GAEjC,IAjDS,eAkDP,OAAO,IAAI7Z,EAEb,IAnDY,kBAoDZ,IAjDY,kBAkDV,OAAO,IAAIA,EAAKhmD,GAElB,IAtDY,kBAuDV,OAAO8tE,EAAY9tE,GAErB,IAxDS,eAyDP,OAAO,IAAIgmD,EAEb,IAzDY,kBA0DV,OAAO+nB,EAAY/tE,M,eCxEzB,IAAIqgE,EAAa,EAAQ,MACrB6L,EAAe,EAAQ,MACvB7H,EAAc,EAAQ,MAe1Br7B,EAAOC,QANP,SAAyBjpC,GACvB,MAAqC,mBAAtBA,EAAOe,aAA8BsjE,EAAYrkE,GAE5D,GADAqgE,EAAW6L,EAAalsE,M,eCb9B,IAAIqB,EAAS,EAAQ,MACjB87D,EAAc,EAAQ,MACtB/7D,EAAU,EAAQ,MAGlB4sE,EAAmB3sE,EAASA,EAAO4sE,wBAAqBtsE,EAc5DqnC,EAAOC,QALP,SAAuB3oC,GACrB,OAAOc,EAAQd,IAAU68D,EAAY78D,OAChC0tE,GAAoB1tE,GAASA,EAAM0tE,M,SCf1C,IAGIE,EAAW,mBAoBfllC,EAAOC,QAVP,SAAiB3oC,EAAOrC,GACtB,IAAI2F,SAActD,EAGlB,SAFArC,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAAR2F,GACU,UAARA,GAAoBsqE,EAAS9qE,KAAK9C,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQrC,I,eCrBjD,IAAI+oD,EAAK,EAAQ,MACbyd,EAAc,EAAQ,MACtBpH,EAAU,EAAQ,MAClB+B,EAAW,EAAQ,MA0BvBp2B,EAAOC,QAdP,SAAwB3oC,EAAOgiC,EAAOtiC,GACpC,IAAKo/D,EAASp/D,GACZ,OAAO,EAET,IAAI4D,SAAc0+B,EAClB,SAAY,UAAR1+B,EACK6gE,EAAYzkE,IAAWq9D,EAAQ/6B,EAAOtiC,EAAO/B,QACrC,UAAR2F,GAAoB0+B,KAAStiC,IAE7BgnD,EAAGhnD,EAAOsiC,GAAQhiC,K,eCxB7B,IAAIc,EAAU,EAAQ,MAClBs/D,EAAW,EAAQ,MAGnByN,EAAe,mDACfC,EAAgB,QAuBpBplC,EAAOC,QAbP,SAAe3oC,EAAON,GACpB,GAAIoB,EAAQd,GACV,OAAO,EAET,IAAIsD,SAActD,EAClB,QAAY,UAARsD,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATtD,IAAiBogE,EAASpgE,KAGvB8tE,EAAchrE,KAAK9C,KAAW6tE,EAAa/qE,KAAK9C,IAC1C,MAAVN,GAAkBM,KAASnB,OAAOa,K,SCXvCgpC,EAAOC,QAPP,SAAmB3oC,GACjB,IAAIsD,SAActD,EAClB,MAAgB,UAARsD,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVtD,EACU,OAAVA,I,eCXP,IAIM+tE,EAJFnE,EAAa,EAAQ,MAGrBoE,GACED,EAAM,SAAS1wC,KAAKusC,GAAcA,EAAWnkE,MAAQmkE,EAAWnkE,KAAKwoE,UAAY,KACvE,iBAAmBF,EAAO,GAc1CrlC,EAAOC,QAJP,SAAkB/gB,GAChB,QAASomD,GAAeA,KAAcpmD,I,SCfxC,IAAI27C,EAAc1kE,OAAOM,UAgBzBupC,EAAOC,QAPP,SAAqB3oC,GACnB,IAAI0lD,EAAO1lD,GAASA,EAAMS,YAG1B,OAAOT,KAFqB,mBAAR0lD,GAAsBA,EAAKvmD,WAAcokE,K,eCZ/D,IAAIzE,EAAW,EAAQ,MAcvBp2B,EAAOC,QAJP,SAA4B3oC,GAC1B,OAAOA,GAAUA,IAAU8+D,EAAS9+D,K,SCCtC0oC,EAAOC,QALP,WACEzlC,KAAK04D,SAAW,GAChB14D,KAAK0hB,KAAO,I,eCTd,IAAIspD,EAAe,EAAQ,MAMvBC,EAHarwE,MAAMqB,UAGCgvE,OA4BxBzlC,EAAOC,QAjBP,SAAyB5pC,GACvB,IAAIkF,EAAOf,KAAK04D,SACZ55B,EAAQksC,EAAajqE,EAAMlF,GAE/B,QAAIijC,EAAQ,IAIRA,GADY/9B,EAAKtG,OAAS,EAE5BsG,EAAK6T,MAELq2D,EAAOvuE,KAAKqE,EAAM+9B,EAAO,KAEzB9+B,KAAK0hB,KACA,M,eC/BT,IAAIspD,EAAe,EAAQ,MAkB3BxlC,EAAOC,QAPP,SAAsB5pC,GACpB,IAAIkF,EAAOf,KAAK04D,SACZ55B,EAAQksC,EAAajqE,EAAMlF,GAE/B,OAAOijC,EAAQ,OAAI3gC,EAAY4C,EAAK+9B,GAAO,K,eCf7C,IAAIksC,EAAe,EAAQ,MAe3BxlC,EAAOC,QAJP,SAAsB5pC,GACpB,OAAOmvE,EAAahrE,KAAK04D,SAAU78D,IAAQ,I,eCZ7C,IAAImvE,EAAe,EAAQ,MAyB3BxlC,EAAOC,QAbP,SAAsB5pC,EAAKiB,GACzB,IAAIiE,EAAOf,KAAK04D,SACZ55B,EAAQksC,EAAajqE,EAAMlF,GAQ/B,OANIijC,EAAQ,KACR9+B,KAAK0hB,KACP3gB,EAAKvC,KAAK,CAAC3C,EAAKiB,KAEhBiE,EAAK+9B,GAAO,GAAKhiC,EAEZkD,O,eCtBT,IAAIw3D,EAAO,EAAQ,MACfO,EAAY,EAAQ,MACpBptC,EAAM,EAAQ,MAkBlB6a,EAAOC,QATP,WACEzlC,KAAK0hB,KAAO,EACZ1hB,KAAK04D,SAAW,CACd,KAAQ,IAAIlB,EACZ,IAAO,IAAK7sC,GAAOotC,GACnB,OAAU,IAAIP,K,eChBlB,IAAI0T,EAAa,EAAQ,MAiBzB1lC,EAAOC,QANP,SAAwB5pC,GACtB,IAAIqN,EAASgiE,EAAWlrE,KAAMnE,GAAa,OAAEA,GAE7C,OADAmE,KAAK0hB,MAAQxY,EAAS,EAAI,EACnBA,I,cCdT,IAAIgiE,EAAa,EAAQ,MAezB1lC,EAAOC,QAJP,SAAqB5pC,GACnB,OAAOqvE,EAAWlrE,KAAMnE,GAAKS,IAAIT,K,eCZnC,IAAIqvE,EAAa,EAAQ,MAezB1lC,EAAOC,QAJP,SAAqB5pC,GACnB,OAAOqvE,EAAWlrE,KAAMnE,GAAKmpB,IAAInpB,K,eCZnC,IAAIqvE,EAAa,EAAQ,MAqBzB1lC,EAAOC,QATP,SAAqB5pC,EAAKiB,GACxB,IAAIiE,EAAOmqE,EAAWlrE,KAAMnE,GACxB6lB,EAAO3gB,EAAK2gB,KAIhB,OAFA3gB,EAAK8pB,IAAIhvB,EAAKiB,GACdkD,KAAK0hB,MAAQ3gB,EAAK2gB,MAAQA,EAAO,EAAI,EAC9B1hB,O,SCDTwlC,EAAOC,QAVP,SAAoB9uB,GAClB,IAAImoB,GAAS,EACT51B,EAAStO,MAAM+b,EAAI+K,MAKvB,OAHA/K,EAAIhV,SAAQ,SAAS7E,EAAOjB,GAC1BqN,IAAS41B,GAAS,CAACjjC,EAAKiB,MAEnBoM,I,SCKTs8B,EAAOC,QAVP,SAAiC5pC,EAAKikE,GACpC,OAAO,SAAStjE,GACd,OAAc,MAAVA,GAGGA,EAAOX,KAASikE,SACP3hE,IAAb2hE,GAA2BjkE,KAAOF,OAAOa,O,eCfhD,IAAI2uE,EAAU,EAAQ,MAyBtB3lC,EAAOC,QAZP,SAAuB/gB,GACrB,IAAIxb,EAASiiE,EAAQzmD,GAAM,SAAS7oB,GAIlC,OAfmB,MAYf6oE,EAAMhjD,MACRgjD,EAAMjN,QAED57D,KAGL6oE,EAAQx7D,EAAOw7D,MACnB,OAAOx7D,I,eCtBT,IAGIihE,EAHY,EAAQ,IAGLjT,CAAUv7D,OAAQ,UAErC6pC,EAAOC,QAAU0kC,G,eCLjB,IAGIrJ,EAHU,EAAQ,KAGL6H,CAAQhtE,OAAO4G,KAAM5G,QAEtC6pC,EAAOC,QAAUq7B,G,SCcjBt7B,EAAOC,QAVP,SAAsBjpC,GACpB,IAAI0M,EAAS,GACb,GAAc,MAAV1M,EACF,IAAK,IAAIX,KAAOF,OAAOa,GACrB0M,EAAO1K,KAAK3C,GAGhB,OAAOqN,I,0BChBT,IAAIm/D,EAAa,EAAQ,MAGrBvD,EAA4Cr/B,IAAYA,EAAQs/B,UAAYt/B,EAG5Eu/B,EAAaF,GAA4Ct/B,IAAWA,EAAOu/B,UAAYv/B,EAMvF4lC,EAHgBpG,GAAcA,EAAWv/B,UAAYq/B,GAGtBuD,EAAWgD,QAG1CC,EAAY,WACd,IAIE,OAFYtG,GAAcA,EAAWuG,SAAWvG,EAAWuG,QAAQ,QAAQC,OAOpEJ,GAAeA,EAAYK,SAAWL,EAAYK,QAAQ,QACjE,MAAO5qE,KAXI,GAcf2kC,EAAOC,QAAU6lC,G,SC5BjB,IAOI1C,EAPcjtE,OAAOM,UAOcyD,SAavC8lC,EAAOC,QAJP,SAAwB3oC,GACtB,OAAO8rE,EAAqBlsE,KAAKI,K,SCJnC0oC,EAAOC,QANP,SAAiB/gB,EAAMhY,GACrB,OAAO,SAASo3B,GACd,OAAOpf,EAAKhY,EAAUo3B,O,eCV1B,IAAIsqB,EAAQ,EAAQ,MAGhB8U,EAAYz9D,KAAKijB,IAgCrB8c,EAAOC,QArBP,SAAkB/gB,EAAMhS,EAAOhG,GAE7B,OADAgG,EAAQwwD,OAAoB/kE,IAAVuU,EAAuBgS,EAAKjqB,OAAS,EAAKiY,EAAO,GAC5D,WAML,IALA,IAAI2pB,EAAO2D,UACPlB,GAAS,EACTrkC,EAASyoE,EAAU7mC,EAAK5hC,OAASiY,EAAO,GACxC0mD,EAAQx+D,MAAMH,KAETqkC,EAAQrkC,GACf2+D,EAAMt6B,GAASzC,EAAK3pB,EAAQosB,GAE9BA,GAAS,EAET,IADA,IAAI4sC,EAAY9wE,MAAM8X,EAAQ,KACrBosB,EAAQpsB,GACfg5D,EAAU5sC,GAASzC,EAAKyC,GAG1B,OADA4sC,EAAUh5D,GAAShG,EAAU0sD,GACtBhL,EAAM1pC,EAAM1kB,KAAM0rE,M,eC/B7B,IAAIrD,EAAa,EAAQ,MAGrBsD,EAA0B,iBAAR7wE,MAAoBA,MAAQA,KAAKa,SAAWA,QAAUb,KAGxE8nC,EAAOylC,GAAcsD,GAAYvL,SAAS,cAATA,GAErC56B,EAAOC,QAAU7C,G,SCYjB4C,EAAOC,QAZP,SAAiBjpC,EAAQX,GACvB,IAAY,gBAARA,GAAgD,mBAAhBW,EAAOX,KAIhC,aAAPA,EAIJ,OAAOW,EAAOX,K,QCChB2pC,EAAOC,QALP,SAAqB3oC,GAEnB,OADAkD,KAAK04D,SAAS7tC,IAAI/tB,EAbC,6BAcZkD,O,SCFTwlC,EAAOC,QAJP,SAAqB3oC,GACnB,OAAOkD,KAAK04D,SAAS1zC,IAAIloB,K,SCO3B0oC,EAAOC,QAVP,SAAoB5a,GAClB,IAAIiU,GAAS,EACT51B,EAAStO,MAAMiwB,EAAInJ,MAKvB,OAHAmJ,EAAIlpB,SAAQ,SAAS7E,GACnBoM,IAAS41B,GAAShiC,KAEboM,I,aCdT,IAAIs6D,EAAkB,EAAQ,MAW1BH,EAVW,EAAQ,KAULuI,CAASpI,GAE3Bh+B,EAAOC,QAAU49B,G,SCZjB,IAIIwI,EAAY9wC,KAAKtoB,IA+BrB+yB,EAAOC,QApBP,SAAkB/gB,GAChB,IAAIgb,EAAQ,EACRosC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQF,IACRG,EApBO,IAoBiBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMtsC,GAzBI,IA0BR,OAAOM,UAAU,QAGnBN,EAAQ,EAEV,OAAOhb,EAAK0pC,WAAMjwD,EAAW6hC,c,eChCjC,IAAI+3B,EAAY,EAAQ,MAcxBvyB,EAAOC,QALP,WACEzlC,KAAK04D,SAAW,IAAIX,EACpB/3D,KAAK0hB,KAAO,I,SCMd8jB,EAAOC,QARP,SAAqB5pC,GACnB,IAAIkF,EAAOf,KAAK04D,SACZxvD,EAASnI,EAAa,OAAElF,GAG5B,OADAmE,KAAK0hB,KAAO3gB,EAAK2gB,KACVxY,I,SCDTs8B,EAAOC,QAJP,SAAkB5pC,GAChB,OAAOmE,KAAK04D,SAASp8D,IAAIT,K,SCG3B2pC,EAAOC,QAJP,SAAkB5pC,GAChB,OAAOmE,KAAK04D,SAAS1zC,IAAInpB,K,eCV3B,IAAIk8D,EAAY,EAAQ,MACpBptC,EAAM,EAAQ,MACd0tC,EAAW,EAAQ,MA+BvB7yB,EAAOC,QAhBP,SAAkB5pC,EAAKiB,GACrB,IAAIiE,EAAOf,KAAK04D,SAChB,GAAI33D,aAAgBg3D,EAAW,CAC7B,IAAIkU,EAAQlrE,EAAK23D,SACjB,IAAK/tC,GAAQshD,EAAMxxE,OAASyxE,IAG1B,OAFAD,EAAMztE,KAAK,CAAC3C,EAAKiB,IACjBkD,KAAK0hB,OAAS3gB,EAAK2gB,KACZ1hB,KAETe,EAAOf,KAAK04D,SAAW,IAAIL,EAAS4T,GAItC,OAFAlrE,EAAK8pB,IAAIhvB,EAAKiB,GACdkD,KAAK0hB,KAAO3gB,EAAK2gB,KACV1hB,O,SCRTwlC,EAAOC,QAZP,SAAuB2zB,EAAOt8D,EAAOugE,GAInC,IAHA,IAAIv+B,EAAQu+B,EAAY,EACpB5iE,EAAS2+D,EAAM3+D,SAEVqkC,EAAQrkC,GACf,GAAI2+D,EAAMt6B,KAAWhiC,EACnB,OAAOgiC,EAGX,OAAQ,I,eCnBV,IAAIy7B,EAAY,EAAQ,MACpB4R,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MAe1B5mC,EAAOC,QANP,SAAoBg+B,GAClB,OAAO0I,EAAW1I,GACd2I,EAAY3I,GACZlJ,EAAUkJ,K,eCdhB,IAAI4I,EAAgB,EAAQ,MAGxBC,EAAa,mGAGbC,EAAe,WASf5H,EAAe0H,GAAc,SAAS5I,GACxC,IAAIv6D,EAAS,GAOb,OAN6B,KAAzBu6D,EAAOjY,WAAW,IACpBtiD,EAAO1K,KAAK,IAEdilE,EAAOniE,QAAQgrE,GAAY,SAAS3oC,EAAO6oC,EAAQC,EAAOC,GACxDxjE,EAAO1K,KAAKiuE,EAAQC,EAAUprE,QAAQirE,EAAc,MAASC,GAAU7oC,MAElEz6B,KAGTs8B,EAAOC,QAAUk/B,G,cC1BjB,IAAIzH,EAAW,EAAQ,MAoBvB13B,EAAOC,QARP,SAAe3oC,GACb,GAAoB,iBAATA,GAAqBogE,EAASpgE,GACvC,OAAOA,EAET,IAAIoM,EAAUpM,EAAQ,GACtB,MAAkB,KAAVoM,GAAkB,EAAIpM,IAdjB,IAcwC,KAAOoM,I,QChB9D,IAGIo3D,EAHYF,SAASnkE,UAGIyD,SAqB7B8lC,EAAOC,QAZP,SAAkB/gB,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO47C,EAAa5jE,KAAKgoB,GACzB,MAAO7jB,IACT,IACE,OAAQ6jB,EAAO,GACf,MAAO7jB,KAEX,MAAO,K,SCrBT,IAAI8rE,EAAe,KAiBnBnnC,EAAOC,QAPP,SAAyBg+B,GAGvB,IAFA,IAAI3kC,EAAQ2kC,EAAOhpE,OAEZqkC,KAAW6tC,EAAa/sE,KAAK6jE,EAAO7hB,OAAO9iB,MAClD,OAAOA,I,SCdT,IASI8tC,EAAU,kDACVC,EAAS,2BAETC,EAAc,qBACdC,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAO1BK,KACXC,EAAW,oBAEXC,EAAQD,EAAWF,EADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAYhkC,KAAK,KAAO,IAAMmkC,EAAWF,EAAW,KAElHI,EAAW,MAAQ,CAACP,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAd3D,qBAciFhkC,KAAK,KAAO,IAGxGskC,EAAYpzC,OAAO2yC,EAAS,MAAQA,EAAS,KAAOQ,EAAWD,EAAO,KAiB1E5nC,EAAOC,QARP,SAAqBg+B,GAEnB,IADA,IAAIv6D,EAASokE,EAAUhK,UAAY,EAC5BgK,EAAU1tE,KAAK6jE,MAClBv6D,EAEJ,OAAOA,I,eCxCT,IAAIgzD,EAAY,EAAQ,MAmCxB12B,EAAOC,QAJP,SAAe3oC,GACb,OAAOo/D,EAAUp/D,EA7BM,K,cCHzB,IAAIo/D,EAAY,EAAQ,MA4BxB12B,EAAOC,QAJP,SAAmB3oC,GACjB,OAAOo/D,EAAUp/D,EAAOywE,K,SCA1B/nC,EAAOC,QANP,SAAkB3oC,GAChB,OAAO,WACL,OAAOA,K,eCrBX,IAAI6pE,EAAW,EAAQ,MACnBnjB,EAAK,EAAQ,MACbojB,EAAiB,EAAQ,MACzBhM,EAAS,EAAQ,MAGjByF,EAAc1kE,OAAOM,UAGrBQ,EAAiB4jE,EAAY5jE,eAuB7BwvC,EAAW06B,GAAS,SAASnqE,EAAQ4tC,GACvC5tC,EAASb,OAAOa,GAEhB,IAAIsiC,GAAS,EACTrkC,EAAS2vC,EAAQ3vC,OACjB0wD,EAAQ1wD,EAAS,EAAI2vC,EAAQ,QAAKjsC,EAMtC,IAJIgtD,GAASyb,EAAex8B,EAAQ,GAAIA,EAAQ,GAAI+gB,KAClD1wD,EAAS,KAGFqkC,EAAQrkC,GAMf,IALA,IAAIm6C,EAASxK,EAAQtL,GACjBxjC,EAAQs/D,EAAOhmB,GACf44B,GAAc,EACdC,EAAcnyE,EAAMb,SAEf+yE,EAAaC,GAAa,CACjC,IAAI5xE,EAAMP,EAAMkyE,GACZ1wE,EAAQN,EAAOX,SAELsC,IAAVrB,GACC0mD,EAAG1mD,EAAOujE,EAAYxkE,MAAUY,EAAeC,KAAKF,EAAQX,MAC/DW,EAAOX,GAAO+4C,EAAO/4C,IAK3B,OAAOW,KAGTgpC,EAAOC,QAAUwG,G,eC/DjBzG,EAAOC,QAAU,EAAjB,O,SCoCAD,EAAOC,QAJP,SAAY3oC,EAAO6lC,GACjB,OAAO7lC,IAAU6lC,GAAU7lC,GAAUA,GAAS6lC,GAAUA,I,eCjC1D,IAAIomC,EAAc,EAAQ,MACtB2E,EAAa,EAAQ,KACrBnL,EAAe,EAAQ,MACvB3kE,EAAU,EAAQ,MAgDtB4nC,EAAOC,QALP,SAAgBmZ,EAAY0a,GAE1B,OADW17D,EAAQghD,GAAcmqB,EAAc2E,GACnC9uB,EAAY2jB,EAAajJ,EAAW,M,eChDlD,IAuCIxpB,EAvCa,EAAQ,KAuCd69B,CAtCK,EAAQ,MAwCxBnoC,EAAOC,QAAUqK,G,cCzCjB,IAAIuuB,EAAgB,EAAQ,MACxBkE,EAAe,EAAQ,MACvBqL,EAAY,EAAQ,KAGpB1K,EAAYz9D,KAAKijB,IAiDrB8c,EAAOC,QAZP,SAAmB2zB,EAAOE,EAAW+D,GACnC,IAAI5iE,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIqkC,EAAqB,MAAbu+B,EAAoB,EAAIuQ,EAAUvQ,GAI9C,OAHIv+B,EAAQ,IACVA,EAAQokC,EAAUzoE,EAASqkC,EAAO,IAE7Bu/B,EAAcjF,EAAOmJ,EAAajJ,EAAW,GAAIx6B,K,eCnD1D,IAAI2+B,EAAc,EAAQ,MAqB1Bj4B,EAAOC,QALP,SAAiB2zB,GAEf,OADsB,MAATA,GAAoBA,EAAM3+D,OACvBgjE,EAAYrE,EAAO,GAAK,K,eClB1C,IAAIyB,EAAY,EAAQ,MACpBmC,EAAW,EAAQ,MACnB6Q,EAAe,EAAQ,MACvBjwE,EAAU,EAAQ,MAqCtB4nC,EAAOC,QALP,SAAiBmZ,EAAYya,GAE3B,OADWz7D,EAAQghD,GAAcic,EAAYmC,GACjCpe,EAAYivB,EAAaxU,M,eCrCvC,IAAIsE,EAAU,EAAQ,MAClBkQ,EAAe,EAAQ,MACvBjT,EAAS,EAAQ,MAoCrBp1B,EAAOC,QANP,SAAejpC,EAAQ68D,GACrB,OAAiB,MAAV78D,EACHA,EACAmhE,EAAQnhE,EAAQqxE,EAAaxU,GAAWuB,K,eCnC9C,IAAI0H,EAAU,EAAQ,MAgCtB98B,EAAOC,QALP,SAAajpC,EAAQwY,EAAM84D,GACzB,IAAI5kE,EAAmB,MAAV1M,OAAiB2B,EAAYmkE,EAAQ9lE,EAAQwY,GAC1D,YAAkB7W,IAAX+K,EAAuB4kE,EAAe5kE,I,eC7B/C,IAAI6kE,EAAU,EAAQ,MAClBC,EAAU,EAAQ,KAiCtBxoC,EAAOC,QAJP,SAAajpC,EAAQwY,GACnB,OAAiB,MAAVxY,GAAkBwxE,EAAQxxE,EAAQwY,EAAM+4D,K,eC/BjD,IAAIE,EAAY,EAAQ,IACpBD,EAAU,EAAQ,KAgCtBxoC,EAAOC,QAJP,SAAejpC,EAAQwY,GACrB,OAAiB,MAAVxY,GAAkBwxE,EAAQxxE,EAAQwY,EAAMi5D,K,SCVjDzoC,EAAOC,QAJP,SAAkB3oC,GAChB,OAAOA,I,eCjBT,IAAIoxE,EAAkB,EAAQ,MAC1BzP,EAAe,EAAQ,MAGvB4B,EAAc1kE,OAAOM,UAGrBQ,EAAiB4jE,EAAY5jE,eAG7BwsE,EAAuB5I,EAAY4I,qBAoBnCtP,EAAcuU,EAAgB,WAAa,OAAOluC,UAApB,IAAsCkuC,EAAkB,SAASpxE,GACjG,OAAO2hE,EAAa3hE,IAAUL,EAAeC,KAAKI,EAAO,YACtDmsE,EAAqBvsE,KAAKI,EAAO,WAGtC0oC,EAAOC,QAAUk0B,G,SCZjB,IAAI/7D,EAAUhD,MAAMgD,QAEpB4nC,EAAOC,QAAU7nC,G,eCzBjB,IAAIg3D,EAAa,EAAQ,MACrB4L,EAAW,EAAQ,MA+BvBh7B,EAAOC,QAJP,SAAqB3oC,GACnB,OAAgB,MAATA,GAAiB0jE,EAAS1jE,EAAMrC,UAAYm6D,EAAW93D,K,eC7BhE,IAAImkE,EAAc,EAAQ,MACtBxC,EAAe,EAAQ,MA+B3Bj5B,EAAOC,QAJP,SAA2B3oC,GACzB,OAAO2hE,EAAa3hE,IAAUmkE,EAAYnkE,K,0BC7B5C,IAAI8lC,EAAO,EAAQ,MACfurC,EAAY,EAAQ,MAGpBrJ,EAA4Cr/B,IAAYA,EAAQs/B,UAAYt/B,EAG5Eu/B,EAAaF,GAA4Ct/B,IAAWA,EAAOu/B,UAAYv/B,EAMvFy/B,EAHgBD,GAAcA,EAAWv/B,UAAYq/B,EAG5BliC,EAAKqiC,YAAS9mE,EAsBvCy7D,GAnBiBqL,EAASA,EAAOrL,cAAWz7D,IAmBfgwE,EAEjC3oC,EAAOC,QAAUm0B,G,eCrCjB,IAAIwU,EAAW,EAAQ,KACnB7S,EAAS,EAAQ,MACjB5B,EAAc,EAAQ,MACtB/7D,EAAU,EAAQ,MAClBqjE,EAAc,EAAQ,MACtBrH,EAAW,EAAQ,MACnBiH,EAAc,EAAQ,MACtB/G,EAAe,EAAQ,MAUvBr9D,EAHcd,OAAOM,UAGQQ,eA2DjC+oC,EAAOC,QAxBP,SAAiB3oC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAImkE,EAAYnkE,KACXc,EAAQd,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMmuE,QAC1DrR,EAAS98D,IAAUg9D,EAAah9D,IAAU68D,EAAY78D,IAC1D,OAAQA,EAAMrC,OAEhB,IAAI+hE,EAAMjB,EAAOz+D,GACjB,GApDW,gBAoDP0/D,GAnDO,gBAmDUA,EACnB,OAAQ1/D,EAAM4kB,KAEhB,GAAIm/C,EAAY/jE,GACd,OAAQsxE,EAAStxE,GAAOrC,OAE1B,IAAK,IAAIoB,KAAOiB,EACd,GAAIL,EAAeC,KAAKI,EAAOjB,GAC7B,OAAO,EAGX,OAAO,I,eCzET,IAAI2iE,EAAa,EAAQ,MACrB5C,EAAW,EAAQ,MAmCvBp2B,EAAOC,QAVP,SAAoB3oC,GAClB,IAAK8+D,EAAS9+D,GACZ,OAAO,EAIT,IAAI0/D,EAAMgC,EAAW1hE,GACrB,MA5BY,qBA4BL0/D,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,I,SCC/Dh3B,EAAOC,QALP,SAAkB3oC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,mB,eCDvB,IAAIuxE,EAAY,EAAQ,MACpB3L,EAAY,EAAQ,MACpB4I,EAAW,EAAQ,MAGnBgD,EAAYhD,GAAYA,EAAS3P,MAmBjCA,EAAQ2S,EAAY5L,EAAU4L,GAAaD,EAE/C7oC,EAAOC,QAAUk2B,G,SCIjBn2B,EAAOC,QALP,SAAkB3oC,GAChB,IAAIsD,SAActD,EAClB,OAAgB,MAATA,IAA0B,UAARsD,GAA4B,YAARA,K,SCC/ColC,EAAOC,QAJP,SAAsB3oC,GACpB,OAAgB,MAATA,GAAiC,iBAATA,I,eCzBjC,IAAI0hE,EAAa,EAAQ,MACrBkK,EAAe,EAAQ,MACvBjK,EAAe,EAAQ,MAMvB0B,EAAYC,SAASnkE,UACrBokE,EAAc1kE,OAAOM,UAGrBqkE,EAAeH,EAAUzgE,SAGzBjD,EAAiB4jE,EAAY5jE,eAG7B8xE,EAAmBjO,EAAa5jE,KAAKf,QA2CzC6pC,EAAOC,QAbP,SAAuB3oC,GACrB,IAAK2hE,EAAa3hE,IA5CJ,mBA4Cc0hE,EAAW1hE,GACrC,OAAO,EAET,IAAIggE,EAAQ4L,EAAa5rE,GACzB,GAAc,OAAVggE,EACF,OAAO,EAET,IAAIta,EAAO/lD,EAAeC,KAAKogE,EAAO,gBAAkBA,EAAMv/D,YAC9D,MAAsB,mBAARilD,GAAsBA,aAAgBA,GAClD8d,EAAa5jE,KAAK8lD,IAAS+rB,I,eC1D/B,IAAIC,EAAY,EAAQ,MACpB9L,EAAY,EAAQ,MACpB4I,EAAW,EAAQ,MAGnBmD,EAAYnD,GAAYA,EAASzP,MAmBjCA,EAAQ4S,EAAY/L,EAAU+L,GAAaD,EAE/ChpC,EAAOC,QAAUo2B,G,eC1BjB,IAAI2C,EAAa,EAAQ,MACrB5gE,EAAU,EAAQ,MAClB6gE,EAAe,EAAQ,MA2B3Bj5B,EAAOC,QALP,SAAkB3oC,GAChB,MAAuB,iBAATA,IACVc,EAAQd,IAAU2hE,EAAa3hE,IArBrB,mBAqB+B0hE,EAAW1hE,K,eC1B1D,IAAI0hE,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MA2B3Bj5B,EAAOC,QALP,SAAkB3oC,GAChB,MAAuB,iBAATA,GACX2hE,EAAa3hE,IArBF,mBAqBY0hE,EAAW1hE,K,eCzBvC,IAAI4xE,EAAmB,EAAQ,MAC3BhM,EAAY,EAAQ,MACpB4I,EAAW,EAAQ,MAGnBqD,EAAmBrD,GAAYA,EAASxR,aAmBxCA,EAAe6U,EAAmBjM,EAAUiM,GAAoBD,EAEpElpC,EAAOC,QAAUq0B,G,SCLjBt0B,EAAOC,QAJP,SAAqB3oC,GACnB,YAAiBqB,IAAVrB,I,eClBT,IAAI8xE,EAAgB,EAAQ,MACxBR,EAAW,EAAQ,KACnBnN,EAAc,EAAQ,MAkC1Bz7B,EAAOC,QAJP,SAAcjpC,GACZ,OAAOykE,EAAYzkE,GAAUoyE,EAAcpyE,GAAU4xE,EAAS5xE,K,eCjChE,IAAIoyE,EAAgB,EAAQ,MACxBC,EAAa,EAAQ,KACrB5N,EAAc,EAAQ,MA6B1Bz7B,EAAOC,QAJP,SAAgBjpC,GACd,OAAOykE,EAAYzkE,GAAUoyE,EAAcpyE,GAAQ,GAAQqyE,EAAWryE,K,QCTxEgpC,EAAOC,QALP,SAAc2zB,GACZ,IAAI3+D,EAAkB,MAAT2+D,EAAgB,EAAIA,EAAM3+D,OACvC,OAAOA,EAAS2+D,EAAM3+D,EAAS,QAAK0D,I,eChBtC,IAAIkkE,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClB5kE,EAAU,EAAQ,MAiDtB4nC,EAAOC,QALP,SAAamZ,EAAYya,GAEvB,OADWz7D,EAAQghD,GAAcyjB,EAAWG,GAChC5jB,EAAY2jB,EAAalJ,EAAU,M,eCjDjD,IAAIoB,EAAkB,EAAQ,MAC1BsC,EAAa,EAAQ,MACrBwF,EAAe,EAAQ,MAwC3B/8B,EAAOC,QAVP,SAAmBjpC,EAAQ68D,GACzB,IAAInwD,EAAS,GAMb,OALAmwD,EAAWkJ,EAAalJ,EAAU,GAElC0D,EAAWvgE,GAAQ,SAASM,EAAOjB,EAAKW,GACtCi+D,EAAgBvxD,EAAQrN,EAAKw9D,EAASv8D,EAAOjB,EAAKW,OAE7C0M,I,eCvCT,IAAI4lE,EAAe,EAAQ,MACvBC,EAAS,EAAQ,MACjBnO,EAAW,EAAQ,MA0BvBp7B,EAAOC,QANP,SAAa2zB,GACX,OAAQA,GAASA,EAAM3+D,OACnBq0E,EAAa1V,EAAOwH,EAAUmO,QAC9B5wE,I,eCzBN,IAAIk6D,EAAW,EAAQ,MAiDvB,SAAS8S,EAAQzmD,EAAMsqD,GACrB,GAAmB,mBAARtqD,GAAmC,MAAZsqD,GAAuC,mBAAZA,EAC3D,MAAM,IAAI7zE,UAhDQ,uBAkDpB,IAAI8zE,EAAW,WACb,IAAI5yC,EAAO2D,UACPnkC,EAAMmzE,EAAWA,EAAS5gB,MAAMpuD,KAAMq8B,GAAQA,EAAK,GACnDqoC,EAAQuK,EAASvK,MAErB,GAAIA,EAAM1/C,IAAInpB,GACZ,OAAO6oE,EAAMpoE,IAAIT,GAEnB,IAAIqN,EAASwb,EAAK0pC,MAAMpuD,KAAMq8B,GAE9B,OADA4yC,EAASvK,MAAQA,EAAM75C,IAAIhvB,EAAKqN,IAAWw7D,EACpCx7D,GAGT,OADA+lE,EAASvK,MAAQ,IAAKyG,EAAQ+D,OAAS7W,GAChC4W,EAIT9D,EAAQ+D,MAAQ7W,EAEhB7yB,EAAOC,QAAU0lC,G,eCxEjB,IAAIxJ,EAAY,EAAQ,MAkCpBh2B,EAjCiB,EAAQ,KAiCjBwjC,EAAe,SAAS3yE,EAAQo4C,EAAQgtB,GAClDD,EAAUnlE,EAAQo4C,EAAQgtB,MAG5Bp8B,EAAOC,QAAUkG,G,eCtCjB,IAAImjC,EAAe,EAAQ,MACvBM,EAAS,EAAQ,KACjBxO,EAAW,EAAQ,MA0BvBp7B,EAAOC,QANP,SAAa2zB,GACX,OAAQA,GAASA,EAAM3+D,OACnBq0E,EAAa1V,EAAOwH,EAAUwO,QAC9BjxE,I,eCzBN,IAAI2wE,EAAe,EAAQ,MACvBvM,EAAe,EAAQ,MACvB6M,EAAS,EAAQ,KA+BrB5pC,EAAOC,QANP,SAAe2zB,EAAOC,GACpB,OAAQD,GAASA,EAAM3+D,OACnBq0E,EAAa1V,EAAOmJ,EAAalJ,EAAU,GAAI+V,QAC/CjxE,I,QCdNqnC,EAAOC,QAJP,c,eCZA,IAAI7C,EAAO,EAAQ,MAsBnB4C,EAAOC,QAJG,WACR,OAAO7C,EAAK7H,KAAKtoB,Q,eCnBnB,IAAI48D,EAAW,EAAQ,MAoBnBtjC,EAnBW,EAAQ,KAmBZujC,EAAS,SAAS9yE,EAAQumE,GACnC,OAAiB,MAAVvmE,EAAiB,GAAK6yE,EAAS7yE,EAAQumE,MAGhDv9B,EAAOC,QAAUsG,G,eCxBjB,IAAIyuB,EAAe,EAAQ,KACvB+U,EAAmB,EAAQ,MAC3BjO,EAAQ,EAAQ,MAChBxD,EAAQ,EAAQ,KA4BpBt4B,EAAOC,QAJP,SAAkBzwB,GAChB,OAAOssD,EAAMtsD,GAAQwlD,EAAasD,EAAM9oD,IAASu6D,EAAiBv6D,K,eC5BpE,IA2CIwd,EA3Cc,EAAQ,KA2Cdg9C,GAEZhqC,EAAOC,QAAUjT,G,eC7CjB,IAAIi9C,EAAc,EAAQ,MACtBzS,EAAW,EAAQ,MACnBuF,EAAe,EAAQ,MACvBmN,EAAa,EAAQ,KACrB9xE,EAAU,EAAQ,MA8CtB4nC,EAAOC,QAPP,SAAgBmZ,EAAYya,EAAUgB,GACpC,IAAI31C,EAAO9mB,EAAQghD,GAAc6wB,EAAcC,EAC3CpV,EAAYt6B,UAAUvlC,OAAS,EAEnC,OAAOiqB,EAAKk6B,EAAY2jB,EAAalJ,EAAU,GAAIgB,EAAaC,EAAW0C,K,eC/C7E,IAAIoR,EAAW,EAAQ,KACnB7S,EAAS,EAAQ,MACjB0F,EAAc,EAAQ,MACtB0O,EAAW,EAAQ,MACnBC,EAAa,EAAQ,MAyCzBpqC,EAAOC,QAdP,SAAcmZ,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIqiB,EAAYriB,GACd,OAAO+wB,EAAS/wB,GAAcgxB,EAAWhxB,GAAcA,EAAWnkD,OAEpE,IAAI+hE,EAAMjB,EAAO3c,GACjB,MAhCW,gBAgCP4d,GA/BO,gBA+BUA,EACZ5d,EAAWl9B,KAEb0sD,EAASxvB,GAAYnkD,S,eC1C9B,IAAIgjE,EAAc,EAAQ,MACtBoS,EAAc,EAAQ,MACtBlJ,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MA+BzB12B,EAASy2B,GAAS,SAAS/nB,EAAYgkB,GACzC,GAAkB,MAAdhkB,EACF,MAAO,GAET,IAAInkD,EAASmoE,EAAUnoE,OAMvB,OALIA,EAAS,GAAKmsE,EAAehoB,EAAYgkB,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHnoE,EAAS,GAAKmsE,EAAehE,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBiN,EAAYjxB,EAAY6e,EAAYmF,EAAW,GAAI,OAG5Dp9B,EAAOC,QAAUyK,G,QCzBjB1K,EAAOC,QAJP,WACE,MAAO,K,SCFTD,EAAOC,QAJP,WACE,OAAO,I,eCdT,IAAIgjB,EAAW,EAAQ,MAyCvBjjB,EAAOC,QAZP,SAAkB3oC,GAChB,OAAKA,EA3BQ,YA8BbA,EAAQ2rD,EAAS3rD,KACSA,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,I,cC/BjC,IAAImqE,EAAW,EAAQ,MAmCvBzhC,EAAOC,QAPP,SAAmB3oC,GACjB,IAAIoM,EAAS+9D,EAASnqE,GAClBgzE,EAAY5mE,EAAS,EAEzB,OAAOA,GAAWA,EAAU4mE,EAAY5mE,EAAS4mE,EAAY5mE,EAAU,I,eChCzE,IAAI6mE,EAAW,EAAQ,MACnBnU,EAAW,EAAQ,MACnBsB,EAAW,EAAQ,MAMnB8S,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAevvC,SA8CnB4E,EAAOC,QArBP,SAAkB3oC,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIogE,EAASpgE,GACX,OA1CM,IA4CR,GAAI8+D,EAAS9+D,GAAQ,CACnB,IAAI6lC,EAAgC,mBAAjB7lC,EAAMqsD,QAAwBrsD,EAAMqsD,UAAYrsD,EACnEA,EAAQ8+D,EAASj5B,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAAT7lC,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQizE,EAASjzE,GACjB,IAAIwjD,EAAW2vB,EAAWrwE,KAAK9C,GAC/B,OAAQwjD,GAAY4vB,EAAUtwE,KAAK9C,GAC/BqzE,EAAarzE,EAAMgC,MAAM,GAAIwhD,EAAW,EAAI,GAC3C0vB,EAAWpwE,KAAK9C,GAvDb,KAuD6BA,I,eC5DvC,IAAI69D,EAAa,EAAQ,MACrBC,EAAS,EAAQ,MA8BrBp1B,EAAOC,QAJP,SAAuB3oC,GACrB,OAAO69D,EAAW79D,EAAO89D,EAAO99D,M,eC5BlC,IAAI+mE,EAAe,EAAQ,KA2B3Br+B,EAAOC,QAJP,SAAkB3oC,GAChB,OAAgB,MAATA,EAAgB,GAAK+mE,EAAa/mE,K,eCxB3C,IAAI+9D,EAAY,EAAQ,MACpBgC,EAAa,EAAQ,MACrBE,EAAa,EAAQ,MACrBwF,EAAe,EAAQ,MACvBmG,EAAe,EAAQ,MACvB9qE,EAAU,EAAQ,MAClBg8D,EAAW,EAAQ,MACnBhF,EAAa,EAAQ,MACrBgH,EAAW,EAAQ,MACnB9B,EAAe,EAAQ,MAuD3Bt0B,EAAOC,QAvBP,SAAmBjpC,EAAQ68D,EAAUgB,GACnC,IAAIL,EAAQp8D,EAAQpB,GAChB4zE,EAAYpW,GAASJ,EAASp9D,IAAWs9D,EAAat9D,GAG1D,GADA68D,EAAWkJ,EAAalJ,EAAU,GACf,MAAfgB,EAAqB,CACvB,IAAI7X,EAAOhmD,GAAUA,EAAOe,YAE1B88D,EADE+V,EACYpW,EAAQ,IAAIxX,EAAO,GAE1BoZ,EAASp/D,IACFo4D,EAAWpS,GAAQqa,EAAW6L,EAAalsE,IAG3C,GAMlB,OAHC4zE,EAAYvV,EAAYkC,GAAYvgE,GAAQ,SAASM,EAAOgiC,EAAOtiC,GAClE,OAAO68D,EAASgB,EAAav9D,EAAOgiC,EAAOtiC,MAEtC69D,I,eC7DT,IAAIoD,EAAc,EAAQ,MACtBkJ,EAAW,EAAQ,MACnB0J,EAAW,EAAQ,MACnBtO,EAAoB,EAAQ,MAkB5B5M,EAAQwR,GAAS,SAAS2J,GAC5B,OAAOD,EAAS5S,EAAY6S,EAAQ,EAAGvO,GAAmB,OAG5Dv8B,EAAOC,QAAU0vB,G,eCzBjB,IAAIz1D,EAAW,EAAQ,MAGnB6wE,EAAY,EAwBhB/qC,EAAOC,QALP,SAAkBsB,GAChB,IAAIjiC,IAAOyrE,EACX,OAAO7wE,EAASqnC,GAAUjiC,I,eCxB5B,IAAI0rE,EAAa,EAAQ,MACrBjuE,EAAO,EAAQ,MAgCnBijC,EAAOC,QAJP,SAAgBjpC,GACd,OAAiB,MAAVA,EAAiB,GAAKg0E,EAAWh0E,EAAQ+F,EAAK/F,M,eC9BvD,IAAIs+D,EAAc,EAAQ,MACtB2V,EAAgB,EAAQ,MAsB5BjrC,EAAOC,QAJP,SAAmBnqC,EAAOihC,GACxB,OAAOk0C,EAAcn1E,GAAS,GAAIihC,GAAU,GAAIu+B,K,6CCpB3C,IAAI,EAAiB,CAG1B4V,QAAS,MAETrlE,OAAQ,SAERmhE,OAAQ,SAERjtB,UAAW,GAKXoxB,aAAa,EAGbC,WAAY,MCjBd,SAASxjB,IAA2Q,OAA9PA,EAAWzxD,OAAOk6B,QAAU,SAAUx6B,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAS5U,UAAUtlC,GAAI,IAAK,IAAImB,KAAO+4C,EAAcj5C,OAAOM,UAAUQ,eAAeC,KAAKk4C,EAAQ/4C,KAAQR,EAAOQ,GAAO+4C,EAAO/4C,IAAY,OAAOR,IAA2B+yD,MAAMpuD,KAAMggC,WAKzS,IAAI8rB,EAAwB,SAAgBmK,GACjD,GAAIA,EACF,MAAM,IAAI90B,MAAM,uPAGlB,OAAOxlC,OAAOoD,OAAO,IAGvBquD,EAAStB,EAAQ,EAAgB,CAC/B+kB,eCZ0B,CAAC,SAAU,SDarCC,eCX0B,CAAC,SAAU,YAAa,e,gFCHzCC,EAAW,CACpBp+D,KAAK,G,oBCGHq+D,EAAe,CAAC,qBACTC,GAA4B,EAAAC,EAAA,IAF5B,OAE0CF,GAAexjB,IAClE,IAAI,kBACF2jB,GACE3jB,EAKJ,SAASztC,IACP,KAAM/f,gBAAgB+f,GACpB,MAAM,IAAIkjB,YAAY,oDAiY1B,OAvXAljB,EAAK9jB,UAAUuY,SAAW,SAAU48D,GAClC,OAAOpxE,KAAKqxE,UAAU78D,SAAS48D,IAGjCrxD,EAAK9jB,UAAUmE,KAAO,OACtB2f,EAAK9jB,UAAUq1E,QAAS,EACxBvxD,EAAK9jB,UAAUs1E,QAAU,GAUzBxxD,EAAK9jB,UAAUo1E,QAAU,WACvB,IAAIG,EAAOxxE,KAAKyxE,SAASN,EAAmB,IAExC90C,EAAO,GAWX,MAAO,CACL7nB,SATF,SAAkB48D,GAChB,IAAIz9D,EAAIy9D,GAAS,GAIjB,OAkVJ,SAAwBA,GACtB,IAAK,IAAI5uE,KAAU4uE,EACjB,IAAI,QAAeA,EAAO5uE,IACpBA,KAAUuuE,EACZ,MAAM,IAAI5vC,MAAM,sCAAwC3+B,EAAS,2BAxVrEkvE,CAAe/9D,GAER69D,EAAK79D,EAAG0oB,EAPH,SA6BhBtc,EAAK9jB,UAAUw1E,SAAW,SAAUE,EAAMC,GACxC,MAAM,IAAIzwC,MAAM,iDAAmDnhC,KAAKI,OAQ1E2f,EAAK9jB,UAAU0F,QAAU,SAAUuS,GAEjC,MAAM,IAAIitB,MAAM,2CAUlBphB,EAAK9jB,UAAU0a,IAAM,SAAUzC,GAE7B,MAAM,IAAIitB,MAAM,uCAUlBphB,EAAK9jB,UAAU41E,QAAU,SAAU/vE,GACjC,KAAK,EAAAgwE,EAAA,IAAOhwE,GACV,MAAM,IAAI3G,UAAU,wCAGtB,OAAO2G,GAUTie,EAAK9jB,UAAU81E,SAAW,SAAU79D,GAGlCA,EAASlU,KAAM,KAAM,MAErB,SAASgyE,EAAUlwE,EAAMoS,GACvBpS,EAAKH,SAAQ,SAAU2uC,EAAOt7B,EAAMC,GAClCf,EAASo8B,EAAOt7B,EAAMC,GAEtB+8D,EAAU1hC,EAAOp8B,MAIrB89D,CAAUhyE,KAAMkU,IAyBlB6L,EAAK9jB,UAAUyQ,UAAY,SAAUwH,GAYnC,OAXA,SAAS+9D,EAAW3hC,EAAOt7B,EAAMC,GAC/B,IAAIi9D,EAAch+D,EAASo8B,EAAOt7B,EAAMC,GAExC,OAAIi9D,IAAgB5hC,EAEX4hC,EAGF5hC,EAAM35B,IAAIs7D,GAGZA,CAAWjyE,KAAM,KAAM,OAkBhC+f,EAAK9jB,UAAUkR,OAAS,SAAU+G,GAChC,IAAIxS,EAAQ,GAMZ,OALA1B,KAAK+xE,UAAS,SAAUjwE,EAAMkT,EAAMC,GAC9Bf,EAASpS,EAAMkT,EAAMC,IACvBvT,EAAMlD,KAAKsD,MAGRJ,GAQTqe,EAAK9jB,UAAUwwD,MAAQ,WAErB,MAAM,IAAItrB,MAAM,kCAQlBphB,EAAK9jB,UAAU2zC,UAAY,WACzB,OAAO5vC,KAAK2W,KAAI,SAAU7U,GACxB,OAAOA,EAAK8tC,gBAWhB7vB,EAAK9jB,UAAU8nD,OAAS,SAAUphB,GAChC,QAAOA,IAAQ,QAAgB3iC,KAAM2iC,IAmBvC5iB,EAAK9jB,UAAUyD,SAAW,SAAUu2D,GAClC,IAAIkc,EAAenyE,KAAKoyE,iBAAiBnc,GAEzC,YAA4B,IAAjBkc,EACFA,EAGFnyE,KAAKqyE,UAAUpc,IAUxBl2C,EAAK9jB,UAAUmtD,OAAS,WACtB,MAAM,IAAIjoB,MAAM,sDAAwDnhC,KAAKI,OAmB/E2f,EAAK9jB,UAAUq2E,OAAS,SAAUrc,GAChC,IAAIkc,EAAenyE,KAAKoyE,iBAAiBnc,GAEzC,YAA4B,IAAjBkc,EACFA,EAGFnyE,KAAKsyE,OAAOrc,IAUrBl2C,EAAK9jB,UAAUo2E,UAAY,WAEzB,MAAM,IAAIlxC,MAAM,iCAAmCnhC,KAAKI,OAmB1D2f,EAAK9jB,UAAUs2E,MAAQ,SAAUtc,GAC/B,IAAIkc,EAAenyE,KAAKoyE,iBAAiBnc,GAEzC,YAA4B,IAAjBkc,EACFA,EAGFnyE,KAAKwyE,OAAOvc,IAWrBl2C,EAAK9jB,UAAUu2E,OAAS,SAAUvc,GAEhC,MAAM,IAAI90B,MAAM,8BAAgCnhC,KAAKI,OAOvD2f,EAAK9jB,UAAUm2E,iBAAmB,SAAUnc,GAC1C,GAAIA,GAA8B,iBAAZA,EACpB,cAAeA,EAAQwc,SACrB,IAAK,SACL,IAAK,YACH,OAEF,IAAK,WACH,OAAOxc,EAAQwc,QAAQzyE,KAAMi2D,GAE/B,QACE,MAAM,IAAI96D,UAAU,6CAU5B4kB,EAAK9jB,UAAUy2E,cAAgB,WAC7B,OAAO1yE,KAAKI,MAQd2f,EAAK9jB,UAAU02E,WAAa,WAC1B,OAAO3yE,MAmBF+f,IACN,CACD6yD,SAAS,EACTtB,QAAQ,I,UChZN,EAAe,CAAC,QACTuB,GAAiC,EAAA3B,EAAA,IAFjC,YAE+C,GAAe1jB,IACvE,IAAI,KACFztC,GACEytC,EAQJ,SAASslB,EAAUC,GACjB,KAAM/yE,gBAAgB8yE,GACpB,MAAM,IAAI7vC,YAAY,oDAKxB,GAFAjjC,KAAK+yE,MAAQA,GAAS,IAEjBn4E,MAAMgD,QAAQoC,KAAK+yE,SAAW/yE,KAAK+yE,MAAMC,MAAMlB,EAAA,IAClD,MAAM,IAAI32E,UAAU,mCA6JxB,OAzJA23E,EAAU72E,UAAY,IAAI8jB,EAC1B+yD,EAAU72E,UAAUmE,KAAO,YAC3B0yE,EAAU72E,UAAUg3E,aAAc,EAelCH,EAAU72E,UAAUw1E,SAAW,SAAUE,EAAMC,GAC7C,IAAIsB,GAAY,QAAIlzE,KAAK+yE,OAAO,SAAUI,GACxC,OAAOA,EAAK1B,SAASE,EAAMC,MAI7B,GAFsC,UAAvBD,EAAK7lB,OAAOzgD,OAEb,CACZ,IAAIA,EAASsmE,EAAKtmE,OAClB,OAAO,SAAuB+lE,EAAO/0C,EAAM+2C,GACzC,OAAO/nE,GAAO,QAAI6nE,GAAW,SAAUG,GACrC,OAAOA,EAASjC,EAAO/0C,EAAM+2C,QAIjC,OAAO,SAAuBhC,EAAO/0C,EAAM+2C,GACzC,OAAO,QAAIF,GAAW,SAAUG,GAC9B,OAAOA,EAASjC,EAAO/0C,EAAM+2C,QAWrCN,EAAU72E,UAAU0F,QAAU,SAAUuS,GACtC,IAAK,IAAIxZ,EAAI,EAAGA,EAAIsF,KAAK+yE,MAAMt4E,OAAQC,IAErCwZ,EADWlU,KAAK+yE,MAAMr4E,GACP,SAAWA,EAAI,IAAKsF,OAWvC8yE,EAAU72E,UAAU0a,IAAM,SAAUzC,GAGlC,IAFA,IAAI6+D,EAAQ,GAEHr4E,EAAI,EAAGA,EAAIsF,KAAK+yE,MAAMt4E,OAAQC,IACrCq4E,EAAMr4E,GAAKsF,KAAK6xE,QAAQ39D,EAASlU,KAAK+yE,MAAMr4E,GAAI,SAAWA,EAAI,IAAKsF,OAGtE,OAAO,IAAI8yE,EAAUC,IAQvBD,EAAU72E,UAAUwwD,MAAQ,WAC1B,OAAO,IAAIqmB,EAAU9yE,KAAK+yE,MAAMj0E,MAAM,KAUxCg0E,EAAU72E,UAAUo2E,UAAY,SAAUpc,GAIxC,MAAO,IAHKj2D,KAAK+yE,MAAMp8D,KAAI,SAAU7U,GACnC,OAAOA,EAAKpC,SAASu2D,MAEJjtB,KAAK,MAAQ,KAQlC8pC,EAAU72E,UAAUmtD,OAAS,WAC3B,MAAO,CACLkqB,OAAQ,YACRP,MAAO/yE,KAAK+yE,QAYhBD,EAAUS,SAAW,SAAUzjB,GAC7B,OAAO,IAAIgjB,EAAUhjB,EAAKijB,QAU5BD,EAAU72E,UAAUq2E,OAAS,SAAUrc,GAIrC,MAAO,kEAHKj2D,KAAK+yE,MAAMp8D,KAAI,SAAU7U,GACnC,OAAOA,EAAKwwE,OAAOrc,MAE4DjtB,KAAK,yCAA2C,mEASnI8pC,EAAU72E,UAAUu2E,OAAS,SAAUvc,GACrC,IAAItiD,EAAI,mBAcR,OAbA3T,KAAK+yE,MAAMpxE,SAAQ,SAAUG,GACvBA,EAAKixE,MACPp/D,GAAK7R,EAAKixE,MAAMp8D,KAAI,SAAU45B,GAC5B,OAAOA,EAAUgiC,MAAMtc,MACtBjtB,KAAK,KAERr1B,GAAK7R,EAAKywE,MAAMtc,GAIlBtiD,GAAK,UAEPA,GAAK,kBAIAm/D,IACN,CACDF,SAAS,EACTtB,QAAQ,ICpLN,EAAe,CAAC,YAAa,QACtBkC,GAAiC,EAAAtC,EAAA,IAFjC,YAE+C,GAAe1jB,IACvE,IAAI,UACFimB,EAAS,KACT1zD,GACEytC,EAWJ,SAASkmB,EAAUC,GACjB,KAAM3zE,gBAAgB0zE,GACpB,MAAM,IAAIzwC,YAAY,oDAIxB,IAAKroC,MAAMgD,QAAQ+1E,GAAS,MAAM,IAAIxyC,MAAM,kBAC5CnhC,KAAK2zE,OAASA,EAAOh9D,KAAI,SAAUi9D,GACjC,IAAI9xE,EAAO8xE,GAASA,EAAM9xE,KACtBsZ,GAAUw4D,QAA2Bz1E,IAAlBy1E,EAAMx4D,SAAwBw4D,EAAMx4D,QAC3D,KAAK,EAAA02D,EAAA,IAAOhwE,GAAO,MAAM,IAAI3G,UAAU,kCACvC,GAAuB,kBAAZigB,EAAuB,MAAM,IAAIjgB,UAAU,wCACtD,MAAO,CACL2G,KAAMA,EACNsZ,QAASA,MA0Jf,OArJAs4D,EAAUz3E,UAAY,IAAI8jB,EAC1B2zD,EAAUz3E,UAAUmE,KAAO,YAC3BszE,EAAUz3E,UAAU43E,aAAc,EAelCH,EAAUz3E,UAAUw1E,SAAW,SAAUE,EAAMC,GAC7C,IAAIkC,GAAa,QAAI9zE,KAAK2zE,QAAQ,SAAUC,GAC1C,MAAO,CACLp/D,SAAUo/D,EAAM9xE,KAAK2vE,SAASE,EAAMC,GACpCx2D,QAASw4D,EAAMx4D,YAGnB,OAAO,SAAwBg2D,EAAO/0C,EAAM+2C,GAC1C,IAAIn5C,EAAU,GAQd,OAPA,QAAQ65C,GAAY,SAAuBF,GACzC,IAAI1qE,EAAS0qE,EAAMp/D,SAAS48D,EAAO/0C,EAAM+2C,GAErCQ,EAAMx4D,SACR6e,EAAQz7B,KAAK0K,MAGV,IAAIuqE,EAAUx5C,KASzBy5C,EAAUz3E,UAAU0F,QAAU,SAAUuS,GACtC,IAAK,IAAIxZ,EAAI,EAAGA,EAAIsF,KAAK2zE,OAAOl5E,OAAQC,IACtCwZ,EAASlU,KAAK2zE,OAAOj5E,GAAGoH,KAAM,UAAYpH,EAAI,SAAUsF,OAW5D0zE,EAAUz3E,UAAU0a,IAAM,SAAUzC,GAGlC,IAFA,IAAIy/D,EAAS,GAEJj5E,EAAI,EAAGA,EAAIsF,KAAK2zE,OAAOl5E,OAAQC,IAAK,CAC3C,IAAIk5E,EAAQ5zE,KAAK2zE,OAAOj5E,GAEpBoH,EAAO9B,KAAK6xE,QAAQ39D,EAAS0/D,EAAM9xE,KAAM,UAAYpH,EAAI,SAAUsF,OAEvE2zE,EAAOj5E,GAAK,CACVoH,KAAMA,EACNsZ,QAASw4D,EAAMx4D,SAInB,OAAO,IAAIs4D,EAAUC,IAQvBD,EAAUz3E,UAAUwwD,MAAQ,WAO1B,OAAO,IAAIinB,EANE1zE,KAAK2zE,OAAOh9D,KAAI,SAAUi9D,GACrC,MAAO,CACL9xE,KAAM8xE,EAAM9xE,KACZsZ,QAASw4D,EAAMx4D,cAarBs4D,EAAUz3E,UAAUo2E,UAAY,SAAUpc,GACxC,OAAOj2D,KAAK2zE,OAAOh9D,KAAI,SAAUo9D,GAC/B,OAAOA,EAAMjyE,KAAKpC,SAASu2D,IAAY8d,EAAM34D,QAAU,GAAK,QAC3D4tB,KAAK,OAQV0qC,EAAUz3E,UAAUmtD,OAAS,WAC3B,MAAO,CACLkqB,OAAQ,YACRK,OAAQ3zE,KAAK2zE,SAYjBD,EAAUH,SAAW,SAAUzjB,GAC7B,OAAO,IAAI4jB,EAAU5jB,EAAK6jB,SAU5BD,EAAUz3E,UAAUq2E,OAAS,SAAUrc,GACrC,OAAOj2D,KAAK2zE,OAAOh9D,KAAI,SAAUo9D,GAC/B,OAAOA,EAAMjyE,KAAKwwE,OAAOrc,IAAY8d,EAAM34D,QAAU,GAAK,4CACzD4tB,KAAK,+CASV0qC,EAAUz3E,UAAUu2E,OAAS,SAAUvc,GACrC,OAAOj2D,KAAK2zE,OAAOh9D,KAAI,SAAUo9D,GAC/B,OAAOA,EAAMjyE,KAAKywE,MAAMtc,IAAY8d,EAAM34D,QAAU,GAAK,QACxD4tB,KAAK,aAGH0qC,IACN,CACDd,SAAS,EACTtB,QAAQ,I,oBC5LC0C,EAAe,CAExBC,MAAO,IACPjlD,MAAO,UACPklD,KAAM,IACNC,KAAM,SACNC,MAAO,UACPC,MAAO,UACPC,MAAO,UACP/6B,MAAO,UACPg7B,QAAS,IACT7D,QAAS,YACT8D,WAAY,eACZC,KAAM,IACNC,KAAM,SACNC,IAAK,IACLC,IAAK,QACLC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,KAAM,IACNC,KAAM,SACNC,MAAO,IACPpgD,MAAO,UACPqgD,SAAU,aACVC,OAAQ,WACRC,OAAQ,WACRC,GAAI,IACJC,GAAI,OACJC,GAAI,IACJC,GAAI,OACJC,GAAI,OACJxrB,GAAI,OACJyrB,QAAS,IACTC,QAAS,IACTC,GAAI,OACJhqB,GAAI,OACJiqB,MAAO,UACPC,IAAK,IACLC,IAAK,QACLC,OAAQ,WACRC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,IAAK,IACLC,IAAK,QACLC,QAAS,YACTC,QAAS,YACTC,IAAK,QACLC,IAAK,QACLC,OAAQ,WACRC,IAAK,IACLC,IAAK,QACLC,IAAK,QACLC,IAAK,QACLC,MAAO,UACPC,MAAO,UAEPC,KAAM,iBACNC,MAAO,kBAEPz8E,EAAG,IAEH6rD,IAAK,UACL6wB,IAAK,UACLC,SAAU,UACV5yC,SAAU,UACV6yC,GAAI,UACJlhC,IAAK,QACLj4C,UAAW,eAEFo5E,EAAiB,CAC1BC,UAAW,SACXC,WAAY,KACZC,UAAW,IACX9kE,IAAK,IACL+kE,OAAQ,YAERC,UAAW,IACXC,WAAY,IACZC,OAAQ,MAERC,IAAK,QACLprE,SAAU,SACV42C,OAAQ,SAERy0B,YAAa,UAEbC,UAAW,KAEXlxB,IAAK,QACLzsC,IAAK,IACLmvC,SAAU,IACVyuB,GAAI,eACJC,UAAW,KACXC,gBAAiB,KACjBC,cAAe,MACfC,MAAO,IACPC,QAAS,QACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,QACXC,SAAU,QACVC,OAAQ,MACRC,OAAQ,iBACRC,MAAO,IACPC,IAAK,UACLC,IAAK,WACLC,GAAI,SAEKC,EAAiB,CAE1B/tE,IAAK,CACHguE,EAAG,6BAEL7+D,IAAK,CACH8+D,EAAG,oBAAoBl3C,OAAOq1C,EAAej9D,IAAK,uBAEpD2oC,KAAM,CACJk2B,EAAG,yBAELx2D,KAAM,CACJw2D,EAAG,yCAELE,KAAM,CACJF,EAAG,+BAEL51B,OAAQ,CACN61B,EAAG,kCAELnB,UAAW,CACTmB,EAAG,oBAAoBl3C,OAAOq1C,EAAeU,UAAW,uBAE1DD,YAAa,CACXoB,EAAG,oBAAoBl3C,OAAOq1C,EAAeS,YAAa,uBAE5DL,OAAQ,CACNyB,EAAG,oBAAoBl3C,OAAOq1C,EAAeI,OAAQ,uBAEvD70C,IAAK,CACHq2C,EAAG,kCAELh1C,MAAO,WAAWjC,OAAOq1C,EAAe3kE,IAAK,0BAC7C0mE,IAAK,CACHH,EAAG,8CAEL12D,MAAO,CACL02D,EAAG,2CAELnqB,IAAK,8BACL7C,MAAO,gCACP9oB,IAAK,CACH81C,EAAG,gCACHC,EAAG,+CAEL9sB,MAAO,CACL6sB,EAAG,uCAELI,MAAO,CACLJ,EAAG,kCACHC,EAAG,iDAEL/sB,KAAM,qCACNtF,IAAK,CACHqyB,EAAG,oBAAoBl3C,OAAOq1C,EAAexwB,IAAK,uBAEpDp6C,SAAU,CACRysE,EAAG,oBAAoBl3C,OAAOq1C,EAAe5qE,SAAU,uBAEzD6sE,KAAM,CACJL,EAAG,gCACHC,OAAGj7E,GAGLs7E,QAAS,CACPL,EAAG,kCAELM,SAAU,CACRN,EAAG,yCAELxmE,IAAK,CACHwmE,EAAG,4BAA4Bl3C,OAAOq1C,EAAe3kE,IAAK,iBAE5DlN,MAAO,CACLyzE,EAAG,yCACHC,OAAGj7E,GAGLosD,KAAM,CACJ4uB,EAAG,8CAELpvE,KAAM,CACJovE,EAAG,sBAELQ,OAAQ,CACNR,EAAG,+BAEL1vB,SAAU,CACR2vB,EAAG,oBAAoBl3C,OAAOq1C,EAAe9tB,SAAU,uBAEzDouB,WAAY,CACVsB,EAAG,GAAGj3C,OAAOq1C,EAAeM,WAAY,8BAE1CD,UAAW,CACTuB,EAAG,GAAGj3C,OAAOq1C,EAAeK,UAAW,8BAGzCgB,OAAQ,CACNQ,EAAG,oBAAoBl3C,OAAOq1C,EAAeqB,OAAQ,uBAEvDd,OAAQ,CACNqB,EAAG5B,EAAeO,OAAS,6BAE7BgB,MAAO,CACLM,EAAG,oBAAoBl3C,OAAOq1C,EAAeuB,MAAO,uBAEtDD,OAAQ,CACNO,EAAG,oBAAoBl3C,OAAOq1C,EAAesB,OAAQ,uBAEvDV,UAAW,CACTiB,EAAG,oBAAoBl3C,OAAOq1C,EAAeY,UAAW,uBAE1DC,gBAAiB,CACfgB,EAAG,oBAAoBl3C,OAAOq1C,EAAea,gBAAiB,uBAEhEC,cAAe,CACbe,EAAG,oBAAoBl3C,OAAOq1C,EAAec,cAAe,uBAG9DuB,YAAa,CACXT,EAAG,4BAELU,QAAS,CACPV,EAAG,4BAELW,WAAY,CACVV,EAAG,qCAGLt1C,IAAK,CACHq1C,EAAG,kCAELY,KAAM,CACJZ,EAAG,+BAELl1C,GAAI,CACFk1C,EAAG,+CAELn1C,GAAI,CACFm1C,EAAG,+CAGLJ,IAAK,CACHK,EAAG,oBAAoBl3C,OAAOq1C,EAAewB,IAAK,uBAEpDhB,IAAK,CACHoB,EAAG5B,EAAeQ,IAAM,6BAE1BkB,GAAI,CACFG,EAAG,oBAAoBl3C,OAAOq1C,EAAe0B,GAAI,uBAEnDD,IAAK,CACHI,EAAG,oBAAoBl3C,OAAOq1C,EAAeyB,IAAK,uBAGpDgB,MAAO,CACLZ,EAAG,6DAEL3B,WAAY,CACV0B,EAAG,4BAA4Bj3C,OAAOq1C,EAAeE,aAEvDwC,IAAK,CACHd,EAAG,kCAELe,IAAK,CACHd,EAAG,6CAELe,KAAM,CACJhB,EAAG,kCAELiB,IAAK,CACHjB,EAAG,kCAELkB,MAAO,CACLlB,EAAG,eAAej3C,OAAOq1C,EAAe3kE,IAAK,mBAE/C0nE,MAAO,CACLnB,EAAG,yCAEL3B,UAAW,CACT2B,EAAG,4BAA4Bj3C,OAAOq1C,EAAeC,YAGvD+C,aAAc,CACZnB,EAAG,mCAELoB,oBAAqB,CACnBpB,EAAG,gEAEL1B,UAAW,CACTyB,EAAG,4BAA4Bj3C,OAAOq1C,EAAeG,YAEvDrD,MAAO,CACL8E,EAAG,oCAGLb,MAAO,CACLc,EAAG,oBAAoBl3C,OAAOq1C,EAAee,MAAO,uBAEtDG,OAAQ,CACNW,EAAG,oBAAoBl3C,OAAOq1C,EAAekB,OAAQ,uBAEvDE,SAAU,CACRS,EAAG,oBAAoBl3C,OAAOq1C,EAAeoB,SAAU,uBAEzDH,QAAS,CACPY,EAAG,oBAAoBl3C,OAAOq1C,EAAeiB,QAAS,uBAExDE,UAAW,CACTU,EAAG,oBAAoBl3C,OAAOq1C,EAAemB,UAAW,uBAE1DH,QAAS,CACPa,EAAG,oBAAoBl3C,OAAOq1C,EAAegB,QAAS,uBAGxDkC,IAAK,CACHtB,EAAG,gCAGLzwD,IAAK,8BACLF,IAAK,8BACLkyD,SAAU,sCAEV/1C,KAAM,CACJw0C,EAAG,uCAELh0C,MAAO,CACLg0C,EAAG,wCAELwB,KAAM,CACJxB,EAAG,uCAELyB,MAAO,CACLzB,EAAG,wCAEL0B,KAAM,CACJ1B,EAAG,uCAEL2B,MAAO,CACL3B,EAAG,gDAEL4B,KAAM,CACJ5B,EAAG,uCAEL6B,MAAO,CACL7B,EAAG,gDAELv0C,KAAM,CACJu0C,EAAG,uCAELj0C,MAAO,CACLi0C,EAAG,wCAELz0C,KAAM,CACJy0C,EAAG,uCAEL1uE,MAAO,CACL2uE,EAAG,yCAELn0C,MAAO,CACLk0C,EAAG,wCAEL71C,IAAK,CACH61C,EAAG,kCAELt2C,KAAM,CACJs2C,EAAG,mCAEL8B,IAAK,CACH9B,EAAG,kCAEL+B,KAAM,CACJ/B,EAAG,mCAELgC,IAAK,CACHhC,EAAG,kCAELiC,KAAM,CACJjC,EAAG,2CAELkC,IAAK,CACHlC,EAAG,kCAELmC,KAAM,CACJnC,EAAG,2CAEL11C,IAAK,CACH01C,EAAG,kCAELp2C,KAAM,CACJo2C,EAAG,mCAEL1xB,IAAK,CACH0xB,EAAG,kCAELr0B,KAAM,CACJq0B,EAAG,mCAGLjB,GAAI,CACFkB,EAAG,oBAAoBl3C,OAAOq1C,EAAeW,GAAI,uBAGnDqD,QAAS,SAAiBz5E,EAAMm0D,GAE9B,OAAOn0D,EAAKu6B,KAAK,GAAGk2C,SAGtB/F,OAAQ,CACNgP,EAAG,IACHrC,EAAG,4BACHC,EAAG,sDAEL3V,OAAQ,CACN+X,EAAG,eACHrC,EAAG,6CAELsC,UAAW,CACTD,EAAG,IACHrC,EAAG,6BAELuC,QAAS,CACPF,EAAG,IACHrC,EAAG,4BACHC,EAAG,oCAAoCl3C,OAAO8xC,EAAat5E,EAAG,4CAEhE2Q,OAAQ,CACNmwE,EAAG,iCACHrC,EAAG,4BACHC,EAAG,6BAELuC,OAAQ,CACNH,EAAG,iCACHrC,EAAG,6BAEL5zE,KAAM,CACJ4zE,EAAG,4BACHC,EAAG,uDAIHwC,EAAa,CACfC,IAAK,WAEA,SAASC,EAAYrY,GAC1B,OAAO,EAAeA,EAAQ,CAC5B/V,oBAAoB,IAKjB,SAASquB,EAASp8E,EAAMq8E,GAG7B,OAFAA,OAA2B,IAAXA,GAAiCA,IAG3C,QAAeJ,EAAYj8E,GACtBi8E,EAAWj8E,GAGb,YAAcm8E,EAAYn8E,GAAQ,KAGvC,QAAeq0E,EAAcr0E,GACxBq0E,EAAar0E,GAGfm8E,EAAYn8E,GC3drB,IACI,EAAe,CAAC,QACTs8E,GAAoC,EAAA/K,EAAA,IAFpC,eAEkD,GAAe1jB,IAC1E,IAAI,KACFztC,GACEytC,EAcJ,SAAS0uB,EAAap/E,GACpB,KAAMkD,gBAAgBk8E,GACpB,MAAM,IAAIj5C,YAAY,oDAGxBjjC,KAAKlD,MAAQA,EA6Jf,OA1JAo/E,EAAajgF,UAAY,IAAI8jB,EAC7Bm8D,EAAajgF,UAAUmE,KAAO,eAC9B87E,EAAajgF,UAAUkgF,gBAAiB,EAexCD,EAAajgF,UAAUw1E,SAAW,SAAUE,EAAMC,GAChD,IAAI90E,EAAQkD,KAAKlD,MACjB,OAAO,WACL,OAAOA,IASXo/E,EAAajgF,UAAU0F,QAAU,SAAUuS,KAU3CgoE,EAAajgF,UAAU0a,IAAM,SAAUzC,GACrC,OAAOlU,KAAKysD,SAQdyvB,EAAajgF,UAAUwwD,MAAQ,WAC7B,OAAO,IAAIyvB,EAAal8E,KAAKlD,QAS/Bo/E,EAAajgF,UAAUo2E,UAAY,SAAUpc,GAC3C,OAAO,QAAOj2D,KAAKlD,MAAOm5D,IAS5BimB,EAAajgF,UAAUq2E,OAAS,SAAUrc,GACxC,IAAIn5D,EAAQkD,KAAKqyE,UAAUpc,GAE3B,QAAQ,QAAOj2D,KAAKlD,QAClB,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+BA,EAAQ,UAEhD,IAAK,SACH,MAAO,6BAA+BA,EAAQ,UAEhD,IAAK,UACH,MAAO,8BAAgCA,EAAQ,UAEjD,IAAK,OACH,MAAO,kCAAoCA,EAAQ,UAErD,IAAK,YACH,MAAO,gCAAkCA,EAAQ,UAEnD,QACE,MAAO,6BAA+BA,EAAQ,YASpDo/E,EAAajgF,UAAUmtD,OAAS,WAC9B,MAAO,CACLkqB,OAAQ,eACRx2E,MAAOkD,KAAKlD,QAYhBo/E,EAAa3I,SAAW,SAAUzjB,GAChC,OAAO,IAAIosB,EAAapsB,EAAKhzD,QAS/Bo/E,EAAajgF,UAAUu2E,OAAS,SAAUvc,GACxC,IAAIn5D,EAAQkD,KAAKqyE,UAAUpc,GAE3B,QAAQ,QAAOj2D,KAAKlD,QAClB,IAAK,SACH,MAAO,YAAcg/E,EAAYh/E,GAAS,IAE5C,IAAK,SACL,IAAK,YAED,IAAKqjB,SAASngB,KAAKlD,OACjB,OAAOkD,KAAKlD,MAAMqsD,UAAY,EAAI,WAAa,UAGjD,IAAIrqB,EAAQhiC,EAAMogC,cAAclL,QAAQ,KAExC,OAAe,IAAX8M,EACKhiC,EAAMk0B,UAAU,EAAG8N,GAAS,aAAehiC,EAAMk0B,UAAU8N,EAAQ,GAAK,IAG5EhiC,EAET,IAAK,WACH,OAAOkD,KAAKlD,MAAMs/E,UAEpB,QACE,OAAOt/E,IAINo/E,IACN,CACDtJ,SAAS,EACTtB,QAAQ,I,UCtLN,EAAe,CAAC,QACT+K,GAAkC,EAAAnL,EAAA,IAFlC,aAEgD,GAAe1jB,IACxE,IAAI,KACFztC,GACEytC,EAQJ,SAAS8uB,EAAWC,GAClB,KAAMv8E,gBAAgBs8E,GACpB,MAAM,IAAIr5C,YAAY,oDAKxB,GAFAjjC,KAAKu8E,WAAaA,GAAc,GAE5BA,IAC0B,iBAAfA,IAA6B5gF,OAAO4G,KAAKg6E,GAAYvJ,OAAM,SAAUn3E,GAChF,OAAO,EAAAi2E,EAAA,IAAOyK,EAAW1gF,QAEzB,MAAM,IAAIV,UAAU,oCAsL1B,OAjLAmhF,EAAWrgF,UAAY,IAAI8jB,EAC3Bu8D,EAAWrgF,UAAUmE,KAAO,aAC5Bk8E,EAAWrgF,UAAUugF,cAAe,EAepCF,EAAWrgF,UAAUw1E,SAAW,SAAUE,EAAMC,GAC9C,IAAI6K,EAAc,GAElB,IAAK,IAAI5gF,KAAOmE,KAAKu8E,WACnB,IAAI,QAAev8E,KAAKu8E,WAAY1gF,GAAM,CAGxC,IAAI6gF,GAAiB,EAAAjZ,EAAA,IAAU5nE,GAC3B8gF,EAAY9/C,KAAKzoB,MAAMsoE,GAE3B,KAAK,QAAe18E,KAAKu8E,WAAYI,GACnC,MAAM,IAAIx7C,MAAM,0BAA4Bw7C,EAAY,KAG1DF,EAAYE,GAAa38E,KAAKu8E,WAAW1gF,GAAK41E,SAASE,EAAMC,GAIjE,OAAO,SAAwBR,EAAO/0C,EAAM+2C,GAC1C,IAAI9zE,EAAM,GAEV,IAAK,IAAIs9E,KAAQH,GACX,QAAeA,EAAaG,KAC9Bt9E,EAAIs9E,GAAQH,EAAYG,GAAMxL,EAAO/0C,EAAM+2C,IAI/C,OAAO9zE,IASXg9E,EAAWrgF,UAAU0F,QAAU,SAAUuS,GACvC,IAAK,IAAIrY,KAAOmE,KAAKu8E,YACf,QAAev8E,KAAKu8E,WAAY1gF,IAClCqY,EAASlU,KAAKu8E,WAAW1gF,GAAM,eAAgB,EAAA4nE,EAAA,IAAU5nE,GAAO,IAAKmE,OAY3Es8E,EAAWrgF,UAAU0a,IAAM,SAAUzC,GACnC,IAAIqoE,EAAa,GAEjB,IAAK,IAAI1gF,KAAOmE,KAAKu8E,YACf,QAAev8E,KAAKu8E,WAAY1gF,KAClC0gF,EAAW1gF,GAAOmE,KAAK6xE,QAAQ39D,EAASlU,KAAKu8E,WAAW1gF,GAAM,eAAgB,EAAA4nE,EAAA,IAAU5nE,GAAO,IAAKmE,QAIxG,OAAO,IAAIs8E,EAAWC,IAQxBD,EAAWrgF,UAAUwwD,MAAQ,WAC3B,IAAI8vB,EAAa,GAEjB,IAAK,IAAI1gF,KAAOmE,KAAKu8E,YACf,QAAev8E,KAAKu8E,WAAY1gF,KAClC0gF,EAAW1gF,GAAOmE,KAAKu8E,WAAW1gF,IAItC,OAAO,IAAIygF,EAAWC,IAUxBD,EAAWrgF,UAAUo2E,UAAY,SAAUpc,GACzC,IAAIv+B,EAAU,GAEd,IAAK,IAAI77B,KAAOmE,KAAKu8E,YACf,QAAev8E,KAAKu8E,WAAY1gF,IAClC67B,EAAQl5B,MAAK,EAAAilE,EAAA,IAAU5nE,GAAO,KAAOmE,KAAKu8E,WAAW1gF,GAAK6D,SAASu2D,IAIvE,MAAO,IAAMv+B,EAAQsR,KAAK,MAAQ,KAQpCszC,EAAWrgF,UAAUmtD,OAAS,WAC5B,MAAO,CACLkqB,OAAQ,aACRiJ,WAAYv8E,KAAKu8E,aAYrBD,EAAW/I,SAAW,SAAUzjB,GAC9B,OAAO,IAAIwsB,EAAWxsB,EAAKysB,aAU7BD,EAAWrgF,UAAUq2E,OAAS,SAAUrc,GACtC,IAAIv+B,EAAU,GAEd,IAAK,IAAI77B,KAAOmE,KAAKu8E,YACf,QAAev8E,KAAKu8E,WAAY1gF,IAClC67B,EAAQl5B,KAAK,4CAA6C,QAAO3C,GAApD,8HAAgMmE,KAAKu8E,WAAW1gF,GAAKy2E,OAAOrc,IAI7O,MAAO,iEAAmEv+B,EAAQsR,KAAK,yCAA2C,kEASpIszC,EAAWrgF,UAAUu2E,OAAS,SAAUvc,GACtC,IAAIv+B,EAAU,GAEd,IAAK,IAAI77B,KAAOmE,KAAKu8E,YACf,QAAev8E,KAAKu8E,WAAY1gF,IAClC67B,EAAQl5B,KAAK,YAAc3C,EAAM,QAAUmE,KAAKu8E,WAAW1gF,GAAK02E,MAAMtc,GAAW,QAIrF,MAAO,8BAA8B/zB,OAAOxK,EAAQsR,KAAK,MAAO,2BAG3DszC,IACN,CACD1J,SAAS,EACTtB,QAAQ,ICnNN,EAAe,CAAC,QACTuL,GAAuC,EAAA3L,EAAA,IAFvC,kBAEqD,GAAe1jB,IAC7E,IAAI,KACFztC,GACEytC,EASJ,SAASsvB,EAAgBC,GACvB,KAAM/8E,gBAAgB88E,GACpB,MAAM,IAAI75C,YAAY,oDAIxB,KAAK,EAAA6uC,EAAA,IAAOiL,GACV,MAAM,IAAI5hF,UAAU,yCAGtB6E,KAAK+8E,QAAUA,EAqIjB,OAlIAD,EAAgB7gF,UAAY,IAAI8jB,EAChC+8D,EAAgB7gF,UAAUmE,KAAO,kBACjC08E,EAAgB7gF,UAAU+gF,mBAAoB,EAe9CF,EAAgB7gF,UAAUw1E,SAAW,SAAUE,EAAMC,GACnD,OAAO5xE,KAAK+8E,QAAQtL,SAASE,EAAMC,IASrCkL,EAAgB7gF,UAAU02E,WAAa,WACrC,OAAO3yE,KAAK+8E,QAAQpK,cAQtBmK,EAAgB7gF,UAAU0F,QAAU,SAAUuS,GAC5CA,EAASlU,KAAK+8E,QAAS,UAAW/8E,OAUpC88E,EAAgB7gF,UAAU0a,IAAM,SAAUzC,GAExC,OAAO,IAAI4oE,EADG5oE,EAASlU,KAAK+8E,QAAS,UAAW/8E,QASlD88E,EAAgB7gF,UAAUwwD,MAAQ,WAChC,OAAO,IAAIqwB,EAAgB98E,KAAK+8E,UAUlCD,EAAgB7gF,UAAUo2E,UAAY,SAAUpc,GAC9C,OAAKA,GAAWA,IAAYA,EAAQgnB,aAAehnB,GAAmC,SAAxBA,EAAQgnB,YAC7D,IAAMj9E,KAAK+8E,QAAQr9E,SAASu2D,GAAW,IAGzCj2D,KAAK+8E,QAAQr9E,SAASu2D,IAQ/B6mB,EAAgB7gF,UAAUmtD,OAAS,WACjC,MAAO,CACLkqB,OAAQ,kBACRyJ,QAAS/8E,KAAK+8E,UAYlBD,EAAgBvJ,SAAW,SAAUzjB,GACnC,OAAO,IAAIgtB,EAAgBhtB,EAAKitB,UAUlCD,EAAgB7gF,UAAUq2E,OAAS,SAAUrc,GAC3C,OAAKA,GAAWA,IAAYA,EAAQgnB,aAAehnB,GAAmC,SAAxBA,EAAQgnB,YAC7D,iEAAmEj9E,KAAK+8E,QAAQzK,OAAOrc,GAAW,iEAGpGj2D,KAAK+8E,QAAQzK,OAAOrc,IAU7B6mB,EAAgB7gF,UAAUu2E,OAAS,SAAUvc,GAC3C,OAAKA,GAAWA,IAAYA,EAAQgnB,aAAehnB,GAAmC,SAAxBA,EAAQgnB,YAC7D,UAAU/6C,OAAOliC,KAAK+8E,QAAQxK,MAAMtc,GAAU,YAGhDj2D,KAAK+8E,QAAQxK,MAAMtc,IAGrB6mB,IACN,CACDlK,SAAS,EACTtB,QAAQ,IC/ICiL,EAAa,CAAC,CAEvBW,eAAgB,GAChBC,uBAAwB,IACvB,CAEDC,gBAAiB,CACfC,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,IAId,CAED,kBAAmB,CACjBC,cAAe,OACfC,gBAAiB,KAElB,CAED,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,qBAAsB,CACpBD,cAAe,OACfC,gBAAiB,KAElB,CAED,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAElB,CAED,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAElB,CAED,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,KAElB,CAED,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,+BAAgC,CAC9BD,cAAe,OACfC,gBAAiB,IAEnB,6BAA8B,CAC5BD,cAAe,OACfC,gBAAiB,KAElB,CAED,kBAAmB,CACjBD,cAAe,OACfC,gBAAiB,KAElB,CAEDE,UAAW,IACV,CAED,mBAAoB,CAClBH,cAAe,OACfC,gBAAiB,CAAC,mBAAoB,0BAExC,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,KAElB,CAED,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,uBAE5F,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,GACjBJ,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,GAKf,2BAA4B,CAC1BC,cAAe,OACfC,gBAAiB,CAAC,wBAAyB,sBAAuB,2BAA4B,0BAEhG,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,yBAA0B,CACxBD,cAAe,SAEjB,0BAA2B,CACzBA,cAAe,SAEjB,sBAAuB,CACrBA,cAAe,SAEjB,mBAAoB,CAClBA,cAAe,UAEhB,CAED,mBAAoB,CAClBA,cAAe,QACfC,gBAAiB,GACjBH,kBAAkB,GAKpB,sBAAuB,CACrBE,cAAe,QACfC,gBAAiB,KAElB,CAED,yBAA0B,CACxBD,cAAe,SAEhB,CAED,yBAA0B,CACxBA,cAAe,UAaZ,SAASI,EAAcC,EAAOZ,GACnC,IAAIn7E,EAAO+7E,EAES,SAAhBZ,IAEFn7E,EAAO+7E,EAAMlL,cAKf,IAFA,IAAImL,EAAah8E,EAAK4wE,gBAEbh4E,EAAI,EAAGA,EAAI6hF,EAAW9hF,OAAQC,IACrC,GAAIojF,KAAcvB,EAAW7hF,GAC3B,OAAOA,EAIX,OAAO,KAaF,SAASqjF,EAAiBF,EAAOZ,GACtC,IAAIn7E,EAAO+7E,EAES,SAAhBZ,IAEFn7E,EAAO+7E,EAAMlL,cAGf,IAAImL,EAAah8E,EAAK4wE,gBAClB5zC,EAAQ8+C,EAAc97E,EAAMm7E,GAEhC,GAAc,OAAVn+C,EAEF,OAAO,KAGT,IAAI3iC,EAAWogF,EAAWz9C,GAAOg/C,GAEjC,IAAI,QAAe3hF,EAAU,iBAAkB,CAC7C,GAA+B,SAA3BA,EAASqhF,cACX,MAAO,OAGT,GAA+B,UAA3BrhF,EAASqhF,cACX,MAAO,QAIT,MAAMr8C,MAAM,IAAO28C,EAAa,oCAAwC3hF,EAASqhF,cAAgB,MAInG,OAAO,KAYF,SAASQ,EAAkBC,EAAOC,EAAOjB,GAE9C,IAAI9zE,EAAoB,SAAhB8zE,EAAyBgB,EAAMtL,aAAesL,EAClD70E,EAAoB,SAAhB6zE,EAAyBgB,EAAMtL,aAAeuL,EAClDC,EAAch1E,EAAEupE,gBAChB0L,EAAch1E,EAAEspE,gBAChB5zC,EAAQ8+C,EAAcz0E,EAAG8zE,GAE7B,GAAc,OAAVn+C,EAEF,OAAO,KAGT,IAAI3iC,EAAWogF,EAAWz9C,GAAOq/C,GAEjC,IAAI,QAAehiF,EAAU,oBAAsBA,EAASshF,2BAA2B7iF,MAAO,CAC5F,IAAK,IAAIF,EAAI,EAAGA,EAAIyB,EAASshF,gBAAgBhjF,OAAQC,IACnD,GAAIyB,EAASshF,gBAAgB/iF,KAAO0jF,EAClC,OAAO,EAIX,OAAO,EAIT,OAAO,KC9ST,IACI,EAAe,CAAC,QACTC,GAAsC,EAAAnN,EAAA,IAFtC,iBAEoD,GAAe1jB,IAC5E,IAAI,KACFztC,GACEytC,EAWJ,SAASkwB,EAAeY,EAAchsD,GACpC,KAAMtyB,gBAAgB09E,GACpB,MAAM,IAAIz6C,YAAY,oDAGxB,IAAKroC,MAAMgD,QAAQ0gF,GAAe,MAAM,IAAInjF,UAAU,2CACtD,IAAKP,MAAMgD,QAAQ00B,GAAS,MAAM,IAAIn3B,UAAU,qCAChD,GAAImjF,EAAa7jF,SAAW63B,EAAO73B,OAAS,EAAG,MAAM,IAAIU,UAAU,sFACnE6E,KAAKs+E,aAAeA,EACpBt+E,KAAKsyB,OAASA,EAiLhB,OA9KAorD,EAAezhF,UAAY,IAAI8jB,EAC/B29D,EAAezhF,UAAUmE,KAAO,iBAChCs9E,EAAezhF,UAAUsiF,kBAAmB,EAe5Cb,EAAezhF,UAAUw1E,SAAW,SAAUE,EAAMC,GAClD,IAAI92E,EAAOkF,KACPw+E,EAAWx+E,KAAKsyB,OAAO3b,KAAIjZ,GAAKA,EAAE+zE,SAASE,EAAMC,KACrD,OAAO,SAA4BR,EAAO/0C,EAAM+2C,GAI9C,IAHA,IAAIqL,EACAC,EAAUF,EAAS,GAAGpN,EAAO/0C,EAAM+2C,GAE9B14E,EAAI,EAAGA,EAAII,EAAKwjF,aAAa7jF,OAAQC,IAK5C,GAJA+jF,EAAUC,EACVA,EAAUF,EAAS9jF,EAAI,GAAG02E,EAAO/0C,EAAM+2C,KAC1B,QAAgBzB,EAAM72E,EAAKwjF,aAAa5jF,GAEhDikF,CAAOF,EAASC,GACnB,OAAO,EAIX,OAAO,IASXhB,EAAezhF,UAAU0F,QAAU,SAAUuS,GAC3ClU,KAAKsyB,OAAO3wB,SAAQ,CAAClC,EAAG/E,IAAMwZ,EAASzU,EAAG,UAAY/E,EAAI,IAAKsF,OAAOA,OAUxE09E,EAAezhF,UAAU0a,IAAM,SAAUzC,GACvC,OAAO,IAAIwpE,EAAe19E,KAAKs+E,aAAax/E,QAASkB,KAAKsyB,OAAO3b,KAAI,CAAClX,EAAG/E,IAAMsF,KAAK6xE,QAAQ39D,EAASzU,EAAG,UAAY/E,EAAI,IAAKsF,QAAQA,QAQvI09E,EAAezhF,UAAUwwD,MAAQ,WAC/B,OAAO,IAAIixB,EAAe19E,KAAKs+E,aAAct+E,KAAKsyB,SASpDorD,EAAezhF,UAAUo2E,UAAY,SAAUpc,GAiB7C,IAhBA,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2B,EAAahB,EAAc59E,KAAMi9E,GACjC4B,EAAe7+E,KAAKsyB,OAAO3b,KAAI,SAAUjZ,EAAGohC,GAC9C,IAAIggD,EAAkBlB,EAAclgF,EAAGu/E,GACvC,MAAuB,QAAhBA,GAA6C,OAApB6B,GAA4BA,GAAmBF,EAAa,IAAMlhF,EAAEgC,SAASu2D,GAAW,IAAMv4D,EAAEgC,SAASu2D,MAEvI8oB,EAAc,CAChBzG,MAAO,KACPC,QAAS,KACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,KACXC,SAAU,MAERtzC,EAAMw5C,EAAa,GAEdnkF,EAAI,EAAGA,EAAIsF,KAAKs+E,aAAa7jF,OAAQC,IAC5C2qC,GAAO,IAAM05C,EAAY/+E,KAAKs+E,aAAa5jF,IAAM,IAAMmkF,EAAankF,EAAI,GAG1E,OAAO2qC,GAQTq4C,EAAezhF,UAAUmtD,OAAS,WAChC,MAAO,CACLkqB,OAAQ,iBACRgL,aAAct+E,KAAKs+E,aACnBhsD,OAAQtyB,KAAKsyB,SAYjBorD,EAAenK,SAAW,SAAUzjB,GAClC,OAAO,IAAI4tB,EAAe5tB,EAAKwuB,aAAcxuB,EAAKx9B,SASpDorD,EAAezhF,UAAUq2E,OAAS,SAAUrc,GAiB1C,IAhBA,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2B,EAAahB,EAAc59E,KAAMi9E,GACjC4B,EAAe7+E,KAAKsyB,OAAO3b,KAAI,SAAUjZ,EAAGohC,GAC9C,IAAIggD,EAAkBlB,EAAclgF,EAAGu/E,GACvC,MAAuB,QAAhBA,GAA6C,OAApB6B,GAA4BA,GAAmBF,EAAa,iEAAmElhF,EAAE40E,OAAOrc,GAAW,iEAAmEv4D,EAAE40E,OAAOrc,MAE7P8oB,EAAc,CAChBzG,MAAO,KACPC,QAAS,KACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,KACXC,SAAU,MAERtzC,EAAMw5C,EAAa,GAEdnkF,EAAI,EAAGA,EAAIsF,KAAKs+E,aAAa7jF,OAAQC,IAC5C2qC,GAAO,mFAAoF,QAAO05C,EAAY/+E,KAAKs+E,aAAa5jF,KAAO,UAAYmkF,EAAankF,EAAI,GAGtK,OAAO2qC,GASTq4C,EAAezhF,UAAUu2E,OAAS,SAAUvc,GAS1C,IARA,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2B,EAAahB,EAAc59E,KAAMi9E,GACjC4B,EAAe7+E,KAAKsyB,OAAO3b,KAAI,SAAUjZ,EAAGohC,GAC9C,IAAIggD,EAAkBlB,EAAclgF,EAAGu/E,GACvC,MAAuB,QAAhBA,GAA6C,OAApB6B,GAA4BA,GAAmBF,EAAa,UAAYlhF,EAAE60E,MAAMtc,GAAW,UAAYv4D,EAAE60E,MAAMtc,MAE7I5wB,EAAMw5C,EAAa,GAEdnkF,EAAI,EAAGA,EAAIsF,KAAKs+E,aAAa7jF,OAAQC,IAC5C2qC,GAAOkyC,EAAev3E,KAAKs+E,aAAa5jF,IAAMmkF,EAAankF,EAAI,GAGjE,OAAO2qC,GAGFq4C,IACN,CACD9K,SAAS,EACTtB,QAAQ,IC7MN,EAAe,CAAC,MAAO,QAChB0N,GAAkC,EAAA9N,EAAA,IAFlC,QAEgD,GAAe1jB,IACxE,IAAI,GACFnrC,EAAE,KACFsvD,GACEnkB,EAoBJ,SAASyxB,EAAMniF,GACb,KAAMkD,gBAAgBi/E,GACpB,MAAM,IAAIh8C,YAAY,qDAGpB,EAAA6uC,EAAA,IAAQh1E,GACVkD,KAAKlD,MAAQA,EAAMA,MAEnBkD,KAAKlD,MAAQA,EAqFjB,SAASoiF,EAAgBv/E,EAAMqvE,IAC7B,QAAKiQ,EAAMhjF,UAAW0D,GAAM,WAC1B,IAAIk/C,EAAKmwB,IAET,GAAkB,mBAAPnwB,EACT,OAAOsgC,EAAStgC,MActB,SAASsgC,EAAStgC,GAChB,OAAO,WAGL,IAFA,IAAIxiB,EAAO,CAACr8B,KAAKlD,OAERpC,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IACpC2hC,EAAK3hC,EAAI,GAAKslC,UAAUtlC,GAG1B,OAAO,IAAIukF,EAAMpgC,EAAGuP,MAAMvP,EAAIxiB,KAxGlC4iD,EAAMhjF,UAAUmE,KAAO,QACvB6+E,EAAMhjF,UAAUmjF,SAAU,EAO1BH,EAAMhjF,UAAUsC,KAAO,WACrB,OAAOyB,KAAKlD,OASdmiF,EAAMhjF,UAAUktD,QAAU,WACxB,OAAOnpD,KAAKlD,OAQdmiF,EAAMhjF,UAAUyD,SAAW,WACzB,OAAO,QAAOM,KAAKlD,QAQrBmiF,EAAMhjF,UAAUmtD,OAAS,WACvB,MAAO,CACLkqB,OAAQ,QACRx2E,MAAOkD,KAAKlD,QAYhBmiF,EAAM1L,SAAW,SAAUzjB,GACzB,OAAO,IAAImvB,EAAMnvB,EAAKhzD,QAuExBmiF,EAAMI,YAAc,SAAU3pB,EAAM4pB,GAClC,GAAoB,iBAAT5pB,EA7DQ/1D,EA+DL+1D,EA9DI,mBADO7W,EA+DLygC,KA7DlBL,EAAMhjF,UAAU0D,GAAQw/E,EAAStgC,QA8D5B,CACL,IAAImP,EAAQ,SAAeuxB,IACrB,QAAe7pB,EAAM6pB,SAAmCphF,IAAzBqhF,EAAcD,IAC/CL,EAAgBK,GAAO,IAAM7pB,EAAK6pB,MAKtC,IAAK,IAAIA,KAAS7pB,EAChB1H,EAAMuxB,GAzEZ,IAAqB5/E,EAAMk/C,GA8E3B,IAAI2gC,EAAgB,CAClBC,YAAY,EACZC,MAAM,EACNt/E,MAAM,EACNu/E,SAAS,EACT7vB,MAAM,EACNn7C,OAAO,EACPyqE,SAAS,GAeX,OAXAH,EAAMI,YAAY1N,GAEdtvD,GACFA,EAAG,UAAU,SAAU1iB,EAAMqvE,EAAUh6D,GAChCA,GAEHkqE,EAAgBv/E,EAAMqvE,MAKrBiQ,IACN,CACDrM,SAAS,ICjNP,EAAe,CAAC,WACTgN,GAA+B,EAAA1O,EAAA,IAF/B,UAE6C,GAAe1jB,IACrE,IAAI,QACFmyB,GACEnyB,EAQJ,OAAO,SAAiB3xD,EAAKiB,GAC3B,IAAIS,EAAcoiF,EAAQ7iF,GAASA,EAAMw2E,QAEzC,OAAI/1E,GAA+C,mBAAzBA,EAAYg2E,SAC7Bh2E,EAAYg2E,SAASz2E,GAGvBA,MCjBP,EAAe,CAAC,QACT+iF,GAAuC,EAAA3O,EAAA,IAFvC,kBAEqD,GAAe1jB,IAC7E,IAAI,KACFztC,GACEytC,EAYJ,SAAS4vB,EAAgB0C,EAAWC,EAAUC,GAC5C,KAAMhgF,gBAAgBo9E,GACpB,MAAM,IAAIn6C,YAAY,oDAGxB,KAAK,EAAA6uC,EAAA,IAAOgO,GAAY,MAAM,IAAI3kF,UAAU,sCAC5C,KAAK,EAAA22E,EAAA,IAAOiO,GAAW,MAAM,IAAI5kF,UAAU,qCAC3C,KAAK,EAAA22E,EAAA,IAAOkO,GAAY,MAAM,IAAI7kF,UAAU,sCAC5C6E,KAAK8/E,UAAYA,EACjB9/E,KAAK+/E,SAAWA,EAChB//E,KAAKggF,UAAYA,EA6MnB,OA1MA5C,EAAgBnhF,UAAY,IAAI8jB,EAChCq9D,EAAgBnhF,UAAUmE,KAAO,kBACjCg9E,EAAgBnhF,UAAUgkF,mBAAoB,EAe9C7C,EAAgBnhF,UAAUw1E,SAAW,SAAUE,EAAMC,GACnD,IAAIsO,EAAgBlgF,KAAK8/E,UAAUrO,SAASE,EAAMC,GAE9CuO,EAAengF,KAAK+/E,SAAStO,SAASE,EAAMC,GAE5CwO,EAAgBpgF,KAAKggF,UAAUvO,SAASE,EAAMC,GAElD,OAAO,SAA6BR,EAAO/0C,EAAM+2C,GAC/C,OAuJJ,SAAuB0M,GACrB,GAAyB,iBAAdA,GAA+C,kBAAdA,GAAgD,iBAAdA,EAC5E,QAASA,EAGX,GAAIA,EAAW,CACb,IAAI,EAAAhO,EAAA,IAAYgO,GACd,OAAQA,EAAUz8B,SAGpB,IAAI,EAAAyuB,EAAA,IAAUgO,GACZ,SAAUA,EAAU97C,KAAM87C,EAAU77C,IAGtC,IAAI,EAAA6tC,EAAA,IAAOgO,GACT,QAASA,EAAUhjF,MAIvB,GAAIgjF,QACF,OAAO,EAGT,MAAM,IAAI3kF,UAAU,mCAAoC,QAAO2kF,GAAa,KA9KnEO,CAAcH,EAAc9O,EAAO/0C,EAAM+2C,IAAY+M,EAAa/O,EAAO/0C,EAAM+2C,GAAWgN,EAAchP,EAAO/0C,EAAM+2C,KAShIgK,EAAgBnhF,UAAU0F,QAAU,SAAUuS,GAC5CA,EAASlU,KAAK8/E,UAAW,YAAa9/E,MACtCkU,EAASlU,KAAK+/E,SAAU,WAAY//E,MACpCkU,EAASlU,KAAKggF,UAAW,YAAahgF,OAUxCo9E,EAAgBnhF,UAAU0a,IAAM,SAAUzC,GACxC,OAAO,IAAIkpE,EAAgBp9E,KAAK6xE,QAAQ39D,EAASlU,KAAK8/E,UAAW,YAAa9/E,OAAQA,KAAK6xE,QAAQ39D,EAASlU,KAAK+/E,SAAU,WAAY//E,OAAQA,KAAK6xE,QAAQ39D,EAASlU,KAAKggF,UAAW,YAAahgF,SAQpMo9E,EAAgBnhF,UAAUwwD,MAAQ,WAChC,OAAO,IAAI2wB,EAAgBp9E,KAAK8/E,UAAW9/E,KAAK+/E,SAAU//E,KAAKggF,YASjE5C,EAAgBnhF,UAAUo2E,UAAY,SAAUpc,GAC9C,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2B,EAAahB,EAAc59E,KAAMi9E,GAKjC6C,EAAY9/E,KAAK8/E,UAAUpgF,SAASu2D,GACpCqqB,EAAsB1C,EAAc59E,KAAK8/E,UAAW7C,IAEpC,QAAhBA,GAAiD,iBAAxBj9E,KAAK8/E,UAAU1/E,MAAmD,OAAxBkgF,GAAgCA,GAAuB1B,KAC5HkB,EAAY,IAAMA,EAAY,KAGhC,IAAIC,EAAW//E,KAAK+/E,SAASrgF,SAASu2D,GAClCsqB,EAAiB3C,EAAc59E,KAAK+/E,SAAU9C,IAE9B,QAAhBA,GAAgD,iBAAvBj9E,KAAK+/E,SAAS3/E,MAA8C,OAAnBmgF,GAA2BA,GAAkB3B,KACjHmB,EAAW,IAAMA,EAAW,KAG9B,IAAIC,EAAYhgF,KAAKggF,UAAUtgF,SAASu2D,GACpCuqB,EAAkB5C,EAAc59E,KAAKggF,UAAW/C,GAMpD,OAJoB,QAAhBA,GAAiD,iBAAxBj9E,KAAKggF,UAAU5/E,MAA+C,OAApBogF,GAA4BA,GAAmB5B,KACpHoB,EAAY,IAAMA,EAAY,KAGzBF,EAAY,MAAQC,EAAW,MAAQC,GAQhD5C,EAAgBnhF,UAAUmtD,OAAS,WACjC,MAAO,CACLkqB,OAAQ,kBACRwM,UAAW9/E,KAAK8/E,UAChBC,SAAU//E,KAAK+/E,SACfC,UAAWhgF,KAAKggF,YAYpB5C,EAAgB7J,SAAW,SAAUzjB,GACnC,OAAO,IAAIstB,EAAgBttB,EAAKgwB,UAAWhwB,EAAKiwB,SAAUjwB,EAAKkwB,YASjE5C,EAAgBnhF,UAAUq2E,OAAS,SAAUrc,GAC3C,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2B,EAAahB,EAAc59E,KAAMi9E,GAKjC6C,EAAY9/E,KAAK8/E,UAAUxN,OAAOrc,GAClCqqB,EAAsB1C,EAAc59E,KAAK8/E,UAAW7C,IAEpC,QAAhBA,GAAiD,iBAAxBj9E,KAAK8/E,UAAU1/E,MAAmD,OAAxBkgF,GAAgCA,GAAuB1B,KAC5HkB,EAAY,iEAAmEA,EAAY,kEAG7F,IAAIC,EAAW//E,KAAK+/E,SAASzN,OAAOrc,GAChCsqB,EAAiB3C,EAAc59E,KAAK+/E,SAAU9C,IAE9B,QAAhBA,GAAgD,iBAAvBj9E,KAAK+/E,SAAS3/E,MAA8C,OAAnBmgF,GAA2BA,GAAkB3B,KACjHmB,EAAW,iEAAmEA,EAAW,kEAG3F,IAAIC,EAAYhgF,KAAKggF,UAAU1N,OAAOrc,GAClCuqB,EAAkB5C,EAAc59E,KAAKggF,UAAW/C,GAMpD,OAJoB,QAAhBA,GAAiD,iBAAxBj9E,KAAKggF,UAAU5/E,MAA+C,OAApBogF,GAA4BA,GAAmB5B,KACpHoB,EAAY,iEAAmEA,EAAY,kEAGtFF,EAAY,iEAAmEC,EAAW,iEAAmEC,GAStK5C,EAAgBnhF,UAAUu2E,OAAS,SAAUvc,GAC3C,MAAO,mBAAqBj2D,KAAK+/E,SAASxN,MAAMtc,GAAW,4BAA8Bj2D,KAAK8/E,UAAUvN,MAAMtc,GAAW,SAAWj2D,KAAKggF,UAAUzN,MAAMtc,GAAW,6CAmC/JmnB,IACN,CACDxK,SAAS,EACTtB,QAAQ,ICtON,EAAe,CAAC,QACTmP,GAAoC,EAAAvP,EAAA,IAFpC,eAEkD,GAAe1jB,IAC1E,IAAI,KACFztC,GACEytC,EAYJ,SAASkzB,EAAaC,EAAI9hC,EAAIxiB,EAAMukD,GAClC,KAAM5gF,gBAAgB0gF,GACpB,MAAM,IAAIz9C,YAAY,oDAIxB,GAAkB,iBAAP09C,EACT,MAAM,IAAIxlF,UAAU,sCAGtB,GAAkB,iBAAP0jD,EACT,MAAM,IAAI1jD,UAAU,sCAGtB,IAAKP,MAAMgD,QAAQy+B,KAAUA,EAAK22C,MAAMlB,EAAA,IACtC,MAAM,IAAI32E,UAAU,wDAGtB6E,KAAK4gF,UAAwB,IAAbA,EAChB5gF,KAAK2gF,GAAKA,EACV3gF,KAAK6+C,GAAKA,EACV7+C,KAAKq8B,KAAOA,GAAQ,GA8HtB,SAASwkD,EAA8Bj+C,EAAMq6C,EAAa2D,EAAUvkD,EAAMykD,GAExE,IAmBI53E,EAnBA01E,EAAahB,EAAch7C,EAAMq6C,GACjCO,EAAgBO,EAAiBn7C,EAAMq6C,GAE3C,GAAoB,QAAhBA,GAAyB5gD,EAAK5hC,OAAS,GAA8B,qBAAzBmoC,EAAK8vC,iBAAmE,0BAAzB9vC,EAAK8vC,gBAClG,OAAOr2C,EAAK1lB,KAAI,SAAUmtB,GACxB,OAAQA,EAAI6uC,aAAavyE,MAEvB,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,OAAO,EAET,QACE,OAAO,MAOf,OAAQi8B,EAAK5hC,QACX,KAAK,EACHyO,EAAS,GACT,MAEF,KAAK,EAID,IAAI63E,EAAoBnD,EAAcvhD,EAAK,GAAI4gD,GAE/C,GAAI6D,GAA+B,OAAtBC,EAA4B,CACvC,IAAIC,EACAC,EAWJ,GAToB,SAAhBhE,GACF+D,EAAoB3kD,EAAK,GAAGq2C,gBAC5BuO,EAAiBr+C,EAAK8vC,kBAGtBsO,EAAoB3kD,EAAK,GAAGs2C,aAAaD,gBACzCuO,EAAiBr+C,EAAK+vC,aAAaD,kBAG0B,IAA3D6J,EAAWqC,GAAYqC,GAAgB5D,gBAA2B,CACpEn0E,EAAS,EAAC,GACV,MAGF,IAAqE,IAAjEqzE,EAAWwE,GAAmBC,GAAmBzD,YAAuB,CAC1Er0E,EAAS,EAAC,GACV,OAIJ,GAA0B,OAAtB63E,EAA4B,CAE9B73E,EAAS,EAAC,GACV,MAGF,GAAI63E,GAAqBnC,EAAY,CAEnC11E,EAAS,EAAC,GACV,MAIFA,EAAS,EAAC,GAEZ,MAEF,KAAK,EAGD,IAAIg4E,EAuBAC,EApBAC,EAAgBxD,EAAcvhD,EAAK,GAAI4gD,GAEvCoE,EAAerD,EAAkBp7C,EAAMvG,EAAK,GAAI4gD,GAKlDiE,EAHoB,OAAlBE,IAIOA,IAAkBxC,GAAgC,UAAlBpB,IAA8B6D,GAM9DD,EAAgBxC,GAS3B,IAsBM0C,EAEAC,EACAC,EAzBFC,EAAgB7D,EAAcvhD,EAAK,GAAI4gD,GAEvCyE,EAAe1D,EAAkBp7C,EAAMvG,EAAK,GAAI4gD,GAKlDkE,EAHoB,OAAlBM,IAIOA,IAAkB7C,GAAgC,SAAlBpB,IAA6BkE,GAM7DD,EAAgB7C,GAOvBkC,IAMkB,SAAhB7D,GACFqE,EAAkB1+C,EAAK8vC,gBACvB6O,EAAgB3+C,EAAKvG,KAAK,GAAGq2C,gBAC7B8O,EAAgB5+C,EAAKvG,KAAK,GAAGq2C,kBAG7B4O,EAAkB1+C,EAAK+vC,aAAaD,gBACpC6O,EAAgB3+C,EAAKvG,KAAK,GAAGs2C,aAAaD,gBAC1C8O,EAAgB5+C,EAAKvG,KAAK,GAAGs2C,aAAaD,iBAGtB,OAAlB0O,KAC8D,IAA5D7E,EAAWqC,GAAY0C,GAAiBjE,kBAC1C6D,GAAY,IAG+C,IAAzD3E,EAAW6E,GAAeG,GAAehE,cAC3C2D,GAAY,IAIM,OAAlBO,KAC+D,IAA7DlF,EAAWqC,GAAY0C,GAAiBhE,mBAC1C6D,GAAY,IAG+C,IAAzD5E,EAAWkF,GAAeD,GAAejE,cAC3C4D,GAAY,KAKlBj4E,EAAS,CAACg4E,EAAWC,GAEvB,MAEF,QAC+B,qBAAzBv+C,EAAK8vC,iBAAmE,0BAAzB9vC,EAAK8vC,kBACtDxpE,EAASmzB,EAAK1lB,KAAI,SAAUmtB,GAC1B,IAAI69C,EAAgB/D,EAAc95C,EAAKm5C,GACnC2E,EAAe5D,EAAkBp7C,EAAMkB,EAAKm5C,GAC5C4E,EAAmB9D,EAAiBj6C,EAAKm5C,GAE7C,OAAsB,OAAlB0E,IAGO/C,IAAe+C,GAAiBnE,IAAkBqE,IAAqBD,GAEvED,EAAgB/C,OA2BnC,OAbIviD,EAAK5hC,QAAU,GAA8B,0BAAzBmoC,EAAK8vC,iBAA+C9vC,EAAKg+C,UAA4B,SAAhB3D,GAAuC,SAAb2D,IACrH13E,EAASmzB,EAAK1lB,KAAI,SAAUmtB,EAAKhF,GAC/B,IAAIk+C,EAA4C,oBAAxBl5C,EAAI4uC,gBAE5B,SAAIxpE,EAAO41B,KAAUk+C,OASlB9zE,EA+ST,OAxnBAw3E,EAAazkF,UAAY,IAAI8jB,EAC7B2gE,EAAazkF,UAAUmE,KAAO,eAC9BsgF,EAAazkF,UAAU6lF,gBAAiB,EAexCpB,EAAazkF,UAAUw1E,SAAW,SAAUE,EAAMC,GAEhD,GAAuB,iBAAZ5xE,KAAK6+C,MAAoB,QAAa8yB,EAAM3xE,KAAK6+C,IAC1D,MAAK8yB,EAAK3xE,KAAK6+C,IAGP,IAAI1d,MAAM,0BAA4BnhC,KAAK6+C,GAAK,KAFhD,IAAI1d,MAAM,YAAcnhC,KAAK6+C,GAAK,yCAM5C,IAAIA,GAAK,QAAgB8yB,EAAM3xE,KAAK6+C,IAChCkjC,GAAW,QAAI/hF,KAAKq8B,MAAM,SAAUyH,GACtC,OAAOA,EAAI2tC,SAASE,EAAMC,MAG5B,GAAwB,IAApBmQ,EAAStnF,OAAc,CACzB,IAAIunF,EAAWD,EAAS,GACxB,OAAO,SAA0B3Q,EAAO/0C,EAAM+2C,GAC5C,OAAOv0B,EAAGmjC,EAAS5Q,EAAO/0C,EAAM+2C,KAE7B,GAAwB,IAApB2O,EAAStnF,OAAc,CAChC,IAAIwnF,EAAWF,EAAS,GACpBG,EAAWH,EAAS,GACxB,OAAO,SAA0B3Q,EAAO/0C,EAAM+2C,GAC5C,OAAOv0B,EAAGojC,EAAS7Q,EAAO/0C,EAAM+2C,GAAU8O,EAAS9Q,EAAO/0C,EAAM+2C,KAGlE,OAAO,SAA0BhC,EAAO/0C,EAAM+2C,GAC5C,OAAOv0B,EAAGuP,MAAM,MAAM,QAAI2zB,GAAU,SAAUI,GAC5C,OAAOA,EAAQ/Q,EAAO/0C,EAAM+2C,SAWpCsN,EAAazkF,UAAU0F,QAAU,SAAUuS,GACzC,IAAK,IAAIxZ,EAAI,EAAGA,EAAIsF,KAAKq8B,KAAK5hC,OAAQC,IACpCwZ,EAASlU,KAAKq8B,KAAK3hC,GAAI,QAAUA,EAAI,IAAKsF,OAW9C0gF,EAAazkF,UAAU0a,IAAM,SAAUzC,GAGrC,IAFA,IAAImoB,EAAO,GAEF3hC,EAAI,EAAGA,EAAIsF,KAAKq8B,KAAK5hC,OAAQC,IACpC2hC,EAAK3hC,GAAKsF,KAAK6xE,QAAQ39D,EAASlU,KAAKq8B,KAAK3hC,GAAI,QAAUA,EAAI,IAAKsF,OAGnE,OAAO,IAAI0gF,EAAa1gF,KAAK2gF,GAAI3gF,KAAK6+C,GAAIxiB,EAAMr8B,KAAK4gF,WAQvDF,EAAazkF,UAAUwwD,MAAQ,WAC7B,OAAO,IAAIi0B,EAAa1gF,KAAK2gF,GAAI3gF,KAAK6+C,GAAI7+C,KAAKq8B,KAAKv9B,MAAM,GAAIkB,KAAK4gF,WASrEF,EAAazkF,UAAUmmF,QAAU,WAC/B,OAA4B,IAArBpiF,KAAKq8B,KAAK5hC,QASnBimF,EAAazkF,UAAUqkD,SAAW,WAChC,OAA4B,IAArBtgD,KAAKq8B,KAAK5hC,QAwOnBimF,EAAazkF,UAAUo2E,UAAY,SAAUpc,GAC3C,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2D,EAAW3qB,GAAWA,EAAQ2qB,SAAW3qB,EAAQ2qB,SAAW,OAC5DvkD,EAAOr8B,KAAKq8B,KACZgmD,EAASxB,EAA8B7gF,KAAMi9E,EAAa2D,EAAUvkD,GAAM,GAE9E,GAAoB,IAAhBA,EAAK5hC,OAAc,CAErB,IAAI6nF,EAAQvE,EAAiB/9E,KAAMi9E,GAC/BsF,EAAUlmD,EAAK,GAAG38B,SAASu2D,GAE3BosB,EAAO,KACTE,EAAU,IAAMA,EAAU,KAI5B,IAAIC,EAAY,YAAY5iF,KAAKI,KAAK2gF,IAEtC,MAAc,UAAV2B,EAEKtiF,KAAK2gF,IAAM6B,EAAY,IAAM,IAAMD,EACvB,SAAVD,EAEFC,GAAWC,EAAY,IAAM,IAAMxiF,KAAK2gF,GAI1C4B,EAAUviF,KAAK2gF,GACjB,GAAoB,IAAhBtkD,EAAK5hC,OAAc,CAC5B,IAAIu7C,EAAM3Z,EAAK,GAAG38B,SAASu2D,GAEvBhgB,EAAM5Z,EAAK,GAAG38B,SAASu2D,GAY3B,OAVIosB,EAAO,KAETrsC,EAAM,IAAMA,EAAM,KAGhBqsC,EAAO,KAETpsC,EAAM,IAAMA,EAAM,KAGhBj2C,KAAK4gF,UAAqC,0BAAzB5gF,KAAK0yE,iBAA4D,SAAbkO,EAChE5qC,EAAM,IAAMC,EAGdD,EAAM,IAAMh2C,KAAK2gF,GAAK,IAAM1qC,EAC9B,GAAI5Z,EAAK5hC,OAAS,IAA+B,qBAAzBuF,KAAK0yE,iBAAmE,0BAAzB1yE,KAAK0yE,iBAA8C,CAC/H,IAAI+P,EAAkBpmD,EAAK1lB,KAAI,SAAUmtB,EAAKhF,GAQ5C,OAPAgF,EAAMA,EAAIpkC,SAASu2D,GAEfosB,EAAOvjD,KAETgF,EAAM,IAAMA,EAAM,KAGbA,KAGT,OAAI9jC,KAAK4gF,UAAqC,0BAAzB5gF,KAAK0yE,iBAA4D,SAAbkO,EAChE6B,EAAgBz5C,KAAK,KAGvBy5C,EAAgBz5C,KAAK,IAAMhpC,KAAK2gF,GAAK,KAG5C,OAAO3gF,KAAK6+C,GAAK,IAAM7+C,KAAKq8B,KAAK2M,KAAK,MAAQ,KASlD03C,EAAazkF,UAAUmtD,OAAS,WAC9B,MAAO,CACLkqB,OAAQ,eACRqN,GAAI3gF,KAAK2gF,GACT9hC,GAAI7+C,KAAK6+C,GACTxiB,KAAMr8B,KAAKq8B,KACXukD,SAAU5gF,KAAK4gF,WAYnBF,EAAanN,SAAW,SAAUzjB,GAChC,OAAO,IAAI4wB,EAAa5wB,EAAK6wB,GAAI7wB,EAAKjR,GAAIiR,EAAKzzB,KAAMyzB,EAAK8wB,WAS5DF,EAAazkF,UAAUq2E,OAAS,SAAUrc,GACxC,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2D,EAAW3qB,GAAWA,EAAQ2qB,SAAW3qB,EAAQ2qB,SAAW,OAC5DvkD,EAAOr8B,KAAKq8B,KACZgmD,EAASxB,EAA8B7gF,KAAMi9E,EAAa2D,EAAUvkD,GAAM,GAE9E,GAAoB,IAAhBA,EAAK5hC,OAAc,CAErB,IAAI6nF,EAAQvE,EAAiB/9E,KAAMi9E,GAC/BsF,EAAUlmD,EAAK,GAAGi2C,OAAOrc,GAM7B,OAJIosB,EAAO,KACTE,EAAU,iEAAmEA,EAAU,kEAG3E,UAAVD,EAEK,iFAAkF,QAAOtiF,KAAK2gF,IAAM,UAAY4B,EAGhHA,EAAU,kFAAmF,QAAOviF,KAAK2gF,IAAM,UAEnH,GAAoB,IAAhBtkD,EAAK5hC,OAAc,CAE5B,IAAIu7C,EAAM3Z,EAAK,GAAGi2C,OAAOrc,GAErBhgB,EAAM5Z,EAAK,GAAGi2C,OAAOrc,GAYzB,OAVIosB,EAAO,KAETrsC,EAAM,iEAAmEA,EAAM,kEAG7EqsC,EAAO,KAETpsC,EAAM,iEAAmEA,EAAM,kEAG7Ej2C,KAAK4gF,UAAqC,0BAAzB5gF,KAAK0yE,iBAA4D,SAAbkO,EAChE5qC,EAAM,yFAA2FC,EAGnGD,EAAM,mFAAoF,QAAOh2C,KAAK2gF,IAAM,UAAY1qC,EAE/H,IAAIwsC,EAAkBpmD,EAAK1lB,KAAI,SAAUmtB,EAAKhF,GAQ5C,OAPAgF,EAAMA,EAAIwuC,OAAOrc,GAEbosB,EAAOvjD,KAETgF,EAAM,iEAAmEA,EAAM,kEAG1EA,KAGT,OAAIzH,EAAK5hC,OAAS,IAA+B,qBAAzBuF,KAAK0yE,iBAAmE,0BAAzB1yE,KAAK0yE,iBACtE1yE,KAAK4gF,UAAqC,0BAAzB5gF,KAAK0yE,iBAA4D,SAAbkO,EAChE6B,EAAgBz5C,KAAK,0FAGvBy5C,EAAgBz5C,KAAK,mFAAoF,QAAOhpC,KAAK2gF,IAAM,WAG3H,gCAAiC,QAAO3gF,KAAK6+C,IAAM,wEAA0E4jC,EAAgBz5C,KAAK,yCAA2C,kEAW1M03C,EAAazkF,UAAUu2E,OAAS,SAAUvc,GACxC,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE2D,EAAW3qB,GAAWA,EAAQ2qB,SAAW3qB,EAAQ2qB,SAAW,OAC5DvkD,EAAOr8B,KAAKq8B,KACZgmD,EAASxB,EAA8B7gF,KAAMi9E,EAAa2D,EAAUvkD,GAAM,GAC1EskD,EAAKpJ,EAAev3E,KAAK6+C,IAG7B,GAFA8hC,OAAmB,IAAPA,EAAqB3gF,KAAK2gF,GAAKA,EAEvB,IAAhBtkD,EAAK5hC,OAAc,CAErB,IAAI6nF,EAAQvE,EAAiB/9E,KAAMi9E,GAC/BsF,EAAUlmD,EAAK,GAAGk2C,MAAMtc,GAM5B,OAJIosB,EAAO,KACTE,EAAU,UAAUrgD,OAAOqgD,EAAS,aAGxB,UAAVD,EAEK3B,EAAK4B,EAGLA,EAAU5B,EAKd,GAAoB,IAAhBtkD,EAAK5hC,OAAc,CAE5B,IAAIu7C,EAAM3Z,EAAK,GAEXqmD,EAAS1sC,EAAIu8B,MAAMtc,GAEnBosB,EAAO,KACTK,EAAS,UAAUxgD,OAAOwgD,EAAQ,aAGpC,IASInB,EAPAoB,EAFMtmD,EAAK,GAEEk2C,MAAMtc,GAgBvB,OAdIosB,EAAO,KACTM,EAAS,UAAUzgD,OAAOygD,EAAQ,aAOlCpB,EADkB,SAAhBtE,EACcjnC,EAAI08B,gBAGJ18B,EAAI28B,aAAaD,gBAG3B1yE,KAAK0yE,iBACX,IAAK,sBAEH,OAAOiO,EAAK,IAAM+B,EAAX/B,KAAgCgC,EAAS,IAElD,IAAK,mBAIH,OAHAD,EAAS,IAAMA,EAAS,IACxBC,EAAS,IAAMA,EAAS,IAEhBpB,GACN,IAAK,kBAEL,IAAK,sBACHmB,EAAS,UAAUxgD,OAAOwgD,EAAQ,YAGtC,MAEF,IAAK,wBACH,GAAI1iF,KAAK4gF,UAAyB,SAAbA,EACnB,OAAO8B,EAAS,IAAMC,EAK5B,OAAOD,EAAS/B,EAAKgC,EAChB,GAAItmD,EAAK5hC,OAAS,IAA+B,qBAAzBuF,KAAK0yE,iBAAmE,0BAAzB1yE,KAAK0yE,iBAA8C,CAC/H,IAAIkQ,EAAevmD,EAAK1lB,KAAI,SAAUmtB,EAAKhF,GAOzC,OANAgF,EAAMA,EAAIyuC,MAAMtc,GAEZosB,EAAOvjD,KACTgF,EAAM,UAAU5B,OAAO4B,EAAK,aAGvBA,KAGT,MAA6B,0BAAzB9jC,KAAK0yE,iBAA+C1yE,KAAK4gF,SACpDgC,EAAa55C,KAAK,KAGpB45C,EAAa55C,KAAK23C,GAKzB,MAAO,YAAc3gF,KAAK6+C,GAAK,WAAaxiB,EAAK1lB,KAAI,SAAUmtB,GAC7D,OAAOA,EAAIyuC,MAAMtc,MAChBjtB,KAAK,KAAO,YASnB03C,EAAazkF,UAAUy2E,cAAgB,WACrC,OAAO1yE,KAAKI,KAAO,IAAMJ,KAAK6+C,IAGzB6hC,IACN,CACD9N,SAAS,EACTtB,QAAQ,ICvqBN,EAAe,CAAC,QACTuR,GAAiC,EAAA3R,EAAA,IAFjC,YAE+C,GAAe1jB,IACvE,IAAI,KACFztC,GACEytC,EAUJ,SAASmwB,EAAUjrE,EAAOC,EAAK8rB,GAC7B,KAAMz+B,gBAAgB29E,GACpB,MAAM,IAAI16C,YAAY,oDAIxB,KAAK,EAAA6uC,EAAA,IAAOp/D,GAAQ,MAAM,IAAIvX,UAAU,iBACxC,KAAK,EAAA22E,EAAA,IAAOn/D,GAAM,MAAM,IAAIxX,UAAU,iBACtC,GAAIsjC,KAAS,EAAAqzC,EAAA,IAAOrzC,GAAO,MAAM,IAAItjC,UAAU,iBAC/C,GAAI6kC,UAAUvlC,OAAS,EAAG,MAAM,IAAI0mC,MAAM,sBAC1CnhC,KAAK0S,MAAQA,EAEb1S,KAAK2S,IAAMA,EAEX3S,KAAKy+B,KAAOA,GAAQ,KAgGtB,SAASoiD,EAA8B/+E,EAAMm7E,GAC3C,IAAI2B,EAAahB,EAAc97E,EAAMm7E,GACjCoF,EAAS,GACTS,EAAkBlF,EAAc97E,EAAK4Q,MAAOuqE,GAGhD,GAFAoF,EAAO3vE,MAA4B,OAApBowE,GAA4BA,GAAmBlE,GAA8B,QAAhB3B,EAExEn7E,EAAK28B,KAAM,CACb,IAAIskD,EAAiBnF,EAAc97E,EAAK28B,KAAMw+C,GAC9CoF,EAAO5jD,KAA0B,OAAnBskD,GAA2BA,GAAkBnE,GAA8B,QAAhB3B,EAG3E,IAAI+F,EAAgBpF,EAAc97E,EAAK6Q,IAAKsqE,GAE5C,OADAoF,EAAO1vE,IAAwB,OAAlBqwE,GAA0BA,GAAiBpE,GAA8B,QAAhB3B,EAC/DoF,EA8IT,OAxPA1E,EAAU1hF,UAAY,IAAI8jB,EAC1B49D,EAAU1hF,UAAUmE,KAAO,YAC3Bu9E,EAAU1hF,UAAUgnF,aAAc,EAOlCtF,EAAU1hF,UAAUinF,SAAW,WAK7B,OAHiBljF,KAAKmN,QAAO,SAAUrL,GACrC,OAAO,EAAAgwE,EAAA,IAAahwE,IAAuB,QAAdA,EAAKnC,QAElBlF,OAAS,GAiB7BkjF,EAAU1hF,UAAUw1E,SAAW,SAAUE,EAAMC,GAC7C,IAAIp/C,EAAQm/C,EAAKn/C,MAEb2wD,EAAYnjF,KAAK0S,MAAM++D,SAASE,EAAMC,GAEtCwR,EAAUpjF,KAAK2S,IAAI8+D,SAASE,EAAMC,GAEtC,GAAI5xE,KAAKy+B,KAAM,CACb,IAAI4kD,EAAWrjF,KAAKy+B,KAAKgzC,SAASE,EAAMC,GAExC,OAAO,SAAuBR,EAAO/0C,EAAM+2C,GACzC,OAAO5gD,EAAM2wD,EAAU/R,EAAO/0C,EAAM+2C,GAAUgQ,EAAQhS,EAAO/0C,EAAM+2C,GAAUiQ,EAASjS,EAAO/0C,EAAM+2C,KAGrG,OAAO,SAAuBhC,EAAO/0C,EAAM+2C,GACzC,OAAO5gD,EAAM2wD,EAAU/R,EAAO/0C,EAAM+2C,GAAUgQ,EAAQhS,EAAO/0C,EAAM+2C,MAUzEuK,EAAU1hF,UAAU0F,QAAU,SAAUuS,GACtCA,EAASlU,KAAK0S,MAAO,QAAS1S,MAC9BkU,EAASlU,KAAK2S,IAAK,MAAO3S,MAEtBA,KAAKy+B,MACPvqB,EAASlU,KAAKy+B,KAAM,OAAQz+B,OAWhC29E,EAAU1hF,UAAU0a,IAAM,SAAUzC,GAClC,OAAO,IAAIypE,EAAU39E,KAAK6xE,QAAQ39D,EAASlU,KAAK0S,MAAO,QAAS1S,OAAQA,KAAK6xE,QAAQ39D,EAASlU,KAAK2S,IAAK,MAAO3S,OAAQA,KAAKy+B,MAAQz+B,KAAK6xE,QAAQ39D,EAASlU,KAAKy+B,KAAM,OAAQz+B,SAQ/K29E,EAAU1hF,UAAUwwD,MAAQ,WAC1B,OAAO,IAAIkxB,EAAU39E,KAAK0S,MAAO1S,KAAK2S,IAAK3S,KAAKy+B,MAAQz+B,KAAKy+B,OAiC/Dk/C,EAAU1hF,UAAUo2E,UAAY,SAAUpc,GACxC,IAGI52B,EAFAgjD,EAASxB,EAA8B7gF,KADzBi2D,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,QAIrEvqE,EAAQ1S,KAAK0S,MAAMhT,SAASu2D,GAQhC,GANIosB,EAAO3vE,QACTA,EAAQ,IAAMA,EAAQ,KAGxB2sB,EAAM3sB,EAEF1S,KAAKy+B,KAAM,CACb,IAAIA,EAAOz+B,KAAKy+B,KAAK/+B,SAASu2D,GAE1BosB,EAAO5jD,OACTA,EAAO,IAAMA,EAAO,KAGtBY,GAAO,IAAMZ,EAGf,IAAI9rB,EAAM3S,KAAK2S,IAAIjT,SAASu2D,GAO5B,OALIosB,EAAO1vE,MACTA,EAAM,IAAMA,EAAM,KAGpB0sB,EAAO,IAAM1sB,GASfgrE,EAAU1hF,UAAUmtD,OAAS,WAC3B,MAAO,CACLkqB,OAAQ,YACR5gE,MAAO1S,KAAK0S,MACZC,IAAK3S,KAAK2S,IACV8rB,KAAMz+B,KAAKy+B,OAYfk/C,EAAUpK,SAAW,SAAUzjB,GAC7B,OAAO,IAAI6tB,EAAU7tB,EAAKp9C,MAAOo9C,EAAKn9C,IAAKm9C,EAAKrxB,OASlDk/C,EAAU1hF,UAAUq2E,OAAS,SAAUrc,GACrC,IAGI52B,EAFAgjD,EAASxB,EAA8B7gF,KADzBi2D,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,QAIrEvqE,EAAQ1S,KAAK0S,MAAM4/D,OAAOrc,GAQ9B,GANIosB,EAAO3vE,QACTA,EAAQ,iEAAmEA,EAAQ,kEAGrF2sB,EAAM3sB,EAEF1S,KAAKy+B,KAAM,CACb,IAAIA,EAAOz+B,KAAKy+B,KAAK6zC,OAAOrc,GAExBosB,EAAO5jD,OACTA,EAAO,iEAAmEA,EAAO,kEAGnFY,GAAO,2DAA6DZ,EAGtE,IAAI9rB,EAAM3S,KAAK2S,IAAI2/D,OAAOrc,GAO1B,OALIosB,EAAO1vE,MACTA,EAAM,iEAAmEA,EAAM,kEAGjF0sB,EAAO,2DAA6D1sB,GAUtEgrE,EAAU1hF,UAAUu2E,OAAS,SAAUvc,GACrC,IACIosB,EAASxB,EAA8B7gF,KADzBi2D,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,QAErE59C,EAAMr/B,KAAK0S,MAAM6/D,MAAMtc,GAM3B,GAJIosB,EAAO3vE,QACT2sB,EAAM,UAAU6C,OAAO7C,EAAK,aAG1Br/B,KAAKy+B,KAAM,CACb,IAAIA,EAAOz+B,KAAKy+B,KAAK8zC,MAAMtc,GAEvBosB,EAAO5jD,OACTA,EAAO,UAAUyD,OAAOzD,EAAM,aAGhCY,GAAO,IAAMZ,EAGf,IAAI9rB,EAAM3S,KAAK2S,IAAI4/D,MAAMtc,GAOzB,OALIosB,EAAO1vE,MACTA,EAAM,UAAUuvB,OAAOvvB,EAAK,aAG9B0sB,EAAO,IAAM1sB,GAIRgrE,IACN,CACD/K,SAAS,EACTtB,QAAQ,ICrRN,EAAe,CAAC,QAAS,QAClBgS,GAA8C,EAAApS,EAAA,IAF9C,yBAE4D,GAAe1jB,IACpF,IAAI,MACF+1B,EAAK,KACLxjE,GACEytC,EAcJ,SAAS2vB,EAAuBx9E,EAAM2yB,EAAQk/C,GAC5C,KAAMxxE,gBAAgBm9E,GACpB,MAAM,IAAIl6C,YAAY,oDAIxB,GAAoB,iBAATtjC,EAAmB,MAAM,IAAIxE,UAAU,wCAClD,IAAKP,MAAMgD,QAAQ00B,GAAS,MAAM,IAAIn3B,UAAU,uEAChD,KAAK,EAAA22E,EAAA,IAAON,GAAO,MAAM,IAAIr2E,UAAU,sCACvC,GAAIwE,KAAQoxE,EAAU,MAAM,IAAI5vC,MAAM,2BAA6BxhC,EAAO,2BAC1EK,KAAKL,KAAOA,EACZK,KAAKsyB,OAASA,EAAO3b,KAAI,SAAUo9D,GACjC,OAAOA,GAASA,EAAMp0E,MAAQo0E,KAEhC/zE,KAAKwrE,MAAQl5C,EAAO3b,KAAI,SAAUo9D,GAChC,OAAOA,GAASA,EAAM3zE,MAAQ,SAEhCJ,KAAKwxE,KAAOA,EA0Fd,SAASgS,EAAgB1hF,EAAMm7E,GAC7B,IAAI2B,EAAahB,EAAc97E,EAAMm7E,GACjCwG,EAAiB7F,EAAc97E,EAAK0vE,KAAMyL,GAC9C,MAAuB,QAAhBA,GAA4C,OAAnBwG,GAA2BA,GAAkB7E,EA4F/E,OAtLAzB,EAAuBlhF,UAAY,IAAI8jB,EACvCo9D,EAAuBlhF,UAAUmE,KAAO,yBACxC+8E,EAAuBlhF,UAAUynF,0BAA2B,EAe5DvG,EAAuBlhF,UAAUw1E,SAAW,SAAUE,EAAMC,GAC1D,IAAI+R,EAAgBhoF,OAAO2B,OAAOs0E,IAClC,QAAQ5xE,KAAKsyB,QAAQ,SAAUyhD,GAC7B4P,EAAc5P,IAAS,KAGzB,IAAI6P,EAAW5jF,KAAKwxE,KAAKC,SAASE,EAAMgS,GAEpChkF,EAAOK,KAAKL,KACZ2yB,EAAStyB,KAAKsyB,OACduxD,GAAY,QAAK7jF,KAAKwrE,MAAO,KAC7BsY,EAASnkF,EAAO,KAAM,QAAKK,KAAKsyB,OAAQ,MAAQ,IACpD,OAAO,SAAoC8+C,EAAO/0C,EAAM+2C,GACtD,IAAI2Q,EAAa,GAEjBA,EAAWF,GAAa,WAGtB,IAFA,IAAIG,EAAYroF,OAAO2B,OAAO++B,GAErB3hC,EAAI,EAAGA,EAAI43B,EAAO73B,OAAQC,IACjCspF,EAAU1xD,EAAO53B,IAAMslC,UAAUtlC,GAGnC,OAAOkpF,EAASxS,EAAO4S,EAAW5Q,IAGpC,IAAIv0B,EAAK0kC,EAAM5jF,EAAMokF,GAGrB,OAFAllC,EAAGilC,OAASA,GACZ,QAAgB1S,EAAOzxE,EAAMk/C,GACtBA,IASXs+B,EAAuBlhF,UAAU0F,QAAU,SAAUuS,GACnDA,EAASlU,KAAKwxE,KAAM,OAAQxxE,OAU9Bm9E,EAAuBlhF,UAAU0a,IAAM,SAAUzC,GAC/C,IAAIs9D,EAAOxxE,KAAK6xE,QAAQ39D,EAASlU,KAAKwxE,KAAM,OAAQxxE,OAEpD,OAAO,IAAIm9E,EAAuBn9E,KAAKL,KAAMK,KAAKsyB,OAAOxzB,MAAM,GAAI0yE,IAQrE2L,EAAuBlhF,UAAUwwD,MAAQ,WACvC,OAAO,IAAI0wB,EAAuBn9E,KAAKL,KAAMK,KAAKsyB,OAAOxzB,MAAM,GAAIkB,KAAKwxE,OAsB1E2L,EAAuBlhF,UAAUo2E,UAAY,SAAUpc,GACrD,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrEzL,EAAOxxE,KAAKwxE,KAAK9xE,SAASu2D,GAM9B,OAJIutB,EAAgBxjF,KAAMi9E,KACxBzL,EAAO,IAAMA,EAAO,KAGfxxE,KAAKL,KAAO,IAAMK,KAAKsyB,OAAO0W,KAAK,MAAQ,OAASwoC,GAQ7D2L,EAAuBlhF,UAAUmtD,OAAS,WACxC,IAAIoiB,EAAQxrE,KAAKwrE,MACjB,MAAO,CACL8H,OAAQ,yBACR3zE,KAAMK,KAAKL,KACX2yB,OAAQtyB,KAAKsyB,OAAO3b,KAAI,SAAUo9D,EAAOj1C,GACvC,MAAO,CACLn/B,KAAMo0E,EACN3zE,KAAMorE,EAAM1sC,OAGhB0yC,KAAMxxE,KAAKwxE,OAYf2L,EAAuB5J,SAAW,SAAUzjB,GAC1C,OAAO,IAAIqtB,EAAuBrtB,EAAKnwD,KAAMmwD,EAAKx9B,OAAQw9B,EAAK0hB,OASjE2L,EAAuBlhF,UAAUq2E,OAAS,SAAUrc,GAIlD,IAHA,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrE3qD,EAAS,GAEJ53B,EAAI,EAAGA,EAAIsF,KAAKsyB,OAAO73B,OAAQC,IACtC43B,EAAO9zB,KAAK,6CAA8C,QAAOwB,KAAKsyB,OAAO53B,IAAM,WAGrF,IAAI82E,EAAOxxE,KAAKwxE,KAAKc,OAAOrc,GAM5B,OAJIutB,EAAgBxjF,KAAMi9E,KACxBzL,EAAO,iEAAmEA,EAAO,kEAG5E,gCAAiC,QAAOxxE,KAAKL,MAA7C,wEAAoI2yB,EAAO0W,KAAK,yCAA2C,qLAAuLwoC,GAS3X2L,EAAuBlhF,UAAUu2E,OAAS,SAAUvc,GAClD,IAAIgnB,EAAchnB,GAAWA,EAAQgnB,YAAchnB,EAAQgnB,YAAc,OACrEzL,EAAOxxE,KAAKwxE,KAAKe,MAAMtc,GAM3B,OAJIutB,EAAgBxjF,KAAMi9E,KACxBzL,EAAO,UAAUtvC,OAAOsvC,EAAM,aAGzB,YAAcxxE,KAAKL,KAAO,WAAaK,KAAKsyB,OAAO3b,IAAIolE,GAAU/yC,KAAK,KAAO,aAAewoC,GAG9F2L,IACN,CACDvK,SAAS,EACTtB,QAAQ,ICxON,EAAO,QACP,EAAe,CAAC,QAAS,SAClB2S,GAA6B,EAAA/S,EAAA,IAAQ,EAAM,GAAe1jB,IACnE,IAAI,MACF+1B,EAAK,MACLtE,GACEzxB,EAqCJ,OAAO+1B,EAAM,EAAM,CACjB,GAAI,WACF,OAAO,IAAItE,GAEbiF,IAAK,SAAapnF,GAChB,OAAO,IAAImiF,EAAMniF,S,UC1ChB,SAASqnF,EAAe1lF,GAC7B,OAAIA,GAAOA,EAAI2lF,aACN,IAAIC,EAAA,EAAW5lF,EAAIqgC,MAAQ,EAAGrgC,EAAI+pB,IAAM,OAAerqB,IAAZM,EAAIiqB,IAAoBjqB,EAAIiqB,IAAM,OAAIvqB,GAGnFM,ECVF,SAAS6lF,EAAc92B,GAC5B,IAAI,OACFn9B,GACEm9B,EAaJ,OAAO,SAAgBhxD,EAAQsiC,GAC7B,IACE,GAAIlkC,MAAMgD,QAAQpB,GAChB,OAAO6zB,EAAO7zB,EAAQsiC,GACjB,GAAItiC,GAAmC,mBAAlBA,EAAO6zB,OAEjC,OAAO7zB,EAAO6zB,OAAOyO,GAChB,GAAsB,iBAAXtiC,EAEhB,OAAO6zB,EAAO7zB,EAAQsiC,GACjB,GAAsB,iBAAXtiC,EAAqB,CACrC,IAAKsiC,EAAMylD,mBACT,MAAM,IAAIppF,UAAU,mDAGtB,OAAO,QAAgBqB,EAAQsiC,EAAM0lD,qBAErC,MAAM,IAAIrpF,UAAU,kDAEtB,MAAOsD,GACP,MAAM0lF,EAAe1lF,KClC3B,IACI,GAAe,CAAC,SAAU,QACnBgmF,IAAoC,EAAAvT,EAAA,IAFpC,eAEkD,IAAe1jB,IAC1E,IAAI,OACFn9B,EAAM,KACNtQ,GACEytC,EACAk3B,EAASJ,EAAc,CACzBj0D,WAYF,SAASs0D,EAAanoF,EAAQsiC,GAC5B,KAAM9+B,gBAAgB2kF,GACpB,MAAM,IAAI1hD,YAAY,oDAGxB,KAAK,EAAA6uC,EAAA,IAAOt1E,GACV,MAAM,IAAIrB,UAAU,wCAGtB,KAAK,EAAA22E,EAAA,IAAYhzC,GACf,MAAM,IAAI3jC,UAAU,4CAGtB6E,KAAKxD,OAASA,GAAU,KACxBwD,KAAK8+B,MAAQA,EAEbnjC,OAAOC,eAAeoE,KAAM,OAAQ,CAClC1D,IAAK,WACH,OAAI0D,KAAK8+B,MACA9+B,KAAK8+B,MAAMylD,mBAAqBvkF,KAAK8+B,MAAM0lD,oBAAsB,GAEjExkF,KAAKxD,OAAOmD,MAAQ,IAE7Bu6C,KAAKl6C,MACP6qB,IAAK,WACH,MAAM,IAAIsW,MAAM,kDAsJtB,SAASqiD,EAAgB1hF,GAEvB,SAAS,EAAAgwE,EAAA,IAAehwE,KAAS,EAAAgwE,EAAA,IAAYhwE,KAAS,EAAAgwE,EAAA,IAAehwE,KAAS,EAAAgwE,EAAA,IAAehwE,KAAS,EAAAgwE,EAAA,IAAahwE,KAAS,EAAAgwE,EAAA,IAAkBhwE,KAAS,EAAAgwE,EAAA,IAAahwE,IAGtK,OAtJA6iF,EAAa1oF,UAAY,IAAI8jB,EAC7B4kE,EAAa1oF,UAAUmE,KAAO,eAC9BukF,EAAa1oF,UAAU2oF,gBAAiB,EAexCD,EAAa1oF,UAAUw1E,SAAW,SAAUE,EAAMC,GAChD,IAAIiT,EAAa7kF,KAAKxD,OAAOi1E,SAASE,EAAMC,GAExCkT,EAAY9kF,KAAK8+B,MAAM2yC,SAASE,EAAMC,GAE1C,GAAI5xE,KAAK8+B,MAAMylD,mBAAoB,CACjC,IAAI1lD,EAAO7+B,KAAK8+B,MAAM0lD,oBACtB,OAAO,SAA0BpT,EAAO/0C,EAAM+2C,GAC5C,OAAO,QAAgByR,EAAWzT,EAAO/0C,EAAM+2C,GAAUv0C,IAG3D,OAAO,SAA0BuyC,EAAO/0C,EAAM+2C,GAC5C,IAAI52E,EAASqoF,EAAWzT,EAAO/0C,EAAM+2C,GACjCt0C,EAAQgmD,EAAU1T,EAAO/0C,EAAM7/B,GAEnC,OAAOkoF,EAAOloF,EAAQsiC,KAU5B6lD,EAAa1oF,UAAU0F,QAAU,SAAUuS,GACzCA,EAASlU,KAAKxD,OAAQ,SAAUwD,MAChCkU,EAASlU,KAAK8+B,MAAO,QAAS9+B,OAUhC2kF,EAAa1oF,UAAU0a,IAAM,SAAUzC,GACrC,OAAO,IAAIywE,EAAa3kF,KAAK6xE,QAAQ39D,EAASlU,KAAKxD,OAAQ,SAAUwD,OAAQA,KAAK6xE,QAAQ39D,EAASlU,KAAK8+B,MAAO,QAAS9+B,SAQ1H2kF,EAAa1oF,UAAUwwD,MAAQ,WAC7B,OAAO,IAAIk4B,EAAa3kF,KAAKxD,OAAQwD,KAAK8+B,QAS5C6lD,EAAa1oF,UAAUo2E,UAAY,SAAUpc,GAC3C,IAAIz5D,EAASwD,KAAKxD,OAAOkD,SAASu2D,GAMlC,OAJIutB,EAAgBxjF,KAAKxD,UACvBA,EAAS,IAAMA,EAAS,KAGnBA,EAASwD,KAAK8+B,MAAMp/B,SAASu2D,IAStC0uB,EAAa1oF,UAAUq2E,OAAS,SAAUrc,GACxC,IAAIz5D,EAASwD,KAAKxD,OAAO81E,OAAOrc,GAMhC,OAJIutB,EAAgBxjF,KAAKxD,UACvBA,EAAS,iEAAmEA,EAAS,kEAGhFA,EAASwD,KAAK8+B,MAAMwzC,OAAOrc,IASpC0uB,EAAa1oF,UAAUu2E,OAAS,SAAUvc,GACxC,IAAIz5D,EAASwD,KAAKxD,OAAO+1E,MAAMtc,GAM/B,OAJIutB,EAAgBxjF,KAAKxD,UACvBA,EAAS,iCAGJA,EAASwD,KAAK8+B,MAAMyzC,MAAMtc,IAQnC0uB,EAAa1oF,UAAUmtD,OAAS,WAC9B,MAAO,CACLkqB,OAAQ,eACR92E,OAAQwD,KAAKxD,OACbsiC,MAAO9+B,KAAK8+B,QAYhB6lD,EAAapR,SAAW,SAAUzjB,GAChC,OAAO,IAAI60B,EAAa70B,EAAKtzD,OAAQszD,EAAKhxB,QAarC6lD,IACN,CACD/R,SAAS,EACTtB,QAAQ,ICzMN,GAAe,CAAC,QAAS,OAAQ,QAC1ByT,IAAiC,EAAA7T,EAAA,IAFjC,YAE+C,IAAe1jB,IACvE,IAAI,MACFw3B,EAAK,KACLjlE,EAAI,KACJ2B,GACE8rC,EAiBJ,SAASy3B,EAAUC,EAAYC,GAC7B,KAAMnlF,gBAAgBilF,GACpB,MAAM,IAAIhiD,YAAY,oDAMxB,GAHAjjC,KAAKklF,WAAaA,EAClBllF,KAAKmlF,YAAcA,IAAe,GAE7BvqF,MAAMgD,QAAQsnF,KAAgBA,EAAWlS,MAAMlB,EAAA,IAClD,MAAM,IAAI32E,UAAU,8DAGtB,GAAI6E,KAAKmlF,cAAgBnlF,KAAKukF,mBAC5B,MAAM,IAAIpjD,MAAM,qDA4NpB,SAASquC,EAAY98D,EAAOC,EAAK8rB,GAC/B,OAAO,IAAIumD,GAAM,EAAAlT,EAAA,IAAYp/D,GAASA,EAAM+1C,WAAa/1C,GAAO,EAAAo/D,EAAA,IAAYn/D,GAAOA,EAAI81C,WAAa91C,GAAK,EAAAm/D,EAAA,IAAYrzC,GAAQA,EAAKgqB,WAAahqB,GAGjJ,OA5NAwmD,EAAUhpF,UAAY,IAAI8jB,EAC1BklE,EAAUhpF,UAAUmE,KAAO,YAC3B6kF,EAAUhpF,UAAUmpF,aAAc,EAelCH,EAAUhpF,UAAUw1E,SAAW,SAAUE,EAAMC,GAM7C,IAAIyT,GAAiB,QAAIrlF,KAAKklF,YAAY,SAAU1yD,EAAO93B,GACzD,IAAI,EAAAo3E,EAAA,IAAYt/C,GAAQ,CACtB,GAAIA,EAAM0wD,WAAY,CAEpB,IAAIS,EAAgBhoF,OAAO2B,OAAOs0E,GAClC+R,EAAchxE,KAAM,EAEpB,IAAIwwE,EAAY3wD,EAAM9f,MAAM++D,SAASE,EAAMgS,GAEvCP,EAAU5wD,EAAM7f,IAAI8+D,SAASE,EAAMgS,GAEnCN,EAAW7wD,EAAMiM,KAAOjM,EAAMiM,KAAKgzC,SAASE,EAAMgS,GAAiB,WACrE,OAAO,GAET,OAAO,SAAuBvS,EAAO/0C,EAAM+2C,GACzC,IAAIz/D,EAAI+N,EAAK0xD,GAASjqB,UAClB66B,EAAYroF,OAAO2B,OAAO++B,GAE9B,OADA2nD,EAAUrxE,IAAMgB,EAAEjZ,GACX80E,EAAY2T,EAAU/R,EAAO4S,EAAW5Q,GAAUgQ,EAAQhS,EAAO4S,EAAW5Q,GAAUiQ,EAASjS,EAAO4S,EAAW5Q,KAI1H,IAAIkS,EAAa9yD,EAAM9f,MAAM++D,SAASE,EAAMC,GAExC2T,EAAW/yD,EAAM7f,IAAI8+D,SAASE,EAAMC,GAEpC4T,EAAYhzD,EAAMiM,KAAOjM,EAAMiM,KAAKgzC,SAASE,EAAMC,GAAY,WACjE,OAAO,GAGT,OAAO,SAAuBR,EAAO/0C,EAAM+2C,GACzC,OAAO5D,EAAY8V,EAAWlU,EAAO/0C,EAAM+2C,GAAUmS,EAASnU,EAAO/0C,EAAM+2C,GAAUoS,EAAUpU,EAAO/0C,EAAM+2C,KAG3G,IAAI,EAAAtB,EAAA,IAAat/C,IAAyB,QAAfA,EAAM7yB,KAAgB,CAEtD,IAAI8lF,EAAiB9pF,OAAO2B,OAAOs0E,GAEnC6T,EAAe9yE,KAAM,EAErB,IAAI+yE,EAAYlzD,EAAMi/C,SAASE,EAAM8T,GAErC,OAAO,SAAuBrU,EAAO/0C,EAAM+2C,GACzC,IAAIz/D,EAAI+N,EAAK0xD,GAASjqB,UAClB66B,EAAYroF,OAAO2B,OAAO++B,GAE9B,OADA2nD,EAAUrxE,IAAMgB,EAAEjZ,GACXgrF,EAAUtU,EAAO4S,EAAW5Q,IAIrC,IAAIuS,EAAanzD,EAAMi/C,SAASE,EAAMC,GAEtC,OAAO,SAAuBR,EAAO/0C,EAAM+2C,GACzC,OAAOuS,EAAWvU,EAAO/0C,EAAM+2C,OAIjCt0C,GAAQ,QAAgB6yC,EAAM,SAClC,OAAO,SAAuBP,EAAO/0C,EAAM+2C,GACzC,IAAI8R,GAAa,QAAIG,GAAgB,SAAUO,GAC7C,OAAOA,EAAcxU,EAAO/0C,EAAM+2C,MAEpC,OAAOt0C,KAASomD,KASpBD,EAAUhpF,UAAU0F,QAAU,SAAUuS,GACtC,IAAK,IAAIxZ,EAAI,EAAGA,EAAIsF,KAAKklF,WAAWzqF,OAAQC,IAC1CwZ,EAASlU,KAAKklF,WAAWxqF,GAAI,cAAgBA,EAAI,IAAKsF,OAW1DilF,EAAUhpF,UAAU0a,IAAM,SAAUzC,GAGlC,IAFA,IAAIgxE,EAAa,GAERxqF,EAAI,EAAGA,EAAIsF,KAAKklF,WAAWzqF,OAAQC,IAC1CwqF,EAAWxqF,GAAKsF,KAAK6xE,QAAQ39D,EAASlU,KAAKklF,WAAWxqF,GAAI,cAAgBA,EAAI,IAAKsF,OAGrF,OAAO,IAAIilF,EAAUC,EAAYllF,KAAKmlF,cAQxCF,EAAUhpF,UAAUwwD,MAAQ,WAC1B,OAAO,IAAIw4B,EAAUjlF,KAAKklF,WAAWpmF,MAAM,GAAIkB,KAAKmlF,cAQtDF,EAAUhpF,UAAUsoF,iBAAmB,WACrC,OAAkC,IAA3BvkF,KAAKklF,WAAWzqF,SAAgB,EAAAq3E,EAAA,IAAe9xE,KAAKklF,WAAW,KAA2C,iBAA7BllF,KAAKklF,WAAW,GAAGpoF,OASzGmoF,EAAUhpF,UAAUuoF,kBAAoB,WACtC,OAAOxkF,KAAKukF,mBAAqBvkF,KAAKklF,WAAW,GAAGpoF,MAAQ,MAS9DmoF,EAAUhpF,UAAUo2E,UAAY,SAAUpc,GAExC,OAAOj2D,KAAKmlF,YAAc,IAAMnlF,KAAKwkF,oBAAsB,IAAMxkF,KAAKklF,WAAWl8C,KAAK,MAAQ,KAQhGi8C,EAAUhpF,UAAUmtD,OAAS,WAC3B,MAAO,CACLkqB,OAAQ,YACR4R,WAAYllF,KAAKklF,WACjBC,YAAanlF,KAAKmlF,cAYtBF,EAAU1R,SAAW,SAAUzjB,GAC7B,OAAO,IAAIm1B,EAAUn1B,EAAKo1B,WAAYp1B,EAAKq1B,cAS7CF,EAAUhpF,UAAUq2E,OAAS,SAAUrc,GAIrC,IAFA,IAAIivB,EAAa,GAERxqF,EAAI,EAAGA,EAAIsF,KAAKklF,WAAWzqF,OAAQC,IAC1CwqF,EAAWxqF,GAAKsF,KAAKklF,WAAWxqF,GAAG43E,SAGrC,OAAItyE,KAAKmlF,YACA,uGAA6G,QAAOnlF,KAAKwkF,qBAAuB,UAEhJ,kEAAoEU,EAAWl8C,KAAK,yCAA2C,mEAU1Ii8C,EAAUhpF,UAAUu2E,OAAS,SAAUvc,GACrC,IAAIivB,EAAallF,KAAKklF,WAAWvuE,KAAI,SAAU6b,GAC7C,OAAOA,EAAM+/C,MAAMtc,MAErB,OAAOj2D,KAAKmlF,YAAc,IAAMnlF,KAAKwkF,oBAA2B,KAAOU,EAAWl8C,KAAK,KAAO,KAQzFi8C,IACN,CACDrS,SAAS,EACTtB,QAAQ,ICtQN,GAAe,CAAC,SAAU,UAC9B,QACWuU,IAAsC,EAAA3U,EAAA,IAHtC,iBAGoD,IAAe1jB,IAC5E,IAAI,OACFn9B,EAAM,OACNhlB,EAAM,KACN0U,GACEytC,EACAk3B,EAASJ,EAAc,CACzBj0D,WAEEwF,EChBC,SAAuB23B,GAC5B,IAAI,OACFn9B,EAAM,OACNhlB,GACEmiD,EAgBJ,OAAO,SAAgBhxD,EAAQsiC,EAAOhiC,GACpC,IACE,GAAIlC,MAAMgD,QAAQpB,GAEhB,OAAO6O,EAAO7O,GAAQ6zB,OAAOyO,EAAOhiC,GAAOqsD,UACtC,GAAI3sD,GAAmC,mBAAlBA,EAAO6zB,OAEjC,OAAO7zB,EAAO6zB,OAAOyO,EAAOhiC,GACvB,GAAsB,iBAAXN,EAEhB,OAAO6zB,EAAO7zB,EAAQsiC,EAAOhiC,GACxB,GAAsB,iBAAXN,EAAqB,CACrC,IAAKsiC,EAAMylD,mBACT,MAAMppF,UAAU,mDAIlB,OADA,QAAgBqB,EAAQsiC,EAAM0lD,oBAAqB1nF,GAC5CN,EAEP,MAAM,IAAIrB,UAAU,kDAEtB,MAAOsD,GACP,MAAM0lF,EAAe1lF,KD1BZqnF,CAAc,CACzBz1D,SACAhlB,WA6BF,SAAS6xE,EAAe1gF,EAAQsiC,EAAOhiC,GACrC,KAAMkD,gBAAgBk9E,GACpB,MAAM,IAAIj6C,YAAY,oDAOxB,GAJAjjC,KAAKxD,OAASA,EACdwD,KAAK8+B,MAAQhiC,EAAQgiC,EAAQ,KAC7B9+B,KAAKlD,MAAQA,GAASgiC,IAEjB,EAAAgzC,EAAA,IAAat1E,MAAY,EAAAs1E,EAAA,IAAet1E,GAC3C,MAAM,IAAIrB,UAAU,mDAGtB,IAAI,EAAA22E,EAAA,IAAat1E,IAA2B,QAAhBA,EAAOmD,KACjC,MAAM,IAAIwhC,MAAM,iCAGlB,GAAInhC,KAAK8+B,SAAU,EAAAgzC,EAAA,IAAY9xE,KAAK8+B,OAElC,MAAM,IAAI3jC,UAAU,iCAGtB,KAAK,EAAA22E,EAAA,IAAO9xE,KAAKlD,OACf,MAAM,IAAI3B,UAAU,4BAItBQ,OAAOC,eAAeoE,KAAM,OAAQ,CAClC1D,IAAK,WACH,OAAI0D,KAAK8+B,MACA9+B,KAAK8+B,MAAMylD,mBAAqBvkF,KAAK8+B,MAAM0lD,oBAAsB,GAEjExkF,KAAKxD,OAAOmD,MAAQ,IAE7Bu6C,KAAKl6C,MACP6qB,IAAK,WACH,MAAM,IAAIsW,MAAM,kDAgJtB,SAASqiD,EAAgB1hF,EAAMm7E,GACxBA,IACHA,EAAc,QAGhB,IAAI2B,EAAahB,EAAc97E,EAAMm7E,GACjCwG,EAAiB7F,EAAc97E,EAAKhF,MAAOmgF,GAC/C,MAAuB,QAAhBA,GAA4C,OAAnBwG,GAA2BA,GAAkB7E,EAmF/E,OArOA1B,EAAejhF,UAAY,IAAI8jB,EAC/Bm9D,EAAejhF,UAAUmE,KAAO,iBAChC88E,EAAejhF,UAAU8pF,kBAAmB,EAe5C7I,EAAejhF,UAAUw1E,SAAW,SAAUE,EAAMC,GAClD,IAAIiT,EAAa7kF,KAAKxD,OAAOi1E,SAASE,EAAMC,GAExCkT,EAAY9kF,KAAK8+B,MAAQ9+B,KAAK8+B,MAAM2yC,SAASE,EAAMC,GAAY,KAE/DoU,EAAYhmF,KAAKlD,MAAM20E,SAASE,EAAMC,GAEtCjyE,EAAOK,KAAKxD,OAAOmD,KAEvB,GAAKK,KAAK8+B,MASH,IAAI9+B,KAAK8+B,MAAMylD,mBAAoB,CAExC,IAAI1lD,EAAO7+B,KAAK8+B,MAAM0lD,oBACtB,OAAO,SAA4BpT,EAAO/0C,EAAM+2C,GAC9C,IAAI52E,EAASqoF,EAAWzT,EAAO/0C,EAAM+2C,GACjCt2E,EAAQkpF,EAAU5U,EAAO/0C,EAAM+2C,GACnC,OAAO,QAAgB52E,EAAQqiC,EAAM/hC,IAElC,IAAI,EAAAg1E,EAAA,IAAa9xE,KAAKxD,QAE3B,OAAO,SAA4B40E,EAAO/0C,EAAM+2C,GAC9C,IAAI6S,EAAcpB,EAAWzT,EAAO/0C,EAAM+2C,GACtCt2E,EAAQkpF,EAAU5U,EAAO/0C,EAAM+2C,GAC/Bt0C,EAAQgmD,EAAU1T,EAAO/0C,EAAM4pD,GAGnC,OADA,QAAgB7U,EAAOzxE,EAAMk2B,EAAOowD,EAAannD,EAAOhiC,IACjDA,GAQT,IAAIopF,EAAmBlmF,KAAKxD,OAAOA,OAAOi1E,SAASE,EAAMC,GAEzD,GAAI5xE,KAAKxD,OAAOsiC,MAAMylD,mBAAoB,CACxC,IAAI4B,EAAanmF,KAAKxD,OAAOsiC,MAAM0lD,oBACnC,OAAO,SAA4BpT,EAAO/0C,EAAM+2C,GAC9C,IAAIn+D,EAASixE,EAAiB9U,EAAO/0C,EAAM+2C,GACvC6S,GAAc,QAAgBhxE,EAAQkxE,GACtCrnD,EAAQgmD,EAAU1T,EAAO/0C,EAAM4pD,GAE/BnpF,EAAQkpF,EAAU5U,EAAO/0C,EAAM+2C,GAEnC,OADA,QAAgBn+D,EAAQkxE,EAAYtwD,EAAOowD,EAAannD,EAAOhiC,IACxDA,GAIT,IAAIspF,EAAkBpmF,KAAKxD,OAAOsiC,MAAM2yC,SAASE,EAAMC,GAEvD,OAAO,SAA4BR,EAAO/0C,EAAM+2C,GAC9C,IAAIn+D,EAASixE,EAAiB9U,EAAO/0C,EAAM+2C,GACvCiT,EAAcD,EAAgBhV,EAAO/0C,EAAMpnB,GAE3CgxE,EAAcvB,EAAOzvE,EAAQoxE,GAC7BvnD,EAAQgmD,EAAU1T,EAAO/0C,EAAM4pD,GAE/BnpF,EAAQkpF,EAAU5U,EAAO/0C,EAAM+2C,GAEnC,OADAv9C,EAAO5gB,EAAQoxE,EAAaxwD,EAAOowD,EAAannD,EAAOhiC,IAChDA,GAzDX,KAAK,EAAAg1E,EAAA,IAAa9xE,KAAKxD,QACrB,MAAM,IAAIrB,UAAU,iCAGtB,OAAO,SAA4Bi2E,EAAO/0C,EAAM+2C,GAC9C,OAAO,QAAgBhC,EAAOzxE,EAAMqmF,EAAU5U,EAAO/0C,EAAM+2C,MA+DjE8J,EAAejhF,UAAU0F,QAAU,SAAUuS,GAC3CA,EAASlU,KAAKxD,OAAQ,SAAUwD,MAE5BA,KAAK8+B,OACP5qB,EAASlU,KAAK8+B,MAAO,QAAS9+B,MAGhCkU,EAASlU,KAAKlD,MAAO,QAASkD,OAUhCk9E,EAAejhF,UAAU0a,IAAM,SAAUzC,GAOvC,OAAO,IAAIgpE,EANEl9E,KAAK6xE,QAAQ39D,EAASlU,KAAKxD,OAAQ,SAAUwD,OAE9CA,KAAK8+B,MAAQ9+B,KAAK6xE,QAAQ39D,EAASlU,KAAK8+B,MAAO,QAAS9+B,OAAS,KAEjEA,KAAK6xE,QAAQ39D,EAASlU,KAAKlD,MAAO,QAASkD,SAUzDk9E,EAAejhF,UAAUwwD,MAAQ,WAC/B,OAAO,IAAIywB,EAAel9E,KAAKxD,OAAQwD,KAAK8+B,MAAO9+B,KAAKlD,QA0B1DogF,EAAejhF,UAAUo2E,UAAY,SAAUpc,GAC7C,IAAIz5D,EAASwD,KAAKxD,OAAOkD,SAASu2D,GAC9Bn3B,EAAQ9+B,KAAK8+B,MAAQ9+B,KAAK8+B,MAAMp/B,SAASu2D,GAAW,GACpDn5D,EAAQkD,KAAKlD,MAAM4C,SAASu2D,GAMhC,OAJIutB,EAAgBxjF,KAAMi2D,GAAWA,EAAQgnB,eAC3CngF,EAAQ,IAAMA,EAAQ,KAGjBN,EAASsiC,EAAQ,MAAQhiC,GAQlCogF,EAAejhF,UAAUmtD,OAAS,WAChC,MAAO,CACLkqB,OAAQ,iBACR92E,OAAQwD,KAAKxD,OACbsiC,MAAO9+B,KAAK8+B,MACZhiC,MAAOkD,KAAKlD,QAYhBogF,EAAe3J,SAAW,SAAUzjB,GAClC,OAAO,IAAIotB,EAAeptB,EAAKtzD,OAAQszD,EAAKhxB,MAAOgxB,EAAKhzD,QAS1DogF,EAAejhF,UAAUq2E,OAAS,SAAUrc,GAC1C,IAAIz5D,EAASwD,KAAKxD,OAAO81E,OAAOrc,GAC5Bn3B,EAAQ9+B,KAAK8+B,MAAQ9+B,KAAK8+B,MAAMwzC,OAAOrc,GAAW,GAClDn5D,EAAQkD,KAAKlD,MAAMw1E,OAAOrc,GAM9B,OAJIutB,EAAgBxjF,KAAMi2D,GAAWA,EAAQgnB,eAC3CngF,EAAQ,iEAAmEA,EAAQ,kEAG9EN,EAASsiC,EAAQ,uHAAyHhiC,GASnJogF,EAAejhF,UAAUu2E,OAAS,SAAUvc,GAC1C,IAAIz5D,EAASwD,KAAKxD,OAAO+1E,MAAMtc,GAC3Bn3B,EAAQ9+B,KAAK8+B,MAAQ9+B,KAAK8+B,MAAMyzC,MAAMtc,GAAW,GACjDn5D,EAAQkD,KAAKlD,MAAMy1E,MAAMtc,GAM7B,OAJIutB,EAAgBxjF,KAAMi2D,GAAWA,EAAQgnB,eAC3CngF,EAAQ,UAAUolC,OAAOplC,EAAO,aAG3BN,EAASsiC,EAAQ,KAAOhiC,GAG1BogF,IACN,CACDtK,SAAS,EACTtB,QAAQ,IE7TN,GAAe,CAAC,OAAQ,QAAS,QAC1BgV,IAAkC,EAAApV,EAAA,IAFlC,aAEgD,IAAe1jB,IACxE,IAAI,KACFmkB,EAAI,KACJ4U,EAAI,KACJxmE,GACEytC,EAOJ,SAASg5B,EAAgB7mF,GACvB,QAAO4mF,GAAOA,EAAKC,gBAAgB7mF,GAWrC,SAAS8mF,EAAW9mF,GAClB,KAAMK,gBAAgBymF,GACpB,MAAM,IAAIxjD,YAAY,oDAIxB,GAAoB,iBAATtjC,EAAmB,MAAM,IAAIxE,UAAU,wCAClD6E,KAAKL,KAAOA,EAqKd,OAlKA8mF,EAAWxqF,UAAY,IAAI8jB,EAC3B0mE,EAAWxqF,UAAUmE,KAAO,aAC5BqmF,EAAWxqF,UAAUyqF,cAAe,EAepCD,EAAWxqF,UAAUw1E,SAAW,SAAUE,EAAMC,GAC9C,IAAIjyE,EAAOK,KAAKL,KAEhB,IAAuB,IAAnBiyE,EAASjyE,GAGX,OAAO,SAAUyxE,EAAO/0C,EAAM+2C,GAC5B,OAAO/2C,EAAK18B,IAET,GAAIA,KAAQgyE,EACjB,OAAO,SAAUP,EAAO/0C,EAAM+2C,GAC5B,OAAOzzE,KAAQyxE,GAAQ,QAAgBA,EAAOzxE,IAAQ,QAAgBgyE,EAAMhyE,IAG9E,IAAIq8E,EAASwK,EAAgB7mF,GAC7B,OAAO,SAAUyxE,EAAO/0C,EAAM+2C,GAC5B,OAAOzzE,KAAQyxE,GAAQ,QAAgBA,EAAOzxE,GAAQq8E,EAAS,IAAIuK,EAAK,KAAM5mF,GA6BpF,SAAeA,GACb,MAAM,IAAIwhC,MAAM,oBAAsBxhC,GA9BoDgnF,CAAMhnF,KAUlG8mF,EAAWxqF,UAAU0F,QAAU,SAAUuS,KAUzCuyE,EAAWxqF,UAAU0a,IAAM,SAAUzC,GACnC,OAAOlU,KAAKysD,SAiBdg6B,EAAWxqF,UAAUwwD,MAAQ,WAC3B,OAAO,IAAIg6B,EAAWzmF,KAAKL,OAU7B8mF,EAAWxqF,UAAUo2E,UAAY,SAAUpc,GACzC,OAAOj2D,KAAKL,MAUd8mF,EAAWxqF,UAAUq2E,OAAS,SAAUrc,GACtC,IAAIt2D,GAAO,QAAOK,KAAKL,MAEvB,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,WAQ/C8mF,EAAWxqF,UAAUmtD,OAAS,WAC5B,MAAO,CACLkqB,OAAQ,aACR3zE,KAAMK,KAAKL,OAYf8mF,EAAWlT,SAAW,SAAUzjB,GAC9B,OAAO,IAAI22B,EAAW32B,EAAKnwD,OAU7B8mF,EAAWxqF,UAAUu2E,OAAS,SAAUvc,GACtC,IAAI+lB,GAAS,OAEkB,IAApBrK,EAAK3xE,KAAKL,OAAyB6mF,EAAgBxmF,KAAKL,QACjEq8E,GAAS,GAGX,IAAIx5E,EAASu5E,EAAS/7E,KAAKL,KAAMq8E,GAEjC,MAAkB,OAAdx5E,EAAO,GAEFA,EAIF,IAAMA,GAGRikF,IACN,CACD7T,SAAS,EACTtB,QAAQ,IC7MV,SAASlkB,KAA2Q,OAA9PA,GAAWzxD,OAAOk6B,QAAU,SAAUx6B,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAS5U,UAAUtlC,GAAI,IAAK,IAAImB,KAAO+4C,EAAcj5C,OAAOM,UAAUQ,eAAeC,KAAKk4C,EAAQ/4C,KAAQR,EAAOQ,GAAO+4C,EAAO/4C,IAAY,OAAOR,IAA2B+yD,MAAMpuD,KAAMggC,WAShT,IACI,GAAe,CAAC,OAAQ,OAAQ,cACzB4mD,IAAoC,EAAA1V,EAAA,IAFpC,eAEkD,IAAe1jB,IAC1E,IAAI,KACFmkB,EAAI,KACJ5xD,EAAI,WACJ0mE,GACEj5B,EAUJ,SAASq5B,EAAahoC,EAAIxiB,GACxB,KAAMr8B,gBAAgB6mF,GACpB,MAAM,IAAI5jD,YAAY,oDAQxB,GALkB,iBAAP4b,IACTA,EAAK,IAAI4nC,EAAW5nC,MAIjB,EAAAizB,EAAA,IAAOjzB,GAAK,MAAM,IAAI1jD,UAAU,mCAErC,IAAKP,MAAMgD,QAAQy+B,KAAUA,EAAK22C,MAAMlB,EAAA,IACtC,MAAM,IAAI32E,UAAU,wDAGtB6E,KAAK6+C,GAAKA,EACV7+C,KAAKq8B,KAAOA,GAAQ,GAEpB1gC,OAAOC,eAAeoE,KAAM,OAAQ,CAClC1D,IAAK,WACH,OAAO0D,KAAK6+C,GAAGl/C,MAAQ,IACvBu6C,KAAKl6C,MACP6qB,IAAK,WACH,MAAM,IAAIsW,MAAM,kDAKtB0lD,EAAa5qF,UAAY,IAAI8jB,EAC7B8mE,EAAa5qF,UAAUmE,KAAO,eAC9BymF,EAAa5qF,UAAU6qF,gBAAiB,EAexCD,EAAa5qF,UAAUw1E,SAAW,SAAUE,EAAMC,GAChD,KAAM5xE,gBAAgB6mF,GACpB,MAAM,IAAI1rF,UAAU,yBAItB,IAAI4mF,GAAW,QAAI/hF,KAAKq8B,MAAM,SAAUyH,GACtC,OAAOA,EAAI2tC,SAASE,EAAMC,MAG5B,IAAI,EAAAE,EAAA,IAAa9xE,KAAK6+C,IAAK,CAEzB,IAAI0gC,EAAQv/E,KAAK6+C,GAAGl/C,KAChBk/C,EAAK0gC,KAAS5N,GAAO,QAAgBA,EAAM4N,QAASphF,EAGxD,GAF0B,mBAAP0gD,IAAoC,IAAfA,EAAGkoC,QAEhC,CAGT,IAAIA,EAAU/mF,KAAKq8B,KACnB,OAAO,SAA0B+0C,EAAO/0C,EAAM+2C,GAC5C,OAAQmM,KAASnO,GAAQ,QAAgBA,EAAOmO,GAAS1gC,GAAIkoC,EAASpV,EAAMvkB,GAAS,GAAIgkB,EAAO/0C,KAIlG,GAAwB,IAApB0lD,EAAStnF,OAAc,CACzB,IAAIunF,EAAWD,EAAS,GACxB,OAAO,SAA0B3Q,EAAO/0C,EAAM+2C,GAC5C,OAAQmM,KAASnO,GAAQ,QAAgBA,EAAOmO,GAAS1gC,GAAImjC,EAAS5Q,EAAO/0C,EAAM+2C,KAEhF,GAAwB,IAApB2O,EAAStnF,OAAc,CAChC,IAAIwnF,EAAWF,EAAS,GACpBG,EAAWH,EAAS,GACxB,OAAO,SAA0B3Q,EAAO/0C,EAAM+2C,GAC5C,OAAQmM,KAASnO,GAAQ,QAAgBA,EAAOmO,GAAS1gC,GAAIojC,EAAS7Q,EAAO/0C,EAAM+2C,GAAU8O,EAAS9Q,EAAO/0C,EAAM+2C,KAGrH,OAAO,SAA0BhC,EAAO/0C,EAAM+2C,GAC5C,OAAQmM,KAASnO,GAAQ,QAAgBA,EAAOmO,GAAS1gC,GAAIuP,MAAM,MAAM,QAAI2zB,GAAU,SAAUI,GAC/F,OAAOA,EAAQ/Q,EAAO/0C,EAAM+2C,QAK/B,IAAI,EAAAtB,EAAA,IAAe9xE,KAAK6+C,MAAO,EAAAizB,EAAA,IAAY9xE,KAAK6+C,GAAG/f,QAAU9+B,KAAK6+C,GAAG/f,MAAMylD,mBAAoB,CAEpG,IAAIM,EAAa7kF,KAAK6+C,GAAGriD,OAAOi1E,SAASE,EAAMC,GAE3C/yC,EAAO7+B,KAAK6+C,GAAG/f,MAAM0lD,oBACrBwC,EAAWhnF,KAAKq8B,KACpB,OAAO,SAA0B+0C,EAAO/0C,EAAM+2C,GAC5C,IAAI52E,EAASqoF,EAAWzT,EAAO/0C,EAAM+2C,GAGrC,OAFA,QAAmB52E,EAAQqiC,GACfriC,EAAOqiC,IAASriC,EAAOqiC,GAAMkoD,QAC1BvqF,EAAOqiC,GAAMmoD,EAAUrV,EAAMvkB,GAAS,GAAIgkB,EAAO/0C,IAC9D7/B,EAAOqiC,GAAMuvB,MAAM5xD,GAAQ,QAAIulF,GAAU,SAAUI,GAEnD,OAAOA,EAAQ/Q,EAAO/0C,EAAM+2C,QAMhC,IAAI6T,EAASjnF,KAAK6+C,GAAG4yB,SAASE,EAAMC,GAEhCsV,EAAYlnF,KAAKq8B,KACrB,OAAO,SAA0B+0C,EAAO/0C,EAAM+2C,GAC5C,IAAIv0B,EAAKooC,EAAO7V,EAAO/0C,EAAM+2C,GAE7B,OADYv0B,GAAMA,EAAGkoC,QACNloC,EAAGqoC,EAAWvV,EAAMvkB,GAAS,GAAIgkB,EAAO/0C,IACrDwiB,EAAGuP,MAAMvP,GAAI,QAAIkjC,GAAU,SAAUI,GAErC,OAAOA,EAAQ/Q,EAAO/0C,EAAM+2C,SAWpCyT,EAAa5qF,UAAU0F,QAAU,SAAUuS,GACzCA,EAASlU,KAAK6+C,GAAI,KAAM7+C,MAExB,IAAK,IAAItF,EAAI,EAAGA,EAAIsF,KAAKq8B,KAAK5hC,OAAQC,IACpCwZ,EAASlU,KAAKq8B,KAAK3hC,GAAI,QAAUA,EAAI,IAAKsF,OAW9C6mF,EAAa5qF,UAAU0a,IAAM,SAAUzC,GAKrC,IAJA,IAAI2qC,EAAK7+C,KAAK6xE,QAAQ39D,EAASlU,KAAK6+C,GAAI,KAAM7+C,OAE1Cq8B,EAAO,GAEF3hC,EAAI,EAAGA,EAAIsF,KAAKq8B,KAAK5hC,OAAQC,IACpC2hC,EAAK3hC,GAAKsF,KAAK6xE,QAAQ39D,EAASlU,KAAKq8B,KAAK3hC,GAAI,QAAUA,EAAI,IAAKsF,OAGnE,OAAO,IAAI6mF,EAAahoC,EAAIxiB,IAQ9BwqD,EAAa5qF,UAAUwwD,MAAQ,WAC7B,OAAO,IAAIo6B,EAAa7mF,KAAK6+C,GAAI7+C,KAAKq8B,KAAKv9B,MAAM,KAKnD,IAAIqoF,EAAeN,EAAa5qF,UAAUyD,SA8F1C,SAAS0nF,EAAeC,EAAUvlF,EAAMm0D,GAStC,IARA,IAMItyB,EANAm9C,EAAQ,GAGRwG,EAAQ,qDACRC,EAAW,EAI2B,QAAlC5jD,EAAQ2jD,EAAMntD,KAAKktD,KAMzB,GAHAvG,GAASuG,EAASr2D,UAAUu2D,EAAU5jD,EAAM7E,OAC5CyoD,EAAW5jD,EAAM7E,MAEA,OAAb6E,EAAM,GAERm9C,GAAS,IACTyG,QACK,CAELA,GAAY5jD,EAAM,GAAGlpC,OACrB,IAAI0B,EAAW2F,EAAK6hC,EAAM,IAE1B,IAAKxnC,EACH,MAAM,IAAIpB,eAAe,sBAAwB4oC,EAAM,GAAK,oBAG9D,QAAiBxlC,IAAbwlC,EAAM,GAER,cAAexnC,GACb,IAAK,SACH2kF,GAAS3kF,EACT,MAEF,IAAK,SACH,IAAI,EAAA21E,EAAA,IAAO31E,GACT2kF,GAAS3kF,EAASo2E,MAAMtc,OACnB,KAAIr7D,MAAMgD,QAAQzB,GAUvB,MAAM,IAAIhB,UAAU,aAAewoC,EAAM,GAAK,+CAR9Cm9C,GAAS3kF,EAASwa,KAAI,SAAUmtB,EAAKhF,GACnC,IAAI,EAAAgzC,EAAA,IAAOhuC,GACT,OAAOA,EAAIyuC,MAAMtc,GAGnB,MAAM,IAAI96D,UAAU,aAAewoC,EAAM,GAAK,IAAM7E,EAAQ,uBAC3DkK,KAAK,KAKV,MAEF,QACE,MAAM,IAAI7tC,UAAU,aAAewoC,EAAM,GAAK,mDAE7C,CAEL,KAAI,EAAAmuC,EAAA,IAAO31E,EAASwnC,EAAM,KAAOxnC,EAASwnC,EAAM,KAG9C,MAAM,IAAIxoC,UAAU,aAAewoC,EAAM,GAAK,IAAMA,EAAM,GAAK,oBAF/Dm9C,GAAS3kF,EAASwnC,EAAM,IAAI4uC,MAAMtc,IAU1C,OAFA6qB,EAASuG,EAASvoF,MAAMyoF,GAnJ1BV,EAAa5qF,UAAUyD,SAAW,SAAUu2D,GAC1C,IAAIkc,EACAxyE,EAAOK,KAAK6+C,GAAGn/C,SAASu2D,GAO5B,OALIA,GAAsC,iBAApBA,EAAQwc,UAAwB,QAAexc,EAAQwc,QAAS9yE,KAEpFwyE,EAAelc,EAAQwc,QAAQ9yE,GAAMK,KAAMi2D,SAGjB,IAAjBkc,EACFA,EAIFgV,EAAazqF,KAAKsD,KAAMi2D,IASjC4wB,EAAa5qF,UAAUo2E,UAAY,SAAUpc,GAC3C,IAAI55B,EAAOr8B,KAAKq8B,KAAK1lB,KAAI,SAAUmtB,GACjC,OAAOA,EAAIpkC,SAASu2D,MAItB,QAFS,EAAA6b,EAAA,IAAyB9xE,KAAK6+C,IAAM,IAAM7+C,KAAK6+C,GAAGn/C,SAASu2D,GAAW,IAAMj2D,KAAK6+C,GAAGn/C,SAASu2D,IAE1F,IAAM55B,EAAK2M,KAAK,MAAQ,KAQtC69C,EAAa5qF,UAAUmtD,OAAS,WAC9B,MAAO,CACLkqB,OAAQ,eACRz0B,GAAI7+C,KAAK6+C,GACTxiB,KAAMr8B,KAAKq8B,OAYfwqD,EAAatT,SAAW,SAAUzjB,GAChC,OAAO,IAAI+2B,EAAa/2B,EAAKjR,GAAIiR,EAAKzzB,OASxCwqD,EAAa5qF,UAAUq2E,OAAS,SAAUrc,GACxC,IAAI55B,EAAOr8B,KAAKq8B,KAAK1lB,KAAI,SAAUmtB,GACjC,OAAOA,EAAIwuC,OAAOrc,MAGpB,MAAO,gCAAiC,QAAOj2D,KAAK6+C,IAAM,wEAA0ExiB,EAAK2M,KAAK,yCAA2C,kEAsF3L,IAAIw+C,EAAYX,EAAa5qF,UAAUs2E,MA+FvC,OAlFAsU,EAAa5qF,UAAUs2E,MAAQ,SAAUtc,GACvC,IAAIwxB,EAOJ,OALIxxB,GAAsC,iBAApBA,EAAQwc,UAAwB,QAAexc,EAAQwc,QAASzyE,KAAKL,QAEzF8nF,EAAYxxB,EAAQwc,QAAQzyE,KAAKL,MAAMK,KAAMi2D,SAGtB,IAAdwxB,EACFA,EAIFD,EAAU9qF,KAAKsD,KAAMi2D,IAS9B4wB,EAAa5qF,UAAUu2E,OAAS,SAAUvc,GACxC,IAIIyxB,EAYAC,EAhBAtrD,EAAOr8B,KAAKq8B,KAAK1lB,KAAI,SAAUmtB,GAEjC,OAAOA,EAAIyuC,MAAMtc,MAgBnB,OAZIijB,EAAel5E,KAAKL,QACtB+nF,EAAiBxO,EAAel5E,KAAKL,QAInCgyE,EAAK3xE,KAAKL,OAA2C,mBAA1BgyE,EAAK3xE,KAAKL,MAAM4yE,OAAyD,iBAA1BZ,EAAK3xE,KAAKL,MAAM4yE,OAAuD,iBAA1BZ,EAAK3xE,KAAKL,MAAM4yE,QAEzImV,EAAiB/V,EAAK3xE,KAAKL,MAAM4yE,cAKpBmV,GACb,IAAK,WAEHC,EAAcD,EAAe1nF,KAAMi2D,GACnC,MAEF,IAAK,SAEH0xB,EAAcP,EAAeM,EAAgB1nF,KAAMi2D,GACnD,MAEF,IAAK,SAEH,cAAeyxB,EAAerrD,EAAK5hC,SACjC,IAAK,WACHktF,EAAcD,EAAerrD,EAAK5hC,QAAQuF,KAAMi2D,GAChD,MAEF,IAAK,SACH0xB,EAAcP,EAAeM,EAAerrD,EAAK5hC,QAASuF,KAAMi2D,IAMxE,YAA2B,IAAhB0xB,EACFA,EAGFP,EpBSkB,0CoBTcpnF,KAAMi2D,IAQ/C4wB,EAAa5qF,UAAUy2E,cAAgB,WACrC,OAAO1yE,KAAKI,KAAO,IAAMJ,KAAKL,MAGzBknF,IACN,CACDjU,SAAS,EACTtB,QAAQ,I,WC3cV,SAAS,KAA2Q,OAA9P,GAAW31E,OAAOk6B,QAAU,SAAUx6B,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAS5U,UAAUtlC,GAAI,IAAK,IAAImB,KAAO+4C,EAAcj5C,OAAOM,UAAUQ,eAAeC,KAAKk4C,EAAQ/4C,KAAQR,EAAOQ,GAAO+4C,EAAO/4C,IAAY,OAAOR,IAA2B+yD,MAAMpuD,KAAMggC,WAMhT,IAAI,GAAO,QACP,GAAe,CAAC,QAAS,UAAW,SAAU,eAAgB,YAAa,iBAAkB,YAAa,kBAAmB,eAAgB,yBAA0B,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAa,iBAAkB,cAC7Q4nD,IAA6B,EAAA1W,EAAA,IAAQ,GAAM,IAAe1jB,IACnE,IAAI,MACF+1B,EAAK,QACLhI,EAAO,OACPzvB,EAAM,aACN64B,EAAY,UACZ7R,EAAS,eACToK,EAAc,UACdxJ,EAAS,gBACT0J,EAAe,aACflB,EAAY,uBACZiB,EAAsB,aACtB0J,EAAY,UACZ5B,EAAS,WACT3I,EAAU,aACVoE,EAAY,gBACZ5D,EAAe,UACfa,EAAS,eACTD,EAAc,WACd+I,GACEj5B,EAyCAp5C,EAAQmvE,EAAM,GAAM,CACtB9f,OAAQ,SAAgBgc,GACtB,OAAOoI,EAAWpI,EAAY,KAEhC,iBAAkB,SAAqBqI,GACrC,OAAOC,EAAcD,EAAa,KAEpC,iBAAkB,SAAsBrI,EAAYxpB,GAElD,OAAO4xB,EAAWpI,OADiBthF,IAAlB83D,EAAQv0D,MAAsBu0D,EAAQv0D,MAAQ,KAGjE,yBAA0BqmF,IAG5B,SAASA,EAAcD,GACrB,IAAI7xB,EAAUj2B,UAAUvlC,OAAS,QAAsB0D,IAAjB6hC,UAAU,GAAmBA,UAAU,GAAK,GAC9EgoD,OAA+B7pF,IAAlB83D,EAAQv0D,MAAsBu0D,EAAQv0D,MAAQ,GAE/D,OAAO,SAAQomF,GAAa,SAAUj6D,GACpC,GAAoB,iBAATA,EAAmB,MAAM,IAAI1yB,UAAU,mBAClD,OAAO0sF,EAAWh6D,EAAMm6D,MAK5B,IAQIC,EAAa,CACf,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACLC,KAAM,EACN,KAAK,EACL,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,EACL,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,MAAM,EACN,MAAM,EACN,OAAO,GAGLC,EAAmB,CACrBphC,KAAK,EACLmxB,IAAI,EACJkQ,IAAI,EACJrP,KAAK,EACLC,KAAK,EACLC,IAAI,EACJlB,KAAK,GAEHsQ,EAAY,CACdnR,MAAM,EACNC,OAAO,EACPmR,KAAM,KACNnqF,eAAWA,GAEToqF,EAAoB,CAAC,MAAO,YAgChC,SAASC,EAAchlF,EAAO/I,GAC5B,OAAO+I,EAAMi8E,WAAWxuD,OAAOztB,EAAMs7B,MAAOrkC,GAW9C,SAASguF,EAAiBjlF,GACxB,OAAOglF,EAAchlF,EAAO,GAU9B,SAASlF,EAAKkF,GACZA,EAAMs7B,QASR,SAAS4pD,EAAcllF,GACrB,OAAOA,EAAMi8E,WAAW79B,OAAOp+C,EAAMs7B,MAAQ,GAS/C,SAAS6pD,EAAcnlF,GACrB,OAAOA,EAAMi8E,WAAW79B,OAAOp+C,EAAMs7B,MAAQ,GAS/C,SAAS8pD,EAASplF,GAMhB,IALAA,EAAMqlF,UAnJA,EAoJNrlF,EAAMslF,MAAQ,GACdtlF,EAAM+tE,QAAU,GAGTn9D,EAAM20E,aAAaN,EAAiBjlF,GAAQA,EAAMwlF,eACvD1qF,EAAKkF,GAIP,GAAgC,MAA5BilF,EAAiBjlF,GACnB,KAAmC,OAA5BilF,EAAiBjlF,IAA+C,KAA5BilF,EAAiBjlF,IAC1DA,EAAM+tE,SAAWkX,EAAiBjlF,GAClClF,EAAKkF,GAKT,GAAgC,KAA5BilF,EAAiBjlF,GAArB,CAOA,GAAgC,OAA5BilF,EAAiBjlF,KAAoBA,EAAMwlF,aAI7C,OAHAxlF,EAAMqlF,UA5KG,EA6KTrlF,EAAMslF,MAAQL,EAAiBjlF,QAC/BlF,EAAKkF,GAIP,IAAIylF,EAAKR,EAAiBjlF,GACtB0lF,EAAKV,EAAchlF,EAAO,GAC1B2lF,EAAKX,EAAchlF,EAAO,GAE9B,GAAkB,IAAd2lF,EAAG1uF,QAAgBwtF,EAAWkB,GAMhC,OALA3lF,EAAMqlF,UAvLG,EAwLTrlF,EAAMslF,MAAQK,EACd7qF,EAAKkF,GACLlF,EAAKkF,QACLlF,EAAKkF,GAKP,GAAkB,IAAd0lF,EAAGzuF,QAAgBwtF,EAAWiB,GAKhC,OAJA1lF,EAAMqlF,UAjMG,EAkMTrlF,EAAMslF,MAAQI,EACd5qF,EAAKkF,QACLlF,EAAKkF,GAKP,GAAIykF,EAAWgB,GAIb,OAHAzlF,EAAMqlF,UA1MG,EA2MTrlF,EAAMslF,MAAQG,OACd3qF,EAAKkF,GAKP,GAAI4Q,EAAMg1E,WAAWH,GAArB,CACEzlF,EAAMqlF,UAjNA,EAmNN,IAAIQ,EAAKb,EAAchlF,EAAO,GAE9B,GAAW,OAAP6lF,GAAsB,OAAPA,GAAsB,OAAPA,EAAa,CAM7C,IALA7lF,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GACLA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAEE4Q,EAAMk1E,WAAWb,EAAiBjlF,KACvCA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAGP,GAAgC,MAA5BilF,EAAiBjlF,GAKnB,IAHAA,EAAMslF,OAAS,IACfxqF,EAAKkF,GAEE4Q,EAAMk1E,WAAWb,EAAiBjlF,KACvCA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,QAEF,GAAgC,MAA5BilF,EAAiBjlF,GAK1B,IAHAA,EAAMslF,OAAS,IACfxqF,EAAKkF,GAEE4Q,EAAMm1E,QAAQd,EAAiBjlF,KACpCA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAIT,OAIF,GAAgC,MAA5BilF,EAAiBjlF,GACnBA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAEA4Q,EAAMm1E,QAAQd,EAAiBjlF,MAElCA,EAAMqlF,UA/PD,OAiQF,CACL,KAAOz0E,EAAMm1E,QAAQd,EAAiBjlF,KACpCA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAGH4Q,EAAMo1E,cAAcf,EAAiBjlF,GAAQmlF,EAAcnlF,MAC7DA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,IAIT,KAAO4Q,EAAMm1E,QAAQd,EAAiBjlF,KACpCA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAIP,GAAgC,MAA5BilF,EAAiBjlF,IAA8C,MAA5BilF,EAAiBjlF,GACtD,GAAI4Q,EAAMm1E,QAAQZ,EAAcnlF,KAAoC,MAAzBmlF,EAAcnlF,IAA2C,MAAzBmlF,EAAcnlF,GAAgB,CAUvG,GATAA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAE2B,MAA5BilF,EAAiBjlF,IAA8C,MAA5BilF,EAAiBjlF,KACtDA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,KAIF4Q,EAAMm1E,QAAQd,EAAiBjlF,IAClC,MAAMimF,GAAkBjmF,EAAO,wBAA0BilF,EAAiBjlF,GAAS,KAGrF,KAAO4Q,EAAMm1E,QAAQd,EAAiBjlF,KACpCA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAGP,GAAI4Q,EAAMo1E,cAAcf,EAAiBjlF,GAAQmlF,EAAcnlF,IAC7D,MAAMimF,GAAkBjmF,EAAO,wBAA0BilF,EAAiBjlF,GAAS,UAEhF,GAA6B,MAAzBmlF,EAAcnlF,GAEvB,MADAlF,EAAKkF,GACCimF,GAAkBjmF,EAAO,wBAA0BilF,EAAiBjlF,GAAS,SA3FzF,CAmGA,IAAI4Q,EAAMs1E,QAAQjB,EAAiBjlF,GAAQklF,EAAcllF,GAAQmlF,EAAcnlF,IAA/E,CAkBA,IAFAA,EAAMqlF,UAjUG,EAmU0B,KAA5BJ,EAAiBjlF,IACtBA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,GAGP,MAAMimF,GAAkBjmF,EAAO,yBAA2BA,EAAMslF,MAAQ,KAtBtE,KAAO10E,EAAMs1E,QAAQjB,EAAiBjlF,GAAQklF,EAAcllF,GAAQmlF,EAAcnlF,KAAW4Q,EAAMm1E,QAAQd,EAAiBjlF,KAC1HA,EAAMslF,OAASL,EAAiBjlF,GAChClF,EAAKkF,IAGH,QAAe2kF,EAAkB3kF,EAAMslF,OACzCtlF,EAAMqlF,UA3TC,EA6TPrlF,EAAMqlF,UA3TF,QAoKNrlF,EAAMqlF,UAtKG,EAkVb,SAASc,EAAoBnmF,GAC3B,GACEolF,EAASplF,SACc,OAAhBA,EAAMslF,OASjB,SAASc,EAAWpmF,GAClBA,EAAMwlF,eAQR,SAASa,EAAYrmF,GACnBA,EAAMwlF,eAoHR,SAASnB,EAAWpI,EAAYuI,GAC9B,IAAIxkF,EA9ZG,CACLwkF,WAAY,GAEZvI,WAAY,GAEZlO,QAAS,GAETzyC,MAAO,EAEPgqD,MAAO,GAEPD,UA3EI,EA6EJG,aAAc,EAEdc,iBAAkB,MAiZpB,GAAStmF,EAAO,CACdi8E,aACAuI,eAGFY,EAASplF,GACT,IAAI1B,EAwBN,SAAoB0B,GAClB,IAAI1B,EAEAsZ,EADAu4D,EAAS,GASb,IANoB,KAAhBnwE,EAAMslF,OAAgC,OAAhBtlF,EAAMslF,OAAkC,MAAhBtlF,EAAMslF,SACtDhnF,EAAOioF,EAAgBvmF,IAClB+tE,QAAU/tE,EAAM+tE,SAIA,OAAhB/tE,EAAMslF,OAAkC,MAAhBtlF,EAAMslF,OAEb,IAAlBnV,EAAOl5E,QAAgBqH,IACzBsZ,EAA0B,MAAhB5X,EAAMslF,MAChBnV,EAAOn1E,KAAK,CACVsD,KAAMA,EACNsZ,QAASA,KAIbwtE,EAASplF,GAEW,OAAhBA,EAAMslF,OAAkC,MAAhBtlF,EAAMslF,OAAiC,KAAhBtlF,EAAMslF,SACvDhnF,EAAOioF,EAAgBvmF,IAClB+tE,QAAU/tE,EAAM+tE,QACrBn2D,EAA0B,MAAhB5X,EAAMslF,MAChBnV,EAAOn1E,KAAK,CACVsD,KAAMA,EACNsZ,QAASA,KAKf,OAAIu4D,EAAOl5E,OAAS,EACX,IAAIi5E,EAAUC,IAEhB7xE,KACHA,EAAO,IAAIo6E,OAAa/9E,IACnBozE,QAAU/tE,EAAM+tE,SAGhBzvE,GAlEEkoF,CAAWxmF,GAGtB,GAAoB,KAAhBA,EAAMslF,MACR,MAzeS,IAyeLtlF,EAAMqlF,UAGF36B,GAAY1qD,EAAO,uBAAyBA,EAAMslF,OAElDW,GAAkBjmF,EAAO,oBAAsBA,EAAMslF,MAAQ,KAIvE,OAAOhnF,EAkET,SAASioF,EAAgBvmF,GACvB,IAAI7D,EAAM08B,EAAMv/B,EAAOmtF,EACnBnoF,EAmDN,SAA0B0B,GAGxB,IAFA,IAAI1B,EA8BN,SAAwB0B,GAGtB,IAFA,IAAI1B,EAAOooF,EAAgB1mF,GAEJ,OAAhBA,EAAMslF,OAEXa,EAAoBnmF,GACpB1B,EAAO,IAAI4+E,EAAa,KAAM,KAAM,CAAC5+E,EAAMooF,EAAgB1mF,KAG7D,OAAO1B,EAvCIqoF,CAAe3mF,GAEH,MAAhBA,EAAMslF,OAAe,CAI1B,IAAI1hD,EAAO5jC,EAAMsmF,iBACjBtmF,EAAMsmF,iBAAmBtmF,EAAMwlF,aAC/BW,EAAoBnmF,GACpB,IAAIs8E,EAAYh+E,EACZi+E,EAAWgK,EAAgBvmF,GAC/B,GAAoB,MAAhBA,EAAMslF,MAAe,MAAMW,GAAkBjmF,EAAO,iDACxDA,EAAMsmF,iBAAmB,KACzBH,EAAoBnmF,GACpB,IAAIw8E,EAAY+J,EAAgBvmF,GAEhC1B,EAAO,IAAIs7E,EAAgB0C,EAAWC,EAAUC,GAEhDx8E,EAAMsmF,iBAAmB1iD,EAG3B,OAAOtlC,EAzEIsoF,CAAiB5mF,GAE5B,GAAoB,MAAhBA,EAAMslF,MAAe,CACvB,IAAI,EAAAhX,EAAA,IAAahwE,GAKf,OAHAnC,EAAOmC,EAAKnC,KACZgqF,EAAoBnmF,GACpB1G,EAAQitF,EAAgBvmF,GACjB,IAAI05E,EAAe,IAAIuJ,EAAW9mF,GAAO7C,GAC3C,IAAI,EAAAg1E,EAAA,IAAehwE,GAIxB,OAFA6nF,EAAoBnmF,GACpB1G,EAAQitF,EAAgBvmF,GACjB,IAAI05E,EAAep7E,EAAKtF,OAAQsF,EAAKg9B,MAAOhiC,GAC9C,IAAI,EAAAg1E,EAAA,IAAehwE,KAAS,EAAAgwE,EAAA,IAAahwE,EAAK+8C,MAEnDorC,GAAQ,EACR5tD,EAAO,GACP18B,EAAOmC,EAAKnC,KACZmC,EAAKu6B,KAAK16B,SAAQ,SAAUmiC,EAAKhF,IAC3B,EAAAgzC,EAAA,IAAahuC,GACfzH,EAAKyC,GAASgF,EAAInkC,KAElBsqF,GAAQ,KAIRA,GAGF,OAFAN,EAAoBnmF,GACpB1G,EAAQitF,EAAgBvmF,GACjB,IAAI25E,EAAuBx9E,EAAM08B,EAAMv/B,GAIlD,MAAM2sF,GAAkBjmF,EAAO,mDAGjC,OAAO1B,EA+DT,SAASooF,EAAgB1mF,GAGvB,IAFA,IAAI1B,EAAOuoF,EAAgB7mF,GAEJ,QAAhBA,EAAMslF,OAEXa,EAAoBnmF,GACpB1B,EAAO,IAAI4+E,EAAa,MAAO,MAAO,CAAC5+E,EAAMuoF,EAAgB7mF,KAG/D,OAAO1B,EAST,SAASuoF,EAAgB7mF,GAGvB,IAFA,IAAI1B,EAAOwoF,EAAe9mF,GAEH,QAAhBA,EAAMslF,OAEXa,EAAoBnmF,GACpB1B,EAAO,IAAI4+E,EAAa,MAAO,MAAO,CAAC5+E,EAAMwoF,EAAe9mF,KAG9D,OAAO1B,EAST,SAASwoF,EAAe9mF,GAGtB,IAFA,IAAI1B,EAAOyoF,EAAgB/mF,GAEJ,MAAhBA,EAAMslF,OAEXa,EAAoBnmF,GACpB1B,EAAO,IAAI4+E,EAAa,IAAK,QAAS,CAAC5+E,EAAMyoF,EAAgB/mF,KAG/D,OAAO1B,EAST,SAASyoF,EAAgB/mF,GAGvB,IAFA,IAAI1B,EAAO0oF,EAAgBhnF,GAEJ,OAAhBA,EAAMslF,OAEXa,EAAoBnmF,GACpB1B,EAAO,IAAI4+E,EAAa,KAAM,SAAU,CAAC5+E,EAAM0oF,EAAgBhnF,KAGjE,OAAO1B,EAST,SAAS0oF,EAAgBhnF,GAGvB,IAFA,IAAI1B,EAAO2oF,EAAgBjnF,GAEJ,MAAhBA,EAAMslF,OAEXa,EAAoBnmF,GACpB1B,EAAO,IAAI4+E,EAAa,IAAK,SAAU,CAAC5+E,EAAM2oF,EAAgBjnF,KAGhE,OAAO1B,EAQT,SAAS2oF,EAAgBjnF,GAYvB,IAXA,IAAI8uB,EAAS,CAACo4D,EAAWlnF,IACrB86E,EAAe,GACfqM,EAAY,CACd,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,aAGD,QAAeA,EAAWnnF,EAAMslF,QAAQ,CAE7C,IAAI8B,EAAO,CACTjrF,KAAM6D,EAAMslF,MACZjqC,GAAI8rC,EAAUnnF,EAAMslF,QAEtBxK,EAAa9/E,KAAKosF,GAClBjB,EAAoBnmF,GACpB8uB,EAAO9zB,KAAKksF,EAAWlnF,IAGzB,OAAsB,IAAlB8uB,EAAO73B,OACF63B,EAAO,GACa,IAAlBA,EAAO73B,OACT,IAAIimF,EAAapC,EAAa,GAAG3+E,KAAM2+E,EAAa,GAAGz/B,GAAIvsB,GAE3D,IAAIorD,EAAeY,EAAa3nE,KAAItN,GAAKA,EAAEw1C,KAAKvsB,GAU3D,SAASo4D,EAAWlnF,GAClB,IAAI1B,EAAMnC,EAAMk/C,EAAIvsB,EACpBxwB,EAAO+oF,EAAgBrnF,GAOvB,IANA,IAAImnF,EAAY,CACd,KAAM,YACN,KAAM,kBACN,MAAO,kBAGF,QAAeA,EAAWnnF,EAAMslF,QAErCjqC,EAAK8rC,EADLhrF,EAAO6D,EAAMslF,OAEba,EAAoBnmF,GACpB8uB,EAAS,CAACxwB,EAAM+oF,EAAgBrnF,IAChC1B,EAAO,IAAI4+E,EAAa/gF,EAAMk/C,EAAIvsB,GAGpC,OAAOxwB,EAST,SAAS+oF,EAAgBrnF,GACvB,IAAI1B,EAAMnC,EAAMk/C,EAAIvsB,EACpBxwB,EAAOgpF,EAAWtnF,GAOlB,IANA,IAAImnF,EAAY,CACdzS,GAAI,KACJkQ,GAAI,OAIC,QAAeuC,EAAWnnF,EAAMslF,QAErCjqC,EAAK8rC,EADLhrF,EAAO6D,EAAMslF,OAEba,EAAoBnmF,GAEP,OAAT7D,GAAiC,KAAhB6D,EAAMslF,MAEzBhnF,EAAO,IAAI4+E,EAAa,IAAK,WAAY,CAAC5+E,EAAM,IAAI2kF,EAAW,QAAQ,IAGvEn0D,EAAS,CAACxwB,EAAMgpF,EAAWtnF,IAC3B1B,EAAO,IAAI4+E,EAAa/gF,EAAMk/C,EAAIvsB,IAItC,OAAOxwB,EAST,SAASgpF,EAAWtnF,GAClB,IAAI1B,EACAwwB,EAAS,GAUb,GANExwB,EAFkB,MAAhB0B,EAAMslF,MAED,IAAI5M,EAAa,GAGjB6O,EAAiBvnF,GAGN,MAAhBA,EAAMslF,OAAiBtlF,EAAMsmF,mBAAqBtmF,EAAMwlF,aAAc,CAIxE,IAFA12D,EAAO9zB,KAAKsD,GAEW,MAAhB0B,EAAMslF,OAAiBx2D,EAAO73B,OAAS,GAE5CkvF,EAAoBnmF,GAEA,MAAhBA,EAAMslF,OAAiC,MAAhBtlF,EAAMslF,OAAiC,MAAhBtlF,EAAMslF,OAAiC,KAAhBtlF,EAAMslF,MAE7Ex2D,EAAO9zB,KAAK,IAAIioF,EAAW,QAG3Bn0D,EAAO9zB,KAAKusF,EAAiBvnF,IAM/B1B,EAFoB,IAAlBwwB,EAAO73B,OAEF,IAAIkjF,EAAUrrD,EAAO,GAAIA,EAAO,GAAIA,EAAO,IAI3C,IAAIqrD,EAAUrrD,EAAO,GAAIA,EAAO,IAI3C,OAAOxwB,EAST,SAASipF,EAAiBvnF,GACxB,IAAI1B,EAAMnC,EAAMk/C,EAAIvsB,EACpBxwB,EAAOkpF,EAAoBxnF,GAM3B,IALA,IAAImnF,EAAY,CACd,IAAK,MACL,IAAK,aAGA,QAAeA,EAAWnnF,EAAMslF,QAErCjqC,EAAK8rC,EADLhrF,EAAO6D,EAAMslF,OAEba,EAAoBnmF,GACpB8uB,EAAS,CAACxwB,EAAMkpF,EAAoBxnF,IACpC1B,EAAO,IAAI4+E,EAAa/gF,EAAMk/C,EAAIvsB,GAGpC,OAAOxwB,EAST,SAASkpF,EAAoBxnF,GAC3B,IAAI1B,EAAMgsC,EAAMnuC,EAAMk/C,EAEtB/Q,EADAhsC,EAAOmpF,EAA4BznF,GAWnC,IATA,IAAImnF,EAAY,CACd,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,YACN,IAAK,MACL5jC,IAAK,QAID,QAAe4jC,EAAWnnF,EAAMslF,QAGlCjqC,EAAK8rC,EADLhrF,EAAO6D,EAAMslF,OAEba,EAAoBnmF,GACpBsqC,EAAOm9C,EAA4BznF,GACnC1B,EAAO,IAAI4+E,EAAa/gF,EAAMk/C,EAAI,CAAC/8C,EAAMgsC,IAM7C,OAAOhsC,EAST,SAASmpF,EAA4BznF,GACnC,IAAI1B,EAAMgsC,EAIV,IAFAA,EADAhsC,EAAOopF,EAAW1nF,GAh8BV,IAo8BFA,EAAMqlF,WAAkD,OAAhBrlF,EAAMslF,QAAkB,EAAAhX,EAAA,IAAehwE,MAr8B7E,IAq8BsF0B,EAAMqlF,YAAmC,EAAA/W,EAAA,IAAehkC,KAAW,EAAAgkC,EAAA,IAAehkC,IAAqB,MAAZA,EAAK6yC,KAA+B,MAAhBn9E,EAAMslF,OAM/Mh7C,EAAOo9C,EAAW1nF,GAClB1B,EAAO,IAAI4+E,EAAa,IAAK,WAAY,CAAC5+E,EAAMgsC,IAAO,GAQ3D,OAAOhsC,EAWT,SAASopF,EAAW1nF,GAKlB,IAJA,IAAI1B,EAAOqpF,EAAW3nF,GAClBsqC,EAAOhsC,EACPspF,EAAc,GAII,MAAhB5nF,EAAMslF,QAAiB,EAAAhX,EAAA,IAAehkC,IAF/B,CAOT,GAHAs9C,EAAY5sF,KAAK,GAAS,GAAIgF,IAC9BmmF,EAAoBnmF,GAz+BhB,IA2+BAA,EAAMqlF,UAqBH,CAEL,GAASrlF,EAAO4nF,EAAYx2E,OAE5B,MApBA,GAHAw2E,EAAY5sF,KAAK,GAAS,GAAIgF,IAC9BmmF,EAAoBnmF,GA7+BlB,IA++BEA,EAAMqlF,WAAkD,MAAhBrlF,EAAMslF,MAQ3C,CAELsC,EAAYx2E,MAEZ,GAASpR,EAAO4nF,EAAYx2E,OAE5B,MAXA,GAASpR,EAAO4nF,EAAYx2E,OAE5Bw2E,EAAYx2E,MACZk5B,EAAOq9C,EAAW3nF,GAClB1B,EAAO,IAAI4+E,EAAa,IAAK,SAAU,CAAC5+E,EAAMgsC,IAoBtD,OAAOhsC,EAST,SAASqpF,EAAW3nF,GAClB,IAAI7D,EAAM2yB,EAAQusB,EACd8rC,EAAY,CACd,IAAK,aACL,IAAK,YACL,IAAK,SACL5S,IAAK,OAGP,OAAI,QAAe4S,EAAWnnF,EAAMslF,QAClCjqC,EAAK8rC,EAAUnnF,EAAMslF,OACrBnpF,EAAO6D,EAAMslF,MACba,EAAoBnmF,GACpB8uB,EAAS,CAAC64D,EAAW3nF,IACd,IAAIk9E,EAAa/gF,EAAMk/C,EAAIvsB,IAatC,SAAkB9uB,GAChB,IAAI1B,EAAMnC,EAAMk/C,EAAIvsB,EAYpB,OAXAxwB,EAoBF,SAAgC0B,GAC9B,IAAI1B,EAAMnC,EAAMk/C,EAChB/8C,EA+CF,SAA0B0B,GACxB,IAAI8uB,EAAS,GAEb,GAxnCQ,IAwnCJ9uB,EAAMqlF,YAAkC,QAAerlF,EAAMwkF,WAAYxkF,EAAMslF,OAAQ,CACzF,IAAIuC,EAAa7nF,EAAMwkF,WAAWxkF,EAAMslF,OAGxC,GAFAF,EAASplF,GAEW,MAAhBA,EAAMslF,MAAe,CAKvB,GAJAx2D,EAAS,GACTs3D,EAAWpmF,GACXolF,EAASplF,GAEW,MAAhBA,EAAMslF,MAGR,IAFAx2D,EAAO9zB,KAAKurF,EAAgBvmF,IAEL,MAAhBA,EAAMslF,OAEXF,EAASplF,GACT8uB,EAAO9zB,KAAKurF,EAAgBvmF,IAIhC,GAAoB,MAAhBA,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,0BAGjCqmF,EAAYrmF,GACZolF,EAASplF,GAKX,OAAO,IAAI6nF,EAAW/4D,GAGxB,OASF,SAAqB9uB,GACnB,IAAU7D,EAEV,OApqCQ,IAoqCJ6D,EAAMqlF,WAtqCC,IAsqCiCrlF,EAAMqlF,WAAqCrlF,EAAMslF,SAASX,GACpGxoF,EAAO6D,EAAMslF,MACbF,EAASplF,GAaF8nF,EAAe9nF,GAXlB,QAAe6kF,EAAW1oF,GAErB,IAAIu8E,EAAamM,EAAU1oF,KACY,IAArC4oF,EAAkBv2D,QAAQryB,GAE5B,IAAIu8E,EAAaX,EAAQ57E,EAAM,WAE/B,IAAI8mF,EAAW9mF,KA4G5B,SAAiC6D,GAC/B,IAAU67B,EAEV,MAAoB,MAAhB77B,EAAMslF,OACRzpD,EAAMksD,EAA6B/nF,GAI5B8nF,EAAe9nF,EAFf,IAAI04E,EAAa78C,KA6C5B,SAAiC77B,GAC/B,IAAU67B,EAEV,MAAoB,MAAhB77B,EAAMslF,OACRzpD,EAAMmsD,GAA6BhoF,GAI5B8nF,EAAe9nF,EAFf,IAAI04E,EAAa78C,KA6C5B,SAAqB77B,GACnB,IAAI41D,EAAO9mC,EAAQm5D,EAAMC,EAEzB,GAAoB,MAAhBloF,EAAMslF,MAAe,CAKvB,GAHAc,EAAWpmF,GACXolF,EAASplF,GAEW,MAAhBA,EAAMslF,MAAe,CAEvB,IAAI6C,EAAMC,GAASpoF,GAEnB,GAAoB,MAAhBA,EAAMslF,MAAe,CAKvB,IAHA2C,EAAO,EACPn5D,EAAS,CAACq5D,GAEa,MAAhBnoF,EAAMslF,OAEXF,EAASplF,GACT8uB,EAAOm5D,GAAQG,GAASpoF,GACxBioF,IAGF,GAAoB,MAAhBjoF,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,4BAGjCqmF,EAAYrmF,GACZolF,EAASplF,GAETkoF,EAAOp5D,EAAO,GAAGygD,MAAMt4E,OAEvB,IAAK,IAAI+R,EAAI,EAAGA,EAAIi/E,EAAMj/E,IACxB,GAAI8lB,EAAO9lB,GAAGumE,MAAMt4E,SAAWixF,EAC7B,MAAMx9B,GAAY1qD,EAAO,+BAAsC8uB,EAAO9lB,GAAGumE,MAAMt4E,OAAS,QAAUixF,EAAO,KAI7GtyB,EAAQ,IAAI0Z,EAAUxgD,OACjB,CAEL,GAAoB,MAAhB9uB,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,4BAGjCqmF,EAAYrmF,GACZolF,EAASplF,GACT41D,EAAQuyB,QAIV9B,EAAYrmF,GACZolF,EAASplF,GACT41D,EAAQ,IAAI0Z,EAAU,IAGxB,OAAOwY,EAAe9nF,EAAO41D,GAG/B,OA6BF,SAAqB51D,GACnB,GAAoB,MAAhBA,EAAMslF,MAAe,CAEvB,IAAIjtF,EADJ+tF,EAAWpmF,GAEX,IAAI+4E,EAAa,GAEjB,GAGE,GAFAqM,EAASplF,GAEW,MAAhBA,EAAMslF,MAAe,CAEvB,GAAoB,MAAhBtlF,EAAMslF,MACRjtF,EAAM0vF,EAA6B/nF,QAC9B,GAAoB,MAAhBA,EAAMslF,MACfjtF,EAAM2vF,GAA6BhoF,OAC9B,MAz+CL,IAy+CSA,EAAMqlF,WA3+CZ,IA2+C8CrlF,EAAMqlF,WAAqCrlF,EAAMslF,SAASX,GAI3G,MAAMsB,GAAkBjmF,EAAO,2CAH/B3H,EAAM2H,EAAMslF,MACZF,EAASplF,GAMX,GAAoB,MAAhBA,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,qCAGjColF,EAASplF,GAET+4E,EAAW1gF,GAAOkuF,EAAgBvmF,UAEb,MAAhBA,EAAMslF,OAGf,GAAoB,MAAhBtlF,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,oDAGjCqmF,EAAYrmF,GACZolF,EAASplF,GACT,IAAI1B,EAAO,IAAIw6E,EAAWC,GAG1B,OADO+O,EAAe9nF,EAAO1B,GAI/B,OASF,SAAqB0B,GACnB,IAAIqoF,EAEJ,OArhDQ,IAqhDJroF,EAAMqlF,WAERgD,EAAYroF,EAAMslF,MAClBF,EAASplF,GACF,IAAI04E,EAAaX,EAAQsQ,EAAW//B,EAAO0gB,UAYtD,SAA0BhpE,GACxB,IAAI1B,EAEJ,GAAoB,MAAhB0B,EAAMslF,MAAe,CAMvB,GAJAc,EAAWpmF,GACXolF,EAASplF,GACT1B,EAAOioF,EAAgBvmF,GAEH,MAAhBA,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,0BAOjC,OAJAqmF,EAAYrmF,GACZolF,EAASplF,GAEF8nF,EAAe9nF,EADtB1B,EAAO,IAAIg7E,EAAgBh7E,IAK7B,OASF,SAAkB0B,GAChB,KAAoB,KAAhBA,EAAMslF,MAEFW,GAAkBjmF,EAAO,gCAEzBimF,GAAkBjmF,EAAO,kBAd1BsoF,CAAStoF,GA7BTuoF,CAAiBvoF,GAnBjBwoF,CAAYxoF,GA3EZyoF,CAAYzoF,GAnGZ0oF,CAAY1oF,GAnDZ2oF,CAAwB3oF,GAhHxB4oF,CAAwB5oF,GA/BxB6oF,CAAY7oF,GAlFZ8oF,CAAiB9oF,GAMxB,IALA,IAAImnF,EAAY,CACd,IAAK,YACLzC,IAAM,eAGD,QAAeyC,EAAWnnF,EAAMslF,QAErCjqC,EAAK8rC,EADLhrF,EAAO6D,EAAMslF,OAEbF,EAASplF,GAGT1B,EAAOwpF,EAAe9nF,EADtB1B,EAAO,IAAI4+E,EAAa/gF,EAAMk/C,EADrB,CAAC/8C,KAKZ,OAAOA,EArCAyqF,CAAuB/oF,IAEV,MAAhBA,EAAMslF,OAAiC,OAAhBtlF,EAAMslF,SAE/BjqC,EAAc,OADdl/C,EAAO6D,EAAMslF,OACO,MAAQ,SAC5Ba,EAAoBnmF,GACpB8uB,EAAS,CAACxwB,EAAMqpF,EAAW3nF,IAE3B1B,EAAO,IAAI4+E,EAAa/gF,EAAMk/C,EAAIvsB,IAG7BxwB,EAvBA0qF,CAAShpF,GAqKlB,SAAS8nF,EAAe9nF,EAAO1B,EAAM0pE,GAGnC,IAFA,IAAIl5C,IAEoB,MAAhB9uB,EAAMslF,OAAiC,MAAhBtlF,EAAMslF,OAAiC,MAAhBtlF,EAAMslF,OAAoBtd,IAAyC,IAAhCA,EAAMx5C,QAAQxuB,EAAMslF,SAI3G,GAFAx2D,EAAS,GAEW,MAAhB9uB,EAAMslF,MAAe,CACvB,KAAI,EAAAhX,EAAA,IAAahwE,MAAS,EAAAgwE,EAAA,IAAehwE,GA0BvC,OAAOA,EArBP,GAHA8nF,EAAWpmF,GACXolF,EAASplF,GAEW,MAAhBA,EAAMslF,MAGR,IAFAx2D,EAAO9zB,KAAKurF,EAAgBvmF,IAEL,MAAhBA,EAAMslF,OAEXF,EAASplF,GACT8uB,EAAO9zB,KAAKurF,EAAgBvmF,IAIhC,GAAoB,MAAhBA,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,0BAGjCqmF,EAAYrmF,GACZolF,EAASplF,GACT1B,EAAO,IAAI+kF,EAAa/kF,EAAMwwB,QAO3B,GAAoB,MAAhB9uB,EAAMslF,MAAe,CAK9B,GAHAc,EAAWpmF,GACXolF,EAASplF,GAEW,MAAhBA,EAAMslF,MAGR,IAFAx2D,EAAO9zB,KAAKurF,EAAgBvmF,IAEL,MAAhBA,EAAMslF,OAEXF,EAASplF,GACT8uB,EAAO9zB,KAAKurF,EAAgBvmF,IAIhC,GAAoB,MAAhBA,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,0BAGjCqmF,EAAYrmF,GACZolF,EAASplF,GACT1B,EAAO,IAAI6iF,EAAa7iF,EAAM,IAAImjF,EAAU3yD,QACvC,CAIL,GAFAs2D,EAASplF,GArwCL,IAuwCAA,EAAMqlF,UACR,MAAMY,GAAkBjmF,EAAO,oCAGjC8uB,EAAO9zB,KAAK,IAAI09E,EAAa14E,EAAMslF,QACnCF,EAASplF,GAET1B,EAAO,IAAI6iF,EAAa7iF,EAAM,IAAImjF,EAAU3yD,GAD1B,IAKtB,OAAOxwB,EA6BT,SAASypF,EAA6B/nF,GAGpC,IAFA,IAAI67B,EAAM,GAEyB,KAA5BopD,EAAiBjlF,IAA6C,MAA5BilF,EAAiBjlF,IACxB,OAA5BilF,EAAiBjlF,KAGnB67B,GAAOopD,EAAiBjlF,GACxBlF,EAAKkF,IAGP67B,GAAOopD,EAAiBjlF,GACxBlF,EAAKkF,GAKP,GAFAolF,EAASplF,GAEW,MAAhBA,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,4BAIjC,OADAolF,EAASplF,GACFq5B,KAAKzoB,MAAM,IAAMirB,EAAM,KA6BhC,SAASmsD,GAA6BhoF,GAGpC,IAFA,IAAI67B,EAAM,GAEyB,KAA5BopD,EAAiBjlF,IAA6C,MAA5BilF,EAAiBjlF,IACxB,OAA5BilF,EAAiBjlF,KAGnB67B,GAAOopD,EAAiBjlF,GACxBlF,EAAKkF,IAGP67B,GAAOopD,EAAiBjlF,GACxBlF,EAAKkF,GAKP,GAFAolF,EAASplF,GAEW,MAAhBA,EAAMslF,MACR,MAAMW,GAAkBjmF,EAAO,4BAIjC,OADAolF,EAASplF,GACFq5B,KAAKzoB,MAAM,IAAMirB,EAAM,KA6EhC,SAASusD,GAASpoF,GAIhB,IAHA,IAAI8uB,EAAS,CAACy3D,EAAgBvmF,IAC1BhJ,EAAM,EAEa,MAAhBgJ,EAAMslF,OAEXF,EAASplF,GAET8uB,EAAO93B,GAAOuvF,EAAgBvmF,GAC9BhJ,IAGF,OAAO,IAAIs4E,EAAUxgD,GA2IvB,SAASm6D,GAAIjpF,GACX,OAAOA,EAAMs7B,MAAQt7B,EAAMslF,MAAMruF,OAAS,EAW5C,SAASgvF,GAAkBjmF,EAAO4gB,GAChC,IAAI/a,EAAIojF,GAAIjpF,GACRmR,EAAQ,IAAIsuB,YAAY7e,EAAU,UAAY/a,EAAI,KAEtD,OADAsL,EAAM+3E,KAAOrjF,EACNsL,EAWT,SAASu5C,GAAY1qD,EAAO4gB,GAC1B,IAAI/a,EAAIojF,GAAIjpF,GACRmR,EAAQ,IAAIsuB,YAAY7e,EAAU,UAAY/a,EAAI,KAEtD,OADAsL,EAAM+3E,KAAOrjF,EACNsL,EAGT,OAlwCAP,EAAMs1E,QAAU,SAAiBrgF,EAAGsjF,EAAOC,GACzC,OAAOx4E,EAAMy4E,oBAAoBxjF,IAAM+K,EAAM04E,kBAAkBzjF,EAAGujF,IAAUx4E,EAAM04E,kBAAkBH,EAAOtjF,IAS7G+K,EAAMy4E,oBAAsB,SAA6BxjF,GACvD,MAAO,sDAAsDzJ,KAAKyJ,IAmBpE+K,EAAM04E,kBAAoB,SAA2BC,EAAM12C,GACzD,MAAO,aAAaz2C,KAAKmtF,IAAS,oBAAoBntF,KAAKy2C,IAAQ,2KAA2Kz2C,KAAKy2C,IAUrPjiC,EAAM20E,aAAe,SAAsB1/E,EAAG2/E,GAE5C,MAAa,MAAN3/E,GAAmB,OAANA,GAAoB,OAANA,GAAc2/E,EAAe,GAWjE50E,EAAMo1E,cAAgB,SAAuBngF,EAAGujF,GAC9C,MAAa,MAANvjF,GAAuB,MAAVujF,GAA2B,MAAVA,GAA2B,MAAVA,GASxDx4E,EAAMg1E,WAAa,SAAoB//E,GACrC,OAAOA,GAAK,KAAOA,GAAK,KAAa,MAANA,GASjC+K,EAAMm1E,QAAU,SAAiBlgF,GAC/B,OAAOA,GAAK,KAAOA,GAAK,KAS1B+K,EAAMk1E,WAAa,SAAoBjgF,GACrC,OAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KA6qCnE+K,KC9tDL,GAAO,WACP,GAAe,CAAC,QAAS,SAClB44E,IAAgC,EAAA9b,EAAA,IAAQ,GAAM,IAAe1jB,IACtE,IAAI,MACF+1B,EAAK,MACLnvE,GACEo5C,EAkCJ,OAAO+1B,EAAM,GAAM,CACjB9f,OAAQ,SAAgB+N,GAEtB,OAAOp9D,EAAMo9D,GAAMH,UAAU78D,SADjB,KAGd,iBAAkB,SAAsBg9D,EAAMJ,GAC5C,OAAOh9D,EAAMo9D,GAAMH,UAAU78D,SAAS48D,IAExC,iBAAkB,SAAqBI,GACrC,IAAIJ,EAAQ,GACZ,OAAO,SAAQI,GAAM,SAAU1/C,GAC7B,OAAO1d,EAAM0d,GAAOu/C,UAAU78D,SAAS48D,OAG3C,yBAA0B,SAA2BI,EAAMJ,GACzD,OAAO,SAAQI,GAAM,SAAU1/C,GAC7B,OAAO1d,EAAM0d,GAAOu/C,UAAU78D,SAAS48D,YCrD3C,GAAe,CAAC,SACT6b,IAAiC,EAAA/b,EAAA,IAFjC,OAE+C,IAAe1jB,IACvE,IAAI,MACFp5C,GACEo5C,EAaJ,SAAS0/B,EAAKC,GACZ,KAAMntF,gBAAgBktF,GACpB,MAAM,IAAIjqD,YAAY,oDAGxB,IAAKkqD,EAAK,MAAM,IAAIhsD,MAAM,0BAC1BnhC,KAAKmtF,IAAMA,EAiGb,OA1FAD,EAAKjxF,UAAUmE,KAAO,OACtB8sF,EAAKjxF,UAAUmxF,QAAS,EAOxBF,EAAKjxF,UAAUyD,SAAW,WACxB,IAAIytF,EAAMntF,KAAKmtF,KAAO,GAClBvwF,EAAO,KAkBX,GAhBIuwF,EAAIxtF,OACN/C,GAAQ,SAAWuwF,EAAIxtF,KAAO,QAG5BwtF,EAAIxnE,WACN/oB,GAAQ,aAAeuwF,EAAIxnE,SAAW,QAGpCwnE,EAAIE,cACNzwF,GAAQ,qBAAuBuwF,EAAIE,YAAc,QAG/CF,EAAIrJ,SACNlnF,GAAQ,gBAAkBuwF,EAAIrJ,OAAO96C,KAAK,UAAY,QAGpDmkD,EAAIG,SAAU,CAChB1wF,GAAQ,cAGR,IAFA,IAAIw0E,EAAQ,GAEH12E,EAAI,EAAGA,EAAIyyF,EAAIG,SAAS7yF,OAAQC,IAAK,CAC5C,IAAI82E,EAAO2b,EAAIG,SAAS5yF,GACxBkC,GAAQ,OAAS40E,EAAO,KACxB,IAAI/7C,OAAM,EAEV,IAEEA,EAAMrhB,EAAMo9D,GAAMH,UAAU78D,SAAS48D,GACrC,MAAOvwE,GACP40B,EAAM50B,OAGI1C,IAARs3B,IAAsB,EAAAq8C,EAAA,IAAOr8C,KAC/B74B,GAAQ,YAAa,QAAO64B,EAAK,CAC/B8pB,UAAW,KACR,MAIT3iD,GAAQ,KAOV,OAJIuwF,EAAII,SAAWJ,EAAII,QAAQ9yF,SAC7BmC,GAAQ,aAAeuwF,EAAII,QAAQvkD,KAAK,MAAQ,MAG3CpsC,GAOTswF,EAAKjxF,UAAUmtD,OAAS,WACtB,IAAI9pD,GAAM,QAAMU,KAAKmtF,KAErB,OADA7tF,EAAIg0E,OAAS,OACNh0E,GAST4tF,EAAK3Z,SAAW,SAAUzjB,GACxB,IAAIq9B,EAAM,GAIV,OAHAxxF,OAAO4G,KAAKutD,GAAM3iD,QAAO0xB,GAAiB,WAATA,IAAmBl9B,SAAQk9B,IAC1DsuD,EAAItuD,GAAQixB,EAAKjxB,MAEZ,IAAIquD,EAAKC,IAOlBD,EAAKjxF,UAAUktD,QAAU+jC,EAAKjxF,UAAUyD,SACjCwtF,IACN,CACDta,SAAS,IC3HP,GAAe,CAAC,SACT4a,IAAmC,EAAAtc,EAAA,IAFnC,SAEiD,IAAe1jB,IACzE,IAAI,MACFp5C,GACEo5C,EAkDJ,SAASigC,IACP,KAAMztF,gBAAgBytF,GACpB,MAAM,IAAIxqD,YAAY,oDAGxBjjC,KAAKoxE,MAAQ,GA2Ef,OApEAqc,EAAOxxF,UAAUmE,KAAO,SACxBqtF,EAAOxxF,UAAUyxF,UAAW,EAQ5BD,EAAOxxF,UAAUuY,SAAW,SAAUg9D,GAEpC,OAAOp9D,EAAMo9D,GAAMH,UAAU78D,SAASxU,KAAKoxE,QAU7Cqc,EAAOxxF,UAAUK,IAAM,SAAUqD,GAE/B,OAAOA,KAAQK,KAAKoxE,OAAQ,QAAgBpxE,KAAKoxE,MAAOzxE,QAAQxB,GAQlEsvF,EAAOxxF,UAAU0xF,OAAS,WACxB,OAAO,QAAO,GAAI3tF,KAAKoxE,QASzBqc,EAAOxxF,UAAU4uB,IAAM,SAAUlrB,EAAM7C,GAErC,OAAO,QAAgBkD,KAAKoxE,MAAOzxE,EAAM7C,IAQ3C2wF,EAAOxxF,UAAU2xF,OAAS,SAAUjuF,UAE3BK,KAAKoxE,MAAMzxE,IAOpB8tF,EAAOxxF,UAAUw7D,MAAQ,WACvB,IAAK,IAAI8nB,KAASv/E,KAAKoxE,OACjB,QAAepxE,KAAKoxE,MAAOmO,WACtBv/E,KAAKoxE,MAAMmO,IAKjBkO,IACN,CACD7a,SAAS,IC5IAib,GAAS,CAClBluF,KAAM,KACNgmB,SAAU,YACVm+D,OAAQ,CAAC,MACTuJ,YAAa,gJACbC,SAAU,CAAC,KAAM,aACjBC,QAAS,CAAC,QCNDO,GAAQ,CACjBnuF,KAAM,IACNgmB,SAAU,YACVm+D,OAAQ,CAAC,KACTuJ,YAAa,oFACbC,SAAU,CAAC,IAAK,QAAS,SAAU,UACnCC,QAAS,CAAC,QCqNDQ,GAAe,CAExBtS,UC7NyB,CACzB97E,KAAM,YACNgmB,SAAU,eACVm+D,OAAQ,CAAC,gBACTuJ,YAAa,+CACbC,SAAU,CAAC,YAAa,kCAAmC,mBAAoB,uBAAwB,8BACvGC,QAAS,CAAC,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,SDwNzES,QE9NuB,CACvBruF,KAAM,UACNgmB,SAAU,eACVm+D,OAAQ,CAAC,IAAK,cACduJ,YAAa,6CACbC,SAAU,CAAC,aAAc,aAAc,aAAc,kBAAmB,mBAAoB,yBAC5FC,QAAS,CAAC,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SFyNzE7R,QG/NuB,CACvB/7E,KAAM,UACNgmB,SAAU,eACVm+D,OAAQ,CAAC,YAAa,kBAAmB,mBACzCuJ,YAAa,2BACbC,SAAU,CAAC,YAAa,gBAAiB,qBACzCC,QAAS,CAAC,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SH0NzEU,WIhO0B,CAC1BtuF,KAAM,aACNgmB,SAAU,eACVm+D,OAAQ,CAAC,0BAA2B,gCACpCuJ,YAAa,iEACbC,SAAU,CAAC,oBAAqB,uFAAwF,oCACxHC,QAAS,CAAC,OAAQ,cJ2NlBW,SKjOwB,CACxBvuF,KAAM,WACNgmB,SAAU,eACVm+D,OAAQ,CAAC,gBAAiB,qBAC1BuJ,YAAa,uEACbC,SAAU,CAAC,kBAAmB,mCAC9BC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SL4N1EzuD,MMlOqB,CACrBn/B,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,UAAW,cAAe,mBAAoB,yBAA0B,kCAAmC,+CACpHuJ,YAAa,yDACbC,SAAU,CAAC,KAAM,YAAa,yBAA0B,UAAW,eAAgB,4BACnFC,QAAS,CAAC,YAAa,UAAW,UAAW,UAAW,SAAU,QAAS,SAAU,SN6NrFliF,OOnOsB,CACtB1L,KAAM,SACNgmB,SAAU,eACVm+D,OAAQ,CAAC,KAAM,6BAA8B,WAAY,kBAAmB,iBAC5EuJ,YAAa,mBACbC,SAAU,CAAC,KAAM,YAAa,qBAAsB,WAAY,iBAAkB,iCAAkC,4CACpHC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WP8NlF/gB,OQpOsB,CACtB7sE,KAAM,SACNgmB,SAAU,eACVm+D,OAAQ,CAAC,IAAK,YAAa,+BAC3BuJ,YAAa,gEACbC,SAAU,CAAC,IAAK,MAAO,OAAQ,YAAa,gBAAiB,eAAgB,oCAAqC,6BAClHC,QAAS,CAAC,YAAa,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,SR+NtF5R,OSrOsB,CACtBh8E,KAAM,SACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WAAY,qCAAsC,gDAC3DuJ,YAAa,0BACbC,SAAU,CAAC,WAAY,uBAAwB,kCAC/CC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WTgOlFY,UUtOyB,CACzBxuF,KAAM,YACNgmB,SAAU,eACVm+D,OAAQ,CAAC,wCACTuJ,YAAa,6EACbC,SAAU,CAAC,oCACXC,QAAS,CAAC,OAAQ,eViOlB9pB,OWvOsB,CACtB9jE,KAAM,SACNgmB,SAAU,eACVm+D,OAAQ,CAAC,SAAU,aACnBuJ,YAAa,iDACbC,SAAU,CAAC,iBAAkB,cAAe,kBAC5CC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SXkO1EhoF,KYxOoB,CACpB5F,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,aAAc,oBAAqB,gBAC5CuJ,YAAa,iBACbC,SAAU,CAAC,SAAU,SAAU,wBAAyB,kBACxDC,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,WZoO1E1sF,EAAGitF,GACHxoD,EAAGwoD,GACH3W,Ma5OqB,CACrBx3E,KAAM,QACNgmB,SAAU,YACVm+D,OAAQ,CAAC,SACTuJ,YAAa,sBACbC,SAAU,CAAC,SACXC,QAAS,CAAC,SbuOV7yF,Ec7OiB,CACjBiF,KAAM,IACNgmB,SAAU,YACVm+D,OAAQ,CAAC,KACTuJ,YAAa,sIACbC,SAAU,CAAC,IAAK,QAAS,YACzBC,QAAS,IdwOT9oD,Se9OwB,CACxB9kC,KAAM,WACNgmB,SAAU,YACVm+D,OAAQ,CAAC,YACTuJ,YAAa,6GACbC,SAAU,CAAC,WAAY,SACvBC,QAAS,IfyOTa,IgB/OmB,CACnBzuF,KAAM,MACNgmB,SAAU,YACVm+D,OAAQ,CAAC,OACTuJ,YAAa,mEACbC,SAAU,CAAC,MAAO,UAClBC,QAAS,IhB0OTluC,KiBhPoB,CACpB1/C,KAAM,OACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QACTuJ,YAAa,oEACbC,SAAU,CAAC,OAAQ,WACnBC,QAAS,IjB2OTc,MkBjPqB,CACrB1uF,KAAM,QACNgmB,SAAU,YACVm+D,OAAQ,CAAC,SACTuJ,YAAa,kEACbC,SAAU,CAAC,QAAS,aACpBC,QAAS,IlB4OTe,OmBlPsB,CACtB3uF,KAAM,SACNgmB,SAAU,YACVm+D,OAAQ,CAAC,UACTuJ,YAAa,mEACbC,SAAU,CAAC,SAAU,cACrBC,QAAS,InB6OThoD,IoBnPmB,CACnB5lC,KAAM,MACNgmB,SAAU,YACVm+D,OAAQ,CAAC,OACTuJ,YAAa,eACbC,SAAU,CAAC,MAAO,SAClBC,QAAS,IpB8OTjF,KqBpPoB,CACpB3oF,KAAM,OACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QACTuJ,YAAa,aACbC,SAAU,CAAC,QACXC,QAAS,CAAC,OAAQ,UrB+OlB1hC,GAAIgiC,GACJnjF,GAAImjF,GACJnX,IsBvPmB,CACnB/2E,KAAM,MACNgmB,SAAU,YACVm+D,OAAQ,CAAC,OACTuJ,YAAa,mOACbC,SAAU,CAAC,OACXC,QAAS,ItBkPTgB,QuBxPsB,CACtB5uF,KAAM,UACNgmB,SAAU,YACVm+D,OAAQ,CAAC,WACTuJ,YAAa,+DACbC,SAAU,CAAC,UAAW,aACtBC,QAAS,IvBmPTiB,MwBzPqB,CACrB7uF,KAAM,QACNgmB,SAAU,YACVm+D,OAAQ,CAAC,SACTuJ,YAAa,6DACbC,SAAU,CAAC,QAAS,WACpBC,QAAS,IxBoPTjX,IyB1PmB,CACnB32E,KAAM,MACNgmB,SAAU,YACVm+D,OAAQ,CAAC,OACTuJ,YAAa,0GACbC,SAAU,CAAC,MAAO,UAClBC,QAAS,CAAC,OzBqPVrW,K0B3PoB,CACpBv3E,KAAM,OACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QACTuJ,YAAa,qBACbC,SAAU,CAAC,QACXC,QAAS,CAAC,U1BsPVxnD,Q2B5PuB,CACvBpmC,KAAM,UACNgmB,SAAU,YACVm+D,OAAQ,CAAC,WACTuJ,YAAa,8CACbC,SAAU,CAAC,WACXC,QAAS,I3ByPTkB,aAAc,CACZpB,YAAa,2BACbC,SAAU,CAAC,iBAEboB,oBAAqB,CACnBrB,YAAa,oCACbC,SAAU,CAAC,wBAEbqB,eAAgB,CACdtB,YAAa,kBACbC,SAAU,CAAC,mBAEbsB,sBAAuB,CACrBvB,YAAa,0BACbC,SAAU,CAAC,0BAEbuB,iBAAkB,CAChBxB,YAAa,0CACbC,SAAU,CAAC,qBAEbwB,iBAAkB,CAChBzB,YAAa,0CACbC,SAAU,CAAC,qBAEbyB,gBAAiB,CACf1B,YAAa,qCACbC,SAAU,CAAC,oBAEb0B,QAAS,CACP3B,YAAa,qBACbC,SAAU,CAAC,YAEb2B,iBAAkB,CAChB5B,YAAa,oBACbC,SAAU,CAAC,qBAEb4B,aAAc,CACZ7B,YAAa,gBACbC,SAAU,CAAC,iBAEb6B,mBAAoB,CAClB9B,YAAa,sBACbC,SAAU,CAAC,uBAEb8B,0BAA2B,CACzB/B,YAAa,8BACbC,SAAU,CAAC,8BAGb+B,oBAAqB,CACnBhC,YAAa,wBACbC,SAAU,CAAC,wBAEbgC,gBAAiB,CACfjC,YAAa,mBACbC,SAAU,CAAC,oBAEbiC,SAAU,CACRlC,YAAa,wBACbC,SAAU,CAAC,aAEbkC,WAAY,CACVnC,YAAa,cACbC,SAAU,CAAC,eAEbmC,wBAAyB,CACvBpC,YAAa,4BACbC,SAAU,CAAC,4BAEboC,aAAc,CACZrC,YAAa,gBACbC,SAAU,CAAC,iBAEbqC,cAAe,CACbtC,YAAa,0BACbC,SAAU,CAAC,kBAEbsC,cAAe,CACbvC,YAAa,0BACbC,SAAU,CAAC,kBAEbuC,cAAe,CACbxC,YAAa,iBACbC,SAAU,CAAC,kBAEbwC,WAAY,CACVzC,YAAa,cACbC,SAAU,CAAC,eAEbyC,aAAc,CACZ1C,YAAa,gBACbC,SAAU,CAAC,iBAEb0C,YAAa,CACX3C,YAAa,eACbC,SAAU,CAAC,gBAEb2C,qBAAsB,CACpB5C,YAAa,yBACbC,SAAU,CAAC,yBAEb4C,QAAS,CACP7C,YAAa,mBACbC,SAAU,CAAC,YAEb6C,oBAAqB,CACnB9C,YAAa,wBACbC,SAAU,CAAC,wBAEb8C,gBAAiB,CACf/C,YAAa,oBACbC,SAAU,CAAC,oBAEb+C,aAAc,CACZhD,YAAa,gBACbC,SAAU,CAAC,iBAEbgD,WAAY,CACVjD,YAAa,uBACbC,SAAU,CAAC,eAEbiD,SAAU,CACRlD,YAAa,oBACbC,SAAU,CAAC,aAEbkD,UAAW,CACTnD,YAAa,qBACbC,SAAU,CAAC,cAEbmD,QAAS,CACPpD,YAAa,mBACbC,SAAU,CAAC,YAEboD,eAAgB,CACdrD,YAAa,2BACbC,SAAU,CAAC,mBAEbqD,UAAW,CACTtD,YAAa,qDACbC,SAAU,CAAC,cAEbsD,YAAa,CACXvD,YAAa,eACbC,SAAU,CAAC,gBAEbuD,oBAAqB,CACnBxD,YAAa,wBACbC,SAAU,CAAC,wBAEbwD,YAAa,CACXzD,YAAa,+DACbC,SAAU,CAAC,gBAEbyD,cAAe,CACb1D,YAAa,qDACbC,SAAU,CAAC,kBAEb0D,gBAAiB,CACf3D,YAAa,4BACbC,SAAU,CAAC,oBAEb2D,gBAAiB,CACf5D,YAAa,4BACbC,SAAU,CAAC,oBAEb4D,iBAAkB,CAChB7D,YAAa,iCACbC,SAAU,CAAC,qBAGb6D,UAAW,CACT9D,YAAa,sBACbC,SAAU,CAAC,cAEb8D,aAAc,CACZ/D,YAAa,mCACbC,SAAU,CAAC,iBAEb+D,QAAS,CACPhE,YAAa,iFACbC,SAAU,CAAC,YAEbgE,aAAc,CACZjE,YAAa,gBACbC,SAAU,CAAC,iBAEbiE,WAAY,CACVlE,YAAa,cACbC,SAAU,CAAC,eAEbkE,WAAY,CACVnE,YAAa,cACbC,SAAU,CAAC,eAEbmE,aAAc,CACZpE,YAAa,gBACbC,SAAU,CAAC,iBAEboE,kBAAmB,CACjBrE,YAAa,qBACbC,SAAU,CAAC,sBAGbqE,W4B1c0B,CAC1BhyF,KAAM,aACNgmB,SAAU,UACVm+D,OAAQ,CAAC,6BAA8B,mDACvCuJ,YAAa,4OACbC,SAAU,CAAC,0BAA2B,6CAA8C,mCAAoC,6BAA8B,uBAAwB,iBAAkB,wBAAyB,uBACzNC,QAAS,CAAC,WAAY,QAAS,a5Bqc/BqE,O6B3csB,CACtBjyF,KAAM,SACNgmB,SAAU,UACVm+D,OAAQ,CAAC,kBACTuJ,YAAa,gIACbC,SAAU,CAAC,oBAAqB,cAAe,oBAC/CC,QAAS,CAAC,YAAa,MAAO,UAAW,SAAU,SAAU,W7Bsc7DsE,U8B5cyB,CACzBlyF,KAAM,YACNgmB,SAAU,UACVm+D,OAAQ,CAAC,qBACTuJ,YAAa,iIACbC,SAAU,CAAC,oBAAqB,cAAe,oBAC/CC,QAAS,CAAC,SAAU,MAAO,UAAW,SAAU,SAAU,W9Buc1DuE,I+B7cmB,CACnBnyF,KAAM,MACNgmB,SAAU,UACVm+D,OAAQ,CAAC,UACTuJ,YAAa,sIACbC,SAAU,CAAC,wBAAyB,gCAAiC,iCACrEC,QAAS,CAAC,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,O/BwcpEwE,QgC9cuB,CACvBpyF,KAAM,UACNgmB,SAAU,UACVm+D,OAAQ,CAAC,kBAAmB,oBAC5BuJ,YAAa,gGACbC,SAAU,CAAC,oBAAqB,cAAe,qBAC/CC,QAAS,CAAC,MAAO,MAAO,SAAU,SAAU,SAAU,WhCyctD3uD,SiC/cwB,CACxBj/B,KAAM,WACNgmB,SAAU,UACVm+D,OAAQ,CAAC,iBAAkB,yBAC3BuJ,YAAa,+BACbC,SAAU,CAAC,wBAAyB,qBAAsB,+BAAgC,2BAA4B,+BACtHC,QAAS,CAAC,aAAc,QAAS,ajC0cjCyE,YkChd2B,CAC3BryF,KAAM,cACNgmB,SAAU,UACVm+D,OAAQ,CAAC,oBAAqB,2BAA4B,sCAC1DuJ,YAAa,mPACbC,SAAU,CAAC,gCAAiC,uCAC5CC,QAAS,CAAC,alC2cV0E,ImCjdmB,CACnBtyF,KAAM,MACNgmB,SAAU,UACVm+D,OAAQ,CAAC,4BACTuJ,YAAa,wKACbC,SAAU,CAAC,2FACXC,QAAS,CAAC,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,OnC4cpE2E,OoCldsB,CACtBvyF,KAAM,SACNgmB,SAAU,UACVm+D,OAAQ,CAAC,kBACTuJ,YAAa,gIACbC,SAAU,CAAC,oFACXC,QAAS,CAAC,YAAa,MAAO,UAAW,SAAU,SAAU,WpC6c7D4E,UqCndyB,CACzBxyF,KAAM,YACNgmB,SAAU,UACVm+D,OAAQ,CAAC,kBACTuJ,YAAa,iIACbC,SAAU,CAAC,oFACXC,QAAS,CAAC,SAAU,MAAO,UAAW,SAAU,SAAU,WrC8c1D6E,GsCpdkB,CAClBzyF,KAAM,KACNgmB,SAAU,UACVm+D,OAAQ,CAAC,SACTuJ,YAAa,uKACbC,SAAU,CAAC,4DACXC,QAAS,CAAC,MAAO,MAAO,WtCgdxBpiF,IuCtdmB,CACnBxL,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,UACTuJ,YAAa,8BACbC,SAAU,CAAC,WAAY,aACvBC,QAAS,CAAC,SvCidVjzE,IwCvdmB,CACnB3a,KAAM,MACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QAAS,aAClBuJ,YAAa,kBACbC,SAAU,CAAC,gBAAiB,UAAW,SAAU,gBAAiB,eAClEC,QAAS,CAAC,axCkdVtqC,KyCxdoB,CACpBtjD,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,UAAW,qBACpBuJ,YAAa,iQACbC,SAAU,CAAC,WAAY,UAAW,WAAY,eAAgB,WAAY,iBAAkB,gBAC5FC,QAAS,CAAC,SAAU,OAAQ,OAAQ,azCmdpC5qE,K0CzdoB,CACpBhjB,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,WACTuJ,YAAa,wHACbC,SAAU,CAAC,YAAa,YAAa,cACrCC,QAAS,CAAC,QAAS,MAAO,U1Cod1BlU,K2C1doB,CACpB15E,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,WACTuJ,YAAa,2DACbC,SAAU,CAAC,UAAW,MAAO,aAC7BC,QAAS,CAAC,WAAY,SAAU,Q3CqdhChqC,O4C3dsB,CACtB5jD,KAAM,SACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QAAS,gBAClBuJ,YAAa,qBACbC,SAAU,CAAC,YAAa,QAAS,UAAW,YAAa,cAAe,eACxEC,QAAS,CAAC,a5CsdVtV,U6C5dyB,CACzBt4E,KAAM,YACNgmB,SAAU,YACVm+D,OAAQ,CAAC,SAAU,mBACnBuJ,YAAa,kCACbC,SAAU,CAAC,yBAA0B,yBAA0B,UAC/DC,QAAS,CAAC,WAAY,cAAe,W7CudrCvV,Y8C7d2B,CAC3Br4E,KAAM,cACNgmB,SAAU,YACVm+D,OAAQ,CAAC,SAAU,qBACnBuJ,YAAa,oCACbC,SAAU,CAAC,yBAA0B,yBAA0B,UAC/DC,QAAS,CAAC,WAAY,SAAU,c9CwdhC5V,O+C9dsB,CACtBh4E,KAAM,SACNgmB,SAAU,YACVm+D,OAAQ,CAAC,SAAU,gBACnBuJ,YAAa,+CACbC,SAAU,CAAC,yBAA0B,UACrCC,QAAS,CAAC,Q/CydVzqD,IgD/dmB,CACnBnjC,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,UACTuJ,YAAa,qCACbC,SAAU,CAAC,WAAY,UAAW,gBAAiB,UAAW,uDAC9DC,QAAS,CAAC,OAAQ,QAAS,MAAO,QhD0dlCpT,KiDheoB,CACpBx6E,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,UACTuJ,YAAa,wJACbC,SAAU,CAAC,uBACXC,QAAS,CAAC,QjD2dVppD,MkDjeqB,CACrBxkC,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,YACTuJ,YAAa,mEACbC,SAAU,CAAC,WAAY,gBAAiB,qBACxCC,QAAS,CAAC,MAAO,MAAO,QlD4dxBjU,ImDlemB,CACnB35E,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,UACTuJ,YAAa,sGACbC,SAAU,CAAC,WAAY,WAAY,YAAa,aAChDC,QAAS,CAAC,OAAQ,QAAS,UnD6d3B9qE,MoDneqB,CACrB9iB,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,YACTuJ,YAAa,yHACbC,SAAU,CAAC,aAAc,aAAc,eACvCC,QAAS,CAAC,OAAQ,MAAO,UpD8dzBv+B,IqDpemB,CACnBrvD,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,YAAa,qBACtBuJ,YAAa,uCACbC,SAAU,CAAC,aAAc,aAAc,oBACvCC,QAAS,CAAC,MAAO,SrD+djBphC,MsDreqB,CACrBxsD,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,sBAAuB,yBAChCuJ,YAAa,mDACbC,SAAU,CAAC,cAAe,kBAAmB,YAAa,oBAC1DC,QAAS,CAAC,MAAO,StDgejB8E,IuDtemB,CACnB1yF,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,aACTuJ,YAAa,qCACbC,SAAU,CAAC,YAAa,aAAc,iBACtCC,QAAS,CAAC,QvDieVlqD,IwDvemB,CACnB1jC,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,SAAU,gBACnBuJ,YAAa,8NACbC,SAAU,CAAC,WAAY,eAAgB,SAAU,SAAU,iBAAkB,uBAAwB,mBAAoB,SACzHC,QAAS,CAAC,MAAO,QAAS,OAAQ,UxDkelClhC,KyDxeoB,CACpB1sD,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,WACTuJ,YAAa,gFACbC,SAAU,CAAC,gBAAiB,WAAY,qBAAsB,aAC9DC,QAAS,CAAC,MAAO,QAAS,MAAO,UzDmejChU,M0DzeqB,CACrB55E,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,WAAY,kBACrBuJ,YAAa,yCACbC,SAAU,CAAC,aAAc,kBAAmB,aAAc,kBAAmB,yBAC7EC,QAAS,CAAC,MAAO,MAAO,OAAQ,U1DoehCjhC,M2D1eqB,CACrB3sD,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,YACTuJ,YAAa,4CACbC,SAAU,CAAC,iBAAkB,eAAgB,SAAU,uBAAwB,kBAC/EC,QAAS,CAAC,MAAO,Q3DqejBxmC,I4D3emB,CACnBpnD,KAAM,MACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QAAS,UAAW,aAC7BuJ,YAAa,gEACbC,SAAU,CAAC,QAAS,SAAU,WAAY,mBAAoB,WAAY,YAC1EC,QAAS,CAAC,W5DseV5gF,S6D5ewB,CACxBhN,KAAM,WACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QAAS,kBAClBuJ,YAAa,uBACbC,SAAU,CAAC,gBAAiB,UAAW,YAAa,cAAe,cACnEC,QAAS,CAAC,W7DueV/T,K8D7eoB,CACpB75E,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,UAAW,cACpBuJ,YAAa,oDACbC,SAAU,CAAC,YAAa,aAAc,eAAgB,6BAA8B,8BAA+B,kBAAmB,4BAA6B,gCAAiC,kC9DyepM7T,Q+D9euB,CACvB95E,KAAM,UACNgmB,SAAU,aACVm+D,OAAQ,CAAC,aAAc,oBACvBuJ,YAAa,qJACbC,SAAU,CAAC,QAAS,iBAAkB,gBAAiB,WACvDC,QAAS,CAAC,WAAY,MAAO,S/Dye7B7T,SgE/ewB,CACxB/5E,KAAM,WACNgmB,SAAU,aACVm+D,OAAQ,CAAC,cAAe,qBACxBuJ,YAAa,2LACbC,SAAU,CAAC,cAAe,kBAC1BC,QAAS,CAAC,OAAQ,MAAO,YhE0ezB36E,IiEhfmB,CACnBjT,KAAM,MACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QAAS,aAClBuJ,YAAa,uCACbC,SAAU,CAAC,MAAO,QAAS,oBAC3BC,QAAS,CAAC,WAAY,UAAW,WAAY,SjE2e7C7nF,MkEjfqB,CACrB/F,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,WAAY,eACrBuJ,YAAa,4LACbC,SAAU,CAAC,aAAc,aAAc,cAAe,cAAe,eAAgB,uBACrFC,QAAS,CAAC,OAAQ,QAAS,QlE4e3BhjC,KmElfoB,CACpB5qD,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,WACTuJ,YAAa,iGACbC,SAAU,CAAC,YAAa,aAAc,WACtCC,QAAS,CAAC,QnE6eVxjF,KoEnfoB,CACpBpK,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,WACTuJ,YAAa,+EACbC,SAAU,CAAC,WAAY,QAAS,YAChCC,QAAS,CAAC,SAAU,QAAS,WAAY,UAAW,WAAY,QpE8ehElT,MqEpfqB,CACrB16E,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,YACTuJ,YAAa,+IACbC,SAAU,CAAC,2BACXC,QAAS,CAAC,OAAQ,MAAO,SAAU,arE+enC5T,OsErfsB,CACtBh6E,KAAM,SACNgmB,SAAU,aACVm+D,OAAQ,CAAC,aACTuJ,YAAa,2DACbC,SAAU,CAAC,YAAa,UAAW,MAAO,SAC1CC,QAAS,CAAC,WAAY,MAAO,OAAQ,StEgfrC9jC,SuEtfwB,CACxB9pD,KAAM,WACNgmB,SAAU,YACVm+D,OAAQ,CAAC,QAAS,kBAClBuJ,YAAa,uBACbC,SAAU,CAAC,cAAe,QAAS,YAAa,YAAa,iBAC7DC,QAAS,CAAC,QvEifV1V,WwEvf0B,CAC1Bl4E,KAAM,aACNgmB,SAAU,YACVm+D,OAAQ,CAAC,KAAM,iBACfuJ,YAAa,yEACbC,SAAU,CAAC,OAAQ,UAAW,SAC9BC,QAAS,CAAC,MAAO,WAAY,cxEkf7B3V,UyExfyB,CACzBj4E,KAAM,YACNgmB,SAAU,YACVm+D,OAAQ,CAAC,KAAM,gBACfuJ,YAAa,4CACbC,SAAU,CAAC,QAAS,QACpBC,QAAS,CAAC,MAAO,WAAY,ezEmf7B+E,K0EzfoB,CACpB3yF,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,cACTuJ,YAAa,iLACbC,SAAU,CAAC,cAAe,aAAc,sBACxCC,QAAS,CAAC,MAAO,Q1EqfjB3U,O2E3fsB,CACtBj5E,KAAM,SACNgmB,SAAU,UACVm+D,OAAQ,CAAC,QAAS,gBAClBuJ,YAAa,6QACbC,SAAU,CAAC,QAAS,kBAAmB,oBACvCC,QAAS,CAAC,SAAU,QAAS,SAAU,YAAa,kBAAmB,kB3EsfvEzV,O4E5fsB,CACtBn4E,KAAM,SACNgmB,SAAU,UACVm+D,OAAQ,CAAC,KAAM,aACfuJ,YAAa,8IACbC,SAAU,CAAC,KAAM,KAAM,sBACvBC,QAAS,CAAC,SAAU,QAAS,SAAU,YAAa,kBAAmB,kB5EufvEzU,M6E7fqB,CACrBn5E,KAAM,QACNgmB,SAAU,UACVm+D,OAAQ,CAAC,QAAS,eAClBuJ,YAAa,8PACbC,SAAU,CAAC,QAAS,uBACpBC,QAAS,CAAC,SAAU,SAAU,SAAU,YAAa,kBAAmB,kB7EwfxE1U,O8E9fsB,CACtBl5E,KAAM,SACNgmB,SAAU,UACVm+D,OAAQ,CAAC,gBACTuJ,YAAa,mRACbC,SAAU,CAAC,cAAe,wBAC1BC,QAAS,CAAC,SAAU,SAAU,QAAS,YAAa,kBAAmB,kB9EyfvEpV,U+E/fyB,CACzBx4E,KAAM,YACNgmB,SAAU,UACVm+D,OAAQ,CAAC,SAAU,mBACnBuJ,YAAa,+DACbC,SAAU,CAAC,SAAU,UACrBC,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,kBAAmB,kB/E0fpEnV,gBgFhgB+B,CAC/Bz4E,KAAM,kBACNgmB,SAAU,UACVm+D,OAAQ,CAAC,SAAU,yBACnBuJ,YAAa,mEACbC,SAAU,CAAC,SAAU,SAAU,YAC/BC,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,YAAa,kBhF2f9DlV,ciFjgB6B,CAC7B14E,KAAM,gBACNgmB,SAAU,UACVm+D,OAAQ,CAAC,UAAW,uBACpBuJ,YAAa,gEACbC,SAAU,CAAC,UAAW,SAAU,aAChCC,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,YAAa,oBjF6f9D3T,YkFngB2B,CAC3Bj6E,KAAM,cACNgmB,SAAU,gBACVm+D,OAAQ,CAAC,kBACTuJ,YAAa,2NACbC,SAAU,CAAC,iBAAkB,kBAC7BC,QAAS,CAAC,elF8fV1T,QmFpgBuB,CACvBl6E,KAAM,UACNgmB,SAAU,gBACVm+D,OAAQ,CAAC,cACTuJ,YAAa,0KACbC,SAAU,CAAC,aAAc,cACzBC,QAAS,CAAC,gBnF+fVgF,YoFrgB2B,CAC3B5yF,KAAM,cACNgmB,SAAU,gBACVm+D,OAAQ,CAAC,qBACTuJ,YAAa,wIACbC,SAAU,CAAC,qBACXC,QAAS,CAAC,iBpFggBVzT,WqFtgB0B,CAC1Bn6E,KAAM,aACNgmB,SAAU,gBACVm+D,OAAQ,CAAC,oBACTuJ,YAAa,kRACbC,SAAU,CAAC,oBACXC,QAAS,CAAC,gBrFkgBVzhC,OsFxgBsB,CACtBnsD,KAAM,SACNgmB,SAAU,OACVm+D,OAAQ,CAAC,WAAY,mBACrBuJ,YAAa,6CACbC,SAAU,CAAC,WAAY,YAAa,+BAAgC,aACpEC,QAAS,ItFmgBTiF,OuFzgBsB,CACtB7yF,KAAM,SACNgmB,SAAU,OACVm+D,OAAQ,CAAC,oBAAqB,8BAC9BuJ,YAAa,gDACbC,SAAU,CAAC,4CAA6C,UAAW,cACnEC,QAAS,IvFogBThK,MwF1gBqB,CACrB5jF,KAAM,QACNgmB,SAAU,OACVm+D,OAAQ,CAAC,oBAAqB,2BAC9BuJ,YAAa,2BACbC,SAAU,CAAC,iDAAkD,YAAa,mBAC1EC,QAAS,IxFsgBTzpD,IyF5gBmB,CACnBnkC,KAAM,MACNgmB,SAAU,UACVm+D,OAAQ,CAAC,UACTuJ,YAAa,iGACbC,SAAU,CAAC,cAAe,cAAe,eACzCC,QAAS,CAAC,KAAM,KAAM,OAAQ,QzFugB9BxT,K0F7gBoB,CACpBp6E,KAAM,OACNgmB,SAAU,UACVm+D,OAAQ,CAAC,WACTuJ,YAAa,gGACbC,SAAU,CAAC,eAAgB,eAAgB,eAC3CC,QAAS,CAAC,KAAM,KAAM,MAAO,Q1FwgB7BvpD,G2F9gBkB,CAClBrkC,KAAM,KACNgmB,SAAU,UACVm+D,OAAQ,CAAC,SACTuJ,YAAa,yCACbC,SAAU,CAAC,aAAc,aAAc,YAAa,WACpDC,QAAS,CAAC,KAAM,OAAQ,MAAO,Q3FygB/BtpD,G4F/gBkB,CAClBtkC,KAAM,KACNgmB,SAAU,UACVm+D,OAAQ,CAAC,SACTuJ,YAAa,8CACbC,SAAU,CAAC,aAAc,aAAc,YAAa,WACpDC,QAAS,CAAC,KAAM,OAAQ,MAAO,Q5F2gB/B/4E,S6FjhBwB,CACxB7U,KAAM,WACNgmB,SAAU,aACVm+D,OAAQ,CAAC,uBAAwB,wCACjCuJ,YAAa,uDACbC,SAAU,CAAC,oBAAqB,+BAChCC,QAAS,I7F4gBTkF,K8FlhBoB,CACpB9yF,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,eAAgB,gBACzBuJ,YAAa,oDACbC,SAAU,CAAC,aAAc,mBACzBC,QAAS,I9F8gBT38B,S+FphBwB,CACxBjxD,KAAM,WACNgmB,SAAU,WACVm+D,OAAQ,CAAC,+BAAgC,kCACzCuJ,YAAa,wDACbC,SAAU,CAAC,yBAA0B,4BACrCC,QAAS,I/F+gBT3pF,UgGrhByB,CACzBjE,KAAM,YACNgmB,SAAU,WACVm+D,OAAQ,CAAC,wCAAyC,kCAClDuJ,YAAa,0DACbC,SAAU,CAAC,gDAAiD,mDAC5DC,QAAS,IhGihBTxU,IiGvhBmB,CACnBp5E,KAAM,MACNgmB,SAAU,UACVm+D,OAAQ,CAAC,UAAW,aACpBuJ,YAAa,uFACbC,SAAU,CAAC,iBAAkB,gBAAiB,WAC9CC,QAAS,CAAC,MAAO,KAAM,QjGkhBvBxV,IkGxhBmB,CACnBp4E,KAAM,MACNgmB,SAAU,UACVm+D,OAAQ,CAAC,QAAS,UAClBuJ,YAAa,0DACbC,SAAU,CAAC,WAAY,YAAa,QAAS,SAC7CC,QAAS,CAAC,MAAO,KAAM,QlGmhBvBtU,GmGzhBkB,CAClBt5E,KAAM,KACNgmB,SAAU,UACVm+D,OAAQ,CAAC,SAAU,YACnBuJ,YAAa,mFACbC,SAAU,CAAC,gBAAiB,iBAAkB,UAC9CC,QAAS,CAAC,MAAO,MAAO,QnGohBxBvU,IoG1hBmB,CACnBr5E,KAAM,MACNgmB,SAAU,UACVm+D,OAAQ,CAAC,UAAW,aACpBuJ,YAAa,2GACbC,SAAU,CAAC,iBAAkB,kBAAmB,gBAAiB,WACjEC,QAAS,CAAC,MAAO,MAAO,OpGshBxBrrD,OqG5hBsB,CACtBviC,KAAM,SACNgmB,SAAU,SACVm+D,OAAQ,CAAC,uBAAwB,6BACjCuJ,YAAa,iKACbC,SAAU,CAAC,mBAAoB,mBAAoB,eAAgB,kBAAmB,mBACtFC,QAAS,CAAC,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UrGuhBhH7tD,MsG7hBqB,CACrB//B,KAAM,QACNgmB,SAAU,SACVm+D,OAAQ,CAAC,YACTuJ,YAAa,6DACbC,SAAU,CAAC,yBAA0B,WAAY,UAAW,wBAC5DC,QAAS,CAAC,StGwhBVvT,MuG9hBqB,CACrBr6E,KAAM,QACNgmB,SAAU,SACVm+D,OAAQ,CAAC,eACTuJ,YAAa,0EACbC,SAAU,CAAC,+BAAgC,+BAAgC,gCAC3EC,QAAS,CAAC,WAAY,QvGyhBtBmF,OwG/hBsB,CACtB/yF,KAAM,SACNgmB,SAAU,SACVm+D,OAAQ,CAAC,oBACTuJ,YAAa,0CACbC,SAAU,CAAC,uBAAwB,eAAgB,gBACnDC,QAAS,CAAC,QxG0hBV9V,WyGhiB0B,CAC1B93E,KAAM,aACNgmB,SAAU,SACVm+D,OAAQ,CAAC,KAAO,iBAChBuJ,YAAa,2CACbC,SAAU,CAAC,yBAA0B,KAAO,iBAC5CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,UzG2hB7GtT,I0GjiBmB,CACnBt6E,KAAM,MACNgmB,SAAU,SACVm+D,OAAQ,CAAC,UACTuJ,YAAa,wCACbC,SAAU,CAAC,oBAAqB,uCAChCC,QAAS,CAAC,SAAU,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U1G4hBnHoF,K2GliBoB,CACpBhzF,KAAM,OACNgmB,SAAU,SACVm+D,OAAQ,CAAC,UAAW,cACpBuJ,YAAa,4aACbC,SAAU,CAAC,YAAa,eAAgB,kCAAmC,WAC3EC,QAAS,CAAC,SAAU,MAAO,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U3G6hBlH7/E,K4GniBoB,CACpB/N,KAAM,OACNgmB,SAAU,SACVm+D,OAAQ,CAAC,YAAa,kBACtBuJ,YAAa,CAAC,kFAAmF,2GAA4G,mEAAoE,oEAAqE,0DAA6D,+HACnZC,SAAU,CAAC,wBAAyB,2BAA4B,gCAAiC,yBAA0B,4BAA6B,4BAA6B,uCAAwC,oCAAqC,qCAClQC,QAAS,CAAC,WAAY,oB5G8hBtBrT,I6GpiBmB,CACnBv6E,KAAM,MACNgmB,SAAU,SACVm+D,OAAQ,CAAC,YAAa,SACtBuJ,YAAa,6LACbC,SAAU,CAAC,4BAA6B,yBACxCC,QAAS,CAAC,WAAY,U7G+hBtBqF,kB8GriBiC,CACjCjzF,KAAM,oBACNgmB,SAAU,SACVm+D,OAAQ,CAAC,wBACTuJ,YAAa,iOACbC,SAAU,CAAC,+BAAgC,wCAAyC,iCAAkC,wCACtHC,QAAS,CAAC,SAAU,SAAU,W9GgiB9B3sB,S+GtiBwB,CACxBjhE,KAAM,WACNgmB,SAAU,SACVm+D,OAAQ,CAAC,cAAe,iBAAkB,oBAC1CuJ,YAAa,yGACbC,SAAU,CAAC,cAAe,iBAAkB,yBAA0B,qBACtEC,QAAS,CAAC,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U/GiiB9GpgF,OgHviBsB,CACtBxN,KAAM,SACNgmB,SAAU,SACVm+D,OAAQ,CAAC,mBACTuJ,YAAa,4BACbC,SAAU,CAAC,wBAAyB,wCAAyC,oCAC7EC,QAAS,CAAC,OAAQ,MAAO,YhHkiBzB/iD,QiHxiBuB,CACvB7qC,KAAM,UACNgmB,SAAU,SACVm+D,OAAQ,CAAC,cACTuJ,YAAa,uEACbC,SAAU,CAAC,yBAA0B,UAAW,iBAAkB,WAClEC,QAAS,CAAC,SAAU,SAAU,OAAQ,YjHmiBtC5rF,QkHziBuB,CACvBhC,KAAM,UACNgmB,SAAU,SACVm+D,OAAQ,CAAC,wBACTuJ,YAAa,0FACbC,SAAU,CAAC,0DACXC,QAAS,CAAC,MAAO,OAAQ,WlHoiBzBnT,ImH1iBmB,CACnBz6E,KAAM,MACNgmB,SAAU,SACVm+D,OAAQ,CAAC,UACTuJ,YAAa,oCACbC,SAAU,CAAC,oBAAqB,SAAU,SAC1CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UnHqiBnHsF,KoH3iBoB,CACpBlzF,KAAM,OACNgmB,SAAU,SACVm+D,OAAQ,CAAC,WACTuJ,YAAa,wEACbC,SAAU,CAAC,8BACXC,QAAS,CAAC,QpHsiBVuF,KqH5iBoB,CACpBnzF,KAAM,OACNgmB,SAAU,SACVm+D,OAAQ,CAAC,cACTuJ,YAAa,6DACbC,SAAU,CAAC,2CAA4C,wBACvDC,QAAS,CAAC,WAAY,MAAO,UrHuiB7B52E,IsH7iBmB,CACnBhX,KAAM,MACNgmB,SAAU,SACVm+D,OAAQ,CAAC,oBACTuJ,YAAa,qHACbC,SAAU,CAAC,0BACXC,QAAS,CAAC,SAAU,YtHwiBpBwF,KuH9iBoB,CACpBpzF,KAAM,OACNgmB,SAAU,SACVm+D,OAAQ,CAAC,UAAW,aAAc,qBAAsB,YAAa,eAAgB,wBACrFuJ,YAAa,mCACbC,SAAU,CAAC,UAAW,aAAc,oBAAqB,yBAA0B,iBACnFC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UvHyiBlHyF,gBwH/iB+B,CAC/BrzF,KAAM,kBACNgmB,SAAU,SACVm+D,OAAQ,CAAC,wBAAyB,kCAClCuJ,YAAa,uIACbC,SAAU,CAAC,iCAAkC,4CAC7CC,QAAS,CAAC,SxH0iBV/6D,MyHhjBqB,CACrB7yB,KAAM,QACNgmB,SAAU,OACVm+D,OAAQ,CAAC,YAAa,iBAAkB,oBAAqB,0BAA2B,iBACxFuJ,YAAa,iFACbC,SAAU,CAAC,MAAO,UAAW,cAAe,kBAAmB,gBAAiB,+BAAgC,eAChHC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,OAAQ,UAAW,SAAU,QAAS,YAAa,UzH2iBjH0F,O0HjjBsB,CACtBtzF,KAAM,SACNgmB,SAAU,SACVm+D,OAAQ,CAAC,kBAAmB,iCAC5BuJ,YAAa,mBACbC,SAAU,CAAC,2BAA4B,uBAAwB,2BAA4B,oBAAqB,6BAChHC,QAAS,CAAC,OAAQ,SAAU,UAAW,Y1H4iBvC2F,Q2HljBuB,CACvBvzF,KAAM,UACNgmB,SAAU,SACVm+D,OAAQ,CAAC,qBACTuJ,YAAa,qEACbC,SAAU,CAAC,sCAAuC,oCAAqC,kCACvFC,QAAS,CAAC,OAAQ,UAAW,W3H6iB7BjiF,O4HnjBsB,CACtB3L,KAAM,SACNgmB,SAAU,SACVm+D,OAAQ,CAAC,mBAAoB,uBAC7BuJ,YAAa,2JACbC,SAAU,CAAC,8BAA+B,wCAAyC,8CAA+C,+DAClIC,QAAS,CAAC,SAAU,mB5H8iBpB4F,e6HpjB8B,CAC9BxzF,KAAM,iBACNgmB,SAAU,SACVm+D,OAAQ,CAAC,wBAAyB,2BAA4B,oCAC9DuJ,YAAa,2JACbC,SAAU,CAAC,yBAA0B,2CAA4C,kDACjFC,QAAS,CAAC,MAAO,Q7H+iBjB5B,I8HrjBmB,CACnBhsF,KAAM,MACNgmB,SAAU,SACVm+D,OAAQ,CAAC,iBACTuJ,YAAa,uCACbC,SAAU,CAAC,uBAAwB,YAAa,aAChDC,QAAS,CAAC,W9HgjBV7rE,K+HtjBoB,CACpB/hB,KAAM,OACNgmB,SAAU,SACVm+D,OAAQ,CAAC,WACTuJ,YAAa,kCACbC,SAAU,CAAC,YAAa,sBAAuB,yBAA0B,UAAW,aACpFC,QAAS,CAAC,SAAU,QAAS,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,UAAW,SAAU,QAAS,YAAa,U/HijB3Ht4C,KgIvjBoB,CACpBt1C,KAAM,OACNgmB,SAAU,SACVm+D,OAAQ,CAAC,UAAW,oBACpBuJ,YAAa,2GACbC,SAAU,CAAC,mBAAoB,6BAA8B,+CAAgD,iDAAkD,qCAC/JC,QAAS,CAAC,MAAO,SAAU,YhIkjB3B6F,QiIxjBuB,CACvBzzF,KAAM,UACNgmB,SAAU,SACVm+D,OAAQ,CAAC,cACTuJ,YAAa,6DACbC,SAAU,CAAC,mBAAoB,mBAAoB,mBAAoB,oBACvEC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,SAAU,QAAS,YAAa,UjImjB/Gl9D,OkIzjBsB,CACtB1wB,KAAM,SACNgmB,SAAU,SACVm+D,OAAQ,CAAC,eAAgB,6BAA8B,yBAA0B,uCACjFuJ,YAAa,8HACbC,SAAU,CAAC,mBAAoB,SAAU,qBAAsB,mBAAoB,YAAa,UAAW,WAC3GC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,QAAS,YAAa,UlIojBhHjT,MmI1jBqB,CACrB36E,KAAM,QACNgmB,SAAU,SACVm+D,OAAQ,CAAC,YACTuJ,YAAa,oGACbC,SAAU,CAAC,mCAAoC,YAC/CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,YAAa,UnIqjBjH/V,UoI3jByB,CACzB73E,KAAM,YACNgmB,SAAU,SACVm+D,OAAQ,CAAC,KAAO,gBAChBuJ,YAAa,qBACbC,SAAU,CAAC,yBAA0B,KAAO,gBAC5CC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,UpIsjB7G8F,MqI5jBqB,CACrB1zF,KAAM,QACNgmB,SAAU,SACVm+D,OAAQ,CAAC,WAAY,cAAe,sBAAuB,aAAc,gBAAiB,yBAC1FuJ,YAAa,oCACbC,SAAU,CAAC,WAAY,cAAe,yBAA0B,kBAChEC,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,crIwjB7GhT,asI9jB4B,CAC5B56E,KAAM,eACNgmB,SAAU,cACVm+D,OAAQ,CAAC,sBACTuJ,YAAa,kEACbC,SAAU,CAAC,sBACXC,QAAS,CAAC,sBAAuB,eAAgB,ctIyjBjD/S,oBuI/jBmC,CACnC76E,KAAM,sBACNgmB,SAAU,cACVm+D,OAAQ,CAAC,6BACTuJ,YAAa,qFACbC,SAAU,CAAC,6BACXC,QAAS,CAAC,eAAgB,eAAgB,cvI2jB1C7V,UwIjkByB,CACzB/3E,KAAM,YACNgmB,SAAU,cACVm+D,OAAQ,CAAC,KAAM,gBACfuJ,YAAa,mCACbC,SAAU,CAAC,KAAM,oBAAqB,MACtCC,QAAS,CAAC,eAAgB,sBAAuB,eAAgB,UxI4jBjElZ,MyIlkBqB,CACrB10E,KAAM,QACNgmB,SAAU,cACVm+D,OAAQ,CAAC,YACTuJ,YAAa,6IACbC,SAAU,CAAC,WAAY,KAAM,aAAc,YAC3CC,QAAS,CAAC,czI6jBV+F,a0InkB4B,CAC5B3zF,KAAM,eACNgmB,SAAU,cACVm+D,OAAQ,CAAC,sBACTuJ,YAAa,6EACbC,SAAU,CAAC,8CACXC,QAAS,I1I8jBTgG,Y2IpkB2B,CAC3B5zF,KAAM,cACNgmB,SAAU,cACVm+D,OAAQ,CAAC,kBACTuJ,YAAa,4OACbC,SAAU,CAAC,0BACXC,QAAS,CAAC,eAAgB,c3I+jB1BiG,a4IrkB4B,CAC5B7zF,KAAM,eACNgmB,SAAU,cACVm+D,OAAQ,CAAC,kBAAmB,sBAC5BuJ,YAAa,kEACbC,SAAU,CAAC,kBAAmB,sBAC9BC,QAAS,CAAC,eAAgB,sBAAuB,c5IgkBjDkG,W6ItkB0B,CAC1B9zF,KAAM,aACNgmB,SAAU,cACVm+D,OAAQ,CAAC,oBAAqB,4BAA6B,6BAA8B,qCAAsC,sCAC/HuJ,YAAa,0CACbC,SAAU,CAAC,mBAAoB,2BAA4B,8BAA+B,yCAA0C,4CAA6C,6CACjLC,QAAS,CAAC,SAAU,c7IikBpBhhC,O8IvkBsB,CACtB5sD,KAAM,SACNgmB,SAAU,cACVm+D,OAAQ,CAAC,WAAY,cAAe,mBAAoB,eAAgB,oBAAqB,0BAC7FuJ,YAAa,0BACbC,SAAU,CAAC,WAAY,iBAAkB,kBACzCC,QAAS,CAAC,aAAc,c9IkkBxBmG,U+IxkByB,CACzB/zF,KAAM,YACNgmB,SAAU,cACVm+D,OAAQ,CAAC,iBAAkB,sBAAuB,kBAAmB,uBAAwB,6BAC7FuJ,YAAa,iCACbC,SAAU,CAAC,oBAAqB,yBAChCC,QAAS,CAAC,aAAc,W/IokBxBjkC,QgJ1kBuB,CACvB3pD,KAAM,UACNgmB,SAAU,aACVm+D,OAAQ,CAAC,iBACTuJ,YAAa,8EACbC,SAAU,CAAC,gBAAiB,gBAAiB,gBAAiB,qBAAsB,yBACpFC,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,iBAAkB,gBhJqkBpFoG,eiJ3kB8B,CAC9Bh0F,KAAM,iBACNgmB,SAAU,aACVm+D,OAAQ,CAAC,wBACTuJ,YAAa,0HACbC,SAAU,CAAC,uBAAwB,uBAAwB,uBAAwB,4BAA6B,4BAA6B,iCAAkC,uCAAwC,oCAAqC,iCAAkC,kCAC9RC,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,UAAW,gBjJskB7EqG,YkJ5kB2B,CAC3Bj0F,KAAM,cACNgmB,SAAU,aACVm+D,OAAQ,CAAC,qBACTuJ,YAAa,uHACbC,SAAU,CAAC,wBAAyB,wBAAyB,wBAAyB,yBAA0B,qBAAsB,iBAAkB,4BAA6B,qCACrLC,QAAS,CAAC,UAAW,mBlJukBrBsG,UmJ7kByB,CACzBl0F,KAAM,YACNgmB,SAAU,aACVm+D,OAAQ,CAAC,mBACTuJ,YAAa,+IACbC,SAAU,CAAC,8BAA+B,6BAC1CC,QAAS,CAAC,QAAS,UAAW,UAAW,SAAU,YAAa,WAAY,YnJwkB5EjV,MoJ9kBqB,CACrB34E,KAAM,QACNgmB,SAAU,aACVm+D,OAAQ,CAAC,SAAU,eACnBuJ,YAAa,wFACbC,SAAU,CAAC,WAAY,WAAY,UAAW,YAAa,SAAU,gBACrEC,QAAS,CAAC,UAAW,UAAW,SAAU,YAAa,WAAY,UAAW,YAAa,cpJykB3FuG,UqJ/kByB,CACzBn0F,KAAM,YACNgmB,SAAU,aACVm+D,OAAQ,CAAC,mBACTuJ,YAAa,uHACbC,SAAU,CAAC,8BAA+B,sBAAuB,uBAAwB,2BAA4B,mCACrHC,QAAS,CAAC,UAAW,iBAAkB,cAAe,UrJ0kBtD9U,OsJhlBsB,CACtB94E,KAAM,SACNgmB,SAAU,aACVm+D,OAAQ,CAAC,QAAS,gBAClBuJ,YAAa,2FACbC,SAAU,CAAC,QAAS,UAAW,UAAW,YAAa,UAAW,UAAW,iBAC7EC,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,YtJ2kBlE5U,SuJjlBwB,CACxBh5E,KAAM,WACNgmB,SAAU,aACVm+D,OAAQ,CAAC,SAAU,kBACnBuJ,YAAa,yGACbC,SAAU,CAAC,WAAY,UAAW,UAAW,YAAa,YAC1DC,QAAS,CAAC,QAAS,UAAW,YAAa,UAAW,YvJ4kBtD/U,QwJllBuB,CACvB74E,KAAM,UACNgmB,SAAU,aACVm+D,OAAQ,CAAC,QAAS,iBAClBuJ,YAAa,mGACbC,SAAU,CAAC,QAAS,UAAW,UAAW,YAAa,UAAW,iBAClEC,QAAS,CAAC,QAAS,UAAW,SAAU,YAAa,WAAY,YxJ6kBjE7U,UyJnlByB,CACzB/4E,KAAM,YACNgmB,SAAU,aACVm+D,OAAQ,CAAC,SAAU,mBACnBuJ,YAAa,0GACbC,SAAU,CAAC,WAAY,UAAW,UAAW,YAAa,YAC1DC,QAAS,CAAC,QAAS,UAAW,SAAU,UAAW,WAAY,YzJ8kB/DhV,Q0JplBuB,CACvB54E,KAAM,UACNgmB,SAAU,aACVm+D,OAAQ,CAAC,SAAU,iBACnBuJ,YAAa,uGACbC,SAAU,CAAC,WAAY,WAAY,UAAW,YAAa,SAAU,eAAgB,kBACrFC,QAAS,CAAC,QAAS,UAAW,SAAU,YAAa,WAAY,UAAW,c1JglB5EwG,a2JtlB4B,CAC5Bp0F,KAAM,eACNgmB,SAAU,MACVm+D,OAAQ,CAAC,4BACTuJ,YAAa,6IACbC,SAAU,CAAC,gCACXC,QAAS,CAAC,WAAY,eAAgB,gBAAiB,gB3JilBvDyG,c4JvlB6B,CAC7Br0F,KAAM,gBACNgmB,SAAU,MACVm+D,OAAQ,CAAC,6BACTuJ,YAAa,8LACbC,SAAU,CAAC,4CAA6C,qDACxDC,QAAS,CAAC,WAAY,eAAgB,qB5JklBtC0G,Y6JxlB2B,CAC3Bt0F,KAAM,cACNgmB,SAAU,MACVm+D,OAAQ,CAAC,oBACTuJ,YAAa,2IACbC,SAAU,CAAC,mCACXC,QAAS,CAAC,oB7JmlBV2G,a8JzlB4B,CAC5Bv0F,KAAM,eACNgmB,SAAU,MACVm+D,OAAQ,CAAC,4BACTuJ,YAAa,wIACbC,SAAU,CAAC,2CAA4C,oDACvDC,QAAS,CAAC,WAAY,kB9JolBtB4G,Y+J1lB2B,CAC3Bx0F,KAAM,cACNgmB,SAAU,MACVm+D,OAAQ,CAAC,2BACTuJ,YAAa,wMACbC,SAAU,CAAC,oCAAqC,qCAChDC,QAAS,CAAC,WAAY,eAAgB,kB/JqlBtC6G,gBgK3lB+B,CAC/Bz0F,KAAM,kBACNgmB,SAAU,MACVm+D,OAAQ,CAAC,iCACTuJ,YAAa,kJACbC,SAAU,CAAC,mCAAoC,oCAC/CC,QAAS,CAAC,cAAe,YhKslBzB8G,YiK5lB2B,CAC3B10F,KAAM,cACNgmB,SAAU,MACVm+D,OAAQ,CAAC,oBACTuJ,YAAa,gMACbC,SAAU,CAAC,0BACXC,QAAS,CAAC,iBjKulBV+G,QkK7lBuB,CACvB30F,KAAM,UACNgmB,SAAU,MACVm+D,OAAQ,CAAC,eAAgB,wBACzBuJ,YAAa,sNACbC,SAAU,CAAC,wBAAyB,+BACpCC,QAAS,CAAC,WAAY,eAAgB,kBlKwlBtCgH,iBmK9lBgC,CAChC50F,KAAM,mBACNgmB,SAAU,MACVm+D,OAAQ,CAAC,gCACTuJ,YAAa,gJACbC,SAAU,CAAC,+CAAgD,wDAC3DC,QAAS,CAAC,WAAY,eAAgB,kBnKylBtCiH,SoK/lBwB,CACxB70F,KAAM,WACNgmB,SAAU,MACVm+D,OAAQ,CAAC,wBACTuJ,YAAa,iIACbC,SAAU,CAAC,uCAAwC,gDACnDC,QAAS,CAAC,eAAgB,kBpK2lB1B9S,IqKjmBmB,CACnB96E,KAAM,MACNgmB,SAAU,UACVm+D,OAAQ,CAAC,UACTuJ,YAAa,6GACbC,SAAU,CAAC,WAAY,YAAa,UACpCC,QAAS,IrK6lBTkH,IsKnmBmB,CACnB90F,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,oBAAqB,UAC9BuJ,YAAa,8KACbC,SAAU,CAAC,kBAAmB,kBAC9BC,QAAS,CAAC,OAAQ,SAAU,MAAO,QtK8lBnC7kE,IuKpmBmB,CACnB/oB,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,oBAAqB,SAAU,eACxCuJ,YAAa,iDACbC,SAAU,CAAC,kBAAmB,oBAAqB,oBAAqB,uBAAwB,uBAAwB,gCAAiC,iCACzJC,QAAS,CAAC,OAAQ,SAAU,MAAO,OAAQ,MAAO,MAAO,avK+lBzD3qF,KwKrmBoB,CACpBjD,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,qBAAsB,UAAW,gBAC1CuJ,YAAa,mDACbC,SAAU,CAAC,mBAAoB,qBAAsB,qBAAsB,wBAAyB,wBAAyB,8BAC7HC,QAAS,CAAC,MAAO,SAAU,MAAO,OAAQ,MAAO,MAAO,axKgmBxD1qF,OyKtmBsB,CACtBlD,KAAM,SACNgmB,SAAU,aACVm+D,OAAQ,CAAC,uBAAwB,aACjCuJ,YAAa,mLACbC,SAAU,CAAC,kBAAmB,yBAC9BC,QAAS,CAAC,MAAO,OAAQ,MAAO,OAAQ,MAAO,MAAO,WAAY,gBzKimBlE/kE,I0KvmBmB,CACnB7oB,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,oBAAqB,SAAU,eACxCuJ,YAAa,iDACbC,SAAU,CAAC,kBAAmB,oBAAqB,oBAAqB,uBAAwB,uBAAwB,gCAAiC,iCACzJC,QAAS,CAAC,MAAO,OAAQ,SAAU,OAAQ,MAAO,MAAO,a1KkmBzDmH,K2KxmBoB,CACpB/0F,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,qBAAsB,UAAW,4BAC1CuJ,YAAa,2HACbC,SAAU,CAAC,sBAAuB,8BAA+B,uBACjEC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,OAAQ,MAAO,MAAO,a3KmmBhE3jC,K4KzmBoB,CACpBjqD,KAAM,OACNgmB,SAAU,aACVm+D,OAAQ,CAAC,qBAAsB,WAC/BuJ,YAAa,qCACbC,SAAU,CAAC,gBAAiB,kBAAmB,sBAC/CC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,MAAO,MAAO,MAAO,a5KomB/DoH,Y6K1mB2B,CAC3Bh1F,KAAM,cACNgmB,SAAU,aACVm+D,OAAQ,CAAC,iCAAkC,gDAAiD,+BAC5FuJ,YAAa,sWACbC,SAAU,CAAC,kCAAmC,yCAA0C,gCAAiC,yCACzHC,QAAS,CAAC,OAAQ,SAAU,MAAO,MAAO,OAAQ,MAAO,MAAO,a7KqmBhEqH,I8K3mBmB,CACnBj1F,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,oBAAqB,SAAU,yBACxCuJ,YAAa,iLACbC,SAAU,CAAC,eAAgB,oBAAqB,mCAAoC,8BAA+B,2BACnHC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,OAAQ,MAAO,a9KsmBzDt7C,I+K5mBmB,CACnBtyC,KAAM,MACNgmB,SAAU,aACVm+D,OAAQ,CAAC,oBAAqB,UAC9BuJ,YAAa,iCACbC,SAAU,CAAC,kBAAmB,oBAAqB,qBACnDC,QAAS,CAAC,MAAO,OAAQ,SAAU,MAAO,OAAQ,MAAO,MAAO,a/KumBhE7S,SgL7mBwB,CACxB/6E,KAAM,WACNgmB,SAAU,aACVm+D,OAAQ,CAAC,yBAA0B,cAAe,8BAClDuJ,YAAa,gIACbC,SAAU,CAAC,oBAAqB,yBAA0B,wCAAyC,mCAAoC,gCACvIC,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,MAAO,OAAQ,MAAO,QhLymBhE5oD,KiL/mBoB,CACpBhlC,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,oDACbC,SAAU,CAAC,YAAa,kBACxBC,QAAS,CAAC,MAAO,OAAQ,SjL0mBzBpoD,MkLhnBqB,CACrBxlC,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,YACTuJ,YAAa,6FACbC,SAAU,CAAC,cACXC,QAAS,CAAC,OAAQ,QAAS,UlL2mB3B5S,KmLjnBoB,CACpBh7E,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,8CACbC,SAAU,CAAC,YAAa,iBAAkB,WAC1CC,QAAS,CAAC,MAAO,SnL4mBjB3S,MoLlnBqB,CACrBj7E,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,YACTuJ,YAAa,6GACbC,SAAU,CAAC,WAAY,cACvBC,QAAS,CAAC,QAAS,UpL6mBnB1S,KqLnnBoB,CACpBl7E,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,8CACbC,SAAU,CAAC,UAAW,iBAAkB,aACxCC,QAAS,CAAC,MAAO,OAAQ,SrL8mBzBzS,MsLpnBqB,CACrBn7E,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,YACTuJ,YAAa,sGACbC,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,UtL+mBnBxS,KuLrnBoB,CACpBp7E,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,2CACbC,SAAU,CAAC,YAAa,iBAAkB,WAC1CC,QAAS,CAAC,OAAQ,OAAQ,SvLgnB1BvS,MwLtnBqB,CACrBr7E,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,YACTuJ,YAAa,2CACbC,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,UxLinBnB3oD,KyLvnBoB,CACpBjlC,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,kDACbC,SAAU,CAAC,YAAa,kBACxBC,QAAS,CAAC,MAAO,OAAQ,SzLknBzBroD,M0LxnBqB,CACrBvlC,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,YACTuJ,YAAa,8FACbC,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,U1LmnBnB7oD,K2LznBoB,CACpB/kC,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,qDACbC,SAAU,CAAC,YAAa,kBACxBC,QAAS,CAAC,MAAO,OAAQ,S3LonBzBtoD,M4L1nBqB,CACrBtlC,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,YACTuJ,YAAa,mGACbC,SAAU,CAAC,cACXC,QAAS,CAAC,QAAS,U5LqnBnB9iF,M6L3nBqB,CACrB9K,KAAM,QACNgmB,SAAU,eACVm+D,OAAQ,CAAC,eACTuJ,YAAa,qEACbC,SAAU,CAAC,mBAAoB,wBAAyB,iBAAkB,iBAAkB,eAC5FC,QAAS,CAAC,MAAO,MAAO,Q7LsnBxBjqD,I8L5nBmB,CACnB3jC,KAAM,MACNgmB,SAAU,eACVm+D,OAAQ,CAAC,UACTuJ,YAAa,sCACbC,SAAU,CAAC,SAAU,kBAAmB,eAAgB,cAAe,2BACvEC,QAAS,CAAC,OAAQ,MAAO,Q9LunBzB1qD,K+L7nBoB,CACpBljC,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,iDACbC,SAAU,CAAC,aACXC,QAAS,CAAC,OAAQ,OAAQ,S/LwnB1BtS,IgM9nBmB,CACnBt7E,KAAM,MACNgmB,SAAU,eACVm+D,OAAQ,CAAC,UACTuJ,YAAa,6DACbC,SAAU,CAAC,SAAU,cACrBC,QAAS,CAAC,MAAO,MAAO,QhMynBxBrS,KiM/nBoB,CACpBv7E,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,oDACbC,SAAU,CAAC,UAAW,eACtBC,QAAS,CAAC,OAAQ,OAAQ,SjM0nB1BpS,IkMhoBmB,CACnBx7E,KAAM,MACNgmB,SAAU,eACVm+D,OAAQ,CAAC,UACTuJ,YAAa,4DACbC,SAAU,CAAC,SAAU,cACrBC,QAAS,CAAC,MAAO,MAAO,QlM2nBxBnS,KmMjoBoB,CACpBz7E,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,wEACbC,SAAU,CAAC,UAAW,eACtBC,QAAS,CAAC,OAAQ,OAAQ,SnM4nB1BlS,IoMloBmB,CACnB17E,KAAM,MACNgmB,SAAU,eACVm+D,OAAQ,CAAC,UACTuJ,YAAa,0DACbC,SAAU,CAAC,SAAU,cACrBC,QAAS,CAAC,MAAO,MAAO,QpM6nBxBjS,KqMnoBoB,CACpB37E,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,sEACbC,SAAU,CAAC,UAAW,eACtBC,QAAS,CAAC,OAAQ,OAAQ,SrM8nB1B9pD,IsMpoBmB,CACnB9jC,KAAM,MACNgmB,SAAU,eACVm+D,OAAQ,CAAC,UACTuJ,YAAa,oCACbC,SAAU,CAAC,SAAU,kBAAmB,cAAe,cAAe,2BACtEC,QAAS,CAAC,OAAQ,MAAO,QtM+nBzBxqD,KuMroBoB,CACpBpjC,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,+CACbC,SAAU,CAAC,aACXC,QAAS,CAAC,OAAQ,SvMgoBlB9lC,IwMtoBmB,CACnB9nD,KAAM,MACNgmB,SAAU,eACVm+D,OAAQ,CAAC,UACTuJ,YAAa,uCACbC,SAAU,CAAC,WAAY,sBAAuB,cAAe,eAC7DC,QAAS,CAAC,OAAQ,MAAO,QxMioBzBzoC,KyMvoBoB,CACpBnlD,KAAM,OACNgmB,SAAU,eACVm+D,OAAQ,CAAC,WACTuJ,YAAa,kDACbC,SAAU,CAAC,YAAa,yBACxBC,QAAS,CAAC,OAAQ,SzMmoBlBrV,G0MzoBkB,CAClBv4E,KAAM,KACNgmB,SAAU,QACVm+D,OAAQ,CAAC,YAAa,eACtBuJ,YAAa,8BACbC,SAAU,CAAC,eAAgB,aAAc,oBACzCC,QAAS,I1MqoBT9gC,M2M3oBqB,CACrB9sD,KAAM,QACNgmB,SAAU,QACVm+D,OAAQ,CAAC,YACTuJ,YAAa,sFACbC,SAAU,CAAC,aAAc,gBAAiB,gBAAiB,sBAAuB,wBAClFC,QAAS,I3MsoBTsH,O4M5oBsB,CACtBl1F,KAAM,SACNgmB,SAAU,QACVm+D,OAAQ,CAAC,gBAAiB,4BAC1BuJ,YAAa,wCACbC,SAAU,CAAC,cAAe,iBAAkB,aAAc,iBAC1DC,QAAS,CAAC,U5MuoBVuH,I6M7oBmB,CACnBn1F,KAAM,MACNgmB,SAAU,QACVm+D,OAAQ,CAAC,cACTuJ,YAAa,4BACbC,SAAU,CAAC,UACXC,QAAS,CAAC,MAAO,Q7MwoBjBwH,I8M9oBmB,CACnBp1F,KAAM,MACNgmB,SAAU,QACVm+D,OAAQ,CAAC,cACTuJ,YAAa,2BACbC,SAAU,CAAC,WACXC,QAAS,CAAC,MAAO,Q9MyoBjByH,I+M/oBmB,CACnBr1F,KAAM,MACNgmB,SAAU,QACVm+D,OAAQ,CAAC,cACTuJ,YAAa,iCACbC,SAAU,CAAC,YACXC,QAAS,CAAC,MAAO,Q/M0oBjBzmF,MgNhpBqB,CACrBnH,KAAM,QACNgmB,SAAU,QACVm+D,OAAQ,CAAC,YACTuJ,YAAa,6CACbC,SAAU,CAAC,WAAY,eAAgB,aAAc,mBACrDC,QAAS,CAAC,aAAc,YAAa,aAAc,WhN2oBnD94E,UiNjpByB,CACzB9U,KAAM,YACNgmB,SAAU,QACVm+D,OAAQ,CAAC,gBACTuJ,YAAa,6CACbC,SAAU,CAAC,eAAgB,iBAAkB,2BAC7CC,QAAS,CAAC,aAAc,YAAa,aAAc,WjN4oBnDznC,WkNlpB0B,CAC1BnmD,KAAM,aACNgmB,SAAU,QACVm+D,OAAQ,CAAC,iBACTuJ,YAAa,uDACbC,SAAU,CAAC,gBAAiB,gBAAiB,iBAAkB,4BAC/DC,QAAS,CAAC,YAAa,YAAa,aAAc,WlN6oBlD0H,UmNnpByB,CACzBt1F,KAAM,YACNgmB,SAAU,QACVm+D,OAAQ,CAAC,gBACTuJ,YAAa,qHACbC,SAAU,CAAC,eAAgB,iBAAkB,uBAAwB,eAAgB,4BAA6B,6BAA8B,oBAAqB,kCACrKC,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,oBnN8oBtE2H,gBoNppB+B,CAC/Bv1F,KAAM,kBACNgmB,SAAU,QACVm+D,OAAQ,CAAC,sBACTuJ,YAAa,0HACbC,SAAU,CAAC,qBAAsB,uBAAwB,iBAAkB,qBAAsB,kCAAmC,mCAAoC,0BAA2B,wCACnMC,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,cpN+oBtExnC,WqNrpB0B,CAC1BpmD,KAAM,aACNgmB,SAAU,QACVm+D,OAAQ,CAAC,iBACTuJ,YAAa,sDACbC,SAAU,CAAC,gBAAiB,gBAAiB,iBAAkB,4BAC/DC,QAAS,CAAC,YAAa,YAAa,aAAc,WrNgpBlD4H,QsNtpBuB,CACvBx1F,KAAM,UACNgmB,SAAU,QACVm+D,OAAQ,CAAC,cACTuJ,YAAa,4EACbC,SAAU,CAAC,aAAc,cAAe,yBACxCC,QAAS,CAAC,YAAa,YAAa,aAAc,WtNipBlDlqC,OuNvpBsB,CACtB1jD,KAAM,SACNgmB,SAAU,QACVm+D,OAAQ,CAAC,aACTuJ,YAAa,gCACbC,SAAU,CAAC,YAAa,YAAa,aAAc,yBACnDC,QAAS,CAAC,YAAa,YAAa,aAAc,evNmpBlD6H,OwNzpBsB,CACtBz1F,KAAM,SACNgmB,SAAU,QACVm+D,OAAQ,CAAC,aACTuJ,YAAa,8BACbC,SAAU,CAAC,cAAe,iBAAkB,iBAAkB,yBAC9DC,QAAS,CAAC,sBxNopBVhS,QyN1pBuB,CACvB57E,KAAM,UACNgmB,SAAU,QACVm+D,OAAQ,CAAC,cACTuJ,YAAa,sFACbC,SAAU,CAAC,eAAgB,yBAA0B,4BAA6B,0BAA2B,yBAA0B,oCACvIC,QAAS,CAAC,SAAU,WAAY,YAAa,SAAU,YCFrD,GAAO,OACP,GAAe,CAAC,QAAS,oBAAqB,QACvC8H,IAA4B,EAAAnkB,EAAA,IAAQ,GAAM,IAAe1jB,IAClE,IAAI,MACF+1B,EAAK,kBACLpS,EAAiB,KACjB+b,GACE1/B,EAoBJ,OAAO+1B,EAAM,GAAM,CACjBW,IAAK,SAAa34B,GAChB,IAAI1sB,EACAy2D,EAAa/pC,EAEjB,GAAsB,iBAAXA,EACT,IAAK1sB,KAAQsyC,EAEX,IAAI,QAAeA,EAAmBtyC,IAAS0sB,IAAW4lB,EAAkBtyC,GAAO,CACjFy2D,EAAaz2D,EACb,MAmBN,IAAIsuD,GAAM,QAAgBY,GAAcuH,GAExC,IAAKnI,EAAK,CACR,IAAIoI,EAAmC,mBAAfD,EAA4BA,EAAW31F,KAAO21F,EACtE,MAAM,IAAIn0D,MAAM,8BAAgCo0D,EAAa,KAG/D,OAAO,IAAIrI,EAAKC,SCjElB,GAAO,UACP,GAAe,CAAC,QAAS,SAClBqI,IAA+B,EAAAtkB,EAAA,IAAQ,GAAM,IAAe1jB,IACrE,IAAI,MACF+1B,EAAK,MACLnvE,GACEo5C,EAoCJ,OAAO+1B,EAAM,GAAM,CACjB9f,OAAQ,SAAgB+N,GACtB,OAAOp9D,EAAMo9D,GAAMH,WAErB,iBAAkB,SAAqBG,GACrC,OAAO,SAAQA,GAAM,SAAU1/C,GAC7B,OAAO1d,EAAM0d,GAAOu/C,mBC9CxB,GAAe,CAAC,eAAgB,eAAgB,cACzCokB,IAA4B,EAAAvkB,EAAA,IAF5B,eAE0C,IAAe1jB,IAClE,IAAI,aACFq5B,EAAY,aACZnG,EAAY,WACZ+F,GACEj5B,EAKAkoC,EAAc,CAChBp7E,KAAK,EACL3N,UAAU,GAERgpF,EAAc,CAChBr7E,KAAK,EACL3N,UAAU,GAiBZ,SAASipF,EAAc9zF,EAAMsxE,GAC3B,KAAK,EAAAtB,EAAA,IAAehwE,GAClB,OAAO,EAGT,IAAInC,EAAOmC,EAAK+8C,GAAGn/C,WAEnB,OAAI0zE,IAAW,QAAeA,EAASzzE,KAAS,QAAeyzE,EAAQzzE,GAAO,eACrEyzE,EAAQzzE,GAAMg2F,YAGhBA,EAAYh2F,KAAS,EAyB9B,SAASk2F,EAAY/zF,GACnB,IAAI6+E,EACA7+C,EAAW,GAcf,OAAI8zD,EAAc9zF,IAChB6+E,EAAK7+E,EAAK6+E,GAbO,SAASmV,EAAah0F,GACvC,IAAK,IAAIpH,EAAI,EAAGA,EAAIoH,EAAKu6B,KAAK5hC,OAAQC,IAAK,CACzC,IAAI41C,EAAQxuC,EAAKu6B,KAAK3hC,IAElB,EAAAo3E,EAAA,IAAexhC,IAAUqwC,IAAOrwC,EAAMqwC,GACxCmV,EAAaxlD,GAEbxO,EAAStjC,KAAK8xC,IAOlBwlD,CAAah0F,GACNggC,GAEAhgC,EAAKu6B,KA0DhB,SAAS05D,EAAuBj0F,GAC9B,OAAI,EAAAgwE,EAAA,IAAehwE,GACV,SAAUu6B,GACf,IACE,OAAO,IAAIqkD,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAIxiB,EAAMv6B,EAAK8+E,UACrD,MAAOniF,GAEP,OADAsN,QAAQ4I,MAAMlW,GACP,KAIJ,SAAU49B,GACf,OAAO,IAAIwqD,EAAa,IAAIJ,EAAW3kF,EAAKnC,MAAO08B,IAKzD,MAAO,CACL05D,yBACAC,cApJF,SAAuBl0F,EAAMsxE,GAC3B,KAAK,EAAAtB,EAAA,IAAehwE,GAClB,OAAO,EAGT,IAAInC,EAAOmC,EAAK+8C,GAAGn/C,WAEnB,OAAI0zE,IAAW,QAAeA,EAASzzE,KAAS,QAAeyzE,EAAQzzE,GAAO,eACrEyzE,EAAQzzE,GAAM+1F,YAGhBA,EAAY/1F,KAAS,GA0I5Bi2F,gBACAprD,QArHF,SAASA,EAAQ1oC,GACf,IAAKA,EAAKu6B,MAA6B,IAArBv6B,EAAKu6B,KAAK5hC,OAC1B,OAAOqH,EAGTA,EAAKu6B,KAAOw5D,EAAY/zF,GAExB,IAAK,IAAIpH,EAAI,EAAGA,EAAIoH,EAAKu6B,KAAK5hC,OAAQC,IACpC8vC,EAAQ1oC,EAAKu6B,KAAK3hC,KA8GpBm7F,cACAI,WAzEF,SAASA,EAAWn0F,GAClB,GAAKA,EAAKu6B,MAA6B,IAArBv6B,EAAKu6B,KAAK5hC,OAA5B,CAOA,IAHA,IAAIy7F,EAAWH,EAAuBj0F,GAClC+rC,EAAI/rC,EAAKu6B,KAAK5hC,OAETC,EAAI,EAAGA,EAAImzC,EAAGnzC,IACrBu7F,EAAWn0F,EAAKu6B,KAAK3hC,IAGvB,GAAImzC,EAAI,GAAK+nD,EAAc9zF,GAAO,CAGhC,IAFA,IAAIq0F,EAAUr0F,EAAKu6B,KAAKznB,MAEjB9S,EAAKu6B,KAAK5hC,OAAS,GACxB07F,EAAUD,EAAS,CAACp0F,EAAKu6B,KAAKznB,MAAOuhF,IAGvCr0F,EAAKu6B,KAAO85D,EAAQ95D,QAuDtB+5D,WA/CF,SAASA,EAAWt0F,GAClB,GAAKA,EAAKu6B,MAA6B,IAArBv6B,EAAKu6B,KAAK5hC,OAA5B,CAOA,IAHA,IAAIy7F,EAAWH,EAAuBj0F,GAClC+rC,EAAI/rC,EAAKu6B,KAAK5hC,OAETC,EAAI,EAAGA,EAAImzC,EAAGnzC,IACrB07F,EAAWt0F,EAAKu6B,KAAK3hC,IAGvB,GAAImzC,EAAI,GAAK+nD,EAAc9zF,GAAO,CAGhC,IAFA,IAAIq0F,EAAUr0F,EAAKu6B,KAAKwqB,QAEjB/kD,EAAKu6B,KAAK5hC,OAAS,GACxB07F,EAAUD,EAAS,CAACC,EAASr0F,EAAKu6B,KAAKwqB,UAGzC/kD,EAAKu6B,KAAO85D,EAAQ95D,YClJtB,GAAe,CAAC,QAAS,SAAU,MAAO,WAAY,WAAY,SAAU,MAAO,eAAgB,eAAgB,eAAgB,mBAC5Hg6D,IAAoC,EAAAnlB,EAAA,IAFpC,eAEkD,IAAe1jB,IAC1E,IAAI,MACF8qB,EAAK,OACLj1B,EAAM,IACN/oC,EAAG,SACHmvC,EAAQ,SACR98C,EAAQ,OACR42C,EAAM,IACN3wC,EAAG,aACHspE,EAAY,aACZwE,EAAY,aACZmG,EAAY,gBACZ/J,GACEtvB,EACA8oC,EAAQ,IAAIpa,EAAa,GACzBqa,EAAQ,IAAIra,EAAa,GA0K7B,OAjJA,SAASsa,EAAa10F,GACpB,IAAI,EAAAgwE,EAAA,IAAehwE,IAASA,EAAKsgF,UAAW,CAC1C,IAAIqU,EAAKD,EAAa10F,EAAKu6B,KAAK,IAEhC,GAAgB,MAAZv6B,EAAK6+E,GAEP,OAAO8V,EAGT,GAAgB,MAAZ30F,EAAK6+E,GAAY,CAEnB,IAAI,EAAA7O,EAAA,IAAe2kB,GAAK,CACtB,GAAIA,EAAGrU,WAAuB,MAAVqU,EAAG9V,GACrB,OAAO8V,EAAGp6D,KAAK,GACV,GAAIo6D,EAAGn2C,YAAwB,aAAVm2C,EAAG53C,GAC7B,OAAO,IAAI6hC,EAAa,IAAK,WAAY,CAAC+V,EAAGp6D,KAAK,GAAIo6D,EAAGp6D,KAAK,KAIlE,OAAO,IAAIqkD,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC43C,UAExC,IAAI,EAAA3kB,EAAA,IAAehwE,IAASA,EAAKw+C,WAAY,CAClD,IAAInd,EAAKqzD,EAAa10F,EAAKu6B,KAAK,IAE5Bq6D,EAAKF,EAAa10F,EAAKu6B,KAAK,IAEhC,GAAgB,MAAZv6B,EAAK6+E,GAAY,CACnB,IAAI,EAAA7O,EAAA,IAAe3uC,GAAK,CACtB,GAAIkgB,EAAOlgB,EAAGrmC,OACZ,OAAO45F,EACF,IAAI,EAAA5kB,EAAA,IAAe4kB,GACxB,OAAO,IAAIxa,EAAa5hE,EAAI6oB,EAAGrmC,MAAO45F,EAAG55F,QAI7C,OAAI,EAAAg1E,EAAA,IAAe4kB,IAAOrzC,EAAOqzC,EAAG55F,OAC3BqmC,GAGL,EAAA2uC,EAAA,IAAe4kB,IAAOA,EAAGtU,WAAuB,MAAVsU,EAAG/V,GACpC,IAAID,EAAa,IAAK,WAAY,CAACv9C,EAAIuzD,EAAGr6D,KAAK,KAGjD,IAAIqkD,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI63C,EAAK,CAACvzD,EAAIuzD,GAAM,CAACvzD,IACtD,GAAgB,MAAZrhC,EAAK6+E,GAAY,CAC1B,IAAI,EAAA7O,EAAA,IAAe3uC,IAAOuzD,EAAI,CAC5B,IAAI,EAAA5kB,EAAA,IAAe4kB,GACjB,OAAO,IAAIxa,EAAazyB,EAAStmB,EAAGrmC,MAAO45F,EAAG55F,QACzC,GAAIumD,EAAOlgB,EAAGrmC,OACnB,OAAO,IAAI4jF,EAAa,IAAK,aAAc,CAACgW,IAKhD,GAAgB,aAAZ50F,EAAK+8C,GACP,OAAI,EAAAizB,EAAA,IAAe4kB,IAAOrzC,EAAOqzC,EAAG55F,OAC3BqmC,GAGL,EAAA2uC,EAAA,IAAe4kB,IAAOA,EAAGtU,WAAuB,MAAVsU,EAAG/V,GACpC6V,EAAa,IAAI9V,EAAa,IAAK,MAAO,CAACv9C,EAAIuzD,EAAGr6D,KAAK,MAGzD,IAAIqkD,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC1b,EAAIuzD,QAE5C,IAAgB,MAAZ50F,EAAK6+E,GAAY,CAC1B,IAAI,EAAA7O,EAAA,IAAe3uC,GAAK,CACtB,GAAIkgB,EAAOlgB,EAAGrmC,OACZ,OAAOw5F,EACF,GAAIhe,EAAMn1C,EAAGrmC,MAAO,GACzB,OAAO45F,EACF,IAAI,EAAA5kB,EAAA,IAAe4kB,GACxB,OAAO,IAAIxa,EAAavvE,EAASw2B,EAAGrmC,MAAO45F,EAAG55F,QAIlD,IAAI,EAAAg1E,EAAA,IAAe4kB,GAAK,CACtB,GAAIrzC,EAAOqzC,EAAG55F,OACZ,OAAOw5F,EACF,GAAIhe,EAAMoe,EAAG55F,MAAO,GACzB,OAAOqmC,EACF,IAAI,EAAA2uC,EAAA,IAAe3uC,IAAOA,EAAGmd,YAAcnd,EAAGw9C,KAAO7+E,EAAK6+E,GAAI,CACnE,IAAIgW,EAAMxzD,EAAG9G,KAAK,GAElB,IAAI,EAAAy1C,EAAA,IAAe6kB,GAAM,CACvB,IAAIC,EAAQ,IAAI1a,EAAavvE,EAASgqF,EAAI75F,MAAO45F,EAAG55F,QACpD,OAAO,IAAI4jF,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC+3C,EAAOzzD,EAAG9G,KAAK,IAAKv6B,EAAK8+E,WAIxE,OAAO,IAAIF,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC63C,EAAIvzD,GAAKrhC,EAAK8+E,UAG3D,OAAO,IAAIF,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC1b,EAAIuzD,GAAK50F,EAAK8+E,UACpD,GAAgB,MAAZ9+E,EAAK6+E,GAAY,CAC1B,IAAI,EAAA7O,EAAA,IAAe3uC,GAAK,CACtB,GAAIkgB,EAAOlgB,EAAGrmC,OACZ,OAAOw5F,EACF,IAAI,EAAAxkB,EAAA,IAAe4kB,KAAQpe,EAAMoe,EAAG55F,MAAO,IAAMw7E,EAAMoe,EAAG55F,MAAO,IAAMw7E,EAAMoe,EAAG55F,MAAO,IAC5F,OAAO,IAAIo/E,EAAa34B,EAAOpgB,EAAGrmC,MAAO45F,EAAG55F,QAIhD,OAAO,IAAI4jF,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC1b,EAAIuzD,IAC1C,GAAgB,MAAZ50F,EAAK6+E,GAAY,CAC1B,IAAI,EAAA7O,EAAA,IAAe4kB,GAAK,CACtB,GAAIrzC,EAAOqzC,EAAG55F,OACZ,OAAOy5F,EACF,GAAIje,EAAMoe,EAAG55F,MAAO,GACzB,OAAOqmC,EAEP,IAAI,EAAA2uC,EAAA,IAAe3uC,GAEjB,OAAO,IAAI+4C,EAAatpE,EAAIuwB,EAAGrmC,MAAO45F,EAAG55F,QACpC,IAAI,EAAAg1E,EAAA,IAAe3uC,IAAOA,EAAGmd,YAAwB,MAAVnd,EAAGw9C,GAAY,CAC/D,IAAIkW,EAAM1zD,EAAG9G,KAAK,GAElB,IAAI,EAAAy1C,EAAA,IAAe+kB,GACjB,OAAO,IAAInW,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC1b,EAAG9G,KAAK,GAAI,IAAI6/C,EAAavvE,EAASkqF,EAAI/5F,MAAO45F,EAAG55F,WAMvG,OAAO,IAAI4jF,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC1b,EAAIuzD,UAE5C,KAAI,EAAA5kB,EAAA,IAAkBhwE,GAAO,CAClC,IAAIuH,EAAImtF,EAAa10F,EAAKi7E,SAE1B,OAAI,EAAAjL,EAAA,IAAkBzoE,KAAM,EAAAyoE,EAAA,IAAazoE,KAAM,EAAAyoE,EAAA,IAAezoE,GACrDA,EAGF,IAAIyzE,EAAgBzzE,GACtB,IAAI,EAAAyoE,EAAA,IAAehwE,GAAO,CAC/B,IAAIu6B,EAAOv6B,EAAKu6B,KAAK1lB,IAAI6/E,GAAc7/E,KAAI,SAAUmtB,GACnD,OAAO,EAAAguC,EAAA,IAAkBhuC,GAAOA,EAAIi5C,QAAUj5C,KAEhD,OAAO,IAAI+iD,EAAa2P,EAAa10F,EAAK+8C,IAAKxiB,IAIjD,OAAOv6B,M,WCpLP,GAAe,CAAC,QAAS,SAAU,oBAAqB,YAAa,aAAc,eAAgB,eAAgB,eAAgB,cAC5Hg1F,IAAwC,EAAA5lB,EAAA,IAFxC,mBAEsD,IAAe1jB,IAC9E,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,kBACNqlB,EAAiB,SACjB+c,EAAQ,UACRzS,EAAS,aACTS,EAAY,aACZwE,EAAY,aACZmG,EAAY,WACZJ,GACEj5B,GACA,cACFwoC,EAAa,cACbJ,EAAa,YACbC,EAAW,uBACXE,GACEN,GAAW,CACb5O,eACAnG,eACA+F,eAQF,SAASsQ,EAAMC,EAAQ36D,EAAM45B,GAC3B,IACE,OAAOghC,EAAU9lB,EAAkB6lB,GAAQ5oC,MAAM,KAAM/xB,GAAO45B,GAC9D,MAAO/a,GASP,OAPA7e,EAAOA,EAAK1lB,KAAI,SAAU9S,GACxB,OAAI,EAAAiuE,EAAA,IAAWjuE,GACNA,EAAEslD,UAGJtlD,KAEFozF,EAAU9lB,EAAkB6lB,GAAQ5oC,MAAM,KAAM/xB,GAAO45B,IAIlE,IAAIihC,EAAU3T,EAAM,CAClBh1B,SAkFF,SAAyBhlD,GACvB,IAAI9J,EACA03F,EAAK5tF,EAAEoK,EAAIpK,EAAE9J,EAQjB,OALEA,EADE03F,EAAK,EACH,IAAIzW,EAAa,IAAK,aAAc,CAAC,IAAIxE,GAAcib,KAEvD,IAAIjb,EAAaib,GAGX,IAAR5tF,EAAED,EACG7J,EAGF,IAAIihF,EAAa,IAAK,SAAU,CAACjhF,EAAG,IAAIy8E,EAAa3yE,EAAED,MA/F9DkjE,OAAQ,SAAgB/sE,GACtB,OAAIA,EAAI,EACC23F,EAAe,IAAIlb,GAAcz8E,IAGnC,IAAIy8E,EAAaz8E,IAE1B43F,UAAW,SAAmB53F,GAC5B,OAAIA,EAAI,EACC23F,EAAe,IAAIlb,GAAcz8E,IAGnC,IAAIy8E,EAAaz8E,IAE1B8jC,QAAS,SAAiB5vB,GACxB,MAAM,IAAIwtB,MAAM,4CAMpB,SAASm2D,EAAe73F,EAAGw2D,GAGzB,GAFqBA,IAAsC,IAA3BA,EAAQshC,gBAElBp3E,SAAS1gB,IAAMyuF,EAAU,CAC7C,IAAI3kF,EAAI2kF,EAASzuF,GACb+3F,EAAiBvhC,GAA6C,iBAA3BA,EAAQuhC,eAA8BvhC,EAAQuhC,eAAiB/yD,IAEtG,GAAIl7B,EAAE4/C,YAAc1pD,GAAK8J,EAAE9J,EAAI+3F,GAAkBjuF,EAAED,EAAIkuF,EACrD,OAAOjuF,EAIX,OAAO9J,EAKT,IAAIw3F,EAAY1T,EAAM,CACpB,iBAAkB,SAAsB5vE,EAAGsiD,GACzC,MAAsB,cAAlBnK,EAAO0gB,aACSruE,IAAds9E,IACF,WAGKA,EAAU9nE,IACU,aAAlBm4C,EAAO0gB,aACCruE,IAAb+vF,IACF,WAGKA,EAASv6E,IAGT2jF,EADCjlF,WAAWsB,GACMsiD,IAG7B,mBAAoB,SAAwBtiD,EAAGsiD,GAC7C,OAAOtiD,GAGT,oBAAqB,SAAyBA,EAAGsiD,GAC/C,OAAOtiD,GAGT,iBAAkB,SAAsBA,EAAGsiD,GACzC,OAAOqhC,EAAe3jF,EAAGsiD,IAE3B,kBAAmB,SAAuBtiD,EAAGsiD,GAC3C,OAAa,IAATtiD,EAAEswB,GACGtwB,EAGF2jF,EAAe3jF,EAAEqwB,GAAIiyB,MAIhC,SAASmhC,EAAe33F,GACtB,OAAO,IAAIihF,EAAa,IAAK,aAAc,CAACjhF,IA+B9C,SAASg4F,EAAO54C,EAAIxiB,EAAM65D,EAAUjgC,GAClC,OAAO55B,EAAKgC,QAAO,SAAUl1B,EAAGC,GAC9B,IAAK,EAAA0oE,EAAA,IAAO3oE,KAAO,EAAA2oE,EAAA,IAAO1oE,IAOd,EAAA0oE,EAAA,IAAO3oE,IAEP,EAAA2oE,EAAA,IAAO1oE,KACjBA,EAAI8tF,EAAQ9tF,IAFZD,EAAI+tF,EAAQ/tF,OARgB,CAC5B,IACE,OAAO4tF,EAAMl4C,EAAI,CAAC11C,EAAGC,GAAI6sD,GACzB,MAAOyhC,IAETvuF,EAAI+tF,EAAQ/tF,GACZC,EAAI8tF,EAAQ9tF,GAOd,OAAO8sF,EAAS,CAAC/sF,EAAGC,OAKxB,SAASuuF,EAAa71F,EAAMm0D,GAC1B,OAAQn0D,EAAK1B,MACX,IAAK,aACH,OAAO0B,EAET,IAAK,eACH,MAA0B,iBAAfA,EAAKhF,OAAuBgK,MAAMhF,EAAKhF,OAI3CgF,EAHEm1F,EAAUn1F,EAAKhF,MAAOm5D,GAKjC,IAAK,eACH,GAAIkb,EAAkBrvE,EAAKnC,OAASwxE,EAAkBrvE,EAAKnC,MAAMonF,QAC/D,OAAOjlF,EAOP,IAA8C,IAFtB,CAAC,MAAO,YAEVkwB,QAAQlwB,EAAKnC,MAAc,CAC/C,IAAI08B,EAAOv6B,EAAKu6B,KAAK1lB,KAAImtB,GAAO6zD,EAAa7zD,EAAKmyB,KAElD,IAAK55B,EAAK5uB,KAAKqkE,EAAA,IACb,IACE,OAAOilB,EAAMj1F,EAAKnC,KAAM08B,EAAM45B,GAC9B,MAAO2hC,IAOX,OAHAv7D,EAAOA,EAAK1lB,KAAI,SAAUmtB,GACxB,OAAO,EAAAguC,EAAA,IAAOhuC,GAAOA,EAAMozD,EAAQpzD,MAE9B,IAAI+iD,EAAa/kF,EAAKnC,KAAM08B,GAOzC,IAAK,eAED,IAEIw7D,EAEApiE,EAJAopB,EAAK/8C,EAAK+8C,GAAGn/C,WAKbw2F,EAAWH,EAAuBj0F,GAEtC,IAAI,EAAAgwE,EAAA,IAAehwE,IAASA,EAAKsgF,UAC/ByV,EAAQ,CAACF,EAAa71F,EAAKu6B,KAAK,GAAI45B,IAKlCxgC,GAHG,EAAAq8C,EAAA,IAAO+lB,EAAM,IAGV3B,EAAS2B,GAFTd,EAAMl4C,EAAIg5C,EAAO5hC,QAIpB,GAAI2/B,EAAc9zF,GAIvB,GAFA+1F,GADAA,EAAQhC,EAAY/zF,IACN6U,KAAImtB,GAAO6zD,EAAa7zD,EAAKmyB,KAEvC+/B,EAAcn3C,GAAK,CAKrB,IAHA,IAAIi5C,EAAS,GACTC,EAAO,GAEFr9F,EAAI,EAAGA,EAAIm9F,EAAMp9F,OAAQC,KAC3B,EAAAo3E,EAAA,IAAO+lB,EAAMn9F,IAGhBq9F,EAAKv5F,KAAKq5F,EAAMn9F,IAFhBo9F,EAAOt5F,KAAKq5F,EAAMn9F,IAMlBo9F,EAAOr9F,OAAS,GAClBg7B,EAAMgiE,EAAO54C,EAAIi5C,EAAQ5B,EAAUjgC,GACnC8hC,EAAKhpD,QAAQtZ,GACbA,EAAMgiE,EAAO54C,EAAIk5C,EAAM7B,EAAUjgC,IAGjCxgC,EAAMgiE,EAAO54C,EAAIg5C,EAAO3B,EAAUjgC,QAIpCxgC,EAAMgiE,EAAO54C,EAAIg5C,EAAO3B,EAAUjgC,QAKpCxgC,EAAMgiE,EAAO54C,EADbg5C,EAAQ/1F,EAAKu6B,KAAK1lB,KAAImtB,GAAO6zD,EAAa7zD,EAAKmyB,KACvBigC,EAAUjgC,GAGpC,OAAOxgC,EAGX,IAAK,kBAEH,OAAOkiE,EAAa71F,EAAKi7E,QAAS9mB,GAEpC,IAAK,eAGL,IAAK,YAGL,IAAK,iBAGL,IAAK,YAGL,IAAK,yBAGL,IAAK,YAGL,IAAK,aAGL,IAAK,YAGL,IAAK,kBAGL,QACE,MAAM,IAAI90B,MAAM,gDAAgDe,OAAOpgC,EAAK1B,QAIlF,OA5RA,SAA0BoxE,EAAMvb,GAC9B,IAAIxgC,EAAMkiE,EAAanmB,EAAMvb,GAC7B,OAAO,EAAA6b,EAAA,IAAOr8C,GAAOA,EAAMyhE,EAAQzhE,OC7BnC,GAAe,CAAC,QAAS,eAAgB,eAAgB,mBAClDuiE,IAA+B,EAAA9mB,EAAA,IAF/B,UAE6C,IAAe1jB,IACrE,IAAI,MACFp5C,EAAK,aACLyyE,EAAY,aACZnG,EAAY,gBACZ5D,GACEtvB,EAkDJ,OA/BA,SAASuc,EAAQjoE,EAAMsvE,GACrB,IAAKA,EACH,OAAOtvE,EAGT,IAAI,EAAAgwE,EAAA,IAAahwE,GAAO,CACtB,IAAIhF,EAAQs0E,EAAMtvE,EAAKnC,MAEvB,IAAI,EAAAmyE,EAAA,IAAOh1E,GACT,OAAOitE,EAAQjtE,EAAOs0E,GACjB,GAAqB,iBAAVt0E,EAChB,OAAOsX,EAAMkqB,OAAOxhC,QAEjB,KAAI,EAAAg1E,EAAA,IAAehwE,GAAO,CAC/B,IAAIu6B,EAAOv6B,EAAKu6B,KAAK1lB,KAAI,SAAUmtB,GACjC,OAAOimC,EAAQjmC,EAAKstC,MAEtB,OAAO,IAAIsP,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAIxiB,EAAMv6B,EAAK8+E,UAChD,IAAI,EAAA9O,EAAA,IAAkBhwE,GAC3B,OAAO,IAAIg7E,EAAgB/S,EAAQjoE,EAAKi7E,QAAS3L,IAC5C,IAAI,EAAAU,EAAA,IAAehwE,GAAO,CAC/B,IAAI+1F,EAAQ/1F,EAAKu6B,KAAK1lB,KAAI,SAAUmtB,GAClC,OAAOimC,EAAQjmC,EAAKstC,MAGtB,OAAO,IAAIyV,EAAa/kF,EAAKnC,KAAMk4F,IAGrC,OAAO/1F,MCjDP,GAAe,CAAC,SAAU,QAAS,QAAS,MAAO,WAAY,WAAY,SAAU,MAAO,SAAU,QAAS,YAAa,aAAc,oBAAqB,eAAgB,eAAgB,eAAgB,kBAAmB,cAC3Nm2F,IAAgC,EAAA/mB,EAAA,IAFhC,WAE8C,IAAe1jB,IACtE,IAAI,OACF1B,EAAM,MACNy3B,EAAK,MACLnvE,EAAK,IACLkG,EAAG,SACHmvC,EAAQ,SACR98C,EAAQ,OACR42C,EAAM,IACN3wC,EAAG,OACHywC,EAAM,MACNi1B,EAAK,SACL4V,EAAQ,UACRzS,EAAS,kBACTtK,EAAiB,aACjB+K,EAAY,aACZ2K,EAAY,aACZnG,EAAY,gBACZ5D,EAAe,WACf2J,GACEj5B,EACA0qC,EAAmBpB,GAAuB,CAC5CvT,QACAz3B,SACAqlB,oBACA+c,WACAzS,YACAS,eACAwE,eACAmG,eACAJ,eAEE+P,EAAeH,GAAmB,CACpC/d,QACAj1B,SACA/oC,MACAmvC,WACA98C,WACA42C,SACA3wC,MACAspE,eACAwE,eACAmG,eACA/J,oBAEE/S,EAAUiuB,GAAc,CAC1B5jF,QACAyyE,eACAnG,eACA5D,qBAEE,cACFkZ,EAAa,cACbJ,EAAa,QACbprD,EAAO,WACPyrD,EAAU,WACVG,EAAU,uBACVL,GACEN,GAAW,CACb5O,eACAnG,eACA+F,eA0EE7nD,EAAW2kD,EAAM,WAAY,CAC/B9f,OAAQ,SAAgB+N,GACtB,OAAOxxE,KAAKoU,EAAMo9D,GAAOxxE,KAAKm4F,MAAO,GAAI,KAE3C,iBAAkB,SAAsB3mB,EAAMJ,GAC5C,OAAOpxE,KAAKoU,EAAMo9D,GAAOxxE,KAAKm4F,MAAO/mB,EAAO,KAE9C,yBAA0B,SAA4BI,EAAMJ,EAAOnb,GACjE,OAAOj2D,KAAKoU,EAAMo9D,GAAOxxE,KAAKm4F,MAAO/mB,EAAOnb,IAE9C,gBAAiB,SAAqBub,EAAM2mB,GAC1C,OAAOn4F,KAAKoU,EAAMo9D,GAAO2mB,EAAO,GAAI,KAEtC,wBAAyB,SAA2B3mB,EAAM2mB,EAAO/mB,GAC/D,OAAOpxE,KAAKoU,EAAMo9D,GAAO2mB,EAAO/mB,EAAO,KAEzC,gCAAiC,SAAiCI,EAAM2mB,EAAO/mB,EAAOnb,GACpF,OAAOj2D,KAAKoU,EAAMo9D,GAAO2mB,EAAO/mB,EAAOnb,IAEzC,eAAgB,SAAoBub,EAAMJ,GACxC,OAAOpxE,KAAKwxE,EAAMxxE,KAAKm4F,MAAO/mB,EAAO,KAEvC,uBAAwB,SAA0BI,EAAMJ,EAAOnb,GAC7D,OAAOj2D,KAAKwxE,EAAMxxE,KAAKm4F,MAAO/mB,EAAOnb,IAEvCl2C,KAAM,SAAcyxD,GAClB,OAAOxxE,KAAKwxE,EAAMxxE,KAAKm4F,MAAO,GAAI,KAEpC,cAAe,SAAmB3mB,EAAM2mB,GACtC,OAAOn4F,KAAKwxE,EAAM2mB,EAAO,GAAI,KAE/B,sBAAuB,SAAyB3mB,EAAM2mB,EAAO/mB,GAC3D,OAAOpxE,KAAKwxE,EAAM2mB,EAAO/mB,EAAO,KAElC,8BAA+B,SAA+BI,EAAM2mB,EAAO/mB,EAAOnb,GAChFkiC,EA0MJ,SAAqBA,GAInB,IAFA,IAAIC,EAAU,GAEL19F,EAAI,EAAGA,EAAIy9F,EAAM19F,OAAQC,IAAK,CACrC,IAAI29F,EAAOF,EAAMz9F,GACb49F,OAAU,EACVC,SAAkBF,EAEtB,OAAQE,GACN,IAAK,SAED,IAAIC,EAAKH,EAAKjlE,MAAM,MAEpB,GAAkB,IAAdolE,EAAG/9F,OAML,MAAMwoC,YAAY,yBAA2Bo1D,GAL7CA,EAAO,CACLxqD,EAAG2qD,EAAG,GACNhsF,EAAGgsF,EAAG,IASd,IAAK,SAcH,GAbAF,EAAU,CACRzqD,EAAG4qD,EAAarkF,EAAMikF,EAAKxqD,IAC3BrhC,EAAGisF,EAAarkF,EAAMikF,EAAK7rF,KAGzB6rF,EAAKjlB,UACPklB,EAAQ9jF,SAAW6jF,EAAKjlB,SAGtBilB,EAAK7jF,WACP8jF,EAAQ9jF,SAAWJ,EAAMikF,EAAK7jF,WAG5BohF,EAAc0C,EAAQzqD,GAAI,CAC5B,IAAIqoD,EAAWH,EAAuBuC,EAAQzqD,GAE1C6qD,EAgCL,IAAIjS,EAAW,KAAOkS,KA9BrBL,EAAQM,SAAW,GACnBN,EAAQM,SAAS/qD,EAAIqoD,EAAS,CAACoC,EAAQzqD,EAAE4e,QAASisC,IAGlDluD,EAAQ8tD,EAAQM,SAAS/qD,GACzBooD,EAAWqC,EAAQM,SAAS/qD,GAC5ByqD,EAAQM,SAASpsF,EAAI0pF,EAAS,CAACoC,EAAQ9rF,EAAGksF,IAG5C,MAEF,IAAK,WACHJ,EAAUD,EACV,MAEF,QACE,MAAMl9F,UAAU,6BAA+Bo9F,GAKnDH,EAAQ55F,KAAK85F,GAGf,OAAOF,EA/QGS,CAAYV,GAQpB,IAPA,IAAI1iE,EAAMs0C,EAAQyH,EAAMJ,GAEpB9qC,EAAU,GACVjH,GAFJ5J,EAAMgjE,EAAahjE,IAEL/1B,SAAS,CACrBu9E,YAAa,SAGP32C,EAAQjH,IAAM,CACpBiH,EAAQjH,IAAO,EACfs5D,EAAW,EAEX,IAAK,IAAIj+F,EAAI,EAAGA,EAAIy9F,EAAM19F,OAAQC,IACR,mBAAby9F,EAAMz9F,GACf+6B,EAAM0iE,EAAMz9F,GAAG+6B,EAAKwgC,IAEpBzrB,EAAQ/U,GACRA,EAAMqjE,EAAUrjE,EAAK0iE,EAAMz9F,KAG7B07F,EAAW3gE,GAGb4J,EAAM5J,EAAI/1B,SAAS,CACjBu9E,YAAa,QAIjB,OAAOxnD,KAMX,SAASgjE,EAAa32F,GACpB,OAAOA,EAAK4K,WAAU,SAAU5K,EAAMkT,EAAMC,GAC1C,OAAO,EAAA68D,EAAA,IAAkBhwE,GAAQ22F,EAAa32F,EAAKi7E,SAAWj7E,KALlE88B,EAAS43D,aAAeA,EACxB53D,EAASmrC,QAAUA,EASnB,IAAIgvB,EAAsB,CACxB7hB,MAAM,EACNC,OAAO,EACPt2E,GAAG,EACHnG,GAAG,EACH+pC,UAAU,EACV2pD,KAAK,EACL/uC,MAAM,EACNgvC,OAAO,EACPC,QAAQ,EACR/oD,KAAK,EACLmxC,KAAK,EACL7qB,IAAI,EACJ0iC,SAAS,EACTC,OAAO,EACPlY,KAAK,GAcP13C,EAASu5D,MAAQ,CAAC3B,EAOlB,CACE3oD,EAAG,SACHrhC,EAAG,KAEL,CACEqhC,EAAG,OACHrhC,EAAG,SAEL,CACEqhC,EAAG,SACHrhC,EAAG,YAEL,CACEqhC,EAAG,KACHrhC,EAAG,YACF,CACDqhC,EAAG,UACHrhC,EAAG,YAEL,CACEqhC,EAAG,OACHrhC,EAAG,WAEL,CACEqhC,EAAG,gBACHrhC,EAAG,iBAEL,CACEqhC,EAAG,MACHrhC,EAAG,OACF,CACDqhC,EAAG,WACHrhC,EAAG,YACF,CACDqhC,EAAG,cACHrhC,EAAG,aAEL,CACEqhC,EAAG,MACHrhC,EAAG,OACF,CACDqhC,EAAG,OACHrhC,EAAG,KACF,CACDqhC,EAAG,aACHrhC,EAAG,aACF,CACDqhC,EAAG,gBACHrhC,EAAG,cAEL,CACEqhC,EAAG,sBACHrhC,EAAG,0BACF0rF,EAAkB,CACnBrqD,EAAG,UACHrhC,EAAG,WAGL,CACEqhC,EAAG,MACHrhC,EAAG,MACH4mE,QAAS,CACP94D,IAAK,CACHo7E,aAAa,KAGhB,CACD7nD,EAAG,MACHrhC,EAAG,MACH4mE,QAAS,CACPzmE,SAAU,CACR+oF,aAAa,KAKnB,CACE7nD,EAAG,QACHrhC,EAAG,QAEL,CACEqhC,EAAG,YACHrhC,EAAG,QAEL,CACEqhC,EAAG,WACHrhC,EAAG,WACF,CACDqhC,EAAG,QACHrhC,EAAG,QACF,CACDqhC,EAAG,YACHrhC,EAAG,aAEL,CACEqhC,EAAG,YACHrhC,EAAG,WAIL,CACEqhC,EAAG,MACHrhC,EAAG,KAEL,CACEqhC,EAAG,aACHrhC,EAAG,eA2FL,IAAImsF,EAAW,EAaf,IAAIG,EAAYvV,EAAM,YAAa,CACjC,eAAgB,SAAoBzhF,EAAMu2F,GAGxC,IAAI5iE,EAAM3zB,EAIV,GAAI2zB,aAAeirD,GAAgBjrD,aAAeoxD,GAChD,GAAIpxD,EAAI4G,KACN,IAAK,IAAI3hC,EAAI,EAAGA,EAAI+6B,EAAI4G,KAAK5hC,OAAQC,IACnC+6B,EAAI4G,KAAK3hC,GAAKo+F,EAAUrjE,EAAI4G,KAAK3hC,GAAI29F,QAGhC5iE,aAAeqnD,GACpBrnD,EAAIsnD,UACNtnD,EAAIsnD,QAAU+b,EAAUrjE,EAAIsnD,QAASsb,IAKzC,IAAIW,EAAOX,EAAK7rF,EAEZysF,EAAUC,EAAWb,EAAKxqD,EAAGpY,GAAK,GAStC,IALKwjE,GAAWZ,EAAKO,WACnBI,EAAOX,EAAKO,SAASpsF,EACrBysF,EAAUC,EAAWb,EAAKO,SAAS/qD,EAAGpY,GAAK,IAGzCwjE,EAAS,CAIX,IAAIrY,EAAWnrD,EAAImrD,SACnBnrD,EAAMujE,EAAKvsC,QAEPm0B,GAAY,aAAcoY,IAC5BvjE,EAAImrD,UAAW,GAIjBnrD,EAAMA,EAAI/oB,WAAU,SAAU5K,GAC5B,OAAIA,EAAK4kF,eAAgB,QAAeuS,EAAQE,aAAcr3F,EAAKnC,MAC1Ds5F,EAAQE,aAAar3F,EAAKnC,MAAM8sD,QAEhC3qD,KAMb,OAAO2zB,KAqCX,SAAS2jE,EAAWC,EAAQC,GAC1B,IAAI7jE,EAAM,CACR0jE,aAAc,IAGhB,IAAKE,EAAOF,eAAiBG,EAAOH,aAClC,OAAO1jE,EACF,IAAK4jE,EAAOF,aACjB,OAAOG,EACF,IAAKA,EAAOH,aACjB,OAAOE,EAIT,IAAK,IAAIx9F,KAAOw9F,EAAOF,aACrB,IAAI,QAAeE,EAAOF,aAAct9F,KACtC45B,EAAI0jE,aAAat9F,GAAOw9F,EAAOF,aAAat9F,IAExC,QAAey9F,EAAOH,aAAct9F,KACjC09F,EAAYF,EAAOF,aAAat9F,GAAMy9F,EAAOH,aAAat9F,KAC7D,OAAO,KAMf,IAAK,IAAI+gF,KAAQ0c,EAAOH,cAClB,QAAeG,EAAOH,aAAcvc,KACtCnnD,EAAI0jE,aAAavc,GAAQ0c,EAAOH,aAAavc,IAIjD,OAAOnnD,EAQT,SAAS+jE,EAAoBC,EAAOC,GAClC,IAMI7kD,EANApf,EAAM,GAEV,GAAqB,IAAjBgkE,EAAMh/F,QAAiC,IAAjBi/F,EAAMj/F,OAC9B,OAAOg7B,EAKT,IAAK,IAAIkkE,EAAK,EAAGA,EAAKF,EAAMh/F,OAAQk/F,IAClC,IAAK,IAAIC,EAAK,EAAGA,EAAKF,EAAMj/F,OAAQm/F,KAClC/kD,EAASukD,EAAWK,EAAME,GAAKD,EAAME,MAGnCnkE,EAAIj3B,KAAKq2C,GAKf,OAAOpf,EAsCT,SAASyjE,EAAWb,EAAMv2F,EAAM+3F,GAK9B,IAAIpkE,EAAM,CAAC,CACT0jE,aAAc,KAGhB,GAAId,aAAgB3X,GAAgB5+E,aAAgB4+E,GAAgB2X,aAAgBxR,GAAgB/kF,aAAgB+kF,EAAc,CAEhI,GAAIwR,aAAgB3X,GAClB,GAAI2X,EAAK1X,KAAO7+E,EAAK6+E,IAAM0X,EAAKx5C,KAAO/8C,EAAK+8C,GAC1C,MAAO,QAEJ,GAAIw5C,aAAgBxR,GACrBwR,EAAK14F,OAASmC,EAAKnC,KACrB,MAAO,GAKX,KAAyB,IAArBmC,EAAKu6B,KAAK5hC,QAAqC,IAArB49F,EAAKh8D,KAAK5hC,SAAiBm7F,EAAc9zF,IAASA,EAAKu6B,KAAK5hC,SAAW49F,EAAKh8D,KAAK5hC,QAAUo/F,GAiBlH,IAAI/3F,EAAKu6B,KAAK5hC,QAAU,GAA0B,IAArB49F,EAAKh8D,KAAK5hC,OAAc,CAO1D,IAHA,IAAIq/F,EArKV,SAAmBh4F,EAAMsxE,GACvB,IACIz4D,EAAOo/E,EADPtkE,EAAM,GAENygE,EAAWH,EAAuBj0F,GAEtC,GAAIk0F,EAAcl0F,EAAMsxE,GACtB,IAAK,IAAI14E,EAAI,EAAGA,EAAIoH,EAAKu6B,KAAK5hC,OAAQC,KACpCq/F,EAAYj4F,EAAKu6B,KAAKv9B,MAAM,IAClBmsE,OAAOvwE,EAAG,GACpBigB,EAA6B,IAArBo/E,EAAUt/F,OAAes/F,EAAU,GAAK7D,EAAS6D,GACzDtkE,EAAIj3B,KAAK03F,EAAS,CAACp0F,EAAKu6B,KAAK3hC,GAAIigB,UAInCA,EAA6B,KAD7Bo/E,EAAYj4F,EAAKu6B,KAAKv9B,MAAM,IACVrE,OAAes/F,EAAU,GAAK7D,EAAS6D,GACzDtkE,EAAIj3B,KAAK03F,EAAS,CAACp0F,EAAKu6B,KAAK,GAAI1hB,KAGnC,OAAO8a,EAmJUukE,CAAUl4F,EAAMu2F,EAAKjlB,SAC9B6mB,EAAe,GAEV57F,EAAK,EAAGA,EAAKy7F,EAAOr/F,OAAQ4D,IAAM,CACzC,IAAI67F,EAAWhB,EAAWb,EAAMyB,EAAOz7F,IAAK,GAG5C47F,EAAeA,EAAa/3D,OAAOg4D,GAGrC,OAAOD,EACF,GAAI5B,EAAKh8D,KAAK5hC,OAAS,EAC5B,MAAM0mC,MAAM,+CAAiDk3D,EAAK34F,YAGlE,MAAO,GAhCP,IAFA,IAAIy6F,EAAe,GAEVz/F,EAAI,EAAGA,EAAI29F,EAAKh8D,KAAK5hC,OAAQC,IAAK,CACzC,IAAI0/F,EAAalB,EAAWb,EAAKh8D,KAAK3hC,GAAIoH,EAAKu6B,KAAK3hC,IAEpD,GAA0B,IAAtB0/F,EAAW3/F,OAEb,MAAO,GAIT0/F,EAAa37F,KAAK47F,GAGpB3kE,EAnEN,SAA2B0kE,GACzB,GAA4B,IAAxBA,EAAa1/F,OACf,OAAO0/F,EAOT,IAJA,IAAIE,EAAOF,EAAa97D,OAAOm7D,GAC3Bc,EAAa,GACbC,EAAS,GAEJ7/F,EAAI,EAAGA,EAAI2/F,EAAK5/F,OAAQC,IAAK,CACpC,IAAIiZ,EAAIkpB,KAAKqC,UAAUm7D,EAAK3/F,IAEvB6/F,EAAO5mF,KACV4mF,EAAO5mF,IAAK,EACZ2mF,EAAW97F,KAAK67F,EAAK3/F,KAIzB,OAAO4/F,EAiDGE,CAAkBL,QAsBrB,GAAI9B,aAAgB5R,EAAY,CAKrC,GAAyB,IAArB4R,EAAK14F,KAAKlF,OACZ,MAAM,IAAI0mC,MAAM,oCAGlB,GAAI43D,EAAoBV,EAAK14F,OAE3B,GAAI04F,EAAK14F,OAASmC,EAAKnC,KACrB,MAAO,QAEJ,GAAqB,MAAjB04F,EAAK14F,KAAK,IAA4C,OAA9B04F,EAAK14F,KAAKqxB,UAAU,EAAG,GAIxDyE,EAAI,GAAG0jE,aAAad,EAAK14F,MAAQmC,OAC5B,GAAqB,MAAjBu2F,EAAK14F,KAAK,GAAY,CAE/B,IAAK,EAAAmyE,EAAA,IAAehwE,GAIlB,MAAO,GAHP2zB,EAAI,GAAG0jE,aAAad,EAAK14F,MAAQmC,MAK9B,IAAqB,MAAjBu2F,EAAK14F,KAAK,GASnB,MAAM,IAAIwhC,MAAM,2BAA6Bk3D,EAAK14F,MAPlD,KAAImC,aAAgBo6E,GAIlB,MAAO,GAHPzmD,EAAI,GAAG0jE,aAAad,EAAK14F,MAAQmC,OAQhC,MAAIu2F,aAAgBnc,GAOzB,MAAO,GALP,IAAK5D,EAAM+f,EAAKv7F,MAAOgF,EAAKhF,OAC1B,MAAO,GASX,OAAO24B,EAWT,SAAS8jE,EAAY77F,EAAGspD,GACtB,GAAItpD,aAAaw+E,GAAgBl1B,aAAak1B,GAC5C,IAAK5D,EAAM56E,EAAEZ,MAAOkqD,EAAElqD,OACpB,OAAO,OAEJ,GAAIY,aAAa+oF,GAAcz/B,aAAay/B,GACjD,GAAI/oF,EAAEiC,OAASqnD,EAAErnD,KACf,OAAO,MAEJ,MAAIjC,aAAagjF,GAAgB15B,aAAa05B,GAAgBhjF,aAAampF,GAAgB7/B,aAAa6/B,GAqB7G,OAAO,EApBP,GAAInpF,aAAagjF,GACf,GAAIhjF,EAAEijF,KAAO35B,EAAE25B,IAAMjjF,EAAEmhD,KAAOmI,EAAEnI,GAC9B,OAAO,OAEJ,GAAInhD,aAAampF,GAClBnpF,EAAEiC,OAASqnD,EAAErnD,KACf,OAAO,EAIX,GAAIjC,EAAE2+B,KAAK5hC,SAAWusD,EAAE3qB,KAAK5hC,OAC3B,OAAO,EAGT,IAAK,IAAIC,EAAI,EAAGA,EAAIgD,EAAE2+B,KAAK5hC,OAAQC,IACjC,IAAK6+F,EAAY77F,EAAE2+B,KAAK3hC,GAAIssD,EAAE3qB,KAAK3hC,IACjC,OAAO,EAOb,OAAO,EAGT,OAAOkkC,K,WCvyBL,GAAO,cACP,GAAe,CAAC,SAAU,QAAS,QAAS,SAAU,MAAO,WAAY,WAAY,SAAU,MAAO,QAAS,WAAY,aAAc,YAAa,oBAAqB,eAAgB,eAAgB,eAAgB,aAAc,mBAClO67D,IAAmC,EAAAvpB,EAAA,IAAQ,GAAM,IAAe1jB,IACzE,IAAI,OACF1B,EAAM,MACNy3B,EAAK,MACLjL,EAAK,OACLj1B,EAAM,IACN/oC,EAAG,SACHmvC,EAAQ,SACR98C,EAAQ,OACR42C,EAAM,IACN3wC,EAAG,MACHwB,EAAK,SACLwqB,EAAQ,SACRsvD,EAAQ,UACRzS,EAAS,kBACTtK,EAAiB,aACjB+K,EAAY,aACZwE,EAAY,aACZmG,EAAY,WACZJ,EAAU,gBACV3J,GACEtvB,EACA0qC,EAAmBpB,GAAuB,CAC5CvT,QACAz3B,SACAqlB,oBACA+c,WACAzS,YACAS,eACAwE,eACAmG,eACAJ,eAEE+P,EAAeH,GAAmB,CACpC/d,QACAj1B,SACA/oC,MACAmvC,WACA98C,WACA42C,SACA3wC,MACAspE,eACAwE,eACAmG,eACA/J,oBAwDF,OAAOyG,EAAM,GAAM,CACjB9f,OAAQ,SAAgB+N,GACtB,OAAOxxE,KAAKoU,EAAMo9D,GAAO,IAAI,IAE/B,kBAAmB,SAAuBA,EAAMkpB,GAC9C,OAAO16F,KAAKoU,EAAMo9D,GAAO,GAAIkpB,IAE/B,iBAAkB,SAAsBlpB,EAAMJ,GAC5C,OAAOpxE,KAAKoU,EAAMo9D,GAAOJ,GAAO,IAElC,0BAA2B,SAA6BI,EAAMJ,EAAOspB,GACnE,OAAO16F,KAAKoU,EAAMo9D,GAAOJ,EAAOspB,IAElC36E,KAAM,SAAcyxD,GAClB,OAAOxxE,KAAKwxE,EAAM,IAAI,IAExB,gBAAiB,SAAqBA,EAAMkpB,GAC1C,OAAO16F,KAAKwxE,EAAM,GAAIkpB,IAExB,eAAgB,SAAoBlpB,EAAMJ,GACxC,OAAOpxE,KAAKwxE,EAAMJ,GAAO,IAE3B,wBAAyB,SAA2BI,EAAMJ,EAAOspB,GAC/D,IAAIC,EAgMR,WACE,IAAIC,EAAW,CAACpE,EAChB,CACE3oD,EAAG,MACHrhC,EAAG,OACF,CACDqhC,EAAG,OACHrhC,EAAG,KACF0rF,EACH,CACErqD,EAAG,YACHrhC,EAAG,QACF,CACDqhC,EAAG,WACHrhC,EAAG,WACF,CACDqhC,EAAG,QACHrhC,EAAG,QACF,CACDqhC,EAAG,YACHrhC,EAAG,aACF,CACDqhC,EAAG,MACHrhC,EAAG,MAEDquF,EAAa,CAAC,CAChBhtD,EAAG,cACHrhC,EAAG,SAEL,CACEqhC,EAAG,cACHrhC,EAAG,SAEL,CACEqhC,EAAG,SACHrhC,EAAG,SAEL,CACEqhC,EAAG,QACHrhC,EAAG,YAEL,CACEqhC,EAAG,aACHrhC,EAAG,mBAEL,CACEqhC,EAAG,aACHrhC,EAAG,iBAEL,CACEqhC,EAAG,cACHrhC,EAAG,aAEL,CACEqhC,EAAG,WACHrhC,EAAG,YAEL,CACEqhC,EAAG,cACHrhC,EAAG,aAEL,CACEqhC,EAAG,WACHrhC,EAAG,YAEL,CACEqhC,EAAG,MACHrhC,EAAG,WAEL,CACEqhC,EAAG,OACHrhC,EAAG,YAEL,CACEqhC,EAAG,QACHrhC,EAAG,OAEL,CACEqhC,EAAG,OACHrhC,EAAG,QAEL,CACEqhC,EAAG,OACHrhC,EAAG,QAEL,CACEqhC,EAAG,MACHrhC,EAAG,OAEL,CACEqhC,EAAG,YACHrhC,EAAG,WAEL,CACEqhC,EAAG,WACHrhC,EAAG,YAEL,CACEqhC,EAAG,YACHrhC,EAAG,WAEL,CACEqhC,EAAG,WACHrhC,EAAG,YAEL,CACEqhC,EAAG,aACHrhC,EAAG,gBAEL,CACEqhC,EAAG,YACHrhC,EAAG,WAEL,CACEqhC,EAAG,WACHrhC,EAAG,aAgBDsuF,EAAc,CAAC,CACjBjtD,EAAG,eACHrhC,EAAG,gBAEL,CACEqhC,EAAG,aACHrhC,EAAG,iBAEDmuF,EAAW,GA8Ff,OA1FAA,EAASI,WAAaH,EAAS14D,OAAO24D,EAAYC,GAElDH,EAASK,cA3BW,CAAC,CACnBntD,EAAG,kBACHrhC,EAAG,6BAEL,CACEqhC,EAAG,eACHrhC,EAAG,qBAEL,CACEqhC,EAAG,eACHrhC,EAAG,sBAmBLmuF,EAASM,YAAcH,EAEvBH,EAASO,gBAAkBN,EAAS14D,OAAO24D,GAK3CF,EAASQ,WAAa,CAAC3E,EACvB,CACE3oD,EAAG,OACHrhC,EAAG,QAEL,CACEqhC,EAAG,MACHrhC,EAAG,OAEL0rF,EACA,CACErqD,EAAG,UACHrhC,EAAG,aAEL,CACEqhC,EAAG,SACHrhC,EAAG,YAEL,CACEqhC,EAAG,aACHrhC,EAAG,cAEL,CACEqhC,EAAG,YACHrhC,EAAG,aAEL,CACEqhC,EAAG,UACHrhC,EAAG,aAEL,CACEqhC,EAAG,SACHrhC,EAAG,YAEL,CACEqhC,EAAG,UACHrhC,EAAG,aAEL,CACEqhC,EAAG,SACHrhC,EAAG,YAEL,CACEqhC,EAAG,UACHrhC,EAAG,aAEL,CACEqhC,EAAG,SACHrhC,EAAG,YAEL,CACEqhC,EAAG,aACHrhC,EAAG,aAEL,CACEqhC,EAAG,YACHrhC,EAAG,aAEL,CACEqhC,EAAG,cACHrhC,EAAG,YAEL,CACEqhC,EAAG,SACHrhC,EAAG,QAEL,CACEqhC,EAAG,SACHrhC,EAAG,SAEL,CACEqhC,EAAG,MACHrhC,EAAG,OAEL,CACEqhC,EAAG,aACHrhC,EAAG,iBAGEmuF,EAzaUS,GAEXC,EA0GR,SAAoB7pB,EAAMJ,EAAOkqB,EAAUnD,GACzC,IAAIoD,EAAY,GACZz5F,EAAO88B,EAAS4yC,EAAM2mB,EAAO/mB,EAAO,CACtCmmB,gBAAgB,IAIdiE,EAAO,QADXF,IAAaA,GACkB,IAAM,KAuBrC,SAASG,EAAQ35F,GACf,IAAI45F,EAAK55F,EAAK1B,KAEd,GAAW,iBAAPs7F,EAEF,MAAM,IAAIv6D,MAAM,sCACX,GAAW,iBAAPu6D,EACT,GAAgB,MAAZ55F,EAAK6+E,GAAY,CAEnB,GAA0B,iBAAtB7+E,EAAKu6B,KAAK,GAAGj8B,QAA4B,QAAUiS,WAAWvQ,EAAKu6B,KAAK,GAAGv/B,QAC7E,MAAM,IAAIqkC,MAAM,mCAEhBs6D,EAAQ35F,EAAKu6B,KAAK,QAEf,CACL,IAA+B,IAA3Bm/D,EAAKxpE,QAAQlwB,EAAK6+E,IACpB,MAAM,IAAIx/C,MAAM,YAAcr/B,EAAK6+E,GAAK,qCAG1C,IAAK,IAAIjmF,EAAI,EAAGA,EAAIoH,EAAKu6B,KAAK5hC,OAAQC,IACpC+gG,EAAQ35F,EAAKu6B,KAAK3hC,SAIjB,GAAW,eAAPghG,EAAqB,CAC9B,IAAInc,EAAQz9E,EAAKnC,MAIJ,IAFH47F,EAAUvpE,QAAQutD,IAI1Bgc,EAAU/8F,KAAK+gF,QAEZ,GAAW,oBAAPmc,EACTD,EAAQ35F,EAAKi7E,cACR,GAAW,iBAAP2e,EACT,MAAM,IAAIv6D,MAAM,QAAUu6D,EAAK,4CA1DnCD,CAAQ35F,GACR,IAAI65F,EAAU,GAGd,OAFAA,EAAQlc,WAAa39E,EACrB65F,EAAQJ,UAAYA,EACbI,EAtHSC,CAAWpqB,EAAMJ,GAAO,EAAMupB,EAASI,YAEjDc,EAAQR,EAAQE,UAAU9gG,OAG9B,GAFA+2E,EAAO6pB,EAAQ5b,WAEXoc,GAAS,EAAG,CAId,IAAIC,EAEA3D,EAJJ3mB,EAAOuqB,EAAYvqB,GAKnB,IAMI79D,EANAqoF,GAAY,EACZC,GAAW,EAOf,IANAzqB,EAAO5yC,EAAS4yC,EAAMmpB,EAASI,WAAY,GAAI,CAC7CxD,gBAAgB,IAOhBY,EAAQ6D,EAAYrB,EAASK,cAAgBL,EAASM,YAGtDe,GAAaA,GAEbroF,GAJA69D,EAAO5yC,EAAS4yC,EAAM2mB,IAIbz4F,cAECo8F,GAIVG,GAAW,EACXH,EAAUnoF,EAGRsoF,IAEFzqB,EAAO5yC,EAAS4yC,EAAMmpB,EAASO,gBAAiB,GAAI,CAClD3D,gBAAgB,KAIpB/lB,EAAO5yC,EAAS4yC,EAAMmpB,EAASQ,WAAY,GAAI,CAC7C5D,gBAAgB,IAKpB,IAAI2E,EAAe,GACfC,EAAiB,GAyBrB,MAvBkB,iBAAd3qB,EAAKpxE,MAA2BoxE,EAAKlxB,YAA0B,MAAZkxB,EAAKmP,IAE5C,IAAVkb,IACFrqB,EAAKn1C,KAAK,GAAK+/D,EAAgB5qB,EAAKn1C,KAAK,GAAI6/D,GAC7C1qB,EAAKn1C,KAAK,GAAK+/D,EAAgB5qB,EAAKn1C,KAAK,KAGvCq+D,IACFyB,EAAe9wC,UAAYmmB,EAAKn1C,KAAK,GACrC8/D,EAAe71C,YAAckrB,EAAKn1C,KAAK,MAG3B,IAAVw/D,IACFrqB,EAAO4qB,EAAgB5qB,EAAM0qB,IAG3BxB,IACFyB,EAAe9wC,UAAYmmB,EAC3B2qB,EAAe71C,YAAc,OAK5Bo0C,GACLyB,EAAeD,aAAeA,EAC9BC,EAAeZ,UAAYF,EAAQE,UACnCY,EAAe1c,WAAajO,EACrB2qB,GAJe3qB,KAgX1B,SAASuqB,EAAYj6F,EAAMmT,EAAQonF,GACjC,IAAIX,EAAK55F,EAAK1B,KACVk8F,EAAWt8D,UAAUvlC,OAAS,EAElC,GAAW,iBAAPihG,GAAyB55F,EAAKw+C,WAAY,CAC5C,IACInqC,EADAomF,GAAO,EAYX,GATgB,MAAZz6F,EAAK6+E,KAEoB,oBAAtB7+E,EAAKu6B,KAAK,GAAGj8B,MAAoD,iBAAtB0B,EAAKu6B,KAAK,GAAGj8B,MAAkD,iBAAtB0B,EAAKu6B,KAAK,GAAGj8B,OAGpGm8F,GADApmF,EAAM9D,WAAWvQ,EAAKu6B,KAAK,GAAGv/B,SAChB,IAAK,QAAUqZ,KAI7BomF,EAAM,CAOR,GAAIpmF,EAAM,EAAG,CASX,IAAIqmF,EAAW16F,EAAKu6B,KAAK,GACrBogE,EAAW,IAAI/b,EAAa,IAAK,MAAO,CAAC5+E,EAAKu6B,KAAK,GAAGuT,YAAa,IAAIssC,EAAa/lE,EAAM,KAC9FrU,EAAO,IAAI4+E,EAAa,IAAK,WAAY,CAAC8b,EAAUC,SAQpD36F,EAAO,IAAI4+E,EAAa,IAAK,WAAY,CAAC5+E,EAAKu6B,KAAK,GAAIv6B,EAAKu6B,KAAK,GAAGuT,cAGnE0sD,IAEgB,YAAdD,EACFpnF,EAAO8nE,QAAUj7E,EAEjBmT,EAAOonB,KAAKggE,GAAav6F,IAQjC,GAAW,oBAAP45F,EAEFK,EAAYj6F,EAAKi7E,QAASj7E,EAAM,gBAC3B,GAAW,iBAAP45F,GAAgC,eAAPA,EAClC,IAAK,IAAIhhG,EAAI,EAAGA,EAAIoH,EAAKu6B,KAAK5hC,OAAQC,IACpCqhG,EAAYj6F,EAAKu6B,KAAK3hC,GAAIoH,EAAMpH,GAIpC,IAAK4hG,EAEH,OAAOx6F,EA6BX,SAASs6F,EAAgBt6F,EAAMo6F,QACR/9F,IAAjB+9F,IACFA,EAAe,IAIjBA,EAAa,GAAK,EAElB,IAMIQ,EAAU,EAEVC,EAAU,IA+Dd,SAASC,EAAS96F,EAAM+6F,EAAO7/F,GAC7B,IAAI0+F,EAAK55F,EAAK1B,KAEd,GAAW,iBAAPs7F,EAGF,MAAM,IAAIv6D,MAAM,sCACX,GAAW,iBAAPu6D,EAAuB,CAEhC,IAAiC,IAA7B,OAAO1pE,QAAQlwB,EAAK6+E,IAAY,MAAM,IAAIx/C,MAAM,YAAcr/B,EAAK6+E,GAAK,YAE5E,GAAc,OAAVkc,EAAgB,CAElB,IAAiB,eAAZ/6F,EAAK+8C,IAAmC,QAAZ/8C,EAAK+8C,KAA8B,QAAbg+C,EAAMh+C,IAA6B,aAAbg+C,EAAMh+C,IAAkC,aAAbg+C,EAAMh+C,GAC5G,MAAM,IAAI1d,MAAM,WAAar/B,EAAK6+E,GAAK,YAIzC,IAAiB,aAAZ7+E,EAAK+8C,IAAiC,QAAZ/8C,EAAK+8C,IAA4B,aAAZ/8C,EAAK+8C,KAAmC,QAAbg+C,EAAMh+C,IAA6B,aAAbg+C,EAAMh+C,GACzG,MAAM,IAAI1d,MAAM,WAAar/B,EAAK6+E,GAAK,YAIzC,IAAiB,aAAZ7+E,EAAK+8C,IAAiC,QAAZ/8C,EAAK+8C,IAA4B,eAAZ/8C,EAAK+8C,KAAoC,IAAZ7hD,EAAE8/F,MACjF,MAAM,IAAI37D,MAAM,WAAar/B,EAAK6+E,GAAK,YAM3B,MAAZ7+E,EAAK6+E,IAA0B,MAAZ7+E,EAAK6+E,KAC1B3jF,EAAE+/F,KAAOj7F,EAAK6+E,IAGhB,IAAK,IAAItiF,EAAK,EAAGA,EAAKyD,EAAKu6B,KAAK5hC,OAAQ4D,IAEtB,eAAZyD,EAAK+8C,KAAqB7hD,EAAEw+F,KAAO,KAEvB,MAAZ15F,EAAK6+E,IAA0B,aAAZ7+E,EAAK+8C,KAC1B7hD,EAAE+/F,KAAO,GACT//F,EAAEggG,IAAM,EAERhgG,EAAEw+F,KAAc,IAAPn9F,EAAW,IAAMyD,EAAK6+E,IAGjC3jF,EAAE8/F,MAAQz+F,EAEVu+F,EAAS96F,EAAKu6B,KAAKh+B,GAAKyD,EAAM9E,QAG3B,GAAW,eAAP0+F,EAAqB,CAE9B,GAAI55F,EAAKnC,OAASg9F,GAAuB,KAAZA,EAC3B,MAAM,IAAIx7D,MAAM,mCAKlB,GAFAw7D,EAAU76F,EAAKnC,KAED,OAAVk9F,EAEF,YADAX,EAAa,GAAK,GAKpB,GAAiB,MAAbW,EAAMlc,IAA0B,IAAZ3jF,EAAE8/F,MACxB,MAAM,IAAI37D,MAAM,uDAIlB,GAAiB,MAAb07D,EAAMlc,IAA0B,IAAZ3jF,EAAE8/F,MACxB,MAAM,IAAI37D,MAAM,2DAIH,KAAXnkC,EAAE+/F,MAA0B,MAAX//F,EAAE+/F,OACjBL,EAAU,IAAGR,EAAa,GAAK,GACnCA,EAAa,IAAMl/F,EAAEggG,KAAkB,MAAXhgG,EAAEw+F,KAAe,GAAK,GAClDkB,EAAUj3F,KAAKijB,IAAI,EAAGg0E,QAEnB,IAAW,iBAAPhB,EAgCT,MAAM,IAAIv6D,MAAM,QAAUu6D,EAAK,mBA/B/B,IAAIuB,EAAQ5qF,WAAWvQ,EAAKhF,OAE5B,GAAc,OAAV+/F,EAEF,YADAX,EAAa,GAAKe,GAIpB,GAAiB,MAAbJ,EAAMlc,GAAY,CAEpB,GAAgB,IAAZ3jF,EAAE8/F,MAAa,MAAM,IAAI37D,MAAM,8BAEnC,KAAK,QAAU87D,IAAUA,GAAS,EAChC,MAAM,IAAI97D,MAAM,uCAGlB,IAAK,IAAI+7D,EAAMR,EAAU,EAAGQ,EAAMD,EAAOC,IACvChB,EAAagB,GAAO,EAMtB,OAHID,EAAQP,IAASR,EAAae,GAAS,GAC3Cf,EAAae,IAAUjgG,EAAEggG,KAAkB,MAAXhgG,EAAEw+F,KAAe,GAAK,QACtDkB,EAAUj3F,KAAKijB,IAAIu0E,EAAOP,IAI5B1/F,EAAEggG,IAAMC,EAEO,KAAXjgG,EAAE+/F,OACJb,EAAa,IAAMl/F,EAAEggG,KAAkB,MAAXhgG,EAAEw+F,KAAe,GAAK,KAzKxDoB,CAAS96F,EAAM,KAVP,CACR,IAAQ,EACR,KAAS,IAGT,KAAS,KAUT,IAHA,IACIq7F,EADAh+D,GAAQ,EAGHzkC,EAJTgiG,EAAUR,EAAazhG,OAAS,EAIVC,GAAK,EAAGA,IAC5B,GAAwB,IAApBwhG,EAAaxhG,GAAjB,CACA,IAAI2tD,EAAK,IAAI6zB,EAAa/8C,EAAQ+8D,EAAaxhG,GAAK+K,KAAK0F,IAAI+wF,EAAaxhG,KACtEimF,EAAKub,EAAaxhG,GAAK,EAAI,IAAM,IAErC,GAAIA,EAAI,EAAG,CAET,IAAI0iG,EAAK,IAAI3W,EAAWkW,GAExB,GAAIjiG,EAAI,EAAG,CACT,IAAI2iG,EAAK,IAAInhB,EAAaxhF,GAC1B0iG,EAAK,IAAI1c,EAAa,IAAK,MAAO,CAAC0c,EAAIC,IAIvCh1C,GADuB,IAArB6zC,EAAaxhG,IAAaykC,EACvB,IAAIuhD,EAAa,IAAK,aAAc,CAAC0c,IACH,IAA9B33F,KAAK0F,IAAI+wF,EAAaxhG,IAC1B0iG,EAEA,IAAI1c,EAAa,IAAK,WAAY,CAACr4B,EAAI+0C,IAK9CD,EADEh+D,EACGkpB,EACW,MAAPs4B,EACJ,IAAID,EAAa,IAAK,MAAO,CAACyc,EAAI90C,IAElC,IAAIq4B,EAAa,IAAK,WAAY,CAACyc,EAAI90C,IAG9ClpB,GAAQ,EAIV,OAAIA,EACK,IAAI+8C,EAAa,GAEjBihB,MC9tBT,GAAO,SACP,GAAe,CAAC,QAAS,UAClBG,IAA8B,EAAApsB,EAAA,IAAQ,GAAM,IAAe1jB,IACpE,IAAI,MACF+1B,EAAK,OACLkK,GACEjgC,EA6CJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,OAAO,IAAIkK,QCnDb,GAAe,CAAC,QAAS,SAAU,QAAS,WAAY,QAAS,SAAU,UAAW,eAAgB,eAAgB,eAAgB,kBAAmB,cAClJ8P,IAAkC,EAAArsB,EAAA,IAFlC,aAEgD,IAAe1jB,IACxE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,MACN13C,EAAK,SACLwqB,EAAQ,MACR05C,EAAK,OACLj1B,EAAM,QACNk4B,EAAO,aACPW,EAAY,aACZ2K,EAAY,aACZnG,EAAY,gBACZ5D,EAAe,WACf2J,GACEj5B,EAwCAmkC,EAAapO,EAAM,aAAc,CACnC,2BAA4B,SAA8B/R,EAAMgsB,EAAUvnC,GACxE,IAAIwnC,EAAa,GACjBC,EAASD,EAAYjsB,EAAMgsB,EAAS79F,MAEpC,IAAI81B,EAAMkoE,EAAYnsB,EAAMisB,GAE5B,OAAOxnC,EAAQr3B,SAAWA,EAASnJ,GAAOA,GAE5C,mBAAoB,SAAwB+7C,EAAMgsB,GAChD,OAAOx9F,KAAKwxE,EAAMgsB,EAAU,CAC1B5+D,UAAU,KAGd,qBAAsB,SAA0B4yC,EAAMgsB,GACpD,OAAOx9F,KAAKoU,EAAMo9D,GAAOgsB,IAE3B,6BAA8B,SAAgChsB,EAAMgsB,EAAUvnC,GAC5E,OAAOj2D,KAAKoU,EAAMo9D,GAAOgsB,EAAUvnC,IAErC,iBAAkB,SAAsBub,EAAMgsB,GAC5C,OAAOx9F,KAAKoU,EAAMo9D,GAAOp9D,EAAMopF,KAEjC,yBAA0B,SAA4BhsB,EAAMgsB,EAAUvnC,GACpE,OAAOj2D,KAAKoU,EAAMo9D,GAAOp9D,EAAMopF,GAAWvnC,IAE5C,eAAgB,SAAoBub,EAAMgsB,GACxC,OAAOx9F,KAAKwxE,EAAMp9D,EAAMopF,KAE1B,uBAAwB,SAA0BhsB,EAAMgsB,EAAUvnC,GAChE,OAAOj2D,KAAKwxE,EAAMp9D,EAAMopF,GAAWvnC,MAgBvC07B,EAAWiM,WAAY,EAEvBjM,EAAWpf,MAAQ,SAAUsrB,GAC3B,OAAOC,EAAU1vC,MAAM,KAAMyvC,EAAMxhE,OAKrC,IAAIyhE,EAAYva,EAAM,YAAa,CACjC,mBAAoB,SAAwB/R,EAAM3tE,GAChD,OAAI,EAAAiuE,EAAA,IAAeN,IAAgC,YAAvB,QAAOA,EAAK10E,OAC/BghG,EAAU1pF,EAAMo9D,EAAK10E,OAAO4C,WAAYmE,EAAEnE,WAAY,GAEtDo+F,EAAUtsB,EAAK9xE,WAAYmE,EAAEnE,WAAY,IAGpD,qBAAsB,SAA0B8xE,EAAM3tE,GACpD,GAAwB,YAApB,QAAOA,EAAE/G,OACX,OAAOghG,EAAUtsB,EAAMp9D,EAAMvQ,EAAE/G,QAE/B,MAAM,IAAIqkC,MAAM,kEAGpB,iCAAkC,SAAoCqwC,EAAM3tE,EAAGwnC,GAC7E,OAAOyyD,EAAUtsB,EAAK9xE,WAAYmE,EAAElE,KAAM0rC,EAAMvuC,QAElD,yBAA0B,SAA4B00E,EAAM3tE,EAAGwnC,GAS7D,OANc,IAAVA,EACE,aAAexnC,EAAI,IAEnB,OAASwnC,EAAQ,YAAcxnC,EAAI,KAAOwnC,EAAQ,MAG7C,UAAUnJ,OAAOsvC,EAAM,eAoBlCksB,EAAWna,EAAM,WAAY,CAC/B,+BAAgC,SAAkCka,EAAY37F,GAE5E,OADA27F,EAAW37F,IAAQ,GACZ,GAET,6BAA8B,SAAgC27F,EAAY37F,EAAMi8F,GAG9E,OAAIj8F,EAAKnC,OAASo+F,IAChBN,EAAW37F,IAAQ,GACZ,IAKX,kCAAmC,SAAqC27F,EAAY37F,EAAMi8F,GACxF,OAAOL,EAASD,EAAY37F,EAAKi7E,QAASghB,IAE5C,yCAA0C,SAA4CN,EAAY37F,EAAMi8F,GACtG,OAAsC,IAAlCj8F,EAAKwwB,OAAON,QAAQ+rE,IACtBN,EAAW37F,IAAQ,GACZ,GAGF47F,EAASD,EAAY37F,EAAK0vE,KAAMusB,IAEzC,8CAA+C,SAA8CN,EAAY37F,EAAMi8F,GAC7G,GAAIj8F,EAAKu6B,KAAK5hC,OAAS,EAAG,CAGxB,IAFA,IAAIujG,EAAUN,EAASD,EAAY37F,EAAKu6B,KAAK,GAAI0hE,GAExCrjG,EAAI,EAAGA,EAAIoH,EAAKu6B,KAAK5hC,SAAUC,EACtCsjG,EAAUN,EAASD,EAAY37F,EAAKu6B,KAAK3hC,GAAIqjG,IAAYC,EAG3D,GAAIA,EAEF,OADAP,EAAW37F,IAAQ,GACZ,EAIX,OAAO,KAWP67F,EAAcpa,EAAM,cAAe,CACrC,uBAAwB,SAA4BzhF,GAClD,OAAOm6E,EAAmB,IAE5B,qBAAsB,SAA0Bn6E,EAAM27F,GACpD,YAAyBt/F,IAArBs/F,EAAW37F,GACNm6E,EAAmB,GAGrBA,EAAmB,IAE5B,0BAA2B,SAA+Bn6E,EAAM27F,GAC9D,OAAO,IAAI3gB,EAAgB6gB,EAAY77F,EAAKi7E,QAAS0gB,KAEvD,iCAAkC,SAAsC37F,EAAM27F,GAC5E,YAAyBt/F,IAArBs/F,EAAW37F,GACNm6E,EAAmB,GAGrB0hB,EAAY77F,EAAK0vE,KAAMisB,IAEhC,uBAAwB,SAA4B37F,EAAM27F,GAKxD,GAJyB,IAArB37F,EAAKu6B,KAAK5hC,QAqWlB,SAAuBqH,GAErB,GAAmB,QAAdA,EAAKnC,MAAgC,YAAdmC,EAAKnC,MAAoC,QAAdmC,EAAKnC,MAAwC,IAArBmC,EAAKu6B,KAAK5hC,OAAzF,CAOA,IAAK,IAAIC,EAAI,EAAGA,EAAIoH,EAAKu6B,KAAK5hC,SAAUC,EACtCoH,EAAKu6B,KAAK3hC,GAAKuhF,EAAmB,GAIpC,MADAn6E,EAAKuvE,UAAU78D,WACT,IAAI2sB,MAAM,uCAlXZ88D,CAAcn8F,QAGS3D,IAArBs/F,EAAW37F,GACb,OAAOm6E,EAAmB,GAG5B,IACIqD,EAKA4e,EAkNAvd,EAAIj8D,EAxNJgxC,EAAO5zD,EAAKu6B,KAAK,GAEjBunB,GAAM,EAENu6C,GAAW,EAIf,OAAQr8F,EAAKnC,MACX,IAAK,OAEHikD,GAAM,EACNs6C,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAACzE,EAAmB,GAAI,IAAIyE,EAAa,IAAK,MAAO,CAAChrB,EAAM,IAAIgrB,EAAa,IAAK,SAAU,CAACzE,EAAmB,GAAIA,EAAmB,SAC1L,MAEF,IAAK,OACL,IAAK,UAEH,GAAyB,IAArBn6E,EAAKu6B,KAAK5hC,OACZmpD,GAAM,EACNs6C,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAACzE,EAAmB,GAAI,IAAI4K,EAAa,OAAQ,CAACnxB,WAChG,GAAyB,IAArB5zD,EAAKu6B,KAAK5hC,OAKnB,OADAgjG,EAFAne,EAAO,IAAIoB,EAAa,IAAK,SAAU,CAACzE,EAAmB,GAAIn6E,EAAKu6B,KAAK,MAEtDohE,EAAW37F,EAAKu6B,KAAK,IACjCshE,EAAY,IAAIjd,EAAa,IAAK,MAAO,CAAChrB,EAAM4pB,IAAQme,GAGjE,MAEF,IAAK,QACHne,EAAOrD,EAAmB,IAI5B,IAAK,MACH,GAAKqD,GAA6B,IAArBx9E,EAAKu6B,KAAK5hC,QAIhB,GAAyB,IAArBqH,EAAKu6B,KAAK5hC,QAAgB6kF,GAA6B,IAArBx9E,EAAKu6B,KAAK5hC,aAA6C0D,IAA7Bs/F,EAAW37F,EAAKu6B,KAAK,IAE1F6hE,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAChrB,EAAKjJ,QAAS,IAAIo6B,EAAa,MAAO,CAACvH,GAAQx9E,EAAKu6B,KAAK,OAC7GunB,GAAM,OACD,GAAyB,IAArB9hD,EAAKu6B,KAAK5hC,OAEnB,OAAOkjG,EAAY,IAAIjd,EAAa,IAAK,SAAU,CAAC,IAAImG,EAAa,MAAO,CAACnxB,IAAQ,IAAImxB,EAAa,MAAO,CAAC/kF,EAAKu6B,KAAK,OAAQohE,QARhIS,EAAiBxoC,EAAKjJ,QACtB7I,GAAM,EAUR,MAEF,IAAK,MAGH,OAFA65C,EAAWne,GAAQme,EAAW37F,EAAKu6B,KAAK,IAEjCshE,EAAY,IAAIjd,EAAa,IAAK,MAAO,CAAChrB,EAAM5zD,EAAKu6B,KAAK,KAAMohE,GAEzE,IAAK,MAEHS,EAAiB,IAAIrX,EAAa,MAAO,CAACnxB,EAAKjJ,UAC/C,MAEF,IAAK,MAEHyxC,EAAiB,IAAIrX,EAAa,MAAO,CAACnxB,EAAKjJ,UAC/C,MAEF,IAAK,MAEHyxC,EAAiB,IAAIxd,EAAa,IAAK,aAAc,CAAC,IAAImG,EAAa,MAAO,CAACnxB,EAAKjJ,YACpF,MAEF,IAAK,MAEHyxC,EAAiB,IAAIxd,EAAa,IAAK,MAAO,CAAC,IAAImG,EAAa,MAAO,CAACnxB,EAAKjJ,UAAWwvB,EAAmB,KAC3G,MAEF,IAAK,MAEHiiB,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAC5+E,EAAM,IAAI+kF,EAAa,MAAO,CAACnxB,EAAKjJ,YACxF,MAEF,IAAK,MAEH0xC,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAC5+E,EAAM,IAAI+kF,EAAa,MAAO,CAACnxB,EAAKjJ,YACxF,MAEF,IAAK,MAEH0xC,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,MAAO,CAAC,IAAImG,EAAa,MAAO,CAACnxB,EAAKjJ,UAAWwvB,EAAmB,KAC3G,MAEF,IAAK,OAEHr4B,GAAM,EACNs6C,EAAiB,IAAIrX,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,WAAY,CAACzE,EAAmB,GAAI,IAAIyE,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,SACpK,MAEF,IAAK,OAEHr4B,GAAM,EACNu6C,GAAW,EACXD,EAAiB,IAAIrX,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,WAAY,CAACzE,EAAmB,GAAI,IAAIyE,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,SACpK,MAEF,IAAK,OAEHr4B,GAAM,EACNs6C,EAAiB,IAAIxd,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,KAAMA,EAAmB,KACvI,MAEF,IAAK,OAEHr4B,GAAM,EACNs6C,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAC,IAAImG,EAAa,MAAO,CAACnxB,EAAKjJ,UAAW,IAAIo6B,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,KAAMA,EAAmB,SAClP,MAEF,IAAK,OAEHr4B,GAAM,EACNu6C,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAC,IAAImG,EAAa,MAAO,CAACnxB,EAAKjJ,UAAW,IAAIo6B,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,KAAMA,EAAmB,SAClP,MAEF,IAAK,OAEHr4B,GAAM,EACNu6C,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,KAAMA,EAAmB,KACvI,MAEF,IAAK,OAEHiiB,EAAiB,IAAIrX,EAAa,OAAQ,CAACnxB,EAAKjJ,UAChD,MAEF,IAAK,OAEHyxC,EAAiB,IAAIrX,EAAa,OAAQ,CAACnxB,EAAKjJ,UAChD,MAEF,IAAK,OAEHyxC,EAAiB,IAAIxd,EAAa,IAAK,MAAO,CAAC,IAAImG,EAAa,OAAQ,CAACnxB,EAAKjJ,UAAWwvB,EAAmB,KAC5G,MAEF,IAAK,OAEHkiB,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAC5+E,EAAM,IAAI+kF,EAAa,OAAQ,CAACnxB,EAAKjJ,YACzF,MAEF,IAAK,OAEH0xC,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAC5+E,EAAM,IAAI+kF,EAAa,OAAQ,CAACnxB,EAAKjJ,YACzF,MAEF,IAAK,OAEH0xC,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,MAAO,CAAC,IAAImG,EAAa,OAAQ,CAACnxB,EAAKjJ,UAAWwvB,EAAmB,KAC5G,MAEF,IAAK,QAEHr4B,GAAM,EACNs6C,EAAiB,IAAIrX,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,KAAMA,EAAmB,OACjK,MAEF,IAAK,QAEHr4B,GAAM,EACNs6C,EAAiB,IAAIrX,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,KAAMA,EAAmB,OACtK,MAEF,IAAK,QAEHr4B,GAAM,EACNs6C,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAACzE,EAAmB,GAAI,IAAIyE,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,OAC1I,MAEF,IAAK,QAEHr4B,GAAM,EACNu6C,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAChrB,EAAKjJ,QAAS,IAAIo6B,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,WAAY,CAACzE,EAAmB,GAAI,IAAIyE,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,WACrN,MAEF,IAAK,QAEHr4B,GAAM,EACNu6C,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAAC,IAAImG,EAAa,MAAO,CAACnxB,EAAKjJ,UAAW,IAAIo6B,EAAa,OAAQ,CAAC,IAAInG,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,KAAMA,EAAmB,SAC7O,MAEF,IAAK,QAEHr4B,GAAM,EACNu6C,GAAW,EACXD,EAAiB,IAAIxd,EAAa,IAAK,WAAY,CAACzE,EAAmB,GAAI,IAAIyE,EAAa,IAAK,MAAO,CAAChrB,EAAKjJ,QAASwvB,EAAmB,OAC1I,MAEF,IAAK,MAEHiiB,EAAiB,IAAIxd,EAAa,IAAK,SAAU,CAAC,IAAImG,EAAa,IAAIJ,EAAW,OAAQ,CAAC/wB,EAAKjJ,UAAWiJ,EAAKjJ,UAChH,MAEF,IAAK,QAEL,QACE,MAAM,IAAItrB,MAAM,aAAer/B,EAAKnC,KAAO,8EAK3CikD,GACF+8B,EAAK,IACLj8D,EAAO,WAEPi8D,EAAK,IACLj8D,EAAO,YAOT,IAAI05E,EAAkBT,EAAYjoC,EAAM+nC,GAMxC,OAJIU,IACFC,EAAkB,IAAI1d,EAAa,IAAK,aAAc,CAAC0d,KAGlD,IAAI1d,EAAaC,EAAIj8D,EAAM,CAAC05E,EAAiBF,KAEtD,uBAAwB,SAA4Bp8F,EAAM27F,GACxD,QAAyBt/F,IAArBs/F,EAAW37F,GACb,OAAOm6E,EAAmB,GAG5B,GAAgB,MAAZn6E,EAAK6+E,GAEP,OAAO,IAAID,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI/8C,EAAKu6B,KAAK1lB,KAAI,SAAUmtB,GAChE,OAAO65D,EAAY75D,EAAK25D,OAI5B,GAAgB,MAAZ37F,EAAK6+E,GAAY,CAEnB,GAAI7+E,EAAKsgF,UACP,OAAO,IAAI1B,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC8+C,EAAY77F,EAAKu6B,KAAK,GAAIohE,KAIvE,GAAI37F,EAAKw+C,WACP,OAAO,IAAIogC,EAAa5+E,EAAK6+E,GAAI7+E,EAAK+8C,GAAI,CAAC8+C,EAAY77F,EAAKu6B,KAAK,GAAIohE,GAAaE,EAAY77F,EAAKu6B,KAAK,GAAIohE,KAIhH,GAAgB,MAAZ37F,EAAK6+E,GAAY,CAEnB,IAAI0d,EAAgBv8F,EAAKu6B,KAAKlvB,QAAO,SAAU22B,GAC7C,YAA2B3lC,IAApBs/F,EAAW35D,MAGpB,GAAIu6D,EAAc5jG,OAAS,EAAG,CAC5B,IAAI6jG,EAAmBx8F,EAAKu6B,KAAKlvB,QAAO,SAAU22B,GAChD,YAA2B3lC,IAApBs/F,EAAW35D,MAEhBy6D,EAA8C,IAA5BD,EAAiB7jG,OAAe6jG,EAAiB,GAAK,IAAI5d,EAAa,IAAK,WAAY4d,GAC1GE,EAAUH,EAAcn8D,OAAOy7D,EAAYY,EAAiBd,IAChE,OAAO,IAAI/c,EAAa,IAAK,WAAY8d,GAI3C,OAAO,IAAI9d,EAAa,IAAK,MAAO5+E,EAAKu6B,KAAK1lB,KAAI,SAAU8nF,GAC1D,OAAO,IAAI/d,EAAa,IAAK,WAAY5+E,EAAKu6B,KAAK1lB,KAAI,SAAU+nF,GAC/D,OAAOA,IAAaD,EAAWd,EAAYe,EAAUjB,GAAciB,EAASjyC,gBAKlF,GAAgB,MAAZ3qD,EAAK6+E,IAAc7+E,EAAKw+C,WAAY,CACtC,IAAIoV,EAAO5zD,EAAKu6B,KAAK,GACjBijD,EAAOx9E,EAAKu6B,KAAK,GAErB,YAAyBl+B,IAArBs/F,EAAWne,GACN,IAAIoB,EAAa,IAAK,SAAU,CAACid,EAAYjoC,EAAM+nC,GAAane,SAIhDnhF,IAArBs/F,EAAW/nC,GACN,IAAIgrB,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,aAAc,CAAChrB,IAAQ,IAAIgrB,EAAa,IAAK,SAAU,CAACid,EAAYre,EAAMme,GAAa,IAAI/c,EAAa,IAAK,MAAO,CAACpB,EAAK7yB,QAASwvB,EAAmB,SAIjN,IAAIyE,EAAa,IAAK,SAAU,CAAC,IAAIA,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,WAAY,CAACid,EAAYjoC,EAAM+nC,GAAane,EAAK7yB,UAAW,IAAIi0B,EAAa,IAAK,WAAY,CAAChrB,EAAKjJ,QAASkxC,EAAYre,EAAMme,OAAiB,IAAI/c,EAAa,IAAK,MAAO,CAACpB,EAAK7yB,QAASwvB,EAAmB,OAGlT,GAAgB,MAAZn6E,EAAK6+E,IAAc7+E,EAAKw+C,WAAY,CACtC,IAAIq+C,EAAO78F,EAAKu6B,KAAK,GACjBuiE,EAAQ98F,EAAKu6B,KAAK,GAEtB,QAAyBl+B,IAArBs/F,EAAWkB,GAEb,OAAI,EAAA7sB,EAAA,IAAe6sB,KAAUt7C,EAAOs7C,EAAK7hG,QAAUw7E,EAAMqmB,EAAK7hG,MAAO,IAC5Dm/E,EAAmB,GAIrB,IAAIyE,EAAa,IAAK,WAAY,CAAC5+E,EAAM,IAAI4+E,EAAa,IAAK,WAAY,CAAC,IAAImG,EAAa,MAAO,CAAC8X,EAAKlyC,UAAWkxC,EAAYiB,EAAMnyC,QAASgxC,OAGzJ,QAA0Bt/F,IAAtBs/F,EAAWmB,GAAsB,CACnC,IAAI,EAAA9sB,EAAA,IAAe8sB,GAAQ,CAEzB,GAAIv7C,EAAOu7C,EAAM9hG,OACf,OAAOm/E,EAAmB,GAI5B,GAAI3D,EAAMsmB,EAAM9hG,MAAO,GACrB,OAAO6gG,EAAYgB,EAAMlB,GAK7B,IAAIoB,EAAc,IAAIne,EAAa,IAAK,MAAO,CAACie,EAAKlyC,QAAS,IAAIi0B,EAAa,IAAK,WAAY,CAACke,EAAO3iB,EAAmB,OAC3H,OAAO,IAAIyE,EAAa,IAAK,WAAY,CAACke,EAAMnyC,QAAS,IAAIi0B,EAAa,IAAK,WAAY,CAACid,EAAYgB,EAAMlB,GAAaoB,MAI7H,OAAO,IAAIne,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACie,EAAKlyC,QAASmyC,EAAMnyC,UAAW,IAAIi0B,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,WAAY,CAACid,EAAYgB,EAAMlB,GAAa,IAAI/c,EAAa,IAAK,SAAU,CAACke,EAAMnyC,QAASkyC,EAAKlyC,YAAa,IAAIi0B,EAAa,IAAK,WAAY,CAACid,EAAYiB,EAAOnB,GAAa,IAAI5W,EAAa,MAAO,CAAC8X,EAAKlyC,gBAG5W,MAAM,IAAItrB,MAAM,aAAer/B,EAAK6+E,GAAK,iFAoC7C,SAAS1E,EAAmBn/E,EAAOgiG,GACjC,OAAO,IAAI5iB,EAAaX,EAAQz+E,EAAOgiG,GAAahzC,EAAO0gB,SAG7D,OAAOmlB,K,WCrmBL,GAAe,CAAC,QAAS,aASlBoN,IAAsC,EAAA7tB,EAAA,IAVtC,QAUoD,IAAe1jB,IAC5E,IAAI,MACF+1B,EAAK,UACL9uE,GACE+4C,EACAY,GAAQ,QAAY,CACtBm1B,QACA9uE,cAGF,OAAO8uE,EAAM,QAAS,CACpB,SAAU,SAAalnD,GAErB,IAAI2iE,EAAM3iE,EAAK,IAEX,EAAAy1C,EAAA,IAASktB,GACX3iE,EAAK,GAAK2iE,EAAM,GACP,EAAAltB,EAAA,IAAYktB,KACrB3iE,EAAK,GAAK2iE,EAAIn7D,MAAM,IAGtB,IACE,OAAOuqB,EAAMA,MAAM,KAAM/xB,GACzB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,SCjChB,SAASC,GAAwBzf,EAAY9N,EAAMP,GAExD,IAAI5uE,EAASi9E,EAAWtyE,QAAO,SAAUrL,GACvC,OAAO,EAAAgwE,EAAA,IAAahwE,MAAWA,EAAKnC,QAAQgyE,MAAW7vE,EAAKnC,QAAQyxE,MACnE,GAEH,IAAK5uE,EACH,MAAM,IAAI2+B,MAAM,qDAAuDs+C,EAAa,KAItF,IAAI9/E,EAAO6C,EAAO7C,KAEdw/F,EAAWxjG,OAAO2B,OAAO8zE,GACzB5tB,EAAKi8B,EAAWpO,UACpB,OAAO,SAA0BxtE,GAE/B,OADAs7F,EAASx/F,GAAQkE,EACV2/C,EAAGhvC,SAAS2qF,ICtBvB,IACI,GAAe,CAAC,SACTC,IAAuC,EAAAluB,EAAA,IAFvC,SAEqD,IAAe1jB,IAC7E,IAAI,MACF+1B,GACE/1B,EASJ,SAAS6xC,EAAgBhjE,EAAMs1C,EAAMP,GACnC,IAAIvtE,EAAGqQ,EAgBP,OAdImoB,EAAK,KACPx4B,EAAIw4B,EAAK,GAAGg1C,UAAU78D,SAAS48D,IAG7B/0C,EAAK,KAGLnoB,GAFE,EAAA49D,EAAA,IAAaz1C,EAAK,MAAO,EAAAy1C,EAAA,IAAyBz1C,EAAK,IAE9CA,EAAK,GAAGg1C,UAAU78D,SAAS48D,GAG3B8tB,GAAwB7iE,EAAK,GAAIs1C,EAAMP,IAI/CjkE,EAAOtJ,EAAGqQ,GAGnBmrF,EAAgBtY,SAAU,EAE1B,IAAI55E,EAASo2E,EAAM,SAAU,CAC3B,kBAAmB+b,GACnB,mBAAoB,SAAwBz7F,EAAGjE,GAC7C,OAAOiE,EAAEvG,OAAOgiG,GAAQz7F,EAAE07F,UAAW3/F,KAEvC,gBAAiB,KACjB,iBAAkB,SAAsBiE,EAAGjE,GACzC,OAAOiE,EAAEvG,QAAO,QAAauG,EAAE07F,UAAW3/F,OAG9C,OAAOy/F,IACN,CACDJ,qBAAqB,IAavB,SAASK,GAAQz7F,EAAGqQ,GAElB,IAAImoB,GAAO,SAAiBnoB,GAC5B,OAAO,QAAOrQ,GAAG,SAAU/G,EAAOgiC,EAAOs6B,GAEvC,OAAa,IAAT/8B,EACKnoB,EAASpX,GACE,IAATu/B,EACFnoB,EAASpX,EAAO,CAACgiC,EAAQ,IAGzB5qB,EAASpX,EAAO,CAACgiC,EAAQ,GAAIs6B,MCxE1C,IACI,GAAe,CAAC,SACTomC,IAAoC,EAAAtuB,EAAA,IAFpC,MAEkD,IAAe1jB,IAC1E,IAAI,MACF+1B,GACE/1B,EAQJ,SAASiyC,EAAapjE,EAAMs1C,EAAMP,GAChC,IAAIvtE,EAAGqQ,EAgBP,OAdImoB,EAAK,KACPx4B,EAAIw4B,EAAK,GAAGg1C,UAAU78D,SAAS48D,IAG7B/0C,EAAK,KAGLnoB,GAFE,EAAA49D,EAAA,IAAaz1C,EAAK,MAAO,EAAAy1C,EAAA,IAAyBz1C,EAAK,IAE9CA,EAAK,GAAGg1C,UAAU78D,SAAS48D,GAG3B8tB,GAAwB7iE,EAAK,GAAIs1C,EAAMP,IAI/Cz6D,EAAI9S,EAAGqQ,GAGhBurF,EAAa1Y,SAAU,EAEvB,IAAIpwE,EAAM4sE,EAAM,MAAO,CACrB,kBAAmB,SAAuB1/E,EAAGqQ,GAC3C,OAAO+B,GAAKpS,EAAGqQ,EAAUrQ,IAE3B,mBAAoB,SAAwBA,EAAGqQ,GAC7C,OAAOrQ,EAAEvG,OAAO2Y,GAAKpS,EAAEslD,UAAWj1C,EAAUrQ,OAGhD,OAAO47F,IACN,CACDR,qBAAqB,IAWvB,SAAShpF,GAAKmjD,EAAOllD,EAAUwrF,GAE7B,IAAIC,GAAY,SAAiBzrF,GAqBjC,OAnBA,SAAS0rF,EAAQ9iG,EAAOgiC,GACtB,OAAIlkC,MAAMgD,QAAQd,IACT,QAAIA,GAAO,SAAUwzC,EAAO51C,GAEjC,OAAOklG,EAAQtvD,EAAOxR,EAAMoD,OAAOxnC,EAAI,OAIvB,IAAdilG,EACKzrF,EAASpX,GACO,IAAd6iG,EACFzrF,EAASpX,EAAOgiC,GAGhB5qB,EAASpX,EAAOgiC,EAAO4gE,GAK7BE,CAAQxmC,EAAO,IC/ExB,IACI,GAAe,CAAC,SACTymC,IAAwC,EAAA3uB,EAAA,IAFxC,UAEsD,IAAe1jB,IAC9E,IAAI,MACF+1B,GACE/1B,EAQJ,SAASsyC,EAAiBzjE,EAAMs1C,EAAMP,GACpC,IAAIvtE,EAAGqQ,EAgBP,OAdImoB,EAAK,KACPx4B,EAAIw4B,EAAK,GAAGg1C,UAAU78D,SAAS48D,IAG7B/0C,EAAK,KAGLnoB,GAFE,EAAA49D,EAAA,IAAaz1C,EAAK,MAAO,EAAAy1C,EAAA,IAAyBz1C,EAAK,IAE9CA,EAAK,GAAGg1C,UAAU78D,SAAS48D,GAG3B8tB,GAAwB7iE,EAAK,GAAIs1C,EAAMP,IAI/C2uB,EAASl8F,EAAGqQ,GAGrB4rF,EAAiB/Y,SAAU,EAE3B,IAAIgZ,EAAWxc,EAAM,UAAW,CAC9B,2BAA4B,SAA6BnqB,EAAOllD,GAE9D,IAAImoB,GAAO,SAAiBnoB,IAEd,SAAS0rF,EAAQ9iG,EAAOgiC,GAChClkC,MAAMgD,QAAQd,IAChB,QAAQA,GAAO,SAAUwzC,EAAO51C,GAE9BklG,EAAQtvD,EAAOxR,EAAMoD,OAAOxnC,EAAI,OAIrB,IAAT2hC,EACFnoB,EAASpX,GACS,IAATu/B,EACTnoB,EAASpX,EAAOgiC,GAGhB5qB,EAASpX,EAAOgiC,EAAOs6B,GAK7BwmC,CAAQxmC,EAAMjQ,UAAW,OAI7B,OAAO22C,IACN,CACDb,qBAAqB,I,WClEnB,GAAe,CAAC,QAAS,UAClBe,IAAuC,EAAA9uB,EAAA,IAFvC,SAEqD,IAAe1jB,IAC7E,IAAI,MACF+1B,EAAK,OACLl4E,GACEmiD,EACAn9B,GAAS,QAAa,CACxBkzD,QACAl4E,WASF,OAAOk4E,EAAM,SAAU,CACrB,SAAU,SAAalnD,GACrB,IACE,OAAOhM,EAAO+9B,MAAM,KAAM/xB,GAC1B,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,IC5BnB,GAAe,CAAC,SACTgB,IAAsC,EAAA/uB,EAAA,IAFtC,QAEoD,IAAe1jB,IAC5E,IAAI,MACF0yC,GACE1yC,EAQJ,OAAO,WAGL,IAFA,IAAInxB,EAAO,GAEF3hC,EAAI,EAAGylG,EAAKngE,UAAUvlC,OAAQC,EAAIylG,EAAIzlG,IAAK,CAClD,IAAIopC,EAAM9D,UAAUtlC,GAEpB,IAAI,EAAAo3E,EAAA,IAAQhuC,GACVA,EAAIpxB,QACJoxB,EAAInxB,KAAOmxB,EAAIrF,KAAO,EAAI,EAAI,OACzB,GAAIqF,IAAqB,IAAdA,EAAI+3B,MACpB/3B,EAAMA,EAAIntB,KAAI,SAAU/U,GACtB,OAAOA,EAAI,UAER,IAAI,EAAAkwE,EAAA,IAAQhuC,KAAQ,EAAAguC,EAAA,IAAShuC,GAClCA,EAAMA,EAAIntB,KAAI,SAAU/U,GACtB,OAAOA,EAAI,UAER,IAAI,EAAAkwE,EAAA,IAAShuC,GAClBA,SACK,IAAI,EAAAguC,EAAA,IAAYhuC,GACrBA,EAAMA,EAAI2kB,WAAa,OAClB,GAAmB,iBAAR3kB,EAEhB,MAAM,IAAI3oC,UAAU,gEAGtBkhC,EAAK3hC,GAAKopC,EAGZ,IAAIrO,EAAM,IAAIyqE,EAEd,OADAA,EAAM9xC,MAAM34B,EAAK4G,GACV5G,KAER,CACDwpE,qBAAqB,I,WC5CnB,GAAe,CAAC,QAAS,SAAU,aAC5BmB,IAAuC,EAAAlvB,EAAA,IAFvC,SAEqD,IAAe1jB,IAC7E,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,UACNoJ,GACE+4C,EACAtrB,GAAS,QAAa,CACxBqhD,QACAl4E,SACAoJ,cAUF,OAAO8uE,EAAM,SAAU,CACrB,SAAU,SAAalnD,GAErB,IAAIinC,EAAYjnC,EAAK5hC,OAAS,EAC1BqzC,EAAOzR,EAAKinC,IAEZ,EAAAwO,EAAA,IAAShkC,GACXzR,EAAKinC,GAAax1B,EAAO,GAChB,EAAAgkC,EAAA,IAAYhkC,KACrBzR,EAAKinC,GAAax1B,EAAKjK,MAAM,IAG/B,IACE,OAAO3B,EAAOksB,MAAM,KAAM/xB,GAC1B,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WCxChB,SAASoB,GAAkBhkE,GAChC,GAAoB,IAAhBA,EAAK5hC,SAAgB,EAAAq3E,EAAA,IAAaz1C,EAAK,IAAK,CAE9C,IAAI2iE,GADJ3iE,EAAOA,EAAKv9B,SACG,IAEX,EAAAgzE,EAAA,IAASktB,GACX3iE,EAAK,GAAK2iE,EAAM,GACP,EAAAltB,EAAA,IAAYktB,KACrB3iE,EAAK,GAAK2iE,EAAIn7D,MAAM,IAIxB,OAAOxH,ECbT,IACI,GAAe,CAAC,QAAS,SAAU,UAAW,UACvCikE,IAAoC,EAAApvB,EAAA,IAFpC,MAEkD,IAAe1jB,IAC1E,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNyvB,EAAO,OACP9C,GACEjrB,EACA9kC,GAAM,QAAU,CAClB66D,QACAz3B,SACAyvB,UACA9C,WAUF,OAAO8K,EAAM,MAAO,CAClB,SAAU,SAAalnD,GACrBA,EAAOgkE,GAAkBhkE,GAEzB,IACE,OAAO3T,EAAI0lC,MAAM,KAAM/xB,GACvB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WClCnB,GAAe,CAAC,QAAS,SAAU,UAAW,WACvCsB,IAAoC,EAAArvB,EAAA,IAFpC,MAEkD,IAAe1jB,IAC1E,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNyvB,EAAO,QACP/C,GACEhrB,EACAhlC,GAAM,QAAU,CAClB+6D,QACAz3B,SACAyvB,UACA/C,YAUF,OAAO+K,EAAM,MAAO,CAClB,SAAU,SAAalnD,GACrBA,EAAOgkE,GAAkBhkE,GAEzB,IACE,OAAO7T,EAAI4lC,MAAM,KAAM/xB,GACvB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WC1BnB,GAAe,CAAC,QAAS,SAAU,MAAO,WACnCuB,IAAoC,EAAAtvB,EAAA,IAFpC,MAEkD,IAAe1jB,IAC1E,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,IACNxxC,EAAG,QACHihE,GACE/tB,EACAvb,GAAM,QAAU,CAClBsxC,QACAz3B,SACAxxC,MACAihE,YAEF,OAAOgI,EAfE,MAeU,CACjB,SAAU,SAAalnD,GACrBA,EAAOgkE,GAAkBhkE,GAEzB,IACE,OAAO4V,EAAImc,MAAM,KAAM/xB,GACvB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WClCnB,GAAe,CAAC,QAAS,QAAS,SAAU,SASrCwB,IAAuC,EAAAvvB,EAAA,IAVvC,SAUqD,IAAe1jB,IAC7E,IAAI,MACF+1B,EAAK,MACL2c,EAAK,OACL70F,EAAM,MACNmnB,GACEg7B,EACAklC,GAAS,QAAa,CACxBnP,QACA2c,QACA70F,SACAmnB,UAGF,OAAO+wD,EAAM,SAAU,CACrB,SAAU,SAAalnD,GAErB,IAAIinC,EAAYjnC,EAAK5hC,OAAS,EAC1BqzC,EAAOzR,EAAKinC,IAEZ,EAAAwO,EAAA,IAAShkC,KACXzR,EAAKinC,GAAax1B,EAAO,GAG3B,IACE,OAAO4kD,EAAOtkC,MAAM,KAAM/xB,GAC1B,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WC3CnB,GAAe,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,YACvFyB,IAAsC,EAAAxvB,EAAA,IAFtC,QAEoD,IAAe1jB,IAC5E,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,UACNowE,EAAS,QACTjD,EAAO,UACPE,EAAS,OACTD,EAAM,SACNE,GACEnrB,EACAh7B,GAAQ,QAAY,CACtB+wD,QACAz3B,SACAzgD,SACAowE,YACAjD,UACAE,YACAD,SACAE,aASF,OAAO4K,EAAM,QAAS,CACpB,SAAU,SAAalnD,GASrB,MALoB,kBAFTA,EADKA,EAAK5hC,OAAS,IAK5B4hC,EAAK79B,MAAK,GAGLg0B,EAAM47B,MAAM,KAAM/xB,QAG5B,CACD4iE,qBAAqB,I,WC1CnB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAAY,SAAU,aAClD0B,IAAqC,EAAAzvB,EAAA,IAAQ,GAAM,IAAe1jB,IAC3E,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,SACNo+C,EAAQ,OACR+iB,EAAM,UACNiP,GACEjuB,EACA9/C,GAAO,QAAW,CACpB61E,QACAl4E,SACAo+C,WACA+iB,SACAiP,cASF,OAAO8H,EAAM,GAAM,CACjB,SAAU,SAAalnD,GACrBA,EAAOgkE,GAAkBhkE,GAEzB,IACE,OAAO3uB,EAAK0gD,MAAM,KAAM/xB,GACxB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WCnCnB,GAAe,CAAC,QAAS,QAAS,SAAU,SASrC2B,IAAoC,EAAA1vB,EAAA,IAVpC,MAUkD,IAAe1jB,IAC1E,IAAI,MACF+1B,EAAK,MACL2c,EAAK,OACL70F,EAAM,MACNmnB,GACEg7B,EACAm+B,GAAM,QAAU,CAClBpI,QACA2c,QACA70F,SACAmnB,UAGF,OAAO+wD,EAAM,MAAO,CAClB,SAAU,SAAalnD,GAErB,IAAIinC,EAAYjnC,EAAK5hC,OAAS,EAC1BqzC,EAAOzR,EAAKinC,IAEZ,EAAAwO,EAAA,IAAShkC,KACXzR,EAAKinC,GAAax1B,EAAO,GAG3B,IACE,OAAO69C,EAAIv9B,MAAM,KAAM/xB,GACvB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WCzCnB,GAAe,CAAC,QAAS,MAAO,UACzB4B,IAAqC,EAAA3vB,EAAA,IAFrC,OAEmD,IAAe1jB,IAC3E,IAAI,MACF+1B,EAAK,IACLjpE,EAAG,OACHipC,GACEiK,EACA5qD,GAAO,QAAW,CACpB2gF,QACAjpE,MACAipC,WAUF,OAAOggC,EAAM,OAAQ,CACnB,SAAU,SAAalnD,GACrBA,EAAOgkE,GAAkBhkE,GAEzB,IACE,OAAOz5B,EAAKwrD,MAAM,KAAM/xB,GACxB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WCjCnB,GAAO,WACP,GAAe,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,SASpE6B,IAAyC,EAAA5vB,EAAA,IAAQ,GAAM,IAAe1jB,IAC/E,IAAI,MACF+1B,EAAK,IACLjpE,EAAG,SACHmvC,EAAQ,SACR98C,EAAQ,OACR42C,EAAM,MACN6K,EAAK,MACLtnD,GACE0mD,EACAktB,GAAW,QAAe,CAC5B6I,QACAjpE,MACAmvC,WACA98C,WACA42C,SACA6K,QACAtnD,UAEF,OAAOy8E,EAAM,GAAM,CACjB,SAAU,SAAalnD,GACrBA,EAAOgkE,GAAkBhkE,GAEzB,IACE,OAAOq+C,EAAStsB,MAAM,KAAM/xB,GAC5B,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WCxCnB,GAAe,CAAC,QAAS,OAAQ,YAS1B8B,IAAoC,EAAA7vB,EAAA,IAVpC,MAUkD,IAAe1jB,IAC1E,IAAI,MACF+1B,EAAK,KACLx5E,EAAI,SACJ2wE,GACEltB,EACAonC,GAAM,QAAU,CAClBrR,QACAx5E,OACA2wE,aAEF,OAAO6I,EAAM,MAAO,CAClB,SAAU,SAAalnD,GACrBA,EAAOgkE,GAAkBhkE,GAEzB,IACE,OAAOu4D,EAAIxmC,MAAM,KAAM/xB,GACvB,MAAO59B,GACP,MAAM0lF,EAAe1lF,SAI1B,CACDwgG,qBAAqB,I,WCrCvB,SAAS,KAA2Q,OAA9P,GAAWtjG,OAAOk6B,QAAU,SAAUx6B,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAS5U,UAAUtlC,GAAI,IAAK,IAAImB,KAAO+4C,EAAcj5C,OAAOM,UAAUQ,eAAeC,KAAKk4C,EAAQ/4C,KAAQR,EAAOQ,GAAO+4C,EAAO/4C,IAAY,OAAOR,IAA2B+yD,MAAMpuD,KAAMggC,WAUhT,IAAI2xC,GAAO,GAEPR,GAAoB,GAEpBwO,GAAU,GAEH5/D,GAAOkxD,EAAW,CAC3BE,uBAES2B,GAAYD,EAAgB,CACrC9yD,UAES2zD,GAAYF,EAAgB,CACrCzzD,QACA0zD,UAAS,SAEAyI,GAAeD,EAAmB,CAC3Cl8D,UAESu8D,GAAaD,EAAiB,CACvCt8D,UAES+8D,GAAkBD,EAAsB,CACjD98D,UAES29D,GAAiBW,EAAqB,CAC/Ct+D,UAESk/D,GAAQD,EAAiB,CAClCrN,UAESvxC,GAAUw/C,EAAc,CACjCD,aAESvC,GAAkByC,EAAsB,CACjD9/D,UAES2gE,GAAeD,EAAmB,CAC3C1gE,UAES49D,GAAYkF,EAAgB,CACrC9iE,UAESo9D,GAAyBmG,EAA6B,CAC/DvjE,QACAwjE,MAAK,SAEIyd,GAAQ/c,EAAY,CAC7BhF,SACAsE,MAAK,SAEIoB,GAAeF,GAAmB,CAC3C1kE,QACAsQ,OAAM,SAEG40D,GAAYF,GAAgB,CACrChlE,QACAilE,MAAK,OACLtjE,KAAI,SAEKw7D,GAAiB2I,GAAqB,CAC/Cx6E,OAAM,OACN0U,QACAsQ,OAAM,SAEGo2D,GAAaH,GAAiB,CACvCC,KAAI,OACJxmE,QACA4xD,UAESkV,GAAeD,GAAmB,CAC3C7mE,QACA0mE,cACA9U,UAESv9D,GAAQwzE,GAAY,CAC7BjD,gBACA7R,aACAoK,kBACAxJ,aACA0J,mBACAlB,gBACAiB,0BACA0J,gBACA5B,aACA3I,cACAoE,gBACA5D,mBACAa,aACAD,kBACA+I,cACA36B,OAAM,IACNyvB,QAAO,OACPgI,MAAK,SAEI/uE,GAAWw4E,GAAe,CACnC54E,SACAmvE,MAAK,SAEI2J,GAAOD,GAAgB,CAChC74E,WAESq5E,GAASD,GAAkB,CACpCp5E,WAESq+E,GAAO4C,GAAW,CAC3BnI,QACA/b,qBACAoS,MAAK,SAEIlS,GAAUmkB,GAAc,CACjCphF,SACAmvE,MAAK,SAEI3kD,GAAWq5D,GAAe,CACnCxc,UAAS,OACTyS,SAAQ,OACRhS,gBACA2K,gBACAnG,gBACA5D,mBACA2J,cACAnsE,IAAG,OACHwxC,OAAM,IACNvI,OAAM,OACN+0B,MAAK,OACLj1B,OAAM,OACN8tB,qBACAxkE,SAAQ,OACRyH,SACAxB,IAAG,OACH62C,SAAQ,OACR85B,MAAK,SAEIyO,GAAcyI,GAAkB,CACzChf,UAAS,OACTyS,SAAQ,OACRhS,gBACA2K,gBACAnG,gBACA5D,mBACA2J,cACAnsE,IAAG,OACHwxC,OAAM,IACNvI,OAAM,OACN+0B,MAAK,OACLj1B,OAAM,OACN8tB,qBACAxkE,SAAQ,OACRyH,SACAxB,IAAG,OACHgsB,YACA6qB,SAAQ,OACR85B,MAAK,SAEI0d,GAAS3D,GAAa,CAC/B7P,UACAlK,MAAK,SAEIoO,GAAa4L,GAAiB,CACvCrhB,gBACA2K,gBACAnG,gBACA5D,mBACA2J,cACA36B,OAAM,IACNwsB,MAAK,OACLj1B,OAAM,OACNk4B,QAAO,OACPnnE,SACAwqB,YACA2kD,MAAK,SAGP,GAAS5R,GAAM,CACbvxC,WACA+2C,MAAO,OACPmR,KAAM,OACNpR,KAAM,OACN72C,SAAQ,OACR3lC,EAAC,KACD2kD,KAAI,OACJivC,OAAM,OACN/oD,IAAK,OACLsmB,GAAE,MACF0iC,QAAO,OACPjY,IAAG,OACH+Z,aAAY,OACZT,cAAa,OACbmB,cAAa,OACbX,gBAAe,OACfvvF,EAAC,KACD4jC,SAAU,OACV4pD,MAAK,OACL,GAAM,GAAAxiC,GACN9lB,QAAO,OACP,EAAK,GAAAllC,EACL61E,IAAG,OACH6M,MAAK,OACL9uE,UAAS,OACTwgF,UAAS,OACTlvC,WAAU,OACVj/C,MAAK,OACLo6F,YAAW,OACX10B,OAAM,OACNwhB,QAAO,OACPtS,QAAO,OACPyS,UAAS,OACTvW,UAAS,OACTxpB,MAAK,OACLirB,KAAI,OACJl1C,MAAK,OACLmoB,MAAK,OACL60C,eAAc,OACd52C,KAAI,OACJovB,OAAM,OACN7B,OAAM,OACNh0C,IAAG,OACHG,GAAE,MACF8zC,IAAG,OACH5qE,OAAM,OACNxL,QAAO,OACPgV,IAAG,OACH8jE,IAAG,OACHoa,OAAM,OACNE,IAAG,OACHqM,MAAK,OACLjM,QAAO,OACPxwD,KAAI,OACJg2C,KAAI,OACJE,KAAI,OACJE,KAAI,OACJn2C,KAAI,OACJF,KAAI,OACJO,MAAK,OACLpC,KAAI,OACJq4C,KAAI,OACJE,KAAI,OACJE,KAAI,OACJv4C,KAAI,OACJ+hB,KAAI,OACJk8C,SACAzmB,aAAY,OACZkZ,WAAU,OACVC,UAAS,OACTtF,IAAG,OACH3hC,MAAK,OACLyoC,gBAAe,OACfE,OAAM,OACN3xB,OAAM,OACNyqB,SAAQ,OACRrW,WAAU,OACVwpB,UAAS,OACTv+D,IAAG,OACHupB,KAAI,OACJtiD,KAAI,OACJgwE,KAAI,OACJ6Y,kBAAiB,OACjB8B,KAAI,OACJI,IAAG,OACH3vD,MAAK,OACL21C,MAAK,OACL51C,MAAK,OACL5B,IAAG,OACH63C,IAAG,OACH13C,IAAG,OACH+2C,oBAAmB,OACnBjuB,OAAM,OACNiiC,MAAK,OACL1oC,WAAU,OACVz6C,OAAM,OACN43C,KAAI,OACJ+L,IAAG,OACHjI,IAAG,OACH0yB,QAAO,OACP6Y,KAAI,OACJ1Z,OAAM,OACNC,OAAM,OACNI,GAAE,MACF/2C,OAAM,OACNywD,KAAI,OACJ/xB,SAAQ,OACRmyB,KAAI,OACJG,QAAO,OACPxxE,KAAI,OACJ2O,OAAM,OACNgjE,MAAK,OACL2B,IAAG,OACHtvF,MAAK,OACLyyE,UAAS,OACTE,cAAa,OACb/uB,QAAO,OACPsqC,YAAW,OACXpb,QAAO,OACPC,OAAM,OACNF,QAAO,OACPoD,OAAM,OACNf,MAAK,OACLnwE,MAAK,OACL4wE,IAAG,OACH/gE,IAAG,OACH4/D,IAAG,OACHqY,YAAW,OACXlvC,OAAM,OACNl4C,IAAG,OACHsX,MAAK,OACL9V,SAAQ,OACRqrE,YAAW,OACXh0C,GAAE,MACFwG,QAAO,OACPyoD,OAAM,OACNG,QAAO,OACPlb,GAAE,MACFtlE,IAAG,OACH+kE,OAAM,OACNS,gBAAe,OACfub,eAAc,OACdG,UAAS,OACTnb,SAAQ,OACRqa,gBAAe,OACfhY,MAAK,OACLvzB,IAAG,OACHusC,cAAa,OACbE,aAAY,OACZE,gBAAe,OACfE,QAAO,OACPha,MAAK,OACLqa,YAAW,OACXtgB,MAAK,OACLoH,UAAS,OACT4W,IAAG,OACHvZ,MAAK,OACLga,KAAI,OACJtb,UAAS,OACT+D,QAAO,OACPxC,IAAG,OACHL,UAAS,OACTzjC,KAAI,OACJzsB,IAAG,OACHyyD,IAAG,OACHgZ,YAAW,OACXI,YAAW,OACXv1D,MAAK,OACLmT,IAAG,OACHylC,UAAS,OACT8b,aAAY,OACZ7wE,KAAI,OACJ8mC,SAAQ,OACRuwB,MAAK,OACLxnD,MAAK,OACLm5D,IAAG,OACH/hC,KAAI,OACJ0uB,MAAK,OACL5vD,IAAG,OACHqrE,aAAY,OACZQ,iBAAgB,OAChBjb,IAAG,OACHoZ,OAAM,OACNhlF,KAAI,OACJ+pE,WAAU,OACVoc,UAAS,OACTM,YAAW,OACXnb,IAAG,OACHsoB,aAAY,OACZ5nB,SAAQ,OACRkY,OAAM,OACNC,UAAS,OACT2C,SAAQ,OACR1C,IAAG,OACHG,IAAG,OACHhY,IAAG,OACHrpB,SAAQ,OACRkpB,WAAU,OACVD,QAAO,OACPn6C,MAAK,OACL2D,IAAG,OACH40C,UAAS,OACTka,UAAS,OACThmC,MAAK,OACLimC,GAAE,MACFhY,IAAG,OACHD,KAAI,OACJ52B,OAAM,OACN3gD,KAAI,OACJ83E,SAAQ,OACR4Y,aAAY,OACZ1Z,YAAW,OACXL,MAAK,OACL0U,WAAU,OACV4E,KAAI,OACJjvF,UAAS,OACTgxF,IAAG,OACHtE,WAAU,OACVpB,aAAY,OACZsB,UAAS,OACTrB,mBAAkB,OAClBY,aAAY,OACZL,aAAY,OACZe,QAAO,OACPC,eAAc,OACdhC,oBAAmB,OACnBmB,cAAa,OACbN,SAAQ,OACRV,iBAAgB,OAChBsC,UAAS,OACTN,oBAAmB,OACnBb,YAAW,OACXyB,aAAY,OACZH,aAAY,OACZI,kBAAiB,OACjB5B,WAAU,OACVlB,sBAAqB,OACrBoC,gBAAe,OACfC,gBAAe,OACflC,gBAAe,OACfmD,OAAM,OACN1Y,KAAI,OACJuY,QAAO,MACP1X,MAAK,OACLkZ,YAAW,OACXhD,SAAQ,OACRd,wBAAuB,OACvBX,iBAAgB,OAChBa,cAAa,OACb0B,QAAO,OACPV,UAAS,OACTS,aAAY,OACZ9B,gBAAe,OACfiC,WAAU,OACVtB,qBAAoB,OACpBxB,aAAY,OACZyC,iBAAgB,OAChBiC,eAAc,OACdtwF,OAAM,OACN2sF,WAAU,OACVP,iBAAgB,OAChBG,0BAAyB,OACzB0B,YAAW,OACXU,WAAU,OACVrB,oBAAmB,OACnB7kF,OAAM,OACN8I,SACAI,YACAigF,IAAG,OACHzF,QAAO,OACPK,oBAAmB,OACnBa,QAAO,OACP3qF,KAAI,OACJktF,QACA7B,YAAW,OACXvf,WACAzyC,YACAozD,eACAiP,UACAtS,eAAc,OACdgD,cACA7lC,OAAM,MAGR,GAASqlB,GAAmBQ,GAAM,CAChCvjB,MAAO2wC,GAAqB,CAC1BtqF,UAAS,OACT8uE,MAAK,SAEPp2E,OAAQiyF,GAAsB,CAC5B7b,MAAK,SAEP5sE,IAAK6oF,GAAmB,CACtBjc,MAAK,SAEP5hF,QAASk+F,GAAuB,CAC9Btc,MAAK,SAEPlzD,OAAQ2vE,GAAsB,CAC5B30F,OAAM,OACNk4E,MAAK,SAEPzkD,MAAOmhE,GAAqB,CAC1BC,MAAK,SAEPh+D,OAAQk+D,GAAsB,CAC5B3rF,UAAS,OACTpJ,OAAM,OACNk4E,MAAK,SAEP76D,IAAK43E,GAAmB,CACtBx0C,OAAM,IACN2sB,OAAM,OACN8C,QAAO,OACPgI,MAAK,SAEP/6D,IAAK+3E,GAAmB,CACtBz0C,OAAM,IACNyvB,QAAO,OACP/C,QAAO,OACP+K,MAAK,SAEPtxC,IAAKuuD,GAAmB,CACtBlmF,IAAG,OACHwxC,OAAM,IACNyvB,QAAO,OACPgI,MAAK,SAEPmP,OAAQ+N,GAAsB,CAC5BP,MAAK,OACL70F,OAAM,OACNmnB,MAAK,OACL+wD,MAAK,SAEP/wD,MAAOkuE,GAAqB,CAC1BjlB,UAAS,OACTpwE,OAAM,OACNygD,OAAM,IACN2sB,OAAM,OACNE,SAAQ,OACRH,QAAO,OACPE,UAAS,OACT6K,MAAK,SAEP71E,KAAMizF,GAAoB,CACxBllB,UAAS,OACTpwE,OAAM,OACNmhE,OAAM,OACN/iB,SAAQ,OACR85B,MAAK,SAEPoI,IAAKiV,GAAmB,CACtBV,MAAK,OACL70F,OAAM,OACNmnB,MAAK,OACL+wD,MAAK,SAEP3gF,KAAMi+F,GAAoB,CACxBvmF,IAAG,OACHipC,OAAM,OACNggC,MAAK,SAEP7I,SAAUomB,GAAwB,CAChCxmF,IAAG,OACH8zC,MAAK,OACL7K,OAAM,OACNz8C,MAAK,OACL6F,SAAQ,OACR88C,SAAQ,OACR85B,MAAK,SAEPqR,IAAKmM,GAAmB,CACtBh3F,KAAI,OACJw5E,MAAK,OACL7I,SAAQ,WAIZ,GAASiF,GAAS,CAChBlM,UAAS,OACTlwC,QAAO,OACPyhD,MAAK,OACLjlE,QACA+yD,aACAY,aACAwI,gBACAI,cACAQ,mBACAY,kBACAuB,SACAoY,UAAS,OACTkK,OAAM,OACNnkB,mBACAsD,gBACAnyB,SAAQ,OACRovB,aACA6jB,YAAW,OACXrkB,0BACAskB,aAAY,OACZC,qBAAoB,OACpBC,cAAa,OACbhd,gBACAM,aACAib,MAAK,OACLhjB,kBACA0kB,IAAG,OACHrb,KAAI,OACJE,cACAI,gBACAqG,QACAO,YAGFxO,GAAMI,YAAY1N,K,glGCplBdX,EAAe,GACR6wB,GAAiC,QAFjC,YAE+C7wB,GAAc,KAOtE,SAASyC,EAAU/7C,GACjB,KAAM13B,gBAAgByzE,GACpB,MAAM,IAAIxwC,YAAY,oDAGxBjjC,KAAK03B,QAAUA,GAAW,GAuD5B,OAhDA+7C,EAAUx3E,UAAUmE,KAAO,YAC3BqzE,EAAUx3E,UAAU6lG,aAAc,EAOlCruB,EAAUx3E,UAAUktD,QAAU,WAC5B,OAAOnpD,KAAK03B,SASd+7C,EAAUx3E,UAAUyD,SAAW,WAC7B,MAAO,IAAMM,KAAK03B,QAAQsR,KAAK,MAAQ,KAUzCyqC,EAAUx3E,UAAUmtD,OAAS,WAC3B,MAAO,CACLkqB,OAAQ,YACR57C,QAAS13B,KAAK03B,UAYlB+7C,EAAUF,SAAW,SAAUzjB,GAC7B,OAAO,IAAI2jB,EAAU3jB,EAAKp4B,UAGrB+7C,IACN,CACDb,SAAS,I,8BCnEP,EAAe,GACRmvB,GAAoC,QAFpC,UAEkD,GAAc,KAIzE,iBAAyB,UACzB,uBAA8B,EAO9B,mBAA2B,WACzB,MAAO,CACLzuB,OAAQ,UACRtvC,GAAIhkC,KAAKgkC,GACTC,GAAIjkC,KAAKikC,KAUb,oBAA4B,WAC1B,MAAO,CACLz3B,EAAGxM,KAAKmL,MACRurE,IAAK12E,KAAK8jC,QAcd,mBAA2B,SAAUmyB,GACnC,IACIhyB,EAAKjkC,KAAKikC,GACVD,EAAKhkC,KAAKgkC,GACVg+D,GAAQ,QAAOhiG,KAAKgkC,GAAIiyB,GACxBgsC,GAAQ,QAAOjiG,KAAKikC,GAAIgyB,GAExB1W,GAAY,EAAAuyB,EAAA,IAAS7b,GAAWA,EAAUA,EAAUA,EAAQ1W,UAAY,KAE5E,GAAkB,OAAdA,EAAoB,CACtB,IAAImxB,EAAUjrE,KAAKmN,IAAI,IAAK2sC,GAExB95C,KAAK0F,IAAI64B,EAAKC,GAAMysC,IACtB1sC,EAAK,GAGHv+B,KAAK0F,IAAI84B,EAAKD,GAAM0sC,IACtBzsC,EAAK,GAiCT,OA7BW,IAAPA,EAEI+9D,EACU,IAAPh+D,EAEE,IAAPC,EACI,KACW,IAARA,EACH,KAEAg+D,EAAQ,IAIZh+D,EAAK,GACK,IAARA,EACI+9D,EAAQ,OAERA,EAAQ,MAAQC,EAAMjxE,UAAU,GAAK,IAGlC,IAAPiT,EACI+9D,EAAQ,OAERA,EAAQ,MAAQC,EAAQ,KAoBtC,YAAoB,SAAU5lE,GAC5B,OAAQ2D,UAAUvlC,QAChB,KAAK,EAED,IAAIqpC,EAAM9D,UAAU,GAEpB,GAAmB,iBAAR8D,EACT,OAAO,EAAQA,GAEf,MAAM,IAAI3oC,UAAU,kDAI1B,KAAK,EAED,IAAIqR,EAAIwzB,UAAU,GACd02C,EAAM12C,UAAU,GAEpB,IAAI,EAAA8xC,EAAA,IAAStlE,GAAI,CAMf,IALI,EAAAslE,EAAA,IAAO4E,IAAQA,EAAIwrB,QAAQ,WAE7BxrB,EAAMA,EAAIjuB,SAAS,SAGjB,EAAAqpB,EAAA,IAAS4E,GACX,OAAO,IAAI,EAAQ,CACjBlqE,EACAkqE,IAAKA,IAIT,MAAM,IAAIv7E,UAAU,0CAEpB,MAAM,IAAIA,UAAU,6BAI1B,QACE,MAAM,IAAI8nC,YAAY,qDAI5B,oBAA4B,qBAU5B,WAAmB,SAAU6sB,GAC3B,OAAO,IAAI,EAAQA,IAmBrB,UAAkB,SAAU3mD,EAAGC,GAC7B,OAAID,EAAE66B,GAAK56B,EAAE46B,GACJ,EAGL76B,EAAE66B,GAAK56B,EAAE46B,IACH,EAGN76B,EAAE86B,GAAK76B,EAAE66B,GACJ,EAGL96B,EAAE86B,GAAK76B,EAAE66B,IACH,EAGH,GAGF,IACN,CACD2uC,SAAS,IC5MP,EAAe,GACRuvB,GAAkC,QAFlC,QAEgD,GAAc,KAgCvE,SAASnd,EAAMtyE,EAAOC,EAAK8rB,GACzB,KAAMz+B,gBAAgBglF,GACpB,MAAM,IAAI/hD,YAAY,oDAGxB,IAAIm/D,EAAW1vF,QACX2vF,EAAS1vF,QACT2vF,EAAU7jE,QAEd,GAAI2jE,EACF,IAAI,EAAAtwB,EAAA,IAAYp/D,GACdA,EAAQA,EAAM+1C,gBACT,GAAqB,iBAAV/1C,EAChB,MAAM,IAAIvX,UAAU,oCAIxB,GAAIknG,EACF,IAAI,EAAAvwB,EAAA,IAAYn/D,GACdA,EAAMA,EAAI81C,gBACL,GAAmB,iBAAR91C,EAChB,MAAM,IAAIxX,UAAU,kCAIxB,GAAImnG,EACF,IAAI,EAAAxwB,EAAA,IAAYrzC,GACdA,EAAOA,EAAKgqB,gBACP,GAAoB,iBAAThqB,EAChB,MAAM,IAAItjC,UAAU,mCAIxB6E,KAAK0S,MAAQ0vF,EAAW/vF,WAAWK,GAAS,EAC5C1S,KAAK2S,IAAM0vF,EAAShwF,WAAWM,GAAO,EACtC3S,KAAKy+B,KAAO6jE,EAAUjwF,WAAWosB,GAAQ,EAoQ3C,OA7PAumD,EAAM/oF,UAAUmE,KAAO,QACvB4kF,EAAM/oF,UAAUsmG,SAAU,EAW1Bvd,EAAM5wE,MAAQ,SAAUirB,GACtB,GAAmB,iBAARA,EACT,OAAO,KAGT,IACImjE,EADOnjE,EAAIjM,MAAM,KACLzc,KAAI,SAAUmtB,GAC5B,OAAOzxB,WAAWyxB,MAMpB,GAJc0+D,EAAK/0F,MAAK,SAAU+4C,GAChC,OAAO1/C,MAAM0/C,MAIb,OAAO,KAGT,OAAQg8C,EAAK/nG,QACX,KAAK,EACH,OAAO,IAAIuqF,EAAMwd,EAAK,GAAIA,EAAK,IAEjC,KAAK,EACH,OAAO,IAAIxd,EAAMwd,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE1C,QACE,OAAO,OASbxd,EAAM/oF,UAAUwwD,MAAQ,WACtB,OAAO,IAAIu4B,EAAMhlF,KAAK0S,MAAO1S,KAAK2S,IAAK3S,KAAKy+B,OAU9CumD,EAAM/oF,UAAUylB,KAAO,WACrB,IAAIlnB,EAAM,EACNkY,EAAQ1S,KAAK0S,MACb+rB,EAAOz+B,KAAKy+B,KAEZ/wB,EADM1N,KAAK2S,IACED,EAYjB,OAVI,QAAK+rB,MAAU,QAAK/wB,GACtBlT,EAAMiL,KAAKkd,KAAKjV,EAAO+wB,GACL,IAAT/wB,IACTlT,EAAM,GAGJsM,MAAMtM,KACRA,EAAM,GAGD,CAACA,IASVwqF,EAAM/oF,UAAUusB,IAAM,WACpB,IAAI9G,EAAO1hB,KAAK0hB,OAAO,GAEvB,OAAIA,EAAO,EACL1hB,KAAKy+B,KAAO,EAEPz+B,KAAK0S,MAGL1S,KAAK0S,OAASgP,EAAO,GAAK1hB,KAAKy+B,UAGxC,GAUJumD,EAAM/oF,UAAUysB,IAAM,WACpB,IAAIhH,EAAO1hB,KAAK0hB,OAAO,GAEvB,OAAIA,EAAO,EACL1hB,KAAKy+B,KAAO,EAEPz+B,KAAK0S,OAASgP,EAAO,GAAK1hB,KAAKy+B,KAG/Bz+B,KAAK0S,WAGd,GAYJsyE,EAAM/oF,UAAU0F,QAAU,SAAUuS,GAClC,IAAIrQ,EAAI7D,KAAK0S,MACT+rB,EAAOz+B,KAAKy+B,KACZ9rB,EAAM3S,KAAK2S,IACXjY,EAAI,EAER,GAAI+jC,EAAO,EACT,KAAO56B,EAAI8O,GACTuB,EAASrQ,EAAG,CAACnJ,GAAIsF,MACjB6D,GAAK46B,EACL/jC,SAEG,GAAI+jC,EAAO,EAChB,KAAO56B,EAAI8O,GACTuB,EAASrQ,EAAG,CAACnJ,GAAIsF,MACjB6D,GAAK46B,EACL/jC,KAeNsqF,EAAM/oF,UAAU0a,IAAM,SAAUzC,GAC9B,IAAIklD,EAAQ,GAIZ,OAHAp5D,KAAK2B,SAAQ,SAAU7E,EAAOgiC,EAAOx/B,GACnC85D,EAAMt6B,EAAM,IAAM5qB,EAASpX,EAAOgiC,EAAOx/B,MAEpC85D,GAST4rB,EAAM/oF,UAAUsjG,QAAU,WACxB,IAAInmC,EAAQ,GAIZ,OAHAp5D,KAAK2B,SAAQ,SAAU7E,EAAOgiC,GAC5Bs6B,EAAMt6B,EAAM,IAAMhiC,KAEbs8D,GAST4rB,EAAM/oF,UAAUktD,QAAU,WAExB,OAAOnpD,KAAKu/F,WAcdva,EAAM/oF,UAAU44F,OAAS,SAAU5+B,GACjC,IAAI52B,GAAM,QAAOr/B,KAAK0S,MAAOujD,GAO7B,OALkB,IAAdj2D,KAAKy+B,OACPY,GAAO,KAAM,QAAOr/B,KAAKy+B,KAAMw3B,IAGjC52B,EAAO,KAAM,QAAOr/B,KAAK2S,IAAKsjD,IAUhC+uB,EAAM/oF,UAAUyD,SAAW,WACzB,OAAOM,KAAK60F,UAUd7P,EAAM/oF,UAAUmtD,OAAS,WACvB,MAAO,CACLkqB,OAAQ,QACR5gE,MAAO1S,KAAK0S,MACZC,IAAK3S,KAAK2S,IACV8rB,KAAMz+B,KAAKy+B,OAYfumD,EAAMzR,SAAW,SAAUzjB,GACzB,OAAO,IAAIk1B,EAAMl1B,EAAKp9C,MAAOo9C,EAAKn9C,IAAKm9C,EAAKrxB,OAGvCumD,IACN,CACDpS,SAAS,I,QCvUA6vB,GAAmB,SAAQ,SAAUpL,GAC9C,OAAO,IAAIA,EAAU,GAAGv0D,QACvB,CACD4/D,WAQSC,GAAqB,SAAQ,SAAUtL,GAChD,OAAO,IAAIA,EAAU,GAAGzzD,KAAK,IAAIyzD,EAAU,GAAGttF,QAAQ65C,IAAI,KACzD,CACD8+C,WAQSE,GAAoB,SAAQ,SAAUvL,GAC/C,OAAOA,EAAU1yD,MAAM,KACtB,CACD+9D,WAQSG,GAAqB,SAAQ,SAAUxL,GAChD,OAAOuL,EAAkBvL,GAAWz0C,MAAM,KACzC,CACD8/C,WAWF,SAASA,EAAOrmE,GACd,OAAOA,EAAK,GAAGkjB,UCvDV,IAAIsM,EAAKpmD,KAAKiF,GACV4rE,EAAM,EAAI7wE,KAAKiF,GACf7J,EAAI4E,KAAK6/B,ECETw9D,GAA4B,QAAQ,OAAQ,IAAI,KAAM,IACtDC,GAA6B,QAAQ,QAAS,IAAI,KAAM,IACxDC,GAA4B,QAAQ,OAAQ,IAAI,IAAM,OACtDC,EAAgCC,EAAgB,WAAY,CAAC,SAAU,eAAgB11C,IAChG,IAAI,OACF1B,EAAM,UACNurC,GACE7pC,EACJ,MAAyB,cAAlB1B,EAAO0gB,OAAyB,IAAI6qB,EAAU5yD,KAAYA,OAExD0+D,EAA2BD,EAAgB,MAAO,CAAC,SAAU,eAAgBE,IACtF,IAAI,OACFt3C,EAAM,UACNurC,GACE+L,EACJ,MAAyB,cAAlBt3C,EAAO0gB,OAAyB,IAAI6qB,EAAU9xD,KAAOA,OAEnD89D,EAA0BH,EAAgB,KAAM,CAAC,SAAU,eAAgBI,IACpF,IAAI,OACFx3C,EAAM,UACNurC,GACEiM,EACJ,MAAyB,cAAlBx3C,EAAO0gB,OAAyBo2B,EAAkBvL,GAAaxrC,KAE7D03C,EAA2BL,EAAgB,MAAO,CAAC,SAAU,eAAgBM,IACtF,IAAI,OACF13C,EAAM,UACNurC,GACEmM,EACJ,MAAyB,cAAlB13C,EAAO0gB,OAAyBq2B,EAAmBxL,GAAa/gB,KAE9DmtB,EAAyBP,EAAgB,IAAK,CAAC,SAAU,eAAgBQ,IAClF,IAAI,OACF53C,EAAM,UACNurC,GACEqM,EACJ,MAAyB,cAAlB53C,EAAO0gB,OAAyBi2B,EAAiBpL,GAAax2F,KAG5D8iG,EAA2BT,EAAgB,MAAO,CAAC,SAAU,eAAgBU,IACtF,IAAI,OACF93C,EAAM,UACNurC,GACEuM,EACJ,MAAyB,cAAlB93C,EAAO0gB,OAAyBm2B,EAAmBtL,GD7C3C,qBC+CNwM,EAA2BX,EAAgB,MAAO,CAAC,SAAU,eAAgBY,IACtF,IAAI,OACFh4C,EAAM,UACNurC,GACEyM,EACJ,MAAyB,cAAlBh4C,EAAO0gB,OAAyB,IAAI6qB,EAAU,GAAGhyC,KAAO5/C,KAAK2oF,OAE3D2V,EAA4Bb,EAAgB,OAAQ,CAAC,SAAU,eAAgBc,IACxF,IAAI,OACFl4C,EAAM,UACNurC,GACE2M,EACJ,MAAyB,cAAlBl4C,EAAO0gB,OAAyB,IAAI6qB,EAAU,IAAIhyC,KAAO5/C,KAAK45C,QAE5D4kD,EAA6Bf,EAAgB,QAAS,CAAC,SAAU,eAAgBgB,IAC1F,IAAI,OACFp4C,EAAM,UACNurC,GACE6M,EACJ,MAAyB,cAAlBp4C,EAAO0gB,OAAyB,IAAI6qB,EAAU,GAAGzzC,IAAI,IAAIyzC,EAAU,GAAGhyC,MAAQ5/C,KAAK4oF,SAEjF8V,EAA8BjB,EAAgB,SAAU,CAAC,SAAU,eAAgBkB,IAC5F,IAAI,OACFt4C,EAAM,UACNurC,GACE+M,EACJ,MAAyB,cAAlBt4C,EAAO0gB,OAAyB,IAAI6qB,EAAU,GAAGzzC,IAAI,IAAIyzC,EAAU,IAAIhyC,MAAQ5/C,KAAK6oF,UAElF+V,EAA+BnB,EAC1C,UAAW,CAAC,SAAU,eAAgBoB,IACpC,IAAI,OACFx4C,EAAM,UACNurC,GACEiN,EACJ,MAAyB,cAAlBx4C,EAAO0gB,OAAyB,IAAI6qB,EAAU,OAAOttF,OAAStE,KAAK8oF,WAEjEgW,EAA6BrB,EAAgB,QAAS,CAAC,SAAU,eAAgBsB,IAC1F,IAAI,OACF14C,EAAM,UACNurC,GACEmN,EACJ,MAAyB,cAAlB14C,EAAO0gB,OAAyB,IAAI6qB,EAAU,GAAGttF,OAAStE,KAAK+oF,SAE7DiW,EAAyBvB,EAAgB,IAAK,CAAC,YAAawB,IACrE,IAAI,QACFnhE,GACEmhE,EACJ,OAAOnhE,EAAQohE,KAeNC,GAA+B,QAAQ,UAAW,IAAI,IChH5C,UDmHrB,SAAS1B,EAAgBvjG,EAAMqxE,EAAc1zE,GAC3C,OAAO,QAAQqC,EAAMqxE,EAAc1zE,EAAQ,CACzCunG,wBAAwB,I,cElHxB,EAAe,CAAC,MAAO,UAChBC,GAAsC,QAFtC,YAEoD,GAAet3C,IAC5E,IAAI,GACFnrC,EAAE,OACFypC,GACE0B,EAGA6pC,EAAY,QAAc,CAC5B93C,UAAWuM,EAAOvM,UAClBE,OAJW,IAgDb,OAtCA43C,EAAUp7F,UAAUmE,KAAO,YAC3Bi3F,EAAUp7F,UAAU8oG,aAAc,EAQlC1N,EAAUp7F,UAAUmtD,OAAS,WAC3B,MAAO,CACLkqB,OAAQ,YACRx2E,MAAOkD,KAAKN,aAWhB23F,EAAU9jB,SAAW,SAAUzjB,GAC7B,OAAO,IAAIunC,EAAUvnC,EAAKhzD,QAGxBulB,GAEFA,EAAG,UAAU,SAAUglB,EAAMD,GACvBC,EAAKkY,YAAcnY,EAAKmY,WAC1B83C,EAAUvrC,OAAO,CACfvM,UAAWlY,EAAKkY,eAMjB83C,IACN,CACDzkB,SAAS,ICzDP,EAAe,GACRoyB,GAAmC,QAFnC,SAEiD,GAAc,KAuBxE,SAASzD,IACP,KAAMvhG,gBAAgBuhG,GACpB,MAAM,IAAIt+D,YAAY,oDA0N1B,OAlNAs+D,EAAOtlG,UAAUmE,KAAO,SACxBmhG,EAAOtlG,UAAUgpG,UAAW,EAU5B1D,EAAOtlG,UAAUipG,QAAU,WAEzB,MAAM,IAAI/jE,MAAM,gDAYlBogE,EAAOtlG,UAAUkpG,SAAW,WAE1B,MAAM,IAAIhkE,MAAM,iDASlBogE,EAAOtlG,UAAUqB,OAAS,SAAUyD,EAAMokG,GACxC,MAAM,IAAIhkE,MAAM,+CAiBlBogE,EAAOtlG,UAAUo0B,OAAS,SAAUyO,EAAOozC,EAAapE,GAEtD,MAAM,IAAI3sC,MAAM,+CASlBogE,EAAOtlG,UAAUK,IAAM,SAAUwiC,GAE/B,MAAM,IAAIqC,MAAM,4CAalBogE,EAAOtlG,UAAU4uB,IAAM,SAAUiU,EAAOhiC,EAAOgxE,GAE7C,MAAM,IAAI3sC,MAAM,4CAgBlBogE,EAAOtlG,UAAUg3F,OAAS,SAAUvxE,EAAMosD,GAExC,MAAM,IAAI3sC,MAAM,+CAalBogE,EAAOtlG,UAAUi3F,QAAU,SAAUxxE,EAAMosD,GAEzC,MAAM,IAAI3sC,MAAM,gDAQlBogE,EAAOtlG,UAAUwwD,MAAQ,WAEvB,MAAM,IAAItrB,MAAM,8CAQlBogE,EAAOtlG,UAAUylB,KAAO,WAEtB,MAAM,IAAIyf,MAAM,6CAclBogE,EAAOtlG,UAAU0a,IAAM,SAAUzC,EAAUkxF,GAEzC,MAAM,IAAIjkE,MAAM,4CAUlBogE,EAAOtlG,UAAU0F,QAAU,SAAUuS,GAEnC,MAAM,IAAIitB,MAAM,gDAQlBogE,EAAOtlG,UAAUsjG,QAAU,WAEzB,MAAM,IAAIp+D,MAAM,gDAQlBogE,EAAOtlG,UAAUktD,QAAU,WAEzB,MAAM,IAAIhoB,MAAM,gDAYlBogE,EAAOtlG,UAAU44F,OAAS,SAAU5+B,GAElC,MAAM,IAAI90B,MAAM,+CAQlBogE,EAAOtlG,UAAUyD,SAAW,WAE1B,MAAM,IAAIyhC,MAAM,iDAGXogE,IACN,CACD3uB,SAAS,ICtPP,EAAe,GACRyyB,GAAgC,QAFhC,WAE8C,GAAc,IAa9D,SAAkBxpG,EAAKiB,GAE5B,MAAqB,iBAAVA,GAAwBqjB,SAASrjB,KAAUgK,MAAMhK,GAOrDA,EANE,CACLw2E,OAAQ,SACRx2E,MAAOwhC,OAAOxhC,OClBXwoG,EAAoCC,GAAY,eAAgB,YAAa,UAC7EC,EAA2CD,GAAY,sBAAuB,cAAe,kBAC7FE,EAAsCF,GAAY,iBAAkB,iBAAkB,OACtFG,EAA6CH,GAAY,wBAAyB,yBAA0B,OAE5GI,EAAwCJ,GAAY,mBAAoB,mBAAoB,UAC5FK,EAAwCL,GAAY,mBAAoB,mBAAoB,UAC5FM,GAAuCN,GAAY,kBAAmB,gBAAiB,OACvFO,GAA+BP,GAAY,UAAW,sBAAuB,cAC7EQ,GAAwCR,GAAY,mBAAoB,kBAAmB,KAC3FS,GAAoCT,GAAY,eAAgB,mBAAoB,UACpFU,GAA0CV,GAAY,qBAAsB,uBAAwB,KACpGW,GAAiDX,GAAY,4BAA6B,qBAAsB,OAChHY,GAA2CZ,GAAY,sBAAuB,yBAA0B,MACxGa,GAAuCb,GAAY,kBAAmB,mBAAoB,UAC1Fc,GAAgCd,GAAY,WAAY,qBAAsB,OAI9Ee,GAAkCf,GAAY,aAAc,oBAAqB,KACjFgB,GAA+ChB,GAAY,0BAA2B,mBAAoB,KAC1GiB,GAAoCjB,GAAY,eAAgB,mBAAoB,MACpFkB,GAAqClB,GAAY,gBAAiB,eAAgB,UAClFmB,GAAsBC,GAAc,gBAAiB,gBACrDC,GAAqCrB,GAAY,gBAAiB,sBAAuB,KACzFsB,GAAkCtB,GAAY,aAAc,oBAAqB,MACjFuB,GAAoCvB,GAAY,eAAgB,mBAAoB,MACpFwB,GAAmCxB,GAAY,cAAe,mBAAoB,MAClFyB,GAA4CzB,GAAY,uBAAwB,kBAAmB,YACnG0B,GAA+B1B,GAAY,UAAW,kBAAmB,QACzE2B,GAA2C3B,GAAY,sBAAuB,mBAAoB,OAClG4B,GAAwBR,GAAc,kBAAmB,OACzDS,GAAqBT,GAAc,eAAgB,MAEnDU,GAAkC9B,GAAY,aAAc,oBAAqB,MACjF+B,GAAgC/B,GAAY,WAAY,gBAAiB,UACzEgC,GAAiChC,GAAY,YAAa,eAAgB,UAC1EiC,GAA+BjC,GAAY,UAAW,oBAAqB,YAC3EkC,GAAsClC,GAAY,iBAAkB,yBAA0B,SAE9FmC,GAAiCnC,GAAY,YAAa,uBAAwB,QAClFoC,GAAmCpC,GAAY,cAAe,mBAAoB,iBAClFqC,GAA2CrC,GAAY,sBAAuB,wBAAyB,cACvGsC,GAAmCtC,GAAY,cAAe,uBAAwB,cACtFuC,GAAsBnB,GAAc,iBAAkB,eACtDoB,GAAuCxC,GAAY,kBAAmB,uBAAwB,OAC9FyC,GAAuCzC,GAAY,kBAAmB,sBAAuB,eAC7F0C,GAAwC1C,GAAY,mBAAoB,iBAAkB,OAE1F2C,GAAiC3C,GAAY,YAAa,mBAAoB,aAC9E4C,GAAoC5C,GAAY,eAAgB,mBAAoB,aACpF6C,GAA+B7C,GAAY,UAAW,UAAW,UAGjE8C,GAAoC9C,GAAY,eAAgB,eAAgB,KAChF+C,GAAkC/C,GAAY,aAAc,cAAe,MAC3EgD,GAAkChD,GAAY,aAAc,eAAgB,KAC5EiD,GAAoCjD,GAAY,eAAgB,oBAAqB,KACrFkD,GAAyClD,GAAY,oBAAqB,eAAgB,KAGrG,SAASA,GAAY5lG,EAAM+oG,EAAUC,GAEnC,OAAO,QAAQhpG,EADI,CAAC,SAAU,OAAQ,cACF6tD,IAClC,IAAI,OACF1B,EAAM,KACNy6B,EAAI,UACJ8Q,GACE7pC,EAKAjoD,EAAO,IAAIghF,EADe,cAAlBz6B,EAAO0gB,OAAyB,IAAI6qB,EAAUqR,GAAYr2F,WAAWq2F,GACtDC,GAE3B,OADApjG,EAAKqjG,WAAY,EACVrjG,KAMX,SAASohG,GAAchnG,EAAM7C,GAE3B,OAAO,QAAQ6C,EADI,CAAC,SAAU,cACMyjG,IAClC,IAAI,OACFt3C,EAAM,UACNurC,GACE+L,EACJ,MAAyB,cAAlBt3C,EAAO0gB,OAAyB,IAAI6qB,EAAUv6F,GAASA,K,eCxF9D,GAAe,GACR+rG,IAAqC,QAFrC,WAEmD,IAAc,KAI1E,kBAA0B,WAC1B,yBAAgC,EAOhC,oBAA4B,WAC1B,MAAO,CACLv1B,OAAQ,WACR7zE,EAAGO,KAAK2T,EAAI3T,KAAKP,EACjB6J,EAAGtJ,KAAKsJ,IAWZ,YAAoB,SAAUwmD,GAC5B,OAAO,IAAI,GAASA,IAGf,KACN,CACD8iB,SAAS,I,4CC7BP,GAAe,CAAC,UACTk2B,IAAwC,QAFxC,cAEsD,IAAet7C,IAC9E,IAAI,OACF+zC,GACE/zC,EAMJ,SAASg0C,EAAYzgG,EAAMokG,GACzB,KAAMnlG,gBAAgBwhG,GACpB,MAAM,IAAIv+D,YAAY,oDAGxB,GAAIkiE,KAAa,EAAArzB,EAAA,IAASqzB,GACxB,MAAM,IAAIhkE,MAAM,qBAAuBgkE,GAGzC,IAAI,EAAArzB,EAAA,IAAS/wE,GAEO,gBAAdA,EAAKX,MAEPJ,KAAK+oG,OAAQ,SAAMhoG,EAAKgoG,OACxB/oG,KAAKgpG,OAAQ,SAAMjoG,EAAKioG,OACxBhpG,KAAKipG,UAAY9D,GAAYpkG,EAAKkoG,YAGlCjpG,KAAK+oG,MAAQhoG,EAAKw+F,UAClBv/F,KAAKgpG,MAAQjoG,EAAK2gB,OAClB1hB,KAAKipG,UAAY9D,GAAYpkG,EAAKkoG,gBAE/B,GAAIloG,IAAQ,EAAA+wE,EAAA,IAAQ/wE,EAAKA,QAAS,EAAA+wE,EAAA,IAAQ/wE,EAAK2gB,MAEpD1hB,KAAK+oG,MAAQhoG,EAAKA,KAClBf,KAAKgpG,MAAQjoG,EAAK2gB,MAElB,SAAS1hB,KAAK+oG,MAAO/oG,KAAKgpG,OAC1BhpG,KAAKipG,UAAY9D,GAAYpkG,EAAKokG,cAC7B,IAAI,EAAArzB,EAAA,IAAQ/wE,GAEjBf,KAAK+oG,MAAQG,EAAWnoG,GAExBf,KAAKgpG,OAAQ,SAAUhpG,KAAK+oG,QAE5B,SAAS/oG,KAAK+oG,MAAO/oG,KAAKgpG,OAE1BhpG,KAAKipG,UAAY9D,MACZ,IAAIpkG,EAET,MAAM,IAAI5F,UAAU,8BAA+B,QAAO4F,GAAQ,KAGlEf,KAAK+oG,MAAQ,GACb/oG,KAAKgpG,MAAQ,CAAC,GACdhpG,KAAKipG,UAAY9D,GA0LrB,SAASjpG,EAAKmP,EAAQyzB,GACpB,KAAK,EAAAgzC,EAAA,IAAQhzC,GACX,MAAM,IAAI3jC,UAAU,iBAKtB,GAFe2jC,EAAMqqE,WAInB,OAAO99F,EAAO/O,IAAIwiC,EAAMtW,OAGxB,IAAI9G,EAAOod,EAAMpd,OAEjB,GAAIA,EAAKjnB,SAAW4Q,EAAO29F,MAAMvuG,OAC/B,MAAM,IAAI2uG,GAAA,EAAe1nF,EAAKjnB,OAAQ4Q,EAAO29F,MAAMvuG,QAOrD,IAHA,IAAI+tB,EAAMsW,EAAMtW,MACZE,EAAMoW,EAAMpW,MAEPhuB,EAAI,EAAGylG,EAAK90F,EAAO29F,MAAMvuG,OAAQC,EAAIylG,EAAIzlG,KAChD,SAAc8tB,EAAI9tB,GAAI2Q,EAAO29F,MAAMtuG,KACnC,SAAcguB,EAAIhuB,GAAI2Q,EAAO29F,MAAMtuG,IAKrC,OAAO,IAAI8mG,EAAY6H,EAAch+F,EAAO09F,MAAOjqE,EAAOpd,EAAKjnB,OAAQ,GAAI4Q,EAAO49F,WAgBtF,SAASI,EAActoG,EAAM+9B,EAAOwqE,EAAMtK,GACxC,IAAIlxD,EAAOkxD,IAAQsK,EAAO,EACtB92E,EAAQsM,EAAMyqE,UAAUvK,GAE5B,OAAIlxD,EACKtb,EAAM7b,KAAI,SAAUjc,GAEzB,OADA,SAAcA,EAAGqG,EAAKtG,QACfsG,EAAKrG,MACXyuD,UAEI32B,EAAM7b,KAAI,SAAUjc,GAGzB,OAFA,SAAcA,EAAGqG,EAAKtG,QAEf4uG,EADKtoG,EAAKrG,GACWokC,EAAOwqE,EAAMtK,EAAM,MAC9C71C,UAiBP,SAASqgD,EAAKn+F,EAAQyzB,EAAO2qE,EAAW37B,GACtC,IAAKhvC,IAA2B,IAAlBA,EAAM+6B,QAClB,MAAM,IAAI1+D,UAAU,iBAItB,IAGIuuG,EAHAC,EAAQ7qE,EAAMpd,OACdynF,EAAWrqE,EAAMqqE,WAWrB,IAPI,EAAAr3B,EAAA,IAAS23B,IACXC,EAAQD,EAAU/nF,OAClB+nF,EAAYA,EAAUtgD,WAEtBugD,GAAQ,SAAUD,GAGhBN,EAAU,CAGZ,GAAqB,IAAjBO,EAAMjvG,OACR,MAAM,IAAIU,UAAU,mBAGtBkQ,EAAOwf,IAAIiU,EAAMtW,MAAOihF,EAAW37B,OAC9B,CAGL,GAAI67B,EAAMlvG,OAAS4Q,EAAO29F,MAAMvuG,OAC9B,MAAM,IAAI2uG,GAAA,EAAeO,EAAMlvG,OAAQ4Q,EAAO29F,MAAMvuG,OAAQ,KAG9D,GAAIivG,EAAMjvG,OAASkvG,EAAMlvG,OAAQ,CAK/B,IAHA,IAAIC,EAAI,EACJ4pE,EAAQ,EAEQ,IAAbqlC,EAAMjvG,IAAyB,IAAbgvG,EAAMhvG,IAC7BA,IAGF,KAAoB,IAAbivG,EAAMjvG,IACX4pE,IACA5pE,IAIF+uG,GAAY,SAAUA,EAAWE,EAAMlvG,OAAQ6pE,EAAOolC,GAIxD,KAAK,SAAgBC,EAAOD,GAC1B,MAAM,IAAIN,GAAA,EAAeO,EAAOD,EAAO,KAQzCE,EAAKv+F,EAJMyzB,EAAMpW,MAAM/R,KAAI,SAAUjc,GACnC,OAAOA,EAAI,KAGMozE,GAGnB,IAAIw7B,EAAOK,EAAMlvG,OAGjBovG,EAAcx+F,EAAO09F,MAAOjqE,EAAO2qE,EAAWH,EAFpC,GAKZ,OAAOj+F,EAcT,SAASw+F,EAAc9oG,EAAM+9B,EAAO2qE,EAAWH,EAAMtK,GACnD,IAAIlxD,EAAOkxD,IAAQsK,EAAO,EACtB92E,EAAQsM,EAAMyqE,UAAUvK,GAExBlxD,EACFtb,EAAM7wB,SAAQ,SAAUmoG,EAAWC,IACjC,SAAcD,GACd/oG,EAAK+oG,GAAaL,EAAUM,EAAS,OAGvCv3E,EAAM7wB,SAAQ,SAAUmoG,EAAWC,IACjC,SAAcD,GAEdD,EAAc9oG,EAAK+oG,GAAYhrE,EAAO2qE,EAAUM,EAAS,IAAKT,EAAMtK,EAAM,MAmChF,SAASgL,EAAQ3+F,EAAQqW,EAAMosD,GAE7B,GAAoB,IAAhBpsD,EAAKjnB,OAAc,CAIrB,IAFA,IAAImH,EAAIyJ,EAAO09F,OAER,EAAAj3B,EAAA,IAAQlwE,IACbA,EAAIA,EAAE,GAGR,OAAOA,EAQT,OAJAyJ,EAAO29F,MAAQtnF,EAAK5iB,MAAM,GAE1BuM,EAAO09F,OAAQ,SAAO19F,EAAO09F,MAAO19F,EAAO29F,MAAOl7B,GAE3CziE,EAsCT,SAASu+F,EAAKv+F,EAAQqW,EAAMosD,GAM1B,IALA,IACAm8B,EAAU5+F,EAAO29F,MAAMlqG,MAAM,GAEzBorG,GAAU,EAEPD,EAAQxvG,OAASinB,EAAKjnB,QAC3BwvG,EAAQzrG,KAAK,GACb0rG,GAAU,EAIZ,IAAK,IAAIxvG,EAAI,EAAGylG,EAAKz+E,EAAKjnB,OAAQC,EAAIylG,EAAIzlG,IACpCgnB,EAAKhnB,GAAKuvG,EAAQvvG,KACpBuvG,EAAQvvG,GAAKgnB,EAAKhnB,GAClBwvG,GAAU,GAIVA,GAEFF,EAAQ3+F,EAAQ4+F,EAASn8B,GAgY7B,SAASo7B,EAAWnoG,GAClB,IAAK,IAAIrG,EAAI,EAAGylG,EAAKp/F,EAAKtG,OAAQC,EAAIylG,EAAIzlG,IAAK,CAC7C,IAAImzB,EAAO9sB,EAAKrG,IAEZ,EAAAo3E,EAAA,IAAQjkD,GACV9sB,EAAKrG,GAAKwuG,EAAWr7E,GACZA,IAA0B,IAAlBA,EAAKo3E,WACtBlkG,EAAKrG,GAAKwuG,EAAWr7E,EAAKs7B,YAI9B,OAAOpoD,EAGT,OAj2BAygG,EAAYvlG,UAAY,IAAIslG,EAK5BC,EAAYvlG,UAAUkuG,kBAAoB,SAAUppG,EAAMokG,GACxD,OAAO,IAAI3D,EAAYzgG,EAAMokG,IAO/B3D,EAAYvlG,UAAUmE,KAAO,cAC7BohG,EAAYvlG,UAAUmuG,eAAgB,EAWtC5I,EAAYvlG,UAAUouG,YAAc,WAClC,OAAO,SAAiBrqG,KAAK+oG,MAAO,OAatCvH,EAAYvlG,UAAUipG,QAAU,WAC9B,MAAO,SAaT1D,EAAYvlG,UAAUkpG,SAAW,WAC/B,OAAOnlG,KAAKipG,WAUdzH,EAAYvlG,UAAUqB,OAAS,SAAUyD,EAAMokG,GAC7C,OAAO,IAAI3D,EAAYzgG,EAAMokG,IAkB/B3D,EAAYvlG,UAAUo0B,OAAS,SAAUyO,EAAOozC,EAAapE,GAC3D,OAAQ9tC,UAAUvlC,QAChB,KAAK,EACH,OAAOyB,EAAK8D,KAAM8+B,GAGpB,KAAK,EACL,KAAK,EACH,OAAO0qE,EAAKxpG,KAAM8+B,EAAOozC,EAAapE,GAExC,QACE,MAAM,IAAI7qC,YAAY,+BAW5Bu+D,EAAYvlG,UAAUK,IAAM,SAAUwiC,GACpC,KAAK,EAAAgzC,EAAA,IAAQhzC,GACX,MAAM,IAAI3jC,UAAU,kBAGtB,GAAI2jC,EAAMrkC,SAAWuF,KAAKgpG,MAAMvuG,OAC9B,MAAM,IAAI2uG,GAAA,EAAetqE,EAAMrkC,OAAQuF,KAAKgpG,MAAMvuG,QAIpD,IAAK,IAAIoJ,EAAI,EAAGA,EAAIi7B,EAAMrkC,OAAQoJ,KAChC,SAAci7B,EAAMj7B,GAAI7D,KAAKgpG,MAAMnlG,IAKrC,IAFA,IAAI9C,EAAOf,KAAK+oG,MAEPruG,EAAI,EAAGylG,EAAKrhE,EAAMrkC,OAAQC,EAAIylG,EAAIzlG,IAAK,CAC9C,IAAI4vG,EAASxrE,EAAMpkC,IACnB,SAAc4vG,EAAQvpG,EAAKtG,QAC3BsG,EAAOA,EAAKupG,GAGd,OAAOvpG,GAcTygG,EAAYvlG,UAAU4uB,IAAM,SAAUiU,EAAOhiC,EAAOgxE,GAClD,KAAK,EAAAgE,EAAA,IAAQhzC,GACX,MAAM,IAAI3jC,UAAU,kBAGtB,GAAI2jC,EAAMrkC,OAASuF,KAAKgpG,MAAMvuG,OAC5B,MAAM,IAAI2uG,GAAA,EAAetqE,EAAMrkC,OAAQuF,KAAKgpG,MAAMvuG,OAAQ,KAG5D,IAAIC,EAAGylG,EAAImK,EAMXV,EAAK5pG,KAJM8+B,EAAMnoB,KAAI,SAAUjc,GAC7B,OAAOA,EAAI,KAGIozE,GAGjB,IAAI/sE,EAAOf,KAAK+oG,MAEhB,IAAKruG,EAAI,EAAGylG,EAAKrhE,EAAMrkC,OAAS,EAAGC,EAAIylG,EAAIzlG,IACzC4vG,EAASxrE,EAAMpkC,IACf,SAAc4vG,EAAQvpG,EAAKtG,QAC3BsG,EAAOA,EAAKupG,GAOd,OAHAA,EAASxrE,EAAMA,EAAMrkC,OAAS,IAC9B,SAAc6vG,EAAQvpG,EAAKtG,QAC3BsG,EAAKupG,GAAUxtG,EACRkD,MA2MTwhG,EAAYvlG,UAAUg3F,OAAS,SAAUvxE,EAAMosD,EAActhB,GAE3D,KAAK,EAAAslB,EAAA,IAAapwD,GAChB,MAAM,IAAIvmB,UAAU,4BAItB,IAAIovG,EAAY7oF,EAAKynC,UAAUxyC,KAAI7Z,GAC1BlC,MAAMgD,QAAQd,IAA2B,IAAjBA,EAAMrC,OAAeqC,EAAM,GAAKA,IAKjE,OAAOktG,EAFCx9C,EAAOxsD,KAAKysD,QAAUzsD,KAEZuqG,EAAWz8B,IAuC/B0zB,EAAYvlG,UAAUi3F,QAAU,SAAUxxE,EAAM8qC,GAC9C,IAAI3iD,EAAI2iD,EAAOxsD,KAAKysD,QAAUzsD,KAC9B6J,EAAEk/F,OAAQ,SAAQl/F,EAAEk/F,MAAOrnF,GAE3B,IAAI8oF,EAAgB3gG,EAAEm/F,MAAM3qE,QAAO,CAAC5jC,EAAQinB,IAASjnB,EAASinB,IAG9D,OADA7X,EAAEm/F,OAAQ,SAAqBtnF,EAAM8oF,GAC9B3gG,GA4CT23F,EAAYvlG,UAAUwwD,MAAQ,WAM5B,OALQ,IAAI+0C,EAAY,CACtBzgG,MAAM,SAAMf,KAAK+oG,OACjBrnF,MAAM,SAAM1hB,KAAKgpG,OACjB7D,SAAUnlG,KAAKipG,aAWnBzH,EAAYvlG,UAAUylB,KAAO,WAC3B,OAAO1hB,KAAKgpG,MAAMlqG,MAAM,IAc1B0iG,EAAYvlG,UAAU0a,IAAM,SAAUzC,GAEpC,IAAIu2F,EAAKzqG,KAcLe,EAZU,SAAS6+F,EAAQ9iG,EAAOgiC,GACpC,OAAI,EAAAgzC,EAAA,IAAQh1E,GACHA,EAAM6Z,KAAI,SAAU25B,EAAO51C,GAChC,OAAOklG,EAAQtvD,EAAOxR,EAAMoD,OAAOxnC,OAG9BwZ,EAASpX,EAAOgiC,EAAO2rE,GAMvB7K,CAAQ5/F,KAAK+oG,MAAO,IAE/B,OAAO,IAAIvH,EAAYzgG,OADW5C,IAAnB6B,KAAKipG,WAA0B,SAAiBloG,EAAM,WAAU5C,IAYjFqjG,EAAYvlG,UAAU0F,QAAU,SAAUuS,GAExC,IAAIu2F,EAAKzqG,MAEK,SAAS4/F,EAAQ9iG,EAAOgiC,IAChC,EAAAgzC,EAAA,IAAQh1E,GACVA,EAAM6E,SAAQ,SAAU2uC,EAAO51C,GAC7BklG,EAAQtvD,EAAOxR,EAAMoD,OAAOxnC,OAG9BwZ,EAASpX,EAAOgiC,EAAO2rE,GAI3B7K,CAAQ5/F,KAAK+oG,MAAO,KAStBvH,EAAYvlG,UAAUsjG,QAAU,WAC9B,OAAO,SAAMv/F,KAAK+oG,QASpBvH,EAAYvlG,UAAUktD,QAAU,WAC9B,OAAOnpD,KAAK+oG,OAadvH,EAAYvlG,UAAU44F,OAAS,SAAU5+B,GACvC,OAAO,SAAOj2D,KAAK+oG,MAAO9yC,IAS5BurC,EAAYvlG,UAAUyD,SAAW,WAC/B,OAAO,SAAOM,KAAK+oG,QASrBvH,EAAYvlG,UAAUmtD,OAAS,WAC7B,MAAO,CACLkqB,OAAQ,cACRvyE,KAAMf,KAAK+oG,MACXrnF,KAAM1hB,KAAKgpG,MACX7D,SAAUnlG,KAAKipG,YAanBzH,EAAYvlG,UAAUyuG,SAAW,SAAU9hE,GAEzC,GAAIA,GAOF,IALI,EAAAkpC,EAAA,IAAYlpC,KACdA,EAAIA,EAAE6f,cAIH,EAAAqpB,EAAA,IAASlpC,MAAO,OAAUA,GAC7B,MAAM,IAAIztC,UAAU,kDAItBytC,EAAI,EAaN,IAVA,IAAI+hE,EAAS/hE,EAAI,EAAIA,EAAI,EACrBgiE,EAAOhiE,EAAI,GAAKA,EAAI,EAEpB6iD,EAAOzrF,KAAKgpG,MAAM,GAClB6B,EAAU7qG,KAAKgpG,MAAM,GAErBvpG,EAAIgG,KAAK+iB,IAAIijE,EAAOmf,EAAMC,EAAUF,GAEpC5pG,EAAO,GAEFrG,EAAI,EAAGA,EAAI+E,EAAG/E,IACrBqG,EAAKrG,GAAKsF,KAAK+oG,MAAMruG,EAAIkwG,GAAMlwG,EAAIiwG,GAIrC,OAAO,IAAInJ,EAAY,CACrBzgG,KAAMA,EACN2gB,KAAM,CAACjiB,GACP0lG,SAAUnlG,KAAKipG,aAiBnBzH,EAAYkJ,SAAW,SAAUhpF,EAAM5kB,EAAO8rC,EAAGklC,GAC/C,KAAK,EAAAgE,EAAA,IAAQpwD,GACX,MAAM,IAAIvmB,UAAU,kCAGtB,GAAoB,IAAhBumB,EAAKjnB,OACP,MAAM,IAAI0mC,MAAM,4CAmBlB,GAfAzf,EAAOA,EAAK/K,KAAI,SAAUhD,GAQxB,IANI,EAAAm+D,EAAA,IAAYn+D,KAEdA,EAAIA,EAAE80C,cAIH,EAAAqpB,EAAA,IAASn+D,MAAO,OAAUA,IAAMA,EAAI,EACvC,MAAM,IAAIwtB,MAAM,yCAGlB,OAAOxtB,KAGLi1B,GAOF,IALI,EAAAkpC,EAAA,IAAYlpC,KACdA,EAAIA,EAAE6f,cAIH,EAAAqpB,EAAA,IAASlpC,MAAO,OAAUA,GAC7B,MAAM,IAAIztC,UAAU,kDAItBytC,EAAI,EAGN,IAQIkiE,EARAH,EAAS/hE,EAAI,EAAIA,EAAI,EACrBgiE,EAAOhiE,EAAI,GAAKA,EAAI,EAEpB6iD,EAAO/pE,EAAK,GACZmpF,EAAUnpF,EAAK,GAEfjiB,EAAIgG,KAAK+iB,IAAIijE,EAAOmf,EAAMC,EAAUF,GAKxC,IAAI,EAAA74B,EAAA,IAAQh1E,GAAQ,CAElB,GAAIA,EAAMrC,SAAWgF,EAEnB,MAAM,IAAI0hC,MAAM,8BAIlB2pE,EAAS,SAAgBpwG,GAEvB,OAAOoC,EAAMpC,SAEV,IAAI,EAAAo3E,EAAA,IAASh1E,GAAQ,CAE1B,IAAIiuG,EAAKjuG,EAAM4kB,OAEf,GAAkB,IAAdqpF,EAAGtwG,QAAgBswG,EAAG,KAAOtrG,EAE/B,MAAM,IAAI0hC,MAAM,yBAIlB2pE,EAAS,SAAgBpwG,GAEvB,OAAOoC,EAAMR,IAAI,CAAC5B,UAIpBowG,EAAS,WAEP,OAAOhuG,GAKNgxE,IAEHA,GAAe,EAAAgE,EAAA,IAAYg5B,EAAO,IAAMA,EAAO,GAAGpjD,IAAI,GACpD,GAIJ,IAAI3mD,EAAO,GAEX,GAAI2gB,EAAKjnB,OAAS,EAAG,CAEnBsG,GAAO,SAAOA,EAAM2gB,EAAMosD,GAE1B,IAAK,IAAIxkE,EAAI,EAAGA,EAAI7J,EAAG6J,IACrBvI,EAAKuI,EAAIshG,GAAMthG,EAAIqhG,GAAUG,EAAOxhG,GAKxC,OAAO,IAAIk4F,EAAY,CACrBzgG,KAAMA,EACN2gB,KAAM,CAAC+pE,EAAMof,MAajBrJ,EAAYjuB,SAAW,SAAUzjB,GAC/B,OAAO,IAAI0xC,EAAY1xC,IAazB0xC,EAAYvlG,UAAU+uG,SAAW,SAAUtwG,EAAGyuB,GAE5C,MAAK,EAAA2oD,EAAA,IAASp3E,KAAO,OAAUA,KAAO,EAAAo3E,EAAA,IAAS3oD,KAAO,OAAUA,IAC9D,MAAM,IAAIgY,MAAM,uCAIlB,GAA0B,IAAtBnhC,KAAKgpG,MAAMvuG,OACb,MAAM,IAAI0mC,MAAM,4CAUlB,OANA,SAAczmC,EAAGsF,KAAKgpG,MAAM,KAC5B,SAAc7/E,EAAGnpB,KAAKgpG,MAAM,IAE5BxH,EAAYyJ,UAAUvwG,EAAGyuB,EAAGnpB,KAAK+oG,OAG1B/oG,MAWTwhG,EAAYyJ,UAAY,SAAUvwG,EAAGyuB,EAAGpoB,GAEtC,IAAImqG,EAAKnqG,EAAKrG,GACdqG,EAAKrG,GAAKqG,EAAKooB,GACfpoB,EAAKooB,GAAK+hF,GAyBL1J,IACN,CACD5uB,SAAS,I,WC53BPu4B,GAAgB,WAIlB,OADAA,GAAgB,UACT,IAGL,GAAe,CAAC,aAAc,WAAY,eAAgB,aAOnDC,IAA6B,QAAQ,QAAS,IAAc,SAAqB59C,GAC1F,IAAI,UACF6pC,EAAS,QACT9zD,EAAO,YACPi+D,EAAW,SACXjzC,GACEf,EAIA+1B,EAAQ4nB,KA6SZ,OAxSA5nB,EAAM/X,MAAQ,CAAC,CACb7rE,KAAM,SACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,UACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,YACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,WACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,OACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,SACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,QACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,QACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,SACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,cACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,eACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,QACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,QACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,UACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,YACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,OACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,WACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,OACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,SACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,OACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,YACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,eACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,YACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,iBACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,YACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,kBACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,eACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,eACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,yBACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,YACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,OACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,aACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,eACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,kBACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,YACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,aACNC,KAAMkyE,EAAA,IACL,CACDnyE,KAAM,SACNC,KAAMkyE,EAAA,KAGRyR,EAAM8nB,YAAc,CAAC,CACnBjsG,KAAM,SACN84E,GAAI,YACJpQ,QAAS,SAAiBjkE,GAMxB,GALKwzF,GACHiU,GAAiBznG,IAIf,QAAOA,GAAK,GACd,MAAM,IAAI1I,UAAU,uFAA8F0I,EAA9F,yDAGtB,OAAO,IAAIwzF,EAAUxzF,KAEtB,CACDzE,KAAM,SACN84E,GAAI,UACJpQ,QAAS,SAAiBjkE,GAKxB,OAJK0/B,GACHgoE,GAAe1nG,GAGV,IAAI0/B,EAAQ1/B,EAAG,KAEvB,CACDzE,KAAM,SACN84E,GAAI,SACJpQ,QAAS,SAAiBjkE,GACxB,OAAOA,EAAI,KAEZ,CACDzE,KAAM,YACN84E,GAAI,UACJpQ,QAAS,SAAiBjkE,GAKxB,OAJK0/B,GACHgoE,GAAe1nG,GAGV,IAAI0/B,EAAQ1/B,EAAE4kD,WAAY,KAElC,CACDrpD,KAAM,WACN84E,GAAI,YACJpQ,QAAS,SAAiBjkE,GACxB,MAAM,IAAI1I,UAAU,+JAErB,CACDiE,KAAM,WACN84E,GAAI,UACJpQ,QAAS,SAAiBjkE,GAKxB,OAJK0/B,GACHgoE,GAAe1nG,GAGV,IAAI0/B,EAAQ1/B,EAAEslD,UAAW,KAEjC,CACD/pD,KAAM,SACN84E,GAAI,WACJpQ,QAAS,SAAiBjkE,GACnB0qD,GACHi9C,GAAgB3nG,GAGlB,IAAI0F,EAAI,IAAIglD,EAAS1qD,GAErB,GAAI0F,EAAE4/C,YAActlD,EAClB,MAAM,IAAI1I,UAAU,mGAA0G0I,EAA1G,uDAGtB,OAAO0F,IAER,CAQDnK,KAAM,SACN84E,GAAI,SACJpQ,QAAS,SAAiBjkE,GACxB,IAAIpE,EAAIkG,OAAO9B,GAEf,GAAIiD,MAAMrH,GACR,MAAM,IAAI0hC,MAAM,mBAAqBt9B,EAAI,iBAG3C,OAAOpE,IAER,CACDL,KAAM,SACN84E,GAAI,YACJpQ,QAAS,SAAiBjkE,GACnBwzF,GACHiU,GAAiBznG,GAGnB,IACE,OAAO,IAAIwzF,EAAUxzF,GACrB,MAAOpF,GACP,MAAM,IAAI0iC,MAAM,mBAAqBt9B,EAAI,qBAG5C,CACDzE,KAAM,SACN84E,GAAI,WACJpQ,QAAS,SAAiBjkE,GACnB0qD,GACHi9C,GAAgB3nG,GAGlB,IACE,OAAO,IAAI0qD,EAAS1qD,GACpB,MAAOpF,GACP,MAAM,IAAI0iC,MAAM,mBAAqBt9B,EAAI,oBAG5C,CACDzE,KAAM,SACN84E,GAAI,UACJpQ,QAAS,SAAiBjkE,GACnB0/B,GACHgoE,GAAe1nG,GAGjB,IACE,OAAO,IAAI0/B,EAAQ1/B,GACnB,MAAOpF,GACP,MAAM,IAAI0iC,MAAM,mBAAqBt9B,EAAI,mBAG5C,CACDzE,KAAM,UACN84E,GAAI,SACJpQ,QAAS,SAAiBjkE,GACxB,OAAQA,IAET,CACDzE,KAAM,UACN84E,GAAI,YACJpQ,QAAS,SAAiBjkE,GAKxB,OAJKwzF,GACHiU,GAAiBznG,GAGZ,IAAIwzF,GAAWxzF,KAEvB,CACDzE,KAAM,UACN84E,GAAI,WACJpQ,QAAS,SAAiBjkE,GAKxB,OAJK0qD,GACHi9C,GAAgB3nG,GAGX,IAAI0qD,GAAU1qD,KAEtB,CACDzE,KAAM,UACN84E,GAAI,SACJpQ,QAAS,SAAiBjkE,GACxB,OAAOy6B,OAAOz6B,KAEf,CACDzE,KAAM,QACN84E,GAAI,SACJpQ,QAAS,SAAiB1O,GAKxB,OAJKooC,GAwBX,WACE,MAAM,IAAIrgE,MAAM,uEAxBVsqE,GAGK,IAAIjK,EAAYpoC,KAExB,CACDh6D,KAAM,SACN84E,GAAI,QACJpQ,QAAS,SAAiBz8D,GACxB,OAAOA,EAAO89C,aAGXo6B,KAGT,SAAS+nB,GAAiBznG,GACxB,MAAM,IAAIs9B,MAAM,wBAAwBe,OAAOr+B,EAAG,qDAGpD,SAAS0nG,GAAe1nG,GACtB,MAAM,IAAIs9B,MAAM,wBAAwBe,OAAOr+B,EAAG,wDAOpD,SAAS2nG,GAAgB3nG,GACvB,MAAM,IAAIs9B,MAAM,wBAAwBe,OAAOr+B,EAAG,oD,eC5XhD,GAAO,YACP,GAAe,CAAC,SACT6nG,IAAiC,QAAQ,GAAM,IAAel+C,IACvE,IAAI,MACF+1B,GACE/1B,EA+BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,IAER6qB,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEgiD,SAEX0I,SAAU,SAAkB1qD,GAC1B,OAAe,IAARA,EAAEyF,GAAW6W,SAAStc,EAAEpE,IAEjC,iBAAkB,SAAqBoE,GACrC,OAAO,SAAQA,EAAG7D,YC/CpB,GAAO,YACP,GAAe,CAAC,SACT2rG,IAAiC,QAAQ,GAAM,IAAen+C,IACvE,IAAI,MACF+1B,GACE/1B,EA+BJ,OAAO+1B,EAAM,GAAM,CACjB,0CAA2C,WACzC,OAAO,GAET,oDAAqD,WACnD,OAAO,GAET,iBAAkB,SAAqB1/E,GACrC,OAAO,SAAQA,EAAG7D,YC7CpBqoD,GAAK,SAKF,SAASujD,GAAiB/nG,GAC/B,OAAOA,EAAI,EAGN,SAASgoG,GAAiBhoG,GAC/B,OAAOA,EAAI,EAGN,SAASioG,GAAajoG,GAC3B,OAAa,IAANA,EAGF,SAASkoG,GAAYloG,GAC1B,OAAO8B,OAAOmB,MAAMjD,GAVtB+nG,GAAiB/nB,UAAYx7B,GAI7BwjD,GAAiBhoB,UAAYx7B,GAI7ByjD,GAAajoB,UAAYx7B,GAIzB0jD,GAAYloB,UAAYx7B,GClBxB,IAAI,GAAO,aACP,GAAe,CAAC,SACT2jD,IAAkC,QAAQ,GAAM,IAAex+C,IACxE,IAAI,MACF+1B,GACE/1B,EAiCJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQq/B,GACRxU,UAAW,SAAmBxzF,GAC5B,OAAQA,EAAEohD,UAAYphD,EAAEw/C,WAAax/C,EAAEiD,SAEzCynD,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE8P,EAAI,GAAK9P,EAAEpE,EAAI,GAE1B8mF,KAAM,SAAc1iF,GAClB,OAAO7D,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YClDpB,GAAO,QACP,GAAe,CAAC,SACTisG,IAA6B,QAAQ,GAAM,IAAez+C,IACnE,IAAI,MACF+1B,GACE/1B,EA+BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQu/B,GACR1U,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEiD,SAEXynD,SAAU,SAAkB1qD,GAC1B,OAAO,GAET0/B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEiD,SAEXy/E,KAAM,SAAc1iF,GAClB,OAAO8B,OAAOmB,MAAMjD,EAAE/G,QAExB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG8B,OAAOmB,aC7CxB,SAAS,GAAYjD,EAAGC,EAAG4sE,GAEhC,GAAIA,QACF,OAAO7sE,EAAE2/C,GAAG1/C,GAId,GAAID,EAAE2/C,GAAG1/C,GACP,OAAO,EAIT,GAAID,EAAEiD,SAAWhD,EAAEgD,QACjB,OAAO,EAIT,GAAIjD,EAAEsc,YAAcrc,EAAEqc,WAAY,CAEhC,IAAIzS,EAAO7J,EAAEggC,MAAM//B,GAAGqH,MAEtB,GAAIuC,EAAK21C,SACP,OAAO,EAGP,IAAI36B,EAAM7kB,EAAEtG,YAAYmrB,IAAI7kB,EAAEsH,MAAOrH,EAAEqH,OACvC,OAAOuC,EAAK03C,IAAI18B,EAAIk6B,MAAM8tB,IAK9B,OAAO,ECpCT,IAAI,GAAO,cACP,GAAe,CAAC,QAAS,UAClBw7B,IAAmC,QAAQ,GAAM,IAAe1+C,IACzE,IAAI,MACF+1B,EAAK,OACLz3B,GACE0B,EAUJ,OAAO+1B,EAAM,GAAM,CACjB,mBAAoB,SAAwB1/E,EAAGC,GAC7C,OAAOD,IAAMC,GAEf,iBAAkB,SAAsBD,EAAGC,GACzC,OAAO,QAAYD,EAAGC,EAAGgoD,EAAO4kB,UAElC,uBAAwB,SAA4B7sE,EAAGC,GACrD,OAAOD,EAAE2/C,GAAG1/C,IAAM,GAAeD,EAAGC,EAAGgoD,EAAO4kB,UAEhD,qBAAsB,SAA0B7sE,EAAGC,GACjD,OAAOD,EAAEkgD,OAAOjgD,IAElB,mBAAoB,SAAwBD,EAAGC,GAC7C,OCxBC,SAAuBD,EAAGC,EAAG4sE,GAClC,OAAO,QAAY7sE,EAAEmgC,GAAIlgC,EAAEkgC,GAAI0sC,KAAY,QAAY7sE,EAAEogC,GAAIngC,EAAEmgC,GAAIysC,GDuBxDy7B,CAActoG,EAAGC,EAAGgoD,EAAO4kB,UAEpC,aAAc,SAAkB7sE,EAAGC,GACjC,IAAKD,EAAEuoG,UAAUtoG,GACf,MAAM,IAAIq9B,MAAM,4CAGlB,OAAOnhC,KAAK6D,EAAE/G,MAAOgH,EAAEhH,aEtCzB,KF0CiC,QAAQ,GAAM,CAAC,QAAS,WAAYsmG,IACvE,IAAI,MACF7f,EAAK,OACLz3B,GACEs3C,EACJ,OAAO7f,EAAM,GAAM,CACjB,iBAAkB,SAAsB1/E,EAAGC,GACzC,OAAO,QAAYD,EAAGC,EAAGgoD,EAAO4kB,eEjDnB,CAAC,UAqDT27B,IAA8B,QAtD9B,SAsD4C,IAAe7+C,IACpE,IAAI,MACF+1B,GACE/1B,EA2BAgf,EAAS+W,EAAM,SAAU,CAC3B,GAAI,WACF,OAAO,GAET/W,OAAQ,SAAgB3oE,GACtB,OAAOA,GAET4/D,OAAQ,SAAgB5/D,GACtB,GAAU,QAANA,EAAa,OAAO0hC,IACxB,IArF4B6kC,EAC5BkiC,EAoFIC,GApFJD,GAD4BliC,EAqFyBvmE,GApFpB8/B,MAAM,2CAUlC,CACLymC,QACAoiC,MATU,CACV,KAAM,EACN,KAAM,EACN,KAAM,IACNF,EAAyB,IAMzBG,YALgBH,EAAyB,GAMzCI,eALmBJ,EAAyB,IAQvC,KAqEL,GAAIC,EACF,OA5DR,SAAuC12D,GAIrC,IAHA,IAAIp2C,EAAImhC,SAASiV,EAAM42D,YAAa52D,EAAM22D,OACtCjjG,EAAI,EAEC7O,EAAI,EAAGA,EAAIm7C,EAAM62D,eAAejyG,OAAQC,IAE/C6O,GADiBq3B,SAASiV,EAAM62D,eAAehyG,GAAIm7C,EAAM22D,OACvC/mG,KAAKmN,IAAIijC,EAAM22D,MAAO9xG,EAAI,GAG9C,IAAIwO,EAASzJ,EAAI8J,EAEjB,GAAIzC,MAAMoC,GACR,MAAM,IAAI+5B,YAAY,WAAa4S,EAAMu0B,MAAQ,wBAGnD,OAAOlhE,EA6CMyjG,CAA8BJ,GAGvC,IAAI7qF,EAAO,EACPkrF,EAAsB/oG,EAAE8/B,MAAM,iCAE9BipE,IAGFlrF,EAAO/b,OAAOinG,EAAoB,IAClC/oG,EAAI+oG,EAAoB,IAG1B,IAAIpmD,EAAM7gD,OAAO9B,GAEjB,GAAIiD,MAAM0/C,GACR,MAAM,IAAIvjB,YAAY,WAAap/B,EAAI,wBAGzC,GAAI+oG,EAAqB,CAGvB,GAAIpmD,EAAM,GAAK9kC,EAAO,EAEpB,MAAM,IAAIuhB,YAAY,WAAYf,OAAOr+B,EAAG,sBAI1C2iD,GAAO,IAAM9kC,EAAO,KACtB8kC,GAAY,GAAK9kC,GAIrB,OAAO8kC,GAET6wC,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE4kD,YAEX8F,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAEslD,WAEXo9B,KAAM,SAAc1iF,GAClB,MAAM,IAAIs9B,MAAM,iDAElBmnD,KAAM,SAAezkF,GACnB,OAAO,GAET,sBAAuB,SAAwB0B,EAAMsnG,GACnD,OAAOtnG,EAAKkjD,SAASokD,IAEvB,iBAAkB,SAAqBhpG,GACrC,OAAO,SAAQA,EAAG7D,SAYtB,OAJAwsE,EAAO+G,SAAW,SAAUzjB,GAC1B,OAAOz9C,WAAWy9C,EAAKhzD,QAGlB0vE,KC/JL,GAAO,UACP,GAAe,CAAC,SACTsgC,IAA+B,QAAQ,GAAM,IAAet/C,IACrE,IAAI,MACF+1B,GACE/1B,EA6BJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,OAAO,GAETyK,QAAS,SAAiBnqF,GACxB,OAAOA,GAET2oE,OAAQ,SAAgB3oE,GACtB,QAASA,GAEXykF,KAAM,SAAezkF,GACnB,OAAO,GAETwzF,UAAW,SAAmBxzF,GAC5B,OAAQA,EAAEw/C,UAEZogB,OAAQ,SAAgB5/D,GAEtB,IAAIkpG,EAAQlpG,EAAEq5B,cAEd,GAAc,SAAV6vE,EACF,OAAO,EACF,GAAc,UAAVA,EACT,OAAO,EAIT,IAAIvmD,EAAM7gD,OAAO9B,GAEjB,GAAU,KAANA,IAAaiD,MAAM0/C,GACrB,QAASA,EAGX,MAAM,IAAIrlB,MAAM,mBAAqBt9B,EAAI,mBAE3C,iBAAkB,SAAqBA,GACrC,OAAO,SAAQA,EAAG7D,YCrEpB,GAAe,CAAC,QAAS,WAClBgtG,IAA+B,QAF/B,UAE6C,IAAex/C,IACrE,IAAI,MACF+1B,EAAK,QACLhgD,GACEiqB,EAwCJ,OAAO+1B,EAAM,UAAW,CACtB,GAAI,WACF,OAAOhgD,EAAQ0pE,MAEjBzgC,OAAQ,SAAgB3oE,GACtB,OAAO,IAAI0/B,EAAQ1/B,EAAG,IAExB,iBAAkB,SAAsBmgC,EAAIC,GAC1C,OAAO,IAAIV,EAAQS,EAAIC,IAGzB,uBAAwB,SAA4BD,EAAIC,GACtD,OAAO,IAAIV,EAAQS,EAAGykB,WAAYxkB,EAAGwkB,aAEvC8F,SAAU,SAAkB1qD,GAC1B,OAAO,IAAI0/B,EAAQ1/B,EAAEslD,UAAW,IAElC5lB,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE4oD,SAEXgX,OAAQ,SAAgB5/D,GACtB,OAAO0/B,EAAQ1/B,IAEjBykF,KAAM,SAAezkF,GACnB,OAAO0/B,EAAQ,IAEjB5nC,OAAQ,SAAgBkI,GACtB,GAAI,OAAQA,GAAK,OAAQA,EACvB,OAAO,IAAI0/B,EAAQ1/B,EAAEmgC,GAAIngC,EAAEogC,IAG7B,GAAI,MAAOpgC,GAAK,QAASA,GAAK,QAASA,GAAK,QAASA,EACnD,OAAO,IAAI0/B,EAAQ1/B,GAGrB,MAAM,IAAIs9B,MAAM,gFAElB,iBAAkB,SAAqBt9B,GACrC,OAAO,SAAQA,EAAG7D,YCrFpB,GAAO,YACP,GAAe,CAAC,SACTktG,IAAiC,QAAQ,GAAM,IAAe1/C,IACvE,IAAI,MACF+1B,GACE/1B,EAqBJ,OAAO+1B,EAAM,GAAM,CACjB,cAAe,SAAmBh+E,EAAMswC,GACtC,OAAOtwC,EAAK4oF,UAAUt4C,SC5BxB,GAAK,SACLunD,GAAK,iBACF,SAAS+P,GAAUhkG,GACxB,OAAO1D,KAAK0F,IAAIhC,GAGX,SAASikG,GAAUjkG,EAAGC,GAC3B,OAAOD,EAAIC,EAON,SAASikG,GAAelkG,EAAGC,GAChC,OAAOD,EAAIC,EAON,SAASkkG,GAAiBzpG,GAC/B,OAAQA,EAGH,SAAS0pG,GAAgB1pG,GAC9B,OAAOA,EAGF,SAAS2pG,GAAW3pG,GACzB,OAAO,QAAKA,GAGP,SAAS4pG,GAAW5pG,GACzB,OAAO4B,KAAKkd,KAAK9e,GAGZ,SAAS6pG,GAAW7pG,GACzB,OAAOA,EAAIA,EAAIA,EAGV,SAAS8pG,GAAU9pG,GACxB,OAAO4B,KAAKq9B,IAAIj/B,GAGX,SAAS+pG,GAAY/pG,GAC1B,OAAO,QAAMA,GAkBR,SAASgqG,GAAU1kG,EAAGC,GAC3B,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAI+3B,MAAM,sDAMlB,IAFA,IAAI30B,EAES,IAANpD,GACLoD,EAAIrD,EAAIC,EACRD,EAAIC,EACJA,EAAIoD,EAGN,OAAOrD,EAAI,GAAKA,EAAIA,EAUf,SAAS2kG,GAAU3kG,EAAGC,GAC3B,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAI+3B,MAAM,sDAGlB,GAAU,IAANh4B,GAAiB,IAANC,EACb,OAAO,EAQT,IAHA,IAAI0B,EACA8+C,EAAOzgD,EAAIC,EAEF,IAANA,GAELA,EAAID,GADJ2B,EAAI1B,GAEJD,EAAI2B,EAGN,OAAOrF,KAAK0F,IAAIy+C,EAAOzgD,GASlB,SAAS4kG,GAAUlqG,GACxB,OAAO4B,KAAK49B,IAAIx/B,GASX,SAASmqG,GAAYnqG,GAC1B,OAAO,QAAMA,GASR,SAASoqG,GAAWpqG,GACzB,OAAO,QAAKA,GAqBP,SAASqqG,GAAUrqG,EAAGC,GAC3B,GAAIA,EAAI,EAIN,OAAOD,EAAIC,EAAI2B,KAAKgd,MAAM5e,EAAIC,GACzB,GAAU,IAANA,EACT,OAAOD,EAIP,MAAM,IAAIs9B,MAAM,+CAYb,SAAS,GAAch4B,EAAGy5B,GAC/B,IAAIw3C,EAAMx3C,EAAO,EAMjB,GAJIw3C,IACFx3C,GAAQA,GAGG,IAATA,EACF,MAAM,IAAIzB,MAAM,yBAGlB,GAAIh4B,EAAI,GAAK1D,KAAK0F,IAAIy3B,GAAQ,GAAM,EAClC,MAAM,IAAIzB,MAAM,wCAIlB,GAAU,IAANh4B,EACF,OAAOixE,EAAM31C,IAAW,EAG1B,IAAKtkB,SAAShX,GACZ,OAAOixE,EAAM,EAAIjxE,EAGnB,IAAItF,EAAI4B,KAAKmN,IAAInN,KAAK0F,IAAIhC,GAAI,EAAIy5B,GAIlC,OADA/+B,EAAIsF,EAAI,GAAKtF,EAAIA,EACVu2E,EAAM,EAAIv2E,EAAIA,EAuBhB,SAASsqG,GAAWtqG,GACzB,OAAO,QAAKA,GAOP,SAASuqG,GAAavqG,GAC3B,OAAOA,EAAIA,EAWN,SAASwqG,GAAWllG,EAAGC,GAE5B,IAAI0B,EAEAk8C,EAEAx6C,EAEA3I,EAAI,EACJyqG,EAAQ,EACRxqG,EAAI,EACJyqG,EAAQ,EAEZ,KAAK,OAAUplG,MAAO,OAAUC,GAC9B,MAAM,IAAI+3B,MAAM,uDAGlB,KAAO/3B,GAELoD,EAAIrD,GADJ69C,EAAIvhD,KAAKgd,MAAMtZ,EAAIC,IACPA,EACZ0B,EAAIjH,EACJA,EAAIyqG,EAAQtnD,EAAInjD,EAChByqG,EAAQxjG,EACRA,EAAIhH,EACJA,EAAIyqG,EAAQvnD,EAAIljD,EAChByqG,EAAQzjG,EACR3B,EAAIC,EACJA,EAAIoD,EAWN,OANIrD,EAAI,EACA,EAAEA,GAAImlG,GAAQC,GAEd,CAACplG,EAAGA,EAAImlG,EAAQ,EAAGC,GAatB,SAASC,GAAU3qG,EAAGC,GAG3B,OAAID,EAAIA,EAAI,GAAKC,IAAM2gC,KAAY5gC,EAAIA,EAAI,GAAKC,KAAM,IAC7C,EAGF2B,KAAKmN,IAAI/O,EAAGC,GAWd,SAAS2qG,GAAY3xG,GAC1B,IAAI4xG,EAAW1uE,UAAUvlC,OAAS,QAAsB0D,IAAjB6hC,UAAU,GAAmBA,UAAU,GAAK,EACnF,OAAO3tB,YAAW,QAAQvV,EAAO4xG,IA7TnCvB,GAAUtpB,UAAY,GAItBupB,GAAUvpB,UAAYuZ,GAQtBiQ,GAAexpB,UAAYuZ,GAQ3BkQ,GAAiBzpB,UAAY,GAI7B0pB,GAAgB1pB,UAAY,GAI5B2pB,GAAW3pB,UAAY,GAIvB4pB,GAAW5pB,UAAY,GAIvB6pB,GAAW7pB,UAAY,GAIvB8pB,GAAU9pB,UAAY,GAItB+pB,GAAY/pB,UAAY,GAgCxBgqB,GAAUhqB,UAAYuZ,GA8BtB0Q,GAAUjqB,UAAYuZ,GAUtB2Q,GAAUlqB,UAAY,GAUtBmqB,GAAYnqB,UAAY,GAUxBoqB,GAAWpqB,UAAY,GAiCvBqqB,GAAUrqB,UAAYuZ,GA2DtB,GAAcvZ,UAAYuZ,GAI1B+Q,GAAWtqB,UAAY,GAQvBuqB,GAAavqB,UAAY,GAiDzBwqB,GAAWxqB,UAAYuZ,GAiBvBoR,GAAU3qB,UAAYuZ,GAatBqR,GAAY5qB,UAAYuZ,GClUxB,IAAI,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,aAC5BuR,IAAiC,QAAQ,GAAM,IAAenhD,IACvE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,UACNurC,GACE7pC,EA0BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ+gC,GACRhqE,QAAS,SAAiB1/B,GACxB,OAAOA,GAETwzF,UAAW,SAAmBxzF,GAC5B,OAAOA,GAET0qD,SAAU,SAAkB1qD,GAC1B,OAAOA,GAET0iF,KAAM,SAAc1iF,GAClB,OAAOA,EAAE4oD,SAEX,iBAAkB,SAAqB5oD,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1B,mBAAoB,SAAuB6D,GAEzC,MAAyB,cAAlBioD,EAAO0gB,OAAyB,IAAI6qB,GAAWxzF,IAAMA,QCrD9D,GAAO,OACP,GAAe,CAAC,SACT+qG,IAA4B,QAAQ,GAAM,IAAephD,IAClE,IAAI,MACF+1B,GACE/1B,EA0BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQkhC,GACRnqE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE6jD,IAAI7jD,GAAG6jD,IAAI7jD,IAEtBwzF,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE++C,MAAM/+C,GAAG++C,MAAM/+C,IAE1B0qD,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE+O,IAAI,IAEf,iBAAkB,SAAqB/O,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1BumF,KAAM,SAAc1iF,GAClB,OAAOA,EAAE+O,IAAI,SC/Cf,GAAO,QACP,GAAe,CAAC,QAAS,WAClBi8F,IAA6B,QAAQ,GAAM,IAAerhD,IACnE,IAAI,MACF+1B,EACAhgD,QAASurE,GACPthD,EA8BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQohC,GACRrqE,QAAS,SAAiB1/B,GACxB,IAAI2I,EAAI/G,KAAKq9B,IAAIj/B,EAAEmgC,IACnB,OAAO,IAAI8qE,EAAStiG,EAAI/G,KAAK69B,IAAIz/B,EAAEogC,IAAM,EAAGz3B,EAAI/G,KAAKg+B,IAAI5/B,EAAEogC,MAE7DozD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEi/B,MAAMe,MAAM,IAEvB,iBAAkB,SAAqBhgC,GACrC,OAAO,SAAQA,EAAG7D,YC9CpB,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAC5B+uG,IAA6B,QAAQ,GAAM,IAAevhD,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EACAvoB,QAASurE,GACPthD,EA2BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,GAAK,GAAKioD,EAAO6kB,YACZq9B,GAAYnqG,GAGZ,IAAIirG,EAASjrG,EAAG,GAAGw/B,MAAMugB,IAAIn+C,KAAK45C,OAG7C9b,QAAS,SAAiB1/B,GACxB,OAAO,IAAIirG,EAASjrG,GAAGw/B,MAAMugB,IAAIn+C,KAAK45C,OAExCg4C,UAAW,SAAmBxzF,GAC5B,OAAKA,EAAEiiD,cAAgBgG,EAAO6kB,YACrB9sE,EAAEw/B,MAGF,IAAIyrE,EAASjrG,EAAE4kD,WAAY,GAAGplB,MAAMugB,IAAIn+C,KAAK45C,OAGxD,iBAAkB,SAAqBx7C,GACrC,OAAO,SAAQA,EAAG7D,YCvDpB,GAAe,CAAC,SACTgvG,IAAsC,QAFtC,iBAEoD,IAAexhD,IAC5E,IAAI,MACF+1B,GACE/1B,EAcJ,OAAO+1B,EAAM,iBAAkB,CAC7B,iBAAkB8pB,GAClB,mBAAoB,SAAwBxpG,EAAGC,GAC7C,OAAOD,EAAE6jD,IAAI5jD,IAEf,uBAAwB,SAA4BD,EAAGC,GACrD,OAAOD,EAAE++C,MAAM9+C,IAEjB,qBAAsB,SAA0BD,EAAGC,GACjD,OAAOD,EAAE6jD,IAAI5jD,IAEf,gDAAiD,SAA4CD,EAAGC,GAC9F,IAAI2xB,EAAM3xB,EAAE2oD,QAEZ,OADAh3B,EAAI34B,MAAsB,OAAd24B,EAAI34B,MAAiB24B,EAAIw5E,WAAWprG,GAAK7D,KAAKy1B,EAAI34B,MAAO+G,GAC9D4xB,GAET,gDAAiD,SAA4C5xB,EAAGC,GAC9F,IAAI2xB,EAAM5xB,EAAE4oD,QAEZ,OADAh3B,EAAI34B,MAAsB,OAAd24B,EAAI34B,MAAiB24B,EAAIw5E,WAAWnrG,GAAK9D,KAAKy1B,EAAI34B,MAAOgH,GAC9D2xB,GAET,aAAc,SAAkB5xB,EAAGC,GACjC,OAAOD,EAAE8I,SAAS7I,SCxCpB,GAAO,OACP,GAAe,CAAC,QAAS,YAAa,WAAY,WAC3CorG,IAA4B,QAAQ,GAAM,IAAe1hD,IAClE,IAAI,MACF+1B,EACA8T,UAAW8X,EAAU,QACrBzzB,EACAntB,SAAU6gD,GACR5hD,EAgCJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ2hC,GACR5qE,QAAS,SAAiB1/B,GACxB,OAAgB,IAATA,EAAEogC,GAAWy3C,EAAQyyB,GAAWtqG,EAAEmgC,KAAOngC,EAAE0mD,QAEpD8sC,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAWtrG,EAAEm+C,IAAI,KAE9BuM,SAAU,SAAkB1qD,GAC1B,OAAO,IAAIurG,EAAUvrG,EAAE8P,EAAG,IAE5B,iBAAkB,SAAqB9P,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1BumF,KAAM,SAAc1iF,GAClB,OAAO7D,KAAK6D,EAAE/G,aCxDhB,GAAO,SACP,GAAe,CAAC,SACTuyG,IAA8B,QAAQ,GAAM,IAAe7hD,IACpE,IAAI,MACF+1B,GACE/1B,EA4BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ4hC,GACR7qE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE6jD,IAAI7jD,IAEfwzF,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE++C,MAAM/+C,IAEjB0qD,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE6jD,IAAI7jD,IAEf,iBAAkB,SAAqBA,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1BumF,KAAM,SAAc1iF,GAClB,OAAOA,EAAE+O,IAAI,SC/BZ,SAAS08F,GAAgBzrG,EAAGC,GACjC,GAAID,EAAEsc,aAAetc,EAAE4Q,aAAe3Q,EAAEqc,aAAerc,EAAE2Q,YACvD,MAAM,IAAI0sB,MAAM,wCAGlB,IAAIk2D,EAAYxzF,EAAEtG,YAElB,GAAIsG,EAAEiD,SAAWhD,EAAEgD,QACjB,OAAO,IAAIuwF,EAAU9xD,KAGvB,GAAI1hC,EAAEw/C,UAAYv/C,EAAE0/C,IAAI,IAAM3/C,EAAE2/C,GAAG1/C,GACjC,OAAOD,EAGT,GAAIC,EAAEu/C,UAAYx/C,EAAE2/C,IAAI,GACtB,OAAO1/C,EAGT,IAAKD,EAAEsc,aAAerc,EAAEqc,WAAY,CAClC,IAAKtc,EAAEsc,aAAerc,EAAEqc,WACtB,OAAItc,EAAEiiD,eAAiBhiD,EAAEgiD,aAChBjiD,EAGF,IAAIwzF,EAAU,GAGvB,IAAKxzF,EAAEsc,WACL,OAAIrc,EAAEgiD,aACGjiD,EAGLA,EAAEiiD,aACG,IAAIuxC,EAAU,GAGhBvzF,EAGT,IAAKA,EAAEqc,WACL,OAAItc,EAAEiiD,aACGhiD,EAGLA,EAAEgiD,aACG,IAAIuxC,EAAU,GAGhBxzF,EAIX,OAAO0rG,GAAQ1rG,EAAGC,GAAG,SAAUqF,EAAGC,GAChC,OAAOD,EAAIC,KAUR,SAASomG,GAAgB3rG,GAC9B,GAAIA,EAAEsc,aAAetc,EAAE4Q,YACrB,MAAM,IAAI0sB,MAAM,uCAGlB,IAAIk2D,EAAYxzF,EAAEtG,YACdkyG,EAAWpY,EAAU93C,UACzB83C,EAAUvrC,OAAO,CACfvM,UAAW,MAEb,IAAIr2C,EAASrF,EAAE+/B,KAAK,IAAIyzD,EAAU,IAKlC,OAJAnuF,EAAOyK,GAAKzK,EAAOyK,GAAK,KACxB0jF,EAAUvrC,OAAO,CACfvM,UAAWkwD,IAENvmG,EAuBF,SAASwmG,GAAe7rG,EAAGC,GAChC,GAAID,EAAEsc,aAAetc,EAAE4Q,aAAe3Q,EAAEqc,aAAerc,EAAE2Q,YACvD,MAAM,IAAI0sB,MAAM,uCAGlB,IAAIk2D,EAAYxzF,EAAEtG,YAElB,GAAIsG,EAAEiD,SAAWhD,EAAEgD,QACjB,OAAO,IAAIuwF,EAAU9xD,KAGvB,IAAIoqE,EAAS,IAAItY,GAAW,GAE5B,OAAIxzF,EAAEw/C,UAAYv/C,EAAE0/C,GAAGmsD,IAAW9rG,EAAE2/C,GAAG1/C,GAC9BA,EAGLA,EAAEu/C,UAAYx/C,EAAE2/C,GAAGmsD,GACd9rG,EAGJA,EAAEsc,YAAerc,EAAEqc,WAYjBovF,GAAQ1rG,EAAGC,GAAG,SAAUqF,EAAGC,GAChC,OAAOD,EAAIC,MAZNvF,EAAEsc,aAAetc,EAAEiiD,cAAgBhiD,EAAEgiD,cAAgBjiD,EAAEiiD,eAAiBhiD,EAAEgiD,eAAiBhiD,EAAEqc,WACzFwvF,EAGL9rG,EAAEiiD,cAAgBhiD,EAAEgiD,aACfjiD,EAAEsc,WAAatc,EAAIC,EAGrBD,EAAEsc,WAAarc,EAAID,EAevB,SAAS0rG,GAAQ1rG,EAAGC,EAAG4gB,GAC5B,IACIkrF,EAAOC,EAwBPC,EAASC,EAASC,EAzBlB3Y,EAAYxzF,EAAEtG,YAEd0yG,IAAUpsG,EAAE8P,EAAI,GAChBu8F,IAAUpsG,EAAE6P,EAAI,GAEpB,GAAIs8F,EAAO,CACTL,EAAQO,GAA6BX,GAAgB3rG,IAErD,IAAK,IAAInJ,EAAI,EAAGA,EAAIk1G,EAAMn1G,SAAUC,EAClCk1G,EAAMl1G,IAAM,OAGdk1G,EAAQO,GAA6BtsG,GAGvC,GAAIqsG,EAAO,CACTL,EAAQM,GAA6BX,GAAgB1rG,IAErD,IAAK,IAAIzF,EAAK,EAAGA,EAAKwxG,EAAMp1G,SAAU4D,EACpCwxG,EAAMxxG,IAAO,OAGfwxG,EAAQM,GAA6BrsG,GAKnC8rG,EAAMn1G,QAAUo1G,EAAMp1G,QACxBq1G,EAAUF,EACVG,EAAUF,EACVG,EAAUC,IAEVH,EAAUD,EACVE,EAAUH,EACVI,EAAUE,GAGZ,IAAIE,EAAWN,EAAQr1G,OACnB41G,EAAUN,EAAQt1G,OAClB61G,EAAkC,EAArB5rF,EAAKurF,EAAOC,GACzBK,EAAS,IAAIlZ,EAAuB,EAAbiZ,GACvBE,EAAW,IAAInZ,EAAU,GACzBoZ,EAAM,IAAIpZ,EAAU,GACpBoY,EAAWpY,EAAU93C,UAKzB,IAJA83C,EAAUvrC,OAAO,CACfvM,UAAW,MAGN6wD,EAAW,GACZ1rF,EAAKorF,IAAUM,GAAWL,IAAUM,MAAcC,IACpDC,EAASA,EAAO3sE,KAAK4sE,IAGvBA,EAAWA,EAAS5tD,MAAM6tD,GAG5B,KAAOJ,EAAU,GACX3rF,EAAKsrF,EAASD,IAAUM,MAAcC,IACxCC,EAASA,EAAO3sE,KAAK4sE,IAGvBA,EAAWA,EAAS5tD,MAAM6tD,GAW5B,OARApZ,EAAUvrC,OAAO,CACfvM,UAAWkwD,IAGM,IAAfa,IACFC,EAAO58F,GAAK48F,EAAO58F,GAGd48F,EAIT,SAASJ,GAA6BtsG,GAMpC,IAJA,IAAIsF,EAAItF,EAAEyF,EAENkD,EAAIrD,EAAE,GAAK,GAENzO,EAAI,EAAGA,EAAIyO,EAAE1O,SAAUC,EAAG,CAGjC,IAFA,IAAIiZ,EAAIxK,EAAEzO,GAAK,GAEN8oC,EAAI,EAAI7vB,EAAElZ,OAAQ+oC,KACzB7vB,EAAI,IAAMA,EAGZnH,GAAKmH,EAKP,IAFA,IAAIwV,EAAI3c,EAAE/R,OAEa,MAAhB+R,EAAEo1C,OAAOz4B,IACdA,IAGF,IAAI8L,EAAKpxB,EAAEhD,EACPw+B,EAAM7yB,EAAE1N,MAAM,EAAGqqB,EAAI,GAAK,GAC1Bw4B,EAAOtiB,EAAI5kC,OAEf,GAAIw6B,EAAK,EACP,KAAMA,EAAK0sB,EAIT,IAFA1sB,GAAM0sB,EAEC1sB,KACLoK,GAAO,SAEApK,EAAK0sB,IACdtiB,EAAMA,EAAIvgC,MAAM,EAAGm2B,GAAM,IAAMoK,EAAIvgC,MAAMm2B,IAO7C,IAFA,IAAI16B,EAAM,CAAC,GAEF2iG,EAAM,EAAGA,EAAM79D,EAAI5kC,QAAS,CAGnC,IAFA,IAAIinD,EAAOnnD,EAAIE,OAERinD,KACLnnD,EAAImnD,IAAS,GAGfnnD,EAAI,IAAMqmC,SAASvB,EAAIuiB,OAAOs7C,MAE9B,IAAK,IAAIwT,EAAK,EAAGA,EAAKn2G,EAAIE,SAAUi2G,EAC9Bn2G,EAAIm2G,GAAM,IACQ,OAAhBn2G,EAAIm2G,EAAK,SAA+BvyG,IAAhB5D,EAAIm2G,EAAK,KACnCn2G,EAAIm2G,EAAK,GAAK,GAGhBn2G,EAAIm2G,EAAK,IAAMn2G,EAAIm2G,IAAO,EAC1Bn2G,EAAIm2G,IAAO,GAKjB,OAAOn2G,EAAI00C,UAuBN,SAAS4pC,GAAOh1E,EAAGC,GACxB,GAAID,EAAEsc,aAAetc,EAAE4Q,aAAe3Q,EAAEqc,aAAerc,EAAE2Q,YACvD,MAAM,IAAI0sB,MAAM,wCAGlB,IAAIk2D,EAAYxzF,EAAEtG,YAElB,GAAIsG,EAAEiD,SAAWhD,EAAEgD,QACjB,OAAO,IAAIuwF,EAAU9xD,KAGvB,GAAI1hC,EAAEw/C,SACJ,OAAOv/C,EAGT,GAAIA,EAAEu/C,SACJ,OAAOx/C,EAGT,GAAIA,EAAE2/C,GAAG1/C,GACP,OAAO,IAAIuzF,EAAU,GAGvB,IAAIsY,EAAS,IAAItY,GAAW,GAE5B,OAAIxzF,EAAE2/C,GAAGmsD,GACAH,GAAgB1rG,GAGrBA,EAAE0/C,GAAGmsD,GACAH,GAAgB3rG,GAGpBA,EAAEsc,YAAerc,EAAEqc,WAQjBovF,GAAQ1rG,EAAGC,GAAG,SAAUqF,EAAGC,GAChC,OAAOD,EAAIC,KARNvF,EAAEsc,YAAerc,EAAEqc,WAIjB,IAAIk3E,EAAUxzF,EAAEiiD,eAAiBhiD,EAAEgiD,aAAerhB,KAAW,KAH3DkrE,EA6BN,SAASgB,GAAmB9sG,EAAGC,GACpC,GAAID,EAAEsc,aAAetc,EAAE4Q,aAAe3Q,EAAEqc,aAAerc,EAAE2Q,YACvD,MAAM,IAAI0sB,MAAM,2CAGlB,IAAIk2D,EAAYxzF,EAAEtG,YAElB,OAAIsG,EAAEiD,SAAWhD,EAAEgD,SAAWhD,EAAEgiD,eAAiBhiD,EAAEu/C,SAC1C,IAAIg0C,EAAU9xD,KAGnB1hC,EAAEw/C,UAAYv/C,EAAEu/C,SACXx/C,EAGJA,EAAEsc,YAAerc,EAAEqc,WAKpBrc,EAAEoiD,GAAG,IACAriD,EAAE++C,MAAMn9C,KAAKmN,IAAI,EAAG9O,EAAE2kD,YAAc,IAGtC5kD,EAAE++C,MAAM,IAAIy0C,EAAU,GAAGzkF,IAAI9O,IAR3B,IAAIuzF,EAAU9xD,KA8BlB,SAASqrE,GAAyB/sG,EAAGC,GAC1C,GAAID,EAAEsc,aAAetc,EAAE4Q,aAAe3Q,EAAEqc,aAAerc,EAAE2Q,YACvD,MAAM,IAAI0sB,MAAM,iDAGlB,IAAIk2D,EAAYxzF,EAAEtG,YAElB,OAAIsG,EAAEiD,SAAWhD,EAAEgD,SAAWhD,EAAEgiD,eAAiBhiD,EAAEu/C,SAC1C,IAAIg0C,EAAU9xD,KAGnB1hC,EAAEw/C,UAAYv/C,EAAEu/C,SACXx/C,EAGJC,EAAEqc,WAaHrc,EAAEoiD,GAAG,IACAriD,EAAE+/C,IAAIn+C,KAAKmN,IAAI,EAAG9O,EAAE2kD,YAAc,IAAIhmC,QAGxC5e,EAAE+/C,IAAI,IAAIyzC,EAAU,GAAGzkF,IAAI9O,IAAI2e,QAhBhC5e,EAAEiiD,aACG,IAAIuxC,GAAW,GAGnBxzF,EAAEsc,WAIA,IAAIk3E,EAAU,GAHZ,IAAIA,EAAU9xD,KC7c3B,IACI,GAAK,iBACF,SAASsrE,GAAahtG,EAAGC,GAC9B,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAIq9B,MAAM,wCAGlB,OAAOt9B,EAAIC,EAGN,SAASgtG,GAAajtG,GAC3B,KAAK,OAAUA,GACb,MAAM,IAAIs9B,MAAM,uCAGlB,OAAQt9B,EAGH,SAASktG,GAAYltG,EAAGC,GAC7B,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAIq9B,MAAM,uCAGlB,OAAOt9B,EAAIC,EAGN,SAASktG,GAAantG,EAAGC,GAC9B,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAIq9B,MAAM,wCAGlB,OAAOt9B,EAAIC,EAGN,SAASmtG,GAAgBptG,EAAGC,GACjC,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAIq9B,MAAM,2CAGlB,OAAOt9B,GAAKC,EAGP,SAASotG,GAAsBrtG,EAAGC,GACvC,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAIq9B,MAAM,iDAGlB,OAAOt9B,GAAKC,EAGP,SAASqtG,GAAoBttG,EAAGC,GACrC,KAAK,OAAUD,MAAO,OAAUC,GAC9B,MAAM,IAAIq9B,MAAM,+CAGlB,OAAOt9B,IAAMC,EA9Cf+sG,GAAahtB,UAAY,GAQzBitB,GAAajtB,UAjBJ,SAyBTktB,GAAYltB,UAAY,GAQxBmtB,GAAantB,UAAY,GAQzBotB,GAAgBptB,UAAY,GAQ5BqtB,GAAsBrtB,UAAY,GAQlCstB,GAAoBttB,UAAY,GCtDhC,IAAI,GAAO,SACP,GAAe,CAAC,SACTutB,IAA8B,QAAQ,GAAM,IAAe5jD,IACpE,IAAI,MACF+1B,GACE/1B,EAwBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQskC,GACRzZ,UAAWmY,GACX,iBAAkB,SAAqB3rG,GACrC,OAAO,SAAQA,EAAG7D,YClCpB,GAAe,CAAC,SACTqxG,IAA2B,QAF3B,MAEyC,IAAe7jD,IACjE,IAAI,MACF+1B,GACE/1B,EA6BJ,OAAO+1B,EAlCE,MAkCU,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAO4B,KAAKgF,MAAM,EAAG5G,IAEvBwzF,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEtG,YAAYkN,MAAM,EAAG5G,IAEhC0/B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEigC,OAGX,iBAAkB,SAAqBjgC,GACrC,OAAO,SAAQA,EAAG7D,YC7CpB,GAAe,CAAC,SACTsxG,IAA0B,QAF1B,KAEwC,IAAe9jD,IAChE,IAAI,MACF+1B,GACE/1B,EA6BJ,OAAO+1B,EAlCE,KAkCU,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAO,GAETwzF,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE6jD,IAAI,IAEfnkB,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEogC,IAEX,iBAAkB,SAAqBpgC,GACrC,OAAO,SAAQA,EAAG7D,YC9CpB,GAAK,iBACF,SAASuxG,GAAU1tG,GACxB,OAAQA,EAGH,SAAS2tG,GAAS3tG,EAAGC,GAC1B,SAAUD,IAAKC,GAGV,SAAS2tG,GAAU5tG,EAAGC,GAC3B,QAASD,KAAQC,EAGZ,SAAS4tG,GAAU7tG,EAAGC,GAC3B,SAAUD,IAAKC,GAVjBytG,GAAU1tB,UALD,SAST2tB,GAAS3tB,UAAY,GAIrB4tB,GAAU5tB,UAAY,GAItB6tB,GAAU7tB,UAAY,GCdtB,IACI,GAAe,CAAC,SACT8tB,IAA2B,QAF3B,MAEyC,IAAenkD,IACjE,IAAI,MACF+1B,GACE/1B,EA2BJ,OAAO+1B,EAhCE,MAgCU,CACjB/W,OAAQ+kC,GACRhuE,QAAS,SAAiB1/B,GACxB,OAAgB,IAATA,EAAEmgC,IAAqB,IAATngC,EAAEogC,IAEzBozD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEw/C,UAAYx/C,EAAEiD,SAEzBy/E,KAAM,SAAc1iF,GAClB,OAAmB,OAAZA,EAAE/G,OAAiBkD,KAAK6D,EAAE/G,QAEnC,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC3CpB,GAAe,CAAC,SACT4xG,IAA8B,QAF9B,SAE4C,IAAepkD,IACpE,IAAI,MACF+1B,GACE/1B,EA+BJ,OAAO+1B,EAAM,SAAU,CACrB,kBAAmBsuB,GACnB,mBAAoB,SAAwBhuG,EAAGjE,GAC7C,OAAOiE,EAAEvG,OAAOu0G,GAAgBhuG,EAAE07F,UAAW3/F,KAE/C,gBAAiB,MACjB,iBAAkB,SAAsBiE,EAAGjE,GACzC,OAAOiE,EAAEvG,QAAO,SAAauG,EAAE07F,UAAW3/F,UAYhD,SAASiyG,GAAgBhuG,EAAGqQ,GAE1B,IAAImoB,GAAO,QAAiBnoB,GAC5B,OAAO,SAAOrQ,GAAG,SAAU/G,EAAOgiC,EAAOs6B,GAEvC,OAAa,IAAT/8B,EACKnoB,EAASpX,GACE,IAATu/B,EACFnoB,EAASpX,EAAO,CAACgiC,IAGjB5qB,EAASpX,EAAO,CAACgiC,GAAQs6B,MClEtC,IAAI,GAAO,UACP,GAAe,CAAC,SACT04C,IAA+B,QAAQ,GAAM,IAAetkD,IACrE,IAAI,MACF+1B,GACE/1B,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB,kBAAmBwc,GACnB,mBAAoB,SAAwBl8F,EAAGqQ,GAC7C,OAAOrQ,EAAElC,QAAQuS,SAWvB,SAAS6rF,GAAS3mC,EAAOllD,GAEvB,IAAImoB,GAAO,QAAiBnoB,IAEd,SAAS0rF,EAAQ9iG,EAAOgiC,GAChClkC,MAAMgD,QAAQd,IAChB,SAAaA,GAAO,SAAUwzC,EAAO51C,GAEnCklG,EAAQtvD,EAAOxR,EAAMoD,OAAOxnC,OAIjB,IAAT2hC,EACFnoB,EAASpX,GACS,IAATu/B,EACTnoB,EAASpX,EAAOgiC,GAGhB5qB,EAASpX,EAAOgiC,EAAOs6B,GAK7BwmC,CAAQxmC,EAAO,ICpEjB,IACI,GAAe,CAAC,SACT24C,IAA2B,QAF3B,MAEyC,IAAevkD,IACjE,IAAI,MACF+1B,GACE/1B,EA0BJ,OAAO+1B,EA/BE,MA+BU,CACjB,kBAAmBttE,GACnB,mBAAoB,SAAwBpS,EAAGqQ,GAC7C,OAAOrQ,EAAE8S,IAAIzC,SAYnB,SAAS+B,GAAKmjD,EAAOllD,GAEnB,IAAImoB,GAAO,QAAiBnoB,GAqB5B,OAnBc,SAAS0rF,EAAQ9iG,EAAOgiC,GACpC,OAAIlkC,MAAMgD,QAAQd,GACTA,EAAM6Z,KAAI,SAAU25B,EAAO51C,GAEhC,OAAOklG,EAAQtvD,EAAOxR,EAAMoD,OAAOxnC,OAIxB,IAAT2hC,EACKnoB,EAASpX,GACE,IAATu/B,EACFnoB,EAASpX,EAAOgiC,GAGhB5qB,EAASpX,EAAOgiC,EAAOs6B,GAK7BwmC,CAAQxmC,EAAO,ICnExB,IACI,GAAe,CAAC,SACT44C,IAA2B,QAF3B,MAEyC,IAAexkD,IACjE,IAAI,MACF+1B,GACE/1B,EA0BJ,OAAO+1B,EAAM,OAAQ,CACnB/W,OAAQ,SAAgB3oE,GACtB,IAAIC,EAAI2B,KAAK0F,IAAItH,GAEjB,OAAIC,GAAKmuG,IACA,QAAKpuG,GAGVC,GAAKouG,IACA,QAAKruG,GAsBlB,SAAcC,GACZ,IAGIpJ,EAHAy3G,EAAMruG,EAAIA,EACVsuG,EAAOvxD,GAAE,GAAG,GAAKsxD,EACjBE,EAAOF,EAGX,IAAKz3G,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtB03G,GAAQA,EAAOvxD,GAAE,GAAGnmD,IAAMy3G,EAC1BE,GAAQA,EAAOC,GAAE,GAAG53G,IAAMy3G,EAG5B,OAAOruG,GAAKsuG,EAAOvxD,GAAE,GAAG,KAAOwxD,EAAOC,GAAE,GAAG,IAjCtBC,CAAKzuG,GAGpBA,GAAK,GACA,QAAKD,IAAM,EAwCxB,SAAeC,GACb,IAEIpJ,EAFA03G,EAAOvxD,GAAE,GAAG,GAAK/8C,EACjBuuG,EAAOvuG,EAGX,IAAKpJ,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtB03G,GAAQA,EAAOvxD,GAAE,GAAGnmD,IAAMoJ,EAC1BuuG,GAAQA,EAAOC,GAAE,GAAG53G,IAAMoJ,EAG5B,IAAIoF,GAAUkpG,EAAOvxD,GAAE,GAAG,KAAOwxD,EAAOC,GAAE,GAAG,IACzCH,EAAMvxE,SAAa,GAAJ98B,GAAU,GACzB0uG,GAAO1uG,EAAIquG,IAAQruG,EAAIquG,GAC3B,OAAO1sG,KAAKq9B,KAAKqvE,EAAMA,GAAO1sG,KAAKq9B,KAAK0vE,GAAOtpG,EArDrBupG,CAAM3uG,KAGvB,QAAKD,IAAM,EA+DtB,SAAeC,GACb,IAGIpJ,EAHAy3G,EAAM,GAAKruG,EAAIA,GACfsuG,EAAOvxD,GAAE,GAAG,GAAKsxD,EACjBE,EAAOF,EAGX,IAAKz3G,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtB03G,GAAQA,EAAOvxD,GAAE,GAAGnmD,IAAMy3G,EAC1BE,GAAQA,EAAOC,GAAE,GAAG53G,IAAMy3G,EAG5B,IAAIjpG,EAASipG,GAAOC,EAAOvxD,GAAE,GAAG,KAAOwxD,EAAOC,GAAE,GAAG,IACnDppG,GAAUwpG,GAAQxpG,GAAUpF,EAE5B,IAAI0uG,GAAO1uG,GADXquG,EAAMvxE,SAAa,GAAJ98B,GAAU,MACFA,EAAIquG,GAC3B,OAAO1sG,KAAKq9B,KAAKqvE,EAAMA,GAAO1sG,KAAKq9B,KAAK0vE,GAAOtpG,EA9EvBypG,CAAM7uG,KAE9B,iBAAkB,SAAqBrE,GACrC,OAAO,SAAQA,EAAGO,YAmFpBkyG,GAAS,OAMTQ,GAAQ,kBAOR7xD,GAAI,CAAC,CAAC,mBAAwB,mBAAwB,iBAAwB,mBAAwB,oBAAyB,CAAC,kBAAwB,kBAAwB,kBAAwB,kBAAwB,iBAAwB,mBAAwB,mBAAwB,mBAAwB,uBAAyB,CAAC,mBAAwB,mBAAwB,mBAAwB,oBAAwB,qBAAwB,sBAOldyxD,GAAI,CAAC,CAAC,mBAAwB,mBAAwB,mBAAwB,mBAAyB,CAAC,mBAAwB,kBAAwB,kBAAwB,mBAAwB,mBAAwB,kBAAwB,mBAAwB,oBAAyB,CAAC,kBAAwB,mBAAwB,kBAAwB,mBAAwB,uBAO1YL,GAAUxsG,KAAKmN,IAAI,EAAG,IClKtB,GAAO,SACP,GAAe,CAAC,SACTggG,IAA8B,QAAQ,GAAM,IAAeplD,IACpE,IAAI,MACF+1B,GACE/1B,EAkHJ,OAAO+1B,EAAM,GAAM,CACjBW,IAAK,MACL,kCAAmC,WClG5B2uB,IAAY,QAxBZ,MACQ,CAAC,QAAS,WAuBuBrlD,IAClD,IAAI,MACF+1B,EAAK,OACLsR,GACErnC,EACJ,OAAO+1B,EA7BE,MA6BU,CACjB,qBAAsB,SAAyB9jF,GAC7C,OAAOo1F,EAAOp1F,EAAG,CACfqzG,SAAU,SAGd,6BAA8B,SAA+BrzG,EAAGszG,GAC9D,OAAOle,EAAOp1F,EAAG,CACfqzG,SAAU,MACVC,SAAUA,UCpCd,GAAO,QACP,GAAe,CAAC,SACTC,IAA6B,QAAQ,GAAM,IAAexlD,IACnE,IAAI,MACF+1B,GACE/1B,EA8CJ,OAAO+1B,EAAM,GAAM,CAEjB,yBAA0B0vB,GAC1B,0CAA2CA,QAY/C,SAASA,GAAO5rB,EAAU9qD,EAAQ05B,GAChC,OAAOoxB,EAAS/lF,QAAQ,eAAe,SAAU4xG,EAAUr3G,GAIzD,IAHA,IAAI0G,EAAO1G,EAAIu3B,MAAM,KACjBt2B,EAAQy/B,EAAOh6B,EAAKskD,SAEjBtkD,EAAK9H,aAAoB0D,IAAVrB,GAAqB,CACzC,IAAI8rC,EAAIrmC,EAAKskD,QACb/pD,EAAQ8rC,EAAI9rC,EAAM8rC,GAAK9rC,EAAQ,IAGjC,YAAcqB,IAAVrB,GACG,EAAAg1E,EAAA,IAASh1E,GAGLA,GAFA,SAAOA,EAAOm5D,GAMlBi9C,KCrFX,IAAI,GAAO,UACP,GAAe,CAAC,SACTC,IAA+B,QAAQ,GAAM,IAAe3lD,IACrE,IAAI,MACF+1B,GACE/1B,EA8BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,GAAQ,EAAJA,GAAU,EACZ,OAAO,EAGT,GAAIA,GAAK,EACP,OAAOA,EAAI,EAGb,GAAIA,EAAI,GAAM,GAAKA,EAAI,GAAM,EAC3B,OAAO,EAGT,IAAK,IAAInJ,EAAI,EAAGA,EAAIA,GAAKmJ,EAAGnJ,GAAK,EAC/B,GAAImJ,EAAInJ,GAAM,GAAKmJ,GAAKnJ,EAAI,IAAO,EACjC,OAAO,EAIX,OAAO,GAET28F,UAAW,SAAmB53F,GAC5B,GAAmB,EAAfA,EAAEgpD,YAAmB,EACvB,OAAO,EAGT,GAAIhpD,EAAE2lD,IAAI,GAAI,OAAO3lD,EAAEwkD,GAAG,GAC1B,GAAIxkD,EAAEsnD,IAAI,GAAGvD,GAAG,IAAM/jD,EAAEsnD,IAAI,GAAGvD,GAAG,GAAI,OAAO,EAE7C,IAAK,IAAI9oD,EAAI,EAAG+E,EAAE0kD,IAAIzpD,EAAIA,GAAIA,GAAK,EACjC,GAAI+E,EAAEsnD,IAAIrsD,GAAG8oD,GAAG,IAAM/jD,EAAEsnD,IAAIrsD,EAAI,GAAG8oD,GAAG,GACpC,OAAO,EAIX,OAAO,GAET,iBAAkB,SAAqB3/C,GACrC,OAAO,SAAQA,EAAG7D,YC1EpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5BozG,IAA4B,QAAQ,GAAM,IAAe5lD,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,GACEiqB,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKioD,EAAO6kB,YACvBlrE,KAAKk/B,KAAK9gC,GAEV,IAAI0/B,EAAQ1/B,EAAG,GAAG8gC,QAG7BpB,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE8gC,QAEX0yD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE8gC,QAEX,iBAAkB,SAAqB9gC,GACrC,OAAO,SAAQA,EAAG7D,YChDpB,GAAK,SAMF,SAASqzG,GAAYxvG,GAC1B,OAAO,QAAMA,GAGR,SAASyvG,GAAWzvG,GACzB,OAAO4B,KAAKi/B,KAAK,EAAI7gC,GAGhB,SAAS0vG,GAAY1vG,GAC1B,OAAOsc,SAAStc,IAAM4B,KAAK49B,KAAKx/B,EAAI,GAAKA,GAAK4B,KAAK49B,IAAIx/B,GAAKA,EAAI,KAAO,EAAI,EAGtE,SAAS2vG,GAAW3vG,GACzB,OAAO4B,KAAKm/B,KAAK,EAAI/gC,GAGhB,SAAS4vG,GAAY5vG,GAC1B,IAAI6vG,EAAO,EAAI7vG,EACf,OAAO4B,KAAK49B,IAAIqwE,EAAOjuG,KAAKsE,KAAK2pG,EAAOA,EAAO,IAG1C,SAASC,GAAW9vG,GACzB,OAAO4B,KAAKk/B,KAAK,EAAI9gC,GAGhB,SAAS+vG,GAAY/vG,GAC1B,IAAI6vG,EAAO,EAAI7vG,EACXwhC,EAAM5/B,KAAKsE,KAAK2pG,EAAOA,EAAO,GAClC,OAAOjuG,KAAK49B,IAAIgC,EAAMquE,GAOjB,SAASG,GAAYhwG,GAC1B,OAAO,QAAMA,GAWR,SAASiwG,GAAYjwG,GAC1B,OAAO,QAAMA,GAWR,SAASkwG,GAAUlwG,GACxB,OAAO,EAAI4B,KAAKgiD,IAAI5jD,GAGf,SAASmwG,GAAWnwG,GACzB,IAAIhD,EAAI4E,KAAKq9B,IAAI,EAAIj/B,GACrB,OAAQhD,EAAI,IAAMA,EAAI,GAGjB,SAASozG,GAAUpwG,GACxB,OAAO,EAAI4B,KAAKg+B,IAAI5/B,GAGf,SAASqwG,GAAWrwG,GAEzB,OAAU,IAANA,EACK8B,OAAOuoC,kBAEPzoC,KAAK0F,IAAI,GAAK1F,KAAKq9B,IAAIj/B,GAAK4B,KAAKq9B,KAAKj/B,MAAO,QAAKA,GAItD,SAASswG,GAAUtwG,GACxB,OAAO,EAAI4B,KAAK69B,IAAIz/B,GAGf,SAASuwG,GAAWvwG,GACzB,OAAO,GAAK4B,KAAKq9B,IAAIj/B,GAAK4B,KAAKq9B,KAAKj/B,IAO/B,SAASwwG,GAAWxwG,GACzB,OAAO,QAAKA,GA3FdwvG,GAAYxvB,UAAY,GAIxByvB,GAAWzvB,UAAY,GAIvB0vB,GAAY1vB,UAAY,GAIxB2vB,GAAW3vB,UAAY,GAKvB4vB,GAAY5vB,UAAY,GAIxB8vB,GAAW9vB,UAAY,GAMvB+vB,GAAY/vB,UAAY,GAQxBgwB,GAAYhwB,UAAY,GAYxBiwB,GAAYjwB,UAAY,GAYxBkwB,GAAUlwB,UAAY,GAKtBmwB,GAAWnwB,UAAY,GAIvBowB,GAAUpwB,UAAY,GAStBqwB,GAAWrwB,UAAY,GAIvBswB,GAAUtwB,UAAY,GAItBuwB,GAAWvwB,UAAY,GAQvBwwB,GAAWxwB,UAAY,GCpGvB,IAAI,GAAO,OACP,GAAe,CAAC,QAAS,aAClBywB,IAA4B,QAAQ,GAAM,IAAe9mD,IAClE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ8mC,GACR/vE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE82E,QAEX0c,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,GAAG6gC,QAElC,iBAAkB,SAAqB7gC,GACrC,OAAO,SAAQA,EAAG7D,YCxCpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvCu0G,IAA4B,QAAQ,GAAM,IAAe/mD,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,EACA8zD,UAAW8X,GACT3hD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKioD,EAAO6kB,YACvB6iC,GAAW3vG,GAGb,IAAI0/B,EAAQ1/B,EAAG,GAAGg3E,QAE3Bt3C,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEg3E,QAEXwc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,GAAG+gC,QAElC,iBAAkB,SAAqB/gC,GACrC,OAAO,SAAQA,EAAG7D,YChDpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvCw0G,IAA4B,QAAQ,GAAM,IAAehnD,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,EACA8zD,UAAW8X,GACT3hD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKioD,EAAO6kB,YACvBgjC,GAAW9vG,GAGb,IAAI0/B,EAAQ1/B,EAAG,GAAGk3E,QAE3Bx3C,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEk3E,QAEXsc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,GAAG8gC,QAElC,iBAAkB,SAAqB9gC,GACrC,OAAO,SAAQA,EAAG7D,YCjDpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5By0G,IAA4B,QAAQ,GAAM,IAAejnD,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,GACEiqB,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,IAAM,GAAKA,GAAK,GAAKioD,EAAO6kB,YACvBlrE,KAAKm/B,KAAK/gC,GAEV,IAAI0/B,EAAQ1/B,EAAG,GAAG+gC,QAG7BrB,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE+gC,QAEXyyD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE+gC,QAEX,iBAAkB,SAAqB/gC,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SC/C1B,GAAe,CAAC,SACT00G,IAA4B,QAF5B,OAE0C,IAAelnD,IAClE,IAAI,MACF+1B,GACE/1B,EAyBJ,OAAO+1B,EAAM,OAAQ,CACnB/W,OAAQ,SAAgB3oE,GACtB,OAAO4B,KAAKi/B,KAAK7gC,IAEnB0/B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE6gC,QAEX2yD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE6gC,QAEX,iBAAkB,SAAqB7gC,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SCzC1B,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAC5B20G,IAA6B,QAAQ,GAAM,IAAennD,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,GACEiqB,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,GAAK,GAAKA,IAAM,GAAKioD,EAAO6kB,YACvBmjC,GAAYjwG,GAGd,IAAI0/B,EAAQ1/B,EAAG,GAAGohC,SAE3B1B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEohC,SAEXoyD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEohC,SAEX,iBAAkB,SAAqBphC,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SC9C1B,GAAO,OACP,GAAe,CAAC,SACT40G,IAA4B,QAAQ,GAAM,IAAepnD,IAClE,IAAI,MACF+1B,GACE/1B,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,KACRjpC,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEg/B,QAEXw0D,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEg/B,QAEX0jD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,qCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC5CpB,GAAO,OACP,GAAe,CAAC,QAAS,aAClB+0G,IAA4B,QAAQ,GAAM,IAAevnD,IAClE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQwnC,GACRzwE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEq3E,QAEXmc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,EAAEihD,SAEjCyhC,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,qCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC/CpB,GAAO,OACP,GAAe,CAAC,QAAS,aAClBg1G,IAA4B,QAAQ,GAAM,IAAexnD,IAClE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ0nC,GACR3wE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEu3E,QAEXic,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,EAAEk/B,SAEjCwjD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,qCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC/CpB,GAAO,OACP,GAAe,CAAC,QAAS,aAClBi1G,IAA4B,QAAQ,GAAM,IAAeznD,IAClE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ4nC,GACR7wE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEy3E,QAEX+b,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,EAAEg/B,SAEjC0jD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,qCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC/CpB,GAAO,OACP,GAAe,CAAC,SACTk1G,IAA4B,QAAQ,GAAM,IAAe1nD,IAClE,IAAI,MACF+1B,GACE/1B,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ6nC,GACR9wE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEk/B,QAEXs0D,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEk/B,QAEXwjD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,qCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SC5C1B,GAAe,CAAC,SACTm1G,IAA4B,QAF5B,OAE0C,IAAe3nD,IAClE,IAAI,MACF+1B,GACE/1B,EA0BJ,OAAO+1B,EAAM,OAAQ,CACnB/W,OAAQ,KACRjpC,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEihD,QAEXuyC,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEihD,QAEXyhC,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,qCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SC/CvB,SAASo1G,GAAQ16G,EAAG+E,GACzB,GAAIA,EAAI/E,EACN,OAAO,EAGT,GAAI+E,IAAM/E,EACR,OAAO+E,EAGT,IAAI41G,EAAO51G,EAAI/E,GAAK,EAEpB,OAAO06G,GAAQ16G,EAAG26G,GAAQD,GAAQC,EAAO,EAAG51G,GCbvC,SAAS61G,GAAmB71G,EAAGmpC,GACpC,KAAK,OAAUnpC,IAAMA,EAAI,EACvB,MAAM,IAAItE,UAAU,4DAGtB,KAAK,OAAUytC,IAAMA,EAAI,EACvB,MAAM,IAAIztC,UAAU,4DAGtB,GAAIytC,EAAInpC,EACN,MAAM,IAAItE,UAAU,qCAGtB,IAAIo6G,EAAU91G,EAAImpC,EAGlB,OAAIA,EAAI2sE,EACMH,GAAQG,EAAU,EAAG91G,GACd21G,GAAQ,EAAGxsE,GAGpBwsE,GAAQxsE,EAAI,EAAGnpC,GACR21G,GAAQ,EAAGG,GAEhCD,GAAmBzxB,UAAY,iBCxB/B,IAAI,GAAO,eACP,GAAe,CAAC,SACT2xB,IAAoC,QAAQ,GAAM,IAAehoD,IAC1E,IAAI,MACF+1B,GACE/1B,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB+xB,GAClB,uBAAwB,SAA4B71G,EAAGmpC,GACrD,IACI1/B,EAAQxO,EADR28F,EAAY53F,EAAElC,YAEdg4G,EAAU91G,EAAEokC,MAAM+E,GAClByb,EAAM,IAAIgzC,EAAU,GAExB,IAAKoe,GAAkBh2G,KAAOg2G,GAAkB7sE,GAC9C,MAAM,IAAIztC,UAAU,4DAGtB,GAAIytC,EAAEqb,GAAGxkD,GACP,MAAM,IAAItE,UAAU,kDAKtB,GAFA+N,EAASm7C,EAELzb,EAAEsd,GAAGqvD,GACP,IAAK76G,EAAI2pD,EAAK3pD,EAAE0qD,IAAImwD,GAAU76G,EAAIA,EAAEkpC,KAAKygB,GACvCn7C,EAASA,EAAO05C,MAAMha,EAAEhF,KAAKlpC,IAAIipD,UAAUjpD,QAG7C,IAAKA,EAAI2pD,EAAK3pD,EAAE0qD,IAAIxc,GAAIluC,EAAIA,EAAEkpC,KAAKygB,GACjCn7C,EAASA,EAAO05C,MAAM2yD,EAAQ3xE,KAAKlpC,IAAIipD,UAAUjpD,GAIrD,OAAOwO,QAWb,SAASusG,GAAkBh2G,GACzB,OAAOA,EAAEgV,aAAehV,EAAE0kD,IAAI,G,eCvE5BuxD,GAAiCC,GAAW56E,KAAKtoB,OAC9C,SAAS,GAAUm+D,GACxB,IAAIrkB,EAEaqpD,EAWjB,OAVErpD,EAAkB,QADHqpD,EAKThlC,GAJmB8kC,GAAkBC,GAAWr3E,OAAOs3E,IAM/D,WACE,OAAOrpD,KCTX,IACI,GAAe,CAAC,QAAS,SAAU,OAC5BspD,IAAkC,QAFlC,aAEgD,IAAeroD,IACxE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,GACNzpC,GACEmrC,EAEAsoD,EAAM,GAAUhqD,EAAO8kB,YA8C3B,OA5CIvuD,GACFA,EAAG,UAAU,SAAUglB,EAAMD,GACvBC,EAAKupC,aAAexpC,EAAKwpC,aAC3BklC,EAAM,GAAUzuE,EAAKupC,gBAyCpB2S,EAAM,CACX,iBAAkB,SAAqBwyB,GACrC,OAAOC,EAAYD,EAAW,KAEhC,yBAA0B,SAA2BA,EAAW9/C,GAC9D,OAAO+/C,EAAYD,EAAW9/C,IAEhC,yBAA0B,SAA2B8/C,EAAWvpC,GAC9D,OAAOwpC,EAAYD,EAAW,CAC5BvpC,YAGJ,iCAAkC,SAAgCupC,EAAWE,GAC3E,OAAOD,EAAYD,EAAW,CAC5BE,aAGJ,yCAA0C,SAAsCF,EAAWE,EAASzpC,GAClG,OAAOwpC,EAAYD,EAAW,CAC5BvpC,SACAypC,aAGJ,yCAA0C,SAAsCF,EAAWvpC,EAAQypC,GACjG,OAAOD,EAAYD,EAAW,CAC5BvpC,SACAypC,eAeN,SAASD,EAAYD,EAAW3S,GAC9B,IAAI,OACF52B,EAAM,QACNypC,EAAO,YACPC,GAAc,GACZ9S,EACA+S,OAA2B,IAAX3pC,EAEhB2pC,IACF3pC,EAAS,GAGX,IAAI4pC,GAAe,EAAAtkC,EAAA,IAASikC,GAAaA,EAAUz4G,QAAS,EAAAw0E,EAAA,IAASmkC,GAAWA,EAAQ34G,OAAS,KACjGy4G,EAAYA,EAAU5sD,UAElB8sD,IACFA,EAAUA,EAAQ9sD,YAGA,IAAhB+sD,IACFH,GAAY,SAAQA,GACpBE,GAAU,SAAQA,IAGpB,IAAII,EAAe,EAEnB,QAAuB,IAAZJ,EAAyB,CAClC,GAAIA,EAAQx7G,SAAWs7G,EAAUt7G,OAC/B,MAAM,IAAI0mC,MAAM,kDAGlB,IAAK,IAAIzmC,EAAI,EAAGF,EAAMy7G,EAAQx7G,OAAQC,EAAIF,EAAKE,IAAK,CAClD,KAAK,EAAAo3E,EAAA,IAASmkC,EAAQv7G,KAAOu7G,EAAQv7G,GAAK,EACxC,MAAM,IAAIymC,MAAM,gDAGlBk1E,GAAgBJ,EAAQv7G,IAQ5B,IAJA,IAEIqxC,EAFAtxC,EAASs7G,EAAUt7G,OACnByO,EAAS,GAGNA,EAAOzO,OAAS+xE,GAAQ,CAC7B,QAAuB,IAAZypC,EACTlqE,EAAOgqE,EAAUtwG,KAAKgd,MAAMqzF,IAAQr7G,SAIpC,IAFA,IAAI67G,EAAUR,IAAQO,EAEbh4G,EAAK,EAAGk4G,EAAOR,EAAUt7G,OAAQ4D,EAAKk4G,EAAMl4G,IAGnD,IAFAi4G,GAAWL,EAAQ53G,IAEL,EAAG,CACf0tC,EAAOgqE,EAAU13G,GACjB,MAKN6K,EAAO1K,KAAKutC,GAGd,OAAOoqE,EAASjtG,EAAO,GAAKktG,EAAeA,EAAaltG,GAAUA,MC7J/D,SAASstG,GAAa90F,EAAM6qC,GACjC,IAAIxrD,EAAO,GAGX,IAFA2gB,EAAOA,EAAK5iB,MAAM,IAETrE,OAAS,EAChB,IAAK,IAAIC,EAAI,EAAGD,EAASinB,EAAKmlC,QAASnsD,EAAID,EAAQC,IACjDqG,EAAKvC,KAAKg4G,GAAa90F,EAAM6qC,SAG/B,IAAK,IAAIluD,EAAK,EAAGo4G,EAAU/0F,EAAKmlC,QAASxoD,EAAKo4G,EAASp4G,IACrD0C,EAAKvC,KAAK+tD,KAId,OAAOxrD,EChBT,IAAI,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,OAC5B21G,IAAiC,QAAQ,GAAM,IAAelpD,IACvE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,GACNzpC,GACEmrC,EAEAsoD,EAAM,GAAUhqD,EAAO8kB,YAwC3B,OAtCIvuD,GACFA,EAAG,UAAU,SAAUglB,EAAMD,GACvBC,EAAKupC,aAAexpC,EAAKwpC,aAC3BklC,EAAM,GAAUzuE,EAAKupC,gBAmCpB2S,EAAM,GAAM,CACjB,GAAI,IAAMozB,EAAW,EAAG,GACxBnqC,OAAQ9jD,GAAOiuF,EAAW,EAAGjuF,GAC7B,iBAAkB,CAACF,EAAKE,IAAQiuF,EAAWnuF,EAAKE,GAChD,iBAAkBhH,GAAQk1F,EAAiBl1F,EAAM,EAAG,GACpD,yBAA0B,CAACA,EAAMgH,IAAQkuF,EAAiBl1F,EAAM,EAAGgH,GACnE,iCAAkC,CAAChH,EAAM8G,EAAKE,IAAQkuF,EAAiBl1F,EAAM8G,EAAKE,KAGpF,SAASkuF,EAAiBl1F,EAAM8G,EAAKE,GACnC,IAAI+M,EAAM+gF,GAAa90F,EAAKynC,WAAW,IAAMwtD,EAAWnuF,EAAKE,KAC7D,OAAO,EAAAopD,EAAA,IAASpwD,GAAQA,EAAKpkB,OAAOm4B,GAAOA,EAG7C,SAASkhF,EAAWnuF,EAAKE,GACvB,OAAOjjB,KAAKgd,MAAM+F,EAAMstF,KAASptF,EAAMF,QClEvC,GAAO,QACP,GAAe,CAAC,SACTquF,IAA6B,QAAQ,GAAM,IAAerpD,IACnE,IAAI,MACF+1B,GACE/1B,EAoBJ,OAAO+1B,EAAM,GAAM,CACjBW,IAAK1nF,GAAA,QC3BL,GAAO,kBACP,GAAe,CAAC,QAAS,aAClBs6G,IAAuC,QAAQ,GAAM,IAAetpD,IAC7E,IAAI,MACF+1B,EAAK,UACL0R,GACEznC,EA+BJ,OAAO+1B,EAAM,GAAM,CACjB9f,OAAQ,SAAgB5/D,GACtB,OAAOA,EAAE+qB,OAAOn0B,OAAS,IAAMqM,MAAMnB,OAAO9B,KAE9CqgF,IAAK,SAAargF,GAChB,OAAOoxF,EAAUpxF,SCzCnB,GAAO,SACP,GAAe,CAAC,SACTkzG,IAA8B,QAAQ,GAAM,IAAevpD,IACpE,IAAI,MACF+1B,GACE/1B,EA4DJ,OAAO+1B,EAAM,GAAM,CACjBW,IAAK,UCjEL,GAAO,SACP,GAAe,CAAC,SACT8yB,IAA8B,QAAQ,GAAM,IAAexpD,IACpE,IAAI,MACF+1B,GACE/1B,EA2BJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,MAAO,IAET/W,OAAQ,KACR8b,KAAM,SAAezkF,GACnB,MAAO,QAETmqF,QAAS,SAAiBnqF,GACxB,OAAOA,EAAI,IAEb4/D,OAAQ,SAAgB5/D,GACtB,OAAOA,GAET,iBAAkB,SAAqBA,GACrC,OAAO,SAAQA,EAAG7D,OAEpBkkF,IAAK,SAAargF,GAChB,OAAOy6B,OAAOz6B,SClDhB,GAAe,CAAC,QAAS,YAClBozG,IAAgC,QAFhC,WAE8C,IAAezpD,IACtE,IAAI,MACF+1B,EAAK,SACLh1B,GACEf,EA2BJ,OAAO+1B,EAAM,WAAY,CACvB/W,OAAQ,SAAgB3oE,GACtB,IAAKsc,SAAStc,IAAMiD,MAAMjD,GACxB,MAAM,IAAIs9B,MAAMt9B,EAAI,wCAGtB,OAAO,IAAI0qD,EAAS1qD,IAEtB4/D,OAAQ,SAAgB5/D,GACtB,OAAO,IAAI0qD,EAAS1qD,IAEtB,iBAAkB,SAAsBwnD,EAAW/E,GACjD,OAAO,IAAIiI,EAASlD,EAAW/E,IAEjCgiC,KAAM,SAAezkF,GACnB,OAAO,IAAI0qD,EAAS,IAEtB8oC,UAAW,SAAmBxzF,GAC5B,OAAO,IAAI0qD,EAAS1qD,EAAEnE,aAExB6uD,SAAU,SAAkB1qD,GAC1B,OAAOA,GAETlI,OAAQ,SAAgBkI,GACtB,OAAO,IAAI0qD,EAAS1qD,IAEtB,iBAAkB,SAAqBA,GACrC,OAAO,SAAQA,EAAG7D,YC3DpB,GAAO,aACP,GAAe,CAAC,SACTk3G,IAAkC,QAAQ,GAAM,IAAe1pD,IACxE,IAAI,MACF+1B,GACE/1B,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ8gC,GACR/pE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEk/C,OAEXs0C,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEk/C,OAEXwL,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAEk/C,OAEXwjC,KAAM,SAAc1iF,GAClB,IAAI4xB,EAAM5xB,EAAE4oD,QAEZ,OADAh3B,EAAI34B,MAAQkD,KAAK6D,EAAE/G,OACZ24B,GAET,iBAAkB,SAAqB5xB,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SCjD1B,GAAO,YACP,GAAe,CAAC,SACTm3G,IAAiC,QAAQ,GAAM,IAAe3pD,IACvE,IAAI,MACF+1B,GACE/1B,EAcJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB6pB,GAClB,mBAAoB,SAAwBvpG,EAAGC,GAC7C,OAAOD,EAAEyW,IAAIxW,IAEf,uBAAwB,SAA4BD,EAAGC,GACrD,OAAOD,EAAE+/B,KAAK9/B,IAEhB,qBAAsB,SAA0BD,EAAGC,GACjD,OAAOD,EAAEyW,IAAIxW,IAEf,aAAc,SAAkBD,EAAGC,GACjC,GAAgB,OAAZD,EAAE/G,YAA8BqB,IAAZ0F,EAAE/G,MAAqB,MAAM,IAAIqkC,MAAM,oDAC/D,GAAgB,OAAZr9B,EAAEhH,YAA8BqB,IAAZ2F,EAAEhH,MAAqB,MAAM,IAAIqkC,MAAM,oDAC/D,IAAKt9B,EAAEuoG,UAAUtoG,GAAI,MAAM,IAAIq9B,MAAM,sBACrC,IAAI1L,EAAM5xB,EAAE4oD,QAGZ,OAFAh3B,EAAI34B,MAAQkD,KAAKy1B,EAAI34B,MAAOgH,EAAEhH,OAC9B24B,EAAImzE,WAAY,EACTnzE,QCnCT,GAAe,CAAC,SACT2hF,IAA2B,QAF3B,MAEyC,IAAe5pD,IACjE,IAAI,MACF+1B,GACE/1B,EA8BJ,OAAO+1B,EAnCE,MAmCU,CACjB/W,OAAQmhC,GACRpqE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEi/B,OAEXu0D,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEi/B,OAEX,iBAAkB,SAAqBj/B,GAErC,OAAO,SAAQA,EAAG7D,YC7CpB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5Bq3G,IAA4B,QAAQ,GAAM,IAAe7pD,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,GACEiqB,EA2BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,GAAK,GAAKioD,EAAO6kB,YACZs9B,GAAWpqG,GAGXyzG,EAAa,IAAI/zE,EAAQ1/B,EAAG,KAGvC0/B,QAAS+zE,EACTjgB,UAAW,SAAmBxzF,GAC5B,OAAKA,EAAEiiD,cAAgBgG,EAAO6kB,YACrB9sE,EAAEw/B,IAAI,GAGNi0E,EAAa,IAAI/zE,EAAQ1/B,EAAE4kD,WAAY,KAGlD,iBAAkB,SAAqB5kD,GACrC,OAAO,SAAQA,EAAG7D,SAUtB,SAASs3G,EAAazzG,GACpB,IAAI0zG,EAAO9xG,KAAKsE,KAAKlG,EAAEmgC,GAAKngC,EAAEmgC,GAAKngC,EAAEogC,GAAKpgC,EAAEogC,IAC5C,OAAO,IAAIV,EAAQ99B,KAAK4mD,KAAO5mD,KAAK4mD,KAAKkrD,GAAQ9xG,KAAK49B,IAAIk0E,GAAQ9xG,KAAK2oF,IAAK3oF,KAAKgF,MAAM5G,EAAEogC,GAAIpgC,EAAEmgC,IAAMv+B,KAAK2oF,SCjE1G,GAAe,CAAC,SAAU,QAAS,WAC5BopB,IAA4B,QAF5B,OAE0C,IAAehqD,IAClE,IAAI,OACF1B,EAAM,MACNy3B,EAAK,QACLhgD,GACEiqB,EA0BJ,OAAO+1B,EAAM,OAAQ,CACnB/W,OAAQirC,EACRl0E,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEkG,QAEXstF,UAAW,SAAmBxzF,GAC5B,OAAKA,EAAEiiD,cAAgBgG,EAAO6kB,YACrB9sE,EAAEkG,OAGF0tG,EAAY5zG,EAAE4kD,aAGzB,iBAAkB,SAAqB5kD,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1BumF,KAAM,SAAc1iF,GAElB,OAAOA,EAAE+O,IAAI,OAUjB,SAAS6kG,EAAY5zG,GACnB,OAAIiD,MAAMjD,GACD0hC,IACE1hC,GAAK,GAAKioD,EAAO6kB,YACnBlrE,KAAKsE,KAAKlG,GAEV,IAAI0/B,EAAQ1/B,EAAG,GAAGkG,WCpE3B,GAAO,OACP,GAAe,CAAC,SACT2tG,IAA4B,QAAQ,GAAM,IAAelqD,IAClE,IAAI,MACF+1B,GACE/1B,EA2BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAOA,GAETwzF,UAAW,SAAmBxzF,GAC5B,OAAOA,GAET0/B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE8zG,aAEX,iBAAkB,SAAqB9zG,GACrC,OAAO,SAAQA,EAAG7D,YC1CpB,GAAO,oBACP,GAAe,CAAC,SACT43G,IAAyC,QAAQ,GAAM,IAAepqD,IAC/E,IAAI,MACF+1B,GACE/1B,EAoCJ,OAAO+1B,EAAM,GAAM,CACjB3oF,MAAO,SAAeiJ,GACpB,OAAO,SAAiBA,EAAG,OAE7B09F,OAAQ,SAAgB19F,GACtB,OAAOA,EAAEwmG,oBC/CX,GAAO,OACP,GAAe,CAAC,QAAS,QAAS,aAC3BwN,IAA4B,QAAQ,GAAM,IAAerqD,IAClE,IAAI,MACF+1B,EAAK,MACLz8E,EAAK,UACLmuF,GACEznC,EA2BJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkBu0B,EAClB,MAAO,SAAWz7E,GAChB,OAAOy7E,EAAMz7E,MAUjB,SAASy7E,EAAMv7E,GAIb,GAAY,KAHZA,GAAS,SAAQA,EAAO4sB,YACP1uD,OAGf,MAAM,IAAI0mC,MAAM,2CAOlB,IAJA,IAAIzB,EAAQ,GACRg1D,EAAO,GACPhsE,EAAM,EAEDhuB,EAAI,EAAGA,EAAI6hC,EAAO9hC,OAAQC,IAAK,CACtC,IAAIoC,EAAQy/B,EAAO7hC,GAEnB,GAAIu6F,EAAUn4F,IAAUgK,EAAMhK,GAC5B,MAAM,IAAIqkC,MAAM,2DAGZrkC,KAAS4iC,IACbA,EAAM5iC,GAAS,GAGjB4iC,EAAM5iC,KAEF4iC,EAAM5iC,KAAW4rB,EACnBgsE,EAAKl2F,KAAK1B,GACD4iC,EAAM5iC,GAAS4rB,IACxBA,EAAMgX,EAAM5iC,GACZ43F,EAAO,CAAC53F,IAIZ,OAAO43F,MCzDAqjB,IAAY,QAxBZ,MACQ,CAAC,QAAS,WAuBuBvqD,IAClD,IAAI,MACF+1B,EAAK,OACLsR,GACErnC,EACJ,OAAO+1B,EA7BE,MA6BU,CACjB,qBAAsB,SAAyB9jF,GAC7C,OAAOo1F,EAAOp1F,EAAG,CACfqzG,SAAU,SAGd,6BAA8B,SAA+BrzG,EAAGszG,GAC9D,OAAOle,EAAOp1F,EAAG,CACfqzG,SAAU,MACVC,SAAUA,UCpCd,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAC5BiF,IAA6B,QAAQ,GAAM,IAAexqD,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,GACEiqB,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,GAAK,GAAKioD,EAAO6kB,YACZ0iC,GAAYxvG,GAGjBA,IAAM,EACD,IAAI0/B,EAAQ99B,KAAK49B,IAAI59B,KAAKsE,KAAKlG,EAAIA,EAAI,GAAKA,GAAI4B,KAAKiF,IAGvD,IAAI64B,EAAQ1/B,EAAG,GAAGshC,SAE3B5B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEshC,SAEXkyD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEshC,SAEX,iBAAkB,SAAqBthC,GACrC,OAAO,SAAQA,EAAG7D,YCjDpB,GAAO,QACP,GAAe,CAAC,QAAS,aAClBi4G,IAA6B,QAAQ,GAAM,IAAezqD,IACnE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQinC,GACRlwE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEi3E,SAEXuc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,GAAGqhC,SAElC,iBAAkB,SAAqBrhC,GACrC,OAAO,SAAQA,EAAG7D,YCrCpB,GAAe,CAAC,SACTk4G,IAA6B,QAF7B,QAE2C,IAAe1qD,IACnE,IAAI,MACF+1B,GACE/1B,EAuBJ,OAAO+1B,EAAM,QAAS,CACpB/W,OAAQqnC,GACRtwE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEqhC,SAEXmyD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEqhC,SAEX,iBAAkB,SAAqBrhC,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SCtC1B,GAAe,CAAC,SACTm4G,IAA2B,QAF3B,MAEyC,IAAe3qD,IACjE,IAAI,MACF+1B,GACE/1B,EA4BJ,OAAO+1B,EAjCE,MAiCU,CACjB/W,OAAQ/mE,KAAK69B,IACbC,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEy/B,OAEX+zD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEy/B,OAEXijD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,oCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC/CpB,GAAe,CAAC,QAAS,aAClBo4G,IAA2B,QAF3B,MAEyC,IAAe5qD,IACjE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAuBJ,OAAO+1B,EA7BE,MA6BU,CACjB/W,OAAQynC,GACR1wE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEs3E,OAEXkc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,EAAE4/B,QAEjC8iD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,oCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC7CpB,GAAe,CAAC,SACTq4G,IAA2B,QAF3B,MAEyC,IAAe7qD,IACjE,IAAI,MACF+1B,GACE/1B,EA4BJ,OAAO+1B,EAjCE,MAiCU,CACjB/W,OAAQ/mE,KAAKg+B,IACbF,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE4/B,OAEX4zD,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE4/B,OAEX8iD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,oCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SCjD1B,GAAO,sBACP,GAAe,CAAC,SACTs4G,IAA2C,QAAQ,GAAM,IAAe9qD,IACjF,IAAI,MACF+1B,GACE/1B,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAsB9jF,EAAGmpC,GACzC,KAAK,OAAUnpC,IAAMA,EAAI,EACvB,MAAM,IAAItE,UAAU,mEAGtB,KAAK,OAAUytC,IAAMA,EAAI,EACvB,MAAM,IAAIztC,UAAU,mEAGtB,GAAIsE,EAAI,EACN,MAAM,IAAItE,UAAU,6CAGtB,OAAIytC,EAAInpC,EAAI,EACO21G,GAAQ31G,EAAGA,EAAImpC,EAAI,GAEhBwsE,GAAQ,EAAGxsE,GAGjBwsE,GAAQxsE,EAAI,EAAGnpC,EAAImpC,EAAI,GACpBwsE,GAAQ,EAAG31G,EAAI,IAEpC,uBAAwB,SAA4BA,EAAGmpC,GACrD,IACI1/B,EAAQxO,EACR2pD,EAAM,IAAIgzC,EAFE53F,EAAElC,aAEM,GACpBg7G,EAAY94G,EAAEokC,MAAMwgB,GAExB,IAAK,GAAkB5kD,KAAO,GAAkBmpC,GAC9C,MAAM,IAAIztC,UAAU,mEAGtB,GAAIsE,EAAEymD,GAAG7B,GACP,MAAM,IAAIlpD,UAAU,6EAKtB,GAFA+N,EAASm7C,EAELzb,EAAEsd,GAAGqyD,GACP,IAAK79G,EAAI2pD,EAAK3pD,EAAE0qD,IAAImzD,GAAY79G,EAAIA,EAAEkpC,KAAKygB,GACzCn7C,EAASA,EAAO05C,MAAMha,EAAEhF,KAAKlpC,IAAIipD,UAAUjpD,QAG7C,IAAKA,EAAI2pD,EAAK3pD,EAAE0qD,IAAIxc,GAAIluC,EAAIA,EAAEkpC,KAAKygB,GACjCn7C,EAASA,EAAO05C,MAAM21D,EAAU30E,KAAKlpC,IAAIipD,UAAUjpD,GAIvD,OAAOwO,QAUb,SAAS,GAAkBzJ,GACzB,OAAOA,EAAEgV,aAAehV,EAAE0kD,IAAI,GCzFhC,IAAI,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,OAC5Bq0D,IAA8B,QAAQ,GAAM,IAAehrD,IACpE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,GACNzpC,GACEmrC,EAEAsoD,EAAM,GAAUhqD,EAAO8kB,YAyC3B,OAvCIvuD,GACFA,EAAG,UAAU,SAAUglB,EAAMD,GACvBC,EAAKupC,aAAexpC,EAAKwpC,aAC3BklC,EAAM,GAAUzuE,EAAKupC,gBAoCpB2S,EAAM,GAAM,CACjB,GAAI,IAAMk1B,EAAQ,EAAG,GACrBjsC,OAAQ9jD,GAAO+vF,EAAQ,EAAG/vF,GAC1B,iBAAkB,CAACF,EAAKE,IAAQ+vF,EAAQjwF,EAAKE,GAC7C,iBAAkBhH,GAAQg3F,EAAch3F,EAAM,EAAG,GACjD,yBAA0B,CAACA,EAAMgH,IAAQgwF,EAAch3F,EAAM,EAAGgH,GAChE,iCAAkC,CAAChH,EAAM8G,EAAKE,IAAQgwF,EAAch3F,EAAM8G,EAAKE,KAGjF,SAASgwF,EAAch3F,EAAM8G,EAAKE,GAChC,IAAI+M,EAAM+gF,GAAa90F,EAAKynC,WAAW,IAAMsvD,EAAQjwF,EAAKE,KAC1D,OAAO,EAAAopD,EAAA,IAASpwD,GAAQA,EAAKpkB,OAAOm4B,GAAOA,EAG7C,SAASgjF,EAAQjwF,EAAKE,GACpB,OAAOF,EAAMstF,KAASptF,EAAMF,OClE5B,GAAO,aACP,GAAe,CAAC,SACTmwF,IAAkC,QAAQ,GAAM,IAAenrD,IACxE,IAAI,MACF+1B,GACE/1B,EA+BJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQo/B,GACRvU,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEohD,UAAYphD,EAAEw/C,WAAax/C,EAAEiD,SAExCynD,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE8P,EAAI,GAEf4yE,KAAM,SAAc1iF,GAClB,OAAO7D,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC3CpB,GAAe,CAAC,QAAS,cAAe,UACjC44G,IAAyC,QAFzC,eAEuD,IAAeprD,IAC/E,IAAI,MACF+1B,EAAK,YACL2d,EAAW,OACXK,GACE/zC,EAOJ,SAASi0C,EAAa1gG,EAAMokG,GAC1B,KAAMnlG,gBAAgByhG,GACpB,MAAM,IAAIx+D,YAAY,oDAGxB,GAAIkiE,KAAa,EAAArzB,EAAA,IAASqzB,GACxB,MAAM,IAAIhkE,MAAM,qBAAuBgkE,GAGzC,IAAI,EAAArzB,EAAA,IAAS/wE,IA0Bf,SAA2BsK,EAAQupC,EAAQuwD,GAErB,iBAAhBvwD,EAAOx0C,MAETiL,EAAOwtG,QAAUjkE,EAAOikE,SAAU,SAAMjkE,EAAOikE,cAAW16G,EAC1DkN,EAAOytG,QAAS,SAAMlkE,EAAOkkE,QAC7BztG,EAAO0tG,MAAO,SAAMnkE,EAAOmkE,MAC3B1tG,EAAO29F,OAAQ,SAAMp0D,EAAOo0D,OAC5B39F,EAAO49F,UAAY9D,GAAYvwD,EAAOq0D,WAGtC+P,EAAiB3tG,EAAQupC,EAAOuU,UAAWg8C,GAAYvwD,EAAOq0D,WAnC9DgQ,CAAkBj5G,KAAMe,EAAMokG,QACzB,GAAIpkG,IAAQ,EAAA+wE,EAAA,IAAQ/wE,EAAK+9B,SAAU,EAAAgzC,EAAA,IAAQ/wE,EAAKm4G,OAAQ,EAAApnC,EAAA,IAAQ/wE,EAAK2gB,MAE1E1hB,KAAK64G,QAAU93G,EAAKw7B,OACpBv8B,KAAK84G,OAAS/3G,EAAK+9B,MACnB9+B,KAAK+4G,KAAOh4G,EAAKm4G,IACjBl5G,KAAKgpG,MAAQjoG,EAAK2gB,KAClB1hB,KAAKipG,UAAY9D,GAAYpkG,EAAKokG,cAC7B,IAAI,EAAArzB,EAAA,IAAQ/wE,GAEjBi4G,EAAiBh5G,KAAMe,EAAMokG,OACxB,IAAIpkG,EAET,MAAM,IAAI5F,UAAU,8BAA+B,QAAO4F,GAAQ,KAGlEf,KAAK64G,QAAU,GACf74G,KAAK84G,OAAS,GACd94G,KAAK+4G,KAAO,CAAC,GACb/4G,KAAKgpG,MAAQ,CAAC,EAAG,GACjBhpG,KAAKipG,UAAY9D,GAmBrB,SAAS6T,EAAiB3tG,EAAQtK,EAAMokG,GAEtC95F,EAAOwtG,QAAU,GACjBxtG,EAAOytG,OAAS,GAChBztG,EAAO0tG,KAAO,GACd1tG,EAAO49F,UAAY9D,EAEnB,IAAI1Z,EAAO1qF,EAAKtG,OACZowG,EAAU,EAEVrnD,EAAK09C,EAELiY,EAAO,EAUX,IARI,EAAArnC,EAAA,IAASqzB,KAEX3hD,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACiE,EAAUA,KAAcjE,EAEtDiY,EAAO51B,EAAMzb,QAAQ,EAAGq9B,IAItB1Z,EAAO,EAAG,CAEZ,IAAItiE,EAAI,EAER,EAAG,CAED9d,EAAO0tG,KAAKv6G,KAAK6M,EAAOytG,OAAOr+G,QAG/B,IAAK,IAAIC,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAAK,CAE7B,IAAIixF,EAAM5qF,EAAKrG,GAEf,IAAI,EAAAo3E,EAAA,IAAQ6Z,IAOV,GALU,IAANxiE,GAAW0hF,EAAUlf,EAAIlxF,SAC3BowG,EAAUlf,EAAIlxF,QAIZ0uB,EAAIwiE,EAAIlxF,OAAQ,CAElB,IAAImH,EAAI+pF,EAAIxiE,GAEPq6B,EAAG5hD,EAAGu3G,KAET9tG,EAAOwtG,QAAQr6G,KAAKoD,GAGpByJ,EAAOytG,OAAOt6G,KAAK9D,UAKb,IAANyuB,GAAW0hF,EAAU,IACvBA,EAAU,GAIPrnD,EAAGmoC,EAAKwtB,KAEX9tG,EAAOwtG,QAAQr6G,KAAKmtF,GAGpBtgF,EAAOytG,OAAOt6G,KAAK9D,IAMzByuB,UACOA,EAAI0hF,GAIfx/F,EAAO0tG,KAAKv6G,KAAK6M,EAAOytG,OAAOr+G,QAG/B4Q,EAAO29F,MAAQ,CAACvd,EAAMof,GA6HxB,SAASuO,EAAW/tG,EAAQguG,GAE1B,KAAK,EAAAvnC,EAAA,IAAQunC,GACX,MAAM,IAAIl+G,UAAU,iBAKtB,GAFek+G,EAAIlQ,WAIjB,OAAO99F,EAAO/O,IAAI+8G,EAAI7wF,OAIxB,IAOI9tB,EAAGylG,EAAIv3D,EAAG0wE,EAPV53F,EAAO23F,EAAI33F,OAEf,GAAIA,EAAKjnB,SAAW4Q,EAAO29F,MAAMvuG,OAC/B,MAAM,IAAI2uG,GAAA,EAAe1nF,EAAKjnB,OAAQ4Q,EAAO29F,MAAMvuG,QAMrD,IAAI+tB,EAAM6wF,EAAI7wF,MACVE,EAAM2wF,EAAI3wF,MAEd,IAAKhuB,EAAI,EAAGylG,EAAK90F,EAAO29F,MAAMvuG,OAAQC,EAAIylG,EAAIzlG,KAC5C,SAAc8tB,EAAI9tB,GAAI2Q,EAAO29F,MAAMtuG,KACnC,SAAcguB,EAAIhuB,GAAI2Q,EAAO29F,MAAMtuG,IAIrC,IAAI6+G,EAAUluG,EAAOwtG,QACjBW,EAASnuG,EAAOytG,OAChBW,EAAOpuG,EAAO0tG,KAEdttB,EAAO4tB,EAAI9P,UAAU,GACrBsB,EAAUwO,EAAI9P,UAAU,GAExBxlG,EAAI,GACJ21G,EAAK,GAETjuB,EAAK9pF,SAAQ,SAAUjH,EAAG8R,GAExBktG,EAAGh/G,GAAK8R,EAAE,GAEVzI,EAAErJ,IAAK,KAGT,IAAI6hC,EAASg9E,EAAU,QAAKp7G,EACxB2gC,EAAQ,GACRo6E,EAAM,GAuBV,OArBArO,EAAQlpG,SAAQ,SAAUwnB,GAIxB,IAFA+vF,EAAI16G,KAAKsgC,EAAMrkC,QAEVmuC,EAAI6wE,EAAKtwF,GAAImwF,EAAKG,EAAKtwF,EAAI,GAAIyf,EAAI0wE,EAAI1wE,IAE1CluC,EAAI8+G,EAAO5wE,IAEE,IAAT7kC,EAAErJ,KAEJokC,EAAMtgC,KAAKk7G,EAAGh/G,IAEV6hC,GACFA,EAAO/9B,KAAK+6G,EAAQ3wE,QAM5BswE,EAAI16G,KAAKsgC,EAAMrkC,QAER,IAAIgnG,EAAa,CACtBllE,OAAQA,EACRuC,MAAOA,EACPo6E,IAAKA,EACLx3F,KAAMA,EACNyjF,SAAU95F,EAAO49F,YAIrB,SAAS0Q,EAAWtuG,EAAQyzB,EAAO2qE,EAAW37B,GAE5C,IAAKhvC,IAA2B,IAAlBA,EAAM+6B,QAClB,MAAM,IAAI1+D,UAAU,iBAItB,IAGIuuG,EAHAC,EAAQ7qE,EAAMpd,OACdynF,EAAWrqE,EAAMqqE,WAerB,IAXI,EAAAr3B,EAAA,IAAS23B,IAEXC,EAAQD,EAAU/nF,OAElB+nF,EAAYA,EAAUlK,WAGtBmK,GAAQ,SAAUD,GAIhBN,EAAU,CAEZ,GAAqB,IAAjBO,EAAMjvG,OACR,MAAM,IAAIU,UAAU,mBAItBkQ,EAAOwf,IAAIiU,EAAMtW,MAAOihF,EAAW37B,OAC9B,CAEL,GAAqB,IAAjB67B,EAAMlvG,QAAiC,IAAjBkvG,EAAMlvG,OAC9B,MAAM,IAAI2uG,GAAA,EAAeO,EAAMlvG,OAAQ4Q,EAAO29F,MAAMvuG,OAAQ,KAI9D,GAAIivG,EAAMjvG,OAASkvG,EAAMlvG,OAAQ,CAK/B,IAHA,IAAIC,EAAI,EACJ4pE,EAAQ,EAEQ,IAAbqlC,EAAMjvG,IAAyB,IAAbgvG,EAAMhvG,IAC7BA,IAGF,KAAoB,IAAbivG,EAAMjvG,IACX4pE,IACA5pE,IAIF+uG,GAAY,SAAUA,EAAWE,EAAMlvG,OAAQ6pE,EAAOolC,GAIxD,KAAK,SAAgBC,EAAOD,GAC1B,MAAM,IAAIN,GAAA,EAAeO,EAAOD,EAAO,KAUzC,IANA,IAAIkQ,EAAK96E,EAAMtW,MAAM,GACjBqxF,EAAK/6E,EAAMtW,MAAM,GAEjB3e,EAAI6/F,EAAM,GACVjqG,EAAIiqG,EAAM,GAEL7lG,EAAI,EAAGA,EAAIgG,EAAGhG,IAErB,IAAK,IAAIC,EAAI,EAAGA,EAAIrE,EAAGqE,IAAK,CAE1B,IAAIlC,EAAI6nG,EAAU5lG,GAAGC,GAErBuH,EAAOwf,IAAI,CAAChnB,EAAI+1G,EAAI91G,EAAI+1G,GAAKj4G,EAAGksE,IAKtC,OAAOziE,EAsHT,SAASyuG,EAAep/G,EAAG2hB,EAAK3B,EAAQokB,GAEtC,GAAIpkB,EAAS2B,GAAQ,EACnB,OAAO3B,EAIT,IAAK,IAAIlO,EAAI6P,EAAK7P,EAAIkO,EAAQlO,IAE5B,GAAIsyB,EAAMtyB,KAAO9R,EACf,OAAO8R,EAKX,OAAO6P,EAaT,SAAS09F,EAAQnxE,EAAGluC,EAAGyuB,EAAGvnB,EAAG26B,EAAQuC,EAAOo6E,GAE1C38E,EAAO0uC,OAAOriC,EAAG,EAAGhnC,GAEpBk9B,EAAMmsC,OAAOriC,EAAG,EAAGluC,GAEnB,IAAK,IAAImJ,EAAIslB,EAAI,EAAGtlB,EAAIq1G,EAAIz+G,OAAQoJ,IAClCq1G,EAAIr1G,KA6CR,SAASmmG,EAAQ3+F,EAAQogF,EAAMof,EAAS/8B,GAEtC,IAAIhxE,EAAQgxE,GAAgB,EAExBtqB,EAAK09C,EAELiY,EAAO,GAEP,EAAArnC,EAAA,IAASzmE,EAAO49F,aAElBzlD,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAAC71F,EAAO49F,UAAW59F,EAAO49F,aAAe/H,EAEtEiY,EAAO51B,EAAMzb,QAAQ,EAAGz8D,EAAO49F,WAE/BnsG,EAAQymF,EAAMzb,QAAQhrE,EAAOuO,EAAO49F,YAItC,IAIIvuG,EAAGyuB,EAAGyf,EAJNoxE,GAAOx2D,EAAG1mD,EAAOq8G,GAEjB3sG,EAAInB,EAAO29F,MAAM,GACjB3/F,EAAIgC,EAAO29F,MAAM,GAGrB,GAAI6B,EAAUxhG,EAAG,CAEf,IAAK8f,EAAI9f,EAAG8f,EAAI0hF,EAAS1hF,IAIvB,GAFA9d,EAAO0tG,KAAK5vF,GAAK9d,EAAOwtG,QAAQp+G,OAE5Bu/G,EAEF,IAAKt/G,EAAI,EAAGA,EAAI8R,EAAG9R,IAEjB2Q,EAAOwtG,QAAQr6G,KAAK1B,GAGpBuO,EAAOytG,OAAOt6G,KAAK9D,GAMzB2Q,EAAO0tG,KAAKlO,GAAWx/F,EAAOwtG,QAAQp+G,YAC7BowG,EAAUxhG,IAEnBgC,EAAO0tG,KAAK9tC,OAAO4/B,EAAU,EAAGxhG,EAAIwhG,GAGpCx/F,EAAOwtG,QAAQ5tC,OAAO5/D,EAAO0tG,KAAKlO,GAAUx/F,EAAOwtG,QAAQp+G,QAE3D4Q,EAAOytG,OAAO7tC,OAAO5/D,EAAO0tG,KAAKlO,GAAUx/F,EAAOytG,OAAOr+G,SAM3D,GAFA4O,EAAIwhG,EAEApf,EAAOj/E,GAET,GAAIwtG,EAAK,CAEP,IAAIv6G,EAAI,EAER,IAAK0pB,EAAI,EAAGA,EAAI9f,EAAG8f,IAAK,CAEtB9d,EAAO0tG,KAAK5vF,GAAK9d,EAAO0tG,KAAK5vF,GAAK1pB,EAElCmpC,EAAIv9B,EAAO0tG,KAAK5vF,EAAI,GAAK1pB,EAEzB,IAAI/B,EAAI,EAER,IAAKhD,EAAI8R,EAAG9R,EAAI+wF,EAAM/wF,IAAKgD,IAEzB2N,EAAOwtG,QAAQ5tC,OAAOriC,EAAIlrC,EAAG,EAAGZ,GAGhCuO,EAAOytG,OAAO7tC,OAAOriC,EAAIlrC,EAAG,EAAGhD,GAG/B+E,IAKJ4L,EAAO0tG,KAAK1vG,GAAKgC,EAAOwtG,QAAQp+G,aAE7B,GAAIgxF,EAAOj/E,EAAG,CAEnB,IAAIlD,EAAI,EAER,IAAK6f,EAAI,EAAGA,EAAI9f,EAAG8f,IAAK,CAEtB9d,EAAO0tG,KAAK5vF,GAAK9d,EAAO0tG,KAAK5vF,GAAK7f,EAElC,IAAI4tC,EAAK7rC,EAAO0tG,KAAK5vF,GACjBouB,EAAKlsC,EAAO0tG,KAAK5vF,EAAI,GAAK7f,EAE9B,IAAKs/B,EAAIsO,EAAItO,EAAI2O,EAAI3O,KAEnBluC,EAAI2Q,EAAOytG,OAAOlwE,IAEV6iD,EAAO,IAEbpgF,EAAOwtG,QAAQ5tC,OAAOriC,EAAG,GAGzBv9B,EAAOytG,OAAO7tC,OAAOriC,EAAG,GAGxBt/B,KAMN+B,EAAO0tG,KAAK5vF,GAAK9d,EAAOwtG,QAAQp+G,OAOlC,OAHA4Q,EAAO29F,MAAM,GAAKvd,EAClBpgF,EAAO29F,MAAM,GAAK6B,EAEXx/F,EA+TT,SAAS4uG,EAAS19E,EAAQuC,EAAOo6E,EAAKx3F,EAAM8qC,GAE1C,IAKI9xD,EAAGyuB,EALHsiE,EAAO/pE,EAAK,GACZmpF,EAAUnpF,EAAK,GAEfvY,EAAI,GAIR,IAAKzO,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAGpB,IAFAyO,EAAEzO,GAAK,GAEFyuB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IACvBhgB,EAAEzO,GAAGyuB,GAAK,EAKd,IAAKA,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAKvB,IAHA,IAAI+tB,EAAKgiE,EAAI/vF,GACTouB,EAAK2hE,EAAI/vF,EAAI,GAERyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAIvBz/B,EAFAzO,EAAIokC,EAAM8J,IAELzf,GAAKoT,EAASiwB,GAAO,SAAMjwB,EAAOqM,IAAMrM,EAAOqM,GAAK,EAI7D,OAAOz/B,EA0aT,OAp2CAs4F,EAAaxlG,UAAY,IAAIslG,EAK7BE,EAAaxlG,UAAUi+G,mBAAqB,SAAUn5G,EAAMokG,GAC1D,OAAO,IAAI1D,EAAa1gG,EAAMokG,IAOhC1D,EAAaxlG,UAAUmE,KAAO,eAC9BqhG,EAAaxlG,UAAUk+G,gBAAiB,EAWxC1Y,EAAaxlG,UAAUouG,YAAc,WACnC,OAAO,SAAiBrqG,KAAK64G,QAAS,OAaxCpX,EAAaxlG,UAAUipG,QAAU,WAC/B,MAAO,UAaTzD,EAAaxlG,UAAUkpG,SAAW,WAChC,OAAOnlG,KAAKipG,WAUdxH,EAAaxlG,UAAUqB,OAAS,SAAUyD,EAAMokG,GAC9C,OAAO,IAAI1D,EAAa1gG,EAAMokG,IAahC1D,EAAaxlG,UAAUm+G,QAAU,WAE/B,IAAI3uB,EAAOzrF,KAAKgpG,MAAM,GAClB6B,EAAU7qG,KAAKgpG,MAAM,GAEzB,OAAgB,IAATvd,GAA0B,IAAZof,EAAgB7qG,KAAK84G,OAAOr+G,QAAUgxF,EAAOof,GAAW,GAkB/EpJ,EAAaxlG,UAAUo0B,OAAS,SAAUyO,EAAOozC,EAAapE,GAE5D,IAAK9tE,KAAK64G,QACR,MAAM,IAAI13E,MAAM,iDAIlB,OAAQnB,UAAUvlC,QAChB,KAAK,EACH,OAAO2+G,EAAWp5G,KAAM8+B,GAG1B,KAAK,EACL,KAAK,EACH,OAAO66E,EAAW35G,KAAM8+B,EAAOozC,EAAapE,GAE9C,QACE,MAAM,IAAI7qC,YAAY,+BAgL5Bw+D,EAAaxlG,UAAUK,IAAM,SAAUwiC,GACrC,KAAK,EAAAgzC,EAAA,IAAQhzC,GACX,MAAM,IAAI3jC,UAAU,kBAGtB,GAAI2jC,EAAMrkC,SAAWuF,KAAKgpG,MAAMvuG,OAC9B,MAAM,IAAI2uG,GAAA,EAAetqE,EAAMrkC,OAAQuF,KAAKgpG,MAAMvuG,QAIpD,IAAKuF,KAAK64G,QACR,MAAM,IAAI13E,MAAM,8CAIlB,IAAIzmC,EAAIokC,EAAM,GACV3V,EAAI2V,EAAM,IAEd,SAAcpkC,EAAGsF,KAAKgpG,MAAM,KAC5B,SAAc7/E,EAAGnpB,KAAKgpG,MAAM,IAE5B,IAAIpgE,EAAIkxE,EAAep/G,EAAGsF,KAAK+4G,KAAK5vF,GAAInpB,KAAK+4G,KAAK5vF,EAAI,GAAInpB,KAAK84G,QAG/D,OAAIlwE,EAAI5oC,KAAK+4G,KAAK5vF,EAAI,IAAMnpB,KAAK84G,OAAOlwE,KAAOluC,EACtCsF,KAAK64G,QAAQjwE,GAGf,GAcT64D,EAAaxlG,UAAU4uB,IAAM,SAAUiU,EAAOl9B,EAAGksE,GAC/C,KAAK,EAAAgE,EAAA,IAAQhzC,GACX,MAAM,IAAI3jC,UAAU,kBAGtB,GAAI2jC,EAAMrkC,SAAWuF,KAAKgpG,MAAMvuG,OAC9B,MAAM,IAAI2uG,GAAA,EAAetqE,EAAMrkC,OAAQuF,KAAKgpG,MAAMvuG,QAIpD,IAAKuF,KAAK64G,QACR,MAAM,IAAI13E,MAAM,8CAIlB,IAAIzmC,EAAIokC,EAAM,GACV3V,EAAI2V,EAAM,GAEV2sD,EAAOzrF,KAAKgpG,MAAM,GAClB6B,EAAU7qG,KAAKgpG,MAAM,GAErBxlD,EAAK09C,EAELiY,EAAO,GAEP,EAAArnC,EAAA,IAAS9xE,KAAKipG,aAEhBzlD,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAAClhG,KAAKipG,UAAWjpG,KAAKipG,aAAe/H,EAElEiY,EAAO51B,EAAMzb,QAAQ,EAAG9nE,KAAKipG,aAI3BvuG,EAAI+wF,EAAO,GAAKtiE,EAAI0hF,EAAU,KAEhCb,EAAQhqG,KAAMyF,KAAKijB,IAAIhuB,EAAI,EAAG+wF,GAAOhmF,KAAKijB,IAAIS,EAAI,EAAG0hF,GAAU/8B,GAG/D2d,EAAOzrF,KAAKgpG,MAAM,GAClB6B,EAAU7qG,KAAKgpG,MAAM,KAIvB,SAActuG,EAAG+wF,IACjB,SAActiE,EAAG0hF,GAEjB,IAAIjiE,EAAIkxE,EAAep/G,EAAGsF,KAAK+4G,KAAK5vF,GAAInpB,KAAK+4G,KAAK5vF,EAAI,GAAInpB,KAAK84G,QAiB/D,OAdIlwE,EAAI5oC,KAAK+4G,KAAK5vF,EAAI,IAAMnpB,KAAK84G,OAAOlwE,KAAOluC,EAExC8oD,EAAG5hD,EAAGu3G,GAiCf,SAAiBvwE,EAAGzf,EAAGoT,EAAQuC,EAAOo6E,GAEpC38E,EAAO0uC,OAAOriC,EAAG,GACjB9J,EAAMmsC,OAAOriC,EAAG,GAEhB,IAAK,IAAI/kC,EAAIslB,EAAI,EAAGtlB,EAAIq1G,EAAIz+G,OAAQoJ,IAClCq1G,EAAIr1G,KAlCFw2G,CAAQzxE,EAAGzf,EAAGnpB,KAAK64G,QAAS74G,KAAK84G,OAAQ94G,KAAK+4G,MAH9C/4G,KAAK64G,QAAQjwE,GAAKhnC,EAOpBm4G,EAAQnxE,EAAGluC,EAAGyuB,EAAGvnB,EAAG5B,KAAK64G,QAAS74G,KAAK84G,OAAQ94G,KAAK+4G,MAG/C/4G,MAwDTyhG,EAAaxlG,UAAUg3F,OAAS,SAAUvxE,EAAMosD,EAActhB,GAE5D,KAAK,EAAAslB,EAAA,IAAapwD,GAChB,MAAM,IAAIvmB,UAAU,4BAItB,IAAIovG,EAAY7oF,EAAKynC,UAAUxyC,KAAI7Z,GAC1BlC,MAAMgD,QAAQd,IAA2B,IAAjBA,EAAMrC,OAAeqC,EAAM,GAAKA,IAGjE,GAAyB,IAArBytG,EAAU9vG,OACZ,MAAM,IAAI0mC,MAAM,4CAYlB,OARAopE,EAAU5oG,SAAQ,SAAU7E,GAC1B,KAAK,EAAAg1E,EAAA,IAASh1E,MAAW,OAAUA,IAAUA,EAAQ,EACnD,MAAM,IAAI3B,UAAU,wDAA8D,SAAOovG,GAAa,QAMnGP,EAFCx9C,EAAOxsD,KAAKysD,QAAUzsD,KAEZuqG,EAAU,GAAIA,EAAU,GAAIz8B,IA+IhD2zB,EAAaxlG,UAAUi3F,QAAU,SAAUonB,EAAO9tD,GAEhD,KAAK,EAAAslB,EAAA,IAAQwoC,GACX,MAAM,IAAIn/G,UAAU,kBAGtB,GAAqB,IAAjBm/G,EAAM7/G,OACR,MAAM,IAAI0mC,MAAM,0DAIlBm5E,EAAM34G,SAAQ,SAAU7E,GACtB,KAAK,EAAAg1E,EAAA,IAASh1E,MAAW,OAAUA,IAAUA,IAAU,GAAe,IAAVA,EAC1D,MAAM,IAAI3B,UAAU,8DAAoE,SAAOm/G,GAAS,QAG5G,IAAI9P,EAAgBxqG,KAAKgpG,MAAM,GAAKhpG,KAAKgpG,MAAM,GAI/C,GAAIwB,KAHJ8P,GAAQ,SAAqBA,EAAO9P,IACd,GAAK8P,EAAM,GAG/B,MAAM,IAAIn5E,MAAM,uEAIlB,IAAIt3B,EAAI2iD,EAAOxsD,KAAKysD,QAAUzsD,KAE9B,GAAIA,KAAKgpG,MAAM,KAAOsR,EAAM,IAAMt6G,KAAKgpG,MAAM,KAAOsR,EAAM,GACxD,OAAOzwG,EAMT,IAFA,IAAI0wG,EAAW,GAEN7/G,EAAI,EAAGA,EAAImP,EAAEkvG,KAAKt+G,OAAQC,IACjC,IAAK,IAAIyuB,EAAI,EAAGA,EAAItf,EAAEkvG,KAAKr+G,EAAI,GAAKmP,EAAEkvG,KAAKr+G,GAAIyuB,IAC7CoxF,EAAS/7G,KAAK9D,GAWlB,IANA,IAAI6hC,EAAS1yB,EAAEgvG,QAAQ/5G,QAGnB07G,EAAW3wG,EAAEivG,OAAOh6G,QAGfT,EAAK,EAAGA,EAAKwL,EAAEivG,OAAOr+G,OAAQ4D,IAAM,CAC3C,IAAIo8G,EAAKD,EAASn8G,GACd4qF,EAAKsxB,EAASl8G,GACdq8G,EAAOD,EAAK5wG,EAAEm/F,MAAM,GAAK/f,EAC7BsxB,EAASl8G,GAAMq8G,EAAOJ,EAAM,GAC5BE,EAASn8G,GAAMoH,KAAKgd,MAAMi4F,EAAOJ,EAAM,IAQzCzwG,EAAEgvG,QAAQp+G,OAAS,EACnBoP,EAAEivG,OAAOr+G,OAAS,EAClBoP,EAAEkvG,KAAKt+G,OAAS6/G,EAAM,GAAK,EAC3BzwG,EAAEm/F,MAAQsR,EAAMx7G,QAEhB,IAAK,IAAIo+F,EAAM,EAAGA,EAAMrzF,EAAEkvG,KAAKt+G,OAAQyiG,IACrCrzF,EAAEkvG,KAAK7b,GAAO,EAKhB,IAAK,IAAIl5F,EAAI,EAAGA,EAAIu4B,EAAO9hC,OAAQuJ,IAAK,CACtC,IAAI22G,EAAMH,EAASx2G,GACf0sG,EAAK6J,EAASv2G,GACdpC,EAAI26B,EAAOv4B,GAIf+1G,EAFQD,EAAea,EAAK9wG,EAAEkvG,KAAKrI,GAAK7mG,EAAEkvG,KAAKrI,EAAK,GAAI7mG,EAAEivG,QAE/C6B,EAAKjK,EAAI9uG,EAAGiI,EAAEgvG,QAAShvG,EAAEivG,OAAQjvG,EAAEkvG,MAIhD,OAAOlvG,GAST43F,EAAaxlG,UAAUwwD,MAAQ,WAQ7B,OAPQ,IAAIg1C,EAAa,CACvBllE,OAAQv8B,KAAK64G,SAAU,SAAM74G,KAAK64G,cAAW16G,EAC7C2gC,OAAO,SAAM9+B,KAAK84G,QAClBI,KAAK,SAAMl5G,KAAK+4G,MAChBr3F,MAAM,SAAM1hB,KAAKgpG,OACjB7D,SAAUnlG,KAAKipG,aAWnBxH,EAAaxlG,UAAUylB,KAAO,WAC5B,OAAO1hB,KAAKgpG,MAAMlqG,MAAM,IAe1B2iG,EAAaxlG,UAAU0a,IAAM,SAAUzC,EAAUkxF,GAE/C,IAAKplG,KAAK64G,QACR,MAAM,IAAI13E,MAAM,8CAIlB,IAAIspE,EAAKzqG,KAWT,OAQF,SAAcqL,EAAQuvG,EAAQC,EAAQC,EAAWC,EAAW7mG,EAAUkxF,GAEpE,IAAI7oE,EAAS,GACTuC,EAAQ,GACRo6E,EAAM,GAEN11D,EAAK09C,EAELiY,EAAO,GAEP,EAAArnC,EAAA,IAASzmE,EAAO49F,aAElBzlD,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAAC71F,EAAO49F,UAAW59F,EAAO49F,aAAe/H,EAEtEiY,EAAO51B,EAAMzb,QAAQ,EAAGz8D,EAAO49F,YAiBjC,IAbA,IAAI+R,EAAS,SAAgBp5G,EAAGiC,EAAGC,GAEjClC,EAAIsS,EAAStS,EAAGiC,EAAGC,GAEd0/C,EAAG5hD,EAAGu3G,KAET58E,EAAO/9B,KAAKoD,GAEZk9B,EAAMtgC,KAAKqF,KAKNslB,EAvCsB,EAuCPA,GAAK4xF,EAAW5xF,IAAK,CAE3C+vF,EAAI16G,KAAK+9B,EAAO9hC,QAEhB,IAAIy8C,EAAK7rC,EAAO0tG,KAAK5vF,GACjBouB,EAAKlsC,EAAO0tG,KAAK5vF,EAAI,GAEzB,GAAIi8E,EAEF,IAAK,IAAIx8D,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5B,IAAIluC,EAAI2Q,EAAOytG,OAAOlwE,GAElBluC,GApDQ,GAoDOA,GAAKmgH,GAEtBG,EAAO3vG,EAAOwtG,QAAQjwE,GAAIluC,EAtDhB,EAsD4ByuB,EAtDf,OAyDtB,CAIL,IAFA,IAAI0vF,EAAU,GAELoC,EAAK/jE,EAAI+jE,EAAK1jE,EAAI0jE,IAEzBpC,EADUxtG,EAAOytG,OAAOmC,IACT5vG,EAAOwtG,QAAQoC,GAKhC,IAAK,IAAIC,EApEK,EAoESA,GAAOL,EAAQK,IAEpCF,EADYE,KAAOrC,EAAUA,EAAQqC,GAAO,EAC9BA,EAtEF,EAsEgB/xF,EAtEH,IA8E/B,OAFA+vF,EAAI16G,KAAK+9B,EAAO9hC,QAET,IAAIgnG,EAAa,CACtBllE,OAAQA,EACRuC,MAAOA,EACPo6E,IAAKA,EACLx3F,KAAM,CAACm5F,EAlFS,EAkFS,EAAGE,EAlFC,EAkFuB,KAlF/C9kG,CAAKjW,KAAM,EATPA,KAAKgpG,MAAM,GASM,EAAG,EARjBhpG,KAAKgpG,MAAM,GAQmB,GAN/B,SAAgBpnG,EAAGlH,EAAGyuB,GAEjC,OAAOjV,EAAStS,EAAG,CAAClH,EAAGyuB,GAAIshF,KAI0BrF,IA+FzD3D,EAAaxlG,UAAU0F,QAAU,SAAUuS,EAAUkxF,GAEnD,IAAKplG,KAAK64G,QACR,MAAM,IAAI13E,MAAM,kDASlB,IALA,IAEIsqD,EAAOzrF,KAAKgpG,MAAM,GAClB6B,EAAU7qG,KAAKgpG,MAAM,GAEhB7/E,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhC,IAAI+tB,EAAKl3C,KAAK+4G,KAAK5vF,GACfouB,EAAKv3C,KAAK+4G,KAAK5vF,EAAI,GAEvB,GAAIi8E,EAEF,IAAK,IAAIx8D,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5B,IAAIluC,EAAIsF,KAAK84G,OAAOlwE,GAEpB10B,EAASlU,KAAK64G,QAAQjwE,GAAI,CAACluC,EAAGyuB,GAhB3BnpB,UAkBA,CAIL,IAFA,IAAIu8B,EAAS,GAEJ4+E,EAAMjkE,EAAIikE,EAAM5jE,EAAI4jE,IAE3B5+E,EADUv8B,KAAK84G,OAAOqC,IACRn7G,KAAK64G,QAAQsC,GAK7B,IAAK,IAAIC,EAAM,EAAGA,EAAM3vB,EAAM2vB,IAE5BlnG,EADYknG,KAAO7+E,EAASA,EAAO6+E,GAAO,EAC1B,CAACA,EAAKjyF,GA/BnBnpB,SA2CXyhG,EAAaxlG,UAAUsjG,QAAU,WAC/B,OAAO0a,EAASj6G,KAAK64G,QAAS74G,KAAK84G,OAAQ94G,KAAK+4G,KAAM/4G,KAAKgpG,OAAO,IASpEvH,EAAaxlG,UAAUktD,QAAU,WAC/B,OAAO8wD,EAASj6G,KAAK64G,QAAS74G,KAAK84G,OAAQ94G,KAAK+4G,KAAM/4G,KAAKgpG,OAAO,IA+CpEvH,EAAaxlG,UAAU44F,OAAS,SAAU5+B,GASxC,IAPA,IAAIw1B,EAAOzrF,KAAKgpG,MAAM,GAClB6B,EAAU7qG,KAAKgpG,MAAM,GAErBoR,EAAUp6G,KAAKo6G,UAEf/6E,EAAM,mBAAoB,SAAOosD,EAAMx1B,GAAW,OAAQ,SAAO40C,EAAS50C,GAAW,eAAgB,SAAOmkD,EAASnkD,GAAW,KAE3H9sC,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAK3B,IAHA,IAAI+tB,EAAKl3C,KAAK+4G,KAAK5vF,GACfouB,EAAKv3C,KAAK+4G,KAAK5vF,EAAI,GAEdyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5B,IAAIluC,EAAIsF,KAAK84G,OAAOlwE,GAEpBvJ,GAAO,WAAY,SAAO3kC,EAAGu7D,GAAW,MAAO,SAAO9sC,EAAG8sC,GAAW,UAAYj2D,KAAK64G,SAAU,SAAO74G,KAAK64G,QAAQjwE,GAAIqtB,GAAW,KAItI,OAAO52B,GASToiE,EAAaxlG,UAAUyD,SAAW,WAChC,OAAO,SAAOM,KAAKu/F,YASrBkC,EAAaxlG,UAAUmtD,OAAS,WAC9B,MAAO,CACLkqB,OAAQ,eACR/2C,OAAQv8B,KAAK64G,QACb/5E,MAAO9+B,KAAK84G,OACZI,IAAKl5G,KAAK+4G,KACVr3F,KAAM1hB,KAAKgpG,MACX7D,SAAUnlG,KAAKipG,YAanBxH,EAAaxlG,UAAUyuG,SAAW,SAAU9hE,GAE1C,GAAIA,GAOF,IALI,EAAAkpC,EAAA,IAAYlpC,KACdA,EAAIA,EAAE6f,cAIH,EAAAqpB,EAAA,IAASlpC,MAAO,OAAUA,GAC7B,MAAM,IAAIztC,UAAU,kDAItBytC,EAAI,EAGN,IAAI+hE,EAAS/hE,EAAI,EAAIA,EAAI,EACrBgiE,EAAOhiE,EAAI,GAAKA,EAAI,EAEpB6iD,EAAOzrF,KAAKgpG,MAAM,GAClB6B,EAAU7qG,KAAKgpG,MAAM,GAErBvpG,EAAIgG,KAAK+iB,IAAIijE,EAAOmf,EAAMC,EAAUF,GAEpCpuE,EAAS,GACTuC,EAAQ,GACRo6E,EAAM,GAEVA,EAAI,GAAK,EAET,IAAK,IAAI/vF,EAAIwhF,EAAQxhF,EAAI0hF,GAAWtuE,EAAO9hC,OAASgF,EAAG0pB,IAKrD,IAHA,IAAI+tB,EAAKl3C,KAAK+4G,KAAK5vF,GACfouB,EAAKv3C,KAAK+4G,KAAK5vF,EAAI,GAEdtlB,EAAIqzC,EAAIrzC,EAAI0zC,EAAI1zC,IAAK,CAE5B,IAAInJ,EAAIsF,KAAK84G,OAAOj1G,GAEpB,GAAInJ,IAAMyuB,EAAIwhF,EAASC,EAAM,CAE3BruE,EAAO/9B,KAAKwB,KAAK64G,QAAQh1G,IAEzBi7B,EAAMvC,EAAO9hC,OAAS,GAAKC,EAAIkwG,EAE/B,OAQN,OAFAsO,EAAI16G,KAAK+9B,EAAO9hC,QAET,IAAIgnG,EAAa,CACtBllE,OAAQA,EACRuC,MAAOA,EACPo6E,IAAKA,EACLx3F,KAAM,CAACjiB,EAAG,MAadgiG,EAAaluB,SAAW,SAAUzjB,GAChC,OAAO,IAAI2xC,EAAa3xC,IAgB1B2xC,EAAaiJ,SAAW,SAAUhpF,EAAM5kB,EAAO8rC,EAAGklC,EAAcq3B,GAC9D,KAAK,EAAArzB,EAAA,IAAQpwD,GACX,MAAM,IAAIvmB,UAAU,kCAGtB,GAAoB,IAAhBumB,EAAKjnB,OACP,MAAM,IAAI0mC,MAAM,4CAmBlB,GAfAzf,EAAOA,EAAK/K,KAAI,SAAUhD,GAQxB,IANI,EAAAm+D,EAAA,IAAYn+D,KAEdA,EAAIA,EAAE80C,cAIH,EAAAqpB,EAAA,IAASn+D,MAAO,OAAUA,IAAMA,EAAI,EACvC,MAAM,IAAIwtB,MAAM,yCAGlB,OAAOxtB,KAGLi1B,GAOF,IALI,EAAAkpC,EAAA,IAAYlpC,KACdA,EAAIA,EAAE6f,cAIH,EAAAqpB,EAAA,IAASlpC,MAAO,OAAUA,GAC7B,MAAM,IAAIztC,UAAU,kDAItBytC,EAAI,EAIN,IAAI4a,EAAK09C,EAELiY,EAAO,GAEP,EAAArnC,EAAA,IAASqzB,KAEX3hD,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACiE,EAAUA,KAAcjE,EAEtDiY,EAAO51B,EAAMzb,QAAQ,EAAGq9B,IAG1B,IAQI2F,EARAH,EAAS/hE,EAAI,EAAIA,EAAI,EACrBgiE,EAAOhiE,EAAI,GAAKA,EAAI,EAEpB6iD,EAAO/pE,EAAK,GACZmpF,EAAUnpF,EAAK,GAEfjiB,EAAIgG,KAAK+iB,IAAIijE,EAAOmf,EAAMC,EAAUF,GAKxC,IAAI,EAAA74B,EAAA,IAAQh1E,GAAQ,CAElB,GAAIA,EAAMrC,SAAWgF,EAEnB,MAAM,IAAI0hC,MAAM,8BAIlB2pE,EAAS,SAAgBpwG,GAEvB,OAAOoC,EAAMpC,SAEV,IAAI,EAAAo3E,EAAA,IAASh1E,GAAQ,CAE1B,IAAIiuG,EAAKjuG,EAAM4kB,OAEf,GAAkB,IAAdqpF,EAAGtwG,QAAgBswG,EAAG,KAAOtrG,EAE/B,MAAM,IAAI0hC,MAAM,yBAIlB2pE,EAAS,SAAgBpwG,GAEvB,OAAOoC,EAAMR,IAAI,CAAC5B,UAIpBowG,EAAS,WAEP,OAAOhuG,GASX,IAJA,IAAIy/B,EAAS,GACTuC,EAAQ,GACRo6E,EAAM,GAED/vF,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhC+vF,EAAI16G,KAAK+9B,EAAO9hC,QAEhB,IAAIC,EAAIyuB,EAAIwhF,EAEZ,GAAIjwG,GAAK,GAAKA,EAAI+E,EAAG,CAEnB,IAAImC,EAAIkpG,EAAOpwG,GAGV8oD,EAAG5hD,EAAGu3G,KAETr6E,EAAMtgC,KAAK9D,EAAIkwG,GAEfruE,EAAO/9B,KAAKoD,KAQlB,OAFAs3G,EAAI16G,KAAK+9B,EAAO9hC,QAET,IAAIgnG,EAAa,CACtBllE,OAAQA,EACRuC,MAAOA,EACPo6E,IAAKA,EACLx3F,KAAM,CAAC+pE,EAAMof,MAcjBpJ,EAAaxlG,UAAU+uG,SAAW,SAAUtwG,EAAGyuB,GAE7C,MAAK,EAAA2oD,EAAA,IAASp3E,KAAO,OAAUA,KAAO,EAAAo3E,EAAA,IAAS3oD,KAAO,OAAUA,IAC9D,MAAM,IAAIgY,MAAM,uCAIlB,GAA0B,IAAtBnhC,KAAKgpG,MAAMvuG,OACb,MAAM,IAAI0mC,MAAM,4CAUlB,OANA,SAAczmC,EAAGsF,KAAKgpG,MAAM,KAC5B,SAAc7/E,EAAGnpB,KAAKgpG,MAAM,IAE5BvH,EAAawJ,UAAUvwG,EAAGyuB,EAAGnpB,KAAKgpG,MAAM,GAAIhpG,KAAK64G,QAAS74G,KAAK84G,OAAQ94G,KAAK+4G,MAGrE/4G,MAaTyhG,EAAa4Z,YAAc,SAAUlyF,EAAGoT,EAAQuC,EAAOo6E,EAAKhlG,GAK1D,IAHA,IAAIgjC,EAAKgiE,EAAI/vF,GACTouB,EAAK2hE,EAAI/vF,EAAI,GAERyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAEvB10B,EAAS4qB,EAAM8J,GAAIrM,EAAOqM,KAe9B64D,EAAawJ,UAAY,SAAUpnG,EAAGC,EAAG+mG,EAAStuE,EAAQuC,EAAOo6E,GAE/D,IAAK,IAAI/vF,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhC,IAAI+tB,EAAKgiE,EAAI/vF,GACTouB,EAAK2hE,EAAI/vF,EAAI,GAEbmyF,EAAKxB,EAAej2G,EAAGqzC,EAAIK,EAAIzY,GAG/By8E,EAAKzB,EAAeh2G,EAAGozC,EAAIK,EAAIzY,GAGnC,GAAIw8E,EAAK/jE,GAAMgkE,EAAKhkE,GAAMzY,EAAMw8E,KAAQz3G,GAAKi7B,EAAMy8E,KAAQz3G,GAEzD,GAAIy4B,EAAQ,CACV,IAAI36B,EAAI26B,EAAO++E,GACf/+E,EAAO++E,GAAM/+E,EAAOg/E,GACpBh/E,EAAOg/E,GAAM35G,QAQjB,GAAI05G,EAAK/jE,GAAMzY,EAAMw8E,KAAQz3G,IAAM03G,GAAMhkE,GAAMzY,EAAMy8E,KAAQz3G,GAA7D,CAEE,IAAI03G,EAAKj/E,EAASA,EAAO++E,QAAMn9G,EAE/B2gC,EAAMmsC,OAAOswC,EAAI,EAAGz3G,GAEhBy4B,GACFA,EAAO0uC,OAAOswC,EAAI,EAAGC,GAIvB18E,EAAMmsC,OAAOswC,GAAMD,EAAKA,EAAK,EAAIA,EAAI,GAEjC/+E,GACFA,EAAO0uC,OAAOswC,GAAMD,EAAKA,EAAK,EAAIA,EAAI,QAQ1C,GAAIC,EAAKhkE,GAAMzY,EAAMy8E,KAAQz3G,IAAMw3G,GAAM/jE,GAAMzY,EAAMw8E,KAAQz3G,GAAI,CAE/D,IAAI43G,EAAKl/E,EAASA,EAAOg/E,QAAMp9G,EAE/B2gC,EAAMmsC,OAAOqwC,EAAI,EAAGz3G,GAEhB04B,GACFA,EAAO0uC,OAAOqwC,EAAI,EAAGG,GAIvB38E,EAAMmsC,OAAOqwC,GAAMC,EAAKA,EAAK,EAAIA,EAAI,GAEjCh/E,GACFA,EAAO0uC,OAAOqwC,GAAMC,EAAKA,EAAK,EAAIA,EAAI,MAMvC9Z,IACN,CACD7uB,SAAS,IC//CP,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,cAAe,gBAC3CwjC,IAA8B,QAAQ,GAAM,IAAe5oD,IACpE,IAAI,MACF+1B,EAAK,OACLge,EAAM,YACNC,EAAW,aACXC,GACEj0C,EAkCJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,OAAOm4B,EAAQ,KAEjBj4C,OAAQ,SAAgBoxB,GACtB,OAAO6mB,EAAQ,GAAI7mB,IAErB,iBAAkB,SAAsBA,EAAQsQ,GAC9C,OAAOuW,EAAQ,GAAI7mB,EAAQsQ,IAE7BvqG,MAAO,SAAemG,GACpB,OAAO26G,EAAQ36G,IAEjBwgG,OAAQ,SAAgBxgG,GACtB,OAAO26G,EAAQ36G,EAAMA,EAAKmkG,YAE5B,yBAA0BwW,EAC1B,iCAAkCA,IAWpC,SAASA,EAAQ36G,EAAM8zF,EAAQsQ,GAE7B,GAAe,UAAXtQ,GAAiC,YAAXA,QAAmC12F,IAAX02F,EAChD,OAAO,IAAI2M,EAAYzgG,EAAMokG,GAG/B,GAAe,WAAXtQ,EACF,OAAO,IAAI4M,EAAa1gG,EAAMokG,GAGhC,MAAM,IAAIhqG,UAAU,uBAAyB0hC,KAAKqC,UAAU21D,GAAU,SC7EtE,GAAO,OACP,GAAe,CAAC,SAAU,QAAS,aAAc,aAAc,SAAU,UAAW,YAAa,YAC1F8mB,IAA4B,QAAQ,GAAM,IAAenuD,IAClE,IAAI,OACF1B,EAAM,MACNy3B,EAAK,WACLz9B,EAAU,WACV+xB,EAAU,OACVxsE,EAAM,QACNk4B,EAAO,UACP8zD,EAAS,SACT9oC,GACEf,EAyCJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQghC,GAGRjqE,QAASq4E,EACT,mBAAoBA,EACpBvkB,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEo/C,QAEXsjC,KAsCF,SAAmB1iF,GACjB,GAAIA,EAAE/G,QAAS,EAAAg1E,EAAA,IAAUjuE,EAAE/G,OAAQ,CACjC,IAAIoM,EAASrF,EAAE4oD,QAMf,OALAvjD,EAAOpM,MAAQ,GACfoM,EAASA,EAAO0J,IAAI,EAAM,IAEnB9V,MAAQ8+G,EAAa/3G,EAAE/G,OAEvBoM,EAEP,IAOI2yG,EAPAC,EAASh2D,EAAWjiD,EAAE/G,OAEtBg/G,IACFj4G,EAAE/G,MAAQ+6E,EAAWh0E,EAAE/G,QAOvB++G,GADE,EAAA/pC,EAAA,IAAYjuE,EAAE/G,OACR,IAAIu6F,EAAU,GAAGzzC,IAAI,IACpB,EAAAkuB,EAAA,IAAWjuE,EAAE/G,OACd,IAAIyxD,EAAS,EAAG,GAEhB,EAAI,EAGd,IAAIwtD,EAAUl4G,EAAE+O,IAAIipG,GAMpB,OAJIC,IACFC,EAAQj/G,MAAQ+6E,EAAWkkC,EAAQj/G,QAG9Bi/G,GAtET,iBAAkB,SAAqBl4G,GAErC,OAAO,SAAQA,EAAG7D,MAAM,MAa5B,SAAS47G,EAAa/3G,EAAGm4G,GAEvB,IAAIC,EAAOp4G,EAAEigC,MAAQ,EACjB34B,EAAMtH,EAAEsH,MAER+wG,EAAY,IAAI34E,EAAQiqE,GAAWriG,GAAM,GAAGu8C,IAAI,IAAInkB,EAAQ,EAAG04E,GAAMn5E,OAEzE,GAAIk5E,EAAU,CACZ,IAAIG,EAAM,CAACD,EAAW,IAAI34E,EAAQiqE,GAAWriG,GAAM,GAAGu8C,IAAI,IAAInkB,EAAQ,EAAG04E,EAAiB,EAAVx2G,KAAKiF,GAAS,GAAGo4B,OAAQ,IAAIS,EAAQiqE,GAAWriG,GAAM,GAAGu8C,IAAI,IAAInkB,EAAQ,EAAG04E,EAAiB,EAAVx2G,KAAKiF,GAAS,GAAGo4B,QACpL,MAAyB,UAAlBgpB,EAAOzgD,OAAqB8wG,EAAM9wG,EAAO8wG,GAEhD,OAAOD,MC1FT,GAAe,CAAC,SACTE,IAAmC,QAFnC,cAEiD,IAAe5uD,IACzE,IAAI,MACF+1B,GACE/1B,EAqBJ,OAAO,SAAoB6uD,EAAaC,EAAcpoG,EAAUnH,GAE9D,IAAIwvG,EAAQF,EAAYtT,MACpByT,EAAQH,EAAYrT,MACpByT,EAAMJ,EAAYpT,UAElByT,EAAUJ,EAAazD,QACvB8D,EAASL,EAAaxD,OACtB8D,EAAON,EAAavD,KACpB8D,EAAQP,EAAatT,MACrB8T,EAAMR,EAAarT,UAEvB,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKH,EACH,MAAM,IAAIv7E,MAAM,sEAIlB,IAOIzmC,EAAGyuB,EAPHsiE,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAEhB3pG,EAAoB,iBAAR4pG,GAAoBA,IAAQK,EAAML,OAAMt+G,EAEpD6+G,EAAKnqG,EAAK0wE,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,IAAOqB,EAI3C+oG,EAAQ,GAEZ,IAAKviH,EAAI,EAAGA,EAAI+wF,EAAM/wF,IACpBuiH,EAAMviH,GAAK,GAIb,IAAImJ,EAAI,GAEJE,EAAI,GAER,IAAKolB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAI5B,IAFA,IAAI+zF,EAAO/zF,EAAI,EAEN+tB,EAAK0lE,EAAKzzF,GAAIouB,EAAKqlE,EAAKzzF,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAIvD/kC,EAFAnJ,EAAIiiH,EAAO/zE,IAEJ77B,EAAUiwG,EAAGN,EAAQ9zE,GAAI2zE,EAAM7hH,GAAGyuB,IAAM6zF,EAAGT,EAAM7hH,GAAGyuB,GAAIuzF,EAAQ9zE,IAEvE7kC,EAAErJ,GAAKwiH,EAIT,IAAKxiH,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAEhBqJ,EAAErJ,KAAOwiH,EAEXD,EAAMviH,GAAGyuB,GAAKtlB,EAAEnJ,GAGhBuiH,EAAMviH,GAAGyuB,GAAKozF,EAAM7hH,GAAGyuB,GAM7B,OAAOkzF,EAAYlS,kBAAkB,CACnCppG,KAAMk8G,EACNv7F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QCtGZ,GAAe,CAAC,QAAS,eAClBsqG,IAAmC,QAFnC,cAEiD,IAAe3vD,IACzE,IAAI,MACF+1B,EAAK,YACL2d,GACE1zC,EAoBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,GAEhC,IAAIkpG,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACTyD,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAERyT,EAAUtzG,EAAEyvG,QACZ8D,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KACT8D,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAEZ,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIhqG,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBh5D,EAAK09C,EAELiY,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELj5D,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAIjC,IAUInY,EAAGyuB,EAAGyf,EAAGsO,EAAIK,EAVbgmE,EAAUH,GAAWV,EAAU,QAAKv+G,EACpCovB,EAAS,GACTiwF,EAAO,GAEPC,EAAKL,GAAWV,EAAU,QAAKv+G,EAC/Bu/G,EAAKN,GAAWV,EAAU,QAAKv+G,EAE/Bw/G,EAAK,GACLC,EAAK,GAIT,IAAKz0F,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAE5Bq0F,EAAKr0F,GAAKoE,EAAO9yB,OAEjB,IAAIyiH,EAAO/zF,EAAI,EAEf,IAAK+tB,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAEnDluC,EAAI2iH,EAAOz0E,GAEXrb,EAAO/uB,KAAK9D,GAEZijH,EAAGjjH,GAAKwiH,EAEJO,IACFA,EAAG/iH,GAAK0iH,EAAQx0E,IAKpB,IAAKsO,EAAK0lE,EAAKzzF,GAAIouB,EAAKqlE,EAAKzzF,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAInD,GAAI+0E,EAFJjjH,EAAIiiH,EAAO/zE,MAEGs0E,GAEZ,GAAIO,EAAI,CAEN,IAAI77G,EAAIo7G,EAAGS,EAAG/iH,GAAIgiH,EAAQ9zE,IAErB4a,EAAG5hD,EAAGu3G,GAKTwE,EAAGjjH,GAAK,KAHR+iH,EAAG/iH,GAAKkH,QAQZ2rB,EAAO/uB,KAAK9D,GAEZkjH,EAAGljH,GAAKwiH,EAEJQ,IACFA,EAAGhjH,GAAKgiH,EAAQ9zE,IAMtB,GAAI60E,GAAMC,EAIR,IAFA90E,EAAI40E,EAAKr0F,GAEFyf,EAAIrb,EAAO9yB,QAIZkjH,EAFJjjH,EAAI6yB,EAAOqb,MAEGs0E,GAEZK,EAAQ30E,GAAK60E,EAAG/iH,GAEhBkuC,KACSg1E,EAAGljH,KAAOwiH,GAEnBK,EAAQ30E,GAAK80E,EAAGhjH,GAEhBkuC,KAGArb,EAAO09C,OAAOriC,EAAG,GASzB,OAFA40E,EAAK3S,GAAWt9E,EAAO9yB,OAEhB0O,EAAE+wG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QC1KZ,GAAe,CAAC,QAAS,eAClBgrG,IAAmC,QAFnC,cAEiD,IAAerwD,IACzE,IAAI,MACF+1B,EAAK,YACLie,GACEh0C,EAqBJ,OAAO,SAAqB75C,EAAGvK,EAAG8K,EAAUnH,GAE1C,IAAIqwG,EAAUzpG,EAAEklG,QACZwE,EAAS1pG,EAAEmlG,OACXwE,EAAO3pG,EAAEolG,KACTyD,EAAQ7oG,EAAEq1F,MACVyT,EAAM9oG,EAAEs1F,UAEZ,IAAKmU,EACH,MAAM,IAAIj8E,MAAM,sEAIlB,IAGItuB,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBQ,EAAK9oG,EAEU,iBAARuoG,IAET5pG,EAAK4pG,EAELrzG,EAAIm6E,EAAMzb,QAAQ1+D,EAAGyJ,GAErBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAUjC,IANA,IAAIoqG,EAAQ,GAERp5G,EAAI,GAEJE,EAAI,GAEColB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAIhC,IAFA,IAAI+zF,EAAO/zF,EAAI,EAEN+tB,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5D,IAAIp8B,EAAI6wG,EAAOz0E,GAEf/kC,EAAE2I,GAAK4wG,EAAQx0E,GACf7kC,EAAEyI,GAAK0wG,EAIT,IAAK,IAAIxiH,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAEd,IAANyuB,IAEF8zF,EAAMviH,GAAK,IAITqJ,EAAErJ,KAAOwiH,EAEXD,EAAMviH,GAAGyuB,GAAKpc,EAAUiwG,EAAG5zG,EAAGvF,EAAEnJ,IAAMsiH,EAAGn5G,EAAEnJ,GAAI0O,GAG/C6zG,EAAMviH,GAAGyuB,GAAK/f,EAMpB,OAAO,IAAIo4F,EAAY,CACrBzgG,KAAMk8G,EACNv7F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QChGZ,GAAe,CAAC,SACTirG,IAAmC,QAFnC,cAEiD,IAAetwD,IACzE,IAAI,MACF+1B,GACE/1B,EAgBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,GAEhC,IA0BIrB,EA1BA0pG,EAAQpzG,EAAE4/F,MACVyT,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAER8U,EAAQ30G,EAAE2/F,MACV8T,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAER+U,EAAQ,GAEZ,GAAIxB,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,IAAK,IAAIkZ,EAAI,EAAGA,EAAI6oG,EAAM/hH,OAAQkZ,IAAK,CAErC,GAAI6oG,EAAM7oG,KAAOkpG,EAAMlpG,GACrB,MAAM,IAAIopG,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItGmB,EAAMrqG,GAAK6oG,EAAM7oG,GAMnB,IAAIqpG,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELO,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAIjC,IAAIoqG,EAAQe,EAAMvjH,OAAS,EAAIwjH,EAASjB,EAAI,EAAGgB,EAAOA,EAAM,GAAIzB,EAAOwB,GAAS,GAEhF,OAAO50G,EAAEghG,kBAAkB,CACzBppG,KAAMk8G,EACNv7F,KAAMs8F,EACN7Y,SAAUtyF,KAId,SAASorG,EAAS10G,EAAG20G,EAAOvqG,EAAGlU,EAAG0+G,EAAIC,GAEpC,IAAIC,EAAK,GAET,GAAIH,IAAUvqG,EAAElZ,OAAS,EAEvB,IAAK,IAAIC,EAAI,EAAGA,EAAI+E,EAAG/E,IAErB2jH,EAAG3jH,GAAK6O,EAAE40G,EAAGzjH,GAAI0jH,EAAG1jH,SAItB,IAAK,IAAIyuB,EAAI,EAAGA,EAAI1pB,EAAG0pB,IAErBk1F,EAAGl1F,GAAK80F,EAAS10G,EAAG20G,EAAQ,EAAGvqG,EAAGA,EAAEuqG,EAAQ,GAAIC,EAAGh1F,GAAIi1F,EAAGj1F,IAI9D,OAAOk1F,MCvFP,GAAe,CAAC,SACTC,IAAmC,QAFnC,cAEiD,IAAe9wD,IACzE,IAAI,MACF+1B,GACE/1B,EAiBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,EAAUnH,GAE1C,IAII8F,EAJA0pG,EAAQpzG,EAAE4/F,MACVyT,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAIR+T,EAAK9oG,EAEU,iBAARuoG,IAET5pG,EAAK4pG,EAELrzG,EAAIm6E,EAAMzb,QAAQ1+D,EAAGyJ,GAErBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAIjC,IAAIoqG,EAAQT,EAAM/hH,OAAS,EAAIwjH,EAASjB,EAAI,EAAGR,EAAOA,EAAM,GAAID,EAAOnzG,EAAG2D,GAAW,GAErF,OAAO5D,EAAEghG,kBAAkB,CACzBppG,KAAMk8G,EACNv7F,MAAM,SAAM86F,GACZrX,SAAUtyF,KAId,SAASorG,EAAS10G,EAAG20G,EAAOvqG,EAAGlU,EAAG0+G,EAAIC,EAAIrxG,GAExC,IAAIsxG,EAAK,GAET,GAAIH,IAAUvqG,EAAElZ,OAAS,EAEvB,IAAK,IAAIC,EAAI,EAAGA,EAAI+E,EAAG/E,IAErB2jH,EAAG3jH,GAAKqS,EAAUxD,EAAE60G,EAAID,EAAGzjH,IAAM6O,EAAE40G,EAAGzjH,GAAI0jH,QAI5C,IAAK,IAAIj1F,EAAI,EAAGA,EAAI1pB,EAAG0pB,IAErBk1F,EAAGl1F,GAAK80F,EAAS10G,EAAG20G,EAAQ,EAAGvqG,EAAGA,EAAEuqG,EAAQ,GAAIC,EAAGh1F,GAAIi1F,EAAIrxG,GAI/D,OAAOsxG,MC/DP,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,eACxDE,IAA2B,QAF3B,MAEyC,IAAe/wD,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,UACX7J,EAAS,YACTmK,GACEh0C,EACAgxD,EAAcpC,GAAkB,CAClC74B,UAEEk7B,EAActB,GAAkB,CAClC55B,QACA2d,gBAEEwd,EAAcb,GAAkB,CAClCt6B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA4BF,OAAOA,EArDE,MAqDU,CACjB,iBAAkBsqB,GAClB,uBAmEF,SAAuB1kG,EAAGC,GACxB,IAAKD,EAAE08C,UAAYz8C,EAAEy8C,QACnB,MAAM,IAAI1kB,MAAM,sDAMlB,IAFA,IAAIg4E,EAAO,IAAI9hB,EAAU,IAEjBjuF,EAAEi6C,UAAU,CAClB,IAAI72C,EAAIrD,EAAE49C,IAAI39C,GACdD,EAAIC,EACJA,EAAIoD,EAGN,OAAOrD,EAAE+8C,GAAGizD,GAAQhwG,EAAE45C,MAAQ55C,GAhF9B,qBAAsB,SAA0BtF,EAAGC,GACjD,OAAOD,EAAEmrD,IAAIlrD,IAEf,6BAA8B,SAAkCD,EAAGC,GACjE,OAAO26G,EAAY56G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO06G,EAAY16G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO06G,EAAY36G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mCAAoC,SAAqCD,EAAGC,GAC1E,OAAO46G,EAAY76G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,mCAAoC,SAAqC6D,EAAGC,GAC1E,OAAO46G,EAAY56G,EAAGD,EAAG7D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAE5D,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,4BAA6B,SAA8BtlD,EAAGC,GAE5D,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,WAG/C,mHAAoH,SAAwFhgD,EAAGC,EAAGizB,GAGhN,IAFA,IAAI5G,EAAMz1B,KAAKmJ,EAAGC,GAET1O,EAAI,EAAGA,EAAI2hC,EAAK5hC,OAAQC,IAC/B+6B,EAAMz1B,KAAKy1B,EAAK4G,EAAK3hC,IAGvB,OAAO+6B,QCnHT,GAAe,CAAC,QAAS,eAClBopF,IAAmC,QAFnC,cAEiD,IAAerxD,IACzE,IAAI,MACF+1B,EAAK,YACL2d,GACE1zC,EAqBJ,OAAO,SAAqB6uD,EAAaC,EAAcpoG,EAAUnH,GAE/D,IAAIwvG,EAAQF,EAAYtT,MACpByT,EAAQH,EAAYrT,MACpByT,EAAMJ,EAAYpT,UAElByT,EAAUJ,EAAazD,QACvB8D,EAASL,EAAaxD,OACtB8D,EAAON,EAAavD,KACpB8D,EAAQP,EAAatT,MACrB8T,EAAMR,EAAarT,UAEvB,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKH,EACH,MAAM,IAAIv7E,MAAM,sEAIlB,IAGItuB,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBh5D,EAAK09C,EAELiY,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELj5D,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAQjC,IAJA,IAAI0qG,EAAU,GACVhwF,EAAS,GACTiwF,EAAO,GAEFr0F,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhCq0F,EAAKr0F,GAAKoE,EAAO9yB,OAEjB,IAAK,IAAIy8C,EAAK0lE,EAAKzzF,GAAIouB,EAAKqlE,EAAKzzF,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5D,IAAIluC,EAAIiiH,EAAO/zE,GAEXk2E,EAAM/xG,EAAUiwG,EAAGN,EAAQ9zE,GAAI2zE,EAAM7hH,GAAGyuB,IAAM6zF,EAAGT,EAAM7hH,GAAGyuB,GAAIuzF,EAAQ9zE,IAErE4a,EAAGs7D,EAAK3F,KAEX5rF,EAAO/uB,KAAK9D,GACZ6iH,EAAQ/+G,KAAKsgH,KAQnB,OAFAtB,EAAK3S,GAAWt9E,EAAO9yB,OAEhB6hH,EAAapC,mBAAmB,CACrC39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QC1GZ,GAAe,CAAC,SACTksG,IAAmC,QAFnC,cAEiD,IAAevxD,IACzE,IAAI,MACF+1B,GACE/1B,EAqBJ,OAAO,SAAqB6uD,EAAaC,EAAcpoG,EAAUnH,GAE/D,IAAIwvG,EAAQF,EAAYtT,MACpByT,EAAQH,EAAYrT,MACpByT,EAAMJ,EAAYpT,UAElByT,EAAUJ,EAAazD,QACvB8D,EAASL,EAAaxD,OACtB8D,EAAON,EAAavD,KACpB8D,EAAQP,EAAatT,MACrB8T,EAAMR,EAAarT,UAEvB,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKH,EACH,MAAM,IAAIv7E,MAAM,sEAIlB,IAGItuB,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBrD,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELtD,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAMjC,IAFA,IAAIoqG,EAAQ,GAEHz5E,EAAI,EAAGA,EAAIioD,EAAMjoD,IAExBy5E,EAAMz5E,GAAK,GAQb,IAJA,IAAI3/B,EAAI,GAEJE,EAAI,GAEColB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAIhC,IAFA,IAAI+zF,EAAO/zF,EAAI,EAEN+tB,EAAK0lE,EAAKzzF,GAAIouB,EAAKqlE,EAAKzzF,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5D,IAAIluC,EAAIiiH,EAAO/zE,GAEf/kC,EAAEnJ,GAAKqS,EAAUiwG,EAAGN,EAAQ9zE,GAAI2zE,EAAM7hH,GAAGyuB,IAAM6zF,EAAGT,EAAM7hH,GAAGyuB,GAAIuzF,EAAQ9zE,IACvE7kC,EAAErJ,GAAKwiH,EAIT,IAAK,IAAIp5G,EAAI,EAAGA,EAAI2nF,EAAM3nF,IAEpBC,EAAED,KAAOo5G,EAEXD,EAAMn5G,GAAGqlB,GAAKtlB,EAAEC,GAGhBm5G,EAAMn5G,GAAGqlB,GAAKpc,EAAUiwG,EAAG7D,EAAMoD,EAAMz4G,GAAGqlB,IAAM6zF,EAAGT,EAAMz4G,GAAGqlB,GAAIgwF,GAMtE,OAAOkD,EAAYlS,kBAAkB,CACnCppG,KAAMk8G,EACNv7F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QChHZ,GAAe,CAAC,QAAS,eAClBmsG,IAAmC,QAFnC,cAEiD,IAAexxD,IACzE,IAAI,MACF+1B,EAAK,YACL2d,GACE1zC,EAoBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,GAEhC,IAAIkpG,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACTyD,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAERyT,EAAUtzG,EAAEyvG,QACZ8D,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KACT8D,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAEZ,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIhqG,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBh5D,EAAK09C,EAELiY,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELj5D,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAIjC,IAUInY,EAAGyuB,EAAGyf,EAAG2O,EAVTgmE,EAAUH,GAAWV,EAAU,QAAKv+G,EACpCovB,EAAS,GACTiwF,EAAO,GAEPC,EAAKF,EAAU,QAAKp/G,EACpBu/G,EAAKH,EAAU,QAAKp/G,EAEpBw/G,EAAK,GACLC,EAAK,GAIT,IAAKz0F,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAE5Bq0F,EAAKr0F,GAAKoE,EAAO9yB,OAEjB,IAAIyiH,EAAO/zF,EAAI,EAEf,IAAKyf,EAAI00E,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAI2O,EAAI3O,IAE1CluC,EAAI2iH,EAAOz0E,GAEXrb,EAAO/uB,KAAK9D,GAEZijH,EAAGjjH,GAAKwiH,EAEJO,IACFA,EAAG/iH,GAAK0iH,EAAQx0E,IAKpB,IAAKA,EAAIg0E,EAAKzzF,GAAIouB,EAAKqlE,EAAKzzF,EAAI,GAAIyf,EAAI2O,EAAI3O,IAItC+0E,EAFJjjH,EAAIiiH,EAAO/zE,MAEGs0E,GAEZ3vF,EAAO/uB,KAAK9D,GAIdkjH,EAAGljH,GAAKwiH,EAEJQ,IACFA,EAAGhjH,GAAKgiH,EAAQ9zE,IAKpB,GAAI20E,EAIF,IAFA30E,EAAI40E,EAAKr0F,GAEFyf,EAAIrb,EAAO9yB,QAAQ,CAIxB,IAAIwkH,EAAMtB,EAFVjjH,EAAI6yB,EAAOqb,IAGPs2E,EAAMtB,EAAGljH,GAEb,GAAIukH,IAAQ/B,GAAQgC,IAAQhC,EAAM,CAEhC,IAGIiC,EAAKnC,EAHAiC,IAAQ/B,EAAOO,EAAG/iH,GAAKy+G,EACvB+F,IAAQhC,EAAOQ,EAAGhjH,GAAKy+G,GAI3B31D,EAAG27D,EAAIhG,GAOV5rF,EAAO09C,OAAOriC,EAAG,IALjB20E,EAAQ/+G,KAAK2gH,GAEbv2E,OAaV,OAFA40E,EAAK3S,GAAWt9E,EAAO9yB,OAEhB0O,EAAE+wG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QCnKZ,GAAe,CAAC,QAAS,eAClBusG,IAAmC,QAFnC,cAEiD,IAAe5xD,IACzE,IAAI,MACF+1B,EAAK,YACL2d,GACE1zC,EAqBJ,OAAO,SAAqB75C,EAAGvK,EAAG8K,EAAUnH,GAE1C,IAAIqwG,EAAUzpG,EAAEklG,QACZwE,EAAS1pG,EAAEmlG,OACXwE,EAAO3pG,EAAEolG,KACTyD,EAAQ7oG,EAAEq1F,MACVyT,EAAM9oG,EAAEs1F,UAEZ,IAAKmU,EACH,MAAM,IAAIj8E,MAAM,sEAIlB,IAGItuB,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBh5D,EAAK09C,EAELiY,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,IAET5pG,EAAK4pG,EAELj5D,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBzJ,EAAIm6E,EAAMzb,QAAQ1+D,EAAGyJ,GAErBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAQjC,IAJA,IAAI0qG,EAAU,GACVhwF,EAAS,GACTiwF,EAAO,GAEFr0F,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhCq0F,EAAKr0F,GAAKoE,EAAO9yB,OAEjB,IAAK,IAAIy8C,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5D,IAAIluC,EAAI2iH,EAAOz0E,GAEXhnC,EAAImL,EAAUiwG,EAAG5zG,EAAGg0G,EAAQx0E,IAAMo0E,EAAGI,EAAQx0E,GAAIx/B,GAEhDo6C,EAAG5hD,EAAGu3G,KAET5rF,EAAO/uB,KAAK9D,GACZ6iH,EAAQ/+G,KAAKoD,KAQnB,OAFA47G,EAAK3S,GAAWt9E,EAAO9yB,OAEhBkZ,EAAEumG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QC9FZ,GAAe,CAAC,QAAS,eAClBwsG,IAAmC,QAFnC,cAEiD,IAAe7xD,IACzE,IAAI,MACF+1B,EAAK,YACLie,GACEh0C,EAqBJ,OAAO,SAAqB75C,EAAGvK,EAAG8K,EAAUnH,GAE1C,IAAIqwG,EAAUzpG,EAAEklG,QACZwE,EAAS1pG,EAAEmlG,OACXwE,EAAO3pG,EAAEolG,KACTyD,EAAQ7oG,EAAEq1F,MACVyT,EAAM9oG,EAAEs1F,UAEZ,IAAKmU,EACH,MAAM,IAAIj8E,MAAM,sEAIlB,IAGItuB,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBQ,EAAK9oG,EAEU,iBAARuoG,IAET5pG,EAAK4pG,EAELrzG,EAAIm6E,EAAMzb,QAAQ1+D,EAAGyJ,GAErBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAUjC,IANA,IAAIoqG,EAAQ,GAERp5G,EAAI,GAEJE,EAAI,GAEColB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAIhC,IAFA,IAAI+zF,EAAO/zF,EAAI,EAEN+tB,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5D,IAAIp8B,EAAI6wG,EAAOz0E,GAEf/kC,EAAE2I,GAAK4wG,EAAQx0E,GACf7kC,EAAEyI,GAAK0wG,EAIT,IAAK,IAAIxiH,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAEd,IAANyuB,IAEF8zF,EAAMviH,GAAK,IAITqJ,EAAErJ,KAAOwiH,EAEXD,EAAMviH,GAAGyuB,GAAKpc,EAAUiwG,EAAG5zG,EAAGvF,EAAEnJ,IAAMsiH,EAAGn5G,EAAEnJ,GAAI0O,GAG/C6zG,EAAMviH,GAAGyuB,GAAKpc,EAAUiwG,EAAG5zG,EAAG,GAAK4zG,EAAG,EAAG5zG,GAM/C,OAAO,IAAIo4F,EAAY,CACrBzgG,KAAMk8G,EACNv7F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QCzFZ,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3CysG,IAA2B,QAF3B,MAEyC,IAAe9xD,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,YACXM,GACEh0C,EACA+xD,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEEse,EAAcT,GAAkB,CAClCx7B,UAEEk8B,EAAcT,GAAkB,CAClCz7B,QACA2d,gBAEEwe,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEye,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAsCF,OAAOA,EAtEE,MAsEU,CACjB,iBAAkB2qB,GAClB,uBAAwB,SAA4BrqG,EAAGC,GACrD,GAAIA,EAAEmhD,QACJ,MAAM,IAAI9jB,MAAM,+CAGlB,OAAOr9B,EAAEu/C,SAAWx/C,EAAIA,EAAEkjD,IAAIjjD,IAEhC,qBAAsB,SAA0BD,EAAGC,GACjD,GAAIA,EAAEwlD,QAAQ,GAAK,EACjB,MAAM,IAAInoB,MAAM,+CAIlB,OAAOt9B,EAAEylD,QAAQ,IAAM,EAAIzlD,EAAEkjD,IAAIjjD,GAAKD,EAAEkjD,IAAIjjD,GAAGwW,IAAIxW,GAAGijD,IAAIjjD,IAE5D,6BAA8B,SAAkCD,EAAGC,GACjE,OAAO27G,EAAY57G,EAAGC,EAAG9D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCtI/C,GAAe,CAAC,QAAS,eAClBy2D,IAAmC,QAFnC,cAEiD,IAAepyD,IACzE,IAAI,MACF+1B,EAAK,YACL2d,GACE1zC,EAoBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,GAEhC,IAAIkpG,EAAUj0G,EAAE0vG,QACZ2D,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAERyT,EAAUtzG,EAAEyvG,QACZgE,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAEZ,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIhqG,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBh5D,EAAK09C,EAELiY,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELj5D,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAcjC,IAVA,IAAI0qG,EAAUH,GAAWV,EAAU,QAAKv+G,EACpCovB,EAAS,GACTiwF,EAAO,GAEP35G,EAAI05G,EAAU,QAAKp/G,EAEnB4F,EAAI,GAEJ+lB,EAAI,GAECX,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhCq0F,EAAKr0F,GAAKoE,EAAO9yB,OAEjB,IAAIyiH,EAAO/zF,EAAI,EAMf,IAJA,SAAQhgB,EAAGggB,EAAGplB,EAAGF,EAAGimB,EAAGozF,EAAM3vF,EAAQyvF,IAErC,SAAQ5zG,EAAG+f,EAAGplB,EAAGF,EAAGimB,EAAGozF,EAAM3vF,EAAQyvF,GAEjCn5G,EAIF,IAFA,IAAI+kC,EAAI40E,EAAKr0F,GAENyf,EAAIrb,EAAO9yB,QAAQ,CAExB,IAAIC,EAAI6yB,EAAOqb,GAEf,GAAI9e,EAAEpvB,KAAOwiH,EAAM,CAEjB,IAAIt7G,EAAIiC,EAAEnJ,GAEL8oD,EAAG5hD,EAAGu3G,GAOT5rF,EAAO09C,OAAOriC,EAAG,IALjB20E,EAAQ/+G,KAAKoD,GAEbgnC,UAOFrb,EAAO09C,OAAOriC,EAAG,QAOrB,IAFA,IAAIlrC,EAAI8/G,EAAKr0F,GAENzrB,EAAI6vB,EAAO9yB,QAIZqvB,EAFIyD,EAAO7vB,MAEFw/G,EAEX3vF,EAAO09C,OAAOvtE,EAAG,GAGjBA,IASR,OAFA8/G,EAAK3S,GAAWt9E,EAAO9yB,OAEhB0O,EAAE+wG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QCzIZ,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,cAAe,aAC3CgtG,IAA+B,QAAQ,GAAM,IAAeryD,IACrE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EACA7J,UAAW8X,GACT3hD,EACAgxD,EAAcpC,GAAkB,CAClC74B,UAEEg8B,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEE4e,EAAcF,GAAkB,CAClCr8B,QACA2d,gBAEEwe,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAgCEw8B,EAAa,0EACjB,OAAOx8B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAO,GAAcA,EAAG,IAE1B,iBAAkB,GAClBwzF,UAAW,SAAmBxzF,GAC5B,OAAOm8G,EAAYn8G,EAAG,IAAIsrG,EAAW,KAEvC5rE,QAAS,SAAiB1/B,GACxB,MAAM,IAAIs9B,MAAM4+E,IAElB,kBAAmB,SAAuBl8G,EAAGC,GAC3C,MAAM,IAAIq9B,MAAM4+E,IAElB,uBAAwBC,EACxB,iBAAkB,SAAqBn8G,GACrC,OAAO7D,KAAK6D,EAAG,IAEjB,6BAA8B,SAAkCA,EAAGC,GAEjE,GAAoB,IAAhBA,EAAEs2G,UAEJ,OAAO0F,EAAYj8G,EAAGC,EAAG9D,MAGzB,MAAM,IAAImhC,MAAM,0BAGpB,4BAA6B,SAAiCt9B,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAE/D,GAAoB,IAAhBA,EAAEs2G,UAEJ,OAAOoE,EAAY36G,EAAGC,EAAG9D,MAAM,GAG/B,MAAM,IAAImhC,MAAM,0BAGpB,2BAA4B,SAAgCt9B,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mCAAoC,SAAqCD,EAAGC,GAC1E,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,mCAAoC,SAAqC6D,EAAGC,GAE1E,GAAoB,IAAhBA,EAAEs2G,UAEJ,OAAOsF,EAAY57G,EAAGD,EAAG7D,MAAM,GAG/B,MAAM,IAAImhC,MAAM,0BAGpB,kCAAmC,SAAoCt9B,EAAGC,GACxE,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAE5D,OAAO9D,KAAKqL,EAAOxH,GAAIC,GAAGqlD,WAE5B,4BAA6B,SAA8BtlD,EAAGC,GAE5D,OAAO9D,KAAK6D,EAAGwH,EAAOvH,IAAIqlD,aAW9B,SAAS62D,EAAY72G,EAAGy5B,GACtB,IAAI2c,EAAY4vD,EAAW5vD,UAEvB0gE,EAAM9Q,EAAW1iD,MAAM,CACzBlN,UAAWA,EAAY,IAGrB45D,EAAO,IAAIhK,EAAW,GACtB9qD,EAAM,IAAI47D,EAAI,GACd7lC,EAAMx3C,EAAKkjB,aAMf,GAJIs0B,IACFx3C,EAAOA,EAAKmgB,OAGVngB,EAAKygB,SACP,MAAM,IAAIliB,MAAM,yBAGlB,GAAIh4B,EAAE28C,eAAiBljB,EAAKz3B,MAAM47C,IAAI,GAAGhD,OAAO,GAC9C,MAAM,IAAI5iB,MAAM,wCAIlB,GAAIh4B,EAAEk6C,SACJ,OAAO+2B,EAAM,IAAI6lC,EAAIx7E,KAAY,EAGnC,IAAKt7B,EAAEgX,WACL,OAAOi6D,EAAM++B,EAAOhwG,EAGtB,IAAItF,EAAIsF,EAAEgC,MAAMyH,IAAIyxC,EAAIT,IAAIhhB,IAI5B,OADA/+B,EAAIsF,EAAE87C,QAAUphD,EAAEk/C,MAAQl/C,EACnB,IAAIsrG,GAAY/0B,EAAM/1B,EAAIT,IAAI//C,GAAKA,GAAGilD,YAAYvJ,QCnMzD,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,SAAU,aACtC2gE,IAA4B,QAAQ,GAAM,IAAe1yD,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,UACNgsF,GACE7pC,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAsBp6E,EAAGC,GACzC,IAAIqsB,EAAM44E,GAAWllG,EAAGC,GACxB,MAAyB,UAAlB0iD,EAAOzgD,OAAqBoqB,EAAMpqB,EAAOoqB,IAElD,uBAWF,SAAwBtsB,EAAGC,GAEzB,IACA0B,EAEAk8C,EAEAx6C,EAyBIipB,EAxBA0jF,EAAO,IAAI9hB,EAAU,GACrBhzC,EAAM,IAAIgzC,EAAU,GACpBxzF,EAAIs1G,EACJ7K,EAAQjqD,EACRvgD,EAAIugD,EACJkqD,EAAQ4K,EAEZ,IAAKhwG,EAAE08C,UAAYz8C,EAAEy8C,QACnB,MAAM,IAAI1kB,MAAM,uDAGlB,MAAQ/3B,EAAEi6C,UACR2D,EAAI79C,EAAEy6C,IAAIx6C,GAAGqZ,QACbjW,EAAIrD,EAAE49C,IAAI39C,GACV0B,EAAIjH,EACJA,EAAIyqG,EAAMzqE,MAAMmjB,EAAEpE,MAAM/+C,IACxByqG,EAAQxjG,EACRA,EAAIhH,EACJA,EAAIyqG,EAAM1qE,MAAMmjB,EAAEpE,MAAM9+C,IACxByqG,EAAQzjG,EACR3B,EAAIC,EACJA,EAAIoD,EAWN,OALEipB,EADEtsB,EAAE+8C,GAAGizD,GACD,CAAChwG,EAAE45C,MAAOurD,EAAMvrD,MAAOwrD,EAAMxrD,OAE7B,CAAC55C,EAAIA,EAAEk6C,SAAmB,EAARirD,EAAWC,GAGZ,UAAlBziD,EAAOzgD,OAAqBoqB,EAAMpqB,EAAOoqB,SCnFhD,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAC5B0qF,IAA8B,QAAQ,GAAM,IAAe3yD,IACpE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,GACE1zC,EACA+xD,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEE4e,EAAcF,GAAkB,CAClCr8B,QACA2d,gBAEEwe,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAyBF,OAAOA,EAAM,GAAM,CACjB,iBAAkBstB,GAClB,uBAAwBvB,GACxB,6BAA8B,SAAkCzrG,EAAGC,GACjE,OAAOg8G,EAAYj8G,EAAGC,EAAG9D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAY17G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO47G,EAAY57G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCnG/C,GAAe,CAAC,QAAS,eAClBi3D,IAAmC,QAFnC,cAEiD,IAAe5yD,IACzE,IAAI,MACF+1B,EAAK,YACLie,GACEh0C,EAgBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,GAEhC,IAAIsoG,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAER4T,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAEZ,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIhqG,EAgBAnY,EAAGyuB,EAnBHsiE,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBrD,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELtD,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAMjC,IAAIoqG,EAAQ,GAEZ,IAAKviH,EAAI,EAAGA,EAAI+wF,EAAM/wF,IACpBuiH,EAAMviH,GAAK,GAIb,IAAI+iH,EAAK,GACLC,EAAK,GAELC,EAAK,GACLC,EAAK,GAET,IAAKz0F,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAE5B,IAAI+zF,EAAO/zF,EAAI,EAQf,IANAk3F,EAASl3G,EAAGggB,EAAGw0F,EAAIF,EAAIP,GAGvBmD,EAASj3G,EAAG+f,EAAGy0F,EAAIF,EAAIR,GAGlBxiH,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAAK,CAEzB,IAAI4lH,EAAK3C,EAAGjjH,KAAOwiH,EAAOO,EAAG/iH,GAAKy+G,EAC9BoH,EAAK3C,EAAGljH,KAAOwiH,EAAOQ,EAAGhjH,GAAKy+G,EAElC8D,EAAMviH,GAAGyuB,GAAK6zF,EAAGsD,EAAIC,IAKzB,OAAO,IAAI/e,EAAY,CACrBzgG,KAAMk8G,EACNv7F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,KAId,SAASwtG,EAASx2G,EAAGsf,EAAGplB,EAAGF,EAAGq5G,GAM5B,IAJA,IAAI3gF,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KAEHnwE,EAAIswE,EAAI/vF,GAAIouB,EAAK2hE,EAAI/vF,EAAI,GAAIyf,EAAI2O,EAAI3O,IAAK,CAEjD,IAAIluC,EAAIokC,EAAM8J,GAEd7kC,EAAErJ,GAAKwiH,EACPr5G,EAAEnJ,GAAK6hC,EAAOqM,QC1GhB,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAC5B43E,IAA8B,QAAQ,GAAM,IAAehzD,IACpE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACNm2F,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAyBF,OAAOA,EAAM,GAAM,CACjB,iBAAkBytB,GAClB,uBAAwB,GACxB,6BAA8B,SAAkCntG,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBC7F/C,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3Cu3D,IAA0B,QAF1B,KAEwC,IAAelzD,IAChE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,YACXM,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk8B,EAAcT,GAAkB,CAClCz7B,QACA2d,gBAEEye,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA+BF,OAAOA,EAvDE,KAuDU,CACjB,iBAAkBiuB,GAClB,mBAAoB,SAAwB3tG,EAAGC,GAC7C,OAAgB,IAATD,EAAEmgC,IAAqB,IAATngC,EAAEogC,IAAqB,IAATngC,EAAEkgC,IAAqB,IAATlgC,EAAEmgC,IAErD,uBAAwB,SAA4BpgC,EAAGC,GACrD,OAAQD,EAAEw/C,WAAax/C,EAAEiD,UAAYhD,EAAEu/C,WAAav/C,EAAEgD,SAExD,aAAc,SAAkBjD,EAAGC,GACjC,OAAO9D,KAAK6D,EAAE/G,OAAS,EAAGgH,EAAEhH,OAAS,IAEvC,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAO27G,EAAY57G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBC/G/C,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,cAAe,gBAC3Cw3D,IAA4B,QAAQ,GAAM,IAAenzD,IAClE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACNm2F,EAAW,aACXC,GACEj0C,EAuCJ,OAAO+1B,EAAM,GAAM,CAEjB3oF,MAAO,SAAeiJ,GACpB,OAAO+8G,EAAM/8G,EAAG,GAAG,SAAUA,GAAI,OAEnC,gBAAiB,SAAqBA,EAAG+kC,GACvC,OAAOg4E,EAAM/8G,EAAG+kC,GAAG,SAAU/kC,GAAI,OAEnC,mBAAoB,SAAwBA,EAAG+kC,GAC7C,OAAOg4E,EAAM/8G,EAAG+kC,EAAE6f,YAAY,SAAU5kD,GAAI,OAE9C,gBAAiB,SAAqBA,EAAGgxF,GACvC,OAAO+rB,EAAM/8G,EAAG,GAAG,SAAUA,GAAIgxF,IAEnC,wBAAyB,SAA2BhxF,EAAG+kC,EAAGisD,GACxD,OAAO+rB,EAAM/8G,EAAG+kC,GAAG,SAAU/kC,GAAIgxF,IAEnC,2BAA4B,SAA8BhxF,EAAG+kC,EAAGisD,GAC9D,OAAO+rB,EAAM/8G,EAAG+kC,EAAE6f,YAAY,SAAU5kD,GAAIgxF,IAE9C0M,OAAQ,SAAgB19F,GACtB,OAAO+8G,EAAM/8G,EAAG,EAAGA,EAAE6d,OAAQ7d,EAAEqhG,YAEjC,iBAAkB,SAAsBrhG,EAAG+kC,GACzC,OAAOg4E,EAAM/8G,EAAG+kC,EAAG/kC,EAAE6d,OAAQ7d,EAAEqhG,YAEjC,oBAAqB,SAAyBrhG,EAAG+kC,GAC/C,OAAOg4E,EAAM/8G,EAAG+kC,EAAE6f,WAAY5kD,EAAE6d,OAAQ7d,EAAEqhG,YAE5C,iBAAkB,SAAsBrhG,EAAGgxF,GACzC,OAAO+rB,EAAM/8G,EAAG,EAAGA,EAAE6d,OAAQmzE,IAE/B,yBAA0B,SAA4BhxF,EAAG+kC,EAAGisD,GAC1D,OAAO+rB,EAAM/8G,EAAG+kC,EAAG/kC,EAAE6d,OAAQmzE,IAE/B,4BAA6B,SAA+BhxF,EAAG+kC,EAAGisD,GAChE,OAAO+rB,EAAM/8G,EAAG+kC,EAAE6f,WAAY5kD,EAAE6d,OAAQmzE,MAa5C,SAAS+rB,EAAM/8G,EAAG+kC,EAAGlnB,EAAMmzE,GACzB,KAAK,OAAUjsD,GACb,MAAM,IAAIztC,UAAU,wDAGtB,IAAIwvG,EAAS/hE,EAAI,EAAIA,EAAI,EACrBgiE,EAAOhiE,EAAI,GAAKA,EAAI,EAExB,OAAQlnB,EAAKjnB,QACX,KAAK,EACH,OASN,SAA+BoJ,EAAG+kC,EAAGisD,EAAQhnD,EAAG+8D,EAAMD,GAEpD,IAAII,EAAK,CAACl9D,EAAI+8D,EAAM/8D,EAAI88D,GAExB,GAAI9V,GAAqB,WAAXA,GAAkC,UAAXA,EACnC,MAAM,IAAI15F,UAAU,uBAAuB+mC,OAAO2yD,EAAQ,MAI5D,IAAIhrF,EAAe,WAAXgrF,EAAsB4M,EAAaiJ,SAASK,EAAIlnG,EAAG+kC,GAAK44D,EAAYkJ,SAASK,EAAIlnG,EAAG+kC,GAE5F,OAAkB,OAAXisD,EAAkBhrF,EAAIA,EAAEs/C,UApBpB03D,CAAsBh9G,EAAG+kC,EAAGisD,EAAQnzE,EAAK,GAAIkpF,EAAMD,GAE5D,KAAK,EACH,OAoBN,SAAsB9mG,EAAG+kC,EAAGisD,EAAQlhF,EAAGi3F,EAAMD,GAE3C,IAAI,EAAA74B,EAAA,IAASjuE,GAAI,CAEf,IAAIi9G,EAAKj9G,EAAE6mG,SAAS9hE,GAEpB,OAAe,OAAXisD,EAEEA,IAAWisB,EAAG5b,UACT75F,EAAOy1G,EAAIjsB,GAGbisB,EAGFA,EAAG33D,UAQZ,IAJA,IAAI1pD,EAAIgG,KAAK+iB,IAAI7U,EAAE,GAAKi3F,EAAMj3F,EAAE,GAAKg3F,GAEjCoW,EAAS,GAEJrmH,EAAI,EAAGA,EAAI+E,EAAG/E,IACrBqmH,EAAOrmH,GAAKmJ,EAAEnJ,EAAIkwG,GAAMlwG,EAAIiwG,GAI9B,OAAkB,OAAX9V,EAAkBxpF,EAAO01G,GAAUA,EAhD/BC,CAAan9G,EAAG+kC,EAAGisD,EAAQnzE,EAAMkpF,EAAMD,GAGlD,MAAM,IAAIoS,WAAW,sDChHrB,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,SAAU,YAAa,cAAe,gBAClEkE,IAAgC,QAAQ,GAAM,IAAezzD,IACtE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,UACNgsF,EAAS,YACTmK,EAAW,aACXC,GACEj0C,EAgCJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,MAAyB,WAAlBz3B,EAAOzgD,OAAsBA,EAAO,IAAM,IAEnDo4D,OAAQ,SAAgBoxB,GACtB,OAAOxpF,EAAOwpF,IAEhB,qBAAsB,SAAyBpJ,GAC7C,OAAOy1B,EAAUz1B,EAAMA,EAAwB,WAAlB3/B,EAAOzgD,OAAsB,aAAUlN,IAEtE,6BAA8B,SAA+BstF,EAAMoJ,GACjE,OAAOqsB,EAAUz1B,EAAMA,EAAMoJ,IAE/B,yCAA0C,SAAwCpJ,EAAMC,GACtF,OAAOw1B,EAAUz1B,EAAMC,EAAwB,WAAlB5/B,EAAOzgD,OAAsB,aAAUlN,IAEtE,iDAAkD,SAA8CstF,EAAMC,EAAMmJ,GAC1G,OAAOqsB,EAAUz1B,EAAMC,EAAMmJ,IAE/Bj6F,MAAO,SAAe8mB,GACpB,OAAOy/F,EAAgBz/F,IAEzB,gBAAiB,SAAqBA,EAAMmzE,GAC1C,OAAOssB,EAAgBz/F,EAAMmzE,IAE/B0M,OAAQ,SAAgB7/E,GACtB,OAAOy/F,EAAgBz/F,EAAKynC,UAAWznC,EAAKwjF,YAE9C,iBAAkB,SAAsBxjF,EAAMmzE,GAC5C,OAAOssB,EAAgBz/F,EAAKynC,UAAW0rC,MAI3C,SAASssB,EAAgBz/F,EAAMmzE,GAC7B,OAAQnzE,EAAKjnB,QACX,KAAK,EACH,OAAOo6F,EAASxpF,EAAOwpF,GAAU,GAEnC,KAAK,EACH,OAAOqsB,EAAUx/F,EAAK,GAAIA,EAAK,GAAImzE,GAErC,KAAK,EACH,OAAOqsB,EAAUx/F,EAAK,GAAIA,EAAK,GAAImzE,GAErC,QACE,MAAM,IAAI1zD,MAAM,0CAatB,SAAS+/E,EAAUz1B,EAAMC,EAAMmJ,GAE7B,IAAIorB,GAAM,EAAAnuC,EAAA,IAAY2Z,KAAS,EAAA3Z,EAAA,IAAY4Z,GAAQ2L,EAAY,KAI/D,IAHI,EAAAvlB,EAAA,IAAY2Z,KAAOA,EAAOA,EAAKhjC,aAC/B,EAAAqpB,EAAA,IAAY4Z,KAAOA,EAAOA,EAAKjjC,cAE9B,OAAUgjC,IAASA,EAAO,EAC7B,MAAM,IAAItqD,MAAM,6DAGlB,KAAK,OAAUuqD,IAASA,EAAO,EAC7B,MAAM,IAAIvqD,MAAM,6DAGlB,IAAIkjB,EAAM47D,EAAM,IAAI5oB,EAAU,GAAK,EAC/BvpB,EAAemyC,EAAM,IAAIA,EAAI,GAAK,EAClCv+F,EAAO,CAAC+pE,EAAMC,GAElB,GAAImJ,EAAQ,CAEV,GAAe,WAAXA,EACF,OAAO4M,EAAaiJ,SAAShpF,EAAM2iC,EAAK,EAAGypB,GAG7C,GAAe,UAAX+mB,EACF,OAAO2M,EAAYkJ,SAAShpF,EAAM2iC,EAAK,EAAGypB,GAG5C,MAAM,IAAI3yE,UAAU,wBAAyB+mC,OAAO2yD,EAAQ,MAQ9D,IAJA,IAAIp/D,GAAM,SAAO,GAAI/T,EAAMosD,GAEvBszC,EAAU31B,EAAOC,EAAOD,EAAOC,EAE1BpiF,EAAI,EAAGA,EAAI83G,EAAS93G,IAC3BmsB,EAAInsB,GAAGA,GAAK+6C,EAGd,OAAO5uB,MC3IP,GAAe,CAAC,QAAS,SAAU,SAAU,aACtC4rF,IAA4B,QAF5B,OAE0C,IAAe7zD,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,UACNgsF,GACE7pC,EAmCJ,OAAO+1B,EAAM,OAAQ,CACnB,GAAI,WACF,MAAyB,UAAlBz3B,EAAOzgD,OAAqBi2G,EAAM,IAAMA,EAAM,GAAI,YAI3D,iCAAkC,SAA+B5/F,GAG/D,GAAoB,iBAFTA,EAAKA,EAAKjnB,OAAS,GAEA,CAC5B,IAAIo6F,EAASnzE,EAAK9M,MAClB,OAAO0sG,EAAM5/F,EAAMmzE,GACd,MAAsB,UAAlB/oC,EAAOzgD,OACTi2G,EAAM5/F,GAEN4/F,EAAM5/F,EAAM,YAGvB9mB,MAAO0mH,EACP/f,OAAQ,SAAgB7/E,GACtB,IAAImzE,EAASnzE,EAAKwjF,UAClB,OAAOoc,EAAM5/F,EAAKynC,UAAW0rC,IAE/B,yBAA0B,SAA2BnzE,EAAMmzE,GACzD,OAAOysB,EAAM5/F,EAAKynC,UAAW0rC,MAWjC,SAASysB,EAAM5/F,EAAMmzE,GACnB,IAEI/mB,EA0BN,SAAoBpsD,GAClB,IAAI6/F,GAAgB,EAOpB,OANA7/F,EAAK/f,SAAQ,SAAU7E,EAAOgiC,EAAOvkC,IAC/B,EAAAu3E,EAAA,IAAYh1E,KACdykH,GAAgB,EAChBhnH,EAAIukC,GAAShiC,EAAM2rD,eAGhB84D,EApCatS,CAAWvtF,GAEI,IAAI21E,EAAU,GAAK,EAItD,GAkCF,SAAmB31E,GACjBA,EAAK/f,SAAQ,SAAU7E,GACrB,GAAqB,iBAAVA,KAAuB,OAAUA,IAAUA,EAAQ,EAC5D,MAAM,IAAIqkC,MAAM,4DAvCpBqgF,CAAU9/F,GAENmzE,EAAQ,CAEV,IAAIhrF,EAAIwB,EAAOwpF,GAEf,OAAInzE,EAAKjnB,OAAS,EACToP,EAAEopF,OAAOvxE,EAAMosD,GAGjBjkE,EAGP,IAAItP,EAAM,GAEV,OAAImnB,EAAKjnB,OAAS,GACT,SAAOF,EAAKmnB,EAAMosD,GAGpBvzE,MCxGT,GAAO,UACP,GAAe,CAAC,QAAS,YAAa,UAC/BknH,IAA+B,QAAQ,GAAM,IAAej0D,IACrE,IAAI,MACF+1B,EAAK,UACL9uE,GACE+4C,EA0CJ,OAAO+1B,EAAM,GAAM,CACjB,gBAAiB,SAAqB1/E,EAAGy2G,GACvC,OAAOz2G,EAAEqvF,QAAQonB,IAEnB,eAAgB,SAAoBz2G,EAAGy2G,GAMrC,OALAA,EAAM34G,SAAQ,SAAU+f,GACtB,IAAKjN,EAAUiN,GACb,MAAM,IAAIvmB,UAAU,+BAAiCumB,OAGlD,SAAa7d,EAAGy2G,S,WCzDzB,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,WAC5BoH,IAA4B,QAAQ,GAAM,IAAel0D,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,GACEmiD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjBge,OAAQ,SAAgB19F,GACtB,OAAOA,EAAEvG,OAAOuG,EAAE6d,SAEpB9mB,MAAO,MACP6oE,OAAQ,SAAgB5/D,GACtB,MAAyB,UAAlBioD,EAAOzgD,OAAqB,CAACxH,EAAEpJ,QAAU4Q,EAAO,CAACxH,EAAEpJ,UAE5D,uDAAwD,SAA+CoJ,GAErG,MAAyB,UAAlBioD,EAAOzgD,OAAqB,GAAKA,EAASA,EAAO,KAAM,iBCzChE,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,SAAU,aACtCs2G,IAA6B,QAAQ,GAAM,IAAen0D,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,UACNgsF,GACE7pC,EAiCJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,MAAyB,UAAlBz3B,EAAOzgD,OAAqBu2G,EAAO,IAAMA,EAAO,GAAI,YAI7D,iCAAkC,SAA+BlgG,GAG/D,GAAoB,iBAFTA,EAAKA,EAAKjnB,OAAS,GAEA,CAC5B,IAAIo6F,EAASnzE,EAAK9M,MAClB,OAAOgtG,EAAOlgG,EAAMmzE,GACf,MAAsB,UAAlB/oC,EAAOzgD,OACTu2G,EAAOlgG,GAEPkgG,EAAOlgG,EAAM,YAGxB9mB,MAAOgnH,EACPrgB,OAAQ,SAAgB7/E,GACtB,IAAImzE,EAASnzE,EAAKwjF,UAClB,OAAO0c,EAAOlgG,EAAKynC,UAAW0rC,IAEhC,yBAA0B,SAA2BnzE,EAAMmzE,GACzD,OAAO+sB,EAAOlgG,EAAKynC,UAAW0rC,MAWlC,SAAS+sB,EAAOlgG,EAAMmzE,GACpB,IAEI/mB,EA0BN,SAAoBpsD,GAClB,IAAI6/F,GAAgB,EAOpB,OANA7/F,EAAK/f,SAAQ,SAAU7E,EAAOgiC,EAAOvkC,IAC/B,EAAAu3E,EAAA,IAAYh1E,KACdykH,GAAgB,EAChBhnH,EAAIukC,GAAShiC,EAAM2rD,eAGhB84D,EApCatS,CAAWvtF,GAEI,IAAI21E,EAAU,GAAK,EAItD,GAkCF,SAAmB31E,GACjBA,EAAK/f,SAAQ,SAAU7E,GACrB,GAAqB,iBAAVA,KAAuB,OAAUA,IAAUA,EAAQ,EAC5D,MAAM,IAAIqkC,MAAM,6DAvCpBqgF,CAAU9/F,GAENmzE,EAAQ,CAEV,IAAIhrF,EAAIwB,EAAOwpF,GAEf,OAAInzE,EAAKjnB,OAAS,EACToP,EAAEopF,OAAOvxE,EAAMosD,GAGjBjkE,EAGP,IAAItP,EAAM,GAEV,OAAImnB,EAAKjnB,OAAS,GACT,SAAOF,EAAKmnB,EAAMosD,GAGpBvzE,MC/EFsnH,IAAY,QAxBZ,MACQ,CAAC,QAAS,WAuBuBr0D,IAClD,IAAI,MACF+1B,EAAK,OACLsR,GACErnC,EACJ,OAAO+1B,EA7BE,MA6BU,CACjB,qBAAsB,SAAyB9jF,GAC7C,OAAOo1F,EAAOp1F,EAAG,CACfqzG,SAAU,SAGd,6BAA8B,SAA+BrzG,EAAGszG,GAC9D,OAAOle,EAAOp1F,EAAG,CACfqzG,SAAU,MACVC,SAAUA,UCvClB,SAAS+O,GAAQtlH,EAAQulH,GAAkB,IAAIx/G,EAAO5G,OAAO4G,KAAK/F,GAAS,GAAIb,OAAOwtE,sBAAuB,CAAE,IAAIz1D,EAAU/X,OAAOwtE,sBAAsB3sE,GAAaulH,IAAgBruG,EAAUA,EAAQvG,QAAO,SAAU60G,GAAO,OAAOrmH,OAAOkB,yBAAyBL,EAAQwlH,GAAKxmH,eAAgB+G,EAAK/D,KAAK4vD,MAAM7rD,EAAMmR,GAAY,OAAOnR,EAE9U,SAAS0/G,GAAc5mH,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAyB,MAAhB5U,UAAUtlC,GAAaslC,UAAUtlC,GAAK,GAAQA,EAAI,EAAKonH,GAAQnmH,OAAOi5C,IAAS,GAAMjzC,SAAQ,SAAU9F,GAAOqmH,GAAgB7mH,EAAQQ,EAAK+4C,EAAO/4C,OAAsBF,OAAOwmH,0BAA6BxmH,OAAOqD,iBAAiB3D,EAAQM,OAAOwmH,0BAA0BvtE,IAAmBktE,GAAQnmH,OAAOi5C,IAASjzC,SAAQ,SAAU9F,GAAOF,OAAOC,eAAeP,EAAQQ,EAAKF,OAAOkB,yBAAyB+3C,EAAQ/4C,OAAe,OAAOR,EAE7gB,SAAS6mH,GAAgB5iH,EAAKzD,EAAKiB,GAAiK,OAApJjB,KAAOyD,EAAO3D,OAAOC,eAAe0D,EAAKzD,EAAK,CAAEiB,MAAOA,EAAOtB,YAAY,EAAMC,cAAc,EAAMC,UAAU,IAAkB4D,EAAIzD,GAAOiB,EAAgBwC,EAS3M,IAAI8iH,GAAS,0DACT,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,YAAa,eACjEC,IAA6B,QAAQ,GAAM,IAAe70D,IACnE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,MACX7N,EAAK,UACLgE,EAAS,YACTmK,GACEh0C,EACAkyD,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEye,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEod,EAAcN,GAAkB,CAClC/6B,UAsCF,OAAOA,EAAM,GAAM0+B,GAAcA,GAAc,GAAIK,IAAwB,GAAI,CAC7E/+E,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE6B,SAEX,kBAAmB,SAAuB7B,EAAGpE,GAC3C,GAAIA,EAAI,EACN,MAAM,IAAItE,UAAUinH,IAGtB,OAAOv+G,EAAE6B,MAAMjG,IAEjB,qBAAsB,SAA0BoE,EAAGpE,GACjD,IAAKA,EAAEgV,YACL,MAAM,IAAItZ,UAAUinH,IAGtB,IAAIpkH,EAAKyB,EAAEgpD,WAEX,OAAO5kD,EAAE6B,MAAM1H,IAEjB,oBAAqB,SAAyB6F,EAAGpE,GAC/C,IAAKA,EAAEgV,YACL,MAAM,IAAItZ,UAAUinH,IAGtB,OAAO,IAAI/qB,EAAUxzF,GAAGikD,gBAAgBroD,EAAEgpD,aAE5C4uC,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEikD,gBAAgB,IAE3B,uBAAwB,SAA4BjkD,EAAGpE,GACrD,IAAKA,EAAEgV,YACL,MAAM,IAAItZ,UAAUinH,IAGtB,OAAOv+G,EAAEikD,gBAAgBroD,EAAEgpD,aAE7B8F,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE6B,SAEX,mBAAoB,SAAwB7B,EAAGpE,GAC7C,GAAIA,EAAI,EACN,MAAM,IAAItE,UAAUinH,IAGtB,OAAOv+G,EAAE6B,MAAMjG,IAEjB,iBAAkB,SAAqBoE,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1B,mCAAoC,SAAqC6D,EAAGC,GAC1E,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,6CAA8C,SAA4C6D,EAAGC,GAE3F,OAAIo9F,EAAYr9F,EAAG,GAEVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpBya,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,4CAA6C,SAA2C6D,EAAGC,GAEzF,OAAIo9F,EAAYr9F,EAAG,GAEVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpB0Z,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAE5D,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,sCAAuC,SAAqCtlD,EAAGC,GAE7E,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,iBAI/Cm5D,GAAwB,CAC1B91C,OAAQiiC,GACR,iBAAkB,SAAsB5qG,EAAGpE,GACzC,KAAK,OAAUA,GACb,MAAM,IAAItE,UAAUinH,IAGtB,GAAI3iH,EAAI,GAAKA,EAAI,GACf,MAAM,IAAI0hC,MAAM,oEAGlB,OAAOstE,GAAY5qG,EAAGpE,KCrKtB,GAAe,CAAC,QAAS,eAClB8iH,IAAmC,QAFnC,cAEiD,IAAe/0D,IACzE,IAAI,MACF+1B,EAAK,YACL2d,GACE1zC,EAoBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,GAEhC,IAAIkpG,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACTyD,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAERyT,EAAUtzG,EAAEyvG,QACZ8D,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KACT8D,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAEZ,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAAKO,IAAYV,EACf,MAAM,IAAIv7E,MAAM,uDAIlB,IAGItuB,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBh5D,EAAK09C,EAELiY,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELj5D,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAcjC,IAVA,IAQI+1B,EAAGsO,EAAIK,EAAI78C,EARX6iH,EAAU,GACVhwF,EAAS,GACTiwF,EAAO,GAEP35G,EAAI,GAEJE,EAAI,GAIColB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhCq0F,EAAKr0F,GAAKoE,EAAO9yB,OAEjB,IAAIyiH,EAAO/zF,EAAI,EAEf,IAAK+tB,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAInD7kC,EAFArJ,EAAI2iH,EAAOz0E,IAEJs0E,EAEPr5G,EAAEnJ,GAAK0iH,EAAQx0E,GAEfrb,EAAO/uB,KAAK9D,GAId,IAAKw8C,EAAK0lE,EAAKzzF,GAAIouB,EAAKqlE,EAAKzzF,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAI/C7kC,EAFJrJ,EAAIiiH,EAAO/zE,MAEEs0E,IAEXr5G,EAAEnJ,GAAKsiH,EAAGn5G,EAAEnJ,GAAIgiH,EAAQ9zE,KAO5B,IAFAA,EAAI40E,EAAKr0F,GAEFyf,EAAIrb,EAAO9yB,QAAQ,CAIxB,IAAImH,EAAIiC,EAFRnJ,EAAI6yB,EAAOqb,IAIN4a,EAAG5hD,EAAGu3G,GAOT5rF,EAAO09C,OAAOriC,EAAG,IALjB20E,EAAQ/+G,KAAKoD,GAEbgnC,MAWN,OAFA40E,EAAK3S,GAAWt9E,EAAO9yB,OAEhB0O,EAAE+wG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QCzIZ,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,eACpD2vG,IAAiC,QAAQ,GAAM,IAAeh1D,IACvE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,MACX7N,EAAK,YACLmO,GACEh0C,EACAgxD,EAAcpC,GAAkB,CAClC74B,UAEEg8B,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEEuhB,EAAcF,GAAkB,CAClCh/B,QACA2d,gBAEEwd,EAAcb,GAAkB,CAClCt6B,QACAie,gBAEEke,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkB0tB,GAClB,uBAAwBN,GACxB,6BAA8B,SAAkC9sG,EAAGC,GACjE,OAAO2+G,EAAY5+G,EAAGC,EAAG9D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO06G,EAAY36G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mCAAoC,SAAqCD,EAAGC,GAE1E,OAAIo9F,EAAYp9F,EAAG,GACVD,EAAE4oD,QAGJizD,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GAExE,OAAIo9F,EAAYp9F,EAAG,GACVD,EAAE4oD,QAGJmyD,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,mCAAoC,SAAqC6D,EAAGC,GAE1E,OAAIo9F,EAAYr9F,EAAG,GACVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpBwZ,EAAY56G,EAAGD,EAAG7D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GAExE,OAAIo9F,EAAYr9F,EAAG,GACVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpB0Z,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAE5D,OAAO9D,KAAKqL,EAAOxH,GAAIC,GAAGqlD,WAE5B,4BAA6B,SAA8BtlD,EAAGC,GAE5D,OAAO9D,KAAK6D,EAAGwH,EAAOvH,IAAIqlD,gBC7H5B,GAAO,gBACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,eACpDu5D,IAAqC,QAAQ,GAAM,IAAel1D,IAC3E,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,MACX7N,EAAK,YACLmO,GACEh0C,EACAgxD,EAAcpC,GAAkB,CAClC74B,UAEEg8B,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEEuhB,EAAcF,GAAkB,CAClCh/B,QACA2d,gBAEEwd,EAAcb,GAAkB,CAClCt6B,QACAie,gBAEEke,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkB4tB,GAElB,6BAA8B,SAAkCttG,EAAGC,GACjE,OAAO2+G,EAAY5+G,EAAGC,EAAG9D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO06G,EAAY36G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mCAAoC,SAAqCD,EAAGC,GAE1E,OAAIo9F,EAAYp9F,EAAG,GACVD,EAAE4oD,QAGJizD,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GAExE,OAAIo9F,EAAYp9F,EAAG,GACVD,EAAE4oD,QAGJmyD,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,mCAAoC,SAAqC6D,EAAGC,GAE1E,OAAIo9F,EAAYr9F,EAAG,GACVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpBwZ,EAAY56G,EAAGD,EAAG7D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GAExE,OAAIo9F,EAAYr9F,EAAG,GACVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpB0Z,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAE5D,OAAO9D,KAAKqL,EAAOxH,GAAIC,GAAGqlD,WAE5B,4BAA6B,SAA8BtlD,EAAGC,GAE5D,OAAO9D,KAAK6D,EAAGwH,EAAOvH,IAAIqlD,gBC7H5B,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,SAAU,cAAe,YAAa,WAAY,eAC9Ew5D,IAA+B,QAAQ,GAAM,IAAen1D,IACrE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,YACNo1C,EAAW,OACX71F,EAAM,UACNgsF,EAAS,SACT9oC,EAAQ,YACRizC,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk8B,EAAcT,GAAkB,CAClCz7B,QACA2d,gBAEEye,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAwCF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwB1/E,EAAGC,GAC7C,OAAOD,IAAMC,EAAI,EAAID,EAAIC,EAAI,GAAK,GAEpC,iBAAkB,SAAsBD,EAAGC,GACzC,OAAO,QAAYD,EAAGC,EAAGgoD,EAAO4kB,SAAW,EAAI7sE,EAAIC,EAAI,GAAK,GAE9D,uBAAwB,SAA4BD,EAAGC,GACrD,OAAO,GAAeD,EAAGC,EAAGgoD,EAAO4kB,SAAW,IAAI2mB,EAAU,GAAK,IAAIA,EAAUxzF,EAAEm+C,IAAIl+C,KAEvF,qBAAsB,SAA0BD,EAAGC,GACjD,OAAO,IAAIyqD,EAAS1qD,EAAEylD,QAAQxlD,KAEhC,mBAAoB,WAClB,MAAM,IAAI3I,UAAU,wDAEtB,aAAc,SAAkB0I,EAAGC,GACjC,IAAKD,EAAEuoG,UAAUtoG,GACf,MAAM,IAAIq9B,MAAM,4CAGlB,OAAOnhC,KAAK6D,EAAE/G,MAAOgH,EAAEhH,QAEzB,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAO27G,EAAY57G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCxI/C,GAAO,cACP,GAAe,CAAC,QAAS,UAClBy5D,IAAmC,QAAQ,GAAM,IAAep1D,IACzE,IAAI,MACF+1B,EAAK,OACLl4E,GACEmiD,EACAmxD,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA+BF,OAAOA,EAAM,GAAM,CACjB,WAAY,MACZ,2BAA4B,SAAgC1/E,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG,QAE3B,eAAgB,SAAoBD,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mBAAoB,SAAwBD,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG,OAAc,IAEzC,mBAAoB,SAAwBD,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG,OAAc,IAEzC,aAAc,SAAkBA,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG,OAAc,GAAOqlD,WAExD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG,OAAc,GAAMslD,gBCnEvD,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtC05D,IAA+B,QAAQ,GAAM,IAAer1D,IACrE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,YACNm2F,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAkCF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwB1/E,EAAGC,GAC7C,OAAOD,EAAIC,GAEb,iBAAkB,SAAsBD,EAAGC,GACzC,OAAOD,EAAIC,KAAM,QAAYD,EAAGC,EAAGgoD,EAAO4kB,UAE5C,uBAAwB,SAA4B7sE,EAAGC,GACrD,OAAOD,EAAEqiD,GAAGpiD,KAAO,GAAeD,EAAGC,EAAGgoD,EAAO4kB,UAEjD,qBAAsB,SAA0B7sE,EAAGC,GACjD,OAAyB,IAAlBD,EAAEylD,QAAQxlD,IAEnB,mBAAoB,SAAwBD,EAAGC,GAC7C,MAAM,IAAI3I,UAAU,wDAEtB,aAAc,SAAkB0I,EAAGC,GACjC,IAAKD,EAAEuoG,UAAUtoG,GACf,MAAM,IAAIq9B,MAAM,4CAGlB,OAAOnhC,KAAK6D,EAAE/G,MAAOgH,EAAEhH,QAEzB,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBC3H/C,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtC25D,IAA8B,QAAQ,GAAM,IAAet1D,IACpE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,YACNm2F,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAkCF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwB1/E,EAAGC,GAC7C,OAAOD,EAAIC,GAEb,iBAAkB,SAAsBD,EAAGC,GACzC,OAAOD,EAAIC,KAAM,QAAYD,EAAGC,EAAGgoD,EAAO4kB,UAE5C,uBAAwB,SAA4B7sE,EAAGC,GACrD,OAAOD,EAAEogD,GAAGngD,KAAO,GAAeD,EAAGC,EAAGgoD,EAAO4kB,UAEjD,qBAAsB,SAA0B7sE,EAAGC,GACjD,OAAwB,IAAjBD,EAAEylD,QAAQxlD,IAEnB,mBAAoB,WAClB,MAAM,IAAI3I,UAAU,wDAEtB,aAAc,SAAkB0I,EAAGC,GACjC,IAAKD,EAAEuoG,UAAUtoG,GACf,MAAM,IAAIq9B,MAAM,4CAGlB,OAAOnhC,KAAK6D,EAAE/G,MAAOgH,EAAEhH,QAEzB,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBC7H/C,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,cAAe,SAAU,eACrD45D,IAA+B,QAAQ,GAAM,IAAev1D,IACrE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,YACNo1C,EAAW,OACX71F,EAAM,YACNm2F,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA8CF,OAAOA,EAAM,UAAW,CACtB,WAAY,SAAgB1/E,EAAGC,GAE7B,OAAU,OAAND,EACW,OAANC,EAGC,OAANA,EACW,OAAND,OAGC1F,IAAN0F,OACW1F,IAAN2F,OAGC3F,IAAN2F,OACW3F,IAAN0F,EAGFm/G,EAASn/G,EAAGC,IAErB,6BAA8B,SAAkCD,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAGk/G,IAE3B,4BAA6B,SAAiCn/G,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAGm/G,GAAU,IAErC,4BAA6B,SAAiCn/G,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAGk/G,GAAU,IAErC,2BAA4B,SAAgCn/G,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAGk/G,IAE3B,eAAgB,SAAoBn/G,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAGk/G,GAAU,IAErC,mBAAoB,SAAwBn/G,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAGk/G,GAAU,IAErC,oBAAqB,SAAyBn/G,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAGm/G,GAAU,IAErC,mBAAoB,SAAwBn/G,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAGm/G,GAAU,IAErC,aAAc,SAAkBn/G,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAGk/G,GAAU,GAAO75D,WAEpD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAGm/G,GAAU,GAAM75D,aAIrD,SAAS65D,EAASn/G,EAAGC,GACnB,OAAQo9F,EAAYr9F,EAAGC,OC7IvB,KDgJ6B,QAAQ,GAAM,CAAC,QAAS,gBAAiBs/F,IACxE,IAAI,MACF7f,EAAK,YACL2d,GACEkC,EACJ,OAAO7f,EAAM,GAAM,CACjB,WAAY,SAAgB1/E,EAAGC,GAE7B,OAAU,OAAND,EACW,OAANC,EAGC,OAANA,EACW,OAAND,OAGC1F,IAAN0F,OACW1F,IAAN2F,OAGC3F,IAAN2F,OACW3F,IAAN0F,GAGDq9F,EAAYr9F,EAAGC,SCxKV,CAAC,UAAW,gBACpBm/G,IAAiD,QAFjD,uBAE+D,IAAez1D,IACvF,IAAI,QACFgrB,EAAO,YACPgpB,GACEh0C,EAEJ,SAASk0C,EAAqB3gG,EAAMokG,GAClC,KAAMnlG,gBAAgB0hG,GACpB,MAAM,IAAIz+D,YAAY,oDAGxB,GAAIkiE,KAAa,EAAArzB,EAAA,IAASqzB,GACxB,MAAM,IAAIhkE,MAAM,qBAAuBgkE,GAGzC,IAAI,EAAArzB,EAAA,IAAS/wE,KAAS,EAAA+wE,EAAA,IAAQ/wE,GAAO,CAEnC,IAAIsK,EAAS,IAAIm2F,EAAYzgG,EAAMokG,GAEnCnlG,KAAK+oG,MAAQ19F,EAAO09F,MACpB/oG,KAAKgpG,MAAQ39F,EAAO29F,MACpBhpG,KAAKipG,UAAY59F,EAAO49F,UACxBjpG,KAAKkjH,KAAO,KACZljH,KAAKmjH,KAAO,UACP,GAAIpiH,IAAQ,EAAA+wE,EAAA,IAAQ/wE,EAAKA,QAAS,EAAA+wE,EAAA,IAAQ/wE,EAAK2gB,MAEpD1hB,KAAK+oG,MAAQhoG,EAAKA,KAClBf,KAAKgpG,MAAQjoG,EAAK2gB,KAClB1hB,KAAKipG,UAAYloG,EAAKokG,SACtBnlG,KAAKkjH,UAA2B,IAAbniH,EAAKynB,IAAsBznB,EAAKynB,IAAM,KACzDxoB,KAAKmjH,UAA2B,IAAbpiH,EAAK2nB,IAAsB3nB,EAAK2nB,IAAM,SACpD,IAAI3nB,EAET,MAAM,IAAI5F,UAAU,8BAA+B,QAAO4F,GAAQ,KAGlEf,KAAK+oG,MAAQ,GACb/oG,KAAKgpG,MAAQ,CAAC,GACdhpG,KAAKipG,UAAY9D,EACjBnlG,KAAKkjH,KAAO,KACZljH,KAAKmjH,KAAO,MA+LhB,OA3LAzhB,EAAqBzlG,UAAY,IAAIulG,EAKrCE,EAAqBzlG,UAAUmE,KAAO,uBACtCshG,EAAqBzlG,UAAUmnH,wBAAyB,EAexD1hB,EAAqBzlG,UAAUo0B,OAAS,SAAUyO,GAChD,OAAQkB,UAAUvlC,QAChB,KAAK,EAGD,IAAIoP,EAAI23F,EAAYvlG,UAAUo0B,OAAO3zB,KAAKsD,KAAM8+B,GAEhD,OAAI,EAAAgzC,EAAA,IAASjoE,GAEJ,IAAI63F,EAAqB,CAC9B3gG,KAAM8I,EAAEk/F,MACRrnF,KAAM7X,EAAEm/F,MACR7D,SAAUt7F,EAAEo/F,YAITp/F,EAIX,KAAK,EACL,KAAK,EACH,MAAM,IAAIs3B,MAAM,4DAElB,QACE,MAAM,IAAI8B,YAAY,+BAc5By+D,EAAqBzlG,UAAU4uB,IAAM,WACnC,MAAM,IAAIsW,MAAM,sDAgBlBugE,EAAqBzlG,UAAUg3F,OAAS,WACtC,MAAM,IAAI9xD,MAAM,yDASlBugE,EAAqBzlG,UAAUi3F,QAAU,WACvC,MAAM,IAAI/xD,MAAM,0DAQlBugE,EAAqBzlG,UAAUwwD,MAAQ,WACrC,OAAO,IAAIi1C,EAAqB,CAC9B3gG,MAAM,SAAMf,KAAK+oG,OACjBrnF,MAAM,SAAM1hB,KAAKgpG,OACjB7D,SAAUnlG,KAAKipG,aASnBvH,EAAqBzlG,UAAUmtD,OAAS,WACtC,MAAO,CACLkqB,OAAQ,uBACRvyE,KAAMf,KAAK+oG,MACXrnF,KAAM1hB,KAAKgpG,MACX7D,SAAUnlG,KAAKipG,YAYnBvH,EAAqBnuB,SAAW,SAAUzjB,GACxC,OAAO,IAAI4xC,EAAqB5xC,IAYlC4xC,EAAqBzlG,UAAU+uG,SAAW,WACxC,MAAM,IAAI7pE,MAAM,2DAQlBugE,EAAqBzlG,UAAUusB,IAAM,WAEnC,GAAkB,OAAdxoB,KAAKkjH,KAAe,CAEtB,IAAIr5G,EAAI,KAER7J,KAAK2B,SAAQ,SAAUC,IACX,OAANiI,GAAc2uE,EAAQ52E,EAAGiI,MAC3BA,EAAIjI,MAGR5B,KAAKkjH,KAAa,OAANr5G,EAAaA,OAAI1L,EAG/B,OAAO6B,KAAKkjH,MAQdxhB,EAAqBzlG,UAAUysB,IAAM,WAEnC,GAAkB,OAAd1oB,KAAKmjH,KAAe,CAEtB,IAAIt5G,EAAI,KAER7J,KAAK2B,SAAQ,SAAUC,IACX,OAANiI,GAAc2uE,EAAQ3uE,EAAGjI,MAC3BiI,EAAIjI,MAGR5B,KAAKmjH,KAAa,OAANt5G,EAAaA,OAAI1L,EAG/B,OAAO6B,KAAKmjH,MAGPzhB,IACN,CACD9uB,SAAS,IC5OP,GAAe,CAAC,UAAW,UACpBywC,IAA0C,QAF1C,gBAEwD,IAAe71D,IAChF,IAAI,QACFgrB,EAAO,OACPC,GACEjrB,EACA81D,EAAgB,EAAM79G,KAAK49B,KAAK,EAAM59B,KAAKsE,KAAK,IAAQ,GAO5D,SAAS43F,IACP,KAAM3hG,gBAAgB2hG,GACpB,MAAM,IAAI1+D,YAAY,oDAIxBjjC,KAAKujH,SAAW,KAChBvjH,KAAKgpG,MAAQ,EA8Lf,SAASwa,EAAKpC,EAASt/G,EAAMmT,GAE3BnT,EAAKyQ,KAAKoI,MAAQ7Y,EAAK6Y,MACvB7Y,EAAK6Y,MAAMpI,KAAOzQ,EAAKyQ,KACvB0C,EAAOwuG,SAEHxuG,EAAOq7B,QAAUxuC,IACnBmT,EAAOq7B,MAAQxuC,EAAK6Y,OAIA,IAAlB1F,EAAOwuG,SACTxuG,EAAOq7B,MAAQ,MAIjBxuC,EAAKyQ,KAAO6uG,EACZt/G,EAAK6Y,MAAQymG,EAAQzmG,MACrBymG,EAAQzmG,MAAQ7Y,EAChBA,EAAK6Y,MAAMpI,KAAOzQ,EAElBA,EAAKmT,OAAS,KAEdnT,EAAKo7G,MAAO,EAUd,SAASwG,EAActC,EAASt/G,GAE9B,IAAImT,EAASnT,EAAKmT,OAEbA,IAKAnT,EAAKo7G,MAIRsG,EAAKpC,EAASt/G,EAAMmT,GAGpByuG,EAAczuG,IANdnT,EAAKo7G,MAAO,GAlOhBvb,EAAc1lG,UAAUmE,KAAO,gBAC/BuhG,EAAc1lG,UAAU0nH,iBAAkB,EAQ1ChiB,EAAc1lG,UAAU2nH,OAAS,SAAU/nH,EAAKiB,GAE9C,IAAIgF,EAAO,CACTjG,IAAKA,EACLiB,MAAOA,EACP2mH,OAAQ,GAGV,GAAIzjH,KAAKujH,SAAU,CAEjB,IAAInC,EAAUphH,KAAKujH,SAEnBzhH,EAAKyQ,KAAO6uG,EACZt/G,EAAK6Y,MAAQymG,EAAQzmG,MACrBymG,EAAQzmG,MAAQ7Y,EAChBA,EAAK6Y,MAAMpI,KAAOzQ,EAEd02E,EAAQ38E,EAAKulH,EAAQvlH,OAEvBmE,KAAKujH,SAAWzhH,QAIlBA,EAAKyQ,KAAOzQ,EACZA,EAAK6Y,MAAQ7Y,EAEb9B,KAAKujH,SAAWzhH,EAMlB,OAFA9B,KAAKgpG,QAEElnG,GAQT6/F,EAAc1lG,UAAUylB,KAAO,WAC7B,OAAO1hB,KAAKgpG,OAQdrH,EAAc1lG,UAAUw7D,MAAQ,WAC9Bz3D,KAAKujH,SAAW,KAChBvjH,KAAKgpG,MAAQ,GAQfrH,EAAc1lG,UAAU44D,QAAU,WAChC,OAAsB,IAAf70D,KAAKgpG,OASdrH,EAAc1lG,UAAU4nH,eAAiB,WAEvC,IAAI/hH,EAAO9B,KAAKujH,SAEhB,GAAa,OAATzhH,EACF,OAAOA,EAUT,IANA,IAAIs/G,EAAUphH,KAAKujH,SAEfO,EAAmBhiH,EAAK2hH,OAExB5/G,EAAI/B,EAAKwuC,MAENwzE,EAAmB,GAAG,CAE3B,IAAIC,EAAYlgH,EAAE8W,MAElB9W,EAAE0O,KAAKoI,MAAQ9W,EAAE8W,MACjB9W,EAAE8W,MAAMpI,KAAO1O,EAAE0O,KAEjB1O,EAAE0O,KAAO6uG,EACTv9G,EAAE8W,MAAQymG,EAAQzmG,MAClBymG,EAAQzmG,MAAQ9W,EAChBA,EAAE8W,MAAMpI,KAAO1O,EAEfA,EAAEoR,OAAS,KACXpR,EAAIkgH,EACJD,IAsBF,OAlBAhiH,EAAKyQ,KAAKoI,MAAQ7Y,EAAK6Y,MACvB7Y,EAAK6Y,MAAMpI,KAAOzQ,EAAKyQ,KAIrB6uG,EAFEt/G,IAASA,EAAK6Y,MAEN,KAqJd,SAA0BymG,EAAS1/F,GAEjC,IAkBI5d,EAlBAkgH,EAAYv+G,KAAKgd,MAAMhd,KAAK49B,IAAI3hB,GAAQ4hG,GAAiB,EAEzDlqD,EAAQ,IAAIx+D,MAAMopH,GAElBC,EAAW,EACXpgH,EAAIu9G,EAER,GAAIv9G,EAIF,IAHAogH,IACApgH,EAAIA,EAAE8W,MAEC9W,IAAMu9G,GACX6C,IACApgH,EAAIA,EAAE8W,MAOV,KAAOspG,EAAW,GAAG,CAMnB,IAJA,IAAI36G,EAAIzF,EAAE4/G,OAENnlH,EAAOuF,EAAE8W,MAIX7W,EAAIs1D,EAAM9vD,IAFC,CASX,GAAImvE,EAAO50E,EAAEhI,IAAKiI,EAAEjI,KAAM,CACxB,IAAImpC,EAAOlhC,EACXA,EAAID,EACJA,EAAImhC,EAINk/E,EAAWpgH,EAAGD,GAGdu1D,EAAM9vD,GAAK,KACXA,IAIF8vD,EAAM9vD,GAAKzF,EAEXA,EAAIvF,EACJ2lH,IAIF7C,EAAU,KAEV,IAAK,IAAI1mH,EAAI,EAAGA,EAAIspH,EAAWtpH,KAE7BoJ,EAAIs1D,EAAM1+D,MAON0mH,GAEFt9G,EAAEyO,KAAKoI,MAAQ7W,EAAE6W,MACjB7W,EAAE6W,MAAMpI,KAAOzO,EAAEyO,KAEjBzO,EAAEyO,KAAO6uG,EACTt9G,EAAE6W,MAAQymG,EAAQzmG,MAClBymG,EAAQzmG,MAAQ7W,EAChBA,EAAE6W,MAAMpI,KAAOzO,EAEX00E,EAAQ10E,EAAEjI,IAAKulH,EAAQvlH,OACzBulH,EAAUt9G,IAGZs9G,EAAUt9G,GAId,OAAOs9G,EAxOK+C,CAFV/C,EAAUt/G,EAAK6Y,MAEqB3a,KAAKgpG,OAI3ChpG,KAAKgpG,QAELhpG,KAAKujH,SAAWnC,EAETt/G,GAWT6/F,EAAc1lG,UAAU2xF,OAAS,SAAU9rF,GAEzC9B,KAAKujH,SAYP,SAAsBnC,EAASt/G,EAAMjG,GAEnCiG,EAAKjG,KAd8C,EAgBnD,IAAIoZ,EAASnT,EAAKmT,OAgBlB,OAdIA,GAAUujE,EAAQ12E,EAAKjG,IAAKoZ,EAAOpZ,OAErC2nH,EAAKpC,EAASt/G,EAAMmT,GAGpByuG,EAActC,EAASnsG,IAIrBujE,EAAQ12E,EAAKjG,IAAKulH,EAAQvlH,OAC5BulH,EAAUt/G,GAILs/G,EAhCSgD,CAAapkH,KAAKujH,SAAUzhH,GAE5C9B,KAAK6jH,kBAiGP,IAAIK,EAAa,SAAoBpiH,EAAMmT,GAEzCnT,EAAKyQ,KAAKoI,MAAQ7Y,EAAK6Y,MACvB7Y,EAAK6Y,MAAMpI,KAAOzQ,EAAKyQ,KAEvBzQ,EAAKmT,OAASA,EAETA,EAAOq7B,OAKVxuC,EAAKyQ,KAAO0C,EAAOq7B,MACnBxuC,EAAK6Y,MAAQ1F,EAAOq7B,MAAM31B,MAC1B1F,EAAOq7B,MAAM31B,MAAQ7Y,EACrBA,EAAK6Y,MAAMpI,KAAOzQ,IAPlBmT,EAAOq7B,MAAQxuC,EACfA,EAAK6Y,MAAQ7Y,EACbA,EAAKyQ,KAAOzQ,GASdmT,EAAOwuG,SAEP3hH,EAAKo7G,MAAO,GA8Fd,OAAOvb,IACN,CACD/uB,SAAS,IClYP,GAAO,SACP,GAAe,CAAC,QAAS,gBAClByxC,IAA8B,QAAQ,GAAM,IAAe72D,IACpE,IAAI,MACF+1B,EAAK,aACLke,GACEj0C,EA6BJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,OAAO,IAAIke,EAAa,KAE1Bh+B,OAAQ,SAAgB0hC,GACtB,OAAO,IAAI1D,EAAa,GAAI0D,IAE9B,iBAAkB,SAAqBpkG,GACrC,OAAO,IAAI0gG,EAAa1gG,IAE1B,yBAA0B,SAA2BA,EAAMokG,GACzD,OAAO,IAAI1D,EAAa1gG,EAAMokG,SC5ChC,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvCmf,IAA6B,QAAQ,GAAM,IAAe92D,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,EACA8zD,UAAW8X,GACT3hD,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,GAAK,GAAKA,IAAM,GAAKioD,EAAO6kB,YACvB4iC,GAAY1vG,GAGd,IAAI0/B,EAAQ1/B,EAAG,GAAG+2E,SAE3Br3C,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE+2E,SAEXyc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,GAAGohC,SAElC,iBAAkB,SAAqBphC,GACrC,OAAO,SAAQA,EAAG7D,YC9CpB,GAAe,CAAC,QAAS,eAClBukH,IAAmC,QAFnC,cAEiD,IAAe/2D,IACzE,IAAI,MACF+1B,EAAK,YACL2d,GACE1zC,EAoBJ,OAAO,SAAqBrkD,EAAGC,EAAG8K,GAEhC,IAAIkpG,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACTyD,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAERyT,EAAUtzG,EAAEyvG,QACZ8D,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KACT8D,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAEZ,GAAIuT,EAAM/hH,SAAWoiH,EAAMpiH,OACzB,MAAM,IAAI2uG,GAAA,EAAeoT,EAAM/hH,OAAQoiH,EAAMpiH,QAI/C,GAAI+hH,EAAM,KAAOK,EAAM,IAAML,EAAM,KAAOK,EAAM,GAC9C,MAAM,IAAIE,WAAW,iCAAmCP,EAAQ,0BAA4BK,EAAQ,KAItG,IAGIhqG,EAHA44E,EAAO+wB,EAAM,GACb3R,EAAU2R,EAAM,GAIhBh5D,EAAK09C,EAELiY,EAAO,EAEP6D,EAAK9oG,EAEU,iBAARuoG,GAAoBA,IAAQK,IAErCjqG,EAAK4pG,EAELj5D,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,GAExBmqG,EAAKz5B,EAAMzzC,KAAK57B,EAAU,CAACrB,EAAIA,KAIjC,IAQInY,EAAGyuB,EAAGyf,EAAGsO,EAAIK,EARbgmE,EAAUH,GAAWV,EAAU,QAAKv+G,EACpCovB,EAAS,GACTiwF,EAAO,GAEP35G,EAAI05G,EAAU,QAAKp/G,EAEnB4F,EAAI,GAIR,IAAKolB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAE5Bq0F,EAAKr0F,GAAKoE,EAAO9yB,OAEjB,IAAIyiH,EAAO/zF,EAAI,EAEf,GAAItlB,EAEF,IAAKqzC,EAAK0lE,EAAKzzF,GAAIouB,EAAKqlE,EAAKzzF,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAInD7kC,EAFArJ,EAAIiiH,EAAO/zE,IAEJs0E,EACPr5G,EAAEnJ,GAAKgiH,EAAQ9zE,GAKnB,IAAKsO,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAInD,GAFAluC,EAAI2iH,EAAOz0E,GAEP/kC,EAAG,CAEL,IAAI08G,EAAKx8G,EAAErJ,KAAOwiH,EAAOr5G,EAAEnJ,GAAKy+G,EAE5BgG,EAAKnC,EAAGI,EAAQx0E,GAAI23E,GAEnB/8D,EAAG27D,EAAIhG,KAEV5rF,EAAO/uB,KAAK9D,GAEZ6iH,EAAQ/+G,KAAK2gH,SAIf5xF,EAAO/uB,KAAK9D,GAQlB,OAFA8iH,EAAK3S,GAAWt9E,EAAO9yB,OAEhB0O,EAAE+wG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC+pE,EAAMof,GACb1F,SAAUtyF,QC9HZ,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,eACxD2xG,IAA6B,QAAQ,GAAM,IAAeh3D,IACnE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,UACX7J,EAAS,YACTmK,GACEh0C,EACA+xD,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEEse,EAAcT,GAAkB,CAClCx7B,UAEEkhC,EAAcF,GAAkB,CAClChhC,QACA2d,gBAEEwe,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEye,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAgCF,OAAOA,EAAM,GAAM,CACjB,iBAAkB99E,KAAKgF,MAIvB,uBAAwB,SAA4B3G,EAAGD,GACrD,OAAOwzF,EAAU5sF,MAAM3G,EAAGD,IAE5B,6BAA8B,SAAkCA,EAAGC,GACjE,OAAO2gH,EAAY5gH,EAAGC,EAAG9D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAE/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GACrC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GACvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GACvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mCAAoC,SAAqCD,EAAGC,GAC1E,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,mCAAoC,SAAqC6D,EAAGC,GAE1E,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GAExE,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAC5D,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,4BAA6B,SAA8BtlD,EAAGC,GAC5D,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCrH/C,GAAe,CAAC,QAAS,aAClBu7D,IAA2B,QAF3B,MAEyC,IAAel3D,IACjE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAuBJ,OAAO+1B,EA7BE,MA6BU,CACjB/W,OAAQ2nC,GACR5wE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEw3E,OAEXgc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,EAAEy/B,QAEjCijD,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,oCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YCxCpB,GAAe,CAAC,QAAS,SAAU,YAAa,cAAe,cAAe,gBACvE2kH,IAA2B,QAF3B,MAEyC,IAAen3D,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,UACNg2F,EAAS,YACTH,EAAW,YACXM,EAAW,aACXC,GACEj0C,EACAgxD,EAAcpC,GAAkB,CAClC74B,UAEEk7B,EAActB,GAAkB,CAClC55B,QACA2d,gBAEEwd,EAAcb,GAAkB,CAClCt6B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAqCF,OAAOA,EA/DE,OA+DU,SAAO,CAExB,2BAA4B,SAAgC1/E,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAGu9F,IAE3B,4BAA6B,SAAiCx9F,EAAGC,GAC/D,OAAO06G,EAAY36G,EAAGC,EAAGu9F,GAAW,IAEtC,4BAA6B,SAAiCx9F,EAAGC,GAC/D,OAAO06G,EAAY16G,EAAGD,EAAGw9F,GAAW,IAEtC,6BAA8B,SAAkCx9F,EAAGC,GACjE,OAAO26G,EAAY56G,EAAGC,EAAGu9F,IAE3B,eAAgB,SAAoBx9F,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mBAAoB,SAAwBD,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAGu9F,GAAW,IAEtC,oBAAqB,SAAyBx9F,EAAGC,GAC/C,OAAO46G,EAAY76G,EAAGC,EAAGu9F,GAAW,IAEtC,mBAAoB,SAAwBx9F,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAGw9F,GAAW,IAEtC,oBAAqB,SAAyBx9F,EAAGC,GAC/C,OAAO46G,EAAY56G,EAAGD,EAAGw9F,GAAW,IAEtC,aAAc,SAAkBx9F,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAGu9F,GAAW,GAAOl4C,WAErD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAGw9F,GAAW,GAAMl4C,WAEpD,WAAYk4C,EACZ,mBAAoB,SAAmBx9F,EAAGC,EAAG8gH,GAG3C,IAFA,IAAI17G,EAASlJ,KAAK6D,EAAGC,GAEZpJ,EAAI,EAAGA,EAAIkqH,EAAKnqH,OAAQC,IAC/BwO,EAASlJ,KAAKkJ,EAAQ07G,EAAKlqH,IAG7B,OAAOwO,IAERm4F,EAAUtd,gBC3HX,GAAe,CAAC,QAAS,YAAa,iBAAkB,OAAQ,QACzD8gC,IAA2B,QAF3B,MAEyC,IAAer3D,IACjE,IAAI,MACF+1B,EAAK,UACL8d,EAAS,eACTF,EAAc,KACdpnB,EAAI,KACJr4D,GACE8rC,EAyBJ,OAAO+1B,EAlCE,MAkCU,CACjB,2CAgCF,SAAmBp6E,EAAGC,GACpB,IAAI2lD,EAAI+1D,EAAa37G,EAAGC,GAEpBmzG,GAAQ,EAAAzqC,EAAA,IAAS3oE,GAAKA,EAAE4/F,MAAQ5/F,EAChCszG,GAAM,EAAA3qC,EAAA,IAAS3oE,GAAKA,EAAE8/F,eAAY9qG,EAClC4/G,GAAQ,EAAAjsC,EAAA,IAAS1oE,GAAKA,EAAE2/F,MAAQ3/F,EAChC0zG,GAAM,EAAAhrC,EAAA,IAAS1oE,GAAKA,EAAE6/F,eAAY9qG,EAElC4mH,EAAgC,IAApB/b,EAAM7/F,GAAG1O,OACrBuqH,EAAgC,IAApBhc,EAAM5/F,GAAG3O,OACrB6f,EAAM+mF,EACN35C,EAAMy5C,EAEV,GAAIsb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,EAAkB,CACxD,IAAI5pG,EAAK4pG,EAETniG,EAAMipE,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IACjC60C,EAAM67B,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,IAIxC,IAAKkyG,IAAcC,EAAW,CAG5B,IAFA,IAAI37G,EAAIq+C,EAAIqyB,EAAKwiC,EAAM,IAAKwB,EAAM,IAEzBrjH,EAAI,EAAGA,EAAIq0D,EAAGr0D,IACrB2O,EAAIiR,EAAIjR,EAAGq+C,EAAIqyB,EAAKwiC,EAAM7hH,IAAKqjH,EAAMrjH,KAGvC,OAAO2O,EAIT,IAAK07G,GAAaC,EAAW,CAG3B,IAFA,IAAI37B,EAAK3hC,EAAIqyB,EAAKwiC,EAAM,IAAKwB,EAAM,GAAG,IAE7B1/G,EAAK,EAAGA,EAAK0wD,EAAG1wD,IACvBgrF,EAAK/uE,EAAI+uE,EAAI3hC,EAAIqyB,EAAKwiC,EAAMl+G,IAAM0/G,EAAM1/G,GAAI,KAG9C,OAAOgrF,EAIT,GAAI07B,IAAcC,EAAW,CAG3B,IAFA,IAAIC,EAAMv9D,EAAIqyB,EAAKwiC,EAAM,GAAG,IAAKwB,EAAM,IAE9B7gB,EAAM,EAAGA,EAAMnuC,EAAGmuC,IACzB+nB,EAAM3qG,EAAI2qG,EAAKv9D,EAAIqyB,EAAKwiC,EAAMrf,GAAK,IAAK6gB,EAAM7gB,KAGhD,OAAO+nB,EAIT,GAAIF,GAAaC,EAAW,CAG1B,IAFA,IAAIE,EAAMx9D,EAAIqyB,EAAKwiC,EAAM,GAAG,IAAKwB,EAAM,GAAG,IAEjCpD,EAAM,EAAGA,EAAM5rD,EAAG4rD,IACzBuK,EAAM5qG,EAAI4qG,EAAKx9D,EAAIqyB,EAAKwiC,EAAM5B,GAAK,IAAKoD,EAAMpD,GAAK,KAGrD,OAAOuK,IA5FT,6BAgGF,SAAoBrhH,EAAGC,GACrBghH,EAAajhH,EAAGC,GAahB,IAXA,IAAIqhH,EAASthH,EAAEi1G,OACXsM,EAAUvhH,EAAEg1G,QACZwM,EAASvhH,EAAEg1G,OACXwM,EAAUxhH,EAAE+0G,QAEZxvG,EAAI,EACJiR,EAAM+mF,EACN35C,EAAMy5C,EACNzmG,EAAI,EACJyuB,EAAI,EAEDzuB,EAAIyqH,EAAO1qH,QAAU0uB,EAAIk8F,EAAO5qH,QAAQ,CAC7C,IAAIkqG,EAAIwgB,EAAOzqH,GACX6qH,EAAIF,EAAOl8F,GAEXw7E,EAAI4gB,EACN7qH,IAIEiqG,EAAI4gB,EACNp8F,IAIEw7E,IAAM4gB,IACRl8G,EAAIiR,EAAIjR,EAAGq+C,EAAI09D,EAAQ1qH,GAAI4qH,EAAQn8F,KACnCzuB,IACAyuB,KAIJ,OAAO9f,KAhIT,SAASy7G,EAAajhH,EAAGC,GACvB,IAII0hH,EAAMC,EAJNC,EAAQ1c,EAAMnlG,GAEd8hH,EAAQ3c,EAAMllG,GAIlB,GAAqB,IAAjB4hH,EAAMjrH,OACR+qH,EAAOE,EAAM,OACR,IAAqB,IAAjBA,EAAMjrH,QAA6B,IAAbirH,EAAM,GAGrC,MAAM,IAAI3I,WAAW,2DAA6D2I,EAAM18E,KAAK,MAAQ,KAFrGw8E,EAAOE,EAAM,GAKf,GAAqB,IAAjBC,EAAMlrH,OACRgrH,EAAOE,EAAM,OACR,IAAqB,IAAjBA,EAAMlrH,QAA6B,IAAbkrH,EAAM,GAGrC,MAAM,IAAI5I,WAAW,2DAA6D4I,EAAM38E,KAAK,MAAQ,KAFrGy8E,EAAOE,EAAM,GAKf,GAAIH,IAASC,EAAM,MAAM,IAAI1I,WAAW,mCAAqCyI,EAAO,OAASC,EAAO,KACpG,GAAa,IAATD,EAAY,MAAM,IAAIzI,WAAW,qDACrC,OAAOyI,EA2GT,SAASxc,EAAMnlG,GACb,OAAO,EAAAiuE,EAAA,IAASjuE,GAAKA,EAAE6d,OAASA,EAAK7d,OC7KrC,GAAO,cACP,GAAe,CAAC,QAAS,YAAa,eAAgB,aAAc,aAAc,YAAa,UACxF+hH,IAAmC,QAAQ,GAAM,IAAep4D,IACzE,IAAI,MACF+1B,EAAK,UACL8d,EAAS,aACT9mB,EAAY,WACZx0B,EAAU,WACVD,EAAU,UACVrxC,EAAS,OACTgkE,GACEjrB,EAwBJ,OAAO+1B,EAAM,GAAM,CACjB,yCAA0C,SAAwC9jF,EAAGmpC,GACnF,KAAKn0B,EAAUhV,IAAOsmD,EAAWtmD,IAAOgV,EAAUm0B,IAAOmd,EAAWnd,IAClE,MAAM,IAAIztC,UAAU,2DACf,GAAIs9E,EAAO7vC,EAAGnpC,GACnB,MAAM,IAAItE,UAAU,6DAGtB,OAAOo/E,EAAa8mB,EAAU5hG,GAAI,GAAI4hG,EAAUz4D,GAAI,UCzCtD,GAAO,SACP,GAAe,CAAC,SACTi9E,IAA8B,QAAQ,GAAM,IAAer4D,IACpE,IAAI,MACF+1B,GACE/1B,EAmCJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQs/B,GACRzU,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEw/C,UAEX9f,QAAS,SAAiB1/B,GACxB,OAAgB,IAATA,EAAEmgC,IAAqB,IAATngC,EAAEogC,IAEzBsqB,SAAU,SAAkB1qD,GAC1B,OAAe,IAARA,EAAEyF,GAAmB,IAARzF,EAAEpE,GAExB8mF,KAAM,SAAc1iF,GAClB,OAAO7D,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YCtDpB,GAAe,CAAC,SACT8lH,IAA2B,QAF3B,MAEyC,IAAet4D,IACjE,IAAI,MACF+1B,GACE/1B,EA0BJ,OAAO+1B,EA/BE,MA+BU,CACjB/W,OAAQ2gC,GACR5pE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEsH,OAEXksF,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEsH,OAEXojD,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAEsH,OAEX,iBAAkB,SAAqBtH,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1BumF,KAAM,SAAc1iF,GAClB,OAAOA,EAAEsH,YC1CX,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,eAC/C46G,IAA6B,QAF7B,QAE2C,IAAev4D,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,MACNpmD,EAAK,OACL2F,EAAM,YACN61F,GACE1zC,EACAkyD,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEE0d,EAAcN,GAAkB,CAClC/6B,UAuCF,OAAOA,EAAM,QAAS,CACpB/W,OAAQ,SAAgB3oE,GACtB,OAAI,QAAYA,EAAG6B,EAAM7B,GAAIioD,EAAO4kB,SAC3BhrE,EAAM7B,GAEN4B,KAAKgd,MAAM5e,IAGtB,iBAAkB,SAAsBA,EAAGpE,GACzC,IAAI,QAAYoE,EAAG6B,EAAM7B,EAAGpE,GAAIqsD,EAAO4kB,SACrC,OAAOhrE,EAAM7B,EAAGpE,GAEhB,IAAK+sE,EAAQw5C,GAAY,GAAG9jF,OAAOr+B,EAAG,KAAKuvB,MAAM,KAC7ClqB,EAASzD,KAAKgd,MAAM9c,OAAO,GAAGu8B,OAAOsqC,EAAQ,KAAKtqC,OAAOv8B,OAAOqgH,GAAYvmH,KAEhF,OADC+sE,EAAQw5C,GAAY,GAAG9jF,OAAOh5B,EAAQ,KAAKkqB,MAAM,KAC3CztB,OAAO,GAAGu8B,OAAOsqC,EAAQ,KAAKtqC,OAAOv8B,OAAOqgH,GAAYvmH,KAGnE8jC,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE4e,SAEX,kBAAmB,SAAuB5e,EAAGpE,GAC3C,OAAOoE,EAAE4e,MAAMhjB,IAEjB43F,UAAW,SAAmBxzF,GAC5B,OAAI,GAAeA,EAAG6B,EAAM7B,GAAIioD,EAAO4kB,SAC9BhrE,EAAM7B,GAENA,EAAE4e,SAGb,uBAAwB,SAA4B5e,EAAGpE,GACrD,OAAI,GAAeoE,EAAG6B,EAAM7B,EAAGpE,GAAIqsD,EAAO4kB,SACjChrE,EAAM7B,EAAGpE,GAEToE,EAAEikD,gBAAgBroD,EAAEgpD,WAAY,gBAG3C8F,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE4e,SAEX,mBAAoB,SAAwB5e,EAAGpE,GAC7C,OAAOoE,EAAE4e,MAAMhjB,IAEjB,iBAAkB,SAAqBoE,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1B,yBAA0B,SAA2B6D,EAAGpE,GAEtD,OAAO,SAAQoE,GAAGnJ,GAAKsF,KAAKtF,EAAG+E,KAAI,IAErC,mCAAoC,SAAqCoE,EAAGC,GAC1E,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,sCAAuC,SAAqC6D,EAAGC,GAE7E,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCnH/C,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,YAAa,iBAAkB,cAAe,OAC1E88D,IAAgC,QAAQ,GAAM,IAAez4D,IACtE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,UACNg2F,EAAS,eACTF,EAAc,YACdD,EAAW,IACXhnB,GACE1sB,EACAkyD,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEE0d,EAAcN,GAAkB,CAClC/6B,UAGF,SAAS2iC,EAA0BC,EAAOC,GAExC,OAAQD,EAAM1rH,QACZ,KAAK,EAEH,OAAQ2rH,EAAM3rH,QACZ,KAAK,EAEH,GAAI0rH,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIrJ,WAAW,2EAGvB,MAEF,KAAK,EAEH,GAAIoJ,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIrJ,WAAW,wDAA0DoJ,EAAM,GAAK,6BAA+BC,EAAM,GAAK,KAGtI,MAEF,QACE,MAAM,IAAIjlF,MAAM,+DAAiEilF,EAAM3rH,OAAS,gBAGpG,MAEF,KAAK,EAEH,OAAQ2rH,EAAM3rH,QACZ,KAAK,EAEH,GAAI0rH,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIrJ,WAAW,yDAA2DoJ,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAGzI,MAEF,KAAK,EAEH,GAAID,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIrJ,WAAW,2DAA6DoJ,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAG3I,MAEF,QACE,MAAM,IAAIjlF,MAAM,+DAAiEilF,EAAM3rH,OAAS,gBAGpG,MAEF,QACE,MAAM,IAAI0mC,MAAM,+DAAiEglF,EAAM1rH,OAAS,iBA4GtG,IAAI4rH,EAAwB9iC,EAAM,wBAAyB,CACzD,mBA6BF,SAAoCp6E,EAAGC,GAErC,IAUIyJ,EAVA0pG,EAAQpzG,EAAE4/F,MACVyT,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAER8U,EAAQ30G,EAAE2/F,MACV+T,EAAM1zG,EAAE6/F,UAERqd,EAAQ9J,EAAM,GACd+J,EAAW/J,EAAM,GAIjBgK,EAAKnlB,EAELolB,EAAKtlB,EAELsb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtC5pG,EAAK4pG,EAEL+J,EAAKjjC,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IAChC4zG,EAAKljC,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,KAMvC,IAFA,IAAIxJ,EAAI,GAEC3O,EAAI,EAAGA,EAAI4rH,EAAO5rH,IAAK,CAM9B,IAJA,IAAIixF,EAAM4wB,EAAM7hH,GAEZu3C,EAAMw0E,EAAG96B,EAAI,GAAIoyB,EAAM,IAElB50F,EAAI,EAAGA,EAAIo9F,EAAUp9F,IAE5B8oB,EAAMu0E,EAAGv0E,EAAKw0E,EAAG96B,EAAIxiE,GAAI40F,EAAM50F,KAGjC9f,EAAE3O,GAAKu3C,EAIT,OAAO9oC,EAAEghG,kBAAkB,CACzBppG,KAAMsI,EACNqY,KAAM,CAAC4kG,GACPnhB,SAAUtyF,KA3EZ,oBA0QF,SAAqC1J,EAAGC,GAEtC,IAAIg0G,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACT0D,EAAMtzG,EAAE8/F,UAEZ,IAAKmU,EACH,MAAM,IAAIj8E,MAAM,0DAIlB,IAUItuB,EAVAkrG,EAAQ30G,EAAE2/F,MACV+T,EAAM1zG,EAAE6/F,UAERqd,EAAQn9G,EAAE6/F,MAAM,GAChB0d,EAAQt9G,EAAE4/F,MAAM,GAEhBuU,EAAU,GACVhwF,EAAS,GACTiwF,EAAO,GAIPgJ,EAAKnlB,EAELolB,EAAKtlB,EAEL39C,EAAK09C,EAELiY,EAAO,EAEPsD,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtC5pG,EAAK4pG,EAEL+J,EAAKjjC,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IAChC4zG,EAAKljC,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,IACrC2wC,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,IAI1B,IAAIhP,EAAI,GAEJE,EAAI,GAERy5G,EAAK,GAAK,EAEV,IAAK,IAAImJ,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,IAAIC,EAAM7I,EAAM4I,GAEhB,IAAKnjE,EAAGojE,EAAKzN,GAEX,IAAK,IAAI0N,EAAMvJ,EAAKqJ,GAAKG,EAAMxJ,EAAKqJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,IAAIC,EAAK3J,EAAO0J,GAEXhjH,EAAEijH,GASLnjH,EAAEmjH,GAAMR,EAAG3iH,EAAEmjH,GAAKP,EAAGG,EAAKxJ,EAAQ2J,MAPlChjH,EAAEijH,IAAM,EAERz5F,EAAO/uB,KAAKwoH,GAEZnjH,EAAEmjH,GAAMP,EAAGG,EAAKxJ,EAAQ2J,MAUhC,IAAK,IAAI3xF,EAAK7H,EAAO9yB,OAAQiD,EAAI,EAAGA,EAAI03B,EAAI13B,IAAK,CAE/C,IAAIupH,EAAK15F,EAAO7vB,GAEhB6/G,EAAQ7/G,GAAKmG,EAAEojH,GAMjB,OAFAzJ,EAAK,GAAKjwF,EAAO9yB,OAEV0O,EAAE+wG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC4kG,EAAO,GACdnhB,SAAUtyF,OAzVVq0G,EAAwB3jC,EAAM,wBAAyB,CACzD,2BA2EF,SAAyCp6E,EAAGC,GAE1C,IAYIyJ,EAZA0pG,EAAQpzG,EAAE4/F,MACVyT,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAER8U,EAAQ30G,EAAE2/F,MACV8T,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAERqd,EAAQ9J,EAAM,GACd+J,EAAW/J,EAAM,GACjB2K,EAAWtK,EAAM,GAIjB2J,EAAKnlB,EAELolB,EAAKtlB,EAELsb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtC5pG,EAAK4pG,EAEL+J,EAAKjjC,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IAChC4zG,EAAKljC,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,KAMvC,IAFA,IAAIxJ,EAAI,GAEC3O,EAAI,EAAGA,EAAI4rH,EAAO5rH,IAAK,CAE9B,IAAIixF,EAAM4wB,EAAM7hH,GAEhB2O,EAAE3O,GAAK,GAEP,IAAK,IAAIyuB,EAAI,EAAGA,EAAIg+F,EAAUh+F,IAAK,CAIjC,IAFA,IAAI8oB,EAAMw0E,EAAG96B,EAAI,GAAIoyB,EAAM,GAAG50F,IAErBtlB,EAAI,EAAGA,EAAI0iH,EAAU1iH,IAE5BouC,EAAMu0E,EAAGv0E,EAAKw0E,EAAG96B,EAAI9nF,GAAIk6G,EAAMl6G,GAAGslB,KAGpC9f,EAAE3O,GAAGyuB,GAAK8oB,GAKd,OAAO9oC,EAAEghG,kBAAkB,CACzBppG,KAAMsI,EACNqY,KAAM,CAAC4kG,EAAOa,GACdhiB,SAAUtyF,KAhIZ,4BA6IF,SAA0C1J,EAAGC,GAE3C,IAAImzG,EAAQpzG,EAAE4/F,MACVyT,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAERyT,EAAUtzG,EAAEyvG,QACZ8D,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KACT8D,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAEZ,IAAKyT,EACH,MAAM,IAAIv7E,MAAM,0DAIlB,IAGItuB,EAHAyzG,EAAQ9J,EAAM,GACd2K,EAAWtK,EAAM,GAIjB2J,EAAKnlB,EAELolB,EAAKtlB,EAEL39C,EAAK09C,EAELiY,EAAO,EAEPsD,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtC5pG,EAAK4pG,EAEL+J,EAAKjjC,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IAChC4zG,EAAKljC,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,IACrC2wC,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,IAgB1B,IAZA,IAAI0qG,EAAU,GACVhwF,EAAS,GACTiwF,EAAO,GAEPn0G,EAAID,EAAE8wG,mBAAmB,CAC3B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC4kG,EAAOa,GACdhiB,SAAUtyF,IAGHu0G,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpC5J,EAAK4J,GAAM75F,EAAO9yB,OAElB,IAAI4sH,EAAMzK,EAAKwK,GACXE,EAAM1K,EAAKwK,EAAK,GAEpB,GAAIE,EAAMD,EAIR,IAFA,IAAIv5E,EAAO,EAEFpzC,EAAI,EAAGA,EAAI4rH,EAAO5rH,IAAK,CAM9B,IAJA,IAAIwiH,EAAOxiH,EAAI,EAEXokH,OAAM,EAEDyI,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAEjC,IAAIZ,EAAKhK,EAAO4K,GAEZz5E,IAASovE,GAEX4B,EAAM2H,EAAGlK,EAAM7hH,GAAGisH,GAAKjK,EAAQ6K,IAE/Bz5E,EAAOovE,GAGP4B,EAAM0H,EAAG1H,EAAK2H,EAAGlK,EAAM7hH,GAAGisH,GAAKjK,EAAQ6K,KAKvCz5E,IAASovE,GAAS15D,EAAGs7D,EAAK3F,KAE5B5rF,EAAO/uB,KAAK9D,GACZ6iH,EAAQ/+G,KAAKsgH,KASrB,OAFAtB,EAAK2J,GAAY55F,EAAO9yB,OAEjB4O,GA/OP,4BAmWF,SAA0CF,EAAGC,GAE3C,IAAIg0G,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACT0D,EAAMtzG,EAAE8/F,UAEZ,IAAKmU,EACH,MAAM,IAAIj8E,MAAM,0DAIlB,IAOItuB,EAPAkrG,EAAQ30G,EAAE2/F,MACV+T,EAAM1zG,EAAE6/F,UAERqd,EAAQn9G,EAAE6/F,MAAM,GAChB0d,EAAQt9G,EAAE4/F,MAAM,GAChBme,EAAW/9G,EAAE4/F,MAAM,GAInBwd,EAAKnlB,EAELolB,EAAKtlB,EAEL39C,EAAK09C,EAELiY,EAAO,EAEPsD,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtC5pG,EAAK4pG,EAEL+J,EAAKjjC,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IAChC4zG,EAAKljC,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,IACrC2wC,EAAK+/B,EAAMzzC,KAAKoxD,EAAa,CAACruF,EAAIA,IAElCsmG,EAAO51B,EAAMzb,QAAQ,EAAGj1D,IAoB1B,IAhBA,IAAI0qG,EAAU,GACVhwF,EAAS,GACTiwF,EAAO,GAEPn0G,EAAIF,EAAE+wG,mBAAmB,CAC3B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC4kG,EAAOa,GACdhiB,SAAUtyF,IAGRhP,EAAI,GAEJE,EAAI,GAECqjH,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpC5J,EAAK4J,GAAM75F,EAAO9yB,OAIlB,IAFA,IAAIyiH,EAAOkK,EAAK,EAEPT,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,IAAIa,EAAOzJ,EAAM4I,GAAIS,GAErB,IAAK5jE,EAAGgkE,EAAMrO,GAEZ,IAAK,IAAI0N,EAAMvJ,EAAKqJ,GAAKG,EAAMxJ,EAAKqJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,IAAIC,EAAK3J,EAAO0J,GAEZhjH,EAAEijH,KAAQ9J,GAEZn5G,EAAEijH,GAAM9J,EAER3vF,EAAO/uB,KAAKwoH,GAEZnjH,EAAEmjH,GAAMP,EAAGe,EAAMpK,EAAQ2J,KAGzBljH,EAAEmjH,GAAMR,EAAG3iH,EAAEmjH,GAAKP,EAAGe,EAAMpK,EAAQ2J,MAO3C,IAAK,IAAIU,EAAKjK,EAAK4J,GAAKhyF,EAAK7H,EAAO9yB,OAAQiD,EAAI+pH,EAAI/pH,EAAI03B,EAAI13B,IAAK,CAE/D,IAAIupH,EAAK15F,EAAO7vB,GAEhB6/G,EAAQ7/G,GAAKmG,EAAEojH,IAOnB,OAFAzJ,EAAK2J,GAAY55F,EAAO9yB,OAEjB4O,GAtcP,6BAkdF,SAA2CF,EAAGC,GAE5C,IAeIyJ,EAfAuqG,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACT0D,EAAMtzG,EAAE8/F,UAERyT,EAAUtzG,EAAEyvG,QACZ8D,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KACT+D,EAAM1zG,EAAE6/F,UAERqd,EAAQn9G,EAAE6/F,MAAM,GAChBme,EAAW/9G,EAAE4/F,MAAM,GAEnBzsE,EAAS6gF,GAAWV,EAIpB8J,EAAKnlB,EAELolB,EAAKtlB,EAELsb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtC5pG,EAAK4pG,EAEL+J,EAAKjjC,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IAChC4zG,EAAKljC,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,KAsBvC,IAlBA,IAgBIk0G,EAAIF,EAAKC,EAAKS,EAAIF,EAAKC,EAAKN,EAAIL,EAhBhCpJ,EAAUhhF,EAAS,QAAKp+B,EACxBovB,EAAS,GACTiwF,EAAO,GAEPn0G,EAAIF,EAAE+wG,mBAAmB,CAC3B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC4kG,EAAOa,GACdhiB,SAAUtyF,IAGRhP,EAAI04B,EAAS,QAAKp+B,EAElB4F,EAAI,GAICqjH,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpC5J,EAAK4J,GAAM75F,EAAO9yB,OAElB,IAAIyiH,EAAOkK,EAAK,EAEhB,IAAKC,EAAMzK,EAAKwK,GAAKE,EAAM1K,EAAKwK,EAAK,GAAIG,EAAKF,EAAKE,EAAKD,EAAKC,IAI3D,GAFAZ,EAAKhK,EAAO4K,GAERhrF,EAEF,IAAKsqF,EAAMvJ,EAAKqJ,GAAKG,EAAMxJ,EAAKqJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAIvDhjH,EAFJijH,EAAK3J,EAAO0J,MAEE7J,GAEZn5G,EAAEijH,GAAM9J,EAER3vF,EAAO/uB,KAAKwoH,GAEZnjH,EAAEmjH,GAAMP,EAAG/J,EAAQ6K,GAAKnK,EAAQ2J,KAGhCljH,EAAEmjH,GAAMR,EAAG3iH,EAAEmjH,GAAKP,EAAG/J,EAAQ6K,GAAKnK,EAAQ2J,UAK9C,IAAKF,EAAMvJ,EAAKqJ,GAAKG,EAAMxJ,EAAKqJ,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAIvDhjH,EAFJijH,EAAK3J,EAAO0J,MAEE7J,IAEZn5G,EAAEijH,GAAM9J,EAER3vF,EAAO/uB,KAAKwoH,IAOpB,GAAIzqF,EAEF,IAAK,IAAIkrF,EAAKjK,EAAK4J,GAAKhyF,EAAK7H,EAAO9yB,OAAQiD,EAAI+pH,EAAI/pH,EAAI03B,EAAI13B,IAAK,CAE/D,IAAIupH,EAAK15F,EAAO7vB,GAEhB6/G,EAAQ7/G,GAAKmG,EAAEojH,IAQrB,OAFAzJ,EAAK2J,GAAY55F,EAAO9yB,OAEjB4O,KAqCT,OAAOk6E,EAAM,IAAM,SAAO,CAExB,eAAgB,SAAoB1/E,EAAGC,GAErCoiH,GAA0B,SAAUriH,IAAI,SAAUC,IAGlD,IAAI+F,EAAI7J,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAE/B,OAAO,EAAAguE,EAAA,IAASjoE,GAAKA,EAAEs/C,UAAYt/C,GAErC,iBAAkB,SAAsBhG,EAAGC,GAEzC,IAAI4jH,EAAQ7jH,EAAE6d,OACVimG,EAAQ7jH,EAAE4d,OAKd,OAHAwkG,EAA0BwB,EAAOC,GAGZ,IAAjBD,EAAMjtH,OAEa,IAAjBktH,EAAMltH,OA1uBhB,SAA+B0O,EAAGC,EAAG3J,GAEnC,GAAU,IAANA,EACF,MAAM,IAAI0hC,MAAM,qCAGlB,OAAO+4C,EAAI/wE,EAAGC,GAsuBDw+G,CAAsB/jH,EAAGC,EAAG4jH,EAAM,IA1tBjD,SAA+Bv+G,EAAGC,GAEhC,GAAoB,UAAhBA,EAAE87F,UACJ,MAAM,IAAI/jE,MAAM,4CAGlB,OAYF,SAAoCh4B,EAAGC,GAErC,IAWIyJ,EAXA0pG,EAAQpzG,EAAE4/F,MACVyT,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAER8U,EAAQ30G,EAAE2/F,MACV8T,EAAQzzG,EAAE4/F,MACV8T,EAAM1zG,EAAE6/F,UAER4e,EAAUrL,EAAM,GAChB2K,EAAWtK,EAAM,GAIjB2J,EAAKnlB,EAELolB,EAAKtlB,EAELsb,GAAOK,GAAOL,IAAQK,GAAsB,iBAARL,IAEtC5pG,EAAK4pG,EAEL+J,EAAKjjC,EAAMzzC,KAAKuxD,EAAW,CAACxuF,EAAIA,IAChC4zG,EAAKljC,EAAMzzC,KAAKqxD,EAAgB,CAACtuF,EAAIA,KAMvC,IAFA,IAAIxJ,EAAI,GAEC8f,EAAI,EAAGA,EAAIg+F,EAAUh+F,IAAK,CAIjC,IAFA,IAAI8oB,EAAMw0E,EAAGlK,EAAM,GAAIwB,EAAM,GAAG50F,IAEvBzuB,EAAI,EAAGA,EAAImtH,EAASntH,IAE3Bu3C,EAAMu0E,EAAGv0E,EAAKw0E,EAAGlK,EAAM7hH,GAAIqjH,EAAMrjH,GAAGyuB,KAGtC9f,EAAE8f,GAAK8oB,EAIT,OAAO9oC,EAAEghG,kBAAkB,CACzBppG,KAAMsI,EACNqY,KAAM,CAACylG,GACPhiB,SAAUtyF,IA1DLi1G,CAA2B3+G,EAAGC,GAwtB1B2+G,CAAsBlkH,EAAGC,GAIb,IAAjB6jH,EAAMltH,OAED4rH,EAAsBxiH,EAAGC,GAI3BojH,EAAsBrjH,EAAGC,IAElC,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,EAAGC,EAAEohG,WAAYphG,IAEtC,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO47G,EAAY77G,EAAGC,EAAGq9F,GAAgB,IAE3C,mBAAoB,SAAwBt9F,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAGq9F,GAAgB,IAE3C,oBAAqB,SAAyBt9F,EAAGC,GAC/C,OAAO47G,EAAY57G,EAAGD,EAAGs9F,GAAgB,IAE3C,mBAAoB,SAAwBt9F,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAGs9F,GAAgB,IAE3C,aAAc,SAAkBt9F,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAGq9F,GAAgB,GAAOh4C,WAE1D,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAGs9F,GAAgB,GAAMh4C,WAEzD,WAAYg4C,EACZ,mBAAoB,SAAmBt9F,EAAGC,EAAG8gH,GAG3C,IAFA,IAAI17G,EAASlJ,KAAK6D,EAAGC,GAEZpJ,EAAI,EAAGA,EAAIkqH,EAAKnqH,OAAQC,IAC/BwO,EAASlJ,KAAKkJ,EAAQ07G,EAAKlqH,IAG7B,OAAOwO,IAERi4F,EAAepd,gBC53BhB,GAAO,cACP,GAAe,CAAC,QAAS,SAAU,cAAe,kBAC3CikC,IAAmC,QAAQ,GAAM,IAAex6D,IACzE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,eACXC,GACE3zC,EACA+xD,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEEujB,EAAcF,GAAkB,CAClChhC,QACA2d,gBAEEwe,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA6BF,OAAOA,EAAM,GAAM,CACjB,WAAY4d,EACZ,6BAA8B,SAAkCt9F,EAAGC,GACjE,OAAO2gH,EAAY5gH,EAAGC,EAAGq9F,GAAgB,IAE3C,4BAA6B,SAAiCt9F,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAGs9F,GAAgB,IAE3C,4BAA6B,SAAiCt9F,EAAGC,GAC/D,OAAOy7G,EAAY17G,EAAGC,EAAGq9F,GAAgB,IAE3C,2BAA4B,SAAgCt9F,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAGq9F,IAE3B,eAAgB,SAAoBt9F,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO47G,EAAY77G,EAAGC,EAAGq9F,GAAgB,IAE3C,mBAAoB,SAAwBt9F,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAGq9F,GAAgB,IAE3C,oBAAqB,SAAyBt9F,EAAGC,GAC/C,OAAO47G,EAAY57G,EAAGD,EAAGs9F,GAAgB,IAE3C,mBAAoB,SAAwBt9F,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAGs9F,GAAgB,IAE3C,aAAc,SAAkBt9F,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAGq9F,GAAgB,GAAOh4C,WAE1D,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAGs9F,GAAgB,GAAMh4C,gBCrGzD,GAAe,CAAC,SACT8+D,IAA0B,QAF1B,KAEwC,IAAez6D,IAChE,IAAI,MACF+1B,GACE/1B,EA6BJ,OAAO+1B,EAlCE,KAkCU,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAOA,GAETwzF,UAAW,SAAmBxzF,GAC5B,OAAOA,GAET0/B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEmgC,IAEX,iBAAkB,SAAqBngC,GACrC,OAAO,SAAQA,EAAG7D,YC5CpB,GAAO,UACP,GAAe,CAAC,QAAS,UAClBkoH,IAA+B,QAAQ,GAAM,IAAe16D,IACrE,IAAI,MACF+1B,EAAK,OACLl4E,GACEmiD,EAoBJ,OAAO+1B,EAAM,GAAM,CACjB3oF,MAAO,SAAeiJ,GACpB,OAAO,UAAa,SAAMA,KAE5B09F,OAAQ,SAAgB19F,GACtB,IAAI62G,GAAO,UAAa,SAAM72G,EAAE07F,YAEhC,OAAOl0F,EAAOqvG,SC3Bb,SAASyN,GAAetpE,EAAInf,EAAOlX,EAAKE,GAC7C,KAAM1oB,gBAAgBmoH,IACpB,MAAM,IAAIllF,YAAY,oDAGxBjjC,KAAK6+C,GAAKA,EACV7+C,KAAK0/B,MAAQA,EACb1/B,KAAKwoB,IAAMA,EACXxoB,KAAK0oB,IAAMA,EACX1oB,KAAKokB,QAAU,yCAA2Cy6B,EAAK,KAAOnf,EAAQ,cAAgBlX,GAAOE,QAAoC,IAAMA,EAAM,IAAM,aAC3J1oB,KAAKk3B,OAAQ,IAAIiK,OAAQjK,MAE3BixF,GAAelsH,UAAY,IAAIklC,MAC/BgnF,GAAelsH,UAAUsB,YAAc4jC,MACvCgnF,GAAelsH,UAAU0D,KAAO,iBAChCwoH,GAAelsH,UAAUmsH,kBAAmB,EChB5C,IACI,GAAe,CAAC,SAAU,UACnBC,IAA8B,QAF9B,SAE4C,IAAe76D,IACpE,IAAI,OACF1B,EAAM,OACNzgD,GACEmiD,EA6BJ,OAAO,SAAgB3pD,EAAG6d,EAAMosD,GAC9B,GAAyB,IAArB9tC,UAAUvlC,QAAqC,IAArBulC,UAAUvlC,OACtC,MAAM,IAAI0tH,GAAe,SAAUnoF,UAAUvlC,OAAQ,EAAG,GAe1D,IAZI,EAAAq3E,EAAA,IAASpwD,KACXA,EAAOA,EAAKynC,YAGV,EAAA2oB,EAAA,IAAYpwD,EAAK,MAEnBA,EAAOA,EAAK/K,KAAI,SAAU7Z,GACxB,OAAQ,EAAAg1E,EAAA,IAAYh1E,GAAiBA,EAAM2rD,WAAd3rD,OAK7B,EAAAg1E,EAAA,IAASjuE,GAEX,OAAOA,EAAEovF,OAAOvxE,EAAMosD,GAAc,GAGtC,GAAiB,iBAANjqE,EAET,OAAOykH,EAAczkH,EAAG6d,EAAMosD,GAIhC,IAAIy6C,GAAW3tH,MAAMgD,QAAQiG,IAA+B,UAAlBioD,EAAOzgD,OAEjD,GAAoB,IAAhBqW,EAAKjnB,OAAc,CAErB,KAAOG,MAAMgD,QAAQiG,IACnBA,EAAIA,EAAE,GAGR,OAAO,SAAMA,GAGRjJ,MAAMgD,QAAQiG,KACjBA,EAAI,CAACA,IAGPA,GAAI,SAAMA,GACV,IAAI4xB,GAAM,SAAY5xB,EAAG6d,EAAMosD,GAC/B,OAAOy6C,EAAWl9G,EAAOoqB,GAAOA,GAWpC,SAAS6yF,EAAcjpF,EAAK3d,EAAM8mG,GAChC,QAAoBrqH,IAAhBqqH,GACF,GAA2B,iBAAhBA,GAAmD,IAAvBA,EAAY/tH,OACjD,MAAM,IAAIU,UAAU,kDAGtBqtH,EAAc,IAGhB,GAAoB,IAAhB9mG,EAAKjnB,OACP,MAAM,IAAI2uG,GAAA,EAAe1nF,EAAKjnB,OAAQ,GAGxC,IAAID,EAAMknB,EAAK,GAEf,GAAmB,iBAARlnB,KAAqB,OAAUA,GACxC,MAAM,IAAIW,UAAU,wDAA8D,SAAOumB,GAAQ,KAGnG,GAAI2d,EAAI5kC,OAASD,EACf,OAAO6kC,EAAIrO,UAAU,EAAGx2B,GACnB,GAAI6kC,EAAI5kC,OAASD,EAAK,CAG3B,IAFA,IAAIi7B,EAAM4J,EAED3kC,EAAI,EAAGylG,EAAK3lG,EAAM6kC,EAAI5kC,OAAQC,EAAIylG,EAAIzlG,IAC7C+6B,GAAO+yF,EAGT,OAAO/yF,EAEP,OAAO4J,MC9HT,GAAO,UACP,GAAe,CAAC,QAAS,UAClBopF,IAA+B,QAAQ,GAAM,IAAej7D,IACrE,IAAI,MACF+1B,EAAK,OACLl4E,GACEmiD,EA+BJ,OAAO+1B,EAAM,GAAM,CACjB3oF,MAAO,SAAeiJ,GACpB,OAAO,UAAa,SAAMA,KAE5B09F,OAAQ,SAAgB19F,GACtB,IAAI4xB,GAAM,SAAa5xB,EAAE07F,WAEzB,OAAO3kG,MAAMgD,QAAQ63B,GAAOpqB,EAAOoqB,GAAOA,GAE5CyuD,IAAK,SAAargF,GAEhB,OAAO,SAAMA,SC/Cf,GAAe,CAAC,QAAS,UAClB6kH,IAA0B,QAF1B,KAEwC,IAAel7D,IAChE,IAAI,MACF+1B,EAAK,OACLl4E,GACEmiD,EACAmxD,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA2BF,OAAOA,EAtCE,KAsCU,CACjB,sBAAuB,SAAwB1/E,EAAG0B,GAChD,OAAO1B,EAAEq0E,GAAG3yE,IAEd,iBAAkB,SAAsB1B,EAAGC,GAEzC,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,cAAe,SAAmBD,EAAGC,GAEnC,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,cAAe,SAAmB6D,EAAGC,GAEnC,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCtE/C,GAAe,CAAC,QAAS,SAAU,WAAY,WAAY,SAAU,WAAY,SAAU,WACpFw/D,IAA2B,QAF3B,MAEyC,IAAen7D,IACjE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,SACN8U,EAAQ,SACRj0D,EAAQ,OACRtB,EAAM,OACNmhE,EAAM,SACN0hB,EAAQ,QACR3qD,GACEiqB,EAkCJ,OAAO+1B,EA9CE,MA8CU,CACjB,iBAAkBqlC,EAClB,mBAAoB,SAAwB/kH,EAAGC,GAC7C,OAAOD,EAAE+O,IAAI9O,IAEf,uBAAwB,SAA4BD,EAAGC,GACrD,OAAIA,EAAE2Q,aAAe5Q,GAAK,GAAKioD,EAAO6kB,YAC7B9sE,EAAE+O,IAAI9O,GAEN,IAAIy/B,EAAQ1/B,EAAE4kD,WAAY,GAAG71C,IAAI9O,EAAE2kD,WAAY,IAG1D,qBAAsB,SAA0B5kD,EAAGC,GACjD,GAAY,IAARA,EAAEwF,EAAS,CACb,GAAIwiD,EAAO6kB,YACT,MAAM,IAAIxvC,MAAM,sEAEhB,OAAOynF,EAAK/kH,EAAEslD,UAAWrlD,EAAEqlD,WAG7B,OAAOtlD,EAAE+O,IAAI9O,IAGjB,gBAAiB+kH,EACjB,mBAAoB,SAAwBhlH,EAAGC,GAC7C,OAAO+kH,EAAUhlH,EAAGC,EAAE2kD,aAExB,iBAAkBqgE,EAClB,oBAAqB,SAAyBjlH,EAAGC,GAC/C,OAAOglH,EAAWjlH,EAAGC,EAAE2kD,aAEzB,2BAA4B,SAA6B5kD,EAAGC,GAC1D,OAAOD,EAAE+O,IAAI9O,MAWjB,SAAS8kH,EAAK/kH,EAAGC,GAGf,GAAIgoD,EAAO6kB,eAAgB,OAAU7sE,IAAMD,EAAI,EAE7C,IACE,IAAIklH,EAAQ76B,EAASpqF,GACjBklH,EAAOx8C,EAAOu8C,GAElB,IAAIjlH,IAAMklH,GAAQvjH,KAAK0F,KAAKrH,EAAIklH,GAAQllH,GAAK,QACvCilH,EAAMz/G,EAAI,GAAM,EAClB,OAAQy/G,EAAMtpH,EAAI,GAAM,EAAI,GAAK,GAAKgG,KAAKmN,KAAK/O,EAAGC,GAGvD,MAAO2V,IAQX,OAAIqyC,EAAO6kB,cAAgB9sE,GAAK,GAAKC,IAAM2gC,KAAY5gC,GAAK,GAAKA,EAAI,GAAKC,KAAM,KACvEyhC,KAGL,OAAUzhC,IAAMD,GAAK,GAAKioD,EAAO6kB,YAC5B69B,GAAU3qG,EAAGC,GAKhBD,EAAIA,EAAI,GAAKC,IAAM2gC,KAAY5gC,EAAIA,EAAI,GAAKC,KAAM,IAC7C,EAGF,IAAIy/B,EAAQ1/B,EAAG,GAAG+O,IAAI9O,EAAG,GAYpC,SAAS+kH,EAAUhlH,EAAGC,GACpB,KAAK,OAAUA,IAAMA,EAAI,EACvB,MAAM,IAAI3I,UAAU,mDAAqD2I,EAAI,KAI/E,IAAI6P,GAAI,SAAK9P,GAEb,GAAiB,IAAb8P,EAAElZ,OACJ,MAAM,IAAI0mC,MAAM,2CAA6CxtB,EAAElZ,OAAS,gBAG1E,GAAIkZ,EAAE,KAAOA,EAAE,GACb,MAAM,IAAIwtB,MAAM,sCAAwCxtB,EAAE,GAAK,IAAMA,EAAE,GAAK,KAM9E,IAHA,IAAI8hB,EAAMmrC,EAASjtD,EAAE,IAAIw1C,UACrBvD,EAAK/hD,EAEFC,GAAK,GACM,IAAP,EAAJA,KACH2xB,EAAM9oB,EAASi5C,EAAInwB,IAGrB3xB,IAAM,EACN8hD,EAAKj5C,EAASi5C,EAAIA,GAGpB,OAAOnwB,EAWT,SAASqzF,EAAWjlH,EAAGC,GACrB,OAAOuH,EAAOw9G,EAAUhlH,EAAEslD,UAAWrlD,QC9KrC,GAAO,SACP,GAAe,CAAC,QAAS,cAAe,SAAU,MAAO,eAClDmlH,IAA8B,QAAQ,GAAM,IAAez7D,IACpE,IAAI,MACF+1B,EAAK,YACL2d,EAAW,OACX71F,EAAM,IACNuH,EAAG,YACH4uF,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEke,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEye,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA0BF,OAAOA,EAAM,GAAM,CACjB,WAAY3wE,EACZ,6BAA8B,SAAkC/O,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAG8O,GAAK,IAEhC,4BAA6B,SAAiC/O,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG+O,GAAK,IAEhC,4BAA6B,SAAiC/O,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG8O,GAAK,IAEhC,2BAA4B,SAAgC/O,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG8O,IAE3B,eAAgB,SAAoB/O,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBChG/C,GAAO,kBACP,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,eACpD+/D,IAAuC,QAAQ,GAAM,IAAe17D,IAC7E,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,MACX7N,EAAK,YACLmO,GACEh0C,EACAgxD,EAAcpC,GAAkB,CAClC74B,UAEEg8B,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEEuhB,EAAcF,GAAkB,CAClCh/B,QACA2d,gBAEEwd,EAAcb,GAAkB,CAClCt6B,QACAie,gBAEEke,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkB2tB,GAClB,uBAAwBN,GACxB,6BAA8B,SAAkC/sG,EAAGC,GACjE,OAAO2+G,EAAY5+G,EAAGC,EAAG9D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO06G,EAAY36G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mCAAoC,SAAqCD,EAAGC,GAE1E,OAAIo9F,EAAYp9F,EAAG,GACVD,EAAE4oD,QAGJizD,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GAExE,OAAIo9F,EAAYp9F,EAAG,GACVD,EAAE4oD,QAGJmyD,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,mCAAoC,SAAqC6D,EAAGC,GAE1E,OAAIo9F,EAAYr9F,EAAG,GACVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpBwZ,EAAY56G,EAAGD,EAAG7D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GAExE,OAAIo9F,EAAYr9F,EAAG,GACVwvF,EAAMvvF,EAAE4d,OAAQ5d,EAAEohG,WAGpB0Z,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAE5D,OAAO9D,KAAKqL,EAAOxH,GAAIC,GAAGqlD,WAE5B,4BAA6B,SAA8BtlD,EAAGC,GAE5D,OAAO9D,KAAK6D,EAAGwH,EAAOvH,IAAIqlD,gB,WCnI5B,GAAO,iBACP,GAAe,CAAC,QAAS,WAClBggE,IAAsC,QAAQ,GAAM,IAAe37D,IAC5E,IAAI,MACF+1B,EAAK,QACLj6B,GACEkE,EACA47D,EAAkB9/D,EAAQy6B,WAAW,mBAsEzC,OAAOR,EAAM,GAAM,CACjB,WAAY,SAAgB1/E,EAAGC,GAC7B,IAEIuF,EAFAggH,GAAQ,QAAOxlH,GACfylH,GAAQ,QAAOxlH,GAGnB,KAAe,WAAVulH,GAAgC,cAAVA,GAAmC,aAAVA,GAAoC,WAAVC,GAAgC,cAAVA,GAAmC,aAAVA,GAG3H,MAAqB,OAFrBjgH,EAAIigD,EAAQzlD,EAAGC,IAETpE,WAEG2J,EAAI,EAAI,GAAK,EAEb8sD,GAAYkzD,EAAOC,GAK9B,GAAc,UAAVD,GAA+B,WAAVA,GAAgC,UAAVC,GAA+B,WAAVA,EAGlE,OAAU,KAFVjgH,EAAIkgH,EAAyBvpH,KAAM6D,EAAGC,IAG7BuF,EAEA8sD,GAAYkzD,EAAOC,GAK9B,GAAID,IAAUC,EACZ,OAAOnzD,GAAYkzD,EAAOC,GAG5B,GAAc,YAAVD,EACF,OAiKR,SAA+BxlH,EAAGC,GAChC,OAAID,EAAEmgC,GAAKlgC,EAAEkgC,GACJ,EAGLngC,EAAEmgC,GAAKlgC,EAAEkgC,IACH,EAGNngC,EAAEogC,GAAKngC,EAAEmgC,GACJ,EAGLpgC,EAAEogC,GAAKngC,EAAEmgC,IACH,EAGH,EAlLMulF,CAAsB3lH,EAAGC,GAGlC,GAAc,SAAVulH,EACF,OAAIxlH,EAAEuoG,UAAUtoG,GACP9D,KAAK6D,EAAE/G,MAAOgH,EAAEhH,OAIlB2sH,EAAczpH,KAAM6D,EAAE6lH,cAAe5lH,EAAE4lH,eAGhD,GAAc,YAAVL,EACF,OAAOD,EAAgBvlH,EAAGC,GAG5B,GAAc,WAAVulH,EACF,OAAOlzD,GAAYtyD,EAAGC,GAGxB,GAAc,WAAVulH,EACF,OAyGN,SAAwB11B,EAAgB9vF,EAAGC,GACzC,IAAI6lH,EAAQhuH,OAAO4G,KAAKsB,GACpB+lH,EAAQjuH,OAAO4G,KAAKuB,GAExB6lH,EAAM10E,KAAKkhB,IACXyzD,EAAM30E,KAAKkhB,IACX,IAAI9sD,EAAIogH,EAAc91B,EAAgBg2B,EAAOC,GAE7C,GAAU,IAANvgH,EACF,OAAOA,EAIT,IAAK,IAAI3O,EAAI,EAAGA,EAAIivH,EAAMlvH,OAAQC,IAAK,CACrC,IAAIkH,EAAI+xF,EAAe9vF,EAAE8lH,EAAMjvH,IAAKoJ,EAAE8lH,EAAMlvH,KAE5C,GAAU,IAANkH,EACF,OAAOA,EAIX,OAAO,EA9HIioH,CAAe7pH,KAAM6D,EAAGC,GAGjC,GAAc,SAAVulH,EACF,OAAO,EAGT,GAAc,cAAVA,EACF,OAAO,EAIT,MAAM,IAAIluH,UAAU,8BAAgCkuH,EAAQ,QAWhE,SAASE,EAAyB51B,EAAgB9vF,EAAGC,GACnD,OAAI,EAAAguE,EAAA,IAAejuE,KAAM,EAAAiuE,EAAA,IAAehuE,GAC/B2lH,EAAc91B,EAAgB9vF,EAAEulD,SAAS7sB,OAAQz4B,EAAEslD,SAAS7sB,SAGjE,EAAAu1C,EAAA,IAAejuE,GAEV0lH,EAAyB51B,EAAgB9vF,EAAE07F,UAAWz7F,IAG3D,EAAAguE,EAAA,IAAehuE,GAEVylH,EAAyB51B,EAAgB9vF,EAAGC,EAAEy7F,YAInD,EAAAztB,EAAA,IAAcjuE,GACT0lH,EAAyB51B,EAAgB9vF,EAAEulD,SAASroD,KAAM+C,IAG/D,EAAAguE,EAAA,IAAchuE,GACTylH,EAAyB51B,EAAgB9vF,EAAGC,EAAEslD,SAASroD,MAI3DnG,MAAMgD,QAAQiG,GAIdjJ,MAAMgD,QAAQkG,GAIZ2lH,EAAc91B,EAAgB9vF,EAAGC,GAH/BylH,EAAyB51B,EAAgB9vF,EAAG,CAACC,IAJ7CylH,EAAyB51B,EAAgB,CAAC9vF,GAAIC,GAsBzD,SAAS2lH,EAAc91B,EAAgB9vF,EAAGC,GAExC,IAAK,IAAIpJ,EAAI,EAAGylG,EAAK16F,KAAK+iB,IAAI3kB,EAAEpJ,OAAQqJ,EAAErJ,QAASC,EAAIylG,EAAIzlG,IAAK,CAC9D,IAAIkH,EAAI+xF,EAAe9vF,EAAEnJ,GAAIoJ,EAAEpJ,IAE/B,GAAU,IAANkH,EACF,OAAOA,EAKX,OAAIiC,EAAEpJ,OAASqJ,EAAErJ,OACR,EAGLoJ,EAAEpJ,OAASqJ,EAAErJ,QACP,EAIH,MCjOP,GAAO,YACP,GAAe,CAAC,QAAS,cAAe,UACjCqvH,IAAiC,QAAQ,GAAM,IAAet8D,IACvE,IAAI,MACF+1B,EAAK,YACLqQ,EAAW,OACXvwC,GACEmK,EA4BJ,OAAO+1B,EAAM,GAAM,CACjB,WAAY,SAAgB1/E,EAAGC,GAC7B,OAAOu/C,EAAOuwC,EAAY/vF,EAAGC,UC9B/B,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtCimH,IAAgC,QAAQ,GAAM,IAAev8D,IACtE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,YACNm2F,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA8BF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwB1/E,EAAGC,GAC7C,OAAOD,GAAKC,GAEd,iBAAkB,SAAsBD,EAAGC,GACzC,OAAOD,GAAKC,IAAK,QAAYD,EAAGC,EAAGgoD,EAAO4kB,UAE5C,uBAAwB,SAA4B7sE,EAAGC,GACrD,OAAOD,EAAEsgD,IAAIrgD,IAAM,GAAeD,EAAGC,EAAGgoD,EAAO4kB,UAEjD,qBAAsB,SAA0B7sE,EAAGC,GACjD,OAAyB,IAAlBD,EAAEylD,QAAQxlD,IAEnB,mBAAoB,WAClB,MAAM,IAAI3I,UAAU,wDAEtB,aAAc,SAAkB0I,EAAGC,GACjC,IAAKD,EAAEuoG,UAAUtoG,GACf,MAAM,IAAIq9B,MAAM,4CAGlB,OAAOnhC,KAAK6D,EAAE/G,MAAOgH,EAAEhH,QAEzB,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBC5H/C,GAAO,kBACP,GAAe,CAAC,QAAS,YAAa,QAAS,WACxC6gE,IAAuC,QAAQ,GAAM,IAAex8D,IAC7E,IAAI,MACF+1B,EAAK,UACL0R,EAAS,MACTnuF,EAAK,QACLwiD,GACEkE,EACAy8D,EAAM3gE,EAEN1sD,EAAO,CAACuM,EAAGC,KAAOkgD,EAAQngD,EAAGC,GAmCjC,OAAOm6E,EAAM,GAAM,CACjB,yBAA0B,SAA2B1/E,EAAG+kC,GACtD,OAAOshF,EAAiBrmH,EAAG+kC,EAAGqhF,IAEhC,iCAAkC,SAAiCpmH,EAAG+kC,EAAG0gB,GACvE,GAAgB,QAAZA,EACF,OAAO4gE,EAAiBrmH,EAAG+kC,EAAGqhF,GACzB,GAAgB,SAAZ3gE,EACT,OAAO4gE,EAAiBrmH,EAAG+kC,EAAGhsC,GAE9B,MAAM,IAAIukC,MAAM,2CAGpB,mCAAoC+oF,IAGtC,SAASA,EAAiBrmH,EAAG+kC,EAAG0gB,GAC9B,KAAK,OAAU1gB,IAAMA,EAAI,EACvB,MAAM,IAAIzH,MAAM,oCAGlB,IAAI,EAAA2wC,EAAA,IAASjuE,GAAI,CAGf,GAFWA,EAAE6d,OAEJjnB,OAAS,EAChB,MAAM,IAAI0mC,MAAM,2CAGlB,OAAOgpF,EAAYtmH,EAAEslD,UAAWvgB,EAAG0gB,GAGrC,GAAI1uD,MAAMgD,QAAQiG,GAChB,OAAOsmH,EAAYtmH,EAAG+kC,EAAG0gB,GAe7B,SAAS6gE,EAAY5vH,EAAKquC,EAAG0gB,GAC3B,GAAI1gB,GAAKruC,EAAIE,OACX,MAAM,IAAI0mC,MAAM,mBAIlB,IAAK,IAAIzmC,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9B,GAAIu6F,EAAU16F,EAAIG,KAAOoM,EAAMvM,EAAIG,IACjC,OAAOH,EAAIG,GAOf,IAHA,IAAI0E,EAAO,EACP84E,EAAK39E,EAAIE,OAAS,EAEf2E,EAAO84E,GAAI,CAKhB,IAJA,IAAI1rE,EAAIpN,EACJ2E,EAAIm0E,EACJkyC,EAAQ7vH,EAAIkL,KAAKgd,MAAMhd,KAAK8mD,UAAY2rB,EAAK94E,EAAO,IAAMA,GAEvDoN,EAAIzI,GAET,GAAIulD,EAAQ/uD,EAAIiS,GAAI49G,IAAU,EAAG,CAE/B,IAAIlmF,EAAM3pC,EAAIwJ,GACdxJ,EAAIwJ,GAAKxJ,EAAIiS,GACbjS,EAAIiS,GAAK03B,IACPngC,QAGAyI,EAKF88C,EAAQ/uD,EAAIiS,GAAI49G,GAAS,KACzB59G,EAIAo8B,GAAKp8B,EACP0rE,EAAK1rE,EAELpN,EAAOoN,EAAI,EAIf,OAAOjS,EAAIquC,OC1IX,GAAe,CAAC,wBACTyhF,IAAkC,QAFlC,QAEgD,IAAe78D,IACxE,IAAI,qBACFk0C,GACEl0C,EAsBJ,SAAS0yC,EAAMztE,GACb,KAAMzyB,gBAAgBkgG,GACpB,MAAM,IAAIj9D,YAAY,oDAGxBjjC,KAAKsqH,YAAc,GACnBtqH,KAAKuqH,WAAY,EAEjB,IAAK,IAAI7vH,EAAI,EAAGylG,EAAKngE,UAAUvlC,OAAQC,EAAIylG,EAAIzlG,IAAK,CAClD,IAAIopC,EAAM9D,UAAUtlC,GAEpB,IAAI,EAAAo3E,EAAA,IAAQhuC,GACV9jC,KAAKsqH,YAAY9rH,KAAKslC,GAEtB9jC,KAAKuqH,WAAY,OACZ,GAAI3vH,MAAMgD,QAAQkmC,KAAQ,EAAAguC,EAAA,IAAShuC,GAAM,CAE9C,IAAIj6B,EAAI2gH,EAAuB1mF,EAAIqlB,WAEnCnpD,KAAKsqH,YAAY9rH,KAAKqL,GAGtB,IAAI6X,EAAO7X,EAAE6X,OAEO,IAAhBA,EAAKjnB,QAA4B,IAAZinB,EAAK,KAC5B1hB,KAAKuqH,WAAY,QAEd,GAAmB,iBAARzmF,EAChB9jC,KAAKsqH,YAAY9rH,KAAKgsH,EAAuB,CAAC1mF,SACzC,IAAmB,iBAARA,EAIhB,MAAM,IAAI3oC,UAAU,gEAFpB6E,KAAKsqH,YAAY9rH,KAAKslC,KAe5B,SAAS0mF,EAAuB1mF,GAE9B,IAAK,IAAIppC,EAAI,EAAGmzC,EAAI/J,EAAIrpC,OAAQC,EAAImzC,EAAGnzC,IACrC,GAAsB,iBAAXopC,EAAIppC,MAAoB,OAAUopC,EAAIppC,IAC/C,MAAM,IAAIS,UAAU,qDAKxB,OAAO,IAAIumG,EAAqB59D,GAoNlC,OAhOAo8D,EAAMjkG,UAAUmE,KAAO,QACvB8/F,EAAMjkG,UAAU49D,SAAU,EAoB1BqmC,EAAMjkG,UAAUwwD,MAAQ,WACtB,IAAI3tB,EAAQ,IAAIohE,EAGhB,OAFAphE,EAAMwrF,aAAc,SAAMtqH,KAAKsqH,aAC/BxrF,EAAMyrF,UAAYvqH,KAAKuqH,UAChBzrF,GAWTohE,EAAM5iG,OAAS,SAAUm1B,GACvB,IAAIqM,EAAQ,IAAIohE,EAEhB,OADAA,EAAM9xC,MAAMtvB,EAAOrM,GACZqM,GASTohE,EAAMjkG,UAAUylB,KAAO,WAGrB,IAFA,IAAIA,EAAO,GAEFhnB,EAAI,EAAGylG,EAAKngG,KAAKsqH,YAAY7vH,OAAQC,EAAIylG,EAAIzlG,IAAK,CACzD,IAAI4O,EAAItJ,KAAKsqH,YAAY5vH,GACzBgnB,EAAKhnB,GAAkB,iBAAN4O,EAAiB,EAAIA,EAAEoY,OAAO,GAGjD,OAAOA,GASTw+E,EAAMjkG,UAAUysB,IAAM,WAGpB,IAFA,IAAI6T,EAAS,GAEJ7hC,EAAI,EAAGylG,EAAKngG,KAAKsqH,YAAY7vH,OAAQC,EAAIylG,EAAIzlG,IAAK,CACzD,IAAI83B,EAAQxyB,KAAKsqH,YAAY5vH,GAC7B6hC,EAAO7hC,GAAsB,iBAAV83B,EAAqBA,EAAQA,EAAM9J,MAGxD,OAAO6T,GAST2jE,EAAMjkG,UAAUusB,IAAM,WAGpB,IAFA,IAAI+T,EAAS,GAEJ7hC,EAAI,EAAGylG,EAAKngG,KAAKsqH,YAAY7vH,OAAQC,EAAIylG,EAAIzlG,IAAK,CACzD,IAAI83B,EAAQxyB,KAAKsqH,YAAY5vH,GAC7B6hC,EAAO7hC,GAAsB,iBAAV83B,EAAqBA,EAAQA,EAAMhK,MAGxD,OAAO+T,GAWT2jE,EAAMjkG,UAAU0F,QAAU,SAAUuS,GAClC,IAAK,IAAIxZ,EAAI,EAAGylG,EAAKngG,KAAKsqH,YAAY7vH,OAAQC,EAAIylG,EAAIzlG,IACpDwZ,EAASlU,KAAKsqH,YAAY5vH,GAAIA,EAAGsF,OAWrCkgG,EAAMjkG,UAAUstG,UAAY,SAAUvK,GACpC,OAAOh/F,KAAKsqH,YAAYtrB,IAAQ,MAQlCkB,EAAMjkG,UAAUsoF,iBAAmB,WACjC,OAAmC,IAA5BvkF,KAAKsqH,YAAY7vH,QAA+C,iBAAxBuF,KAAKsqH,YAAY,IASlEpqB,EAAMjkG,UAAUuoF,kBAAoB,WAClC,OAAOxkF,KAAKukF,mBAAqBvkF,KAAKsqH,YAAY,GAAK,MAYzDpqB,EAAMjkG,UAAUktG,SAAW,WACzB,OAAOnpG,KAAKuqH,WAUdrqB,EAAMjkG,UAAUsjG,QAAU,WAGxB,IAFA,IAAInmC,EAAQ,GAEH1+D,EAAI,EAAGylG,EAAKngG,KAAKsqH,YAAY7vH,OAAQC,EAAIylG,EAAIzlG,IAAK,CACzD,IAAI6uG,EAAYvpG,KAAKsqH,YAAY5vH,GACjC0+D,EAAM56D,KAA0B,iBAAd+qG,EAAyBA,EAAYA,EAAUhK,WAGnE,OAAOnmC,GAUT8mC,EAAMjkG,UAAUktD,QAAU+2C,EAAMjkG,UAAUsjG,QAO1CW,EAAMjkG,UAAUyD,SAAW,WAGzB,IAFA,IAAId,EAAU,GAELlE,EAAI,EAAGylG,EAAKngG,KAAKsqH,YAAY7vH,OAAQC,EAAIylG,EAAIzlG,IAAK,CACzD,IAAI6uG,EAAYvpG,KAAKsqH,YAAY5vH,GAER,iBAAd6uG,EACT3qG,EAAQJ,KAAKq+B,KAAKqC,UAAUqqE,IAE5B3qG,EAAQJ,KAAK+qG,EAAU7pG,YAI3B,MAAO,IAAMd,EAAQoqC,KAAK,MAAQ,KAUpCk3D,EAAMjkG,UAAUmtD,OAAS,WACvB,MAAO,CACLkqB,OAAQ,QACR4R,WAAYllF,KAAKsqH,cAYrBpqB,EAAM3sB,SAAW,SAAUzjB,GACzB,OAAOowC,EAAM5iG,OAAOwyD,EAAKo1B,aAGpBgb,IACN,CACDttB,SAAS,ICzSP,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,UAAW,aACvC63C,IAA6B,QAAQ,GAAM,IAAej9D,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNvoB,EACA8zD,UAAW8X,GACT3hD,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,GAAIA,GAAK,GAAKA,IAAM,GAAKioD,EAAO6kB,YAAa,CAC3C,IAAI+iC,EAAO,EAAI7vG,EAEf,GAAI6vG,EAAO,GAAK5nD,EAAO6kB,YACrB,OAAOijC,GAAY/vG,GAGrB,IAAIwhC,EAAM5/B,KAAKsE,KAAK2pG,EAAOA,EAAO,GAClC,OAAO,IAAInwE,EAAQ99B,KAAK49B,IAAIgC,EAAMquE,GAAOjuG,KAAKiF,IAGhD,OAAO,IAAI64B,EAAQ1/B,EAAG,GAAGm3E,SAE3Bz3C,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEm3E,SAEXqc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,GAAGshC,SAElC,iBAAkB,SAAqBthC,GACrC,OAAO,SAAQA,EAAG7D,YCrDpB,GAAe,CAAC,SACT0qH,IAA2B,QAF3B,MAEyC,IAAel9D,IACjE,IAAI,MACF+1B,GACE/1B,EAyBJ,OAAO+1B,EA9BE,MA8BU,CACjB/W,OAAQ/mE,KAAKgiD,IACblkB,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE4jD,OAEX4vC,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAE4jD,OAEX8+B,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,oCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GAErC,OAAO,SAAQA,EAAG7D,MAAM,SC/C1B,GAAO,gBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/D2qH,IAAqC,QAAQ,GAAM,IAAen9D,IAC3E,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJ2O,EAAM,eACNsjE,EAAc,MACduM,EAAK,YACLsB,GACEh0C,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,iCAAkC,SAAgCmT,EAAIk0B,GACpE,IAAI1hH,EAEJ,GAAuC,IAAnCmnB,EAAO3O,EAAKg1E,GAAK,IAAIwJ,EAAM,IAE7Bh3F,EAAS,OACJ,IAAuC,IAAnCmnB,EAAO3O,EAAKkpG,GAAK,IAAI1qB,EAAM,IAEpC,OAAO,SAAQxJ,EAAG6I,WAElB,IAGIsrB,EAHAC,GAAK,UAAS,SAAQlwH,MAAMgD,QAAQ84F,GAAMA,EAAKA,EAAG6I,WAAWtqD,KAAK0+C,IAClEo3B,GAAK,UAAS,SAAQnwH,MAAMgD,QAAQgtH,GAAMA,EAAKA,EAAGrrB,WAAWtqD,KAAK0+C,IACtEzqF,EAAS,GAGT,IAAK,IAAIxO,EAAI,EAAGA,EAAIowH,EAAGrwH,OAAQC,IAAK,CAClCmwH,GAAO,EAEP,IAAK,IAAI1hG,EAAI,EAAGA,EAAI4hG,EAAGtwH,OAAQ0uB,IAC7B,GAAiD,IAA7CwqE,EAAem3B,EAAGpwH,GAAGoC,MAAOiuH,EAAG5hG,GAAGrsB,QAAgBguH,EAAGpwH,GAAGojF,aAAeitC,EAAG5hG,GAAG20D,WAAY,CAE3F+sC,GAAO,EACP,MAICA,GACH3hH,EAAO1K,KAAKssH,EAAGpwH,KAMrB,OAAIE,MAAMgD,QAAQ84F,IAAO97F,MAAMgD,QAAQgtH,IAC9B,SAAW1hH,GAIb,IAAIs4F,GAAY,SAAWt4F,UCxEpC,GAAO,eACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/D8hH,IAAoC,QAAQ,GAAM,IAAex9D,IAC1E,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJ2O,EAAM,eACNsjE,EAAc,MACduM,EAAK,YACLsB,GACEh0C,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,iCAAkC,SAAgCmT,EAAIk0B,GACpE,IAAI1hH,EAEJ,GAAuC,IAAnCmnB,EAAO3O,EAAKg1E,GAAK,IAAIwJ,EAAM,KAAgD,IAAnC7vE,EAAO3O,EAAKkpG,GAAK,IAAI1qB,EAAM,IAErEh3F,EAAS,OACJ,CACL,IAAI4hH,GAAK,UAAS,SAAQlwH,MAAMgD,QAAQ84F,GAAMA,EAAKA,EAAG6I,WAAWtqD,KAAK0+C,IAClEo3B,GAAK,UAAS,SAAQnwH,MAAMgD,QAAQgtH,GAAMA,EAAKA,EAAGrrB,WAAWtqD,KAAK0+C,IACtEzqF,EAAS,GAET,IAAK,IAAIxO,EAAI,EAAGA,EAAIowH,EAAGrwH,OAAQC,IAC7B,IAAK,IAAIyuB,EAAI,EAAGA,EAAI4hG,EAAGtwH,OAAQ0uB,IAC7B,GAAiD,IAA7CwqE,EAAem3B,EAAGpwH,GAAGoC,MAAOiuH,EAAG5hG,GAAGrsB,QAAgBguH,EAAGpwH,GAAGojF,aAAeitC,EAAG5hG,GAAG20D,WAAY,CAE3F50E,EAAO1K,KAAKssH,EAAGpwH,IACf,OAOR,OAAIE,MAAMgD,QAAQ84F,IAAO97F,MAAMgD,QAAQgtH,IAC9B,SAAW1hH,GAIb,IAAIs4F,GAAY,SAAWt4F,UC9DpC,GAAO,kBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,SACtD+hH,IAAuC,QAAQ,GAAM,IAAez9D,IAC7E,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJ2O,EAAM,eACNsjE,EAAc,MACduM,GACE1yC,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,0DAA2D,SAAmD1iF,EAAGsI,GAC/G,GAAsC,IAAlCknB,EAAO3O,EAAKvY,GAAI,IAAI+2F,EAAM,IAE5B,OAAO,EAMT,IAHA,IAAI92F,GAAI,SAAQxO,MAAMgD,QAAQuL,GAAKA,EAAIA,EAAEo2F,WACrC7/D,EAAQ,EAEHhlC,EAAI,EAAGA,EAAI0O,EAAE3O,OAAQC,IACI,IAA5Bi5F,EAAevqF,EAAE1O,GAAImG,IACvB6+B,IAIJ,OAAOA,QChDT,GAAO,UACP,GAAe,CAAC,QAAS,kBAClBwrF,IAA+B,QAAQ,GAAM,IAAe19D,IACrE,IAAI,MACF+1B,EAAK,eACLoQ,GACEnmC,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAqBp6E,GACrC,OAAOvO,MAAMgD,QAAQuL,IAAK,SAAQA,GAAG1O,QAAS,SAAQ0O,EAAEo2F,WAAW9kG,QAErE,0BAA2B,SAA4B0O,EAAGoxF,GACxD,IAAe,IAAXA,GAAiC,IAAbpxF,EAAE1O,OACxB,OAAOG,MAAMgD,QAAQuL,IAAK,SAAQA,GAAG1O,QAAS,SAAQ0O,EAAEo2F,WAAW9kG,OAKnE,IAHA,IAAI2O,GAAI,SAAQxO,MAAMgD,QAAQuL,GAAKA,EAAIA,EAAEo2F,WAAWtqD,KAAK0+C,GACrDj0D,EAAQ,EAEHhlC,EAAI,EAAGA,EAAI0O,EAAE3O,OAAQC,IACW,IAAnCi5F,EAAevqF,EAAE1O,GAAI0O,EAAE1O,EAAI,KAC7BglC,IAIJ,OAAOA,QC5CX,GAAe,CAAC,QAAS,SAAU,OAC5ByrF,IAA6B,QAF7B,QAE2C,IAAe39D,IACnE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,IACNiP,GACEkzC,EA6BJ,OAAO+1B,EAAM,QAAS,CACpB3oF,MAAO,SAAqBiJ,GAE1B,OAAOunH,EAAY//G,EAAOxH,KAE5B49F,aA+CF,SAAsB53F,GAEpB,IAAI0yB,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KACRr3F,EAAO7X,EAAEm/F,MAETvd,EAAO/pE,EAAK,GACZmpF,EAAUnpF,EAAK,GAEnB,GAAI+pE,IAASof,EAAS,CAEpB,IAAI54D,EAAM,EAEV,GAAI1V,EAAO9hC,OAAS,EAElB,IAAK,IAAI0uB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAK3B,IAHA,IAAI+tB,EAAKgiE,EAAI/vF,GACTouB,EAAK2hE,EAAI/vF,EAAI,GAERyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE5B,IAAIluC,EAAIokC,EAAM8J,GAEd,GAAIluC,IAAMyuB,EAAG,CAEX8oB,EAAM33B,EAAI23B,EAAK1V,EAAOqM,IAEtB,MAGF,GAAIluC,EAAIyuB,EAEN,MAOR,OAAO8oB,EAGT,MAAM,IAAI8qE,WAAW,iCAAkC,SAAOr7F,GAAQ,MA1FtE8/E,YAAa4pB,EACblnC,IAAK,QAGP,SAASknC,EAAYvhH,GAEnB,IAAI6X,EAAO7X,EAAEm/F,MACTjoG,EAAO8I,EAAEk/F,MAEb,OAAQrnF,EAAKjnB,QACX,KAAK,EAEH,GAAgB,IAAZinB,EAAK,GAEP,OAAO,SAAM3gB,EAAK,IAGpB,MAAM,IAAIg8G,WAAW,iCAAkC,SAAOr7F,GAAQ,KAExE,KAAK,EAGD,IAAI+pE,EAAO/pE,EAAK,GAGhB,GAAI+pE,IAFO/pE,EAAK,GAEG,CAIjB,IAFA,IAAIuwB,EAAM,EAEDv3C,EAAI,EAAGA,EAAI+wF,EAAM/wF,IACxBu3C,EAAM33B,EAAI23B,EAAKlxC,EAAKrG,GAAGA,IAIzB,OAAOu3C,EAEP,MAAM,IAAI8qE,WAAW,iCAAkC,SAAOr7F,GAAQ,KAI5E,QAEE,MAAM,IAAIq7F,WAAW,0CAA2C,SAAOr7F,GAAQ,UClFnF,GAAe,CAAC,QAAS,MAAO,WAAY,kBAAmB,WACxD2pG,IAAmC,QAFnC,cAEiD,IAAe79D,IACzE,IAAI,MACF+1B,EAAK,IACLjpE,EAAG,SACH3N,EAAQ,gBACRqmF,EAAe,QACf1pC,GACEkE,EAkKJ,SAAS89D,EAAalyD,EAAOmyD,EAAM33E,GACjC,IAAI8mE,GAAO,SAAQthD,GACf5+D,EAAMkgH,EAAKjgH,OAEf,GAAY,IAARD,EACF,MAAM,IAAI2mC,MAAM,kDAGlB,IAAI,EAAA2wC,EAAA,IAASy5C,GAAO,CAClB,IAAIzS,EAASyS,GAAQ/wH,EAAM,GAEvBgxH,EAAY1S,EAAS,EAEzB,GAAkB,IAAd0S,EAAiB,CACnB,IAAI1uH,EAAQ82C,EAAS8mE,EAAK5B,GAAU9lB,EAAgB0nB,EAAM5B,GAE1D,OADA2S,EAAS3uH,GACFA,EAGT,IAEI4uH,EAEAC,EAJAC,EAAenmH,KAAKgd,MAAMq2F,GAM9B,GAAIllE,EACF83E,EAAQhR,EAAKkR,GACbD,EAASjR,EAAKkR,EAAe,OACxB,CACLD,EAAS34B,EAAgB0nB,EAAMkR,EAAe,GAE9CF,EAAQhR,EAAKkR,GAEb,IAAK,IAAIlxH,EAAI,EAAGA,EAAIkxH,IAAgBlxH,EAC9B4uD,EAAQoxD,EAAKhgH,GAAIgxH,GAAS,IAC5BA,EAAQhR,EAAKhgH,IAQnB,OAHA+wH,EAASC,GACTD,EAASE,GAEFrxG,EAAI3N,EAAS++G,EAAO,EAAIF,GAAY7+G,EAASg/G,EAAQH,IAI9D,IAAI1sF,EAAQysF,EAAK3oE,MAAMpoD,EAAM,GAE7B,GAAIskC,EAAMrqB,YAAa,CACrBqqB,EAAQA,EAAM2pB,WAEd,IAAIqiD,EAASl3D,EAAS8mE,EAAK57E,GAASk0D,EAAgB0nB,EAAM57E,GAG1D,OADA2sF,EAAS3gB,GACFA,EAGT,IAGIv4F,EACAoI,EAJA8xF,EAAc3tE,EAAMrc,QACpBopG,EAAW/sF,EAAM+E,MAAM4oE,GACvBqf,EAAoBrf,EAAYhkD,WAIpC,GAAI7U,EACFrhC,EAAOmoG,EAAKoR,GACZnxG,EAAQ+/F,EAAKoR,EAAoB,OAC5B,CACLnxG,EAAQq4E,EAAgB0nB,EAAMoR,EAAoB,GAElDv5G,EAAOmoG,EAAKoR,GAEZ,IAAK,IAAInR,EAAM,EAAGA,EAAMmR,IAAqBnR,EACvCrxD,EAAQoxD,EAAKC,GAAMpoG,GAAQ,IAC7BA,EAAOmoG,EAAKC,IAKlB8Q,EAASl5G,GACTk5G,EAAS9wG,GAET,IAAI0pC,EAAM,IAAIwnE,EAAStuH,YAAY,GACnC,OAAO+c,EAAI3N,EAAS4F,EAAM8xC,EAAIxgB,MAAMgoF,IAAYl/G,EAASgO,EAAOkxG,IAUlE,IAAIJ,EAAWloC,EAAM,CACnB,4BAA6B,SAA6B1/E,GACxD,OAAOA,KAGX,OAhOA,SAAqB9C,EAAMgrH,EAASn4E,GAClC,IAAIo4E,EAASC,EAAS5nE,EAEtB,GAAIrkB,UAAUvlC,OAAS,GAAKulC,UAAUvlC,OAAS,EAC7C,MAAM,IAAIwoC,YAAY,yDAGxB,IAAI,EAAA6uC,EAAA,IAAa/wE,GAAO,CAGtB,GAAsB,kBAFtB6yC,EAASA,IAAU,GAEc,CAG/B,GAFAq4E,EAAUlrH,EAAKooD,WAEX,EAAA2oB,EAAA,IAASi6C,GAAU,CACrB,GAAIA,EAAU,EACZ,MAAM,IAAI5qF,MAAM,+BAGlB,GAAI4qF,GAAW,EAEb,OAAOT,EAAaW,EAASF,EAASn4E,GAGxC,GAAIm4E,EAAU,EAAG,CAEf,KAAK,OAAUA,GACb,MAAM,IAAI5qF,MAAM,gCAGlB,IAAI+qF,EAAWH,EAAU,EACzBC,EAAU,IAAIpxH,MAAMmxH,GAEpB,IAAK,IAAIrxH,EAAI,EAAGA,EAAIqxH,GAClBC,EAAQtxH,GAAK4wH,EAAaW,IAAWvxH,EAAIwxH,EAAUt4E,GAGrD,OAAOo4E,GAIX,IAAI,EAAAl6C,EAAA,IAAYi6C,GAAU,CACxB,IAAI10B,EAAY00B,EAAQxuH,YAExB,GAAIwuH,EAAQjmE,aACV,MAAM,IAAI3kB,MAAM,+BAKlB,GAFAkjB,EAAM,IAAIgzC,EAAU,GAEhB00B,EAAQ3mE,IAAIf,GAEd,OAAO,IAAIgzC,EAAUi0B,EAAaW,EAASF,EAASn4E,IAGtD,GAAIm4E,EAAQ9nE,GAAGI,GAAM,CAEnB,IAAK0nE,EAAQt3G,YACX,MAAM,IAAI0sB,MAAM,gCAKlB,IAAIgrF,EAAOJ,EAAQtjE,WAEnB,GAAI0jE,EAAO,WACT,MAAM,IAAIhrF,MAAM,qFAGlB,IAAIirF,EAAY,IAAI/0B,EAAU80B,EAAO,GAErCH,EAAU,IAAIpxH,MAAMuxH,GAEpB,IAAK,IAAI9tH,EAAK,EAAGA,EAAK8tH,GACpBH,EAAQ3tH,GAAM,IAAIg5F,EAAUi0B,EAAaW,EAAS,IAAI50B,IAAYh5F,GAAIulD,IAAIwoE,GAAYx4E,IAGxF,OAAOo4E,GAIX,GAAIpxH,MAAMgD,QAAQmuH,GAAU,CAE1BC,EAAU,IAAIpxH,MAAMmxH,EAAQtxH,QAE5B,IAAK,IAAIyiG,EAAM,EAAGA,EAAM8uB,EAAQvxH,SAAUyiG,EAAK,CAC7C,IAAImvB,EAAWN,EAAQ7uB,GAEvB,IAAI,EAAAprB,EAAA,IAASu6C,IACX,GAAIA,EAAW,GAAKA,EAAW,EAC7B,MAAM,IAAIlrF,MAAM,sDAEb,MAAI,EAAA2wC,EAAA,IAAYu6C,GAOrB,MAAM,IAAIlxH,UAAU,uDAJpB,GAFAkpD,EAAM,IAAIgoE,EAAS9uH,YAAY,GAE3B8uH,EAASvmE,cAAgBumE,EAASpoE,GAAGI,GACvC,MAAM,IAAIljB,MAAM,kDAMpB6qF,EAAQ9uB,GAAOouB,EAAaW,EAASI,EAAUz4E,GAGjD,OAAOo4E,EAGT,MAAM,IAAI7wH,UAAU,uDAGtB,MAAM,IAAIA,UAAU,uDAGtB,MAAM,IAAIA,UAAU,2DC/JjB,SAASmxH,GAAY7sH,GAC1B,IAAIoE,EAEJ,IAAI,OAAUpE,GACZ,OAAIA,GAAK,EACA0gB,SAAS1gB,GAAKglC,IAAWc,IAG9B9lC,EAAI,IACCglC,IAGF2wE,GAAQ,EAAG31G,EAAI,GAGxB,GAAIA,EAAI,GACN,OAAOgG,KAAKiF,IAAMjF,KAAKg+B,IAAIh+B,KAAKiF,GAAKjL,GAAK6sH,GAAY,EAAI7sH,IAG5D,GAAIA,GAAK,OACP,OAAOglC,IAGT,GAAIhlC,EAAI,GAAM,CAEZ,IAAI8sH,EAAO9sH,EAAIA,EACX+sH,EAASD,EAAO9sH,EAChBgtH,EAAQD,EAAS/sH,EACjBitH,EAAQD,EAAQhtH,EACpB,OAAOgG,KAAKsE,KAAK,EAAItE,KAAKiF,GAAKjL,GAAKgG,KAAKmN,IAAInT,EAAIgG,KAAK6/B,EAAG7lC,IAAM,EAAI,GAAK,GAAKA,GAAK,GAAK,IAAM8sH,GAAQ,KAAO,MAAQC,GAAU,KAAO,QAAUC,GAAS,QAAU,UAAYC,GAAS,SAAW,YAAcA,EAAQjtH,MAGxNA,EACFoE,EAAI8oH,GAAO,GAEX,IAAK,IAAIjyH,EAAI,EAAGA,EAAIiyH,GAAOlyH,SAAUC,EACnCmJ,GAAK8oH,GAAOjyH,IAAM+E,EAAI/E,GAGxB,IAAIoQ,EAAIrL,EAAImtH,GAAS,GACrB,OAAOnnH,KAAKsE,KAAK,EAAItE,KAAKiF,IAAMjF,KAAKmN,IAAI9H,EAAGrL,EAAI,IAAOgG,KAAKq9B,KAAKh4B,GAAKjH,EAExEyoH,GAAYzoC,UAAY,SAEjB,IAAI+oC,GAAS,UACTD,GAAS,CAAC,kBAAwB,mBAAwB,kBAAuB,oBAAwB,kBAAwB,qBAA2B,sBAA4B,qBAA2B,sBAA4B,sBAA2B,uBAA4B,qBAA2B,sBAA4B,sBAA2B,uBC7C/X,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,iBAAkB,MAAO,YAAa,WAClEE,IAA6B,QAAQ,GAAM,IAAer/D,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,eACNq1C,EAAc,IACdvuF,EACAykF,UAAW8X,EACX5rE,QAASurE,GACPthD,EAyBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ8/C,GACR/oF,QAAS,SAAiB9jC,GACxB,GAAa,IAATA,EAAEwkC,GACJ,OAAOjkC,KAAKP,EAAEukC,IAGhBvkC,EAAI,IAAIqvG,EAASrvG,EAAEukC,GAAK,EAAGvkC,EAAEwkC,IAG7B,IAFA,IAAIpgC,EAAI,IAAIirG,EAAS6d,GAAO,GAAI,GAEvBjyH,EAAI,EAAGA,EAAIiyH,GAAOlyH,SAAUC,EAAG,CACtC,IAAIoyH,EAAOrtH,EAAEukC,GAAKtpC,EAEdqyH,EAAMD,EAAOA,EAAOrtH,EAAEwkC,GAAKxkC,EAAEwkC,GAErB,IAAR8oF,GACFlpH,EAAEmgC,IAAM2oF,GAAOjyH,GAAKoyH,EAAOC,EAC3BlpH,EAAEogC,KAAQ0oF,GAAOjyH,GAAK+E,EAAEwkC,GAAM8oF,GAE9BlpH,EAAEmgC,GAAK2oF,GAAOjyH,GAAK,GAAI,IAAY+pC,IAIvC,IAAI35B,EAAI,IAAIgkG,EAASrvG,EAAEukC,GAAK4oF,GAAS,GAAKntH,EAAEwkC,IACxC+oF,EAAYvnH,KAAKsE,KAAK,EAAItE,KAAKiF,IACnCjL,EAAEukC,IAAM,GACR,IAAI96B,EAAS0J,EAAI9H,EAAGrL,GAEF,IAAdyJ,EAAO+6B,GAET/6B,EAAO86B,IAAMgpF,GACU,IAAd9jH,EAAO86B,KAGhB96B,EAAO86B,IAAMgpF,GAFb9jH,EAAO+6B,IAAM+oF,GAMf,IAAIxgH,EAAI/G,KAAKq9B,KAAKh4B,EAAEk5B,IAIpB,OAFAl5B,EAAEk5B,GAAKx3B,EAAI/G,KAAK69B,KAAKx4B,EAAEm5B,IACvBn5B,EAAEm5B,GAAKz3B,EAAI/G,KAAKg+B,KAAK34B,EAAEm5B,IAChBk9D,EAAeA,EAAej4F,EAAQ4B,GAAIjH,IAEnDwzF,UAAW,SAAmB53F,GAC5B,GAAIA,EAAEgV,YACJ,OAAOhV,EAAEqmD,cAAgBrmD,EAAE4jD,SAAW,IAAI8rD,EAAW1qE,KAAYwoF,EAAaxtH,EAAEokC,MAAM,IAGxF,IAAKpkC,EAAE0gB,WACL,OAAO,IAAIgvF,EAAW1vG,EAAEqmD,aAAevgB,IAAMd,KAG/C,MAAM,IAAItD,MAAM,+BAElB,iBAAkB,SAAqB1hC,GACrC,OAAO,SAAQA,EAAGO,SAStB,SAASitH,EAAaxtH,GACpB,GAAIA,EAAI,EACN,OAAO,IAAI0vG,EAAW,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,IAAK,IAAK,MAAM1vG,IAGzD,IAAI8/C,EAAYuM,EAAOvM,WAAsC,EAAzB95C,KAAK49B,IAAI5jC,EAAEgpD,aAE3Cw3D,EAAM9Q,EAAW1iD,MAAM,CACzBlN,UAAWA,IAGb,GAAI9/C,EAAI,GAAM,EACZ,OAAOA,EAAEmjD,MAAMqqE,EAAa,IAAI9d,EAAW1vG,EAAI,KAOjD,IAJA,IAAI/B,EAAI+B,EACJmqD,EAAO,IAAIq2D,EAAIxgH,GACfwyC,EAAMxyC,EAAEgpD,WAEL/qD,EAAI,GAETu0C,GADAv0C,GAAK,EAELksD,EAAOA,EAAKhH,MAAM3Q,GAGpB,OAAO,IAAIk9D,EAAWvlD,EAAKd,YAAYqmD,EAAW5vD,gBC7HlD,GAAe,CAAC,QAAS,aAClB2tE,IAAiC,QAFjC,YAE+C,IAAe1/D,IACvE,IAAI,MACF+1B,EAAK,UACL8T,GACE7pC,EA2BJ,OAAO+1B,EAAM,YAAa,CACxB,GAAI,WACF,OAAO,IAAI8T,EAAU,IAEvB7qB,OAAQ,SAAgB3oE,GAEtB,OAAO,IAAIwzF,EAAUxzF,EAAI,KAE3B4/D,OAAQ,SAAgB5/D,GACtB,IAAI+oG,EAAsB/oG,EAAE8/B,MAAM,iCAElC,GAAIipE,EAAqB,CAEvB,IAAIlrF,EAAOkrF,EAAoB,GAC3BntG,EAAI43F,EAAUuV,EAAoB,IAClCugB,EAAa,IAAI91B,EAAU,GAAGzkF,IAAIjN,OAAO+b,IAE7C,GAAIjiB,EAAEwkD,GAAGkpE,EAAWxmE,IAAI,IACtB,MAAM,IAAI1jB,YAAY,WAAYf,OAAOr+B,EAAG,sBAG9C,IAAIupH,EAAmB,IAAI/1B,EAAU,GAAGzkF,IAAIjN,OAAO+b,GAAQ,GAE3D,OAAIjiB,EAAE0kD,IAAIipE,GACD3tH,EAAEknD,IAAIwmE,GAEN1tH,EAIX,OAAO,IAAI43F,EAAUxzF,IAEvBwzF,UAAW,SAAmBxzF,GAE5B,OAAOA,GAET0qD,SAAU,SAAkB1qD,GAC1B,OAAO,IAAIwzF,EAAUxzF,EAAEpE,GAAGmkD,IAAI//C,EAAEyF,GAAGs5C,MAAM/+C,EAAE8P,IAE7C20E,KAAM,SAAezkF,GACnB,OAAO,IAAIwzF,EAAU,IAEvB,iBAAkB,SAAqBxzF,GACrC,OAAO,SAAQA,EAAG7D,YCtEpB,GAAe,CAAC,QAAS,SAAU,eAC5BqtH,IAA2B,QAF3B,MAEyC,IAAe7/D,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,GACE1zC,EACA+xD,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEE4e,EAAcF,GAAkB,CAClCr8B,QACA2d,gBAEEwe,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAgCF,OAAOA,EAxDE,MAwDU,CACjB,iBAAkBuqB,GAClB,uBAmEF,SAAuB3kG,EAAGC,GACxB,IAAKD,EAAE08C,UAAYz8C,EAAEy8C,QACnB,MAAM,IAAI1kB,MAAM,sDAGlB,GAAIh4B,EAAEk6C,SACJ,OAAOl6C,EAGT,GAAIC,EAAEi6C,SACJ,OAAOj6C,EAOT,IAFA,IAAIwgD,EAAOzgD,EAAEy5C,MAAMx5C,IAEXA,EAAEi6C,UAAU,CAClB,IAAIv4C,EAAI1B,EACRA,EAAID,EAAE49C,IAAIj8C,GACV3B,EAAI2B,EAGN,OAAO8+C,EAAKhG,IAAIz6C,GAAGgC,OAzFnB,qBAAsB,SAA0BtH,EAAGC,GACjD,OAAOD,EAAEwuF,IAAIvuF,IAEf,6BAA8B,SAAkCD,EAAGC,GACjE,OAAOg8G,EAAYj8G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAY17G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,mCAAoC,SAAqCD,EAAGC,GAC1E,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,mCAAoC,SAAqC6D,EAAGC,GAC1E,OAAO47G,EAAY57G,EAAGD,EAAG7D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAA8B6D,EAAGC,GAE5D,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,4BAA6B,SAA8BtlD,EAAGC,GAE5D,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,WAG/C,mHAAoH,SAAwFhgD,EAAGC,EAAGizB,GAGhN,IAFA,IAAI5G,EAAMz1B,KAAKmJ,EAAGC,GAET1O,EAAI,EAAGA,EAAI2hC,EAAK5hC,OAAQC,IAC/B+6B,EAAMz1B,KAAKy1B,EAAK4G,EAAK3hC,IAGvB,OAAO+6B,QCjHT,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3C63F,IAA6B,QAAQ,GAAM,IAAe9/D,IACnE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,YACXM,GACEh0C,EACAgxD,EAAcpC,GAAkB,CAClC74B,UAEEk7B,EAActB,GAAkB,CAClC55B,QACA2d,gBAEEwd,EAAcb,GAAkB,CAClCt6B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA0BF,OAAOA,EAAM,GAAM,CACjB,iBAAkBwtB,GAClB,uBAAwBrB,GACxB,6BAA8B,SAAkC7rG,EAAGC,GACjE,OAAO26G,EAAY56G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO06G,EAAY16G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO06G,EAAY36G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO46G,EAAY76G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO46G,EAAY56G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCrG/C,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,kBAC5BokE,IAA4B,QAAQ,GAAM,IAAe//D,IAClE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,eACN81F,GACE3zC,EA6BJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAsB1/E,EAAGC,GACzC,OAAOuH,EAAOmiH,EAAM3pH,EAAE07F,UAAWz7F,EAAEy7F,aAErC,gBAAiB,SAAqB17F,EAAGC,GACvC,OAAOuH,EAAOmiH,EAAM3pH,EAAE07F,UAAWz7F,KAEnC,gBAAiB,SAAqBD,EAAGC,GACvC,OAAOuH,EAAOmiH,EAAM3pH,EAAGC,EAAEy7F,aAE3B,eAAgBiuB,IAUlB,SAASA,EAAMrkH,EAAGC,GAYhB,GAVuB,KAAnB,SAAKD,GAAG1O,SAEV0O,EAAI,CAACA,IAGgB,KAAnB,SAAKC,GAAG3O,SAEV2O,EAAI,CAACA,KAGH,SAAKD,GAAG1O,OAAS,IAAK,SAAK2O,GAAG3O,OAAS,EACzC,MAAM,IAAIsiH,WAAW,+EAAsFlgF,KAAKqC,UAAU/1B,EAAE1O,QAAU,SAAWoiC,KAAKqC,UAAU91B,EAAE3O,QAAU,KAG9K,IAAIqQ,EAAI,GACJ0B,EAAI,GACR,OAAOrD,EAAEwN,KAAI,SAAUxN,GACrB,OAAOC,EAAEuN,KAAI,SAAUvN,GAGrB,OAFAoD,EAAI,GACJ1B,EAAEtM,KAAKgO,GACArD,EAAEwN,KAAI,SAAU7S,GACrB,OAAOsF,EAAEuN,KAAI,SAAU9S,GACrB,OAAO2I,EAAEhO,KAAK2iG,EAAer9F,EAAGD,iBAIlCiH,MClFN,GAAe,CAAC,QAAS,UAClB2iH,IAAiC,QAFjC,YAE+C,IAAejgE,IACvE,IAAI,MACF+1B,EAAK,OACLl4E,GACEmiD,EAwBJ,OAAO+1B,EAAM,YAAa,CACxB3oF,MAAO,SAAeiJ,GAEpB,OAAO7D,KAAKqL,EAAOxH,IAAIslD,WAEzBo4C,OAAQ,SAAgB19F,GAEtB,IAEIwF,EAFAqY,EAAO7d,EAAE6d,OAIb,OAAQA,EAAKjnB,QACX,KAAK,EAEH4O,EAAIxF,EAAE4oD,QACN,MAEF,KAAK,EAGD,IAAIg/B,EAAO/pE,EAAK,GACZmpF,EAAUnpF,EAAK,GAEnB,GAAgB,IAAZmpF,EAEF,MAAM,IAAIkS,WAAW,wDAAyD,SAAOr7F,GAAQ,KAI/F,OAAQ7d,EAAEqhG,WACR,IAAK,QACH77F,EAuBd,SAAyBQ,EAAG4hF,EAAMof,GAOhC,IALA,IAGI6iB,EAHA3sH,EAAO8I,EAAEk/F,MAET4kB,EAAa,GAGRxkG,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAEhCukG,EAAgBC,EAAWxkG,GAAK,GAEhC,IAAK,IAAIzuB,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAExBgzH,EAAchzH,IAAK,SAAMqG,EAAKrG,GAAGyuB,IAKrC,OAAOtf,EAAEsgG,kBAAkB,CACzBppG,KAAM4sH,EACNjsG,KAAM,CAACmpF,EAASpf,GAChB0Z,SAAUt7F,EAAEo/F,YA5CE2kB,CAAgB/pH,EAAG4nF,EAAMof,GAC7B,MAEF,IAAK,SACHxhG,EA4Cd,SAA0BQ,EAAG4hF,EAAMof,GAYjC,IAVA,IAeIntG,EAAGmwC,EAAG1kB,EAfNoT,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KAERwE,EAAUhhF,EAAS,QAAKp+B,EACxBovB,EAAS,GACTiwF,EAAO,GAEPz5G,EAAI,GAECF,EAAI,EAAGA,EAAI4nF,EAAM5nF,IACxBE,EAAEF,GAAK,EAMT,IAAKnG,EAAI,EAAGmwC,EAAI/O,EAAMrkC,OAAQiD,EAAImwC,EAAGnwC,IAEnCqG,EAAE+6B,EAAMphC,MAMV,IAFA,IAAIu0C,EAAM,EAEDv3C,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAExB8iH,EAAKh/G,KAAKyzC,GAEVA,GAAOluC,EAAErJ,GAETqJ,EAAErJ,GAAK8iH,EAAK9iH,GAMd,IAFA8iH,EAAKh/G,KAAKyzC,GAEL9oB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAEvB,IAAK,IAAI+tB,EAAKgiE,EAAI/vF,GAAIouB,EAAK2hE,EAAI/vF,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAAK,CAE1D,IAAIoe,EAAIjjD,EAAE+6B,EAAM8J,MAEhBrb,EAAOy5B,GAAK79B,EAERoT,IACFghF,EAAQv2D,IAAK,SAAMzqB,EAAOqM,KAMhC,OAAO/+B,EAAEqwG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAACmpF,EAASpf,GAChB0Z,SAAUt7F,EAAEo/F,YAvGE4kB,CAAiBhqH,EAAG4nF,EAAMof,GAIpC,MAEF,QAEE,MAAM,IAAIkS,WAAW,sDAAuD,SAAO/8G,KAAKgpG,OAAS,KAGrG,OAAO3/F,GAGT66E,IAAK,SAAargF,GAChB,OAAO,SAAMA,SC/Ef,GAAe,CAAC,SAAU,aAAc,aACjCiqH,IAA+B,QAF/B,UAE6C,IAAetgE,IACrE,IACEgf,OAAQuhD,EAAO,UACftyC,EAAS,SACTyS,GACE1gC,EACAwgE,EAAkB,CACpBvqD,QAAQ,EACR+I,QAAQ,EACR6qB,WAAW,EACX9oC,UAAU,GAGR0/D,EAAmB,CACrBzhD,OAAQ3oE,GAAKkqH,EAAQlqH,GACrBwzF,UAAW5b,EAAY53E,GAAK43E,EAAU53E,GAAK,MAC3C0qD,SAAU2/B,EAAWrqF,GAAKqqF,EAASrqF,GAAK,OA+B1C,OAAO,SAAiB/G,EAAOoxH,GAC7B,IAAIC,GAAY,QAAOrxH,GAEvB,KAAMqxH,KAAaH,GACjB,MAAM,IAAI7yH,UAAU,kBAAoB2B,EAAQ,aAAeqxH,EAAY,4BAA8BxyH,OAAO4G,KAAKyrH,GAAiBhlF,KAAK,OAG7I,KAAMklF,KAAcD,GAClB,MAAM,IAAI9yH,UAAU,kBAAoB2B,EAAQ,aAAeoxH,EAAa,6BAA+BvyH,OAAO4G,KAAK0rH,GAAkBjlF,KAAK,OAGhJ,OAAIklF,IAAeC,EACVrxH,EAEAmxH,EAAiBC,GAAYpxH,OC1DtC,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,OACpDsxH,IAA2B,QAF3B,MAEyC,IAAe5gE,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,MACX7N,EAAK,IACLtb,GACEvqB,EACA+xD,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEE4e,EAAcF,GAAkB,CAClCr8B,QACA2d,gBAEEwe,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEyd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA+BF,OAAOA,EAzDE,MAyDU,CACjB,iBAAkBmuB,GAClB,mBAAoB,SAAwB7tG,EAAGC,GAC7C,QAAiB,IAATD,EAAEmgC,IAAqB,IAATngC,EAAEogC,IAAuB,IAATngC,EAAEkgC,IAAqB,IAATlgC,EAAEmgC,KAExD,uBAAwB,SAA4BpgC,EAAGC,GACrD,QAAQD,EAAEw/C,UAAav/C,EAAEu/C,UAAax/C,EAAEiD,SAAYhD,EAAEgD,UAExD,aAAc,SAAkBjD,EAAGC,GACjC,OAAO9D,KAAK6D,EAAE/G,OAAS,EAAGgH,EAAEhH,OAAS,IAEvC,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAOg8G,EAAYj8G,EAAGC,EAAG9D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAOy7G,EAAY17G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAE/C,OAAIi0E,EAAIj0E,GAECuvF,EAAMxvF,EAAE6d,OAAQ7d,EAAEqhG,WAGpBwa,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAE7C,OAAIi0E,EAAIj0E,GAECuvF,EAAMxvF,EAAE6d,OAAQ7d,EAAEqhG,WAGpB0Z,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAE/C,OAAIi0E,EAAIl0E,GAECwvF,EAAMxvF,EAAE6d,OAAQ7d,EAAEqhG,WAGpBwa,EAAY57G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAE7C,OAAIi0E,EAAIl0E,GAECwvF,EAAMxvF,EAAE6d,OAAQ7d,EAAEqhG,WAGpB0Z,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO9D,KAAKqL,EAAOxH,GAAIC,GAAGqlD,WAE5B,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,IAAIqlD,gBCrI5B,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,SAAU,eACtCklE,IAAiC,QAAQ,GAAM,IAAe7gE,IACvE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,YACNm2F,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA8BF,OAAOA,EAAM,GAAM,CACjB,mBAAoB,SAAwB1/E,EAAGC,GAC7C,OAAOD,GAAKC,GAEd,iBAAkB,SAAsBD,EAAGC,GACzC,OAAOD,GAAKC,IAAK,QAAYD,EAAGC,EAAGgoD,EAAO4kB,UAE5C,uBAAwB,SAA4B7sE,EAAGC,GACrD,OAAOD,EAAEuhD,IAAIthD,IAAM,GAAeD,EAAGC,EAAGgoD,EAAO4kB,UAEjD,qBAAsB,SAA0B7sE,EAAGC,GACjD,OAAwB,IAAjBD,EAAEylD,QAAQxlD,IAEnB,mBAAoB,WAClB,MAAM,IAAI3I,UAAU,wDAEtB,aAAc,SAAkB0I,EAAGC,GACjC,IAAKD,EAAEuoG,UAAUtoG,GACf,MAAM,IAAIq9B,MAAM,4CAGlB,OAAOnhC,KAAK6D,EAAE/G,MAAOgH,EAAEhH,QAEzB,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBC7H/C,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,UAAW,kBACvCmlE,IAA4B,QAAQ,GAAM,IAAe9gE,IAClE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,QACNi+C,EAAO,eACPqqC,GACEnmC,EACA+gE,EAAajlE,EAEbklE,EAAc,CAACrlH,EAAGC,KAAOkgD,EAAQngD,EAAGC,GAkCxC,OAAOm6E,EAAM,GAAM,CACjB3oF,MAAO,SAAeiJ,GAGpB,OAFA4qH,EAAe5qH,GAERA,EAAEoxC,KAAKs5E,IAEhBhtB,OAAQ,SAAgB19F,GAGtB,OAFA6qH,EAAgB7qH,GAETwH,EAAOxH,EAAE07F,UAAUtqD,KAAKs5E,GAAa1qH,EAAEqhG,YAEhD,kBAAmB,SAAuBrhG,EAAG8qH,GAG3C,OAFAF,EAAe5qH,GAERA,EAAEoxC,KAAK05E,IAEhB,mBAAoB,SAAwB9qH,EAAG8qH,GAG7C,OAFAD,EAAgB7qH,GAETwH,EAAOxH,EAAE07F,UAAUtqD,KAAK05E,GAAc9qH,EAAEqhG,YAEjD,gBAAiB,SAAqBrhG,EAAGwnC,GAGvC,OAFAojF,EAAe5qH,GAERA,EAAEoxC,KAAK05E,EAAYtjF,KAE5B,iBAAkB,SAAsBxnC,EAAGwnC,GAGzC,OAFAqjF,EAAgB7qH,GAETwH,EAAOxH,EAAE07F,UAAUtqD,KAAK05E,EAAYtjF,IAASxnC,EAAEqhG,cAS1D,SAASypB,EAAYtjF,GACnB,GAAc,QAAVA,EACF,OAAOkjF,EACF,GAAc,SAAVljF,EACT,OAAOmjF,EACF,GAAc,YAAVnjF,EACT,OAAOsoD,EAEP,MAAM,IAAIxyD,MAAM,+CAWpB,SAASstF,EAAer1D,GACtB,GAA2B,KAAvB,SAAKA,GAAO3+D,OACd,MAAM,IAAI0mC,MAAM,kCAWpB,SAASutF,EAAgBrjH,GACvB,GAA6B,IAAzBA,EAAOqW,OAAOjnB,OAChB,MAAM,IAAI0mC,MAAM,uCCnHlB,GAAe,CAAC,QAAS,aAClBytF,IAA2B,QAF3B,MAEyC,IAAephE,IACjE,IAAI,MACF+1B,EACA8T,UAAW8X,GACT3hD,EAuBJ,OAAO+1B,EA7BE,MA6BU,CACjB/W,OAAQunC,GACRxwE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEo3E,OAEXoc,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAW,GAAGvrD,IAAI//C,EAAE4jD,QAEjC8+B,KAAM,SAAc1iF,GAClB,IAAKA,EAAEq+F,QAAQr+F,EAAEtG,YAAYs3G,WAAWC,OACtC,MAAM,IAAI35G,UAAU,oCAGtB,OAAO6E,KAAK6D,EAAE/G,QAEhB,iBAAkB,SAAqB+G,GACrC,OAAO,SAAQA,EAAG7D,YC9CpB,GAAO,cACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/D6uH,IAAmC,QAAQ,GAAM,IAAerhE,IACzE,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJ2O,EAAM,eACNsjE,EAAc,MACduM,EAAK,YACLsB,GACEh0C,EAqBJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAqBp6E,GACrC,IAAID,EAEJ,GAAsC,IAAlCmnB,EAAO3O,EAAKvY,GAAI,IAAI+2F,EAAM,IAE5Bh3F,EAAS,OACJ,CACL,IAAIE,GAAI,SAAQxO,MAAMgD,QAAQuL,GAAKA,EAAIA,EAAEo2F,WAAWtqD,KAAK0+C,IACzDzqF,EAAS,IACF1K,KAAK4K,EAAE,IAEd,IAAK,IAAI1O,EAAI,EAAGA,EAAI0O,EAAE3O,OAAQC,IACW,IAAnCi5F,EAAevqF,EAAE1O,GAAI0O,EAAE1O,EAAI,KAC7BwO,EAAO1K,KAAK4K,EAAE1O,IAMpB,OAAIE,MAAMgD,QAAQuL,GACTD,EAIF,IAAIs4F,EAAYt4F,SCxDzB,GAAO,cACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,SACtD4lH,IAAmC,QAAQ,GAAM,IAAethE,IACzE,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJ2O,EAAM,eACNsjE,EAAc,MACduM,GACE1yC,EAqBJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAqBp6E,GACrC,GAAsC,IAAlCknB,EAAO3O,EAAKvY,GAAI,IAAI+2F,EAAM,IAE5B,MAAO,GAOT,IAJA,IAAI92F,GAAI,SAAQxO,MAAMgD,QAAQuL,GAAKA,EAAIA,EAAEo2F,WAAWtqD,KAAK0+C,GACrDzqF,EAAS,GACTsjE,EAAS,EAENA,EAAO9sE,SAAS,GAAGjF,QAAU2O,EAAE3O,QACpCyO,EAAO1K,KAAKuwH,EAAQ3lH,EAAGojE,EAAO9sE,SAAS,GAAG0zB,MAAM,IAAI6b,YACpDu9B,IAIF,OAiBJ,SAAepT,GAGb,IAFA,IAAIp0B,EAAO,GAEFtqC,EAAI0+D,EAAM3+D,OAAS,EAAGC,EAAI,EAAGA,IACpC,IAAK,IAAIyuB,EAAI,EAAGA,EAAIzuB,EAAGyuB,IACjBiwC,EAAMjwC,GAAG1uB,OAAS2+D,EAAMjwC,EAAI,GAAG1uB,SACjCuqC,EAAOo0B,EAAMjwC,GACbiwC,EAAMjwC,GAAKiwC,EAAMjwC,EAAI,GACrBiwC,EAAMjwC,EAAI,GAAK6b,GAKrB,OAAOo0B,EA9BE41D,CAAM9lH,MAIjB,SAAS6lH,EAAQ31D,EAAO61D,GAGtB,IAFA,IAAI/lH,EAAS,GAEJxO,EAAI,EAAGA,EAAIu0H,EAASx0H,OAAQC,IACf,MAAhBu0H,EAASv0H,IACXwO,EAAO1K,KAAK46D,EAAM1+D,IAItB,OAAOwO,MC5DP,GAAO,QACP,GAAe,CAAC,QAAS,SAClBgmH,IAA6B,QAAQ,GAAM,IAAe1hE,IACnE,IAAI,MACF+1B,EAAK,MACL2c,GACE1yC,EAmCJ,OAAO+1B,EAAM,GAAM,CACjB,0DAA2D,SAA+ClnD,GACxG,IAAI5J,EAAS4J,EAAK1lB,KAAI,SAAUmtB,GAC9B,OAAI,EAAAguC,EAAA,IAAYhuC,GACPA,EAAI2kB,WACF7tD,MAAMgD,QAAQkmC,KAAQ,EAAAguC,EAAA,IAAShuC,GACjCA,EAAIntB,KAAI,SAAUkX,GAEvB,OAAO,EAAAikD,EAAA,IAAYjkD,GAAQA,EAAK46B,WAAa56B,KAGxCiW,KAGPrO,EAAM,IAAIyqE,EAEd,OADAA,EAAM9xC,MAAM34B,EAAKhD,GACVgD,QCzDT,GAAO,YACP,GAAe,CAAC,QAAS,SAClB05F,IAAiC,QAAQ,GAAM,IAAe3hE,IACvE,IAAI,MACF+1B,EAAK,MACLlP,GACE7mB,EAwBJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB/sE,GACtB,GAAIA,EAAI,EACN,MAAM,IAAI0hC,MAAM,8BAGlB,OAAOkzC,EAAM50E,EAAI,IAEnB43F,UAAW,SAAmB53F,GAC5B,GAAIA,EAAEqmD,aACJ,MAAM,IAAI3kB,MAAM,8BAGlB,OAAOkzC,EAAM50E,EAAEmkC,KAAK,KAEtB,iBAAkB,SAAqBnkC,GACrC,OAAO,SAAQA,EAAGO,YC7CpB,GAAO,eACP,GAAe,CAAC,QAAS,aAClBovH,IAAoC,QAAQ,GAAM,IAAe5hE,IAC1E,IAAI,MACF+1B,EAAK,UACL7L,GACElqB,EA2BJ,OAAO+1B,EAAM,GAAM,CACjB,qBAAsB7L,EACtB,iBAAkB,SAAsBj4E,EAAGmpC,GACzC,KAAK,OAAUnpC,IAAMA,EAAI,EACvB,MAAM,IAAItE,UAAU,4DAGtB,KAAK,OAAUytC,IAAMA,EAAI,EACvB,MAAM,IAAIztC,UAAU,4DAGtB,GAAIytC,EAAInpC,EACN,MAAM,IAAItE,UAAU,oEAItB,OAAOi6G,GAAQ31G,EAAImpC,EAAI,EAAGnpC,IAE5B,uBAAwB,SAA4BA,EAAGmpC,GACrD,IAAI1/B,EAAQxO,EAEZ,IAAK,GAAkB+E,KAAO,GAAkBmpC,GAC9C,MAAM,IAAIztC,UAAU,4DAGtB,GAAIytC,EAAEqb,GAAGxkD,GACP,MAAM,IAAItE,UAAU,oEAMtB,IAFA+N,EADUzJ,EAAEioD,IAAI,GAAGptC,IAAI,GAGlB5f,EAAI+E,EAAEokC,MAAM+E,GAAGhF,KAAK,GAAIlpC,EAAE0qD,IAAI3lD,GAAI/E,EAAIA,EAAEkpC,KAAK,GAChD16B,EAASA,EAAO05C,MAAMloD,GAGxB,OAAOwO,QAWb,SAAS,GAAkBzJ,GACzB,OAAOA,EAAEgV,aAAehV,EAAE0kD,IAAI,GC5EhC,IACI,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,eAC/CkrE,IAA4B,QAF5B,OAE0C,IAAe7hE,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,MACNpmD,EAAK,OACL2F,EAAM,YACN61F,GACE1zC,EACAkyD,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEE0d,EAAcN,GAAkB,CAClC/6B,UAwCF,OAAOA,EAAM,OAAQ,CACnB/W,OAAQ,SAAgB3oE,GACtB,OAAI,QAAYA,EAAG6B,EAAM7B,GAAIioD,EAAO4kB,SAC3BhrE,EAAM7B,GAEN4pG,GAAW5pG,IAGtB,iBAAkB,SAAsBA,EAAGpE,GACzC,IAAI,QAAYoE,EAAG6B,EAAM7B,EAAGpE,GAAIqsD,EAAO4kB,SACrC,OAAOhrE,EAAM7B,EAAGpE,GAEhB,IAAK+sE,EAAQw5C,GAAY,GAAG9jF,OAAOr+B,EAAG,KAAKuvB,MAAM,KAC7ClqB,EAASzD,KAAKkd,KAAKhd,OAAO,GAAGu8B,OAAOsqC,EAAQ,KAAKtqC,OAAOv8B,OAAOqgH,GAAYvmH,KAE/E,OADC+sE,EAAQw5C,GAAY,GAAG9jF,OAAOh5B,EAAQ,KAAKkqB,MAAM,KAC3CztB,OAAO,GAAGu8B,OAAOsqC,EAAQ,KAAKtqC,OAAOv8B,OAAOqgH,GAAYvmH,KAGnE8jC,QAAS,SAAiB1/B,GACxB,OAAOA,EAAE8e,QAEX,kBAAmB,SAAuB9e,EAAGpE,GAC3C,OAAOoE,EAAE8e,KAAKljB,IAEhB43F,UAAW,SAAmBxzF,GAC5B,OAAI,GAAeA,EAAG6B,EAAM7B,GAAIioD,EAAO4kB,SAC9BhrE,EAAM7B,GAENA,EAAE8e,QAGb,uBAAwB,SAA4B9e,EAAGpE,GACrD,OAAI,GAAeoE,EAAG6B,EAAM7B,EAAGpE,GAAIqsD,EAAO4kB,SACjChrE,EAAM7B,EAAGpE,GAEToE,EAAEikD,gBAAgBroD,EAAEgpD,WAAY,eAG3C8F,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE8e,QAEX,mBAAoB,SAAwB9e,EAAGpE,GAC7C,OAAOoE,EAAE8e,KAAKljB,IAEhB,iBAAkB,SAAqBoE,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1B,yBAA0B,SAA2B6D,EAAGpE,GAEtD,OAAO,SAAQoE,GAAGnJ,GAAKsF,KAAKtF,EAAG+E,KAAI,IAErC,mCAAoC,SAAqCoE,EAAGC,GAC1E,OAAO47G,EAAY77G,EAAGC,EAAG9D,MAAM,IAEjC,kCAAmC,SAAoC6D,EAAGC,GACxE,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,sCAAuC,SAAqC6D,EAAGC,GAE7E,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCnH/C,GAAO,WACP,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,aAAc,eACtEmmE,IAAgC,QAAQ,GAAM,IAAe9hE,IACtE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,UACXG,EAAS,WACTxpB,EAAU,YACV2pB,GACEh0C,EAEAgxD,EAAcpC,GAAkB,CAClC74B,UAEEi8B,EAAcT,GAAkB,CAClCx7B,UAEEk8B,EAAcT,GAAkB,CAClCz7B,QACA2d,gBAEEwd,EAAcb,GAAkB,CAClCt6B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UAoCF,OAAOA,EAAM,GAAM,CACjB,iBAAkB,SAAsB1/E,EAAGC,GACzC,OAAOD,EAAIC,GAEb,mBAAoB,SAAwBD,EAAGC,GAC7C,OAAOD,EAAE8iD,IAAI7iD,IAEf,uBAAwB,SAA4BD,EAAGC,GACrD,OAAOD,EAAEggC,MAAM//B,IAEjB,qBAAsB,SAA0BD,EAAGC,GACjD,OAAOD,EAAE8iD,IAAI7iD,IAEf,aAAc,SAAkBD,EAAGC,GACjC,GAAgB,OAAZD,EAAE/G,MACJ,MAAM,IAAIqkC,MAAM,oDAGlB,GAAgB,OAAZr9B,EAAEhH,MACJ,MAAM,IAAIqkC,MAAM,oDAGlB,IAAKt9B,EAAEuoG,UAAUtoG,GACf,MAAM,IAAIq9B,MAAM,sBAGlB,IAAI1L,EAAM5xB,EAAE4oD,QAGZ,OAFAh3B,EAAI34B,MAAQkD,KAAKy1B,EAAI34B,MAAOgH,EAAEhH,OAC9B24B,EAAImzE,WAAY,EACTnzE,GAET,6BAA8B,SAAkC5xB,EAAGC,GAEjE,OADAyrH,GAAqB1rH,EAAGC,GACjB27G,EAAY57G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAE/D,OADAyrH,GAAqB1rH,EAAGC,GACjB07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAE/D,OADAyrH,GAAqB1rH,EAAGC,GACjB06G,EAAY36G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAE7D,OADAyrH,GAAqB1rH,EAAGC,GACjB66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO46G,EAAY76G,EAAGg0E,EAAW/zE,GAAIu9F,IAEvC,mBAAoB,SAAwBx9F,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,OAE3B,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO46G,EAAY56G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBAWnD,SAASomE,GAAqB1rH,EAAGC,GAC/B,IAAI4jH,EAAQ7jH,EAAE6d,OACVimG,EAAQ7jH,EAAE4d,OAEd,GAAIgmG,EAAMjtH,SAAWktH,EAAMltH,OACzB,MAAM,IAAI2uG,GAAA,EAAese,EAAMjtH,OAAQktH,EAAMltH,QCrKjD,IAAI,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,WAAY,YACxC+0H,IAA6B,QAAQ,GAAM,IAAehiE,IACnE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,SACNo+C,EAAQ,SACR98C,GACE6gD,EAmCJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAsB1/E,EAAGC,GACzC,OAAOuH,EAAOokH,EAAO5rH,EAAE07F,UAAWz7F,EAAEy7F,aAEtC,gBAAiB,SAAqB17F,EAAGC,GACvC,OAAOuH,EAAOokH,EAAO5rH,EAAE07F,UAAWz7F,KAEpC,gBAAiB,SAAqBD,EAAGC,GACvC,OAAOuH,EAAOokH,EAAO5rH,EAAGC,EAAEy7F,aAE5B,eAAgBkwB,IAUlB,SAASA,EAAO5rH,EAAGC,GACjB,IAAI4rH,EAAmBjqH,KAAKijB,KAAI,SAAU7kB,GAAGpJ,QAAQ,SAAUqJ,GAAGrJ,QAClEoJ,GAAI,SAAQA,GACZC,GAAI,SAAQA,GACZ,IAAI4hH,GAAQ,SAAU7hH,GAClB8hH,GAAQ,SAAU7hH,GAEtB,GAAqB,IAAjB4hH,EAAMjrH,QAAiC,IAAjBkrH,EAAMlrH,QAA6B,IAAbirH,EAAM,IAAyB,IAAbC,EAAM,GACtE,MAAM,IAAI5I,WAAW,6CAAoD2I,EAAM18E,KAAK,MAAQ,WAAa28E,EAAM38E,KAAK,MAAQ,MAG9H,IAAIosE,EAAU,CAAC3rD,EAAS98C,EAAS9I,EAAE,GAAIC,EAAE,IAAK6I,EAAS9I,EAAE,GAAIC,EAAE,KAAM2lD,EAAS98C,EAAS9I,EAAE,GAAIC,EAAE,IAAK6I,EAAS9I,EAAE,GAAIC,EAAE,KAAM2lD,EAAS98C,EAAS9I,EAAE,GAAIC,EAAE,IAAK6I,EAAS9I,EAAE,GAAIC,EAAE,MAE3K,OAAI4rH,EAAmB,EACd,CAACta,GAEDA,M,WC9ET,GAAO,OACP,GAAe,CAAC,QAAS,SAAU,iBAAkB,WAC9Cua,IAA4B,QAAQ,GAAM,IAAeniE,IAClE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,eACNq1C,EAAc,QACd5lB,GACE/tB,EA2BJ,OAAO+1B,EAAM,GAAM,CAEjB,iBAAkBqsC,EAElB,qCAAsC,SAAoCx2D,EAAO4lC,GAE/E,MAAM,IAAI79D,MAAM,sCAGlB,MAAO,SAAW9E,GAChB,OAAOuzF,EAAMvzF,MAUjB,SAASuzF,EAAMx2D,GACb,IAAIxP,EAaJ,IAZA,SAAYwP,GAAO,SAAUt8D,GAC3B,IACE8sD,OAAgBzrD,IAATyrD,EAAqB9sD,EAAQqkG,EAAev3C,EAAM9sD,GACzD,MAAO2B,GACP,MAAM,EAAAoxH,GAAA,GAAoBpxH,EAAK,OAAQ3B,OAIvB,iBAAT8sD,IACTA,EAAO2xB,EAAQ3xB,EAAMkC,EAAO0gB,cAGjBruE,IAATyrD,EACF,MAAM,IAAIzoB,MAAM,2CAGlB,OAAOyoB,MCtEP,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,cAAe,eAC3CkmE,IAA6B,QAAQ,GAAM,IAAetiE,IACnE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,YACXM,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA+CF,OAAOA,EAAM,GAAM,CACjB,WAAY,SAAgB1/E,EAAGC,GAE7B,OAAU,OAAND,EACW,OAANC,EAGC,OAANA,EACW,OAAND,OAGC1F,IAAN0F,OACW1F,IAAN2F,OAGC3F,IAAN2F,OACW3F,IAAN0F,EAGFq9F,EAAYr9F,EAAGC,IAExB,6BAA8B,SAAkCD,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAGo9F,IAE3B,4BAA6B,SAAiCr9F,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAGq9F,GAAa,IAExC,4BAA6B,SAAiCr9F,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAGo9F,GAAa,IAExC,2BAA4B,SAAgCr9F,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAGo9F,IAE3B,eAAgB,SAAoBr9F,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAGo9F,GAAa,IAExC,mBAAoB,SAAwBr9F,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAGo9F,GAAa,IAExC,oBAAqB,SAAyBr9F,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAGq9F,GAAa,IAExC,mBAAoB,SAAwBr9F,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAGq9F,GAAa,IAExC,aAAc,SAAkBr9F,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAGo9F,GAAa,GAAO/3C,WAEvD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAGq9F,GAAa,GAAM/3C,gBC1ItD,KD8I2B,QAAQ,GAAM,CAAC,QAAS,gBAAiBi6C,IACtE,IAAI,MACF7f,EAAK,YACL2d,GACEkC,EACJ,OAAO7f,EAAM,GAAM,CACjB,WAAY,SAAgB1/E,EAAGC,GAE7B,OAAU,OAAND,EACW,OAANC,EAGC,OAANA,EACW,OAAND,OAGC1F,IAAN0F,OACW1F,IAAN2F,OAGC3F,IAAN2F,OACW3F,IAAN0F,EAGFq9F,EAAYr9F,EAAGC,SCtKjB,gBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,eAC/DisH,IAAoC,QAAQ,GAAM,IAAeviE,IAC1E,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJ2O,EAAM,eACNsjE,EAAc,MACduM,EAAK,YACLsB,GACEh0C,EAsBJ,OAAO+1B,EAAM,GAAM,CACjB,iCAAkC,SAAgCmT,EAAIk0B,GACpE,IAAI1hH,EAAS,GAEb,GAAuC,IAAnCmnB,EAAO3O,EAAKg1E,GAAK,IAAIwJ,EAAM,KAAgD,IAAnC7vE,EAAO3O,EAAKkpG,GAAK,IAAI1qB,EAAM,IAAW,CAEhF,IAAI4qB,GAAK,SAAQlwH,MAAMgD,QAAQ84F,GAAMA,EAAKA,EAAG6I,WAAWtqD,KAAK0+C,GACzDo3B,GAAK,SAAQnwH,MAAMgD,QAAQgtH,GAAMA,EAAKA,EAAGrrB,WAAWtqD,KAAK0+C,GAC7DzqF,EAAS,GAET,IAAK,IAAIxO,EAAI,EAAGA,EAAIowH,EAAGrwH,OAAQC,IAC7B,IAAK,IAAIyuB,EAAI,EAAGA,EAAI4hG,EAAGtwH,OAAQ0uB,IAC7BjgB,EAAO1K,KAAK,CAACssH,EAAGpwH,GAAIqwH,EAAG5hG,KAM7B,OAAIvuB,MAAMgD,QAAQ84F,IAAO97F,MAAMgD,QAAQgtH,GAC9B1hH,EAIF,IAAIs4F,EAAYt4F,SCvDzB,GAAO,mBACP,GAAe,CAAC,QAAS,OAAQ,SAAU,SAAU,gBAAiB,SAC/D8mH,IAAwC,QAAQ,GAAM,IAAexiE,IAC9E,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJwgB,EAAM,OACN7R,EAAM,cACN2jE,EAAa,MACbkM,GACE1yC,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,iCAAkC,SAAgCmT,EAAIk0B,GACpE,GAAuC,IAAnCv6F,EAAO3O,EAAKg1E,GAAK,IAAIwJ,EAAM,IAE7B,OAAO,SAAQ0qB,GACV,GAAuC,IAAnCv6F,EAAO3O,EAAKkpG,GAAK,IAAI1qB,EAAM,IACpC,OAAO,SAAQxJ,GAGjB,IAAIo0B,GAAK,SAAQp0B,GACbq0B,GAAK,SAAQH,GACjB,OAAO1oF,EAAO8xD,EAAc82B,EAAIC,GAAK/2B,EAAc+2B,EAAID,UC1CzD,GAAe,CAAC,QAAS,UAAW,SAAU,OAAQ,SAC/CmF,IAA2B,QAF3B,MAEyC,IAAeziE,IACjE,IAAI,MACF+1B,EACAhgD,QAASurE,EAAQ,OACjBzjG,EAAM,KACNsX,EAAI,MACJF,GACE+qC,EACAoxD,EAAcN,GAAkB,CAClC/6B,UAsCF,OAAOA,EAAM,MAAO,CAClB/W,OAAQ,SAAgB3oE,GACtB,OAAOA,EAAI,EAAI4e,EAAM5e,GAAK8e,EAAK9e,IAEjC,6BAA8B,SAA+BA,EAAGpE,GAC9D,OAAOoE,EAAI,EAAI4e,EAAM5e,EAAGpE,GAAKkjB,EAAK9e,EAAGpE,IAEvC8jC,QAAS,SAAiB1/B,GACxB,OAAO,IAAIirG,EAASjrG,EAAEmgC,GAAK,EAAIv+B,KAAKgd,MAAM5e,EAAEmgC,IAAMv+B,KAAKkd,KAAK9e,EAAEmgC,IAAKngC,EAAEogC,GAAK,EAAIx+B,KAAKgd,MAAM5e,EAAEogC,IAAMx+B,KAAKkd,KAAK9e,EAAEogC,MAE/G,8BAA+B,SAAgCpgC,EAAGpE,GAChE,OAAO,IAAIqvG,EAASjrG,EAAEmgC,GAAK,EAAIvhB,EAAM5e,EAAEmgC,GAAIvkC,GAAKkjB,EAAK9e,EAAEmgC,GAAIvkC,GAAIoE,EAAEogC,GAAK,EAAIxhB,EAAM5e,EAAEogC,GAAIxkC,GAAKkjB,EAAK9e,EAAEogC,GAAIxkC,KAExG43F,UAAW,SAAmBxzF,GAC5B,OAAOA,EAAEiiD,aAAenjC,EAAK9e,GAAK4e,EAAM5e,IAE1C,gCAAiC,SAAkCA,EAAGpE,GACpE,OAAOoE,EAAEiiD,aAAenjC,EAAK9e,EAAGpE,GAAKgjB,EAAM5e,EAAGpE,IAEhD8uD,SAAU,SAAkB1qD,GAC1B,OAAOA,EAAE8P,EAAI,EAAI9P,EAAE8e,OAAS9e,EAAE4e,SAEhC,+BAAgC,SAAiC5e,EAAGpE,GAClE,OAAOoE,EAAE8P,EAAI,EAAI9P,EAAE8e,KAAKljB,GAAKoE,EAAE4e,MAAMhjB,IAEvC,iBAAkB,SAAqBoE,GAErC,OAAO,SAAQA,EAAG7D,MAAM,IAE1B,qCAAsC,SAAoC6D,EAAGpE,GAE3E,OAAO,SAAQoE,GAAGnJ,GAAKsF,KAAKtF,EAAG+E,KAAI,IAErC,sCAAuC,SAAqCoE,EAAGC,GAE7E,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBCtF/C,GAAO,aACP,GAAe,CAAC,QAAS,YAAa,QAC/B+mE,IAAkC,QAAQ,GAAM,IAAe1iE,IACxE,IAAI,MACF+1B,EAAK,UACL/L,EAAS,KACTuC,GACEvsB,EAwBJ,OAAO+1B,EAAM,GAAM,CACjBW,IAAK,SAAargF,GAChB,OAAOk2E,EAAKvC,EAAU3zE,UCjCxB,GAAO,YACP,GAAe,CAAC,QAAS,SAClBssH,IAAiC,QAAQ,GAAM,IAAe3iE,IACvE,IAAI,MACF+1B,EAAK,MACLjL,GACE9qB,EA+BJ,OAAO+1B,EAAM,GAAM,CACjB,WAAY,SAAgB1/E,EAAGC,GAC7B,OAAOssH,EAAWvsH,EAAEslD,UAAWrlD,EAAEqlD,cAUrC,SAASinE,EAAWvsH,EAAGC,GACrB,GAAIlJ,MAAMgD,QAAQiG,GAAI,CACpB,GAAIjJ,MAAMgD,QAAQkG,GAAI,CACpB,IAAItJ,EAAMqJ,EAAEpJ,OAEZ,GAAID,IAAQsJ,EAAErJ,OACZ,OAAO,EAGT,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAKE,IACvB,IAAK01H,EAAWvsH,EAAEnJ,GAAIoJ,EAAEpJ,IACtB,OAAO,EAIX,OAAO,EAEP,OAAO,EAGT,OAAIE,MAAMgD,QAAQkG,IAGTw0E,EAAMz0E,EAAGC,OCvEpB,GAAO,cACP,GAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,SACtDusH,IAAmC,QAAQ,GAAM,IAAe7iE,IACzE,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJ2O,EAAM,eACNsjE,EAAc,MACduM,GACE1yC,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,iCAAkC,SAAgCmT,EAAIk0B,GACpE,GAAuC,IAAnCv6F,EAAO3O,EAAKg1E,GAAK,IAAIwJ,EAAM,IAE7B,OAAO,EACF,GAAuC,IAAnC7vE,EAAO3O,EAAKkpG,GAAK,IAAI1qB,EAAM,IAEpC,OAAO,EAOT,IAJA,IAEI2qB,EAFAC,GAAK,UAAS,SAAQlwH,MAAMgD,QAAQ84F,GAAMA,EAAKA,EAAG6I,WAAWtqD,KAAK0+C,IAClEo3B,GAAK,UAAS,SAAQnwH,MAAMgD,QAAQgtH,GAAMA,EAAKA,EAAGrrB,WAAWtqD,KAAK0+C,IAG7Dj5F,EAAI,EAAGA,EAAIowH,EAAGrwH,OAAQC,IAAK,CAClCmwH,GAAO,EAEP,IAAK,IAAI1hG,EAAI,EAAGA,EAAI4hG,EAAGtwH,OAAQ0uB,IAC7B,GAAiD,IAA7CwqE,EAAem3B,EAAGpwH,GAAGoC,MAAOiuH,EAAG5hG,GAAGrsB,QAAgBguH,EAAGpwH,GAAGojF,aAAeitC,EAAG5hG,GAAG20D,WAAY,CAE3F+sC,GAAO,EACP,MAIJ,IAAa,IAATA,EACF,OAAO,EAIX,OAAO,QCxDT,GAAe,CAAC,QAAS,SAAU,eAC5ByF,IAA2B,QAF3B,MAEyC,IAAe9iE,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACNm2F,GACEh0C,EACAgyD,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEme,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA+BF,OAAOA,EAtDE,MAsDU,CACjB,iBAAkBkuB,GAClB,mBAAoB,SAAwB5tG,EAAGC,GAC7C,OAAiB,IAATD,EAAEmgC,IAAqB,IAATngC,EAAEogC,MAAwB,IAATngC,EAAEkgC,IAAqB,IAATlgC,EAAEmgC,KAEzD,uBAAwB,SAA4BpgC,EAAGC,GACrD,QAASD,EAAEw/C,WAAax/C,EAAEiD,YAAehD,EAAEu/C,WAAav/C,EAAEgD,UAE5D,aAAc,SAAkBjD,EAAGC,GACjC,OAAO9D,KAAK6D,EAAE/G,OAAS,EAAGgH,EAAEhH,OAAS,IAEvC,6BAA8B,SAAkC+G,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAG9D,OAE3B,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY17G,EAAGD,EAAG7D,MAAM,IAEjC,4BAA6B,SAAiC6D,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAG9D,MAAM,IAEjC,2BAA4B,SAAgC6D,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAG9D,OAE3B,eAAgB,SAAoB6D,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO67G,EAAY97G,EAAGC,EAAG9D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAG9D,MAAM,IAEjC,oBAAqB,SAAyB6D,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAG7D,MAAM,IAEjC,mBAAoB,SAAwB6D,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAG7D,MAAM,IAEjC,aAAc,SAAkB6D,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAG9D,MAAM,GAAOmpD,WAEhD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAG7D,MAAM,GAAMmpD,gBChH/C,GAAO,eACP,GAAe,CAAC,QAAS,WAClBonE,IAAoC,QAAQ,GAAM,IAAe/iE,IAC1E,IAAI,MACF+1B,EAAK,QACLhI,GACE/tB,EAcJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAsB1/E,EAAGC,GACzC,OAAOD,EAAIC,GAEb,mBAAoB,SAAwBD,EAAGC,GAC7C,OAAOD,EAAE+/C,IAAI9/C,IAEf,uBAAwB,SAA4BD,EAAGC,GACrD,OAAOD,EAAE+/C,IAAI9/C,IAEf,qBAAsB,SAA0BD,EAAGC,GACjD,OAAOD,EAAE+/C,IAAI9/C,IAEf,sCAAuC,SAAqCD,EAAGC,GAC7E,IAAI2xB,EAAM5xB,EAAE4oD,QAERpI,EAAMk3B,EAAQ,GAAG,QAAOz3E,IAE5B,OADA2xB,EAAI34B,MAAQkD,KAAmB,OAAdy1B,EAAI34B,MAAiB24B,EAAIw5E,WAAW5qD,GAAO5uB,EAAI34B,MAAOgH,GAChE2xB,GAET,sCAAuC,SAAqC5xB,EAAGC,GAC7E,IAAI2xB,EAAM3xB,EAAE2oD,QACZh3B,EAAMA,EAAI7iB,KAAK,GAEf,IAAIyxC,EAAMk3B,EAAQ,GAAG,QAAO13E,IAE5B,OADA4xB,EAAI34B,MAAQkD,KAAK6D,EAAe,OAAZC,EAAEhH,MAAiBgH,EAAEmrG,WAAW5qD,GAAOvgD,EAAEhH,OACtD24B,GAET,aAAc,SAAkB5xB,EAAGC,GACjC,OAAOD,EAAE0/C,OAAOz/C,SClDlB,GAAO,WACP,GAAe,CAAC,SAAU,QAAS,eAAgB,WAC5C0sH,IAAgC,QAAQ,GAAM,IAAehjE,IACtE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,aACNw1C,EAAY,QACZ/9D,GACEiqB,EAQAijE,EAAwB,CAAC,SAAiBt6G,GAC5C,OAAO,IAAIotB,EAAQptB,EAAK,IACvB,SAAiBA,GAClB,OAAO,IAAIotB,EAAQ,EAAGptB,IACrB,SAAiBA,GAClB,OAAO,IAAIotB,GAASptB,EAAK,IACxB,SAAiBA,GAClB,OAAO,IAAIotB,EAAQ,GAAIptB,KASzB,SAASu6G,EAAiBvnH,EAAGy5B,GAC3B,GAAIA,EAAO,EAAG,MAAM,IAAIzB,MAAM,kCAC9B,GAAa,IAATyB,EAAY,MAAM,IAAIzB,MAAM,yBAChC,GAAIyB,EAAO,GAAM,EAAG,MAAM,IAAIzB,MAAM,2BACpC,GAAU,IAANh4B,GAAuB,IAAZA,EAAEgC,MAAa,MAAO,CAAC,IAAIo4B,EAAQ,EAAG,IACrD,IACIrP,EADAy8F,EAA0B,iBAANxnH,GAGpBwnH,GAAuB,IAATxnH,EAAE66B,IAAqB,IAAT76B,EAAE86B,MAE9B/P,EADEy8F,EACO,IAAMxnH,EAAI,GACD,IAATA,EAAE86B,GACF,IAAM96B,EAAE66B,GAAK,GAEb,IAAM76B,EAAE86B,GAAK,GAAK,GAS/B,IALA,IAAIH,EAAM36B,EAAE26B,MACR34B,EAAMhC,EAAEgC,MACRylH,EAAQ,GACRpkH,EAAI/G,KAAKmN,IAAIzH,EAAK,EAAIy3B,GAEjBgG,EAAI,EAAGA,EAAIhG,EAAMgG,IAAK,CAC7B,IAAIioF,GAAgB38F,EAAS,EAAI0U,GAAKhG,EAMlCiuF,IAAiBprH,KAAKC,MAAMmrH,GAKhCD,EAAMpyH,KAAK,IAAI+kC,EAAQ,CACrB/2B,EAAGA,EACHkqE,KAAM5yC,EAAM,EAAIr+B,KAAKiF,GAAKk+B,GAAKhG,KAN/BguF,EAAMpyH,KAAKiyH,EAAsBI,EAAe,GAAGrkH,IAUvD,OAAOokH,EAoCT,OAAOrtC,EAAM,GAAM,CACjBhgD,QAAS,SAAiB1/B,GACxB,OAAO6sH,EAAiB7sH,EAAG,IAE7B,kBAAmB6sH,OC/GhB,SAASI,GAAsBtjE,GACpC,IAAI,YACFg0C,GACEh0C,EAWJ,OAAO,SAAyB3jD,EAAGT,EAAGojD,GACpC,IAAIukE,EAAQlnH,EAAE6X,OAEd,GAAqB,IAAjBqvG,EAAMt2H,OACR,MAAM,IAAIsiH,WAAW,0CAA2C,SAAOgU,GAAS,KAGlF,IAAItlC,EAAOslC,EAAM,GAGjB,GAAItlC,IAFUslC,EAAM,GAGlB,MAAM,IAAIhU,WAAW,iCAAkC,SAAOgU,GAAS,KAGzE,IAAIhwH,EAAO,GAEX,IAAI,EAAA+wE,EAAA,IAAS1oE,GAAI,CACf,IAAI4nH,EAAQ5nH,EAAEsY,OACVq8F,EAAQ30G,EAAE2/F,MAEd,GAAqB,IAAjBioB,EAAMv2H,OAAc,CACtB,GAAIu2H,EAAM,KAAOvlC,EACf,MAAM,IAAIsxB,WAAW,gEAGvB,IAAK,IAAIriH,EAAI,EAAGA,EAAI+wF,EAAM/wF,IACxBqG,EAAKrG,GAAK,CAACqjH,EAAMrjH,IAGnB,OAAO,IAAI8mG,EAAY,CACrBzgG,KAAMA,EACN2gB,KAAM,CAAC+pE,EAAM,GACb0Z,SAAU/7F,EAAE6/F,YAKhB,GAAqB,IAAjB+nB,EAAMv2H,OAAc,CACtB,GAAIu2H,EAAM,KAAOvlC,GAAqB,IAAbulC,EAAM,GAC7B,MAAM,IAAIjU,WAAW,gEAGvB,IAAI,EAAAjrC,EAAA,IAAc1oE,GAAI,CACpB,GAAIojD,EAAM,CACRzrD,EAAO,GAEP,IAAK,IAAI1C,EAAK,EAAGA,EAAKotF,EAAMptF,IAC1B0C,EAAK1C,GAAM,CAAC0/G,EAAM1/G,GAAI,IAGxB,OAAO,IAAImjG,EAAY,CACrBzgG,KAAMA,EACN2gB,KAAM,CAAC+pE,EAAM,GACb0Z,SAAU/7F,EAAE6/F,YAIhB,OAAO7/F,EAGT,IAAI,EAAA0oE,EAAA,IAAe1oE,GAAI,CACrB,IAAK,IAAI8zF,EAAM,EAAGA,EAAMzR,EAAMyR,IAC5Bn8F,EAAKm8F,GAAO,CAAC,GAOf,IAJA,IAAI3gE,EAASnzB,EAAEyvG,QACX/5E,EAAQ11B,EAAE0vG,OACVI,EAAM9vG,EAAE2vG,KAEHxhE,EAAK2hE,EAAI,GAAItwE,EAAIswE,EAAI,GAAItwE,EAAI2O,EAAI3O,IAExC7nC,EADU+9B,EAAM8J,IACN,GAAKrM,EAAOqM,GAGxB,OAAO,IAAI44D,EAAY,CACrBzgG,KAAMA,EACN2gB,KAAM,CAAC+pE,EAAM,GACb0Z,SAAU/7F,EAAE6/F,aAKlB,MAAM,IAAI8T,WAAW,mFAGvB,IAAI,EAAAjrC,EAAA,IAAQ1oE,GAAI,CACd,IAAIyzG,GAAQ,SAAUzzG,GAEtB,GAAqB,IAAjByzG,EAAMpiH,OAAc,CACtB,GAAIoiH,EAAM,KAAOpxB,EACf,MAAM,IAAIsxB,WAAW,gEAGvB,IAAK,IAAIkU,EAAM,EAAGA,EAAMxlC,EAAMwlC,IAC5BlwH,EAAKkwH,GAAO,CAAC7nH,EAAE6nH,IAGjB,OAAO,IAAIzvB,EAAY,CACrBzgG,KAAMA,EACN2gB,KAAM,CAAC+pE,EAAM,KAIjB,GAAqB,IAAjBoxB,EAAMpiH,OAAc,CACtB,GAAIoiH,EAAM,KAAOpxB,GAAqB,IAAboxB,EAAM,GAC7B,MAAM,IAAIE,WAAW,gEAGvB,IAAK,IAAI7B,EAAM,EAAGA,EAAMzvB,EAAMyvB,IAC5Bn6G,EAAKm6G,GAAO,CAAC9xG,EAAE8xG,GAAK,IAGtB,OAAO,IAAI1Z,EAAY,CACrBzgG,KAAMA,EACN2gB,KAAM,CAAC+pE,EAAM,KAIjB,MAAM,IAAIsxB,WAAW,qFCrI3B,IAAI,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzFmU,IAA8B,QAAQ,GAAM,IAAe1jE,IACpE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,aACNi2F,EAAY,eACZH,EAAc,SACd13C,EAAQ,YACRy3C,EAAW,YACXM,GACEh0C,EACA2jE,EAAkBL,GAAsB,CAC1CtvB,gBA2BF,OAAOje,EAAM,GAAM,CACjB,+BAAgC,SAAiC15E,EAAGT,GAClE,OAuDJ,SAAoCS,EAAGT,GAYrC,IATA,IAAI20G,GADJ30G,EAAI+nH,EAAgBtnH,EAAGT,GAAG,IACZ2/F,MACVtd,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAClBzsE,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KAERl1G,EAAI,GAECslB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAChC,IAAIioG,EAAKrT,EAAM50F,GAAG,IAAM,EAExB,GAAK+3E,EAAYkwB,EAAI,GAqCnBvtH,EAAEslB,GAAK,CAAC,OArCe,CAUvB,IARA,IAAIkoG,EAAM,EAENC,EAAU,GACVC,EAAW,GAEX3+E,EAAasmE,EAAI/vF,GACjBm6C,EAAY41C,EAAI/vF,EAAI,GAEfyf,EAAIgK,EAAYhK,EAAI06B,EAAW16B,IAAK,CAC3C,IAAIluC,EAAIokC,EAAM8J,GAEVluC,IAAMyuB,EACRkoG,EAAM90F,EAAOqM,GACJluC,EAAIyuB,IAEbmoG,EAAQ9yH,KAAK+9B,EAAOqM,IACpB2oF,EAAS/yH,KAAK9D,IAKlB,GAAIwmG,EAAYmwB,EAAK,GACnB,MAAM,IAAIlwF,MAAM,2DAKlB,IAFA,IAAIqwF,EAAKlwB,EAAa8vB,EAAIC,GAEjBpW,EAAK,EAAGptE,EAAI0jF,EAAS92H,OAAQwgH,EAAKptE,EAAGotE,IAAM,CAClD,IAAI58G,EAAKkzH,EAAStW,GAClB8C,EAAM1/G,GAAM,CAACorD,EAASs0D,EAAM1/G,GAAI,IAAM,EAAG8iG,EAAeqwB,EAAIF,EAAQrW,MAGtEp3G,EAAEslB,GAAK,CAACqoG,IAOZ,OAAO,IAAIhwB,EAAY,CACrBzgG,KAAM8C,EACN6d,KAAM,CAAC+pE,EAAM,KAjHNgmC,CAA2B5nH,EAAGT,IAEvC,8BAA+B,SAAgCS,EAAGT,GAChE,OAAOsoH,EAA0B7nH,EAAGT,IAEtC,wBAAyB,SAA0BD,EAAGC,GAKpD,OAFQsoH,EAFArmH,EAAOlC,GAEsBC,GAE5B+/C,aAIb,SAASuoE,EAA0B7nH,EAAGT,GAUpC,IAPA,IAAI20G,GADJ30G,EAAI+nH,EAAgBtnH,EAAGT,GAAG,IACZ2/F,MACVtd,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAElBnlG,EAAI,GACJ8tH,EAAQ9nH,EAAEk/F,MAEL5/E,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAChC,IAAIioG,EAAKrT,EAAM50F,GAAG,IAAM,EACpBqoG,OAAK,EAET,GAAKtwB,EAAYkwB,EAAI,GAenBI,EAAK,MAfkB,CAEvB,IAAIH,EAAMM,EAAMxoG,GAAGA,GAEnB,GAAI+3E,EAAYmwB,EAAK,GACnB,MAAM,IAAIlwF,MAAM,2DAGlBqwF,EAAKlwB,EAAa8vB,EAAIC,GAEtB,IAAK,IAAI32H,EAAIyuB,EAAI,EAAGzuB,EAAI+wF,EAAM/wF,IAC5BqjH,EAAMrjH,GAAK,CAAC+uD,EAASs0D,EAAMrjH,GAAG,IAAM,EAAGymG,EAAeqwB,EAAIG,EAAMj3H,GAAGyuB,MAOvEtlB,EAAEslB,GAAK,CAACqoG,GAGV,OAAO,IAAIhwB,EAAY,CACrBzgG,KAAM8C,EACN6d,KAAM,CAAC+pE,EAAM,SC7Ff,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzFmmC,IAAiC,QAAQ,GAAM,IAAepkE,IACvE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,aACNi2F,EAAY,eACZH,EAAc,SACd13C,EAAQ,YACRy3C,EAAW,YACXM,GACEh0C,EACA2jE,EAAkBL,GAAsB,CAC1CtvB,gBA2BF,OAAOje,EAAM,GAAM,CACjB,+BAAgC,SAAiC15E,EAAGT,GAClE,OAoEJ,SAAoCS,EAAGgoH,GASrC,IAPA,IAAIjjE,EAAI,CAACuiE,EAAgBtnH,EAAGgoH,GAAI,GAAM9oB,MAAMpyF,KAAI9V,GAAKA,EAAE,MACnD4qF,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAClBzsE,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KAEHr+G,EAAI,EAAGA,EAAImwG,EAASnwG,IAG3B,IAFA,IAAIo3H,EAAIljE,EAAEn0D,OAEDmuC,EAAI,EAAGA,EAAIkpF,EAAGlpF,IAAK,CAW1B,IAVA,IAAIx/B,EAAIwlD,EAAEhmB,GAENmpF,EAAU,GACVC,EAAW,GAEXp/E,EAAasmE,EAAIx+G,GACjB4oE,EAAY41C,EAAIx+G,EAAI,GAEpBu3H,EAAM,EAED9oG,EAAIypB,EAAYzpB,EAAIm6C,EAAWn6C,IAAK,CAC3C,IAAIo8F,EAAIzmF,EAAM3V,GAEVo8F,IAAM7qH,EACRu3H,EAAM11F,EAAOpT,GACJo8F,EAAI7qH,IAEbq3H,EAAQvzH,KAAK+9B,EAAOpT,IACpB6oG,EAASxzH,KAAK+mH,IAIlB,GAAKrkB,EAAY+wB,EAAK,GAQf,GAAK/wB,EAAY93F,EAAE1O,GAAI,IAWvB,GAAU,IAANkuC,EAAS,CAElB,IAAIspF,EAAO,IAAI9oH,GACf8oH,EAAKx3H,GAAK,EAEV,IAAK,IAAIy3H,EAAM,EAAGC,EAAcJ,EAASv3H,OAAQ03H,EAAMC,EAAaD,IAAO,CACzE,IAAIE,EAAML,EAASG,GACnBD,EAAKG,GAAO5oE,EAASyoE,EAAKG,GAAMN,EAAQI,IAG1CvjE,EAAEpwD,KAAK0zH,QArByB,CAEhC,GAAU,IAANtpF,EAEF,MAAO,GAGPgmB,EAAEqc,OAAOriC,EAAG,GACZA,GAAK,EACLkpF,GAAK,MAjBiB,CAExB1oH,EAAE1O,GAAK4mG,EAAal4F,EAAE1O,GAAIu3H,GAE1B,IAAK,IAAIK,EAAM,EAAGC,EAAaP,EAASv3H,OAAQ63H,EAAMC,EAAYD,IAAO,CACvE,IAAIE,EAAKR,EAASM,GAClBlpH,EAAEopH,GAAM/oE,EAASrgD,EAAEopH,GAAKrxB,EAAe/3F,EAAE1O,GAAIq3H,EAAQO,OA4B7D,OAAO1jE,EAAEj4C,KAAI9S,GAAK,IAAI29F,EAAY,CAChCzgG,KAAM8C,EAAE8S,KAAI9V,GAAK,CAACA,KAClB6gB,KAAM,CAAC+pE,EAAM,OA3INgmC,CAA2B5nH,EAAGT,IAEvC,8BAA+B,SAAgCS,EAAGT,GAChE,OAAOsoH,EAA0B7nH,EAAGT,IAEtC,wBAAyB,SAA0BD,EAAGC,GAKpD,OAFQsoH,EAFArmH,EAAOlC,GAEsBC,GAE5BuN,KAAInK,GAAKA,EAAE28C,eAIxB,SAASuoE,EAA0B7nH,EAAGgoH,GASpC,IALA,IAAIjjE,EAAI,CAACuiE,EAAgBtnH,EAAGgoH,GAAI,GAAM9oB,MAAMpyF,KAAI9V,GAAKA,EAAE,MACnD6tD,EAAI7kD,EAAEk/F,MACNtd,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAEbtuG,EAAI,EAAGA,EAAImwG,EAASnwG,IAG3B,IAFA,IAAIo3H,EAAIljE,EAAEn0D,OAEDmuC,EAAI,EAAGA,EAAIkpF,EAAGlpF,IAAK,CAC1B,IAAIx/B,EAAIwlD,EAAEhmB,GAEV,GAAKs4D,EAAYxyC,EAAEh0D,GAAGA,GAAI,GAQnB,GAAKwmG,EAAY93F,EAAE1O,GAAI,IAWvB,GAAU,IAANkuC,EAAS,CAElB,IAAIspF,EAAO,IAAI9oH,GACf8oH,EAAKx3H,GAAK,EAEV,IAAK,IAAIg2G,EAAKh2G,EAAI,EAAGg2G,EAAK7F,EAAS6F,IACjCwhB,EAAKxhB,GAAMjnD,EAASyoE,EAAKxhB,GAAKhiD,EAAEgiD,GAAIh2G,IAGtCk0D,EAAEpwD,KAAK0zH,QApByB,CAEhC,GAAU,IAANtpF,EAEF,MAAO,GAGPgmB,EAAEqc,OAAOriC,EAAG,GACZA,GAAK,EACLkpF,GAAK,MAjBqB,CAE5B1oH,EAAE1O,GAAK4mG,EAAal4F,EAAE1O,GAAIg0D,EAAEh0D,GAAGA,IAE/B,IAAK,IAAIyuB,EAAIzuB,EAAI,EAAGyuB,EAAI0hF,EAAS1hF,IAE/B/f,EAAE+f,GAAKsgC,EAASrgD,EAAE+f,GAAIg4E,EAAe/3F,EAAE1O,GAAIg0D,EAAEvlC,GAAGzuB,MA2BxD,OAAOk0D,EAAEj4C,KAAI9S,GAAK,IAAI29F,EAAY,CAChCzgG,KAAM8C,EAAE8S,KAAI9V,GAAK,CAACA,KAClB6gB,KAAM,CAAC+pE,EAAM,WC1Gf,GAAe,CAAC,YAAa,cAAe,iBACrCgnC,IAAgC,QAFhC,MAE8C,IAAejlE,IACtE,IAAI,UACF6zC,EAAS,YACTH,EAAW,cACXS,GACEn0C,EAMJ,SAASo0C,IACP,KAAM5hG,gBAAgB4hG,GACpB,MAAM,IAAI3+D,YAAY,oDAIxBjjC,KAAK64G,QAAU,GACf74G,KAAK0yH,MAAQ,IAAI/wB,EAiInB,OA1HAC,EAAI3lG,UAAUmE,KAAO,MACrBwhG,EAAI3lG,UAAU02H,OAAQ,EAQtB/wB,EAAI3lG,UAAU4uB,IAAM,SAAUnwB,EAAGkH,GAE/B,GAAK5B,KAAK64G,QAAQn+G,GAQhBsF,KAAK64G,QAAQn+G,GAAGoC,MAAQ8E,MARJ,CAEpB,IAAIE,EAAO9B,KAAK0yH,MAAM9O,OAAOlpH,EAAGkH,GAGhC5B,KAAK64G,QAAQn+G,GAAKoH,IAOtB8/F,EAAI3lG,UAAUK,IAAM,SAAU5B,GAC5B,IAAIoH,EAAO9B,KAAK64G,QAAQn+G,GAExB,OAAIoH,EACKA,EAAKhF,MAGP,GAGT8kG,EAAI3lG,UAAU22H,WAAa,SAAUl4H,EAAGkH,GAEtC,IAAIE,EAAO9B,KAAK64G,QAAQn+G,GAEnBoH,EAOHA,EAAKhF,MAAQukG,EAAUv/F,EAAKhF,MAAO8E,IALnCE,EAAO9B,KAAK0yH,MAAM9O,OAAOlpH,EAAGkH,GAE5B5B,KAAK64G,QAAQn+G,GAAKoH,IAOtB8/F,EAAI3lG,UAAU0F,QAAU,SAAUvC,EAAM84E,EAAIhkE,GAE1C,IAAI2+G,EAAO7yH,KAAK0yH,MACZn2F,EAASv8B,KAAK64G,QAEdn3G,EAAQ,GAERI,EAAO+wH,EAAKhP,iBAOhB,IALI/hH,GACFJ,EAAMlD,KAAKsD,GAINA,GAAQA,EAAKjG,KAAOq8E,GAErBp2E,EAAKjG,KAAOuD,IAET8hG,EAAYp/F,EAAKhF,MAAO,IAE3BoX,EAASpS,EAAKjG,IAAKiG,EAAKhF,MAAOkD,QAKnC8B,EAAO+wH,EAAKhP,mBAGVniH,EAAMlD,KAAKsD,GAKf,IAAK,IAAIpH,EAAI,EAAGA,EAAIgH,EAAMjH,OAAQC,IAAK,CAErC,IAAI+E,EAAIiC,EAAMhH,GAId6hC,GAFAz6B,EAAO+wH,EAAKjP,OAAOnkH,EAAE5D,IAAK4D,EAAE3C,QAEhBjB,KAAOiG,IAIvB8/F,EAAI3lG,UAAU62H,KAAO,SAAUp4H,EAAGyuB,GAEhC,IAAI4pG,EAAQ/yH,KAAK64G,QAAQn+G,GACrBs4H,EAAQhzH,KAAK64G,QAAQ1vF,GAEzB,IAAK4pG,GAASC,EAEZD,EAAQ/yH,KAAK0yH,MAAM9O,OAAOlpH,EAAGs4H,EAAMl2H,OAEnCkD,KAAK0yH,MAAM9kC,OAAOolC,GAGlBhzH,KAAK64G,QAAQn+G,GAAKq4H,EAClB/yH,KAAK64G,QAAQ1vF,QAAKhrB,OACb,GAAI40H,IAAUC,EAEnBA,EAAQhzH,KAAK0yH,MAAM9O,OAAOz6F,EAAG4pG,EAAMj2H,OAEnCkD,KAAK0yH,MAAM9kC,OAAOmlC,GAGlB/yH,KAAK64G,QAAQ1vF,GAAK6pG,EAClBhzH,KAAK64G,QAAQn+G,QAAKyD,OACb,GAAI40H,GAASC,EAAO,CAEzB,IAAIpxH,EAAImxH,EAAMj2H,MACdi2H,EAAMj2H,MAAQk2H,EAAMl2H,MACpBk2H,EAAMl2H,MAAQ8E,IAIXggG,IACN,CACDhvB,SAAS,ICtJP,GAAO,WACP,GAAe,CAAC,QAAS,OAAQ,SAAU,SAAU,eAAgB,mBAAoB,SAClFqgD,IAAgC,QAAQ,GAAM,IAAezlE,IACtE,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,OACJwgB,EAAM,OACN7R,EAAM,aACN6jE,EAAY,iBACZK,EAAgB,MAChB2L,GACE1yC,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,iCAAkC,SAAgCmT,EAAIk0B,GACpE,GAAuC,IAAnCv6F,EAAO3O,EAAKg1E,GAAK,IAAIwJ,EAAM,IAE7B,OAAO,SAAQ0qB,GACV,GAAuC,IAAnCv6F,EAAO3O,EAAKkpG,GAAK,IAAI1qB,EAAM,IACpC,OAAO,SAAQxJ,GAGjB,IAAIo0B,GAAK,SAAQp0B,GACbq0B,GAAK,SAAQH,GACjB,OAAO1oF,EAAOqyD,EAAiBu2B,EAAIC,GAAK72B,EAAa42B,EAAIC,UC5C3D,GAAe,CAAC,QAAS,SAAU,MAAO,YAAa,eAAgB,iBAAkB,WAAY,SAAU,cAAe,aAAc,cAAe,eAAgB,OACpKmI,IAA2B,QAF3B,MAEyC,IAAe1lE,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,IACNF,EAAG,UACHk2F,EAAS,aACTC,EAAY,eACZH,EAAc,SACd13C,EAAQ,OACRgvB,EAAM,YACNyoB,EAAW,WACXrpB,EAAU,YACV2pB,EAAW,aACXC,EAAY,IACZG,GACEp0C,EA4BJ,OAAO+1B,EA7CE,MA6CU,CACjBie,YAAa,SAAqB33F,GAChC,OAAOspH,EAAUtpH,IAEnB43F,aAAc,SAAsB53F,GAClC,OAoMJ,SAAoBA,GAElB,IAmBInP,EAAGyuB,EAAGyf,EAnBN6iD,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAElBvpG,EAAIgG,KAAK+iB,IAAIijE,EAAMof,GAEnBtuE,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KAERqa,EAAU,GACVC,EAAS,GACTC,EAAO,GACPC,EAAQ,CAAC9nC,EAAMhsF,GAEf+zH,EAAU,GACVC,EAAS,GACTC,EAAO,GACPC,EAAQ,CAACl0H,EAAGorG,GAIZ+oB,EAAO,GACPC,EAAO,GAEX,IAAKn5H,EAAI,EAAGA,EAAI+wF,EAAM/wF,IACpBk5H,EAAKl5H,GAAKA,EACVm5H,EAAKn5H,GAAKA,EAIZ,IAaIszD,EAAQ,WAEV,IAAI8lE,EAAM,IAAIlyB,EAEVz4E,EAAIsiE,IAEN6nC,EAAK90H,KAAK40H,EAAQ34H,QAElB24H,EAAQ50H,KAAK,GACb60H,EAAO70H,KAAK2qB,IAIduqG,EAAKl1H,KAAKg1H,EAAQ/4H,QAElB,IAAIy8C,EAAKgiE,EAAI/vF,GACTouB,EAAK2hE,EAAI/vF,EAAI,GAEjB,IAAKyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAEnBluC,EAAIokC,EAAM8J,GAEVkrF,EAAIjpG,IAAI+oG,EAAKl5H,GAAI6hC,EAAOqM,IAItBzf,EAAI,GAEN2qG,EAAInyH,QAAQ,EAAGwnB,EAAI,GAAG,SAAUyf,EAAGmrF,GAEjCtyB,EAAa4Z,YAAYzyE,EAAGwqF,EAASC,EAAQC,GAAM,SAAU54H,EAAGs5H,GAE1Dt5H,EAAIkuC,GAENkrF,EAAIlB,WAAWl4H,EAAGm9E,EAAWspB,EAAe6yB,EAAKD,WAOzD,IAtDqClwH,EAAGC,EAEpCw3G,EACAC,EAmDA1vD,EAAK1iC,EACLkoG,EAAMyC,EAAIx3H,IAAI6sB,GACd8qG,EAAQ9oH,EAAIkmH,GAEhByC,EAAInyH,QAAQwnB,EAAI,EAAGsiE,EAAO,GAAG,SAAU5nF,EAAGjC,GAExC,IAAIsyH,EAAO/oH,EAAIvJ,GAEX62E,EAAOy7C,EAAMD,KAEfpoE,EAAKhoD,EAELowH,EAAQC,EAER7C,EAAMzvH,MAINunB,IAAM0iC,IAER41C,EAAawJ,UAAU9hF,EAAG0iC,EAAI0nE,EAAM,GAAIH,EAASC,EAAQC,GAGzD7xB,EAAawJ,UAAU9hF,EAAG0iC,EAAI8nE,EAAM,GAAIH,EAASC,EAAQC,GAGzDI,EAAIhB,KAAK3pG,EAAG0iC,GAhF0B/nD,EAkFvB+nD,EAhFbyvD,EAAKuY,EAF4BhwH,EAkFvBslB,GA/EVoyF,EAAKsY,EAAK/vH,GAEd8vH,EAAKtY,GAAMx3G,EACX8vH,EAAKrY,GAAM13G,EAEXgwH,EAAKhwH,GAAK03G,EACVsY,EAAK/vH,GAAKw3G,GA6EVwY,EAAInyH,QAAQ,EAAG8pF,EAAO,GAAG,SAAU5nF,EAAGjC,GAEhCiC,GAAKslB,GAEPqqG,EAAQh1H,KAAKoD,GACb6xH,EAAOj1H,KAAKqF,KAGZjC,EAAI0/F,EAAa1/F,EAAGyvH,GAEfnwB,EAAYt/F,EAAG,KAElBwxH,EAAQ50H,KAAKoD,GACbyxH,EAAO70H,KAAKqF,SAMpB,IAAKslB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IACvB6kC,IAOF,OAHA0lE,EAAKl1H,KAAKg1H,EAAQ/4H,QAClB64H,EAAK90H,KAAK40H,EAAQ34H,QAEX,CACLq3H,EAAG,IAAIrwB,EAAa,CAClBllE,OAAQ62F,EACRt0F,MAAOu0F,EACPna,IAAKoa,EACL5xG,KAAM6xG,IAERY,EAAG,IAAI1yB,EAAa,CAClBllE,OAAQi3F,EACR10F,MAAO20F,EACPva,IAAKwa,EACLhyG,KAAMiyG,IAERj2H,EAAGk2H,EACHl0H,SAAU,WACR,MAAO,MAAQM,KAAK8xH,EAAEpyH,WAAa,QAAUM,KAAKm0H,EAAEz0H,WAAa,QAAUM,KAAKtC,IApW3E02H,CAAWvqH,IAEpBjP,MAAO,SAAeuO,GAEpB,IAEIqD,EAAI2mH,EAFA9nH,EAAOlC,IAKf,MAAO,CACL2oH,EAAGtlH,EAAEslH,EAAE3oE,UACPgrE,EAAG3nH,EAAE2nH,EAAEhrE,UACPzrD,EAAG8O,EAAE9O,MAKX,SAASy1H,EAAUtpH,GAEjB,IAaInP,EAAGyuB,EAAGyf,EAbN6iD,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAElBvpG,EAAIgG,KAAK+iB,IAAIijE,EAAMof,GAEnB9pG,GAAO,SAAM8I,EAAEk/F,OAEfsrB,EAAQ,GACRd,EAAQ,CAAC9nC,EAAMhsF,GAEf60H,EAAQ,GACRX,EAAQ,CAACl0H,EAAGorG,GAIZntG,EAAI,GAER,IAAKhD,EAAI,EAAGA,EAAI+wF,EAAM/wF,IACpBgD,EAAEhD,GAAKA,EAIT,IAAKyuB,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAAK,CAE5B,GAAIA,EAAI,EAEN,IAAKzuB,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAAK,CAEzB,IAAI8tB,EAAM/iB,KAAK+iB,IAAI9tB,EAAGyuB,GAElBxV,EAAI,EAER,IAAKi1B,EAAI,EAAGA,EAAIpgB,EAAKogB,IAEnBj1B,EAAI0tF,EAAU1tF,EAAGwtF,EAAepgG,EAAKrG,GAAGkuC,GAAI7nC,EAAK6nC,GAAGzf,KAGtDpoB,EAAKrG,GAAGyuB,GAAKsgC,EAAS1oD,EAAKrG,GAAGyuB,GAAIxV,GAKtC,IAAIk4C,EAAK1iC,EACL8qG,EAAQ,EACR5C,EAAM,EAEV,IAAK32H,EAAIyuB,EAAGzuB,EAAI+wF,EAAM/wF,IAAK,CAEzB,IAAIkH,EAAIb,EAAKrG,GAAGyuB,GAEZ+qG,EAAO/oH,EAAIvJ,GAEX62E,EAAOy7C,EAAMD,KAEfpoE,EAAKnxD,EAELu5H,EAAQC,EAER7C,EAAMzvH,GAaV,GARIunB,IAAM0iC,IAERnuD,EAAEyrB,GAAK,CAACzrB,EAAEmuD,GAAKnuD,EAAEmuD,GAAMnuD,EAAEyrB,IAAI,GAE7Bq4E,EAAYyJ,UAAU9hF,EAAG0iC,EAAI9qD,IAI3BooB,EAAIsiE,EAEN,IAAK/wF,EAAIyuB,EAAI,EAAGzuB,EAAI+wF,EAAM/wF,IAAK,CAE7B,IAAI65H,EAAMxzH,EAAKrG,GAAGyuB,GAEb+3E,EAAYqzB,EAAK,KAEpBxzH,EAAKrG,GAAGyuB,GAAKm4E,EAAavgG,EAAKrG,GAAGyuB,GAAIkoG,KAO9C,IAAKloG,EAAI,EAAGA,EAAI0hF,EAAS1hF,IAEvB,IAAKzuB,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAEV,IAANyuB,IAEEzuB,EAAImwG,IAENypB,EAAM55H,GAAK,IAIb25H,EAAM35H,GAAK,IAITA,EAAIyuB,GAEFzuB,EAAImwG,IAENypB,EAAM55H,GAAGyuB,GAAKpoB,EAAKrG,GAAGyuB,IAIpBA,EAAIsiE,IAEN4oC,EAAM35H,GAAGyuB,GAAK,IAOdzuB,IAAMyuB,GAiBNzuB,EAAImwG,IAENypB,EAAM55H,GAAGyuB,GAAK,GAIZA,EAAIsiE,IAEN4oC,EAAM35H,GAAGyuB,GAAKpoB,EAAKrG,GAAGyuB,MAvBlBzuB,EAAImwG,IAENypB,EAAM55H,GAAGyuB,GAAKpoB,EAAKrG,GAAGyuB,IAIpBA,EAAIsiE,IAEN4oC,EAAM35H,GAAGyuB,GAAK,IAqBtB,IAAI0kB,EAAI,IAAI2zD,EAAY,CACtBzgG,KAAMszH,EACN3yG,KAAM6xG,IAGJzpG,EAAI,IAAI03E,EAAY,CACtBzgG,KAAMuzH,EACN5yG,KAAMiyG,IAGJja,EAAK,GAET,IAAKh/G,EAAI,EAAG+E,EAAI/B,EAAEjD,OAAQC,EAAI+E,EAAG/E,IAC/Bg/G,EAAGh8G,EAAEhD,IAAMA,EAIb,MAAO,CACLo3H,EAAGjkF,EACHsmF,EAAGrqG,EACHpsB,EAAGg8G,EACHh6G,SAAU,WACR,MAAO,MAAQM,KAAK8xH,EAAEpyH,WAAa,QAAUM,KAAKm0H,EAAEz0H,WAAa,QAAUM,KAAKtC,QCtOjF,SAAS82H,GAAOrrG,EAAGyf,EAAG7kC,EAAG0wH,EAAMn2H,EAAMo2H,EAAMx9F,GAEhD,IAAI7a,EAAM,EAIV,IAFAtY,EAAEmzB,GAAS/N,EAEJ9M,GAAO,GAAG,CAEf,IAAI3e,EAAIqG,EAAEmzB,EAAQ7a,GAEd3hB,EAAIqJ,EAAE0wH,EAAO/2H,IAEN,IAAPhD,GAEF2hB,IAEAq4G,EAAK9rF,KAAOlrC,IAGZqG,EAAE0wH,EAAO/2H,GAAKqG,EAAEzF,EAAO5D,GAIvBqJ,EAAEmzB,KAFA7a,GAEe3hB,GAIrB,OAAOkuC,ECjCF,SAAS+rF,GAAOj6H,GAErB,OAAQA,EAAI,ECLd,IACI,GAAe,CAAC,MAAO,WAAY,aAC5Bk6H,IAA6B,QAF7B,QAE2C,IAAepnE,IACnE,IAAI,IACFlzC,EAAG,SACH3N,EAAQ,UACR6qE,GACEhqB,EAaJ,OAAO,SAAeniB,EAAOliC,GAE3B,IAAKA,GAAKkiC,GAAS,GAAKA,EAAQ,EAC9B,OAAO,KAIT,IAAImxE,EAAQrzG,EAAE6/F,MAEVn/F,EAAI2yG,EAAM,GACV/8G,EAAI+8G,EAAM,GAEVqY,EAAQ,EAERC,EAAQrvH,KAAKijB,IAAI,GAAI,GAAKjjB,KAAKsE,KAAKtK,IAGpCs1H,EA+aN,SAA6B1pF,EAAOliC,EAAGU,EAAGpK,EAAGq1H,GAE3C,IAAIE,EAAKx9C,EAAUruE,GAEnB,GAAc,IAAVkiC,GAAe5rC,IAAMoK,EAEvB,OAAOyQ,EAAInR,EAAG6rH,GAIhB,GAAc,IAAV3pF,EAAa,CAOf,IALA,IAAI4pF,EAASD,EAAGlc,OACZoc,EAAOF,EAAGjc,KAEV1jF,EAAK,EAEAlM,EAAI,EAAGA,EAAItf,EAAGsf,IAAK,CAE1B,IAAIzrB,EAAIw3H,EAAK/rG,GAIb,GAFA+rG,EAAK/rG,GAAKkM,IAEN6/F,EAAK/rG,EAAI,GAAKzrB,EAAIo3H,GAKtB,IAAK,IAAI1/F,EAAK8/F,EAAK/rG,EAAI,GAAIzrB,EAAI03B,EAAI13B,IACjCu3H,EAAO5/F,KAAQ4/F,EAAOv3H,GAS1B,OAJAw3H,EAAKrrH,GAAKwrB,EAEVlsB,EAAIquE,EAAUw9C,GAEProH,EAASqoH,EAAI7rH,GAItB,OAAOwD,EAASqoH,EAAI7rH,GAzdXgsH,CAAoB9pF,EAAOliC,EAAGU,EAAGpK,EAF1Cq1H,EAAQrvH,KAAK+iB,IAAI/oB,EAAI,EAAGq1H,KCxBrB,SAAiB3rH,EAAG+K,EAAUyuB,GAWnC,IATA,IAAIy6E,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KAGTt5G,EAFQ0J,EAAE6/F,MAEA,GAEVosB,EAAK,EAEAjsG,EAAI,EAAGA,EAAI1pB,EAAG0pB,IAAK,CAE1B,IAAIzrB,EAAI4/G,EAAKn0F,GAIb,IAFAm0F,EAAKn0F,GAAKisG,EAEH13H,EAAI4/G,EAAKn0F,EAAI,GAAIzrB,IAElBwW,EAASmpG,EAAO3/G,GAAIyrB,EAAGi0F,EAAUA,EAAQ1/G,GAAK,EDUjC,QCRf2/G,EAAO+X,GAAM/X,EAAO3/G,GAEhB0/G,IACFA,EAAQgY,GAAMhY,EAAQ1/G,IAIxB03H,KAMN9X,EAAK79G,GAAK21H,EAEV/X,EAAOpyC,OAAOmqD,EAAI/X,EAAO5iH,OAAS26H,GAE9BhY,GACFA,EAAQnyC,OAAOmqD,EAAIhY,EAAQ3iH,OAAS26H,GDVpCC,CAAQN,EAAInU,GAuCZ,IArCA,IAmCIlmH,EAAGyuB,EAAGyf,EAAG2O,EAAI+9E,EAAIz0H,EAAG00H,EAAIlwE,EAAImwE,EAAKC,EAAIC,EAAKtgG,EAAIC,EAAIsgG,EAAI3xH,EAAGsF,EAnCzDikB,EAASwnG,EAAGjc,OACZ0E,EAAOuX,EAAGhc,KAEV6c,EAAMpY,EAAK/9G,GAEXohD,EAAI,GAEJg1E,EAAI,GAGJC,EAAKr2H,EAAI,EAETnB,EAAO,GAAKmB,EAAI,GAEhBg1H,EAAO,GAAKh1H,EAAI,GAEhBs2H,EAAO,GAAKt2H,EAAI,GAEhBgkH,EAAS,GAAKhkH,EAAI,GAElBsE,EAAI,GAAKtE,EAAI,GAEbu2H,EAAQ,GAAKv2H,EAAI,GAGjBquC,EAAO+S,EAEPq8D,EAqcN,SAAkCz9G,EAAG+9G,EAAMqY,EAAGr7H,EAAKi6H,EAAM3mF,EAAMxvC,EAAM03H,EAAOF,EAAI/xH,EAAGgyH,EAAMtS,GAEvF,IAAK,IAAI76E,EAAI,EAAGA,EAAInpC,EAAGmpC,IACrBitF,EA3dQ,EA2dAjtF,GAAK40E,EAAK50E,EAAI,GAAK40E,EAAK50E,GAGlCitF,EA9dU,EA8dFp2H,GAAK,EAEb,IAAK,IAAI/E,EAAI,EAAGA,GAAK+E,EAAG/E,IAEtBm7H,EAAEpB,EAAO/5H,IAAM,EACfozC,EAAKpzC,IAAM,EACXm7H,EAAEv3H,EAAO5D,IAAM,EAEfm7H,EAAEG,EAAQt7H,IAAM,EAEhBm7H,EAAEC,EAAKp7H,GAAK,EAEZm7H,EAAE9xH,EAAIrJ,GAAK,EAEXm7H,EAAEE,EAAOr7H,GAAK,EAEdm7H,EAAEpS,EAAS/oH,GAAKm7H,EA9eR,EA8egBn7H,GAI1B,IAAIwiH,EAAO+Y,EAAQ,EAAG,EAAGJ,EAAG9xH,EAAGtE,GAS/B,OANAo2H,EAAEE,EAAOt2H,IAAM,EAEf+9G,EAAK/9G,IAAM,EAEXo2H,EAAE9xH,EAAItE,GAAK,EAEJy9G,EAxeIgZ,CAAyBz2H,EAAG+9G,EAAMqY,EAnBnC,EAmB2CpB,EAAM3mF,EAAMxvC,EAAM03H,EAAOF,EAAI/xH,EAAGgyH,EAAMtS,GAGvF0S,EA8eN,SAAgC12H,EAAG+9G,EAAMqY,EAAGpS,EAAQsS,EAAMhyH,EAAG+wH,EAAOgB,EAAIrB,EAAM3mF,EAAMxvC,GAIlF,IAFA,IAAI63H,EAAM,EAEDz7H,EAAI,EAAGA,EAAI+E,EAAG/E,IAAK,CAE1B,IAAI4O,EAAIusH,EAAEpS,EAAS/oH,GAEnB,GAAU,IAAN4O,EAEFusH,EAAEE,EAAOr7H,IAAM,EACfy7H,IAEA3Y,EAAK9iH,IAAM,EACXm7H,EAAE9xH,EAAIrJ,GAAK,OACN,GAAI4O,EAAIwrH,EAEbe,EAAEC,EAAKp7H,GAAK,EAEZm7H,EAAEE,EAAOr7H,IAAM,EACfy7H,IACA3Y,EAAK9iH,GAAKi6H,GAAOl1H,GACjBo2H,EAAEC,EAAKr2H,SACF,CACL,IAAIuE,EAAI6xH,EAAEpB,EAAOnrH,IAEN,IAAPtF,IACF8pC,EAAK9pC,GAAKtJ,GAIZm7H,EAAEv3H,EAAO5D,GAAKm7H,EAAEpB,EAAOnrH,GACvBusH,EAAEpB,EAAOnrH,GAAK5O,GAIlB,OAAOy7H,EAlhBGC,CAAuB32H,EAAG+9G,EAAMqY,EAAGpS,EAAQsS,EAAMhyH,EAAG+wH,EAAOgB,EAAIrB,EAAM3mF,EAAMxvC,GAGjF+3H,EAAS,EAINF,EAAM12H,GAAG,CAId,IAAKmpC,GAAK,EAAGytF,EAAS52H,IAAiC,KAA3BmpC,EAAIitF,EAAEpB,EAAO4B,IAAiBA,MAIrC,IAAjBR,EAAEv3H,EAAOsqC,KACXkF,EAAK+nF,EAAEv3H,EAAOsqC,KAAO,GAIvBitF,EAAEpB,EAAO4B,GAAUR,EAAEv3H,EAAOsqC,GAE5B,IAAI0tF,EAAQT,EAAEE,EAAOntF,GAEjB2tF,EAAMV,EAAEC,EAAKltF,GAEjButF,GAAOI,EAIP,IAAIC,EAAK,EAETX,EAAEC,EAAKltF,IAAM2tF,EACb,IAAI74H,EAAI8/G,EAAK50E,GAET6tF,EAAgB,IAAVH,EAAc54H,EAAIk4H,EACxBc,EAAMD,EAEV,IAAKl/E,EAAK,EAAGA,GAAM++E,EAAQ,EAAG/+E,IAAM,CAgBlC,IAfIA,EAAK++E,GAEPz1H,EAAI+nC,EAEJ2sF,EAAK73H,EAEL2nD,EAAKwwE,EAnED,EAmESjtF,GAAK0tF,IAIlBf,EAAK/X,EADL38G,EAAI0sB,EAAO7vB,MAGX2nD,EAAKwwE,EAzED,EAyESh1H,IAGVy0H,EAAK,EAAGA,GAAMjwE,EAAIiwE,KAGhBE,EAAMK,EAAEC,GAFbp7H,EAAI6yB,EAAOgoG,SAEc,IAKzBiB,GAAMhB,EAENK,EAAEC,EAAKp7H,IAAM86H,EAEbjoG,EAAOmpG,KAASh8H,GAEK,IAAjBm7H,EAAEv3H,EAAO5D,KACXozC,EAAK+nF,EAAEv3H,EAAO5D,IAAMozC,EAAKpzC,KAIV,IAAbozC,EAAKpzC,GACPm7H,EAAEv3H,EAAOwvC,EAAKpzC,IAAMm7H,EAAEv3H,EAAO5D,GAE7Bm7H,EAAEpB,EAAOoB,EAAEpS,EAAS/oH,IAAMm7H,EAAEv3H,EAAO5D,IAInCmG,IAAM+nC,IAER40E,EAAK38G,GAAK8zH,GAAO/rF,GAEjBitF,EAAE9xH,EAAIlD,GAAK,GAqBf,IAhBc,IAAVy1H,IACFV,EAAMc,GAIRb,EAAEpS,EAAS76E,GAAK4tF,EAEhBhZ,EAAK50E,GAAK6tF,EACVZ,EAvHQ,EAuHAjtF,GAAK8tF,EAAMD,EAEnBZ,EAAEE,EAAOntF,IAAM,EAIfs0E,EAAO+Y,EAAQ/Y,EAAM2X,EAAOgB,EAAG9xH,EAAGtE,GAE7Bg2H,EAAKgB,EAAKhB,EAAKiB,EAAKjB,IAGvB,MAAKC,EAAMG,EAAEE,GAFbr7H,EAAI6yB,EAAOkoG,OAEgB,GAA3B,CAMA,IAAIkB,EAAOzZ,GADXsY,GAAOK,EAAEC,EAAKp7H,IAGd,IAAKgD,EAAI8/G,EAAK9iH,GAAI06B,EAAKooF,EAAK9iH,GAAKg7H,EAAM,EAAGh4H,GAAK03B,EAAI13B,IAG7Cm4H,EAAE9xH,GAFNlD,EAAI0sB,EAAO7vB,MAEKw/G,EAEd2Y,EAAE9xH,EAAIlD,IAAM20H,EACU,IAAbK,EAAE9xH,EAAIlD,KAEfg1H,EAAE9xH,EAAIlD,GAAKg1H,EAAEpS,EAAS5iH,GAAK81H,GASjC,IAAKlB,EAAKgB,EAAKhB,EAAKiB,EAAKjB,IAAM,CAO7B,IAHApgG,GADAD,EAAKooF,EADL9iH,EAAI6yB,EAAOkoG,KAEDI,EAAEE,EAAOr7H,GAAK,EACxBi7H,EAAKvgG,EAEApxB,EAAI,EAAGsF,EAAI,EAAG5L,EAAI03B,EAAI13B,GAAK23B,EAAI33B,IAGlC,GAAiB,IAAbm4H,EAAE9xH,GAFNlD,EAAI0sB,EAAO7vB,KAES,CAElB,IAAIk5H,EAAOf,EAAE9xH,EAAIlD,GAAKq8G,EAElB0Z,EAAO,GAETttH,GAAKstH,EAELrpG,EAAOooG,KAAQ90H,EAEfmD,GAAKnD,IAGL28G,EAAK38G,GAAK8zH,GAAO/rF,GAEjBitF,EAAE9xH,EAAIlD,GAAK,GAMjBg1H,EAAEE,EAAOr7H,GAAKi7H,EAAKvgG,EAAK,EACxB,IAAIyhG,EAAKlB,EACLmB,GAAK1hG,EAAKygG,EA5LR,EA4LgBn7H,GAEtB,IAAKgD,EAAI23B,EAAK,EAAG33B,EAAIo5H,GAAIp5H,IAAK,CAG5B,IAAIq5H,GAAMlB,EAAEC,GAFZ3sG,EAAIoE,EAAO7vB,KAIPq5H,IAAO,IAKXztH,GAAKytH,GAELxpG,EAAOooG,KAAQxsG,EAEfnlB,GAAKmlB,GAIG,IAAN7f,GAEFk0G,EAAK9iH,GAAKi6H,GAAO/rF,GAGjB4tF,GAFAhB,GAAOK,EAAEC,EAAKp7H,GAId67H,GAAOf,EACPW,GAAOX,EACPK,EAAEC,EAAKp7H,GAAK,EAEZm7H,EAAEE,EAAOr7H,IAAM,IAGfm7H,EAAEpS,EAAS/oH,GAAK+K,KAAK+iB,IAAIqtG,EAAEpS,EAAS/oH,GAAI4O,GAExCikB,EAAOooG,GAAMpoG,EAAOspG,GAEpBtpG,EAAOspG,GAAMtpG,EAAO6H,GAEpB7H,EAAO6H,GAAMwT,EAEbitF,EAtOI,EAsOIn7H,GAAKi7H,EAAKvgG,EAAK,EAEvBpxB,GAAKA,EAAI,GAAKA,EAAIA,GAAKvE,EAEvBo2H,EAAEv3H,EAAO5D,GAAKm7H,EAAEG,EAAQhyH,GACxB6xH,EAAEG,EAAQhyH,GAAKtJ,EAEfozC,EAAKpzC,GAAKsJ,GAWd,IANA6xH,EAAEpS,EAAS76E,GAAK4tF,EAGhBtZ,EAAO+Y,EAAQ/Y,GAFf2X,EAAQpvH,KAAKijB,IAAImsG,EAAO2B,IAEK3B,EAAOgB,EAAG9xH,EAAGtE,GAGrCg2H,EAAKgB,EAAKhB,EAAKiB,EAAKjB,IAGvB,KAAII,EAAEC,GAFNp7H,EAAI6yB,EAAOkoG,MAEM,GAUjB,IAJA/6H,EAAIm7H,EAAEG,GADNhyH,EAAI8pC,EAAKpzC,KAGTm7H,EAAEG,EAAQhyH,IAAM,GAEF,IAAPtJ,IAA6B,IAAjBm7H,EAAEv3H,EAAO5D,GAAWA,EAAIm7H,EAAEv3H,EAAO5D,GAAIwiH,IAAQ,CAI9D,IAHA73D,EAAKwwE,EAtQD,EAsQSn7H,GACbg7H,EAAMG,EAAEE,EAAOr7H,GAEVgD,EAAI8/G,EAAK9iH,GAAK,EAAGgD,GAAK8/G,EAAK9iH,GAAK2qD,EAAK,EAAG3nD,IAC3Cm4H,EAAE9xH,EAAIwpB,EAAO7vB,IAAMw/G,EAGrB,IAAI8Z,GAAQt8H,EAEZ,IAAKyuB,EAAI0sG,EAAEv3H,EAAO5D,IAAW,IAAPyuB,GAAW,CAC/B,IAAI8tG,GAAKpB,EAhRP,EAgRe1sG,KAAOk8B,GAAMwwE,EAAEE,EAAO5sG,KAAOusG,EAE9C,IAAKh4H,EAAI8/G,EAAKr0F,GAAK,EAAG8tG,IAAMv5H,GAAK8/G,EAAKr0F,GAAKk8B,EAAK,EAAG3nD,IAE7Cm4H,EAAE9xH,EAAIwpB,EAAO7vB,MAAQw/G,IACvB+Z,GAAK,GAKLA,IAEFzZ,EAAKr0F,GAAKwrG,GAAOj6H,GACjBm7H,EAAEC,EAAKp7H,IAAMm7H,EAAEC,EAAK3sG,GACpB0sG,EAAEC,EAAK3sG,GAAK,EAEZ0sG,EAAEE,EAAO5sG,IAAM,EAEfA,EAAI0sG,EAAEv3H,EAAO6qB,GACb0sG,EAAEv3H,EAAO04H,IAAS7tG,IAGlB6tG,GAAQ7tG,EACRA,EAAI0sG,EAAEv3H,EAAO6qB,KAQrB,IAAKzrB,EAAI+4H,EAAKhB,EAAKgB,EAAKhB,EAAKiB,EAAKjB,KAG3BD,GAAOK,EAAEC,GAFdp7H,EAAI6yB,EAAOkoG,OAEe,IAK1BI,EAAEC,EAAKp7H,GAAK86H,EAEZlsH,EAAIusH,EAAEpS,EAAS/oH,GAAK87H,EAAKhB,GAGJ,IAAjBK,EAAEpB,GAFNnrH,EAAI7D,KAAK+iB,IAAIlf,EAAG7J,EAAI02H,EAAMX,OAGxB1nF,EAAK+nF,EAAEpB,EAAOnrH,IAAM5O,GAItBm7H,EAAEv3H,EAAO5D,GAAKm7H,EAAEpB,EAAOnrH,GACvBwkC,EAAKpzC,IAAM,EACXm7H,EAAEpB,EAAOnrH,GAAK5O,EAEd27H,EAAS5wH,KAAK+iB,IAAI6tG,EAAQ/sH,GAC1BusH,EAAEpS,EAAS/oH,GAAK4O,EAEhBikB,EAAO7vB,KAAOhD,GAIhBm7H,EAAEC,EAAKltF,GAAK2tF,EAEmB,IAA1BV,EA9UG,EA8UKjtF,GAAKlrC,EAAI+4H,KAEpBjZ,EAAK50E,IAAM,EAEXitF,EAAE9xH,EAAI6kC,GAAK,GAGC,IAAV0tF,IAEFV,EAAMl4H,GASV,IAAKhD,EAAI,EAAGA,EAAI+E,EAAG/E,IACjB8iH,EAAK9iH,GAAKi6H,GAAOnX,EAAK9iH,IAGxB,IAAKyuB,EAAI,EAAGA,GAAK1pB,EAAG0pB,IAClB0sG,EAAEpB,EAAOtrG,IAAM,EAIjB,IAAKA,EAAI1pB,EAAG0pB,GAAK,EAAGA,IAEd0sG,EAAEC,EAAK3sG,GAAK,IAKhB0sG,EAAEv3H,EAAO6qB,GAAK0sG,EAAEpB,EAAOjX,EAAKr0F,IAC5B0sG,EAAEpB,EAAOjX,EAAKr0F,IAAMA,GAItB,IAAKtoB,EAAIpB,EAAGoB,GAAK,EAAGA,IAEdg1H,EAAEC,EAAKj1H,IAAM,IAIA,IAAb28G,EAAK38G,KAEPg1H,EAAEv3H,EAAOuC,GAAKg1H,EAAEpB,EAAOjX,EAAK38G,IAC5Bg1H,EAAEpB,EAAOjX,EAAK38G,IAAMA,GAKxB,IAAK+nC,EAAI,EAAGluC,EAAI,EAAGA,GAAK+E,EAAG/E,KACR,IAAb8iH,EAAK9iH,KACPkuC,EAAI4rF,GAAO95H,EAAGkuC,EAAGitF,EAAGpB,EAAMn2H,EAAMuiD,EAAG98C,IAOvC,OAFA88C,EAAEoqB,OAAOpqB,EAAEpmD,OAAS,EAAG,GAEhBomD,GA+JT,SAASo1E,EAAQ/Y,EAAM2X,EAAOgB,EAAG9xH,EAAGtE,GAClC,GAAIy9G,EAAO,GAAKA,EAAO2X,EAAQ,EAAG,CAChC,IAAK,IAAIjsF,EAAI,EAAGA,EAAInpC,EAAGmpC,IACJ,IAAbitF,EAAE9xH,EAAI6kC,KACRitF,EAAE9xH,EAAI6kC,GAAK,GAIfs0E,EAAO,EAIT,OAAOA,EAGT,SAAS0D,EAAMlmH,EAAGyuB,GAChB,OAAOzuB,IAAMyuB,MEjmBV,SAAS+tG,GAAOx8H,EAAGyuB,EAAGplB,EAAGo7B,EAAOg4F,EAAUC,EAAUpiE,GACzD,IAAIrhD,EAAG0jH,EAGHrwE,EADAswE,EAAQ,EAGZ,GAAI58H,GAAKyuB,GAAKplB,EAAEo7B,EAAQhW,IAAMplB,EAAEozH,EAAWz8H,GACzC,OAAQ,EAIVqJ,EAAEozH,EAAWz8H,GAAKqJ,EAAEo7B,EAAQhW,GAE5B,IAAIouG,EAAQxzH,EAAEqzH,EAAW18H,GAGzB,GAFAqJ,EAAEqzH,EAAW18H,GAAKyuB,GAEH,IAAXouG,EAEFD,EAAQ,EACRtwE,EAAItsD,MACC,CAIL,IAFA48H,EAAQ,EAEHtwE,EAAIuwE,EAAOvwE,IAAMjjD,EAAEixD,EAAWhO,GAAIA,EAAIjjD,EAAEixD,EAAWhO,IAIxD,IAAKrzC,EAAI4jH,EAAO5jH,IAAMqzC,EAAGrzC,EAAI0jH,EAE3BA,EAAUtzH,EAAEixD,EAAWrhD,GACvB5P,EAAEixD,EAAWrhD,GAAKqzC,EAItB,MAAO,CACLswE,MAAOA,EACPtwE,EAAGA,GCnDP,IACI,GAAe,CAAC,aACTwwE,IAAgC,QAFhC,WAE8C,IAAehqE,IACtE,IAAI,UACFgqB,GACEhqB,EAcJ,OAAO,SAAUrkD,EAAG8L,EAAQy/G,EAAM+C,GAEhC,IAAKtuH,IAAM8L,IAAWy/G,EACpB,OAAO,KAIT,IAKIh6H,EAAGyuB,EAAGyf,EAAG28E,EAAG7nH,EAAG+pH,EAAIryF,EALnBonF,EAAQrzG,EAAE6/F,MAEVn/F,EAAI2yG,EAAM,GACV/8G,EAAI+8G,EAAM,GAIV7oG,EAAI,EAAIlU,GAAKg4H,EAAMh4H,EAAIoK,EAAI,EAAI,GAE/B9F,EAAI,GAIJozH,EAAW13H,EAEX23H,EAAW,EAAI33H,EAEf0/B,EAAQ,EAAI1/B,EAEZg1H,EAAO,EAAIh1H,EAEXnB,EAAO,EAAImB,EAAI,EAGnB,IAAKmpC,EAAI,EAAGA,EAAIj1B,EAAGi1B,IACjB7kC,EAAE6kC,IAAM,EAIV,IAAI8uF,EAAW,GAGX1C,EAAKx9C,EAAUruE,GAEf8rH,EAASD,EAAGlc,OACZoc,EAAOF,EAAGjc,KAEd,IAAKnwE,EAAI,EAAGA,EAAInpC,EAAGmpC,IAKjB,IAFA8uF,EAFAvuG,EAAIurG,EAAK9rF,KAEuB,IAAlB7kC,EAAEo7B,EAAQhW,GAAY,EAAI,GAE1B,IAAPA,IAA8B,IAAlBplB,EAAEo7B,EAAQhW,GAAWA,EAAIlU,EAAOkU,GACjDplB,EAAEo7B,EAAQhW,GAAKyf,EAKnB,GAAI6uF,EAAK,CAEP,IAAK7uF,EAAI,EAAGA,EAAInpC,EAAGmpC,IACjB7kC,EAAE2wH,EAAK9rF,IAAMA,EAIf,IAAKluC,EAAI,EAAGA,EAAImP,EAAGnP,IAAK,CAEtB,IAAKkuC,EAAInpC,EAAGgoH,EAAKyN,EAAKx6H,GAAI06B,EAAK8/F,EAAKx6H,EAAI,GAAIgD,EAAI+pH,EAAI/pH,EAAI03B,EAAI13B,IAC1DkrC,EAAInjC,KAAK+iB,IAAIogB,EAAG7kC,EAAEkxH,EAAOv3H,KAI3BqG,EAAEzF,EAAO5D,GAAKqJ,EAAE0wH,EAAO7rF,GACvB7kC,EAAE0wH,EAAO7rF,GAAKluC,GAKlB,IAAKA,EAAI,EAAGA,EAAI+E,EAAG/E,IACjBqJ,EA1Da,EA0DArJ,GAAKA,EAGpB,IAAKkuC,EAAI,EAAGA,EAAInpC,EAAGmpC,IAAK,CAStB,KALmB,IAAf3zB,EAFJkU,EAAIurG,EAAK9rF,KAGP8uF,EAASziH,EAAOkU,MAIbo8F,EAAIkS,EAAM1zH,EAAE0wH,EAAO7rF,GAAKzf,GAAU,IAAPo8F,EAAUA,EAAIkS,EAAM1zH,EAAEzF,EAAOinH,IAAM,EACjE,IAAK7nH,EAAIw3H,EAAK3P,GAAI7nH,EAAIw3H,EAAK3P,EAAI,GAAI7nH,IAAK,CAEtC,IAAI8O,EAAI0qH,GADRx8H,EAAIu6H,EAAOv3H,GACOyrB,EAAGplB,EAAGo7B,EAAOg4F,EAAUC,EAzEhC,GA2EL5qH,EAAE8qH,OAAS,GACbI,EAASvuG,KAIK,IAAZ3c,EAAE8qH,OACJI,EAASlrH,EAAEw6C,MAKE,IAAf/xC,EAAOkU,KACTplB,EAvFW,EAuFEolB,GAAKlU,EAAOkU,IAK7B,IAAKA,EAAI,EAAGA,EAAI1pB,EAAG0pB,KACE,IAAflU,EAAOkU,KACTuuG,EAASziH,EAAOkU,KAAOuuG,EAASvuG,IAIpC,OAAOuuG,MClIP,GAAe,CAAC,MAAO,WAAY,aAC5BC,IAA6B,QAF7B,QAE2C,IAAenqE,IACnE,IAAI,IACFlzC,EAAG,SACH3N,EAAQ,UACR6qE,GACEhqB,EACAoqE,EAAQhD,GAAY,CACtBt6G,MACA3N,WACA6qE,cAEEqgD,EAAWL,GAAe,CAC5BhgD,cAeF,OAAO,SAAensC,EAAOliC,EAAGipF,GAE9B,IAKIxpD,EALA00E,EAAOn0G,EAAE4vG,KAGTt5G,EAFQ0J,EAAE6/F,MAEA,GAIVr1F,EAAI,GAIR,GAFAA,EAAEqzC,EAAI4wE,EAAMvsF,EAAOliC,GAEfkiC,IAAU13B,EAAEqzC,EACd,OAAO,KAIT,GAAIorC,EAAI,CAEN,IAAI/oF,EAAIgiC,EC3CP,SAAmBliC,EAAG2uH,EAAM9wE,EAAGzqB,GAmBpC,IAjBA,IAAI6gF,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACTyD,EAAQrzG,EAAE6/F,MACVyT,EAAMtzG,EAAE8/F,UAERp/F,EAAI2yG,EAAM,GACV/8G,EAAI+8G,EAAM,GAEVe,EAAqC,KACrChwF,EAAS,GAETiwF,EAAO,GAGP4X,EAAK,EAEAxsF,EAAI,EAAGA,EAAInpC,EAAGmpC,IAAK,CAE1B40E,EAAK50E,GAAKwsF,EAIV,IAFA,IAAIjsG,EAAI69B,EAAIA,EAAEpe,GAAKA,EAEVmvF,EAAKza,EAAKn0F,GAAIob,EAAK+4E,EAAKn0F,EAAI,GAAIre,EAAIitH,EAAIjtH,EAAIy5B,EAAIz5B,IAAK,CAE5D,IAAI0B,EAA6B6wG,EAAOvyG,GAExCyiB,EAAO6nG,GAAM5oH,EAET+wG,IACFA,EAAQ6X,GAAMhY,EAAQtyG,IAIxBsqH,KAOJ,OAFA5X,EAAK/9G,GAAK21H,EAEHjsH,EAAE+wG,mBAAmB,CAC1B39E,OAAQghF,EACRz+E,MAAOvR,EACP2rF,IAAKsE,EACL97F,KAAM,CAAC7X,EAAGpK,GACV0lG,SAAUsX,IDLQub,CAAU7uH,EAAG,EAAMwK,EAAEqzC,GAAQ79C,EAE7CwK,EAAEsB,OEhDD,SAAiB9L,EAAGsuH,GAEzB,IAAKtuH,EACH,OAAO,KAIT,IAgBIzO,EAAGu9H,EAhBH5a,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KACTyD,EAAQrzG,EAAE6/F,MAEVn/F,EAAI2yG,EAAM,GACV/8G,EAAI+8G,EAAM,GAEVvnG,EAAS,GAGTlR,EAAI,GAIJqjC,EAAO3nC,EAMT,IAAK/E,EAAI,EAAGA,EAAImP,EAAGnP,IACjBqJ,EAAEqjC,EAAO1sC,IAAM,EAKnB,IAAK,IAAIkuC,EAAI,EAAGA,EAAInpC,EAAGmpC,IAAK,CAE1B3zB,EAAO2zB,IAAM,EAEb7kC,EAlBa,EAkBA6kC,IAAM,EAEnB,IAAK,IAAI6+E,EAAKnK,EAAK10E,GAAIxT,EAAKkoF,EAAK10E,EAAI,GAAIlrC,EAAI+pH,EAAI/pH,EAAI03B,EAAI13B,IAAK,CAE5D,IAAI8O,EAAI6wG,EAAO3/G,GAIf,IAFAhD,EAAUqJ,EAAEqjC,EAAO56B,IAEL,IAAP9R,GAAYA,EAAIkuC,EAAGluC,EAAIu9H,EAE5BA,EAAQl0H,EA5BC,EA4BYrJ,GAErBqJ,EA9BS,EA8BIrJ,GAAKkuC,GAEH,IAAXqvF,IACFhjH,EAAOva,GAAKkuC,GAKd7kC,EAAEqjC,EAAO56B,GAAKo8B,GAKpB,OAAO3zB,EFdQijH,CAAQ7uH,GAEnB,IAAIqrH,EGjDH,SAAgBz/G,EAAQxV,GAE7B,IAAKwV,EACH,OAAO,KAIT,IACIkU,EADAyf,EAAI,EAGJ8rF,EAAO,GAGP3wH,EAAI,GAGJzF,EAAOmB,EACPy3B,EAAQ,EAAIz3B,EAEhB,IAAK0pB,EAAI,EAAGA,EAAI1pB,EAAG0pB,IAEjBplB,EANS,EAMAolB,IAAM,EAIjB,IAAKA,EAAI1pB,EAAI,EAAG0pB,GAAK,EAAGA,KAEH,IAAflU,EAAOkU,KAKXplB,EAAEzF,EAAO6qB,GAAKplB,EAjBL,EAiBckR,EAAOkU,IAC9BplB,EAlBS,EAkBAkR,EAAOkU,IAAMA,GAIxB,IAAKA,EAAI,EAAGA,EAAI1pB,EAAG0pB,KAEE,IAAflU,EAAOkU,KAKXyf,EAAI4rF,GAAOrrG,EAAGyf,EAAG7kC,EA7BR,EA6BiBzF,EAAMo2H,EAAMx9F,IAGxC,OAAOw9F,EHEQyD,CAAOxkH,EAAEsB,OAAQxV,GAI5B,GAFAkU,EAAEykH,GAAKP,EAASxuH,EAAGsK,EAAEsB,OAAQy/G,EAAM,GAE/BrrH,GAAKsK,EAAEsB,QAAUtB,EAAEykH,IAmB3B,SAAiBjvH,EAAGwK,GAElB,IAAI2pG,EAAOn0G,EAAE4vG,KACTsE,EAASl0G,EAAE2vG,OACX0D,EAAQrzG,EAAE6/F,MAEVn/F,EAAI2yG,EAAM,GACV/8G,EAAI+8G,EAAM,GAEd7oG,EAAEmkH,KAAO,GAETnkH,EAAE0kH,SAAW,GAGb,IAWI39H,EAAGkuC,EAAGlrC,EAAG+pH,EAAIryF,EAXbngB,EAAStB,EAAEsB,OACX6iH,EAAOnkH,EAAEmkH,KACTO,EAAW1kH,EAAE0kH,SAEbt0H,EAAI,GAGJ0wH,EAAO5qH,EACPyuH,EAAOzuH,EAAIpK,EACX84H,EAAO1uH,EAAI,EAAIpK,EAInB,IAAKmpC,EAAI,EAAGA,EAAInpC,EAAGmpC,IAEjB7kC,EAAE0wH,EAAO7rF,IAAM,EACf7kC,EAAEu0H,EAAO1vF,IAAM,EACf7kC,EAAEw0H,EAAO3vF,GAAK,EAIhB,IAAKluC,EAAI,EAAGA,EAAImP,EAAGnP,IACjB29H,EAAS39H,IAAM,EAIjB,IAAKkuC,EAAInpC,EAAI,EAAGmpC,GAAK,EAAGA,IAEtB,IAAK6+E,EAAKnK,EAAK10E,GAAIxT,EAAKkoF,EAAK10E,EAAI,GAAIlrC,EAAI+pH,EAAI/pH,EAAI03B,EAAI13B,IAEnD26H,EAAShb,EAAO3/G,IAAMkrC,EAK1B,IAAKluC,EAAImP,EAAI,EAAGnP,GAAK,EAAGA,IAEtBo9H,EAAKp9H,IAAM,GAGA,KAFXkuC,EAAIyvF,EAAS39H,MAOS,GAAlBqJ,EAAEw0H,EAAO3vF,OACX7kC,EAAEu0H,EAAO1vF,GAAKluC,GAIhBqJ,EA5CS,EA4CArJ,GAAKqJ,EAAE0wH,EAAO7rF,GACvB7kC,EAAE0wH,EAAO7rF,GAAKluC,GAMhB,IAHAiZ,EAAE6kH,IAAM,EACR7kH,EAAEhK,GAAKE,EAEF++B,EAAI,EAAGA,EAAInpC,EAAGmpC,IAajB,GAXAluC,EAAIqJ,EAAE0wH,EAAO7rF,GAEbj1B,EAAE6kH,MAEE99H,EAAI,IACNA,EAAIiZ,EAAEhK,MAIRmuH,EAAKp9H,GAAKkuC,MAEJ2vF,EAAK3vF,IAAM,GAAjB,CAKAj1B,EAAE6kH,KAAOz0H,EAAEw0H,EAAO3vF,GAElB,IAAI6vF,EAAKxjH,EAAO2zB,IAEJ,IAAR6vF,IACmB,IAAjB10H,EAAEw0H,EAAOE,KACX10H,EAAEu0H,EAAOG,GAAM10H,EAAEu0H,EAAO1vF,IAG1B7kC,EA9EO,EA8EEA,EAAEu0H,EAAO1vF,IAAM7kC,EAAE0wH,EAAOgE,GACjC10H,EAAE0wH,EAAOgE,GAAM10H,EA/ER,EA+EiBrJ,GACxBqJ,EAAEw0H,EAAOE,IAAO10H,EAAEw0H,EAAO3vF,IAI7B,IAAKluC,EAAI,EAAGA,EAAImP,EAAGnP,IACbo9H,EAAKp9H,GAAK,IACZo9H,EAAKp9H,GAAKkuC,KAId,OAAO,EAjIwB8vF,CAAQrvH,EAAGsK,GAEtC,IAAKA,EAAEglH,IAAM,EAAG/vF,EAAI,EAAGA,EAAInpC,EAAGmpC,IAC5Bj1B,EAAEglH,KAAOhlH,EAAEykH,GAAGxvF,QAKlBj1B,EAAEglH,IAAM,EAAIrb,EAAK79G,GAAKA,EACtBkU,EAAE6kH,IAAM7kH,EAAEglH,IAIZ,OAAOhlH,MIpEJ,SAASilH,GAAS70H,EAAGolB,GAE1B,OAAOplB,EAAEolB,GAAK,ECAT,SAAS0vG,GAAO90H,EAAGolB,GAExBplB,EAAEolB,GAAKwrG,GAAO5wH,EAAEolB,ICHX,SAAS2vG,GAASp+H,GAEvB,OAAOA,EAAI,EAAIi6H,GAAOj6H,GAAKA,ECStB,SAASq+H,GAAM5vG,EAAG3nB,EAAG6a,EAAK6tC,EAAI4tE,GAEnC,IAMIp9H,EAAGgD,EAAG23B,EANNyJ,EAAQt9B,EAAEs3G,OACVI,EAAM13G,EAAEu3G,KAGRt5G,EAFO+B,EAAEwnG,MAEA,GAITyrB,EAAO,EAIX,IAFAvqE,EAAG,GAAK/gC,EAEDsrG,GAAQ,GAAG,CAEhBtrG,EAAI+gC,EAAGuqE,GAEP,IAAIuE,EAAOlB,EAAOA,EAAK3uG,GAAKA,EAEvByvG,GAAS1f,EAAK/vF,KAEjB0vG,GAAO3f,EAAK/vF,GAEZ+gC,EAAGzqD,EAAIg1H,GAAQuE,EAAO,EAAI,EAAIF,GAAS5f,EAAI8f,KAI7C,IAAIz6H,EAAO,EAEX,IAAKb,EAAIwsD,EAAGzqD,EAAIg1H,GAAOp/F,EAAK2jG,EAAO,EAAI,EAAIF,GAAS5f,EAAI8f,EAAO,IAAKt7H,EAAI23B,EAAI33B,IAI1E,IAAIk7H,GAAS1f,EAFbx+G,EAAIokC,EAAMphC,IAEV,CAKAwsD,EAAGzqD,EAAIg1H,GAAQ/2H,EAEfwsD,IAAKuqE,GAAQ/5H,EAEb6D,EAAO,EAEP,MAIEA,IAEFk2H,IAEAvqE,IAAK7tC,GAAO8M,GAIhB,OAAO9M,EC3ET,IACI,GAAe,CAAC,eAAgB,WAAY,YACrC48G,IAAiC,QAFjC,YAE+C,IAAezrE,IACvE,IAAI,aACF8zC,EAAY,SACZ30F,EAAQ,SACR88C,GACE+D,EAqBJ,OAAO,SAAmBhsD,EAAG4H,EAAGw/B,EAAGshB,EAAIrmD,EAAGi0H,EAAMoB,GAE9C,IAWIx7H,EAAG+pH,EAAIryF,EAAI4xB,EAXXmyE,EAAU33H,EAAEq3G,QACZugB,EAAS53H,EAAEs3G,OACXugB,EAAO73H,EAAEu3G,KAGTt5G,EAFQ+B,EAAEwnG,MAEA,GAEV0T,EAAUtzG,EAAEyvG,QACZ8D,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KAIT18F,ECzBD,SAAiB7a,EAAG4H,EAAGw/B,EAAGshB,EAAI4tE,GAEnC,IAQIp6H,EAAG+pH,EAAIryF,EARPikG,EAAO73H,EAAEu3G,KACTugB,EAAQ93H,EAAEwnG,MAEV2T,EAASvzG,EAAE0vG,OACX8D,EAAOxzG,EAAE2vG,KAETt5G,EAAI65H,EAAM,GAIVj9G,EAAM5c,EAEV,IAAKgoH,EAAK7K,EAAKh0E,GAAIxT,EAAKwnF,EAAKh0E,EAAI,GAAIlrC,EAAI+pH,EAAI/pH,EAAI03B,EAAI13B,IAAK,CAExD,IAAIhD,EAAIiiH,EAAOj/G,GAEVk7H,GAASS,EAAM3+H,KAElB2hB,EAAM08G,GAAMr+H,EAAG8G,EAAG6a,EAAK6tC,EAAI4tE,IAK/B,IAAKp6H,EAAI2e,EAAK3e,EAAI+B,EAAG/B,IAEnBm7H,GAAOQ,EAAMnvE,EAAGxsD,IAGlB,OAAO2e,EDLKk9G,CAAQ/3H,EAAG4H,EAAGw/B,EAAGshB,EAAI4tE,GAE/B,IAAKp6H,EAAI2e,EAAK3e,EAAI+B,EAAG/B,IACnBmG,EAAEqmD,EAAGxsD,IAAM,EAIb,IAAK+pH,EAAK7K,EAAKh0E,GAAIxT,EAAKwnF,EAAKh0E,EAAI,GAAIlrC,EAAI+pH,EAAI/pH,EAAI03B,EAAI13B,IACnDmG,EAAE84G,EAAOj/G,IAAMg/G,EAAQh/G,GAIzB,IAAK,IAAIkoD,EAAKvpC,EAAKupC,EAAKnmD,EAAGmmD,IAAM,CAE/B,IAAIz8B,EAAI+gC,EAAGtE,GAEP2/D,EAAIuS,EAAOA,EAAK3uG,GAAKA,EAEzB,KAAIo8F,EAAI,GAaR,IARAkC,EAAK4R,EAAK9T,GACVnwF,EAAKikG,EAAK9T,EAAI,GAEd1hH,EAAEslB,GAAKm4E,EAAaz9F,EAAEslB,GAAIgwG,EAAQD,EAAKzR,EAAKryF,EAAK,IAEjD13B,EAAIw7H,EAAKzR,EAAK,EAAIA,EAClBzgE,EAAIkyE,EAAK9jG,EAAKA,EAAK,EAEZ13B,EAAIspD,EAAGtpD,IAAK,CAEjB,IAAIhD,EAAI0+H,EAAO17H,GAEfmG,EAAEnJ,GAAK+uD,EAAS5lD,EAAEnJ,GAAIiS,EAASwsH,EAAQz7H,GAAImG,EAAEslB,MAKjD,OAAO9M,MElFP,GAAe,CAAC,MAAO,eAAgB,WAAY,WAAY,SAAU,WAAY,gBAC9Em9G,IAA4B,QAF5B,OAE0C,IAAehsE,IAClE,IAAI,IACFriD,EAAG,aACHm2F,EAAY,SACZ30F,EAAQ,SACR88C,EAAQ,OACRgvB,EAAM,SACNE,EAAQ,aACR8oB,GACEj0C,EACAisE,EAAYR,GAAgB,CAC9B33B,eACA30F,WACA88C,aAkBF,OAAO,SAAc5/C,EAAG8J,EAAG+lH,GAEzB,IAAK7vH,EACH,OAAO,KAIT,IAIIm9C,EAFAvnD,EAFOoK,EAAEm/F,MAEA,GAGTwvB,EAAM,IACNG,EAAM,IAENhlH,IACFqzC,EAAIrzC,EAAEqzC,EACNwxE,EAAM7kH,EAAE6kH,KAAOA,EACfG,EAAMhlH,EAAEglH,KAAOA,GAIjB,IA+BIj+H,EAAGgD,EA/BH01H,EAAU,GAEVC,EAAS,GAETC,EAAO,GAGPxB,EAAI,IAAIrwB,EAAa,CACvBllE,OAAQ62F,EACRt0F,MAAOu0F,EACPna,IAAKoa,EACL5xG,KAAM,CAACjiB,EAAGA,KAGR+zH,EAAU,GAEVC,EAAS,GAETC,EAAO,GAGPS,EAAI,IAAI1yB,EAAa,CACvBllE,OAAQi3F,EACR10F,MAAO20F,EACPva,IAAKwa,EACLhyG,KAAM,CAACjiB,EAAGA,KAGRq4H,EAAO,GAKPj0H,EAAI,GAEJqmD,EAAK,GAGT,IAAKxvD,EAAI,EAAGA,EAAI+E,EAAG/E,IAEjBmJ,EAAEnJ,GAAK,EAEPo9H,EAAKp9H,IAAM,EAEX44H,EAAK54H,EAAI,GAAK,EAIhB89H,EAAM,EACNG,EAAM,EAEN,IAAK,IAAI/vF,EAAI,EAAGA,EAAInpC,EAAGmpC,IAAK,CAE1B0qF,EAAK1qF,GAAK4vF,EACV9E,EAAK9qF,GAAK+vF,EAEV,IAAIlsC,EAAMzlC,EAAIA,EAAEpe,GAAKA,EAEjBvsB,EAAMo9G,EAAU3H,EAAGjoH,EAAG4iF,EAAKviC,EAAIrmD,EAAGi0H,EAAM,GAExC6B,GAAQ,EACRxwH,GAAK,EAET,IAAKzL,EAAI2e,EAAK3e,EAAI+B,EAAG/B,IAInB,GAAIo6H,EAFJp9H,EAAIwvD,EAAGxsD,IAEO,EAAG,CAEf,IAAIk8H,EAAOzuH,EAAItH,EAAEnJ,IAEb+9E,EAAOmhD,EAAMzwH,KAEfA,EAAIywH,EACJD,EAAOj/H,QAIT+4H,EAAOkF,GAAOb,EAAKp9H,GACnB84H,EAAQmF,KAAS90H,EAAEnJ,GAKvB,IAAc,IAAVi/H,GAAexwH,GAAK,EACtB,OAAO,KAIL2uH,EAAKrrC,GAAO,GAAK9T,EAASxtE,EAAItH,EAAE4oF,IAAO9/E,EAASxD,EAAGuwH,MACrDC,EAAOltC,GAIT,IAAI29B,EAAQvmH,EAAE81H,GAUd,IARAlG,EAAOkF,GAAO/vF,EACd4qF,EAAQmF,KAASvO,EAEjB0N,EAAK6B,GAAQ/wF,EAEbyqF,EAAOmF,GAAOmB,EACdvG,EAAQoF,KAAS,EAEZ96H,EAAI2e,EAAK3e,EAAI+B,EAAG/B,IAIfo6H,EAFJp9H,EAAIwvD,EAAGxsD,IAEO,IAEZ21H,EAAOmF,GAAO99H,EAEd04H,EAAQoF,KAASl3B,EAAaz9F,EAAEnJ,GAAI0vH,IAItCvmH,EAAEnJ,GAAK,EAQX,IAHA44H,EAAK7zH,GAAK+4H,EACV9E,EAAKj0H,GAAKk5H,EAELj7H,EAAI,EAAGA,EAAI86H,EAAK96H,IACnB21H,EAAO31H,GAAKo6H,EAAKzE,EAAO31H,IAS1B,OALA01H,EAAQnoD,OAAOutD,EAAKpF,EAAQ34H,OAAS+9H,GACrCnF,EAAOpoD,OAAOutD,EAAKnF,EAAO54H,OAAS+9H,GACnChF,EAAQvoD,OAAO0tD,EAAKnF,EAAQ/4H,OAASk+H,GACrClF,EAAOxoD,OAAO0tD,EAAKlF,EAAOh5H,OAASk+H,GAE5B,CACL7G,EAAGA,EACHqC,EAAGA,EACH2D,KAAMA,OC7LR,GAAe,CAAC,QAAS,MAAO,MAAO,WAAY,YAAa,eAAgB,WAAY,SAAU,WAAY,gBAC3G+B,IAA2B,QAF3B,MAEyC,IAAersE,IACjE,IAAI,MACF+1B,EAAK,IACLp4E,EAAG,IACHmP,EAAG,SACH3N,EAAQ,UACR6qE,EAAS,aACT8pB,EAAY,SACZ73C,EAAQ,OACRgvB,EAAM,SACNE,EAAQ,aACR8oB,GACEj0C,EACAssE,EAAQnC,GAAY,CACtBr9G,MACA3N,WACA6qE,cAEEuiD,EAAOP,GAAW,CACpBruH,MACAm2F,eACA30F,WACA88C,WACAgvB,SACAE,WACA8oB,iBAwCF,OAAOle,EAnEE,MAmEU,CACjB,+BAAgC,SAAkCp6E,EAAGkiC,EAAO2uF,GAE1E,KAAK,OAAU3uF,IAAUA,EAAQ,GAAKA,EAAQ,EAC5C,MAAM,IAAIlK,MAAM,yFAIlB,GAAI64F,EAAY,GAAKA,EAAY,EAC/B,MAAM,IAAI74F,MAAM,2DAIlB,IAAIxtB,EAAImmH,EAAMzuF,EAAOliC,GAAG,GAEpBI,EAAIwwH,EAAK5wH,EAAGwK,EAAGqmH,GAEnB,MAAO,CACLlI,EAAGvoH,EAAEuoH,EACLqC,EAAG5qH,EAAE4qH,EACLz2H,EAAG6L,EAAEuuH,KACL9wE,EAAGrzC,EAAEqzC,EACLtnD,SAAU,WACR,MAAO,MAAQM,KAAK8xH,EAAEpyH,WAAa,QAAUM,KAAKm0H,EAAEz0H,WAAa,QAAUM,KAAKtC,EAAEgC,YAAcM,KAAKgnD,EAAI,QAAUhnD,KAAKgnD,EAAEtnD,WAAa,IAAM,aCzFnJ,GAAe,CAAC,QAAS,SAAU,WAAY,WAAY,aAAc,OAClEu6H,IAA2B,QAF3B,MAEyC,IAAezsE,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,SACNo+C,EAAQ,SACR98C,EAAQ,WACRkrE,EAAU,IACVia,GACEtkC,EA2BJ,OAAO+1B,EArCE,MAqCU,CACjBW,IAAK,SAAargF,GAChB,OAAO,SAAMA,IAEf,iBAAkB,SAAaA,GAC7B,IAAI6d,EAYJ,QATEA,GADE,EAAAowD,EAAA,IAASjuE,GACJA,EAAE6d,OACA9mB,MAAMgD,QAAQiG,IACvBA,EAAIwH,EAAOxH,IACF6d,OAGF,IAGIjnB,QACX,KAAK,EAEH,OAAO,SAAMoJ,GAEf,KAAK,EAEH,GAAgB,IAAZ6d,EAAK,GACP,OAAO,SAAM7d,EAAEslD,UAAU,IAEzB,MAAM,IAAI4zD,WAAW,iCAAuC,SAAOr7F,GAAQ,KAG/E,KAAK,EAGD,IAAI+pE,EAAO/pE,EAAK,GAGhB,GAAI+pE,IAFO/pE,EAAK,GAGd,OAqBZ,SAAcrW,EAAQogF,EAAMC,GAC1B,GAAa,IAATD,EAEF,OAAO,SAAMpgF,EAAO,GAAG,IAClB,GAAa,IAATogF,EAGT,OAAOhiC,EAAS98C,EAAStB,EAAO,GAAG,GAAIA,EAAO,GAAG,IAAKsB,EAAStB,EAAO,GAAG,GAAIA,EAAO,GAAG,KAOvF,IAJA,IAAI6uH,EAASpoC,EAAIzmF,GAEb4uE,EAAMigD,EAAO/F,EAAE,GAAG,GAEb91H,EAAK,EAAGA,EAAKotF,EAAMptF,IAC1B47E,EAAMttE,EAASstE,EAAKigD,EAAO/F,EAAE91H,GAAIA,IASnC,IAJA,IAAI87H,EAAa,EACbz/H,EAAI,EACJ4rC,EAAU,KAED,CACX,KAAOA,EAAQ5rC,IACbA,IAGF,GAAIA,GAAK+wF,EAAM,MAIf,IAHA,IAAItiE,EAAIzuB,EACJ80D,EAAW,GAEPlpB,EAAQ4zF,EAAOx8H,EAAEyrB,KACvBmd,EAAQ4zF,EAAOx8H,EAAEyrB,KAAM,EACvBA,EAAI+wG,EAAOx8H,EAAEyrB,GACbqmC,IAGEA,EAAW,GAAM,GACnB2qE,IAIJ,OAAOA,EAAa,GAAM,EAAIlgD,EAAMpC,EAAWoC,GAjEhCmgD,CAAKv2H,EAAE4oD,QAAQtD,UAAWsiC,GAEjC,MAAM,IAAIsxB,WAAW,iCAAuC,SAAOr7F,GAAQ,KAIjF,QAEE,MAAM,IAAIq7F,WAAW,0CAAgD,SAAOr7F,GAAQ,YCpF1F,GAAO,WACP,GAAe,CAAC,QAAS,YAAa,WAAY,eAAgB,iBAAkB,aAAc,OAAQ,OACnG24G,IAAgC,QAAQ,GAAM,IAAe7sE,IACtE,IAAI,MACF+1B,EAAK,UACL8d,EAAS,SACT53C,EAAQ,eACR03C,EAAc,aACdG,EAAY,WACZzpB,EAAU,KACV9tE,EAAI,IACJoB,GACEqiD,EAuDJ,OAAO+1B,EAAM,GAAM,CACjB,sBAAuB,SAAyB1/E,EAAGC,EAAG0/B,GAEpD,GAAiB,IAAb3/B,EAAEpJ,QAA6B,IAAbqJ,EAAErJ,QAA6B,IAAb+oC,EAAE/oC,OAAc,CACtD,IAAK6/H,EAAIz2H,GACP,MAAM,IAAI1I,UAAU,kEAGtB,IAAKm/H,EAAIx2H,GACP,MAAM,IAAI3I,UAAU,mEAGtB,IAAKm/H,EAAI92F,GACP,MAAM,IAAIroC,UAAU,kEAGtB,IAAI0O,EAAIy3F,EAAa73C,EAASjmB,EAAE,GAAIA,EAAE,IAAKimB,EAAS3lD,EAAE,GAAIA,EAAE,KACxDy2H,EAASp5B,EAAeA,EAAet3F,EAAGA,GAAI/F,EAAE,IAChD02H,EAAS3iD,EAAWspB,EAAet3F,EAAG/F,EAAE,KACxC2mC,EAAW5mC,EAAE,GACjB,OAAO42H,EAAqB52H,EAAE,GAAIA,EAAE,GAAI02H,EAAQC,EAAQ/vF,GAExD,MAAM,IAAItvC,UAAU,iCAGxB,yBAA0B,SAA4B0I,EAAGC,EAAG0/B,GAC1D,GAA8B,IAA1B7nC,OAAO4G,KAAKsB,GAAGpJ,QAA0C,IAA1BkB,OAAO4G,KAAKuB,GAAGrJ,QAA0C,IAA1BkB,OAAO4G,KAAKihC,GAAG/oC,OAAc,CAC7F,IAAK6/H,EAAIz2H,GACP,MAAM,IAAI1I,UAAU,+DAGtB,IAAKm/H,EAAIx2H,GACP,MAAM,IAAI3I,UAAU,uEAGtB,IAAKm/H,EAAI92F,GACP,MAAM,IAAIroC,UAAU,uEAGtB,GAAI,WAAY0I,GAAK,WAAYA,GAAK,eAAgBC,GAAK,eAAgBA,GAAK,eAAgB0/B,GAAK,eAAgBA,EAAG,CACtH,IAAI35B,EAAIy3F,EAAa73C,EAASjmB,EAAEk3F,WAAYl3F,EAAEm3F,YAAalxE,EAAS3lD,EAAE82H,WAAY92H,EAAE+2H,aAChFN,EAASp5B,EAAeA,EAAet3F,EAAGA,GAAI/F,EAAE+2H,YAChDL,EAAS3iD,EAAWspB,EAAet3F,EAAG/F,EAAE+2H,aACxCpwF,EAAW5mC,EAAEi3H,OACjB,OAAOL,EAAqB52H,EAAEi3H,OAAQj3H,EAAEk3H,OAAQR,EAAQC,EAAQ/vF,GAEhE,MAAM,IAAItvC,UAAU,0BAGtB,MAAM,IAAIA,UAAU,iCAGxB,eAAgB,SAAoB0I,EAAGC,GAErC,GAAiB,IAAbD,EAAEpJ,QAA6B,IAAbqJ,EAAErJ,OAAc,CACpC,IAAK6/H,EAAIz2H,GACP,MAAM,IAAI1I,UAAU,kEAGtB,IAAK6/H,EAAIl3H,GACP,MAAM,IAAI3I,UAAU,mEAGtB,OAAOs/H,EAAqB52H,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACjD,GAAiB,IAAbD,EAAEpJ,QAA6B,IAAbqJ,EAAErJ,OAAc,CAE3C,IAAKugI,EAAIn3H,GACP,MAAM,IAAI1I,UAAU,kEAGtB,IAAK8/H,EAAgBn3H,GACnB,MAAM,IAAI3I,UAAU,mEAGtB,OAAO+/H,EAAqBr3H,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACzE,GAAID,EAAEpJ,SAAWqJ,EAAErJ,QAAUoJ,EAAEpJ,OAAS,EAAG,CAEhD,IAAK0gI,EAAqBt3H,GACxB,MAAM,IAAI1I,UAAU,0DAGtB,IAAKggI,EAAqBr3H,GACxB,MAAM,IAAI3I,UAAU,0DAGtB,OAAOigI,EAAmBv3H,EAAGC,GAE7B,MAAM,IAAI3I,UAAU,iCAGxB,iBAAkB,SAAsB0I,EAAGC,GACzC,GAA8B,IAA1BnI,OAAO4G,KAAKsB,GAAGpJ,QAA0C,IAA1BkB,OAAO4G,KAAKuB,GAAGrJ,OAAc,CAC9D,IAAK6/H,EAAIz2H,GACP,MAAM,IAAI1I,UAAU,+DAGtB,IAAK6/H,EAAIl3H,GACP,MAAM,IAAI3I,UAAU,iFAGtB,GAAI,WAAY0I,GAAK,WAAYA,GAAK,eAAgBC,GAAK,eAAgBA,GAAK,aAAcA,EAC5F,OAAO22H,EAAqB52H,EAAEi3H,OAAQj3H,EAAEk3H,OAAQj3H,EAAEu3H,WAAYv3H,EAAEw3H,WAAYx3H,EAAE2mC,UAE9E,MAAM,IAAItvC,UAAU,0BAEjB,GAA8B,IAA1BQ,OAAO4G,KAAKsB,GAAGpJ,QAA0C,IAA1BkB,OAAO4G,KAAKuB,GAAGrJ,OAAc,CAErE,IAAKugI,EAAIn3H,GACP,MAAM,IAAI1I,UAAU,uEAGtB,IAAK8/H,EAAgBn3H,GACnB,MAAM,IAAI3I,UAAU,oEAGtB,GAAI,WAAY0I,GAAK,WAAYA,GAAK,OAAQC,GAAK,OAAQA,GAAK,OAAQA,GAAK,MAAOA,GAAK,MAAOA,GAAK,MAAOA,EAC1G,OAAOo3H,EAAqBr3H,EAAEi3H,OAAQj3H,EAAEk3H,OAAQl3H,EAAE03H,OAAQz3H,EAAE81G,GAAI91G,EAAE+1G,GAAI/1G,EAAE03H,GAAI13H,EAAEqF,EAAGrF,EAAEsF,EAAGtF,EAAEuF,GAExF,MAAM,IAAIlO,UAAU,0BAEjB,GAA8B,IAA1BQ,OAAO4G,KAAKsB,GAAGpJ,QAA0C,IAA1BkB,OAAO4G,KAAKuB,GAAGrJ,OAAc,CAErE,IAAK6/H,EAAIz2H,GACP,MAAM,IAAI1I,UAAU,qEAGtB,IAAKm/H,EAAIx2H,GACP,MAAM,IAAI3I,UAAU,qEAGtB,GAAI,cAAe0I,GAAK,cAAeA,GAAK,cAAeC,GAAK,cAAeA,EAC7E,OAAOs3H,EAAmB,CAACv3H,EAAE43H,UAAW53H,EAAE63H,WAAY,CAAC53H,EAAE63H,UAAW73H,EAAE83H,YAEtE,MAAM,IAAIzgI,UAAU,0BAEjB,GAA8B,IAA1BQ,OAAO4G,KAAKsB,GAAGpJ,QAA0C,IAA1BkB,OAAO4G,KAAKuB,GAAGrJ,OAAc,CAErE,IAAKugI,EAAIn3H,GACP,MAAM,IAAI1I,UAAU,gFAGtB,IAAK6/H,EAAIl3H,GACP,MAAM,IAAI3I,UAAU,gFAGtB,GAAI,cAAe0I,GAAK,cAAeA,GAAK,cAAeA,GAAK,cAAeC,GAAK,cAAeA,GAAK,cAAeA,EACrH,OAAOs3H,EAAmB,CAACv3H,EAAE43H,UAAW53H,EAAE63H,UAAW73H,EAAEg4H,WAAY,CAAC/3H,EAAE63H,UAAW73H,EAAE83H,UAAW93H,EAAEg4H,YAEhG,MAAM,IAAI3gI,UAAU,0BAGtB,MAAM,IAAIA,UAAU,iCAGxBP,MAAO,SAAeL,GACpB,IA2DJ,SAAmB4O,GAEjB,GAAoB,IAAhBA,EAAE,GAAG1O,QAAgBshI,EAAU5yH,EAAE,GAAG,KAAO4yH,EAAU5yH,EAAE,GAAG,KAC5D,GAAIA,EAAEsE,MAAKuuH,GAAoB,IAAdA,EAAGvhI,SAAiBshI,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MACrE,OAAO,MAEJ,MAAoB,IAAhB7yH,EAAE,GAAG1O,QAAgBshI,EAAU5yH,EAAE,GAAG,KAAO4yH,EAAU5yH,EAAE,GAAG,KAAO4yH,EAAU5yH,EAAE,GAAG,KAKzF,OAAO,EAJP,GAAIA,EAAEsE,MAAKuuH,GAAoB,IAAdA,EAAGvhI,SAAiBshI,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MAC1F,OAAO,EAMX,OAAO,EAzEAC,CAAU1hI,GACb,MAAM,IAAIY,UAAU,oEAGtB,OAkGJ,SAA2BgO,GAKzB,IAJA,IAAID,EAAS,GACTgzH,EAAS,GACTC,EAAS,GAEJzhI,EAAI,EAAGA,EAAIyO,EAAE1O,OAAS,EAAGC,IAChC,IAAK,IAAIyuB,EAAIzuB,EAAI,EAAGyuB,EAAIhgB,EAAE1O,OAAQ0uB,IACZ,IAAhBhgB,EAAE,GAAG1O,QACPyhI,EAAS,CAAC/yH,EAAEzO,GAAG,GAAIyO,EAAEzO,GAAG,IACxByhI,EAAS,CAAChzH,EAAEggB,GAAG,GAAIhgB,EAAEggB,GAAG,KACC,IAAhBhgB,EAAE,GAAG1O,SACdyhI,EAAS,CAAC/yH,EAAEzO,GAAG,GAAIyO,EAAEzO,GAAG,GAAIyO,EAAEzO,GAAG,IACjCyhI,EAAS,CAAChzH,EAAEggB,GAAG,GAAIhgB,EAAEggB,GAAG,GAAIhgB,EAAEggB,GAAG,KAGnCjgB,EAAO1K,KAAK48H,EAAmBc,EAAQC,IAI3C,OAAOjzH,EArHEkzH,CAAkB7hI,MAI7B,SAASwhI,EAAU5yH,GAEjB,MAAoB,iBAANA,IAAkB,EAAA2oE,EAAA,IAAY3oE,GAG9C,SAASmxH,EAAInxH,GAMX,OAJIA,EAAE5L,cAAgB3C,QACpBuO,EAAIkzH,EAAelzH,IAGd4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,IAGxC,SAAS6xH,EAAI7xH,GAMX,OAJIA,EAAE5L,cAAgB3C,QACpBuO,EAAIkzH,EAAelzH,IAGd4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,IAG3D,SAASgyH,EAAqBhyH,GAM5B,OAJKvO,MAAMgD,QAAQuL,KACjBA,EAAIkzH,EAAelzH,IAGdA,EAAE6pE,MAAM+oD,GAGjB,SAASd,EAAgB9xH,GAKvB,OAJIA,EAAE5L,cAAgB3C,QACpBuO,EAAIkzH,EAAelzH,IAGd4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,KAAO4yH,EAAU5yH,EAAE,IAGpH,SAASkzH,EAAer/H,GAItB,IAHA,IAAIuF,EAAO5G,OAAO4G,KAAKvF,GACnBmM,EAAI,GAECzO,EAAI,EAAGA,EAAI6H,EAAK9H,OAAQC,IAC/ByO,EAAE3K,KAAKxB,EAAEuF,EAAK7H,KAGhB,OAAOyO,EAoBT,SAASsxH,EAAqB52H,EAAGC,EAAGqF,EAAGC,EAAGC,GACxC,IAAIm9C,EAAMr7C,EAAIk2F,EAAUA,EAAUF,EAAeh4F,EAAGtF,GAAIs9F,EAAe/3F,EAAGtF,IAAKuF,IAC3E0jH,EAAMhjH,EAAKs3F,EAAUF,EAAeh4F,EAAGA,GAAIg4F,EAAe/3F,EAAGA,KACjE,OAAOk4F,EAAa96C,EAAKumE,GAG3B,SAASmO,EAAqBr3H,EAAGC,EAAG0/B,EAAGo2E,EAAIC,EAAI2hB,EAAIryH,EAAGC,EAAGC,GACvD,IAAIm9C,EAAM,CAACiD,EAAS03C,EAAe13C,EAASowD,EAAI/1G,GAAIuF,GAAI83F,EAAe13C,EAAS+xE,EAAIh4F,GAAIp6B,IAAKqgD,EAAS03C,EAAe13C,EAAS+xE,EAAIh4F,GAAIr6B,GAAIg4F,EAAe13C,EAASmwD,EAAI/1G,GAAIwF,IAAKogD,EAAS03C,EAAe13C,EAASmwD,EAAI/1G,GAAIuF,GAAI+3F,EAAe13C,EAASowD,EAAI/1G,GAAIqF,KAC5Pq9C,EAAMz8C,EAAKs3F,EAAUA,EAAUF,EAAe36C,EAAI,GAAIA,EAAI,IAAK26C,EAAe36C,EAAI,GAAIA,EAAI,KAAM26C,EAAe36C,EAAI,GAAIA,EAAI,MAC3H,IAAIumE,EAAMhjH,EAAKs3F,EAAUA,EAAUF,EAAeh4F,EAAGA,GAAIg4F,EAAe/3F,EAAGA,IAAK+3F,EAAe93F,EAAGA,KAClG,OAAOi4F,EAAa96C,EAAKumE,GAG3B,SAASqO,EAAmBv3H,EAAGC,GAK7B,IAJA,IAAIw4H,EAAaz4H,EAAEpJ,OACfyO,EAAS,EACTwE,EAAO,EAEFhT,EAAI,EAAGA,EAAI4hI,EAAY5hI,IAC9BgT,EAAO+7C,EAAS5lD,EAAEnJ,GAAIoJ,EAAEpJ,IACxBwO,EAASm4F,EAAUF,EAAezzF,EAAMA,GAAOxE,GAGjD,OAAOa,EAAKb,OClUZ,GAAO,aACP,GAAe,CAAC,QAAS,YAAa,WAAY,iBAAkB,eAAgB,MAAO,YAAa,eAAgB,aAAc,YAAa,UAC5IqzH,IAAkC,QAAQ,GAAM,IAAe/uE,IACxE,IAAI,MACF+1B,EAAK,UACL8d,EAAS,SACT53C,EAAQ,eACR03C,EAAc,aACdG,EAAY,IACZ1uF,EAAG,UACH8kE,EAAS,aACT6C,EAAY,WACZz0B,EAAU,UACVrxC,EAAS,OACTgkE,GACEjrB,EA0BJ,OAAO+1B,EAAM,GAAM,CACjB,yCAA0C,SAAwC9jF,EAAGmpC,GACnF,IAAKn0B,EAAUhV,IAAMqmD,EAAWrmD,KAAOgV,EAAUm0B,IAAMkd,EAAWld,GAChE,MAAM,IAAIztC,UAAU,8DACf,GAAIs9E,EAAO7vC,EAAGnpC,GACnB,MAAM,IAAItE,UAAU,4DAOtB,IAHA,IAAIqhI,EAAa9kD,EAAU9uC,GACvB1/B,EAAS,EAEJxO,EAAI,EAAGA,GAAKkuC,EAAGluC,IAAK,CAC3B,IAAI+hI,EAAc7pH,GAAK,EAAG62C,EAAS7gB,EAAGluC,IAClCgiI,EAAWniD,EAAa3xC,EAAGluC,GAC3BiiI,EAAS/pH,EAAIlY,EAAG+E,GACpByJ,EAASm4F,EAAUn4F,EAAQi4F,EAAeA,EAAeu7B,EAAUC,GAASF,IAG9E,OAAOn7B,EAAap4F,EAAQszH,SC5D9B,GAAO,UACP,GAAe,CAAC,QAAS,YAAa,eAAgB,iBAAkB,eAAgB,aAAc,aAC/FI,IAA+B,QAAQ,GAAM,IAAepvE,IACrE,IAAI,MACF+1B,EAAK,UACL8d,EAAS,aACTC,EAAY,eACZH,EAAc,aACd5mB,EAAY,WACZz0B,EAAU,UACVrxC,GACE+4C,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,qBAAsB,SAAyB9jF,GAC7C,IAAKgV,EAAUhV,IAAMqmD,EAAWrmD,GAC9B,MAAM,IAAItE,UAAU,2DAGtB,OAAOmmG,EAAa/mB,EAAa4mB,EAAe1hG,EAAG,GAAIA,GAAI4hG,EAAU5hG,EAAG,UCxC1E,GAAO,QACP,GAAe,CAAC,QAAS,OAAQ,QAC1Bo9H,IAA6B,QAAQ,GAAM,IAAervE,IACnE,IAAI,MACF+1B,EAAK,KACL7hE,EAAI,KACJkoC,GACE4D,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB9f,OAAQ,SAAgB5/D,GACtB,OAAOA,EAAEpJ,QAEX,iBAAkB,SAAqBoJ,GACrC,OAAO+lD,EAAKloC,EAAK7d,UChCnB,GAAe,CAAC,SAAU,QAAS,eAAgB,WAC5Ci5H,IAA2B,QAF3B,MAEyC,IAAetvE,IACjE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,aACNw1C,EAAY,QACZ/9D,GACEiqB,EAoCJ,OAAO+1B,EA5CE,MA4CU,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,GAAK,GAAKioD,EAAO6kB,YACZo9B,GAAUlqG,GAGV,IAAI0/B,EAAQ1/B,EAAG,GAAGw/B,OAG7BE,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEw/B,OAEXg0D,UAAW,SAAmBxzF,GAC5B,OAAKA,EAAEiiD,cAAgBgG,EAAO6kB,YACrB9sE,EAAEwhD,KAGF,IAAI9hB,EAAQ1/B,EAAE4kD,WAAY,GAAGplB,OAGxC,iBAAkB,SAAqBx/B,GACrC,OAAO,SAAQA,EAAG7D,OAEpB,WAAY,SAAgB6D,EAAGtH,GAE7B,OAAO+kG,EAAathG,KAAK6D,GAAI7D,KAAKzD,UChEpC,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,cAAe,eAAgB,eAC3DwgI,IAAiC,QAAQ,GAAM,IAAevvE,IACvE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,YACN61F,EAAW,aACXI,EAAY,YACZE,GACEh0C,EACA+xD,EAAcV,GAAkB,CAClCt7B,QACA2d,gBAEEse,EAAcT,GAAkB,CAClCx7B,UAEEk9B,EAAcL,GAAkB,CAClC78B,QACAie,gBAEEke,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEEye,EAAcN,GAAkB,CAClC97B,QACAie,gBAEEmd,EAAcb,GAAkB,CAClCv6B,UAEEq7B,EAAcN,GAAkB,CAClC/6B,UA6BF,OAAOA,EAAM,GAAM,CACjB,WAAY+d,EACZ,6BAA8B,SAAkCz9F,EAAGC,GACjE,OAAO28G,EAAY58G,EAAGC,EAAGw9F,GAAc,IAEzC,4BAA6B,SAAiCz9F,EAAGC,GAC/D,OAAOy7G,EAAYz7G,EAAGD,EAAGy9F,GAAc,IAEzC,4BAA6B,SAAiCz9F,EAAGC,GAC/D,OAAO07G,EAAY37G,EAAGC,EAAGw9F,GAAc,IAEzC,2BAA4B,SAAgCz9F,EAAGC,GAC7D,OAAO66G,EAAY96G,EAAGC,EAAGw9F,IAE3B,eAAgB,SAAoBz9F,EAAGC,GAErC,OAAO9D,KAAKqL,EAAOxH,GAAIwH,EAAOvH,IAAIqlD,WAEpC,gBAAiB,SAAqBtlD,EAAGC,GAEvC,OAAO9D,KAAKqL,EAAOxH,GAAIC,IAEzB,gBAAiB,SAAqBD,EAAGC,GAEvC,OAAO9D,KAAK6D,EAAGwH,EAAOvH,KAExB,oBAAqB,SAAyBD,EAAGC,GAC/C,OAAO47G,EAAY77G,EAAGC,EAAGw9F,GAAc,IAEzC,mBAAoB,SAAwBz9F,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAGw9F,GAAc,IAEzC,oBAAqB,SAAyBz9F,EAAGC,GAC/C,OAAO67G,EAAY77G,EAAGD,EAAGy9F,GAAc,IAEzC,mBAAoB,SAAwBz9F,EAAGC,GAC7C,OAAO86G,EAAY96G,EAAGD,EAAGy9F,GAAc,IAEzC,aAAc,SAAkBz9F,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAGw9F,GAAc,GAAOn4C,WAExD,aAAc,SAAkBtlD,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOvH,GAAID,EAAGy9F,GAAc,GAAMn4C,gBChHvD,GAAO,YACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzF6zE,IAAiC,QAAQ,GAAM,IAAexvE,IACvE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,aACNi2F,EAAY,eACZH,EAAc,SACd13C,EAAQ,YACRy3C,EAAW,YACXM,GACEh0C,EACA2jE,EAAkBL,GAAsB,CAC1CtvB,gBA2BF,OAAOje,EAAM,GAAM,CACjB,+BAAgC,SAAiC15E,EAAGT,GAClE,OAoEJ,SAAqCS,EAAGgoH,GAStC,IAPA,IAAIjjE,EAAI,CAACuiE,EAAgBtnH,EAAGgoH,GAAI,GAAM9oB,MAAMpyF,KAAI9V,GAAKA,EAAE,MACnD4qF,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAClBzsE,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KAEHr+G,EAAImwG,EAAU,EAAGnwG,GAAK,EAAGA,IAGhC,IAFA,IAAIo3H,EAAIljE,EAAEn0D,OAEDmuC,EAAI,EAAGA,EAAIkpF,EAAGlpF,IAAK,CAW1B,IAVA,IAAIx/B,EAAIwlD,EAAEhmB,GAENmpF,EAAU,GACVC,EAAW,GAEXp/E,EAAasmE,EAAIx+G,GAGjBu3H,EAAM,EAED9oG,EAJO+vF,EAAIx+G,EAAI,GAIC,EAAGyuB,GAAKypB,EAAYzpB,IAAK,CAChD,IAAIo8F,EAAIzmF,EAAM3V,GAEVo8F,IAAM7qH,EACRu3H,EAAM11F,EAAOpT,GACJo8F,EAAI7qH,IAEbq3H,EAAQvzH,KAAK+9B,EAAOpT,IACpB6oG,EAASxzH,KAAK+mH,IAIlB,GAAKrkB,EAAY+wB,EAAK,GAQf,GAAK/wB,EAAY93F,EAAE1O,GAAI,IAWvB,GAAU,IAANkuC,EAAS,CAElB,IAAIspF,EAAO,IAAI9oH,GACf8oH,EAAKx3H,GAAK,EAEV,IAAK,IAAIy3H,EAAM,EAAGC,EAAcJ,EAASv3H,OAAQ03H,EAAMC,EAAaD,IAAO,CACzE,IAAIE,EAAML,EAASG,GACnBD,EAAKG,GAAO5oE,EAASyoE,EAAKG,GAAMN,EAAQI,IAG1CvjE,EAAEpwD,KAAK0zH,QArByB,CAEhC,GAAU,IAANtpF,EAEF,MAAO,GAGPgmB,EAAEqc,OAAOriC,EAAG,GACZA,GAAK,EACLkpF,GAAK,MAjBiB,CAExB1oH,EAAE1O,GAAK4mG,EAAal4F,EAAE1O,GAAIu3H,GAE1B,IAAK,IAAIK,EAAM,EAAGC,EAAaP,EAASv3H,OAAQ63H,EAAMC,EAAYD,IAAO,CACvE,IAAIE,EAAKR,EAASM,GAClBlpH,EAAEopH,GAAM/oE,EAASrgD,EAAEopH,GAAKrxB,EAAe/3F,EAAE1O,GAAIq3H,EAAQO,OA4B7D,OAAO1jE,EAAEj4C,KAAI9S,GAAK,IAAI29F,EAAY,CAChCzgG,KAAM8C,EAAE8S,KAAI9V,GAAK,CAACA,KAClB6gB,KAAM,CAAC+pE,EAAM,OA3INwxC,CAA4BpzH,EAAGT,IAExC,8BAA+B,SAAgCS,EAAGT,GAChE,OAAO8zH,EAA2BrzH,EAAGT,IAEvC,wBAAyB,SAA0BD,EAAGC,GAKpD,OAFQ8zH,EAFA7xH,EAAOlC,GAEuBC,GAE7BuN,KAAInK,GAAKA,EAAE28C,eAIxB,SAAS+zE,EAA2BrzH,EAAGgoH,GASrC,IALA,IAAIjjE,EAAI,CAACuiE,EAAgBtnH,EAAGgoH,GAAI,GAAM9oB,MAAMpyF,KAAI9V,GAAKA,EAAE,MACnD6tD,EAAI7kD,EAAEk/F,MACNtd,EAAO5hF,EAAEm/F,MAAM,GAGVtuG,EAFKmP,EAAEm/F,MAAM,GAEC,EAAGtuG,GAAK,EAAGA,IAGhC,IAFA,IAAIo3H,EAAIljE,EAAEn0D,OAEDmuC,EAAI,EAAGA,EAAIkpF,EAAGlpF,IAAK,CAC1B,IAAIx/B,EAAIwlD,EAAEhmB,GAEV,GAAKs4D,EAAYxyC,EAAEh0D,GAAGA,GAAI,GAQnB,GAAKwmG,EAAY93F,EAAE1O,GAAI,IAWvB,GAAU,IAANkuC,EAAS,CAElB,IAAIspF,EAAO,IAAI9oH,GACf8oH,EAAKx3H,GAAK,EAEV,IAAK,IAAIg2G,EAAKh2G,EAAI,EAAGg2G,GAAM,EAAGA,IAC5BwhB,EAAKxhB,GAAMjnD,EAASyoE,EAAKxhB,GAAKhiD,EAAEgiD,GAAIh2G,IAGtCk0D,EAAEpwD,KAAK0zH,QApByB,CAEhC,GAAU,IAANtpF,EAEF,MAAO,GAGPgmB,EAAEqc,OAAOriC,EAAG,GACZA,GAAK,EACLkpF,GAAK,MAjBqB,CAE5B1oH,EAAE1O,GAAK4mG,EAAal4F,EAAE1O,GAAIg0D,EAAEh0D,GAAGA,IAE/B,IAAK,IAAIyuB,EAAIzuB,EAAI,EAAGyuB,GAAK,EAAGA,IAE1B/f,EAAE+f,GAAKsgC,EAASrgD,EAAE+f,GAAIg4E,EAAe/3F,EAAE1O,GAAIg0D,EAAEvlC,GAAGzuB,MA2BxD,OAAOk0D,EAAEj4C,KAAI9S,GAAK,IAAI29F,EAAY,CAChCzgG,KAAM8C,EAAE8S,KAAI9V,GAAK,CAACA,KAClB6gB,KAAM,CAAC+pE,EAAM,WC1Gf,GAAO,QACP,GAAe,CAAC,QAAS,MAAO,YAAa,eAAgB,iBAAkB,OAAQ,UAAW,cAC3F0xC,IAA6B,QAAQ,GAAM,IAAe3vE,IACnE,IAAI,MACF+1B,EAAK,IACLp4E,EAAG,UACHk2F,EAAS,aACTC,EAAY,eACZH,EAAc,KACdp3F,EAAI,QACJyuE,EAAO,WACPzyB,GACEyH,EA8BJ,OAAO+1B,EAAM,GAAM,CACjB,yBAeF,SAAgBlnD,GAMd,IAHA,IAAInzB,EAAS,EACT4pD,EAAU,EAELp4D,EAAI,EAAGA,EAAI2hC,EAAK5hC,OAAQC,IAAK,CACpC,IAAIoC,EAAQqO,EAAIkxB,EAAK3hC,IAEjB89E,EAAQ1lB,EAASh2D,IACnBoM,EAASi4F,EAAej4F,EAAQi4F,EAAeG,EAAaxuC,EAASh2D,GAAQwkG,EAAaxuC,EAASh2D,KACnGoM,EAASm4F,EAAUn4F,EAAQ,GAC3B4pD,EAAUh2D,GAEVoM,EAASm4F,EAAUn4F,EAAQ68C,EAAWjpD,GAASqkG,EAAeG,EAAaxkG,EAAOg2D,GAAUwuC,EAAaxkG,EAAOg2D,IAAYh2D,GAIhI,OAAOqkG,EAAeruC,EAAS/oD,EAAKb,KAhCpCtO,MAAO,SAAeiJ,GACpB,OAAO7D,KAAKouD,MAAMpuD,MAAM,SAAQ6D,KAElC09F,OAAQ,SAAgB19F,GACtB,OAAO7D,KAAKouD,MAAMpuD,MAAM,SAAQ6D,EAAE07F,kBClDxC,SAASnyC,KAA2Q,OAA9PA,GAAWzxD,OAAOk6B,QAAU,SAAUx6B,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAS5U,UAAUtlC,GAAI,IAAK,IAAImB,KAAO+4C,EAAcj5C,OAAOM,UAAUQ,eAAeC,KAAKk4C,EAAQ/4C,KAAQR,EAAOQ,GAAO+4C,EAAO/4C,IAAY,OAAOR,IAA2B+yD,MAAMpuD,KAAMggC,WAGhT,IACI,GAAe,CAAC,QAAS,SAAU,QAAS,WAAY,SAAU,QAAS,OAAQ,OAAQ,OAAQ,aAAc,YAAa,eAAgB,iBAAkB,WAAY,WACrKo9F,IAA0B,QAF1B,KAEwC,IAAe5vE,IAChE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,MACNgoF,EAAK,SACLzyB,EAAQ,OACRvd,EAAM,MACNi1B,EAAK,KACL/tB,EAAI,KACJxgD,EAAI,KACJgwE,EAAI,WACJlC,EAAU,UACVwpB,EAAS,aACTC,EAAY,eACZH,EAAc,SACd13C,EAAQ,QACRiyB,GACEluB,EA6CJ,OAAOJ,GAASm2B,EAhEP,KAgEmB,CAC1Bie,YAAa,SAAqB33F,GAChC,OAAOwzH,EAASxzH,IAElB43F,aAAc,SAAsB53F,GAClC,OAiKJ,SAAmBA,GACjB,MAAM,IAAIs3B,MAAM,8CAlKPm8F,IAET1iI,MAAO,SAAeuO,GAEpB,IAEIqD,EAAI6wH,EAFAhyH,EAAOlC,IAKf,MAAO,CACLmpG,EAAG9lG,EAAE8lG,EAAEnpD,UACPo0E,EAAG/wH,EAAE+wH,EAAEp0E,cAGT,CACFq0E,iBAGF,SAASA,EAAa3zH,GAEpB,IASInP,EAAGyuB,EAAGyf,EATN6iD,EAAO5hF,EAAEm/F,MAAM,GAEftd,EAAO7hF,EAAEm/F,MAAM,GAEfsJ,EAAI1xC,EAAS,CAAC6qB,GAAO,SACrBgyC,EAAQnrB,EAAEvJ,MACVw0B,EAAI1zH,EAAE4iD,QACNixE,EAAQH,EAAEx0B,MAGVhlG,EAAIsvF,EAAM,CAAC5H,GAAO,IAEtB,IAAK7iD,EAAI,EAAGA,EAAInjC,KAAK+iB,IAAIkjE,EAAMD,KAAS7iD,EAAG,CAwBzC,IAAIwhF,EAAQsT,EAAM90F,GAAGA,GACjB+0F,EAAM9lD,EAAWS,EAAM8xC,EAAO,GAAK,EAAI7/D,EAAK6/D,IAC5CwT,EAAU7jD,EAAK4jD,GACfE,EAAe,EAEnB,IAAKnjI,EAAIkuC,EAAGluC,EAAI+wF,EAAM/wF,IACpBmjI,EAAex8B,EAAUw8B,EAAc18B,EAAeu8B,EAAMhjI,GAAGkuC,GAAImxC,EAAK2jD,EAAMhjI,GAAGkuC,MAGnF,IAAI5Z,EAAQmyE,EAAew8B,EAAK5zH,EAAK8zH,IAErC,IAAKx6E,EAAOr0B,GAAQ,CAElB,IAAI8uG,EAAKr0E,EAAS2gE,EAAOp7F,GAIzB,IAFAjrB,EAAE6kC,GAAK,EAEFluC,EAAIkuC,EAAI,EAAGluC,EAAI+wF,EAAM/wF,IACxBqJ,EAAErJ,GAAK4mG,EAAao8B,EAAMhjI,GAAGkuC,GAAIk1F,GAInC,IAAIxnD,EAAMuB,EAAWkC,EAAKunB,EAAaw8B,EAAI9uG,KACvCrb,OAAI,EAcR,IAAKwV,EAAIyf,EAAGzf,EAAIuiE,EAAMviE,IAAK,CAGzB,IAFAxV,EAAI,EAECjZ,EAAIkuC,EAAGluC,EAAI+wF,EAAM/wF,IACpBiZ,EAAI0tF,EAAU1tF,EAAGwtF,EAAepnB,EAAKh2E,EAAErJ,IAAKgjI,EAAMhjI,GAAGyuB,KAMvD,IAFAxV,EAAIwtF,EAAextF,EAAG2iE,GAEjB57E,EAAIkuC,EAAGluC,EAAI+wF,EAAM/wF,IACpBgjI,EAAMhjI,GAAGyuB,GAAKg4E,EAAe13C,EAASi0E,EAAMhjI,GAAGyuB,GAAIg4E,EAAep9F,EAAErJ,GAAIiZ,IAAKiqH,GAYjF,IAAKljI,EAAI,EAAGA,EAAI+wF,EAAM/wF,IAAK,CAGzB,IAFAiZ,EAAI,EAECwV,EAAIyf,EAAGzf,EAAIsiE,EAAMtiE,IACpBxV,EAAI0tF,EAAU1tF,EAAGwtF,EAAes8B,EAAM/iI,GAAGyuB,GAAIplB,EAAEolB,KAMjD,IAFAxV,EAAIwtF,EAAextF,EAAG2iE,GAEjBntD,EAAIyf,EAAGzf,EAAIsiE,IAAQtiE,EACtBs0G,EAAM/iI,GAAGyuB,GAAKm4E,EAAa73C,EAASg0E,EAAM/iI,GAAGyuB,GAAIg4E,EAAextF,EAAGomE,EAAKh2E,EAAEolB,MAAOy0G,KAOzF,MAAO,CACLtrB,EAAGA,EACHirB,EAAGA,EACH79H,SAAU,WACR,MAAO,MAAQM,KAAKsyG,EAAE5yG,WAAa,QAAUM,KAAKu9H,EAAE79H,aAK1D,SAAS29H,EAASxzH,GAChB,IAAIw7B,EAAMm4F,EAAa3zH,GAEnB6zH,EAAQr4F,EAAIk4F,EAAEx0B,MAElB,GAAIl/F,EAAEk/F,MAAMtuG,OAAS,EAGnB,IAFA,IAAI0+G,EAA4B,YAArBukB,EAAM,GAAG,GAAGt9H,KAAqBs7E,EAAQ,GAAK,EAEhDhhF,EAAI,EAAGA,EAAIgjI,EAAMjjI,SAAUC,EAClC,IAAK,IAAIyuB,EAAI,EAAGA,EAAIzuB,GAAKyuB,GAAKu0G,EAAM,IAAM,IAAIjjI,SAAU0uB,EACtDu0G,EAAMhjI,GAAGyuB,GAAKgwF,EAKpB,OAAO9zE,MCjOP,GAAe,CAAC,QAAS,SAAU,eAAgB,YAAa,WAAY,aAAc,MAAO,WAAY,OACtG04F,IAA2B,QAF3B,MAEyC,IAAevwE,IACjE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,aACNi2F,EAAY,UACZD,EAAS,SACT10F,EAAQ,WACRkrE,EAAU,IACVoC,EAAG,SACHrZ,EAAQ,IACRz1D,GACEqiD,EAsBJ,OAAO+1B,EAnCE,MAmCU,CACjB,iBAAkB,SAAqB1/E,GACrC,IAAI6d,GAAO,EAAAowD,EAAA,IAASjuE,GAAKA,EAAE6d,QAAS,SAAU7d,GAE9C,OAAQ6d,EAAKjnB,QACX,KAAK,EAEH,GAAgB,IAAZinB,EAAK,GACP,OAAI,EAAAowD,EAAA,IAASjuE,GACJwH,EAAO,CAACi2F,EAAa,EAAGz9F,EAAEslD,UAAU,MAEpC,CAACm4C,EAAa,EAAGz9F,EAAE,KAG5B,MAAM,IAAIk5G,WAAW,iCAAuC,SAAOr7F,GAAQ,KAG/E,KAAK,EAGD,IAAI+pE,EAAO/pE,EAAK,GACZgqE,EAAOhqE,EAAK,GAEhB,GAAI+pE,IAASC,EACX,OAAI,EAAA5Z,EAAA,IAASjuE,GACJwH,EAAO2yH,EAAKn6H,EAAEslD,UAAWsiC,EAAMC,GAAO7nF,EAAEqhG,WAGxC84B,EAAKn6H,EAAG4nF,EAAMC,GAGvB,MAAM,IAAIqxB,WAAW,iCAAuC,SAAOr7F,GAAQ,KAIjF,QAEE,MAAM,IAAIq7F,WAAW,0CAAgD,SAAOr7F,GAAQ,OAG1FwiE,IAAK,SAAargF,GAEhB,OAAOy9F,EAAa,EAAGz9F,MAY3B,SAASm6H,EAAKC,EAAKxyC,EAAMC,GACvB,IAAIl/E,EAAGmH,EAAGpK,EAAGzM,EAAOkoC,EAEpB,GAAa,IAATymD,EAAY,CAId,GAAc,KAFd3uF,EAAQmhI,EAAI,GAAG,IAGb,MAAM98F,MAAM,iDAGd,MAAO,CAAC,CAACmgE,EAAa,EAAGxkG,KACpB,GAAa,IAAT2uF,EAAY,CAErB,IAAIniF,EAAI2wE,EAAIgkD,GAEZ,GAAU,IAAN30H,EACF,MAAM63B,MAAM,iDAGd,MAAO,CAAC,CAACmgE,EAAa28B,EAAI,GAAG,GAAI30H,GAAIg4F,EAAazpB,EAAWomD,EAAI,GAAG,IAAK30H,IAAK,CAACg4F,EAAazpB,EAAWomD,EAAI,GAAG,IAAK30H,GAAIg4F,EAAa28B,EAAI,GAAG,GAAI30H,KAQ/I,IAAIqlD,EAAIsvE,EAAI/7F,SAEZ,IAAK11B,EAAI,EAAGA,EAAIi/E,EAAMj/E,IACpBmiD,EAAEniD,GAAKmiD,EAAEniD,GAAG01B,SAOd,IAFA,IAAI0sB,EAAIgS,EAAS6qB,GAAMtiC,UAEd9/C,EAAI,EAAGA,EAAIqiF,EAAMriF,IAAK,CAE7B,IAAI60H,EAAO/yH,EAAIwjD,EAAEtlD,GAAGA,IAChB80H,EAAO90H,EAGX,IAFAmD,EAAInD,EAAI,EAEDmD,EAAIi/E,GACLtgF,EAAIwjD,EAAEniD,GAAGnD,IAAM60H,IACjBA,EAAO/yH,EAAIwjD,EAAEniD,GAAGnD,IAChB80H,EAAO3xH,GAGTA,IAGF,GAAa,IAAT0xH,EACF,MAAM/8F,MAAM,kDAGd30B,EAAI2xH,KAEM90H,IACR27B,EAAO2pB,EAAEtlD,GACTslD,EAAEtlD,GAAKslD,EAAEniD,GACTmiD,EAAEniD,GAAKw4B,EACPA,EAAO4pB,EAAEvlD,GACTulD,EAAEvlD,GAAKulD,EAAEpiD,GACToiD,EAAEpiD,GAAKw4B,GAIT,IAAIo5F,EAAKzvE,EAAEtlD,GACPg1H,EAAKzvE,EAAEvlD,GAEX,IAAKmD,EAAI,EAAGA,EAAIi/E,EAAMj/E,IAAK,CACzB,IAAI8xH,EAAK3vE,EAAEniD,GACP+xH,EAAK3vE,EAAEpiD,GAEX,GAAIA,IAAMnD,GAER,GAAc,IAAVi1H,EAAGj1H,GAAU,CAIf,IAHAE,EAAI+3F,EAAazpB,EAAWymD,EAAGj1H,IAAK+0H,EAAG/0H,IAGlCsK,EAAItK,EAAGsK,EAAI+3E,EAAM/3E,IACpB2qH,EAAG3qH,GAAK0tF,EAAUi9B,EAAG3qH,GAAIhH,EAASpD,EAAG60H,EAAGzqH,KAG1C,IAAKA,EAAI,EAAGA,EAAI+3E,EAAM/3E,IACpB4qH,EAAG5qH,GAAK0tF,EAAUk9B,EAAG5qH,GAAIhH,EAASpD,EAAG80H,EAAG1qH,UAGvC,CAKL,IAFApK,EAAI60H,EAAG/0H,GAEFsK,EAAItK,EAAGsK,EAAI+3E,EAAM/3E,IACpB2qH,EAAG3qH,GAAK2tF,EAAag9B,EAAG3qH,GAAIpK,GAG9B,IAAKoK,EAAI,EAAGA,EAAI+3E,EAAM/3E,IACpB4qH,EAAG5qH,GAAK2tF,EAAai9B,EAAG5qH,GAAIpK,KAMpC,OAAOqlD,MCpMT,GAAO,OACP,GAAe,CAAC,QAAS,MAAO,MAAO,WAAY,MAAO,YACnD4vE,IAA4B,QAAQ,GAAM,IAAehxE,IAClE,IAAI,MACF+1B,EAAK,IACLp4E,EAAG,IACHmP,EAAG,SACHsmD,EAAQ,IACRwZ,EAAG,SACHztE,GACE6gD,EA2BJ,OAAO+1B,EAAM,GAAM,CACjBge,OAAQ,SAAgB5yC,GAEtB,IAAIjtC,EAAOitC,EAAEjtC,OAEb,GAAoB,IAAhBA,EAAKjnB,QAAgBinB,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAIq7F,WAAW,iCAAuC,SAAOr7F,GAAQ,KAmC7E,IAhCA,IAAIjiB,EAAIiiB,EAAK,GAYT4Q,EAgER,SAAoBmsG,EAASxvE,GAG3B,IAFA,IAESrmB,EAAI,EAAGA,EAFI,GAEeA,IACjC,IAAK,IAAIoe,EAAI,EAAGA,GAAKpe,EAAGoe,IAAK,CAC3B,IAAI79B,EAAIyf,EAAIoe,EAEZ,GAAI03E,EAAcD,EAASz3E,EAAG79B,GAhFtB,MAiFN,MAAO,CACL69B,EAAGA,EACH79B,EAAGA,GAMX,MAAM,IAAIgY,MAAM,oHAhFDw9F,CAyCjB,SAAsBhwE,GAIpB,IAHA,IAAIlvD,EAAIkvD,EAAEjtC,OAAO,GACb+8G,EAAU,EAEL/jI,EAAI,EAAGA,EAAI+E,EAAG/E,IAAK,CAG1B,IAFA,IAAIkkI,EAAS,EAEJz1G,EAAI,EAAGA,EAAI1pB,EAAG0pB,IACrBy1G,GAAUzzH,EAAIwjD,EAAEryD,IAAI,CAAC5B,EAAGyuB,KAG1Bs1G,EAAUh5H,KAAKijB,IAAIk2G,EAAQH,GAG7B,OAAOA,EA1DSI,CAAalwE,IAIvB3H,EAAI10B,EAAO00B,EACX79B,EAAImJ,EAAOnJ,EAOX21G,EAAOnyH,EAASgiD,EAAGlpD,KAAKmN,IAAI,GAAIuW,IAEhC4lC,EAAI6R,EAASnhE,GACbqvD,EAAI8R,EAASnhE,GAEbs/H,EAAS,EAETC,EAAUF,EAEVG,GAAa,EAERvkI,EAAI,EAAGA,GAAKssD,EAAGtsD,IAClBA,EAAI,IACNskI,EAAUryH,EAASqyH,EAASF,GAC5BG,GAAaA,GAIflwE,EAAIz0C,EAAIy0C,EAAGpiD,EADXoyH,EAASA,GAAU/3E,EAAItsD,EAAI,KAAO,EAAIssD,EAAItsD,EAAI,GAAKA,GACvBskI,IAC5BlwE,EAAIx0C,EAAIw0C,EAAGniD,EAASoyH,EAASE,EAAWD,IAK1C,IAFA,IAAIzB,EAAI5wH,EAASytE,EAAItrB,GAAIC,GAEhB1wD,EAAK,EAAGA,EAAK8qB,EAAG9qB,IACvBk/H,EAAI5wH,EAAS4wH,EAAGA,GAGlB,OAAO,EAAAzrD,EAAA,IAAenjB,GAAKA,EAAEurD,mBAAmBqjB,GAAKA,KAmDzD,SAASmB,EAAcD,EAASz3E,EAAG79B,GAGjC,IAFA,IAAI+1G,EAAO,EAEFxkI,EAAI,EAAGA,GAAKssD,EAAGtsD,IACtBwkI,GAAQxkI,EAKV,IAFA,IAAIykI,EAAUD,EAELhiC,EAAMl2C,EAAI,EAAGk2C,GAAO,EAAIl2C,EAAGk2C,IAClCiiC,GAAWjiC,EAGb,IAAIkiC,EAAYD,GAAW,EAAIn4E,EAAI,GACnC,OAAO,EAAMvhD,KAAKmN,IAAI6rH,EAAUh5H,KAAKmN,IAAI,EAAGuW,GAAI,EAAI69B,GAAKk4E,EAAOA,GAAQC,EAAUC,OC9JlF,GAAe,CAAC,QAAS,SAAU,WAAY,cAAe,eAAgB,OACvEC,IAA8B,QAF9B,SAE4C,IAAe7xE,IACpE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,SACNsB,EAAQ,YACRu0F,EAAW,aACXI,EAAY,IACZlnB,GACE5sB,EACAkyD,EAAcN,GAAkB,CAClC77B,QACA2d,gBAEE0d,EAAcN,GAAkB,CAClC/6B,UAkCF,OAAOA,EAAM,UAAU,SAAO,CAE5B,iCAAkC,SAAgC1/E,EAAGC,GAKnE,OAAO6I,EAAS9I,EAAGu2E,EAAIt2E,KAEzB,mBAAoB,SAAwBD,EAAGC,GAC7C,OAAO86G,EAAY/6G,EAAGC,EAAGw9F,GAAc,IAEzC,oBAAqB,SAAyBz9F,EAAGC,GAC/C,OAAO47G,EAAY77G,EAAGC,EAAGw9F,GAAc,IAEzC,aAAc,SAAkBz9F,EAAGC,GAEjC,OAAO86G,EAAYvzG,EAAOxH,GAAIC,EAAGw9F,GAAc,GAAOn4C,WAExD,sBAAuB,SAAwBtlD,EAAGC,GAChD,OAAO6I,EAAS9I,EAAGu2E,EAAIt2E,MAExBw9F,EAAavd,gBC3Ed,GAAO,eACP,GAAe,CAAC,QAAS,SAAU,SAAU,MAAO,WAAY,YAAa,MAAO,aAC7Eu7C,IAAoC,QAAQ,GAAM,IAAe9xE,IAC1E,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,OACNk4C,EAAM,IACNtR,EAAG,SACHtlC,EAAQ,UACRsrE,EAAS,IACT50C,EAAG,UACH4xD,GACEznC,EAkBJ,OAAO+1B,EAAM,GAAM,CACjB,eAAgB,SAAoBv8B,EAAGtpD,GACrC,OAAO6hI,EAAOl0H,EAAO27C,GAAI37C,EAAO3N,KAElC,gBAAiB,SAAqBspD,EAAGtpD,GACvC,OAAO6hI,EAAOv4E,EAAG37C,EAAO3N,KAE1B,gBAAiB,SAAqBspD,EAAGtpD,GACvC,OAAO6hI,EAAOl0H,EAAO27C,GAAItpD,IAE3B,iBAAkB,SAAsBspD,EAAGtpD,GACzC,OAAO6hI,EAAOv4E,EAAGtpD,MAIrB,SAAS6hI,EAAOv4E,EAAGtpD,GACjB,IAAI8hI,EAAU9hI,EAAEgkB,OAAOjnB,OACnBglI,EAAUz4E,EAAEtlC,OAAOjnB,OAEvB,GAAI+kI,EAAU,EACZ,MAAM,IAAIr+F,MAAM,wCAGlB,GAAIs+F,EAAU,EACZ,MAAM,IAAIt+F,MAAM,yCAGlB,GAAIq+F,IAAYC,EACd,MAAM,IAAIt+F,MAAM,uCAMlB,GAAa,IAFF8Q,EAAI+U,GAGb,MAAM,IAAI7lB,MAAM,oDAKlB,GAAa,IAFF8Q,EAAIv0C,GAGb,MAAM,IAAIyjC,MAAM,qDAGlB,IAAIu+F,EAAQn8E,EAAOyD,EAAG/U,EAAI+U,IACtB24E,EAAQp8E,EAAO7lD,EAAGu0C,EAAIv0C,IACtBwL,EAAS+oC,EAAItlC,EAAS+yH,EAAOr8F,EAAI40C,EAAUynD,EAAOC,MAEtD,OAAI1qC,EAAU/rF,GACLA,EAEAvD,OAAO4/B,QCjFhB,GAAO,cACP,GAAe,CAAC,QAAS,YAAa,aAAc,YAAa,cAC1Dq6F,IAAmC,QAAQ,GAAM,IAAepyE,IACzE,IAAI,MACF+1B,EAAK,UACL8d,EAAS,WACTv7C,EAAU,UACVrxC,EAAS,WACTqlE,GACEtsB,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,qBAAsB,SAAyB9jF,GAC7C,IAAKgV,EAAUhV,IAAMqmD,EAAWrmD,GAC9B,MAAM,IAAItE,UAAU,+DAMtB,IAFA,IAAI+N,EAAS,EAEJxO,EAAI,EAAGA,GAAK+E,EAAG/E,IACtBwO,EAASm4F,EAAUn4F,EAAQ4wE,EAAWr6E,EAAG/E,IAG3C,OAAOwO,QC3CT,GAAO,QACP,GAAe,CAAC,QAAS,SAAU,eAAgB,MAAO,WACnD22H,IAA6B,QAAQ,GAAM,IAAeryE,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,aACNw1C,EAAY,IACZj+D,EAAG,QACHE,GACEiqB,EAiCJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ,SAAgB3oE,GACtB,OAAIA,IAAM,GAAKioD,EAAO6kB,aACb,QAAO9sE,GAGPi8H,EAAc,IAAIv8F,EAAQ1/B,EAAG,KAGxC0/B,QAASu8F,EACTzoC,UAAW,SAAmBxzF,GAC5B,IAAIC,EAAID,EAAE+/B,KAAK,GAEf,OAAK9/B,EAAEgiD,cAAgBgG,EAAO6kB,YACrB7sE,EAAEuhD,KAGFy6E,EAAc,IAAIv8F,EAAQ1/B,EAAE4kD,WAAY,KAGnD,iBAAkB,SAAqB5kD,GACrC,OAAO,SAAQA,EAAG7D,OAEpB,WAAY,SAAgB6D,EAAGtH,GAE7B,OAAO+kG,EAAathG,KAAK6D,GAAIw/B,EAAI9mC,OAUrC,SAASujI,EAAcj8H,GACrB,IAAIk8H,EAAQl8H,EAAEmgC,GAAK,EACnB,OAAO,IAAIT,EAAQ99B,KAAK49B,IAAI59B,KAAKsE,KAAKg2H,EAAQA,EAAQl8H,EAAEogC,GAAKpgC,EAAEogC,KAAMx+B,KAAKgF,MAAM5G,EAAEogC,GAAI87F,QClF1F,SAAS,KAA2Q,OAA9P,GAAWpkI,OAAOk6B,QAAU,SAAUx6B,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAS5U,UAAUtlC,GAAI,IAAK,IAAImB,KAAO+4C,EAAcj5C,OAAOM,UAAUQ,eAAeC,KAAKk4C,EAAQ/4C,KAAQR,EAAOQ,GAAO+4C,EAAO/4C,IAAY,OAAOR,IAA2B+yD,MAAMpuD,KAAMggC,WAEhT,SAAS,GAAQxjC,EAAQulH,GAAkB,IAAIx/G,EAAO5G,OAAO4G,KAAK/F,GAAS,GAAIb,OAAOwtE,sBAAuB,CAAE,IAAIz1D,EAAU/X,OAAOwtE,sBAAsB3sE,GAAaulH,IAAgBruG,EAAUA,EAAQvG,QAAO,SAAU60G,GAAO,OAAOrmH,OAAOkB,yBAAyBL,EAAQwlH,GAAKxmH,eAAgB+G,EAAK/D,KAAK4vD,MAAM7rD,EAAMmR,GAAY,OAAOnR,EAE9U,SAAS,GAAclH,GAAU,IAAK,IAAIX,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IAAK,CAAE,IAAIk6C,EAAyB,MAAhB5U,UAAUtlC,GAAaslC,UAAUtlC,GAAK,GAAQA,EAAI,EAAK,GAAQiB,OAAOi5C,IAAS,GAAMjzC,SAAQ,SAAU9F,GAAO,GAAgBR,EAAQQ,EAAK+4C,EAAO/4C,OAAsBF,OAAOwmH,0BAA6BxmH,OAAOqD,iBAAiB3D,EAAQM,OAAOwmH,0BAA0BvtE,IAAmB,GAAQj5C,OAAOi5C,IAASjzC,SAAQ,SAAU9F,GAAOF,OAAOC,eAAeP,EAAQQ,EAAKF,OAAOkB,yBAAyB+3C,EAAQ/4C,OAAe,OAAOR,EAE7gB,SAAS,GAAgBiE,EAAKzD,EAAKiB,GAAiK,OAApJjB,KAAOyD,EAAO3D,OAAOC,eAAe0D,EAAKzD,EAAK,CAAEiB,MAAOA,EAAOtB,YAAY,EAAMC,cAAc,EAAMC,UAAU,IAAkB4D,EAAIzD,GAAOiB,EAAgBwC,EAQ3M,IACI,GAAe,CAAC,MAAO,SAAU,YAAa,WAAY,iBAAkB,eAAgB,MAAO,MAAO,MAAO,QAAS,QAAS,YAAa,SAAU,SAAU,UAAW,YAAa,YACrL0gI,IAAiC,QAFjC,OAE+C,IAAexyE,IACvE,IAwFIyyE,EAAMnhG,EAAOz1B,GAxFb,GACFgZ,EAAE,OACFypC,EAAM,UACNu1C,EAAS,SACT53C,EAAQ,eACR03C,EAAc,aACdG,EAAY,IACZ1uF,EAAG,IACHzH,EAAG,IACHmuE,EAAG,MACH5zE,EAAK,MACL4yE,EAAK,UACL2c,EAAS,OACTJ,EAAM,OACNroB,EAAM,QACNjpC,EACA8zD,UAAW8X,EACX5gD,SAAU6gD,GACR5hD,EACA/E,EAAW+jB,EAqBf,SAAS+Z,EAAKzpF,EAAO6C,GACnB,KAAMK,gBAAgBumF,GACpB,MAAM,IAAIplD,MAAM,oDAGlB,GAAMrkC,UAAyCm4F,EAAUn4F,MAAU,EAAAg1E,EAAA,IAAUh1E,GAC3E,MAAM,IAAI3B,UAAU,kGAGtB,QAAagD,IAATwB,IAAuC,iBAATA,GAA8B,KAATA,GACrD,MAAM,IAAIxE,UAAU,yDAGtB,QAAagD,IAATwB,EAAoB,CACtB,IAAImqB,EAAIy8D,EAAKnyE,MAAMzU,GACnBK,KAAKkgI,MAAQp2G,EAAEo2G,MACflgI,KAAKklF,WAAap7D,EAAEo7D,eACf,CACLllF,KAAKkgI,MAAQ,CAAC,CACZ36H,KAAM46H,EACNp5F,OAAQq5F,EAASC,KAEjBC,MAAO,IAETtgI,KAAKklF,WAAa,GAElB,IAAK,IAAIxqF,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAC1CsF,KAAKklF,WAAWxqF,GAAK,EAIzBsF,KAAKlD,MAAQA,QAAwCkD,KAAKivG,WAAWnyG,GAAS,KAC9EkD,KAAK4oG,WAAY,EAMjB5oG,KAAKwgI,6BAA8B,EAYrC,SAASC,IACP,KAAa,MAANp3H,GAAmB,OAANA,GAClB/K,IAQJ,SAASirF,EAAQlgF,GACf,OAAOA,GAAK,KAAOA,GAAK,IAG1B,SAAS/K,IACPwgC,IACAz1B,EAAI42H,EAAKr+E,OAAO9iB,GAGlB,SAAS4hG,EAAOC,GACd7hG,EAAQ6hG,EACRt3H,EAAI42H,EAAKr+E,OAAO9iB,GAGlB,SAASktD,IACP,IAAIxf,EAAS,GACTm0D,EAAW7hG,EASf,GAPU,MAANz1B,EACF/K,IACe,MAAN+K,IACTmjE,GAAUnjE,EACV/K,MA1BJ,SAAoB+K,GAClB,OAAOA,GAAK,KAAOA,GAAK,KAAa,MAANA,EA4B1B+/E,CAAW//E,GAGd,OADAq3H,EAAOC,GACA,KAIT,GAAU,MAANt3H,GAIF,GAHAmjE,GAAUnjE,EACV/K,KAEKirF,EAAQlgF,GAGX,OADAq3H,EAAOC,GACA,SAEJ,CACL,KAAOp3C,EAAQlgF,IACbmjE,GAAUnjE,EACV/K,IAGQ,MAAN+K,IACFmjE,GAAUnjE,EACV/K,KAIJ,KAAOirF,EAAQlgF,IACbmjE,GAAUnjE,EACV/K,IAIF,GAAU,MAAN+K,GAAmB,MAANA,EAAW,CAE1B,IAAIu3H,EAAkB,GAClBC,EAAiB/hG,EAUrB,GATA8hG,GAAmBv3H,EACnB/K,IAEU,MAAN+K,GAAmB,MAANA,IACfu3H,GAAmBv3H,EACnB/K,MAIGirF,EAAQlgF,GAGX,OADAq3H,EAAOG,GACAr0D,EAMT,IAFAA,GAAkBo0D,EAEXr3C,EAAQlgF,IACbmjE,GAAUnjE,EACV/K,IAIJ,OAAOkuE,EAGT,SAASs0D,IAGP,IAFA,IAAIC,EAAW,GAERx3C,EAAQlgF,IAAMk9E,EAAKy6C,aAAa33H,IACrC03H,GAAY13H,EACZ/K,IAIF,IAAI2iI,EAASF,EAASn/E,OAAO,GAE7B,OAAI2kC,EAAKy6C,aAAaC,GACbF,EAEA,KAIX,SAASG,EAAeC,GACtB,OAAI93H,IAAM83H,GACR7iI,IACO6iI,GAEA,KAhIX56C,EAAKtqF,UAAUmE,KAAO,OACtBmmF,EAAKtqF,UAAU+/E,QAAS,EA8IxBuK,EAAKnyE,MAAQ,SAAUirB,EAAK42B,GAM1B,GALAA,EAAUA,GAAW,GAErBn3B,GAAS,EACTz1B,EAAI,GAEgB,iBAJpB42H,EAAO5gG,GAKL,MAAM,IAAIlkC,UAAU,mDAGtB,IAAIoK,EAAO,IAAIghF,EACfhhF,EAAK26H,MAAQ,GACb,IAAIkB,EAAyB,EACzBC,GAAgB,EAapB/iI,IACAmiI,IAEA,IAAI/3B,EAAW1c,IACXlvF,EAAQ,KAEZ,GAAI4rG,EAAU,CACZ,GAAsB,cAAlB58C,EAAO0gB,OACT1vE,EAAQ,IAAIqyG,EAAWzG,QAClB,GAAsB,aAAlB58C,EAAO0gB,OAChB,IAEE1vE,EAAQ,IAAIsyG,EAAU1G,GACtB,MAAOjqG,GACP3B,EAAQuV,WAAWq2F,QAIrB5rG,EAAQuV,WAAWq2F,GAGrB+3B,IAGIS,EAAe,MACjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,OACxBE,GAA0B,EAC1BC,GAAgB,GASpB,IAJA,IAAIC,EAAuB,GAEvBC,EAA8B,IAErB,CAIX,IAHAd,IAGa,MAANp3H,GACLi4H,EAAqB9iI,KAAK4iI,GAC1BG,GAA+BH,EAC/BA,EAAyB,EACzB9iI,IACAmiI,IAIF,IAAIe,EAEJ,IAAIn4H,EASF,MARA,IAAIo4H,EAAOp4H,EAGX,GAAa,QAFbm4H,EAAOV,KAGL,MAAM,IAAI79F,YAAY,eAAiBw+F,EAAO,SAAWxB,EAAO,cAAgBnhG,EAAMp/B,YAQ1F,IAAI+1B,EAAMisG,EAAUF,GAEpB,GAAY,OAAR/rG,EAEF,MAAM,IAAIwN,YAAY,SAAWu+F,EAAO,gBAG1C,IAAIlB,EAAQc,EAAyBG,EAIrC,GAFAd,IAEIS,EAAe,KAAM,CACvBT,IACA,IAAI/iI,EAAIsuF,IAER,GAAU,OAANtuF,EAEF,MAAM,IAAIulC,YAAY,OAAS5D,EAAM,sDAGvCihG,GAAS5iI,EAIX6H,EAAK26H,MAAM1hI,KAAK,CACd+G,KAAMkwB,EAAIlwB,KACVwhC,OAAQtR,EAAIsR,OACZu5F,MAAOA,IAGT,IAAK,IAAI5lI,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAC1C6K,EAAK2/E,WAAWxqF,KAAO+6B,EAAIlwB,KAAK2/E,WAAWxqF,IAAM,GAAK4lI,EAOxD,IAFAG,IAEa,MAANp3H,GAAW,CAChB,GAAoC,IAAhCi4H,EAAqB7mI,OACvB,MAAM,IAAIwoC,YAAY,qBAAuBg9F,EAAO,cAAgBnhG,EAAMp/B,YAG5E6hI,GAA+BD,EAAqB1sH,MACpDtW,IACAmiI,IAqBF,GAhBAY,GAAgB,EAEZH,EAAe,MAEjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,MAExBE,GAA0B,EAC1BC,GAAgB,GAGhBD,EAAyB,EAIvB3rG,EAAIlwB,KAAKhJ,KAAM,CACjB,IAAIolI,EAAUlsG,EAAIlwB,KAAKhJ,KAAKV,IAC5B+lI,EAAaC,KAAKF,GAAW,CAC3Bp8H,KAAMkwB,EAAIlwB,KACVwhC,OAAQtR,EAAIsR,SAQlB,GAFA05F,IAEIp3H,EACF,MAAM,IAAI45B,YAAY,qBAAuB5D,EAAM,KAIrD,GAAIgiG,EACF,MAAM,IAAIp+F,YAAY,yBAA2B5D,EAAM,KAIzD,GAAoC,IAAhCiiG,EAAqB7mI,OACvB,MAAM,IAAIwoC,YAAY,qBAAuBg9F,EAAO,KAItD,GAA0B,IAAtB16H,EAAK26H,MAAMzlI,SAAiBw7D,EAAQ6rE,aACtC,MAAM,IAAI7+F,YAAY,IAAM5D,EAAM,uBAIpC,OADA95B,EAAKzI,WAAkBqB,IAAVrB,EAAsByI,EAAK0pG,WAAWnyG,GAAS,KACrDyI,GASTghF,EAAKtqF,UAAUwwD,MAAQ,WACrB,IAAIlnD,EAAO,IAAIghF,EACfhhF,EAAKqjG,UAAY5oG,KAAK4oG,UACtBrjG,EAAKi7H,4BAA8BxgI,KAAKwgI,4BACxCj7H,EAAKzI,OAAQ,SAAMkD,KAAKlD,OACxByI,EAAK2/E,WAAallF,KAAKklF,WAAWpmF,MAAM,GACxCyG,EAAK26H,MAAQ,GAEb,IAAK,IAAIxlI,EAAI,EAAGA,EAAIsF,KAAKkgI,MAAMzlI,OAAQC,IAGrC,IAAK,IAAIgD,KAFT6H,EAAK26H,MAAMxlI,GAAK,GAEFsF,KAAKkgI,MAAMxlI,IACnB,SAAesF,KAAKkgI,MAAMxlI,GAAIgD,KAChC6H,EAAK26H,MAAMxlI,GAAGgD,GAAKsC,KAAKkgI,MAAMxlI,GAAGgD,IAKvC,OAAO6H,GASTghF,EAAKtqF,UAAU8lI,WAAa,WAC1B,OAA0B,IAAtB/hI,KAAKkgI,MAAMzlI,SAIRuF,KAAKkgI,MAAMzlI,OAAS,GAAKgL,KAAK0F,IAAInL,KAAKkgI,MAAM,GAAGI,MAAQ,GAAO,QAWxE/5C,EAAKtqF,UAAUgzG,WAAa,SAAUnyG,GACpC,IAAIklI,EAAWC,EAAYC,EAAWC,EAClCr6D,EAEJ,GAAIhrE,SAA+D,IAAtBkD,KAAKkgI,MAAMzlI,OACtD,OAAOqC,EACF,GAAIkD,KAAK+hI,aAAc,CAG5B,IAAItsG,EAAM34B,EACVgrE,EAAUye,EAAK67C,qBAAoB,QAAOtlI,IAE1C,IAAK,IAAIpC,EAAI,EAAGA,EAAIsF,KAAKkgI,MAAMzlI,OAAQC,IACrCsnI,EAAYl6D,EAAQ9nE,KAAKkgI,MAAMxlI,GAAG6K,KAAKzI,OACvCqlI,EAAkBr6D,EAAQ9nE,KAAKkgI,MAAMxlI,GAAGqsC,OAAOjqC,OAC/ColI,EAAYp6D,EAAQ9nE,KAAKkgI,MAAMxlI,GAAG4lI,OAClC7qG,EAAM0rE,EAAe1rE,EAAK7iB,EAAIuuF,EAAe6gC,EAAWG,GAAkBD,IAG5E,OAAOzsG,EAQP,OAHAusG,GAFAl6D,EAAUye,EAAK67C,qBAAoB,QAAOtlI,KAEtBkD,KAAKkgI,MAAM,GAAG36H,KAAKzI,OACvCmlI,EAAan6D,EAAQ9nE,KAAKkgI,MAAM,GAAG36H,KAAK2uB,QACxCiuG,EAAkBr6D,EAAQ9nE,KAAKkgI,MAAM,GAAGn5F,OAAOjqC,OACxCqkG,EAAeE,EAAUvkG,EAAOmlI,GAAa9gC,EAAe6gC,EAAWG,KAalF57C,EAAKtqF,UAAUomI,aAAe,SAAUvlI,EAAOwlI,GAC7C,IAAIN,EAAWC,EAAYC,EAAWC,EAClCr6D,EAEJ,GAAIhrE,SAA+D,IAAtBkD,KAAKkgI,MAAMzlI,OACtD,OAAOqC,EACF,GAAIkD,KAAK+hI,aAAc,CAI5B,IAAItsG,EAAM34B,EACVgrE,EAAUye,EAAK67C,qBAAoB,QAAOtlI,IAE1C,IAAK,IAAIpC,EAAI,EAAGA,EAAIsF,KAAKkgI,MAAMzlI,OAAQC,IACrCsnI,EAAYl6D,EAAQ9nE,KAAKkgI,MAAMxlI,GAAG6K,KAAKzI,OACvCqlI,EAAkBr6D,EAAQ9nE,KAAKkgI,MAAMxlI,GAAGqsC,OAAOjqC,OAC/ColI,EAAYp6D,EAAQ9nE,KAAKkgI,MAAMxlI,GAAG4lI,OAClC7qG,EAAM6rE,EAAa7rE,EAAK7iB,EAAIuuF,EAAe6gC,EAAWG,GAAkBD,IAG1E,OAAOzsG,EASP,OAJAusG,GAFAl6D,EAAUye,EAAK67C,qBAAoB,QAAOtlI,KAEtBkD,KAAKkgI,MAAM,GAAG36H,KAAKzI,OACvCqlI,EAAkBr6D,EAAQ9nE,KAAKkgI,MAAM,GAAGn5F,OAAOjqC,OAC/CmlI,EAAan6D,EAAQ9nE,KAAKkgI,MAAM,GAAG36H,KAAK2uB,QAG/Bu1B,EAAS63C,EAAaA,EAAaxkG,EAAOklI,GAD/CM,QAC2DH,EAEAG,GAFkBL,IAgBrF,IAAIP,GAAY,SAAQriG,IAEtB,IAAI,SAAekjG,EAAOljG,GAAM,CAC9B,IAAI95B,EAAOg9H,EAAMljG,GAEjB,MAAO,CACL95B,OACAwhC,OAHWxhC,EAAKi9H,SAAS,KAO7B,IAAK,IAAIjjD,KAASgjD,EAChB,IAAI,SAAeA,EAAOhjD,KACpB,SAASlgD,EAAKkgD,GAAQ,CACxB,IAAIkjD,EAAQF,EAAMhjD,GACdmjD,EAAYrjG,EAAI5kC,OAAS8kF,EAAM9kF,OAC/BkoI,EAAatjG,EAAIrO,UAAU,EAAG0xG,GAE9BE,GAAU,SAAeH,EAAMD,SAAUG,GAAcF,EAAMD,SAASG,QAAcxkI,EAExF,QAAgBA,IAAZykI,EAEF,MAAO,CACLr9H,KAAMk9H,EACN17F,OAAQ67F,GAOlB,OAAO,OACN,CACDlgC,OAAQrmE,GAAQA,EAAK,GACrB+H,MAAO,MA0LT,SAASy+F,EAAqBt9H,GAC5B,OAAIA,EAAK6mG,UAAUyI,EAAWwrB,OAAwB,OAAf96H,EAAKzI,QAAmBgvD,EAAO6kB,YAC7DprE,EAAKzI,MAELyI,EAlLXghF,EAAKC,gBAAkB,SAAU7mF,GAC/B,OAA2B,OAApB+hI,EAAU/hI,IAUnB4mF,EAAKtqF,UAAUimG,QAAU,SAAU3lG,GAKjC,GAJoB,iBAATA,IACTA,EAAOs4G,EAAWt4G,KAGfA,EACH,OAAO,EAIT,IAAK,IAAI7B,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAC1C,GAAI+K,KAAK0F,KAAKnL,KAAKklF,WAAWxqF,IAAM,IAAM6B,EAAK2oF,WAAWxqF,IAAM,IAAM,MACpE,OAAO,EAIX,OAAO,GAWT6rF,EAAKtqF,UAAUmwG,UAAY,SAAUzpE,GAEnC,IAAK,IAAIjoC,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAC1C,GAAI+K,KAAK0F,KAAKnL,KAAKklF,WAAWxqF,IAAM,IAAMioC,EAAMuiD,WAAWxqF,IAAM,IAAM,MACrE,OAAO,EAIX,OAAO,GAUT6rF,EAAKtqF,UAAU8nD,OAAS,SAAUphB,GAChC,OAAO3iC,KAAKosG,UAAUzpE,IAAU21C,EAAMt4E,KAAKlD,MAAO6lC,EAAM7lC,QAU1DypF,EAAKtqF,UAAU0Q,SAAW,SAAUg2B,GAGlC,IAFA,IAAIlN,EAAMz1B,KAAKysD,QAEN/xD,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAE1C+6B,EAAIyvD,WAAWxqF,IAAMsF,KAAKklF,WAAWxqF,IAAM,IAAMioC,EAAMuiD,WAAWxqF,IAAM,GAI1E,IAAK,IAAI2D,EAAK,EAAGA,EAAKskC,EAAMu9F,MAAMzlI,OAAQ4D,IAAM,CAE9C,IAAIi3B,EAAW,GAAc,GAAIqN,EAAMu9F,MAAM7hI,IAE7Co3B,EAAIyqG,MAAM1hI,KAAK82B,GAIjB,GAAmB,OAAft1B,KAAKlD,OAAkC,OAAhB6lC,EAAM7lC,MAAgB,CAC/C,IAAIgmI,EAAyB,OAAf9iI,KAAKlD,MAAiBkD,KAAKivG,WAAW,GAAKjvG,KAAKlD,MAC1DimI,EAA2B,OAAhBpgG,EAAM7lC,MAAiB6lC,EAAMssE,WAAW,GAAKtsE,EAAM7lC,MAClE24B,EAAI34B,MAAQqkG,EAAe2hC,EAASC,QAEpCttG,EAAI34B,MAAQ,KAId,OADA24B,EAAI+qG,6BAA8B,EAC3BqC,EAAqBptG,IAU9B8wD,EAAKtqF,UAAUsnD,OAAS,SAAU5gB,GAGhC,IAFA,IAAIlN,EAAMz1B,KAAKysD,QAEN/xD,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAE1C+6B,EAAIyvD,WAAWxqF,IAAMsF,KAAKklF,WAAWxqF,IAAM,IAAMioC,EAAMuiD,WAAWxqF,IAAM,GAI1E,IAAK,IAAIwiG,EAAM,EAAGA,EAAMv6D,EAAMu9F,MAAMzlI,OAAQyiG,IAAO,CAEjD,IAAI5nE,EAAW,GAAc,GAAc,GAAIqN,EAAMu9F,MAAMhjC,IAAO,GAAI,CACpEojC,OAAQ39F,EAAMu9F,MAAMhjC,GAAKojC,QAG3B7qG,EAAIyqG,MAAM1hI,KAAK82B,GAIjB,GAAmB,OAAft1B,KAAKlD,OAAkC,OAAhB6lC,EAAM7lC,MAAgB,CAC/C,IAAIgmI,EAAyB,OAAf9iI,KAAKlD,MAAiBkD,KAAKivG,WAAW,GAAKjvG,KAAKlD,MAC1DimI,EAA2B,OAAhBpgG,EAAM7lC,MAAiB6lC,EAAMssE,WAAW,GAAKtsE,EAAM7lC,MAClE24B,EAAI34B,MAAQwkG,EAAawhC,EAASC,QAElCttG,EAAI34B,MAAQ,KAId,OADA24B,EAAI+qG,6BAA8B,EAC3BqC,EAAqBptG,IAU9B8wD,EAAKtqF,UAAU2W,IAAM,SAAUlV,GAG7B,IAFA,IAAI+3B,EAAMz1B,KAAKysD,QAEN/xD,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAE1C+6B,EAAIyvD,WAAWxqF,IAAMsF,KAAKklF,WAAWxqF,IAAM,GAAKgD,EAIlD,IAAK,IAAIi9G,EAAM,EAAGA,EAAMllF,EAAIyqG,MAAMzlI,OAAQkgH,IACxCllF,EAAIyqG,MAAMvlB,GAAK2lB,OAAS5iI,EAc1B,OAXkB,OAAd+3B,EAAI34B,MACN24B,EAAI34B,MAAQ8V,EAAI6iB,EAAI34B,MAAOY,GAM3B+3B,EAAI34B,MAAQ,KAGd24B,EAAI+qG,6BAA8B,EAC3BqC,EAAqBptG,IAwB9B8wD,EAAKtqF,UAAUkP,IAAM,WAGnB,IAAIk6B,EAAMrlC,KAAKysD,QAGf,IAAK,IAAI/xD,KAFT2qC,EAAIvoC,MAAsB,OAAduoC,EAAIvoC,MAAiBqO,EAAIk6B,EAAIvoC,OAAS,KAEpCuoC,EAAI66F,MACe,OAA3B76F,EAAI66F,MAAMxlI,GAAG6K,KAAK5F,MAA4C,QAA3B0lC,EAAI66F,MAAMxlI,GAAG6K,KAAK5F,OACvD0lC,EAAI66F,MAAMxlI,GAAG6K,KAAOg9H,EAAM1M,GAI9B,OAAOxwF,GAUTkhD,EAAKtqF,UAAUi8E,GAAK,SAAU20B,GAC5B,IAAIlqE,EACA7lC,EAAuB,OAAfkD,KAAKlD,MAAiBkD,KAAKivG,WAAW,GAAKjvG,KAAKlD,MAE5D,GAA6B,iBAAlB+vG,EAA4B,CAIrC,GAFAlqE,EAAQ4jD,EAAKnyE,MAAMy4F,IAEd7sG,KAAKosG,UAAUzpE,GAClB,MAAM,IAAIxB,MAAM,wBAAwBe,OAAOS,EAAMjjC,WAAY,UAAUwiC,OAAOliC,KAAKN,WAAY,OAGrG,GAAoB,OAAhBijC,EAAM7lC,MACR,MAAM,IAAIqkC,MAAM,yCAMlB,OAHAwB,EAAM7lC,OAAQ,SAAMA,GACpB6lC,EAAMimE,WAAY,EAClBjmE,EAAM69F,6BAA8B,EAC7B79F,EACF,IAAI,EAAAmvC,EAAA,IAAO+6B,GAAgB,CAChC,IAAK7sG,KAAKosG,UAAUS,GAClB,MAAM,IAAI1rE,MAAM,wBAAwBe,OAAO2qE,EAAcntG,WAAY,UAAUwiC,OAAOliC,KAAKN,WAAY,OAG7G,GAA4B,OAAxBmtG,EAAc/vG,MAChB,MAAM,IAAIqkC,MAAM,yCAOlB,OAJAwB,EAAQkqE,EAAcpgD,SAChB3vD,OAAQ,SAAMA,GACpB6lC,EAAMimE,WAAY,EAClBjmE,EAAM69F,6BAA8B,EAC7B79F,EAEP,MAAM,IAAIxB,MAAM,yCAYpBolD,EAAKtqF,UAAUwsD,SAAW,SAAUokD,GAClC,OAAOpkD,EAASzoD,KAAKgjI,UAAUn2B,KAUjCtmB,EAAKtqF,UAAU+mI,UAAY,SAAUn2B,GACnC,IAAIlqE,EASJ,OALEA,EAFEkqE,EAEM7sG,KAAKk4E,GAAG20B,GAER7sG,KAAKysD,SAGLs1E,cAAuC,IAAvBp/F,EAAMu9F,MAAMzlI,OAC7BkoC,EAAM0/F,aAAa1/F,EAAM7lC,OAEzB6lC,EAAM0/F,aAAa1/F,EAAM7lC,MAAO6lC,EAAMu9F,MAAM,GAAGn5F,OAAOjqC,QAUjEypF,EAAKtqF,UAAUyD,SAAW,WACxB,OAAOM,KAAK60F,UAUdtO,EAAKtqF,UAAUmtD,OAAS,WACtB,MAAO,CACLkqB,OAAQ,OACRx2E,MAAOkD,KAAKqiI,aAAariI,KAAKlD,OAC9ByI,KAAMvF,KAAK0pH,cACX9gB,UAAW5oG,KAAK4oG,YAYpBriB,EAAKhT,SAAW,SAAUzjB,GACxB,IAAIvqD,EAAO,IAAIghF,EAAKz2B,EAAKhzD,MAAOgzD,EAAKvqD,MAErC,OADAA,EAAKqjG,UAAY94C,EAAK84C,YAAa,EAC5BrjG,GASTghF,EAAKtqF,UAAUktD,QAAUo9B,EAAKtqF,UAAUyD,SAMxC6mF,EAAKtqF,UAAU2iC,SAAW,WACxB,IAGIqkG,EAcEC,EAjBF79F,EAAMrlC,KAAKysD,QACX02E,EAAmB,GAIvB,IAAK,IAAItnI,KAAOunI,EACd,IAAI,SAAeA,EAAmBvnI,IAChCwpC,EAAI68D,QAAQ2S,EAAWh5G,IAAO,CAChConI,EAAepnI,EACf,MAKN,GAAqB,SAAjBonI,EACF59F,EAAI66F,MAAQ,QAWZ,GAPI+C,IAEE,SAAeG,EAAmBH,KACpCC,EAAeE,EAAkBH,IAIjCC,EACF79F,EAAI66F,MAAQ,CAAC,CACX36H,KAAM29H,EAAa39H,KACnBwhC,OAAQm8F,EAAan8F,OACrBu5F,MAAO,QAEJ,CAML,IAFA,IAAI+C,GAAiB,EAEZ3oI,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAAK,CAC/C,IAAIinI,EAAUpB,EAAgB7lI,GAE1B+K,KAAK0F,IAAIk6B,EAAI6/C,WAAWxqF,IAAM,GAAK,SACjC,SAAe0oI,EAAmBzB,GACpCwB,EAAiB3kI,KAAK,CACpB+G,KAAM69H,EAAkBzB,GAASp8H,KACjCwhC,OAAQq8F,EAAkBzB,GAAS56F,OACnCu5F,MAAOj7F,EAAI6/C,WAAWxqF,IAAM,IAG9B2oI,GAAiB,GAMnBF,EAAiB1oI,OAAS4qC,EAAI66F,MAAMzlI,SAAW4oI,IAEjDh+F,EAAI66F,MAAQiD,GAKlB,OAAO99F,GAOTkhD,EAAKtqF,UAAUqnI,KAAO,WAMpB,IALA,IAAIj+F,EAAMrlC,KAAKysD,QACX02E,EAAmB,GAIdzoI,EAAI,EAAGA,EAAI6lI,EAAgB9lI,OAAQC,IAAK,CAC/C,IAAIinI,EAAUpB,EAAgB7lI,GAE9B,GAAI+K,KAAK0F,IAAIk6B,EAAI6/C,WAAWxqF,IAAM,GAAK,MAAO,CAC5C,KAAI,SAAeknI,EAAa2B,GAAI5B,GAOlC,MAAM,IAAIxgG,MAAM,8BAAgCwgG,EAAU,gBAN1DwB,EAAiB3kI,KAAK,CACpB+G,KAAMq8H,EAAa2B,GAAG5B,GAASp8H,KAC/BwhC,OAAQ66F,EAAa2B,GAAG5B,GAAS56F,OACjCu5F,MAAOj7F,EAAI6/C,WAAWxqF,IAAM,KAYpC,OAHA2qC,EAAI66F,MAAQiD,EACZ99F,EAAIujE,WAAY,EAChBvjE,EAAIm7F,6BAA8B,EAC3Bn7F,GASTkhD,EAAKtqF,UAAUytH,YAAc,WAM3B,IALA,IAAI8Z,EAAS,GACTC,EAAS,GACTC,EAAO,EACPC,EAAO,EAEFjpI,EAAI,EAAGA,EAAIsF,KAAKkgI,MAAMzlI,OAAQC,IACjCsF,KAAKkgI,MAAMxlI,GAAG4lI,MAAQ,GACxBoD,IACAF,GAAU,IAAMxjI,KAAKkgI,MAAMxlI,GAAGqsC,OAAOpnC,KAAOK,KAAKkgI,MAAMxlI,GAAG6K,KAAK5F,KAE3D8F,KAAK0F,IAAInL,KAAKkgI,MAAMxlI,GAAG4lI,MAAQ,GAAO,QACxCkD,GAAU,IAAMxjI,KAAKkgI,MAAMxlI,GAAG4lI,QAEvBtgI,KAAKkgI,MAAMxlI,GAAG4lI,MAAQ,GAC/BqD,IAIJ,GAAIA,EAAO,EACT,IAAK,IAAI1S,EAAM,EAAGA,EAAMjxH,KAAKkgI,MAAMzlI,OAAQw2H,IACrCjxH,KAAKkgI,MAAMjP,GAAKqP,MAAQ,IACtBoD,EAAO,GACTD,GAAU,IAAMzjI,KAAKkgI,MAAMjP,GAAKlqF,OAAOpnC,KAAOK,KAAKkgI,MAAMjP,GAAK1rH,KAAK5F,KAE/D8F,KAAK0F,IAAInL,KAAKkgI,MAAMjP,GAAKqP,MAAQ,GAAO,QAC1CmD,GAAU,KAAOzjI,KAAKkgI,MAAMjP,GAAKqP,SAGnCmD,GAAU,IAAMzjI,KAAKkgI,MAAMjP,GAAKlqF,OAAOpnC,KAAOK,KAAKkgI,MAAMjP,GAAK1rH,KAAK5F,KACnE8jI,GAAU,IAAMzjI,KAAKkgI,MAAMjP,GAAKqP,QAOxCkD,EAASA,EAAOvyG,OAAO,GACvBwyG,EAASA,EAAOxyG,OAAO,GAEnByyG,EAAO,GAAKC,EAAO,IACrBH,EAAS,IAAMA,EAAS,KAGtBG,EAAO,GAAKD,EAAO,IACrBD,EAAS,IAAMA,EAAS,KAG1B,IAAIpkG,EAAMmkG,EAOV,OALIE,EAAO,GAAKC,EAAO,IACrBtkG,GAAO,OAGTA,EAAOokG,GAcTl9C,EAAKtqF,UAAU44F,OAAS,SAAU5+B,GAGhC,IAAI2tE,EAAO5jI,KAAKwgI,6BAA8C,OAAfxgI,KAAKlD,MAAiBkD,KAAKysD,QAAUzsD,KAAK4+B,WAErFilG,GAAc,EAOlB,IAAK,IAAInpI,UALiB,IAAfkpI,EAAK9mI,OAAwC,OAAf8mI,EAAK9mI,QAAkB,EAAAg1E,EAAA,IAAU8xD,EAAK9mI,SAE7E+mI,EAAcp+H,KAAK0F,IAAIy4H,EAAK9mI,MAAMknC,IAAM,OAG5B4/F,EAAK1D,OACb,SAAe0D,EAAK1D,MAAOxlI,IACzBkpI,EAAK1D,MAAMxlI,GAAG6K,OACgB,OAA5Bq+H,EAAK1D,MAAMxlI,GAAG6K,KAAK5F,MAAiBkkI,EACtCD,EAAK1D,MAAMxlI,GAAG6K,KAAOg9H,EAAMuB,IACU,QAA5BF,EAAK1D,MAAMxlI,GAAG6K,KAAK5F,MAAmBkkI,IAC/CD,EAAK1D,MAAMxlI,GAAG6K,KAAOg9H,EAAMwB,KAQT,IAAtBH,EAAK1D,MAAMzlI,QAAiBmpI,EAAKh7B,WAG/BnjG,KAAK0F,IAAIy4H,EAAK1D,MAAM,GAAGI,MAAQ76H,KAAKC,MAAMk+H,EAAK1D,MAAM,GAAGI,QAAU,QAEpEsD,EAAK1D,MAAM,GAAGn5F,OAAS68F,EAAKI,eAIhC,IAAIlnI,EAAQ8mI,EAAKvB,aAAauB,EAAK9mI,OAE/BuiC,EAAqB,OAAfukG,EAAK9mI,MAAiB+3F,EAAO/3F,EAAOm5D,GAAW,IAAM,GAC3D0yC,EAAUi7B,EAAKla,cAWnB,OATIka,EAAK9mI,QAAS,EAAAg1E,EAAA,IAAU8xD,EAAK9mI,SAC/BuiC,EAAM,IAAMA,EAAM,KAGhBspE,EAAQluG,OAAS,GAAK4kC,EAAI5kC,OAAS,IACrC4kC,GAAO,KAGTA,EAAOspE,GAWTpiB,EAAKtqF,UAAU+nI,YAAc,WAC3B,GAA0B,IAAtBhkI,KAAKkgI,MAAMzlI,OACb,MAAM,IAAI0mC,MAAM,4GAGlB,GAAI17B,KAAK0F,IAAInL,KAAKkgI,MAAM,GAAGI,MAAQ76H,KAAKC,MAAM1F,KAAKkgI,MAAM,GAAGI,SAAW,MACrE,MAAM,IAAIn/F,MAAM,4GAUlB,IAAI8iG,EAA0B,OAAfjkI,KAAKlD,MAAiBqO,EAAInL,KAAKlD,OAAS,EACnDonI,EAAe/4H,EAAInL,KAAKkgI,MAAM,GAAG36H,KAAKzI,OACtCqnI,EAAankI,KAAKkgI,MAAM,GAAGn5F,OAE/B,GAAiB,IAAbk9F,EACF,OAAOE,EAGT,IAAI7D,EAAQtgI,KAAKkgI,MAAM,GAAGI,MACtB8D,EAAW3+H,KAAK49B,IAAI4gG,EAAWx+H,KAAKmN,IAAIuxH,EAAWrnI,MAAQonI,EAAc5D,IAAU76H,KAAK45C,KAAO,IACnG,GAAI+kF,GAAY,UAAYA,EAAW,SAAU,OAAOD,EAExDC,EAAW3+H,KAAK0F,IAAIi5H,GACpB,IAAI5B,EAAWxiI,KAAKkgI,MAAM,GAAG36H,KAAKi9H,SAElC,IAAK,IAAI9kI,KAAK8kI,EACZ,IAAI,SAAeA,EAAU9kI,GAAI,CAC/B,IAAIqpC,EAASy7F,EAAS9kI,GAEtB,GAAIqpC,EAAOs9F,WAAY,CACrB,IAAI32H,EAAOjI,KAAK0F,IAAI1F,KAAK49B,IAAI4gG,EAAWx+H,KAAKmN,IAAIm0B,EAAOjqC,MAAQonI,EAAc5D,IAAU76H,KAAK45C,KAAO,MAEhG3xC,EAAO02H,GAAY12H,IAAS02H,GAAYr9F,EAAOpnC,KAAKlF,OAAS0pI,EAAWxkI,KAAKlF,UAG/E0pI,EAAap9F,EACbq9F,EAAW12H,IAMnB,OAAOy2H,GAiBT59C,EAAKtqF,UAAUkyF,UAAY,SAAUt4C,GAInC,IAHA,IAAIhyC,EAAI7D,KAAKysD,QACTpnB,EAAM,GAED3qC,EAAI,EAAGA,EAAIm7C,EAAMp7C,SAExBoJ,EAAIA,EAAEq0E,GAAGriC,EAAMn7C,IACXA,IAAMm7C,EAAMp7C,OAAS,GAHOC,IAAK,CAKrC,IAAI4pI,EAAWzgI,EAAEm/H,YAGbuB,EAAW7+H,EAAM4+H,GAUjBxgI,EAAI,IAAIyiF,EARQjO,EAAMisD,EAAUD,GAGzBC,EAEAjrD,EAAIz1E,EAAEm/H,aAGQntF,EAAMn7C,GAAGgF,YAClC2lC,EAAI7mC,KAAKsF,GACTD,EAAI4lD,EAAS5lD,EAAGC,GASlB,IAFA,IAAI0gI,EAAU,EAELtpB,EAAM,EAAGA,EAAM71E,EAAI5qC,OAAQygH,IAClCspB,EAAUnjC,EAAUmjC,EAASn/F,EAAI61E,GAAKp+G,OAQxC,OALIw7E,EAAMksD,EAASxkI,KAAKlD,SACtB+G,EAAE/G,MAAQ,GAGZuoC,EAAI7mC,KAAKqF,GACFwhC,GAGT,IAAI+6F,EAAW,CACbC,KAAM,CACJ,GAAI,CACF1gI,KAAM,GACN7C,MAAO,EACPunI,YAAY,IAGhBI,MAAO,CACL,GAAI,CACF9kI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEdK,GAAI,CACF/kI,KAAM,KACN7C,MAAO,GACPunI,YAAY,GAEdrgI,EAAG,CACDrE,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdz7F,EAAG,CACDjpC,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEd31E,EAAG,CACD/uD,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdM,EAAG,CACDhlI,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdO,EAAG,CACDjlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdxjF,EAAG,CACDlhD,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd/+F,EAAG,CACD3lC,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdQ,EAAG,CACDllI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdS,EAAG,CACDnlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd/6H,EAAG,CACD3J,KAAM,IACN7C,MAAO,GACPunI,YAAY,GAEdh7H,EAAG,CACD1J,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdx6H,EAAG,CACDlK,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdv6G,EAAG,CACDnqB,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd5kI,EAAG,CACDE,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd3mI,EAAG,CACDiC,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd96H,EAAG,CACD5J,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEdl7H,EAAG,CACDxJ,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd7gG,EAAG,CACD7jC,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEdvgI,EAAG,CACDnE,KAAM,IACN7C,MAAO,MACPunI,YAAY,IAGhBU,KAAM,CACJ,GAAI,CACFplI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEdW,KAAM,CACJrlI,KAAM,OACN7C,MAAO,GACPunI,YAAY,GAEdY,MAAO,CACLtlI,KAAM,QACN7C,MAAO,IACPunI,YAAY,GAEda,KAAM,CACJvlI,KAAM,OACN7C,MAAO,IACPunI,YAAY,GAEdc,KAAM,CACJxlI,KAAM,OACN7C,MAAO,IACPunI,YAAY,GAEde,KAAM,CACJzlI,KAAM,OACN7C,MAAO,IACPunI,YAAY,GAEdgB,KAAM,CACJ1lI,KAAM,OACN7C,MAAO,KACPunI,YAAY,GAEdiB,KAAM,CACJ3lI,KAAM,OACN7C,MAAO,KACPunI,YAAY,GAEdkB,IAAK,CACH5lI,KAAM,MACN7C,MAAO,KACPunI,YAAY,GAEdmB,MAAO,CACL7lI,KAAM,QACN7C,MAAO,KACPunI,YAAY,GAEdoB,MAAO,CACL9lI,KAAM,QACN7C,MAAO,KACPunI,YAAY,GAEdqB,KAAM,CACJ/lI,KAAM,OACN7C,MAAO,GACPunI,YAAY,GAEdsB,MAAO,CACLhmI,KAAM,QACN7C,MAAO,IACPunI,YAAY,GAEduB,MAAO,CACLjmI,KAAM,QACN7C,MAAO,KACPunI,YAAY,GAEdwB,MAAO,CACLlmI,KAAM,QACN7C,MAAO,KACPunI,YAAY,GAEdyB,KAAM,CACJnmI,KAAM,OACN7C,MAAO,KACPunI,YAAY,GAEd0B,KAAM,CACJpmI,KAAM,OACN7C,MAAO,MACPunI,YAAY,GAEd2B,MAAO,CACLrmI,KAAM,QACN7C,MAAO,MACPunI,YAAY,GAEd4B,KAAM,CACJtmI,KAAM,OACN7C,MAAO,MACPunI,YAAY,GAEd6B,MAAO,CACLvmI,KAAM,QACN7C,MAAO,MACPunI,YAAY,GAEd8B,MAAO,CACLxmI,KAAM,QACN7C,MAAO,MACPunI,YAAY,IAGhB+B,QAAS,CACP,GAAI,CACFzmI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEdK,GAAI,CACF/kI,KAAM,KACN7C,MAAO,IACPunI,YAAY,GAEdrgI,EAAG,CACDrE,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdz7F,EAAG,CACDjpC,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEd31E,EAAG,CACD/uD,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdM,EAAG,CACDhlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdO,EAAG,CACDjlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdxjF,EAAG,CACDlhD,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd/+F,EAAG,CACD3lC,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdQ,EAAG,CACDllI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdS,EAAG,CACDnlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd/6H,EAAG,CACD3J,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdh7H,EAAG,CACD1J,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdx6H,EAAG,CACDlK,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdv6G,EAAG,CACDnqB,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd5kI,EAAG,CACDE,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd3mI,EAAG,CACDiC,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd96H,EAAG,CACD5J,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEdl7H,EAAG,CACDxJ,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd7gG,EAAG,CACD7jC,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEdvgI,EAAG,CACDnE,KAAM,IACN7C,MAAO,MACPunI,YAAY,IAGhBgC,MAAO,CACL,GAAI,CACF1mI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEdK,GAAI,CACF/kI,KAAM,KACN7C,MAAO,IACPunI,YAAY,GAEdrgI,EAAG,CACDrE,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdz7F,EAAG,CACDjpC,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEd31E,EAAG,CACD/uD,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdM,EAAG,CACDhlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdO,EAAG,CACDjlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdxjF,EAAG,CACDlhD,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd/+F,EAAG,CACD3lC,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdQ,EAAG,CACDllI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdS,EAAG,CACDnlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd/6H,EAAG,CACD3J,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdh7H,EAAG,CACD1J,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdx6H,EAAG,CACDlK,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdv6G,EAAG,CACDnqB,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd5kI,EAAG,CACDE,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd3mI,EAAG,CACDiC,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd96H,EAAG,CACD5J,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEdl7H,EAAG,CACDxJ,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEd7gG,EAAG,CACD7jC,KAAM,IACN7C,MAAO,MACPunI,YAAY,GAEdvgI,EAAG,CACDnE,KAAM,IACN7C,MAAO,MACPunI,YAAY,IAGhBiC,gBAAiB,CACf,GAAI,CACF3mI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEdz7F,EAAG,CACDjpC,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEd31E,EAAG,CACD/uD,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdM,EAAG,CACDhlI,KAAM,IACN7C,MAAO,IACPunI,YAAY,GAEdO,EAAG,CACDjlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdxjF,EAAG,CACDlhD,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEd/+F,EAAG,CACD3lC,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdQ,EAAG,CACDllI,KAAM,IACN7C,MAAO,KACPunI,YAAY,GAEdS,EAAG,CACDnlI,KAAM,IACN7C,MAAO,KACPunI,YAAY,IAGhBkC,iBAAkB,CAChB,GAAI,CACF5mI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEdmC,GAAI,CACF7mI,KAAM,KACN7C,MAAO,KACPunI,YAAY,GAEdoC,GAAI,CACF9mI,KAAM,KACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdqC,GAAI,CACF/mI,KAAM,KACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdsC,GAAI,CACFhnI,KAAM,KACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdxuD,GAAI,CACFl2E,KAAM,KACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEduC,GAAI,CACFjnI,KAAM,KACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdwC,GAAI,CACFlnI,KAAM,KACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdyC,GAAI,CACFnnI,KAAM,KACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,IAGhB0C,eAAgB,CACd,GAAI,CACFpnI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEda,KAAM,CACJvlI,KAAM,OACN7C,MAAO,IACPunI,YAAY,GAEdc,KAAM,CACJxlI,KAAM,OACN7C,MAAO,IACPunI,YAAY,GAEde,KAAM,CACJzlI,KAAM,OACN7C,MAAO,IACPunI,YAAY,GAEdgB,KAAM,CACJ1lI,KAAM,OACN7C,MAAO,KACPunI,YAAY,GAEdiB,KAAM,CACJ3lI,KAAM,OACN7C,MAAO,KACPunI,YAAY,GAEdkB,IAAK,CACH5lI,KAAM,MACN7C,MAAO,KACPunI,YAAY,GAEdmB,MAAO,CACL7lI,KAAM,QACN7C,MAAO,KACPunI,YAAY,GAEdoB,MAAO,CACL9lI,KAAM,QACN7C,MAAO,KACPunI,YAAY,IAGhB2C,gBAAiB,CACf,GAAI,CACFrnI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEd4C,KAAM,CACJtnI,KAAM,OACN7C,MAAO,KACPunI,YAAY,GAEd6C,KAAM,CACJvnI,KAAM,OACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEd8C,KAAM,CACJxnI,KAAM,OACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEd+C,KAAM,CACJznI,KAAM,OACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdgD,KAAM,CACJ1nI,KAAM,OACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdiD,IAAK,CACH3nI,KAAM,MACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdkD,KAAM,CACJ5nI,KAAM,OACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,GAEdmD,KAAM,CACJ7nI,KAAM,OACN7C,MAAO2I,KAAKmN,IAAI,KAAM,GACtByxH,YAAY,IAGhBoD,IAAK,CACH,GAAI,CACF9nI,KAAM,GACN7C,MAAO,EACPunI,YAAY,GAEdqD,GAAI,CACF/nI,KAAM,KACN7C,MAAO,IACPunI,YAAY,KAIlBjE,EAASuH,UAAY,GAAS,GAAIvH,EAASqE,MAAOrE,EAAS2E,MAC3D3E,EAASwH,aAAe,GAAS,GAAIxH,EAASkG,gBAAiBlG,EAASmG,kBACxEnG,EAASyH,YAAc,GAAS,GAAIzH,EAAS2G,eAAgB3G,EAAS4G,iBAiBtE,IAAIzG,EAAkB,CAAC,OAAQ,SAAU,OAAQ,UAAW,cAAe,qBAAsB,sBAAuB,QAAS,OAC7H1rB,EAAa,CACfwrB,KAAM,CACJn7C,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC4iD,KAAM,CACJ5iD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC6iD,OAAQ,CACN7iD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC8iD,KAAM,CACJ9iD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC+iD,QAAS,CACP/iD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCgjD,YAAa,CACXhjD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCijD,mBAAoB,CAClBjjD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCkjD,oBAAqB,CACnBljD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCmjD,MAAO,CACLnjD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCojD,QAAS,CACPpjD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCqjD,OAAQ,CACNrjD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCsjD,OAAQ,CACNtjD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCujD,MAAO,CACLvjD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCwjD,SAAU,CACRxjD,WAAY,CAAC,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCyjD,gBAAiB,CACfzjD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC0jD,qBAAsB,CACpB1jD,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC2jD,mBAAoB,CAClB3jD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC4jD,oBAAqB,CACnB5jD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC6jD,oBAAqB,CACnB7jD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC8jD,qBAAsB,CACpB9jD,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC+jD,cAAe,CACb/jD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCgkD,sBAAuB,CACrBhkD,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCikD,UAAW,CACTjkD,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExC4vB,MAAO,CACL5vB,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCkkD,IAAK,CACHlkD,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAIzC,IAAK,IAAIrpF,KAAOg5G,GACV,SAAeA,EAAYh5G,KAC7Bg5G,EAAWh5G,GAAKA,IAAMA,GAI1B,IACIskI,EAAY,CACdxgI,KAAM,GACNpD,KAHmB,GAInBO,MAAO,EACPo3B,OAAQ,EACRgxD,WAAYq7C,EAAgB5pH,KAAI9S,GAAK,KAEnC0+H,EAAQ,CAEV8G,MAAO,CACL1pI,KAAM,QACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEVo1G,KAAM,CACJ3pI,KAAM,OACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEVq1G,KAAM,CACJ5pI,KAAM,OACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEVs1G,KAAM,CACJ7pI,KAAM,OACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEVu1G,KAAM,CACJ9pI,KAAM,OACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAEVjT,KAAM,CACJthB,KAAM,OACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEVw1G,IAAK,CACH/pI,KAAM,MACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,OACPo3B,OAAQ,GAEV8sE,MAAO,CACLrhG,KAAM,QACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEVy1G,SAAU,CACRhqI,KAAM,WACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEVrqB,EAAG,CACDlK,KAAM,IACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEVk0D,GAAI,CACFzoF,KAAM,KACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEV01G,GAAI,CACFjqI,KAAM,KACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEVkuB,GAAI,CACFziD,KAAM,KACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEV21G,GAAI,CACFlqI,KAAM,KACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAEV41G,GAAI,CACFnqI,KAAM,KACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEVotB,GAAI,CACF3hD,KAAM,KACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEV61G,GAAI,CACFpqI,KAAM,KACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEV81G,IAAK,CACHrqI,KAAM,MACNpD,KAAMs4G,EAAWkzB,OACjBvF,SAAUpC,EAASC,KACnBvjI,MAAO,OACPo3B,OAAQ,GAIVvqB,GAAI,CACFhK,KAAM,KACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASgG,QACnBtpI,MAAO,EACPo3B,OAAQ,GAEV+1G,KAAM,CACJtqI,KAAM,OACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAGVg2G,KAAM,CACJvqI,KAAM,OACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,UACPo3B,OAAQ,GAGVi2G,KAAM,CACJxqI,KAAM,OACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,UACPo3B,OAAQ,GAGVk2G,KAAM,CACJzqI,KAAM,OACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,eACPo3B,OAAQ,GAGVm2G,KAAM,CACJ1qI,KAAM,OACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAGVo2G,KAAM,CACJ3qI,KAAM,OACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAGVq2G,MAAO,CACL5qI,KAAM,QACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,WACPo3B,OAAQ,GAGVs2G,KAAM,CACJ7qI,KAAM,OACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAGVu2G,QAAS,CACP9qI,KAAM,UACNpD,KAAMs4G,EAAWyzB,QACjB9F,SAAUpC,EAASC,KACnBvjI,MAAO,IACPo3B,OAAQ,GAIVw2G,GAAI,CACF/qI,KAAM,KACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASiG,MACnBvpI,MAAO,EACPo3B,OAAQ,GAEV49F,EAAG,CACDnyH,KAAM,IACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASqE,MACnB3nI,MAAO,KACPo3B,OAAQ,GAGV2Z,EAAG,CACDluC,KAAM,IACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASqE,MACnB3nI,MAAO,KACPo3B,OAAQ,GAGVy2G,MAAO,CACLhrI,KAAM,QACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAAS2E,KACnBjoI,MAAO,KACPo3B,OAAQ,GAEV02G,KAAM,CACJjrI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,aACPo3B,OAAQ,GAGV22G,KAAM,CACJlrI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,cACPo3B,OAAQ,GAGV42G,KAAM,CACJnrI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,cACPo3B,OAAQ,GAGV62G,SAAU,CACRprI,KAAM,WACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAGV82G,WAAY,CACVrrI,KAAM,aACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAIV+2G,KAAM,CACJtrI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAGVg3G,IAAK,CACHvrI,KAAM,MACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAIVi3G,MAAO,CACLxrI,KAAM,QACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGVk3G,UAAW,CACTzrI,KAAM,YACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,aACPo3B,OAAQ,GAGVm3G,WAAY,CACV1rI,KAAM,aACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGVo3G,KAAM,CACJ3rI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGV4e,GAAI,CACFnzC,KAAM,KACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAGVq3G,IAAK,CACH5rI,KAAM,MACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGVs3G,KAAM,CACJ7rI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGVu3G,MAAO,CACL9rI,KAAM,QACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGVw3G,OAAQ,CACN/rI,KAAM,SACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,WACPo3B,OAAQ,GAGVy3G,WAAY,CACVhsI,KAAM,aACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAGV03G,UAAW,CACTjsI,KAAM,YACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAGV23G,SAAU,CACRlsI,KAAM,WACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAIV43G,KAAM,CACJnsI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,aACPo3B,OAAQ,GAGV63G,KAAM,CACJpsI,KAAM,OACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGV83G,GAAI,CACFrsI,KAAM,KACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGVkkG,GAAI,CACFz4H,KAAM,KACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGV1oB,GAAI,CACF7L,KAAM,KACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGV+3G,GAAI,CACFtsI,KAAM,KACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAGVg4G,IAAK,CACHvsI,KAAM,MACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,WACPo3B,OAAQ,GAGVi4G,IAAK,CACHxsI,KAAM,MACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAGVk4G,IAAK,CACHzsI,KAAM,MACNpD,KAAMs4G,EAAW0zB,OACjB/F,SAAUpC,EAASC,KACnBvjI,MAAO,SACPo3B,OAAQ,GAKV1yB,EAAG,CACD7B,KAAM,IACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASqE,MACnB3nI,MAAO,KACPo3B,OAAQ,GAEVm4G,KAAM,CACJ1sI,KAAM,OACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAAS2E,KACnBjoI,MAAO,KACPo3B,OAAQ,GAEVo4G,IAAK,CACH3sI,KAAM,MACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASqE,MACnB3nI,MAAO,UACPo3B,OAAQ,GAEVppB,EAAG,CACDnL,KAAM,IACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASqE,MACnB3nI,MAAO,IACPo3B,OAAQ,GAEVq4G,MAAO,CACL5sI,KAAM,QACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAAS2E,KACnBjoI,MAAO,IACPo3B,OAAQ,GAEVs4G,MAAO,CACL7sI,KAAM,QACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAEVu4G,KAAM,CACJ9sI,KAAM,OACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,kBACPo3B,OAAQ,GAEVw4G,MAAO,CACL/sI,KAAM,QACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,cACPo3B,OAAQ,GAEVy4G,UAAW,CACThtI,KAAM,YACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,UACPo3B,OAAQ,GAEV04G,cAAe,CACbjtI,KAAM,gBACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,UACPo3B,OAAQ,GAEV24G,MAAO,CACLltI,KAAM,QACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAEV44G,MAAO,CACLntI,KAAM,QACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,WACPo3B,OAAQ,GAEV64G,GAAI,CACFptI,KAAM,KACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,YACPo3B,OAAQ,GAEV84G,GAAI,CACFrtI,KAAM,KACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,kBACPo3B,OAAQ,GAEV+4G,GAAI,CACFttI,KAAM,KACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,cACPo3B,OAAQ,GAEVg5G,IAAK,CACHvtI,KAAM,MACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,UACPo3B,OAAQ,GAEVi5G,IAAK,CACHxtI,KAAM,MACNpD,KAAMs4G,EAAWizB,KACjBtF,SAAUpC,EAASC,KACnBvjI,MAAO,UACPo3B,OAAQ,GAGVvgB,EAAG,CACDhU,KAAM,IACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEV1L,IAAK,CACH7oB,KAAM,MACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,GACPo3B,OAAQ,GAEVlwB,EAAG,CACDrE,KAAM,IACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAEVk5G,OAAQ,CACNztI,KAAM,SACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEVmnD,IAAK,CACH17E,KAAM,MACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEVm5G,OAAQ,CACN1tI,KAAM,SACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,GACPo3B,OAAQ,GAEVo5G,KAAM,CACJ3tI,KAAM,OACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAEVq5G,IAAK,CACH5tI,KAAM,MACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,MACPo3B,OAAQ,GAEVs5G,KAAM,CACJ7tI,KAAM,OACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,OACPo3B,OAAQ,GAEVu5G,MAAO,CACL9tI,KAAM,QACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,QAEPo3B,OAAQ,GAEVw5G,KAAM,CACJ/tI,KAAM,OACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,SAEPo3B,OAAQ,GAEVy5G,OAAQ,CACNhuI,KAAM,SACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,SAEPo3B,OAAQ,GAEV05G,QAAS,CACPjuI,KAAM,UACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,SAEPo3B,OAAQ,GAEV25G,WAAY,CACVluI,KAAM,aACNpD,KAAMs4G,EAAWmzB,KACjBxF,SAAUpC,EAASC,KACnBvjI,MAAO,SAEPo3B,OAAQ,GAGV45G,MAAO,CACLnuI,KAAM,QACNpD,KAAMs4G,EAAWs0B,UACjB3G,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,EACR65G,YAAY,GAEdC,GAAI,CACFruI,KAAM,KACNpD,KAAMs4G,EAAWs0B,UACjB3G,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,EACR65G,YAAY,GAGdE,IAAK,CACHtuI,KAAM,MACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEVg6G,OAAQ,CACNvuI,KAAM,SACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAGV2nD,IAAK,CACHl8E,KAAM,MACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAASqE,MACnB3nI,MAAO,KAEPo3B,OAAQ,GAEVuvF,OAAQ,CACN9jH,KAAM,SACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAAS2E,KACnBjoI,MAAO,KAEPo3B,OAAQ,GAGVi6G,KAAM,CACJxuI,KAAM,OACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAASqE,MACnB3nI,MAAO,KAEPo3B,OAAQ,GAEVk6G,QAAS,CACPzuI,KAAM,UACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAAS2E,KACnBjoI,MAAO,KAEPo3B,OAAQ,GAGVm6G,MAAO,CACL1uI,KAAM,QACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAASC,KACnBvjI,MAAO,KAEPo3B,OAAQ,GAGVo6G,OAAQ,CACN3uI,KAAM,SACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAASC,KACnBvjI,MAAO,KAEPo3B,OAAQ,GAGVq6G,OAAQ,CACN5uI,KAAM,SACNpD,KAAMs4G,EAAWC,MACjB0tB,SAAUpC,EAASC,KACnBvjI,MAAO,KAEPo3B,OAAQ,GAGVy6B,EAAG,CACDhvD,KAAM,IACNpD,KAAMs4G,EAAWozB,QACjBzF,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEVs6G,OAAQ,CACN7uI,KAAM,SACNpD,KAAMs4G,EAAWozB,QACjBzF,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAMVu6G,EAAG,CACD9uI,KAAM,IACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EACPo3B,OAAQ,GAEVw6G,KAAM,CACJ/uI,KAAM,OACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EACPo3B,OAAQ,QAEVy6G,KAAM,CACJhvI,KAAM,OACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EAAI,IACXo3B,OAAQ,QAEV06G,KAAM,CACJjvI,KAAM,OACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EAAI,IACXo3B,OAAQ,GAEV26G,OAAQ,CACNlvI,KAAM,SACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EACPo3B,OAAQ,GAEV46G,QAAS,CACPnvI,KAAM,UACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EACPo3B,OAAQ,QAEV66G,WAAY,CACVpvI,KAAM,aACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EAAI,IACXo3B,OAAQ,QAEV86G,QAAS,CACPrvI,KAAM,UACNpD,KAAMs4G,EAAWqzB,YACjB1F,SAAUpC,EAASC,KACnBvjI,MAAO,EAAI,IACXo3B,OAAQ,GAGV+6G,IAAK,CACHtvI,KAAM,MACNpD,KAAMs4G,EAAWuzB,oBACjB5F,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEVg7G,KAAM,CACJvvI,KAAM,OACNpD,KAAMs4G,EAAWuzB,oBACjB5F,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAGVi7G,GAAI,CACFxvI,KAAM,KACNpD,KAAMs4G,EAAWszB,mBACjB3F,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEVk7G,QAAS,CACPzvI,KAAM,UACNpD,KAAMs4G,EAAWszB,mBACjB3F,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAMV66B,EAAG,CACDpvD,KAAM,IACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEVm7G,OAAQ,CACN1vI,KAAM,SACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEVo7G,IAAK,CACH3vI,KAAM,MACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAASqE,MACnB3nI,MAAO,KACPo3B,OAAQ,GAEVq7G,KAAM,CACJ5vI,KAAM,OACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAAS2E,KACnBjoI,MAAO,KACPo3B,OAAQ,GAEVs7G,IAAK,CACH7vI,KAAM,MACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAASC,KACnBvjI,MAAO,gBACPo3B,OAAQ,GAEVu7G,WAAY,CACV9vI,KAAM,aACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAASC,KACnBvjI,MAAO,gBACPo3B,OAAQ,GAEVw7G,IAAK,CACH/vI,KAAM,MACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAAS2E,KACnBjoI,MAAO,UACPo3B,OAAQ,GAEVy7G,cAAe,CACbhwI,KAAM,gBACNpD,KAAMs4G,EAAWwzB,MACjB7F,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAGVqxF,EAAG,CACD5lH,KAAM,IACNpD,KAAMs4G,EAAW2zB,OACjBhG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEV07G,MAAO,CACLjwI,KAAM,QACNpD,KAAMs4G,EAAW2zB,OACjBhG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEV27G,IAAK,CACHlwI,KAAM,MACNpD,KAAMs4G,EAAW2zB,OACjBhG,SAAUpC,EAASC,KACnBvjI,MAAO,KACPo3B,OAAQ,GAEV47G,GAAI,CACFnwI,KAAM,KACNpD,KAAMs4G,EAAW2zB,OACjBhG,SAAUpC,EAASqE,MACnB3nI,MAAO,KACPo3B,OAAQ,GAEVuzG,IAAK,CACH9nI,KAAM,MACNpD,KAAMs4G,EAAW2zB,OACjBhG,SAAUpC,EAASqH,IACnB3qI,MAAO,cACPo3B,OAAQ,GAEV67G,GAAI,CACFpwI,KAAM,KACNpD,KAAMs4G,EAAW2zB,OACjBhG,SAAUpC,EAASqE,MACnB3nI,MAAO,eACPo3B,OAAQ,GAEV87G,aAAc,CACZrwI,KAAM,eACNpD,KAAMs4G,EAAW2zB,OACjBhG,SAAUpC,EAAS2E,KACnBjoI,MAAO,eACPo3B,OAAQ,GAGV2hG,EAAG,CACDl2H,KAAM,IACNpD,KAAMs4G,EAAW4zB,MACjBjG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEV+7G,KAAM,CACJtwI,KAAM,OACNpD,KAAMs4G,EAAW4zB,MACjBjG,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEVg8G,GAAI,CACFvwI,KAAM,KACNpD,KAAMs4G,EAAW4zB,MACjBjG,SAAUpC,EAASC,KACnBvjI,MAAO,eACPo3B,OAAQ,GAGV4vG,IAAK,CACHnkI,KAAM,MACNpD,KAAMs4G,EAAW4zB,MACjBjG,SAAUpC,EAASqE,MACnB3nI,MAAOymC,EAAQohE,EACfzwE,OAAQ,GAEV6vG,GAAI,CACFpkI,KAAM,KACNpD,KAAMs4G,EAAW4zB,MACjBjG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGVi8G,GAAI,CACFxwI,KAAM,KACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAEV6iD,IAAK,CACHp3E,KAAM,MACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASC,KACnBvjI,MAAO,iBACPo3B,OAAQ,GAEVk8G,IAAK,CACHzwI,KAAM,MACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASC,KACnBvjI,MAAO,OACPo3B,OAAQ,GAEVgC,IAAK,CACHv2B,KAAM,MACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASuH,UACnB7qI,MAAO,IACPo3B,OAAQ,GAEVm8G,KAAM,CACJ1wI,KAAM,OACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEVo8G,KAAM,CACJ3wI,KAAM,OACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEVq8G,MAAO,CACL5wI,KAAM,QACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAEVs8G,MAAO,CACL7wI,KAAM,QACNpD,KAAMs4G,EAAW6zB,SACjBlG,SAAUpC,EAASC,KACnBvjI,MAAO,QACPo3B,OAAQ,GAGV86D,QAAS,CACPrvF,KAAM,UACNpD,KAAMs4G,EAAW8zB,gBACjBnG,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEV26B,EAAG,CACDlvD,KAAM,IACNpD,KAAMs4G,EAAW8zB,gBACjBnG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGVu8G,MAAO,CACL9wI,KAAM,QACNpD,KAAMs4G,EAAW+zB,qBACjBpG,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEVw8G,EAAG,CACD/wI,KAAM,IACNpD,KAAMs4G,EAAW+zB,qBACjBpG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGVy8G,KAAM,CACJhxI,KAAM,OACNpD,KAAMs4G,EAAWg0B,mBACjBrG,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEV08G,EAAG,CACDjxI,KAAM,IACNpD,KAAMs4G,EAAWg0B,mBACjBrG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGV28G,IAAK,CACHlxI,KAAM,MACNpD,KAAMs4G,EAAWi0B,oBACjBtG,SAAUpC,EAASuH,UAEnB7qI,MAAO,EACPo3B,OAAQ,GAcV48G,MAAO,CACLnxI,KAAM,QACNpD,KAAMs4G,EAAWk0B,oBACjBvG,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEV68G,EAAG,CACDpxI,KAAM,IACNpD,KAAMs4G,EAAWk0B,oBACjBvG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGV88G,QAAS,CACPrxI,KAAM,UACNpD,KAAMs4G,EAAWm0B,qBACjBxG,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEV+8G,EAAG,CACDtxI,KAAM,IACNpD,KAAMs4G,EAAWm0B,qBACjBxG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGVg9G,MAAO,CACLvxI,KAAM,QACNpD,KAAMs4G,EAAWo0B,cACjBzG,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEVi9G,GAAI,CACFxxI,KAAM,KACNpD,KAAMs4G,EAAWo0B,cACjBzG,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGVk9G,MAAO,CACLzxI,KAAM,QACNpD,KAAMs4G,EAAWq0B,sBACjB1G,SAAUpC,EAAS2E,KACnBjoI,MAAO,EACPo3B,OAAQ,GAEV0wG,EAAG,CACDjlI,KAAM,IACNpD,KAAMs4G,EAAWq0B,sBACjB1G,SAAUpC,EAASqE,MACnB3nI,MAAO,EACPo3B,OAAQ,GAGV9qB,EAAG,CACDzJ,KAAM,IACNpD,KAAMs4G,EAAWu0B,IACjB5G,SAAUpC,EAASwH,aACnB9qI,MAAO,EACPo3B,OAAQ,GAEVm9G,KAAM,CACJ1xI,KAAM,OACNpD,KAAMs4G,EAAWu0B,IACjB5G,SAAUpC,EAASyH,YACnB/qI,MAAO,EACPo3B,OAAQ,GAEV06B,EAAG,CACDjvD,KAAM,IACNpD,KAAMs4G,EAAWu0B,IACjB5G,SAAUpC,EAASwH,aACnB9qI,MAAO,EACPo3B,OAAQ,GAEVo9G,MAAO,CACL3xI,KAAM,QACNpD,KAAMs4G,EAAWu0B,IACjB5G,SAAUpC,EAASyH,YACnB/qI,MAAO,EACPo3B,OAAQ,IAIRq9G,EAAU,CACZC,OAAQ,QACRC,OAAQ,OACRC,KAAM,OACNC,MAAO,OACPC,MAAO,OACPC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,UAAW,WACX9rF,GAAI,IACJ+rF,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,MACNC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,MAAO,OACPC,OAAQ,QACRC,YAAa,YACbC,eAAgB,gBAChBC,OAAQ,QACRC,GAAI,MACJC,IAAK,MACLC,KAAM,MACNC,IAAK,gBACLC,MAAO,OACPC,SAAU,UACVC,OAAQ,OACRC,OAAQ,OACRC,OAAQ,OACRC,QAAS,OACTC,KAAM,OACNC,MAAO,QACPC,MAAO,QACPC,QAAS,SACTC,KAAM,SACNC,QAAS,SACTC,KAAM,SACNC,MAAO,OACPnhH,GAAI,OACJohH,IAAK,OACLC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,MAAO,OACPC,QAAS,SACTC,UAAW,UACXC,UAAW,aACXtH,MAAO,QACPuH,QAAS,SACTC,QAAS,SACTC,SAAU,UACVC,OAAQ,QACRC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,WAAY,SACZC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,QAAS,SACTC,SAAU,UACVC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,OAAQ,QACRC,cAAe,eACfC,MAAO,OACPC,IAAK,OACLC,KAAM,SAQR,SAASC,EAAqB7qF,GAC5B,GAAsB,cAAlBA,EAAO0gB,OAAwB,CACjC,IAAI3gB,EAAK,EAASsjD,GAClBozB,EAAM0L,IAAInxI,MAAQ,IAAIqyG,EAAW,GACjCozB,EAAM1mD,IAAI/+E,MAAQ+uD,EAAGjI,IAAI,KAEzB2+E,EAAM4L,KAAKrxI,MAAQ+uD,EAAGjI,IAAI,KAE1B2+E,EAAM8L,MAAMvxI,MAAQ+uD,EAAGjJ,MAAM,GAE7B2/E,EAAM+L,OAAOxxI,MAAQ+uD,EAAGjI,IAAI,OAE5B2+E,EAAMgM,OAAOzxI,MAAQ+uD,EAAGjI,IAAI,YAG5B2+E,EAAM0L,IAAInxI,MAAQ,EAClBylI,EAAM1mD,IAAI/+E,MAAQ2I,KAAKiF,GAAK,IAE5B63H,EAAM4L,KAAKrxI,MAAQ2I,KAAKiF,GAAK,IAE7B63H,EAAM8L,MAAMvxI,MAAkB,EAAV2I,KAAKiF,GAEzB63H,EAAM+L,OAAOxxI,MAAQ2I,KAAKiF,GAAK,MAE/B63H,EAAMgM,OAAOzxI,MAAQ2I,KAAKiF,GAAK,MAIjC63H,EAAM2L,OAAOpxI,MAAQylI,EAAM0L,IAAInxI,MAC/BylI,EAAM9e,OAAO3mH,MAAQylI,EAAM1mD,IAAI/+E,MAC/BylI,EAAM6L,QAAQtxI,MAAQylI,EAAM4L,KAAKrxI,MAInC65I,EAAqB7qF,GAEjBzpC,GAEFA,EAAG,UAAU,SAAUglB,EAAMD,GACvBC,EAAKmlC,SAAWplC,EAAKolC,QACvBmqE,EAAqBtvG,MAW3B,IAAIu6F,EAAe,CACjB2B,GAAI,CAEFlD,KAAM,CACJ96H,KAAM46H,EACNp5F,OAAQq5F,EAASC,KAAK,KAExB0H,OAAQ,CACNxiI,KAAMg9H,EAAM14H,EACZk9B,OAAQq5F,EAASqE,MAAM,KAEzBqD,KAAM,CACJviI,KAAMg9H,EAAM/gI,EACZulC,OAAQq5F,EAASqE,MAAM77F,GAEzBo/F,KAAM,CACJziI,KAAMg9H,EAAM5uH,EACZozB,OAAQq5F,EAASqE,MAAM,KAEzBwD,QAAS,CACP1iI,KAAMg9H,EAAM5zE,EACZ5nB,OAAQq5F,EAASqE,MAAM,KAEzByD,YAAa,CACX3iI,KAAMg9H,EAAMkM,EACZ1nG,OAAQq5F,EAASqE,MAAM,KAEzB0D,mBAAoB,CAClB5iI,KAAMg9H,EAAM4M,GACZpoG,OAAQq5F,EAASqE,MAAM,KAEzB2D,oBAAqB,CACnB7iI,KAAMg9H,EAAM0M,IACZloG,OAAQq5F,EAASqE,MAAM,KAEzB3vB,MAAO,CACLvvG,KAAMg9H,EAAM0L,IACZlnG,OAAQq5F,EAASqE,MAAM,KAEzB2E,IAAK,CACH7jI,KAAMg9H,EAAM8O,KACZtqG,OAAQq5F,EAASqE,MAAM,KAGzB4D,MAAO,CACL9iI,KAAMg9H,EAAMxzE,EACZhoB,OAAQq5F,EAASqE,MAAM,KAEzB+D,OAAQ,CACNjjI,KAAMg9H,EAAMhd,EACZx+E,OAAQq5F,EAASqE,MAAM,KAEzBgE,MAAO,CACLljI,KAAMg9H,EAAM1M,EACZ9uF,OAAQq5F,EAASqE,MAAM,KAEzBiE,SAAU,CACRnjI,KAAMg9H,EAAM4N,GACZppG,OAAQq5F,EAASqE,MAAM,KAEzBkE,gBAAiB,CACfpjI,KAAMg9H,EAAM1zE,EACZ9nB,OAAQq5F,EAASqE,MAAM,KAEzBmE,qBAAsB,CACpBrjI,KAAMg9H,EAAMmO,EACZ3pG,OAAQq5F,EAASqE,MAAM,KAEzBoE,mBAAoB,CAClBtjI,KAAMg9H,EAAMqO,EACZ7pG,OAAQq5F,EAASqE,MAAM,KAEzBqE,oBAAqB,CACnBvjI,KAAMg9H,EAAMsO,IACZ9pG,OAAQq5F,EAASqE,MAAM,KAEzBsE,oBAAqB,CACnBxjI,KAAMg9H,EAAMwO,EACZhqG,OAAQq5F,EAASqE,MAAM,KAEzBuE,qBAAsB,CACpBzjI,KAAMg9H,EAAM0O,EACZlqG,OAAQq5F,EAASqE,MAAM,KAEzBwE,cAAe,CACb1jI,KAAMg9H,EAAM4O,GACZpqG,OAAQq5F,EAASqE,MAAM,KAEzByE,sBAAuB,CACrB3jI,KAAMg9H,EAAMqC,EACZ79F,OAAQq5F,EAASqE,MAAM,KAEzB0E,UAAW,CACT5jI,KAAMg9H,EAAMyL,GACZjnG,OAAQq5F,EAASqE,MAAM,OAK7B7C,EAAagV,IAAM/5G,KAAKzoB,MAAMyoB,KAAKqC,UAAU0iG,EAAa2B,KAC1D3B,EAAagV,IAAI7O,OAAS,CACxBxiI,KAAMg9H,EAAM14H,EACZk9B,OAAQq5F,EAASqE,MAAMp7H,GAEzBu4H,EAAagV,IAAI9O,KAAO,CACtBviI,KAAMg9H,EAAM/gI,EACZulC,OAAQq5F,EAASqE,MAAM,KAEzB7C,EAAagV,IAAIvO,MAAQ,CACvB9iI,KAAMg9H,EAAM+M,IACZvoG,OAAQq5F,EAASqE,MAAM,KAEzB7C,EAAagV,IAAIpO,OAAS,CACxBjjI,KAAMg9H,EAAMsN,IACZ9oG,OAAQq5F,EAASC,KAAK,KAIxBuB,EAAaiV,GAAKh6G,KAAKzoB,MAAMyoB,KAAKqC,UAAU0iG,EAAa2B,KACzD3B,EAAaiV,GAAG9O,OAAS,CACvBxiI,KAAMg9H,EAAMqH,GACZ7iG,OAAQq5F,EAASC,KAAK,KAExBuB,EAAaiV,GAAG/O,KAAO,CACrBviI,KAAMg9H,EAAM2K,IACZnmG,OAAQq5F,EAASC,KAAK,KAExBuB,EAAaiV,GAAG3O,YAAc,CAC5B3iI,KAAMg9H,EAAMoM,KACZ5nG,OAAQq5F,EAASC,KAAK,KAExBuB,EAAaiV,GAAGxO,MAAQ,CACtB9iI,KAAMg9H,EAAMiN,IACZzoG,OAAQq5F,EAASC,KAAK,KAExBuB,EAAaiV,GAAGrO,OAAS,CACvBjjI,KAAMg9H,EAAMkF,IACZ1gG,OAAQq5F,EAASqH,IAAI,KAEvB7F,EAAaiV,GAAGpO,MAAQ,CACtBljI,KAAMg9H,EAAM2N,GACZnpG,OAAQq5F,EAASC,KAAK,KAExBuB,EAAaiV,GAAGnO,SAAW,CACzBnjI,KAAMg9H,EAAMxrD,IACZhwC,OAAQq5F,EAASC,KAAK,KAIxBuB,EAAaC,KAAOhlG,KAAKzoB,MAAMyoB,KAAKqC,UAAU0iG,EAAa2B,KAE3D,IAAIH,EAAoBxB,EAAaC,KAkErC,IAAK,IAAIiV,KA5DTvwD,EAAKwwD,cAAgB,SAAUp3I,GAC7B,KAAI,SAAeiiI,EAAcjiI,GAG/B,MAAM,IAAIwhC,MAAM,eAAiBxhC,EAAO,iCAAmChE,OAAO4G,KAAKq/H,GAAc54F,KAAK,OAF1Go6F,EAAoBxB,EAAajiI,IAWrC4mF,EAAKywD,cAAgB,WACnB,IAAK,IAAIp6D,KAAQglD,EACf,IAAI,SAAeA,EAAchlD,IAC3BglD,EAAahlD,KAAUwmD,EACzB,OAAOxmD,GAWf2J,EAAK0wD,eAAiB,CACpB5/C,UAAW,SAAmBxzF,GAC5B,OAAO,IAAIsrG,EAAWtrG,EAAI,KAE5B0qD,SAAU,SAAkB1qD,GAC1B,OAAO,IAAIurG,EAAUvrG,IAEvB0/B,QAAS,SAAiB1/B,GACxB,OAAOA,GAET2oE,OAAQ,SAAgB3oE,GACtB,OAAOA,IAYX0iF,EAAK67C,oBAAsB,SAAUhiI,GACnC,IAAKmmF,EAAK0wD,eAAe72I,GACvB,MAAM,IAAIjF,UAAU,qBAAuBiF,EAAO,KAGpD,OAAOmmF,EAAK0wD,eAAe72I,IAIXmiI,EAChB,IAAI,SAAeA,EAAOuU,GAAQ,CAChC,IAAIvxI,EAAOg9H,EAAMuU,GACjBvxI,EAAK2/E,WAAa3/E,EAAKhJ,KAAK2oF,WAKhC,IAAK,IAAIgyD,KAAU3F,EACjB,IAAI,SAAeA,EAAS2F,GAAS,CACnC,IAAIC,EAAS5U,EAAMgP,EAAQ2F,IACvBE,EAAQ,GAEZ,IAAK,IAAIC,KAASF,GACZ,SAAeA,EAAQE,KACzBD,EAAMC,GAASF,EAAOE,IAI1BD,EAAMz3I,KAAOu3I,EACb3U,EAAM2U,GAAUE,EAgTpB,OAtSA7wD,EAAKy6C,aAAe,SAAsB33H,GACxC,MAAO,aAAazJ,KAAKyJ,IAoC3Bk9E,EAAK0H,WAAa,SAAU3uF,EAAK22D,GAC/B,GAAmB,iBAAR32D,EACT,MAAM,IAAInE,UAAU,6DAItB,GAAI86D,GAAWA,EAAQqhF,SACrB,IAAK,IAAIC,KAASj4I,EAKhB,IAJI,SAAeA,EAAKi4I,IACtBhxD,EAAKixD,WAAWD,GAGdj4I,EAAIi4I,GAAOE,QACb,IAAK,IAAI/8I,EAAI,EAAGA,EAAI4E,EAAIi4I,GAAOE,QAAQh9I,OAAQC,IAC7C6rF,EAAKixD,WAAWl4I,EAAIi4I,GAAOE,QAAQ/8I,IAO3C,IAAIg9I,EAEJ,IAAK,IAAIC,KAASr4I,GACZ,SAAeA,EAAKq4I,KACtBD,EAAWnxD,EAAKqxD,iBAAiBD,EAAOr4I,EAAIq4I,KAIhD,OAAOD,GAgCTnxD,EAAKqxD,iBAAmB,SAAUj4I,EAAML,EAAK22D,GAK3C,GAJI,MAAO32D,IACTA,EAAM,IAGY,iBAATK,EACT,MAAM,IAAIxE,UAAU,mEAItB,IAAI,SAAeonI,EAAO5iI,GACxB,MAAM,IAAIwhC,MAAM,uBAAyBxhC,EAAO,4CAzGpD,SAA+BA,GAC7B,IAAK,IAAIjF,EAAI,EAAGA,EAAIiF,EAAKlF,OAAQC,IAAK,CAGpC,GAFA2O,EAAI1J,EAAKiiD,OAAOlnD,GAEN,IAANA,IAAY6rF,EAAKy6C,aAAa33H,GAChC,MAAM,IAAI83B,MAAM,yDAA2DxhC,EAAO,KAGpF,GAAIjF,EAAI,IAAO6rF,EAAKy6C,aAAa33H,KAAMkgF,EAAQlgF,GAC7C,MAAM,IAAI83B,MAAM,kEAAoExhC,EAAO,MAoG/Fk4I,CAAsBl4I,GACtB,IAIIoV,EACAytH,EACAsV,EANAC,EAAU,KAEVN,EAAU,GACVvjH,EAAS,EAKb,GAAI50B,GAAoB,SAAbA,EAAIc,KACb23I,EAAUz4I,EAAImtD,aACT,GAAmB,iBAARntD,EACJ,KAARA,IACFyV,EAAazV,OAEV,IAAmB,iBAARA,EAUhB,MAAM,IAAInE,UAAU,uBAAyBwE,EAAO,WAAaL,EAAII,WAAa,+CATlFqV,EAAazV,EAAIyV,WACjBytH,EAAWljI,EAAIkjI,SACftuG,EAAS50B,EAAI40B,OACb4jH,EAAWx4I,EAAIw4I,SAEXx4I,EAAIm4I,UACNA,EAAUn4I,EAAIm4I,QAAQtuF,WAM1B,GAAIsuF,EACF,IAAK,IAAI/8I,EAAI,EAAGA,EAAI+8I,EAAQh9I,OAAQC,IAClC,IAAI,SAAe6nI,EAAOkV,EAAQ/8I,IAChC,MAAM,IAAIymC,MAAM,wBAA0Bs2G,EAAQ/8I,GAAK,2CAK7D,GAAIqa,GAAoC,iBAAfA,IAA4BgjI,EACnD,IACEA,EAAUxxD,EAAKnyE,MAAMW,EAAY,CAC/B+sH,cAAc,IAEhB,MAAOroH,GAEP,MADAA,EAAG2K,QAAU,0BAA4BzkB,EAAO,WAAaoV,EAAa,MAAQ0E,EAAG2K,QAC/E3K,OAEC1E,GAAkC,SAApBA,EAAW3U,OAClC23I,EAAUhjI,EAAW03C,SAGvBgrF,EAAUA,GAAW,GACrBvjH,EAASA,GAAU,EAGjBsuG,EADEA,GAAYA,EAASwV,aACZ5X,EAASoC,EAASwV,gBAElB5X,EAASC,KAKtB,IAAI4X,EAAU,GAEd,GAAKF,EAwCE,CACLE,EAAU,CACRt4I,KAAMA,EACN7C,MAAOi7I,EAAQj7I,MACfooF,WAAY6yD,EAAQ7yD,WAAWpmF,MAAM,GACrC0jI,SAAUA,EACVtuG,OAAQA,GAGV,IAAIgkH,GAAW,EAEf,IAAK,IAAI98B,KAAOvG,EACd,IAAI,SAAeA,EAAYuG,GAAM,CAGnC,IAFA,IAAIz3E,GAAQ,EAEHxa,EAAI,EAAGA,EAAIo3G,EAAgB9lI,OAAQ0uB,IAC1C,GAAI1jB,KAAK0F,KAAK8sI,EAAQ/yD,WAAW/7D,IAAM,IAAM0rF,EAAWuG,GAAKl2B,WAAW/7D,IAAM,IAAM,MAAO,CACzFwa,GAAQ,EACR,MAIJ,GAAIA,EAAO,CACTu0G,GAAW,EACXD,EAAQ17I,KAAOs4G,EAAWuG,GAC1B,OAKN,IAAK88B,EAAU,CACbJ,EAAWA,GAAYn4I,EAAO,SAG9B,IAAIw4I,EAAe,CACjBjzD,WAAY6yD,EAAQ7yD,WAAWpmF,MAAM,IAEvCq5I,EAAat8I,IAAMi8I,EACnBjjC,EAAWijC,GAAYK,EACvB/U,EAAkB0U,GAAY,CAC5BvyI,KAAM0yI,EACNlxG,OAAQq5F,EAASC,KAAK,KAExB4X,EAAQ17I,KAAOs4G,EAAWijC,QAnFhB,CAIZ,GAFAA,EAAWA,GAAYn4I,EAAO,SAE1B4gI,EAAgBvuG,QAAQ8lH,IAAa,EACvC,MAAM,IAAI32G,MAAM,gCAAkCxhC,EAAO,2EAK3D,IAAK,IAAIyJ,KAFTm3H,EAAgB/hI,KAAKs5I,GAEPjjC,GACR,SAAeA,EAAYzrG,KAC7ByrG,EAAWzrG,GAAG87E,WAAWq7C,EAAgB9lI,OAAS,GAAK,GAS3D,IAJA,IAAI29I,EAAc,CAChBlzD,WAAY,IAGLmzD,EAAM,EAAGA,EAAM9X,EAAgB9lI,OAAQ49I,IAC9CD,EAAYlzD,WAAWmzD,GAAO,EAGhCD,EAAYlzD,WAAWq7C,EAAgB9lI,OAAS,GAAK,EACrD29I,EAAYv8I,IAAMi8I,EAClBjjC,EAAWijC,GAAYM,EACvBH,EAAU,CACRt4I,KAAMA,EACN7C,MAAO,EACPooF,WAAY2vB,EAAWijC,GAAU5yD,WAAWpmF,MAAM,GAClD0jI,SAAUA,EACVtuG,OAAQA,EACR33B,KAAMs4G,EAAWijC,IAEnB1U,EAAkB0U,GAAY,CAC5BvyI,KAAM0yI,EACNlxG,OAAQq5F,EAASC,KAAK,KAiD1B95C,EAAKg8C,MAAM5iI,GAAQs4I,EAEnB,IAAK,IAAIK,EAAM,EAAGA,EAAMb,EAAQh9I,OAAQ69I,IAAO,CAC7C,IAAIC,EAAYd,EAAQa,GACpBE,EAAS,GAEb,IAAK,IAAIC,KAASR,GACZ,SAAeA,EAASQ,KAC1BD,EAAOC,GAASR,EAAQQ,IAI5BD,EAAO74I,KAAO44I,EACdhyD,EAAKg8C,MAAMgW,GAAaC,EAM1B,cADO9W,EAAUh9D,MACV,IAAI6hB,EAAK,KAAM5mF,IAGxB4mF,EAAKixD,WAAa,SAAU73I,UACnB4mF,EAAKg8C,MAAM5iI,IAIpB4mF,EAAK65C,SAAWA,EAChB75C,EAAKg6C,gBAAkBA,EACvBh6C,EAAKsuB,WAAaA,EAClBtuB,EAAKq7C,aAAeA,EACpBr7C,EAAKg8C,MAAQA,EACNh8C,IACN,CACD3T,SAAS,ICj5HP,GAAO,aACP,GAAe,CAAC,QAAS,QAClB8lE,IAAkC,QAAQ,GAAM,IAAelrF,IACxE,IAAI,MACF+1B,EAAK,KACLgD,GACE/4B,EA2CJ,OAAO+1B,EAAM,GAAM,CAEjB,iBAAkB,SAAsBjkF,EAAK22D,GAC3C,OAAOswB,EAAK0H,WAAW3uF,EAAK22D,IAG9Bt6D,OAAQ,SAAgB2D,GACtB,OAAOinF,EAAK0H,WAAW3uF,EAAK,KAG9B,yCAA0C,SAAsCK,EAAMg5I,EAAK1iF,GACzF,IAAI32D,EAAM,GAEV,OADAA,EAAIK,GAAQg5I,EACLpyD,EAAK0H,WAAW3uF,EAAK22D,IAG9B,iCAAkC,SAAgCt2D,EAAMg5I,GACtE,IAAIr5I,EAAM,GAEV,OADAA,EAAIK,GAAQg5I,EACLpyD,EAAK0H,WAAW3uF,EAAK,KAG9BmkE,OAAQ,SAAgB9jE,GACtB,IAAIL,EAAM,GAEV,OADAA,EAAIK,GAAQ,GACL4mF,EAAK0H,WAAW3uF,EAAK,UCvE9B,GAAe,CAAC,SAAU,QAAS,SAAU,YAAa,QAAS,WAAY,MAAO,OAAQ,MAAO,MAAO,iBAAkB,MAAO,YAAa,WAAY,OACvJs5I,IAA4B,QAF5B,OAE0C,IAAeprF,IAClE,IAAI,OACF1B,EAAM,MACNy3B,EAAK,OACLl4E,EAAM,UACNg2F,EAAS,SACT53C,EAAQ,MACR6uB,EAAK,IACLntE,EAAG,KACHu5B,EAAI,IACJpB,EAAG,IACHG,EAAG,eACH09D,EAAc,IACd/mB,EAAG,UACHqB,EAAS,SACT9uE,EAAQ,IACR2N,GACEkzC,EA+BJ,OAAO+1B,EAAM,OAAQ,CACnB3oF,MAAO,SAAeiJ,GAEpB,IAAIo6H,EAAM5yH,EAAOxH,GACb6d,EAAOu8G,EAAIv8G,OAEf,GAAoB,IAAhBA,EAAKjnB,QAAgBinB,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAIq7F,WAAW,iCAAuC,SAAOr7F,GAAQ,KAI7E,IAAIm3H,EAAMC,EAAe7a,EAAKv8G,EAAK,IACnC,MAAO,CACL6a,OAAQs8G,EAAI,GACZE,QAASF,EAAI,KAGjBt3C,OAAQ,SAAgB19F,GAGtB,IAAI6d,EAAO7d,EAAE6d,OAEb,GAAoB,IAAhBA,EAAKjnB,QAAgBinB,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAIq7F,WAAW,iCAAuC,SAAOr7F,GAAQ,KAG7E,IAAIm3H,EAAMC,EAAej1I,EAAG6d,EAAK,IACjC,MAAO,CACL6a,OAAQlxB,EAAOwtI,EAAI,IACnBE,QAAS1tI,EAAOwtI,EAAI,QAoB1B,SAASC,EAAej1I,EAAGpE,GACzB,IAAIW,EAAOyD,EAAEshG,WAMb,QAJahnG,IAATiC,IACFA,EAAOyD,EAAEwmG,eAGE,WAATjqG,GAA8B,cAATA,GAAiC,aAATA,EAC/C,KAAa,UAATA,EACI,IAAIjF,UAAU,8CAEd,IAAIA,UAAU,sCAAwCiF,EAAO,KAOvE,GAhCF,SAAqByD,EAAGpE,GACtB,IAAK,IAAI/E,EAAI,EAAGA,EAAI+E,EAAG/E,IACrB,IAAK,IAAIyuB,EAAIzuB,EAAGyuB,EAAI1pB,EAAG0pB,IAErB,IAAKmvD,EAAMz0E,EAAEnJ,GAAGyuB,GAAItlB,EAAEslB,GAAGzuB,IACvB,MAAM,IAAIS,UAAU,iCAuBxB69I,CAAYn1I,EAAE07F,UAAW9/F,GAId,WAATW,EACF,OAAOuyF,EAAK9uF,EAAE07F,WACT,GAAa,aAATn/F,EAAqB,CAG9B,IAFA,IAAI64I,EAAOp1I,EAAE07F,UAEJ7kG,EAAI,EAAGA,EAAI+E,EAAG/E,IACrB,IAAK,IAAIyuB,EAAIzuB,EAAGyuB,EAAI1pB,EAAG0pB,IACrB8vH,EAAKv+I,GAAGyuB,GAAK8vH,EAAKv+I,GAAGyuB,GAAGggC,UACxB8vF,EAAK9vH,GAAGzuB,GAAKu+I,EAAKv+I,GAAGyuB,GAIzB,OAAOwpE,EAAK9uF,EAAE07F,WACT,MAAa,cAATn/F,EAuCb,SAAiByD,GAMf,IALA,IAEIkzE,EAFAhoB,EAAIlrD,EAAEpJ,OACNy+I,EAAK/tI,EAAI2gD,EAAO4kB,QAAU3hB,GAE1BoqF,EAAM,IAAIv+I,MAAMm0D,GAEXr0D,EAAI,EAAGA,EAAIq0D,EAAGr0D,IACrBy+I,EAAIz+I,GAAK0+I,EAAYrqF,EAAG,GACxBoqF,EAAIz+I,GAAGA,GAAK,EAMd,IAFA,IAiCmB2+I,EAAKC,EAAKC,EACzBC,EAlCAC,EAAMC,EAAU71I,GAEbsH,EAAIsuI,EAAI,KAAOtuI,EAAI+tI,IAAK,CAC7B,IAAIv+B,EAAM8+B,EAAI,GAAG,GACbtwH,EAAIswH,EAAI,GAAG,GAEf51I,EAAI81I,EAAM91I,GA2BOw1I,EA5BCx1I,EAAE82G,GAAKA,GA4BH2+B,EA5BSz1I,EAAEslB,GAAGA,GA4BTowH,EA5Ba11I,EAAE82G,GAAKxxF,GA6B7CqwH,WAAQ/vF,EAAS6vF,EAAKD,GA7BxBtiE,EA+BE5rE,EAAIquI,IAAU1tF,EAAO4kB,QAChB+K,GAAW,GAAG92C,OAAOif,IAAI,GAEzBu9C,EAAe,GAAKz8D,EAAK/3B,EAAS,EAAG4sI,EAAKn/D,EAAIo/D,OAjCnC7+B,EAAKxxF,GACvBgwH,EAAMS,EAAQT,EAAKpiE,EAAK4jC,EAAKxxF,GAC7BswH,EAAMC,EAAU71I,GAKlB,IAFA,IAAI+iI,EAAKwS,EAAYrqF,EAAG,GAEfkiE,EAAM,EAAGA,EAAMliE,EAAGkiE,IACzB2V,EAAG3V,GAAOptH,EAAEotH,GAAKA,GAInB,OAAO4oB,GAAQ,SAAMjT,IAAK,SAAMuS,IApEvBW,CAAQj2I,EAAE07F,gBADZ,EAMT,SAAS5M,EAAK9uF,GAMZ,IALA,IAEIkzE,EAFAhoB,EAAIlrD,EAAEpJ,OACNy+I,EAAKzzI,KAAK0F,IAAI2gD,EAAO4kB,QAAU3hB,GAE/BoqF,EAAM,IAAIv+I,MAAMm0D,GAEXr0D,EAAI,EAAGA,EAAIq0D,EAAGr0D,IACrBy+I,EAAIz+I,GAAK0+I,EAAYrqF,EAAG,GACxBoqF,EAAIz+I,GAAGA,GAAK,EAMd,IAFA,IAAI++I,EAAMM,EAAOl2I,GAEV4B,KAAK0F,IAAIsuI,EAAI,KAAOh0I,KAAK0F,IAAI+tI,IAAK,CACvC,IAAI76I,EAAKo7I,EAAI,GAAG,GACZtwH,EAAIswH,EAAI,GAAG,GAEf51I,EAAIsD,EAAGtD,GAiDOw1I,EAlDCx1I,EAAExF,GAAIA,GAkDFi7I,EAlDOz1I,EAAEslB,GAAGA,GAkDPowH,EAlDW11I,EAAExF,GAAI8qB,GAmDvCqwH,WAAQF,EAAMD,EAnDhBtiE,EAqDEtxE,KAAK0F,IAAIquI,IAAU1tF,EAAO4kB,QACrBjrE,KAAKiF,GAAK,EAEV,GAAMjF,KAAKi/B,KAAK,EAAI60G,GAAOD,EAAMD,KAvDzBh7I,EAAI8qB,GACnBgwH,EAAMa,EAAKb,EAAKpiE,EAAK14E,EAAI8qB,GACzBswH,EAAMM,EAAOl2I,GAKf,IA0CF,IAAkBw1I,EAAKC,EAAKC,EACtBC,EA7CA5S,EAAKwS,EAAYrqF,EAAG,GAEfmuC,EAAM,EAAGA,EAAMnuC,EAAGmuC,IACzB0pC,EAAG1pC,GAAOr5F,EAAEq5F,GAAKA,GAGnB,OAAO28C,GAAQ,SAAMjT,IAAK,SAAMuS,IA4DlC,SAASa,EAAKb,EAAKrkE,EAAOp6E,EAAGyuB,GAO3B,IANA,IAAI4lC,EAAIoqF,EAAI1+I,OACR4O,EAAI5D,KAAK69B,IAAIwxC,GACbnhE,EAAIlO,KAAKg+B,IAAIqxC,GACbmlE,EAAMb,EAAYrqF,EAAG,GACrBmrF,EAAMd,EAAYrqF,EAAG,GAEhBnmB,EAAI,EAAGA,EAAImmB,EAAGnmB,IACrBqxG,EAAIrxG,GAAKv/B,EAAI8vI,EAAIvwG,GAAGluC,GAAKiZ,EAAIwlI,EAAIvwG,GAAGzf,GACpC+wH,EAAItxG,GAAKj1B,EAAIwlI,EAAIvwG,GAAGluC,GAAK2O,EAAI8vI,EAAIvwG,GAAGzf,GAGtC,IAAK,IAAI8xF,EAAK,EAAGA,EAAKlsD,EAAGksD,IACvBk+B,EAAIl+B,GAAIvgH,GAAKu/I,EAAIh/B,GACjBk+B,EAAIl+B,GAAI9xF,GAAK+wH,EAAIj/B,GAGnB,OAAOk+B,EAIT,SAASS,EAAQT,EAAKrkE,EAAOp6E,EAAGyuB,GAO9B,IANA,IAAI4lC,EAAIoqF,EAAI1+I,OACR4O,EAAIi6B,EAAIwxC,GACRnhE,EAAI8vB,EAAIqxC,GACRmlE,EAAMb,EAAYrqF,EAAG0sB,EAAU,IAC/By+D,EAAMd,EAAYrqF,EAAG0sB,EAAU,IAE1B7yC,EAAI,EAAGA,EAAImmB,EAAGnmB,IACrBqxG,EAAIrxG,GAAK6gB,EAAS03C,EAAe93F,EAAG8vI,EAAIvwG,GAAGluC,IAAKymG,EAAextF,EAAGwlI,EAAIvwG,GAAGzf,KACzE+wH,EAAItxG,GAAKy4D,EAAUF,EAAextF,EAAGwlI,EAAIvwG,GAAGluC,IAAKymG,EAAe93F,EAAG8vI,EAAIvwG,GAAGzf,KAG5E,IAAK,IAAIgyF,EAAM,EAAGA,EAAMpsD,EAAGosD,IACzBg+B,EAAIh+B,GAAKzgH,GAAKu/I,EAAI9+B,GAClBg+B,EAAIh+B,GAAKhyF,GAAK+wH,EAAI/+B,GAGpB,OAAOg+B,EAIT,SAASQ,EAAMQ,EAAKrlE,EAAOp6E,EAAGyuB,GAc5B,IAbA,IAAI4lC,EAAIorF,EAAI1/I,OACR4O,EAAIoyE,EAAUn4C,EAAIwxC,IAClBnhE,EAAI8nE,EAAUh4C,EAAIqxC,IAClBoU,EAAKiY,EAAe93F,EAAGA,GACvB+wI,EAAKj5C,EAAextF,EAAGA,GACvB0mI,EAAMjB,EAAYrqF,EAAG0sB,EAAU,IAC/B6+D,EAAMlB,EAAYrqF,EAAG0sB,EAAU,IAE/B8+D,EAAQ5tI,EAAS8uE,EAAU,GAAIpyE,EAAGsK,EAAGwmI,EAAIz/I,GAAGyuB,IAE5CqxH,EAAMn5C,EAAU53C,EAAS03C,EAAejY,EAAIixD,EAAIz/I,GAAGA,IAAK6/I,GAAQp5C,EAAei5C,EAAID,EAAIhxH,GAAGA,KAC1FsxH,EAAMngI,EAAI6mF,EAAei5C,EAAID,EAAIz/I,GAAGA,IAAK6/I,EAAOp5C,EAAejY,EAAIixD,EAAIhxH,GAAGA,KAErEyf,EAAI,EAAGA,EAAImmB,EAAGnmB,IACrByxG,EAAIzxG,GAAK6gB,EAAS03C,EAAe93F,EAAG8wI,EAAIz/I,GAAGkuC,IAAKu4D,EAAextF,EAAGwmI,EAAIhxH,GAAGyf,KACzE0xG,EAAI1xG,GAAKy4D,EAAUF,EAAextF,EAAGwmI,EAAIz/I,GAAGkuC,IAAKu4D,EAAe93F,EAAG8wI,EAAIhxH,GAAGyf,KAI5EuxG,EAAIz/I,GAAGA,GAAK8/I,EACZL,EAAIhxH,GAAGA,GAAKsxH,EACZN,EAAIz/I,GAAGyuB,GAAKsyD,EAAU,GACtB0+D,EAAIhxH,GAAGzuB,GAAK+gF,EAAU,GAEtB,IAAK,IAAIi/D,EAAM,EAAGA,EAAM3rF,EAAG2rF,IACrBA,IAAQhgJ,GAAKggJ,IAAQvxH,IACvBgxH,EAAIz/I,GAAGggJ,GAAOL,EAAIK,GAClBP,EAAIO,GAAKhgJ,GAAK2/I,EAAIK,GAClBP,EAAIhxH,GAAGuxH,GAAOJ,EAAII,GAClBP,EAAIO,GAAKvxH,GAAKmxH,EAAII,IAItB,OAAOP,EAIT,SAAShzI,EAAGgzI,EAAKrlE,EAAOp6E,EAAGyuB,GAYzB,IAXA,IAAI4lC,EAAIorF,EAAI1/I,OACR4O,EAAI5D,KAAK69B,IAAIwxC,GACbnhE,EAAIlO,KAAKg+B,IAAIqxC,GACboU,EAAK7/E,EAAIA,EACT+wI,EAAKzmI,EAAIA,EACT0mI,EAAMjB,EAAYrqF,EAAG,GACrBurF,EAAMlB,EAAYrqF,EAAG,GAErByrF,EAAMtxD,EAAKixD,EAAIz/I,GAAGA,GAAK,EAAI2O,EAAIsK,EAAIwmI,EAAIz/I,GAAGyuB,GAAKixH,EAAKD,EAAIhxH,GAAGA,GAC3DsxH,EAAML,EAAKD,EAAIz/I,GAAGA,GAAK,EAAI2O,EAAIsK,EAAIwmI,EAAIz/I,GAAGyuB,GAAK+/D,EAAKixD,EAAIhxH,GAAGA,GAEtDyf,EAAI,EAAGA,EAAImmB,EAAGnmB,IACrByxG,EAAIzxG,GAAKv/B,EAAI8wI,EAAIz/I,GAAGkuC,GAAKj1B,EAAIwmI,EAAIhxH,GAAGyf,GACpC0xG,EAAI1xG,GAAKj1B,EAAIwmI,EAAIz/I,GAAGkuC,GAAKv/B,EAAI8wI,EAAIhxH,GAAGyf,GAItCuxG,EAAIz/I,GAAGA,GAAK8/I,EACZL,EAAIhxH,GAAGA,GAAKsxH,EACZN,EAAIz/I,GAAGyuB,GAAK,EACZgxH,EAAIhxH,GAAGzuB,GAAK,EAEZ,IAAK,IAAIigJ,EAAM,EAAGA,EAAM5rF,EAAG4rF,IACrBA,IAAQjgJ,GAAKigJ,IAAQxxH,IACvBgxH,EAAIz/I,GAAGigJ,GAAON,EAAIM,GAClBR,EAAIQ,GAAKjgJ,GAAK2/I,EAAIM,GAClBR,EAAIhxH,GAAGwxH,GAAOL,EAAIK,GAClBR,EAAIQ,GAAKxxH,GAAKmxH,EAAIK,IAItB,OAAOR,EAIT,SAASJ,EAAOa,GAKd,IAJA,IAAI7rF,EAAI6rF,EAAIngJ,OACRogJ,EAAS,EACTC,EAAQ,CAAC,EAAG,GAEPpgJ,EAAI,EAAGA,EAAIq0D,EAAGr0D,IACrB,IAAK,IAAIyuB,EAAIzuB,EAAI,EAAGyuB,EAAI4lC,EAAG5lC,IACrB1jB,KAAK0F,IAAI0vI,GAAUp1I,KAAK0F,IAAIyvI,EAAIlgJ,GAAGyuB,MACrC0xH,EAASp1I,KAAK0F,IAAIyvI,EAAIlgJ,GAAGyuB,IACzB2xH,EAAQ,CAACpgJ,EAAGyuB,IAKlB,MAAO,CAAC2xH,EAAOD,GAIjB,SAASnB,EAAUkB,GAKjB,IAJA,IAAI7rF,EAAI6rF,EAAIngJ,OACRogJ,EAAS,EACTC,EAAQ,CAAC,EAAG,GAEPpgJ,EAAI,EAAGA,EAAIq0D,EAAGr0D,IACrB,IAAK,IAAIyuB,EAAIzuB,EAAI,EAAGyuB,EAAI4lC,EAAG5lC,IACrBhe,EAAI0vI,GAAU1vI,EAAIyvI,EAAIlgJ,GAAGyuB,MAC3B0xH,EAAS1vI,EAAIyvI,EAAIlgJ,GAAGyuB,IACpB2xH,EAAQ,CAACpgJ,EAAGyuB,IAKlB,MAAO,CAAC2xH,EAAOD,GAIjB,SAAShB,EAAQv0G,EAAG2rG,GAKlB,IAJA,IAAIliF,EAAIzpB,EAAE7qC,OACNsgJ,EAAKngJ,MAAMm0D,GACXisF,EAAKpgJ,MAAMm0D,GAENnmB,EAAI,EAAGA,EAAImmB,EAAGnmB,IACrBoyG,EAAGpyG,GAAKhuC,MAAMm0D,GAGhB,IAAK,IAAIr0D,EAAI,EAAGA,EAAIq0D,EAAGr0D,IAAK,CAI1B,IAHA,IAAIugJ,EAAQ,EACRr7F,EAAOta,EAAE,GAEJnc,EAAI,EAAGA,EAAImc,EAAE7qC,OAAQ0uB,IACxBmc,EAAEnc,GAAKy2B,IAETA,EAAOta,EADP21G,EAAQ9xH,IAKZ4xH,EAAGrgJ,GAAK4qC,EAAE2lC,OAAOgwE,EAAO,GAAG,GAE3B,IAAK,IAAIC,EAAM,EAAGA,EAAMnsF,EAAGmsF,IACzBF,EAAGE,GAAKxgJ,GAAKu2I,EAAEiK,GAAKD,GAEpBhK,EAAEiK,GAAKjwE,OAAOgwE,EAAO,GAIzB,MAAO,EAAC,SAAMF,IAAK,SAAMC,IAU3B,SAAS5B,EAAY13H,EAAM5kB,GAIzB,IAFA,IAAIs8D,EAAQ,IAAIx+D,MAAM8mB,GAEbhnB,EAAI,EAAGA,EAAIgnB,EAAMhnB,IACxB0+D,EAAM1+D,GAAKoC,EAGb,OAAOs8D,MCxaP,GAAe,CAAC,QAAS,SAAU,MAAO,MAAO,YAAa,SAAU,WAAY,iBAAkB,eAAgB,WAAY,UAAW,eACtI+hF,IAAiC,QAFjC,YAE+C,IAAe3tF,IACvE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,IACN3gD,EAAG,IACHmP,EAAG,UACH+mF,EAAS,OACTh2F,EAAM,SACNsB,EAAQ,eACRw0F,EAAc,aACdG,EAAY,SACZ73C,EAAQ,QACR+uB,EAAO,YACP0oB,GACE1zC,EA6BJ,OAAO+1B,EAAM,YAAa,CACxB,sBAAuB,SAAyB1/E,EAAGC,EAAGs3I,GACpD,IAAKpgB,EAAIn3H,GACP,MAAM,IAAI1I,UAAU,kEAGtB,IAAK6/H,EAAIl3H,GACP,MAAM,IAAI3I,UAAU,mEAGtB,IAqEJ,SAAa0I,GACX,OAAoB,IAAbA,EAAEpJ,QAAgB4gJ,EAAWx3I,EAAE,KAAOw3I,EAAWx3I,EAAE,KAAOw3I,EAAWx3I,EAAE,KAAOw3I,EAAWx3I,EAAE,IAtE3Fy3I,CAAIF,GACP,MAAM,IAAIjgJ,UAAU,mDAGtB,OA2HJ,SAA6BgM,EAAIC,EAAIm0I,EAAIl0I,EAAIC,EAAIk0I,EAAI33I,EAAGC,EAAG0/B,EAAGn6B,GAC5D,IAAIoyI,EAAMt6C,EAAeh6F,EAAItD,GACzB63I,EAAMv6C,EAAe95F,EAAIxD,GACzB83I,EAAMx6C,EAAe/5F,EAAItD,GACzB83I,EAAMz6C,EAAe75F,EAAIxD,GACzB+3I,EAAM16C,EAAeo6C,EAAI/3G,GACzBs4G,EAAM36C,EAAeq6C,EAAIh4G,GACzB14B,EAAIw2F,EAAa73C,EAASA,EAASA,EAASpgD,EAAGoyI,GAAME,GAAME,GAAMpyF,EAASA,EAASA,EAAS43C,EAAUA,EAAUq6C,EAAKE,GAAME,GAAML,GAAME,GAAME,IAIjJ,MAAO,CAHEx6C,EAAUl6F,EAAIg6F,EAAer2F,EAAG2+C,EAASpiD,EAAIF,KAC7Ck6F,EAAUj6F,EAAI+5F,EAAer2F,EAAG2+C,EAASniD,EAAIF,KAC7Ci6F,EAAUk6C,EAAIp6C,EAAer2F,EAAG2+C,EAAS+xF,EAAID,MArI7CQ,CAAoBl4I,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIs3I,EAAM,GAAIA,EAAM,GAAIA,EAAM,GAAIA,EAAM,KAErG,6BAA8B,SAA8Br3I,EAAGF,EAAGC,EAAG0/B,GACnE,GAAiB,IAAbz/B,EAAEtJ,OAAc,CAClB,IAAK6/H,EAAIv2H,GACP,MAAM,IAAI5I,UAAU,kEAGtB,IAAKm/H,EAAIz2H,GACP,MAAM,IAAI1I,UAAU,mEAGtB,IAAKm/H,EAAIx2H,GACP,MAAM,IAAI3I,UAAU,kEAGtB,IAAKm/H,EAAI92F,GACP,MAAM,IAAIroC,UAAU,mEAGtB,OAiDN,SAAsB6gJ,EAAKC,EAAKC,EAAKC,GACnC,IAAIC,EAAKJ,EACLK,EAAKH,EACLtxI,EAAK6+C,EAAS2yF,EAAIH,GAClBpxI,EAAK4+C,EAAS4yF,EAAIF,GAClBliE,EAAMxwB,EAAS03C,EAAev2F,EAAG,GAAIC,EAAG,IAAKs2F,EAAet2F,EAAG,GAAID,EAAG,KAE1E,GAAI4tE,EAAQrtE,EAAI8uE,GAAMnuB,EAAO4kB,SAC3B,OAAO,KAGT,IAAI4rE,EAASn7C,EAAet2F,EAAG,GAAIuxI,EAAG,IAClCG,EAASp7C,EAAet2F,EAAG,GAAIuxI,EAAG,IAClCI,EAASr7C,EAAet2F,EAAG,GAAIwxI,EAAG,IAClCI,EAASt7C,EAAet2F,EAAG,GAAIwxI,EAAG,IAClCvxI,EAAIw2F,EAAaD,EAAU53C,EAASA,EAAS6yF,EAAQC,GAASC,GAASC,GAASxiE,GACpF,OAAO3/D,EAAI3N,EAAS/B,EAAIE,GAAIsxI,GAjEjBM,CAAa34I,EAAGF,EAAGC,EAAG0/B,GACxB,GAAiB,IAAbz/B,EAAEtJ,OAAc,CACzB,IAAKugI,EAAIj3H,GACP,MAAM,IAAI5I,UAAU,kEAGtB,IAAK6/H,EAAIn3H,GACP,MAAM,IAAI1I,UAAU,mEAGtB,IAAK6/H,EAAIl3H,GACP,MAAM,IAAI3I,UAAU,kEAGtB,IAAK6/H,EAAIx3F,GACP,MAAM,IAAIroC,UAAU,mEAGtB,OA0DgBgM,EA1DIpD,EAAE,GA0DFqD,EA1DMrD,EAAE,GA0DJw3I,EA1DQx3I,EAAE,GA0DNsD,EA1DUxD,EAAE,GA0DRyD,EA1DYzD,EAAE,GA0DV23I,EA1Dc33I,EAAE,GA0DZ84I,EA1DgB74I,EAAE,GA0Dd84I,EA1DkB94I,EAAE,GA0DhB+4I,EA1DoB/4I,EAAE,GA2DtEg5I,EAAQC,EAAmB51I,EAAIw1I,EADqBK,EA1DsBx5G,EAAE,GA2DrCm5G,EAAIv1I,EAAIw1I,EADSK,EA1DwBz5G,EAAE,GA2D3Bo5G,EAAIrB,EAAIsB,EADHK,EA1D0B15G,EAAE,GA2DjBq5G,GAEvEM,EAAQJ,EAAmBC,EAAIL,EAAIt1I,EAAIF,EAAI81I,EAAIL,EAAIt1I,EAAIF,EAAI81I,EAAIL,EAAIrB,EAAID,GAEvE6B,EAAQL,EAAmB51I,EAAIw1I,EAAIt1I,EAAIF,EAAIC,EAAIw1I,EAAIt1I,EAAIF,EAAIm0I,EAAIsB,EAAIrB,EAAID,GAEvE8B,EAAQN,EAAmBC,EAAIL,EAAIK,EAAIL,EAAIM,EAAIL,EAAIK,EAAIL,EAAIM,EAAIL,EAAIK,EAAIL,GAEvES,EAAQP,EAAmB11I,EAAIF,EAAIE,EAAIF,EAAIG,EAAIF,EAAIE,EAAIF,EAAIo0I,EAAID,EAAIC,EAAID,GAEvEgC,EAAKj8C,EAAa73C,EAAS03C,EAAe27C,EAAOK,GAAQh8C,EAAei8C,EAAOC,IAAS5zF,EAAS03C,EAAem8C,EAAOD,GAAQl8C,EAAeg8C,EAAOA,KACrJK,EAAKl8C,EAAaD,EAAUy7C,EAAO37C,EAAeo8C,EAAIJ,IAASE,GAC/DI,EAAMp8C,EAAUl6F,EAAIg6F,EAAeo8C,EAAI9zF,EAASpiD,EAAIF,KACpDu2I,EAAMr8C,EAAUj6F,EAAI+5F,EAAeo8C,EAAI9zF,EAASniD,EAAIF,KACpDu2I,EAAMt8C,EAAUk6C,EAAIp6C,EAAeo8C,EAAI9zF,EAAS+xF,EAAID,KACpDqC,EAAMv8C,EAAUs7C,EAAIx7C,EAAeq8C,EAAI/zF,EAASuzF,EAAIL,KACpDkB,EAAMx8C,EAAUu7C,EAAIz7C,EAAeq8C,EAAI/zF,EAASwzF,EAAIL,KACpDkB,EAAMz8C,EAAUw7C,EAAI17C,EAAeq8C,EAAI/zF,EAASyzF,EAAIL,KAEpD37C,EAAYu8C,EAAKG,IAAQ18C,EAAYw8C,EAAKG,IAAQ38C,EAAYy8C,EAAKG,GAC9D,CAACL,EAAKC,EAAKC,GAEX,KA/EL,MAAM,IAAIxiJ,UAAU,uDAwD1B,IAAsBgM,EAAIC,EAAIm0I,EAAIl0I,EAAIC,EAAIk0I,EAAImB,EAAIC,EAAIC,EAAIG,EAAIC,EAAIC,EAC5DJ,EAEAK,EAEAC,EAEAC,EAEAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAvEJ,yBAA0B,SAA4Bj6I,EAAGC,EAAGs3I,GAC1D,OAAO/vI,EAAOrL,KAAK6D,EAAEslD,UAAWrlD,EAAEqlD,UAAWiyF,EAAMjyF,aAErD,iCAAkC,SAAkCplD,EAAGF,EAAGC,EAAG0/B,GAE3E,OAAOn4B,EAAOrL,KAAK+D,EAAEolD,UAAWtlD,EAAEslD,UAAWrlD,EAAEqlD,UAAW3lB,EAAE2lB,eAIhE,SAASkyF,EAAWlyI,GAElB,MAAoB,iBAANA,IAAkB,EAAA2oE,EAAA,IAAY3oE,GAG9C,SAASmxH,EAAIz2H,GACX,OAAoB,IAAbA,EAAEpJ,QAAgB4gJ,EAAWx3I,EAAE,KAAOw3I,EAAWx3I,EAAE,IAG5D,SAASm3H,EAAIn3H,GACX,OAAoB,IAAbA,EAAEpJ,QAAgB4gJ,EAAWx3I,EAAE,KAAOw3I,EAAWx3I,EAAE,KAAOw3I,EAAWx3I,EAAE,IA0BhF,SAASk5I,EAAmB5zI,EAAGC,EAAGC,EAAGC,EAAGzI,EAAG0I,EAAG/H,EAAGwC,EAAGtJ,EAAGyuB,EAAGyf,EAAGiF,GAE3D,IAAIkwG,EAAO58C,EAAe13C,EAAStgD,EAAGC,GAAIqgD,EAASpgD,EAAGC,IAClD00I,EAAO78C,EAAe13C,EAAS5oD,EAAG0I,GAAIkgD,EAASjoD,EAAGwC,IAClDi6I,EAAO98C,EAAe13C,EAAS/uD,EAAGyuB,GAAIsgC,EAAS7gB,EAAGiF,IACtD,OAAOwzD,EAAUA,EAAU08C,EAAMC,GAAOC,OCxJxC,GAAO,SACP,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,eACzFC,IAA8B,QAAQ,GAAM,IAAe1wF,IACpE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,aACNi2F,EAAY,eACZH,EAAc,SACd13C,EAAQ,YACRy3C,EAAW,YACXM,GACEh0C,EACA2jE,EAAkBL,GAAsB,CAC1CtvB,gBA2BF,OAAOje,EAAM,GAAM,CACjB,+BAAgC,SAAiC15E,EAAGT,GAClE,OA4DJ,SAAqCS,EAAGT,GAYtC,IATA,IAAI20G,GADJ30G,EAAI+nH,EAAgBtnH,EAAGT,GAAG,IACZ2/F,MACVtd,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAClBzsE,EAAS1yB,EAAEgvG,QACX/5E,EAAQj1B,EAAEivG,OACVI,EAAMrvG,EAAEkvG,KAERl1G,EAAI,GAECslB,EAAI0hF,EAAU,EAAG1hF,GAAK,EAAGA,IAAK,CACrC,IAAIioG,EAAKrT,EAAM50F,GAAG,IAAM,EAExB,GAAK+3E,EAAYkwB,EAAI,GAqCnBvtH,EAAEslB,GAAK,CAAC,OArCe,CAUvB,IARA,IAAIkoG,EAAM,EAENC,EAAU,GACVC,EAAW,GAEX3+E,EAAasmE,EAAI/vF,GAGZyf,EAFOswE,EAAI/vF,EAAI,GAEC,EAAGyf,GAAKgK,EAAYhK,IAAK,CAChD,IAAIluC,EAAIokC,EAAM8J,GAEVluC,IAAMyuB,EACRkoG,EAAM90F,EAAOqM,GACJluC,EAAIyuB,IAEbmoG,EAAQ9yH,KAAK+9B,EAAOqM,IACpB2oF,EAAS/yH,KAAK9D,IAKlB,GAAIwmG,EAAYmwB,EAAK,GACnB,MAAM,IAAIlwF,MAAM,2DAKlB,IAFA,IAAIqwF,EAAKlwB,EAAa8vB,EAAIC,GAEjBpW,EAAK,EAAGsX,EAAahB,EAAS92H,OAAQwgH,EAAKsX,EAAYtX,IAAM,CACpE,IAAI58G,EAAKkzH,EAAStW,GAClB8C,EAAM1/G,GAAM,CAACorD,EAASs0D,EAAM1/G,GAAI,GAAI8iG,EAAeqwB,EAAIF,EAAQrW,MAGjEp3G,EAAEslB,GAAK,CAACqoG,IAOZ,OAAO,IAAIhwB,EAAY,CACrBzgG,KAAM8C,EACN6d,KAAM,CAAC+pE,EAAM,KAtHNwxC,CAA4BpzH,EAAGT,IAExC,8BAA+B,SAAgCS,EAAGT,GAChE,OAAO8zH,EAA2BrzH,EAAGT,IAEvC,wBAAyB,SAA0BD,EAAGC,GAKpD,OAFQ8zH,EAFA7xH,EAAOlC,GAEuBC,GAE7B+/C,aAIb,SAAS+zE,EAA2BrzH,EAAGT,GAUrC,IAPA,IAAI20G,GADJ30G,EAAI+nH,EAAgBtnH,EAAGT,GAAG,IACZ2/F,MACVtd,EAAO5hF,EAAEm/F,MAAM,GACf6B,EAAUhhG,EAAEm/F,MAAM,GAElBnlG,EAAI,GACJ8tH,EAAQ9nH,EAAEk/F,MAEL5/E,EAAI0hF,EAAU,EAAG1hF,GAAK,EAAGA,IAAK,CAErC,IAAIioG,EAAKrT,EAAM50F,GAAG,IAAM,EAEpBqoG,OAAK,EAET,GAAKtwB,EAAYkwB,EAAI,GAiBnBI,EAAK,MAjBkB,CAEvB,IAAIH,EAAMM,EAAMxoG,GAAGA,GAEnB,GAAI+3E,EAAYmwB,EAAK,GAEnB,MAAM,IAAIlwF,MAAM,2DAGlBqwF,EAAKlwB,EAAa8vB,EAAIC,GAEtB,IAAK,IAAI32H,EAAIyuB,EAAI,EAAGzuB,GAAK,EAAGA,IAE1BqjH,EAAMrjH,GAAK,CAAC+uD,EAASs0D,EAAMrjH,GAAG,IAAM,EAAGymG,EAAeqwB,EAAIG,EAAMj3H,GAAGyuB,MAQvEtlB,EAAEslB,GAAK,CAACqoG,GAGV,OAAO,IAAIhwB,EAAY,CACrBzgG,KAAM8C,EACN6d,KAAM,CAAC+pE,EAAM,SCnGf,GAAO,OACP,GAAe,CAAC,QAAS,MAAO,MAAO,MAAO,OAAQ,OAAQ,WAAY,cAAe,SAAU,UAAW,SAAU,aAAc,QAC/H0yD,IAA4B,QAAQ,GAAM,IAAe3wF,IAClE,IAAI,MACF+1B,EAAK,IACLp4E,EAAG,IACHmP,EAAG,IACH1H,EAAG,KACHmnE,EAAI,KACJhwE,EAAI,SACJ4C,EAAQ,YACRu0F,EAAW,OACXzoB,EAAM,QACND,EAAO,OACPntE,EAAM,WACNosE,EAAU,KACVob,GACErlC,EAwCJ,OAAO+1B,EAAM,GAAM,CACjB/W,OAAQ/mE,KAAK0F,IACbo4B,QAAS,SAAiB1/B,GACxB,OAAOA,EAAEsH,OAEXksF,UAAW,SAAmBxzF,GAE5B,OAAOA,EAAEsH,OAEX6iF,QAAS,SAAiBnqF,GAExB,OAAO4B,KAAK0F,IAAItH,IAElBjJ,MAAO,SAAeiJ,GACpB,OAAOu6I,EAAM/yI,EAAOxH,GAAI,IAE1B09F,OAAQ,SAAgB19F,GACtB,OAAOu6I,EAAMv6I,EAAG,IAElB,sEAAuE,SAA4DA,GAEjI,OAAO7D,KAAK6D,IAEd,qCAAsC,SAAoCA,EAAGnG,GAC3E,OAAO0gJ,EAAM/yI,EAAOxH,GAAInG,IAE1B,sCAAuC,SAAqCmG,EAAGnG,GAC7E,OAAO0gJ,EAAMv6I,EAAGnG,MAsNpB,SAAS0gJ,EAAMv6I,EAAGnG,GAEhB,IAAI2gJ,EAAQx6I,EAAE6d,OAEd,GAAqB,IAAjB28H,EAAM5jJ,OACR,OAtKJ,SAAqBoJ,EAAGnG,GAEtB,GAAIA,IAAMiI,OAAOuoC,mBAA2B,QAANxwC,EACpC,OA9CJ,SAAiCmG,GAE/B,IAAIy6I,EAAO,EASX,OAPAz6I,EAAElC,SAAQ,SAAU7E,GAClB,IAAI8E,EAAIuJ,EAAIrO,GAER27E,EAAO72E,EAAG08I,KACZA,EAAO18I,MAER,GACI08I,EAmCEC,CAAwB16I,GAGjC,GAAInG,IAAMiI,OAAO00C,mBAA2B,SAAN38C,EACpC,OA7BJ,SAAkCmG,GAEhC,IAAI26I,EASJ,OAPA36I,EAAElC,SAAQ,SAAU7E,GAClB,IAAI8E,EAAIuJ,EAAIrO,GAEP0hJ,IAAQhmE,EAAQ52E,EAAG48I,KACtBA,EAAO58I,MAER,GACI48I,GAAQ,EAkBNC,CAAyB56I,GAGlC,GAAU,QAANnG,EACF,OAAO0gJ,EAAMv6I,EAAG,GAGlB,GAAiB,iBAANnG,IAAmBoJ,MAAMpJ,GAAI,CAEtC,IAAKwjG,EAAYxjG,EAAG,GAAI,CAEtB,IAAI+B,EAAI,EAKR,OAHAoE,EAAElC,SAAQ,SAAU7E,GAClB2C,EAAI6a,EAAI1H,EAAIzH,EAAIrO,GAAQY,GAAI+B,MAC3B,GACImT,EAAInT,EAAG,EAAI/B,GAGpB,OAAOiI,OAAOuoC,kBAIhB,MAAM,IAAI/M,MAAM,+BAwIPu9G,CAAY76I,EAAGnG,GAIxB,GAAqB,IAAjB2gJ,EAAM5jJ,OAAc,CACtB,GAAI4jJ,EAAM,IAAMA,EAAM,GACpB,OAzCN,SAAqBx6I,EAAGnG,GAEtB,GAAU,IAANA,EACF,OA9EJ,SAAwBmG,GAEtB,IAAIwF,EAAI,GAEJs1I,EAAO,EAYX,OAVA96I,EAAElC,SAAQ,SAAU7E,EAAOgiC,GACzB,IAAI3V,EAAI2V,EAAM,GACV8/G,EAAKtkI,EAAIjR,EAAE8f,IAAM,EAAGhe,EAAIrO,IAExB27E,EAAOmmE,EAAID,KACbA,EAAOC,GAGTv1I,EAAE8f,GAAKy1H,KACN,GACID,EA8DEE,CAAeh7I,GAGxB,GAAInG,IAAMiI,OAAOuoC,mBAA2B,QAANxwC,EACpC,OAlCJ,SAA6BmG,GAE3B,IAAI2I,EAAI,GAEJsyI,EAAO,EAYX,OAVAj7I,EAAElC,SAAQ,SAAU7E,EAAOgiC,GACzB,IAAIpkC,EAAIokC,EAAM,GACVigH,EAAKzkI,EAAI9N,EAAE9R,IAAM,EAAGyQ,EAAIrO,IAExB27E,EAAOsmE,EAAID,KACbA,EAAOC,GAGTvyI,EAAE9R,GAAKqkJ,KACN,GACID,EAkBEE,CAAoBn7I,GAG7B,GAAU,QAANnG,EACF,OAtGJ,SAA8BmG,GAE5B,IAAIo7I,EAAM,EAIV,OAHAp7I,EAAElC,SAAQ,SAAU7E,EAAOgiC,GACzBmgH,EAAM3kI,EAAI2kI,EAAKtyI,EAAS7P,EAAOi9E,EAAKj9E,QAE/BqO,EAAIpB,EAAKk1I,IAgGPC,CAAqBr7I,GAG9B,GAAU,IAANnG,EACF,OAhEJ,SAAwBmG,GAEtB,IAAIw6I,EAAQx6I,EAAE6d,OAEd,GAAI28H,EAAM,KAAOA,EAAM,GACrB,MAAM,IAAIthC,WAAW,6BAGvB,IAAI3uG,EAAKqpE,EAAW5zE,GAChBs7I,EAAWxyI,EAASyB,EAAIvK,GACxBu7I,EAAYvsD,EAAKssD,GAAU5iH,OAC3By5C,EAAMopE,EAAU9iJ,IAAI,CAAC8iJ,EAAU19H,OAAO,GAAK,IAC/C,OAAOvW,EAAIpB,EAAKisE,IAoDPqpE,CAAex7I,GAIxB,MAAM,IAAIs9B,MAAM,+BAAiCzjC,GAsBtC4hJ,CAAYz7I,EAAGnG,GAEtB,MAAM,IAAIq/G,WAAW,kCChTtB,SAASwiC,GAAQ7hJ,EAAG0L,GAEzB,IAAIw/B,EACAnpC,EAAI2J,EAAE3O,OACNoJ,EAAI,GAER,GAAInG,EAEF,IAAKkrC,EAAI,EAAGA,EAAInpC,EAAGmpC,IAEjB/kC,EAAEnG,EAAEkrC,IAAMx/B,EAAEw/B,QAId,IAAKA,EAAI,EAAGA,EAAInpC,EAAGmpC,IAEjB/kC,EAAE+kC,GAAKx/B,EAAEw/B,GAIb,OAAO/kC,ECxBT,IAAI,GAAO,UACP,GAAe,CAAC,QAAS,SAAU,MAAO,MAAO,SAAU,SAAU,eAC9D27I,IAA+B,QAAQ,GAAM,IAAehyF,IACrE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,IACNymF,EAAG,IACHG,EAAG,OACHC,EAAM,OACNN,EAAM,YACN4P,GACEh0C,EACA2jE,EAAkBL,GAAsB,CAC1CtvB,gBAoCF,OAAOje,EAAM,GAAM,CACjB,wBAAyB,SAA0Bp6E,EAAGC,GACpDD,EAAIkC,EAAOlC,GACX,IAAIG,EAAIwoF,EAAI3oF,GAIZ,OAFQs2I,EAASn2I,EAAEwoH,EAAGxoH,EAAE6qH,EAAG7qH,EAAE5L,EAAG,KAAM0L,GAE7B+/C,WAEX,8BAA+B,SAAgChgD,EAAGC,GAChE,IAAIE,EAAIwoF,EAAI3oF,GACZ,OAAOs2I,EAASn2I,EAAEwoH,EAAGxoH,EAAE6qH,EAAG7qH,EAAE5L,EAAG,KAAM0L,IAEvC,+BAAgC,SAAiCD,EAAGC,GAClE,IAAIE,EAAIwoF,EAAI3oF,GACZ,OAAOs2I,EAASn2I,EAAEwoH,EAAGxoH,EAAE6qH,EAAG7qH,EAAE5L,EAAG,KAAM0L,IAEvC,+CAAgD,SAA6CD,EAAGC,EAAGiiC,EAAO2uF,GACxG,IAAI1wH,EAAI2oF,EAAI9oF,EAAGkiC,EAAO2uF,GACtB,OAAOylB,EAASn2I,EAAEwoH,EAAGxoH,EAAE6qH,EAAG7qH,EAAE5L,EAAG4L,EAAE09C,EAAG59C,IAEtC,yBAA0B,SAA2BE,EAAGF,GACtD,OAAOq2I,EAASn2I,EAAEwoH,EAAGxoH,EAAE6qH,EAAG7qH,EAAE5L,EAAG4L,EAAE09C,EAAG59C,MAIxC,SAASs2I,EAAUv2I,GACjB,IAAI,EAAA2oE,EAAA,IAAS3oE,GACX,OAAOA,EAGT,IAAI,EAAA2oE,EAAA,IAAQ3oE,GACV,OAAOkC,EAAOlC,GAGhB,MAAM,IAAIhO,UAAU,mCAGtB,SAASskJ,EAAS5xG,EAAG/jB,EAAGpsB,EAAGspD,EAAG59C,GAE5BykC,EAAI6xG,EAAU7xG,GACd/jB,EAAI41H,EAAU51H,GAEVpsB,KACF0L,EAAI+nH,EAAgBtjF,EAAGzkC,GAAG,IACxB2/F,MAAQw2C,GAAQ7hJ,EAAG0L,EAAE2/F,QAIzB,IAAIjlG,EAAI8tF,EAAO/jD,EAAGzkC,GAEdvF,EAAIquF,EAAOpoE,EAAGhmB,GAMlB,OAJIkjD,IACFnjD,EAAEklG,MAAQw2C,GAAQv4F,EAAGnjD,EAAEklG,QAGlBllG,MC1GP,GAAO,QACP,GAAe,CAAC,QAAS,MAAO,MAAO,WAAY,OAAQ,WAAY,MAAO,OAAQ,MAAO,YACtF87I,IAA6B,QAAQ,GAAM,IAAenyF,IACnE,IAAI,MACF+1B,EAAK,IACLp4E,EAAG,IACHmP,EAAG,SACH3N,EAAQ,KACR5C,EAAI,SACJ0/C,EAAQ,IACR2wB,EAAG,KACH14D,EAAI,IACJgH,EAAG,SACHk4C,GACEpT,EAEAoyF,EAAa,KAWjB,SAASC,EAAelxF,GACtB,IAAIh6C,EACAmrI,EAAa,EACbhb,EAAIn2E,EACJk2E,EAAIjkE,EAASl/C,EAAKitC,IAEtB,EAAG,CACD,IAAIoxF,EAAKjb,EAKT,GAJAA,EAAIn4H,EAAS,GAAK2N,EAAIylI,EAAI3lE,EAAIyqD,KAC9BA,EAAIl4H,EAAS,GAAK2N,EAAIuqH,EAAGzqD,EAAI2lE,MAC7BprI,EAAQ+T,EAAIvd,EAAIs+C,EAASq7E,EAAGib,MAEhBH,KAAgBE,EAxBX,IAyBf,MAAM,IAAI3+G,MAAM,8EAEXxsB,EAAQirI,GAEjB,OAAO9a,EAyBT,OAAOvhD,EAAM,GAAM,CACjB,iBAAkB,SAAqB50B,GACrC,IAAIjtC,GAAO,EAAAowD,EAAA,IAASnjB,GAAKA,EAAEjtC,QAAS,SAAUitC,GAE9C,OAAQjtC,EAAKjnB,QACX,KAAK,EAEH,GAAgB,IAAZinB,EAAK,GACP,OAAO3X,EAAK4kD,GAEZ,MAAM,IAAIouD,WAAW,iCAAuC,SAAOr7F,GAAQ,KAG/E,KAAK,EAMD,GAHWA,EAAK,KACLA,EAAK,GAGd,OAAOm+H,EAAelxF,GAEtB,MAAM,IAAIouD,WAAW,iCAAuC,SAAOr7F,GAAQ,KAIjF,QAEE,MAAM,IAAIq7F,WAAW,kDAAwD,SAAOr7F,GAAQ,YCnGlG,GAAO,cACP,GAAe,CAAC,QAAS,MAAO,SAAU,WAAY,YAAa,YAAa,cACzEs+H,IAAmC,QAAQ,GAAM,IAAexyF,IACzE,IAAI,MACF+1B,EAAK,IACLjpE,EAAG,OACHipC,EAAM,SACN52C,EAAQ,UACR+qE,EAAS,UACTjjE,EAAS,WACTsxC,GACEyH,EAuBJ,OAAO+1B,EAAM,GAAM,CACjB,iBAAkB,SAAqBp6E,GACrC,IAAI8oC,EAAM,EACNunG,EAAQ,EASZ,OARA,SAAYrwI,GAAG,SAAU82I,GACvB,IAAKxrI,EAAUwrI,KAAQl6F,EAAWk6F,GAChC,MAAM,IAAI9kJ,UAAU,2DAGtB82C,EAAM33B,EAAI23B,EAAKguG,GACfzG,EAAQ7sI,EAAS6sI,EAAO9hE,EAAUuoE,OAE7B18F,EAAOm0B,EAAUzlC,GAAMunG,SC9ChC,GAAO,iBACP,GAAe,CAAC,QAAS,SAAU,iBAAkB,YAAa,aAAc,OAAQ,SAAU,YAAa,cAAe,eAAgB,MAAO,OAC9I0G,IAAsC,QAAQ,GAAM,IAAe1yF,IAC5E,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,eACNq1C,EAAc,UACdE,EAAS,WACTxpB,EAAU,KACV2B,EAAI,UACJ6d,EAAS,OACThsF,EAAM,YACNm2F,EAAW,aACXC,EAAY,IACZn+D,EAAG,IACHG,GACE+pB,EAkCJ,OAAO+1B,EAAM,GAAM,CACjB,GAAI,WACF,MAAyB,WAAlBz3B,EAAOzgD,OAAsBA,EAAO,IAAM,IAEnDo4D,OAAQ,SAAgBoxB,GACtB,OAAOxpF,EAAOwpF,IAEhB,sCAAuC,SAAoC/f,GACzE,OAAOqrE,EAAmBrrE,EAAyB,WAAlBhpB,EAAOzgD,OAAsB,aAAUlN,IAE1E,8CAA+C,SAA0C22E,EAAO+f,GAC9F,OAAOsrD,EAAmBrrE,EAAO+f,IAEnC,6CAA8C,SAAyC/f,EAAOlzE,GAC5F,IAAIw+I,EAAU/0I,EAAOzJ,GAIrB,OAFAy+I,EAAgBD,GAETE,EAAmBxrE,EAAOsrE,OAASjiJ,IAE5C,8CAA+C,SAA0C22E,EAAOlzE,GAC9Fy+I,EAAgBz+I,GAEhB,IAAI2+I,EAAc3+I,EAAEsjG,YAAgC,WAAlBp5C,EAAOzgD,OAAsB,aAAUlN,GACzE,OAAOmiJ,EAAmBxrE,EAAOlzE,EAAG2+I,IAEtC,qDAAsD,SAA+CzrE,EAAOlzE,EAAGizF,GAC7G,IAAIurD,EAAU/0I,EAAOzJ,GAIrB,OAFAy+I,EAAgBD,GAETE,EAAmBxrE,EAAOsrE,EAASvrD,IAE5C,sDAAuD,SAAgD/f,EAAOlzE,EAAGizF,GAG/G,OAFAwrD,EAAgBz+I,GAET0+I,EAAmBxrE,EAAOlzE,EAAGizF,MAYxC,SAASsrD,EAAmBrrE,EAAO+f,GACjC,IACI2rD,GADM,EAAA1uE,EAAA,IAAYgD,GACD,IAAIuiB,GAAW,IAAM,EACtCopD,EAAWn9G,EAAIwxC,GACf4rE,EAAWj9G,EAAIqxC,GAEnB,OAAO6rE,EADI,CAAC,CAACF,EAAUt/C,EAAeq/C,EAAUE,IAAY,CAACA,EAAUD,IACzC5rD,GAGhC,SAASwrD,EAAgBz+I,GACvB,IAAI8f,EAAO9f,EAAE8f,OAEb,GAAIA,EAAKjnB,OAAS,GAAiB,IAAZinB,EAAK,GAC1B,MAAM,IAAIq7F,WAAW,oCAIzB,SAAS6jC,EAAKxnF,GACZ,OAAOA,EAAM/6B,QAAO,CAAC3gC,EAAG2pC,IAAS85D,EAAezjG,EAAG2pC,KAGrD,SAASs5G,EAAiB5/I,EAAM8zF,GAC9B,GAAIA,EAAQ,CACV,GAAe,WAAXA,EACF,OAAO,IAAI4M,EAAa1gG,GAG1B,GAAe,UAAX8zF,EACF,OAAO,IAAI2M,EAAYzgG,GAGzB,MAAM,IAAI5F,UAAU,wBAAyB+mC,OAAO2yD,EAAQ,MAG9D,OAAO9zF,EAaT,SAASu/I,EAAmBxrE,EAAOlzE,EAAGizF,GACpC,IAAIgsD,EAAQrnE,EAAK53E,GAEjB,GAAc,IAAVi/I,EACF,MAAM,IAAI9jC,WAAW,+BAGvB,IAAIkD,GAAM,EAAAnuC,EAAA,IAAYgD,GAASuiB,EAAY,KACvChzC,EAAM47D,EAAM,IAAIA,EAAI,GAAK,EACzBugC,EAAWvgC,EAAM,IAAIA,GAAK,IAAM,EAChCzE,EAAKyE,EAAM,IAAIA,EAAIr+G,EAAEtF,IAAI,CAAC,IAAMukJ,GAASj/I,EAAEtF,IAAI,CAAC,IAAMukJ,EACtDplC,EAAKwE,EAAM,IAAIA,EAAIr+G,EAAEtF,IAAI,CAAC,IAAMukJ,GAASj/I,EAAEtF,IAAI,CAAC,IAAMukJ,EACtDC,EAAK7gC,EAAM,IAAIA,EAAIr+G,EAAEtF,IAAI,CAAC,IAAMukJ,GAASj/I,EAAEtF,IAAI,CAAC,IAAMukJ,EACtDx3I,EAAIi6B,EAAIwxC,GACRisE,EAAY1/C,EAAUh9C,EAAKwzB,EAAWxuE,IACtCsK,EAAI8vB,EAAIqxC,GAWZ,OAAO6rE,EADI,CAAC,CATFt/C,EAAUh4F,EAAGu3I,EAAK,CAACplC,EAAIA,EAAIulC,KAC3B1/C,EAAUu/C,EAAK,CAACplC,EAAIC,EAAIslC,IAAaH,EAAK,CAACJ,EAAUM,EAAIntI,KACzD0tF,EAAUu/C,EAAK,CAACplC,EAAIslC,EAAIC,IAAaH,EAAK,CAACnlC,EAAI9nG,MAO5B,CANnB0tF,EAAUu/C,EAAK,CAACplC,EAAIC,EAAIslC,IAAaH,EAAK,CAACE,EAAIntI,KAC/C0tF,EAAUh4F,EAAGu3I,EAAK,CAACnlC,EAAIA,EAAIslC,KAC3B1/C,EAAUu/C,EAAK,CAACnlC,EAAIqlC,EAAIC,IAAaH,EAAK,CAACJ,EAAUhlC,EAAI7nG,MAIrB,CAHpC0tF,EAAUu/C,EAAK,CAACplC,EAAIslC,EAAIC,IAAaH,EAAK,CAACJ,EAAU/kC,EAAI9nG,KACzD0tF,EAAUu/C,EAAK,CAACnlC,EAAIqlC,EAAIC,IAAaH,EAAK,CAACplC,EAAI7nG,KAC/C0tF,EAAUh4F,EAAGu3I,EAAK,CAACE,EAAIA,EAAIC,OAEPlsD,OCzK9B,GAAO,SACP,GAAe,CAAC,QAAS,MAAO,SAAU,UAAW,mBAC9CmsD,IAA8B,QAAQ,GAAM,IAAexzF,IACpE,IAAI,MACF+1B,EAAK,IACLjpE,EAAG,OACHipC,EAAM,QACN+F,EAAO,gBACP0pC,GACExlC,EAQJ,SAASyzF,EAAQ7nF,GACf,IAEE,IAAI5S,GADJ4S,GAAQ,SAAQA,EAAMjQ,YACN1uD,OAEhB,GAAY,IAAR+rD,EACF,MAAM,IAAIrlB,MAAM,6CAGlB,GAAIqlB,EAAM,GAAM,EAAG,CAOjB,IALA,IAAI06F,EAAM16F,EAAM,EAAI,EAChB7rC,EAAQq4E,EAAgB55B,EAAO8nF,EAAM,GAErC3uI,EAAO6mD,EAAM8nF,GAERxmJ,EAAI,EAAGA,EAAIwmJ,IAAOxmJ,EACrB4uD,EAAQ8P,EAAM1+D,GAAI6X,GAAQ,IAC5BA,EAAO6mD,EAAM1+D,IAIjB,OAAOymJ,EAAQ5uI,EAAMoI,GAGrB,IAAI9Q,EAAImpF,EAAgB55B,GAAQ5S,EAAM,GAAK,GAC3C,OAAO46F,EAAOv3I,GAEhB,MAAOpL,GACP,MAAM,EAAAoxH,GAAA,GAAoBpxH,EAAK,WAKnC,IAAI2iJ,EAAS79D,EAAM,CACjB,sCAAuC,SAAoCzmF,GACzE,OAAOA,KAIPqkJ,EAAU59D,EAAM,CAClB,2EAA4E,SAA8DhxE,EAAMoI,GAC9I,OAAO4oC,EAAOjpC,EAAI/H,EAAMoI,GAAQ,MA8BpC,OAAO4oE,EAAM,GAAM,CAEjB,iBAAkB09D,EAElB,qCAAsC,SAAoC7nF,EAAO4lC,GAE/E,MAAM,IAAI79D,MAAM,wCAGlB,MAAO,SAAW9E,GAChB,IAAI,SAAoBA,GACtB,MAAM,IAAIlhC,UAAU,6CAGtB,OAAO8lJ,EAAQ5kH,SCzGjB,GAAO,SACP,GAAe,CAAC,QAAS,WAAY,kBAC9BglH,IAA8B,QAAQ,GAAM,IAAe7zF,IACpE,IAAI,MACF+1B,EAAK,SACL52E,EAAQ,eACRwmF,GACE3lC,EA8BJ,OAAO+1B,EAAM,GAAM,CACjB,8CAA+C,SAAyCx/E,EAAG+wE,GAIzF,OAHAwsE,EAAcv9I,EAAG,GAED4I,EAASwmF,EAAere,GAAQ/wE,GAC/Bw7F,WAEnB,+CAAgD,SAA0Cx7F,EAAG+wE,GAG3F,OAFAwsE,EAAcv9I,EAAG,GAEV4I,EAASwmF,EAAere,GAAQ/wE,IAEzC,6DAA8D,SAAoDA,EAAG+wE,EAAOlzE,GAI1H,OAHA0/I,EAAcv9I,EAAG,GAED4I,EAASwmF,EAAere,EAAOlzE,GAAImC,IAGrD,8DAA+D,SAAqDA,EAAG+wE,EAAOlzE,GAG5H,OAFA0/I,EAAcv9I,EAAG,GAEV4I,EAASwmF,EAAere,EAAOlzE,GAAImC,MAI9C,SAASu9I,EAAc1/I,EAAG2/I,GACxB,IAAIC,EAAa5mJ,MAAMgD,QAAQgE,IAAK,SAAUA,GAAKA,EAAE8f,OAErD,GAAI8/H,EAAW/mJ,OAAS,EACtB,MAAM,IAAIsiH,WAAW,kCAAkC76E,OAAOq/G,IAGhE,GAA0B,IAAtBC,EAAW/mJ,QAAkC,IAAlB+mJ,EAAW,GACxC,MAAM,IAAIzkC,WAAW,kCAAkC76E,OAAOq/G,IAGhE,GAAIC,EAAW,KAAOD,EACpB,MAAM,IAAIxkC,WAAW,kCAAkC76E,OAAOq/G,QCxEhE,GAAe,CAAC,QAAS,MAAO,MAAO,SAAU,YAC1CE,IAA2B,QAF3B,MAEyC,IAAej0F,IACjE,IAAI,MACF+1B,EAAK,IACLp4E,EAAG,IACHwL,EAAG,OACH9T,EAAM,SACN4mD,GACE+D,EA0BJ,OAAO+1B,EAnCE,MAmCU,CAEjB,iBAAkBm+D,EAElB,MAAO,SAAWrlH,GAChB,OAAOqlH,EAAKrlH,MAIhB,SAASqlH,EAAKtoF,GAGZ,GAAqB,KAFrBA,GAAQ,SAAQA,EAAMjQ,YAEZ1uD,OACR,MAAM,IAAI0mC,MAAM,sEAGlB,IACE,IAAIwgH,EAAM9+I,EAAOu2D,GACjB,OAAOv2D,EAAO8T,EAAIyiD,GAAO,SAAUt8D,GACjC,OAAOqO,EAAIs+C,EAAS3sD,EAAO6kJ,QAE7B,MAAOljJ,GACP,MAAIA,aAAetD,YAAgD,IAAnCsD,EAAI2lB,QAAQ4N,QAAQ,UAC5C,IAAI72B,UAAUsD,EAAI2lB,QAAQ9iB,QAAQ,SAAU,SAE5C,EAAAuuH,GAAA,GAAoBpxH,EAAK,YC7DnC,GAAO,OACP,GAAe,CAAC,QAAS,QAElBmjJ,IAAoC,QAAQ,GAAM,IAAep0F,IAC1E,IAAI,MACF+1B,EAAK,KACLgD,GACE/4B,EAyBJ,OAAO+1B,EAAM,GAAM,CACjBgD,KAAM,SAAc1iF,GAClB,OAAOA,EAAE4oD,SAEXgX,OAAQ,SAAgB5/D,GACtB,OAAI0iF,EAAKC,gBAAgB3iF,GAChB,IAAI0iF,EAAK,KAAM1iF,GAGjB0iF,EAAKnyE,MAAMvQ,EAAG,CACnBi+H,cAAc,KAGlB,kDAAmD,SAA8ChlI,EAAOyI,GACtG,OAAO,IAAIghF,EAAKzpF,EAAOyI,IAEzB,iBAAkB,SAAqB1B,GACrC,OAAO,SAAQA,EAAG7D,Y,+IC5CbyzE,GAA2BouB,EAAgB,IAC3Ct+D,GAAyBw+D,EAAmB,IAC5C/c,GAAuBmd,EAAiB,IACxC0/C,GAAwB9+C,EAAY,IACpC++C,GAAuB9+C,EAAW,IAClC++C,GAAuBj/C,EAAW,IAClCzL,GAA2ByN,EAAqB,CACzDh5C,OAAM,MAEGy1C,GAAwByD,EAAkB,IAC1C3kE,GAA0BglE,EAAe,IACzC3qG,GAAmB+pG,EAAQ,CACpClhE,aAES8b,GAAsB0kD,EAAW,CAC1C1M,aACAvrC,OAAM,MAEGwiC,GAAwB6V,EAAa,CAC9C9M,aACAvrC,OAAM,MAEGk2F,GAAsB7+C,EAAU,CACzC9L,aACAvrC,OAAM,MAEG,GAAoBu3C,EAAS,CACtChM,aACAvrC,OAAM,MAEGyiC,GAAyB8V,EAAc,CAChDhN,aACAvrC,OAAM,MAEG,GAAqBy3C,EAAU,CACxClM,aACAvrC,OAAM,MAEGukC,GAA8B+W,GAAmB,CAC1D/P,aACAvrC,OAAM,MAEG8jC,GAA+B8W,GAAoB,CAC5DrP,aACAvrC,OAAM,MAEGilC,GAA+B+W,GAAoB,CAC5DzQ,aACAvrC,OAAM,MAEGskC,GAAiC+W,GAAsB,CAChE9P,aACAvrC,OAAM,MAEGyC,GAA0Bs6C,GAAoB,IAC9C,GAAmBpF,EAAQ,CACpCpM,aACAvrC,OAAM,MAEGm2F,GAA2Bh/C,EAAe,CACnD5L,aACAvrC,OAAM,MAEGuiC,GAAuB4V,EAAY,CAC5C5M,aACAvrC,OAAM,MAEG,GAAyB84C,EAAc,IACvCpD,GAA6BsH,GAAuB,CAC7DvH,YAES,GAAqBoC,EAAU,CACxCtM,aACAvrC,OAAM,MAEGy3B,GAAuB6nB,GAAY,CAC5C/T,aACA9zD,WACAi+D,eACAjzC,cAES95C,GAA2Bi3F,GAAgB,CACpDnoB,WAES0R,GAA2B0W,GAAgB,CACpDpoB,WAESx9B,GAA4BimD,GAAiB,CACtDzoB,WAES,GAAuB0oB,GAAY,CAC5C1oB,WAES2d,GAA6BgL,GAAkB,CACxDpgD,OAAM,IACNy3B,WAES/W,GAAwB6/B,GAAa,CAC9C9oB,WAES,GAAyBupB,GAAc,CAChDvpB,WAES,GAAyBypB,GAAc,CAChDzpE,WACAggD,WAES4K,GAA2B+e,GAAgB,CACpD3pB,WAES3L,GAA2B+2B,GAAgB,CACpDtX,aACAvrC,OAAM,IACNy3B,WAES,IAAuB,QAAY,CAC5C9uE,aACA8uE,WAESlK,GAAsBu1B,GAAW,CAC1CrrB,WAESp/C,GAAuB0qE,GAAY,CAC5CtrE,WACAggD,WAESj3B,GAAuByiD,GAAY,CAC5CxrE,WACAuoB,OAAM,IACNy3B,WAES4d,GAAgC6N,GAAqB,CAC9DzrB,WAESh5B,GAAsB2kD,GAAW,CAC1C7X,aACA9oC,YACAmtB,QAAO,GACP6H,WAES5J,GAAwB01B,GAAa,CAC9C9rB,WAESzL,GAAwBs5B,GAAa,CAC9C7tB,WAESz/C,GAAqButE,GAAU,CACxC9tB,WAESt/C,GAAoBqtE,GAAS,CACtC/tB,WAESxL,GAAqB45B,GAAU,CACxCpuB,WAESp2E,GAAwBykG,GAAa,CAC9CruB,WAES5hF,GAAyBmwG,GAAc,CAChDvuB,WAES5sE,GAAqBo7F,GAAU,CACxCxuB,WAES9I,GAAqBu3B,GAAU,CACxCzuB,WAESsR,GAAwB+d,GAAa,CAC9CrvB,WAESwR,GAAqB8d,GAAU,CACxChe,UACAtR,WAES6d,GAAuB4R,GAAY,CAC5CzvB,WAES4R,GAAyBge,GAAc,CAChD5vB,WAES5+C,GAAsByuE,GAAW,CAC1C7vE,WACAuoB,OAAM,IACNy3B,WAES5I,GAAsB25B,GAAW,CAC1Cjd,aACA9T,WAES1I,GAAsB05B,GAAW,CAC1Cld,aACA9zD,WACAuoB,OAAM,IACNy3B,WAESxI,GAAsBy5B,GAAW,CAC1Cnd,aACA9zD,WACAuoB,OAAM,IACNy3B,WAES3+C,GAAsB6vE,GAAW,CAC1ClxE,WACAuoB,OAAM,IACNy3B,WAES7+C,GAAsBgwE,GAAW,CAC1CnxB,WAESt+C,GAAuB0vE,GAAY,CAC5CpxE,WACAuoB,OAAM,IACNy3B,WAES1gD,GAAsB+xE,GAAW,CAC1CrxB,WAESrI,GAAsB65B,GAAW,CAC1C1d,aACA9T,WAESnI,GAAsB45B,GAAW,CAC1C3d,aACA9T,WAESjI,GAAsB25B,GAAW,CAC1C5d,aACA9T,WAESxgD,GAAsBmyE,GAAW,CAC1C3xB,WAESz+B,GAAsBqwD,GAAW,CAC1C5xB,WAEShJ,GAA8Bi7B,GAAmB,CAC1DjyB,WAESkQ,GAA4BoiB,GAAiB,CACtD/pD,OAAM,IACNy3B,WAESmQ,GAA2BgjB,GAAgB,CACpD5qD,OAAM,IACNy3B,WAES6K,GAAqByV,EAAU,CACxCxM,aACAvrC,OAAM,MAEGW,GAAuBoqD,GAAY,CAC5CtzB,WAES2R,GAAiC4hB,GAAsB,CAChE7hB,aACA1R,WAES6R,GAAwB2hB,GAAa,CAC9CxzB,WAES,GAAwByzB,GAAa,CAC9CzzB,WAES,GAA0B0zB,GAAe,CAClD1oD,YACAg1B,WAES1L,GAA4Bq/B,GAAiB,CACtD3zB,WAES8d,GAA2B8V,GAAgB,CACpD5zB,WAESzgD,GAAqBs0E,GAAU,CACxC7zB,WAESl3B,GAAsBgrD,GAAW,CAC1C9zE,WACAuoB,OAAM,IACNy3B,WAESx5E,GAAsBytG,GAAW,CAC1Cj0E,WACAuoB,OAAM,IACNy3B,WAESxJ,GAAsB29B,GAAW,CAC1Cn0B,WAESqP,GAAmCglB,GAAwB,CACpEr0B,WAESmR,GAAsBmjB,GAAW,CAC1C/wG,MAAK,GACLmuF,aACA1R,WAESuR,GAAqBijB,GAAU,CACxCljB,UACAtR,WAESp+C,GAAuB6yE,GAAY,CAC5Cz0E,WACAuoB,OAAM,IACNy3B,WAESzI,GAAuBm9B,GAAY,CAC5C5gB,aACA9T,WAESr+C,GAAuBgzE,GAAY,CAC5C30B,WAESjgD,GAAqB60E,GAAU,CACxC50B,WAESpI,GAAqBi9B,GAAU,CACxC/gB,aACA9T,WAES9/C,GAAqB40E,GAAU,CACxC90B,WAES/I,GAAqC89B,GAA0B,CACxE/0B,WAESh3B,GAAwBisD,GAAa,CAC9C1sD,OAAM,IACNy3B,WAESiL,GAAuB+V,EAAY,CAC5ClN,aACAvrC,OAAM,MAEGhG,GAA4B6yD,GAAiB,CACtDp1B,WAESke,GAA8BmX,GAAwB,CAC/DrX,UACAL,eACA3d,WAESl4E,GAAwB+qG,GAAa,CAC9C5U,eACAD,UACAE,gBACAle,WAEStgC,GAAsB04D,GAAW,CAC1CtkB,aACA9zD,WACAgrB,YACAzC,OAAM,IACNhG,cACAz6C,UACAk4E,SACA1L,gBAES7oB,GAAqBuvD,GAAU,CACxClnB,aACAmK,eACAN,eACA71F,UACAk4E,WAESx8B,GAAqBu4D,GAAU,CACxC9d,eACAN,eACA71F,UACAk4E,WAES9J,GAAyBomC,GAAc,CAChDxoB,aACA6J,eACA71F,UACAk4E,WAES+O,GAAsB4tB,GAAW,CAC1C7oB,aACAvrC,OAAM,IACNzgD,UACAk4E,WAES3K,GAAwBunC,GAAa,CAC9Cjf,eACA71F,UACAk4E,WAES,GAAwBi9B,GAAa,CAC9Chf,eACAn2F,UACAk4E,WAEStK,GAAoBynC,GAAS,CACtClf,eACAN,eACA71F,UACAk4E,WAES,IAAwB,QAAa,CAC9C9uE,aACApJ,UACAk4E,WAESoP,GAAsBguB,GAAW,CAC1Cnf,eACAC,gBACAp2F,UACAk4E,WAES3iB,GAA0BqgD,GAAe,CAClD5pB,aACAmK,eACAC,gBACA31C,OAAM,IACNzgD,UACAk4E,WAESwP,GAAsBsuB,GAAW,CAC1ChqB,aACAvrC,OAAM,IACNzgD,UACAk4E,WAES2P,GAAyBuuB,GAAc,CAChDhtG,aACApJ,UACAk4E,WAES7hE,GAAsBggG,GAAW,CAC1Cr2G,UACAygD,OAAM,IACNy3B,WAES,IAAwB,QAAa,CAC9Cl4E,UACAk4E,WAES8P,GAAuBsuB,GAAY,CAC5CtqB,aACAvrC,OAAM,IACNzgD,UACAk4E,WAESyR,GAAqB6sB,GAAU,CACxChtB,UACAtR,WAES79E,GAAuB28G,GAAY,CAC5ChrB,aACAmK,eACAN,eACA71F,UACAk4E,SACA8P,WAESlb,GAA2BqqC,GAAgB,CACpDhhB,eACAN,eACA71F,UACAk4E,SACA8P,WAEShb,GAA+BqqC,GAAoB,CAC5DlhB,eACAN,eACA71F,UACAk4E,SACA8P,WAES/pC,GAAyBq5D,GAAc,CAChDtrB,aACAmK,eACAjzC,YACAzC,OAAM,IACNo1C,eACA71F,UACAk4E,WAESqQ,GAA6BgvB,GAAkB,CACxDv3G,UACAk4E,WAES/K,GAAyBqqC,GAAc,CAChDrhB,eACA11C,OAAM,IACNzgD,UACAk4E,WAES9K,GAAwBqqC,GAAa,CAC9CthB,eACA11C,OAAM,IACNzgD,UACAk4E,WAEShL,GAAyBwqC,GAAc,CAChDvhB,eACA11C,OAAM,IACNo1C,eACA71F,UACAk4E,WAESme,GAAsCuhB,GAAgC,CAC/EzhB,eACAhpB,aAESmpB,GAA+B0hB,GAAyB,CACjE5qC,UACAD,aAESmD,GAAwB0oC,GAAa,CAC9C5iB,gBACAle,WAES3I,GAAuB0pC,GAAY,CAC5CjtB,aACA9zD,WACAuoB,OAAM,IACNy3B,WAES94E,GAAuB+5G,GAAY,CAC5CntB,aACAmK,eACAN,eACA71F,UACAk4E,WAESlI,GAAqBqpC,GAAU,CACxCrtB,aACA9T,WAESjpE,GAAqBqqG,GAAU,CACxCnjB,eACAC,gBACAJ,aACAH,eACA71F,UACAk4E,WAESrJ,GAAqB2qC,GAAU,CACxCxjB,aACAtnB,QACAonB,kBACAz/E,QACA6hE,WAESgP,GAA6BqzB,GAAkB,CACxDvkB,aACA9mB,gBACA9lE,aACAqxC,cACAC,cACA0yB,UACA8K,WAESlgC,GAAwBwiE,GAAa,CAC9CtiC,WAESp4E,GAAqB26G,GAAU,CACxCviC,WAES9gE,GAAuBsjG,GAAY,CAC5Cj6D,OAAM,IACNo1C,eACA71F,UACA3F,SACA69E,WAES52E,GAA0Bs5G,GAAe,CAClD5kB,aACAnnB,OACAgnB,eACA71F,UACA81F,kBACA5d,WAESvL,GAA6BgwC,GAAkB,CACxD9mB,eACA71F,UACA81F,kBACA5d,WAESv/C,GAAoBikF,GAAS,CACtC1kC,WAES/4C,GAAyB09E,GAAc,CAChD78G,UACAk4E,WAES0P,GAAwBo1B,GAAa,CAC9Cv8D,OAAM,IACNzgD,YAES+nF,GAAyBq1B,GAAc,CAChDp9G,UACAk4E,WAESrL,GAAoBwwC,GAAS,CACtCr9G,UACAk4E,WAES3wE,GAAqB+1G,GAAU,CACxCplF,WACAuoB,OAAM,IACNoiC,SAAQ,GACRttB,YACAv1D,UACAsB,YACA6/D,UACA+W,WAES5L,GAAwBsxC,GAAa,CAC9CznB,eACAN,eACA71F,UACAuH,OACA2wE,WAESnL,GAAiC8wC,GAAsB,CAChE1nB,eACAN,eACA71F,UACAk4E,SACA8P,WAESM,GAAgCw1B,GAAqB,CAC9D7/D,WACAi6B,WAESuQ,GAA2Bg2B,GAAgB,CACpDl2B,eACAvwC,UACAkgC,WAES5K,GAA0BoxC,GAAe,CAClDvoB,eACA11C,OAAM,IACNzgD,UACAk4E,WAESyP,GAAiCg3B,GAAsB,CAChE1gE,WACAxiD,MAAK,GACLmuF,aACA1R,WAES2c,GAAuBmqB,GAAiB,CACjD3oB,0BAES1mB,GAAuByvC,GAAY,CAC5CpzB,aACA9zD,WACAuoB,OAAM,IACNy3B,WAES97B,GAAqBijE,GAAU,CACxCnnC,WAESyQ,GAA+B22B,GAAoB,CAC5DnpB,eACAtB,SACAvM,kBACAjyE,QACA2O,OAAM,GACNkzD,WAES2Q,GAA8B82B,GAAmB,CAC1DxpB,eACAtB,SACAvM,kBACAjyE,QACA2O,OAAM,GACNkzD,WAES6Q,GAAiC62B,GAAsB,CAChE/qB,SACAvM,kBACAjyE,QACA2O,OAAM,GACNkzD,WAES+Q,GAAyB42B,GAAc,CAChDv3B,kBACApQ,WAESjJ,GAAuB6wC,GAAY,CAC5C7wG,OACAjP,UACAk4E,WAESoR,GAA6B02B,GAAkB,CACxD/wG,OACAgvC,WACA38C,YACAqmF,mBACAzP,WAESlP,GAAuBw4C,GAAY,CAC5Cx1B,aACA9zD,WACAuoB,OAAM,IACNq1C,kBACAvuF,OACA2wE,WAES9H,GAA2ByxC,GAAgB,CACpD71B,aACA9T,WAES8O,GAAqBg7B,GAAU,CACxCnsB,eACA71F,UACAk4E,WAESzK,GAAuBw0C,GAAY,CAC5C9rB,eACAN,eACA71F,UACAk4E,WAESuP,GAAsBy6B,GAAW,CAC1CliH,UACA81F,kBACA5d,WAES/L,GAA2Bi2C,GAAgB,CACpDpiH,UACAk4E,WAEShI,GAAyBuyC,GAAc,CAChDryC,aACAyS,SAAQ,GACR1hB,YAESuM,GAAqBq1C,GAAU,CACxCltB,eACA71F,UACA0sE,OACAwL,SACA8P,WAES3a,GAA2B21C,GAAgB,CACpD7sB,eACA11C,OAAM,IACNzgD,UACAk4E,WAEStuC,GAAsBq5E,GAAW,CAC1ChlE,WACAqqC,kBACAtoF,UACAk4E,WAES,IAAqB,QAAU,CACxCz3B,OAAM,IACNyvB,WACA/C,WACA+K,WAEStI,GAAqB2zC,GAAU,CACxCv3B,aACA9T,WAES0Q,GAA6B46B,GAAkB,CACxDrtB,eACAtB,SACAvM,kBACAjyE,QACA2O,OAAM,GACNkzD,WAES8Q,GAA6By6B,GAAkB,CACxD5uB,SACAvM,kBACAjyE,QACA2O,OAAM,GACNkzD,WAESzkD,GAAuBowF,GAAY,CAC5ChvB,SACA3c,WAES,IAAqB,QAAU,CACxCjpE,OACAwxC,OAAM,IACNyvB,WACAgI,WAES7L,GAA2By3C,GAAgB,CACpD96C,SACAkP,WAESiQ,GAA8B47B,GAAmB,CAC1D13C,aACA6L,WAES5gE,GAAsB0sG,GAAW,CAC1CvjE,OAAM,IACNo1C,eACA71F,UACA3F,SACA69E,WAES95B,GAA0B6lE,GAAe,CAClD9tB,eACAH,aACAH,eACA71F,UACAk4E,SACA1L,gBAESmC,GAAuBw1C,GAAY,CAC5CnkH,UACAsB,YACA88C,YACA85B,WAES,IAAuB,QAAY,CAC5C9H,aACApwE,UACAygD,OAAM,IACN2sB,UACAE,YACAH,WACAE,aACA6K,WAES,IAAqB,QAAU,CACxC2c,SACA70F,UACAmnB,MAAK,GACL+wD,WAES35B,GAAsB+lE,GAAW,CAC1C7jE,OAAM,IACNq1C,kBACA5lB,WACAgI,WAESjL,GAAuBw3C,GAAY,CAC5CtuB,eACAN,eACA71F,UACAk4E,WAES,IAAqB,QAAU,CACxCz3B,OAAM,IACN2sB,UACA8C,WACAgI,WAESwQ,GAA8Bg8B,GAAmB,CAC1DvuB,eACAtB,SACAvM,kBACAjyE,QACA2O,OAAM,GACNkzD,WAESgR,GAAkCy7B,GAAuB,CAClE9vB,SACAh+D,OAAM,GACN8xD,iBACAtyE,QACA2O,OAAM,GACNkzD,WAESjK,GAAqB22C,GAAU,CACxC1sF,WACA5gB,QACAF,SACApX,UACAk4E,WAES,IAAwB,QAAa,CAC9C2c,SACA70F,UACAmnB,MAAK,GACL+wD,WAES,IAAsB,QAAW,CAC1Cl4E,UACAmhE,UACA/iB,YACA85B,WAES9L,GAA4By4C,GAAiB,CACtDn2C,QACAvC,aACA+L,WAESsQ,GAA2Bs8B,GAAgB,CACpD73C,SACAiL,WAES4Q,GAA6Bk8B,GAAkB,CACxDnwB,SACAvM,kBACAjyE,QACA2O,OAAM,GACNkzD,WAESvK,GAAqBs3C,GAAU,CACxC9uB,eACAn2F,UACAk4E,WAES+d,GAA8BivB,GAAmB,CAC1Dh1C,WACAgI,WAES7J,GAA0B82C,GAAe,CAClDjtF,WACAuoB,OAAM,IACNw1C,gBACA/d,WAESqO,GAAwBs/B,GAAa,CAC9C1vB,eACAF,gBACAJ,eACA71F,UACA81F,kBACA13C,YACA85B,WAESsO,GAA2B+/B,GAAgB,CACpDpwB,eACAF,gBACAJ,eACA71F,UACA81F,kBACA13C,YACA85B,WAESqe,GAAqB6wB,GAAe,CAC7C9wB,iBACAN,aACAH,iBAES1M,GAA0By+B,GAAe,CAClD/yB,SACAh+D,OAAM,GACNgyD,gBACAK,oBACA7yE,QACA2O,OAAM,GACNkzD,WAESuO,GAAqBohC,GAAU,CACxC1xB,eACAI,OACAH,gBACAt2F,OACAk2F,aACAC,gBACAJ,eACAzoB,UACAptE,UACA81F,kBACA13C,YACA85B,SACA1L,gBAESoa,GAAqB4nC,GAAU,CACxCp4B,gBACAt2F,OACAmP,OACAgnF,gBACA7oB,UACAE,YACAhsE,YACA88C,YACA+tB,aACA+L,WAEStJ,GAAqBggD,GAAU,CACxCnoC,OACAzmF,UACAsB,YACA88C,YACA85B,SACA1L,gBAESjnB,GAA0BypE,GAAe,CAClDlvH,OACAk2F,aACAC,gBACAH,kBACAp3F,QACA0/C,YACA85B,SACA1L,gBAESiC,GAA4ByiD,GAAiB,CACtDl7B,aACA9mB,gBACA+mB,gBACA5pB,aACAjjE,aACAqxC,cACA2yB,UACA0oB,kBACAvuF,OACA62C,YACA85B,WAES1J,GAAyB+iD,GAAc,CAChDv7B,aACA9mB,gBACA+mB,gBACA7sF,aACAqxC,cACAq7C,kBACA5d,WAES7jD,GAAuBm9F,GAAY,CAC5CjzE,QACAloC,QACA6hE,WAESlgD,GAAqBy5F,GAAU,CACxCv5F,WACAuoB,OAAM,IACNw1C,gBACA/d,WAEStL,GAA2B8kD,GAAgB,CACpDv7B,eACAF,gBACAJ,eACA71F,UACAk4E,WAES4O,GAA2B6qC,GAAgB,CACpDx7B,eACAF,gBACAJ,eACA71F,UACA81F,kBACA13C,YACA85B,WAESp3B,GAAuBgxE,GAAY,CAC5ChyH,OACAk2F,aACAC,gBACAv7C,cACAo7C,kBACA3oB,WACAzuE,QACAw5E,WAES6O,GAAoBgrC,GAAS,CACtC/7B,aACA3lB,QAAO,GACP3B,QACAunB,gBACAhpB,SACA1X,YACAvd,UACAh4C,UACA81F,kBACA52C,QACAxgD,QACA0/C,YACA85B,SACA1L,cACAwb,WAESjZ,GAAqB2jD,GAAU,CACxC5yH,OACAk2F,aACApnB,OACAqnB,gBACA1gC,YACAv1D,UACAsB,YACA42E,SACA1L,gBAESsC,GAAsBqkD,GAAW,CAC1CrzH,OACAmP,OACAsmD,YACAwZ,OACAztE,YACA42E,WAEShgC,GAAwB87E,GAAa,CAC9C/9B,gBACAJ,eACA9mB,OACA/uE,UACAsB,YACA42E,WAES,IAAsB,QAAW,CAC1CjpE,OACAipC,UACAggC,WAES,IAA0B,QAAe,CAClDjpE,OACA8zC,MAAK,GACL7K,UACAz8C,MAAK,GACL6F,YACA88C,YACA85B,WAES+P,GAA8BgsC,GAAmB,CAC1D/7E,UACA00B,aACAgd,aACA5xD,OACAh4B,UACAsB,YACAslC,IAAG,GACHsxC,WAES3J,GAA6BgmD,GAAkB,CACxDv+B,aACA5sF,aACAqxC,cACAg0B,cACAyJ,WAEShK,GAAuBsmD,GAAY,CAC5Ct8F,WACAuoB,OAAM,IACNw1C,gBACAj+D,OACAkgD,WAESgD,GAAsBy5C,GAAgB,CAC/C3oC,aACA9zD,WACAgrB,YACApjD,OACAk2F,aACAv1C,OAAM,IACNw1C,gBACAhpB,SACAgB,OACAub,UACAI,aACAkM,kBACA30B,UACA55D,OACAlN,SACA+jD,cAESwkC,GAA4ByqD,GAAiB,CACtDnyD,QACAhD,WAESsP,GAAsB+lD,GAAW,CAC1CztI,OACAmP,OACA+mF,aACA38D,QACA+2C,aACA3vB,OAAM,IACNxoB,OACAg1C,SACA8B,OACA/uE,UACAsB,YACAw0F,kBACA19D,OACAgmB,YACA85B,WAES3/E,GAA2Bu3I,GAAgB,CACpDhwI,OACAmP,OACA+mF,aACAv1C,OAAM,IACNw1C,gBACAJ,eACA71F,UACAsB,YACAw0F,kBACA3oB,WACA/uB,YACA85B,WAES,IAAqB,QAAU,CACxCx5E,QACAw5E,SACA7I,SAAQ,KAEC4V,GAA4B+W,GAAiB,CACtDhQ,aACA9Q,QACAz6B,OAAM,MAEGojC,GAA8B8W,GAAmB,CAC1D3O,aACA9Q,QACAz6B,OAAM,MAEG0kC,GAA2B+W,GAAgB,CACpDlQ,aACA9Q,QACAz6B,OAAM,MAEGqjC,GAAoC8W,GAAyB,CACtE5O,aACA9Q,QACAz6B,OAAM,MAEGikC,GAA8B+W,GAAmB,CAC1DzP,aACA9Q,QACAz6B,OAAM,MAEG4jC,GAA8B8W,GAAmB,CAC1DnP,aACA9Q,QACAz6B,OAAM,MAEG2kC,GAAyB+W,GAAc,CAChDnQ,aACA9Q,QACAz6B,OAAM,MAEG4kC,GAAgC+W,GAAqB,CAC9DpQ,aACA9Q,QACAz6B,OAAM,MAEG4iC,GAAqC8W,EAA0B,CACxEnO,aACA9Q,QACAz6B,OAAM,MAEG+jC,GAA+B+W,GAAoB,CAC5DvP,aACA9Q,QACAz6B,OAAM,MAEGyjC,GAA0B8W,GAAe,CAClDhP,aACA9Q,QACAz6B,OAAM,MAEG+iC,GAAkC8W,EAAuB,CAClEtO,aACA9Q,QACAz6B,OAAM,MAEGqlC,GAA2B+W,GAAgB,CACpD7Q,aACA9Q,QACAz6B,OAAM,MAEG+kC,GAAqC+W,GAA0B,CACxEvQ,aACA9Q,QACAz6B,OAAM,MAEGkkC,GAA6B+W,GAAkB,CACxD1P,aACA9Q,QACAz6B,OAAM,MAEG2lC,GAA8B+W,GAAmB,CAC1DnR,aACA9Q,QACAz6B,OAAM,MAEGwlC,GAA8B+W,GAAmB,CAC1DhR,aACA9Q,QACAz6B,OAAM,MAEG4lC,GAAmC+W,GAAwB,CACpEpR,aACA9Q,QACAz6B,OAAM,MAEGgkC,GAA4B+W,GAAiB,CACtDxP,aACA9Q,QACAz6B,OAAM,MAEG8iC,GAAuC8W,EAA4B,CAC5ErO,aACA9Q,QACAz6B,OAAM,MAEGklC,GAAiC+W,GAAsB,CAChE1Q,aACA9Q,QACAz6B,OAAM,MAEGmlC,GAAiC+W,GAAsB,CAChE3Q,aACA9Q,QACAz6B,OAAM,MAEGijC,GAAiC8W,GAAsB,CAChExO,aACA9Q,QACAz6B,OAAM,MAEGomC,GAAwBgsD,GAAa,CAC9C18C,eACAF,gBACAJ,eACA71F,UACA81F,kBACA13C,YACA85B,WAES/J,GAAsB2kE,GAAW,CAC1ChzI,OACAmP,OACAy/D,QACAtC,cACAob,QACAqO,eACAzoB,UACAptE,UACAsB,YACAiG,OACA4lE,WACAzuE,QACAw5E,WAESwO,GAAyBytD,GAAc,CAChDh+C,eACA5P,UACAE,OACAzmF,UACA4mF,OACA1O,SACA2O,YAES7X,GAAuBslE,GAAY,CAC5Cx0I,OACAmP,OACAsmD,YACAwZ,OACA1xD,IAAG,GACH/b,YACA+U,QACA3X,QACA0/C,YACA85B,WAESgQ,GAA6BysD,GAAkB,CACxD1lI,OACAipC,UACAm0B,aACAjjE,aACAsxC,cACAp5C,YACA42E,WAESgN,GAA0B+W,GAAe,CAClDjQ,aACA9Q,QACAz6B,OAAM,MAEG2jC,GAAyC8W,GAA8B,CAChFlP,aACA9Q,QACAz6B,OAAM,MAEGgjC,GAAkC8W,EAAuB,CAClEvO,aACA9Q,QACAz6B,OAAM,MAEG6jC,GAA+B8W,GAAoB,CAC5DpP,aACA9Q,QACAz6B,OAAM,MAEGulC,GAAyB+W,GAAc,CAChD/Q,aACA9Q,QACAz6B,OAAM,MAEG6kC,GAA2B+W,GAAgB,CACpDrQ,aACA9Q,QACAz6B,OAAM,MAEGslC,GAA8B+W,GAAmB,CAC1D9Q,aACA9Q,QACAz6B,OAAM,MAEGwjC,GAAiC8W,GAAsB,CAChE/O,aACA9Q,QACAz6B,OAAM,MAEGylC,GAA4B+W,GAAiB,CACtDjR,aACA9Q,QACAz6B,OAAM,MAEGmkC,GAAsC+W,GAA2B,CAC1E3P,aACA9Q,QACAz6B,OAAM,MAEG2iC,GAA8B6W,EAAmB,CAC1DjO,aACA9Q,QACAz6B,OAAM,MAEGolC,GAAkC+W,GAAuB,CAClE5Q,aACA9Q,QACAz6B,OAAM,MAEGqnC,GAAgC+sD,GAAqB,CAC9D7oD,aACAmK,eACAC,gBACAJ,aACAv1C,OAAM,IACNxoB,OACAj4B,UACA81F,kBACA3nB,QACA/1C,OACA8/C,SACA1L,gBAESh1E,GAAwBm+I,GAAa,CAC9C1mI,OACAgvC,WACA/F,UACAyvC,mBACAzP,WAESiM,GAA4B8W,GAAiB,CACtDjP,aACA9Q,QACAz6B,OAAM,MAEGmjC,GAAkC8W,GAAuB,CAClE1O,aACA9Q,QACAz6B,OAAM,MAEGsjC,GAA2C8W,GAAgC,CACpF7O,aACA9Q,QACAz6B,OAAM,MAEGglC,GAA6B+W,GAAkB,CACxDxQ,aACA9Q,QACAz6B,OAAM,MAEG0lC,GAA4B+W,GAAiB,CACtDlR,aACA9Q,QACAz6B,OAAM,MAEGqkC,GAAqC+W,GAA0B,CACxE7P,aACA9Q,QACAz6B,OAAM,MAEGxgD,GAAwB+1I,GAAa,CAC9C10I,YACAwmF,kBACA5P,WAESkR,GAAqBgtD,GAAU,CACxCt2I,OACAwL,OACA9T,UACA4mD,YACA85B,WAESyL,GAAyB8W,GAAc,CAChDzO,aACA9Q,QACAz6B,OAAM,MAEGujC,GAAqC8W,GAA0B,CACxE9O,aACA9Q,QACAz6B,OAAM,MAEGokC,GAAyB+W,GAAc,CAChD5P,aACA9Q,QACAz6B,OAAM,MAEGvmD,GAAsBq8I,GAAmB,CAClDr7D,QACAhD,WAESqN,GAA6B+W,GAAkB,CACxDtQ,aACA9Q,QACAz6B,OAAM,MAEG6iC,GAAgC8W,EAAqB,CAC9DpO,aACA9Q,QACAz6B,OAAM,O,4BCt+CD,SAASs9C,EAAe84C,EAAQC,EAAUC,GAC/C,KAAMpiJ,gBAAgBopG,GACpB,MAAM,IAAInmE,YAAY,oDAGxBjjC,KAAKkiJ,OAASA,EACdliJ,KAAKmiJ,SAAWA,EAChBniJ,KAAKoiJ,SAAWA,EAChBpiJ,KAAKokB,QAAU,wBAA0BxpB,MAAMgD,QAAQskJ,GAAU,IAAMA,EAAOl5G,KAAK,MAAQ,IAAMk5G,GAAU,KAAOliJ,KAAKoiJ,UAAY,MAAQ,KAAOxnJ,MAAMgD,QAAQukJ,GAAY,IAAMA,EAASn5G,KAAK,MAAQ,IAAMm5G,GAAY,IAC1NniJ,KAAKk3B,OAAQ,IAAIiK,OAAQjK,M,iBAE3BkyE,EAAentG,UAAY,IAAI8gH,WAC/B3T,EAAentG,UAAUsB,YAAcw/G,WACvC3T,EAAentG,UAAU0D,KAAO,iBAChCypG,EAAentG,UAAUomJ,kBAAmB,G,4BCbrC,SAASh+D,EAAWvlD,EAAOtW,EAAKE,GACrC,KAAM1oB,gBAAgBqkF,GACpB,MAAM,IAAIphD,YAAY,oDAGxBjjC,KAAK8+B,MAAQA,EAETkB,UAAUvlC,OAAS,GACrBuF,KAAKwoB,IAAM,EACXxoB,KAAK0oB,IAAMF,IAEXxoB,KAAKwoB,IAAMA,EACXxoB,KAAK0oB,IAAMA,QAGIvqB,IAAb6B,KAAKwoB,KAAqBxoB,KAAK8+B,MAAQ9+B,KAAKwoB,IAC9CxoB,KAAKokB,QAAU,uBAAyBpkB,KAAK8+B,MAAQ,MAAQ9+B,KAAKwoB,IAAM,SAClDrqB,IAAb6B,KAAK0oB,KAAqB1oB,KAAK8+B,OAAS9+B,KAAK0oB,IACtD1oB,KAAKokB,QAAU,uBAAyBpkB,KAAK8+B,MAAQ,OAAS9+B,KAAK0oB,IAAM,GAAK,IAE9E1oB,KAAKokB,QAAU,uBAAyBpkB,KAAK8+B,MAAQ,IAGvD9+B,KAAKk3B,OAAQ,IAAIiK,OAAQjK,M,iBAE3BmtD,EAAWpoF,UAAY,IAAI8gH,WAC3B14B,EAAWpoF,UAAUsB,YAAcw/G,WACnC14B,EAAWpoF,UAAU0D,KAAO,aAC5B0kF,EAAWpoF,UAAUmoF,cAAe,G,yFClChCzkF,EAAO,QACPqxE,EAAe,CAAC,QAAS,aAClBsxE,GAA6B,QAAQ3iJ,EAAMqxE,GAAexjB,IACnE,IAAI,MACF+1B,EAAK,UACL9uE,GACE+4C,EAkCJ,OAAO+1B,EAAM5jF,EAAM,CACjB,+CAAgD,SAA4Cs+H,EAAKj/B,EAAK9qF,GACpG,IAAKO,EAAUuqF,GACb,MAAM,IAAI7jG,UAAU,yCAGtB,IAAIumB,EAAO9mB,MAAMgD,QAAQqgI,IAAO,QAAUA,GAAOA,EAAIv8G,OAErD,GAAIs9E,EAAM,GAAKA,GAAOt9E,EAAKjnB,OACzB,MAAM,IAAI,IAAWukG,EAAKt9E,EAAKjnB,QAGjC,OAAI,QAASwjI,GACJA,EAAI3gI,OAAOilJ,EAAOtkB,EAAI90E,UAAW61C,EAAK9qF,IAEtCquI,EAAOtkB,EAAKj/B,EAAK9qF,SAchC,SAASquI,EAAOtkB,EAAKj/B,EAAK9qF,GACxB,IAAIxZ,EAAG2qC,EAAKm9G,EAEZ,GAAIxjD,GAAO,EAAG,CACZ,GAAKpkG,MAAMgD,QAAQqgI,EAAI,IAEhB,CAIL,IAHAukB,EA2BN,SAAiBvkB,GACf,IAEIvjI,EAAGyuB,EAFHw7E,EAAIs5B,EAAIxjI,OACR8qH,EAAI0Y,EAAI,GAAGxjI,OAEX4qC,EAAM,GAEV,IAAKlc,EAAI,EAAGA,EAAIo8F,EAAGp8F,IAAK,CACtB,IAAI+a,EAAM,GAEV,IAAKxpC,EAAI,EAAGA,EAAIiqG,EAAGjqG,IACjBwpC,EAAI1lC,KAAKy/H,EAAIvjI,GAAGyuB,IAGlBkc,EAAI7mC,KAAK0lC,GAGX,OAAOmB,EA3CIo9G,CAAQxkB,GACf54F,EAAM,GAED3qC,EAAI,EAAGA,EAAI8nJ,EAAK/nJ,OAAQC,IAC3B2qC,EAAI3qC,GAAK6nJ,EAAOC,EAAK9nJ,GAAIskG,EAAM,EAAG9qF,GAGpC,OAAOmxB,EATP,OAAOnxB,EAAS+pH,GAclB,IAFA54F,EAAM,GAED3qC,EAAI,EAAGA,EAAIujI,EAAIxjI,OAAQC,IAC1B2qC,EAAI3qC,GAAK6nJ,EAAOtkB,EAAIvjI,GAAIskG,EAAM,EAAG9qF,GAGnC,OAAOmxB,I,+EC7FP1lC,EAAO,SACPqxE,EAAe,CAAC,QAAS,QAAS,SAAU,SACrC0xE,GAA8B,QAAQ/iJ,EAAMqxE,GAAexjB,IACpE,IAAI,MACF+1B,EAAK,MACL2c,EAAK,OACL70F,EAAM,MACNmnB,GACEg7B,EAuBJ,OAAO+1B,EAAM5jF,EAAM,CACjB,iBAAkBgjJ,EAClB,gBAAiB,SAAqB7lJ,EAAO41F,GAC3C,OAAOiwD,EAAQt3I,GAAO,QAAMvO,IAAS41F,GAAQvpC,aAUjD,SAASw5F,EAAQ7lJ,EAAO41F,GAEtB,GAA4B,IAAxB51F,EAAM4kB,OAAOjnB,OACf,MAAM,IAAI0mC,MAAM,6CAGlB,QAAcuxD,EAAQ51F,EAAM4kB,OAAO,IACnC,IAAIkhI,EAAWpwH,EAAM,EAAG11B,EAAM4kB,OAAO,IACjCod,EAAQ,IAAIohE,EAAM0iD,EAAUlwD,GAChC,OAAO51F,EAAMuzB,OAAOyO,Q,6GClDpBn/B,EAAO,SACPqxE,EAAe,CAAC,QAAS,SAAU,aAC5B6xE,GAA8B,QAAQljJ,EAAMqxE,GAAexjB,IACpE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,UACNoJ,GACE+4C,EA+BJ,OAAO+1B,EAAM5jF,EAAM,CAEjB,yCAA0C,SAAoC08B,GAC5E,IAAI3hC,EAIAooJ,EAHAtoJ,EAAM6hC,EAAK5hC,OACXukG,GAAO,EAGPupB,GAAW,EACXw6B,EAAW,GAEf,IAAKroJ,EAAI,EAAGA,EAAIF,EAAKE,IAAK,CACxB,IAAIopC,EAAMzH,EAAK3hC,GAMf,IAJI,QAASopC,KACXykF,GAAW,IAGT,QAASzkF,KAAQ,QAAYA,GAAM,CACrC,GAAIppC,IAAMF,EAAM,EACd,MAAM,IAAI2mC,MAAM,gDAOlB,GAHA2hH,EAAU9jD,EACVA,EAAMl7D,EAAIqlB,WAEL10C,EAAUuqF,GACb,MAAM,IAAI7jG,UAAU,yCAGtB,GAAI6jG,EAAM,GAAKtkG,EAAI,GAAKskG,EAAM8jD,EAE5B,MAAM,IAAI,IAAW9jD,EAAK8jD,EAAU,OAEjC,CAEL,IAAIj5I,GAAI,QAAMi6B,GAAKqlB,UACfznC,GAAO,QAAU7X,GAKrB,GAJAk5I,EAASroJ,GAAKmP,EACdi5I,EAAU9jD,EACVA,EAAMt9E,EAAKjnB,OAAS,EAEhBC,EAAI,GAAKskG,IAAQ8jD,EACnB,MAAM,IAAI,IAAeA,EAAU,EAAG9jD,EAAM,IAKlD,GAAwB,IAApB+jD,EAAStoJ,OACX,MAAM,IAAIwoC,YAAY,gCAKxB,IAFA,IAAIxN,EAAMstH,EAASl8F,QAEZk8F,EAAStoJ,QACdg7B,EAAMutH,EAAQvtH,EAAKstH,EAASl8F,QAASm4C,EAAK,GAG5C,OAAOupB,EAAWl9G,EAAOoqB,GAAOA,GAElC,YAAa,SAAgB4G,GAC3B,OAAOA,EAAK2M,KAAK,UAevB,SAASg6G,EAAQ75I,EAAGC,EAAG65I,EAAWjkD,GAChC,GAAIA,EAAMikD,EAAW,CAEnB,GAAI95I,EAAE1O,SAAW2O,EAAE3O,OACjB,MAAM,IAAI,IAAe0O,EAAE1O,OAAQ2O,EAAE3O,QAKvC,IAFA,IAAI4O,EAAI,GAEC3O,EAAI,EAAGA,EAAIyO,EAAE1O,OAAQC,IAC5B2O,EAAE3O,GAAKsoJ,EAAQ75I,EAAEzO,GAAI0O,EAAE1O,GAAIuoJ,EAAWjkD,EAAM,GAG9C,OAAO31F,EAGP,OAAOF,EAAE+4B,OAAO94B,K,+ECtIhBzJ,EAAO,OACPqxE,EAAe,CAAC,QAAS,SAAU,WAAY,UACxCkyE,GAA4B,QAAQvjJ,EAAMqxE,GAAexjB,IAClE,IAAI,MACF+1B,EAAK,OACLl4E,EAAM,SACNo+C,EAAQ,OACR+iB,GACEhf,EAgDJ,OAAO+1B,EAAM5jF,EAAM,CACjB,iBAAkB,SAAqBpF,GAErC,OAAI,QAASA,GACJ8Q,EAAO83I,EAAM5oJ,EAAIglG,YAEjB4jD,EAAM5oJ,IAGjB,yBAA0B,SAA2BA,EAAKykG,GACxD,KAAK,OAAUA,GAAM,MAAM,IAAI+d,WAAW,oCAE1C,OAAI,QAASxiH,GACJ8Q,EAAO+3I,EAAW7oJ,EAAIglG,UAAWP,IAEjCokD,EAAW7oJ,EAAKykG,IAG3B,4BAA6B,SAA8BzkG,EAAKykG,GAC9D,OAAOh/F,KAAKzF,EAAKiyE,EAAOwyB,OAY5B,SAASokD,EAAW7oJ,EAAKykG,GAKvB,IAJI,QAASzkG,KACXA,EAAMA,EAAIglG,YAGP3kG,MAAMgD,QAAQrD,GACjB,MAAMwiH,WAAW,mDAGnB,GAAI/d,EAAM,EAAG,CACX,IAAI91F,EAAS,GAIb,OAHA3O,EAAIoH,SAAQ+C,IACVwE,EAAO1K,KAAK4kJ,EAAW1+I,EAASs6F,EAAM,OAEjC91F,EACF,GAAY,IAAR81F,EACT,OAAOmkD,EAAM5oJ,GAEb,MAAMwiH,WAAW,kCAWrB,SAASomC,EAAM5oJ,GACb,IAAI2O,EAAS,GACTwY,EAAOnnB,EAAIE,OAEf,GAAIinB,EAAO,EACT,OAAOnnB,EAGT,IAAK,IAAIG,EAAI,EAAGA,EAAIgnB,EAAMhnB,IACxBwO,EAAO1K,KAAK6kJ,EAAa9oJ,EAAIG,EAAI,GAAIH,EAAIG,KAG3C,OAAOwO,EAWT,SAASm6I,EAAaC,EAAMC,IAEtB,QAASD,KAAOA,EAAOA,EAAK/jD,YAC5B,QAASgkD,KAAOA,EAAOA,EAAKhkD,WAChC,IAAIikD,EAAc5oJ,MAAMgD,QAAQ0lJ,GAC5BG,EAAc7oJ,MAAMgD,QAAQ2lJ,GAEhC,GAAIC,GAAeC,EACjB,OAkBJ,SAAoBC,EAAM/oJ,GACxB,GAAI+oJ,EAAKjpJ,SAAWE,EAAKF,OACvB,MAAMsiH,WAAW,2CAMnB,IAHA,IAAI7zG,EAAS,GACTwY,EAAOgiI,EAAKjpJ,OAEPC,EAAI,EAAGA,EAAIgnB,EAAMhnB,IACxBwO,EAAO1K,KAAK6kJ,EAAaK,EAAKhpJ,GAAIC,EAAKD,KAGzC,OAAOwO,EA9BEy6I,CAAWL,EAAMC,GAG1B,IAAKC,IAAgBC,EACnB,OAAOh6F,EAAS85F,EAAMD,GAGxB,MAAMnoJ,UAAU,oE,qEC3JhBwE,EAAO,QACPqxE,EAAe,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,YACvFxB,GAA6B,QAAQ7vE,EAAMqxE,GAAexjB,IACnE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,OACNzgD,EAAM,UACNowE,EAAS,QACTjD,EAAO,UACPE,EAAS,OACTD,EAAM,SACNE,GACEnrB,EA6CJ,OAAO+1B,EAAM5jF,EAAM,CAGjB8jE,OAAQmgF,EACR,kBAAmBA,EACnB,iBAAkB,SAAsBlxI,EAAOC,GAC7C,OAAOkhD,EAAKgwF,EAASnxI,EAAOC,EAAK,KAEnC,yBAA0B,SAA4BD,EAAOC,EAAK8rB,GAChE,OAAOo1B,EAAKgwF,EAASnxI,EAAOC,EAAK8rB,KAEnC,0BAA2B,SAA6B/rB,EAAOC,EAAKmxI,GAClE,OAAoBjwF,EAAbiwF,EAAkBC,EAAUrxI,EAAOC,EAAK,GAAWkxI,EAASnxI,EAAOC,EAAK,KAEjF,kCAAmC,SAAmCD,EAAOC,EAAK8rB,EAAMqlH,GACtF,OAAoBjwF,EAAbiwF,EAAkBC,EAAUrxI,EAAOC,EAAK8rB,GAAcolH,EAASnxI,EAAOC,EAAK8rB,KAEpF,uBAAwB,SAA4B/rB,EAAOC,GAEzD,OAAOkhD,EAAKmwF,EAAYtxI,EAAOC,EAAK,IAAI0kF,EADxB3kF,EAAMnV,aAC4B,MAEpD,kCAAmC,SAAqCmV,EAAOC,EAAK8rB,GAClF,OAAOo1B,EAAKmwF,EAAYtxI,EAAOC,EAAK8rB,KAEtC,gCAAiC,SAAmC/rB,EAAOC,EAAKmxI,GAC9E,IAAIzsD,EAAY3kF,EAAMnV,YACtB,OAAoBs2D,EAAbiwF,EAAkBG,EAAavxI,EAAOC,EAAK,IAAI0kF,EAAU,IAAY2sD,EAAYtxI,EAAOC,EAAK,IAAI0kF,EAAU,MAEpH,2CAA4C,SAA4C3kF,EAAOC,EAAK8rB,EAAMqlH,GACxG,OAAoBjwF,EAAbiwF,EAAkBG,EAAavxI,EAAOC,EAAK8rB,GAAculH,EAAYtxI,EAAOC,EAAK8rB,OAI5F,SAASo1B,EAAKt5D,GACZ,MAAsB,WAAlBuxD,EAAOzgD,OACFA,EAASA,EAAO9Q,IAAO,UAGzBA,EAGT,SAASqpJ,EAAUvkH,EAAKykH,GACtB,IAAIt3I,EAiJN,SAAgB6yB,GACd,IAEImjE,EAFOnjE,EAAIjM,MAAM,KAELzc,KAAI,SAAUmtB,GAE5B,OAAOn+B,OAAOm+B,MAMhB,GAJc0+D,EAAK/0F,MAAK,SAAU+4C,GAChC,OAAO1/C,MAAM0/C,MAIb,OAAO,KAGT,OAAQg8C,EAAK/nG,QACX,KAAK,EACH,MAAO,CACLiY,MAAO8vF,EAAK,GACZ7vF,IAAK6vF,EAAK,GACV/jE,KAAM,GAGV,KAAK,EACH,MAAO,CACL/rB,MAAO8vF,EAAK,GACZ7vF,IAAK6vF,EAAK,GACV/jE,KAAM+jE,EAAK,IAGf,QACE,OAAO,MAhLH0hD,CAAO7kH,GAEf,IAAK7yB,EACH,MAAM,IAAIy2B,YAAY,WAAa5D,EAAM,uBAK3C,MAAsB,cAAlBysB,EAAO0gB,aACSruE,IAAds9E,IACF,UAIK5nB,GADFiwF,EAAaG,EAAeD,GAClBvoE,EAAUjvE,EAAEkG,OAAQ+oE,EAAUjvE,EAAEmG,KAAM8oE,EAAUjvE,EAAEiyB,SAG1Do1B,GADFiwF,EAAaC,EAAYF,GACfr3I,EAAEkG,MAAOlG,EAAEmG,IAAKnG,EAAEiyB,OAarC,SAASolH,EAASnxI,EAAOC,EAAK8rB,GAC5B,IAAI26B,EAAQ,GACRv1D,EAAI6O,EAER,GAAI+rB,EAAO,EACT,KAAO+5C,EAAQ30E,EAAG8O,IAChBymD,EAAM56D,KAAKqF,GACXA,GAAK46B,OAEF,GAAIA,EAAO,EAChB,KAAOg6C,EAAO50E,EAAG8O,IACfymD,EAAM56D,KAAKqF,GACXA,GAAK46B,EAIT,OAAO26B,EAYT,SAAS2qF,EAAUrxI,EAAOC,EAAK8rB,GAC7B,IAAI26B,EAAQ,GACRv1D,EAAI6O,EAER,GAAI+rB,EAAO,EACT,KAAOi6C,EAAU70E,EAAG8O,IAClBymD,EAAM56D,KAAKqF,GACXA,GAAK46B,OAEF,GAAIA,EAAO,EAChB,KAAOk6C,EAAS90E,EAAG8O,IACjBymD,EAAM56D,KAAKqF,GACXA,GAAK46B,EAIT,OAAO26B,EAYT,SAAS4qF,EAAYtxI,EAAOC,EAAK8rB,GAC/B,IAAI06E,EAAO19B,EAAU,GACjBriB,EAAQ,GACRv1D,EAAI6O,EAER,GAAI+rB,EAAKwlB,GAAGk1D,GACV,KAAO3gC,EAAQ30E,EAAG8O,IAChBymD,EAAM56D,KAAKqF,GACXA,EAAIA,EAAE+/B,KAAKnF,QAER,GAAIA,EAAKynB,GAAGizD,GACjB,KAAO1gC,EAAO50E,EAAG8O,IACfymD,EAAM56D,KAAKqF,GACXA,EAAIA,EAAE+/B,KAAKnF,GAIf,OAAO26B,EAYT,SAAS6qF,EAAavxI,EAAOC,EAAK8rB,GAChC,IAAI06E,EAAO19B,EAAU,GACjBriB,EAAQ,GACRv1D,EAAI6O,EAER,GAAI+rB,EAAKwlB,GAAGk1D,GACV,KAAOzgC,EAAU70E,EAAG8O,IAClBymD,EAAM56D,KAAKqF,GACXA,EAAIA,EAAE+/B,KAAKnF,QAER,GAAIA,EAAKynB,GAAGizD,GACjB,KAAOxgC,EAAS90E,EAAG8O,IACjBymD,EAAM56D,KAAKqF,GACXA,EAAIA,EAAE+/B,KAAKnF,GAIf,OAAO26B,O,+ECrOP4X,EAAe,CAAC,QAAS,QAAS,SAAU,SACrCmzE,GAA2B,QAF3B,MAEyCnzE,GAAexjB,IACjE,IAAI,MACF+1B,EAAK,MACL2c,EAAK,OACL70F,EAAM,MACNmnB,GACEg7B,EAuBJ,OAAO+1B,EA/BE,MA+BU,CACjB,iBAAkB6gE,EAClB,gBAAiB,SAAqBtnJ,EAAO6uF,GAC3C,OAAOy4D,EAAK/4I,GAAO,QAAMvO,IAAS6uF,GAAKxiC,aAU3C,SAASi7F,EAAKtnJ,EAAO6uF,GAEnB,GAA4B,IAAxB7uF,EAAM4kB,OAAOjnB,OACf,MAAM,IAAI0mC,MAAM,6CAGlB,QAAcwqD,EAAK7uF,EAAM4kB,OAAO,IAChC,IAAI2iI,EAAc7xH,EAAM,EAAG11B,EAAM4kB,OAAO,IACpCod,EAAQ,IAAIohE,EAAMvU,EAAK04D,GAC3B,OAAOvnJ,EAAMuzB,OAAOyO,Q,6GClDpBn/B,EAAO,SACPqxE,EAAe,CAAC,QAAS,UAClBszE,GAA8B,QAAQ3kJ,EAAMqxE,GAAexjB,IACpE,IAAI,MACF+1B,EAAK,OACLl4E,GACEmiD,EAoCJ,OAAO+1B,EAAM5jF,EAAM,CAEjB,eAAgB,SAAoB7C,EAAOgiC,GACzC,IACIzO,EADIhlB,EAAOvO,GACAuzB,OAAOyO,GAEtB,OAAOA,EAAMqqE,WAAa94E,EAASA,EAAO84B,WAE5C,gBAAiB,SAAqBrsD,EAAOgiC,GAC3C,OAAOhiC,EAAMuzB,OAAOyO,IAEtB,gBAAiBylH,EACjB,gBAAiBC,EAEjB,oBAAqB,SAAuB1nJ,EAAOgiC,EAAOozC,GACxD,OAAO7mE,GAAO,QAAMvO,IAAQuzB,OAAOyO,EAAOozC,OAAa/zE,GAAWgrD,WAEpE,yBAA0B,SAA0BrsD,EAAOgiC,EAAOozC,EAAapE,GAC7E,OAAOziE,GAAO,QAAMvO,IAAQuzB,OAAOyO,EAAOozC,EAAapE,GAAc3kB,WAEvE,qBAAsB,SAAwBrsD,EAAOgiC,EAAOozC,GAC1D,OAAOp1E,EAAM2vD,QAAQp8B,OAAOyO,EAAOozC,IAErC,0BAA2B,SAA2Bp1E,EAAOgiC,EAAOozC,EAAapE,GAC/E,OAAOhxE,EAAM2vD,QAAQp8B,OAAOyO,EAAOozC,EAAapE,IAElD,wBAAyB22E,EACzB,gCAAiCA,EACjC,qBAAsBC,OAW1B,SAASF,EAAcnlH,EAAKP,GAC1B,KAAK,QAAQA,GAEX,MAAM,IAAI3jC,UAAU,kBAGtB,GAA4B,IAAxB2jC,EAAMpd,OAAOjnB,OACf,MAAM,IAAI,IAAeqkC,EAAMpd,OAAOjnB,OAAQ,GAIhD,IAAIkqJ,EAAStlH,EAAI5kC,QACjB,QAAcqkC,EAAMtW,MAAM,GAAIm8H,IAC9B,QAAc7lH,EAAMpW,MAAM,GAAIi8H,GAC9B,IAAInyH,EAAQsM,EAAMyqE,UAAU,GACxBt4E,EAAS,GAIb,OAHAuB,EAAM7wB,SAAQ,SAAUC,GACtBqvB,GAAUoO,EAAIuiB,OAAOhgD,MAEhBqvB,EAcT,SAASwzH,EAAcplH,EAAKP,EAAOozC,EAAapE,GAC9C,IAAKhvC,IAA2B,IAAlBA,EAAM+6B,QAElB,MAAM,IAAI1+D,UAAU,kBAGtB,GAA4B,IAAxB2jC,EAAMpd,OAAOjnB,OACf,MAAM,IAAI,IAAeqkC,EAAMpd,OAAOjnB,OAAQ,GAGhD,QAAqB0D,IAAjB2vE,GACF,GAA4B,iBAAjBA,GAAqD,IAAxBA,EAAarzE,OACnD,MAAM,IAAIU,UAAU,kDAGtB2yE,EAAe,IAGjB,IAAIt7C,EAAQsM,EAAMyqE,UAAU,GAG5B,GAFU/2E,EAAM9Q,OAAO,KAEXwwD,EAAYz3E,OACtB,MAAM,IAAI,IAAe+3B,EAAM9Q,OAAO,GAAIwwD,EAAYz3E,QAIxD,IAAIkqJ,EAAStlH,EAAI5kC,QACjB,QAAcqkC,EAAMtW,MAAM,KAC1B,QAAcsW,EAAMpW,MAAM,IAI1B,IAFA,IAAIk8H,EAAQ,GAEHlqJ,EAAI,EAAGA,EAAIiqJ,EAAQjqJ,IAC1BkqJ,EAAMlqJ,GAAK2kC,EAAIuiB,OAAOlnD,GAOxB,GAJA83B,EAAM7wB,SAAQ,SAAUC,EAAGlH,GACzBkqJ,EAAMhjJ,GAAKswE,EAAYtwB,OAAOlnD,EAAE,OAG9BkqJ,EAAMnqJ,OAASkqJ,EACjB,IAAK,IAAItmJ,EAAKsmJ,EAAS,EAAGpuC,EAAOquC,EAAMnqJ,OAAQ4D,EAAKk4G,EAAMl4G,IACnDumJ,EAAMvmJ,KACTumJ,EAAMvmJ,GAAMyvE,GAKlB,OAAO82E,EAAM57G,KAAK,IAWpB,SAASu7G,EAAmB/nJ,EAAQsiC,GAClC,GAA4B,IAAxBA,EAAMpd,OAAOjnB,OACf,MAAM,IAAI,IAAeqkC,EAAMpd,OAAQ,GAGzC,IAAI7lB,EAAMijC,EAAMyqE,UAAU,GAE1B,GAAmB,iBAAR1tG,EACT,MAAM,IAAIV,UAAU,2DAGtB,OAAO,QAAgBqB,EAAQX,GAYjC,SAAS6oJ,EAAmBloJ,EAAQsiC,EAAOozC,GACzC,GAA4B,IAAxBpzC,EAAMpd,OAAOjnB,OACf,MAAM,IAAI,IAAeqkC,EAAMpd,OAAQ,GAGzC,IAAI7lB,EAAMijC,EAAMyqE,UAAU,GAE1B,GAAmB,iBAAR1tG,EACT,MAAM,IAAIV,UAAU,2DAItB,IAAI0pJ,GAAU,QAAMroJ,GAEpB,OADA,QAAgBqoJ,EAAShpJ,EAAKq2E,GACvB2yE,I,+ECpNL7zE,EAAe,CAAC,QAAS,SAAU,UAAW,UACvC8zE,GAA2B,QAF3B,MAEyC9zE,GAAexjB,IACjE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNyvB,EAAO,OACP9C,GACEjrB,EAiCJ,OAAO+1B,EAzCE,MAyCU,CAEjB,iBAAkB4/B,EAElB,qCAAsC,SAAoC/pD,EAAO4lC,GAC/E,OAAO,QAAO5lC,EAAO4lC,EAAI71C,UAAW47F,IAGtC,MAAO,SAAW1oH,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIlhC,UAAU,0CAGtB,OAAOgoH,EAAK9mF,MAWhB,SAAS0oH,EAASlhJ,EAAGC,GACnB,IACE,OAAO20E,EAAO50E,EAAGC,GAAKD,EAAIC,EAC1B,MAAOrF,GACP,MAAM,OAAoBA,EAAK,MAAOqF,IAW1C,SAASq/G,EAAK/pD,GACZ,IAAI3jC,EAaJ,IAZA,QAAY2jC,GAAO,SAAUt8D,GAC3B,IACMgK,MAAMhK,IAA2B,iBAAVA,EACzB24B,EAAM8P,UACWpnC,IAARs3B,GAAqBgjD,EAAO37E,EAAO24B,MAC5CA,EAAM34B,GAER,MAAO2B,GACP,MAAM,OAAoBA,EAAK,MAAO3B,YAI9BqB,IAARs3B,EACF,MAAM,IAAI0L,MAAM,0CAQlB,MAJmB,iBAAR1L,IACTA,EAAM8lD,EAAQ9lD,EAAKq2B,EAAO0gB,SAGrB/2C,O,yFCtGP91B,EAAO,OACPqxE,EAAe,CAAC,QAAS,MAAO,UACzBg0E,GAA4B,QAAQrlJ,EAAMqxE,GAAexjB,IAClE,IAAI,MACF+1B,EAAK,IACLjpE,EAAG,OACHipC,GACEiK,EA6BJ,OAAO+1B,EAAM5jF,EAAM,CAEjB,iBAAkBslJ,EAElB,qCAmBF,SAAmB7rF,EAAO4lC,GACxB,IACE,IAAI/sD,GAAM,QAAOmnB,EAAO4lC,EAAK1kF,GACzB3G,EAAI/Y,MAAMgD,QAAQw7D,IAAS,QAAUA,GAASA,EAAM13C,OACxD,OAAO6hC,EAAOtR,EAAKt+B,EAAEqrF,IACrB,MAAOvgG,GACP,MAAM,OAAoBA,EAAK,UAvBjC,MAAO,SAAW49B,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIlhC,UAAU,2CAGtB,OAAO8pJ,EAAM5oH,MA6BjB,SAAS4oH,EAAM7rF,GACb,IAAInnB,EACAuU,EAAM,EAUV,IATA,QAAY4S,GAAO,SAAUt8D,GAC3B,IACEm1C,OAAc9zC,IAAR8zC,EAAoBn1C,EAAQwd,EAAI23B,EAAKn1C,GAC3C0pD,IACA,MAAO/nD,GACP,MAAM,OAAoBA,EAAK,OAAQ3B,OAI/B,IAAR0pD,EACF,MAAM,IAAIrlB,MAAM,+CAGlB,OAAOoiB,EAAOtR,EAAKuU,Q,+EC5FnBwqB,EAAe,CAAC,QAAS,SAAU,UAAW,WACvCk0E,GAA2B,QAF3B,MAEyCl0E,GAAexjB,IACjE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,QACNyvB,EAAO,QACP/C,GACEhrB,EAiCJ,OAAO+1B,EAzCE,MAyCU,CAEjB,iBAAkB2/B,EAElB,qCAAsC,SAAoC9pD,EAAO4lC,GAC/E,OAAO,QAAO5lC,EAAO4lC,EAAI71C,UAAWg8F,IAGtC,MAAO,SAAW9oH,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIlhC,UAAU,0CAGtB,OAAO+nH,EAAK7mF,MAWhB,SAAS8oH,EAAUthJ,EAAGC,GACpB,IACE,OAAO00E,EAAQ30E,EAAGC,GAAKD,EAAIC,EAC3B,MAAOrF,GACP,MAAM,OAAoBA,EAAK,MAAOqF,IAW1C,SAASo/G,EAAK9pD,GACZ,IAAI5wC,EAaJ,IAZA,QAAY4wC,GAAO,SAAUt8D,GAC3B,IACMgK,MAAMhK,IAA2B,iBAAVA,EACzB0rB,EAAM+c,UACWpnC,IAARqqB,GAAqBgwD,EAAQ17E,EAAO0rB,MAC7CA,EAAM1rB,GAER,MAAO2B,GACP,MAAM,OAAoBA,EAAK,MAAO3B,YAI9BqB,IAARqqB,EACF,MAAM,IAAI2Y,MAAM,0CAQlB,MAJmB,iBAAR3Y,IACTA,EAAM+yD,EAAQ/yD,EAAKsjC,EAAO0gB,SAGrBhkD,O,iDCxGPwoD,EAAe,CAAC,QAAS,OAAQ,YAC1Bo0E,GAA2B,E,QAAA,IAF3B,MAEyCp0E,GAAexjB,IACjE,IAAI,MACF+1B,EAAK,KACLx5E,EAAI,SACJ2wE,GACEltB,EAsDJ,OAAO+1B,EA7DE,MA6DU,CAEjB,iBAAkB8hE,EAElB,yBAA0BA,EAE1B,qCAAsCA,EAEtC,6CAA8CA,EAE9C,MAAO,SAAWhpH,GAChB,OAAOgpH,EAAKhpH,MAIhB,SAASgpH,EAAKjsF,EAAOksF,GACnB,GAAqB,IAAjBlsF,EAAM3+D,OACR,MAAM,IAAIwoC,YAAY,6DAGxB,IACE,OAAOl5B,EAAK2wE,EAAStsB,MAAM,KAAMpuB,YACjC,MAAOvhC,GACP,MAAIA,aAAetD,YAAmD,IAAtCsD,EAAI2lB,QAAQ4N,QAAQ,aAC5C,IAAI72B,UAAUsD,EAAI2lB,QAAQ9iB,QAAQ,YAAa,SAE/C7C,Q,+ECpFVuyE,EAAe,CAAC,QAAS,SAAU,MAAO,WACnCu0E,GAA2B,QAF3B,MAEyCv0E,GAAexjB,IACjE,IAAI,MACF+1B,EAAK,OACLz3B,EAAM,IACNxxC,EAAG,QACHihE,GACE/tB,EAyBJ,OAAO+1B,EAjCE,MAiCU,CAEjB,iBAAkBiiE,EAElB,qCAsCF,SAAkBpsF,EAAO4lC,GACvB,IAEE,OADU,QAAO5lC,EAAO4lC,EAAK1kF,GAE7B,MAAO7b,GACP,MAAM,OAAoBA,EAAK,SAzCjC,MAAO,SAAW49B,GAChB,IAAI,QAAoBA,GACtB,MAAM,IAAIlhC,UAAU,0CAGtB,OAAOqqJ,EAAKnpH,MAUhB,SAASmpH,EAAKpsF,GACZ,IAAInnB,EAiBJ,OAhBA,QAAYmnB,GAAO,SAAUt8D,GAC3B,IACEm1C,OAAc9zC,IAAR8zC,EAAoBn1C,EAAQwd,EAAI23B,EAAKn1C,GAC3C,MAAO2B,GACP,MAAM,OAAoBA,EAAK,MAAO3B,YAI9BqB,IAAR8zC,IACFA,EAAMspC,EAAQ,EAAGzvB,EAAO0gB,SAGP,iBAARv6B,IACTA,EAAMspC,EAAQtpC,EAAK6Z,EAAO0gB,SAGrBv6B,O,2DC/DJ,SAAS49E,EAAoBpxH,EAAKgnJ,EAAQ3oJ,GAE/C,IAAI4oJ,EAEJ,OAAgD,IAA5CpnH,OAAO7/B,GAAKuzB,QAAQ,oBACtB0zH,EAAU1lH,UAAUvlC,OAAS,EAAI,YAAa,QAAOqC,GAAS,YAAc+/B,KAAKqC,UAAUpiC,GAAS,IAAM,WAAa2B,EAAIsC,KAAKmhJ,OAAS,IAClI,IAAI/mJ,UAAU,oBAAsBsqJ,EAAS,gCAAkCC,KAGxC,IAA5CpnH,OAAO7/B,GAAKuzB,QAAQ,oBACtB0zH,EAAU1lH,UAAUvlC,OAAS,EAAI,YAAa,QAAOqC,GAAS,YAAc+/B,KAAKqC,UAAUpiC,GAAS,IAAM,GACnG,IAAI3B,UAAU,oBAAsBsqJ,EAAS,wDAA0DC,IAGzGjnJ,I,yFCtBLknJ,EAAwB,WACxBhmJ,EAAO,WACPqxE,EAAe,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,SACpE40E,GAAgC,QAAQjmJ,EAAMqxE,GAAexjB,IACtE,IAAI,MACF+1B,EAAK,IACLjpE,EAAG,SACHmvC,EAAQ,SACR98C,EAAQ,OACR42C,EAAM,MACN6K,EAAK,MACLtnD,GACE0mD,EAuDJ,OAAO+1B,EAAM5jF,EAAM,CAEjB,iBAAkB,SAAqBy5D,GACrC,OAAOysF,EAAKzsF,EAAOusF,IAGrB,yBAA0BE,EAE1B,qCAAsC,SAAoCzsF,EAAO4lC,GAC/E,OAAO8mD,EAAQ1sF,EAAO4lC,EAAK2mD,IAG7B,6CAA8CG,EAE9C,MAAO,SAAWzpH,GAChB,OAAOwpH,EAAKxpH,EAAMspH,MAetB,SAASE,EAAKzsF,EAAOksF,GACnB,IAAIrzG,EACAuU,EAAM,EAEV,GAAqB,IAAjB4S,EAAM3+D,OACR,MAAM,IAAIwoC,YAAY,kEAYxB,IARA,QAAYm2B,GAAO,SAAUt8D,GAC3B,IACEm1C,OAAc9zC,IAAR8zC,EAAoBn1C,EAAQwd,EAAI23B,EAAKn1C,GAC3C0pD,IACA,MAAO/nD,GACP,MAAM,OAAoBA,EAAK,WAAY3B,OAGnC,IAAR0pD,EAAW,MAAM,IAAIrlB,MAAM,+CAC/B,IAAIv+B,EAAO2gD,EAAOtR,EAAKuU,GAQvB,GANAvU,OAAM9zC,GACN,QAAYi7D,GAAO,SAAUt8D,GAC3B,IAAI4Q,EAAO+7C,EAAS3sD,EAAO8F,GAC3BqvC,OAAc9zC,IAAR8zC,EAAoBtlC,EAASe,EAAMA,GAAQ4M,EAAI23B,EAAKtlC,EAASe,EAAMA,OAGvE5G,EAAMmrC,GACR,OAAOA,EAGT,OAAQqzG,GACN,IAAK,cACH,OAAO/hG,EAAOtR,EAAKuU,GAErB,IAAK,SACH,OAAOjD,EAAOtR,EAAKuU,EAAM,GAE3B,IAAK,WAED,IAAI2yD,GAAO,QAAYlnE,GAAOA,EAAIyV,IAAI,GAAK,EAC3C,OAAe,IAARlB,EAAY2yD,EAAO51D,EAAOtR,EAAKuU,EAAM,GAGhD,QACE,MAAM,IAAIrlB,MAAM,0BAA4BmkH,EAA5B,gEAItB,SAASQ,EAAQ1sF,EAAO4lC,EAAKsmD,GAC3B,IACE,GAAqB,IAAjBlsF,EAAM3+D,OACR,MAAM,IAAIwoC,YAAY,kEAGxB,OAAOmrB,EAAMgL,EAAO4lC,GAAKn7F,GAAKgiJ,EAAKhiJ,EAAGyhJ,KACtC,MAAO7mJ,GACP,MAAM,OAAoBA,EAAK,kB,oPChJ9B,SAASulH,EAAUngH,GAGxB,IAFA,IAAI8P,EAAI,GAED/Y,MAAMgD,QAAQiG,IACnB8P,EAAEnV,KAAKqF,EAAEpJ,QACToJ,EAAIA,EAAE,GAGR,OAAO8P,EAYT,SAAS6tG,EAAUpoD,EAAO13C,EAAMs9E,GAC9B,IAAItkG,EACAF,EAAM4+D,EAAM3+D,OAEhB,GAAID,IAAQknB,EAAKs9E,GACf,MAAM,IAAI,IAAexkG,EAAKknB,EAAKs9E,IAGrC,GAAIA,EAAMt9E,EAAKjnB,OAAS,EAAG,CAEzB,IAAIsrJ,EAAU/mD,EAAM,EAEpB,IAAKtkG,EAAI,EAAGA,EAAIF,EAAKE,IAAK,CACxB,IAAI41C,EAAQ8oB,EAAM1+D,GAElB,IAAKE,MAAMgD,QAAQ0yC,GACjB,MAAM,IAAI,IAAe5uB,EAAKjnB,OAAS,EAAGinB,EAAKjnB,OAAQ,KAGzD+mH,EAAUpoD,EAAM1+D,GAAIgnB,EAAMqkI,SAI5B,IAAKrrJ,EAAI,EAAGA,EAAIF,EAAKE,IACnB,GAAIE,MAAMgD,QAAQw7D,EAAM1+D,IACtB,MAAM,IAAI,IAAegnB,EAAKjnB,OAAS,EAAGinB,EAAKjnB,OAAQ,KAcxD,SAASgxH,EAASryD,EAAO13C,GAG9B,GAF+B,IAAhBA,EAAKjnB,QAIlB,GAAIG,MAAMgD,QAAQw7D,GAChB,MAAM,IAAI,IAAeA,EAAM3+D,OAAQ,QAIzC+mH,EAAUpoD,EAAO13C,EAAM,GAUpB,SAASskI,EAAclnH,EAAOrkC,GACnC,KAAK,QAASqkC,MAAW,OAAUA,GACjC,MAAM,IAAI3jC,UAAU,oCAAsC2jC,EAAQ,KAGpE,GAAIA,EAAQ,GAAuB,iBAAXrkC,GAAuBqkC,GAASrkC,EACtD,MAAM,IAAI,IAAWqkC,EAAOrkC,GAczB,SAASw4F,EAAO75B,EAAO13C,EAAMosD,GAGlC,IAAKlzE,MAAMgD,QAAQw7D,KAAWx+D,MAAMgD,QAAQ8jB,GAC1C,MAAM,IAAIvmB,UAAU,kBAGtB,GAAoB,IAAhBumB,EAAKjnB,OACP,MAAM,IAAI0mC,MAAM,uCAclB,OAVAzf,EAAK/f,SAAQ,SAAU7E,GACrB,KAAK,QAASA,MAAW,OAAUA,IAAUA,EAAQ,EACnD,MAAM,IAAI3B,UAAU,wDAA8D,QAAOumB,GAAQ,QAMrGsoF,EAAQ5wC,EAAO13C,EAAM,OAFgBvjB,IAAjB2vE,EAA6BA,EAAe,GAIzD1U,EAYT,SAAS4wC,EAAQ5wC,EAAO13C,EAAMs9E,EAAKlxB,GACjC,IAAIpzE,EACAmzB,EACAo4H,EAAS7sF,EAAM3+D,OACfyrJ,EAASxkI,EAAKs9E,GACdx/F,EAASiG,KAAK+iB,IAAIy9H,EAAQC,GAI9B,GAFA9sF,EAAM3+D,OAASyrJ,EAEXlnD,EAAMt9E,EAAKjnB,OAAS,EAAG,CAEzB,IAAIsrJ,EAAU/mD,EAAM,EAEpB,IAAKtkG,EAAI,EAAGA,EAAI8E,EAAQ9E,IAEtBmzB,EAAOurC,EAAM1+D,GAERE,MAAMgD,QAAQiwB,KACjBA,EAAO,CAACA,GAERurC,EAAM1+D,GAAKmzB,GAGbm8E,EAAQn8E,EAAMnM,EAAMqkI,EAASj4E,GAI/B,IAAKpzE,EAAI8E,EAAQ9E,EAAIwrJ,EAAQxrJ,IAE3BmzB,EAAO,GACPurC,EAAM1+D,GAAKmzB,EAEXm8E,EAAQn8E,EAAMnM,EAAMqkI,EAASj4E,OAE1B,CAGL,IAAKpzE,EAAI,EAAGA,EAAI8E,EAAQ9E,IACtB,KAAOE,MAAMgD,QAAQw7D,EAAM1+D,KACzB0+D,EAAM1+D,GAAK0+D,EAAM1+D,GAAG,GAKxB,IAAKA,EAAI8E,EAAQ9E,EAAIwrJ,EAAQxrJ,IAC3B0+D,EAAM1+D,GAAKozE,GAgBV,SAASolB,EAAQ95B,EAAOkhD,GAC7B,IAAI6rC,EAAY37G,EAAQ4uB,GACpBoxC,EAAgB27C,EAAU1rJ,OAE9B,IAAKG,MAAMgD,QAAQw7D,KAAWx+D,MAAMgD,QAAQ08G,GAC1C,MAAM,IAAIn/G,UAAU,kBAGtB,GAAqB,IAAjBm/G,EAAM7/G,OACR,MAAM,IAAI,IAAe,EAAG+vG,EAAe,MAI7C,IAAI47C,EAAYhxC,EADhBkF,EAAQ+rC,EAAqB/rC,EAAO9P,IAGpC,GAAIA,IAAkB47C,EACpB,MAAM,IAAI,IAAeA,EAAW57C,EAAe,MAGrD,IACE,OA2DJ,SAAkBpxC,EAAOkhD,GAKvB,IAHA,IACIgsC,EADAC,EAAWntF,EAGNotF,EAAYlsC,EAAM7/G,OAAS,EAAG+rJ,EAAY,EAAGA,IAAa,CACjE,IAAI9kI,EAAO44F,EAAMksC,GACjBF,EAAY,GAIZ,IAFA,IAAI7rJ,EAAS8rJ,EAAS9rJ,OAASinB,EAEtBhnB,EAAI,EAAGA,EAAID,EAAQC,IAC1B4rJ,EAAU9nJ,KAAK+nJ,EAASznJ,MAAMpE,EAAIgnB,GAAOhnB,EAAI,GAAKgnB,IAIpD6kI,EAAWD,EAGb,OAAOC,EA9EEE,CAASN,EAAW7rC,GAC3B,MAAOz5G,GACP,GAAIA,aAAa,IACf,MAAM,IAAI,IAAeulJ,EAAW57C,EAAe,MAGrD,MAAM3pG,GAWH,SAASwlJ,EAAqB/rC,EAAO9P,GAC1C,IAAI47C,EAAYhxC,EAAQkF,GACpBosC,EAAiBpsC,EAAMx7G,QAEvB6nJ,EAAgBrsC,EAAMtoF,SADX,GAIf,GAF4BsoF,EAAMtoF,SAFnB,EAEqC20H,EAAgB,IAAM,EAGxE,MAAM,IAAIxlH,MAAM,mCAMlB,GAHkBwlH,GAAiB,EAGlB,CACf,GAHuBn8C,EAAgB47C,GAAc,EAMnD,MAAM,IAAIjlH,MAAM,qCAAuCqpE,EAAgB,uBAAyB47C,GAFhGM,EAAeC,IAAkBn8C,EAAgB47C,EAMrD,OAAOM,EAQT,SAAStxC,EAAQh8C,GACf,OAAOA,EAAM/6B,QAAO,CAAC+I,EAAMC,IAASD,EAAOC,GAAM,GAwC5C,SAAS+rD,EAAQh6B,EAAO13C,GAG7B,IAFA,IAAI/N,EAAI+N,GAAQsiG,EAAU5qD,GAEnBx+D,MAAMgD,QAAQw7D,IAA2B,IAAjBA,EAAM3+D,QACnC2+D,EAAQA,EAAM,GACdzlD,EAAEkzC,QAMJ,IAFA,IAAIyiD,EAAO31F,EAAElZ,OAEU,IAAhBkZ,EAAE21F,EAAO,IACdA,IASF,OALIA,EAAO31F,EAAElZ,SACX2+D,EAAQwtF,EAASxtF,EAAOkwC,EAAM,GAC9B31F,EAAElZ,OAAS6uG,GAGNlwC,EAWT,SAASwtF,EAASxtF,EAAOkwC,EAAMtK,GAC7B,IAAItkG,EAAGylG,EAEP,GAAInB,EAAMsK,EAAM,CACd,IAAIhrG,EAAO0gG,EAAM,EAEjB,IAAKtkG,EAAI,EAAGylG,EAAK/mC,EAAM3+D,OAAQC,EAAIylG,EAAIzlG,IACrC0+D,EAAM1+D,GAAKksJ,EAASxtF,EAAM1+D,GAAI4uG,EAAMhrG,QAGtC,KAAO1D,MAAMgD,QAAQw7D,IACnBA,EAAQA,EAAM,GAIlB,OAAOA,EAgBF,SAASytF,EAAUztF,EAAOkwC,EAAMhlC,EAAO5iD,GAC5C,IAAI/N,EAAI+N,GAAQsiG,EAAU5qD,GAE1B,GAAIkL,EACF,IAAK,IAAI5pE,EAAI,EAAGA,EAAI4pE,EAAO5pE,IACzB0+D,EAAQ,CAACA,GACTzlD,EAAEo7B,QAAQ,GAOd,IAFAqqB,EAAQ0tF,EAAW1tF,EAAOkwC,EAAM,GAEzB31F,EAAElZ,OAAS6uG,GAChB31F,EAAEnV,KAAK,GAGT,OAAO46D,EAWT,SAAS0tF,EAAW1tF,EAAOkwC,EAAMtK,GAC/B,IAAItkG,EAAGylG,EAEP,GAAIvlG,MAAMgD,QAAQw7D,GAAQ,CACxB,IAAI96D,EAAO0gG,EAAM,EAEjB,IAAKtkG,EAAI,EAAGylG,EAAK/mC,EAAM3+D,OAAQC,EAAIylG,EAAIzlG,IACrC0+D,EAAM1+D,GAAKosJ,EAAW1tF,EAAM1+D,GAAI4uG,EAAMhrG,QAGxC,IAAK,IAAIgL,EAAI01F,EAAK11F,EAAIggG,EAAMhgG,IAC1B8vD,EAAQ,CAACA,GAIb,OAAOA,EAUF,SAAS5uB,EAAQ4uB,GACtB,IAAKx+D,MAAMgD,QAAQw7D,GAEjB,OAAOA,EAGT,IAAIshD,EAAO,GAQX,OAPAthD,EAAMz3D,SAAQ,SAASuS,EAASpX,GAC1BlC,MAAMgD,QAAQd,GAChBA,EAAM6E,QAAQuS,GAEdwmG,EAAKl8G,KAAK1B,MAGP49G,EAQF,SAAS/jG,EAAIyiD,EAAOllD,GACzB,OAAOtZ,MAAMqB,UAAU0a,IAAIja,KAAK08D,EAAOllD,GAQlC,SAASvS,EAAQy3D,EAAOllD,GAC7BtZ,MAAMqB,UAAU0F,QAAQjF,KAAK08D,EAAOllD,GAQ/B,SAAS/G,EAAOisD,EAAOllD,GAC5B,GAAgC,IAA5B8vG,EAAU5qD,GAAO3+D,OACnB,MAAM,IAAI0mC,MAAM,2CAGlB,OAAOvmC,MAAMqB,UAAUkR,OAAOzQ,KAAK08D,EAAOllD,GAUrC,SAAS6yI,EAAa3tF,EAAOmM,GAClC,GAAgC,IAA5By+C,EAAU5qD,GAAO3+D,OACnB,MAAM,IAAI0mC,MAAM,2CAGlB,OAAOvmC,MAAMqB,UAAUkR,OAAOzQ,KAAK08D,GAAOtnC,GAASyzC,EAAO3lE,KAAKkyB,KAQ1D,SAASkX,EAAKowB,EAAO4tF,GAC1B,OAAOpsJ,MAAMqB,UAAU+sC,KAAKtsC,KAAK08D,EAAO4tF,GAQnC,SAASC,EAAS99I,GACvB,IAAKvO,MAAMgD,QAAQuL,GACjB,MAAM,IAAIhO,UAAU,wBAGtB,GAAiB,IAAbgO,EAAE1O,OACJ,OAAO0O,EAGT,IAAIC,EAAI,GACJs2B,EAAQ,EACZt2B,EAAE,GAAK,CACLtM,MAAOqM,EAAE,GACT20E,WAAY,GAGd,IAAK,IAAIpjF,EAAI,EAAGA,EAAIyO,EAAE1O,OAAQC,IACxByO,EAAEzO,KAAOyO,EAAEzO,EAAI,GACjBglC,IAEAA,EAAQ,EAGVt2B,EAAE5K,KAAK,CACL1B,MAAOqM,EAAEzO,GACTojF,WAAYp+C,IAIhB,OAAOt2B,EAQF,SAAS89I,EAAW/9I,GACzB,IAAKvO,MAAMgD,QAAQuL,GACjB,MAAM,IAAIhO,UAAU,wBAGtB,GAAiB,IAAbgO,EAAE1O,OACJ,OAAO0O,EAKT,IAFA,IAAIC,EAAI,GAEC1O,EAAI,EAAGA,EAAIyO,EAAE1O,OAAQC,IAC5B0O,EAAE5K,KAAK2K,EAAEzO,GAAGoC,OAGd,OAAOsM,EAYF,SAAS+9I,EAAiB/tF,EAAOg8B,GAKtC,IAJA,IAAIh1F,EAEA3F,EAAS,EAEJC,EAAI,EAAGA,EAAI0+D,EAAM3+D,OAAQC,IAAK,CACrC,IAAIy4E,EAAO/Z,EAAM1+D,GACbkD,EAAUhD,MAAMgD,QAAQu1E,GAO5B,GALU,IAANz4E,GAAWkD,IACbnD,EAAS04E,EAAK14E,QAIZmD,GAAWu1E,EAAK14E,SAAWA,EAC7B,OAGF,IAAI2sJ,EAAWxpJ,EAAUupJ,EAAiBh0E,EAAMiiB,GAC9CA,EAAOjiB,GAET,QAAah1E,IAATiC,EACFA,EAAOgnJ,OACF,GAAIhnJ,IAASgnJ,EAClB,MAAO,QAKX,OAAOhnJ,I,oHC/kBF,SAASinJ,EAAoBjuF,GAClC,IAAK,IAAI1+D,EAAI,EAAGA,EAAI0+D,EAAM3+D,OAAQC,IAChC,IAAI,QAAa0+D,EAAM1+D,IACrB,OAAO,EAIX,OAAO,EAUF,SAAS4sJ,EAAYluF,EAAOllD,IAC7B,QAASklD,KACXA,EAAQA,EAAMjQ,WAGhB,IAAK,IAAIzuD,EAAI,EAAGylG,EAAK/mC,EAAM3+D,OAAQC,EAAIylG,EAAIzlG,IAAK,CAC9C,IAAIoC,EAAQs8D,EAAM1+D,GAEdE,MAAMgD,QAAQd,GAChBwqJ,EAAYxqJ,EAAOoX,GAEnBA,EAASpX,IAiBR,SAASyqJ,EAAQnuF,EAAOllD,EAAUkxF,GACvC,OAAIhsC,GAA8B,mBAAdA,EAAMziD,IAEjByiD,EAAMziD,KAAI,SAAU9S,GACzB,OAAO0jJ,EAAQ1jJ,EAAGqQ,EAAUkxF,MAGvBlxF,EAASklD,GAab,SAAS/6B,EAAO4/F,EAAKj/B,EAAK9qF,GAC/B,IAAIwN,EAAO9mB,MAAMgD,QAAQqgI,IAAO,QAAUA,GAAOA,EAAIv8G,OAErD,GAAIs9E,EAAM,GAAKA,GAAOt9E,EAAKjnB,OAEzB,MAAM,IAAI,IAAWukG,EAAKt9E,EAAKjnB,QAGjC,OAAI,QAASwjI,GACJA,EAAI3gI,OAAOkqJ,EAAQvpB,EAAI90E,UAAW61C,EAAK9qF,IAEvCszI,EAAQvpB,EAAKj/B,EAAK9qF,GAY7B,SAASszI,EAAQvpB,EAAKj/B,EAAK9qF,GACzB,IAAIxZ,EAAG2qC,EAAKlvB,EAAKqsI,EAEjB,GAAIxjD,GAAO,EAAG,CACZ,GAAKpkG,MAAMgD,QAAQqgI,EAAI,IAQhB,CAIL,IAHAukB,EA2BN,SAAiBvkB,GACf,IAEIvjI,EAAGyuB,EAFHw7E,EAAIs5B,EAAIxjI,OACR8qH,EAAI0Y,EAAI,GAAGxjI,OAEX4qC,EAAM,GAEV,IAAKlc,EAAI,EAAGA,EAAIo8F,EAAGp8F,IAAK,CACtB,IAAI+a,EAAM,GAEV,IAAKxpC,EAAI,EAAGA,EAAIiqG,EAAGjqG,IACjBwpC,EAAI1lC,KAAKy/H,EAAIvjI,GAAGyuB,IAGlBkc,EAAI7mC,KAAK0lC,GAGX,OAAOmB,EA3CIo9G,CAAQxkB,GACf54F,EAAM,GAED3qC,EAAI,EAAGA,EAAI8nJ,EAAK/nJ,OAAQC,IAC3B2qC,EAAI3qC,GAAK8sJ,EAAQhF,EAAK9nJ,GAAIskG,EAAM,EAAG9qF,GAGrC,OAAOmxB,EAbP,IAFAlvB,EAAM8nH,EAAI,GAELvjI,EAAI,EAAGA,EAAIujI,EAAIxjI,OAAQC,IAC1Byb,EAAMjC,EAASiC,EAAK8nH,EAAIvjI,IAG1B,OAAOyb,EAcT,IAFAkvB,EAAM,GAED3qC,EAAI,EAAGA,EAAIujI,EAAIxjI,OAAQC,IAC1B2qC,EAAI3qC,GAAK8sJ,EAAQvpB,EAAIvjI,GAAIskG,EAAM,EAAG9qF,GAGpC,OAAOmxB,EA+BJ,SAASoiH,EAAQt+I,EAAGggB,EAAGplB,EAAGF,EAAGimB,EAAGozF,EAAM3vF,EAAQhkB,EAAGwD,EAAS26I,EAAQ5qJ,GAEvE,IAII8rC,EAAGsO,EAAIK,EAAI78C,EAJX0iH,EAAUj0G,EAAE0vG,QACZwE,EAASl0G,EAAE2vG,OACXwE,EAAOn0G,EAAE4vG,KAIb,GAAIl1G,EAEF,IAAKqzC,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAI/C7kC,EAFJrJ,EAAI2iH,EAAOz0E,MAEEs0E,GAEXn5G,EAAErJ,GAAKwiH,EAEP3vF,EAAO/uB,KAAK9D,GAERgtJ,GAEF7jJ,EAAEnJ,GAAKqS,EAAUxD,EAAE6zG,EAAQx0E,GAAI9rC,GAASyM,EAAEzM,EAAOsgH,EAAQx0E,IAEzD9e,EAAEpvB,GAAKwiH,GAGPr5G,EAAEnJ,GAAK0iH,EAAQx0E,KAIjB/kC,EAAEnJ,GAAKqS,EAAUxD,EAAE6zG,EAAQx0E,GAAI/kC,EAAEnJ,IAAM6O,EAAE1F,EAAEnJ,GAAI0iH,EAAQx0E,IAEvD9e,EAAEpvB,GAAKwiH,QAKX,IAAKhmE,EAAKomE,EAAKn0F,GAAIouB,EAAK+lE,EAAKn0F,EAAI,GAAIyf,EAAIsO,EAAItO,EAAI2O,EAAI3O,IAI/C7kC,EAFJrJ,EAAI2iH,EAAOz0E,MAEEs0E,GAEXn5G,EAAErJ,GAAKwiH,EAEP3vF,EAAO/uB,KAAK9D,IAGZovB,EAAEpvB,GAAKwiH,I,gGCrMf,SAASyqC,EAAgBnrJ,EAAQqiC,GAE/B,GAAImjC,EAAcxlE,IAAWorJ,EAAeprJ,EAAQqiC,GAClD,OAAOriC,EAAOqiC,GAGhB,GAA4B,mBAAjBriC,EAAOqiC,IAAwBgpH,EAAarrJ,EAAQqiC,GAC7D,MAAM,IAAIsC,MAAM,yBAA2BtC,EAAO,mBAGpD,MAAM,IAAIsC,MAAM,0BAA4BtC,EAAO,KAcrD,SAASipH,EAAgBtrJ,EAAQqiC,EAAM/hC,GAErC,GAAIklE,EAAcxlE,IAAWorJ,EAAeprJ,EAAQqiC,GAElD,OADAriC,EAAOqiC,GAAQ/hC,EACRA,EAGT,MAAM,IAAIqkC,MAAM,0BAA4BtC,EAAO,KAUrD,SAAS+oH,EAAeprJ,EAAQqiC,GAC9B,SAAKriC,GAA4B,iBAAXA,KAMlB,QAAeurJ,EAAsBlpH,KAMrCA,KAAQljC,OAAOM,WASf4iC,KAAQuhC,SAASnkE,YAkBvB,SAAS+rJ,EAAmBxrJ,EAAQya,GAClC,IAAK4wI,EAAarrJ,EAAQya,GACxB,MAAM,IAAIkqB,MAAM,wBAA0BlqB,EAAS,KAYvD,SAAS4wI,EAAarrJ,EAAQya,GAC5B,QAAIza,SAAqE,mBAAnBA,EAAOya,KAOzD,QAAeza,EAAQya,IAAWtb,OAAOgB,gBAAkBsa,KAAUtb,OAAOgB,eAAeH,MAM3F,QAAeyrJ,EAAmBhxI,KAMlCA,KAAUtb,OAAOM,WASjBgb,KAAUmpD,SAASnkE,YAUzB,SAAS+lE,EAAcxlE,GACrB,MAAyB,iBAAXA,GAAuBA,GAAUA,EAAOe,cAAgB5B,OAGxE,IAAIosJ,EAAuB,CACzBttJ,QAAQ,EACRkF,MAAM,GAEJsoJ,EAAoB,CACtBvoJ,UAAU,EACVypD,SAAS,EACT++F,gBAAgB,I,4DChIX,SAASh3E,EAAQvxE,EAAMqxE,EAAc1zE,EAAQ6qJ,GAClD,SAASC,EAAgBh3E,GAIvB,IAAIi3E,GAAO,QAAYj3E,EAAOJ,EAAar6D,IAAI2xI,IAE/C,OAqFG,SAA4B3oJ,EAAMqxE,EAAcI,GAIrD,IAHiBJ,EAAa7jE,QAAOo7I,IAShC,SAA8BA,GACnC,OAAOA,GAAgC,MAAlBA,EAAW,GAVoBC,CAAqBD,KACxEv1E,OAAMu1E,QAAoCpqJ,IAAtBizE,EAAMm3E,KAEV,CACf,IAAIE,EAAsBz3E,EAAa7jE,QAAOo7I,QAAoCpqJ,IAAtBizE,EAAMm3E,KAElE,MAAM,IAAIpnH,MAAM,2BAA4Be,OAAOviC,EAAM,OAAU,kCAAkCuiC,OAAOumH,EAAoB9xI,KAAIrN,GAAK,IAAK44B,OAAO54B,EAAG,OAAO0/B,KAAK,MAAO,OA7F3K0/G,CAAmB/oJ,EAAMqxE,EAAcI,GAChC9zE,EAAO+qJ,GAWhB,OARAD,EAAgBO,WAAY,EAC5BP,EAAgBvpG,GAAKl/C,EACrByoJ,EAAgBp3E,aAAeA,EAAalyE,QAAQm2C,OAEhDkzG,IACFC,EAAgBD,KAAOA,GAGlBC,EAuFF,SAASE,EAAsBC,GACpC,OAAOA,GAAgC,MAAlBA,EAAW,GAAaA,EAAWzpJ,MAAM,GAAKypJ,I,0BClI9D,SAASK,EAASxkH,GACvB,IAAI1iB,EAAO,EACPnlB,EAAO,EACPssJ,EAAQltJ,OAAO2B,OAAO,MACtBqZ,EAAMhb,OAAO2B,OAAO,MACpBwhC,EAAQ,EAER0zE,EAAM,SAAa1tG,GACrB,IAAI67H,EAAWhqH,EAAI7R,GACnB,GAAK67H,WACEkoB,EAAMloB,UACNhqH,EAAI7R,KACT4c,EACEnlB,IAASokI,GAAb,CAEA,IAAKj/G,EAGH,OAFAod,EAAQ,OACRviC,EAAO,GAIT,MAAQE,eAAeC,KAAKmsJ,IAAStsJ,QAMvC,OADA6nC,EAAQ3+B,KAAK0F,IAAIi5B,GACV,CACL0kH,IAAK,SAAahkJ,GAChB,IAAI67H,EAAWhqH,EAAI7R,GACfikJ,IAAYjqH,EAIhB,GAHA+pH,EAAME,GAAWjkJ,EACjB6R,EAAI7R,GAAMikJ,GAELpoB,EAAU,CAEb,KADEj/G,GACU0iB,EAAO,OAGnB,OAFAt/B,EAAK+jJ,EAAMtsJ,GACXi2G,EAAI1tG,GACGA,EAIT,UADO+jJ,EAAMloB,GACTpkI,IAASokI,EAEb,MAAQlkI,eAAeC,KAAKmsJ,IAAStsJ,OAMvCysJ,OAAQx2C,EACR/6C,MAAO,WACL/1C,EAAOod,EAAQ,EACfviC,EAAO,EACPssJ,EAAQltJ,OAAO2B,OAAO,MACtBqZ,EAAMhb,OAAO2B,OAAO,QCzCnB,SAAS6tE,EAAQtsB,GACtB,IAAI,OACF6jD,EAAM,MACNt+D,GACEpE,UAAUvlC,OAAS,QAAsB0D,IAAjB6hC,UAAU,GAAmBA,UAAU,GAAK,GAGxE,OAFAoE,EAAiB,MAATA,EAAgBz+B,OAAOuoC,kBAAoB9J,EACnDs+D,EAAmB,MAAVA,EAAiB7lE,KAAKqC,UAAYwjE,EACpC,SAASv3B,IACe,iBAAlBA,EAAQzG,QACjByG,EAAQzG,MAAQ,CACdnoC,OAAQ,IAAI5R,IACZs+H,IAAKL,EAASxkH,GAASz+B,OAAOuoC,qBAMlC,IAFA,IAAI7R,EAAO,GAEF3hC,EAAI,EAAGA,EAAIslC,UAAUvlC,OAAQC,IACpC2hC,EAAK3hC,GAAKslC,UAAUtlC,GAGtB,IAAIwuJ,EAAOxmD,EAAOrmE,GAElB,GAAI8uC,EAAQzG,MAAMnoC,OAAOvX,IAAIkkI,GAE3B,OADA/9E,EAAQzG,MAAMukF,IAAIH,IAAII,GACf/9E,EAAQzG,MAAMnoC,OAAOjgC,IAAI4sJ,GAGlC,IAAIC,EAAStqG,EAAGuP,MAAMvP,EAAIxiB,GAG1B,OAFA8uC,EAAQzG,MAAMnoC,OAAO1R,IAAIq+H,EAAMC,GAC/Bh+E,EAAQzG,MAAMnoC,OAAOysH,OAAO79E,EAAQzG,MAAMukF,IAAIH,IAAII,IAC3CC,GAqDJ,SAASC,EAAiBvqG,GAC/B,OAAOljD,OAAO4G,KAAKs8C,EAAGklC,YAAc,IAAI1lD,QAAO,SAAUhC,EAAMwnD,GAC7D,IAAInkD,GAASmkD,EAAUlgD,MAAM,OAAS,IAAIlpC,OAAS,EACnD,OAAOgL,KAAKijB,IAAI2T,EAAMqD,MACpB,G,wDC7FC,SAAS2pH,EAASxlJ,GACvB,MAAoB,iBAANA,EAET,SAASkhG,EAAYlhG,GAC1B,OAAOA,IAA6C,IAAxCA,EAAEtG,YAAYtB,UAAU8oG,cAAwB,EAEvD,SAASukD,EAAUzlJ,GACxB,OAAOA,GAAkB,iBAANA,IAAyD,IAAvClI,OAAOgB,eAAekH,GAAGylJ,YAAsB,EAE/E,SAASC,EAAW1lJ,GACzB,OAAOA,GAAkB,iBAANA,IAA0D,IAAxClI,OAAOgB,eAAekH,GAAG0lJ,aAAuB,EAEhF,SAASvtE,EAAOn4E,GACrB,OAAOA,IAAwC,IAAnCA,EAAEtG,YAAYtB,UAAU+/E,SAAmB,EAElD,SAASrM,EAAS9rE,GACvB,MAAoB,iBAANA,E,wWAET,IAAIjG,EAAUhD,MAAMgD,QACpB,SAASqnG,EAASphG,GACvB,OAAOA,IAA0C,IAArCA,EAAEtG,YAAYtB,UAAUgpG,WAAqB,EAQpD,SAASukD,EAAa3lJ,GAC3B,OAAOjJ,MAAMgD,QAAQiG,IAAMohG,EAASphG,GAE/B,SAASumG,EAAcvmG,GAC5B,OAAOA,GAAKA,EAAEumG,gBAAsD,IAArCvmG,EAAEtG,YAAYtB,UAAUgpG,WAAqB,EAEvE,SAASkV,EAAet2G,GAC7B,OAAOA,GAAKA,EAAEs2G,iBAAuD,IAArCt2G,EAAEtG,YAAYtB,UAAUgpG,WAAqB,EAExE,SAAS1C,EAAQ1+F,GACtB,OAAOA,IAAyC,IAApCA,EAAEtG,YAAYtB,UAAUsmG,UAAoB,EAEnD,SAAS1oC,EAAQh2D,GACtB,OAAOA,IAAyC,IAApCA,EAAEtG,YAAYtB,UAAU49D,UAAoB,EAEnD,SAAS4vF,EAAU5lJ,GACxB,MAAoB,kBAANA,EAET,SAASi+F,EAAYj+F,GAC1B,OAAOA,IAA6C,IAAxCA,EAAEtG,YAAYtB,UAAU6lG,cAAwB,EAEvD,SAAS1U,EAAOvpF,GACrB,OAAOA,IAAwC,IAAnCA,EAAEtG,YAAYtB,UAAUmxF,SAAmB,EAElD,SAASx4B,EAAW/wD,GACzB,MAAoB,mBAANA,EAET,SAAS6lJ,EAAO7lJ,GACrB,OAAOA,aAAak3B,KAEf,SAAS4uH,EAAS9lJ,GACvB,OAAOA,aAAaq2B,OAEf,SAAS0hC,EAAS/3D,GACvB,SAAUA,GAAkB,iBAANA,GAAkBA,EAAEtG,cAAgB5B,QAAW2tJ,EAAUzlJ,IAAO0lJ,EAAW1lJ,IAE5F,SAAS+lJ,EAAO/lJ,GACrB,OAAa,OAANA,EAEF,SAASmsC,EAAYnsC,GAC1B,YAAa1F,IAAN0F,EAEF,SAAS+gF,EAAe/gF,GAC7B,OAAOA,IAA0B,IAArBA,EAAE+gF,iBAA8D,IAAnC/gF,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE/E,SAAS2B,EAAYpvE,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEovE,cAA2D,IAAnCpvE,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE5E,SAASyU,EAAiBliF,GAC/B,OAAOA,IAA4B,IAAvBA,EAAEkiF,mBAAgE,IAAnCliF,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAEjF,SAASuC,EAAYhwE,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEgwE,cAA2D,IAAnChwE,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE5E,SAAS2O,EAAkBp8E,GAChC,OAAOA,IAA6B,IAAxBA,EAAEo8E,oBAAiE,IAAnCp8E,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAElF,SAAS6K,EAAet4E,GAC7B,OAAOA,IAA0B,IAArBA,EAAEs4E,iBAA8D,IAAnCt4E,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE/E,SAASoS,EAAyB7/E,GACvC,OAAOA,IAAoC,IAA/BA,EAAE6/E,2BAAwE,IAAnC7/E,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAEzF,SAASwV,EAAejjF,GAC7B,OAAOA,IAA0B,IAArBA,EAAEijF,iBAA8D,IAAnCjjF,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE/E,SAAS8T,EAAYvhF,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEuhF,cAA2D,IAAnCvhF,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE5E,SAASA,EAAOztE,GACrB,OAAOA,IAAkB,IAAbA,EAAEytE,SAAsD,IAAnCztE,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAEvE,SAASkL,EAAa34E,GAC3B,OAAOA,IAAwB,IAAnBA,EAAE24E,eAA4D,IAAnC34E,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE7E,SAASwQ,EAAej+E,GAC7B,OAAOA,IAA0B,IAArBA,EAAEi+E,iBAA8D,IAAnCj+E,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE/E,SAAS0L,EAAkBn5E,GAChC,OAAOA,IAA6B,IAAxBA,EAAEm5E,oBAAiE,IAAnCn5E,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAElF,SAAS2R,EAAYp/E,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEo/E,cAA2D,IAAnCp/E,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE5E,SAASoV,EAAa7iF,GAC3B,OAAOA,IAAwB,IAAnBA,EAAE6iF,eAA4D,IAAnC7iF,EAAEtG,YAAYtB,UAAUq1E,SAAmB,EAE7E,SAAS8N,EAAQv7E,GACtB,OAAOA,IAAyC,IAApCA,EAAEtG,YAAYtB,UAAUmjF,UAAoB,EAEnD,SAASgW,EAAOvxF,GACrB,IAAIiH,SAAWjH,EAEf,MAAU,WAANiH,EAEQ,OAANjH,EAAmB,OACnBjJ,MAAMgD,QAAQiG,GAAW,QACzBA,aAAak3B,KAAa,OAC1Bl3B,aAAaq2B,OAAe,SAE5B6qE,EAAYlhG,GAAW,YACvBylJ,EAAUzlJ,GAAW,UACrB0lJ,EAAW1lJ,GAAW,WACtBohG,EAASphG,GAAW,SACpBm4E,EAAOn4E,GAAW,OAClBg2D,EAAQh2D,GAAW,QACnB0+F,EAAQ1+F,GAAW,QACnBi+F,EAAYj+F,GAAW,YACvBytE,EAAOztE,GAAWA,EAAEzD,KACpBg/E,EAAQv7E,GAAW,QACnBupF,EAAOvpF,GAAW,OACf,SAGC,aAANiH,EAAyB,WACtBA,I,4BC5JF,SAAS++I,IACd,MAAM,IAAI1oH,MAAM,2CAEX,SAAS2oH,IACd,MAAM,IAAI3oH,MAAM,0CAEX,SAAS4oH,IACd,MAAM,IAAI5oH,MAAM,wC,gPCIX,SAAS1sB,EAAU3X,GACxB,MAAqB,kBAAVA,KAIJqjB,SAASrjB,IAASA,IAAU2I,KAAKC,MAAM5I,GAQzC,IAAIytD,EAAsB9kD,KAAK8kD,MAAQ,SAAU1mD,GACtD,OAAIA,EAAI,EACC,EACEA,EAAI,GACL,EAED,GASAwoD,EAAsB5mD,KAAK4mD,MAAQ,SAAcxoD,GAC1D,OAAO4B,KAAK49B,IAAIx/B,GAAK4B,KAAK2oF,KAQjB9hC,EAAuB7mD,KAAK6mD,OAAS,SAAezoD,GAC7D,OAAO4B,KAAK49B,IAAIx/B,GAAK4B,KAAK45C,MAQjBk6B,EAAuB9zE,KAAK8zE,OAAS,SAAU11E,GACxD,OAAO4B,KAAK49B,IAAIx/B,EAAI,IAYXo/C,EAAsBx9C,KAAKw9C,MAAQ,SAAcp/C,GAC1D,GAAU,IAANA,EACF,OAAOA,EAGT,IACIqF,EADA4yG,EAASj4G,EAAI,EAejB,OAZIi4G,IACFj4G,GAAKA,GAMLqF,EAHEiX,SAAStc,IAGDA,IAFVqF,EAASzD,KAAKq9B,IAAIr9B,KAAK49B,IAAIx/B,GAAK,IAERqF,GAAU,EAAIA,GAAU,EAEvCrF,EAGJi4G,GAAU5yG,EAASA,GAQjBi7B,EAAuB1+B,KAAK0+B,OAAS,SAAetgC,GAC7D,OAAOA,GAAK,MAAQA,IAAM,KAAO4B,KAAKq9B,IAAIj/B,GAAK,EAAIA,EAAIA,EAAIA,EAAI,EAAIA,EAAIA,EAAIA,EAAI,GAUjF,SAASmmJ,EAAmBvqJ,EAAGlD,EAAMmlB,GACnC,IAKIqlB,EALW,CACbqyC,EAAG,KACH6wE,EAAG,KACHC,GAAI,MAEgB3tJ,GAClB4tJ,EAAS,GAEb,GAAIzoI,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAIyf,MAAM,kCAGlB,IAAK1sB,EAAUiN,GACb,MAAM,IAAIyf,MAAM,2BAGlB,GAAI1hC,EAAI,IAAMiiB,EAAO,GAAK,GAAKjiB,IAAM,IAAMiiB,EAAO,IAChD,MAAM,IAAIyf,MAAM,8BAA8Be,OAAOxgB,EAAO,EAAG,QAAQwgB,OAAOxgB,EAAO,EAAG,QAG1F,IAAKjN,EAAUhV,GACb,MAAM,IAAI0hC,MAAM,4BAGd1hC,EAAI,IACNA,GAAQ,GAAKiiB,GAGfyoI,EAAS,IAAIjoH,OAAOxgB,GAGtB,IAAI6oC,EAAO,GAOX,OALI9qD,EAAI,IACNA,GAAKA,EACL8qD,EAAO,KAGF,GAAGroB,OAAOqoB,GAAMroB,OAAO6E,GAAQ7E,OAAOziC,EAAEC,SAASnD,IAAO2lC,OAAOioH,GAwFjE,SAASt1D,EAAO/3F,EAAOm5D,GAC5B,GAAuB,mBAAZA,EAET,OAAOA,EAAQn5D,GAIjB,GAAIA,IAAU2nC,IACZ,MAAO,WACF,GAAI3nC,KAAU,IACnB,MAAO,YACF,GAAIgK,MAAMhK,GACf,MAAO,MAIT,IACIyiD,EACAwzD,EAFAD,EAAW,OAIf,GAAI78C,IAEEA,EAAQ68C,WACVA,EAAW78C,EAAQ68C,WAIjB,QAAS78C,GACX1W,EAAY0W,GACH,QAASA,EAAQ1W,aAC1BA,EAAY0W,EAAQ1W,WAGlB0W,EAAQ88C,UAGc,iBAFxBA,EAAW98C,EAAQ88C,WAGjB,MAAM,IAAI5xE,MAAM,sCAMtB,OAAQ2xE,GACN,IAAK,QACH,OAAOxgG,EAAQxV,EAAOyiD,GAExB,IAAK,cACH,OAAO+D,EAAcxmD,EAAOyiD,GAE9B,IAAK,cACH,OAsEC,SAAuBziD,EAAOyiD,GACnC,GAAIz4C,MAAMhK,KAAWqjB,SAASrjB,GAC5B,OAAOwhC,OAAOxhC,GAGhB,IACIstJ,EAAUC,EADFC,EAAYxtJ,GACSyiD,GAC7B1+C,EAAIupJ,EAAQpkC,SACZ38G,EAAI+gJ,EAAQluD,aAEZquD,EAAS1pJ,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAE/D,IAAI,QAAS0+C,GAEX,KAAOA,EAAYl2C,EAAE5O,QAAUoG,EAAI0pJ,EAAS,EAAIlhJ,EAAE5O,QAChD4O,EAAE7K,KAAK,QAOT,IAFA,IAAIgsJ,EAAe/kJ,KAAK0F,IAAItK,EAAI0pJ,IAAWlhJ,EAAE5O,OAAS,GAE7CC,EAAI,EAAGA,EAAI8vJ,EAAc9vJ,IAChC2O,EAAE7K,KAAK,GAQX,IAHA,IAAIisJ,EAAUhlJ,KAAK0F,IAAItK,EAAI0pJ,GACvBG,EAAa,EAEVD,EAAU,GACfC,IACAD,IAKF,IAAI/7C,EAAWrlG,EAAEvK,MAAM4rJ,GAAY1hH,KAAK,IACpC2hH,GAAa,QAASprG,IAAcmvD,EAASj0G,QAAUi0G,EAAS/qE,MAAM,SAAW,IAAM+qE,EAAW,GAClGrvE,EAAMh2B,EAAEvK,MAAM,EAAG4rJ,GAAY1hH,KAAK,IAAM2hH,EAAa,KAAO9pJ,GAAK,EAAI,IAAM,IAAM0pJ,EAAO7qJ,WAC5F,OAAO0qJ,EAAQ7/F,KAAOlrB,EA/GXurH,CAAc9tJ,EAAOyiD,GAE9B,IAAK,MACH,OAAOyqG,EAAmBltJ,EAAO,EAAGi2G,GAEtC,IAAK,MACH,OAAOi3C,EAAmBltJ,EAAO,EAAGi2G,GAEtC,IAAK,MACH,OAAOi3C,EAAmBltJ,EAAO,GAAIi2G,GAEvC,IAAK,OAEH,OA+KC,SAAqBj2G,EAAOyiD,EAAW0W,GAC5C,GAAInvD,MAAMhK,KAAWqjB,SAASrjB,GAC5B,OAAOwhC,OAAOxhC,GAIhB,IAAI+tJ,EAAW50F,QAAgC93D,IAArB83D,EAAQ40F,SAAyB50F,EAAQ40F,UAAY,EAC3EC,EAAW70F,QAAgC93D,IAArB83D,EAAQ60F,SAAyB70F,EAAQ60F,SAAW,EAC1E13H,EAAQk3H,EAAYxtJ,GACpBstJ,EAAU7qG,EAAY8qG,EAAYj3H,EAAOmsB,GAAansB,EAE1D,GAAIg3H,EAAQpkC,SAAW6kC,GAAYT,EAAQpkC,UAAY8kC,EAErD,OAAOxnG,EAAcxmD,EAAOyiD,GAE5B,IAAIl2C,EAAI+gJ,EAAQluD,aACZr7F,EAAIupJ,EAAQpkC,SAEZ38G,EAAE5O,OAAS8kD,IACbl2C,EAAIA,EAAE64B,OAAOmxD,EAAM9zC,EAAYl2C,EAAE5O,UAKnC4O,EAAIA,EAAE64B,OAAOmxD,EAAMxyF,EAAIwI,EAAE5O,OAAS,GAAK4O,EAAE5O,OAAS8kD,EAAYA,EAAYl2C,EAAE5O,OAAS,KAGrF,IAAIy/E,EAAMr5E,EAAI,EAAIA,EAAI,EAMtB,OAJIq5E,GAHJ7wE,EAAIgqF,GAAOxyF,GAAGqhC,OAAO74B,IAGT5O,OAAS,GACnB4O,EAAE4hE,OAAOiP,EAAM,EAAG,EAAG,KAGhBkwE,EAAQ7/F,KAAOlhD,EAAE2/B,KAAK,IAhNpB8f,CAAYhsD,EAAOyiD,EAAW0W,GAAWA,GAAS30D,QAAQ,uBAAuB,WACtF,IAAImpD,EAASzqB,UAAU,GACnBn/B,EAAIm/B,UAAU,GAClB,MAAkB,MAAXyqB,EAAiBA,EAAS5pD,EAAIA,KAGzC,QACE,MAAM,IAAIsgC,MAAM,qBAAuB2xE,EAAvB,qEAUf,SAASw3C,EAAYxtJ,GAE1B,IAAI6mC,EAAQrF,OAAOxhC,GAAOogC,cAAcyG,MAAM,sCAE9C,IAAKA,EACH,MAAM,IAAIV,YAAY,kBAAoBnmC,GAG5C,IAAIytD,EAAO5mB,EAAM,GACb8mB,EAAS9mB,EAAM,GACfqiF,EAAW3zG,WAAWsxB,EAAM,IAAM,KAClCu2C,EAAMzvB,EAAOz4B,QAAQ,KACzBg0F,IAAqB,IAAT9rC,EAAaA,EAAM,EAAIzvB,EAAOhwD,OAAS,EACnD,IAAIyhG,EAAezxC,EAAOnpD,QAAQ,IAAK,IACtCA,QAAQ,OAAO,SAAU+xF,GAGxB,OADA2yB,GAAY3yB,EAAM54F,OACX,MACN6G,QAAQ,MAAO,IACjB8xB,MAAM,IAAIzc,KAAI,SAAUrN,GACvB,OAAOs3B,SAASt3B,MAQlB,OAL4B,IAAxB4yF,EAAazhG,SACfyhG,EAAa19F,KAAK,GAClBwnH,KAGK,CACLz7D,KAAMA,EACN2xC,aAAcA,EACd8pB,SAAUA,GA2DP,SAAS1zG,EAAQxV,EAAOyiD,GAC7B,GAAIz4C,MAAMhK,KAAWqjB,SAASrjB,GAC5B,OAAOwhC,OAAOxhC,GAGhB,IAAIiuJ,EAAaT,EAAYxtJ,GACzBstJ,EAA+B,iBAAd7qG,EAAyB8qG,EAAYU,EAAYA,EAAW/kC,SAAW,EAAIzmE,GAAawrG,EACzG1hJ,EAAI+gJ,EAAQluD,aACZx+F,EAAI0sJ,EAAQpkC,SAAW,EAGvBglC,EAAKttJ,GAAK6hD,GAAa,GAiB3B,OAfIl2C,EAAE5O,OAASuwJ,IACb3hJ,EAAIA,EAAE64B,OAAOmxD,EAAM23D,EAAK3hJ,EAAE5O,UAIxBiD,EAAI,IACN2L,EAAIgqF,EAAW,EAAJ31F,GAAOwkC,OAAO74B,GACzB3L,EAAI,GAIFA,EAAI2L,EAAE5O,QACR4O,EAAE4hE,OAAOvtE,EAAG,EAAS,IAANA,EAAU,KAAO,KAG3B0sJ,EAAQ7/F,KAAOlhD,EAAE2/B,KAAK,IAUxB,SAASsa,EAAcxmD,EAAOyiD,GACnC,GAAIz4C,MAAMhK,KAAWqjB,SAASrjB,GAC5B,OAAOwhC,OAAOxhC,GAIhB,IAAIs2B,EAAQk3H,EAAYxtJ,GACpBstJ,EAAU7qG,EAAY8qG,EAAYj3H,EAAOmsB,GAAansB,EACtD/pB,EAAI+gJ,EAAQluD,aACZr7F,EAAIupJ,EAAQpkC,SAEZ38G,EAAE5O,OAAS8kD,IACbl2C,EAAIA,EAAE64B,OAAOmxD,EAAM9zC,EAAYl2C,EAAE5O,UAInC,IAAI0kC,EAAQ91B,EAAEw9C,QACd,OAAOujG,EAAQ7/F,KAAOprB,GAAS91B,EAAE5O,OAAS,EAAI,IAAM4O,EAAE2/B,KAAK,IAAM,IAAM,KAAOnoC,GAAK,EAAI,IAAM,IAAMA,EA0D9F,SAASwpJ,EAAYj3H,EAAOmsB,GASjC,IAPA,IAAI6qG,EAAU,CACZ7/F,KAAMn3B,EAAMm3B,KACZ2xC,aAAc9oE,EAAM8oE,aACpB8pB,SAAU5yF,EAAM4yF,UAEd38G,EAAI+gJ,EAAQluD,aAET38C,GAAa,GAClBl2C,EAAE0lC,QAAQ,GACVq7G,EAAQpkC,WACRzmE,IAGF,GAAIl2C,EAAE5O,OAAS8kD,GACCl2C,EAAE4hE,OAAO1rB,EAAWl2C,EAAE5O,OAAS8kD,GAEjC,IAAM,EAAG,CACnB,IAAI7kD,EAAI6kD,EAAY,EAGpB,IAFAl2C,EAAE3O,KAEc,KAAT2O,EAAE3O,IACP2O,EAAEuL,MAEQ,IAANla,IACF2O,EAAE0lC,QAAQ,GACVq7G,EAAQpkC,WACRtrH,KAIF2O,IADA3O,KAMN,OAAO0vJ,EAQT,SAAS/2D,EAAM54F,GAGb,IAFA,IAAIF,EAAM,GAEDG,EAAI,EAAGA,EAAID,EAAQC,IAC1BH,EAAIiE,KAAK,GAGX,OAAOjE,EAeF,SAASkwD,EAAO3tD,GACrB,OAAOA,EAAMwmD,gBAAgBhiD,QAAQ,OAAQ,IAC5CA,QAAQ,aAAc,IACtB7G,OAMI,IAAIwwJ,EAActlJ,OAAOC,SAAW,qBAWpC,SAASslJ,EAAYrnJ,EAAGC,EAAG4sE,GAEhC,GAAIA,QACF,OAAO7sE,IAAMC,EAGf,GAAID,IAAMC,EACR,OAAO,EAIT,GAAIgD,MAAMjD,IAAMiD,MAAMhD,GACpB,OAAO,EAIT,GAAIqc,SAAStc,IAAMsc,SAASrc,GAAI,CAE9B,IAAI4J,EAAOjI,KAAK0F,IAAItH,EAAIC,GAExB,OAAI4J,EAAOu9I,GAIFv9I,GAAQjI,KAAKijB,IAAIjjB,KAAK0F,IAAItH,GAAI4B,KAAK0F,IAAIrH,IAAM4sE,EAKxD,OAAO,EAQF,IAAIvrC,EAAQ1/B,KAAK0/B,OAAS,SAAUthC,GACzC,OAAO4B,KAAK49B,IAAI59B,KAAKsE,KAAKlG,EAAIA,EAAI,GAAKA,IAE9BqhC,EAAQz/B,KAAKy/B,OAAS,SAAUrhC,GACzC,OAAO4B,KAAK49B,IAAI59B,KAAKsE,KAAKlG,EAAIA,EAAI,GAAKA,IAQ9BohC,EAAQx/B,KAAKw/B,OAAS,SAAUphC,GACzC,OAAO4B,KAAK49B,KAAK,EAAIx/B,IAAM,EAAIA,IAAM,GAQ5Bg/B,EAAOp9B,KAAKo9B,MAAQ,SAAUh/B,GACvC,OAAQ4B,KAAKq9B,IAAIj/B,GAAK4B,KAAKq9B,KAAKj/B,IAAM,GAQ7Bk/B,EAAOt9B,KAAKs9B,MAAQ,SAAUl/B,GACvC,OAAQ4B,KAAKq9B,IAAIj/B,GAAK4B,KAAKq9B,KAAKj/B,IAAM,GAQ7BihD,EAAOr/C,KAAKq/C,MAAQ,SAAUjhD,GACvC,IAAIhD,EAAI4E,KAAKq9B,IAAI,EAAIj/B,GACrB,OAAQhD,EAAI,IAAMA,EAAI,K,yGCjqBjB,SAAS4rD,EAAM5oD,GACpB,IAAIzD,SAAcyD,EAElB,GAAa,WAATzD,GAA8B,WAATA,GAA8B,YAATA,GAA1CA,MAAgEyD,EAClE,OAAOA,EAIT,GAAuB,mBAAZA,EAAE4oD,MACX,OAAO5oD,EAAE4oD,QAIX,GAAI7xD,MAAMgD,QAAQiG,GAChB,OAAOA,EAAE8S,KAAI,SAAU7Z,GACrB,OAAO2vD,EAAM3vD,MAIjB,GAAI+G,aAAak3B,KAAM,OAAO,IAAIA,KAAKl3B,EAAEslD,WACzC,IAAI,QAAYtlD,GAAI,OAAOA,EAE3B,GAAIA,aAAaq2B,OAAQ,MAAM,IAAI/+B,UAAU,gBAAkB0I,GAG/D,OASK,SAAmBrH,EAAQ0X,GAChC,IAAIu4C,EAAQ,GAEZ,IAAK,IAAI5wD,KAAOW,EACVC,EAAeD,EAAQX,KACzB4wD,EAAM5wD,GAAOqY,EAAS1X,EAAOX,KAIjC,OAAO4wD,EAlBA0+F,CAAUtnJ,EAAG4oD,GA2Bf,SAAS2+F,EAAOjiJ,EAAGC,GACxB,IAAK,IAAIy1B,KAAQz1B,EACX3M,EAAe2M,EAAGy1B,KACpB11B,EAAE01B,GAAQz1B,EAAEy1B,IAIhB,OAAO11B,EA+CF,SAASkiJ,EAAgBliJ,EAAGC,GACjC,IAAIy1B,EAAMnkC,EAAGF,EAEb,GAAII,MAAMgD,QAAQuL,GAAI,CACpB,IAAKvO,MAAMgD,QAAQwL,GACjB,OAAO,EAGT,GAAID,EAAE1O,SAAW2O,EAAE3O,OACjB,OAAO,EAGT,IAAKC,EAAI,EAAGF,EAAM2O,EAAE1O,OAAQC,EAAIF,EAAKE,IACnC,IAAK2wJ,EAAgBliJ,EAAEzO,GAAI0O,EAAE1O,IAC3B,OAAO,EAIX,OAAO,EACF,GAAiB,mBAANyO,EAChB,OAAOA,IAAMC,EACR,GAAID,aAAaxN,OAAQ,CAC9B,GAAIf,MAAMgD,QAAQwL,MAAQA,aAAazN,QACrC,OAAO,EAGT,IAAKkjC,KAAQ11B,EAEX,KAAM01B,KAAQz1B,KAAOiiJ,EAAgBliJ,EAAE01B,GAAOz1B,EAAEy1B,IAC9C,OAAO,EAIX,IAAKA,KAAQz1B,EAEX,KAAMy1B,KAAQ11B,KAAOkiJ,EAAgBliJ,EAAE01B,GAAOz1B,EAAEy1B,IAC9C,OAAO,EAIX,OAAO,EAEP,OAAO11B,IAAMC,EA2DV,SAASkiJ,EAAK9uJ,EAAQqiC,EAAM0sH,GACjC,IAEIzgD,EAFA0gD,GAAiB,EAIrB7vJ,OAAOC,eAAeY,EAAQqiC,EAAM,CAClCviC,IAAK,WAMH,OALIkvJ,IACF1gD,EAASygD,IACTC,GAAiB,GAGZ1gD,GAETjgF,IAAK,SAAa/tB,GAChBguG,EAAShuG,EACT0uJ,GAAiB,GAEnB/vJ,cAAc,EACdD,YAAY,IAsCT,SAASiB,EAAeD,EAAQL,GACrC,OAAOK,GAAUb,OAAOc,eAAeC,KAAKF,EAAQL,GAgH/C,SAASsvJ,EAAYjvJ,EAAQ+/E,GAGlC,IAFA,IAAI/vB,EAAO,GAEF9xD,EAAI,EAAGA,EAAI6hF,EAAW9hF,OAAQC,IAAK,CAC1C,IAAImB,EAAM0gF,EAAW7hF,GACjBoC,EAAQN,EAAOX,QAELsC,IAAVrB,IACF0vD,EAAK3wD,GAAOiB,GAIhB,OAAO0vD,I,0GCzYT,SAASk/F,EAAsBjsJ,EAAGlD,EAAMmlB,GACtC,IACIiqI,EAAO,IAAIC,EADKnsJ,EAAElC,aACO,GACzB4sJ,EAAS,GAEb,GAAIzoI,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAIyf,MAAM,kCAGlB,KAAK,OAAUzf,GACb,MAAM,IAAIyf,MAAM,2BAGlB,GAAI1hC,EAAEukD,YAAY2nG,EAAK/4I,IAAI8O,EAAO,GAAGilC,IAAI,KAAOlnD,EAAEwmD,SAAS0lG,EAAK/4I,IAAI8O,EAAO,GAAGgmC,KAAK,IACjF,MAAM,IAAIvmB,MAAM,8BAA8Be,OAAOxgB,EAAO,EAAG,QAAQwgB,OAAOxgB,EAAO,EAAG,QAG1F,IAAKjiB,EAAEgV,YACL,MAAM,IAAI0sB,MAAM,4BAGd1hC,EAAEwmD,SAAS,KACbxmD,EAAIA,EAAE6a,IAAIqxI,EAAK/4I,IAAI8O,KAGrByoI,EAAS,IAAIjoH,OAAOxgB,GAGtB,OAAQnlB,GACN,KAAK,EACH,MAAO,GAAG2lC,OAAOziC,EAAEmoD,YAAY1lB,OAAOioH,GAExC,KAAK,EACH,MAAO,GAAGjoH,OAAOziC,EAAEipD,WAAWxmB,OAAOioH,GAEvC,KAAK,GACH,MAAO,GAAGjoH,OAAOziC,EAAE6oD,iBAAiBpmB,OAAOioH,GAE7C,QACE,MAAM,IAAIhpH,MAAM,QAAQe,OAAO3lC,EAAM,qBA8MpC,SAAS+mD,EAAcxmD,EAAOyiD,GACnC,YAAkBphD,IAAdohD,EACKziD,EAAMwmD,cAAc/D,EAAY,GAEhCziD,EAAMwmD,gBC1PV,SAAS1iC,EAASq/G,EAAM10E,GAC7B,IAAI74C,EAAQutH,EAAKxlI,OAAS8wD,EAAO9wD,OAC7BkY,EAAMstH,EAAKxlI,OACf,OAAOwlI,EAAKjvG,UAAUte,EAAOC,KAAS44C,EAsCjC,SAAS,EAAOzuD,EAAOm5D,GAC5B,MAAqB,iBAAVn5D,GACF,QAAaA,EAAOm5D,IAGzB,EAAA6b,EAAA,IAAYh1E,GDgFX,SAAgBA,EAAOm5D,GAC5B,GAAuB,mBAAZA,EAET,OAAOA,EAAQn5D,GAIjB,IAAKA,EAAMqjB,WACT,OAAOrjB,EAAMgK,QAAU,MAAQhK,EAAMmnD,GAAG,GAAK,WAAa,YAI5D,IACI1E,EACAwzD,EAFAD,EAAW,OAIf,QAAgB30G,IAAZ83D,IAEEA,EAAQ68C,WACVA,EAAW78C,EAAQ68C,UAIE,iBAAZ78C,EACT1W,EAAY0W,EACHA,EAAQ1W,YACjBA,EAAY0W,EAAQ1W,WAGlB0W,EAAQ88C,UAGc,iBAFxBA,EAAW98C,EAAQ88C,WAGjB,MAAM,IAAI5xE,MAAM,sCAMtB,OAAQ2xE,GACN,IAAK,QACH,OA6FC,SAAiBh2G,EAAOyiD,GAC7B,OAAOziD,EAAMwV,QAAQitC,GA9FVjtC,CAAQxV,EAAOyiD,GAExB,IAAK,cACH,OAAO+D,EAAcxmD,EAAOyiD,GAE9B,IAAK,cACH,OAkDC,SAAuBziD,EAAOyiD,GAEnC,IAAI1+C,EAAI/D,EAAM+D,EACV0pJ,EAAS1pJ,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAE3DgrJ,EAAkB/uJ,EAAM4qD,IAAIjiD,KAAKmN,IAAI,IAAK23I,IAC1C7hD,EAAWmjD,EAAgB/iG,YAAYvJ,GAM3C,OAJ+B,IAA3BmpD,EAAS12E,QAAQ,OACnB02E,EAAWmjD,EAAgBnsJ,YAGtBgpG,EAAW,KAAO7nG,GAAK,EAAI,IAAM,IAAM0pJ,EAAO7qJ,WA9D1CkrJ,CAAc9tJ,EAAOyiD,GAE9B,IAAK,MACH,OAAOmsG,EAAsB5uJ,EAAO,EAAGi2G,GAEzC,IAAK,MACH,OAAO24C,EAAsB5uJ,EAAO,EAAGi2G,GAEzC,IAAK,MACH,OAAO24C,EAAsB5uJ,EAAO,GAAIi2G,GAE1C,IAAK,OAID,IAAI83C,EAAW50F,QAAgC93D,IAArB83D,EAAQ40F,SAAyB50F,EAAQ40F,UAAY,EAC3EC,EAAW70F,QAAgC93D,IAArB83D,EAAQ60F,SAAyB70F,EAAQ60F,SAAW,EAE9E,GAAIhuJ,EAAMumD,SAAU,MAAO,IAG3B,IAAI+mG,EAAUttJ,EAAMisD,oBAAoBxJ,GACpCzc,EAAMsnH,EAAQvpJ,EAWlB,OATIiiC,GAAO+nH,GAAY/nH,EAAMgoH,EAErBV,EAAQ93I,UAGRgxC,EAAcxmD,EAAOyiD,IAIlBj+C,QAAQ,uBAAuB,WACxC,IAAImpD,EAASzqB,UAAU,GACnBn/B,EAAIm/B,UAAU,GAClB,MAAkB,MAAXyqB,EAAiBA,EAAS5pD,EAAIA,KAI3C,QACE,MAAM,IAAIsgC,MAAM,qBAAuB2xE,EAAvB,qECvKXje,CAAgB/3F,EAAOm5D,GA+HlC,SAA2Bn5D,GACzB,OAAOA,GAA0B,iBAAVA,GAAyC,iBAAZA,EAAM6W,GAAqC,iBAAZ7W,EAAM2C,GAAqC,iBAAZ3C,EAAMwM,IAAkB,EA3HtIwiJ,CAAkBhvJ,GACfm5D,GAAgC,YAArBA,EAAQi4B,SAKfpxF,EAAM4C,WAHN5C,EAAM6W,EAAI7W,EAAM2C,EAAI,IAAM3C,EAAMwM,EAOvC1O,MAAMgD,QAAQd,GACTivJ,EAAYjvJ,EAAOm5D,IAGxB,EAAA6b,EAAA,IAASh1E,GACJ,IAAMA,EAAQ,IAGF,mBAAVA,EACFA,EAAMgnF,OAASxlD,OAAOxhC,EAAMgnF,QAAU,WAG3ChnF,GAA0B,iBAAVA,EACU,mBAAjBA,EAAM+3F,OACR/3F,EAAM+3F,OAAO5+B,GACXn5D,GAASA,EAAM4C,SAASu2D,KAAa,GAAGv2D,WAE1C5C,EAAM4C,SAASu2D,GAKf,IAHOt6D,OAAO4G,KAAKzF,GAAO6Z,KAAI9a,GAC5B,IAAMA,EAAM,MAAQ,EAAOiB,EAAMjB,GAAMo6D,KAE3BjtB,KAAK,MAAQ,IAI/B1K,OAAOxhC,GAST,SAASoiC,EAAUpiC,GAKxB,IAJA,IAAImjI,EAAO3hG,OAAOxhC,GACdkvJ,EAAU,GACVtxJ,EAAI,EAEDA,EAAIulI,EAAKxlI,QAAQ,CACtB,IAAI4O,EAAI42H,EAAKr+E,OAAOlnD,GAEV,OAAN2O,GACF2iJ,GAAW3iJ,EACX3O,IAGU,MAFV2O,EAAI42H,EAAKr+E,OAAOlnD,MAE6B,IAA7B,aAAas3B,QAAQ3oB,KACnC2iJ,GAAW,MAGbA,GAAW3iJ,GAEX2iJ,GADe,MAAN3iJ,EACE,MAEAA,EAGb3O,IAGF,MAAO,IAAMsxJ,EAAU,IAQlB,SAAS,EAAOlvJ,GACrB,IAAImjI,EAAO3hG,OAAOxhC,GAElB,OADOmjI,EAAK3+H,QAAQ,KAAM,SAASA,QAAQ,KAAM,UAAUA,QAAQ,KAAM,SAASA,QAAQ,KAAM,QAAQA,QAAQ,KAAM,QAcxH,SAASyqJ,EAAY3yF,EAAOnD,GAC1B,GAAIr7D,MAAMgD,QAAQw7D,GAAQ,CAIxB,IAHA,IAAI/5B,EAAM,IACN7kC,EAAM4+D,EAAM3+D,OAEPC,EAAI,EAAGA,EAAIF,EAAKE,IACb,IAANA,IACF2kC,GAAO,MAGTA,GAAO0sH,EAAY3yF,EAAM1+D,GAAIu7D,GAI/B,OADA52B,EAAO,IAGP,OAAO,EAAO+5B,EAAOnD,GAqBlB,SAAS29B,EAAY/vF,EAAGC,GAE7B,KAAK,EAAAguE,EAAA,IAASjuE,GACZ,MAAM,IAAI1I,UAAU,sGAA4G,QAAO0I,GAAK,eAG9I,KAAK,EAAAiuE,EAAA,IAAShuE,GACZ,MAAM,IAAI3I,UAAU,sGAA4G,QAAO2I,GAAK,eAG9I,OAAOD,IAAMC,EAAI,EAAID,EAAIC,EAAI,GAAK,I,eChMpC,IAAImoJ,EAAO,EAAQ,MAKfC,EAAS,EAAQ,MAKjBC,EAAS,EAAQ,KAQjBC,EAAY,EAAQ,MASpBC,EAAU,EAAQ,MAOlBC,EAAS,EAAQ,MAIjBC,EAAK,EAAQ,MAEjBA,EAAGN,KAAOA,EACVM,EAAGL,OAASA,EACZK,EAAGJ,OAASA,EACZI,EAAGH,UAAYA,EACfG,EAAGF,QAAUA,EACbE,EAAGD,OAASA,EAEZ9mH,EAAOC,QAAU8mH,G,qBC3DjB,OA2BA,SAAUC,EAAQhnH,EAAQinH,GAE1B,SAASC,EAAK92C,GACZ,IAgDIn2G,EAhDAgrG,EAAKzqG,KAAM2sJ,GAgDXltJ,EAAI,WAEG,SAASsB,GAClBA,EAAOu9B,OAAOv9B,GACd,IAAK,IAAIrG,EAAI,EAAGA,EAAIqG,EAAKtG,OAAQC,IAAK,CAEpC,IAAIsJ,EAAI,oBADRvE,GAAKsB,EAAKyqD,WAAW9wD,IAGrBsJ,GADAvE,EAAIuE,IAAM,EAGVvE,GADAuE,GAAKvE,KACK,EAEVA,GAAS,YADTuE,GAAKvE,GAGP,OAAmB,wBAAXA,IAAM,KA5DhBgrG,EAAGnsG,KAAO,WACR,IAAIwM,EAAI,QAAU2/F,EAAGmiD,GAAY,uBAAPniD,EAAGphG,EAG7B,OAFAohG,EAAGmiD,GAAKniD,EAAGoiD,GACXpiD,EAAGoiD,GAAKpiD,EAAG2vC,GACJ3vC,EAAG2vC,GAAKtvI,GAAK2/F,EAAGphG,EAAQ,EAAJyB,IAI7B2/F,EAAGphG,EAAI,EACPohG,EAAGmiD,GAAKD,EAAK,KACbliD,EAAGoiD,GAAKF,EAAK,KACbliD,EAAG2vC,GAAKuS,EAAK,KACbliD,EAAGmiD,IAAMD,EAAK/2C,GACVnL,EAAGmiD,GAAK,IAAKniD,EAAGmiD,IAAM,GAC1BniD,EAAGoiD,IAAMF,EAAK/2C,GACVnL,EAAGoiD,GAAK,IAAKpiD,EAAGoiD,IAAM,GAC1BpiD,EAAG2vC,IAAMuS,EAAK/2C,GACVnL,EAAG2vC,GAAK,IAAK3vC,EAAG2vC,IAAM,GAC1BuS,EAAO,KAGT,SAASngG,EAAKjjD,EAAGuB,GAKf,OAJAA,EAAEzB,EAAIE,EAAEF,EACRyB,EAAE8hJ,GAAKrjJ,EAAEqjJ,GACT9hJ,EAAE+hJ,GAAKtjJ,EAAEsjJ,GACT/hJ,EAAEsvI,GAAK7wI,EAAE6wI,GACFtvI,EAGT,SAASgiJ,EAAKl3C,EAAMtqE,GAClB,IAAIyhH,EAAK,IAAIL,EAAK92C,GACdpyG,EAAQ8nC,GAAQA,EAAK9nC,MACrBwpJ,EAAOD,EAAGzuJ,KAUd,OATA0uJ,EAAKC,MAAQ,WAAa,OAAoB,WAAZF,EAAGzuJ,OAAwB,GAC7D0uJ,EAAKE,OAAS,WACZ,OAAOF,IAAmC,uBAAhB,QAATA,IAAoB,IAEvCA,EAAKG,MAAQH,EACTxpJ,IACmB,iBAAX,GAAqBgpD,EAAKhpD,EAAOupJ,GAC3CC,EAAKxpJ,MAAQ,WAAa,OAAOgpD,EAAKugG,EAAI,MAErCC,EAyBLxnH,GAAUA,EAAOC,QACnBD,EAAOC,QAAUqnH,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC9sJ,KAAKisJ,KAAOa,EA7Ed,CAiFE9sJ,E,WAEA,S,qBC9GF,OAIA,SAAUwsJ,EAAQhnH,EAAQinH,GAE1B,SAASW,EAAOx3C,GACd,IAAInL,EAAKzqG,KAAMqtJ,EAAU,GAGzB5iD,EAAGnsG,KAAO,WACR,IAAI8K,EAAIqhG,EAAGrhG,EAAGC,EAAIohG,EAAGphG,EAAGC,EAAImhG,EAAGnhG,EAAGH,EAAIshG,EAAGthG,EAQzC,OAPAC,EAAKA,GAAK,GAAOA,IAAM,EAAKC,EAC5BA,EAAKA,EAAIC,EAAK,EACdA,EAAKA,GAAK,GAAOA,IAAM,EAAKH,EAC5BA,EAAKA,EAAIC,EAAK,EACdqhG,EAAGrhG,EAAIA,EAAKA,GAAK,GAAOA,IAAM,GAAMC,EACpCohG,EAAGphG,EAAIA,EAAKA,EAAIC,EAAK,EACrBmhG,EAAGnhG,EAAKA,GAAK,GAAOD,IAAM,GAAMF,EACzBshG,EAAGthG,EAAKA,EAAIC,EAAK,GAmB1BqhG,EAAGthG,EAAI,EACPshG,EAAGrhG,EAAI,EACPqhG,EAAGphG,GAAI,WACPohG,EAAGnhG,EAAI,WAEHssG,IAASnwG,KAAKgd,MAAMmzF,IAEtBnL,EAAGthG,EAAKysG,EAAO,WAAe,EAC9BnL,EAAGrhG,EAAW,EAAPwsG,GAGPy3C,GAAWz3C,EAIb,IAAK,IAAIhtE,EAAI,EAAGA,EAAIykH,EAAQ5yJ,OAAS,GAAImuC,IACvC6hE,EAAGrhG,GAA6B,EAAxBikJ,EAAQ7hG,WAAW5iB,GAC3B6hE,EAAGnsG,OAIP,SAASkuD,EAAKjjD,EAAGuB,GAKf,OAJAA,EAAE3B,EAAII,EAAEJ,EACR2B,EAAE1B,EAAIG,EAAEH,EACR0B,EAAEzB,EAAIE,EAAEF,EACRyB,EAAExB,EAAIC,EAAED,EACDwB,EAGT,SAASgiJ,EAAKl3C,EAAMtqE,GAClB,IAAIyhH,EAAK,IAAIK,EAAOx3C,GAChBpyG,EAAQ8nC,GAAQA,EAAK9nC,MACrBwpJ,EAAO,WAAa,OAAQD,EAAGzuJ,SAAW,GAAK,YAenD,OAdA0uJ,EAAKE,OAAS,WACZ,GACE,IAEIhkJ,IAFM6jJ,EAAGzuJ,SAAW,KACbyuJ,EAAGzuJ,SAAW,GAAK,aACF,GAAK,UACf,IAAX4K,GACT,OAAOA,GAET8jJ,EAAKC,MAAQF,EAAGzuJ,KAChB0uJ,EAAKG,MAAQH,EACTxpJ,IACmB,iBAAX,GAAqBgpD,EAAKhpD,EAAOupJ,GAC3CC,EAAKxpJ,MAAQ,WAAa,OAAOgpD,EAAKugG,EAAI,MAErCC,EAGLxnH,GAAUA,EAAOC,QACnBD,EAAOC,QAAUqnH,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC9sJ,KAAKssJ,OAASQ,EAzFhB,CA6FE9sJ,E,WAEA,S,qBCnGF,OAGA,SAAUwsJ,EAAQhnH,EAAQinH,GAE1B,SAASW,EAAOx3C,GACd,IAAInL,EAAKzqG,KAAMqtJ,EAAU,GAEzB5iD,EAAG5mG,EAAI,EACP4mG,EAAG3mG,EAAI,EACP2mG,EAAGjnE,EAAI,EACPinE,EAAG1mG,EAAI,EAGP0mG,EAAGnsG,KAAO,WACR,IAAIwM,EAAI2/F,EAAG5mG,EAAK4mG,EAAG5mG,GAAK,GAIxB,OAHA4mG,EAAG5mG,EAAI4mG,EAAG3mG,EACV2mG,EAAG3mG,EAAI2mG,EAAGjnE,EACVinE,EAAGjnE,EAAIinE,EAAG1mG,EACH0mG,EAAG1mG,GAAM0mG,EAAG1mG,IAAM,GAAM+G,EAAKA,IAAM,GAGxC8qG,KAAiB,EAAPA,GAEZnL,EAAG5mG,EAAI+xG,EAGPy3C,GAAWz3C,EAIb,IAAK,IAAIhtE,EAAI,EAAGA,EAAIykH,EAAQ5yJ,OAAS,GAAImuC,IACvC6hE,EAAG5mG,GAA6B,EAAxBwpJ,EAAQ7hG,WAAW5iB,GAC3B6hE,EAAGnsG,OAIP,SAASkuD,EAAKjjD,EAAGuB,GAKf,OAJAA,EAAEjH,EAAI0F,EAAE1F,EACRiH,EAAEhH,EAAIyF,EAAEzF,EACRgH,EAAE04B,EAAIj6B,EAAEi6B,EACR14B,EAAE/G,EAAIwF,EAAExF,EACD+G,EAGT,SAASgiJ,EAAKl3C,EAAMtqE,GAClB,IAAIyhH,EAAK,IAAIK,EAAOx3C,GAChBpyG,EAAQ8nC,GAAQA,EAAK9nC,MACrBwpJ,EAAO,WAAa,OAAQD,EAAGzuJ,SAAW,GAAK,YAenD,OAdA0uJ,EAAKE,OAAS,WACZ,GACE,IAEIhkJ,IAFM6jJ,EAAGzuJ,SAAW,KACbyuJ,EAAGzuJ,SAAW,GAAK,aACF,GAAK,UACf,IAAX4K,GACT,OAAOA,GAET8jJ,EAAKC,MAAQF,EAAGzuJ,KAChB0uJ,EAAKG,MAAQH,EACTxpJ,IACmB,iBAAX,GAAqBgpD,EAAKhpD,EAAOupJ,GAC3CC,EAAKxpJ,MAAQ,WAAa,OAAOgpD,EAAKugG,EAAI,MAErCC,EAGLxnH,GAAUA,EAAOC,QACnBD,EAAOC,QAAUqnH,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC9sJ,KAAKksJ,OAASY,EApEhB,CAwEE9sJ,E,WAEA,S,qBC7EF,OAyBA,SAAUwsJ,EAAQhnH,EAAQinH,GAE1B,SAASW,EAAOx3C,GACd,IAAInL,EAAKzqG,KAGTyqG,EAAGnsG,KAAO,WACR,IACwBwM,EAAGlJ,EADvBmC,EAAI0mG,EAAG1mG,EACPupJ,EAAI7iD,EAAG6iD,EAAG5yJ,EAAI+vG,EAAG/vG,EAcrB,OAZA+vG,EAAG1mG,EAAIA,EAAKA,EAAI,WAAc,EAE9BnC,EAAI0rJ,EAAG5yJ,EAAI,GAAM,KACjBoQ,EAAIwiJ,EAAE5yJ,EAAMA,EAAI,EAAK,KACrBkH,GAAKA,GAAK,GACVkJ,GAAKA,GAAK,GACVlJ,GAAKA,IAAM,GACXkJ,GAAKA,IAAM,GAEXlJ,EAAI0rJ,EAAE5yJ,GAAKkH,EAAIkJ,EACf2/F,EAAG/vG,EAAIA,EAECkH,GAAKmC,EAAKA,IAAM,IAAQ,GAGlC,SAAc0mG,EAAImL,GAChB,IAAI9qG,EAAGlJ,EAAGlH,EAAGyuB,EAAGplB,EAAGupJ,EAAI,GAAIlpH,EAAQ,IAYnC,IAXIwxE,KAAiB,EAAPA,IAEZh0G,EAAIg0G,EACJA,EAAO,OAGPA,GAAc,KACdh0G,EAAI,EACJwiC,EAAQ3+B,KAAKijB,IAAI0b,EAAOwxE,EAAKn7G,SAG1BC,EAAI,EAAGyuB,GAAK,GAAIA,EAAIib,IAASjb,EAE5BysF,IAAMh0G,GAAKg0G,EAAKpqD,YAAYriC,EAAI,IAAMysF,EAAKn7G,SAErC,IAAN0uB,IAASplB,EAAInC,GACjBA,GAAKA,GAAK,GACVA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,GAAKA,IAAM,GACPunB,GAAK,IACPplB,EAAKA,EAAI,WAAc,EAEvBrJ,EAAK,IADLoQ,EAAKwiJ,EAAM,IAAJnkI,IAAavnB,EAAImC,GACTrJ,EAAI,EAAI,GAW3B,IAPIA,GAAK,MACP4yJ,EAA+B,KAA5B13C,GAAQA,EAAKn7G,QAAU,KAAa,GAKzCC,EAAI,IACCyuB,EAAI,IAASA,EAAI,IAAKA,EACzBvnB,EAAI0rJ,EAAG5yJ,EAAI,GAAM,KACjBoQ,EAAIwiJ,EAAE5yJ,EAAMA,EAAI,EAAK,KACrBkH,GAAKA,GAAK,GACVkJ,GAAKA,GAAK,GACVlJ,GAAKA,IAAM,GACXkJ,GAAKA,IAAM,GACXwiJ,EAAE5yJ,GAAKkH,EAAIkJ,EAGb2/F,EAAG1mG,EAAIA,EACP0mG,EAAG6iD,EAAIA,EACP7iD,EAAG/vG,EAAIA,EAGT23D,CAAKo4C,EAAImL,GAGX,SAASppD,EAAKjjD,EAAGuB,GAIf,OAHAA,EAAEpQ,EAAI6O,EAAE7O,EACRoQ,EAAE/G,EAAIwF,EAAExF,EACR+G,EAAEwiJ,EAAI/jJ,EAAE+jJ,EAAExuJ,QACHgM,EAGT,SAASgiJ,EAAKl3C,EAAMtqE,GACN,MAARsqE,IAAcA,GAAQ,IAAK76E,MAC/B,IAAIgyH,EAAK,IAAIK,EAAOx3C,GAChBpyG,EAAQ8nC,GAAQA,EAAK9nC,MACrBwpJ,EAAO,WAAa,OAAQD,EAAGzuJ,SAAW,GAAK,YAenD,OAdA0uJ,EAAKE,OAAS,WACZ,GACE,IAEIhkJ,IAFM6jJ,EAAGzuJ,SAAW,KACbyuJ,EAAGzuJ,SAAW,GAAK,aACF,GAAK,UACf,IAAX4K,GACT,OAAOA,GAET8jJ,EAAKC,MAAQF,EAAGzuJ,KAChB0uJ,EAAKG,MAAQH,EACTxpJ,IACEA,EAAM8pJ,GAAG9gG,EAAKhpD,EAAOupJ,GACzBC,EAAKxpJ,MAAQ,WAAa,OAAOgpD,EAAKugG,EAAI,MAErCC,EAGLxnH,GAAUA,EAAOC,QACnBD,EAAOC,QAAUqnH,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC9sJ,KAAKqsJ,QAAUS,EAjHjB,CAqHE9sJ,E,WAEA,S,qBChJF,OAKA,SAAUwsJ,EAAQhnH,EAAQinH,GAE1B,SAASW,EAAOx3C,GACd,IAAInL,EAAKzqG,KAGTyqG,EAAGnsG,KAAO,WAER,IAAwBwM,EAAGlJ,EAAvB0rJ,EAAI7iD,EAAG5mG,EAAGnJ,EAAI+vG,EAAG/vG,EAQrB,OAPAoQ,EAAIwiJ,EAAE5yJ,GAAoBkH,GAAhBkJ,GAAMA,IAAM,GAAaA,GAAK,GACpBlJ,IAApBkJ,EAAIwiJ,EAAG5yJ,EAAI,EAAK,IAAcoQ,IAAM,GAChBlJ,IAApBkJ,EAAIwiJ,EAAG5yJ,EAAI,EAAK,IAAcoQ,IAAM,EAChBlJ,IAApBkJ,EAAIwiJ,EAAG5yJ,EAAI,EAAK,IAAcoQ,GAAK,EACnCA,EAAIwiJ,EAAG5yJ,EAAI,EAAK,GAAuBkH,IAAnBkJ,GAASA,GAAK,IAAeA,GAAK,EACtDwiJ,EAAE5yJ,GAAKkH,EACP6oG,EAAG/vG,EAAKA,EAAI,EAAK,EACVkH,GAGT,SAAc6oG,EAAImL,GAChB,IAAIzsF,EAAMmkI,EAAI,GAEd,GAAI13C,KAAiB,EAAPA,GAER03C,EAAE,GAAK13C,OAIX,IADAA,EAAO,GAAKA,EACPzsF,EAAI,EAAGA,EAAIysF,EAAKn7G,SAAU0uB,EAC7BmkI,EAAM,EAAJnkI,GAAUmkI,EAAM,EAAJnkI,IAAU,GACnBysF,EAAKpqD,WAAWriC,GAAKmkI,EAAGnkI,EAAI,EAAK,IAAM,GAIhD,KAAOmkI,EAAE7yJ,OAAS,GAAG6yJ,EAAE9uJ,KAAK,GAC5B,IAAK2qB,EAAI,EAAGA,EAAI,GAAc,IAATmkI,EAAEnkI,KAAYA,GAOnC,IANS,GAALA,EAAYmkI,EAAE,IAAM,EAAYA,EAAEnkI,GAEtCshF,EAAG5mG,EAAIypJ,EACP7iD,EAAG/vG,EAAI,EAGFyuB,EAAI,IAAKA,EAAI,IAAKA,EACrBshF,EAAGnsG,OAIP+zD,CAAKo4C,EAAImL,GAGX,SAASppD,EAAKjjD,EAAGuB,GAGf,OAFAA,EAAEjH,EAAI0F,EAAE1F,EAAE/E,QACVgM,EAAEpQ,EAAI6O,EAAE7O,EACDoQ,EAGT,SAASgiJ,EAAKl3C,EAAMtqE,GACN,MAARsqE,IAAcA,GAAQ,IAAK76E,MAC/B,IAAIgyH,EAAK,IAAIK,EAAOx3C,GAChBpyG,EAAQ8nC,GAAQA,EAAK9nC,MACrBwpJ,EAAO,WAAa,OAAQD,EAAGzuJ,SAAW,GAAK,YAenD,OAdA0uJ,EAAKE,OAAS,WACZ,GACE,IAEIhkJ,IAFM6jJ,EAAGzuJ,SAAW,KACbyuJ,EAAGzuJ,SAAW,GAAK,aACF,GAAK,UACf,IAAX4K,GACT,OAAOA,GAET8jJ,EAAKC,MAAQF,EAAGzuJ,KAChB0uJ,EAAKG,MAAQH,EACTxpJ,IACEA,EAAMK,GAAG2oD,EAAKhpD,EAAOupJ,GACzBC,EAAKxpJ,MAAQ,WAAa,OAAOgpD,EAAKugG,EAAI,MAErCC,EAGLxnH,GAAUA,EAAOC,QACnBD,EAAOC,QAAUqnH,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC9sJ,KAAKosJ,UAAYU,EAnFnB,CAuFE9sJ,E,WAEA,S,oBC9FF,OAGA,SAAUwsJ,EAAQhnH,EAAQinH,GAE1B,SAASW,EAAOx3C,GACd,IAAInL,EAAKzqG,KAAMqtJ,EAAU,GAGzB5iD,EAAGnsG,KAAO,WACR,IAAIwM,EAAK2/F,EAAG5mG,EAAK4mG,EAAG5mG,IAAM,EAE1B,OADA4mG,EAAG5mG,EAAI4mG,EAAG3mG,EAAG2mG,EAAG3mG,EAAI2mG,EAAGjnE,EAAGinE,EAAGjnE,EAAIinE,EAAG1mG,EAAG0mG,EAAG1mG,EAAI0mG,EAAG7oG,GACzC6oG,EAAGnhG,EAAKmhG,EAAGnhG,EAAI,OAAS,IAC5BmhG,EAAG7oG,EAAK6oG,EAAG7oG,EAAK6oG,EAAG7oG,GAAK,EAAOkJ,EAAKA,GAAK,GAAO,GAGtD2/F,EAAG5mG,EAAI,EACP4mG,EAAG3mG,EAAI,EACP2mG,EAAGjnE,EAAI,EACPinE,EAAG1mG,EAAI,EACP0mG,EAAG7oG,EAAI,EAEHg0G,KAAiB,EAAPA,GAEZnL,EAAG5mG,EAAI+xG,EAGPy3C,GAAWz3C,EAIb,IAAK,IAAIhtE,EAAI,EAAGA,EAAIykH,EAAQ5yJ,OAAS,GAAImuC,IACvC6hE,EAAG5mG,GAA6B,EAAxBwpJ,EAAQ7hG,WAAW5iB,GACvBA,GAAKykH,EAAQ5yJ,SACfgwG,EAAGnhG,EAAImhG,EAAG5mG,GAAK,GAAK4mG,EAAG5mG,IAAM,GAE/B4mG,EAAGnsG,OAIP,SAASkuD,EAAKjjD,EAAGuB,GAOf,OANAA,EAAEjH,EAAI0F,EAAE1F,EACRiH,EAAEhH,EAAIyF,EAAEzF,EACRgH,EAAE04B,EAAIj6B,EAAEi6B,EACR14B,EAAE/G,EAAIwF,EAAExF,EACR+G,EAAElJ,EAAI2H,EAAE3H,EACRkJ,EAAExB,EAAIC,EAAED,EACDwB,EAGT,SAASgiJ,EAAKl3C,EAAMtqE,GAClB,IAAIyhH,EAAK,IAAIK,EAAOx3C,GAChBpyG,EAAQ8nC,GAAQA,EAAK9nC,MACrBwpJ,EAAO,WAAa,OAAQD,EAAGzuJ,SAAW,GAAK,YAenD,OAdA0uJ,EAAKE,OAAS,WACZ,GACE,IAEIhkJ,IAFM6jJ,EAAGzuJ,SAAW,KACbyuJ,EAAGzuJ,SAAW,GAAK,aACF,GAAK,UACf,IAAX4K,GACT,OAAOA,GAET8jJ,EAAKC,MAAQF,EAAGzuJ,KAChB0uJ,EAAKG,MAAQH,EACTxpJ,IACmB,iBAAX,GAAqBgpD,EAAKhpD,EAAOupJ,GAC3CC,EAAKxpJ,MAAQ,WAAa,OAAOgpD,EAAKugG,EAAI,MAErCC,EAGLxnH,GAAUA,EAAOC,QACnBD,EAAOC,QAAUqnH,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,GAAO,8BAElC9sJ,KAAKmsJ,OAASW,EAzEhB,CA6EE9sJ,E,WAEA,S,qBClFF,OAwBA,SAAWwsJ,EAAQe,EAAM57E,GAKzB,IAQI67E,EARA7pJ,EAAQ,IAIR8pJ,EAAa97E,EAAK/+D,IAAIjP,EAHb,GAIT+pJ,EAAe/7E,EAAK/+D,IAAI,EAHf,IAIT+6I,EAA0B,EAAfD,EACXE,EAAOjqJ,IAOX,SAASgyG,EAAWC,EAAM3/C,EAAS/hD,GACjC,IAAIrY,EAAM,GAINgyJ,EAAYC,EAAOtjH,GAHvByrB,EAAsB,GAAXA,EAAmB,CAAE83F,SAAS,GAAU93F,GAAW,IAIpD83F,QAAU,CAACn4C,EAAMo4C,EAAST,IACzB,MAAR33C,EA8IL,WACE,IACE,IAAIhsE,EAQJ,OAPI4jH,IAAe5jH,EAAM4jH,EAAWthG,aAElCtiB,EAAMA,EAAIjmC,IAEVimC,EAAM,IAAIqvB,WAAWt1D,IACpB6oJ,EAAO1sG,QAAU0sG,EAAOyB,UAAUhiG,gBAAgBriB,IAE9CokH,EAASpkH,GAChB,MAAO/oC,GACP,IAAIqtJ,EAAU1B,EAAO2B,UACjBC,EAAUF,GAAWA,EAAQE,QACjC,MAAO,EAAE,IAAIrzH,KAAMyxH,EAAQ4B,EAAS5B,EAAO6B,OAAQL,EAAST,KA5J3Ce,GAAa14C,EAAM,GAAI/5G,GAGtC0yJ,EAAO,IAAIC,EAAK3yJ,GAIhBmxJ,EAAO,WAIT,IAHA,IAAIvtJ,EAAI8uJ,EAAK/sJ,EA5BJ,GA6BL8H,EAAImkJ,EACJ5pJ,EAAI,EACDpE,EAAIiuJ,GACTjuJ,GAAKA,EAAIoE,GAAKF,EACd2F,GAAK3F,EACLE,EAAI0qJ,EAAK/sJ,EAAE,GAEb,KAAO/B,GAAKkuJ,GACVluJ,GAAK,EACL6J,GAAK,EACLzF,KAAO,EAET,OAAQpE,EAAIoE,GAAKyF,GAWnB,OARA0jJ,EAAKC,MAAQ,WAAa,OAAmB,EAAZsB,EAAK/sJ,EAAE,IACxCwrJ,EAAKG,MAAQ,WAAa,OAAOoB,EAAK/sJ,EAAE,GAAK,YAC7CwrJ,EAAKE,OAASF,EAGdc,EAAOE,EAASO,EAAKtd,GAAIsc,IAGjBt3F,EAAQw4F,MAAQv6I,GACpB,SAAS84I,EAAMp3C,EAAM84C,EAAclrJ,GAUjC,OATIA,IAEEA,EAAMytI,GAAKzkF,EAAKhpD,EAAO+qJ,GAE3BvB,EAAKxpJ,MAAQ,WAAa,OAAOgpD,EAAK+hG,EAAM,MAK1CG,GAAgB/8E,EAAY,OAAIq7E,EAAap3C,GAIrCo3C,IAElBA,EACAa,EACA,WAAY53F,EAAUA,EAAQu2F,OAAUxsJ,MAAQ2xE,EAChD1b,EAAQzyD,OAaV,SAASgrJ,EAAK3yJ,GACZ,IAAIiP,EAAG6jJ,EAAS9yJ,EAAIpB,OAChBgwG,EAAKzqG,KAAMtF,EAAI,EAAGyuB,EAAIshF,EAAG/vG,EAAI+vG,EAAGthF,EAAI,EAAGxV,EAAI82F,EAAGwmC,EAAI,GAMtD,IAHK0d,IAAU9yJ,EAAM,CAAC8yJ,MAGfj0J,EAAIiJ,GACTgQ,EAAEjZ,GAAKA,IAET,IAAKA,EAAI,EAAGA,EAAIiJ,EAAOjJ,IACrBiZ,EAAEjZ,GAAKiZ,EAAEwV,EAAIykI,EAAQzkI,EAAIttB,EAAInB,EAAIi0J,IAAW7jJ,EAAI6I,EAAEjZ,KAClDiZ,EAAEwV,GAAKre,GAIR2/F,EAAGjpG,EAAI,SAASk+B,GAIf,IAFA,IAAI50B,EAAG0B,EAAI,EACP9R,EAAI+vG,EAAG/vG,EAAGyuB,EAAIshF,EAAGthF,EAAGxV,EAAI82F,EAAGwmC,EACxBvxG,KACL50B,EAAI6I,EAAEjZ,EAAIkzJ,EAAQlzJ,EAAI,GACtB8R,EAAIA,EAAI7I,EAAQgQ,EAAEi6I,GAASj6I,EAAEjZ,GAAKiZ,EAAEwV,EAAIykI,EAAQzkI,EAAIre,KAAQ6I,EAAEwV,GAAKre,IAGrE,OADA2/F,EAAG/vG,EAAIA,EAAG+vG,EAAGthF,EAAIA,EACV3c,IAIN7I,GAOL,SAAS6oD,EAAKjjD,EAAGuB,GAIf,OAHAA,EAAEpQ,EAAI6O,EAAE7O,EACRoQ,EAAEqe,EAAI5f,EAAE4f,EACRre,EAAEmmI,EAAI1nI,EAAE0nI,EAAEnyI,QACHgM,EAOT,SAAS0/B,EAAQlrC,EAAKsxC,GACpB,IAAqC/R,EAAjC31B,EAAS,GAAI0lJ,SAActvJ,EAC/B,GAAIsxC,GAAgB,UAAPg+G,EACX,IAAK/vH,KAAQv/B,EACX,IAAM4J,EAAO1K,KAAKgsC,EAAQlrC,EAAIu/B,GAAO+R,EAAQ,IAAO,MAAO/vC,IAG/D,OAAQqI,EAAOzO,OAASyO,EAAgB,UAAP0lJ,EAAkBtvJ,EAAMA,EAAM,KAQjE,SAASwuJ,EAAOl4C,EAAM/5G,GAEpB,IADA,IAA4BgzJ,EAAxBC,EAAal5C,EAAO,GAAWzsF,EAAI,EAChCA,EAAI2lI,EAAWr0J,QACpBoB,EAAI+xJ,EAAOzkI,GACTykI,GAASiB,GAAyB,GAAhBhzJ,EAAI+xJ,EAAOzkI,IAAW2lI,EAAWtjG,WAAWriC,KAElE,OAAO6kI,EAASnyJ,GA8BlB,SAASmyJ,EAAS7kJ,GAChB,OAAOm1B,OAAOywH,aAAa3gG,MAAM,EAAGjlD,GAgBtC,GANA2kJ,EAAOn8E,EAAKplB,SAAUghG,GAMa/nH,EAAOC,QAAS,CACjDD,EAAOC,QAAUkwE,EAEjB,IACE63C,EAAa,EAAQ,MACrB,MAAO/zI,eAE+B,KAAxC,aAAoB,OAAOk8F,GAAa,8BAtN1C,CAiOmB,oBAAT76G,KAAwBA,KAAOkF,KACvC,GACAyF,O,gCC3PF,aAYsB,0BAAP,EAUP,WAEN,SAASwxH,IACP,OAAO,EAGT,SAAS+3B,IACP,OAAO,EAGT,SAASroE,KA60CT,OAzyCA,SAASrpF,IAEP,IAAI2xJ,EAAS,CACX,CAAEtvJ,KAAM,SAAaC,KAAM,SAAUiE,GAAK,MAAoB,iBAANA,IACxD,CAAElE,KAAM,SAAaC,KAAM,SAAUiE,GAAK,MAAoB,iBAANA,IACxD,CAAElE,KAAM,UAAaC,KAAM,SAAUiE,GAAK,MAAoB,kBAANA,IACxD,CAAElE,KAAM,WAAaC,KAAM,SAAUiE,GAAK,MAAoB,mBAANA,IACxD,CAAElE,KAAM,QAAaC,KAAMhF,MAAMgD,SACjC,CAAE+B,KAAM,OAAaC,KAAM,SAAUiE,GAAK,OAAOA,aAAak3B,OAC9D,CAAEp7B,KAAM,SAAaC,KAAM,SAAUiE,GAAK,OAAOA,aAAaq2B,SAC9D,CAAEv6B,KAAM,SAAaC,KAAM,SAAUiE,GACnC,MAAoB,iBAANA,GAAwB,OAANA,GAAcA,EAAEtG,cAAgB5B,SAElE,CAAEgE,KAAM,OAAaC,KAAM,SAAUiE,GAAK,OAAa,OAANA,IACjD,CAAElE,KAAM,YAAaC,KAAM,SAAUiE,GAAK,YAAa1F,IAAN0F,KAG/CqrJ,EAAU,CACZvvJ,KAAM,MACNC,KAAMq3H,GAIJk4B,EAAU,GAGVC,EAAe,GAGf7rE,EAAQ,CACV/X,MAAOyjF,EACP5jD,YAAa+jD,EACbl0G,OAAQi0G,GASV,SAASE,EAAgBC,GACvB,IAAIx9H,EAAQy9H,EAAYhsE,EAAM/X,OAAO,SAAU15C,GAC7C,OAAOA,EAAMnyB,OAAS2vJ,KAGxB,GAAIx9H,EACF,OAAOA,EAGT,GAAiB,QAAbw9H,EACF,OAAOJ,EAGT,IAAIM,EAAOD,EAAYhsE,EAAM/X,OAAO,SAAU15C,GAC5C,OAAOA,EAAMnyB,KAAKu9B,gBAAkBoyH,EAASpyH,iBAG/C,MAAM,IAAI/hC,UAAU,iBAAmBm0J,EAAW,KAC7CE,EAAQ,mBAAqBA,EAAK7vJ,KAAO,KAAQ,KAQxD,SAAS8vJ,EAAcrvJ,GACrB,OAAIA,IAAS8uJ,EACJ,IAGF3rE,EAAM/X,MAAMx5C,QAAQ5xB,GAS7B,SAASsvJ,EAAa5yJ,GACpB,IAAIg1B,EAAQy9H,EAAYhsE,EAAM/X,OAAO,SAAU15C,GAC7C,OAAOA,EAAMlyB,KAAK9C,MAGpB,GAAIg1B,EACF,OAAOA,EAAMnyB,KAGf,MAAM,IAAIxE,UAAU,kCAAoC2B,GA+E1D,SAAS6yJ,EAAiBr9H,GACxB,OAAOA,EACF3b,KAAI,SAAUo9D,GACb,IAAI67E,EAAY77E,EAAMvI,MAAM70D,IAAIk5I,GAEhC,OAAQ97E,EAAM+7E,UAAY,MAAQ,IAAMF,EAAU5mH,KAAK,QAExDA,KAAK,KASZ,SAAS+mH,EAAYh8E,EAAOs3B,GAC1B,IAAIykD,EAAqC,IAAzB/7E,EAAM/hD,QAAQ,OAO1B49H,GANUE,EAEP/7E,EAAMt5E,OAAS,EACZs5E,EAAMj1E,MAAM,GACZ,MAHJi1E,GAKgB3gD,MAAM,KAAKzc,IAAIiY,GAChCzhB,OAAO6iJ,GACP7iJ,OAAO8iJ,GAERC,EA+cN,SAA2B7kD,EAAaukD,GACtC,IAAI32D,EAAU,GAUd,OARAoS,EAAY1pG,SAAQ,SAAUwuJ,IACgB,IAAxCP,EAAU59H,QAAQm+H,EAAW/wJ,QACS,IAAtCwwJ,EAAU59H,QAAQm+H,EAAWj4E,KAC5B+gB,EAAQk3D,EAAW/wJ,QACtB65F,EAAQk3D,EAAW/wJ,MAAQ+wJ,MAIxBx0J,OAAO4G,KAAK02F,GAAStiF,KAAI,SAAUvX,GACxC,OAAO65F,EAAQ75F,MA3dSgxJ,CAAkB/kD,EAAaukD,GAErDS,EAAaT,EAAUj5I,KAAI,SAAU24I,GACvC,IAAIlvJ,EAAOivJ,EAAeC,GAE1B,MAAO,CACL3vJ,KAAM2vJ,EACNgB,UAAWb,EAAcrvJ,GACzBR,KAAMQ,EAAKR,KACXuwJ,WAAY,KACZI,iBAAkB,MAIlBC,EAAmBN,EAAoBv5I,KAAI,SAAUw5I,GACvD,IAAI/vJ,EAAOivJ,EAAec,EAAW/wJ,MAErC,MAAO,CACLO,KAAMwwJ,EAAW/wJ,KACjBkxJ,UAAWb,EAAcrvJ,GACzBR,KAAMQ,EAAKR,KACXuwJ,WAAYA,EACZI,gBAAiBllD,EAAYr5E,QAAQm+H,OAIzC,MAAO,CACL3kF,MAAO6kF,EAAWnuH,OAAOsuH,GACzBV,UAAWA,GAgDf,SAASW,EAAan+H,GACpB,IAAIyhD,EAAQjmC,EAAKxb,GACjB,QAAOyhD,GAAQA,EAAM+7E,UASvB,SAASY,EAAe38E,GACtB,OAAOA,EAAMvI,MAAM/9D,MAAK,SAAUrN,GAChC,OAA0B,MAAnBA,EAAK+vJ,cAUhB,SAASQ,EAAY58E,GACnB,GAAKA,GAAgC,IAAvBA,EAAMvI,MAAM/wE,OAIrB,IAA2B,IAAvBs5E,EAAMvI,MAAM/wE,OACnB,OAAO40J,EAAet7E,EAAMvI,MAAM,GAAG7rE,MAAMC,KAExC,GAA2B,IAAvBm0E,EAAMvI,MAAM/wE,OAAc,CACjC,IAAIm2J,EAAQvB,EAAet7E,EAAMvI,MAAM,GAAG7rE,MAAMC,KAC5CixJ,EAAQxB,EAAet7E,EAAMvI,MAAM,GAAG7rE,MAAMC,KAChD,OAAO,SAAYiE,GACjB,OAAO+sJ,EAAM/sJ,IAAMgtJ,EAAMhtJ,IAI3B,IAAIitJ,EAAQ/8E,EAAMvI,MAAM70D,KAAI,SAAUvW,GACpC,OAAOivJ,EAAejvJ,EAAKT,MAAMC,QAEnC,OAAO,SAAYiE,GACjB,IAAK,IAAInJ,EAAI,EAAGA,EAAIo2J,EAAMr2J,OAAQC,IAChC,GAAIo2J,EAAMp2J,GAAGmJ,GACX,OAAO,EAGX,OAAO,GAtBT,OAAOozH,EAgCX,SAAS85B,EAAaz+H,GACpB,IAAIw+H,EAAOF,EAAOC,EAwvBHt2J,EAtvBf,GAAIk2J,EAAan+H,GAAS,CAGxB,IAAI0+H,GADJF,GAovBav2J,EApvBG+3B,EAqvBX/3B,EAAIuE,MAAM,EAAGvE,EAAIE,OAAS,IArvBPkc,IAAIg6I,IACPl2J,OACjBw2J,EAAWN,EAAY7iH,EAAKxb,IAUhC,OAAO,SAAkB+J,GACvB,IAAK,IAAI3hC,EAAI,EAAGA,EAAIo2J,EAAMr2J,OAAQC,IAChC,IAAKo2J,EAAMp2J,GAAG2hC,EAAK3hC,IACjB,OAAO,EAGX,OAfkB,SAAU2hC,GAC5B,IAAK,IAAI3hC,EAAIs2J,EAAUt2J,EAAI2hC,EAAK5hC,OAAQC,IACtC,IAAKu2J,EAAS50H,EAAK3hC,IACjB,OAAO,EAGX,OAAO,EASAw2J,CAAc70H,IAAUA,EAAK5hC,QAAUu2J,EAAW,GAK3D,OAAsB,IAAlB1+H,EAAO73B,OACF,SAAkB4hC,GACvB,OAAuB,IAAhBA,EAAK5hC,QAGW,IAAlB63B,EAAO73B,QACdm2J,EAAQD,EAAYr+H,EAAO,IACpB,SAAkB+J,GACvB,OAAOu0H,EAAMv0H,EAAK,KAAuB,IAAhBA,EAAK5hC,SAGP,IAAlB63B,EAAO73B,QACdm2J,EAAQD,EAAYr+H,EAAO,IAC3Bu+H,EAAQF,EAAYr+H,EAAO,IACpB,SAAkB+J,GACvB,OAAOu0H,EAAMv0H,EAAK,KAAOw0H,EAAMx0H,EAAK,KAAuB,IAAhBA,EAAK5hC,UAIlDq2J,EAAQx+H,EAAO3b,IAAIg6I,GACZ,SAAkBt0H,GACvB,IAAK,IAAI3hC,EAAI,EAAGA,EAAIo2J,EAAMr2J,OAAQC,IAChC,IAAKo2J,EAAMp2J,GAAG2hC,EAAK3hC,IACjB,OAAO,EAGX,OAAO2hC,EAAK5hC,SAAWq2J,EAAMr2J,SAcrC,SAAS02J,EAAgBttE,EAAW/kD,GAClC,OAAOA,EAAQ+kD,EAAUvxD,OAAO73B,OAC1BopF,EAAUvxD,OAAOwM,GACjB2xH,EAAa5sE,EAAUvxD,QACnBwb,EAAK+1C,EAAUvxD,QACf,KAUZ,SAAS8+H,EAAsBvtE,EAAW/kD,EAAOuyH,GAC/C,IAAIt9E,EAAQo9E,EAAgBttE,EAAW/kD,GAOvC,OANYi1C,EACNs9E,EACQt9E,EAAMvI,MAAMr+D,OAAOmkJ,GACnBv9E,EAAMvI,MACd,IAEO70D,IAAIk5I,GAQnB,SAASA,EAAYzvJ,GACnB,OAAOA,EAAKT,KAQd,SAAS2xJ,EAAYlxJ,GACnB,OAA2B,OAApBA,EAAK+vJ,iBAA2ChyJ,IAApBiC,EAAK+vJ,WAU1C,SAASoB,EAAoBxtE,EAAYjlD,GACvC,IAAI8wH,EAwsBN,SAAcr1J,GAEZ,IADA,IAAIm9B,EAAU,GACLh9B,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9Bg9B,EAAQn9B,EAAIG,KAAM,EAEpB,OAAOiB,OAAO4G,KAAKm1B,GA7sBH85H,CAAKC,EAAQ1tE,GAAY,SAAUF,GACjD,OAAOutE,EAAqBvtE,EAAW/kD,GAAO,OAGhD,OAAsC,IAA9B8wH,EAAU59H,QAAQ,OAAiB,CAAC,OAAS49H,EAWvD,SAAS1hG,EAAYvuD,EAAM08B,EAAM0nD,GAC/B,IAAItlF,EAAK0jJ,EAKLrjH,EAJAygD,EAAQ5/E,GAAQ,UAGhB+xJ,EAAqB3tE,EAEzB,IAAKjlD,EAAQ,EAAGA,EAAQzC,EAAK5hC,OAAQqkC,IAAS,CAC5C,IAAI6yH,EAAmBD,EAAmBvkJ,QAAO,SAAU02E,GACzD,IAAIjkF,EAAO+wJ,EAAYQ,EAAgBttE,EAAW/kD,IAClD,OAAQA,EAAQ+kD,EAAUvxD,OAAO73B,QAAUg2J,EAAa5sE,EAAUvxD,UAC9D1yB,EAAKy8B,EAAKyC,OAGhB,GAAgC,IAA5B6yH,EAAiBl3J,QAGnB,IADA0nJ,EAAWoP,EAAoBG,EAAoB5yH,IACtCrkC,OAAS,EAAG,CACvB,IAAIm3J,EAAalC,EAAarzH,EAAKyC,IAYnC,OAVArgC,EAAM,IAAItD,UAAU,2CAA6CokF,EAC7D,eAAiB4iE,EAASn5G,KAAK,QAC/B,aAAe4oH,EAAa,YAAc9yH,EAAQ,MAClD/9B,KAAO,CACT4kB,SAAU,YACVk5B,GAAI0gC,EACJzgD,MAAOA,EACPojH,OAAQ0P,EACRzP,SAAUA,GAEL1jJ,QAITizJ,EAAqBC,EAKzB,IAAIE,EAAUH,EAAmB/6I,KAAI,SAAUktE,GAC7C,OAAO4sE,EAAa5sE,EAAUvxD,QAAUmS,IAAWo/C,EAAUvxD,OAAO73B,UAEtE,GAAI4hC,EAAK5hC,OAASgL,KAAK+iB,IAAI4lC,MAAM,KAAMyjG,GAWrC,OAVA1P,EAAWoP,EAAoBG,EAAoB5yH,IACnDrgC,EAAM,IAAItD,UAAU,iCAAmCokF,EACnD,eAAiB4iE,EAASn5G,KAAK,QAC/B,YAAc3M,EAAK5hC,OAAS,MAC5BsG,KAAO,CACT4kB,SAAU,aACVk5B,GAAI0gC,EACJzgD,MAAOzC,EAAK5hC,OACZ0nJ,SAAUA,GAEL1jJ,EAIT,IAAIqzJ,EAAYrsJ,KAAKijB,IAAI0lC,MAAM,KAAMyjG,GACrC,OAAIx1H,EAAK5hC,OAASq3J,IAChBrzJ,EAAM,IAAItD,UAAU,kCAAoCokF,EACpD,eAAiBuyE,EAAY,aAAez1H,EAAK5hC,OAAS,MAC1DsG,KAAO,CACT4kB,SAAU,cACVk5B,GAAI0gC,EACJzgD,MAAOzC,EAAK5hC,OACZs3J,eAAgBD,GAEXrzJ,KAGTA,EAAM,IAAItD,UAAU,sBAAwBkhC,EAAK2M,KAAK,MAClD,4DAA8Du2C,EAAQ,MACtEx+E,KAAO,CACT4kB,SAAU,WACVu8H,OAAQ7lH,EAAK1lB,IAAI+4I,IAEZjxJ,GAQT,SAASuzJ,EAAoBj+E,GAG3B,IAFA,IAAIvrD,EAAM,IAED9tB,EAAI,EAAGA,EAAIq5E,EAAMvI,MAAM/wE,OAAQC,IAClC42J,EAAYv9E,EAAMvI,MAAM9wE,MAC1B8tB,EAAM/iB,KAAK+iB,IAAIA,EAAKurD,EAAMvI,MAAM9wE,GAAG41J,YAIvC,OAAO9nI,EAST,SAASypI,EAA0Bl+E,GAGjC,IAFA,IAAIvrD,EAAM,IAED9tB,EAAI,EAAGA,EAAIq5E,EAAMvI,MAAM/wE,OAAQC,IACjC42J,EAAYv9E,EAAMvI,MAAM9wE,MAC3B8tB,EAAM/iB,KAAK+iB,IAAIA,EAAKurD,EAAMvI,MAAM9wE,GAAG61J,kBAIvC,OAAO/nI,EAWT,SAAS0pI,EAAeC,EAAQC,GAC9B,IAAI/oJ,EAIJ,OAAU,IADVA,EAAI8oJ,EAAOrC,UAAYsC,EAAOtC,YAOpB,IADVzmJ,EAAIqnJ,EAAeyB,GAAUzB,EAAe0B,KAOlC,IADV/oJ,EAAI2oJ,EAAmBG,GAAUH,EAAmBI,IAV3C/oJ,EAgBF4oJ,EAAyBE,GAAUF,EAAyBG,GAWrE,SAASC,EAAmBC,EAAYC,GACtC,IACI73J,EACA2O,EAFA7O,EAAMiL,KAAK+iB,IAAI8pI,EAAWhgI,OAAO73B,OAAQ83J,EAAWjgI,OAAO73B,QAM/D,GAAU,IADV4O,EAAIipJ,EAAWhgI,OAAO7kB,KAAKijJ,GAAkB6B,EAAWjgI,OAAO7kB,KAAKijJ,IAElE,OAAOrnJ,EAIT,IAAK3O,EAAI,EAAGA,EAAIF,EAAKE,IAEnB,GAAU,IADV2O,EAAIqnJ,EAAe4B,EAAWhgI,OAAO53B,IAAMg2J,EAAe6B,EAAWjgI,OAAO53B,KAE1E,OAAO2O,EAKX,IAAK3O,EAAI,EAAGA,EAAIF,EAAKE,IAEnB,GAAU,KADV2O,EAAI6oJ,EAAcI,EAAWhgI,OAAO53B,GAAI63J,EAAWjgI,OAAO53B,KAExD,OAAO2O,EAKX,OAAOipJ,EAAWhgI,OAAO73B,OAAS83J,EAAWjgI,OAAO73B,OA6EtD,SAAS+3J,EAAqBz+E,GAC5B,IAAI68E,EAAOC,EAAO4B,EAAaC,EAC3B5B,EAAQ,GACRzlD,EAAc,GAUlB,OARAt3B,EAAMvI,MAAM7pE,SAAQ,SAAUvB,GACxBA,EAAK+vJ,aACPW,EAAMtyJ,KAAK6wJ,EAAejvJ,EAAK+vJ,WAAW/wJ,MAAMQ,MAChDyrG,EAAY7sG,KAAK4B,EAAK+vJ,WAAWroF,aAK7BujC,EAAY5wG,QAClB,KAAK,EACH,OAAO,SAAoBqpC,GACzB,OAAOA,GAGX,KAAK,EAGH,OAFA8sH,EAAQE,EAAM,GACd2B,EAAcpnD,EAAY,GACnB,SAAoBvnE,GACzB,OAAI8sH,EAAM9sH,GACD2uH,EAAY3uH,GAEdA,GAGX,KAAK,EAKH,OAJA8sH,EAAQE,EAAM,GACdD,EAAQC,EAAM,GACd2B,EAAcpnD,EAAY,GAC1BqnD,EAAcrnD,EAAY,GACnB,SAAoBvnE,GACzB,OAAI8sH,EAAM9sH,GACD2uH,EAAY3uH,GAEjB+sH,EAAM/sH,GACD4uH,EAAY5uH,GAEdA,GAGX,QACE,OAAO,SAAoBA,GACzB,IAAK,IAAIppC,EAAI,EAAGA,EAAI2wG,EAAY5wG,OAAQC,IACtC,GAAIo2J,EAAMp2J,GAAGopC,GACX,OAAOunE,EAAY3wG,GAAGopC,GAG1B,OAAOA,IA+Cf,SAAS6uH,EAAYrgI,EAAQsgI,GA4C3B,OA3CA,SAASC,EAAavgI,EAAQwM,EAAO0sC,GACnC,GAAI1sC,EAAQxM,EAAO73B,OAAQ,CACzB,IAIIq4J,EAJA/+E,EAAQzhD,EAAOwM,GACfi0H,EAAgBH,EACd7+E,EAAMvI,MAAMr+D,OAAOmkJ,GACnBv9E,EAAMvI,MAGZ,GAAIuI,EAAM+7E,UAAW,CAGnB,IAAIO,EAAa0C,EAAc5lJ,OAAOmkJ,GACtCwB,EAAazC,EAAW51J,OAASs4J,EAAct4J,OACzC,CAAC41J,EAAY0C,GACb,CAACA,QAKPD,EAAaC,EAAcp8I,KAAI,SAAUvW,GACvC,MAAO,CAACA,MAKZ,OAAOqxJ,EAAQqB,GAAY,SAAUE,GACnC,OAAOH,EAAavgI,EAAQwM,EAAQ,EAAG0sC,EAAMtpC,OAAO,CAAC8wH,QAavD,MAAO,CAPcxnF,EAAM70D,KAAI,SAAUvW,EAAMkwJ,GAC7C,MAAO,CACL9kF,MAAOprE,EACP0vJ,UAAYQ,IAAch+H,EAAO73B,OAAS,GAAMg2J,EAAan+H,QAQ9DugI,CAAavgI,EAAQ,EAAG,IAyCjC,SAAS2gI,EAAoBtzJ,EAAMuzJ,GACjC,GAA0C,IAAtCv3J,OAAO4G,KAAK2wJ,GAAez4J,OAC7B,MAAM,IAAIwoC,YAAY,0BAIxB,IAAIkwH,EAAmB,GACvBx3J,OAAO4G,KAAK2wJ,GACPv8I,KAAI,SAAUktE,GACb,OAzqBR,SAAyBA,EAAWhlC,EAAIwsD,GACtC,IAAI/4E,EAAS,GAkBb,MAhByB,KAArBuxD,EAAUj1D,SACZ0D,EAASuxD,EACJzwD,MAAM,KACNzc,IAAIiY,GACJjY,KAAI,SAAUo9D,EAAOj1C,EAAOs6B,GAC3B,IAAIg6F,EAAcrD,EAAWh8E,EAAOs3B,GAEpC,GAAI+nD,EAAYtD,WAAchxH,IAAUs6B,EAAM3+D,OAAS,EACrD,MAAM,IAAIwoC,YAAY,8BAAgC8wC,EAAhC,0CAIxB,OAAOq/E,MAIX9gI,EAAO7kB,KAAK4lJ,GAGP,KAGF,CACL/gI,OAAQA,EACRusB,GAAIA,GA8oBOy0G,CAAezvE,EAAWqvE,EAAcrvE,GAAYN,EAAM8nB,gBAElEl+F,OAAOomJ,GACP5xJ,SAAQ,SAAU6xJ,GAEjB,IAAIC,EAAuBlE,EAAY4D,GAAkB,SAAUx/I,GACjE,OA/CV,SAA8B2+I,EAAYC,GAGxC,IAFA,IAAIpyD,EAAK16F,KAAKijB,IAAI4pI,EAAWhgI,OAAO73B,OAAQ83J,EAAWjgI,OAAO73B,QAErDC,EAAI,EAAGA,EAAIylG,EAAIzlG,IAItB,IAAKg5J,EAHatC,EAAqBkB,EAAY53J,GAAG,GACpC02J,EAAqBmB,EAAY73J,GAAG,IAGpD,OAAO,EAIX,IAAIi5J,EAAOrB,EAAWhgI,OAAO73B,OACzBm5J,EAAOrB,EAAWjgI,OAAO73B,OACzBo5J,EAAapD,EAAa6B,EAAWhgI,QACrCwhI,EAAarD,EAAa8B,EAAWjgI,QAEzC,OAAOuhI,EACDC,EAAcH,IAASC,EAASA,GAAQD,EACxCG,EAAcH,GAAQC,EAAUD,IAASC,EA4BhCG,CAAqBpgJ,EAAG6/I,MAEjC,GAAIC,EACF,MAAM,IAAIt4J,UAAU,2BAChBw0J,EAAgB8D,EAAqBnhI,QAAU,UAC/Cq9H,EAAgB6D,EAAgBlhI,QAAU,MAGhD6gI,EAAiB30J,KAAKg1J,MAI5B,IAAIzvE,EAAa0tE,EAAQ0B,GAAkB,SAAUK,GAGnD,OAFaA,EAAkBb,EAAYa,EAAgBlhI,QAAQ,GAAS,IAE9D3b,KAAI,SAAU2b,GAC1B,MAAO,CACLA,OAAQA,EACRusB,GAAI20G,EAAgB30G,UAGvB1xC,OAAOomJ,GAEVxvE,EAAW9uC,KAAKo9G,GAGhB,IAAI2B,EAAMjwE,EAAW,IAAMA,EAAW,GAAGzxD,OAAO73B,QAAU,IAAMg2J,EAAa1sE,EAAW,GAAGzxD,QACvF2hI,EAAMlwE,EAAW,IAAMA,EAAW,GAAGzxD,OAAO73B,QAAU,IAAMg2J,EAAa1sE,EAAW,GAAGzxD,QACvF4hI,EAAMnwE,EAAW,IAAMA,EAAW,GAAGzxD,OAAO73B,QAAU,IAAMg2J,EAAa1sE,EAAW,GAAGzxD,QACvF6hI,EAAMpwE,EAAW,IAAMA,EAAW,GAAGzxD,OAAO73B,QAAU,IAAMg2J,EAAa1sE,EAAW,GAAGzxD,QACvF8hI,EAAMrwE,EAAW,IAAMA,EAAW,GAAGzxD,OAAO73B,QAAU,IAAMg2J,EAAa1sE,EAAW,GAAGzxD,QACvF+hI,EAAMtwE,EAAW,IAAMA,EAAW,GAAGzxD,OAAO73B,QAAU,IAAMg2J,EAAa1sE,EAAW,GAAGzxD,QACvFgiI,EAAQN,GAAOC,GAAOC,GAAOC,GAAOC,GAAOC,EAG3CvD,EAAQ/sE,EAAWptE,KAAI,SAAUktE,GACnC,OAAOktE,EAAaltE,EAAUvxD,WAG5BiiI,EAASP,EAAMrD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtDwF,EAASP,EAAMtD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtDyF,EAASP,EAAMvD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtD0F,EAASP,EAAMxD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtD2F,EAASP,EAAMzD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtD4F,EAASP,EAAM1D,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EAEtD6F,EAASb,EAAMrD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtD8F,EAASb,EAAMtD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtD+F,EAASb,EAAMvD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtDgG,EAASb,EAAMxD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtDiG,EAASb,EAAMzD,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EACtDkG,EAASb,EAAM1D,EAAY5sE,EAAW,GAAGzxD,OAAO,IAAM08H,EAGtDmG,EAAMpxE,EAAWptE,KAAI,SAASktE,GAChC,OAvSJ,SAAkCvxD,EAAQusB,GACxC,IAAIu2G,EAAYv2G,EAIhB,GAAIvsB,EAAO7kB,KAAKijJ,GAAiB,CAC/B,IAAIZ,EAAYW,EAAan+H,GACzB+iI,EAAsB/iI,EAAO3b,IAAI67I,GAErC4C,EAAY,WAGV,IAFA,IAAI/4H,EAAO,GACPyR,EAAOgiH,EAAY9vH,UAAUvlC,OAAS,EAAIulC,UAAUvlC,OAC/CC,EAAI,EAAGA,EAAIozC,EAAMpzC,IACxB2hC,EAAK3hC,GAAK26J,EAAoB36J,GAAGslC,UAAUtlC,IAM7C,OAJIo1J,IACFzzH,EAAKyR,GAAQ9N,UAAU8N,GAAMn3B,IAAI0+I,EAAoBvnH,KAGhD+Q,EAAGuP,MAAMpuD,KAAMq8B,IAI1B,IAAIi5H,EAAeF,EACnB,GAAI3E,EAAan+H,GAAS,CACxB,IAAI4B,EAAS5B,EAAO73B,OAAS,EAE7B66J,EAAe,WACb,OAAOF,EAAUhnG,MAAMpuD,KACnBlB,EAAMkhC,UAAW,EAAG9L,GAAQgO,OAAO,CAACpjC,EAAMkhC,UAAW9L,OAI7D,OAAOohI,EAsQEC,CAAyB1xE,EAAUvxD,OAAQuxD,EAAUhlC,OAG1D22G,EAAMxB,EAAMmB,EAAI,GAAKxuE,EACrB8uE,EAAMxB,EAAMkB,EAAI,GAAKxuE,EACrB+uE,EAAMxB,EAAMiB,EAAI,GAAKxuE,EACrBgvE,EAAMxB,EAAMgB,EAAI,GAAKxuE,EACrBivE,EAAMxB,EAAMe,EAAI,GAAKxuE,EACrBkvE,EAAMxB,EAAMc,EAAI,GAAKxuE,EAErBmvE,EAAO9B,EAAMjwE,EAAW,GAAGzxD,OAAO73B,QAAU,EAC5Ck5J,EAAOM,EAAMlwE,EAAW,GAAGzxD,OAAO73B,QAAU,EAC5Cm5J,GAAOM,EAAMnwE,EAAW,GAAGzxD,OAAO73B,QAAU,EAC5Cs7J,GAAO5B,EAAMpwE,EAAW,GAAGzxD,OAAO73B,QAAU,EAC5Cu7J,GAAO5B,EAAMrwE,EAAW,GAAGzxD,OAAO73B,QAAU,EAC5Cw7J,GAAO5B,EAAMtwE,EAAW,GAAGzxD,OAAO73B,QAAU,EAG5Cy7J,GAAS5B,EAAQ,EAAI,EACrB6B,GAAOpyE,EAAWtpF,OAClB27J,GAAU,WAGZ,IAAK,IAAI17J,EAAIw7J,GAAQx7J,EAAIy7J,GAAMz7J,IAC7B,GAAIo2J,EAAMp2J,GAAGslC,WACX,OAAOm1H,EAAIz6J,GAAG0zD,MAAMpuD,KAAMggC,WAI9B,MAAMkuB,EAAYvuD,EAAMqgC,UAAW+jD,IAKjCllC,GAAK,SAASA,EAAG6W,EAAM4pB,GAGzB,OAAIt/C,UAAUvlC,SAAWq7J,GAAQvB,EAAO7+F,IAASm/F,EAAOv1E,GAAgBk2E,EAAIpnG,MAAMvP,EAAI7e,WAClFA,UAAUvlC,SAAWk5J,GAAQa,EAAO9+F,IAASo/F,EAAOx1E,GAAgBm2E,EAAIrnG,MAAMvP,EAAI7e,WAClFA,UAAUvlC,SAAWm5J,IAAQa,EAAO/+F,IAASq/F,EAAOz1E,GAAgBo2E,EAAItnG,MAAMvP,EAAI7e,WAClFA,UAAUvlC,SAAWs7J,IAAQrB,EAAOh/F,IAASs/F,EAAO11E,GAAgBq2E,EAAIvnG,MAAMvP,EAAI7e,WAClFA,UAAUvlC,SAAWu7J,IAAQrB,EAAOj/F,IAASu/F,EAAO31E,GAAgBs2E,EAAIxnG,MAAMvP,EAAI7e,WAClFA,UAAUvlC,SAAWw7J,IAAQrB,EAAOl/F,IAASw/F,EAAO51E,GAAgBu2E,EAAIznG,MAAMvP,EAAI7e,WAE/Eo2H,GAAQhoG,MAAMvP,EAAI7e,YAI3B,IACErkC,OAAOC,eAAeijD,GAAI,OAAQ,CAAC/hD,MAAO6C,IAE5C,MAAOlB,IASP,OAFAogD,GAAGklC,WApPL,SAA6BA,GAC3B,IAAImvE,EAAgB,GASpB,OARAnvE,EAAWpiF,SAAQ,SAAUkiF,GACtBA,EAAUvxD,OAAO7kB,KAAKijJ,IACzBiC,EAAY9uE,EAAUvxD,QAAQ,GAAM3wB,SAAQ,SAAU2wB,GACpD4gI,EAAcvD,EAAgBr9H,IAAWuxD,EAAUhlC,SAKlDq0G,EA0OSmD,CAAoBtyE,GAE7BllC,GAQT,SAASoxG,EAAUX,GACjB,OAA2C,IAApC/rE,EAAMroC,OAAOlpB,QAAQs9H,GAQ9B,SAAS1gI,EAAKyQ,GACZ,OAAOA,EAAIzQ,OAQb,SAASohI,EAAS3wH,GAChB,QAASA,EAQX,SAASk0H,EAAQz2J,GACf,OAAiB,OAAVA,EAQT,SAASu2J,EAAgBt/E,GACvB,OAA8B,IAAvBA,EAAMvI,MAAM/wE,OAiBrB,SAASqzC,EAAKvzC,GACZ,OAAOA,EAAIA,EAAIE,OAAS,GAU1B,SAASqE,EAAMvE,EAAKmY,EAAOC,GACzB,OAAO/X,MAAMqB,UAAU6C,MAAMpC,KAAKnC,EAAKmY,EAAOC,GAmBhD,SAAS+gJ,EAAW4C,EAAQC,GAC1B,IAAK,IAAI77J,EAAI,EAAGA,EAAI47J,EAAO77J,OAAQC,IACjC,GAZc0+D,EAYDm9F,EAZQpjF,EAYAmjF,EAAO57J,IAXE,IAAzB0+D,EAAMpnC,QAAQmhD,GAYjB,OAAO,EAbb,IAAkB/Z,EAAO+Z,EAiBvB,OAAO,EAUT,SAASo8E,EAAYh1J,EAAKqF,GACxB,IAAK,IAAIlF,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9B,GAAIkF,EAAKrF,EAAIG,IACX,OAAOH,EAAIG,GA0BjB,SAAS+2J,EAAQl3J,EAAK2Z,GACpB,OAAOtZ,MAAMqB,UAAUimC,OAAOksB,MAAM,GAAI7zD,EAAIoc,IAAIzC,IAQlD,SAASsiJ,EAASrB,GAGhB,IAFA,IAAIx1J,EAAO,GAEFjF,EAAI,EAAGA,EAAIy6J,EAAI16J,OAAQC,IAAK,CACnC,IAAImkD,EAAKs2G,EAAIz6J,GAGb,IAA8B,iBAAlBmkD,EAAGklC,YAAmD,iBAAjBllC,EAAGglC,YAAuC,KAAZhlC,EAAGl/C,KAChF,GAAa,KAATA,EACFA,EAAOk/C,EAAGl/C,UAEP,GAAIA,IAASk/C,EAAGl/C,KAAM,CACzB,IAAIlB,EAAM,IAAI0iC,MAAM,0CAA4CxhC,EAAO,aAAek/C,EAAGl/C,KAAO,KAKhG,MAJAlB,EAAIsC,KAAO,CACTmhJ,OAAQrjG,EAAGl/C,KACXwiJ,SAAUxiJ,GAENlB,GAKZ,OAAOkB,EAIT,SAAS82J,EAAkBtB,GACzB,IAAI12J,EACAy0J,EAAgB,GAEpB,SAASwD,EAAeC,EAAYC,GAClC,GAAI1D,EAAcz2J,eAAek6J,IAAeC,IAAQ1D,EAAcyD,GAGpE,MAFAl4J,EAAM,IAAI0iC,MAAM,cAAgBw1H,EAAa,uBACzC51J,KAAO,CAAC8iF,UAAW8yE,GACjBl4J,EAKV,IAAK,IAAI/D,EAAI,EAAGA,EAAIy6J,EAAI16J,OAAQC,IAAK,CACnC,IAAImkD,EAAKs2G,EAAIz6J,GAGb,GAA6B,iBAAlBmkD,EAAGklC,WAEZ,IAAK,IAAIF,KAAahlC,EAAGklC,WACnBllC,EAAGklC,WAAWtnF,eAAeonF,KAC/B6yE,EAAe7yE,EAAWhlC,EAAGklC,WAAWF,IACxCqvE,EAAcrvE,GAAahlC,EAAGklC,WAAWF,QAI1C,IAA4B,iBAAjBhlC,EAAGglC,UAOjB,MAFAplF,EAAM,IAAItD,UAAU,yCAA2CT,EAAI,MAC/DqG,KAAO,CAAC+9B,MAAOpkC,GACb+D,EANNi4J,EAAe73G,EAAGglC,UAAWhlC,GAC7Bq0G,EAAcr0G,EAAGglC,WAAahlC,GASlC,OAAOq0G,EAoET,OAjEA3vE,EAAQ0vE,EAAoB,QAAS,CACnC,iBAAkBA,EAClB,OAAU,SAAUC,GAElB,IAAIiC,EAAM,GACV,IAAK,IAAItxE,KAAaqvE,EAChBA,EAAcz2J,eAAeonF,IAC/BsxE,EAAI32J,KAAK00J,EAAcrvE,IAI3B,OAAOovE,EADIuD,EAAQrB,GACcjC,IAEnC,cAAe,SAAUiC,GACvB,OAAOlC,EAAoBuD,EAAQrB,GAAMsB,EAAkBtB,KAE7D,sBAAuB,SAAUx1J,EAAMw1J,GACrC,OAAOlC,EAAoBtzJ,EAAM82J,EAAkBtB,QAIjD73J,OAASA,EACfimF,EAAM/X,MAAQyjF,EACd1rE,EAAM8nB,YAAc+jD,EACpB7rE,EAAMroC,OAASi0G,EACf5rE,EAAMzb,QA5mCN,SAAkBhrE,EAAOsD,GACvB,IAAIhB,EAAOswJ,EAAa5yJ,GAGxB,GAAIsD,IAAShB,EACX,OAAOtC,EAGT,IAAK,IAAIpC,EAAI,EAAGA,EAAI6oF,EAAM8nB,YAAY5wG,OAAQC,IAAK,CACjD,IAAIy1J,EAAa5sE,EAAM8nB,YAAY3wG,GACnC,GAAIy1J,EAAW/wJ,OAASA,GAAQ+wJ,EAAWj4E,KAAO93E,EAChD,OAAO+vJ,EAAWroF,QAAQhrE,GAI9B,MAAM,IAAIqkC,MAAM,uBAAyB/hC,EAAO,OAASgB,IA8lC3DmjF,EAAMzzC,KAnpCN,SAAe+O,EAAIglC,GACjB,IAAKhlC,EAAGklC,WACN,MAAM,IAAI5oF,UAAU,iCAItB,IAAIZ,EACJ,GAAyB,iBAAdspF,EAAwB,CACjCtpF,EAAMspF,EAAUzwD,MAAM,KACtB,IAAK,IAAI14B,EAAI,EAAGA,EAAIH,EAAIE,OAAQC,IAC9BH,EAAIG,GAAKH,EAAIG,GAAGk0B,WAGf,KAAIh0B,MAAMgD,QAAQimF,GAIrB,MAAM,IAAI1oF,UAAU,qDAHpBZ,EAAMspF,EAMR,IAAIxkD,EAAM9kC,EAAIyuC,KAAK,KAGfrF,EAAQkb,EAAGklC,WAAW1kD,GAC1B,GAAIsE,EACF,OAAOA,EAKT,MAAM,IAAIxoC,UAAU,oCAAsC0jD,EAAGl/C,MAAQ,WAAa,IAAMpF,EAAIyuC,KAAK,MAAQ,OA+nC3Gu6C,EAAMszE,QAAU,SAAUz2J,EAAM02J,GAC9B,IAAK12J,GAA6B,iBAAdA,EAAKT,MAA0C,mBAAdS,EAAKR,KACxD,MAAM,IAAIzE,UAAU,kEAGtB,IAAyB,IAArB27J,EACF,IAAK,IAAIp8J,EAAI,EAAGA,EAAI6oF,EAAM/X,MAAM/wE,OAAQC,IACtC,GAA4B,WAAxB6oF,EAAM/X,MAAM9wE,GAAGiF,KAEjB,YADA4jF,EAAM/X,MAAMP,OAAOvwE,EAAG,EAAG0F,GAM/BmjF,EAAM/X,MAAMhtE,KAAK4B,IAInBmjF,EAAMwzE,cAAgB,SAAU5G,GAC9B,IAAKA,GAC6B,iBAApBA,EAAW/wJ,MACO,iBAAlB+wJ,EAAWj4E,IACY,mBAAvBi4E,EAAWroF,QACvB,MAAM,IAAI3sE,UAAU,iFAGtBooF,EAAM8nB,YAAY7sG,KAAK2xJ,IAGlB5sE,EAGFjmF,KAj2Ca,UAAX,IAAW,mB,aCXlB05J,EAA2B,GAG/B,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB/4J,IAAjBg5J,EACH,OAAOA,EAAa1xH,QAGrB,IAAID,EAASwxH,EAAyBE,GAAY,CACjDpyJ,GAAIoyJ,EACJE,QAAQ,EACR3xH,QAAS,IAUV,OANA4xH,EAAoBH,GAAUx6J,KAAK8oC,EAAOC,QAASD,EAAQA,EAAOC,QAASwxH,GAG3EzxH,EAAO4xH,QAAS,EAGT5xH,EAAOC,QCxBfwxH,EAAoBK,KAAO,WAC1B,MAAM,IAAIn2H,MAAM,mCCDjB81H,EAAoBM,KAAO,GCC3BN,EAAoBx3J,EAAK+lC,IACxB,IAAIgyH,EAAShyH,GAAUA,EAAOiyH,WAC7B,IAAOjyH,EAAiB,QACxB,IAAM,EAEP,OADAyxH,EAAoB3tJ,EAAEkuJ,EAAQ,CAAEruJ,EAAGquJ,IAC5BA,GCLRP,EAAoB3tJ,EAAI,CAACm8B,EAAS1wB,KACjC,IAAI,IAAIlZ,KAAOkZ,EACXkiJ,EAAoBj6J,EAAE+X,EAAYlZ,KAASo7J,EAAoBj6J,EAAEyoC,EAAS5pC,IAC5EF,OAAOC,eAAe6pC,EAAS5pC,EAAK,CAAEL,YAAY,EAAMc,IAAKyY,EAAWlZ,MCJ3Eo7J,EAAoBz1J,EAAI,WACvB,GAA0B,iBAAfs0B,WAAyB,OAAOA,WAC3C,IACC,OAAO91B,MAAQ,IAAIogE,SAAS,cAAb,GACd,MAAOv/D,GACR,GAAsB,iBAAXyS,OAAqB,OAAOA,QALjB,GCAxB2jJ,EAAoBj6J,EAAI,CAACsC,EAAKu/B,IAAUljC,OAAOM,UAAUQ,eAAeC,KAAK4C,EAAKu/B,GCAlFo4H,EAAoBS,IAAOlyH,IAC1BA,EAAOu9B,MAAQ,GACVv9B,EAAO1D,WAAU0D,EAAO1D,SAAW,IACjC0D,GCAkByxH,EAAoB,O","file":"sdfv.js","sourcesContent":["export default 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}","export default function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return self;\n}","export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}","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\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}","import superPropBase from \"./superPropBase.js\";\nexport default function _get(target, property, receiver) {\n  if (typeof Reflect !== \"undefined\" && Reflect.get) {\n    _get = Reflect.get;\n  } else {\n    _get = function _get(target, property, receiver) {\n      var base = superPropBase(target, property);\n      if (!base) return;\n      var desc = Object.getOwnPropertyDescriptor(base, property);\n\n      if (desc.get) {\n        return desc.get.call(receiver);\n      }\n\n      return desc.value;\n    };\n  }\n\n  return _get(target, property, receiver || target);\n}","import getPrototypeOf from \"./getPrototypeOf.js\";\nexport default function _superPropBase(object, property) {\n  while (!Object.prototype.hasOwnProperty.call(object, property)) {\n    object = getPrototypeOf(object);\n    if (object === null) break;\n  }\n\n  return object;\n}","export default function _getPrototypeOf(o) {\n  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}","import setPrototypeOf from \"./setPrototypeOf.js\";\nexport default function _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}","import _typeof from \"@babel/runtime/helpers/typeof\";\nimport assertThisInitialized from \"./assertThisInitialized.js\";\nexport default function _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  }\n\n  return assertThisInitialized(self);\n}","export default function _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}","import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArrayLimit from \"./iterableToArrayLimit.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nexport default function _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}","export default function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}","export default function _iterableToArrayLimit(arr, i) {\n  if (typeof Symbol === \"undefined\" || !(Symbol.iterator in Object(arr))) return;\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n  var _e = undefined;\n\n  try {\n    for (var _i = arr[Symbol.iterator](), _s; !(_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}","export default 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}","export default function _taggedTemplateLiteral(strings, raw) {\n  if (!raw) {\n    raw = strings.slice(0);\n  }\n\n  return Object.freeze(Object.defineProperties(strings, {\n    raw: {\n      value: Object.freeze(raw)\n    }\n  }));\n}","import arrayWithoutHoles from \"./arrayWithoutHoles.js\";\nimport iterableToArray from \"./iterableToArray.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableSpread from \"./nonIterableSpread.js\";\nexport default function _toConsumableArray(arr) {\n  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return arrayLikeToArray(arr);\n}","export default function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && Symbol.iterator in Object(iter)) return Array.from(iter);\n}","export default 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}","export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _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}","\nexport class GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        this.overlay_manager = overlay_manager;\n        this.symbol_resolver = this.overlay_manager.symbol_resolver;\n        this.renderer = renderer;\n        this.vscode = typeof vscode !== 'undefined' && vscode;\n\n        this.badness_scale_center = 5;\n    }\n\n    draw() {\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        return false;\n    }\n\n    refresh() {\n    }\n\n}\n","import { NestedSDFG } from '../renderer/renderer_elements';\nimport { GenericSdfgOverlay } from './generic_sdfg_overlay';\nimport { mean, median } from 'mathjs';\nimport { getTempColor } from '../renderer/renderer_elements';\n\n\nexport class MemoryVolumeOverlay extends GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        super(\n            overlay_manager,\n            renderer\n        );\n\n        this.refresh();\n    }\n\n    clear_cached_volume_values() {\n        this.renderer.for_all_elements(0, 0, 0, 0, (type, e, obj, isected) => {\n            if (obj.data) {\n                if (obj.data.volume !== undefined)\n                    obj.data.volume = undefined;\n            }\n        });\n    }\n\n    calculate_volume_edge(edge, symbol_map, volume_values) {\n        let volume_string = undefined;\n        if (edge.data && edge.data.attributes) {\n            volume_string = edge.data.attributes.volume;\n            if (volume_string !== undefined) {\n                volume_string = volume_string.replace(/\\*\\*/g, '^');\n                volume_string = volume_string.replace(/ceiling/g, 'ceil');\n            }\n        }\n        let volume = undefined;\n        if (volume_string !== undefined)\n            volume = this.symbol_resolver.parse_symbol_expression(\n                volume_string,\n                symbol_map\n            );\n\n        edge.data.volume = volume;\n\n        if (volume !== undefined && volume > 0)\n            volume_values.push(volume);\n\n        return volume;\n    }\n\n    calculate_volume_graph(g, symbol_map, volume_values) {\n        const that = this;\n        g.nodes().forEach(v => {\n            const state = g.node(v);\n            const state_graph = state.data.graph;\n            if (state_graph) {\n                state_graph.edges().forEach(e => {\n                    const edge = state_graph.edge(e);\n                    if (edge instanceof Edge)\n                        that.calculate_volume_edge(\n                            edge,\n                            symbol_map,\n                            volume_values\n                        );\n                });\n\n                state_graph.nodes().forEach(v => {\n                    const node = state_graph.node(v);\n                    if (node instanceof NestedSDFG) {\n                        const nested_symbols_map = {};\n                        const mapping = node.data.node.attributes.symbol_mapping;\n                        // Translate the symbol mappings for the nested SDFG\n                        // based on the mapping described on the node.\n                        Object.keys(mapping).forEach((symbol) => {\n                            nested_symbols_map[symbol] =\n                                that.symbol_resolver.parse_symbol_expression(\n                                    mapping[symbol],\n                                    symbol_map\n                                );\n                        });\n                        // Merge in the parent mappings.\n                        Object.keys(symbol_map).forEach((symbol) => {\n                            if (!(symbol in nested_symbols_map))\n                                nested_symbols_map[symbol] = symbol_map[symbol];\n                        });\n\n                        that.calculate_volume_graph(\n                            node.data.graph,\n                            nested_symbols_map,\n                            volume_values\n                        );\n                    }\n                });\n            }\n        });\n    }\n\n    recalculate_volume_values(graph) {\n        this.badness_scale_center = 5;\n\n        const volume_values = [0];\n        this.calculate_volume_graph(\n            graph,\n            this.symbol_resolver.symbol_value_map,\n            volume_values\n        );\n\n        switch (this.overlay_manager.badness_scale_method) {\n            case 'mean':\n                this.badness_scale_center = mean(volume_values);\n                break;\n            case 'median':\n            default:\n                this.badness_scale_center = median(volume_values);\n                break;\n        }\n    }\n\n    refresh() {\n        this.clear_cached_volume_values();\n        this.recalculate_volume_values(this.renderer.graph);\n\n        this.renderer.draw_async();\n    }\n\n    shade_edge(edge, ctx) {\n        const volume = edge.data.volume;\n        if (volume !== undefined) {\n            // Only draw positive volumes.\n            if (volume <= 0)\n                return;\n\n            let badness = (1 / (this.badness_scale_center * 2)) * volume;\n            if (badness < 0)\n                badness = 0;\n            if (badness > 1)\n                badness = 1;\n            const color = getTempColor(badness);\n\n            edge.shade(this.renderer, ctx, color);\n        }\n    }\n\n    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {\n        graph.nodes().forEach(v => {\n            const state = graph.node(v);\n\n            // If we're zoomed out enough that the contents aren't visible, we\n            // skip the state.\n            if (ctx.lod && (ppp >= STATE_LOD || state.width / ppp < STATE_LOD))\n                return;\n\n            // If the node's invisible, we skip it.\n            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,\n                visible_rect.w, visible_rect.h))\n                return;\n\n            const state_graph = state.data.graph;\n            if (state_graph && !state.data.state.attributes.is_collapsed) {\n                state_graph.nodes().forEach(v => {\n                    const node = state_graph.node(v);\n\n                    // Skip the node if it's not visible.\n                    if (ctx.lod && !node.intersect(visible_rect.x,\n                        visible_rect.y, visible_rect.w, visible_rect.h))\n                        return;\n\n                    // If we're zoomed out enough that the node's contents\n                    // aren't visible or the node is collapsed, we skip it.\n                    if (node.data.node.attributes.is_collapsed ||\n                        (ctx.lod && ppp >= NODE_LOD))\n                        return;\n\n                    if (node instanceof NestedSDFG)\n                        this.recursively_shade_sdfg(\n                            node.data.graph, ctx, ppp, visible_rect\n                        );\n                });\n\n                state_graph.edges().forEach(e => {\n                    const edge = state_graph.edge(e);\n\n                    if (ctx.lod && !edge.intersect(visible_rect.x,\n                        visible_rect.y, visible_rect.w, visible_rect.h))\n                        return;\n\n                    this.shade_edge(edge, ctx);\n                });\n            }\n        });\n    }\n\n    draw() {\n        this.recursively_shade_sdfg(\n            this.renderer.graph,\n            this.renderer.ctx,\n            this.renderer.canvas_manager.points_per_pixel(),\n            this.renderer.visible_rect\n        );\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        if (type === 'click' && !ends_drag) {\n            if (foreground_elem !== undefined &&\n                foreground_elem instanceof Edge) {\n                if (foreground_elem.data.volume === undefined) {\n                    if (foreground_elem.data.attributes.volume) {\n                        const that = this;\n                        this.symbol_resolver.parse_symbol_expression(\n                            foreground_elem.data.attributes.volume,\n                            that.symbol_resolver.symbol_value_map,\n                            true,\n                            () => {\n                                that.clear_cached_volume_values();\n                                that.recalculate_volume_values(\n                                    that.renderer.graph\n                                );\n                            }\n                        );\n                    }\n                }\n            }\n        }\n        return false;\n    }\n\n}\n","import { MapExit, NestedSDFG, SDFGNode, State } from '../renderer/renderer_elements';\nimport { GenericSdfgOverlay } from './generic_sdfg_overlay';\nimport { mean, median } from 'mathjs';\nimport { getTempColor } from '../renderer/renderer_elements';\n\n\nexport class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        super(\n            overlay_manager,\n            renderer\n        );\n\n        this.criterium = 'mean';\n        this.runtime_map = {};\n\n        this.badness_scale_center = 0;\n    }\n\n    get_element_uuid(element) {\n        const undefined_val = -1;\n        if (element instanceof State) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.id + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof NestedSDFG) {\n            const sdfg_id = element.data.node.attributes.sdfg.sdfg_list_id;\n            return (\n                sdfg_id + '/' +\n                undefined_val + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof MapExit) {\n            // For MapExit nodes, we want to get the uuid of the corresponding\n            // entry node instead, because the runtime is held there.\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.data.node.scope_entry + '/' +\n                undefined_val\n            );\n        } else if (element instanceof SDFGNode) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.id + '/' +\n                undefined_val\n            );\n        }\n        return (\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val\n        );\n    }\n\n    refresh() {\n        this.badness_scale_center = 5;\n\n        const micros_values = [0];\n\n        for (const key of Object.keys(this.runtime_map)) {\n            // Make sure the overall SDFG's runtime isn't included in this.\n            if (key !== '0/-1/-1/-1')\n                micros_values.push(this.runtime_map[key][this.criterium]);\n        }\n\n        switch (this.overlay_manager.badness_scale_method) {\n            case 'mean':\n                this.badness_scale_center = mean(micros_values);\n                break;\n            case 'median':\n            default:\n                this.badness_scale_center = median(micros_values);\n                break;\n        }\n\n        this.renderer.draw_async();\n    }\n\n    pretty_print_micros(micros) {\n        let unit = 'µs';\n        let value = micros;\n        if (micros > 1000) {\n            unit = 'ms';\n            const millis = micros / 1000;\n            value = millis;\n            if (millis > 1000) {\n                unit = 's';\n                const seconds = millis / 1000;\n                value = seconds;\n            }\n        }\n\n        value = Math.round((value + Number.EPSILON) * 100) / 100;\n        return value.toString() + ' ' + unit;\n    }\n\n    shade_node(node, ctx) {\n        const rt_summary = this.runtime_map[this.get_element_uuid(node)];\n\n        if (rt_summary === undefined)\n            return;\n\n        if (this.renderer.mousepos &&\n            node.intersect(this.renderer.mousepos.x, this.renderer.mousepos.y)) {\n            // Show the measured runtime.\n            if (rt_summary['min'] === rt_summary['max'])\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        this.pretty_print_micros(rt_summary['min'])\n                    );\n                };\n\n            else\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        'Min: ' + this.pretty_print_micros(rt_summary['min']) +\n                        '\\nMax: ' + this.pretty_print_micros(rt_summary['max']) +\n                        '\\nMean: ' + this.pretty_print_micros(rt_summary['mean']) +\n                        '\\nMedian: ' + this.pretty_print_micros(rt_summary['med']) +\n                        '\\nCount: ' + rt_summary['count']\n                    );\n                };\n        }\n\n        // Calculate the 'badness' color.\n        const micros = rt_summary[this.criterium];\n        let badness = (1 / (this.badness_scale_center * 2)) * micros;\n        if (badness < 0)\n            badness = 0;\n        if (badness > 1)\n            badness = 1;\n        const color = getTempColor(badness);\n\n        node.shade(this.renderer, ctx, color);\n    }\n\n    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {\n        // First go over visible states, skipping invisible ones. We only draw\n        // something if the state is collapsed or we're zoomed out far enough.\n        // In that case, we draw the measured runtime for the entire state.\n        // If it's expanded or zoomed in close enough, we traverse inside.\n        graph.nodes().forEach(v => {\n            const state = graph.node(v);\n\n            // If the node's invisible, we skip it.\n            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,\n                visible_rect.w, visible_rect.h))\n                return;\n\n            if ((ctx.lod && (ppp >= STATE_LOD ||\n                state.width / ppp <= STATE_LOD)) ||\n                state.data.state.attributes.is_collapsed) {\n                this.shade_node(state, ctx);\n            } else {\n                const state_graph = state.data.graph;\n                if (state_graph) {\n                    state_graph.nodes().forEach(v => {\n                        const node = state_graph.node(v);\n\n                        // Skip the node if it's not visible.\n                        if (ctx.lod && !node.intersect(visible_rect.x,\n                            visible_rect.y, visible_rect.w, visible_rect.h))\n                            return;\n\n                        if (node.data.node.attributes.is_collapsed ||\n                            (ctx.lod && ppp >= NODE_LOD)) {\n                            this.shade_node(node, ctx);\n                        } else {\n                            if (node instanceof NestedSDFG) {\n                                this.recursively_shade_sdfg(\n                                    node.data.graph, ctx, ppp, visible_rect\n                                );\n                            } else {\n                                this.shade_node(node, ctx);\n                            }\n                        }\n                    });\n                }\n            }\n        });\n    }\n\n    draw() {\n        this.recursively_shade_sdfg(\n            this.renderer.graph,\n            this.renderer.ctx,\n            this.renderer.canvas_manager.points_per_pixel(),\n            this.renderer.visible_rect\n        );\n    }\n\n}\n","import { MapExit, NestedSDFG, SDFGNode, State } from '../renderer/renderer_elements';\nimport { GenericSdfgOverlay } from './generic_sdfg_overlay';\nimport { mean, median } from 'mathjs';\nimport { getTempColor } from '../renderer/renderer_elements';\n\n\nexport class StaticFlopsOverlay extends GenericSdfgOverlay {\n\n    constructor(overlay_manager, renderer) {\n        super(\n            overlay_manager,\n            renderer\n        );\n\n        this.flops_map = {};\n\n        if (this.vscode) {\n            vscode.postMessage({\n                type: 'dace.get_flops',\n            });\n        }\n    }\n\n    get_element_uuid(element) {\n        const undefined_val = -1;\n        if (element instanceof State) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.id + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof NestedSDFG) {\n            const sdfg_id = element.data.node.attributes.sdfg.sdfg_list_id;\n            return (\n                sdfg_id + '/' +\n                undefined_val + '/' +\n                undefined_val + '/' +\n                undefined_val\n            );\n        } else if (element instanceof MapExit) {\n            // For MapExit nodes, we want to get the uuid of the corresponding\n            // entry node instead, because the FLOPS count is held there.\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.data.node.scope_entry + '/' +\n                undefined_val\n            );\n        } else if (element instanceof SDFGNode) {\n            return (\n                element.sdfg.sdfg_list_id + '/' +\n                element.parent_id + '/' +\n                element.id + '/' +\n                undefined_val\n            );\n        }\n        return (\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val + '/' +\n            undefined_val\n        );\n    }\n\n    clear_cached_flops_values() {\n        this.renderer.for_all_elements(0, 0, 0, 0, (type, e, obj, isected) => {\n            if (obj.data) {\n                if (obj.data.flops !== undefined)\n                    obj.data.flops = undefined;\n                if (obj.data.flops_string !== undefined)\n                    obj.data.flops_string = undefined;\n            }\n        });\n    }\n\n    calculate_flops_node(node, symbol_map, flops_values) {\n        const flops_string = this.flops_map[this.get_element_uuid(node)];\n        let flops = undefined;\n        if (flops_string !== undefined)\n            flops = this.symbol_resolver.parse_symbol_expression(\n                flops_string,\n                symbol_map\n            );\n\n        node.data.flops_string = flops_string;\n        node.data.flops = flops;\n\n        if (flops !== undefined && flops > 0)\n            flops_values.push(flops);\n\n        return flops;\n    }\n\n    calculate_flops_graph(g, symbol_map, flops_values) {\n        const that = this;\n        g.nodes().forEach(v => {\n            const state = g.node(v);\n            that.calculate_flops_node(state, symbol_map, flops_values);\n            const state_graph = state.data.graph;\n            if (state_graph) {\n                state_graph.nodes().forEach(v => {\n                    const node = state_graph.node(v);\n                    if (node instanceof NestedSDFG) {\n                        const nested_symbols_map = {};\n                        const mapping = node.data.node.attributes.symbol_mapping;\n                        // Translate the symbol mappings for the nested SDFG\n                        // based on the mapping described on the node.\n                        Object.keys(mapping).forEach((symbol) => {\n                            nested_symbols_map[symbol] =\n                                that.symbol_resolver.parse_symbol_expression(\n                                    mapping[symbol],\n                                    symbol_map\n                                );\n                        });\n                        // Merge in the parent mappings.\n                        Object.keys(symbol_map).forEach((symbol) => {\n                            if (!(symbol in nested_symbols_map))\n                                nested_symbols_map[symbol] = symbol_map[symbol];\n                        });\n\n                        that.calculate_flops_node(\n                            node,\n                            nested_symbols_map,\n                            flops_values\n                        );\n                        that.calculate_flops_graph(\n                            node.data.graph,\n                            nested_symbols_map,\n                            flops_values\n                        );\n                    } else {\n                        that.calculate_flops_node(\n                            node,\n                            symbol_map,\n                            flops_values\n                        );\n                    }\n                });\n            }\n        });\n    }\n\n    recalculate_flops_values(graph) {\n        this.badness_scale_center = 5;\n\n        const flops_values = [0];\n        this.calculate_flops_graph(\n            graph,\n            this.symbol_resolver.symbol_value_map,\n            flops_values\n        );\n\n        switch (this.overlay_manager.badness_scale_method) {\n            case 'mean':\n                this.badness_scale_center = mean(flops_values);\n                break;\n            case 'median':\n            default:\n                this.badness_scale_center = median(flops_values);\n                break;\n        }\n    }\n\n    update_flops_map(flops_map) {\n        this.flops_map = flops_map;\n        this.refresh();\n    }\n\n    refresh() {\n        this.clear_cached_flops_values();\n        this.recalculate_flops_values(this.renderer.graph);\n\n        this.renderer.draw_async();\n    }\n\n    shade_node(node, ctx) {\n        const flops = node.data.flops;\n        const flops_string = node.data.flops_string;\n\n        if (flops_string !== undefined && this.renderer.mousepos &&\n            node.intersect(this.renderer.mousepos.x, this.renderer.mousepos.y)) {\n            // Show the computed FLOPS value if applicable.\n            if (isNaN(flops_string) && flops !== undefined)\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        'FLOPS: ' + flops_string + ' (' + flops + ')'\n                    );\n                };\n\n            else\n                this.renderer.tooltip = () => {\n                    this.renderer.tooltip_container.innerText = (\n                        'FLOPS: ' + flops_string\n                    );\n                };\n        }\n\n        if (flops === undefined) {\n            // If the FLOPS can't be calculated, but there's an entry for this\n            // node's FLOPS, that means that there's an unresolved symbol. Shade\n            // the node grey to indicate that.\n            if (flops_string !== undefined) {\n                node.shade(this.renderer, ctx, 'gray');\n                return;\n            } else {\n                return;\n            }\n        }\n\n        // Only draw positive FLOPS.\n        if (flops <= 0)\n            return;\n\n        // Calculate the 'badness' color.\n        let badness = (1 / (this.badness_scale_center * 2)) * flops;\n        if (badness < 0)\n            badness = 0;\n        if (badness > 1)\n            badness = 1;\n        const color = getTempColor(badness);\n\n        node.shade(this.renderer, ctx, color);\n    }\n\n    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {\n        // First go over visible states, skipping invisible ones. We only draw\n        // something if the state is collapsed or we're zoomed out far enough.\n        // In that case, we draw the FLOPS calculated for the entire state.\n        // If it's expanded or zoomed in close enough, we traverse inside.\n        graph.nodes().forEach(v => {\n            const state = graph.node(v);\n\n            // If the node's invisible, we skip it.\n            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,\n                visible_rect.w, visible_rect.h))\n                return;\n\n            if ((ctx.lod && (ppp >= STATE_LOD ||\n                state.width / ppp <= STATE_LOD)) ||\n                state.data.state.attributes.is_collapsed) {\n                this.shade_node(state, ctx);\n            } else {\n                const state_graph = state.data.graph;\n                if (state_graph) {\n                    state_graph.nodes().forEach(v => {\n                        const node = state_graph.node(v);\n\n                        // Skip the node if it's not visible.\n                        if (ctx.lod && !node.intersect(visible_rect.x,\n                            visible_rect.y, visible_rect.w, visible_rect.h))\n                            return;\n\n                        if (node.data.node.attributes.is_collapsed ||\n                            (ctx.lod && ppp >= NODE_LOD)) {\n                            this.shade_node(node, ctx);\n                        } else {\n                            if (node instanceof NestedSDFG) {\n                                this.recursively_shade_sdfg(\n                                    node.data.graph, ctx, ppp, visible_rect\n                                );\n                            } else {\n                                this.shade_node(node, ctx);\n                            }\n                        }\n                    });\n                }\n            }\n        });\n    }\n\n    draw() {\n        this.recursively_shade_sdfg(\n            this.renderer.graph,\n            this.renderer.ctx,\n            this.renderer.canvas_manager.points_per_pixel(),\n            this.renderer.visible_rect\n        );\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        if (type === 'click' && !ends_drag) {\n            if (foreground_elem !== undefined && foreground_elem !== null &&\n                !(foreground_elem instanceof Edge)) {\n                if (foreground_elem.data.flops === undefined) {\n                    const flops_string = this.flops_map[this.get_element_uuid(foreground_elem)];\n                    if (flops_string) {\n                        const that = this;\n                        this.symbol_resolver.parse_symbol_expression(\n                            flops_string,\n                            that.symbol_resolver.symbol_value_map,\n                            true,\n                            () => {\n                                that.clear_cached_flops_values();\n                                that.recalculate_flops_values(\n                                    that.renderer.graph\n                                );\n                            }\n                        );\n                    }\n                }\n            }\n        }\n        return false;\n    }\n\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport function calculateBoundingBox(g) {\n    // iterate over all objects, calculate the size of the bounding box\n    const bb = {};\n    bb.width = 0;\n    bb.height = 0;\n\n    g.nodes().forEach((v) => {\n        const x = g.node(v).x + g.node(v).width / 2.0;\n        const y = g.node(v).y + g.node(v).height / 2.0;\n        if (x > bb.width) bb.width = x;\n        if (y > bb.height) bb.height = y;\n    });\n\n    return bb;\n}\n\nexport function boundingBox(elements) {\n    const bb = { x1: null, y1: null, x2: null, y2: null };\n\n    elements.forEach((v) => {\n        const topleft = v.topleft();\n        if (bb.x1 === null || topleft.x < bb.x1) bb.x1 = topleft.x;\n        if (bb.y1 === null || topleft.y < bb.y1) bb.y1 = topleft.y;\n\n        const x2 = v.x + v.width / 2.0;\n        const y2 = v.y + v.height / 2.0;\n\n        if (bb.x2 === null || x2 > bb.x2) bb.x2 = x2;\n        if (bb.y2 === null || y2 > bb.y2) bb.y2 = y2;\n    });\n\n    return { x: bb.x1, y: bb.y1, width: bb.x2 - bb.x1, height: bb.y2 - bb.y1 };\n}\n\nexport function calculateEdgeBoundingBox(edge) {\n    // iterate over all points, calculate the size of the bounding box\n    let bb = {};\n    bb.x1 = edge.points[0].x;\n    bb.y1 = edge.points[0].y;\n    bb.x2 = edge.points[0].x;\n    bb.y2 = edge.points[0].y;\n\n    edge.points.forEach((p) => {\n        bb.x1 = p.x < bb.x1 ? p.x : bb.x1;\n        bb.y1 = p.y < bb.y1 ? p.y : bb.y1;\n        bb.x2 = p.x > bb.x2 ? p.x : bb.x2;\n        bb.y2 = p.y > bb.y2 ? p.y : bb.y2;\n    });\n\n    bb = {\n        'x': bb.x1, 'y': bb.y1, 'width': (bb.x2 - bb.x1),\n        'height': (bb.y2 - bb.y1)\n    };\n    if (bb.width <= 5) {\n        bb.width = 10;\n        bb.x -= 5;\n    }\n    if (bb.height <= 5) {\n        bb.height = 10;\n        bb.y -= 5;\n    }\n    return bb;\n}\n\nexport function updateEdgeBoundingBox(edge) {\n    const bb = calculateEdgeBoundingBox(edge);\n    edge.x = bb.x + bb.width / 2;\n    edge.y = bb.y + bb.height / 2;\n    edge.width = bb.width;\n    edge.height = bb.height;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { intersectRect } from 'dagre/lib/util';\nimport { Edge } from \"./renderer_elements\";\nimport { lerpMatrix } from '../utils/lerp_matrix';\nimport { updateEdgeBoundingBox } from '../utils/bounding_box';\nimport {\n    get_positioning_info,\n    initialize_positioning_info,\n} from \"../utils/sdfg/sdfg_utils\";\n\nconst animation_duration = 1000;\nconst animation_function = t => 1 - Math.pow(1 - t, 3);  // cubic ease out\n\nlet _canvas_manager_counter = 0;\n\nexport class CanvasManager {\n    // Manages translation and scaling of canvas rendering\n\n    static counter() {\n        return _canvas_manager_counter++;\n    }\n\n    constructor(ctx, renderer, canvas) {\n        this.ctx = ctx;\n        this.ctx.lod = true;\n        this.canvas = canvas;\n        this.anim_id = null;\n        this.prev_time = null;\n        this.drawables = [];\n        this.renderer = renderer;\n        this.indices = [];\n\n        this.animation_start = null;\n        this.animation_end = null;\n        this.animation_target = null;\n        /**\n         * Takes a number [0, 1] and returns a transformation matrix\n         */\n        this.animation = null;\n\n        this.request_scale = false;\n        this.scalef = 1.0;\n\n        this._destroying = false;\n\n        this.scale_origin = { x: 0, y: 0 };\n\n        this.contention = 0;\n\n        this._svg = document.createElementNS(\"http://www.w3.org/2000/svg\", 'svg');\n\n        this.user_transform = this._svg.createSVGMatrix();\n\n        this.addCtxTransformTracking();\n    }\n\n    stopAnimation() {\n        this.animation_start = null;\n        this.animation_end = null;\n        this.animation = null;\n        this.animation_target = null;\n    }\n\n    alreadyAnimatingTo(new_transform) {\n        if (this.animation_target) {\n            let result = true;\n            result &= this.animation_target.a == new_transform.a;\n            result &= this.animation_target.b == new_transform.b;\n            result &= this.animation_target.c == new_transform.c;\n            result &= this.animation_target.d == new_transform.d;\n            result &= this.animation_target.e == new_transform.e;\n            result &= this.animation_target.f == new_transform.f;\n            return result;\n        } else\n            return false;\n    }\n\n    animateTo(new_transform) {\n        // If was already animating to the same target, jump to it directly\n        if (this.alreadyAnimatingTo(new_transform)) {\n            this.stopAnimation();\n            this.user_transform = new_transform;\n            return;\n        }\n\n        this.stopAnimation();\n        this.animation = lerpMatrix(this.user_transform, new_transform);\n        this.animation_target = new_transform;\n    }\n\n    svgPoint(x, y) {\n        const pt = this._svg.createSVGPoint();\n        pt.x = x; pt.y = y;\n        return pt;\n    }\n\n    applyUserTransform() {\n        const ut = this.user_transform;\n        this.ctx.setTransform(ut.a, ut.b, ut.c, ut.d, ut.e, ut.f);\n    }\n\n    get translation() {\n        return { x: this.user_transform.e, y: this.user_transform.f };\n    }\n\n    addCtxTransformTracking() {\n        /* This function is a hack to provide the non-standardized functionality\n        of getting the current transform from a RenderingContext.\n        When (if) this is standardized, the standard should be used instead.\n        This is made for \"easy\" transforms and does not support saving/restoring\n        */\n\n        const svg = document.createElementNS(\"http://www.w3.org/2000/svg\", 'svg');\n        this.ctx._custom_transform_matrix = svg.createSVGMatrix();\n        // Save/Restore is not supported.\n\n        const checker = () => {\n            console.assert(!isNaN(this.ctx._custom_transform_matrix.f));\n        };\n        const _ctx = this.ctx;\n        const scale_func = _ctx.scale;\n        _ctx.scale = function (sx, sy) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.scaleNonUniform(sx, sy);\n            checker();\n            return scale_func.call(_ctx, sx, sy);\n        };\n        const translate_func = _ctx.translate;\n        _ctx.translate = function (sx, sy) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.translate(sx, sy);\n            checker();\n            return translate_func.call(_ctx, sx, sy);\n        };\n        const rotate_func = _ctx.rotate;\n        _ctx.rotate = function (r) {\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.rotate(r * 180.0 / Math.PI);\n            checker();\n            return rotate_func.call(_ctx, r);\n        };\n        const transform_func = _ctx.scale;\n        _ctx.transform = function (a, b, c, d, e, f) {\n            const m2 = svg.createSVGMatrix();\n            m2.a = a; m2.b = b; m2.c = c; m2.d = d; m2.e = e; m2.f = f;\n            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.multiply(m2);\n            checker();\n            return transform_func.call(_ctx, a, b, c, d, e, f);\n        };\n\n        const setTransform_func = _ctx.setTransform;\n        _ctx.setTransform = function (a, b, c, d, e, f) {\n            _ctx._custom_transform_matrix.a = a;\n            _ctx._custom_transform_matrix.b = b;\n            _ctx._custom_transform_matrix.c = c;\n            _ctx._custom_transform_matrix.d = d;\n            _ctx._custom_transform_matrix.e = e;\n            _ctx._custom_transform_matrix.f = f;\n            checker();\n            return setTransform_func.call(_ctx, a, b, c, d, e, f);\n        };\n\n        _ctx.custom_inverseTransformMultiply = function (x, y) {\n            const pt = svg.createSVGPoint();\n            pt.x = x; pt.y = y;\n            checker();\n            return pt.matrixTransform(_ctx._custom_transform_matrix.inverse());\n        }\n    }\n\n    destroy() {\n        this._destroying = true;\n        this.clearDrawables();\n    }\n\n    addDrawable(obj) {\n        this.drawables.push(obj);\n        this.indices.push({ \"c\": CanvasManager.counter(), \"d\": obj });\n    }\n\n    removeDrawable(drawable) {\n        this.drawables = this.drawables.filter(x => x != drawable);\n    }\n\n    clearDrawables() {\n        for (const x of this.drawables) {\n            x.destroy();\n        }\n        this.drawables = [];\n        this.indices = [];\n    }\n\n    isBlank() {\n        const ctx = this.canvas.getContext('2d');\n        const topleft = ctx.getImageData(0, 0, 1, 1).data;\n        if (topleft[0] != 0 || topleft[1] != 0 || topleft[2] != 0 || topleft[3] != 255)\n            return false;\n\n        const pixelBuffer = new Uint32Array(\n            ctx.getImageData(0, 0, this.canvas.width, this.canvas.height).data.buffer\n        );\n\n        return !pixelBuffer.some(color => color !== 0xff000000);\n    }\n\n    scale(diff, x = 0, y = 0) {\n        this.stopAnimation();\n        if (this.request_scale || this.contention > 0) {\n            return;\n        }\n        this.contention++;\n        this.request_scale = true;\n        if (this.isBlank()) {\n            this.renderer.bgcolor = 'black';\n            this.renderer.zoom_to_view(null, false);\n            diff = 0.01;\n        }\n\n        this.scale_origin.x = x;\n        this.scale_origin.y = y;\n\n        const sv = diff;\n        const pt = this.svgPoint(this.scale_origin.x, this.scale_origin.y).matrixTransform(this.user_transform.inverse());\n        this.user_transform = this.user_transform.translate(pt.x, pt.y);\n        this.user_transform = this.user_transform.scale(sv, sv, 1, 0, 0, 0);\n        this.scalef *= sv;\n        this.user_transform = this.user_transform.translate(-pt.x, -pt.y);\n\n        this.contention--;\n    }\n\n    // Sets the view to the square around the input rectangle\n    set_view(rect, animate = false) {\n        const canvas_w = this.canvas.width;\n        const canvas_h = this.canvas.height;\n        if (canvas_w == 0 || canvas_h == 0)\n            return;\n\n        let scale = 1, tx = 0, ty = 0;\n        if (rect.width > rect.height) {\n            scale = canvas_w / rect.width;\n            tx = -rect.x;\n            ty = -rect.y - (rect.height / 2) + (canvas_h / scale / 2);\n\n            // Now other dimension does not fit, scale it as well\n            if (rect.height * scale > canvas_h) {\n                scale = canvas_h / rect.height;\n                tx = -rect.x - (rect.width / 2) + (canvas_w / scale / 2);\n                ty = -rect.y;\n            }\n        } else {\n            scale = canvas_h / rect.height;\n            tx = -rect.x - (rect.width / 2) + (canvas_w / scale / 2);\n            ty = -rect.y;\n\n            // Now other dimension does not fit, scale it as well\n            if (rect.width * scale > canvas_w) {\n                scale = canvas_w / rect.width;\n                tx = -rect.x;\n                ty = -rect.y - (rect.height / 2) + (canvas_h / scale / 2);\n            }\n        }\n\n        // Uniform scaling\n        const new_transform = this._svg.createSVGMatrix().scale(scale, scale, 1, 0, 0, 0).translate(tx, ty);\n\n        if (animate && this.prev_time !== null) {\n            this.animateTo(new_transform);\n        } else {\n            this.stopAnimation();\n            this.user_transform = new_transform;\n        }\n\n        this.scale_origin = { x: 0, y: 0 };\n        this.scalef = 1.0;\n    }\n\n    translate(x, y) {\n        this.stopAnimation();\n        this.user_transform = this.user_transform.translate(x / this.user_transform.a, y / this.user_transform.d);\n    }\n\n    /**\n     * Move/translate an element in the graph by a change in x and y.\n     * @param {*} el                Element to move\n     * @param {*} old_mousepos      Old mouse position in canvas coordinates\n     * @param {*} new_mousepos      New mouse position in canvas coordinates\n     * @param {*} entire_graph      Reference to the entire graph\n     * @param {*} sdfg_list         List of SDFGs and nested SDFGs\n     * @param {*} state_parent_list List of parent elements to SDFG states\n     * // TODO: update doc comment with parameters\n     */\n    translate_element(\n        el, old_mousepos, new_mousepos, entire_graph, sdfg_list,\n        state_parent_list, drag_start, update_position_info = true,\n        move_entire_edge = false, edge_dpoints = undefined\n    ) {\n        this.stopAnimation();\n\n        // Edges connected to the moving element\n        let out_edges = [];\n        let in_edges = [];\n\n        // Find the parent graph in the list of available SDFGs\n        let parent_graph = sdfg_list[el.sdfg.sdfg_list_id];\n        let parent_element = null;\n\n        if (entire_graph !== parent_graph && (el.data.state || el.data.type == 'InterstateEdge')) {\n            // If the parent graph and the entire SDFG shown are not the same,\n            // we're currently in a nested SDFG. If we're also moving a state,\n            // this means that its parent element is found in the list of\n            // parents to states (state_parent_list)\n            parent_element = state_parent_list[el.sdfg.sdfg_list_id];\n        } else if (el.parent_id !== null && parent_graph) {\n            // If the parent_id isn't null and there is a parent graph, we can\n            // look up the parent node via the element's parent_id\n            parent_element = parent_graph.node(el.parent_id);\n            // If our parent element is a state, we want the state's graph\n            if (parent_element.data.state)\n                parent_graph = parent_element.data.graph;\n        }\n\n        if (parent_graph && !(el instanceof Edge)) {\n            // Find all the edges connected to the moving node\n            parent_graph.outEdges(el.id).forEach(edge_id => {\n                out_edges.push(parent_graph.edge(edge_id));\n            });\n            parent_graph.inEdges(el.id).forEach(edge_id => {\n                in_edges.push(parent_graph.edge(edge_id));\n            });\n        }\n\n        // Compute theoretical initial displacement/movement\n        let dx = new_mousepos.x - old_mousepos.x;\n        let dy = new_mousepos.y - old_mousepos.y;\n\n        // If edge, find closest point to drag start position\n        let pt = -1;\n        if (el instanceof Edge) {\n            if (move_entire_edge) {\n                pt = -2;\n            } else if (edge_dpoints && edge_dpoints.length > 0) {\n                pt = -3;\n            } else if (drag_start) {\n                // Find closest point to old mouse position\n                if (drag_start.edge_point === undefined) {\n                    let dist = null;\n                    el.points.forEach((p, i) => {\n                        // Only allow dragging if the memlet has more than two\n                        // points\n                        if (i == 0 || i == el.points.length - 1)\n                            return;\n                        let ddx = p.x - drag_start.cx;\n                        let ddy = p.y - drag_start.cy;\n                        let curdist = ddx*ddx + ddy*ddy;\n                        if (dist === null || curdist < dist) {\n                            dist = curdist;\n                            pt = i;\n                        }\n                    });\n                    drag_start.edge_point = pt;\n                } else {\n                    pt = drag_start.edge_point;\n                }\n            }\n        }\n\n        if (parent_element) {\n            // Calculate the box to bind the element to. This is given by\n            // the parent element, i.e. the element where out to-be-moved\n            // element is contained within\n            const parent_left_border =\n                (parent_element.x - (parent_element.width / 2));\n            const parent_right_border =\n                parent_left_border + parent_element.width;\n            const parent_top_border =\n                (parent_element.y - (parent_element.height / 2));\n            const parent_bottom_border =\n                parent_top_border + parent_element.height;\n\n            let el_h_margin = el.height / 2;\n            let el_w_margin = el.width / 2;\n            if (el instanceof Edge) {\n                el_h_margin = el_w_margin = 0;\n            }\n            const min_x = parent_left_border + el_w_margin;\n            const min_y = parent_top_border + el_h_margin;\n            const max_x = parent_right_border - el_w_margin;\n            const max_y = parent_bottom_border - el_h_margin;\n\n            // Make sure we don't move our element outside its parent's\n            // bounding box. If either the element or the mouse pointer are\n            // outside the parent, we clamp movement in that direction\n            if (el instanceof Edge) {\n                if (pt > 0) {\n                    let target_x = el.points[pt].x + dx;\n                    let target_y = el.points[pt].y + dy;\n                    if (target_x <= min_x ||\n                        new_mousepos.x <= parent_left_border) {\n                        dx = min_x - el.points[pt].x;\n                    } else if (target_x >= max_x ||\n                        new_mousepos.x >= parent_right_border) {\n                        dx = max_x - el.points[pt].x;\n                    }\n                    if (target_y <= min_y ||\n                        new_mousepos.y <= parent_top_border) {\n                        dy = min_y - el.points[pt].y;\n                    } else if (target_y >= max_y ||\n                        new_mousepos.y >= parent_bottom_border) {\n                        dy = max_y - el.points[pt].y;\n                    }\n                }\n            } else {\n                let target_x = el.x + dx;\n                let target_y = el.y + dy;\n                if (target_x <= min_x ||\n                    new_mousepos.x <= parent_left_border) {\n                    dx = min_x - el.x;\n                } else if (target_x >= max_x ||\n                    new_mousepos.x >= parent_right_border) {\n                    dx = max_x - el.x;\n                }\n                if (target_y <= min_y ||\n                    new_mousepos.y <= parent_top_border) {\n                    dy = min_y - el.y;\n                } else if (target_y >= max_y ||\n                    new_mousepos.y >= parent_bottom_border) {\n                    dy = max_y - el.y;\n                }\n            }\n        }\n\n        if (el instanceof Edge) {\n            let position;\n            if (update_position_info) {\n                position = get_positioning_info(el);\n\n                if (!position)\n                    position = initialize_positioning_info(el);\n            }\n            if (pt > 0) {\n                // Move point\n                el.points[pt].x += dx;\n                el.points[pt].y += dy;\n\n                // Move edge bounding box\n                updateEdgeBoundingBox(el);\n\n                if (update_position_info) {\n                    if (!position.points) {\n                        position.points = Array(el.points.length);\n                        for (let i = 0; i < el.points.length; i++) {\n                            position.points[i] = {dx: 0, dy: 0};\n                        }\n                    }\n\n                    position.points[pt].dx += dx;\n                    position.points[pt].dy += dy;\n                }\n            } else if (pt == -2) {\n                // Don't update first and last point (the connectors)\n                for (let i = 1; i < el.points.length - 1; i++) {\n                    el.points[i].x += dx;\n                    el.points[i].y += dy;\n                }\n\n                if (update_position_info) {\n                    for (let i = 1; i < el.points.length - 1; i++) {\n                        position.points[i].dx += dx;\n                        position.points[i].dy += dy;\n                    }\n                }\n            } else if (pt == -3) {\n                for (let i = 1; i < el.points.length - 1; i++) {\n                    el.points[i].x += edge_dpoints[i].dx;\n                    el.points[i].y += edge_dpoints[i].dy;\n                }\n            }\n            // The rest of the method doesn't apply to Edges\n            return;\n        }\n\n        // Move a node together with its connectors if it has any\n        function move_node_and_connectors(node) {\n            node.x += dx;\n            node.y += dy;\n            if (node.data.node && node.data.node.type === 'NestedSDFG')\n                translate_recursive(node.data.graph);\n            if (node.in_connectors)\n                node.in_connectors.forEach(c => {\n                    c.x += dx;\n                    c.y += dy;\n                });\n            if (node.out_connectors)\n                node.out_connectors.forEach(c => {\n                    c.x += dx;\n                    c.y += dy;\n                });\n        }\n\n        // Allow recursive translation of nested SDFGs\n        function translate_recursive(ng) {\n            ng.nodes().forEach(state_id => {\n                const state = ng.node(state_id);\n                state.x += dx;\n                state.y += dy;\n                const g = state.data.graph;\n                if (g) {\n                    g.nodes().forEach(node_id => {\n                        const node = g.node(node_id);\n                        move_node_and_connectors(node);\n                    });\n\n                    g.edges().forEach(edge_id => {\n                        const edge = g.edge(edge_id);\n                        edge.x += dx;\n                        edge.y += dy;\n                        edge.points.forEach(point => {\n                            point.x += dx;\n                            point.y += dy;\n                        });\n                        updateEdgeBoundingBox(edge);\n                    });\n                }\n            });\n            ng.edges().forEach(edge_id => {\n                const edge = ng.edge(edge_id);\n                edge.x += dx;\n                edge.y += dy;\n                edge.points.forEach(point => {\n                    point.x += dx;\n                    point.y += dy;\n                });\n                updateEdgeBoundingBox(edge);\n            });\n        }\n\n        // Move the node\n        move_node_and_connectors(el);\n\n        // Store movement information in element (for relayouting)\n        if (update_position_info) {\n            let position = get_positioning_info(el);\n            if (!position)\n                position = initialize_positioning_info(el);\n\n            position.dx += dx;\n            position.dy += dy;\n\n            // Store movement information if EntryNode for other nodes of the same scope\n            if (el instanceof EntryNode && el.data.node.attributes.is_collapsed) {\n                if (!position.scope_dx) {\n                    position.scope_dx = 0;\n                    position.scope_dy = 0;\n                }\n\n                position.scope_dx += dx;\n                position.scope_dy += dy;\n            }\n        }\n        \n        if (el.data.state && !el.data.state.attributes.is_collapsed) {\n            // We're moving a state, move all its contained elements\n            const graph = el.data.graph;\n            graph.nodes().forEach(node_id => {\n                const node = graph.node(node_id);\n                move_node_and_connectors(node);\n            });\n\n            // Drag all the edges along\n            graph.edges().forEach(edge_id => {\n                const edge = graph.edge(edge_id);\n                edge.x += dx;\n                edge.y += dy;\n                edge.points.forEach(point => {\n                    point.x += dx;\n                    point.y += dy;\n                });\n                updateEdgeBoundingBox(edge);\n            });\n        }\n\n        // Move the connected edges along with the element\n        out_edges.forEach(edge => {\n            const n = edge.points.length - 1;\n            let moved = false;\n            if (edge.src_connector !== null) {\n                for (let i = 0; i < el.out_connectors.length; i++) {\n                    if (el.out_connectors[i].data.name === edge.src_connector) {\n                        edge.points[0] = intersectRect(el.out_connectors[i], edge.points[1]);\n                        moved = true;\n                        break;\n                    }\n                }\n            }\n            if (!moved) {\n                edge.points[0].x += dx;\n                edge.points[0].y += dy;\n            }\n            // Also update destination point of edge\n            if (edge.dst_connector !== null) {\n                let e = parent_element?.data?.state?.edges[edge.id];\n                let dst_el = parent_graph.node(e?.dst);\n                if (dst_el) {\n                    for (let i = 0; i < dst_el.in_connectors.length; i++) {\n                        let dst_name = dst_el.in_connectors[i].data.name;\n                        if (dst_name === edge.dst_connector) {\n                            edge.points[n] = intersectRect(\n                                dst_el.in_connectors[i], edge.points[n - 1]\n                            );\n                            break;\n                        }\n                    }\n                }\n            }\n            updateEdgeBoundingBox(edge);\n        });\n        in_edges.forEach(edge => {\n            const n = edge.points.length - 1;\n            let moved = false;\n            if (edge.dst_connector !== null) {\n                for (let i = 0; i < el.in_connectors.length; i++) {\n                    if (el.in_connectors[i].data.name === edge.dst_connector) {\n                        edge.points[n] = intersectRect(\n                            el.in_connectors[i], edge.points[n-1]\n                        );\n                        moved = true;\n                        break;\n                    }\n                }\n            }\n            if (!moved) {\n                edge.points[n].x += dx;\n                edge.points[n].y += dy;\n            }\n            // Also update source point of edge\n            if (edge.src_connector !== null) {\n                let e = parent_element?.data?.state?.edges[edge.id];\n                let src_el = parent_graph.node(e?.src);\n                if (src_el) {\n                    for (let i = 0; i < src_el.out_connectors.length; i++) {\n                        let out_name = src_el.out_connectors[i].data.name;\n                        if (out_name === edge.src_connector) {\n                            edge.points[0] = intersectRect(\n                                src_el.out_connectors[i], edge.points[1]\n                            );\n                            break;\n                        }\n                    }\n                }\n            }\n            updateEdgeBoundingBox(edge);\n        });\n    }\n\n    mapPixelToCoordsX(xpos) {\n        return this.svgPoint(xpos, 0).matrixTransform(this.user_transform.inverse()).x;\n    }\n\n    mapPixelToCoordsY(ypos) {\n        return this.svgPoint(0, ypos).matrixTransform(this.user_transform.inverse()).y;\n    }\n\n    noJitter(x) {\n        x = parseFloat(x.toFixed(3));\n        x = Math.round(x * 100) / 100;\n        return x;\n    }\n\n    points_per_pixel() {\n        // Since we are using uniform scaling, (bottom-top)/height and\n        // (right-left)/width should be equivalent\n        const left = this.mapPixelToCoordsX(0);\n        const right = this.mapPixelToCoordsX(this.canvas.width);\n        return (right - left) / this.canvas.width;\n    }\n\n    animation_step(now) {\n        if (this.animation === null) {\n            return;\n        }\n\n        if (this.animation_start === null) {\n            this.animation_start = now;\n            this.animation_end = now + animation_duration;\n        }\n\n        if (now >= this.animation_end) {\n            this.user_transform = this.animation(1);\n            this.stopAnimation();\n            return;\n        }\n\n        const start = this.animation_start;\n        const end = this.animation_end;\n        this.user_transform = this.animation(animation_function((now - start) / (end - start)));\n    }\n\n    draw_now(now) {\n        if (this._destroying)\n            return;\n\n        let dt = now - this.prev_time;\n        if (!this.prev_time)\n            dt = null;\n        this.prev_time = now;\n\n        if (this.contention > 0) return;\n        this.contention += 1;\n        const ctx = this.ctx;\n\n        // Clear with default transform\n        ctx.save();\n        ctx.setTransform(1, 0, 0, 1, 0, 0);\n        ctx.clearRect(0, 0, ctx.canvas.width, ctx.canvas.height);\n        ctx.fillStyle = this.renderer.bgcolor;\n        ctx.fillRect(0, 0, ctx.canvas.width, ctx.canvas.height);\n        ctx.restore();\n\n        this.animation_step(now);\n\n        this.applyUserTransform();\n        if (this.request_scale)\n            this.request_scale = this.contention !== 1;\n\n        this.renderer.draw(dt);\n        this.contention -= 1;\n\n        if (this.animation_end !== null && now < this.animation_end)\n            this.draw_async();\n    }\n\n    draw_async() {\n        this.anim_id = window.requestAnimationFrame((now) => this.draw_now(now));\n    }\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\n/**\n * Returns a function taking a number from 0 to 1 which linearly interpolates between two matrices.\n * Uses the matrix interpolation algorithm for CSS animations\n * https://www.w3.org/TR/css-transforms-1/#decomposing-a-2d-matrix\n */\nexport function lerpMatrix(m1, m2) {\n    function decompose(m) {\n        const scale = [Math.sqrt(m.a * m.a + m.b * m.b), Math.sqrt(m.c * m.c + m.d * m.d)];\n\n        const det = m.a * m.d - m.b * m.c;\n        if (det < 0) {\n            if (m.a < m.d)\n                scale[0] = -scale[0];\n            else\n                scale[1] = -scale[1];\n        }\n\n        const row0x = m.a / (scale[0] || 1);\n        const row0y = m.b / (scale[0] || 1);\n        const row1x = m.c / (scale[1] || 1);\n        const row1y = m.d / (scale[1] || 1);\n\n        const skew11 = row0x * row0x - row0y * row1x;\n        const skew12 = row0x * row0y - row0y * row1y;\n        const skew21 = row0x * row1x - row0y * row0x;\n        const skew22 = row0x * row1y - row0y * row0y;\n\n        const angle = Math.atan2(m.b, m.a) * 180 / Math.PI;\n\n        return {\n            translate: [m.e, m.f],\n            scale,\n            skew11,\n            skew12,\n            skew21,\n            skew22,\n            angle,\n        };\n    }\n\n    function lerpDecomposed(d1, d2, t) {\n        function lerp(a, b) {\n            return (b - a) * t + a;\n        }\n\n        let d1Angle = d1.angle || 360;\n        let d2Angle = d2.angle || 360;\n        let d1Scale = d1.scale;\n\n        if ((d1.scale[0] < 0 && d2.scale[1] < 0) || (d1.scale[1] < 0 && d2.scale[0] < 0)) {\n            d1Scale = [-d1Scale[0], -d1Scale[1]];\n            d1Angle += d1Angle < 0 ? 180 : -180;\n        }\n\n        if (Math.abs(d1Angle - d2Angle) > 180) {\n            if (d1Angle > d2Angle) {\n                d1Angle -= 360;\n            } else {\n                d2Angle -= 360;\n            }\n        }\n\n\n        return {\n            translate: [\n                lerp(d1.translate[0], d2.translate[0]),\n                lerp(d1.translate[1], d2.translate[1]),\n            ],\n            scale: [\n                lerp(d1Scale[0], d2.scale[0]),\n                lerp(d1Scale[1], d2.scale[1]),\n            ],\n            skew11: lerp(d1.skew11, d2.skew11),\n            skew12: lerp(d1.skew12, d2.skew12),\n            skew21: lerp(d1.skew21, d2.skew21),\n            skew22: lerp(d1.skew22, d2.skew22),\n            angle: lerp(d1Angle, d2Angle),\n        };\n    }\n\n    function recompose(d) {\n        const matrix = document.createElementNS(\"http://www.w3.org/2000/svg\", 'svg').createSVGMatrix();\n        matrix.a = d.skew11;\n        matrix.b = d.skew12;\n        matrix.c = d.skew21;\n        matrix.d = d.skew22;\n        matrix.e = d.translate[0] * d.skew11 + d.translate[1] * d.skew21;\n        matrix.f = d.translate[0] * d.skew12 + d.translate[1] * d.skew22;\n        return matrix.rotate(0, 0, d.angle * Math.PI / 180).scale(d.scale[0], d.scale[1]);\n    }\n\n    const d1 = decompose(m1);\n    const d2 = decompose(m2);\n\n    return (t) => recompose(lerpDecomposed(d1, d2, t));\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { createElement } from \"./utils/utils\";\nimport { GenericSdfgOverlay } from './overlays/generic_sdfg_overlay';\nimport { RuntimeMicroSecondsOverlay } from './overlays/runtime_micro_seconds_overlay';\nimport { StaticFlopsOverlay } from './overlays/static_flops_overlay';\nimport { MemoryVolumeOverlay } from './overlays/memory_volume_overlay';\nimport { parse } from 'mathjs';\nimport { htmlSanitize } from \"./utils/sanitization\";\n\nclass SymbolResolver {\n\n    constructor(renderer) {\n        this.renderer = renderer;\n        this.sdfg = this.renderer.sdfg;\n        this.vscode = typeof vscode !== 'undefined' && vscode;\n\n        // Initialize the symbol mapping to the graph's symbol table.\n        this.symbol_value_map = {};\n        Object.keys(this.sdfg.attributes.symbols).forEach((s) => {\n            if (this.sdfg.attributes.constants_prop !== undefined &&\n                Object.keys(this.sdfg.attributes.constants_prop).includes(s) &&\n                this.sdfg.attributes.constants_prop[s][0]['type'] === 'Scalar')\n                this.symbol_value_map[s] = this.sdfg.attributes.constants_prop[\n                    s\n                ][1];\n            else\n                this.symbol_value_map[s] = undefined;\n        });\n        this.symbols_to_define = [];\n\n        this.init_overlay_popup_dialogue();\n    }\n\n    symbol_value_changed(symbol, value) {\n        if (symbol in this.symbol_value_map)\n            this.symbol_value_map[symbol] = value;\n    }\n\n    parse_symbol_expression(\n        expression_string,\n        mapping,\n        prompt_completion = false,\n        callback = undefined\n    ) {\n        let result = undefined;\n        try {\n            const expression_tree = parse(expression_string);\n            if (prompt_completion) {\n                this.recursive_find_undefined_symbol(expression_tree, mapping);\n                this.prompt_define_symbol(mapping, callback);\n            } else {\n                try {\n                    const evaluated =\n                        expression_tree.evaluate(mapping);\n                    if (evaluated !== undefined &&\n                        !isNaN(evaluated) &&\n                        Number.isInteger(+evaluated))\n                        result = +evaluated;\n                    else\n                        result = undefined;\n                } catch (e) {\n                    result = undefined;\n                }\n            }\n            return result;\n        } catch (exception) {\n            console.error(exception);\n        } finally {\n            return result;\n        }\n    }\n\n    prompt_define_symbol(mapping, callback = undefined) {\n        if (this.symbols_to_define.length > 0) {\n            const symbol = this.symbols_to_define.pop();\n            const that = this;\n            this.popup_dialogue._show(\n                symbol,\n                mapping,\n                () => {\n                    if (this.vscode)\n                        vscode.postMessage({\n                            type: 'analysis.define_symbol',\n                            symbol: symbol,\n                            definition: mapping[symbol],\n                        });\n                    if (callback !== undefined)\n                        callback();\n                    that.prompt_define_symbol(mapping, callback);\n                }\n            );\n        }\n    }\n\n    recursive_find_undefined_symbol(expression_tree, mapping) {\n        expression_tree.forEach((node, path, parent) => {\n            switch (node.type) {\n                case 'SymbolNode':\n                    if (node.name in mapping &&\n                        mapping[node.name] === undefined &&\n                        !this.symbols_to_define.includes(node.name)) {\n                        // This is an undefined symbol.\n                        // Ask for it to be defined.\n                        this.symbols_to_define.push(node.name);\n                    }\n                    break;\n                case 'OperatorNode':\n                case 'ParenthesisNode':\n                    this.recursive_find_undefined_symbol(node, mapping);\n                    break;\n                default:\n                    // Ignore\n                    break;\n            }\n        });\n    }\n\n    init_overlay_popup_dialogue() {\n        let dialogue_background = createElement('div', '',\n            ['sdfv_modal_background'], document.body);\n        dialogue_background._show = function () {\n            this.style.display = 'block';\n        };\n        dialogue_background._hide = function () {\n            this.style.display = 'none';\n        };\n\n        let popup_dialogue = createElement('div', 'sdfv_overlay_dialogue',\n            ['sdfv_modal'], dialogue_background);\n        popup_dialogue.addEventListener('click', (ev) => {\n            ev.stopPropagation();\n        });\n        popup_dialogue.style.display = 'none';\n        this.popup_dialogue = popup_dialogue;\n\n        let header_bar = createElement('div', '', ['sdfv_modal_title_bar'],\n            this.popup_dialogue);\n        this.popup_dialogue._title = createElement('span', '',\n            ['sdfv_modal_title'], header_bar);\n        let close_button = createElement('div', '', ['modal_close'],\n            header_bar);\n        close_button.innerHTML = htmlSanitize`<i class=\"material-icons\">close</i>`;\n        close_button.addEventListener('click', () => {\n            popup_dialogue._hide();\n        });\n\n        let content_box = createElement('div', '', ['sdfv_modal_content_box'],\n            this.popup_dialogue);\n        this.popup_dialogue._content = createElement('div', '',\n            ['sdfv_modal_content'], content_box);\n        this.popup_dialogue._input = createElement('input', 'symbol_input',\n            ['sdfv_modal_input_text'], this.popup_dialogue._content);\n        \n        function set_val() {\n            if (popup_dialogue._map && popup_dialogue._symbol) {\n                let val = popup_dialogue._input.value;\n                if (val && !isNaN(val) && Number.isInteger(+val) && val > 0) {\n                    popup_dialogue._map[popup_dialogue._symbol] = val;\n                    popup_dialogue._hide();\n                    if (popup_dialogue._callback)\n                        popup_dialogue._callback();\n                    return;\n                }\n            }\n            popup_dialogue._input.setCustomValidity('Invalid, not an integer');\n        }\n        this.popup_dialogue._input.addEventListener('keypress', (ev) => {\n            if (ev.which === 13)\n                set_val();\n        });\n\n        let footer_bar = createElement('div', '', ['sdfv_modal_footer_bar'],\n            this.popup_dialogue);\n        let confirm_button = createElement('div', '',\n            ['button', 'sdfv_modal_confirm_button'], footer_bar);\n        confirm_button.addEventListener('click', (ev) => { set_val(); });\n        let confirm_button_text = createElement('span', '', [], confirm_button);\n        confirm_button_text.innerText = 'Confirm';\n        createElement('div', '', ['clearfix'], footer_bar);\n\n        this.popup_dialogue._show = function (symbol, map, callback) {\n            this.style.display = 'block';\n            popup_dialogue._title.innerText = 'Define symbol ' + symbol;\n            popup_dialogue._symbol = symbol;\n            popup_dialogue._map = map;\n            popup_dialogue._callback = callback;\n            dialogue_background._show();\n        };\n        this.popup_dialogue._hide = function () {\n            this.style.display = 'none';\n            popup_dialogue._title.innerText = '';\n            popup_dialogue._input.value = '';\n            popup_dialogue._input.setCustomValidity('');\n            dialogue_background._hide();\n        };\n        dialogue_background.addEventListener('click', (ev) => {\n            popup_dialogue._hide();\n        });\n    }\n\n}\n\nexport class OverlayManager {\n\n    constructor(renderer) {\n        this.renderer = renderer;\n\n        this.badness_scale_method = 'median';\n\n        this.overlays = [];\n\n        this.symbol_resolver = new SymbolResolver(this.renderer);\n    }\n\n    register_overlay(type) {\n        switch (type) {\n            case MemoryVolumeOverlay:\n            case StaticFlopsOverlay:\n            case RuntimeMicroSecondsOverlay:\n                this.overlays.push(\n                    new type(this, this.renderer)\n                );\n                break;\n            default:\n                // Object overlay\n                this.overlays.push(type);\n                break;\n        }\n        this.renderer.draw_async();\n    }\n\n    deregister_overlay(type) {\n        this.overlays = this.overlays.filter(overlay => {\n            return !(overlay instanceof type);\n        });\n\n        this.renderer.draw_async();\n    }\n\n    is_overlay_active(type) {\n        return this.overlays.filter(overlay => {\n            return overlay instanceof type;\n        }).length > 0;\n    }\n\n    get_overlay(type) {\n        let overlay = undefined;\n        this.overlays.forEach(ol => {\n            if (ol instanceof type) {\n                overlay = ol;\n                return;\n            }\n        });\n        return overlay;\n    }\n\n    symbol_value_changed(symbol, value) {\n        this.symbol_resolver.symbol_value_changed(symbol, value);\n        this.overlays.forEach(overlay => {\n            overlay.refresh();\n        });\n    }\n\n    update_badness_scale_method(method) {\n        this.badness_scale_method = method;\n        this.overlays.forEach(overlay => {\n            overlay.refresh();\n        });\n    }\n\n    draw() {\n        this.overlays.forEach(overlay => {\n            overlay.draw();\n        });\n    }\n\n    refresh() {\n        this.overlays.forEach(overlay => {\n            overlay.refresh();\n        });\n    }\n\n    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {\n        this.overlays.forEach(overlay => {\n            overlay.on_mouse_event(type, ev, mousepos, elements,\n                foreground_elem, ends_drag);\n        });\n    }\n\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport dagre from 'dagre';\nimport { intersectRect } from 'dagre/lib/util';\nimport {\n    find_exit_for_entry,\n    get_positioning_info,\n    delete_positioning_info,\n    get_uuid_graph_element,\n    find_graph_element_by_uuid,\n} from '../utils/sdfg/sdfg_utils';\nimport { deepCopy } from '../utils/utils.ts';\nimport { traverse_sdfg_scopes } from '../utils/sdfg/traversal';\nimport { ContextMenu } from '../utils/context_menu';\nimport {\n    Connector,\n    Edge,\n    offset_state,\n    SDFGElements,\n    draw_sdfg,\n    offset_sdfg,\n    NestedSDFG,\n} from './renderer_elements';\nimport { check_and_redirect_edge } from '../utils/sdfg/sdfg_utils';\nimport { memlet_tree_complete } from '../utils/sdfg/traversal';\nimport { CanvasManager } from './canvas_manager';\nimport {\n    boundingBox,\n    calculateBoundingBox,\n    calculateEdgeBoundingBox,\n} from '../utils/bounding_box';\nimport { OverlayManager } from '../overlay_manager';\nimport { fill_info } from '../sdfv';\nimport { MemoryVolumeOverlay } from '../overlays/memory_volume_overlay';\n\nfunction check_valid_add_position(type, foreground_elem, lib, mousepos) {\n    switch (type) {\n        case 'SDFGState':\n            return (foreground_elem instanceof NestedSDFG ||\n                    foreground_elem === null);\n        case 'Edge':\n            return (foreground_elem instanceof SDFGNode ||\n                    foreground_elem instanceof State);\n        case 'LibraryNode':\n            return (foreground_elem instanceof State && lib);\n        default:\n            return foreground_elem instanceof State;\n    }\n}\n\nexport class SDFGRenderer {\n    constructor(sdfg, container, on_mouse_event = null, user_transform = null,\n                debug_draw = false, background = null, mode_buttons = null) {\n        // DIODE/SDFV-related fields\n        this.sdfg = sdfg;\n        this.sdfg_list = {};\n        this.state_parent_list = {}; // List of all state's parent elements\n\n        // Rendering-related fields\n        this.container = container;\n        this.ctx = null;\n        this.canvas = null;\n        this.last_visible_elements = null;\n        this.last_hovered_elements = null;\n        this.last_clicked_elements = null;\n        this.last_dragged_element = null;\n        this.tooltip = null;\n        this.tooltip_container = null;\n\n        // Toolbar-related fields\n        this.menu = null;\n        this.toolbar = null;\n        this.panmode_btn = null;\n        this.movemode_btn = null;\n        this.selectmode_btn = null;\n        this.addmode_btns = null;\n        this.add_type = null;\n        this.add_mode_lib = null;\n        this.addmode_divs = null;\n        this.mode_selected_bg_color = \"#CCCCCC\";\n        this.mouse_follow_svgs = null;\n        this.mouse_follow_element = null;\n\n        // Memlet-Tree related fields\n        this.all_memlet_trees_sdfg = [];\n\n        // View options\n        this.inclusive_ranges = false;\n        this.omit_access_nodes = false;\n\n        // Mouse-related fields\n        this.mouse_mode = 'pan'; // Mouse mode - pan, move, select\n        this.box_select_rect = null;\n        this.mousepos = null; // Last position of the mouse pointer (in canvas coordinates)\n        this.realmousepos = null; // Last position of the mouse pointer (in pixel coordinates)\n        this.dragging = false;\n        this.drag_start = null; // Null if the mouse/touch is not activated\n        this.drag_second_start = null; // Null if two touch points are not activated\n        this.external_mouse_handler = on_mouse_event;\n        this.ctrl_key_selection = false;\n        this.shift_key_movement = false;\n        this.add_uuid = null;\n        this.add_position = null;\n        this.add_edge_start = null;\n\n        // Selection related fields\n        this.selected_elements = [];\n\n        // Overlay fields\n        try {\n            this.overlay_manager = new OverlayManager(this);\n        } catch (ex) {\n            this.overlay_manager = null;\n        }\n\n        this.in_vscode = false;\n        try {\n            vscode;\n            if (vscode)\n                this.in_vscode = true;\n        } catch (ex) { }\n\n        // Draw debug aids.\n        this.debug_draw = debug_draw;\n\n        this.init_elements(user_transform, background, mode_buttons);\n\n        this.relayout();\n\n        this.all_memlet_trees_sdfg = memlet_tree_complete(this.sdfg);\n\n        this.update_fast_memlet_lookup();\n    }\n\n    destroy() {\n        try {\n            if (this.menu)\n                this.menu.destroy();\n            this.canvas_manager.destroy();\n            this.container.removeChild(this.canvas);\n            this.container.removeChild(this.toolbar);\n            this.container.removeChild(this.tooltip_container);\n        } catch (ex) {\n            // Do nothing\n        }\n    }\n\n    view_settings() {\n        return { inclusive_ranges: this.inclusive_ranges };\n    }\n\n    // Updates buttons based on cursor mode\n    update_toggle_buttons() {\n        // First clear out of all modes, then jump in to the correct mode.\n        this.canvas.style.cursor = 'default';\n        this.interaction_info_box.style.display = 'none';\n        this.interaction_info_text.innerHTML = '';\n\n        this.panmode_btn.style = 'padding-bottom: 0px; user-select: none';\n        this.movemode_btn.style = 'padding-bottom: 0px; user-select: none';\n        this.selectmode_btn.style = 'padding-bottom: 0px; user-select: none';\n\n        this.mouse_follow_element.innerHTML = null;\n\n        for (let add_btn of this.addmode_btns) {\n            if (add_btn.getAttribute('type') == this.add_type) {\n                add_btn.style = 'user-select: none; background: ' +\n                    this.mode_selected_bg_color;\n                this.mouse_follow_element.innerHTML =\n                    this.mouse_follow_svgs[this.add_type];\n            } else {\n                add_btn.style = 'user-select: none;';\n            }\n        }\n\n        switch (this.mouse_mode) {\n            case 'move':\n                this.movemode_btn.style = 'padding-bottom: 0px; ' +\n                    'user-select: none; ' +\n                    'background: ' + this.mode_selected_bg_color;\n                this.interaction_info_box.style.display = 'block';\n                this.interaction_info_text.innerHTML =\n                    'Middle Mouse: Pan view<br>' +\n                    'Right Click: Reset position';\n                break;\n            case 'select':\n                this.selectmode_btn.style = 'padding-bottom: 0px; ' +\n                    'user-select: none; ' +\n                    'background: ' + this.mode_selected_bg_color;\n                this.interaction_info_box.style.display = 'block';\n                this.canvas.style.cursor = 'crosshair';\n                if (this.ctrl_key_selection) {\n                    this.interaction_info_text.innerHTML =\n                        'Middle Mouse: Pan view';\n                } else {\n                    this.interaction_info_text.innerHTML =\n                        'Shift: Add to selection<br>' +\n                        'Ctrl: Remove from selection<br>' +\n                        'Middle Mouse: Pan view';\n                }\n                break;\n            case 'add':\n                this.interaction_info_box.style.display = 'block';\n                if (this.add_type === 'Edge') {\n                    if (this.add_edge_start)\n                        this.interaction_info_text.innerHTML =\n                            'Left Click: Select second element (to)<br>' +\n                            'Middle Mouse: Pan view<br>' +\n                            'Right Click / Esc: Abort';\n                    else\n                        this.interaction_info_text.innerHTML =\n                            'Left Click: Select first element (from)<br>' +\n                            'Middle Mouse: Pan view<br>' +\n                            'Right Click / Esc: Abort';\n                } else {\n                    this.interaction_info_text.innerHTML =\n                        'Left Click: Place element<br>' +\n                        'Ctrl + Left Click: Place and stay in Add Mode<br>' +\n                        'Middle Mouse: Pan view<br>' +\n                        'Right Click / Esc: Abort';\n                }\n                break;\n            case 'pan':\n            default:\n                this.panmode_btn.style = 'padding-bottom: 0px; ' +\n                    'user-select: none; ' +\n                    'background: ' + this.mode_selected_bg_color;\n                break;\n        }\n    }\n\n    // Initializes the DOM\n    init_elements(user_transform, background, mode_buttons) {\n\n        this.canvas = document.createElement('canvas');\n        this.canvas.classList.add('sdfg_canvas')\n        if (background)\n            this.canvas.style.backgroundColor = background;\n        else\n            this.canvas.style.backgroundColor = 'inherit';\n        this.container.append(this.canvas);\n\n        if (this.debug_draw) {\n            this.dbg_info_box = document.createElement('div');\n            this.dbg_info_box.style.position = 'absolute';\n            this.dbg_info_box.style.bottom = '.5rem';\n            this.dbg_info_box.style.right = '.5rem';\n            this.dbg_info_box.style.backgroundColor = 'black';\n            this.dbg_info_box.style.padding = '.3rem';\n            this.dbg_mouse_coords = document.createElement('span');\n            this.dbg_mouse_coords.style.color = 'white';\n            this.dbg_mouse_coords.style.fontSize = '1rem';\n            this.dbg_mouse_coords.innerText = 'x: N/A / y: N/A';\n            this.dbg_info_box.appendChild(this.dbg_mouse_coords);\n            this.container.appendChild(this.dbg_info_box);\n        }\n\n        // Add an info box for interaction hints to the bottom left of the\n        // canvas.\n        this.interaction_info_box = document.createElement('div');\n        this.interaction_info_box.style.position = 'absolute';\n        this.interaction_info_box.style.bottom = '.5rem',\n        this.interaction_info_box.style.left = '.5rem',\n        this.interaction_info_box.style.backgroundColor = 'rgba(0, 0, 0, 0.5)';\n        this.interaction_info_box.style.borderRadius = '5px';\n        this.interaction_info_box.style.padding = '.3rem';\n        this.interaction_info_box.style.display = 'none';\n        this.interaction_info_text = document.createElement('span');\n        this.interaction_info_text.style.color = '#eeeeee';\n        this.interaction_info_text.innerHTML = '';\n        this.interaction_info_box.appendChild(this.interaction_info_text);\n        this.container.appendChild(this.interaction_info_box);\n\n        // Add buttons\n        this.toolbar = document.createElement('div');\n        this.toolbar.style = 'position:absolute; top:10px; left: 10px;';\n        let d;\n\n        // Menu bar\n        try {\n            ContextMenu;\n            d = document.createElement('button');\n            d.className = 'button';\n            d.innerHTML = '<i class=\"material-icons\">menu</i>';\n            d.style = 'padding-bottom: 0px; user-select: none';\n            let that = this;\n            d.onclick = function () {\n                if (that.menu && that.menu.visible()) {\n                    that.menu.destroy();\n                    return;\n                }\n                let rect = this.getBoundingClientRect();\n                let cmenu = new ContextMenu();\n                cmenu.addOption(\"Save view as PNG\", x => that.save_as_png());\n                if (that.has_pdf()) {\n                    cmenu.addOption(\"Save view as PDF\", x => that.save_as_pdf());\n                    cmenu.addOption(\"Save all as PDF\", x => that.save_as_pdf(true));\n                }\n                cmenu.addCheckableOption(\"Inclusive ranges\", that.inclusive_ranges, (x, checked) => { that.inclusive_ranges = checked; });\n                cmenu.addCheckableOption(\"Adaptive content hiding\", that.ctx.lod, (x, checked) => { that.ctx.lod = checked; });\n                if (!this.in_vscode)\n                    cmenu.addOption(\n                        'Overlays',\n                        () => {\n                            if (that.overlays_menu && that.overlays_menu.visible()) {\n                                that.overlays_menu.destroy();\n                                return;\n                            }\n                            let rect = cmenu._cmenu_elem.getBoundingClientRect();\n                            let overlays_cmenu = new ContextMenu();\n                            overlays_cmenu.addCheckableOption(\n                                'Memory volume analysis',\n                                that.overlay_manager.is_overlay_active(\n                                    MemoryVolumeOverlay\n                                ),\n                                (x, checked) => {\n                                    if (checked)\n                                        that.overlay_manager.register_overlay(\n                                            MemoryVolumeOverlay\n                                        );\n                                    else\n                                        that.overlay_manager.deregister_overlay(\n                                            MemoryVolumeOverlay\n                                        );\n                                    that.draw_async();\n                                    if (this.in_vscode)\n                                        refresh_analysis_pane();\n                                }\n                            );\n                            that.overlays_menu = overlays_cmenu;\n                            that.overlays_menu.show(rect.left, rect.top);\n                        }\n                    );\n                cmenu.addCheckableOption(\"Hide Access Nodes\", that.omit_access_nodes, (_, checked) => {\n                    that.omit_access_nodes = checked;\n                    that.relayout();\n                    that.draw_async();\n                });\n                cmenu.addOption(\"Reset positions\", () => that.reset_positions());\n                that.menu = cmenu;\n                that.menu.show(rect.left, rect.bottom);\n            };\n            d.title = 'Menu';\n            this.toolbar.appendChild(d);\n        } catch (ex) { }\n\n        // Zoom to fit\n        d = document.createElement('button');\n        d.className = 'button';\n        d.innerHTML = '<i class=\"material-icons\">filter_center_focus</i>';\n        d.style = 'padding-bottom: 0px; user-select: none';\n        d.onclick = () => this.zoom_to_view();\n        d.title = 'Zoom to fit SDFG';\n        this.toolbar.appendChild(d);\n\n        // Collapse all\n        d = document.createElement('button');\n        d.className = 'button';\n        d.innerHTML = '<i class=\"material-icons\">unfold_less</i>';\n        d.style = 'padding-bottom: 0px; user-select: none';\n        d.onclick = () => this.collapse_all();\n        d.title = 'Collapse all elements';\n        this.toolbar.appendChild(d);\n\n        // Expand all\n        d = document.createElement('button');\n        d.className = 'button';\n        d.innerHTML = '<i class=\"material-icons\">unfold_more</i>';\n        d.style = 'padding-bottom: 0px; user-select: none';\n        d.onclick = () => this.expand_all();\n        d.title = 'Expand all elements';\n        this.toolbar.appendChild(d);\n\n        if (mode_buttons) {\n            // If we get the \"external\" mode buttons we are in vscode and do\n            // not need to create them.\n            this.panmode_btn = mode_buttons.pan;\n            this.movemode_btn = mode_buttons.move;\n            this.selectmode_btn = mode_buttons.select;\n            this.addmode_btns = mode_buttons.add_btns;\n            for (let add_btn of this.addmode_btns) {\n                if (add_btn.getAttribute('type') === 'LibraryNode') {\n                    add_btn.onclick = () => {\n                        this.show_select_library_node_dialog(() => {\n                            this.mouse_mode = 'add';\n                            this.add_type = 'LibraryNode';\n                            this.add_edge_start = null;\n                            this.update_toggle_buttons()\n                        });\n                    };\n                } else {\n                    add_btn.onclick = () => {\n                        if (!daemon_connected) {\n                            this.show_no_daemon_dialog();\n                        } else {\n                            this.mouse_mode = 'add';\n                            this.add_type = add_btn.getAttribute('type');\n                            this.add_mode_lib = null;\n                            this.add_edge_start = null;\n                            this.update_toggle_buttons();\n                        }\n                    };\n                }\n            }\n            this.mode_selected_bg_color = '#22A4FE';\n        } else {\n            // Mode buttons are empty in standalone SDFV\n            this.addmode_btns = [];\n\n            // Create pan mode button\n            let pan_mode_btn = document.createElement('button');\n            pan_mode_btn.className = 'button';\n            pan_mode_btn.innerHTML = '<i class=\"material-icons\">pan_tool</i>';\n            pan_mode_btn.style = 'padding-bottom: 0px; user-select: none; background: ' + this.mode_selected_bg_color;\n            pan_mode_btn.title = 'Pan mode';\n            this.panmode_btn = pan_mode_btn;\n            this.toolbar.appendChild(pan_mode_btn);\n\n            // Create move mode button\n            let move_mode_btn = document.createElement('button');\n            move_mode_btn.className = 'button';\n            move_mode_btn.innerHTML = '<i class=\"material-icons\">open_with</i>';\n            move_mode_btn.style = 'padding-bottom: 0px; user-select: none';\n            move_mode_btn.title = 'Object moving mode';\n            this.movemode_btn = move_mode_btn;\n            this.toolbar.appendChild(move_mode_btn);\n\n            // Create select mode button\n            let box_select_btn = document.createElement('button');\n            box_select_btn.className = 'button';\n            box_select_btn.innerHTML = '<i class=\"material-icons\">border_style</i>';\n            box_select_btn.style = 'padding-bottom: 0px; user-select: none';\n            box_select_btn.title = 'Select mode';\n            this.selectmode_btn = box_select_btn;\n            this.toolbar.appendChild(box_select_btn);\n        }\n\n        // Enter pan mode\n        this.panmode_btn.onclick = () => {\n            this.mouse_mode = 'pan';\n            this.add_type = null;\n            this.add_mode_lib = null;\n            this.add_edge_start = null;\n            this.update_toggle_buttons();\n        };\n\n        // Enter object moving mode\n        this.movemode_btn.onclick = (_, shift_click) => {\n            // shift_click is false if shift key has been released and\n            // undefined if it has been a normal mouse click\n            if (this.shift_key_movement && shift_click === false)\n                this.mouse_mode = 'pan';\n            else\n                this.mouse_mode = 'move';\n            this.add_type = null;\n            this.add_mode_lib = null;\n            this.add_edge_start = null;\n            this.shift_key_movement = shift_click;\n            this.update_toggle_buttons();\n        };\n\n        // Enter box selection mode\n        this.selectmode_btn.onclick = (_, ctrl_click) => {\n            // ctrl_click is false if ctrl key has been released and\n            // undefined if it has been a normal mouse click\n            if (this.ctrl_key_selection && ctrl_click === false)\n                this.mouse_mode = 'pan';\n            else\n                this.mouse_mode = 'select';\n            this.add_type = null;\n            this.add_mode_lib = null;\n            this.add_edge_start = null;\n            this.ctrl_key_selection = ctrl_click;\n            this.update_toggle_buttons();\n        };\n\n        // React to ctrl and shift key presses\n        document.addEventListener('keydown', (e) => this.on_key_event(e));\n        document.addEventListener('keyup', (e) => this.on_key_event(e));\n\n        // Exit previewing mode\n        if (this.in_vscode) {\n            let exit_preview_btn = document.createElement('button');\n            exit_preview_btn.id = 'exit-preview-button';\n            exit_preview_btn.className = 'button hidden';\n            exit_preview_btn.innerHTML = '<i class=\"material-icons\">close</i>';\n            exit_preview_btn.style = 'padding-bottom: 0px; user-select: none';\n            exit_preview_btn.onclick = () => {\n                exit_preview_btn.className = 'button hidden';\n                window.viewing_history_state = false;\n                if (vscode) {\n                    vscode.postMessage({\n                        type: 'sdfv.get_current_sdfg',\n                        prevent_refreshes: true,\n                    });\n                    vscode.postMessage({\n                        type: 'transformation_history.refresh',\n                        reset_active: true,\n                    });\n                }\n            };\n            exit_preview_btn.title = 'Exit preview';\n            this.toolbar.appendChild(exit_preview_btn);\n        }\n\n        this.container.append(this.toolbar);\n        // End of buttons\n\n        // Tooltip HTML container\n        this.tooltip_container = document.createElement('div');\n        this.tooltip_container.innerHTML = '';\n        this.tooltip_container.className = 'sdfvtooltip';\n        this.tooltip_container.onmouseover = () => this.tooltip_container.style.display = \"none\";\n        this.container.appendChild(this.tooltip_container);\n\n        // HTML container for error popovers with invalid SDFGs\n        this.error_popover_container = document.createElement('div');\n        this.error_popover_container.innerHTML = '';\n        this.error_popover_container.className = 'invalid_popup';\n        this.error_popover_text = document.createElement('div');\n        let error_popover_dismiss = document.createElement('button');\n        let that = this;\n        error_popover_dismiss.onclick = () => {\n            that.sdfg.error = undefined;\n            that.error_popover_text.innerText = '';\n            that.error_popover_container.style.display = 'none';\n        };\n        error_popover_dismiss.style.float = 'right';\n        error_popover_dismiss.style.cursor = 'pointer';\n        error_popover_dismiss.style.color = 'white';\n        error_popover_dismiss.innerHTML = '<i class=\"material-icons\">close</i>';\n        this.error_popover_container.appendChild(error_popover_dismiss);\n        this.error_popover_container.appendChild(this.error_popover_text);\n        this.container.appendChild(this.error_popover_container);\n\n        this.ctx = this.canvas.getContext(\"2d\");\n\n        // Translation/scaling management\n        this.canvas_manager = new CanvasManager(this.ctx, this, this.canvas);\n        if (user_transform !== null)\n            this.canvas_manager.user_transform = user_transform;\n\n        // Resize event for container\n        let observer = new MutationObserver((mutations) => { this.onresize(); this.draw_async(); });\n        observer.observe(this.container, { attributes: true });\n\n        // Set inherited properties\n        if (background)\n            this.bgcolor = background;\n        else\n            this.bgcolor = window.getComputedStyle(this.canvas).backgroundColor;\n\n        // Create the initial SDFG layout\n        this.relayout();\n\n        // Set mouse event handlers\n        this.set_mouse_handlers();\n\n        // Set initial zoom, if not already set\n        if (user_transform === null)\n            this.zoom_to_view();\n\n        let svgs = {};\n        svgs['Map'] =\n            `<svg width=\"8rem\" height=\"2rem\" viewBox=\"0 0 800 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"10\" x2=\"190\" y1=\"190\" y2=\"10\"/>\n                <line x1=\"190\" x2=\"600\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"600\" x2=\"790\" y1=\"10\" y2=\"190\"/>\n                <line x1=\"790\" x2=\"10\" y1=\"190\" y2=\"190\"/>\n            </svg>`;\n        svgs['Consume'] =\n            `<svg width=\"8rem\" height=\"2rem\" viewBox=\"0 0 800 200\" stroke=\"black\" stroke-width=\"10\" stroke-dasharray=\"60,25\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"10\"x2=\"190\" y1=\"190\" y2=\"10\"/>\n                <line x1=\"190\" x2=\"600\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"600\" x2=\"790\" y1=\"10\" y2=\"190\"/>\n                <line x1=\"790\" x2=\"10\" y1=\"190\" y2=\"190\"/>\n            </svg>`;\n        svgs['Tasklet'] =\n            `<svg width=\"2.6rem\" height=\"1.3rem\" viewBox=\"0 0 400 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"10\" x2=\"70\" y1=\"130\" y2=\"190\"/>\n                <line x1=\"70\" x2=\"330\" y1=\"190\" y2=\"190\"/>\n                <line x1=\"330\" x2=\"390\" y1=\"190\" y2=\"130\"/>\n                <line x1=\"390\" x2=\"390\" y1=\"130\" y2=\"70\"/>\n                <line x1=\"390\" x2=\"330\" y1=\"70\" y2=\"10\"/>\n                <line x1=\"330\" x2=\"70\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"70\" x2=\"10\" y1=\"10\" y2=\"70\"/>\n                <line x1=\"10\" x2=\"10\" y1=\"70\" y2=\"130\"/>\n            </svg>`;\n        svgs['NestedSDFG'] =\n            `<svg width=\"2.6rem\" height=\"1.3rem\" viewBox=\"0 0 400 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <line x1=\"40\" x2=\"80\" y1=\"120\" y2=\"160\"/>\n                <line x1=\"80\" x2=\"320\" y1=\"160\" y2=\"160\"/>\n                <line x1=\"320\" x2=\"360\" y1=\"160\" y2=\"120\"/>\n                <line x1=\"360\" x2=\"360\" y1=\"120\" y2=\"80\"/>\n                <line x1=\"360\" x2=\"320\" y1=\"80\" y2=\"40\"/>\n                <line x1=\"320\" x2=\"80\" y1=\"40\" y2=\"40\"/>\n                <line x1=\"80\" x2=\"40\" y1=\"40\" y2=\"80\"/>\n                <line x1=\"40\" x2=\"40\" y1=\"80\" y2=\"120\"/>\n                \n                <line x1=\"10\" x2=\"70\" y1=\"130\" y2=\"190\"/>\n                <line x1=\"70\" x2=\"330\" y1=\"190\" y2=\"190\"/>\n                <line x1=\"330\" x2=\"390\" y1=\"190\" y2=\"130\"/>\n                <line x1=\"390\" x2=\"390\" y1=\"130\" y2=\"70\"/>\n                <line x1=\"390\" x2=\"330\" y1=\"70\" y2=\"10\"/>\n                <line x1=\"330\" x2=\"70\" y1=\"10\" y2=\"10\"/>\n                <line x1=\"70\" x2=\"10\" y1=\"10\" y2=\"70\"/>\n                <line x1=\"10\" x2=\"10\" y1=\"70\" y2=\"130\"/>\n            </svg>`;\n        svgs['LibraryNode'] =\n            `<svg width=\"2.6rem\" height=\"1.3rem\" viewBox=\"0 0 400 200\" stroke=\"white\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                        <line x1=\"10\" x2=\"10\" y1=\"10\" y2=\"190\"/>\n                        <line x1=\"10\" x2=\"390\" y1=\"190\" y2=\"190\"/>\n                        <line x1=\"390\" x2=\"390\" y1=\"190\" y2=\"55\"/>\n                        <line x1=\"390\" x2=\"345\" y1=\"55\" y2=\"10\"/>\n                        <line x1=\"345\" x2=\"10\" y1=\"10\" y2=\"10\"/>\n                        <line x1=\"345\" x2=\"345\" y1=\"10\" y2=\"55\"/>\n                        <line x1=\"345\" x2=\"390\" y1=\"55\" y2=\"55\"/>\n            </svg>`;\n        svgs['AccessNode'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <circle cx=\"100\" cy=\"100\" r=\"90\" fill=\"none\"/>\n            </svg>`;\n        svgs['Stream'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <circle cx=\"100\" cy=\"100\" r=\"90\" fill=\"none\" stroke-dasharray=\"60,25\"/>\n            </svg>`;\n        svgs['SDFGState'] = \n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"black\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <rect x=\"20\" y=\"20\" width=\"160\" height=\"160\" style=\"fill:#deebf7;\" />\n            </svg>`;\n        svgs['Connector'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"white\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <circle cx=\"100\" cy=\"100\" r=\"40\" fill=\"none\"/>\n            </svg>`;\n        svgs['Edge'] =\n            `<svg width=\"1.3rem\" height=\"1.3rem\" viewBox=\"0 0 200 200\" stroke=\"white\" stroke-width=\"10\" version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\">\n                <defs>\n                    <marker id=\"arrowhead\" markerWidth=\"10\" markerHeight=\"7\"  refX=\"0\" refY=\"3.5\" orient=\"auto\">\n                        <polygon points=\"0 0, 10 3.5, 0 7\" />\n                    </marker>\n                </defs>\n                <line x1=\"20\" y1=\"20\" x2=\"180\" y2=\"180\" marker-end=\"url(#arrowhead)\" />\n            </svg>`;\n\n        let el = document.createElement('div');\n        el.style = 'position: absolute; top: 0px; left: 0px; user-select: none; pointer-events: none;'\n        \n        this.container.appendChild(el);\n        \n        this.mouse_follow_element = el;\n        this.mouse_follow_svgs = svgs;\n\n        this.update_toggle_buttons();\n\n        // Queue first render\n        this.draw_async();\n    }\n\n    draw_async() {\n        this.canvas_manager.draw_async();\n    }\n\n    // --------------------------------------------------------------\n    // These functions are only implemented in the context of VSCode.\n\n    send_new_sdfg_to_vscode() {}\n\n    add_node_to_graph() {}\n\n    remove_graph_nodes() {}\n\n    update_new_element() {}\n\n    show_no_daemon_dialog() {}\n\n    show_select_library_node_dialog() {}\n\n    // END VSCode specific functions.\n    // --------------------------------------------------------------\n\n    set_sdfg(new_sdfg) {\n        this.sdfg = new_sdfg;\n\n        this.relayout();\n        this.draw_async();\n    \n        // Update info box\n        if (this.selected_elements.length == 1) {\n            let uuid = get_uuid_graph_element(this.selected_elements[0]);\n            fill_info(find_graph_element_by_uuid(this.graph, uuid).element);\n        }\n    }\n\n    // Set mouse events (e.g., click, drag, zoom)\n    set_mouse_handlers() {\n        let canvas = this.canvas;\n        let br = () => canvas.getBoundingClientRect();\n\n        let comp_x = event => this.canvas_manager.mapPixelToCoordsX(event.clientX - br().left);\n        let comp_y = event => this.canvas_manager.mapPixelToCoordsY(event.clientY - br().top);\n\n        // Mouse handler event types\n        for (let evtype of ['mousedown', 'mousemove', 'mouseup', 'touchstart', 'touchmove', 'touchend',\n            'wheel', 'click', 'dblclick', 'contextmenu']) {\n            canvas.addEventListener(evtype, x => {\n                let cancelled = this.on_mouse_event(x, comp_x, comp_y, evtype);\n                if (cancelled)\n                    return;\n                if (!this.in_vscode) {\n                    x.stopPropagation();\n                    x.preventDefault();\n                }\n            });\n        }\n    }\n\n    onresize() {\n        // Set canvas size\n        this.canvas.style.width = '99%';\n        this.canvas.style.height = '99%';\n        this.canvas.width = this.canvas.offsetWidth;\n        this.canvas.height = this.canvas.offsetHeight;\n    }\n\n    // Update memlet tree collection for faster lookup\n    update_fast_memlet_lookup() {\n        this.all_memlet_trees = [];\n        for (let tree of this.all_memlet_trees_sdfg) {\n            let s = new Set();\n            for (let edge of tree) {\n                s.add(edge.attributes.data.edge);\n            }\n            this.all_memlet_trees.push(s);\n        }\n    }\n\n    // Re-layout graph and nested graphs\n    relayout() {\n        this.sdfg_list = {};\n        this.graph = relayout_sdfg(this.ctx, this.sdfg, this.sdfg_list,\n            this.state_parent_list, this.omit_access_nodes);\n        this.onresize();\n\n        this.update_fast_memlet_lookup();\n\n        // Move the elements based on its positioning information\n        this.translate_moved_elements();\n\n        // Make sure all visible overlays get recalculated if there are any.\n        if (this.overlay_manager !== null)\n            this.overlay_manager.refresh();\n\n        // If we're in a VSCode context, we also want to refresh the outline.\n        try {\n            if (vscode)\n                outline(this, this.graph);\n        } catch (ex) { }\n\n        return this.graph;\n    }\n\n    translate_moved_elements() {\n        traverse_sdfg_scopes(this.graph, (node, graph) => {\n            let scope_dx = 0;\n            let scope_dy = 0;\n\n            function add_scope_movement(n) {\n                if (n.data.node.scope_entry) {\n                    let scope_entry_node = graph.node(n.data.node.scope_entry);\n                    let sp = get_positioning_info(scope_entry_node);\n                    if (sp && Number.isFinite(sp.scope_dx) &&\n                        Number.isFinite(sp.scope_dy)) {\n                        scope_dx += sp.scope_dx;\n                        scope_dy += sp.scope_dy;\n                    }\n                    if (scope_entry_node) {\n                        add_scope_movement(scope_entry_node);\n                    }\n                }\n            }\n\n            // Only add scope movement for nodes (and not states)\n            if (node instanceof Node)\n                add_scope_movement(node);\n\n            let dx = scope_dx;\n            let dy = scope_dy;\n\n            let position = get_positioning_info(node);\n            if (position) {\n                dx += position.dx;\n                dy += position.dy;\n            }\n\n            if (dx || dy) {\n                // Move the element\n                this.canvas_manager.translate_element(\n                    node, { x: node.x, y: node.y },\n                    { x: node.x + dx, y: node.y + dy }, this.graph,\n                    this.sdfg_list, this.state_parent_list, undefined, false\n                );\n            }\n\n            graph.inEdges(node.id).forEach(_ => {});\n\n            // Move edges (outgoing only)\n            graph.inEdges(node.id)?.forEach(e_id => {\n                let edge = graph.edge(e_id);\n                let edge_pos = get_positioning_info(edge);\n\n                let final_pos_d;\n                // If edges are moved within a given scope, update the point movements\n                if (scope_dx || scope_dy) {\n                    final_pos_d = [];\n                    final_pos_d.push({ dx: 0, dy: 0 }); // never move first (and last) point manually\n                    for (let i = 1; i < edge.points.length - 1; i++) {\n                        final_pos_d.push({ dx: scope_dx, dy: scope_dy });\n                        if (edge_pos?.points) {\n                            final_pos_d[i].dx += edge_pos.points[i].dx;\n                            final_pos_d[i].dx += edge_pos.points[i].dy;\n                        }\n                    }\n                    final_pos_d.push({ dx: 0, dy: 0 }); // never move last (and first) point manually\n                } else if (edge_pos?.points) {\n                    final_pos_d = edge_pos.points;\n                }\n                if (final_pos_d) {\n                    // Move the element\n                    this.canvas_manager.translate_element(edge, { x: 0, y: 0 },\n                        { x: 0, y: 0 }, this.graph, this.sdfg_list,\n                        this.state_parent_list, undefined, false, false, final_pos_d);\n                }\n            });\n            return true;\n        });\n    }\n\n    // Change translation and scale such that the chosen elements\n    // (or entire graph if null) is in view\n    zoom_to_view(elements = null, animate = true) {\n        if (!elements || elements.length == 0)\n            elements = this.graph.nodes().map(x => this.graph.node(x));\n\n        let bb = boundingBox(elements);\n        this.canvas_manager.set_view(bb, animate);\n\n        this.draw_async();\n    }\n\n    collapse_all() {\n        this.for_all_sdfg_elements((otype, odict, obj) => {\n            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit'))\n                obj.attributes.is_collapsed = true;\n        });\n\n        this.send_new_sdfg_to_vscode();\n\n        this.relayout();\n        this.draw_async();\n    }\n\n    expand_all() {\n        this.for_all_sdfg_elements((otype, odict, obj) => {\n            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit'))\n                obj.attributes.is_collapsed = false;\n        });\n\n        this.send_new_sdfg_to_vscode();\n\n        this.relayout();\n        this.draw_async();\n    }\n\n    reset_positions() {\n        this.for_all_sdfg_elements((otype, odict, obj) => {\n            delete_positioning_info(obj);\n        });\n\n        this.send_new_sdfg_to_vscode();\n\n        this.relayout();\n        this.draw_async();\n    }\n\n    // Save functions\n    save(filename, contents) {\n        var link = document.createElement('a');\n        link.setAttribute('download', filename);\n        link.href = contents;\n        document.body.appendChild(link);\n\n        // wait for the link to be added to the document\n        window.requestAnimationFrame(function () {\n            var event = new MouseEvent('click');\n            link.dispatchEvent(event);\n            document.body.removeChild(link);\n        });\n    }\n\n    save_as_png() {\n        this.save('sdfg.png', this.canvas.toDataURL('image/png'));\n    }\n\n    has_pdf() {\n        try {\n            blobStream;\n            canvas2pdf.PdfContext;\n            return true;\n        } catch (e) {\n            return false;\n        }\n    }\n\n    save_as_pdf(save_all = false) {\n        let stream = blobStream();\n\n        // Compute document size\n        let curx = this.canvas_manager.mapPixelToCoordsX(0);\n        let cury = this.canvas_manager.mapPixelToCoordsY(0);\n        let size;\n        if (save_all) {\n            // Get size of entire graph\n            let elements = this.graph.nodes().map(x => this.graph.node(x));\n            let bb = boundingBox(elements);\n            size = [bb.width, bb.height];\n        } else {\n            // Get size of current view\n            let endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);\n            let endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);\n            let curw = endx - curx, curh = endy - cury;\n            size = [curw, curh];\n        }\n        //\n\n        let ctx = new canvas2pdf.PdfContext(stream, {\n            size: size\n        });\n        let oldctx = this.ctx;\n        this.ctx = ctx;\n        this.ctx.lod = !save_all;\n        this.ctx.pdf = true;\n        // Center on saved region\n        if (!save_all)\n            this.ctx.translate(-curx, -cury);\n\n        this.draw_async();\n\n        ctx.stream.on('finish', () => {\n            this.save('sdfg.pdf', ctx.stream.toBlobURL('application/pdf'));\n            this.ctx = oldctx;\n            this.draw_async();\n        });\n    }\n\n    // Draw a debug grid on the canvas to indicate coordinates.\n    debug_draw_grid(curx, cury, endx, endy, grid_width = 100) {\n        const lim_x_min = Math.floor(curx / grid_width) * grid_width;\n        const lim_x_max = Math.ceil(endx / grid_width) * grid_width;\n        const lim_y_min = Math.floor(cury / grid_width) * grid_width;\n        const lim_y_max = Math.ceil(endy / grid_width) * grid_width;\n        for (var i = lim_x_min; i <= lim_x_max; i += grid_width) {\n            this.ctx.moveTo(i, lim_y_min);\n            this.ctx.lineTo(i, lim_y_max);\n        }\n        for (var i = lim_y_min; i <= lim_y_max; i += grid_width) {\n            this.ctx.moveTo(lim_x_min, i);\n            this.ctx.lineTo(lim_x_max, i);\n        }\n        this.ctx.strokeStyle = 'yellow';\n        this.ctx.stroke();\n\n        // Draw the zero-point.\n        this.ctx.beginPath();\n        this.ctx.arc(0, 0, 10, 0, 2 * Math.PI, false);\n        this.ctx.fillStyle = 'red';\n        this.ctx.fill();\n        this.ctx.strokeStyle = 'red';\n        this.ctx.stroke();\n    }\n\n    // Render SDFG\n    draw(dt) {\n        const ctx = this.ctx;\n        const g = this.graph;\n        const curx = this.canvas_manager.mapPixelToCoordsX(0);\n        const cury = this.canvas_manager.mapPixelToCoordsY(0);\n        const endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);\n        const endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);\n        const curw = endx - curx, curh = endy - cury;\n\n        this.visible_rect = { x: curx, y: cury, w: curw, h: curh };\n\n        this.on_pre_draw();\n\n        draw_sdfg(this, ctx, g, this.mousepos, this.debug_draw);\n\n        if (this.box_select_rect) {\n            this.ctx.beginPath();\n            const old_line_width = this.ctx.lineWidth;\n            this.ctx.lineWidth = this.canvas_manager.points_per_pixel();\n            this.ctx.strokeStyle = 'grey';\n            this.ctx.rect(this.box_select_rect.x_start, this.box_select_rect.y_start,\n                this.box_select_rect.x_end - this.box_select_rect.x_start,\n                this.box_select_rect.y_end - this.box_select_rect.y_start);\n            this.ctx.stroke();\n            this.ctx.lineWidth = old_line_width;\n        }\n\n        if (this.debug_draw) {\n            this.debug_draw_grid(curx, cury, endx, endy, 100);\n            if (this.mousepos) {\n                this.dbg_mouse_coords.innerText = 'x: ' + Math.floor(this.mousepos.x) +\n                    ' / y: ' + Math.floor(this.mousepos.y);\n            } else {\n                this.dbg_mouse_coords.innerText = 'x: N/A / y: N/A';\n            }\n        }\n\n        this.on_post_draw();\n    }\n\n    on_pre_draw() { }\n\n    on_post_draw() {\n        if (this.overlay_manager !== null)\n            this.overlay_manager.draw();\n\n        try {\n            this.ctx.end();\n        } catch (ex) {\n            // TODO make sure no error is thrown instead of catching and silently ignoring it?\n        }\n\n        if (this.tooltip) {\n            const br = this.canvas.getBoundingClientRect();\n            const pos = {\n                x: this.realmousepos.x - br.x,\n                y: this.realmousepos.y - br.y\n            };\n\n            // Clear style and contents\n            this.tooltip_container.style = '';\n            this.tooltip_container.innerHTML = '';\n            this.tooltip_container.style.display = 'block';\n\n            // Invoke custom container\n            this.tooltip(this.tooltip_container);\n\n            // Make visible near mouse pointer\n            this.tooltip_container.style.top = pos.y + 'px';\n            this.tooltip_container.style.left = (pos.x + 20) + 'px';\n        } else {\n            this.tooltip_container.style.display = 'none';\n        }\n\n        if (this.sdfg.error) {\n            const error = this.sdfg.error;\n\n            let type = '';\n            let state_id = -1;\n            let el_id = -1;\n            if (error.isedge_id !== undefined) {\n                type = 'isedge';\n                el_id = error.isedge_id;\n            } else if (error.state_id !== undefined) {\n                state_id = error.state_id;\n                if (error.node_id !== undefined) {\n                    type = 'node';\n                    el_id = error.node_id;\n                } else if (error.edge_id !== undefined) {\n                    type = 'edge';\n                    el_id = error.edge_id;\n                } else {\n                    type = 'state';\n                }\n            } else {\n                return;\n            }\n            const offending_element = find_graph_element(\n                this.graph, type, error.sdfg_id, state_id, el_id\n            );\n            if (offending_element) {\n                this.zoom_to_view([offending_element]);\n                this.error_popover_container.style.display = 'block';\n                this.error_popover_container.style.bottom = '5%';\n                this.error_popover_container.style.left = '5%';\n                this.error_popover_text.innerText = error.message;\n            }\n        } else {\n            this.error_popover_container.style.display = 'none';\n        }\n    }\n\n    visible_elements() {\n        const curx = this.canvas_manager.mapPixelToCoordsX(0);\n        const cury = this.canvas_manager.mapPixelToCoordsY(0);\n        const endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);\n        const endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);\n        const curw = endx - curx;\n        const curh = endy - cury;\n        const elements = [];\n        this.do_for_intersected_elements(curx, cury, curw, curh, (type, e, obj) => {\n            const state_id = e.state ? Number(e.state) : -1;\n            let el_type = 'other';\n            if (type === 'nodes')\n                el_type = 'node';\n            else if (type === 'states')\n                el_type = 'state';\n            else if (type === 'edges')\n                el_type = 'edge';\n            else if (type === 'isedges')\n                el_type = 'isedge';\n            else if (type === 'connectors')\n                el_type = 'connector';\n            elements.push({\n                type: el_type,\n                sdfg_id: Number(e.sdfg_id),\n                state_id: state_id,\n                id: Number(e.id),\n            });\n        });\n        return elements;\n    }\n\n    // Returns a dictionary of SDFG elements in a given rectangle. Used for\n    // selection, rendering, localized transformations, etc.\n    // The output is a dictionary of lists of dictionaries. The top-level keys are:\n    // states, nodes, connectors, edges, isedges (interstate edges). For example:\n    // {'states': [{sdfg: sdfg_name, state: 1}, ...], nodes: [sdfg: sdfg_name, state: 1, node: 5],\n    //              edges: [], isedges: [], connectors: []}\n    elements_in_rect(x, y, w, h) {\n        const elements = {\n            states: [], nodes: [], connectors: [],\n            edges: [], isedges: []\n        };\n        this.do_for_intersected_elements(x, y, w, h, (type, e, obj) => {\n            e.obj = obj;\n            elements[type].push(e);\n        });\n        return elements;\n    }\n\n    do_for_intersected_elements(x, y, w, h, func) {\n        // Traverse nested SDFGs recursively\n        function traverse_recursive(g, sdfg_name, sdfg_id) {\n            g.nodes().forEach(state_id => {\n                const state = g.node(state_id);\n                if (!state) return;\n\n                if (state.intersect(x, y, w, h)) {\n                    // States\n                    func('states', { sdfg: sdfg_name, sdfg_id: sdfg_id, id: state_id }, state);\n\n                    if (state.data.state.attributes.is_collapsed)\n                        return;\n\n                    const ng = state.data.graph;\n                    if (!ng)\n                        return;\n                    ng.nodes().forEach(node_id => {\n                        const node = ng.node(node_id);\n                        if (node.intersect(x, y, w, h)) {\n                            // Selected nodes\n                            func('nodes', { sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, id: node_id }, node);\n\n                            // If nested SDFG, traverse recursively\n                            if (node.data.node.type === \"NestedSDFG\")\n                                traverse_recursive(node.data.graph,\n                                    node.data.node.attributes.sdfg.attributes.name,\n                                    node.data.node.attributes.sdfg.sdfg_list_id);\n                        }\n                        // Connectors\n                        node.in_connectors.forEach((c, i) => {\n                            if (c.intersect(x, y, w, h))\n                                func('connectors', {\n                                    sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, node: node_id,\n                                    connector: i, conntype: \"in\"\n                                }, c);\n                        });\n                        node.out_connectors.forEach((c, i) => {\n                            if (c.intersect(x, y, w, h))\n                                func('connectors', {\n                                    sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, node: node_id,\n                                    connector: i, conntype: \"out\"\n                                }, c);\n                        });\n                    });\n\n                    // Selected edges\n                    ng.edges().forEach(edge_id => {\n                        const edge = ng.edge(edge_id);\n                        if (edge.intersect(x, y, w, h)) {\n                            func('edges', { sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, id: edge.id }, edge);\n                        }\n                    });\n                }\n            });\n\n            // Selected inter-state edges\n            g.edges().forEach(isedge_id => {\n                const isedge = g.edge(isedge_id);\n                if (isedge.intersect(x, y, w, h)) {\n                    func('isedges', { sdfg: sdfg_name, sdfg_id: sdfg_id, id: isedge.id }, isedge);\n                }\n            });\n        }\n\n        // Start with top-level SDFG\n        traverse_recursive(this.graph, this.sdfg.attributes.name,\n            this.sdfg.sdfg_list_id);\n    }\n\n    for_all_sdfg_elements(func) {\n        // Traverse nested SDFGs recursively\n        function traverse_recursive(sdfg) {\n            sdfg.nodes.forEach((state, state_id) => {\n                // States\n                func('states', { sdfg: sdfg, id: state_id }, state);\n\n                state.nodes.forEach((node, node_id) => {\n                    // Nodes\n                    func('nodes', { sdfg: sdfg, state: state_id, id: node_id }, node);\n\n                    // If nested SDFG, traverse recursively\n                    if (node.type === \"NestedSDFG\")\n                        traverse_recursive(node.attributes.sdfg);\n                });\n\n                // Edges\n                state.edges.forEach((edge, edge_id) => {\n                    func('edges', { sdfg: sdfg, state: state_id, id: edge_id }, edge);\n                });\n            });\n\n            // Selected inter-state edges\n            sdfg.edges.forEach((isedge, isedge_id) => {\n                func('isedges', { sdfg: sdfg, id: isedge_id }, isedge);\n            });\n        }\n\n        // Start with top-level SDFG\n        traverse_recursive(this.sdfg);\n    }\n\n    for_all_elements(x, y, w, h, func) {\n        // Traverse nested SDFGs recursively\n        function traverse_recursive(g, sdfg_name) {\n            g.nodes().forEach(state_id => {\n                const state = g.node(state_id);\n                if (!state) return;\n\n                // States\n                func('states', { sdfg: sdfg_name, id: state_id, graph: g }, state, state.intersect(x, y, w, h));\n\n                if (state.data.state.attributes.is_collapsed)\n                    return;\n\n                const ng = state.data.graph;\n                if (!ng)\n                    return;\n                ng.nodes().forEach(node_id => {\n                    const node = ng.node(node_id);\n                    // Selected nodes\n                    func('nodes', { sdfg: sdfg_name, state: state_id, id: node_id, graph: ng }, node, node.intersect(x, y, w, h));\n\n                    // If nested SDFG, traverse recursively\n                    if (node.data.node.type === \"NestedSDFG\")\n                        traverse_recursive(node.data.graph, node.data.node.attributes.sdfg.attributes.name);\n\n                    // Connectors\n                    node.in_connectors.forEach((c, i) => {\n                        func('connectors', {\n                            sdfg: sdfg_name, state: state_id, node: node_id,\n                            connector: i, conntype: \"in\", graph: ng\n                        }, c, c.intersect(x, y, w, h));\n                    });\n                    node.out_connectors.forEach((c, i) => {\n                        func('connectors', {\n                            sdfg: sdfg_name, state: state_id, node: node_id,\n                            connector: i, conntype: \"out\", graph: ng\n                        }, c, c.intersect(x, y, w, h));\n                    });\n                });\n\n                // Selected edges\n                ng.edges().forEach(edge_id => {\n                    const edge = ng.edge(edge_id);\n                    func('edges', { sdfg: sdfg_name, state: state_id, id: edge.id, graph: ng }, edge, edge.intersect(x, y, w, h));\n                });\n            });\n\n            // Selected inter-state edges\n            g.edges().forEach(isedge_id => {\n                const isedge = g.edge(isedge_id);\n                func('isedges', { sdfg: sdfg_name, id: isedge.id, graph: g }, isedge, isedge.intersect(x, y, w, h));\n            });\n        }\n\n        // Start with top-level SDFG\n        traverse_recursive(this.graph, this.sdfg.attributes.name);\n    }\n\n    get_nested_memlet_tree(edge) {\n        for (const tree of this.all_memlet_trees)\n            if (tree.has(edge))\n                return tree;\n        return [];\n    }\n\n    find_elements_under_cursor(mouse_pos_x, mouse_pos_y) {\n        // Find all elements under the cursor.\n        const elements = this.elements_in_rect(mouse_pos_x, mouse_pos_y, 0, 0);\n        const clicked_states = elements.states;\n        const clicked_nodes = elements.nodes;\n        const clicked_edges = elements.edges;\n        const clicked_interstate_edges = elements.isedges;\n        const clicked_connectors = elements.connectors;\n        const total_elements =\n            clicked_states.length + clicked_nodes.length +\n            clicked_edges.length + clicked_interstate_edges.length +\n            clicked_connectors.length;\n        let foreground_elem = null, foreground_surface = -1;\n\n        // Find the top-most element under the mouse cursor (i.e. the one with\n        // the smallest dimensions).\n        const categories = [\n            clicked_states,\n            clicked_interstate_edges,\n            clicked_nodes,\n            clicked_edges\n        ];\n        for (const category of categories) {\n            for (let i = 0; i < category.length; i++) {\n                const s = category[i].obj.width * category[i].obj.height;\n                if (foreground_surface < 0 || s < foreground_surface) {\n                    foreground_surface = s;\n                    foreground_elem = category[i].obj;\n                }\n            }\n        }\n\n        return {\n            total_elements,\n            elements,\n            foreground_elem,\n        };\n    }\n\n    on_key_event(event) {\n        // Prevent handling of the event if the event is designed for something\n        // other than the body, like an input element.\n        if (event.target !== document.body)\n            return;\n\n        if (this.ctrl_key_selection && !event.ctrlKey)\n            this.selectmode_btn.onclick(event, false);\n\n        if (this.shift_key_movement && !event.shiftKey)\n            this.movemode_btn.onclick(event, false);\n\n        if (this.mouse_mode !== 'pan') {\n            if (event.key === 'Escape' && !event.ctrlKey && !event.shiftKey)\n                this.panmode_btn.onclick();\n            return;\n        } else if (event.key === 'Escape') {\n            if (this.selected_elements.length > 0) {\n                this.selected_elements.forEach(el => {\n                    el.selected = false;\n                });\n                this.selected_elements = [];\n                this.draw_async();\n            }\n        } else if (event.key === 'Delete' && event.type === 'keyup') {\n            if (this.selected_elements.length > 0)\n                this.remove_graph_nodes(this.selected_elements);\n            this.selected_elements = [];\n        }\n\n        if (event.ctrlKey && !event.shiftKey)\n            this.selectmode_btn.onclick(event, true);\n\n        if (event.shiftKey && !event.ctrlKey)\n            this.movemode_btn.onclick(event, true);\n\n        return true;\n    }\n\n    on_mouse_event(event, comp_x_func, comp_y_func, evtype = \"other\") {\n        if (this.ctrl_key_selection || this.shift_key_movement)\n            this.on_key_event(event);\n\n        let dirty = false; // Whether to redraw at the end\n        // Whether the set of visible or selected elements changed\n        let element_focus_changed = false;\n        // Whether the current multi-selection changed\n        let multi_selection_changed = false;\n\n        if (evtype === \"mousedown\" || evtype === \"touchstart\") {\n            this.drag_start = event;\n        } else if (evtype === \"mouseup\") {\n            this.drag_start = null;\n            this.last_dragged_element = null;\n        } else if (evtype === \"touchend\") {\n            if (event.touches.length == 0)\n                this.drag_start = null;\n            else\n                this.drag_start = event;\n        } else if (evtype === \"mousemove\") {\n            // Calculate the change in mouse position in canvas coordinates\n            const old_mousepos = this.mousepos;\n            this.mousepos = { x: comp_x_func(event), y: comp_y_func(event) };\n            this.realmousepos = { x: event.clientX, y: event.clientY };\n\n            // Only accept the primary mouse button as dragging source\n            if (this.drag_start && event.buttons & 1) {\n                this.dragging = true;\n\n                if (this.mouse_mode === 'move') {\n                    if (this.last_dragged_element) {\n                        this.canvas.style.cursor = 'grabbing';\n                        this.drag_start.cx = comp_x_func(this.drag_start);\n                        this.drag_start.cy = comp_y_func(this.drag_start);\n                        let elements_to_move = [this.last_dragged_element];\n                        if (this.selected_elements.includes(\n                                this.last_dragged_element\n                            ) && this.selected_elements.length > 1) {\n                            elements_to_move = this.selected_elements.filter(\n                                el => {\n                                    // Do not move connectors (individually)\n                                    if (el instanceof Connector)\n                                        return false;\n                                    let list_id = el.sdfg.sdfg_list_id;\n\n                                    // Do not move element individually if it is\n                                    // moved together with a nested SDFG\n                                    let nested_sdfg_parent =\n                                        this.state_parent_list[list_id];\n                                    if (nested_sdfg_parent &&\n                                        this.selected_elements.includes(\n                                            nested_sdfg_parent\n                                        ))\n                                        return false;\n\n                                    // Do not move element individually if it is\n                                    // moved together with its parent state\n                                    let state_parent =\n                                        this.sdfg_list[list_id].node(\n                                            el.parent_id\n                                        );\n                                    if (state_parent &&\n                                        this.selected_elements.includes(\n                                            state_parent\n                                        ))\n                                        return false;\n\n                                    // Otherwise move individually\n                                    return true;\n                                }\n                            );\n                        }\n\n                        let move_entire_edge = elements_to_move.length > 1;\n                        for (let el of elements_to_move) {\n                            this.canvas_manager.translate_element(\n                                el,\n                                old_mousepos, this.mousepos,\n                                this.graph, this.sdfg_list,\n                                this.state_parent_list,\n                                this.drag_start,\n                                true,\n                                move_entire_edge\n                            );\n                        }\n\n                        dirty = true;\n                        this.draw_async();\n                        return false;\n                    } else {\n                        const mouse_elements = this.find_elements_under_cursor(\n                            this.mousepos.x, this.mousepos.y\n                        );\n                        if (mouse_elements.foreground_elem) {\n                            this.last_dragged_element =\n                                mouse_elements.foreground_elem;\n                            this.canvas.style.cursor = 'grabbing';\n                            return false;\n                        }\n                        return true;\n                    }\n                } else if (this.mouse_mode === 'select') {\n                    this.box_select_rect = {\n                        x_start: comp_x_func(this.drag_start),\n                        y_start: comp_y_func(this.drag_start),\n                        x_end: this.mousepos.x,\n                        y_end: this.mousepos.y,\n                    };\n\n                    // Mark for redraw\n                    dirty = true;\n                } else {\n                    this.canvas_manager.translate(event.movementX,\n                        event.movementY);\n\n                    // Mark for redraw\n                    dirty = true;\n                }\n            } else if (this.drag_start && event.buttons & 4) {\n                // Pan the view with the middle mouse button\n                this.dragging = true;\n                this.canvas_manager.translate(event.movementX, event.movementY);\n                dirty = true;\n                element_focus_changed = true;\n            } else {\n                this.drag_start = null;\n                this.last_dragged_element = null;\n                if (event.buttons & 1 || event.buttons & 4)\n                    return true; // Don't stop propagation\n            }\n        } else if (evtype === \"touchmove\") {\n            if (this.drag_start.touches.length != event.touches.length) {\n                // Different number of touches, ignore and reset drag_start\n                this.drag_start = event;\n            } else if (event.touches.length == 1) { // Move/drag\n                this.canvas_manager.translate(event.touches[0].clientX - this.drag_start.touches[0].clientX,\n                    event.touches[0].clientY - this.drag_start.touches[0].clientY);\n                this.drag_start = event;\n\n                // Mark for redraw\n                dirty = true;\n                this.draw_async();\n                return false;\n            } else if (event.touches.length == 2) {\n                // Find relative distance between two touches before and after.\n                // Then, center and zoom to their midpoint.\n                const touch1 = this.drag_start.touches[0];\n                const touch2 = this.drag_start.touches[1];\n                let x1 = touch1.clientX, x2 = touch2.clientX;\n                let y1 = touch1.clientY, y2 = touch2.clientY;\n                const oldCenter = [(x1 + x2) / 2.0, (y1 + y2) / 2.0];\n                const initialDistance = Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);\n                x1 = event.touches[0].clientX; x2 = event.touches[1].clientX;\n                y1 = event.touches[0].clientY; y2 = event.touches[1].clientY;\n                const currentDistance = Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);\n                const newCenter = [(x1 + x2) / 2.0, (y1 + y2) / 2.0];\n\n                // First, translate according to movement of center point\n                this.canvas_manager.translate(newCenter[0] - oldCenter[0],\n                    newCenter[1] - oldCenter[1]);\n                // Then scale\n                this.canvas_manager.scale(currentDistance / initialDistance,\n                    newCenter[0], newCenter[1]);\n\n                this.drag_start = event;\n\n                // Mark for redraw\n                dirty = true;\n                this.draw_async();\n                return false;\n            }\n        } else if (evtype === \"wheel\") {\n            // Get physical x,y coordinates (rather than canvas coordinates)\n            const br = this.canvas.getBoundingClientRect();\n            const x = event.clientX - br.x;\n            const y = event.clientY - br.y;\n            this.canvas_manager.scale(event.deltaY > 0 ? 0.9 : 1.1, x, y);\n            dirty = true;\n            element_focus_changed = true;\n        }\n        // End of mouse-move/touch-based events\n\n        if (!this.mousepos)\n            return true;\n\n        // Find elements under cursor\n        const elements_under_cursor = this.find_elements_under_cursor(\n            this.mousepos.x, this.mousepos.y\n        );\n        const elements = elements_under_cursor.elements;\n        const total_elements = elements_under_cursor.total_elements;\n        const foreground_elem = elements_under_cursor.foreground_elem;\n\n        if (this.mouse_mode == 'add') {\n            let el = this.mouse_follow_element;\n            if (check_valid_add_position(\n                this.add_type, foreground_elem, this.add_mode_lib, this.mousepos\n            ))\n                el.firstElementChild.setAttribute('stroke', 'green');\n            else\n                el.firstElementChild.setAttribute('stroke', 'red');\n\n            el.style.left =\n                (event.layerX - el.firstElementChild.clientWidth / 2) + 'px';\n            el.style.top =\n                (event.layerY - el.firstElementChild.clientHeight / 2) + 'px';\n        }\n\n        // Change mouse cursor accordingly\n        if (this.mouse_mode === 'select') {\n            this.canvas.style.cursor = 'crosshair';\n        } else if (total_elements > 0) {\n            if (this.mouse_mode === 'move' && this.drag_start) {\n                this.canvas.style.cursor = 'grabbing';\n            } else if (this.mouse_mode === 'move') {\n                this.canvas.style.cursor = 'grab';\n            } else {\n                // Hovering over an element while not in any specific mode.\n                if ((foreground_elem.data.state &&\n                     foreground_elem.data.state.attributes.is_collapsed) ||\n                    (foreground_elem.data.node &&\n                     foreground_elem.data.node.attributes.is_collapsed)) {\n                    // This is a collapsed node or state, show with the cursor\n                    // shape that this can be expanded.\n                    this.canvas.style.cursor = 'alias';\n                } else {\n                    this.canvas.style.cursor = 'pointer';\n                }\n            }\n        } else {\n            this.canvas.style.cursor = 'auto';\n        }\n\n        this.tooltip = null;\n        this.last_hovered_elements = elements;\n\n        // De-highlight all elements.\n        this.for_all_elements(this.mousepos.x, this.mousepos.y, 0, 0, (type, e, obj, intersected) => {\n            obj.hovered = false;\n            obj.highlighted = false;\n        });\n        // Mark hovered and highlighted elements.\n        this.for_all_elements(this.mousepos.x, this.mousepos.y, 0, 0, (type, e, obj, intersected) => {\n            // Highlight all edges of the memlet tree\n            if (intersected && obj instanceof Edge && obj.parent_id != null) {\n                const tree = this.get_nested_memlet_tree(obj);\n                tree.forEach(te => {\n                    if (te != obj && te !== undefined) {\n                        te.highlighted = true;\n                    }\n                });\n            }\n\n            // Highlight all access nodes with the same name in the same nested sdfg\n            if (intersected && obj instanceof AccessNode) {\n                traverse_sdfg_scopes(this.sdfg_list[obj.sdfg.sdfg_list_id], (node) => {\n                    // If node is a state, then visit sub-scope\n                    if (node instanceof State) {\n                        return true;\n                    }\n                    if (node instanceof AccessNode && node.data.node.label === obj.data.node.label) {\n                        node.highlighted = true;\n                    }\n                    // No need to visit sub-scope\n                    return false;\n                });\n            }\n\n            // Highlight all access nodes with the same name as the hovered connector in the nested sdfg\n            if (intersected && obj instanceof Connector) {\n                const nested_graph = e.graph.node(obj.parent_id).data.graph;\n                if (nested_graph) {\n                    traverse_sdfg_scopes(nested_graph, (node) => {\n                        // If node is a state, then visit sub-scope\n                        if (node instanceof State) {\n                            return true;\n                        }\n                        if (node instanceof AccessNode && node.data.node.label === obj.label()) {\n                            node.highlighted = true;\n                        }\n                        // No need to visit sub-scope\n                        return false;\n                    });\n                }\n            }\n\n            if (intersected)\n                obj.hovered = true;\n        });\n\n        // If adding an edge, mark/highlight the first/from element, if it has\n        // already been selected.\n        if (this.mouse_mode === 'add' && this.add_type === 'Edge' &&\n            this.add_edge_start) {\n            this.add_edge_start.highlighted = true;\n        }\n\n        if (evtype === \"mousemove\") {\n            // TODO: Draw only if elements have changed\n            dirty = true;\n        }\n\n        if (evtype === \"dblclick\") {\n            const sdfg = (foreground_elem ? foreground_elem.sdfg : null);\n            let sdfg_elem = null;\n            if (foreground_elem instanceof State)\n                sdfg_elem = foreground_elem.data.state;\n            else if (foreground_elem instanceof SDFGNode) {\n                sdfg_elem = foreground_elem.data.node;\n\n                // If a scope exit node, use entry instead\n                if (sdfg_elem.type.endsWith(\"Exit\"))\n                    sdfg_elem = sdfg.nodes[foreground_elem.parent_id].nodes[sdfg_elem.scope_entry];\n            } else\n                sdfg_elem = null;\n\n            // Toggle collapsed state\n            if (sdfg_elem && 'is_collapsed' in sdfg_elem.attributes) {\n                sdfg_elem.attributes.is_collapsed = !sdfg_elem.attributes.is_collapsed;\n\n                this.send_new_sdfg_to_vscode();\n\n                // Re-layout SDFG\n                this.relayout();\n                dirty = true;\n                element_focus_changed = true;\n            }\n        }\n\n        let ends_drag = false;\n        if (evtype === 'click') {\n            if (this.dragging) {\n                // This click ends a drag.\n                this.dragging = false;\n                ends_drag = true;\n\n                element_focus_changed = true;\n\n                if (this.box_select_rect) {\n                    let elements_in_selection = [];\n                    let start_x = Math.min(this.box_select_rect.x_start,\n                        this.box_select_rect.x_end);\n                    let end_x = Math.max(this.box_select_rect.x_start,\n                        this.box_select_rect.x_end);\n                    let start_y = Math.min(this.box_select_rect.y_start,\n                        this.box_select_rect.y_end);\n                    let end_y = Math.max(this.box_select_rect.y_start,\n                        this.box_select_rect.y_end);\n                    let w = end_x - start_x;\n                    let h = end_y - start_y;\n                    this.do_for_intersected_elements(start_x, start_y, w, h,\n                        (type, e, obj) => {\n                            if (obj.contained_in(start_x, start_y, w, h))\n                                elements_in_selection.push(obj);\n                        });\n                    if (event.shiftKey && !this.ctrl_key_selection) {\n                        elements_in_selection.forEach((el) => {\n                            if (!this.selected_elements.includes(el))\n                                this.selected_elements.push(el);\n                        });\n                    } else if (event.ctrlKey && !this.ctrl_key_selection) {\n                        elements_in_selection.forEach((el) => {\n                            if (this.selected_elements.includes(el)) {\n                                this.selected_elements =\n                                    this.selected_elements.filter((val) => {\n                                        val.selected = false;\n                                        return val !== el;\n                                    });\n                            }\n                        });\n                    } else {\n                        this.selected_elements.forEach((el) => {\n                            el.selected = false;\n                        });\n                        this.selected_elements = elements_in_selection;\n                    }\n                    this.box_select_rect = null;\n                    dirty = true;\n                    element_focus_changed = true;\n                    multi_selection_changed = true;\n                }\n\n                if (this.mouse_mode === 'move')\n                    this.send_new_sdfg_to_vscode();\n            } else {\n                if (this.mouse_mode === 'add') {\n                    if (check_valid_add_position(\n                        this.add_type, foreground_elem, this.add_mode_lib,\n                        this.mousepos\n                    )) {\n                        if (this.add_type === 'Edge') {\n                            if (this.add_edge_start) {\n                                let start = this.add_edge_start;\n                                this.add_edge_start = undefined;\n                                this.add_node_to_graph(\n                                    this.add_type,\n                                    get_uuid_graph_element(foreground_elem),\n                                    get_uuid_graph_element(start)\n                                );\n                            } else {\n                                this.add_edge_start = foreground_elem;\n                                this.update_toggle_buttons();\n                            }\n                        } else if (this.add_type === 'LibraryNode') {\n                            this.add_position = this.mousepos;\n\n                            this.add_node_to_graph(\n                                this.add_type + '|' + this.add_mode_lib,\n                                get_uuid_graph_element(foreground_elem)\n                            );\n                        } else {\n                            this.add_position = this.mousepos;\n\n                            this.add_node_to_graph(\n                                this.add_type,\n                                get_uuid_graph_element(foreground_elem)\n                            );\n                        }\n\n                        if (!event.ctrlKey && !(this.add_type === 'Edge' &&\n                                                this.add_edge_start)) {\n                            // Cancel add mode.\n                            this.panmode_btn.onclick();\n                        }\n                    }\n                }\n\n                if (foreground_elem) {\n                    if (event.ctrlKey) {\n                        // Ctrl + click on an object, add it, or remove it from\n                        // the selection if it was previously in it.\n                        if (this.selected_elements.includes(foreground_elem)) {\n                            foreground_elem.selected = false;\n                            this.selected_elements =\n                                this.selected_elements.filter((el) => {\n                                    return el !== foreground_elem;\n                                });\n                        } else {\n                            this.selected_elements.push(foreground_elem);\n                        }\n\n                        // Indicate that the multi-selection changed.\n                        multi_selection_changed = true;\n                    } else if (event.shiftKey) {\n                        // TODO: Implement shift-clicks for path selection.\n                    } else {\n                        // Clicked an element, select it and nothing else.\n\n                        // If there was a multi-selection prior to this,\n                        // indicate that it changed.\n                        if (this.selected_elements.length > 1)\n                            multi_selection_changed = true;\n\n                        this.selected_elements.forEach((el) => {\n                            el.selected = false;\n                        });\n                        this.selected_elements = [foreground_elem];\n                    }\n                } else {\n                    // Clicked nothing, clear the selection.\n\n                    // If there was a multi-selection prior to this, indicate\n                    // that it changed.\n                    if (this.selected_elements.length > 1)\n                        multi_selection_changed = true;\n\n                    this.selected_elements.forEach((el) => {\n                        el.selected = false;\n                    });\n                    this.selected_elements = [];\n                }\n                dirty = true;\n                element_focus_changed = true;\n            }\n        }\n        this.selected_elements.forEach((el) => {\n            el.selected = true;\n        });\n\n        if (evtype === \"contextmenu\") {\n            if (this.mouse_mode == 'move') {\n                let elements_to_reset = [foreground_elem];\n                if (this.selected_elements.includes(foreground_elem))\n                    elements_to_reset = this.selected_elements;\n\n                let element_moved = false;\n                let relayout_necessary = false;\n                for (let el of elements_to_reset) {\n                    let position = get_positioning_info(el);\n                    if (el && !(el instanceof Connector) && position) {\n                        // Reset the position of the element (if it has been\n                        // manually moved)\n                        if (el instanceof Edge) {\n                            if (!position.points)\n                                continue;\n\n                            // Create inverted points to move it back\n                            let new_points = new Array(el.points.length);\n                            for (let j = 1; j < el.points.length - 1; j++) {\n                                new_points[j] = {\n                                    dx: - position.points[j].dx,\n                                    dy: - position.points[j].dy\n                                };\n                                // Reset the point movement\n                                position.points[j].dx = 0;\n                                position.points[j].dy = 0;\n                            }\n\n                            // Move it to original position\n                            this.canvas_manager.translate_element(\n                                el, { x: 0, y: 0 }, { x: 0, y: 0 }, this.graph,\n                                this.sdfg_list, this.state_parent_list,\n                                undefined, false, false, new_points\n                            );\n\n                            element_moved = true;\n                        } else {\n                            let new_x, new_y;\n                            if (!position.dx && !position.dy)\n                                continue;\n\n                            // Calculate original position with the relative\n                            // movement\n                            new_x = el.x - position.dx;\n                            new_y = el.y - position.dy;\n\n                            position.dx = 0;\n                            position.dy = 0;\n\n                            // Move it to original position\n                            this.canvas_manager.translate_element(\n                                el, { x: el.x, y: el.y },\n                                { x: new_x, y: new_y }, this.graph,\n                                this.sdfg_list, this.state_parent_list,\n                                undefined, false, false, undefined\n                            );\n\n                            element_moved = true;\n                        }\n\n                        if (el instanceof EntryNode) {\n                            // Also update scope position\n                            position.scope_dx = 0;\n                            position.scope_dy = 0;\n\n                            if (!el.data.node.attributes.is_collapsed)\n                                relayout_necessary = true;\n                        }\n                    }\n                }\n\n                if (relayout_necessary)\n                    this.relayout();\n\n                this.draw_async();\n\n                if (element_moved)\n                    this.send_new_sdfg_to_vscode();\n\n            } else if (this.mouse_mode == 'add') {\n                // Cancel add mode\n                this.panmode_btn.onclick();\n            }\n        }\n\n        let mouse_x = comp_x_func(event);\n        let mouse_y = comp_y_func(event);\n        if (this.external_mouse_handler)\n            dirty |= this.external_mouse_handler(evtype, event, { x: mouse_x, y: mouse_y }, elements,\n                this, this.selected_elements, ends_drag);\n\n        if (this.overlay_manager !== null) {\n            dirty |= this.overlay_manager.on_mouse_event(\n                evtype,\n                event,\n                { x: mouse_x, y: mouse_y },\n                elements,\n                foreground_elem,\n                ends_drag\n            );\n        }\n\n        if (dirty) {\n            this.draw_async();\n        }\n\n        if (element_focus_changed) {\n            // If a listener in VSCode is present, update it about the new\n            // viewport and tell it to re-sort the shown transformations.\n            try {\n                if (vscode)\n                    vscode_handle_event(\n                        'on_renderer_selection_changed',\n                        {\n                            multi_selection_changed: multi_selection_changed,\n                        }\n                    );\n            } catch (ex) {\n                // Do nothing\n            }\n        }\n\n        return false;\n    }\n}\n\n\nfunction calculateNodeSize(sdfg_state, node, ctx) {\n    const labelsize = ctx.measureText(node.label).width;\n    const inconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.in_connectors).length - LINEHEIGHT;\n    const outconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.out_connectors).length - LINEHEIGHT;\n    const maxwidth = Math.max(labelsize, inconnsize, outconnsize);\n    let maxheight = 2 * LINEHEIGHT;\n    maxheight += 4 * LINEHEIGHT;\n\n    const size = { width: maxwidth, height: maxheight }\n\n    // add something to the size based on the shape of the node\n    if (node.type === \"AccessNode\") {\n        size.height -= 4 * LINEHEIGHT;\n        size.width += size.height;\n    }\n    else if (node.type.endsWith(\"Entry\")) {\n        size.width += 2.0 * size.height;\n        size.height /= 1.75;\n    }\n    else if (node.type.endsWith(\"Exit\")) {\n        size.width += 2.0 * size.height;\n        size.height /= 1.75;\n    }\n    else if (node.type === \"Tasklet\") {\n        size.width += 2.0 * (size.height / 3.0);\n        size.height /= 1.75;\n    }\n    else if (node.type === \"LibraryNode\") {\n        size.width += 2.0 * (size.height / 3.0);\n        size.height /= 1.75;\n    }\n    else if (node.type === \"Reduce\") {\n        size.height -= 4 * LINEHEIGHT;\n        size.width *= 2;\n        size.height = size.width / 3.0;\n    }\n    else {\n    }\n\n    return size;\n}\n\n// Layout SDFG elements (states, nodes, scopes, nested SDFGs)\nfunction relayout_sdfg(ctx, sdfg, sdfg_list, state_parent_list, omit_access_nodes) {\n    const STATE_MARGIN = 4 * LINEHEIGHT;\n\n    // Layout the SDFG as a dagre graph\n    const g = new dagre.graphlib.Graph();\n    g.setGraph({});\n    g.setDefaultEdgeLabel((u, v) => { return {}; });\n\n    // layout each state to get its size\n    sdfg.nodes.forEach((state) => {\n        let stateinfo = {};\n\n        stateinfo.label = state.id;\n        let state_g = null;\n        if (state.attributes.is_collapsed) {\n            stateinfo.width = ctx.measureText(stateinfo.label).width;\n            stateinfo.height = LINEHEIGHT;\n        }\n        else {\n            state_g = relayout_state(ctx, state, sdfg, sdfg_list,\n                state_parent_list, omit_access_nodes);\n            stateinfo = calculateBoundingBox(state_g);\n        }\n        stateinfo.width += 2 * STATE_MARGIN;\n        stateinfo.height += 2 * STATE_MARGIN;\n        g.setNode(state.id, new State({\n            state: state,\n            layout: stateinfo,\n            graph: state_g\n        }, state.id, sdfg));\n    });\n\n    sdfg.edges.forEach((edge, id) => {\n        g.setEdge(edge.src, edge.dst, new Edge(edge.attributes.data, id, sdfg));\n    });\n\n    dagre.layout(g);\n\n    // Annotate the sdfg with its layout info\n    sdfg.nodes.forEach((state) => {\n        const gnode = g.node(state.id);\n        state.attributes.layout = {};\n        state.attributes.layout.x = gnode.x;\n        state.attributes.layout.y = gnode.y;\n        state.attributes.layout.width = gnode.width;\n        state.attributes.layout.height = gnode.height;\n    });\n\n    sdfg.edges.forEach((edge) => {\n        const gedge = g.edge(edge.src, edge.dst);\n        const bb = calculateEdgeBoundingBox(gedge);\n        // Convert from top-left to center\n        bb.x += bb.width / 2.0;\n        bb.y += bb.height / 2.0;\n\n        gedge.x = bb.x;\n        gedge.y = bb.y;\n        gedge.width = bb.width;\n        gedge.height = bb.height;\n        edge.attributes.layout = {};\n        edge.attributes.layout.width = bb.width;\n        edge.attributes.layout.height = bb.height;\n        edge.attributes.layout.x = bb.x;\n        edge.attributes.layout.y = bb.y;\n        edge.attributes.layout.points = gedge.points;\n    });\n\n    // Offset node and edge locations to be in state margins\n    sdfg.nodes.forEach((s, sid) => {\n        if (s.attributes.is_collapsed)\n            return;\n\n        const state = g.node(sid);\n        const topleft = state.topleft();\n        offset_state(s, state, {\n            x: topleft.x + STATE_MARGIN,\n            y: topleft.y + STATE_MARGIN\n        });\n    });\n\n    const bb = calculateBoundingBox(g);\n    g.width = bb.width;\n    g.height = bb.height;\n\n    // Add SDFG to global store\n    sdfg_list[sdfg.sdfg_list_id] = g;\n\n    return g;\n}\n\nfunction relayout_state(ctx, sdfg_state, sdfg, sdfg_list, state_parent_list, omit_access_nodes) {\n    // layout the state as a dagre graph\n    const g = new dagre.graphlib.Graph({ multigraph: true });\n\n    // Set layout options and a simpler algorithm for large graphs\n    const layout_options = { ranksep: 30 };\n    if (sdfg_state.nodes.length >= 1000)\n        layout_options.ranker = 'longest-path';\n\n    g.setGraph(layout_options);\n\n\n    // Set an object for the graph label\n    g.setDefaultEdgeLabel((u, v) => { return {}; });\n\n    // Add nodes to the graph. The first argument is the node id. The\n    // second is metadata about the node (label, width, height),\n    // which will be updated by dagre.layout (will add x,y).\n\n    // Process nodes hierarchically\n    let toplevel_nodes = sdfg_state.scope_dict[-1];\n    if (toplevel_nodes === undefined)\n        toplevel_nodes = Object.keys(sdfg_state.nodes);\n    const drawn_nodes = new Set();\n    const hidden_nodes = new Map();\n\n    function layout_node(node) {\n        if (omit_access_nodes && node.type == \"AccessNode\") {\n            // add access node to hidden nodes; source and destinations will be set later\n            hidden_nodes.set(node.id.toString(), { node: node, src: null, dsts: [] });\n            return;\n        }\n\n        let nested_g = null;\n        node.attributes.layout = {};\n\n        // Set connectors prior to computing node size\n        node.attributes.layout.in_connectors = node.attributes.in_connectors;\n        if ('is_collapsed' in node.attributes && node.attributes.is_collapsed && node.type !== \"NestedSDFG\")\n            node.attributes.layout.out_connectors = find_exit_for_entry(sdfg_state.nodes, node).attributes.out_connectors;\n        else\n            node.attributes.layout.out_connectors = node.attributes.out_connectors;\n\n        const nodesize = calculateNodeSize(sdfg_state, node, ctx);\n        node.attributes.layout.width = nodesize.width;\n        node.attributes.layout.height = nodesize.height;\n        node.attributes.layout.label = node.label;\n\n        // Recursively lay out nested SDFGs\n        if (node.type === \"NestedSDFG\") {\n            nested_g = relayout_sdfg(ctx, node.attributes.sdfg, sdfg_list, state_parent_list, omit_access_nodes);\n            const sdfginfo = calculateBoundingBox(nested_g);\n            node.attributes.layout.width = sdfginfo.width + 2 * LINEHEIGHT;\n            node.attributes.layout.height = sdfginfo.height + 2 * LINEHEIGHT;\n        }\n\n        // Dynamically create node type\n        const obj = new SDFGElements[node.type]({ node: node, graph: nested_g }, node.id, sdfg, sdfg_state.id);\n\n        // If it's a nested SDFG, we need to record the node as all of its\n        // state's parent node\n        if (node.type === 'NestedSDFG')\n            state_parent_list[node.attributes.sdfg.sdfg_list_id] = obj;\n\n        // Add input connectors\n        let i = 0;\n        let conns;\n        if (Array.isArray(node.attributes.layout.in_connectors))\n            conns = node.attributes.layout.in_connectors;\n        else\n            conns = Object.keys(node.attributes.layout.in_connectors);\n        for (const cname of conns) {\n            const conn = new Connector({ name: cname }, i, sdfg, node.id);\n            obj.in_connectors.push(conn);\n            i += 1;\n        }\n\n        // Add output connectors -- if collapsed, uses exit node connectors\n        i = 0;\n        if (Array.isArray(node.attributes.layout.out_connectors))\n            conns = node.attributes.layout.out_connectors;\n        else\n            conns = Object.keys(node.attributes.layout.out_connectors);\n        for (const cname of conns) {\n            const conn = new Connector({ name: cname }, i, sdfg, node.id);\n            obj.out_connectors.push(conn);\n            i += 1;\n        }\n\n        g.setNode(node.id, obj);\n        drawn_nodes.add(node.id.toString());\n\n        // Recursively draw nodes\n        if (node.id in sdfg_state.scope_dict) {\n            if (node.attributes.is_collapsed)\n                return;\n            sdfg_state.scope_dict[node.id].forEach((nodeid) => {\n                const node = sdfg_state.nodes[nodeid];\n                layout_node(node);\n            });\n        }\n    }\n\n\n    toplevel_nodes.forEach((nodeid) => {\n        const node = sdfg_state.nodes[nodeid];\n        layout_node(node);\n    });\n\n    // add info to calculate shortcut edges\n    function add_edge_info_if_hidden(edge) {\n        const hidden_src = hidden_nodes.get(edge.src);\n        const hidden_dst = hidden_nodes.get(edge.dst);\n\n        if (hidden_src && hidden_dst) {\n            // if we have edges from an AccessNode to an AccessNode then just connect destinations\n            hidden_src.dsts = hidden_dst.dsts;\n            edge.attributes.data.attributes.shortcut = false;\n        } else if (hidden_src) {\n            // if edge starts at hidden node, then add it as destination\n            hidden_src.dsts.push(edge);\n            edge.attributes.data.attributes.shortcut = false;\n            return true;\n        } else if (hidden_dst) {\n            // if edge ends at hidden node, then add it as source\n            hidden_dst.src = edge;\n            edge.attributes.data.attributes.shortcut = false;\n            return true;\n        }\n\n        // if it is a shortcut edge, but we don't omit access nodes, then ignore this edge\n        if (!omit_access_nodes && edge.attributes.data.attributes.shortcut) return true;\n\n        return false;\n    }\n\n    sdfg_state.edges.forEach((edge, id) => {\n        if (add_edge_info_if_hidden(edge)) return;\n        edge = check_and_redirect_edge(edge, drawn_nodes, sdfg_state);\n        if (!edge) return;\n        const e = new Edge(edge.attributes.data, id, sdfg, sdfg_state.id);\n        edge.attributes.data.edge = e;\n        e.src_connector = edge.src_connector;\n        e.dst_connector = edge.dst_connector;\n        g.setEdge(edge.src, edge.dst, e, id);\n    });\n\n    hidden_nodes.forEach(hidden_node => {\n        if (hidden_node.src) {\n            hidden_node.dsts.forEach(e => {\n                // create shortcut edge with new destination\n                const tmp_edge = e.attributes.data.edge;\n                e.attributes.data.edge = null;\n                const shortcut_e = deepCopy(e);\n                e.attributes.data.edge = tmp_edge;\n                shortcut_e.src = hidden_node.src.src;\n                shortcut_e.src_connector = hidden_node.src.src_connector;\n                shortcut_e.dst_connector = e.dst_connector;\n                // attribute that only shortcut edges have; if it is explicitly false, then edge is ignored in omit access node mode\n                shortcut_e.attributes.data.attributes.shortcut = true;\n\n                // draw the redirected edge\n                const redirected_e = check_and_redirect_edge(shortcut_e, drawn_nodes, sdfg_state);\n                if (!redirected_e) return;\n\n                // abort if shortcut edge already exists\n                const edges = g.outEdges(redirected_e.src);\n                for (const oe of edges) {\n                    if (oe.w == e.dst && sdfg_state.edges[oe.name].dst_connector == e.dst_connector) {\n                        return;\n                    }\n                }\n\n                // add shortcut edge (redirection is not done in this list)\n                sdfg_state.edges.push(shortcut_e);\n\n                // add redirected shortcut edge to graph\n                const edge_id = sdfg_state.edges.length - 1;\n                const shortcut_edge = new Edge(deepCopy(redirected_e.attributes.data), edge_id, sdfg, sdfg_state.id);\n                shortcut_edge.src_connector = redirected_e.src_connector;\n                shortcut_edge.dst_connector = redirected_e.dst_connector;\n                shortcut_edge.data.attributes.shortcut = true;\n\n                g.setEdge(redirected_e.src, redirected_e.dst, shortcut_edge, edge_id);\n            });\n        }\n    });\n\n    dagre.layout(g);\n\n\n    // Layout connectors and nested SDFGs\n    sdfg_state.nodes.forEach((node, id) => {\n        const gnode = g.node(id);\n        if (!gnode || (omit_access_nodes && gnode instanceof AccessNode)) {\n            // ignore nodes that should not be drawn\n            return;\n        }\n        const topleft = gnode.topleft();\n\n        // Offset nested SDFG\n        if (node.type === \"NestedSDFG\") {\n\n            offset_sdfg(node.attributes.sdfg, gnode.data.graph, {\n                x: topleft.x + LINEHEIGHT,\n                y: topleft.y + LINEHEIGHT\n            });\n        }\n        // Connector management \n        const SPACING = LINEHEIGHT;\n        const iconn_length = (LINEHEIGHT + SPACING) * Object.keys(node.attributes.layout.in_connectors).length - SPACING;\n        const oconn_length = (LINEHEIGHT + SPACING) * Object.keys(node.attributes.layout.out_connectors).length - SPACING;\n        let iconn_x = gnode.x - iconn_length / 2.0 + LINEHEIGHT / 2.0;\n        let oconn_x = gnode.x - oconn_length / 2.0 + LINEHEIGHT / 2.0;\n\n        for (const c of gnode.in_connectors) {\n            c.width = LINEHEIGHT;\n            c.height = LINEHEIGHT;\n            c.x = iconn_x;\n            iconn_x += LINEHEIGHT + SPACING;\n            c.y = topleft.y;\n        }\n        for (const c of gnode.out_connectors) {\n            c.width = LINEHEIGHT;\n            c.height = LINEHEIGHT;\n            c.x = oconn_x;\n            oconn_x += LINEHEIGHT + SPACING;\n            c.y = topleft.y + gnode.height;\n        }\n    });\n\n    sdfg_state.edges.forEach((edge, id) => {\n        edge = check_and_redirect_edge(edge, drawn_nodes, sdfg_state);\n        if (!edge) return;\n        const gedge = g.edge(edge.src, edge.dst, id);\n        if (!gedge || (omit_access_nodes && gedge.data.attributes.shortcut === false\n            || !omit_access_nodes && gedge.data.attributes.shortcut)) {\n            // if access nodes omitted, don't draw non-shortcut edges and vice versa\n            return;\n        }\n\n        // Reposition first and last points according to connectors\n        let src_conn = null, dst_conn = null;\n        if (edge.src_connector) {\n            const src_node = g.node(edge.src);\n            let cindex = -1;\n            for (let i = 0; i < src_node.out_connectors.length; i++) {\n                if (src_node.out_connectors[i].data.name == edge.src_connector) {\n                    cindex = i;\n                    break;\n                }\n            }\n            if (cindex >= 0) {\n                gedge.points[0].x = src_node.out_connectors[cindex].x;\n                gedge.points[0].y = src_node.out_connectors[cindex].y;\n                src_conn = src_node.out_connectors[cindex];\n            }\n        }\n        if (edge.dst_connector) {\n            const dst_node = g.node(edge.dst);\n            let cindex = -1;\n            for (let i = 0; i < dst_node.in_connectors.length; i++) {\n                if (dst_node.in_connectors[i].data.name == edge.dst_connector) {\n                    cindex = i;\n                    break;\n                }\n            }\n            if (cindex >= 0) {\n                gedge.points[gedge.points.length - 1].x = dst_node.in_connectors[cindex].x;\n                gedge.points[gedge.points.length - 1].y = dst_node.in_connectors[cindex].y;\n                dst_conn = dst_node.in_connectors[cindex];\n            }\n        }\n\n        const n = gedge.points.length - 1;\n        if (src_conn !== null)\n            gedge.points[0] = intersectRect(src_conn, gedge.points[n]);\n        if (dst_conn !== null)\n            gedge.points[n] = intersectRect(dst_conn, gedge.points[0]);\n\n        if (gedge.points.length == 3 && gedge.points[0].x == gedge.points[n].x)\n            gedge.points = [gedge.points[0], gedge.points[n]];\n\n        const bb = calculateEdgeBoundingBox(gedge);\n        // Convert from top-left to center\n        bb.x += bb.width / 2.0;\n        bb.y += bb.height / 2.0;\n\n        edge.width = bb.width;\n        edge.height = bb.height;\n        edge.x = bb.x;\n        edge.y = bb.y;\n        gedge.width = bb.width;\n        gedge.height = bb.height;\n        gedge.x = bb.x;\n        gedge.y = bb.y;\n    });\n\n    return g;\n}\n\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { sdfg_range_elem_to_string } from '../utils/sdfg/display';\nimport { sdfg_property_to_string } from \"../utils/sdfg/display\";\nimport { check_and_redirect_edge } from \"../utils/sdfg/sdfg_utils\";\n\nexport class SDFGElement {\n    // Parent ID is the state ID, if relevant\n    constructor(elem, elem_id, sdfg, parent_id = null) {\n        this.data = elem;\n        this.id = elem_id;\n        this.parent_id = parent_id;\n        this.sdfg = sdfg;\n        this.in_connectors = [];\n        this.out_connectors = [];\n\n        // Indicate special drawing conditions based on interactions.\n        this.selected = false;\n        this.highlighted = false;\n        this.hovered = false;\n\n        this.set_layout();\n    }\n\n    set_layout() {\n        // dagre does not work well with properties, only fields\n        this.width = this.data.layout.width;\n        this.height = this.data.layout.height;\n    }\n\n    draw(renderer, ctx, mousepos) { }\n\n    shade(renderer, ctx, color, alpha = '0.6') { }\n\n    debug_draw(renderer, ctx) {\n        if (renderer.debug_draw) {\n            // Print the center and bounding box in debug mode.\n            ctx.beginPath();\n            ctx.arc(this.x, this.y, 1, 0, 2 * Math.PI, false);\n            ctx.fillStyle = 'red';\n            ctx.fill();\n            ctx.strokeStyle = 'red';\n            ctx.stroke();\n            ctx.strokeRect(this.x - (this.width / 2.0), this.y - (this.height / 2.0),\n                this.width, this.height);\n        }\n    }\n\n    attributes() {\n        return this.data.attributes;\n    }\n\n    type() {\n        return this.data.type;\n    }\n\n    label() {\n        return this.data.label;\n    }\n\n    long_label() {\n        return this.label();\n    }\n\n    // Produces HTML for a hover-tooltip\n    tooltip(container) {\n        container.className = 'sdfvtooltip';\n    }\n\n    topleft() {\n        return { x: this.x - this.width / 2, y: this.y - this.height / 2 };\n    }\n\n    strokeStyle(renderer = undefined) {\n        if (this.selected) {\n            if (this.hovered)\n                return this.getCssProperty(renderer, '--color-selected-hovered');\n            else if (this.highlighted)\n                return this.getCssProperty(renderer, '--color-selected-highlighted');\n            else\n                return this.getCssProperty(renderer, '--color-selected');\n        } else {\n            if (this.hovered)\n                return this.getCssProperty(renderer, '--color-hovered');\n            else if (this.highlighted)\n                return this.getCssProperty(renderer, '--color-highlighted');\n        }\n        return this.getCssProperty(renderer, '--color-default');\n    }\n\n    // General bounding-box intersection function. Returns true iff point or rectangle intersect element.\n    intersect(x, y, w = 0, h = 0) {\n        if (w == 0 || h == 0) {  // Point-element intersection\n            return (x >= this.x - this.width / 2.0) &&\n                (x <= this.x + this.width / 2.0) &&\n                (y >= this.y - this.height / 2.0) &&\n                (y <= this.y + this.height / 2.0);\n        } else {                 // Box-element intersection\n            return (x <= this.x + this.width / 2.0) &&\n                (x + w >= this.x - this.width / 2.0) &&\n                (y <= this.y + this.height / 2.0) &&\n                (y + h >= this.y - this.height / 2.0);\n        }\n    }\n\n    contained_in(x, y, w = 0, h = 0) {\n        if (w === 0 || h === 0)\n            return false;\n\n        const box_start_x = x;\n        const box_end_x = x + w;\n        const box_start_y = y;\n        const box_end_y = y + h;\n\n        const el_start_x = this.x - (this.width / 2.0);\n        const el_end_x = this.x + (this.width / 2.0);\n        const el_start_y = this.y - (this.height / 2.0);\n        const el_end_y = this.y + (this.height / 2.0);\n\n        return box_start_x <= el_start_x &&\n            box_end_x >= el_end_x &&\n            box_start_y <= el_start_y &&\n            box_end_y >= el_end_y;\n    }\n\n    getCssProperty(renderer, propertyName) {\n        return window.getComputedStyle(renderer.canvas).getPropertyValue(propertyName).trim();\n    }\n}\n\n// SDFG as an element (to support properties)\nexport class SDFG extends SDFGElement {\n    constructor(sdfg) {\n        super(sdfg, -1, sdfg);\n    }\n\n    set_layout() {\n    }\n\n    label() {\n        return this.data.attributes.name;\n    }\n}\n\nexport class State extends SDFGElement {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        const visible_rect = renderer.visible_rect;\n        let clamped = {\n            x: Math.max(topleft.x, visible_rect.x),\n            y: Math.max(topleft.y, visible_rect.y),\n            x2: Math.min(topleft.x + this.width,\n                visible_rect.x + visible_rect.w),\n            y2: Math.min(topleft.y + this.height,\n                visible_rect.y + visible_rect.h)\n        };\n        clamped.w = clamped.x2 - clamped.x;\n        clamped.h = clamped.y2 - clamped.y;\n        if (!ctx.lod)\n            clamped = {\n                x: topleft.x, y: topleft.y,\n                w: this.width, h: this.height\n            };\n\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-background-color');\n        ctx.fillRect(clamped.x, clamped.y, clamped.w, clamped.h);\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-foreground-color');\n\n        if (visible_rect.x <= topleft.x && visible_rect.y <= topleft.y + LINEHEIGHT)\n            ctx.fillText(this.label(), topleft.x, topleft.y + LINEHEIGHT);\n\n        // If this state is selected or hovered\n        if ((this.selected || this.highlighted || this.hovered) &&\n            (clamped.x === topleft.x ||\n                clamped.y === topleft.y ||\n                clamped.x2 === topleft.x + this.width ||\n                clamped.y2 === topleft.y + this.height)) {\n            ctx.strokeStyle = this.strokeStyle(renderer);\n            ctx.strokeRect(clamped.x, clamped.y, clamped.w, clamped.h);\n        }\n\n        // If collapsed, draw a \"+\" sign in the middle\n        if (this.data.state.attributes.is_collapsed) {\n            ctx.beginPath();\n            ctx.moveTo(this.x, this.y - LINEHEIGHT);\n            ctx.lineTo(this.x, this.y + LINEHEIGHT);\n            ctx.stroke();\n            ctx.beginPath();\n            ctx.moveTo(this.x - LINEHEIGHT, this.y);\n            ctx.lineTo(this.x + LINEHEIGHT, this.y);\n            ctx.stroke();\n        }\n\n        ctx.strokeStyle = \"black\";\n    }\n\n    simple_draw(renderer, ctx, mousepos) {\n        // Fast drawing function for small states\n        const topleft = this.topleft();\n\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-background-color');\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.fillStyle = this.getCssProperty(renderer, '--state-text-color');\n\n        if (mousepos && this.intersect(mousepos.x, mousepos.y))\n            renderer.tooltip = (c) => this.tooltip(c);\n        // Draw state name in center without contents (does not look good)\n        /*\n        let FONTSIZE = Math.min(renderer.canvas_manager.points_per_pixel() * 16, 100);\n        let label = this.label();\n\n        let oldfont = ctx.font;\n        ctx.font = FONTSIZE + \"px Arial\";\n\n        let textmetrics = ctx.measureText(label);\n        ctx.fillText(label, this.x - textmetrics.width / 2.0, this.y - this.height / 6.0 + FONTSIZE / 2.0);\n\n        ctx.font = oldfont;\n        */\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    tooltip(container) {\n        container.innerText = 'State: ' + this.label();\n    }\n\n    attributes() {\n        return this.data.state.attributes;\n    }\n\n    label() {\n        return this.data.state.label;\n    }\n\n    type() {\n        return this.data.state.type;\n    }\n}\n\nexport class SDFGNode extends SDFGElement {\n    draw(renderer, ctx, mousepos, fgstyle = '--node-foreground-color', bgstyle = '--node-background-color') {\n        const topleft = this.topleft();\n        ctx.fillStyle = this.getCssProperty(renderer, bgstyle);\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        ctx.strokeRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.fillStyle = this.getCssProperty(renderer, fgstyle);\n        const textw = ctx.measureText(this.label()).width;\n        ctx.fillText(this.label(), this.x - textw / 2, this.y + LINEHEIGHT / 4);\n    }\n\n    simple_draw(renderer, ctx, mousepos) {\n        // Fast drawing function for small nodes\n        const topleft = this.topleft();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    label() {\n        return this.data.node.label;\n    }\n\n    attributes() {\n        return this.data.node.attributes;\n    }\n\n    type() {\n        return this.data.node.type;\n    }\n\n    set_layout() {\n        this.width = this.data.node.attributes.layout.width;\n        this.height = this.data.node.attributes.layout.height;\n    }\n}\n\nexport class Edge extends SDFGElement {\n\n    create_arrow_line(ctx) {\n        ctx.beginPath();\n        ctx.moveTo(this.points[0].x, this.points[0].y);\n        if (this.points.length === 2) {\n            // Straight line can be drawn\n            ctx.lineTo(this.points[1].x, this.points[1].y);\n        } else {\n            let i;\n            for (i = 1; i < this.points.length - 2; i++) {\n                const xm = (this.points[i].x + this.points[i + 1].x) / 2.0;\n                const ym = (this.points[i].y + this.points[i + 1].y) / 2.0;\n                ctx.quadraticCurveTo(this.points[i].x, this.points[i].y, xm, ym);\n            }\n            ctx.quadraticCurveTo(this.points[i].x, this.points[i].y,\n                this.points[i + 1].x, this.points[i + 1].y);\n        }\n    }\n\n    draw(renderer, ctx, mousepos) {\n        const edge = this;\n\n        this.create_arrow_line(ctx);\n\n        let style = this.strokeStyle(renderer);\n        if (this.hovered)\n            renderer.tooltip = (c) => this.tooltip(c, renderer);\n        if (this.parent_id == null && style === this.getCssProperty(renderer, '--color-default')) {  // Interstate edge\n            style = this.getCssProperty(renderer, '--interstate-edge-color');\n        }\n        ctx.fillStyle = ctx.strokeStyle = style;\n\n        // CR edges have dashed lines\n        if (this.parent_id != null && this.data.attributes.wcr != null)\n            ctx.setLineDash([2, 2]);\n        else\n            ctx.setLineDash([1, 0]);\n\n        ctx.stroke();\n\n        ctx.setLineDash([1, 0]);\n\n        if (edge.points.length < 2)\n            return;\n\n\n        // Show anchor points for moving\n        if (this.selected && renderer.mouse_mode === 'move') {\n            let i;\n            for (i = 1; i < this.points.length - 1; i++)\n                ctx.strokeRect(this.points[i].x - 5, this.points[i].y - 5, 8, 8);\n        }\n\n        drawArrow(ctx, edge.points[edge.points.length - 2], edge.points[edge.points.length - 1], 3);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        this.create_arrow_line(ctx);\n\n        // Save current style properties.\n        const orig_stroke_style = ctx.strokeStyle;\n        const orig_fill_style = ctx.fillStyle;\n        const orig_line_cap = ctx.lineCap;\n        const orig_line_width = ctx.lineWidth;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.lineWidth = orig_line_width + 1;\n        ctx.fillStyle = color;\n        ctx.strokeStyle = color;\n        ctx.lineCap = 'round';\n\n        ctx.stroke();\n\n        if (this.points.length < 2)\n            return;\n        drawArrow(ctx, this.points[this.points.length - 2],\n            this.points[this.points.length - 1], 3, 0, 2);\n\n        // Restore previous stroke style, width, and opacity.\n        ctx.strokeStyle = orig_stroke_style;\n        ctx.fillStyle = orig_fill_style;\n        ctx.lineCap = orig_line_cap;\n        ctx.lineWidth = orig_line_width;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    tooltip(container, renderer) {\n        super.tooltip(container);\n        const dsettings = renderer.view_settings();\n        const attr = this.attributes();\n        // Memlet\n        if (attr.subset !== undefined) {\n            if (attr.subset === null) {  // Empty memlet\n                container.style.display = 'none';\n                return;\n            }\n            let contents = attr.data;\n            contents += sdfg_property_to_string(attr.subset, dsettings);\n\n            if (attr.other_subset)\n                contents += ' -> ' + sdfg_property_to_string(attr.other_subset, dsettings);\n\n            if (attr.wcr)\n                contents += '<br /><b>CR: ' + sdfg_property_to_string(attr.wcr, dsettings) + '</b>';\n\n            let num_accesses = null;\n            if (attr.volume)\n                num_accesses = sdfg_property_to_string(attr.volume, dsettings);\n            else\n                num_accesses = sdfg_property_to_string(attr.num_accesses, dsettings);\n\n            if (attr.dynamic) {\n                if (num_accesses == 0 || num_accesses == -1)\n                    num_accesses = \"<b>Dynamic (unbounded)</b>\";\n                else\n                    num_accesses = \"<b>Dynamic</b> (up to \" + num_accesses + \")\";\n            } else if (num_accesses == -1) {\n                num_accesses = \"<b>Dynamic (unbounded)</b>\";\n            }\n\n            contents += '<br /><font style=\"font-size: 14px\">Volume: ' + num_accesses + '</font>';\n            container.innerHTML = contents;\n        } else {  // Interstate edge\n            container.classList.add('sdfvtooltip--interstate-edge');\n            container.innerText = this.label();\n            if (!this.label())\n                container.style.display = 'none';\n        }\n    }\n\n    set_layout() {\n        // NOTE: Setting this.width/height will disrupt dagre in self-edges\n    }\n\n    label() {\n        // Memlet\n        if (this.data.attributes.subset !== undefined)\n            return \"\";\n        return super.label();\n    }\n\n    intersect(x, y, w = 0, h = 0) {\n        // First, check bounding box\n        if (!super.intersect(x, y, w, h))\n            return false;\n\n        // Then (if point), check distance from line\n        if (w == 0 || h == 0) {\n            for (let i = 0; i < this.points.length - 1; i++) {\n                const dist = ptLineDistance({ x: x, y: y }, this.points[i], this.points[i + 1]);\n                if (dist <= 5.0)\n                    return true;\n            }\n            return false;\n        }\n        return true;\n    }\n}\n\nexport class Connector extends SDFGElement {\n    draw(renderer, ctx, mousepos) {\n        const scope_connector = (this.data.name.startsWith(\"IN_\") || this.data.name.startsWith(\"OUT_\"));\n        const topleft = this.topleft();\n        ctx.beginPath();\n        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n        ctx.closePath();\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        let fillColor;\n        if (scope_connector) {\n            let cname = this.data.name;\n            if (cname.startsWith(\"IN_\"))\n                cname = cname.substring(3);\n            else\n                cname = cname.substring(4);\n\n            ctx.lineWidth = 0.4;\n            ctx.stroke();\n            ctx.lineWidth = 1.0;\n            fillColor = this.getCssProperty(renderer, '--connector-scoped-color');\n        } else {\n            ctx.stroke();\n            fillColor = this.getCssProperty(renderer, '--connector-unscoped-color');\n        }\n        if (ctx.pdf) // PDFs do not support transparent fill colors\n            fillColor = fillColor.substr(0, 7);\n        ctx.fillStyle = fillColor;\n\n        if (ctx.pdf) { // PDFs do not support stroke and fill on the same object\n            ctx.beginPath();\n            drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n            ctx.closePath();\n        }\n        ctx.fill();\n        if (this.strokeStyle(renderer) !== this.getCssProperty(renderer, '--color-default'))\n            renderer.tooltip = (c) => this.tooltip(c);\n    }\n\n    attributes() {\n        return {};\n    }\n\n    set_layout() { }\n\n    label() { return this.data.name; }\n\n    tooltip(container) {\n        super.tooltip(container);\n        container.classList.add('sdfvtooltip--connector');\n        container.innerText = this.label();\n    }\n}\n\nexport class AccessNode extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        ctx.beginPath();\n        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n        ctx.closePath();\n        ctx.strokeStyle = this.strokeStyle(renderer);\n\n        const nodedesc = this.sdfg.attributes._arrays[this.data.node.attributes.data];\n        // Streams have dashed edges\n        if (nodedesc && nodedesc.type === \"Stream\") {\n            ctx.setLineDash([5, 3]);\n        } else {\n            ctx.setLineDash([1, 0]);\n        }\n\n        // Non-transient (external) data is thicker\n        if (nodedesc && nodedesc.attributes.transient === false) {\n            ctx.lineWidth = 3.0;\n        } else {\n            ctx.lineWidth = 1.0;\n        }\n        ctx.stroke();\n        ctx.lineWidth = 1.0;\n        ctx.setLineDash([1, 0]);\n\n        // Views are colored like connectors\n        if (nodedesc && nodedesc.type === \"View\") {\n            ctx.fillStyle = this.getCssProperty(renderer, '--connector-unscoped-color');\n        } else {\n            ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        }\n\n        if (ctx.pdf) { // PDFs do not support stroke and fill on the same object\n            ctx.beginPath();\n            drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n            ctx.closePath();\n        }\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n        const textmetrics = ctx.measureText(this.label());\n        ctx.fillText(this.label(), this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 4.0);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.beginPath();\n        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);\n        ctx.closePath();\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\nexport class ScopeNode extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        let draw_shape;\n        if (this.data.node.attributes.is_collapsed) {\n            draw_shape = () => drawHexagon(ctx, this.x, this.y, this.width, this.height);\n        } else {\n            draw_shape = () => drawTrapezoid(ctx, this.topleft(), this, this.scopeend());\n        }\n        ctx.strokeStyle = this.strokeStyle(renderer);\n\n        // Consume scopes have dashed edges\n        if (this.data.node.type.startsWith(\"Consume\"))\n            ctx.setLineDash([5, 3]);\n        else\n            ctx.setLineDash([1, 0]);\n\n        draw_shape();\n        ctx.stroke();\n        ctx.setLineDash([1, 0]);\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n            draw_shape();\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n\n        const far_label = this.far_label();\n        drawAdaptiveText(ctx, renderer, far_label,\n            this.close_label(renderer), this.x, this.y,\n            this.width, this.height,\n            SCOPE_LOD);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        if (this.data.node.attributes.is_collapsed)\n            drawHexagon(ctx, this.x, this.y, this.width, this.height);\n        else\n            drawTrapezoid(ctx, this.topleft(), this, this.scopeend());\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n    far_label() {\n        let result = this.attributes().label;\n        if (this.scopeend()) {  // Get label from scope entry\n            const entry = this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];\n            if (entry !== undefined)\n                result = entry.attributes.label;\n            else {\n                result = this.data.node.label;\n                const ind = result.indexOf('[');\n                if (ind > 0)\n                    result = result.substring(0, ind);\n            }\n        }\n        return result;\n    }\n\n    close_label(renderer) {\n        if (!renderer.inclusive_ranges)\n            return this.label();\n\n        let result = this.far_label();\n        let attrs = this.attributes();\n        if (this.scopeend()) {\n            const entry = this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];\n            if (entry !== undefined)\n                attrs = entry.attributes;\n            else\n                return this.label();\n        }\n        result += ' [';\n\n        if (this instanceof ConsumeEntry || this instanceof ConsumeExit) {\n            result += attrs.pe_index + '=' + '0..' + (attrs.num_pes - 1).toString();\n        } else {\n            for (let i = 0; i < attrs.params.length; ++i) {\n                result += attrs.params[i] + '=';\n                result += sdfg_range_elem_to_string(attrs.range.ranges[i], renderer.view_settings()) + ', ';\n            }\n            result = result.substring(0, result.length - 2); // Remove trailing comma\n        }\n        return result + ']';\n    }\n}\n\nexport class EntryNode extends ScopeNode {\n    scopeend() { return false; }\n}\n\nexport class ExitNode extends ScopeNode {\n    scopeend() { return true; }\n}\n\nexport class MapEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([1, 0]); } }\nexport class MapExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([1, 0]); } }\nexport class ConsumeEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([5, 3]); } }\nexport class ConsumeExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([5, 3]); } }\nexport class PipelineEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([10, 3]); } }\nexport class PipelineExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([10, 3]); } }\n\nexport class Tasklet extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        drawOctagon(ctx, topleft, this.width, this.height);\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        ctx.stroke();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n            drawOctagon(ctx, topleft, this.width, this.height);\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n\n        const ppp = renderer.canvas_manager.points_per_pixel();\n        if (!ctx.lod || ppp < TASKLET_LOD) {\n            // If we are close to the tasklet, show its contents\n            const code = this.attributes().code.string_data;\n            const lines = code.split('\\n');\n            let maxline = 0, maxline_len = 0;\n            for (let i = 0; i < lines.length; i++) {\n                if (lines[i].length > maxline_len) {\n                    maxline = i;\n                    maxline_len = lines[i].length;\n                }\n            }\n            const oldfont = ctx.font;\n            ctx.font = \"10px courier new\";\n            const textmetrics = ctx.measureText(lines[maxline]);\n\n            // Fit font size to 80% height and width of tasklet\n            const height = lines.length * LINEHEIGHT * 1.05;\n            const width = textmetrics.width;\n            const TASKLET_WRATIO = 0.9, TASKLET_HRATIO = 0.5;\n            const hr = height / (this.height * TASKLET_HRATIO);\n            const wr = width / (this.width * TASKLET_WRATIO);\n            const FONTSIZE = Math.min(10 / hr, 10 / wr);\n            const text_yoffset = FONTSIZE / 4;\n\n            ctx.font = FONTSIZE + \"px courier new\";\n            // Set the start offset such that the middle row of the text is in this.y\n            const y = this.y + text_yoffset - ((lines.length - 1) / 2) * FONTSIZE * 1.05;\n            for (let i = 0; i < lines.length; i++)\n                ctx.fillText(lines[i], this.x - (this.width * TASKLET_WRATIO) / 2.0,\n                    y + i * FONTSIZE * 1.05);\n\n            ctx.font = oldfont;\n            return;\n        }\n\n        const textmetrics = ctx.measureText(this.label());\n        ctx.fillText(this.label(), this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 2.0);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        drawOctagon(ctx, this.topleft(), this.width, this.height);\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\nexport class Reduce extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        const topleft = this.topleft();\n        const draw_shape = () => {\n            ctx.beginPath();\n            ctx.moveTo(topleft.x, topleft.y);\n            ctx.lineTo(topleft.x + this.width / 2, topleft.y + this.height);\n            ctx.lineTo(topleft.x + this.width, topleft.y);\n            ctx.lineTo(topleft.x, topleft.y);\n            ctx.closePath();\n        };\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        draw_shape();\n        ctx.stroke();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n            draw_shape();\n        ctx.fill();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n\n        const far_label = this.label().substring(4, this.label().indexOf(','));\n        drawAdaptiveText(ctx, renderer, far_label,\n            this.label(), this.x, this.y - this.height * 0.2,\n            this.width, this.height,\n            SCOPE_LOD);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        const topleft = this.topleft();\n        ctx.beginPath();\n        ctx.moveTo(topleft.x, topleft.y);\n        ctx.lineTo(topleft.x + this.width / 2, topleft.y + this.height);\n        ctx.lineTo(topleft.x + this.width, topleft.y);\n        ctx.lineTo(topleft.x, topleft.y);\n        ctx.closePath();\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\nexport class NestedSDFG extends SDFGNode {\n    draw(renderer, ctx, mousepos) {\n        if (this.data.node.attributes.is_collapsed) {\n            const topleft = this.topleft();\n            drawOctagon(ctx, topleft, this.width, this.height);\n            ctx.strokeStyle = this.strokeStyle(renderer);\n            ctx.stroke();\n            drawOctagon(ctx, { x: topleft.x + 2.5, y: topleft.y + 2.5 }, this.width - 5, this.height - 5);\n            ctx.strokeStyle = this.strokeStyle(renderer);\n            ctx.stroke();\n            ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n            if (ctx.pdf) // PDFs do not support stroke and fill on the same object\n                drawOctagon(ctx, { x: topleft.x + 2.5, y: topleft.y + 2.5 }, this.width - 5, this.height - 5);\n            ctx.fill();\n            ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n            const label = this.data.node.attributes.label;\n            const textmetrics = ctx.measureText(label);\n            ctx.fillText(label, this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 4.0);\n            return;\n        }\n\n        // Draw square around nested SDFG\n        super.draw(renderer, ctx, mousepos, '--nested-sdfg-foreground-color',\n            '--nested-sdfg-background-color');\n\n        // Draw nested graph\n        draw_sdfg(renderer, ctx, this.data.graph, mousepos);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        if (this.data.node.attributes.is_collapsed) {\n            // Save the current style properties.\n            const orig_fill_style = ctx.fillStyle;\n            const orig_alpha = ctx.globalAlpha;\n\n            ctx.globalAlpha = alpha;\n            ctx.fillStyle = color;\n\n            drawOctagon(ctx, this.topleft(), this.width, this.height);\n            ctx.fill();\n\n            // Restore the previous style properties.\n            ctx.fillStyle = orig_fill_style;\n            ctx.globalAlpha = orig_alpha;\n        } else {\n            super.shade(renderer, ctx, color, alpha);\n        }\n    }\n\n    set_layout() {\n        if (this.data.node.attributes.is_collapsed) {\n            const labelsize = this.data.node.attributes.label.length * LINEHEIGHT * 0.8;\n            const inconnsize = 2 * LINEHEIGHT * Object.keys(this.data.node.attributes.in_connectors).length - LINEHEIGHT;\n            const outconnsize = 2 * LINEHEIGHT * Object.keys(this.data.node.attributes.out_connectors).length - LINEHEIGHT;\n            const maxwidth = Math.max(labelsize, inconnsize, outconnsize);\n            let maxheight = 2 * LINEHEIGHT;\n            maxheight += 4 * LINEHEIGHT;\n\n            const size = { width: maxwidth, height: maxheight };\n            size.width += 2.0 * (size.height / 3.0);\n            size.height /= 1.75;\n\n            this.width = size.width;\n            this.height = size.height;\n        } else {\n            this.width = this.data.node.attributes.layout.width;\n            this.height = this.data.node.attributes.layout.height;\n        }\n    }\n\n\n    label() { return \"\"; }\n}\n\nexport class LibraryNode extends SDFGNode {\n    _path(ctx) {\n        const hexseg = this.height / 6.0;\n        const topleft = this.topleft();\n        ctx.beginPath();\n        ctx.moveTo(topleft.x, topleft.y);\n        ctx.lineTo(topleft.x + this.width - hexseg, topleft.y);\n        ctx.lineTo(topleft.x + this.width, topleft.y + hexseg);\n        ctx.lineTo(topleft.x + this.width, topleft.y + this.height);\n        ctx.lineTo(topleft.x, topleft.y + this.height);\n        ctx.closePath();\n    }\n\n    _path2(ctx) {\n        const hexseg = this.height / 6.0;\n        const topleft = this.topleft();\n        ctx.beginPath();\n        ctx.moveTo(topleft.x + this.width - hexseg, topleft.y);\n        ctx.lineTo(topleft.x + this.width - hexseg, topleft.y + hexseg);\n        ctx.lineTo(topleft.x + this.width, topleft.y + hexseg);\n    }\n\n    draw(renderer, ctx, mousepos) {\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');\n        this._path(ctx);\n        ctx.fill();\n        ctx.strokeStyle = this.strokeStyle(renderer);\n        this._path(ctx);\n        ctx.stroke();\n        this._path2(ctx);\n        ctx.stroke();\n        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');\n        const textw = ctx.measureText(this.label()).width;\n        ctx.fillText(this.label(), this.x - textw / 2, this.y + LINEHEIGHT / 4);\n    }\n\n    shade(renderer, ctx, color, alpha = '0.6') {\n        // Save the current style properties.\n        const orig_fill_style = ctx.fillStyle;\n        const orig_alpha = ctx.globalAlpha;\n\n        ctx.globalAlpha = alpha;\n        ctx.fillStyle = color;\n\n        this._path(ctx);\n        ctx.fill();\n\n        // Restore the previous style properties.\n        ctx.fillStyle = orig_fill_style;\n        ctx.globalAlpha = orig_alpha;\n    }\n\n}\n\n//////////////////////////////////////////////////////\n\n// Draw an entire SDFG\nexport function draw_sdfg(renderer, ctx, sdfg_dagre, mousepos) {\n    const ppp = renderer.canvas_manager.points_per_pixel();\n\n    // Render state machine\n    const g = sdfg_dagre;\n    if (!ctx.lod || ppp < EDGE_LOD)\n        g.edges().forEach(e => {\n            const edge = g.edge(e);\n            edge.draw(renderer, ctx, mousepos);\n            edge.debug_draw(renderer, ctx);\n        });\n\n\n    const visible_rect = renderer.visible_rect;\n\n    // Render each visible state's contents\n    g.nodes().forEach(v => {\n        const node = g.node(v);\n\n        if (ctx.lod && (ppp >= STATE_LOD || node.width / ppp < STATE_LOD)) {\n            node.simple_draw(renderer, ctx, mousepos);\n            node.debug_draw(renderer, ctx);\n            return;\n        }\n        // Skip invisible states\n        if (ctx.lod && !node.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))\n            return;\n\n        node.draw(renderer, ctx, mousepos);\n        node.debug_draw(renderer, ctx);\n\n        const ng = node.data.graph;\n\n        if (!node.data.state.attributes.is_collapsed && ng) {\n            ng.nodes().forEach(v => {\n                const n = ng.node(v);\n\n                if (ctx.lod && !n.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))\n                    return;\n                if (ctx.lod && ppp >= NODE_LOD) {\n                    n.simple_draw(renderer, ctx, mousepos);\n                    n.debug_draw(renderer, ctx);\n                    return;\n                }\n\n                n.draw(renderer, ctx, mousepos);\n                n.debug_draw(renderer, ctx);\n                n.in_connectors.forEach(c => {\n                    c.draw(renderer, ctx, mousepos);\n                    c.debug_draw(renderer, ctx);\n                });\n                n.out_connectors.forEach(c => {\n                    c.draw(renderer, ctx, mousepos);\n                    c.debug_draw(renderer, ctx);\n                });\n            });\n            if (ctx.lod && ppp >= EDGE_LOD)\n                return;\n            ng.edges().forEach(e => {\n                const edge = ng.edge(e);\n                if (ctx.lod && !edge.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))\n                    return;\n                edge.draw(renderer, ctx, mousepos);\n                edge.debug_draw(renderer, ctx);\n            });\n        }\n    });\n}\n\n// Translate an SDFG by a given offset\nexport function offset_sdfg(sdfg, sdfg_graph, offset) {\n    sdfg.nodes.forEach((state, id) => {\n        const g = sdfg_graph.node(id);\n        g.x += offset.x;\n        g.y += offset.y;\n        if (!state.attributes.is_collapsed)\n            offset_state(state, g, offset);\n    });\n    sdfg.edges.forEach((e, eid) => {\n        const edge = sdfg_graph.edge(e.src, e.dst);\n        edge.x += offset.x;\n        edge.y += offset.y;\n        edge.points.forEach((p) => {\n            p.x += offset.x;\n            p.y += offset.y;\n        });\n    });\n}\n\n// Translate nodes, edges, and connectors in a given SDFG state by an offset\nexport function offset_state(state, state_graph, offset) {\n    const drawn_nodes = new Set();\n\n    state.nodes.forEach((n, nid) => {\n        const node = state_graph.data.graph.node(nid);\n        if (!node) return;\n        drawn_nodes.add(nid.toString());\n\n        node.x += offset.x;\n        node.y += offset.y;\n        node.in_connectors.forEach(c => {\n            c.x += offset.x;\n            c.y += offset.y;\n        });\n        node.out_connectors.forEach(c => {\n            c.x += offset.x;\n            c.y += offset.y;\n        });\n\n        if (node.data.node.type === 'NestedSDFG')\n            offset_sdfg(node.data.node.attributes.sdfg, node.data.graph, offset);\n    });\n    state.edges.forEach((e, eid) => {\n        e = check_and_redirect_edge(e, drawn_nodes, state);\n        if (!e) return;\n        const edge = state_graph.data.graph.edge(e.src, e.dst, eid);\n        if (!edge) return;\n        edge.x += offset.x;\n        edge.y += offset.y;\n        edge.points.forEach((p) => {\n            p.x += offset.x;\n            p.y += offset.y;\n        });\n    });\n}\n\n\n///////////////////////////////////////////////////////\n\nexport function drawAdaptiveText(ctx, renderer, far_text, close_text,\n    x, y, w, h, ppp_thres, max_font_size = 50,\n    font_multiplier = 16) {\n    const ppp = renderer.canvas_manager.points_per_pixel();\n    let label = close_text;\n    let FONTSIZE = Math.min(ppp * font_multiplier, max_font_size);\n    let yoffset = LINEHEIGHT / 2.0;\n    const oldfont = ctx.font;\n    if (ctx.lod && ppp >= ppp_thres) { // Far text\n        ctx.font = FONTSIZE + \"px sans-serif\";\n        label = far_text;\n        yoffset = FONTSIZE / 2.0 - h / 6.0;\n    }\n\n    const textmetrics = ctx.measureText(label);\n    let tw = textmetrics.width;\n    if (ctx.lod && ppp >= ppp_thres && tw > w) {\n        FONTSIZE = FONTSIZE / (tw / w);\n        ctx.font = FONTSIZE + \"px sans-serif\";\n        yoffset = FONTSIZE / 2.0 - h / 6.0;\n        tw = w;\n    }\n\n    ctx.fillText(label, x - tw / 2.0, y + yoffset);\n\n    if (ctx.lod && ppp >= ppp_thres)\n        ctx.font = oldfont;\n}\n\nexport function drawHexagon(ctx, x, y, w, h, offset) {\n    const topleft = { x: x - w / 2.0, y: y - h / 2.0 };\n    const hexseg = h / 3.0;\n    ctx.beginPath();\n    ctx.moveTo(topleft.x, y);\n    ctx.lineTo(topleft.x + hexseg, topleft.y);\n    ctx.lineTo(topleft.x + w - hexseg, topleft.y);\n    ctx.lineTo(topleft.x + w, y);\n    ctx.lineTo(topleft.x + w - hexseg, topleft.y + h);\n    ctx.lineTo(topleft.x + hexseg, topleft.y + h);\n    ctx.lineTo(topleft.x, y);\n    ctx.closePath();\n}\n\nexport function drawOctagon(ctx, topleft, width, height) {\n    const octseg = height / 3.0;\n    ctx.beginPath();\n    ctx.moveTo(topleft.x, topleft.y + octseg);\n    ctx.lineTo(topleft.x + octseg, topleft.y);\n    ctx.lineTo(topleft.x + width - octseg, topleft.y);\n    ctx.lineTo(topleft.x + width, topleft.y + octseg);\n    ctx.lineTo(topleft.x + width, topleft.y + 2 * octseg);\n    ctx.lineTo(topleft.x + width - octseg, topleft.y + height);\n    ctx.lineTo(topleft.x + octseg, topleft.y + height);\n    ctx.lineTo(topleft.x, topleft.y + 2 * octseg);\n    ctx.lineTo(topleft.x, topleft.y + 1 * octseg);\n    ctx.closePath();\n}\n\n// Adapted from https://stackoverflow.com/a/2173084/6489142\nexport function drawEllipse(ctx, x, y, w, h) {\n    const kappa = .5522848,\n        ox = (w / 2) * kappa, // control point offset horizontal\n        oy = (h / 2) * kappa, // control point offset vertical\n        xe = x + w,           // x-end\n        ye = y + h,           // y-end\n        xm = x + w / 2,       // x-middle\n        ym = y + h / 2;       // y-middle\n\n    ctx.moveTo(x, ym);\n    ctx.bezierCurveTo(x, ym - oy, xm - ox, y, xm, y);\n    ctx.bezierCurveTo(xm + ox, y, xe, ym - oy, xe, ym);\n    ctx.bezierCurveTo(xe, ym + oy, xm + ox, ye, xm, ye);\n    ctx.bezierCurveTo(xm - ox, ye, x, ym + oy, x, ym);\n}\n\nexport function drawArrow(ctx, p1, p2, size, offset = 0, padding = 0) {\n    ctx.save();\n    // Rotate the context to point along the path\n    const dx = p2.x - p1.x;\n    const dy = p2.y - p1.y;\n    ctx.translate(p2.x, p2.y);\n    ctx.rotate(Math.atan2(dy, dx));\n\n    // arrowhead\n    ctx.beginPath();\n    ctx.moveTo(0 + padding + offset, 0);\n    ctx.lineTo(((-2 * size) - padding) - offset, -(size + padding));\n    ctx.lineTo(((-2 * size) - padding) - offset, (size + padding));\n    ctx.closePath();\n    ctx.fill();\n    ctx.restore();\n}\n\nexport function drawTrapezoid(ctx, topleft, node, inverted = false) {\n    ctx.beginPath();\n    if (inverted) {\n        ctx.moveTo(topleft.x, topleft.y);\n        ctx.lineTo(topleft.x + node.width, topleft.y);\n        ctx.lineTo(topleft.x + node.width - node.height, topleft.y + node.height);\n        ctx.lineTo(topleft.x + node.height, topleft.y + node.height);\n        ctx.lineTo(topleft.x, topleft.y);\n    } else {\n        ctx.moveTo(topleft.x, topleft.y + node.height);\n        ctx.lineTo(topleft.x + node.width, topleft.y + node.height);\n        ctx.lineTo(topleft.x + node.width - node.height, topleft.y);\n        ctx.lineTo(topleft.x + node.height, topleft.y);\n        ctx.lineTo(topleft.x, topleft.y + node.height);\n    }\n    ctx.closePath();\n}\n\n// Returns the distance from point p to line defined by two points (line1, line2)\nexport function ptLineDistance(p, line1, line2) {\n    const dx = (line2.x - line1.x);\n    const dy = (line2.y - line1.y);\n    const res = dy * p.x - dx * p.y + line2.x * line1.y - line2.y * line1.x;\n\n    return Math.abs(res) / Math.sqrt(dy * dy + dx * dx);\n}\n\n/**\n * Get the color on a green-red temperature scale based on a fractional value.\n * @param {Number} val Value between 0 and 1, 0 = green, .5 = yellow, 1 = red\n * @returns            HSL color string\n */\nexport function getTempColor(val) {\n    if (val < 0)\n        val = 0;\n    if (val > 1)\n        val = 1;\n    const hue = ((1 - val) * 120).toString(10);\n    return 'hsl(' + hue + ',100%,50%)';\n}\n\nexport const SDFGElements = {\n    SDFGElement, SDFG, State, SDFGNode, Edge, Connector, AccessNode, ScopeNode, EntryNode, ExitNode, MapEntry, MapExit,\n    ConsumeEntry, ConsumeExit, Tasklet, Reduce, PipelineEntry, PipelineExit, NestedSDFG, LibraryNode\n};\n\n// TODO remove this global variable assignment once DIODE is removed/no longer relies on it\nObject.assign(globalThis, SDFGElements);\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { sdfg_property_to_string } from \"./utils/sdfg/display\";\nimport { traverse_sdfg_scopes } from \"./utils/sdfg/traversal\";\nimport { htmlSanitize } from \"./utils/sanitization\";\nimport { globals } from \"./sdfv\";\n\nexport const SDFVUIHandlers = {\n    on_init_menu,\n    on_sidebar_set_title,\n    on_sidebar_show,\n    sidebar_get_contents,\n    on_close_menu,\n    on_outline,\n    on_fill_info,\n};\n\nfunction on_sidebar_set_title(title) {\n    // Modify sidebar header\n    document.getElementById(\"sidebar-header\").innerText = title;\n}\n\nfunction sidebar_get_contents() {\n    return document.getElementById(\"sidebar-contents\");\n}\n\nfunction on_sidebar_show() {\n    // Open sidebar if closed\n    document.getElementById(\"sidebar\").style.display = \"flex\";\n}\n\nfunction on_fill_info(elem) {\n    let contents = sidebar_get_contents();\n    let html = \"\";\n    if (elem instanceof Edge && elem.data.type === \"Memlet\") {\n        let sdfg_edge = elem.sdfg.nodes[elem.parent_id].edges[elem.id];\n        html += \"<h4>Connectors: \" + sdfg_edge.src_connector + \" &rarr; \" +\n            sdfg_edge.dst_connector + \"</h4>\";\n    }\n    html += \"<hr />\";\n\n    for (let attr of Object.entries(elem.attributes())) {\n        if (attr[0] === \"layout\" || attr[0] === \"sdfg\" ||\n            attr[0] === \"_arrays\" || attr[0].startsWith(\"_meta_\") ||\n            attr[0] == \"position\")\n            continue;\n        html += \"<b>\" + attr[0] + \"</b>:&nbsp;&nbsp;\";\n        html += sdfg_property_to_string(\n            attr[1], globals.daceRenderer.view_settings()\n        ) + \"</p>\";\n    }\n\n    // If access node, add array information too\n    if (elem instanceof AccessNode) {\n        let sdfg_array = elem.sdfg.attributes._arrays[elem.attributes().data];\n        html += \"<br /><h4>\" + sdfg_array.type + \" properties:</h4>\";\n        for (let attr of Object.entries(sdfg_array.attributes)) {\n            if (attr[0] === \"layout\" || attr[0] === \"sdfg\" ||\n                attr[0].startsWith(\"_meta_\"))\n                continue;\n            html += \"<b>\" + attr[0] + \"</b>:&nbsp;&nbsp;\";\n            html += sdfg_property_to_string(\n                attr[1], globals.daceRenderer.view_settings()\n            ) + \"</p>\";\n        }\n    }\n\n    contents.innerHTML = html;\n}\n\nfunction on_outline(renderer, sdfg) {\n    on_sidebar_set_title('SDFG Outline');\n\n    const sidebar = sidebar_get_contents();\n    sidebar.innerHTML = '';\n\n    // Entire SDFG\n    const d = document.createElement('div');\n    d.className = 'context_menu_option';\n    d.innerHTML = htmlSanitize`<i class=\"material-icons\" style=\"font-size: inherit\">filter_center_focus</i> SDFG ${renderer.sdfg.attributes.name}`;\n    d.onclick = () => renderer.zoom_to_view();\n    sidebar.appendChild(d);\n\n    const stack = [sidebar];\n\n    // Add elements to tree view in sidebar\n    traverse_sdfg_scopes(sdfg, (node, parent) => {\n        // Skip exit nodes when scopes are known\n        if (node.type().endsWith('Exit') && node.data.node.scope_entry >= 0) {\n            stack.push(null);\n            return true;\n        }\n\n        // Create element\n        const d = document.createElement('div');\n        d.className = 'context_menu_option';\n        let is_collapsed = node.attributes().is_collapsed;\n        is_collapsed = (is_collapsed === undefined) ? false : is_collapsed;\n        let node_type = node.type();\n\n        // If a scope has children, remove the name \"Entry\" from the type\n        if (node.type().endsWith('Entry')) {\n            const state = node.sdfg.nodes[node.parent_id];\n            if (state.scope_dict[node.id] !== undefined) {\n                node_type = node_type.slice(0, -5);\n            }\n        }\n\n        d.innerHTML = htmlSanitize`${node_type} ${node.label()}${is_collapsed ? \" (collapsed)\" : \"\"}`;\n        d.onclick = (e) => {\n            // Show node or entire scope\n            const nodes_to_display = [node];\n            if (node.type().endsWith('Entry')) {\n                const state = node.sdfg.nodes[node.parent_id];\n                if (state.scope_dict[node.id] !== undefined) {\n                    for (const subnode_id of state.scope_dict[node.id])\n                        nodes_to_display.push(parent.node(subnode_id));\n                }\n            }\n\n            renderer.zoom_to_view(nodes_to_display);\n\n            // Ensure that the innermost div is the one that handles the event\n            if (!e) e = window.event;\n            e.cancelBubble = true;\n            if (e.stopPropagation) e.stopPropagation();\n        };\n        stack.push(d);\n\n        // If is collapsed, don't traverse further\n        if (is_collapsed)\n            return false;\n\n    }, (node, parent) => {\n        // After scope ends, pop ourselves as the current element \n        // and add to parent\n        const elem = stack.pop();\n        if (elem)\n            stack[stack.length - 1].appendChild(elem);\n    });\n\n    on_sidebar_show();\n}\n\nfunction on_close_menu() {\n    document.getElementById(\"sidebar\").style.display = \"none\";\n}\n\nfunction on_init_menu() {\n    const right = document.getElementById('sidebar');\n    const bar = document.getElementById('dragbar');\n\n    const drag = (e) => {\n        document.selection ? document.selection.empty() : window.getSelection().removeAllRanges();\n        right.style.width = Math.max(((e.view.innerWidth - e.pageX)), 20) + 'px';\n    };\n\n    bar.addEventListener('mousedown', () => {\n        document.addEventListener('mousemove', drag);\n        document.addEventListener('mouseup', () => {\n            document.removeEventListener('mousemove', drag);\n        });\n    });\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { parse_sdfg, stringify_sdfg } from \"./utils/sdfg/json_serializer\";\nimport { mean, median } from 'mathjs';\nimport { SDFGRenderer } from './renderer/renderer';\nimport { GenericSdfgOverlay } from \"./overlays/generic_sdfg_overlay\";\nimport { SDFVUIHandlers } from \"./sdfv_ui_handlers\";\nimport { htmlSanitize } from \"./utils/sanitization\";\nimport { SDFGElements } from \"./renderer/renderer_elements\";\nimport { assignIfNotExists } from \"./utils/utils\"\nimport {\n    sdfg_property_to_string,\n    sdfg_range_elem_to_string,\n    sdfg_typeclass_to_string,\n    string_to_sdfg_typeclass,\n} from \"./utils/sdfg/display\";\nimport {\n    find_graph_element_by_uuid,\n    get_uuid_graph_element,\n} from \"./utils/sdfg/sdfg_utils\";\nimport { traverse_sdfg_scopes } from \"./utils/sdfg/traversal\";\nimport { RuntimeMicroSecondsOverlay } from \"./overlays/runtime_micro_seconds_overlay\";\nimport { MemoryVolumeOverlay } from \"./overlays/memory_volume_overlay\";\nimport { StaticFlopsOverlay } from \"./overlays/static_flops_overlay\";\nconst { $ } = globalThis;\n\nlet fr;\nlet file = null;\nlet instrumentation_file = null;\n\n\n// TODO: This is a workaround to utilize components of this module in non-ts\n// components of the vscode extension. This is subject to change when these\n// components are moved over from js to ts.\nexport const globals = assignIfNotExists(\n    /** @type {{}} */ (globalThis),\n    {\n        daceRenderer: null,\n        daceUIHandlers: SDFVUIHandlers,\n        daceInitSDFV: init_sdfv,\n        daceParseSDFG: parse_sdfg,\n        daceStringifySDFG: stringify_sdfg,\n        daceFindInGraph: find_in_graph,\n        daceSDFGPropertyToString: sdfg_property_to_string,\n        daceSDFGRangeElemToString: sdfg_range_elem_to_string,\n        daceGetUUIDGraphElement: get_uuid_graph_element,\n        daceFindGraphElementByUUID: find_graph_element_by_uuid,\n        daceTraverseSDFGScopes: traverse_sdfg_scopes,\n        daceSDFGTypeclassToString: sdfg_typeclass_to_string,\n        daceStringToSDFGTypeclass: string_to_sdfg_typeclass,\n        daceSDFGRenderer: SDFGRenderer,\n        daceSDFGElements: SDFGElements,\n        daceGenericSDFGOverlay: GenericSdfgOverlay,\n        daceMemoryVolumeOverlay: MemoryVolumeOverlay,\n        daceRuntimeMicroSecondsOverlay: RuntimeMicroSecondsOverlay,\n        daceStaticFlopsOverlay: StaticFlopsOverlay,\n        daceMouseEvent: mouse_event,\n    }\n);\n\n\n\nif (document.currentScript.hasAttribute('data-sdfg-json')) {\n    init_sdfv(parse_sdfg(document.currentScript.getAttribute('data-sdfg-json')));\n} else {\n    const url = getParameterByName('url');\n    if (url)\n        load_sdfg_from_url(url);\n    else\n        init_sdfv(null);\n}\n\n\nfunction init_sdfv(sdfg, user_transform = null, debug_draw = false) {\n    $('#sdfg-file-input').change((e) => {\n        if (e.target.files.length < 1)\n            return;\n        file = e.target.files[0];\n        reload_file();\n    });\n    $('#menuclose').click(() => close_menu());\n    $('#reload').click(() => {\n        reload_file();\n    });\n    $('#instrumentation-report-file-input').change((e) => {\n        if (e.target.files.length < 1)\n            return;\n        instrumentation_file = e.target.files[0];\n        load_instrumentation_report();\n    });\n    $('#outline').click(() => {\n        if (globals.daceRenderer)\n            setTimeout(() => outline(globals.daceRenderer, globals.daceRenderer.graph), 1);\n    });\n    $('#search-btn').click(() => {\n        if (globals.daceRenderer)\n            setTimeout(() => {\n                find_in_graph(globals.daceRenderer, globals.daceRenderer.graph, $('#search').val(),\n                    $('#search-case')[0].checked);\n            }, 1);\n    });\n    $('#search').on('keydown', (e) => {\n        if (e.key == 'Enter' || e.which == 13) {\n            start_find_in_graph();\n            e.preventDefault();\n        }\n    });\n\n    let mode_buttons = null;\n    let pan_btn = document.getElementById(\"pan-btn\");\n    let move_btn = document.getElementById(\"move-btn\");\n    let select_btn = document.getElementById(\"select-btn\");\n    let add_btns = [];\n    add_btns.push(document.getElementById('elem_map'));\n    add_btns.push(document.getElementById('elem_consume'));\n    add_btns.push(document.getElementById('elem_tasklet'));\n    add_btns.push(document.getElementById('elem_nested_sdfg'));\n    add_btns.push(document.getElementById('elem_access_node'));\n    add_btns.push(document.getElementById('elem_stream'));\n    add_btns.push(document.getElementById('elem_state'));\n    if (pan_btn)\n        mode_buttons = {\n            pan: pan_btn,\n            move: move_btn,\n            select: select_btn,\n            add_btns: add_btns,\n        };\n\n    if (sdfg !== null)\n        globals.daceRenderer = new SDFGRenderer(\n            sdfg, document.getElementById('contents'), mouse_event,\n            user_transform, debug_draw, null, mode_buttons\n        );\n}\n\nfunction start_find_in_graph() {\n    if (globals.daceRenderer)\n        setTimeout(() => {\n            find_in_graph(\n                globals.daceRenderer, globals.daceRenderer.graph,\n                $('#search').val(), $('#search-case')[0].checked\n            );\n        }, 1);\n}\n\nfunction reload_file() {\n    if (!file)\n        return;\n    fr = new FileReader();\n    fr.onload = file_read_complete;\n    fr.readAsText(file);\n}\n\nfunction file_read_complete() {\n    const sdfg = parse_sdfg(fr.result);\n    globals.daceRenderer?.destroy();\n    globals.daceRenderer = new SDFGRenderer(sdfg, document.getElementById('contents'), mouse_event);\n    close_menu();\n}\n\nfunction load_instrumentation_report() {\n    if (!instrumentation_file)\n        return;\n    fr = new FileReader();\n    fr.onload = load_instrumentation_report_callback;\n    fr.readAsText(instrumentation_file);\n}\n\nfunction load_instrumentation_report_callback() {\n    instrumentation_report_read_complete(JSON.parse(fr.result));\n}\n\n/**\n * Get the min/max values of an array.\n * This is more stable than Math.min/max for large arrays, since Math.min/max\n * is recursive and causes a too high stack-length with long arrays.\n */\nfunction get_minmax(arr) {\n    let max = -Number.MAX_VALUE;\n    let min = Number.MAX_VALUE;\n    arr.forEach(val => {\n        if (val > max)\n            max = val;\n        if (val < min)\n            min = val;\n    });\n    return [min, max];\n}\n\nfunction instrumentation_report_read_complete(report) {\n    const runtime_map = {};\n\n    if (report.traceEvents && globals.daceRenderer?.sdfg) {\n        for (const event of report.traceEvents) {\n            if (event.ph === 'X') {\n                let uuid = event.args.sdfg_id + '/';\n                if (event.args.state_id !== undefined) {\n                    uuid += event.args.state_id + '/';\n                    if (event.args.id !== undefined)\n                        uuid += event.args.id + '/-1';\n                    else\n                        uuid += '-1/-1';\n                } else {\n                    uuid += '-1/-1/-1';\n                }\n\n                if (runtime_map[uuid] !== undefined)\n                    runtime_map[uuid].push(event.dur);\n                else\n                    runtime_map[uuid] = [event.dur];\n            }\n        }\n\n        for (const key in runtime_map) {\n            const values = runtime_map[key];\n            const minmax = get_minmax(values);\n            const min = minmax[0];\n            const max = minmax[1];\n            const runtime_summary = {\n                'min': min,\n                'max': max,\n                'mean': mean(values),\n                'med': median(values),\n                'count': values.length,\n            };\n            runtime_map[key] = runtime_summary;\n        }\n\n        const renderer = globals.daceRenderer;\n\n        if (renderer.overlay_manager) {\n            if (!renderer.overlay_manager.is_overlay_active(\n                RuntimeMicroSecondsOverlay\n            )) {\n                renderer.overlay_manager.register_overlay(\n                    RuntimeMicroSecondsOverlay\n                );\n            }\n            const ol = renderer.overlay_manager.get_overlay(\n                RuntimeMicroSecondsOverlay\n            );\n            if (ol) {\n                ol.runtime_map = runtime_map;\n                ol.refresh();\n            }\n        }\n    }\n}\n\n// https://stackoverflow.com/a/901144/6489142\nfunction getParameterByName(name) {\n    const url = window.location.href;\n    name = name.replace(/[\\[\\]]/g, '\\\\$&');\n    const regex = new RegExp('[?&]' + name + '(=([^&#]*)|&|#|$)'),\n        results = regex.exec(url);\n    if (!results) return null;\n    if (!results[2]) return '';\n    return decodeURIComponent(results[2].replace(/\\+/g, ' '));\n}\n\nfunction load_sdfg_from_url(url) {\n    const request = new XMLHttpRequest();\n    request.responseType = 'text'; // Will be parsed as JSON by parse_sdfg\n    request.onload = () => {\n        if (request.status == 200) {\n            const sdfg = parse_sdfg(request.response);\n            if (globals.daceRenderer)\n                globals.daceRenderer.destroy();\n            init_sdfv(sdfg);\n        } else {\n            alert(\"Failed to load SDFG from URL\");\n            init_sdfv(null);\n        }\n    };\n    request.onerror = () => {\n        alert(\"Failed to load SDFG from URL: \" + request.status);\n        init_sdfv(null);\n    };\n    request.open('GET', url + ((/\\?/).test(url) ? \"&\" : \"?\") + (new Date()).getTime(), true);\n    request.send();\n}\n\nfunction find_recursive(graph, query, results, case_sensitive) {\n    for (const nodeid of graph.nodes()) {\n        const node = graph.node(nodeid);\n        let label = node.label();\n        if (!case_sensitive)\n            label = label.toLowerCase();\n        if (label.indexOf(query) !== -1)\n            results.push(node);\n        // Enter states or nested SDFGs recursively\n        if (node.data.graph)\n            find_recursive(node.data.graph, query, results, case_sensitive);\n    }\n    for (const edgeid of graph.edges()) {\n        const edge = graph.edge(edgeid);\n        let label = edge.label();\n        if (label !== undefined) {\n            if (!case_sensitive)\n                label = label.toLowerCase();\n            if (label.indexOf(query) !== -1)\n                results.push(edge);\n        }\n    }\n}\n\nfunction find_in_graph(renderer, sdfg, query, case_sensitive=false) {\n    sidebar_set_title('Search Results for \"' + query + '\"');\n\n    const results = [];\n    if (!case_sensitive)\n        query = query.toLowerCase();\n    find_recursive(sdfg, query, results, case_sensitive);\n\n    // Zoom to bounding box of all results first\n    if (results.length > 0)\n        renderer.zoom_to_view(results);\n\n    // Show clickable results in sidebar\n    const sidebar = sidebar_get_contents();\n    sidebar.innerHTML = '';\n    for (const result of results) {\n        const d = document.createElement('div');\n        d.className = 'context_menu_option';\n        d.innerHTML = htmlSanitize`${result.type()} ${result.label()}`;\n        d.onclick = () => { renderer.zoom_to_view([result]) };\n        d.onmouseenter = () => {\n            if (!result.highlighted) {\n                result.highlighted = true;\n                renderer.draw_async();\n            }\n        };\n        d.onmouseleave = () => {\n            if (result.highlighted) {\n                result.highlighted = false;\n                renderer.draw_async();\n            }\n        };\n        sidebar.appendChild(d);\n    }\n\n    sidebar_show();\n}\n\nfunction recursive_find_graph(graph, sdfg_id) {\n    let found = undefined;\n    graph.nodes().forEach(n_id => {\n        const n = graph.node(n_id);\n        if (n && n.sdfg.sdfg_list_id === sdfg_id) {\n            found = graph;\n            return found;\n        } else if (n && n.data.graph) {\n            found = recursive_find_graph(n.data.graph, sdfg_id);\n            if (found)\n                return found;\n        }\n    });\n    return found;\n}\n\nfunction find_state(graph, state_id) {\n    let state = undefined;\n    graph.nodes().forEach(s_id => {\n        if (Number(s_id) === state_id) {\n            state = graph.node(s_id);\n            return state;\n        }\n    });\n    return state;\n}\n\nfunction find_node(state, node_id) {\n    let node = undefined;\n    state.data.graph.nodes().forEach(n_id => {\n        if (Number(n_id) === node_id) {\n            node = state.data.graph.node(n_id);\n            return node;\n        }\n    });\n    return node;\n}\n\nfunction find_edge(state, edge_id) {\n    let edge = undefined;\n    state.data.graph.edges().forEach(e_id => {\n        if (Number(e_id.name) === edge_id) {\n            edge = state.data.graph.edge(e_id);\n            return edge;\n        }\n    });\n    return edge;\n}\n\nfunction find_graph_element(graph, type, sdfg_id, state_id = -1, el_id = -1) {\n    const requested_graph = recursive_find_graph(graph, sdfg_id);\n    let state;\n    if (requested_graph) {\n        switch (type) {\n            case 'edge':\n                state = find_state(requested_graph, state_id);\n                if (state)\n                    return find_edge(state, el_id);\n                break;\n            case 'state':\n                return find_state(requested_graph, state_id);\n            case 'node':\n                state = find_state(requested_graph, state_id);\n                if (state)\n                    return find_node(state, el_id);\n                break;\n            case 'isedge':\n                let isedge = undefined;\n                Object.values(requested_graph._edgeLabels).forEach(ise => {\n                    if (ise.id === el_id) {\n                        isedge = ise;\n                        return isedge;\n                    }\n                });\n                return isedge;\n            default:\n                return undefined;\n        }\n    }\n    return undefined;\n}\n\nfunction mouse_event(evtype, event, mousepos, elements, renderer,\n    selected_elements, ends_drag) {\n    if ((evtype === 'click' && !ends_drag) || evtype === 'dblclick') {\n        if (renderer.menu)\n            renderer.menu.destroy();\n        let element;\n        if (selected_elements.length === 0)\n            element = new SDFG(renderer.sdfg);\n        else if (selected_elements.length === 1)\n            element = selected_elements[0];\n        else\n            element = null;\n\n        if (element !== null) {\n            sidebar_set_title(element.type() + \" \" + element.label());\n            fill_info(element);\n        } else {\n            close_menu();\n            sidebar_set_title(\"Multiple elements selected\");\n        }\n        sidebar_show();\n\n    }\n}\n\nfunction init_menu() {\n    return globals.daceUIHandlers.on_init_menu();\n}\n\nfunction sidebar_set_title(title) {\n    return globals.daceUIHandlers.on_sidebar_set_title(title);\n}\n\nfunction sidebar_show() {\n    return globals.daceUIHandlers.on_sidebar_show();\n}\n\nfunction sidebar_get_contents() {\n    return globals.daceUIHandlers.sidebar_get_contents();\n}\n\nfunction close_menu() {\n    return globals.daceUIHandlers.on_close_menu();\n}\n\nfunction outline(renderer, sdfg) {\n    return globals.daceUIHandlers.on_outline(renderer, sdfg);\n}\n\nexport function fill_info(elem) {\n    return globals.daceUIHandlers.on_fill_info(elem);\n}\n\n$('document').ready(() => {\n    init_menu();\n});\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { htmlSanitize } from \"./sanitization\";\nconst { $ } = globalThis;\n\nexport class ContextMenu {\n    /*\n        Implementation for a custom context menu\n    */\n    constructor(html_content = null) {\n\n        this._html_content = html_content;\n        this._click_close_handlers = [];\n\n        this._ = setTimeout(() => {\n            this._click_close_handlers = [\n                ['click', x => {\n                    this.destroy();\n                }],\n                ['contextmenu', x => {\n                    this.destroy();\n                }]\n\n            ];\n\n            for (let x of this._click_close_handlers) {\n                window.addEventListener(...x);\n            }\n        }, 30);\n\n        this._options = [];\n        this._cmenu_elem = null;\n    }\n\n    width() {\n        return this._cmenu_elem.offsetWidth;\n    }\n\n    visible() { return this._cmenu_elem != null; }\n\n    addOption(name, onselect, onhover = null) {\n        this._options.push({\n            name: name,\n            func: onselect,\n            onhover: onhover\n        });\n    }\n\n    addCheckableOption(name, checked, onselect, onhover = null) {\n        this._options.push({\n            name: name,\n            checkbox: true,\n            checked: checked,\n            func: onselect,\n            onhover: onhover\n        });\n    }\n\n    destroy() {\n        if (!this._cmenu_elem)\n            return;\n        // Clear everything\n\n        // Remove the context menu\n\n        document.body.removeChild(this._cmenu_elem);\n\n        for (let x of this._click_close_handlers) {\n            window.removeEventListener(...x);\n        }\n\n        this._cmenu_elem = null;\n    }\n\n    show(x, y) {\n        /*\n            Shows the context menu originating at point (x,y)\n        */\n\n        let cmenu_div = document.createElement('div');\n        cmenu_div.id = \"contextmenu\";\n        $(cmenu_div).css('left', x + \"px\");\n        $(cmenu_div).css('top', y + \"px\");\n        cmenu_div.classList.add(\"context_menu\");\n\n\n        if (this._html_content == null) {\n            // Set default context menu\n\n            for (let x of this._options) {\n\n                let elem = document.createElement('div');\n                elem.addEventListener('click', x.func);\n                elem.classList.add(\"context_menu_option\");\n\n                if (x.checkbox) {\n                    let markelem = document.createElement('span');\n                    markelem.classList = x.checked ? 'checkmark_checked' : 'checkmark';\n                    elem.appendChild(markelem);\n                    elem.innerHTML += htmlSanitize`${x.name}`;\n                    elem.addEventListener('click', elem => {\n                        x.checked = !x.checked;\n                        x.func(elem, x.checked);\n                    });\n                } else {\n                    elem.innerText = x.name;\n                    elem.addEventListener('click', x.func);\n                }\n                cmenu_div.appendChild(elem);\n            }\n        }\n        else {\n            cmenu_div.innerHTML = this._html_content;\n        }\n\n        this._cmenu_elem = cmenu_div;\n        document.body.appendChild(cmenu_div);\n    }\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport function escapeHTML(s: string): string {\n    const escapeCharacters: Map<string, string> = new Map([\n        ['&', '&amp;'],\n        ['<', '&lt;'],\n        ['>', '&gt;'],\n        ['\"', '&quot;'],\n        [\"'\", '&#039;'],\n    ]);\n\n    return `${s}`.replace(/[&<>\"']/g, m => escapeCharacters.get(m)!);\n}\n\nexport function htmlSanitize(strings: TemplateStringsArray, ...values: any[]): string {\n    return strings.length === 1 ? strings[0]\n        : strings.reduce((s, n, i) => `${s}${escapeHTML(String(values[i - 1]))}${n}`);\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { simplify } from 'mathjs';\n\nexport function sdfg_range_elem_to_string(range, settings = null) {\n    let preview = '';\n    if (range.start == range.end && range.step == 1 && range.tile == 1)\n        preview += sdfg_property_to_string(range.start, settings);\n    else {\n        if (settings && settings.inclusive_ranges) {\n            preview += sdfg_property_to_string(range.start, settings) + '..' +\n                sdfg_property_to_string(range.end, settings);\n        } else {\n            let endp1 = sdfg_property_to_string(range.end, settings) + ' + 1';\n            try {\n                endp1 = simplify(endp1).toString();\n            } catch (e) { }\n            preview += sdfg_property_to_string(range.start, settings) + ':' +\n                endp1;\n        }\n        if (range.step != 1) {\n            preview += ':' + sdfg_property_to_string(range.step, settings);\n            if (range.tile != 1)\n                preview += ':' + sdfg_property_to_string(range.tile, settings);\n        } else if (range.tile != 1) {\n            preview += '::' + sdfg_property_to_string(range.tile, settings);\n        }\n    }\n    return preview;\n}\n\n\n// Includes various properties and returns their string representation\nexport function sdfg_property_to_string(prop, settings = null) {\n    if (prop === null) return prop;\n    if (typeof prop === 'boolean') {\n        if (prop)\n            return 'True';\n        return 'False';\n    } else if (prop.type === \"Indices\" || prop.type === \"subsets.Indices\") {\n        const indices = prop.indices;\n        let preview = '[';\n        for (const index of indices) {\n            preview += sdfg_property_to_string(index, settings) + ', ';\n        }\n        return preview.slice(0, -2) + ']';\n    } else if (prop.type === \"Range\" || prop.type === \"subsets.Range\") {\n        const ranges = prop.ranges;\n\n        // Generate string from range\n        let preview = '[';\n        for (const range of ranges) {\n            preview += sdfg_range_elem_to_string(range, settings) + ', ';\n        }\n        return preview.slice(0, -2) + ']';\n    } else if (prop.language !== undefined) {\n        // Code\n        if (prop.string_data !== '' && prop.string_data !== undefined && prop.string_data !== null)\n            return '<pre class=\"code\"><code>' + prop.string_data.trim() +\n                '</code></pre><div class=\"clearfix\"></div>';\n        return '';\n    } else if (prop.approx !== undefined && prop.main !== undefined) {\n        // SymExpr\n        return prop.main;\n    } else if (prop.constructor == Object) {\n        // General dictionary\n        return '<pre class=\"code\"><code>' + JSON.stringify(prop, undefined, 4) +\n            '</code></pre><div class=\"clearfix\"></div>';\n    } else if (prop.constructor == Array) {\n        // General array\n        let result = '[ ';\n        let first = true;\n        for (const subprop of prop) {\n            if (!first)\n                result += ', ';\n            result += sdfg_property_to_string(subprop, settings);\n            first = false;\n        }\n        return result + ' ]';\n    } else {\n        return prop;\n    }\n}\n\nexport function string_to_sdfg_typeclass(str) {\n    str.replace(/\\s+/g, '');\n\n    if (str === '' || str === 'null')\n        return null;\n\n    if (str.endsWith(')')) {\n        if (str.startsWith('vector(')) {\n            const argstring = str.substring(7, str.length - 1);\n            if (argstring) {\n                const splitidx = argstring.lastIndexOf(',');\n                if (splitidx) {\n                    const dtype = string_to_sdfg_typeclass(\n                        argstring.substring(0, splitidx)\n                    );\n                    const count = argstring.substring(splitidx);\n                    if (dtype && count)\n                        return {\n                            type: 'vector',\n                            dtype: dtype,\n                            elements: count,\n                        };\n                }\n            }\n        } else if (str.startsWith('pointer(')) {\n            const argstring = str.substring(8, str.length - 1);\n            if (argstring)\n                return {\n                    type: 'pointer',\n                    dtype: string_to_sdfg_typeclass(argstring),\n                };\n        } else if (str.startsWith('opaque(')) {\n            const argstring = str.substring(7, str.length - 1);\n            if (argstring)\n                return {\n                    type: 'opaque',\n                    name: argstring,\n                };\n        } else if (str.startsWith('callback(')) {\n            const argstring = str.substring(9, str.length - 1);\n            if (argstring) {\n                const splitidx = argstring.lastIndexOf(',');\n                if (splitidx) {\n                    const cb_argstring = argstring.substring(0, splitidx);\n                    if (cb_argstring.startsWith('[') &&\n                        cb_argstring.endsWith(']')) {\n                        const cb_args_raw = cb_argstring.substring(\n                            1, cb_argstring.length - 1\n                        ).split(',');\n                        const ret_type = string_to_sdfg_typeclass(\n                            argstring.substring(splitidx)\n                        );\n\n                        const cb_args = [];\n                        if (cb_args_raw)\n                            cb_args_raw.forEach(raw_arg => {\n                                cb_args.push(string_to_sdfg_typeclass(raw_arg));\n                            });\n\n                        if (cb_args && ret_type)\n                            return {\n                                type: 'callback',\n                                arguments: cb_args,\n                                returntype: ret_type,\n                            };\n                    }\n                }\n            }\n        }\n    }\n    return str;\n}\n\nexport function sdfg_typeclass_to_string(typeclass) {\n    if (typeclass === undefined || typeclass === null)\n        return 'null';\n\n    if (typeclass.constructor === Object) {\n        if (typeclass.type !== undefined) {\n            switch (typeclass.type) {\n                case 'vector':\n                    if (typeclass.elements !== undefined &&\n                        typeclass.dtype !== undefined)\n                        return 'vector(' + sdfg_typeclass_to_string(\n                            typeclass.dtype\n                        ) + ', ' + typeclass.elements + ')';\n                    break;\n                case 'pointer':\n                    if (typeclass.dtype !== undefined)\n                        return 'pointer(' + sdfg_typeclass_to_string(\n                            typeclass.dtype\n                        ) + ')';\n                    break;\n                case 'opaque':\n                    if (typeclass.name !== undefined)\n                        return 'opaque(' + typeclass.name + ')';\n                    break;\n                case 'callback':\n                    if (typeclass.arguments !== undefined) {\n                        let str = 'callback([';\n                        for (let i = 0; i < typeclass.arguments.length; i++) {\n                            str += sdfg_typeclass_to_string(\n                                typeclass.arguments[i]\n                            );\n                            if (i < typeclass.arguments.length - 1)\n                                str += ', ';\n                        }\n                        str += '], ';\n                        if (typeclass.returntype !== undefined)\n                            str += sdfg_typeclass_to_string(\n                                typeclass.returntype\n                            );\n                        else\n                            str += 'None';\n                        str += ')';\n                        return str;\n                    }\n                    break;\n            }\n        }\n\n        // This is an unknown typeclass, just show the entire JSON.\n        return sdfg_property_to_string(typeclass);\n    }\n\n    // This typeclass already is a regular string.\n    return typeclass;\n}\n\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\n// Recursively parse SDFG, including nested SDFG nodes\nexport function parse_sdfg(sdfg_json: string): unknown {\n    return JSON.parse(sdfg_json, reviver);\n}\n\nexport function stringify_sdfg(sdfg: unknown): string {\n    return JSON.stringify(sdfg, (name, val) => replacer(name, val, sdfg));\n}\n\nfunction reviver(name: string, val: unknown) {\n    if (name == 'sdfg' && val && typeof val === 'string' && val[0] === '{') {\n        return JSON.parse(val, reviver);\n    }\n    return val;\n}\n\nfunction isDict(v: unknown): v is Record<string, unknown> {\n    return typeof v === 'object' && v !== null && !(v instanceof Array) && !(v instanceof Date);\n}\n\nfunction replacer(name: string, val: unknown, orig_sdfg: unknown): unknown {\n    if (val && isDict(val) && val !== orig_sdfg && 'type' in val && val.type === 'SDFG') {\n        return JSON.stringify(val, (n, v) => replacer(n, v, val));\n    }\n    return val;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nimport { SDFGElements } from \"../../renderer/renderer_elements\";\n\nconst { NestedSDFG } = SDFGElements;\n\nexport function recursively_find_graph(graph, graph_id, ns_node = undefined) {\n    if (graph.node(0).sdfg.sdfg_list_id === graph_id) {\n        return {\n            graph: graph,\n            node: ns_node,\n        };\n    } else {\n        const result = {\n            graph: undefined,\n            node: undefined,\n        };\n        for (const state_id of graph.nodes()) {\n            const state = graph.node(state_id);\n            if (state.data.graph !== undefined && state.data.graph !== null)\n                for (const node_id of state.data.graph.nodes()) {\n                    const node = state.data.graph.node(node_id);\n                    if (node instanceof NestedSDFG) {\n                        const search_graph = recursively_find_graph(\n                            node.data.graph, graph_id, node\n                        );\n                        if (search_graph.graph !== undefined) {\n                            return search_graph;\n                        }\n                    }\n                }\n        }\n        return result;\n    }\n}\n\n\nexport function find_exit_for_entry(nodes, entry_node) {\n    for (const n of nodes) {\n        if (n.type.endsWith(\"Exit\") && parseInt(n.scope_entry) == entry_node.id) {\n            return n;\n        }\n    }\n    console.warn(\"Did not find corresponding exit\");\n    return null;\n}\n\n\n/**\n * Return the string UUID for an SDFG graph element.\n *\n * UUIDs have the form of \"G/S/N/E\", where:\n * G = Graph list id\n * S = State ID (-1 for (nested) SDFGs)\n * N = SDFGNode ID (-1 for States, SDFGs, and Edges)\n * E = Edge ID (-1 for States, SDFGs, and Nodes)\n *\n * @param {*} element   Element to generate the UUID for.\n *\n * @returns             String containing the UUID\n */\n export function get_uuid_graph_element(element) {\n    const undefined_val = -1;\n    if (element instanceof State) {\n        return (\n            element.sdfg.sdfg_list_id + '/' +\n            element.id + '/' +\n            undefined_val + '/' +\n            undefined_val\n        );\n    } else if (element instanceof SDFGNode) {\n        return (\n            element.sdfg.sdfg_list_id + '/' +\n            element.parent_id + '/' +\n            element.id + '/' +\n            undefined_val\n        );\n    } else if (element instanceof Edge) {\n        let parent_id = undefined_val;\n        if (element.parent_id !== null && element.parent_id !== undefined)\n            parent_id = element.parent_id;\n        return (\n            element.sdfg.sdfg_list_id + '/' +\n            parent_id + '/' +\n            undefined_val + '/' +\n            element.id\n        );\n    }\n    return (\n        undefined_val + '/' +\n        undefined_val + '/' +\n        undefined_val + '/' +\n        undefined_val\n    );\n}\n\n\nexport function check_and_redirect_edge(edge, drawn_nodes, sdfg_state) {\n    // If destination is not drawn, no need to draw the edge\n    if (!drawn_nodes.has(edge.dst))\n        return null;\n    // If both source and destination are in the graph, draw edge as-is\n    if (drawn_nodes.has(edge.src))\n        return edge;\n\n    // If immediate scope parent node is in the graph, redirect\n    const scope_src = sdfg_state.nodes[edge.src].scope_entry;\n    if (!drawn_nodes.has(scope_src))\n        return null;\n\n    // Clone edge for redirection, change source to parent\n    const new_edge = Object.assign({}, edge);\n    new_edge.src = scope_src;\n\n    return new_edge;\n}\n\nexport function find_graph_element_by_uuid(p_graph, uuid) {\n    const uuid_split = uuid.split('/');\n    \n    const graph_id = Number(uuid_split[0]);\n    const state_id = Number(uuid_split[1]);\n    const node_id = Number(uuid_split[2]);\n    const edge_id = Number(uuid_split[3]);\n    \n    let result = {\n        parent: undefined,\n        element: undefined,\n    };\n    \n    let graph = p_graph;\n    if (graph_id > 0) {\n        const found_graph = recursively_find_graph(graph, graph_id);\n        if (found_graph.graph === undefined)\n            throw new Error();\n\n        graph = found_graph.graph;\n        result = {\n            parent: graph,\n            element: found_graph.node,\n        };\n    }\n    \n    let state = undefined;\n    if (state_id !== -1 && graph !== undefined) {\n        state = graph.node(state_id);\n        result = {\n            parent: graph,\n            element: state,\n        };\n    }\n    \n    if (node_id !== -1 && state !== undefined && state.data.graph !== null) {\n        // Look for a node in a state.\n        result = {\n            parent: state.data.graph,\n            element: state.data.graph.node(node_id),\n        };\n    } else if (edge_id !== -1 && state !== undefined && state.data.graph !== null) {\n        // Look for an edge in a state.\n        result = {\n            parent: state.data.graph,\n            element: state.data.graph.edge(edge_id),\n        };\n    } else if (edge_id !== -1 && state === undefined) {\n        // Look for an inter-state edge.\n        result = {\n            parent: graph,\n            element: graph.edge(edge_id),\n        };\n    }\n    \n    return result;\n}\n\n/**\n * Initializes positioning information on the given element.\n *\n * @param {SDFGElement} elem    The element that gets new positioning information\n * @returns                     The initial positioning information that has been created\n */\nexport function initialize_positioning_info(elem) {\n    let position;\n    if (elem instanceof Edge || elem.type === \"MultiConnectorEdge\") {\n        let points = undefined;\n        if (elem.points)\n            points = Array(elem.points.length);\n\n        position = {\n            points: points,\n            scope_dx: 0,\n            scope_dy: 0\n        };\n\n        for (let i = 0; elem.points && i < elem.points.length; i++)\n            position.points[i] = { dx: 0, dy: 0 };\n    } else {\n        position = { dx: 0, dy: 0, scope_dx: 0, scope_dy: 0 };\n    }\n\n    set_positioning_info(elem, position);\n\n    return position;\n}\n\n/**\n * Sets the positioning information on a given element. Replaces old\n * positioning information.\n * \n * @param {SDFGElement} elem    The element that receives new positioning info\n * @param {*} position          The positioning information\n */\nexport function set_positioning_info(elem, position) {\n    if (elem instanceof State)\n        elem.data.state.attributes.position = position;\n    else if (elem instanceof SDFGNode)\n        elem.data.node.attributes.position = position;\n    else if (elem instanceof Edge)\n        elem.data.attributes.position = position;\n    else if (elem.type === \"MultiConnectorEdge\")\n        elem.attributes.data.attributes.position = position;\n    // Works also for other objects with attributes\n    else if (elem.attributes)\n        elem.attributes.position = position;\n}\n\n/**\n * Finds the positioning information of the given element\n *\n * @param {SDFGElement} elem    The element that contains the information\n * @returns                     The positioning information if available, undefined otherwise\n */\nexport function get_positioning_info(elem) {\n    if (elem instanceof State)\n        return elem.data.state.attributes.position;\n    if (elem instanceof SDFGNode)\n        return elem.data.node.attributes.position;\n    if (elem instanceof Edge)\n        return elem.data.attributes.position;\n    if (elem?.type === \"MultiConnectorEdge\")\n        return elem?.attributes?.data?.attributes?.position;\n    // Works also for other objects with attributes\n    if (elem?.attributes)\n        return elem.attributes.position;\n\n    return undefined;\n}\n\n/**\n * Deletes the positioning information of the given element\n *\n * @param {SDFGElement} elem    The element that contains the information\n */\nexport function delete_positioning_info(elem) {\n    if (elem instanceof State)\n        delete elem.data.state.attributes.position;\n    if (elem instanceof SDFGNode)\n        delete elem.data.node.attributes.position;\n    if (elem instanceof Edge)\n        delete elem.data.attributes.position;\n    if (elem?.type === \"MultiConnectorEdge\")\n        delete elem.attributes.data.attributes.position;\n    // Works also for other objects with attributes\n    if (elem?.attributes)\n        delete elem.attributes.position;\n}\n\n/**\n * Creates a new SDFGElement of the given type and adds it to the state.\n * Returns the new SDFG element on success, otherwise null.\n *\n * @param sdfg      the sdfg that contains the parent state\n * @param elem_type the type of the new element\n * @param state     the parent state\n * @returns         the new element or null when creation failed\n */\nexport function add_elem_to_sdfg(sdfg, elem_type, state) {\n    let new_elem = {};\n    let attributes = {};\n    attributes.in_construction = true;\n    new_elem.attributes = attributes;\n\n    switch (elem_type) {\n        case \"MapEntry\":\n            return null;\n        case \"ConsumeEntry\":\n            return null;\n        case \"Tasklet\":\n            return null;\n        case \"NestedSDFG\":\n            return null;\n        case \"AccessNode\":\n            attributes.access = \"ReadWrite\";\n            attributes.data = \"\";\n            attributes.debuginfo = null;\n            attributes.in_connectors = {};\n            attributes.out_connectors = {};\n            attributes.setzero = false;\n\n            new_elem.id = state.data.state.nodes.length;\n            new_elem.label = \"\";\n            new_elem.scope_entry = null;\n            new_elem.scope_exit = null;\n            new_elem.type = elem_type;\n            break;\n        case \"Stream\":\n            return null;\n        case \"SDFGState\":\n            return null;\n        default:\n            return null;\n    }\n\n    if (elem_type !== \"SDFGState\") {\n        state.data.state.scope_dict['-1'].push(new_elem.id);\n        state.data.state.nodes.push(new_elem);\n    }\n\n    return new_elem;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\n/**\n * Receives a callback that accepts (node, parent graph) and returns a value.\n * This function is invoked recursively per scope (including scope nodes), unless the return\n * value is false, upon which the sub-scope will not be visited.\n * The function also accepts an optional post-subscope callback (same signature as `func`).\n **/\n export function traverse_sdfg_scopes(sdfg, func, post_subscope_func = null) {\n    function scopes_recursive(graph, nodes, processed_nodes = null) {\n        if (processed_nodes === null)\n            processed_nodes = new Set();\n\n        for (const nodeid of nodes) {\n            const node = graph.node(nodeid);\n            if (node === undefined || processed_nodes.has(node.id.toString()))\n                continue;\n\n            // Invoke function\n            const result = func(node, graph);\n\n            // Skip in case of e.g., collapsed nodes\n            if (result !== false) {\n                // Traverse scopes recursively (if scope_dict provided)\n                if (node.type().endsWith('Entry')) {\n                    const state = node.sdfg.nodes[node.parent_id];\n                    if (state.scope_dict[node.id] !== undefined)\n                        scopes_recursive(graph, state.scope_dict[node.id], processed_nodes);\n                }\n\n                // Traverse states or nested SDFGs\n                if (node.data.graph) {\n                    const state = node.data.state;\n                    if (state !== undefined && state.scope_dict[-1] !== undefined)\n                        scopes_recursive(node.data.graph, state.scope_dict[-1]);\n                    else // No scope_dict, traverse all nodes as a flat hierarchy\n                        scopes_recursive(node.data.graph, node.data.graph.nodes());\n                }\n            }\n\n            if (post_subscope_func)\n                post_subscope_func(node, graph);\n\n            processed_nodes.add(node.id.toString());\n        }\n    }\n    scopes_recursive(sdfg, sdfg.nodes());\n}\n\n\n\n/**\n * Returns a partial memlet tree from a given edge, from the root node\n * through all children (without siblings). Calling this function with\n * the root edge returns the entire memlet tree.\n **/\nexport function memlet_tree(graph, edge, root_only = false) {\n    const result = [];\n    const graph_edges = {};\n    graph.edges().forEach(e => {\n        graph_edges[e.name] = e;\n    });\n\n\n    function src(e) {\n        const ge = graph_edges[e.id];\n        return graph.node(ge.v);\n    }\n    function dst(e) {\n        const ge = graph_edges[e.id];\n        return graph.node(ge.w);\n    }\n\n    // Determine direction\n    let propagate_forward = false, propagate_backward = false;\n    if ((edge.src_connector && src(edge) instanceof EntryNode) ||\n        (edge.dst_connector && dst(edge) instanceof EntryNode &&\n            edge.dst_connector.startsWith('IN_')))\n        propagate_forward = true;\n    if ((edge.src_connector && src(edge) instanceof ExitNode) ||\n        (edge.dst_connector && dst(edge) instanceof ExitNode))\n        propagate_backward = true;\n\n    result.push(edge);\n\n    // If either both are false (no scopes involved) or both are true\n    // (invalid SDFG), we return only the current edge as a degenerate tree\n    if (propagate_forward == propagate_backward)\n        return result;\n\n    // Ascend (find tree root) while prepending\n    let curedge = edge;\n    if (propagate_forward) {\n        let source = src(curedge);\n        while (source instanceof EntryNode && curedge && curedge.src_connector) {\n            if (source.attributes().is_collapsed)\n                break;\n\n            const cname = curedge.src_connector.substring(4);  // Remove OUT_\n            curedge = null;\n            graph.inEdges(source.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.dst_connector == 'IN_' + cname)\n                    curedge = ge;\n            });\n            if (curedge) {\n                result.unshift(curedge);\n                source = src(curedge);\n            }\n        }\n    } else if (propagate_backward) {\n        let dest = dst(curedge);\n        while (dest instanceof ExitNode && curedge && curedge.dst_connector) {\n            const cname = curedge.dst_connector.substring(3);  // Remove IN_\n            curedge = null;\n            graph.outEdges(dest.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.src_connector == 'OUT_' + cname)\n                    curedge = ge;\n            });\n            if (curedge) {\n                result.unshift(curedge);\n                dest = dst(curedge);\n            }\n        }\n    }\n\n    if (root_only)\n        return [result[0]];\n\n    // Descend recursively\n    function add_children(edge) {\n        const children = [];\n        if (propagate_forward) {\n            const next_node = dst(edge);\n            if (!(next_node instanceof EntryNode) ||\n                !edge.dst_connector || !edge.dst_connector.startsWith('IN_'))\n                return;\n            if (next_node.attributes().is_collapsed)\n                return;\n            const conn = edge.dst_connector.substring(3);\n            graph.outEdges(next_node.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.src_connector == 'OUT_' + conn) {\n                    children.push(ge);\n                    result.push(ge);\n                }\n            });\n        } else if (propagate_backward) {\n            const next_node = src(edge);\n            if (!(next_node instanceof ExitNode) || !edge.src_connector)\n                return;\n            const conn = edge.src_connector.substring(4);\n            graph.inEdges(next_node.id).forEach(e => {\n                const ge = graph.edge(e);\n                if (ge.dst_connector == 'IN_' + conn) {\n                    children.push(ge);\n                    result.push(ge);\n                }\n            });\n        }\n\n        for (const child of children)\n            add_children(child);\n    }\n\n    // Start from current edge\n    add_children(edge);\n\n    return result;\n}\n\n/**\n * Returns a partial memlet tree from a given edge. It descends into nested SDFGs.\n * @param visited_edges is used to speed up the computation of the memlet trees\n **/\nexport function memlet_tree_nested(sdfg, state, edge, visited_edges = []) {\n    if (visited_edges.includes(edge) || edge.attributes.data.attributes.shortcut) {\n        return [];\n    }\n\n    visited_edges.push(edge);\n\n    let result = [];\n\n    function src(e) {\n        return state.nodes[e.src];\n    }\n    function dst(e) {\n        return state.nodes[e.dst];\n    }\n    function isview(node) {\n        if (node.type == \"AccessNode\") {\n            const nodedesc = sdfg.attributes._arrays[node.attributes.data];\n            return (nodedesc && nodedesc.type === \"View\");\n        }\n        return false;\n    }\n\n    // Determine direction\n    let propagate_forward = false, propagate_backward = false;\n    if ((edge.src_connector && src(edge).type.endsWith(\"Entry\")) ||\n        (edge.dst_connector && dst(edge).type.endsWith(\"Entry\") &&\n            edge.dst_connector.startsWith('IN_')) ||\n        dst(edge).type == \"NestedSDFG\" ||\n        isview(dst(edge)))\n        propagate_forward = true;\n    if ((edge.src_connector && src(edge).type.endsWith(\"Exit\")) ||\n        (edge.dst_connector && dst(edge).type.endsWith(\"Exit\")) ||\n        src(edge).type == \"NestedSDFG\" ||\n        isview(src(edge)))\n        propagate_backward = true;\n\n    result.push(edge);\n\n    // If either both are false (no scopes involved), we \n    // return only the current edge as a degenerate tree\n    if (propagate_forward == propagate_backward && propagate_backward === false)\n        return result;\n\n    // Descend recursively\n    function add_children(edge) {\n        const children = [];\n\n        if (propagate_forward) {\n            const next_node = dst(edge);\n\n            // Descend into nested SDFG\n            if (next_node.type == \"NestedSDFG\") {\n                const name = edge.dst_connector;\n                const nested_sdfg = next_node.attributes.sdfg;\n\n                nested_sdfg.nodes.forEach(nstate => {\n                    nstate.edges.forEach(e => {\n                        const node = nstate.nodes[e.src];\n                        if (node.type == \"AccessNode\" && node.attributes.data === name) {\n                            result = result.concat(memlet_tree_nested(nested_sdfg, nstate, e, visited_edges));\n                        }\n                    });\n                });\n            }\n\n            if (isview(next_node)) {\n                state.edges.forEach(e => {\n                    if (e.src == next_node.id) {\n                        children.push(e);\n                        if (!e.attributes.data.attributes.shortcut) {\n                            result.push(e);\n                        }\n                    }\n                });\n            } else {\n                if (!(next_node.type.endsWith(\"Entry\")) ||\n                    !edge.dst_connector || !edge.dst_connector.startsWith('IN_'))\n                    return;\n                if (next_node.attributes.is_collapsed)\n                    return;\n                const conn = edge.dst_connector.substring(3);\n                state.edges.forEach(e => {\n                    if (e.src == next_node.id && e.src_connector == 'OUT_' + conn) {\n                        children.push(e);\n                        if (!e.attributes.data.attributes.shortcut) {\n                            result.push(e);\n                        }\n                    }\n                });\n            }\n        }\n        if (propagate_backward) {\n            const next_node = src(edge);\n\n            // Descend into nested SDFG\n            if (next_node.type == \"NestedSDFG\") {\n                const name = edge.src_connector;\n                const nested_sdfg = next_node.attributes.sdfg;\n\n                nested_sdfg.nodes.forEach(nstate => {\n                    nstate.edges.forEach(e => {\n                        const node = nstate.nodes[e.dst];\n                        if (node.type == \"AccessNode\" && node.attributes.data == name) {\n                            result = result.concat(memlet_tree_nested(nested_sdfg, nstate, e, visited_edges));\n                        }\n                    });\n                });\n            }\n\n            if (isview(next_node)) {\n                state.edges.forEach(e => {\n                    if (e.dst == next_node.id) {\n                        children.push(e);\n                        result.push(e);\n                    }\n                });\n            } else {\n                if (!(next_node.type.endsWith(\"Exit\")) || !edge.src_connector)\n                    return;\n\n                const conn = edge.src_connector.substring(4);\n                state.edges.forEach(e => {\n                    if (e.dst == next_node.id && e.dst_connector == 'IN_' + conn) {\n                        children.push(e);\n                        result.push(e);\n                    }\n                });\n            }\n        }\n\n        for (const child of children)\n            add_children(child);\n    }\n\n    // Start from current edge\n    add_children(edge);\n\n    return result;\n}\n\n/**\n * Calls memlet_tree_nested for every nested SDFG and its edges and returns a list with all memlet trees.\n * As edges are visited only in one direction (from outer SDFGs to inner SDFGs) a memlet can be split into several\n * arrays.\n */\nexport function memlet_tree_recursive(root_sdfg) {\n    let trees = [];\n    const visited_edges = [];\n\n    root_sdfg.nodes.forEach(state => {\n\n        state.edges.forEach(e => {\n            const tree = memlet_tree_nested(root_sdfg, state, e, visited_edges);\n            if (tree.length > 1) {\n                trees.push(tree);\n            }\n        });\n\n        state.nodes.forEach(n => {\n            if (n.type == \"NestedSDFG\") {\n                const t = memlet_tree_recursive(n.attributes.sdfg);\n                trees = trees.concat(t);\n            }\n        });\n\n    })\n\n    return trees;\n}\n\n/**\n * Returns all memlet trees as sets for the given graph.\n * \n * @param {Graph} root_graph The top level graph.\n */\nexport function memlet_tree_complete(sdfg) {\n    const all_memlet_trees = [];\n    const memlet_trees = memlet_tree_recursive(sdfg);\n\n    // combine trees as memlet_tree_recursive does not necessarily return the complete trees (they might be split into several trees)\n    memlet_trees.forEach(tree => {\n        let common_edge = false;\n        for (const mt of all_memlet_trees) {\n            for (const edge of tree) {\n                if (mt.has(edge)) {\n                    tree.forEach(e => mt.add(e));\n                    common_edge = true;\n                    break;\n                }\n            }\n            if (common_edge)\n                break;\n        }\n        if (!common_edge)\n            all_memlet_trees.push(new Set(tree));\n    });\n\n    return all_memlet_trees;\n}\n","// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.\n\nexport function equals<T>(a: T, b: T): boolean {\n    return JSON.stringify(a) === JSON.stringify(b);\n}\n\n\nexport function deepCopy<T>(obj: T): T {\n    if (typeof obj !== 'object' || obj === null) return obj;\n    if (Array.isArray(obj)) {\n        return obj.map(o => deepCopy(o)) as any;\n    } else {\n        return Object.fromEntries(deepCopy([...Object.entries(obj)])) as any;\n    }\n}\n\n/**\n * Create a DOM element with an optional given ID and class list.\n *\n * If a parent is provided, the element is automatically added as a child.\n *\n * @param {*} type      Element tag (div, span, etc.)\n * @param {*} id        Optional element id\n * @param {*} classList Optional array of class names\n * @param {*} parent    Optional parent element\n *\n * @returns             The created DOM element\n */\nexport function createElement<K extends keyof HTMLElementTagNameMap>(\n    type: K,\n    id = '',\n    classList: string[] = [],\n    parent: Node | undefined = undefined\n): HTMLElementTagNameMap[K] {\n    const element = document.createElement(type);\n    if (id !== '')\n        element.id = id;\n    if (classList !== [])\n        classList.forEach(class_name => {\n            if (!element.classList.contains(class_name))\n                element.classList.add(class_name);\n        });\n    if (parent)\n        parent.appendChild(element);\n    return element;\n}\n\n/**\n * Similar to Object.assign, but skips properties that already exist in `obj`.\n */\nexport function assignIfNotExists<T, E>(obj: T, other: E): T & Omit<E, keyof T> {\n    const o = obj as any;\n    for (const [key, val] of Object.entries(other)) {\n        if (!(key in obj)) o[key] = val;\n    }\n    return o;\n}\n","/**\n * @license Complex.js v2.0.12 11/02/2016\n *\n * Copyright (c) 2016, 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.\n   *\n   * @param {number} x\n   * @returns {number} cos(x) - 1\n   */\n\n  var cosm1 = function(x) {\n    var limit = Math.PI/4;\n    if (x < -limit || x > limit) {\n      return (Math.cos(x) - 1.0);\n    }\n\n    var xx = x * x;\n    return xx *\n      (-0.5 + xx *\n        (1/24 + xx *\n          (-1/720 + xx *\n            (1/40320 + xx *\n              (-1/3628800 + xx *\n                (1/4790014600 + xx *\n                  (-1/87178291200 + xx *\n                    (1/20922789888000)\n                  )\n                )\n              )\n            )\n          )\n        )\n      )\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    return Math.log(a / Math.cos(Math.atan2(b, a)));\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) {\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(c) = (e^b - e^(-b)) / (2i)\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^b + e^(-b)) / 2\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(c) = (e^(ci) - e^(-ci)) / (i(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 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 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-16;\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","/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"./lib/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  var fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  _.forEach(fas, function(e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return function(e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (_.has(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function(e) {\n      if (_.has(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  _.forEach(g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  _.forEach(g.edges(), function(e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      _.forEach(children, dfs);\n    }\n\n    if (_.has(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (_.has(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (_.has(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n","/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nmodule.exports = List;\n\nfunction List() {\n  var sentinel = {};\n  sentinel._next = sentinel._prev = sentinel;\n  this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n  var sentinel = this._sentinel;\n  var entry = sentinel._prev;\n  if (entry !== sentinel) {\n    unlink(entry);\n    return entry;\n  }\n};\n\nList.prototype.enqueue = function(entry) {\n  var sentinel = this._sentinel;\n  if (entry._prev && entry._next) {\n    unlink(entry);\n  }\n  entry._next = sentinel._next;\n  sentinel._next._prev = entry;\n  sentinel._next = entry;\n  entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n  var strs = [];\n  var sentinel = this._sentinel;\n  var curr = sentinel._prev;\n  while (curr !== sentinel) {\n    strs.push(JSON.stringify(curr, filterOutLinks));\n    curr = curr._prev;\n  }\n  return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  var layerMatrix = util.buildLayerMatrix(g);\n\n  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  _.forEach(g.nodes(), function(v) {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  _.forEach(g.edges(), function(e) {\n    h.setEdge(e.v, e.w, {}, e.name);\n  });\n\n  _.forEach(layerMatrix, function(layer, i) {\n    var layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    _.reduce(layer, function(u, v) {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n","/* global window */\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n  try {\n    graphlib = require(\"graphlib\");\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!graphlib) {\n  graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(_.map(results, function(e) {\n    return g.outEdges(e.v, e.w);\n  }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function(v) {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function(e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function(v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", function() {\n    var layoutGraph = \n      time(\"  buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n    time(\"  runLayout\",        function() { runLayout(layoutGraph, time); });\n    time(\"  updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n  });\n}\n\nfunction runLayout(g, time) {\n  time(\"    makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n  time(\"    removeSelfEdges\",        function() { removeSelfEdges(g); });\n  time(\"    acyclic\",                function() { acyclic.run(g); });\n  time(\"    nestingGraph.run\",       function() { nestingGraph.run(g); });\n  time(\"    rank\",                   function() { rank(util.asNonCompoundGraph(g)); });\n  time(\"    injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n  time(\"    removeEmptyRanks\",       function() { removeEmptyRanks(g); });\n  time(\"    nestingGraph.cleanup\",   function() { nestingGraph.cleanup(g); });\n  time(\"    normalizeRanks\",         function() { normalizeRanks(g); });\n  time(\"    assignRankMinMax\",       function() { assignRankMinMax(g); });\n  time(\"    removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n  time(\"    normalize.run\",          function() { normalize.run(g); });\n  time(\"    parentDummyChains\",      function() { parentDummyChains(g); });\n  time(\"    addBorderSegments\",      function() { addBorderSegments(g); });\n  time(\"    order\",                  function() { order(g); });\n  time(\"    insertSelfEdges\",        function() { insertSelfEdges(g); });\n  time(\"    adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n  time(\"    position\",               function() { position(g); });\n  time(\"    positionSelfEdges\",      function() { positionSelfEdges(g); });\n  time(\"    removeBorderNodes\",      function() { removeBorderNodes(g); });\n  time(\"    normalize.undo\",         function() { normalize.undo(g); });\n  time(\"    fixupEdgeLabelCoords\",   function() { fixupEdgeLabelCoords(g); });\n  time(\"    undoCoordinateSystem\",   function() { coordinateSystem.undo(g); });\n  time(\"    translateGraph\",         function() { translateGraph(g); });\n  time(\"    assignNodeIntersects\",   function() { assignNodeIntersects(g); });\n  time(\"    reversePoints\",          function() { reversePointsForReversedEdges(g); });\n  time(\"    acyclic.undo\",           function() { acyclic.undo(g); });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  _.forEach(inputGraph.nodes(), function(v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (_.has(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(_.merge({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    _.pick(graph, graphAttrs)));\n\n  _.forEach(inputGraph.nodes(), function(v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, _.merge({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      _.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = _.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, function(p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (_.has(edge, \"x\")) { edge.x -= minX; }\n    if (_.has(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  _.forEach(g.nodes(), function(v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(_.last(node.borderLeft));\n      var r = g.node(_.last(node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  _.forEach(g.nodes(), function(v) {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  _.forEach(layers, function(layer) {\n    var orderShift = 0;\n    _.forEach(layer, function(v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      _.forEach(node.selfEdges, function(selfEdge) {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  _.forEach(attrs, function(v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\n}\n","/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      cloneDeep: require(\"lodash/cloneDeep\"),\n      constant: require(\"lodash/constant\"),\n      defaults: require(\"lodash/defaults\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      find: require(\"lodash/find\"),\n      flatten: require(\"lodash/flatten\"),\n      forEach: require(\"lodash/forEach\"),\n      forIn: require(\"lodash/forIn\"),\n      has:  require(\"lodash/has\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      last: require(\"lodash/last\"),\n      map: require(\"lodash/map\"),\n      mapValues: require(\"lodash/mapValues\"),\n      max: require(\"lodash/max\"),\n      merge: require(\"lodash/merge\"),\n      min: require(\"lodash/min\"),\n      minBy: require(\"lodash/minBy\"),\n      now: require(\"lodash/now\"),\n      pick: require(\"lodash/pick\"),\n      range: require(\"lodash/range\"),\n      reduce: require(\"lodash/reduce\"),\n      sortBy: require(\"lodash/sortBy\"),\n      uniqueId: require(\"lodash/uniqueId\"),\n      values: require(\"lodash/values\"),\n      zipObject: require(\"lodash/zipObject\"),\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  cleanup: cleanup\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  var depths = treeDepths(g);\n  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  _.forEach(g.children(), function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = util.addBorderNode(g, \"_bt\");\n  var bottom = util.addBorderNode(g, \"_bb\");\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  _.forEach(children, function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      _.forEach(children, function(child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  _.forEach(g.children(), function(v) { dfs(v, 1); });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(g.edges(), function(acc, e) {\n    return acc + g.edge(e).weight;\n  }, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n}\n\nfunction normalizeEdge(g, e) {\n  var v = e.v;\n  var vRank = g.node(v).rank;\n  var w = e.w;\n  var wRank = g.node(w).rank;\n  var name = e.name;\n  var edgeLabel = g.edge(e);\n  var labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  var dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var origLabel = node.edgeLabel;\n    var w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  var prev = {},\n    rootPrev;\n\n  _.forEach(vs, function(v) {\n    var child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      _.each(children, function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = barycenter;\n\nfunction barycenter(g, movable) {\n  return _.map(movable, function(v) {\n    var inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      var result = _.reduce(inV, function(acc, e) {\n        var edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n  var root = createRootNode(g),\n    result = new Graph({ compound: true }).setGraph({ root: root })\n      .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      _.forEach(g[relationship](v), function(e) {\n        var u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = !_.isUndefined(edge) ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (_.has(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = _.uniqueId(\"_root\"))));\n  return v;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  var cc = 0;\n  for (var i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  var southPos = _.zipObject(southLayer,\n    _.map(southLayer, function (v, i) { return i; }));\n  var southEntries = _.flatten(_.map(northLayer, function(v) {\n    return _.sortBy(_.map(g.outEdges(v), function(e) {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }), \"pos\");\n  }), true);\n\n  // Build the accumulator tree\n  var firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  var treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  var tree = _.map(new Array(treeSize), function() { return 0; });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  _.forEach(southEntries.forEach(function(entry) {\n    var index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    var weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  }));\n\n  return cc;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar initOrder = require(\"./init-order\");\nvar crossCount = require(\"./cross-count\");\nvar sortSubgraph = require(\"./sort-subgraph\");\nvar buildLayerGraph = require(\"./build-layer-graph\");\nvar addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g) {\n  var maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  var layering = initOrder(g);\n  assignOrder(g, layering);\n\n  var bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    var cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = _.cloneDeep(layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return _.map(ranks, function(rank) {\n    return buildLayerGraph(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  var cg = new Graph();\n  _.forEach(layerGraphs, function(lg) {\n    var root = lg.graph().root;\n    var sorted = sortSubgraph(lg, root, cg, biasRight);\n    _.forEach(sorted.vs, function(v, i) {\n      lg.node(v).order = i;\n    });\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, i) {\n      g.node(v).order = i;\n    });\n  });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  var visited = {};\n  var simpleNodes = _.filter(g.nodes(), function(v) {\n    return !g.children(v).length;\n  });\n  var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n  var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    var node = g.node(v);\n    layers[node.rank].push(v);\n    _.forEach(g.successors(v), dfs);\n  }\n\n  var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n  _.forEach(orderedVs, dfs);\n\n  return layers;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  var mappedEntries = {};\n  _.forEach(entries, function(entry, i) {\n    var tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (!_.isUndefined(entry.barycenter)) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  _.forEach(cg.edges(), function(e) {\n    var entryV = mappedEntries[e.v];\n    var entryW = mappedEntries[e.w];\n    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  var sourceSet = _.filter(mappedEntries, function(entry) {\n    return !entry.indegree;\n  });\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  var entries = [];\n\n  function handleIn(vEntry) {\n    return function(uEntry) {\n      if (uEntry.merged) {\n        return;\n      }\n      if (_.isUndefined(uEntry.barycenter) ||\n          _.isUndefined(vEntry.barycenter) ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return function(wEntry) {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    var entry = sourceSet.pop();\n    entries.push(entry);\n    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n    _.forEach(entry.out, handleOut(entry));\n  }\n\n  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n    function(entry) {\n      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n    });\n\n}\n\nfunction mergeEntries(target, source) {\n  var sum = 0;\n  var weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n","var _ = require(\"../lodash\");\nvar barycenter = require(\"./barycenter\");\nvar resolveConflicts = require(\"./resolve-conflicts\");\nvar sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  var movable = g.children(v);\n  var node = g.node(v);\n  var bl = node ? node.borderLeft : undefined;\n  var br = node ? node.borderRight: undefined;\n  var subgraphs = {};\n\n  if (bl) {\n    movable = _.filter(movable, function(w) {\n      return w !== bl && w !== br;\n    });\n  }\n\n  var barycenters = barycenter(g, movable);\n  _.forEach(barycenters, function(entry) {\n    if (g.children(entry.v).length) {\n      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (_.has(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  var entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  var result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = _.flatten([bl, result.vs, br], true);\n    if (g.predecessors(bl).length) {\n      var blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!_.has(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  _.forEach(entries, function(entry) {\n    entry.vs = _.flatten(entry.vs.map(function(v) {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    }), true);\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!_.isUndefined(target.barycenter)) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n","var _ = require(\"../lodash\");\nvar util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function(entry) {\n    return _.has(entry, \"barycenter\");\n  });\n  var sortable = parts.lhs,\n    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  _.forEach(sortable, function (entry) {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  var result = { vs: _.flatten(vs, true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  var last;\n  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return function(entryV, entryW) {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n","var _ = require(\"./lodash\");\n\nmodule.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  var postorderNums = postorder(g);\n\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var edgeObj = node.edgeObj;\n    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    var path = pathData.path;\n    var lca = pathData.lca;\n    var pathIdx = 0;\n    var pathV = path[pathIdx];\n    var ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  var vPath = [];\n  var wPath = [];\n  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  var parent;\n  var lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  var result = {};\n  var lim = 0;\n\n  function dfs(v) {\n    var low = lim;\n    _.forEach(g.children(v), dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  _.forEach(g.children(), dfs);\n\n  return result;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = _.last(layer);\n\n    _.forEach(layer, function(v, i) {\n      var w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n          _.forEach(g.predecessors(scanNode), function(u) {\n            var uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  var conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    var v;\n    _.forEach(_.range(southPos, southEnd), function(i) {\n      v = south[i];\n      if (g.node(v).dummy) {\n        _.forEach(g.predecessors(v), function(u) {\n          var uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    var prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    _.forEach(south, function(v, southLookahead) {\n      if (g.node(v).dummy === \"border\") {\n        var predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return _.find(g.predecessors(v), function(u) {\n      return g.node(u).dummy;\n    });\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  var conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return _.has(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  var root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, order) {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  _.forEach(layering, function(layer) {\n    var prevIdx = -1;\n    _.forEach(layer, function(v) {\n      var ws = neighborFn(v);\n      if (ws.length) {\n        ws = _.sortBy(ws, function(w) { return pos[w]; });\n        var mp = (ws.length - 1) / 2;\n        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          var w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  var xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    var stack = blockG.nodes();\n    var elem = stack.pop();\n    var visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    var min = blockG.outEdges(elem).reduce(function(acc, e) {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    var node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  _.forEach(align, function(v) {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  var blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  _.forEach(layering, function(layer) {\n    var u;\n    _.forEach(layer, function(v) {\n      var vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return _.minBy(_.values(xss), function (xs) {\n    var max = Number.NEGATIVE_INFINITY;\n    var min = Number.POSITIVE_INFINITY;\n\n    _.forIn(xs, function (x, v) {\n      var halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  var alignToVals = _.values(alignTo),\n    alignToMin = _.min(alignToVals),\n    alignToMax = _.max(alignToVals);\n\n  _.forEach([\"u\", \"d\"], function(vert) {\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      var alignment = vert + horiz,\n        xs = xss[alignment],\n        delta;\n      if (xs === alignTo) return;\n\n      var xsVals = _.values(xs);\n      delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n      if (delta) {\n        xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return _.mapValues(xss.ul, function(ignore, v) {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      var xs = _.sortBy(_.map(xss, v));\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  var layering = util.buildLayerMatrix(g);\n  var conflicts = _.merge(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  var xss = {};\n  var adjustedLayering;\n  _.forEach([\"u\", \"d\"], function(vert) {\n    adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      if (horiz === \"r\") {\n        adjustedLayering = _.map(adjustedLayering, function(inner) {\n          return _.values(inner).reverse();\n        });\n      }\n\n      var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      var xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = _.mapValues(xs, function(x) { return -x; });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  var smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return function(g, v, w) {\n    var vLabel = g.node(v);\n    var wLabel = g.node(w);\n    var sum = 0;\n    var delta;\n\n    sum += vLabel.width / 2;\n    if (_.has(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (_.has(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar util = require(\"../util\");\nvar positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  _.forEach(positionX(g), function(x, v) {\n    g.node(v).x = x;\n  });\n}\n\nfunction positionY(g) {\n  var layering = util.buildLayerMatrix(g);\n  var rankSep = g.graph().ranksep;\n  var prevY = 0;\n  _.forEach(layering, function(layer) {\n    var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n    _.forEach(layer, function(v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    _.forEach(g.nodeEdges(v), function(e) {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  _.forEach(t.nodes(), dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  return _.minBy(g.edges(), function(e) {\n    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n      return slack(g, e);\n    }\n  });\n}\n\nfunction shiftRanks(t, g, delta) {\n  _.forEach(t.nodes(), function(v) {\n    g.node(v).rank += delta;\n  });\n}\n","\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"../graphlib\").alg.preorder;\nvar postorder = require(\"../graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  _.forEach(vs, function(v) {\n    assignCutValue(t, g, v);\n  });\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  _.forEach(g.nodeEdges(child), function(e) {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  _.forEach(tree.neighbors(v), function(w) {\n    if (!_.has(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return _.find(tree.edges(), function(e) {\n    return tree.edge(e).cutvalue < 0;\n  });\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = _.filter(g.edges(), function(edge) {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return _.minBy(candidates, function(edge) { return slack(g, edge); });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  _.forEach(vs, function(v) {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (_.has(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = _.min(_.map(g.outEdges(v), function(e) {\n      return dfs(e.w) - g.edge(e).minlen;\n    }));\n\n    if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n        rank === undefined || // return value of _.map([]) for Lodash 4\n        rank === null) { // return value of _.map([null])\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  _.forEach(g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","/* eslint \"no-console\": off */\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  addDummyNode: addDummyNode,\n  simplify: simplify,\n  asNonCompoundGraph: asNonCompoundGraph,\n  successorWeights: successorWeights,\n  predecessorWeights: predecessorWeights,\n  intersectRect: intersectRect,\n  buildLayerMatrix: buildLayerMatrix,\n  normalizeRanks: normalizeRanks,\n  removeEmptyRanks: removeEmptyRanks,\n  addBorderNode: addBorderNode,\n  maxRank: maxRank,\n  partition: partition,\n  time: time,\n  notime: notime\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = _.uniqueId(name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new Graph().setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  _.forEach(g.edges(), function(e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var sucs = {};\n    _.forEach(g.outEdges(v), function(e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var preds = {};\n    _.forEach(g.inEdges(v), function(e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!_.isUndefined(rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (_.has(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n  var layers = [];\n  _.forEach(g.nodes(), function(v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  _.forEach(layers, function(vs, i) {\n    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      _.forEach(vs, function(v) { g.node(v).rank += delta; });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n  return _.max(_.map(g.nodes(), function(v) {\n    var rank = g.node(v).rank;\n    if (!_.isUndefined(rank)) {\n      return rank;\n    }\n  }));\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  _.forEach(collection, function(value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = _.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n","module.exports = \"0.8.5\";\n",";(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js v10.2.1\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js\r\n   *  Copyright (c) 2020 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\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 = { name: '[object Decimal]' };\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue             abs\r\n   *  ceil\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\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  /*\r\n  // Add aliases to match BigDecimal method names.\r\n  // P.add = P.plus;\r\n  P.subtract = P.minus;\r\n  P.multiply = P.times;\r\n  P.divide = P.div;\r\n  P.remainder = P.mod;\r\n  P.compareTo = P.cmp;\r\n  P.negate = P.neg;\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, y,\r\n      len = x.d.length;\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    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 === '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) return taylorSeries(Ctor, 2, x, x);\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   *  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   *  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   * 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 (v instanceof Decimal) {\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.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.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.name === '[object Decimal]' || 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 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\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","\"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};","/**\n * @license Fraction.js v4.0.12 09/09/2015\n * http://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2015, 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 createError(name) {\n\n    function errorConstructor() {\n      var temp = Error.apply(this, arguments);\n      temp['name'] = this['name'] = name;\n      this['stack'] = temp['stack'];\n      this['message'] = temp['message'];\n    }\n\n    /**\n     * Error constructor\n     *\n     * @constructor\n     */\n    function IntermediateInheritor() { }\n    IntermediateInheritor.prototype = Error.prototype;\n    errorConstructor.prototype = new IntermediateInheritor();\n\n    return errorConstructor;\n  }\n\n  var DivisionByZero = Fraction['DivisionByZero'] = createError('DivisionByZero');\n  var InvalidParameter = Fraction['InvalidParameter'] = createError('InvalidParameter');\n\n  function assign(n, s) {\n\n    if (isNaN(n = parseInt(n, 10))) {\n      throwInvalidParam();\n    }\n    return n * s;\n  }\n\n  function throwInvalidParam() {\n    throw new InvalidParameter();\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    } 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              throwInvalidParam();\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              throwInvalidParam();\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          throwInvalidParam();\n      }\n\n    if (d === 0) {\n      throw new 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    if (!(this instanceof Fraction)) {\n      return new Fraction(a, b);\n    }\n\n    parse(a, b);\n\n    if (Fraction['REDUCE']) {\n      a = gcd(P[\"d\"], P[\"n\"]); // Abuse a\n    } else {\n      a = 1;\n    }\n\n    this[\"s\"] = P[\"s\"];\n    this[\"n\"] = P[\"n\"] / a;\n    this[\"d\"] = P[\"d\"] / a;\n  }\n\n  /**\n   * Boolean global variable to be able to disable automatic reduction of the fraction\n   *\n   */\n  Fraction['REDUCE'] = 1;\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 new Fraction(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 new Fraction(-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 new Fraction(\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 new Fraction(\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 new Fraction(\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 new Fraction(\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 new Fraction(this);\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 new Fraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n      }\n\n      parse(a, b);\n      if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n        Fraction(0, 0); // Throw 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 new Fraction(\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 new Fraction(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 new Fraction;\n      }\n      return new Fraction(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 new Fraction(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 new Fraction(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 new Fraction(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 new Fraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n    },\n\n    /**\n     * Calculates the fraction to some integer exponent\n     *\n     * Ex: new Fraction(-1,2).pow(-3) => -8\n     */\n    \"pow\": function(m) {\n\n      if (m < 0) {\n        return new Fraction(Math.pow(this['s'] * this[\"d\"], -m), Math.pow(this[\"n\"], -m));\n      } else {\n        return new Fraction(Math.pow(this['s'] * this[\"n\"], m), Math.pow(this[\"d\"], m));\n      }\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      // First naive implementation, needs improvement\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return this;\n      }\n\n      var cont = this['abs']()['toContinued']();\n\n      eps = eps || 0.001;\n\n      function rec(a) {\n        if (a.length === 1)\n          return new Fraction(a[0]);\n        return rec(a.slice(1))['inverse']()['add'](a[0]);\n      }\n\n      for (var i = 0; i < cont.length; i++) {\n        var tmp = rec(cont.slice(0, i + 1));\n        if (tmp['sub'](this['abs']())['abs']().valueOf() < eps) {\n          return tmp['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() => \"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 g;\n      var N = this[\"n\"];\n      var D = this[\"d\"];\n\n      if (isNaN(N) || isNaN(D)) {\n        return \"NaN\";\n      }\n\n      if (!Fraction['REDUCE']) {\n        g = gcd(N, D);\n        N /= g;\n        D /= g;\n      }\n\n      dec = dec || 15; // 15 = decimal places when no repitation\n\n      var cycLen = cycleLen(N, D); // Cycle length\n      var cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n      var str = this['s'] === -1 ? \"-\" : \"\";\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","/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (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 lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n","var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    _.each(g.successors(v), dfs);\n    _.each(g.predecessors(v), dfs);\n  }\n\n  _.each(g.nodes(), function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n  if (!_.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n  var acc = [];\n  var visited = {};\n  _.each(vs, function(v) {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    doDfs(g, v, order === \"post\", visited, navigation, acc);\n  });\n  return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!_.has(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) { acc.push(v); }\n    _.each(navigation(v), function(w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) { acc.push(v); }\n  }\n}\n","var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return _.transform(g.nodes(), function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n  }, {});\n}\n","var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function(edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function(v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n","var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return _.filter(tarjan(g), function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function(v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function(w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function(edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function(k) {\n    var rowK = results[k];\n    nodes.forEach(function(i) {\n      var rowI = results[i];\n      nodes.forEach(function(j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n","module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n  var result = new Graph();\n  var parents = {};\n  var pq = new PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  _.each(g.nodes(), function(v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (_.has(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error(\"Input graph is not connected: \" + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++\n    };\n    stack.push(v);\n\n    g.successors(v).forEach(function(w) {\n      if (!_.has(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function(v) {\n    if (!_.has(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (_.has(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!_.has(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      _.each(g.predecessors(node), visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  _.each(g.sinks(), visit);\n\n  if (_.size(visited) !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing","var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nfunction PriorityQueue() {\n  this._arr = [];\n  this._keyIndices = {};\n}\n\n/**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\nPriorityQueue.prototype.size = function() {\n  return this._arr.length;\n};\n\n/**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\nPriorityQueue.prototype.keys = function() {\n  return this._arr.map(function(x) { return x.key; });\n};\n\n/**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\nPriorityQueue.prototype.has = function(key) {\n  return _.has(this._keyIndices, key);\n};\n\n/**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\nPriorityQueue.prototype.priority = function(key) {\n  var index = this._keyIndices[key];\n  if (index !== undefined) {\n    return this._arr[index].priority;\n  }\n};\n\n/**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\nPriorityQueue.prototype.min = function() {\n  if (this.size() === 0) {\n    throw new Error(\"Queue underflow\");\n  }\n  return this._arr[0].key;\n};\n\n/**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\nPriorityQueue.prototype.add = function(key, priority) {\n  var keyIndices = this._keyIndices;\n  key = String(key);\n  if (!_.has(keyIndices, key)) {\n    var arr = this._arr;\n    var index = arr.length;\n    keyIndices[key] = index;\n    arr.push({key: key, priority: priority});\n    this._decrease(index);\n    return true;\n  }\n  return false;\n};\n\n/**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\nPriorityQueue.prototype.removeMin = function() {\n  this._swap(0, this._arr.length - 1);\n  var min = this._arr.pop();\n  delete this._keyIndices[min.key];\n  this._heapify(0);\n  return min.key;\n};\n\n/**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\nPriorityQueue.prototype.decrease = function(key, priority) {\n  var index = this._keyIndices[key];\n  if (priority > this._arr[index].priority) {\n    throw new Error(\"New priority is greater than current priority. \" +\n        \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n  }\n  this._arr[index].priority = priority;\n  this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n  var arr = this._arr;\n  var l = 2 * i;\n  var r = l + 1;\n  var largest = i;\n  if (l < arr.length) {\n    largest = arr[l].priority < arr[largest].priority ? l : largest;\n    if (r < arr.length) {\n      largest = arr[r].priority < arr[largest].priority ? r : largest;\n    }\n    if (largest !== i) {\n      this._swap(i, largest);\n      this._heapify(largest);\n    }\n  }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n  var arr = this._arr;\n  var priority = arr[index].priority;\n  var parent;\n  while (index !== 0) {\n    parent = index >> 1;\n    if (arr[parent].priority < priority) {\n      break;\n    }\n    this._swap(index, parent);\n    index = parent;\n  }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n  var arr = this._arr;\n  var keyIndices = this._keyIndices;\n  var origArrI = arr[i];\n  var origArrJ = arr[j];\n  arr[i] = origArrJ;\n  arr[j] = origArrI;\n  keyIndices[origArrJ.key] = i;\n  keyIndices[origArrI.key] = j;\n};\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n  this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n  this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n  this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n  // Label for the graph itself\n  this._label = undefined;\n\n  // Defaults to be set when creating a new node\n  this._defaultNodeLabelFn = _.constant(undefined);\n\n  // Defaults to be set when creating a new edge\n  this._defaultEdgeLabelFn = _.constant(undefined);\n\n  // v -> label\n  this._nodes = {};\n\n  if (this._isCompound) {\n    // v -> parent\n    this._parent = {};\n\n    // v -> children\n    this._children = {};\n    this._children[GRAPH_NODE] = {};\n  }\n\n  // v -> edgeObj\n  this._in = {};\n\n  // u -> v -> Number\n  this._preds = {};\n\n  // v -> edgeObj\n  this._out = {};\n\n  // v -> w -> Number\n  this._sucs = {};\n\n  // e -> edgeObj\n  this._edgeObjs = {};\n\n  // e -> label\n  this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\n\n/* === Graph functions ========= */\n\nGraph.prototype.isDirected = function() {\n  return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n  return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n  return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n  this._label = label;\n  return this;\n};\n\nGraph.prototype.graph = function() {\n  return this._label;\n};\n\n\n/* === Node functions ========== */\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultNodeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.nodeCount = function() {\n  return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n  return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._in[v]);\n  });\n};\n\nGraph.prototype.sinks = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._out[v]);\n  });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n  var args = arguments;\n  var self = this;\n  _.each(vs, function(v) {\n    if (args.length > 1) {\n      self.setNode(v, value);\n    } else {\n      self.setNode(v);\n    }\n  });\n  return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n  if (_.has(this._nodes, v)) {\n    if (arguments.length > 1) {\n      this._nodes[v] = value;\n    }\n    return this;\n  }\n\n  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n  if (this._isCompound) {\n    this._parent[v] = GRAPH_NODE;\n    this._children[v] = {};\n    this._children[GRAPH_NODE][v] = true;\n  }\n  this._in[v] = {};\n  this._preds[v] = {};\n  this._out[v] = {};\n  this._sucs[v] = {};\n  ++this._nodeCount;\n  return this;\n};\n\nGraph.prototype.node = function(v) {\n  return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n  return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode =  function(v) {\n  var self = this;\n  if (_.has(this._nodes, v)) {\n    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n    delete this._nodes[v];\n    if (this._isCompound) {\n      this._removeFromParentsChildList(v);\n      delete this._parent[v];\n      _.each(this.children(v), function(child) {\n        self.setParent(child);\n      });\n      delete this._children[v];\n    }\n    _.each(_.keys(this._in[v]), removeEdge);\n    delete this._in[v];\n    delete this._preds[v];\n    _.each(_.keys(this._out[v]), removeEdge);\n    delete this._out[v];\n    delete this._sucs[v];\n    --this._nodeCount;\n  }\n  return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n  if (!this._isCompound) {\n    throw new Error(\"Cannot set parent in a non-compound graph\");\n  }\n\n  if (_.isUndefined(parent)) {\n    parent = GRAPH_NODE;\n  } else {\n    // Coerce parent to string\n    parent += \"\";\n    for (var ancestor = parent;\n      !_.isUndefined(ancestor);\n      ancestor = this.parent(ancestor)) {\n      if (ancestor === v) {\n        throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n                        \" would create a cycle\");\n      }\n    }\n\n    this.setNode(parent);\n  }\n\n  this.setNode(v);\n  this._removeFromParentsChildList(v);\n  this._parent[v] = parent;\n  this._children[parent][v] = true;\n  return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n  delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n  if (this._isCompound) {\n    var parent = this._parent[v];\n    if (parent !== GRAPH_NODE) {\n      return parent;\n    }\n  }\n};\n\nGraph.prototype.children = function(v) {\n  if (_.isUndefined(v)) {\n    v = GRAPH_NODE;\n  }\n\n  if (this._isCompound) {\n    var children = this._children[v];\n    if (children) {\n      return _.keys(children);\n    }\n  } else if (v === GRAPH_NODE) {\n    return this.nodes();\n  } else if (this.hasNode(v)) {\n    return [];\n  }\n};\n\nGraph.prototype.predecessors = function(v) {\n  var predsV = this._preds[v];\n  if (predsV) {\n    return _.keys(predsV);\n  }\n};\n\nGraph.prototype.successors = function(v) {\n  var sucsV = this._sucs[v];\n  if (sucsV) {\n    return _.keys(sucsV);\n  }\n};\n\nGraph.prototype.neighbors = function(v) {\n  var preds = this.predecessors(v);\n  if (preds) {\n    return _.union(preds, this.successors(v));\n  }\n};\n\nGraph.prototype.isLeaf = function (v) {\n  var neighbors;\n  if (this.isDirected()) {\n    neighbors = this.successors(v);\n  } else {\n    neighbors = this.neighbors(v);\n  }\n  return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n  var copy = new this.constructor({\n    directed: this._isDirected,\n    multigraph: this._isMultigraph,\n    compound: this._isCompound\n  });\n\n  copy.setGraph(this.graph());\n\n  var self = this;\n  _.each(this._nodes, function(value, v) {\n    if (filter(v)) {\n      copy.setNode(v, value);\n    }\n  });\n\n  _.each(this._edgeObjs, function(e) {\n    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n      copy.setEdge(e, self.edge(e));\n    }\n  });\n\n  var parents = {};\n  function findParent(v) {\n    var parent = self.parent(v);\n    if (parent === undefined || copy.hasNode(parent)) {\n      parents[v] = parent;\n      return parent;\n    } else if (parent in parents) {\n      return parents[parent];\n    } else {\n      return findParent(parent);\n    }\n  }\n\n  if (this._isCompound) {\n    _.each(copy.nodes(), function(v) {\n      copy.setParent(v, findParent(v));\n    });\n  }\n\n  return copy;\n};\n\n/* === Edge functions ========== */\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultEdgeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.edgeCount = function() {\n  return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n  return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n  var self = this;\n  var args = arguments;\n  _.reduce(vs, function(v, w) {\n    if (args.length > 1) {\n      self.setEdge(v, w, value);\n    } else {\n      self.setEdge(v, w);\n    }\n    return w;\n  });\n  return this;\n};\n\n/*\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n */\nGraph.prototype.setEdge = function() {\n  var v, w, name, value;\n  var valueSpecified = false;\n  var arg0 = arguments[0];\n\n  if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n    v = arg0.v;\n    w = arg0.w;\n    name = arg0.name;\n    if (arguments.length === 2) {\n      value = arguments[1];\n      valueSpecified = true;\n    }\n  } else {\n    v = arg0;\n    w = arguments[1];\n    name = arguments[3];\n    if (arguments.length > 2) {\n      value = arguments[2];\n      valueSpecified = true;\n    }\n  }\n\n  v = \"\" + v;\n  w = \"\" + w;\n  if (!_.isUndefined(name)) {\n    name = \"\" + name;\n  }\n\n  var e = edgeArgsToId(this._isDirected, v, w, name);\n  if (_.has(this._edgeLabels, e)) {\n    if (valueSpecified) {\n      this._edgeLabels[e] = value;\n    }\n    return this;\n  }\n\n  if (!_.isUndefined(name) && !this._isMultigraph) {\n    throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n  }\n\n  // It didn't exist, so we need to create it.\n  // First ensure the nodes exist.\n  this.setNode(v);\n  this.setNode(w);\n\n  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n  // Ensure we add undirected edges in a consistent way.\n  v = edgeObj.v;\n  w = edgeObj.w;\n\n  Object.freeze(edgeObj);\n  this._edgeObjs[e] = edgeObj;\n  incrementOrInitEntry(this._preds[w], v);\n  incrementOrInitEntry(this._sucs[v], w);\n  this._in[w][e] = edgeObj;\n  this._out[v][e] = edgeObj;\n  this._edgeCount++;\n  return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  var edge = this._edgeObjs[e];\n  if (edge) {\n    v = edge.v;\n    w = edge.w;\n    delete this._edgeLabels[e];\n    delete this._edgeObjs[e];\n    decrementOrRemoveEntry(this._preds[w], v);\n    decrementOrRemoveEntry(this._sucs[v], w);\n    delete this._in[w][e];\n    delete this._out[v][e];\n    this._edgeCount--;\n  }\n  return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n  var inV = this._in[v];\n  if (inV) {\n    var edges = _.values(inV);\n    if (!u) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.v === u; });\n  }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n  var outV = this._out[v];\n  if (outV) {\n    var edges = _.values(outV);\n    if (!w) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.w === w; });\n  }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n  var inEdges = this.inEdges(v, w);\n  if (inEdges) {\n    return inEdges.concat(this.outEdges(v, w));\n  }\n};\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return _.map(g.edges(), function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      clone: require(\"lodash/clone\"),\n      constant: require(\"lodash/constant\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      has:  require(\"lodash/has\"),\n      isArray: require(\"lodash/isArray\"),\n      isEmpty: require(\"lodash/isEmpty\"),\n      isFunction: require(\"lodash/isFunction\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      keys: require(\"lodash/keys\"),\n      map: require(\"lodash/map\"),\n      reduce: require(\"lodash/reduce\"),\n      size: require(\"lodash/size\"),\n      transform: require(\"lodash/transform\"),\n      union: require(\"lodash/union\"),\n      values: require(\"lodash/values\")\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n","module.exports = '2.1.8';\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 getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nmodule.exports = arrayEach;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n","/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nmodule.exports = arrayReduce;\n","/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arraySome;\n","var baseProperty = require('./_baseProperty');\n\n/**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignMergeValue(object, key, value) {\n  if ((value !== undefined && !eq(object[key], value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignMergeValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var copyObject = require('./_copyObject'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n","var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var Stack = require('./_Stack'),\n    arrayEach = require('./_arrayEach'),\n    assignValue = require('./_assignValue'),\n    baseAssign = require('./_baseAssign'),\n    baseAssignIn = require('./_baseAssignIn'),\n    cloneBuffer = require('./_cloneBuffer'),\n    copyArray = require('./_copyArray'),\n    copySymbols = require('./_copySymbols'),\n    copySymbolsIn = require('./_copySymbolsIn'),\n    getAllKeys = require('./_getAllKeys'),\n    getAllKeysIn = require('./_getAllKeysIn'),\n    getTag = require('./_getTag'),\n    initCloneArray = require('./_initCloneArray'),\n    initCloneByTag = require('./_initCloneByTag'),\n    initCloneObject = require('./_initCloneObject'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isMap = require('./isMap'),\n    isObject = require('./isObject'),\n    isSet = require('./isSet'),\n    keys = require('./keys'),\n    keysIn = require('./keysIn');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Deep clone\n *  2 - Flatten inherited properties\n *  4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n  var result,\n      isDeep = bitmask & CLONE_DEEP_FLAG,\n      isFlat = bitmask & CLONE_FLAT_FLAG,\n      isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n  if (customizer) {\n    result = object ? customizer(value, key, object, stack) : customizer(value);\n  }\n  if (result !== undefined) {\n    return result;\n  }\n  if (!isObject(value)) {\n    return value;\n  }\n  var isArr = isArray(value);\n  if (isArr) {\n    result = initCloneArray(value);\n    if (!isDeep) {\n      return copyArray(value, result);\n    }\n  } else {\n    var tag = getTag(value),\n        isFunc = tag == funcTag || tag == genTag;\n\n    if (isBuffer(value)) {\n      return cloneBuffer(value, isDeep);\n    }\n    if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n      result = (isFlat || isFunc) ? {} : initCloneObject(value);\n      if (!isDeep) {\n        return isFlat\n          ? copySymbolsIn(value, baseAssignIn(result, value))\n          : copySymbols(value, baseAssign(result, value));\n      }\n    } else {\n      if (!cloneableTags[tag]) {\n        return object ? value : {};\n      }\n      result = initCloneByTag(value, tag, isDeep);\n    }\n  }\n  // Check for circular references and return its corresponding clone.\n  stack || (stack = new Stack);\n  var stacked = stack.get(value);\n  if (stacked) {\n    return stacked;\n  }\n  stack.set(value, result);\n\n  if (isSet(value)) {\n    value.forEach(function(subValue) {\n      result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n    });\n  } else if (isMap(value)) {\n    value.forEach(function(subValue, key) {\n      result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n    });\n  }\n\n  var keysFunc = isFull\n    ? (isFlat ? getAllKeysIn : getAllKeys)\n    : (isFlat ? keysIn : keys);\n\n  var props = isArr ? undefined : keysFunc(value);\n  arrayEach(props || value, function(subValue, key) {\n    if (props) {\n      key = subValue;\n      subValue = value[key];\n    }\n    // Recursively populate clone (susceptible to call stack limits).\n    assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n  });\n  return result;\n}\n\nmodule.exports = baseClone;\n","var isObject = require('./isObject');\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\nmodule.exports = baseCreate;\n","var baseForOwn = require('./_baseForOwn'),\n    createBaseEach = require('./_createBaseEach');\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\n","var isSymbol = require('./isSymbol');\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n  var index = -1,\n      length = array.length;\n\n  while (++index < length) {\n    var value = array[index],\n        current = iteratee(value);\n\n    if (current != null && (computed === undefined\n          ? (current === current && !isSymbol(current))\n          : comparator(current, computed)\n        )) {\n      var computed = current,\n          result = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseExtremum;\n","var baseEach = require('./_baseEach');\n\n/**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction baseFilter(collection, predicate) {\n  var result = [];\n  baseEach(collection, function(value, index, collection) {\n    if (predicate(value, index, collection)) {\n      result.push(value);\n    }\n  });\n  return result;\n}\n\nmodule.exports = baseFilter;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","var arrayPush = require('./_arrayPush'),\n    isFlattenable = require('./_isFlattenable');\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseFlatten;\n","var createBaseFor = require('./_createBaseFor');\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nmodule.exports = baseFor;\n","var baseFor = require('./_baseFor'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nmodule.exports = baseForOwn;\n","var castPath = require('./_castPath'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n","var arrayPush = require('./_arrayPush'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","/**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n *  else `false`.\n */\nfunction baseGt(value, other) {\n  return value > other;\n}\n\nmodule.exports = baseGt;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHas(object, key) {\n  return object != null && hasOwnProperty.call(object, key);\n}\n\nmodule.exports = baseHas;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var baseIsEqualDeep = require('./_baseIsEqualDeep'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nmodule.exports = baseIsEqual;\n","var Stack = require('./_Stack'),\n    equalArrays = require('./_equalArrays'),\n    equalByTag = require('./_equalByTag'),\n    equalObjects = require('./_equalObjects'),\n    getTag = require('./_getTag'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nmodule.exports = baseIsEqualDeep;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\n\n/**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nmodule.exports = baseIsMap;\n","var Stack = require('./_Stack'),\n    baseIsEqual = require('./_baseIsEqual');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nmodule.exports = baseIsMatch;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\n\n/**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nmodule.exports = baseIsSet;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","var baseMatches = require('./_baseMatches'),\n    baseMatchesProperty = require('./_baseMatchesProperty'),\n    identity = require('./identity'),\n    isArray = require('./isArray'),\n    property = require('./property');\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nmodule.exports = baseIteratee;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","var isObject = require('./isObject'),\n    isPrototype = require('./_isPrototype'),\n    nativeKeysIn = require('./_nativeKeysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeysIn;\n","/**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n *  else `false`.\n */\nfunction baseLt(value, other) {\n  return value < other;\n}\n\nmodule.exports = baseLt;\n","var baseEach = require('./_baseEach'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nmodule.exports = baseMap;\n","var baseIsMatch = require('./_baseIsMatch'),\n    getMatchData = require('./_getMatchData'),\n    matchesStrictComparable = require('./_matchesStrictComparable');\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nmodule.exports = baseMatches;\n","var baseIsEqual = require('./_baseIsEqual'),\n    get = require('./get'),\n    hasIn = require('./hasIn'),\n    isKey = require('./_isKey'),\n    isStrictComparable = require('./_isStrictComparable'),\n    matchesStrictComparable = require('./_matchesStrictComparable'),\n    toKey = require('./_toKey');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nmodule.exports = baseMatchesProperty;\n","var Stack = require('./_Stack'),\n    assignMergeValue = require('./_assignMergeValue'),\n    baseFor = require('./_baseFor'),\n    baseMergeDeep = require('./_baseMergeDeep'),\n    isObject = require('./isObject'),\n    keysIn = require('./keysIn'),\n    safeGet = require('./_safeGet');\n\n/**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n  if (object === source) {\n    return;\n  }\n  baseFor(source, function(srcValue, key) {\n    stack || (stack = new Stack);\n    if (isObject(srcValue)) {\n      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n    }\n    else {\n      var newValue = customizer\n        ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      if (newValue === undefined) {\n        newValue = srcValue;\n      }\n      assignMergeValue(object, key, newValue);\n    }\n  }, keysIn);\n}\n\nmodule.exports = baseMerge;\n","var assignMergeValue = require('./_assignMergeValue'),\n    cloneBuffer = require('./_cloneBuffer'),\n    cloneTypedArray = require('./_cloneTypedArray'),\n    copyArray = require('./_copyArray'),\n    initCloneObject = require('./_initCloneObject'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    isBuffer = require('./isBuffer'),\n    isFunction = require('./isFunction'),\n    isObject = require('./isObject'),\n    isPlainObject = require('./isPlainObject'),\n    isTypedArray = require('./isTypedArray'),\n    safeGet = require('./_safeGet'),\n    toPlainObject = require('./toPlainObject');\n\n/**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n  var objValue = safeGet(object, key),\n      srcValue = safeGet(source, key),\n      stacked = stack.get(srcValue);\n\n  if (stacked) {\n    assignMergeValue(object, key, stacked);\n    return;\n  }\n  var newValue = customizer\n    ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n    : undefined;\n\n  var isCommon = newValue === undefined;\n\n  if (isCommon) {\n    var isArr = isArray(srcValue),\n        isBuff = !isArr && isBuffer(srcValue),\n        isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n    newValue = srcValue;\n    if (isArr || isBuff || isTyped) {\n      if (isArray(objValue)) {\n        newValue = objValue;\n      }\n      else if (isArrayLikeObject(objValue)) {\n        newValue = copyArray(objValue);\n      }\n      else if (isBuff) {\n        isCommon = false;\n        newValue = cloneBuffer(srcValue, true);\n      }\n      else if (isTyped) {\n        isCommon = false;\n        newValue = cloneTypedArray(srcValue, true);\n      }\n      else {\n        newValue = [];\n      }\n    }\n    else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n      newValue = objValue;\n      if (isArguments(objValue)) {\n        newValue = toPlainObject(objValue);\n      }\n      else if (!isObject(objValue) || isFunction(objValue)) {\n        newValue = initCloneObject(srcValue);\n      }\n    }\n    else {\n      isCommon = false;\n    }\n  }\n  if (isCommon) {\n    // Recursively merge objects and arrays (susceptible to call stack limits).\n    stack.set(srcValue, newValue);\n    mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n    stack['delete'](srcValue);\n  }\n  assignMergeValue(object, key, newValue);\n}\n\nmodule.exports = baseMergeDeep;\n","var arrayMap = require('./_arrayMap'),\n    baseGet = require('./_baseGet'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    baseSortBy = require('./_baseSortBy'),\n    baseUnary = require('./_baseUnary'),\n    compareMultiple = require('./_compareMultiple'),\n    identity = require('./identity'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\nfunction baseOrderBy(collection, iteratees, orders) {\n  if (iteratees.length) {\n    iteratees = arrayMap(iteratees, function(iteratee) {\n      if (isArray(iteratee)) {\n        return function(value) {\n          return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n        }\n      }\n      return iteratee;\n    });\n  } else {\n    iteratees = [identity];\n  }\n\n  var index = -1;\n  iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n  var result = baseMap(collection, function(value, key, collection) {\n    var criteria = arrayMap(iteratees, function(iteratee) {\n      return iteratee(value);\n    });\n    return { 'criteria': criteria, 'index': ++index, 'value': value };\n  });\n\n  return baseSortBy(result, function(object, other) {\n    return compareMultiple(object, other, orders);\n  });\n}\n\nmodule.exports = baseOrderBy;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = baseProperty;\n","var baseGet = require('./_baseGet');\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nmodule.exports = basePropertyDeep;\n","/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\nfunction baseRange(start, end, step, fromRight) {\n  var index = -1,\n      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n      result = Array(length);\n\n  while (length--) {\n    result[fromRight ? length : ++index] = start;\n    start += step;\n  }\n  return result;\n}\n\nmodule.exports = baseRange;\n","/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nmodule.exports = baseReduce;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var constant = require('./constant'),\n    defineProperty = require('./_defineProperty'),\n    identity = require('./identity');\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nmodule.exports = baseSetToString;\n","/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nmodule.exports = baseSortBy;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nmodule.exports = baseTrim;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var arrayMap = require('./_arrayMap');\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nmodule.exports = baseValues;\n","/**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\nfunction baseZipObject(props, values, assignFunc) {\n  var index = -1,\n      length = props.length,\n      valsLength = values.length,\n      result = {};\n\n  while (++index < length) {\n    var value = index < valsLength ? values[index] : undefined;\n    assignFunc(result, props[index], value);\n  }\n  return result;\n}\n\nmodule.exports = baseZipObject;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var identity = require('./identity');\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","var isArray = require('./isArray'),\n    isKey = require('./_isKey'),\n    stringToPath = require('./_stringToPath'),\n    toString = require('./toString');\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var Uint8Array = require('./_Uint8Array');\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var root = require('./_root');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nmodule.exports = cloneBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nmodule.exports = cloneDataView;\n","/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\nmodule.exports = cloneRegExp;\n","var Symbol = require('./_Symbol');\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nmodule.exports = cloneSymbol;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\n","var isSymbol = require('./isSymbol');\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = isSymbol(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = isSymbol(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\nmodule.exports = compareAscending;\n","var compareAscending = require('./_compareAscending');\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\nmodule.exports = compareMultiple;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nmodule.exports = copyArray;\n","var assignValue = require('./_assignValue'),\n    baseAssignValue = require('./_baseAssignValue');\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\nmodule.exports = copyObject;\n","var copyObject = require('./_copyObject'),\n    getSymbols = require('./_getSymbols');\n\n/**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\nmodule.exports = copySymbols;\n","var copyObject = require('./_copyObject'),\n    getSymbolsIn = require('./_getSymbolsIn');\n\n/**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbolsIn(source, object) {\n  return copyObject(source, getSymbolsIn(source), object);\n}\n\nmodule.exports = copySymbolsIn;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","var baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function(object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = (assigner.length > 3 && typeof customizer == 'function')\n      ? (length--, customizer)\n      : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\nmodule.exports = createAssigner;\n","var isArrayLike = require('./isArrayLike');\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nmodule.exports = createBaseEach;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nmodule.exports = createBaseFor;\n","var baseIteratee = require('./_baseIteratee'),\n    isArrayLike = require('./isArrayLike'),\n    keys = require('./keys');\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nmodule.exports = createFind;\n","var baseRange = require('./_baseRange'),\n    isIterateeCall = require('./_isIterateeCall'),\n    toFinite = require('./toFinite');\n\n/**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\nfunction createRange(fromRight) {\n  return function(start, end, step) {\n    if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n      end = step = undefined;\n    }\n    // Ensure the sign of `-0` is preserved.\n    start = toFinite(start);\n    if (end === undefined) {\n      end = start;\n      start = 0;\n    } else {\n      end = toFinite(end);\n    }\n    step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n    return baseRange(start, end, step, fromRight);\n  };\n}\n\nmodule.exports = createRange;\n","var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var SetCache = require('./_SetCache'),\n    arraySome = require('./_arraySome'),\n    cacheHas = require('./_cacheHas');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalArrays;\n","var Symbol = require('./_Symbol'),\n    Uint8Array = require('./_Uint8Array'),\n    eq = require('./eq'),\n    equalArrays = require('./_equalArrays'),\n    mapToArray = require('./_mapToArray'),\n    setToArray = require('./_setToArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nmodule.exports = equalByTag;\n","var getAllKeys = require('./_getAllKeys');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalObjects;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbolsIn = require('./_getSymbolsIn'),\n    keysIn = require('./keysIn');\n\n/**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeysIn(object) {\n  return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nmodule.exports = getAllKeysIn;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","var isStrictComparable = require('./_isStrictComparable'),\n    keys = require('./keys');\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nmodule.exports = getMatchData;\n","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","var arrayFilter = require('./_arrayFilter'),\n    stubArray = require('./stubArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nmodule.exports = getSymbols;\n","var arrayPush = require('./_arrayPush'),\n    getPrototype = require('./_getPrototype'),\n    getSymbols = require('./_getSymbols'),\n    stubArray = require('./stubArray');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n  var result = [];\n  while (object) {\n    arrayPush(result, getSymbols(object));\n    object = getPrototype(object);\n  }\n  return result;\n};\n\nmodule.exports = getSymbolsIn;\n","var DataView = require('./_DataView'),\n    Map = require('./_Map'),\n    Promise = require('./_Promise'),\n    Set = require('./_Set'),\n    WeakMap = require('./_WeakMap'),\n    baseGetTag = require('./_baseGetTag'),\n    toSource = require('./_toSource');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nmodule.exports = getTag;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = new array.constructor(length);\n\n  // Add properties assigned by `RegExp#exec`.\n  if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n    result.index = array.index;\n    result.input = array.input;\n  }\n  return result;\n}\n\nmodule.exports = initCloneArray;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer'),\n    cloneDataView = require('./_cloneDataView'),\n    cloneRegExp = require('./_cloneRegExp'),\n    cloneSymbol = require('./_cloneSymbol'),\n    cloneTypedArray = require('./_cloneTypedArray');\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, isDeep) {\n  var Ctor = object.constructor;\n  switch (tag) {\n    case arrayBufferTag:\n      return cloneArrayBuffer(object);\n\n    case boolTag:\n    case dateTag:\n      return new Ctor(+object);\n\n    case dataViewTag:\n      return cloneDataView(object, isDeep);\n\n    case float32Tag: case float64Tag:\n    case int8Tag: case int16Tag: case int32Tag:\n    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n      return cloneTypedArray(object, isDeep);\n\n    case mapTag:\n      return new Ctor;\n\n    case numberTag:\n    case stringTag:\n      return new Ctor(object);\n\n    case regexpTag:\n      return cloneRegExp(object);\n\n    case setTag:\n      return new Ctor;\n\n    case symbolTag:\n      return cloneSymbol(object);\n  }\n}\n\nmodule.exports = initCloneByTag;\n","var baseCreate = require('./_baseCreate'),\n    getPrototype = require('./_getPrototype'),\n    isPrototype = require('./_isPrototype');\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nmodule.exports = initCloneObject;\n","var Symbol = require('./_Symbol'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray');\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","var eq = require('./eq'),\n    isArrayLike = require('./isArrayLike'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject');\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\nmodule.exports = isIterateeCall;\n","var isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","var isObject = require('./isObject');\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nmodule.exports = isStrictComparable;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nmodule.exports = mapToArray;\n","/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nmodule.exports = matchesStrictComparable;\n","var memoize = require('./memoize');\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nmodule.exports = memoizeCapped;\n","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = nativeKeysIn;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nmodule.exports = overRest;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","/**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction safeGet(object, key) {\n  if (key === 'constructor' && typeof object[key] === 'function') {\n    return;\n  }\n\n  if (key == '__proto__') {\n    return;\n  }\n\n  return object[key];\n}\n\nmodule.exports = safeGet;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nmodule.exports = setToArray;\n","var baseSetToString = require('./_baseSetToString'),\n    shortOut = require('./_shortOut');\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nmodule.exports = shortOut;\n","var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var asciiSize = require('./_asciiSize'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeSize = require('./_unicodeSize');\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n  return hasUnicode(string)\n    ? unicodeSize(string)\n    : asciiSize(string);\n}\n\nmodule.exports = stringSize;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nmodule.exports = stringToPath;\n","var isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nfunction unicodeSize(string) {\n  var result = reUnicode.lastIndex = 0;\n  while (reUnicode.test(string)) {\n    ++result;\n  }\n  return result;\n}\n\nmodule.exports = unicodeSize;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = clone;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nmodule.exports = constant;\n","var baseRest = require('./_baseRest'),\n    eq = require('./eq'),\n    isIterateeCall = require('./_isIterateeCall'),\n    keysIn = require('./keysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar defaults = baseRest(function(object, sources) {\n  object = Object(object);\n\n  var index = -1;\n  var length = sources.length;\n  var guard = length > 2 ? sources[2] : undefined;\n\n  if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n    length = 1;\n  }\n\n  while (++index < length) {\n    var source = sources[index];\n    var props = keysIn(source);\n    var propsIndex = -1;\n    var propsLength = props.length;\n\n    while (++propsIndex < propsLength) {\n      var key = props[propsIndex];\n      var value = object[key];\n\n      if (value === undefined ||\n          (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        object[key] = source[key];\n      }\n    }\n  }\n\n  return object;\n});\n\nmodule.exports = defaults;\n","module.exports = require('./forEach');\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var arrayFilter = require('./_arrayFilter'),\n    baseFilter = require('./_baseFilter'),\n    baseIteratee = require('./_baseIteratee'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': true },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\nfunction filter(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nmodule.exports = filter;\n","var createFind = require('./_createFind'),\n    findIndex = require('./findIndex');\n\n/**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'age': 36, 'active': true },\n *   { 'user': 'fred',    'age': 40, 'active': false },\n *   { 'user': 'pebbles', 'age': 1,  'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\nvar find = createFind(findIndex);\n\nmodule.exports = find;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIteratee = require('./_baseIteratee'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nmodule.exports = findIndex;\n","var baseFlatten = require('./_baseFlatten');\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nmodule.exports = flatten;\n","var arrayEach = require('./_arrayEach'),\n    baseEach = require('./_baseEach'),\n    castFunction = require('./_castFunction'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n *   console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forEach(collection, iteratee) {\n  var func = isArray(collection) ? arrayEach : baseEach;\n  return func(collection, castFunction(iteratee));\n}\n\nmodule.exports = forEach;\n","var baseFor = require('./_baseFor'),\n    castFunction = require('./_castFunction'),\n    keysIn = require('./keysIn');\n\n/**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\nfunction forIn(object, iteratee) {\n  return object == null\n    ? object\n    : baseFor(object, castFunction(iteratee), keysIn);\n}\n\nmodule.exports = forIn;\n","var baseGet = require('./_baseGet');\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n","var baseHas = require('./_baseHas'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\nfunction has(object, path) {\n  return object != null && hasPath(object, path, baseHas);\n}\n\nmodule.exports = has;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","var baseKeys = require('./_baseKeys'),\n    getTag = require('./_getTag'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLike = require('./isArrayLike'),\n    isBuffer = require('./isBuffer'),\n    isPrototype = require('./_isPrototype'),\n    isTypedArray = require('./isTypedArray');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\nfunction isEmpty(value) {\n  if (value == null) {\n    return true;\n  }\n  if (isArrayLike(value) &&\n      (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n        isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n    return !value.length;\n  }\n  var tag = getTag(value);\n  if (tag == mapTag || tag == setTag) {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !baseKeys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nmodule.exports = isEmpty;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","var baseIsMap = require('./_baseIsMap'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nmodule.exports = isMap;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseGetTag = require('./_baseGetTag'),\n    getPrototype = require('./_getPrototype'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","var baseIsSet = require('./_baseIsSet'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n","var baseGetTag = require('./_baseGetTag'),\n    isArray = require('./isArray'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","/**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\nfunction isUndefined(value) {\n  return value === undefined;\n}\n\nmodule.exports = isUndefined;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeysIn = require('./_baseKeysIn'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nmodule.exports = last;\n","var arrayMap = require('./_arrayMap'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    isArray = require('./isArray');\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nmodule.exports = map;\n","var baseAssignValue = require('./_baseAssignValue'),\n    baseForOwn = require('./_baseForOwn'),\n    baseIteratee = require('./_baseIteratee');\n\n/**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n *   'fred':    { 'user': 'fred',    'age': 40 },\n *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\nfunction mapValues(object, iteratee) {\n  var result = {};\n  iteratee = baseIteratee(iteratee, 3);\n\n  baseForOwn(object, function(value, key, object) {\n    baseAssignValue(result, key, iteratee(value, key, object));\n  });\n  return result;\n}\n\nmodule.exports = mapValues;\n","var baseExtremum = require('./_baseExtremum'),\n    baseGt = require('./_baseGt'),\n    identity = require('./identity');\n\n/**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\nfunction max(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseGt)\n    : undefined;\n}\n\nmodule.exports = max;\n","var MapCache = require('./_MapCache');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","var baseMerge = require('./_baseMerge'),\n    createAssigner = require('./_createAssigner');\n\n/**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n *   'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n *   'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\nvar merge = createAssigner(function(object, source, srcIndex) {\n  baseMerge(object, source, srcIndex);\n});\n\nmodule.exports = merge;\n","var baseExtremum = require('./_baseExtremum'),\n    baseLt = require('./_baseLt'),\n    identity = require('./identity');\n\n/**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\nfunction min(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseLt)\n    : undefined;\n}\n\nmodule.exports = min;\n","var baseExtremum = require('./_baseExtremum'),\n    baseIteratee = require('./_baseIteratee'),\n    baseLt = require('./_baseLt');\n\n/**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\nfunction minBy(array, iteratee) {\n  return (array && array.length)\n    ? baseExtremum(array, baseIteratee(iteratee, 2), baseLt)\n    : undefined;\n}\n\nmodule.exports = minBy;\n","/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nmodule.exports = noop;\n","var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","var baseProperty = require('./_baseProperty'),\n    basePropertyDeep = require('./_basePropertyDeep'),\n    isKey = require('./_isKey'),\n    toKey = require('./_toKey');\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nmodule.exports = property;\n","var createRange = require('./_createRange');\n\n/**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\nvar range = createRange();\n\nmodule.exports = range;\n","var arrayReduce = require('./_arrayReduce'),\n    baseEach = require('./_baseEach'),\n    baseIteratee = require('./_baseIteratee'),\n    baseReduce = require('./_baseReduce'),\n    isArray = require('./isArray');\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nmodule.exports = reduce;\n","var baseKeys = require('./_baseKeys'),\n    getTag = require('./_getTag'),\n    isArrayLike = require('./isArrayLike'),\n    isString = require('./isString'),\n    stringSize = require('./_stringSize');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\nfunction size(collection) {\n  if (collection == null) {\n    return 0;\n  }\n  if (isArrayLike(collection)) {\n    return isString(collection) ? stringSize(collection) : collection.length;\n  }\n  var tag = getTag(collection);\n  if (tag == mapTag || tag == setTag) {\n    return collection.size;\n  }\n  return baseKeys(collection).length;\n}\n\nmodule.exports = size;\n","var baseFlatten = require('./_baseFlatten'),\n    baseOrderBy = require('./_baseOrderBy'),\n    baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n *  The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n *   { 'user': 'fred',   'age': 48 },\n *   { 'user': 'barney', 'age': 36 },\n *   { 'user': 'fred',   'age': 30 },\n *   { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\nvar sortBy = baseRest(function(collection, iteratees) {\n  if (collection == null) {\n    return [];\n  }\n  var length = iteratees.length;\n  if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n    iteratees = [];\n  } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n    iteratees = [iteratees[0]];\n  }\n  return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n});\n\nmodule.exports = sortBy;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nmodule.exports = stubArray;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\nfunction toPlainObject(value) {\n  return copyObject(value, keysIn(value));\n}\n\nmodule.exports = toPlainObject;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","var arrayEach = require('./_arrayEach'),\n    baseCreate = require('./_baseCreate'),\n    baseForOwn = require('./_baseForOwn'),\n    baseIteratee = require('./_baseIteratee'),\n    getPrototype = require('./_getPrototype'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isFunction = require('./isFunction'),\n    isObject = require('./isObject'),\n    isTypedArray = require('./isTypedArray');\n\n/**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n *   result.push(n *= n);\n *   return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\nfunction transform(object, iteratee, accumulator) {\n  var isArr = isArray(object),\n      isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n  iteratee = baseIteratee(iteratee, 4);\n  if (accumulator == null) {\n    var Ctor = object && object.constructor;\n    if (isArrLike) {\n      accumulator = isArr ? new Ctor : [];\n    }\n    else if (isObject(object)) {\n      accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n    }\n    else {\n      accumulator = {};\n    }\n  }\n  (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n    return iteratee(accumulator, value, index, object);\n  });\n  return accumulator;\n}\n\nmodule.exports = transform;\n","var baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    baseUniq = require('./_baseUniq'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\nvar union = baseRest(function(arrays) {\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nmodule.exports = union;\n","var toString = require('./toString');\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","var baseValues = require('./_baseValues'),\n    keys = require('./keys');\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","var assignValue = require('./_assignValue'),\n    baseZipObject = require('./_baseZipObject');\n\n/**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction zipObject(props, values) {\n  return baseZipObject(props || [], values || [], assignValue);\n}\n\nmodule.exports = zipObject;\n","export var DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  epsilon: 1e-12,\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n  // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction\n  number: 'number',\n  // number of significant digits in BigNumbers\n  precision: 64,\n  // predictable output type of functions. When true, output type depends only\n  // on the input types. When false (default), output type can vary depending\n  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n  // predictable is false, and returns `NaN` when true.\n  predictable: false,\n  // random seed for seeded pseudo random number generation\n  // null = randomly seed\n  randomSeed: null\n};","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); }\n\nimport { DEFAULT_CONFIG } from '../core/config.js';\nimport { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js'; // create a read-only version of config\n\nexport var config = /* #__PURE__ */function config(options) {\n  if (options) {\n    throw new Error('The global config is readonly. \\n' + 'Please create a mathjs instance if you want to change the default configuration. \\n' + 'Example:\\n' + '\\n' + '  import { create, all } from \\'mathjs\\';\\n' + '  const mathjs = create(all);\\n' + '  mathjs.config({ number: \\'BigNumber\\' });\\n');\n  }\n\n  return Object.freeze(DEFAULT_CONFIG);\n};\n\n_extends(config, DEFAULT_CONFIG, {\n  MATRIX_OPTIONS,\n  NUMBER_OPTIONS\n});","import { clone, mapObject, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\n\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number\n\nexport function configFactory(config, emit) {\n  /**\n   * Set configuration options for math.js, and get current options.\n   * Will emit a 'config' event, with arguments (curr, prev, changes).\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *\n   *     import { create, all } from 'mathjs'\n   *\n   *     // create a mathjs instance\n   *     const math = create(all)\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.evaluate('0.4')                // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.evaluate('0.4')                // outputs Fraction 2/5\n   *\n   * @param {Object} [options] Available options:\n   *                            {number} epsilon\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {string} matrix\n   *                              A string 'Matrix' (default) or 'Array'.\n   *                            {string} number\n   *                              A string 'number' (default), 'BigNumber', or 'Fraction'\n   *                            {number} precision\n   *                              The number of significant digits for BigNumbers.\n   *                              Not applicable for Numbers.\n   *                            {string} parenthesis\n   *                              How to display parentheses in LaTeX and string\n   *                              output.\n   *                            {string} randomSeed\n   *                              Random seed for seeded pseudo random number generator.\n   *                              Set to null to randomly seed.\n   * @return {Object} Returns the current configuration\n   */\n  function _config(options) {\n    if (options) {\n      var prev = mapObject(config, clone); // validate some of the options\n\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS); // merge options\n\n      deepExtend(config, options);\n      var curr = mapObject(config, clone);\n      var changes = mapObject(options, clone); // emit 'config' event\n\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return mapObject(config, clone);\n    }\n  } // attach the valid options to the function so they can be extended\n\n\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS; // attach the config properties as readonly properties to the config function\n\n  Object.keys(DEFAULT_CONFIG).forEach(key => {\n    Object.defineProperty(_config, key, {\n      get: () => config[key],\n      enumerable: true,\n      configurable: true\n    });\n  });\n  return _config;\n}\n/**\n * Test whether an Array contains a specific item.\n * @param {Array.<string>} array\n * @param {string} item\n * @return {boolean}\n */\n\nfunction contains(array, item) {\n  return array.indexOf(item) !== -1;\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 */\n\n\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !contains(values, options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n  }\n}","// Reserved keywords not allowed to use in the parser\nexport var keywords = {\n  end: true\n};","import { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { deepStrictEqual, hasOwnProperty } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Node';\nvar dependencies = ['mathWithTransform'];\nexport var createNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    mathWithTransform\n  } = _ref;\n\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   * Evaluate the node\n   * @param {Object} [scope]  Scope to read/write variables\n   * @return {*}              Returns the result\n   */\n\n\n  Node.prototype.evaluate = function (scope) {\n    return this.compile().evaluate(scope);\n  };\n\n  Node.prototype.type = 'Node';\n  Node.prototype.isNode = true;\n  Node.prototype.comment = '';\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\n  Node.prototype.compile = function () {\n    var expr = this._compile(mathWithTransform, {});\n\n    var args = {};\n    var context = null;\n\n    function evaluate(scope) {\n      var s = scope || {};\n\n      _validateScope(s);\n\n      return expr(s, args, context);\n    }\n\n    return {\n      evaluate\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\n\n  Node.prototype._compile = function (math, argNames) {\n    throw new Error('Method _compile should be implemented by type ' + this.type);\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\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   * 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\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   * 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\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   * 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\n\n  Node.prototype.traverse = function (callback) {\n    // execute callback for itself\n    // eslint-disable-next-line\n    callback(this, null, null); // recursively traverse over all childs of a node\n\n    function _traverse(node, callback) {\n      node.forEach(function (child, path, parent) {\n        callback(child, path, parent);\n\n        _traverse(child, callback);\n      });\n    }\n\n    _traverse(this, callback);\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\n\n  Node.prototype.transform = function (callback) {\n    function _transform(child, path, parent) {\n      var 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   * 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\n\n  Node.prototype.filter = function (callback) {\n    var nodes = [];\n    this.traverse(function (node, path, parent) {\n      if (callback(node, path, parent)) {\n        nodes.push(node);\n      }\n    });\n    return nodes;\n  };\n  /**\n   * Create a shallow clone of this node\n   * @return {Node}\n   */\n\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   * Create a deep clone of this node\n   * @return {Node}\n   */\n\n\n  Node.prototype.cloneDeep = function () {\n    return this.map(function (node) {\n      return node.cloneDeep();\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\n\n  Node.prototype.equals = function (other) {\n    return other ? deepStrictEqual(this, other) : false;\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\n\n  Node.prototype.toString = function (options) {\n    var customString = this._getCustomString(options);\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this._toString(options);\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\n\n  Node.prototype.toJSON = function () {\n    throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);\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\n\n  Node.prototype.toHTML = function (options) {\n    var customString = this._getCustomString(options);\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this.toHTML(options);\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\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   * 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\n\n  Node.prototype.toTex = function (options) {\n    var customString = this._getCustomString(options);\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this._toTex(options);\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\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   * Helper used by `to...` functions.\n   */\n\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\n        case 'function':\n          return options.handler(this, options);\n\n        default:\n          throw new TypeError('Object or function expected as callback');\n      }\n    }\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  Node.prototype.getIdentifier = function () {\n    return this.type;\n  };\n  /**\n   * Get the content of the current Node.\n   * @return {Node} node\n   **/\n\n\n  Node.prototype.getContent = function () {\n    return this;\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\n\n  function _validateScope(scope) {\n    for (var symbol in scope) {\n      if (hasOwnProperty(scope, symbol)) {\n        if (symbol in keywords) {\n          throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n        }\n      }\n    }\n  }\n\n  return Node;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ArrayNode';\nvar dependencies = ['Node'];\nexport var createArrayNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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 || []; // validate input\n\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  ArrayNode.prototype.type = 'ArrayNode';\n  ArrayNode.prototype.isArrayNode = true;\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\n  ArrayNode.prototype._compile = function (math, argNames) {\n    var evalItems = map(this.items, function (item) {\n      return item._compile(math, argNames);\n    });\n    var asMatrix = math.config.matrix !== 'Array';\n\n    if (asMatrix) {\n      var 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   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ArrayNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.items.length; i++) {\n      var node = this.items[i];\n      callback(node, 'items[' + i + ']', this);\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\n\n  ArrayNode.prototype.map = function (callback) {\n    var items = [];\n\n    for (var i = 0; i < this.items.length; i++) {\n      items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));\n    }\n\n    return new ArrayNode(items);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ArrayNode}\n   */\n\n\n  ArrayNode.prototype.clone = function () {\n    return new ArrayNode(this.items.slice(0));\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ArrayNode.prototype._toString = function (options) {\n    var items = this.items.map(function (node) {\n      return node.toString(options);\n    });\n    return '[' + items.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ArrayNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ArrayNode',\n      items: this.items\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\n\n  ArrayNode.fromJSON = function (json) {\n    return new ArrayNode(json.items);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ArrayNode.prototype.toHTML = function (options) {\n    var 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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ArrayNode.prototype._toTex = function (options) {\n    var s = '\\\\begin{bmatrix}';\n    this.items.forEach(function (node) {\n      if (node.items) {\n        s += node.items.map(function (childNode) {\n          return childNode.toTex(options);\n        }).join('&');\n      } else {\n        s += node.toTex(options);\n      } // new line\n\n\n      s += '\\\\\\\\';\n    });\n    s += '\\\\end{bmatrix}';\n    return s;\n  };\n\n  return ArrayNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\nimport { forEach, map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BlockNode';\nvar dependencies = ['ResultSet', 'Node'];\nexport var createBlockNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    ResultSet,\n    Node\n  } = _ref;\n\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    } // validate input, copy blocks\n\n\n    if (!Array.isArray(blocks)) throw new Error('Array expected');\n    this.blocks = blocks.map(function (block) {\n      var node = block && block.node;\n      var visible = block && block.visible !== undefined ? block.visible : true;\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      return {\n        node: node,\n        visible: visible\n      };\n    });\n  }\n\n  BlockNode.prototype = new Node();\n  BlockNode.prototype.type = 'BlockNode';\n  BlockNode.prototype.isBlockNode = true;\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\n  BlockNode.prototype._compile = function (math, argNames) {\n    var evalBlocks = map(this.blocks, function (block) {\n      return {\n        evaluate: block.node._compile(math, argNames),\n        visible: block.visible\n      };\n    });\n    return function evalBlockNodes(scope, args, context) {\n      var results = [];\n      forEach(evalBlocks, function evalBlockNode(block) {\n        var result = block.evaluate(scope, args, context);\n\n        if (block.visible) {\n          results.push(result);\n        }\n      });\n      return new ResultSet(results);\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\n\n  BlockNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.blocks.length; i++) {\n      callback(this.blocks[i].node, 'blocks[' + i + '].node', this);\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\n\n  BlockNode.prototype.map = function (callback) {\n    var blocks = [];\n\n    for (var i = 0; i < this.blocks.length; i++) {\n      var block = this.blocks[i];\n\n      var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));\n\n      blocks[i] = {\n        node: node,\n        visible: block.visible\n      };\n    }\n\n    return new BlockNode(blocks);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {BlockNode}\n   */\n\n\n  BlockNode.prototype.clone = function () {\n    var blocks = this.blocks.map(function (block) {\n      return {\n        node: block.node,\n        visible: block.visible\n      };\n    });\n    return new BlockNode(blocks);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  BlockNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'BlockNode',\n      blocks: this.blocks\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\n\n  BlockNode.fromJSON = function (json) {\n    return new BlockNode(json.blocks);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\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}, {\n  isClass: true,\n  isNode: true\n});","/* eslint no-template-curly-in-string: \"off\" */\nimport escapeLatexLib from 'escape-latex';\nimport { hasOwnProperty } from './object.js';\nexport var 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',\n  // 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};\nexport var latexOperators = {\n  transpose: '^\\\\top',\n  ctranspose: '^H',\n  factorial: '!',\n  pow: '^',\n  dotPow: '.^\\\\wedge',\n  // TODO find ideal solution\n  unaryPlus: '+',\n  unaryMinus: '-',\n  bitNot: '\\\\~',\n  // TODO find ideal solution\n  not: '\\\\neg',\n  multiply: '\\\\cdot',\n  divide: '\\\\frac',\n  // TODO how to handle that properly?\n  dotMultiply: '.\\\\cdot',\n  // TODO find ideal solution\n  dotDivide: '.:',\n  // 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};\nexport var latexFunctions = {\n  // arithmetic\n  abs: {\n    1: '\\\\left|${args[0]}\\\\right|'\n  },\n  add: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.add, \"${args[1]}\\\\right)\")\n  },\n  cbrt: {\n    1: '\\\\sqrt[3]{${args[0]}}'\n  },\n  ceil: {\n    1: '\\\\left\\\\lceil${args[0]}\\\\right\\\\rceil'\n  },\n  cube: {\n    1: '\\\\left(${args[0]}\\\\right)^3'\n  },\n  divide: {\n    2: '\\\\frac{${args[0]}}{${args[1]}}'\n  },\n  dotDivide: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotDivide, \"${args[1]}\\\\right)\")\n  },\n  dotMultiply: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotMultiply, \"${args[1]}\\\\right)\")\n  },\n  dotPow: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotPow, \"${args[1]}\\\\right)\")\n  },\n  exp: {\n    1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n  },\n  expm1: \"\\\\left(e\".concat(latexOperators.pow, \"{${args[0]}}-1\\\\right)\"),\n  fix: {\n    1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n  },\n  floor: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rfloor'\n  },\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: {\n    1: '\\\\log_{10}\\\\left(${args[0]}\\\\right)'\n  },\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: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.mod, \"${args[1]}\\\\right)\")\n  },\n  multiply: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.multiply, \"${args[1]}\\\\right)\")\n  },\n  norm: {\n    1: '\\\\left\\\\|${args[0]}\\\\right\\\\|',\n    2: undefined // use default template\n\n  },\n  nthRoot: {\n    2: '\\\\sqrt[${args[1]}]{${args[0]}}'\n  },\n  nthRoots: {\n    2: '\\\\{y : $y^{args[1]} = {${args[0]}}\\\\}'\n  },\n  pow: {\n    2: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.pow, \"{${args[1]}}\")\n  },\n  round: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rceil',\n    2: undefined // use default template\n\n  },\n  sign: {\n    1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n  },\n  sqrt: {\n    1: '\\\\sqrt{${args[0]}}'\n  },\n  square: {\n    1: '\\\\left(${args[0]}\\\\right)^2'\n  },\n  subtract: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.subtract, \"${args[1]}\\\\right)\")\n  },\n  unaryMinus: {\n    1: \"\".concat(latexOperators.unaryMinus, \"\\\\left(${args[0]}\\\\right)\")\n  },\n  unaryPlus: {\n    1: \"\".concat(latexOperators.unaryPlus, \"\\\\left(${args[0]}\\\\right)\")\n  },\n  // bitwise\n  bitAnd: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitAnd, \"${args[1]}\\\\right)\")\n  },\n  bitNot: {\n    1: latexOperators.bitNot + '\\\\left(${args[0]}\\\\right)'\n  },\n  bitOr: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitOr, \"${args[1]}\\\\right)\")\n  },\n  bitXor: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitXor, \"${args[1]}\\\\right)\")\n  },\n  leftShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.leftShift, \"${args[1]}\\\\right)\")\n  },\n  rightArithShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.rightArithShift, \"${args[1]}\\\\right)\")\n  },\n  rightLogShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.rightLogShift, \"${args[1]}\\\\right)\")\n  },\n  // combinatorics\n  bellNumbers: {\n    1: '\\\\mathrm{B}_{${args[0]}}'\n  },\n  catalan: {\n    1: '\\\\mathrm{C}_{${args[0]}}'\n  },\n  stirlingS2: {\n    2: '\\\\mathrm{S}\\\\left(${args}\\\\right)'\n  },\n  // complex\n  arg: {\n    1: '\\\\arg\\\\left(${args[0]}\\\\right)'\n  },\n  conj: {\n    1: '\\\\left(${args[0]}\\\\right)^*'\n  },\n  im: {\n    1: '\\\\Im\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n  },\n  re: {\n    1: '\\\\Re\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n  },\n  // logical\n  and: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.and, \"${args[1]}\\\\right)\")\n  },\n  not: {\n    1: latexOperators.not + '\\\\left(${args[0]}\\\\right)'\n  },\n  or: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.or, \"${args[1]}\\\\right)\")\n  },\n  xor: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.xor, \"${args[1]}\\\\right)\")\n  },\n  // matrix\n  cross: {\n    2: '\\\\left(${args[0]}\\\\right)\\\\times\\\\left(${args[1]}\\\\right)'\n  },\n  ctranspose: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.ctranspose)\n  },\n  det: {\n    1: '\\\\det\\\\left(${args[0]}\\\\right)'\n  },\n  dot: {\n    2: '\\\\left(${args[0]}\\\\cdot${args[1]}\\\\right)'\n  },\n  expm: {\n    1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n  },\n  inv: {\n    1: '\\\\left(${args[0]}\\\\right)^{-1}'\n  },\n  sqrtm: {\n    1: \"{${args[0]}}\".concat(latexOperators.pow, \"{\\\\frac{1}{2}}\")\n  },\n  trace: {\n    1: '\\\\mathrm{tr}\\\\left(${args[0]}\\\\right)'\n  },\n  transpose: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.transpose)\n  },\n  // probability\n  combinations: {\n    2: '\\\\binom{${args[0]}}{${args[1]}}'\n  },\n  combinationsWithRep: {\n    2: '\\\\left(\\\\!\\\\!{\\\\binom{${args[0]}}{${args[1]}}}\\\\!\\\\!\\\\right)'\n  },\n  factorial: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.factorial)\n  },\n  gamma: {\n    1: '\\\\Gamma\\\\left(${args[0]}\\\\right)'\n  },\n  // relational\n  equal: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.equal, \"${args[1]}\\\\right)\")\n  },\n  larger: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.larger, \"${args[1]}\\\\right)\")\n  },\n  largerEq: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.largerEq, \"${args[1]}\\\\right)\")\n  },\n  smaller: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.smaller, \"${args[1]}\\\\right)\")\n  },\n  smallerEq: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.smallerEq, \"${args[1]}\\\\right)\")\n  },\n  unequal: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.unequal, \"${args[1]}\\\\right)\")\n  },\n  // special\n  erf: {\n    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  // trigonometry\n  acos: {\n    1: '\\\\cos^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acosh: {\n    1: '\\\\cosh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acot: {\n    1: '\\\\cot^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acoth: {\n    1: '\\\\coth^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acsc: {\n    1: '\\\\csc^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acsch: {\n    1: '\\\\mathrm{csch}^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asec: {\n    1: '\\\\sec^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asech: {\n    1: '\\\\mathrm{sech}^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asin: {\n    1: '\\\\sin^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asinh: {\n    1: '\\\\sinh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  atan: {\n    1: '\\\\tan^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  atan2: {\n    2: '\\\\mathrm{atan2}\\\\left(${args}\\\\right)'\n  },\n  atanh: {\n    1: '\\\\tanh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  cos: {\n    1: '\\\\cos\\\\left(${args[0]}\\\\right)'\n  },\n  cosh: {\n    1: '\\\\cosh\\\\left(${args[0]}\\\\right)'\n  },\n  cot: {\n    1: '\\\\cot\\\\left(${args[0]}\\\\right)'\n  },\n  coth: {\n    1: '\\\\coth\\\\left(${args[0]}\\\\right)'\n  },\n  csc: {\n    1: '\\\\csc\\\\left(${args[0]}\\\\right)'\n  },\n  csch: {\n    1: '\\\\mathrm{csch}\\\\left(${args[0]}\\\\right)'\n  },\n  sec: {\n    1: '\\\\sec\\\\left(${args[0]}\\\\right)'\n  },\n  sech: {\n    1: '\\\\mathrm{sech}\\\\left(${args[0]}\\\\right)'\n  },\n  sin: {\n    1: '\\\\sin\\\\left(${args[0]}\\\\right)'\n  },\n  sinh: {\n    1: '\\\\sinh\\\\left(${args[0]}\\\\right)'\n  },\n  tan: {\n    1: '\\\\tan\\\\left(${args[0]}\\\\right)'\n  },\n  tanh: {\n    1: '\\\\tanh\\\\left(${args[0]}\\\\right)'\n  },\n  // unit\n  to: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.to, \"${args[1]}\\\\right)\")\n  },\n  // utils\n  numeric: function numeric(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  // 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)+\".concat(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};\nexport var defaultTemplate = '\\\\mathrm{${name}}\\\\left(${args}\\\\right)';\nvar latexUnits = {\n  deg: '^\\\\circ'\n};\nexport function escapeLatex(string) {\n  return escapeLatexLib(string, {\n    preserveFormatting: true\n  });\n} // @param {string} name\n// @param {boolean} isUnit\n\nexport function toSymbol(name, isUnit) {\n  isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n\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}","import { format } from '../../utils/string.js';\nimport { typeOf } from '../../utils/is.js';\nimport { escapeLatex } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ConstantNode';\nvar dependencies = ['Node'];\nexport var createConstantNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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  ConstantNode.prototype.type = 'ConstantNode';\n  ConstantNode.prototype.isConstantNode = true;\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\n  ConstantNode.prototype._compile = function (math, argNames) {\n    var value = this.value;\n    return function evalConstantNode() {\n      return value;\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\n\n  ConstantNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs\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\n\n  ConstantNode.prototype.map = function (callback) {\n    return this.clone();\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConstantNode}\n   */\n\n\n  ConstantNode.prototype.clone = function () {\n    return new ConstantNode(this.value);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype._toString = function (options) {\n    return format(this.value, options);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype.toHTML = function (options) {\n    var 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\n      case 'string':\n        return '<span class=\"math-string\">' + value + '</span>';\n\n      case 'boolean':\n        return '<span class=\"math-boolean\">' + value + '</span>';\n\n      case 'null':\n        return '<span class=\"math-null-symbol\">' + value + '</span>';\n\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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ConstantNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ConstantNode',\n      value: this.value\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\n\n  ConstantNode.fromJSON = function (json) {\n    return new ConstantNode(json.value);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype._toTex = function (options) {\n    var 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 ? '-\\\\infty' : '\\\\infty';\n          }\n\n          var index = value.toLowerCase().indexOf('e');\n\n          if (index !== -1) {\n            return value.substring(0, index) + '\\\\cdot10^{' + value.substring(index + 1) + '}';\n          }\n        }\n        return value;\n\n      case 'Fraction':\n        return this.value.toLatex();\n\n      default:\n        return value;\n    }\n  };\n\n  return ConstantNode;\n}, {\n  isClass: true,\n  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';\nvar name = 'ObjectNode';\nvar dependencies = ['Node'];\nexport var createObjectNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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 || {}; // validate input\n\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  ObjectNode.prototype.type = 'ObjectNode';\n  ObjectNode.prototype.isObjectNode = true;\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\n  ObjectNode.prototype._compile = function (math, argNames) {\n    var evalEntries = {};\n\n    for (var 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        var stringifiedKey = stringify(key);\n        var parsedKey = JSON.parse(stringifiedKey);\n\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      var obj = {};\n\n      for (var _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   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ObjectNode.prototype.forEach = function (callback) {\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        callback(this.properties[key], 'properties[' + stringify(key) + ']', this);\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\n\n  ObjectNode.prototype.map = function (callback) {\n    var properties = {};\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + stringify(key) + ']', this));\n      }\n    }\n\n    return new ObjectNode(properties);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ObjectNode}\n   */\n\n\n  ObjectNode.prototype.clone = function () {\n    var properties = {};\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        properties[key] = this.properties[key];\n      }\n    }\n\n    return new ObjectNode(properties);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ObjectNode.prototype._toString = function (options) {\n    var entries = [];\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        entries.push(stringify(key) + ': ' + this.properties[key].toString(options));\n      }\n    }\n\n    return '{' + entries.join(', ') + '}';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ObjectNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ObjectNode',\n      properties: this.properties\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\n\n  ObjectNode.fromJSON = function (json) {\n    return new ObjectNode(json.properties);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ObjectNode.prototype.toHTML = function (options) {\n    var entries = [];\n\n    for (var 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\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ObjectNode.prototype._toTex = function (options) {\n    var entries = [];\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        entries.push('\\\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\\\\\');\n      }\n    }\n\n    return \"\\\\left\\\\{\\\\begin{array}{ll}\".concat(entries.join('\\n'), \"\\\\end{array}\\\\right\\\\}\");\n  };\n\n  return ObjectNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ParenthesisNode';\nvar dependencies = ['Node'];\nexport var createParenthesisNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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    } // validate input\n\n\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  ParenthesisNode.prototype.type = 'ParenthesisNode';\n  ParenthesisNode.prototype.isParenthesisNode = true;\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\n  ParenthesisNode.prototype._compile = function (math, argNames) {\n    return this.content._compile(math, argNames);\n  };\n  /**\n   * Get the content of the current Node.\n   * @return {Node} content\n   * @override\n   **/\n\n\n  ParenthesisNode.prototype.getContent = function () {\n    return this.content.getContent();\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\n\n  ParenthesisNode.prototype.forEach = function (callback) {\n    callback(this.content, 'content', this);\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\n\n  ParenthesisNode.prototype.map = function (callback) {\n    var content = callback(this.content, 'content', this);\n    return new ParenthesisNode(content);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ParenthesisNode}\n   */\n\n\n  ParenthesisNode.prototype.clone = function () {\n    return new ParenthesisNode(this.content);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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\n    return this.content.toString(options);\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ParenthesisNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ParenthesisNode',\n      content: this.content\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\n\n  ParenthesisNode.fromJSON = function (json) {\n    return new ParenthesisNode(json.content);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\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\n    return this.content.toHTML(options);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ParenthesisNode.prototype._toTex = function (options) {\n    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n      return \"\\\\left(\".concat(this.content.toTex(options), \"\\\\right)\");\n    }\n\n    return this.content.toTex(options);\n  };\n\n  return ParenthesisNode;\n}, {\n  isClass: true,\n  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';\nexport var properties = [{\n  // assignment\n  AssignmentNode: {},\n  FunctionAssignmentNode: {}\n}, {\n  // conditional expression\n  ConditionalNode: {\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false // conditionals don't need parentheses in LaTeX because\n    // they are 2 dimensional\n\n  }\n}, {\n  // logical or\n  'OperatorNode:or': {\n    associativity: 'left',\n    associativeWith: []\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: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n  },\n  'OperatorNode:divide': {\n    associativity: 'left',\n    associativeWith: [],\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false // fractions don't require parentheses because\n    // they're 2 dimensional, so parens aren't needed\n    // in LaTeX\n\n  },\n  'OperatorNode:dotMultiply': {\n    associativity: 'left',\n    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']\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 // the exponent doesn't need parentheses in\n    // LaTeX because it's 2 dimensional\n    // (it's on top)\n\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 * 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 */\n\nexport function getPrecedence(_node, parenthesis) {\n  var node = _node;\n\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n\n  var identifier = node.getIdentifier();\n\n  for (var i = 0; i < properties.length; i++) {\n    if (identifier in properties[i]) {\n      return i;\n    }\n  }\n\n  return null;\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 */\n\nexport function getAssociativity(_node, parenthesis) {\n  var node = _node;\n\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n\n  var identifier = node.getIdentifier();\n  var index = getPrecedence(node, parenthesis);\n\n  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n\n  var property = properties[index][identifier];\n\n  if (hasOwnProperty(property, 'associativity')) {\n    if (property.associativity === 'left') {\n      return 'left';\n    }\n\n    if (property.associativity === 'right') {\n      return 'right';\n    } // associativity is invalid\n\n\n    throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' + property.associativity + '\\'.');\n  } // associativity is undefined\n\n\n  return null;\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 */\n\nexport function isAssociativeWith(nodeA, nodeB, parenthesis) {\n  // ParenthesisNodes are only ignored when not in 'keep' mode\n  var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;\n  var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;\n  var identifierA = a.getIdentifier();\n  var identifierB = b.getIdentifier();\n  var index = getPrecedence(a, parenthesis);\n\n  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n\n  var property = properties[index][identifierA];\n\n  if (hasOwnProperty(property, 'associativeWith') && property.associativeWith instanceof Array) {\n    for (var i = 0; i < property.associativeWith.length; i++) {\n      if (property.associativeWith[i] === identifierB) {\n        return true;\n      }\n    }\n\n    return false;\n  } // associativeWith is not defined\n\n\n  return null;\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';\nvar name = 'RelationalNode';\nvar dependencies = ['Node'];\nexport var createRelationalNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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\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    this.conditionals = conditionals;\n    this.params = params;\n  }\n\n  RelationalNode.prototype = new Node();\n  RelationalNode.prototype.type = 'RelationalNode';\n  RelationalNode.prototype.isRelationalNode = true;\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\n  RelationalNode.prototype._compile = function (math, argNames) {\n    var self = this;\n    var compiled = this.params.map(p => p._compile(math, argNames));\n    return function evalRelationalNode(scope, args, context) {\n      var evalLhs;\n      var evalRhs = compiled[0](scope, args, context);\n\n      for (var i = 0; i < self.conditionals.length; i++) {\n        evalLhs = evalRhs;\n        evalRhs = compiled[i + 1](scope, args, context);\n        var condFn = getSafeProperty(math, self.conditionals[i]);\n\n        if (!condFn(evalLhs, evalRhs)) {\n          return false;\n        }\n      }\n\n      return true;\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\n\n  RelationalNode.prototype.forEach = function (callback) {\n    this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);\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\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   * Create a clone of this node, a shallow copy\n   * @return {RelationalNode}\n   */\n\n\n  RelationalNode.prototype.clone = function () {\n    return new RelationalNode(this.conditionals, this.params);\n  };\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = getPrecedence(p, parenthesis);\n      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);\n    });\n    var operatorMap = {\n      equal: '==',\n      unequal: '!=',\n      smaller: '<',\n      larger: '>',\n      smallerEq: '<=',\n      largerEq: '>='\n    };\n    var ret = paramStrings[0];\n\n    for (var i = 0; i < this.conditionals.length; i++) {\n      ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1];\n    }\n\n    return ret;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  RelationalNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'RelationalNode',\n      conditionals: this.conditionals,\n      params: this.params\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\n\n  RelationalNode.fromJSON = function (json) {\n    return new RelationalNode(json.conditionals, json.params);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = getPrecedence(p, parenthesis);\n      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);\n    });\n    var operatorMap = {\n      equal: '==',\n      unequal: '!=',\n      smaller: '<',\n      larger: '>',\n      smallerEq: '<=',\n      largerEq: '>='\n    };\n    var ret = paramStrings[0];\n\n    for (var 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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = getPrecedence(p, parenthesis);\n      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\\\left(' + p.toTex(options) + '\\right)' : p.toTex(options);\n    });\n    var ret = paramStrings[0];\n\n    for (var 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}, {\n  isClass: true,\n  isNode: 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';\nvar name = 'Chain';\nvar dependencies = ['?on', 'math'];\nexport var createChainClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    on,\n    math\n  } = _ref;\n\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   * Attach type information\n   */\n\n\n  Chain.prototype.type = 'Chain';\n  Chain.prototype.isChain = true;\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method valueOf()\n   * @returns {*} value\n   */\n\n  Chain.prototype.done = function () {\n    return this.value;\n  };\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method done()\n   * @returns {*} value\n   */\n\n\n  Chain.prototype.valueOf = function () {\n    return this.value;\n  };\n  /**\n   * Get a string representation of the value in the chain\n   * @returns {string}\n   */\n\n\n  Chain.prototype.toString = function () {\n    return format(this.value);\n  };\n  /**\n   * Get a JSON representation of the chain\n   * @returns {Object}\n   */\n\n\n  Chain.prototype.toJSON = function () {\n    return {\n      mathjs: 'Chain',\n      value: this.value\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\n\n  Chain.fromJSON = function (json) {\n    return new Chain(json.value);\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\n\n  function createProxy(name, fn) {\n    if (typeof fn === 'function') {\n      Chain.prototype[name] = chainify(fn);\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\n\n  function createLazyProxy(name, resolver) {\n    lazy(Chain.prototype, name, function outerResolver() {\n      var fn = resolver();\n\n      if (typeof fn === 'function') {\n        return chainify(fn);\n      }\n\n      return undefined; // if not a function, ignore\n    });\n  }\n  /**\n   * Make a function chainable\n   * @param {function} fn\n   * @return {Function} chain function\n   * @private\n   */\n\n\n  function chainify(fn) {\n    return function () {\n      var args = [this.value]; // `this` will be the context of a Chain instance\n\n      for (var 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   * 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\n\n  Chain.createProxy = function (arg0, arg1) {\n    if (typeof arg0 === 'string') {\n      // createProxy(name, value)\n      createProxy(arg0, arg1);\n    } else {\n      var _loop = function _loop(_name) {\n        if (hasOwnProperty(arg0, _name) && excludedNames[_name] === undefined) {\n          createLazyProxy(_name, () => arg0[_name]);\n        }\n      };\n\n      // createProxy(values)\n      for (var _name in arg0) {\n        _loop(_name);\n      }\n    }\n  };\n\n  var 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  }; // create proxy for everything that is in math.js\n\n  Chain.createProxy(math); // register on the import event, automatically add a proxy for every imported function.\n\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}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nvar name = 'reviver';\nvar dependencies = ['classes'];\nexport var createReviver = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    classes\n  } = _ref;\n\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    var 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});","import { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'ConditionalNode';\nvar dependencies = ['Node'];\nexport var createConditionalNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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\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    this.condition = condition;\n    this.trueExpr = trueExpr;\n    this.falseExpr = falseExpr;\n  }\n\n  ConditionalNode.prototype = new Node();\n  ConditionalNode.prototype.type = 'ConditionalNode';\n  ConditionalNode.prototype.isConditionalNode = true;\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\n  ConditionalNode.prototype._compile = function (math, argNames) {\n    var evalCondition = this.condition._compile(math, argNames);\n\n    var evalTrueExpr = this.trueExpr._compile(math, argNames);\n\n    var evalFalseExpr = this.falseExpr._compile(math, argNames);\n\n    return function evalConditionalNode(scope, args, context) {\n      return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);\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\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   * 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\n\n  ConditionalNode.prototype.map = function (callback) {\n    return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConditionalNode}\n   */\n\n\n  ConditionalNode.prototype.clone = function () {\n    return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis); // 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\n    var condition = this.condition.toString(options);\n    var conditionPrecedence = getPrecedence(this.condition, parenthesis);\n\n    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n      condition = '(' + condition + ')';\n    }\n\n    var trueExpr = this.trueExpr.toString(options);\n    var truePrecedence = getPrecedence(this.trueExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n      trueExpr = '(' + trueExpr + ')';\n    }\n\n    var falseExpr = this.falseExpr.toString(options);\n    var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n      falseExpr = '(' + falseExpr + ')';\n    }\n\n    return condition + ' ? ' + trueExpr + ' : ' + falseExpr;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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   * 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\n\n  ConditionalNode.fromJSON = function (json) {\n    return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = getPrecedence(this, parenthesis); // 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\n    var condition = this.condition.toHTML(options);\n    var conditionPrecedence = getPrecedence(this.condition, parenthesis);\n\n    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || 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    var trueExpr = this.trueExpr.toHTML(options);\n    var truePrecedence = getPrecedence(this.trueExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || 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    var falseExpr = this.falseExpr.toHTML(options);\n    var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || 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\n    return condition + '<span class=\"math-operator math-conditional-operator\">?</span>' + trueExpr + '<span class=\"math-operator math-conditional-operator\">:</span>' + falseExpr;\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype._toTex = function (options) {\n    return '\\\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\\\quad{\\\\text{if }\\\\;' + this.condition.toTex(options) + '}\\\\\\\\{' + this.falseExpr.toTex(options) + '}, &\\\\quad{\\\\text{otherwise}}\\\\end{cases}';\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\n\n  function testCondition(condition) {\n    if (typeof condition === 'number' || typeof condition === 'boolean' || 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}, {\n  isClass: true,\n  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';\nvar name = 'OperatorNode';\nvar dependencies = ['Node'];\nexport var createOperatorNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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   */\n  function OperatorNode(op, fn, args, implicit) {\n    if (!(this instanceof OperatorNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (typeof op !== 'string') {\n      throw new TypeError('string expected for parameter \"op\"');\n    }\n\n    if (typeof fn !== 'string') {\n      throw new TypeError('string expected for parameter \"fn\"');\n    }\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.op = op;\n    this.fn = fn;\n    this.args = args || [];\n  }\n\n  OperatorNode.prototype = new Node();\n  OperatorNode.prototype.type = 'OperatorNode';\n  OperatorNode.prototype.isOperatorNode = true;\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\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    var fn = getSafeProperty(math, this.fn);\n    var evalArgs = map(this.args, function (arg) {\n      return arg._compile(math, argNames);\n    });\n\n    if (evalArgs.length === 1) {\n      var 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      var _evalArg = evalArgs[0];\n      var evalArg1 = evalArgs[1];\n      return function evalOperatorNode(scope, args, context) {\n        return fn(_evalArg(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   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  OperatorNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this);\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\n\n  OperatorNode.prototype.map = function (callback) {\n    var args = [];\n\n    for (var i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n    }\n\n    return new OperatorNode(this.op, this.fn, args, this.implicit);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {OperatorNode}\n   */\n\n\n  OperatorNode.prototype.clone = function () {\n    return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit);\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\n\n  OperatorNode.prototype.isUnary = function () {\n    return this.args.length === 1;\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\n\n  OperatorNode.prototype.isBinary = function () {\n    return this.args.length === 2;\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\n\n  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {\n    // precedence of the root OperatorNode\n    var precedence = getPrecedence(root, parenthesis);\n    var 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) {\n          // Nodes that don't need extra parentheses\n          case 'ArrayNode':\n          case 'ConstantNode':\n          case 'SymbolNode':\n          case 'ParenthesisNode':\n            return false;\n\n          default:\n            return true;\n        }\n      });\n    }\n\n    var result;\n\n    switch (args.length) {\n      case 0:\n        result = [];\n        break;\n\n      case 1:\n        // unary operators\n        {\n          // precedence of the operand\n          var operandPrecedence = getPrecedence(args[0], parenthesis); // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n          if (latex && operandPrecedence !== null) {\n            var operandIdentifier;\n            var rootIdentifier;\n\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\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          } // otherwise, no parens needed\n\n\n          result = [false];\n        }\n        break;\n\n      case 2:\n        // binary operators\n        {\n          var lhsParens; // left hand side needs parenthesis?\n          // precedence of the left hand side\n\n          var lhsPrecedence = getPrecedence(args[0], parenthesis); // is the root node associative with the left hand side\n\n          var 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          var rhsParens; // right hand side needs parenthesis?\n          // precedence of the right hand side\n\n          var rhsPrecedence = getPrecedence(args[1], parenthesis); // is the root node associative with the right hand side?\n\n          var 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          } // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n\n          if (latex) {\n            var _rootIdentifier;\n\n            var lhsIdentifier;\n            var rhsIdentifier;\n\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            var argPrecedence = getPrecedence(arg, parenthesis);\n            var assocWithArg = isAssociativeWith(root, arg, parenthesis);\n            var argAssociativity = getAssociativity(arg, parenthesis);\n\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\n        break;\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\n\n    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis === 'auto' && implicit === 'hide') {\n      result = args.map(function (arg, index) {\n        var isParenthesisNode = arg.getIdentifier() === 'ParenthesisNode';\n\n        if (result[index] || isParenthesisNode) {\n          // put in parenthesis?\n          return true;\n        }\n\n        return false;\n      });\n    }\n\n    return result;\n  }\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = getAssociativity(this, parenthesis);\n      var operand = args[0].toString(options);\n\n      if (parens[0]) {\n        operand = '(' + operand + ')';\n      } // for example for \"not\", we want a space between operand and argument\n\n\n      var opIsNamed = /[a-zA-Z]+/.test(this.op);\n\n      if (assoc === 'right') {\n        // prefix operator\n        return this.op + (opIsNamed ? ' ' : '') + operand;\n      } else if (assoc === 'left') {\n        // postfix\n        return operand + (opIsNamed ? ' ' : '') + this.op;\n      } // fall back to postfix\n\n\n      return operand + this.op;\n    } else if (args.length === 2) {\n      var lhs = args[0].toString(options); // left hand side\n\n      var rhs = args[1].toString(options); // right hand side\n\n      if (parens[0]) {\n        // left hand side in parenthesis?\n        lhs = '(' + lhs + ')';\n      }\n\n      if (parens[1]) {\n        // 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      var stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toString(options);\n\n        if (parens[index]) {\n          // 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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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    };\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}`,\n   *                       where mathjs is optional\n   * @returns {OperatorNode}\n   */\n\n\n  OperatorNode.fromJSON = function (json) {\n    return new OperatorNode(json.op, json.fn, json.args, json.implicit);\n  };\n  /**\n   * Get HTML representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = getAssociativity(this, parenthesis);\n      var operand = args[0].toHTML(options);\n\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') {\n        // prefix operator\n        return '<span class=\"math-operator math-unary-operator math-lefthand-unary-operator\">' + escape(this.op) + '</span>' + operand;\n      } else {\n        // 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) {\n      // binary operatoes\n      var lhs = args[0].toHTML(options); // left hand side\n\n      var rhs = args[1].toHTML(options); // right hand side\n\n      if (parens[0]) {\n        // 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\n      if (parens[1]) {\n        // 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      var stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toHTML(options);\n\n        if (parens[index]) {\n          // 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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);\n    var op = latexOperators[this.fn];\n    op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = getAssociativity(this, parenthesis);\n      var operand = args[0].toTex(options);\n\n      if (parens[0]) {\n        operand = \"\\\\left(\".concat(operand, \"\\\\right)\");\n      }\n\n      if (assoc === 'right') {\n        // prefix operator\n        return op + operand;\n      } else if (assoc === 'left') {\n        // postfix operator\n        return operand + op;\n      } // fall back to postfix\n\n\n      return operand + op;\n    } else if (args.length === 2) {\n      // binary operators\n      var lhs = args[0]; // left hand side\n\n      var lhsTex = lhs.toTex(options);\n\n      if (parens[0]) {\n        lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n      }\n\n      var rhs = args[1]; // right hand side\n\n      var rhsTex = rhs.toTex(options);\n\n      if (parens[1]) {\n        rhsTex = \"\\\\left(\".concat(rhsTex, \"\\\\right)\");\n      } // handle some exceptions (due to the way LaTeX works)\n\n\n      var lhsIdentifier;\n\n      if (parenthesis === 'keep') {\n        lhsIdentifier = lhs.getIdentifier();\n      } else {\n        // Ignore ParenthesisNodes if in 'keep' mode\n        lhsIdentifier = lhs.getContent().getIdentifier();\n      }\n\n      switch (this.getIdentifier()) {\n        case 'OperatorNode:divide':\n          // op contains '\\\\frac' at this point\n          return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';\n\n        case 'OperatorNode:pow':\n          lhsTex = '{' + lhsTex + '}';\n          rhsTex = '{' + rhsTex + '}';\n\n          switch (lhsIdentifier) {\n            case 'ConditionalNode': //\n\n            case 'OperatorNode:divide':\n              lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n          }\n\n          break;\n\n        case 'OperatorNode:multiply':\n          if (this.implicit && implicit === 'hide') {\n            return lhsTex + '~' + rhsTex;\n          }\n\n      }\n\n      return lhsTex + op + rhsTex;\n    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n      var texifiedArgs = args.map(function (arg, index) {\n        arg = arg.toTex(options);\n\n        if (parens[index]) {\n          arg = \"\\\\left(\".concat(arg, \"\\\\right)\");\n        }\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(' + args.map(function (arg) {\n        return arg.toTex(options);\n      }).join(',') + '\\\\right)';\n    }\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  OperatorNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.fn;\n  };\n\n  return OperatorNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode, isSymbolNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'RangeNode';\nvar dependencies = ['Node'];\nexport var createRangeNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Node\n  } = _ref;\n\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    } // validate inputs\n\n\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    this.start = start; // included lower-bound\n\n    this.end = end; // included upper-bound\n\n    this.step = step || null; // optional step\n  }\n\n  RangeNode.prototype = new Node();\n  RangeNode.prototype.type = 'RangeNode';\n  RangeNode.prototype.isRangeNode = true;\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\n  RangeNode.prototype.needsEnd = function () {\n    // find all `end` symbols in this RangeNode\n    var endSymbols = this.filter(function (node) {\n      return isSymbolNode(node) && node.name === 'end';\n    });\n    return endSymbols.length > 0;\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\n\n  RangeNode.prototype._compile = function (math, argNames) {\n    var range = math.range;\n\n    var evalStart = this.start._compile(math, argNames);\n\n    var evalEnd = this.end._compile(math, argNames);\n\n    if (this.step) {\n      var evalStep = this.step._compile(math, argNames);\n\n      return function evalRangeNode(scope, args, context) {\n        return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));\n      };\n    } else {\n      return function evalRangeNode(scope, args, context) {\n        return range(evalStart(scope, args, context), evalEnd(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\n\n  RangeNode.prototype.forEach = function (callback) {\n    callback(this.start, 'start', this);\n    callback(this.end, 'end', this);\n\n    if (this.step) {\n      callback(this.step, 'step', this);\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\n\n  RangeNode.prototype.map = function (callback) {\n    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)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {RangeNode}\n   */\n\n\n  RangeNode.prototype.clone = function () {\n    return new RangeNode(this.start, this.end, this.step && this.step);\n  };\n  /**\n   * Calculate the necessary parentheses\n   * @param {Node} node\n   * @param {string} parenthesis\n   * @return {Object} parentheses\n   * @private\n   */\n\n\n  function calculateNecessaryParentheses(node, parenthesis) {\n    var precedence = getPrecedence(node, parenthesis);\n    var parens = {};\n    var startPrecedence = getPrecedence(node.start, parenthesis);\n    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n\n    if (node.step) {\n      var stepPrecedence = getPrecedence(node.step, parenthesis);\n      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n    }\n\n    var endPrecedence = getPrecedence(node.end, parenthesis);\n    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n    return parens;\n  }\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n    var str;\n    var start = this.start.toString(options);\n\n    if (parens.start) {\n      start = '(' + start + ')';\n    }\n\n    str = start;\n\n    if (this.step) {\n      var step = this.step.toString(options);\n\n      if (parens.step) {\n        step = '(' + step + ')';\n      }\n\n      str += ':' + step;\n    }\n\n    var end = this.end.toString(options);\n\n    if (parens.end) {\n      end = '(' + end + ')';\n    }\n\n    str += ':' + end;\n    return str;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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   * 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\n\n  RangeNode.fromJSON = function (json) {\n    return new RangeNode(json.start, json.end, json.step);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n    var str;\n    var start = this.start.toHTML(options);\n\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\n    str = start;\n\n    if (this.step) {\n      var step = this.step.toHTML(options);\n\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\n      str += '<span class=\"math-operator math-range-operator\">:</span>' + step;\n    }\n\n    var end = this.end.toHTML(options);\n\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\n    str += '<span class=\"math-operator math-range-operator\">:</span>' + end;\n    return str;\n  };\n  /**\n   * Get LaTeX representation\n   * @params {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis);\n    var str = this.start.toTex(options);\n\n    if (parens.start) {\n      str = \"\\\\left(\".concat(str, \"\\\\right)\");\n    }\n\n    if (this.step) {\n      var step = this.step.toTex(options);\n\n      if (parens.step) {\n        step = \"\\\\left(\".concat(step, \"\\\\right)\");\n      }\n\n      str += ':' + step;\n    }\n\n    var end = this.end.toTex(options);\n\n    if (parens.end) {\n      end = \"\\\\left(\".concat(end, \"\\\\right)\");\n    }\n\n    str += ':' + end;\n    return str;\n  };\n\n  return RangeNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { isNode } from '../../utils/is.js';\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 { setSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'FunctionAssignmentNode';\nvar dependencies = ['typed', 'Node'];\nexport var createFunctionAssignmentNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Node\n  } = _ref;\n\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    } // validate input\n\n\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 (name in keywords) throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\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  FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode';\n  FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true;\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\n  FunctionAssignmentNode.prototype._compile = function (math, argNames) {\n    var childArgNames = Object.create(argNames);\n    forEach(this.params, function (param) {\n      childArgNames[param] = true;\n    }); // compile the function expression with the child args\n\n    var evalExpr = this.expr._compile(math, childArgNames);\n\n    var name = this.name;\n    var params = this.params;\n    var signature = join(this.types, ',');\n    var syntax = name + '(' + join(this.params, ', ') + ')';\n    return function evalFunctionAssignmentNode(scope, args, context) {\n      var signatures = {};\n\n      signatures[signature] = function () {\n        var childArgs = Object.create(args);\n\n        for (var i = 0; i < params.length; i++) {\n          childArgs[params[i]] = arguments[i];\n        }\n\n        return evalExpr(scope, childArgs, context);\n      };\n\n      var fn = typed(name, signatures);\n      fn.syntax = syntax;\n      setSafeProperty(scope, name, fn);\n      return fn;\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\n\n  FunctionAssignmentNode.prototype.forEach = function (callback) {\n    callback(this.expr, 'expr', this);\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\n\n  FunctionAssignmentNode.prototype.map = function (callback) {\n    var expr = this._ifNode(callback(this.expr, 'expr', this));\n\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionAssignmentNode}\n   */\n\n\n  FunctionAssignmentNode.prototype.clone = function () {\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);\n  };\n  /**\n   * Is parenthesis needed?\n   * @param {Node} node\n   * @param {Object} parenthesis\n   * @private\n   */\n\n\n  function needParenthesis(node, parenthesis) {\n    var precedence = getPrecedence(node, parenthesis);\n    var exprPrecedence = getPrecedence(node.expr, parenthesis);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  /**\n   * get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var expr = this.expr.toString(options);\n\n    if (needParenthesis(this, parenthesis)) {\n      expr = '(' + expr + ')';\n    }\n\n    return this.name + '(' + this.params.join(', ') + ') = ' + expr;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  FunctionAssignmentNode.prototype.toJSON = function () {\n    var types = this.types;\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   * 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\n\n  FunctionAssignmentNode.fromJSON = function (json) {\n    return new FunctionAssignmentNode(json.name, json.params, json.expr);\n  };\n  /**\n   * get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var params = [];\n\n    for (var i = 0; i < this.params.length; i++) {\n      params.push('<span class=\"math-symbol math-parameter\">' + escape(this.params[i]) + '</span>');\n    }\n\n    var expr = this.expr.toHTML(options);\n\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\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   * get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var expr = this.expr.toTex(options);\n\n    if (needParenthesis(this, parenthesis)) {\n      expr = \"\\\\left(\".concat(expr, \"\\\\right)\");\n    }\n\n    return '\\\\mathrm{' + this.name + '}\\\\left(' + this.params.map(toSymbol).join(',') + '\\\\right):=' + expr;\n  };\n\n  return FunctionAssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'chain';\nvar dependencies = ['typed', 'Chain'];\nexport var createChain = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Chain\n  } = _ref;\n\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    any: function any(value) {\n      return new Chain(value);\n    }\n  });\n});","import { IndexError } from '../../../error/IndexError.js';\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 */\n\nexport function errorTransform(err) {\n  if (err && err.isIndexError) {\n    return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\n  }\n\n  return err;\n}","import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { getSafeProperty } from '../../../utils/customs.js';\nexport function accessFactory(_ref) {\n  var {\n    subset\n  } = _ref;\n\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') {\n        // 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}","import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isNode, isObjectNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { accessFactory } from './utils/access.js';\nvar name = 'AccessorNode';\nvar dependencies = ['subset', 'Node'];\nexport var createAccessorNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    subset,\n    Node\n  } = _ref;\n  var access = accessFactory({\n    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\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\n    if (!isIndexNode(index)) {\n      throw new TypeError('IndexNode expected for parameter \"index\"');\n    }\n\n    this.object = object || null;\n    this.index = index; // readonly property name\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  AccessorNode.prototype = new Node();\n  AccessorNode.prototype.type = 'AccessorNode';\n  AccessorNode.prototype.isAccessorNode = true;\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\n  AccessorNode.prototype._compile = function (math, argNames) {\n    var evalObject = this.object._compile(math, argNames);\n\n    var evalIndex = this.index._compile(math, argNames);\n\n    if (this.index.isObjectProperty()) {\n      var prop = this.index.getObjectProperty();\n      return function evalAccessorNode(scope, args, context) {\n        return getSafeProperty(evalObject(scope, args, context), prop);\n      };\n    } else {\n      return function evalAccessorNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        var index = evalIndex(scope, args, object); // we pass object here instead of context\n\n        return access(object, index);\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\n\n  AccessorNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this);\n    callback(this.index, 'index', this);\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\n\n  AccessorNode.prototype.map = function (callback) {\n    return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AccessorNode}\n   */\n\n\n  AccessorNode.prototype.clone = function () {\n    return new AccessorNode(this.object, this.index);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype._toString = function (options) {\n    var object = this.object.toString(options);\n\n    if (needParenthesis(this.object)) {\n      object = '(' + object + ')';\n    }\n\n    return object + this.index.toString(options);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype.toHTML = function (options) {\n    var object = this.object.toHTML(options);\n\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype._toTex = function (options) {\n    var object = this.object.toTex(options);\n\n    if (needParenthesis(this.object)) {\n      object = '\\\\left(\\' + object + \\'\\\\right)';\n    }\n\n    return object + this.index.toTex(options);\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  AccessorNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'AccessorNode',\n      object: this.object,\n      index: this.index\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\n\n  AccessorNode.fromJSON = function (json) {\n    return new AccessorNode(json.object, json.index);\n  };\n  /**\n   * Are parenthesis needed?\n   * @private\n   */\n\n\n  function needParenthesis(node) {\n    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n    return !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));\n  }\n\n  return AccessorNode;\n}, {\n  isClass: true,\n  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';\nvar name = 'IndexNode';\nvar dependencies = ['Range', 'Node', 'size'];\nexport var createIndexNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Range,\n    Node,\n    size\n  } = _ref;\n\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; // validate input\n\n    if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"');\n    }\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  IndexNode.prototype.type = 'IndexNode';\n  IndexNode.prototype.isIndexNode = true;\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\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    // TODO: Optimization: when the range values are ConstantNodes,\n    //       we can beforehand resolve the zero-based value\n    // optimization for a simple object property\n    var 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          var childArgNames = Object.create(argNames);\n          childArgNames.end = true;\n\n          var evalStart = range.start._compile(math, childArgNames);\n\n          var evalEnd = range.end._compile(math, childArgNames);\n\n          var evalStep = range.step ? range.step._compile(math, childArgNames) : function () {\n            return 1;\n          };\n          return function evalDimension(scope, args, context) {\n            var s = size(context).valueOf();\n            var childArgs = Object.create(args);\n            childArgs.end = s[i];\n            return createRange(evalStart(scope, childArgs, context), evalEnd(scope, childArgs, context), evalStep(scope, childArgs, context));\n          };\n        } else {\n          // create range\n          var _evalStart = range.start._compile(math, argNames);\n\n          var _evalEnd = range.end._compile(math, argNames);\n\n          var _evalStep = range.step ? range.step._compile(math, argNames) : function () {\n            return 1;\n          };\n\n          return function evalDimension(scope, args, context) {\n            return createRange(_evalStart(scope, args, context), _evalEnd(scope, args, context), _evalStep(scope, args, context));\n          };\n        }\n      } else if (isSymbolNode(range) && range.name === 'end') {\n        // SymbolNode 'end'\n        var _childArgNames = Object.create(argNames);\n\n        _childArgNames.end = true;\n\n        var evalRange = range._compile(math, _childArgNames);\n\n        return function evalDimension(scope, args, context) {\n          var s = size(context).valueOf();\n          var childArgs = Object.create(args);\n          childArgs.end = s[i];\n          return evalRange(scope, childArgs, context);\n        };\n      } else {\n        // ConstantNode\n        var _evalRange = range._compile(math, argNames);\n\n        return function evalDimension(scope, args, context) {\n          return _evalRange(scope, args, context);\n        };\n      }\n    });\n    var index = getSafeProperty(math, 'index');\n    return function evalIndexNode(scope, args, context) {\n      var dimensions = map(evalDimensions, function (evalDimension) {\n        return evalDimension(scope, args, context);\n      });\n      return index(...dimensions);\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\n\n  IndexNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.dimensions.length; i++) {\n      callback(this.dimensions[i], 'dimensions[' + i + ']', this);\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\n\n  IndexNode.prototype.map = function (callback) {\n    var dimensions = [];\n\n    for (var 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   * Create a clone of this node, a shallow copy\n   * @return {IndexNode}\n   */\n\n\n  IndexNode.prototype.clone = function () {\n    return new IndexNode(this.dimensions.slice(0), this.dotNotation);\n  };\n  /**\n   * Test whether this IndexNode contains a single property name\n   * @return {boolean}\n   */\n\n\n  IndexNode.prototype.isObjectProperty = function () {\n    return this.dimensions.length === 1 && isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';\n  };\n  /**\n   * Returns the property name if IndexNode contains a property.\n   * If not, returns null.\n   * @return {string | null}\n   */\n\n\n  IndexNode.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this.dimensions[0].value : null;\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype._toString = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  IndexNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'IndexNode',\n      dimensions: this.dimensions,\n      dotNotation: this.dotNotation\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\n\n  IndexNode.fromJSON = function (json) {\n    return new IndexNode(json.dimensions, json.dotNotation);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype.toHTML = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    var dimensions = [];\n\n    for (var i = 0; i < this.dimensions.length; i++) {\n      dimensions[i] = this.dimensions[i].toHTML();\n    }\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype._toTex = function (options) {\n    var dimensions = this.dimensions.map(function (range) {\n      return range.toTex(options);\n    });\n    return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';\n  }; // helper function to create a Range from start, step and end\n\n\n  function createRange(start, end, step) {\n    return new Range(isBigNumber(start) ? start.toNumber() : start, isBigNumber(end) ? end.toNumber() : end, isBigNumber(step) ? step.toNumber() : step);\n  }\n\n  return IndexNode;\n}, {\n  isClass: true,\n  isNode: true\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';\nvar name = 'AssignmentNode';\nvar dependencies = ['subset', '?matrix', // FIXME: should not be needed at all, should be handled by subset\n'Node'];\nexport var createAssignmentNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    subset,\n    matrix,\n    Node\n  } = _ref;\n  var access = accessFactory({\n    subset\n  });\n  var assign = assignFactory({\n    subset,\n    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\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; // validate input\n\n    if (!isSymbolNode(object) && !isAccessorNode(object)) {\n      throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n    }\n\n    if (isSymbolNode(object) && object.name === 'end') {\n      throw new Error('Cannot assign to symbol \"end\"');\n    }\n\n    if (this.index && !isIndexNode(this.index)) {\n      // index is optional\n      throw new TypeError('IndexNode expected as \"index\"');\n    }\n\n    if (!isNode(this.value)) {\n      throw new TypeError('Node expected as \"value\"');\n    } // readonly property name\n\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  AssignmentNode.prototype = new Node();\n  AssignmentNode.prototype.type = 'AssignmentNode';\n  AssignmentNode.prototype.isAssignmentNode = true;\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\n  AssignmentNode.prototype._compile = function (math, argNames) {\n    var evalObject = this.object._compile(math, argNames);\n\n    var evalIndex = this.index ? this.index._compile(math, argNames) : null;\n\n    var evalValue = this.value._compile(math, argNames);\n\n    var 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        return setSafeProperty(scope, name, evalValue(scope, args, context));\n      };\n    } else if (this.index.isObjectProperty()) {\n      // apply an object property for example `a.b=2`\n      var prop = this.index.getObjectProperty();\n      return function evalAssignmentNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        var value = evalValue(scope, args, context);\n        return setSafeProperty(object, prop, 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        var childObject = evalObject(scope, args, context);\n        var value = evalValue(scope, args, context);\n        var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context\n\n        setSafeProperty(scope, name, assign(childObject, index, value));\n        return value;\n      };\n    } else {\n      // isAccessorNode(node.object) === true\n      // update a matrix subset, for example `a.b[2]=3`\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      var evalParentObject = this.object.object._compile(math, argNames);\n\n      if (this.object.index.isObjectProperty()) {\n        var parentProp = this.object.index.getObjectProperty();\n        return function evalAssignmentNode(scope, args, context) {\n          var parent = evalParentObject(scope, args, context);\n          var childObject = getSafeProperty(parent, parentProp);\n          var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context\n\n          var 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        var evalParentIndex = this.object.index._compile(math, argNames);\n\n        return function evalAssignmentNode(scope, args, context) {\n          var parent = evalParentObject(scope, args, context);\n          var parentIndex = evalParentIndex(scope, args, parent); // Important: we pass parent instead of context\n\n          var childObject = access(parent, parentIndex);\n          var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context\n\n          var value = evalValue(scope, args, context);\n          assign(parent, parentIndex, assign(childObject, index, value));\n          return value;\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\n\n  AssignmentNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this);\n\n    if (this.index) {\n      callback(this.index, 'index', this);\n    }\n\n    callback(this.value, 'value', this);\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\n\n  AssignmentNode.prototype.map = function (callback) {\n    var object = this._ifNode(callback(this.object, 'object', this));\n\n    var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;\n\n    var value = this._ifNode(callback(this.value, 'value', this));\n\n    return new AssignmentNode(object, index, value);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AssignmentNode}\n   */\n\n\n  AssignmentNode.prototype.clone = function () {\n    return new AssignmentNode(this.object, this.index, this.value);\n  };\n  /*\n   * Is parenthesis needed?\n   * @param {node} node\n   * @param {string} [parenthesis='keep']\n   * @private\n   */\n\n\n  function needParenthesis(node, parenthesis) {\n    if (!parenthesis) {\n      parenthesis = 'keep';\n    }\n\n    var precedence = getPrecedence(node, parenthesis);\n    var exprPrecedence = getPrecedence(node.value, parenthesis);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype._toString = function (options) {\n    var object = this.object.toString(options);\n    var index = this.index ? this.index.toString(options) : '';\n    var value = this.value.toString(options);\n\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = '(' + value + ')';\n    }\n\n    return object + index + ' = ' + value;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\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   * 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\n\n  AssignmentNode.fromJSON = function (json) {\n    return new AssignmentNode(json.object, json.index, json.value);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype.toHTML = function (options) {\n    var object = this.object.toHTML(options);\n    var index = this.index ? this.index.toHTML(options) : '';\n    var value = this.value.toHTML(options);\n\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   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype._toTex = function (options) {\n    var object = this.object.toTex(options);\n    var index = this.index ? this.index.toTex(options) : '';\n    var value = this.value.toTex(options);\n\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = \"\\\\left(\".concat(value, \"\\\\right)\");\n    }\n\n    return object + index + ':=' + value;\n  };\n\n  return AssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});","import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { setSafeProperty } from '../../../utils/customs.js';\nexport function assignFactory(_ref) {\n  var {\n    subset,\n    matrix\n  } = _ref;\n\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') {\n        // 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\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}","import { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { toSymbol } from '../../utils/latex.js';\nvar name = 'SymbolNode';\nvar dependencies = ['math', '?Unit', 'Node'];\nexport var createSymbolNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    math,\n    Unit,\n    Node\n  } = _ref;\n\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   * @constructor SymbolNode\n   * @extends {Node}\n   * A symbol node can hold and resolve a symbol\n   * @param {string} name\n   * @extends {Node}\n   */\n\n\n  function SymbolNode(name) {\n    if (!(this instanceof SymbolNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"');\n    this.name = name;\n  }\n\n  SymbolNode.prototype = new Node();\n  SymbolNode.prototype.type = 'SymbolNode';\n  SymbolNode.prototype.isSymbolNode = true;\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\n  SymbolNode.prototype._compile = function (math, argNames) {\n    var 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 name in scope ? getSafeProperty(scope, name) : getSafeProperty(math, name);\n      };\n    } else {\n      var isUnit = isValuelessUnit(name);\n      return function (scope, args, context) {\n        return name in scope ? getSafeProperty(scope, name) : isUnit ? new Unit(null, name) : undef(name);\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\n\n  SymbolNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs\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\n\n  SymbolNode.prototype.map = function (callback) {\n    return this.clone();\n  };\n  /**\n   * Throws an error 'Undefined symbol {name}'\n   * @param {string} name\n   */\n\n\n  function undef(name) {\n    throw new Error('Undefined symbol ' + name);\n  }\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {SymbolNode}\n   */\n\n\n  SymbolNode.prototype.clone = function () {\n    return new SymbolNode(this.name);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype._toString = function (options) {\n    return this.name;\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype.toHTML = function (options) {\n    var 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   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  SymbolNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'SymbolNode',\n      name: this.name\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\n\n  SymbolNode.fromJSON = function (json) {\n    return new SymbolNode(json.name);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype._toTex = function (options) {\n    var isUnit = false;\n\n    if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n      isUnit = true;\n    }\n\n    var symbol = toSymbol(this.name, isUnit);\n\n    if (symbol[0] === '\\\\') {\n      // no space needed if the symbol starts with '\\'\n      return symbol;\n    } // the space prevents symbols from breaking stuff like '\\cdot' if it's written right before the symbol\n\n\n    return ' ' + symbol;\n  };\n\n  return SymbolNode;\n}, {\n  isClass: true,\n  isNode: true\n});","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); }\n\nimport { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { escape } from '../../utils/string.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { map } from '../../utils/array.js';\nimport { getSafeProperty, validateSafeMethod } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { defaultTemplate, latexFunctions } from '../../utils/latex.js';\nvar name = 'FunctionNode';\nvar dependencies = ['math', 'Node', 'SymbolNode'];\nexport var createFunctionNode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    math,\n    Node,\n    SymbolNode\n  } = _ref;\n\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    } // validate input\n\n\n    if (!isNode(fn)) throw new TypeError('Node expected as 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.fn = fn;\n    this.args = args || []; // readonly property name\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        return this.fn.name || '';\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  FunctionNode.prototype = new Node();\n  FunctionNode.prototype.type = 'FunctionNode';\n  FunctionNode.prototype.isFunctionNode = true;\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\n  FunctionNode.prototype._compile = function (math, argNames) {\n    if (!(this instanceof FunctionNode)) {\n      throw new TypeError('No valid FunctionNode');\n    } // compile arguments\n\n\n    var evalArgs = map(this.args, function (arg) {\n      return arg._compile(math, argNames);\n    });\n\n    if (isSymbolNode(this.fn)) {\n      // we can statically determine whether the function has an rawArgs property\n      var _name = this.fn.name;\n      var fn = _name in math ? getSafeProperty(math, _name) : undefined;\n      var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n\n      if (isRaw) {\n        // pass unevaluated parameters (nodes) to the function\n        // \"raw\" evaluation\n        var rawArgs = this.args;\n        return function evalFunctionNode(scope, args, context) {\n          return (_name in scope ? getSafeProperty(scope, _name) : fn)(rawArgs, math, _extends({}, scope, args));\n        };\n      } else {\n        // \"regular\" evaluation\n        if (evalArgs.length === 1) {\n          var evalArg0 = evalArgs[0];\n          return function evalFunctionNode(scope, args, context) {\n            return (_name in scope ? getSafeProperty(scope, _name) : fn)(evalArg0(scope, args, context));\n          };\n        } else if (evalArgs.length === 2) {\n          var _evalArg = evalArgs[0];\n          var evalArg1 = evalArgs[1];\n          return function evalFunctionNode(scope, args, context) {\n            return (_name in scope ? getSafeProperty(scope, _name) : fn)(_evalArg(scope, args, context), evalArg1(scope, args, context));\n          };\n        } else {\n          return function evalFunctionNode(scope, args, context) {\n            return (_name in scope ? getSafeProperty(scope, _name) : fn).apply(null, map(evalArgs, function (evalArg) {\n              return evalArg(scope, args, context);\n            }));\n          };\n        }\n      }\n    } else if (isAccessorNode(this.fn) && isIndexNode(this.fn.index) && this.fn.index.isObjectProperty()) {\n      // execute the function with the right context: the object of the AccessorNode\n      var evalObject = this.fn.object._compile(math, argNames);\n\n      var prop = this.fn.index.getObjectProperty();\n      var _rawArgs = this.args;\n      return function evalFunctionNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        validateSafeMethod(object, prop);\n        var isRaw = object[prop] && object[prop].rawArgs;\n        return isRaw ? object[prop](_rawArgs, math, _extends({}, scope, args)) // \"raw\" evaluation\n        : object[prop].apply(object, map(evalArgs, function (evalArg) {\n          // \"regular\" evaluation\n          return evalArg(scope, args, context);\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      var evalFn = this.fn._compile(math, argNames);\n\n      var _rawArgs2 = this.args;\n      return function evalFunctionNode(scope, args, context) {\n        var fn = evalFn(scope, args, context);\n        var isRaw = fn && fn.rawArgs;\n        return isRaw ? fn(_rawArgs2, math, _extends({}, scope, args)) // \"raw\" evaluation\n        : fn.apply(fn, map(evalArgs, function (evalArg) {\n          // \"regular\" evaluation\n          return evalArg(scope, args, context);\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\n\n  FunctionNode.prototype.forEach = function (callback) {\n    callback(this.fn, 'fn', this);\n\n    for (var i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this);\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\n\n  FunctionNode.prototype.map = function (callback) {\n    var fn = this._ifNode(callback(this.fn, 'fn', this));\n\n    var args = [];\n\n    for (var i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n    }\n\n    return new FunctionNode(fn, args);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionNode}\n   */\n\n\n  FunctionNode.prototype.clone = function () {\n    return new FunctionNode(this.fn, this.args.slice(0));\n  }; // backup Node's toString function\n  // @private\n\n\n  var nodeToString = FunctionNode.prototype.toString;\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\n  FunctionNode.prototype.toString = function (options) {\n    var customString;\n    var name = this.fn.toString(options);\n\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    } // fall back to Node's toString\n\n\n    return nodeToString.call(this, options);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype._toString = function (options) {\n    var args = this.args.map(function (arg) {\n      return arg.toString(options);\n    });\n    var fn = isFunctionAssignmentNode(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options); // format the arguments like \"add(2, 4.2)\"\n\n    return fn + '(' + args.join(', ') + ')';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  FunctionNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'FunctionNode',\n      fn: this.fn,\n      args: this.args\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\n\n  FunctionNode.fromJSON = function (json) {\n    return new FunctionNode(json.fn, json.args);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype.toHTML = function (options) {\n    var args = this.args.map(function (arg) {\n      return arg.toHTML(options);\n    }); // format the arguments like \"add(2, 4.2)\"\n\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   * Expand a LaTeX template\n   *\n   * @param {string} template\n   * @param {Node} node\n   * @param {Object} options\n   * @private\n   **/\n\n\n  function expandTemplate(template, node, options) {\n    var latex = ''; // Match everything of the form ${identifier} or ${identifier[2]} or $$\n    // while submatching identifier and 2 (in the second case)\n\n    var regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi;\n    var inputPos = 0; // position in the input string\n\n    var match;\n\n    while ((match = regex.exec(template)) !== null) {\n      // 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] === '$$') {\n        // escaped dollar sign\n        latex += '$';\n        inputPos++;\n      } else {\n        // template parameter\n        inputPos += match[0].length;\n        var property = node[match[1]];\n\n        if (!property) {\n          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');\n        }\n\n        if (match[2] === undefined) {\n          // no square brackets\n          switch (typeof property) {\n            case 'string':\n              latex += property;\n              break;\n\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\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\n              break;\n\n            default:\n              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n          }\n        } else {\n          // 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\n    latex += template.slice(inputPos); // append rest of the template\n\n    return latex;\n  } // backup Node's toTex function\n  // @private\n\n\n  var nodeToTex = FunctionNode.prototype.toTex;\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\n  FunctionNode.prototype.toTex = function (options) {\n    var customTex;\n\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    } // fall back to Node's toTex\n\n\n    return nodeToTex.call(this, options);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype._toTex = function (options) {\n    var args = this.args.map(function (arg) {\n      // get LaTeX of the arguments\n      return arg.toTex(options);\n    });\n    var latexConverter;\n\n    if (latexFunctions[this.name]) {\n      latexConverter = latexFunctions[this.name];\n    } // toTex property on the function itself\n\n\n    if (math[this.name] && (typeof math[this.name].toTex === 'function' || typeof math[this.name].toTex === 'object' || typeof math[this.name].toTex === 'string')) {\n      // .toTex is a callback function\n      latexConverter = math[this.name].toTex;\n    }\n\n    var customToTex;\n\n    switch (typeof latexConverter) {\n      case 'function':\n        // a callback function\n        customToTex = latexConverter(this, options);\n        break;\n\n      case 'string':\n        // a template string\n        customToTex = expandTemplate(latexConverter, this, options);\n        break;\n\n      case 'object':\n        // 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\n          case 'string':\n            customToTex = expandTemplate(latexConverter[args.length], this, options);\n            break;\n        }\n\n    }\n\n    if (typeof customToTex !== 'undefined') {\n      return customToTex;\n    }\n\n    return expandTemplate(defaultTemplate, this, options);\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  FunctionNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.name;\n  };\n\n  return FunctionNode;\n}, {\n  isClass: true,\n  isNode: true\n});","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); }\n\nimport { 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';\nvar name = 'parse';\nvar dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];\nexport var createParse = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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  var parse = typed(name, {\n    string: function string(expression) {\n      return parseStart(expression, {});\n    },\n    'Array | Matrix': function ArrayMatrix(expressions) {\n      return parseMultiple(expressions, {});\n    },\n    'string, Object': function stringObject(expression, options) {\n      var extraNodes = options.nodes !== undefined ? options.nodes : {};\n      return parseStart(expression, extraNodes);\n    },\n    'Array | Matrix, Object': parseMultiple\n  });\n\n  function parseMultiple(expressions) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var extraNodes = options.nodes !== undefined ? options.nodes : {}; // parse an array or matrix with expressions\n\n    return deepMap(expressions, function (elem) {\n      if (typeof elem !== 'string') throw new TypeError('String expected');\n      return parseStart(elem, extraNodes);\n    });\n  } // token types enumeration\n\n\n  var TOKENTYPE = {\n    NULL: 0,\n    DELIMITER: 1,\n    NUMBER: 2,\n    SYMBOL: 3,\n    UNKNOWN: 4\n  }; // map with all delimiters\n\n  var DELIMITERS = {\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    '^': 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    '>>': true,\n    '>>>': true\n  }; // map with all named delimiters\n\n  var 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  var CONSTANTS = {\n    true: true,\n    false: false,\n    null: null,\n    undefined: undefined\n  };\n  var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];\n\n  function initialState() {\n    return {\n      extraNodes: {},\n      // current extra nodes, must be careful not to mutate\n      expression: '',\n      // current expression\n      comment: '',\n      // last parsed comment\n      index: 0,\n      // current index in expr\n      token: '',\n      // current token\n      tokenType: TOKENTYPE.NULL,\n      // type of the token\n      nestingLevel: 0,\n      // 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\n\n  function currentString(state, length) {\n    return state.expression.substr(state.index, length);\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\n\n  function currentCharacter(state) {\n    return currentString(state, 1);\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\n\n  function next(state) {\n    state.index++;\n  }\n  /**\n   * Preview the previous character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n\n\n  function prevCharacter(state) {\n    return state.expression.charAt(state.index - 1);\n  }\n  /**\n   * Preview the next character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n\n\n  function nextCharacter(state) {\n    return state.expression.charAt(state.index + 1);\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\n\n  function getToken(state) {\n    state.tokenType = TOKENTYPE.NULL;\n    state.token = '';\n    state.comment = ''; // skip over whitespaces\n    // space, tab, and newline when inside parameters\n\n    while (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n      next(state);\n    } // skip comment\n\n\n    if (currentCharacter(state) === '#') {\n      while (currentCharacter(state) !== '\\n' && currentCharacter(state) !== '') {\n        state.comment += currentCharacter(state);\n        next(state);\n      }\n    } // check for end of expression\n\n\n    if (currentCharacter(state) === '') {\n      // token is still empty\n      state.tokenType = TOKENTYPE.DELIMITER;\n      return;\n    } // check for new line character\n\n\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    var c1 = currentCharacter(state);\n    var c2 = currentString(state, 2);\n    var c3 = currentString(state, 3);\n\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    } // check for delimiters consisting of 2 characters\n\n\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    } // check for delimiters consisting of 1 character\n\n\n    if (DELIMITERS[c1]) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = c1;\n      next(state);\n      return;\n    } // check for a number\n\n\n    if (parse.isDigitDot(c1)) {\n      state.tokenType = TOKENTYPE.NUMBER; // check for binary, octal, or hex\n\n      var _c = currentString(state, 2);\n\n      if (_c === '0b' || _c === '0o' || _c === '0x') {\n        state.token += currentCharacter(state);\n        next(state);\n        state.token += currentCharacter(state);\n        next(state);\n\n        while (parse.isHexDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state);\n          next(state);\n        }\n\n        if (currentCharacter(state) === '.') {\n          // this number has a radix point\n          state.token += '.';\n          next(state); // get the digits after the radix\n\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); // get the word size\n\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state);\n            next(state);\n          }\n        }\n\n        return;\n      } // get number, can have a single dot\n\n\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        }\n      } else {\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          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      } // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n\n\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          } // Scientific notation MUST be followed by an exponent\n\n\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    } // check for variables, functions, named operators\n\n\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    } // something unknown is found, wrong characters -> a syntax error\n\n\n    state.tokenType = TOKENTYPE.UNKNOWN;\n\n    while (currentCharacter(state) !== '') {\n      state.token += currentCharacter(state);\n      next(state);\n    }\n\n    throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"');\n  }\n  /**\n   * Get next token and skip newline tokens\n   */\n\n\n  function getTokenSkipNewline(state) {\n    do {\n      getToken(state);\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\n\n  function openParams(state) {\n    state.nestingLevel++;\n  }\n  /**\n   * Close parameters.\n   * New line characters will no longer be ignored\n   */\n\n\n  function closeParams(state) {\n    state.nestingLevel--;\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\n\n  parse.isAlpha = function isAlpha(c, cPrev, cNext) {\n    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);\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\n\n  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {\n    return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c);\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\n\n  parse.isValidMathSymbol = function isValidMathSymbol(high, low) {\n    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);\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\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   * 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\n\n  parse.isDecimalMark = function isDecimalMark(c, cNext) {\n    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';\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\n\n  parse.isDigitDot = function isDigitDot(c) {\n    return c >= '0' && c <= '9' || c === '.';\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\n\n  parse.isDigit = function isDigit(c) {\n    return c >= '0' && c <= '9';\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\n\n  parse.isHexDigit = function isHexDigit(c) {\n    return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';\n  };\n  /**\n   * Start of the parse levels below, in order of precedence\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseStart(expression, extraNodes) {\n    var state = initialState();\n\n    _extends(state, {\n      expression,\n      extraNodes\n    });\n\n    getToken(state);\n    var node = parseBlock(state); // check for garbage at the end of the expression\n    // an expression ends with a empty character '' and tokenType DELIMITER\n\n    if (state.token !== '') {\n      if (state.tokenType === TOKENTYPE.DELIMITER) {\n        // user entered a not existing operator like \"//\"\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   * 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\n\n  function parseBlock(state) {\n    var node;\n    var blocks = [];\n    var visible;\n\n    if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n      node = parseAssignment(state);\n      node.comment = state.comment;\n    } // TODO: simplify this loop\n\n\n    while (state.token === '\\n' || state.token === ';') {\n      // 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\n      if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n        node = parseAssignment(state);\n        node.comment = state.comment;\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   * 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\n\n  function parseAssignment(state) {\n    var name, args, value, valid;\n    var 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        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   * conditional operation\n   *\n   *     condition ? truePart : falsePart\n   *\n   * Note: conditional operator is right-associative\n   *\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseConditional(state) {\n    var node = parseLogicalOr(state);\n\n    while (state.token === '?') {\n      // 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      var prev = state.conditionalLevel;\n      state.conditionalLevel = state.nestingLevel;\n      getTokenSkipNewline(state);\n      var condition = node;\n      var trueExpr = parseAssignment(state);\n      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');\n      state.conditionalLevel = null;\n      getTokenSkipNewline(state);\n      var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity\n\n      node = new ConditionalNode(condition, trueExpr, falseExpr); // restore the previous conditional level\n\n      state.conditionalLevel = prev;\n    }\n\n    return node;\n  }\n  /**\n   * logical or, 'x or y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalOr(state) {\n    var node = parseLogicalXor(state);\n\n    while (state.token === 'or') {\n      // 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   * logical exclusive or, 'x xor y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalXor(state) {\n    var node = parseLogicalAnd(state);\n\n    while (state.token === 'xor') {\n      // 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   * logical and, 'x and y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalAnd(state) {\n    var node = parseBitwiseOr(state);\n\n    while (state.token === 'and') {\n      // 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   * bitwise or, 'x | y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseOr(state) {\n    var node = parseBitwiseXor(state);\n\n    while (state.token === '|') {\n      // 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   * bitwise exclusive or (xor), 'x ^| y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseXor(state) {\n    var node = parseBitwiseAnd(state);\n\n    while (state.token === '^|') {\n      // 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   * bitwise and, 'x & y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseAnd(state) {\n    var node = parseRelational(state);\n\n    while (state.token === '&') {\n      // 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   * Parse a chained conditional, like 'a > b >= c'\n   * @return {Node} node\n   */\n\n\n  function parseRelational(state) {\n    var params = [parseShift(state)];\n    var conditionals = [];\n    var operators = {\n      '==': 'equal',\n      '!=': 'unequal',\n      '<': 'smaller',\n      '>': 'larger',\n      '<=': 'smallerEq',\n      '>=': 'largerEq'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      // eslint-disable-line no-unmodified-loop-condition\n      var cond = {\n        name: state.token,\n        fn: operators[state.token]\n      };\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   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseShift(state) {\n    var node, name, fn, params;\n    node = parseConversion(state);\n    var operators = {\n      '<<': 'leftShift',\n      '>>': 'rightArithShift',\n      '>>>': 'rightLogShift'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      params = [node, parseConversion(state)];\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * conversion operators 'to' and 'in'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseConversion(state) {\n    var node, name, fn, params;\n    node = parseRange(state);\n    var operators = {\n      to: 'to',\n      in: 'to' // alias of 'to'\n\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\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   * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseRange(state) {\n    var node;\n    var 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); // parse step and end\n\n      while (state.token === ':' && params.length < 3) {\n        // 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 {\n        // 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   * add or subtract\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseAddSubtract(state) {\n    var node, name, fn, params;\n    node = parseMultiplyDivide(state);\n    var operators = {\n      '+': 'add',\n      '-': 'subtract'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      params = [node, parseMultiplyDivide(state)];\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * multiply, divide, modulus\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseMultiplyDivide(state) {\n    var node, last, name, fn;\n    node = parseImplicitMultiplication(state);\n    last = node;\n    var operators = {\n      '*': 'multiply',\n      '.*': 'dotMultiply',\n      '/': 'divide',\n      './': 'dotDivide',\n      '%': 'mod',\n      mod: 'mod'\n    };\n\n    while (true) {\n      if (hasOwnProperty(operators, state.token)) {\n        // explicit operators\n        name = state.token;\n        fn = operators[name];\n        getTokenSkipNewline(state);\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   * implicit multiplication\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseImplicitMultiplication(state) {\n    var node, last;\n    node = parseRule2(state);\n    last = node;\n\n    while (true) {\n      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && isConstantNode(node) || state.tokenType === TOKENTYPE.NUMBER && !isConstantNode(last) && (!isOperatorNode(last) || last.op === '!') || 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\n        /* implicit */\n        );\n      } else {\n        break;\n      }\n    }\n\n    return node;\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\n\n  function parseRule2(state) {\n    var node = parseUnary(state);\n    var last = node;\n    var 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(_extends({}, state));\n        getTokenSkipNewline(state); // Match the \"number / number\" part of the pattern\n\n        if (state.tokenType === TOKENTYPE.NUMBER) {\n          // Look ahead again\n          tokenStates.push(_extends({}, state));\n          getTokenSkipNewline(state); // Match the \"symbol\" part of the pattern, or a left parenthesis\n\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            _extends(state, tokenStates.pop());\n\n            tokenStates.pop();\n            last = parseUnary(state);\n            node = new OperatorNode('/', 'divide', [node, last]);\n          } else {\n            // Not a match, so rewind\n            tokenStates.pop();\n\n            _extends(state, tokenStates.pop());\n\n            break;\n          }\n        } else {\n          // Not a match, so rewind\n          _extends(state, tokenStates.pop());\n\n          break;\n        }\n      } else {\n        break;\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Unary plus and minus, and logical and bitwise not\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseUnary(state) {\n    var name, params, fn;\n    var 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      getTokenSkipNewline(state);\n      params = [parseUnary(state)];\n      return new OperatorNode(name, fn, params);\n    }\n\n    return parsePow(state);\n  }\n  /**\n   * power\n   * Note: power operator is right associative\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parsePow(state) {\n    var node, name, fn, params;\n    node = parseLeftHandOperators(state);\n\n    if (state.token === '^' || state.token === '.^') {\n      name = state.token;\n      fn = name === '^' ? 'pow' : 'dotPow';\n      getTokenSkipNewline(state);\n      params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'\n\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * Left hand operators: factorial x!, ctranspose x'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLeftHandOperators(state) {\n    var node, name, fn, params;\n    node = parseCustomNodes(state);\n    var operators = {\n      '!': 'factorial',\n      '\\'': 'ctranspose'\n    };\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getToken(state);\n      params = [node];\n      node = new OperatorNode(name, fn, params);\n      node = parseAccessors(state, node);\n    }\n\n    return node;\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\n\n  function parseCustomNodes(state) {\n    var params = [];\n\n    if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {\n      var CustomNode = state.extraNodes[state.token];\n      getToken(state); // parse parameters\n\n      if (state.token === '(') {\n        params = [];\n        openParams(state);\n        getToken(state);\n\n        if (state.token !== ')') {\n          params.push(parseAssignment(state)); // parse a list with parameters\n\n          while (state.token === ',') {\n            // 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\n        closeParams(state);\n        getToken(state);\n      } // create a new custom node\n      // noinspection JSValidateTypes\n\n\n      return new CustomNode(params);\n    }\n\n    return parseSymbol(state);\n  }\n  /**\n   * parse symbols: functions, variables, constants, units\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseSymbol(state) {\n    var node, name;\n\n    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n      name = state.token;\n      getToken(state);\n\n      if (hasOwnProperty(CONSTANTS, name)) {\n        // true, false, null, ...\n        node = new ConstantNode(CONSTANTS[name]);\n      } else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) {\n        // NaN, Infinity\n        node = new ConstantNode(numeric(name, 'number'));\n      } else {\n        node = new SymbolNode(name);\n      } // parse function parameters and matrix index\n\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseDoubleQuotesString(state);\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\n\n  function parseAccessors(state, node, types) {\n    var params;\n\n    while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.indexOf(state.token) !== -1)) {\n      // 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)); // parse a list with parameters\n\n            while (state.token === ',') {\n              // 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\n          closeParams(state);\n          getToken(state);\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)); // parse a list with parameters\n\n          while (state.token === ',') {\n            // 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\n        closeParams(state);\n        getToken(state);\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\n        params.push(new ConstantNode(state.token));\n        getToken(state);\n        var dotNotation = true;\n        node = new AccessorNode(node, new IndexNode(params, dotNotation));\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Parse a double quotes string.\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseDoubleQuotesString(state) {\n    var node, str;\n\n    if (state.token === '\"') {\n      str = parseDoubleQuotesStringToken(state); // create constant\n\n      node = new ConstantNode(str); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseSingleQuotesString(state);\n  }\n  /**\n   * Parse a string surrounded by double quotes \"...\"\n   * @return {string}\n   */\n\n\n  function parseDoubleQuotesStringToken(state) {\n    var 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\n    if (state.token !== '\"') {\n      throw createSyntaxError(state, 'End of string \" expected');\n    }\n\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n  /**\n   * Parse a single quotes string.\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseSingleQuotesString(state) {\n    var node, str;\n\n    if (state.token === '\\'') {\n      str = parseSingleQuotesStringToken(state); // create constant\n\n      node = new ConstantNode(str); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseMatrix(state);\n  }\n  /**\n   * Parse a string surrounded by single quotes '...'\n   * @return {string}\n   */\n\n\n  function parseSingleQuotesStringToken(state) {\n    var 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\n    if (state.token !== '\\'') {\n      throw createSyntaxError(state, 'End of string \\' expected');\n    }\n\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n  /**\n   * parse the matrix\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseMatrix(state) {\n    var 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        var row = parseRow(state);\n\n        if (state.token === ';') {\n          // 2 dimensional array\n          rows = 1;\n          params = [row]; // the rows of the matrix are separated by dot-comma's\n\n          while (state.token === ';') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params[rows] = parseRow(state);\n            rows++;\n          }\n\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected');\n          }\n\n          closeParams(state);\n          getToken(state); // check if the number of columns matches in all rows\n\n          cols = params[0].items.length;\n\n          for (var r = 1; r < rows; r++) {\n            if (params[r].items.length !== cols) {\n              throw createError(state, 'Column dimensions mismatch ' + '(' + 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\n          closeParams(state);\n          getToken(state);\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   * Parse a single comma-separated row from a matrix, like 'a, b, c'\n   * @return {ArrayNode} node\n   */\n\n\n  function parseRow(state) {\n    var params = [parseAssignment(state)];\n    var len = 1;\n\n    while (state.token === ',') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getToken(state); // parse expression\n\n      params[len] = parseAssignment(state);\n      len++;\n    }\n\n    return new ArrayNode(params);\n  }\n  /**\n   * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseObject(state) {\n    if (state.token === '{') {\n      openParams(state);\n      var key;\n      var properties = {};\n\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          } // parse key/value separator\n\n\n          if (state.token !== ':') {\n            throw createSyntaxError(state, 'Colon : expected after object key');\n          }\n\n          getToken(state); // parse key\n\n          properties[key] = parseAssignment(state);\n        }\n      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition\n\n\n      if (state.token !== '}') {\n        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');\n      }\n\n      closeParams(state);\n      getToken(state);\n      var node = new ObjectNode(properties); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseNumber(state);\n  }\n  /**\n   * parse a number\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseNumber(state) {\n    var numberStr;\n\n    if (state.tokenType === TOKENTYPE.NUMBER) {\n      // this is a number\n      numberStr = state.token;\n      getToken(state);\n      return new ConstantNode(numeric(numberStr, config.number));\n    }\n\n    return parseParentheses(state);\n  }\n  /**\n   * parentheses\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseParentheses(state) {\n    var node; // check if it is a parenthesized expression\n\n    if (state.token === '(') {\n      // parentheses (...)\n      openParams(state);\n      getToken(state);\n      node = parseAssignment(state); // start again\n\n      if (state.token !== ')') {\n        throw createSyntaxError(state, 'Parenthesis ) expected');\n      }\n\n      closeParams(state);\n      getToken(state);\n      node = new ParenthesisNode(node);\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseEnd(state);\n  }\n  /**\n   * Evaluated when the expression is not yet ended but expected to end\n   * @return {Node} res\n   * @private\n   */\n\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   * Shortcut for getting the current row value (one based)\n   * Returns the line of the currently handled expression\n   * @private\n   */\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\n\n  function col(state) {\n    return state.index - state.token.length + 1;\n  }\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {SyntaxError} instantiated error\n   * @private\n   */\n\n\n  function createSyntaxError(state, message) {\n    var c = col(state);\n    var error = new SyntaxError(message + ' (char ' + c + ')');\n    error.char = c;\n    return error;\n  }\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {Error} instantiated error\n   * @private\n   */\n\n\n  function createError(state, message) {\n    var c = col(state);\n    var error = new SyntaxError(message + ' (char ' + c + ')');\n    error.char = c;\n    return error;\n  }\n\n  return parse;\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'evaluate';\nvar dependencies = ['typed', 'parse'];\nexport var createEvaluate = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    parse\n  } = _ref;\n\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 string(expr) {\n      var scope = {};\n      return parse(expr).compile().evaluate(scope);\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return parse(expr).compile().evaluate(scope);\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      var scope = {};\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\n    },\n    'Array | Matrix, Object': function ArrayMatrixObject(expr, scope) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\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';\nvar name = 'Help';\nvar dependencies = ['parse'];\nexport var createHelpClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    parse\n  } = _ref;\n\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    this.doc = doc;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Help.prototype.type = 'Help';\n  Help.prototype.isHelp = true;\n  /**\n   * Generate a string representation of the Help object\n   * @return {string} Returns a string\n   * @private\n   */\n\n  Help.prototype.toString = function () {\n    var doc = this.doc || {};\n    var desc = '\\n';\n\n    if (doc.name) {\n      desc += 'Name: ' + doc.name + '\\n\\n';\n    }\n\n    if (doc.category) {\n      desc += 'Category: ' + doc.category + '\\n\\n';\n    }\n\n    if (doc.description) {\n      desc += 'Description:\\n    ' + doc.description + '\\n\\n';\n    }\n\n    if (doc.syntax) {\n      desc += 'Syntax:\\n    ' + doc.syntax.join('\\n    ') + '\\n\\n';\n    }\n\n    if (doc.examples) {\n      desc += 'Examples:\\n';\n      var scope = {};\n\n      for (var i = 0; i < doc.examples.length; i++) {\n        var expr = doc.examples[i];\n        desc += '    ' + expr + '\\n';\n        var res = void 0;\n\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\n        if (res !== undefined && !isHelp(res)) {\n          desc += '        ' + format(res, {\n            precision: 14\n          }) + '\\n';\n        }\n      }\n\n      desc += '\\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   * Export the help object to JSON\n   */\n\n\n  Help.prototype.toJSON = function () {\n    var obj = clone(this.doc);\n    obj.mathjs = 'Help';\n    return obj;\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\n\n  Help.fromJSON = function (json) {\n    var doc = {};\n    Object.keys(json).filter(prop => prop !== 'mathjs').forEach(prop => {\n      doc[prop] = json[prop];\n    });\n    return new Help(doc);\n  };\n  /**\n   * Returns a string representation of the Help object\n   */\n\n\n  Help.prototype.valueOf = Help.prototype.toString;\n  return Help;\n}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nimport { extend, hasOwnProperty } from '../utils/object.js';\nimport { getSafeProperty, setSafeProperty } from '../utils/customs.js';\nvar name = 'Parser';\nvar dependencies = ['parse'];\nexport var createParserClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    parse\n  } = _ref;\n\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('function 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('Constructor must be called with the new operator');\n    }\n\n    this.scope = {};\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Parser.prototype.type = 'Parser';\n  Parser.prototype.isParser = true;\n  /**\n   * Parse and evaluate the given expression\n   * @param {string} expr   A string containing an expression, for example \"2+3\"\n   * @return {*} result     The result, or undefined when the expression was empty\n   * @throws {Error}\n   */\n\n  Parser.prototype.evaluate = function (expr) {\n    // TODO: validate arguments\n    return parse(expr).compile().evaluate(this.scope);\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\n\n  Parser.prototype.get = function (name) {\n    // TODO: validate arguments\n    return name in this.scope ? getSafeProperty(this.scope, name) : undefined;\n  };\n  /**\n   * Get a map with all defined variables\n   * @return {Object} values\n   */\n\n\n  Parser.prototype.getAll = function () {\n    return extend({}, this.scope);\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\n\n  Parser.prototype.set = function (name, value) {\n    // TODO: validate arguments\n    return setSafeProperty(this.scope, name, value);\n  };\n  /**\n   * Remove a variable from the parsers scope\n   * @param {string} name\n   */\n\n\n  Parser.prototype.remove = function (name) {\n    // TODO: validate arguments\n    delete this.scope[name];\n  };\n  /**\n   * Clear the scope with variables and functions\n   */\n\n\n  Parser.prototype.clear = function () {\n    for (var _name in this.scope) {\n      if (hasOwnProperty(this.scope, _name)) {\n        delete this.scope[_name];\n      }\n    }\n  };\n\n  return Parser;\n}, {\n  isClass: true\n});","export var piDocs = {\n  name: 'pi',\n  category: 'Constants',\n  syntax: ['pi'],\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: ['pi', 'sin(pi/2)'],\n  seealso: ['tau']\n};","export var eDocs = {\n  name: 'e',\n  category: 'Constants',\n  syntax: ['e'],\n  description: 'Euler\\'s number, the base of the natural logarithm. Approximately equal to 2.71828',\n  examples: ['e', 'e ^ 2', 'exp(2)', 'log(e)'],\n  seealso: ['exp']\n};","import { bignumberDocs } from './construction/bignumber.js';\nimport { typeOfDocs } from './function/utils/typeOf.js';\nimport { isZeroDocs } from './function/utils/isZero.js';\nimport { isPrimeDocs } from './function/utils/isPrime.js';\nimport { isPositiveDocs } from './function/utils/isPositive.js';\nimport { isNumericDocs } from './function/utils/isNumeric.js';\nimport { hasNumericValueDocs } from './function/utils/hasNumericValue.js';\nimport { isNegativeDocs } from './function/utils/isNegative.js';\nimport { isIntegerDocs } from './function/utils/isInteger.js';\nimport { isNaNDocs } from './function/utils/isNaN.js';\nimport { formatDocs } from './function/utils/format.js';\nimport { binDocs } from './function/utils/bin.js';\nimport { octDocs } from './function/utils/oct.js';\nimport { hexDocs } from './function/utils/hex.js';\nimport { cloneDocs } from './function/utils/clone.js';\nimport { toDocs } from './function/units/to.js';\nimport { tanhDocs } from './function/trigonometry/tanh.js';\nimport { tanDocs } from './function/trigonometry/tan.js';\nimport { sinhDocs } from './function/trigonometry/sinh.js';\nimport { sechDocs } from './function/trigonometry/sech.js';\nimport { secDocs } from './function/trigonometry/sec.js';\nimport { cschDocs } from './function/trigonometry/csch.js';\nimport { cscDocs } from './function/trigonometry/csc.js';\nimport { cothDocs } from './function/trigonometry/coth.js';\nimport { cotDocs } from './function/trigonometry/cot.js';\nimport { coshDocs } from './function/trigonometry/cosh.js';\nimport { cosDocs } from './function/trigonometry/cos.js';\nimport { atan2Docs } from './function/trigonometry/atan2.js';\nimport { atanhDocs } from './function/trigonometry/atanh.js';\nimport { atanDocs } from './function/trigonometry/atan.js';\nimport { asinhDocs } from './function/trigonometry/asinh.js';\nimport { asinDocs } from './function/trigonometry/asin.js';\nimport { asechDocs } from './function/trigonometry/asech.js';\nimport { asecDocs } from './function/trigonometry/asec.js';\nimport { acschDocs } from './function/trigonometry/acsch.js';\nimport { acscDocs } from './function/trigonometry/acsc.js';\nimport { acothDocs } from './function/trigonometry/acoth.js';\nimport { acotDocs } from './function/trigonometry/acot.js';\nimport { acoshDocs } from './function/trigonometry/acosh.js';\nimport { acosDocs } from './function/trigonometry/acos.js';\nimport { sumDocs } from './function/statistics/sum.js';\nimport { stdDocs } from './function/statistics/std.js';\nimport { quantileSeqDocs } from './function/statistics/quantileSeq.js';\nimport { prodDocs } from './function/statistics/prod.js';\nimport { modeDocs } from './function/statistics/mode.js';\nimport { minDocs } from './function/statistics/min.js';\nimport { medianDocs } from './function/statistics/median.js';\nimport { meanDocs } from './function/statistics/mean.js';\nimport { maxDocs } from './function/statistics/max.js';\nimport { madDocs } from './function/statistics/mad.js';\nimport { erfDocs } from './function/special/erf.js';\nimport { setUnionDocs } from './function/set/setUnion.js';\nimport { setSymDifferenceDocs } from './function/set/setSymDifference.js';\nimport { setSizeDocs } from './function/set/setSize.js';\nimport { setPowersetDocs } from './function/set/setPowerset.js';\nimport { setMultiplicityDocs } from './function/set/setMultiplicity.js';\nimport { setIsSubsetDocs } from './function/set/setIsSubset.js';\nimport { setIntersectDocs } from './function/set/setIntersect.js';\nimport { setDistinctDocs } from './function/set/setDistinct.js';\nimport { setDifferenceDocs } from './function/set/setDifference.js';\nimport { setCartesianDocs } from './function/set/setCartesian.js';\nimport { unequalDocs } from './function/relational/unequal.js';\nimport { smallerEqDocs } from './function/relational/smallerEq.js';\nimport { smallerDocs } from './function/relational/smaller.js';\nimport { largerEqDocs } from './function/relational/largerEq.js';\nimport { largerDocs } from './function/relational/larger.js';\nimport { equalTextDocs } from './function/relational/equalText.js';\nimport { equalDocs } from './function/relational/equal.js';\nimport { deepEqualDocs } from './function/relational/deepEqual.js';\nimport { compareTextDocs } from './function/relational/compareText.js';\nimport { compareNaturalDocs } from './function/relational/compareNatural.js';\nimport { compareDocs } from './function/relational/compare.js';\nimport { randomIntDocs } from './function/probability/randomInt.js';\nimport { randomDocs } from './function/probability/random.js';\nimport { pickRandomDocs } from './function/probability/pickRandom.js';\nimport { permutationsDocs } from './function/probability/permutations.js';\nimport { multinomialDocs } from './function/probability/multinomial.js';\nimport { kldivergenceDocs } from './function/probability/kldivergence.js';\nimport { gammaDocs } from './function/probability/gamma.js';\nimport { factorialDocs } from './function/probability/factorial.js';\nimport { combinationsDocs } from './function/probability/combinations.js';\nimport { combinationsWithRepDocs } from './function/probability/combinationsWithRep.js';\nimport { zerosDocs } from './function/matrix/zeros.js';\nimport { transposeDocs } from './function/matrix/transpose.js';\nimport { traceDocs } from './function/matrix/trace.js';\nimport { subsetDocs } from './function/matrix/subset.js';\nimport { squeezeDocs } from './function/matrix/squeeze.js';\nimport { sortDocs } from './function/matrix/sort.js';\nimport { sizeDocs } from './function/matrix/size.js';\nimport { diffDocs } from './function/matrix/diff.js';\nimport { reshapeDocs } from './function/matrix/reshape.js';\nimport { resizeDocs } from './function/matrix/resize.js';\nimport { rangeDocs } from './function/matrix/range.js';\nimport { partitionSelectDocs } from './function/matrix/partitionSelect.js';\nimport { onesDocs } from './function/matrix/ones.js';\nimport { mapDocs } from './function/matrix/map.js';\nimport { kronDocs } from './function/matrix/kron.js';\nimport { invDocs } from './function/matrix/inv.js';\nimport { forEachDocs } from './function/matrix/forEach.js';\nimport { flattenDocs } from './function/matrix/flatten.js';\nimport { filterDocs } from './function/matrix/filter.js';\nimport { identityDocs } from './function/matrix/identity.js';\nimport { getMatrixDataTypeDocs } from './function/matrix/getMatrixDataType.js';\nimport { dotDocs } from './function/matrix/dot.js';\nimport { diagDocs } from './function/matrix/diag.js';\nimport { detDocs } from './function/matrix/det.js';\nimport { ctransposeDocs } from './function/matrix/ctranspose.js';\nimport { crossDocs } from './function/matrix/cross.js';\nimport { concatDocs } from './function/matrix/concat.js';\nimport { countDocs } from './function/matrix/count.js';\nimport { xorDocs } from './function/logical/xor.js';\nimport { orDocs } from './function/logical/or.js';\nimport { notDocs } from './function/logical/not.js';\nimport { andDocs } from './function/logical/and.js';\nimport { intersectDocs } from './function/geometry/intersect.js';\nimport { distanceDocs } from './function/geometry/distance.js';\nimport { helpDocs } from './function/expression/help.js';\nimport { evaluateDocs } from './function/expression/evaluate.js';\nimport { imDocs } from './function/complex/im.js';\nimport { reDocs } from './function/complex/re.js';\nimport { conjDocs } from './function/complex/conj.js';\nimport { argDocs } from './function/complex/arg.js';\nimport { typedDocs } from './core/typed.js';\nimport { importDocs } from './core/import.js';\nimport { configDocs } from './core/config.js';\nimport { stirlingS2Docs } from './function/combinatorics/stirlingS2.js';\nimport { compositionDocs } from './function/combinatorics/composition.js';\nimport { catalanDocs } from './function/combinatorics/catalan.js';\nimport { bellNumbersDocs } from './function/combinatorics/bellNumbers.js';\nimport { rightLogShiftDocs } from './function/bitwise/rightLogShift.js';\nimport { rightArithShiftDocs } from './function/bitwise/rightArithShift.js';\nimport { leftShiftDocs } from './function/bitwise/leftShift.js';\nimport { bitXorDocs } from './function/bitwise/bitXor.js';\nimport { bitOrDocs } from './function/bitwise/bitOr.js';\nimport { bitNotDocs } from './function/bitwise/bitNot.js';\nimport { bitAndDocs } from './function/bitwise/bitAnd.js';\nimport { xgcdDocs } from './function/arithmetic/xgcd.js';\nimport { unaryPlusDocs } from './function/arithmetic/unaryPlus.js';\nimport { unaryMinusDocs } from './function/arithmetic/unaryMinus.js';\nimport { squareDocs } from './function/arithmetic/square.js';\nimport { sqrtmDocs } from './function/arithmetic/sqrtm.js';\nimport { sqrtDocs } from './function/arithmetic/sqrt.js';\nimport { signDocs } from './function/arithmetic/sign.js';\nimport { roundDocs } from './function/arithmetic/round.js';\nimport { powDocs } from './function/arithmetic/pow.js';\nimport { nthRootsDocs } from './function/arithmetic/nthRoots.js';\nimport { nthRootDocs } from './function/arithmetic/nthRoot.js';\nimport { normDocs } from './function/arithmetic/norm.js';\nimport { multiplyDocs } from './function/arithmetic/multiply.js';\nimport { modDocs } from './function/arithmetic/mod.js';\nimport { log10Docs } from './function/arithmetic/log10.js';\nimport { log1pDocs } from './function/arithmetic/log1p.js';\nimport { log2Docs } from './function/arithmetic/log2.js';\nimport { logDocs } from './function/arithmetic/log.js';\nimport { lcmDocs } from './function/arithmetic/lcm.js';\nimport { hypotDocs } from './function/arithmetic/hypot.js';\nimport { gcdDocs } from './function/arithmetic/gcd.js';\nimport { floorDocs } from './function/arithmetic/floor.js';\nimport { fixDocs } from './function/arithmetic/fix.js';\nimport { expm1Docs } from './function/arithmetic/expm1.js';\nimport { expmDocs } from './function/arithmetic/expm.js';\nimport { eigsDocs } from './function/matrix/eigs.js';\nimport { expDocs } from './function/arithmetic/exp.js';\nimport { dotMultiplyDocs } from './function/arithmetic/dotMultiply.js';\nimport { dotDivideDocs } from './function/arithmetic/dotDivide.js';\nimport { divideDocs } from './function/arithmetic/divide.js';\nimport { cubeDocs } from './function/arithmetic/cube.js';\nimport { ceilDocs } from './function/arithmetic/ceil.js';\nimport { cbrtDocs } from './function/arithmetic/cbrt.js';\nimport { addDocs } from './function/arithmetic/add.js';\nimport { absDocs } from './function/arithmetic/abs.js';\nimport { qrDocs } from './function/algebra/qr.js';\nimport { usolveDocs } from './function/algebra/usolve.js';\nimport { usolveAllDocs } from './function/algebra/usolveAll.js';\nimport { sluDocs } from './function/algebra/slu.js';\nimport { rationalizeDocs } from './function/algebra/rationalize.js';\nimport { simplifyDocs } from './function/algebra/simplify.js';\nimport { lupDocs } from './function/algebra/lup.js';\nimport { lsolveDocs } from './function/algebra/lsolve.js';\nimport { lsolveAllDocs } from './function/algebra/lsolveAll.js';\nimport { derivativeDocs } from './function/algebra/derivative.js';\nimport { versionDocs } from './constants/version.js';\nimport { trueDocs } from './constants/true.js';\nimport { tauDocs } from './constants/tau.js';\nimport { SQRT2Docs } from './constants/SQRT2.js';\nimport { SQRT12Docs } from './constants/SQRT1_2.js';\nimport { phiDocs } from './constants/phi.js';\nimport { piDocs } from './constants/pi.js';\nimport { nullDocs } from './constants/null.js';\nimport { NaNDocs } from './constants/NaN.js';\nimport { LOG10EDocs } from './constants/LOG10E.js';\nimport { LOG2EDocs } from './constants/LOG2E.js';\nimport { LN10Docs } from './constants/LN10.js';\nimport { LN2Docs } from './constants/LN2.js';\nimport { InfinityDocs } from './constants/Infinity.js';\nimport { iDocs } from './constants/i.js';\nimport { falseDocs } from './constants/false.js';\nimport { eDocs } from './constants/e.js';\nimport { unitDocs } from './construction/unit.js';\nimport { stringDocs } from './construction/string.js';\nimport { splitUnitDocs } from './construction/splitUnit.js';\nimport { sparseDocs } from './construction/sparse.js';\nimport { numberDocs } from './construction/number.js';\nimport { matrixDocs } from './construction/matrix.js';\nimport { indexDocs } from './construction/index.js';\nimport { fractionDocs } from './construction/fraction.js';\nimport { createUnitDocs } from './construction/createUnit.js';\nimport { complexDocs } from './construction/complex.js';\nimport { booleanDocs } from './construction/boolean.js';\nimport { dotPowDocs } from './function/arithmetic/dotPow.js';\nimport { lusolveDocs } from './function/algebra/lusolve.js';\nimport { subtractDocs } from './function/arithmetic/subtract.js';\nimport { varianceDocs } from './function/statistics/variance.js';\nimport { sinDocs } from './function/trigonometry/sin.js';\nimport { numericDocs } from './function/utils/numeric.js';\nimport { columnDocs } from './function/matrix/column.js';\nimport { rowDocs } from './function/matrix/row.js';\nimport { rotationMatrixDocs } from './function/matrix/rotationMatrix.js';\nimport { rotateDocs } from './function/matrix/rotate.js';\nexport var embeddedDocs = {\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  // 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  // physical constants\n  // TODO: more detailed docs for physical constants\n  speedOfLight: {\n    description: 'Speed of light in vacuum',\n    examples: ['speedOfLight']\n  },\n  gravitationConstant: {\n    description: 'Newtonian constant of gravitation',\n    examples: ['gravitationConstant']\n  },\n  planckConstant: {\n    description: 'Planck constant',\n    examples: ['planckConstant']\n  },\n  reducedPlanckConstant: {\n    description: 'Reduced Planck constant',\n    examples: ['reducedPlanckConstant']\n  },\n  magneticConstant: {\n    description: 'Magnetic constant (vacuum permeability)',\n    examples: ['magneticConstant']\n  },\n  electricConstant: {\n    description: 'Electric constant (vacuum permeability)',\n    examples: ['electricConstant']\n  },\n  vacuumImpedance: {\n    description: 'Characteristic impedance of vacuum',\n    examples: ['vacuumImpedance']\n  },\n  coulomb: {\n    description: 'Coulomb\\'s constant',\n    examples: ['coulomb']\n  },\n  elementaryCharge: {\n    description: 'Elementary charge',\n    examples: ['elementaryCharge']\n  },\n  bohrMagneton: {\n    description: 'Borh magneton',\n    examples: ['bohrMagneton']\n  },\n  conductanceQuantum: {\n    description: 'Conductance quantum',\n    examples: ['conductanceQuantum']\n  },\n  inverseConductanceQuantum: {\n    description: 'Inverse conductance quantum',\n    examples: ['inverseConductanceQuantum']\n  },\n  // josephson: {description: 'Josephson constant', examples: ['josephson']},\n  magneticFluxQuantum: {\n    description: 'Magnetic flux quantum',\n    examples: ['magneticFluxQuantum']\n  },\n  nuclearMagneton: {\n    description: 'Nuclear magneton',\n    examples: ['nuclearMagneton']\n  },\n  klitzing: {\n    description: 'Von Klitzing constant',\n    examples: ['klitzing']\n  },\n  bohrRadius: {\n    description: 'Borh radius',\n    examples: ['bohrRadius']\n  },\n  classicalElectronRadius: {\n    description: 'Classical electron radius',\n    examples: ['classicalElectronRadius']\n  },\n  electronMass: {\n    description: 'Electron mass',\n    examples: ['electronMass']\n  },\n  fermiCoupling: {\n    description: 'Fermi coupling constant',\n    examples: ['fermiCoupling']\n  },\n  fineStructure: {\n    description: 'Fine-structure constant',\n    examples: ['fineStructure']\n  },\n  hartreeEnergy: {\n    description: 'Hartree energy',\n    examples: ['hartreeEnergy']\n  },\n  protonMass: {\n    description: 'Proton mass',\n    examples: ['protonMass']\n  },\n  deuteronMass: {\n    description: 'Deuteron Mass',\n    examples: ['deuteronMass']\n  },\n  neutronMass: {\n    description: 'Neutron mass',\n    examples: ['neutronMass']\n  },\n  quantumOfCirculation: {\n    description: 'Quantum of circulation',\n    examples: ['quantumOfCirculation']\n  },\n  rydberg: {\n    description: 'Rydberg constant',\n    examples: ['rydberg']\n  },\n  thomsonCrossSection: {\n    description: 'Thomson cross section',\n    examples: ['thomsonCrossSection']\n  },\n  weakMixingAngle: {\n    description: 'Weak mixing angle',\n    examples: ['weakMixingAngle']\n  },\n  efimovFactor: {\n    description: 'Efimov factor',\n    examples: ['efimovFactor']\n  },\n  atomicMass: {\n    description: 'Atomic mass constant',\n    examples: ['atomicMass']\n  },\n  avogadro: {\n    description: 'Avogadro\\'s number',\n    examples: ['avogadro']\n  },\n  boltzmann: {\n    description: 'Boltzmann constant',\n    examples: ['boltzmann']\n  },\n  faraday: {\n    description: 'Faraday constant',\n    examples: ['faraday']\n  },\n  firstRadiation: {\n    description: 'First radiation constant',\n    examples: ['firstRadiation']\n  },\n  loschmidt: {\n    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',\n    examples: ['loschmidt']\n  },\n  gasConstant: {\n    description: 'Gas constant',\n    examples: ['gasConstant']\n  },\n  molarPlanckConstant: {\n    description: 'Molar Planck constant',\n    examples: ['molarPlanckConstant']\n  },\n  molarVolume: {\n    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',\n    examples: ['molarVolume']\n  },\n  sackurTetrode: {\n    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',\n    examples: ['sackurTetrode']\n  },\n  secondRadiation: {\n    description: 'Second radiation constant',\n    examples: ['secondRadiation']\n  },\n  stefanBoltzmann: {\n    description: 'Stefan-Boltzmann constant',\n    examples: ['stefanBoltzmann']\n  },\n  wienDisplacement: {\n    description: 'Wien displacement law constant',\n    examples: ['wienDisplacement']\n  },\n  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},\n  molarMass: {\n    description: 'Molar mass constant',\n    examples: ['molarMass']\n  },\n  molarMassC12: {\n    description: 'Molar mass constant of carbon-12',\n    examples: ['molarMassC12']\n  },\n  gravity: {\n    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',\n    examples: ['gravity']\n  },\n  planckLength: {\n    description: 'Planck length',\n    examples: ['planckLength']\n  },\n  planckMass: {\n    description: 'Planck mass',\n    examples: ['planckMass']\n  },\n  planckTime: {\n    description: 'Planck time',\n    examples: ['planckTime']\n  },\n  planckCharge: {\n    description: 'Planck charge',\n    examples: ['planckCharge']\n  },\n  planckTemperature: {\n    description: 'Planck temperature',\n    examples: ['planckTemperature']\n  },\n  // functions - algebra\n  derivative: derivativeDocs,\n  lsolve: lsolveDocs,\n  lsolveAll: lsolveAllDocs,\n  lup: lupDocs,\n  lusolve: lusolveDocs,\n  simplify: simplifyDocs,\n  rationalize: rationalizeDocs,\n  slu: sluDocs,\n  usolve: usolveDocs,\n  usolveAll: usolveAllDocs,\n  qr: qrDocs,\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  // functions - bitwise\n  bitAnd: bitAndDocs,\n  bitNot: bitNotDocs,\n  bitOr: bitOrDocs,\n  bitXor: bitXorDocs,\n  leftShift: leftShiftDocs,\n  rightArithShift: rightArithShiftDocs,\n  rightLogShift: rightLogShiftDocs,\n  // functions - combinatorics\n  bellNumbers: bellNumbersDocs,\n  catalan: catalanDocs,\n  composition: compositionDocs,\n  stirlingS2: stirlingS2Docs,\n  // functions - core\n  config: configDocs,\n  import: importDocs,\n  typed: typedDocs,\n  // functions - complex\n  arg: argDocs,\n  conj: conjDocs,\n  re: reDocs,\n  im: imDocs,\n  // functions - expression\n  evaluate: evaluateDocs,\n  help: helpDocs,\n  // functions - geometry\n  distance: distanceDocs,\n  intersect: intersectDocs,\n  // functions - logical\n  and: andDocs,\n  not: notDocs,\n  or: orDocs,\n  xor: xorDocs,\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  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  // 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  // 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  // 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  // functions - special\n  erf: erfDocs,\n  // functions - statistics\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  // 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  // functions - units\n  to: toDocs,\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 // TODO: add documentation for print as soon as the parser supports objects.\n  typeOf: typeOfDocs,\n  numeric: numericDocs\n};","export var bignumberDocs = {\n  name: 'bignumber',\n  category: 'Construction',\n  syntax: ['bignumber(x)'],\n  description: 'Create a big number from a number or string.',\n  examples: ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber(\"7.2\")', 'bignumber(\"7.2e500\")', 'bignumber([0.1, 0.2, 0.3])'],\n  seealso: ['boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};","export var booleanDocs = {\n  name: 'boolean',\n  category: 'Construction',\n  syntax: ['x', 'boolean(x)'],\n  description: 'Convert a string or number into a boolean.',\n  examples: ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean(\"true\")', 'boolean(\"false\")', 'boolean([1, 0, 1, 1])'],\n  seealso: ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']\n};","export var complexDocs = {\n  name: 'complex',\n  category: 'Construction',\n  syntax: ['complex()', 'complex(re, im)', 'complex(string)'],\n  description: 'Create a complex number.',\n  examples: ['complex()', 'complex(2, 3)', 'complex(\"7 - 2i\")'],\n  seealso: ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']\n};","export var createUnitDocs = {\n  name: 'createUnit',\n  category: 'Construction',\n  syntax: ['createUnit(definitions)', 'createUnit(name, definition)'],\n  description: 'Create a user-defined unit and register it with the Unit type.',\n  examples: ['createUnit(\"foo\")', 'createUnit(\"knot\", {definition: \"0.514444444 m/s\", aliases: [\"knots\", \"kt\", \"kts\"]})', 'createUnit(\"mph\", \"1 mile/hour\")'],\n  seealso: ['unit', 'splitUnit']\n};","export var fractionDocs = {\n  name: 'fraction',\n  category: 'Construction',\n  syntax: ['fraction(num)', 'fraction(num,den)'],\n  description: 'Create a fraction from a number or from a numerator and denominator.',\n  examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']\n};","export var indexDocs = {\n  name: 'index',\n  category: 'Construction',\n  syntax: ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],\n  description: 'Create an index to get or replace a subset of a matrix',\n  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)'],\n  seealso: ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']\n};","export var matrixDocs = {\n  name: 'matrix',\n  category: 'Construction',\n  syntax: ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix(\"dense\")', 'matrix([...])'],\n  description: 'Create a matrix.',\n  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\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']\n};","export var numberDocs = {\n  name: 'number',\n  category: 'Construction',\n  syntax: ['x', 'number(x)', 'number(unit, valuelessUnit)'],\n  description: 'Create a number or convert a string or boolean into a number.',\n  examples: ['2', '2e3', '4.05', 'number(2)', 'number(\"7.2\")', 'number(true)', 'number([true, false, true, true])', 'number(unit(\"52cm\"), \"m\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};","export var sparseDocs = {\n  name: 'sparse',\n  category: 'Construction',\n  syntax: ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], \"number\")'],\n  description: 'Create a sparse matrix.',\n  examples: ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], \"number\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']\n};","export var splitUnitDocs = {\n  name: 'splitUnit',\n  category: 'Construction',\n  syntax: ['splitUnit(unit: Unit, parts: Unit[])'],\n  description: 'Split a unit in an array of units whose sum is equal to the original unit.',\n  examples: ['splitUnit(1 m, [\"feet\", \"inch\"])'],\n  seealso: ['unit', 'createUnit']\n};","export var stringDocs = {\n  name: 'string',\n  category: 'Construction',\n  syntax: ['\"text\"', 'string(x)'],\n  description: 'Create a string or convert a value to a string',\n  examples: ['\"Hello World!\"', 'string(4.2)', 'string(3 + 2i)'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']\n};","export var unitDocs = {\n  name: 'unit',\n  category: 'Construction',\n  syntax: ['value unit', 'unit(value, unit)', 'unit(string)'],\n  description: 'Create a unit.',\n  examples: ['5.5 mm', '3 inch', 'unit(7.1, \"kilogram\")', 'unit(\"23 deg\")'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']\n};","export var falseDocs = {\n  name: 'false',\n  category: 'Constants',\n  syntax: ['false'],\n  description: 'Boolean value false',\n  examples: ['false'],\n  seealso: ['true']\n};","export var iDocs = {\n  name: 'i',\n  category: 'Constants',\n  syntax: ['i'],\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: ['i', 'i * i', 'sqrt(-1)'],\n  seealso: []\n};","export var InfinityDocs = {\n  name: 'Infinity',\n  category: 'Constants',\n  syntax: ['Infinity'],\n  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',\n  examples: ['Infinity', '1 / 0'],\n  seealso: []\n};","export var LN2Docs = {\n  name: 'LN2',\n  category: 'Constants',\n  syntax: ['LN2'],\n  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',\n  examples: ['LN2', 'log(2)'],\n  seealso: []\n};","export var LN10Docs = {\n  name: 'LN10',\n  category: 'Constants',\n  syntax: ['LN10'],\n  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',\n  examples: ['LN10', 'log(10)'],\n  seealso: []\n};","export var LOG2EDocs = {\n  name: 'LOG2E',\n  category: 'Constants',\n  syntax: ['LOG2E'],\n  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',\n  examples: ['LOG2E', 'log(e, 2)'],\n  seealso: []\n};","export var LOG10EDocs = {\n  name: 'LOG10E',\n  category: 'Constants',\n  syntax: ['LOG10E'],\n  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',\n  examples: ['LOG10E', 'log(e, 10)'],\n  seealso: []\n};","export var NaNDocs = {\n  name: 'NaN',\n  category: 'Constants',\n  syntax: ['NaN'],\n  description: 'Not a number',\n  examples: ['NaN', '0 / 0'],\n  seealso: []\n};","export var nullDocs = {\n  name: 'null',\n  category: 'Constants',\n  syntax: ['null'],\n  description: 'Value null',\n  examples: ['null'],\n  seealso: ['true', 'false']\n};","export var phiDocs = {\n  name: 'phi',\n  category: 'Constants',\n  syntax: ['phi'],\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: ['phi'],\n  seealso: []\n};","export var SQRT12Docs = {\n  name: 'SQRT1_2',\n  category: 'Constants',\n  syntax: ['SQRT1_2'],\n  description: 'Returns the square root of 1/2, approximately equal to 0.707',\n  examples: ['SQRT1_2', 'sqrt(1/2)'],\n  seealso: []\n};","export var SQRT2Docs = {\n  name: 'SQRT2',\n  category: 'Constants',\n  syntax: ['SQRT2'],\n  description: 'Returns the square root of 2, approximately equal to 1.414',\n  examples: ['SQRT2', 'sqrt(2)'],\n  seealso: []\n};","export var tauDocs = {\n  name: 'tau',\n  category: 'Constants',\n  syntax: ['tau'],\n  description: 'Tau is the ratio constant of a circle\\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',\n  examples: ['tau', '2 * pi'],\n  seealso: ['pi']\n};","export var trueDocs = {\n  name: 'true',\n  category: 'Constants',\n  syntax: ['true'],\n  description: 'Boolean value true',\n  examples: ['true'],\n  seealso: ['false']\n};","export var versionDocs = {\n  name: 'version',\n  category: 'Constants',\n  syntax: ['version'],\n  description: 'A string with the version number of math.js',\n  examples: ['version'],\n  seealso: []\n};","export var derivativeDocs = {\n  name: 'derivative',\n  category: 'Algebra',\n  syntax: ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],\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: ['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})'],\n  seealso: ['simplify', 'parse', 'evaluate']\n};","export var lsolveDocs = {\n  name: 'lsolve',\n  category: 'Algebra',\n  syntax: ['x=lsolve(L, b)'],\n  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.',\n  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],\n  seealso: ['lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']\n};","export var lsolveAllDocs = {\n  name: 'lsolveAll',\n  category: 'Algebra',\n  syntax: ['x=lsolveAll(L, b)'],\n  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.',\n  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],\n  seealso: ['lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']\n};","export var lupDocs = {\n  name: 'lup',\n  category: 'Algebra',\n  syntax: ['lup(m)'],\n  description: '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: ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],\n  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']\n};","export var lusolveDocs = {\n  name: 'lusolve',\n  category: 'Algebra',\n  syntax: ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],\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: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],\n  seealso: ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']\n};","export var simplifyDocs = {\n  name: 'simplify',\n  category: 'Algebra',\n  syntax: ['simplify(expr)', 'simplify(expr, rules)'],\n  description: 'Simplify an expression tree.',\n  examples: ['simplify(\"3 + 2 / 4\")', 'simplify(\"2x + x\")', 'f = parse(\"x * (x + 2 + x)\")', 'simplified = simplify(f)', 'simplified.evaluate({x: 2})'],\n  seealso: ['derivative', 'parse', 'evaluate']\n};","export var rationalizeDocs = {\n  name: 'rationalize',\n  category: 'Algebra',\n  syntax: ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],\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: ['rationalize(\"2x/y - y/(x+1)\")', 'rationalize(\"2x/y - y/(x+1)\", true)'],\n  seealso: ['simplify']\n};","export var sluDocs = {\n  name: 'slu',\n  category: 'Algebra',\n  syntax: ['slu(A, order, threshold)'],\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: ['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  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']\n};","export var usolveDocs = {\n  name: 'usolve',\n  category: 'Algebra',\n  syntax: ['x=usolve(U, b)'],\n  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.',\n  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],\n  seealso: ['usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']\n};","export var usolveAllDocs = {\n  name: 'usolveAll',\n  category: 'Algebra',\n  syntax: ['x=usolve(U, b)'],\n  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.',\n  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],\n  seealso: ['usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']\n};","export var qrDocs = {\n  name: 'qr',\n  category: 'Algebra',\n  syntax: ['qr(A)'],\n  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.',\n  examples: ['qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'],\n  seealso: ['lup', 'slu', 'matrix']\n};","export var absDocs = {\n  name: 'abs',\n  category: 'Arithmetic',\n  syntax: ['abs(x)'],\n  description: 'Compute the absolute value.',\n  examples: ['abs(3.5)', 'abs(-4.2)'],\n  seealso: ['sign']\n};","export var addDocs = {\n  name: 'add',\n  category: 'Operators',\n  syntax: ['x + y', 'add(x, y)'],\n  description: 'Add two values.',\n  examples: ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '\"2.3\" + \"4\"'],\n  seealso: ['subtract']\n};","export var cbrtDocs = {\n  name: 'cbrt',\n  category: 'Arithmetic',\n  syntax: ['cbrt(x)', 'cbrt(x, allRoots)'],\n  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',\n  examples: ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],\n  seealso: ['square', 'sqrt', 'cube', 'multiply']\n};","export var ceilDocs = {\n  name: 'ceil',\n  category: 'Arithmetic',\n  syntax: ['ceil(x)'],\n  description: 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',\n  examples: ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)'],\n  seealso: ['floor', 'fix', 'round']\n};","export var cubeDocs = {\n  name: 'cube',\n  category: 'Arithmetic',\n  syntax: ['cube(x)'],\n  description: 'Compute the cube of a value. The cube of x is x * x * x.',\n  examples: ['cube(2)', '2^3', '2 * 2 * 2'],\n  seealso: ['multiply', 'square', 'pow']\n};","export var divideDocs = {\n  name: 'divide',\n  category: 'Operators',\n  syntax: ['x / y', 'divide(x, y)'],\n  description: 'Divide two values.',\n  examples: ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],\n  seealso: ['multiply']\n};","export var dotDivideDocs = {\n  name: 'dotDivide',\n  category: 'Operators',\n  syntax: ['x ./ y', 'dotDivide(x, y)'],\n  description: 'Divide two values element wise.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],\n  seealso: ['multiply', 'dotMultiply', 'divide']\n};","export var dotMultiplyDocs = {\n  name: 'dotMultiply',\n  category: 'Operators',\n  syntax: ['x .* y', 'dotMultiply(x, y)'],\n  description: 'Multiply two values element wise.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],\n  seealso: ['multiply', 'divide', 'dotDivide']\n};","export var dotPowDocs = {\n  name: 'dotPow',\n  category: 'Operators',\n  syntax: ['x .^ y', 'dotPow(x, y)'],\n  description: 'Calculates the power of x to y element wise.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],\n  seealso: ['pow']\n};","export var expDocs = {\n  name: 'exp',\n  category: 'Arithmetic',\n  syntax: ['exp(x)'],\n  description: 'Calculate the exponent of a value.',\n  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'],\n  seealso: ['expm', 'expm1', 'pow', 'log']\n};","export var expmDocs = {\n  name: 'expm',\n  category: 'Arithmetic',\n  syntax: ['exp(x)'],\n  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.',\n  examples: ['expm([[0,2],[0,0]])'],\n  seealso: ['exp']\n};","export var expm1Docs = {\n  name: 'expm1',\n  category: 'Arithmetic',\n  syntax: ['expm1(x)'],\n  description: 'Calculate the value of subtracting 1 from the exponential value.',\n  examples: ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],\n  seealso: ['exp', 'pow', 'log']\n};","export var fixDocs = {\n  name: 'fix',\n  category: 'Arithmetic',\n  syntax: ['fix(x)'],\n  description: 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',\n  examples: ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)'],\n  seealso: ['ceil', 'floor', 'round']\n};","export var floorDocs = {\n  name: 'floor',\n  category: 'Arithmetic',\n  syntax: ['floor(x)'],\n  description: 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',\n  examples: ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)'],\n  seealso: ['ceil', 'fix', 'round']\n};","export var gcdDocs = {\n  name: 'gcd',\n  category: 'Arithmetic',\n  syntax: ['gcd(a, b)', 'gcd(a, b, c, ...)'],\n  description: 'Compute the greatest common divisor.',\n  examples: ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],\n  seealso: ['lcm', 'xgcd']\n};","export var hypotDocs = {\n  name: 'hypot',\n  category: 'Arithmetic',\n  syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],\n  description: 'Calculate the hypotenusa of a list with values. ',\n  examples: ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],\n  seealso: ['abs', 'norm']\n};","export var lcmDocs = {\n  name: 'lcm',\n  category: 'Arithmetic',\n  syntax: ['lcm(x, y)'],\n  description: 'Compute the least common multiple.',\n  examples: ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],\n  seealso: ['gcd']\n};","export var logDocs = {\n  name: 'log',\n  category: 'Arithmetic',\n  syntax: ['log(x)', 'log(x, base)'],\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: ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],\n  seealso: ['exp', 'log1p', 'log2', 'log10']\n};","export var log2Docs = {\n  name: 'log2',\n  category: 'Arithmetic',\n  syntax: ['log2(x)'],\n  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',\n  examples: ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],\n  seealso: ['exp', 'log1p', 'log', 'log10']\n};","export var log1pDocs = {\n  name: 'log1p',\n  category: 'Arithmetic',\n  syntax: ['log1p(x)', 'log1p(x, base)'],\n  description: 'Calculate the logarithm of a `value+1`',\n  examples: ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],\n  seealso: ['exp', 'log', 'log2', 'log10']\n};","export var log10Docs = {\n  name: 'log10',\n  category: 'Arithmetic',\n  syntax: ['log10(x)'],\n  description: 'Compute the 10-base logarithm of a value.',\n  examples: ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],\n  seealso: ['exp', 'log']\n};","export var modDocs = {\n  name: 'mod',\n  category: 'Operators',\n  syntax: ['x % y', 'x mod y', 'mod(x, y)'],\n  description: 'Calculates the modulus, the remainder of an integer division.',\n  examples: ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],\n  seealso: ['divide']\n};","export var multiplyDocs = {\n  name: 'multiply',\n  category: 'Operators',\n  syntax: ['x * y', 'multiply(x, y)'],\n  description: 'multiply two values.',\n  examples: ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],\n  seealso: ['divide']\n};","export var normDocs = {\n  name: 'norm',\n  category: 'Arithmetic',\n  syntax: ['norm(x)', 'norm(x, p)'],\n  description: 'Calculate the norm of a number, vector or matrix.',\n  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\")']\n};","export var nthRootDocs = {\n  name: 'nthRoot',\n  category: 'Arithmetic',\n  syntax: ['nthRoot(a)', 'nthRoot(a, root)'],\n  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\".',\n  examples: ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],\n  seealso: ['nthRoots', 'pow', 'sqrt']\n};","export var nthRootsDocs = {\n  name: 'nthRoots',\n  category: 'Arithmetic',\n  syntax: ['nthRoots(A)', 'nthRoots(A, root)'],\n  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.',\n  examples: ['nthRoots(1)', 'nthRoots(1, 3)'],\n  seealso: ['sqrt', 'pow', 'nthRoot']\n};","export var powDocs = {\n  name: 'pow',\n  category: 'Operators',\n  syntax: ['x ^ y', 'pow(x, y)'],\n  description: 'Calculates the power of x to y, x^y.',\n  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)'],\n  seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']\n};","export var roundDocs = {\n  name: 'round',\n  category: 'Arithmetic',\n  syntax: ['round(x)', 'round(x, n)'],\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.',\n  examples: ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)'],\n  seealso: ['ceil', 'floor', 'fix']\n};","export var signDocs = {\n  name: 'sign',\n  category: 'Arithmetic',\n  syntax: ['sign(x)'],\n  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.',\n  examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],\n  seealso: ['abs']\n};","export var sqrtDocs = {\n  name: 'sqrt',\n  category: 'Arithmetic',\n  syntax: ['sqrt(x)'],\n  description: 'Compute the square root value. If x = y * y, then y is the square root of x.',\n  examples: ['sqrt(25)', '5 * 5', 'sqrt(-1)'],\n  seealso: ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']\n};","export var sqrtmDocs = {\n  name: 'sqrtm',\n  category: 'Arithmetic',\n  syntax: ['sqrtm(x)'],\n  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`.',\n  examples: ['sqrtm([[1, 2], [3, 4]])'],\n  seealso: ['sqrt', 'abs', 'square', 'multiply']\n};","export var squareDocs = {\n  name: 'square',\n  category: 'Arithmetic',\n  syntax: ['square(x)'],\n  description: 'Compute the square of a value. The square of x is x * x.',\n  examples: ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],\n  seealso: ['multiply', 'pow', 'sqrt', 'cube']\n};","export var subtractDocs = {\n  name: 'subtract',\n  category: 'Operators',\n  syntax: ['x - y', 'subtract(x, y)'],\n  description: 'subtract two values.',\n  examples: ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],\n  seealso: ['add']\n};","export var unaryMinusDocs = {\n  name: 'unaryMinus',\n  category: 'Operators',\n  syntax: ['-x', 'unaryMinus(x)'],\n  description: 'Inverse the sign of a value. Converts booleans and strings to numbers.',\n  examples: ['-4.5', '-(-5.6)', '-\"22\"'],\n  seealso: ['add', 'subtract', 'unaryPlus']\n};","export var unaryPlusDocs = {\n  name: 'unaryPlus',\n  category: 'Operators',\n  syntax: ['+x', 'unaryPlus(x)'],\n  description: 'Converts booleans and strings to numbers.',\n  examples: ['+true', '+\"2\"'],\n  seealso: ['add', 'subtract', 'unaryMinus']\n};","export var xgcdDocs = {\n  name: 'xgcd',\n  category: 'Arithmetic',\n  syntax: ['xgcd(a, b)'],\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: ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],\n  seealso: ['gcd', 'lcm']\n};","export var bitAndDocs = {\n  name: 'bitAnd',\n  category: 'Bitwise',\n  syntax: ['x & y', 'bitAnd(x, y)'],\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: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],\n  seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var bitNotDocs = {\n  name: 'bitNot',\n  category: 'Bitwise',\n  syntax: ['~x', 'bitNot(x)'],\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: ['~1', '~2', 'bitNot([2, -3, 4])'],\n  seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var bitOrDocs = {\n  name: 'bitOr',\n  category: 'Bitwise',\n  syntax: ['x | y', 'bitOr(x, y)'],\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: ['5 | 3', 'bitOr([1, 2, 3], 4)'],\n  seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var bitXorDocs = {\n  name: 'bitXor',\n  category: 'Bitwise',\n  syntax: ['bitXor(x, y)'],\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: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","export var leftShiftDocs = {\n  name: 'leftShift',\n  category: 'Bitwise',\n  syntax: ['x << y', 'leftShift(x, y)'],\n  description: 'Bitwise left logical shift of a value x by y number of bits.',\n  examples: ['4 << 1', '8 >> 1'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']\n};","export var rightArithShiftDocs = {\n  name: 'rightArithShift',\n  category: 'Bitwise',\n  syntax: ['x >> y', 'rightArithShift(x, y)'],\n  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',\n  examples: ['8 >> 1', '4 << 1', '-12 >> 2'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']\n};","export var rightLogShiftDocs = {\n  name: 'rightLogShift',\n  category: 'Bitwise',\n  syntax: ['x >>> y', 'rightLogShift(x, y)'],\n  description: 'Bitwise right logical shift of a value x by y number of bits.',\n  examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],\n  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']\n};","export var bellNumbersDocs = {\n  name: 'bellNumbers',\n  category: 'Combinatorics',\n  syntax: ['bellNumbers(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: ['bellNumbers(3)', 'bellNumbers(8)'],\n  seealso: ['stirlingS2']\n};","export var catalanDocs = {\n  name: 'catalan',\n  category: 'Combinatorics',\n  syntax: ['catalan(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: ['catalan(3)', 'catalan(8)'],\n  seealso: ['bellNumbers']\n};","export var compositionDocs = {\n  name: 'composition',\n  category: 'Combinatorics',\n  syntax: ['composition(n, k)'],\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: ['composition(5, 3)'],\n  seealso: ['combinations']\n};","export var stirlingS2Docs = {\n  name: 'stirlingS2',\n  category: 'Combinatorics',\n  syntax: ['stirlingS2(n, k)'],\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: ['stirlingS2(5, 3)'],\n  seealso: ['bellNumbers']\n};","export var configDocs = {\n  name: 'config',\n  category: 'Core',\n  syntax: ['config()', 'config(options)'],\n  description: 'Get configuration or change configuration.',\n  examples: ['config()', '1/3 + 1/4', 'config({number: \"Fraction\"})', '1/3 + 1/4'],\n  seealso: []\n};","export var importDocs = {\n  name: 'import',\n  category: 'Core',\n  syntax: ['import(functions)', 'import(functions, options)'],\n  description: 'Import functions or constants from an object.',\n  examples: ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],\n  seealso: []\n};","export var typedDocs = {\n  name: 'typed',\n  category: 'Core',\n  syntax: ['typed(signatures)', 'typed(name, signatures)'],\n  description: 'Create a typed function.',\n  examples: ['double = typed({ \"number, number\": f(x)=x+x })', 'double(2)', 'double(\"hello\")'],\n  seealso: []\n};","export var argDocs = {\n  name: 'arg',\n  category: 'Complex',\n  syntax: ['arg(x)'],\n  description: 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',\n  examples: ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],\n  seealso: ['re', 'im', 'conj', 'abs']\n};","export var conjDocs = {\n  name: 'conj',\n  category: 'Complex',\n  syntax: ['conj(x)'],\n  description: 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',\n  examples: ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],\n  seealso: ['re', 'im', 'abs', 'arg']\n};","export var reDocs = {\n  name: 're',\n  category: 'Complex',\n  syntax: ['re(x)'],\n  description: 'Get the real part of a complex number.',\n  examples: ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],\n  seealso: ['im', 'conj', 'abs', 'arg']\n};","export var imDocs = {\n  name: 'im',\n  category: 'Complex',\n  syntax: ['im(x)'],\n  description: 'Get the imaginary part of a complex number.',\n  examples: ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],\n  seealso: ['re', 'conj', 'abs', 'arg']\n};","export var evaluateDocs = {\n  name: 'evaluate',\n  category: 'Expression',\n  syntax: ['evaluate(expression)', 'evaluate([expr1, expr2, expr3, ...])'],\n  description: 'Evaluate an expression or an array with expressions.',\n  examples: ['evaluate(\"2 + 3\")', 'evaluate(\"sqrt(\" + 4 + \")\")'],\n  seealso: []\n};","export var helpDocs = {\n  name: 'help',\n  category: 'Expression',\n  syntax: ['help(object)', 'help(string)'],\n  description: 'Display documentation on a function or data type.',\n  examples: ['help(sqrt)', 'help(\"complex\")'],\n  seealso: []\n};","export var distanceDocs = {\n  name: 'distance',\n  category: 'Geometry',\n  syntax: ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2]])'],\n  description: 'Calculates the Euclidean distance between two points.',\n  examples: ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],\n  seealso: []\n};","export var intersectDocs = {\n  name: 'intersect',\n  category: 'Geometry',\n  syntax: ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],\n  description: 'Computes the intersection point of lines and/or planes.',\n  examples: ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'],\n  seealso: []\n};","export var andDocs = {\n  name: 'and',\n  category: 'Logical',\n  syntax: ['x and y', 'and(x, y)'],\n  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',\n  examples: ['true and false', 'true and true', '2 and 4'],\n  seealso: ['not', 'or', 'xor']\n};","export var notDocs = {\n  name: 'not',\n  category: 'Logical',\n  syntax: ['not x', 'not(x)'],\n  description: 'Logical not. Flips the boolean value of given argument.',\n  examples: ['not true', 'not false', 'not 2', 'not 0'],\n  seealso: ['and', 'or', 'xor']\n};","export var orDocs = {\n  name: 'or',\n  category: 'Logical',\n  syntax: ['x or y', 'or(x, y)'],\n  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',\n  examples: ['true or false', 'false or false', '0 or 4'],\n  seealso: ['not', 'and', 'xor']\n};","export var xorDocs = {\n  name: 'xor',\n  category: 'Logical',\n  syntax: ['x xor y', 'xor(x, y)'],\n  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',\n  examples: ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],\n  seealso: ['not', 'and', 'or']\n};","export var concatDocs = {\n  name: 'concat',\n  category: 'Matrix',\n  syntax: ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],\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: ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],\n  seealso: ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var countDocs = {\n  name: 'count',\n  category: 'Matrix',\n  syntax: ['count(x)'],\n  description: 'Count the number of elements of a matrix, array or string.',\n  examples: ['a = [1, 2; 3, 4; 5, 6]', 'count(a)', 'size(a)', 'count(\"hello world\")'],\n  seealso: ['size']\n};","export var crossDocs = {\n  name: 'cross',\n  category: 'Matrix',\n  syntax: ['cross(A, B)'],\n  description: 'Calculate the cross product for two vectors in three dimensional space.',\n  examples: ['cross([1, 1, 0],  [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4],  [5, 6, 7])'],\n  seealso: ['multiply', 'dot']\n};","export var columnDocs = {\n  name: 'column',\n  category: 'Matrix',\n  syntax: ['column(x, index)'],\n  description: 'Return a column from a matrix or array.',\n  examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],\n  seealso: ['row']\n};","export var ctransposeDocs = {\n  name: 'ctranspose',\n  category: 'Matrix',\n  syntax: ['x\\'', 'ctranspose(x)'],\n  description: 'Complex Conjugate and Transpose a matrix',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\\'', 'ctranspose(a)'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']\n};","export var detDocs = {\n  name: 'det',\n  category: 'Matrix',\n  syntax: ['det(x)'],\n  description: 'Calculate the determinant of a matrix',\n  examples: ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],\n  seealso: ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var diagDocs = {\n  name: 'diag',\n  category: 'Matrix',\n  syntax: ['diag(x)', 'diag(x, k)'],\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: ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],\n  seealso: ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var diffDocs = {\n  name: 'diff',\n  category: 'Matrix',\n  syntax: ['diff(arr)', 'diff(arr, dim)'],\n  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'],\n  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)'],\n  seealso: ['subtract', 'partitionSelect']\n};","export var dotDocs = {\n  name: 'dot',\n  category: 'Matrix',\n  syntax: ['dot(A, B)', 'A * B'],\n  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',\n  examples: ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],\n  seealso: ['multiply', 'cross']\n};","export var getMatrixDataTypeDocs = {\n  name: 'getMatrixDataType',\n  category: 'Matrix',\n  syntax: ['getMatrixDataType(x)'],\n  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\".',\n  examples: ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, \"text\"])', 'getMatrixDataType([1, bignumber(4)])'],\n  seealso: ['matrix', 'sparse', 'typeOf']\n};","export var identityDocs = {\n  name: 'identity',\n  category: 'Matrix',\n  syntax: ['identity(n)', 'identity(m, n)', 'identity([m, n])'],\n  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',\n  examples: ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],\n  seealso: ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var filterDocs = {\n  name: 'filter',\n  category: 'Matrix',\n  syntax: ['filter(x, test)'],\n  description: 'Filter items in a matrix.',\n  examples: ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],\n  seealso: ['sort', 'map', 'forEach']\n};","export var flattenDocs = {\n  name: 'flatten',\n  category: 'Matrix',\n  syntax: ['flatten(x)'],\n  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],\n  seealso: ['concat', 'resize', 'size', 'squeeze']\n};","export var forEachDocs = {\n  name: 'forEach',\n  category: 'Matrix',\n  syntax: ['forEach(x, callback)'],\n  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',\n  examples: ['forEach([1, 2, 3], function(val) { console.log(val) })'],\n  seealso: ['map', 'sort', 'filter']\n};","export var invDocs = {\n  name: 'inv',\n  category: 'Matrix',\n  syntax: ['inv(x)'],\n  description: 'Calculate the inverse of a matrix',\n  examples: ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var eigsDocs = {\n  name: 'eigs',\n  category: 'Matrix',\n  syntax: ['eigs(x)'],\n  description: 'Calculate the eigenvalues and eigenvectors of a real symmetric matrix',\n  examples: ['eigs([[5, 2.3], [2.3, 1]])'],\n  seealso: ['inv']\n};","export var kronDocs = {\n  name: 'kron',\n  category: 'Matrix',\n  syntax: ['kron(x, y)'],\n  description: 'Calculates the kronecker product of 2 matrices or vectors.',\n  examples: ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],\n  seealso: ['multiply', 'dot', 'cross']\n};","export var mapDocs = {\n  name: 'map',\n  category: 'Matrix',\n  syntax: ['map(x, callback)'],\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: ['map([1, 2, 3], square)'],\n  seealso: ['filter', 'forEach']\n};","export var onesDocs = {\n  name: 'ones',\n  category: 'Matrix',\n  syntax: ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],\n  description: 'Create a matrix containing ones.',\n  examples: ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var partitionSelectDocs = {\n  name: 'partitionSelect',\n  category: 'Matrix',\n  syntax: ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],\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: ['partitionSelect([5, 10, 1], 2)', 'partitionSelect([\"C\", \"B\", \"A\", \"D\"], 1)'],\n  seealso: ['sort']\n};","export var rangeDocs = {\n  name: 'range',\n  category: 'Type',\n  syntax: ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],\n  description: 'Create a range. Lower bound of the range is included, upper bound is excluded.',\n  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]'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var resizeDocs = {\n  name: 'resize',\n  category: 'Matrix',\n  syntax: ['resize(x, size)', 'resize(x, size, defaultValue)'],\n  description: 'Resize a matrix.',\n  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], \"!\")'],\n  seealso: ['size', 'subset', 'squeeze', 'reshape']\n};","export var reshapeDocs = {\n  name: 'reshape',\n  category: 'Matrix',\n  syntax: ['reshape(x, sizes)'],\n  description: 'Reshape a multi dimensional array to fit the specified dimensions.',\n  examples: ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])'],\n  seealso: ['size', 'squeeze', 'resize']\n};","export var rotateDocs = {\n  name: 'rotate',\n  category: 'Matrix',\n  syntax: ['rotate(w, theta)', 'rotate(w, theta, v)'],\n  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.',\n  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]))'],\n  seealso: ['matrix', 'rotationMatrix']\n};","export var rotationMatrixDocs = {\n  name: 'rotationMatrix',\n  category: 'Matrix',\n  syntax: ['rotationMatrix(theta)', 'rotationMatrix(theta, v)', 'rotationMatrix(theta, v, format)'],\n  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.',\n  examples: ['rotationMatrix(pi / 2)', 'rotationMatrix(unit(\"45deg\"), [0, 0, 1])', 'rotationMatrix(1, matrix([0, 0, 1]), \"sparse\")'],\n  seealso: ['cos', 'sin']\n};","export var rowDocs = {\n  name: 'row',\n  category: 'Matrix',\n  syntax: ['row(x, index)'],\n  description: 'Return a row from a matrix or array.',\n  examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],\n  seealso: ['column']\n};","export var sizeDocs = {\n  name: 'size',\n  category: 'Matrix',\n  syntax: ['size(x)'],\n  description: 'Calculate the size of a matrix.',\n  examples: ['size(2.3)', 'size(\"hello world\")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],\n  seealso: ['concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","export var sortDocs = {\n  name: 'sort',\n  category: 'Matrix',\n  syntax: ['sort(x)', 'sort(x, compare)'],\n  description: 'Sort the items in a matrix. Compare can be a string \"asc\", \"desc\", \"natural\", or a custom sort function.',\n  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\")'],\n  seealso: ['map', 'filter', 'forEach']\n};","export var squeezeDocs = {\n  name: 'squeeze',\n  category: 'Matrix',\n  syntax: ['squeeze(x)'],\n  description: 'Remove inner and outer singleton dimensions from a matrix.',\n  examples: ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']\n};","export var subsetDocs = {\n  name: 'subset',\n  category: 'Matrix',\n  syntax: ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],\n  description: 'Get or set a subset of a matrix or string. ' + 'Indexes are one-based. ' + 'Both the ranges lower-bound and upper-bound are included.',\n  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]'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']\n};","export var traceDocs = {\n  name: 'trace',\n  category: 'Matrix',\n  syntax: ['trace(A)'],\n  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',\n  examples: ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']\n};","export var transposeDocs = {\n  name: 'transpose',\n  category: 'Matrix',\n  syntax: ['x\\'', 'transpose(x)'],\n  description: 'Transpose a matrix',\n  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\\'', 'transpose(a)'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']\n};","export var zerosDocs = {\n  name: 'zeros',\n  category: 'Matrix',\n  syntax: ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],\n  description: 'Create a matrix containing zeros.',\n  examples: ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']\n};","export var combinationsDocs = {\n  name: 'combinations',\n  category: 'Probability',\n  syntax: ['combinations(n, k)'],\n  description: 'Compute the number of combinations of n items taken k at a time',\n  examples: ['combinations(7, 5)'],\n  seealso: ['combinationsWithRep', 'permutations', 'factorial']\n};","export var combinationsWithRepDocs = {\n  name: 'combinationsWithRep',\n  category: 'Probability',\n  syntax: ['combinationsWithRep(n, k)'],\n  description: 'Compute the number of combinations of n items taken k at a time with replacements.',\n  examples: ['combinationsWithRep(7, 5)'],\n  seealso: ['combinations', 'permutations', 'factorial']\n};","export var factorialDocs = {\n  name: 'factorial',\n  category: 'Probability',\n  syntax: ['n!', 'factorial(n)'],\n  description: 'Compute the factorial of a value',\n  examples: ['5!', '5 * 4 * 3 * 2 * 1', '3!'],\n  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']\n};","export var gammaDocs = {\n  name: 'gamma',\n  category: 'Probability',\n  syntax: ['gamma(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: ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],\n  seealso: ['factorial']\n};","export var kldivergenceDocs = {\n  name: 'kldivergence',\n  category: 'Probability',\n  syntax: ['kldivergence(x, y)'],\n  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',\n  examples: ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],\n  seealso: []\n};","export var multinomialDocs = {\n  name: 'multinomial',\n  category: 'Probability',\n  syntax: ['multinomial(A)'],\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: ['multinomial([1, 2, 1])'],\n  seealso: ['combinations', 'factorial']\n};","export var permutationsDocs = {\n  name: 'permutations',\n  category: 'Probability',\n  syntax: ['permutations(n)', 'permutations(n, k)'],\n  description: 'Compute the number of permutations of n items taken k at a time',\n  examples: ['permutations(5)', 'permutations(5, 3)'],\n  seealso: ['combinations', 'combinationsWithRep', 'factorial']\n};","export var pickRandomDocs = {\n  name: 'pickRandom',\n  category: 'Probability',\n  syntax: ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],\n  description: 'Pick a random entry from a given array.',\n  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)'],\n  seealso: ['random', 'randomInt']\n};","export var randomDocs = {\n  name: 'random',\n  category: 'Probability',\n  syntax: ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],\n  description: 'Return a random number.',\n  examples: ['random()', 'random(10, 20)', 'random([2, 3])'],\n  seealso: ['pickRandom', 'randomInt']\n};","export var randomIntDocs = {\n  name: 'randomInt',\n  category: 'Probability',\n  syntax: ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],\n  description: 'Return a random integer number',\n  examples: ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],\n  seealso: ['pickRandom', 'random']\n};","export var compareDocs = {\n  name: 'compare',\n  category: 'Relational',\n  syntax: ['compare(x, y)'],\n  description: 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],\n  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']\n};","export var compareNaturalDocs = {\n  name: 'compareNatural',\n  category: 'Relational',\n  syntax: ['compareNatural(x, y)'],\n  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.',\n  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})'],\n  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']\n};","export var compareTextDocs = {\n  name: 'compareText',\n  category: 'Relational',\n  syntax: ['compareText(x, y)'],\n  description: 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  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\"])'],\n  seealso: ['compare', 'compareNatural']\n};","export var deepEqualDocs = {\n  name: 'deepEqual',\n  category: 'Relational',\n  syntax: ['deepEqual(x, y)'],\n  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.',\n  examples: ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],\n  seealso: ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']\n};","export var equalDocs = {\n  name: 'equal',\n  category: 'Relational',\n  syntax: ['x == y', 'equal(x, y)'],\n  description: 'Check equality of two values. Returns true if the values are equal, and false if not.',\n  examples: ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],\n  seealso: ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']\n};","export var equalTextDocs = {\n  name: 'equalText',\n  category: 'Relational',\n  syntax: ['equalText(x, y)'],\n  description: 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',\n  examples: ['equalText(\"Hello\", \"Hello\")', 'equalText(\"a\", \"A\")', 'equal(\"2e3\", \"2000\")', 'equalText(\"2e3\", \"2000\")', 'equalText(\"B\", [\"A\", \"B\", \"C\"])'],\n  seealso: ['compare', 'compareNatural', 'compareText', 'equal']\n};","export var largerDocs = {\n  name: 'larger',\n  category: 'Relational',\n  syntax: ['x > y', 'larger(x, y)'],\n  description: 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.',\n  examples: ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],\n  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']\n};","export var largerEqDocs = {\n  name: 'largerEq',\n  category: 'Relational',\n  syntax: ['x >= y', 'largerEq(x, y)'],\n  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.',\n  examples: ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],\n  seealso: ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']\n};","export var smallerDocs = {\n  name: 'smaller',\n  category: 'Relational',\n  syntax: ['x < y', 'smaller(x, y)'],\n  description: 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.',\n  examples: ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],\n  seealso: ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']\n};","export var smallerEqDocs = {\n  name: 'smallerEq',\n  category: 'Relational',\n  syntax: ['x <= y', 'smallerEq(x, y)'],\n  description: '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: ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],\n  seealso: ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']\n};","export var unequalDocs = {\n  name: 'unequal',\n  category: 'Relational',\n  syntax: ['x != y', 'unequal(x, y)'],\n  description: 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',\n  examples: ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],\n  seealso: ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']\n};","export var setCartesianDocs = {\n  name: 'setCartesian',\n  category: 'Set',\n  syntax: ['setCartesian(set1, set2)'],\n  description: 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setCartesian([1, 2], [3, 4])'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']\n};","export var setDifferenceDocs = {\n  name: 'setDifference',\n  category: 'Set',\n  syntax: ['setDifference(set1, set2)'],\n  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.',\n  examples: ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setUnion', 'setIntersect', 'setSymDifference']\n};","export var setDistinctDocs = {\n  name: 'setDistinct',\n  category: 'Set',\n  syntax: ['setDistinct(set)'],\n  description: 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: ['setDistinct([1, 1, 1, 2, 2, 3])'],\n  seealso: ['setMultiplicity']\n};","export var setIntersectDocs = {\n  name: 'setIntersect',\n  category: 'Set',\n  syntax: ['setIntersect(set1, set2)'],\n  description: 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setUnion', 'setDifference']\n};","export var setIsSubsetDocs = {\n  name: 'setIsSubset',\n  category: 'Set',\n  syntax: ['setIsSubset(set1, set2)'],\n  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.',\n  examples: ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference']\n};","export var setMultiplicityDocs = {\n  name: 'setMultiplicity',\n  category: 'Set',\n  syntax: ['setMultiplicity(element, set)'],\n  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.',\n  examples: ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],\n  seealso: ['setDistinct', 'setSize']\n};","export var setPowersetDocs = {\n  name: 'setPowerset',\n  category: 'Set',\n  syntax: ['setPowerset(set)'],\n  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.',\n  examples: ['setPowerset([1, 2, 3])'],\n  seealso: ['setCartesian']\n};","export var setSizeDocs = {\n  name: 'setSize',\n  category: 'Set',\n  syntax: ['setSize(set)', 'setSize(set, unique)'],\n  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.',\n  examples: ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference']\n};","export var setSymDifferenceDocs = {\n  name: 'setSymDifference',\n  category: 'Set',\n  syntax: ['setSymDifference(set1, set2)'],\n  description: 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference']\n};","export var setUnionDocs = {\n  name: 'setUnion',\n  category: 'Set',\n  syntax: ['setUnion(set1, set2)'],\n  description: 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  seealso: ['setIntersect', 'setDifference']\n};","export var erfDocs = {\n  name: 'erf',\n  category: 'Special',\n  syntax: ['erf(x)'],\n  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',\n  examples: ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],\n  seealso: []\n};","export var madDocs = {\n  name: 'mad',\n  category: 'Statistics',\n  syntax: ['mad(a, b, c, ...)', 'mad(A)'],\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: ['mad(10, 20, 30)', 'mad([1, 2, 3])'],\n  seealso: ['mean', 'median', 'std', 'abs']\n};","export var maxDocs = {\n  name: 'max',\n  category: 'Statistics',\n  syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dim)'],\n  description: 'Compute the maximum value of a list of values.',\n  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)'],\n  seealso: ['mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']\n};","export var meanDocs = {\n  name: 'mean',\n  category: 'Statistics',\n  syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dim)'],\n  description: 'Compute the arithmetic mean of a list of values.',\n  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])'],\n  seealso: ['max', 'median', 'min', 'prod', 'std', 'sum', 'variance']\n};","export var medianDocs = {\n  name: 'median',\n  category: 'Statistics',\n  syntax: ['median(a, b, c, ...)', 'median(A)'],\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: ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],\n  seealso: ['max', 'mean', 'min', 'prod', 'std', 'sum', 'variance', 'quantileSeq']\n};","export var minDocs = {\n  name: 'min',\n  category: 'Statistics',\n  syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dim)'],\n  description: 'Compute the minimum value of a list of values.',\n  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)'],\n  seealso: ['max', 'mean', 'median', 'prod', 'std', 'sum', 'variance']\n};","export var modeDocs = {\n  name: 'mode',\n  category: 'Statistics',\n  syntax: ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],\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: ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],\n  seealso: ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'variance']\n};","export var prodDocs = {\n  name: 'prod',\n  category: 'Statistics',\n  syntax: ['prod(a, b, c, ...)', 'prod(A)'],\n  description: 'Compute the product of all values.',\n  examples: ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],\n  seealso: ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'variance']\n};","export var quantileSeqDocs = {\n  name: 'quantileSeq',\n  category: 'Statistics',\n  syntax: ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],\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: ['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)'],\n  seealso: ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'variance']\n};","export var stdDocs = {\n  name: 'std',\n  category: 'Statistics',\n  syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, normalization)'],\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: ['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])'],\n  seealso: ['max', 'mean', 'min', 'median', 'prod', 'sum', 'variance']\n};","export var sumDocs = {\n  name: 'sum',\n  category: 'Statistics',\n  syntax: ['sum(a, b, c, ...)', 'sum(A)'],\n  description: 'Compute the sum of all values.',\n  examples: ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],\n  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']\n};","export var varianceDocs = {\n  name: 'variance',\n  category: 'Statistics',\n  syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, normalization)'],\n  description: 'Compute the variance of all values. Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  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])'],\n  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']\n};","export var acosDocs = {\n  name: 'acos',\n  category: 'Trigonometry',\n  syntax: ['acos(x)'],\n  description: 'Compute the inverse cosine of a value in radians.',\n  examples: ['acos(0.5)', 'acos(cos(2.3))'],\n  seealso: ['cos', 'atan', 'asin']\n};","export var acoshDocs = {\n  name: 'acosh',\n  category: 'Trigonometry',\n  syntax: ['acosh(x)'],\n  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',\n  examples: ['acosh(1.5)'],\n  seealso: ['cosh', 'asinh', 'atanh']\n};","export var acotDocs = {\n  name: 'acot',\n  category: 'Trigonometry',\n  syntax: ['acot(x)'],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],\n  seealso: ['cot', 'atan']\n};","export var acothDocs = {\n  name: 'acoth',\n  category: 'Trigonometry',\n  syntax: ['acoth(x)'],\n  description: 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',\n  examples: ['acoth(2)', 'acoth(0.5)'],\n  seealso: ['acsch', 'asech']\n};","export var acscDocs = {\n  name: 'acsc',\n  category: 'Trigonometry',\n  syntax: ['acsc(x)'],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],\n  seealso: ['csc', 'asin', 'asec']\n};","export var acschDocs = {\n  name: 'acsch',\n  category: 'Trigonometry',\n  syntax: ['acsch(x)'],\n  description: 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',\n  examples: ['acsch(0.5)'],\n  seealso: ['asech', 'acoth']\n};","export var asecDocs = {\n  name: 'asec',\n  category: 'Trigonometry',\n  syntax: ['asec(x)'],\n  description: 'Calculate the inverse secant of a value.',\n  examples: ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],\n  seealso: ['acos', 'acot', 'acsc']\n};","export var asechDocs = {\n  name: 'asech',\n  category: 'Trigonometry',\n  syntax: ['asech(x)'],\n  description: 'Calculate the inverse secant of a value.',\n  examples: ['asech(0.5)'],\n  seealso: ['acsch', 'acoth']\n};","export var asinDocs = {\n  name: 'asin',\n  category: 'Trigonometry',\n  syntax: ['asin(x)'],\n  description: 'Compute the inverse sine of a value in radians.',\n  examples: ['asin(0.5)', 'asin(sin(0.5))'],\n  seealso: ['sin', 'acos', 'atan']\n};","export var asinhDocs = {\n  name: 'asinh',\n  category: 'Trigonometry',\n  syntax: ['asinh(x)'],\n  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',\n  examples: ['asinh(0.5)'],\n  seealso: ['acosh', 'atanh']\n};","export var atanDocs = {\n  name: 'atan',\n  category: 'Trigonometry',\n  syntax: ['atan(x)'],\n  description: 'Compute the inverse tangent of a value in radians.',\n  examples: ['atan(0.5)', 'atan(tan(0.5))'],\n  seealso: ['tan', 'acos', 'asin']\n};","export var atanhDocs = {\n  name: 'atanh',\n  category: 'Trigonometry',\n  syntax: ['atanh(x)'],\n  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',\n  examples: ['atanh(0.5)'],\n  seealso: ['acosh', 'asinh']\n};","export var atan2Docs = {\n  name: 'atan2',\n  category: 'Trigonometry',\n  syntax: ['atan2(y, x)'],\n  description: 'Computes the principal value of the arc tangent of y/x in radians.',\n  examples: ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],\n  seealso: ['sin', 'cos', 'tan']\n};","export var cosDocs = {\n  name: 'cos',\n  category: 'Trigonometry',\n  syntax: ['cos(x)'],\n  description: 'Compute the cosine of x in radians.',\n  examples: ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],\n  seealso: ['acos', 'sin', 'tan']\n};","export var coshDocs = {\n  name: 'cosh',\n  category: 'Trigonometry',\n  syntax: ['cosh(x)'],\n  description: 'Compute the hyperbolic cosine of x in radians.',\n  examples: ['cosh(0.5)'],\n  seealso: ['sinh', 'tanh', 'coth']\n};","export var cotDocs = {\n  name: 'cot',\n  category: 'Trigonometry',\n  syntax: ['cot(x)'],\n  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',\n  examples: ['cot(2)', '1 / tan(2)'],\n  seealso: ['sec', 'csc', 'tan']\n};","export var cothDocs = {\n  name: 'coth',\n  category: 'Trigonometry',\n  syntax: ['coth(x)'],\n  description: 'Compute the hyperbolic cotangent of x in radians.',\n  examples: ['coth(2)', '1 / tanh(2)'],\n  seealso: ['sech', 'csch', 'tanh']\n};","export var cscDocs = {\n  name: 'csc',\n  category: 'Trigonometry',\n  syntax: ['csc(x)'],\n  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',\n  examples: ['csc(2)', '1 / sin(2)'],\n  seealso: ['sec', 'cot', 'sin']\n};","export var cschDocs = {\n  name: 'csch',\n  category: 'Trigonometry',\n  syntax: ['csch(x)'],\n  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',\n  examples: ['csch(2)', '1 / sinh(2)'],\n  seealso: ['sech', 'coth', 'sinh']\n};","export var secDocs = {\n  name: 'sec',\n  category: 'Trigonometry',\n  syntax: ['sec(x)'],\n  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',\n  examples: ['sec(2)', '1 / cos(2)'],\n  seealso: ['cot', 'csc', 'cos']\n};","export var sechDocs = {\n  name: 'sech',\n  category: 'Trigonometry',\n  syntax: ['sech(x)'],\n  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',\n  examples: ['sech(2)', '1 / cosh(2)'],\n  seealso: ['coth', 'csch', 'cosh']\n};","export var sinDocs = {\n  name: 'sin',\n  category: 'Trigonometry',\n  syntax: ['sin(x)'],\n  description: 'Compute the sine of x in radians.',\n  examples: ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],\n  seealso: ['asin', 'cos', 'tan']\n};","export var sinhDocs = {\n  name: 'sinh',\n  category: 'Trigonometry',\n  syntax: ['sinh(x)'],\n  description: 'Compute the hyperbolic sine of x in radians.',\n  examples: ['sinh(0.5)'],\n  seealso: ['cosh', 'tanh']\n};","export var tanDocs = {\n  name: 'tan',\n  category: 'Trigonometry',\n  syntax: ['tan(x)'],\n  description: 'Compute the tangent of x in radians.',\n  examples: ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],\n  seealso: ['atan', 'sin', 'cos']\n};","export var tanhDocs = {\n  name: 'tanh',\n  category: 'Trigonometry',\n  syntax: ['tanh(x)'],\n  description: 'Compute the hyperbolic tangent of x in radians.',\n  examples: ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],\n  seealso: ['sinh', 'cosh']\n};","export var toDocs = {\n  name: 'to',\n  category: 'Units',\n  syntax: ['x to unit', 'to(x, unit)'],\n  description: 'Change the unit of a value.',\n  examples: ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],\n  seealso: []\n};","export var cloneDocs = {\n  name: 'clone',\n  category: 'Utils',\n  syntax: ['clone(x)'],\n  description: 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices',\n  examples: ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone(\"hello world\")'],\n  seealso: []\n};","export var formatDocs = {\n  name: 'format',\n  category: 'Utils',\n  syntax: ['format(value)', 'format(value, precision)'],\n  description: 'Format a value of any type as string.',\n  examples: ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],\n  seealso: ['print']\n};","export var binDocs = {\n  name: 'bin',\n  category: 'Utils',\n  syntax: ['bin(value)'],\n  description: 'Format a number as binary',\n  examples: ['bin(2)'],\n  seealso: ['oct', 'hex']\n};","export var octDocs = {\n  name: 'oct',\n  category: 'Utils',\n  syntax: ['oct(value)'],\n  description: 'Format a number as octal',\n  examples: ['oct(56)'],\n  seealso: ['bin', 'hex']\n};","export var hexDocs = {\n  name: 'hex',\n  category: 'Utils',\n  syntax: ['hex(value)'],\n  description: 'Format a number as hexadecimal',\n  examples: ['hex(240)'],\n  seealso: ['bin', 'oct']\n};","export var isNaNDocs = {\n  name: 'isNaN',\n  category: 'Utils',\n  syntax: ['isNaN(x)'],\n  description: 'Test whether a value is NaN (not a number)',\n  examples: ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n};","export var isIntegerDocs = {\n  name: 'isInteger',\n  category: 'Utils',\n  syntax: ['isInteger(x)'],\n  description: 'Test whether a value is an integer number.',\n  examples: ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n};","export var isNegativeDocs = {\n  name: 'isNegative',\n  category: 'Utils',\n  syntax: ['isNegative(x)'],\n  description: 'Test whether a value is negative: smaller than zero.',\n  examples: ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],\n  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']\n};","export var isNumericDocs = {\n  name: 'isNumeric',\n  category: 'Utils',\n  syntax: ['isNumeric(x)'],\n  description: 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',\n  examples: ['isNumeric(2)', 'isNumeric(\"2\")', 'hasNumericValue(\"2\")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, \"foo\", false])'],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']\n};","export var hasNumericValueDocs = {\n  name: 'hasNumericValue',\n  category: 'Utils',\n  syntax: ['hasNumericValue(x)'],\n  description: 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',\n  examples: ['hasNumericValue(2)', 'hasNumericValue(\"2\")', 'isNumeric(\"2\")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, \"foo\", false])'],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']\n};","export var isPositiveDocs = {\n  name: 'isPositive',\n  category: 'Utils',\n  syntax: ['isPositive(x)'],\n  description: 'Test whether a value is positive: larger than zero.',\n  examples: ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n};","export var isPrimeDocs = {\n  name: 'isPrime',\n  category: 'Utils',\n  syntax: ['isPrime(x)'],\n  description: 'Test whether a value is prime: has no divisors other than itself and one.',\n  examples: ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n};","export var isZeroDocs = {\n  name: 'isZero',\n  category: 'Utils',\n  syntax: ['isZero(x)'],\n  description: 'Test whether a value is zero.',\n  examples: ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']\n};","export var typeOfDocs = {\n  name: 'typeOf',\n  category: 'Utils',\n  syntax: ['typeOf(x)'],\n  description: 'Get the type of a variable.',\n  examples: ['typeOf(3.5)', 'typeOf(2 - 4i)', 'typeOf(45 deg)', 'typeOf(\"hello world\")'],\n  seealso: ['getMatrixDataType']\n};","export var numericDocs = {\n  name: 'numeric',\n  category: 'Utils',\n  syntax: ['numeric(x)'],\n  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.',\n  examples: ['numeric(\"4\")', 'numeric(\"4\", \"number\")', 'numeric(\"4\", \"BigNumber\")', 'numeric(\"4\", \"Fraction)', 'numeric(4, \"Fraction\")', 'numeric(fraction(2, 5), \"number)'],\n  seealso: ['number', 'fraction', 'bignumber', 'string', 'format']\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';\nvar name = 'help';\nvar dependencies = ['typed', 'mathWithTransform', 'Help'];\nexport var createHelp = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    mathWithTransform,\n    Help\n  } = _ref;\n\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 any(search) {\n      var prop;\n      var 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        /* 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\n      var doc = getSafeProperty(embeddedDocs, searchName);\n\n      if (!doc) {\n        var searchText = typeof searchName === 'function' ? searchName.name : searchName;\n        throw new Error('No documentation found on \"' + searchText + '\"');\n      }\n\n      return new Help(doc);\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'compile';\nvar dependencies = ['typed', 'parse'];\nexport var createCompile = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    parse\n  } = _ref;\n\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 string(expr) {\n      return parse(expr).compile();\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile();\n      });\n    }\n  });\n});","import { isOperatorNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nimport { hasOwnProperty } from '../../../utils/object.js';\nvar name = 'simplifyUtil';\nvar dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];\nexport var createUtil = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  } = _ref;\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  var commutative = {\n    add: true,\n    multiply: true\n  };\n  var associative = {\n    add: true,\n    multiply: true\n  };\n\n  function isCommutative(node, context) {\n    if (!isOperatorNode(node)) {\n      return true;\n    }\n\n    var name = node.fn.toString();\n\n    if (context && hasOwnProperty(context, name) && hasOwnProperty(context[name], 'commutative')) {\n      return context[name].commutative;\n    }\n\n    return commutative[name] || false;\n  }\n\n  function isAssociative(node, context) {\n    if (!isOperatorNode(node)) {\n      return false;\n    }\n\n    var name = node.fn.toString();\n\n    if (context && hasOwnProperty(context, name) && hasOwnProperty(context[name], 'associative')) {\n      return context[name].associative;\n    }\n\n    return associative[name] || false;\n  }\n  /**\n   * Flatten all associative operators in an expression tree.\n   * Assumes parentheses have already been removed.\n   */\n\n\n  function flatten(node) {\n    if (!node.args || node.args.length === 0) {\n      return node;\n    }\n\n    node.args = allChildren(node);\n\n    for (var i = 0; i < node.args.length; i++) {\n      flatten(node.args[i]);\n    }\n  }\n  /**\n   * Get the children of a node as if it has been flattened.\n   * TODO implement for FunctionNodes\n   */\n\n\n  function allChildren(node) {\n    var op;\n    var children = [];\n\n    var findChildren = function findChildren(node) {\n      for (var i = 0; i < node.args.length; i++) {\n        var child = node.args[i];\n\n        if (isOperatorNode(child) && op === child.op) {\n          findChildren(child);\n        } else {\n          children.push(child);\n        }\n      }\n    };\n\n    if (isAssociative(node)) {\n      op = node.op;\n      findChildren(node);\n      return children;\n    } else {\n      return node.args;\n    }\n  }\n  /**\n   *  Unflatten all flattened operators to a right-heavy binary tree.\n   */\n\n\n  function unflattenr(node) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n\n    for (var i = 0; i < l; i++) {\n      unflattenr(node.args[i]);\n    }\n\n    if (l > 2 && isAssociative(node)) {\n      var curnode = node.args.pop();\n\n      while (node.args.length > 0) {\n        curnode = makeNode([node.args.pop(), curnode]);\n      }\n\n      node.args = curnode.args;\n    }\n  }\n  /**\n   *  Unflatten all flattened operators to a left-heavy binary tree.\n   */\n\n\n  function unflattenl(node) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n\n    for (var i = 0; i < l; i++) {\n      unflattenl(node.args[i]);\n    }\n\n    if (l > 2 && isAssociative(node)) {\n      var curnode = node.args.shift();\n\n      while (node.args.length > 0) {\n        curnode = makeNode([curnode, node.args.shift()]);\n      }\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    isCommutative,\n    isAssociative,\n    flatten,\n    allChildren,\n    unflattenr,\n    unflattenl\n  };\n});","import { isConstantNode, isFunctionNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'simplifyCore';\nvar dependencies = ['equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'ParenthesisNode'];\nexport var createSimplifyCore = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    ParenthesisNode\n  } = _ref;\n  var node0 = new ConstantNode(0);\n  var node1 = new ConstantNode(1);\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   *     simplify.simplifyCore(expr)\n   *\n   * Examples:\n   *\n   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')\n   *     math.simplify.simpifyCore(f)                          // Node {2 * x}\n   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplify.simpifyCore]) // Node {2 * x}\n   *\n   * See also:\n   *\n   *     derivative\n   *\n   * @param {Node} node\n   *     The expression to be simplified\n   */\n\n  function simplifyCore(node) {\n    if (isOperatorNode(node) && node.isUnary()) {\n      var a0 = simplifyCore(node.args[0]);\n\n      if (node.op === '+') {\n        // unary plus\n        return a0;\n      }\n\n      if (node.op === '-') {\n        // 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\n        return new OperatorNode(node.op, node.fn, [a0]);\n      }\n    } else if (isOperatorNode(node) && node.isBinary()) {\n      var _a = simplifyCore(node.args[0]);\n\n      var a1 = simplifyCore(node.args[1]);\n\n      if (node.op === '+') {\n        if (isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return a1;\n          } else if (isConstantNode(a1)) {\n            return new ConstantNode(add(_a.value, a1.value));\n          }\n        }\n\n        if (isConstantNode(a1) && isZero(a1.value)) {\n          return _a;\n        }\n\n        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n          return new OperatorNode('-', 'subtract', [_a, a1.args[0]]);\n        }\n\n        return new OperatorNode(node.op, node.fn, a1 ? [_a, a1] : [_a]);\n      } else if (node.op === '-') {\n        if (isConstantNode(_a) && a1) {\n          if (isConstantNode(a1)) {\n            return new ConstantNode(subtract(_a.value, a1.value));\n          } else if (isZero(_a.value)) {\n            return new OperatorNode('-', 'unaryMinus', [a1]);\n          }\n        } // if (node.fn === \"subtract\" && node.args.length === 2) {\n\n\n        if (node.fn === 'subtract') {\n          if (isConstantNode(a1) && isZero(a1.value)) {\n            return _a;\n          }\n\n          if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n            return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]));\n          }\n\n          return new OperatorNode(node.op, node.fn, [_a, a1]);\n        }\n      } else if (node.op === '*') {\n        if (isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (equal(_a.value, 1)) {\n            return a1;\n          } else if (isConstantNode(a1)) {\n            return new ConstantNode(multiply(_a.value, a1.value));\n          }\n        }\n\n        if (isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node0;\n          } else if (equal(a1.value, 1)) {\n            return _a;\n          } else if (isOperatorNode(_a) && _a.isBinary() && _a.op === node.op) {\n            var a00 = _a.args[0];\n\n            if (isConstantNode(a00)) {\n              var a00a1 = new ConstantNode(multiply(a00.value, a1.value));\n              return new OperatorNode(node.op, node.fn, [a00a1, _a.args[1]], node.implicit); // constants on left\n            }\n          }\n\n          return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);\n      } else if (node.op === '/') {\n        if (isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (isConstantNode(a1) && (equal(a1.value, 1) || equal(a1.value, 2) || equal(a1.value, 4))) {\n            return new ConstantNode(divide(_a.value, a1.value));\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, 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 _a;\n          } else {\n            if (isConstantNode(_a)) {\n              // fold constant\n              return new ConstantNode(pow(_a.value, a1.value));\n            } else if (isOperatorNode(_a) && _a.isBinary() && _a.op === '^') {\n              var a01 = _a.args[1];\n\n              if (isConstantNode(a01)) {\n                return new OperatorNode(node.op, node.fn, [_a.args[0], new ConstantNode(multiply(a01.value, a1.value))]);\n              }\n            }\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1]);\n      }\n    } else if (isParenthesisNode(node)) {\n      var c = simplifyCore(node.content);\n\n      if (isParenthesisNode(c) || isSymbolNode(c) || isConstantNode(c)) {\n        return c;\n      }\n\n      return new ParenthesisNode(c);\n    } else if (isFunctionNode(node)) {\n      var args = node.args.map(simplifyCore).map(function (arg) {\n        return isParenthesisNode(arg) ? arg.content : arg;\n      });\n      return new FunctionNode(simplifyCore(node.fn), args);\n    } else {// cannot simplify\n    }\n\n    return node;\n  }\n\n  return simplifyCore;\n});","// TODO this could be improved by simplifying seperated constants under associative and commutative operators\nimport { isFraction, isNode, isOperatorNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nimport { createUtil } from './util.js';\nimport { noBignumber, noFraction } from '../../../utils/noop.js';\nvar name = 'simplifyConstant';\nvar dependencies = ['typed', 'config', 'mathWithTransform', '?fraction', '?bignumber', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'SymbolNode'];\nexport var createSimplifyConstant = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    mathWithTransform,\n    fraction,\n    bignumber,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode\n  } = _ref;\n  var {\n    isCommutative,\n    isAssociative,\n    allChildren,\n    createMakeNodeFunction\n  } = createUtil({\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  });\n\n  function simplifyConstant(expr, options) {\n    var res = foldFraction(expr, options);\n    return isNode(res) ? res : _toNode(res);\n  }\n\n  function _eval(fnname, args, options) {\n    try {\n      return _toNumber(mathWithTransform[fnname].apply(null, args), options);\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(function (x) {\n        if (isFraction(x)) {\n          return x.valueOf();\n        }\n\n        return x;\n      });\n      return _toNumber(mathWithTransform[fnname].apply(null, args), options);\n    }\n  }\n\n  var _toNode = typed({\n    Fraction: _fractionToNode,\n    number: function number(n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n\n      return new ConstantNode(n);\n    },\n    BigNumber: function BigNumber(n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n\n      return new ConstantNode(n); // old parameters: (n.toString(), 'number')\n    },\n    Complex: function Complex(s) {\n      throw new Error('Cannot convert Complex number to Node');\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\n\n  function _exactFraction(n, options) {\n    var exactFractions = options && options.exactFractions !== false;\n\n    if (exactFractions && isFinite(n) && fraction) {\n      var f = fraction(n);\n      var fractionsLimit = options && typeof options.fractionsLimit === 'number' ? options.fractionsLimit : Infinity; // no limit by default\n\n      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {\n        return f;\n      }\n    }\n\n    return n;\n  } // Convert numbers to a preferred number type in preference order: Fraction, number, Complex\n  // BigNumbers are left alone\n\n\n  var _toNumber = typed({\n    'string, Object': function stringObject(s, options) {\n      if (config.number === 'BigNumber') {\n        if (bignumber === undefined) {\n          noBignumber();\n        }\n\n        return bignumber(s);\n      } else if (config.number === 'Fraction') {\n        if (fraction === undefined) {\n          noFraction();\n        }\n\n        return fraction(s);\n      } else {\n        var n = parseFloat(s);\n        return _exactFraction(n, options);\n      }\n    },\n    'Fraction, Object': function FractionObject(s, options) {\n      return s;\n    },\n    // we don't need options here\n    'BigNumber, Object': function BigNumberObject(s, options) {\n      return s;\n    },\n    // we don't need options here\n    'number, Object': function numberObject(s, options) {\n      return _exactFraction(s, options);\n    },\n    'Complex, Object': function ComplexObject(s, options) {\n      if (s.im !== 0) {\n        return s;\n      }\n\n      return _exactFraction(s.re, options);\n    }\n  });\n\n  function unaryMinusNode(n) {\n    return new OperatorNode('-', 'unaryMinus', [n]);\n  }\n\n  function _fractionToNode(f) {\n    var n;\n    var vn = f.s * f.n;\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\n    return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)]);\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\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\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  } // destroys the original node and returns a folded one\n\n\n  function foldFraction(node, options) {\n    switch (node.type) {\n      case 'SymbolNode':\n        return node;\n\n      case 'ConstantNode':\n        if (typeof node.value === 'number' || !isNaN(node.value)) {\n          return _toNumber(node.value, options);\n        }\n\n        return node;\n\n      case 'FunctionNode':\n        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {\n          return node;\n        }\n\n        {\n          // Process operators as OperatorNode\n          var operatorFunctions = ['add', 'multiply'];\n\n          if (operatorFunctions.indexOf(node.name) === -1) {\n            var args = node.args.map(arg => foldFraction(arg, options)); // If all args are numbers\n\n            if (!args.some(isNode)) {\n              try {\n                return _eval(node.name, args, options);\n              } catch (ignoreandcontine) {}\n            } // Convert all args to nodes and construct a symbolic function call\n\n\n            args = args.map(function (arg) {\n              return isNode(arg) ? arg : _toNode(arg);\n            });\n            return new FunctionNode(node.name, args);\n          } else {// treat as operator\n          }\n        }\n\n      /* falls through */\n\n      case 'OperatorNode':\n        {\n          var fn = node.fn.toString();\n\n          var _args;\n\n          var res;\n          var makeNode = createMakeNodeFunction(node);\n\n          if (isOperatorNode(node) && node.isUnary()) {\n            _args = [foldFraction(node.args[0], options)];\n\n            if (!isNode(_args[0])) {\n              res = _eval(fn, _args, options);\n            } else {\n              res = makeNode(_args);\n            }\n          } else if (isAssociative(node)) {\n            _args = allChildren(node);\n            _args = _args.map(arg => foldFraction(arg, options));\n\n            if (isCommutative(fn)) {\n              // commutative binary operator\n              var consts = [];\n              var vars = [];\n\n              for (var 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\n          return res;\n        }\n\n      case 'ParenthesisNode':\n        // remove the uneccessary parenthesis\n        return foldFraction(node.content, options);\n\n      case 'AccessorNode':\n      /* falls through */\n\n      case 'ArrayNode':\n      /* falls through */\n\n      case 'AssignmentNode':\n      /* falls through */\n\n      case 'BlockNode':\n      /* falls through */\n\n      case 'FunctionAssignmentNode':\n      /* falls through */\n\n      case 'IndexNode':\n      /* falls through */\n\n      case 'ObjectNode':\n      /* falls through */\n\n      case 'RangeNode':\n      /* falls through */\n\n      case 'ConditionalNode':\n      /* falls through */\n\n      default:\n        throw new Error(\"Unimplemented node type in simplifyConstant: \".concat(node.type));\n    }\n  }\n\n  return simplifyConstant;\n});","import { isFunctionNode, isNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'resolve';\nvar dependencies = ['parse', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];\nexport var createResolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    parse,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode\n  } = _ref;\n\n  /**\n   * resolve(expr, scope) replaces variable nodes with their scoped values\n   *\n   * Syntax:\n   *\n   *     simplify.resolve(expr, scope)\n   *\n   * Examples:\n   *\n   *     math.simplify.resolve('x + y', {x:1, y:2})           // Node {1 + 2}\n   *     math.simplify.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   * @param {Node} node\n   *     The expression tree to be simplified\n   * @param {Object} scope with variables to be resolved\n   */\n  function resolve(node, scope) {\n    if (!scope) {\n      return node;\n    }\n\n    if (isSymbolNode(node)) {\n      var value = scope[node.name];\n\n      if (isNode(value)) {\n        return resolve(value, scope);\n      } else if (typeof value === 'number') {\n        return parse(String(value));\n      }\n    } else if (isOperatorNode(node)) {\n      var args = node.args.map(function (arg) {\n        return resolve(arg, scope);\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));\n    } else if (isFunctionNode(node)) {\n      var _args = node.args.map(function (arg) {\n        return resolve(arg, scope);\n      });\n\n      return new FunctionNode(node.name, _args);\n    }\n\n    return node;\n  }\n\n  return resolve;\n});","import { isConstantNode, isParenthesisNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { createUtil } from './simplify/util.js';\nimport { createSimplifyCore } from './simplify/simplifyCore.js';\nimport { createSimplifyConstant } from './simplify/simplifyConstant.js';\nimport { createResolve } from './simplify/resolve.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nvar name = 'simplify';\nvar dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', '?fraction', '?bignumber', 'mathWithTransform', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nexport var createSimplify = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    parse,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    isZero,\n    equal,\n    fraction,\n    bignumber,\n    mathWithTransform,\n    ConstantNode,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode,\n    SymbolNode\n  } = _ref;\n  var simplifyConstant = createSimplifyConstant({\n    typed,\n    config,\n    mathWithTransform,\n    fraction,\n    bignumber,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode\n  });\n  var simplifyCore = createSimplifyCore({\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    ParenthesisNode\n  });\n  var resolve = createResolve({\n    parse,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode\n  });\n  var {\n    isCommutative,\n    isAssociative,\n    flatten,\n    unflattenr,\n    unflattenl,\n    createMakeNodeFunction\n  } = createUtil({\n    FunctionNode,\n    OperatorNode,\n    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   * 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   *  There is currently one option available:\n   *  - `exactFractions`: a boolean which is `true` by default.\n   *  - `fractionsLimit`: when `exactFractions` is true, a fraction will be returned\n   *    only when both numerator and denominator are smaller than `fractionsLimit`.\n   *    Default value is 10000.\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   *     derivative, parse, evaluate, rationalize\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\n  var simplify = typed('simplify', {\n    string: function string(expr) {\n      return this(parse(expr), this.rules, {}, {});\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return this(parse(expr), this.rules, scope, {});\n    },\n    'string, Object, Object': function stringObjectObject(expr, scope, options) {\n      return this(parse(expr), this.rules, scope, options);\n    },\n    'string, Array': function stringArray(expr, rules) {\n      return this(parse(expr), rules, {}, {});\n    },\n    'string, Array, Object': function stringArrayObject(expr, rules, scope) {\n      return this(parse(expr), rules, scope, {});\n    },\n    'string, Array, Object, Object': function stringArrayObjectObject(expr, rules, scope, options) {\n      return this(parse(expr), rules, scope, options);\n    },\n    'Node, Object': function NodeObject(expr, scope) {\n      return this(expr, this.rules, scope, {});\n    },\n    'Node, Object, Object': function NodeObjectObject(expr, scope, options) {\n      return this(expr, this.rules, scope, options);\n    },\n    Node: function Node(expr) {\n      return this(expr, this.rules, {}, {});\n    },\n    'Node, Array': function NodeArray(expr, rules) {\n      return this(expr, rules, {}, {});\n    },\n    'Node, Array, Object': function NodeArrayObject(expr, rules, scope) {\n      return this(expr, rules, scope, {});\n    },\n    'Node, Array, Object, Object': function NodeArrayObjectObject(expr, rules, scope, options) {\n      rules = _buildRules(rules);\n      var res = resolve(expr, scope);\n      res = removeParens(res);\n      var visited = {};\n      var str = res.toString({\n        parenthesis: 'all'\n      });\n\n      while (!visited[str]) {\n        visited[str] = true;\n        _lastsym = 0; // counter for placeholder symbols\n\n        for (var i = 0; i < rules.length; i++) {\n          if (typeof rules[i] === 'function') {\n            res = rules[i](res, options);\n          } else {\n            flatten(res);\n            res = applyRule(res, rules[i]);\n          }\n\n          unflattenl(res); // using left-heavy binary tree here since custom rule functions may expect it\n        }\n\n        str = res.toString({\n          parenthesis: 'all'\n        });\n      }\n\n      return res;\n    }\n  });\n  simplify.simplifyCore = simplifyCore;\n  simplify.resolve = resolve;\n\n  function removeParens(node) {\n    return node.transform(function (node, path, parent) {\n      return isParenthesisNode(node) ? removeParens(node.content) : node;\n    });\n  } // All constants that are allowed in rules\n\n\n  var 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 // null: false,\n    // undefined: false,\n    // version: false,\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\n  simplify.rules = [simplifyCore, // { 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  {\n    l: 'log(e)',\n    r: '1'\n  }, // temporary rules\n  {\n    l: 'n-n1',\n    r: 'n+-n1'\n  }, // temporarily replace 'subtract' so we can further flatten the 'add' operator\n  {\n    l: '-(c*v)',\n    r: '(-c) * v'\n  }, // make non-constant terms positive\n  {\n    l: '-v',\n    r: '(-1) * v'\n  }, {\n    l: 'n/n1^n2',\n    r: 'n*n1^-n2'\n  }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator\n  {\n    l: 'n/n1',\n    r: 'n*n1^-1'\n  }, // expand nested exponentiation\n  {\n    l: '(n ^ n1) ^ n2',\n    r: 'n ^ (n1 * n2)'\n  }, // collect like factors\n  {\n    l: 'n*n',\n    r: 'n^2'\n  }, {\n    l: 'n * n^n1',\n    r: 'n^(n1+1)'\n  }, {\n    l: 'n^n1 * n^n2',\n    r: 'n^(n1+n2)'\n  }, // collect like terms\n  {\n    l: 'n+n',\n    r: '2*n'\n  }, {\n    l: 'n+-n',\n    r: '0'\n  }, {\n    l: 'n1*n2 + n2',\n    r: '(n1+1)*n2'\n  }, {\n    l: 'n1*n3 + n2*n3',\n    r: '(n1+n2)*n3'\n  }, // remove parenthesis in the case of negating a quantitiy\n  {\n    l: 'n1 + -1 * (n2 + n3)',\n    r: 'n1 + -1 * n2 + -1 * n3'\n  }, simplifyConstant, {\n    l: '(-n)*n1',\n    r: '-(n*n1)'\n  }, // make factors positive (and undo 'make non-constant terms positive')\n  // ordering of constants\n  {\n    l: 'c+v',\n    r: 'v+c',\n    context: {\n      add: {\n        commutative: false\n      }\n    }\n  }, {\n    l: 'v*c',\n    r: 'c*v',\n    context: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, // undo temporary rules\n  // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant\n  {\n    l: 'n+-n1',\n    r: 'n-n1'\n  }, // undo replace 'subtract'\n  {\n    l: 'n*(n1^-1)',\n    r: 'n/n1'\n  }, // undo replace 'divide'\n  {\n    l: 'n*n1^-n2',\n    r: 'n/n1^n2'\n  }, {\n    l: 'n1^-1',\n    r: '1/n1'\n  }, {\n    l: 'n*(n1/n2)',\n    r: '(n*n1)/n2'\n  }, // '*' before '/'\n  {\n    l: 'n-(n1+n2)',\n    r: 'n-n1-n2'\n  }, // '-' before '+'\n  // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },\n  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },\n  {\n    l: '1*n',\n    r: 'n'\n  }, // this pattern can be produced by simplifyConstant\n  {\n    l: 'n1/(n2/n3)',\n    r: '(n1*n3)/n2'\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\n  function _buildRules(rules) {\n    // Array of rules to be used to simplify expressions\n    var ruleSet = [];\n\n    for (var i = 0; i < rules.length; i++) {\n      var rule = rules[i];\n      var newRule = void 0;\n      var ruleType = typeof rule;\n\n      switch (ruleType) {\n        case 'string':\n          {\n            var lr = rule.split('->');\n\n            if (lr.length === 2) {\n              rule = {\n                l: lr[0],\n                r: lr[1]\n              };\n            } else {\n              throw SyntaxError('Could not parse rule: ' + rule);\n            }\n          }\n\n        /* falls through */\n\n        case 'object':\n          newRule = {\n            l: removeParens(parse(rule.l)),\n            r: removeParens(parse(rule.r))\n          };\n\n          if (rule.context) {\n            newRule.evaluate = rule.context;\n          }\n\n          if (rule.evaluate) {\n            newRule.evaluate = parse(rule.evaluate);\n          }\n\n          if (isAssociative(newRule.l)) {\n            var makeNode = createMakeNodeFunction(newRule.l);\n\n            var expandsym = _getExpandPlaceholderSymbol();\n\n            newRule.expanded = {};\n            newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.\n            // This helps to match the newRule against nodes returned from getSplits() later on.\n\n            flatten(newRule.expanded.l);\n            unflattenr(newRule.expanded.l);\n            newRule.expanded.r = makeNode([newRule.r, expandsym]);\n          }\n\n          break;\n\n        case 'function':\n          newRule = rule;\n          break;\n\n        default:\n          throw TypeError('Unsupported type of rule: ' + ruleType);\n      } // console.log('Adding rule: ' + rules[i])\n      // console.log(newRule)\n\n\n      ruleSet.push(newRule);\n    }\n\n    return ruleSet;\n  }\n\n  var _lastsym = 0;\n\n  function _getExpandPlaceholderSymbol() {\n    return new SymbolNode('_p' + _lastsym++);\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   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.\n   */\n\n\n  var applyRule = typed('applyRule', {\n    'Node, Object': function NodeObject(node, rule) {\n      // console.log('Entering applyRule(' + node.toString() + ')')\n      // Do not clone node unless we find a match\n      var res = node; // First replace our child nodes with their simplified versions\n      // If a child could not be simplified, the assignments will have\n      // no effect since the node is returned unchanged\n\n      if (res instanceof OperatorNode || res instanceof FunctionNode) {\n        if (res.args) {\n          for (var i = 0; i < res.args.length; i++) {\n            res.args[i] = applyRule(res.args[i], rule);\n          }\n        }\n      } else if (res instanceof ParenthesisNode) {\n        if (res.content) {\n          res.content = applyRule(res.content, rule);\n        }\n      } // Try to match a rule against this node\n\n\n      var repl = rule.r;\n\n      var matches = _ruleMatch(rule.l, res)[0]; // 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\n\n      if (!matches && rule.expanded) {\n        repl = rule.expanded.r;\n        matches = _ruleMatch(rule.expanded.l, res)[0];\n      }\n\n      if (matches) {\n        // const before = res.toString({parenthesis: 'all'})\n        // Create a new node by cloning the rhs of the matched rule\n        // we keep any implicit multiplication state if relevant\n        var implicit = res.implicit;\n        res = repl.clone();\n\n        if (implicit && 'implicit' in repl) {\n          res.implicit = true;\n        } // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes\n\n\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        }); // const after = res.toString({parenthesis: 'all'})\n        // console.log('Simplified ' + before + ' to ' + after)\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\n  function getSplits(node, context) {\n    var res = [];\n    var right, rightArgs;\n    var makeNode = createMakeNodeFunction(node);\n\n    if (isCommutative(node, context)) {\n      for (var 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      rightArgs = node.args.slice(1);\n      right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);\n      res.push(makeNode([node.args[0], right]));\n    }\n\n    return res;\n  }\n  /**\n   * Returns the set union of two match-placeholders or null if there is a conflict.\n   */\n\n\n  function mergeMatch(match1, match2) {\n    var res = {\n      placeholders: {}\n    }; // Some matches may not have placeholders; this is OK\n\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    } // Placeholders with the same key must match exactly\n\n\n    for (var 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 (var _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   * 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\n\n  function combineChildMatches(list1, list2) {\n    var res = [];\n\n    if (list1.length === 0 || list2.length === 0) {\n      return res;\n    }\n\n    var merged;\n\n    for (var i1 = 0; i1 < list1.length; i1++) {\n      for (var i2 = 0; i2 < list2.length; i2++) {\n        merged = mergeMatch(list1[i1], list2[i2]);\n\n        if (merged) {\n          res.push(merged);\n        }\n      }\n    }\n\n    return res;\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\n\n  function mergeChildMatches(childMatches) {\n    if (childMatches.length === 0) {\n      return childMatches;\n    }\n\n    var sets = childMatches.reduce(combineChildMatches);\n    var uniqueSets = [];\n    var unique = {};\n\n    for (var i = 0; i < sets.length; i++) {\n      var s = JSON.stringify(sets[i]);\n\n      if (!unique[s]) {\n        unique[s] = true;\n        uniqueSets.push(sets[i]);\n      }\n    }\n\n    return uniqueSets;\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   * @return {Object} Information about the match, if it exists.\n   */\n\n\n  function _ruleMatch(rule, node, isSplit) {\n    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')\n    //    console.log('rule = ' + rule)\n    //    console.log('node = ' + node)\n    //    console.log('Entering _ruleMatch(' + rule.toString() + ', ' + node.toString() + ')')\n    var res = [{\n      placeholders: {}\n    }];\n\n    if (rule instanceof OperatorNode && node instanceof OperatorNode || 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      } // rule and node match. Search the children of rule and node.\n\n\n      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node) && node.args.length === rule.args.length || isSplit) {\n        // Expect non-associative operators to match exactly\n        var childMatches = [];\n\n        for (var i = 0; i < rule.args.length; i++) {\n          var childMatch = _ruleMatch(rule.args[i], node.args[i]);\n\n          if (childMatch.length === 0) {\n            // Child did not match, so stop searching immediately\n            return [];\n          } // The child matched, so add the information returned from the child to our result\n\n\n          childMatches.push(childMatch);\n        }\n\n        res = mergeChildMatches(childMatches);\n      } else if (node.args.length >= 2 && rule.args.length === 2) {\n        // 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        var splits = getSplits(node, rule.context);\n        var splitMatches = [];\n\n        for (var _i = 0; _i < splits.length; _i++) {\n          var matchSet = _ruleMatch(rule, splits[_i], true); // recursing at the same tree depth here\n\n\n          splitMatches = splitMatches.concat(matchSet);\n        }\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\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    } // It's a match!\n    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')\n\n\n    return res;\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\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 || 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 (var 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});","import { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createSimplifyConstant } from './simplify/simplifyConstant.js';\nimport { createSimplifyCore } from './simplify/simplifyCore.js';\nvar name = 'rationalize';\nvar dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'SymbolNode', 'ParenthesisNode'];\nexport var createRationalize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    parse,\n    simplify,\n    fraction,\n    bignumber,\n    mathWithTransform,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode,\n    ParenthesisNode\n  } = _ref;\n  var simplifyConstant = createSimplifyConstant({\n    typed,\n    config,\n    mathWithTransform,\n    fraction,\n    bignumber,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    SymbolNode\n  });\n  var simplifyCore = createSimplifyCore({\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    ConstantNode,\n    OperatorNode,\n    FunctionNode,\n    ParenthesisNode\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 na object\n   *            {Object}\n   *              {Expression Node} expression: node simplified expression\n   *              {Expression Node} numerator: simplified numerator of expression\n   *              {Expression Node | boolean} denominator: simplified denominator or false (if there is no denominator)\n   *              {Array}           variables:  variable names\n   *              {Array}           coefficients: coefficients of numerator sorted by increased exponent\n   *           {Expression Node}  node simplified expression\n   *\n   */\n\n  return typed(name, {\n    string: function string(expr) {\n      return this(parse(expr), {}, false);\n    },\n    'string, boolean': function stringBoolean(expr, detailed) {\n      return this(parse(expr), {}, detailed);\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return this(parse(expr), scope, false);\n    },\n    'string, Object, boolean': function stringObjectBoolean(expr, scope, detailed) {\n      return this(parse(expr), scope, detailed);\n    },\n    Node: function Node(expr) {\n      return this(expr, {}, false);\n    },\n    'Node, boolean': function NodeBoolean(expr, detailed) {\n      return this(expr, {}, detailed);\n    },\n    'Node, Object': function NodeObject(expr, scope) {\n      return this(expr, scope, false);\n    },\n    'Node, Object, boolean': function NodeObjectBoolean(expr, scope, detailed) {\n      var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form\n\n      var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial\n\n      var nVars = polyRet.variables.length;\n      expr = polyRet.expression;\n\n      if (nVars >= 1) {\n        // If expression in not a constant\n        expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)\n\n        var sBefore; // Previous expression\n\n        var rules;\n        var eDistrDiv = true;\n        var redoInic = false;\n        expr = simplify(expr, setRules.firstRules, {}, {\n          exactFractions: false\n        }); // Apply the initial rules, including succ div rules\n\n        var s;\n\n        while (true) {\n          // Apply alternately  successive division rules and distr.div.rules\n          rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;\n          expr = simplify(expr, rules); // until no more changes\n\n          eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules\n\n          s = expr.toString();\n\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) {\n          // Apply first rules again without succ div rules (if there are changes)\n          expr = simplify(expr, setRules.firstRulesAgain, {}, {\n            exactFractions: false\n          });\n        }\n\n        expr = simplify(expr, setRules.finalRules, {}, {\n          exactFractions: false\n        }); // Apply final rules\n      } // NVars >= 1\n\n\n      var coefficients = [];\n      var retRationalize = {};\n\n      if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {\n        // 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\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\n        if (detailed) {\n          retRationalize.numerator = expr;\n          retRationalize.denominator = null;\n        }\n      } // nVars\n\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\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\n  function polynomial(expr, scope, extended, rules) {\n    var variables = [];\n    var node = simplify(expr, rules, scope, {\n      exactFractions: false\n    }); // Resolves any variables and functions with all defined parameters\n\n    extended = !!extended;\n    var oper = '+-*' + (extended ? '/' : '');\n    recPoly(node);\n    var retFunc = {};\n    retFunc.expression = node;\n    retFunc.variables = variables;\n    return retFunc; // -------------------------------------------------------------------------------------------------------\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\n    function recPoly(node) {\n      var tp = node.type; // node type\n\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\n          for (var i = 0; i < node.args.length; i++) {\n            recPoly(node.args[i]);\n          }\n        } // type of operator\n\n      } else if (tp === 'SymbolNode') {\n        var _name = node.name; // variable name\n\n        var pos = variables.indexOf(_name);\n\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\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\n\n  function rulesRationalize() {\n    var oldRules = [simplifyCore, // sCore\n    {\n      l: 'n+n',\n      r: '2*n'\n    }, {\n      l: 'n+-n',\n      r: '0'\n    }, simplifyConstant, // sConstant\n    {\n      l: 'n*(n1^-1)',\n      r: 'n/n1'\n    }, {\n      l: 'n*n1^-n2',\n      r: 'n/n1^n2'\n    }, {\n      l: 'n1^-1',\n      r: '1/n1'\n    }, {\n      l: 'n*(n1/n2)',\n      r: '(n*n1)/n2'\n    }, {\n      l: '1*n',\n      r: 'n'\n    }];\n    var rulesFirst = [{\n      l: '(-n1)/(-n2)',\n      r: 'n1/n2'\n    }, // Unary division\n    {\n      l: '(-n1)*(-n2)',\n      r: 'n1*n2'\n    }, // Unary multiplication\n    {\n      l: 'n1--n2',\n      r: 'n1+n2'\n    }, // '--' elimination\n    {\n      l: 'n1-n2',\n      r: 'n1+(-n2)'\n    }, // Subtraction turn into add with un�ry minus\n    {\n      l: '(n1+n2)*n3',\n      r: '(n1*n3 + n2*n3)'\n    }, // Distributive 1\n    {\n      l: 'n1*(n2+n3)',\n      r: '(n1*n2+n1*n3)'\n    }, // Distributive 2\n    {\n      l: 'c1*n + c2*n',\n      r: '(c1+c2)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n + n',\n      r: '(c1+1)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n - c2*n',\n      r: '(c1-c2)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n - n',\n      r: '(c1-1)*n'\n    }, // Joining constants\n    {\n      l: 'v/c',\n      r: '(1/c)*v'\n    }, // variable/constant (new!)\n    {\n      l: 'v/-c',\n      r: '-(1/c)*v'\n    }, // variable/constant (new!)\n    {\n      l: '-v*-c',\n      r: 'c*v'\n    }, // Inversion constant and variable 1\n    {\n      l: '-v*c',\n      r: '-c*v'\n    }, // Inversion constant and variable 2\n    {\n      l: 'v*-c',\n      r: '-c*v'\n    }, // Inversion constant and variable 3\n    {\n      l: 'v*c',\n      r: 'c*v'\n    }, // Inversion constant and variable 4\n    {\n      l: '-(-n1*n2)',\n      r: '(n1*n2)'\n    }, // Unary propagation\n    {\n      l: '-(n1*n2)',\n      r: '(-n1*n2)'\n    }, // Unary propagation\n    {\n      l: '-(-n1+n2)',\n      r: '(n1-n2)'\n    }, // Unary propagation\n    {\n      l: '-(n1+n2)',\n      r: '(-n1-n2)'\n    }, // Unary propagation\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))'\n    }, // Power to Power\n    {\n      l: '-(-n1/n2)',\n      r: '(n1/n2)'\n    }, // Division and Unary\n    {\n      l: '-(n1/n2)',\n      r: '(-n1/n2)'\n    }]; // Divisao and Unary\n\n    var rulesDistrDiv = [{\n      l: '(n1/n2 + n3/n4)',\n      r: '((n1*n4 + n3*n2)/(n2*n4))'\n    }, // Sum of fractions\n    {\n      l: '(n1/n2 + n3)',\n      r: '((n1 + n3*n2)/n2)'\n    }, // Sum fraction with number 1\n    {\n      l: '(n1 + n2/n3)',\n      r: '((n1*n3 + n2)/n3)'\n    }]; // Sum fraction with number 1\n\n    var rulesSucDiv = [{\n      l: '(n1/(n2/n3))',\n      r: '((n1*n3)/n2)'\n    }, // Division simplification\n    {\n      l: '(n1/n2/n3)',\n      r: '(n1/(n2*n3))'\n    }];\n    var setRules = {}; // rules set in 4 steps.\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\n    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules\n\n    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules\n\n    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.\n    // Division simplification\n    // Second rule set.\n    // There is no aggregate expression with parentesis, but the only variable can be scattered.\n\n    setRules.finalRules = [simplifyCore, // simplify.rules[0]\n    {\n      l: 'n*-n',\n      r: '-n^2'\n    }, // Joining multiply with power 1\n    {\n      l: 'n*n',\n      r: 'n^2'\n    }, // Joining multiply with power 2\n    simplifyConstant, // simplify.rules[14] old 3rd index in oldRules\n    {\n      l: 'n*-n^n1',\n      r: '-n^(n1+1)'\n    }, // Joining multiply with power 3\n    {\n      l: 'n*n^n1',\n      r: 'n^(n1+1)'\n    }, // Joining multiply with power 4\n    {\n      l: 'n^n1*-n^n2',\n      r: '-n^(n1+n2)'\n    }, // Joining multiply with power 5\n    {\n      l: 'n^n1*n^n2',\n      r: 'n^(n1+n2)'\n    }, // Joining multiply with power 6\n    {\n      l: 'n^n1*-n',\n      r: '-n^(n1+1)'\n    }, // Joining multiply with power 7\n    {\n      l: 'n^n1*n',\n      r: 'n^(n1+1)'\n    }, // Joining multiply with power 8\n    {\n      l: 'n^n1/-n',\n      r: '-n^(n1-1)'\n    }, // Joining multiply with power 8\n    {\n      l: 'n^n1/n',\n      r: 'n^(n1-1)'\n    }, // Joining division with power 1\n    {\n      l: 'n/-n^n1',\n      r: '-n^(1-n1)'\n    }, // Joining division with power 2\n    {\n      l: 'n/n^n1',\n      r: 'n^(1-n1)'\n    }, // Joining division with power 3\n    {\n      l: 'n^n1/-n^n2',\n      r: 'n^(n1-n2)'\n    }, // Joining division with power 4\n    {\n      l: 'n^n1/n^n2',\n      r: 'n^(n1-n2)'\n    }, // Joining division with power 5\n    {\n      l: 'n1+(-n2*n3)',\n      r: 'n1-n2*n3'\n    }, // Solving useless parenthesis 1\n    {\n      l: 'v*(-c)',\n      r: '-c*v'\n    }, // Solving useless unary 2\n    {\n      l: 'n1+-n2',\n      r: 'n1-n2'\n    }, // Solving +- together (new!)\n    {\n      l: 'v*c',\n      r: 'c*v'\n    }, // inversion constant with variable\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))'\n    } // Power to Power\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\n\n  function expandPower(node, parent, indParent) {\n    var tp = node.type;\n    var internal = arguments.length > 1; // TRUE in internal calls\n\n    if (tp === 'OperatorNode' && node.isBinary()) {\n      var does = false;\n      var val;\n\n      if (node.op === '^') {\n        // First operator: Parenthesis or UnaryMinus\n        if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {\n          // Second operator: Constant\n          val = parseFloat(node.args[1].value);\n          does = val >= 2 && isInteger(val);\n        }\n      }\n\n      if (does) {\n        // Exponent >= 2\n        // Before:\n        //            operator A --> Subtree\n        // parent pow\n        //            constant\n        //\n        if (val > 2) {\n          // 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          var nEsqTopo = node.args[0];\n          var nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);\n          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);\n        } else {\n          // 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') {\n            parent.content = node;\n          } else {\n            parent.args[indParent] = node;\n          }\n        }\n      } // does\n\n    } // binary OperatorNode\n\n\n    if (tp === 'ParenthesisNode') {\n      // Recursion\n      expandPower(node.content, node, 'content');\n    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {\n      for (var 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\n\n  function polyToCanonical(node, coefficients) {\n    if (coefficients === undefined) {\n      coefficients = [];\n    } // coefficients.\n\n\n    coefficients[0] = 0; // index is the exponent\n\n    var o = {};\n    o.cte = 1;\n    o.oper = '+'; // 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\n    o.fire = '';\n    var maxExpo = 0; // maximum exponent\n\n    var varname = ''; // variable name\n\n    recurPol(node, null, o);\n    maxExpo = coefficients.length - 1;\n    var first = true;\n    var no;\n\n    for (var i = maxExpo; i >= 0; i--) {\n      if (coefficients[i] === 0) continue;\n      var n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));\n      var op = coefficients[i] < 0 ? '-' : '+';\n\n      if (i > 0) {\n        // Is not a constant without variable\n        var n2 = new SymbolNode(varname);\n\n        if (i > 1) {\n          var n3 = new ConstantNode(i);\n          n2 = new OperatorNode('^', 'pow', [n2, n3]);\n        }\n\n        if (coefficients[i] === -1 && first) {\n          n1 = new OperatorNode('-', 'unaryMinus', [n2]);\n        } else if (Math.abs(coefficients[i]) === 1) {\n          n1 = n2;\n        } else {\n          n1 = new OperatorNode('*', 'multiply', [n1, n2]);\n        }\n      }\n\n      if (first) {\n        no = n1;\n      } else if (op === '+') {\n        no = new OperatorNode('+', 'add', [no, n1]);\n      } else {\n        no = new OperatorNode('-', 'subtract', [no, n1]);\n      }\n\n      first = false;\n    } // for\n\n\n    if (first) {\n      return new ConstantNode(0);\n    } else {\n      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\n\n    function recurPol(node, noPai, o) {\n      var tp = node.type;\n\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' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {\n            throw new Error('Invalid ' + node.op + ' placing');\n          } // -,+,* : children of +,-\n\n\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {\n            throw new Error('Invalid ' + node.op + ' placing');\n          } // -,+ : first child\n\n\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {\n            throw new Error('Invalid ' + node.op + ' placing');\n          }\n        } // Has parent\n        // Firers: ^,*       Old:   ^,&,-(unary): firers\n\n\n        if (node.op === '^' || node.op === '*') {\n          o.fire = node.op;\n        }\n\n        for (var _i = 0; _i < node.args.length; _i++) {\n          // +,-: reset fire\n          if (node.fn === 'unaryMinus') o.oper = '-';\n\n          if (node.op === '+' || node.fn === 'subtract') {\n            o.fire = '';\n            o.cte = 1; // default if there is no constant\n\n            o.oper = _i === 0 ? '+' : node.op;\n          }\n\n          o.noFil = _i; // number of son\n\n          recurPol(node.args[_i], node, o);\n        } // for in children\n\n      } else if (tp === 'SymbolNode') {\n        // ***** SymbolName *****\n        if (node.name !== varname && varname !== '') {\n          throw new Error('There is more than one variable');\n        }\n\n        varname = node.name;\n\n        if (noPai === null) {\n          coefficients[1] = 1;\n          return;\n        } // ^: Symbol is First child\n\n\n        if (noPai.op === '^' && o.noFil !== 0) {\n          throw new Error('In power the variable should be the first parameter');\n        } // *: Symbol is Second child\n\n\n        if (noPai.op === '*' && o.noFil !== 1) {\n          throw new Error('In multiply the variable should be the second parameter');\n        } // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)\n\n\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        var valor = parseFloat(node.value);\n\n        if (noPai === null) {\n          coefficients[0] = valor;\n          return;\n        }\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) {\n            throw new Error('Non-integer exponent is not allowed');\n          }\n\n          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) {\n            coefficients[_i2] = 0;\n          }\n\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\n        o.cte = valor; // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.\n\n        if (o.fire === '') {\n          coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);\n        }\n      } else {\n        throw new Error('Type ' + tp + ' is not allowed');\n      }\n    } // End of recurPol\n\n  } // End of polyToCanonical\n\n});","import { factory } from '../../utils/factory.js';\nvar name = 'parser';\nvar dependencies = ['typed', 'Parser'];\nexport var createParser = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Parser\n  } = _ref;\n\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('function 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});","import { isConstantNode, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'derivative';\nvar dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nexport var createDerivative = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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  var derivative = typed('derivative', {\n    'Node, SymbolNode, Object': function NodeSymbolNodeObject(expr, variable, options) {\n      var constNodes = {};\n      constTag(constNodes, expr, variable.name);\n\n      var res = _derivative(expr, constNodes);\n\n      return options.simplify ? simplify(res) : res;\n    },\n    'Node, SymbolNode': function NodeSymbolNode(expr, variable) {\n      return this(expr, variable, {\n        simplify: true\n      });\n    },\n    'string, SymbolNode': function stringSymbolNode(expr, variable) {\n      return this(parse(expr), variable);\n    },\n    'string, SymbolNode, Object': function stringSymbolNodeObject(expr, variable, options) {\n      return this(parse(expr), variable, options);\n    },\n    'string, string': function stringString(expr, variable) {\n      return this(parse(expr), parse(variable));\n    },\n    'string, string, Object': function stringStringObject(expr, variable, options) {\n      return this(parse(expr), parse(variable), options);\n    },\n    'Node, string': function NodeString(expr, variable) {\n      return this(expr, parse(variable));\n    },\n    'Node, string, Object': function NodeStringObject(expr, variable, options) {\n      return this(expr, parse(variable), options);\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  }; // 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\n\n  var _derivTex = typed('_derivTex', {\n    'Node, SymbolNode': function NodeSymbolNode(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 NodeConstantNode(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 NodeSymbolNodeConstantNode(expr, x, order) {\n      return _derivTex(expr.toString(), x.name, order.value);\n    },\n    'string, string, number': function stringStringNumber(expr, x, order) {\n      var d;\n\n      if (order === 1) {\n        d = '{d\\\\over d' + x + '}';\n      } else {\n        d = '{d^{' + order + '}\\\\over d' + x + '^{' + order + '}}';\n      }\n\n      return d + \"\\\\left[\".concat(expr, \"\\\\right]\");\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\n\n  var constTag = typed('constTag', {\n    'Object, ConstantNode, string': function ObjectConstantNodeString(constNodes, node) {\n      constNodes[node] = true;\n      return true;\n    },\n    'Object, SymbolNode, string': function ObjectSymbolNodeString(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\n      return false;\n    },\n    'Object, ParenthesisNode, string': function ObjectParenthesisNodeString(constNodes, node, varName) {\n      return constTag(constNodes, node.content, varName);\n    },\n    'Object, FunctionAssignmentNode, string': function ObjectFunctionAssignmentNodeString(constNodes, node, varName) {\n      if (node.params.indexOf(varName) === -1) {\n        constNodes[node] = true;\n        return true;\n      }\n\n      return constTag(constNodes, node.expr, varName);\n    },\n    'Object, FunctionNode | OperatorNode, string': function ObjectFunctionNodeOperatorNodeString(constNodes, node, varName) {\n      if (node.args.length > 0) {\n        var isConst = constTag(constNodes, node.args[0], varName);\n\n        for (var 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\n      return false;\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\n  var _derivative = typed('_derivative', {\n    'ConstantNode, Object': function ConstantNodeObject(node) {\n      return createConstantNode(0);\n    },\n    'SymbolNode, Object': function SymbolNodeObject(node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      return createConstantNode(1);\n    },\n    'ParenthesisNode, Object': function ParenthesisNodeObject(node, constNodes) {\n      return new ParenthesisNode(_derivative(node.content, constNodes));\n    },\n    'FunctionAssignmentNode, Object': function FunctionAssignmentNodeObject(node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      return _derivative(node.expr, constNodes);\n    },\n    'FunctionNode, Object': function FunctionNodeObject(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      var arg0 = node.args[0];\n      var arg1;\n      var div = false; // is output a fraction?\n\n      var negative = false; // is output negative?\n\n      var funcDerivative;\n\n      switch (node.name) {\n        case 'cbrt':\n          // d/dx(cbrt(x)) = 1 / (3x^(2/3))\n          div = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);\n          break;\n\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', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);\n          } else if (node.args.length === 2) {\n            // Rearrange from nthRoot(x, a) -> x^(1/a)\n            arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]); // Is a variable?\n\n            constNodes[arg1] = constNodes[node.args[1]];\n            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes);\n          }\n\n          break;\n\n        case 'log10':\n          arg1 = createConstantNode(10);\n\n        /* fall through! */\n\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 || node.args.length === 2 && constNodes[node.args[1]] !== undefined) {\n            // d/dx(log(x, c)) = 1 / (x*ln(c))\n            funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);\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', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), constNodes);\n          }\n\n          break;\n\n        case 'pow':\n          constNodes[arg1] = constNodes[node.args[1]]; // Pass to pow operator node parser\n\n          return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes);\n\n        case 'exp':\n          // d/dx(e^x) = e^x\n          funcDerivative = new FunctionNode('exp', [arg0.clone()]);\n          break;\n\n        case 'sin':\n          // d/dx(sin(x)) = cos(x)\n          funcDerivative = new FunctionNode('cos', [arg0.clone()]);\n          break;\n\n        case 'cos':\n          // d/dx(cos(x)) = -sin(x)\n          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);\n          break;\n\n        case 'tan':\n          // d/dx(tan(x)) = sec(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'sec':\n          // d/dx(sec(x)) = sec(x)tan(x)\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);\n          break;\n\n        case 'csc':\n          // d/dx(csc(x)) = -csc(x)cot(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);\n          break;\n\n        case 'cot':\n          // d/dx(cot(x)) = -csc(x)^2\n          negative = true;\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'asin':\n          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)\n          div = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);\n          break;\n\n        case 'acos':\n          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)\n          div = true;\n          negative = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);\n          break;\n\n        case 'atan':\n          // d/dx(atan(x)) = 1 / (x^2 + 1)\n          div = true;\n          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);\n          break;\n\n        case 'asec':\n          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))\n          div = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\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', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\n        case 'acot':\n          // d/dx(acot(x)) = -1 / (x^2 + 1)\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);\n          break;\n\n        case 'sinh':\n          // d/dx(sinh(x)) = cosh(x)\n          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);\n          break;\n\n        case 'cosh':\n          // d/dx(cosh(x)) = sinh(x)\n          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);\n          break;\n\n        case 'tanh':\n          // d/dx(tanh(x)) = sech(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'sech':\n          // d/dx(sech(x)) = -sech(x)tanh(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);\n          break;\n\n        case 'csch':\n          // d/dx(csch(x)) = -csch(x)coth(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);\n          break;\n\n        case 'coth':\n          // d/dx(coth(x)) = -csch(x)^2\n          negative = true;\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'asinh':\n          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)\n          div = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);\n          break;\n\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', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);\n          break;\n\n        case 'atanh':\n          // d/dx(atanh(x)) = 1 / (1 - x^2)\n          div = true;\n          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);\n          break;\n\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', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);\n          break;\n\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', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\n        case 'acoth':\n          // d/dx(acoth(x)) = -1 / (1 - x^2)\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);\n          break;\n\n        case 'abs':\n          // d/dx(abs(x)) = abs(x)/x\n          funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);\n          break;\n\n        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)\n\n        default:\n          throw new Error('Function \"' + node.name + '\" is not supported by derivative, or a wrong number of arguments is passed');\n      }\n\n      var op, func;\n\n      if (div) {\n        op = '/';\n        func = 'divide';\n      } else {\n        op = '*';\n        func = 'multiply';\n      }\n      /* Apply chain rule to all functions:\n         F(x)  = f(g(x))\n         F'(x) = g'(x)*f'(g(x)) */\n\n\n      var chainDerivative = _derivative(arg0, constNodes);\n\n      if (negative) {\n        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);\n      }\n\n      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);\n    },\n    'OperatorNode, Object': function OperatorNodeObject(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, [_derivative(node.args[0], constNodes)]);\n        } // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)\n\n\n        if (node.isBinary()) {\n          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes), _derivative(node.args[1], constNodes)]);\n        }\n      }\n\n      if (node.op === '*') {\n        // d/dx(c*f(x)) = c*f'(x)\n        var constantTerms = node.args.filter(function (arg) {\n          return constNodes[arg] !== undefined;\n        });\n\n        if (constantTerms.length > 0) {\n          var nonConstantTerms = node.args.filter(function (arg) {\n            return constNodes[arg] === undefined;\n          });\n          var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);\n          var newArgs = constantTerms.concat(_derivative(nonConstantNode, constNodes));\n          return new OperatorNode('*', 'multiply', newArgs);\n        } // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)\n\n\n        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {\n          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {\n            return argInner === argOuter ? _derivative(argInner, constNodes) : argInner.clone();\n          }));\n        }));\n      }\n\n      if (node.op === '/' && node.isBinary()) {\n        var arg0 = node.args[0];\n        var arg1 = node.args[1]; // d/dx(f(x) / c) = f'(x) / c\n\n        if (constNodes[arg1] !== undefined) {\n          return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1]);\n        } // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)\n\n\n        if (constNodes[arg0] !== undefined) {\n          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, constNodes), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);\n        } // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2\n\n\n        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)])]);\n      }\n\n      if (node.op === '^' && node.isBinary()) {\n        var _arg = node.args[0];\n        var _arg2 = node.args[1];\n\n        if (constNodes[_arg] !== undefined) {\n          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1\n          if (isConstantNode(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {\n            return createConstantNode(0);\n          } // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)\n\n\n          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), constNodes)])]);\n        }\n\n        if (constNodes[_arg2] !== undefined) {\n          if (isConstantNode(_arg2)) {\n            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0\n            if (isZero(_arg2.value)) {\n              return createConstantNode(0);\n            } // Ignore exponent; f(x)^1 = f(x)\n\n\n            if (equal(_arg2.value, 1)) {\n              return _derivative(_arg, constNodes);\n            }\n          } // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)\n\n\n          var powMinusOne = new OperatorNode('^', 'pow', [_arg.clone(), new OperatorNode('-', 'subtract', [_arg2, createConstantNode(1)])]);\n          return new OperatorNode('*', 'multiply', [_arg2.clone(), new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), powMinusOne])]);\n        } // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]\n\n\n        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()])])])]);\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   * Ensures the number of arguments for a function are correct,\n   * and will throw an error otherwise.\n   *\n   * @param {FunctionNode} node\n   */\n\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    } // There should be an incorrect number of arguments if we reach here\n    // Change all args to constants to avoid unidentified\n    // symbol error when compiling function\n\n\n    for (var 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   * 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\n\n  function createConstantNode(value, valueType) {\n    return new ConstantNode(numeric(value, valueType || config.number));\n  }\n\n  return derivative;\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';\nvar name = 'apply';\nvar dependencies = ['typed', 'isInteger'];\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 */\n\nexport var createApplyTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n  var apply = createApply({\n    typed,\n    isInteger\n  }); // @see: comment of concat itself\n\n  return typed('apply', {\n    '...any': function any(args) {\n      // change dim from one-based to zero-based\n      var 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}, {\n  isTransformFunction: true\n});","import { isSymbolNode } from '../../../utils/is.js';\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 */\n\nexport function compileInlineExpression(expression, math, scope) {\n  // find an undefined symbol\n  var symbol = expression.filter(function (node) {\n    return isSymbolNode(node) && !(node.name in math) && !(node.name in scope);\n  })[0];\n\n  if (!symbol) {\n    throw new Error('No undefined variable found in inline expression \"' + expression + '\"');\n  } // create a test function for this equation\n\n\n  var name = symbol.name; // variable name\n\n  var subScope = Object.create(scope);\n  var eq = expression.compile();\n  return function inlineExpression(x) {\n    subScope[name] = x;\n    return eq.evaluate(subScope);\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';\nvar name = 'filter';\nvar dependencies = ['typed'];\nexport var createFilterTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var 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\n  filterTransform.rawArgs = true; // one based version of function filter\n\n  var filter = typed('filter', {\n    'Array, function': _filter,\n    'Matrix, function': function MatrixFunction(x, test) {\n      return x.create(_filter(x.toArray(), test));\n    },\n    'Array, RegExp': filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return x.create(filterRegExp(x.toArray(), test));\n    }\n  });\n  return filterTransform;\n}, {\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 */\n\nfunction _filter(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\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 {\n      // 3 or -1\n      return callback(value, [index + 1], array);\n    }\n  });\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';\nvar name = 'map';\nvar dependencies = ['typed'];\nexport var createMapTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var 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\n  mapTransform.rawArgs = true; // one-based version of map function\n\n  var map = typed('map', {\n    'Array, function': function ArrayFunction(x, callback) {\n      return _map(x, callback, x);\n    },\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.create(_map(x.valueOf(), callback, x));\n    }\n  });\n  return mapTransform;\n}, {\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 */\n\nfunction _map(array, callback, orig) {\n  // figure out what number of arguments the callback function expects\n  var 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 {\n        // 3 or -1\n        return callback(value, index, orig);\n      }\n    }\n  }\n\n  return recurse(array, []);\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';\nvar name = 'forEach';\nvar dependencies = ['typed'];\nexport var createForEachTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var 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\n  forEachTransform.rawArgs = true; // one-based version of forEach\n\n  var _forEach = typed('forEach', {\n    'Array | Matrix, function': function ArrayMatrixFunction(array, callback) {\n      // figure out what number of arguments the callback function expects\n      var args = maxArgumentCount(callback);\n\n      var recurse = function recurse(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 {\n            // 3 or -1\n            callback(value, index, array);\n          }\n        }\n      };\n\n      recurse(array.valueOf(), []); // pass Array\n    }\n  });\n\n  return forEachTransform;\n}, {\n  isTransformFunction: true\n});","import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createSubset } from '../../function/matrix/subset.js';\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix'];\nexport var createSubsetTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var subset = createSubset({\n    typed,\n    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\n  return typed('subset', {\n    '...any': function any(args) {\n      try {\n        return subset.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});","import { isArray, isBigNumber, isMatrix, isNumber, isRange } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'index';\nvar dependencies = ['Index'];\nexport var createIndexTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Index\n  } = _ref;\n\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    var args = [];\n\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i]; // change from one-based to zero based, and convert BigNumber to number\n\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) {\n          return v - 1;\n        });\n      } else if (isArray(arg) || isMatrix(arg)) {\n        arg = arg.map(function (v) {\n          return v - 1;\n        });\n      } else if (isNumber(arg)) {\n        arg--;\n      } else if (isBigNumber(arg)) {\n        arg = arg.toNumber() - 1;\n      } else if (typeof arg === 'string') {// 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    var res = new Index();\n    Index.apply(res, args);\n    return res;\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';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcatTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n  var concat = createConcat({\n    typed,\n    matrix,\n    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\n  return typed('concat', {\n    '...any': function any(args) {\n      // change last argument from one-based to zero-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\n  isTransformFunction: true\n});","import { isBigNumber, isCollection, isNumber } from '../../../utils/is.js';\n/**\n * Change last argument dim from one-based to zero-based.\n */\n\nexport function lastDimToZeroBase(args) {\n  if (args.length === 2 && isCollection(args[0])) {\n    args = args.slice();\n    var 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\n  return args;\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';\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger'];\nexport var createMaxTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    larger\n  } = _ref;\n  var max = createMax({\n    typed,\n    config,\n    numeric,\n    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\n  return typed('max', {\n    '...any': function any(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}, {\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';\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller'];\nexport var createMinTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    smaller\n  } = _ref;\n  var min = createMin({\n    typed,\n    config,\n    numeric,\n    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\n  return typed('min', {\n    '...any': function any(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}, {\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 * 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 mean\n * from one-based to zero based\n */\n\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nexport var createSumTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    add,\n    numeric\n  } = _ref;\n  var sum = createSum({\n    typed,\n    config,\n    add,\n    numeric\n  });\n  return typed(name, {\n    '...any': function any(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}, {\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';\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\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 */\n\nexport var createColumnTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  var column = createColumn({\n    typed,\n    Index,\n    matrix,\n    range\n  }); // @see: comment of column itself\n\n  return typed('column', {\n    '...any': function any(args) {\n      // change last argument from zero-based to one-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\n  isTransformFunction: true\n});","import { factory } from '../../utils/factory.js';\nimport { createRange } from '../../function/matrix/range.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];\nexport var createRangeTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq\n  } = _ref;\n  var range = createRange({\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    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\n  return typed('range', {\n    '...any': function any(args) {\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\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';\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];\nexport var createDiffTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    number,\n    bignumber\n  } = _ref;\n  var diff = createDiff({\n    typed,\n    matrix,\n    subtract,\n    number,\n    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\n  return typed(name, {\n    '...any': function any(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}, {\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';\nvar name = 'row';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\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 */\n\nexport var createRowTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  var row = createRow({\n    typed,\n    Index,\n    matrix,\n    range\n  }); // @see: comment of row itself\n\n  return typed('row', {\n    '...any': function any(args) {\n      // change last argument from zero-based to one-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\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}, {\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';\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nexport var createMeanTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide\n  } = _ref;\n  var mean = createMean({\n    typed,\n    add,\n    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\n  return typed('mean', {\n    '...any': function any(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}, {\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';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];\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 */\n\nexport var createVarianceTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    apply,\n    isNaN\n  } = _ref;\n  var variance = createVariance({\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    apply,\n    isNaN\n  });\n  return typed(name, {\n    '...any': function any(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}, {\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';\nvar name = 'std';\nvar dependencies = ['typed', 'sqrt', 'variance'];\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 */\n\nexport var createStdTransform = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    sqrt,\n    variance\n  } = _ref;\n  var std = createStd({\n    typed,\n    sqrt,\n    variance\n  });\n  return typed('std', {\n    '...any': function any(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}, {\n  isTransformFunction: true\n});","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); }\n\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createNode, createArrayNode, createBlockNode, createConstantNode, createObjectNode, createParenthesisNode, createRelationalNode, createChainClass, createReviver, createConditionalNode, createOperatorNode, createRangeNode, createFunctionAssignmentNode, createChain, createAccessorNode, createIndexNode, createAssignmentNode, createSymbolNode, createFunctionNode, createParse, createEvaluate, createHelpClass, createParserClass, createHelp, createCompile, createSimplify, createRationalize, createParser, createDerivative, createApplyTransform, createFilterTransform, createMapTransform, createForEachTransform, createSubsetTransform, createIndexTransform, createConcatTransform, createMaxTransform, createMinTransform, createSumTransform, createColumnTransform, createRangeTransform, createDiffTransform, createRowTransform, createMeanTransform, createVarianceTransform, createStdTransform } from '../factoriesAny.js';\nimport { ResultSet, Complex, Range, _false, _null, _true, BigNumber, Matrix, replacer, i, LN10, LOG10E, _NaN, pi, SQRT1_2 // eslint-disable-line camelcase\n, tau, efimovFactor, fineStructure, sackurTetrode, weakMixingAngle, Fraction, e, _Infinity, LOG2E, version, DenseMatrix, phi, typed, isInteger, isNumeric, isPositive, isNaN, equalScalar, number, boolean, complex, splitUnit, unaryPlus, apply, cube, expm1, log10, multiplyScalar, sign, square, bitNot, arg, im, not, filter, forEach, map, erf, format, oct, print, isPrime, acos, acot, acsc, asec, asin, atan, atanh, cosh, coth, csch, sech, sinh, tanh, combinations, pickRandom, randomInt, LN2, clone, hasNumericValue, typeOf, string, fraction, unaryMinus, addScalar, exp, log2, sqrt, conj, getMatrixDataType, mode, bin, acosh, acsch, asinh, cos, csc, sin, combinationsWithRep, random, SQRT2, isNegative, SparseMatrix, matrix, cbrt, gcd, mod, nthRoot, xgcd, bitAnd, bitXor, or, concat, diag, identity, ones, reshape, size, subset, zeros, hex, round, leftShift, rightLogShift, compare, compareText, smaller, larger, unequal, ImmutableDenseMatrix, FibonacciHeap, sparse, acoth, atan2, sec, add, dot, composition, isZero, abs, floor, multiply, dotMultiply, re, flatten, resize, squeeze, to, pow, dotPow, rightArithShift, compareNatural, equalText, largerEq, partitionSelect, Index, asech, tan, setDifference, setIntersect, setMultiplicity, setSize, trace, quantileSeq, gamma, bignumber, lcm, bitOr, kron, transpose, numeric, and, smallerEq, sort, min, cot, setDistinct, setPowerset, index, sum, factorial, permutations, ceil, subtract, cross, range, row, prod, equal, max, setCartesian, setSymDifference, fix, column, diff, ctranspose, deepEqual, setIsSubset, xor, divideScalar, nthRoots, lsolve, lsolveAll, Spa, setUnion, lup, slu, det, distance, stirlingS2, catalan, count, log, dotDivide, usolveAll, hypot, qr, inv, expm, divide, mean, variance, kldivergence, bellNumbers, log1p, Unit, createUnit, eigs, intersect, std, atomicMass, bohrMagneton, boltzmann, conductanceQuantum, deuteronMass, electronMass, faraday, firstRadiation, gravitationConstant, hartreeEnergy, klitzing, magneticConstant, molarMass, molarPlanckConstant, neutronMass, planckCharge, planckLength, planckTemperature, protonMass, reducedPlanckConstant, secondRadiation, stefanBoltzmann, vacuumImpedance, usolve, norm, lusolve, sqrtm, multinomial, avogadro, classicalElectronRadius, electricConstant, fermiCoupling, gravity, loschmidt, molarMassC12, nuclearMagneton, planckMass, quantumOfCirculation, speedOfLight, wienDisplacement, rotationMatrix, median, bohrRadius, elementaryCharge, inverseConductanceQuantum, molarVolume, planckTime, thomsonCrossSection, rotate, mad, coulomb, magneticFluxQuantum, rydberg, unit, gasConstant, planckConstant } from './pureFunctionsAny.generated.js';\nvar math = {}; // NOT pure!\n\nvar mathWithTransform = {}; // NOT pure!\n\nvar classes = {}; // NOT pure!\n\nexport var Node = createNode({\n  mathWithTransform\n});\nexport var ArrayNode = createArrayNode({\n  Node\n});\nexport var BlockNode = createBlockNode({\n  Node,\n  ResultSet\n});\nexport var ConstantNode = createConstantNode({\n  Node\n});\nexport var ObjectNode = createObjectNode({\n  Node\n});\nexport var ParenthesisNode = createParenthesisNode({\n  Node\n});\nexport var RelationalNode = createRelationalNode({\n  Node\n});\nexport var Chain = createChainClass({\n  math\n});\nexport var reviver = createReviver({\n  classes\n});\nexport var ConditionalNode = createConditionalNode({\n  Node\n});\nexport var OperatorNode = createOperatorNode({\n  Node\n});\nexport var RangeNode = createRangeNode({\n  Node\n});\nexport var FunctionAssignmentNode = createFunctionAssignmentNode({\n  Node,\n  typed\n});\nexport var chain = createChain({\n  Chain,\n  typed\n});\nexport var AccessorNode = createAccessorNode({\n  Node,\n  subset\n});\nexport var IndexNode = createIndexNode({\n  Node,\n  Range,\n  size\n});\nexport var AssignmentNode = createAssignmentNode({\n  matrix,\n  Node,\n  subset\n});\nexport var SymbolNode = createSymbolNode({\n  Unit,\n  Node,\n  math\n});\nexport var FunctionNode = createFunctionNode({\n  Node,\n  SymbolNode,\n  math\n});\nexport var parse = createParse({\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  config,\n  numeric,\n  typed\n});\nexport var evaluate = createEvaluate({\n  parse,\n  typed\n});\nexport var Help = createHelpClass({\n  parse\n});\nexport var Parser = createParserClass({\n  parse\n});\nexport var help = createHelp({\n  Help,\n  mathWithTransform,\n  typed\n});\nexport var compile = createCompile({\n  parse,\n  typed\n});\nexport var simplify = createSimplify({\n  bignumber,\n  fraction,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  add,\n  config,\n  divide,\n  equal,\n  isZero,\n  mathWithTransform,\n  multiply,\n  parse,\n  pow,\n  subtract,\n  typed\n});\nexport var rationalize = createRationalize({\n  bignumber,\n  fraction,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  add,\n  config,\n  divide,\n  equal,\n  isZero,\n  mathWithTransform,\n  multiply,\n  parse,\n  pow,\n  simplify,\n  subtract,\n  typed\n});\nexport var parser = createParser({\n  Parser,\n  typed\n});\nexport var derivative = createDerivative({\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  config,\n  equal,\n  isZero,\n  numeric,\n  parse,\n  simplify,\n  typed\n});\n\n_extends(math, {\n  reviver,\n  false: _false,\n  null: _null,\n  true: _true,\n  replacer,\n  i,\n  LN10,\n  LOG10E,\n  NaN: _NaN,\n  pi,\n  SQRT1_2,\n  tau,\n  efimovFactor,\n  fineStructure,\n  sackurTetrode,\n  weakMixingAngle,\n  e,\n  Infinity: _Infinity,\n  LOG2E,\n  'PI': pi,\n  version,\n  'E': e,\n  phi,\n  typed,\n  isInteger,\n  isNumeric,\n  isPositive,\n  isNaN,\n  equalScalar,\n  number,\n  boolean,\n  complex,\n  splitUnit,\n  unaryPlus,\n  apply,\n  cube,\n  expm1,\n  log10,\n  multiplyScalar,\n  sign,\n  square,\n  bitNot,\n  arg,\n  im,\n  not,\n  filter,\n  forEach,\n  map,\n  erf,\n  format,\n  oct,\n  print,\n  isPrime,\n  acos,\n  acot,\n  acsc,\n  asec,\n  asin,\n  atan,\n  atanh,\n  cosh,\n  coth,\n  csch,\n  sech,\n  sinh,\n  tanh,\n  chain,\n  combinations,\n  pickRandom,\n  randomInt,\n  LN2,\n  clone,\n  hasNumericValue,\n  typeOf,\n  string,\n  fraction,\n  unaryMinus,\n  addScalar,\n  exp,\n  log2,\n  sqrt,\n  conj,\n  getMatrixDataType,\n  mode,\n  bin,\n  acosh,\n  acsch,\n  asinh,\n  cos,\n  csc,\n  sin,\n  combinationsWithRep,\n  random,\n  SQRT2,\n  isNegative,\n  matrix,\n  cbrt,\n  gcd,\n  mod,\n  nthRoot,\n  xgcd,\n  bitAnd,\n  bitXor,\n  or,\n  concat,\n  diag,\n  identity,\n  ones,\n  reshape,\n  size,\n  subset,\n  zeros,\n  hex,\n  round,\n  leftShift,\n  rightLogShift,\n  compare,\n  compareText,\n  smaller,\n  larger,\n  unequal,\n  sparse,\n  acoth,\n  atan2,\n  sec,\n  add,\n  dot,\n  composition,\n  isZero,\n  abs,\n  floor,\n  multiply,\n  dotMultiply,\n  re,\n  flatten,\n  resize,\n  squeeze,\n  to,\n  pow,\n  dotPow,\n  rightArithShift,\n  compareNatural,\n  equalText,\n  largerEq,\n  partitionSelect,\n  asech,\n  tan,\n  setDifference,\n  setIntersect,\n  setMultiplicity,\n  setSize,\n  trace,\n  quantileSeq,\n  gamma,\n  bignumber,\n  lcm,\n  bitOr,\n  kron,\n  transpose,\n  numeric,\n  and,\n  smallerEq,\n  sort,\n  min,\n  cot,\n  setDistinct,\n  setPowerset,\n  index,\n  sum,\n  factorial,\n  permutations,\n  ceil,\n  subtract,\n  cross,\n  range,\n  row,\n  prod,\n  equal,\n  max,\n  setCartesian,\n  setSymDifference,\n  fix,\n  column,\n  diff,\n  ctranspose,\n  deepEqual,\n  setIsSubset,\n  xor,\n  divideScalar,\n  nthRoots,\n  lsolve,\n  lsolveAll,\n  setUnion,\n  lup,\n  slu,\n  det,\n  distance,\n  stirlingS2,\n  catalan,\n  count,\n  log,\n  dotDivide,\n  usolveAll,\n  hypot,\n  qr,\n  inv,\n  expm,\n  divide,\n  mean,\n  variance,\n  kldivergence,\n  bellNumbers,\n  log1p,\n  createUnit,\n  eigs,\n  intersect,\n  std,\n  atomicMass,\n  bohrMagneton,\n  boltzmann,\n  conductanceQuantum,\n  deuteronMass,\n  electronMass,\n  faraday,\n  firstRadiation,\n  gravitationConstant,\n  hartreeEnergy,\n  klitzing,\n  magneticConstant,\n  molarMass,\n  molarPlanckConstant,\n  neutronMass,\n  planckCharge,\n  planckLength,\n  planckTemperature,\n  protonMass,\n  reducedPlanckConstant,\n  secondRadiation,\n  stefanBoltzmann,\n  vacuumImpedance,\n  usolve,\n  norm,\n  lusolve,\n  sqrtm,\n  multinomial,\n  avogadro,\n  classicalElectronRadius,\n  electricConstant,\n  fermiCoupling,\n  gravity,\n  loschmidt,\n  molarMassC12,\n  nuclearMagneton,\n  planckMass,\n  quantumOfCirculation,\n  speedOfLight,\n  wienDisplacement,\n  rotationMatrix,\n  median,\n  bohrRadius,\n  elementaryCharge,\n  inverseConductanceQuantum,\n  molarVolume,\n  planckTime,\n  thomsonCrossSection,\n  rotate,\n  parse,\n  evaluate,\n  mad,\n  coulomb,\n  magneticFluxQuantum,\n  rydberg,\n  unit,\n  help,\n  gasConstant,\n  compile,\n  simplify,\n  rationalize,\n  parser,\n  planckConstant,\n  derivative,\n  config\n});\n\n_extends(mathWithTransform, math, {\n  apply: createApplyTransform({\n    isInteger,\n    typed\n  }),\n  filter: createFilterTransform({\n    typed\n  }),\n  map: createMapTransform({\n    typed\n  }),\n  forEach: createForEachTransform({\n    typed\n  }),\n  subset: createSubsetTransform({\n    matrix,\n    typed\n  }),\n  index: createIndexTransform({\n    Index\n  }),\n  concat: createConcatTransform({\n    isInteger,\n    matrix,\n    typed\n  }),\n  max: createMaxTransform({\n    config,\n    larger,\n    numeric,\n    typed\n  }),\n  min: createMinTransform({\n    config,\n    numeric,\n    smaller,\n    typed\n  }),\n  sum: createSumTransform({\n    add,\n    config,\n    numeric,\n    typed\n  }),\n  column: createColumnTransform({\n    Index,\n    matrix,\n    range,\n    typed\n  }),\n  range: createRangeTransform({\n    bignumber,\n    matrix,\n    config,\n    larger,\n    largerEq,\n    smaller,\n    smallerEq,\n    typed\n  }),\n  diff: createDiffTransform({\n    bignumber,\n    matrix,\n    number,\n    subtract,\n    typed\n  }),\n  row: createRowTransform({\n    Index,\n    matrix,\n    range,\n    typed\n  }),\n  mean: createMeanTransform({\n    add,\n    divide,\n    typed\n  }),\n  variance: createVarianceTransform({\n    add,\n    apply,\n    divide,\n    isNaN,\n    multiply,\n    subtract,\n    typed\n  }),\n  std: createStdTransform({\n    sqrt,\n    typed,\n    variance\n  })\n});\n\n_extends(classes, {\n  ResultSet,\n  Complex,\n  Range,\n  Node,\n  ArrayNode,\n  BlockNode,\n  ConstantNode,\n  ObjectNode,\n  ParenthesisNode,\n  RelationalNode,\n  Chain,\n  BigNumber,\n  Matrix,\n  ConditionalNode,\n  OperatorNode,\n  Fraction,\n  RangeNode,\n  DenseMatrix,\n  FunctionAssignmentNode,\n  SparseMatrix,\n  ImmutableDenseMatrix,\n  FibonacciHeap,\n  AccessorNode,\n  IndexNode,\n  Index,\n  AssignmentNode,\n  Spa,\n  Unit,\n  SymbolNode,\n  FunctionNode,\n  Help,\n  Parser\n});\n\nChain.createProxy(math);\nexport { embeddedDocs as docs } from '../expression/embeddedDocs/embeddedDocs.js';","import { factory } from '../../utils/factory.js';\nvar name = 'ResultSet';\nvar dependencies = [];\nexport var 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   * Attach type information\n   */\n\n\n  ResultSet.prototype.type = 'ResultSet';\n  ResultSet.prototype.isResultSet = true;\n  /**\n   * Returns the array with results hold by this ResultSet\n   * @memberof ResultSet\n   * @returns {Array} entries\n   */\n\n  ResultSet.prototype.valueOf = function () {\n    return this.entries;\n  };\n  /**\n   * Returns the stringified results of the ResultSet\n   * @memberof ResultSet\n   * @returns {string} string\n   */\n\n\n  ResultSet.prototype.toString = function () {\n    return '[' + this.entries.join(', ') + ']';\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\n\n  ResultSet.prototype.toJSON = function () {\n    return {\n      mathjs: 'ResultSet',\n      entries: this.entries\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\n\n  ResultSet.fromJSON = function (json) {\n    return new ResultSet(json.entries);\n  };\n\n  return ResultSet;\n}, {\n  isClass: true\n});","import Complex from 'complex.js';\nimport { format } from '../../utils/number.js';\nimport { isNumber, isUnit } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Complex';\nvar dependencies = [];\nexport var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Complex.prototype.type = 'Complex';\n  Complex.prototype.isComplex = true;\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\n  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\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\n\n  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\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\n\n  Complex.prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = format(this.re, options);\n    var strIm = format(this.im, options); // round either re or im when smaller than the configured precision\n\n    var precision = isNumber(options) ? options : options ? options.precision : null;\n\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\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\n    return str;\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\n\n  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\n\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\n      case 2:\n        {\n          var r = arguments[0];\n          var phi = arguments[1];\n\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({\n                r: r,\n                phi: phi\n              });\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   * 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\n  Complex.fromJSON = function (json) {\n    return new Complex(json);\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\n\n  Complex.compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n\n    if (a.re < b.re) {\n      return -1;\n    }\n\n    if (a.im > b.im) {\n      return 1;\n    }\n\n    if (a.im < b.im) {\n      return -1;\n    }\n\n    return 0;\n  };\n\n  return Complex;\n}, {\n  isClass: true\n});","import { isBigNumber } from '../../utils/is.js';\nimport { format, sign } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Range';\nvar dependencies = [];\nexport var 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    var hasStart = start !== null && start !== undefined;\n    var hasEnd = end !== null && end !== undefined;\n    var 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\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\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   * Attach type information\n   */\n\n\n  Range.prototype.type = 'Range';\n  Range.prototype.isRange = true;\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\n  Range.parse = function (str) {\n    if (typeof str !== 'string') {\n      return null;\n    }\n\n    var args = str.split(':');\n    var nums = args.map(function (arg) {\n      return parseFloat(arg);\n    });\n    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\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\n      case 3:\n        return new Range(nums[0], nums[2], nums[1]);\n\n      default:\n        return null;\n    }\n  };\n  /**\n   * Create a clone of the range\n   * @return {Range} clone\n   */\n\n\n  Range.prototype.clone = function () {\n    return new Range(this.start, this.end, this.step);\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\n\n  Range.prototype.size = function () {\n    var len = 0;\n    var start = this.start;\n    var step = this.step;\n    var end = this.end;\n    var 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\n    return [len];\n  };\n  /**\n   * Calculate the minimum value in the range\n   * @memberof Range\n   * @return {number | undefined} min\n   */\n\n\n  Range.prototype.min = function () {\n    var 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   * Calculate the maximum value in the range\n   * @memberof Range\n   * @return {number | undefined} max\n   */\n\n\n  Range.prototype.max = function () {\n    var 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   * 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\n\n  Range.prototype.forEach = function (callback) {\n    var x = this.start;\n    var step = this.step;\n    var end = this.end;\n    var 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   * 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\n\n  Range.prototype.map = function (callback) {\n    var array = [];\n    this.forEach(function (value, index, obj) {\n      array[index[0]] = callback(value, index, obj);\n    });\n    return array;\n  };\n  /**\n   * Create an Array with a copy of the Ranges data\n   * @memberof Range\n   * @returns {Array} array\n   */\n\n\n  Range.prototype.toArray = function () {\n    var array = [];\n    this.forEach(function (value, index) {\n      array[index[0]] = value;\n    });\n    return array;\n  };\n  /**\n   * Get the primitive value of the Range, a one dimensional array\n   * @memberof Range\n   * @returns {Array} array\n   */\n\n\n  Range.prototype.valueOf = function () {\n    // TODO: implement a caching mechanism for range.valueOf()\n    return this.toArray();\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\n\n  Range.prototype.format = function (options) {\n    var str = format(this.start, options);\n\n    if (this.step !== 1) {\n      str += ':' + format(this.step, options);\n    }\n\n    str += ':' + format(this.end, options);\n    return str;\n  };\n  /**\n   * Get a string representation of the range.\n   * @memberof Range\n   * @returns {string}\n   */\n\n\n  Range.prototype.toString = function () {\n    return this.format();\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\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   * 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\n\n  Range.fromJSON = function (json) {\n    return new Range(json.start, json.end, json.step);\n  };\n\n  return Range;\n}, {\n  isClass: true\n});","import { memoize } from '../function.js';\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns e\n */\n\nexport var createBigNumberE = memoize(function (BigNumber) {\n  return new BigNumber(1).exp();\n}, {\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 */\n\nexport var createBigNumberPhi = memoize(function (BigNumber) {\n  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, {\n  hasher\n});\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\n\nexport var createBigNumberPi = memoize(function (BigNumber) {\n  return BigNumber.acos(-1);\n}, {\n  hasher\n});\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\n\nexport var createBigNumberTau = memoize(function (BigNumber) {\n  return createBigNumberPi(BigNumber).times(2);\n}, {\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 */\n\nfunction hasher(args) {\n  return args[0].precision;\n}","export var pi = Math.PI;\nexport var tau = 2 * Math.PI;\nexport var e = Math.E;\nexport var phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision","import { factory } from './utils/factory.js';\nimport { version } from './version.js';\nimport { createBigNumberE, createBigNumberPhi, createBigNumberPi, createBigNumberTau } from './utils/bignumber/constants.js';\nimport { pi, tau, e, phi } from './plain/number/index.js';\nexport var createTrue = /* #__PURE__ */factory('true', [], () => true);\nexport var createFalse = /* #__PURE__ */factory('false', [], () => false);\nexport var createNull = /* #__PURE__ */factory('null', [], () => null);\nexport var createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], (_ref) => {\n  var {\n    config,\n    BigNumber\n  } = _ref;\n  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;\n});\nexport var createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], (_ref2) => {\n  var {\n    config,\n    BigNumber\n  } = _ref2;\n  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;\n});\nexport var createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], (_ref3) => {\n  var {\n    config,\n    BigNumber\n  } = _ref3;\n  return config.number === 'BigNumber' ? createBigNumberPi(BigNumber) : pi;\n});\nexport var createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], (_ref4) => {\n  var {\n    config,\n    BigNumber\n  } = _ref4;\n  return config.number === 'BigNumber' ? createBigNumberTau(BigNumber) : tau;\n});\nexport var createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], (_ref5) => {\n  var {\n    config,\n    BigNumber\n  } = _ref5;\n  return config.number === 'BigNumber' ? createBigNumberE(BigNumber) : e;\n}); // golden ratio, (1+sqrt(5))/2\n\nexport var createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], (_ref6) => {\n  var {\n    config,\n    BigNumber\n  } = _ref6;\n  return config.number === 'BigNumber' ? createBigNumberPhi(BigNumber) : phi;\n});\nexport var createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], (_ref7) => {\n  var {\n    config,\n    BigNumber\n  } = _ref7;\n  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;\n});\nexport var createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], (_ref8) => {\n  var {\n    config,\n    BigNumber\n  } = _ref8;\n  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;\n});\nexport var createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], (_ref9) => {\n  var {\n    config,\n    BigNumber\n  } = _ref9;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;\n});\nexport var createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], (_ref10) => {\n  var {\n    config,\n    BigNumber\n  } = _ref10;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;\n});\nexport var createSQRT1_2 = /* #__PURE__ */recreateFactory( // eslint-disable-line camelcase\n'SQRT1_2', ['config', '?BigNumber'], (_ref11) => {\n  var {\n    config,\n    BigNumber\n  } = _ref11;\n  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;\n});\nexport var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], (_ref12) => {\n  var {\n    config,\n    BigNumber\n  } = _ref12;\n  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;\n});\nexport var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], (_ref13) => {\n  var {\n    Complex\n  } = _ref13;\n  return Complex.I;\n}); // for backward compatibility with v5\n\nexport var createUppercasePi = /* #__PURE__ */factory('PI', ['pi'], (_ref14) => {\n  var {\n    pi\n  } = _ref14;\n  return pi;\n});\nexport var createUppercaseE = /* #__PURE__ */factory('E', ['e'], (_ref15) => {\n  var {\n    e\n  } = _ref15;\n  return e;\n});\nexport var createVersion = /* #__PURE__ */factory('version', [], () => version); // 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?\n\nfunction recreateFactory(name, dependencies, create) {\n  return factory(name, dependencies, create, {\n    recreateOnConfigChange: true\n  });\n}","export var version = '9.3.0'; // Note: This file is automatically generated when building math.js.\n// Changes made in this file will be overwritten.","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nexport var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    on,\n    config\n  } = _ref;\n  var EUCLID = 9; // Use euclidian division for mod calculation\n\n  var BigNumber = Decimal.clone({\n    precision: config.precision,\n    modulo: EUCLID\n  });\n  /**\n   * Attach type information\n   */\n\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\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\n  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\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\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({\n          precision: curr.precision\n        });\n      }\n    });\n  }\n\n  return BigNumber;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Matrix';\nvar dependencies = [];\nexport var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * @constructor Matrix\n   *\n   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n   * array. A matrix can be constructed as:\n   *\n   *     let matrix = math.matrix(data)\n   *\n   * Matrix contains the functions to resize, get and set values, get the size,\n   * clone the matrix and to convert the matrix to a vector, array, or scalar.\n   * Furthermore, one can iterate over the matrix using map and forEach.\n   * The internal Array of the Matrix can be accessed using the function valueOf.\n   *\n   * Example usage:\n   *\n   *     let matrix = math.matrix([[1, 2], [3, 4]])\n   *     matix.size()              // [2, 2]\n   *     matrix.resize([3, 2], 5)\n   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]\n   *     matrix.subset([1,2])       // 3 (indexes are zero-based)\n   *\n   */\n  function Matrix() {\n    if (!(this instanceof Matrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\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\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   * 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\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   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n\n\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\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\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   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n\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   * 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\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   * 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\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   * 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\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   * Create a clone of the matrix\n   * @return {Matrix} clone\n   */\n\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   * Retrieve the size of the matrix.\n   * @returns {number[]} size\n   */\n\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   * 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\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   * 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\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   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\n   */\n\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   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\n   */\n\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   * 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\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   * Get a string representation of the matrix\n   * @returns {string} str\n   */\n\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}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nvar name = 'replacer';\nvar dependencies = [];\nexport var 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});","import { factory } from '../../utils/factory.js'; // Source: https://en.wikipedia.org/wiki/Physical_constant\n// Universal constants\n\nexport var createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');\nexport var createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');\nexport var createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');\nexport var createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s'); // Electromagnetic constants\n\nexport var createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');\nexport var createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');\nexport var createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');\nexport var createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2');\nexport var createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');\nexport var createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');\nexport var createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');\nexport var createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');\nexport var createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');\nexport var createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');\nexport var createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');\nexport var createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed\n// Atomic and nuclear constants\n\nexport var createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');\nexport var createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');\nexport var createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');\nexport var createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');\nexport var createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);\nexport var createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');\nexport var createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');\nexport var createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');\nexport var createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');\nexport var createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');\nexport var createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');\nexport var createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');\nexport var createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);\nexport var createEfimovFactor = numberFactory('efimovFactor', 22.7); // Physico-chemical constants\n\nexport var createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');\nexport var createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');\nexport var createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');\nexport var createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');\nexport 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\n\nexport var createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');\nexport var createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');\nexport var createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');\nexport var createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');\nexport var createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);\nexport var createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');\nexport var createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');\nexport var createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K'); // Adopted values\n\nexport var createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');\nexport var createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');\nexport var createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2'); // atm is defined in Unit.js\n// Natural units\n\nexport var createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');\nexport var createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');\nexport var createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');\nexport var createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');\nexport var createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K'); // 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\n\nfunction unitFactory(name, valueStr, unitStr) {\n  var dependencies = ['config', 'Unit', 'BigNumber'];\n  return factory(name, dependencies, (_ref) => {\n    var {\n      config,\n      Unit,\n      BigNumber\n    } = _ref;\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    var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);\n    var unit = new Unit(value, unitStr);\n    unit.fixPrefix = true;\n    return unit;\n  });\n} // helper function to create a factory function which creates a numeric constant,\n// either a number or BigNumber depending on the configuration\n\n\nfunction numberFactory(name, value) {\n  var dependencies = ['config', 'BigNumber'];\n  return factory(name, dependencies, (_ref2) => {\n    var {\n      config,\n      BigNumber\n    } = _ref2;\n    return config.number === 'BigNumber' ? new BigNumber(value) : value;\n  });\n}","import Fraction from 'fraction.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Fraction';\nvar dependencies = [];\nexport var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Fraction.prototype.type = 'Fraction';\n  Fraction.prototype.isFraction = true;\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\n  Fraction.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: this.s * this.n,\n      d: this.d\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\n\n  Fraction.fromJSON = function (json) {\n    return new Fraction(json);\n  };\n\n  return Fraction;\n}, {\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';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    Matrix\n  } = _ref;\n\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   */\n  function DenseMatrix(data, datatype) {\n    if (!(this instanceof DenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\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; // verify the dimensions of the array\n\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); // get the dimensions of the array\n\n      this._size = arraySize(this._data); // verify the dimensions of the array, TODO: compute size while processing array\n\n      validate(this._data, this._size); // data type unknown\n\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   * Create a new DenseMatrix\n   */\n\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n  /**\n   * Attach type information\n   */\n\n\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\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\n  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data, typeOf);\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\n\n  DenseMatrix.prototype.storage = function () {\n    return 'dense';\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\n\n  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n\n\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\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\n\n  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n      // intentional fall through\n\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   * Get a single element from the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n\n\n  DenseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check index\n\n\n    for (var x = 0; x < index.length; x++) {\n      validateIndex(index[x], this._size[x]);\n    }\n\n    var data = this._data;\n\n    for (var i = 0, ii = index.length; i < ii; i++) {\n      var indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n\n    return data;\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\n\n  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length < this._size.length) {\n      throw new DimensionError(index.length, this._size.length, '<');\n    }\n\n    var i, ii, indexI; // enlarge matrix when needed\n\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n\n    _fit(this, size, defaultValue); // traverse over the dimensions\n\n\n    var data = this._data;\n\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    } // set new value\n\n\n    indexI = index[index.length - 1];\n    validateIndex(indexI, data.length);\n    data[indexI] = value;\n    return this;\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\n\n  function _get(matrix, index) {\n    if (!isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n\n    var isScalar = index.isScalar();\n\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length);\n      } // validate if any of the ranges in the index is out of range\n\n\n      var min = index.min();\n      var max = index.max();\n\n      for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n        validateIndex(min[i], matrix._size[i]);\n        validateIndex(max[i], matrix._size[i]);\n      } // retrieve submatrix\n      // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n\n\n      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\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\n\n  function _getSubmatrix(data, index, dims, dim) {\n    var last = dim === dims - 1;\n    var 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        var child = data[i];\n        return _getSubmatrix(child, index, dims, dim + 1);\n      }).valueOf();\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\n\n  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    } // get index size and check whether the index contains a single value\n\n\n    var iSize = index.size();\n    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n    var sSize;\n\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      // 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      // 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        var i = 0;\n        var outer = 0;\n\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        } // unsqueeze both outer and inner dimensions\n\n\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      } // check whether the size of the submatrix matches the index size\n\n\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      } // enlarge matrix when needed\n\n\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n\n      _fit(matrix, size, defaultValue); // insert the sub matrix\n\n\n      var dims = iSize.length;\n      var dim = 0;\n\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n    }\n\n    return matrix;\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\n\n  function _setSubmatrix(data, index, submatrix, dims, dim) {\n    var last = dim === dims - 1;\n    var 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\n        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\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\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    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n\n\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    }); // matrix to resize\n\n    var m = copy ? this.clone() : this; // resize matrix\n\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      var v = matrix._data; // go deep\n\n      while (isArray(v)) {\n        v = v[0];\n      }\n\n      return v;\n    } // resize matrix\n\n\n    matrix._size = size.slice(0); // copy the array\n\n    matrix._data = resize(matrix._data, matrix._size, defaultValue); // return matrix\n\n    return matrix;\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\n\n  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = reshape(m._data, size);\n\n    var currentLength = m._size.reduce((length, size) => length * size);\n\n    m._size = processSizesWildcard(size, currentLength);\n    return m;\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\n\n  function _fit(matrix, size, defaultValue) {\n    var // copy the array\n    newSize = matrix._size.slice(0);\n\n    var changed = false; // add dimensions when needed\n\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    } // enlarge size when needed\n\n\n    for (var i = 0, ii = size.length; i < ii; i++) {\n      if (size[i] > newSize[i]) {\n        newSize[i] = size[i];\n        changed = true;\n      }\n    }\n\n    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n\n\n  DenseMatrix.prototype.clone = function () {\n    var m = new DenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n\n\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\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\n\n  DenseMatrix.prototype.map = function (callback) {\n    // matrix instance\n    var me = this;\n\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        return value.map(function (child, i) {\n          return recurse(child, index.concat(i));\n        });\n      } else {\n        return callback(value, index, me);\n      }\n    }; // determine the new datatype when the original matrix has datatype defined\n    // TODO: should be done in matrix constructor instead\n\n\n    var data = recurse(this._data, []);\n    var datatype = this._datatype !== undefined ? getArrayDataType(data, typeOf) : undefined;\n    return new DenseMatrix(data, datatype);\n  };\n  /**\n   * 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\n\n  DenseMatrix.prototype.forEach = function (callback) {\n    // matrix instance\n    var me = this;\n\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        value.forEach(function (child, i) {\n          recurse(child, index.concat(i));\n        });\n      } else {\n        callback(value, index, me);\n      }\n    };\n\n    recurse(this._data, []);\n  };\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n\n\n  DenseMatrix.prototype.toArray = function () {\n    return clone(this._data);\n  };\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n\n\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\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\n\n  DenseMatrix.prototype.format = function (options) {\n    return format(this._data, options);\n  };\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n\n\n  DenseMatrix.prototype.toString = function () {\n    return format(this._data);\n  };\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\n   */\n\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   * 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\n\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // number diagonal values\n\n    var n = Math.min(rows - kSub, columns - kSuper); // x is a matrix get diagonal from matrix\n\n    var data = []; // loop rows\n\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    } // create DenseMatrix\n\n\n    return new DenseMatrix({\n      data: data,\n      size: [n],\n      datatype: this._datatype\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\n\n  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // map size & validate\n\n\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      } // validate arguments\n\n\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n\n      return s;\n    }); // validate k if any\n\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows and columns\n\n    var rows = size[0];\n    var columns = size[1]; // number of non-zero items\n\n    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n    var _value; // check value\n\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size(); // validate matrix\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    } // discover default value if needed\n\n\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero\n      : 0;\n    } // empty array\n\n\n    var data = []; // check we need to resize array\n\n    if (size.length > 0) {\n      // resize array\n      data = resize(data, size, defaultValue); // fill diagonal\n\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    } // create DenseMatrix\n\n\n    return new DenseMatrix({\n      data: data,\n      size: [rows, columns]\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\n\n  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\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\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    } // check dimensions\n\n\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    } // validate index\n\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]); // swap rows\n\n    DenseMatrix._swapRows(i, j, this._data); // return current instance\n\n\n    return this;\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\n\n  DenseMatrix._swapRows = function (i, j, data) {\n    // swap values i <-> j\n    var vi = data[i];\n    data[i] = data[j];\n    data[j] = vi;\n  };\n  /**\n   * 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\n\n  function preprocess(data) {\n    for (var i = 0, ii = data.length; i < ii; i++) {\n      var elem = data[i];\n\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}, {\n  isClass: true\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 */\nimport { 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';\nimport typedFunction from 'typed-function';\nimport { digits } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js'; // returns a new instance of typed-function\n\nvar _createTyped2 = function _createTyped() {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped2 = typedFunction.create;\n  return typedFunction;\n};\n\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\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 */\n\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n  var {\n    BigNumber,\n    Complex,\n    DenseMatrix,\n    Fraction\n  } = _ref;\n\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n  // get a new instance of typed-function\n  var typed = _createTyped2(); // 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\n\n  typed.types = [{\n    name: 'number',\n    test: isNumber\n  }, {\n    name: 'Complex',\n    test: isComplex\n  }, {\n    name: 'BigNumber',\n    test: isBigNumber\n  }, {\n    name: 'Fraction',\n    test: isFraction\n  }, {\n    name: 'Unit',\n    test: isUnit\n  }, {\n    name: 'string',\n    test: isString\n  }, {\n    name: 'Chain',\n    test: isChain\n  }, {\n    name: 'Array',\n    test: isArray\n  }, {\n    name: 'Matrix',\n    test: isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: isSparseMatrix\n  }, {\n    name: 'Range',\n    test: isRange\n  }, {\n    name: 'Index',\n    test: isIndex\n  }, {\n    name: 'boolean',\n    test: isBoolean\n  }, {\n    name: 'ResultSet',\n    test: isResultSet\n  }, {\n    name: 'Help',\n    test: isHelp\n  }, {\n    name: 'function',\n    test: isFunction\n  }, {\n    name: 'Date',\n    test: isDate\n  }, {\n    name: 'RegExp',\n    test: isRegExp\n  }, {\n    name: 'null',\n    test: isNull\n  }, {\n    name: 'undefined',\n    test: isUndefined\n  }, {\n    name: 'AccessorNode',\n    test: isAccessorNode\n  }, {\n    name: 'ArrayNode',\n    test: isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: isConditionalNode\n  }, {\n    name: 'ConstantNode',\n    test: isConstantNode\n  }, {\n    name: 'FunctionNode',\n    test: isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: isFunctionAssignmentNode\n  }, {\n    name: 'IndexNode',\n    test: isIndexNode\n  }, {\n    name: 'Node',\n    test: isNode\n  }, {\n    name: 'ObjectNode',\n    test: isObjectNode\n  }, {\n    name: 'OperatorNode',\n    test: isOperatorNode\n  }, {\n    name: 'ParenthesisNode',\n    test: isParenthesisNode\n  }, {\n    name: 'RangeNode',\n    test: isRangeNode\n  }, {\n    name: 'SymbolNode',\n    test: isSymbolNode\n  }, {\n    name: 'Object',\n    test: isObject\n  } // order 'Object' last, it matches on other classes too\n  ];\n  typed.conversions = [{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      } // note: conversion from number to BigNumber can fail if x has >15 digits\n\n\n      if (digits(x) > 15) {\n        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n      }\n\n      return new BigNumber(x);\n    }\n  }, {\n    from: 'number',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n\n      return new Complex(x, 0);\n    }\n  }, {\n    from: 'number',\n    to: 'string',\n    convert: function convert(x) {\n      return x + '';\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(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 convert(x) {\n      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n    }\n  }, {\n    from: 'Fraction',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n\n      return new Complex(x.valueOf(), 0);\n    }\n  }, {\n    from: 'number',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n\n      var f = new Fraction(x);\n\n      if (f.valueOf() !== x) {\n        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n      }\n\n      return f;\n    }\n  }, {\n    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n    //  from: 'Fraction',\n    //  to: 'number',\n    //  convert: function (x) {\n    //    return x.valueOf()\n    //  }\n    // }, {\n    from: 'string',\n    to: 'number',\n    convert: function convert(x) {\n      var n = Number(x);\n\n      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\n      }\n\n      return n;\n    }\n  }, {\n    from: 'string',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      try {\n        return new BigNumber(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n\n      try {\n        return new Fraction(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Fraction');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n\n      try {\n        return new Complex(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Complex');\n      }\n    }\n  }, {\n    from: 'boolean',\n    to: 'number',\n    convert: function convert(x) {\n      return +x;\n    }\n  }, {\n    from: 'boolean',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      return new BigNumber(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n\n      return new Fraction(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'string',\n    convert: function convert(x) {\n      return String(x);\n    }\n  }, {\n    from: 'Array',\n    to: 'Matrix',\n    convert: function convert(array) {\n      if (!DenseMatrix) {\n        throwNoMatrix();\n      }\n\n      return new DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }];\n  return typed;\n});\n\nfunction throwNoBignumber(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\n\nfunction throwNoComplex(x) {\n  throw new Error(\"Cannot convert value \".concat(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 \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","import { deepMap } from '../../utils/collection.js';\nimport { isInteger as isIntegerNumber } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isInteger';\nvar dependencies = ['typed'];\nexport var createIsInteger = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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,\n    // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n    BigNumber: function BigNumber(x) {\n      return x.isInt();\n    },\n    Fraction: function Fraction(x) {\n      return x.d === 1 && isFinite(x.n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isNumeric';\nvar dependencies = ['typed'];\nexport var createIsNumeric = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 numberBigNumberFractionBoolean() {\n      return true;\n    },\n    'Complex | Unit | string | null | undefined | Node': function ComplexUnitStringNullUndefinedNode() {\n      return false;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nexport function isIntegerNumber(x) {\n  return isInteger(x);\n}\nisIntegerNumber.signature = n1;\nexport function isNegativeNumber(x) {\n  return x < 0;\n}\nisNegativeNumber.signature = n1;\nexport function isPositiveNumber(x) {\n  return x > 0;\n}\nisPositiveNumber.signature = n1;\nexport function isZeroNumber(x) {\n  return x === 0;\n}\nisZeroNumber.signature = n1;\nexport function isNaNNumber(x) {\n  return Number.isNaN(x);\n}\nisNaNNumber.signature = n1;","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isPositiveNumber } from '../../plain/number/index.js';\nvar name = 'isPositive';\nvar dependencies = ['typed'];\nexport var createIsPositive = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return !x.isNeg() && !x.isZero() && !x.isNaN();\n    },\n    Fraction: function Fraction(x) {\n      return x.s > 0 && x.n > 0;\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNaNNumber } from '../../plain/number/index.js';\nvar name = 'isNaN';\nvar dependencies = ['typed'];\nexport var createIsNaN = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return x.isNaN();\n    },\n    Fraction: function Fraction(x) {\n      return false;\n    },\n    Complex: function Complex(x) {\n      return x.isNaN();\n    },\n    Unit: function Unit(x) {\n      return Number.isNaN(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, Number.isNaN);\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  } // use \"==\" operator, handles infinities\n\n\n  if (x.eq(y)) {\n    return true;\n  } // NaN\n\n\n  if (x.isNaN() || y.isNaN()) {\n    return false;\n  } // at this point x and y should be finite\n\n\n  if (x.isFinite() && y.isFinite()) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = x.minus(y).abs();\n\n    if (diff.isZero()) {\n      return true;\n    } else {\n      // use relative error\n      var max = x.constructor.max(x.abs(), y.abs());\n      return diff.lte(max.times(epsilon));\n    }\n  } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n  return false;\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';\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nexport var createEqualScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config\n  } = _ref;\n\n  /**\n   * Test whether two scalar values are nearly equal.\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex} y          Second value to compare\n   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false\n   * @private\n   */\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.equals(y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return complexEquals(x, y, config.epsilon);\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    }\n  });\n});\nexport var createEqualScalarNumber = factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { nearlyEqual } from './number.js';\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 */\n\nexport function complexEquals(x, y, epsilon) {\n  return nearlyEqual(x.re, y.re, epsilon) && nearlyEqual(x.im, y.im, epsilon);\n}","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\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 */\n\nfunction getNonDecimalNumberParts(input) {\n  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\n\n  if (nonDecimalWithRadixMatch) {\n    var radix = {\n      '0b': 2,\n      '0o': 8,\n      '0x': 16\n    }[nonDecimalWithRadixMatch[1]];\n    var integerPart = nonDecimalWithRadixMatch[2];\n    var fractionalPart = nonDecimalWithRadixMatch[3];\n    return {\n      input,\n      radix,\n      integerPart,\n      fractionalPart\n    };\n  } else {\n    return null;\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 */\n\n\nfunction makeNumberFromNonDecimalParts(parts) {\n  var n = parseInt(parts.integerPart, parts.radix);\n  var f = 0;\n\n  for (var i = 0; i < parts.fractionalPart.length; i++) {\n    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);\n    f += digitValue / Math.pow(parts.radix, i + 1);\n  }\n\n  var result = n + f;\n\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is no valid number');\n  }\n\n  return result;\n}\n\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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  var number = typed('number', {\n    '': function _() {\n      return 0;\n    },\n    number: function number(x) {\n      return x;\n    },\n    string: function string(x) {\n      if (x === 'NaN') return NaN;\n      var nonDecimalNumberParts = getNonDecimalNumberParts(x);\n\n      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n      }\n\n      var size = 0;\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n\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\n      var num = Number(x);\n\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is no valid number');\n      }\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 \\\"\".concat(x, \"\\\" is out of range\"));\n        } // check if the bit at index size - 1 is set and if so do the twos complement\n\n\n        if (num >= 2 ** (size - 1)) {\n          num = num - 2 ** size;\n        }\n      }\n\n      return num;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.toNumber();\n    },\n    Fraction: function Fraction(x) {\n      return x.valueOf();\n    },\n    Unit: function Unit(x) {\n      throw new Error('Second argument with valueless unit expected');\n    },\n    null: function _null(x) {\n      return 0;\n    },\n    'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\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\n  number.fromJSON = function (json) {\n    return parseFloat(json.value);\n  };\n\n  return number;\n});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'boolean';\nvar dependencies = ['typed'];\nexport var createBoolean = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    boolean: function boolean(x) {\n      return x;\n    },\n    number: function number(x) {\n      return !!x;\n    },\n    null: function _null(x) {\n      return false;\n    },\n    BigNumber: function BigNumber(x) {\n      return !x.isZero();\n    },\n    string: function string(x) {\n      // try case insensitive\n      var lcase = x.toLowerCase();\n\n      if (lcase === 'true') {\n        return true;\n      } else if (lcase === 'false') {\n        return false;\n      } // test whether value is a valid number\n\n\n      var num = Number(x);\n\n      if (x !== '' && !isNaN(num)) {\n        return !!num;\n      }\n\n      throw new Error('Cannot convert \"' + x + '\" to a boolean');\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'complex';\nvar dependencies = ['typed', 'Complex'];\nexport var createComplex = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Complex\n  } = _ref;\n\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    number: function number(x) {\n      return new Complex(x, 0);\n    },\n    'number, number': function numberNumber(re, im) {\n      return new Complex(re, im);\n    },\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {\n      return new Complex(re.toNumber(), im.toNumber());\n    },\n    Fraction: function Fraction(x) {\n      return new Complex(x.valueOf(), 0);\n    },\n    Complex: function Complex(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      return Complex(x); // for example '2 + 3i'\n    },\n    null: function _null(x) {\n      return Complex(0);\n    },\n    Object: function Object(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'splitUnit';\nvar dependencies = ['typed'];\nexport var createSplitUnit = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 UnitArray(unit, parts) {\n      return unit.splitUnit(parts);\n    }\n  });\n});","import { isInteger, log2, log10, cbrt, expm1, sign, toFixed, log1p } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n  return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n  return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n  return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n  return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n  return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n  return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n  return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n  return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function ceilNumber(x) {\n  return Math.ceil(x);\n}\nceilNumber.signature = n1;\nexport function cubeNumber(x) {\n  return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n  return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n  return expm1(x);\n}\nexpm1Number.signature = n1;\nexport function fixNumber(x) {\n  return x > 0 ? Math.floor(x) : Math.ceil(x);\n}\nfixNumber.signature = n1;\nexport function floorNumber(x) {\n  return Math.floor(x);\n}\nfloorNumber.signature = n1;\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 */\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  } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n  var r;\n\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n\n  return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\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 */\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  } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n\n\n  var t;\n  var prod = a * b;\n\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n\n  return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n/**\n * Calculate the logarithm of a value.\n * @param {number} x\n * @return {number}\n */\n\nexport function logNumber(x) {\n  return Math.log(x);\n}\nlogNumber.signature = n1;\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\n\nexport function log10Number(x) {\n  return log10(x);\n}\nlog10Number.signature = n1;\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\n\nexport function log2Number(x) {\n  return log2(x);\n}\nlog2Number.signature = n1;\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\n\nexport function log1pNumber(x) {\n  return log1p(x);\n}\nlog1pNumber.signature = n1;\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\n\nexport function modNumber(x, y) {\n  if (y > 0) {\n    // We don't use JavaScript's % operator here as this doesn't work\n    // correctly for x < 0 and x === 0\n    // see https://en.wikipedia.org/wiki/Modulo_operation\n    return x - y * Math.floor(x / y);\n  } else if (y === 0) {\n    return x;\n  } else {\n    // y < 0\n    // TODO: implement mod for a negative divisor\n    throw new Error('Cannot calculate mod for a negative divisor');\n  }\n}\nmodNumber.signature = n2;\n/**\n * 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 */\n\nexport function nthRootNumber(a, root) {\n  var inv = root < 0;\n\n  if (inv) {\n    root = -root;\n  }\n\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  } // edge cases zero and infinity\n\n\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n\n  var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x; // 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  /*\n  let x = 1 // Initial guess\n  let xPrev = 1\n  let i = 0\n  const iMax = 10000\n  do {\n    const delta = (a / Math.pow(x, root - 1) - x) / root\n    xPrev = x\n    x = x + delta\n    i++\n  }\n  while (xPrev !== x && i < iMax)\n   if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n   return inv ? 1 / x : x\n  */\n}\nnthRootNumber.signature = n2;\nexport function signNumber(x) {\n  return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n  return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n  return x * x;\n}\nsquareNumber.signature = n1;\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\n\nexport function xgcdNumber(a, b) {\n  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n  var t; // used to swap two variables\n\n  var q; // quotient\n\n  var r; // remainder\n\n  var x = 0;\n  var lastx = 1;\n  var y = 1;\n  var 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    t = x;\n    x = lastx - q * x;\n    lastx = t;\n    t = y;\n    y = lasty - q * y;\n    lasty = t;\n    a = b;\n    b = r;\n  }\n\n  var res;\n\n  if (a < 0) {\n    res = [-a, -lastx, -lasty];\n  } else {\n    res = [a, a ? lastx : 0, lasty];\n  }\n\n  return res;\n}\nxgcdNumber.signature = n2;\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 */\n\nexport function powNumber(x, y) {\n  // x^Infinity === 0 if -1 < x < 1\n  // A real number 0 is returned instead of complex(0)\n  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n    return 0;\n  }\n\n  return Math.pow(x, y);\n}\npowNumber.signature = n2;\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 */\n\nexport function roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  return parseFloat(toFixed(value, decimals));\n}\nroundNumber.signature = n2;\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\n\nexport function normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryPlusNumber } from '../../plain/number/index.js';\nvar name = 'unaryPlus';\nvar dependencies = ['typed', 'config', 'BigNumber'];\nexport var createUnaryPlus = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x; // complex numbers are immutable\n    },\n    BigNumber: function BigNumber(x) {\n      return x; // bignumbers are immutable\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    Unit: function Unit(x) {\n      return x.clone();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since unaryPlus(0) = 0\n      return deepMap(x, this, true);\n    },\n    'boolean | string': function booleanString(x) {\n      // convert to a number or bignumber\n      return config.number === 'BigNumber' ? new BigNumber(+x) : +x;\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cubeNumber } from '../../plain/number/index.js';\nvar name = 'cube';\nvar dependencies = ['typed'];\nexport var createCube = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.mul(x).mul(x); // Is faster than pow(x, 3)\n    },\n    BigNumber: function BigNumber(x) {\n      return x.times(x).times(x);\n    },\n    Fraction: function Fraction(x) {\n      return x.pow(3); // Is faster than mul()mul()mul()\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since cube(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return x.pow(3);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { expm1Number } from '../../plain/number/index.js';\nvar name = 'expm1';\nvar dependencies = ['typed', 'Complex'];\nexport var createExpm1 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Complex: _Complex\n  } = _ref;\n\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    Complex: function Complex(x) {\n      var r = Math.exp(x.re);\n      return new _Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));\n    },\n    BigNumber: function BigNumber(x) {\n      return x.exp().minus(1);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { log10Number } from '../../plain/number/index.js';\nvar name = 'log10';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createLog10 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex: _Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return new _Complex(x).log().div(Math.LN10);\n    },\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { multiplyNumber } from '../../plain/number/index.js';\nvar name = 'multiplyScalar';\nvar dependencies = ['typed'];\nexport var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\n   * Multiply two scalar values, `x * y`.\n   * This function is meant for internal use: it is used by the public function\n   * `multiply`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to multiply\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to multiply\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Multiplication of `x` and `y`\n   * @private\n   */\n  return typed('multiplyScalar', {\n    'number, number': multiplyNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.mul(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.times(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.mul(y);\n    },\n    'number | Fraction | BigNumber | Complex, Unit': function numberFractionBigNumberComplexUnit(x, y) {\n      var res = y.clone();\n      res.value = res.value === null ? res._normalize(x) : this(res.value, x);\n      return res;\n    },\n    'Unit, number | Fraction | BigNumber | Complex': function UnitNumberFractionBigNumberComplex(x, y) {\n      var res = x.clone();\n      res.value = res.value === null ? res._normalize(y) : this(res.value, y);\n      return res;\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return x.multiply(y);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { signNumber } from '../../plain/number/index.js';\nvar name = 'sign';\nvar dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];\nexport var createSign = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber,\n    complex,\n    Fraction: _Fraction\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.im === 0 ? complex(signNumber(x.re)) : x.sign();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x.cmp(0));\n    },\n    Fraction: function Fraction(x) {\n      return new _Fraction(x.s, 1);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sign(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { squareNumber } from '../../plain/number/index.js';\nvar name = 'square';\nvar dependencies = ['typed'];\nexport var createSquare = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.mul(x);\n    },\n    BigNumber: function BigNumber(x) {\n      return x.times(x);\n    },\n    Fraction: function Fraction(x) {\n      return x.mul(x);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since square(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return x.pow(2);\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  var BigNumber = x.constructor;\n\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\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\n      return new BigNumber(0);\n    }\n\n    if (!x.isFinite()) {\n      if (y.isNegative()) {\n        return x;\n      }\n\n      if (x.isNegative()) {\n        return new BigNumber(0);\n      }\n\n      return y;\n    }\n\n    if (!y.isFinite()) {\n      if (x.isNegative()) {\n        return y;\n      }\n\n      if (y.isNegative()) {\n        return new BigNumber(0);\n      }\n\n      return x;\n    }\n  }\n\n  return bitwise(x, y, function (a, b) {\n    return a & b;\n  });\n}\n/**\n * Bitwise not\n * @param {BigNumber} x\n * @return {BigNumber} Result of ~`x`, fully precise\n *\n */\n\nexport function bitNotBigNumber(x) {\n  if (x.isFinite() && !x.isInteger()) {\n    throw new Error('Integer expected in function bitNot');\n  }\n\n  var BigNumber = x.constructor;\n  var prevPrec = BigNumber.precision;\n  BigNumber.config({\n    precision: 1E9\n  });\n  var result = x.plus(new BigNumber(1));\n  result.s = -result.s || null;\n  BigNumber.config({\n    precision: prevPrec\n  });\n  return result;\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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n\n  var negOne = new BigNumber(-1);\n\n  if (x.isZero() || y.eq(negOne) || x.eq(y)) {\n    return y;\n  }\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() || x.isNegative() && !y.isNegative() && !y.isFinite()) {\n      return negOne;\n    }\n\n    if (x.isNegative() && y.isNegative()) {\n      return x.isFinite() ? x : y;\n    }\n\n    return x.isFinite() ? y : x;\n  }\n\n  return bitwise(x, y, function (a, b) {\n    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 */\n\nexport function bitwise(x, y, func) {\n  var BigNumber = x.constructor;\n  var xBits, yBits;\n  var xSign = +(x.s < 0);\n  var ySign = +(y.s < 0);\n\n  if (xSign) {\n    xBits = decCoefficientToBinaryString(bitNotBigNumber(x));\n\n    for (var i = 0; i < xBits.length; ++i) {\n      xBits[i] ^= 1;\n    }\n  } else {\n    xBits = decCoefficientToBinaryString(x);\n  }\n\n  if (ySign) {\n    yBits = decCoefficientToBinaryString(bitNotBigNumber(y));\n\n    for (var _i = 0; _i < yBits.length; ++_i) {\n      yBits[_i] ^= 1;\n    }\n  } else {\n    yBits = decCoefficientToBinaryString(y);\n  }\n\n  var minBits, maxBits, minSign;\n\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  var shortLen = minBits.length;\n  var longLen = maxBits.length;\n  var expFuncVal = func(xSign, ySign) ^ 1;\n  var outVal = new BigNumber(expFuncVal ^ 1);\n  var twoPower = new BigNumber(1);\n  var two = new BigNumber(2);\n  var prevPrec = BigNumber.precision;\n  BigNumber.config({\n    precision: 1E9\n  });\n\n  while (shortLen > 0) {\n    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n\n    twoPower = twoPower.times(two);\n  }\n\n  while (longLen > 0) {\n    if (func(minSign, maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n\n    twoPower = twoPower.times(two);\n  }\n\n  BigNumber.config({\n    precision: prevPrec\n  });\n\n  if (expFuncVal === 0) {\n    outVal.s = -outVal.s;\n  }\n\n  return outVal;\n}\n/* Extracted from decimal.js, and edited to specialize. */\n\nfunction decCoefficientToBinaryString(x) {\n  // Convert to string\n  var a = x.d; // array with digits\n\n  var r = a[0] + '';\n\n  for (var i = 1; i < a.length; ++i) {\n    var s = a[i] + '';\n\n    for (var z = 7 - s.length; z--;) {\n      s = '0' + s;\n    }\n\n    r += s;\n  }\n\n  var j = r.length;\n\n  while (r.charAt(j) === '0') {\n    j--;\n  }\n\n  var xe = x.e;\n  var str = r.slice(0, j + 1 || 1);\n  var strL = str.length;\n\n  if (xe > 0) {\n    if (++xe > strL) {\n      // Append zeros.\n      xe -= strL;\n\n      while (xe--) {\n        str += '0';\n      }\n    } else if (xe < strL) {\n      str = str.slice(0, xe) + '.' + str.slice(xe);\n    }\n  } // Convert from base 10 (decimal) to base 2\n\n\n  var arr = [0];\n\n  for (var _i2 = 0; _i2 < str.length;) {\n    var arrL = arr.length;\n\n    while (arrL--) {\n      arr[arrL] *= 10;\n    }\n\n    arr[0] += parseInt(str.charAt(_i2++)); // convert to int\n\n    for (var _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 * 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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero()) {\n    return y;\n  }\n\n  if (y.isZero()) {\n    return x;\n  }\n\n  if (x.eq(y)) {\n    return new BigNumber(0);\n  }\n\n  var negOne = new BigNumber(-1);\n\n  if (x.eq(negOne)) {\n    return bitNotBigNumber(y);\n  }\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\n    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);\n  }\n\n  return bitwise(x, y, function (a, b) {\n    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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n\n  if (!x.isFinite() && !y.isFinite()) {\n    return new BigNumber(NaN);\n  } // Math.pow(2, y) is fully precise for y < 55, and fast\n\n\n  if (y.lt(55)) {\n    return x.times(Math.pow(2, y.toNumber()) + '');\n  }\n\n  return x.times(new BigNumber(2).pow(y));\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 */\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  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n\n  if (!y.isFinite()) {\n    if (x.isNegative()) {\n      return new BigNumber(-1);\n    }\n\n    if (!x.isFinite()) {\n      return new BigNumber(NaN);\n    }\n\n    return new BigNumber(0);\n  } // Math.pow(2, y) is fully precise for y < 55, and fast\n\n\n  if (y.lt(55)) {\n    return x.div(Math.pow(2, y.toNumber()) + '').floor();\n  }\n\n  return x.div(new BigNumber(2).pow(y)).floor();\n}","import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\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;\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;\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;\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;\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;\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;\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;","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';\nvar name = 'bitNot';\nvar dependencies = ['typed'];\nexport var createBitNot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: bitNotBigNumber,\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'arg';\nvar dependencies = ['typed'];\nexport var createArg = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return Math.atan2(0, x);\n    },\n    BigNumber: function BigNumber(x) {\n      return x.constructor.atan2(0, x);\n    },\n    Complex: function Complex(x) {\n      return x.arg();\n    },\n    // TODO: implement BigNumber support for function arg\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'im';\nvar dependencies = ['typed'];\nexport var createIm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return 0;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.mul(0);\n    },\n    Complex: function Complex(x) {\n      return x.im;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","var n1 = 'number';\nvar n2 = 'number, number';\nexport function notNumber(x) {\n  return !x;\n}\nnotNumber.signature = n1;\nexport function orNumber(x, y) {\n  return !!(x || y);\n}\norNumber.signature = n2;\nexport function xorNumber(x, y) {\n  return !!x !== !!y;\n}\nxorNumber.signature = n2;\nexport function andNumber(x, y) {\n  return !!(x && y);\n}\nandNumber.signature = n2;","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { notNumber } from '../../plain/number/index.js';\nvar name = 'not';\nvar dependencies = ['typed'];\nexport var createNot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.re === 0 && x.im === 0;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.isZero() || x.isNaN();\n    },\n    Unit: function Unit(x) {\n      return x.value !== null ? this(x.value) : true;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { filter, filterRegExp } from '../../utils/array.js';\nimport { maxArgumentCount } from '../../utils/function.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'filter';\nvar dependencies = ['typed'];\nexport var createFilter = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    'Matrix, function': function MatrixFunction(x, test) {\n      return x.create(_filterCallback(x.toArray(), test));\n    },\n    'Array, RegExp': filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return x.create(filterRegExp(x.toArray(), test));\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 */\n\nfunction _filterCallback(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\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 {\n      // 3 or -1\n      return callback(value, [index], array);\n    }\n  });\n}","import { maxArgumentCount } from '../../utils/function.js';\nimport { forEach as forEachArray } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'forEach';\nvar dependencies = ['typed'];\nexport var createForEach = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.forEach(callback);\n    }\n  });\n});\n/**\n * forEach for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @private\n */\n\nfunction _forEach(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n\n  var recurse = function recurse(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 {\n        // 3 or -1\n        callback(value, index, array);\n      }\n    }\n  };\n\n  recurse(array, []);\n}","import { maxArgumentCount } from '../../utils/function.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'map';\nvar dependencies = ['typed'];\nexport var createMap = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\n   * Create a new matrix or array with the results of the callback function executed on\n   * each entry of the matrix/array.\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   * See also:\n   *\n   *    filter, forEach, sort\n   *\n   * @param {Matrix | Array} x    The matrix to iterate on.\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   * @return {Matrix | array}     Transformed map of x\n   */\n  return typed(name, {\n    'Array, function': _map,\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.map(callback);\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 */\n\nfunction _map(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n\n  var recurse = function recurse(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      // invoke the callback function with the right number of arguments\n      if (args === 1) {\n        return callback(value);\n      } else if (args === 2) {\n        return callback(value, index);\n      } else {\n        // 3 or -1\n        return callback(value, index, array);\n      }\n    }\n  };\n\n  return recurse(array, []);\n}","/* eslint-disable no-loss-of-precision */\nimport { deepMap } from '../../utils/collection.js';\nimport { sign } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'erf';\nvar dependencies = ['typed'];\nexport var createErf = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      var y = Math.abs(x);\n\n      if (y >= MAX_NUM) {\n        return sign(x);\n      }\n\n      if (y <= THRESH) {\n        return sign(x) * erf1(y);\n      }\n\n      if (y <= 4.0) {\n        return sign(x) * (1 - erfc2(y));\n      }\n\n      return sign(x) * (1 - erfc3(y));\n    },\n    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, this);\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   * 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\n  function erf1(y) {\n    var ysq = y * y;\n    var xnum = P[0][4] * ysq;\n    var xden = ysq;\n    var 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\n    return y * (xnum + P[0][3]) / (xden + Q[0][3]);\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\n\n  function erfc2(y) {\n    var xnum = P[1][8] * y;\n    var xden = y;\n    var 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\n    var result = (xnum + P[1][7]) / (xden + Q[1][7]);\n    var ysq = parseInt(y * 16) / 16;\n    var del = (y - ysq) * (y + ysq);\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;\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\n\n  function erfc3(y) {\n    var ysq = 1 / (y * y);\n    var xnum = P[2][5] * ysq;\n    var xden = ysq;\n    var 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\n    var result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);\n    result = (SQRPI - result) / y;\n    ysq = parseInt(y * 16) / 16;\n    var del = (y - ysq) * (y + ysq);\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;\n  }\n});\n/**\n * Upper bound for the first approximation interval, 0 <= x <= THRESH\n * @constant\n */\n\nvar THRESH = 0.46875;\n/**\n * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)\n * @constant\n */\n\nvar SQRPI = 5.6418958354775628695e-1;\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 */\n\nvar 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]];\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 */\n\nvar 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]];\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 */\n\nvar MAX_NUM = Math.pow(2, 53);","import { format as formatString } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'format';\nvar dependencies = ['typed'];\nexport var createFormat = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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   *      A number between 0 and 16 to round the digits of the number. In case\n   *      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   * - `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});","import { factory } from '../../utils/factory.js';\nvar name = 'oct';\nvar dependencies = ['typed', 'format'];\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 var createOct = factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'oct'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'oct',\n        wordSize: wordSize\n      });\n    }\n  });\n});","import { format } from '../../utils/string.js';\nimport { isString } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'print';\nvar dependencies = ['typed'];\nexport var createPrint = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 * 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 */\n\nfunction _print(template, values, options) {\n  return template.replace(/\\$([\\w.]+)/g, function (original, key) {\n    var keys = key.split('.');\n    var value = values[keys.shift()];\n\n    while (keys.length && value !== undefined) {\n      var 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}","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isPrime';\nvar dependencies = ['typed'];\nexport var createIsPrime = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      if (x * 0 !== 0) {\n        return false;\n      }\n\n      if (x <= 3) {\n        return x > 1;\n      }\n\n      if (x % 2 === 0 || x % 3 === 0) {\n        return false;\n      }\n\n      for (var i = 5; i * i <= x; i += 6) {\n        if (x % i === 0 || x % (i + 2) === 0) {\n          return false;\n        }\n      }\n\n      return true;\n    },\n    BigNumber: function BigNumber(n) {\n      if (n.toNumber() * 0 !== 0) {\n        return false;\n      }\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\n      for (var i = 5; n.gte(i * i); i += 6) {\n        if (n.mod(i).eq(0) || n.mod(i + 2).eq(0)) {\n          return false;\n        }\n      }\n\n      return true;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'acos';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAcos = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return x.acos();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.acos();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { acosh, asinh, atanh, cosh, sign, sinh, tanh } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function acosNumber(x) {\n  return Math.acos(x);\n}\nacosNumber.signature = n1;\nexport function acoshNumber(x) {\n  return acosh(x);\n}\nacoshNumber.signature = n1;\nexport function acotNumber(x) {\n  return Math.atan(1 / x);\n}\nacotNumber.signature = n1;\nexport function acothNumber(x) {\n  return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;\n}\nacothNumber.signature = n1;\nexport function acscNumber(x) {\n  return Math.asin(1 / x);\n}\nacscNumber.signature = n1;\nexport function acschNumber(x) {\n  var xInv = 1 / x;\n  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));\n}\nacschNumber.signature = n1;\nexport function asecNumber(x) {\n  return Math.acos(1 / x);\n}\nasecNumber.signature = n1;\nexport function asechNumber(x) {\n  var xInv = 1 / x;\n  var ret = Math.sqrt(xInv * xInv - 1);\n  return Math.log(ret + xInv);\n}\nasechNumber.signature = n1;\nexport function asinNumber(x) {\n  return Math.asin(x);\n}\nasinNumber.signature = n1;\nexport function asinhNumber(x) {\n  return asinh(x);\n}\nasinhNumber.signature = n1;\nexport function atanNumber(x) {\n  return Math.atan(x);\n}\natanNumber.signature = n1;\nexport function atan2Number(y, x) {\n  return Math.atan2(y, x);\n}\natan2Number.signature = n2;\nexport function atanhNumber(x) {\n  return atanh(x);\n}\natanhNumber.signature = n1;\nexport function cosNumber(x) {\n  return Math.cos(x);\n}\ncosNumber.signature = n1;\nexport function coshNumber(x) {\n  return cosh(x);\n}\ncoshNumber.signature = n1;\nexport function cotNumber(x) {\n  return 1 / Math.tan(x);\n}\ncotNumber.signature = n1;\nexport function cothNumber(x) {\n  var e = Math.exp(2 * x);\n  return (e + 1) / (e - 1);\n}\ncothNumber.signature = n1;\nexport function cscNumber(x) {\n  return 1 / Math.sin(x);\n}\ncscNumber.signature = n1;\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;\nexport function secNumber(x) {\n  return 1 / Math.cos(x);\n}\nsecNumber.signature = n1;\nexport function sechNumber(x) {\n  return 2 / (Math.exp(x) + Math.exp(-x));\n}\nsechNumber.signature = n1;\nexport function sinNumber(x) {\n  return Math.sin(x);\n}\nsinNumber.signature = n1;\nexport function sinhNumber(x) {\n  return sinh(x);\n}\nsinhNumber.signature = n1;\nexport function tanNumber(x) {\n  return Math.tan(x);\n}\ntanNumber.signature = n1;\nexport function tanhNumber(x) {\n  return tanh(x);\n}\ntanhNumber.signature = n1;","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acotNumber } from '../../plain/number/index.js';\nvar name = 'acot';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createAcot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.acot();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).atan();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acscNumber } from '../../plain/number/index.js';\nvar name = 'acsc';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAcsc = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return acscNumber(x);\n      }\n\n      return new Complex(x, 0).acsc();\n    },\n    Complex: function Complex(x) {\n      return x.acsc();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).asin();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { asecNumber } from '../../plain/number/index.js';\nvar name = 'asec';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAsec = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return asecNumber(x);\n      }\n\n      return new Complex(x, 0).asec();\n    },\n    Complex: function Complex(x) {\n      return x.asec();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).acos();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'asin';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAsin = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return x.asin();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.asin();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since asin(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'atan';\nvar dependencies = ['typed'];\nexport var createAtan = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return Math.atan(x);\n    },\n    Complex: function Complex(x) {\n      return x.atan();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.atan();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since atan(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { atanhNumber } from '../../plain/number/index.js';\nvar name = 'atanh';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAtanh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        return atanhNumber(x);\n      }\n\n      return new Complex(x, 0).atanh();\n    },\n    Complex: function Complex(x) {\n      return x.atanh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.atanh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since atanh(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cosh as coshNumber } from '../../utils/number.js';\nvar name = 'cosh';\nvar dependencies = ['typed'];\nexport var createCosh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.cosh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.cosh();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cosh is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cothNumber } from '../../plain/number/index.js';\nvar name = 'coth';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCoth = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.coth();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.tanh());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function coth is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cschNumber } from '../../plain/number/index.js';\nvar name = 'csch';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCsch = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.csch();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.sinh());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csch is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { sechNumber } from '../../plain/number/index.js';\nvar name = 'sech';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createSech = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sech();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.cosh());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sech is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { sinhNumber } from '../../plain/number/index.js';\nvar name = 'sinh';\nvar dependencies = ['typed'];\nexport var createSinh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sinh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.sinh();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sinh is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sinh(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { tanh as _tanh } from '../../utils/number.js';\nvar name = 'tanh';\nvar dependencies = ['typed'];\nexport var createTanh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.tanh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.tanh();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tanh is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since tanh(0) = 0\n      return deepMap(x, this, true);\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  var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer\n\n  return product(i, half) * product(half + 1, n);\n}","import { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function combinationsNumber(n, k) {\n  if (!isInteger(n) || n < 0) {\n    throw new TypeError('Positive integer value expected in function combinations');\n  }\n\n  if (!isInteger(k) || k < 0) {\n    throw new TypeError('Positive integer value expected in function combinations');\n  }\n\n  if (k > n) {\n    throw new TypeError('k must be less than or equal to n');\n  }\n\n  var nMinusk = n - k;\n  var prodrange;\n\n  if (k < nMinusk) {\n    prodrange = product(nMinusk + 1, n);\n    return prodrange / product(1, k);\n  }\n\n  prodrange = product(k + 1, n);\n  return prodrange / product(1, nMinusk);\n}\ncombinationsNumber.signature = 'number, number';","import { factory } from '../../utils/factory.js';\nimport { combinationsNumber } from '../../plain/number/combinations.js';\nvar name = 'combinations';\nvar dependencies = ['typed'];\nexport var createCombinations = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var BigNumber = n.constructor;\n      var result, i;\n      var nMinusk = n.minus(k);\n      var one = new BigNumber(1);\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinations');\n      }\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\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    } // 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 */\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}","import seedrandom from 'seedrandom';\nvar singletonRandom = /* #__PURE__ */seedrandom(Date.now());\nexport function createRng(randomSeed) {\n  var random; // create a new random generator with given seed\n\n  function setSeed(seed) {\n    random = seed === null ? singletonRandom : seedrandom(String(seed));\n  } // initialize a seeded pseudo random number generator with config's random seed\n\n\n  setSeed(randomSeed); // wrapper function so the rng can be updated via generator\n\n  function rng() {\n    return random();\n  }\n\n  return rng;\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';\nvar name = 'pickRandom';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createPickRandom = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var 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   * 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\n\n  return typed({\n    'Array | Matrix': function ArrayMatrix(possibles) {\n      return _pickRandom(possibles, {});\n    },\n    'Array | Matrix, Object': function ArrayMatrixObject(possibles, options) {\n      return _pickRandom(possibles, options);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(possibles, number) {\n      return _pickRandom(possibles, {\n        number\n      });\n    },\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(possibles, weights) {\n      return _pickRandom(possibles, {\n        weights\n      });\n    },\n    'Array | Matrix, Array | Matrix, number': function ArrayMatrixArrayMatrixNumber(possibles, weights, number) {\n      return _pickRandom(possibles, {\n        number,\n        weights\n      });\n    },\n    'Array | Matrix, number, Array | Matrix': function ArrayMatrixNumberArrayMatrix(possibles, number, weights) {\n      return _pickRandom(possibles, {\n        number,\n        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\n  function _pickRandom(possibles, _ref2) {\n    var {\n      number,\n      weights,\n      elementWise = true\n    } = _ref2;\n    var single = typeof number === 'undefined';\n\n    if (single) {\n      number = 1;\n    }\n\n    var createMatrix = isMatrix(possibles) ? possibles.create : isMatrix(weights) ? weights.create : null;\n    possibles = possibles.valueOf(); // get Array\n\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    var 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 (var 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    var length = possibles.length;\n    var result = [];\n    var pick;\n\n    while (result.length < number) {\n      if (typeof weights === 'undefined') {\n        pick = possibles[Math.floor(rng() * length)];\n      } else {\n        var randKey = rng() * totalWeights;\n\n        for (var _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 ? result[0] : createMatrix ? createMatrix(result) : result;\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  var data = [];\n  size = size.slice(0);\n\n  if (size.length > 1) {\n    for (var i = 0, length = size.shift(); i < length; i++) {\n      data.push(randomMatrix(size, random));\n    }\n  } else {\n    for (var _i = 0, _length = size.shift(); _i < _length; _i++) {\n      data.push(random());\n    }\n  }\n\n  return data;\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';\nvar name = 'randomInt';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createRandomInt = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var 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 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\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    var 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});","import { clone as objectClone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'clone';\nvar dependencies = ['typed'];\nexport var createClone = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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});","import { factory } from '../../utils/factory.js';\nvar name = 'hasNumericValue';\nvar dependencies = ['typed', 'isNumeric'];\nexport var createHasNumericValue = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isNumeric\n  } = _ref;\n\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 string(x) {\n      return x.trim().length > 0 && !isNaN(Number(x));\n    },\n    any: function any(x) {\n      return isNumeric(x);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { typeOf as _typeOf } from '../../utils/is.js';\nvar name = 'typeOf';\nvar dependencies = ['typed'];\nexport var createTypeOf = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nimport { format } from '../utils/number.js';\nvar name = 'string';\nvar dependencies = ['typed'];\nexport var createString = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    number: format,\n    null: function _null(x) {\n      return 'null';\n    },\n    boolean: function boolean(x) {\n      return x + '';\n    },\n    string: function string(x) {\n      return x;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    },\n    any: function any(x) {\n      return String(x);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'fraction';\nvar dependencies = ['typed', 'Fraction'];\nexport var createFraction = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Fraction\n  } = _ref;\n\n  /**\n   * Create a fraction convert a value to a fraction.\n   *\n   * Syntax:\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)         Turn all matrix entries\n   *                                                   into fractions\n   *\n   * Examples:\n   *\n   *     math.fraction(1, 3)\n   *     math.fraction('2/3')\n   *     math.fraction({n: 2, d: 3})\n   *     math.fraction([0.2, 0.25, 1.25])\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]\n   *            Arguments specifying the numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  return typed('fraction', {\n    number: function number(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    string: function string(x) {\n      return new Fraction(x);\n    },\n    'number, number': function numberNumber(numerator, denominator) {\n      return new Fraction(numerator, denominator);\n    },\n    null: function _null(x) {\n      return new Fraction(0);\n    },\n    BigNumber: function BigNumber(x) {\n      return new Fraction(x.toString());\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    Object: function Object(x) {\n      return new Fraction(x);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryMinusNumber } from '../../plain/number/index.js';\nvar name = 'unaryMinus';\nvar dependencies = ['typed'];\nexport var createUnaryMinus = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.neg();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.neg();\n    },\n    Fraction: function Fraction(x) {\n      return x.neg();\n    },\n    Unit: function Unit(x) {\n      var res = x.clone();\n      res.value = this(x.value);\n      return res;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since unaryMinus(0) = 0\n      return deepMap(x, this, true);\n    } // TODO: add support for string\n\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { addNumber } from '../../plain/number/index.js';\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nexport var createAddScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\n   * Add two scalar values, `x + y`.\n   * This function is meant for internal use: it is used by the public function\n   * `add`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Sum of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': addNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.add(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.plus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.add(y);\n    },\n    'Unit, Unit': function UnitUnit(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      var res = x.clone();\n      res.value = this(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { expNumber } from '../../plain/number/index.js';\nvar name = 'exp';\nvar dependencies = ['typed'];\nexport var createExp = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.exp();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.exp();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // TODO: exp(sparse) should return a dense matrix since exp(0)==1\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { log2Number } from '../../plain/number/index.js';\nvar name = 'log2';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createLog2 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(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    Complex: _log2Complex,\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n  /**\n   * Calculate log2 for a complex value\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n\n  function _log2Complex(x) {\n    var newX = Math.sqrt(x.re * x.re + x.im * x.im);\n    return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'sqrt';\nvar dependencies = ['config', 'typed', 'Complex'];\nexport var createSqrt = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    Complex\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sqrt();\n    },\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sqrt(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      // Someday will work for complex units when they are implemented\n      return x.pow(0.5);\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\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});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'conj';\nvar dependencies = ['typed'];\nexport var createConj = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\n  /**\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 number(x) {\n      return x;\n    },\n    BigNumber: function BigNumber(x) {\n      return x;\n    },\n    Complex: function Complex(x) {\n      return x.conjugate();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { getArrayDataType } from '../../utils/array.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'getMatrixDataType';\nvar dependencies = ['typed'];\nexport var createGetMatrixDataType = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 Array(x) {\n      return getArrayDataType(x, typeOf);\n    },\n    Matrix: function Matrix(x) {\n      return x.getDataType();\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'mode';\nvar dependencies = ['typed', 'isNaN', 'isNumeric'];\nexport var createMode = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isNaN,\n    isNumeric\n  } = _ref;\n\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    '...': function _(args) {\n      return _mode(args);\n    }\n  });\n  /**\n   * Calculates the mode in an 1-dimensional array\n   * @param {Array} values\n   * @return {Array} mode\n   * @private\n   */\n\n  function _mode(values) {\n    values = flatten(values.valueOf());\n    var num = values.length;\n\n    if (num === 0) {\n      throw new Error('Cannot calculate mode of an empty array');\n    }\n\n    var count = {};\n    var mode = [];\n    var max = 0;\n\n    for (var i = 0; i < values.length; i++) {\n      var 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\n    return mode;\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'bin';\nvar dependencies = ['typed', 'format'];\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 */\n\nexport var createBin = factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'bin'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'bin',\n        wordSize: wordSize\n      });\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acoshNumber } from '../../plain/number/index.js';\nvar name = 'acosh';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAcosh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\n\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 number(x) {\n      if (x >= 1 || config.predictable) {\n        return acoshNumber(x);\n      }\n\n      if (x <= -1) {\n        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);\n      }\n\n      return new Complex(x, 0).acosh();\n    },\n    Complex: function Complex(x) {\n      return x.acosh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.acosh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acschNumber } from '../../plain/number/index.js';\nvar name = 'acsch';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createAcsch = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.acsch();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).asinh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { asinhNumber } from '../../plain/number/index.js';\nvar name = 'asinh';\nvar dependencies = ['typed'];\nexport var createAsinh = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.asinh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.asinh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since asinh(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'cos';\nvar dependencies = ['typed'];\nexport var createCos = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.cos();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.cos();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cos is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cscNumber } from '../../plain/number/index.js';\nvar name = 'csc';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCsc = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.csc();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.sin());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csc is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'sin';\nvar dependencies = ['typed'];\nexport var createSin = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sin();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.sin();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sin is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sin(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nvar name = 'combinationsWithRep';\nvar dependencies = ['typed'];\nexport var createCombinationsWithRep = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 numberNumber(n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\n\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\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        var _prodrange = product(n, n + k - 1);\n\n        return _prodrange / product(1, k);\n      }\n\n      var prodrange = product(k + 1, n + k - 1);\n      return prodrange / product(1, n - 1);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var BigNumber = n.constructor;\n      var result, i;\n      var one = new BigNumber(1);\n      var nMinusOne = n.minus(one);\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\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\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 * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\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';\nvar name = 'random';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createRandom = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var 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 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\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    var 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}); // 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?\n\nexport var createRandomNumber = /* #__PURE__ */factory(name, ['typed', 'config', '?on'], (_ref2) => {\n  var {\n    typed,\n    config,\n    on,\n    matrix\n  } = _ref2;\n  // seeded pseudo random number generator1\n  var 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});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNegativeNumber } from '../../plain/number/index.js';\nvar name = 'isNegative';\nvar dependencies = ['typed'];\nexport var createIsNegative = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return x.isNeg() && !x.isZero() && !x.isNaN();\n    },\n    Fraction: function Fraction(x) {\n      return x.s < 0; // It's enough to decide on the sign\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nexport var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar,\n    Matrix\n  } = _ref;\n\n  /**\n   * Sparse Matrix implementation. This type implements a Compressed Column Storage format\n   * for sparse matrices.\n   * @class SparseMatrix\n   */\n  function SparseMatrix(data, datatype) {\n    if (!(this instanceof SparseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\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; // discover rows & columns, do not use math.size() to avoid looping array twice\n\n    var rows = data.length;\n    var columns = 0; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, datatype);\n    } // check we have rows (empty array)\n\n\n    if (rows > 0) {\n      // column index\n      var j = 0;\n\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length); // loop rows\n\n\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i]; // check row is an array\n\n          if (isArray(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) {\n              columns = row.length;\n            } // check row has column\n\n\n            if (j < row.length) {\n              // value\n              var v = row[j]; // check value != 0\n\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v); // index\n\n\n                matrix._index.push(i);\n              }\n            }\n          } else {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < 1) {\n              columns = 1;\n            } // check value != 0 (row is a scalar)\n\n\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row); // index\n\n\n              matrix._index.push(i);\n            }\n          }\n        } // increment index\n\n\n        j++;\n      } while (j < columns);\n    } // store number of values in ptr\n\n\n    matrix._ptr.push(matrix._index.length); // size\n\n\n    matrix._size = [rows, columns];\n  }\n\n  SparseMatrix.prototype = new Matrix();\n  /**\n   * Create a new SparseMatrix\n   */\n\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n  /**\n   * Attach type information\n   */\n\n\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\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\n  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values, typeOf);\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\n\n  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\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\n\n  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n\n\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\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\n\n  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1]; // calculate density\n\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\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\n\n  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke subset on a Pattern only matrix');\n    } // check arguments\n\n\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n      // intentional fall through\n\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    var isScalar = idx.isScalar();\n\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    } // validate dimensions\n\n\n    var size = idx.size();\n\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length);\n    } // vars\n\n\n    var i, ii, k, kk; // validate if any of the ranges in the index is out of range\n\n    var min = idx.min();\n    var max = idx.max();\n\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    } // matrix arrays\n\n\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr; // rows & columns dimensions for result matrix\n\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1); // workspace & permutation vector\n\n    var w = [];\n    var pv = []; // loop rows in resulting matrix\n\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0]; // mark i in workspace\n\n      w[i] = true;\n    }); // result matrix arrays\n\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = []; // loop columns in result matrix\n\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length); // loop values in column j\n\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k]; // check row is in result matrix\n\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]); // check we need to process values\n\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    }); // update ptr\n\n    ptr.push(index.length); // return matrix\n\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    } // get index size and check whether the index contains a single value\n\n\n    var iSize = index.size();\n    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n    var sSize;\n\n    if (isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size(); // use array representation\n\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = arraySize(submatrix);\n    } // check index is a scalar\n\n\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      } // set value\n\n\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      } // check submatrix and index have the same dimensions\n\n\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        } // unsqueeze both outer and inner dimensions\n\n\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      } // check whether the size of the submatrix matches the index size\n\n\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      } // offsets\n\n\n      var x0 = index.min()[0];\n      var y0 = index.min()[1]; // submatrix rows and columns\n\n      var m = sSize[0];\n      var n = sSize[1]; // loop submatrix\n\n      for (var x = 0; x < m; x++) {\n        // loop columns\n        for (var y = 0; y < n; y++) {\n          // value at i, j\n          var v = submatrix[x][y]; // invoke set (zero value will remove entry from matrix)\n\n          matrix.set([x + x0, y + y0], v, defaultValue);\n        }\n      }\n    }\n\n    return matrix;\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\n\n  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check it is a pattern matrix\n\n\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    } // row and column\n\n\n    var i = index[0];\n    var j = index[1]; // check i, j are valid\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[1]); // find value index\n\n    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\n\n\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n\n    return 0;\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\n\n  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check it is a pattern matrix\n\n\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    } // row and column\n\n\n    var i = index[0];\n    var j = index[1]; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var 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; // convert 0 to the same datatype\n\n      zero = typed.convert(0, this._datatype);\n    } // check we need to resize matrix\n\n\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); // update rows & columns\n\n\n      rows = this._size[0];\n      columns = this._size[1];\n    } // check i, j are valid\n\n\n    validateIndex(i, rows);\n    validateIndex(j, columns); // find value index\n\n    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\n\n\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) {\n      return bottom;\n    } // loop rows [top, bottom[\n\n\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    } // we did not find row\n\n\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); // update pointers\n\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v); // update row for k\n\n    index.splice(k, 0, i); // update column pointers\n\n    for (var x = j + 1; x < ptr.length; x++) {\n      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   * @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\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    } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n\n\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n\n    if (sizeArray.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // check sizes\n\n\n    sizeArray.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');\n      }\n    }); // matrix to resize\n\n    var m = copy ? this.clone() : this; // resize matrix\n\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    var value = defaultValue || 0; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var 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; // convert 0 to the same datatype\n\n      zero = typed.convert(0, matrix._datatype); // convert value to the same datatype\n\n      value = typed.convert(value, matrix._datatype);\n    } // should we insert the value?\n\n\n    var ins = !eq(value, zero); // old columns and rows\n\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k; // check we need to increase columns\n\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; // check we need to insert matrix._values\n\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value); // update matrix._index\n\n\n            matrix._index.push(i);\n          }\n        }\n      } // store number of matrix._values in matrix._ptr\n\n\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns); // truncate matrix._values and matrix._index\n\n\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    } // update columns\n\n\n    c = columns; // check we need to increase rows\n\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0; // loop columns\n\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n; // where to insert matrix._values\n\n          k = matrix._ptr[j + 1] + n; // pointer\n\n          var p = 0; // loop new rows, initialize pointer\n\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value); // update matrix._index\n\n\n            matrix._index.splice(k + p, 0, i); // increment inserts\n\n\n            n++;\n          }\n        } // store number of matrix._values in matrix._ptr\n\n\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0; // loop columns\n\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d; // where matrix._values start for next column\n\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d; // loop matrix._index\n\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k]; // check we need to delete value and matrix._index\n\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1); // remove item from matrix._index\n\n\n            matrix._index.splice(k, 1); // increase deletes\n\n\n            d++;\n          }\n        }\n      } // update matrix._ptr for current column\n\n\n      matrix._ptr[j] = matrix._values.length;\n    } // update matrix._size\n\n\n    matrix._size[0] = rows;\n    matrix._size[1] = columns; // return matrix\n\n    return matrix;\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   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n\n\n  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!isArray(sizes)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (sizes.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    } // check sizes\n\n\n    sizes.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');\n      }\n    });\n    var currentLength = this._size[0] * this._size[1];\n    sizes = processSizesWildcard(sizes, currentLength);\n    var newLength = sizes[0] * sizes[1]; // m * n must not change\n\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    } // matrix to reshape\n\n\n    var m = copy ? this.clone() : this; // return unchanged if the same shape\n\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m;\n    } // Convert to COO format (generate a column index)\n\n\n    var colIndex = [];\n\n    for (var i = 0; i < m._ptr.length; i++) {\n      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i);\n      }\n    } // Clone the values array\n\n\n    var values = m._values.slice(); // Clone the row index array\n\n\n    var rowIndex = m._index.slice(); // Transform the (row, column) indices\n\n\n    for (var _i = 0; _i < m._index.length; _i++) {\n      var r1 = rowIndex[_i];\n      var c1 = colIndex[_i];\n      var flat = r1 * m._size[1] + c1;\n      colIndex[_i] = flat % sizes[1];\n      rowIndex[_i] = Math.floor(flat / sizes[1]);\n    } // 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    // OR, we could easily just:\n    // 1. Remove all values from the matrix\n\n\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = sizes[1] + 1;\n    m._size = sizes.slice();\n\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\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\n\n    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    } // The value indices are inserted out of order, but apparently that's... still OK?\n\n\n    return m;\n  };\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n\n\n  SparseMatrix.prototype.clone = function () {\n    var m = new SparseMatrix({\n      values: this._values ? clone(this._values) : undefined,\n      index: clone(this._index),\n      ptr: clone(this._ptr),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n\n\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\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\n\n  SparseMatrix.prototype.map = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke map on a Pattern only matrix');\n    } // matrix instance\n\n\n    var me = this; // rows and columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // invoke callback\n\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      return callback(v, [i, j], me);\n    }; // invoke _map\n\n\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\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\n\n  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = []; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var 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; // convert 0 to the same datatype\n\n      zero = typed.convert(0, matrix._datatype);\n    } // invoke callback\n\n\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      v = callback(v, x, y); // check value != 0\n\n      if (!eq(v, zero)) {\n        // store value\n        values.push(v); // index\n\n        index.push(x);\n      }\n    }; // loop columns\n\n\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = matrix._index[k]; // check i is in range\n\n          if (i >= minRow && i <= maxRow) {\n            // value @ k\n            invoke(matrix._values[k], i - minRow, j - minColumn);\n          }\n        }\n      } else {\n        // create a cache holding all defined values\n        var _values = {};\n\n        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        } // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n\n\n        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {\n          var value = _i5 in _values ? _values[_i5] : 0;\n          invoke(value, _i5 - minRow, j - minColumn);\n        }\n      }\n    } // store number of values in ptr\n\n\n    ptr.push(values.length); // return sparse matrix\n\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   * 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   */\n\n\n  SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke forEach on a Pattern only matrix');\n    } // matrix instance\n\n\n    var me = this; // rows and columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = this._index[k]; // value @ k\n\n          callback(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        } // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n\n\n        for (var _i7 = 0; _i7 < rows; _i7++) {\n          var value = _i7 in values ? values[_i7] : 0;\n          callback(value, [_i7, j], me);\n        }\n      }\n    }\n  };\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n\n\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n\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    var rows = size[0];\n    var columns = size[1]; // result\n\n    var a = []; // vars\n\n    var i, j; // initialize array\n\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    } // loop columns\n\n\n    for (j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // loop k within [k0, k1[\n\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k]; // set value (use one for pattern matrix)\n\n        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;\n      }\n    }\n\n    return a;\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\n\n  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1]; // density\n\n    var density = this.density(); // rows & columns\n\n    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n'; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1]; // loop k within [k0, k1[\n\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k]; // append value\n\n        str += '\\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');\n      }\n    }\n\n    return str;\n  };\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n\n\n  SparseMatrix.prototype.toString = function () {\n    return format(this.toArray());\n  };\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\n   */\n\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   * 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\n\n  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // number diagonal values\n\n    var n = Math.min(rows - kSub, columns - kSuper); // diagonal arrays\n\n    var values = [];\n    var index = [];\n    var ptr = []; // initial ptr value\n\n    ptr[0] = 0; // loop columns\n\n    for (var j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1]; // loop x within [k0, k1[\n\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x]; // check row\n\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]); // store row\n\n          index[values.length - 1] = i - kSub; // exit loop\n\n          break;\n        }\n      }\n    } // close ptr\n\n\n    ptr.push(values.length); // return matrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [n, 1]\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\n\n  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\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\n\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // map size & validate\n\n\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      } // validate arguments\n\n\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n\n      return s;\n    }); // validate k if any\n\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\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    } // equal signature to use\n\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, datatype);\n    }\n\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows and columns\n\n    var rows = size[0];\n    var columns = size[1]; // number of non-zero items\n\n    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n    var _value; // check value\n\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size(); // validate matrix\n\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      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    } // create arrays\n\n\n    var values = [];\n    var index = [];\n    var ptr = []; // loop items\n\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length); // diagonal index\n\n      var i = j - kSuper; // check we need to set diagonal value\n\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i); // check for zero\n\n\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub); // add value\n\n          values.push(v);\n        }\n      }\n    } // last value should be number of values\n\n\n    ptr.push(values.length); // create SparseMatrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [rows, columns]\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\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    } // check dimensions\n\n\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    } // validate index\n\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]); // swap rows\n\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); // return current instance\n\n\n    return this;\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\n\n  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1]; // loop\n\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\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\n\n  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // find value index @ x\n\n      var kx = _getValueIndex(x, k0, k1, index); // find value index @ x\n\n\n      var ky = _getValueIndex(y, k0, k1, index); // check both rows exist in matrix\n\n\n      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n        // swap values (check for pattern matrix)\n        if (values) {\n          var v = values[kx];\n          values[kx] = values[ky];\n          values[ky] = v;\n        } // next column\n\n\n        continue;\n      } // check x row exist & no y row\n\n\n      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n        // value @ x (check for pattern matrix)\n        var vx = values ? values[kx] : undefined; // insert value @ y\n\n        index.splice(ky, 0, y);\n\n        if (values) {\n          values.splice(ky, 0, vx);\n        } // remove value @ x (adjust array index if needed)\n\n\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        } // next column\n\n\n        continue;\n      } // check y row exist & no x row\n\n\n      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n        // value @ y (check for pattern matrix)\n        var vy = values ? values[ky] : undefined; // insert value @ x\n\n        index.splice(kx, 0, x);\n\n        if (values) {\n          values.splice(kx, 0, vy);\n        } // remove value @ y (adjust array index if needed)\n\n\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  };\n\n  return SparseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createMatrix = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n\n  /**\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\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function _() {\n      return _create([]);\n    },\n    string: function string(format) {\n      return _create([], format);\n    },\n    'string, string': function stringString(format, datatype) {\n      return _create([], format, datatype);\n    },\n    Array: function Array(data) {\n      return _create(data);\n    },\n    Matrix: function Matrix(data) {\n      return _create(data, data.storage());\n    },\n    'Array | Matrix, string': _create,\n    'Array | Matrix, string, string': _create\n  });\n  /**\n   * 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\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});","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';\nvar name = 'cbrt';\nvar dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];\nexport var createCbrt = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    isNegative,\n    unaryMinus,\n    matrix,\n    Complex,\n    BigNumber,\n    Fraction\n  } = _ref;\n\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    Complex: _cbrtComplex,\n    'Complex, boolean': _cbrtComplex,\n    BigNumber: function BigNumber(x) {\n      return x.cbrt();\n    },\n    Unit: _cbrtUnit,\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since cbrt(0) = 0\n      return deepMap(x, this, true);\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\n  function _cbrtComplex(x, allRoots) {\n    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers\n    var arg3 = x.arg() / 3;\n    var abs = x.abs(); // principal root:\n\n    var principal = new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp());\n\n    if (allRoots) {\n      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())];\n      return config.matrix === 'Array' ? all : matrix(all);\n    } else {\n      return principal;\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\n\n  function _cbrtUnit(x) {\n    if (x.value && isComplex(x.value)) {\n      var result = x.clone();\n      result.value = 1.0;\n      result = result.pow(1.0 / 3); // Compute the units\n\n      result.value = _cbrtComplex(x.value); // Compute the value\n\n      return result;\n    } else {\n      var negate = isNegative(x.value);\n\n      if (negate) {\n        x.value = unaryMinus(x.value);\n      } // TODO: create a helper function for this\n\n\n      var third;\n\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      var _result = x.pow(third);\n\n      if (negate) {\n        _result.value = unaryMinus(_result.value);\n      }\n\n      return _result;\n    }\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm01';\nvar dependencies = ['typed'];\nexport var createAlgorithm01 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // process data types\n\n    var dt = typeof adt === 'string' && adt === bdt ? adt : undefined; // callback function\n\n    var cf = dt ? typed.find(callback, [dt, dt]) : callback; // vars\n\n    var i, j; // result (DenseMatrix)\n\n    var cdata = []; // initialize c\n\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    } // workspace\n\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns in b\n\n    for (j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // update workspace\n\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // mark i as updated\n\n        w[i] = mark;\n      } // loop rows\n\n\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    } // return dense matrix\n\n\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm04';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm04 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspace\n\n    var xa = avalues && bvalues ? [] : undefined;\n    var xb = avalues && bvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // vars\n\n    var i, j, k, k0, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop A(:,j)\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // update c\n\n        cindex.push(i); // update workspace\n\n        wa[i] = mark; // check we need to process values\n\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      } // loop B(:,j)\n\n\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // check row exists in A\n\n        if (wa[i] === mark) {\n          // update record in xa @ i\n          if (xa) {\n            // invoke callback\n            var v = cf(xa[i], bvalues[k]); // check for zero\n\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); // update workspace\n\n          wb[i] = mark; // check we need to process values\n\n          if (xb) {\n            xb[i] = bvalues[k];\n          }\n        }\n      } // check we need to process values (non pattern matrix)\n\n\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]; // check workspace has value @ i\n\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i]; // increment pointer\n\n            k++;\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i]; // increment pointer\n\n            k++;\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1);\n          }\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm10';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm10 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n\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    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cdata = []; // workspaces\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k]; // update workspace\n\n        x[r] = avalues[k];\n        w[r] = mark;\n      } // loop rows\n\n\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        } // check sparse matrix has a value @ i,j\n\n\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    } // return dense matrix\n\n\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm13';\nvar dependencies = ['typed'];\nexport var createAlgorithm13 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b arrays\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // c arrays\n\n    var csize = []; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // validate each one of the dimension sizes\n\n\n    for (var s = 0; s < asize.length; s++) {\n      // must match\n      if (asize[s] !== bsize[s]) {\n        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n      } // update dimension in c\n\n\n      csize[s] = asize[s];\n    } // datatype\n\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // populate cdata, iterate through dimensions\n\n\n    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []; // c matrix\n\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    });\n  }; // recursive function\n\n  function _iterate(f, level, s, n, av, bv) {\n    // initialize array for this level\n    var cv = []; // check we reach the last level\n\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = f(av[i], bv[i]);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);\n      }\n    }\n\n    return cv;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'algorithm14';\nvar dependencies = ['typed'];\nexport var createAlgorithm14 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // populate cdata, iterate through dimensions\n\n\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []; // c matrix\n\n    return a.createDenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    });\n  }; // recursive function\n\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = []; // check we reach the last level\n\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);\n      }\n    }\n\n    return cv;\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';\nvar name = 'gcd';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];\nexport var createGcd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm04 = createAlgorithm04({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': gcdNumber,\n    'BigNumber, BigNumber': _gcdBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.gcd(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm10(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    },\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {\n      var res = this(a, b);\n\n      for (var i = 0; i < args.length; i++) {\n        res = this(res, args[i]);\n      }\n\n      return res;\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\n  function _gcdBigNumber(a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function gcd must be integer numbers');\n    } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n    var zero = new BigNumber(0);\n\n    while (!b.isZero()) {\n      var r = a.mod(b);\n      a = b;\n      b = r;\n    }\n\n    return a.lt(zero) ? a.neg() : a;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm02';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm02 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result (SparseMatrix)\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // loop columns in b\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k]; // update C(i,j)\n\n        var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // check for nonzero\n\n        if (!eq(cij, zero)) {\n          // push i & v\n          cindex.push(i);\n          cvalues.push(cij);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return sparseMatrix.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm03';\nvar dependencies = ['typed'];\nexport var createAlgorithm03 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result (DenseMatrix)\n\n\n    var cdata = []; // initialize dense matrix\n\n    for (var z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = [];\n    } // workspace\n\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns in b\n\n    for (var j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k]; // update workspace\n\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        w[i] = mark;\n      } // process workspace\n\n\n      for (var 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    } // return dense matrix\n\n\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm05';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm05 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspaces\n\n    var xa = cvalues ? [] : undefined;\n    var xb = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // vars\n\n    var i, j, k, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop values A(:,j)\n\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k]; // push index\n\n        cindex.push(i); // update workspace\n\n        wa[i] = mark; // check we need to process values\n\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      } // loop values B(:,j)\n\n\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k]; // check row existed in A\n\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i);\n        } // update workspace\n\n\n        wb[i] = mark; // check we need to process values\n\n        if (xb) {\n          xb[i] = bvalues[k];\n        }\n      } // check we need to process values (non pattern matrix)\n\n\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]; // marks\n\n          var wai = wa[i];\n          var wbi = wb[i]; // check Aij or Bij are nonzero\n\n          if (wai === mark || wbi === mark) {\n            // matrix values @ i,j\n            var va = wai === mark ? xa[i] : zero;\n            var vb = wbi === mark ? xb[i] : zero; // Cij\n\n            var vc = cf(va, vb); // check for zero\n\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc); // increment pointer\n\n              k++;\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1);\n            }\n          }\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm11';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm11 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k]; // invoke callback\n\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b); // check value is zero\n\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    } // update ptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return s.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm12';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm12 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n\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    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cdata = []; // workspaces\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k]; // update workspace\n\n        x[r] = avalues[k];\n        w[r] = mark;\n      } // loop rows\n\n\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        } // check sparse matrix has a value @ i,j\n\n\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    } // return dense matrix\n\n\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\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';\nvar name = 'mod';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createMod = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': modNumber,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      if (y.isNeg()) {\n        throw new Error('Cannot calculate mod for a negative divisor');\n      }\n\n      return y.isZero() ? x : x.mod(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      if (y.compare(0) < 0) {\n        throw new Error('Cannot calculate mod for a negative divisor');\n      } // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend\n\n\n      return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nimport { scatter } from '../../../utils/collection.js';\nvar name = 'algorithm06';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm06 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspaces\n\n    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var w = []; // marks indicating value in a given row has been updated\n\n    var u = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // scatter the values of A(:,j) into workspace\n\n      scatter(a, j, w, x, u, mark, cindex, cf); // scatter the values of B(:,j) into workspace\n\n      scatter(b, j, w, x, u, mark, cindex, cf); // check we need to process values (non pattern matrix)\n\n      if (x) {\n        // initialize first index in j\n        var k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          var i = cindex[k]; // check function was invoked on current row (Aij !=0 && Bij != 0)\n\n          if (u[i] === mark) {\n            // value @ i\n            var v = x[i]; // check for zero value\n\n            if (!eq(v, zero)) {\n              // push value\n              cvalues.push(v); // increment pointer\n\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        var p = cptr[j]; // loop index in j\n\n        while (p < cindex.length) {\n          // row\n          var r = cindex[p]; // check function was invoked on current row (Aij !=0 && Bij != 0)\n\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    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { 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';\nvar name = 'nthRoot';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber'];\nexport var createNthRoot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber: _BigNumber\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  var complexErr = '' + 'Complex number not supported in function nthRoot. ' + 'Use nthRoots instead.';\n  return typed(name, {\n    number: function number(x) {\n      return nthRootNumber(x, 2);\n    },\n    'number, number': nthRootNumber,\n    BigNumber: function BigNumber(x) {\n      return _bigNthRoot(x, new _BigNumber(2));\n    },\n    Complex: function Complex(x) {\n      throw new Error(complexErr);\n    },\n    'Complex, number': function ComplexNumber(x, y) {\n      throw new Error(complexErr);\n    },\n    'BigNumber, BigNumber': _bigNthRoot,\n    'Array | Matrix': function ArrayMatrix(x) {\n      return this(x, 2);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(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    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(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    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(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    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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\n  function _bigNthRoot(a, root) {\n    var precision = _BigNumber.precision;\n\n    var Big = _BigNumber.clone({\n      precision: precision + 2\n    });\n\n    var zero = new _BigNumber(0);\n    var one = new Big(1);\n    var inv = root.isNegative();\n\n    if (inv) {\n      root = root.neg();\n    }\n\n    if (root.isZero()) {\n      throw new Error('Root must be non-zero');\n    }\n\n    if (a.isNegative() && !root.abs().mod(2).equals(1)) {\n      throw new Error('Root must be odd when a is negative.');\n    } // edge cases zero and infinity\n\n\n    if (a.isZero()) {\n      return inv ? new Big(Infinity) : 0;\n    }\n\n    if (!a.isFinite()) {\n      return inv ? zero : a;\n    }\n\n    var x = a.abs().pow(one.div(root)); // If a < 0, we require that root is an odd integer,\n    // so (-1) ^ (1/root) = -1\n\n    x = a.isNeg() ? x.neg() : x;\n    return new _BigNumber((inv ? one.div(x) : x).toPrecision(precision));\n  }\n});\nexport var createNthRootNumber = /* #__PURE__ */factory(name, ['typed'], (_ref2) => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, {\n    number: nthRootNumber,\n    'number, number': nthRootNumber\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { xgcdNumber } from '../../plain/number/index.js';\nvar name = 'xgcd';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createXgcd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\n\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 numberNumber(a, b) {\n      var res = xgcdNumber(a, b);\n      return config.matrix === 'Array' ? res : matrix(res);\n    },\n    'BigNumber, BigNumber': _xgcdBigNumber // 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\n  function _xgcdBigNumber(a, b) {\n    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n    var // used to swap two variables\n    t;\n    var // quotient\n    q;\n    var // remainder\n    r;\n    var zero = new BigNumber(0);\n    var one = new BigNumber(1);\n    var x = zero;\n    var lastx = one;\n    var y = one;\n    var 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      t = x;\n      x = lastx.minus(q.times(x));\n      lastx = t;\n      t = y;\n      y = lasty.minus(q.times(y));\n      lasty = t;\n      a = b;\n      b = r;\n    }\n\n    var res;\n\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\n    return config.matrix === 'Array' ? res : matrix(res);\n  }\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';\nvar name = 'bitAnd';\nvar dependencies = ['typed', 'matrix', 'equalScalar'];\nexport var createBitAnd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': bitAndNumber,\n    'BigNumber, BigNumber': bitAndBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm07';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm07 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n\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    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // vars\n\n\n    var i, j; // result arrays\n\n    var cdata = []; // initialize c\n\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    } // workspaces\n\n\n    var xa = [];\n    var xb = []; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // scatter the values of A(:,j) into workspace\n\n      _scatter(a, j, wa, xa, mark); // scatter the values of B(:,j) into workspace\n\n\n      _scatter(b, j, wb, xb, mark); // loop rows\n\n\n      for (i = 0; i < rows; i++) {\n        // matrix values @ i,j\n        var va = wa[i] === mark ? xa[i] : zero;\n        var vb = wb[i] === mark ? xb[i] : zero; // invoke callback\n\n        cdata[i][j] = cf(va, vb);\n      }\n    } // return dense matrix\n\n\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    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // loop values in column j\n\n    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      var i = index[k]; // update workspace\n\n      w[i] = mark;\n      x[i] = values[k];\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';\nvar name = 'bitXor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix'];\nexport var createBitXor = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': bitXorNumber,\n    'BigNumber, BigNumber': bigBitXor,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'or';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createOr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': orNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return this(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'diag';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createDiag = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n\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    Array: function Array(x) {\n      return _diag(x, 0, arraySize(x), null);\n    },\n    'Array, number': function ArrayNumber(x, k) {\n      return _diag(x, k, arraySize(x), null);\n    },\n    'Array, BigNumber': function ArrayBigNumber(x, k) {\n      return _diag(x, k.toNumber(), arraySize(x), null);\n    },\n    'Array, string': function ArrayString(x, format) {\n      return _diag(x, 0, arraySize(x), format);\n    },\n    'Array, number, string': function ArrayNumberString(x, k, format) {\n      return _diag(x, k, arraySize(x), format);\n    },\n    'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), arraySize(x), format);\n    },\n    Matrix: function Matrix(x) {\n      return _diag(x, 0, x.size(), x.storage());\n    },\n    'Matrix, number': function MatrixNumber(x, k) {\n      return _diag(x, k, x.size(), x.storage());\n    },\n    'Matrix, BigNumber': function MatrixBigNumber(x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage());\n    },\n    'Matrix, string': function MatrixString(x, format) {\n      return _diag(x, 0, x.size(), format);\n    },\n    'Matrix, number, string': function MatrixNumberString(x, k, format) {\n      return _diag(x, k, x.size(), format);\n    },\n    'Matrix, BigNumber, string': function MatrixBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), x.size(), format);\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\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // check dimensions\n\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);\n\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper);\n    }\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    var ms = [l + kSub, l + kSuper];\n\n    if (format && format !== 'sparse' && format !== 'dense') {\n      throw new TypeError(\"Unknown matrix type \".concat(format, \"\\\"\"));\n    } // create diagonal matrix\n\n\n    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k); // check we need to return a matrix\n\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      var dm = x.diagonal(k); // check we need to return a matrix\n\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) {\n          return matrix(dm, format);\n        }\n\n        return dm;\n      }\n\n      return dm.valueOf();\n    } // vector size\n\n\n    var n = Math.min(s[0] - kSub, s[1] - kSuper); // diagonal values\n\n    var vector = []; // loop diagonal\n\n    for (var i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper];\n    } // check we need to return a matrix\n\n\n    return format !== null ? matrix(vector) : vector;\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';\nvar name = 'identity';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];\nexport var createIdentity = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n\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    string: function string(format) {\n      return matrix(format);\n    },\n    'number | BigNumber': function numberBigNumber(rows) {\n      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, string': function numberBigNumberString(rows, format) {\n      return _identity(rows, rows, format);\n    },\n    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(rows, cols) {\n      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, number | BigNumber, string': function numberBigNumberNumberBigNumberString(rows, cols, format) {\n      return _identity(rows, cols, format);\n    },\n    Array: function Array(size) {\n      return _identityVector(size);\n    },\n    'Array, string': function ArrayString(size, format) {\n      return _identityVector(size, format);\n    },\n    Matrix: function Matrix(size) {\n      return _identityVector(size.valueOf(), size.storage());\n    },\n    'Matrix, string': function MatrixString(size, format) {\n      return _identityVector(size.valueOf(), format);\n    }\n  });\n\n  function _identityVector(size, format) {\n    switch (size.length) {\n      case 0:\n        return format ? matrix(format) : [];\n\n      case 1:\n        return _identity(size[0], size[0], format);\n\n      case 2:\n        return _identity(size[0], size[1], format);\n\n      default:\n        throw new Error('Vector containing two values expected');\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\n\n  function _identity(rows, cols, format) {\n    // BigNumber constructor with the right precision\n    var Big = isBigNumber(rows) || isBigNumber(cols) ? BigNumber : null;\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\n    if (!isInteger(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n\n    var one = Big ? new BigNumber(1) : 1;\n    var defaultValue = Big ? new Big(0) : 0;\n    var size = [rows, cols]; // check we need to return a matrix\n\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\n      if (format === 'dense') {\n        return DenseMatrix.diagonal(size, one, 0, defaultValue);\n      }\n\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    } // create and resize array\n\n\n    var res = resize([], size, defaultValue); // fill in ones on the diagonal\n\n    var minimum = rows < cols ? rows : cols; // fill diagonal\n\n    for (var d = 0; d < minimum; d++) {\n      res[d][d] = one;\n    }\n\n    return res;\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';\nvar name = 'ones';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createOnes = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\n\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' ? _ones([]) : _ones([], 'default');\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 numberBigNumberString(size) {\n      var last = size[size.length - 1];\n\n      if (typeof last === 'string') {\n        var 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    Array: _ones,\n    Matrix: function Matrix(size) {\n      var format = size.storage();\n      return _ones(size.valueOf(), format);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(size, format) {\n      return _ones(size.valueOf(), format);\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\n  function _ones(size, format) {\n    var hasBigNumbers = _normalize(size);\n\n    var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;\n\n    _validate(size);\n\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n\n      return arr;\n    }\n  } // replace BigNumbers with numbers, returns true if size contained BigNumbers\n\n\n  function _normalize(size) {\n    var 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  } // validate arguments\n\n\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});","import { reshape as arrayReshape } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'reshape';\nvar dependencies = ['typed', 'isInteger', 'matrix'];\nexport var createReshape = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n\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    'Matrix, Array': function MatrixArray(x, sizes) {\n      return x.reshape(sizes);\n    },\n    'Array, Array': function ArrayArray(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});","import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { noMatrix } from '../../utils/noop.js';\nvar name = 'size';\nvar dependencies = ['typed', 'config', '?matrix'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix\n  } = _ref;\n\n  /**\n   * Calculate the size of a matrix or scalar.\n   *\n   * Syntax:\n   *\n   *     math.size(x)\n   *\n   * Examples:\n   *\n   *     math.size(2.3)                  // returns []\n   *     math.size('hello world')        // returns [11]\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.size(A)                    // returns [2, 3]\n   *     math.size(math.range(1,6))      // returns [5]\n   *\n   * See also:\n   *\n   *     count, resize, squeeze, subset\n   *\n   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix\n   * @return {Array | Matrix} A vector with size of `x`.\n   */\n  return typed(name, {\n    Matrix: function Matrix(x) {\n      return x.create(x.size());\n    },\n    Array: arraySize,\n    string: function string(x) {\n      return config.matrix === 'Array' ? [x.length] : matrix([x.length]);\n    },\n    'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {\n      // scalar\n      return config.matrix === 'Array' ? [] : matrix ? matrix([]) : noMatrix();\n    }\n  });\n});","import { isBigNumber } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { resize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'zeros';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createZeros = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\n\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' ? _zeros([]) : _zeros([], 'default');\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 numberBigNumberString(size) {\n      var last = size[size.length - 1];\n\n      if (typeof last === 'string') {\n        var 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    Array: _zeros,\n    Matrix: function Matrix(size) {\n      var format = size.storage();\n      return _zeros(size.valueOf(), format);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(size, format) {\n      return _zeros(size.valueOf(), format);\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\n  function _zeros(size, format) {\n    var hasBigNumbers = _normalize(size);\n\n    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;\n\n    _validate(size);\n\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n\n      return arr;\n    }\n  } // replace BigNumbers with numbers, returns true if size contained BigNumbers\n\n\n  function _normalize(size) {\n    var 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  } // validate arguments\n\n\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}); // TODO: zeros contains almost the same code as ones. Reuse this?","import { factory } from '../../utils/factory.js';\nvar name = 'hex';\nvar dependencies = ['typed', 'format'];\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 */\n\nexport var createHex = factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'hex'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'hex',\n        wordSize: wordSize\n      });\n    }\n  });\n});","function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _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; }\n\nimport { 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';\nvar NO_INT = 'Number of decimals in function round must be an integer';\nvar name = 'round';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];\nexport var createRound = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    BigNumber,\n    DenseMatrix\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, _objectSpread(_objectSpread({}, roundNumberSignatures), {}, {\n    Complex: function Complex(x) {\n      return x.round();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.round(n);\n    },\n    'Complex, BigNumber': function ComplexBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      var _n = n.toNumber();\n\n      return x.round(_n);\n    },\n    'number, BigNumber': function numberBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      return new BigNumber(x).toDecimalPlaces(n.toNumber());\n    },\n    BigNumber: function BigNumber(x) {\n      return x.toDecimalPlaces(0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.toDecimalPlaces(n.toNumber());\n    },\n    Fraction: function Fraction(x) {\n      return x.round();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.round(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, this, true);\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | Complex | BigNumber, SparseMatrix': function numberComplexBigNumberSparseMatrix(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\n      return algorithm12(y, x, this, true);\n    },\n    'number | Complex | BigNumber, DenseMatrix': function numberComplexBigNumberDenseMatrix(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\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  }));\n});\nvar roundNumberSignatures = {\n  number: roundNumber,\n  'number, number': function numberNumber(x, n) {\n    if (!isInteger(n)) {\n      throw new TypeError(NO_INT);\n    }\n\n    if (n < 0 || n > 15) {\n      throw new Error('Number of decimals in function round must be in te range of 0-15');\n    }\n\n    return roundNumber(x, n);\n  }\n};\nexport var createRoundNumber = /* #__PURE__ */factory(name, ['typed'], (_ref2) => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, roundNumberSignatures);\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm08';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm08 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!avalues || !bvalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrices');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // workspace\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // vars\n\n    var k, k0, k1, i; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop values in a\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // mark workspace\n\n        w[i] = mark; // set value\n\n        x[i] = avalues[k]; // add index\n\n        cindex.push(i);\n      } // loop values in b\n\n\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // check value exists in workspace\n\n        if (w[i] === mark) {\n          // evaluate callback\n          x[i] = cf(x[i], bvalues[k]);\n        }\n      } // initialize first index in j\n\n\n      k = cptr[j]; // loop index in j\n\n      while (k < cindex.length) {\n        // row\n        i = cindex[k]; // value @ i\n\n        var v = x[i]; // check for zero value\n\n        if (!eq(v, zero)) {\n          // push value\n          cvalues.push(v); // increment pointer\n\n          k++;\n        } else {\n          // remove value @ i, do not increment pointer\n          cindex.splice(k, 1);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\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';\nvar name = 'leftShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nexport var createLeftShift = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm08 = createAlgorithm08({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': leftShiftNumber,\n    'BigNumber, BigNumber': leftShiftBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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';\nvar name = 'rightLogShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nexport var createRightLogShift = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm08 = createAlgorithm08({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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    'number, number': rightLogShiftNumber,\n    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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';\nvar name = 'compare';\nvar dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix'];\nexport var createCompare = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    equalScalar,\n    matrix,\n    BigNumber,\n    Fraction,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y ? 0 : x > y ? 1 : -1;\n    },\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return bigNearlyEqual(x, y, config.epsilon) ? new BigNumber(0) : new BigNumber(x.cmp(y));\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return new Fraction(x.compare(y));\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createCompareNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;\n    }\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';\nvar name = 'compareText';\nvar dependencies = ['typed', 'matrix'];\nexport var createCompareText = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': _compareText,\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, _compareText);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, _compareText, false);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, _compareText, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _compareText, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, _compareText, true).valueOf();\n    }\n  });\n});\nexport var createCompareTextNumber = /* #__PURE__ */factory(name, ['typed'], (_ref2) => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, {\n    'any, any': _compareText\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';\nvar name = 'smaller';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createSmaller = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x < y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x < y && !nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) === -1;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createSmallerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x < y && !nearlyEqual(x, y, config.epsilon);\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';\nvar name = 'larger';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createLarger = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x > y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x > y && !nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) === 1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createLargerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x > y && !nearlyEqual(x, y, config.epsilon);\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';\nvar name = 'unequal';\nvar dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix'];\nexport var createUnequal = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    equalScalar,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('unequal', {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y !== null;\n      }\n\n      if (y === null) {\n        return x !== null;\n      }\n\n      if (x === undefined) {\n        return y !== undefined;\n      }\n\n      if (y === undefined) {\n        return x !== undefined;\n      }\n\n      return _unequal(x, y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, _unequal);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, _unequal, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, _unequal, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, _unequal);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, _unequal, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, _unequal, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, _unequal, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, _unequal, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _unequal, false).valueOf();\n    },\n    'any, Array': function anyArray(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});\nexport var createUnequalNumber = factory(name, ['typed', 'equalScalar'], (_ref2) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref2;\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y !== null;\n      }\n\n      if (y === null) {\n        return x !== null;\n      }\n\n      if (x === undefined) {\n        return y !== undefined;\n      }\n\n      if (y === undefined) {\n        return x !== undefined;\n      }\n\n      return !equalScalar(x, y);\n    }\n  });\n});","import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ImmutableDenseMatrix';\nvar dependencies = ['smaller', 'DenseMatrix'];\nexport var createImmutableDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    smaller,\n    DenseMatrix\n  } = _ref;\n\n  function ImmutableDenseMatrix(data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n\n    if (isMatrix(data) || isArray(data)) {\n      // use DenseMatrix implementation\n      var matrix = new DenseMatrix(data, datatype); // internal structures\n\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   * Attach type information\n   */\n\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;\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\n  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n        {\n          // use base implementation\n          var m = DenseMatrix.prototype.subset.call(this, index); // check result is a matrix\n\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\n          return m;\n        }\n      // intentional fall through\n\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   * 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\n\n  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance');\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\n\n  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance');\n  };\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n\n\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');\n  };\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n\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   * Get a JSON representation of the matrix\n   * @returns {Object}\n   */\n\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   * 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\n\n  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json);\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\n\n  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');\n  };\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n\n\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      var m = null; // compute min\n\n      this.forEach(function (v) {\n        if (m === null || smaller(v, m)) {\n          m = v;\n        }\n      });\n      this._min = m !== null ? m : undefined;\n    }\n\n    return this._min;\n  };\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n\n\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      var m = null; // compute max\n\n      this.forEach(function (v) {\n        if (m === null || smaller(m, v)) {\n          m = v;\n        }\n      });\n      this._max = m !== null ? m : undefined;\n    }\n\n    return this._max;\n  };\n\n  return ImmutableDenseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'FibonacciHeap';\nvar dependencies = ['smaller', 'larger'];\nexport var createFibonacciHeapClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    smaller,\n    larger\n  } = _ref;\n  var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);\n  /**\n   * Fibonacci Heap implementation, used interally for Matrix math.\n   * @class FibonacciHeap\n   * @constructor FibonacciHeap\n   */\n\n  function FibonacciHeap() {\n    if (!(this instanceof FibonacciHeap)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // initialize fields\n\n\n    this._minimum = null;\n    this._size = 0;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  FibonacciHeap.prototype.type = 'FibonacciHeap';\n  FibonacciHeap.prototype.isFibonacciHeap = true;\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\n  FibonacciHeap.prototype.insert = function (key, value) {\n    // create node\n    var node = {\n      key: key,\n      value: value,\n      degree: 0\n    }; // check we have a node in the minimum\n\n    if (this._minimum) {\n      // minimum node\n      var minimum = this._minimum; // update left & right of node\n\n      node.left = minimum;\n      node.right = minimum.right;\n      minimum.right = node;\n      node.right.left = node; // update minimum node in heap if needed\n\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; // this is the first node\n\n      this._minimum = node;\n    } // increment number of nodes in heap\n\n\n    this._size++; // return node\n\n    return node;\n  };\n  /**\n   * Returns the number of nodes in heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.size = function () {\n    return this._size;\n  };\n  /**\n   * Removes all elements from this heap.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.clear = function () {\n    this._minimum = null;\n    this._size = 0;\n  };\n  /**\n   * Returns true if the heap is empty, otherwise false.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.isEmpty = function () {\n    return this._size === 0;\n  };\n  /**\n   * Extracts the node with minimum key from heap. Amortized running\n   * time: O(log n).\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.extractMinimum = function () {\n    // node to remove\n    var node = this._minimum; // check we have a minimum\n\n    if (node === null) {\n      return node;\n    } // current minimum\n\n\n    var minimum = this._minimum; // get number of children\n\n    var numberOfChildren = node.degree; // pointer to the first child\n\n    var x = node.child; // for each child of node do...\n\n    while (numberOfChildren > 0) {\n      // store node in right side\n      var tempRight = x.right; // remove x from child list\n\n      x.left.right = x.right;\n      x.right.left = x.left; // add x to root list of heap\n\n      x.left = minimum;\n      x.right = minimum.right;\n      minimum.right = x;\n      x.right.left = x; // set Parent[x] to null\n\n      x.parent = null;\n      x = tempRight;\n      numberOfChildren--;\n    } // remove node from root list of heap\n\n\n    node.left.right = node.right;\n    node.right.left = node.left; // update minimum\n\n    if (node === node.right) {\n      // empty\n      minimum = null;\n    } else {\n      // update minimum\n      minimum = node.right; // we need to update the pointer to the root with minimum key\n\n      minimum = _findMinimumNode(minimum, this._size);\n    } // decrement size of heap\n\n\n    this._size--; // update minimum\n\n    this._minimum = minimum; // return node\n\n    return node;\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\n\n  FibonacciHeap.prototype.remove = function (node) {\n    // decrease key value\n    this._minimum = _decreaseKey(this._minimum, node, -1); // remove the smallest\n\n    this.extractMinimum();\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\n\n  function _decreaseKey(minimum, node, key) {\n    // set node key\n    node.key = key; // get parent node\n\n    var parent = node.parent;\n\n    if (parent && smaller(node.key, parent.key)) {\n      // remove node from parent\n      _cut(minimum, node, parent); // remove all nodes from parent to the root parent\n\n\n      _cascadingCut(minimum, parent);\n    } // update minimum node if needed\n\n\n    if (smaller(node.key, minimum.key)) {\n      minimum = node;\n    } // return minimum\n\n\n    return minimum;\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\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--; // reset y.child if necessary\n\n    if (parent.child === node) {\n      parent.child = node.right;\n    } // remove child if degree is 0\n\n\n    if (parent.degree === 0) {\n      parent.child = null;\n    } // add node to root list of heap\n\n\n    node.left = minimum;\n    node.right = minimum.right;\n    minimum.right = node;\n    node.right.left = node; // set parent[node] to null\n\n    node.parent = null; // set mark[node] to false\n\n    node.mark = false;\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\n\n  function _cascadingCut(minimum, node) {\n    // store parent node\n    var parent = node.parent; // if there's a parent...\n\n    if (!parent) {\n      return;\n    } // if node is unmarked, set it marked\n\n\n    if (!node.mark) {\n      node.mark = true;\n    } else {\n      // it's marked, cut it from parent\n      _cut(minimum, node, parent); // cut its parent as well\n\n\n      _cascadingCut(parent);\n    }\n  }\n  /**\n   * Make the first node a child of the second one. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n\n\n  var _linkNodes = function _linkNodes(node, parent) {\n    // remove node from root list of heap\n    node.left.right = node.right;\n    node.right.left = node.left; // make node a Child of parent\n\n    node.parent = parent;\n\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    } // increase degree[parent]\n\n\n    parent.degree++; // set mark[node] false\n\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    var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; // create list with initial capacity\n\n    var array = new Array(arraySize); // find the number of root nodes.\n\n    var numRoots = 0;\n    var x = minimum;\n\n    if (x) {\n      numRoots++;\n      x = x.right;\n\n      while (x !== minimum) {\n        numRoots++;\n        x = x.right;\n      }\n    } // vars\n\n\n    var y; // For each node in root list do...\n\n    while (numRoots > 0) {\n      // access this node's degree..\n      var d = x.degree; // get next node\n\n      var next = x.right; // check if there is a node already in array with the same degree\n\n      while (true) {\n        // get node with the same degree is any\n        y = array[d];\n\n        if (!y) {\n          break;\n        } // make one node with the same degree a child of the other, do this based on the key value.\n\n\n        if (larger(x.key, y.key)) {\n          var temp = y;\n          y = x;\n          x = temp;\n        } // make y a child of x\n\n\n        _linkNodes(y, x); // we have handled this degree, go to next one.\n\n\n        array[d] = null;\n        d++;\n      } // save this node for later when we might encounter another of the same degree.\n\n\n      array[d] = x; // move forward through list.\n\n      x = next;\n      numRoots--;\n    } // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].\n\n\n    minimum = null; // loop nodes in array\n\n    for (var i = 0; i < arraySize; i++) {\n      // get current node\n      y = array[i];\n\n      if (!y) {\n        continue;\n      } // check if we have a linked list\n\n\n      if (minimum) {\n        // First remove node from root list.\n        y.left.right = y.right;\n        y.right.left = y.left; // now add to root list, again.\n\n        y.left = minimum;\n        y.right = minimum.right;\n        minimum.right = y;\n        y.right.left = y; // check if this is a new min.\n\n        if (smaller(y.key, minimum.key)) {\n          minimum = y;\n        }\n      } else {\n        minimum = y;\n      }\n    }\n\n    return minimum;\n  }\n\n  return FibonacciHeap;\n}, {\n  isClass: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'sparse';\nvar dependencies = ['typed', 'SparseMatrix'];\nexport var createSparse = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    SparseMatrix\n  } = _ref;\n\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    string: function string(datatype) {\n      return new SparseMatrix([], datatype);\n    },\n    'Array | Matrix': function ArrayMatrix(data) {\n      return new SparseMatrix(data);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(data, datatype) {\n      return new SparseMatrix(data, datatype);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { acothNumber } from '../../plain/number/index.js';\nvar name = 'acoth';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAcoth = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x >= 1 || x <= -1 || config.predictable) {\n        return acothNumber(x);\n      }\n\n      return new Complex(x, 0).acoth();\n    },\n    Complex: function Complex(x) {\n      return x.acoth();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).atanh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm09';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm09 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n\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    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // workspaces\n\n    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var w = []; // vars\n\n    var i, j, k, k0, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // column mark\n\n      var mark = j + 1; // check we need to process values\n\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]; // update workspace\n\n          w[i] = mark;\n          x[i] = bvalues[k];\n        }\n      } // loop A(:,j)\n\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // check we need to process values\n\n        if (x) {\n          // b value @ i,j\n          var vb = w[i] === mark ? x[i] : zero; // invoke f\n\n          var vc = cf(avalues[k], vb); // check zero value\n\n          if (!eq(vc, zero)) {\n            // push index\n            cindex.push(i); // push value\n\n            cvalues.push(vc);\n          }\n        } else {\n          // push index\n          cindex.push(i);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { 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';\nvar name = 'atan2';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];\nexport var createAtan2 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber,\n    DenseMatrix\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm09 = createAlgorithm09({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': Math.atan2,\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    'BigNumber, BigNumber': function BigNumberBigNumber(y, x) {\n      return BigNumber.atan2(y, x);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm09(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      // mind the order of y and x!\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // mind the order of y and x\n      return algorithm12(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // mind the order of y and x\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { secNumber } from '../../plain/number/index.js';\nvar name = 'sec';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createSec = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.sec();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.cos());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sec is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\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';\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];\nexport var createAdd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    equalScalar,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm04 = createAlgorithm04({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, extend({\n    // we extend the signatures of addScalar with signatures dealing with matrices\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, addScalar);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, addScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, addScalar, true);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, addScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, addScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, y, addScalar, false);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, addScalar, true);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, addScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, addScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, addScalar, true).valueOf();\n    },\n    'any, any': addScalar,\n    'any, any, ...any': function anyAnyAny(x, y, rest) {\n      var result = this(x, y);\n\n      for (var i = 0; i < rest.length; i++) {\n        result = this(result, rest[i]);\n      }\n\n      return result;\n    }\n  }, addScalar.signatures));\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'dot';\nvar dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];\nexport var createDot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    multiplyScalar,\n    conj,\n    size\n  } = _ref;\n\n  /**\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    var xSize = _size(x);\n\n    var ySize = _size(y);\n\n    var 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    return xLen;\n  }\n\n  function _denseDot(a, b) {\n    var N = _validateDim(a, b);\n\n    var adata = isMatrix(a) ? a._data : a;\n    var adt = isMatrix(a) ? a._datatype : undefined;\n    var bdata = isMatrix(b) ? b._data : b;\n    var bdt = isMatrix(b) ? b._datatype : undefined; // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n\n    var aIsColumn = _size(a).length === 2;\n    var bIsColumn = _size(b).length === 2;\n    var add = addScalar;\n    var mul = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      var dt = adt; // find signatures that matches (dt, dt)\n\n      add = typed.find(addScalar, [dt, dt]);\n      mul = typed.find(multiplyScalar, [dt, dt]);\n    } // both vectors 1-dimensional\n\n\n    if (!aIsColumn && !bIsColumn) {\n      var c = mul(conj(adata[0]), bdata[0]);\n\n      for (var i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i]));\n      }\n\n      return c;\n    } // a is 1-dim, b is column\n\n\n    if (!aIsColumn && bIsColumn) {\n      var _c = mul(conj(adata[0]), bdata[0][0]);\n\n      for (var _i = 1; _i < N; _i++) {\n        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));\n      }\n\n      return _c;\n    } // a is column, b is 1-dim\n\n\n    if (aIsColumn && !bIsColumn) {\n      var _c2 = mul(conj(adata[0][0]), bdata[0]);\n\n      for (var _i2 = 1; _i2 < N; _i2++) {\n        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));\n      }\n\n      return _c2;\n    } // both vectors are column\n\n\n    if (aIsColumn && bIsColumn) {\n      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);\n\n      for (var _i3 = 1; _i3 < N; _i3++) {\n        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));\n      }\n\n      return _c3;\n    }\n  }\n\n  function _sparseDot(x, y) {\n    _validateDim(x, y);\n\n    var xindex = x._index;\n    var xvalues = x._values;\n    var yindex = y._index;\n    var yvalues = y._values; // TODO optimize add & mul using datatype\n\n    var c = 0;\n    var add = addScalar;\n    var mul = multiplyScalar;\n    var i = 0;\n    var j = 0;\n\n    while (i < xindex.length && j < yindex.length) {\n      var I = xindex[i];\n      var J = yindex[j];\n\n      if (I < J) {\n        i++;\n        continue;\n      }\n\n      if (I > J) {\n        j++;\n        continue;\n      }\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  } // TODO remove this once #1771 is fixed\n\n\n  function _size(x) {\n    return isMatrix(x) ? x.size() : size(x);\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'composition';\nvar dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];\nexport var createComposition = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    combinations,\n    isPositive,\n    isNegative,\n    isInteger,\n    larger\n  } = _ref;\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 numberBigNumberNumberBigNumber(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});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isZeroNumber } from '../../plain/number/index.js';\nvar name = 'isZero';\nvar dependencies = ['typed'];\nexport var createIsZero = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    BigNumber: function BigNumber(x) {\n      return x.isZero();\n    },\n    Complex: function Complex(x) {\n      return x.re === 0 && x.im === 0;\n    },\n    Fraction: function Fraction(x) {\n      return x.d === 1 && x.n === 0;\n    },\n    Unit: function Unit(x) {\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { absNumber } from '../../plain/number/index.js';\nvar name = 'abs';\nvar dependencies = ['typed'];\nexport var createAbs = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.abs();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.abs();\n    },\n    Fraction: function Fraction(x) {\n      return x.abs();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since abs(0) = 0\n      return deepMap(x, this, true);\n    },\n    Unit: function Unit(x) {\n      return x.abs();\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';\nvar name = 'floor';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];\nexport var createFloor = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('floor', {\n    number: function number(x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return Math.floor(x);\n      }\n    },\n    'number, number': function numberNumber(x, n) {\n      if (nearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        var [number, exponent] = \"\".concat(x, \"e\").split('e');\n        var result = Math.floor(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n        [number, exponent] = \"\".concat(result, \"e\").split('e');\n        return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n      }\n    },\n    Complex: function Complex(x) {\n      return x.floor();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      return x.floor(n);\n    },\n    BigNumber: function BigNumber(x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.floor();\n      }\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(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    Fraction: function Fraction(x) {\n      return x.floor();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      return x.floor(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, this, true);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => this(i, n), true);\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'multiply';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];\nexport var createMultiply = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    multiplyScalar,\n    equalScalar,\n    dot\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    typed\n  });\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\n            break;\n\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\n            break;\n\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n\n        break;\n\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\n            break;\n\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\n            break;\n\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n\n        break;\n\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   * 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\n\n  function _multiplyVectorVector(a, b, n) {\n    // check empty vector\n    if (n === 0) {\n      throw new Error('Cannot multiply two empty vectors');\n    }\n\n    return dot(a, b);\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\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\n    return _multiplyVectorDenseMatrix(a, b);\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\n\n  function _multiplyVectorDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // rows & columns\n\n    var alength = asize[0];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix columns\n\n    for (var j = 0; j < bcolumns; j++) {\n      // sum (do not initialize it with zero)\n      var sum = mf(adata[0], bdata[0][j]); // loop vector\n\n      for (var i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]));\n      }\n\n      c[j] = sum;\n    } // return matrix\n\n\n    return a.createDenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: dt\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\n\n  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\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\n\n  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  });\n  /**\n   * 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\n\n  function _multiplyDenseMatrixVector(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = asize[0];\n    var acolumns = asize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix a rows\n\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i]; // sum (do not initialize it with zero)\n\n      var sum = mf(row[0], bdata[0]); // loop matrix a columns\n\n      for (var j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]));\n      }\n\n      c[i] = sum;\n    } // return matrix\n\n\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: dt\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\n\n  function _multiplyDenseMatrixDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = asize[0];\n    var acolumns = asize[1];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix a rows\n\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i]; // initialize row array\n\n      c[i] = []; // loop matrix b columns\n\n      for (var j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        var sum = mf(row[0], bdata[0][j]); // loop matrix a columns\n\n        for (var x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]));\n        }\n\n        c[i][j] = sum;\n      }\n    } // return matrix\n\n\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: dt\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\n\n  function _multiplyDenseMatrixSparseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b sparse\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate b matrix\n\n    if (!bvalues) {\n      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n    } // rows & columns\n\n\n    var arows = asize[0];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // result\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = b.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // indeces in column jb\n\n      var kb0 = bptr[jb];\n      var kb1 = bptr[jb + 1]; // do not process column jb if no data exists\n\n      if (kb1 > kb0) {\n        // last row mark processed\n        var last = 0; // loop a rows\n\n        for (var i = 0; i < arows; i++) {\n          // column mark\n          var mark = i + 1; // C[i, jb]\n\n          var cij = void 0; // values in b column j\n\n          for (var kb = kb0; kb < kb1; kb++) {\n            // row\n            var ib = bindex[kb]; // check value has been initialized\n\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb]); // update mark\n\n              last = mark;\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n            }\n          } // check column has been processed and value != 0\n\n\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i);\n            cvalues.push(cij);\n          }\n        }\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\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\n\n  function _multiplySparseMatrixVector(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // validate a matrix\n\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    } // b dense\n\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var brows = b._size[0]; // result\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // workspace\n\n\n    var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // update ptr\n\n    cptr[0] = 0; // rows in b\n\n    for (var ib = 0; ib < brows; ib++) {\n      // b[ib]\n      var vbi = bdata[ib]; // check b[ib] != 0, avoid loops\n\n      if (!eq(vbi, zero)) {\n        // A values & index in ib column\n        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n          // a row\n          var ia = aindex[ka]; // check value exists in current j\n\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true; // add i to pattern of C\n\n            cindex.push(ia); // x(ia) = A\n\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    } // copy values from x to column jb of c\n\n\n    for (var p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      var ic = cindex[p]; // copy value\n\n      cvalues[p] = x[ic];\n    } // update ptr\n\n\n    cptr[1] = cindex.length; // return sparse matrix\n\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: dt\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\n\n  function _multiplySparseMatrixDenseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // validate a matrix\n\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    } // b dense\n\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var brows = b._size[0];\n    var bcolumns = b._size[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // result\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // workspace\n\n    var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // mark in workspace for current column\n\n      var mark = jb + 1; // rows in jb\n\n      for (var ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        var vbij = bdata[ib][jb]; // check b[ib, jb] != 0, avoid loops\n\n        if (!eq(vbij, zero)) {\n          // A values & index in ib column\n          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // a row\n            var ia = aindex[ka]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia); // x(ia) = A\n\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      } // copy values from x to column jb of c\n\n\n      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n        // row\n        var ic = cindex[p]; // copy value\n\n        cvalues[p] = x[ic];\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\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\n\n  function _multiplySparseMatrixSparseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // b sparse\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var bcolumns = b._size[1]; // flag indicating both matrices (a & b) contain data\n\n    var values = avalues && bvalues; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // workspace\n\n    var x = values ? [] : undefined; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // variables\n\n    var ka, ka0, ka1, kb, kb0, kb1, ia, ib; // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // mark in workspace for current column\n\n      var mark = jb + 1; // B values & index in j\n\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb]; // check we need to process values\n\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]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia); // x(ia) = A\n\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]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia);\n            }\n          }\n        }\n      } // check we need to process matrix values (pattern matrix)\n\n\n      if (values) {\n        // copy values from x to column jb of c\n        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n          // row\n          var ic = cindex[p]; // copy value\n\n          cvalues[p] = x[ic];\n        }\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\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\n\n  return typed(name, extend({\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n    'Array, Array': function ArrayArray(x, y) {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y)); // use dense matrix implementation\n\n\n      var m = this(matrix(x), matrix(y)); // return array or scalar\n\n      return isMatrix(m) ? m.valueOf() : m;\n    },\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // dimensions\n      var xsize = x.size();\n      var ysize = y.size(); // check dimensions\n\n      _validateMatrixDimensions(xsize, ysize); // process dimensions\n\n\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        } // Vector * Matrix\n\n\n        return _multiplyVectorMatrix(x, y);\n      } // process y dimensions\n\n\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y);\n      } // Matrix * Matrix\n\n\n      return _multiplyMatrixMatrix(x, y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use Matrix * Matrix implementation\n      return this(x, matrix(y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use Matrix * Matrix implementation\n      return this(matrix(x, y.storage()), y);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();\n    },\n    'any, any': multiplyScalar,\n    'any, any, ...any': function anyAnyAny(x, y, rest) {\n      var result = this(x, y);\n\n      for (var i = 0; i < rest.length; i++) {\n        result = this(result, rest[i]);\n      }\n\n      return result;\n    }\n  }, multiplyScalar.signatures));\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';\nvar name = 'dotMultiply';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar'];\nexport var createDotMultiply = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    multiplyScalar\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm09 = createAlgorithm09({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': multiplyScalar,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm09(x, y, multiplyScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, multiplyScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, multiplyScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 're';\nvar dependencies = ['typed'];\nexport var createRe = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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 number(x) {\n      return x;\n    },\n    BigNumber: function BigNumber(x) {\n      return x;\n    },\n    Complex: function Complex(x) {\n      return x.re;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { clone } from '../../utils/object.js';\nimport { flatten as flattenArray } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'flatten';\nvar dependencies = ['typed', 'matrix'];\nexport var createFlatten = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\n  /**\n   * Flatten a multi dimensional matrix into a single dimensional matrix.\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 Array(x) {\n      return flattenArray(clone(x));\n    },\n    Matrix: function Matrix(x) {\n      var flat = flattenArray(clone(x.toArray())); // TODO: return the same matrix type as x\n\n      return matrix(flat);\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  this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';\n  this.stack = new Error().stack;\n}\nArgumentsError.prototype = new Error();\nArgumentsError.prototype.constructor = Error;\nArgumentsError.prototype.name = 'ArgumentsError';\nArgumentsError.prototype.isArgumentsError = true;","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';\nvar name = 'resize';\nvar dependencies = ['config', 'matrix'];\nexport var createResize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    matrix\n  } = _ref;\n\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    } // check x is a Matrix\n\n\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    } // check result should be a matrix\n\n\n    var 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\n      x = clone(x);\n      var res = arrayResize(x, size, defaultValue);\n      return asMatrix ? matrix(res) : res;\n    }\n  };\n  /**\n   * Resize a string\n   * @param {string} str\n   * @param {number[]} size\n   * @param {string} [defaultChar=' ']\n   * @private\n   */\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\n    var len = size[0];\n\n    if (typeof len !== 'number' || !isInteger(len)) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n\n    if (str.length > len) {\n      return str.substring(0, len);\n    } else if (str.length < len) {\n      var res = str;\n\n      for (var i = 0, ii = len - str.length; i < ii; i++) {\n        res += defaultChar;\n      }\n\n      return res;\n    } else {\n      return str;\n    }\n  }\n});","import { clone } from '../../utils/object.js';\nimport { squeeze as arraySqueeze } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'squeeze';\nvar dependencies = ['typed', 'matrix'];\nexport var createSqueeze = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\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 Array(x) {\n      return arraySqueeze(clone(x));\n    },\n    Matrix: function Matrix(x) {\n      var res = arraySqueeze(x.toArray()); // FIXME: return the same type of matrix as the input\n\n      return Array.isArray(res) ? matrix(res) : res;\n    },\n    any: function any(x) {\n      // scalar\n      return clone(x);\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';\nvar name = 'to';\nvar dependencies = ['typed', 'matrix'];\nexport var createTo = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'Unit, Unit | string': function UnitUnitString(x, unit) {\n      return x.to(unit);\n    },\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'Matrix, any': function MatrixAny(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(x, y, this, false);\n    },\n    'any, Matrix': function anyMatrix(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'pow';\nvar dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'fraction', 'number', 'Complex'];\nexport var createPow = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    identity,\n    multiply,\n    matrix,\n    number,\n    fraction,\n    Complex\n  } = _ref;\n\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    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.pow(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(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    'Fraction, Fraction': function FractionFraction(x, y) {\n      if (y.d !== 1) {\n        if (config.predictable) {\n          throw new Error('Function pow does not support non-integer exponents for fractions.');\n        } else {\n          return _pow(x.valueOf(), y.valueOf());\n        }\n      } else {\n        return x.pow(y);\n      }\n    },\n    'Array, number': _powArray,\n    'Array, BigNumber': function ArrayBigNumber(x, y) {\n      return _powArray(x, y.toNumber());\n    },\n    'Matrix, number': _powMatrix,\n    'Matrix, BigNumber': function MatrixBigNumber(x, y) {\n      return _powMatrix(x, y.toNumber());\n    },\n    'Unit, number | BigNumber': function UnitNumberBigNumber(x, y) {\n      return x.pow(y);\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\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        var yFrac = fraction(y);\n        var yNum = number(yFrac);\n\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) {// fraction() throws an error if y is Infinity, etc.\n      } // Unable to express y as a fraction, so continue on\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\n\n    if (config.predictable && (x < -1 && y === Infinity || 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      // x^Infinity === 0 if -1 < x < 1\n      // A real number 0 is returned instead of complex(0)\n      if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n        return 0;\n      }\n\n      return new Complex(x, 0).pow(y, 0);\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\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    } // verify that A is a 2 dimensional square matrix\n\n\n    var s = size(x);\n\n    if (s.length !== 2) {\n      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');\n    }\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    var res = identity(s[0]).valueOf();\n    var px = x;\n\n    while (y >= 1) {\n      if ((y & 1) === 1) {\n        res = multiply(px, res);\n      }\n\n      y >>= 1;\n      px = multiply(px, px);\n    }\n\n    return res;\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\n\n  function _powMatrix(x, y) {\n    return matrix(_powArray(x.valueOf(), y));\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';\nvar name = 'dotPow';\nvar dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix'];\nexport var createDotPow = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equalScalar,\n    matrix,\n    pow,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': pow,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, pow, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, pow, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, pow, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, pow);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'rightArithShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nexport var createRightArithShift = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm08 = createAlgorithm08({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': rightArithShiftNumber,\n    'BigNumber, BigNumber': rightArithShiftBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\n    }\n  });\n});","import naturalSort from 'javascript-natural-sort';\nimport { isDenseMatrix, isSparseMatrix, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'compareNatural';\nvar dependencies = ['typed', 'compare'];\nexport var createCompareNatural = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    compare\n  } = _ref;\n  var compareBooleans = compare.signatures['boolean,boolean'];\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\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      var typeX = typeOf(x);\n      var typeY = typeOf(y);\n      var c; // numeric types\n\n      if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {\n        c = compare(x, y);\n\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      } // matrix types\n\n\n      if (typeX === 'Array' || typeX === 'Matrix' || typeY === 'Array' || typeY === 'Matrix') {\n        c = compareMatricesAndArrays(this, x, y);\n\n        if (c !== 0) {\n          return c;\n        } else {\n          return naturalSort(typeX, typeY);\n        }\n      } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'\n\n\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        } // compare by units\n\n\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      } // this should not occur...\n\n\n      throw new TypeError('Unsupported type of value \"' + typeX + '\"');\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\n  function compareMatricesAndArrays(compareNatural, x, y) {\n    if (isSparseMatrix(x) && isSparseMatrix(y)) {\n      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);\n    }\n\n    if (isSparseMatrix(x)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x.toArray(), y);\n    }\n\n    if (isSparseMatrix(y)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x, y.toArray());\n    } // convert DenseArray into Array\n\n\n    if (isDenseMatrix(x)) {\n      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);\n    }\n\n    if (isDenseMatrix(y)) {\n      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);\n    } // convert scalars to array\n\n\n    if (!Array.isArray(x)) {\n      return compareMatricesAndArrays(compareNatural, [x], y);\n    }\n\n    if (!Array.isArray(y)) {\n      return compareMatricesAndArrays(compareNatural, x, [y]);\n    }\n\n    return compareArrays(compareNatural, x, y);\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\n\n  function compareArrays(compareNatural, x, y) {\n    // compare each value\n    for (var i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {\n      var v = compareNatural(x[i], y[i]);\n\n      if (v !== 0) {\n        return v;\n      }\n    } // compare the size of the arrays\n\n\n    if (x.length > y.length) {\n      return 1;\n    }\n\n    if (x.length < y.length) {\n      return -1;\n    } // both Arrays have equal size and content\n\n\n    return 0;\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\n\n  function compareObjects(compareNatural, x, y) {\n    var keysX = Object.keys(x);\n    var keysY = Object.keys(y); // compare keys\n\n    keysX.sort(naturalSort);\n    keysY.sort(naturalSort);\n    var c = compareArrays(compareNatural, keysX, keysY);\n\n    if (c !== 0) {\n      return c;\n    } // compare values\n\n\n    for (var i = 0; i < keysX.length; i++) {\n      var v = compareNatural(x[keysX[i]], y[keysY[i]]);\n\n      if (v !== 0) {\n        return v;\n      }\n    }\n\n    return 0;\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 */\n\nfunction compareComplexNumbers(x, y) {\n  if (x.re > y.re) {\n    return 1;\n  }\n\n  if (x.re < y.re) {\n    return -1;\n  }\n\n  if (x.im > y.im) {\n    return 1;\n  }\n\n  if (x.im < y.im) {\n    return -1;\n  }\n\n  return 0;\n}","import { factory } from '../../utils/factory.js';\nvar name = 'equalText';\nvar dependencies = ['typed', 'compareText', 'isZero'];\nexport var createEqualText = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    compareText,\n    isZero\n  } = _ref;\n\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 anyAny(x, y) {\n      return isZero(compareText(x, y));\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';\nvar name = 'largerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createLargerEq = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x >= y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x >= y || nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) !== -1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createLargerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x >= y || nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { isMatrix } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'partitionSelect';\nvar dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];\nexport var createPartitionSelect = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isNumeric,\n    isNaN,\n    compare\n  } = _ref;\n  var asc = compare;\n\n  var desc = (a, b) => -compare(a, b);\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\n\n  return typed(name, {\n    'Array | Matrix, number': function ArrayMatrixNumber(x, k) {\n      return _partitionSelect(x, k, asc);\n    },\n    'Array | Matrix, number, string': function ArrayMatrixNumberString(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    '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      var size = x.size();\n\n      if (size.length > 1) {\n        throw new Error('Only one dimensional matrices supported');\n      }\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   * 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\n\n  function quickSelect(arr, k, compare) {\n    if (k >= arr.length) {\n      throw new Error('k out of bounds');\n    } // check for NaN values since these can cause an infinite while loop\n\n\n    for (var i = 0; i < arr.length; i++) {\n      if (isNumeric(arr[i]) && isNaN(arr[i])) {\n        return arr[i]; // return NaN\n      }\n    }\n\n    var from = 0;\n    var to = arr.length - 1; // if from == to we reached the kth element\n\n    while (from < to) {\n      var r = from;\n      var w = to;\n      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]; // stop if the reader and writer meets\n\n      while (r < w) {\n        // arr[r] >= pivot\n        if (compare(arr[r], pivot) >= 0) {\n          // put the large values at the end\n          var tmp = arr[w];\n          arr[w] = arr[r];\n          arr[r] = tmp;\n          --w;\n        } else {\n          // the value is smaller than the pivot, skip\n          ++r;\n        }\n      } // if we stepped up (r++) we need to step one down (arr[r] > pivot)\n\n\n      if (compare(arr[r], pivot) > 0) {\n        --r;\n      } // the r pointer is on the end of the first k elements\n\n\n      if (k <= r) {\n        to = r;\n      } else {\n        from = r + 1;\n      }\n    }\n\n    return arr[k];\n  }\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';\nvar name = 'Index';\nvar dependencies = ['ImmutableDenseMatrix'];\nexport var createIndexClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    ImmutableDenseMatrix\n  } = _ref;\n\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 (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i];\n\n      if (isRange(arg)) {\n        this._dimensions.push(arg);\n\n        this._isScalar = false;\n      } else if (Array.isArray(arg) || isMatrix(arg)) {\n        // create matrix\n        var m = _createImmutableMatrix(arg.valueOf());\n\n        this._dimensions.push(m); // size\n\n\n        var size = m.size(); // scalar\n\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      } // TODO: implement support for wildcard '*'\n\n    }\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Index.prototype.type = 'Index';\n  Index.prototype.isIndex = true;\n\n  function _createImmutableMatrix(arg) {\n    // loop array elements\n    for (var 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    } // create matrix\n\n\n    return new ImmutableDenseMatrix(arg);\n  }\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n\n\n  Index.prototype.clone = function () {\n    var index = new Index();\n    index._dimensions = clone(this._dimensions);\n    index._isScalar = this._isScalar;\n    return index;\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\n\n  Index.create = function (ranges) {\n    var index = new Index();\n    Index.apply(index, ranges);\n    return index;\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\n\n  Index.prototype.size = function () {\n    var size = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var d = this._dimensions[i];\n      size[i] = typeof d === 'string' ? 1 : d.size()[0];\n    }\n\n    return size;\n  };\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n\n\n  Index.prototype.max = function () {\n    var values = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.max();\n    }\n\n    return values;\n  };\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n\n\n  Index.prototype.min = function () {\n    var values = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.min();\n    }\n\n    return values;\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\n\n  Index.prototype.forEach = function (callback) {\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      callback(this._dimensions[i], i, this);\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\n\n  Index.prototype.dimension = function (dim) {\n    return this._dimensions[dim] || null;\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\n\n  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';\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\n\n  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null;\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\n\n  Index.prototype.isScalar = function () {\n    return this._isScalar;\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\n\n  Index.prototype.toArray = function () {\n    var array = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());\n    }\n\n    return array;\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\n\n  Index.prototype.valueOf = Index.prototype.toArray;\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\n  Index.prototype.toString = function () {\n    var strings = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n\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   * 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\n\n  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\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\n\n  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions);\n  };\n\n  return Index;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { asechNumber } from '../../plain/number/index.js';\nvar name = 'asech';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAsech = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n\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 number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        var xInv = 1 / x;\n\n        if (xInv > 0 || config.predictable) {\n          return asechNumber(x);\n        }\n\n        var 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    Complex: function Complex(x) {\n      return x.asech();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).acosh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'tan';\nvar dependencies = ['typed'];\nexport var createTan = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.tan();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.tan();\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tan is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since tan(0) = 0\n      return deepMap(x, this, true);\n    }\n  });\n});","import { flatten, generalize, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setDifference';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetDifference = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n\n      if (subset(size(a1), new Index(0)) === 0) {\n        // empty-anything=empty\n        result = [];\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        // anything-empty=anything\n        return flatten(a1.toArray());\n      } else {\n        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n        var inb2;\n\n        for (var i = 0; i < b1.length; i++) {\n          inb2 = false;\n\n          for (var j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n              // the identifier is always a decimal int\n              inb2 = true;\n              break;\n            }\n          }\n\n          if (!inb2) {\n            result.push(b1[i]);\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result);\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(generalize(result));\n    }\n  });\n});","import { flatten, generalize, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setIntersect';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetIntersect = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n\n      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {\n        // of any of them is empty, return empty\n        result = [];\n      } else {\n        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n\n        for (var i = 0; i < b1.length; i++) {\n          for (var j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n              // the identifier is always a decimal int\n              result.push(b1[i]);\n              break;\n            }\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result);\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(generalize(result));\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setMultiplicity';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetMultiplicity = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\n\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 numberBigNumberFractionComplexArrayMatrix(e, a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return 0\n        return 0;\n      }\n\n      var b = flatten(Array.isArray(a) ? a : a.toArray());\n      var count = 0;\n\n      for (var i = 0; i < b.length; i++) {\n        if (compareNatural(b[i], e) === 0) {\n          count++;\n        }\n      }\n\n      return count;\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setSize';\nvar dependencies = ['typed', 'compareNatural'];\nexport var createSetSize = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    compareNatural\n  } = _ref;\n\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 ArrayMatrix(a) {\n      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n    },\n    'Array | Matrix, boolean': function ArrayMatrixBoolean(a, unique) {\n      if (unique === false || a.length === 0) {\n        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n      } else {\n        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        var count = 1;\n\n        for (var i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            count++;\n          }\n        }\n\n        return count;\n      }\n    }\n  });\n});","import { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'trace';\nvar dependencies = ['typed', 'matrix', 'add'];\nexport var createTrace = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    add\n  } = _ref;\n\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    SparseMatrix: _sparseTrace,\n    DenseMatrix: _denseTrace,\n    any: clone\n  });\n\n  function _denseTrace(m) {\n    // matrix size & data\n    var size = m._size;\n    var data = m._data; // process dimensions\n\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\n        throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\n\n      case 2:\n        {\n          // two dimensional\n          var rows = size[0];\n          var cols = size[1];\n\n          if (rows === cols) {\n            // calulate sum\n            var sum = 0; // loop diagonal\n\n            for (var i = 0; i < rows; i++) {\n              sum = add(sum, data[i][i]);\n            } // return trace\n\n\n            return sum;\n          } else {\n            throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\n          }\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    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n    var size = m._size; // check dimensions\n\n    var rows = size[0];\n    var columns = size[1]; // matrix must be square\n\n    if (rows === columns) {\n      // calulate sum\n      var sum = 0; // check we have data (avoid looping columns)\n\n      if (values.length > 0) {\n        // loop columns\n        for (var j = 0; j < columns; j++) {\n          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n          var k0 = ptr[j];\n          var k1 = ptr[j + 1]; // loop k within [k0, k1[\n\n          for (var k = k0; k < k1; k++) {\n            // row index\n            var i = index[k]; // check row\n\n            if (i === j) {\n              // accumulate value\n              sum = add(sum, values[k]); // exit loop\n\n              break;\n            }\n\n            if (i > j) {\n              // exit loop, no value on the diagonal for column j\n              break;\n            }\n          }\n        }\n      } // return trace\n\n\n      return sum;\n    }\n\n    throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\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';\nvar name = 'quantileSeq';\nvar dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare'];\nexport var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    multiply,\n    partitionSelect,\n    compare\n  } = _ref;\n\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    var 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\n      if (typeof sorted === 'boolean') {\n        dataArr = data.valueOf();\n\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            var nPlusOne = probOrN + 1;\n            probArr = new Array(probOrN);\n\n            for (var i = 0; i < probOrN;) {\n              probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);\n            }\n\n            return probArr;\n          }\n        }\n\n        if (isBigNumber(probOrN)) {\n          var 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            } // largest possible Array length is 2^32-1\n            // 2^32 < 10^15, thus safe conversion guaranteed\n\n\n            var intN = probOrN.toNumber();\n\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            var _nPlusOne = new BigNumber(intN + 1);\n\n            probArr = new Array(intN);\n\n            for (var _i = 0; _i < intN;) {\n              probArr[_i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++_i).div(_nPlusOne), sorted));\n            }\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\n          for (var _i2 = 0; _i2 < probArr.length; ++_i2) {\n            var currProb = probOrN[_i2];\n\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\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[_i2] = _quantileSeq(dataArr, currProb, sorted);\n          }\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   * 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\n\n  function _quantileSeq(array, prob, sorted) {\n    var flat = flatten(array);\n    var len = flat.length;\n\n    if (len === 0) {\n      throw new Error('Cannot calculate quantile of an empty sequence');\n    }\n\n    if (isNumber(prob)) {\n      var _index = prob * (len - 1);\n\n      var _fracPart = _index % 1;\n\n      if (_fracPart === 0) {\n        var value = sorted ? flat[_index] : partitionSelect(flat, _index);\n        validate(value);\n        return value;\n      }\n\n      var _integerPart = Math.floor(_index);\n\n      var _left;\n\n      var _right;\n\n      if (sorted) {\n        _left = flat[_integerPart];\n        _right = flat[_integerPart + 1];\n      } else {\n        _right = partitionSelect(flat, _integerPart + 1); // max of partition is kth largest\n\n        _left = flat[_integerPart];\n\n        for (var 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); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n\n      return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));\n    } // If prob is a BigNumber\n\n\n    var index = prob.times(len - 1);\n\n    if (index.isInteger()) {\n      index = index.toNumber();\n\n      var _value = sorted ? flat[index] : partitionSelect(flat, index);\n\n      validate(_value);\n      return _value;\n    }\n\n    var integerPart = index.floor();\n    var fracPart = index.minus(integerPart);\n    var integerPartNumber = integerPart.toNumber();\n    var left;\n    var right;\n\n    if (sorted) {\n      left = flat[integerPartNumber];\n      right = flat[integerPartNumber + 1];\n    } else {\n      right = partitionSelect(flat, integerPartNumber + 1); // max of partition is kth largest\n\n      left = flat[integerPartNumber];\n\n      for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {\n        if (compare(flat[_i3], left) > 0) {\n          left = flat[_i3];\n        }\n      }\n    }\n\n    validate(left);\n    validate(right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n\n    var one = new fracPart.constructor(1);\n    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));\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\n\n  var validate = typed({\n    'number | BigNumber | Unit': function numberBigNumberUnit(x) {\n      return x;\n    }\n  });\n  return quantileSeq;\n});","/* eslint-disable no-loss-of-precision */\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function gammaNumber(n) {\n  var 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) {\n    // Extended Stirling Approx\n    var twoN = n * n;\n    var threeN = twoN * n;\n    var fourN = threeN * n;\n    var fiveN = fourN * n;\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  }\n\n  --n;\n  x = gammaP[0];\n\n  for (var i = 1; i < gammaP.length; ++i) {\n    x += gammaP[i] / (n + i);\n  }\n\n  var 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'; // TODO: comment on the variables g and p\n\nexport var gammaG = 4.7421875;\nexport 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];","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js';\nvar name = 'gamma';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];\nexport var createGamma = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    pow,\n    BigNumber: _BigNumber,\n    Complex: _Complex\n  } = _ref;\n\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  return typed(name, {\n    number: gammaNumber,\n    Complex: function Complex(n) {\n      if (n.im === 0) {\n        return this(n.re);\n      }\n\n      n = new _Complex(n.re - 1, n.im);\n      var x = new _Complex(gammaP[0], 0);\n\n      for (var i = 1; i < gammaP.length; ++i) {\n        var real = n.re + i; // x += p[i]/(n+i)\n\n        var den = real * real + n.im * n.im;\n\n        if (den !== 0) {\n          x.re += gammaP[i] * real / den;\n          x.im += -(gammaP[i] * n.im) / den;\n        } else {\n          x.re = gammaP[i] < 0 ? -Infinity : Infinity;\n        }\n      }\n\n      var t = new _Complex(n.re + gammaG + 0.5, n.im);\n      var twoPiSqrt = Math.sqrt(2 * Math.PI);\n      n.re += 0.5;\n      var result = pow(t, n);\n\n      if (result.im === 0) {\n        // sqrt(2*PI)*result\n        result.re *= twoPiSqrt;\n      } else if (result.re === 0) {\n        result.im *= twoPiSqrt;\n      } else {\n        result.re *= twoPiSqrt;\n        result.im *= twoPiSqrt;\n      }\n\n      var r = Math.exp(-t.re); // exp(-t)\n\n      t.re = r * Math.cos(-t.im);\n      t.im = r * Math.sin(-t.im);\n      return multiplyScalar(multiplyScalar(result, t), x);\n    },\n    BigNumber: function BigNumber(n) {\n      if (n.isInteger()) {\n        return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : 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    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, this);\n    }\n  });\n  /**\n   * Calculate factorial for a BigNumber\n   * @param {BigNumber} n\n   * @returns {BigNumber} Returns the factorial of n\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    var precision = config.precision + (Math.log(n.toNumber()) | 0);\n\n    var Big = _BigNumber.clone({\n      precision: precision\n    });\n\n    if (n % 2 === 1) {\n      return n.times(bigFactorial(new _BigNumber(n - 1)));\n    }\n\n    var p = n;\n    var prod = new Big(n);\n    var 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});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'bignumber';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createBignumber = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber\n  } = _ref;\n\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    number: function number(x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new BigNumber(x + '');\n    },\n    string: function string(x) {\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n\n      if (wordSizeSuffixMatch) {\n        // x has a word size suffix\n        var size = wordSizeSuffixMatch[2];\n        var n = BigNumber(wordSizeSuffixMatch[1]);\n        var twoPowSize = new BigNumber(2).pow(Number(size));\n\n        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n\n        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);\n\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize);\n        } else {\n          return n;\n        }\n      }\n\n      return new BigNumber(x);\n    },\n    BigNumber: function BigNumber(x) {\n      // we assume a BigNumber is immutable\n      return x;\n    },\n    Fraction: function Fraction(x) {\n      return new BigNumber(x.n).div(x.d).times(x.s);\n    },\n    null: function _null(x) {\n      return new BigNumber(0);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\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';\nvar name = 'lcm';\nvar dependencies = ['typed', 'matrix', 'equalScalar'];\nexport var createLcm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': lcmNumber,\n    'BigNumber, BigNumber': _lcmBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.lcm(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      return algorithm11(y, x, this, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    },\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {\n      var res = this(a, b);\n\n      for (var i = 0; i < args.length; i++) {\n        res = this(res, args[i]);\n      }\n\n      return res;\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\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\n    if (b.isZero()) {\n      return b;\n    } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    // evaluate lcm here inline to reduce overhead\n\n\n    var prod = a.times(b);\n\n    while (!b.isZero()) {\n      var t = b;\n      b = a.mod(t);\n      a = t;\n    }\n\n    return prod.div(a).abs();\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';\nvar name = 'bitOr';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createBitOr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm04 = createAlgorithm04({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': bitOrNumber,\n    'BigNumber, BigNumber': bitOrBigNumber,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { arraySize as size } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'kron';\nvar dependencies = ['typed', 'matrix', 'multiplyScalar'];\nexport var createKron = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    multiplyScalar\n  } = _ref;\n\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 MatrixMatrix(x, y) {\n      return matrix(_kron(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return matrix(_kron(x.toArray(), y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return matrix(_kron(x, y.toArray()));\n    },\n    'Array, Array': _kron\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\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\n    if (size(b).length === 1) {\n      // Wrap it in a 2D Matrix\n      b = [b];\n    }\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 ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');\n    }\n\n    var t = [];\n    var r = [];\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});","import { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'transpose';\nvar dependencies = ['typed', 'matrix'];\nexport var createTranspose = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\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    Array: function Array(x) {\n      // use dense matrix implementation\n      return this(matrix(x)).valueOf();\n    },\n    Matrix: function Matrix(x) {\n      // matrix size\n      var size = x.size(); // result\n\n      var c; // process dimensions\n\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            var rows = size[0];\n            var columns = size[1]; // check columns\n\n            if (columns === 0) {\n              // throw exception\n              throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')');\n            } // process storage format\n\n\n            switch (x.storage()) {\n              case 'dense':\n                c = _denseTranspose(x, rows, columns);\n                break;\n\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\n      return c;\n    },\n    // scalars\n    any: function any(x) {\n      return clone(x);\n    }\n  });\n\n  function _denseTranspose(m, rows, columns) {\n    // matrix array\n    var data = m._data; // transposed matrix data\n\n    var transposed = [];\n    var transposedRow; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // initialize row\n      transposedRow = transposed[j] = []; // loop rows\n\n      for (var i = 0; i < rows; i++) {\n        // set data\n        transposedRow[i] = clone(data[i][j]);\n      }\n    } // return matrix\n\n\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    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // result matrices\n\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // row counts\n\n    var w = [];\n\n    for (var x = 0; x < rows; x++) {\n      w[x] = 0;\n    } // vars\n\n\n    var p, l, j; // loop values in matrix\n\n    for (p = 0, l = index.length; p < l; p++) {\n      // number of values in row\n      w[index[p]]++;\n    } // cumulative sum\n\n\n    var sum = 0; // initialize cptr with the cummulative sum of row counts\n\n    for (var i = 0; i < rows; i++) {\n      // update cptr\n      cptr.push(sum); // update sum\n\n      sum += w[i]; // update w\n\n      w[i] = cptr[i];\n    } // update cptr\n\n\n    cptr.push(sum); // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // values & index in column\n      for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {\n        // C values & index\n        var q = w[index[k]]++; // C[j, i] = A[i, j]\n\n        cindex[q] = j; // check we need to process values (pattern matrix)\n\n        if (values) {\n          cvalues[q] = clone(values[k]);\n        }\n      }\n    } // return matrix\n\n\n    return m.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [columns, rows],\n      datatype: m._datatype\n    });\n  }\n});","import { typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { noBignumber, noFraction } from '../../utils/noop.js';\nvar name = 'numeric';\nvar dependencies = ['number', '?bignumber', '?fraction'];\nexport var createNumeric = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    number: _number,\n    bignumber,\n    fraction\n  } = _ref;\n  var validInputTypes = {\n    string: true,\n    number: true,\n    BigNumber: true,\n    Fraction: true\n  }; // Load the conversion functions for each output type\n\n  var validOutputTypes = {\n    number: x => _number(x),\n    BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n    Fraction: fraction ? x => fraction(x) : noFraction\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\n  return function numeric(value, outputType) {\n    var 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\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});","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';\nvar name = 'and';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not'];\nexport var createAnd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    not\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm06 = createAlgorithm06({\n    typed,\n    equalScalar\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': andNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return this(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, this, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm11(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y)).valueOf();\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';\nvar name = 'smallerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createSmallerEq = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x <= y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x <= y || nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) !== 1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return this(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});\nexport var createSmallerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], (_ref2) => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x <= y || nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { arraySize as size } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'sort';\nvar dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];\nexport var createSort = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    compare,\n    compareNatural\n  } = _ref;\n  var compareAsc = compare;\n\n  var compareDesc = (a, b) => -compare(a, b);\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\n\n  return typed(name, {\n    Array: function Array(x) {\n      _arrayIsVector(x);\n\n      return x.sort(compareAsc);\n    },\n    Matrix: function Matrix(x) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(compareAsc), x.storage());\n    },\n    'Array, function': function ArrayFunction(x, _comparator) {\n      _arrayIsVector(x);\n\n      return x.sort(_comparator);\n    },\n    'Matrix, function': function MatrixFunction(x, _comparator) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(_comparator), x.storage());\n    },\n    'Array, string': function ArrayString(x, order) {\n      _arrayIsVector(x);\n\n      return x.sort(_comparator(order));\n    },\n    'Matrix, string': function MatrixString(x, order) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(_comparator(order)), x.storage());\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\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   * 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\n\n  function _arrayIsVector(array) {\n    if (size(array).length !== 1) {\n      throw new Error('One dimensional array expected');\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\n\n  function _matrixIsVector(matrix) {\n    if (matrix.size().length !== 1) {\n      throw new Error('One dimensional matrix expected');\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { cotNumber } from '../../plain/number/index.js';\nvar name = 'cot';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n\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    Complex: function Complex(x) {\n      return x.cot();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.tan());\n    },\n    Unit: function Unit(x) {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cot is no angle');\n      }\n\n      return this(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setDistinct';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetDistinct = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\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 ArrayMatrix(a) {\n      var result;\n\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return empty\n        result = [];\n      } else {\n        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        result = [];\n        result.push(b[0]);\n\n        for (var i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            result.push(b[i]);\n          }\n        }\n      } // return an array, if the input was an array\n\n\n      if (Array.isArray(a)) {\n        return result;\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(result);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setPowerset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetPowerset = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\n\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 ArrayMatrix(a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return empty\n        return [];\n      }\n\n      var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n      var result = [];\n      var number = 0;\n\n      while (number.toString(2).length <= b.length) {\n        result.push(_subset(b, number.toString(2).split('').reverse()));\n        number++;\n      } // can not return a matrix, because of the different size of the subarrays\n\n\n      return _sort(result);\n    }\n  }); // create subset\n\n  function _subset(array, bitarray) {\n    var result = [];\n\n    for (var i = 0; i < bitarray.length; i++) {\n      if (bitarray[i] === '1') {\n        result.push(array[i]);\n      }\n    }\n\n    return result;\n  } // sort subsests by length\n\n\n  function _sort(array) {\n    var temp = [];\n\n    for (var i = array.length - 1; i > 0; i--) {\n      for (var 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\n    return array;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { isBigNumber, isMatrix } from '../../../utils/is.js';\nvar name = 'index';\nvar dependencies = ['typed', 'Index'];\nexport var createIndex = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index\n  } = _ref;\n\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 numberStringBigNumberRangeArrayMatrix(args) {\n      var 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      var res = new Index();\n      Index.apply(res, ranges);\n      return res;\n    }\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'factorial';\nvar dependencies = ['typed', 'gamma'];\nexport var createFactorial = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    gamma\n  } = _ref;\n\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 number(n) {\n      if (n < 0) {\n        throw new Error('Value must be non-negative');\n      }\n\n      return gamma(n + 1);\n    },\n    BigNumber: function BigNumber(n) {\n      if (n.isNegative()) {\n        throw new Error('Value must be non-negative');\n      }\n\n      return gamma(n.plus(1));\n    },\n    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, this);\n    }\n  });\n});","import { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'permutations';\nvar dependencies = ['typed', 'factorial'];\nexport var createPermutations = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    factorial\n  } = _ref;\n\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 numberNumber(n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n\n      if (k > n) {\n        throw new TypeError('second argument k must be less than or equal to first argument n');\n      } // Permute n objects, k at a time\n\n\n      return product(n - k + 1, n);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var result, i;\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\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      var one = n.mul(0).add(1);\n      result = one;\n\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    } // 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 */\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\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';\nvar name = 'ceil';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];\nexport var createCeil = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('ceil', {\n    number: function number(x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return ceilNumber(x);\n      }\n    },\n    'number, number': function numberNumber(x, n) {\n      if (nearlyEqual(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        var [number, exponent] = \"\".concat(x, \"e\").split('e');\n        var result = Math.ceil(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n        [number, exponent] = \"\".concat(result, \"e\").split('e');\n        return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n      }\n    },\n    Complex: function Complex(x) {\n      return x.ceil();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      return x.ceil(n);\n    },\n    BigNumber: function BigNumber(x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.ceil();\n      }\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(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    Fraction: function Fraction(x) {\n      return x.ceil();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      return x.ceil(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, this, true);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(x, n) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => this(i, n), true);\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, this, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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';\nvar name = 'subtract';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'addScalar', 'unaryMinus', 'DenseMatrix'];\nexport var createSubtract = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    addScalar,\n    unaryMinus,\n    DenseMatrix\n  } = _ref;\n  // TODO: split function subtract in two: subtract and subtractScalar\n  var algorithm01 = createAlgorithm01({\n    typed\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm05 = createAlgorithm05({\n    typed,\n    equalScalar\n  });\n  var algorithm10 = createAlgorithm10({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x - y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.sub(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.minus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.sub(y);\n    },\n    'Unit, Unit': function UnitUnit(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      var res = x.clone();\n      res.value = this(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm05(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm01(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, unaryMinus(y), addScalar);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\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 */\n\nfunction checkEqualDimensions(x, y) {\n  var xsize = x.size();\n  var ysize = y.size();\n\n  if (xsize.length !== ysize.length) {\n    throw new DimensionError(xsize.length, ysize.length);\n  }\n}","import { arraySize, squeeze } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'cross';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply'];\nexport var createCross = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    multiply\n  } = _ref;\n\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 MatrixMatrix(x, y) {\n      return matrix(_cross(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return matrix(_cross(x.toArray(), y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return matrix(_cross(x, y.toArray()));\n    },\n    'Array, Array': _cross\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\n  function _cross(x, y) {\n    var highestDimension = Math.max(arraySize(x).length, arraySize(y).length);\n    x = squeeze(x);\n    y = squeeze(y);\n    var xSize = arraySize(x);\n    var 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 ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');\n    }\n\n    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]))];\n\n    if (highestDimension > 1) {\n      return [product];\n    } else {\n      return product;\n    }\n  }\n});","import { deepForEach } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'prod';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];\nexport var createProd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    numeric\n  } = _ref;\n\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    // prod([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      // TODO: implement prod(A, dim)\n      throw new Error('prod(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], math.prod)\n    },\n    // prod(a, b, c, d, ...)\n    '...': function _(args) {\n      return _prod(args);\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\n  function _prod(array) {\n    var prod;\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    }); // make sure returning numeric value: parse a string into a numeric value\n\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});","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';\nvar name = 'equal';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createEqual = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y === null;\n      }\n\n      if (y === null) {\n        return x === null;\n      }\n\n      if (x === undefined) {\n        return y === undefined;\n      }\n\n      if (y === undefined) {\n        return x === undefined;\n      }\n\n      return equalScalar(x, y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, equalScalar);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, equalScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, equalScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, equalScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, equalScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, equalScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, equalScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, equalScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, equalScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, equalScalar, true).valueOf();\n    }\n  });\n});\nexport var createEqualNumber = factory(name, ['typed', 'equalScalar'], (_ref2) => {\n  var {\n    typed,\n    equalScalar\n  } = _ref2;\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y === null;\n      }\n\n      if (y === null) {\n        return x === null;\n      }\n\n      if (x === undefined) {\n        return y === undefined;\n      }\n\n      if (y === undefined) {\n        return x === undefined;\n      }\n\n      return equalScalar(x, y);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setCartesian';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetCartesian = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\n\n  /**\n   * Create the cartesian product of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays 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   *\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 ArrayMatrixArrayMatrix(a1, a2) {\n      var result = [];\n\n      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {\n        // if any of them is empty, return empty\n        var b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);\n        var b2 = flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);\n        result = [];\n\n        for (var i = 0; i < b1.length; i++) {\n          for (var j = 0; j < b2.length; j++) {\n            result.push([b1[i], b2[j]]);\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return result;\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(result);\n    }\n  });\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setSymDifference';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];\nexport var createSetSymDifference = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    concat,\n    subset,\n    setDifference,\n    Index\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // 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\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setDifference(b1, b2), setDifference(b2, b1));\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'fix';\nvar dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor'];\nexport var createFix = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Complex: _Complex,\n    matrix,\n    ceil,\n    floor\n  } = _ref;\n  var algorithm14 = createAlgorithm14({\n    typed\n  });\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\n  return typed('fix', {\n    number: function number(x) {\n      return x > 0 ? floor(x) : ceil(x);\n    },\n    'number, number | BigNumber': function numberNumberBigNumber(x, n) {\n      return x > 0 ? floor(x, n) : ceil(x, n);\n    },\n    Complex: function Complex(x) {\n      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));\n    },\n    'Complex, number | BigNumber': function ComplexNumberBigNumber(x, n) {\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));\n    },\n    BigNumber: function BigNumber(x) {\n      return x.isNegative() ? ceil(x) : floor(x);\n    },\n    'BigNumber, number | BigNumber': function BigNumberNumberBigNumber(x, n) {\n      return x.isNegative() ? ceil(x, n) : floor(x, n);\n    },\n    Fraction: function Fraction(x) {\n      return x.s < 0 ? x.ceil() : x.floor();\n    },\n    'Fraction, number | BigNumber': function FractionNumberBigNumber(x, n) {\n      return x.s < 0 ? x.ceil(n) : x.floor(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, this, true);\n    },\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(x, n) {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, i => this(i, n), true);\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'ctranspose';\nvar dependencies = ['typed', 'transpose', 'conj'];\nexport var createCtranspose = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    transpose,\n    conj\n  } = _ref;\n\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 any(x) {\n      return conj(transpose(x));\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'deepEqual';\nvar dependencies = ['typed', 'equal'];\nexport var createDeepEqual = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    equal\n  } = _ref;\n\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 anyAny(x, y) {\n      return _deepEqual(x.valueOf(), y.valueOf());\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\n  function _deepEqual(x, y) {\n    if (Array.isArray(x)) {\n      if (Array.isArray(y)) {\n        var len = x.length;\n\n        if (len !== y.length) {\n          return false;\n        }\n\n        for (var 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});","import { flatten, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setIsSubset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // empty is a subset of anything\n        return true;\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        // anything is not a subset of empty\n        return false;\n      }\n\n      var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n      var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n      var inb2;\n\n      for (var i = 0; i < b1.length; i++) {\n        inb2 = false;\n\n        for (var j = 0; j < b2.length; j++) {\n          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n            // the identifier is always a decimal int\n            inb2 = true;\n            break;\n          }\n        }\n\n        if (inb2 === false) {\n          return false;\n        }\n      }\n\n      return true;\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';\nvar name = 'xor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix'];\nexport var createXor = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix\n  } = _ref;\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'number, number': xorNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return this(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, this);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, this, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, this, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, this);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, this, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, this, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, this, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, this, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, this, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, this, true).valueOf();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'divideScalar';\nvar dependencies = ['typed', 'numeric'];\nexport var createDivideScalar = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    numeric\n  } = _ref;\n\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 numberNumber(x, y) {\n      return x / y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.div(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.div(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.div(y);\n    },\n    'Unit, number | Fraction | BigNumber': function UnitNumberFractionBigNumber(x, y) {\n      var res = x.clone(); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n      var one = numeric(1, typeOf(y));\n      res.value = this(res.value === null ? res._normalize(one) : res.value, y);\n      return res;\n    },\n    'number | Fraction | BigNumber, Unit': function numberFractionBigNumberUnit(x, y) {\n      var res = y.clone();\n      res = res.pow(-1); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n      var one = numeric(1, typeOf(x));\n      res.value = this(x, y.value === null ? y._normalize(one) : y.value);\n      return res;\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return x.divide(y);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'nthRoots';\nvar dependencies = ['config', 'typed', 'divideScalar', 'Complex'];\nexport var createNthRoots = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    Complex\n  } = _ref;\n\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  var _calculateExactResult = [function realPos(val) {\n    return new Complex(val, 0);\n  }, function imagPos(val) {\n    return new Complex(0, val);\n  }, function realNeg(val) {\n    return new Complex(-val, 0);\n  }, function imagNeg(val) {\n    return new Complex(0, -val);\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\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    var aIsNumeric = typeof a === 'number';\n    var offset; // determine the offset (argument of a)/(pi/2)\n\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\n    var arg = a.arg();\n    var abs = a.abs();\n    var roots = [];\n    var r = Math.pow(abs, 1 / root);\n\n    for (var k = 0; k < root; k++) {\n      var 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\n      if (halfPiFactor === Math.round(halfPiFactor)) {\n        roots.push(_calculateExactResult[halfPiFactor % 4](r));\n        continue;\n      }\n\n      roots.push(new Complex({\n        r: r,\n        phi: (arg + 2 * Math.PI * k) / root\n      }));\n    }\n\n    return roots;\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\n\n  return typed(name, {\n    Complex: function Complex(x) {\n      return _nthComplexRoots(x, 2);\n    },\n    'Complex, number': _nthComplexRoots\n  });\n});","import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js';\nimport { arraySize } from '../../../../utils/array.js';\nimport { format } from '../../../../utils/string.js';\nexport function createSolveValidation(_ref) {\n  var {\n    DenseMatrix\n  } = _ref;\n\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    var mSize = m.size();\n\n    if (mSize.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')');\n    }\n\n    var rows = mSize[0];\n    var columns = mSize[1];\n\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')');\n    }\n\n    var data = [];\n\n    if (isMatrix(b)) {\n      var bSize = b.size();\n      var bdata = b._data; // 1-dim vector\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 (var 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      } // 2-dim column\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        if (isDenseMatrix(b)) {\n          if (copy) {\n            data = [];\n\n            for (var _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 (var _i2 = 0; _i2 < rows; _i2++) {\n            data[_i2] = [0];\n          }\n\n          var values = b._values;\n          var index = b._index;\n          var ptr = b._ptr;\n\n          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n            var _i3 = index[k];\n            data[_i3][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      var 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 (var _i4 = 0; _i4 < rows; _i4++) {\n          data[_i4] = [b[_i4]];\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 (var _i5 = 0; _i5 < rows; _i5++) {\n          data[_i5] = [b[_i5][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}","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'lsolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createLsolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var r = _denseForwardSubstitution(m, b);\n\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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // result\n\n    var x = [];\n    var mdata = m._data; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      var bj = bdata[j][0] || 0;\n      var xj = void 0;\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n        var 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); // loop rows\n\n        for (var 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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // result\n\n    var x = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      var bj = bdata[j][0] || 0;\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n        var vjj = 0; // matrix values & indices (column j)\n\n        var jValues = [];\n        var jIndices = []; // first and last index in the column\n\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j]\n\n        for (var k = firstIndex; k < lastIndex; k++) {\n          var i = index[k]; // check row (rows are not sorted!)\n\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        } // at this point we must have a value in vjj\n\n\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n\n        var xj = divideScalar(bj, vjj);\n\n        for (var _k = 0, l = jIndices.length; _k < l; _k++) {\n          var _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});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'lsolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createLsolveAll = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var R = _denseForwardSubstitution(m, b);\n\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/project/5e6c87c554a3190001a3fc93\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // loop columns\n\n    for (var i = 0; i < columns; i++) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n          b[i] = divideScalar(b[i], M[i][i]);\n\n          for (var 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          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          var bNew = [...b];\n          bNew[i] = 1;\n\n          for (var _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({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n\n  function _sparseForwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // loop columns\n\n    for (var i = 0; i < columns; i++) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k]; // values & indices (column i)\n\n        var iValues = [];\n        var iIndices = []; // first & last indeces in column\n\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1]; // find the value at [i, i]\n\n        var Mii = 0;\n\n        for (var j = firstIndex; j < lastIndex; j++) {\n          var J = index[j]; // check row\n\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          b[i] = divideScalar(b[i], Mii);\n\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\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          var bNew = [...b];\n          bNew[i] = 1;\n\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);\n          }\n\n          B.push(bNew);\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Spa';\nvar dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];\nexport var createSpaClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    addScalar,\n    equalScalar,\n    FibonacciHeap\n  } = _ref;\n\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)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // allocate vector, TODO use typed arrays\n\n\n    this._values = [];\n    this._heap = new FibonacciHeap();\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Spa.prototype.type = 'Spa';\n  Spa.prototype.isSpa = true;\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\n  Spa.prototype.set = function (i, v) {\n    // check we have a value @ i\n    if (!this._values[i]) {\n      // insert in heap\n      var node = this._heap.insert(i, v); // set the value @ i\n\n\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    var node = this._values[i];\n\n    if (node) {\n      return node.value;\n    }\n\n    return 0;\n  };\n\n  Spa.prototype.accumulate = function (i, v) {\n    // node @ i\n    var node = this._values[i];\n\n    if (!node) {\n      // insert in heap\n      node = this._heap.insert(i, v); // initialize value\n\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    var heap = this._heap;\n    var values = this._values; // nodes\n\n    var nodes = []; // node with minimum key, save it\n\n    var node = heap.extractMinimum();\n\n    if (node) {\n      nodes.push(node);\n    } // extract nodes from heap (ordered)\n\n\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      } // extract next node, save it\n\n\n      node = heap.extractMinimum();\n\n      if (node) {\n        nodes.push(node);\n      }\n    } // reinsert all nodes in heap\n\n\n    for (var i = 0; i < nodes.length; i++) {\n      // current node\n      var n = nodes[i]; // insert node in heap\n\n      node = heap.insert(n.key, n.value); // update values\n\n      values[node.key] = node;\n    }\n  };\n\n  Spa.prototype.swap = function (i, j) {\n    // node @ i and j\n    var nodei = this._values[i];\n    var nodej = this._values[j]; // check we need to insert indeces\n\n    if (!nodei && nodej) {\n      // insert in heap\n      nodei = this._heap.insert(i, nodej.value); // remove from heap\n\n      this._heap.remove(nodej); // set values\n\n\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); // remove from heap\n\n      this._heap.remove(nodei); // set values\n\n\n      this._values[j] = nodej;\n      this._values[i] = undefined;\n    } else if (nodei && nodej) {\n      // swap values\n      var v = nodei.value;\n      nodei.value = nodej.value;\n      nodej.value = v;\n    }\n  };\n\n  return Spa;\n}, {\n  isClass: true\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setUnion';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];\nexport var createSetUnion = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    concat,\n    subset,\n    setIntersect,\n    setSymDifference,\n    Index\n  } = _ref;\n\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 ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // 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\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));\n    }\n  });\n});","import { clone } from '../../../utils/object.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'lup';\nvar dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];\nexport var createLup = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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    DenseMatrix: function DenseMatrix(m) {\n      return _denseLUP(m);\n    },\n    SparseMatrix: function SparseMatrix(m) {\n      return _sparseLUP(m);\n    },\n    Array: function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a); // lup, use matrix implementation\n\n      var r = _denseLUP(m); // result\n\n\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    var rows = m._size[0];\n    var columns = m._size[1]; // minimum rows and columns\n\n    var n = Math.min(rows, columns); // matrix array, clone original data\n\n    var data = clone(m._data); // l matrix arrays\n\n    var ldata = [];\n    var lsize = [rows, n]; // u matrix arrays\n\n    var udata = [];\n    var usize = [n, columns]; // vars\n\n    var i, j, k; // permutation vector\n\n    var p = [];\n\n    for (i = 0; i < rows; i++) {\n      p[i] = i;\n    } // loop columns\n\n\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          var min = Math.min(i, j); // v[i, j]\n\n          var s = 0; // loop up to min\n\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\n          data[i][j] = subtract(data[i][j], s);\n        }\n      } // row with larger value in cvector, row >= j\n\n\n      var pi = j;\n      var pabsv = 0;\n      var vjj = 0; // loop rows\n\n      for (i = j; i < rows; i++) {\n        // data @ i, j\n        var v = data[i][j]; // absolute value\n\n        var absv = abs(v); // value is greater than pivote value\n\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = i; // update max value\n\n          pabsv = absv; // value @ [j, j]\n\n          vjj = v;\n        }\n      } // swap rows (j <-> pi)\n\n\n      if (j !== pi) {\n        // swap values j <-> pi in p\n        p[j] = [p[pi], p[pi] = p[j]][0]; // swap j <-> pi in data\n\n        DenseMatrix._swapRows(j, pi, data);\n      } // check column is in lower triangular matrix\n\n\n      if (j < rows) {\n        // loop rows (lower triangular matrix)\n        for (i = j + 1; i < rows; i++) {\n          // value @ i, j\n          var vij = data[i][j];\n\n          if (!equalScalar(vij, 0)) {\n            // update data\n            data[i][j] = divideScalar(data[i][j], vjj);\n          }\n        }\n      }\n    } // loop columns\n\n\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          } // L\n\n\n          ldata[i] = [];\n        } // check we are in the upper triangular matrix\n\n\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          } // check column exists in lower triangular matrix\n\n\n          if (j < rows) {\n            // L\n            ldata[i][j] = 0;\n          }\n\n          continue;\n        } // diagonal value\n\n\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          } // check column exists in lower triangular matrix\n\n\n          if (j < rows) {\n            // L\n            ldata[i][j] = 1;\n          }\n\n          continue;\n        } // check row exists in upper triangular matrix\n\n\n        if (i < columns) {\n          // U\n          udata[i][j] = 0;\n        } // check column exists in lower triangular matrix\n\n\n        if (j < rows) {\n          // L\n          ldata[i][j] = data[i][j];\n        }\n      }\n    } // l matrix\n\n\n    var l = new DenseMatrix({\n      data: ldata,\n      size: lsize\n    }); // u matrix\n\n    var u = new DenseMatrix({\n      data: udata,\n      size: usize\n    }); // p vector\n\n    var pv = [];\n\n    for (i = 0, n = p.length; i < n; i++) {\n      pv[p[i]] = i;\n    } // return matrices\n\n\n    return {\n      L: l,\n      U: u,\n      p: pv,\n      toString: function toString() {\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    var rows = m._size[0];\n    var columns = m._size[1]; // minimum rows and columns\n\n    var n = Math.min(rows, columns); // matrix arrays (will not be modified, thanks to permutation vector)\n\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // l matrix arrays\n\n    var lvalues = [];\n    var lindex = [];\n    var lptr = [];\n    var lsize = [rows, n]; // u matrix arrays\n\n    var uvalues = [];\n    var uindex = [];\n    var uptr = [];\n    var usize = [n, columns]; // vars\n\n    var i, j, k; // permutation vectors, (current index -> original index) and (original index -> current index)\n\n    var pvCo = [];\n    var pvOc = [];\n\n    for (i = 0; i < rows; i++) {\n      pvCo[i] = i;\n      pvOc[i] = i;\n    } // swap indices in permutation vectors (condition x < y)!\n\n\n    var swapIndeces = function swapIndeces(x, y) {\n      // find pv indeces getting data from x and y\n      var kx = pvOc[x];\n      var ky = pvOc[y]; // update permutation vector current -> original\n\n      pvCo[kx] = y;\n      pvCo[ky] = x; // update permutation vector original -> current\n\n      pvOc[x] = ky;\n      pvOc[y] = kx;\n    }; // loop columns\n\n\n    var _loop = function _loop() {\n      // sparse accumulator\n      var spa = new Spa(); // check lower triangular matrix has a value @ column j\n\n      if (j < rows) {\n        // update ptr\n        lptr.push(lvalues.length); // first value in j column for lower triangular matrix\n\n        lvalues.push(1);\n        lindex.push(j);\n      } // update ptr\n\n\n      uptr.push(uvalues.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // copy column j into sparse accumulator\n\n      for (k = k0; k < k1; k++) {\n        // row\n        i = index[k]; // copy column values into sparse accumulator (use permutation vector)\n\n        spa.set(pvCo[i], values[k]);\n      } // skip first column in upper triangular matrix\n\n\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      } // row with larger value in spa, row >= j\n\n\n      var pi = j;\n      var vjj = spa.get(j);\n      var pabsv = abs(vjj); // loop values in spa (order by row, below diagonal)\n\n      spa.forEach(j + 1, rows - 1, function (x, v) {\n        // absolute value\n        var absv = abs(v); // value is greater than pivote value\n\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = x; // update max value\n\n          pabsv = absv; // value @ [j, j]\n\n          vjj = v;\n        }\n      }); // swap rows (j <-> pi)\n\n      if (j !== pi) {\n        // swap values j <-> pi in L\n        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); // swap values j <-> pi in U\n\n\n        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); // swap values in spa\n\n\n        spa.swap(j, pi); // update permutation vector (swap values @ j, pi)\n\n        swapIndeces(j, pi);\n      } // loop values in spa (order by row)\n\n\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); // check value is non zero\n\n          if (!equalScalar(v, 0)) {\n            // update lower triangular matrix\n            lvalues.push(v);\n            lindex.push(x);\n          }\n        }\n      });\n    };\n\n    for (j = 0; j < columns; j++) {\n      _loop();\n    } // update ptrs\n\n\n    uptr.push(uvalues.length);\n    lptr.push(lvalues.length); // return matrices\n\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 toString() {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p;\n      }\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  var top = 0; // place j on the stack\n\n  w[stack] = j; // while (stack is not empty)\n\n  while (top >= 0) {\n    // p = top of stack\n    var p = w[stack + top]; // i = youngest child of p\n\n    var i = w[head + p];\n\n    if (i === -1) {\n      // p has no unordered children left\n      top--; // node p is the kth postordered node\n\n      post[k++] = p;\n    } else {\n      // remove i from children of p\n      w[head + p] = w[next + i]; // increment top\n\n      ++top; // start dfs on child node i\n\n      w[stack + top] = i;\n    }\n  }\n\n  return k;\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}","import { factory } from '../../../utils/factory.js';\nimport { csFkeep } from './csFkeep.js';\nimport { csFlip } from './csFlip.js';\nimport { csTdfs } from './csTdfs.js';\nvar name = 'csAmd';\nvar dependencies = ['add', 'multiply', 'transpose'];\nexport var createCsAmd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    add,\n    multiply,\n    transpose\n  } = _ref;\n\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) {\n      return null;\n    } // a matrix arrays\n\n\n    var asize = a._size; // rows and columns\n\n    var m = asize[0];\n    var n = asize[1]; // initialize vars\n\n    var lemax = 0; // dense threshold\n\n    var dense = Math.max(16, 10 * Math.sqrt(n));\n    dense = Math.min(n - 2, dense); // create target matrix C\n\n    var cm = _createTargetMatrix(order, a, m, n, dense); // drop diagonal entries\n\n\n    csFkeep(cm, _diag, null); // C matrix arrays\n\n    var cindex = cm._index;\n    var cptr = cm._ptr; // number of nonzero elements in C\n\n    var cnz = cptr[n]; // allocate result (n+1)\n\n    var P = []; // create workspace (8 * (n + 1))\n\n    var W = [];\n    var len = 0; // first n + 1 entries\n\n    var nv = n + 1; // next n + 1 entries\n\n    var next = 2 * (n + 1); // next n + 1 entries\n\n    var head = 3 * (n + 1); // next n + 1 entries\n\n    var elen = 4 * (n + 1); // next n + 1 entries\n\n    var degree = 5 * (n + 1); // next n + 1 entries\n\n    var w = 6 * (n + 1); // next n + 1 entries\n\n    var hhead = 7 * (n + 1); // last n + 1 entries\n    // use P as workspace for last\n\n    var last = P; // initialize quotient graph\n\n    var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree); // initialize degree lists\n\n\n    var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next); // minimum degree node\n\n\n    var mindeg = 0; // vars\n\n    var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d; // while (selecting pivots) do\n\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        ;\n      }\n\n      if (W[next + k] !== -1) {\n        last[W[next + k]] = -1;\n      } // remove k from degree list\n\n\n      W[head + mindeg] = W[next + k]; // elenk = |Ek|\n\n      var elenk = W[elen + k]; // # of nodes k represents\n\n      var nvk = W[nv + k]; // W[nv + k] nodes of A eliminated\n\n      nel += nvk; // 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\n      var dk = 0; // flag k as in Lk\n\n      W[nv + k] = -nvk;\n      var p = cptr[k]; // do in place if W[elen + k] === 0\n\n      var pk1 = elenk === 0 ? p : cnz;\n      var pk2 = pk1;\n\n      for (k1 = 1; k1 <= elenk + 1; k1++) {\n        if (k1 > elenk) {\n          // search the nodes in k\n          e = k; // list of nodes starts at cindex[pj]\n\n          pj = p; // length of list of nodes in k\n\n          ln = W[len + k] - elenk;\n        } else {\n          // search the nodes in e\n          e = cindex[p++];\n          pj = cptr[e]; // length of list of nodes in e\n\n          ln = W[len + e];\n        }\n\n        for (k2 = 1; k2 <= ln; k2++) {\n          i = cindex[pj++]; // check  node i dead, or seen\n\n          if ((nvi = W[nv + i]) <= 0) {\n            continue;\n          } // W[degree + Lk] += size of node i\n\n\n          dk += nvi; // negate W[nv + i] to denote i in Lk\n\n          W[nv + i] = -nvi; // place i in Lk\n\n          cindex[pk2++] = i;\n\n          if (W[next + i] !== -1) {\n            last[W[next + i]] = last[i];\n          } // check we need to remove i from degree list\n\n\n          if (last[i] !== -1) {\n            W[next + last[i]] = W[next + i];\n          } else {\n            W[head + W[degree + i]] = W[next + i];\n          }\n        }\n\n        if (e !== k) {\n          // absorb e into k\n          cptr[e] = csFlip(k); // e is now a dead element\n\n          W[w + e] = 0;\n        }\n      } // cindex[cnz...nzmax] is free\n\n\n      if (elenk !== 0) {\n        cnz = pk2;\n      } // external degree of k - |Lk\\i|\n\n\n      W[degree + k] = dk; // element k is in cindex[pk1..pk2-1]\n\n      cptr[k] = pk1;\n      W[len + k] = pk2 - pk1; // k is now an element\n\n      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\n      // scan, no entry in the w array is greater than or equal to mark.\n      // clear w if necessary\n\n      mark = _wclear(mark, lemax, W, w, n); // scan 1: find |Le\\Lk|\n\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check if W[elen + i] empty, skip it\n\n        if ((eln = W[elen + i]) <= 0) {\n          continue;\n        } // W[nv + i] was negated\n\n\n        nvi = -W[nv + i];\n        var wnvi = mark - nvi; // scan Ei\n\n        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {\n          e = cindex[p];\n\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      } // 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      // scan2: degree update\n\n\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; // scan Ei\n\n        for (h = 0, d = 0, p = p1; p <= p2; p++) {\n          e = cindex[p]; // check e is an unabsorbed element\n\n          if (W[w + e] !== 0) {\n            // dext = |Le\\Lk|\n            var dext = W[w + e] - mark;\n\n            if (dext > 0) {\n              // sum up the set differences\n              d += dext; // keep e in Ei\n\n              cindex[pn++] = e; // compute the hash of node i\n\n              h += e;\n            } else {\n              // aggressive absorb. e->k\n              cptr[e] = csFlip(k); // e is a dead element\n\n              W[w + e] = 0;\n            }\n          }\n        } // W[elen + i] = |Ei|\n\n\n        W[elen + i] = pn - p1 + 1;\n        var p3 = pn;\n        var p4 = p1 + W[len + i]; // prune edges in Ai\n\n        for (p = p2 + 1; p < p4; p++) {\n          j = cindex[p]; // check node j dead or in Lk\n\n          var nvj = W[nv + j];\n\n          if (nvj <= 0) {\n            continue;\n          } // degree(i) += |j|\n\n\n          d += nvj; // place j in node list of i\n\n          cindex[pn++] = j; // compute hash for node i\n\n          h += j;\n        } // check for mass elimination\n\n\n        if (d === 0) {\n          // absorb i into k\n          cptr[i] = csFlip(k);\n          nvi = -W[nv + i]; // |Lk| -= |i|\n\n          dk -= nvi; // |k| += W[nv + i]\n\n          nvk += nvi;\n          nel += nvi;\n          W[nv + i] = 0; // node i is dead\n\n          W[elen + i] = -1;\n        } else {\n          // update degree(i)\n          W[degree + i] = Math.min(W[degree + i], d); // move first node to end\n\n          cindex[pn] = cindex[p3]; // move 1st el. to end of Ei\n\n          cindex[p3] = cindex[p1]; // add k as 1st element in of Ei\n\n          cindex[p1] = k; // new len of adj. list of node i\n\n          W[len + i] = pn - p1 + 1; // finalize hash of i\n\n          h = (h < 0 ? -h : h) % n; // place i in hash bucket\n\n          W[next + i] = W[hhead + h];\n          W[hhead + h] = i; // save hash of i in last[i]\n\n          last[i] = h;\n        }\n      } // finalize |Lk|\n\n\n      W[degree + k] = dk;\n      lemax = Math.max(lemax, dk); // clear w\n\n      mark = _wclear(mark + lemax, lemax, W, w, 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\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check i is dead, skip it\n\n        if (W[nv + i] >= 0) {\n          continue;\n        } // scan hash bucket of node i\n\n\n        h = last[i];\n        i = W[hhead + h]; // hash bucket will be empty\n\n        W[hhead + h] = -1;\n\n        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {\n          ln = W[len + i];\n          eln = W[elen + i];\n\n          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {\n            W[w + cindex[p]] = mark;\n          }\n\n          var jlast = i; // compare i with all j\n\n          for (j = W[next + i]; j !== -1;) {\n            var ok = W[len + j] === ln && W[elen + j] === eln;\n\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) {\n                ok = 0;\n              }\n            } // check i and j are identical\n\n\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; // node j is dead\n\n              W[elen + j] = -1; // delete j from hash bucket\n\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      } // 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\n\n      for (p = pk1, pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check  i is dead, skip it\n\n        if ((nvi = -W[nv + i]) <= 0) {\n          continue;\n        } // restore W[nv + i]\n\n\n        W[nv + i] = nvi; // compute external degree(i)\n\n        d = W[degree + i] + dk - nvi;\n        d = Math.min(d, n - nel - nvi);\n\n        if (W[head + d] !== -1) {\n          last[W[head + d]] = i;\n        } // put i back in degree list\n\n\n        W[next + i] = W[head + d];\n        last[i] = -1;\n        W[head + d] = i; // find new minimum degree\n\n        mindeg = Math.min(mindeg, d);\n        W[degree + i] = d; // place i in Lk\n\n        cindex[p++] = i;\n      } // # nodes absorbed into k\n\n\n      W[nv + k] = nvk; // length of adj list of element k\n\n      if ((W[len + k] = p - pk1) === 0) {\n        // k is a root of the tree\n        cptr[k] = -1; // k is now a dead element\n\n        W[w + k] = 0;\n      }\n\n      if (elenk !== 0) {\n        // free unused space in Lk\n        cnz = p;\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    // fix assembly tree\n\n\n    for (i = 0; i < n; i++) {\n      cptr[i] = csFlip(cptr[i]);\n    }\n\n    for (j = 0; j <= n; j++) {\n      W[head + j] = -1;\n    } // place unordered nodes in lists\n\n\n    for (j = n; j >= 0; j--) {\n      // skip if j is an element\n      if (W[nv + j] > 0) {\n        continue;\n      } // place j in list of its parent\n\n\n      W[next + j] = W[head + cptr[j]];\n      W[head + cptr[j]] = j;\n    } // place elements in lists\n\n\n    for (e = n; e >= 0; e--) {\n      // skip unless e is an element\n      if (W[nv + e] <= 0) {\n        continue;\n      }\n\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    } // postorder the assembly tree\n\n\n    for (k = 0, i = 0; i <= n; i++) {\n      if (cptr[i] === -1) {\n        k = csTdfs(i, k, W, head, next, P, w);\n      }\n    } // remove last item in array\n\n\n    P.splice(P.length - 1, 1); // return P\n\n    return P;\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\n  function _createTargetMatrix(order, a, m, n, dense) {\n    // compute A'\n    var at = transpose(a); // check order = 1, matrix must be square\n\n    if (order === 1 && n === m) {\n      // C = A + A'\n      return add(a, at);\n    } // check order = 2, drop dense columns from M'\n\n\n    if (order === 2) {\n      // transpose arrays\n      var tindex = at._index;\n      var tptr = at._ptr; // new column index\n\n      var p2 = 0; // loop A' columns (rows)\n\n      for (var j = 0; j < m; j++) {\n        // column j of AT starts here\n        var p = tptr[j]; // new column j starts here\n\n        tptr[j] = p2; // skip dense col j\n\n        if (tptr[j + 1] - p > dense) {\n          continue;\n        } // map rows in column j of A\n\n\n        for (var p1 = tptr[j + 1]; p < p1; p++) {\n          tindex[p2++] = tindex[p];\n        }\n      } // finalize AT\n\n\n      tptr[m] = p2; // recreate A from new transpose matrix\n\n      a = transpose(at); // use A' * A\n\n      return multiply(at, a);\n    } // use A' * A, square or rectangular matrix\n\n\n    return multiply(at, a);\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\n\n  function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {\n    // Initialize quotient graph\n    for (var k = 0; k < n; k++) {\n      W[len + k] = cptr[k + 1] - cptr[k];\n    }\n\n    W[len + n] = 0; // initialize workspace\n\n    for (var 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; // hash list i is empty\n\n      W[hhead + i] = -1; // node i is just one node\n\n      W[nv + i] = 1; // node i is alive\n\n      W[w + i] = 1; // Ek of node i is empty\n\n      W[elen + i] = 0; // degree of node i\n\n      W[degree + i] = W[len + i];\n    } // clear w\n\n\n    var mark = _wclear(0, 0, W, w, n); // n is a dead element\n\n\n    W[elen + n] = -2; // n is a root of assembly tree\n\n    cptr[n] = -1; // n is a dead element\n\n    W[w + n] = 0; // return mark\n\n    return mark;\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\n\n  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {\n    // result\n    var nel = 0; // loop columns\n\n    for (var i = 0; i < n; i++) {\n      // degree @ i\n      var d = W[degree + i]; // check node i is empty\n\n      if (d === 0) {\n        // element i is dead\n        W[elen + i] = -2;\n        nel++; // i is a root of assembly tree\n\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; // node i is dead\n\n        W[elen + i] = -1;\n        nel++;\n        cptr[i] = csFlip(n);\n        W[nv + n]++;\n      } else {\n        var h = W[head + d];\n\n        if (h !== -1) {\n          last[h] = i;\n        } // put node i in degree list d\n\n\n        W[next + i] = W[head + d];\n        W[head + d] = i;\n      }\n    }\n\n    return nel;\n  }\n\n  function _wclear(mark, lemax, W, w, n) {\n    if (mark < 2 || mark + lemax < 0) {\n      for (var k = 0; k < n; k++) {\n        if (W[w + k] !== 0) {\n          W[w + k] = 1;\n        }\n      }\n\n      mark = 2;\n    } // at this point, W [0..n-1] < mark holds\n\n\n    return mark;\n  }\n\n  function _diag(i, j) {\n    return i !== j;\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  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size; // columns\n\n  var n = asize[1]; // nonzero items\n\n  var nz = 0; // loop columns\n\n  for (var j = 0; j < n; j++) {\n    // get current location of col j\n    var p = aptr[j]; // record new location of col j\n\n    aptr[j] = nz;\n\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]; // check we need to process values (pattern only)\n\n        if (avalues) {\n          avalues[nz] = avalues[p];\n        } // increment nonzero items\n\n\n        nz++;\n      }\n    }\n  } // finalize A\n\n\n  aptr[n] = nz; // trim arrays\n\n  aindex.splice(nz, aindex.length - nz); // check we need to process values (pattern only)\n\n  if (avalues) {\n    avalues.splice(nz, avalues.length - nz);\n  } // return number of nonzero items\n\n\n  return nz;\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  var s, sparent; // our result\n\n  var jleaf = 0;\n  var q; // check j is a leaf\n\n  if (i <= j || w[first + j] <= w[maxfirst + i]) {\n    return -1;\n  } // update max first[j] seen so far\n\n\n  w[maxfirst + i] = w[first + j]; // jprev = previous leaf of ith subtree\n\n  var jprev = w[prevleaf + i];\n  w[prevleaf + i] = j; // check j is first or subsequent leaf\n\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; // q = least common ancester (jprev,j)\n\n    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]) {\n      ;\n    }\n\n    for (s = jprev; s !== q; s = sparent) {\n      // path compression\n      sparent = w[ancestor + s];\n      w[ancestor + s] = q;\n    }\n  }\n\n  return {\n    jleaf: jleaf,\n    q: q\n  };\n}","import { factory } from '../../../utils/factory.js';\nimport { csLeaf } from './csLeaf.js';\nvar name = 'csCounts';\nvar dependencies = ['transpose'];\nexport var createCsCounts = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    transpose\n  } = _ref;\n\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) {\n      return null;\n    } // a matrix arrays\n\n\n    var asize = a._size; // rows and columns\n\n    var m = asize[0];\n    var n = asize[1]; // variables\n\n    var i, j, k, J, p, p0, p1; // workspace size\n\n    var s = 4 * n + (ata ? n + m + 1 : 0); // allocate workspace\n\n    var w = []; // (s)\n\n    var ancestor = 0; // first n entries\n\n    var maxfirst = n; // next n entries\n\n    var prevleaf = 2 * n; // next n entries\n\n    var first = 3 * n; // next n entries\n\n    var head = 4 * n; // next n + 1 entries (used when ata is true)\n\n    var next = 5 * n + 1; // last entries in workspace\n    // clear workspace w[0..s-1]\n\n    for (k = 0; k < s; k++) {\n      w[k] = -1;\n    } // allocate result\n\n\n    var colcount = []; // (n)\n    // AT = A'\n\n    var at = transpose(a); // at arrays\n\n    var tindex = at._index;\n    var tptr = at._ptr; // find w[first + j]\n\n    for (k = 0; k < n; k++) {\n      j = post[k]; // colcount[j]=1 if j is a leaf\n\n      colcount[j] = w[first + j] === -1 ? 1 : 0;\n\n      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {\n        w[first + j] = k;\n      }\n    } // initialize ata if needed\n\n\n    if (ata) {\n      // invert post\n      for (k = 0; k < n; k++) {\n        w[post[k]] = k;\n      } // loop rows (columns in AT)\n\n\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++) {\n          k = Math.min(k, w[tindex[p]]);\n        } // place row i in linked list k\n\n\n        w[next + i] = w[head + k];\n        w[head + k] = i;\n      }\n    } // each node in its own set\n\n\n    for (i = 0; i < n; i++) {\n      w[ancestor + i] = i;\n    }\n\n    for (k = 0; k < n; k++) {\n      // j is the kth node in postordered etree\n      j = post[k]; // check j is not a root\n\n      if (parent[j] !== -1) {\n        colcount[parent[j]]--;\n      } // J=j for LL'=A case\n\n\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          var r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor); // check A(i,j) is in skeleton\n\n          if (r.jleaf >= 1) {\n            colcount[j]++;\n          } // check account for overlap in q\n\n\n          if (r.jleaf === 2) {\n            colcount[r.q]--;\n          }\n        }\n      }\n\n      if (parent[j] !== -1) {\n        w[ancestor + j] = parent[j];\n      }\n    } // sum up colcount's of each child\n\n\n    for (j = 0; j < n; j++) {\n      if (parent[j] !== -1) {\n        colcount[parent[j]] += colcount[j];\n      }\n    }\n\n    return colcount;\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';\nvar name = 'csSqr';\nvar dependencies = ['add', 'multiply', 'transpose'];\nexport var createCsSqr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    add,\n    multiply,\n    transpose\n  } = _ref;\n  var csAmd = createCsAmd({\n    add,\n    multiply,\n    transpose\n  });\n  var csCounts = createCsCounts({\n    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\n  return function csSqr(order, a, qr) {\n    // a arrays\n    var aptr = a._ptr;\n    var asize = a._size; // columns\n\n    var n = asize[1]; // vars\n\n    var k; // symbolic analysis result\n\n    var s = {}; // fill-reducing ordering\n\n    s.q = csAmd(order, a); // validate results\n\n    if (order && !s.q) {\n      return null;\n    } // QR symbolic analysis\n\n\n    if (qr) {\n      // apply permutations if needed\n      var c = order ? csPermute(a, null, s.q, 0) : a; // etree of C'*C, where C=A(:,q)\n\n      s.parent = csEtree(c, 1); // post order elimination tree\n\n      var post = csPost(s.parent, n); // col counts chol(C'*C)\n\n      s.cp = csCounts(c, s.parent, post, 1); // check we have everything needed to calculate number of nonzero elements\n\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++) {\n          s.unz += s.cp[k];\n        }\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    } // return result S\n\n\n    return s;\n  };\n  /**\n   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent\n   */\n\n  function _vcount(a, s) {\n    // a arrays\n    var aptr = a._ptr;\n    var aindex = a._index;\n    var asize = a._size; // rows & columns\n\n    var m = asize[0];\n    var n = asize[1]; // initialize s arrays\n\n    s.pinv = []; // (m + n)\n\n    s.leftmost = []; // (m)\n    // vars\n\n    var parent = s.parent;\n    var pinv = s.pinv;\n    var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n\n    var w = []; // (m + 3 * n)\n\n    var next = 0;\n    var head = m;\n    var tail = m + n;\n    var nque = m + 2 * n; // vars\n\n    var i, k, p, p0, p1; // initialize w\n\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    } // initialize row arrays\n\n\n    for (i = 0; i < m; i++) {\n      leftmost[i] = -1;\n    } // loop columns backwards\n\n\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    } // scan rows in reverse order\n\n\n    for (i = m - 1; i >= 0; i--) {\n      // row i is not yet ordered\n      pinv[i] = -1;\n      k = leftmost[i]; // check row i is empty\n\n      if (k === -1) {\n        continue;\n      } // first row in queue k\n\n\n      if (w[nque + k]++ === 0) {\n        w[tail + k] = i;\n      } // put i at head of queue k\n\n\n      w[next + i] = w[head + k];\n      w[head + k] = i;\n    }\n\n    s.lnz = 0;\n    s.m2 = m; // find row permutation and nnz(V)\n\n    for (k = 0; k < n; k++) {\n      // remove row i from queue k\n      i = w[head + k]; // count V(k,k) as nonzero\n\n      s.lnz++; // add a fictitious row\n\n      if (i < 0) {\n        i = s.m2++;\n      } // associate row i with V(:,k)\n\n\n      pinv[i] = k; // skip if V(k+1:m,k) is empty\n\n      if (--nque[k] <= 0) {\n        continue;\n      } // nque[k] is nnz (V(k+1:m,k))\n\n\n      s.lnz += w[nque + k]; // move all rows to parent of k\n\n      var pa = parent[k];\n\n      if (pa !== -1) {\n        if (w[nque + pa] === 0) {\n          w[tail + pa] = w[tail + k];\n        }\n\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\n    for (i = 0; i < m; i++) {\n      if (pinv[i] < 0) {\n        pinv[i] = k++;\n      }\n    }\n\n    return true;\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  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size;\n  var adt = a._datatype; // rows & columns\n\n  var m = asize[0];\n  var n = asize[1]; // c arrays\n\n  var cvalues = values && a._values ? [] : null;\n  var cindex = []; // (aptr[n])\n\n  var cptr = []; // (n + 1)\n  // initialize vars\n\n  var nz = 0; // loop columns\n\n  for (var k = 0; k < n; k++) {\n    // column k of C is column q[k] of A\n    cptr[k] = nz; // apply column permutation\n\n    var j = q ? q[k] : k; // loop values in column j of A\n\n    for (var t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {\n      // row i of A is row pinv[i] of C\n      var r = pinv ? pinv[aindex[t]] : aindex[t]; // index\n\n      cindex[nz] = r; // check we need to populate values\n\n      if (cvalues) {\n        cvalues[nz] = avalues[t];\n      } // increment number of nonzero elements\n\n\n      nz++;\n    }\n  } // finalize the last column of C\n\n\n  cptr[n] = nz; // return C matrix\n\n  return a.createSparseMatrix({\n    values: cvalues,\n    index: cindex,\n    ptr: cptr,\n    size: [m, n],\n    datatype: adt\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) {\n    return null;\n  } // a arrays\n\n\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size; // rows & columns\n\n  var m = asize[0];\n  var n = asize[1]; // allocate result\n\n  var parent = []; // (n)\n  // allocate workspace\n\n  var w = []; // (n + (ata ? m : 0))\n\n  var ancestor = 0; // first n entries in w\n\n  var prev = n; // last m entries (ata = true)\n\n  var i, inext; // check we are calculating A'A\n\n  if (ata) {\n    // initialize workspace\n    for (i = 0; i < m; i++) {\n      w[prev + i] = -1;\n    }\n  } // loop columns\n\n\n  for (var k = 0; k < n; k++) {\n    // node k has no parent yet\n    parent[k] = -1; // nor does k have an ancestor\n\n    w[ancestor + k] = -1; // values in column k\n\n    for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n      // row\n      var r = aindex[p]; // node\n\n      i = ata ? w[prev + r] : r; // traverse from i to k\n\n      for (; i !== -1 && i < k; i = inext) {\n        // inext = ancestor of i\n        inext = w[ancestor + i]; // path compression\n\n        w[ancestor + i] = k; // check no anc., parent is k\n\n        if (inext === -1) {\n          parent[i] = k;\n        }\n      }\n\n      if (ata) {\n        w[prev + r] = k;\n      }\n    }\n  }\n\n  return parent;\n}","import { csTdfs } from './csTdfs.js';\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 */\n\nexport function csPost(parent, n) {\n  // check inputs\n  if (!parent) {\n    return null;\n  } // vars\n\n\n  var k = 0;\n  var j; // allocate result\n\n  var post = []; // (n)\n  // workspace, head: first n entries, next: next n entries, stack: last n entries\n\n  var w = []; // (3 * n)\n\n  var head = 0;\n  var next = n;\n  var stack = 2 * n; // initialize workspace\n\n  for (j = 0; j < n; j++) {\n    // empty linked lists\n    w[head + j] = -1;\n  } // traverse nodes in reverse order\n\n\n  for (j = n - 1; j >= 0; j--) {\n    // check j is a root\n    if (parent[j] === -1) {\n      continue;\n    } // add j to list of its parent\n\n\n    w[next + j] = w[head + parent[j]];\n    w[head + parent[j]] = j;\n  } // loop nodes\n\n\n  for (j = 0; j < n; j++) {\n    // skip j if it is not a root\n    if (parent[j] !== -1) {\n      continue;\n    } // depth-first search\n\n\n    k = csTdfs(j, k, w, head, next, post, stack);\n  }\n\n  return post;\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}","import { csFlip } from './csFlip.js';\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 */\n\nexport function csMark(w, j) {\n  // mark w[j]\n  w[j] = csFlip(w[j]);\n}","import { csFlip } from './csFlip.js';\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 */\n\nexport function csUnflip(i) {\n  // flip the value if it is negative\n  return i < 0 ? csFlip(i) : i;\n}","import { csMarked } from './csMarked.js';\nimport { csMark } from './csMark.js';\nimport { csUnflip } from './csUnflip.js';\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 */\n\nexport function csDfs(j, g, top, xi, pinv) {\n  // g arrays\n  var index = g._index;\n  var ptr = g._ptr;\n  var size = g._size; // columns\n\n  var n = size[1]; // vars\n\n  var i, p, p2; // initialize head\n\n  var head = 0; // initialize the recursion stack\n\n  xi[0] = j; // loop\n\n  while (head >= 0) {\n    // get j from the top of the recursion stack\n    j = xi[head]; // apply permutation vector\n\n    var jnew = pinv ? pinv[j] : j; // check node j is marked\n\n    if (!csMarked(ptr, j)) {\n      // mark node j as visited\n      csMark(ptr, j); // update stack (last n entries in xi)\n\n      xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew]);\n    } // node j done if no unvisited neighbors\n\n\n    var done = 1; // examine all neighbors of j, stack (last n entries in xi)\n\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]; // check we have visited node i, skip it\n\n      if (csMarked(ptr, i)) {\n        continue;\n      } // pause depth-first search of node j, update stack (last n entries in xi)\n\n\n      xi[n + head] = p; // start dfs at node i\n\n      xi[++head] = i; // node j is not done\n\n      done = 0; // break, to start dfs(i)\n\n      break;\n    } // check depth-first search at node j is done\n\n\n    if (done) {\n      // remove j from the recursion stack\n      head--; // and place in the output stack\n\n      xi[--top] = j;\n    }\n  }\n\n  return top;\n}","import { csReach } from './csReach.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'csSpsolve';\nvar dependencies = ['divideScalar', 'multiply', 'subtract'];\nexport var createCsSpsolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    divideScalar,\n    multiply,\n    subtract\n  } = _ref;\n\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    var gvalues = g._values;\n    var gindex = g._index;\n    var gptr = g._ptr;\n    var gsize = g._size; // columns\n\n    var n = gsize[1]; // b arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr; // vars\n\n    var p, p0, p1, q; // xi[top..n-1] = csReach(B(:,k))\n\n    var top = csReach(g, b, k, xi, pinv); // clear x\n\n    for (p = top; p < n; p++) {\n      x[xi[p]] = 0;\n    } // scatter b\n\n\n    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n      x[bindex[p]] = bvalues[p];\n    } // loop columns\n\n\n    for (var px = top; px < n; px++) {\n      // x array index for px\n      var j = xi[px]; // apply permutation vector (U x = b), j maps to column J of G\n\n      var J = pinv ? pinv[j] : j; // check column J is empty\n\n      if (J < 0) {\n        continue;\n      } // column value indeces in G, p0 <= p < p1\n\n\n      p0 = gptr[J];\n      p1 = gptr[J + 1]; // x(j) /= G(j,j)\n\n      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]); // first entry L(j,j)\n\n      p = lo ? p0 + 1 : p0;\n      q = lo ? p1 : p1 - 1; // loop\n\n      for (; p < q; p++) {\n        // row\n        var i = gindex[p]; // x(i) -= G(i,j) * x(j)\n\n        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));\n      }\n    } // return top of stack\n\n\n    return top;\n  };\n});","import { csMarked } from './csMarked.js';\nimport { csMark } from './csMark.js';\nimport { csDfs } from './csDfs.js';\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 */\n\nexport function csReach(g, b, k, xi, pinv) {\n  // g arrays\n  var gptr = g._ptr;\n  var gsize = g._size; // b arrays\n\n  var bindex = b._index;\n  var bptr = b._ptr; // columns\n\n  var n = gsize[1]; // vars\n\n  var p, p0, p1; // initialize top\n\n  var top = n; // loop column indeces in B\n\n  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n    // node i\n    var i = bindex[p]; // check node i is marked\n\n    if (!csMarked(gptr, i)) {\n      // start a dfs at unmarked node i\n      top = csDfs(i, g, top, xi, pinv);\n    }\n  } // loop columns from top -> n - 1\n\n\n  for (p = top; p < n; p++) {\n    // restore G\n    csMark(gptr, xi[p]);\n  }\n\n  return top;\n}","import { factory } from '../../../utils/factory.js';\nimport { createCsSpsolve } from './csSpsolve.js';\nvar name = 'csLu';\nvar dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nexport var createCsLu = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    abs,\n    divideScalar,\n    multiply,\n    subtract,\n    larger,\n    largerEq,\n    SparseMatrix\n  } = _ref;\n  var csSpsolve = createCsSpsolve({\n    divideScalar,\n    multiply,\n    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\n  return function csLu(m, s, tol) {\n    // validate input\n    if (!m) {\n      return null;\n    } // m arrays\n\n\n    var size = m._size; // columns\n\n    var n = size[1]; // symbolic analysis result\n\n    var q;\n    var lnz = 100;\n    var unz = 100; // update symbolic analysis parameters\n\n    if (s) {\n      q = s.q;\n      lnz = s.lnz || lnz;\n      unz = s.unz || unz;\n    } // L arrays\n\n\n    var lvalues = []; // (lnz)\n\n    var lindex = []; // (lnz)\n\n    var lptr = []; // (n + 1)\n    // L\n\n    var L = new SparseMatrix({\n      values: lvalues,\n      index: lindex,\n      ptr: lptr,\n      size: [n, n]\n    }); // U arrays\n\n    var uvalues = []; // (unz)\n\n    var uindex = []; // (unz)\n\n    var uptr = []; // (n + 1)\n    // U\n\n    var U = new SparseMatrix({\n      values: uvalues,\n      index: uindex,\n      ptr: uptr,\n      size: [n, n]\n    }); // inverse of permutation vector\n\n    var pinv = []; // (n)\n    // vars\n\n    var i, p; // allocate arrays\n\n    var x = []; // (n)\n\n    var xi = []; // (2 * n)\n    // initialize variables\n\n    for (i = 0; i < n; i++) {\n      // clear workspace\n      x[i] = 0; // no rows pivotal yet\n\n      pinv[i] = -1; // no cols of L yet\n\n      lptr[i + 1] = 0;\n    } // reset number of nonzero elements in L and U\n\n\n    lnz = 0;\n    unz = 0; // compute L(:,k) and U(:,k)\n\n    for (var k = 0; k < n; k++) {\n      // update ptr\n      lptr[k] = lnz;\n      uptr[k] = unz; // apply column permutations if needed\n\n      var col = q ? q[k] : k; // solve triangular system, x = L\\A(:,col)\n\n      var top = csSpsolve(L, m, col, xi, x, pinv, 1); // find pivot\n\n      var ipiv = -1;\n      var a = -1; // loop xi[] from top -> n\n\n      for (p = top; p < n; p++) {\n        // x[i] is nonzero\n        i = xi[p]; // check row i is not yet pivotal\n\n        if (pinv[i] < 0) {\n          // absolute value of x[i]\n          var xabs = abs(x[i]); // check absoulte value is greater than pivot value\n\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      } // validate we found a valid pivot\n\n\n      if (ipiv === -1 || a <= 0) {\n        return null;\n      } // update actual pivot column, give preference to diagonal value\n\n\n      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {\n        ipiv = col;\n      } // the chosen pivot\n\n\n      var pivot = x[ipiv]; // last entry in U(:,k) is U(k,k)\n\n      uindex[unz] = k;\n      uvalues[unz++] = pivot; // ipiv is the kth pivot row\n\n      pinv[ipiv] = k; // first entry in L(:,k) is L(k,k) = 1\n\n      lindex[lnz] = ipiv;\n      lvalues[lnz++] = 1; // L(k+1:n,k) = x / pivot\n\n      for (p = top; p < n; p++) {\n        // row\n        i = xi[p]; // check x(i) is an entry in L(:,k)\n\n        if (pinv[i] < 0) {\n          // save unpermuted row in L\n          lindex[lnz] = i; // scale pivot column\n\n          lvalues[lnz++] = divideScalar(x[i], pivot);\n        } // x[0..n-1] = 0 for next k\n\n\n        x[i] = 0;\n      }\n    } // update ptr\n\n\n    lptr[n] = lnz;\n    uptr[n] = unz; // fix row indices of L for final pinv\n\n    for (p = 0; p < lnz; p++) {\n      lindex[p] = pinv[lindex[p]];\n    } // trim arrays\n\n\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); // return LU factor\n\n    return {\n      L: L,\n      U: U,\n      pinv: pinv\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';\nvar name = 'slu';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nexport var createSlu = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    add,\n    multiply,\n    transpose,\n    divideScalar,\n    subtract,\n    larger,\n    largerEq,\n    SparseMatrix\n  } = _ref;\n  var csSqr = createCsSqr({\n    add,\n    multiply,\n    transpose\n  });\n  var csLu = createCsLu({\n    abs,\n    divideScalar,\n    multiply,\n    subtract,\n    larger,\n    largerEq,\n    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\n  return typed(name, {\n    'SparseMatrix, number, number': function SparseMatrixNumberNumber(a, order, threshold) {\n      // verify order\n      if (!isInteger(order) || order < 0 || order > 3) {\n        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');\n      } // verify threshold\n\n\n      if (threshold < 0 || threshold > 1) {\n        throw new Error('Partial pivoting threshold must be a number from 0 to 1');\n      } // perform symbolic ordering and analysis\n\n\n      var s = csSqr(order, a, false); // perform lu decomposition\n\n      var f = csLu(a, s, threshold); // return decomposition\n\n      return {\n        L: f.L,\n        U: f.U,\n        p: f.pinv,\n        q: s.q,\n        toString: function toString() {\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});","import { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'det';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];\nexport var createDet = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    multiply,\n    unaryMinus,\n    lup\n  } = _ref;\n\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 any(x) {\n      return clone(x);\n    },\n    'Array | Matrix': function det(x) {\n      var size;\n\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 ' + '(size: ' + format(size) + ')');\n          }\n\n        case 2:\n          {\n            // two dimensional array\n            var rows = size[0];\n            var cols = size[1];\n\n            if (rows === cols) {\n              return _det(x.clone().valueOf(), rows, cols);\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\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\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(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));\n    } else {\n      // Compute the LU decomposition\n      var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)\n\n      var det = decomp.U[0][0];\n\n      for (var _i = 1; _i < rows; _i++) {\n        det = multiply(det, decomp.U[_i][_i]);\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\n\n      var evenCycles = 0;\n      var i = 0;\n      var visited = [];\n\n      while (true) {\n        while (visited[i]) {\n          i++;\n        }\n\n        if (i >= rows) break;\n        var j = i;\n        var cycleLen = 0;\n\n        while (!visited[decomp.p[j]]) {\n          visited[decomp.p[j]] = true;\n          j = decomp.p[j];\n          cycleLen++;\n        }\n\n        if (cycleLen % 2 === 0) {\n          evenCycles++;\n        }\n      }\n\n      return evenCycles % 2 === 0 ? det : unaryMinus(det);\n    }\n  }\n});","import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'distance';\nvar dependencies = ['typed', 'addScalar', 'subtract', 'divideScalar', 'multiplyScalar', 'unaryMinus', 'sqrt', 'abs'];\nexport var createDistance = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    subtract,\n    multiplyScalar,\n    divideScalar,\n    unaryMinus,\n    sqrt,\n    abs\n  } = _ref;\n\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 ArrayArrayArray(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)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n        }\n\n        var m = divideScalar(subtract(z[1], z[0]), subtract(y[1], y[0]));\n        var xCoeff = multiplyScalar(multiplyScalar(m, m), y[0]);\n        var yCoeff = unaryMinus(multiplyScalar(m, y[0]));\n        var constant = x[1];\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 ObjectObjectObject(x, y, z) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');\n        }\n\n        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {\n          var m = divideScalar(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX));\n          var xCoeff = multiplyScalar(multiplyScalar(m, m), y.lineOnePtX);\n          var yCoeff = unaryMinus(multiplyScalar(m, y.lineOnePtX));\n          var constant = x.pointX;\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 ArrayArray(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\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\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\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 ObjectObject(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\n        if (!_3d(y)) {\n          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');\n        }\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\n        if (!_parametricLine(y)) {\n          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');\n        }\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\n        if (!_2d(y)) {\n          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');\n        }\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\n        if (!_3d(y)) {\n          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');\n        }\n\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {\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 Array(arr) {\n      if (!_pairwise(arr)) {\n        throw new TypeError('Incorrect array format entered for pairwise distance calculation');\n      }\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\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\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\n    return a.every(_isNumber);\n  }\n\n  function _parametricLine(a) {\n    if (a.constructor !== Array) {\n      a = _objectToArray(a);\n    }\n\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);\n  }\n\n  function _objectToArray(o) {\n    var keys = Object.keys(o);\n    var a = [];\n\n    for (var i = 0; i < keys.length; i++) {\n      a.push(o[keys[i]]);\n    }\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\n    return true;\n  }\n\n  function _distancePointLine2D(x, y, a, b, c) {\n    var num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));\n    var 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    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))];\n    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));\n    var 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    var vectorSize = x.length;\n    var result = 0;\n    var diff = 0;\n\n    for (var i = 0; i < vectorSize; i++) {\n      diff = subtract(x[i], y[i]);\n      result = addScalar(multiplyScalar(diff, diff), result);\n    }\n\n    return sqrt(result);\n  }\n\n  function _distancePairwise(a) {\n    var result = [];\n    var pointA = [];\n    var pointB = [];\n\n    for (var i = 0; i < a.length - 1; i++) {\n      for (var 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\n        result.push(_euclideanDistance(pointA, pointB));\n      }\n    }\n\n    return result;\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'stirlingS2';\nvar dependencies = ['typed', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'larger'];\nexport var createStirlingS2 = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    subtract,\n    multiplyScalar,\n    divideScalar,\n    pow,\n    factorial,\n    combinations,\n    isNegative,\n    isInteger,\n    larger\n  } = _ref;\n\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, then s(n,k) = 1\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 numberBigNumberNumberBigNumber(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      } // 1/k! Sum(i=0 -> k) [(-1)^(k-i)*C(k,j)* i^n]\n\n\n      var kFactorial = factorial(k);\n      var result = 0;\n\n      for (var i = 0; i <= k; i++) {\n        var negativeOne = pow(-1, subtract(k, i));\n        var kChooseI = combinations(k, i);\n        var iPower = pow(i, n);\n        result = addScalar(result, multiplyScalar(multiplyScalar(kChooseI, iPower), negativeOne));\n      }\n\n      return divideScalar(result, kFactorial);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'catalan';\nvar dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];\nexport var createCatalan = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    combinations,\n    isNegative,\n    isInteger\n  } = _ref;\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 numberBigNumber(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});","import { factory } from '../../utils/factory.js';\nvar name = 'count';\nvar dependencies = ['typed', 'size', 'prod'];\nexport var createCount = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    size,\n    prod\n  } = _ref;\n\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 string(x) {\n      return x.length;\n    },\n    'Matrix | Array': function MatrixArray(x) {\n      return prod(size(x));\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { logNumber } from '../../plain/number/index.js';\nvar name = 'log';\nvar dependencies = ['config', 'typed', 'divideScalar', 'Complex'];\nexport var createLog = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    Complex\n  } = _ref;\n\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 number(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    Complex: function Complex(x) {\n      return x.log();\n    },\n    BigNumber: function BigNumber(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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    },\n    'any, any': function anyAny(x, base) {\n      // calculate logarithm for a specified base, log(x, base)\n      return divideScalar(this(x), this(base));\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';\nvar name = 'dotDivide';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix'];\nexport var createDotDivide = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    divideScalar,\n    DenseMatrix\n  } = _ref;\n  var algorithm02 = createAlgorithm02({\n    typed,\n    equalScalar\n  });\n  var algorithm03 = createAlgorithm03({\n    typed\n  });\n  var algorithm07 = createAlgorithm07({\n    typed,\n    DenseMatrix\n  });\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm12 = createAlgorithm12({\n    typed,\n    DenseMatrix\n  });\n  var algorithm13 = createAlgorithm13({\n    typed\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed(name, {\n    'any, any': divideScalar,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, divideScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, divideScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, divideScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, divideScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return this(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return this(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return this(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, divideScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, divideScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, divideScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, divideScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, divideScalar, true).valueOf();\n    }\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createUsolveAll = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var R = _denseBackwardSubstitution(m, b);\n\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/project/5e6c87c554a3190001a3fc93\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // loop columns backwards\n\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n          b[i] = divideScalar(b[i], M[i][i]);\n\n          for (var 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          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          var bNew = [...b];\n          bNew[i] = 1;\n\n          for (var _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({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n\n  function _sparseBackwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // loop columns backwards\n\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length; // loop right-hand sides\n\n      for (var k = 0; k < L; k++) {\n        var b = B[k]; // values & indices (column i)\n\n        var iValues = [];\n        var iIndices = []; // first & last indeces in column\n\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1]; // find the value at [i, i]\n\n        var Mii = 0;\n\n        for (var j = lastIndex - 1; j >= firstIndex; j--) {\n          var J = index[j]; // check row\n\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          b[i] = divideScalar(b[i], Mii); // loop upper triangular\n\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\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          var bNew = [...b];\n          bNew[i] = 1; // loop upper triangular\n\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);\n          }\n\n          B.push(bNew);\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { flatten } from '../../utils/array.js';\nvar name = 'hypot';\nvar dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];\nexport var createHypot = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    sqrt,\n    smaller,\n    isPositive\n  } = _ref;\n\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    Array: function Array(x) {\n      return this.apply(this, flatten(x));\n    },\n    Matrix: function Matrix(x) {\n      return this.apply(this, flatten(x.toArray()));\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\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    var result = 0;\n    var largest = 0;\n\n    for (var i = 0; i < args.length; i++) {\n      var value = abs(args[i]);\n\n      if (smaller(largest, value)) {\n        result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));\n        result = addScalar(result, 1);\n        largest = value;\n      } else {\n        result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);\n      }\n    }\n\n    return multiplyScalar(largest, sqrt(result));\n  }\n});","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); }\n\nimport { factory } from '../../../utils/factory.js';\nvar name = 'qr';\nvar dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'complex'];\nexport var createQr = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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 _extends(typed(name, {\n    DenseMatrix: function DenseMatrix(m) {\n      return _denseQR(m);\n    },\n    SparseMatrix: function SparseMatrix(m) {\n      return _sparseQR(m);\n    },\n    Array: function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a); // lup, use matrix implementation\n\n      var r = _denseQR(m); // result\n\n\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      };\n    }\n  }), {\n    _denseQRimpl\n  });\n\n  function _denseQRimpl(m) {\n    // rows & columns (m x n)\n    var rows = m._size[0]; // m\n\n    var cols = m._size[1]; // n\n\n    var Q = identity([rows], 'dense');\n    var Qdata = Q._data;\n    var R = m.clone();\n    var Rdata = R._data; // vars\n\n    var i, j, k;\n    var 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      var pivot = Rdata[k][k];\n      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));\n      var conjSgn = conj(sgn);\n      var 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      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));\n\n      if (!isZero(alpha)) {\n        // first element in vector u\n        var u1 = subtract(pivot, alpha); // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n\n        w[k] = 1;\n\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1);\n        } // tau = - conj(u1 / alpha)\n\n\n        var tau = unaryMinus(conj(divideScalar(u1, alpha)));\n        var s = void 0;\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\n        for (j = k; j < cols; j++) {\n          s = 0.0; // calculate jth element of [tranpose(w) * R]\n\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));\n          } // calculate the jth element of [tau * transpose(w) * R]\n\n\n          s = multiplyScalar(s, tau);\n\n          for (i = k; i < rows; i++) {\n            Rdata[i][j] = multiplyScalar(subtract(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);\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\n\n        for (i = 0; i < rows; i++) {\n          s = 0.0; // calculate ith element of [Q * w]\n\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));\n          } // calculate the ith element of [tau * Q * w]\n\n\n          s = multiplyScalar(s, tau);\n\n          for (j = k; j < rows; ++j) {\n            Qdata[i][j] = divideScalar(subtract(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);\n          }\n        }\n      }\n    } // return matrices\n\n\n    return {\n      Q: Q,\n      R: R,\n      toString: function toString() {\n        return 'Q: ' + this.Q.toString() + '\\nR: ' + this.R.toString();\n      }\n    };\n  }\n\n  function _denseQR(m) {\n    var ret = _denseQRimpl(m);\n\n    var Rdata = ret.R._data;\n\n    if (m._data.length > 0) {\n      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;\n\n      for (var i = 0; i < Rdata.length; ++i) {\n        for (var 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});","import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nvar name = 'inv';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];\nexport var createInv = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    addScalar,\n    multiply,\n    unaryMinus,\n    det,\n    identity,\n    abs\n  } = _ref;\n\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 ArrayMatrix(x) {\n      var size = isMatrix(x) ? x.size() : arraySize(x);\n\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if (isMatrix(x)) {\n              return matrix([divideScalar(1, x.valueOf()[0])]);\n            } else {\n              return [divideScalar(1, x[0])];\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n          }\n\n        case 2:\n          // two dimensional array\n          {\n            var rows = size[0];\n            var cols = size[1];\n\n            if (rows === cols) {\n              if (isMatrix(x)) {\n                return matrix(_inv(x.valueOf(), rows, cols), x.storage());\n              } else {\n                // return an Array\n                return _inv(x, rows, cols);\n              }\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\n      }\n    },\n    any: function any(x) {\n      // scalar\n      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers\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\n  function _inv(mat, rows, cols) {\n    var r, s, f, value, temp;\n\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0];\n\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n\n      return [[divideScalar(1, value)]];\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      var d = det(mat);\n\n      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n\n      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];\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      // make a copy of the matrix (only the arrays, not of the elements)\n      var A = mat.concat();\n\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat();\n      } // create an identity matrix which in the end will contain the\n      // matrix inverse\n\n\n      var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions\n\n      for (var c = 0; c < cols; c++) {\n        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]\n        var ABig = abs(A[c][c]);\n        var rBig = c;\n        r = c + 1;\n\n        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c]);\n            rBig = r;\n          }\n\n          r++;\n        }\n\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero');\n        }\n\n        r = rBig;\n\n        if (r !== c) {\n          temp = A[c];\n          A[c] = A[r];\n          A[r] = temp;\n          temp = B[c];\n          B[c] = B[r];\n          B[r] = temp;\n        } // eliminate non-zero values on the other rows at column c\n\n\n        var Ac = A[c];\n        var Bc = B[c];\n\n        for (r = 0; r < rows; r++) {\n          var Ar = A[r];\n          var Br = B[r];\n\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]); // add (f * row c) to row r to eliminate the value\n              // at column c\n\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));\n              }\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\n            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f);\n            }\n\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f);\n            }\n          }\n        }\n      }\n\n      return B;\n    }\n  }\n});","import { isSparseMatrix } from '../../utils/is.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'expm';\nvar dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];\nexport var createExpm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    add,\n    identity,\n    inv,\n    multiply\n  } = _ref;\n\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    Matrix: function Matrix(A) {\n      // Check matrix size\n      var size = A.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      var n = size[0]; // Desired accuracy of the approximant (The actual accuracy\n      // will be affected by round-off error)\n\n      var eps = 1e-15; // 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      // Compute infinity-norm of A, ||A||, to see how \"big\" it is\n\n      var infNorm = infinityNorm(A); // Find the optimal scaling factor and number of terms in the\n      // Padé approximant to reach the desired accuracy\n\n      var params = findParams(infNorm, eps);\n      var q = params.q;\n      var j = params.j; // 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      // Scale A by 1 / 2^j\n\n      var Apos = multiply(A, Math.pow(2, -j)); // The i=0 term is just the identity matrix\n\n      var N = identity(n);\n      var D = identity(n); // Initialization (i=0)\n\n      var factor = 1; // Initialization (i=1)\n\n      var AposToI = Apos; // Cloning not necessary\n\n      var alternate = -1;\n\n      for (var i = 1; i <= q; i++) {\n        if (i > 1) {\n          AposToI = multiply(AposToI, Apos);\n          alternate = -alternate;\n        }\n\n        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);\n        N = add(N, multiply(factor, AposToI));\n        D = add(D, multiply(factor * alternate, AposToI));\n      }\n\n      var R = multiply(inv(D), N); // Square j times\n\n      for (var _i = 0; _i < j; _i++) {\n        R = multiply(R, R);\n      }\n\n      return isSparseMatrix(A) ? A.createSparseMatrix(R) : R;\n    }\n  });\n\n  function infinityNorm(A) {\n    var n = A.size()[0];\n    var infNorm = 0;\n\n    for (var i = 0; i < n; i++) {\n      var rowSum = 0;\n\n      for (var j = 0; j < n; j++) {\n        rowSum += abs(A.get([i, j]));\n      }\n\n      infNorm = Math.max(rowSum, infNorm);\n    }\n\n    return infNorm;\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\n\n  function findParams(infNorm, eps) {\n    var maxSearchSize = 30;\n\n    for (var k = 0; k < maxSearchSize; k++) {\n      for (var q = 0; q <= k; q++) {\n        var j = k - q;\n\n        if (errorEstimate(infNorm, q, j) < eps) {\n          return {\n            q: q,\n            j: j\n          };\n        }\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   * Returns the estimated error of the Pade approximant for the given\n   * parameters.\n   */\n\n\n  function errorEstimate(infNorm, q, j) {\n    var qfac = 1;\n\n    for (var i = 2; i <= q; i++) {\n      qfac *= i;\n    }\n\n    var twoqfac = qfac;\n\n    for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {\n      twoqfac *= _i2;\n    }\n\n    var twoqp1fac = twoqfac * (2 * q + 1);\n    return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);\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';\nvar name = 'divide';\nvar dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];\nexport var createDivide = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    multiply,\n    equalScalar,\n    divideScalar,\n    inv\n  } = _ref;\n  var algorithm11 = createAlgorithm11({\n    typed,\n    equalScalar\n  });\n  var algorithm14 = createAlgorithm14({\n    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\n  return typed('divide', extend({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(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    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, divideScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, divideScalar, false);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array | Matrix': function anyArrayMatrix(x, y) {\n      return multiply(x, inv(y));\n    }\n  }, divideScalar.signatures));\n});","import { factory } from '../../utils/factory.js';\nvar name = 'kldivergence';\nvar dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric'];\nexport var createKldivergence = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divide,\n    sum,\n    multiply,\n    dotDivide,\n    log,\n    isNumeric\n  } = _ref;\n\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 ArrayArray(q, p) {\n      return _kldiv(matrix(q), matrix(p));\n    },\n    'Matrix, Array': function MatrixArray(q, p) {\n      return _kldiv(q, matrix(p));\n    },\n    'Array, Matrix': function ArrayMatrix(q, p) {\n      return _kldiv(matrix(q), p);\n    },\n    'Matrix, Matrix': function MatrixMatrix(q, p) {\n      return _kldiv(q, p);\n    }\n  });\n\n  function _kldiv(q, p) {\n    var plength = p.size().length;\n    var qlength = q.size().length;\n\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    } // Before calculation, apply normalization\n\n\n    var sumq = sum(q);\n\n    if (sumq === 0) {\n      throw new Error('Sum of elements in first object must be non zero');\n    }\n\n    var sump = sum(p);\n\n    if (sump === 0) {\n      throw new Error('Sum of elements in second object must be non zero');\n    }\n\n    var qnorm = divide(q, sum(q));\n    var pnorm = divide(p, sum(p));\n    var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));\n\n    if (isNumeric(result)) {\n      return result;\n    } else {\n      return Number.NaN;\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'bellNumbers';\nvar dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];\nexport var createBellNumbers = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    addScalar,\n    isNegative,\n    isInteger,\n    stirlingS2\n  } = _ref;\n\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 numberBigNumber(n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function bellNumbers');\n      } // Sum (k=0, n) S(n,k).\n\n\n      var result = 0;\n\n      for (var i = 0; i <= n; i++) {\n        result = addScalar(result, stirlingS2(n, i));\n      }\n\n      return result;\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { log1p as _log1p } from '../../utils/number.js';\nvar name = 'log1p';\nvar dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];\nexport var createLog1p = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    log,\n    Complex\n  } = _ref;\n\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 number(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    Complex: _log1pComplex,\n    BigNumber: function BigNumber(x) {\n      var y = x.plus(1);\n\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    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    },\n    'any, any': function anyAny(x, base) {\n      // calculate logarithm for a specified base, log1p(x, base)\n      return divideScalar(this(x), log(base));\n    }\n  });\n  /**\n   * Calculate the natural logarithm of a complex number + 1\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n\n  function _log1pComplex(x) {\n    var xRe1p = x.re + 1;\n    return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));\n  }\n});","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); }\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _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; }\n\nimport { 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';\nvar name = 'Unit';\nvar dependencies = ['?on', 'config', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];\nexport var createUnitClass = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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: _BigNumber,\n    Fraction: _Fraction\n  } = _ref;\n  var 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\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\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      var u = Unit.parse(name);\n      this.units = u.units;\n      this.dimensions = u.dimensions;\n    } else {\n      this.units = [{\n        unit: UNIT_NONE,\n        prefix: PREFIXES.NONE,\n        // link to a list with supported prefixes\n        power: 0\n      }];\n      this.dimensions = [];\n\n      for (var 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    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    // 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\n    this.skipAutomaticSimplification = true;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Unit.prototype.type = 'Unit';\n  Unit.prototype.isUnit = true; // private variables and functions for the Unit parser\n\n  var 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    var number = '';\n    var 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    } // get number, can have a single dot\n\n\n    if (c === '.') {\n      number += c;\n      next();\n\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\n      if (c === '.') {\n        number += c;\n        next();\n      }\n    }\n\n    while (isDigit(c)) {\n      number += c;\n      next();\n    } // check for exponential notation like \"2.3e-4\" or \"1.23e50\"\n\n\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      var tentativeNumber = '';\n      var tentativeIndex = index;\n      tentativeNumber += c;\n      next();\n\n      if (c === '+' || c === '-') {\n        tentativeNumber += c;\n        next();\n      } // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)\n\n\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      } // We can now safely say that this is scientific notation.\n\n\n      number = number + tentativeNumber;\n\n      while (isDigit(c)) {\n        number += c;\n        next();\n      }\n    }\n\n    return number;\n  }\n\n  function parseUnit() {\n    var unitName = ''; // Alphanumeric characters only; matches [a-zA-Z0-9]\n\n    while (isDigit(c) || Unit.isValidAlpha(c)) {\n      unitName += c;\n      next();\n    } // Must begin with [a-zA-Z]\n\n\n    var firstC = unitName.charAt(0);\n\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   * 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\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    var unit = new Unit();\n    unit.units = [];\n    var powerMultiplierCurrent = 1;\n    var expectingUnit = false; // A unit should follow this pattern:\n    // [number] ...[ [*/] unit[^number] ]\n    // unit[^number] ... [ [*/] unit[^number] ]\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(); // Optional number at the start of the string\n\n    var valueStr = parseNumber();\n    var value = null;\n\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 {\n        // number\n        value = parseFloat(valueStr);\n      }\n\n      skipWhitespace(); // Whitespace is not required here\n      // handle multiplication or division right after the value, like '1/s'\n\n      if (parseCharacter('*')) {\n        powerMultiplierCurrent = 1;\n        expectingUnit = true;\n      } else if (parseCharacter('/')) {\n        powerMultiplierCurrent = -1;\n        expectingUnit = true;\n      }\n    } // Stack to keep track of powerMultipliers applied to each parentheses group\n\n\n    var powerMultiplierStack = []; // Running product of all elements in powerMultiplierStack\n\n    var powerMultiplierStackProduct = 1;\n\n    while (true) {\n      skipWhitespace(); // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack\n      // A '(' will always appear directly before a unit.\n\n      while (c === '(') {\n        powerMultiplierStack.push(powerMultiplierCurrent);\n        powerMultiplierStackProduct *= powerMultiplierCurrent;\n        powerMultiplierCurrent = 1;\n        next();\n        skipWhitespace();\n      } // Is there something here?\n\n\n      var uStr = void 0;\n\n      if (c) {\n        var oldC = c;\n        uStr = parseUnit();\n\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      } // Verify the unit exists and get the prefix (if any)\n\n\n      var res = _findUnit(uStr);\n\n      if (res === null) {\n        // Unit not found.\n        throw new SyntaxError('Unit \"' + uStr + '\" not found.');\n      }\n\n      var power = powerMultiplierCurrent * powerMultiplierStackProduct; // Is there a \"^ number\"?\n\n      skipWhitespace();\n\n      if (parseCharacter('^')) {\n        skipWhitespace();\n        var p = parseNumber();\n\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\n        power *= p;\n      } // Add the unit to the list\n\n\n      unit.units.push({\n        unit: res.unit,\n        prefix: res.prefix,\n        power: power\n      });\n\n      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;\n      } // Check for and consume closing parentheses, popping from the stack.\n      // A ')' will always follow a unit.\n\n\n      skipWhitespace();\n\n      while (c === ')') {\n        if (powerMultiplierStack.length === 0) {\n          throw new SyntaxError('Unmatched \")\" in \"' + text + '\" at index ' + index.toString());\n        }\n\n        powerMultiplierStackProduct /= powerMultiplierStack.pop();\n        next();\n        skipWhitespace();\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\n\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      } // Replace the unit into the auto unit system\n\n\n      if (res.unit.base) {\n        var baseDim = res.unit.base.key;\n        UNIT_SYSTEMS.auto[baseDim] = {\n          unit: res.unit,\n          prefix: res.prefix\n        };\n      }\n    } // Has the string been entirely consumed?\n\n\n    skipWhitespace();\n\n    if (c) {\n      throw new SyntaxError('Could not parse: \"' + str + '\"');\n    } // Is there a trailing slash?\n\n\n    if (expectingUnit) {\n      throw new SyntaxError('Trailing characters: \"' + str + '\"');\n    } // Is the parentheses stack empty?\n\n\n    if (powerMultiplierStack.length !== 0) {\n      throw new SyntaxError('Unmatched \"(\" in \"' + text + '\"');\n    } // Are there any units at all?\n\n\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   * create a copy of this unit\n   * @memberof Unit\n   * @return {Unit} Returns a cloned version of the unit\n   */\n\n\n  Unit.prototype.clone = function () {\n    var unit = new Unit();\n    unit.fixPrefix = this.fixPrefix;\n    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;\n    unit.value = clone(this.value);\n    unit.dimensions = this.dimensions.slice(0);\n    unit.units = [];\n\n    for (var i = 0; i < this.units.length; i++) {\n      unit.units[i] = {};\n\n      for (var 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   * 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\n\n  Unit.prototype._isDerived = function () {\n    if (this.units.length === 0) {\n      return false;\n    }\n\n    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;\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\n\n  Unit.prototype._normalize = function (value) {\n    var unitValue, unitOffset, unitPower, unitPrefixValue;\n    var convert;\n\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    } else if (this._isDerived()) {\n      // This is a derived unit, so do not apply offsets.\n      // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n      var res = value;\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      for (var i = 0; i < this.units.length; i++) {\n        unitValue = convert(this.units[i].unit.value);\n        unitPrefixValue = convert(this.units[i].prefix.value);\n        unitPower = convert(this.units[i].power);\n        res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n      }\n\n      return res;\n    } else {\n      // This is a single unit of power 1, like kg or degC\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      unitValue = convert(this.units[0].unit.value);\n      unitOffset = convert(this.units[0].unit.offset);\n      unitPrefixValue = convert(this.units[0].prefix.value);\n      return multiplyScalar(addScalar(value, unitOffset), multiplyScalar(unitValue, unitPrefixValue));\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\n\n  Unit.prototype._denormalize = function (value, prefixValue) {\n    var unitValue, unitOffset, unitPower, unitPrefixValue;\n    var convert;\n\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    } else if (this._isDerived()) {\n      // This is a derived unit, so do not apply offsets.\n      // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n      // Also, prefixValue is ignored--but we will still use the prefix value stored in each unit, since kg is usually preferable to g unless the user decides otherwise.\n      var res = value;\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      for (var i = 0; i < this.units.length; i++) {\n        unitValue = convert(this.units[i].unit.value);\n        unitPrefixValue = convert(this.units[i].prefix.value);\n        unitPower = convert(this.units[i].power);\n        res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n      }\n\n      return res;\n    } else {\n      // This is a single unit of power 1, like kg or degC\n      convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      unitValue = convert(this.units[0].unit.value);\n      unitPrefixValue = convert(this.units[0].prefix.value);\n      unitOffset = convert(this.units[0].unit.offset);\n\n      if (prefixValue === undefined || prefixValue === null) {\n        return subtract(divideScalar(divideScalar(value, unitValue), unitPrefixValue), unitOffset);\n      } else {\n        return subtract(divideScalar(divideScalar(value, unitValue), prefixValue), unitOffset);\n      }\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\n\n  var _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      var unit = UNITS[str];\n      var prefix = unit.prefixes[''];\n      return {\n        unit,\n        prefix\n      };\n    }\n\n    for (var _name in UNITS) {\n      if (hasOwnProperty(UNITS, _name)) {\n        if (endsWith(str, _name)) {\n          var _unit = UNITS[_name];\n          var prefixLen = str.length - _name.length;\n          var prefixName = str.substring(0, prefixLen);\n\n          var _prefix = hasOwnProperty(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;\n\n          if (_prefix !== undefined) {\n            // store unit, prefix, and value\n            return {\n              unit: _unit,\n              prefix: _prefix\n            };\n          }\n        }\n      }\n    }\n\n    return null;\n  }, {\n    hasher: args => args[0],\n    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\n\n  Unit.isValuelessUnit = function (name) {\n    return _findUnit(name) !== null;\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\n\n  Unit.prototype.hasBase = function (base) {\n    if (typeof base === 'string') {\n      base = BASE_UNITS[base];\n    }\n\n    if (!base) {\n      return false;\n    } // All dimensions must be the same\n\n\n    for (var 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\n    return true;\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\n\n  Unit.prototype.equalBase = function (other) {\n    // All dimensions must be the same\n    for (var 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\n    return true;\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\n\n  Unit.prototype.equals = function (other) {\n    return this.equalBase(other) && equal(this.value, other.value);\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\n\n  Unit.prototype.multiply = function (other) {\n    var res = this.clone();\n\n    for (var 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    } // Append other's units list onto res\n\n\n    for (var _i = 0; _i < other.units.length; _i++) {\n      // Make a shallow copy of every unit\n      var inverted = _objectSpread({}, other.units[_i]);\n\n      res.units.push(inverted);\n    } // If at least one operand has a value, then the result should also have a value\n\n\n    if (this.value !== null || other.value !== null) {\n      var valThis = this.value === null ? this._normalize(1) : this.value;\n      var 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    return getNumericIfUnitless(res);\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\n\n  Unit.prototype.divide = function (other) {\n    var res = this.clone();\n\n    for (var 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    } // Invert and append other's units list onto res\n\n\n    for (var _i2 = 0; _i2 < other.units.length; _i2++) {\n      // Make a shallow copy of every unit\n      var inverted = _objectSpread(_objectSpread({}, other.units[_i2]), {}, {\n        power: -other.units[_i2].power\n      });\n\n      res.units.push(inverted);\n    } // If at least one operand has a value, the result should have a value\n\n\n    if (this.value !== null || other.value !== null) {\n      var valThis = this.value === null ? this._normalize(1) : this.value;\n      var 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    return getNumericIfUnitless(res);\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\n\n  Unit.prototype.pow = function (p) {\n    var res = this.clone();\n\n    for (var 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    } // Adjust the power of each unit in the list\n\n\n    for (var _i3 = 0; _i3 < res.units.length; _i3++) {\n      res.units[_i3].power *= p;\n    }\n\n    if (res.value !== null) {\n      res.value = pow(res.value, p); // 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    return getNumericIfUnitless(res);\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\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   * 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\n\n  Unit.prototype.abs = function () {\n    // This gives correct, but unexpected, results for units with an offset.\n    // For example, abs(-283.15 degC) = -263.15 degC !!!\n    var ret = this.clone();\n    ret.value = ret.value !== null ? abs(ret.value) : null;\n\n    for (var 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   * 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\n\n  Unit.prototype.to = function (valuelessUnit) {\n    var other;\n    var value = this.value === null ? this._normalize(1) : this.value;\n\n    if (typeof valuelessUnit === 'string') {\n      // other = new Unit(null, valuelessUnit)\n      other = Unit.parse(valuelessUnit);\n\n      if (!this.equalBase(other)) {\n        throw new Error(\"Units do not match ('\".concat(other.toString(), \"' != '\").concat(this.toString(), \"')\"));\n      }\n\n      if (other.value !== null) {\n        throw new Error('Cannot convert to a unit with a value');\n      }\n\n      other.value = clone(value);\n      other.fixPrefix = true;\n      other.skipAutomaticSimplification = true;\n      return other;\n    } else if (isUnit(valuelessUnit)) {\n      if (!this.equalBase(valuelessUnit)) {\n        throw new Error(\"Units do not match ('\".concat(valuelessUnit.toString(), \"' != '\").concat(this.toString(), \"')\"));\n      }\n\n      if (valuelessUnit.value !== null) {\n        throw new Error('Cannot convert to a unit with a value');\n      }\n\n      other = valuelessUnit.clone();\n      other.value = clone(value);\n      other.fixPrefix = true;\n      other.skipAutomaticSimplification = true;\n      return other;\n    } else {\n      throw new Error('String or Unit expected as parameter');\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\n\n  Unit.prototype.toNumber = function (valuelessUnit) {\n    return toNumber(this.toNumeric(valuelessUnit));\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\n\n  Unit.prototype.toNumeric = function (valuelessUnit) {\n    var other;\n\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   * Get a string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n\n\n  Unit.prototype.toString = function () {\n    return this.format();\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\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   * 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\n\n  Unit.fromJSON = function (json) {\n    var unit = new Unit(json.value, json.unit);\n    unit.fixPrefix = json.fixPrefix || false;\n    return unit;\n  };\n  /**\n   * Returns the string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n\n\n  Unit.prototype.valueOf = Unit.prototype.toString;\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\n  Unit.prototype.simplify = function () {\n    var ret = this.clone();\n    var proposedUnitList = []; // Search for a matching base\n\n    var matchingBase;\n\n    for (var 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      var matchingUnit;\n\n      if (matchingBase) {\n        // Does the unit system have a matching unit?\n        if (hasOwnProperty(currentUnitSystem, matchingBase)) {\n          matchingUnit = currentUnitSystem[matchingBase];\n        }\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        var missingBaseDim = false;\n\n        for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n          var baseDim = BASE_DIMENSIONS[i];\n\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        } // Is the proposed unit list \"simpler\" than the existing one?\n\n\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   * Returns a new Unit in the SI system with the same value as this one\n   */\n\n\n  Unit.prototype.toSI = function () {\n    var ret = this.clone();\n    var proposedUnitList = []; // 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\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      var baseDim = BASE_DIMENSIONS[i];\n\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    } // Replace this unit list with the proposed list\n\n\n    ret.units = proposedUnitList;\n    ret.fixPrefix = true;\n    ret.skipAutomaticSimplification = true;\n    return ret;\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\n\n  Unit.prototype.formatUnits = function () {\n    var strNum = '';\n    var strDen = '';\n    var nNum = 0;\n    var nDen = 0;\n\n    for (var 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\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 (var _i4 = 0; _i4 < this.units.length; _i4++) {\n        if (this.units[_i4].power < 0) {\n          if (nNum > 0) {\n            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n\n            if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {\n              strDen += '^' + -this.units[_i4].power;\n            }\n          } else {\n            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n            strDen += '^' + this.units[_i4].power;\n          }\n        }\n      }\n    } // Remove leading \" \"\n\n\n    strNum = strNum.substr(1);\n    strDen = strDen.substr(1); // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting\n\n    if (nNum > 1 && nDen > 0) {\n      strNum = '(' + strNum + ')';\n    }\n\n    if (nDen > 1 && nNum > 0) {\n      strDen = '(' + strDen + ')';\n    }\n\n    var str = strNum;\n\n    if (nNum > 0 && nDen > 0) {\n      str += ' / ';\n    }\n\n    str += strDen;\n    return str;\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\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    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.\n\n    var isImaginary = false;\n\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 (var 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    } // Now apply the best prefix\n    // Units must have only one unit and not have the fixPrefix flag set\n\n\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    var value = simp._denormalize(simp.value);\n\n    var str = simp.value !== null ? format(value, options || {}) : '';\n    var unitStr = simp.formatUnits();\n\n    if (simp.value && isComplex(simp.value)) {\n      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing\n    }\n\n    if (unitStr.length > 0 && str.length > 0) {\n      str += ' ';\n    }\n\n    str += unitStr;\n    return str;\n  };\n  /**\n   * Calculate the best prefix using current value.\n   * @memberof Unit\n   * @returns {Object} prefix\n   * @private\n   */\n\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\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    } // 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    // 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\n\n    var absValue = this.value !== null ? abs(this.value) : 0;\n    var absUnitValue = abs(this.units[0].unit.value);\n    var bestPrefix = this.units[0].prefix;\n\n    if (absValue === 0) {\n      return bestPrefix;\n    }\n\n    var power = this.units[0].power;\n    var 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\n    bestDiff = Math.abs(bestDiff);\n    var prefixes = this.units[0].unit.prefixes;\n\n    for (var p in prefixes) {\n      if (hasOwnProperty(prefixes, p)) {\n        var prefix = prefixes[p];\n\n        if (prefix.scientific) {\n          var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);\n\n          if (diff < bestDiff || 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   * 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\n\n  Unit.prototype.splitUnit = function (parts) {\n    var x = this.clone();\n    var ret = [];\n\n    for (var 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; // Get the numeric value of this unit\n\n      var xNumeric = x.toNumeric(); // 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\n      var xRounded = round(xNumeric);\n      var xFixed = void 0;\n      var isNearlyEqual = equal(xRounded, xNumeric);\n\n      if (isNearlyEqual) {\n        xFixed = xRounded;\n      } else {\n        xFixed = fix(x.toNumeric());\n      }\n\n      var y = new Unit(xFixed, parts[i].toString());\n      ret.push(y);\n      x = subtract(x, y);\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\n\n    var testSum = 0;\n\n    for (var _i5 = 0; _i5 < ret.length; _i5++) {\n      testSum = addScalar(testSum, ret[_i5].value);\n    }\n\n    if (equal(testSum, this.value)) {\n      x.value = 0;\n    }\n\n    ret.push(x);\n    return ret;\n  };\n\n  var PREFIXES = {\n    NONE: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      }\n    },\n    SHORT: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      da: {\n        name: 'da',\n        value: 1e1,\n        scientific: false\n      },\n      h: {\n        name: 'h',\n        value: 1e2,\n        scientific: false\n      },\n      k: {\n        name: 'k',\n        value: 1e3,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e6,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e9,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e12,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e15,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e18,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e21,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e24,\n        scientific: true\n      },\n      d: {\n        name: 'd',\n        value: 1e-1,\n        scientific: false\n      },\n      c: {\n        name: 'c',\n        value: 1e-2,\n        scientific: false\n      },\n      m: {\n        name: 'm',\n        value: 1e-3,\n        scientific: true\n      },\n      u: {\n        name: 'u',\n        value: 1e-6,\n        scientific: true\n      },\n      n: {\n        name: 'n',\n        value: 1e-9,\n        scientific: true\n      },\n      p: {\n        name: 'p',\n        value: 1e-12,\n        scientific: true\n      },\n      f: {\n        name: 'f',\n        value: 1e-15,\n        scientific: true\n      },\n      a: {\n        name: 'a',\n        value: 1e-18,\n        scientific: true\n      },\n      z: {\n        name: 'z',\n        value: 1e-21,\n        scientific: true\n      },\n      y: {\n        name: 'y',\n        value: 1e-24,\n        scientific: true\n      }\n    },\n    LONG: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      deca: {\n        name: 'deca',\n        value: 1e1,\n        scientific: false\n      },\n      hecto: {\n        name: 'hecto',\n        value: 1e2,\n        scientific: false\n      },\n      kilo: {\n        name: 'kilo',\n        value: 1e3,\n        scientific: true\n      },\n      mega: {\n        name: 'mega',\n        value: 1e6,\n        scientific: true\n      },\n      giga: {\n        name: 'giga',\n        value: 1e9,\n        scientific: true\n      },\n      tera: {\n        name: 'tera',\n        value: 1e12,\n        scientific: true\n      },\n      peta: {\n        name: 'peta',\n        value: 1e15,\n        scientific: true\n      },\n      exa: {\n        name: 'exa',\n        value: 1e18,\n        scientific: true\n      },\n      zetta: {\n        name: 'zetta',\n        value: 1e21,\n        scientific: true\n      },\n      yotta: {\n        name: 'yotta',\n        value: 1e24,\n        scientific: true\n      },\n      deci: {\n        name: 'deci',\n        value: 1e-1,\n        scientific: false\n      },\n      centi: {\n        name: 'centi',\n        value: 1e-2,\n        scientific: false\n      },\n      milli: {\n        name: 'milli',\n        value: 1e-3,\n        scientific: true\n      },\n      micro: {\n        name: 'micro',\n        value: 1e-6,\n        scientific: true\n      },\n      nano: {\n        name: 'nano',\n        value: 1e-9,\n        scientific: true\n      },\n      pico: {\n        name: 'pico',\n        value: 1e-12,\n        scientific: true\n      },\n      femto: {\n        name: 'femto',\n        value: 1e-15,\n        scientific: true\n      },\n      atto: {\n        name: 'atto',\n        value: 1e-18,\n        scientific: true\n      },\n      zepto: {\n        name: 'zepto',\n        value: 1e-21,\n        scientific: true\n      },\n      yocto: {\n        name: 'yocto',\n        value: 1e-24,\n        scientific: true\n      }\n    },\n    SQUARED: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      da: {\n        name: 'da',\n        value: 1e2,\n        scientific: false\n      },\n      h: {\n        name: 'h',\n        value: 1e4,\n        scientific: false\n      },\n      k: {\n        name: 'k',\n        value: 1e6,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e12,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e18,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e24,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e30,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e36,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e42,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e48,\n        scientific: true\n      },\n      d: {\n        name: 'd',\n        value: 1e-2,\n        scientific: false\n      },\n      c: {\n        name: 'c',\n        value: 1e-4,\n        scientific: false\n      },\n      m: {\n        name: 'm',\n        value: 1e-6,\n        scientific: true\n      },\n      u: {\n        name: 'u',\n        value: 1e-12,\n        scientific: true\n      },\n      n: {\n        name: 'n',\n        value: 1e-18,\n        scientific: true\n      },\n      p: {\n        name: 'p',\n        value: 1e-24,\n        scientific: true\n      },\n      f: {\n        name: 'f',\n        value: 1e-30,\n        scientific: true\n      },\n      a: {\n        name: 'a',\n        value: 1e-36,\n        scientific: true\n      },\n      z: {\n        name: 'z',\n        value: 1e-42,\n        scientific: true\n      },\n      y: {\n        name: 'y',\n        value: 1e-48,\n        scientific: true\n      }\n    },\n    CUBIC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      da: {\n        name: 'da',\n        value: 1e3,\n        scientific: false\n      },\n      h: {\n        name: 'h',\n        value: 1e6,\n        scientific: false\n      },\n      k: {\n        name: 'k',\n        value: 1e9,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e18,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e27,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e36,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e45,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e54,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e63,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e72,\n        scientific: true\n      },\n      d: {\n        name: 'd',\n        value: 1e-3,\n        scientific: false\n      },\n      c: {\n        name: 'c',\n        value: 1e-6,\n        scientific: false\n      },\n      m: {\n        name: 'm',\n        value: 1e-9,\n        scientific: true\n      },\n      u: {\n        name: 'u',\n        value: 1e-18,\n        scientific: true\n      },\n      n: {\n        name: 'n',\n        value: 1e-27,\n        scientific: true\n      },\n      p: {\n        name: 'p',\n        value: 1e-36,\n        scientific: true\n      },\n      f: {\n        name: 'f',\n        value: 1e-45,\n        scientific: true\n      },\n      a: {\n        name: 'a',\n        value: 1e-54,\n        scientific: true\n      },\n      z: {\n        name: 'z',\n        value: 1e-63,\n        scientific: true\n      },\n      y: {\n        name: 'y',\n        value: 1e-72,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      k: {\n        name: 'k',\n        value: 1e3,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e6,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e9,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e12,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e15,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e18,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e21,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      Ki: {\n        name: 'Ki',\n        value: 1024,\n        scientific: true\n      },\n      Mi: {\n        name: 'Mi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      Gi: {\n        name: 'Gi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      Ti: {\n        name: 'Ti',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      Pi: {\n        name: 'Pi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      Ei: {\n        name: 'Ei',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      Zi: {\n        name: 'Zi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      Yi: {\n        name: 'Yi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BINARY_LONG_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      kilo: {\n        name: 'kilo',\n        value: 1e3,\n        scientific: true\n      },\n      mega: {\n        name: 'mega',\n        value: 1e6,\n        scientific: true\n      },\n      giga: {\n        name: 'giga',\n        value: 1e9,\n        scientific: true\n      },\n      tera: {\n        name: 'tera',\n        value: 1e12,\n        scientific: true\n      },\n      peta: {\n        name: 'peta',\n        value: 1e15,\n        scientific: true\n      },\n      exa: {\n        name: 'exa',\n        value: 1e18,\n        scientific: true\n      },\n      zetta: {\n        name: 'zetta',\n        value: 1e21,\n        scientific: true\n      },\n      yotta: {\n        name: 'yotta',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_LONG_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      kibi: {\n        name: 'kibi',\n        value: 1024,\n        scientific: true\n      },\n      mebi: {\n        name: 'mebi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      gibi: {\n        name: 'gibi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      tebi: {\n        name: 'tebi',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      pebi: {\n        name: 'pebi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      exi: {\n        name: 'exi',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      zebi: {\n        name: 'zebi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      yobi: {\n        name: 'yobi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BTU: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      MM: {\n        name: 'MM',\n        value: 1e6,\n        scientific: true\n      }\n    }\n  };\n  PREFIXES.SHORTLONG = _extends({}, PREFIXES.SHORT, PREFIXES.LONG);\n  PREFIXES.BINARY_SHORT = _extends({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);\n  PREFIXES.BINARY_LONG = _extends({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);\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  var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];\n  var 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    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    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    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 (var key in BASE_UNITS) {\n    if (hasOwnProperty(BASE_UNITS, key)) {\n      BASE_UNITS[key].key = key;\n    }\n  }\n\n  var BASE_UNIT_NONE = {};\n  var UNIT_NONE = {\n    name: '',\n    base: BASE_UNIT_NONE,\n    value: 1,\n    offset: 0,\n    dimensions: BASE_DIMENSIONS.map(x => 0)\n  };\n  var 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    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    },\n    // 1/1000 inch\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\n    // 10000 m2\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    },\n    // litre\n    l: {\n      name: 'l',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\n    // 0.05 mL = 5e-8 m3\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\n    // 238.4810 L\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    },\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    // 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    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    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    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    // 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,\n      // 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,\n      // Julian year\n      offset: 0\n    },\n    decade: {\n      name: 'decade',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 315576000,\n      // Julian decade\n      offset: 0\n    },\n    century: {\n      name: 'century',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3155760000,\n      // Julian century\n      offset: 0\n    },\n    millennium: {\n      name: 'millennium',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600000,\n      // Julian millennium\n      offset: 0\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    // 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,\n      // 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,\n      // 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,\n      // 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,\n      // 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,\n      // 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,\n      // 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,\n      // will be filled in by calculateAngleValues()\n      offset: 0\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    // 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    // 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    // 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    // 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    // 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    // 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    // 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    VA: {\n      name: 'VA',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\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    // 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,\n      // Both Mohm and megaohm are acceptable\n      value: 1,\n      offset: 0\n    },\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    // 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  }; // aliases (formerly plurals)\n\n  var 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    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    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    kips: 'kip',\n    kgf: 'kilogramforce',\n    acres: 'acre',\n    hectares: 'hectare',\n    sqfeet: 'sqft',\n    sqyard: 'sqyd',\n    sqmile: 'sqmi',\n    sqmiles: 'sqmi',\n    mmhg: 'mmHg',\n    mmh2o: 'mmH2O',\n    cmh2o: 'cmH2O',\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    hertz: 'hertz',\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    BTUs: 'BTU',\n    watts: 'watt',\n    joules: 'joule',\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    bit: 'bits',\n    byte: 'bytes'\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\n  function calculateAngleValues(config) {\n    if (config.number === 'BigNumber') {\n      var pi = createPi(_BigNumber);\n      UNITS.rad.value = new _BigNumber(1);\n      UNITS.deg.value = pi.div(180); // 2 * pi / 360\n\n      UNITS.grad.value = pi.div(200); // 2 * pi / 400\n\n      UNITS.cycle.value = pi.times(2); // 2 * pi\n\n      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600\n\n      UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60\n    } else {\n      // number\n      UNITS.rad.value = 1;\n      UNITS.deg.value = Math.PI / 180; // 2 * pi / 360\n\n      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400\n\n      UNITS.cycle.value = Math.PI * 2; // 2 * pi\n\n      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600\n\n      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60\n    } // copy to the full names of the angles\n\n\n    UNITS.radian.value = UNITS.rad.value;\n    UNITS.degree.value = UNITS.deg.value;\n    UNITS.gradian.value = UNITS.grad.value;\n  } // apply the angle values now\n\n\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   * 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\n\n  var UNIT_SYSTEMS = {\n    si: {\n      // Base units\n      NONE: {\n        unit: UNIT_NONE,\n        prefix: PREFIXES.NONE['']\n      },\n      LENGTH: {\n        unit: UNITS.m,\n        prefix: PREFIXES.SHORT['']\n      },\n      MASS: {\n        unit: UNITS.g,\n        prefix: PREFIXES.SHORT.k\n      },\n      TIME: {\n        unit: UNITS.s,\n        prefix: PREFIXES.SHORT['']\n      },\n      CURRENT: {\n        unit: UNITS.A,\n        prefix: PREFIXES.SHORT['']\n      },\n      TEMPERATURE: {\n        unit: UNITS.K,\n        prefix: PREFIXES.SHORT['']\n      },\n      LUMINOUS_INTENSITY: {\n        unit: UNITS.cd,\n        prefix: PREFIXES.SHORT['']\n      },\n      AMOUNT_OF_SUBSTANCE: {\n        unit: UNITS.mol,\n        prefix: PREFIXES.SHORT['']\n      },\n      ANGLE: {\n        unit: UNITS.rad,\n        prefix: PREFIXES.SHORT['']\n      },\n      BIT: {\n        unit: UNITS.bits,\n        prefix: PREFIXES.SHORT['']\n      },\n      // Derived units\n      FORCE: {\n        unit: UNITS.N,\n        prefix: PREFIXES.SHORT['']\n      },\n      ENERGY: {\n        unit: UNITS.J,\n        prefix: PREFIXES.SHORT['']\n      },\n      POWER: {\n        unit: UNITS.W,\n        prefix: PREFIXES.SHORT['']\n      },\n      PRESSURE: {\n        unit: UNITS.Pa,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CHARGE: {\n        unit: UNITS.C,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CAPACITANCE: {\n        unit: UNITS.F,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_POTENTIAL: {\n        unit: UNITS.V,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_RESISTANCE: {\n        unit: UNITS.ohm,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_INDUCTANCE: {\n        unit: UNITS.H,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CONDUCTANCE: {\n        unit: UNITS.S,\n        prefix: PREFIXES.SHORT['']\n      },\n      MAGNETIC_FLUX: {\n        unit: UNITS.Wb,\n        prefix: PREFIXES.SHORT['']\n      },\n      MAGNETIC_FLUX_DENSITY: {\n        unit: UNITS.T,\n        prefix: PREFIXES.SHORT['']\n      },\n      FREQUENCY: {\n        unit: UNITS.Hz,\n        prefix: PREFIXES.SHORT['']\n      }\n    }\n  }; // Clone to create the other unit systems\n\n  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));\n  UNIT_SYSTEMS.cgs.LENGTH = {\n    unit: UNITS.m,\n    prefix: PREFIXES.SHORT.c\n  };\n  UNIT_SYSTEMS.cgs.MASS = {\n    unit: UNITS.g,\n    prefix: PREFIXES.SHORT['']\n  };\n  UNIT_SYSTEMS.cgs.FORCE = {\n    unit: UNITS.dyn,\n    prefix: PREFIXES.SHORT['']\n  };\n  UNIT_SYSTEMS.cgs.ENERGY = {\n    unit: UNITS.erg,\n    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 = {\n    unit: UNITS.ft,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.MASS = {\n    unit: UNITS.lbm,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.TEMPERATURE = {\n    unit: UNITS.degF,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.FORCE = {\n    unit: UNITS.lbf,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.ENERGY = {\n    unit: UNITS.BTU,\n    prefix: PREFIXES.BTU['']\n  };\n  UNIT_SYSTEMS.us.POWER = {\n    unit: UNITS.hp,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.PRESSURE = {\n    unit: UNITS.psi,\n    prefix: PREFIXES.NONE['']\n  }; // Add additional unit systems here.\n  // Choose a unit system to seed the auto unit system.\n\n  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si)); // Set the current unit system\n\n  var currentUnitSystem = UNIT_SYSTEMS.auto;\n  /**\n   * Set a unit system for formatting derived units.\n   * @param {string} [name] The name of the unit system.\n   */\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   * Return the current unit system.\n   * @return {string} The current unit system.\n   */\n\n\n  Unit.getUnitSystem = function () {\n    for (var _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   * Converters to convert from number to an other numeric type like BigNumber\n   * or Fraction\n   */\n\n\n  Unit.typeConverters = {\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x + ''); // stringify to prevent constructor error\n    },\n    Fraction: function Fraction(x) {\n      return new _Fraction(x);\n    },\n    Complex: function Complex(x) {\n      return x;\n    },\n    number: function number(x) {\n      return x;\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\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  }; // Add dimensions to each built-in unit\n\n\n  for (var _key2 in UNITS) {\n    if (hasOwnProperty(UNITS, _key2)) {\n      var unit = UNITS[_key2];\n      unit.dimensions = unit.base.dimensions;\n    }\n  } // Create aliases\n\n\n  for (var _name2 in ALIASES) {\n    if (hasOwnProperty(ALIASES, _name2)) {\n      var _unit2 = UNITS[ALIASES[_name2]];\n      var alias = {};\n\n      for (var _key3 in _unit2) {\n        if (hasOwnProperty(_unit2, _key3)) {\n          alias[_key3] = _unit2[_key3];\n        }\n      }\n\n      alias.name = _name2;\n      UNITS[_name2] = alias;\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\n\n  Unit.isValidAlpha = function isValidAlpha(c) {\n    return /^[a-zA-Z]$/.test(c);\n  };\n\n  function assertUnitNameIsValid(name) {\n    for (var i = 0; i < name.length; i++) {\n      c = name.charAt(i);\n\n      if (i === 0 && !Unit.isValidAlpha(c)) {\n        throw new Error('Invalid unit name (must begin with alpha character): \"' + name + '\"');\n      }\n\n      if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {\n        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\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    } // Remove all units and aliases we are overriding\n\n\n    if (options && options.override) {\n      for (var _key4 in obj) {\n        if (hasOwnProperty(obj, _key4)) {\n          Unit.deleteUnit(_key4);\n        }\n\n        if (obj[_key4].aliases) {\n          for (var i = 0; i < obj[_key4].aliases.length; i++) {\n            Unit.deleteUnit(obj[_key4].aliases[i]);\n          }\n        }\n      }\n    } // TODO: traverse multiple times until all units have been added\n\n\n    var lastUnit;\n\n    for (var _key5 in obj) {\n      if (hasOwnProperty(obj, _key5)) {\n        lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);\n      }\n    }\n\n    return lastUnit;\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\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    } // Check collisions with existing units\n\n\n    if (hasOwnProperty(UNITS, name)) {\n      throw new Error('Cannot create unit \"' + name + '\": a unit with that name already exists');\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\n    assertUnitNameIsValid(name);\n    var defUnit = null; // The Unit from which the new unit will be created.\n\n    var aliases = [];\n    var offset = 0;\n    var definition;\n    var prefixes;\n    var baseName;\n\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\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 (var 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, {\n          allowNoUnits: true\n        });\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\n    if (prefixes && prefixes.toUpperCase) {\n      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;\n    } else {\n      prefixes = PREFIXES.NONE;\n    } // If defUnit is null, it is because the user did not\n    // specify a defintion. So create a new base dimension.\n\n\n    var newUnit = {};\n\n    if (!defUnit) {\n      // Add a new base dimension\n      baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\n\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\n      BASE_DIMENSIONS.push(baseName); // Push 0 onto existing base units\n\n      for (var b in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, b)) {\n          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;\n        }\n      } // Add the new base unit\n\n\n      var newBaseUnit = {\n        dimensions: []\n      };\n\n      for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {\n        newBaseUnit.dimensions[_i6] = 0;\n      }\n\n      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;\n      newBaseUnit.key = baseName;\n      BASE_UNITS[baseName] = newBaseUnit;\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      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      }; // Create a new base if no matching base exists\n\n      var anyMatch = false;\n\n      for (var _i7 in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, _i7)) {\n          var match = true;\n\n          for (var j = 0; j < BASE_DIMENSIONS.length; j++) {\n            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {\n              match = false;\n              break;\n            }\n          }\n\n          if (match) {\n            anyMatch = true;\n            newUnit.base = BASE_UNITS[_i7];\n            break;\n          }\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\n        var _newBaseUnit = {\n          dimensions: defUnit.dimensions.slice(0)\n        };\n        _newBaseUnit.key = baseName;\n        BASE_UNITS[baseName] = _newBaseUnit;\n        currentUnitSystem[baseName] = {\n          unit: newUnit,\n          prefix: PREFIXES.NONE['']\n        };\n        newUnit.base = BASE_UNITS[baseName];\n      }\n    }\n\n    Unit.UNITS[name] = newUnit;\n\n    for (var _i8 = 0; _i8 < aliases.length; _i8++) {\n      var aliasName = aliases[_i8];\n      var _alias = {};\n\n      for (var _key6 in newUnit) {\n        if (hasOwnProperty(newUnit, _key6)) {\n          _alias[_key6] = newUnit[_key6];\n        }\n      }\n\n      _alias.name = aliasName;\n      Unit.UNITS[aliasName] = _alias;\n    } // delete the memoization cache, since adding a new unit to the array\n    // invalidates all old results\n\n\n    delete _findUnit.cache;\n    return new Unit(null, name);\n  };\n\n  Unit.deleteUnit = function (name) {\n    delete Unit.UNITS[name];\n  }; // expose arrays with prefixes, dimensions, units, systems\n\n\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  return Unit;\n}, {\n  isClass: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'createUnit';\nvar dependencies = ['typed', 'Unit'];\nexport var createCreateUnit = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Unit\n  } = _ref;\n\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    // 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 ObjectObject(obj, options) {\n      return Unit.createUnit(obj, options);\n    },\n    // Same as above but without the options.\n    Object: function Object(obj) {\n      return Unit.createUnit(obj, {});\n    },\n    // Shortcut method for creating one unit.\n    'string, Unit | string | Object, Object': function stringUnitStringObjectObject(name, def, options) {\n      var obj = {};\n      obj[name] = def;\n      return Unit.createUnit(obj, options);\n    },\n    // Same as above but without the options.\n    'string, Unit | string | Object': function stringUnitStringObject(name, def) {\n      var obj = {};\n      obj[name] = def;\n      return Unit.createUnit(obj, {});\n    },\n    // Without a definition, creates a base unit.\n    string: function string(name) {\n      var obj = {};\n      obj[name] = {};\n      return Unit.createUnit(obj, {});\n    }\n  });\n});","import { clone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nvar name = 'eigs';\nvar dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'inv', 'bignumber', 'multiply', 'add'];\nexport var createEigs = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    config,\n    typed,\n    matrix,\n    addScalar,\n    subtract,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    multiply,\n    add\n  } = _ref;\n\n  /**\n   * Compute eigenvalue and eigenvector of a real symmetric matrix.\n   * Only applicable to two dimensional symmetric matrices. Uses Jacobi\n   * Algorithm. Matrix containing mixed type ('number', 'bignumber', 'fraction')\n   * of elements are not supported. Input matrix or 2D array should contain all elements\n   * of either 'number', 'bignumber' or 'fraction' type. For 'number' and 'fraction', the\n   * eigenvalues are of 'number' type. For 'bignumber' the eigenvalues are of ''bignumber' type.\n   * Eigenvectors are always of 'number' type.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x)\n   *\n   * Examples:\n   *\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = math.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   *     math.multiply(H, math.column(U, 0)) // returns math.multiply(E[0], math.column(U, 0))\n   *     const UTxHxU = math.multiply(math.transpose(U), H, U) // rotates H to the eigen-representation\n   *     E[0] == UTxHxU[0][0]  // returns true\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   * @return {{values: Array, vectors: Array} | {values: Matrix, vectors: Matrix}} Object containing eigenvalues (Array or Matrix) and eigenvectors (2D Array/Matrix with eigenvectors as columns).\n   */\n  return typed('eigs', {\n    Array: function Array(x) {\n      // check array size\n      var mat = matrix(x);\n      var 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      } // use dense 2D matrix implementation\n\n\n      var ans = checkAndSubmit(mat, size[0]);\n      return {\n        values: ans[0],\n        vectors: ans[1]\n      };\n    },\n    Matrix: function Matrix(x) {\n      // use dense 2D array implementation\n      // dense matrix\n      var size = x.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      var ans = checkAndSubmit(x, size[0]);\n      return {\n        values: matrix(ans[0]),\n        vectors: matrix(ans[1])\n      };\n    }\n  }); // Is the matrix\n  // symmetric ?\n\n  function isSymmetric(x, n) {\n    for (var i = 0; i < n; i++) {\n      for (var j = i; j < n; j++) {\n        // not symmtric\n        if (!equal(x[i][j], x[j][i])) {\n          throw new TypeError('Input matrix is not symmetric');\n        }\n      }\n    }\n  } // check input for possible problems\n  // and perform diagonalization efficiently for\n  // specific type of number\n\n\n  function checkAndSubmit(x, n) {\n    var type = x.datatype(); // type check\n\n    if (type === undefined) {\n      type = x.getDataType();\n    }\n\n    if (type !== 'number' && type !== 'BigNumber' && type !== 'Fraction') {\n      if (type === 'mixed') {\n        throw new TypeError('Mixed matrix element type is not supported');\n      } else {\n        throw new TypeError('Matrix element type not supported (' + type + ')');\n      }\n    } else {\n      isSymmetric(x.toArray(), n);\n    } // perform efficient calculation for 'numbers'\n\n\n    if (type === 'number') {\n      return diag(x.toArray());\n    } else if (type === 'Fraction') {\n      var xArr = x.toArray(); // convert fraction to numbers\n\n      for (var i = 0; i < n; i++) {\n        for (var j = i; j < n; j++) {\n          xArr[i][j] = xArr[i][j].valueOf();\n          xArr[j][i] = xArr[i][j];\n        }\n      }\n\n      return diag(x.toArray());\n    } else if (type === 'BigNumber') {\n      return diagBig(x.toArray());\n    }\n  } // diagonalization implementation for number (efficient)\n\n\n  function diag(x) {\n    var N = x.length;\n    var e0 = Math.abs(config.epsilon / N);\n    var psi;\n    var Sij = new Array(N); // Sij is Identity Matrix\n\n    for (var i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0);\n      Sij[i][i] = 1.0;\n    } // initial error\n\n\n    var Vab = getAij(x);\n\n    while (Math.abs(Vab[1]) >= Math.abs(e0)) {\n      var _i = Vab[0][0];\n      var 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\n    var Ei = createArray(N, 0); // eigenvalues\n\n    for (var _i2 = 0; _i2 < N; _i2++) {\n      Ei[_i2] = x[_i2][_i2];\n    }\n\n    return sorting(clone(Ei), clone(Sij));\n  } // diagonalization implementation for bigNumber\n\n\n  function diagBig(x) {\n    var N = x.length;\n    var e0 = abs(config.epsilon / N);\n    var psi;\n    var Sij = new Array(N); // Sij is Identity Matrix\n\n    for (var i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0);\n      Sij[i][i] = 1.0;\n    } // initial error\n\n\n    var Vab = getAijBig(x);\n\n    while (abs(Vab[1]) >= abs(e0)) {\n      var _i3 = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);\n      x = x1Big(x, psi, _i3, j);\n      Sij = Sij1Big(Sij, psi, _i3, j);\n      Vab = getAijBig(x);\n    }\n\n    var Ei = createArray(N, 0); // eigenvalues\n\n    for (var _i4 = 0; _i4 < N; _i4++) {\n      Ei[_i4] = x[_i4][_i4];\n    } // return [clone(Ei), clone(Sij)]\n\n\n    return sorting(clone(Ei), clone(Sij));\n  } // get angle\n\n\n  function getTheta(aii, ajj, aij) {\n    var denom = ajj - aii;\n\n    if (Math.abs(denom) <= config.epsilon) {\n      return Math.PI / 4;\n    } else {\n      return 0.5 * Math.atan(2 * aij / (ajj - aii));\n    }\n  } // get angle\n\n\n  function getThetaBig(aii, ajj, aij) {\n    var denom = subtract(ajj, aii);\n\n    if (abs(denom) <= config.epsilon) {\n      return bignumber(-1).acos().div(4);\n    } else {\n      return multiplyScalar(0.5, atan(multiply(2, aij, inv(denom))));\n    }\n  } // update eigvec\n\n\n  function Sij1(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var Ski = createArray(N, 0);\n    var Skj = createArray(N, 0);\n\n    for (var 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\n    for (var _k = 0; _k < N; _k++) {\n      Sij[_k][i] = Ski[_k];\n      Sij[_k][j] = Skj[_k];\n    }\n\n    return Sij;\n  } // update eigvec for overlap\n\n\n  function Sij1Big(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = cos(theta);\n    var s = sin(theta);\n    var Ski = createArray(N, bignumber(0));\n    var Skj = createArray(N, bignumber(0));\n\n    for (var 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\n    for (var _k2 = 0; _k2 < N; _k2++) {\n      Sij[_k2][i] = Ski[_k2];\n      Sij[_k2][j] = Skj[_k2];\n    }\n\n    return Sij;\n  } // update matrix\n\n\n  function x1Big(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = bignumber(cos(theta));\n    var s = bignumber(sin(theta));\n    var c2 = multiplyScalar(c, c);\n    var s2 = multiplyScalar(s, s);\n    var Aki = createArray(N, bignumber(0));\n    var Akj = createArray(N, bignumber(0)); // 2cs Hij\n\n    var csHij = multiply(bignumber(2), c, s, Hij[i][j]); //  Aii\n\n    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));\n    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j])); // 0  to i\n\n    for (var 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    } // Modify Hij\n\n\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = bignumber(0);\n    Hij[j][i] = bignumber(0); // 0  to i\n\n    for (var _k3 = 0; _k3 < N; _k3++) {\n      if (_k3 !== i && _k3 !== j) {\n        Hij[i][_k3] = Aki[_k3];\n        Hij[_k3][i] = Aki[_k3];\n        Hij[j][_k3] = Akj[_k3];\n        Hij[_k3][j] = Akj[_k3];\n      }\n    }\n\n    return Hij;\n  } // update matrix\n\n\n  function x1(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var c2 = c * c;\n    var s2 = s * s;\n    var Aki = createArray(N, 0);\n    var Akj = createArray(N, 0); //  Aii\n\n    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];\n    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j]; // 0  to i\n\n    for (var 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    } // Modify Hij\n\n\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = 0;\n    Hij[j][i] = 0; // 0  to i\n\n    for (var _k4 = 0; _k4 < N; _k4++) {\n      if (_k4 !== i && _k4 !== j) {\n        Hij[i][_k4] = Aki[_k4];\n        Hij[_k4][i] = Aki[_k4];\n        Hij[j][_k4] = Akj[_k4];\n        Hij[_k4][j] = Akj[_k4];\n      }\n    }\n\n    return Hij;\n  } // get max off-diagonal value from Upper Diagonal\n\n\n  function getAij(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n\n    for (var i = 0; i < N; i++) {\n      for (var 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\n    return [maxIJ, maxMij];\n  } // get max off-diagonal value from Upper Diagonal\n\n\n  function getAijBig(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n\n    for (var i = 0; i < N; i++) {\n      for (var 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\n    return [maxIJ, maxMij];\n  } // sort results\n\n\n  function sorting(E, S) {\n    var N = E.length;\n    var Ef = Array(N);\n    var Sf = Array(N);\n\n    for (var k = 0; k < N; k++) {\n      Sf[k] = Array(N);\n    }\n\n    for (var i = 0; i < N; i++) {\n      var minID = 0;\n      var minE = E[0];\n\n      for (var j = 0; j < E.length; j++) {\n        if (E[j] < minE) {\n          minID = j;\n          minE = E[minID];\n        }\n      }\n\n      Ef[i] = E.splice(minID, 1)[0];\n\n      for (var _k5 = 0; _k5 < N; _k5++) {\n        Sf[_k5][i] = S[_k5][minID];\n\n        S[_k5].splice(minID, 1);\n      }\n    }\n\n    return [clone(Ef), clone(Sf)];\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\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    var array = new Array(size);\n\n    for (var i = 0; i < size; i++) {\n      array[i] = value;\n    }\n\n    return array;\n  }\n});","import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'intersect';\nvar dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar'];\nexport var createIntersect = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    abs,\n    add,\n    addScalar,\n    matrix,\n    multiply,\n    multiplyScalar,\n    divideScalar,\n    subtract,\n    smaller,\n    equalScalar\n  } = _ref;\n\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 null 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': function ArrayArrayArray(x, y, plane) {\n      if (!_3d(x)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n      }\n\n      if (!_3d(y)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n      }\n\n      if (!_4d(plane)) {\n        throw new TypeError('Array with 4 numbers expected as third argument');\n      }\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    'Array, Array, Array, Array': function ArrayArrayArrayArray(w, x, y, z) {\n      if (w.length === 2) {\n        if (!_2d(w)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');\n        }\n\n        return _intersect2d(w, x, y, z);\n      } else if (w.length === 3) {\n        if (!_3d(w)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_3d(x)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');\n        }\n\n        if (!_3d(z)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');\n        }\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    'Matrix, Matrix, Matrix': function MatrixMatrixMatrix(x, y, plane) {\n      return matrix(this(x.valueOf(), y.valueOf(), plane.valueOf()));\n    },\n    'Matrix, Matrix, Matrix, Matrix': function MatrixMatrixMatrixMatrix(w, x, y, z) {\n      // TODO: output matrix type should match input matrix type\n      return matrix(this(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf()));\n    }\n  });\n\n  function _isNumeric(a) {\n    // intersect supports numbers and bignumbers\n    return typeof a === 'number' || isBigNumber(a);\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    var o1 = p1a;\n    var o2 = p2a;\n    var d1 = subtract(o1, p1b);\n    var d2 = subtract(o2, p2b);\n    var det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));\n\n    if (smaller(abs(det), config.epsilon)) {\n      return null;\n    }\n\n    var d20o11 = multiplyScalar(d2[0], o1[1]);\n    var d21o10 = multiplyScalar(d2[1], o1[0]);\n    var d20o21 = multiplyScalar(d2[0], o2[1]);\n    var d21o20 = multiplyScalar(d2[1], o2[0]);\n    var 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    var add1 = multiplyScalar(subtract(a, b), subtract(c, d));\n    var add2 = multiplyScalar(subtract(e, f), subtract(g, h));\n    var 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    var d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);\n\n    var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);\n\n    var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);\n\n    var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);\n\n    var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);\n\n    var ta = divideScalar(subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343)), subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321)));\n    var tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);\n    var pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));\n    var pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));\n    var paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));\n    var pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));\n    var pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));\n    var pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));\n\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    var x1x = multiplyScalar(x1, x);\n    var x2x = multiplyScalar(x2, x);\n    var y1y = multiplyScalar(y1, y);\n    var y2y = multiplyScalar(y2, y);\n    var z1z = multiplyScalar(z1, z);\n    var z2z = multiplyScalar(z2, z);\n    var t = divideScalar(subtract(subtract(subtract(c, x1x), y1y), z1z), subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z));\n    var px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));\n    var py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));\n    var pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));\n    return [px, py, pz]; // TODO: Add cases when line is parallel to the plane:\n    //       (a) no intersection,\n    //       (b) line contained in plane\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nexport var createUsolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtract,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n\n      var r = _denseBackwardSubstitution(m, b);\n\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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1]; // result\n\n    var x = [];\n    var mdata = m._data; // loop columns backwards\n\n    for (var j = columns - 1; j >= 0; j--) {\n      // b[j]\n      var bj = bdata[j][0] || 0; // x[j]\n\n      var xj = void 0;\n\n      if (!equalScalar(bj, 0)) {\n        // value at [j, j]\n        var 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); // loop rows\n\n        for (var 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      } // update x\n\n\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    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // result\n\n    var x = []; // loop columns backwards\n\n    for (var j = columns - 1; j >= 0; j--) {\n      var bj = bdata[j][0] || 0;\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n        var vjj = 0; // upper triangular matrix values & index (column j)\n\n        var jValues = [];\n        var jIndices = []; // first & last indeces in column\n\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1]; // values in column, find value at [j, j], loop backwards\n\n        for (var k = lastIndex - 1; k >= firstIndex; k--) {\n          var i = index[k]; // check row (rows are not sorted!)\n\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        } // at this point we must have a value in vjj\n\n\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n\n        var xj = divideScalar(bj, vjj);\n\n        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {\n          var _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});","import { factory } from '../../utils/factory.js';\nvar name = 'norm';\nvar dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];\nexport var createNorm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\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  } = _ref;\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    Complex: function Complex(x) {\n      return x.abs();\n    },\n    BigNumber: function BigNumber(x) {\n      // norm(x) = abs(x)\n      return x.abs();\n    },\n    boolean: function boolean(x) {\n      // norm(x) = abs(x)\n      return Math.abs(x);\n    },\n    Array: function Array(x) {\n      return _norm(matrix(x), 2);\n    },\n    Matrix: function Matrix(x) {\n      return _norm(x, 2);\n    },\n    'number | Complex | BigNumber | boolean, number | BigNumber | string': function numberComplexBigNumberBooleanNumberBigNumberString(x) {\n      // ignore second parameter, TODO: remove the option of second parameter for these types\n      return this(x);\n    },\n    'Array, number | BigNumber | string': function ArrayNumberBigNumberString(x, p) {\n      return _norm(matrix(x), p);\n    },\n    'Matrix, number | BigNumber | string': function MatrixNumberBigNumberString(x, p) {\n      return _norm(x, p);\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\n  function _vectorNormPlusInfinity(x) {\n    // norm(x, Infinity) = max(abs(x))\n    var pinf = 0; // skip zeros since abs(0) === 0\n\n    x.forEach(function (value) {\n      var v = abs(value);\n\n      if (larger(v, pinf)) {\n        pinf = v;\n      }\n    }, true);\n    return pinf;\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\n\n  function _vectorNormMinusInfinity(x) {\n    // norm(x, -Infinity) = min(abs(x))\n    var ninf; // skip zeros since abs(0) === 0\n\n    x.forEach(function (value) {\n      var v = abs(value);\n\n      if (!ninf || smaller(v, ninf)) {\n        ninf = v;\n      }\n    }, true);\n    return ninf || 0;\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\n\n  function _vectorNorm(x, p) {\n    // check p\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _vectorNormPlusInfinity(x);\n    }\n\n    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {\n      return _vectorNormMinusInfinity(x);\n    }\n\n    if (p === 'fro') {\n      return _norm(x, 2);\n    }\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        var n = 0; // skip zeros since abs(0) === 0\n\n        x.forEach(function (value) {\n          n = add(pow(abs(value), p), n);\n        }, true);\n        return pow(n, 1 / p);\n      }\n\n      return Number.POSITIVE_INFINITY;\n    } // invalid parameter value\n\n\n    throw new Error('Unsupported parameter value');\n  }\n  /**\n   * Calculate the Frobenius norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormFrobenius(x) {\n    // norm(x) = sqrt(sum(diag(x'x)))\n    var 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   * Calculate the norm L1 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormOne(x) {\n    // norm(x) = the largest column sum\n    var c = []; // result\n\n    var maxc = 0; // skip zeros since abs(0) == 0\n\n    x.forEach(function (value, index) {\n      var j = index[1];\n      var cj = add(c[j] || 0, abs(value));\n\n      if (larger(cj, maxc)) {\n        maxc = cj;\n      }\n\n      c[j] = cj;\n    }, true);\n    return maxc;\n  }\n  /**\n   * Calculate the norm L2 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormTwo(x) {\n    // norm(x) = sqrt( max eigenvalue of A*.A)\n    var sizeX = x.size();\n\n    if (sizeX[0] !== sizeX[1]) {\n      throw new RangeError('Invalid matrix dimensions');\n    }\n\n    var tx = ctranspose(x);\n    var squaredX = multiply(tx, x);\n    var eigenVals = eigs(squaredX).values;\n    var rho = eigenVals.get([eigenVals.size()[0] - 1]);\n    return abs(sqrt(rho));\n  }\n  /**\n   * Calculate the infinity norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n\n  function _matrixNormInfinity(x) {\n    // norm(x) = the largest row sum\n    var r = []; // result\n\n    var maxr = 0; // skip zeros since abs(0) == 0\n\n    x.forEach(function (value, index) {\n      var i = index[0];\n      var ri = add(r[i] || 0, abs(value));\n\n      if (larger(ri, maxr)) {\n        maxr = ri;\n      }\n\n      r[i] = ri;\n    }, true);\n    return maxr;\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\n\n  function _matrixNorm(x, p) {\n    // check p\n    if (p === 1) {\n      return _matrixNormOne(x);\n    }\n\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _matrixNormInfinity(x);\n    }\n\n    if (p === 'fro') {\n      return _matrixNormFrobenius(x);\n    }\n\n    if (p === 2) {\n      return _matrixNormTwo(x);\n    } // invalid parameter value\n\n\n    throw new Error('Unsupported parameter value ' + p);\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\n\n  function _norm(x, p) {\n    // size\n    var sizeX = x.size(); // check if it is a vector\n\n    if (sizeX.length === 1) {\n      return _vectorNorm(x, p);\n    } // MxN matrix\n\n\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 * 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  var k;\n  var n = b.length;\n  var x = []; // check permutation vector was provided, p = null denotes identity\n\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\n  return x;\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';\nvar name = 'lusolve';\nvar dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];\nexport var createLusolve = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    lup,\n    slu,\n    usolve,\n    lsolve,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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\n  return typed(name, {\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      a = matrix(a);\n      var d = lup(a);\n\n      var x = _lusolve(d.L, d.U, d.p, null, b);\n\n      return x.valueOf();\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(a, b) {\n      var d = lup(a);\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(a, b) {\n      var d = lup(a);\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix, number, number': function SparseMatrixArrayMatrixNumberNumber(a, b, order, threshold) {\n      var d = slu(a, order, threshold);\n      return _lusolve(d.L, d.U, d.p, d.q, b);\n    },\n    'Object, Array | Matrix': function ObjectArrayMatrix(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)) {\n      return a;\n    }\n\n    if (isArray(a)) {\n      return matrix(a);\n    }\n\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); // apply row permutations if needed (b is a DenseMatrix)\n\n    if (p) {\n      b = solveValidation(l, b, true);\n      b._data = csIpvec(p, b._data);\n    } // use forward substitution to resolve L * y = b\n\n\n    var y = lsolve(l, b); // use backward substitution to resolve U * x = y\n\n    var x = usolve(u, y); // apply column permutations if needed (x is a DenseMatrix)\n\n    if (q) {\n      x._data = csIpvec(q, x._data);\n    }\n\n    return x;\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';\nvar name = 'sqrtm';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];\nexport var createSqrtm = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    add,\n    multiply,\n    sqrt,\n    subtract,\n    inv,\n    size,\n    max,\n    identity\n  } = _ref;\n  var _maxIterations = 1e3;\n  var _tolerance = 1e-6;\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\n  function _denmanBeavers(A) {\n    var error;\n    var iterations = 0;\n    var Y = A;\n    var Z = identity(size(A));\n\n    do {\n      var Yk = Y;\n      Y = multiply(0.5, add(Yk, inv(Z)));\n      Z = multiply(0.5, add(Z, inv(Yk)));\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   * 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\n\n  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(A) {\n      var size = isMatrix(A) ? A.size() : arraySize(A);\n\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 ' + '(size: ' + format(size) + ')');\n          }\n\n        case 2:\n          {\n            // Two-dimensional Array | Matrix\n            var rows = size[0];\n            var cols = size[1];\n\n            if (rows === cols) {\n              return _denmanBeavers(A);\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n            }\n          }\n\n        default:\n          // Multi dimensional array\n          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + format(size) + ')');\n      }\n    }\n  });\n});","import { deepForEach } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'multinomial';\nvar dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];\nexport var createMultinomial = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide,\n    multiply,\n    factorial,\n    isInteger,\n    isPositive\n  } = _ref;\n\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 ArrayMatrix(a) {\n      var sum = 0;\n      var denom = 1;\n      deepForEach(a, function (ai) {\n        if (!isInteger(ai) || !isPositive(ai)) {\n          throw new TypeError('Positive integer value expected in function multinomial');\n        }\n\n        sum = add(sum, ai);\n        denom = multiply(denom, factorial(ai));\n      });\n      return divide(factorial(sum), denom);\n    }\n  });\n});","import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'rotationMatrix';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];\nexport var createRotationMatrix = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    addScalar,\n    unaryMinus,\n    norm,\n    BigNumber,\n    matrix,\n    DenseMatrix,\n    SparseMatrix,\n    cos,\n    sin\n  } = _ref;\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  return typed(name, {\n    '': function _() {\n      return config.matrix === 'Matrix' ? matrix([]) : [];\n    },\n    string: function string(format) {\n      return matrix(format);\n    },\n    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(theta) {\n      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber | Complex | Unit, string': function numberBigNumberComplexUnitString(theta, format) {\n      return _rotationMatrix2x2(theta, format);\n    },\n    'number | BigNumber | Complex | Unit, Array': function numberBigNumberComplexUnitArray(theta, v) {\n      var matrixV = matrix(v);\n\n      _validateVector(matrixV);\n\n      return _rotationMatrix3x3(theta, matrixV, undefined);\n    },\n    'number | BigNumber | Complex | Unit, Matrix': function numberBigNumberComplexUnitMatrix(theta, v) {\n      _validateVector(v);\n\n      var storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined);\n      return _rotationMatrix3x3(theta, v, storageType);\n    },\n    'number | BigNumber | Complex | Unit, Array, string': function numberBigNumberComplexUnitArrayString(theta, v, format) {\n      var matrixV = matrix(v);\n\n      _validateVector(matrixV);\n\n      return _rotationMatrix3x3(theta, matrixV, format);\n    },\n    'number | BigNumber | Complex | Unit, Matrix, string': function numberBigNumberComplexUnitMatrixString(theta, v, format) {\n      _validateVector(v);\n\n      return _rotationMatrix3x3(theta, v, format);\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\n  function _rotationMatrix2x2(theta, format) {\n    var Big = isBigNumber(theta);\n    var minusOne = Big ? new BigNumber(-1) : -1;\n    var cosTheta = cos(theta);\n    var sinTheta = sin(theta);\n    var data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]];\n    return _convertToFormat(data, format);\n  }\n\n  function _validateVector(v) {\n    var size = v.size();\n\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\n      if (format === 'dense') {\n        return new DenseMatrix(data);\n      }\n\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    }\n\n    return data;\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\n\n  function _rotationMatrix3x3(theta, v, format) {\n    var normV = norm(v);\n\n    if (normV === 0) {\n      throw new RangeError('Rotation around zero vector');\n    }\n\n    var Big = isBigNumber(theta) ? BigNumber : null;\n    var one = Big ? new Big(1) : 1;\n    var minusOne = Big ? new Big(-1) : -1;\n    var vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV;\n    var vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV;\n    var vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV;\n    var c = cos(theta);\n    var oneMinusC = addScalar(one, unaryMinus(c));\n    var s = sin(theta);\n    var r11 = addScalar(c, _mul([vx, vx, oneMinusC]));\n    var r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]));\n    var r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]));\n    var r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]));\n    var r22 = addScalar(c, _mul([vy, vy, oneMinusC]));\n    var r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]));\n    var r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]));\n    var r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]));\n    var r33 = addScalar(c, _mul([vz, vz, oneMinusC]));\n    var data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]];\n    return _convertToFormat(data, format);\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';\nvar name = 'median';\nvar dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];\nexport var createMedian = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide,\n    compare,\n    partitionSelect\n  } = _ref;\n\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      var num = array.length;\n\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        var mid = num / 2 - 1;\n        var right = partitionSelect(array, mid + 1); // array now partitioned at mid + 1, take max of left part\n\n        var left = array[mid];\n\n        for (var 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        var m = partitionSelect(array, (num - 1) / 2);\n        return middle(m);\n      }\n    } catch (err) {\n      throw improveErrorMessage(err, 'median');\n    }\n  } // helper function to type check the middle value of the array\n\n\n  var middle = typed({\n    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(value) {\n      return value;\n    }\n  }); // helper function to type check the two middle value of the array\n\n  var middle2 = typed({\n    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function numberBigNumberComplexUnitNumberBigNumberComplexUnit(left, right) {\n      return divide(add(left, right), 2);\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\n  return typed(name, {\n    // median([a, b, c, d, ...])\n    'Array | Matrix': _median,\n    // median([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      // TODO: implement median(A, dim)\n      throw new Error('median(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], ...)\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});","import { factory } from '../../utils/factory.js';\nimport { arraySize } from '../../utils/array.js';\nvar name = 'rotate';\nvar dependencies = ['typed', 'multiply', 'rotationMatrix'];\nexport var createRotate = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    multiply,\n    rotationMatrix\n  } = _ref;\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 ArrayNumberBigNumberComplexUnit(w, theta) {\n      _validateSize(w, 2);\n\n      var matrixRes = multiply(rotationMatrix(theta), w);\n      return matrixRes.toArray();\n    },\n    'Matrix , number | BigNumber | Complex | Unit': function MatrixNumberBigNumberComplexUnit(w, theta) {\n      _validateSize(w, 2);\n\n      return multiply(rotationMatrix(theta), w);\n    },\n    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function ArrayNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {\n      _validateSize(w, 3);\n\n      var matrixRes = multiply(rotationMatrix(theta, v), w);\n      return matrixRes;\n    },\n    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function MatrixNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {\n      _validateSize(w, 3);\n\n      return multiply(rotationMatrix(theta, v), w);\n    }\n  });\n\n  function _validateSize(v, expectedSize) {\n    var actualSize = Array.isArray(v) ? arraySize(v) : v.size();\n\n    if (actualSize.length > 2) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n\n    if (actualSize.length === 2 && actualSize[1] !== 1) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n\n    if (actualSize[0] !== expectedSize) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n  }\n});","import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'mad';\nvar dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];\nexport var createMad = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    abs,\n    map,\n    median,\n    subtract\n  } = _ref;\n\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    // 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      var 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});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'unit';\nvar dependencies = ['typed', 'Unit']; // This function is named createUnitFunction to prevent a naming conflict with createUnit\n\nexport var createUnitFunction = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Unit\n  } = _ref;\n\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  return typed(name, {\n    Unit: function Unit(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      if (Unit.isValuelessUnit(x)) {\n        return new Unit(null, x); // a pure unit\n      }\n\n      return Unit.parse(x, {\n        allowNoUnits: true\n      }); // a unit with value, like '5cm'\n    },\n    'number | BigNumber | Fraction | Complex, string': function numberBigNumberFractionComplexString(value, unit) {\n      return new Unit(value, unit);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, this);\n    }\n  });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createResultSet, createComplexClass, createRangeClass, createFalse, createNull, createTrue, createBigNumberClass, createMatrixClass, createReplacer, createI, createLN10, createLOG10E, createNaN, createPi, createSQRT1_2 // eslint-disable-line camelcase\n, createTau, createEfimovFactor, createFineStructure, createSackurTetrode, createWeakMixingAngle, createFractionClass, createE, createInfinity, createLOG2E, createVersion, createDenseMatrixClass, createPhi, createTyped, createIsInteger, createIsNumeric, createIsPositive, createIsNaN, createEqualScalar, createNumber, createBoolean, createComplex, createSplitUnit, createUnaryPlus, createApply, createCube, createExpm1, createLog10, createMultiplyScalar, createSign, createSquare, createBitNot, createArg, createIm, createNot, createFilter, createForEach, createMap, createErf, createFormat, createOct, createPrint, createIsPrime, createAcos, createAcot, createAcsc, createAsec, createAsin, createAtan, createAtanh, createCosh, createCoth, createCsch, createSech, createSinh, createTanh, createCombinations, createPickRandom, createRandomInt, createLN2, createClone, createHasNumericValue, createTypeOf, createString, createFraction, createUnaryMinus, createAddScalar, createExp, createLog2, createSqrt, createConj, createGetMatrixDataType, createMode, createBin, createAcosh, createAcsch, createAsinh, createCos, createCsc, createSin, createCombinationsWithRep, createRandom, createSQRT2, createIsNegative, createSparseMatrixClass, createMatrix, createCbrt, createGcd, createMod, createNthRoot, createXgcd, createBitAnd, createBitXor, createOr, createConcat, createDiag, createIdentity, createOnes, createReshape, createSize, createSubset, createZeros, createHex, createRound, createLeftShift, createRightLogShift, createCompare, createCompareText, createSmaller, createLarger, createUnequal, createImmutableDenseMatrixClass, createFibonacciHeapClass, createSparse, createAcoth, createAtan2, createSec, createAdd, createDot, createComposition, createIsZero, createAbs, createFloor, createMultiply, createDotMultiply, createRe, createFlatten, createResize, createSqueeze, createTo, createPow, createDotPow, createRightArithShift, createCompareNatural, createEqualText, createLargerEq, createPartitionSelect, createIndexClass, createAsech, createTan, createSetDifference, createSetIntersect, createSetMultiplicity, createSetSize, createTrace, createQuantileSeq, createGamma, createBignumber, createLcm, createBitOr, createKron, createTranspose, createNumeric, createAnd, createSmallerEq, createSort, createMin, createCot, createSetDistinct, createSetPowerset, createIndex, createSum, createFactorial, createPermutations, createCeil, createSubtract, createCross, createRange, createRow, createProd, createEqual, createMax, createSetCartesian, createSetSymDifference, createFix, createColumn, createDiff, createCtranspose, createDeepEqual, createSetIsSubset, createXor, createDivideScalar, createNthRoots, createLsolve, createLsolveAll, createSpaClass, createSetUnion, createLup, createSlu, createDet, createDistance, createStirlingS2, createCatalan, createCount, createLog, createDotDivide, createUsolveAll, createHypot, createQr, createInv, createExpm, createDivide, createMean, createVariance, createKldivergence, createBellNumbers, createLog1p, createUnitClass, createCreateUnit, createEigs, createIntersect, createStd, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createDeuteronMass, createElectronMass, createFaraday, createFirstRadiation, createGravitationConstant, createHartreeEnergy, createKlitzing, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createPlanckCharge, createPlanckLength, createPlanckTemperature, createProtonMass, createReducedPlanckConstant, createSecondRadiation, createStefanBoltzmann, createVacuumImpedance, createUsolve, createNorm, createLusolve, createSqrtm, createMultinomial, createAvogadro, createClassicalElectronRadius, createElectricConstant, createFermiCoupling, createGravity, createLoschmidt, createMolarMassC12, createNuclearMagneton, createPlanckMass, createQuantumOfCirculation, createSpeedOfLight, createWienDisplacement, createRotationMatrix, createMedian, createBohrRadius, createElementaryCharge, createInverseConductanceQuantum, createMolarVolume, createPlanckTime, createThomsonCrossSection, createRotate, createMad, createCoulomb, createMagneticFluxQuantum, createRydberg, createUnitFunction, createGasConstant, createPlanckConstant } from '../factoriesAny.js';\nexport var ResultSet = /* #__PURE__ */createResultSet({});\nexport var Complex = /* #__PURE__ */createComplexClass({});\nexport var Range = /* #__PURE__ */createRangeClass({});\nexport var _false = /* #__PURE__ */createFalse({});\nexport var _null = /* #__PURE__ */createNull({});\nexport var _true = /* #__PURE__ */createTrue({});\nexport var BigNumber = /* #__PURE__ */createBigNumberClass({\n  config\n});\nexport var Matrix = /* #__PURE__ */createMatrixClass({});\nexport var replacer = /* #__PURE__ */createReplacer({});\nexport var i = /* #__PURE__ */createI({\n  Complex\n});\nexport var LN10 = /* #__PURE__ */createLN10({\n  BigNumber,\n  config\n});\nexport var LOG10E = /* #__PURE__ */createLOG10E({\n  BigNumber,\n  config\n});\nexport var _NaN = /* #__PURE__ */createNaN({\n  BigNumber,\n  config\n});\nexport var pi = /* #__PURE__ */createPi({\n  BigNumber,\n  config\n});\nexport var SQRT1_2 = /* #__PURE__ */createSQRT1_2({\n  BigNumber,\n  config\n});\nexport var tau = /* #__PURE__ */createTau({\n  BigNumber,\n  config\n});\nexport var efimovFactor = /* #__PURE__ */createEfimovFactor({\n  BigNumber,\n  config\n});\nexport var fineStructure = /* #__PURE__ */createFineStructure({\n  BigNumber,\n  config\n});\nexport var sackurTetrode = /* #__PURE__ */createSackurTetrode({\n  BigNumber,\n  config\n});\nexport var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({\n  BigNumber,\n  config\n});\nexport var Fraction = /* #__PURE__ */createFractionClass({});\nexport var e = /* #__PURE__ */createE({\n  BigNumber,\n  config\n});\nexport var _Infinity = /* #__PURE__ */createInfinity({\n  BigNumber,\n  config\n});\nexport var LOG2E = /* #__PURE__ */createLOG2E({\n  BigNumber,\n  config\n});\nexport var version = /* #__PURE__ */createVersion({});\nexport var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({\n  Matrix\n});\nexport var phi = /* #__PURE__ */createPhi({\n  BigNumber,\n  config\n});\nexport var typed = /* #__PURE__ */createTyped({\n  BigNumber,\n  Complex,\n  DenseMatrix,\n  Fraction\n});\nexport var isInteger = /* #__PURE__ */createIsInteger({\n  typed\n});\nexport var isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  typed\n});\nexport var isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var equalScalar = /* #__PURE__ */createEqualScalar({\n  config,\n  typed\n});\nexport var number = /* #__PURE__ */createNumber({\n  typed\n});\nexport var boolean = /* #__PURE__ */createBoolean({\n  typed\n});\nexport var complex = /* #__PURE__ */createComplex({\n  Complex,\n  typed\n});\nexport var splitUnit = /* #__PURE__ */createSplitUnit({\n  typed\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  BigNumber,\n  config,\n  typed\n});\nexport var apply = /* #__PURE__ */createApply({\n  isInteger,\n  typed\n});\nexport var cube = /* #__PURE__ */createCube({\n  typed\n});\nexport var expm1 = /* #__PURE__ */createExpm1({\n  Complex,\n  typed\n});\nexport var log10 = /* #__PURE__ */createLog10({\n  Complex,\n  config,\n  typed\n});\nexport var multiplyScalar = /* #__PURE__ */createMultiplyScalar({\n  typed\n});\nexport var sign = /* #__PURE__ */createSign({\n  BigNumber,\n  Fraction,\n  complex,\n  typed\n});\nexport var square = /* #__PURE__ */createSquare({\n  typed\n});\nexport var bitNot = /* #__PURE__ */createBitNot({\n  typed\n});\nexport var arg = /* #__PURE__ */createArg({\n  typed\n});\nexport var im = /* #__PURE__ */createIm({\n  typed\n});\nexport var not = /* #__PURE__ */createNot({\n  typed\n});\nexport var filter = /* #__PURE__ */createFilter({\n  typed\n});\nexport var forEach = /* #__PURE__ */createForEach({\n  typed\n});\nexport var map = /* #__PURE__ */createMap({\n  typed\n});\nexport var erf = /* #__PURE__ */createErf({\n  typed\n});\nexport var format = /* #__PURE__ */createFormat({\n  typed\n});\nexport var oct = /* #__PURE__ */createOct({\n  format,\n  typed\n});\nexport var print = /* #__PURE__ */createPrint({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var acos = /* #__PURE__ */createAcos({\n  Complex,\n  config,\n  typed\n});\nexport var acot = /* #__PURE__ */createAcot({\n  BigNumber,\n  typed\n});\nexport var acsc = /* #__PURE__ */createAcsc({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asec = /* #__PURE__ */createAsec({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asin = /* #__PURE__ */createAsin({\n  Complex,\n  config,\n  typed\n});\nexport var atan = /* #__PURE__ */createAtan({\n  typed\n});\nexport var atanh = /* #__PURE__ */createAtanh({\n  Complex,\n  config,\n  typed\n});\nexport var cosh = /* #__PURE__ */createCosh({\n  typed\n});\nexport var coth = /* #__PURE__ */createCoth({\n  BigNumber,\n  typed\n});\nexport var csch = /* #__PURE__ */createCsch({\n  BigNumber,\n  typed\n});\nexport var sech = /* #__PURE__ */createSech({\n  BigNumber,\n  typed\n});\nexport var sinh = /* #__PURE__ */createSinh({\n  typed\n});\nexport var tanh = /* #__PURE__ */createTanh({\n  typed\n});\nexport var combinations = /* #__PURE__ */createCombinations({\n  typed\n});\nexport var pickRandom = /* #__PURE__ */createPickRandom({\n  config,\n  typed\n});\nexport var randomInt = /* #__PURE__ */createRandomInt({\n  config,\n  typed\n});\nexport var LN2 = /* #__PURE__ */createLN2({\n  BigNumber,\n  config\n});\nexport var clone = /* #__PURE__ */createClone({\n  typed\n});\nexport var hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\n});\nexport var typeOf = /* #__PURE__ */createTypeOf({\n  typed\n});\nexport var string = /* #__PURE__ */createString({\n  typed\n});\nexport var fraction = /* #__PURE__ */createFraction({\n  Fraction,\n  typed\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\n  typed\n});\nexport var addScalar = /* #__PURE__ */createAddScalar({\n  typed\n});\nexport var exp = /* #__PURE__ */createExp({\n  typed\n});\nexport var log2 = /* #__PURE__ */createLog2({\n  Complex,\n  config,\n  typed\n});\nexport var sqrt = /* #__PURE__ */createSqrt({\n  Complex,\n  config,\n  typed\n});\nexport var conj = /* #__PURE__ */createConj({\n  typed\n});\nexport var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({\n  typed\n});\nexport var mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var bin = /* #__PURE__ */createBin({\n  format,\n  typed\n});\nexport var acosh = /* #__PURE__ */createAcosh({\n  Complex,\n  config,\n  typed\n});\nexport var acsch = /* #__PURE__ */createAcsch({\n  BigNumber,\n  typed\n});\nexport var asinh = /* #__PURE__ */createAsinh({\n  typed\n});\nexport var cos = /* #__PURE__ */createCos({\n  typed\n});\nexport var csc = /* #__PURE__ */createCsc({\n  BigNumber,\n  typed\n});\nexport var sin = /* #__PURE__ */createSin({\n  typed\n});\nexport var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({\n  typed\n});\nexport var random = /* #__PURE__ */createRandom({\n  config,\n  typed\n});\nexport var SQRT2 = /* #__PURE__ */createSQRT2({\n  BigNumber,\n  config\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  typed\n});\nexport var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({\n  Matrix,\n  equalScalar,\n  typed\n});\nexport var matrix = /* #__PURE__ */createMatrix({\n  DenseMatrix,\n  Matrix,\n  SparseMatrix,\n  typed\n});\nexport var cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var gcd = /* #__PURE__ */createGcd({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var mod = /* #__PURE__ */createMod({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var xgcd = /* #__PURE__ */createXgcd({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var bitAnd = /* #__PURE__ */createBitAnd({\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitXor = /* #__PURE__ */createBitXor({\n  DenseMatrix,\n  matrix,\n  typed\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\n  typed\n});\nexport var diag = /* #__PURE__ */createDiag({\n  DenseMatrix,\n  SparseMatrix,\n  matrix,\n  typed\n});\nexport var identity = /* #__PURE__ */createIdentity({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var ones = /* #__PURE__ */createOnes({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\n});\nexport var size = /* #__PURE__ */createSize({\n  matrix,\n  config,\n  typed\n});\nexport var subset = /* #__PURE__ */createSubset({\n  matrix,\n  typed\n});\nexport var zeros = /* #__PURE__ */createZeros({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var hex = /* #__PURE__ */createHex({\n  format,\n  typed\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var leftShift = /* #__PURE__ */createLeftShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var compare = /* #__PURE__ */createCompare({\n  BigNumber,\n  DenseMatrix,\n  Fraction,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var compareText = /* #__PURE__ */createCompareText({\n  matrix,\n  typed\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var unequal = /* #__PURE__ */createUnequal({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({\n  DenseMatrix,\n  smaller\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var sparse = /* #__PURE__ */createSparse({\n  SparseMatrix,\n  typed\n});\nexport var acoth = /* #__PURE__ */createAcoth({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var atan2 = /* #__PURE__ */createAtan2({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var sec = /* #__PURE__ */createSec({\n  BigNumber,\n  typed\n});\nexport var add = /* #__PURE__ */createAdd({\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var composition = /* #__PURE__ */createComposition({\n  addScalar,\n  combinations,\n  isInteger,\n  isNegative,\n  isPositive,\n  larger,\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  typed\n});\nexport var abs = /* #__PURE__ */createAbs({\n  typed\n});\nexport var floor = /* #__PURE__ */createFloor({\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed\n});\nexport var multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var dotMultiply = /* #__PURE__ */createDotMultiply({\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var re = /* #__PURE__ */createRe({\n  typed\n});\nexport var flatten = /* #__PURE__ */createFlatten({\n  matrix,\n  typed\n});\nexport var resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var squeeze = /* #__PURE__ */createSqueeze({\n  matrix,\n  typed\n});\nexport var to = /* #__PURE__ */createTo({\n  matrix,\n  typed\n});\nexport var pow = /* #__PURE__ */createPow({\n  Complex,\n  config,\n  fraction,\n  identity,\n  matrix,\n  multiply,\n  number,\n  typed\n});\nexport var dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\n  typed\n});\nexport var equalText = /* #__PURE__ */createEqualText({\n  compareText,\n  isZero,\n  typed\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var Index = /* #__PURE__ */createIndexClass({\n  ImmutableDenseMatrix\n});\nexport var asech = /* #__PURE__ */createAsech({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var tan = /* #__PURE__ */createTan({\n  typed\n});\nexport var setDifference = /* #__PURE__ */createSetDifference({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setMultiplicity = /* #__PURE__ */createSetMultiplicity({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSize = /* #__PURE__ */createSetSize({\n  compareNatural,\n  typed\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\n  typed\n});\nexport var quantileSeq = /* #__PURE__ */createQuantileSeq({\n  add,\n  compare,\n  multiply,\n  partitionSelect,\n  typed\n});\nexport var gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var bignumber = /* #__PURE__ */createBignumber({\n  BigNumber,\n  typed\n});\nexport var lcm = /* #__PURE__ */createLcm({\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitOr = /* #__PURE__ */createBitOr({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var transpose = /* #__PURE__ */createTranspose({\n  matrix,\n  typed\n});\nexport var numeric = /* #__PURE__ */createNumeric({\n  bignumber,\n  fraction,\n  number\n});\nexport var and = /* #__PURE__ */createAnd({\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  numeric,\n  smaller,\n  typed\n});\nexport var cot = /* #__PURE__ */createCot({\n  BigNumber,\n  typed\n});\nexport var setDistinct = /* #__PURE__ */createSetDistinct({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setPowerset = /* #__PURE__ */createSetPowerset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\n  typed\n});\nexport var sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\n});\nexport var factorial = /* #__PURE__ */createFactorial({\n  gamma,\n  typed\n});\nexport var permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  addScalar,\n  equalScalar,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var cross = /* #__PURE__ */createCross({\n  matrix,\n  multiply,\n  subtract,\n  typed\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  config,\n  larger,\n  largerEq,\n  smaller,\n  smallerEq,\n  typed\n});\nexport var row = /* #__PURE__ */createRow({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var prod = /* #__PURE__ */createProd({\n  config,\n  multiplyScalar,\n  numeric,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  larger,\n  numeric,\n  typed\n});\nexport var setCartesian = /* #__PURE__ */createSetCartesian({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSymDifference = /* #__PURE__ */createSetSymDifference({\n  Index,\n  concat,\n  setDifference,\n  size,\n  subset,\n  typed\n});\nexport var fix = /* #__PURE__ */createFix({\n  Complex,\n  ceil,\n  floor,\n  matrix,\n  typed\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var diff = /* #__PURE__ */createDiff({\n  matrix,\n  number,\n  subtract,\n  typed\n});\nexport var ctranspose = /* #__PURE__ */createCtranspose({\n  conj,\n  transpose,\n  typed\n});\nexport var deepEqual = /* #__PURE__ */createDeepEqual({\n  equal,\n  typed\n});\nexport var setIsSubset = /* #__PURE__ */createSetIsSubset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var xor = /* #__PURE__ */createXor({\n  DenseMatrix,\n  matrix,\n  typed\n});\nexport var divideScalar = /* #__PURE__ */createDivideScalar({\n  numeric,\n  typed\n});\nexport var nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var lsolveAll = /* #__PURE__ */createLsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\n});\nexport var setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var lup = /* #__PURE__ */createLup({\n  DenseMatrix,\n  Spa,\n  SparseMatrix,\n  abs,\n  addScalar,\n  divideScalar,\n  equalScalar,\n  larger,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var slu = /* #__PURE__ */createSlu({\n  SparseMatrix,\n  abs,\n  add,\n  divideScalar,\n  larger,\n  largerEq,\n  multiply,\n  subtract,\n  transpose,\n  typed\n});\nexport var det = /* #__PURE__ */createDet({\n  lup,\n  matrix,\n  multiply,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var distance = /* #__PURE__ */createDistance({\n  abs,\n  addScalar,\n  divideScalar,\n  multiplyScalar,\n  sqrt,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var stirlingS2 = /* #__PURE__ */createStirlingS2({\n  addScalar,\n  combinations,\n  divideScalar,\n  factorial,\n  isInteger,\n  isNegative,\n  larger,\n  multiplyScalar,\n  pow,\n  subtract,\n  typed\n});\nexport var catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var count = /* #__PURE__ */createCount({\n  prod,\n  size,\n  typed\n});\nexport var log = /* #__PURE__ */createLog({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var dotDivide = /* #__PURE__ */createDotDivide({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var usolveAll = /* #__PURE__ */createUsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var hypot = /* #__PURE__ */createHypot({\n  abs,\n  addScalar,\n  divideScalar,\n  isPositive,\n  multiplyScalar,\n  smaller,\n  sqrt,\n  typed\n});\nexport var qr = /* #__PURE__ */createQr({\n  addScalar,\n  complex,\n  conj,\n  divideScalar,\n  equal,\n  identity,\n  isZero,\n  matrix,\n  multiplyScalar,\n  sign,\n  sqrt,\n  subtract,\n  typed,\n  unaryMinus,\n  zeros\n});\nexport var inv = /* #__PURE__ */createInv({\n  abs,\n  addScalar,\n  det,\n  divideScalar,\n  identity,\n  matrix,\n  multiply,\n  typed,\n  unaryMinus\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var mean = /* #__PURE__ */createMean({\n  add,\n  divide,\n  typed\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  apply,\n  divide,\n  isNaN,\n  multiply,\n  subtract,\n  typed\n});\nexport var kldivergence = /* #__PURE__ */createKldivergence({\n  divide,\n  dotDivide,\n  isNumeric,\n  log,\n  matrix,\n  multiply,\n  sum,\n  typed\n});\nexport var bellNumbers = /* #__PURE__ */createBellNumbers({\n  addScalar,\n  isInteger,\n  isNegative,\n  stirlingS2,\n  typed\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\n  typed\n});\nexport var Unit = /* #__PURE__ */createUnitClass({\n  BigNumber,\n  Complex,\n  Fraction,\n  abs,\n  addScalar,\n  config,\n  divideScalar,\n  equal,\n  fix,\n  format,\n  isNumeric,\n  multiplyScalar,\n  number,\n  pow,\n  round,\n  subtract\n});\nexport var createUnit = /* #__PURE__ */createCreateUnit({\n  Unit,\n  typed\n});\nexport var eigs = /* #__PURE__ */createEigs({\n  abs,\n  add,\n  addScalar,\n  atan,\n  bignumber,\n  config,\n  cos,\n  equal,\n  inv,\n  matrix,\n  multiply,\n  multiplyScalar,\n  sin,\n  subtract,\n  typed\n});\nexport var intersect = /* #__PURE__ */createIntersect({\n  abs,\n  add,\n  addScalar,\n  config,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiply,\n  multiplyScalar,\n  smaller,\n  subtract,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  sqrt,\n  typed,\n  variance\n});\nexport var atomicMass = /* #__PURE__ */createAtomicMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrMagneton = /* #__PURE__ */createBohrMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var boltzmann = /* #__PURE__ */createBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var deuteronMass = /* #__PURE__ */createDeuteronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var electronMass = /* #__PURE__ */createElectronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\n});\nexport var firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var klitzing = /* #__PURE__ */createKlitzing({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticConstant = /* #__PURE__ */createMagneticConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMass = /* #__PURE__ */createMolarMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var secondRadiation = /* #__PURE__ */createSecondRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var usolve = /* #__PURE__ */createUsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var norm = /* #__PURE__ */createNorm({\n  abs,\n  add,\n  conj,\n  ctranspose,\n  eigs,\n  equalScalar,\n  larger,\n  matrix,\n  multiply,\n  pow,\n  smaller,\n  sqrt,\n  typed\n});\nexport var lusolve = /* #__PURE__ */createLusolve({\n  DenseMatrix,\n  lsolve,\n  lup,\n  matrix,\n  slu,\n  typed,\n  usolve\n});\nexport var sqrtm = /* #__PURE__ */createSqrtm({\n  abs,\n  add,\n  identity,\n  inv,\n  max,\n  multiply,\n  size,\n  sqrt,\n  subtract,\n  typed\n});\nexport var multinomial = /* #__PURE__ */createMultinomial({\n  add,\n  divide,\n  factorial,\n  isInteger,\n  isPositive,\n  multiply,\n  typed\n});\nexport var avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\n});\nexport var loschmidt = /* #__PURE__ */createLoschmidt({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var speedOfLight = /* #__PURE__ */createSpeedOfLight({\n  BigNumber,\n  Unit,\n  config\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotationMatrix = /* #__PURE__ */createRotationMatrix({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  config,\n  cos,\n  matrix,\n  multiplyScalar,\n  norm,\n  sin,\n  typed,\n  unaryMinus\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTime = /* #__PURE__ */createPlanckTime({\n  BigNumber,\n  Unit,\n  config\n});\nexport var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var coulomb = /* #__PURE__ */createCoulomb({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rydberg = /* #__PURE__ */createRydberg({\n  BigNumber,\n  Unit,\n  config\n});\nexport var unit = /* #__PURE__ */createUnitFunction({\n  Unit,\n  typed\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\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  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n  this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","/**\n * Create a range error with the message:\n *     'Index out of range (index < min)'\n *     'Index out of range (index < max)'\n *\n * @param {number} index     The actual index\n * @param {number} [min=0]   Minimum index (included)\n * @param {number} [max]     Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n\n  this.index = index;\n\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}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","import { factory } from '../../utils/factory.js';\nimport { arraySize } from '../../utils/array.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { IndexError } from '../../error/IndexError.js';\nvar name = 'apply';\nvar dependencies = ['typed', 'isInteger'];\nexport var createApply = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n\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 ArrayMatrixNumberBigNumberFunction(mat, dim, callback) {\n      if (!isInteger(dim)) {\n        throw new TypeError('Integer number expected for dimension');\n      }\n\n      var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n\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 * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\n\nfunction _apply(mat, dim, callback) {\n  var 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\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _apply(tran[i], dim - 1, callback);\n      }\n\n      return ret;\n    }\n  } else {\n    ret = [];\n\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _apply(mat[i], dim - 1, callback);\n    }\n\n    return ret;\n  }\n}\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n\n    ret.push(tmp);\n  }\n\n  return ret;\n}","import { factory } from '../../utils/factory.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createColumn = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n\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    'Array, number': function ArrayNumber(value, column) {\n      return _column(matrix(clone(value)), column).valueOf();\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\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    var rowRange = range(0, value.size()[0]);\n    var index = new Index(rowRange, column);\n    return value.subset(index);\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';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcat = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n\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 ArrayMatrixNumberBigNumber(args) {\n      var i;\n      var len = args.length;\n      var dim = -1; // zero-based dimension\n\n      var prevDim;\n      var asMatrix = false;\n      var matrices = []; // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        var arg = args[i]; // test whether we need to return a Matrix (if not we return an Array)\n\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          } // last argument contains the dimension on which to concatenate\n\n\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          var m = clone(arg).valueOf();\n          var size = arraySize(m);\n          matrices[i] = m;\n          prevDim = dim;\n          dim = size.length - 1; // verify whether each of the matrices has the same number of dimensions\n\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      var res = matrices.shift();\n\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim, 0);\n      }\n\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\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 */\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    var c = [];\n\n    for (var i = 0; i < a.length; i++) {\n      c[i] = _concat(a[i], b[i], concatDim, dim + 1);\n    }\n\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}","import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number'];\nexport var createDiff = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    number\n  } = _ref;\n\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 ArrayMatrix(arr) {\n      // 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 ArrayMatrixNumber(arr, dim) {\n      if (!isInteger(dim)) throw new RangeError('Dimension must be a whole number');\n\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 ArrayMatrixBigNumber(arr, dim) {\n      return this(arr, number(dim));\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\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\n    if (!Array.isArray(arr)) {\n      throw RangeError('Array/Matrix does not have that many dimensions');\n    }\n\n    if (dim > 0) {\n      var 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   * Difference between elements in the array\n   *\n   * @param {Array} arr      An array\n   * @return {Array}         resulting array\n   */\n\n\n  function _diff(arr) {\n    var result = [];\n    var size = arr.length;\n\n    if (size < 2) {\n      return arr;\n    }\n\n    for (var i = 1; i < size; i++) {\n      result.push(_ElementDiff(arr[i - 1], arr[i]));\n    }\n\n    return result;\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\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    var obj1IsArray = Array.isArray(obj1);\n    var obj2IsArray = Array.isArray(obj2);\n\n    if (obj1IsArray && obj2IsArray) {\n      return _ArrayDiff(obj1, obj2);\n    }\n\n    if (!obj1IsArray && !obj2IsArray) {\n      return subtract(obj2, obj1); // Difference is (second - first) NOT (first - second)\n    }\n\n    throw TypeError('Cannot calculate difference between 1 array and 1 non-array');\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\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\n    var result = [];\n    var size = arr1.length;\n\n    for (var i = 0; i < size; i++) {\n      result.push(_ElementDiff(arr1[i], arr2[i]));\n    }\n\n    return result;\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { noBignumber, noMatrix } from '../../utils/noop.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];\nexport var createRange = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq\n  } = _ref;\n\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    // TODO: a number or boolean should not be converted to string here\n    string: _strRange,\n    'string, boolean': _strRange,\n    'number, number': function numberNumber(start, end) {\n      return _out(_rangeEx(start, end, 1));\n    },\n    'number, number, number': function numberNumberNumber(start, end, step) {\n      return _out(_rangeEx(start, end, step));\n    },\n    'number, number, boolean': function numberNumberBoolean(start, end, includeEnd) {\n      return includeEnd ? _out(_rangeInc(start, end, 1)) : _out(_rangeEx(start, end, 1));\n    },\n    'number, number, number, boolean': function numberNumberNumberBoolean(start, end, step, includeEnd) {\n      return includeEnd ? _out(_rangeInc(start, end, step)) : _out(_rangeEx(start, end, step));\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(start, end) {\n      var BigNumber = start.constructor;\n      return _out(_bigRangeEx(start, end, new BigNumber(1)));\n    },\n    'BigNumber, BigNumber, BigNumber': function BigNumberBigNumberBigNumber(start, end, step) {\n      return _out(_bigRangeEx(start, end, step));\n    },\n    'BigNumber, BigNumber, boolean': function BigNumberBigNumberBoolean(start, end, includeEnd) {\n      var BigNumber = start.constructor;\n      return includeEnd ? _out(_bigRangeInc(start, end, new BigNumber(1))) : _out(_bigRangeEx(start, end, new BigNumber(1)));\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function BigNumberBigNumberBigNumberBoolean(start, end, step, includeEnd) {\n      return includeEnd ? _out(_bigRangeInc(start, end, step)) : _out(_bigRangeEx(start, end, step));\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    var r = _parse(str);\n\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range');\n    }\n\n    var fn;\n\n    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        noBignumber();\n      }\n\n      fn = includeEnd ? _bigRangeInc : _bigRangeEx;\n      return _out(fn(bignumber(r.start), bignumber(r.end), bignumber(r.step)));\n    } else {\n      fn = includeEnd ? _rangeInc : _rangeEx;\n      return _out(fn(r.start, r.end, r.step));\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\n\n  function _rangeEx(start, end, step) {\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _rangeInc(start, end, step) {\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _bigRangeEx(start, end, step) {\n    var zero = bignumber(0);\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _bigRangeInc(start, end, step) {\n    var zero = bignumber(0);\n    var array = [];\n    var x = start;\n\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   * 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\n\n  function _parse(str) {\n    var args = str.split(':'); // number\n\n    var 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    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\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});","import { factory } from '../../utils/factory.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'row';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createRow = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n\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    'Array, number': function ArrayNumber(value, row) {\n      return _row(matrix(clone(value)), row).valueOf();\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\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    var columnRange = range(0, value.size()[1]);\n    var index = new Index(row, columnRange);\n    return value.subset(index);\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';\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix'];\nexport var createSubset = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n\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]]\n   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 6], [0, 7]]\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                     An index containing ranges for each\n   *                                          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 ArrayIndex(value, index) {\n      var m = matrix(value);\n      var subset = m.subset(index); // returns a Matrix\n\n      return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)\n    },\n    'Matrix, Index': function MatrixIndex(value, index) {\n      return value.subset(index);\n    },\n    'Object, Index': _getObjectProperty,\n    'string, Index': _getSubstring,\n    // set subset\n    'Array, Index, any': function ArrayIndexAny(value, index, replacement) {\n      return matrix(clone(value)).subset(index, replacement, undefined).valueOf();\n    },\n    'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {\n      return matrix(clone(value)).subset(index, replacement, defaultValue).valueOf();\n    },\n    'Matrix, Index, any': function MatrixIndexAny(value, index, replacement) {\n      return value.clone().subset(index, replacement);\n    },\n    'Matrix, Index, any, any': function MatrixIndexAnyAny(value, index, replacement, defaultValue) {\n      return value.clone().subset(index, replacement, defaultValue);\n    },\n    'string, Index, string': _setSubstring,\n    'string, Index, string, string': _setSubstring,\n    'Object, Index, any': _setObjectProperty\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 containing ranges for each dimension\n * @returns {string} substring\n * @private\n */\n\nfunction _getSubstring(str, index) {\n  if (!isIndex(index)) {\n    // TODO: better error message\n    throw new TypeError('Index expected');\n  }\n\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1);\n  } // validate whether the range is out of range\n\n\n  var strLen = str.length;\n  validateIndex(index.min()[0], strLen);\n  validateIndex(index.max()[0], strLen);\n  var range = index.dimension(0);\n  var substr = '';\n  range.forEach(function (v) {\n    substr += str.charAt(v);\n  });\n  return substr;\n}\n/**\n * Replace a substring in a string\n * @param {string} str            string to be replaced\n * @param {Index} index           An index containing ranges for each dimension\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 */\n\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\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1);\n  }\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  var range = index.dimension(0);\n  var len = range.size()[0];\n\n  if (len !== replacement.length) {\n    throw new DimensionError(range.size()[0], replacement.length);\n  } // validate whether the range is out of range\n\n\n  var strLen = str.length;\n  validateIndex(index.min()[0]);\n  validateIndex(index.max()[0]); // copy the string into an array with characters\n\n  var chars = [];\n\n  for (var 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  }); // initialize undefined characters with a space\n\n  if (chars.length > strLen) {\n    for (var _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 * 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 */\n\n\nfunction _getObjectProperty(object, index) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1);\n  }\n\n  var key = index.dimension(0);\n\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 * 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 */\n\n\nfunction _setObjectProperty(object, index, replacement) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1);\n  }\n\n  var key = index.dimension(0);\n\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property');\n  } // clone the object, and apply the property to the clone\n\n\n  var updated = clone(object);\n  setSafeProperty(updated, key, replacement);\n  return updated;\n}","import { deepForEach, reduce, containsCollections } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger'];\nexport var createMax = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    larger\n  } = _ref;\n\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    // max([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _largest);\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   * 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\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   * Recursively calculate the maximum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} max\n   * @private\n   */\n\n\n  function _max(array) {\n    var res;\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    } // make sure returning numeric value: parse a string into a numeric value\n\n\n    if (typeof res === 'string') {\n      res = numeric(res, config.number);\n    }\n\n    return res;\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';\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nexport var createMean = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    divide\n  } = _ref;\n\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    // mean([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nmeanDim,\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   * 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\n  function _nmeanDim(array, dim) {\n    try {\n      var sum = reduce(array, dim, add);\n      var 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   * Recursively calculate the mean value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} mean\n   * @private\n   */\n\n\n  function _mean(array) {\n    var sum;\n    var num = 0;\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\n    return divide(sum, num);\n  }\n});","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller'];\nexport var createMin = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    numeric,\n    smaller\n  } = _ref;\n\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    // min([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _smallest);\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   * 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\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   * Recursively calculate the minimum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} min\n   * @private\n   */\n\n\n  function _min(array) {\n    var min;\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    } // make sure returning numeric value: parse a string into a numeric value\n\n\n    if (typeof min === 'string') {\n      min = numeric(min, config.number);\n    }\n\n    return min;\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'std';\nvar dependencies = ['typed', 'sqrt', 'variance'];\nexport var createStd = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    sqrt,\n    variance\n  } = _ref;\n\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    // std([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _std,\n    // std([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': _std,\n    // std([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _std,\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});","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nexport var createSum = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    config,\n    add,\n    numeric\n  } = _ref;\n\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\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    // sum([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nsumDim,\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   * Recursively calculate the sum of an n-dimensional array\n   * @param {Array | Matrix} array\n   * @return {number} sum\n   * @private\n   */\n\n  function _sum(array) {\n    var sum;\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    }); // make sure returning numeric value: parse a string into a numeric value\n\n    if (sum === undefined) {\n      sum = numeric(0, config.number);\n    }\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      var sum = reduce(array, dim, add);\n      return sum;\n    } catch (err) {\n      throw improveErrorMessage(err, 'sum');\n    }\n  }\n});","import { typeOf } from '../../../utils/is.js';\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 */\n\nexport function improveErrorMessage(err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  var details;\n\n  if (String(err).indexOf('Unexpected type') !== -1) {\n    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';\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 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : '';\n    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);\n  }\n\n  return err;\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';\nvar DEFAULT_NORMALIZATION = 'unbiased';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];\nexport var createVariance = /* #__PURE__ */factory(name, dependencies, (_ref) => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    apply,\n    isNaN\n  } = _ref;\n\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 ArrayMatrix(array) {\n      return _var(array, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _var,\n    // variance([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return _varDim(array, dim, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _varDim,\n    // variance(a, b, c, d, ...)\n    '...': function _(args) {\n      return _var(args, DEFAULT_NORMALIZATION);\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\n  function _var(array, normalization) {\n    var sum;\n    var num = 0;\n\n    if (array.length === 0) {\n      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');\n    } // calculate the mean and number of elements\n\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, 'variance', value);\n      }\n    });\n    if (num === 0) throw new Error('Cannot calculate variance of an empty array');\n    var mean = divide(sum, num); // calculate the variance\n\n    sum = undefined;\n    deepForEach(array, function (value) {\n      var 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          var 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 + '\". ' + '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\n      return apply(array, dim, x => _var(x, normalization));\n    } catch (err) {\n      throw improveErrorMessage(err, 'variance');\n    }\n  }\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 * 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 */\n\nexport function arraySize(x) {\n  var s = [];\n\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n\n  return s;\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 */\n\nfunction _validate(array, size, dim) {\n  var i;\n  var 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    var dimNext = dim + 1;\n\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n\n      if (!Array.isArray(child)) {\n        throw new DimensionError(size.length - 1, size.length, '<');\n      }\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 * 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 */\n\n\nexport function validate(array, size) {\n  var isScalar = size.length === 0;\n\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 * 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 */\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\n  if (index < 0 || typeof length === 'number' && index >= length) {\n    throw new IndexError(index, length);\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 */\n\nexport function resize(array, size, defaultValue) {\n  // TODO: add support for scalars, having size=[] ?\n  // check the type of the arguments\n  if (!Array.isArray(array) || !Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  } // check whether size contains positive integers\n\n\n  size.forEach(function (value) {\n    if (!isNumber(value) || !isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n  }); // recursively resize the array\n\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n\n  _resize(array, size, 0, _defaultValue);\n\n  return array;\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 */\n\nfunction _resize(array, size, dim, defaultValue) {\n  var i;\n  var elem;\n  var oldLen = array.length;\n  var newLen = size[dim];\n  var minLen = Math.min(oldLen, newLen); // apply new length\n\n  array.length = newLen;\n\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1; // resize existing child arrays\n\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n\n        array[i] = elem;\n      }\n\n      _resize(elem, size, dimNext, defaultValue);\n    } // create new child arrays\n\n\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem; // resize new child array\n\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\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    } // fill new elements with the default value\n\n\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\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 */\n\n\nexport function reshape(array, sizes) {\n  var flatArray = flatten(array);\n  var 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  var newLength = product(sizes);\n\n  if (currentLength !== newLength) {\n    throw new DimensionError(newLength, currentLength, '!=');\n  }\n\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(newLength, currentLength, '!=');\n    }\n\n    throw e;\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 */\n\nexport function processSizesWildcard(sizes, currentLength) {\n  var newLength = product(sizes);\n  var processedSizes = sizes.slice();\n  var WILDCARD = -1;\n  var wildCardIndex = sizes.indexOf(WILDCARD);\n  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes');\n  }\n\n  var hasWildcard = wildCardIndex >= 0;\n  var 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\n  return processedSizes;\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 */\n\nfunction product(array) {\n  return array.reduce((prev, curr) => prev * curr, 1);\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\n\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2; // for each dimensions starting by the last one and ignoring the first one\n\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = []; // aggregate the elements of the current tmpArray in elements of the requested size\n\n    var length = tmpArray.length / size;\n\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    } // set it as the new tmpArray for the next loop turn or for return\n\n\n    tmpArray = tmpArray2;\n  }\n\n  return tmpArray;\n}\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\n\n\nexport function squeeze(array, size) {\n  var s = size || arraySize(array); // squeeze outer dimensions\n\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  } // find the first dimension to be squeezed\n\n\n  var dims = s.length;\n\n  while (s[dims - 1] === 1) {\n    dims--;\n  } // squeeze inner dimensions\n\n\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n\n  return array;\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 */\n\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n\n  if (dim < dims) {\n    var next = dim + 1;\n\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 * 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 */\n\n\nexport function unsqueeze(array, dims, outer, size) {\n  var s = size || arraySize(array); // unsqueeze outer dimensions\n\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  } // unsqueeze inner dimensions\n\n\n  array = _unsqueeze(array, dims, 0);\n\n  while (s.length < dims) {\n    s.push(1);\n  }\n\n  return array;\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 */\n\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n\n  if (Array.isArray(array)) {\n    var next = dim + 1;\n\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _unsqueeze(array[i], dims, next);\n    }\n  } else {\n    for (var d = dim; d < dims; d++) {\n      array = [array];\n    }\n  }\n\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 */\n\n\nexport function flatten(array) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\n  }\n\n  var flat = [];\n  array.forEach(function callback(value) {\n    if (Array.isArray(value)) {\n      value.forEach(callback); // traverse through sub-arrays recursively\n    } else {\n      flat.push(value);\n    }\n  });\n  return flat;\n}\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\n\nexport function map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\n\nexport function forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\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 * 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 */\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 * A safe join\n * @param {Array} array\n * @param {string} separator\n */\n\nexport function join(array, separator) {\n  return Array.prototype.join.call(array, separator);\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 */\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  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\n  };\n\n  for (var i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++;\n    } else {\n      count = 0;\n    }\n\n    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n\n  return b;\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 */\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  var b = [];\n\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n\n  return b;\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 */\n\nexport function getArrayDataType(array, typeOf) {\n  var type; // to hold type info\n\n  var length = 0; // to hold length value to ensure it has consistent sizes\n\n  for (var i = 0; i < array.length; i++) {\n    var item = array[i];\n    var isArray = Array.isArray(item); // Saving the target matrix row size\n\n    if (i === 0 && isArray) {\n      length = item.length;\n    } // If the current item is an array but the length does not equal the targetVectorSize\n\n\n    if (isArray && item.length !== length) {\n      return undefined;\n    }\n\n    var itemType = isArray ? 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 {// we're good, everything has the same type so far\n    }\n  }\n\n  return type;\n}\n/**\n * Return the last item from an array\n * @param array\n * @returns {*}\n */\n\nexport function last(array) {\n  return array[array.length - 1];\n}\n/**\n * Get all but the last element of array.\n */\n\nexport function initial(array) {\n  return array.slice(0, array.length - 1);\n}\n/**\n * Test whether an array or string contains an item\n * @param {Array | string} array\n * @param {*} item\n * @return {boolean}\n */\n\nexport function contains(array, item) {\n  return array.indexOf(item) !== -1;\n}","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize } from './array.js';\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 */\n\nexport function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true;\n    }\n  }\n\n  return false;\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 */\n\nexport function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array = array.valueOf();\n  }\n\n  for (var i = 0, ii = array.length; i < ii; i++) {\n    var value = array[i];\n\n    if (Array.isArray(value)) {\n      deepForEach(value, callback);\n    } else {\n      callback(value);\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 */\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 * 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 */\n\nexport function reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n\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 * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\n\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n\n      return val;\n    } else {\n      tran = _switch(mat);\n      ret = [];\n\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n\n      return ret;\n    }\n  } else {\n    ret = [];\n\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n\n    return ret;\n  }\n}\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n\n    ret.push(tmp);\n  }\n\n  return ret;\n} // TODO: document function scatter\n\n\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr; // vars\n\n  var k, k0, k1, i; // check we need to process values (pattern matrix)\n\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]; // check value exists in current j\n\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark; // add i to pattern of C\n\n        cindex.push(i); // x(i) = A, check we need to call function this time\n\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]); // function was called on current row\n\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]); // function was called on current row\n\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]; // check value exists in current j\n\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark; // add i to pattern of C\n\n        cindex.push(i);\n      } else {\n        // indicate function was called on current row\n        u[i] = mark;\n      }\n    }\n  }\n}","import { hasOwnProperty } from './object.js';\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 */\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 * 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?\n\n\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/**\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 */\n\n\nfunction isSafeProperty(object, prop) {\n  if (!object || typeof object !== 'object') {\n    return false;\n  } // SAFE: whitelisted\n  // e.g length\n\n\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true;\n  } // UNSAFE: inherited from Object prototype\n  // e.g constructor\n\n\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  } // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n\n\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\n  return true;\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?\n\n\nfunction validateSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\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 */\n\n\nfunction isSafeMethod(object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false;\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\n\n  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  } // SAFE: whitelisted\n  // e.g toString\n\n\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true;\n  } // UNSAFE: inherited from Object prototype\n  // e.g constructor\n\n\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  } // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n\n\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\n  return true;\n}\n\nfunction isPlainObject(object) {\n  return typeof object === 'object' && object && object.constructor === Object;\n}\n\nvar safeNativeProperties = {\n  length: true,\n  name: true\n};\nvar safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { validateSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { contains } from './array.js';\nimport { pickShallow } from './object.js';\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 */\n\nexport function factory(name, dependencies, create, meta) {\n  function assertAndCreate(scope) {\n    // we only pass the requested dependencies to the factory function\n    // to prevent functions to rely on dependencies that are not explicitly\n    // requested.\n    var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n    assertDependencies(name, dependencies, scope);\n    return create(deps);\n  }\n\n  assertAndCreate.isFactory = true;\n  assertAndCreate.fn = name;\n  assertAndCreate.dependencies = dependencies.slice().sort();\n\n  if (meta) {\n    assertAndCreate.meta = meta;\n  }\n\n  return assertAndCreate;\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 */\n\nexport function sortFactories(factories) {\n  var factoriesByName = {};\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  var sorted = [];\n\n  function addFactory(factory) {\n    var index = 0;\n\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++;\n    }\n\n    sorted.splice(index, 0, factory);\n  } // sort regular factory functions\n\n\n  factories.filter(isFactory).forEach(addFactory); // sort legacy factory functions AFTER the regular factory functions\n\n  factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n  return sorted;\n} // TODO: comment or cleanup if unused in the end\n\nexport function create(factories) {\n  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  sortFactories(factories).forEach(factory => factory(scope));\n  return scope;\n}\n/**\n * 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 */\n\nexport function isFactory(obj) {\n  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\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 */\n\nexport function assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n  .every(dependency => scope[dependency] !== undefined);\n\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined); // TODO: create a custom error class for this, a MathjsError or something like that\n\n    throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n  }\n}\nexport function isOptionalDependency(dependency) {\n  return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","// (c) 2018, Mariusz Nowak\n// SPDX-License-Identifier: ISC\n// Derived from https://github.com/medikoo/lru-queue\nexport function lruQueue(limit) {\n  var size = 0;\n  var base = 1;\n  var queue = Object.create(null);\n  var map = Object.create(null);\n  var index = 0;\n\n  var del = function del(id) {\n    var oldIndex = map[id];\n    if (!oldIndex) return;\n    delete queue[oldIndex];\n    delete map[id];\n    --size;\n    if (base !== oldIndex) return;\n\n    if (!size) {\n      index = 0;\n      base = 1;\n      return;\n    }\n\n    while (!hasOwnProperty.call(queue, ++base)) {\n      continue;\n    }\n  };\n\n  limit = Math.abs(limit);\n  return {\n    hit: function hit(id) {\n      var oldIndex = map[id];\n      var nuIndex = ++index;\n      queue[nuIndex] = id;\n      map[id] = nuIndex;\n\n      if (!oldIndex) {\n        ++size;\n        if (size <= limit) return undefined;\n        id = queue[base];\n        del(id);\n        return id;\n      }\n\n      delete queue[oldIndex];\n      if (base !== oldIndex) return undefined;\n\n      while (!hasOwnProperty.call(queue, ++base)) {\n        continue;\n      }\n\n      return undefined;\n    },\n    delete: del,\n    clear: function clear() {\n      size = index = 0;\n      base = 1;\n      queue = Object.create(null);\n      map = Object.create(null);\n    }\n  };\n}\n;","// function utils\nimport { lruQueue } from './lruQueue.js';\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 */\n\nexport function memoize(fn) {\n  var {\n    hasher,\n    limit\n  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n  hasher = hasher == null ? JSON.stringify : hasher;\n  return function memoize() {\n    if (typeof memoize.cache !== 'object') {\n      memoize.cache = {\n        values: new Map(),\n        lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n      };\n    }\n\n    var args = [];\n\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    var 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    var newVal = fn.apply(fn, args);\n    memoize.cache.values.set(hash, newVal);\n    memoize.cache.values.delete(memoize.cache.lru.hit(hash));\n    return newVal;\n  };\n}\n/**\n * 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 */\n\nexport function memoizeCompare(fn, isEqual) {\n  var memoize = function memoize() {\n    var args = [];\n\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    for (var c = 0; c < memoize.cache.length; c++) {\n      var 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    var res = fn.apply(fn, args);\n    memoize.cache.unshift({\n      args,\n      res\n    });\n    return res;\n  };\n\n  memoize.cache = [];\n  return memoize;\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 */\n\nexport function maxArgumentCount(fn) {\n  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {\n    var count = (signature.match(/,/g) || []).length + 1;\n    return Math.max(args, count);\n  }, -1);\n}","// 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.\nexport function isNumber(x) {\n  return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n  return x && x.constructor.prototype.isBigNumber === true || false;\n}\nexport function isComplex(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n  return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n  return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n  return x && x.constructor.prototype.isMatrix === true || false;\n}\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\n\nexport function isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n  return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n  return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n  return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n  return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n  return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n  return typeof x === 'function';\n}\nexport function isDate(x) {\n  return x instanceof Date;\n}\nexport function isRegExp(x) {\n  return x instanceof RegExp;\n}\nexport function isObject(x) {\n  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\nexport function isNull(x) {\n  return x === null;\n}\nexport function isUndefined(x) {\n  return x === undefined;\n}\nexport function isAccessorNode(x) {\n  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionAssignmentNode(x) {\n  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n  return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n  var t = typeof x;\n\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'; // math.js types\n\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    return 'Object';\n  }\n\n  if (t === 'function') return 'Function';\n  return t; // can be 'string', 'number', 'boolean', ...\n}","export function noBignumber() {\n  throw new Error('No \"bignumber\" implementation available');\n}\nexport function noFraction() {\n  throw new Error('No \"fraction\" implementation available');\n}\nexport function noMatrix() {\n  throw new Error('No \"matrix\" implementation available');\n}\nexport function noIndex() {\n  throw new Error('No \"index\" implementation available');\n}\nexport function noSubset() {\n  throw new Error('No \"matrix\" implementation available');\n}","import { isNumber } from './is.js';\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 */\n\nexport function isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n\n  return isFinite(value) ? value === Math.round(value) : false;\n}\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var sign = /* #__PURE__ */Math.sign || function (x) {\n  if (x > 0) {\n    return 1;\n  } else if (x < 0) {\n    return -1;\n  } else {\n    return 0;\n  }\n};\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var log2 = /* #__PURE__ */Math.log2 || function log2(x) {\n  return Math.log(x) / Math.LN2;\n};\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var log10 = /* #__PURE__ */Math.log10 || function log10(x) {\n  return Math.log(x) / Math.LN10;\n};\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\n\nexport var log1p = /* #__PURE__ */Math.log1p || function (x) {\n  return Math.log(x + 1);\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 */\n\nexport var cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {\n  if (x === 0) {\n    return x;\n  }\n\n  var negate = x < 0;\n  var result;\n\n  if (negate) {\n    x = -x;\n  }\n\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3); // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n\n  return negate ? -result : result;\n};\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\n\nexport var expm1 = /* #__PURE__ */Math.expm1 || function expm1(x) {\n  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\n\nfunction formatNumberToBase(n, base, size) {\n  var prefixes = {\n    2: '0b',\n    8: '0o',\n    16: '0x'\n  };\n  var prefix = prefixes[base];\n  var suffix = '';\n\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n\n    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n\n    if (!isInteger(n)) {\n      throw new Error('Value must be an integer');\n    }\n\n    if (n < 0) {\n      n = n + 2 ** size;\n    }\n\n    suffix = \"i\".concat(size);\n  }\n\n  var sign = '';\n\n  if (n < 0) {\n    n = -n;\n    sign = '-';\n  }\n\n  return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\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 */\n\n\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  } // handle special cases\n\n\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  } // default values for options\n\n\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n\n  if (options) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    } // determine precision from options\n\n\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\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  } // handle the various notations\n\n\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).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n/**\n * 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 */\n\nexport function splitNumber(value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^0*?(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\n  }\n\n  var sign = match[1];\n  var digits = match[2];\n  var exponent = parseFloat(match[4] || '0');\n  var dot = digits.indexOf('.');\n  exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n  .replace(/^0*/, function (zeros) {\n    // remove leading zeros, add their count to the exponent\n    exponent -= zeros.length;\n    return '';\n  }).replace(/0*$/, '') // remove trailing zeros\n  .split('').map(function (d) {\n    return parseInt(d);\n  });\n\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 * 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 */\n\nexport function toEngineering(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  var split = splitNumber(value);\n  var rounded = roundDigits(split, precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients; // find nearest lower multiple of 3 for exponent\n\n  var 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    var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n\n    for (var i = 0; i < missingZeros; i++) {\n      c.push(0);\n    }\n  } // find difference in exponents\n\n\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1; // push decimal index over by expDiff times\n\n  while (expDiff > 0) {\n    decimalIdx++;\n    expDiff--;\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\n\n  var decimals = c.slice(decimalIdx).join('');\n  var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n  return rounded.sign + str;\n}\n/**\n * 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 */\n\nexport function toFixed(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  var splitValue = splitNumber(value);\n  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n  var c = rounded.coefficients;\n  var p = rounded.exponent + 1; // exponent may have changed\n  // append zeros if needed\n\n  var pp = p + (precision || 0);\n\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  } // prepend zeros if needed\n\n\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  } // insert a dot if needed\n\n\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n\n  return rounded.sign + c.join('');\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 */\n\nexport function toExponential(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  } // round if needed, else create a clone\n\n\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent; // append zeros if needed\n\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  } // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n\n\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\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 */\n\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  } // determine lower and upper bound for exponential notation.\n\n\n  var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n  var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n\n  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n    // exponential notation\n    return toExponential(value, precision);\n  } else {\n    var c = rounded.coefficients;\n    var e = rounded.exponent; // append trailing zeros\n\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    } // append trailing zeros\n    // TODO: simplify the next statement\n\n\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0))); // prepend zeros\n\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n\n    return rounded.sign + c.join('');\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 */\n\nexport function roundDigits(split, precision) {\n  // create a clone\n  var rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  };\n  var c = rounded.coefficients; // prepend zeros if needed\n\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n\n      while (c[i] === 10) {\n        c.pop();\n\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n\n        i--;\n        c[i]++;\n      }\n    }\n  }\n\n  return rounded;\n}\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\n\nfunction zeros(length) {\n  var arr = [];\n\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n\n  return arr;\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 */\n\n\nexport function digits(value) {\n  return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n  .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n  .length;\n}\n/**\n * Minimum number added to one that makes the result different than one\n */\n\nexport var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\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*/\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  } // NaN\n\n\n  if (isNaN(x) || isNaN(y)) {\n    return false;\n  } // at this point x and y should be finite\n\n\n  if (isFinite(x) && isFinite(y)) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = Math.abs(x - y);\n\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  } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n  return false;\n}\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\n\nexport var acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n  return Math.log(Math.sqrt(x * x + 1) + x);\n};\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\n\nexport var atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};","import { isBigNumber } from './is.js';\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 */\n\nexport function clone(x) {\n  var type = typeof x; // immutable primitive types\n\n  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  } // use clone function of the object when available\n\n\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  } // array\n\n\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\n  if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp\n  // object\n\n  return mapObject(x, clone);\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 */\n\nexport function mapObject(object, callback) {\n  var clone = {};\n\n  for (var key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n\n  return clone;\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 */\n\nexport function extend(a, b) {\n  for (var prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n\n  return a;\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 */\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 (var prop in b) {\n    // We check against prop not being in Object.prototype or Function.prototype\n    // to prevent polluting for example Object.__proto__.\n    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {};\n        }\n\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\n  return a;\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 */\n\nexport function deepStrictEqual(a, b) {\n  var prop, i, len;\n\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\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\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a) || !deepStrictEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n\n    return true;\n  } else {\n    return a === b;\n  }\n}\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\n\nexport function deepFlatten(nestedObject) {\n  var flattenedObject = {};\n\n  _deepFlatten(nestedObject, flattenedObject);\n\n  return flattenedObject;\n} // helper function used by deepFlatten\n\nfunction _deepFlatten(nestedObject, flattenedObject) {\n  for (var prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      var value = nestedObject[prop];\n\n      if (typeof value === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject);\n      } else {\n        flattenedObject[prop] = value;\n      }\n    }\n  }\n}\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\n\n\nexport function canDefineProperty() {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', {\n        get: function get() {}\n      });\n      return true;\n    }\n  } catch (e) {}\n\n  return false;\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 */\n\nexport function lazy(object, prop, valueResolver) {\n  var _uninitialized = true;\n\n  var _value;\n\n  Object.defineProperty(object, prop, {\n    get: function get() {\n      if (_uninitialized) {\n        _value = valueResolver();\n        _uninitialized = false;\n      }\n\n      return _value;\n    },\n    set: function set(value) {\n      _value = value;\n      _uninitialized = false;\n    },\n    configurable: true,\n    enumerable: true\n  });\n}\n/**\n * 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 */\n\nexport function traverse(object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'));\n  }\n\n  var obj = object;\n\n  if (path) {\n    for (var i = 0; i < path.length; i++) {\n      var key = path[i];\n\n      if (!(key in obj)) {\n        obj[key] = {};\n      }\n\n      obj = obj[key];\n    }\n  }\n\n  return obj;\n}\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\n\nexport function hasOwnProperty(object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\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 */\n\nexport function isLegacyFactory(object) {\n  return object && typeof object.factory === 'function';\n}\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\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  var child = object;\n\n  for (var i = 0; i < path.length; i++) {\n    var key = path[i];\n    child = child ? child[key] : undefined;\n  }\n\n  return child;\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 */\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  var child = object;\n\n  for (var i = 0; i < path.length - 1; i++) {\n    var key = path[i];\n\n    if (child[key] === undefined) {\n      child[key] = {};\n    }\n\n    child = child[key];\n  }\n\n  if (path.length > 0) {\n    var lastKey = path[path.length - 1];\n    child[lastKey] = value;\n  }\n\n  return object;\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 */\n\nexport function pick(object, properties, transform) {\n  var copy = {};\n\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = get(object, key);\n\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value);\n    }\n  }\n\n  return copy;\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 */\n\nexport function pickShallow(object, properties) {\n  var copy = {};\n\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = object[key];\n\n    if (value !== undefined) {\n      copy[key] = value;\n    }\n  }\n\n  return copy;\n}\nexport function values(object) {\n  return Object.keys(object).map(key => object[key]);\n} // helper function to test whether a string contains a path like 'user.name'\n\nfunction isPath(str) {\n  return str.indexOf('.') !== -1;\n}","import { isInteger } from '../number.js';\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 */\n\nfunction formatBigNumberToBase(n, base, size) {\n  var BigNumberCtor = n.constructor;\n  var big2 = new BigNumberCtor(2);\n  var suffix = '';\n\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n\n    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n\n    if (!n.isInteger()) {\n      throw new Error('Value must be an integer');\n    }\n\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size));\n    }\n\n    suffix = \"i\".concat(size);\n  }\n\n  switch (base) {\n    case 2:\n      return \"\".concat(n.toBinary()).concat(suffix);\n\n    case 8:\n      return \"\".concat(n.toOctal()).concat(suffix);\n\n    case 16:\n      return \"\".concat(n.toHexadecimal()).concat(suffix);\n\n    default:\n      throw new Error(\"Base \".concat(base, \" not supported \"));\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 */\n\n\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  } // handle special cases\n\n\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  } // default values for options\n\n\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n\n  if (options !== undefined) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    } // determine precision from options\n\n\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\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  } // handle the various notations\n\n\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        var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n        var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5; // handle special case zero\n\n        if (value.isZero()) return '0'; // determine whether or not to output exponential notation\n\n        var str;\n        var rounded = value.toSignificantDigits(precision);\n        var exp = rounded.e;\n\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        } // remove trailing zeros after the decimal point\n\n\n        return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n          var digits = arguments[2];\n          var e = arguments[4];\n          return digits !== '.' ? digits + e : e;\n        });\n      }\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\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 */\n\nexport function toEngineering(value, precision) {\n  // find nearest lower multiple of 3 for exponent\n  var e = value.e;\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3; // find difference in exponents, and calculate the value without exponent\n\n  var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n  var valueStr = valueWithoutExp.toPrecision(precision);\n\n  if (valueStr.indexOf('e') !== -1) {\n    valueStr = valueWithoutExp.toString();\n  }\n\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\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 */\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 * 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 */\n\nexport function toFixed(value, precision) {\n  return value.toFixed(precision);\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\n\nexport function endsWith(text, search) {\n  var start = text.length - search.length;\n  var end = text.length;\n  return text.substring(start, end) === search;\n}\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\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]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @return {string} str\n */\n\nexport function 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  } // 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\n\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      var entries = Object.keys(value).map(key => {\n        return '\"' + key + '\": ' + format(value[key], options);\n      });\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n\n  return String(value);\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 */\n\nexport function stringify(value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n\n  while (i < text.length) {\n    var c = text.charAt(i);\n\n    if (c === '\\\\') {\n      escaped += c;\n      i++;\n      c = text.charAt(i);\n\n      if (c === '' || '\"\\\\/bfnrtu'.indexOf(c) === -1) {\n        escaped += '\\\\'; // no valid escape character -> escape it\n      }\n\n      escaped += c;\n    } else if (c === '\"') {\n      escaped += '\\\\\"';\n    } else {\n      escaped += c;\n    }\n\n    i++;\n  }\n\n  return '\"' + escaped + '\"';\n}\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\n\nexport function escape(value) {\n  var text = String(value);\n  text = text.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');\n  return text;\n}\n/**\n * 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 */\n\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n\n      str += formatArray(array[i], options);\n    }\n\n    str += ']';\n    return str;\n  } else {\n    return format(array, options);\n  }\n}\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\n\n\nfunction looksLikeFraction(value) {\n  return value && typeof value === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;\n}\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\n\n\nexport function compareText(x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!isString(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n  }\n\n  if (!isString(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n  }\n\n  return x === y ? 0 : x > y ? 1 : -1;\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","// 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 \"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","// 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 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 \"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 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","/*\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","/**\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        throw createError(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     * 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.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","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","__webpack_require__.amdD = function () {\n\tthrow new Error('define cannot be used indirect');\n};","__webpack_require__.amdO = {};","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","// startup\n// Load entry module and return exports\n// This entry module is referenced by other modules so it can't be inlined\nvar __webpack_exports__ = __webpack_require__(6323);\n"],"sourceRoot":""}
\ No newline at end of file
diff --git a/package-lock.json b/package-lock.json
old mode 100755
new mode 100644
index d7eff591..6b15e736
--- a/package-lock.json
+++ b/package-lock.json
@@ -1,16213 +1,9046 @@
 {
-    "name": "@spcl/sdfv",
-    "version": "1.0.1",
-    "lockfileVersion": 2,
-    "requires": true,
-    "packages": {
-        "": {
-            "name": "@spcl/sdfv",
-            "version": "1.0.1",
-            "license": "BSD-3-Clause",
-            "dependencies": {
-                "@babel/runtime": "^7.13.10",
-                "@types/mathjs": "^6.0.11",
-                "dagre": "^0.8.5",
-                "jquery": "^3.6.0",
-                "mathjs": "^9.3.0"
-            },
-            "devDependencies": {
-                "@babel/cli": "^7.13.10",
-                "@babel/core": "^7.13.10",
-                "@babel/plugin-transform-runtime": "^7.13.10",
-                "@babel/preset-env": "^7.13.10",
-                "@babel/preset-typescript": "^7.13.0",
-                "@types/dagre": "^0.7.44",
-                "@types/jquery": "^3.5.5",
-                "@typescript-eslint/eslint-plugin": "^4.18.0",
-                "@typescript-eslint/parser": "^4.18.0",
-                "babel-loader": "^8.2.2",
-                "eslint": "^7.22.0",
-                "rimraf": "^3.0.2",
-                "typescript": "^4.2.3",
-                "webpack": "^5.26.3",
-                "webpack-cli": "^4.5.0",
-                "webpack-dev-server": "^3.11.2"
-            }
-        },
-        "node_modules/@babel/cli": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.13.10.tgz",
-            "integrity": "sha512-lYSBC7B4B9hJ7sv0Ojx1BrGhuzCoOIYfLjd+Xpd4rOzdS+a47yi8voV8vFkfjlZR1N5qZO7ixOCbobUdT304PQ==",
-            "dev": true,
-            "dependencies": {
-                "commander": "^4.0.1",
-                "convert-source-map": "^1.1.0",
-                "fs-readdir-recursive": "^1.1.0",
-                "glob": "^7.0.0",
-                "lodash": "^4.17.19",
-                "make-dir": "^2.1.0",
-                "slash": "^2.0.0",
-                "source-map": "^0.5.0"
-            },
-            "bin": {
-                "babel": "bin/babel.js",
-                "babel-external-helpers": "bin/babel-external-helpers.js"
-            },
-            "optionalDependencies": {
-                "@nicolo-ribaudo/chokidar-2": "2.1.8-no-fsevents",
-                "chokidar": "^3.4.0"
-            }
-        },
-        "node_modules/@babel/cli/node_modules/commander": {
-            "version": "4.1.1",
-            "resolved": "https://registry.npmjs.org/commander/-/commander-4.1.1.tgz",
-            "integrity": "sha512-NOKm8xhkzAjzFx8B2v5OAHT+u5pRQc2UCa2Vq9jYL/31o2wi9mxBA7LIFs3sV5VSC49z6pEhfbMULvShKj26WA==",
-            "dev": true,
-            "engines": {
-                "node": ">= 6"
-            }
-        },
-        "node_modules/@babel/cli/node_modules/slash": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/slash/-/slash-2.0.0.tgz",
-            "integrity": "sha512-ZYKh3Wh2z1PpEXWr0MpSBZ0V6mZHAQfYevttO11c51CaWjGTaadiKZ+wVt1PbMlDV5qhMFslpZCemhwOK7C89A==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/@babel/cli/node_modules/source-map": {
-            "version": "0.5.7",
-            "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-            "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@babel/code-frame": {
-            "version": "7.12.11",
-            "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.11.tgz",
-            "integrity": "sha512-Zt1yodBx1UcyiePMSkWnU4hPqhwq7hGi2nFL1LeA3EUl+q2LQx16MISgJ0+z7dnmgvP9QtIleuETGOiOH1RcIw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/highlight": "^7.10.4"
-            }
-        },
-        "node_modules/@babel/compat-data": {
-            "version": "7.13.11",
-            "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.13.11.tgz",
-            "integrity": "sha512-BwKEkO+2a67DcFeS3RLl0Z3Gs2OvdXewuWjc1Hfokhb5eQWP9YRYH1/+VrVZvql2CfjOiNGqSAFOYt4lsqTHzg==",
-            "dev": true
-        },
-        "node_modules/@babel/core": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.13.10.tgz",
-            "integrity": "sha512-bfIYcT0BdKeAZrovpMqX2Mx5NrgAckGbwT982AkdS5GNfn3KMGiprlBAtmBcFZRUmpaufS6WZFP8trvx8ptFDw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/code-frame": "^7.12.13",
-                "@babel/generator": "^7.13.9",
-                "@babel/helper-compilation-targets": "^7.13.10",
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helpers": "^7.13.10",
-                "@babel/parser": "^7.13.10",
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0",
-                "convert-source-map": "^1.7.0",
-                "debug": "^4.1.0",
-                "gensync": "^1.0.0-beta.2",
-                "json5": "^2.1.2",
-                "lodash": "^4.17.19",
-                "semver": "^6.3.0",
-                "source-map": "^0.5.0"
-            },
-            "engines": {
-                "node": ">=6.9.0"
-            }
-        },
-        "node_modules/@babel/core/node_modules/@babel/code-frame": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
-            "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
-            "dev": true,
-            "dependencies": {
-                "@babel/highlight": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/core/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/@babel/core/node_modules/source-map": {
-            "version": "0.5.7",
-            "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-            "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@babel/generator": {
-            "version": "7.13.9",
-            "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.13.9.tgz",
-            "integrity": "sha512-mHOOmY0Axl/JCTkxTU6Lf5sWOg/v8nUa+Xkt4zMTftX0wqmb6Sh7J8gvcehBw7q0AhrhAR+FDacKjCZ2X8K+Sw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.13.0",
-                "jsesc": "^2.5.1",
-                "source-map": "^0.5.0"
-            }
-        },
-        "node_modules/@babel/generator/node_modules/source-map": {
-            "version": "0.5.7",
-            "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-            "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@babel/helper-annotate-as-pure": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-annotate-as-pure/-/helper-annotate-as-pure-7.12.13.tgz",
-            "integrity": "sha512-7YXfX5wQ5aYM/BOlbSccHDbuXXFPxeoUmfWtz8le2yTkTZc+BxsiEnENFoi2SlmA8ewDkG2LgIMIVzzn2h8kfw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-builder-binary-assignment-operator-visitor": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-builder-binary-assignment-operator-visitor/-/helper-builder-binary-assignment-operator-visitor-7.12.13.tgz",
-            "integrity": "sha512-CZOv9tGphhDRlVjVkAgm8Nhklm9RzSmWpX2my+t7Ua/KT616pEzXsQCjinzvkRvHWJ9itO4f296efroX23XCMA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-explode-assignable-expression": "^7.12.13",
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-compilation-targets": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/helper-compilation-targets/-/helper-compilation-targets-7.13.10.tgz",
-            "integrity": "sha512-/Xju7Qg1GQO4mHZ/Kcs6Au7gfafgZnwm+a7sy/ow/tV1sHeraRUHbjdat8/UvDor4Tez+siGKDk6zIKtCPKVJA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/compat-data": "^7.13.8",
-                "@babel/helper-validator-option": "^7.12.17",
-                "browserslist": "^4.14.5",
-                "semver": "^6.3.0"
-            }
-        },
-        "node_modules/@babel/helper-compilation-targets/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/@babel/helper-create-class-features-plugin": {
-            "version": "7.13.11",
-            "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.13.11.tgz",
-            "integrity": "sha512-ays0I7XYq9xbjCSvT+EvysLgfc3tOkwCULHjrnscGT3A9qD4sk3wXnJ3of0MAWsWGjdinFvajHU2smYuqXKMrw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-member-expression-to-functions": "^7.13.0",
-                "@babel/helper-optimise-call-expression": "^7.12.13",
-                "@babel/helper-replace-supers": "^7.13.0",
-                "@babel/helper-split-export-declaration": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-create-regexp-features-plugin": {
-            "version": "7.12.17",
-            "resolved": "https://registry.npmjs.org/@babel/helper-create-regexp-features-plugin/-/helper-create-regexp-features-plugin-7.12.17.tgz",
-            "integrity": "sha512-p2VGmBu9oefLZ2nQpgnEnG0ZlRPvL8gAGvPUMQwUdaE8k49rOMuZpOwdQoy5qJf6K8jL3bcAMhVUlHAjIgJHUg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-annotate-as-pure": "^7.12.13",
-                "regexpu-core": "^4.7.1"
-            }
-        },
-        "node_modules/@babel/helper-define-polyfill-provider": {
-            "version": "0.1.5",
-            "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.1.5.tgz",
-            "integrity": "sha512-nXuzCSwlJ/WKr8qxzW816gwyT6VZgiJG17zR40fou70yfAcqjoNyTLl/DQ+FExw5Hx5KNqshmN8Ldl/r2N7cTg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-compilation-targets": "^7.13.0",
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/traverse": "^7.13.0",
-                "debug": "^4.1.1",
-                "lodash.debounce": "^4.0.8",
-                "resolve": "^1.14.2",
-                "semver": "^6.1.2"
-            }
-        },
-        "node_modules/@babel/helper-define-polyfill-provider/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/@babel/helper-explode-assignable-expression": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-explode-assignable-expression/-/helper-explode-assignable-expression-7.13.0.tgz",
-            "integrity": "sha512-qS0peLTDP8kOisG1blKbaoBg/o9OSa1qoumMjTK5pM+KDTtpxpsiubnCGP34vK8BXGcb2M9eigwgvoJryrzwWA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/helper-function-name": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-function-name/-/helper-function-name-7.12.13.tgz",
-            "integrity": "sha512-TZvmPn0UOqmvi5G4vvw0qZTpVptGkB1GL61R6lKvrSdIxGm5Pky7Q3fpKiIkQCAtRCBUwB0PaThlx9vebCDSwA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-get-function-arity": "^7.12.13",
-                "@babel/template": "^7.12.13",
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-get-function-arity": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-get-function-arity/-/helper-get-function-arity-7.12.13.tgz",
-            "integrity": "sha512-DjEVzQNz5LICkzN0REdpD5prGoidvbdYk1BVgRUOINaWJP2t6avB27X1guXK1kXNrX0WMfsrm1A/ZBthYuIMQg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-hoist-variables": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-hoist-variables/-/helper-hoist-variables-7.13.0.tgz",
-            "integrity": "sha512-0kBzvXiIKfsCA0y6cFEIJf4OdzfpRuNk4+YTeHZpGGc666SATFKTz6sRncwFnQk7/ugJ4dSrCj6iJuvW4Qwr2g==",
-            "dev": true,
-            "dependencies": {
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/helper-member-expression-to-functions": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.13.0.tgz",
-            "integrity": "sha512-yvRf8Ivk62JwisqV1rFRMxiSMDGnN6KH1/mDMmIrij4jztpQNRoHqqMG3U6apYbGRPJpgPalhva9Yd06HlUxJQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/helper-module-imports": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.12.13.tgz",
-            "integrity": "sha512-NGmfvRp9Rqxy0uHSSVP+SRIW1q31a7Ji10cLBcqSDUngGentY4FRiHOFZFE1CLU5eiL0oE8reH7Tg1y99TDM/g==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-module-transforms": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.13.0.tgz",
-            "integrity": "sha512-Ls8/VBwH577+pw7Ku1QkUWIyRRNHpYlts7+qSqBBFCW3I8QteB9DxfcZ5YJpOwH6Ihe/wn8ch7fMGOP1OhEIvw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-replace-supers": "^7.13.0",
-                "@babel/helper-simple-access": "^7.12.13",
-                "@babel/helper-split-export-declaration": "^7.12.13",
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0",
-                "lodash": "^4.17.19"
-            }
-        },
-        "node_modules/@babel/helper-optimise-call-expression": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-optimise-call-expression/-/helper-optimise-call-expression-7.12.13.tgz",
-            "integrity": "sha512-BdWQhoVJkp6nVjB7nkFWcn43dkprYauqtk++Py2eaf/GRDFm5BxRqEIZCiHlZUGAVmtwKcsVL1dC68WmzeFmiA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-plugin-utils": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.13.0.tgz",
-            "integrity": "sha512-ZPafIPSwzUlAoWT8DKs1W2VyF2gOWthGd5NGFMsBcMMol+ZhK+EQY/e6V96poa6PA/Bh+C9plWN0hXO1uB8AfQ==",
-            "dev": true
-        },
-        "node_modules/@babel/helper-remap-async-to-generator": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-remap-async-to-generator/-/helper-remap-async-to-generator-7.13.0.tgz",
-            "integrity": "sha512-pUQpFBE9JvC9lrQbpX0TmeNIy5s7GnZjna2lhhcHC7DzgBs6fWn722Y5cfwgrtrqc7NAJwMvOa0mKhq6XaE4jg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-annotate-as-pure": "^7.12.13",
-                "@babel/helper-wrap-function": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/helper-replace-supers": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.13.0.tgz",
-            "integrity": "sha512-Segd5me1+Pz+rmN/NFBOplMbZG3SqRJOBlY+mA0SxAv6rjj7zJqr1AVr3SfzUVTLCv7ZLU5FycOM/SBGuLPbZw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-member-expression-to-functions": "^7.13.0",
-                "@babel/helper-optimise-call-expression": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/helper-simple-access": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.12.13.tgz",
-            "integrity": "sha512-0ski5dyYIHEfwpWGx5GPWhH35j342JaflmCeQmsPWcrOQDtCN6C1zKAVRFVbK53lPW2c9TsuLLSUDf0tIGJ5hA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-skip-transparent-expression-wrappers": {
-            "version": "7.12.1",
-            "resolved": "https://registry.npmjs.org/@babel/helper-skip-transparent-expression-wrappers/-/helper-skip-transparent-expression-wrappers-7.12.1.tgz",
-            "integrity": "sha512-Mf5AUuhG1/OCChOJ/HcADmvcHM42WJockombn8ATJG3OnyiSxBK/Mm5x78BQWvmtXZKHgbjdGL2kin/HOLlZGA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.12.1"
-            }
-        },
-        "node_modules/@babel/helper-split-export-declaration": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.12.13.tgz",
-            "integrity": "sha512-tCJDltF83htUtXx5NLcaDqRmknv652ZWCHyoTETf1CXYJdPC7nohZohjUgieXhv0hTJdRf2FjDueFehdNucpzg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/helper-validator-identifier": {
-            "version": "7.12.11",
-            "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.12.11.tgz",
-            "integrity": "sha512-np/lG3uARFybkoHokJUmf1QfEvRVCPbmQeUQpKow5cQ3xWrV9i3rUHodKDJPQfTVX61qKi+UdYk8kik84n7XOw==",
-            "dev": true
-        },
-        "node_modules/@babel/helper-validator-option": {
-            "version": "7.12.17",
-            "resolved": "https://registry.npmjs.org/@babel/helper-validator-option/-/helper-validator-option-7.12.17.tgz",
-            "integrity": "sha512-TopkMDmLzq8ngChwRlyjR6raKD6gMSae4JdYDB8bByKreQgG0RBTuKe9LRxW3wFtUnjxOPRKBDwEH6Mg5KeDfw==",
-            "dev": true
-        },
-        "node_modules/@babel/helper-wrap-function": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.13.0.tgz",
-            "integrity": "sha512-1UX9F7K3BS42fI6qd2A4BjKzgGjToscyZTdp1DjknHLCIvpgne6918io+aL5LXFcER/8QWiwpoY902pVEqgTXA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/helpers": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.13.10.tgz",
-            "integrity": "sha512-4VO883+MWPDUVRF3PhiLBUFHoX/bsLTGFpFK/HqvvfBZz2D57u9XzPVNFVBTc0PW/CWR9BXTOKt8NF4DInUHcQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/highlight": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.13.10.tgz",
-            "integrity": "sha512-5aPpe5XQPzflQrFwL1/QoeHkP2MsA4JCntcXHRhEsdsfPVkvPi2w7Qix4iV7t5S/oC9OodGrggd8aco1g3SZFg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "chalk": "^2.0.0",
-                "js-tokens": "^4.0.0"
-            }
-        },
-        "node_modules/@babel/highlight/node_modules/ansi-styles": {
-            "version": "3.2.1",
-            "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz",
-            "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
-            "dev": true,
-            "dependencies": {
-                "color-convert": "^1.9.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/@babel/highlight/node_modules/chalk": {
-            "version": "2.4.2",
-            "resolved": "https://registry.npmjs.org/chalk/-/chalk-2.4.2.tgz",
-            "integrity": "sha512-Mti+f9lpJNcwF4tWV8/OrTTtF1gZi+f8FqlyAdouralcFWFQWF2+NgCHShjkCb+IFBLq9buZwE1xckQU4peSuQ==",
-            "dev": true,
-            "dependencies": {
-                "ansi-styles": "^3.2.1",
-                "escape-string-regexp": "^1.0.5",
-                "supports-color": "^5.3.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/@babel/highlight/node_modules/color-convert": {
-            "version": "1.9.3",
-            "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz",
-            "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
-            "dev": true,
-            "dependencies": {
-                "color-name": "1.1.3"
-            }
-        },
-        "node_modules/@babel/highlight/node_modules/color-name": {
-            "version": "1.1.3",
-            "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz",
-            "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=",
-            "dev": true
-        },
-        "node_modules/@babel/highlight/node_modules/has-flag": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-3.0.0.tgz",
-            "integrity": "sha1-tdRU3CGZriJWmfNGfloH87lVuv0=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/@babel/highlight/node_modules/supports-color": {
-            "version": "5.5.0",
-            "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-5.5.0.tgz",
-            "integrity": "sha512-QjVjwdXIt408MIiAqCX4oUKsgU2EqAGzs2Ppkm4aQYbjm+ZEWEcW4SfFNTr4uMNZma0ey4f5lgLrkB0aX0QMow==",
-            "dev": true,
-            "dependencies": {
-                "has-flag": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/@babel/parser": {
-            "version": "7.13.11",
-            "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.13.11.tgz",
-            "integrity": "sha512-PhuoqeHoO9fc4ffMEVk4qb/w/s2iOSWohvbHxLtxui0eBg3Lg5gN1U8wp1V1u61hOWkPQJJyJzGH6Y+grwkq8Q==",
-            "dev": true,
-            "bin": {
-                "parser": "bin/babel-parser.js"
-            },
-            "engines": {
-                "node": ">=6.0.0"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-async-generator-functions": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-async-generator-functions/-/plugin-proposal-async-generator-functions-7.13.8.tgz",
-            "integrity": "sha512-rPBnhj+WgoSmgq+4gQUtXx/vOcU+UYtjy1AA/aeD61Hwj410fwYyqfUcRP3lR8ucgliVJL/G7sXcNUecC75IXA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-remap-async-to-generator": "^7.13.0",
-                "@babel/plugin-syntax-async-generators": "^7.8.4"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-class-properties": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-class-properties/-/plugin-proposal-class-properties-7.13.0.tgz",
-            "integrity": "sha512-KnTDjFNC1g+45ka0myZNvSBFLhNCLN+GeGYLDEA8Oq7MZ6yMgfLoIRh86GRT0FjtJhZw8JyUskP9uvj5pHM9Zg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-create-class-features-plugin": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-dynamic-import": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-dynamic-import/-/plugin-proposal-dynamic-import-7.13.8.tgz",
-            "integrity": "sha512-ONWKj0H6+wIRCkZi9zSbZtE/r73uOhMVHh256ys0UzfM7I3d4n+spZNWjOnJv2gzopumP2Wxi186vI8N0Y2JyQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-dynamic-import": "^7.8.3"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-export-namespace-from": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-export-namespace-from/-/plugin-proposal-export-namespace-from-7.12.13.tgz",
-            "integrity": "sha512-INAgtFo4OnLN3Y/j0VwAgw3HDXcDtX+C/erMvWzuV9v71r7urb6iyMXu7eM9IgLr1ElLlOkaHjJ0SbCmdOQ3Iw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13",
-                "@babel/plugin-syntax-export-namespace-from": "^7.8.3"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-json-strings": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-json-strings/-/plugin-proposal-json-strings-7.13.8.tgz",
-            "integrity": "sha512-w4zOPKUFPX1mgvTmL/fcEqy34hrQ1CRcGxdphBc6snDnnqJ47EZDIyop6IwXzAC8G916hsIuXB2ZMBCExC5k7Q==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-json-strings": "^7.8.3"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-logical-assignment-operators": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-logical-assignment-operators/-/plugin-proposal-logical-assignment-operators-7.13.8.tgz",
-            "integrity": "sha512-aul6znYB4N4HGweImqKn59Su9RS8lbUIqxtXTOcAGtNIDczoEFv+l1EhmX8rUBp3G1jMjKJm8m0jXVp63ZpS4A==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-logical-assignment-operators": "^7.10.4"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-nullish-coalescing-operator": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-nullish-coalescing-operator/-/plugin-proposal-nullish-coalescing-operator-7.13.8.tgz",
-            "integrity": "sha512-iePlDPBn//UhxExyS9KyeYU7RM9WScAG+D3Hhno0PLJebAEpDZMocbDe64eqynhNAnwz/vZoL/q/QB2T1OH39A==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-numeric-separator": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-numeric-separator/-/plugin-proposal-numeric-separator-7.12.13.tgz",
-            "integrity": "sha512-O1jFia9R8BUCl3ZGB7eitaAPu62TXJRHn7rh+ojNERCFyqRwJMTmhz+tJ+k0CwI6CLjX/ee4qW74FSqlq9I35w==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13",
-                "@babel/plugin-syntax-numeric-separator": "^7.10.4"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-object-rest-spread": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-object-rest-spread/-/plugin-proposal-object-rest-spread-7.13.8.tgz",
-            "integrity": "sha512-DhB2EuB1Ih7S3/IRX5AFVgZ16k3EzfRbq97CxAVI1KSYcW+lexV8VZb7G7L8zuPVSdQMRn0kiBpf/Yzu9ZKH0g==",
-            "dev": true,
-            "dependencies": {
-                "@babel/compat-data": "^7.13.8",
-                "@babel/helper-compilation-targets": "^7.13.8",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-object-rest-spread": "^7.8.3",
-                "@babel/plugin-transform-parameters": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-optional-catch-binding": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-optional-catch-binding/-/plugin-proposal-optional-catch-binding-7.13.8.tgz",
-            "integrity": "sha512-0wS/4DUF1CuTmGo+NiaHfHcVSeSLj5S3e6RivPTg/2k3wOv3jO35tZ6/ZWsQhQMvdgI7CwphjQa/ccarLymHVA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-optional-catch-binding": "^7.8.3"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-optional-chaining": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-optional-chaining/-/plugin-proposal-optional-chaining-7.13.8.tgz",
-            "integrity": "sha512-hpbBwbTgd7Cz1QryvwJZRo1U0k1q8uyBmeXOSQUjdg/A2TASkhR/rz7AyqZ/kS8kbpsNA80rOYbxySBJAqmhhQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-skip-transparent-expression-wrappers": "^7.12.1",
-                "@babel/plugin-syntax-optional-chaining": "^7.8.3"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-private-methods": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-private-methods/-/plugin-proposal-private-methods-7.13.0.tgz",
-            "integrity": "sha512-MXyyKQd9inhx1kDYPkFRVOBXQ20ES8Pto3T7UZ92xj2mY0EVD8oAVzeyYuVfy/mxAdTSIayOvg+aVzcHV2bn6Q==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-create-class-features-plugin": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-proposal-unicode-property-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-unicode-property-regex/-/plugin-proposal-unicode-property-regex-7.12.13.tgz",
-            "integrity": "sha512-XyJmZidNfofEkqFV5VC/bLabGmO5QzenPO/YOfGuEbgU+2sSwMmio3YLb4WtBgcmmdwZHyVyv8on77IUjQ5Gvg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-async-generators": {
-            "version": "7.8.4",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-async-generators/-/plugin-syntax-async-generators-7.8.4.tgz",
-            "integrity": "sha512-tycmZxkGfZaxhMRbXlPXuVFpdWlXpir2W4AMhSJgRKzk/eDlIXOhb2LHWoLpDF7TEHylV5zNhykX6KAgHJmTNw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-class-properties": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-class-properties/-/plugin-syntax-class-properties-7.12.13.tgz",
-            "integrity": "sha512-fm4idjKla0YahUNgFNLCB0qySdsoPiZP3iQE3rky0mBUtMZ23yDJ9SJdg6dXTSDnulOVqiF3Hgr9nbXvXTQZYA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-dynamic-import": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-dynamic-import/-/plugin-syntax-dynamic-import-7.8.3.tgz",
-            "integrity": "sha512-5gdGbFon+PszYzqs83S3E5mpi7/y/8M9eC90MRTZfduQOYW76ig6SOSPNe41IG5LoP3FGBn2N0RjVDSQiS94kQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-export-namespace-from": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-export-namespace-from/-/plugin-syntax-export-namespace-from-7.8.3.tgz",
-            "integrity": "sha512-MXf5laXo6c1IbEbegDmzGPwGNTsHZmEy6QGznu5Sh2UCWvueywb2ee+CCE4zQiZstxU9BMoQO9i6zUFSY0Kj0Q==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.3"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-json-strings": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-json-strings/-/plugin-syntax-json-strings-7.8.3.tgz",
-            "integrity": "sha512-lY6kdGpWHvjoe2vk4WrAapEuBR69EMxZl+RoGRhrFGNYVK8mOPAW8VfbT/ZgrFbXlDNiiaxQnAtgVCZ6jv30EA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-logical-assignment-operators": {
-            "version": "7.10.4",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-logical-assignment-operators/-/plugin-syntax-logical-assignment-operators-7.10.4.tgz",
-            "integrity": "sha512-d8waShlpFDinQ5MtvGU9xDAOzKH47+FFoney2baFIoMr952hKOLp1HR7VszoZvOsV/4+RRszNY7D17ba0te0ig==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.10.4"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-nullish-coalescing-operator": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-nullish-coalescing-operator/-/plugin-syntax-nullish-coalescing-operator-7.8.3.tgz",
-            "integrity": "sha512-aSff4zPII1u2QD7y+F8oDsz19ew4IGEJg9SVW+bqwpwtfFleiQDMdzA/R+UlWDzfnHFCxxleFT0PMIrR36XLNQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-numeric-separator": {
-            "version": "7.10.4",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-numeric-separator/-/plugin-syntax-numeric-separator-7.10.4.tgz",
-            "integrity": "sha512-9H6YdfkcK/uOnY/K7/aA2xpzaAgkQn37yzWUMRK7OaPOqOpGS1+n0H5hxT9AUw9EsSjPW8SVyMJwYRtWs3X3ug==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.10.4"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-object-rest-spread": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-object-rest-spread/-/plugin-syntax-object-rest-spread-7.8.3.tgz",
-            "integrity": "sha512-XoqMijGZb9y3y2XskN+P1wUGiVwWZ5JmoDRwx5+3GmEplNyVM2s2Dg8ILFQm8rWM48orGy5YpI5Bl8U1y7ydlA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-optional-catch-binding": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-optional-catch-binding/-/plugin-syntax-optional-catch-binding-7.8.3.tgz",
-            "integrity": "sha512-6VPD0Pc1lpTqw0aKoeRTMiB+kWhAoT24PA+ksWSBrFtl5SIRVpZlwN3NNPQjehA2E/91FV3RjLWoVTglWcSV3Q==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-optional-chaining": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-optional-chaining/-/plugin-syntax-optional-chaining-7.8.3.tgz",
-            "integrity": "sha512-KoK9ErH1MBlCPxV0VANkXW2/dw4vlbGDrFgz8bmUsBGYkFRcbRwMh6cIJubdPrkxRwuGdtCk0v/wPTKbQgBjkg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-top-level-await": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-top-level-await/-/plugin-syntax-top-level-await-7.12.13.tgz",
-            "integrity": "sha512-A81F9pDwyS7yM//KwbCSDqy3Uj4NMIurtplxphWxoYtNPov7cJsDkAFNNyVlIZ3jwGycVsurZ+LtOA8gZ376iQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-syntax-typescript": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-typescript/-/plugin-syntax-typescript-7.12.13.tgz",
-            "integrity": "sha512-cHP3u1JiUiG2LFDKbXnwVad81GvfyIOmCD6HIEId6ojrY0Drfy2q1jw7BwN7dE84+kTnBjLkXoL3IEy/3JPu2w==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-arrow-functions": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.13.0.tgz",
-            "integrity": "sha512-96lgJagobeVmazXFaDrbmCLQxBysKu7U6Do3mLsx27gf5Dk85ezysrs2BZUpXD703U/Su1xTBDxxar2oa4jAGg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-async-to-generator": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.13.0.tgz",
-            "integrity": "sha512-3j6E004Dx0K3eGmhxVJxwwI89CTJrce7lg3UrtFuDAVQ/2+SJ/h/aSFOeE6/n0WB1GsOffsJp6MnPQNQ8nmwhg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-remap-async-to-generator": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-block-scoped-functions": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.12.13.tgz",
-            "integrity": "sha512-zNyFqbc3kI/fVpqwfqkg6RvBgFpC4J18aKKMmv7KdQ/1GgREapSJAykLMVNwfRGO3BtHj3YQZl8kxCXPcVMVeg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-block-scoping": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.12.13.tgz",
-            "integrity": "sha512-Pxwe0iqWJX4fOOM2kEZeUuAxHMWb9nK+9oh5d11bsLoB0xMg+mkDpt0eYuDZB7ETrY9bbcVlKUGTOGWy7BHsMQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-classes": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.13.0.tgz",
-            "integrity": "sha512-9BtHCPUARyVH1oXGcSJD3YpsqRLROJx5ZNP6tN5vnk17N0SVf9WCtf8Nuh1CFmgByKKAIMstitKduoCmsaDK5g==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-annotate-as-pure": "^7.12.13",
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-optimise-call-expression": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-replace-supers": "^7.13.0",
-                "@babel/helper-split-export-declaration": "^7.12.13",
-                "globals": "^11.1.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-classes/node_modules/globals": {
-            "version": "11.12.0",
-            "resolved": "https://registry.npmjs.org/globals/-/globals-11.12.0.tgz",
-            "integrity": "sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/@babel/plugin-transform-computed-properties": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.13.0.tgz",
-            "integrity": "sha512-RRqTYTeZkZAz8WbieLTvKUEUxZlUTdmL5KGMyZj7FnMfLNKV4+r5549aORG/mgojRmFlQMJDUupwAMiF2Q7OUg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-destructuring": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.13.0.tgz",
-            "integrity": "sha512-zym5em7tePoNT9s964c0/KU3JPPnuq7VhIxPRefJ4/s82cD+q1mgKfuGRDMCPL0HTyKz4dISuQlCusfgCJ86HA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-dotall-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.12.13.tgz",
-            "integrity": "sha512-foDrozE65ZFdUC2OfgeOCrEPTxdB3yjqxpXh8CH+ipd9CHd4s/iq81kcUpyH8ACGNEPdFqbtzfgzbT/ZGlbDeQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-duplicate-keys": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.12.13.tgz",
-            "integrity": "sha512-NfADJiiHdhLBW3pulJlJI2NB0t4cci4WTZ8FtdIuNc2+8pslXdPtRRAEWqUY+m9kNOk2eRYbTAOipAxlrOcwwQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-exponentiation-operator": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.12.13.tgz",
-            "integrity": "sha512-fbUelkM1apvqez/yYx1/oICVnGo2KM5s63mhGylrmXUxK/IAXSIf87QIxVfZldWf4QsOafY6vV3bX8aMHSvNrA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-builder-binary-assignment-operator-visitor": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-for-of": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.13.0.tgz",
-            "integrity": "sha512-IHKT00mwUVYE0zzbkDgNRP6SRzvfGCYsOxIRz8KsiaaHCcT9BWIkO+H9QRJseHBLOGBZkHUdHiqj6r0POsdytg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-function-name": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.12.13.tgz",
-            "integrity": "sha512-6K7gZycG0cmIwwF7uMK/ZqeCikCGVBdyP2J5SKNCXO5EOHcqi+z7Jwf8AmyDNcBgxET8DrEtCt/mPKPyAzXyqQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-literals": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.12.13.tgz",
-            "integrity": "sha512-FW+WPjSR7hiUxMcKqyNjP05tQ2kmBCdpEpZHY1ARm96tGQCCBvXKnpjILtDplUnJ/eHZ0lALLM+d2lMFSpYJrQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-member-expression-literals": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.12.13.tgz",
-            "integrity": "sha512-kxLkOsg8yir4YeEPHLuO2tXP9R/gTjpuTOjshqSpELUN3ZAg2jfDnKUvzzJxObun38sw3wm4Uu69sX/zA7iRvg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-modules-amd": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.13.0.tgz",
-            "integrity": "sha512-EKy/E2NHhY/6Vw5d1k3rgoobftcNUmp9fGjb9XZwQLtTctsRBOTRO7RHHxfIky1ogMN5BxN7p9uMA3SzPfotMQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "babel-plugin-dynamic-import-node": "^2.3.3"
-            }
-        },
-        "node_modules/@babel/plugin-transform-modules-commonjs": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.13.8.tgz",
-            "integrity": "sha512-9QiOx4MEGglfYZ4XOnU79OHr6vIWUakIj9b4mioN8eQIoEh+pf5p/zEB36JpDFWA12nNMiRf7bfoRvl9Rn79Bw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-simple-access": "^7.12.13",
-                "babel-plugin-dynamic-import-node": "^2.3.3"
-            }
-        },
-        "node_modules/@babel/plugin-transform-modules-systemjs": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.13.8.tgz",
-            "integrity": "sha512-hwqctPYjhM6cWvVIlOIe27jCIBgHCsdH2xCJVAYQm7V5yTMoilbVMi9f6wKg0rpQAOn6ZG4AOyvCqFF/hUh6+A==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-hoist-variables": "^7.13.0",
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "babel-plugin-dynamic-import-node": "^2.3.3"
-            }
-        },
-        "node_modules/@babel/plugin-transform-modules-umd": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.13.0.tgz",
-            "integrity": "sha512-D/ILzAh6uyvkWjKKyFE/W0FzWwasv6vPTSqPcjxFqn6QpX3u8DjRVliq4F2BamO2Wee/om06Vyy+vPkNrd4wxw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-named-capturing-groups-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-named-capturing-groups-regex/-/plugin-transform-named-capturing-groups-regex-7.12.13.tgz",
-            "integrity": "sha512-Xsm8P2hr5hAxyYblrfACXpQKdQbx4m2df9/ZZSQ8MAhsadw06+jW7s9zsSw6he+mJZXRlVMyEnVktJo4zjk1WA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-new-target": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.12.13.tgz",
-            "integrity": "sha512-/KY2hbLxrG5GTQ9zzZSc3xWiOy379pIETEhbtzwZcw9rvuaVV4Fqy7BYGYOWZnaoXIQYbbJ0ziXLa/sKcGCYEQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-object-super": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.12.13.tgz",
-            "integrity": "sha512-JzYIcj3XtYspZDV8j9ulnoMPZZnF/Cj0LUxPOjR89BdBVx+zYJI9MdMIlUZjbXDX+6YVeS6I3e8op+qQ3BYBoQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13",
-                "@babel/helper-replace-supers": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-parameters": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.13.0.tgz",
-            "integrity": "sha512-Jt8k/h/mIwE2JFEOb3lURoY5C85ETcYPnbuAJ96zRBzh1XHtQZfs62ChZ6EP22QlC8c7Xqr9q+e1SU5qttwwjw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-property-literals": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.12.13.tgz",
-            "integrity": "sha512-nqVigwVan+lR+g8Fj8Exl0UQX2kymtjcWfMOYM1vTYEKujeyv2SkMgazf2qNcK7l4SDiKyTA/nHCPqL4e2zo1A==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-regenerator": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.12.13.tgz",
-            "integrity": "sha512-lxb2ZAvSLyJ2PEe47hoGWPmW22v7CtSl9jW8mingV4H2sEX/JOcrAj2nPuGWi56ERUm2bUpjKzONAuT6HCn2EA==",
-            "dev": true,
-            "dependencies": {
-                "regenerator-transform": "^0.14.2"
-            }
-        },
-        "node_modules/@babel/plugin-transform-reserved-words": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.12.13.tgz",
-            "integrity": "sha512-xhUPzDXxZN1QfiOy/I5tyye+TRz6lA7z6xaT4CLOjPRMVg1ldRf0LHw0TDBpYL4vG78556WuHdyO9oi5UmzZBg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-runtime": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-runtime/-/plugin-transform-runtime-7.13.10.tgz",
-            "integrity": "sha512-Y5k8ipgfvz5d/76tx7JYbKQTcgFSU6VgJ3kKQv4zGTKr+a9T/KBvfRvGtSFgKDQGt/DBykQixV0vNWKIdzWErA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "babel-plugin-polyfill-corejs2": "^0.1.4",
-                "babel-plugin-polyfill-corejs3": "^0.1.3",
-                "babel-plugin-polyfill-regenerator": "^0.1.2",
-                "semver": "^6.3.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-runtime/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/@babel/plugin-transform-shorthand-properties": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.12.13.tgz",
-            "integrity": "sha512-xpL49pqPnLtf0tVluuqvzWIgLEhuPpZzvs2yabUHSKRNlN7ScYU7aMlmavOeyXJZKgZKQRBlh8rHbKiJDraTSw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-spread": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.13.0.tgz",
-            "integrity": "sha512-V6vkiXijjzYeFmQTr3dBxPtZYLPcUfY34DebOU27jIl2M/Y8Egm52Hw82CSjjPqd54GTlJs5x+CR7HeNr24ckg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-skip-transparent-expression-wrappers": "^7.12.1"
-            }
-        },
-        "node_modules/@babel/plugin-transform-sticky-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.12.13.tgz",
-            "integrity": "sha512-Jc3JSaaWT8+fr7GRvQP02fKDsYk4K/lYwWq38r/UGfaxo89ajud321NH28KRQ7xy1Ybc0VUE5Pz8psjNNDUglg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-template-literals": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.13.0.tgz",
-            "integrity": "sha512-d67umW6nlfmr1iehCcBv69eSUSySk1EsIS8aTDX4Xo9qajAh6mYtcl4kJrBkGXuxZPEgVr7RVfAvNW6YQkd4Mw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/plugin-transform-typeof-symbol": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.12.13.tgz",
-            "integrity": "sha512-eKv/LmUJpMnu4npgfvs3LiHhJua5fo/CysENxa45YCQXZwKnGCQKAg87bvoqSW1fFT+HA32l03Qxsm8ouTY3ZQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-typescript": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typescript/-/plugin-transform-typescript-7.13.0.tgz",
-            "integrity": "sha512-elQEwluzaU8R8dbVuW2Q2Y8Nznf7hnjM7+DSCd14Lo5fF63C9qNLbwZYbmZrtV9/ySpSUpkRpQXvJb6xyu4hCQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-create-class-features-plugin": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-typescript": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-unicode-escapes": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.12.13.tgz",
-            "integrity": "sha512-0bHEkdwJ/sN/ikBHfSmOXPypN/beiGqjo+o4/5K+vxEFNPRPdImhviPakMKG4x96l85emoa0Z6cDflsdBusZbw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/plugin-transform-unicode-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.12.13.tgz",
-            "integrity": "sha512-mDRzSNY7/zopwisPZ5kM9XKCfhchqIYwAKRERtEnhYscZB79VRekuRSoYbN0+KVe3y8+q1h6A4svXtP7N+UoCA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/preset-env": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.13.10.tgz",
-            "integrity": "sha512-nOsTScuoRghRtUsRr/c69d042ysfPHcu+KOB4A9aAO9eJYqrkat+LF8G1yp1HD18QiwixT2CisZTr/0b3YZPXQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/compat-data": "^7.13.8",
-                "@babel/helper-compilation-targets": "^7.13.10",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-validator-option": "^7.12.17",
-                "@babel/plugin-proposal-async-generator-functions": "^7.13.8",
-                "@babel/plugin-proposal-class-properties": "^7.13.0",
-                "@babel/plugin-proposal-dynamic-import": "^7.13.8",
-                "@babel/plugin-proposal-export-namespace-from": "^7.12.13",
-                "@babel/plugin-proposal-json-strings": "^7.13.8",
-                "@babel/plugin-proposal-logical-assignment-operators": "^7.13.8",
-                "@babel/plugin-proposal-nullish-coalescing-operator": "^7.13.8",
-                "@babel/plugin-proposal-numeric-separator": "^7.12.13",
-                "@babel/plugin-proposal-object-rest-spread": "^7.13.8",
-                "@babel/plugin-proposal-optional-catch-binding": "^7.13.8",
-                "@babel/plugin-proposal-optional-chaining": "^7.13.8",
-                "@babel/plugin-proposal-private-methods": "^7.13.0",
-                "@babel/plugin-proposal-unicode-property-regex": "^7.12.13",
-                "@babel/plugin-syntax-async-generators": "^7.8.4",
-                "@babel/plugin-syntax-class-properties": "^7.12.13",
-                "@babel/plugin-syntax-dynamic-import": "^7.8.3",
-                "@babel/plugin-syntax-export-namespace-from": "^7.8.3",
-                "@babel/plugin-syntax-json-strings": "^7.8.3",
-                "@babel/plugin-syntax-logical-assignment-operators": "^7.10.4",
-                "@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3",
-                "@babel/plugin-syntax-numeric-separator": "^7.10.4",
-                "@babel/plugin-syntax-object-rest-spread": "^7.8.3",
-                "@babel/plugin-syntax-optional-catch-binding": "^7.8.3",
-                "@babel/plugin-syntax-optional-chaining": "^7.8.3",
-                "@babel/plugin-syntax-top-level-await": "^7.12.13",
-                "@babel/plugin-transform-arrow-functions": "^7.13.0",
-                "@babel/plugin-transform-async-to-generator": "^7.13.0",
-                "@babel/plugin-transform-block-scoped-functions": "^7.12.13",
-                "@babel/plugin-transform-block-scoping": "^7.12.13",
-                "@babel/plugin-transform-classes": "^7.13.0",
-                "@babel/plugin-transform-computed-properties": "^7.13.0",
-                "@babel/plugin-transform-destructuring": "^7.13.0",
-                "@babel/plugin-transform-dotall-regex": "^7.12.13",
-                "@babel/plugin-transform-duplicate-keys": "^7.12.13",
-                "@babel/plugin-transform-exponentiation-operator": "^7.12.13",
-                "@babel/plugin-transform-for-of": "^7.13.0",
-                "@babel/plugin-transform-function-name": "^7.12.13",
-                "@babel/plugin-transform-literals": "^7.12.13",
-                "@babel/plugin-transform-member-expression-literals": "^7.12.13",
-                "@babel/plugin-transform-modules-amd": "^7.13.0",
-                "@babel/plugin-transform-modules-commonjs": "^7.13.8",
-                "@babel/plugin-transform-modules-systemjs": "^7.13.8",
-                "@babel/plugin-transform-modules-umd": "^7.13.0",
-                "@babel/plugin-transform-named-capturing-groups-regex": "^7.12.13",
-                "@babel/plugin-transform-new-target": "^7.12.13",
-                "@babel/plugin-transform-object-super": "^7.12.13",
-                "@babel/plugin-transform-parameters": "^7.13.0",
-                "@babel/plugin-transform-property-literals": "^7.12.13",
-                "@babel/plugin-transform-regenerator": "^7.12.13",
-                "@babel/plugin-transform-reserved-words": "^7.12.13",
-                "@babel/plugin-transform-shorthand-properties": "^7.12.13",
-                "@babel/plugin-transform-spread": "^7.13.0",
-                "@babel/plugin-transform-sticky-regex": "^7.12.13",
-                "@babel/plugin-transform-template-literals": "^7.13.0",
-                "@babel/plugin-transform-typeof-symbol": "^7.12.13",
-                "@babel/plugin-transform-unicode-escapes": "^7.12.13",
-                "@babel/plugin-transform-unicode-regex": "^7.12.13",
-                "@babel/preset-modules": "^0.1.4",
-                "@babel/types": "^7.13.0",
-                "babel-plugin-polyfill-corejs2": "^0.1.4",
-                "babel-plugin-polyfill-corejs3": "^0.1.3",
-                "babel-plugin-polyfill-regenerator": "^0.1.2",
-                "core-js-compat": "^3.9.0",
-                "semver": "^6.3.0"
-            }
-        },
-        "node_modules/@babel/preset-env/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/@babel/preset-modules": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/@babel/preset-modules/-/preset-modules-0.1.4.tgz",
-            "integrity": "sha512-J36NhwnfdzpmH41M1DrnkkgAqhZaqr/NBdPfQ677mLzlaXo+oDiv1deyCDtgAhz8p328otdob0Du7+xgHGZbKg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.0.0",
-                "@babel/plugin-proposal-unicode-property-regex": "^7.4.4",
-                "@babel/plugin-transform-dotall-regex": "^7.4.4",
-                "@babel/types": "^7.4.4",
-                "esutils": "^2.0.2"
-            }
-        },
-        "node_modules/@babel/preset-typescript": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/preset-typescript/-/preset-typescript-7.13.0.tgz",
-            "integrity": "sha512-LXJwxrHy0N3f6gIJlYbLta1D9BDtHpQeqwzM0LIfjDlr6UE/D5Mc7W4iDiQzaE+ks0sTjT26ArcHWnJVt0QiHw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-validator-option": "^7.12.17",
-                "@babel/plugin-transform-typescript": "^7.13.0"
-            }
-        },
-        "node_modules/@babel/runtime": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.13.10.tgz",
-            "integrity": "sha512-4QPkjJq6Ns3V/RgpEahRk+AGfL0eO6RHHtTWoNNr5mO49G6B5+X6d6THgWEAvTrznU5xYpbAlVKRYcsCgh/Akw==",
-            "dependencies": {
-                "regenerator-runtime": "^0.13.4"
-            }
-        },
-        "node_modules/@babel/template": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.12.13.tgz",
-            "integrity": "sha512-/7xxiGA57xMo/P2GVvdEumr8ONhFOhfgq2ihK3h1e6THqzTAkHbkXgB0xI9yeTfIUoH3+oAeHhqm/I43OTbbjA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/code-frame": "^7.12.13",
-                "@babel/parser": "^7.12.13",
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/template/node_modules/@babel/code-frame": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
-            "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
-            "dev": true,
-            "dependencies": {
-                "@babel/highlight": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/traverse": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.13.0.tgz",
-            "integrity": "sha512-xys5xi5JEhzC3RzEmSGrs/b3pJW/o87SypZ+G/PhaE7uqVQNv/jlmVIBXuoh5atqQ434LfXV+sf23Oxj0bchJQ==",
-            "dev": true,
-            "dependencies": {
-                "@babel/code-frame": "^7.12.13",
-                "@babel/generator": "^7.13.0",
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-split-export-declaration": "^7.12.13",
-                "@babel/parser": "^7.13.0",
-                "@babel/types": "^7.13.0",
-                "debug": "^4.1.0",
-                "globals": "^11.1.0",
-                "lodash": "^4.17.19"
-            }
-        },
-        "node_modules/@babel/traverse/node_modules/@babel/code-frame": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
-            "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
-            "dev": true,
-            "dependencies": {
-                "@babel/highlight": "^7.12.13"
-            }
-        },
-        "node_modules/@babel/traverse/node_modules/globals": {
-            "version": "11.12.0",
-            "resolved": "https://registry.npmjs.org/globals/-/globals-11.12.0.tgz",
-            "integrity": "sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/@babel/types": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.13.0.tgz",
-            "integrity": "sha512-hE+HE8rnG1Z6Wzo+MhaKE5lM5eMx71T4EHJgku2E3xIfaULhDcxiiRxUYgwX8qwP1BBSlag+TdGOt6JAidIZTA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "lodash": "^4.17.19",
-                "to-fast-properties": "^2.0.0"
-            }
-        },
-        "node_modules/@discoveryjs/json-ext": {
-            "version": "0.5.2",
-            "resolved": "https://registry.npmjs.org/@discoveryjs/json-ext/-/json-ext-0.5.2.tgz",
-            "integrity": "sha512-HyYEUDeIj5rRQU2Hk5HTB2uHsbRQpF70nvMhVzi+VJR0X+xNEhjPui4/kBf3VeH/wqD28PT4sVOm8qqLjBrSZg==",
-            "dev": true,
-            "engines": {
-                "node": ">=10.0.0"
-            }
-        },
-        "node_modules/@eslint/eslintrc": {
-            "version": "0.4.0",
-            "resolved": "https://registry.npmjs.org/@eslint/eslintrc/-/eslintrc-0.4.0.tgz",
-            "integrity": "sha512-2ZPCc+uNbjV5ERJr+aKSPRwZgKd2z11x0EgLvb1PURmUrn9QNRXFqje0Ldq454PfAVyaJYyrDvvIKSFP4NnBog==",
-            "dev": true,
-            "dependencies": {
-                "ajv": "^6.12.4",
-                "debug": "^4.1.1",
-                "espree": "^7.3.0",
-                "globals": "^12.1.0",
-                "ignore": "^4.0.6",
-                "import-fresh": "^3.2.1",
-                "js-yaml": "^3.13.1",
-                "minimatch": "^3.0.4",
-                "strip-json-comments": "^3.1.1"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/@eslint/eslintrc/node_modules/globals": {
-            "version": "12.4.0",
-            "resolved": "https://registry.npmjs.org/globals/-/globals-12.4.0.tgz",
-            "integrity": "sha512-BWICuzzDvDoH54NHKCseDanAhE3CeDorgDL5MT6LMXXj2WCnd9UC2szdk4AWLfjdgNBCXLUanXYcpBBKOSWGwg==",
-            "dev": true,
-            "dependencies": {
-                "type-fest": "^0.8.1"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/@eslint/eslintrc/node_modules/ignore": {
-            "version": "4.0.6",
-            "resolved": "https://registry.npmjs.org/ignore/-/ignore-4.0.6.tgz",
-            "integrity": "sha512-cyFDKrqc/YdcWFniJhzI42+AzS+gNwmUzOSFcRCQYwySuBBBy/KjuxWLZ/FHEH6Moq1NizMOBWyTcv8O4OZIMg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 4"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2": {
-            "version": "2.1.8-no-fsevents",
-            "resolved": "https://registry.npmjs.org/@nicolo-ribaudo/chokidar-2/-/chokidar-2-2.1.8-no-fsevents.tgz",
-            "integrity": "sha512-+nb9vWloHNNMFHjGofEam3wopE3m1yuambrrd/fnPc+lFOMB9ROTqQlche9ByFWNkdNqfSgR/kkQtQ8DzEWt2w==",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "anymatch": "^2.0.0",
-                "async-each": "^1.0.1",
-                "braces": "^2.3.2",
-                "glob-parent": "^3.1.0",
-                "inherits": "^2.0.3",
-                "is-binary-path": "^1.0.0",
-                "is-glob": "^4.0.0",
-                "normalize-path": "^3.0.0",
-                "path-is-absolute": "^1.0.0",
-                "readdirp": "^2.2.1",
-                "upath": "^1.1.1"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/braces": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-            "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-            "dev": true,
-            "optional": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/fill-range": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-            "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "extend-shallow": "^2.0.1",
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1",
-                "to-regex-range": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/glob-parent": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-3.1.0.tgz",
-            "integrity": "sha1-nmr2KZ2NO9K9QEMIMr0RPfkGxa4=",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "is-glob": "^3.1.0",
-                "path-dirname": "^1.0.0"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/glob-parent/node_modules/is-glob": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-3.1.0.tgz",
-            "integrity": "sha1-e6WuJCF4BKxwcHuWkiVnSGzD6Eo=",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "is-extglob": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/is-number": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-            "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@nicolo-ribaudo/chokidar-2/node_modules/to-regex-range": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-            "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/@nodelib/fs.scandir": {
-            "version": "2.1.4",
-            "resolved": "https://registry.npmjs.org/@nodelib/fs.scandir/-/fs.scandir-2.1.4.tgz",
-            "integrity": "sha512-33g3pMJk3bg5nXbL/+CY6I2eJDzZAni49PfJnL5fghPTggPvBd/pFNSgJsdAgWptuFu7qq/ERvOYFlhvsLTCKA==",
-            "dev": true,
-            "dependencies": {
-                "@nodelib/fs.stat": "2.0.4",
-                "run-parallel": "^1.1.9"
-            },
-            "engines": {
-                "node": ">= 8"
-            }
-        },
-        "node_modules/@nodelib/fs.stat": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/@nodelib/fs.stat/-/fs.stat-2.0.4.tgz",
-            "integrity": "sha512-IYlHJA0clt2+Vg7bccq+TzRdJvv19c2INqBSsoOLp1je7xjtr7J26+WXR72MCdvU9q1qTzIWDfhMf+DRvQJK4Q==",
-            "dev": true,
-            "engines": {
-                "node": ">= 8"
-            }
-        },
-        "node_modules/@nodelib/fs.walk": {
-            "version": "1.2.6",
-            "resolved": "https://registry.npmjs.org/@nodelib/fs.walk/-/fs.walk-1.2.6.tgz",
-            "integrity": "sha512-8Broas6vTtW4GIXTAHDoE32hnN2M5ykgCpWGbuXHQ15vEMqr23pB76e/GZcYsZCHALv50ktd24qhEyKr6wBtow==",
-            "dev": true,
-            "dependencies": {
-                "@nodelib/fs.scandir": "2.1.4",
-                "fastq": "^1.6.0"
-            },
-            "engines": {
-                "node": ">= 8"
-            }
-        },
-        "node_modules/@types/dagre": {
-            "version": "0.7.44",
-            "resolved": "https://registry.npmjs.org/@types/dagre/-/dagre-0.7.44.tgz",
-            "integrity": "sha512-N6HD+79w77ZVAaVO7JJDW5yJ9LAxM62FpgNGO9xEde+KVYjDRyhIMzfiErXpr1g0JPon9kwlBzoBK6s4fOww9Q==",
-            "dev": true
-        },
-        "node_modules/@types/eslint": {
-            "version": "7.2.7",
-            "resolved": "https://registry.npmjs.org/@types/eslint/-/eslint-7.2.7.tgz",
-            "integrity": "sha512-EHXbc1z2GoQRqHaAT7+grxlTJ3WE2YNeD6jlpPoRc83cCoThRY+NUWjCUZaYmk51OICkPXn2hhphcWcWXgNW0Q==",
-            "dev": true,
-            "dependencies": {
-                "@types/estree": "*",
-                "@types/json-schema": "*"
-            }
-        },
-        "node_modules/@types/eslint-scope": {
-            "version": "3.7.0",
-            "resolved": "https://registry.npmjs.org/@types/eslint-scope/-/eslint-scope-3.7.0.tgz",
-            "integrity": "sha512-O/ql2+rrCUe2W2rs7wMR+GqPRcgB6UiqN5RhrR5xruFlY7l9YLMn0ZkDzjoHLeiFkR8MCQZVudUuuvQ2BLC9Qw==",
-            "dev": true,
-            "dependencies": {
-                "@types/eslint": "*",
-                "@types/estree": "*"
-            }
-        },
-        "node_modules/@types/estree": {
-            "version": "0.0.46",
-            "resolved": "https://registry.npmjs.org/@types/estree/-/estree-0.0.46.tgz",
-            "integrity": "sha512-laIjwTQaD+5DukBZaygQ79K1Z0jb1bPEMRrkXSLjtCcZm+abyp5YbrqpSLzD42FwWW6gK/aS4NYpJ804nG2brg==",
-            "dev": true
-        },
-        "node_modules/@types/glob": {
-            "version": "7.1.3",
-            "resolved": "https://registry.npmjs.org/@types/glob/-/glob-7.1.3.tgz",
-            "integrity": "sha512-SEYeGAIQIQX8NN6LDKprLjbrd5dARM5EXsd8GI/A5l0apYI1fGMWgPHSe4ZKL4eozlAyI+doUE9XbYS4xCkQ1w==",
-            "dev": true,
-            "dependencies": {
-                "@types/minimatch": "*",
-                "@types/node": "*"
-            }
-        },
-        "node_modules/@types/jquery": {
-            "version": "3.5.5",
-            "resolved": "https://registry.npmjs.org/@types/jquery/-/jquery-3.5.5.tgz",
-            "integrity": "sha512-6RXU9Xzpc6vxNrS6FPPapN1SxSHgQ336WC6Jj/N8q30OiaBZ00l1GBgeP7usjVZPivSkGUfL1z/WW6TX989M+w==",
-            "dev": true,
-            "dependencies": {
-                "@types/sizzle": "*"
-            }
-        },
-        "node_modules/@types/json-schema": {
-            "version": "7.0.7",
-            "resolved": "https://registry.npmjs.org/@types/json-schema/-/json-schema-7.0.7.tgz",
-            "integrity": "sha512-cxWFQVseBm6O9Gbw1IWb8r6OS4OhSt3hPZLkFApLjM8TEXROBuQGLAH2i2gZpcXdLBIrpXuTDhH7Vbm1iXmNGA==",
-            "dev": true
-        },
-        "node_modules/@types/mathjs": {
-            "version": "6.0.11",
-            "resolved": "https://registry.npmjs.org/@types/mathjs/-/mathjs-6.0.11.tgz",
-            "integrity": "sha512-q9B8ZreO41L38iTY76bCZEtAqzeRs4mNIOZpZ1sLSlcYgvgfFrnf8y8qfmas0tVWrsODjmQbQJFD6RJJJCqJbQ==",
-            "dependencies": {
-                "decimal.js": "^10.0.0"
-            }
-        },
-        "node_modules/@types/minimatch": {
-            "version": "3.0.3",
-            "resolved": "https://registry.npmjs.org/@types/minimatch/-/minimatch-3.0.3.tgz",
-            "integrity": "sha512-tHq6qdbT9U1IRSGf14CL0pUlULksvY9OZ+5eEgl1N7t+OA3tGvNpxJCzuKQlsNgCVwbAs670L1vcVQi8j9HjnA==",
-            "dev": true
-        },
-        "node_modules/@types/node": {
-            "version": "14.14.35",
-            "resolved": "https://registry.npmjs.org/@types/node/-/node-14.14.35.tgz",
-            "integrity": "sha512-Lt+wj8NVPx0zUmUwumiVXapmaLUcAk3yPuHCFVXras9k5VT9TdhJqKqGVUQCD60OTMCl0qxJ57OiTL0Mic3Iag==",
-            "dev": true
-        },
-        "node_modules/@types/sizzle": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/@types/sizzle/-/sizzle-2.3.2.tgz",
-            "integrity": "sha512-7EJYyKTL7tFR8+gDbB6Wwz/arpGa0Mywk1TJbNzKzHtzbwVmY4HR9WqS5VV7dsBUKQmPNr192jHr/VpBluj/hg==",
-            "dev": true
-        },
-        "node_modules/@typescript-eslint/eslint-plugin": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/eslint-plugin/-/eslint-plugin-4.18.0.tgz",
-            "integrity": "sha512-Lzkc/2+7EoH7+NjIWLS2lVuKKqbEmJhtXe3rmfA8cyiKnZm3IfLf51irnBcmow8Q/AptVV0XBZmBJKuUJTe6cQ==",
-            "dev": true,
-            "dependencies": {
-                "@typescript-eslint/experimental-utils": "4.18.0",
-                "@typescript-eslint/scope-manager": "4.18.0",
-                "debug": "^4.1.1",
-                "functional-red-black-tree": "^1.0.1",
-                "lodash": "^4.17.15",
-                "regexpp": "^3.0.0",
-                "semver": "^7.3.2",
-                "tsutils": "^3.17.1"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/@typescript-eslint/experimental-utils": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/experimental-utils/-/experimental-utils-4.18.0.tgz",
-            "integrity": "sha512-92h723Kblt9JcT2RRY3QS2xefFKar4ZQFVs3GityOKWQYgtajxt/tuXIzL7sVCUlM1hgreiV5gkGYyBpdOwO6A==",
-            "dev": true,
-            "dependencies": {
-                "@types/json-schema": "^7.0.3",
-                "@typescript-eslint/scope-manager": "4.18.0",
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/typescript-estree": "4.18.0",
-                "eslint-scope": "^5.0.0",
-                "eslint-utils": "^2.0.0"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/@typescript-eslint/parser": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/parser/-/parser-4.18.0.tgz",
-            "integrity": "sha512-W3z5S0ZbecwX3PhJEAnq4mnjK5JJXvXUDBYIYGoweCyWyuvAKfGHvzmpUzgB5L4cRBb+cTu9U/ro66dx7dIimA==",
-            "dev": true,
-            "dependencies": {
-                "@typescript-eslint/scope-manager": "4.18.0",
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/typescript-estree": "4.18.0",
-                "debug": "^4.1.1"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/@typescript-eslint/scope-manager": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/scope-manager/-/scope-manager-4.18.0.tgz",
-            "integrity": "sha512-olX4yN6rvHR2eyFOcb6E4vmhDPsfdMyfQ3qR+oQNkAv8emKKlfxTWUXU5Mqxs2Fwe3Pf1BoPvrwZtwngxDzYzQ==",
-            "dev": true,
-            "dependencies": {
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/visitor-keys": "4.18.0"
-            },
-            "engines": {
-                "node": "^8.10.0 || ^10.13.0 || >=11.10.1"
-            }
-        },
-        "node_modules/@typescript-eslint/types": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/types/-/types-4.18.0.tgz",
-            "integrity": "sha512-/BRociARpj5E+9yQ7cwCF/SNOWwXJ3qhjurMuK2hIFUbr9vTuDeu476Zpu+ptxY2kSxUHDGLLKy+qGq2sOg37A==",
-            "dev": true,
-            "engines": {
-                "node": "^8.10.0 || ^10.13.0 || >=11.10.1"
-            }
-        },
-        "node_modules/@typescript-eslint/typescript-estree": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/typescript-estree/-/typescript-estree-4.18.0.tgz",
-            "integrity": "sha512-wt4xvF6vvJI7epz+rEqxmoNQ4ZADArGQO9gDU+cM0U5fdVv7N+IAuVoVAoZSOZxzGHBfvE3XQMLdy+scsqFfeg==",
-            "dev": true,
-            "dependencies": {
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/visitor-keys": "4.18.0",
-                "debug": "^4.1.1",
-                "globby": "^11.0.1",
-                "is-glob": "^4.0.1",
-                "semver": "^7.3.2",
-                "tsutils": "^3.17.1"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/@typescript-eslint/visitor-keys": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/visitor-keys/-/visitor-keys-4.18.0.tgz",
-            "integrity": "sha512-Q9t90JCvfYaN0OfFUgaLqByOfz8yPeTAdotn/XYNm5q9eHax90gzdb+RJ6E9T5s97Kv/UHWKERTmqA0jTKAEHw==",
-            "dev": true,
-            "dependencies": {
-                "@typescript-eslint/types": "4.18.0",
-                "eslint-visitor-keys": "^2.0.0"
-            },
-            "engines": {
-                "node": "^8.10.0 || ^10.13.0 || >=11.10.1"
-            }
-        },
-        "node_modules/@webassemblyjs/ast": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.0.tgz",
-            "integrity": "sha512-kX2W49LWsbthrmIRMbQZuQDhGtjyqXfEmmHyEi4XWnSZtPmxY0+3anPIzsnRb45VH/J55zlOfWvZuY47aJZTJg==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/helper-numbers": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0"
-            }
-        },
-        "node_modules/@webassemblyjs/floating-point-hex-parser": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/floating-point-hex-parser/-/floating-point-hex-parser-1.11.0.tgz",
-            "integrity": "sha512-Q/aVYs/VnPDVYvsCBL/gSgwmfjeCb4LW8+TMrO3cSzJImgv8lxxEPM2JA5jMrivE7LSz3V+PFqtMbls3m1exDA==",
-            "dev": true
-        },
-        "node_modules/@webassemblyjs/helper-api-error": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-api-error/-/helper-api-error-1.11.0.tgz",
-            "integrity": "sha512-baT/va95eXiXb2QflSx95QGT5ClzWpGaa8L7JnJbgzoYeaA27FCvuBXU758l+KXWRndEmUXjP0Q5fibhavIn8w==",
-            "dev": true
-        },
-        "node_modules/@webassemblyjs/helper-buffer": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.0.tgz",
-            "integrity": "sha512-u9HPBEl4DS+vA8qLQdEQ6N/eJQ7gT7aNvMIo8AAWvAl/xMrcOSiI2M0MAnMCy3jIFke7bEee/JwdX1nUpCtdyA==",
-            "dev": true
-        },
-        "node_modules/@webassemblyjs/helper-numbers": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-numbers/-/helper-numbers-1.11.0.tgz",
-            "integrity": "sha512-DhRQKelIj01s5IgdsOJMKLppI+4zpmcMQ3XboFPLwCpSNH6Hqo1ritgHgD0nqHeSYqofA6aBN/NmXuGjM1jEfQ==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/floating-point-hex-parser": "1.11.0",
-                "@webassemblyjs/helper-api-error": "1.11.0",
-                "@xtuc/long": "4.2.2"
-            }
-        },
-        "node_modules/@webassemblyjs/helper-wasm-bytecode": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-bytecode/-/helper-wasm-bytecode-1.11.0.tgz",
-            "integrity": "sha512-MbmhvxXExm542tWREgSFnOVo07fDpsBJg3sIl6fSp9xuu75eGz5lz31q7wTLffwL3Za7XNRCMZy210+tnsUSEA==",
-            "dev": true
-        },
-        "node_modules/@webassemblyjs/helper-wasm-section": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.0.tgz",
-            "integrity": "sha512-3Eb88hcbfY/FCukrg6i3EH8H2UsD7x8Vy47iVJrP967A9JGqgBVL9aH71SETPx1JrGsOUVLo0c7vMCN22ytJew==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-buffer": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/wasm-gen": "1.11.0"
-            }
-        },
-        "node_modules/@webassemblyjs/ieee754": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/ieee754/-/ieee754-1.11.0.tgz",
-            "integrity": "sha512-KXzOqpcYQwAfeQ6WbF6HXo+0udBNmw0iXDmEK5sFlmQdmND+tr773Ti8/5T/M6Tl/413ArSJErATd8In3B+WBA==",
-            "dev": true,
-            "dependencies": {
-                "@xtuc/ieee754": "^1.2.0"
-            }
-        },
-        "node_modules/@webassemblyjs/leb128": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/leb128/-/leb128-1.11.0.tgz",
-            "integrity": "sha512-aqbsHa1mSQAbeeNcl38un6qVY++hh8OpCOzxhixSYgbRfNWcxJNJQwe2rezK9XEcssJbbWIkblaJRwGMS9zp+g==",
-            "dev": true,
-            "dependencies": {
-                "@xtuc/long": "4.2.2"
-            }
-        },
-        "node_modules/@webassemblyjs/utf8": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/utf8/-/utf8-1.11.0.tgz",
-            "integrity": "sha512-A/lclGxH6SpSLSyFowMzO/+aDEPU4hvEiooCMXQPcQFPPJaYcPQNKGOCLUySJsYJ4trbpr+Fs08n4jelkVTGVw==",
-            "dev": true
-        },
-        "node_modules/@webassemblyjs/wasm-edit": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.0.tgz",
-            "integrity": "sha512-JHQ0damXy0G6J9ucyKVXO2j08JVJ2ntkdJlq1UTiUrIgfGMmA7Ik5VdC/L8hBK46kVJgujkBIoMtT8yVr+yVOQ==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-buffer": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/helper-wasm-section": "1.11.0",
-                "@webassemblyjs/wasm-gen": "1.11.0",
-                "@webassemblyjs/wasm-opt": "1.11.0",
-                "@webassemblyjs/wasm-parser": "1.11.0",
-                "@webassemblyjs/wast-printer": "1.11.0"
-            }
-        },
-        "node_modules/@webassemblyjs/wasm-gen": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.0.tgz",
-            "integrity": "sha512-BEUv1aj0WptCZ9kIS30th5ILASUnAPEvE3tVMTrItnZRT9tXCLW2LEXT8ezLw59rqPP9klh9LPmpU+WmRQmCPQ==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/ieee754": "1.11.0",
-                "@webassemblyjs/leb128": "1.11.0",
-                "@webassemblyjs/utf8": "1.11.0"
-            }
-        },
-        "node_modules/@webassemblyjs/wasm-opt": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.0.tgz",
-            "integrity": "sha512-tHUSP5F4ywyh3hZ0+fDQuWxKx3mJiPeFufg+9gwTpYp324mPCQgnuVKwzLTZVqj0duRDovnPaZqDwoyhIO8kYg==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-buffer": "1.11.0",
-                "@webassemblyjs/wasm-gen": "1.11.0",
-                "@webassemblyjs/wasm-parser": "1.11.0"
-            }
-        },
-        "node_modules/@webassemblyjs/wasm-parser": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.0.tgz",
-            "integrity": "sha512-6L285Sgu9gphrcpDXINvm0M9BskznnzJTE7gYkjDbxET28shDqp27wpruyx3C2S/dvEwiigBwLA1cz7lNUi0kw==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-api-error": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/ieee754": "1.11.0",
-                "@webassemblyjs/leb128": "1.11.0",
-                "@webassemblyjs/utf8": "1.11.0"
-            }
-        },
-        "node_modules/@webassemblyjs/wast-printer": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.0.tgz",
-            "integrity": "sha512-Fg5OX46pRdTgB7rKIUojkh9vXaVN6sGYCnEiJN1GYkb0RPwShZXp6KTDqmoMdQPKhcroOXh3fEzmkWmCYaKYhQ==",
-            "dev": true,
-            "dependencies": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@xtuc/long": "4.2.2"
-            }
-        },
-        "node_modules/@webpack-cli/configtest": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/@webpack-cli/configtest/-/configtest-1.0.1.tgz",
-            "integrity": "sha512-B+4uBUYhpzDXmwuo3V9yBH6cISwxEI4J+NO5ggDaGEEHb0osY/R7MzeKc0bHURXQuZjMM4qD+bSJCKIuI3eNBQ==",
-            "dev": true
-        },
-        "node_modules/@webpack-cli/info": {
-            "version": "1.2.2",
-            "resolved": "https://registry.npmjs.org/@webpack-cli/info/-/info-1.2.2.tgz",
-            "integrity": "sha512-5U9kUJHnwU+FhKH4PWGZuBC1hTEPYyxGSL5jjoBI96Gx8qcYJGOikpiIpFoTq8mmgX3im2zAo2wanv/alD74KQ==",
-            "dev": true,
-            "dependencies": {
-                "envinfo": "^7.7.3"
-            }
-        },
-        "node_modules/@webpack-cli/serve": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/@webpack-cli/serve/-/serve-1.3.0.tgz",
-            "integrity": "sha512-k2p2VrONcYVX1wRRrf0f3X2VGltLWcv+JzXRBDmvCxGlCeESx4OXw91TsWeKOkp784uNoVQo313vxJFHXPPwfw==",
-            "dev": 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
-        },
-        "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
-        },
-        "node_modules/accepts": {
-            "version": "1.3.7",
-            "resolved": "https://registry.npmjs.org/accepts/-/accepts-1.3.7.tgz",
-            "integrity": "sha512-Il80Qs2WjYlJIBNzNkK6KYqlVMTbZLXgHx2oT0pU/fjRHyEp+PEfEPY0R3WCwAGVOtauxh1hOxNgIf5bv7dQpA==",
-            "dev": true,
-            "dependencies": {
-                "mime-types": "~2.1.24",
-                "negotiator": "0.6.2"
-            },
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/acorn": {
-            "version": "8.1.0",
-            "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.1.0.tgz",
-            "integrity": "sha512-LWCF/Wn0nfHOmJ9rzQApGnxnvgfROzGilS8936rqN/lfcYkY9MYZzdMqN+2NJ4SlTc+m5HiSa+kNfDtI64dwUA==",
-            "dev": true,
-            "bin": {
-                "acorn": "bin/acorn"
-            },
-            "engines": {
-                "node": ">=0.4.0"
-            }
-        },
-        "node_modules/acorn-jsx": {
-            "version": "5.3.1",
-            "resolved": "https://registry.npmjs.org/acorn-jsx/-/acorn-jsx-5.3.1.tgz",
-            "integrity": "sha512-K0Ptm/47OKfQRpNQ2J/oIN/3QYiK6FwW+eJbILhsdxh2WTLdl+30o8aGdTbm5JbffpFFAg/g+zi1E+jvJha5ng==",
-            "dev": true
-        },
-        "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,
-            "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"
-            }
-        },
-        "node_modules/ajv-errors": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/ajv-errors/-/ajv-errors-1.0.1.tgz",
-            "integrity": "sha512-DCRfO/4nQ+89p/RK43i8Ezd41EqdGIU4ld7nGF8OQ14oc/we5rEntLCUa7+jrn3nn83BosfwZA0wb4pon2o8iQ==",
-            "dev": true
-        },
-        "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
-        },
-        "node_modules/ansi-colors": {
-            "version": "4.1.1",
-            "resolved": "https://registry.npmjs.org/ansi-colors/-/ansi-colors-4.1.1.tgz",
-            "integrity": "sha512-JoX0apGbHaUJBNl6yF+p6JAFYZ666/hhCGKN5t9QFjbJQKUU/g8MNbFDbvfrgKXvI1QpZplPOnwIo99lX/AAmA==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/ansi-html": {
-            "version": "0.0.7",
-            "resolved": "https://registry.npmjs.org/ansi-html/-/ansi-html-0.0.7.tgz",
-            "integrity": "sha1-gTWEAhliqenm/QOflA0S9WynhZ4=",
-            "dev": true,
-            "engines": [
-                "node >= 0.8.0"
-            ],
-            "bin": {
-                "ansi-html": "bin/ansi-html"
-            }
-        },
-        "node_modules/ansi-regex": {
-            "version": "5.0.0",
-            "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-5.0.0.tgz",
-            "integrity": "sha512-bY6fj56OUQ0hU1KjFNDQuJFezqKdrAyFdIevADiqrWHwSlbmBNMHp5ak2f40Pm8JTFyM2mqxkG6ngkHO11f/lg==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/ansi-styles": {
-            "version": "4.3.0",
-            "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-4.3.0.tgz",
-            "integrity": "sha512-zbB9rCJAT1rbjiVDb2hqKFHNYLxgtk8NURxZ3IZwD3F6NtxbXZQCnnSi1Lkx+IDohdPlFp222wVALIheZJQSEg==",
-            "dev": true,
-            "dependencies": {
-                "color-convert": "^2.0.1"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/anymatch": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-2.0.0.tgz",
-            "integrity": "sha512-5teOsQWABXHHBFP9y3skS5P3d/WfWXpv3FUpy+LorMrNYaT9pI4oLMQX7jzQ2KklNpGpWHzdCXTDT2Y3XGlZBw==",
-            "dev": true,
-            "dependencies": {
-                "micromatch": "^3.1.4",
-                "normalize-path": "^2.1.1"
-            }
-        },
-        "node_modules/anymatch/node_modules/braces": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-            "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/braces/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/fill-range": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-            "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-            "dev": true,
-            "dependencies": {
-                "extend-shallow": "^2.0.1",
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1",
-                "to-regex-range": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/fill-range/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/is-number": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-            "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/is-number/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/micromatch": {
-            "version": "3.1.10",
-            "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
-            "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/normalize-path": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-2.1.1.tgz",
-            "integrity": "sha1-GrKLVW4Zg2Oowab35vogE3/mrtk=",
-            "dev": true,
-            "dependencies": {
-                "remove-trailing-separator": "^1.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/anymatch/node_modules/to-regex-range": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-            "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-            "dev": true,
-            "dependencies": {
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/argparse": {
-            "version": "1.0.10",
-            "resolved": "https://registry.npmjs.org/argparse/-/argparse-1.0.10.tgz",
-            "integrity": "sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==",
-            "dev": true,
-            "dependencies": {
-                "sprintf-js": "~1.0.2"
-            }
-        },
-        "node_modules/arr-diff": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/arr-diff/-/arr-diff-4.0.0.tgz",
-            "integrity": "sha1-1kYQdP6/7HHn4VI1dhoyml3HxSA=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/arr-flatten": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/arr-flatten/-/arr-flatten-1.1.0.tgz",
-            "integrity": "sha512-L3hKV5R/p5o81R7O02IGnwpDmkp6E982XhtbuwSe3O4qOtMMMtodicASA1Cny2U+aCXcNpml+m4dPsvsJ3jatg==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/arr-union": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/arr-union/-/arr-union-3.1.0.tgz",
-            "integrity": "sha1-45sJrqne+Gao8gbiiK9jkZuuOcQ=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/array-flatten": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/array-flatten/-/array-flatten-2.1.2.tgz",
-            "integrity": "sha512-hNfzcOV8W4NdualtqBFPyVO+54DSJuZGY9qT4pRroB6S9e3iiido2ISIC5h9R2sPJ8H3FHCIiEnsv1lPXO3KtQ==",
-            "dev": true
-        },
-        "node_modules/array-union": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/array-union/-/array-union-2.1.0.tgz",
-            "integrity": "sha512-HGyxoOTYUyCM6stUe6EJgnd4EoewAI7zMdfqO+kGjnlZmBDz/cR5pf8r/cR4Wq60sL/p0IkcjUEEPwS3GFrIyw==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/array-uniq": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/array-uniq/-/array-uniq-1.0.3.tgz",
-            "integrity": "sha1-r2rId6Jcx/dOBYiUdThY39sk/bY=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/array-unique": {
-            "version": "0.3.2",
-            "resolved": "https://registry.npmjs.org/array-unique/-/array-unique-0.3.2.tgz",
-            "integrity": "sha1-qJS3XUvE9s1nnvMkSp/Y9Gri1Cg=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/assign-symbols": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/assign-symbols/-/assign-symbols-1.0.0.tgz",
-            "integrity": "sha1-WWZ/QfrdTyDMvCu5a41Pf3jsA2c=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/astral-regex": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/astral-regex/-/astral-regex-2.0.0.tgz",
-            "integrity": "sha512-Z7tMw1ytTXt5jqMcOP+OQteU1VuNK9Y02uuJtKQ1Sv69jXQKKg5cibLwGJow8yzZP+eAc18EmLGPal0bp36rvQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/async": {
-            "version": "2.6.3",
-            "resolved": "https://registry.npmjs.org/async/-/async-2.6.3.tgz",
-            "integrity": "sha512-zflvls11DCy+dQWzTW2dzuilv8Z5X/pjfmZOWba6TNIVDm+2UDaJmXSOXlasHKfNBs8oo3M0aT50fDEWfKZjXg==",
-            "dev": true,
-            "dependencies": {
-                "lodash": "^4.17.14"
-            }
-        },
-        "node_modules/async-each": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/async-each/-/async-each-1.0.3.tgz",
-            "integrity": "sha512-z/WhQ5FPySLdvREByI2vZiTWwCnF0moMJ1hK9YQwDTHKh6I7/uSckMetoRGb5UBZPC1z0jlw+n/XCgjeH7y1AQ==",
-            "dev": true
-        },
-        "node_modules/async-limiter": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/async-limiter/-/async-limiter-1.0.1.tgz",
-            "integrity": "sha512-csOlWGAcRFJaI6m+F2WKdnMKr4HhdhFVBk0H/QbJFMCr+uO2kwohwXQPxw/9OCxp05r5ghVBFSyioixx3gfkNQ==",
-            "dev": true
-        },
-        "node_modules/atob": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/atob/-/atob-2.1.2.tgz",
-            "integrity": "sha512-Wm6ukoaOGJi/73p/cl2GvLjTI5JM1k/O14isD73YML8StrH/7/lRFgmg8nICZgD3bZZvjwCGxtMOD3wWNAu8cg==",
-            "dev": true,
-            "bin": {
-                "atob": "bin/atob.js"
-            },
-            "engines": {
-                "node": ">= 4.5.0"
-            }
-        },
-        "node_modules/babel-loader": {
-            "version": "8.2.2",
-            "resolved": "https://registry.npmjs.org/babel-loader/-/babel-loader-8.2.2.tgz",
-            "integrity": "sha512-JvTd0/D889PQBtUXJ2PXaKU/pjZDMtHA9V2ecm+eNRmmBCMR09a+fmpGTNwnJtFmFl5Ei7Vy47LjBb+L0wQ99g==",
-            "dev": true,
-            "dependencies": {
-                "find-cache-dir": "^3.3.1",
-                "loader-utils": "^1.4.0",
-                "make-dir": "^3.1.0",
-                "schema-utils": "^2.6.5"
-            },
-            "engines": {
-                "node": ">= 8.9"
-            }
-        },
-        "node_modules/babel-loader/node_modules/json5": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/json5/-/json5-1.0.1.tgz",
-            "integrity": "sha512-aKS4WQjPenRxiQsC93MNfjx+nbF4PAdYzmd/1JIj8HYzqfbu86beTuNgXDzPknWk0n0uARlyewZo4s++ES36Ow==",
-            "dev": true,
-            "dependencies": {
-                "minimist": "^1.2.0"
-            },
-            "bin": {
-                "json5": "lib/cli.js"
-            }
-        },
-        "node_modules/babel-loader/node_modules/loader-utils": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/loader-utils/-/loader-utils-1.4.0.tgz",
-            "integrity": "sha512-qH0WSMBtn/oHuwjy/NucEgbx5dbxxnxup9s4PVXJUDHZBQY+s0NWA9rJf53RBnQZxfch7euUui7hpoAPvALZdA==",
-            "dev": true,
-            "dependencies": {
-                "big.js": "^5.2.2",
-                "emojis-list": "^3.0.0",
-                "json5": "^1.0.1"
-            },
-            "engines": {
-                "node": ">=4.0.0"
-            }
-        },
-        "node_modules/babel-loader/node_modules/make-dir": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-3.1.0.tgz",
-            "integrity": "sha512-g3FeP20LNwhALb/6Cz6Dd4F2ngze0jz7tbzrD2wAV+o9FeNHe4rL+yK2md0J/fiSf1sa1ADhXqi5+oVwOM/eGw==",
-            "dev": true,
-            "dependencies": {
-                "semver": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/babel-loader/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/babel-plugin-dynamic-import-node": {
-            "version": "2.3.3",
-            "resolved": "https://registry.npmjs.org/babel-plugin-dynamic-import-node/-/babel-plugin-dynamic-import-node-2.3.3.tgz",
-            "integrity": "sha512-jZVI+s9Zg3IqA/kdi0i6UDCybUI3aSBLnglhYbSSjKlV7yF1F/5LWv8MakQmvYpnbJDS6fcBL2KzHSxNCMtWSQ==",
-            "dev": true,
-            "dependencies": {
-                "object.assign": "^4.1.0"
-            }
-        },
-        "node_modules/babel-plugin-polyfill-corejs2": {
-            "version": "0.1.10",
-            "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.1.10.tgz",
-            "integrity": "sha512-DO95wD4g0A8KRaHKi0D51NdGXzvpqVLnLu5BTvDlpqUEpTmeEtypgC1xqesORaWmiUOQI14UHKlzNd9iZ2G3ZA==",
-            "dev": true,
-            "dependencies": {
-                "@babel/compat-data": "^7.13.0",
-                "@babel/helper-define-polyfill-provider": "^0.1.5",
-                "semver": "^6.1.1"
-            }
-        },
-        "node_modules/babel-plugin-polyfill-corejs2/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/babel-plugin-polyfill-corejs3": {
-            "version": "0.1.7",
-            "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.1.7.tgz",
-            "integrity": "sha512-u+gbS9bbPhZWEeyy1oR/YaaSpod/KDT07arZHb80aTpl8H5ZBq+uN1nN9/xtX7jQyfLdPfoqI4Rue/MQSWJquw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-define-polyfill-provider": "^0.1.5",
-                "core-js-compat": "^3.8.1"
-            }
-        },
-        "node_modules/babel-plugin-polyfill-regenerator": {
-            "version": "0.1.6",
-            "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.1.6.tgz",
-            "integrity": "sha512-OUrYG9iKPKz8NxswXbRAdSwF0GhRdIEMTloQATJi4bDuFqrXaXcCUT/VGNrr8pBcjMh1RxZ7Xt9cytVJTJfvMg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/helper-define-polyfill-provider": "^0.1.5"
-            }
-        },
-        "node_modules/balanced-match": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.0.tgz",
-            "integrity": "sha1-ibTRmasr7kneFk6gK4nORi1xt2c=",
-            "dev": true
-        },
-        "node_modules/base": {
-            "version": "0.11.2",
-            "resolved": "https://registry.npmjs.org/base/-/base-0.11.2.tgz",
-            "integrity": "sha512-5T6P4xPgpp0YDFvSWwEZ4NoE3aM4QBQXDzmVbraCkFj8zHM+mba8SyqB5DbZWyR7mYHo6Y7BdQo3MoA4m0TeQg==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/base/node_modules/define-property": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
-            "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/base/node_modules/is-accessor-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-            "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/base/node_modules/is-data-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-            "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/base/node_modules/is-descriptor": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-            "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-            "dev": true,
-            "dependencies": {
-                "is-accessor-descriptor": "^1.0.0",
-                "is-data-descriptor": "^1.0.0",
-                "kind-of": "^6.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/batch": {
-            "version": "0.6.1",
-            "resolved": "https://registry.npmjs.org/batch/-/batch-0.6.1.tgz",
-            "integrity": "sha1-3DQxT05nkxgJP8dgJyUl+UvyXBY=",
-            "dev": true
-        },
-        "node_modules/big.js": {
-            "version": "5.2.2",
-            "resolved": "https://registry.npmjs.org/big.js/-/big.js-5.2.2.tgz",
-            "integrity": "sha512-vyL2OymJxmarO8gxMr0mhChsO9QGwhynfuu4+MHTAW6czfq9humCB7rKpUjDd9YUiDPU4mzpyupFSvOClAwbmQ==",
-            "dev": true,
-            "engines": {
-                "node": "*"
-            }
-        },
-        "node_modules/binary-extensions": {
-            "version": "1.13.1",
-            "resolved": "https://registry.npmjs.org/binary-extensions/-/binary-extensions-1.13.1.tgz",
-            "integrity": "sha512-Un7MIEDdUC5gNpcGDV97op1Ywk748MpHcFTHoYs6qnj1Z3j7I53VG3nwZhKzoBZmbdRNnb6WRdFlwl7tSDuZGw==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/bindings": {
-            "version": "1.5.0",
-            "resolved": "https://registry.npmjs.org/bindings/-/bindings-1.5.0.tgz",
-            "integrity": "sha512-p2q/t/mhvuOj/UeLlV6566GD/guowlr0hHxClI0W9m7MWYkL1F0hLo+0Aexs9HSPCtR1SXQ0TD3MMKrXZajbiQ==",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "file-uri-to-path": "1.0.0"
-            }
-        },
-        "node_modules/body-parser": {
-            "version": "1.19.0",
-            "resolved": "https://registry.npmjs.org/body-parser/-/body-parser-1.19.0.tgz",
-            "integrity": "sha512-dhEPs72UPbDnAQJ9ZKMNTP6ptJaionhP5cBb541nXPlW60Jepo9RV/a4fX4XWW9CuFNK22krhrj1+rgzifNCsw==",
-            "dev": true,
-            "dependencies": {
-                "bytes": "3.1.0",
-                "content-type": "~1.0.4",
-                "debug": "2.6.9",
-                "depd": "~1.1.2",
-                "http-errors": "1.7.2",
-                "iconv-lite": "0.4.24",
-                "on-finished": "~2.3.0",
-                "qs": "6.7.0",
-                "raw-body": "2.4.0",
-                "type-is": "~1.6.17"
-            },
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/body-parser/node_modules/bytes": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.0.tgz",
-            "integrity": "sha512-zauLjrfCG+xvoyaqLoV8bLVXXNGC4JqlxFCutSDWA6fJrTo2ZuvLYTqZ7aHBLZSMOopbzwv8f+wZcVzfVTI2Dg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/body-parser/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/body-parser/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/bonjour": {
-            "version": "3.5.0",
-            "resolved": "https://registry.npmjs.org/bonjour/-/bonjour-3.5.0.tgz",
-            "integrity": "sha1-jokKGD2O6aI5OzhExpGkK897yfU=",
-            "dev": true,
-            "dependencies": {
-                "array-flatten": "^2.1.0",
-                "deep-equal": "^1.0.1",
-                "dns-equal": "^1.0.0",
-                "dns-txt": "^2.0.2",
-                "multicast-dns": "^6.0.1",
-                "multicast-dns-service-types": "^1.1.0"
-            }
-        },
-        "node_modules/brace-expansion": {
-            "version": "1.1.11",
-            "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.11.tgz",
-            "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==",
-            "dev": true,
-            "dependencies": {
-                "balanced-match": "^1.0.0",
-                "concat-map": "0.0.1"
-            }
-        },
-        "node_modules/braces": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.2.tgz",
-            "integrity": "sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==",
-            "dev": true,
-            "dependencies": {
-                "fill-range": "^7.0.1"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/browserslist": {
-            "version": "4.16.6",
-            "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.16.6.tgz",
-            "integrity": "sha512-Wspk/PqO+4W9qp5iUTJsa1B/QrYn1keNCcEP5OvP7WBwT4KaDly0uONYmC6Xa3Z5IqnUgS0KcgLYu1l74x0ZXQ==",
-            "dev": true,
-            "dependencies": {
-                "caniuse-lite": "^1.0.30001219",
-                "colorette": "^1.2.2",
-                "electron-to-chromium": "^1.3.723",
-                "escalade": "^3.1.1",
-                "node-releases": "^1.1.71"
-            },
-            "bin": {
-                "browserslist": "cli.js"
-            },
-            "engines": {
-                "node": "^6 || ^7 || ^8 || ^9 || ^10 || ^11 || ^12 || >=13.7"
-            }
-        },
-        "node_modules/browserslist/node_modules/colorette": {
-            "version": "1.2.2",
-            "resolved": "https://registry.npmjs.org/colorette/-/colorette-1.2.2.tgz",
-            "integrity": "sha512-MKGMzyfeuutC/ZJ1cba9NqcNpfeqMUcYmyF1ZFY6/Cn7CNSAKx6a+s48sqLqyAiZuaP2TcqMhoo+dlwFnVxT9w==",
-            "dev": true
-        },
-        "node_modules/buffer-from": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/buffer-from/-/buffer-from-1.1.1.tgz",
-            "integrity": "sha512-MQcXEUbCKtEo7bhqEs6560Hyd4XaovZlO/k9V3hjVUF/zwW7KBVdSK4gIt/bzwS9MbR5qob+F5jusZsb0YQK2A==",
-            "dev": true
-        },
-        "node_modules/buffer-indexof": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/buffer-indexof/-/buffer-indexof-1.1.1.tgz",
-            "integrity": "sha512-4/rOEg86jivtPTeOUUT61jJO1Ya1TrR/OkqCSZDyq84WJh3LuuiphBYJN+fm5xufIk4XAFcEwte/8WzC8If/1g==",
-            "dev": true
-        },
-        "node_modules/bytes": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.0.0.tgz",
-            "integrity": "sha1-0ygVQE1olpn4Wk6k+odV3ROpYEg=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/cache-base": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/cache-base/-/cache-base-1.0.1.tgz",
-            "integrity": "sha512-AKcdTnFSWATd5/GCPRxr2ChwIJ85CeyrEyjRHlKxQ56d4XJMGym0uAiKn0xbLOGOl3+yRpOTi484dVCEc5AUzQ==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/call-bind": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/call-bind/-/call-bind-1.0.2.tgz",
-            "integrity": "sha512-7O+FbCihrB5WGbFYesctwmTKae6rOiIzmz1icreWJ+0aA7LJfuqhEso2T9ncpcFtzMQtzXf2QGGueWJGTYsqrA==",
-            "dev": true,
-            "dependencies": {
-                "function-bind": "^1.1.1",
-                "get-intrinsic": "^1.0.2"
-            }
-        },
-        "node_modules/callsites": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/callsites/-/callsites-3.1.0.tgz",
-            "integrity": "sha512-P8BjAsXvZS+VIDUI11hHCQEv74YT67YUi5JJFNWIqL235sBmjX4+qx9Muvls5ivyNENctx46xQLQ3aTuE7ssaQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/camelcase": {
-            "version": "5.3.1",
-            "resolved": "https://registry.npmjs.org/camelcase/-/camelcase-5.3.1.tgz",
-            "integrity": "sha512-L28STB170nwWS63UjtlEOE3dldQApaJXZkOI1uMFfzf3rRuPegHaHesyee+YxQ+W6SvRDQV6UrdOdRiR153wJg==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/caniuse-lite": {
-            "version": "1.0.30001236",
-            "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001236.tgz",
-            "integrity": "sha512-o0PRQSrSCGJKCPZcgMzl5fUaj5xHe8qA2m4QRvnyY4e1lITqoNkr7q/Oh1NcpGSy0Th97UZ35yoKcINPoq7YOQ==",
-            "dev": true
-        },
-        "node_modules/chalk": {
-            "version": "4.1.0",
-            "resolved": "https://registry.npmjs.org/chalk/-/chalk-4.1.0.tgz",
-            "integrity": "sha512-qwx12AxXe2Q5xQ43Ac//I6v5aXTipYrSESdOgzrN+9XjgEpyjpKuvSGaN4qE93f7TQTlerQQ8S+EQ0EyDoVL1A==",
-            "dev": true,
-            "dependencies": {
-                "ansi-styles": "^4.1.0",
-                "supports-color": "^7.1.0"
-            },
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/chokidar": {
-            "version": "3.5.1",
-            "resolved": "https://registry.npmjs.org/chokidar/-/chokidar-3.5.1.tgz",
-            "integrity": "sha512-9+s+Od+W0VJJzawDma/gvBNQqkTiqYTWLuZoyAsivsI4AaWTCzHG06/TMjsf1cYe9Cb97UCEhjz7HvnPk2p/tw==",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "anymatch": "~3.1.1",
-                "braces": "~3.0.2",
-                "fsevents": "~2.3.1",
-                "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"
-            },
-            "engines": {
-                "node": ">= 8.10.0"
-            }
-        },
-        "node_modules/chokidar/node_modules/anymatch": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-3.1.1.tgz",
-            "integrity": "sha512-mM8522psRCqzV+6LhomX5wgp25YVibjh8Wj23I5RPkPppSVSjyKD2A2mBJmWGa+KN7f2D6LNh9jkBCeyLktzjg==",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "normalize-path": "^3.0.0",
-                "picomatch": "^2.0.4"
-            },
-            "engines": {
-                "node": ">= 8"
-            }
-        },
-        "node_modules/chokidar/node_modules/binary-extensions": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/binary-extensions/-/binary-extensions-2.2.0.tgz",
-            "integrity": "sha512-jDctJ/IVQbZoJykoeHbhXpOlNBqGNcwXJKJog42E5HDPUwQTSdjCHdihjj0DlnheQ7blbT6dHOafNAiS8ooQKA==",
-            "dev": true,
-            "optional": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/chokidar/node_modules/is-binary-path": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-2.1.0.tgz",
-            "integrity": "sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "binary-extensions": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/chokidar/node_modules/readdirp": {
-            "version": "3.5.0",
-            "resolved": "https://registry.npmjs.org/readdirp/-/readdirp-3.5.0.tgz",
-            "integrity": "sha512-cMhu7c/8rdhkHXWsY+osBhfSy0JikwpHK/5+imo+LpeasTF8ouErHrlYkwT0++njiyuDvc7OFY5T3ukvZ8qmFQ==",
-            "dev": true,
-            "optional": true,
-            "dependencies": {
-                "picomatch": "^2.2.1"
-            },
-            "engines": {
-                "node": ">=8.10.0"
-            }
-        },
-        "node_modules/chrome-trace-event": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/chrome-trace-event/-/chrome-trace-event-1.0.2.tgz",
-            "integrity": "sha512-9e/zx1jw7B4CO+c/RXoCsfg/x1AfUBioy4owYH0bJprEYAx5hRFLRhWBqHAG57D0ZM4H7vxbP7bPe0VwhQRYDQ==",
-            "dev": true,
-            "dependencies": {
-                "tslib": "^1.9.0"
-            },
-            "engines": {
-                "node": ">=6.0"
-            }
-        },
-        "node_modules/class-utils": {
-            "version": "0.3.6",
-            "resolved": "https://registry.npmjs.org/class-utils/-/class-utils-0.3.6.tgz",
-            "integrity": "sha512-qOhPa/Fj7s6TY8H8esGu5QNpMMQxz79h+urzrNYN6mn+9BnxlDGf5QZ+XeCDsxSjPqsSR56XOZOJmpeurnLMeg==",
-            "dev": true,
-            "dependencies": {
-                "arr-union": "^3.1.0",
-                "define-property": "^0.2.5",
-                "isobject": "^3.0.0",
-                "static-extend": "^0.1.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/class-utils/node_modules/define-property": {
-            "version": "0.2.5",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-            "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/cliui": {
-            "version": "5.0.0",
-            "resolved": "https://registry.npmjs.org/cliui/-/cliui-5.0.0.tgz",
-            "integrity": "sha512-PYeGSEmmHM6zvoef2w8TPzlrnNpXIjTipYK780YswmIP9vjxmd6Y2a3CB2Ks6/AU8NHjZugXvo8w3oWM2qnwXA==",
-            "dev": true,
-            "dependencies": {
-                "string-width": "^3.1.0",
-                "strip-ansi": "^5.2.0",
-                "wrap-ansi": "^5.1.0"
-            }
-        },
-        "node_modules/cliui/node_modules/ansi-regex": {
-            "version": "4.1.0",
-            "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
-            "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/cliui/node_modules/emoji-regex": {
-            "version": "7.0.3",
-            "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
-            "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
-            "dev": true
-        },
-        "node_modules/cliui/node_modules/is-fullwidth-code-point": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
-            "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/cliui/node_modules/string-width": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
-            "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
-            "dev": true,
-            "dependencies": {
-                "emoji-regex": "^7.0.1",
-                "is-fullwidth-code-point": "^2.0.0",
-                "strip-ansi": "^5.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/cliui/node_modules/strip-ansi": {
-            "version": "5.2.0",
-            "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
-            "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
-            "dev": true,
-            "dependencies": {
-                "ansi-regex": "^4.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "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/collection-visit": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/collection-visit/-/collection-visit-1.0.0.tgz",
-            "integrity": "sha1-S8A3PBZLwykbTTaMgpzxqApZ3KA=",
-            "dev": true,
-            "dependencies": {
-                "map-visit": "^1.0.0",
-                "object-visit": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/color-convert": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-2.0.1.tgz",
-            "integrity": "sha512-RRECPsj7iu/xb5oKYcsFHSppFNnsj/52OVTRKb4zP5onXwVF3zVmmToNcOfGC+CRDpfK/U584fMg38ZHCaElKQ==",
-            "dev": true,
-            "dependencies": {
-                "color-name": "~1.1.4"
-            },
-            "engines": {
-                "node": ">=7.0.0"
-            }
-        },
-        "node_modules/color-name": {
-            "version": "1.1.4",
-            "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.4.tgz",
-            "integrity": "sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA==",
-            "dev": true
-        },
-        "node_modules/colorette": {
-            "version": "1.2.1",
-            "resolved": "https://registry.npmjs.org/colorette/-/colorette-1.2.1.tgz",
-            "integrity": "sha512-puCDz0CzydiSYOrnXpz/PKd69zRrribezjtE9yd4zvytoRc8+RY/KJPvtPFKZS3E3wP6neGyMe0vOTlHO5L3Pw==",
-            "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
-        },
-        "node_modules/commondir": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/commondir/-/commondir-1.0.1.tgz",
-            "integrity": "sha1-3dgA2gxmEnOTzKWVDqloo6rxJTs=",
-            "dev": true
-        },
-        "node_modules/complex.js": {
-            "version": "2.0.12",
-            "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.0.12.tgz",
-            "integrity": "sha512-oQX99fwL6LrTVg82gDY1dIWXy6qZRnRL35N+YhIX0N7tSwsa0KFy6IEMHTNuCW4mP7FS7MEqZ/2I/afzYwPldw==",
-            "engines": {
-                "node": "*"
-            }
-        },
-        "node_modules/component-emitter": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/component-emitter/-/component-emitter-1.3.0.tgz",
-            "integrity": "sha512-Rd3se6QB+sO1TwqZjscQrurpEPIfO0/yYnSin6Q/rD3mOutHvUrCAhJub3r90uNb+SESBuE0QYoB90YdfatsRg==",
-            "dev": true
-        },
-        "node_modules/compressible": {
-            "version": "2.0.18",
-            "resolved": "https://registry.npmjs.org/compressible/-/compressible-2.0.18.tgz",
-            "integrity": "sha512-AF3r7P5dWxL8MxyITRMlORQNaOA2IkAFaTr4k7BUumjPtRpGDTZpl0Pb1XCO6JeDCBdp126Cgs9sMxqSjgYyRg==",
-            "dev": true,
-            "dependencies": {
-                "mime-db": ">= 1.43.0 < 2"
-            },
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/compression": {
-            "version": "1.7.4",
-            "resolved": "https://registry.npmjs.org/compression/-/compression-1.7.4.tgz",
-            "integrity": "sha512-jaSIDzP9pZVS4ZfQ+TzvtiWhdpFhE2RDHz8QJkpX9SIpLq88VueF5jJw6t+6CUQcAoA6t+x89MLrWAqpfDE8iQ==",
-            "dev": true,
-            "dependencies": {
-                "accepts": "~1.3.5",
-                "bytes": "3.0.0",
-                "compressible": "~2.0.16",
-                "debug": "2.6.9",
-                "on-headers": "~1.0.2",
-                "safe-buffer": "5.1.2",
-                "vary": "~1.1.2"
-            },
-            "engines": {
-                "node": ">= 0.8.0"
-            }
-        },
-        "node_modules/compression/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/compression/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/compression/node_modules/safe-buffer": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-            "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-            "dev": true
-        },
-        "node_modules/concat-map": {
-            "version": "0.0.1",
-            "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz",
-            "integrity": "sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=",
-            "dev": true
-        },
-        "node_modules/connect-history-api-fallback": {
-            "version": "1.6.0",
-            "resolved": "https://registry.npmjs.org/connect-history-api-fallback/-/connect-history-api-fallback-1.6.0.tgz",
-            "integrity": "sha512-e54B99q/OUoH64zYYRf3HBP5z24G38h5D3qXu23JGRoigpX5Ss4r9ZnDk3g0Z8uQC2x2lPaJ+UlWBc1ZWBWdLg==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.8"
-            }
-        },
-        "node_modules/content-disposition": {
-            "version": "0.5.3",
-            "resolved": "https://registry.npmjs.org/content-disposition/-/content-disposition-0.5.3.tgz",
-            "integrity": "sha512-ExO0774ikEObIAEV9kDo50o+79VCUdEB6n6lzKgGwupcVeRlhrj3qGAfwq8G6uBJjkqLrhT0qEYFcWng8z1z0g==",
-            "dev": true,
-            "dependencies": {
-                "safe-buffer": "5.1.2"
-            },
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/content-disposition/node_modules/safe-buffer": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-            "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-            "dev": true
-        },
-        "node_modules/content-type": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/content-type/-/content-type-1.0.4.tgz",
-            "integrity": "sha512-hIP3EEPs8tB9AT1L+NUqtwOAps4mk2Zob89MWXMHjHWg9milF/j4osnnQLXBCBFBk/tvIG/tUc9mOUJiPBhPXA==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/convert-source-map": {
-            "version": "1.7.0",
-            "resolved": "https://registry.npmjs.org/convert-source-map/-/convert-source-map-1.7.0.tgz",
-            "integrity": "sha512-4FJkXzKXEDB1snCFZlLP4gpC3JILicCpGbzG9f9G7tGqGCzETQ2hWPrcinA9oU4wtf2biUaEH5065UnMeR33oA==",
-            "dev": true,
-            "dependencies": {
-                "safe-buffer": "~5.1.1"
-            }
-        },
-        "node_modules/convert-source-map/node_modules/safe-buffer": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-            "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-            "dev": true
-        },
-        "node_modules/cookie": {
-            "version": "0.4.0",
-            "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.4.0.tgz",
-            "integrity": "sha512-+Hp8fLp57wnUSt0tY0tHEXh4voZRDnoIrZPqlo3DPiI4y9lwg/jqx+1Om94/W6ZaPDOUbnjOt/99w66zk+l1Xg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/cookie-signature": {
-            "version": "1.0.6",
-            "resolved": "https://registry.npmjs.org/cookie-signature/-/cookie-signature-1.0.6.tgz",
-            "integrity": "sha1-4wOogrNCzD7oylE6eZmXNNqzriw=",
-            "dev": true
-        },
-        "node_modules/copy-descriptor": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/copy-descriptor/-/copy-descriptor-0.1.1.tgz",
-            "integrity": "sha1-Z29us8OZl8LuGsOpJP1hJHSPV40=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/core-js-compat": {
-            "version": "3.9.1",
-            "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.9.1.tgz",
-            "integrity": "sha512-jXAirMQxrkbiiLsCx9bQPJFA6llDadKMpYrBJQJ3/c4/vsPP/fAf29h24tviRlvwUL6AmY5CHLu2GvjuYviQqA==",
-            "dev": true,
-            "dependencies": {
-                "browserslist": "^4.16.3",
-                "semver": "7.0.0"
-            }
-        },
-        "node_modules/core-js-compat/node_modules/semver": {
-            "version": "7.0.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-7.0.0.tgz",
-            "integrity": "sha512-+GB6zVA9LWh6zovYQLALHwv5rb2PHGlJi3lfiqIHxR0uuwCgefcOJc59v9fv1w8GbStwxuuqqAjI9NMAOOgq1A==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/core-util-is": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/core-util-is/-/core-util-is-1.0.2.tgz",
-            "integrity": "sha1-tf1UIgqivFq1eqtxQMlAdUUDwac=",
-            "dev": 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/dagre": {
-            "version": "0.8.5",
-            "resolved": "https://registry.npmjs.org/dagre/-/dagre-0.8.5.tgz",
-            "integrity": "sha512-/aTqmnRta7x7MCCpExk7HQL2O4owCT2h8NT//9I1OQ9vt29Pa0BzSAkR5lwFUcQ7491yVi/3CXU9jQ5o0Mn2Sw==",
-            "dependencies": {
-                "graphlib": "^2.1.8",
-                "lodash": "^4.17.15"
-            }
-        },
-        "node_modules/debug": {
-            "version": "4.3.1",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-4.3.1.tgz",
-            "integrity": "sha512-doEwdvm4PCeK4K3RQN2ZC2BYUBaxwLARCqZmMjtF8a51J2Rb0xpVloFRnCODwqjpwnAoao4pelN8l3RJdv3gRQ==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.1.2"
-            },
-            "engines": {
-                "node": ">=6.0"
-            }
-        },
-        "node_modules/decamelize": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/decamelize/-/decamelize-1.2.0.tgz",
-            "integrity": "sha1-9lNNFRSCabIDUue+4m9QH5oZEpA=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/decimal.js": {
-            "version": "10.2.1",
-            "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.2.1.tgz",
-            "integrity": "sha512-KaL7+6Fw6i5A2XSnsbhm/6B+NuEA7TZ4vqxnd5tXz9sbKtrN9Srj8ab4vKVdK8YAqZO9P1kg45Y6YLoduPf+kw=="
-        },
-        "node_modules/decode-uri-component": {
-            "version": "0.2.0",
-            "resolved": "https://registry.npmjs.org/decode-uri-component/-/decode-uri-component-0.2.0.tgz",
-            "integrity": "sha1-6zkTMzRYd1y4TNGh+uBiEGu4dUU=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10"
-            }
-        },
-        "node_modules/deep-equal": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/deep-equal/-/deep-equal-1.1.1.tgz",
-            "integrity": "sha512-yd9c5AdiqVcR+JjcwUQb9DkhJc8ngNr0MahEBGvDiJw8puWab2yZlh+nkasOnZP+EGTAP6rRp2JzJhJZzvNF8g==",
-            "dev": true,
-            "dependencies": {
-                "is-arguments": "^1.0.4",
-                "is-date-object": "^1.0.1",
-                "is-regex": "^1.0.4",
-                "object-is": "^1.0.1",
-                "object-keys": "^1.1.1",
-                "regexp.prototype.flags": "^1.2.0"
-            }
-        },
-        "node_modules/deep-is": {
-            "version": "0.1.3",
-            "resolved": "https://registry.npmjs.org/deep-is/-/deep-is-0.1.3.tgz",
-            "integrity": "sha1-s2nW+128E+7PUk+RsHD+7cNXzzQ=",
-            "dev": true
-        },
-        "node_modules/default-gateway": {
-            "version": "4.2.0",
-            "resolved": "https://registry.npmjs.org/default-gateway/-/default-gateway-4.2.0.tgz",
-            "integrity": "sha512-h6sMrVB1VMWVrW13mSc6ia/DwYYw5MN6+exNu1OaJeFac5aSAvwM7lZ0NVfTABuSkQelr4h5oebg3KB1XPdjgA==",
-            "dev": true,
-            "dependencies": {
-                "execa": "^1.0.0",
-                "ip-regex": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/default-gateway/node_modules/cross-spawn": {
-            "version": "6.0.5",
-            "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-6.0.5.tgz",
-            "integrity": "sha512-eTVLrBSt7fjbDygz805pMnstIs2VTBNkRm0qxZd+M7A5XDdxVRWO5MxGBXZhjY4cqLYLdtrGqRf8mBPmzwSpWQ==",
-            "dev": true,
-            "dependencies": {
-                "nice-try": "^1.0.4",
-                "path-key": "^2.0.1",
-                "semver": "^5.5.0",
-                "shebang-command": "^1.2.0",
-                "which": "^1.2.9"
-            },
-            "engines": {
-                "node": ">=4.8"
-            }
-        },
-        "node_modules/default-gateway/node_modules/execa": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/execa/-/execa-1.0.0.tgz",
-            "integrity": "sha512-adbxcyWV46qiHyvSp50TKt05tB4tK3HcmF7/nxfAdhnox83seTDbwnaqKO4sXRy7roHAIFqJP/Rw/AuEbX61LA==",
-            "dev": true,
-            "dependencies": {
-                "cross-spawn": "^6.0.0",
-                "get-stream": "^4.0.0",
-                "is-stream": "^1.1.0",
-                "npm-run-path": "^2.0.0",
-                "p-finally": "^1.0.0",
-                "signal-exit": "^3.0.0",
-                "strip-eof": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/default-gateway/node_modules/get-stream": {
-            "version": "4.1.0",
-            "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-4.1.0.tgz",
-            "integrity": "sha512-GMat4EJ5161kIy2HevLlr4luNjBgvmj413KaQA7jt4V8B4RDsfpHk7WQ9GVqfYyyx8OS/L66Kox+rJRNklLK7w==",
-            "dev": true,
-            "dependencies": {
-                "pump": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/default-gateway/node_modules/is-stream": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/is-stream/-/is-stream-1.1.0.tgz",
-            "integrity": "sha1-EtSj3U5o4Lec6428hBc66A2RykQ=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/default-gateway/node_modules/npm-run-path": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/npm-run-path/-/npm-run-path-2.0.2.tgz",
-            "integrity": "sha1-NakjLfo11wZ7TLLd8jV7GHFTbF8=",
-            "dev": true,
-            "dependencies": {
-                "path-key": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/default-gateway/node_modules/path-key": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/path-key/-/path-key-2.0.1.tgz",
-            "integrity": "sha1-QRyttXTFoUDTpLGRDUDYDMn0C0A=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/default-gateway/node_modules/semver": {
-            "version": "5.7.1",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-5.7.1.tgz",
-            "integrity": "sha512-sauaDf/PZdVgrLTNYHRtpXa1iRiKcaebiKQ1BJdpQlWH2lCvexQdX55snPFyK7QzpudqbCI0qXFfOasHdyNDGQ==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver"
-            }
-        },
-        "node_modules/default-gateway/node_modules/shebang-command": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/shebang-command/-/shebang-command-1.2.0.tgz",
-            "integrity": "sha1-RKrGW2lbAzmJaMOfNj/uXer98eo=",
-            "dev": true,
-            "dependencies": {
-                "shebang-regex": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/default-gateway/node_modules/shebang-regex": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/shebang-regex/-/shebang-regex-1.0.0.tgz",
-            "integrity": "sha1-2kL0l0DAtC2yypcoVxyxkMmO/qM=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/default-gateway/node_modules/which": {
-            "version": "1.3.1",
-            "resolved": "https://registry.npmjs.org/which/-/which-1.3.1.tgz",
-            "integrity": "sha512-HxJdYWq1MTIQbJ3nw0cqssHoTNU267KlrDuGZ1WYlxDStUtKUhOaJmh112/TZmHxxUfuJqPXSOm7tDyas0OSIQ==",
-            "dev": true,
-            "dependencies": {
-                "isexe": "^2.0.0"
-            },
-            "bin": {
-                "which": "bin/which"
-            }
-        },
-        "node_modules/define-properties": {
-            "version": "1.1.3",
-            "resolved": "https://registry.npmjs.org/define-properties/-/define-properties-1.1.3.tgz",
-            "integrity": "sha512-3MqfYKj2lLzdMSf8ZIZE/V+Zuy+BgD6f164e8K2w7dgnpKArBDerGYpM46IYYcjnkdPNMjPk9A6VFB8+3SKlXQ==",
-            "dev": true,
-            "dependencies": {
-                "object-keys": "^1.0.12"
-            },
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/define-property": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-2.0.2.tgz",
-            "integrity": "sha512-jwK2UV4cnPpbcG7+VRARKTZPUWowwXA8bzH5NP6ud0oeAxyYPuGZUAC7hMugpCdz4BeSZl2Dl9k66CHJ/46ZYQ==",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^1.0.2",
-                "isobject": "^3.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/define-property/node_modules/is-accessor-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-            "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/define-property/node_modules/is-data-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-            "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/define-property/node_modules/is-descriptor": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-            "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-            "dev": true,
-            "dependencies": {
-                "is-accessor-descriptor": "^1.0.0",
-                "is-data-descriptor": "^1.0.0",
-                "kind-of": "^6.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/del": {
-            "version": "4.1.1",
-            "resolved": "https://registry.npmjs.org/del/-/del-4.1.1.tgz",
-            "integrity": "sha512-QwGuEUouP2kVwQenAsOof5Fv8K9t3D8Ca8NxcXKrIpEHjTXK5J2nXLdP+ALI1cgv8wj7KuwBhTwBkOZSJKM5XQ==",
-            "dev": true,
-            "dependencies": {
-                "@types/glob": "^7.1.1",
-                "globby": "^6.1.0",
-                "is-path-cwd": "^2.0.0",
-                "is-path-in-cwd": "^2.0.0",
-                "p-map": "^2.0.0",
-                "pify": "^4.0.1",
-                "rimraf": "^2.6.3"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/del/node_modules/array-union": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/array-union/-/array-union-1.0.2.tgz",
-            "integrity": "sha1-mjRBDk9OPaI96jdb5b5w8kd47Dk=",
-            "dev": true,
-            "dependencies": {
-                "array-uniq": "^1.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/del/node_modules/globby": {
-            "version": "6.1.0",
-            "resolved": "https://registry.npmjs.org/globby/-/globby-6.1.0.tgz",
-            "integrity": "sha1-9abXDoOV4hyFj7BInWTfAkJNUGw=",
-            "dev": true,
-            "dependencies": {
-                "array-union": "^1.0.1",
-                "glob": "^7.0.3",
-                "object-assign": "^4.0.1",
-                "pify": "^2.0.0",
-                "pinkie-promise": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/del/node_modules/globby/node_modules/pify": {
-            "version": "2.3.0",
-            "resolved": "https://registry.npmjs.org/pify/-/pify-2.3.0.tgz",
-            "integrity": "sha1-7RQaasBDqEnqWISY59yosVMw6Qw=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/del/node_modules/rimraf": {
-            "version": "2.7.1",
-            "resolved": "https://registry.npmjs.org/rimraf/-/rimraf-2.7.1.tgz",
-            "integrity": "sha512-uWjbaKIK3T1OSVptzX7Nl6PvQ3qAGtKEtVRjRuazjfL3Bx5eI409VZSqgND+4UNnmzLVdPj9FqFJNPqBZFve4w==",
-            "dev": true,
-            "dependencies": {
-                "glob": "^7.1.3"
-            },
-            "bin": {
-                "rimraf": "bin.js"
-            }
-        },
-        "node_modules/depd": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/depd/-/depd-1.1.2.tgz",
-            "integrity": "sha1-m81S4UwJd2PnSbJ0xDRu0uVgtak=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/destroy": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/destroy/-/destroy-1.0.4.tgz",
-            "integrity": "sha1-l4hXRCxEdJ5CBmE+N5RiBYJqvYA=",
-            "dev": true
-        },
-        "node_modules/detect-node": {
-            "version": "2.0.5",
-            "resolved": "https://registry.npmjs.org/detect-node/-/detect-node-2.0.5.tgz",
-            "integrity": "sha512-qi86tE6hRcFHy8jI1m2VG+LaPUR1LhqDa5G8tVjuUXmOrpuAgqsA1pN0+ldgr3aKUH+QLI9hCY/OcRYisERejw==",
-            "dev": true
-        },
-        "node_modules/dir-glob": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/dir-glob/-/dir-glob-3.0.1.tgz",
-            "integrity": "sha512-WkrWp9GR4KXfKGYzOLmTuGVi1UWFfws377n9cc55/tb6DuqyF6pcQ5AbiHEshaDpY9v6oaSr2XCDidGmMwdzIA==",
-            "dev": true,
-            "dependencies": {
-                "path-type": "^4.0.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/dns-equal": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/dns-equal/-/dns-equal-1.0.0.tgz",
-            "integrity": "sha1-s55/HabrCnW6nBcySzR1PEfgZU0=",
-            "dev": true
-        },
-        "node_modules/dns-packet": {
-            "version": "1.3.4",
-            "resolved": "https://registry.npmjs.org/dns-packet/-/dns-packet-1.3.4.tgz",
-            "integrity": "sha512-BQ6F4vycLXBvdrJZ6S3gZewt6rcrks9KBgM9vrhW+knGRqc8uEdT7fuCwloc7nny5xNoMJ17HGH0R/6fpo8ECA==",
-            "dev": true,
-            "dependencies": {
-                "ip": "^1.1.0",
-                "safe-buffer": "^5.0.1"
-            }
-        },
-        "node_modules/dns-txt": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/dns-txt/-/dns-txt-2.0.2.tgz",
-            "integrity": "sha1-uR2Ab10nGI5Ks+fRB9iBocxGQrY=",
-            "dev": true,
-            "dependencies": {
-                "buffer-indexof": "^1.0.0"
-            }
-        },
-        "node_modules/doctrine": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/doctrine/-/doctrine-3.0.0.tgz",
-            "integrity": "sha512-yS+Q5i3hBf7GBkd4KG8a7eBNNWNGLTaEwwYWUijIYM7zrlYDM0BFXHjjPWlWZ1Rg7UaddZeIDmi9jF3HmqiQ2w==",
-            "dev": true,
-            "dependencies": {
-                "esutils": "^2.0.2"
-            },
-            "engines": {
-                "node": ">=6.0.0"
-            }
-        },
-        "node_modules/ee-first": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/ee-first/-/ee-first-1.1.1.tgz",
-            "integrity": "sha1-WQxhFWsK4vTwJVcyoViyZrxWsh0=",
-            "dev": true
-        },
-        "node_modules/electron-to-chromium": {
-            "version": "1.3.750",
-            "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.3.750.tgz",
-            "integrity": "sha512-Eqy9eHNepZxJXT+Pc5++zvEi5nQ6AGikwFYDCYwXUFBr+ynJ6pDG7MzZmwGYCIuXShLJM0n4bq+aoKDmvSGJ8A==",
-            "dev": true
-        },
-        "node_modules/emoji-regex": {
-            "version": "8.0.0",
-            "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-8.0.0.tgz",
-            "integrity": "sha512-MSjYzcWNOA0ewAHpz0MxpYFvwg6yjy1NG3xteoqz644VCo/RPgnr1/GGt+ic3iJTzQ8Eu3TdM14SawnVUmGE6A==",
-            "dev": true
-        },
-        "node_modules/emojis-list": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/emojis-list/-/emojis-list-3.0.0.tgz",
-            "integrity": "sha512-/kyM18EfinwXZbno9FyUGeFh87KC8HRQBQGildHZbEuRyWFOmv1U10o9BBp8XVZDVNNuQKyIGIu5ZYAAXJ0V2Q==",
-            "dev": true,
-            "engines": {
-                "node": ">= 4"
-            }
-        },
-        "node_modules/encodeurl": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz",
-            "integrity": "sha1-rT/0yG7C0CkyL1oCw6mmBslbP1k=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/end-of-stream": {
-            "version": "1.4.4",
-            "resolved": "https://registry.npmjs.org/end-of-stream/-/end-of-stream-1.4.4.tgz",
-            "integrity": "sha512-+uw1inIHVPQoaVuHzRyXd21icM+cnt4CzD5rW+NC1wjOUSTOs+Te7FOv7AhN7vS9x/oIyhLP5PR1H+phQAHu5Q==",
-            "dev": true,
-            "dependencies": {
-                "once": "^1.4.0"
-            }
-        },
-        "node_modules/enhanced-resolve": {
-            "version": "5.7.0",
-            "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.7.0.tgz",
-            "integrity": "sha512-6njwt/NsZFUKhM6j9U8hzVyD4E4r0x7NQzhTCbcWOJ0IQjNSAoalWmb0AE51Wn+fwan5qVESWi7t2ToBxs9vrw==",
-            "dev": true,
-            "dependencies": {
-                "graceful-fs": "^4.2.4",
-                "tapable": "^2.2.0"
-            },
-            "engines": {
-                "node": ">=10.13.0"
-            }
-        },
-        "node_modules/enquirer": {
-            "version": "2.3.6",
-            "resolved": "https://registry.npmjs.org/enquirer/-/enquirer-2.3.6.tgz",
-            "integrity": "sha512-yjNnPr315/FjS4zIsUxYguYUPP2e1NK4d7E7ZOLiyYCcbFBiTMyID+2wvm2w6+pZ/odMA7cRkjhsPbltwBOrLg==",
-            "dev": true,
-            "dependencies": {
-                "ansi-colors": "^4.1.1"
-            },
-            "engines": {
-                "node": ">=8.6"
-            }
-        },
-        "node_modules/envinfo": {
-            "version": "7.7.4",
-            "resolved": "https://registry.npmjs.org/envinfo/-/envinfo-7.7.4.tgz",
-            "integrity": "sha512-TQXTYFVVwwluWSFis6K2XKxgrD22jEv0FTuLCQI+OjH7rn93+iY0fSSFM5lrSxFY+H1+B0/cvvlamr3UsBivdQ==",
-            "dev": true,
-            "bin": {
-                "envinfo": "dist/cli.js"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/errno": {
-            "version": "0.1.8",
-            "resolved": "https://registry.npmjs.org/errno/-/errno-0.1.8.tgz",
-            "integrity": "sha512-dJ6oBr5SQ1VSd9qkk7ByRgb/1SH4JZjCHSW/mr63/QcXO9zLVxvJ6Oy13nio03rxpSnVDDjFor75SjVeZWPW/A==",
-            "dev": true,
-            "dependencies": {
-                "prr": "~1.0.1"
-            },
-            "bin": {
-                "errno": "cli.js"
-            }
-        },
-        "node_modules/es-module-lexer": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-0.4.1.tgz",
-            "integrity": "sha512-ooYciCUtfw6/d2w56UVeqHPcoCFAiJdz5XOkYpv/Txl1HMUozpXjz/2RIQgqwKdXNDPSF1W7mJCFse3G+HDyAA==",
-            "dev": 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,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/escape-html": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/escape-html/-/escape-html-1.0.3.tgz",
-            "integrity": "sha1-Aljq5NPQwJdN4cFpGI7wBR0dGYg=",
-            "dev": true
-        },
-        "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/escape-string-regexp": {
-            "version": "1.0.5",
-            "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz",
-            "integrity": "sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.8.0"
-            }
-        },
-        "node_modules/eslint": {
-            "version": "7.22.0",
-            "resolved": "https://registry.npmjs.org/eslint/-/eslint-7.22.0.tgz",
-            "integrity": "sha512-3VawOtjSJUQiiqac8MQc+w457iGLfuNGLFn8JmF051tTKbh5/x/0vlcEj8OgDCaw7Ysa2Jn8paGshV7x2abKXg==",
-            "dev": true,
-            "dependencies": {
-                "@babel/code-frame": "7.12.11",
-                "@eslint/eslintrc": "^0.4.0",
-                "ajv": "^6.10.0",
-                "chalk": "^4.0.0",
-                "cross-spawn": "^7.0.2",
-                "debug": "^4.0.1",
-                "doctrine": "^3.0.0",
-                "enquirer": "^2.3.5",
-                "eslint-scope": "^5.1.1",
-                "eslint-utils": "^2.1.0",
-                "eslint-visitor-keys": "^2.0.0",
-                "espree": "^7.3.1",
-                "esquery": "^1.4.0",
-                "esutils": "^2.0.2",
-                "file-entry-cache": "^6.0.1",
-                "functional-red-black-tree": "^1.0.1",
-                "glob-parent": "^5.0.0",
-                "globals": "^13.6.0",
-                "ignore": "^4.0.6",
-                "import-fresh": "^3.0.0",
-                "imurmurhash": "^0.1.4",
-                "is-glob": "^4.0.0",
-                "js-yaml": "^3.13.1",
-                "json-stable-stringify-without-jsonify": "^1.0.1",
-                "levn": "^0.4.1",
-                "lodash": "^4.17.21",
-                "minimatch": "^3.0.4",
-                "natural-compare": "^1.4.0",
-                "optionator": "^0.9.1",
-                "progress": "^2.0.0",
-                "regexpp": "^3.1.0",
-                "semver": "^7.2.1",
-                "strip-ansi": "^6.0.0",
-                "strip-json-comments": "^3.1.0",
-                "table": "^6.0.4",
-                "text-table": "^0.2.0",
-                "v8-compile-cache": "^2.0.3"
-            },
-            "bin": {
-                "eslint": "bin/eslint.js"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "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,
-            "dependencies": {
-                "esrecurse": "^4.3.0",
-                "estraverse": "^4.1.1"
-            },
-            "engines": {
-                "node": ">=8.0.0"
-            }
-        },
-        "node_modules/eslint-utils": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/eslint-utils/-/eslint-utils-2.1.0.tgz",
-            "integrity": "sha512-w94dQYoauyvlDc43XnGB8lU3Zt713vNChgt4EWwhXAP2XkBvndfxF0AgIqKOOasjPIPzj9JqgwkwbCYD0/V3Zg==",
-            "dev": true,
-            "dependencies": {
-                "eslint-visitor-keys": "^1.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/eslint-utils/node_modules/eslint-visitor-keys": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-1.3.0.tgz",
-            "integrity": "sha512-6J72N8UNa462wa/KFODt/PJ3IU60SDpC3QXC1Hjc1BXXpfL2C9R5+AU7jhe0F6GREqVMh4Juu+NY7xn+6dipUQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/eslint-visitor-keys": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-2.0.0.tgz",
-            "integrity": "sha512-QudtT6av5WXels9WjIM7qz1XD1cWGvX4gGXvp/zBn9nXG02D0utdU3Em2m/QjTnrsk6bBjmCygl3rmj118msQQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/eslint/node_modules/ignore": {
-            "version": "4.0.6",
-            "resolved": "https://registry.npmjs.org/ignore/-/ignore-4.0.6.tgz",
-            "integrity": "sha512-cyFDKrqc/YdcWFniJhzI42+AzS+gNwmUzOSFcRCQYwySuBBBy/KjuxWLZ/FHEH6Moq1NizMOBWyTcv8O4OZIMg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 4"
-            }
-        },
-        "node_modules/espree": {
-            "version": "7.3.1",
-            "resolved": "https://registry.npmjs.org/espree/-/espree-7.3.1.tgz",
-            "integrity": "sha512-v3JCNCE64umkFpmkFGqzVKsOT0tN1Zr+ueqLZfpV1Ob8e+CEgPWa+OxCoGH3tnhimMKIaBm4m/vaRpJ/krRz2g==",
-            "dev": true,
-            "dependencies": {
-                "acorn": "^7.4.0",
-                "acorn-jsx": "^5.3.1",
-                "eslint-visitor-keys": "^1.3.0"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/espree/node_modules/acorn": {
-            "version": "7.4.1",
-            "resolved": "https://registry.npmjs.org/acorn/-/acorn-7.4.1.tgz",
-            "integrity": "sha512-nQyp0o1/mNdbTO1PO6kHkwSrmgZ0MT/jCCpNiwbUjGoRN4dlBhqJtoQuCnEOKzgTVwg0ZWiCoQy6SxMebQVh8A==",
-            "dev": true,
-            "bin": {
-                "acorn": "bin/acorn"
-            },
-            "engines": {
-                "node": ">=0.4.0"
-            }
-        },
-        "node_modules/espree/node_modules/eslint-visitor-keys": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-1.3.0.tgz",
-            "integrity": "sha512-6J72N8UNa462wa/KFODt/PJ3IU60SDpC3QXC1Hjc1BXXpfL2C9R5+AU7jhe0F6GREqVMh4Juu+NY7xn+6dipUQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/esprima": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/esprima/-/esprima-4.0.1.tgz",
-            "integrity": "sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A==",
-            "dev": true,
-            "bin": {
-                "esparse": "bin/esparse.js",
-                "esvalidate": "bin/esvalidate.js"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/esquery": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/esquery/-/esquery-1.4.0.tgz",
-            "integrity": "sha512-cCDispWt5vHHtwMY2YrAQ4ibFkAL8RbH5YGBnZBc90MolvvfkkQcJro/aZiAQUlQ3qgrYS6D6v8Gc5G5CQsc9w==",
-            "dev": true,
-            "dependencies": {
-                "estraverse": "^5.1.0"
-            },
-            "engines": {
-                "node": ">=0.10"
-            }
-        },
-        "node_modules/esquery/node_modules/estraverse": {
-            "version": "5.2.0",
-            "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.2.0.tgz",
-            "integrity": "sha512-BxbNGGNm0RyRYvUdHpIwv9IWzeM9XClbOxwoATuFdOE7ZE6wHL+HQ5T8hoPM+zHvmKzzsEqhgy0GrQ5X13afiQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=4.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,
-            "dependencies": {
-                "estraverse": "^5.2.0"
-            },
-            "engines": {
-                "node": ">=4.0"
-            }
-        },
-        "node_modules/esrecurse/node_modules/estraverse": {
-            "version": "5.2.0",
-            "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.2.0.tgz",
-            "integrity": "sha512-BxbNGGNm0RyRYvUdHpIwv9IWzeM9XClbOxwoATuFdOE7ZE6wHL+HQ5T8hoPM+zHvmKzzsEqhgy0GrQ5X13afiQ==",
-            "dev": 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,
-            "engines": {
-                "node": ">=4.0"
-            }
-        },
-        "node_modules/esutils": {
-            "version": "2.0.3",
-            "resolved": "https://registry.npmjs.org/esutils/-/esutils-2.0.3.tgz",
-            "integrity": "sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/etag": {
-            "version": "1.8.1",
-            "resolved": "https://registry.npmjs.org/etag/-/etag-1.8.1.tgz",
-            "integrity": "sha1-Qa4u62XvpiJorr/qg6x9eSmbCIc=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/eventemitter3": {
-            "version": "4.0.7",
-            "resolved": "https://registry.npmjs.org/eventemitter3/-/eventemitter3-4.0.7.tgz",
-            "integrity": "sha512-8guHBZCwKnFhYdHr2ysuRWErTwhoN2X8XELRlrRwpmfeY2jjuUN4taQMsULKUVo1K4DvZl+0pgfyoysHxvmvEw==",
-            "dev": true
-        },
-        "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,
-            "engines": {
-                "node": ">=0.8.x"
-            }
-        },
-        "node_modules/eventsource": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/eventsource/-/eventsource-1.1.0.tgz",
-            "integrity": "sha512-VSJjT5oCNrFvCS6igjzPAt5hBzQ2qPBFIbJ03zLI9SE0mxwZpMw6BfJrbFHm1a141AavMEB8JHmBhWAd66PfCg==",
-            "dev": true,
-            "dependencies": {
-                "original": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.12.0"
-            }
-        },
-        "node_modules/execa": {
-            "version": "5.0.0",
-            "resolved": "https://registry.npmjs.org/execa/-/execa-5.0.0.tgz",
-            "integrity": "sha512-ov6w/2LCiuyO4RLYGdpFGjkcs0wMTgGE8PrkTHikeUy5iJekXyPIKUjifk5CsE0pt7sMCrMZ3YNqoCj6idQOnQ==",
-            "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"
-            }
-        },
-        "node_modules/expand-brackets": {
-            "version": "2.1.4",
-            "resolved": "https://registry.npmjs.org/expand-brackets/-/expand-brackets-2.1.4.tgz",
-            "integrity": "sha1-t3c14xXOMPa27/D4OwQVGiJEliI=",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/expand-brackets/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/expand-brackets/node_modules/define-property": {
-            "version": "0.2.5",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-            "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/expand-brackets/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/expand-brackets/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/express": {
-            "version": "4.17.1",
-            "resolved": "https://registry.npmjs.org/express/-/express-4.17.1.tgz",
-            "integrity": "sha512-mHJ9O79RqluphRrcw2X/GTh3k9tVv8YcoyY4Kkh4WDMUYKRZUq0h1o0w2rrrxBqM7VoeUVqgb27xlEMXTnYt4g==",
-            "dev": true,
-            "dependencies": {
-                "accepts": "~1.3.7",
-                "array-flatten": "1.1.1",
-                "body-parser": "1.19.0",
-                "content-disposition": "0.5.3",
-                "content-type": "~1.0.4",
-                "cookie": "0.4.0",
-                "cookie-signature": "1.0.6",
-                "debug": "2.6.9",
-                "depd": "~1.1.2",
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "etag": "~1.8.1",
-                "finalhandler": "~1.1.2",
-                "fresh": "0.5.2",
-                "merge-descriptors": "1.0.1",
-                "methods": "~1.1.2",
-                "on-finished": "~2.3.0",
-                "parseurl": "~1.3.3",
-                "path-to-regexp": "0.1.7",
-                "proxy-addr": "~2.0.5",
-                "qs": "6.7.0",
-                "range-parser": "~1.2.1",
-                "safe-buffer": "5.1.2",
-                "send": "0.17.1",
-                "serve-static": "1.14.1",
-                "setprototypeof": "1.1.1",
-                "statuses": "~1.5.0",
-                "type-is": "~1.6.18",
-                "utils-merge": "1.0.1",
-                "vary": "~1.1.2"
-            },
-            "engines": {
-                "node": ">= 0.10.0"
-            }
-        },
-        "node_modules/express/node_modules/array-flatten": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/array-flatten/-/array-flatten-1.1.1.tgz",
-            "integrity": "sha1-ml9pkFGx5wczKPKgCJaLZOopVdI=",
-            "dev": true
-        },
-        "node_modules/express/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/express/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/express/node_modules/safe-buffer": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-            "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-            "dev": true
-        },
-        "node_modules/extend-shallow": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-3.0.2.tgz",
-            "integrity": "sha1-Jqcarwc7OfshJxcnRhMcJwQCjbg=",
-            "dev": true,
-            "dependencies": {
-                "assign-symbols": "^1.0.0",
-                "is-extendable": "^1.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/extend-shallow/node_modules/is-extendable": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-1.0.1.tgz",
-            "integrity": "sha512-arnXMxT1hhoKo9k1LZdmlNyJdDDfy2v0fXjFlmok4+i8ul/6WlbVge9bhM74OpNPQPMGUToDtz+KXa1PneJxOA==",
-            "dev": true,
-            "dependencies": {
-                "is-plain-object": "^2.0.4"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/extglob": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/extglob/-/extglob-2.0.4.tgz",
-            "integrity": "sha512-Nmb6QXkELsuBr24CJSkilo6UHHgbekK5UiZgfE6UHD3Eb27YC6oD+bhcT+tJ6cl8dmsgdQxnWlcry8ksBIBLpw==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/extglob/node_modules/define-property": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
-            "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/extglob/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/extglob/node_modules/is-accessor-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-            "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/extglob/node_modules/is-data-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-            "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/extglob/node_modules/is-descriptor": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-            "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-            "dev": true,
-            "dependencies": {
-                "is-accessor-descriptor": "^1.0.0",
-                "is-data-descriptor": "^1.0.0",
-                "kind-of": "^6.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "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
-        },
-        "node_modules/fast-glob": {
-            "version": "3.2.5",
-            "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.2.5.tgz",
-            "integrity": "sha512-2DtFcgT68wiTTiwZ2hNdJfcHNke9XOfnwmBRWXhmeKM8rF0TGwmC/Qto3S7RoZKp5cilZbxzO5iTNTQsJ+EeDg==",
-            "dev": true,
-            "dependencies": {
-                "@nodelib/fs.stat": "^2.0.2",
-                "@nodelib/fs.walk": "^1.2.3",
-                "glob-parent": "^5.1.0",
-                "merge2": "^1.3.0",
-                "micromatch": "^4.0.2",
-                "picomatch": "^2.2.1"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "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
-        },
-        "node_modules/fast-levenshtein": {
-            "version": "2.0.6",
-            "resolved": "https://registry.npmjs.org/fast-levenshtein/-/fast-levenshtein-2.0.6.tgz",
-            "integrity": "sha1-PYpcZog6FqMMqGQ+hR8Zuqd5eRc=",
-            "dev": 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/fastq": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/fastq/-/fastq-1.11.0.tgz",
-            "integrity": "sha512-7Eczs8gIPDrVzT+EksYBcupqMyxSHXXrHOLRRxU2/DicV8789MRBRR8+Hc2uWzUupOs4YS4JzBmBxjjCVBxD/g==",
-            "dev": true,
-            "dependencies": {
-                "reusify": "^1.0.4"
-            }
-        },
-        "node_modules/faye-websocket": {
-            "version": "0.11.3",
-            "resolved": "https://registry.npmjs.org/faye-websocket/-/faye-websocket-0.11.3.tgz",
-            "integrity": "sha512-D2y4bovYpzziGgbHYtGCMjlJM36vAl/y+xUyn1C+FVx8szd1E+86KwVw6XvYSzOP8iMpm1X0I4xJD+QtUb36OA==",
-            "dev": true,
-            "dependencies": {
-                "websocket-driver": ">=0.5.1"
-            },
-            "engines": {
-                "node": ">=0.8.0"
-            }
-        },
-        "node_modules/file-entry-cache": {
-            "version": "6.0.1",
-            "resolved": "https://registry.npmjs.org/file-entry-cache/-/file-entry-cache-6.0.1.tgz",
-            "integrity": "sha512-7Gps/XWymbLk2QLYK4NzpMOrYjMhdIxXuIvy2QBsLE6ljuodKvdkWs/cpyJJ3CVIVpH0Oi1Hvg1ovbMzLdFBBg==",
-            "dev": true,
-            "dependencies": {
-                "flat-cache": "^3.0.4"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/file-uri-to-path": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/file-uri-to-path/-/file-uri-to-path-1.0.0.tgz",
-            "integrity": "sha512-0Zt+s3L7Vf1biwWZ29aARiVYLx7iMGnEUl9x33fbB/j3jR81u/O2LbqK+Bm1CDSNDKVtJ/YjwY7TUd5SkeLQLw==",
-            "dev": true,
-            "optional": true
-        },
-        "node_modules/fill-range": {
-            "version": "7.0.1",
-            "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.0.1.tgz",
-            "integrity": "sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==",
-            "dev": true,
-            "dependencies": {
-                "to-regex-range": "^5.0.1"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/finalhandler": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.1.2.tgz",
-            "integrity": "sha512-aAWcW57uxVNrQZqFXjITpW3sIUQmHGG3qSb9mUah9MgMC4NeWhNOlNjXEYq3HjRAvL6arUviZGGJsBg6z0zsWA==",
-            "dev": true,
-            "dependencies": {
-                "debug": "2.6.9",
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "on-finished": "~2.3.0",
-                "parseurl": "~1.3.3",
-                "statuses": "~1.5.0",
-                "unpipe": "~1.0.0"
-            },
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/finalhandler/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/finalhandler/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/find-cache-dir": {
-            "version": "3.3.1",
-            "resolved": "https://registry.npmjs.org/find-cache-dir/-/find-cache-dir-3.3.1.tgz",
-            "integrity": "sha512-t2GDMt3oGC/v+BMwzmllWDuJF/xcDtE5j/fCGbqDD7OLuJkj0cfh1YSA5VKPvwMeLFLNDBkwOKZ2X85jGLVftQ==",
-            "dev": true,
-            "dependencies": {
-                "commondir": "^1.0.1",
-                "make-dir": "^3.0.2",
-                "pkg-dir": "^4.1.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/find-cache-dir/node_modules/make-dir": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-3.1.0.tgz",
-            "integrity": "sha512-g3FeP20LNwhALb/6Cz6Dd4F2ngze0jz7tbzrD2wAV+o9FeNHe4rL+yK2md0J/fiSf1sa1ADhXqi5+oVwOM/eGw==",
-            "dev": true,
-            "dependencies": {
-                "semver": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/find-cache-dir/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "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/flat-cache": {
-            "version": "3.0.4",
-            "resolved": "https://registry.npmjs.org/flat-cache/-/flat-cache-3.0.4.tgz",
-            "integrity": "sha512-dm9s5Pw7Jc0GvMYbshN6zchCA9RgQlzzEZX3vylR9IqFfS8XciblUXOKfW6SiuJ0e13eDYZoZV5wdrev7P3Nwg==",
-            "dev": true,
-            "dependencies": {
-                "flatted": "^3.1.0",
-                "rimraf": "^3.0.2"
-            },
-            "engines": {
-                "node": "^10.12.0 || >=12.0.0"
-            }
-        },
-        "node_modules/flatted": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/flatted/-/flatted-3.1.1.tgz",
-            "integrity": "sha512-zAoAQiudy+r5SvnSw3KJy5os/oRJYHzrzja/tBDqrZtNhUw8bt6y8OBzMWcjWr+8liV8Eb6yOhw8WZ7VFZ5ZzA==",
-            "dev": true
-        },
-        "node_modules/follow-redirects": {
-            "version": "1.13.3",
-            "resolved": "https://registry.npmjs.org/follow-redirects/-/follow-redirects-1.13.3.tgz",
-            "integrity": "sha512-DUgl6+HDzB0iEptNQEXLx/KhTmDb8tZUHSeLqpnjpknR70H0nC2t9N73BK6fN4hOvJ84pKlIQVQ4k5FFlBedKA==",
-            "dev": true,
-            "engines": {
-                "node": ">=4.0"
-            }
-        },
-        "node_modules/for-in": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/for-in/-/for-in-1.0.2.tgz",
-            "integrity": "sha1-gQaNKVqBQuwKxybG4iAMMPttXoA=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/forwarded": {
-            "version": "0.1.2",
-            "resolved": "https://registry.npmjs.org/forwarded/-/forwarded-0.1.2.tgz",
-            "integrity": "sha1-mMI9qxF1ZXuMBXPozszZGw/xjIQ=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/fraction.js": {
-            "version": "4.0.13",
-            "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-4.0.13.tgz",
-            "integrity": "sha512-E1fz2Xs9ltlUp+qbiyx9wmt2n9dRzPsS11Jtdb8D2o+cC7wr9xkkKsVKJuBX0ST+LVS+LhLO+SbLJNtfWcJvXA==",
-            "engines": {
-                "node": "*"
-            }
-        },
-        "node_modules/fragment-cache": {
-            "version": "0.2.1",
-            "resolved": "https://registry.npmjs.org/fragment-cache/-/fragment-cache-0.2.1.tgz",
-            "integrity": "sha1-QpD60n8T6Jvn8zeZxrxaCr//DRk=",
-            "dev": true,
-            "dependencies": {
-                "map-cache": "^0.2.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/fresh": {
-            "version": "0.5.2",
-            "resolved": "https://registry.npmjs.org/fresh/-/fresh-0.5.2.tgz",
-            "integrity": "sha1-PYyt2Q2XZWn6g1qx+OSyOhBWBac=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/fs-readdir-recursive": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/fs-readdir-recursive/-/fs-readdir-recursive-1.1.0.tgz",
-            "integrity": "sha512-GNanXlVr2pf02+sPN40XN8HG+ePaNcvM0q5mZBd668Obwb0yD5GiUbZOFgwn8kGMY6I3mdyDJzieUy3PTYyTRA==",
-            "dev": true
-        },
-        "node_modules/fs.realpath": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/fs.realpath/-/fs.realpath-1.0.0.tgz",
-            "integrity": "sha1-FQStJSMVjKpA20onh8sBQRmU6k8=",
-            "dev": true
-        },
-        "node_modules/fsevents": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.3.2.tgz",
-            "integrity": "sha512-xiqMQR4xAeHTuB9uWm+fFRcIOgKBMiOBP+eXiyT7jsgVCq1bkVygt00oASowB7EdtpOHaaPgKt812P9ab+DDKA==",
-            "dev": true,
-            "optional": true,
-            "os": [
-                "darwin"
-            ],
-            "engines": {
-                "node": "^8.16.0 || ^10.6.0 || >=11.0.0"
-            }
-        },
-        "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/functional-red-black-tree": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/functional-red-black-tree/-/functional-red-black-tree-1.0.1.tgz",
-            "integrity": "sha1-GwqzvVU7Kg1jmdKcDj6gslIHgyc=",
-            "dev": true
-        },
-        "node_modules/gensync": {
-            "version": "1.0.0-beta.2",
-            "resolved": "https://registry.npmjs.org/gensync/-/gensync-1.0.0-beta.2.tgz",
-            "integrity": "sha512-3hN7NaskYvMDLQY55gnW3NQ+mesEAepTqlg+VEbj7zzqEMBVNhzcGYYeqFo/TlYz6eQiFcp1HcsCZO+nGgS8zg==",
-            "dev": true,
-            "engines": {
-                "node": ">=6.9.0"
-            }
-        },
-        "node_modules/get-caller-file": {
-            "version": "2.0.5",
-            "resolved": "https://registry.npmjs.org/get-caller-file/-/get-caller-file-2.0.5.tgz",
-            "integrity": "sha512-DyFP3BM/3YHTQOCUL/w0OZHR0lpKeGrxotcHWcqNEdnltqFwXVfhEBQ94eIo34AfQpo0rGki4cyIiftY06h2Fg==",
-            "dev": true,
-            "engines": {
-                "node": "6.* || 8.* || >= 10.*"
-            }
-        },
-        "node_modules/get-intrinsic": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/get-intrinsic/-/get-intrinsic-1.1.1.tgz",
-            "integrity": "sha512-kWZrnVM42QCiEA2Ig1bG8zjoIMOgxWwYCEeNdwY6Tv/cOSeGpcoX4pXHfKUxNKVoArnrEr2e9srnAxxGIraS9Q==",
-            "dev": true,
-            "dependencies": {
-                "function-bind": "^1.1.1",
-                "has": "^1.0.3",
-                "has-symbols": "^1.0.1"
-            }
-        },
-        "node_modules/get-stream": {
-            "version": "6.0.0",
-            "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-6.0.0.tgz",
-            "integrity": "sha512-A1B3Bh1UmL0bidM/YX2NsCOTnGJePL9rO/M+Mw3m9f2gUpfokS0hi5Eah0WSUEWZdZhIZtMjkIYS7mDfOqNHbg==",
-            "dev": true,
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/get-value": {
-            "version": "2.0.6",
-            "resolved": "https://registry.npmjs.org/get-value/-/get-value-2.0.6.tgz",
-            "integrity": "sha1-3BXKHGcjh8p2vTesCjlbogQqLCg=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/glob": {
-            "version": "7.1.6",
-            "resolved": "https://registry.npmjs.org/glob/-/glob-7.1.6.tgz",
-            "integrity": "sha512-LwaxwyZ72Lk7vZINtNNrywX0ZuLyStrdDtabefZKAY5ZGJhVtgdznluResxNmPitE0SAO+O26sWTHeKSI2wMBA==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": "*"
-            }
-        },
-        "node_modules/glob-parent": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-5.1.2.tgz",
-            "integrity": "sha512-AOIgSQCepiJYwP3ARnGx+5VnTu2HBYdzbGP45eLw1vr3zB3vZLeyed1sC9hnbcOc9/SrMyM5RPQrkGz4aS9Zow==",
-            "dev": true,
-            "dependencies": {
-                "is-glob": "^4.0.1"
-            },
-            "engines": {
-                "node": ">= 6"
-            }
-        },
-        "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
-        },
-        "node_modules/globals": {
-            "version": "13.7.0",
-            "resolved": "https://registry.npmjs.org/globals/-/globals-13.7.0.tgz",
-            "integrity": "sha512-Aipsz6ZKRxa/xQkZhNg0qIWXT6x6rD46f6x/PCnBomlttdIyAPak4YD9jTmKpZ72uROSMU87qJtcgpgHaVchiA==",
-            "dev": true,
-            "dependencies": {
-                "type-fest": "^0.20.2"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/globals/node_modules/type-fest": {
-            "version": "0.20.2",
-            "resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.20.2.tgz",
-            "integrity": "sha512-Ne+eE4r0/iWnpAxD852z3A+N0Bt5RN//NjJwRd2VFHEmrywxf5vsZlh4R6lixl6B+wz/8d+maTSAkN1FIkI3LQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/globby": {
-            "version": "11.0.2",
-            "resolved": "https://registry.npmjs.org/globby/-/globby-11.0.2.tgz",
-            "integrity": "sha512-2ZThXDvvV8fYFRVIxnrMQBipZQDr7MxKAmQK1vujaj9/7eF0efG7BPUKJ7jP7G5SLF37xKDXvO4S/KKLj/Z0og==",
-            "dev": true,
-            "dependencies": {
-                "array-union": "^2.1.0",
-                "dir-glob": "^3.0.1",
-                "fast-glob": "^3.1.1",
-                "ignore": "^5.1.4",
-                "merge2": "^1.3.0",
-                "slash": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/graceful-fs": {
-            "version": "4.2.4",
-            "resolved": "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.4.tgz",
-            "integrity": "sha512-WjKPNJF79dtJAVniUlGGWHYGz2jWxT6VhN/4m1NdkbZ2nOsEF+cI1Edgql5zCRhs/VsQYRvrXctxktVXZUkixw==",
-            "dev": true
-        },
-        "node_modules/graphlib": {
-            "version": "2.1.8",
-            "resolved": "https://registry.npmjs.org/graphlib/-/graphlib-2.1.8.tgz",
-            "integrity": "sha512-jcLLfkpoVGmH7/InMC/1hIvOPSUh38oJtGhvrOFGzioE1DZ+0YW16RgmOJhHiuWTvGiJQ9Z1Ik43JvkRPRvE+A==",
-            "dependencies": {
-                "lodash": "^4.17.15"
-            }
-        },
-        "node_modules/handle-thing": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/handle-thing/-/handle-thing-2.0.1.tgz",
-            "integrity": "sha512-9Qn4yBxelxoh2Ow62nP+Ka/kMnOXRi8BXnRaUwezLNhqelnN49xKz4F/dPP8OYLxLxq6JDtZb2i9XznUQbNPTg==",
-            "dev": 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,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/has-symbols": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/has-symbols/-/has-symbols-1.0.2.tgz",
-            "integrity": "sha512-chXa79rL/UC2KlX17jo3vRGz0azaWEx5tGqZg5pO3NUyEJVB17dMruQlzCCOfUvElghKcm5194+BCRvi2Rv/Gw==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/has-value": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/has-value/-/has-value-1.0.0.tgz",
-            "integrity": "sha1-GLKB2lhbHFxR3vJMkw7SmgvmsXc=",
-            "dev": true,
-            "dependencies": {
-                "get-value": "^2.0.6",
-                "has-values": "^1.0.0",
-                "isobject": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/has-values": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/has-values/-/has-values-1.0.0.tgz",
-            "integrity": "sha1-lbC2P+whRmGab+V/51Yo1aOe/k8=",
-            "dev": true,
-            "dependencies": {
-                "is-number": "^3.0.0",
-                "kind-of": "^4.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/has-values/node_modules/is-number": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-            "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/has-values/node_modules/is-number/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/has-values/node_modules/kind-of": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-4.0.0.tgz",
-            "integrity": "sha1-IIE989cSkosgc3hpGkUGb65y3Vc=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/hpack.js": {
-            "version": "2.1.6",
-            "resolved": "https://registry.npmjs.org/hpack.js/-/hpack.js-2.1.6.tgz",
-            "integrity": "sha1-h3dMCUnlE/QuhFdbPEVoH63ioLI=",
-            "dev": true,
-            "dependencies": {
-                "inherits": "^2.0.1",
-                "obuf": "^1.0.0",
-                "readable-stream": "^2.0.1",
-                "wbuf": "^1.1.0"
-            }
-        },
-        "node_modules/html-entities": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/html-entities/-/html-entities-1.4.0.tgz",
-            "integrity": "sha512-8nxjcBcd8wovbeKx7h3wTji4e6+rhaVuPNpMqwWgnHh+N9ToqsCs6XztWRBPQ+UtzsoMAdKZtUENoVzU/EMtZA==",
-            "dev": true
-        },
-        "node_modules/http-deceiver": {
-            "version": "1.2.7",
-            "resolved": "https://registry.npmjs.org/http-deceiver/-/http-deceiver-1.2.7.tgz",
-            "integrity": "sha1-+nFolEq5pRnTN8sL7HKE3D5yPYc=",
-            "dev": true
-        },
-        "node_modules/http-errors": {
-            "version": "1.7.2",
-            "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.7.2.tgz",
-            "integrity": "sha512-uUQBt3H/cSIVfch6i1EuPNy/YsRSOUBXTVfZ+yR7Zjez3qjBz6i9+i4zjNaoqcoFVI4lQJ5plg63TvGfRSDCRg==",
-            "dev": true,
-            "dependencies": {
-                "depd": "~1.1.2",
-                "inherits": "2.0.3",
-                "setprototypeof": "1.1.1",
-                "statuses": ">= 1.5.0 < 2",
-                "toidentifier": "1.0.0"
-            },
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/http-errors/node_modules/inherits": {
-            "version": "2.0.3",
-            "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
-            "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=",
-            "dev": true
-        },
-        "node_modules/http-parser-js": {
-            "version": "0.5.3",
-            "resolved": "https://registry.npmjs.org/http-parser-js/-/http-parser-js-0.5.3.tgz",
-            "integrity": "sha512-t7hjvef/5HEK7RWTdUzVUhl8zkEu+LlaE0IYzdMuvbSDipxBRpOn4Uhw8ZyECEa808iVT8XCjzo6xmYt4CiLZg==",
-            "dev": true
-        },
-        "node_modules/http-proxy": {
-            "version": "1.18.1",
-            "resolved": "https://registry.npmjs.org/http-proxy/-/http-proxy-1.18.1.tgz",
-            "integrity": "sha512-7mz/721AbnJwIVbnaSv1Cz3Am0ZLT/UBwkC92VlxhXv/k/BBQfM2fXElQNC27BVGr0uwUpplYPQM9LnaBMR5NQ==",
-            "dev": true,
-            "dependencies": {
-                "eventemitter3": "^4.0.0",
-                "follow-redirects": "^1.0.0",
-                "requires-port": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=8.0.0"
-            }
-        },
-        "node_modules/http-proxy-middleware": {
-            "version": "0.19.1",
-            "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-0.19.1.tgz",
-            "integrity": "sha512-yHYTgWMQO8VvwNS22eLLloAkvungsKdKTLO8AJlftYIKNfJr3GK3zK0ZCfzDDGUBttdGc8xFy1mCitvNKQtC3Q==",
-            "dev": true,
-            "dependencies": {
-                "http-proxy": "^1.17.0",
-                "is-glob": "^4.0.0",
-                "lodash": "^4.17.11",
-                "micromatch": "^3.1.10"
-            },
-            "engines": {
-                "node": ">=4.0.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/braces": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-            "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/braces/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/fill-range": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-            "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-            "dev": true,
-            "dependencies": {
-                "extend-shallow": "^2.0.1",
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1",
-                "to-regex-range": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/fill-range/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/is-number": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-            "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/is-number/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/micromatch": {
-            "version": "3.1.10",
-            "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
-            "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/http-proxy-middleware/node_modules/to-regex-range": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-            "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-            "dev": true,
-            "dependencies": {
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "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/iconv-lite": {
-            "version": "0.4.24",
-            "resolved": "https://registry.npmjs.org/iconv-lite/-/iconv-lite-0.4.24.tgz",
-            "integrity": "sha512-v3MXnZAcvnywkTUEZomIActle7RXXeedOR31wwl7VlyoXO4Qi9arvSenNQWne1TcRwhCL1HwLI21bEqdpj8/rA==",
-            "dev": true,
-            "dependencies": {
-                "safer-buffer": ">= 2.1.2 < 3"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/ignore": {
-            "version": "5.1.8",
-            "resolved": "https://registry.npmjs.org/ignore/-/ignore-5.1.8.tgz",
-            "integrity": "sha512-BMpfD7PpiETpBl/A6S498BaIJ6Y/ABT93ETbby2fP00v4EbvPBXWEoaR1UBPKs3iR53pJY7EtZk5KACI57i1Uw==",
-            "dev": true,
-            "engines": {
-                "node": ">= 4"
-            }
-        },
-        "node_modules/import-fresh": {
-            "version": "3.3.0",
-            "resolved": "https://registry.npmjs.org/import-fresh/-/import-fresh-3.3.0.tgz",
-            "integrity": "sha512-veYYhQa+D1QBKznvhUHxb8faxlrwUnxseDAbAp457E0wLNio2bOSKnjYDhMj+YiAq61xrMGhQk9iXVk5FzgQMw==",
-            "dev": true,
-            "dependencies": {
-                "parent-module": "^1.0.0",
-                "resolve-from": "^4.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/import-fresh/node_modules/resolve-from": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/resolve-from/-/resolve-from-4.0.0.tgz",
-            "integrity": "sha512-pb/MYmXstAkysRFx8piNI1tGFNQIFA3vkE3Gq4EuA1dF6gHp/+vgZqsCGJapvy8N3Q+4o7FwvquPJcnZ7RYy4g==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/import-local": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/import-local/-/import-local-3.0.2.tgz",
-            "integrity": "sha512-vjL3+w0oulAVZ0hBHnxa/Nm5TAurf9YLQJDhqRZyqb+VKGOB6LU8t9H1Nr5CIo16vh9XfJTOoHwU0B71S557gA==",
-            "dev": true,
-            "dependencies": {
-                "pkg-dir": "^4.2.0",
-                "resolve-cwd": "^3.0.0"
-            },
-            "bin": {
-                "import-local-fixture": "fixtures/cli.js"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/imurmurhash": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/imurmurhash/-/imurmurhash-0.1.4.tgz",
-            "integrity": "sha1-khi5srkoojixPcT7a21XbyMUU+o=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.8.19"
-            }
-        },
-        "node_modules/inflight": {
-            "version": "1.0.6",
-            "resolved": "https://registry.npmjs.org/inflight/-/inflight-1.0.6.tgz",
-            "integrity": "sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=",
-            "dev": true,
-            "dependencies": {
-                "once": "^1.3.0",
-                "wrappy": "1"
-            }
-        },
-        "node_modules/inherits": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.4.tgz",
-            "integrity": "sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==",
-            "dev": true
-        },
-        "node_modules/internal-ip": {
-            "version": "4.3.0",
-            "resolved": "https://registry.npmjs.org/internal-ip/-/internal-ip-4.3.0.tgz",
-            "integrity": "sha512-S1zBo1D6zcsyuC6PMmY5+55YMILQ9av8lotMx447Bq6SAgo/sDK6y6uUKmuYhW7eacnIhFfsPmCNYdDzsnnDCg==",
-            "dev": true,
-            "dependencies": {
-                "default-gateway": "^4.2.0",
-                "ipaddr.js": "^1.9.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "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/ip": {
-            "version": "1.1.5",
-            "resolved": "https://registry.npmjs.org/ip/-/ip-1.1.5.tgz",
-            "integrity": "sha1-vd7XARQpCCjAoDnnLvJfWq7ENUo=",
-            "dev": true
-        },
-        "node_modules/ip-regex": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/ip-regex/-/ip-regex-2.1.0.tgz",
-            "integrity": "sha1-+ni/XS5pE8kRzp+BnuUUa7bYROk=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/ipaddr.js": {
-            "version": "1.9.1",
-            "resolved": "https://registry.npmjs.org/ipaddr.js/-/ipaddr.js-1.9.1.tgz",
-            "integrity": "sha512-0KI/607xoxSToH7GjN1FfSbLoU0+btTicjsQSWQlh/hZykN8KpmMf7uYwPW3R+akZ6R/w18ZlXSHBYXiYUPO3g==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.10"
-            }
-        },
-        "node_modules/is-absolute-url": {
-            "version": "3.0.3",
-            "resolved": "https://registry.npmjs.org/is-absolute-url/-/is-absolute-url-3.0.3.tgz",
-            "integrity": "sha512-opmNIX7uFnS96NtPmhWQgQx6/NYFgsUXYMllcfzwWKUMwfo8kku1TvE6hkNcH+Q1ts5cMVrsY7j0bxXQDciu9Q==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/is-accessor-descriptor": {
-            "version": "0.1.6",
-            "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-0.1.6.tgz",
-            "integrity": "sha1-qeEss66Nh2cn7u84Q/igiXtcmNY=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-accessor-descriptor/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-arguments": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/is-arguments/-/is-arguments-1.1.0.tgz",
-            "integrity": "sha512-1Ij4lOMPl/xB5kBDn7I+b2ttPMKa8szhEIrXDuXQD/oe3HJLTLhqhgGspwgyGd6MOywBUqVvYicF72lkgDnIHg==",
-            "dev": true,
-            "dependencies": {
-                "call-bind": "^1.0.0"
-            },
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/is-binary-path": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-1.0.1.tgz",
-            "integrity": "sha1-dfFmQrSA8YenEcgUFh/TpKdlWJg=",
-            "dev": true,
-            "dependencies": {
-                "binary-extensions": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-buffer": {
-            "version": "1.1.6",
-            "resolved": "https://registry.npmjs.org/is-buffer/-/is-buffer-1.1.6.tgz",
-            "integrity": "sha512-NcdALwpXkTm5Zvvbk7owOUSvVvBKDgKP5/ewfXEznmQFfs4ZRmanOeKBTjRVjka3QFoN6XJ+9F3USqfHqTaU5w==",
-            "dev": true
-        },
-        "node_modules/is-core-module": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/is-core-module/-/is-core-module-2.2.0.tgz",
-            "integrity": "sha512-XRAfAdyyY5F5cOXn7hYQDqh2Xmii+DEfIcQGxK/uNwMHhIkPWO0g8msXcbzLe+MpGoR951MlqM/2iIlU4vKDdQ==",
-            "dev": true,
-            "dependencies": {
-                "has": "^1.0.3"
-            }
-        },
-        "node_modules/is-data-descriptor": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-0.1.4.tgz",
-            "integrity": "sha1-C17mSDiOLIYCgueT8YVv7D8wG1Y=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-data-descriptor/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-date-object": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-date-object/-/is-date-object-1.0.2.tgz",
-            "integrity": "sha512-USlDT524woQ08aoZFzh3/Z6ch9Y/EWXEHQ/AaRN0SkKq4t2Jw2R2339tSXmwuVoY7LLlBCbOIlx2myP/L5zk0g==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/is-descriptor": {
-            "version": "0.1.6",
-            "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-0.1.6.tgz",
-            "integrity": "sha512-avDYr0SB3DwO9zsMov0gKCESFYqCnE4hq/4z3TdUlukEy5t9C0YRq7HLrsN52NAcqXKaepeCD0n+B0arnVG3Hg==",
-            "dev": true,
-            "dependencies": {
-                "is-accessor-descriptor": "^0.1.6",
-                "is-data-descriptor": "^0.1.4",
-                "kind-of": "^5.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-descriptor/node_modules/kind-of": {
-            "version": "5.1.0",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-5.1.0.tgz",
-            "integrity": "sha512-NGEErnH6F2vUuXDh+OlbcKW7/wOcfdRHaZ7VWtqCztfHri/++YKmP51OdWeGPuqCOba6kk2OTe5d02VmTB80Pw==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-extendable": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-0.1.1.tgz",
-            "integrity": "sha1-YrEQ4omkcUGOPsNqYX1HLjAd/Ik=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-extglob": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-2.1.1.tgz",
-            "integrity": "sha1-qIwCU1eR8C7TfHahueqXc8gz+MI=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-fullwidth-code-point": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-3.0.0.tgz",
-            "integrity": "sha512-zymm5+u+sCsSWyD9qNaejV3DFvhCKclKdizYaJUuHA83RLjb7nSuGnddCHGv0hk+KY7BMAlsWeK4Ueg6EV6XQg==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/is-glob": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.1.tgz",
-            "integrity": "sha512-5G0tKtBTFImOqDnLB2hG6Bp2qcKEFduo4tZu9MT/H6NQv/ghhy30o55ufafxJ/LdH79LLs2Kfrn85TLKyA7BUg==",
-            "dev": true,
-            "dependencies": {
-                "is-extglob": "^2.1.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-number": {
-            "version": "7.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-7.0.0.tgz",
-            "integrity": "sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.12.0"
-            }
-        },
-        "node_modules/is-path-cwd": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/is-path-cwd/-/is-path-cwd-2.2.0.tgz",
-            "integrity": "sha512-w942bTcih8fdJPJmQHFzkS76NEP8Kzzvmw92cXsazb8intwLqPibPPdXf4ANdKV3rYMuuQYGIWtvz9JilB3NFQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/is-path-in-cwd": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/is-path-in-cwd/-/is-path-in-cwd-2.1.0.tgz",
-            "integrity": "sha512-rNocXHgipO+rvnP6dk3zI20RpOtrAM/kzbB258Uw5BWr3TpXi861yzjo16Dn4hUox07iw5AyeMLHWsujkjzvRQ==",
-            "dev": true,
-            "dependencies": {
-                "is-path-inside": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/is-path-inside": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/is-path-inside/-/is-path-inside-2.1.0.tgz",
-            "integrity": "sha512-wiyhTzfDWsvwAW53OBWF5zuvaOGlZ6PwYxAbPVDhpm+gM09xKQGjBq/8uYN12aDvMxnAnq3dxTyoSoRNmg5YFg==",
-            "dev": true,
-            "dependencies": {
-                "path-is-inside": "^1.0.2"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "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-regex": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/is-regex/-/is-regex-1.1.2.tgz",
-            "integrity": "sha512-axvdhb5pdhEVThqJzYXwMlVuZwC+FF2DpcOhTS+y/8jVq4trxyPgfcwIxIKiyeuLlSQYKkmUaPQJ8ZE4yNKXDg==",
-            "dev": true,
-            "dependencies": {
-                "call-bind": "^1.0.2",
-                "has-symbols": "^1.0.1"
-            },
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/is-stream": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/is-stream/-/is-stream-2.0.0.tgz",
-            "integrity": "sha512-XCoy+WlUr7d1+Z8GgSuXmpuUFC9fOhRXglJMx+dwLKTkL44Cjd4W1Z5P+BQZpr+cR93aGP4S/s7Ftw6Nd/kiEw==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/is-windows": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-windows/-/is-windows-1.0.2.tgz",
-            "integrity": "sha512-eXK1UInq2bPmjyX6e3VHIzMLobc4J94i4AWn+Hpq3OU5KkrRC96OAcR3PRJ/pGu6m8TRnBHP9dkXQVsT/COVIA==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/is-wsl": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/is-wsl/-/is-wsl-1.1.0.tgz",
-            "integrity": "sha1-HxbkqiKwTRM2tmGIpmrzxgDDpm0=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/isarray": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/isarray/-/isarray-1.0.0.tgz",
-            "integrity": "sha1-u5NdSFgsuhaMBoNJV6VKPgcSTxE=",
-            "dev": true
-        },
-        "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/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/jest-worker": {
-            "version": "26.6.2",
-            "resolved": "https://registry.npmjs.org/jest-worker/-/jest-worker-26.6.2.tgz",
-            "integrity": "sha512-KWYVV1c4i+jbMpaBC+U++4Va0cp8OisU185o73T1vo99hqi7w8tSJfUXYswwqqrjzwxa6KpRK54WhPvwf5w6PQ==",
-            "dev": true,
-            "dependencies": {
-                "@types/node": "*",
-                "merge-stream": "^2.0.0",
-                "supports-color": "^7.0.0"
-            },
-            "engines": {
-                "node": ">= 10.13.0"
-            }
-        },
-        "node_modules/jquery": {
-            "version": "3.6.0",
-            "resolved": "https://registry.npmjs.org/jquery/-/jquery-3.6.0.tgz",
-            "integrity": "sha512-JVzAR/AjBvVt2BmYhxRCSYysDsPcssdmTFnzyLEts9qNwmjmu4JTAMYubEfwVOSwpQ1I1sKKFcxhZCI2buerfw=="
-        },
-        "node_modules/js-tokens": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-4.0.0.tgz",
-            "integrity": "sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==",
-            "dev": true
-        },
-        "node_modules/js-yaml": {
-            "version": "3.14.1",
-            "resolved": "https://registry.npmjs.org/js-yaml/-/js-yaml-3.14.1.tgz",
-            "integrity": "sha512-okMH7OXXJ7YrN9Ok3/SXrnu4iX9yOk+25nqX4imS2npuvTYDmo/QEZoqwZkYaIDk3jVvBOTOIEgEhaLOynBS9g==",
-            "dev": true,
-            "dependencies": {
-                "argparse": "^1.0.7",
-                "esprima": "^4.0.0"
-            },
-            "bin": {
-                "js-yaml": "bin/js-yaml.js"
-            }
-        },
-        "node_modules/jsesc": {
-            "version": "2.5.2",
-            "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-2.5.2.tgz",
-            "integrity": "sha512-OYu7XEzjkCQ3C5Ps3QIZsQfNpqoJyZZA99wd9aWd05NCtC5pWOkShK2mkL6HXQR6/Cy2lbNdPlZBpuQHXE63gA==",
-            "dev": true,
-            "bin": {
-                "jsesc": "bin/jsesc"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "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
-        },
-        "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
-        },
-        "node_modules/json-stable-stringify-without-jsonify": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/json-stable-stringify-without-jsonify/-/json-stable-stringify-without-jsonify-1.0.1.tgz",
-            "integrity": "sha1-nbe1lJatPzz+8wp1FC0tkwrXJlE=",
-            "dev": true
-        },
-        "node_modules/json3": {
-            "version": "3.3.3",
-            "resolved": "https://registry.npmjs.org/json3/-/json3-3.3.3.tgz",
-            "integrity": "sha512-c7/8mbUsKigAbLkD5B010BK4D9LZm7A1pNItkEwiUZRpIN66exu/e7YQWysGun+TRKaJp8MhemM+VkfWv42aCA==",
-            "dev": true
-        },
-        "node_modules/json5": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/json5/-/json5-2.2.0.tgz",
-            "integrity": "sha512-f+8cldu7X/y7RAJurMEJmdoKXGB/X550w2Nr3tTbezL6RwEE/iMcm+tZnXeoZtKuOq6ft8+CqzEkrIgx1fPoQA==",
-            "dev": true,
-            "dependencies": {
-                "minimist": "^1.2.5"
-            },
-            "bin": {
-                "json5": "lib/cli.js"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/killable": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/killable/-/killable-1.0.1.tgz",
-            "integrity": "sha512-LzqtLKlUwirEUyl/nicirVmNiPvYs7l5n8wOPP7fyJVpUPkvCnW/vuiXGpylGUlnPDnB7311rARzAt3Mhswpjg==",
-            "dev": 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/levn": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/levn/-/levn-0.4.1.tgz",
-            "integrity": "sha512-+bT2uH4E5LGE7h/n3evcS/sQlJXCpIp6ym8OWJ5eV6+67Dsql/LaaT7qJBAt2rzfoa/5QBGBhxDix1dMt2kQKQ==",
-            "dev": true,
-            "dependencies": {
-                "prelude-ls": "^1.2.1",
-                "type-check": "~0.4.0"
-            },
-            "engines": {
-                "node": ">= 0.8.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,
-            "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/lodash": {
-            "version": "4.17.21",
-            "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
-            "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg=="
-        },
-        "node_modules/lodash.debounce": {
-            "version": "4.0.8",
-            "resolved": "https://registry.npmjs.org/lodash.debounce/-/lodash.debounce-4.0.8.tgz",
-            "integrity": "sha1-gteb/zCmfEAF/9XiUVMArZyk168=",
-            "dev": true
-        },
-        "node_modules/loglevel": {
-            "version": "1.7.1",
-            "resolved": "https://registry.npmjs.org/loglevel/-/loglevel-1.7.1.tgz",
-            "integrity": "sha512-Hesni4s5UkWkwCGJMQGAh71PaLUmKFM60dHvq0zi/vDhhrzuk+4GgNbTXJ12YYQJn6ZKBDNIjYcuQGKudvqrIw==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6.0"
-            }
-        },
-        "node_modules/lru-cache": {
-            "version": "6.0.0",
-            "resolved": "https://registry.npmjs.org/lru-cache/-/lru-cache-6.0.0.tgz",
-            "integrity": "sha512-Jo6dJ04CmSjuznwJSS3pUeWmd/H0ffTlkXXgwZi+eq1UCmqQwCh+eLsYOYCwY991i2Fah4h1BEMCx4qThGbsiA==",
-            "dev": true,
-            "dependencies": {
-                "yallist": "^4.0.0"
-            },
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/make-dir": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-2.1.0.tgz",
-            "integrity": "sha512-LS9X+dc8KLxXCb8dni79fLIIUA5VyZoyjSMCwTluaXA0o27cCK0bhXkpgw+sTXVpPy/lSO57ilRixqk0vDmtRA==",
-            "dev": true,
-            "dependencies": {
-                "pify": "^4.0.1",
-                "semver": "^5.6.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/make-dir/node_modules/semver": {
-            "version": "5.7.1",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-5.7.1.tgz",
-            "integrity": "sha512-sauaDf/PZdVgrLTNYHRtpXa1iRiKcaebiKQ1BJdpQlWH2lCvexQdX55snPFyK7QzpudqbCI0qXFfOasHdyNDGQ==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver"
-            }
-        },
-        "node_modules/map-cache": {
-            "version": "0.2.2",
-            "resolved": "https://registry.npmjs.org/map-cache/-/map-cache-0.2.2.tgz",
-            "integrity": "sha1-wyq9C9ZSXZsFFkW7TyasXcmKDb8=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/map-visit": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/map-visit/-/map-visit-1.0.0.tgz",
-            "integrity": "sha1-7Nyo8TFE5mDxtb1B8S80edmN+48=",
-            "dev": true,
-            "dependencies": {
-                "object-visit": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/mathjs": {
-            "version": "9.3.0",
-            "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-9.3.0.tgz",
-            "integrity": "sha512-0kYW+TXgB8lCqUj5wHR2hqAO2twSbPRelSFgRJXiwAx4nM6FrIb43Jd6XhW7sVbwYB+9HCNiyg5Kn8VYeB7ilg==",
-            "dependencies": {
-                "complex.js": "^2.0.11",
-                "decimal.js": "^10.2.1",
-                "escape-latex": "^1.2.0",
-                "fraction.js": "^4.0.13",
-                "javascript-natural-sort": "^0.7.1",
-                "seedrandom": "^3.0.5",
-                "tiny-emitter": "^2.1.0",
-                "typed-function": "^2.0.0"
-            },
-            "bin": {
-                "mathjs": "bin/cli.js"
-            },
-            "engines": {
-                "node": ">= 10"
-            }
-        },
-        "node_modules/media-typer": {
-            "version": "0.3.0",
-            "resolved": "https://registry.npmjs.org/media-typer/-/media-typer-0.3.0.tgz",
-            "integrity": "sha1-hxDXrwqmJvj/+hzgAWhUUmMlV0g=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/memory-fs": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/memory-fs/-/memory-fs-0.4.1.tgz",
-            "integrity": "sha1-OpoguEYlI+RHz7x+i7gO1me/xVI=",
-            "dev": true,
-            "dependencies": {
-                "errno": "^0.1.3",
-                "readable-stream": "^2.0.1"
-            }
-        },
-        "node_modules/merge-descriptors": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/merge-descriptors/-/merge-descriptors-1.0.1.tgz",
-            "integrity": "sha1-sAqqVW3YtEVoFQ7J0blT8/kMu2E=",
-            "dev": true
-        },
-        "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/merge2": {
-            "version": "1.4.1",
-            "resolved": "https://registry.npmjs.org/merge2/-/merge2-1.4.1.tgz",
-            "integrity": "sha512-8q7VEgMJW4J8tcfVPy8g09NcQwZdbwFEqhe/WZkoIzjn/3TGDwtOCYtXGxA3O8tPzpczCCDgv+P2P5y00ZJOOg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 8"
-            }
-        },
-        "node_modules/methods": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/methods/-/methods-1.1.2.tgz",
-            "integrity": "sha1-VSmk1nZUE07cxSZmVoNbD4Ua/O4=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/micromatch": {
-            "version": "4.0.2",
-            "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.2.tgz",
-            "integrity": "sha512-y7FpHSbMUMoyPbYUSzO6PaZ6FyRnQOpHuKwbo1G+Knck95XVU4QAiKdGEnj5wwoS7PlOgthX/09u5iFJ+aYf5Q==",
-            "dev": true,
-            "dependencies": {
-                "braces": "^3.0.1",
-                "picomatch": "^2.0.5"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/mime": {
-            "version": "1.6.0",
-            "resolved": "https://registry.npmjs.org/mime/-/mime-1.6.0.tgz",
-            "integrity": "sha512-x0Vn8spI+wuJ1O6S7gnbaQg8Pxh4NNHb7KSINmEWKiPE4RKOplvijn+NkmYmmRgP68mc70j2EbeTFRsrswaQeg==",
-            "dev": true,
-            "bin": {
-                "mime": "cli.js"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/mime-db": {
-            "version": "1.46.0",
-            "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.46.0.tgz",
-            "integrity": "sha512-svXaP8UQRZ5K7or+ZmfNhg2xX3yKDMUzqadsSqi4NCH/KomcH75MAMYAGVlvXn4+b/xOPhS3I2uHKRUzvjY7BQ==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/mime-types": {
-            "version": "2.1.29",
-            "resolved": "https://registry.npmjs.org/mime-types/-/mime-types-2.1.29.tgz",
-            "integrity": "sha512-Y/jMt/S5sR9OaqteJtslsFZKWOIIqMACsJSiHghlCAyhf7jfVYjKBmLiX8OgpWeW+fjJ2b+Az69aPFPkUOY6xQ==",
-            "dev": true,
-            "dependencies": {
-                "mime-db": "1.46.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/minimalistic-assert": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/minimalistic-assert/-/minimalistic-assert-1.0.1.tgz",
-            "integrity": "sha512-UtJcAD4yEaGtjPezWuO9wC4nwUnVH/8/Im3yEHQP4b67cXlD/Qr9hdITCU1xDbSEXg2XKNaP8jsReV7vQd00/A==",
-            "dev": true
-        },
-        "node_modules/minimatch": {
-            "version": "3.0.4",
-            "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.4.tgz",
-            "integrity": "sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==",
-            "dev": true,
-            "dependencies": {
-                "brace-expansion": "^1.1.7"
-            },
-            "engines": {
-                "node": "*"
-            }
-        },
-        "node_modules/minimist": {
-            "version": "1.2.5",
-            "resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.5.tgz",
-            "integrity": "sha512-FM9nNUYrRBAELZQT3xeZQ7fmMOBg6nWNmJKTcgsJeaLstP/UODVpGsr5OhXhhXg6f+qtJ8uiZ+PUxkDWcgIXLw==",
-            "dev": true
-        },
-        "node_modules/mixin-deep": {
-            "version": "1.3.2",
-            "resolved": "https://registry.npmjs.org/mixin-deep/-/mixin-deep-1.3.2.tgz",
-            "integrity": "sha512-WRoDn//mXBiJ1H40rqa3vH0toePwSsGb45iInWlTySa+Uu4k3tYUSxa2v1KqAiLtvlrSzaExqS1gtk96A9zvEA==",
-            "dev": true,
-            "dependencies": {
-                "for-in": "^1.0.2",
-                "is-extendable": "^1.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/mixin-deep/node_modules/is-extendable": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-1.0.1.tgz",
-            "integrity": "sha512-arnXMxT1hhoKo9k1LZdmlNyJdDDfy2v0fXjFlmok4+i8ul/6WlbVge9bhM74OpNPQPMGUToDtz+KXa1PneJxOA==",
-            "dev": true,
-            "dependencies": {
-                "is-plain-object": "^2.0.4"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/mkdirp": {
-            "version": "0.5.5",
-            "resolved": "https://registry.npmjs.org/mkdirp/-/mkdirp-0.5.5.tgz",
-            "integrity": "sha512-NKmAlESf6jMGym1++R0Ra7wvhV+wFW63FaSOFPwRahvea0gMUcGUhVeAg/0BC0wiv9ih5NYPB1Wn1UEI1/L+xQ==",
-            "dev": true,
-            "dependencies": {
-                "minimist": "^1.2.5"
-            },
-            "bin": {
-                "mkdirp": "bin/cmd.js"
-            }
-        },
-        "node_modules/ms": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz",
-            "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==",
-            "dev": true
-        },
-        "node_modules/multicast-dns": {
-            "version": "6.2.3",
-            "resolved": "https://registry.npmjs.org/multicast-dns/-/multicast-dns-6.2.3.tgz",
-            "integrity": "sha512-ji6J5enbMyGRHIAkAOu3WdV8nggqviKCEKtXcOqfphZZtQrmHKycfynJ2V7eVPUA4NhJ6V7Wf4TmGbTwKE9B6g==",
-            "dev": true,
-            "dependencies": {
-                "dns-packet": "^1.3.1",
-                "thunky": "^1.0.2"
-            },
-            "bin": {
-                "multicast-dns": "cli.js"
-            }
-        },
-        "node_modules/multicast-dns-service-types": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/multicast-dns-service-types/-/multicast-dns-service-types-1.1.0.tgz",
-            "integrity": "sha1-iZ8R2WhuXgXLkbNdXw5jt3PPyQE=",
-            "dev": true
-        },
-        "node_modules/nan": {
-            "version": "2.14.2",
-            "resolved": "https://registry.npmjs.org/nan/-/nan-2.14.2.tgz",
-            "integrity": "sha512-M2ufzIiINKCuDfBSAUr1vWQ+vuVcA9kqx8JJUsbQi6yf1uGRyb7HfpdfUr5qLXf3B/t8dPvcjhKMmlfnP47EzQ==",
-            "dev": true,
-            "optional": true
-        },
-        "node_modules/nanomatch": {
-            "version": "1.2.13",
-            "resolved": "https://registry.npmjs.org/nanomatch/-/nanomatch-1.2.13.tgz",
-            "integrity": "sha512-fpoe2T0RbHwBTBUOftAfBPaDEi06ufaUai0mE6Yn1kacc3SnTErfb/h+X94VXzI64rKFHYImXSvdwGGCmwOqCA==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/natural-compare": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/natural-compare/-/natural-compare-1.4.0.tgz",
-            "integrity": "sha1-Sr6/7tdUHywnrPspvbvRXI1bpPc=",
-            "dev": true
-        },
-        "node_modules/negotiator": {
-            "version": "0.6.2",
-            "resolved": "https://registry.npmjs.org/negotiator/-/negotiator-0.6.2.tgz",
-            "integrity": "sha512-hZXc7K2e+PgeI1eDBe/10Ard4ekbfrrqG8Ep+8Jmf4JID2bNg7NvCPOZN+kfF574pFQI7mum2AUqDidoKqcTOw==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.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
-        },
-        "node_modules/nice-try": {
-            "version": "1.0.5",
-            "resolved": "https://registry.npmjs.org/nice-try/-/nice-try-1.0.5.tgz",
-            "integrity": "sha512-1nh45deeb5olNY7eX82BkPO7SSxR5SSYJiPTrTdFUVYwAl8CKMA5N9PjTYkHiRjisVcxcQ1HXdLhx2qxxJzLNQ==",
-            "dev": true
-        },
-        "node_modules/node-forge": {
-            "version": "0.10.0",
-            "resolved": "https://registry.npmjs.org/node-forge/-/node-forge-0.10.0.tgz",
-            "integrity": "sha512-PPmu8eEeG9saEUvI97fm4OYxXVB6bFvyNTyiUOBichBpFG8A1Ljw3bY62+5oOjDEMHRnd0Y7HQ+x7uzxOzC6JA==",
-            "dev": true,
-            "engines": {
-                "node": ">= 6.0.0"
-            }
-        },
-        "node_modules/node-releases": {
-            "version": "1.1.73",
-            "resolved": "https://registry.npmjs.org/node-releases/-/node-releases-1.1.73.tgz",
-            "integrity": "sha512-uW7fodD6pyW2FZNZnp/Z3hvWKeEW1Y8R1+1CnErE8cXFXzl5blBOoVB41CvMer6P6Q0S5FXDwcHgFd1Wj0U9zg==",
-            "dev": true
-        },
-        "node_modules/normalize-path": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-3.0.0.tgz",
-            "integrity": "sha512-6eZs5Ls3WtCisHWp9S2GUy8dqkpGi4BVSz3GaqiE6ezub0512ESztXUwUB6C6IKbQkY2Pnb/mD4WYojCRwcwLA==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "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/object-assign": {
-            "version": "4.1.1",
-            "resolved": "https://registry.npmjs.org/object-assign/-/object-assign-4.1.1.tgz",
-            "integrity": "sha1-IQmtx5ZYh8/AXLvUQsrIv7s2CGM=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/object-copy": {
-            "version": "0.1.0",
-            "resolved": "https://registry.npmjs.org/object-copy/-/object-copy-0.1.0.tgz",
-            "integrity": "sha1-fn2Fi3gb18mRpBupde04EnVOmYw=",
-            "dev": true,
-            "dependencies": {
-                "copy-descriptor": "^0.1.0",
-                "define-property": "^0.2.5",
-                "kind-of": "^3.0.3"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/object-copy/node_modules/define-property": {
-            "version": "0.2.5",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-            "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/object-copy/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/object-is": {
-            "version": "1.1.5",
-            "resolved": "https://registry.npmjs.org/object-is/-/object-is-1.1.5.tgz",
-            "integrity": "sha512-3cyDsyHgtmi7I7DfSSI2LDp6SK2lwvtbg0p0R1e0RvTqF5ceGx+K2dfSjm1bKDMVCFEDAQvy+o8c6a7VujOddw==",
-            "dev": true,
-            "dependencies": {
-                "call-bind": "^1.0.2",
-                "define-properties": "^1.1.3"
-            },
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/object-keys": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/object-keys/-/object-keys-1.1.1.tgz",
-            "integrity": "sha512-NuAESUOUMrlIXOfHKzD6bpPu3tYt3xvjNdRIQ+FeT0lNb4K8WR70CaDxhuNguS2XG+GjkyMwOzsN5ZktImfhLA==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/object-visit": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/object-visit/-/object-visit-1.0.1.tgz",
-            "integrity": "sha1-95xEk68MU3e1n+OdOV5BBC3QRbs=",
-            "dev": true,
-            "dependencies": {
-                "isobject": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/object.assign": {
-            "version": "4.1.2",
-            "resolved": "https://registry.npmjs.org/object.assign/-/object.assign-4.1.2.tgz",
-            "integrity": "sha512-ixT2L5THXsApyiUPYKmW+2EHpXXe5Ii3M+f4e+aJFAHao5amFRW6J0OO6c/LU8Be47utCx2GL89hxGB6XSmKuQ==",
-            "dev": true,
-            "dependencies": {
-                "call-bind": "^1.0.0",
-                "define-properties": "^1.1.3",
-                "has-symbols": "^1.0.1",
-                "object-keys": "^1.1.1"
-            },
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/object.pick": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/object.pick/-/object.pick-1.3.0.tgz",
-            "integrity": "sha1-h6EKxMFpS9Lhy/U1kaZhQftd10c=",
-            "dev": true,
-            "dependencies": {
-                "isobject": "^3.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/obuf": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/obuf/-/obuf-1.1.2.tgz",
-            "integrity": "sha512-PX1wu0AmAdPqOL1mWhqmlOd8kOIZQwGZw6rh7uby9fTc5lhaOWFLX3I6R1hrF9k3zUY40e6igsLGkDXK92LJNg==",
-            "dev": true
-        },
-        "node_modules/on-finished": {
-            "version": "2.3.0",
-            "resolved": "https://registry.npmjs.org/on-finished/-/on-finished-2.3.0.tgz",
-            "integrity": "sha1-IPEzZIGwg811M3mSoWlxqi2QaUc=",
-            "dev": true,
-            "dependencies": {
-                "ee-first": "1.1.1"
-            },
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/on-headers": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/on-headers/-/on-headers-1.0.2.tgz",
-            "integrity": "sha512-pZAE+FJLoyITytdqK0U5s+FIpjN0JP3OzFi/u8Rx+EV5/W+JTWGXG8xFzevE7AjBfDqHv/8vL8qQsIhHnqRkrA==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/once": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz",
-            "integrity": "sha1-WDsap3WWHUsROsF9nFC6753Xa9E=",
-            "dev": true,
-            "dependencies": {
-                "wrappy": "1"
-            }
-        },
-        "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"
-            }
-        },
-        "node_modules/opn": {
-            "version": "5.5.0",
-            "resolved": "https://registry.npmjs.org/opn/-/opn-5.5.0.tgz",
-            "integrity": "sha512-PqHpggC9bLV0VeWcdKhkpxY+3JTzetLSqTCWL/z/tFIbI6G8JCjondXklT1JinczLz2Xib62sSp0T/gKT4KksA==",
-            "dev": true,
-            "dependencies": {
-                "is-wsl": "^1.1.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/optionator": {
-            "version": "0.9.1",
-            "resolved": "https://registry.npmjs.org/optionator/-/optionator-0.9.1.tgz",
-            "integrity": "sha512-74RlY5FCnhq4jRxVUPKDaRwrVNXMqsGsiW6AJw4XK8hmtm10wC0ypZBLw5IIp85NZMr91+qd1RvvENwg7jjRFw==",
-            "dev": true,
-            "dependencies": {
-                "deep-is": "^0.1.3",
-                "fast-levenshtein": "^2.0.6",
-                "levn": "^0.4.1",
-                "prelude-ls": "^1.2.1",
-                "type-check": "^0.4.0",
-                "word-wrap": "^1.2.3"
-            },
-            "engines": {
-                "node": ">= 0.8.0"
-            }
-        },
-        "node_modules/original": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/original/-/original-1.0.2.tgz",
-            "integrity": "sha512-hyBVl6iqqUOJ8FqRe+l/gS8H+kKYjrEndd5Pm1MfBtsEKA038HkkdbAl/72EAXGyonD/PFsvmVG+EvcIpliMBg==",
-            "dev": true,
-            "dependencies": {
-                "url-parse": "^1.4.3"
-            }
-        },
-        "node_modules/p-finally": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/p-finally/-/p-finally-1.0.0.tgz",
-            "integrity": "sha1-P7z7FbiZpEEjs0ttzBi3JDNqLK4=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "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"
-            }
-        },
-        "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-map": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/p-map/-/p-map-2.1.0.tgz",
-            "integrity": "sha512-y3b8Kpd8OAN444hxfBbFfj1FY/RjtTd8tzYwhUqNYXx0fXx2iX4maP4Qr6qhIKbQXI02wTLAda4fYUbDagTUFw==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/p-retry": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/p-retry/-/p-retry-3.0.1.tgz",
-            "integrity": "sha512-XE6G4+YTTkT2a0UWb2kjZe8xNwf8bIbnqpc/IS/idOBVhyves0mK5OJgeocjx7q5pvX/6m23xuzVPYT1uGM73w==",
-            "dev": true,
-            "dependencies": {
-                "retry": "^0.12.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "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/parent-module": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/parent-module/-/parent-module-1.0.1.tgz",
-            "integrity": "sha512-GQ2EWRpQV8/o+Aw8YqtfZZPfNRWZYkbidE9k5rpl/hC3vtHHBfGm2Ifi6qWV+coDGkrUKZAxE3Lot5kcsRlh+g==",
-            "dev": true,
-            "dependencies": {
-                "callsites": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/parseurl": {
-            "version": "1.3.3",
-            "resolved": "https://registry.npmjs.org/parseurl/-/parseurl-1.3.3.tgz",
-            "integrity": "sha512-CiyeOxFT/JZyN5m0z9PfXw4SCBJ6Sygz1Dpl0wqjlhDEGGBP1GnsUVEL0p63hoG1fcj3fHynXi9NYO4nWOL+qQ==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/pascalcase": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/pascalcase/-/pascalcase-0.1.1.tgz",
-            "integrity": "sha1-s2PlXoAGym/iF4TS2yK9FdeRfxQ=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/path-dirname": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/path-dirname/-/path-dirname-1.0.2.tgz",
-            "integrity": "sha1-zDPSTVJeCZpTiMAzbG4yuRYGCeA=",
-            "dev": true
-        },
-        "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-is-absolute": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/path-is-absolute/-/path-is-absolute-1.0.1.tgz",
-            "integrity": "sha1-F0uSaHNVNP+8es5r9TpanhtcX18=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/path-is-inside": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/path-is-inside/-/path-is-inside-1.0.2.tgz",
-            "integrity": "sha1-NlQX3t5EQw0cEa9hAn+s8HS9/FM=",
-            "dev": true
-        },
-        "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.6",
-            "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.6.tgz",
-            "integrity": "sha512-GSmOT2EbHrINBf9SR7CDELwlJ8AENk3Qn7OikK4nFYAu3Ote2+JYNVvkpAEQm3/TLNEJFD/xZJjzyxg3KBWOzw==",
-            "dev": true
-        },
-        "node_modules/path-to-regexp": {
-            "version": "0.1.7",
-            "resolved": "https://registry.npmjs.org/path-to-regexp/-/path-to-regexp-0.1.7.tgz",
-            "integrity": "sha1-32BBeABfUi8V60SQ5yR6G/qmf4w=",
-            "dev": true
-        },
-        "node_modules/path-type": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/path-type/-/path-type-4.0.0.tgz",
-            "integrity": "sha512-gDKb8aZMDeD/tZWs9P6+q0J9Mwkdl6xMV8TjnGP3qJVJ06bdMgkbBlLU8IdfOsIsFz2BW1rNVT3XuNEl8zPAvw==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/picomatch": {
-            "version": "2.2.2",
-            "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-2.2.2.tgz",
-            "integrity": "sha512-q0M/9eZHzmr0AulXyPwNfZjtwZ/RBZlbN3K3CErVrk50T2ASYI7Bye0EvekFY3IP1Nt2DHu0re+V2ZHIpMkuWg==",
-            "dev": true,
-            "engines": {
-                "node": ">=8.6"
-            }
-        },
-        "node_modules/pify": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/pify/-/pify-4.0.1.tgz",
-            "integrity": "sha512-uB80kBFb/tfd68bVleG9T5GGsGPjJrLAUpR5PZIrhBnIaRTQRjqdJSsIKkOP6OAIFbj7GOrcudc5pNjZ+geV2g==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/pinkie": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/pinkie/-/pinkie-2.0.4.tgz",
-            "integrity": "sha1-clVrgM+g1IqXToDnckjoDtT3+HA=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/pinkie-promise": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/pinkie-promise/-/pinkie-promise-2.0.1.tgz",
-            "integrity": "sha1-ITXW36ejWMBprJsXh3YogihFD/o=",
-            "dev": true,
-            "dependencies": {
-                "pinkie": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "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/portfinder": {
-            "version": "1.0.28",
-            "resolved": "https://registry.npmjs.org/portfinder/-/portfinder-1.0.28.tgz",
-            "integrity": "sha512-Se+2isanIcEqf2XMHjyUKskczxbPH7dQnlMjXX6+dybayyHvAf/TCgyMRlzf/B6QDhAEFOGes0pzRo3by4AbMA==",
-            "dev": true,
-            "dependencies": {
-                "async": "^2.6.2",
-                "debug": "^3.1.1",
-                "mkdirp": "^0.5.5"
-            },
-            "engines": {
-                "node": ">= 0.12.0"
-            }
-        },
-        "node_modules/portfinder/node_modules/debug": {
-            "version": "3.2.7",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.7.tgz",
-            "integrity": "sha512-CFjzYYAi4ThfiQvizrFQevTTXHtnCqWfe7x1AhgEscTz6ZbLbfoLRLPugTQyBth6f8ZERVUSyWHFD/7Wu4t1XQ==",
-            "dev": true,
-            "dependencies": {
-                "ms": "^2.1.1"
-            }
-        },
-        "node_modules/posix-character-classes": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/posix-character-classes/-/posix-character-classes-0.1.1.tgz",
-            "integrity": "sha1-AerA/jta9xoqbAL+q7jB/vfgDqs=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/prelude-ls": {
-            "version": "1.2.1",
-            "resolved": "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.2.1.tgz",
-            "integrity": "sha512-vkcDPrRZo1QZLbn5RLGPpg/WmIQ65qoWWhcGKf/b5eplkkarX0m9z8ppCat4mlOqUsWpyNuYgO3VRyrYHSzX5g==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8.0"
-            }
-        },
-        "node_modules/process-nextick-args": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/process-nextick-args/-/process-nextick-args-2.0.1.tgz",
-            "integrity": "sha512-3ouUOpQhtgrbOa17J7+uxOTpITYWaGP7/AhoR3+A+/1e9skrzelGi/dXzEYyvbxubEF6Wn2ypscTKiKJFFn1ag==",
-            "dev": true
-        },
-        "node_modules/progress": {
-            "version": "2.0.3",
-            "resolved": "https://registry.npmjs.org/progress/-/progress-2.0.3.tgz",
-            "integrity": "sha512-7PiHtLll5LdnKIMw100I+8xJXR5gW2QwWYkT6iJva0bXitZKa/XMrSbdmg3r2Xnaidz9Qumd0VPaMrZlF9V9sA==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.4.0"
-            }
-        },
-        "node_modules/proxy-addr": {
-            "version": "2.0.6",
-            "resolved": "https://registry.npmjs.org/proxy-addr/-/proxy-addr-2.0.6.tgz",
-            "integrity": "sha512-dh/frvCBVmSsDYzw6n926jv974gddhkFPfiN8hPOi30Wax25QZyZEGveluCgliBnqmuM+UJmBErbAUFIoDbjOw==",
-            "dev": true,
-            "dependencies": {
-                "forwarded": "~0.1.2",
-                "ipaddr.js": "1.9.1"
-            },
-            "engines": {
-                "node": ">= 0.10"
-            }
-        },
-        "node_modules/prr": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/prr/-/prr-1.0.1.tgz",
-            "integrity": "sha1-0/wRS6BplaRexok/SEzrHXj19HY=",
-            "dev": true
-        },
-        "node_modules/pump": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/pump/-/pump-3.0.0.tgz",
-            "integrity": "sha512-LwZy+p3SFs1Pytd/jYct4wpv49HiYCqd9Rlc5ZVdk0V+8Yzv6jR5Blk3TRmPL1ft69TxP0IMZGJ+WPFU2BFhww==",
-            "dev": true,
-            "dependencies": {
-                "end-of-stream": "^1.1.0",
-                "once": "^1.3.1"
-            }
-        },
-        "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,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/qs": {
-            "version": "6.7.0",
-            "resolved": "https://registry.npmjs.org/qs/-/qs-6.7.0.tgz",
-            "integrity": "sha512-VCdBRNFTX1fyE7Nb6FYoURo/SPe62QCaAyzJvUjwRaIsc+NePBEniHlvxFmmX56+HZphIGtV0XeCirBtpDrTyQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.6"
-            }
-        },
-        "node_modules/querystring": {
-            "version": "0.2.0",
-            "resolved": "https://registry.npmjs.org/querystring/-/querystring-0.2.0.tgz",
-            "integrity": "sha1-sgmEkgO7Jd+CDadW50cAWHhSFiA=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.4.x"
-            }
-        },
-        "node_modules/querystringify": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/querystringify/-/querystringify-2.2.0.tgz",
-            "integrity": "sha512-FIqgj2EUvTa7R50u0rGsyTftzjYmv/a3hO345bZNrqabNqjtgiDMgmo4mkUjd+nzU5oF3dClKqFIPUKybUyqoQ==",
-            "dev": true
-        },
-        "node_modules/queue-microtask": {
-            "version": "1.2.2",
-            "resolved": "https://registry.npmjs.org/queue-microtask/-/queue-microtask-1.2.2.tgz",
-            "integrity": "sha512-dB15eXv3p2jDlbOiNLyMabYg1/sXvppd8DP2J3EOCQ0AkuSXCW2tP7mnVouVLJKgUMY6yP0kcQDVpLCN13h4Xg==",
-            "dev": true
-        },
-        "node_modules/randombytes": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/randombytes/-/randombytes-2.1.0.tgz",
-            "integrity": "sha512-vYl3iOX+4CKUWuxGi9Ukhie6fsqXqS9FE2Zaic4tNFD2N2QQaXOMFbuKK4QmDHC0JO6B1Zp41J0LpT0oR68amQ==",
-            "dev": true,
-            "dependencies": {
-                "safe-buffer": "^5.1.0"
-            }
-        },
-        "node_modules/range-parser": {
-            "version": "1.2.1",
-            "resolved": "https://registry.npmjs.org/range-parser/-/range-parser-1.2.1.tgz",
-            "integrity": "sha512-Hrgsx+orqoygnmhFbKaHE6c296J+HTAQXoxEF6gNupROmmGJRoyzfG3ccAveqCBrwr/2yxQ5BVd/GTl5agOwSg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/raw-body": {
-            "version": "2.4.0",
-            "resolved": "https://registry.npmjs.org/raw-body/-/raw-body-2.4.0.tgz",
-            "integrity": "sha512-4Oz8DUIwdvoa5qMJelxipzi/iJIi40O5cGV1wNYp5hvZP8ZN0T+jiNkL0QepXs+EsQ9XJ8ipEDoiH70ySUJP3Q==",
-            "dev": true,
-            "dependencies": {
-                "bytes": "3.1.0",
-                "http-errors": "1.7.2",
-                "iconv-lite": "0.4.24",
-                "unpipe": "1.0.0"
-            },
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/raw-body/node_modules/bytes": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.0.tgz",
-            "integrity": "sha512-zauLjrfCG+xvoyaqLoV8bLVXXNGC4JqlxFCutSDWA6fJrTo2ZuvLYTqZ7aHBLZSMOopbzwv8f+wZcVzfVTI2Dg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/readable-stream": {
-            "version": "2.3.7",
-            "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-2.3.7.tgz",
-            "integrity": "sha512-Ebho8K4jIbHAxnuxi7o42OrZgF/ZTNcsZj6nRKyUmkhLFq8CHItp/fy6hQZuZmP/n3yZ9VBUbp4zz/mX8hmYPw==",
-            "dev": true,
-            "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"
-            }
-        },
-        "node_modules/readable-stream/node_modules/safe-buffer": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-            "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-            "dev": true
-        },
-        "node_modules/readdirp": {
-            "version": "2.2.1",
-            "resolved": "https://registry.npmjs.org/readdirp/-/readdirp-2.2.1.tgz",
-            "integrity": "sha512-1JU/8q+VgFZyxwrJ+SVIOsh+KywWGpds3NTqikiKpDMZWScmAYyKIgqkO+ARvNWJfXeXR1zxz7aHF4u4CyH6vQ==",
-            "dev": true,
-            "dependencies": {
-                "graceful-fs": "^4.1.11",
-                "micromatch": "^3.1.10",
-                "readable-stream": "^2.0.2"
-            },
-            "engines": {
-                "node": ">=0.10"
-            }
-        },
-        "node_modules/readdirp/node_modules/braces": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-            "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/readdirp/node_modules/braces/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/readdirp/node_modules/fill-range": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-            "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-            "dev": true,
-            "dependencies": {
-                "extend-shallow": "^2.0.1",
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1",
-                "to-regex-range": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/readdirp/node_modules/fill-range/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/readdirp/node_modules/is-number": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-            "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/readdirp/node_modules/is-number/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/readdirp/node_modules/micromatch": {
-            "version": "3.1.10",
-            "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
-            "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/readdirp/node_modules/to-regex-range": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-            "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-            "dev": true,
-            "dependencies": {
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/rechoir": {
-            "version": "0.7.0",
-            "resolved": "https://registry.npmjs.org/rechoir/-/rechoir-0.7.0.tgz",
-            "integrity": "sha512-ADsDEH2bvbjltXEP+hTIAmeFekTFK0V2BTxMkok6qILyAJEXV0AFfoWcAq4yfll5VdIMd/RVXq0lR+wQi5ZU3Q==",
-            "dev": true,
-            "dependencies": {
-                "resolve": "^1.9.0"
-            },
-            "engines": {
-                "node": ">= 0.10"
-            }
-        },
-        "node_modules/regenerate": {
-            "version": "1.4.2",
-            "resolved": "https://registry.npmjs.org/regenerate/-/regenerate-1.4.2.tgz",
-            "integrity": "sha512-zrceR/XhGYU/d/opr2EKO7aRHUeiBI8qjtfHqADTwZd6Szfy16la6kqD0MIUs5z5hx6AaKa+PixpPrR289+I0A==",
-            "dev": true
-        },
-        "node_modules/regenerate-unicode-properties": {
-            "version": "8.2.0",
-            "resolved": "https://registry.npmjs.org/regenerate-unicode-properties/-/regenerate-unicode-properties-8.2.0.tgz",
-            "integrity": "sha512-F9DjY1vKLo/tPePDycuH3dn9H1OTPIkVD9Kz4LODu+F2C75mgjAJ7x/gwy6ZcSNRAAkhNlJSOHRe8k3p+K9WhA==",
-            "dev": true,
-            "dependencies": {
-                "regenerate": "^1.4.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/regenerator-runtime": {
-            "version": "0.13.7",
-            "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.13.7.tgz",
-            "integrity": "sha512-a54FxoJDIr27pgf7IgeQGxmqUNYrcV338lf/6gH456HZ/PhX+5BcwHXG9ajESmwe6WRO0tAzRUrRmNONWgkrew=="
-        },
-        "node_modules/regenerator-transform": {
-            "version": "0.14.5",
-            "resolved": "https://registry.npmjs.org/regenerator-transform/-/regenerator-transform-0.14.5.tgz",
-            "integrity": "sha512-eOf6vka5IO151Jfsw2NO9WpGX58W6wWmefK3I1zEGr0lOD0u8rwPaNqQL1aRxUaxLeKO3ArNh3VYg1KbaD+FFw==",
-            "dev": true,
-            "dependencies": {
-                "@babel/runtime": "^7.8.4"
-            }
-        },
-        "node_modules/regex-not": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/regex-not/-/regex-not-1.0.2.tgz",
-            "integrity": "sha512-J6SDjUgDxQj5NusnOtdFxDwN/+HWykR8GELwctJ7mdqhcyy1xEc4SRFHUXvxTp661YaVKAjfRLZ9cCqS6tn32A==",
-            "dev": true,
-            "dependencies": {
-                "extend-shallow": "^3.0.2",
-                "safe-regex": "^1.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/regexp.prototype.flags": {
-            "version": "1.3.1",
-            "resolved": "https://registry.npmjs.org/regexp.prototype.flags/-/regexp.prototype.flags-1.3.1.tgz",
-            "integrity": "sha512-JiBdRBq91WlY7uRJ0ds7R+dU02i6LKi8r3BuQhNXn+kmeLN+EfHhfjqMRis1zJxnlu88hq/4dx0P2OP3APRTOA==",
-            "dev": true,
-            "dependencies": {
-                "call-bind": "^1.0.2",
-                "define-properties": "^1.1.3"
-            },
-            "engines": {
-                "node": ">= 0.4"
-            }
-        },
-        "node_modules/regexpp": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/regexpp/-/regexpp-3.1.0.tgz",
-            "integrity": "sha512-ZOIzd8yVsQQA7j8GCSlPGXwg5PfmA1mrq0JP4nGhh54LaKN3xdai/vHUDu74pKwV8OxseMS65u2NImosQcSD0Q==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/regexpu-core": {
-            "version": "4.7.1",
-            "resolved": "https://registry.npmjs.org/regexpu-core/-/regexpu-core-4.7.1.tgz",
-            "integrity": "sha512-ywH2VUraA44DZQuRKzARmw6S66mr48pQVva4LBeRhcOltJ6hExvWly5ZjFLYo67xbIxb6W1q4bAGtgfEl20zfQ==",
-            "dev": true,
-            "dependencies": {
-                "regenerate": "^1.4.0",
-                "regenerate-unicode-properties": "^8.2.0",
-                "regjsgen": "^0.5.1",
-                "regjsparser": "^0.6.4",
-                "unicode-match-property-ecmascript": "^1.0.4",
-                "unicode-match-property-value-ecmascript": "^1.2.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/regjsgen": {
-            "version": "0.5.2",
-            "resolved": "https://registry.npmjs.org/regjsgen/-/regjsgen-0.5.2.tgz",
-            "integrity": "sha512-OFFT3MfrH90xIW8OOSyUrk6QHD5E9JOTeGodiJeBS3J6IwlgzJMNE/1bZklWz5oTg+9dCMyEetclvCVXOPoN3A==",
-            "dev": true
-        },
-        "node_modules/regjsparser": {
-            "version": "0.6.7",
-            "resolved": "https://registry.npmjs.org/regjsparser/-/regjsparser-0.6.7.tgz",
-            "integrity": "sha512-ib77G0uxsA2ovgiYbCVGx4Pv3PSttAx2vIwidqQzbL2U5S4Q+j00HdSAneSBuyVcMvEnTXMjiGgB+DlXozVhpQ==",
-            "dev": true,
-            "dependencies": {
-                "jsesc": "~0.5.0"
-            },
-            "bin": {
-                "regjsparser": "bin/parser"
-            }
-        },
-        "node_modules/regjsparser/node_modules/jsesc": {
-            "version": "0.5.0",
-            "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-0.5.0.tgz",
-            "integrity": "sha1-597mbjXW/Bb3EP6R1c9p9w8IkR0=",
-            "dev": true,
-            "bin": {
-                "jsesc": "bin/jsesc"
-            }
-        },
-        "node_modules/remove-trailing-separator": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/remove-trailing-separator/-/remove-trailing-separator-1.1.0.tgz",
-            "integrity": "sha1-wkvOKig62tW8P1jg1IJJuSN52O8=",
-            "dev": true
-        },
-        "node_modules/repeat-element": {
-            "version": "1.1.3",
-            "resolved": "https://registry.npmjs.org/repeat-element/-/repeat-element-1.1.3.tgz",
-            "integrity": "sha512-ahGq0ZnV5m5XtZLMb+vP76kcAM5nkLqk0lpqAuojSKGgQtn4eRi4ZZGm2olo2zKFH+sMsWaqOCW1dqAnOru72g==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/repeat-string": {
-            "version": "1.6.1",
-            "resolved": "https://registry.npmjs.org/repeat-string/-/repeat-string-1.6.1.tgz",
-            "integrity": "sha1-jcrkcOHIirwtYA//Sndihtp15jc=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10"
-            }
-        },
-        "node_modules/require-directory": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/require-directory/-/require-directory-2.1.1.tgz",
-            "integrity": "sha1-jGStX9MNqxyXbiNE/+f3kqam30I=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/require-from-string": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/require-from-string/-/require-from-string-2.0.2.tgz",
-            "integrity": "sha512-Xf0nWe6RseziFMu+Ap9biiUbmplq6S9/p+7w7YXP/JBHhrUDDUhwa+vANyubuqfZWTveU//DYVGsDG7RKL/vEw==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/require-main-filename": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/require-main-filename/-/require-main-filename-2.0.0.tgz",
-            "integrity": "sha512-NKN5kMDylKuldxYLSUfrbo5Tuzh4hd+2E8NPPX02mZtn1VuREQToYe/ZdlJy+J3uCpfaiGF05e7B8W0iXbQHmg==",
-            "dev": true
-        },
-        "node_modules/requires-port": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/requires-port/-/requires-port-1.0.0.tgz",
-            "integrity": "sha1-kl0mAdOaxIXgkc8NpcbmlNw9yv8=",
-            "dev": true
-        },
-        "node_modules/resolve": {
-            "version": "1.19.0",
-            "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.19.0.tgz",
-            "integrity": "sha512-rArEXAgsBG4UgRGcynxWIWKFvh/XZCcS8UJdHhwy91zwAvCZIbcs+vAbflgBnNjYMs/i/i+/Ux6IZhML1yPvxg==",
-            "dev": true,
-            "dependencies": {
-                "is-core-module": "^2.1.0",
-                "path-parse": "^1.0.6"
-            }
-        },
-        "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/resolve-url": {
-            "version": "0.2.1",
-            "resolved": "https://registry.npmjs.org/resolve-url/-/resolve-url-0.2.1.tgz",
-            "integrity": "sha1-LGN/53yJOv0qZj/iGqkIAGjiBSo=",
-            "dev": true
-        },
-        "node_modules/ret": {
-            "version": "0.1.15",
-            "resolved": "https://registry.npmjs.org/ret/-/ret-0.1.15.tgz",
-            "integrity": "sha512-TTlYpa+OL+vMMNG24xSlQGEJ3B/RzEfUlLct7b5G/ytav+wPrplCpVMFuwzXbkecJrb6IYo1iFb0S9v37754mg==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.12"
-            }
-        },
-        "node_modules/retry": {
-            "version": "0.12.0",
-            "resolved": "https://registry.npmjs.org/retry/-/retry-0.12.0.tgz",
-            "integrity": "sha1-G0KmJmoh8HQh0bC1S33BZ7AcATs=",
-            "dev": true,
-            "engines": {
-                "node": ">= 4"
-            }
-        },
-        "node_modules/reusify": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/reusify/-/reusify-1.0.4.tgz",
-            "integrity": "sha512-U9nH88a3fc/ekCF1l0/UP1IosiuIjyTh7hBvXVMHYgVcfGvt897Xguj2UOLDeI5BG2m7/uwyaLVT6fbtCwTyzw==",
-            "dev": true,
-            "engines": {
-                "iojs": ">=1.0.0",
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/rimraf": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/rimraf/-/rimraf-3.0.2.tgz",
-            "integrity": "sha512-JZkJMZkAGFFPP2YqXZXPbMlMBgsxzE8ILs4lMIX/2o0L9UBw9O/Y3o6wFw/i9YLapcUJWwqbi3kdxIPdC62TIA==",
-            "dev": true,
-            "dependencies": {
-                "glob": "^7.1.3"
-            },
-            "bin": {
-                "rimraf": "bin.js"
-            }
-        },
-        "node_modules/run-parallel": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/run-parallel/-/run-parallel-1.2.0.tgz",
-            "integrity": "sha512-5l4VyZR86LZ/lDxZTR6jqL8AFE2S0IFLMP26AbjsLVADxHdhB/c0GUsH+y39UfCi3dzz8OlQuPmnaJOMoDHQBA==",
-            "dev": true,
-            "dependencies": {
-                "queue-microtask": "^1.2.2"
-            }
-        },
-        "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
-        },
-        "node_modules/safe-regex": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/safe-regex/-/safe-regex-1.1.0.tgz",
-            "integrity": "sha1-QKNmnzsHfR6UPURinhV91IAjvy4=",
-            "dev": true,
-            "dependencies": {
-                "ret": "~0.1.10"
-            }
-        },
-        "node_modules/safer-buffer": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/safer-buffer/-/safer-buffer-2.1.2.tgz",
-            "integrity": "sha512-YZo3K82SD7Riyi0E1EQPojLz7kpepnSQI9IyPbHHg1XXXevb5dJI7tpyN2ADxGcQbHG7vcyRHk0cbwqcQriUtg==",
-            "dev": true
-        },
-        "node_modules/schema-utils": {
-            "version": "2.7.1",
-            "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-2.7.1.tgz",
-            "integrity": "sha512-SHiNtMOUGWBQJwzISiVYKu82GiV4QYGePp3odlY1tuKO7gPtphAT5R/py0fA6xtbgLL/RvtJZnU9b8s0F1q0Xg==",
-            "dev": true,
-            "dependencies": {
-                "@types/json-schema": "^7.0.5",
-                "ajv": "^6.12.4",
-                "ajv-keywords": "^3.5.2"
-            },
-            "engines": {
-                "node": ">= 8.9.0"
-            }
-        },
-        "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/select-hose": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/select-hose/-/select-hose-2.0.0.tgz",
-            "integrity": "sha1-Yl2GWPhlr0Psliv8N2o3NZpJlMo=",
-            "dev": true
-        },
-        "node_modules/selfsigned": {
-            "version": "1.10.8",
-            "resolved": "https://registry.npmjs.org/selfsigned/-/selfsigned-1.10.8.tgz",
-            "integrity": "sha512-2P4PtieJeEwVgTU9QEcwIRDQ/mXJLX8/+I3ur+Pg16nS8oNbrGxEso9NyYWy8NAmXiNl4dlAp5MwoNeCWzON4w==",
-            "dev": true,
-            "dependencies": {
-                "node-forge": "^0.10.0"
-            }
-        },
-        "node_modules/semver": {
-            "version": "7.3.4",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-7.3.4.tgz",
-            "integrity": "sha512-tCfb2WLjqFAtXn4KEdxIhalnRtoKFN7nAwj0B3ZXCbQloV2tq5eDbcTmT68JJD3nRJq24/XgxtQKFIpQdtvmVw==",
-            "dev": true,
-            "dependencies": {
-                "lru-cache": "^6.0.0"
-            },
-            "bin": {
-                "semver": "bin/semver.js"
-            },
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/send": {
-            "version": "0.17.1",
-            "resolved": "https://registry.npmjs.org/send/-/send-0.17.1.tgz",
-            "integrity": "sha512-BsVKsiGcQMFwT8UxypobUKyv7irCNRHk1T0G680vk88yf6LBByGcZJOTJCrTP2xVN6yI+XjPJcNuE3V4fT9sAg==",
-            "dev": true,
-            "dependencies": {
-                "debug": "2.6.9",
-                "depd": "~1.1.2",
-                "destroy": "~1.0.4",
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "etag": "~1.8.1",
-                "fresh": "0.5.2",
-                "http-errors": "~1.7.2",
-                "mime": "1.6.0",
-                "ms": "2.1.1",
-                "on-finished": "~2.3.0",
-                "range-parser": "~1.2.1",
-                "statuses": "~1.5.0"
-            },
-            "engines": {
-                "node": ">= 0.8.0"
-            }
-        },
-        "node_modules/send/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/send/node_modules/debug/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/send/node_modules/ms": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.1.tgz",
-            "integrity": "sha512-tgp+dl5cGk28utYktBsrFqA7HKgrhgPsg6Z/EfhWI4gl1Hwq8B/GmY/0oXZ6nF8hDVesS/FpnYaD/kOWhYQvyg==",
-            "dev": true
-        },
-        "node_modules/serialize-javascript": {
-            "version": "5.0.1",
-            "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-5.0.1.tgz",
-            "integrity": "sha512-SaaNal9imEO737H2c05Og0/8LUXG7EnsZyMa8MzkmuHoELfT6txuj0cMqRj6zfPKnmQ1yasR4PCJc8x+M4JSPA==",
-            "dev": true,
-            "dependencies": {
-                "randombytes": "^2.1.0"
-            }
-        },
-        "node_modules/serve-index": {
-            "version": "1.9.1",
-            "resolved": "https://registry.npmjs.org/serve-index/-/serve-index-1.9.1.tgz",
-            "integrity": "sha1-03aNabHn2C5c4FD/9bRTvqEqkjk=",
-            "dev": true,
-            "dependencies": {
-                "accepts": "~1.3.4",
-                "batch": "0.6.1",
-                "debug": "2.6.9",
-                "escape-html": "~1.0.3",
-                "http-errors": "~1.6.2",
-                "mime-types": "~2.1.17",
-                "parseurl": "~1.3.2"
-            },
-            "engines": {
-                "node": ">= 0.8.0"
-            }
-        },
-        "node_modules/serve-index/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/serve-index/node_modules/http-errors": {
-            "version": "1.6.3",
-            "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.6.3.tgz",
-            "integrity": "sha1-i1VoC7S+KDoLW/TqLjhYC+HZMg0=",
-            "dev": true,
-            "dependencies": {
-                "depd": "~1.1.2",
-                "inherits": "2.0.3",
-                "setprototypeof": "1.1.0",
-                "statuses": ">= 1.4.0 < 2"
-            },
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/serve-index/node_modules/inherits": {
-            "version": "2.0.3",
-            "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
-            "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=",
-            "dev": true
-        },
-        "node_modules/serve-index/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/serve-index/node_modules/setprototypeof": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.0.tgz",
-            "integrity": "sha512-BvE/TwpZX4FXExxOxZyRGQQv651MSwmWKZGqvmPcRIjDqWub67kTKuIMx43cZZrS/cBBzwBcNDWoFxt2XEFIpQ==",
-            "dev": true
-        },
-        "node_modules/serve-static": {
-            "version": "1.14.1",
-            "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.14.1.tgz",
-            "integrity": "sha512-JMrvUwE54emCYWlTI+hGrGv5I8dEwmco/00EvkzIIsR7MqrHonbD9pO2MOfFnpFntl7ecpZs+3mW+XbQZu9QCg==",
-            "dev": true,
-            "dependencies": {
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "parseurl": "~1.3.3",
-                "send": "0.17.1"
-            },
-            "engines": {
-                "node": ">= 0.8.0"
-            }
-        },
-        "node_modules/set-blocking": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/set-blocking/-/set-blocking-2.0.0.tgz",
-            "integrity": "sha1-BF+XgtARrppoA93TgrJDkrPYkPc=",
-            "dev": true
-        },
-        "node_modules/set-value": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/set-value/-/set-value-2.0.1.tgz",
-            "integrity": "sha512-JxHc1weCN68wRY0fhCoXpyK55m/XPHafOmK4UWD7m2CI14GMcFypt4w/0+NV5f/ZMby2F6S2wwA7fgynh9gWSw==",
-            "dev": true,
-            "dependencies": {
-                "extend-shallow": "^2.0.1",
-                "is-extendable": "^0.1.1",
-                "is-plain-object": "^2.0.3",
-                "split-string": "^3.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/set-value/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/setprototypeof": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.1.tgz",
-            "integrity": "sha512-JvdAWfbXeIGaZ9cILp38HntZSFSo3mWg6xGcJJsd+d4aRMOqauag1C63dJfDw7OaMYwEbHMOxEZ1lqVRYP2OAw==",
-            "dev": true
-        },
-        "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.3",
-            "resolved": "https://registry.npmjs.org/signal-exit/-/signal-exit-3.0.3.tgz",
-            "integrity": "sha512-VUJ49FC8U1OxwZLxIbTTrDvLnf/6TDgxZcK8wxR8zs13xpx7xbG60ndBlhNrFi2EMuFRoeDoJO7wthSLq42EjA==",
-            "dev": true
-        },
-        "node_modules/slash": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/slash/-/slash-3.0.0.tgz",
-            "integrity": "sha512-g9Q1haeby36OSStwb4ntCGGGaKsaVSjQ68fBxoQcutl5fS1vuY18H3wSt3jFyFtrkx+Kz0V1G85A4MyAdDMi2Q==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/slice-ansi": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/slice-ansi/-/slice-ansi-4.0.0.tgz",
-            "integrity": "sha512-qMCMfhY040cVHT43K9BFygqYbUPFZKHOg7K73mtTWJRb8pyP3fzf4Ixd5SzdEJQ6MRUg/WBnOLxghZtKKurENQ==",
-            "dev": true,
-            "dependencies": {
-                "ansi-styles": "^4.0.0",
-                "astral-regex": "^2.0.0",
-                "is-fullwidth-code-point": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/snapdragon": {
-            "version": "0.8.2",
-            "resolved": "https://registry.npmjs.org/snapdragon/-/snapdragon-0.8.2.tgz",
-            "integrity": "sha512-FtyOnWN/wCHTVXOMwvSv26d+ko5vWlIDD6zoUJ7LW8vh+ZBC8QdljveRP+crNrtBwioEUWy/4dMtbBjA4ioNlg==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon-node": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/snapdragon-node/-/snapdragon-node-2.1.1.tgz",
-            "integrity": "sha512-O27l4xaMYt/RSQ5TR3vpWCAB5Kb/czIcqUFOM/C4fYcLnbZUc1PkjTAMjof2pBWaSTwOUd6qUHcFGVGj7aIwnw==",
-            "dev": true,
-            "dependencies": {
-                "define-property": "^1.0.0",
-                "isobject": "^3.0.0",
-                "snapdragon-util": "^3.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon-node/node_modules/define-property": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
-            "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon-node/node_modules/is-accessor-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-            "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon-node/node_modules/is-data-descriptor": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-            "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon-node/node_modules/is-descriptor": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-            "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-            "dev": true,
-            "dependencies": {
-                "is-accessor-descriptor": "^1.0.0",
-                "is-data-descriptor": "^1.0.0",
-                "kind-of": "^6.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon-util": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/snapdragon-util/-/snapdragon-util-3.0.1.tgz",
-            "integrity": "sha512-mbKkMdQKsjX4BAL4bRYTj21edOf8cN7XHdYUJEe+Zn99hVEYcMvKPct1IqNe7+AZPirn8BCDOQBHQZknqmKlZQ==",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.2.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon-util/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon/node_modules/debug": {
-            "version": "2.6.9",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-            "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-            "dev": true,
-            "dependencies": {
-                "ms": "2.0.0"
-            }
-        },
-        "node_modules/snapdragon/node_modules/define-property": {
-            "version": "0.2.5",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-            "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/snapdragon/node_modules/ms": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-            "dev": true
-        },
-        "node_modules/snapdragon/node_modules/source-map": {
-            "version": "0.5.7",
-            "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-            "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/sockjs": {
-            "version": "0.3.21",
-            "resolved": "https://registry.npmjs.org/sockjs/-/sockjs-0.3.21.tgz",
-            "integrity": "sha512-DhbPFGpxjc6Z3I+uX07Id5ZO2XwYsWOrYjaSeieES78cq+JaJvVe5q/m1uvjIQhXinhIeCFRH6JgXe+mvVMyXw==",
-            "dev": true,
-            "dependencies": {
-                "faye-websocket": "^0.11.3",
-                "uuid": "^3.4.0",
-                "websocket-driver": "^0.7.4"
-            }
-        },
-        "node_modules/sockjs-client": {
-            "version": "1.5.0",
-            "resolved": "https://registry.npmjs.org/sockjs-client/-/sockjs-client-1.5.0.tgz",
-            "integrity": "sha512-8Dt3BDi4FYNrCFGTL/HtwVzkARrENdwOUf1ZoW/9p3M8lZdFT35jVdrHza+qgxuG9H3/shR4cuX/X9umUrjP8Q==",
-            "dev": true,
-            "dependencies": {
-                "debug": "^3.2.6",
-                "eventsource": "^1.0.7",
-                "faye-websocket": "^0.11.3",
-                "inherits": "^2.0.4",
-                "json3": "^3.3.3",
-                "url-parse": "^1.4.7"
-            }
-        },
-        "node_modules/sockjs-client/node_modules/debug": {
-            "version": "3.2.7",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.7.tgz",
-            "integrity": "sha512-CFjzYYAi4ThfiQvizrFQevTTXHtnCqWfe7x1AhgEscTz6ZbLbfoLRLPugTQyBth6f8ZERVUSyWHFD/7Wu4t1XQ==",
-            "dev": true,
-            "dependencies": {
-                "ms": "^2.1.1"
-            }
-        },
-        "node_modules/source-list-map": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/source-list-map/-/source-list-map-2.0.1.tgz",
-            "integrity": "sha512-qnQ7gVMxGNxsiL4lEuJwe/To8UnK7fAnmbGEEH8RpLouuKbeEm0lhbQVFIrNSuB+G7tVrAlVsZgETT5nljf+Iw==",
-            "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,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/source-map-resolve": {
-            "version": "0.5.3",
-            "resolved": "https://registry.npmjs.org/source-map-resolve/-/source-map-resolve-0.5.3.tgz",
-            "integrity": "sha512-Htz+RnsXWk5+P2slx5Jh3Q66vhQj1Cllm0zvnaY98+NFx+Dv2CF/f5O/t8x+KaNdrdIAsruNzoh/KpialbqAnw==",
-            "dev": true,
-            "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"
-            }
-        },
-        "node_modules/source-map-support": {
-            "version": "0.5.19",
-            "resolved": "https://registry.npmjs.org/source-map-support/-/source-map-support-0.5.19.tgz",
-            "integrity": "sha512-Wonm7zOCIJzBGQdB+thsPar0kYuCIzYvxZwlBa87yi/Mdjv7Tip2cyVbLj5o0cFPN4EVkuTwb3GDDyUx2DGnGw==",
-            "dev": true,
-            "dependencies": {
-                "buffer-from": "^1.0.0",
-                "source-map": "^0.6.0"
-            }
-        },
-        "node_modules/source-map-url": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/source-map-url/-/source-map-url-0.4.1.tgz",
-            "integrity": "sha512-cPiFOTLUKvJFIg4SKVScy4ilPPW6rFgMgfuZJPNoDuMs3nC1HbMUycBoJw77xFIp6z1UJQJOfx6C9GMH80DiTw==",
-            "dev": true
-        },
-        "node_modules/spdy": {
-            "version": "4.0.2",
-            "resolved": "https://registry.npmjs.org/spdy/-/spdy-4.0.2.tgz",
-            "integrity": "sha512-r46gZQZQV+Kl9oItvl1JZZqJKGr+oEkB08A6BzkiR7593/7IbtuncXHd2YoYeTsG4157ZssMu9KYvUHLcjcDoA==",
-            "dev": true,
-            "dependencies": {
-                "debug": "^4.1.0",
-                "handle-thing": "^2.0.0",
-                "http-deceiver": "^1.2.7",
-                "select-hose": "^2.0.0",
-                "spdy-transport": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6.0.0"
-            }
-        },
-        "node_modules/spdy-transport": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/spdy-transport/-/spdy-transport-3.0.0.tgz",
-            "integrity": "sha512-hsLVFE5SjA6TCisWeJXFKniGGOpBgMLmerfO2aCyCU5s7nJ/rpAepqmFifv/GCbSbueEeAJJnmSQ2rKC/g8Fcw==",
-            "dev": true,
-            "dependencies": {
-                "debug": "^4.1.0",
-                "detect-node": "^2.0.4",
-                "hpack.js": "^2.1.6",
-                "obuf": "^1.1.2",
-                "readable-stream": "^3.0.6",
-                "wbuf": "^1.7.3"
-            }
-        },
-        "node_modules/spdy-transport/node_modules/readable-stream": {
-            "version": "3.6.0",
-            "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-3.6.0.tgz",
-            "integrity": "sha512-BViHy7LKeTz4oNnkcLJ+lVSL6vpiFeX6/d3oSH8zCW7UxP2onchk+vTGB143xuFjHS3deTgkKoXXymXqymiIdA==",
-            "dev": true,
-            "dependencies": {
-                "inherits": "^2.0.3",
-                "string_decoder": "^1.1.1",
-                "util-deprecate": "^1.0.1"
-            },
-            "engines": {
-                "node": ">= 6"
-            }
-        },
-        "node_modules/split-string": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/split-string/-/split-string-3.1.0.tgz",
-            "integrity": "sha512-NzNVhJDYpwceVVii8/Hu6DKfD2G+NrQHlS/V/qgv763EYudVwEcMQNxd2lh+0VrUByXN/oJkl5grOhYWvQUYiw==",
-            "dev": true,
-            "dependencies": {
-                "extend-shallow": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/sprintf-js": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/sprintf-js/-/sprintf-js-1.0.3.tgz",
-            "integrity": "sha1-BOaSb2YolTVPPdAVIDYzuFcpfiw=",
-            "dev": true
-        },
-        "node_modules/static-extend": {
-            "version": "0.1.2",
-            "resolved": "https://registry.npmjs.org/static-extend/-/static-extend-0.1.2.tgz",
-            "integrity": "sha1-YICcOcv/VTNyJv1eC1IPNB8ftcY=",
-            "dev": true,
-            "dependencies": {
-                "define-property": "^0.2.5",
-                "object-copy": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/static-extend/node_modules/define-property": {
-            "version": "0.2.5",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-            "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-            "dev": true,
-            "dependencies": {
-                "is-descriptor": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/statuses": {
-            "version": "1.5.0",
-            "resolved": "https://registry.npmjs.org/statuses/-/statuses-1.5.0.tgz",
-            "integrity": "sha1-Fhx9rBd2Wf2YEfQ3cfqZOBR4Yow=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/string_decoder": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/string_decoder/-/string_decoder-1.1.1.tgz",
-            "integrity": "sha512-n/ShnvDi6FHbbVfviro+WojiFzv+s8MPMHBczVePfUpDJLwoLT0ht1l4YwBCbi8pJAveEEdnkHyPyTP/mzRfwg==",
-            "dev": true,
-            "dependencies": {
-                "safe-buffer": "~5.1.0"
-            }
-        },
-        "node_modules/string_decoder/node_modules/safe-buffer": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-            "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-            "dev": true
-        },
-        "node_modules/string-width": {
-            "version": "4.2.2",
-            "resolved": "https://registry.npmjs.org/string-width/-/string-width-4.2.2.tgz",
-            "integrity": "sha512-XBJbT3N4JhVumXE0eoLU9DCjcaF92KLNqTmFCnG1pf8duUxFGwtP6AD6nkjw9a3IdiRtL3E2w3JDiE/xi3vOeA==",
-            "dev": true,
-            "dependencies": {
-                "emoji-regex": "^8.0.0",
-                "is-fullwidth-code-point": "^3.0.0",
-                "strip-ansi": "^6.0.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/strip-ansi": {
-            "version": "6.0.0",
-            "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-6.0.0.tgz",
-            "integrity": "sha512-AuvKTrTfQNYNIctbR1K/YGTR1756GycPsg7b9bdV9Duqur4gv6aKqHXah67Z8ImS7WEz5QVcOtlfW2rZEugt6w==",
-            "dev": true,
-            "dependencies": {
-                "ansi-regex": "^5.0.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/strip-eof": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/strip-eof/-/strip-eof-1.0.0.tgz",
-            "integrity": "sha1-u0P/VZim6wXYm1n80SnJgzE2Br8=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.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/strip-json-comments": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/strip-json-comments/-/strip-json-comments-3.1.1.tgz",
-            "integrity": "sha512-6fPc+R4ihwqP6N/aIv2f1gMH8lOVtWQHoqC4yK6oSDVVocumAsfCqjkXnqiYMhmMwS/mEHLp7Vehlt3ql6lEig==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/supports-color": {
-            "version": "7.2.0",
-            "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-7.2.0.tgz",
-            "integrity": "sha512-qpCAvRl9stuOHveKsn7HncJRvv501qIacKzQlO/+Lwxc9+0q2wLyv4Dfvt80/DPn2pqOBsJdDiogXGR9+OvwRw==",
-            "dev": true,
-            "dependencies": {
-                "has-flag": "^4.0.0"
-            },
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/table": {
-            "version": "6.0.7",
-            "resolved": "https://registry.npmjs.org/table/-/table-6.0.7.tgz",
-            "integrity": "sha512-rxZevLGTUzWna/qBLObOe16kB2RTnnbhciwgPbMMlazz1yZGVEgnZK762xyVdVznhqxrfCeBMmMkgOOaPwjH7g==",
-            "dev": true,
-            "dependencies": {
-                "ajv": "^7.0.2",
-                "lodash": "^4.17.20",
-                "slice-ansi": "^4.0.0",
-                "string-width": "^4.2.0"
-            },
-            "engines": {
-                "node": ">=10.0.0"
-            }
-        },
-        "node_modules/table/node_modules/ajv": {
-            "version": "7.2.1",
-            "resolved": "https://registry.npmjs.org/ajv/-/ajv-7.2.1.tgz",
-            "integrity": "sha512-+nu0HDv7kNSOua9apAVc979qd932rrZeb3WOvoiD31A/p1mIE5/9bN2027pE2rOPYEdS3UHzsvof4hY+lM9/WQ==",
-            "dev": true,
-            "dependencies": {
-                "fast-deep-equal": "^3.1.1",
-                "json-schema-traverse": "^1.0.0",
-                "require-from-string": "^2.0.2",
-                "uri-js": "^4.2.2"
-            }
-        },
-        "node_modules/table/node_modules/json-schema-traverse": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-1.0.0.tgz",
-            "integrity": "sha512-NM8/P9n3XjXhIZn1lLhkFaACTOURQXjWhV4BA/RnOv8xvgqtqpAX9IO4mRQxSx1Rlo4tqzeqb0sOlruaOy3dug==",
-            "dev": true
-        },
-        "node_modules/tapable": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/tapable/-/tapable-2.2.0.tgz",
-            "integrity": "sha512-FBk4IesMV1rBxX2tfiK8RAmogtWn53puLOQlvO8XuwlgxcYbP4mVPS9Ph4aeamSyyVjOl24aYWAuc8U5kCVwMw==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/terser": {
-            "version": "5.6.1",
-            "resolved": "https://registry.npmjs.org/terser/-/terser-5.6.1.tgz",
-            "integrity": "sha512-yv9YLFQQ+3ZqgWCUk+pvNJwgUTdlIxUk1WTN+RnaFJe2L7ipG2csPT0ra2XRm7Cs8cxN7QXmK1rFzEwYEQkzXw==",
-            "dev": true,
-            "dependencies": {
-                "commander": "^2.20.0",
-                "source-map": "~0.7.2",
-                "source-map-support": "~0.5.19"
-            },
-            "bin": {
-                "terser": "bin/terser"
-            },
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/terser-webpack-plugin": {
-            "version": "5.1.1",
-            "resolved": "https://registry.npmjs.org/terser-webpack-plugin/-/terser-webpack-plugin-5.1.1.tgz",
-            "integrity": "sha512-5XNNXZiR8YO6X6KhSGXfY0QrGrCRlSwAEjIIrlRQR4W8nP69TaJUlh3bkuac6zzgspiGPfKEHcY295MMVExl5Q==",
-            "dev": true,
-            "dependencies": {
-                "jest-worker": "^26.6.2",
-                "p-limit": "^3.1.0",
-                "schema-utils": "^3.0.0",
-                "serialize-javascript": "^5.0.1",
-                "source-map": "^0.6.1",
-                "terser": "^5.5.1"
-            },
-            "engines": {
-                "node": ">= 10.13.0"
-            }
-        },
-        "node_modules/terser-webpack-plugin/node_modules/p-limit": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/p-limit/-/p-limit-3.1.0.tgz",
-            "integrity": "sha512-TYOanM3wGwNGsZN2cVTYPArw454xnXj5qmWF1bEoAc4+cU/ol7GVh7odevjp1FNHduHc3KZMcFduxU5Xc6uJRQ==",
-            "dev": true,
-            "dependencies": {
-                "yocto-queue": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=10"
-            }
-        },
-        "node_modules/terser-webpack-plugin/node_modules/schema-utils": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.0.0.tgz",
-            "integrity": "sha512-6D82/xSzO094ajanoOSbe4YvXWMfn2A//8Y1+MUqFAJul5Bs+yn36xbK9OtNDcRVSBJ9jjeoXftM6CfztsjOAA==",
-            "dev": true,
-            "dependencies": {
-                "@types/json-schema": "^7.0.6",
-                "ajv": "^6.12.5",
-                "ajv-keywords": "^3.5.2"
-            },
-            "engines": {
-                "node": ">= 10.13.0"
-            }
-        },
-        "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,
-            "engines": {
-                "node": ">= 8"
-            }
-        },
-        "node_modules/text-table": {
-            "version": "0.2.0",
-            "resolved": "https://registry.npmjs.org/text-table/-/text-table-0.2.0.tgz",
-            "integrity": "sha1-f17oI66AUgfACvLfSoTsP8+lcLQ=",
-            "dev": true
-        },
-        "node_modules/thunky": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/thunky/-/thunky-1.1.0.tgz",
-            "integrity": "sha512-eHY7nBftgThBqOyHGVN+l8gF0BucP09fMo0oO/Lb0w1OF80dJv+lDVpXG60WMQvkcxAkNybKsrEIE3ZtKGmPrA==",
-            "dev": true
-        },
-        "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/to-fast-properties": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/to-fast-properties/-/to-fast-properties-2.0.0.tgz",
-            "integrity": "sha1-3F5pjL0HkmW8c+A3doGk5Og/YW4=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/to-object-path": {
-            "version": "0.3.0",
-            "resolved": "https://registry.npmjs.org/to-object-path/-/to-object-path-0.3.0.tgz",
-            "integrity": "sha1-KXWIt7Dn4KwI4E5nL4XB9JmeF68=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/to-object-path/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/to-regex": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/to-regex/-/to-regex-3.0.2.tgz",
-            "integrity": "sha512-FWtleNAtZ/Ki2qtqej2CXTOayOH9bHDQF+Q48VpWyDXjbYxA4Yz8iDB31zXOBUlOHHKidDbqGVrTUvQMPmBGBw==",
-            "dev": true,
-            "dependencies": {
-                "define-property": "^2.0.2",
-                "extend-shallow": "^3.0.2",
-                "regex-not": "^1.0.2",
-                "safe-regex": "^1.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/to-regex-range": {
-            "version": "5.0.1",
-            "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz",
-            "integrity": "sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==",
-            "dev": true,
-            "dependencies": {
-                "is-number": "^7.0.0"
-            },
-            "engines": {
-                "node": ">=8.0"
-            }
-        },
-        "node_modules/toidentifier": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/toidentifier/-/toidentifier-1.0.0.tgz",
-            "integrity": "sha512-yaOH/Pk/VEhBWWTlhI+qXxDFXlejDGcQipMlyxda9nthulaxLZUNcUqFxokp0vcYnvteJln5FNQDRrxj3YcbVw==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.6"
-            }
-        },
-        "node_modules/tslib": {
-            "version": "1.14.1",
-            "resolved": "https://registry.npmjs.org/tslib/-/tslib-1.14.1.tgz",
-            "integrity": "sha512-Xni35NKzjgMrwevysHTCArtLDpPvye8zV/0E4EyYn43P7/7qvQwPh9BGkHewbMulVntbigmcT7rdX3BNo9wRJg==",
-            "dev": true
-        },
-        "node_modules/tsutils": {
-            "version": "3.21.0",
-            "resolved": "https://registry.npmjs.org/tsutils/-/tsutils-3.21.0.tgz",
-            "integrity": "sha512-mHKK3iUXL+3UF6xL5k0PEhKRUBKPBCv/+RkEOpjRWxxx27KKRBmmA60A9pgOUvMi8GKhRMPEmjBRPzs2W7O1OA==",
-            "dev": true,
-            "dependencies": {
-                "tslib": "^1.8.1"
-            },
-            "engines": {
-                "node": ">= 6"
-            }
-        },
-        "node_modules/type-check": {
-            "version": "0.4.0",
-            "resolved": "https://registry.npmjs.org/type-check/-/type-check-0.4.0.tgz",
-            "integrity": "sha512-XleUoc9uwGXqjWwXaUTZAmzMcFZ5858QA2vvx1Ur5xIcixXIP+8LnFDgRplU30us6teqdlskFfu+ae4K79Ooew==",
-            "dev": true,
-            "dependencies": {
-                "prelude-ls": "^1.2.1"
-            },
-            "engines": {
-                "node": ">= 0.8.0"
-            }
-        },
-        "node_modules/type-fest": {
-            "version": "0.8.1",
-            "resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.8.1.tgz",
-            "integrity": "sha512-4dbzIzqvjtgiM5rw1k5rEHtBANKmdudhGyBEajN01fEyhaAIhsoKNy6y7+IN93IfpFtwY9iqi7kD+xwKhQsNJA==",
-            "dev": true,
-            "engines": {
-                "node": ">=8"
-            }
-        },
-        "node_modules/type-is": {
-            "version": "1.6.18",
-            "resolved": "https://registry.npmjs.org/type-is/-/type-is-1.6.18.tgz",
-            "integrity": "sha512-TkRKr9sUTxEH8MdfuCSP7VizJyzRNMjj2J2do2Jr3Kym598JVdEksuzPQCnlFPW4ky9Q+iA+ma9BGm06XQBy8g==",
-            "dev": true,
-            "dependencies": {
-                "media-typer": "0.3.0",
-                "mime-types": "~2.1.24"
-            },
-            "engines": {
-                "node": ">= 0.6"
-            }
-        },
-        "node_modules/typed-function": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-2.0.0.tgz",
-            "integrity": "sha512-Hhy1Iwo/e4AtLZNK10ewVVcP2UEs408DS35ubP825w/YgSBK1KVLwALvvIG4yX75QJrxjCpcWkzkVRB0BwwYlA==",
-            "engines": {
-                "node": ">= 8"
-            }
-        },
-        "node_modules/typescript": {
-            "version": "4.2.3",
-            "resolved": "https://registry.npmjs.org/typescript/-/typescript-4.2.3.tgz",
-            "integrity": "sha512-qOcYwxaByStAWrBf4x0fibwZvMRG+r4cQoTjbPtUlrWjBHbmCAww1i448U0GJ+3cNNEtebDteo/cHOR3xJ4wEw==",
-            "dev": true,
-            "bin": {
-                "tsc": "bin/tsc",
-                "tsserver": "bin/tsserver"
-            },
-            "engines": {
-                "node": ">=4.2.0"
-            }
-        },
-        "node_modules/unicode-canonical-property-names-ecmascript": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/unicode-canonical-property-names-ecmascript/-/unicode-canonical-property-names-ecmascript-1.0.4.tgz",
-            "integrity": "sha512-jDrNnXWHd4oHiTZnx/ZG7gtUTVp+gCcTTKr8L0HjlwphROEW3+Him+IpvC+xcJEFegapiMZyZe02CyuOnRmbnQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/unicode-match-property-ecmascript": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/unicode-match-property-ecmascript/-/unicode-match-property-ecmascript-1.0.4.tgz",
-            "integrity": "sha512-L4Qoh15vTfntsn4P1zqnHulG0LdXgjSO035fEpdtp6YxXhMT51Q6vgM5lYdG/5X3MjS+k/Y9Xw4SFCY9IkR0rg==",
-            "dev": true,
-            "dependencies": {
-                "unicode-canonical-property-names-ecmascript": "^1.0.4",
-                "unicode-property-aliases-ecmascript": "^1.0.4"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/unicode-match-property-value-ecmascript": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/unicode-match-property-value-ecmascript/-/unicode-match-property-value-ecmascript-1.2.0.tgz",
-            "integrity": "sha512-wjuQHGQVofmSJv1uVISKLE5zO2rNGzM/KCYZch/QQvez7C1hUhBIuZ701fYXExuufJFMPhv2SyL8CyoIfMLbIQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/unicode-property-aliases-ecmascript": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/unicode-property-aliases-ecmascript/-/unicode-property-aliases-ecmascript-1.1.0.tgz",
-            "integrity": "sha512-PqSoPh/pWetQ2phoj5RLiaqIk4kCNwoV3CI+LfGmWLKI3rE3kl1h59XpX2BjgDrmbxD9ARtQobPGU1SguCYuQg==",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/union-value": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/union-value/-/union-value-1.0.1.tgz",
-            "integrity": "sha512-tJfXmxMeWYnczCVs7XAEvIV7ieppALdyepWMkHkwciRpZraG/xwT+s2JN8+pr1+8jCRf80FFzvr+MpQeeoF4Xg==",
-            "dev": true,
-            "dependencies": {
-                "arr-union": "^3.1.0",
-                "get-value": "^2.0.6",
-                "is-extendable": "^0.1.1",
-                "set-value": "^2.0.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/unpipe": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/unpipe/-/unpipe-1.0.0.tgz",
-            "integrity": "sha1-sr9O6FFKrmFltIF4KdIbLvSZBOw=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/unset-value": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/unset-value/-/unset-value-1.0.0.tgz",
-            "integrity": "sha1-g3aHP30jNRef+x5vw6jtDfyKtVk=",
-            "dev": true,
-            "dependencies": {
-                "has-value": "^0.3.1",
-                "isobject": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/unset-value/node_modules/has-value": {
-            "version": "0.3.1",
-            "resolved": "https://registry.npmjs.org/has-value/-/has-value-0.3.1.tgz",
-            "integrity": "sha1-ex9YutpiyoJ+wKIHgCVlSEWZXh8=",
-            "dev": true,
-            "dependencies": {
-                "get-value": "^2.0.3",
-                "has-values": "^0.1.4",
-                "isobject": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/unset-value/node_modules/has-value/node_modules/isobject": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/isobject/-/isobject-2.1.0.tgz",
-            "integrity": "sha1-8GVWEJaj8dou9GJy+BXIQNh+DIk=",
-            "dev": true,
-            "dependencies": {
-                "isarray": "1.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/unset-value/node_modules/has-values": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/has-values/-/has-values-0.1.4.tgz",
-            "integrity": "sha1-bWHeldkd/Km5oCCJrThL/49it3E=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/upath": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/upath/-/upath-1.2.0.tgz",
-            "integrity": "sha512-aZwGpamFO61g3OlfT7OQCHqhGnW43ieH9WZeP7QxN/G/jS4jfqUkZxoryvJgVPEcrl5NL/ggHsSmLMHuH64Lhg==",
-            "dev": true,
-            "engines": {
-                "node": ">=4",
-                "yarn": "*"
-            }
-        },
-        "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,
-            "dependencies": {
-                "punycode": "^2.1.0"
-            }
-        },
-        "node_modules/urix": {
-            "version": "0.1.0",
-            "resolved": "https://registry.npmjs.org/urix/-/urix-0.1.0.tgz",
-            "integrity": "sha1-2pN/emLiH+wf0Y1Js1wpNQZ6bHI=",
-            "dev": true
-        },
-        "node_modules/url": {
-            "version": "0.11.0",
-            "resolved": "https://registry.npmjs.org/url/-/url-0.11.0.tgz",
-            "integrity": "sha1-ODjpfPxgUh63PFJajlW/3Z4uKPE=",
-            "dev": true,
-            "dependencies": {
-                "punycode": "1.3.2",
-                "querystring": "0.2.0"
-            }
-        },
-        "node_modules/url-parse": {
-            "version": "1.5.1",
-            "resolved": "https://registry.npmjs.org/url-parse/-/url-parse-1.5.1.tgz",
-            "integrity": "sha512-HOfCOUJt7iSYzEx/UqgtwKRMC6EU91NFhsCHMv9oM03VJcVo2Qrp8T8kI9D7amFf1cu+/3CEhgb3rF9zL7k85Q==",
-            "dev": true,
-            "dependencies": {
-                "querystringify": "^2.1.1",
-                "requires-port": "^1.0.0"
-            }
-        },
-        "node_modules/url/node_modules/punycode": {
-            "version": "1.3.2",
-            "resolved": "https://registry.npmjs.org/punycode/-/punycode-1.3.2.tgz",
-            "integrity": "sha1-llOgNvt8HuQjQvIyXM7v6jkmxI0=",
-            "dev": true
-        },
-        "node_modules/use": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/use/-/use-3.1.1.tgz",
-            "integrity": "sha512-cwESVXlO3url9YWlFW/TA9cshCEhtu7IKJ/p5soJ/gGpj7vbvFrAY/eIioQ6Dw23KjZhYgiIo8HOs1nQ2vr/oQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/util-deprecate": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/util-deprecate/-/util-deprecate-1.0.2.tgz",
-            "integrity": "sha1-RQ1Nyfpw3nMnYvvS1KKJgUGaDM8=",
-            "dev": true
-        },
-        "node_modules/utils-merge": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/utils-merge/-/utils-merge-1.0.1.tgz",
-            "integrity": "sha1-n5VxD1CiZ5R7LMwSR0HBAoQn5xM=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.4.0"
-            }
-        },
-        "node_modules/uuid": {
-            "version": "3.4.0",
-            "resolved": "https://registry.npmjs.org/uuid/-/uuid-3.4.0.tgz",
-            "integrity": "sha512-HjSDRw6gZE5JMggctHBcjVak08+KEVhSIiDzFnT9S9aegmp85S/bReBVTb4QTFaRNptJ9kuYaNhnbNEOkbKb/A==",
-            "dev": true,
-            "bin": {
-                "uuid": "bin/uuid"
-            }
-        },
-        "node_modules/v8-compile-cache": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/v8-compile-cache/-/v8-compile-cache-2.2.0.tgz",
-            "integrity": "sha512-gTpR5XQNKFwOd4clxfnhaqvfqMpqEwr4tOtCyz4MtYZX2JYhfr1JvBFKdS+7K/9rfpZR3VLX+YWBbKoxCgS43Q==",
-            "dev": true
-        },
-        "node_modules/vary": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/vary/-/vary-1.1.2.tgz",
-            "integrity": "sha1-IpnwLG3tMNSllhsLn3RSShj2NPw=",
-            "dev": true,
-            "engines": {
-                "node": ">= 0.8"
-            }
-        },
-        "node_modules/watchpack": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.1.1.tgz",
-            "integrity": "sha512-Oo7LXCmc1eE1AjyuSBmtC3+Wy4HcV8PxWh2kP6fOl8yTlNS7r0K9l1ao2lrrUza7V39Y3D/BbJgY8VeSlc5JKw==",
-            "dev": true,
-            "dependencies": {
-                "glob-to-regexp": "^0.4.1",
-                "graceful-fs": "^4.1.2"
-            },
-            "engines": {
-                "node": ">=10.13.0"
-            }
-        },
-        "node_modules/wbuf": {
-            "version": "1.7.3",
-            "resolved": "https://registry.npmjs.org/wbuf/-/wbuf-1.7.3.tgz",
-            "integrity": "sha512-O84QOnr0icsbFGLS0O3bI5FswxzRr8/gHwWkDlQFskhSPryQXvrTMxjxGP4+iWYoauLoBvfDpkrOauZ+0iZpDA==",
-            "dev": true,
-            "dependencies": {
-                "minimalistic-assert": "^1.0.0"
-            }
-        },
-        "node_modules/webpack": {
-            "version": "5.26.3",
-            "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.26.3.tgz",
-            "integrity": "sha512-z/F2lt2N1fZqaud1B4SzjL3OW03eULThbBXQ2OX4LSrZX4N9k1A5d0Rje3zS2g887DTWyAV0KGqEf64ois2dhg==",
-            "dev": true,
-            "dependencies": {
-                "@types/eslint-scope": "^3.7.0",
-                "@types/estree": "^0.0.46",
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/wasm-edit": "1.11.0",
-                "@webassemblyjs/wasm-parser": "1.11.0",
-                "acorn": "^8.0.4",
-                "browserslist": "^4.14.5",
-                "chrome-trace-event": "^1.0.2",
-                "enhanced-resolve": "^5.7.0",
-                "es-module-lexer": "^0.4.0",
-                "eslint-scope": "^5.1.1",
-                "events": "^3.2.0",
-                "glob-to-regexp": "^0.4.1",
-                "graceful-fs": "^4.2.4",
-                "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.0.0",
-                "tapable": "^2.1.1",
-                "terser-webpack-plugin": "^5.1.1",
-                "watchpack": "^2.0.0",
-                "webpack-sources": "^2.1.1"
-            },
-            "bin": {
-                "webpack": "bin/webpack.js"
-            },
-            "engines": {
-                "node": ">=10.13.0"
-            }
-        },
-        "node_modules/webpack-cli": {
-            "version": "4.5.0",
-            "resolved": "https://registry.npmjs.org/webpack-cli/-/webpack-cli-4.5.0.tgz",
-            "integrity": "sha512-wXg/ef6Ibstl2f50mnkcHblRPN/P9J4Nlod5Hg9HGFgSeF8rsqDGHJeVe4aR26q9l62TUJi6vmvC2Qz96YJw1Q==",
-            "dev": true,
-            "dependencies": {
-                "@discoveryjs/json-ext": "^0.5.0",
-                "@webpack-cli/configtest": "^1.0.1",
-                "@webpack-cli/info": "^1.2.2",
-                "@webpack-cli/serve": "^1.3.0",
-                "colorette": "^1.2.1",
-                "commander": "^7.0.0",
-                "enquirer": "^2.3.6",
-                "execa": "^5.0.0",
-                "fastest-levenshtein": "^1.0.12",
-                "import-local": "^3.0.2",
-                "interpret": "^2.2.0",
-                "rechoir": "^0.7.0",
-                "v8-compile-cache": "^2.2.0",
-                "webpack-merge": "^5.7.3"
-            },
-            "bin": {
-                "webpack-cli": "bin/cli.js"
-            },
-            "engines": {
-                "node": ">=10.13.0"
-            }
-        },
-        "node_modules/webpack-cli/node_modules/commander": {
-            "version": "7.1.0",
-            "resolved": "https://registry.npmjs.org/commander/-/commander-7.1.0.tgz",
-            "integrity": "sha512-pRxBna3MJe6HKnBGsDyMv8ETbptw3axEdYHoqNh7gu5oDcew8fs0xnivZGm06Ogk8zGAJ9VX+OPEr2GXEQK4dg==",
-            "dev": true,
-            "engines": {
-                "node": ">= 10"
-            }
-        },
-        "node_modules/webpack-dev-middleware": {
-            "version": "3.7.3",
-            "resolved": "https://registry.npmjs.org/webpack-dev-middleware/-/webpack-dev-middleware-3.7.3.tgz",
-            "integrity": "sha512-djelc/zGiz9nZj/U7PTBi2ViorGJXEWo/3ltkPbDyxCXhhEXkW0ce99falaok4TPj+AsxLiXJR0EBOb0zh9fKQ==",
-            "dev": true,
-            "dependencies": {
-                "memory-fs": "^0.4.1",
-                "mime": "^2.4.4",
-                "mkdirp": "^0.5.1",
-                "range-parser": "^1.2.1",
-                "webpack-log": "^2.0.0"
-            },
-            "engines": {
-                "node": ">= 6"
-            }
-        },
-        "node_modules/webpack-dev-middleware/node_modules/mime": {
-            "version": "2.5.2",
-            "resolved": "https://registry.npmjs.org/mime/-/mime-2.5.2.tgz",
-            "integrity": "sha512-tqkh47FzKeCPD2PUiPB6pkbMzsCasjxAfC62/Wap5qrUWcb+sFasXUC5I3gYM5iBM8v/Qpn4UK0x+j0iHyFPDg==",
-            "dev": true,
-            "bin": {
-                "mime": "cli.js"
-            },
-            "engines": {
-                "node": ">=4.0.0"
-            }
-        },
-        "node_modules/webpack-dev-server": {
-            "version": "3.11.2",
-            "resolved": "https://registry.npmjs.org/webpack-dev-server/-/webpack-dev-server-3.11.2.tgz",
-            "integrity": "sha512-A80BkuHRQfCiNtGBS1EMf2ChTUs0x+B3wGDFmOeT4rmJOHhHTCH2naNxIHhmkr0/UillP4U3yeIyv1pNp+QDLQ==",
-            "dev": true,
-            "dependencies": {
-                "ansi-html": "0.0.7",
-                "bonjour": "^3.5.0",
-                "chokidar": "^2.1.8",
-                "compression": "^1.7.4",
-                "connect-history-api-fallback": "^1.6.0",
-                "debug": "^4.1.1",
-                "del": "^4.1.1",
-                "express": "^4.17.1",
-                "html-entities": "^1.3.1",
-                "http-proxy-middleware": "0.19.1",
-                "import-local": "^2.0.0",
-                "internal-ip": "^4.3.0",
-                "ip": "^1.1.5",
-                "is-absolute-url": "^3.0.3",
-                "killable": "^1.0.1",
-                "loglevel": "^1.6.8",
-                "opn": "^5.5.0",
-                "p-retry": "^3.0.1",
-                "portfinder": "^1.0.26",
-                "schema-utils": "^1.0.0",
-                "selfsigned": "^1.10.8",
-                "semver": "^6.3.0",
-                "serve-index": "^1.9.1",
-                "sockjs": "^0.3.21",
-                "sockjs-client": "^1.5.0",
-                "spdy": "^4.0.2",
-                "strip-ansi": "^3.0.1",
-                "supports-color": "^6.1.0",
-                "url": "^0.11.0",
-                "webpack-dev-middleware": "^3.7.2",
-                "webpack-log": "^2.0.0",
-                "ws": "^6.2.1",
-                "yargs": "^13.3.2"
-            },
-            "bin": {
-                "webpack-dev-server": "bin/webpack-dev-server.js"
-            },
-            "engines": {
-                "node": ">= 6.11.5"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/ansi-regex": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-2.1.1.tgz",
-            "integrity": "sha1-w7M6te42DYbg5ijwRorn7yfWVN8=",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/braces": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-            "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-            "dev": true,
-            "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"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/chokidar": {
-            "version": "2.1.8",
-            "resolved": "https://registry.npmjs.org/chokidar/-/chokidar-2.1.8.tgz",
-            "integrity": "sha512-ZmZUazfOzf0Nve7duiCKD23PFSCs4JPoYyccjUFF3aQkQadqBhfzhjkwBH2mNOG9cTBwhamM37EIsIkZw3nRgg==",
-            "dev": true,
-            "dependencies": {
-                "anymatch": "^2.0.0",
-                "async-each": "^1.0.1",
-                "braces": "^2.3.2",
-                "glob-parent": "^3.1.0",
-                "inherits": "^2.0.3",
-                "is-binary-path": "^1.0.0",
-                "is-glob": "^4.0.0",
-                "normalize-path": "^3.0.0",
-                "path-is-absolute": "^1.0.0",
-                "readdirp": "^2.2.1",
-                "upath": "^1.1.1"
-            },
-            "optionalDependencies": {
-                "fsevents": "^1.2.7"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/extend-shallow": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-            "dev": true,
-            "dependencies": {
-                "is-extendable": "^0.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/fill-range": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-            "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-            "dev": true,
-            "dependencies": {
-                "extend-shallow": "^2.0.1",
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1",
-                "to-regex-range": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/find-up": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/find-up/-/find-up-3.0.0.tgz",
-            "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
-            "dev": true,
-            "dependencies": {
-                "locate-path": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/fsevents": {
-            "version": "1.2.13",
-            "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-1.2.13.tgz",
-            "integrity": "sha512-oWb1Z6mkHIskLzEJ/XWX0srkpkTQ7vaopMQkyaEIoq0fmtFVxOthb8cCxeT+p3ynTdkk/RZwbgG4brR5BeWECw==",
-            "dev": true,
-            "hasInstallScript": true,
-            "optional": true,
-            "os": [
-                "darwin"
-            ],
-            "dependencies": {
-                "bindings": "^1.5.0",
-                "nan": "^2.12.1"
-            },
-            "engines": {
-                "node": ">= 4.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/glob-parent": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-3.1.0.tgz",
-            "integrity": "sha1-nmr2KZ2NO9K9QEMIMr0RPfkGxa4=",
-            "dev": true,
-            "dependencies": {
-                "is-glob": "^3.1.0",
-                "path-dirname": "^1.0.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/glob-parent/node_modules/is-glob": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-3.1.0.tgz",
-            "integrity": "sha1-e6WuJCF4BKxwcHuWkiVnSGzD6Eo=",
-            "dev": true,
-            "dependencies": {
-                "is-extglob": "^2.1.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/has-flag": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-3.0.0.tgz",
-            "integrity": "sha1-tdRU3CGZriJWmfNGfloH87lVuv0=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/import-local": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/import-local/-/import-local-2.0.0.tgz",
-            "integrity": "sha512-b6s04m3O+s3CGSbqDIyP4R6aAwAeYlVq9+WUWep6iHa8ETRf9yei1U48C5MmfJmV9AiLYYBKPMq/W+/WRpQmCQ==",
-            "dev": true,
-            "dependencies": {
-                "pkg-dir": "^3.0.0",
-                "resolve-cwd": "^2.0.0"
-            },
-            "bin": {
-                "import-local-fixture": "fixtures/cli.js"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/is-number": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-            "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-            "dev": true,
-            "dependencies": {
-                "kind-of": "^3.0.2"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/kind-of": {
-            "version": "3.2.2",
-            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-            "dev": true,
-            "dependencies": {
-                "is-buffer": "^1.1.5"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/locate-path": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-3.0.0.tgz",
-            "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
-            "dev": true,
-            "dependencies": {
-                "p-locate": "^3.0.0",
-                "path-exists": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/p-locate": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-3.0.0.tgz",
-            "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
-            "dev": true,
-            "dependencies": {
-                "p-limit": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/path-exists": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-3.0.0.tgz",
-            "integrity": "sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/pkg-dir": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/pkg-dir/-/pkg-dir-3.0.0.tgz",
-            "integrity": "sha512-/E57AYkoeQ25qkxMj5PBOVgF8Kiu/h7cYS30Z5+R7WaiCCBfLq58ZI/dSeaEKb9WVJV5n/03QwrN3IeWIFllvw==",
-            "dev": true,
-            "dependencies": {
-                "find-up": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/resolve-cwd": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/resolve-cwd/-/resolve-cwd-2.0.0.tgz",
-            "integrity": "sha1-AKn3OHVW4nA46uIyyqNypqWbZlo=",
-            "dev": true,
-            "dependencies": {
-                "resolve-from": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/resolve-from": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/resolve-from/-/resolve-from-3.0.0.tgz",
-            "integrity": "sha1-six699nWiBvItuZTM17rywoYh0g=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/schema-utils": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-1.0.0.tgz",
-            "integrity": "sha512-i27Mic4KovM/lnGsy8whRCHhc7VicJajAjTrYg11K9zfZXnYIt4k5F+kZkwjnrhKzLic/HLU4j11mjsz2G/75g==",
-            "dev": true,
-            "dependencies": {
-                "ajv": "^6.1.0",
-                "ajv-errors": "^1.0.0",
-                "ajv-keywords": "^3.1.0"
-            },
-            "engines": {
-                "node": ">= 4"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/semver": {
-            "version": "6.3.0",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-            "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-            "dev": true,
-            "bin": {
-                "semver": "bin/semver.js"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/strip-ansi": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-3.0.1.tgz",
-            "integrity": "sha1-ajhfuIU9lS1f8F0Oiq+UJ43GPc8=",
-            "dev": true,
-            "dependencies": {
-                "ansi-regex": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/supports-color": {
-            "version": "6.1.0",
-            "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-6.1.0.tgz",
-            "integrity": "sha512-qe1jfm1Mg7Nq/NSh6XE24gPXROEVsWHxC1LIx//XNlD9iw7YZQGjZNjYN7xGaEG6iKdA8EtNFW6R0gjnVXp+wQ==",
-            "dev": true,
-            "dependencies": {
-                "has-flag": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/webpack-dev-server/node_modules/to-regex-range": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-            "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-            "dev": true,
-            "dependencies": {
-                "is-number": "^3.0.0",
-                "repeat-string": "^1.6.1"
-            },
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/webpack-log": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/webpack-log/-/webpack-log-2.0.0.tgz",
-            "integrity": "sha512-cX8G2vR/85UYG59FgkoMamwHUIkSSlV3bBMRsbxVXVUk2j6NleCKjQ/WE9eYg9WY4w25O9w8wKP4rzNZFmUcUg==",
-            "dev": true,
-            "dependencies": {
-                "ansi-colors": "^3.0.0",
-                "uuid": "^3.3.2"
-            },
-            "engines": {
-                "node": ">= 6"
-            }
-        },
-        "node_modules/webpack-log/node_modules/ansi-colors": {
-            "version": "3.2.4",
-            "resolved": "https://registry.npmjs.org/ansi-colors/-/ansi-colors-3.2.4.tgz",
-            "integrity": "sha512-hHUXGagefjN2iRrID63xckIvotOXOojhQKWIPUZ4mNUZ9nLZW+7FMNoE1lOkEhNWYsx/7ysGIuJYCiMAA9FnrA==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/webpack-merge": {
-            "version": "5.7.3",
-            "resolved": "https://registry.npmjs.org/webpack-merge/-/webpack-merge-5.7.3.tgz",
-            "integrity": "sha512-6/JUQv0ELQ1igjGDzHkXbVDRxkfA57Zw7PfiupdLFJYrgFqY5ZP8xxbpp2lU3EPwYx89ht5Z/aDkD40hFCm5AA==",
-            "dev": true,
-            "dependencies": {
-                "clone-deep": "^4.0.1",
-                "wildcard": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=10.0.0"
-            }
-        },
-        "node_modules/webpack-sources": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/webpack-sources/-/webpack-sources-2.2.0.tgz",
-            "integrity": "sha512-bQsA24JLwcnWGArOKUxYKhX3Mz/nK1Xf6hxullKERyktjNMC4x8koOeaDNTA2fEJ09BdWLbM/iTW0ithREUP0w==",
-            "dev": true,
-            "dependencies": {
-                "source-list-map": "^2.0.1",
-                "source-map": "^0.6.1"
-            },
-            "engines": {
-                "node": ">=10.13.0"
-            }
-        },
-        "node_modules/webpack/node_modules/schema-utils": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.0.0.tgz",
-            "integrity": "sha512-6D82/xSzO094ajanoOSbe4YvXWMfn2A//8Y1+MUqFAJul5Bs+yn36xbK9OtNDcRVSBJ9jjeoXftM6CfztsjOAA==",
-            "dev": true,
-            "dependencies": {
-                "@types/json-schema": "^7.0.6",
-                "ajv": "^6.12.5",
-                "ajv-keywords": "^3.5.2"
-            },
-            "engines": {
-                "node": ">= 10.13.0"
-            }
-        },
-        "node_modules/websocket-driver": {
-            "version": "0.7.4",
-            "resolved": "https://registry.npmjs.org/websocket-driver/-/websocket-driver-0.7.4.tgz",
-            "integrity": "sha512-b17KeDIQVjvb0ssuSDF2cYXSg2iztliJ4B9WdsuB6J952qCPKmnVq4DyW5motImXHDC1cBT/1UezrJVsKw5zjg==",
-            "dev": true,
-            "dependencies": {
-                "http-parser-js": ">=0.5.1",
-                "safe-buffer": ">=5.1.0",
-                "websocket-extensions": ">=0.1.1"
-            },
-            "engines": {
-                "node": ">=0.8.0"
-            }
-        },
-        "node_modules/websocket-extensions": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/websocket-extensions/-/websocket-extensions-0.1.4.tgz",
-            "integrity": "sha512-OqedPIGOfsDlo31UNwYbCFMSaO9m9G/0faIHj5/dZFDMFqPTcx6UwqyOy3COEaEOg/9VsGIpdqn62W5KhoKSpg==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.8.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/which-module": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/which-module/-/which-module-2.0.0.tgz",
-            "integrity": "sha1-2e8H3Od7mQK4o6j6SzHD4/fm6Ho=",
-            "dev": true
-        },
-        "node_modules/wildcard": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/wildcard/-/wildcard-2.0.0.tgz",
-            "integrity": "sha512-JcKqAHLPxcdb9KM49dufGXn2x3ssnfjbcaQdLlfZsL9rH9wgDQjUtDxbo8NE0F6SFvydeu1VhZe7hZuHsB2/pw==",
-            "dev": true
-        },
-        "node_modules/word-wrap": {
-            "version": "1.2.3",
-            "resolved": "https://registry.npmjs.org/word-wrap/-/word-wrap-1.2.3.tgz",
-            "integrity": "sha512-Hz/mrNwitNRh/HUAtM/VT/5VH+ygD6DV7mYKZAtHOrbs8U7lvPS6xf7EJKMF0uW1KJCl0H701g3ZGus+muE5vQ==",
-            "dev": true,
-            "engines": {
-                "node": ">=0.10.0"
-            }
-        },
-        "node_modules/wrap-ansi": {
-            "version": "5.1.0",
-            "resolved": "https://registry.npmjs.org/wrap-ansi/-/wrap-ansi-5.1.0.tgz",
-            "integrity": "sha512-QC1/iN/2/RPVJ5jYK8BGttj5z83LmSKmvbvrXPNCLZSEb32KKVDJDl/MOt2N01qU2H/FkzEa9PKto1BqDjtd7Q==",
-            "dev": true,
-            "dependencies": {
-                "ansi-styles": "^3.2.0",
-                "string-width": "^3.0.0",
-                "strip-ansi": "^5.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/wrap-ansi/node_modules/ansi-regex": {
-            "version": "4.1.0",
-            "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
-            "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/wrap-ansi/node_modules/ansi-styles": {
-            "version": "3.2.1",
-            "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz",
-            "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
-            "dev": true,
-            "dependencies": {
-                "color-convert": "^1.9.0"
-            },
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/wrap-ansi/node_modules/color-convert": {
-            "version": "1.9.3",
-            "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz",
-            "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
-            "dev": true,
-            "dependencies": {
-                "color-name": "1.1.3"
-            }
-        },
-        "node_modules/wrap-ansi/node_modules/color-name": {
-            "version": "1.1.3",
-            "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz",
-            "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=",
-            "dev": true
-        },
-        "node_modules/wrap-ansi/node_modules/emoji-regex": {
-            "version": "7.0.3",
-            "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
-            "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
-            "dev": true
-        },
-        "node_modules/wrap-ansi/node_modules/is-fullwidth-code-point": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
-            "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/wrap-ansi/node_modules/string-width": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
-            "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
-            "dev": true,
-            "dependencies": {
-                "emoji-regex": "^7.0.1",
-                "is-fullwidth-code-point": "^2.0.0",
-                "strip-ansi": "^5.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/wrap-ansi/node_modules/strip-ansi": {
-            "version": "5.2.0",
-            "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
-            "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
-            "dev": true,
-            "dependencies": {
-                "ansi-regex": "^4.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/wrappy": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/wrappy/-/wrappy-1.0.2.tgz",
-            "integrity": "sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=",
-            "dev": true
-        },
-        "node_modules/ws": {
-            "version": "6.2.2",
-            "resolved": "https://registry.npmjs.org/ws/-/ws-6.2.2.tgz",
-            "integrity": "sha512-zmhltoSR8u1cnDsD43TX59mzoMZsLKqUweyYBAIvTngR3shc0W6aOZylZmq/7hqyVxPdi+5Ud2QInblgyE72fw==",
-            "dev": true,
-            "dependencies": {
-                "async-limiter": "~1.0.0"
-            }
-        },
-        "node_modules/y18n": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/y18n/-/y18n-4.0.1.tgz",
-            "integrity": "sha512-wNcy4NvjMYL8gogWWYAO7ZFWFfHcbdbE57tZO8e4cbpj8tfUcwrwqSl3ad8HxpYWCdXcJUCeKKZS62Av1affwQ==",
-            "dev": true
-        },
-        "node_modules/yallist": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/yallist/-/yallist-4.0.0.tgz",
-            "integrity": "sha512-3wdGidZyq5PB084XLES5TpOSRA3wjXAlIWMhum2kRcv/41Sn2emQ0dycQW4uZXLejwKvg6EsvbdlVL+FYEct7A==",
-            "dev": true
-        },
-        "node_modules/yargs": {
-            "version": "13.3.2",
-            "resolved": "https://registry.npmjs.org/yargs/-/yargs-13.3.2.tgz",
-            "integrity": "sha512-AX3Zw5iPruN5ie6xGRIDgqkT+ZhnRlZMLMHAs8tg7nRruy2Nb+i5o9bwghAogtM08q1dpr2LVoS8KSTMYpWXUw==",
-            "dev": true,
-            "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"
-            }
-        },
-        "node_modules/yargs-parser": {
-            "version": "13.1.2",
-            "resolved": "https://registry.npmjs.org/yargs-parser/-/yargs-parser-13.1.2.tgz",
-            "integrity": "sha512-3lbsNRf/j+A4QuSZfDRA7HRSfWrzO0YjqTJd5kjAq37Zep1CEgaYmrH9Q3GwPiB9cHyd1Y1UwggGhJGoxipbzg==",
-            "dev": true,
-            "dependencies": {
-                "camelcase": "^5.0.0",
-                "decamelize": "^1.2.0"
-            }
-        },
-        "node_modules/yargs/node_modules/ansi-regex": {
-            "version": "4.1.0",
-            "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
-            "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
-            "dev": true,
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/yargs/node_modules/emoji-regex": {
-            "version": "7.0.3",
-            "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
-            "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
-            "dev": true
-        },
-        "node_modules/yargs/node_modules/find-up": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/find-up/-/find-up-3.0.0.tgz",
-            "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
-            "dev": true,
-            "dependencies": {
-                "locate-path": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/yargs/node_modules/is-fullwidth-code-point": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
-            "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/yargs/node_modules/locate-path": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-3.0.0.tgz",
-            "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
-            "dev": true,
-            "dependencies": {
-                "p-locate": "^3.0.0",
-                "path-exists": "^3.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/yargs/node_modules/p-locate": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-3.0.0.tgz",
-            "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
-            "dev": true,
-            "dependencies": {
-                "p-limit": "^2.0.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/yargs/node_modules/path-exists": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-3.0.0.tgz",
-            "integrity": "sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=",
-            "dev": true,
-            "engines": {
-                "node": ">=4"
-            }
-        },
-        "node_modules/yargs/node_modules/string-width": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
-            "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
-            "dev": true,
-            "dependencies": {
-                "emoji-regex": "^7.0.1",
-                "is-fullwidth-code-point": "^2.0.0",
-                "strip-ansi": "^5.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/yargs/node_modules/strip-ansi": {
-            "version": "5.2.0",
-            "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
-            "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
-            "dev": true,
-            "dependencies": {
-                "ansi-regex": "^4.1.0"
-            },
-            "engines": {
-                "node": ">=6"
-            }
-        },
-        "node_modules/yocto-queue": {
-            "version": "0.1.0",
-            "resolved": "https://registry.npmjs.org/yocto-queue/-/yocto-queue-0.1.0.tgz",
-            "integrity": "sha512-rVksvsnNCdJ/ohGc6xgPwyN8eheCxsiLM8mxuE/t/mOVqJewPuO1miLpTHQiRgTKCLexL4MeAFVagts7HmNZ2Q==",
-            "dev": true,
-            "engines": {
-                "node": ">=10"
-            }
-        }
-    },
-    "dependencies": {
-        "@babel/cli": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.13.10.tgz",
-            "integrity": "sha512-lYSBC7B4B9hJ7sv0Ojx1BrGhuzCoOIYfLjd+Xpd4rOzdS+a47yi8voV8vFkfjlZR1N5qZO7ixOCbobUdT304PQ==",
-            "dev": true,
-            "requires": {
-                "@nicolo-ribaudo/chokidar-2": "2.1.8-no-fsevents",
-                "chokidar": "^3.4.0",
-                "commander": "^4.0.1",
-                "convert-source-map": "^1.1.0",
-                "fs-readdir-recursive": "^1.1.0",
-                "glob": "^7.0.0",
-                "lodash": "^4.17.19",
-                "make-dir": "^2.1.0",
-                "slash": "^2.0.0",
-                "source-map": "^0.5.0"
-            },
-            "dependencies": {
-                "commander": {
-                    "version": "4.1.1",
-                    "resolved": "https://registry.npmjs.org/commander/-/commander-4.1.1.tgz",
-                    "integrity": "sha512-NOKm8xhkzAjzFx8B2v5OAHT+u5pRQc2UCa2Vq9jYL/31o2wi9mxBA7LIFs3sV5VSC49z6pEhfbMULvShKj26WA==",
-                    "dev": true
-                },
-                "slash": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/slash/-/slash-2.0.0.tgz",
-                    "integrity": "sha512-ZYKh3Wh2z1PpEXWr0MpSBZ0V6mZHAQfYevttO11c51CaWjGTaadiKZ+wVt1PbMlDV5qhMFslpZCemhwOK7C89A==",
-                    "dev": true
-                },
-                "source-map": {
-                    "version": "0.5.7",
-                    "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-                    "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/code-frame": {
-            "version": "7.12.11",
-            "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.11.tgz",
-            "integrity": "sha512-Zt1yodBx1UcyiePMSkWnU4hPqhwq7hGi2nFL1LeA3EUl+q2LQx16MISgJ0+z7dnmgvP9QtIleuETGOiOH1RcIw==",
-            "dev": true,
-            "requires": {
-                "@babel/highlight": "^7.10.4"
-            }
-        },
-        "@babel/compat-data": {
-            "version": "7.13.11",
-            "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.13.11.tgz",
-            "integrity": "sha512-BwKEkO+2a67DcFeS3RLl0Z3Gs2OvdXewuWjc1Hfokhb5eQWP9YRYH1/+VrVZvql2CfjOiNGqSAFOYt4lsqTHzg==",
-            "dev": true
-        },
-        "@babel/core": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.13.10.tgz",
-            "integrity": "sha512-bfIYcT0BdKeAZrovpMqX2Mx5NrgAckGbwT982AkdS5GNfn3KMGiprlBAtmBcFZRUmpaufS6WZFP8trvx8ptFDw==",
-            "dev": true,
-            "requires": {
-                "@babel/code-frame": "^7.12.13",
-                "@babel/generator": "^7.13.9",
-                "@babel/helper-compilation-targets": "^7.13.10",
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helpers": "^7.13.10",
-                "@babel/parser": "^7.13.10",
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0",
-                "convert-source-map": "^1.7.0",
-                "debug": "^4.1.0",
-                "gensync": "^1.0.0-beta.2",
-                "json5": "^2.1.2",
-                "lodash": "^4.17.19",
-                "semver": "^6.3.0",
-                "source-map": "^0.5.0"
-            },
-            "dependencies": {
-                "@babel/code-frame": {
-                    "version": "7.12.13",
-                    "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
-                    "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
-                    "dev": true,
-                    "requires": {
-                        "@babel/highlight": "^7.12.13"
-                    }
-                },
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                },
-                "source-map": {
-                    "version": "0.5.7",
-                    "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-                    "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/generator": {
-            "version": "7.13.9",
-            "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.13.9.tgz",
-            "integrity": "sha512-mHOOmY0Axl/JCTkxTU6Lf5sWOg/v8nUa+Xkt4zMTftX0wqmb6Sh7J8gvcehBw7q0AhrhAR+FDacKjCZ2X8K+Sw==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.13.0",
-                "jsesc": "^2.5.1",
-                "source-map": "^0.5.0"
-            },
-            "dependencies": {
-                "source-map": {
-                    "version": "0.5.7",
-                    "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-                    "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/helper-annotate-as-pure": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-annotate-as-pure/-/helper-annotate-as-pure-7.12.13.tgz",
-            "integrity": "sha512-7YXfX5wQ5aYM/BOlbSccHDbuXXFPxeoUmfWtz8le2yTkTZc+BxsiEnENFoi2SlmA8ewDkG2LgIMIVzzn2h8kfw==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-builder-binary-assignment-operator-visitor": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-builder-binary-assignment-operator-visitor/-/helper-builder-binary-assignment-operator-visitor-7.12.13.tgz",
-            "integrity": "sha512-CZOv9tGphhDRlVjVkAgm8Nhklm9RzSmWpX2my+t7Ua/KT616pEzXsQCjinzvkRvHWJ9itO4f296efroX23XCMA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-explode-assignable-expression": "^7.12.13",
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-compilation-targets": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/helper-compilation-targets/-/helper-compilation-targets-7.13.10.tgz",
-            "integrity": "sha512-/Xju7Qg1GQO4mHZ/Kcs6Au7gfafgZnwm+a7sy/ow/tV1sHeraRUHbjdat8/UvDor4Tez+siGKDk6zIKtCPKVJA==",
-            "dev": true,
-            "requires": {
-                "@babel/compat-data": "^7.13.8",
-                "@babel/helper-validator-option": "^7.12.17",
-                "browserslist": "^4.14.5",
-                "semver": "^6.3.0"
-            },
-            "dependencies": {
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/helper-create-class-features-plugin": {
-            "version": "7.13.11",
-            "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.13.11.tgz",
-            "integrity": "sha512-ays0I7XYq9xbjCSvT+EvysLgfc3tOkwCULHjrnscGT3A9qD4sk3wXnJ3of0MAWsWGjdinFvajHU2smYuqXKMrw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-member-expression-to-functions": "^7.13.0",
-                "@babel/helper-optimise-call-expression": "^7.12.13",
-                "@babel/helper-replace-supers": "^7.13.0",
-                "@babel/helper-split-export-declaration": "^7.12.13"
-            }
-        },
-        "@babel/helper-create-regexp-features-plugin": {
-            "version": "7.12.17",
-            "resolved": "https://registry.npmjs.org/@babel/helper-create-regexp-features-plugin/-/helper-create-regexp-features-plugin-7.12.17.tgz",
-            "integrity": "sha512-p2VGmBu9oefLZ2nQpgnEnG0ZlRPvL8gAGvPUMQwUdaE8k49rOMuZpOwdQoy5qJf6K8jL3bcAMhVUlHAjIgJHUg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-annotate-as-pure": "^7.12.13",
-                "regexpu-core": "^4.7.1"
-            }
-        },
-        "@babel/helper-define-polyfill-provider": {
-            "version": "0.1.5",
-            "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.1.5.tgz",
-            "integrity": "sha512-nXuzCSwlJ/WKr8qxzW816gwyT6VZgiJG17zR40fou70yfAcqjoNyTLl/DQ+FExw5Hx5KNqshmN8Ldl/r2N7cTg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-compilation-targets": "^7.13.0",
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/traverse": "^7.13.0",
-                "debug": "^4.1.1",
-                "lodash.debounce": "^4.0.8",
-                "resolve": "^1.14.2",
-                "semver": "^6.1.2"
-            },
-            "dependencies": {
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/helper-explode-assignable-expression": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-explode-assignable-expression/-/helper-explode-assignable-expression-7.13.0.tgz",
-            "integrity": "sha512-qS0peLTDP8kOisG1blKbaoBg/o9OSa1qoumMjTK5pM+KDTtpxpsiubnCGP34vK8BXGcb2M9eigwgvoJryrzwWA==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "@babel/helper-function-name": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-function-name/-/helper-function-name-7.12.13.tgz",
-            "integrity": "sha512-TZvmPn0UOqmvi5G4vvw0qZTpVptGkB1GL61R6lKvrSdIxGm5Pky7Q3fpKiIkQCAtRCBUwB0PaThlx9vebCDSwA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-get-function-arity": "^7.12.13",
-                "@babel/template": "^7.12.13",
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-get-function-arity": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-get-function-arity/-/helper-get-function-arity-7.12.13.tgz",
-            "integrity": "sha512-DjEVzQNz5LICkzN0REdpD5prGoidvbdYk1BVgRUOINaWJP2t6avB27X1guXK1kXNrX0WMfsrm1A/ZBthYuIMQg==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-hoist-variables": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-hoist-variables/-/helper-hoist-variables-7.13.0.tgz",
-            "integrity": "sha512-0kBzvXiIKfsCA0y6cFEIJf4OdzfpRuNk4+YTeHZpGGc666SATFKTz6sRncwFnQk7/ugJ4dSrCj6iJuvW4Qwr2g==",
-            "dev": true,
-            "requires": {
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "@babel/helper-member-expression-to-functions": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.13.0.tgz",
-            "integrity": "sha512-yvRf8Ivk62JwisqV1rFRMxiSMDGnN6KH1/mDMmIrij4jztpQNRoHqqMG3U6apYbGRPJpgPalhva9Yd06HlUxJQ==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "@babel/helper-module-imports": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.12.13.tgz",
-            "integrity": "sha512-NGmfvRp9Rqxy0uHSSVP+SRIW1q31a7Ji10cLBcqSDUngGentY4FRiHOFZFE1CLU5eiL0oE8reH7Tg1y99TDM/g==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-module-transforms": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.13.0.tgz",
-            "integrity": "sha512-Ls8/VBwH577+pw7Ku1QkUWIyRRNHpYlts7+qSqBBFCW3I8QteB9DxfcZ5YJpOwH6Ihe/wn8ch7fMGOP1OhEIvw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-replace-supers": "^7.13.0",
-                "@babel/helper-simple-access": "^7.12.13",
-                "@babel/helper-split-export-declaration": "^7.12.13",
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0",
-                "lodash": "^4.17.19"
-            }
-        },
-        "@babel/helper-optimise-call-expression": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-optimise-call-expression/-/helper-optimise-call-expression-7.12.13.tgz",
-            "integrity": "sha512-BdWQhoVJkp6nVjB7nkFWcn43dkprYauqtk++Py2eaf/GRDFm5BxRqEIZCiHlZUGAVmtwKcsVL1dC68WmzeFmiA==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-plugin-utils": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.13.0.tgz",
-            "integrity": "sha512-ZPafIPSwzUlAoWT8DKs1W2VyF2gOWthGd5NGFMsBcMMol+ZhK+EQY/e6V96poa6PA/Bh+C9plWN0hXO1uB8AfQ==",
-            "dev": true
-        },
-        "@babel/helper-remap-async-to-generator": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-remap-async-to-generator/-/helper-remap-async-to-generator-7.13.0.tgz",
-            "integrity": "sha512-pUQpFBE9JvC9lrQbpX0TmeNIy5s7GnZjna2lhhcHC7DzgBs6fWn722Y5cfwgrtrqc7NAJwMvOa0mKhq6XaE4jg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-annotate-as-pure": "^7.12.13",
-                "@babel/helper-wrap-function": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "@babel/helper-replace-supers": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.13.0.tgz",
-            "integrity": "sha512-Segd5me1+Pz+rmN/NFBOplMbZG3SqRJOBlY+mA0SxAv6rjj7zJqr1AVr3SfzUVTLCv7ZLU5FycOM/SBGuLPbZw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-member-expression-to-functions": "^7.13.0",
-                "@babel/helper-optimise-call-expression": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "@babel/helper-simple-access": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.12.13.tgz",
-            "integrity": "sha512-0ski5dyYIHEfwpWGx5GPWhH35j342JaflmCeQmsPWcrOQDtCN6C1zKAVRFVbK53lPW2c9TsuLLSUDf0tIGJ5hA==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-skip-transparent-expression-wrappers": {
-            "version": "7.12.1",
-            "resolved": "https://registry.npmjs.org/@babel/helper-skip-transparent-expression-wrappers/-/helper-skip-transparent-expression-wrappers-7.12.1.tgz",
-            "integrity": "sha512-Mf5AUuhG1/OCChOJ/HcADmvcHM42WJockombn8ATJG3OnyiSxBK/Mm5x78BQWvmtXZKHgbjdGL2kin/HOLlZGA==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.12.1"
-            }
-        },
-        "@babel/helper-split-export-declaration": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.12.13.tgz",
-            "integrity": "sha512-tCJDltF83htUtXx5NLcaDqRmknv652ZWCHyoTETf1CXYJdPC7nohZohjUgieXhv0hTJdRf2FjDueFehdNucpzg==",
-            "dev": true,
-            "requires": {
-                "@babel/types": "^7.12.13"
-            }
-        },
-        "@babel/helper-validator-identifier": {
-            "version": "7.12.11",
-            "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.12.11.tgz",
-            "integrity": "sha512-np/lG3uARFybkoHokJUmf1QfEvRVCPbmQeUQpKow5cQ3xWrV9i3rUHodKDJPQfTVX61qKi+UdYk8kik84n7XOw==",
-            "dev": true
-        },
-        "@babel/helper-validator-option": {
-            "version": "7.12.17",
-            "resolved": "https://registry.npmjs.org/@babel/helper-validator-option/-/helper-validator-option-7.12.17.tgz",
-            "integrity": "sha512-TopkMDmLzq8ngChwRlyjR6raKD6gMSae4JdYDB8bByKreQgG0RBTuKe9LRxW3wFtUnjxOPRKBDwEH6Mg5KeDfw==",
-            "dev": true
-        },
-        "@babel/helper-wrap-function": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.13.0.tgz",
-            "integrity": "sha512-1UX9F7K3BS42fI6qd2A4BjKzgGjToscyZTdp1DjknHLCIvpgne6918io+aL5LXFcER/8QWiwpoY902pVEqgTXA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "@babel/helpers": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.13.10.tgz",
-            "integrity": "sha512-4VO883+MWPDUVRF3PhiLBUFHoX/bsLTGFpFK/HqvvfBZz2D57u9XzPVNFVBTc0PW/CWR9BXTOKt8NF4DInUHcQ==",
-            "dev": true,
-            "requires": {
-                "@babel/template": "^7.12.13",
-                "@babel/traverse": "^7.13.0",
-                "@babel/types": "^7.13.0"
-            }
-        },
-        "@babel/highlight": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.13.10.tgz",
-            "integrity": "sha512-5aPpe5XQPzflQrFwL1/QoeHkP2MsA4JCntcXHRhEsdsfPVkvPi2w7Qix4iV7t5S/oC9OodGrggd8aco1g3SZFg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "chalk": "^2.0.0",
-                "js-tokens": "^4.0.0"
-            },
-            "dependencies": {
-                "ansi-styles": {
-                    "version": "3.2.1",
-                    "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz",
-                    "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
-                    "dev": true,
-                    "requires": {
-                        "color-convert": "^1.9.0"
-                    }
-                },
-                "chalk": {
-                    "version": "2.4.2",
-                    "resolved": "https://registry.npmjs.org/chalk/-/chalk-2.4.2.tgz",
-                    "integrity": "sha512-Mti+f9lpJNcwF4tWV8/OrTTtF1gZi+f8FqlyAdouralcFWFQWF2+NgCHShjkCb+IFBLq9buZwE1xckQU4peSuQ==",
-                    "dev": true,
-                    "requires": {
-                        "ansi-styles": "^3.2.1",
-                        "escape-string-regexp": "^1.0.5",
-                        "supports-color": "^5.3.0"
-                    }
-                },
-                "color-convert": {
-                    "version": "1.9.3",
-                    "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz",
-                    "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
-                    "dev": true,
-                    "requires": {
-                        "color-name": "1.1.3"
-                    }
-                },
-                "color-name": {
-                    "version": "1.1.3",
-                    "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz",
-                    "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=",
-                    "dev": true
-                },
-                "has-flag": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-3.0.0.tgz",
-                    "integrity": "sha1-tdRU3CGZriJWmfNGfloH87lVuv0=",
-                    "dev": true
-                },
-                "supports-color": {
-                    "version": "5.5.0",
-                    "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-5.5.0.tgz",
-                    "integrity": "sha512-QjVjwdXIt408MIiAqCX4oUKsgU2EqAGzs2Ppkm4aQYbjm+ZEWEcW4SfFNTr4uMNZma0ey4f5lgLrkB0aX0QMow==",
-                    "dev": true,
-                    "requires": {
-                        "has-flag": "^3.0.0"
-                    }
-                }
-            }
-        },
-        "@babel/parser": {
-            "version": "7.13.11",
-            "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.13.11.tgz",
-            "integrity": "sha512-PhuoqeHoO9fc4ffMEVk4qb/w/s2iOSWohvbHxLtxui0eBg3Lg5gN1U8wp1V1u61hOWkPQJJyJzGH6Y+grwkq8Q==",
-            "dev": true
-        },
-        "@babel/plugin-proposal-async-generator-functions": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-async-generator-functions/-/plugin-proposal-async-generator-functions-7.13.8.tgz",
-            "integrity": "sha512-rPBnhj+WgoSmgq+4gQUtXx/vOcU+UYtjy1AA/aeD61Hwj410fwYyqfUcRP3lR8ucgliVJL/G7sXcNUecC75IXA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-remap-async-to-generator": "^7.13.0",
-                "@babel/plugin-syntax-async-generators": "^7.8.4"
-            }
-        },
-        "@babel/plugin-proposal-class-properties": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-class-properties/-/plugin-proposal-class-properties-7.13.0.tgz",
-            "integrity": "sha512-KnTDjFNC1g+45ka0myZNvSBFLhNCLN+GeGYLDEA8Oq7MZ6yMgfLoIRh86GRT0FjtJhZw8JyUskP9uvj5pHM9Zg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-create-class-features-plugin": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-proposal-dynamic-import": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-dynamic-import/-/plugin-proposal-dynamic-import-7.13.8.tgz",
-            "integrity": "sha512-ONWKj0H6+wIRCkZi9zSbZtE/r73uOhMVHh256ys0UzfM7I3d4n+spZNWjOnJv2gzopumP2Wxi186vI8N0Y2JyQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-dynamic-import": "^7.8.3"
-            }
-        },
-        "@babel/plugin-proposal-export-namespace-from": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-export-namespace-from/-/plugin-proposal-export-namespace-from-7.12.13.tgz",
-            "integrity": "sha512-INAgtFo4OnLN3Y/j0VwAgw3HDXcDtX+C/erMvWzuV9v71r7urb6iyMXu7eM9IgLr1ElLlOkaHjJ0SbCmdOQ3Iw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13",
-                "@babel/plugin-syntax-export-namespace-from": "^7.8.3"
-            }
-        },
-        "@babel/plugin-proposal-json-strings": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-json-strings/-/plugin-proposal-json-strings-7.13.8.tgz",
-            "integrity": "sha512-w4zOPKUFPX1mgvTmL/fcEqy34hrQ1CRcGxdphBc6snDnnqJ47EZDIyop6IwXzAC8G916hsIuXB2ZMBCExC5k7Q==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-json-strings": "^7.8.3"
-            }
-        },
-        "@babel/plugin-proposal-logical-assignment-operators": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-logical-assignment-operators/-/plugin-proposal-logical-assignment-operators-7.13.8.tgz",
-            "integrity": "sha512-aul6znYB4N4HGweImqKn59Su9RS8lbUIqxtXTOcAGtNIDczoEFv+l1EhmX8rUBp3G1jMjKJm8m0jXVp63ZpS4A==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-logical-assignment-operators": "^7.10.4"
-            }
-        },
-        "@babel/plugin-proposal-nullish-coalescing-operator": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-nullish-coalescing-operator/-/plugin-proposal-nullish-coalescing-operator-7.13.8.tgz",
-            "integrity": "sha512-iePlDPBn//UhxExyS9KyeYU7RM9WScAG+D3Hhno0PLJebAEpDZMocbDe64eqynhNAnwz/vZoL/q/QB2T1OH39A==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3"
-            }
-        },
-        "@babel/plugin-proposal-numeric-separator": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-numeric-separator/-/plugin-proposal-numeric-separator-7.12.13.tgz",
-            "integrity": "sha512-O1jFia9R8BUCl3ZGB7eitaAPu62TXJRHn7rh+ojNERCFyqRwJMTmhz+tJ+k0CwI6CLjX/ee4qW74FSqlq9I35w==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13",
-                "@babel/plugin-syntax-numeric-separator": "^7.10.4"
-            }
-        },
-        "@babel/plugin-proposal-object-rest-spread": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-object-rest-spread/-/plugin-proposal-object-rest-spread-7.13.8.tgz",
-            "integrity": "sha512-DhB2EuB1Ih7S3/IRX5AFVgZ16k3EzfRbq97CxAVI1KSYcW+lexV8VZb7G7L8zuPVSdQMRn0kiBpf/Yzu9ZKH0g==",
-            "dev": true,
-            "requires": {
-                "@babel/compat-data": "^7.13.8",
-                "@babel/helper-compilation-targets": "^7.13.8",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-object-rest-spread": "^7.8.3",
-                "@babel/plugin-transform-parameters": "^7.13.0"
-            }
-        },
-        "@babel/plugin-proposal-optional-catch-binding": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-optional-catch-binding/-/plugin-proposal-optional-catch-binding-7.13.8.tgz",
-            "integrity": "sha512-0wS/4DUF1CuTmGo+NiaHfHcVSeSLj5S3e6RivPTg/2k3wOv3jO35tZ6/ZWsQhQMvdgI7CwphjQa/ccarLymHVA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-optional-catch-binding": "^7.8.3"
-            }
-        },
-        "@babel/plugin-proposal-optional-chaining": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-optional-chaining/-/plugin-proposal-optional-chaining-7.13.8.tgz",
-            "integrity": "sha512-hpbBwbTgd7Cz1QryvwJZRo1U0k1q8uyBmeXOSQUjdg/A2TASkhR/rz7AyqZ/kS8kbpsNA80rOYbxySBJAqmhhQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-skip-transparent-expression-wrappers": "^7.12.1",
-                "@babel/plugin-syntax-optional-chaining": "^7.8.3"
-            }
-        },
-        "@babel/plugin-proposal-private-methods": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-private-methods/-/plugin-proposal-private-methods-7.13.0.tgz",
-            "integrity": "sha512-MXyyKQd9inhx1kDYPkFRVOBXQ20ES8Pto3T7UZ92xj2mY0EVD8oAVzeyYuVfy/mxAdTSIayOvg+aVzcHV2bn6Q==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-create-class-features-plugin": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-proposal-unicode-property-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-unicode-property-regex/-/plugin-proposal-unicode-property-regex-7.12.13.tgz",
-            "integrity": "sha512-XyJmZidNfofEkqFV5VC/bLabGmO5QzenPO/YOfGuEbgU+2sSwMmio3YLb4WtBgcmmdwZHyVyv8on77IUjQ5Gvg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-syntax-async-generators": {
-            "version": "7.8.4",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-async-generators/-/plugin-syntax-async-generators-7.8.4.tgz",
-            "integrity": "sha512-tycmZxkGfZaxhMRbXlPXuVFpdWlXpir2W4AMhSJgRKzk/eDlIXOhb2LHWoLpDF7TEHylV5zNhykX6KAgHJmTNw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "@babel/plugin-syntax-class-properties": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-class-properties/-/plugin-syntax-class-properties-7.12.13.tgz",
-            "integrity": "sha512-fm4idjKla0YahUNgFNLCB0qySdsoPiZP3iQE3rky0mBUtMZ23yDJ9SJdg6dXTSDnulOVqiF3Hgr9nbXvXTQZYA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-syntax-dynamic-import": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-dynamic-import/-/plugin-syntax-dynamic-import-7.8.3.tgz",
-            "integrity": "sha512-5gdGbFon+PszYzqs83S3E5mpi7/y/8M9eC90MRTZfduQOYW76ig6SOSPNe41IG5LoP3FGBn2N0RjVDSQiS94kQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "@babel/plugin-syntax-export-namespace-from": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-export-namespace-from/-/plugin-syntax-export-namespace-from-7.8.3.tgz",
-            "integrity": "sha512-MXf5laXo6c1IbEbegDmzGPwGNTsHZmEy6QGznu5Sh2UCWvueywb2ee+CCE4zQiZstxU9BMoQO9i6zUFSY0Kj0Q==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.3"
-            }
-        },
-        "@babel/plugin-syntax-json-strings": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-json-strings/-/plugin-syntax-json-strings-7.8.3.tgz",
-            "integrity": "sha512-lY6kdGpWHvjoe2vk4WrAapEuBR69EMxZl+RoGRhrFGNYVK8mOPAW8VfbT/ZgrFbXlDNiiaxQnAtgVCZ6jv30EA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "@babel/plugin-syntax-logical-assignment-operators": {
-            "version": "7.10.4",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-logical-assignment-operators/-/plugin-syntax-logical-assignment-operators-7.10.4.tgz",
-            "integrity": "sha512-d8waShlpFDinQ5MtvGU9xDAOzKH47+FFoney2baFIoMr952hKOLp1HR7VszoZvOsV/4+RRszNY7D17ba0te0ig==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.10.4"
-            }
-        },
-        "@babel/plugin-syntax-nullish-coalescing-operator": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-nullish-coalescing-operator/-/plugin-syntax-nullish-coalescing-operator-7.8.3.tgz",
-            "integrity": "sha512-aSff4zPII1u2QD7y+F8oDsz19ew4IGEJg9SVW+bqwpwtfFleiQDMdzA/R+UlWDzfnHFCxxleFT0PMIrR36XLNQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "@babel/plugin-syntax-numeric-separator": {
-            "version": "7.10.4",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-numeric-separator/-/plugin-syntax-numeric-separator-7.10.4.tgz",
-            "integrity": "sha512-9H6YdfkcK/uOnY/K7/aA2xpzaAgkQn37yzWUMRK7OaPOqOpGS1+n0H5hxT9AUw9EsSjPW8SVyMJwYRtWs3X3ug==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.10.4"
-            }
-        },
-        "@babel/plugin-syntax-object-rest-spread": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-object-rest-spread/-/plugin-syntax-object-rest-spread-7.8.3.tgz",
-            "integrity": "sha512-XoqMijGZb9y3y2XskN+P1wUGiVwWZ5JmoDRwx5+3GmEplNyVM2s2Dg8ILFQm8rWM48orGy5YpI5Bl8U1y7ydlA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "@babel/plugin-syntax-optional-catch-binding": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-optional-catch-binding/-/plugin-syntax-optional-catch-binding-7.8.3.tgz",
-            "integrity": "sha512-6VPD0Pc1lpTqw0aKoeRTMiB+kWhAoT24PA+ksWSBrFtl5SIRVpZlwN3NNPQjehA2E/91FV3RjLWoVTglWcSV3Q==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "@babel/plugin-syntax-optional-chaining": {
-            "version": "7.8.3",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-optional-chaining/-/plugin-syntax-optional-chaining-7.8.3.tgz",
-            "integrity": "sha512-KoK9ErH1MBlCPxV0VANkXW2/dw4vlbGDrFgz8bmUsBGYkFRcbRwMh6cIJubdPrkxRwuGdtCk0v/wPTKbQgBjkg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.8.0"
-            }
-        },
-        "@babel/plugin-syntax-top-level-await": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-top-level-await/-/plugin-syntax-top-level-await-7.12.13.tgz",
-            "integrity": "sha512-A81F9pDwyS7yM//KwbCSDqy3Uj4NMIurtplxphWxoYtNPov7cJsDkAFNNyVlIZ3jwGycVsurZ+LtOA8gZ376iQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-syntax-typescript": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-typescript/-/plugin-syntax-typescript-7.12.13.tgz",
-            "integrity": "sha512-cHP3u1JiUiG2LFDKbXnwVad81GvfyIOmCD6HIEId6ojrY0Drfy2q1jw7BwN7dE84+kTnBjLkXoL3IEy/3JPu2w==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-arrow-functions": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.13.0.tgz",
-            "integrity": "sha512-96lgJagobeVmazXFaDrbmCLQxBysKu7U6Do3mLsx27gf5Dk85ezysrs2BZUpXD703U/Su1xTBDxxar2oa4jAGg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-async-to-generator": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.13.0.tgz",
-            "integrity": "sha512-3j6E004Dx0K3eGmhxVJxwwI89CTJrce7lg3UrtFuDAVQ/2+SJ/h/aSFOeE6/n0WB1GsOffsJp6MnPQNQ8nmwhg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-remap-async-to-generator": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-block-scoped-functions": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.12.13.tgz",
-            "integrity": "sha512-zNyFqbc3kI/fVpqwfqkg6RvBgFpC4J18aKKMmv7KdQ/1GgREapSJAykLMVNwfRGO3BtHj3YQZl8kxCXPcVMVeg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-block-scoping": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.12.13.tgz",
-            "integrity": "sha512-Pxwe0iqWJX4fOOM2kEZeUuAxHMWb9nK+9oh5d11bsLoB0xMg+mkDpt0eYuDZB7ETrY9bbcVlKUGTOGWy7BHsMQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-classes": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.13.0.tgz",
-            "integrity": "sha512-9BtHCPUARyVH1oXGcSJD3YpsqRLROJx5ZNP6tN5vnk17N0SVf9WCtf8Nuh1CFmgByKKAIMstitKduoCmsaDK5g==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-annotate-as-pure": "^7.12.13",
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-optimise-call-expression": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-replace-supers": "^7.13.0",
-                "@babel/helper-split-export-declaration": "^7.12.13",
-                "globals": "^11.1.0"
-            },
-            "dependencies": {
-                "globals": {
-                    "version": "11.12.0",
-                    "resolved": "https://registry.npmjs.org/globals/-/globals-11.12.0.tgz",
-                    "integrity": "sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/plugin-transform-computed-properties": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.13.0.tgz",
-            "integrity": "sha512-RRqTYTeZkZAz8WbieLTvKUEUxZlUTdmL5KGMyZj7FnMfLNKV4+r5549aORG/mgojRmFlQMJDUupwAMiF2Q7OUg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-destructuring": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.13.0.tgz",
-            "integrity": "sha512-zym5em7tePoNT9s964c0/KU3JPPnuq7VhIxPRefJ4/s82cD+q1mgKfuGRDMCPL0HTyKz4dISuQlCusfgCJ86HA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-dotall-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.12.13.tgz",
-            "integrity": "sha512-foDrozE65ZFdUC2OfgeOCrEPTxdB3yjqxpXh8CH+ipd9CHd4s/iq81kcUpyH8ACGNEPdFqbtzfgzbT/ZGlbDeQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-duplicate-keys": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.12.13.tgz",
-            "integrity": "sha512-NfADJiiHdhLBW3pulJlJI2NB0t4cci4WTZ8FtdIuNc2+8pslXdPtRRAEWqUY+m9kNOk2eRYbTAOipAxlrOcwwQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-exponentiation-operator": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.12.13.tgz",
-            "integrity": "sha512-fbUelkM1apvqez/yYx1/oICVnGo2KM5s63mhGylrmXUxK/IAXSIf87QIxVfZldWf4QsOafY6vV3bX8aMHSvNrA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-builder-binary-assignment-operator-visitor": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-for-of": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.13.0.tgz",
-            "integrity": "sha512-IHKT00mwUVYE0zzbkDgNRP6SRzvfGCYsOxIRz8KsiaaHCcT9BWIkO+H9QRJseHBLOGBZkHUdHiqj6r0POsdytg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-function-name": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.12.13.tgz",
-            "integrity": "sha512-6K7gZycG0cmIwwF7uMK/ZqeCikCGVBdyP2J5SKNCXO5EOHcqi+z7Jwf8AmyDNcBgxET8DrEtCt/mPKPyAzXyqQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-literals": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.12.13.tgz",
-            "integrity": "sha512-FW+WPjSR7hiUxMcKqyNjP05tQ2kmBCdpEpZHY1ARm96tGQCCBvXKnpjILtDplUnJ/eHZ0lALLM+d2lMFSpYJrQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-member-expression-literals": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.12.13.tgz",
-            "integrity": "sha512-kxLkOsg8yir4YeEPHLuO2tXP9R/gTjpuTOjshqSpELUN3ZAg2jfDnKUvzzJxObun38sw3wm4Uu69sX/zA7iRvg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-modules-amd": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.13.0.tgz",
-            "integrity": "sha512-EKy/E2NHhY/6Vw5d1k3rgoobftcNUmp9fGjb9XZwQLtTctsRBOTRO7RHHxfIky1ogMN5BxN7p9uMA3SzPfotMQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "babel-plugin-dynamic-import-node": "^2.3.3"
-            }
-        },
-        "@babel/plugin-transform-modules-commonjs": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.13.8.tgz",
-            "integrity": "sha512-9QiOx4MEGglfYZ4XOnU79OHr6vIWUakIj9b4mioN8eQIoEh+pf5p/zEB36JpDFWA12nNMiRf7bfoRvl9Rn79Bw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-simple-access": "^7.12.13",
-                "babel-plugin-dynamic-import-node": "^2.3.3"
-            }
-        },
-        "@babel/plugin-transform-modules-systemjs": {
-            "version": "7.13.8",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.13.8.tgz",
-            "integrity": "sha512-hwqctPYjhM6cWvVIlOIe27jCIBgHCsdH2xCJVAYQm7V5yTMoilbVMi9f6wKg0rpQAOn6ZG4AOyvCqFF/hUh6+A==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-hoist-variables": "^7.13.0",
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "babel-plugin-dynamic-import-node": "^2.3.3"
-            }
-        },
-        "@babel/plugin-transform-modules-umd": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.13.0.tgz",
-            "integrity": "sha512-D/ILzAh6uyvkWjKKyFE/W0FzWwasv6vPTSqPcjxFqn6QpX3u8DjRVliq4F2BamO2Wee/om06Vyy+vPkNrd4wxw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-module-transforms": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-named-capturing-groups-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-named-capturing-groups-regex/-/plugin-transform-named-capturing-groups-regex-7.12.13.tgz",
-            "integrity": "sha512-Xsm8P2hr5hAxyYblrfACXpQKdQbx4m2df9/ZZSQ8MAhsadw06+jW7s9zsSw6he+mJZXRlVMyEnVktJo4zjk1WA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-new-target": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.12.13.tgz",
-            "integrity": "sha512-/KY2hbLxrG5GTQ9zzZSc3xWiOy379pIETEhbtzwZcw9rvuaVV4Fqy7BYGYOWZnaoXIQYbbJ0ziXLa/sKcGCYEQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-object-super": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.12.13.tgz",
-            "integrity": "sha512-JzYIcj3XtYspZDV8j9ulnoMPZZnF/Cj0LUxPOjR89BdBVx+zYJI9MdMIlUZjbXDX+6YVeS6I3e8op+qQ3BYBoQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13",
-                "@babel/helper-replace-supers": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-parameters": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.13.0.tgz",
-            "integrity": "sha512-Jt8k/h/mIwE2JFEOb3lURoY5C85ETcYPnbuAJ96zRBzh1XHtQZfs62ChZ6EP22QlC8c7Xqr9q+e1SU5qttwwjw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-property-literals": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.12.13.tgz",
-            "integrity": "sha512-nqVigwVan+lR+g8Fj8Exl0UQX2kymtjcWfMOYM1vTYEKujeyv2SkMgazf2qNcK7l4SDiKyTA/nHCPqL4e2zo1A==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-regenerator": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.12.13.tgz",
-            "integrity": "sha512-lxb2ZAvSLyJ2PEe47hoGWPmW22v7CtSl9jW8mingV4H2sEX/JOcrAj2nPuGWi56ERUm2bUpjKzONAuT6HCn2EA==",
-            "dev": true,
-            "requires": {
-                "regenerator-transform": "^0.14.2"
-            }
-        },
-        "@babel/plugin-transform-reserved-words": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.12.13.tgz",
-            "integrity": "sha512-xhUPzDXxZN1QfiOy/I5tyye+TRz6lA7z6xaT4CLOjPRMVg1ldRf0LHw0TDBpYL4vG78556WuHdyO9oi5UmzZBg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-runtime": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-runtime/-/plugin-transform-runtime-7.13.10.tgz",
-            "integrity": "sha512-Y5k8ipgfvz5d/76tx7JYbKQTcgFSU6VgJ3kKQv4zGTKr+a9T/KBvfRvGtSFgKDQGt/DBykQixV0vNWKIdzWErA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-module-imports": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "babel-plugin-polyfill-corejs2": "^0.1.4",
-                "babel-plugin-polyfill-corejs3": "^0.1.3",
-                "babel-plugin-polyfill-regenerator": "^0.1.2",
-                "semver": "^6.3.0"
-            },
-            "dependencies": {
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/plugin-transform-shorthand-properties": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.12.13.tgz",
-            "integrity": "sha512-xpL49pqPnLtf0tVluuqvzWIgLEhuPpZzvs2yabUHSKRNlN7ScYU7aMlmavOeyXJZKgZKQRBlh8rHbKiJDraTSw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-spread": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.13.0.tgz",
-            "integrity": "sha512-V6vkiXijjzYeFmQTr3dBxPtZYLPcUfY34DebOU27jIl2M/Y8Egm52Hw82CSjjPqd54GTlJs5x+CR7HeNr24ckg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-skip-transparent-expression-wrappers": "^7.12.1"
-            }
-        },
-        "@babel/plugin-transform-sticky-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.12.13.tgz",
-            "integrity": "sha512-Jc3JSaaWT8+fr7GRvQP02fKDsYk4K/lYwWq38r/UGfaxo89ajud321NH28KRQ7xy1Ybc0VUE5Pz8psjNNDUglg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-template-literals": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.13.0.tgz",
-            "integrity": "sha512-d67umW6nlfmr1iehCcBv69eSUSySk1EsIS8aTDX4Xo9qajAh6mYtcl4kJrBkGXuxZPEgVr7RVfAvNW6YQkd4Mw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0"
-            }
-        },
-        "@babel/plugin-transform-typeof-symbol": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.12.13.tgz",
-            "integrity": "sha512-eKv/LmUJpMnu4npgfvs3LiHhJua5fo/CysENxa45YCQXZwKnGCQKAg87bvoqSW1fFT+HA32l03Qxsm8ouTY3ZQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-typescript": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typescript/-/plugin-transform-typescript-7.13.0.tgz",
-            "integrity": "sha512-elQEwluzaU8R8dbVuW2Q2Y8Nznf7hnjM7+DSCd14Lo5fF63C9qNLbwZYbmZrtV9/ySpSUpkRpQXvJb6xyu4hCQ==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-create-class-features-plugin": "^7.13.0",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/plugin-syntax-typescript": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-unicode-escapes": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.12.13.tgz",
-            "integrity": "sha512-0bHEkdwJ/sN/ikBHfSmOXPypN/beiGqjo+o4/5K+vxEFNPRPdImhviPakMKG4x96l85emoa0Z6cDflsdBusZbw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/plugin-transform-unicode-regex": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.12.13.tgz",
-            "integrity": "sha512-mDRzSNY7/zopwisPZ5kM9XKCfhchqIYwAKRERtEnhYscZB79VRekuRSoYbN0+KVe3y8+q1h6A4svXtP7N+UoCA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-create-regexp-features-plugin": "^7.12.13",
-                "@babel/helper-plugin-utils": "^7.12.13"
-            }
-        },
-        "@babel/preset-env": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.13.10.tgz",
-            "integrity": "sha512-nOsTScuoRghRtUsRr/c69d042ysfPHcu+KOB4A9aAO9eJYqrkat+LF8G1yp1HD18QiwixT2CisZTr/0b3YZPXQ==",
-            "dev": true,
-            "requires": {
-                "@babel/compat-data": "^7.13.8",
-                "@babel/helper-compilation-targets": "^7.13.10",
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-validator-option": "^7.12.17",
-                "@babel/plugin-proposal-async-generator-functions": "^7.13.8",
-                "@babel/plugin-proposal-class-properties": "^7.13.0",
-                "@babel/plugin-proposal-dynamic-import": "^7.13.8",
-                "@babel/plugin-proposal-export-namespace-from": "^7.12.13",
-                "@babel/plugin-proposal-json-strings": "^7.13.8",
-                "@babel/plugin-proposal-logical-assignment-operators": "^7.13.8",
-                "@babel/plugin-proposal-nullish-coalescing-operator": "^7.13.8",
-                "@babel/plugin-proposal-numeric-separator": "^7.12.13",
-                "@babel/plugin-proposal-object-rest-spread": "^7.13.8",
-                "@babel/plugin-proposal-optional-catch-binding": "^7.13.8",
-                "@babel/plugin-proposal-optional-chaining": "^7.13.8",
-                "@babel/plugin-proposal-private-methods": "^7.13.0",
-                "@babel/plugin-proposal-unicode-property-regex": "^7.12.13",
-                "@babel/plugin-syntax-async-generators": "^7.8.4",
-                "@babel/plugin-syntax-class-properties": "^7.12.13",
-                "@babel/plugin-syntax-dynamic-import": "^7.8.3",
-                "@babel/plugin-syntax-export-namespace-from": "^7.8.3",
-                "@babel/plugin-syntax-json-strings": "^7.8.3",
-                "@babel/plugin-syntax-logical-assignment-operators": "^7.10.4",
-                "@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3",
-                "@babel/plugin-syntax-numeric-separator": "^7.10.4",
-                "@babel/plugin-syntax-object-rest-spread": "^7.8.3",
-                "@babel/plugin-syntax-optional-catch-binding": "^7.8.3",
-                "@babel/plugin-syntax-optional-chaining": "^7.8.3",
-                "@babel/plugin-syntax-top-level-await": "^7.12.13",
-                "@babel/plugin-transform-arrow-functions": "^7.13.0",
-                "@babel/plugin-transform-async-to-generator": "^7.13.0",
-                "@babel/plugin-transform-block-scoped-functions": "^7.12.13",
-                "@babel/plugin-transform-block-scoping": "^7.12.13",
-                "@babel/plugin-transform-classes": "^7.13.0",
-                "@babel/plugin-transform-computed-properties": "^7.13.0",
-                "@babel/plugin-transform-destructuring": "^7.13.0",
-                "@babel/plugin-transform-dotall-regex": "^7.12.13",
-                "@babel/plugin-transform-duplicate-keys": "^7.12.13",
-                "@babel/plugin-transform-exponentiation-operator": "^7.12.13",
-                "@babel/plugin-transform-for-of": "^7.13.0",
-                "@babel/plugin-transform-function-name": "^7.12.13",
-                "@babel/plugin-transform-literals": "^7.12.13",
-                "@babel/plugin-transform-member-expression-literals": "^7.12.13",
-                "@babel/plugin-transform-modules-amd": "^7.13.0",
-                "@babel/plugin-transform-modules-commonjs": "^7.13.8",
-                "@babel/plugin-transform-modules-systemjs": "^7.13.8",
-                "@babel/plugin-transform-modules-umd": "^7.13.0",
-                "@babel/plugin-transform-named-capturing-groups-regex": "^7.12.13",
-                "@babel/plugin-transform-new-target": "^7.12.13",
-                "@babel/plugin-transform-object-super": "^7.12.13",
-                "@babel/plugin-transform-parameters": "^7.13.0",
-                "@babel/plugin-transform-property-literals": "^7.12.13",
-                "@babel/plugin-transform-regenerator": "^7.12.13",
-                "@babel/plugin-transform-reserved-words": "^7.12.13",
-                "@babel/plugin-transform-shorthand-properties": "^7.12.13",
-                "@babel/plugin-transform-spread": "^7.13.0",
-                "@babel/plugin-transform-sticky-regex": "^7.12.13",
-                "@babel/plugin-transform-template-literals": "^7.13.0",
-                "@babel/plugin-transform-typeof-symbol": "^7.12.13",
-                "@babel/plugin-transform-unicode-escapes": "^7.12.13",
-                "@babel/plugin-transform-unicode-regex": "^7.12.13",
-                "@babel/preset-modules": "^0.1.4",
-                "@babel/types": "^7.13.0",
-                "babel-plugin-polyfill-corejs2": "^0.1.4",
-                "babel-plugin-polyfill-corejs3": "^0.1.3",
-                "babel-plugin-polyfill-regenerator": "^0.1.2",
-                "core-js-compat": "^3.9.0",
-                "semver": "^6.3.0"
-            },
-            "dependencies": {
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/preset-modules": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/@babel/preset-modules/-/preset-modules-0.1.4.tgz",
-            "integrity": "sha512-J36NhwnfdzpmH41M1DrnkkgAqhZaqr/NBdPfQ677mLzlaXo+oDiv1deyCDtgAhz8p328otdob0Du7+xgHGZbKg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.0.0",
-                "@babel/plugin-proposal-unicode-property-regex": "^7.4.4",
-                "@babel/plugin-transform-dotall-regex": "^7.4.4",
-                "@babel/types": "^7.4.4",
-                "esutils": "^2.0.2"
-            }
-        },
-        "@babel/preset-typescript": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/preset-typescript/-/preset-typescript-7.13.0.tgz",
-            "integrity": "sha512-LXJwxrHy0N3f6gIJlYbLta1D9BDtHpQeqwzM0LIfjDlr6UE/D5Mc7W4iDiQzaE+ks0sTjT26ArcHWnJVt0QiHw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-plugin-utils": "^7.13.0",
-                "@babel/helper-validator-option": "^7.12.17",
-                "@babel/plugin-transform-typescript": "^7.13.0"
-            }
-        },
-        "@babel/runtime": {
-            "version": "7.13.10",
-            "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.13.10.tgz",
-            "integrity": "sha512-4QPkjJq6Ns3V/RgpEahRk+AGfL0eO6RHHtTWoNNr5mO49G6B5+X6d6THgWEAvTrznU5xYpbAlVKRYcsCgh/Akw==",
-            "requires": {
-                "regenerator-runtime": "^0.13.4"
-            }
-        },
-        "@babel/template": {
-            "version": "7.12.13",
-            "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.12.13.tgz",
-            "integrity": "sha512-/7xxiGA57xMo/P2GVvdEumr8ONhFOhfgq2ihK3h1e6THqzTAkHbkXgB0xI9yeTfIUoH3+oAeHhqm/I43OTbbjA==",
-            "dev": true,
-            "requires": {
-                "@babel/code-frame": "^7.12.13",
-                "@babel/parser": "^7.12.13",
-                "@babel/types": "^7.12.13"
-            },
-            "dependencies": {
-                "@babel/code-frame": {
-                    "version": "7.12.13",
-                    "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
-                    "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
-                    "dev": true,
-                    "requires": {
-                        "@babel/highlight": "^7.12.13"
-                    }
-                }
-            }
-        },
-        "@babel/traverse": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.13.0.tgz",
-            "integrity": "sha512-xys5xi5JEhzC3RzEmSGrs/b3pJW/o87SypZ+G/PhaE7uqVQNv/jlmVIBXuoh5atqQ434LfXV+sf23Oxj0bchJQ==",
-            "dev": true,
-            "requires": {
-                "@babel/code-frame": "^7.12.13",
-                "@babel/generator": "^7.13.0",
-                "@babel/helper-function-name": "^7.12.13",
-                "@babel/helper-split-export-declaration": "^7.12.13",
-                "@babel/parser": "^7.13.0",
-                "@babel/types": "^7.13.0",
-                "debug": "^4.1.0",
-                "globals": "^11.1.0",
-                "lodash": "^4.17.19"
-            },
-            "dependencies": {
-                "@babel/code-frame": {
-                    "version": "7.12.13",
-                    "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
-                    "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
-                    "dev": true,
-                    "requires": {
-                        "@babel/highlight": "^7.12.13"
-                    }
-                },
-                "globals": {
-                    "version": "11.12.0",
-                    "resolved": "https://registry.npmjs.org/globals/-/globals-11.12.0.tgz",
-                    "integrity": "sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==",
-                    "dev": true
-                }
-            }
-        },
-        "@babel/types": {
-            "version": "7.13.0",
-            "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.13.0.tgz",
-            "integrity": "sha512-hE+HE8rnG1Z6Wzo+MhaKE5lM5eMx71T4EHJgku2E3xIfaULhDcxiiRxUYgwX8qwP1BBSlag+TdGOt6JAidIZTA==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-validator-identifier": "^7.12.11",
-                "lodash": "^4.17.19",
-                "to-fast-properties": "^2.0.0"
-            }
-        },
-        "@discoveryjs/json-ext": {
-            "version": "0.5.2",
-            "resolved": "https://registry.npmjs.org/@discoveryjs/json-ext/-/json-ext-0.5.2.tgz",
-            "integrity": "sha512-HyYEUDeIj5rRQU2Hk5HTB2uHsbRQpF70nvMhVzi+VJR0X+xNEhjPui4/kBf3VeH/wqD28PT4sVOm8qqLjBrSZg==",
-            "dev": true
-        },
-        "@eslint/eslintrc": {
-            "version": "0.4.0",
-            "resolved": "https://registry.npmjs.org/@eslint/eslintrc/-/eslintrc-0.4.0.tgz",
-            "integrity": "sha512-2ZPCc+uNbjV5ERJr+aKSPRwZgKd2z11x0EgLvb1PURmUrn9QNRXFqje0Ldq454PfAVyaJYyrDvvIKSFP4NnBog==",
-            "dev": true,
-            "requires": {
-                "ajv": "^6.12.4",
-                "debug": "^4.1.1",
-                "espree": "^7.3.0",
-                "globals": "^12.1.0",
-                "ignore": "^4.0.6",
-                "import-fresh": "^3.2.1",
-                "js-yaml": "^3.13.1",
-                "minimatch": "^3.0.4",
-                "strip-json-comments": "^3.1.1"
-            },
-            "dependencies": {
-                "globals": {
-                    "version": "12.4.0",
-                    "resolved": "https://registry.npmjs.org/globals/-/globals-12.4.0.tgz",
-                    "integrity": "sha512-BWICuzzDvDoH54NHKCseDanAhE3CeDorgDL5MT6LMXXj2WCnd9UC2szdk4AWLfjdgNBCXLUanXYcpBBKOSWGwg==",
-                    "dev": true,
-                    "requires": {
-                        "type-fest": "^0.8.1"
-                    }
-                },
-                "ignore": {
-                    "version": "4.0.6",
-                    "resolved": "https://registry.npmjs.org/ignore/-/ignore-4.0.6.tgz",
-                    "integrity": "sha512-cyFDKrqc/YdcWFniJhzI42+AzS+gNwmUzOSFcRCQYwySuBBBy/KjuxWLZ/FHEH6Moq1NizMOBWyTcv8O4OZIMg==",
-                    "dev": true
-                }
-            }
-        },
-        "@nicolo-ribaudo/chokidar-2": {
-            "version": "2.1.8-no-fsevents",
-            "resolved": "https://registry.npmjs.org/@nicolo-ribaudo/chokidar-2/-/chokidar-2-2.1.8-no-fsevents.tgz",
-            "integrity": "sha512-+nb9vWloHNNMFHjGofEam3wopE3m1yuambrrd/fnPc+lFOMB9ROTqQlche9ByFWNkdNqfSgR/kkQtQ8DzEWt2w==",
-            "dev": true,
-            "optional": true,
-            "requires": {
-                "anymatch": "^2.0.0",
-                "async-each": "^1.0.1",
-                "braces": "^2.3.2",
-                "glob-parent": "^3.1.0",
-                "inherits": "^2.0.3",
-                "is-binary-path": "^1.0.0",
-                "is-glob": "^4.0.0",
-                "normalize-path": "^3.0.0",
-                "path-is-absolute": "^1.0.0",
-                "readdirp": "^2.2.1",
-                "upath": "^1.1.1"
-            },
-            "dependencies": {
-                "braces": {
-                    "version": "2.3.2",
-                    "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-                    "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "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"
-                    }
-                },
-                "extend-shallow": {
-                    "version": "2.0.1",
-                    "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                    "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "is-extendable": "^0.1.0"
-                    }
-                },
-                "fill-range": {
-                    "version": "4.0.0",
-                    "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-                    "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "extend-shallow": "^2.0.1",
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1",
-                        "to-regex-range": "^2.1.0"
-                    }
-                },
-                "glob-parent": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-3.1.0.tgz",
-                    "integrity": "sha1-nmr2KZ2NO9K9QEMIMr0RPfkGxa4=",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "is-glob": "^3.1.0",
-                        "path-dirname": "^1.0.0"
-                    },
-                    "dependencies": {
-                        "is-glob": {
-                            "version": "3.1.0",
-                            "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-3.1.0.tgz",
-                            "integrity": "sha1-e6WuJCF4BKxwcHuWkiVnSGzD6Eo=",
-                            "dev": true,
-                            "optional": true,
-                            "requires": {
-                                "is-extglob": "^2.1.0"
-                            }
-                        }
-                    }
-                },
-                "is-number": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-                    "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "kind-of": "^3.0.2"
-                    }
-                },
-                "kind-of": {
-                    "version": "3.2.2",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                    "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                },
-                "to-regex-range": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-                    "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1"
-                    }
-                }
-            }
-        },
-        "@nodelib/fs.scandir": {
-            "version": "2.1.4",
-            "resolved": "https://registry.npmjs.org/@nodelib/fs.scandir/-/fs.scandir-2.1.4.tgz",
-            "integrity": "sha512-33g3pMJk3bg5nXbL/+CY6I2eJDzZAni49PfJnL5fghPTggPvBd/pFNSgJsdAgWptuFu7qq/ERvOYFlhvsLTCKA==",
-            "dev": true,
-            "requires": {
-                "@nodelib/fs.stat": "2.0.4",
-                "run-parallel": "^1.1.9"
-            }
-        },
-        "@nodelib/fs.stat": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/@nodelib/fs.stat/-/fs.stat-2.0.4.tgz",
-            "integrity": "sha512-IYlHJA0clt2+Vg7bccq+TzRdJvv19c2INqBSsoOLp1je7xjtr7J26+WXR72MCdvU9q1qTzIWDfhMf+DRvQJK4Q==",
-            "dev": true
-        },
-        "@nodelib/fs.walk": {
-            "version": "1.2.6",
-            "resolved": "https://registry.npmjs.org/@nodelib/fs.walk/-/fs.walk-1.2.6.tgz",
-            "integrity": "sha512-8Broas6vTtW4GIXTAHDoE32hnN2M5ykgCpWGbuXHQ15vEMqr23pB76e/GZcYsZCHALv50ktd24qhEyKr6wBtow==",
-            "dev": true,
-            "requires": {
-                "@nodelib/fs.scandir": "2.1.4",
-                "fastq": "^1.6.0"
-            }
-        },
-        "@types/dagre": {
-            "version": "0.7.44",
-            "resolved": "https://registry.npmjs.org/@types/dagre/-/dagre-0.7.44.tgz",
-            "integrity": "sha512-N6HD+79w77ZVAaVO7JJDW5yJ9LAxM62FpgNGO9xEde+KVYjDRyhIMzfiErXpr1g0JPon9kwlBzoBK6s4fOww9Q==",
-            "dev": true
-        },
-        "@types/eslint": {
-            "version": "7.2.7",
-            "resolved": "https://registry.npmjs.org/@types/eslint/-/eslint-7.2.7.tgz",
-            "integrity": "sha512-EHXbc1z2GoQRqHaAT7+grxlTJ3WE2YNeD6jlpPoRc83cCoThRY+NUWjCUZaYmk51OICkPXn2hhphcWcWXgNW0Q==",
-            "dev": true,
-            "requires": {
-                "@types/estree": "*",
-                "@types/json-schema": "*"
-            }
-        },
-        "@types/eslint-scope": {
-            "version": "3.7.0",
-            "resolved": "https://registry.npmjs.org/@types/eslint-scope/-/eslint-scope-3.7.0.tgz",
-            "integrity": "sha512-O/ql2+rrCUe2W2rs7wMR+GqPRcgB6UiqN5RhrR5xruFlY7l9YLMn0ZkDzjoHLeiFkR8MCQZVudUuuvQ2BLC9Qw==",
-            "dev": true,
-            "requires": {
-                "@types/eslint": "*",
-                "@types/estree": "*"
-            }
-        },
-        "@types/estree": {
-            "version": "0.0.46",
-            "resolved": "https://registry.npmjs.org/@types/estree/-/estree-0.0.46.tgz",
-            "integrity": "sha512-laIjwTQaD+5DukBZaygQ79K1Z0jb1bPEMRrkXSLjtCcZm+abyp5YbrqpSLzD42FwWW6gK/aS4NYpJ804nG2brg==",
-            "dev": true
-        },
-        "@types/glob": {
-            "version": "7.1.3",
-            "resolved": "https://registry.npmjs.org/@types/glob/-/glob-7.1.3.tgz",
-            "integrity": "sha512-SEYeGAIQIQX8NN6LDKprLjbrd5dARM5EXsd8GI/A5l0apYI1fGMWgPHSe4ZKL4eozlAyI+doUE9XbYS4xCkQ1w==",
-            "dev": true,
-            "requires": {
-                "@types/minimatch": "*",
-                "@types/node": "*"
-            }
-        },
-        "@types/jquery": {
-            "version": "3.5.5",
-            "resolved": "https://registry.npmjs.org/@types/jquery/-/jquery-3.5.5.tgz",
-            "integrity": "sha512-6RXU9Xzpc6vxNrS6FPPapN1SxSHgQ336WC6Jj/N8q30OiaBZ00l1GBgeP7usjVZPivSkGUfL1z/WW6TX989M+w==",
-            "dev": true,
-            "requires": {
-                "@types/sizzle": "*"
-            }
-        },
-        "@types/json-schema": {
-            "version": "7.0.7",
-            "resolved": "https://registry.npmjs.org/@types/json-schema/-/json-schema-7.0.7.tgz",
-            "integrity": "sha512-cxWFQVseBm6O9Gbw1IWb8r6OS4OhSt3hPZLkFApLjM8TEXROBuQGLAH2i2gZpcXdLBIrpXuTDhH7Vbm1iXmNGA==",
-            "dev": true
-        },
-        "@types/mathjs": {
-            "version": "6.0.11",
-            "resolved": "https://registry.npmjs.org/@types/mathjs/-/mathjs-6.0.11.tgz",
-            "integrity": "sha512-q9B8ZreO41L38iTY76bCZEtAqzeRs4mNIOZpZ1sLSlcYgvgfFrnf8y8qfmas0tVWrsODjmQbQJFD6RJJJCqJbQ==",
-            "requires": {
-                "decimal.js": "^10.0.0"
-            }
-        },
-        "@types/minimatch": {
-            "version": "3.0.3",
-            "resolved": "https://registry.npmjs.org/@types/minimatch/-/minimatch-3.0.3.tgz",
-            "integrity": "sha512-tHq6qdbT9U1IRSGf14CL0pUlULksvY9OZ+5eEgl1N7t+OA3tGvNpxJCzuKQlsNgCVwbAs670L1vcVQi8j9HjnA==",
-            "dev": true
-        },
-        "@types/node": {
-            "version": "14.14.35",
-            "resolved": "https://registry.npmjs.org/@types/node/-/node-14.14.35.tgz",
-            "integrity": "sha512-Lt+wj8NVPx0zUmUwumiVXapmaLUcAk3yPuHCFVXras9k5VT9TdhJqKqGVUQCD60OTMCl0qxJ57OiTL0Mic3Iag==",
-            "dev": true
-        },
-        "@types/sizzle": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/@types/sizzle/-/sizzle-2.3.2.tgz",
-            "integrity": "sha512-7EJYyKTL7tFR8+gDbB6Wwz/arpGa0Mywk1TJbNzKzHtzbwVmY4HR9WqS5VV7dsBUKQmPNr192jHr/VpBluj/hg==",
-            "dev": true
-        },
-        "@typescript-eslint/eslint-plugin": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/eslint-plugin/-/eslint-plugin-4.18.0.tgz",
-            "integrity": "sha512-Lzkc/2+7EoH7+NjIWLS2lVuKKqbEmJhtXe3rmfA8cyiKnZm3IfLf51irnBcmow8Q/AptVV0XBZmBJKuUJTe6cQ==",
-            "dev": true,
-            "requires": {
-                "@typescript-eslint/experimental-utils": "4.18.0",
-                "@typescript-eslint/scope-manager": "4.18.0",
-                "debug": "^4.1.1",
-                "functional-red-black-tree": "^1.0.1",
-                "lodash": "^4.17.15",
-                "regexpp": "^3.0.0",
-                "semver": "^7.3.2",
-                "tsutils": "^3.17.1"
-            }
-        },
-        "@typescript-eslint/experimental-utils": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/experimental-utils/-/experimental-utils-4.18.0.tgz",
-            "integrity": "sha512-92h723Kblt9JcT2RRY3QS2xefFKar4ZQFVs3GityOKWQYgtajxt/tuXIzL7sVCUlM1hgreiV5gkGYyBpdOwO6A==",
-            "dev": true,
-            "requires": {
-                "@types/json-schema": "^7.0.3",
-                "@typescript-eslint/scope-manager": "4.18.0",
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/typescript-estree": "4.18.0",
-                "eslint-scope": "^5.0.0",
-                "eslint-utils": "^2.0.0"
-            }
-        },
-        "@typescript-eslint/parser": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/parser/-/parser-4.18.0.tgz",
-            "integrity": "sha512-W3z5S0ZbecwX3PhJEAnq4mnjK5JJXvXUDBYIYGoweCyWyuvAKfGHvzmpUzgB5L4cRBb+cTu9U/ro66dx7dIimA==",
-            "dev": true,
-            "requires": {
-                "@typescript-eslint/scope-manager": "4.18.0",
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/typescript-estree": "4.18.0",
-                "debug": "^4.1.1"
-            }
-        },
-        "@typescript-eslint/scope-manager": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/scope-manager/-/scope-manager-4.18.0.tgz",
-            "integrity": "sha512-olX4yN6rvHR2eyFOcb6E4vmhDPsfdMyfQ3qR+oQNkAv8emKKlfxTWUXU5Mqxs2Fwe3Pf1BoPvrwZtwngxDzYzQ==",
-            "dev": true,
-            "requires": {
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/visitor-keys": "4.18.0"
-            }
-        },
-        "@typescript-eslint/types": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/types/-/types-4.18.0.tgz",
-            "integrity": "sha512-/BRociARpj5E+9yQ7cwCF/SNOWwXJ3qhjurMuK2hIFUbr9vTuDeu476Zpu+ptxY2kSxUHDGLLKy+qGq2sOg37A==",
-            "dev": true
-        },
-        "@typescript-eslint/typescript-estree": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/typescript-estree/-/typescript-estree-4.18.0.tgz",
-            "integrity": "sha512-wt4xvF6vvJI7epz+rEqxmoNQ4ZADArGQO9gDU+cM0U5fdVv7N+IAuVoVAoZSOZxzGHBfvE3XQMLdy+scsqFfeg==",
-            "dev": true,
-            "requires": {
-                "@typescript-eslint/types": "4.18.0",
-                "@typescript-eslint/visitor-keys": "4.18.0",
-                "debug": "^4.1.1",
-                "globby": "^11.0.1",
-                "is-glob": "^4.0.1",
-                "semver": "^7.3.2",
-                "tsutils": "^3.17.1"
-            }
-        },
-        "@typescript-eslint/visitor-keys": {
-            "version": "4.18.0",
-            "resolved": "https://registry.npmjs.org/@typescript-eslint/visitor-keys/-/visitor-keys-4.18.0.tgz",
-            "integrity": "sha512-Q9t90JCvfYaN0OfFUgaLqByOfz8yPeTAdotn/XYNm5q9eHax90gzdb+RJ6E9T5s97Kv/UHWKERTmqA0jTKAEHw==",
-            "dev": true,
-            "requires": {
-                "@typescript-eslint/types": "4.18.0",
-                "eslint-visitor-keys": "^2.0.0"
-            }
-        },
-        "@webassemblyjs/ast": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.0.tgz",
-            "integrity": "sha512-kX2W49LWsbthrmIRMbQZuQDhGtjyqXfEmmHyEi4XWnSZtPmxY0+3anPIzsnRb45VH/J55zlOfWvZuY47aJZTJg==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/helper-numbers": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0"
-            }
-        },
-        "@webassemblyjs/floating-point-hex-parser": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/floating-point-hex-parser/-/floating-point-hex-parser-1.11.0.tgz",
-            "integrity": "sha512-Q/aVYs/VnPDVYvsCBL/gSgwmfjeCb4LW8+TMrO3cSzJImgv8lxxEPM2JA5jMrivE7LSz3V+PFqtMbls3m1exDA==",
-            "dev": true
-        },
-        "@webassemblyjs/helper-api-error": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-api-error/-/helper-api-error-1.11.0.tgz",
-            "integrity": "sha512-baT/va95eXiXb2QflSx95QGT5ClzWpGaa8L7JnJbgzoYeaA27FCvuBXU758l+KXWRndEmUXjP0Q5fibhavIn8w==",
-            "dev": true
-        },
-        "@webassemblyjs/helper-buffer": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.0.tgz",
-            "integrity": "sha512-u9HPBEl4DS+vA8qLQdEQ6N/eJQ7gT7aNvMIo8AAWvAl/xMrcOSiI2M0MAnMCy3jIFke7bEee/JwdX1nUpCtdyA==",
-            "dev": true
-        },
-        "@webassemblyjs/helper-numbers": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-numbers/-/helper-numbers-1.11.0.tgz",
-            "integrity": "sha512-DhRQKelIj01s5IgdsOJMKLppI+4zpmcMQ3XboFPLwCpSNH6Hqo1ritgHgD0nqHeSYqofA6aBN/NmXuGjM1jEfQ==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/floating-point-hex-parser": "1.11.0",
-                "@webassemblyjs/helper-api-error": "1.11.0",
-                "@xtuc/long": "4.2.2"
-            }
-        },
-        "@webassemblyjs/helper-wasm-bytecode": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-bytecode/-/helper-wasm-bytecode-1.11.0.tgz",
-            "integrity": "sha512-MbmhvxXExm542tWREgSFnOVo07fDpsBJg3sIl6fSp9xuu75eGz5lz31q7wTLffwL3Za7XNRCMZy210+tnsUSEA==",
-            "dev": true
-        },
-        "@webassemblyjs/helper-wasm-section": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.0.tgz",
-            "integrity": "sha512-3Eb88hcbfY/FCukrg6i3EH8H2UsD7x8Vy47iVJrP967A9JGqgBVL9aH71SETPx1JrGsOUVLo0c7vMCN22ytJew==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-buffer": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/wasm-gen": "1.11.0"
-            }
-        },
-        "@webassemblyjs/ieee754": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/ieee754/-/ieee754-1.11.0.tgz",
-            "integrity": "sha512-KXzOqpcYQwAfeQ6WbF6HXo+0udBNmw0iXDmEK5sFlmQdmND+tr773Ti8/5T/M6Tl/413ArSJErATd8In3B+WBA==",
-            "dev": true,
-            "requires": {
-                "@xtuc/ieee754": "^1.2.0"
-            }
-        },
-        "@webassemblyjs/leb128": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/leb128/-/leb128-1.11.0.tgz",
-            "integrity": "sha512-aqbsHa1mSQAbeeNcl38un6qVY++hh8OpCOzxhixSYgbRfNWcxJNJQwe2rezK9XEcssJbbWIkblaJRwGMS9zp+g==",
-            "dev": true,
-            "requires": {
-                "@xtuc/long": "4.2.2"
-            }
-        },
-        "@webassemblyjs/utf8": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/utf8/-/utf8-1.11.0.tgz",
-            "integrity": "sha512-A/lclGxH6SpSLSyFowMzO/+aDEPU4hvEiooCMXQPcQFPPJaYcPQNKGOCLUySJsYJ4trbpr+Fs08n4jelkVTGVw==",
-            "dev": true
-        },
-        "@webassemblyjs/wasm-edit": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.0.tgz",
-            "integrity": "sha512-JHQ0damXy0G6J9ucyKVXO2j08JVJ2ntkdJlq1UTiUrIgfGMmA7Ik5VdC/L8hBK46kVJgujkBIoMtT8yVr+yVOQ==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-buffer": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/helper-wasm-section": "1.11.0",
-                "@webassemblyjs/wasm-gen": "1.11.0",
-                "@webassemblyjs/wasm-opt": "1.11.0",
-                "@webassemblyjs/wasm-parser": "1.11.0",
-                "@webassemblyjs/wast-printer": "1.11.0"
-            }
-        },
-        "@webassemblyjs/wasm-gen": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.0.tgz",
-            "integrity": "sha512-BEUv1aj0WptCZ9kIS30th5ILASUnAPEvE3tVMTrItnZRT9tXCLW2LEXT8ezLw59rqPP9klh9LPmpU+WmRQmCPQ==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/ieee754": "1.11.0",
-                "@webassemblyjs/leb128": "1.11.0",
-                "@webassemblyjs/utf8": "1.11.0"
-            }
-        },
-        "@webassemblyjs/wasm-opt": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.0.tgz",
-            "integrity": "sha512-tHUSP5F4ywyh3hZ0+fDQuWxKx3mJiPeFufg+9gwTpYp324mPCQgnuVKwzLTZVqj0duRDovnPaZqDwoyhIO8kYg==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-buffer": "1.11.0",
-                "@webassemblyjs/wasm-gen": "1.11.0",
-                "@webassemblyjs/wasm-parser": "1.11.0"
-            }
-        },
-        "@webassemblyjs/wasm-parser": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.0.tgz",
-            "integrity": "sha512-6L285Sgu9gphrcpDXINvm0M9BskznnzJTE7gYkjDbxET28shDqp27wpruyx3C2S/dvEwiigBwLA1cz7lNUi0kw==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/helper-api-error": "1.11.0",
-                "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
-                "@webassemblyjs/ieee754": "1.11.0",
-                "@webassemblyjs/leb128": "1.11.0",
-                "@webassemblyjs/utf8": "1.11.0"
-            }
-        },
-        "@webassemblyjs/wast-printer": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.0.tgz",
-            "integrity": "sha512-Fg5OX46pRdTgB7rKIUojkh9vXaVN6sGYCnEiJN1GYkb0RPwShZXp6KTDqmoMdQPKhcroOXh3fEzmkWmCYaKYhQ==",
-            "dev": true,
-            "requires": {
-                "@webassemblyjs/ast": "1.11.0",
-                "@xtuc/long": "4.2.2"
-            }
-        },
-        "@webpack-cli/configtest": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/@webpack-cli/configtest/-/configtest-1.0.1.tgz",
-            "integrity": "sha512-B+4uBUYhpzDXmwuo3V9yBH6cISwxEI4J+NO5ggDaGEEHb0osY/R7MzeKc0bHURXQuZjMM4qD+bSJCKIuI3eNBQ==",
-            "dev": true
-        },
-        "@webpack-cli/info": {
-            "version": "1.2.2",
-            "resolved": "https://registry.npmjs.org/@webpack-cli/info/-/info-1.2.2.tgz",
-            "integrity": "sha512-5U9kUJHnwU+FhKH4PWGZuBC1hTEPYyxGSL5jjoBI96Gx8qcYJGOikpiIpFoTq8mmgX3im2zAo2wanv/alD74KQ==",
-            "dev": true,
-            "requires": {
-                "envinfo": "^7.7.3"
-            }
-        },
-        "@webpack-cli/serve": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/@webpack-cli/serve/-/serve-1.3.0.tgz",
-            "integrity": "sha512-k2p2VrONcYVX1wRRrf0f3X2VGltLWcv+JzXRBDmvCxGlCeESx4OXw91TsWeKOkp784uNoVQo313vxJFHXPPwfw==",
-            "dev": true
-        },
-        "@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
-        },
-        "@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
-        },
-        "accepts": {
-            "version": "1.3.7",
-            "resolved": "https://registry.npmjs.org/accepts/-/accepts-1.3.7.tgz",
-            "integrity": "sha512-Il80Qs2WjYlJIBNzNkK6KYqlVMTbZLXgHx2oT0pU/fjRHyEp+PEfEPY0R3WCwAGVOtauxh1hOxNgIf5bv7dQpA==",
-            "dev": true,
-            "requires": {
-                "mime-types": "~2.1.24",
-                "negotiator": "0.6.2"
-            }
-        },
-        "acorn": {
-            "version": "8.1.0",
-            "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.1.0.tgz",
-            "integrity": "sha512-LWCF/Wn0nfHOmJ9rzQApGnxnvgfROzGilS8936rqN/lfcYkY9MYZzdMqN+2NJ4SlTc+m5HiSa+kNfDtI64dwUA==",
-            "dev": true
-        },
-        "acorn-jsx": {
-            "version": "5.3.1",
-            "resolved": "https://registry.npmjs.org/acorn-jsx/-/acorn-jsx-5.3.1.tgz",
-            "integrity": "sha512-K0Ptm/47OKfQRpNQ2J/oIN/3QYiK6FwW+eJbILhsdxh2WTLdl+30o8aGdTbm5JbffpFFAg/g+zi1E+jvJha5ng==",
-            "dev": true
-        },
-        "ajv": {
-            "version": "6.12.6",
-            "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.12.6.tgz",
-            "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
-            "dev": true,
-            "requires": {
-                "fast-deep-equal": "^3.1.1",
-                "fast-json-stable-stringify": "^2.0.0",
-                "json-schema-traverse": "^0.4.1",
-                "uri-js": "^4.2.2"
-            }
-        },
-        "ajv-errors": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/ajv-errors/-/ajv-errors-1.0.1.tgz",
-            "integrity": "sha512-DCRfO/4nQ+89p/RK43i8Ezd41EqdGIU4ld7nGF8OQ14oc/we5rEntLCUa7+jrn3nn83BosfwZA0wb4pon2o8iQ==",
-            "dev": true
-        },
-        "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
-        },
-        "ansi-colors": {
-            "version": "4.1.1",
-            "resolved": "https://registry.npmjs.org/ansi-colors/-/ansi-colors-4.1.1.tgz",
-            "integrity": "sha512-JoX0apGbHaUJBNl6yF+p6JAFYZ666/hhCGKN5t9QFjbJQKUU/g8MNbFDbvfrgKXvI1QpZplPOnwIo99lX/AAmA==",
-            "dev": true
-        },
-        "ansi-html": {
-            "version": "0.0.7",
-            "resolved": "https://registry.npmjs.org/ansi-html/-/ansi-html-0.0.7.tgz",
-            "integrity": "sha1-gTWEAhliqenm/QOflA0S9WynhZ4=",
-            "dev": true
-        },
-        "ansi-regex": {
-            "version": "5.0.0",
-            "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-5.0.0.tgz",
-            "integrity": "sha512-bY6fj56OUQ0hU1KjFNDQuJFezqKdrAyFdIevADiqrWHwSlbmBNMHp5ak2f40Pm8JTFyM2mqxkG6ngkHO11f/lg==",
-            "dev": true
-        },
-        "ansi-styles": {
-            "version": "4.3.0",
-            "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-4.3.0.tgz",
-            "integrity": "sha512-zbB9rCJAT1rbjiVDb2hqKFHNYLxgtk8NURxZ3IZwD3F6NtxbXZQCnnSi1Lkx+IDohdPlFp222wVALIheZJQSEg==",
-            "dev": true,
-            "requires": {
-                "color-convert": "^2.0.1"
-            }
-        },
-        "anymatch": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-2.0.0.tgz",
-            "integrity": "sha512-5teOsQWABXHHBFP9y3skS5P3d/WfWXpv3FUpy+LorMrNYaT9pI4oLMQX7jzQ2KklNpGpWHzdCXTDT2Y3XGlZBw==",
-            "dev": true,
-            "requires": {
-                "micromatch": "^3.1.4",
-                "normalize-path": "^2.1.1"
-            },
-            "dependencies": {
-                "braces": {
-                    "version": "2.3.2",
-                    "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-                    "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-                    "dev": true,
-                    "requires": {
-                        "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"
-                    },
-                    "dependencies": {
-                        "extend-shallow": {
-                            "version": "2.0.1",
-                            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                            "dev": true,
-                            "requires": {
-                                "is-extendable": "^0.1.0"
-                            }
-                        }
-                    }
-                },
-                "fill-range": {
-                    "version": "4.0.0",
-                    "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-                    "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-                    "dev": true,
-                    "requires": {
-                        "extend-shallow": "^2.0.1",
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1",
-                        "to-regex-range": "^2.1.0"
-                    },
-                    "dependencies": {
-                        "extend-shallow": {
-                            "version": "2.0.1",
-                            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                            "dev": true,
-                            "requires": {
-                                "is-extendable": "^0.1.0"
-                            }
-                        }
-                    }
-                },
-                "is-number": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-                    "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^3.0.2"
-                    },
-                    "dependencies": {
-                        "kind-of": {
-                            "version": "3.2.2",
-                            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                            "dev": true,
-                            "requires": {
-                                "is-buffer": "^1.1.5"
-                            }
-                        }
-                    }
-                },
-                "micromatch": {
-                    "version": "3.1.10",
-                    "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
-                    "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
-                    "dev": true,
-                    "requires": {
-                        "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"
-                    }
-                },
-                "normalize-path": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-2.1.1.tgz",
-                    "integrity": "sha1-GrKLVW4Zg2Oowab35vogE3/mrtk=",
-                    "dev": true,
-                    "requires": {
-                        "remove-trailing-separator": "^1.0.1"
-                    }
-                },
-                "to-regex-range": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-                    "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-                    "dev": true,
-                    "requires": {
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1"
-                    }
-                }
-            }
-        },
-        "argparse": {
-            "version": "1.0.10",
-            "resolved": "https://registry.npmjs.org/argparse/-/argparse-1.0.10.tgz",
-            "integrity": "sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==",
-            "dev": true,
-            "requires": {
-                "sprintf-js": "~1.0.2"
-            }
-        },
-        "arr-diff": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/arr-diff/-/arr-diff-4.0.0.tgz",
-            "integrity": "sha1-1kYQdP6/7HHn4VI1dhoyml3HxSA=",
-            "dev": true
-        },
-        "arr-flatten": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/arr-flatten/-/arr-flatten-1.1.0.tgz",
-            "integrity": "sha512-L3hKV5R/p5o81R7O02IGnwpDmkp6E982XhtbuwSe3O4qOtMMMtodicASA1Cny2U+aCXcNpml+m4dPsvsJ3jatg==",
-            "dev": true
-        },
-        "arr-union": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/arr-union/-/arr-union-3.1.0.tgz",
-            "integrity": "sha1-45sJrqne+Gao8gbiiK9jkZuuOcQ=",
-            "dev": true
-        },
-        "array-flatten": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/array-flatten/-/array-flatten-2.1.2.tgz",
-            "integrity": "sha512-hNfzcOV8W4NdualtqBFPyVO+54DSJuZGY9qT4pRroB6S9e3iiido2ISIC5h9R2sPJ8H3FHCIiEnsv1lPXO3KtQ==",
-            "dev": true
-        },
-        "array-union": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/array-union/-/array-union-2.1.0.tgz",
-            "integrity": "sha512-HGyxoOTYUyCM6stUe6EJgnd4EoewAI7zMdfqO+kGjnlZmBDz/cR5pf8r/cR4Wq60sL/p0IkcjUEEPwS3GFrIyw==",
-            "dev": true
-        },
-        "array-uniq": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/array-uniq/-/array-uniq-1.0.3.tgz",
-            "integrity": "sha1-r2rId6Jcx/dOBYiUdThY39sk/bY=",
-            "dev": true
-        },
-        "array-unique": {
-            "version": "0.3.2",
-            "resolved": "https://registry.npmjs.org/array-unique/-/array-unique-0.3.2.tgz",
-            "integrity": "sha1-qJS3XUvE9s1nnvMkSp/Y9Gri1Cg=",
-            "dev": true
-        },
-        "assign-symbols": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/assign-symbols/-/assign-symbols-1.0.0.tgz",
-            "integrity": "sha1-WWZ/QfrdTyDMvCu5a41Pf3jsA2c=",
-            "dev": true
-        },
-        "astral-regex": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/astral-regex/-/astral-regex-2.0.0.tgz",
-            "integrity": "sha512-Z7tMw1ytTXt5jqMcOP+OQteU1VuNK9Y02uuJtKQ1Sv69jXQKKg5cibLwGJow8yzZP+eAc18EmLGPal0bp36rvQ==",
-            "dev": true
-        },
-        "async": {
-            "version": "2.6.3",
-            "resolved": "https://registry.npmjs.org/async/-/async-2.6.3.tgz",
-            "integrity": "sha512-zflvls11DCy+dQWzTW2dzuilv8Z5X/pjfmZOWba6TNIVDm+2UDaJmXSOXlasHKfNBs8oo3M0aT50fDEWfKZjXg==",
-            "dev": true,
-            "requires": {
-                "lodash": "^4.17.14"
-            }
-        },
-        "async-each": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/async-each/-/async-each-1.0.3.tgz",
-            "integrity": "sha512-z/WhQ5FPySLdvREByI2vZiTWwCnF0moMJ1hK9YQwDTHKh6I7/uSckMetoRGb5UBZPC1z0jlw+n/XCgjeH7y1AQ==",
-            "dev": true
-        },
-        "async-limiter": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/async-limiter/-/async-limiter-1.0.1.tgz",
-            "integrity": "sha512-csOlWGAcRFJaI6m+F2WKdnMKr4HhdhFVBk0H/QbJFMCr+uO2kwohwXQPxw/9OCxp05r5ghVBFSyioixx3gfkNQ==",
-            "dev": true
-        },
-        "atob": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/atob/-/atob-2.1.2.tgz",
-            "integrity": "sha512-Wm6ukoaOGJi/73p/cl2GvLjTI5JM1k/O14isD73YML8StrH/7/lRFgmg8nICZgD3bZZvjwCGxtMOD3wWNAu8cg==",
-            "dev": true
-        },
-        "babel-loader": {
-            "version": "8.2.2",
-            "resolved": "https://registry.npmjs.org/babel-loader/-/babel-loader-8.2.2.tgz",
-            "integrity": "sha512-JvTd0/D889PQBtUXJ2PXaKU/pjZDMtHA9V2ecm+eNRmmBCMR09a+fmpGTNwnJtFmFl5Ei7Vy47LjBb+L0wQ99g==",
-            "dev": true,
-            "requires": {
-                "find-cache-dir": "^3.3.1",
-                "loader-utils": "^1.4.0",
-                "make-dir": "^3.1.0",
-                "schema-utils": "^2.6.5"
-            },
-            "dependencies": {
-                "json5": {
-                    "version": "1.0.1",
-                    "resolved": "https://registry.npmjs.org/json5/-/json5-1.0.1.tgz",
-                    "integrity": "sha512-aKS4WQjPenRxiQsC93MNfjx+nbF4PAdYzmd/1JIj8HYzqfbu86beTuNgXDzPknWk0n0uARlyewZo4s++ES36Ow==",
-                    "dev": true,
-                    "requires": {
-                        "minimist": "^1.2.0"
-                    }
-                },
-                "loader-utils": {
-                    "version": "1.4.0",
-                    "resolved": "https://registry.npmjs.org/loader-utils/-/loader-utils-1.4.0.tgz",
-                    "integrity": "sha512-qH0WSMBtn/oHuwjy/NucEgbx5dbxxnxup9s4PVXJUDHZBQY+s0NWA9rJf53RBnQZxfch7euUui7hpoAPvALZdA==",
-                    "dev": true,
-                    "requires": {
-                        "big.js": "^5.2.2",
-                        "emojis-list": "^3.0.0",
-                        "json5": "^1.0.1"
-                    }
-                },
-                "make-dir": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-3.1.0.tgz",
-                    "integrity": "sha512-g3FeP20LNwhALb/6Cz6Dd4F2ngze0jz7tbzrD2wAV+o9FeNHe4rL+yK2md0J/fiSf1sa1ADhXqi5+oVwOM/eGw==",
-                    "dev": true,
-                    "requires": {
-                        "semver": "^6.0.0"
-                    }
-                },
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                }
-            }
-        },
-        "babel-plugin-dynamic-import-node": {
-            "version": "2.3.3",
-            "resolved": "https://registry.npmjs.org/babel-plugin-dynamic-import-node/-/babel-plugin-dynamic-import-node-2.3.3.tgz",
-            "integrity": "sha512-jZVI+s9Zg3IqA/kdi0i6UDCybUI3aSBLnglhYbSSjKlV7yF1F/5LWv8MakQmvYpnbJDS6fcBL2KzHSxNCMtWSQ==",
-            "dev": true,
-            "requires": {
-                "object.assign": "^4.1.0"
-            }
-        },
-        "babel-plugin-polyfill-corejs2": {
-            "version": "0.1.10",
-            "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.1.10.tgz",
-            "integrity": "sha512-DO95wD4g0A8KRaHKi0D51NdGXzvpqVLnLu5BTvDlpqUEpTmeEtypgC1xqesORaWmiUOQI14UHKlzNd9iZ2G3ZA==",
-            "dev": true,
-            "requires": {
-                "@babel/compat-data": "^7.13.0",
-                "@babel/helper-define-polyfill-provider": "^0.1.5",
-                "semver": "^6.1.1"
-            },
-            "dependencies": {
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                }
-            }
-        },
-        "babel-plugin-polyfill-corejs3": {
-            "version": "0.1.7",
-            "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.1.7.tgz",
-            "integrity": "sha512-u+gbS9bbPhZWEeyy1oR/YaaSpod/KDT07arZHb80aTpl8H5ZBq+uN1nN9/xtX7jQyfLdPfoqI4Rue/MQSWJquw==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-define-polyfill-provider": "^0.1.5",
-                "core-js-compat": "^3.8.1"
-            }
-        },
-        "babel-plugin-polyfill-regenerator": {
-            "version": "0.1.6",
-            "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.1.6.tgz",
-            "integrity": "sha512-OUrYG9iKPKz8NxswXbRAdSwF0GhRdIEMTloQATJi4bDuFqrXaXcCUT/VGNrr8pBcjMh1RxZ7Xt9cytVJTJfvMg==",
-            "dev": true,
-            "requires": {
-                "@babel/helper-define-polyfill-provider": "^0.1.5"
-            }
-        },
-        "balanced-match": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.0.tgz",
-            "integrity": "sha1-ibTRmasr7kneFk6gK4nORi1xt2c=",
-            "dev": true
-        },
-        "base": {
-            "version": "0.11.2",
-            "resolved": "https://registry.npmjs.org/base/-/base-0.11.2.tgz",
-            "integrity": "sha512-5T6P4xPgpp0YDFvSWwEZ4NoE3aM4QBQXDzmVbraCkFj8zHM+mba8SyqB5DbZWyR7mYHo6Y7BdQo3MoA4m0TeQg==",
-            "dev": true,
-            "requires": {
-                "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"
-            },
-            "dependencies": {
-                "define-property": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
-                    "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^1.0.0"
-                    }
-                },
-                "is-accessor-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-data-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-descriptor": {
-                    "version": "1.0.2",
-                    "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-                    "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-                    "dev": true,
-                    "requires": {
-                        "is-accessor-descriptor": "^1.0.0",
-                        "is-data-descriptor": "^1.0.0",
-                        "kind-of": "^6.0.2"
-                    }
-                }
-            }
-        },
-        "batch": {
-            "version": "0.6.1",
-            "resolved": "https://registry.npmjs.org/batch/-/batch-0.6.1.tgz",
-            "integrity": "sha1-3DQxT05nkxgJP8dgJyUl+UvyXBY=",
-            "dev": true
-        },
-        "big.js": {
-            "version": "5.2.2",
-            "resolved": "https://registry.npmjs.org/big.js/-/big.js-5.2.2.tgz",
-            "integrity": "sha512-vyL2OymJxmarO8gxMr0mhChsO9QGwhynfuu4+MHTAW6czfq9humCB7rKpUjDd9YUiDPU4mzpyupFSvOClAwbmQ==",
-            "dev": true
-        },
-        "binary-extensions": {
-            "version": "1.13.1",
-            "resolved": "https://registry.npmjs.org/binary-extensions/-/binary-extensions-1.13.1.tgz",
-            "integrity": "sha512-Un7MIEDdUC5gNpcGDV97op1Ywk748MpHcFTHoYs6qnj1Z3j7I53VG3nwZhKzoBZmbdRNnb6WRdFlwl7tSDuZGw==",
-            "dev": true
-        },
-        "bindings": {
-            "version": "1.5.0",
-            "resolved": "https://registry.npmjs.org/bindings/-/bindings-1.5.0.tgz",
-            "integrity": "sha512-p2q/t/mhvuOj/UeLlV6566GD/guowlr0hHxClI0W9m7MWYkL1F0hLo+0Aexs9HSPCtR1SXQ0TD3MMKrXZajbiQ==",
-            "dev": true,
-            "optional": true,
-            "requires": {
-                "file-uri-to-path": "1.0.0"
-            }
-        },
-        "body-parser": {
-            "version": "1.19.0",
-            "resolved": "https://registry.npmjs.org/body-parser/-/body-parser-1.19.0.tgz",
-            "integrity": "sha512-dhEPs72UPbDnAQJ9ZKMNTP6ptJaionhP5cBb541nXPlW60Jepo9RV/a4fX4XWW9CuFNK22krhrj1+rgzifNCsw==",
-            "dev": true,
-            "requires": {
-                "bytes": "3.1.0",
-                "content-type": "~1.0.4",
-                "debug": "2.6.9",
-                "depd": "~1.1.2",
-                "http-errors": "1.7.2",
-                "iconv-lite": "0.4.24",
-                "on-finished": "~2.3.0",
-                "qs": "6.7.0",
-                "raw-body": "2.4.0",
-                "type-is": "~1.6.17"
-            },
-            "dependencies": {
-                "bytes": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.0.tgz",
-                    "integrity": "sha512-zauLjrfCG+xvoyaqLoV8bLVXXNGC4JqlxFCutSDWA6fJrTo2ZuvLYTqZ7aHBLZSMOopbzwv8f+wZcVzfVTI2Dg==",
-                    "dev": true
-                },
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    }
-                },
-                "ms": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                    "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                    "dev": true
-                }
-            }
-        },
-        "bonjour": {
-            "version": "3.5.0",
-            "resolved": "https://registry.npmjs.org/bonjour/-/bonjour-3.5.0.tgz",
-            "integrity": "sha1-jokKGD2O6aI5OzhExpGkK897yfU=",
-            "dev": true,
-            "requires": {
-                "array-flatten": "^2.1.0",
-                "deep-equal": "^1.0.1",
-                "dns-equal": "^1.0.0",
-                "dns-txt": "^2.0.2",
-                "multicast-dns": "^6.0.1",
-                "multicast-dns-service-types": "^1.1.0"
-            }
-        },
-        "brace-expansion": {
-            "version": "1.1.11",
-            "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.11.tgz",
-            "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==",
-            "dev": true,
-            "requires": {
-                "balanced-match": "^1.0.0",
-                "concat-map": "0.0.1"
-            }
-        },
-        "braces": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.2.tgz",
-            "integrity": "sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==",
-            "dev": true,
-            "requires": {
-                "fill-range": "^7.0.1"
-            }
-        },
-        "browserslist": {
-            "version": "4.16.6",
-            "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.16.6.tgz",
-            "integrity": "sha512-Wspk/PqO+4W9qp5iUTJsa1B/QrYn1keNCcEP5OvP7WBwT4KaDly0uONYmC6Xa3Z5IqnUgS0KcgLYu1l74x0ZXQ==",
-            "dev": true,
-            "requires": {
-                "caniuse-lite": "^1.0.30001219",
-                "colorette": "^1.2.2",
-                "electron-to-chromium": "^1.3.723",
-                "escalade": "^3.1.1",
-                "node-releases": "^1.1.71"
-            },
-            "dependencies": {
-                "colorette": {
-                    "version": "1.2.2",
-                    "resolved": "https://registry.npmjs.org/colorette/-/colorette-1.2.2.tgz",
-                    "integrity": "sha512-MKGMzyfeuutC/ZJ1cba9NqcNpfeqMUcYmyF1ZFY6/Cn7CNSAKx6a+s48sqLqyAiZuaP2TcqMhoo+dlwFnVxT9w==",
-                    "dev": true
-                }
-            }
-        },
-        "buffer-from": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/buffer-from/-/buffer-from-1.1.1.tgz",
-            "integrity": "sha512-MQcXEUbCKtEo7bhqEs6560Hyd4XaovZlO/k9V3hjVUF/zwW7KBVdSK4gIt/bzwS9MbR5qob+F5jusZsb0YQK2A==",
-            "dev": true
-        },
-        "buffer-indexof": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/buffer-indexof/-/buffer-indexof-1.1.1.tgz",
-            "integrity": "sha512-4/rOEg86jivtPTeOUUT61jJO1Ya1TrR/OkqCSZDyq84WJh3LuuiphBYJN+fm5xufIk4XAFcEwte/8WzC8If/1g==",
-            "dev": true
-        },
-        "bytes": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.0.0.tgz",
-            "integrity": "sha1-0ygVQE1olpn4Wk6k+odV3ROpYEg=",
-            "dev": true
-        },
-        "cache-base": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/cache-base/-/cache-base-1.0.1.tgz",
-            "integrity": "sha512-AKcdTnFSWATd5/GCPRxr2ChwIJ85CeyrEyjRHlKxQ56d4XJMGym0uAiKn0xbLOGOl3+yRpOTi484dVCEc5AUzQ==",
-            "dev": true,
-            "requires": {
-                "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"
-            }
-        },
-        "call-bind": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/call-bind/-/call-bind-1.0.2.tgz",
-            "integrity": "sha512-7O+FbCihrB5WGbFYesctwmTKae6rOiIzmz1icreWJ+0aA7LJfuqhEso2T9ncpcFtzMQtzXf2QGGueWJGTYsqrA==",
-            "dev": true,
-            "requires": {
-                "function-bind": "^1.1.1",
-                "get-intrinsic": "^1.0.2"
-            }
-        },
-        "callsites": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/callsites/-/callsites-3.1.0.tgz",
-            "integrity": "sha512-P8BjAsXvZS+VIDUI11hHCQEv74YT67YUi5JJFNWIqL235sBmjX4+qx9Muvls5ivyNENctx46xQLQ3aTuE7ssaQ==",
-            "dev": true
-        },
-        "camelcase": {
-            "version": "5.3.1",
-            "resolved": "https://registry.npmjs.org/camelcase/-/camelcase-5.3.1.tgz",
-            "integrity": "sha512-L28STB170nwWS63UjtlEOE3dldQApaJXZkOI1uMFfzf3rRuPegHaHesyee+YxQ+W6SvRDQV6UrdOdRiR153wJg==",
-            "dev": true
-        },
-        "caniuse-lite": {
-            "version": "1.0.30001236",
-            "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001236.tgz",
-            "integrity": "sha512-o0PRQSrSCGJKCPZcgMzl5fUaj5xHe8qA2m4QRvnyY4e1lITqoNkr7q/Oh1NcpGSy0Th97UZ35yoKcINPoq7YOQ==",
-            "dev": true
-        },
-        "chalk": {
-            "version": "4.1.0",
-            "resolved": "https://registry.npmjs.org/chalk/-/chalk-4.1.0.tgz",
-            "integrity": "sha512-qwx12AxXe2Q5xQ43Ac//I6v5aXTipYrSESdOgzrN+9XjgEpyjpKuvSGaN4qE93f7TQTlerQQ8S+EQ0EyDoVL1A==",
-            "dev": true,
-            "requires": {
-                "ansi-styles": "^4.1.0",
-                "supports-color": "^7.1.0"
-            }
-        },
-        "chokidar": {
-            "version": "3.5.1",
-            "resolved": "https://registry.npmjs.org/chokidar/-/chokidar-3.5.1.tgz",
-            "integrity": "sha512-9+s+Od+W0VJJzawDma/gvBNQqkTiqYTWLuZoyAsivsI4AaWTCzHG06/TMjsf1cYe9Cb97UCEhjz7HvnPk2p/tw==",
-            "dev": true,
-            "optional": true,
-            "requires": {
-                "anymatch": "~3.1.1",
-                "braces": "~3.0.2",
-                "fsevents": "~2.3.1",
-                "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"
-            },
-            "dependencies": {
-                "anymatch": {
-                    "version": "3.1.1",
-                    "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-3.1.1.tgz",
-                    "integrity": "sha512-mM8522psRCqzV+6LhomX5wgp25YVibjh8Wj23I5RPkPppSVSjyKD2A2mBJmWGa+KN7f2D6LNh9jkBCeyLktzjg==",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "normalize-path": "^3.0.0",
-                        "picomatch": "^2.0.4"
-                    }
-                },
-                "binary-extensions": {
-                    "version": "2.2.0",
-                    "resolved": "https://registry.npmjs.org/binary-extensions/-/binary-extensions-2.2.0.tgz",
-                    "integrity": "sha512-jDctJ/IVQbZoJykoeHbhXpOlNBqGNcwXJKJog42E5HDPUwQTSdjCHdihjj0DlnheQ7blbT6dHOafNAiS8ooQKA==",
-                    "dev": true,
-                    "optional": true
-                },
-                "is-binary-path": {
-                    "version": "2.1.0",
-                    "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-2.1.0.tgz",
-                    "integrity": "sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "binary-extensions": "^2.0.0"
-                    }
-                },
-                "readdirp": {
-                    "version": "3.5.0",
-                    "resolved": "https://registry.npmjs.org/readdirp/-/readdirp-3.5.0.tgz",
-                    "integrity": "sha512-cMhu7c/8rdhkHXWsY+osBhfSy0JikwpHK/5+imo+LpeasTF8ouErHrlYkwT0++njiyuDvc7OFY5T3ukvZ8qmFQ==",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "picomatch": "^2.2.1"
-                    }
-                }
-            }
-        },
-        "chrome-trace-event": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/chrome-trace-event/-/chrome-trace-event-1.0.2.tgz",
-            "integrity": "sha512-9e/zx1jw7B4CO+c/RXoCsfg/x1AfUBioy4owYH0bJprEYAx5hRFLRhWBqHAG57D0ZM4H7vxbP7bPe0VwhQRYDQ==",
-            "dev": true,
-            "requires": {
-                "tslib": "^1.9.0"
-            }
-        },
-        "class-utils": {
-            "version": "0.3.6",
-            "resolved": "https://registry.npmjs.org/class-utils/-/class-utils-0.3.6.tgz",
-            "integrity": "sha512-qOhPa/Fj7s6TY8H8esGu5QNpMMQxz79h+urzrNYN6mn+9BnxlDGf5QZ+XeCDsxSjPqsSR56XOZOJmpeurnLMeg==",
-            "dev": true,
-            "requires": {
-                "arr-union": "^3.1.0",
-                "define-property": "^0.2.5",
-                "isobject": "^3.0.0",
-                "static-extend": "^0.1.1"
-            },
-            "dependencies": {
-                "define-property": {
-                    "version": "0.2.5",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-                    "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^0.1.0"
-                    }
-                }
-            }
-        },
-        "cliui": {
-            "version": "5.0.0",
-            "resolved": "https://registry.npmjs.org/cliui/-/cliui-5.0.0.tgz",
-            "integrity": "sha512-PYeGSEmmHM6zvoef2w8TPzlrnNpXIjTipYK780YswmIP9vjxmd6Y2a3CB2Ks6/AU8NHjZugXvo8w3oWM2qnwXA==",
-            "dev": true,
-            "requires": {
-                "string-width": "^3.1.0",
-                "strip-ansi": "^5.2.0",
-                "wrap-ansi": "^5.1.0"
-            },
-            "dependencies": {
-                "ansi-regex": {
-                    "version": "4.1.0",
-                    "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
-                    "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
-                    "dev": true
-                },
-                "emoji-regex": {
-                    "version": "7.0.3",
-                    "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
-                    "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
-                    "dev": true
-                },
-                "is-fullwidth-code-point": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
-                    "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
-                    "dev": true
-                },
-                "string-width": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
-                    "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
-                    "dev": true,
-                    "requires": {
-                        "emoji-regex": "^7.0.1",
-                        "is-fullwidth-code-point": "^2.0.0",
-                        "strip-ansi": "^5.1.0"
-                    }
-                },
-                "strip-ansi": {
-                    "version": "5.2.0",
-                    "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
-                    "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
-                    "dev": true,
-                    "requires": {
-                        "ansi-regex": "^4.1.0"
-                    }
-                }
-            }
-        },
-        "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,
-            "requires": {
-                "is-plain-object": "^2.0.4",
-                "kind-of": "^6.0.2",
-                "shallow-clone": "^3.0.0"
-            }
-        },
-        "collection-visit": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/collection-visit/-/collection-visit-1.0.0.tgz",
-            "integrity": "sha1-S8A3PBZLwykbTTaMgpzxqApZ3KA=",
-            "dev": true,
-            "requires": {
-                "map-visit": "^1.0.0",
-                "object-visit": "^1.0.0"
-            }
-        },
-        "color-convert": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-2.0.1.tgz",
-            "integrity": "sha512-RRECPsj7iu/xb5oKYcsFHSppFNnsj/52OVTRKb4zP5onXwVF3zVmmToNcOfGC+CRDpfK/U584fMg38ZHCaElKQ==",
-            "dev": true,
-            "requires": {
-                "color-name": "~1.1.4"
-            }
-        },
-        "color-name": {
-            "version": "1.1.4",
-            "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.4.tgz",
-            "integrity": "sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA==",
-            "dev": true
-        },
-        "colorette": {
-            "version": "1.2.1",
-            "resolved": "https://registry.npmjs.org/colorette/-/colorette-1.2.1.tgz",
-            "integrity": "sha512-puCDz0CzydiSYOrnXpz/PKd69zRrribezjtE9yd4zvytoRc8+RY/KJPvtPFKZS3E3wP6neGyMe0vOTlHO5L3Pw==",
-            "dev": true
-        },
-        "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
-        },
-        "commondir": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/commondir/-/commondir-1.0.1.tgz",
-            "integrity": "sha1-3dgA2gxmEnOTzKWVDqloo6rxJTs=",
-            "dev": true
-        },
-        "complex.js": {
-            "version": "2.0.12",
-            "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.0.12.tgz",
-            "integrity": "sha512-oQX99fwL6LrTVg82gDY1dIWXy6qZRnRL35N+YhIX0N7tSwsa0KFy6IEMHTNuCW4mP7FS7MEqZ/2I/afzYwPldw=="
-        },
-        "component-emitter": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/component-emitter/-/component-emitter-1.3.0.tgz",
-            "integrity": "sha512-Rd3se6QB+sO1TwqZjscQrurpEPIfO0/yYnSin6Q/rD3mOutHvUrCAhJub3r90uNb+SESBuE0QYoB90YdfatsRg==",
-            "dev": true
-        },
-        "compressible": {
-            "version": "2.0.18",
-            "resolved": "https://registry.npmjs.org/compressible/-/compressible-2.0.18.tgz",
-            "integrity": "sha512-AF3r7P5dWxL8MxyITRMlORQNaOA2IkAFaTr4k7BUumjPtRpGDTZpl0Pb1XCO6JeDCBdp126Cgs9sMxqSjgYyRg==",
-            "dev": true,
-            "requires": {
-                "mime-db": ">= 1.43.0 < 2"
-            }
-        },
-        "compression": {
-            "version": "1.7.4",
-            "resolved": "https://registry.npmjs.org/compression/-/compression-1.7.4.tgz",
-            "integrity": "sha512-jaSIDzP9pZVS4ZfQ+TzvtiWhdpFhE2RDHz8QJkpX9SIpLq88VueF5jJw6t+6CUQcAoA6t+x89MLrWAqpfDE8iQ==",
-            "dev": true,
-            "requires": {
-                "accepts": "~1.3.5",
-                "bytes": "3.0.0",
-                "compressible": "~2.0.16",
-                "debug": "2.6.9",
-                "on-headers": "~1.0.2",
-                "safe-buffer": "5.1.2",
-                "vary": "~1.1.2"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    }
-                },
-                "ms": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                    "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                    "dev": true
-                },
-                "safe-buffer": {
-                    "version": "5.1.2",
-                    "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-                    "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-                    "dev": true
-                }
-            }
-        },
-        "concat-map": {
-            "version": "0.0.1",
-            "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz",
-            "integrity": "sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=",
-            "dev": true
-        },
-        "connect-history-api-fallback": {
-            "version": "1.6.0",
-            "resolved": "https://registry.npmjs.org/connect-history-api-fallback/-/connect-history-api-fallback-1.6.0.tgz",
-            "integrity": "sha512-e54B99q/OUoH64zYYRf3HBP5z24G38h5D3qXu23JGRoigpX5Ss4r9ZnDk3g0Z8uQC2x2lPaJ+UlWBc1ZWBWdLg==",
-            "dev": true
-        },
-        "content-disposition": {
-            "version": "0.5.3",
-            "resolved": "https://registry.npmjs.org/content-disposition/-/content-disposition-0.5.3.tgz",
-            "integrity": "sha512-ExO0774ikEObIAEV9kDo50o+79VCUdEB6n6lzKgGwupcVeRlhrj3qGAfwq8G6uBJjkqLrhT0qEYFcWng8z1z0g==",
-            "dev": true,
-            "requires": {
-                "safe-buffer": "5.1.2"
-            },
-            "dependencies": {
-                "safe-buffer": {
-                    "version": "5.1.2",
-                    "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-                    "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-                    "dev": true
-                }
-            }
-        },
-        "content-type": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/content-type/-/content-type-1.0.4.tgz",
-            "integrity": "sha512-hIP3EEPs8tB9AT1L+NUqtwOAps4mk2Zob89MWXMHjHWg9milF/j4osnnQLXBCBFBk/tvIG/tUc9mOUJiPBhPXA==",
-            "dev": true
-        },
-        "convert-source-map": {
-            "version": "1.7.0",
-            "resolved": "https://registry.npmjs.org/convert-source-map/-/convert-source-map-1.7.0.tgz",
-            "integrity": "sha512-4FJkXzKXEDB1snCFZlLP4gpC3JILicCpGbzG9f9G7tGqGCzETQ2hWPrcinA9oU4wtf2biUaEH5065UnMeR33oA==",
-            "dev": true,
-            "requires": {
-                "safe-buffer": "~5.1.1"
-            },
-            "dependencies": {
-                "safe-buffer": {
-                    "version": "5.1.2",
-                    "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-                    "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-                    "dev": true
-                }
-            }
-        },
-        "cookie": {
-            "version": "0.4.0",
-            "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.4.0.tgz",
-            "integrity": "sha512-+Hp8fLp57wnUSt0tY0tHEXh4voZRDnoIrZPqlo3DPiI4y9lwg/jqx+1Om94/W6ZaPDOUbnjOt/99w66zk+l1Xg==",
-            "dev": true
-        },
-        "cookie-signature": {
-            "version": "1.0.6",
-            "resolved": "https://registry.npmjs.org/cookie-signature/-/cookie-signature-1.0.6.tgz",
-            "integrity": "sha1-4wOogrNCzD7oylE6eZmXNNqzriw=",
-            "dev": true
-        },
-        "copy-descriptor": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/copy-descriptor/-/copy-descriptor-0.1.1.tgz",
-            "integrity": "sha1-Z29us8OZl8LuGsOpJP1hJHSPV40=",
-            "dev": true
-        },
-        "core-js-compat": {
-            "version": "3.9.1",
-            "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.9.1.tgz",
-            "integrity": "sha512-jXAirMQxrkbiiLsCx9bQPJFA6llDadKMpYrBJQJ3/c4/vsPP/fAf29h24tviRlvwUL6AmY5CHLu2GvjuYviQqA==",
-            "dev": true,
-            "requires": {
-                "browserslist": "^4.16.3",
-                "semver": "7.0.0"
-            },
-            "dependencies": {
-                "semver": {
-                    "version": "7.0.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-7.0.0.tgz",
-                    "integrity": "sha512-+GB6zVA9LWh6zovYQLALHwv5rb2PHGlJi3lfiqIHxR0uuwCgefcOJc59v9fv1w8GbStwxuuqqAjI9NMAOOgq1A==",
-                    "dev": true
-                }
-            }
-        },
-        "core-util-is": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/core-util-is/-/core-util-is-1.0.2.tgz",
-            "integrity": "sha1-tf1UIgqivFq1eqtxQMlAdUUDwac=",
-            "dev": true
-        },
-        "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,
-            "requires": {
-                "path-key": "^3.1.0",
-                "shebang-command": "^2.0.0",
-                "which": "^2.0.1"
-            }
-        },
-        "dagre": {
-            "version": "0.8.5",
-            "resolved": "https://registry.npmjs.org/dagre/-/dagre-0.8.5.tgz",
-            "integrity": "sha512-/aTqmnRta7x7MCCpExk7HQL2O4owCT2h8NT//9I1OQ9vt29Pa0BzSAkR5lwFUcQ7491yVi/3CXU9jQ5o0Mn2Sw==",
-            "requires": {
-                "graphlib": "^2.1.8",
-                "lodash": "^4.17.15"
-            }
-        },
-        "debug": {
-            "version": "4.3.1",
-            "resolved": "https://registry.npmjs.org/debug/-/debug-4.3.1.tgz",
-            "integrity": "sha512-doEwdvm4PCeK4K3RQN2ZC2BYUBaxwLARCqZmMjtF8a51J2Rb0xpVloFRnCODwqjpwnAoao4pelN8l3RJdv3gRQ==",
-            "dev": true,
-            "requires": {
-                "ms": "2.1.2"
-            }
-        },
-        "decamelize": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/decamelize/-/decamelize-1.2.0.tgz",
-            "integrity": "sha1-9lNNFRSCabIDUue+4m9QH5oZEpA=",
-            "dev": true
-        },
-        "decimal.js": {
-            "version": "10.2.1",
-            "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.2.1.tgz",
-            "integrity": "sha512-KaL7+6Fw6i5A2XSnsbhm/6B+NuEA7TZ4vqxnd5tXz9sbKtrN9Srj8ab4vKVdK8YAqZO9P1kg45Y6YLoduPf+kw=="
-        },
-        "decode-uri-component": {
-            "version": "0.2.0",
-            "resolved": "https://registry.npmjs.org/decode-uri-component/-/decode-uri-component-0.2.0.tgz",
-            "integrity": "sha1-6zkTMzRYd1y4TNGh+uBiEGu4dUU=",
-            "dev": true
-        },
-        "deep-equal": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/deep-equal/-/deep-equal-1.1.1.tgz",
-            "integrity": "sha512-yd9c5AdiqVcR+JjcwUQb9DkhJc8ngNr0MahEBGvDiJw8puWab2yZlh+nkasOnZP+EGTAP6rRp2JzJhJZzvNF8g==",
-            "dev": true,
-            "requires": {
-                "is-arguments": "^1.0.4",
-                "is-date-object": "^1.0.1",
-                "is-regex": "^1.0.4",
-                "object-is": "^1.0.1",
-                "object-keys": "^1.1.1",
-                "regexp.prototype.flags": "^1.2.0"
-            }
-        },
-        "deep-is": {
-            "version": "0.1.3",
-            "resolved": "https://registry.npmjs.org/deep-is/-/deep-is-0.1.3.tgz",
-            "integrity": "sha1-s2nW+128E+7PUk+RsHD+7cNXzzQ=",
-            "dev": true
-        },
-        "default-gateway": {
-            "version": "4.2.0",
-            "resolved": "https://registry.npmjs.org/default-gateway/-/default-gateway-4.2.0.tgz",
-            "integrity": "sha512-h6sMrVB1VMWVrW13mSc6ia/DwYYw5MN6+exNu1OaJeFac5aSAvwM7lZ0NVfTABuSkQelr4h5oebg3KB1XPdjgA==",
-            "dev": true,
-            "requires": {
-                "execa": "^1.0.0",
-                "ip-regex": "^2.1.0"
-            },
-            "dependencies": {
-                "cross-spawn": {
-                    "version": "6.0.5",
-                    "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-6.0.5.tgz",
-                    "integrity": "sha512-eTVLrBSt7fjbDygz805pMnstIs2VTBNkRm0qxZd+M7A5XDdxVRWO5MxGBXZhjY4cqLYLdtrGqRf8mBPmzwSpWQ==",
-                    "dev": true,
-                    "requires": {
-                        "nice-try": "^1.0.4",
-                        "path-key": "^2.0.1",
-                        "semver": "^5.5.0",
-                        "shebang-command": "^1.2.0",
-                        "which": "^1.2.9"
-                    }
-                },
-                "execa": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/execa/-/execa-1.0.0.tgz",
-                    "integrity": "sha512-adbxcyWV46qiHyvSp50TKt05tB4tK3HcmF7/nxfAdhnox83seTDbwnaqKO4sXRy7roHAIFqJP/Rw/AuEbX61LA==",
-                    "dev": true,
-                    "requires": {
-                        "cross-spawn": "^6.0.0",
-                        "get-stream": "^4.0.0",
-                        "is-stream": "^1.1.0",
-                        "npm-run-path": "^2.0.0",
-                        "p-finally": "^1.0.0",
-                        "signal-exit": "^3.0.0",
-                        "strip-eof": "^1.0.0"
-                    }
-                },
-                "get-stream": {
-                    "version": "4.1.0",
-                    "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-4.1.0.tgz",
-                    "integrity": "sha512-GMat4EJ5161kIy2HevLlr4luNjBgvmj413KaQA7jt4V8B4RDsfpHk7WQ9GVqfYyyx8OS/L66Kox+rJRNklLK7w==",
-                    "dev": true,
-                    "requires": {
-                        "pump": "^3.0.0"
-                    }
-                },
-                "is-stream": {
-                    "version": "1.1.0",
-                    "resolved": "https://registry.npmjs.org/is-stream/-/is-stream-1.1.0.tgz",
-                    "integrity": "sha1-EtSj3U5o4Lec6428hBc66A2RykQ=",
-                    "dev": true
-                },
-                "npm-run-path": {
-                    "version": "2.0.2",
-                    "resolved": "https://registry.npmjs.org/npm-run-path/-/npm-run-path-2.0.2.tgz",
-                    "integrity": "sha1-NakjLfo11wZ7TLLd8jV7GHFTbF8=",
-                    "dev": true,
-                    "requires": {
-                        "path-key": "^2.0.0"
-                    }
-                },
-                "path-key": {
-                    "version": "2.0.1",
-                    "resolved": "https://registry.npmjs.org/path-key/-/path-key-2.0.1.tgz",
-                    "integrity": "sha1-QRyttXTFoUDTpLGRDUDYDMn0C0A=",
-                    "dev": true
-                },
-                "semver": {
-                    "version": "5.7.1",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-5.7.1.tgz",
-                    "integrity": "sha512-sauaDf/PZdVgrLTNYHRtpXa1iRiKcaebiKQ1BJdpQlWH2lCvexQdX55snPFyK7QzpudqbCI0qXFfOasHdyNDGQ==",
-                    "dev": true
-                },
-                "shebang-command": {
-                    "version": "1.2.0",
-                    "resolved": "https://registry.npmjs.org/shebang-command/-/shebang-command-1.2.0.tgz",
-                    "integrity": "sha1-RKrGW2lbAzmJaMOfNj/uXer98eo=",
-                    "dev": true,
-                    "requires": {
-                        "shebang-regex": "^1.0.0"
-                    }
-                },
-                "shebang-regex": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/shebang-regex/-/shebang-regex-1.0.0.tgz",
-                    "integrity": "sha1-2kL0l0DAtC2yypcoVxyxkMmO/qM=",
-                    "dev": true
-                },
-                "which": {
-                    "version": "1.3.1",
-                    "resolved": "https://registry.npmjs.org/which/-/which-1.3.1.tgz",
-                    "integrity": "sha512-HxJdYWq1MTIQbJ3nw0cqssHoTNU267KlrDuGZ1WYlxDStUtKUhOaJmh112/TZmHxxUfuJqPXSOm7tDyas0OSIQ==",
-                    "dev": true,
-                    "requires": {
-                        "isexe": "^2.0.0"
-                    }
-                }
-            }
-        },
-        "define-properties": {
-            "version": "1.1.3",
-            "resolved": "https://registry.npmjs.org/define-properties/-/define-properties-1.1.3.tgz",
-            "integrity": "sha512-3MqfYKj2lLzdMSf8ZIZE/V+Zuy+BgD6f164e8K2w7dgnpKArBDerGYpM46IYYcjnkdPNMjPk9A6VFB8+3SKlXQ==",
-            "dev": true,
-            "requires": {
-                "object-keys": "^1.0.12"
-            }
-        },
-        "define-property": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/define-property/-/define-property-2.0.2.tgz",
-            "integrity": "sha512-jwK2UV4cnPpbcG7+VRARKTZPUWowwXA8bzH5NP6ud0oeAxyYPuGZUAC7hMugpCdz4BeSZl2Dl9k66CHJ/46ZYQ==",
-            "dev": true,
-            "requires": {
-                "is-descriptor": "^1.0.2",
-                "isobject": "^3.0.1"
-            },
-            "dependencies": {
-                "is-accessor-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-data-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-descriptor": {
-                    "version": "1.0.2",
-                    "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-                    "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-                    "dev": true,
-                    "requires": {
-                        "is-accessor-descriptor": "^1.0.0",
-                        "is-data-descriptor": "^1.0.0",
-                        "kind-of": "^6.0.2"
-                    }
-                }
-            }
-        },
-        "del": {
-            "version": "4.1.1",
-            "resolved": "https://registry.npmjs.org/del/-/del-4.1.1.tgz",
-            "integrity": "sha512-QwGuEUouP2kVwQenAsOof5Fv8K9t3D8Ca8NxcXKrIpEHjTXK5J2nXLdP+ALI1cgv8wj7KuwBhTwBkOZSJKM5XQ==",
-            "dev": true,
-            "requires": {
-                "@types/glob": "^7.1.1",
-                "globby": "^6.1.0",
-                "is-path-cwd": "^2.0.0",
-                "is-path-in-cwd": "^2.0.0",
-                "p-map": "^2.0.0",
-                "pify": "^4.0.1",
-                "rimraf": "^2.6.3"
-            },
-            "dependencies": {
-                "array-union": {
-                    "version": "1.0.2",
-                    "resolved": "https://registry.npmjs.org/array-union/-/array-union-1.0.2.tgz",
-                    "integrity": "sha1-mjRBDk9OPaI96jdb5b5w8kd47Dk=",
-                    "dev": true,
-                    "requires": {
-                        "array-uniq": "^1.0.1"
-                    }
-                },
-                "globby": {
-                    "version": "6.1.0",
-                    "resolved": "https://registry.npmjs.org/globby/-/globby-6.1.0.tgz",
-                    "integrity": "sha1-9abXDoOV4hyFj7BInWTfAkJNUGw=",
-                    "dev": true,
-                    "requires": {
-                        "array-union": "^1.0.1",
-                        "glob": "^7.0.3",
-                        "object-assign": "^4.0.1",
-                        "pify": "^2.0.0",
-                        "pinkie-promise": "^2.0.0"
-                    },
-                    "dependencies": {
-                        "pify": {
-                            "version": "2.3.0",
-                            "resolved": "https://registry.npmjs.org/pify/-/pify-2.3.0.tgz",
-                            "integrity": "sha1-7RQaasBDqEnqWISY59yosVMw6Qw=",
-                            "dev": true
-                        }
-                    }
-                },
-                "rimraf": {
-                    "version": "2.7.1",
-                    "resolved": "https://registry.npmjs.org/rimraf/-/rimraf-2.7.1.tgz",
-                    "integrity": "sha512-uWjbaKIK3T1OSVptzX7Nl6PvQ3qAGtKEtVRjRuazjfL3Bx5eI409VZSqgND+4UNnmzLVdPj9FqFJNPqBZFve4w==",
-                    "dev": true,
-                    "requires": {
-                        "glob": "^7.1.3"
-                    }
-                }
-            }
-        },
-        "depd": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/depd/-/depd-1.1.2.tgz",
-            "integrity": "sha1-m81S4UwJd2PnSbJ0xDRu0uVgtak=",
-            "dev": true
-        },
-        "destroy": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/destroy/-/destroy-1.0.4.tgz",
-            "integrity": "sha1-l4hXRCxEdJ5CBmE+N5RiBYJqvYA=",
-            "dev": true
-        },
-        "detect-node": {
-            "version": "2.0.5",
-            "resolved": "https://registry.npmjs.org/detect-node/-/detect-node-2.0.5.tgz",
-            "integrity": "sha512-qi86tE6hRcFHy8jI1m2VG+LaPUR1LhqDa5G8tVjuUXmOrpuAgqsA1pN0+ldgr3aKUH+QLI9hCY/OcRYisERejw==",
-            "dev": true
-        },
-        "dir-glob": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/dir-glob/-/dir-glob-3.0.1.tgz",
-            "integrity": "sha512-WkrWp9GR4KXfKGYzOLmTuGVi1UWFfws377n9cc55/tb6DuqyF6pcQ5AbiHEshaDpY9v6oaSr2XCDidGmMwdzIA==",
-            "dev": true,
-            "requires": {
-                "path-type": "^4.0.0"
-            }
-        },
-        "dns-equal": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/dns-equal/-/dns-equal-1.0.0.tgz",
-            "integrity": "sha1-s55/HabrCnW6nBcySzR1PEfgZU0=",
-            "dev": true
-        },
-        "dns-packet": {
-            "version": "1.3.4",
-            "resolved": "https://registry.npmjs.org/dns-packet/-/dns-packet-1.3.4.tgz",
-            "integrity": "sha512-BQ6F4vycLXBvdrJZ6S3gZewt6rcrks9KBgM9vrhW+knGRqc8uEdT7fuCwloc7nny5xNoMJ17HGH0R/6fpo8ECA==",
-            "dev": true,
-            "requires": {
-                "ip": "^1.1.0",
-                "safe-buffer": "^5.0.1"
-            }
-        },
-        "dns-txt": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/dns-txt/-/dns-txt-2.0.2.tgz",
-            "integrity": "sha1-uR2Ab10nGI5Ks+fRB9iBocxGQrY=",
-            "dev": true,
-            "requires": {
-                "buffer-indexof": "^1.0.0"
-            }
-        },
-        "doctrine": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/doctrine/-/doctrine-3.0.0.tgz",
-            "integrity": "sha512-yS+Q5i3hBf7GBkd4KG8a7eBNNWNGLTaEwwYWUijIYM7zrlYDM0BFXHjjPWlWZ1Rg7UaddZeIDmi9jF3HmqiQ2w==",
-            "dev": true,
-            "requires": {
-                "esutils": "^2.0.2"
-            }
-        },
-        "ee-first": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/ee-first/-/ee-first-1.1.1.tgz",
-            "integrity": "sha1-WQxhFWsK4vTwJVcyoViyZrxWsh0=",
-            "dev": true
-        },
-        "electron-to-chromium": {
-            "version": "1.3.750",
-            "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.3.750.tgz",
-            "integrity": "sha512-Eqy9eHNepZxJXT+Pc5++zvEi5nQ6AGikwFYDCYwXUFBr+ynJ6pDG7MzZmwGYCIuXShLJM0n4bq+aoKDmvSGJ8A==",
-            "dev": true
-        },
-        "emoji-regex": {
-            "version": "8.0.0",
-            "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-8.0.0.tgz",
-            "integrity": "sha512-MSjYzcWNOA0ewAHpz0MxpYFvwg6yjy1NG3xteoqz644VCo/RPgnr1/GGt+ic3iJTzQ8Eu3TdM14SawnVUmGE6A==",
-            "dev": true
-        },
-        "emojis-list": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/emojis-list/-/emojis-list-3.0.0.tgz",
-            "integrity": "sha512-/kyM18EfinwXZbno9FyUGeFh87KC8HRQBQGildHZbEuRyWFOmv1U10o9BBp8XVZDVNNuQKyIGIu5ZYAAXJ0V2Q==",
-            "dev": true
-        },
-        "encodeurl": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz",
-            "integrity": "sha1-rT/0yG7C0CkyL1oCw6mmBslbP1k=",
-            "dev": true
-        },
-        "end-of-stream": {
-            "version": "1.4.4",
-            "resolved": "https://registry.npmjs.org/end-of-stream/-/end-of-stream-1.4.4.tgz",
-            "integrity": "sha512-+uw1inIHVPQoaVuHzRyXd21icM+cnt4CzD5rW+NC1wjOUSTOs+Te7FOv7AhN7vS9x/oIyhLP5PR1H+phQAHu5Q==",
-            "dev": true,
-            "requires": {
-                "once": "^1.4.0"
-            }
-        },
-        "enhanced-resolve": {
-            "version": "5.7.0",
-            "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.7.0.tgz",
-            "integrity": "sha512-6njwt/NsZFUKhM6j9U8hzVyD4E4r0x7NQzhTCbcWOJ0IQjNSAoalWmb0AE51Wn+fwan5qVESWi7t2ToBxs9vrw==",
-            "dev": true,
-            "requires": {
-                "graceful-fs": "^4.2.4",
-                "tapable": "^2.2.0"
-            }
-        },
-        "enquirer": {
-            "version": "2.3.6",
-            "resolved": "https://registry.npmjs.org/enquirer/-/enquirer-2.3.6.tgz",
-            "integrity": "sha512-yjNnPr315/FjS4zIsUxYguYUPP2e1NK4d7E7ZOLiyYCcbFBiTMyID+2wvm2w6+pZ/odMA7cRkjhsPbltwBOrLg==",
-            "dev": true,
-            "requires": {
-                "ansi-colors": "^4.1.1"
-            }
-        },
-        "envinfo": {
-            "version": "7.7.4",
-            "resolved": "https://registry.npmjs.org/envinfo/-/envinfo-7.7.4.tgz",
-            "integrity": "sha512-TQXTYFVVwwluWSFis6K2XKxgrD22jEv0FTuLCQI+OjH7rn93+iY0fSSFM5lrSxFY+H1+B0/cvvlamr3UsBivdQ==",
-            "dev": true
-        },
-        "errno": {
-            "version": "0.1.8",
-            "resolved": "https://registry.npmjs.org/errno/-/errno-0.1.8.tgz",
-            "integrity": "sha512-dJ6oBr5SQ1VSd9qkk7ByRgb/1SH4JZjCHSW/mr63/QcXO9zLVxvJ6Oy13nio03rxpSnVDDjFor75SjVeZWPW/A==",
-            "dev": true,
-            "requires": {
-                "prr": "~1.0.1"
-            }
-        },
-        "es-module-lexer": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-0.4.1.tgz",
-            "integrity": "sha512-ooYciCUtfw6/d2w56UVeqHPcoCFAiJdz5XOkYpv/Txl1HMUozpXjz/2RIQgqwKdXNDPSF1W7mJCFse3G+HDyAA==",
-            "dev": true
-        },
-        "escalade": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/escalade/-/escalade-3.1.1.tgz",
-            "integrity": "sha512-k0er2gUkLf8O0zKJiAhmkTnJlTvINGv7ygDNPbeIsX/TJjGJZHuh9B2UxbsaEkmlEo9MfhrSzmhIlhRlI2GXnw==",
-            "dev": true
-        },
-        "escape-html": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/escape-html/-/escape-html-1.0.3.tgz",
-            "integrity": "sha1-Aljq5NPQwJdN4cFpGI7wBR0dGYg=",
-            "dev": true
-        },
-        "escape-latex": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/escape-latex/-/escape-latex-1.2.0.tgz",
-            "integrity": "sha512-nV5aVWW1K0wEiUIEdZ4erkGGH8mDxGyxSeqPzRNtWP7ataw+/olFObw7hujFWlVjNsaDFw5VZ5NzVSIqRgfTiw=="
-        },
-        "escape-string-regexp": {
-            "version": "1.0.5",
-            "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz",
-            "integrity": "sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=",
-            "dev": true
-        },
-        "eslint": {
-            "version": "7.22.0",
-            "resolved": "https://registry.npmjs.org/eslint/-/eslint-7.22.0.tgz",
-            "integrity": "sha512-3VawOtjSJUQiiqac8MQc+w457iGLfuNGLFn8JmF051tTKbh5/x/0vlcEj8OgDCaw7Ysa2Jn8paGshV7x2abKXg==",
-            "dev": true,
-            "requires": {
-                "@babel/code-frame": "7.12.11",
-                "@eslint/eslintrc": "^0.4.0",
-                "ajv": "^6.10.0",
-                "chalk": "^4.0.0",
-                "cross-spawn": "^7.0.2",
-                "debug": "^4.0.1",
-                "doctrine": "^3.0.0",
-                "enquirer": "^2.3.5",
-                "eslint-scope": "^5.1.1",
-                "eslint-utils": "^2.1.0",
-                "eslint-visitor-keys": "^2.0.0",
-                "espree": "^7.3.1",
-                "esquery": "^1.4.0",
-                "esutils": "^2.0.2",
-                "file-entry-cache": "^6.0.1",
-                "functional-red-black-tree": "^1.0.1",
-                "glob-parent": "^5.0.0",
-                "globals": "^13.6.0",
-                "ignore": "^4.0.6",
-                "import-fresh": "^3.0.0",
-                "imurmurhash": "^0.1.4",
-                "is-glob": "^4.0.0",
-                "js-yaml": "^3.13.1",
-                "json-stable-stringify-without-jsonify": "^1.0.1",
-                "levn": "^0.4.1",
-                "lodash": "^4.17.21",
-                "minimatch": "^3.0.4",
-                "natural-compare": "^1.4.0",
-                "optionator": "^0.9.1",
-                "progress": "^2.0.0",
-                "regexpp": "^3.1.0",
-                "semver": "^7.2.1",
-                "strip-ansi": "^6.0.0",
-                "strip-json-comments": "^3.1.0",
-                "table": "^6.0.4",
-                "text-table": "^0.2.0",
-                "v8-compile-cache": "^2.0.3"
-            },
-            "dependencies": {
-                "ignore": {
-                    "version": "4.0.6",
-                    "resolved": "https://registry.npmjs.org/ignore/-/ignore-4.0.6.tgz",
-                    "integrity": "sha512-cyFDKrqc/YdcWFniJhzI42+AzS+gNwmUzOSFcRCQYwySuBBBy/KjuxWLZ/FHEH6Moq1NizMOBWyTcv8O4OZIMg==",
-                    "dev": true
-                }
-            }
-        },
-        "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,
-            "requires": {
-                "esrecurse": "^4.3.0",
-                "estraverse": "^4.1.1"
-            }
-        },
-        "eslint-utils": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/eslint-utils/-/eslint-utils-2.1.0.tgz",
-            "integrity": "sha512-w94dQYoauyvlDc43XnGB8lU3Zt713vNChgt4EWwhXAP2XkBvndfxF0AgIqKOOasjPIPzj9JqgwkwbCYD0/V3Zg==",
-            "dev": true,
-            "requires": {
-                "eslint-visitor-keys": "^1.1.0"
-            },
-            "dependencies": {
-                "eslint-visitor-keys": {
-                    "version": "1.3.0",
-                    "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-1.3.0.tgz",
-                    "integrity": "sha512-6J72N8UNa462wa/KFODt/PJ3IU60SDpC3QXC1Hjc1BXXpfL2C9R5+AU7jhe0F6GREqVMh4Juu+NY7xn+6dipUQ==",
-                    "dev": true
-                }
-            }
-        },
-        "eslint-visitor-keys": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-2.0.0.tgz",
-            "integrity": "sha512-QudtT6av5WXels9WjIM7qz1XD1cWGvX4gGXvp/zBn9nXG02D0utdU3Em2m/QjTnrsk6bBjmCygl3rmj118msQQ==",
-            "dev": true
-        },
-        "espree": {
-            "version": "7.3.1",
-            "resolved": "https://registry.npmjs.org/espree/-/espree-7.3.1.tgz",
-            "integrity": "sha512-v3JCNCE64umkFpmkFGqzVKsOT0tN1Zr+ueqLZfpV1Ob8e+CEgPWa+OxCoGH3tnhimMKIaBm4m/vaRpJ/krRz2g==",
-            "dev": true,
-            "requires": {
-                "acorn": "^7.4.0",
-                "acorn-jsx": "^5.3.1",
-                "eslint-visitor-keys": "^1.3.0"
-            },
-            "dependencies": {
-                "acorn": {
-                    "version": "7.4.1",
-                    "resolved": "https://registry.npmjs.org/acorn/-/acorn-7.4.1.tgz",
-                    "integrity": "sha512-nQyp0o1/mNdbTO1PO6kHkwSrmgZ0MT/jCCpNiwbUjGoRN4dlBhqJtoQuCnEOKzgTVwg0ZWiCoQy6SxMebQVh8A==",
-                    "dev": true
-                },
-                "eslint-visitor-keys": {
-                    "version": "1.3.0",
-                    "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-1.3.0.tgz",
-                    "integrity": "sha512-6J72N8UNa462wa/KFODt/PJ3IU60SDpC3QXC1Hjc1BXXpfL2C9R5+AU7jhe0F6GREqVMh4Juu+NY7xn+6dipUQ==",
-                    "dev": true
-                }
-            }
-        },
-        "esprima": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/esprima/-/esprima-4.0.1.tgz",
-            "integrity": "sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A==",
-            "dev": true
-        },
-        "esquery": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/esquery/-/esquery-1.4.0.tgz",
-            "integrity": "sha512-cCDispWt5vHHtwMY2YrAQ4ibFkAL8RbH5YGBnZBc90MolvvfkkQcJro/aZiAQUlQ3qgrYS6D6v8Gc5G5CQsc9w==",
-            "dev": true,
-            "requires": {
-                "estraverse": "^5.1.0"
-            },
-            "dependencies": {
-                "estraverse": {
-                    "version": "5.2.0",
-                    "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.2.0.tgz",
-                    "integrity": "sha512-BxbNGGNm0RyRYvUdHpIwv9IWzeM9XClbOxwoATuFdOE7ZE6wHL+HQ5T8hoPM+zHvmKzzsEqhgy0GrQ5X13afiQ==",
-                    "dev": true
-                }
-            }
-        },
-        "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,
-            "requires": {
-                "estraverse": "^5.2.0"
-            },
-            "dependencies": {
-                "estraverse": {
-                    "version": "5.2.0",
-                    "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.2.0.tgz",
-                    "integrity": "sha512-BxbNGGNm0RyRYvUdHpIwv9IWzeM9XClbOxwoATuFdOE7ZE6wHL+HQ5T8hoPM+zHvmKzzsEqhgy0GrQ5X13afiQ==",
-                    "dev": true
-                }
-            }
-        },
-        "estraverse": {
-            "version": "4.3.0",
-            "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-4.3.0.tgz",
-            "integrity": "sha512-39nnKffWz8xN1BU/2c79n9nB9HDzo0niYUqx6xyqUnyoAnQyyWpOTdZEeiCch8BBu515t4wp9ZmgVfVhn9EBpw==",
-            "dev": true
-        },
-        "esutils": {
-            "version": "2.0.3",
-            "resolved": "https://registry.npmjs.org/esutils/-/esutils-2.0.3.tgz",
-            "integrity": "sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==",
-            "dev": true
-        },
-        "etag": {
-            "version": "1.8.1",
-            "resolved": "https://registry.npmjs.org/etag/-/etag-1.8.1.tgz",
-            "integrity": "sha1-Qa4u62XvpiJorr/qg6x9eSmbCIc=",
-            "dev": true
-        },
-        "eventemitter3": {
-            "version": "4.0.7",
-            "resolved": "https://registry.npmjs.org/eventemitter3/-/eventemitter3-4.0.7.tgz",
-            "integrity": "sha512-8guHBZCwKnFhYdHr2ysuRWErTwhoN2X8XELRlrRwpmfeY2jjuUN4taQMsULKUVo1K4DvZl+0pgfyoysHxvmvEw==",
-            "dev": true
-        },
-        "events": {
-            "version": "3.3.0",
-            "resolved": "https://registry.npmjs.org/events/-/events-3.3.0.tgz",
-            "integrity": "sha512-mQw+2fkQbALzQ7V0MY0IqdnXNOeTtP4r0lN9z7AAawCXgqea7bDii20AYrIBrFd/Hx0M2Ocz6S111CaFkUcb0Q==",
-            "dev": true
-        },
-        "eventsource": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/eventsource/-/eventsource-1.1.0.tgz",
-            "integrity": "sha512-VSJjT5oCNrFvCS6igjzPAt5hBzQ2qPBFIbJ03zLI9SE0mxwZpMw6BfJrbFHm1a141AavMEB8JHmBhWAd66PfCg==",
-            "dev": true,
-            "requires": {
-                "original": "^1.0.0"
-            }
-        },
-        "execa": {
-            "version": "5.0.0",
-            "resolved": "https://registry.npmjs.org/execa/-/execa-5.0.0.tgz",
-            "integrity": "sha512-ov6w/2LCiuyO4RLYGdpFGjkcs0wMTgGE8PrkTHikeUy5iJekXyPIKUjifk5CsE0pt7sMCrMZ3YNqoCj6idQOnQ==",
-            "dev": true,
-            "requires": {
-                "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"
-            }
-        },
-        "expand-brackets": {
-            "version": "2.1.4",
-            "resolved": "https://registry.npmjs.org/expand-brackets/-/expand-brackets-2.1.4.tgz",
-            "integrity": "sha1-t3c14xXOMPa27/D4OwQVGiJEliI=",
-            "dev": true,
-            "requires": {
-                "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"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    }
-                },
-                "define-property": {
-                    "version": "0.2.5",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-                    "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^0.1.0"
-                    }
-                },
-                "extend-shallow": {
-                    "version": "2.0.1",
-                    "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                    "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                    "dev": true,
-                    "requires": {
-                        "is-extendable": "^0.1.0"
-                    }
-                },
-                "ms": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                    "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                    "dev": true
-                }
-            }
-        },
-        "express": {
-            "version": "4.17.1",
-            "resolved": "https://registry.npmjs.org/express/-/express-4.17.1.tgz",
-            "integrity": "sha512-mHJ9O79RqluphRrcw2X/GTh3k9tVv8YcoyY4Kkh4WDMUYKRZUq0h1o0w2rrrxBqM7VoeUVqgb27xlEMXTnYt4g==",
-            "dev": true,
-            "requires": {
-                "accepts": "~1.3.7",
-                "array-flatten": "1.1.1",
-                "body-parser": "1.19.0",
-                "content-disposition": "0.5.3",
-                "content-type": "~1.0.4",
-                "cookie": "0.4.0",
-                "cookie-signature": "1.0.6",
-                "debug": "2.6.9",
-                "depd": "~1.1.2",
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "etag": "~1.8.1",
-                "finalhandler": "~1.1.2",
-                "fresh": "0.5.2",
-                "merge-descriptors": "1.0.1",
-                "methods": "~1.1.2",
-                "on-finished": "~2.3.0",
-                "parseurl": "~1.3.3",
-                "path-to-regexp": "0.1.7",
-                "proxy-addr": "~2.0.5",
-                "qs": "6.7.0",
-                "range-parser": "~1.2.1",
-                "safe-buffer": "5.1.2",
-                "send": "0.17.1",
-                "serve-static": "1.14.1",
-                "setprototypeof": "1.1.1",
-                "statuses": "~1.5.0",
-                "type-is": "~1.6.18",
-                "utils-merge": "1.0.1",
-                "vary": "~1.1.2"
-            },
-            "dependencies": {
-                "array-flatten": {
-                    "version": "1.1.1",
-                    "resolved": "https://registry.npmjs.org/array-flatten/-/array-flatten-1.1.1.tgz",
-                    "integrity": "sha1-ml9pkFGx5wczKPKgCJaLZOopVdI=",
-                    "dev": true
-                },
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    }
-                },
-                "ms": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                    "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                    "dev": true
-                },
-                "safe-buffer": {
-                    "version": "5.1.2",
-                    "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-                    "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-                    "dev": true
-                }
-            }
-        },
-        "extend-shallow": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-3.0.2.tgz",
-            "integrity": "sha1-Jqcarwc7OfshJxcnRhMcJwQCjbg=",
-            "dev": true,
-            "requires": {
-                "assign-symbols": "^1.0.0",
-                "is-extendable": "^1.0.1"
-            },
-            "dependencies": {
-                "is-extendable": {
-                    "version": "1.0.1",
-                    "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-1.0.1.tgz",
-                    "integrity": "sha512-arnXMxT1hhoKo9k1LZdmlNyJdDDfy2v0fXjFlmok4+i8ul/6WlbVge9bhM74OpNPQPMGUToDtz+KXa1PneJxOA==",
-                    "dev": true,
-                    "requires": {
-                        "is-plain-object": "^2.0.4"
-                    }
-                }
-            }
-        },
-        "extglob": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/extglob/-/extglob-2.0.4.tgz",
-            "integrity": "sha512-Nmb6QXkELsuBr24CJSkilo6UHHgbekK5UiZgfE6UHD3Eb27YC6oD+bhcT+tJ6cl8dmsgdQxnWlcry8ksBIBLpw==",
-            "dev": true,
-            "requires": {
-                "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"
-            },
-            "dependencies": {
-                "define-property": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
-                    "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^1.0.0"
-                    }
-                },
-                "extend-shallow": {
-                    "version": "2.0.1",
-                    "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                    "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                    "dev": true,
-                    "requires": {
-                        "is-extendable": "^0.1.0"
-                    }
-                },
-                "is-accessor-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-data-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-descriptor": {
-                    "version": "1.0.2",
-                    "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-                    "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-                    "dev": true,
-                    "requires": {
-                        "is-accessor-descriptor": "^1.0.0",
-                        "is-data-descriptor": "^1.0.0",
-                        "kind-of": "^6.0.2"
-                    }
-                }
-            }
-        },
-        "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
-        },
-        "fast-glob": {
-            "version": "3.2.5",
-            "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.2.5.tgz",
-            "integrity": "sha512-2DtFcgT68wiTTiwZ2hNdJfcHNke9XOfnwmBRWXhmeKM8rF0TGwmC/Qto3S7RoZKp5cilZbxzO5iTNTQsJ+EeDg==",
-            "dev": true,
-            "requires": {
-                "@nodelib/fs.stat": "^2.0.2",
-                "@nodelib/fs.walk": "^1.2.3",
-                "glob-parent": "^5.1.0",
-                "merge2": "^1.3.0",
-                "micromatch": "^4.0.2",
-                "picomatch": "^2.2.1"
-            }
-        },
-        "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
-        },
-        "fast-levenshtein": {
-            "version": "2.0.6",
-            "resolved": "https://registry.npmjs.org/fast-levenshtein/-/fast-levenshtein-2.0.6.tgz",
-            "integrity": "sha1-PYpcZog6FqMMqGQ+hR8Zuqd5eRc=",
-            "dev": true
-        },
-        "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
-        },
-        "fastq": {
-            "version": "1.11.0",
-            "resolved": "https://registry.npmjs.org/fastq/-/fastq-1.11.0.tgz",
-            "integrity": "sha512-7Eczs8gIPDrVzT+EksYBcupqMyxSHXXrHOLRRxU2/DicV8789MRBRR8+Hc2uWzUupOs4YS4JzBmBxjjCVBxD/g==",
-            "dev": true,
-            "requires": {
-                "reusify": "^1.0.4"
-            }
-        },
-        "faye-websocket": {
-            "version": "0.11.3",
-            "resolved": "https://registry.npmjs.org/faye-websocket/-/faye-websocket-0.11.3.tgz",
-            "integrity": "sha512-D2y4bovYpzziGgbHYtGCMjlJM36vAl/y+xUyn1C+FVx8szd1E+86KwVw6XvYSzOP8iMpm1X0I4xJD+QtUb36OA==",
-            "dev": true,
-            "requires": {
-                "websocket-driver": ">=0.5.1"
-            }
-        },
-        "file-entry-cache": {
-            "version": "6.0.1",
-            "resolved": "https://registry.npmjs.org/file-entry-cache/-/file-entry-cache-6.0.1.tgz",
-            "integrity": "sha512-7Gps/XWymbLk2QLYK4NzpMOrYjMhdIxXuIvy2QBsLE6ljuodKvdkWs/cpyJJ3CVIVpH0Oi1Hvg1ovbMzLdFBBg==",
-            "dev": true,
-            "requires": {
-                "flat-cache": "^3.0.4"
-            }
-        },
-        "file-uri-to-path": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/file-uri-to-path/-/file-uri-to-path-1.0.0.tgz",
-            "integrity": "sha512-0Zt+s3L7Vf1biwWZ29aARiVYLx7iMGnEUl9x33fbB/j3jR81u/O2LbqK+Bm1CDSNDKVtJ/YjwY7TUd5SkeLQLw==",
-            "dev": true,
-            "optional": true
-        },
-        "fill-range": {
-            "version": "7.0.1",
-            "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.0.1.tgz",
-            "integrity": "sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==",
-            "dev": true,
-            "requires": {
-                "to-regex-range": "^5.0.1"
-            }
-        },
-        "finalhandler": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.1.2.tgz",
-            "integrity": "sha512-aAWcW57uxVNrQZqFXjITpW3sIUQmHGG3qSb9mUah9MgMC4NeWhNOlNjXEYq3HjRAvL6arUviZGGJsBg6z0zsWA==",
-            "dev": true,
-            "requires": {
-                "debug": "2.6.9",
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "on-finished": "~2.3.0",
-                "parseurl": "~1.3.3",
-                "statuses": "~1.5.0",
-                "unpipe": "~1.0.0"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    }
-                },
-                "ms": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                    "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                    "dev": true
-                }
-            }
-        },
-        "find-cache-dir": {
-            "version": "3.3.1",
-            "resolved": "https://registry.npmjs.org/find-cache-dir/-/find-cache-dir-3.3.1.tgz",
-            "integrity": "sha512-t2GDMt3oGC/v+BMwzmllWDuJF/xcDtE5j/fCGbqDD7OLuJkj0cfh1YSA5VKPvwMeLFLNDBkwOKZ2X85jGLVftQ==",
-            "dev": true,
-            "requires": {
-                "commondir": "^1.0.1",
-                "make-dir": "^3.0.2",
-                "pkg-dir": "^4.1.0"
-            },
-            "dependencies": {
-                "make-dir": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-3.1.0.tgz",
-                    "integrity": "sha512-g3FeP20LNwhALb/6Cz6Dd4F2ngze0jz7tbzrD2wAV+o9FeNHe4rL+yK2md0J/fiSf1sa1ADhXqi5+oVwOM/eGw==",
-                    "dev": true,
-                    "requires": {
-                        "semver": "^6.0.0"
-                    }
-                },
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                }
-            }
-        },
-        "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,
-            "requires": {
-                "locate-path": "^5.0.0",
-                "path-exists": "^4.0.0"
-            }
-        },
-        "flat-cache": {
-            "version": "3.0.4",
-            "resolved": "https://registry.npmjs.org/flat-cache/-/flat-cache-3.0.4.tgz",
-            "integrity": "sha512-dm9s5Pw7Jc0GvMYbshN6zchCA9RgQlzzEZX3vylR9IqFfS8XciblUXOKfW6SiuJ0e13eDYZoZV5wdrev7P3Nwg==",
-            "dev": true,
-            "requires": {
-                "flatted": "^3.1.0",
-                "rimraf": "^3.0.2"
-            }
-        },
-        "flatted": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/flatted/-/flatted-3.1.1.tgz",
-            "integrity": "sha512-zAoAQiudy+r5SvnSw3KJy5os/oRJYHzrzja/tBDqrZtNhUw8bt6y8OBzMWcjWr+8liV8Eb6yOhw8WZ7VFZ5ZzA==",
-            "dev": true
-        },
-        "follow-redirects": {
-            "version": "1.13.3",
-            "resolved": "https://registry.npmjs.org/follow-redirects/-/follow-redirects-1.13.3.tgz",
-            "integrity": "sha512-DUgl6+HDzB0iEptNQEXLx/KhTmDb8tZUHSeLqpnjpknR70H0nC2t9N73BK6fN4hOvJ84pKlIQVQ4k5FFlBedKA==",
-            "dev": true
-        },
-        "for-in": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/for-in/-/for-in-1.0.2.tgz",
-            "integrity": "sha1-gQaNKVqBQuwKxybG4iAMMPttXoA=",
-            "dev": true
-        },
-        "forwarded": {
-            "version": "0.1.2",
-            "resolved": "https://registry.npmjs.org/forwarded/-/forwarded-0.1.2.tgz",
-            "integrity": "sha1-mMI9qxF1ZXuMBXPozszZGw/xjIQ=",
-            "dev": true
-        },
-        "fraction.js": {
-            "version": "4.0.13",
-            "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-4.0.13.tgz",
-            "integrity": "sha512-E1fz2Xs9ltlUp+qbiyx9wmt2n9dRzPsS11Jtdb8D2o+cC7wr9xkkKsVKJuBX0ST+LVS+LhLO+SbLJNtfWcJvXA=="
-        },
-        "fragment-cache": {
-            "version": "0.2.1",
-            "resolved": "https://registry.npmjs.org/fragment-cache/-/fragment-cache-0.2.1.tgz",
-            "integrity": "sha1-QpD60n8T6Jvn8zeZxrxaCr//DRk=",
-            "dev": true,
-            "requires": {
-                "map-cache": "^0.2.2"
-            }
-        },
-        "fresh": {
-            "version": "0.5.2",
-            "resolved": "https://registry.npmjs.org/fresh/-/fresh-0.5.2.tgz",
-            "integrity": "sha1-PYyt2Q2XZWn6g1qx+OSyOhBWBac=",
-            "dev": true
-        },
-        "fs-readdir-recursive": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/fs-readdir-recursive/-/fs-readdir-recursive-1.1.0.tgz",
-            "integrity": "sha512-GNanXlVr2pf02+sPN40XN8HG+ePaNcvM0q5mZBd668Obwb0yD5GiUbZOFgwn8kGMY6I3mdyDJzieUy3PTYyTRA==",
-            "dev": true
-        },
-        "fs.realpath": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/fs.realpath/-/fs.realpath-1.0.0.tgz",
-            "integrity": "sha1-FQStJSMVjKpA20onh8sBQRmU6k8=",
-            "dev": true
-        },
-        "fsevents": {
-            "version": "2.3.2",
-            "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.3.2.tgz",
-            "integrity": "sha512-xiqMQR4xAeHTuB9uWm+fFRcIOgKBMiOBP+eXiyT7jsgVCq1bkVygt00oASowB7EdtpOHaaPgKt812P9ab+DDKA==",
-            "dev": true,
-            "optional": true
-        },
-        "function-bind": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.1.tgz",
-            "integrity": "sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A==",
-            "dev": true
-        },
-        "functional-red-black-tree": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/functional-red-black-tree/-/functional-red-black-tree-1.0.1.tgz",
-            "integrity": "sha1-GwqzvVU7Kg1jmdKcDj6gslIHgyc=",
-            "dev": true
-        },
-        "gensync": {
-            "version": "1.0.0-beta.2",
-            "resolved": "https://registry.npmjs.org/gensync/-/gensync-1.0.0-beta.2.tgz",
-            "integrity": "sha512-3hN7NaskYvMDLQY55gnW3NQ+mesEAepTqlg+VEbj7zzqEMBVNhzcGYYeqFo/TlYz6eQiFcp1HcsCZO+nGgS8zg==",
-            "dev": true
-        },
-        "get-caller-file": {
-            "version": "2.0.5",
-            "resolved": "https://registry.npmjs.org/get-caller-file/-/get-caller-file-2.0.5.tgz",
-            "integrity": "sha512-DyFP3BM/3YHTQOCUL/w0OZHR0lpKeGrxotcHWcqNEdnltqFwXVfhEBQ94eIo34AfQpo0rGki4cyIiftY06h2Fg==",
-            "dev": true
-        },
-        "get-intrinsic": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/get-intrinsic/-/get-intrinsic-1.1.1.tgz",
-            "integrity": "sha512-kWZrnVM42QCiEA2Ig1bG8zjoIMOgxWwYCEeNdwY6Tv/cOSeGpcoX4pXHfKUxNKVoArnrEr2e9srnAxxGIraS9Q==",
-            "dev": true,
-            "requires": {
-                "function-bind": "^1.1.1",
-                "has": "^1.0.3",
-                "has-symbols": "^1.0.1"
-            }
-        },
-        "get-stream": {
-            "version": "6.0.0",
-            "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-6.0.0.tgz",
-            "integrity": "sha512-A1B3Bh1UmL0bidM/YX2NsCOTnGJePL9rO/M+Mw3m9f2gUpfokS0hi5Eah0WSUEWZdZhIZtMjkIYS7mDfOqNHbg==",
-            "dev": true
-        },
-        "get-value": {
-            "version": "2.0.6",
-            "resolved": "https://registry.npmjs.org/get-value/-/get-value-2.0.6.tgz",
-            "integrity": "sha1-3BXKHGcjh8p2vTesCjlbogQqLCg=",
-            "dev": true
-        },
-        "glob": {
-            "version": "7.1.6",
-            "resolved": "https://registry.npmjs.org/glob/-/glob-7.1.6.tgz",
-            "integrity": "sha512-LwaxwyZ72Lk7vZINtNNrywX0ZuLyStrdDtabefZKAY5ZGJhVtgdznluResxNmPitE0SAO+O26sWTHeKSI2wMBA==",
-            "dev": true,
-            "requires": {
-                "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"
-            }
-        },
-        "glob-parent": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-5.1.2.tgz",
-            "integrity": "sha512-AOIgSQCepiJYwP3ARnGx+5VnTu2HBYdzbGP45eLw1vr3zB3vZLeyed1sC9hnbcOc9/SrMyM5RPQrkGz4aS9Zow==",
-            "dev": true,
-            "requires": {
-                "is-glob": "^4.0.1"
-            }
-        },
-        "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
-        },
-        "globals": {
-            "version": "13.7.0",
-            "resolved": "https://registry.npmjs.org/globals/-/globals-13.7.0.tgz",
-            "integrity": "sha512-Aipsz6ZKRxa/xQkZhNg0qIWXT6x6rD46f6x/PCnBomlttdIyAPak4YD9jTmKpZ72uROSMU87qJtcgpgHaVchiA==",
-            "dev": true,
-            "requires": {
-                "type-fest": "^0.20.2"
-            },
-            "dependencies": {
-                "type-fest": {
-                    "version": "0.20.2",
-                    "resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.20.2.tgz",
-                    "integrity": "sha512-Ne+eE4r0/iWnpAxD852z3A+N0Bt5RN//NjJwRd2VFHEmrywxf5vsZlh4R6lixl6B+wz/8d+maTSAkN1FIkI3LQ==",
-                    "dev": true
-                }
-            }
-        },
-        "globby": {
-            "version": "11.0.2",
-            "resolved": "https://registry.npmjs.org/globby/-/globby-11.0.2.tgz",
-            "integrity": "sha512-2ZThXDvvV8fYFRVIxnrMQBipZQDr7MxKAmQK1vujaj9/7eF0efG7BPUKJ7jP7G5SLF37xKDXvO4S/KKLj/Z0og==",
-            "dev": true,
-            "requires": {
-                "array-union": "^2.1.0",
-                "dir-glob": "^3.0.1",
-                "fast-glob": "^3.1.1",
-                "ignore": "^5.1.4",
-                "merge2": "^1.3.0",
-                "slash": "^3.0.0"
-            }
-        },
-        "graceful-fs": {
-            "version": "4.2.4",
-            "resolved": "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.4.tgz",
-            "integrity": "sha512-WjKPNJF79dtJAVniUlGGWHYGz2jWxT6VhN/4m1NdkbZ2nOsEF+cI1Edgql5zCRhs/VsQYRvrXctxktVXZUkixw==",
-            "dev": true
-        },
-        "graphlib": {
-            "version": "2.1.8",
-            "resolved": "https://registry.npmjs.org/graphlib/-/graphlib-2.1.8.tgz",
-            "integrity": "sha512-jcLLfkpoVGmH7/InMC/1hIvOPSUh38oJtGhvrOFGzioE1DZ+0YW16RgmOJhHiuWTvGiJQ9Z1Ik43JvkRPRvE+A==",
-            "requires": {
-                "lodash": "^4.17.15"
-            }
-        },
-        "handle-thing": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/handle-thing/-/handle-thing-2.0.1.tgz",
-            "integrity": "sha512-9Qn4yBxelxoh2Ow62nP+Ka/kMnOXRi8BXnRaUwezLNhqelnN49xKz4F/dPP8OYLxLxq6JDtZb2i9XznUQbNPTg==",
-            "dev": true
-        },
-        "has": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/has/-/has-1.0.3.tgz",
-            "integrity": "sha512-f2dvO0VU6Oej7RkWJGrehjbzMAjFp5/VKPp5tTpWIV4JHHZK1/BxbFRtf/siA2SWTe09caDmVtYYzWEIbBS4zw==",
-            "dev": true,
-            "requires": {
-                "function-bind": "^1.1.1"
-            }
-        },
-        "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
+  "name": "@spcl/sdfv",
+  "version": "1.0.5",
+  "lockfileVersion": 1,
+  "requires": true,
+  "dependencies": {
+    "@babel/cli": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.13.10.tgz",
+      "integrity": "sha512-lYSBC7B4B9hJ7sv0Ojx1BrGhuzCoOIYfLjd+Xpd4rOzdS+a47yi8voV8vFkfjlZR1N5qZO7ixOCbobUdT304PQ==",
+      "dev": true,
+      "requires": {
+        "@nicolo-ribaudo/chokidar-2": "2.1.8-no-fsevents",
+        "chokidar": "^3.4.0",
+        "commander": "^4.0.1",
+        "convert-source-map": "^1.1.0",
+        "fs-readdir-recursive": "^1.1.0",
+        "glob": "^7.0.0",
+        "lodash": "^4.17.19",
+        "make-dir": "^2.1.0",
+        "slash": "^2.0.0",
+        "source-map": "^0.5.0"
+      },
+      "dependencies": {
+        "commander": {
+          "version": "4.1.1",
+          "resolved": "https://registry.npmjs.org/commander/-/commander-4.1.1.tgz",
+          "integrity": "sha512-NOKm8xhkzAjzFx8B2v5OAHT+u5pRQc2UCa2Vq9jYL/31o2wi9mxBA7LIFs3sV5VSC49z6pEhfbMULvShKj26WA==",
+          "dev": true
         },
-        "has-symbols": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/has-symbols/-/has-symbols-1.0.2.tgz",
-            "integrity": "sha512-chXa79rL/UC2KlX17jo3vRGz0azaWEx5tGqZg5pO3NUyEJVB17dMruQlzCCOfUvElghKcm5194+BCRvi2Rv/Gw==",
-            "dev": true
+        "slash": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/slash/-/slash-2.0.0.tgz",
+          "integrity": "sha512-ZYKh3Wh2z1PpEXWr0MpSBZ0V6mZHAQfYevttO11c51CaWjGTaadiKZ+wVt1PbMlDV5qhMFslpZCemhwOK7C89A==",
+          "dev": true
         },
-        "has-value": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/has-value/-/has-value-1.0.0.tgz",
-            "integrity": "sha1-GLKB2lhbHFxR3vJMkw7SmgvmsXc=",
-            "dev": true,
-            "requires": {
-                "get-value": "^2.0.6",
-                "has-values": "^1.0.0",
-                "isobject": "^3.0.0"
-            }
+        "source-map": {
+          "version": "0.5.7",
+          "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
+          "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
+          "dev": true
+        }
+      }
+    },
+    "@babel/code-frame": {
+      "version": "7.12.11",
+      "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.11.tgz",
+      "integrity": "sha512-Zt1yodBx1UcyiePMSkWnU4hPqhwq7hGi2nFL1LeA3EUl+q2LQx16MISgJ0+z7dnmgvP9QtIleuETGOiOH1RcIw==",
+      "dev": true,
+      "requires": {
+        "@babel/highlight": "^7.10.4"
+      }
+    },
+    "@babel/compat-data": {
+      "version": "7.13.11",
+      "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.13.11.tgz",
+      "integrity": "sha512-BwKEkO+2a67DcFeS3RLl0Z3Gs2OvdXewuWjc1Hfokhb5eQWP9YRYH1/+VrVZvql2CfjOiNGqSAFOYt4lsqTHzg==",
+      "dev": true
+    },
+    "@babel/core": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.13.10.tgz",
+      "integrity": "sha512-bfIYcT0BdKeAZrovpMqX2Mx5NrgAckGbwT982AkdS5GNfn3KMGiprlBAtmBcFZRUmpaufS6WZFP8trvx8ptFDw==",
+      "dev": true,
+      "requires": {
+        "@babel/code-frame": "^7.12.13",
+        "@babel/generator": "^7.13.9",
+        "@babel/helper-compilation-targets": "^7.13.10",
+        "@babel/helper-module-transforms": "^7.13.0",
+        "@babel/helpers": "^7.13.10",
+        "@babel/parser": "^7.13.10",
+        "@babel/template": "^7.12.13",
+        "@babel/traverse": "^7.13.0",
+        "@babel/types": "^7.13.0",
+        "convert-source-map": "^1.7.0",
+        "debug": "^4.1.0",
+        "gensync": "^1.0.0-beta.2",
+        "json5": "^2.1.2",
+        "lodash": "^4.17.19",
+        "semver": "^6.3.0",
+        "source-map": "^0.5.0"
+      },
+      "dependencies": {
+        "@babel/code-frame": {
+          "version": "7.12.13",
+          "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
+          "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
+          "dev": true,
+          "requires": {
+            "@babel/highlight": "^7.12.13"
+          }
         },
-        "has-values": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/has-values/-/has-values-1.0.0.tgz",
-            "integrity": "sha1-lbC2P+whRmGab+V/51Yo1aOe/k8=",
-            "dev": true,
-            "requires": {
-                "is-number": "^3.0.0",
-                "kind-of": "^4.0.0"
-            },
-            "dependencies": {
-                "is-number": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-                    "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^3.0.2"
-                    },
-                    "dependencies": {
-                        "kind-of": {
-                            "version": "3.2.2",
-                            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                            "dev": true,
-                            "requires": {
-                                "is-buffer": "^1.1.5"
-                            }
-                        }
-                    }
-                },
-                "kind-of": {
-                    "version": "4.0.0",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-4.0.0.tgz",
-                    "integrity": "sha1-IIE989cSkosgc3hpGkUGb65y3Vc=",
-                    "dev": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                }
-            }
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
         },
-        "hpack.js": {
-            "version": "2.1.6",
-            "resolved": "https://registry.npmjs.org/hpack.js/-/hpack.js-2.1.6.tgz",
-            "integrity": "sha1-h3dMCUnlE/QuhFdbPEVoH63ioLI=",
-            "dev": true,
-            "requires": {
-                "inherits": "^2.0.1",
-                "obuf": "^1.0.0",
-                "readable-stream": "^2.0.1",
-                "wbuf": "^1.1.0"
-            }
+        "source-map": {
+          "version": "0.5.7",
+          "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
+          "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
+          "dev": true
+        }
+      }
+    },
+    "@babel/generator": {
+      "version": "7.13.9",
+      "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.13.9.tgz",
+      "integrity": "sha512-mHOOmY0Axl/JCTkxTU6Lf5sWOg/v8nUa+Xkt4zMTftX0wqmb6Sh7J8gvcehBw7q0AhrhAR+FDacKjCZ2X8K+Sw==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.13.0",
+        "jsesc": "^2.5.1",
+        "source-map": "^0.5.0"
+      },
+      "dependencies": {
+        "source-map": {
+          "version": "0.5.7",
+          "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
+          "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
+          "dev": true
+        }
+      }
+    },
+    "@babel/helper-annotate-as-pure": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-annotate-as-pure/-/helper-annotate-as-pure-7.12.13.tgz",
+      "integrity": "sha512-7YXfX5wQ5aYM/BOlbSccHDbuXXFPxeoUmfWtz8le2yTkTZc+BxsiEnENFoi2SlmA8ewDkG2LgIMIVzzn2h8kfw==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-builder-binary-assignment-operator-visitor": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-builder-binary-assignment-operator-visitor/-/helper-builder-binary-assignment-operator-visitor-7.12.13.tgz",
+      "integrity": "sha512-CZOv9tGphhDRlVjVkAgm8Nhklm9RzSmWpX2my+t7Ua/KT616pEzXsQCjinzvkRvHWJ9itO4f296efroX23XCMA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-explode-assignable-expression": "^7.12.13",
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-compilation-targets": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/helper-compilation-targets/-/helper-compilation-targets-7.13.10.tgz",
+      "integrity": "sha512-/Xju7Qg1GQO4mHZ/Kcs6Au7gfafgZnwm+a7sy/ow/tV1sHeraRUHbjdat8/UvDor4Tez+siGKDk6zIKtCPKVJA==",
+      "dev": true,
+      "requires": {
+        "@babel/compat-data": "^7.13.8",
+        "@babel/helper-validator-option": "^7.12.17",
+        "browserslist": "^4.14.5",
+        "semver": "^6.3.0"
+      },
+      "dependencies": {
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
+        }
+      }
+    },
+    "@babel/helper-create-class-features-plugin": {
+      "version": "7.13.11",
+      "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.13.11.tgz",
+      "integrity": "sha512-ays0I7XYq9xbjCSvT+EvysLgfc3tOkwCULHjrnscGT3A9qD4sk3wXnJ3of0MAWsWGjdinFvajHU2smYuqXKMrw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-function-name": "^7.12.13",
+        "@babel/helper-member-expression-to-functions": "^7.13.0",
+        "@babel/helper-optimise-call-expression": "^7.12.13",
+        "@babel/helper-replace-supers": "^7.13.0",
+        "@babel/helper-split-export-declaration": "^7.12.13"
+      }
+    },
+    "@babel/helper-create-regexp-features-plugin": {
+      "version": "7.12.17",
+      "resolved": "https://registry.npmjs.org/@babel/helper-create-regexp-features-plugin/-/helper-create-regexp-features-plugin-7.12.17.tgz",
+      "integrity": "sha512-p2VGmBu9oefLZ2nQpgnEnG0ZlRPvL8gAGvPUMQwUdaE8k49rOMuZpOwdQoy5qJf6K8jL3bcAMhVUlHAjIgJHUg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-annotate-as-pure": "^7.12.13",
+        "regexpu-core": "^4.7.1"
+      }
+    },
+    "@babel/helper-define-polyfill-provider": {
+      "version": "0.1.5",
+      "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.1.5.tgz",
+      "integrity": "sha512-nXuzCSwlJ/WKr8qxzW816gwyT6VZgiJG17zR40fou70yfAcqjoNyTLl/DQ+FExw5Hx5KNqshmN8Ldl/r2N7cTg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-compilation-targets": "^7.13.0",
+        "@babel/helper-module-imports": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/traverse": "^7.13.0",
+        "debug": "^4.1.1",
+        "lodash.debounce": "^4.0.8",
+        "resolve": "^1.14.2",
+        "semver": "^6.1.2"
+      },
+      "dependencies": {
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
+        }
+      }
+    },
+    "@babel/helper-explode-assignable-expression": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-explode-assignable-expression/-/helper-explode-assignable-expression-7.13.0.tgz",
+      "integrity": "sha512-qS0peLTDP8kOisG1blKbaoBg/o9OSa1qoumMjTK5pM+KDTtpxpsiubnCGP34vK8BXGcb2M9eigwgvoJryrzwWA==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.13.0"
+      }
+    },
+    "@babel/helper-function-name": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-function-name/-/helper-function-name-7.12.13.tgz",
+      "integrity": "sha512-TZvmPn0UOqmvi5G4vvw0qZTpVptGkB1GL61R6lKvrSdIxGm5Pky7Q3fpKiIkQCAtRCBUwB0PaThlx9vebCDSwA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-get-function-arity": "^7.12.13",
+        "@babel/template": "^7.12.13",
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-get-function-arity": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-get-function-arity/-/helper-get-function-arity-7.12.13.tgz",
+      "integrity": "sha512-DjEVzQNz5LICkzN0REdpD5prGoidvbdYk1BVgRUOINaWJP2t6avB27X1guXK1kXNrX0WMfsrm1A/ZBthYuIMQg==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-hoist-variables": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-hoist-variables/-/helper-hoist-variables-7.13.0.tgz",
+      "integrity": "sha512-0kBzvXiIKfsCA0y6cFEIJf4OdzfpRuNk4+YTeHZpGGc666SATFKTz6sRncwFnQk7/ugJ4dSrCj6iJuvW4Qwr2g==",
+      "dev": true,
+      "requires": {
+        "@babel/traverse": "^7.13.0",
+        "@babel/types": "^7.13.0"
+      }
+    },
+    "@babel/helper-member-expression-to-functions": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.13.0.tgz",
+      "integrity": "sha512-yvRf8Ivk62JwisqV1rFRMxiSMDGnN6KH1/mDMmIrij4jztpQNRoHqqMG3U6apYbGRPJpgPalhva9Yd06HlUxJQ==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.13.0"
+      }
+    },
+    "@babel/helper-module-imports": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.12.13.tgz",
+      "integrity": "sha512-NGmfvRp9Rqxy0uHSSVP+SRIW1q31a7Ji10cLBcqSDUngGentY4FRiHOFZFE1CLU5eiL0oE8reH7Tg1y99TDM/g==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-module-transforms": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.13.0.tgz",
+      "integrity": "sha512-Ls8/VBwH577+pw7Ku1QkUWIyRRNHpYlts7+qSqBBFCW3I8QteB9DxfcZ5YJpOwH6Ihe/wn8ch7fMGOP1OhEIvw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-module-imports": "^7.12.13",
+        "@babel/helper-replace-supers": "^7.13.0",
+        "@babel/helper-simple-access": "^7.12.13",
+        "@babel/helper-split-export-declaration": "^7.12.13",
+        "@babel/helper-validator-identifier": "^7.12.11",
+        "@babel/template": "^7.12.13",
+        "@babel/traverse": "^7.13.0",
+        "@babel/types": "^7.13.0",
+        "lodash": "^4.17.19"
+      }
+    },
+    "@babel/helper-optimise-call-expression": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-optimise-call-expression/-/helper-optimise-call-expression-7.12.13.tgz",
+      "integrity": "sha512-BdWQhoVJkp6nVjB7nkFWcn43dkprYauqtk++Py2eaf/GRDFm5BxRqEIZCiHlZUGAVmtwKcsVL1dC68WmzeFmiA==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-plugin-utils": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.13.0.tgz",
+      "integrity": "sha512-ZPafIPSwzUlAoWT8DKs1W2VyF2gOWthGd5NGFMsBcMMol+ZhK+EQY/e6V96poa6PA/Bh+C9plWN0hXO1uB8AfQ==",
+      "dev": true
+    },
+    "@babel/helper-remap-async-to-generator": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-remap-async-to-generator/-/helper-remap-async-to-generator-7.13.0.tgz",
+      "integrity": "sha512-pUQpFBE9JvC9lrQbpX0TmeNIy5s7GnZjna2lhhcHC7DzgBs6fWn722Y5cfwgrtrqc7NAJwMvOa0mKhq6XaE4jg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-annotate-as-pure": "^7.12.13",
+        "@babel/helper-wrap-function": "^7.13.0",
+        "@babel/types": "^7.13.0"
+      }
+    },
+    "@babel/helper-replace-supers": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.13.0.tgz",
+      "integrity": "sha512-Segd5me1+Pz+rmN/NFBOplMbZG3SqRJOBlY+mA0SxAv6rjj7zJqr1AVr3SfzUVTLCv7ZLU5FycOM/SBGuLPbZw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-member-expression-to-functions": "^7.13.0",
+        "@babel/helper-optimise-call-expression": "^7.12.13",
+        "@babel/traverse": "^7.13.0",
+        "@babel/types": "^7.13.0"
+      }
+    },
+    "@babel/helper-simple-access": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.12.13.tgz",
+      "integrity": "sha512-0ski5dyYIHEfwpWGx5GPWhH35j342JaflmCeQmsPWcrOQDtCN6C1zKAVRFVbK53lPW2c9TsuLLSUDf0tIGJ5hA==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-skip-transparent-expression-wrappers": {
+      "version": "7.12.1",
+      "resolved": "https://registry.npmjs.org/@babel/helper-skip-transparent-expression-wrappers/-/helper-skip-transparent-expression-wrappers-7.12.1.tgz",
+      "integrity": "sha512-Mf5AUuhG1/OCChOJ/HcADmvcHM42WJockombn8ATJG3OnyiSxBK/Mm5x78BQWvmtXZKHgbjdGL2kin/HOLlZGA==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.12.1"
+      }
+    },
+    "@babel/helper-split-export-declaration": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.12.13.tgz",
+      "integrity": "sha512-tCJDltF83htUtXx5NLcaDqRmknv652ZWCHyoTETf1CXYJdPC7nohZohjUgieXhv0hTJdRf2FjDueFehdNucpzg==",
+      "dev": true,
+      "requires": {
+        "@babel/types": "^7.12.13"
+      }
+    },
+    "@babel/helper-validator-identifier": {
+      "version": "7.12.11",
+      "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.12.11.tgz",
+      "integrity": "sha512-np/lG3uARFybkoHokJUmf1QfEvRVCPbmQeUQpKow5cQ3xWrV9i3rUHodKDJPQfTVX61qKi+UdYk8kik84n7XOw==",
+      "dev": true
+    },
+    "@babel/helper-validator-option": {
+      "version": "7.12.17",
+      "resolved": "https://registry.npmjs.org/@babel/helper-validator-option/-/helper-validator-option-7.12.17.tgz",
+      "integrity": "sha512-TopkMDmLzq8ngChwRlyjR6raKD6gMSae4JdYDB8bByKreQgG0RBTuKe9LRxW3wFtUnjxOPRKBDwEH6Mg5KeDfw==",
+      "dev": true
+    },
+    "@babel/helper-wrap-function": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.13.0.tgz",
+      "integrity": "sha512-1UX9F7K3BS42fI6qd2A4BjKzgGjToscyZTdp1DjknHLCIvpgne6918io+aL5LXFcER/8QWiwpoY902pVEqgTXA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-function-name": "^7.12.13",
+        "@babel/template": "^7.12.13",
+        "@babel/traverse": "^7.13.0",
+        "@babel/types": "^7.13.0"
+      }
+    },
+    "@babel/helpers": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.13.10.tgz",
+      "integrity": "sha512-4VO883+MWPDUVRF3PhiLBUFHoX/bsLTGFpFK/HqvvfBZz2D57u9XzPVNFVBTc0PW/CWR9BXTOKt8NF4DInUHcQ==",
+      "dev": true,
+      "requires": {
+        "@babel/template": "^7.12.13",
+        "@babel/traverse": "^7.13.0",
+        "@babel/types": "^7.13.0"
+      }
+    },
+    "@babel/highlight": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.13.10.tgz",
+      "integrity": "sha512-5aPpe5XQPzflQrFwL1/QoeHkP2MsA4JCntcXHRhEsdsfPVkvPi2w7Qix4iV7t5S/oC9OodGrggd8aco1g3SZFg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-validator-identifier": "^7.12.11",
+        "chalk": "^2.0.0",
+        "js-tokens": "^4.0.0"
+      },
+      "dependencies": {
+        "ansi-styles": {
+          "version": "3.2.1",
+          "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz",
+          "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
+          "dev": true,
+          "requires": {
+            "color-convert": "^1.9.0"
+          }
         },
-        "html-entities": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/html-entities/-/html-entities-1.4.0.tgz",
-            "integrity": "sha512-8nxjcBcd8wovbeKx7h3wTji4e6+rhaVuPNpMqwWgnHh+N9ToqsCs6XztWRBPQ+UtzsoMAdKZtUENoVzU/EMtZA==",
-            "dev": true
+        "chalk": {
+          "version": "2.4.2",
+          "resolved": "https://registry.npmjs.org/chalk/-/chalk-2.4.2.tgz",
+          "integrity": "sha512-Mti+f9lpJNcwF4tWV8/OrTTtF1gZi+f8FqlyAdouralcFWFQWF2+NgCHShjkCb+IFBLq9buZwE1xckQU4peSuQ==",
+          "dev": true,
+          "requires": {
+            "ansi-styles": "^3.2.1",
+            "escape-string-regexp": "^1.0.5",
+            "supports-color": "^5.3.0"
+          }
         },
-        "http-deceiver": {
-            "version": "1.2.7",
-            "resolved": "https://registry.npmjs.org/http-deceiver/-/http-deceiver-1.2.7.tgz",
-            "integrity": "sha1-+nFolEq5pRnTN8sL7HKE3D5yPYc=",
-            "dev": true
+        "color-convert": {
+          "version": "1.9.3",
+          "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz",
+          "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
+          "dev": true,
+          "requires": {
+            "color-name": "1.1.3"
+          }
         },
-        "http-errors": {
-            "version": "1.7.2",
-            "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.7.2.tgz",
-            "integrity": "sha512-uUQBt3H/cSIVfch6i1EuPNy/YsRSOUBXTVfZ+yR7Zjez3qjBz6i9+i4zjNaoqcoFVI4lQJ5plg63TvGfRSDCRg==",
-            "dev": true,
-            "requires": {
-                "depd": "~1.1.2",
-                "inherits": "2.0.3",
-                "setprototypeof": "1.1.1",
-                "statuses": ">= 1.5.0 < 2",
-                "toidentifier": "1.0.0"
-            },
-            "dependencies": {
-                "inherits": {
-                    "version": "2.0.3",
-                    "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
-                    "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=",
-                    "dev": true
-                }
-            }
+        "color-name": {
+          "version": "1.1.3",
+          "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz",
+          "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=",
+          "dev": true
         },
-        "http-parser-js": {
-            "version": "0.5.3",
-            "resolved": "https://registry.npmjs.org/http-parser-js/-/http-parser-js-0.5.3.tgz",
-            "integrity": "sha512-t7hjvef/5HEK7RWTdUzVUhl8zkEu+LlaE0IYzdMuvbSDipxBRpOn4Uhw8ZyECEa808iVT8XCjzo6xmYt4CiLZg==",
-            "dev": true
-        },
-        "http-proxy": {
-            "version": "1.18.1",
-            "resolved": "https://registry.npmjs.org/http-proxy/-/http-proxy-1.18.1.tgz",
-            "integrity": "sha512-7mz/721AbnJwIVbnaSv1Cz3Am0ZLT/UBwkC92VlxhXv/k/BBQfM2fXElQNC27BVGr0uwUpplYPQM9LnaBMR5NQ==",
-            "dev": true,
-            "requires": {
-                "eventemitter3": "^4.0.0",
-                "follow-redirects": "^1.0.0",
-                "requires-port": "^1.0.0"
-            }
+        "has-flag": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-3.0.0.tgz",
+          "integrity": "sha1-tdRU3CGZriJWmfNGfloH87lVuv0=",
+          "dev": true
         },
-        "http-proxy-middleware": {
-            "version": "0.19.1",
-            "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-0.19.1.tgz",
-            "integrity": "sha512-yHYTgWMQO8VvwNS22eLLloAkvungsKdKTLO8AJlftYIKNfJr3GK3zK0ZCfzDDGUBttdGc8xFy1mCitvNKQtC3Q==",
-            "dev": true,
-            "requires": {
-                "http-proxy": "^1.17.0",
-                "is-glob": "^4.0.0",
-                "lodash": "^4.17.11",
-                "micromatch": "^3.1.10"
-            },
-            "dependencies": {
-                "braces": {
-                    "version": "2.3.2",
-                    "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-                    "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-                    "dev": true,
-                    "requires": {
-                        "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"
-                    },
-                    "dependencies": {
-                        "extend-shallow": {
-                            "version": "2.0.1",
-                            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                            "dev": true,
-                            "requires": {
-                                "is-extendable": "^0.1.0"
-                            }
-                        }
-                    }
-                },
-                "fill-range": {
-                    "version": "4.0.0",
-                    "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-                    "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-                    "dev": true,
-                    "requires": {
-                        "extend-shallow": "^2.0.1",
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1",
-                        "to-regex-range": "^2.1.0"
-                    },
-                    "dependencies": {
-                        "extend-shallow": {
-                            "version": "2.0.1",
-                            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                            "dev": true,
-                            "requires": {
-                                "is-extendable": "^0.1.0"
-                            }
-                        }
-                    }
-                },
-                "is-number": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-                    "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^3.0.2"
-                    },
-                    "dependencies": {
-                        "kind-of": {
-                            "version": "3.2.2",
-                            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                            "dev": true,
-                            "requires": {
-                                "is-buffer": "^1.1.5"
-                            }
-                        }
-                    }
-                },
-                "micromatch": {
-                    "version": "3.1.10",
-                    "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
-                    "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
-                    "dev": true,
-                    "requires": {
-                        "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"
-                    }
-                },
-                "to-regex-range": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-                    "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-                    "dev": true,
-                    "requires": {
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1"
-                    }
-                }
-            }
+        "supports-color": {
+          "version": "5.5.0",
+          "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-5.5.0.tgz",
+          "integrity": "sha512-QjVjwdXIt408MIiAqCX4oUKsgU2EqAGzs2Ppkm4aQYbjm+ZEWEcW4SfFNTr4uMNZma0ey4f5lgLrkB0aX0QMow==",
+          "dev": true,
+          "requires": {
+            "has-flag": "^3.0.0"
+          }
+        }
+      }
+    },
+    "@babel/parser": {
+      "version": "7.13.11",
+      "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.13.11.tgz",
+      "integrity": "sha512-PhuoqeHoO9fc4ffMEVk4qb/w/s2iOSWohvbHxLtxui0eBg3Lg5gN1U8wp1V1u61hOWkPQJJyJzGH6Y+grwkq8Q==",
+      "dev": true
+    },
+    "@babel/plugin-proposal-async-generator-functions": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-async-generator-functions/-/plugin-proposal-async-generator-functions-7.13.8.tgz",
+      "integrity": "sha512-rPBnhj+WgoSmgq+4gQUtXx/vOcU+UYtjy1AA/aeD61Hwj410fwYyqfUcRP3lR8ucgliVJL/G7sXcNUecC75IXA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-remap-async-to-generator": "^7.13.0",
+        "@babel/plugin-syntax-async-generators": "^7.8.4"
+      }
+    },
+    "@babel/plugin-proposal-class-properties": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-class-properties/-/plugin-proposal-class-properties-7.13.0.tgz",
+      "integrity": "sha512-KnTDjFNC1g+45ka0myZNvSBFLhNCLN+GeGYLDEA8Oq7MZ6yMgfLoIRh86GRT0FjtJhZw8JyUskP9uvj5pHM9Zg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-create-class-features-plugin": "^7.13.0",
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-proposal-dynamic-import": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-dynamic-import/-/plugin-proposal-dynamic-import-7.13.8.tgz",
+      "integrity": "sha512-ONWKj0H6+wIRCkZi9zSbZtE/r73uOhMVHh256ys0UzfM7I3d4n+spZNWjOnJv2gzopumP2Wxi186vI8N0Y2JyQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/plugin-syntax-dynamic-import": "^7.8.3"
+      }
+    },
+    "@babel/plugin-proposal-export-namespace-from": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-export-namespace-from/-/plugin-proposal-export-namespace-from-7.12.13.tgz",
+      "integrity": "sha512-INAgtFo4OnLN3Y/j0VwAgw3HDXcDtX+C/erMvWzuV9v71r7urb6iyMXu7eM9IgLr1ElLlOkaHjJ0SbCmdOQ3Iw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13",
+        "@babel/plugin-syntax-export-namespace-from": "^7.8.3"
+      }
+    },
+    "@babel/plugin-proposal-json-strings": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-json-strings/-/plugin-proposal-json-strings-7.13.8.tgz",
+      "integrity": "sha512-w4zOPKUFPX1mgvTmL/fcEqy34hrQ1CRcGxdphBc6snDnnqJ47EZDIyop6IwXzAC8G916hsIuXB2ZMBCExC5k7Q==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/plugin-syntax-json-strings": "^7.8.3"
+      }
+    },
+    "@babel/plugin-proposal-logical-assignment-operators": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-logical-assignment-operators/-/plugin-proposal-logical-assignment-operators-7.13.8.tgz",
+      "integrity": "sha512-aul6znYB4N4HGweImqKn59Su9RS8lbUIqxtXTOcAGtNIDczoEFv+l1EhmX8rUBp3G1jMjKJm8m0jXVp63ZpS4A==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/plugin-syntax-logical-assignment-operators": "^7.10.4"
+      }
+    },
+    "@babel/plugin-proposal-nullish-coalescing-operator": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-nullish-coalescing-operator/-/plugin-proposal-nullish-coalescing-operator-7.13.8.tgz",
+      "integrity": "sha512-iePlDPBn//UhxExyS9KyeYU7RM9WScAG+D3Hhno0PLJebAEpDZMocbDe64eqynhNAnwz/vZoL/q/QB2T1OH39A==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3"
+      }
+    },
+    "@babel/plugin-proposal-numeric-separator": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-numeric-separator/-/plugin-proposal-numeric-separator-7.12.13.tgz",
+      "integrity": "sha512-O1jFia9R8BUCl3ZGB7eitaAPu62TXJRHn7rh+ojNERCFyqRwJMTmhz+tJ+k0CwI6CLjX/ee4qW74FSqlq9I35w==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13",
+        "@babel/plugin-syntax-numeric-separator": "^7.10.4"
+      }
+    },
+    "@babel/plugin-proposal-object-rest-spread": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-object-rest-spread/-/plugin-proposal-object-rest-spread-7.13.8.tgz",
+      "integrity": "sha512-DhB2EuB1Ih7S3/IRX5AFVgZ16k3EzfRbq97CxAVI1KSYcW+lexV8VZb7G7L8zuPVSdQMRn0kiBpf/Yzu9ZKH0g==",
+      "dev": true,
+      "requires": {
+        "@babel/compat-data": "^7.13.8",
+        "@babel/helper-compilation-targets": "^7.13.8",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/plugin-syntax-object-rest-spread": "^7.8.3",
+        "@babel/plugin-transform-parameters": "^7.13.0"
+      }
+    },
+    "@babel/plugin-proposal-optional-catch-binding": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-optional-catch-binding/-/plugin-proposal-optional-catch-binding-7.13.8.tgz",
+      "integrity": "sha512-0wS/4DUF1CuTmGo+NiaHfHcVSeSLj5S3e6RivPTg/2k3wOv3jO35tZ6/ZWsQhQMvdgI7CwphjQa/ccarLymHVA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/plugin-syntax-optional-catch-binding": "^7.8.3"
+      }
+    },
+    "@babel/plugin-proposal-optional-chaining": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-optional-chaining/-/plugin-proposal-optional-chaining-7.13.8.tgz",
+      "integrity": "sha512-hpbBwbTgd7Cz1QryvwJZRo1U0k1q8uyBmeXOSQUjdg/A2TASkhR/rz7AyqZ/kS8kbpsNA80rOYbxySBJAqmhhQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.12.1",
+        "@babel/plugin-syntax-optional-chaining": "^7.8.3"
+      }
+    },
+    "@babel/plugin-proposal-private-methods": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-private-methods/-/plugin-proposal-private-methods-7.13.0.tgz",
+      "integrity": "sha512-MXyyKQd9inhx1kDYPkFRVOBXQ20ES8Pto3T7UZ92xj2mY0EVD8oAVzeyYuVfy/mxAdTSIayOvg+aVzcHV2bn6Q==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-create-class-features-plugin": "^7.13.0",
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-proposal-unicode-property-regex": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-unicode-property-regex/-/plugin-proposal-unicode-property-regex-7.12.13.tgz",
+      "integrity": "sha512-XyJmZidNfofEkqFV5VC/bLabGmO5QzenPO/YOfGuEbgU+2sSwMmio3YLb4WtBgcmmdwZHyVyv8on77IUjQ5Gvg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-create-regexp-features-plugin": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-syntax-async-generators": {
+      "version": "7.8.4",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-async-generators/-/plugin-syntax-async-generators-7.8.4.tgz",
+      "integrity": "sha512-tycmZxkGfZaxhMRbXlPXuVFpdWlXpir2W4AMhSJgRKzk/eDlIXOhb2LHWoLpDF7TEHylV5zNhykX6KAgHJmTNw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      }
+    },
+    "@babel/plugin-syntax-class-properties": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-class-properties/-/plugin-syntax-class-properties-7.12.13.tgz",
+      "integrity": "sha512-fm4idjKla0YahUNgFNLCB0qySdsoPiZP3iQE3rky0mBUtMZ23yDJ9SJdg6dXTSDnulOVqiF3Hgr9nbXvXTQZYA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-syntax-dynamic-import": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-dynamic-import/-/plugin-syntax-dynamic-import-7.8.3.tgz",
+      "integrity": "sha512-5gdGbFon+PszYzqs83S3E5mpi7/y/8M9eC90MRTZfduQOYW76ig6SOSPNe41IG5LoP3FGBn2N0RjVDSQiS94kQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      }
+    },
+    "@babel/plugin-syntax-export-namespace-from": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-export-namespace-from/-/plugin-syntax-export-namespace-from-7.8.3.tgz",
+      "integrity": "sha512-MXf5laXo6c1IbEbegDmzGPwGNTsHZmEy6QGznu5Sh2UCWvueywb2ee+CCE4zQiZstxU9BMoQO9i6zUFSY0Kj0Q==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.3"
+      }
+    },
+    "@babel/plugin-syntax-json-strings": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-json-strings/-/plugin-syntax-json-strings-7.8.3.tgz",
+      "integrity": "sha512-lY6kdGpWHvjoe2vk4WrAapEuBR69EMxZl+RoGRhrFGNYVK8mOPAW8VfbT/ZgrFbXlDNiiaxQnAtgVCZ6jv30EA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      }
+    },
+    "@babel/plugin-syntax-logical-assignment-operators": {
+      "version": "7.10.4",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-logical-assignment-operators/-/plugin-syntax-logical-assignment-operators-7.10.4.tgz",
+      "integrity": "sha512-d8waShlpFDinQ5MtvGU9xDAOzKH47+FFoney2baFIoMr952hKOLp1HR7VszoZvOsV/4+RRszNY7D17ba0te0ig==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.10.4"
+      }
+    },
+    "@babel/plugin-syntax-nullish-coalescing-operator": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-nullish-coalescing-operator/-/plugin-syntax-nullish-coalescing-operator-7.8.3.tgz",
+      "integrity": "sha512-aSff4zPII1u2QD7y+F8oDsz19ew4IGEJg9SVW+bqwpwtfFleiQDMdzA/R+UlWDzfnHFCxxleFT0PMIrR36XLNQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      }
+    },
+    "@babel/plugin-syntax-numeric-separator": {
+      "version": "7.10.4",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-numeric-separator/-/plugin-syntax-numeric-separator-7.10.4.tgz",
+      "integrity": "sha512-9H6YdfkcK/uOnY/K7/aA2xpzaAgkQn37yzWUMRK7OaPOqOpGS1+n0H5hxT9AUw9EsSjPW8SVyMJwYRtWs3X3ug==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.10.4"
+      }
+    },
+    "@babel/plugin-syntax-object-rest-spread": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-object-rest-spread/-/plugin-syntax-object-rest-spread-7.8.3.tgz",
+      "integrity": "sha512-XoqMijGZb9y3y2XskN+P1wUGiVwWZ5JmoDRwx5+3GmEplNyVM2s2Dg8ILFQm8rWM48orGy5YpI5Bl8U1y7ydlA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      }
+    },
+    "@babel/plugin-syntax-optional-catch-binding": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-optional-catch-binding/-/plugin-syntax-optional-catch-binding-7.8.3.tgz",
+      "integrity": "sha512-6VPD0Pc1lpTqw0aKoeRTMiB+kWhAoT24PA+ksWSBrFtl5SIRVpZlwN3NNPQjehA2E/91FV3RjLWoVTglWcSV3Q==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      }
+    },
+    "@babel/plugin-syntax-optional-chaining": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-optional-chaining/-/plugin-syntax-optional-chaining-7.8.3.tgz",
+      "integrity": "sha512-KoK9ErH1MBlCPxV0VANkXW2/dw4vlbGDrFgz8bmUsBGYkFRcbRwMh6cIJubdPrkxRwuGdtCk0v/wPTKbQgBjkg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      }
+    },
+    "@babel/plugin-syntax-top-level-await": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-top-level-await/-/plugin-syntax-top-level-await-7.12.13.tgz",
+      "integrity": "sha512-A81F9pDwyS7yM//KwbCSDqy3Uj4NMIurtplxphWxoYtNPov7cJsDkAFNNyVlIZ3jwGycVsurZ+LtOA8gZ376iQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-syntax-typescript": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-typescript/-/plugin-syntax-typescript-7.12.13.tgz",
+      "integrity": "sha512-cHP3u1JiUiG2LFDKbXnwVad81GvfyIOmCD6HIEId6ojrY0Drfy2q1jw7BwN7dE84+kTnBjLkXoL3IEy/3JPu2w==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-arrow-functions": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.13.0.tgz",
+      "integrity": "sha512-96lgJagobeVmazXFaDrbmCLQxBysKu7U6Do3mLsx27gf5Dk85ezysrs2BZUpXD703U/Su1xTBDxxar2oa4jAGg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-async-to-generator": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.13.0.tgz",
+      "integrity": "sha512-3j6E004Dx0K3eGmhxVJxwwI89CTJrce7lg3UrtFuDAVQ/2+SJ/h/aSFOeE6/n0WB1GsOffsJp6MnPQNQ8nmwhg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-module-imports": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-remap-async-to-generator": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-block-scoped-functions": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.12.13.tgz",
+      "integrity": "sha512-zNyFqbc3kI/fVpqwfqkg6RvBgFpC4J18aKKMmv7KdQ/1GgREapSJAykLMVNwfRGO3BtHj3YQZl8kxCXPcVMVeg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-block-scoping": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.12.13.tgz",
+      "integrity": "sha512-Pxwe0iqWJX4fOOM2kEZeUuAxHMWb9nK+9oh5d11bsLoB0xMg+mkDpt0eYuDZB7ETrY9bbcVlKUGTOGWy7BHsMQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-classes": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.13.0.tgz",
+      "integrity": "sha512-9BtHCPUARyVH1oXGcSJD3YpsqRLROJx5ZNP6tN5vnk17N0SVf9WCtf8Nuh1CFmgByKKAIMstitKduoCmsaDK5g==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-annotate-as-pure": "^7.12.13",
+        "@babel/helper-function-name": "^7.12.13",
+        "@babel/helper-optimise-call-expression": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-replace-supers": "^7.13.0",
+        "@babel/helper-split-export-declaration": "^7.12.13",
+        "globals": "^11.1.0"
+      },
+      "dependencies": {
+        "globals": {
+          "version": "11.12.0",
+          "resolved": "https://registry.npmjs.org/globals/-/globals-11.12.0.tgz",
+          "integrity": "sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==",
+          "dev": true
+        }
+      }
+    },
+    "@babel/plugin-transform-computed-properties": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.13.0.tgz",
+      "integrity": "sha512-RRqTYTeZkZAz8WbieLTvKUEUxZlUTdmL5KGMyZj7FnMfLNKV4+r5549aORG/mgojRmFlQMJDUupwAMiF2Q7OUg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-destructuring": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.13.0.tgz",
+      "integrity": "sha512-zym5em7tePoNT9s964c0/KU3JPPnuq7VhIxPRefJ4/s82cD+q1mgKfuGRDMCPL0HTyKz4dISuQlCusfgCJ86HA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-dotall-regex": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.12.13.tgz",
+      "integrity": "sha512-foDrozE65ZFdUC2OfgeOCrEPTxdB3yjqxpXh8CH+ipd9CHd4s/iq81kcUpyH8ACGNEPdFqbtzfgzbT/ZGlbDeQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-create-regexp-features-plugin": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-duplicate-keys": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.12.13.tgz",
+      "integrity": "sha512-NfADJiiHdhLBW3pulJlJI2NB0t4cci4WTZ8FtdIuNc2+8pslXdPtRRAEWqUY+m9kNOk2eRYbTAOipAxlrOcwwQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-exponentiation-operator": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.12.13.tgz",
+      "integrity": "sha512-fbUelkM1apvqez/yYx1/oICVnGo2KM5s63mhGylrmXUxK/IAXSIf87QIxVfZldWf4QsOafY6vV3bX8aMHSvNrA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-builder-binary-assignment-operator-visitor": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-for-of": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.13.0.tgz",
+      "integrity": "sha512-IHKT00mwUVYE0zzbkDgNRP6SRzvfGCYsOxIRz8KsiaaHCcT9BWIkO+H9QRJseHBLOGBZkHUdHiqj6r0POsdytg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-function-name": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.12.13.tgz",
+      "integrity": "sha512-6K7gZycG0cmIwwF7uMK/ZqeCikCGVBdyP2J5SKNCXO5EOHcqi+z7Jwf8AmyDNcBgxET8DrEtCt/mPKPyAzXyqQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-function-name": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-literals": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.12.13.tgz",
+      "integrity": "sha512-FW+WPjSR7hiUxMcKqyNjP05tQ2kmBCdpEpZHY1ARm96tGQCCBvXKnpjILtDplUnJ/eHZ0lALLM+d2lMFSpYJrQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-member-expression-literals": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.12.13.tgz",
+      "integrity": "sha512-kxLkOsg8yir4YeEPHLuO2tXP9R/gTjpuTOjshqSpELUN3ZAg2jfDnKUvzzJxObun38sw3wm4Uu69sX/zA7iRvg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-modules-amd": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.13.0.tgz",
+      "integrity": "sha512-EKy/E2NHhY/6Vw5d1k3rgoobftcNUmp9fGjb9XZwQLtTctsRBOTRO7RHHxfIky1ogMN5BxN7p9uMA3SzPfotMQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-module-transforms": "^7.13.0",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "babel-plugin-dynamic-import-node": "^2.3.3"
+      }
+    },
+    "@babel/plugin-transform-modules-commonjs": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.13.8.tgz",
+      "integrity": "sha512-9QiOx4MEGglfYZ4XOnU79OHr6vIWUakIj9b4mioN8eQIoEh+pf5p/zEB36JpDFWA12nNMiRf7bfoRvl9Rn79Bw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-module-transforms": "^7.13.0",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-simple-access": "^7.12.13",
+        "babel-plugin-dynamic-import-node": "^2.3.3"
+      }
+    },
+    "@babel/plugin-transform-modules-systemjs": {
+      "version": "7.13.8",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.13.8.tgz",
+      "integrity": "sha512-hwqctPYjhM6cWvVIlOIe27jCIBgHCsdH2xCJVAYQm7V5yTMoilbVMi9f6wKg0rpQAOn6ZG4AOyvCqFF/hUh6+A==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-hoist-variables": "^7.13.0",
+        "@babel/helper-module-transforms": "^7.13.0",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-validator-identifier": "^7.12.11",
+        "babel-plugin-dynamic-import-node": "^2.3.3"
+      }
+    },
+    "@babel/plugin-transform-modules-umd": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.13.0.tgz",
+      "integrity": "sha512-D/ILzAh6uyvkWjKKyFE/W0FzWwasv6vPTSqPcjxFqn6QpX3u8DjRVliq4F2BamO2Wee/om06Vyy+vPkNrd4wxw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-module-transforms": "^7.13.0",
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-named-capturing-groups-regex": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-named-capturing-groups-regex/-/plugin-transform-named-capturing-groups-regex-7.12.13.tgz",
+      "integrity": "sha512-Xsm8P2hr5hAxyYblrfACXpQKdQbx4m2df9/ZZSQ8MAhsadw06+jW7s9zsSw6he+mJZXRlVMyEnVktJo4zjk1WA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-create-regexp-features-plugin": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-new-target": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.12.13.tgz",
+      "integrity": "sha512-/KY2hbLxrG5GTQ9zzZSc3xWiOy379pIETEhbtzwZcw9rvuaVV4Fqy7BYGYOWZnaoXIQYbbJ0ziXLa/sKcGCYEQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-object-super": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.12.13.tgz",
+      "integrity": "sha512-JzYIcj3XtYspZDV8j9ulnoMPZZnF/Cj0LUxPOjR89BdBVx+zYJI9MdMIlUZjbXDX+6YVeS6I3e8op+qQ3BYBoQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13",
+        "@babel/helper-replace-supers": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-parameters": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.13.0.tgz",
+      "integrity": "sha512-Jt8k/h/mIwE2JFEOb3lURoY5C85ETcYPnbuAJ96zRBzh1XHtQZfs62ChZ6EP22QlC8c7Xqr9q+e1SU5qttwwjw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-property-literals": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.12.13.tgz",
+      "integrity": "sha512-nqVigwVan+lR+g8Fj8Exl0UQX2kymtjcWfMOYM1vTYEKujeyv2SkMgazf2qNcK7l4SDiKyTA/nHCPqL4e2zo1A==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-regenerator": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.12.13.tgz",
+      "integrity": "sha512-lxb2ZAvSLyJ2PEe47hoGWPmW22v7CtSl9jW8mingV4H2sEX/JOcrAj2nPuGWi56ERUm2bUpjKzONAuT6HCn2EA==",
+      "dev": true,
+      "requires": {
+        "regenerator-transform": "^0.14.2"
+      }
+    },
+    "@babel/plugin-transform-reserved-words": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.12.13.tgz",
+      "integrity": "sha512-xhUPzDXxZN1QfiOy/I5tyye+TRz6lA7z6xaT4CLOjPRMVg1ldRf0LHw0TDBpYL4vG78556WuHdyO9oi5UmzZBg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-runtime": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-runtime/-/plugin-transform-runtime-7.13.10.tgz",
+      "integrity": "sha512-Y5k8ipgfvz5d/76tx7JYbKQTcgFSU6VgJ3kKQv4zGTKr+a9T/KBvfRvGtSFgKDQGt/DBykQixV0vNWKIdzWErA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-module-imports": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "babel-plugin-polyfill-corejs2": "^0.1.4",
+        "babel-plugin-polyfill-corejs3": "^0.1.3",
+        "babel-plugin-polyfill-regenerator": "^0.1.2",
+        "semver": "^6.3.0"
+      },
+      "dependencies": {
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
+        }
+      }
+    },
+    "@babel/plugin-transform-shorthand-properties": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.12.13.tgz",
+      "integrity": "sha512-xpL49pqPnLtf0tVluuqvzWIgLEhuPpZzvs2yabUHSKRNlN7ScYU7aMlmavOeyXJZKgZKQRBlh8rHbKiJDraTSw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-spread": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.13.0.tgz",
+      "integrity": "sha512-V6vkiXijjzYeFmQTr3dBxPtZYLPcUfY34DebOU27jIl2M/Y8Egm52Hw82CSjjPqd54GTlJs5x+CR7HeNr24ckg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.12.1"
+      }
+    },
+    "@babel/plugin-transform-sticky-regex": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.12.13.tgz",
+      "integrity": "sha512-Jc3JSaaWT8+fr7GRvQP02fKDsYk4K/lYwWq38r/UGfaxo89ajud321NH28KRQ7xy1Ybc0VUE5Pz8psjNNDUglg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-template-literals": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.13.0.tgz",
+      "integrity": "sha512-d67umW6nlfmr1iehCcBv69eSUSySk1EsIS8aTDX4Xo9qajAh6mYtcl4kJrBkGXuxZPEgVr7RVfAvNW6YQkd4Mw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0"
+      }
+    },
+    "@babel/plugin-transform-typeof-symbol": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.12.13.tgz",
+      "integrity": "sha512-eKv/LmUJpMnu4npgfvs3LiHhJua5fo/CysENxa45YCQXZwKnGCQKAg87bvoqSW1fFT+HA32l03Qxsm8ouTY3ZQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-typescript": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typescript/-/plugin-transform-typescript-7.13.0.tgz",
+      "integrity": "sha512-elQEwluzaU8R8dbVuW2Q2Y8Nznf7hnjM7+DSCd14Lo5fF63C9qNLbwZYbmZrtV9/ySpSUpkRpQXvJb6xyu4hCQ==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-create-class-features-plugin": "^7.13.0",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/plugin-syntax-typescript": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-unicode-escapes": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.12.13.tgz",
+      "integrity": "sha512-0bHEkdwJ/sN/ikBHfSmOXPypN/beiGqjo+o4/5K+vxEFNPRPdImhviPakMKG4x96l85emoa0Z6cDflsdBusZbw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/plugin-transform-unicode-regex": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.12.13.tgz",
+      "integrity": "sha512-mDRzSNY7/zopwisPZ5kM9XKCfhchqIYwAKRERtEnhYscZB79VRekuRSoYbN0+KVe3y8+q1h6A4svXtP7N+UoCA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-create-regexp-features-plugin": "^7.12.13",
+        "@babel/helper-plugin-utils": "^7.12.13"
+      }
+    },
+    "@babel/preset-env": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.13.10.tgz",
+      "integrity": "sha512-nOsTScuoRghRtUsRr/c69d042ysfPHcu+KOB4A9aAO9eJYqrkat+LF8G1yp1HD18QiwixT2CisZTr/0b3YZPXQ==",
+      "dev": true,
+      "requires": {
+        "@babel/compat-data": "^7.13.8",
+        "@babel/helper-compilation-targets": "^7.13.10",
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-validator-option": "^7.12.17",
+        "@babel/plugin-proposal-async-generator-functions": "^7.13.8",
+        "@babel/plugin-proposal-class-properties": "^7.13.0",
+        "@babel/plugin-proposal-dynamic-import": "^7.13.8",
+        "@babel/plugin-proposal-export-namespace-from": "^7.12.13",
+        "@babel/plugin-proposal-json-strings": "^7.13.8",
+        "@babel/plugin-proposal-logical-assignment-operators": "^7.13.8",
+        "@babel/plugin-proposal-nullish-coalescing-operator": "^7.13.8",
+        "@babel/plugin-proposal-numeric-separator": "^7.12.13",
+        "@babel/plugin-proposal-object-rest-spread": "^7.13.8",
+        "@babel/plugin-proposal-optional-catch-binding": "^7.13.8",
+        "@babel/plugin-proposal-optional-chaining": "^7.13.8",
+        "@babel/plugin-proposal-private-methods": "^7.13.0",
+        "@babel/plugin-proposal-unicode-property-regex": "^7.12.13",
+        "@babel/plugin-syntax-async-generators": "^7.8.4",
+        "@babel/plugin-syntax-class-properties": "^7.12.13",
+        "@babel/plugin-syntax-dynamic-import": "^7.8.3",
+        "@babel/plugin-syntax-export-namespace-from": "^7.8.3",
+        "@babel/plugin-syntax-json-strings": "^7.8.3",
+        "@babel/plugin-syntax-logical-assignment-operators": "^7.10.4",
+        "@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3",
+        "@babel/plugin-syntax-numeric-separator": "^7.10.4",
+        "@babel/plugin-syntax-object-rest-spread": "^7.8.3",
+        "@babel/plugin-syntax-optional-catch-binding": "^7.8.3",
+        "@babel/plugin-syntax-optional-chaining": "^7.8.3",
+        "@babel/plugin-syntax-top-level-await": "^7.12.13",
+        "@babel/plugin-transform-arrow-functions": "^7.13.0",
+        "@babel/plugin-transform-async-to-generator": "^7.13.0",
+        "@babel/plugin-transform-block-scoped-functions": "^7.12.13",
+        "@babel/plugin-transform-block-scoping": "^7.12.13",
+        "@babel/plugin-transform-classes": "^7.13.0",
+        "@babel/plugin-transform-computed-properties": "^7.13.0",
+        "@babel/plugin-transform-destructuring": "^7.13.0",
+        "@babel/plugin-transform-dotall-regex": "^7.12.13",
+        "@babel/plugin-transform-duplicate-keys": "^7.12.13",
+        "@babel/plugin-transform-exponentiation-operator": "^7.12.13",
+        "@babel/plugin-transform-for-of": "^7.13.0",
+        "@babel/plugin-transform-function-name": "^7.12.13",
+        "@babel/plugin-transform-literals": "^7.12.13",
+        "@babel/plugin-transform-member-expression-literals": "^7.12.13",
+        "@babel/plugin-transform-modules-amd": "^7.13.0",
+        "@babel/plugin-transform-modules-commonjs": "^7.13.8",
+        "@babel/plugin-transform-modules-systemjs": "^7.13.8",
+        "@babel/plugin-transform-modules-umd": "^7.13.0",
+        "@babel/plugin-transform-named-capturing-groups-regex": "^7.12.13",
+        "@babel/plugin-transform-new-target": "^7.12.13",
+        "@babel/plugin-transform-object-super": "^7.12.13",
+        "@babel/plugin-transform-parameters": "^7.13.0",
+        "@babel/plugin-transform-property-literals": "^7.12.13",
+        "@babel/plugin-transform-regenerator": "^7.12.13",
+        "@babel/plugin-transform-reserved-words": "^7.12.13",
+        "@babel/plugin-transform-shorthand-properties": "^7.12.13",
+        "@babel/plugin-transform-spread": "^7.13.0",
+        "@babel/plugin-transform-sticky-regex": "^7.12.13",
+        "@babel/plugin-transform-template-literals": "^7.13.0",
+        "@babel/plugin-transform-typeof-symbol": "^7.12.13",
+        "@babel/plugin-transform-unicode-escapes": "^7.12.13",
+        "@babel/plugin-transform-unicode-regex": "^7.12.13",
+        "@babel/preset-modules": "^0.1.4",
+        "@babel/types": "^7.13.0",
+        "babel-plugin-polyfill-corejs2": "^0.1.4",
+        "babel-plugin-polyfill-corejs3": "^0.1.3",
+        "babel-plugin-polyfill-regenerator": "^0.1.2",
+        "core-js-compat": "^3.9.0",
+        "semver": "^6.3.0"
+      },
+      "dependencies": {
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
+        }
+      }
+    },
+    "@babel/preset-modules": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/@babel/preset-modules/-/preset-modules-0.1.4.tgz",
+      "integrity": "sha512-J36NhwnfdzpmH41M1DrnkkgAqhZaqr/NBdPfQ677mLzlaXo+oDiv1deyCDtgAhz8p328otdob0Du7+xgHGZbKg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.0.0",
+        "@babel/plugin-proposal-unicode-property-regex": "^7.4.4",
+        "@babel/plugin-transform-dotall-regex": "^7.4.4",
+        "@babel/types": "^7.4.4",
+        "esutils": "^2.0.2"
+      }
+    },
+    "@babel/preset-typescript": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/preset-typescript/-/preset-typescript-7.13.0.tgz",
+      "integrity": "sha512-LXJwxrHy0N3f6gIJlYbLta1D9BDtHpQeqwzM0LIfjDlr6UE/D5Mc7W4iDiQzaE+ks0sTjT26ArcHWnJVt0QiHw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-plugin-utils": "^7.13.0",
+        "@babel/helper-validator-option": "^7.12.17",
+        "@babel/plugin-transform-typescript": "^7.13.0"
+      }
+    },
+    "@babel/runtime": {
+      "version": "7.13.10",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.13.10.tgz",
+      "integrity": "sha512-4QPkjJq6Ns3V/RgpEahRk+AGfL0eO6RHHtTWoNNr5mO49G6B5+X6d6THgWEAvTrznU5xYpbAlVKRYcsCgh/Akw==",
+      "requires": {
+        "regenerator-runtime": "^0.13.4"
+      }
+    },
+    "@babel/template": {
+      "version": "7.12.13",
+      "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.12.13.tgz",
+      "integrity": "sha512-/7xxiGA57xMo/P2GVvdEumr8ONhFOhfgq2ihK3h1e6THqzTAkHbkXgB0xI9yeTfIUoH3+oAeHhqm/I43OTbbjA==",
+      "dev": true,
+      "requires": {
+        "@babel/code-frame": "^7.12.13",
+        "@babel/parser": "^7.12.13",
+        "@babel/types": "^7.12.13"
+      },
+      "dependencies": {
+        "@babel/code-frame": {
+          "version": "7.12.13",
+          "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
+          "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
+          "dev": true,
+          "requires": {
+            "@babel/highlight": "^7.12.13"
+          }
+        }
+      }
+    },
+    "@babel/traverse": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.13.0.tgz",
+      "integrity": "sha512-xys5xi5JEhzC3RzEmSGrs/b3pJW/o87SypZ+G/PhaE7uqVQNv/jlmVIBXuoh5atqQ434LfXV+sf23Oxj0bchJQ==",
+      "dev": true,
+      "requires": {
+        "@babel/code-frame": "^7.12.13",
+        "@babel/generator": "^7.13.0",
+        "@babel/helper-function-name": "^7.12.13",
+        "@babel/helper-split-export-declaration": "^7.12.13",
+        "@babel/parser": "^7.13.0",
+        "@babel/types": "^7.13.0",
+        "debug": "^4.1.0",
+        "globals": "^11.1.0",
+        "lodash": "^4.17.19"
+      },
+      "dependencies": {
+        "@babel/code-frame": {
+          "version": "7.12.13",
+          "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.12.13.tgz",
+          "integrity": "sha512-HV1Cm0Q3ZrpCR93tkWOYiuYIgLxZXZFVG2VgK+MBWjUqZTundupbfx2aXarXuw5Ko5aMcjtJgbSs4vUGBS5v6g==",
+          "dev": true,
+          "requires": {
+            "@babel/highlight": "^7.12.13"
+          }
         },
-        "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
-        },
-        "iconv-lite": {
-            "version": "0.4.24",
-            "resolved": "https://registry.npmjs.org/iconv-lite/-/iconv-lite-0.4.24.tgz",
-            "integrity": "sha512-v3MXnZAcvnywkTUEZomIActle7RXXeedOR31wwl7VlyoXO4Qi9arvSenNQWne1TcRwhCL1HwLI21bEqdpj8/rA==",
-            "dev": true,
-            "requires": {
-                "safer-buffer": ">= 2.1.2 < 3"
-            }
+        "globals": {
+          "version": "11.12.0",
+          "resolved": "https://registry.npmjs.org/globals/-/globals-11.12.0.tgz",
+          "integrity": "sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==",
+          "dev": true
+        }
+      }
+    },
+    "@babel/types": {
+      "version": "7.13.0",
+      "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.13.0.tgz",
+      "integrity": "sha512-hE+HE8rnG1Z6Wzo+MhaKE5lM5eMx71T4EHJgku2E3xIfaULhDcxiiRxUYgwX8qwP1BBSlag+TdGOt6JAidIZTA==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-validator-identifier": "^7.12.11",
+        "lodash": "^4.17.19",
+        "to-fast-properties": "^2.0.0"
+      }
+    },
+    "@discoveryjs/json-ext": {
+      "version": "0.5.2",
+      "resolved": "https://registry.npmjs.org/@discoveryjs/json-ext/-/json-ext-0.5.2.tgz",
+      "integrity": "sha512-HyYEUDeIj5rRQU2Hk5HTB2uHsbRQpF70nvMhVzi+VJR0X+xNEhjPui4/kBf3VeH/wqD28PT4sVOm8qqLjBrSZg==",
+      "dev": true
+    },
+    "@eslint/eslintrc": {
+      "version": "0.4.0",
+      "resolved": "https://registry.npmjs.org/@eslint/eslintrc/-/eslintrc-0.4.0.tgz",
+      "integrity": "sha512-2ZPCc+uNbjV5ERJr+aKSPRwZgKd2z11x0EgLvb1PURmUrn9QNRXFqje0Ldq454PfAVyaJYyrDvvIKSFP4NnBog==",
+      "dev": true,
+      "requires": {
+        "ajv": "^6.12.4",
+        "debug": "^4.1.1",
+        "espree": "^7.3.0",
+        "globals": "^12.1.0",
+        "ignore": "^4.0.6",
+        "import-fresh": "^3.2.1",
+        "js-yaml": "^3.13.1",
+        "minimatch": "^3.0.4",
+        "strip-json-comments": "^3.1.1"
+      },
+      "dependencies": {
+        "globals": {
+          "version": "12.4.0",
+          "resolved": "https://registry.npmjs.org/globals/-/globals-12.4.0.tgz",
+          "integrity": "sha512-BWICuzzDvDoH54NHKCseDanAhE3CeDorgDL5MT6LMXXj2WCnd9UC2szdk4AWLfjdgNBCXLUanXYcpBBKOSWGwg==",
+          "dev": true,
+          "requires": {
+            "type-fest": "^0.8.1"
+          }
         },
         "ignore": {
-            "version": "5.1.8",
-            "resolved": "https://registry.npmjs.org/ignore/-/ignore-5.1.8.tgz",
-            "integrity": "sha512-BMpfD7PpiETpBl/A6S498BaIJ6Y/ABT93ETbby2fP00v4EbvPBXWEoaR1UBPKs3iR53pJY7EtZk5KACI57i1Uw==",
-            "dev": true
-        },
-        "import-fresh": {
-            "version": "3.3.0",
-            "resolved": "https://registry.npmjs.org/import-fresh/-/import-fresh-3.3.0.tgz",
-            "integrity": "sha512-veYYhQa+D1QBKznvhUHxb8faxlrwUnxseDAbAp457E0wLNio2bOSKnjYDhMj+YiAq61xrMGhQk9iXVk5FzgQMw==",
-            "dev": true,
-            "requires": {
-                "parent-module": "^1.0.0",
-                "resolve-from": "^4.0.0"
-            },
-            "dependencies": {
-                "resolve-from": {
-                    "version": "4.0.0",
-                    "resolved": "https://registry.npmjs.org/resolve-from/-/resolve-from-4.0.0.tgz",
-                    "integrity": "sha512-pb/MYmXstAkysRFx8piNI1tGFNQIFA3vkE3Gq4EuA1dF6gHp/+vgZqsCGJapvy8N3Q+4o7FwvquPJcnZ7RYy4g==",
-                    "dev": true
-                }
-            }
-        },
-        "import-local": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/import-local/-/import-local-3.0.2.tgz",
-            "integrity": "sha512-vjL3+w0oulAVZ0hBHnxa/Nm5TAurf9YLQJDhqRZyqb+VKGOB6LU8t9H1Nr5CIo16vh9XfJTOoHwU0B71S557gA==",
-            "dev": true,
-            "requires": {
-                "pkg-dir": "^4.2.0",
-                "resolve-cwd": "^3.0.0"
-            }
-        },
-        "imurmurhash": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/imurmurhash/-/imurmurhash-0.1.4.tgz",
-            "integrity": "sha1-khi5srkoojixPcT7a21XbyMUU+o=",
-            "dev": true
-        },
-        "inflight": {
-            "version": "1.0.6",
-            "resolved": "https://registry.npmjs.org/inflight/-/inflight-1.0.6.tgz",
-            "integrity": "sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=",
-            "dev": true,
-            "requires": {
-                "once": "^1.3.0",
-                "wrappy": "1"
-            }
+          "version": "4.0.6",
+          "resolved": "https://registry.npmjs.org/ignore/-/ignore-4.0.6.tgz",
+          "integrity": "sha512-cyFDKrqc/YdcWFniJhzI42+AzS+gNwmUzOSFcRCQYwySuBBBy/KjuxWLZ/FHEH6Moq1NizMOBWyTcv8O4OZIMg==",
+          "dev": true
+        }
+      }
+    },
+    "@nicolo-ribaudo/chokidar-2": {
+      "version": "2.1.8-no-fsevents",
+      "resolved": "https://registry.npmjs.org/@nicolo-ribaudo/chokidar-2/-/chokidar-2-2.1.8-no-fsevents.tgz",
+      "integrity": "sha512-+nb9vWloHNNMFHjGofEam3wopE3m1yuambrrd/fnPc+lFOMB9ROTqQlche9ByFWNkdNqfSgR/kkQtQ8DzEWt2w==",
+      "dev": true,
+      "optional": true,
+      "requires": {
+        "anymatch": "^2.0.0",
+        "async-each": "^1.0.1",
+        "braces": "^2.3.2",
+        "glob-parent": "^3.1.0",
+        "inherits": "^2.0.3",
+        "is-binary-path": "^1.0.0",
+        "is-glob": "^4.0.0",
+        "normalize-path": "^3.0.0",
+        "path-is-absolute": "^1.0.0",
+        "readdirp": "^2.2.1",
+        "upath": "^1.1.1"
+      },
+      "dependencies": {
+        "braces": {
+          "version": "2.3.2",
+          "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
+          "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "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"
+          }
         },
-        "inherits": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.4.tgz",
-            "integrity": "sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==",
-            "dev": true
-        },
-        "internal-ip": {
-            "version": "4.3.0",
-            "resolved": "https://registry.npmjs.org/internal-ip/-/internal-ip-4.3.0.tgz",
-            "integrity": "sha512-S1zBo1D6zcsyuC6PMmY5+55YMILQ9av8lotMx447Bq6SAgo/sDK6y6uUKmuYhW7eacnIhFfsPmCNYdDzsnnDCg==",
-            "dev": true,
-            "requires": {
-                "default-gateway": "^4.2.0",
-                "ipaddr.js": "^1.9.0"
-            }
+        "extend-shallow": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "is-extendable": "^0.1.0"
+          }
         },
-        "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
-        },
-        "ip": {
-            "version": "1.1.5",
-            "resolved": "https://registry.npmjs.org/ip/-/ip-1.1.5.tgz",
-            "integrity": "sha1-vd7XARQpCCjAoDnnLvJfWq7ENUo=",
-            "dev": true
-        },
-        "ip-regex": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/ip-regex/-/ip-regex-2.1.0.tgz",
-            "integrity": "sha1-+ni/XS5pE8kRzp+BnuUUa7bYROk=",
-            "dev": true
-        },
-        "ipaddr.js": {
-            "version": "1.9.1",
-            "resolved": "https://registry.npmjs.org/ipaddr.js/-/ipaddr.js-1.9.1.tgz",
-            "integrity": "sha512-0KI/607xoxSToH7GjN1FfSbLoU0+btTicjsQSWQlh/hZykN8KpmMf7uYwPW3R+akZ6R/w18ZlXSHBYXiYUPO3g==",
-            "dev": true
-        },
-        "is-absolute-url": {
-            "version": "3.0.3",
-            "resolved": "https://registry.npmjs.org/is-absolute-url/-/is-absolute-url-3.0.3.tgz",
-            "integrity": "sha512-opmNIX7uFnS96NtPmhWQgQx6/NYFgsUXYMllcfzwWKUMwfo8kku1TvE6hkNcH+Q1ts5cMVrsY7j0bxXQDciu9Q==",
-            "dev": true
+        "fill-range": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
+          "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "extend-shallow": "^2.0.1",
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1",
+            "to-regex-range": "^2.1.0"
+          }
         },
-        "is-accessor-descriptor": {
-            "version": "0.1.6",
-            "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-0.1.6.tgz",
-            "integrity": "sha1-qeEss66Nh2cn7u84Q/igiXtcmNY=",
-            "dev": true,
-            "requires": {
-                "kind-of": "^3.0.2"
-            },
-            "dependencies": {
-                "kind-of": {
-                    "version": "3.2.2",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                    "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                    "dev": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                }
+        "glob-parent": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-3.1.0.tgz",
+          "integrity": "sha1-nmr2KZ2NO9K9QEMIMr0RPfkGxa4=",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "is-glob": "^3.1.0",
+            "path-dirname": "^1.0.0"
+          },
+          "dependencies": {
+            "is-glob": {
+              "version": "3.1.0",
+              "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-3.1.0.tgz",
+              "integrity": "sha1-e6WuJCF4BKxwcHuWkiVnSGzD6Eo=",
+              "dev": true,
+              "optional": true,
+              "requires": {
+                "is-extglob": "^2.1.0"
+              }
             }
+          }
         },
-        "is-arguments": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/is-arguments/-/is-arguments-1.1.0.tgz",
-            "integrity": "sha512-1Ij4lOMPl/xB5kBDn7I+b2ttPMKa8szhEIrXDuXQD/oe3HJLTLhqhgGspwgyGd6MOywBUqVvYicF72lkgDnIHg==",
-            "dev": true,
-            "requires": {
-                "call-bind": "^1.0.0"
-            }
+        "is-number": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
+          "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "kind-of": "^3.0.2"
+          }
         },
-        "is-binary-path": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-1.0.1.tgz",
-            "integrity": "sha1-dfFmQrSA8YenEcgUFh/TpKdlWJg=",
-            "dev": true,
-            "requires": {
-                "binary-extensions": "^1.0.0"
-            }
+        "kind-of": {
+          "version": "3.2.2",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+          "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
         },
-        "is-buffer": {
-            "version": "1.1.6",
-            "resolved": "https://registry.npmjs.org/is-buffer/-/is-buffer-1.1.6.tgz",
-            "integrity": "sha512-NcdALwpXkTm5Zvvbk7owOUSvVvBKDgKP5/ewfXEznmQFfs4ZRmanOeKBTjRVjka3QFoN6XJ+9F3USqfHqTaU5w==",
-            "dev": true
-        },
-        "is-core-module": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/is-core-module/-/is-core-module-2.2.0.tgz",
-            "integrity": "sha512-XRAfAdyyY5F5cOXn7hYQDqh2Xmii+DEfIcQGxK/uNwMHhIkPWO0g8msXcbzLe+MpGoR951MlqM/2iIlU4vKDdQ==",
-            "dev": true,
-            "requires": {
-                "has": "^1.0.3"
+        "to-regex-range": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
+          "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1"
+          }
+        }
+      }
+    },
+    "@nodelib/fs.scandir": {
+      "version": "2.1.4",
+      "resolved": "https://registry.npmjs.org/@nodelib/fs.scandir/-/fs.scandir-2.1.4.tgz",
+      "integrity": "sha512-33g3pMJk3bg5nXbL/+CY6I2eJDzZAni49PfJnL5fghPTggPvBd/pFNSgJsdAgWptuFu7qq/ERvOYFlhvsLTCKA==",
+      "dev": true,
+      "requires": {
+        "@nodelib/fs.stat": "2.0.4",
+        "run-parallel": "^1.1.9"
+      }
+    },
+    "@nodelib/fs.stat": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmjs.org/@nodelib/fs.stat/-/fs.stat-2.0.4.tgz",
+      "integrity": "sha512-IYlHJA0clt2+Vg7bccq+TzRdJvv19c2INqBSsoOLp1je7xjtr7J26+WXR72MCdvU9q1qTzIWDfhMf+DRvQJK4Q==",
+      "dev": true
+    },
+    "@nodelib/fs.walk": {
+      "version": "1.2.6",
+      "resolved": "https://registry.npmjs.org/@nodelib/fs.walk/-/fs.walk-1.2.6.tgz",
+      "integrity": "sha512-8Broas6vTtW4GIXTAHDoE32hnN2M5ykgCpWGbuXHQ15vEMqr23pB76e/GZcYsZCHALv50ktd24qhEyKr6wBtow==",
+      "dev": true,
+      "requires": {
+        "@nodelib/fs.scandir": "2.1.4",
+        "fastq": "^1.6.0"
+      }
+    },
+    "@pixi/accessibility": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/accessibility/-/accessibility-6.0.2.tgz",
+      "integrity": "sha512-zHJcrGmpphnqjUQr+5HhcoInuKxZu3PxGl/NRgTC5gpWp259D0LBPT7k3Lt45r4kruDCMUGpMZVb1s46IZniSQ==",
+      "requires": {
+        "@pixi/canvas-renderer": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/app": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/app/-/app-6.0.2.tgz",
+      "integrity": "sha512-zHCzO0K5jJ48ngbH4FpdYJh1LxuGn9mJSIOF8YorqXFt+3drM9R9/qGGfSGdA9O7rW0O0uIkSndQwPXIlOIsUA==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2"
+      }
+    },
+    "@pixi/canvas-renderer": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/canvas-renderer/-/canvas-renderer-6.0.2.tgz",
+      "integrity": "sha512-SL3pLxAjEQdVN8Tp/p2svciKeA0DRH7HhlO95frVwxzvG4Z3GGYU39f3ejtCaLPqLGzEJmLND7lbIXh0b+Ornw==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/compressed-textures": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/compressed-textures/-/compressed-textures-6.0.2.tgz",
+      "integrity": "sha512-SDuCLn/IEo8j1O+OYPVYy3Dz8+jAXLPdJsMYfs4GOGhsQWZ9js5bfLXWuwr6QRPOXoR3e8zb9qC3co8149pNLg==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/loaders": "6.0.2"
+      }
+    },
+    "@pixi/constants": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/constants/-/constants-6.0.2.tgz",
+      "integrity": "sha512-4GSVKWr+qtjTj8IpRjXSnpkhF944ybjTSz9FnoqZZJgFxh/+9r53StHEGtKoK+BsSrmqbGzWax9krfc620KcLA=="
+    },
+    "@pixi/core": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/core/-/core-6.0.2.tgz",
+      "integrity": "sha512-Bz0WQDncrXuLEjU6pX5INrCLd5UorgBfufgysQzncOITIER4sZjAq5R/mCS1M3d4mGFhXZQyMyQK+O4LacWvOQ==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/runner": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/ticker": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/display": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/display/-/display-6.0.2.tgz",
+      "integrity": "sha512-5qJxwT07McA7EK2yFhqvAjEJpap4Xa2hUCRDfsxl+Fu1Y3zDNBKI7HB8+mWZdYtSnnh5fJxrrw5lPo4HX7M+6w==",
+      "requires": {
+        "@pixi/math": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/extract": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/extract/-/extract-6.0.2.tgz",
+      "integrity": "sha512-vGrewyLREzZOGAjcJO60s7oDm8ATbJOB5KyxuJXOSmIuhEmP69ohmxt1Rk6W8nfUS5m3gYU2KsY//RfDghHzVA==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/filter-alpha": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/filter-alpha/-/filter-alpha-6.0.2.tgz",
+      "integrity": "sha512-fk7I2mCdQLbt9KrxiCd1103okSoNGXnxa1uY1V66jouSo51IXB3PkNEIFbET/cYOM7kKiMui20sYath1g596ag==",
+      "requires": {
+        "@pixi/core": "6.0.2"
+      }
+    },
+    "@pixi/filter-blur": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/filter-blur/-/filter-blur-6.0.2.tgz",
+      "integrity": "sha512-FzaIl4l10lOW4+1SWFjLvK3MtH66zBG1SEa/cMUcVOfwZRIrg5pY3X842kZhNErm42yr9N2xBtKwwVBqQRbV8w==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/settings": "6.0.2"
+      }
+    },
+    "@pixi/filter-color-matrix": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/filter-color-matrix/-/filter-color-matrix-6.0.2.tgz",
+      "integrity": "sha512-zOKdURfQFBIqknpisG1Ow7BiYD7zVTAHU/Y4aPNBFwcAxET/fKFDB8vJFztO1g0C4v05ivjVXmvAuIAjlXdOhw==",
+      "requires": {
+        "@pixi/core": "6.0.2"
+      }
+    },
+    "@pixi/filter-displacement": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/filter-displacement/-/filter-displacement-6.0.2.tgz",
+      "integrity": "sha512-ozhpQ0YkGxsMDzE8u/zTYp0LZ52VBM849iCIqY/WSVZkjeNYB0XhUZdI/7RMDPMVfiQSENimacEpsOgzsOIPSA==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/math": "6.0.2"
+      }
+    },
+    "@pixi/filter-fxaa": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/filter-fxaa/-/filter-fxaa-6.0.2.tgz",
+      "integrity": "sha512-dkX2udy4CqUuAS5yEu3udzdCbpZVdHgoVEksSiFiGzyC17uexkHaunQAgLb2UFGmjbdLT4Vk2FIrgM3+sMWQ3w==",
+      "requires": {
+        "@pixi/core": "6.0.2"
+      }
+    },
+    "@pixi/filter-noise": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/filter-noise/-/filter-noise-6.0.2.tgz",
+      "integrity": "sha512-UnaRYV06qWe7ytBHZ8hK6ZH8Bnqhwtuhoj86pAv0Jhc8EXwcKC2wLT7JDFxBnjB1GwJuWDYnNrQpPsyRQsHNiA==",
+      "requires": {
+        "@pixi/core": "6.0.2"
+      }
+    },
+    "@pixi/graphics": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/graphics/-/graphics-6.0.2.tgz",
+      "integrity": "sha512-/hONnNsWIo8O/0yQf2voBRi0aLnt7RXHXiYLb1d0bMkfYVHbn6r+TYZsz/mjOC1MRW+B0Bkh5ZxRWOgF3IpCiA==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/sprite": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/interaction": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/interaction/-/interaction-6.0.2.tgz",
+      "integrity": "sha512-YRT1reJXISgAf1+lRECpchR7+MUcGA/vdC612oG0fbrONCI0r1jMwMjdEcTnuMzZrzfSGL6yz0pkhIjWMjuY0g==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/ticker": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/loaders": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/loaders/-/loaders-6.0.2.tgz",
+      "integrity": "sha512-ir71du5YOoH/NW8/rNwQ5br+YCVcKWUAltsUaQfTCMLjPzaT8nHtsBiy/krQIGNus179l1h7NfGrSOK/RU936Q==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/utils": "6.0.2",
+        "resource-loader": "^3.0.1"
+      }
+    },
+    "@pixi/math": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/math/-/math-6.0.2.tgz",
+      "integrity": "sha512-eA4VmqkWTUSRl1iYIu3sCitbg8+QfohU0Zk/61J1s0pzWtLjMECkrlcwiFfCxwNU7MhkOATQ53dxgmNtBa77zw=="
+    },
+    "@pixi/mesh": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/mesh/-/mesh-6.0.2.tgz",
+      "integrity": "sha512-Sc3VrB7/MQ4/Ju86Cks43pJlw6bH0o/SXm/UgIkW7B2cYQMdffcWwt3bOvdyeiChNJWN6308m9VtU0Dx+5xalA==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/mesh-extras": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/mesh-extras/-/mesh-extras-6.0.2.tgz",
+      "integrity": "sha512-Q2O3/MR5ghMx95N2DnvYbyDL6aK9fU5cxLy6nEAd/i4iNyBA/XIfC7iB6WY207OyF9PIjPedT5Ha1SSSiujhAA==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/mesh": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/mixin-cache-as-bitmap": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/mixin-cache-as-bitmap/-/mixin-cache-as-bitmap-6.0.2.tgz",
+      "integrity": "sha512-GBS/s1sf01AWmWBiFD9ppx/20EZMGYvJ2vq/fK/7jmTRA1gTJVI9UA/Suhx3n2KVe7szRDHBAgKKuMjC0W4q7w==",
+      "requires": {
+        "@pixi/canvas-renderer": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/sprite": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/mixin-get-child-by-name": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/mixin-get-child-by-name/-/mixin-get-child-by-name-6.0.2.tgz",
+      "integrity": "sha512-qQ+cqOXX50FG3DyuOS69iVc9uOox93ARJoBoh1d3aYwHMUg45oBTyX6xv3suquvPTDcLnKGrJeiHQ/c/xw7tRw==",
+      "requires": {
+        "@pixi/display": "6.0.2"
+      }
+    },
+    "@pixi/mixin-get-global-position": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/mixin-get-global-position/-/mixin-get-global-position-6.0.2.tgz",
+      "integrity": "sha512-waO1D/asjNorJpE+hdJqCg1gnfqOVIUf2mZmKWfS4jW/OPvhbAR1pX6uXP2uZ6yLoK/Ft94x9faMjuDeqxMdFg==",
+      "requires": {
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2"
+      }
+    },
+    "@pixi/particles": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/particles/-/particles-6.0.2.tgz",
+      "integrity": "sha512-Z0vAjqmCGXrdwBmdiC7I4Flv0QQ0q4GxC1lqymT58KhA//GiZOLYp0FuK5RojslLrUu7w5MAfUWwLq7gruu2cQ==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/polyfill": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/polyfill/-/polyfill-6.0.2.tgz",
+      "integrity": "sha512-PD+d3kGPPKoYgkSQ/xT8U3y12T4StkcpCK6QfFy6k+dkWHzGcQI1aE46Vw6tZ+ZkFi5nRUTNk9C3VlwWt/Fdfw==",
+      "requires": {
+        "object-assign": "^4.1.1",
+        "promise-polyfill": "^8.2.0"
+      }
+    },
+    "@pixi/prepare": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/prepare/-/prepare-6.0.2.tgz",
+      "integrity": "sha512-bmVE/6qV7Psd3EhumLdeAH7MmU3VpuUcnbyDhrmrJrUmfbqrXiMApCLqGSYjMHQI/abZwFQ0vMgDQhx9dfG8wA==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/graphics": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/text": "6.0.2",
+        "@pixi/ticker": "6.0.2"
+      }
+    },
+    "@pixi/runner": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/runner/-/runner-6.0.2.tgz",
+      "integrity": "sha512-HcaDuwT+kconUZJh9gzGy166R/0hWkgXpLX0mqUYo5qPKmhiC+balJsiha6IIV6Ckg5c5IX2GQBSkXJrEDlOMg=="
+    },
+    "@pixi/settings": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/settings/-/settings-6.0.2.tgz",
+      "integrity": "sha512-hZMZIKDsqpf2qtVAnZvemGcFw1ujkZb/r4nVn4/hYeyZLK63I5IpQKEPPK9NMicTM697V+BRoMbWqbrlubiLKw==",
+      "requires": {
+        "ismobilejs": "^1.1.0"
+      }
+    },
+    "@pixi/sprite": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/sprite/-/sprite-6.0.2.tgz",
+      "integrity": "sha512-I9FHX0zxvfVg/L6hZVRX9kpsdbbxLu9KhN8kdJmDR+RGxuoxGrnboTx5VgT3AW0rYJvwp47VneQTKVVMjat11A==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/sprite-animated": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/sprite-animated/-/sprite-animated-6.0.2.tgz",
+      "integrity": "sha512-OSINySJ1uk/iaD4Yk/3czRlitTMVIEgzgvqzSZL+GcqHqzc3lW/BpZ31+so+W/4Yv7KckzBJdB++GvsAfAU0kA==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/sprite": "6.0.2",
+        "@pixi/ticker": "6.0.2"
+      }
+    },
+    "@pixi/sprite-tiling": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/sprite-tiling/-/sprite-tiling-6.0.2.tgz",
+      "integrity": "sha512-tauohq//qEZirTM5A6pLKUIUgBPp1qTxjrI4lpFp4scalehAdR04dPe3a9JMr7uwmPiskQIB5/LZX7sMtl3jpg==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/sprite": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/spritesheet": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/spritesheet/-/spritesheet-6.0.2.tgz",
+      "integrity": "sha512-gWVxx0uWKaNtcj1beLZw0vvogDgmerct+oSA0pU6A3b20pDMrAPc90EuOEOOQ/xxxrHfpIY00IIXsUmAmmA0Zg==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/loaders": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/text": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/text/-/text-6.0.2.tgz",
+      "integrity": "sha512-XBhiwLeuL8dBsPwXMDOq9O0JxZcOA2l0aOnFs2O2fZPLL4gkvyquZA+s95C6bGZMR+6j0xtFIQDCsBQCZl1A/g==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/sprite": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/text-bitmap": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/text-bitmap/-/text-bitmap-6.0.2.tgz",
+      "integrity": "sha512-wT3JUp/Y1+B979UpIMibV3Cir0Tb1oi5Sc1r6FPr51KUfFxHMj6Q7+OV1YxJvSMoaKLK6efImfMXGKAKYtVXMQ==",
+      "requires": {
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/loaders": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/mesh": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/text": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "@pixi/ticker": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/ticker/-/ticker-6.0.2.tgz",
+      "integrity": "sha512-oBZTfId0D+hDbDCaYvREclI7jvIAmcaxd7iaOPcELHcPPyJ+ym+4hggsXSIchXeeFYasLjI5bfqJPzzL6IasTg==",
+      "requires": {
+        "@pixi/settings": "6.0.2"
+      }
+    },
+    "@pixi/utils": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@pixi/utils/-/utils-6.0.2.tgz",
+      "integrity": "sha512-jx3ZYJ29mTJSqBPQbDUPPorsPXiGOQzL6IIW5vwE05LekYmwocR8b48vLYKdbr8XdyOQ7Eqe43PodiwCLjuWvA==",
+      "requires": {
+        "@pixi/constants": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@types/earcut": "^2.1.0",
+        "earcut": "^2.2.2",
+        "eventemitter3": "^3.1.0",
+        "url": "^0.11.0"
+      },
+      "dependencies": {
+        "eventemitter3": {
+          "version": "3.1.2",
+          "resolved": "https://registry.npmjs.org/eventemitter3/-/eventemitter3-3.1.2.tgz",
+          "integrity": "sha512-tvtQIeLVHjDkJYnzf2dgVMxfuSGJeM/7UCG17TT4EumTfNtF+0nebF/4zWOIkCreAbtNqhGEboB6BWrwqNaw4Q=="
+        }
+      }
+    },
+    "@types/blob-stream": {
+      "version": "0.1.30",
+      "resolved": "https://registry.npmjs.org/@types/blob-stream/-/blob-stream-0.1.30.tgz",
+      "integrity": "sha512-Cyp7/3KZfpQXcUPhcb/+VPubLQE8YzFXbUh1/KNVzBH6sykr0AJohdIzX8YWSy0YZIg1yI75DULDeEfr7lESSg==",
+      "dev": true,
+      "requires": {
+        "@types/node": "*"
+      }
+    },
+    "@types/dagre": {
+      "version": "0.7.44",
+      "resolved": "https://registry.npmjs.org/@types/dagre/-/dagre-0.7.44.tgz",
+      "integrity": "sha512-N6HD+79w77ZVAaVO7JJDW5yJ9LAxM62FpgNGO9xEde+KVYjDRyhIMzfiErXpr1g0JPon9kwlBzoBK6s4fOww9Q==",
+      "dev": true
+    },
+    "@types/earcut": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/@types/earcut/-/earcut-2.1.1.tgz",
+      "integrity": "sha512-w8oigUCDjElRHRRrMvn/spybSMyX8MTkKA5Dv+tS1IE/TgmNZPqUYtvYBXGY8cieSE66gm+szeK+bnbxC2xHTQ=="
+    },
+    "@types/eslint": {
+      "version": "7.2.7",
+      "resolved": "https://registry.npmjs.org/@types/eslint/-/eslint-7.2.7.tgz",
+      "integrity": "sha512-EHXbc1z2GoQRqHaAT7+grxlTJ3WE2YNeD6jlpPoRc83cCoThRY+NUWjCUZaYmk51OICkPXn2hhphcWcWXgNW0Q==",
+      "dev": true,
+      "requires": {
+        "@types/estree": "*",
+        "@types/json-schema": "*"
+      }
+    },
+    "@types/eslint-scope": {
+      "version": "3.7.0",
+      "resolved": "https://registry.npmjs.org/@types/eslint-scope/-/eslint-scope-3.7.0.tgz",
+      "integrity": "sha512-O/ql2+rrCUe2W2rs7wMR+GqPRcgB6UiqN5RhrR5xruFlY7l9YLMn0ZkDzjoHLeiFkR8MCQZVudUuuvQ2BLC9Qw==",
+      "dev": true,
+      "requires": {
+        "@types/eslint": "*",
+        "@types/estree": "*"
+      }
+    },
+    "@types/estree": {
+      "version": "0.0.46",
+      "resolved": "https://registry.npmjs.org/@types/estree/-/estree-0.0.46.tgz",
+      "integrity": "sha512-laIjwTQaD+5DukBZaygQ79K1Z0jb1bPEMRrkXSLjtCcZm+abyp5YbrqpSLzD42FwWW6gK/aS4NYpJ804nG2brg==",
+      "dev": true
+    },
+    "@types/glob": {
+      "version": "7.1.3",
+      "resolved": "https://registry.npmjs.org/@types/glob/-/glob-7.1.3.tgz",
+      "integrity": "sha512-SEYeGAIQIQX8NN6LDKprLjbrd5dARM5EXsd8GI/A5l0apYI1fGMWgPHSe4ZKL4eozlAyI+doUE9XbYS4xCkQ1w==",
+      "dev": true,
+      "requires": {
+        "@types/minimatch": "*",
+        "@types/node": "*"
+      }
+    },
+    "@types/jquery": {
+      "version": "3.5.5",
+      "resolved": "https://registry.npmjs.org/@types/jquery/-/jquery-3.5.5.tgz",
+      "integrity": "sha512-6RXU9Xzpc6vxNrS6FPPapN1SxSHgQ336WC6Jj/N8q30OiaBZ00l1GBgeP7usjVZPivSkGUfL1z/WW6TX989M+w==",
+      "dev": true,
+      "requires": {
+        "@types/sizzle": "*"
+      }
+    },
+    "@types/json-schema": {
+      "version": "7.0.7",
+      "resolved": "https://registry.npmjs.org/@types/json-schema/-/json-schema-7.0.7.tgz",
+      "integrity": "sha512-cxWFQVseBm6O9Gbw1IWb8r6OS4OhSt3hPZLkFApLjM8TEXROBuQGLAH2i2gZpcXdLBIrpXuTDhH7Vbm1iXmNGA==",
+      "dev": true
+    },
+    "@types/mathjs": {
+      "version": "6.0.11",
+      "resolved": "https://registry.npmjs.org/@types/mathjs/-/mathjs-6.0.11.tgz",
+      "integrity": "sha512-q9B8ZreO41L38iTY76bCZEtAqzeRs4mNIOZpZ1sLSlcYgvgfFrnf8y8qfmas0tVWrsODjmQbQJFD6RJJJCqJbQ==",
+      "requires": {
+        "decimal.js": "^10.0.0"
+      }
+    },
+    "@types/minimatch": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/@types/minimatch/-/minimatch-3.0.3.tgz",
+      "integrity": "sha512-tHq6qdbT9U1IRSGf14CL0pUlULksvY9OZ+5eEgl1N7t+OA3tGvNpxJCzuKQlsNgCVwbAs670L1vcVQi8j9HjnA==",
+      "dev": true
+    },
+    "@types/node": {
+      "version": "14.14.35",
+      "resolved": "https://registry.npmjs.org/@types/node/-/node-14.14.35.tgz",
+      "integrity": "sha512-Lt+wj8NVPx0zUmUwumiVXapmaLUcAk3yPuHCFVXras9k5VT9TdhJqKqGVUQCD60OTMCl0qxJ57OiTL0Mic3Iag==",
+      "dev": true
+    },
+    "@types/sizzle": {
+      "version": "2.3.2",
+      "resolved": "https://registry.npmjs.org/@types/sizzle/-/sizzle-2.3.2.tgz",
+      "integrity": "sha512-7EJYyKTL7tFR8+gDbB6Wwz/arpGa0Mywk1TJbNzKzHtzbwVmY4HR9WqS5VV7dsBUKQmPNr192jHr/VpBluj/hg==",
+      "dev": true
+    },
+    "@typescript-eslint/eslint-plugin": {
+      "version": "4.18.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/eslint-plugin/-/eslint-plugin-4.18.0.tgz",
+      "integrity": "sha512-Lzkc/2+7EoH7+NjIWLS2lVuKKqbEmJhtXe3rmfA8cyiKnZm3IfLf51irnBcmow8Q/AptVV0XBZmBJKuUJTe6cQ==",
+      "dev": true,
+      "requires": {
+        "@typescript-eslint/experimental-utils": "4.18.0",
+        "@typescript-eslint/scope-manager": "4.18.0",
+        "debug": "^4.1.1",
+        "functional-red-black-tree": "^1.0.1",
+        "lodash": "^4.17.15",
+        "regexpp": "^3.0.0",
+        "semver": "^7.3.2",
+        "tsutils": "^3.17.1"
+      }
+    },
+    "@typescript-eslint/experimental-utils": {
+      "version": "4.18.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/experimental-utils/-/experimental-utils-4.18.0.tgz",
+      "integrity": "sha512-92h723Kblt9JcT2RRY3QS2xefFKar4ZQFVs3GityOKWQYgtajxt/tuXIzL7sVCUlM1hgreiV5gkGYyBpdOwO6A==",
+      "dev": true,
+      "requires": {
+        "@types/json-schema": "^7.0.3",
+        "@typescript-eslint/scope-manager": "4.18.0",
+        "@typescript-eslint/types": "4.18.0",
+        "@typescript-eslint/typescript-estree": "4.18.0",
+        "eslint-scope": "^5.0.0",
+        "eslint-utils": "^2.0.0"
+      }
+    },
+    "@typescript-eslint/parser": {
+      "version": "4.18.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/parser/-/parser-4.18.0.tgz",
+      "integrity": "sha512-W3z5S0ZbecwX3PhJEAnq4mnjK5JJXvXUDBYIYGoweCyWyuvAKfGHvzmpUzgB5L4cRBb+cTu9U/ro66dx7dIimA==",
+      "dev": true,
+      "requires": {
+        "@typescript-eslint/scope-manager": "4.18.0",
+        "@typescript-eslint/types": "4.18.0",
+        "@typescript-eslint/typescript-estree": "4.18.0",
+        "debug": "^4.1.1"
+      }
+    },
+    "@typescript-eslint/scope-manager": {
+      "version": "4.18.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/scope-manager/-/scope-manager-4.18.0.tgz",
+      "integrity": "sha512-olX4yN6rvHR2eyFOcb6E4vmhDPsfdMyfQ3qR+oQNkAv8emKKlfxTWUXU5Mqxs2Fwe3Pf1BoPvrwZtwngxDzYzQ==",
+      "dev": true,
+      "requires": {
+        "@typescript-eslint/types": "4.18.0",
+        "@typescript-eslint/visitor-keys": "4.18.0"
+      }
+    },
+    "@typescript-eslint/types": {
+      "version": "4.18.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/types/-/types-4.18.0.tgz",
+      "integrity": "sha512-/BRociARpj5E+9yQ7cwCF/SNOWwXJ3qhjurMuK2hIFUbr9vTuDeu476Zpu+ptxY2kSxUHDGLLKy+qGq2sOg37A==",
+      "dev": true
+    },
+    "@typescript-eslint/typescript-estree": {
+      "version": "4.18.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/typescript-estree/-/typescript-estree-4.18.0.tgz",
+      "integrity": "sha512-wt4xvF6vvJI7epz+rEqxmoNQ4ZADArGQO9gDU+cM0U5fdVv7N+IAuVoVAoZSOZxzGHBfvE3XQMLdy+scsqFfeg==",
+      "dev": true,
+      "requires": {
+        "@typescript-eslint/types": "4.18.0",
+        "@typescript-eslint/visitor-keys": "4.18.0",
+        "debug": "^4.1.1",
+        "globby": "^11.0.1",
+        "is-glob": "^4.0.1",
+        "semver": "^7.3.2",
+        "tsutils": "^3.17.1"
+      }
+    },
+    "@typescript-eslint/visitor-keys": {
+      "version": "4.18.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/visitor-keys/-/visitor-keys-4.18.0.tgz",
+      "integrity": "sha512-Q9t90JCvfYaN0OfFUgaLqByOfz8yPeTAdotn/XYNm5q9eHax90gzdb+RJ6E9T5s97Kv/UHWKERTmqA0jTKAEHw==",
+      "dev": true,
+      "requires": {
+        "@typescript-eslint/types": "4.18.0",
+        "eslint-visitor-keys": "^2.0.0"
+      }
+    },
+    "@webassemblyjs/ast": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.0.tgz",
+      "integrity": "sha512-kX2W49LWsbthrmIRMbQZuQDhGtjyqXfEmmHyEi4XWnSZtPmxY0+3anPIzsnRb45VH/J55zlOfWvZuY47aJZTJg==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/helper-numbers": "1.11.0",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.0"
+      }
+    },
+    "@webassemblyjs/floating-point-hex-parser": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/floating-point-hex-parser/-/floating-point-hex-parser-1.11.0.tgz",
+      "integrity": "sha512-Q/aVYs/VnPDVYvsCBL/gSgwmfjeCb4LW8+TMrO3cSzJImgv8lxxEPM2JA5jMrivE7LSz3V+PFqtMbls3m1exDA==",
+      "dev": true
+    },
+    "@webassemblyjs/helper-api-error": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-api-error/-/helper-api-error-1.11.0.tgz",
+      "integrity": "sha512-baT/va95eXiXb2QflSx95QGT5ClzWpGaa8L7JnJbgzoYeaA27FCvuBXU758l+KXWRndEmUXjP0Q5fibhavIn8w==",
+      "dev": true
+    },
+    "@webassemblyjs/helper-buffer": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.0.tgz",
+      "integrity": "sha512-u9HPBEl4DS+vA8qLQdEQ6N/eJQ7gT7aNvMIo8AAWvAl/xMrcOSiI2M0MAnMCy3jIFke7bEee/JwdX1nUpCtdyA==",
+      "dev": true
+    },
+    "@webassemblyjs/helper-numbers": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-numbers/-/helper-numbers-1.11.0.tgz",
+      "integrity": "sha512-DhRQKelIj01s5IgdsOJMKLppI+4zpmcMQ3XboFPLwCpSNH6Hqo1ritgHgD0nqHeSYqofA6aBN/NmXuGjM1jEfQ==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/floating-point-hex-parser": "1.11.0",
+        "@webassemblyjs/helper-api-error": "1.11.0",
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "@webassemblyjs/helper-wasm-bytecode": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-bytecode/-/helper-wasm-bytecode-1.11.0.tgz",
+      "integrity": "sha512-MbmhvxXExm542tWREgSFnOVo07fDpsBJg3sIl6fSp9xuu75eGz5lz31q7wTLffwL3Za7XNRCMZy210+tnsUSEA==",
+      "dev": true
+    },
+    "@webassemblyjs/helper-wasm-section": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.0.tgz",
+      "integrity": "sha512-3Eb88hcbfY/FCukrg6i3EH8H2UsD7x8Vy47iVJrP967A9JGqgBVL9aH71SETPx1JrGsOUVLo0c7vMCN22ytJew==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/ast": "1.11.0",
+        "@webassemblyjs/helper-buffer": "1.11.0",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
+        "@webassemblyjs/wasm-gen": "1.11.0"
+      }
+    },
+    "@webassemblyjs/ieee754": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/ieee754/-/ieee754-1.11.0.tgz",
+      "integrity": "sha512-KXzOqpcYQwAfeQ6WbF6HXo+0udBNmw0iXDmEK5sFlmQdmND+tr773Ti8/5T/M6Tl/413ArSJErATd8In3B+WBA==",
+      "dev": true,
+      "requires": {
+        "@xtuc/ieee754": "^1.2.0"
+      }
+    },
+    "@webassemblyjs/leb128": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/leb128/-/leb128-1.11.0.tgz",
+      "integrity": "sha512-aqbsHa1mSQAbeeNcl38un6qVY++hh8OpCOzxhixSYgbRfNWcxJNJQwe2rezK9XEcssJbbWIkblaJRwGMS9zp+g==",
+      "dev": true,
+      "requires": {
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "@webassemblyjs/utf8": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/utf8/-/utf8-1.11.0.tgz",
+      "integrity": "sha512-A/lclGxH6SpSLSyFowMzO/+aDEPU4hvEiooCMXQPcQFPPJaYcPQNKGOCLUySJsYJ4trbpr+Fs08n4jelkVTGVw==",
+      "dev": true
+    },
+    "@webassemblyjs/wasm-edit": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.0.tgz",
+      "integrity": "sha512-JHQ0damXy0G6J9ucyKVXO2j08JVJ2ntkdJlq1UTiUrIgfGMmA7Ik5VdC/L8hBK46kVJgujkBIoMtT8yVr+yVOQ==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/ast": "1.11.0",
+        "@webassemblyjs/helper-buffer": "1.11.0",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
+        "@webassemblyjs/helper-wasm-section": "1.11.0",
+        "@webassemblyjs/wasm-gen": "1.11.0",
+        "@webassemblyjs/wasm-opt": "1.11.0",
+        "@webassemblyjs/wasm-parser": "1.11.0",
+        "@webassemblyjs/wast-printer": "1.11.0"
+      }
+    },
+    "@webassemblyjs/wasm-gen": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.0.tgz",
+      "integrity": "sha512-BEUv1aj0WptCZ9kIS30th5ILASUnAPEvE3tVMTrItnZRT9tXCLW2LEXT8ezLw59rqPP9klh9LPmpU+WmRQmCPQ==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/ast": "1.11.0",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
+        "@webassemblyjs/ieee754": "1.11.0",
+        "@webassemblyjs/leb128": "1.11.0",
+        "@webassemblyjs/utf8": "1.11.0"
+      }
+    },
+    "@webassemblyjs/wasm-opt": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.0.tgz",
+      "integrity": "sha512-tHUSP5F4ywyh3hZ0+fDQuWxKx3mJiPeFufg+9gwTpYp324mPCQgnuVKwzLTZVqj0duRDovnPaZqDwoyhIO8kYg==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/ast": "1.11.0",
+        "@webassemblyjs/helper-buffer": "1.11.0",
+        "@webassemblyjs/wasm-gen": "1.11.0",
+        "@webassemblyjs/wasm-parser": "1.11.0"
+      }
+    },
+    "@webassemblyjs/wasm-parser": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.0.tgz",
+      "integrity": "sha512-6L285Sgu9gphrcpDXINvm0M9BskznnzJTE7gYkjDbxET28shDqp27wpruyx3C2S/dvEwiigBwLA1cz7lNUi0kw==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/ast": "1.11.0",
+        "@webassemblyjs/helper-api-error": "1.11.0",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.0",
+        "@webassemblyjs/ieee754": "1.11.0",
+        "@webassemblyjs/leb128": "1.11.0",
+        "@webassemblyjs/utf8": "1.11.0"
+      }
+    },
+    "@webassemblyjs/wast-printer": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.0.tgz",
+      "integrity": "sha512-Fg5OX46pRdTgB7rKIUojkh9vXaVN6sGYCnEiJN1GYkb0RPwShZXp6KTDqmoMdQPKhcroOXh3fEzmkWmCYaKYhQ==",
+      "dev": true,
+      "requires": {
+        "@webassemblyjs/ast": "1.11.0",
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "@webpack-cli/configtest": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/@webpack-cli/configtest/-/configtest-1.0.1.tgz",
+      "integrity": "sha512-B+4uBUYhpzDXmwuo3V9yBH6cISwxEI4J+NO5ggDaGEEHb0osY/R7MzeKc0bHURXQuZjMM4qD+bSJCKIuI3eNBQ==",
+      "dev": true
+    },
+    "@webpack-cli/info": {
+      "version": "1.2.2",
+      "resolved": "https://registry.npmjs.org/@webpack-cli/info/-/info-1.2.2.tgz",
+      "integrity": "sha512-5U9kUJHnwU+FhKH4PWGZuBC1hTEPYyxGSL5jjoBI96Gx8qcYJGOikpiIpFoTq8mmgX3im2zAo2wanv/alD74KQ==",
+      "dev": true,
+      "requires": {
+        "envinfo": "^7.7.3"
+      }
+    },
+    "@webpack-cli/serve": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmjs.org/@webpack-cli/serve/-/serve-1.3.0.tgz",
+      "integrity": "sha512-k2p2VrONcYVX1wRRrf0f3X2VGltLWcv+JzXRBDmvCxGlCeESx4OXw91TsWeKOkp784uNoVQo313vxJFHXPPwfw==",
+      "dev": true
+    },
+    "@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
+    },
+    "@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
+    },
+    "accepts": {
+      "version": "1.3.7",
+      "resolved": "https://registry.npmjs.org/accepts/-/accepts-1.3.7.tgz",
+      "integrity": "sha512-Il80Qs2WjYlJIBNzNkK6KYqlVMTbZLXgHx2oT0pU/fjRHyEp+PEfEPY0R3WCwAGVOtauxh1hOxNgIf5bv7dQpA==",
+      "dev": true,
+      "requires": {
+        "mime-types": "~2.1.24",
+        "negotiator": "0.6.2"
+      }
+    },
+    "acorn": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.1.0.tgz",
+      "integrity": "sha512-LWCF/Wn0nfHOmJ9rzQApGnxnvgfROzGilS8936rqN/lfcYkY9MYZzdMqN+2NJ4SlTc+m5HiSa+kNfDtI64dwUA==",
+      "dev": true
+    },
+    "acorn-jsx": {
+      "version": "5.3.1",
+      "resolved": "https://registry.npmjs.org/acorn-jsx/-/acorn-jsx-5.3.1.tgz",
+      "integrity": "sha512-K0Ptm/47OKfQRpNQ2J/oIN/3QYiK6FwW+eJbILhsdxh2WTLdl+30o8aGdTbm5JbffpFFAg/g+zi1E+jvJha5ng==",
+      "dev": true
+    },
+    "acorn-node": {
+      "version": "1.8.2",
+      "resolved": "https://registry.npmjs.org/acorn-node/-/acorn-node-1.8.2.tgz",
+      "integrity": "sha512-8mt+fslDufLYntIoPAaIMUe/lrbrehIiwmR3t2k9LljIzoigEPF27eLk2hy8zSGzmR/ogr7zbRKINMo1u0yh5A==",
+      "requires": {
+        "acorn": "^7.0.0",
+        "acorn-walk": "^7.0.0",
+        "xtend": "^4.0.2"
+      },
+      "dependencies": {
+        "acorn": {
+          "version": "7.4.1",
+          "resolved": "https://registry.npmjs.org/acorn/-/acorn-7.4.1.tgz",
+          "integrity": "sha512-nQyp0o1/mNdbTO1PO6kHkwSrmgZ0MT/jCCpNiwbUjGoRN4dlBhqJtoQuCnEOKzgTVwg0ZWiCoQy6SxMebQVh8A=="
+        }
+      }
+    },
+    "acorn-walk": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmjs.org/acorn-walk/-/acorn-walk-7.2.0.tgz",
+      "integrity": "sha512-OPdCF6GsMIP+Az+aWfAAOEt2/+iVDKE7oy6lJ098aoe59oAmK76qV6Gw60SbZ8jHuG2wH058GF4pLFbYamYrVA=="
+    },
+    "ajv": {
+      "version": "6.12.6",
+      "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.12.6.tgz",
+      "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
+      "dev": true,
+      "requires": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      }
+    },
+    "ajv-errors": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/ajv-errors/-/ajv-errors-1.0.1.tgz",
+      "integrity": "sha512-DCRfO/4nQ+89p/RK43i8Ezd41EqdGIU4ld7nGF8OQ14oc/we5rEntLCUa7+jrn3nn83BosfwZA0wb4pon2o8iQ==",
+      "dev": true
+    },
+    "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
+    },
+    "amdefine": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/amdefine/-/amdefine-1.0.1.tgz",
+      "integrity": "sha1-SlKCrBZHKek2Gbz9OtFR+BfOkfU=",
+      "optional": true
+    },
+    "ansi-colors": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmjs.org/ansi-colors/-/ansi-colors-4.1.1.tgz",
+      "integrity": "sha512-JoX0apGbHaUJBNl6yF+p6JAFYZ666/hhCGKN5t9QFjbJQKUU/g8MNbFDbvfrgKXvI1QpZplPOnwIo99lX/AAmA==",
+      "dev": true
+    },
+    "ansi-html": {
+      "version": "0.0.7",
+      "resolved": "https://registry.npmjs.org/ansi-html/-/ansi-html-0.0.7.tgz",
+      "integrity": "sha1-gTWEAhliqenm/QOflA0S9WynhZ4=",
+      "dev": true
+    },
+    "ansi-regex": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-5.0.0.tgz",
+      "integrity": "sha512-bY6fj56OUQ0hU1KjFNDQuJFezqKdrAyFdIevADiqrWHwSlbmBNMHp5ak2f40Pm8JTFyM2mqxkG6ngkHO11f/lg==",
+      "dev": true
+    },
+    "ansi-styles": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-4.3.0.tgz",
+      "integrity": "sha512-zbB9rCJAT1rbjiVDb2hqKFHNYLxgtk8NURxZ3IZwD3F6NtxbXZQCnnSi1Lkx+IDohdPlFp222wVALIheZJQSEg==",
+      "dev": true,
+      "requires": {
+        "color-convert": "^2.0.1"
+      }
+    },
+    "anymatch": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-2.0.0.tgz",
+      "integrity": "sha512-5teOsQWABXHHBFP9y3skS5P3d/WfWXpv3FUpy+LorMrNYaT9pI4oLMQX7jzQ2KklNpGpWHzdCXTDT2Y3XGlZBw==",
+      "dev": true,
+      "requires": {
+        "micromatch": "^3.1.4",
+        "normalize-path": "^2.1.1"
+      },
+      "dependencies": {
+        "braces": {
+          "version": "2.3.2",
+          "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
+          "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
+          "dev": true,
+          "requires": {
+            "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"
+          },
+          "dependencies": {
+            "extend-shallow": {
+              "version": "2.0.1",
+              "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+              "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+              "dev": true,
+              "requires": {
+                "is-extendable": "^0.1.0"
+              }
             }
+          }
         },
-        "is-data-descriptor": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-0.1.4.tgz",
-            "integrity": "sha1-C17mSDiOLIYCgueT8YVv7D8wG1Y=",
-            "dev": true,
-            "requires": {
-                "kind-of": "^3.0.2"
-            },
-            "dependencies": {
-                "kind-of": {
-                    "version": "3.2.2",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                    "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                    "dev": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                }
+        "fill-range": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
+          "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
+          "dev": true,
+          "requires": {
+            "extend-shallow": "^2.0.1",
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1",
+            "to-regex-range": "^2.1.0"
+          },
+          "dependencies": {
+            "extend-shallow": {
+              "version": "2.0.1",
+              "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+              "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+              "dev": true,
+              "requires": {
+                "is-extendable": "^0.1.0"
+              }
             }
+          }
         },
-        "is-date-object": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-date-object/-/is-date-object-1.0.2.tgz",
-            "integrity": "sha512-USlDT524woQ08aoZFzh3/Z6ch9Y/EWXEHQ/AaRN0SkKq4t2Jw2R2339tSXmwuVoY7LLlBCbOIlx2myP/L5zk0g==",
-            "dev": true
-        },
-        "is-descriptor": {
-            "version": "0.1.6",
-            "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-0.1.6.tgz",
-            "integrity": "sha512-avDYr0SB3DwO9zsMov0gKCESFYqCnE4hq/4z3TdUlukEy5t9C0YRq7HLrsN52NAcqXKaepeCD0n+B0arnVG3Hg==",
-            "dev": true,
-            "requires": {
-                "is-accessor-descriptor": "^0.1.6",
-                "is-data-descriptor": "^0.1.4",
-                "kind-of": "^5.0.0"
-            },
-            "dependencies": {
-                "kind-of": {
-                    "version": "5.1.0",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-5.1.0.tgz",
-                    "integrity": "sha512-NGEErnH6F2vUuXDh+OlbcKW7/wOcfdRHaZ7VWtqCztfHri/++YKmP51OdWeGPuqCOba6kk2OTe5d02VmTB80Pw==",
-                    "dev": true
-                }
+        "is-number": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
+          "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
+          "dev": true,
+          "requires": {
+            "kind-of": "^3.0.2"
+          },
+          "dependencies": {
+            "kind-of": {
+              "version": "3.2.2",
+              "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+              "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+              "dev": true,
+              "requires": {
+                "is-buffer": "^1.1.5"
+              }
             }
+          }
         },
-        "is-extendable": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-0.1.1.tgz",
-            "integrity": "sha1-YrEQ4omkcUGOPsNqYX1HLjAd/Ik=",
-            "dev": true
-        },
-        "is-extglob": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-2.1.1.tgz",
-            "integrity": "sha1-qIwCU1eR8C7TfHahueqXc8gz+MI=",
-            "dev": true
+        "micromatch": {
+          "version": "3.1.10",
+          "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
+          "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
+          "dev": true,
+          "requires": {
+            "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"
+          }
         },
-        "is-fullwidth-code-point": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-3.0.0.tgz",
-            "integrity": "sha512-zymm5+u+sCsSWyD9qNaejV3DFvhCKclKdizYaJUuHA83RLjb7nSuGnddCHGv0hk+KY7BMAlsWeK4Ueg6EV6XQg==",
-            "dev": true
-        },
-        "is-glob": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.1.tgz",
-            "integrity": "sha512-5G0tKtBTFImOqDnLB2hG6Bp2qcKEFduo4tZu9MT/H6NQv/ghhy30o55ufafxJ/LdH79LLs2Kfrn85TLKyA7BUg==",
-            "dev": true,
-            "requires": {
-                "is-extglob": "^2.1.1"
-            }
+        "normalize-path": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-2.1.1.tgz",
+          "integrity": "sha1-GrKLVW4Zg2Oowab35vogE3/mrtk=",
+          "dev": true,
+          "requires": {
+            "remove-trailing-separator": "^1.0.1"
+          }
         },
-        "is-number": {
-            "version": "7.0.0",
-            "resolved": "https://registry.npmjs.org/is-number/-/is-number-7.0.0.tgz",
-            "integrity": "sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==",
-            "dev": true
-        },
-        "is-path-cwd": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/is-path-cwd/-/is-path-cwd-2.2.0.tgz",
-            "integrity": "sha512-w942bTcih8fdJPJmQHFzkS76NEP8Kzzvmw92cXsazb8intwLqPibPPdXf4ANdKV3rYMuuQYGIWtvz9JilB3NFQ==",
-            "dev": true
-        },
-        "is-path-in-cwd": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/is-path-in-cwd/-/is-path-in-cwd-2.1.0.tgz",
-            "integrity": "sha512-rNocXHgipO+rvnP6dk3zI20RpOtrAM/kzbB258Uw5BWr3TpXi861yzjo16Dn4hUox07iw5AyeMLHWsujkjzvRQ==",
-            "dev": true,
-            "requires": {
-                "is-path-inside": "^2.1.0"
-            }
+        "to-regex-range": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
+          "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
+          "dev": true,
+          "requires": {
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1"
+          }
+        }
+      }
+    },
+    "argparse": {
+      "version": "1.0.10",
+      "resolved": "https://registry.npmjs.org/argparse/-/argparse-1.0.10.tgz",
+      "integrity": "sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==",
+      "dev": true,
+      "requires": {
+        "sprintf-js": "~1.0.2"
+      }
+    },
+    "arr-diff": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/arr-diff/-/arr-diff-4.0.0.tgz",
+      "integrity": "sha1-1kYQdP6/7HHn4VI1dhoyml3HxSA=",
+      "dev": true
+    },
+    "arr-flatten": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/arr-flatten/-/arr-flatten-1.1.0.tgz",
+      "integrity": "sha512-L3hKV5R/p5o81R7O02IGnwpDmkp6E982XhtbuwSe3O4qOtMMMtodicASA1Cny2U+aCXcNpml+m4dPsvsJ3jatg==",
+      "dev": true
+    },
+    "arr-union": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/arr-union/-/arr-union-3.1.0.tgz",
+      "integrity": "sha1-45sJrqne+Gao8gbiiK9jkZuuOcQ=",
+      "dev": true
+    },
+    "array-flatten": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/array-flatten/-/array-flatten-2.1.2.tgz",
+      "integrity": "sha512-hNfzcOV8W4NdualtqBFPyVO+54DSJuZGY9qT4pRroB6S9e3iiido2ISIC5h9R2sPJ8H3FHCIiEnsv1lPXO3KtQ==",
+      "dev": true
+    },
+    "array-from": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/array-from/-/array-from-2.1.1.tgz",
+      "integrity": "sha1-z+nYwmYoudxa7MYqn12PHzUsEZU="
+    },
+    "array-union": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/array-union/-/array-union-2.1.0.tgz",
+      "integrity": "sha512-HGyxoOTYUyCM6stUe6EJgnd4EoewAI7zMdfqO+kGjnlZmBDz/cR5pf8r/cR4Wq60sL/p0IkcjUEEPwS3GFrIyw==",
+      "dev": true
+    },
+    "array-uniq": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/array-uniq/-/array-uniq-1.0.3.tgz",
+      "integrity": "sha1-r2rId6Jcx/dOBYiUdThY39sk/bY=",
+      "dev": true
+    },
+    "array-unique": {
+      "version": "0.3.2",
+      "resolved": "https://registry.npmjs.org/array-unique/-/array-unique-0.3.2.tgz",
+      "integrity": "sha1-qJS3XUvE9s1nnvMkSp/Y9Gri1Cg=",
+      "dev": true
+    },
+    "assign-symbols": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/assign-symbols/-/assign-symbols-1.0.0.tgz",
+      "integrity": "sha1-WWZ/QfrdTyDMvCu5a41Pf3jsA2c=",
+      "dev": true
+    },
+    "ast-transform": {
+      "version": "0.0.0",
+      "resolved": "https://registry.npmjs.org/ast-transform/-/ast-transform-0.0.0.tgz",
+      "integrity": "sha1-dJRAWIh9goPhidlUYAlHvJj+AGI=",
+      "requires": {
+        "escodegen": "~1.2.0",
+        "esprima": "~1.0.4",
+        "through": "~2.3.4"
+      },
+      "dependencies": {
+        "escodegen": {
+          "version": "1.2.0",
+          "resolved": "https://registry.npmjs.org/escodegen/-/escodegen-1.2.0.tgz",
+          "integrity": "sha1-Cd55Z3kcyVi3+Jot220jRRrzJ+E=",
+          "requires": {
+            "esprima": "~1.0.4",
+            "estraverse": "~1.5.0",
+            "esutils": "~1.0.0",
+            "source-map": "~0.1.30"
+          }
         },
-        "is-path-inside": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/is-path-inside/-/is-path-inside-2.1.0.tgz",
-            "integrity": "sha512-wiyhTzfDWsvwAW53OBWF5zuvaOGlZ6PwYxAbPVDhpm+gM09xKQGjBq/8uYN12aDvMxnAnq3dxTyoSoRNmg5YFg==",
-            "dev": true,
-            "requires": {
-                "path-is-inside": "^1.0.2"
-            }
+        "esprima": {
+          "version": "1.0.4",
+          "resolved": "https://registry.npmjs.org/esprima/-/esprima-1.0.4.tgz",
+          "integrity": "sha1-n1V+CPw7TSbs6d00+Pv0drYlha0="
         },
-        "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,
-            "requires": {
-                "isobject": "^3.0.1"
-            }
+        "estraverse": {
+          "version": "1.5.1",
+          "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-1.5.1.tgz",
+          "integrity": "sha1-hno+jlip+EYYr7bC3bzZFrfLr3E="
         },
-        "is-regex": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/is-regex/-/is-regex-1.1.2.tgz",
-            "integrity": "sha512-axvdhb5pdhEVThqJzYXwMlVuZwC+FF2DpcOhTS+y/8jVq4trxyPgfcwIxIKiyeuLlSQYKkmUaPQJ8ZE4yNKXDg==",
-            "dev": true,
-            "requires": {
-                "call-bind": "^1.0.2",
-                "has-symbols": "^1.0.1"
-            }
+        "esutils": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/esutils/-/esutils-1.0.0.tgz",
+          "integrity": "sha1-gVHTWOIMisx/t0XnRywAJf5JZXA="
         },
-        "is-stream": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/is-stream/-/is-stream-2.0.0.tgz",
-            "integrity": "sha512-XCoy+WlUr7d1+Z8GgSuXmpuUFC9fOhRXglJMx+dwLKTkL44Cjd4W1Z5P+BQZpr+cR93aGP4S/s7Ftw6Nd/kiEw==",
-            "dev": true
-        },
-        "is-windows": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/is-windows/-/is-windows-1.0.2.tgz",
-            "integrity": "sha512-eXK1UInq2bPmjyX6e3VHIzMLobc4J94i4AWn+Hpq3OU5KkrRC96OAcR3PRJ/pGu6m8TRnBHP9dkXQVsT/COVIA==",
-            "dev": true
-        },
-        "is-wsl": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/is-wsl/-/is-wsl-1.1.0.tgz",
-            "integrity": "sha1-HxbkqiKwTRM2tmGIpmrzxgDDpm0=",
-            "dev": true
+        "source-map": {
+          "version": "0.1.43",
+          "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.1.43.tgz",
+          "integrity": "sha1-wkvBRspRfBRx9drL4lcbK3+eM0Y=",
+          "optional": true,
+          "requires": {
+            "amdefine": ">=0.0.4"
+          }
+        }
+      }
+    },
+    "ast-types": {
+      "version": "0.7.8",
+      "resolved": "https://registry.npmjs.org/ast-types/-/ast-types-0.7.8.tgz",
+      "integrity": "sha1-kC0uDWDQcb3NRtwRXhgJ7RHBOKk="
+    },
+    "astral-regex": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/astral-regex/-/astral-regex-2.0.0.tgz",
+      "integrity": "sha512-Z7tMw1ytTXt5jqMcOP+OQteU1VuNK9Y02uuJtKQ1Sv69jXQKKg5cibLwGJow8yzZP+eAc18EmLGPal0bp36rvQ==",
+      "dev": true
+    },
+    "async": {
+      "version": "2.6.3",
+      "resolved": "https://registry.npmjs.org/async/-/async-2.6.3.tgz",
+      "integrity": "sha512-zflvls11DCy+dQWzTW2dzuilv8Z5X/pjfmZOWba6TNIVDm+2UDaJmXSOXlasHKfNBs8oo3M0aT50fDEWfKZjXg==",
+      "dev": true,
+      "requires": {
+        "lodash": "^4.17.14"
+      }
+    },
+    "async-each": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/async-each/-/async-each-1.0.3.tgz",
+      "integrity": "sha512-z/WhQ5FPySLdvREByI2vZiTWwCnF0moMJ1hK9YQwDTHKh6I7/uSckMetoRGb5UBZPC1z0jlw+n/XCgjeH7y1AQ==",
+      "dev": true
+    },
+    "async-limiter": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/async-limiter/-/async-limiter-1.0.1.tgz",
+      "integrity": "sha512-csOlWGAcRFJaI6m+F2WKdnMKr4HhdhFVBk0H/QbJFMCr+uO2kwohwXQPxw/9OCxp05r5ghVBFSyioixx3gfkNQ==",
+      "dev": true
+    },
+    "atob": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/atob/-/atob-2.1.2.tgz",
+      "integrity": "sha512-Wm6ukoaOGJi/73p/cl2GvLjTI5JM1k/O14isD73YML8StrH/7/lRFgmg8nICZgD3bZZvjwCGxtMOD3wWNAu8cg==",
+      "dev": true
+    },
+    "available-typed-arrays": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/available-typed-arrays/-/available-typed-arrays-1.0.4.tgz",
+      "integrity": "sha512-SA5mXJWrId1TaQjfxUYghbqQ/hYioKmLJvPJyDuYRtXXenFNMjj4hSSt1Cf1xsuXSXrtxrVC5Ot4eU6cOtBDdA=="
+    },
+    "babel-code-frame": {
+      "version": "6.26.0",
+      "resolved": "https://registry.npmjs.org/babel-code-frame/-/babel-code-frame-6.26.0.tgz",
+      "integrity": "sha1-Y/1D99weO7fONZR9uP42mj9Yx0s=",
+      "dev": true,
+      "requires": {
+        "chalk": "^1.1.3",
+        "esutils": "^2.0.2",
+        "js-tokens": "^3.0.2"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-2.1.1.tgz",
+          "integrity": "sha1-w7M6te42DYbg5ijwRorn7yfWVN8=",
+          "dev": true
         },
-        "isarray": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/isarray/-/isarray-1.0.0.tgz",
-            "integrity": "sha1-u5NdSFgsuhaMBoNJV6VKPgcSTxE=",
-            "dev": true
-        },
-        "isexe": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/isexe/-/isexe-2.0.0.tgz",
-            "integrity": "sha1-6PvzdNxVb/iUehDcsFctYz8s+hA=",
-            "dev": true
-        },
-        "isobject": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/isobject/-/isobject-3.0.1.tgz",
-            "integrity": "sha1-TkMekrEalzFjaqH5yNHMvP2reN8=",
-            "dev": true
-        },
-        "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="
-        },
-        "jest-worker": {
-            "version": "26.6.2",
-            "resolved": "https://registry.npmjs.org/jest-worker/-/jest-worker-26.6.2.tgz",
-            "integrity": "sha512-KWYVV1c4i+jbMpaBC+U++4Va0cp8OisU185o73T1vo99hqi7w8tSJfUXYswwqqrjzwxa6KpRK54WhPvwf5w6PQ==",
-            "dev": true,
-            "requires": {
-                "@types/node": "*",
-                "merge-stream": "^2.0.0",
-                "supports-color": "^7.0.0"
-            }
+        "ansi-styles": {
+          "version": "2.2.1",
+          "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-2.2.1.tgz",
+          "integrity": "sha1-tDLdM1i2NM914eRmQ2gkBTPB3b4=",
+          "dev": true
         },
-        "jquery": {
-            "version": "3.6.0",
-            "resolved": "https://registry.npmjs.org/jquery/-/jquery-3.6.0.tgz",
-            "integrity": "sha512-JVzAR/AjBvVt2BmYhxRCSYysDsPcssdmTFnzyLEts9qNwmjmu4JTAMYubEfwVOSwpQ1I1sKKFcxhZCI2buerfw=="
+        "chalk": {
+          "version": "1.1.3",
+          "resolved": "https://registry.npmjs.org/chalk/-/chalk-1.1.3.tgz",
+          "integrity": "sha1-qBFcVeSnAv5NFQq9OHKCKn4J/Jg=",
+          "dev": true,
+          "requires": {
+            "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"
+          }
         },
         "js-tokens": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-4.0.0.tgz",
-            "integrity": "sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==",
-            "dev": true
-        },
-        "js-yaml": {
-            "version": "3.14.1",
-            "resolved": "https://registry.npmjs.org/js-yaml/-/js-yaml-3.14.1.tgz",
-            "integrity": "sha512-okMH7OXXJ7YrN9Ok3/SXrnu4iX9yOk+25nqX4imS2npuvTYDmo/QEZoqwZkYaIDk3jVvBOTOIEgEhaLOynBS9g==",
-            "dev": true,
-            "requires": {
-                "argparse": "^1.0.7",
-                "esprima": "^4.0.0"
-            }
-        },
-        "jsesc": {
-            "version": "2.5.2",
-            "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-2.5.2.tgz",
-            "integrity": "sha512-OYu7XEzjkCQ3C5Ps3QIZsQfNpqoJyZZA99wd9aWd05NCtC5pWOkShK2mkL6HXQR6/Cy2lbNdPlZBpuQHXE63gA==",
-            "dev": true
+          "version": "3.0.2",
+          "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-3.0.2.tgz",
+          "integrity": "sha1-mGbfOVECEw449/mWvOtlRDIJwls=",
+          "dev": true
         },
-        "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
-        },
-        "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
-        },
-        "json-stable-stringify-without-jsonify": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/json-stable-stringify-without-jsonify/-/json-stable-stringify-without-jsonify-1.0.1.tgz",
-            "integrity": "sha1-nbe1lJatPzz+8wp1FC0tkwrXJlE=",
-            "dev": true
-        },
-        "json3": {
-            "version": "3.3.3",
-            "resolved": "https://registry.npmjs.org/json3/-/json3-3.3.3.tgz",
-            "integrity": "sha512-c7/8mbUsKigAbLkD5B010BK4D9LZm7A1pNItkEwiUZRpIN66exu/e7YQWysGun+TRKaJp8MhemM+VkfWv42aCA==",
-            "dev": true
+        "strip-ansi": {
+          "version": "3.0.1",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-3.0.1.tgz",
+          "integrity": "sha1-ajhfuIU9lS1f8F0Oiq+UJ43GPc8=",
+          "dev": true,
+          "requires": {
+            "ansi-regex": "^2.0.0"
+          }
         },
+        "supports-color": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-2.0.0.tgz",
+          "integrity": "sha1-U10EXOa2Nj+kARcIRimZXp3zJMc=",
+          "dev": true
+        }
+      }
+    },
+    "babel-helper-function-name": {
+      "version": "6.24.1",
+      "resolved": "https://registry.npmjs.org/babel-helper-function-name/-/babel-helper-function-name-6.24.1.tgz",
+      "integrity": "sha1-00dbjAPtmCQqJbSDUasYOZ01gKk=",
+      "dev": true,
+      "requires": {
+        "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": {
+      "version": "6.24.1",
+      "resolved": "https://registry.npmjs.org/babel-helper-get-function-arity/-/babel-helper-get-function-arity-6.24.1.tgz",
+      "integrity": "sha1-j3eCqpNAfEHTqlCQj4mwMbG2hT0=",
+      "dev": true,
+      "requires": {
+        "babel-runtime": "^6.22.0",
+        "babel-types": "^6.24.1"
+      }
+    },
+    "babel-loader": {
+      "version": "8.2.2",
+      "resolved": "https://registry.npmjs.org/babel-loader/-/babel-loader-8.2.2.tgz",
+      "integrity": "sha512-JvTd0/D889PQBtUXJ2PXaKU/pjZDMtHA9V2ecm+eNRmmBCMR09a+fmpGTNwnJtFmFl5Ei7Vy47LjBb+L0wQ99g==",
+      "dev": true,
+      "requires": {
+        "find-cache-dir": "^3.3.1",
+        "loader-utils": "^1.4.0",
+        "make-dir": "^3.1.0",
+        "schema-utils": "^2.6.5"
+      },
+      "dependencies": {
         "json5": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/json5/-/json5-2.2.0.tgz",
-            "integrity": "sha512-f+8cldu7X/y7RAJurMEJmdoKXGB/X550w2Nr3tTbezL6RwEE/iMcm+tZnXeoZtKuOq6ft8+CqzEkrIgx1fPoQA==",
-            "dev": true,
-            "requires": {
-                "minimist": "^1.2.5"
-            }
-        },
-        "killable": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/killable/-/killable-1.0.1.tgz",
-            "integrity": "sha512-LzqtLKlUwirEUyl/nicirVmNiPvYs7l5n8wOPP7fyJVpUPkvCnW/vuiXGpylGUlnPDnB7311rARzAt3Mhswpjg==",
-            "dev": true
-        },
-        "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
-        },
-        "levn": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/levn/-/levn-0.4.1.tgz",
-            "integrity": "sha512-+bT2uH4E5LGE7h/n3evcS/sQlJXCpIp6ym8OWJ5eV6+67Dsql/LaaT7qJBAt2rzfoa/5QBGBhxDix1dMt2kQKQ==",
-            "dev": true,
-            "requires": {
-                "prelude-ls": "^1.2.1",
-                "type-check": "~0.4.0"
-            }
-        },
-        "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
-        },
-        "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,
-            "requires": {
-                "p-locate": "^4.1.0"
-            }
-        },
-        "lodash": {
-            "version": "4.17.21",
-            "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
-            "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg=="
-        },
-        "lodash.debounce": {
-            "version": "4.0.8",
-            "resolved": "https://registry.npmjs.org/lodash.debounce/-/lodash.debounce-4.0.8.tgz",
-            "integrity": "sha1-gteb/zCmfEAF/9XiUVMArZyk168=",
-            "dev": true
-        },
-        "loglevel": {
-            "version": "1.7.1",
-            "resolved": "https://registry.npmjs.org/loglevel/-/loglevel-1.7.1.tgz",
-            "integrity": "sha512-Hesni4s5UkWkwCGJMQGAh71PaLUmKFM60dHvq0zi/vDhhrzuk+4GgNbTXJ12YYQJn6ZKBDNIjYcuQGKudvqrIw==",
-            "dev": true
-        },
-        "lru-cache": {
-            "version": "6.0.0",
-            "resolved": "https://registry.npmjs.org/lru-cache/-/lru-cache-6.0.0.tgz",
-            "integrity": "sha512-Jo6dJ04CmSjuznwJSS3pUeWmd/H0ffTlkXXgwZi+eq1UCmqQwCh+eLsYOYCwY991i2Fah4h1BEMCx4qThGbsiA==",
-            "dev": true,
-            "requires": {
-                "yallist": "^4.0.0"
-            }
+          "version": "1.0.1",
+          "resolved": "https://registry.npmjs.org/json5/-/json5-1.0.1.tgz",
+          "integrity": "sha512-aKS4WQjPenRxiQsC93MNfjx+nbF4PAdYzmd/1JIj8HYzqfbu86beTuNgXDzPknWk0n0uARlyewZo4s++ES36Ow==",
+          "dev": true,
+          "requires": {
+            "minimist": "^1.2.0"
+          }
+        },
+        "loader-utils": {
+          "version": "1.4.0",
+          "resolved": "https://registry.npmjs.org/loader-utils/-/loader-utils-1.4.0.tgz",
+          "integrity": "sha512-qH0WSMBtn/oHuwjy/NucEgbx5dbxxnxup9s4PVXJUDHZBQY+s0NWA9rJf53RBnQZxfch7euUui7hpoAPvALZdA==",
+          "dev": true,
+          "requires": {
+            "big.js": "^5.2.2",
+            "emojis-list": "^3.0.0",
+            "json5": "^1.0.1"
+          }
         },
         "make-dir": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-2.1.0.tgz",
-            "integrity": "sha512-LS9X+dc8KLxXCb8dni79fLIIUA5VyZoyjSMCwTluaXA0o27cCK0bhXkpgw+sTXVpPy/lSO57ilRixqk0vDmtRA==",
-            "dev": true,
-            "requires": {
-                "pify": "^4.0.1",
-                "semver": "^5.6.0"
-            },
-            "dependencies": {
-                "semver": {
-                    "version": "5.7.1",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-5.7.1.tgz",
-                    "integrity": "sha512-sauaDf/PZdVgrLTNYHRtpXa1iRiKcaebiKQ1BJdpQlWH2lCvexQdX55snPFyK7QzpudqbCI0qXFfOasHdyNDGQ==",
-                    "dev": true
-                }
-            }
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-3.1.0.tgz",
+          "integrity": "sha512-g3FeP20LNwhALb/6Cz6Dd4F2ngze0jz7tbzrD2wAV+o9FeNHe4rL+yK2md0J/fiSf1sa1ADhXqi5+oVwOM/eGw==",
+          "dev": true,
+          "requires": {
+            "semver": "^6.0.0"
+          }
         },
-        "map-cache": {
-            "version": "0.2.2",
-            "resolved": "https://registry.npmjs.org/map-cache/-/map-cache-0.2.2.tgz",
-            "integrity": "sha1-wyq9C9ZSXZsFFkW7TyasXcmKDb8=",
-            "dev": true
-        },
-        "map-visit": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/map-visit/-/map-visit-1.0.0.tgz",
-            "integrity": "sha1-7Nyo8TFE5mDxtb1B8S80edmN+48=",
-            "dev": true,
-            "requires": {
-                "object-visit": "^1.0.0"
-            }
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
+        }
+      }
+    },
+    "babel-messages": {
+      "version": "6.23.0",
+      "resolved": "https://registry.npmjs.org/babel-messages/-/babel-messages-6.23.0.tgz",
+      "integrity": "sha1-8830cDhYA1sqKVHG7F7fbGLyYw4=",
+      "dev": true,
+      "requires": {
+        "babel-runtime": "^6.22.0"
+      }
+    },
+    "babel-plugin-dynamic-import-node": {
+      "version": "2.3.3",
+      "resolved": "https://registry.npmjs.org/babel-plugin-dynamic-import-node/-/babel-plugin-dynamic-import-node-2.3.3.tgz",
+      "integrity": "sha512-jZVI+s9Zg3IqA/kdi0i6UDCybUI3aSBLnglhYbSSjKlV7yF1F/5LWv8MakQmvYpnbJDS6fcBL2KzHSxNCMtWSQ==",
+      "dev": true,
+      "requires": {
+        "object.assign": "^4.1.0"
+      }
+    },
+    "babel-plugin-polyfill-corejs2": {
+      "version": "0.1.10",
+      "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.1.10.tgz",
+      "integrity": "sha512-DO95wD4g0A8KRaHKi0D51NdGXzvpqVLnLu5BTvDlpqUEpTmeEtypgC1xqesORaWmiUOQI14UHKlzNd9iZ2G3ZA==",
+      "dev": true,
+      "requires": {
+        "@babel/compat-data": "^7.13.0",
+        "@babel/helper-define-polyfill-provider": "^0.1.5",
+        "semver": "^6.1.1"
+      },
+      "dependencies": {
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
+        }
+      }
+    },
+    "babel-plugin-polyfill-corejs3": {
+      "version": "0.1.7",
+      "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.1.7.tgz",
+      "integrity": "sha512-u+gbS9bbPhZWEeyy1oR/YaaSpod/KDT07arZHb80aTpl8H5ZBq+uN1nN9/xtX7jQyfLdPfoqI4Rue/MQSWJquw==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-define-polyfill-provider": "^0.1.5",
+        "core-js-compat": "^3.8.1"
+      }
+    },
+    "babel-plugin-polyfill-regenerator": {
+      "version": "0.1.6",
+      "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.1.6.tgz",
+      "integrity": "sha512-OUrYG9iKPKz8NxswXbRAdSwF0GhRdIEMTloQATJi4bDuFqrXaXcCUT/VGNrr8pBcjMh1RxZ7Xt9cytVJTJfvMg==",
+      "dev": true,
+      "requires": {
+        "@babel/helper-define-polyfill-provider": "^0.1.5"
+      }
+    },
+    "babel-plugin-syntax-class-properties": {
+      "version": "6.13.0",
+      "resolved": "https://registry.npmjs.org/babel-plugin-syntax-class-properties/-/babel-plugin-syntax-class-properties-6.13.0.tgz",
+      "integrity": "sha1-1+sjt5oxf4VDlixQW4J8fWysJ94=",
+      "dev": true
+    },
+    "babel-plugin-transform-class-properties": {
+      "version": "6.24.1",
+      "resolved": "https://registry.npmjs.org/babel-plugin-transform-class-properties/-/babel-plugin-transform-class-properties-6.24.1.tgz",
+      "integrity": "sha1-anl2PqYdM9NvN7YRqp3vgagbRqw=",
+      "dev": true,
+      "requires": {
+        "babel-helper-function-name": "^6.24.1",
+        "babel-plugin-syntax-class-properties": "^6.8.0",
+        "babel-runtime": "^6.22.0",
+        "babel-template": "^6.24.1"
+      }
+    },
+    "babel-runtime": {
+      "version": "6.26.0",
+      "resolved": "https://registry.npmjs.org/babel-runtime/-/babel-runtime-6.26.0.tgz",
+      "integrity": "sha1-llxwWGaOgrVde/4E/yM3vItWR/4=",
+      "requires": {
+        "core-js": "^2.4.0",
+        "regenerator-runtime": "^0.11.0"
+      },
+      "dependencies": {
+        "regenerator-runtime": {
+          "version": "0.11.1",
+          "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.11.1.tgz",
+          "integrity": "sha512-MguG95oij0fC3QV3URf4V2SDYGJhJnJGqvIIgdECeODCT98wSWDAJ94SSuVpYQUoTcGUIL6L4yNB7j1DFFHSBg=="
+        }
+      }
+    },
+    "babel-template": {
+      "version": "6.26.0",
+      "resolved": "https://registry.npmjs.org/babel-template/-/babel-template-6.26.0.tgz",
+      "integrity": "sha1-3gPi0WOWsGn0bdn/+FIfsaDjXgI=",
+      "dev": true,
+      "requires": {
+        "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": {
+      "version": "6.26.0",
+      "resolved": "https://registry.npmjs.org/babel-traverse/-/babel-traverse-6.26.0.tgz",
+      "integrity": "sha1-RqnL1+3MYsjlwGTi0tjQ9ANXZu4=",
+      "dev": true,
+      "requires": {
+        "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"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "mathjs": {
-            "version": "9.3.0",
-            "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-9.3.0.tgz",
-            "integrity": "sha512-0kYW+TXgB8lCqUj5wHR2hqAO2twSbPRelSFgRJXiwAx4nM6FrIb43Jd6XhW7sVbwYB+9HCNiyg5Kn8VYeB7ilg==",
-            "requires": {
-                "complex.js": "^2.0.11",
-                "decimal.js": "^10.2.1",
-                "escape-latex": "^1.2.0",
-                "fraction.js": "^4.0.13",
-                "javascript-natural-sort": "^0.7.1",
-                "seedrandom": "^3.0.5",
-                "tiny-emitter": "^2.1.0",
-                "typed-function": "^2.0.0"
-            }
+        "globals": {
+          "version": "9.18.0",
+          "resolved": "https://registry.npmjs.org/globals/-/globals-9.18.0.tgz",
+          "integrity": "sha512-S0nG3CLEQiY/ILxqtztTWH/3iRRdyBLw6KMDxnKMchrtbj2OFmehVh0WUCfW3DUrIgx/qFrJPICrq4Z4sTR9UQ==",
+          "dev": true
         },
-        "media-typer": {
-            "version": "0.3.0",
-            "resolved": "https://registry.npmjs.org/media-typer/-/media-typer-0.3.0.tgz",
-            "integrity": "sha1-hxDXrwqmJvj/+hzgAWhUUmMlV0g=",
-            "dev": true
-        },
-        "memory-fs": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/memory-fs/-/memory-fs-0.4.1.tgz",
-            "integrity": "sha1-OpoguEYlI+RHz7x+i7gO1me/xVI=",
-            "dev": true,
-            "requires": {
-                "errno": "^0.1.3",
-                "readable-stream": "^2.0.1"
-            }
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
+        }
+      }
+    },
+    "babel-types": {
+      "version": "6.26.0",
+      "resolved": "https://registry.npmjs.org/babel-types/-/babel-types-6.26.0.tgz",
+      "integrity": "sha1-o7Bz+Uq0nrb6Vc1lInozQ4BjJJc=",
+      "dev": true,
+      "requires": {
+        "babel-runtime": "^6.26.0",
+        "esutils": "^2.0.2",
+        "lodash": "^4.17.4",
+        "to-fast-properties": "^1.0.3"
+      },
+      "dependencies": {
+        "to-fast-properties": {
+          "version": "1.0.3",
+          "resolved": "https://registry.npmjs.org/to-fast-properties/-/to-fast-properties-1.0.3.tgz",
+          "integrity": "sha1-uDVx+k2MJbguIxsG46MFXeTKGkc=",
+          "dev": true
+        }
+      }
+    },
+    "babylon": {
+      "version": "6.18.0",
+      "resolved": "https://registry.npmjs.org/babylon/-/babylon-6.18.0.tgz",
+      "integrity": "sha512-q/UEjfGJ2Cm3oKV71DJz9d25TPnq5rhBVL2Q4fA5wcC3jcrdn7+SssEybFIxwAvvP+YCsCYNKughoF33GxgycQ==",
+      "dev": true
+    },
+    "balanced-match": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.0.tgz",
+      "integrity": "sha1-ibTRmasr7kneFk6gK4nORi1xt2c=",
+      "dev": true
+    },
+    "base": {
+      "version": "0.11.2",
+      "resolved": "https://registry.npmjs.org/base/-/base-0.11.2.tgz",
+      "integrity": "sha512-5T6P4xPgpp0YDFvSWwEZ4NoE3aM4QBQXDzmVbraCkFj8zHM+mba8SyqB5DbZWyR7mYHo6Y7BdQo3MoA4m0TeQg==",
+      "dev": true,
+      "requires": {
+        "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"
+      },
+      "dependencies": {
+        "define-property": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
+          "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^1.0.0"
+          }
         },
-        "merge-descriptors": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/merge-descriptors/-/merge-descriptors-1.0.1.tgz",
-            "integrity": "sha1-sAqqVW3YtEVoFQ7J0blT8/kMu2E=",
-            "dev": true
-        },
-        "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
-        },
-        "merge2": {
-            "version": "1.4.1",
-            "resolved": "https://registry.npmjs.org/merge2/-/merge2-1.4.1.tgz",
-            "integrity": "sha512-8q7VEgMJW4J8tcfVPy8g09NcQwZdbwFEqhe/WZkoIzjn/3TGDwtOCYtXGxA3O8tPzpczCCDgv+P2P5y00ZJOOg==",
-            "dev": true
-        },
-        "methods": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/methods/-/methods-1.1.2.tgz",
-            "integrity": "sha1-VSmk1nZUE07cxSZmVoNbD4Ua/O4=",
-            "dev": true
+        "is-accessor-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
+          "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "micromatch": {
-            "version": "4.0.2",
-            "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.2.tgz",
-            "integrity": "sha512-y7FpHSbMUMoyPbYUSzO6PaZ6FyRnQOpHuKwbo1G+Knck95XVU4QAiKdGEnj5wwoS7PlOgthX/09u5iFJ+aYf5Q==",
-            "dev": true,
-            "requires": {
-                "braces": "^3.0.1",
-                "picomatch": "^2.0.5"
-            }
+        "is-data-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
+          "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "mime": {
-            "version": "1.6.0",
-            "resolved": "https://registry.npmjs.org/mime/-/mime-1.6.0.tgz",
-            "integrity": "sha512-x0Vn8spI+wuJ1O6S7gnbaQg8Pxh4NNHb7KSINmEWKiPE4RKOplvijn+NkmYmmRgP68mc70j2EbeTFRsrswaQeg==",
-            "dev": true
-        },
-        "mime-db": {
-            "version": "1.46.0",
-            "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.46.0.tgz",
-            "integrity": "sha512-svXaP8UQRZ5K7or+ZmfNhg2xX3yKDMUzqadsSqi4NCH/KomcH75MAMYAGVlvXn4+b/xOPhS3I2uHKRUzvjY7BQ==",
-            "dev": true
-        },
-        "mime-types": {
-            "version": "2.1.29",
-            "resolved": "https://registry.npmjs.org/mime-types/-/mime-types-2.1.29.tgz",
-            "integrity": "sha512-Y/jMt/S5sR9OaqteJtslsFZKWOIIqMACsJSiHghlCAyhf7jfVYjKBmLiX8OgpWeW+fjJ2b+Az69aPFPkUOY6xQ==",
-            "dev": true,
-            "requires": {
-                "mime-db": "1.46.0"
-            }
+        "is-descriptor": {
+          "version": "1.0.2",
+          "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
+          "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
+          "dev": true,
+          "requires": {
+            "is-accessor-descriptor": "^1.0.0",
+            "is-data-descriptor": "^1.0.0",
+            "kind-of": "^6.0.2"
+          }
+        }
+      }
+    },
+    "base64-js": {
+      "version": "1.5.1",
+      "resolved": "https://registry.npmjs.org/base64-js/-/base64-js-1.5.1.tgz",
+      "integrity": "sha512-AKpaYlHn8t4SVbOHCy+b5+KKgvR4vrsD8vbvrbiQJps7fKDTkjkDry6ji0rUJjC0kzbNePLwzxq8iypo41qeWA=="
+    },
+    "batch": {
+      "version": "0.6.1",
+      "resolved": "https://registry.npmjs.org/batch/-/batch-0.6.1.tgz",
+      "integrity": "sha1-3DQxT05nkxgJP8dgJyUl+UvyXBY=",
+      "dev": true
+    },
+    "big.js": {
+      "version": "5.2.2",
+      "resolved": "https://registry.npmjs.org/big.js/-/big.js-5.2.2.tgz",
+      "integrity": "sha512-vyL2OymJxmarO8gxMr0mhChsO9QGwhynfuu4+MHTAW6czfq9humCB7rKpUjDd9YUiDPU4mzpyupFSvOClAwbmQ==",
+      "dev": true
+    },
+    "binary-extensions": {
+      "version": "1.13.1",
+      "resolved": "https://registry.npmjs.org/binary-extensions/-/binary-extensions-1.13.1.tgz",
+      "integrity": "sha512-Un7MIEDdUC5gNpcGDV97op1Ywk748MpHcFTHoYs6qnj1Z3j7I53VG3nwZhKzoBZmbdRNnb6WRdFlwl7tSDuZGw==",
+      "dev": true
+    },
+    "bindings": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmjs.org/bindings/-/bindings-1.5.0.tgz",
+      "integrity": "sha512-p2q/t/mhvuOj/UeLlV6566GD/guowlr0hHxClI0W9m7MWYkL1F0hLo+0Aexs9HSPCtR1SXQ0TD3MMKrXZajbiQ==",
+      "dev": true,
+      "optional": true,
+      "requires": {
+        "file-uri-to-path": "1.0.0"
+      }
+    },
+    "blob": {
+      "version": "0.0.4",
+      "resolved": "https://registry.npmjs.org/blob/-/blob-0.0.4.tgz",
+      "integrity": "sha1-vPEwUspURj8w+fx+lbmkdjCpSSE="
+    },
+    "blob-stream": {
+      "version": "0.1.3",
+      "resolved": "https://registry.npmjs.org/blob-stream/-/blob-stream-0.1.3.tgz",
+      "integrity": "sha1-mNZor2mW4PMu9mbQbiFczH13aGw=",
+      "requires": {
+        "blob": "0.0.4"
+      }
+    },
+    "body-parser": {
+      "version": "1.19.0",
+      "resolved": "https://registry.npmjs.org/body-parser/-/body-parser-1.19.0.tgz",
+      "integrity": "sha512-dhEPs72UPbDnAQJ9ZKMNTP6ptJaionhP5cBb541nXPlW60Jepo9RV/a4fX4XWW9CuFNK22krhrj1+rgzifNCsw==",
+      "dev": true,
+      "requires": {
+        "bytes": "3.1.0",
+        "content-type": "~1.0.4",
+        "debug": "2.6.9",
+        "depd": "~1.1.2",
+        "http-errors": "1.7.2",
+        "iconv-lite": "0.4.24",
+        "on-finished": "~2.3.0",
+        "qs": "6.7.0",
+        "raw-body": "2.4.0",
+        "type-is": "~1.6.17"
+      },
+      "dependencies": {
+        "bytes": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.0.tgz",
+          "integrity": "sha512-zauLjrfCG+xvoyaqLoV8bLVXXNGC4JqlxFCutSDWA6fJrTo2ZuvLYTqZ7aHBLZSMOopbzwv8f+wZcVzfVTI2Dg==",
+          "dev": true
         },
-        "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
-        },
-        "minimalistic-assert": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/minimalistic-assert/-/minimalistic-assert-1.0.1.tgz",
-            "integrity": "sha512-UtJcAD4yEaGtjPezWuO9wC4nwUnVH/8/Im3yEHQP4b67cXlD/Qr9hdITCU1xDbSEXg2XKNaP8jsReV7vQd00/A==",
-            "dev": true
-        },
-        "minimatch": {
-            "version": "3.0.4",
-            "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.4.tgz",
-            "integrity": "sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==",
-            "dev": true,
-            "requires": {
-                "brace-expansion": "^1.1.7"
-            }
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "minimist": {
-            "version": "1.2.5",
-            "resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.5.tgz",
-            "integrity": "sha512-FM9nNUYrRBAELZQT3xeZQ7fmMOBg6nWNmJKTcgsJeaLstP/UODVpGsr5OhXhhXg6f+qtJ8uiZ+PUxkDWcgIXLw==",
-            "dev": true
-        },
-        "mixin-deep": {
-            "version": "1.3.2",
-            "resolved": "https://registry.npmjs.org/mixin-deep/-/mixin-deep-1.3.2.tgz",
-            "integrity": "sha512-WRoDn//mXBiJ1H40rqa3vH0toePwSsGb45iInWlTySa+Uu4k3tYUSxa2v1KqAiLtvlrSzaExqS1gtk96A9zvEA==",
-            "dev": true,
-            "requires": {
-                "for-in": "^1.0.2",
-                "is-extendable": "^1.0.1"
-            },
-            "dependencies": {
-                "is-extendable": {
-                    "version": "1.0.1",
-                    "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-1.0.1.tgz",
-                    "integrity": "sha512-arnXMxT1hhoKo9k1LZdmlNyJdDDfy2v0fXjFlmok4+i8ul/6WlbVge9bhM74OpNPQPMGUToDtz+KXa1PneJxOA==",
-                    "dev": true,
-                    "requires": {
-                        "is-plain-object": "^2.0.4"
-                    }
-                }
-            }
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
+        }
+      }
+    },
+    "bonjour": {
+      "version": "3.5.0",
+      "resolved": "https://registry.npmjs.org/bonjour/-/bonjour-3.5.0.tgz",
+      "integrity": "sha1-jokKGD2O6aI5OzhExpGkK897yfU=",
+      "dev": true,
+      "requires": {
+        "array-flatten": "^2.1.0",
+        "deep-equal": "^1.0.1",
+        "dns-equal": "^1.0.0",
+        "dns-txt": "^2.0.2",
+        "multicast-dns": "^6.0.1",
+        "multicast-dns-service-types": "^1.1.0"
+      }
+    },
+    "brace-expansion": {
+      "version": "1.1.11",
+      "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.11.tgz",
+      "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==",
+      "dev": true,
+      "requires": {
+        "balanced-match": "^1.0.0",
+        "concat-map": "0.0.1"
+      }
+    },
+    "braces": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.2.tgz",
+      "integrity": "sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==",
+      "dev": true,
+      "requires": {
+        "fill-range": "^7.0.1"
+      }
+    },
+    "brfs": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/brfs/-/brfs-2.0.2.tgz",
+      "integrity": "sha512-IrFjVtwu4eTJZyu8w/V2gxU7iLTtcHih67sgEdzrhjLBMHp2uYefUBfdM4k2UvcuWMgV7PQDZHSLeNWnLFKWVQ==",
+      "requires": {
+        "quote-stream": "^1.0.1",
+        "resolve": "^1.1.5",
+        "static-module": "^3.0.2",
+        "through2": "^2.0.0"
+      }
+    },
+    "brotli": {
+      "version": "1.3.2",
+      "resolved": "https://registry.npmjs.org/brotli/-/brotli-1.3.2.tgz",
+      "integrity": "sha1-UlqcrU/LqWR119OI9q7LE+7VL0Y=",
+      "requires": {
+        "base64-js": "^1.1.2"
+      }
+    },
+    "browser-resolve": {
+      "version": "1.11.3",
+      "resolved": "https://registry.npmjs.org/browser-resolve/-/browser-resolve-1.11.3.tgz",
+      "integrity": "sha512-exDi1BYWB/6raKHmDTCicQfTkqwN5fioMFV4j8BsfMU4R2DK/QfZfK7kOVkmWCNANf0snkBzqGqAJBao9gZMdQ==",
+      "requires": {
+        "resolve": "1.1.7"
+      },
+      "dependencies": {
+        "resolve": {
+          "version": "1.1.7",
+          "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.1.7.tgz",
+          "integrity": "sha1-IDEU2CrSxe2ejgQRs5ModeiJ6Xs="
+        }
+      }
+    },
+    "browserify-optional": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/browserify-optional/-/browserify-optional-1.0.1.tgz",
+      "integrity": "sha1-HhNyLP3g2F8SFnbCpyztUzoBiGk=",
+      "requires": {
+        "ast-transform": "0.0.0",
+        "ast-types": "^0.7.0",
+        "browser-resolve": "^1.8.1"
+      }
+    },
+    "browserslist": {
+      "version": "4.16.6",
+      "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.16.6.tgz",
+      "integrity": "sha512-Wspk/PqO+4W9qp5iUTJsa1B/QrYn1keNCcEP5OvP7WBwT4KaDly0uONYmC6Xa3Z5IqnUgS0KcgLYu1l74x0ZXQ==",
+      "dev": true,
+      "requires": {
+        "caniuse-lite": "^1.0.30001219",
+        "colorette": "^1.2.2",
+        "electron-to-chromium": "^1.3.723",
+        "escalade": "^3.1.1",
+        "node-releases": "^1.1.71"
+      },
+      "dependencies": {
+        "colorette": {
+          "version": "1.2.2",
+          "resolved": "https://registry.npmjs.org/colorette/-/colorette-1.2.2.tgz",
+          "integrity": "sha512-MKGMzyfeuutC/ZJ1cba9NqcNpfeqMUcYmyF1ZFY6/Cn7CNSAKx6a+s48sqLqyAiZuaP2TcqMhoo+dlwFnVxT9w==",
+          "dev": true
+        }
+      }
+    },
+    "buffer": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/buffer/-/buffer-6.0.3.tgz",
+      "integrity": "sha512-FTiCpNxtwiZZHEZbcbTIcZjERVICn9yq/pDFkTl95/AxzD1naBctN7YO68riM/gLSDY7sdrMby8hofADYuuqOA==",
+      "requires": {
+        "base64-js": "^1.3.1",
+        "ieee754": "^1.2.1"
+      }
+    },
+    "buffer-equal": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmjs.org/buffer-equal/-/buffer-equal-0.0.1.tgz",
+      "integrity": "sha1-kbx0sR6kBbyRa8aqkI+q+ltKrEs="
+    },
+    "buffer-from": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/buffer-from/-/buffer-from-1.1.1.tgz",
+      "integrity": "sha512-MQcXEUbCKtEo7bhqEs6560Hyd4XaovZlO/k9V3hjVUF/zwW7KBVdSK4gIt/bzwS9MbR5qob+F5jusZsb0YQK2A=="
+    },
+    "buffer-indexof": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/buffer-indexof/-/buffer-indexof-1.1.1.tgz",
+      "integrity": "sha512-4/rOEg86jivtPTeOUUT61jJO1Ya1TrR/OkqCSZDyq84WJh3LuuiphBYJN+fm5xufIk4XAFcEwte/8WzC8If/1g==",
+      "dev": true
+    },
+    "bytes": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.0.0.tgz",
+      "integrity": "sha1-0ygVQE1olpn4Wk6k+odV3ROpYEg=",
+      "dev": true
+    },
+    "cache-base": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/cache-base/-/cache-base-1.0.1.tgz",
+      "integrity": "sha512-AKcdTnFSWATd5/GCPRxr2ChwIJ85CeyrEyjRHlKxQ56d4XJMGym0uAiKn0xbLOGOl3+yRpOTi484dVCEc5AUzQ==",
+      "dev": true,
+      "requires": {
+        "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"
+      }
+    },
+    "call-bind": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/call-bind/-/call-bind-1.0.2.tgz",
+      "integrity": "sha512-7O+FbCihrB5WGbFYesctwmTKae6rOiIzmz1icreWJ+0aA7LJfuqhEso2T9ncpcFtzMQtzXf2QGGueWJGTYsqrA==",
+      "requires": {
+        "function-bind": "^1.1.1",
+        "get-intrinsic": "^1.0.2"
+      }
+    },
+    "callsites": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/callsites/-/callsites-3.1.0.tgz",
+      "integrity": "sha512-P8BjAsXvZS+VIDUI11hHCQEv74YT67YUi5JJFNWIqL235sBmjX4+qx9Muvls5ivyNENctx46xQLQ3aTuE7ssaQ==",
+      "dev": true
+    },
+    "camelcase": {
+      "version": "5.3.1",
+      "resolved": "https://registry.npmjs.org/camelcase/-/camelcase-5.3.1.tgz",
+      "integrity": "sha512-L28STB170nwWS63UjtlEOE3dldQApaJXZkOI1uMFfzf3rRuPegHaHesyee+YxQ+W6SvRDQV6UrdOdRiR153wJg==",
+      "dev": true
+    },
+    "caniuse-lite": {
+      "version": "1.0.30001236",
+      "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001236.tgz",
+      "integrity": "sha512-o0PRQSrSCGJKCPZcgMzl5fUaj5xHe8qA2m4QRvnyY4e1lITqoNkr7q/Oh1NcpGSy0Th97UZ35yoKcINPoq7YOQ==",
+      "dev": true
+    },
+    "canvas2pdf": {
+      "version": "1.0.7",
+      "resolved": "https://registry.npmjs.org/canvas2pdf/-/canvas2pdf-1.0.7.tgz",
+      "integrity": "sha512-/+Hvpr2BRJMJHse0/eL/sdNSThOaf/Hlrgw+rYYLYxvS2jagFKrU/rc8W0TNsKNvBSQrBnfi+p71tmoOBt5qaQ==",
+      "requires": {
+        "pdfkit": "^0.8.3"
+      }
+    },
+    "chalk": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmjs.org/chalk/-/chalk-4.1.0.tgz",
+      "integrity": "sha512-qwx12AxXe2Q5xQ43Ac//I6v5aXTipYrSESdOgzrN+9XjgEpyjpKuvSGaN4qE93f7TQTlerQQ8S+EQ0EyDoVL1A==",
+      "dev": true,
+      "requires": {
+        "ansi-styles": "^4.1.0",
+        "supports-color": "^7.1.0"
+      }
+    },
+    "chokidar": {
+      "version": "3.5.1",
+      "resolved": "https://registry.npmjs.org/chokidar/-/chokidar-3.5.1.tgz",
+      "integrity": "sha512-9+s+Od+W0VJJzawDma/gvBNQqkTiqYTWLuZoyAsivsI4AaWTCzHG06/TMjsf1cYe9Cb97UCEhjz7HvnPk2p/tw==",
+      "dev": true,
+      "optional": true,
+      "requires": {
+        "anymatch": "~3.1.1",
+        "braces": "~3.0.2",
+        "fsevents": "~2.3.1",
+        "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"
+      },
+      "dependencies": {
+        "anymatch": {
+          "version": "3.1.1",
+          "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-3.1.1.tgz",
+          "integrity": "sha512-mM8522psRCqzV+6LhomX5wgp25YVibjh8Wj23I5RPkPppSVSjyKD2A2mBJmWGa+KN7f2D6LNh9jkBCeyLktzjg==",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "normalize-path": "^3.0.0",
+            "picomatch": "^2.0.4"
+          }
         },
-        "mkdirp": {
-            "version": "0.5.5",
-            "resolved": "https://registry.npmjs.org/mkdirp/-/mkdirp-0.5.5.tgz",
-            "integrity": "sha512-NKmAlESf6jMGym1++R0Ra7wvhV+wFW63FaSOFPwRahvea0gMUcGUhVeAg/0BC0wiv9ih5NYPB1Wn1UEI1/L+xQ==",
-            "dev": true,
-            "requires": {
-                "minimist": "^1.2.5"
-            }
+        "binary-extensions": {
+          "version": "2.2.0",
+          "resolved": "https://registry.npmjs.org/binary-extensions/-/binary-extensions-2.2.0.tgz",
+          "integrity": "sha512-jDctJ/IVQbZoJykoeHbhXpOlNBqGNcwXJKJog42E5HDPUwQTSdjCHdihjj0DlnheQ7blbT6dHOafNAiS8ooQKA==",
+          "dev": true,
+          "optional": true
         },
-        "ms": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz",
-            "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==",
-            "dev": true
-        },
-        "multicast-dns": {
-            "version": "6.2.3",
-            "resolved": "https://registry.npmjs.org/multicast-dns/-/multicast-dns-6.2.3.tgz",
-            "integrity": "sha512-ji6J5enbMyGRHIAkAOu3WdV8nggqviKCEKtXcOqfphZZtQrmHKycfynJ2V7eVPUA4NhJ6V7Wf4TmGbTwKE9B6g==",
-            "dev": true,
-            "requires": {
-                "dns-packet": "^1.3.1",
-                "thunky": "^1.0.2"
-            }
+        "is-binary-path": {
+          "version": "2.1.0",
+          "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-2.1.0.tgz",
+          "integrity": "sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "binary-extensions": "^2.0.0"
+          }
         },
-        "multicast-dns-service-types": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/multicast-dns-service-types/-/multicast-dns-service-types-1.1.0.tgz",
-            "integrity": "sha1-iZ8R2WhuXgXLkbNdXw5jt3PPyQE=",
-            "dev": true
-        },
-        "nan": {
-            "version": "2.14.2",
-            "resolved": "https://registry.npmjs.org/nan/-/nan-2.14.2.tgz",
-            "integrity": "sha512-M2ufzIiINKCuDfBSAUr1vWQ+vuVcA9kqx8JJUsbQi6yf1uGRyb7HfpdfUr5qLXf3B/t8dPvcjhKMmlfnP47EzQ==",
-            "dev": true,
-            "optional": true
-        },
-        "nanomatch": {
-            "version": "1.2.13",
-            "resolved": "https://registry.npmjs.org/nanomatch/-/nanomatch-1.2.13.tgz",
-            "integrity": "sha512-fpoe2T0RbHwBTBUOftAfBPaDEi06ufaUai0mE6Yn1kacc3SnTErfb/h+X94VXzI64rKFHYImXSvdwGGCmwOqCA==",
-            "dev": true,
-            "requires": {
-                "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"
-            }
+        "readdirp": {
+          "version": "3.5.0",
+          "resolved": "https://registry.npmjs.org/readdirp/-/readdirp-3.5.0.tgz",
+          "integrity": "sha512-cMhu7c/8rdhkHXWsY+osBhfSy0JikwpHK/5+imo+LpeasTF8ouErHrlYkwT0++njiyuDvc7OFY5T3ukvZ8qmFQ==",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "picomatch": "^2.2.1"
+          }
+        }
+      }
+    },
+    "chrome-trace-event": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/chrome-trace-event/-/chrome-trace-event-1.0.2.tgz",
+      "integrity": "sha512-9e/zx1jw7B4CO+c/RXoCsfg/x1AfUBioy4owYH0bJprEYAx5hRFLRhWBqHAG57D0ZM4H7vxbP7bPe0VwhQRYDQ==",
+      "dev": true,
+      "requires": {
+        "tslib": "^1.9.0"
+      }
+    },
+    "class-utils": {
+      "version": "0.3.6",
+      "resolved": "https://registry.npmjs.org/class-utils/-/class-utils-0.3.6.tgz",
+      "integrity": "sha512-qOhPa/Fj7s6TY8H8esGu5QNpMMQxz79h+urzrNYN6mn+9BnxlDGf5QZ+XeCDsxSjPqsSR56XOZOJmpeurnLMeg==",
+      "dev": true,
+      "requires": {
+        "arr-union": "^3.1.0",
+        "define-property": "^0.2.5",
+        "isobject": "^3.0.0",
+        "static-extend": "^0.1.1"
+      },
+      "dependencies": {
+        "define-property": {
+          "version": "0.2.5",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
+          "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^0.1.0"
+          }
+        }
+      }
+    },
+    "cliui": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/cliui/-/cliui-5.0.0.tgz",
+      "integrity": "sha512-PYeGSEmmHM6zvoef2w8TPzlrnNpXIjTipYK780YswmIP9vjxmd6Y2a3CB2Ks6/AU8NHjZugXvo8w3oWM2qnwXA==",
+      "dev": true,
+      "requires": {
+        "string-width": "^3.1.0",
+        "strip-ansi": "^5.2.0",
+        "wrap-ansi": "^5.1.0"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
+          "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
+          "dev": true
         },
-        "natural-compare": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/natural-compare/-/natural-compare-1.4.0.tgz",
-            "integrity": "sha1-Sr6/7tdUHywnrPspvbvRXI1bpPc=",
-            "dev": true
-        },
-        "negotiator": {
-            "version": "0.6.2",
-            "resolved": "https://registry.npmjs.org/negotiator/-/negotiator-0.6.2.tgz",
-            "integrity": "sha512-hZXc7K2e+PgeI1eDBe/10Ard4ekbfrrqG8Ep+8Jmf4JID2bNg7NvCPOZN+kfF574pFQI7mum2AUqDidoKqcTOw==",
-            "dev": true
-        },
-        "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
-        },
-        "nice-try": {
-            "version": "1.0.5",
-            "resolved": "https://registry.npmjs.org/nice-try/-/nice-try-1.0.5.tgz",
-            "integrity": "sha512-1nh45deeb5olNY7eX82BkPO7SSxR5SSYJiPTrTdFUVYwAl8CKMA5N9PjTYkHiRjisVcxcQ1HXdLhx2qxxJzLNQ==",
-            "dev": true
-        },
-        "node-forge": {
-            "version": "0.10.0",
-            "resolved": "https://registry.npmjs.org/node-forge/-/node-forge-0.10.0.tgz",
-            "integrity": "sha512-PPmu8eEeG9saEUvI97fm4OYxXVB6bFvyNTyiUOBichBpFG8A1Ljw3bY62+5oOjDEMHRnd0Y7HQ+x7uzxOzC6JA==",
-            "dev": true
-        },
-        "node-releases": {
-            "version": "1.1.73",
-            "resolved": "https://registry.npmjs.org/node-releases/-/node-releases-1.1.73.tgz",
-            "integrity": "sha512-uW7fodD6pyW2FZNZnp/Z3hvWKeEW1Y8R1+1CnErE8cXFXzl5blBOoVB41CvMer6P6Q0S5FXDwcHgFd1Wj0U9zg==",
-            "dev": true
+        "emoji-regex": {
+          "version": "7.0.3",
+          "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
+          "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
+          "dev": true
         },
-        "normalize-path": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-3.0.0.tgz",
-            "integrity": "sha512-6eZs5Ls3WtCisHWp9S2GUy8dqkpGi4BVSz3GaqiE6ezub0512ESztXUwUB6C6IKbQkY2Pnb/mD4WYojCRwcwLA==",
-            "dev": true
+        "is-fullwidth-code-point": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
+          "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
+          "dev": true
         },
-        "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,
-            "requires": {
-                "path-key": "^3.0.0"
-            }
+        "string-width": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
+          "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
+          "dev": true,
+          "requires": {
+            "emoji-regex": "^7.0.1",
+            "is-fullwidth-code-point": "^2.0.0",
+            "strip-ansi": "^5.1.0"
+          }
         },
-        "object-assign": {
-            "version": "4.1.1",
-            "resolved": "https://registry.npmjs.org/object-assign/-/object-assign-4.1.1.tgz",
-            "integrity": "sha1-IQmtx5ZYh8/AXLvUQsrIv7s2CGM=",
-            "dev": true
-        },
-        "object-copy": {
-            "version": "0.1.0",
-            "resolved": "https://registry.npmjs.org/object-copy/-/object-copy-0.1.0.tgz",
-            "integrity": "sha1-fn2Fi3gb18mRpBupde04EnVOmYw=",
-            "dev": true,
-            "requires": {
-                "copy-descriptor": "^0.1.0",
-                "define-property": "^0.2.5",
-                "kind-of": "^3.0.3"
-            },
-            "dependencies": {
-                "define-property": {
-                    "version": "0.2.5",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-                    "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^0.1.0"
-                    }
-                },
-                "kind-of": {
-                    "version": "3.2.2",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                    "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                    "dev": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                }
-            }
+        "strip-ansi": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
+          "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
+          "dev": true,
+          "requires": {
+            "ansi-regex": "^4.1.0"
+          }
+        }
+      }
+    },
+    "clone": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/clone/-/clone-1.0.4.tgz",
+      "integrity": "sha1-2jCcwmPfFZlMaIypAheco8fNfH4="
+    },
+    "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,
+      "requires": {
+        "is-plain-object": "^2.0.4",
+        "kind-of": "^6.0.2",
+        "shallow-clone": "^3.0.0"
+      }
+    },
+    "collection-visit": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/collection-visit/-/collection-visit-1.0.0.tgz",
+      "integrity": "sha1-S8A3PBZLwykbTTaMgpzxqApZ3KA=",
+      "dev": true,
+      "requires": {
+        "map-visit": "^1.0.0",
+        "object-visit": "^1.0.0"
+      }
+    },
+    "color-convert": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-2.0.1.tgz",
+      "integrity": "sha512-RRECPsj7iu/xb5oKYcsFHSppFNnsj/52OVTRKb4zP5onXwVF3zVmmToNcOfGC+CRDpfK/U584fMg38ZHCaElKQ==",
+      "dev": true,
+      "requires": {
+        "color-name": "~1.1.4"
+      }
+    },
+    "color-name": {
+      "version": "1.1.4",
+      "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.4.tgz",
+      "integrity": "sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA==",
+      "dev": true
+    },
+    "colorette": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/colorette/-/colorette-1.2.1.tgz",
+      "integrity": "sha512-puCDz0CzydiSYOrnXpz/PKd69zRrribezjtE9yd4zvytoRc8+RY/KJPvtPFKZS3E3wP6neGyMe0vOTlHO5L3Pw==",
+      "dev": true
+    },
+    "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
+    },
+    "commondir": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/commondir/-/commondir-1.0.1.tgz",
+      "integrity": "sha1-3dgA2gxmEnOTzKWVDqloo6rxJTs=",
+      "dev": true
+    },
+    "complex.js": {
+      "version": "2.0.12",
+      "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.0.12.tgz",
+      "integrity": "sha512-oQX99fwL6LrTVg82gDY1dIWXy6qZRnRL35N+YhIX0N7tSwsa0KFy6IEMHTNuCW4mP7FS7MEqZ/2I/afzYwPldw=="
+    },
+    "component-emitter": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmjs.org/component-emitter/-/component-emitter-1.3.0.tgz",
+      "integrity": "sha512-Rd3se6QB+sO1TwqZjscQrurpEPIfO0/yYnSin6Q/rD3mOutHvUrCAhJub3r90uNb+SESBuE0QYoB90YdfatsRg==",
+      "dev": true
+    },
+    "compressible": {
+      "version": "2.0.18",
+      "resolved": "https://registry.npmjs.org/compressible/-/compressible-2.0.18.tgz",
+      "integrity": "sha512-AF3r7P5dWxL8MxyITRMlORQNaOA2IkAFaTr4k7BUumjPtRpGDTZpl0Pb1XCO6JeDCBdp126Cgs9sMxqSjgYyRg==",
+      "dev": true,
+      "requires": {
+        "mime-db": ">= 1.43.0 < 2"
+      }
+    },
+    "compression": {
+      "version": "1.7.4",
+      "resolved": "https://registry.npmjs.org/compression/-/compression-1.7.4.tgz",
+      "integrity": "sha512-jaSIDzP9pZVS4ZfQ+TzvtiWhdpFhE2RDHz8QJkpX9SIpLq88VueF5jJw6t+6CUQcAoA6t+x89MLrWAqpfDE8iQ==",
+      "dev": true,
+      "requires": {
+        "accepts": "~1.3.5",
+        "bytes": "3.0.0",
+        "compressible": "~2.0.16",
+        "debug": "2.6.9",
+        "on-headers": "~1.0.2",
+        "safe-buffer": "5.1.2",
+        "vary": "~1.1.2"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "object-is": {
-            "version": "1.1.5",
-            "resolved": "https://registry.npmjs.org/object-is/-/object-is-1.1.5.tgz",
-            "integrity": "sha512-3cyDsyHgtmi7I7DfSSI2LDp6SK2lwvtbg0p0R1e0RvTqF5ceGx+K2dfSjm1bKDMVCFEDAQvy+o8c6a7VujOddw==",
-            "dev": true,
-            "requires": {
-                "call-bind": "^1.0.2",
-                "define-properties": "^1.1.3"
-            }
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
         },
-        "object-keys": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/object-keys/-/object-keys-1.1.1.tgz",
-            "integrity": "sha512-NuAESUOUMrlIXOfHKzD6bpPu3tYt3xvjNdRIQ+FeT0lNb4K8WR70CaDxhuNguS2XG+GjkyMwOzsN5ZktImfhLA==",
-            "dev": true
-        },
-        "object-visit": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/object-visit/-/object-visit-1.0.1.tgz",
-            "integrity": "sha1-95xEk68MU3e1n+OdOV5BBC3QRbs=",
-            "dev": true,
-            "requires": {
-                "isobject": "^3.0.0"
-            }
+        "safe-buffer": {
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
+          "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
+          "dev": true
+        }
+      }
+    },
+    "concat-map": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz",
+      "integrity": "sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=",
+      "dev": true
+    },
+    "concat-stream": {
+      "version": "1.6.2",
+      "resolved": "https://registry.npmjs.org/concat-stream/-/concat-stream-1.6.2.tgz",
+      "integrity": "sha512-27HBghJxjiZtIk3Ycvn/4kbJk/1uZuJFfuPEns6LaEvpvG1f0hTea8lilrouyo9mVc2GWdcEZ8OLoGmSADlrCw==",
+      "requires": {
+        "buffer-from": "^1.0.0",
+        "inherits": "^2.0.3",
+        "readable-stream": "^2.2.2",
+        "typedarray": "^0.0.6"
+      }
+    },
+    "connect-history-api-fallback": {
+      "version": "1.6.0",
+      "resolved": "https://registry.npmjs.org/connect-history-api-fallback/-/connect-history-api-fallback-1.6.0.tgz",
+      "integrity": "sha512-e54B99q/OUoH64zYYRf3HBP5z24G38h5D3qXu23JGRoigpX5Ss4r9ZnDk3g0Z8uQC2x2lPaJ+UlWBc1ZWBWdLg==",
+      "dev": true
+    },
+    "content-disposition": {
+      "version": "0.5.3",
+      "resolved": "https://registry.npmjs.org/content-disposition/-/content-disposition-0.5.3.tgz",
+      "integrity": "sha512-ExO0774ikEObIAEV9kDo50o+79VCUdEB6n6lzKgGwupcVeRlhrj3qGAfwq8G6uBJjkqLrhT0qEYFcWng8z1z0g==",
+      "dev": true,
+      "requires": {
+        "safe-buffer": "5.1.2"
+      },
+      "dependencies": {
+        "safe-buffer": {
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
+          "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
+          "dev": true
+        }
+      }
+    },
+    "content-type": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/content-type/-/content-type-1.0.4.tgz",
+      "integrity": "sha512-hIP3EEPs8tB9AT1L+NUqtwOAps4mk2Zob89MWXMHjHWg9milF/j4osnnQLXBCBFBk/tvIG/tUc9mOUJiPBhPXA==",
+      "dev": true
+    },
+    "convert-source-map": {
+      "version": "1.7.0",
+      "resolved": "https://registry.npmjs.org/convert-source-map/-/convert-source-map-1.7.0.tgz",
+      "integrity": "sha512-4FJkXzKXEDB1snCFZlLP4gpC3JILicCpGbzG9f9G7tGqGCzETQ2hWPrcinA9oU4wtf2biUaEH5065UnMeR33oA==",
+      "requires": {
+        "safe-buffer": "~5.1.1"
+      },
+      "dependencies": {
+        "safe-buffer": {
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
+          "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g=="
+        }
+      }
+    },
+    "cookie": {
+      "version": "0.4.0",
+      "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.4.0.tgz",
+      "integrity": "sha512-+Hp8fLp57wnUSt0tY0tHEXh4voZRDnoIrZPqlo3DPiI4y9lwg/jqx+1Om94/W6ZaPDOUbnjOt/99w66zk+l1Xg==",
+      "dev": true
+    },
+    "cookie-signature": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmjs.org/cookie-signature/-/cookie-signature-1.0.6.tgz",
+      "integrity": "sha1-4wOogrNCzD7oylE6eZmXNNqzriw=",
+      "dev": true
+    },
+    "copy-descriptor": {
+      "version": "0.1.1",
+      "resolved": "https://registry.npmjs.org/copy-descriptor/-/copy-descriptor-0.1.1.tgz",
+      "integrity": "sha1-Z29us8OZl8LuGsOpJP1hJHSPV40=",
+      "dev": true
+    },
+    "core-js": {
+      "version": "2.6.12",
+      "resolved": "https://registry.npmjs.org/core-js/-/core-js-2.6.12.tgz",
+      "integrity": "sha512-Kb2wC0fvsWfQrgk8HU5lW6U/Lcs8+9aaYcy4ZFc6DDlo4nZ7n70dEgE5rtR0oG6ufKDUnrwfWL1mXR5ljDatrQ=="
+    },
+    "core-js-compat": {
+      "version": "3.9.1",
+      "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.9.1.tgz",
+      "integrity": "sha512-jXAirMQxrkbiiLsCx9bQPJFA6llDadKMpYrBJQJ3/c4/vsPP/fAf29h24tviRlvwUL6AmY5CHLu2GvjuYviQqA==",
+      "dev": true,
+      "requires": {
+        "browserslist": "^4.16.3",
+        "semver": "7.0.0"
+      },
+      "dependencies": {
+        "semver": {
+          "version": "7.0.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-7.0.0.tgz",
+          "integrity": "sha512-+GB6zVA9LWh6zovYQLALHwv5rb2PHGlJi3lfiqIHxR0uuwCgefcOJc59v9fv1w8GbStwxuuqqAjI9NMAOOgq1A==",
+          "dev": true
+        }
+      }
+    },
+    "core-util-is": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/core-util-is/-/core-util-is-1.0.2.tgz",
+      "integrity": "sha1-tf1UIgqivFq1eqtxQMlAdUUDwac="
+    },
+    "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,
+      "requires": {
+        "path-key": "^3.1.0",
+        "shebang-command": "^2.0.0",
+        "which": "^2.0.1"
+      }
+    },
+    "d": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/d/-/d-1.0.1.tgz",
+      "integrity": "sha512-m62ShEObQ39CfralilEQRjH6oAMtNCV1xJyEx5LpRYUVN+EviphDgUc/F3hnYbADmkiNs67Y+3ylmlG7Lnu+FA==",
+      "requires": {
+        "es5-ext": "^0.10.50",
+        "type": "^1.0.1"
+      }
+    },
+    "dagre": {
+      "version": "0.8.5",
+      "resolved": "https://registry.npmjs.org/dagre/-/dagre-0.8.5.tgz",
+      "integrity": "sha512-/aTqmnRta7x7MCCpExk7HQL2O4owCT2h8NT//9I1OQ9vt29Pa0BzSAkR5lwFUcQ7491yVi/3CXU9jQ5o0Mn2Sw==",
+      "requires": {
+        "graphlib": "^2.1.8",
+        "lodash": "^4.17.15"
+      }
+    },
+    "dash-ast": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/dash-ast/-/dash-ast-1.0.0.tgz",
+      "integrity": "sha512-Vy4dx7gquTeMcQR/hDkYLGUnwVil6vk4FOOct+djUnHOUWt+zJPJAaRIXaAFkPXtJjvlY7o3rfRu0/3hpnwoUA=="
+    },
+    "debug": {
+      "version": "4.3.1",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-4.3.1.tgz",
+      "integrity": "sha512-doEwdvm4PCeK4K3RQN2ZC2BYUBaxwLARCqZmMjtF8a51J2Rb0xpVloFRnCODwqjpwnAoao4pelN8l3RJdv3gRQ==",
+      "dev": true,
+      "requires": {
+        "ms": "2.1.2"
+      }
+    },
+    "decamelize": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/decamelize/-/decamelize-1.2.0.tgz",
+      "integrity": "sha1-9lNNFRSCabIDUue+4m9QH5oZEpA=",
+      "dev": true
+    },
+    "decimal.js": {
+      "version": "10.2.1",
+      "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.2.1.tgz",
+      "integrity": "sha512-KaL7+6Fw6i5A2XSnsbhm/6B+NuEA7TZ4vqxnd5tXz9sbKtrN9Srj8ab4vKVdK8YAqZO9P1kg45Y6YLoduPf+kw=="
+    },
+    "decode-uri-component": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmjs.org/decode-uri-component/-/decode-uri-component-0.2.0.tgz",
+      "integrity": "sha1-6zkTMzRYd1y4TNGh+uBiEGu4dUU=",
+      "dev": true
+    },
+    "deep-equal": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/deep-equal/-/deep-equal-1.1.1.tgz",
+      "integrity": "sha512-yd9c5AdiqVcR+JjcwUQb9DkhJc8ngNr0MahEBGvDiJw8puWab2yZlh+nkasOnZP+EGTAP6rRp2JzJhJZzvNF8g==",
+      "requires": {
+        "is-arguments": "^1.0.4",
+        "is-date-object": "^1.0.1",
+        "is-regex": "^1.0.4",
+        "object-is": "^1.0.1",
+        "object-keys": "^1.1.1",
+        "regexp.prototype.flags": "^1.2.0"
+      }
+    },
+    "deep-is": {
+      "version": "0.1.3",
+      "resolved": "https://registry.npmjs.org/deep-is/-/deep-is-0.1.3.tgz",
+      "integrity": "sha1-s2nW+128E+7PUk+RsHD+7cNXzzQ="
+    },
+    "default-gateway": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/default-gateway/-/default-gateway-4.2.0.tgz",
+      "integrity": "sha512-h6sMrVB1VMWVrW13mSc6ia/DwYYw5MN6+exNu1OaJeFac5aSAvwM7lZ0NVfTABuSkQelr4h5oebg3KB1XPdjgA==",
+      "dev": true,
+      "requires": {
+        "execa": "^1.0.0",
+        "ip-regex": "^2.1.0"
+      },
+      "dependencies": {
+        "cross-spawn": {
+          "version": "6.0.5",
+          "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-6.0.5.tgz",
+          "integrity": "sha512-eTVLrBSt7fjbDygz805pMnstIs2VTBNkRm0qxZd+M7A5XDdxVRWO5MxGBXZhjY4cqLYLdtrGqRf8mBPmzwSpWQ==",
+          "dev": true,
+          "requires": {
+            "nice-try": "^1.0.4",
+            "path-key": "^2.0.1",
+            "semver": "^5.5.0",
+            "shebang-command": "^1.2.0",
+            "which": "^1.2.9"
+          }
         },
-        "object.assign": {
-            "version": "4.1.2",
-            "resolved": "https://registry.npmjs.org/object.assign/-/object.assign-4.1.2.tgz",
-            "integrity": "sha512-ixT2L5THXsApyiUPYKmW+2EHpXXe5Ii3M+f4e+aJFAHao5amFRW6J0OO6c/LU8Be47utCx2GL89hxGB6XSmKuQ==",
-            "dev": true,
-            "requires": {
-                "call-bind": "^1.0.0",
-                "define-properties": "^1.1.3",
-                "has-symbols": "^1.0.1",
-                "object-keys": "^1.1.1"
-            }
+        "execa": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/execa/-/execa-1.0.0.tgz",
+          "integrity": "sha512-adbxcyWV46qiHyvSp50TKt05tB4tK3HcmF7/nxfAdhnox83seTDbwnaqKO4sXRy7roHAIFqJP/Rw/AuEbX61LA==",
+          "dev": true,
+          "requires": {
+            "cross-spawn": "^6.0.0",
+            "get-stream": "^4.0.0",
+            "is-stream": "^1.1.0",
+            "npm-run-path": "^2.0.0",
+            "p-finally": "^1.0.0",
+            "signal-exit": "^3.0.0",
+            "strip-eof": "^1.0.0"
+          }
         },
-        "object.pick": {
-            "version": "1.3.0",
-            "resolved": "https://registry.npmjs.org/object.pick/-/object.pick-1.3.0.tgz",
-            "integrity": "sha1-h6EKxMFpS9Lhy/U1kaZhQftd10c=",
-            "dev": true,
-            "requires": {
-                "isobject": "^3.0.1"
-            }
+        "get-stream": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-4.1.0.tgz",
+          "integrity": "sha512-GMat4EJ5161kIy2HevLlr4luNjBgvmj413KaQA7jt4V8B4RDsfpHk7WQ9GVqfYyyx8OS/L66Kox+rJRNklLK7w==",
+          "dev": true,
+          "requires": {
+            "pump": "^3.0.0"
+          }
         },
-        "obuf": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/obuf/-/obuf-1.1.2.tgz",
-            "integrity": "sha512-PX1wu0AmAdPqOL1mWhqmlOd8kOIZQwGZw6rh7uby9fTc5lhaOWFLX3I6R1hrF9k3zUY40e6igsLGkDXK92LJNg==",
-            "dev": true
-        },
-        "on-finished": {
-            "version": "2.3.0",
-            "resolved": "https://registry.npmjs.org/on-finished/-/on-finished-2.3.0.tgz",
-            "integrity": "sha1-IPEzZIGwg811M3mSoWlxqi2QaUc=",
-            "dev": true,
-            "requires": {
-                "ee-first": "1.1.1"
-            }
+        "is-stream": {
+          "version": "1.1.0",
+          "resolved": "https://registry.npmjs.org/is-stream/-/is-stream-1.1.0.tgz",
+          "integrity": "sha1-EtSj3U5o4Lec6428hBc66A2RykQ=",
+          "dev": true
         },
-        "on-headers": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/on-headers/-/on-headers-1.0.2.tgz",
-            "integrity": "sha512-pZAE+FJLoyITytdqK0U5s+FIpjN0JP3OzFi/u8Rx+EV5/W+JTWGXG8xFzevE7AjBfDqHv/8vL8qQsIhHnqRkrA==",
-            "dev": true
-        },
-        "once": {
-            "version": "1.4.0",
-            "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz",
-            "integrity": "sha1-WDsap3WWHUsROsF9nFC6753Xa9E=",
-            "dev": true,
-            "requires": {
-                "wrappy": "1"
-            }
+        "npm-run-path": {
+          "version": "2.0.2",
+          "resolved": "https://registry.npmjs.org/npm-run-path/-/npm-run-path-2.0.2.tgz",
+          "integrity": "sha1-NakjLfo11wZ7TLLd8jV7GHFTbF8=",
+          "dev": true,
+          "requires": {
+            "path-key": "^2.0.0"
+          }
         },
-        "onetime": {
-            "version": "5.1.2",
-            "resolved": "https://registry.npmjs.org/onetime/-/onetime-5.1.2.tgz",
-            "integrity": "sha512-kbpaSSGJTWdAY5KPVeMOKXSrPtr8C8C7wodJbcsd51jRnmD+GZu8Y0VoU6Dm5Z4vWr0Ig/1NKuWRKf7j5aaYSg==",
-            "dev": true,
-            "requires": {
-                "mimic-fn": "^2.1.0"
-            }
+        "path-key": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/path-key/-/path-key-2.0.1.tgz",
+          "integrity": "sha1-QRyttXTFoUDTpLGRDUDYDMn0C0A=",
+          "dev": true
         },
-        "opn": {
-            "version": "5.5.0",
-            "resolved": "https://registry.npmjs.org/opn/-/opn-5.5.0.tgz",
-            "integrity": "sha512-PqHpggC9bLV0VeWcdKhkpxY+3JTzetLSqTCWL/z/tFIbI6G8JCjondXklT1JinczLz2Xib62sSp0T/gKT4KksA==",
-            "dev": true,
-            "requires": {
-                "is-wsl": "^1.1.0"
-            }
+        "semver": {
+          "version": "5.7.1",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-5.7.1.tgz",
+          "integrity": "sha512-sauaDf/PZdVgrLTNYHRtpXa1iRiKcaebiKQ1BJdpQlWH2lCvexQdX55snPFyK7QzpudqbCI0qXFfOasHdyNDGQ==",
+          "dev": true
         },
-        "optionator": {
-            "version": "0.9.1",
-            "resolved": "https://registry.npmjs.org/optionator/-/optionator-0.9.1.tgz",
-            "integrity": "sha512-74RlY5FCnhq4jRxVUPKDaRwrVNXMqsGsiW6AJw4XK8hmtm10wC0ypZBLw5IIp85NZMr91+qd1RvvENwg7jjRFw==",
-            "dev": true,
-            "requires": {
-                "deep-is": "^0.1.3",
-                "fast-levenshtein": "^2.0.6",
-                "levn": "^0.4.1",
-                "prelude-ls": "^1.2.1",
-                "type-check": "^0.4.0",
-                "word-wrap": "^1.2.3"
-            }
+        "shebang-command": {
+          "version": "1.2.0",
+          "resolved": "https://registry.npmjs.org/shebang-command/-/shebang-command-1.2.0.tgz",
+          "integrity": "sha1-RKrGW2lbAzmJaMOfNj/uXer98eo=",
+          "dev": true,
+          "requires": {
+            "shebang-regex": "^1.0.0"
+          }
         },
-        "original": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/original/-/original-1.0.2.tgz",
-            "integrity": "sha512-hyBVl6iqqUOJ8FqRe+l/gS8H+kKYjrEndd5Pm1MfBtsEKA038HkkdbAl/72EAXGyonD/PFsvmVG+EvcIpliMBg==",
-            "dev": true,
-            "requires": {
-                "url-parse": "^1.4.3"
-            }
+        "shebang-regex": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/shebang-regex/-/shebang-regex-1.0.0.tgz",
+          "integrity": "sha1-2kL0l0DAtC2yypcoVxyxkMmO/qM=",
+          "dev": true
         },
-        "p-finally": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/p-finally/-/p-finally-1.0.0.tgz",
-            "integrity": "sha1-P7z7FbiZpEEjs0ttzBi3JDNqLK4=",
-            "dev": true
+        "which": {
+          "version": "1.3.1",
+          "resolved": "https://registry.npmjs.org/which/-/which-1.3.1.tgz",
+          "integrity": "sha512-HxJdYWq1MTIQbJ3nw0cqssHoTNU267KlrDuGZ1WYlxDStUtKUhOaJmh112/TZmHxxUfuJqPXSOm7tDyas0OSIQ==",
+          "dev": true,
+          "requires": {
+            "isexe": "^2.0.0"
+          }
+        }
+      }
+    },
+    "define-properties": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmjs.org/define-properties/-/define-properties-1.1.3.tgz",
+      "integrity": "sha512-3MqfYKj2lLzdMSf8ZIZE/V+Zuy+BgD6f164e8K2w7dgnpKArBDerGYpM46IYYcjnkdPNMjPk9A6VFB8+3SKlXQ==",
+      "requires": {
+        "object-keys": "^1.0.12"
+      }
+    },
+    "define-property": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/define-property/-/define-property-2.0.2.tgz",
+      "integrity": "sha512-jwK2UV4cnPpbcG7+VRARKTZPUWowwXA8bzH5NP6ud0oeAxyYPuGZUAC7hMugpCdz4BeSZl2Dl9k66CHJ/46ZYQ==",
+      "dev": true,
+      "requires": {
+        "is-descriptor": "^1.0.2",
+        "isobject": "^3.0.1"
+      },
+      "dependencies": {
+        "is-accessor-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
+          "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "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,
-            "requires": {
-                "p-try": "^2.0.0"
-            }
+        "is-data-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
+          "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "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,
-            "requires": {
-                "p-limit": "^2.2.0"
-            }
+        "is-descriptor": {
+          "version": "1.0.2",
+          "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
+          "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
+          "dev": true,
+          "requires": {
+            "is-accessor-descriptor": "^1.0.0",
+            "is-data-descriptor": "^1.0.0",
+            "kind-of": "^6.0.2"
+          }
+        }
+      }
+    },
+    "del": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmjs.org/del/-/del-4.1.1.tgz",
+      "integrity": "sha512-QwGuEUouP2kVwQenAsOof5Fv8K9t3D8Ca8NxcXKrIpEHjTXK5J2nXLdP+ALI1cgv8wj7KuwBhTwBkOZSJKM5XQ==",
+      "dev": true,
+      "requires": {
+        "@types/glob": "^7.1.1",
+        "globby": "^6.1.0",
+        "is-path-cwd": "^2.0.0",
+        "is-path-in-cwd": "^2.0.0",
+        "p-map": "^2.0.0",
+        "pify": "^4.0.1",
+        "rimraf": "^2.6.3"
+      },
+      "dependencies": {
+        "array-union": {
+          "version": "1.0.2",
+          "resolved": "https://registry.npmjs.org/array-union/-/array-union-1.0.2.tgz",
+          "integrity": "sha1-mjRBDk9OPaI96jdb5b5w8kd47Dk=",
+          "dev": true,
+          "requires": {
+            "array-uniq": "^1.0.1"
+          }
         },
-        "p-map": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/p-map/-/p-map-2.1.0.tgz",
-            "integrity": "sha512-y3b8Kpd8OAN444hxfBbFfj1FY/RjtTd8tzYwhUqNYXx0fXx2iX4maP4Qr6qhIKbQXI02wTLAda4fYUbDagTUFw==",
-            "dev": true
-        },
-        "p-retry": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/p-retry/-/p-retry-3.0.1.tgz",
-            "integrity": "sha512-XE6G4+YTTkT2a0UWb2kjZe8xNwf8bIbnqpc/IS/idOBVhyves0mK5OJgeocjx7q5pvX/6m23xuzVPYT1uGM73w==",
-            "dev": true,
-            "requires": {
-                "retry": "^0.12.0"
-            }
+        "globby": {
+          "version": "6.1.0",
+          "resolved": "https://registry.npmjs.org/globby/-/globby-6.1.0.tgz",
+          "integrity": "sha1-9abXDoOV4hyFj7BInWTfAkJNUGw=",
+          "dev": true,
+          "requires": {
+            "array-union": "^1.0.1",
+            "glob": "^7.0.3",
+            "object-assign": "^4.0.1",
+            "pify": "^2.0.0",
+            "pinkie-promise": "^2.0.0"
+          },
+          "dependencies": {
+            "pify": {
+              "version": "2.3.0",
+              "resolved": "https://registry.npmjs.org/pify/-/pify-2.3.0.tgz",
+              "integrity": "sha1-7RQaasBDqEnqWISY59yosVMw6Qw=",
+              "dev": true
+            }
+          }
         },
-        "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
-        },
-        "parent-module": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/parent-module/-/parent-module-1.0.1.tgz",
-            "integrity": "sha512-GQ2EWRpQV8/o+Aw8YqtfZZPfNRWZYkbidE9k5rpl/hC3vtHHBfGm2Ifi6qWV+coDGkrUKZAxE3Lot5kcsRlh+g==",
-            "dev": true,
-            "requires": {
-                "callsites": "^3.0.0"
-            }
+        "rimraf": {
+          "version": "2.7.1",
+          "resolved": "https://registry.npmjs.org/rimraf/-/rimraf-2.7.1.tgz",
+          "integrity": "sha512-uWjbaKIK3T1OSVptzX7Nl6PvQ3qAGtKEtVRjRuazjfL3Bx5eI409VZSqgND+4UNnmzLVdPj9FqFJNPqBZFve4w==",
+          "dev": true,
+          "requires": {
+            "glob": "^7.1.3"
+          }
+        }
+      }
+    },
+    "depd": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/depd/-/depd-1.1.2.tgz",
+      "integrity": "sha1-m81S4UwJd2PnSbJ0xDRu0uVgtak=",
+      "dev": true
+    },
+    "destroy": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/destroy/-/destroy-1.0.4.tgz",
+      "integrity": "sha1-l4hXRCxEdJ5CBmE+N5RiBYJqvYA=",
+      "dev": true
+    },
+    "detect-node": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmjs.org/detect-node/-/detect-node-2.0.5.tgz",
+      "integrity": "sha512-qi86tE6hRcFHy8jI1m2VG+LaPUR1LhqDa5G8tVjuUXmOrpuAgqsA1pN0+ldgr3aKUH+QLI9hCY/OcRYisERejw==",
+      "dev": true
+    },
+    "dfa": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/dfa/-/dfa-1.2.0.tgz",
+      "integrity": "sha512-ED3jP8saaweFTjeGX8HQPjeC1YYyZs98jGNZx6IiBvxW7JG5v492kamAQB3m2wop07CvU/RQmzcKr6bgcC5D/Q=="
+    },
+    "dir-glob": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/dir-glob/-/dir-glob-3.0.1.tgz",
+      "integrity": "sha512-WkrWp9GR4KXfKGYzOLmTuGVi1UWFfws377n9cc55/tb6DuqyF6pcQ5AbiHEshaDpY9v6oaSr2XCDidGmMwdzIA==",
+      "dev": true,
+      "requires": {
+        "path-type": "^4.0.0"
+      }
+    },
+    "dns-equal": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/dns-equal/-/dns-equal-1.0.0.tgz",
+      "integrity": "sha1-s55/HabrCnW6nBcySzR1PEfgZU0=",
+      "dev": true
+    },
+    "dns-packet": {
+      "version": "1.3.4",
+      "resolved": "https://registry.npmjs.org/dns-packet/-/dns-packet-1.3.4.tgz",
+      "integrity": "sha512-BQ6F4vycLXBvdrJZ6S3gZewt6rcrks9KBgM9vrhW+knGRqc8uEdT7fuCwloc7nny5xNoMJ17HGH0R/6fpo8ECA==",
+      "dev": true,
+      "requires": {
+        "ip": "^1.1.0",
+        "safe-buffer": "^5.0.1"
+      }
+    },
+    "dns-txt": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/dns-txt/-/dns-txt-2.0.2.tgz",
+      "integrity": "sha1-uR2Ab10nGI5Ks+fRB9iBocxGQrY=",
+      "dev": true,
+      "requires": {
+        "buffer-indexof": "^1.0.0"
+      }
+    },
+    "doctrine": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/doctrine/-/doctrine-3.0.0.tgz",
+      "integrity": "sha512-yS+Q5i3hBf7GBkd4KG8a7eBNNWNGLTaEwwYWUijIYM7zrlYDM0BFXHjjPWlWZ1Rg7UaddZeIDmi9jF3HmqiQ2w==",
+      "dev": true,
+      "requires": {
+        "esutils": "^2.0.2"
+      }
+    },
+    "duplexer2": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/duplexer2/-/duplexer2-0.1.4.tgz",
+      "integrity": "sha1-ixLauHjA1p4+eJEFFmKjL8a93ME=",
+      "requires": {
+        "readable-stream": "^2.0.2"
+      }
+    },
+    "earcut": {
+      "version": "2.2.2",
+      "resolved": "https://registry.npmjs.org/earcut/-/earcut-2.2.2.tgz",
+      "integrity": "sha512-eZoZPPJcUHnfRZ0PjLvx2qBordSiO8ofC3vt+qACLM95u+4DovnbYNpQtJh0DNsWj8RnxrQytD4WA8gj5cRIaQ=="
+    },
+    "ee-first": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/ee-first/-/ee-first-1.1.1.tgz",
+      "integrity": "sha1-WQxhFWsK4vTwJVcyoViyZrxWsh0=",
+      "dev": true
+    },
+    "electron-to-chromium": {
+      "version": "1.3.750",
+      "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.3.750.tgz",
+      "integrity": "sha512-Eqy9eHNepZxJXT+Pc5++zvEi5nQ6AGikwFYDCYwXUFBr+ynJ6pDG7MzZmwGYCIuXShLJM0n4bq+aoKDmvSGJ8A==",
+      "dev": true
+    },
+    "emoji-regex": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-8.0.0.tgz",
+      "integrity": "sha512-MSjYzcWNOA0ewAHpz0MxpYFvwg6yjy1NG3xteoqz644VCo/RPgnr1/GGt+ic3iJTzQ8Eu3TdM14SawnVUmGE6A==",
+      "dev": true
+    },
+    "emojis-list": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/emojis-list/-/emojis-list-3.0.0.tgz",
+      "integrity": "sha512-/kyM18EfinwXZbno9FyUGeFh87KC8HRQBQGildHZbEuRyWFOmv1U10o9BBp8XVZDVNNuQKyIGIu5ZYAAXJ0V2Q==",
+      "dev": true
+    },
+    "encodeurl": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz",
+      "integrity": "sha1-rT/0yG7C0CkyL1oCw6mmBslbP1k=",
+      "dev": true
+    },
+    "end-of-stream": {
+      "version": "1.4.4",
+      "resolved": "https://registry.npmjs.org/end-of-stream/-/end-of-stream-1.4.4.tgz",
+      "integrity": "sha512-+uw1inIHVPQoaVuHzRyXd21icM+cnt4CzD5rW+NC1wjOUSTOs+Te7FOv7AhN7vS9x/oIyhLP5PR1H+phQAHu5Q==",
+      "dev": true,
+      "requires": {
+        "once": "^1.4.0"
+      }
+    },
+    "enhanced-resolve": {
+      "version": "5.7.0",
+      "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.7.0.tgz",
+      "integrity": "sha512-6njwt/NsZFUKhM6j9U8hzVyD4E4r0x7NQzhTCbcWOJ0IQjNSAoalWmb0AE51Wn+fwan5qVESWi7t2ToBxs9vrw==",
+      "dev": true,
+      "requires": {
+        "graceful-fs": "^4.2.4",
+        "tapable": "^2.2.0"
+      }
+    },
+    "enquirer": {
+      "version": "2.3.6",
+      "resolved": "https://registry.npmjs.org/enquirer/-/enquirer-2.3.6.tgz",
+      "integrity": "sha512-yjNnPr315/FjS4zIsUxYguYUPP2e1NK4d7E7ZOLiyYCcbFBiTMyID+2wvm2w6+pZ/odMA7cRkjhsPbltwBOrLg==",
+      "dev": true,
+      "requires": {
+        "ansi-colors": "^4.1.1"
+      }
+    },
+    "envinfo": {
+      "version": "7.7.4",
+      "resolved": "https://registry.npmjs.org/envinfo/-/envinfo-7.7.4.tgz",
+      "integrity": "sha512-TQXTYFVVwwluWSFis6K2XKxgrD22jEv0FTuLCQI+OjH7rn93+iY0fSSFM5lrSxFY+H1+B0/cvvlamr3UsBivdQ==",
+      "dev": true
+    },
+    "errno": {
+      "version": "0.1.8",
+      "resolved": "https://registry.npmjs.org/errno/-/errno-0.1.8.tgz",
+      "integrity": "sha512-dJ6oBr5SQ1VSd9qkk7ByRgb/1SH4JZjCHSW/mr63/QcXO9zLVxvJ6Oy13nio03rxpSnVDDjFor75SjVeZWPW/A==",
+      "dev": true,
+      "requires": {
+        "prr": "~1.0.1"
+      }
+    },
+    "es-abstract": {
+      "version": "1.18.5",
+      "resolved": "https://registry.npmjs.org/es-abstract/-/es-abstract-1.18.5.tgz",
+      "integrity": "sha512-DDggyJLoS91CkJjgauM5c0yZMjiD1uK3KcaCeAmffGwZ+ODWzOkPN4QwRbsK5DOFf06fywmyLci3ZD8jLGhVYA==",
+      "requires": {
+        "call-bind": "^1.0.2",
+        "es-to-primitive": "^1.2.1",
+        "function-bind": "^1.1.1",
+        "get-intrinsic": "^1.1.1",
+        "has": "^1.0.3",
+        "has-symbols": "^1.0.2",
+        "internal-slot": "^1.0.3",
+        "is-callable": "^1.2.3",
+        "is-negative-zero": "^2.0.1",
+        "is-regex": "^1.1.3",
+        "is-string": "^1.0.6",
+        "object-inspect": "^1.11.0",
+        "object-keys": "^1.1.1",
+        "object.assign": "^4.1.2",
+        "string.prototype.trimend": "^1.0.4",
+        "string.prototype.trimstart": "^1.0.4",
+        "unbox-primitive": "^1.0.1"
+      },
+      "dependencies": {
+        "is-regex": {
+          "version": "1.1.4",
+          "resolved": "https://registry.npmjs.org/is-regex/-/is-regex-1.1.4.tgz",
+          "integrity": "sha512-kvRdxDsxZjhzUX07ZnLydzS1TU/TJlTUHHY4YLL87e37oUA49DfkLqgy+VjFocowy29cKvcSiu+kIv728jTTVg==",
+          "requires": {
+            "call-bind": "^1.0.2",
+            "has-tostringtag": "^1.0.0"
+          }
+        }
+      }
+    },
+    "es-module-lexer": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-0.4.1.tgz",
+      "integrity": "sha512-ooYciCUtfw6/d2w56UVeqHPcoCFAiJdz5XOkYpv/Txl1HMUozpXjz/2RIQgqwKdXNDPSF1W7mJCFse3G+HDyAA==",
+      "dev": true
+    },
+    "es-to-primitive": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/es-to-primitive/-/es-to-primitive-1.2.1.tgz",
+      "integrity": "sha512-QCOllgZJtaUo9miYBcLChTUaHNjJF3PYs1VidD7AwiEj1kYxKeQTctLAezAOH5ZKRH0g2IgPn6KwB4IT8iRpvA==",
+      "requires": {
+        "is-callable": "^1.1.4",
+        "is-date-object": "^1.0.1",
+        "is-symbol": "^1.0.2"
+      }
+    },
+    "es5-ext": {
+      "version": "0.10.53",
+      "resolved": "https://registry.npmjs.org/es5-ext/-/es5-ext-0.10.53.tgz",
+      "integrity": "sha512-Xs2Stw6NiNHWypzRTY1MtaG/uJlwCk8kH81920ma8mvN8Xq1gsfhZvpkImLQArw8AHnv8MT2I45J3c0R8slE+Q==",
+      "requires": {
+        "es6-iterator": "~2.0.3",
+        "es6-symbol": "~3.1.3",
+        "next-tick": "~1.0.0"
+      }
+    },
+    "es6-iterator": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmjs.org/es6-iterator/-/es6-iterator-2.0.3.tgz",
+      "integrity": "sha1-p96IkUGgWpSwhUQDstCg+/qY87c=",
+      "requires": {
+        "d": "1",
+        "es5-ext": "^0.10.35",
+        "es6-symbol": "^3.1.1"
+      }
+    },
+    "es6-map": {
+      "version": "0.1.5",
+      "resolved": "https://registry.npmjs.org/es6-map/-/es6-map-0.1.5.tgz",
+      "integrity": "sha1-kTbgUD3MBqMBaQ8LsU/042TpSfA=",
+      "requires": {
+        "d": "1",
+        "es5-ext": "~0.10.14",
+        "es6-iterator": "~2.0.1",
+        "es6-set": "~0.1.5",
+        "es6-symbol": "~3.1.1",
+        "event-emitter": "~0.3.5"
+      }
+    },
+    "es6-set": {
+      "version": "0.1.5",
+      "resolved": "https://registry.npmjs.org/es6-set/-/es6-set-0.1.5.tgz",
+      "integrity": "sha1-0rPsXU2ADO2BjbU40ol02wpzzLE=",
+      "requires": {
+        "d": "1",
+        "es5-ext": "~0.10.14",
+        "es6-iterator": "~2.0.1",
+        "es6-symbol": "3.1.1",
+        "event-emitter": "~0.3.5"
+      },
+      "dependencies": {
+        "es6-symbol": {
+          "version": "3.1.1",
+          "resolved": "https://registry.npmjs.org/es6-symbol/-/es6-symbol-3.1.1.tgz",
+          "integrity": "sha1-vwDvT9q2uhtG7Le2KbTH7VcVzHc=",
+          "requires": {
+            "d": "1",
+            "es5-ext": "~0.10.14"
+          }
+        }
+      }
+    },
+    "es6-symbol": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmjs.org/es6-symbol/-/es6-symbol-3.1.3.tgz",
+      "integrity": "sha512-NJ6Yn3FuDinBaBRWl/q5X/s4koRHBrgKAu+yGI6JCBeiu3qrcbJhwT2GeR/EXVfylRk8dpQVJoLEFhK+Mu31NA==",
+      "requires": {
+        "d": "^1.0.1",
+        "ext": "^1.1.2"
+      }
+    },
+    "escalade": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/escalade/-/escalade-3.1.1.tgz",
+      "integrity": "sha512-k0er2gUkLf8O0zKJiAhmkTnJlTvINGv7ygDNPbeIsX/TJjGJZHuh9B2UxbsaEkmlEo9MfhrSzmhIlhRlI2GXnw==",
+      "dev": true
+    },
+    "escape-html": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/escape-html/-/escape-html-1.0.3.tgz",
+      "integrity": "sha1-Aljq5NPQwJdN4cFpGI7wBR0dGYg=",
+      "dev": true
+    },
+    "escape-latex": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/escape-latex/-/escape-latex-1.2.0.tgz",
+      "integrity": "sha512-nV5aVWW1K0wEiUIEdZ4erkGGH8mDxGyxSeqPzRNtWP7ataw+/olFObw7hujFWlVjNsaDFw5VZ5NzVSIqRgfTiw=="
+    },
+    "escape-string-regexp": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz",
+      "integrity": "sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=",
+      "dev": true
+    },
+    "escodegen": {
+      "version": "1.14.3",
+      "resolved": "https://registry.npmjs.org/escodegen/-/escodegen-1.14.3.tgz",
+      "integrity": "sha512-qFcX0XJkdg+PB3xjZZG/wKSuT1PnQWx57+TVSjIMmILd2yC/6ByYElPwJnslDsuWuSAp4AwJGumarAAmJch5Kw==",
+      "requires": {
+        "esprima": "^4.0.1",
+        "estraverse": "^4.2.0",
+        "esutils": "^2.0.2",
+        "optionator": "^0.8.1",
+        "source-map": "~0.6.1"
+      },
+      "dependencies": {
+        "levn": {
+          "version": "0.3.0",
+          "resolved": "https://registry.npmjs.org/levn/-/levn-0.3.0.tgz",
+          "integrity": "sha1-OwmSTt+fCDwEkP3UwLxEIeBHZO4=",
+          "requires": {
+            "prelude-ls": "~1.1.2",
+            "type-check": "~0.3.2"
+          }
         },
-        "parseurl": {
-            "version": "1.3.3",
-            "resolved": "https://registry.npmjs.org/parseurl/-/parseurl-1.3.3.tgz",
-            "integrity": "sha512-CiyeOxFT/JZyN5m0z9PfXw4SCBJ6Sygz1Dpl0wqjlhDEGGBP1GnsUVEL0p63hoG1fcj3fHynXi9NYO4nWOL+qQ==",
-            "dev": true
+        "optionator": {
+          "version": "0.8.3",
+          "resolved": "https://registry.npmjs.org/optionator/-/optionator-0.8.3.tgz",
+          "integrity": "sha512-+IW9pACdk3XWmmTXG8m3upGUJst5XRGzxMRjXzAuJ1XnIFNvfhjjIuYkDvysnPQ7qzqVzLt78BCruntqRhWQbA==",
+          "requires": {
+            "deep-is": "~0.1.3",
+            "fast-levenshtein": "~2.0.6",
+            "levn": "~0.3.0",
+            "prelude-ls": "~1.1.2",
+            "type-check": "~0.3.2",
+            "word-wrap": "~1.2.3"
+          }
         },
-        "pascalcase": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/pascalcase/-/pascalcase-0.1.1.tgz",
-            "integrity": "sha1-s2PlXoAGym/iF4TS2yK9FdeRfxQ=",
-            "dev": true
+        "prelude-ls": {
+          "version": "1.1.2",
+          "resolved": "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.1.2.tgz",
+          "integrity": "sha1-IZMqVJ9eUv/ZqCf1cOBL5iqX2lQ="
         },
-        "path-dirname": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/path-dirname/-/path-dirname-1.0.2.tgz",
-            "integrity": "sha1-zDPSTVJeCZpTiMAzbG4yuRYGCeA=",
-            "dev": true
+        "type-check": {
+          "version": "0.3.2",
+          "resolved": "https://registry.npmjs.org/type-check/-/type-check-0.3.2.tgz",
+          "integrity": "sha1-WITKtRLPHTVeP7eE8wgEsrUg23I=",
+          "requires": {
+            "prelude-ls": "~1.1.2"
+          }
+        }
+      }
+    },
+    "eslint": {
+      "version": "7.22.0",
+      "resolved": "https://registry.npmjs.org/eslint/-/eslint-7.22.0.tgz",
+      "integrity": "sha512-3VawOtjSJUQiiqac8MQc+w457iGLfuNGLFn8JmF051tTKbh5/x/0vlcEj8OgDCaw7Ysa2Jn8paGshV7x2abKXg==",
+      "dev": true,
+      "requires": {
+        "@babel/code-frame": "7.12.11",
+        "@eslint/eslintrc": "^0.4.0",
+        "ajv": "^6.10.0",
+        "chalk": "^4.0.0",
+        "cross-spawn": "^7.0.2",
+        "debug": "^4.0.1",
+        "doctrine": "^3.0.0",
+        "enquirer": "^2.3.5",
+        "eslint-scope": "^5.1.1",
+        "eslint-utils": "^2.1.0",
+        "eslint-visitor-keys": "^2.0.0",
+        "espree": "^7.3.1",
+        "esquery": "^1.4.0",
+        "esutils": "^2.0.2",
+        "file-entry-cache": "^6.0.1",
+        "functional-red-black-tree": "^1.0.1",
+        "glob-parent": "^5.0.0",
+        "globals": "^13.6.0",
+        "ignore": "^4.0.6",
+        "import-fresh": "^3.0.0",
+        "imurmurhash": "^0.1.4",
+        "is-glob": "^4.0.0",
+        "js-yaml": "^3.13.1",
+        "json-stable-stringify-without-jsonify": "^1.0.1",
+        "levn": "^0.4.1",
+        "lodash": "^4.17.21",
+        "minimatch": "^3.0.4",
+        "natural-compare": "^1.4.0",
+        "optionator": "^0.9.1",
+        "progress": "^2.0.0",
+        "regexpp": "^3.1.0",
+        "semver": "^7.2.1",
+        "strip-ansi": "^6.0.0",
+        "strip-json-comments": "^3.1.0",
+        "table": "^6.0.4",
+        "text-table": "^0.2.0",
+        "v8-compile-cache": "^2.0.3"
+      },
+      "dependencies": {
+        "ignore": {
+          "version": "4.0.6",
+          "resolved": "https://registry.npmjs.org/ignore/-/ignore-4.0.6.tgz",
+          "integrity": "sha512-cyFDKrqc/YdcWFniJhzI42+AzS+gNwmUzOSFcRCQYwySuBBBy/KjuxWLZ/FHEH6Moq1NizMOBWyTcv8O4OZIMg==",
+          "dev": true
+        }
+      }
+    },
+    "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,
+      "requires": {
+        "esrecurse": "^4.3.0",
+        "estraverse": "^4.1.1"
+      }
+    },
+    "eslint-utils": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/eslint-utils/-/eslint-utils-2.1.0.tgz",
+      "integrity": "sha512-w94dQYoauyvlDc43XnGB8lU3Zt713vNChgt4EWwhXAP2XkBvndfxF0AgIqKOOasjPIPzj9JqgwkwbCYD0/V3Zg==",
+      "dev": true,
+      "requires": {
+        "eslint-visitor-keys": "^1.1.0"
+      },
+      "dependencies": {
+        "eslint-visitor-keys": {
+          "version": "1.3.0",
+          "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-1.3.0.tgz",
+          "integrity": "sha512-6J72N8UNa462wa/KFODt/PJ3IU60SDpC3QXC1Hjc1BXXpfL2C9R5+AU7jhe0F6GREqVMh4Juu+NY7xn+6dipUQ==",
+          "dev": true
+        }
+      }
+    },
+    "eslint-visitor-keys": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-2.0.0.tgz",
+      "integrity": "sha512-QudtT6av5WXels9WjIM7qz1XD1cWGvX4gGXvp/zBn9nXG02D0utdU3Em2m/QjTnrsk6bBjmCygl3rmj118msQQ==",
+      "dev": true
+    },
+    "espree": {
+      "version": "7.3.1",
+      "resolved": "https://registry.npmjs.org/espree/-/espree-7.3.1.tgz",
+      "integrity": "sha512-v3JCNCE64umkFpmkFGqzVKsOT0tN1Zr+ueqLZfpV1Ob8e+CEgPWa+OxCoGH3tnhimMKIaBm4m/vaRpJ/krRz2g==",
+      "dev": true,
+      "requires": {
+        "acorn": "^7.4.0",
+        "acorn-jsx": "^5.3.1",
+        "eslint-visitor-keys": "^1.3.0"
+      },
+      "dependencies": {
+        "acorn": {
+          "version": "7.4.1",
+          "resolved": "https://registry.npmjs.org/acorn/-/acorn-7.4.1.tgz",
+          "integrity": "sha512-nQyp0o1/mNdbTO1PO6kHkwSrmgZ0MT/jCCpNiwbUjGoRN4dlBhqJtoQuCnEOKzgTVwg0ZWiCoQy6SxMebQVh8A==",
+          "dev": true
         },
-        "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
-        },
-        "path-is-absolute": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/path-is-absolute/-/path-is-absolute-1.0.1.tgz",
-            "integrity": "sha1-F0uSaHNVNP+8es5r9TpanhtcX18=",
-            "dev": true
-        },
-        "path-is-inside": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/path-is-inside/-/path-is-inside-1.0.2.tgz",
-            "integrity": "sha1-NlQX3t5EQw0cEa9hAn+s8HS9/FM=",
-            "dev": true
+        "eslint-visitor-keys": {
+          "version": "1.3.0",
+          "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-1.3.0.tgz",
+          "integrity": "sha512-6J72N8UNa462wa/KFODt/PJ3IU60SDpC3QXC1Hjc1BXXpfL2C9R5+AU7jhe0F6GREqVMh4Juu+NY7xn+6dipUQ==",
+          "dev": true
+        }
+      }
+    },
+    "esprima": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/esprima/-/esprima-4.0.1.tgz",
+      "integrity": "sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A=="
+    },
+    "esquery": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/esquery/-/esquery-1.4.0.tgz",
+      "integrity": "sha512-cCDispWt5vHHtwMY2YrAQ4ibFkAL8RbH5YGBnZBc90MolvvfkkQcJro/aZiAQUlQ3qgrYS6D6v8Gc5G5CQsc9w==",
+      "dev": true,
+      "requires": {
+        "estraverse": "^5.1.0"
+      },
+      "dependencies": {
+        "estraverse": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.2.0.tgz",
+          "integrity": "sha512-BxbNGGNm0RyRYvUdHpIwv9IWzeM9XClbOxwoATuFdOE7ZE6wHL+HQ5T8hoPM+zHvmKzzsEqhgy0GrQ5X13afiQ==",
+          "dev": true
+        }
+      }
+    },
+    "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,
+      "requires": {
+        "estraverse": "^5.2.0"
+      },
+      "dependencies": {
+        "estraverse": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.2.0.tgz",
+          "integrity": "sha512-BxbNGGNm0RyRYvUdHpIwv9IWzeM9XClbOxwoATuFdOE7ZE6wHL+HQ5T8hoPM+zHvmKzzsEqhgy0GrQ5X13afiQ==",
+          "dev": true
+        }
+      }
+    },
+    "estraverse": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-4.3.0.tgz",
+      "integrity": "sha512-39nnKffWz8xN1BU/2c79n9nB9HDzo0niYUqx6xyqUnyoAnQyyWpOTdZEeiCch8BBu515t4wp9ZmgVfVhn9EBpw=="
+    },
+    "estree-is-function": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/estree-is-function/-/estree-is-function-1.0.0.tgz",
+      "integrity": "sha512-nSCWn1jkSq2QAtkaVLJZY2ezwcFO161HVc174zL1KPW3RJ+O6C3eJb8Nx7OXzvhoEv+nLgSR1g71oWUHUDTrJA=="
+    },
+    "esutils": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmjs.org/esutils/-/esutils-2.0.3.tgz",
+      "integrity": "sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g=="
+    },
+    "etag": {
+      "version": "1.8.1",
+      "resolved": "https://registry.npmjs.org/etag/-/etag-1.8.1.tgz",
+      "integrity": "sha1-Qa4u62XvpiJorr/qg6x9eSmbCIc=",
+      "dev": true
+    },
+    "event-emitter": {
+      "version": "0.3.5",
+      "resolved": "https://registry.npmjs.org/event-emitter/-/event-emitter-0.3.5.tgz",
+      "integrity": "sha1-34xp7vFkeSPHFXuc6DhAYQsCzDk=",
+      "requires": {
+        "d": "1",
+        "es5-ext": "~0.10.14"
+      }
+    },
+    "eventemitter3": {
+      "version": "4.0.7",
+      "resolved": "https://registry.npmjs.org/eventemitter3/-/eventemitter3-4.0.7.tgz",
+      "integrity": "sha512-8guHBZCwKnFhYdHr2ysuRWErTwhoN2X8XELRlrRwpmfeY2jjuUN4taQMsULKUVo1K4DvZl+0pgfyoysHxvmvEw==",
+      "dev": true
+    },
+    "events": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmjs.org/events/-/events-3.3.0.tgz",
+      "integrity": "sha512-mQw+2fkQbALzQ7V0MY0IqdnXNOeTtP4r0lN9z7AAawCXgqea7bDii20AYrIBrFd/Hx0M2Ocz6S111CaFkUcb0Q==",
+      "dev": true
+    },
+    "eventsource": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/eventsource/-/eventsource-1.1.0.tgz",
+      "integrity": "sha512-VSJjT5oCNrFvCS6igjzPAt5hBzQ2qPBFIbJ03zLI9SE0mxwZpMw6BfJrbFHm1a141AavMEB8JHmBhWAd66PfCg==",
+      "dev": true,
+      "requires": {
+        "original": "^1.0.0"
+      }
+    },
+    "execa": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/execa/-/execa-5.0.0.tgz",
+      "integrity": "sha512-ov6w/2LCiuyO4RLYGdpFGjkcs0wMTgGE8PrkTHikeUy5iJekXyPIKUjifk5CsE0pt7sMCrMZ3YNqoCj6idQOnQ==",
+      "dev": true,
+      "requires": {
+        "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"
+      }
+    },
+    "expand-brackets": {
+      "version": "2.1.4",
+      "resolved": "https://registry.npmjs.org/expand-brackets/-/expand-brackets-2.1.4.tgz",
+      "integrity": "sha1-t3c14xXOMPa27/D4OwQVGiJEliI=",
+      "dev": true,
+      "requires": {
+        "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"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "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
-        },
-        "path-parse": {
-            "version": "1.0.6",
-            "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.6.tgz",
-            "integrity": "sha512-GSmOT2EbHrINBf9SR7CDELwlJ8AENk3Qn7OikK4nFYAu3Ote2+JYNVvkpAEQm3/TLNEJFD/xZJjzyxg3KBWOzw==",
-            "dev": true
-        },
-        "path-to-regexp": {
-            "version": "0.1.7",
-            "resolved": "https://registry.npmjs.org/path-to-regexp/-/path-to-regexp-0.1.7.tgz",
-            "integrity": "sha1-32BBeABfUi8V60SQ5yR6G/qmf4w=",
-            "dev": true
-        },
-        "path-type": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/path-type/-/path-type-4.0.0.tgz",
-            "integrity": "sha512-gDKb8aZMDeD/tZWs9P6+q0J9Mwkdl6xMV8TjnGP3qJVJ06bdMgkbBlLU8IdfOsIsFz2BW1rNVT3XuNEl8zPAvw==",
-            "dev": true
-        },
-        "picomatch": {
-            "version": "2.2.2",
-            "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-2.2.2.tgz",
-            "integrity": "sha512-q0M/9eZHzmr0AulXyPwNfZjtwZ/RBZlbN3K3CErVrk50T2ASYI7Bye0EvekFY3IP1Nt2DHu0re+V2ZHIpMkuWg==",
-            "dev": true
-        },
-        "pify": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/pify/-/pify-4.0.1.tgz",
-            "integrity": "sha512-uB80kBFb/tfd68bVleG9T5GGsGPjJrLAUpR5PZIrhBnIaRTQRjqdJSsIKkOP6OAIFbj7GOrcudc5pNjZ+geV2g==",
-            "dev": true
-        },
-        "pinkie": {
-            "version": "2.0.4",
-            "resolved": "https://registry.npmjs.org/pinkie/-/pinkie-2.0.4.tgz",
-            "integrity": "sha1-clVrgM+g1IqXToDnckjoDtT3+HA=",
-            "dev": true
-        },
-        "pinkie-promise": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/pinkie-promise/-/pinkie-promise-2.0.1.tgz",
-            "integrity": "sha1-ITXW36ejWMBprJsXh3YogihFD/o=",
-            "dev": true,
-            "requires": {
-                "pinkie": "^2.0.0"
-            }
+        "define-property": {
+          "version": "0.2.5",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
+          "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^0.1.0"
+          }
         },
-        "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,
-            "requires": {
-                "find-up": "^4.0.0"
-            }
+        "extend-shallow": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+          "dev": true,
+          "requires": {
+            "is-extendable": "^0.1.0"
+          }
         },
-        "portfinder": {
-            "version": "1.0.28",
-            "resolved": "https://registry.npmjs.org/portfinder/-/portfinder-1.0.28.tgz",
-            "integrity": "sha512-Se+2isanIcEqf2XMHjyUKskczxbPH7dQnlMjXX6+dybayyHvAf/TCgyMRlzf/B6QDhAEFOGes0pzRo3by4AbMA==",
-            "dev": true,
-            "requires": {
-                "async": "^2.6.2",
-                "debug": "^3.1.1",
-                "mkdirp": "^0.5.5"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "3.2.7",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.7.tgz",
-                    "integrity": "sha512-CFjzYYAi4ThfiQvizrFQevTTXHtnCqWfe7x1AhgEscTz6ZbLbfoLRLPugTQyBth6f8ZERVUSyWHFD/7Wu4t1XQ==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "^2.1.1"
-                    }
-                }
-            }
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
+        }
+      }
+    },
+    "express": {
+      "version": "4.17.1",
+      "resolved": "https://registry.npmjs.org/express/-/express-4.17.1.tgz",
+      "integrity": "sha512-mHJ9O79RqluphRrcw2X/GTh3k9tVv8YcoyY4Kkh4WDMUYKRZUq0h1o0w2rrrxBqM7VoeUVqgb27xlEMXTnYt4g==",
+      "dev": true,
+      "requires": {
+        "accepts": "~1.3.7",
+        "array-flatten": "1.1.1",
+        "body-parser": "1.19.0",
+        "content-disposition": "0.5.3",
+        "content-type": "~1.0.4",
+        "cookie": "0.4.0",
+        "cookie-signature": "1.0.6",
+        "debug": "2.6.9",
+        "depd": "~1.1.2",
+        "encodeurl": "~1.0.2",
+        "escape-html": "~1.0.3",
+        "etag": "~1.8.1",
+        "finalhandler": "~1.1.2",
+        "fresh": "0.5.2",
+        "merge-descriptors": "1.0.1",
+        "methods": "~1.1.2",
+        "on-finished": "~2.3.0",
+        "parseurl": "~1.3.3",
+        "path-to-regexp": "0.1.7",
+        "proxy-addr": "~2.0.5",
+        "qs": "6.7.0",
+        "range-parser": "~1.2.1",
+        "safe-buffer": "5.1.2",
+        "send": "0.17.1",
+        "serve-static": "1.14.1",
+        "setprototypeof": "1.1.1",
+        "statuses": "~1.5.0",
+        "type-is": "~1.6.18",
+        "utils-merge": "1.0.1",
+        "vary": "~1.1.2"
+      },
+      "dependencies": {
+        "array-flatten": {
+          "version": "1.1.1",
+          "resolved": "https://registry.npmjs.org/array-flatten/-/array-flatten-1.1.1.tgz",
+          "integrity": "sha1-ml9pkFGx5wczKPKgCJaLZOopVdI=",
+          "dev": true
         },
-        "posix-character-classes": {
-            "version": "0.1.1",
-            "resolved": "https://registry.npmjs.org/posix-character-classes/-/posix-character-classes-0.1.1.tgz",
-            "integrity": "sha1-AerA/jta9xoqbAL+q7jB/vfgDqs=",
-            "dev": true
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "prelude-ls": {
-            "version": "1.2.1",
-            "resolved": "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.2.1.tgz",
-            "integrity": "sha512-vkcDPrRZo1QZLbn5RLGPpg/WmIQ65qoWWhcGKf/b5eplkkarX0m9z8ppCat4mlOqUsWpyNuYgO3VRyrYHSzX5g==",
-            "dev": true
-        },
-        "process-nextick-args": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/process-nextick-args/-/process-nextick-args-2.0.1.tgz",
-            "integrity": "sha512-3ouUOpQhtgrbOa17J7+uxOTpITYWaGP7/AhoR3+A+/1e9skrzelGi/dXzEYyvbxubEF6Wn2ypscTKiKJFFn1ag==",
-            "dev": true
-        },
-        "progress": {
-            "version": "2.0.3",
-            "resolved": "https://registry.npmjs.org/progress/-/progress-2.0.3.tgz",
-            "integrity": "sha512-7PiHtLll5LdnKIMw100I+8xJXR5gW2QwWYkT6iJva0bXitZKa/XMrSbdmg3r2Xnaidz9Qumd0VPaMrZlF9V9sA==",
-            "dev": true
-        },
-        "proxy-addr": {
-            "version": "2.0.6",
-            "resolved": "https://registry.npmjs.org/proxy-addr/-/proxy-addr-2.0.6.tgz",
-            "integrity": "sha512-dh/frvCBVmSsDYzw6n926jv974gddhkFPfiN8hPOi30Wax25QZyZEGveluCgliBnqmuM+UJmBErbAUFIoDbjOw==",
-            "dev": true,
-            "requires": {
-                "forwarded": "~0.1.2",
-                "ipaddr.js": "1.9.1"
-            }
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
         },
-        "prr": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/prr/-/prr-1.0.1.tgz",
-            "integrity": "sha1-0/wRS6BplaRexok/SEzrHXj19HY=",
-            "dev": true
-        },
-        "pump": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/pump/-/pump-3.0.0.tgz",
-            "integrity": "sha512-LwZy+p3SFs1Pytd/jYct4wpv49HiYCqd9Rlc5ZVdk0V+8Yzv6jR5Blk3TRmPL1ft69TxP0IMZGJ+WPFU2BFhww==",
-            "dev": true,
-            "requires": {
-                "end-of-stream": "^1.1.0",
-                "once": "^1.3.1"
-            }
+        "safe-buffer": {
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
+          "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
+          "dev": true
+        }
+      }
+    },
+    "ext": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/ext/-/ext-1.4.0.tgz",
+      "integrity": "sha512-Key5NIsUxdqKg3vIsdw9dSuXpPCQ297y6wBjL30edxwPgt2E44WcWBZey/ZvUc6sERLTxKdyCu4gZFmUbk1Q7A==",
+      "requires": {
+        "type": "^2.0.0"
+      },
+      "dependencies": {
+        "type": {
+          "version": "2.5.0",
+          "resolved": "https://registry.npmjs.org/type/-/type-2.5.0.tgz",
+          "integrity": "sha512-180WMDQaIMm3+7hGXWf12GtdniDEy7nYcyFMKJn/eZz/6tSLXrUN9V0wKSbMjej0I1WHWbpREDEKHtqPQa9NNw=="
+        }
+      }
+    },
+    "extend-shallow": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-3.0.2.tgz",
+      "integrity": "sha1-Jqcarwc7OfshJxcnRhMcJwQCjbg=",
+      "dev": true,
+      "requires": {
+        "assign-symbols": "^1.0.0",
+        "is-extendable": "^1.0.1"
+      },
+      "dependencies": {
+        "is-extendable": {
+          "version": "1.0.1",
+          "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-1.0.1.tgz",
+          "integrity": "sha512-arnXMxT1hhoKo9k1LZdmlNyJdDDfy2v0fXjFlmok4+i8ul/6WlbVge9bhM74OpNPQPMGUToDtz+KXa1PneJxOA==",
+          "dev": true,
+          "requires": {
+            "is-plain-object": "^2.0.4"
+          }
+        }
+      }
+    },
+    "extglob": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmjs.org/extglob/-/extglob-2.0.4.tgz",
+      "integrity": "sha512-Nmb6QXkELsuBr24CJSkilo6UHHgbekK5UiZgfE6UHD3Eb27YC6oD+bhcT+tJ6cl8dmsgdQxnWlcry8ksBIBLpw==",
+      "dev": true,
+      "requires": {
+        "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"
+      },
+      "dependencies": {
+        "define-property": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
+          "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^1.0.0"
+          }
         },
-        "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
-        },
-        "qs": {
-            "version": "6.7.0",
-            "resolved": "https://registry.npmjs.org/qs/-/qs-6.7.0.tgz",
-            "integrity": "sha512-VCdBRNFTX1fyE7Nb6FYoURo/SPe62QCaAyzJvUjwRaIsc+NePBEniHlvxFmmX56+HZphIGtV0XeCirBtpDrTyQ==",
-            "dev": true
-        },
-        "querystring": {
-            "version": "0.2.0",
-            "resolved": "https://registry.npmjs.org/querystring/-/querystring-0.2.0.tgz",
-            "integrity": "sha1-sgmEkgO7Jd+CDadW50cAWHhSFiA=",
-            "dev": true
-        },
-        "querystringify": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/querystringify/-/querystringify-2.2.0.tgz",
-            "integrity": "sha512-FIqgj2EUvTa7R50u0rGsyTftzjYmv/a3hO345bZNrqabNqjtgiDMgmo4mkUjd+nzU5oF3dClKqFIPUKybUyqoQ==",
-            "dev": true
-        },
-        "queue-microtask": {
-            "version": "1.2.2",
-            "resolved": "https://registry.npmjs.org/queue-microtask/-/queue-microtask-1.2.2.tgz",
-            "integrity": "sha512-dB15eXv3p2jDlbOiNLyMabYg1/sXvppd8DP2J3EOCQ0AkuSXCW2tP7mnVouVLJKgUMY6yP0kcQDVpLCN13h4Xg==",
-            "dev": true
-        },
-        "randombytes": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/randombytes/-/randombytes-2.1.0.tgz",
-            "integrity": "sha512-vYl3iOX+4CKUWuxGi9Ukhie6fsqXqS9FE2Zaic4tNFD2N2QQaXOMFbuKK4QmDHC0JO6B1Zp41J0LpT0oR68amQ==",
-            "dev": true,
-            "requires": {
-                "safe-buffer": "^5.1.0"
-            }
+        "extend-shallow": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+          "dev": true,
+          "requires": {
+            "is-extendable": "^0.1.0"
+          }
         },
-        "range-parser": {
-            "version": "1.2.1",
-            "resolved": "https://registry.npmjs.org/range-parser/-/range-parser-1.2.1.tgz",
-            "integrity": "sha512-Hrgsx+orqoygnmhFbKaHE6c296J+HTAQXoxEF6gNupROmmGJRoyzfG3ccAveqCBrwr/2yxQ5BVd/GTl5agOwSg==",
-            "dev": true
-        },
-        "raw-body": {
-            "version": "2.4.0",
-            "resolved": "https://registry.npmjs.org/raw-body/-/raw-body-2.4.0.tgz",
-            "integrity": "sha512-4Oz8DUIwdvoa5qMJelxipzi/iJIi40O5cGV1wNYp5hvZP8ZN0T+jiNkL0QepXs+EsQ9XJ8ipEDoiH70ySUJP3Q==",
-            "dev": true,
-            "requires": {
-                "bytes": "3.1.0",
-                "http-errors": "1.7.2",
-                "iconv-lite": "0.4.24",
-                "unpipe": "1.0.0"
-            },
-            "dependencies": {
-                "bytes": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.0.tgz",
-                    "integrity": "sha512-zauLjrfCG+xvoyaqLoV8bLVXXNGC4JqlxFCutSDWA6fJrTo2ZuvLYTqZ7aHBLZSMOopbzwv8f+wZcVzfVTI2Dg==",
-                    "dev": true
-                }
-            }
+        "is-accessor-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
+          "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "readable-stream": {
-            "version": "2.3.7",
-            "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-2.3.7.tgz",
-            "integrity": "sha512-Ebho8K4jIbHAxnuxi7o42OrZgF/ZTNcsZj6nRKyUmkhLFq8CHItp/fy6hQZuZmP/n3yZ9VBUbp4zz/mX8hmYPw==",
-            "dev": true,
-            "requires": {
-                "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"
-            },
-            "dependencies": {
-                "safe-buffer": {
-                    "version": "5.1.2",
-                    "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-                    "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-                    "dev": true
-                }
-            }
+        "is-data-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
+          "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "readdirp": {
-            "version": "2.2.1",
-            "resolved": "https://registry.npmjs.org/readdirp/-/readdirp-2.2.1.tgz",
-            "integrity": "sha512-1JU/8q+VgFZyxwrJ+SVIOsh+KywWGpds3NTqikiKpDMZWScmAYyKIgqkO+ARvNWJfXeXR1zxz7aHF4u4CyH6vQ==",
-            "dev": true,
-            "requires": {
-                "graceful-fs": "^4.1.11",
-                "micromatch": "^3.1.10",
-                "readable-stream": "^2.0.2"
-            },
-            "dependencies": {
-                "braces": {
-                    "version": "2.3.2",
-                    "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-                    "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-                    "dev": true,
-                    "requires": {
-                        "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"
-                    },
-                    "dependencies": {
-                        "extend-shallow": {
-                            "version": "2.0.1",
-                            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                            "dev": true,
-                            "requires": {
-                                "is-extendable": "^0.1.0"
-                            }
-                        }
-                    }
-                },
-                "fill-range": {
-                    "version": "4.0.0",
-                    "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-                    "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-                    "dev": true,
-                    "requires": {
-                        "extend-shallow": "^2.0.1",
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1",
-                        "to-regex-range": "^2.1.0"
-                    },
-                    "dependencies": {
-                        "extend-shallow": {
-                            "version": "2.0.1",
-                            "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                            "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                            "dev": true,
-                            "requires": {
-                                "is-extendable": "^0.1.0"
-                            }
-                        }
-                    }
-                },
-                "is-number": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-                    "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^3.0.2"
-                    },
-                    "dependencies": {
-                        "kind-of": {
-                            "version": "3.2.2",
-                            "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                            "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                            "dev": true,
-                            "requires": {
-                                "is-buffer": "^1.1.5"
-                            }
-                        }
-                    }
-                },
-                "micromatch": {
-                    "version": "3.1.10",
-                    "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
-                    "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
-                    "dev": true,
-                    "requires": {
-                        "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"
-                    }
-                },
-                "to-regex-range": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-                    "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-                    "dev": true,
-                    "requires": {
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1"
-                    }
-                }
-            }
+        "is-descriptor": {
+          "version": "1.0.2",
+          "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
+          "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
+          "dev": true,
+          "requires": {
+            "is-accessor-descriptor": "^1.0.0",
+            "is-data-descriptor": "^1.0.0",
+            "kind-of": "^6.0.2"
+          }
+        }
+      }
+    },
+    "falafel": {
+      "version": "2.2.4",
+      "resolved": "https://registry.npmjs.org/falafel/-/falafel-2.2.4.tgz",
+      "integrity": "sha512-0HXjo8XASWRmsS0X1EkhwEMZaD3Qvp7FfURwjLKjG1ghfRm/MGZl2r4cWUTv41KdNghTw4OUMmVtdGQp3+H+uQ==",
+      "requires": {
+        "acorn": "^7.1.1",
+        "foreach": "^2.0.5",
+        "isarray": "^2.0.1",
+        "object-keys": "^1.0.6"
+      },
+      "dependencies": {
+        "acorn": {
+          "version": "7.4.1",
+          "resolved": "https://registry.npmjs.org/acorn/-/acorn-7.4.1.tgz",
+          "integrity": "sha512-nQyp0o1/mNdbTO1PO6kHkwSrmgZ0MT/jCCpNiwbUjGoRN4dlBhqJtoQuCnEOKzgTVwg0ZWiCoQy6SxMebQVh8A=="
         },
-        "rechoir": {
-            "version": "0.7.0",
-            "resolved": "https://registry.npmjs.org/rechoir/-/rechoir-0.7.0.tgz",
-            "integrity": "sha512-ADsDEH2bvbjltXEP+hTIAmeFekTFK0V2BTxMkok6qILyAJEXV0AFfoWcAq4yfll5VdIMd/RVXq0lR+wQi5ZU3Q==",
-            "dev": true,
-            "requires": {
-                "resolve": "^1.9.0"
-            }
+        "isarray": {
+          "version": "2.0.5",
+          "resolved": "https://registry.npmjs.org/isarray/-/isarray-2.0.5.tgz",
+          "integrity": "sha512-xHjhDr3cNBK0BzdUJSPXZntQUx/mwMS5Rw4A7lPJ90XGAO6ISP/ePDNuo0vhqOZU+UD5JoodwCAAoZQd3FeAKw=="
+        }
+      }
+    },
+    "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
+    },
+    "fast-glob": {
+      "version": "3.2.5",
+      "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.2.5.tgz",
+      "integrity": "sha512-2DtFcgT68wiTTiwZ2hNdJfcHNke9XOfnwmBRWXhmeKM8rF0TGwmC/Qto3S7RoZKp5cilZbxzO5iTNTQsJ+EeDg==",
+      "dev": true,
+      "requires": {
+        "@nodelib/fs.stat": "^2.0.2",
+        "@nodelib/fs.walk": "^1.2.3",
+        "glob-parent": "^5.1.0",
+        "merge2": "^1.3.0",
+        "micromatch": "^4.0.2",
+        "picomatch": "^2.2.1"
+      }
+    },
+    "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
+    },
+    "fast-levenshtein": {
+      "version": "2.0.6",
+      "resolved": "https://registry.npmjs.org/fast-levenshtein/-/fast-levenshtein-2.0.6.tgz",
+      "integrity": "sha1-PYpcZog6FqMMqGQ+hR8Zuqd5eRc="
+    },
+    "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
+    },
+    "fastq": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/fastq/-/fastq-1.11.0.tgz",
+      "integrity": "sha512-7Eczs8gIPDrVzT+EksYBcupqMyxSHXXrHOLRRxU2/DicV8789MRBRR8+Hc2uWzUupOs4YS4JzBmBxjjCVBxD/g==",
+      "dev": true,
+      "requires": {
+        "reusify": "^1.0.4"
+      }
+    },
+    "faye-websocket": {
+      "version": "0.11.3",
+      "resolved": "https://registry.npmjs.org/faye-websocket/-/faye-websocket-0.11.3.tgz",
+      "integrity": "sha512-D2y4bovYpzziGgbHYtGCMjlJM36vAl/y+xUyn1C+FVx8szd1E+86KwVw6XvYSzOP8iMpm1X0I4xJD+QtUb36OA==",
+      "dev": true,
+      "requires": {
+        "websocket-driver": ">=0.5.1"
+      }
+    },
+    "file-entry-cache": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/file-entry-cache/-/file-entry-cache-6.0.1.tgz",
+      "integrity": "sha512-7Gps/XWymbLk2QLYK4NzpMOrYjMhdIxXuIvy2QBsLE6ljuodKvdkWs/cpyJJ3CVIVpH0Oi1Hvg1ovbMzLdFBBg==",
+      "dev": true,
+      "requires": {
+        "flat-cache": "^3.0.4"
+      }
+    },
+    "file-uri-to-path": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/file-uri-to-path/-/file-uri-to-path-1.0.0.tgz",
+      "integrity": "sha512-0Zt+s3L7Vf1biwWZ29aARiVYLx7iMGnEUl9x33fbB/j3jR81u/O2LbqK+Bm1CDSNDKVtJ/YjwY7TUd5SkeLQLw==",
+      "dev": true,
+      "optional": true
+    },
+    "fill-range": {
+      "version": "7.0.1",
+      "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.0.1.tgz",
+      "integrity": "sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==",
+      "dev": true,
+      "requires": {
+        "to-regex-range": "^5.0.1"
+      }
+    },
+    "finalhandler": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.1.2.tgz",
+      "integrity": "sha512-aAWcW57uxVNrQZqFXjITpW3sIUQmHGG3qSb9mUah9MgMC4NeWhNOlNjXEYq3HjRAvL6arUviZGGJsBg6z0zsWA==",
+      "dev": true,
+      "requires": {
+        "debug": "2.6.9",
+        "encodeurl": "~1.0.2",
+        "escape-html": "~1.0.3",
+        "on-finished": "~2.3.0",
+        "parseurl": "~1.3.3",
+        "statuses": "~1.5.0",
+        "unpipe": "~1.0.0"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "regenerate": {
-            "version": "1.4.2",
-            "resolved": "https://registry.npmjs.org/regenerate/-/regenerate-1.4.2.tgz",
-            "integrity": "sha512-zrceR/XhGYU/d/opr2EKO7aRHUeiBI8qjtfHqADTwZd6Szfy16la6kqD0MIUs5z5hx6AaKa+PixpPrR289+I0A==",
-            "dev": true
-        },
-        "regenerate-unicode-properties": {
-            "version": "8.2.0",
-            "resolved": "https://registry.npmjs.org/regenerate-unicode-properties/-/regenerate-unicode-properties-8.2.0.tgz",
-            "integrity": "sha512-F9DjY1vKLo/tPePDycuH3dn9H1OTPIkVD9Kz4LODu+F2C75mgjAJ7x/gwy6ZcSNRAAkhNlJSOHRe8k3p+K9WhA==",
-            "dev": true,
-            "requires": {
-                "regenerate": "^1.4.0"
-            }
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
+        }
+      }
+    },
+    "find-cache-dir": {
+      "version": "3.3.1",
+      "resolved": "https://registry.npmjs.org/find-cache-dir/-/find-cache-dir-3.3.1.tgz",
+      "integrity": "sha512-t2GDMt3oGC/v+BMwzmllWDuJF/xcDtE5j/fCGbqDD7OLuJkj0cfh1YSA5VKPvwMeLFLNDBkwOKZ2X85jGLVftQ==",
+      "dev": true,
+      "requires": {
+        "commondir": "^1.0.1",
+        "make-dir": "^3.0.2",
+        "pkg-dir": "^4.1.0"
+      },
+      "dependencies": {
+        "make-dir": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-3.1.0.tgz",
+          "integrity": "sha512-g3FeP20LNwhALb/6Cz6Dd4F2ngze0jz7tbzrD2wAV+o9FeNHe4rL+yK2md0J/fiSf1sa1ADhXqi5+oVwOM/eGw==",
+          "dev": true,
+          "requires": {
+            "semver": "^6.0.0"
+          }
         },
-        "regenerator-runtime": {
-            "version": "0.13.7",
-            "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.13.7.tgz",
-            "integrity": "sha512-a54FxoJDIr27pgf7IgeQGxmqUNYrcV338lf/6gH456HZ/PhX+5BcwHXG9ajESmwe6WRO0tAzRUrRmNONWgkrew=="
-        },
-        "regenerator-transform": {
-            "version": "0.14.5",
-            "resolved": "https://registry.npmjs.org/regenerator-transform/-/regenerator-transform-0.14.5.tgz",
-            "integrity": "sha512-eOf6vka5IO151Jfsw2NO9WpGX58W6wWmefK3I1zEGr0lOD0u8rwPaNqQL1aRxUaxLeKO3ArNh3VYg1KbaD+FFw==",
-            "dev": true,
-            "requires": {
-                "@babel/runtime": "^7.8.4"
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
+        }
+      }
+    },
+    "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,
+      "requires": {
+        "locate-path": "^5.0.0",
+        "path-exists": "^4.0.0"
+      }
+    },
+    "flat-cache": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/flat-cache/-/flat-cache-3.0.4.tgz",
+      "integrity": "sha512-dm9s5Pw7Jc0GvMYbshN6zchCA9RgQlzzEZX3vylR9IqFfS8XciblUXOKfW6SiuJ0e13eDYZoZV5wdrev7P3Nwg==",
+      "dev": true,
+      "requires": {
+        "flatted": "^3.1.0",
+        "rimraf": "^3.0.2"
+      }
+    },
+    "flatted": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/flatted/-/flatted-3.1.1.tgz",
+      "integrity": "sha512-zAoAQiudy+r5SvnSw3KJy5os/oRJYHzrzja/tBDqrZtNhUw8bt6y8OBzMWcjWr+8liV8Eb6yOhw8WZ7VFZ5ZzA==",
+      "dev": true
+    },
+    "follow-redirects": {
+      "version": "1.13.3",
+      "resolved": "https://registry.npmjs.org/follow-redirects/-/follow-redirects-1.13.3.tgz",
+      "integrity": "sha512-DUgl6+HDzB0iEptNQEXLx/KhTmDb8tZUHSeLqpnjpknR70H0nC2t9N73BK6fN4hOvJ84pKlIQVQ4k5FFlBedKA==",
+      "dev": true
+    },
+    "fontkit": {
+      "version": "1.8.1",
+      "resolved": "https://registry.npmjs.org/fontkit/-/fontkit-1.8.1.tgz",
+      "integrity": "sha512-BsNCjDoYRxmNWFdAuK1y9bQt+igIxGtTC9u/jSFjR9MKhmI00rP1fwSvERt+5ddE82544l0XH5mzXozQVUy2Tw==",
+      "requires": {
+        "babel-runtime": "^6.26.0",
+        "brfs": "^2.0.0",
+        "brotli": "^1.2.0",
+        "browserify-optional": "^1.0.1",
+        "clone": "^1.0.4",
+        "deep-equal": "^1.0.0",
+        "dfa": "^1.2.0",
+        "restructure": "^0.5.3",
+        "tiny-inflate": "^1.0.2",
+        "unicode-properties": "^1.2.2",
+        "unicode-trie": "^0.3.0"
+      }
+    },
+    "for-in": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/for-in/-/for-in-1.0.2.tgz",
+      "integrity": "sha1-gQaNKVqBQuwKxybG4iAMMPttXoA=",
+      "dev": true
+    },
+    "foreach": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmjs.org/foreach/-/foreach-2.0.5.tgz",
+      "integrity": "sha1-C+4AUBiusmDQo6865ljdATbsG5k="
+    },
+    "forwarded": {
+      "version": "0.1.2",
+      "resolved": "https://registry.npmjs.org/forwarded/-/forwarded-0.1.2.tgz",
+      "integrity": "sha1-mMI9qxF1ZXuMBXPozszZGw/xjIQ=",
+      "dev": true
+    },
+    "fraction.js": {
+      "version": "4.0.13",
+      "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-4.0.13.tgz",
+      "integrity": "sha512-E1fz2Xs9ltlUp+qbiyx9wmt2n9dRzPsS11Jtdb8D2o+cC7wr9xkkKsVKJuBX0ST+LVS+LhLO+SbLJNtfWcJvXA=="
+    },
+    "fragment-cache": {
+      "version": "0.2.1",
+      "resolved": "https://registry.npmjs.org/fragment-cache/-/fragment-cache-0.2.1.tgz",
+      "integrity": "sha1-QpD60n8T6Jvn8zeZxrxaCr//DRk=",
+      "dev": true,
+      "requires": {
+        "map-cache": "^0.2.2"
+      }
+    },
+    "fresh": {
+      "version": "0.5.2",
+      "resolved": "https://registry.npmjs.org/fresh/-/fresh-0.5.2.tgz",
+      "integrity": "sha1-PYyt2Q2XZWn6g1qx+OSyOhBWBac=",
+      "dev": true
+    },
+    "fs-readdir-recursive": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/fs-readdir-recursive/-/fs-readdir-recursive-1.1.0.tgz",
+      "integrity": "sha512-GNanXlVr2pf02+sPN40XN8HG+ePaNcvM0q5mZBd668Obwb0yD5GiUbZOFgwn8kGMY6I3mdyDJzieUy3PTYyTRA==",
+      "dev": true
+    },
+    "fs.realpath": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/fs.realpath/-/fs.realpath-1.0.0.tgz",
+      "integrity": "sha1-FQStJSMVjKpA20onh8sBQRmU6k8=",
+      "dev": true
+    },
+    "fsevents": {
+      "version": "2.3.2",
+      "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.3.2.tgz",
+      "integrity": "sha512-xiqMQR4xAeHTuB9uWm+fFRcIOgKBMiOBP+eXiyT7jsgVCq1bkVygt00oASowB7EdtpOHaaPgKt812P9ab+DDKA==",
+      "dev": true,
+      "optional": true
+    },
+    "function-bind": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.1.tgz",
+      "integrity": "sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A=="
+    },
+    "functional-red-black-tree": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/functional-red-black-tree/-/functional-red-black-tree-1.0.1.tgz",
+      "integrity": "sha1-GwqzvVU7Kg1jmdKcDj6gslIHgyc=",
+      "dev": true
+    },
+    "gensync": {
+      "version": "1.0.0-beta.2",
+      "resolved": "https://registry.npmjs.org/gensync/-/gensync-1.0.0-beta.2.tgz",
+      "integrity": "sha512-3hN7NaskYvMDLQY55gnW3NQ+mesEAepTqlg+VEbj7zzqEMBVNhzcGYYeqFo/TlYz6eQiFcp1HcsCZO+nGgS8zg==",
+      "dev": true
+    },
+    "get-assigned-identifiers": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/get-assigned-identifiers/-/get-assigned-identifiers-1.2.0.tgz",
+      "integrity": "sha512-mBBwmeGTrxEMO4pMaaf/uUEFHnYtwr8FTe8Y/mer4rcV/bye0qGm6pw1bGZFGStxC5O76c5ZAVBGnqHmOaJpdQ=="
+    },
+    "get-caller-file": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmjs.org/get-caller-file/-/get-caller-file-2.0.5.tgz",
+      "integrity": "sha512-DyFP3BM/3YHTQOCUL/w0OZHR0lpKeGrxotcHWcqNEdnltqFwXVfhEBQ94eIo34AfQpo0rGki4cyIiftY06h2Fg==",
+      "dev": true
+    },
+    "get-intrinsic": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/get-intrinsic/-/get-intrinsic-1.1.1.tgz",
+      "integrity": "sha512-kWZrnVM42QCiEA2Ig1bG8zjoIMOgxWwYCEeNdwY6Tv/cOSeGpcoX4pXHfKUxNKVoArnrEr2e9srnAxxGIraS9Q==",
+      "requires": {
+        "function-bind": "^1.1.1",
+        "has": "^1.0.3",
+        "has-symbols": "^1.0.1"
+      }
+    },
+    "get-stream": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-6.0.0.tgz",
+      "integrity": "sha512-A1B3Bh1UmL0bidM/YX2NsCOTnGJePL9rO/M+Mw3m9f2gUpfokS0hi5Eah0WSUEWZdZhIZtMjkIYS7mDfOqNHbg==",
+      "dev": true
+    },
+    "get-value": {
+      "version": "2.0.6",
+      "resolved": "https://registry.npmjs.org/get-value/-/get-value-2.0.6.tgz",
+      "integrity": "sha1-3BXKHGcjh8p2vTesCjlbogQqLCg=",
+      "dev": true
+    },
+    "glob": {
+      "version": "7.1.6",
+      "resolved": "https://registry.npmjs.org/glob/-/glob-7.1.6.tgz",
+      "integrity": "sha512-LwaxwyZ72Lk7vZINtNNrywX0ZuLyStrdDtabefZKAY5ZGJhVtgdznluResxNmPitE0SAO+O26sWTHeKSI2wMBA==",
+      "dev": true,
+      "requires": {
+        "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"
+      }
+    },
+    "glob-parent": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-5.1.2.tgz",
+      "integrity": "sha512-AOIgSQCepiJYwP3ARnGx+5VnTu2HBYdzbGP45eLw1vr3zB3vZLeyed1sC9hnbcOc9/SrMyM5RPQrkGz4aS9Zow==",
+      "dev": true,
+      "requires": {
+        "is-glob": "^4.0.1"
+      }
+    },
+    "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
+    },
+    "globals": {
+      "version": "13.7.0",
+      "resolved": "https://registry.npmjs.org/globals/-/globals-13.7.0.tgz",
+      "integrity": "sha512-Aipsz6ZKRxa/xQkZhNg0qIWXT6x6rD46f6x/PCnBomlttdIyAPak4YD9jTmKpZ72uROSMU87qJtcgpgHaVchiA==",
+      "dev": true,
+      "requires": {
+        "type-fest": "^0.20.2"
+      },
+      "dependencies": {
+        "type-fest": {
+          "version": "0.20.2",
+          "resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.20.2.tgz",
+          "integrity": "sha512-Ne+eE4r0/iWnpAxD852z3A+N0Bt5RN//NjJwRd2VFHEmrywxf5vsZlh4R6lixl6B+wz/8d+maTSAkN1FIkI3LQ==",
+          "dev": true
+        }
+      }
+    },
+    "globby": {
+      "version": "11.0.2",
+      "resolved": "https://registry.npmjs.org/globby/-/globby-11.0.2.tgz",
+      "integrity": "sha512-2ZThXDvvV8fYFRVIxnrMQBipZQDr7MxKAmQK1vujaj9/7eF0efG7BPUKJ7jP7G5SLF37xKDXvO4S/KKLj/Z0og==",
+      "dev": true,
+      "requires": {
+        "array-union": "^2.1.0",
+        "dir-glob": "^3.0.1",
+        "fast-glob": "^3.1.1",
+        "ignore": "^5.1.4",
+        "merge2": "^1.3.0",
+        "slash": "^3.0.0"
+      }
+    },
+    "graceful-fs": {
+      "version": "4.2.4",
+      "resolved": "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.4.tgz",
+      "integrity": "sha512-WjKPNJF79dtJAVniUlGGWHYGz2jWxT6VhN/4m1NdkbZ2nOsEF+cI1Edgql5zCRhs/VsQYRvrXctxktVXZUkixw==",
+      "dev": true
+    },
+    "graphlib": {
+      "version": "2.1.8",
+      "resolved": "https://registry.npmjs.org/graphlib/-/graphlib-2.1.8.tgz",
+      "integrity": "sha512-jcLLfkpoVGmH7/InMC/1hIvOPSUh38oJtGhvrOFGzioE1DZ+0YW16RgmOJhHiuWTvGiJQ9Z1Ik43JvkRPRvE+A==",
+      "requires": {
+        "lodash": "^4.17.15"
+      }
+    },
+    "handle-thing": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/handle-thing/-/handle-thing-2.0.1.tgz",
+      "integrity": "sha512-9Qn4yBxelxoh2Ow62nP+Ka/kMnOXRi8BXnRaUwezLNhqelnN49xKz4F/dPP8OYLxLxq6JDtZb2i9XznUQbNPTg==",
+      "dev": true
+    },
+    "has": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/has/-/has-1.0.3.tgz",
+      "integrity": "sha512-f2dvO0VU6Oej7RkWJGrehjbzMAjFp5/VKPp5tTpWIV4JHHZK1/BxbFRtf/siA2SWTe09caDmVtYYzWEIbBS4zw==",
+      "requires": {
+        "function-bind": "^1.1.1"
+      }
+    },
+    "has-ansi": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/has-ansi/-/has-ansi-2.0.0.tgz",
+      "integrity": "sha1-NPUEnOHs3ysGSa8+8k5F7TVBbZE=",
+      "dev": true,
+      "requires": {
+        "ansi-regex": "^2.0.0"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-2.1.1.tgz",
+          "integrity": "sha1-w7M6te42DYbg5ijwRorn7yfWVN8=",
+          "dev": true
+        }
+      }
+    },
+    "has-bigints": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/has-bigints/-/has-bigints-1.0.1.tgz",
+      "integrity": "sha512-LSBS2LjbNBTf6287JEbEzvJgftkF5qFkmCo9hDRpAzKhUOlJ+hx8dd4USs00SgsUNwc4617J9ki5YtEClM2ffA=="
+    },
+    "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
+    },
+    "has-symbols": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/has-symbols/-/has-symbols-1.0.2.tgz",
+      "integrity": "sha512-chXa79rL/UC2KlX17jo3vRGz0azaWEx5tGqZg5pO3NUyEJVB17dMruQlzCCOfUvElghKcm5194+BCRvi2Rv/Gw=="
+    },
+    "has-tostringtag": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/has-tostringtag/-/has-tostringtag-1.0.0.tgz",
+      "integrity": "sha512-kFjcSNhnlGV1kyoGk7OXKSawH5JOb/LzUc5w9B02hOTO0dfFRjbHQKvg1d6cf3HbeUmtU9VbbV3qzZ2Teh97WQ==",
+      "requires": {
+        "has-symbols": "^1.0.2"
+      }
+    },
+    "has-value": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/has-value/-/has-value-1.0.0.tgz",
+      "integrity": "sha1-GLKB2lhbHFxR3vJMkw7SmgvmsXc=",
+      "dev": true,
+      "requires": {
+        "get-value": "^2.0.6",
+        "has-values": "^1.0.0",
+        "isobject": "^3.0.0"
+      }
+    },
+    "has-values": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/has-values/-/has-values-1.0.0.tgz",
+      "integrity": "sha1-lbC2P+whRmGab+V/51Yo1aOe/k8=",
+      "dev": true,
+      "requires": {
+        "is-number": "^3.0.0",
+        "kind-of": "^4.0.0"
+      },
+      "dependencies": {
+        "is-number": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
+          "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
+          "dev": true,
+          "requires": {
+            "kind-of": "^3.0.2"
+          },
+          "dependencies": {
+            "kind-of": {
+              "version": "3.2.2",
+              "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+              "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+              "dev": true,
+              "requires": {
+                "is-buffer": "^1.1.5"
+              }
             }
+          }
         },
-        "regex-not": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/regex-not/-/regex-not-1.0.2.tgz",
-            "integrity": "sha512-J6SDjUgDxQj5NusnOtdFxDwN/+HWykR8GELwctJ7mdqhcyy1xEc4SRFHUXvxTp661YaVKAjfRLZ9cCqS6tn32A==",
-            "dev": true,
-            "requires": {
-                "extend-shallow": "^3.0.2",
-                "safe-regex": "^1.1.0"
+        "kind-of": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-4.0.0.tgz",
+          "integrity": "sha1-IIE989cSkosgc3hpGkUGb65y3Vc=",
+          "dev": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
+        }
+      }
+    },
+    "hpack.js": {
+      "version": "2.1.6",
+      "resolved": "https://registry.npmjs.org/hpack.js/-/hpack.js-2.1.6.tgz",
+      "integrity": "sha1-h3dMCUnlE/QuhFdbPEVoH63ioLI=",
+      "dev": true,
+      "requires": {
+        "inherits": "^2.0.1",
+        "obuf": "^1.0.0",
+        "readable-stream": "^2.0.1",
+        "wbuf": "^1.1.0"
+      }
+    },
+    "html-entities": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/html-entities/-/html-entities-1.4.0.tgz",
+      "integrity": "sha512-8nxjcBcd8wovbeKx7h3wTji4e6+rhaVuPNpMqwWgnHh+N9ToqsCs6XztWRBPQ+UtzsoMAdKZtUENoVzU/EMtZA==",
+      "dev": true
+    },
+    "http-deceiver": {
+      "version": "1.2.7",
+      "resolved": "https://registry.npmjs.org/http-deceiver/-/http-deceiver-1.2.7.tgz",
+      "integrity": "sha1-+nFolEq5pRnTN8sL7HKE3D5yPYc=",
+      "dev": true
+    },
+    "http-errors": {
+      "version": "1.7.2",
+      "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.7.2.tgz",
+      "integrity": "sha512-uUQBt3H/cSIVfch6i1EuPNy/YsRSOUBXTVfZ+yR7Zjez3qjBz6i9+i4zjNaoqcoFVI4lQJ5plg63TvGfRSDCRg==",
+      "dev": true,
+      "requires": {
+        "depd": "~1.1.2",
+        "inherits": "2.0.3",
+        "setprototypeof": "1.1.1",
+        "statuses": ">= 1.5.0 < 2",
+        "toidentifier": "1.0.0"
+      },
+      "dependencies": {
+        "inherits": {
+          "version": "2.0.3",
+          "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
+          "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=",
+          "dev": true
+        }
+      }
+    },
+    "http-parser-js": {
+      "version": "0.5.3",
+      "resolved": "https://registry.npmjs.org/http-parser-js/-/http-parser-js-0.5.3.tgz",
+      "integrity": "sha512-t7hjvef/5HEK7RWTdUzVUhl8zkEu+LlaE0IYzdMuvbSDipxBRpOn4Uhw8ZyECEa808iVT8XCjzo6xmYt4CiLZg==",
+      "dev": true
+    },
+    "http-proxy": {
+      "version": "1.18.1",
+      "resolved": "https://registry.npmjs.org/http-proxy/-/http-proxy-1.18.1.tgz",
+      "integrity": "sha512-7mz/721AbnJwIVbnaSv1Cz3Am0ZLT/UBwkC92VlxhXv/k/BBQfM2fXElQNC27BVGr0uwUpplYPQM9LnaBMR5NQ==",
+      "dev": true,
+      "requires": {
+        "eventemitter3": "^4.0.0",
+        "follow-redirects": "^1.0.0",
+        "requires-port": "^1.0.0"
+      }
+    },
+    "http-proxy-middleware": {
+      "version": "0.19.1",
+      "resolved": "https://registry.npmjs.org/http-proxy-middleware/-/http-proxy-middleware-0.19.1.tgz",
+      "integrity": "sha512-yHYTgWMQO8VvwNS22eLLloAkvungsKdKTLO8AJlftYIKNfJr3GK3zK0ZCfzDDGUBttdGc8xFy1mCitvNKQtC3Q==",
+      "dev": true,
+      "requires": {
+        "http-proxy": "^1.17.0",
+        "is-glob": "^4.0.0",
+        "lodash": "^4.17.11",
+        "micromatch": "^3.1.10"
+      },
+      "dependencies": {
+        "braces": {
+          "version": "2.3.2",
+          "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
+          "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
+          "dev": true,
+          "requires": {
+            "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"
+          },
+          "dependencies": {
+            "extend-shallow": {
+              "version": "2.0.1",
+              "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+              "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+              "dev": true,
+              "requires": {
+                "is-extendable": "^0.1.0"
+              }
             }
+          }
         },
-        "regexp.prototype.flags": {
-            "version": "1.3.1",
-            "resolved": "https://registry.npmjs.org/regexp.prototype.flags/-/regexp.prototype.flags-1.3.1.tgz",
-            "integrity": "sha512-JiBdRBq91WlY7uRJ0ds7R+dU02i6LKi8r3BuQhNXn+kmeLN+EfHhfjqMRis1zJxnlu88hq/4dx0P2OP3APRTOA==",
-            "dev": true,
-            "requires": {
-                "call-bind": "^1.0.2",
-                "define-properties": "^1.1.3"
+        "fill-range": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
+          "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
+          "dev": true,
+          "requires": {
+            "extend-shallow": "^2.0.1",
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1",
+            "to-regex-range": "^2.1.0"
+          },
+          "dependencies": {
+            "extend-shallow": {
+              "version": "2.0.1",
+              "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+              "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+              "dev": true,
+              "requires": {
+                "is-extendable": "^0.1.0"
+              }
             }
+          }
         },
-        "regexpp": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/regexpp/-/regexpp-3.1.0.tgz",
-            "integrity": "sha512-ZOIzd8yVsQQA7j8GCSlPGXwg5PfmA1mrq0JP4nGhh54LaKN3xdai/vHUDu74pKwV8OxseMS65u2NImosQcSD0Q==",
-            "dev": true
-        },
-        "regexpu-core": {
-            "version": "4.7.1",
-            "resolved": "https://registry.npmjs.org/regexpu-core/-/regexpu-core-4.7.1.tgz",
-            "integrity": "sha512-ywH2VUraA44DZQuRKzARmw6S66mr48pQVva4LBeRhcOltJ6hExvWly5ZjFLYo67xbIxb6W1q4bAGtgfEl20zfQ==",
-            "dev": true,
-            "requires": {
-                "regenerate": "^1.4.0",
-                "regenerate-unicode-properties": "^8.2.0",
-                "regjsgen": "^0.5.1",
-                "regjsparser": "^0.6.4",
-                "unicode-match-property-ecmascript": "^1.0.4",
-                "unicode-match-property-value-ecmascript": "^1.2.0"
+        "is-number": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
+          "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
+          "dev": true,
+          "requires": {
+            "kind-of": "^3.0.2"
+          },
+          "dependencies": {
+            "kind-of": {
+              "version": "3.2.2",
+              "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+              "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+              "dev": true,
+              "requires": {
+                "is-buffer": "^1.1.5"
+              }
             }
+          }
         },
-        "regjsgen": {
-            "version": "0.5.2",
-            "resolved": "https://registry.npmjs.org/regjsgen/-/regjsgen-0.5.2.tgz",
-            "integrity": "sha512-OFFT3MfrH90xIW8OOSyUrk6QHD5E9JOTeGodiJeBS3J6IwlgzJMNE/1bZklWz5oTg+9dCMyEetclvCVXOPoN3A==",
-            "dev": true
-        },
-        "regjsparser": {
-            "version": "0.6.7",
-            "resolved": "https://registry.npmjs.org/regjsparser/-/regjsparser-0.6.7.tgz",
-            "integrity": "sha512-ib77G0uxsA2ovgiYbCVGx4Pv3PSttAx2vIwidqQzbL2U5S4Q+j00HdSAneSBuyVcMvEnTXMjiGgB+DlXozVhpQ==",
-            "dev": true,
-            "requires": {
-                "jsesc": "~0.5.0"
-            },
-            "dependencies": {
-                "jsesc": {
-                    "version": "0.5.0",
-                    "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-0.5.0.tgz",
-                    "integrity": "sha1-597mbjXW/Bb3EP6R1c9p9w8IkR0=",
-                    "dev": true
-                }
-            }
+        "micromatch": {
+          "version": "3.1.10",
+          "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
+          "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
+          "dev": true,
+          "requires": {
+            "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"
+          }
         },
-        "remove-trailing-separator": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/remove-trailing-separator/-/remove-trailing-separator-1.1.0.tgz",
-            "integrity": "sha1-wkvOKig62tW8P1jg1IJJuSN52O8=",
-            "dev": true
-        },
-        "repeat-element": {
-            "version": "1.1.3",
-            "resolved": "https://registry.npmjs.org/repeat-element/-/repeat-element-1.1.3.tgz",
-            "integrity": "sha512-ahGq0ZnV5m5XtZLMb+vP76kcAM5nkLqk0lpqAuojSKGgQtn4eRi4ZZGm2olo2zKFH+sMsWaqOCW1dqAnOru72g==",
-            "dev": true
-        },
-        "repeat-string": {
-            "version": "1.6.1",
-            "resolved": "https://registry.npmjs.org/repeat-string/-/repeat-string-1.6.1.tgz",
-            "integrity": "sha1-jcrkcOHIirwtYA//Sndihtp15jc=",
-            "dev": true
-        },
-        "require-directory": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/require-directory/-/require-directory-2.1.1.tgz",
-            "integrity": "sha1-jGStX9MNqxyXbiNE/+f3kqam30I=",
-            "dev": true
-        },
-        "require-from-string": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/require-from-string/-/require-from-string-2.0.2.tgz",
-            "integrity": "sha512-Xf0nWe6RseziFMu+Ap9biiUbmplq6S9/p+7w7YXP/JBHhrUDDUhwa+vANyubuqfZWTveU//DYVGsDG7RKL/vEw==",
-            "dev": true
-        },
-        "require-main-filename": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/require-main-filename/-/require-main-filename-2.0.0.tgz",
-            "integrity": "sha512-NKN5kMDylKuldxYLSUfrbo5Tuzh4hd+2E8NPPX02mZtn1VuREQToYe/ZdlJy+J3uCpfaiGF05e7B8W0iXbQHmg==",
-            "dev": true
-        },
-        "requires-port": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/requires-port/-/requires-port-1.0.0.tgz",
-            "integrity": "sha1-kl0mAdOaxIXgkc8NpcbmlNw9yv8=",
-            "dev": true
+        "to-regex-range": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
+          "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
+          "dev": true,
+          "requires": {
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1"
+          }
+        }
+      }
+    },
+    "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
+    },
+    "iconv-lite": {
+      "version": "0.4.24",
+      "resolved": "https://registry.npmjs.org/iconv-lite/-/iconv-lite-0.4.24.tgz",
+      "integrity": "sha512-v3MXnZAcvnywkTUEZomIActle7RXXeedOR31wwl7VlyoXO4Qi9arvSenNQWne1TcRwhCL1HwLI21bEqdpj8/rA==",
+      "dev": true,
+      "requires": {
+        "safer-buffer": ">= 2.1.2 < 3"
+      }
+    },
+    "ieee754": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/ieee754/-/ieee754-1.2.1.tgz",
+      "integrity": "sha512-dcyqhDvX1C46lXZcVqCpK+FtMRQVdIMN6/Df5js2zouUsqG7I6sFxitIC+7KYK29KdXOLHdu9zL4sFnoVQnqaA=="
+    },
+    "ignore": {
+      "version": "5.1.8",
+      "resolved": "https://registry.npmjs.org/ignore/-/ignore-5.1.8.tgz",
+      "integrity": "sha512-BMpfD7PpiETpBl/A6S498BaIJ6Y/ABT93ETbby2fP00v4EbvPBXWEoaR1UBPKs3iR53pJY7EtZk5KACI57i1Uw==",
+      "dev": true
+    },
+    "import-fresh": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmjs.org/import-fresh/-/import-fresh-3.3.0.tgz",
+      "integrity": "sha512-veYYhQa+D1QBKznvhUHxb8faxlrwUnxseDAbAp457E0wLNio2bOSKnjYDhMj+YiAq61xrMGhQk9iXVk5FzgQMw==",
+      "dev": true,
+      "requires": {
+        "parent-module": "^1.0.0",
+        "resolve-from": "^4.0.0"
+      },
+      "dependencies": {
+        "resolve-from": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/resolve-from/-/resolve-from-4.0.0.tgz",
+          "integrity": "sha512-pb/MYmXstAkysRFx8piNI1tGFNQIFA3vkE3Gq4EuA1dF6gHp/+vgZqsCGJapvy8N3Q+4o7FwvquPJcnZ7RYy4g==",
+          "dev": true
+        }
+      }
+    },
+    "import-local": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/import-local/-/import-local-3.0.2.tgz",
+      "integrity": "sha512-vjL3+w0oulAVZ0hBHnxa/Nm5TAurf9YLQJDhqRZyqb+VKGOB6LU8t9H1Nr5CIo16vh9XfJTOoHwU0B71S557gA==",
+      "dev": true,
+      "requires": {
+        "pkg-dir": "^4.2.0",
+        "resolve-cwd": "^3.0.0"
+      }
+    },
+    "imurmurhash": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/imurmurhash/-/imurmurhash-0.1.4.tgz",
+      "integrity": "sha1-khi5srkoojixPcT7a21XbyMUU+o=",
+      "dev": true
+    },
+    "inflight": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmjs.org/inflight/-/inflight-1.0.6.tgz",
+      "integrity": "sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=",
+      "dev": true,
+      "requires": {
+        "once": "^1.3.0",
+        "wrappy": "1"
+      }
+    },
+    "inherits": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.4.tgz",
+      "integrity": "sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ=="
+    },
+    "internal-ip": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmjs.org/internal-ip/-/internal-ip-4.3.0.tgz",
+      "integrity": "sha512-S1zBo1D6zcsyuC6PMmY5+55YMILQ9av8lotMx447Bq6SAgo/sDK6y6uUKmuYhW7eacnIhFfsPmCNYdDzsnnDCg==",
+      "dev": true,
+      "requires": {
+        "default-gateway": "^4.2.0",
+        "ipaddr.js": "^1.9.0"
+      }
+    },
+    "internal-slot": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/internal-slot/-/internal-slot-1.0.3.tgz",
+      "integrity": "sha512-O0DB1JC/sPyZl7cIo78n5dR7eUSwwpYPiXRhTzNxZVAMUuB8vlnRFyLxdrVToks6XPLVnFfbzaVd5WLjhgg+vA==",
+      "requires": {
+        "get-intrinsic": "^1.1.0",
+        "has": "^1.0.3",
+        "side-channel": "^1.0.4"
+      }
+    },
+    "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
+    },
+    "invariant": {
+      "version": "2.2.4",
+      "resolved": "https://registry.npmjs.org/invariant/-/invariant-2.2.4.tgz",
+      "integrity": "sha512-phJfQVBuaJM5raOpJjSfkiD6BpbCE4Ns//LaXl6wGYtUBY83nWS6Rf9tXm2e8VaK60JEjYldbPif/A2B1C2gNA==",
+      "dev": true,
+      "requires": {
+        "loose-envify": "^1.0.0"
+      }
+    },
+    "ip": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/ip/-/ip-1.1.5.tgz",
+      "integrity": "sha1-vd7XARQpCCjAoDnnLvJfWq7ENUo=",
+      "dev": true
+    },
+    "ip-regex": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/ip-regex/-/ip-regex-2.1.0.tgz",
+      "integrity": "sha1-+ni/XS5pE8kRzp+BnuUUa7bYROk=",
+      "dev": true
+    },
+    "ipaddr.js": {
+      "version": "1.9.1",
+      "resolved": "https://registry.npmjs.org/ipaddr.js/-/ipaddr.js-1.9.1.tgz",
+      "integrity": "sha512-0KI/607xoxSToH7GjN1FfSbLoU0+btTicjsQSWQlh/hZykN8KpmMf7uYwPW3R+akZ6R/w18ZlXSHBYXiYUPO3g==",
+      "dev": true
+    },
+    "is-absolute-url": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/is-absolute-url/-/is-absolute-url-3.0.3.tgz",
+      "integrity": "sha512-opmNIX7uFnS96NtPmhWQgQx6/NYFgsUXYMllcfzwWKUMwfo8kku1TvE6hkNcH+Q1ts5cMVrsY7j0bxXQDciu9Q==",
+      "dev": true
+    },
+    "is-accessor-descriptor": {
+      "version": "0.1.6",
+      "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-0.1.6.tgz",
+      "integrity": "sha1-qeEss66Nh2cn7u84Q/igiXtcmNY=",
+      "dev": true,
+      "requires": {
+        "kind-of": "^3.0.2"
+      },
+      "dependencies": {
+        "kind-of": {
+          "version": "3.2.2",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+          "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+          "dev": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
+        }
+      }
+    },
+    "is-arguments": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/is-arguments/-/is-arguments-1.1.0.tgz",
+      "integrity": "sha512-1Ij4lOMPl/xB5kBDn7I+b2ttPMKa8szhEIrXDuXQD/oe3HJLTLhqhgGspwgyGd6MOywBUqVvYicF72lkgDnIHg==",
+      "requires": {
+        "call-bind": "^1.0.0"
+      }
+    },
+    "is-bigint": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/is-bigint/-/is-bigint-1.0.3.tgz",
+      "integrity": "sha512-ZU538ajmYJmzysE5yU4Y7uIrPQ2j704u+hXFiIPQExpqzzUbpe5jCPdTfmz7jXRxZdvjY3KZ3ZNenoXQovX+Dg=="
+    },
+    "is-binary-path": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-1.0.1.tgz",
+      "integrity": "sha1-dfFmQrSA8YenEcgUFh/TpKdlWJg=",
+      "dev": true,
+      "requires": {
+        "binary-extensions": "^1.0.0"
+      }
+    },
+    "is-boolean-object": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/is-boolean-object/-/is-boolean-object-1.1.2.tgz",
+      "integrity": "sha512-gDYaKHJmnj4aWxyj6YHyXVpdQawtVLHU5cb+eztPGczf6cjuTdwve5ZIEfgXqH4e57An1D1AKf8CZ3kYrQRqYA==",
+      "requires": {
+        "call-bind": "^1.0.2",
+        "has-tostringtag": "^1.0.0"
+      }
+    },
+    "is-buffer": {
+      "version": "1.1.6",
+      "resolved": "https://registry.npmjs.org/is-buffer/-/is-buffer-1.1.6.tgz",
+      "integrity": "sha512-NcdALwpXkTm5Zvvbk7owOUSvVvBKDgKP5/ewfXEznmQFfs4ZRmanOeKBTjRVjka3QFoN6XJ+9F3USqfHqTaU5w==",
+      "dev": true
+    },
+    "is-callable": {
+      "version": "1.2.4",
+      "resolved": "https://registry.npmjs.org/is-callable/-/is-callable-1.2.4.tgz",
+      "integrity": "sha512-nsuwtxZfMX67Oryl9LCQ+upnC0Z0BgpwntpS89m1H/TLF0zNfzfLMV/9Wa/6MZsj0acpEjAO0KF1xT6ZdLl95w=="
+    },
+    "is-core-module": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/is-core-module/-/is-core-module-2.2.0.tgz",
+      "integrity": "sha512-XRAfAdyyY5F5cOXn7hYQDqh2Xmii+DEfIcQGxK/uNwMHhIkPWO0g8msXcbzLe+MpGoR951MlqM/2iIlU4vKDdQ==",
+      "requires": {
+        "has": "^1.0.3"
+      }
+    },
+    "is-data-descriptor": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-0.1.4.tgz",
+      "integrity": "sha1-C17mSDiOLIYCgueT8YVv7D8wG1Y=",
+      "dev": true,
+      "requires": {
+        "kind-of": "^3.0.2"
+      },
+      "dependencies": {
+        "kind-of": {
+          "version": "3.2.2",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+          "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+          "dev": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
+        }
+      }
+    },
+    "is-date-object": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/is-date-object/-/is-date-object-1.0.2.tgz",
+      "integrity": "sha512-USlDT524woQ08aoZFzh3/Z6ch9Y/EWXEHQ/AaRN0SkKq4t2Jw2R2339tSXmwuVoY7LLlBCbOIlx2myP/L5zk0g=="
+    },
+    "is-descriptor": {
+      "version": "0.1.6",
+      "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-0.1.6.tgz",
+      "integrity": "sha512-avDYr0SB3DwO9zsMov0gKCESFYqCnE4hq/4z3TdUlukEy5t9C0YRq7HLrsN52NAcqXKaepeCD0n+B0arnVG3Hg==",
+      "dev": true,
+      "requires": {
+        "is-accessor-descriptor": "^0.1.6",
+        "is-data-descriptor": "^0.1.4",
+        "kind-of": "^5.0.0"
+      },
+      "dependencies": {
+        "kind-of": {
+          "version": "5.1.0",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-5.1.0.tgz",
+          "integrity": "sha512-NGEErnH6F2vUuXDh+OlbcKW7/wOcfdRHaZ7VWtqCztfHri/++YKmP51OdWeGPuqCOba6kk2OTe5d02VmTB80Pw==",
+          "dev": true
+        }
+      }
+    },
+    "is-extendable": {
+      "version": "0.1.1",
+      "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-0.1.1.tgz",
+      "integrity": "sha1-YrEQ4omkcUGOPsNqYX1HLjAd/Ik=",
+      "dev": true
+    },
+    "is-extglob": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-2.1.1.tgz",
+      "integrity": "sha1-qIwCU1eR8C7TfHahueqXc8gz+MI=",
+      "dev": true
+    },
+    "is-fullwidth-code-point": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-3.0.0.tgz",
+      "integrity": "sha512-zymm5+u+sCsSWyD9qNaejV3DFvhCKclKdizYaJUuHA83RLjb7nSuGnddCHGv0hk+KY7BMAlsWeK4Ueg6EV6XQg==",
+      "dev": true
+    },
+    "is-generator-function": {
+      "version": "1.0.10",
+      "resolved": "https://registry.npmjs.org/is-generator-function/-/is-generator-function-1.0.10.tgz",
+      "integrity": "sha512-jsEjy9l3yiXEQ+PsXdmBwEPcOxaXWLspKdplFUVI9vq1iZgIekeC0L167qeu86czQaxed3q/Uzuw0swL0irL8A==",
+      "requires": {
+        "has-tostringtag": "^1.0.0"
+      }
+    },
+    "is-glob": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.1.tgz",
+      "integrity": "sha512-5G0tKtBTFImOqDnLB2hG6Bp2qcKEFduo4tZu9MT/H6NQv/ghhy30o55ufafxJ/LdH79LLs2Kfrn85TLKyA7BUg==",
+      "dev": true,
+      "requires": {
+        "is-extglob": "^2.1.1"
+      }
+    },
+    "is-negative-zero": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/is-negative-zero/-/is-negative-zero-2.0.1.tgz",
+      "integrity": "sha512-2z6JzQvZRa9A2Y7xC6dQQm4FSTSTNWjKIYYTt4246eMTJmIo0Q+ZyOsU66X8lxK1AbB92dFeglPLrhwpeRKO6w=="
+    },
+    "is-number": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmjs.org/is-number/-/is-number-7.0.0.tgz",
+      "integrity": "sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==",
+      "dev": true
+    },
+    "is-number-object": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmjs.org/is-number-object/-/is-number-object-1.0.6.tgz",
+      "integrity": "sha512-bEVOqiRcvo3zO1+G2lVMy+gkkEm9Yh7cDMRusKKu5ZJKPUYSJwICTKZrNKHA2EbSP0Tu0+6B/emsYNHZyn6K8g==",
+      "requires": {
+        "has-tostringtag": "^1.0.0"
+      }
+    },
+    "is-path-cwd": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/is-path-cwd/-/is-path-cwd-2.2.0.tgz",
+      "integrity": "sha512-w942bTcih8fdJPJmQHFzkS76NEP8Kzzvmw92cXsazb8intwLqPibPPdXf4ANdKV3rYMuuQYGIWtvz9JilB3NFQ==",
+      "dev": true
+    },
+    "is-path-in-cwd": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/is-path-in-cwd/-/is-path-in-cwd-2.1.0.tgz",
+      "integrity": "sha512-rNocXHgipO+rvnP6dk3zI20RpOtrAM/kzbB258Uw5BWr3TpXi861yzjo16Dn4hUox07iw5AyeMLHWsujkjzvRQ==",
+      "dev": true,
+      "requires": {
+        "is-path-inside": "^2.1.0"
+      }
+    },
+    "is-path-inside": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/is-path-inside/-/is-path-inside-2.1.0.tgz",
+      "integrity": "sha512-wiyhTzfDWsvwAW53OBWF5zuvaOGlZ6PwYxAbPVDhpm+gM09xKQGjBq/8uYN12aDvMxnAnq3dxTyoSoRNmg5YFg==",
+      "dev": true,
+      "requires": {
+        "path-is-inside": "^1.0.2"
+      }
+    },
+    "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,
+      "requires": {
+        "isobject": "^3.0.1"
+      }
+    },
+    "is-regex": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/is-regex/-/is-regex-1.1.2.tgz",
+      "integrity": "sha512-axvdhb5pdhEVThqJzYXwMlVuZwC+FF2DpcOhTS+y/8jVq4trxyPgfcwIxIKiyeuLlSQYKkmUaPQJ8ZE4yNKXDg==",
+      "requires": {
+        "call-bind": "^1.0.2",
+        "has-symbols": "^1.0.1"
+      }
+    },
+    "is-stream": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/is-stream/-/is-stream-2.0.0.tgz",
+      "integrity": "sha512-XCoy+WlUr7d1+Z8GgSuXmpuUFC9fOhRXglJMx+dwLKTkL44Cjd4W1Z5P+BQZpr+cR93aGP4S/s7Ftw6Nd/kiEw==",
+      "dev": true
+    },
+    "is-string": {
+      "version": "1.0.7",
+      "resolved": "https://registry.npmjs.org/is-string/-/is-string-1.0.7.tgz",
+      "integrity": "sha512-tE2UXzivje6ofPW7l23cjDOMa09gb7xlAqG6jG5ej6uPV32TlWP3NKPigtaGeHNu9fohccRYvIiZMfOOnOYUtg==",
+      "requires": {
+        "has-tostringtag": "^1.0.0"
+      }
+    },
+    "is-symbol": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/is-symbol/-/is-symbol-1.0.4.tgz",
+      "integrity": "sha512-C/CPBqKWnvdcxqIARxyOh4v1UUEOCHpgDa0WYgpKDFMszcrPcffg5uhwSgPCLD2WWxmq6isisz87tzT01tuGhg==",
+      "requires": {
+        "has-symbols": "^1.0.2"
+      }
+    },
+    "is-typed-array": {
+      "version": "1.1.7",
+      "resolved": "https://registry.npmjs.org/is-typed-array/-/is-typed-array-1.1.7.tgz",
+      "integrity": "sha512-VxlpTBGknhQ3o7YiVjIhdLU6+oD8dPz/79vvvH4F+S/c8608UCVa9fgDpa1kZgFoUST2DCgacc70UszKgzKuvA==",
+      "requires": {
+        "available-typed-arrays": "^1.0.4",
+        "call-bind": "^1.0.2",
+        "es-abstract": "^1.18.5",
+        "foreach": "^2.0.5",
+        "has-tostringtag": "^1.0.0"
+      }
+    },
+    "is-windows": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/is-windows/-/is-windows-1.0.2.tgz",
+      "integrity": "sha512-eXK1UInq2bPmjyX6e3VHIzMLobc4J94i4AWn+Hpq3OU5KkrRC96OAcR3PRJ/pGu6m8TRnBHP9dkXQVsT/COVIA==",
+      "dev": true
+    },
+    "is-wsl": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/is-wsl/-/is-wsl-1.1.0.tgz",
+      "integrity": "sha1-HxbkqiKwTRM2tmGIpmrzxgDDpm0=",
+      "dev": true
+    },
+    "isarray": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/isarray/-/isarray-1.0.0.tgz",
+      "integrity": "sha1-u5NdSFgsuhaMBoNJV6VKPgcSTxE="
+    },
+    "isexe": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/isexe/-/isexe-2.0.0.tgz",
+      "integrity": "sha1-6PvzdNxVb/iUehDcsFctYz8s+hA=",
+      "dev": true
+    },
+    "ismobilejs": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/ismobilejs/-/ismobilejs-1.1.1.tgz",
+      "integrity": "sha512-VaFW53yt8QO61k2WJui0dHf4SlL8lxBofUuUmwBo0ljPk0Drz2TiuDW4jo3wDcv41qy/SxrJ+VAzJ/qYqsmzRw=="
+    },
+    "isobject": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/isobject/-/isobject-3.0.1.tgz",
+      "integrity": "sha1-TkMekrEalzFjaqH5yNHMvP2reN8=",
+      "dev": true
+    },
+    "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="
+    },
+    "jest-worker": {
+      "version": "26.6.2",
+      "resolved": "https://registry.npmjs.org/jest-worker/-/jest-worker-26.6.2.tgz",
+      "integrity": "sha512-KWYVV1c4i+jbMpaBC+U++4Va0cp8OisU185o73T1vo99hqi7w8tSJfUXYswwqqrjzwxa6KpRK54WhPvwf5w6PQ==",
+      "dev": true,
+      "requires": {
+        "@types/node": "*",
+        "merge-stream": "^2.0.0",
+        "supports-color": "^7.0.0"
+      }
+    },
+    "jquery": {
+      "version": "3.6.0",
+      "resolved": "https://registry.npmjs.org/jquery/-/jquery-3.6.0.tgz",
+      "integrity": "sha512-JVzAR/AjBvVt2BmYhxRCSYysDsPcssdmTFnzyLEts9qNwmjmu4JTAMYubEfwVOSwpQ1I1sKKFcxhZCI2buerfw=="
+    },
+    "js-tokens": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-4.0.0.tgz",
+      "integrity": "sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==",
+      "dev": true
+    },
+    "js-yaml": {
+      "version": "3.14.1",
+      "resolved": "https://registry.npmjs.org/js-yaml/-/js-yaml-3.14.1.tgz",
+      "integrity": "sha512-okMH7OXXJ7YrN9Ok3/SXrnu4iX9yOk+25nqX4imS2npuvTYDmo/QEZoqwZkYaIDk3jVvBOTOIEgEhaLOynBS9g==",
+      "dev": true,
+      "requires": {
+        "argparse": "^1.0.7",
+        "esprima": "^4.0.0"
+      }
+    },
+    "jsesc": {
+      "version": "2.5.2",
+      "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-2.5.2.tgz",
+      "integrity": "sha512-OYu7XEzjkCQ3C5Ps3QIZsQfNpqoJyZZA99wd9aWd05NCtC5pWOkShK2mkL6HXQR6/Cy2lbNdPlZBpuQHXE63gA==",
+      "dev": true
+    },
+    "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
+    },
+    "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
+    },
+    "json-stable-stringify-without-jsonify": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/json-stable-stringify-without-jsonify/-/json-stable-stringify-without-jsonify-1.0.1.tgz",
+      "integrity": "sha1-nbe1lJatPzz+8wp1FC0tkwrXJlE=",
+      "dev": true
+    },
+    "json3": {
+      "version": "3.3.3",
+      "resolved": "https://registry.npmjs.org/json3/-/json3-3.3.3.tgz",
+      "integrity": "sha512-c7/8mbUsKigAbLkD5B010BK4D9LZm7A1pNItkEwiUZRpIN66exu/e7YQWysGun+TRKaJp8MhemM+VkfWv42aCA==",
+      "dev": true
+    },
+    "json5": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/json5/-/json5-2.2.0.tgz",
+      "integrity": "sha512-f+8cldu7X/y7RAJurMEJmdoKXGB/X550w2Nr3tTbezL6RwEE/iMcm+tZnXeoZtKuOq6ft8+CqzEkrIgx1fPoQA==",
+      "dev": true,
+      "requires": {
+        "minimist": "^1.2.5"
+      }
+    },
+    "killable": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/killable/-/killable-1.0.1.tgz",
+      "integrity": "sha512-LzqtLKlUwirEUyl/nicirVmNiPvYs7l5n8wOPP7fyJVpUPkvCnW/vuiXGpylGUlnPDnB7311rARzAt3Mhswpjg==",
+      "dev": true
+    },
+    "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
+    },
+    "levn": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/levn/-/levn-0.4.1.tgz",
+      "integrity": "sha512-+bT2uH4E5LGE7h/n3evcS/sQlJXCpIp6ym8OWJ5eV6+67Dsql/LaaT7qJBAt2rzfoa/5QBGBhxDix1dMt2kQKQ==",
+      "dev": true,
+      "requires": {
+        "prelude-ls": "^1.2.1",
+        "type-check": "~0.4.0"
+      }
+    },
+    "linebreak": {
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/linebreak/-/linebreak-0.3.0.tgz",
+      "integrity": "sha1-BSZICmLAW9Z58+nZmDDgnGp9DtY=",
+      "requires": {
+        "base64-js": "0.0.8",
+        "brfs": "^1.3.0",
+        "unicode-trie": "^0.3.0"
+      },
+      "dependencies": {
+        "base64-js": {
+          "version": "0.0.8",
+          "resolved": "https://registry.npmjs.org/base64-js/-/base64-js-0.0.8.tgz",
+          "integrity": "sha1-EQHpVE9KdrG8OybUUsqW16NeeXg="
+        },
+        "brfs": {
+          "version": "1.6.1",
+          "resolved": "https://registry.npmjs.org/brfs/-/brfs-1.6.1.tgz",
+          "integrity": "sha512-OfZpABRQQf+Xsmju8XE9bDjs+uU4vLREGolP7bDgcpsI17QREyZ4Bl+2KLxxx1kCgA0fAIhKQBaBYh+PEcCqYQ==",
+          "requires": {
+            "quote-stream": "^1.0.1",
+            "resolve": "^1.1.5",
+            "static-module": "^2.2.0",
+            "through2": "^2.0.0"
+          }
+        },
+        "escodegen": {
+          "version": "1.9.1",
+          "resolved": "https://registry.npmjs.org/escodegen/-/escodegen-1.9.1.tgz",
+          "integrity": "sha512-6hTjO1NAWkHnDk3OqQ4YrCuwwmGHL9S3nPlzBOUG/R44rda3wLNrfvQ5fkSGjyhHFKM7ALPKcKGrwvCLe0lC7Q==",
+          "requires": {
+            "esprima": "^3.1.3",
+            "estraverse": "^4.2.0",
+            "esutils": "^2.0.2",
+            "optionator": "^0.8.1",
+            "source-map": "~0.6.1"
+          }
         },
-        "resolve": {
-            "version": "1.19.0",
-            "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.19.0.tgz",
-            "integrity": "sha512-rArEXAgsBG4UgRGcynxWIWKFvh/XZCcS8UJdHhwy91zwAvCZIbcs+vAbflgBnNjYMs/i/i+/Ux6IZhML1yPvxg==",
-            "dev": true,
-            "requires": {
-                "is-core-module": "^2.1.0",
-                "path-parse": "^1.0.6"
-            }
+        "esprima": {
+          "version": "3.1.3",
+          "resolved": "https://registry.npmjs.org/esprima/-/esprima-3.1.3.tgz",
+          "integrity": "sha1-/cpRzuYTOJXjyI1TXOSdv/YqRjM="
         },
-        "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,
-            "requires": {
-                "resolve-from": "^5.0.0"
-            }
+        "levn": {
+          "version": "0.3.0",
+          "resolved": "https://registry.npmjs.org/levn/-/levn-0.3.0.tgz",
+          "integrity": "sha1-OwmSTt+fCDwEkP3UwLxEIeBHZO4=",
+          "requires": {
+            "prelude-ls": "~1.1.2",
+            "type-check": "~0.3.2"
+          }
+        },
+        "magic-string": {
+          "version": "0.22.5",
+          "resolved": "https://registry.npmjs.org/magic-string/-/magic-string-0.22.5.tgz",
+          "integrity": "sha512-oreip9rJZkzvA8Qzk9HFs8fZGF/u7H/gtrE8EN6RjKJ9kh2HlC+yQ2QezifqTZfGyiuAV0dRv5a+y/8gBb1m9w==",
+          "requires": {
+            "vlq": "^0.2.2"
+          }
+        },
+        "object-inspect": {
+          "version": "1.4.1",
+          "resolved": "https://registry.npmjs.org/object-inspect/-/object-inspect-1.4.1.tgz",
+          "integrity": "sha512-wqdhLpfCUbEsoEwl3FXwGyv8ief1k/1aUdIPCqVnupM6e8l63BEJdiF/0swtn04/8p05tG/T0FrpTlfwvljOdw=="
         },
-        "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
-        },
-        "resolve-url": {
-            "version": "0.2.1",
-            "resolved": "https://registry.npmjs.org/resolve-url/-/resolve-url-0.2.1.tgz",
-            "integrity": "sha1-LGN/53yJOv0qZj/iGqkIAGjiBSo=",
-            "dev": true
-        },
-        "ret": {
-            "version": "0.1.15",
-            "resolved": "https://registry.npmjs.org/ret/-/ret-0.1.15.tgz",
-            "integrity": "sha512-TTlYpa+OL+vMMNG24xSlQGEJ3B/RzEfUlLct7b5G/ytav+wPrplCpVMFuwzXbkecJrb6IYo1iFb0S9v37754mg==",
-            "dev": true
-        },
-        "retry": {
-            "version": "0.12.0",
-            "resolved": "https://registry.npmjs.org/retry/-/retry-0.12.0.tgz",
-            "integrity": "sha1-G0KmJmoh8HQh0bC1S33BZ7AcATs=",
-            "dev": true
-        },
-        "reusify": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/reusify/-/reusify-1.0.4.tgz",
-            "integrity": "sha512-U9nH88a3fc/ekCF1l0/UP1IosiuIjyTh7hBvXVMHYgVcfGvt897Xguj2UOLDeI5BG2m7/uwyaLVT6fbtCwTyzw==",
-            "dev": true
+        "optionator": {
+          "version": "0.8.3",
+          "resolved": "https://registry.npmjs.org/optionator/-/optionator-0.8.3.tgz",
+          "integrity": "sha512-+IW9pACdk3XWmmTXG8m3upGUJst5XRGzxMRjXzAuJ1XnIFNvfhjjIuYkDvysnPQ7qzqVzLt78BCruntqRhWQbA==",
+          "requires": {
+            "deep-is": "~0.1.3",
+            "fast-levenshtein": "~2.0.6",
+            "levn": "~0.3.0",
+            "prelude-ls": "~1.1.2",
+            "type-check": "~0.3.2",
+            "word-wrap": "~1.2.3"
+          }
         },
-        "rimraf": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/rimraf/-/rimraf-3.0.2.tgz",
-            "integrity": "sha512-JZkJMZkAGFFPP2YqXZXPbMlMBgsxzE8ILs4lMIX/2o0L9UBw9O/Y3o6wFw/i9YLapcUJWwqbi3kdxIPdC62TIA==",
-            "dev": true,
-            "requires": {
-                "glob": "^7.1.3"
-            }
+        "prelude-ls": {
+          "version": "1.1.2",
+          "resolved": "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.1.2.tgz",
+          "integrity": "sha1-IZMqVJ9eUv/ZqCf1cOBL5iqX2lQ="
+        },
+        "static-module": {
+          "version": "2.2.5",
+          "resolved": "https://registry.npmjs.org/static-module/-/static-module-2.2.5.tgz",
+          "integrity": "sha512-D8vv82E/Kpmz3TXHKG8PPsCPg+RAX6cbCOyvjM6x04qZtQ47EtJFVwRsdov3n5d6/6ynrOY9XB4JkaZwB2xoRQ==",
+          "requires": {
+            "concat-stream": "~1.6.0",
+            "convert-source-map": "^1.5.1",
+            "duplexer2": "~0.1.4",
+            "escodegen": "~1.9.0",
+            "falafel": "^2.1.0",
+            "has": "^1.0.1",
+            "magic-string": "^0.22.4",
+            "merge-source-map": "1.0.4",
+            "object-inspect": "~1.4.0",
+            "quote-stream": "~1.0.2",
+            "readable-stream": "~2.3.3",
+            "shallow-copy": "~0.0.1",
+            "static-eval": "^2.0.0",
+            "through2": "~2.0.3"
+          }
         },
-        "run-parallel": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/run-parallel/-/run-parallel-1.2.0.tgz",
-            "integrity": "sha512-5l4VyZR86LZ/lDxZTR6jqL8AFE2S0IFLMP26AbjsLVADxHdhB/c0GUsH+y39UfCi3dzz8OlQuPmnaJOMoDHQBA==",
-            "dev": true,
-            "requires": {
-                "queue-microtask": "^1.2.2"
-            }
+        "type-check": {
+          "version": "0.3.2",
+          "resolved": "https://registry.npmjs.org/type-check/-/type-check-0.3.2.tgz",
+          "integrity": "sha1-WITKtRLPHTVeP7eE8wgEsrUg23I=",
+          "requires": {
+            "prelude-ls": "~1.1.2"
+          }
+        }
+      }
+    },
+    "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
+    },
+    "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,
+      "requires": {
+        "p-locate": "^4.1.0"
+      }
+    },
+    "lodash": {
+      "version": "4.17.21",
+      "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+      "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg=="
+    },
+    "lodash.debounce": {
+      "version": "4.0.8",
+      "resolved": "https://registry.npmjs.org/lodash.debounce/-/lodash.debounce-4.0.8.tgz",
+      "integrity": "sha1-gteb/zCmfEAF/9XiUVMArZyk168=",
+      "dev": true
+    },
+    "loglevel": {
+      "version": "1.7.1",
+      "resolved": "https://registry.npmjs.org/loglevel/-/loglevel-1.7.1.tgz",
+      "integrity": "sha512-Hesni4s5UkWkwCGJMQGAh71PaLUmKFM60dHvq0zi/vDhhrzuk+4GgNbTXJ12YYQJn6ZKBDNIjYcuQGKudvqrIw==",
+      "dev": true
+    },
+    "loose-envify": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/loose-envify/-/loose-envify-1.4.0.tgz",
+      "integrity": "sha512-lyuxPGr/Wfhrlem2CL/UcnUc1zcqKAImBDzukY7Y5F/yQiNdko6+fRLevlw1HgMySw7f611UIY408EtxRSoK3Q==",
+      "dev": true,
+      "requires": {
+        "js-tokens": "^3.0.0 || ^4.0.0"
+      }
+    },
+    "lru-cache": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmjs.org/lru-cache/-/lru-cache-6.0.0.tgz",
+      "integrity": "sha512-Jo6dJ04CmSjuznwJSS3pUeWmd/H0ffTlkXXgwZi+eq1UCmqQwCh+eLsYOYCwY991i2Fah4h1BEMCx4qThGbsiA==",
+      "dev": true,
+      "requires": {
+        "yallist": "^4.0.0"
+      }
+    },
+    "magic-string": {
+      "version": "0.25.1",
+      "resolved": "https://registry.npmjs.org/magic-string/-/magic-string-0.25.1.tgz",
+      "integrity": "sha512-sCuTz6pYom8Rlt4ISPFn6wuFodbKMIHUMv4Qko9P17dpxb7s52KJTmRuZZqHdGmLCK9AOcDare039nRIcfdkEg==",
+      "requires": {
+        "sourcemap-codec": "^1.4.1"
+      }
+    },
+    "make-dir": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-2.1.0.tgz",
+      "integrity": "sha512-LS9X+dc8KLxXCb8dni79fLIIUA5VyZoyjSMCwTluaXA0o27cCK0bhXkpgw+sTXVpPy/lSO57ilRixqk0vDmtRA==",
+      "dev": true,
+      "requires": {
+        "pify": "^4.0.1",
+        "semver": "^5.6.0"
+      },
+      "dependencies": {
+        "semver": {
+          "version": "5.7.1",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-5.7.1.tgz",
+          "integrity": "sha512-sauaDf/PZdVgrLTNYHRtpXa1iRiKcaebiKQ1BJdpQlWH2lCvexQdX55snPFyK7QzpudqbCI0qXFfOasHdyNDGQ==",
+          "dev": true
+        }
+      }
+    },
+    "map-cache": {
+      "version": "0.2.2",
+      "resolved": "https://registry.npmjs.org/map-cache/-/map-cache-0.2.2.tgz",
+      "integrity": "sha1-wyq9C9ZSXZsFFkW7TyasXcmKDb8=",
+      "dev": true
+    },
+    "map-visit": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/map-visit/-/map-visit-1.0.0.tgz",
+      "integrity": "sha1-7Nyo8TFE5mDxtb1B8S80edmN+48=",
+      "dev": true,
+      "requires": {
+        "object-visit": "^1.0.0"
+      }
+    },
+    "mathjs": {
+      "version": "9.3.0",
+      "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-9.3.0.tgz",
+      "integrity": "sha512-0kYW+TXgB8lCqUj5wHR2hqAO2twSbPRelSFgRJXiwAx4nM6FrIb43Jd6XhW7sVbwYB+9HCNiyg5Kn8VYeB7ilg==",
+      "requires": {
+        "complex.js": "^2.0.11",
+        "decimal.js": "^10.2.1",
+        "escape-latex": "^1.2.0",
+        "fraction.js": "^4.0.13",
+        "javascript-natural-sort": "^0.7.1",
+        "seedrandom": "^3.0.5",
+        "tiny-emitter": "^2.1.0",
+        "typed-function": "^2.0.0"
+      }
+    },
+    "media-typer": {
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/media-typer/-/media-typer-0.3.0.tgz",
+      "integrity": "sha1-hxDXrwqmJvj/+hzgAWhUUmMlV0g=",
+      "dev": true
+    },
+    "memory-fs": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/memory-fs/-/memory-fs-0.4.1.tgz",
+      "integrity": "sha1-OpoguEYlI+RHz7x+i7gO1me/xVI=",
+      "dev": true,
+      "requires": {
+        "errno": "^0.1.3",
+        "readable-stream": "^2.0.1"
+      }
+    },
+    "merge-descriptors": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/merge-descriptors/-/merge-descriptors-1.0.1.tgz",
+      "integrity": "sha1-sAqqVW3YtEVoFQ7J0blT8/kMu2E=",
+      "dev": true
+    },
+    "merge-source-map": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/merge-source-map/-/merge-source-map-1.0.4.tgz",
+      "integrity": "sha1-pd5GU42uhNQRTMXqArR3KmNGcB8=",
+      "requires": {
+        "source-map": "^0.5.6"
+      },
+      "dependencies": {
+        "source-map": {
+          "version": "0.5.7",
+          "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
+          "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w="
+        }
+      }
+    },
+    "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
+    },
+    "merge2": {
+      "version": "1.4.1",
+      "resolved": "https://registry.npmjs.org/merge2/-/merge2-1.4.1.tgz",
+      "integrity": "sha512-8q7VEgMJW4J8tcfVPy8g09NcQwZdbwFEqhe/WZkoIzjn/3TGDwtOCYtXGxA3O8tPzpczCCDgv+P2P5y00ZJOOg==",
+      "dev": true
+    },
+    "methods": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/methods/-/methods-1.1.2.tgz",
+      "integrity": "sha1-VSmk1nZUE07cxSZmVoNbD4Ua/O4=",
+      "dev": true
+    },
+    "micromatch": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.2.tgz",
+      "integrity": "sha512-y7FpHSbMUMoyPbYUSzO6PaZ6FyRnQOpHuKwbo1G+Knck95XVU4QAiKdGEnj5wwoS7PlOgthX/09u5iFJ+aYf5Q==",
+      "dev": true,
+      "requires": {
+        "braces": "^3.0.1",
+        "picomatch": "^2.0.5"
+      }
+    },
+    "mime": {
+      "version": "1.6.0",
+      "resolved": "https://registry.npmjs.org/mime/-/mime-1.6.0.tgz",
+      "integrity": "sha512-x0Vn8spI+wuJ1O6S7gnbaQg8Pxh4NNHb7KSINmEWKiPE4RKOplvijn+NkmYmmRgP68mc70j2EbeTFRsrswaQeg==",
+      "dev": true
+    },
+    "mime-db": {
+      "version": "1.46.0",
+      "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.46.0.tgz",
+      "integrity": "sha512-svXaP8UQRZ5K7or+ZmfNhg2xX3yKDMUzqadsSqi4NCH/KomcH75MAMYAGVlvXn4+b/xOPhS3I2uHKRUzvjY7BQ==",
+      "dev": true
+    },
+    "mime-types": {
+      "version": "2.1.29",
+      "resolved": "https://registry.npmjs.org/mime-types/-/mime-types-2.1.29.tgz",
+      "integrity": "sha512-Y/jMt/S5sR9OaqteJtslsFZKWOIIqMACsJSiHghlCAyhf7jfVYjKBmLiX8OgpWeW+fjJ2b+Az69aPFPkUOY6xQ==",
+      "dev": true,
+      "requires": {
+        "mime-db": "1.46.0"
+      }
+    },
+    "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
+    },
+    "mini-signals": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/mini-signals/-/mini-signals-1.2.0.tgz",
+      "integrity": "sha1-RbCAE8X65RokqhqTXNMXye1yHXQ="
+    },
+    "minimalistic-assert": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/minimalistic-assert/-/minimalistic-assert-1.0.1.tgz",
+      "integrity": "sha512-UtJcAD4yEaGtjPezWuO9wC4nwUnVH/8/Im3yEHQP4b67cXlD/Qr9hdITCU1xDbSEXg2XKNaP8jsReV7vQd00/A==",
+      "dev": true
+    },
+    "minimatch": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.4.tgz",
+      "integrity": "sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==",
+      "dev": true,
+      "requires": {
+        "brace-expansion": "^1.1.7"
+      }
+    },
+    "minimist": {
+      "version": "1.2.5",
+      "resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.5.tgz",
+      "integrity": "sha512-FM9nNUYrRBAELZQT3xeZQ7fmMOBg6nWNmJKTcgsJeaLstP/UODVpGsr5OhXhhXg6f+qtJ8uiZ+PUxkDWcgIXLw=="
+    },
+    "mixin-deep": {
+      "version": "1.3.2",
+      "resolved": "https://registry.npmjs.org/mixin-deep/-/mixin-deep-1.3.2.tgz",
+      "integrity": "sha512-WRoDn//mXBiJ1H40rqa3vH0toePwSsGb45iInWlTySa+Uu4k3tYUSxa2v1KqAiLtvlrSzaExqS1gtk96A9zvEA==",
+      "dev": true,
+      "requires": {
+        "for-in": "^1.0.2",
+        "is-extendable": "^1.0.1"
+      },
+      "dependencies": {
+        "is-extendable": {
+          "version": "1.0.1",
+          "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-1.0.1.tgz",
+          "integrity": "sha512-arnXMxT1hhoKo9k1LZdmlNyJdDDfy2v0fXjFlmok4+i8ul/6WlbVge9bhM74OpNPQPMGUToDtz+KXa1PneJxOA==",
+          "dev": true,
+          "requires": {
+            "is-plain-object": "^2.0.4"
+          }
+        }
+      }
+    },
+    "mkdirp": {
+      "version": "0.5.5",
+      "resolved": "https://registry.npmjs.org/mkdirp/-/mkdirp-0.5.5.tgz",
+      "integrity": "sha512-NKmAlESf6jMGym1++R0Ra7wvhV+wFW63FaSOFPwRahvea0gMUcGUhVeAg/0BC0wiv9ih5NYPB1Wn1UEI1/L+xQ==",
+      "dev": true,
+      "requires": {
+        "minimist": "^1.2.5"
+      }
+    },
+    "ms": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz",
+      "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==",
+      "dev": true
+    },
+    "multicast-dns": {
+      "version": "6.2.3",
+      "resolved": "https://registry.npmjs.org/multicast-dns/-/multicast-dns-6.2.3.tgz",
+      "integrity": "sha512-ji6J5enbMyGRHIAkAOu3WdV8nggqviKCEKtXcOqfphZZtQrmHKycfynJ2V7eVPUA4NhJ6V7Wf4TmGbTwKE9B6g==",
+      "dev": true,
+      "requires": {
+        "dns-packet": "^1.3.1",
+        "thunky": "^1.0.2"
+      }
+    },
+    "multicast-dns-service-types": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/multicast-dns-service-types/-/multicast-dns-service-types-1.1.0.tgz",
+      "integrity": "sha1-iZ8R2WhuXgXLkbNdXw5jt3PPyQE=",
+      "dev": true
+    },
+    "nan": {
+      "version": "2.14.2",
+      "resolved": "https://registry.npmjs.org/nan/-/nan-2.14.2.tgz",
+      "integrity": "sha512-M2ufzIiINKCuDfBSAUr1vWQ+vuVcA9kqx8JJUsbQi6yf1uGRyb7HfpdfUr5qLXf3B/t8dPvcjhKMmlfnP47EzQ==",
+      "dev": true,
+      "optional": true
+    },
+    "nanomatch": {
+      "version": "1.2.13",
+      "resolved": "https://registry.npmjs.org/nanomatch/-/nanomatch-1.2.13.tgz",
+      "integrity": "sha512-fpoe2T0RbHwBTBUOftAfBPaDEi06ufaUai0mE6Yn1kacc3SnTErfb/h+X94VXzI64rKFHYImXSvdwGGCmwOqCA==",
+      "dev": true,
+      "requires": {
+        "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"
+      }
+    },
+    "natural-compare": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/natural-compare/-/natural-compare-1.4.0.tgz",
+      "integrity": "sha1-Sr6/7tdUHywnrPspvbvRXI1bpPc=",
+      "dev": true
+    },
+    "negotiator": {
+      "version": "0.6.2",
+      "resolved": "https://registry.npmjs.org/negotiator/-/negotiator-0.6.2.tgz",
+      "integrity": "sha512-hZXc7K2e+PgeI1eDBe/10Ard4ekbfrrqG8Ep+8Jmf4JID2bNg7NvCPOZN+kfF574pFQI7mum2AUqDidoKqcTOw==",
+      "dev": true
+    },
+    "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
+    },
+    "next-tick": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/next-tick/-/next-tick-1.0.0.tgz",
+      "integrity": "sha1-yobR/ogoFpsBICCOPchCS524NCw="
+    },
+    "nice-try": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmjs.org/nice-try/-/nice-try-1.0.5.tgz",
+      "integrity": "sha512-1nh45deeb5olNY7eX82BkPO7SSxR5SSYJiPTrTdFUVYwAl8CKMA5N9PjTYkHiRjisVcxcQ1HXdLhx2qxxJzLNQ==",
+      "dev": true
+    },
+    "node-forge": {
+      "version": "0.10.0",
+      "resolved": "https://registry.npmjs.org/node-forge/-/node-forge-0.10.0.tgz",
+      "integrity": "sha512-PPmu8eEeG9saEUvI97fm4OYxXVB6bFvyNTyiUOBichBpFG8A1Ljw3bY62+5oOjDEMHRnd0Y7HQ+x7uzxOzC6JA==",
+      "dev": true
+    },
+    "node-releases": {
+      "version": "1.1.73",
+      "resolved": "https://registry.npmjs.org/node-releases/-/node-releases-1.1.73.tgz",
+      "integrity": "sha512-uW7fodD6pyW2FZNZnp/Z3hvWKeEW1Y8R1+1CnErE8cXFXzl5blBOoVB41CvMer6P6Q0S5FXDwcHgFd1Wj0U9zg==",
+      "dev": true
+    },
+    "normalize-path": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-3.0.0.tgz",
+      "integrity": "sha512-6eZs5Ls3WtCisHWp9S2GUy8dqkpGi4BVSz3GaqiE6ezub0512ESztXUwUB6C6IKbQkY2Pnb/mD4WYojCRwcwLA==",
+      "dev": true
+    },
+    "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,
+      "requires": {
+        "path-key": "^3.0.0"
+      }
+    },
+    "object-assign": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmjs.org/object-assign/-/object-assign-4.1.1.tgz",
+      "integrity": "sha1-IQmtx5ZYh8/AXLvUQsrIv7s2CGM="
+    },
+    "object-copy": {
+      "version": "0.1.0",
+      "resolved": "https://registry.npmjs.org/object-copy/-/object-copy-0.1.0.tgz",
+      "integrity": "sha1-fn2Fi3gb18mRpBupde04EnVOmYw=",
+      "dev": true,
+      "requires": {
+        "copy-descriptor": "^0.1.0",
+        "define-property": "^0.2.5",
+        "kind-of": "^3.0.3"
+      },
+      "dependencies": {
+        "define-property": {
+          "version": "0.2.5",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
+          "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^0.1.0"
+          }
         },
+        "kind-of": {
+          "version": "3.2.2",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+          "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+          "dev": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
+        }
+      }
+    },
+    "object-inspect": {
+      "version": "1.11.0",
+      "resolved": "https://registry.npmjs.org/object-inspect/-/object-inspect-1.11.0.tgz",
+      "integrity": "sha512-jp7ikS6Sd3GxQfZJPyH3cjcbJF6GZPClgdV+EFygjFLQ5FmW/dRUnTd9PQ9k0JhoNDabWFbpF1yCdSWCC6gexg=="
+    },
+    "object-is": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/object-is/-/object-is-1.1.5.tgz",
+      "integrity": "sha512-3cyDsyHgtmi7I7DfSSI2LDp6SK2lwvtbg0p0R1e0RvTqF5ceGx+K2dfSjm1bKDMVCFEDAQvy+o8c6a7VujOddw==",
+      "requires": {
+        "call-bind": "^1.0.2",
+        "define-properties": "^1.1.3"
+      }
+    },
+    "object-keys": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/object-keys/-/object-keys-1.1.1.tgz",
+      "integrity": "sha512-NuAESUOUMrlIXOfHKzD6bpPu3tYt3xvjNdRIQ+FeT0lNb4K8WR70CaDxhuNguS2XG+GjkyMwOzsN5ZktImfhLA=="
+    },
+    "object-visit": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/object-visit/-/object-visit-1.0.1.tgz",
+      "integrity": "sha1-95xEk68MU3e1n+OdOV5BBC3QRbs=",
+      "dev": true,
+      "requires": {
+        "isobject": "^3.0.0"
+      }
+    },
+    "object.assign": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/object.assign/-/object.assign-4.1.2.tgz",
+      "integrity": "sha512-ixT2L5THXsApyiUPYKmW+2EHpXXe5Ii3M+f4e+aJFAHao5amFRW6J0OO6c/LU8Be47utCx2GL89hxGB6XSmKuQ==",
+      "requires": {
+        "call-bind": "^1.0.0",
+        "define-properties": "^1.1.3",
+        "has-symbols": "^1.0.1",
+        "object-keys": "^1.1.1"
+      }
+    },
+    "object.pick": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmjs.org/object.pick/-/object.pick-1.3.0.tgz",
+      "integrity": "sha1-h6EKxMFpS9Lhy/U1kaZhQftd10c=",
+      "dev": true,
+      "requires": {
+        "isobject": "^3.0.1"
+      }
+    },
+    "obuf": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/obuf/-/obuf-1.1.2.tgz",
+      "integrity": "sha512-PX1wu0AmAdPqOL1mWhqmlOd8kOIZQwGZw6rh7uby9fTc5lhaOWFLX3I6R1hrF9k3zUY40e6igsLGkDXK92LJNg==",
+      "dev": true
+    },
+    "on-finished": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmjs.org/on-finished/-/on-finished-2.3.0.tgz",
+      "integrity": "sha1-IPEzZIGwg811M3mSoWlxqi2QaUc=",
+      "dev": true,
+      "requires": {
+        "ee-first": "1.1.1"
+      }
+    },
+    "on-headers": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/on-headers/-/on-headers-1.0.2.tgz",
+      "integrity": "sha512-pZAE+FJLoyITytdqK0U5s+FIpjN0JP3OzFi/u8Rx+EV5/W+JTWGXG8xFzevE7AjBfDqHv/8vL8qQsIhHnqRkrA==",
+      "dev": true
+    },
+    "once": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz",
+      "integrity": "sha1-WDsap3WWHUsROsF9nFC6753Xa9E=",
+      "dev": true,
+      "requires": {
+        "wrappy": "1"
+      }
+    },
+    "onetime": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmjs.org/onetime/-/onetime-5.1.2.tgz",
+      "integrity": "sha512-kbpaSSGJTWdAY5KPVeMOKXSrPtr8C8C7wodJbcsd51jRnmD+GZu8Y0VoU6Dm5Z4vWr0Ig/1NKuWRKf7j5aaYSg==",
+      "dev": true,
+      "requires": {
+        "mimic-fn": "^2.1.0"
+      }
+    },
+    "opn": {
+      "version": "5.5.0",
+      "resolved": "https://registry.npmjs.org/opn/-/opn-5.5.0.tgz",
+      "integrity": "sha512-PqHpggC9bLV0VeWcdKhkpxY+3JTzetLSqTCWL/z/tFIbI6G8JCjondXklT1JinczLz2Xib62sSp0T/gKT4KksA==",
+      "dev": true,
+      "requires": {
+        "is-wsl": "^1.1.0"
+      }
+    },
+    "optionator": {
+      "version": "0.9.1",
+      "resolved": "https://registry.npmjs.org/optionator/-/optionator-0.9.1.tgz",
+      "integrity": "sha512-74RlY5FCnhq4jRxVUPKDaRwrVNXMqsGsiW6AJw4XK8hmtm10wC0ypZBLw5IIp85NZMr91+qd1RvvENwg7jjRFw==",
+      "dev": true,
+      "requires": {
+        "deep-is": "^0.1.3",
+        "fast-levenshtein": "^2.0.6",
+        "levn": "^0.4.1",
+        "prelude-ls": "^1.2.1",
+        "type-check": "^0.4.0",
+        "word-wrap": "^1.2.3"
+      }
+    },
+    "original": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/original/-/original-1.0.2.tgz",
+      "integrity": "sha512-hyBVl6iqqUOJ8FqRe+l/gS8H+kKYjrEndd5Pm1MfBtsEKA038HkkdbAl/72EAXGyonD/PFsvmVG+EvcIpliMBg==",
+      "dev": true,
+      "requires": {
+        "url-parse": "^1.4.3"
+      }
+    },
+    "p-finally": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/p-finally/-/p-finally-1.0.0.tgz",
+      "integrity": "sha1-P7z7FbiZpEEjs0ttzBi3JDNqLK4=",
+      "dev": true
+    },
+    "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,
+      "requires": {
+        "p-try": "^2.0.0"
+      }
+    },
+    "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,
+      "requires": {
+        "p-limit": "^2.2.0"
+      }
+    },
+    "p-map": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/p-map/-/p-map-2.1.0.tgz",
+      "integrity": "sha512-y3b8Kpd8OAN444hxfBbFfj1FY/RjtTd8tzYwhUqNYXx0fXx2iX4maP4Qr6qhIKbQXI02wTLAda4fYUbDagTUFw==",
+      "dev": true
+    },
+    "p-retry": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/p-retry/-/p-retry-3.0.1.tgz",
+      "integrity": "sha512-XE6G4+YTTkT2a0UWb2kjZe8xNwf8bIbnqpc/IS/idOBVhyves0mK5OJgeocjx7q5pvX/6m23xuzVPYT1uGM73w==",
+      "dev": true,
+      "requires": {
+        "retry": "^0.12.0"
+      }
+    },
+    "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
+    },
+    "pako": {
+      "version": "0.2.9",
+      "resolved": "https://registry.npmjs.org/pako/-/pako-0.2.9.tgz",
+      "integrity": "sha1-8/dSL073gjSNqBYbrZ7P1Rv4OnU="
+    },
+    "parent-module": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/parent-module/-/parent-module-1.0.1.tgz",
+      "integrity": "sha512-GQ2EWRpQV8/o+Aw8YqtfZZPfNRWZYkbidE9k5rpl/hC3vtHHBfGm2Ifi6qWV+coDGkrUKZAxE3Lot5kcsRlh+g==",
+      "dev": true,
+      "requires": {
+        "callsites": "^3.0.0"
+      }
+    },
+    "parse-uri": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/parse-uri/-/parse-uri-1.0.3.tgz",
+      "integrity": "sha512-upMnGxNcm+45So85HoguwZTVZI9u11i36DdxJfGF2HYWS2eh3TIx7+/tTi7qrEq15qzGkVhsKjesau+kCk48pA=="
+    },
+    "parseurl": {
+      "version": "1.3.3",
+      "resolved": "https://registry.npmjs.org/parseurl/-/parseurl-1.3.3.tgz",
+      "integrity": "sha512-CiyeOxFT/JZyN5m0z9PfXw4SCBJ6Sygz1Dpl0wqjlhDEGGBP1GnsUVEL0p63hoG1fcj3fHynXi9NYO4nWOL+qQ==",
+      "dev": true
+    },
+    "pascalcase": {
+      "version": "0.1.1",
+      "resolved": "https://registry.npmjs.org/pascalcase/-/pascalcase-0.1.1.tgz",
+      "integrity": "sha1-s2PlXoAGym/iF4TS2yK9FdeRfxQ=",
+      "dev": true
+    },
+    "path-dirname": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/path-dirname/-/path-dirname-1.0.2.tgz",
+      "integrity": "sha1-zDPSTVJeCZpTiMAzbG4yuRYGCeA=",
+      "dev": true
+    },
+    "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
+    },
+    "path-is-absolute": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/path-is-absolute/-/path-is-absolute-1.0.1.tgz",
+      "integrity": "sha1-F0uSaHNVNP+8es5r9TpanhtcX18=",
+      "dev": true
+    },
+    "path-is-inside": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/path-is-inside/-/path-is-inside-1.0.2.tgz",
+      "integrity": "sha1-NlQX3t5EQw0cEa9hAn+s8HS9/FM=",
+      "dev": true
+    },
+    "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
+    },
+    "path-parse": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.6.tgz",
+      "integrity": "sha512-GSmOT2EbHrINBf9SR7CDELwlJ8AENk3Qn7OikK4nFYAu3Ote2+JYNVvkpAEQm3/TLNEJFD/xZJjzyxg3KBWOzw=="
+    },
+    "path-to-regexp": {
+      "version": "0.1.7",
+      "resolved": "https://registry.npmjs.org/path-to-regexp/-/path-to-regexp-0.1.7.tgz",
+      "integrity": "sha1-32BBeABfUi8V60SQ5yR6G/qmf4w=",
+      "dev": true
+    },
+    "path-type": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/path-type/-/path-type-4.0.0.tgz",
+      "integrity": "sha512-gDKb8aZMDeD/tZWs9P6+q0J9Mwkdl6xMV8TjnGP3qJVJ06bdMgkbBlLU8IdfOsIsFz2BW1rNVT3XuNEl8zPAvw==",
+      "dev": true
+    },
+    "pdfkit": {
+      "version": "0.8.3",
+      "resolved": "https://registry.npmjs.org/pdfkit/-/pdfkit-0.8.3.tgz",
+      "integrity": "sha1-7Jmlf8Vcowlyb4VkVtoUQY9TMOM=",
+      "requires": {
+        "fontkit": "^1.0.0",
+        "linebreak": "^0.3.0",
+        "png-js": ">=0.1.0"
+      }
+    },
+    "picomatch": {
+      "version": "2.2.2",
+      "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-2.2.2.tgz",
+      "integrity": "sha512-q0M/9eZHzmr0AulXyPwNfZjtwZ/RBZlbN3K3CErVrk50T2ASYI7Bye0EvekFY3IP1Nt2DHu0re+V2ZHIpMkuWg==",
+      "dev": true
+    },
+    "pify": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/pify/-/pify-4.0.1.tgz",
+      "integrity": "sha512-uB80kBFb/tfd68bVleG9T5GGsGPjJrLAUpR5PZIrhBnIaRTQRjqdJSsIKkOP6OAIFbj7GOrcudc5pNjZ+geV2g==",
+      "dev": true
+    },
+    "pinkie": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmjs.org/pinkie/-/pinkie-2.0.4.tgz",
+      "integrity": "sha1-clVrgM+g1IqXToDnckjoDtT3+HA=",
+      "dev": true
+    },
+    "pinkie-promise": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/pinkie-promise/-/pinkie-promise-2.0.1.tgz",
+      "integrity": "sha1-ITXW36ejWMBprJsXh3YogihFD/o=",
+      "dev": true,
+      "requires": {
+        "pinkie": "^2.0.0"
+      }
+    },
+    "pixi.js": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/pixi.js/-/pixi.js-6.0.2.tgz",
+      "integrity": "sha512-ioH2+TxyWMwY+nlOgopxfHBBOpB2Wp79LBNCXPP8dIFWH6q70IAKAL++39aK7+MyLvdqwQ+tSnIWuAMNpKPJCw==",
+      "requires": {
+        "@pixi/accessibility": "6.0.2",
+        "@pixi/app": "6.0.2",
+        "@pixi/compressed-textures": "6.0.2",
+        "@pixi/constants": "6.0.2",
+        "@pixi/core": "6.0.2",
+        "@pixi/display": "6.0.2",
+        "@pixi/extract": "6.0.2",
+        "@pixi/filter-alpha": "6.0.2",
+        "@pixi/filter-blur": "6.0.2",
+        "@pixi/filter-color-matrix": "6.0.2",
+        "@pixi/filter-displacement": "6.0.2",
+        "@pixi/filter-fxaa": "6.0.2",
+        "@pixi/filter-noise": "6.0.2",
+        "@pixi/graphics": "6.0.2",
+        "@pixi/interaction": "6.0.2",
+        "@pixi/loaders": "6.0.2",
+        "@pixi/math": "6.0.2",
+        "@pixi/mesh": "6.0.2",
+        "@pixi/mesh-extras": "6.0.2",
+        "@pixi/mixin-cache-as-bitmap": "6.0.2",
+        "@pixi/mixin-get-child-by-name": "6.0.2",
+        "@pixi/mixin-get-global-position": "6.0.2",
+        "@pixi/particles": "6.0.2",
+        "@pixi/polyfill": "6.0.2",
+        "@pixi/prepare": "6.0.2",
+        "@pixi/runner": "6.0.2",
+        "@pixi/settings": "6.0.2",
+        "@pixi/sprite": "6.0.2",
+        "@pixi/sprite-animated": "6.0.2",
+        "@pixi/sprite-tiling": "6.0.2",
+        "@pixi/spritesheet": "6.0.2",
+        "@pixi/text": "6.0.2",
+        "@pixi/text-bitmap": "6.0.2",
+        "@pixi/ticker": "6.0.2",
+        "@pixi/utils": "6.0.2"
+      }
+    },
+    "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,
+      "requires": {
+        "find-up": "^4.0.0"
+      }
+    },
+    "png-js": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/png-js/-/png-js-1.0.0.tgz",
+      "integrity": "sha512-k+YsbhpA9e+EFfKjTCH3VW6aoKlyNYI6NYdTfDL4CIvFnvsuO84ttonmZE7rc+v23SLTH8XX+5w/Ak9v0xGY4g=="
+    },
+    "portfinder": {
+      "version": "1.0.28",
+      "resolved": "https://registry.npmjs.org/portfinder/-/portfinder-1.0.28.tgz",
+      "integrity": "sha512-Se+2isanIcEqf2XMHjyUKskczxbPH7dQnlMjXX6+dybayyHvAf/TCgyMRlzf/B6QDhAEFOGes0pzRo3by4AbMA==",
+      "dev": true,
+      "requires": {
+        "async": "^2.6.2",
+        "debug": "^3.1.1",
+        "mkdirp": "^0.5.5"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "3.2.7",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.7.tgz",
+          "integrity": "sha512-CFjzYYAi4ThfiQvizrFQevTTXHtnCqWfe7x1AhgEscTz6ZbLbfoLRLPugTQyBth6f8ZERVUSyWHFD/7Wu4t1XQ==",
+          "dev": true,
+          "requires": {
+            "ms": "^2.1.1"
+          }
+        }
+      }
+    },
+    "posix-character-classes": {
+      "version": "0.1.1",
+      "resolved": "https://registry.npmjs.org/posix-character-classes/-/posix-character-classes-0.1.1.tgz",
+      "integrity": "sha1-AerA/jta9xoqbAL+q7jB/vfgDqs=",
+      "dev": true
+    },
+    "prelude-ls": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.2.1.tgz",
+      "integrity": "sha512-vkcDPrRZo1QZLbn5RLGPpg/WmIQ65qoWWhcGKf/b5eplkkarX0m9z8ppCat4mlOqUsWpyNuYgO3VRyrYHSzX5g==",
+      "dev": true
+    },
+    "process": {
+      "version": "0.11.10",
+      "resolved": "https://registry.npmjs.org/process/-/process-0.11.10.tgz",
+      "integrity": "sha1-czIwDoQBYb2j5podHZGn1LwW8YI="
+    },
+    "process-nextick-args": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/process-nextick-args/-/process-nextick-args-2.0.1.tgz",
+      "integrity": "sha512-3ouUOpQhtgrbOa17J7+uxOTpITYWaGP7/AhoR3+A+/1e9skrzelGi/dXzEYyvbxubEF6Wn2ypscTKiKJFFn1ag=="
+    },
+    "progress": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmjs.org/progress/-/progress-2.0.3.tgz",
+      "integrity": "sha512-7PiHtLll5LdnKIMw100I+8xJXR5gW2QwWYkT6iJva0bXitZKa/XMrSbdmg3r2Xnaidz9Qumd0VPaMrZlF9V9sA==",
+      "dev": true
+    },
+    "promise-polyfill": {
+      "version": "8.2.0",
+      "resolved": "https://registry.npmjs.org/promise-polyfill/-/promise-polyfill-8.2.0.tgz",
+      "integrity": "sha512-k/TC0mIcPVF6yHhUvwAp7cvL6I2fFV7TzF1DuGPI8mBh4QQazf36xCKEHKTZKRysEoTQoQdKyP25J8MPJp7j5g=="
+    },
+    "proxy-addr": {
+      "version": "2.0.6",
+      "resolved": "https://registry.npmjs.org/proxy-addr/-/proxy-addr-2.0.6.tgz",
+      "integrity": "sha512-dh/frvCBVmSsDYzw6n926jv974gddhkFPfiN8hPOi30Wax25QZyZEGveluCgliBnqmuM+UJmBErbAUFIoDbjOw==",
+      "dev": true,
+      "requires": {
+        "forwarded": "~0.1.2",
+        "ipaddr.js": "1.9.1"
+      }
+    },
+    "prr": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/prr/-/prr-1.0.1.tgz",
+      "integrity": "sha1-0/wRS6BplaRexok/SEzrHXj19HY=",
+      "dev": true
+    },
+    "pump": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/pump/-/pump-3.0.0.tgz",
+      "integrity": "sha512-LwZy+p3SFs1Pytd/jYct4wpv49HiYCqd9Rlc5ZVdk0V+8Yzv6jR5Blk3TRmPL1ft69TxP0IMZGJ+WPFU2BFhww==",
+      "dev": true,
+      "requires": {
+        "end-of-stream": "^1.1.0",
+        "once": "^1.3.1"
+      }
+    },
+    "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
+    },
+    "qs": {
+      "version": "6.7.0",
+      "resolved": "https://registry.npmjs.org/qs/-/qs-6.7.0.tgz",
+      "integrity": "sha512-VCdBRNFTX1fyE7Nb6FYoURo/SPe62QCaAyzJvUjwRaIsc+NePBEniHlvxFmmX56+HZphIGtV0XeCirBtpDrTyQ==",
+      "dev": true
+    },
+    "querystring": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmjs.org/querystring/-/querystring-0.2.0.tgz",
+      "integrity": "sha1-sgmEkgO7Jd+CDadW50cAWHhSFiA="
+    },
+    "querystringify": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/querystringify/-/querystringify-2.2.0.tgz",
+      "integrity": "sha512-FIqgj2EUvTa7R50u0rGsyTftzjYmv/a3hO345bZNrqabNqjtgiDMgmo4mkUjd+nzU5oF3dClKqFIPUKybUyqoQ==",
+      "dev": true
+    },
+    "queue-microtask": {
+      "version": "1.2.2",
+      "resolved": "https://registry.npmjs.org/queue-microtask/-/queue-microtask-1.2.2.tgz",
+      "integrity": "sha512-dB15eXv3p2jDlbOiNLyMabYg1/sXvppd8DP2J3EOCQ0AkuSXCW2tP7mnVouVLJKgUMY6yP0kcQDVpLCN13h4Xg==",
+      "dev": true
+    },
+    "quote-stream": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/quote-stream/-/quote-stream-1.0.2.tgz",
+      "integrity": "sha1-hJY/jJwmuULhU/7rU6rnRlK34LI=",
+      "requires": {
+        "buffer-equal": "0.0.1",
+        "minimist": "^1.1.3",
+        "through2": "^2.0.0"
+      }
+    },
+    "randombytes": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/randombytes/-/randombytes-2.1.0.tgz",
+      "integrity": "sha512-vYl3iOX+4CKUWuxGi9Ukhie6fsqXqS9FE2Zaic4tNFD2N2QQaXOMFbuKK4QmDHC0JO6B1Zp41J0LpT0oR68amQ==",
+      "dev": true,
+      "requires": {
+        "safe-buffer": "^5.1.0"
+      }
+    },
+    "range-parser": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/range-parser/-/range-parser-1.2.1.tgz",
+      "integrity": "sha512-Hrgsx+orqoygnmhFbKaHE6c296J+HTAQXoxEF6gNupROmmGJRoyzfG3ccAveqCBrwr/2yxQ5BVd/GTl5agOwSg==",
+      "dev": true
+    },
+    "raw-body": {
+      "version": "2.4.0",
+      "resolved": "https://registry.npmjs.org/raw-body/-/raw-body-2.4.0.tgz",
+      "integrity": "sha512-4Oz8DUIwdvoa5qMJelxipzi/iJIi40O5cGV1wNYp5hvZP8ZN0T+jiNkL0QepXs+EsQ9XJ8ipEDoiH70ySUJP3Q==",
+      "dev": true,
+      "requires": {
+        "bytes": "3.1.0",
+        "http-errors": "1.7.2",
+        "iconv-lite": "0.4.24",
+        "unpipe": "1.0.0"
+      },
+      "dependencies": {
+        "bytes": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.0.tgz",
+          "integrity": "sha512-zauLjrfCG+xvoyaqLoV8bLVXXNGC4JqlxFCutSDWA6fJrTo2ZuvLYTqZ7aHBLZSMOopbzwv8f+wZcVzfVTI2Dg==",
+          "dev": true
+        }
+      }
+    },
+    "readable-stream": {
+      "version": "2.3.7",
+      "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-2.3.7.tgz",
+      "integrity": "sha512-Ebho8K4jIbHAxnuxi7o42OrZgF/ZTNcsZj6nRKyUmkhLFq8CHItp/fy6hQZuZmP/n3yZ9VBUbp4zz/mX8hmYPw==",
+      "requires": {
+        "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"
+      },
+      "dependencies": {
         "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
-        },
-        "safe-regex": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/safe-regex/-/safe-regex-1.1.0.tgz",
-            "integrity": "sha1-QKNmnzsHfR6UPURinhV91IAjvy4=",
-            "dev": true,
-            "requires": {
-                "ret": "~0.1.10"
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
+          "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g=="
+        }
+      }
+    },
+    "readdirp": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmjs.org/readdirp/-/readdirp-2.2.1.tgz",
+      "integrity": "sha512-1JU/8q+VgFZyxwrJ+SVIOsh+KywWGpds3NTqikiKpDMZWScmAYyKIgqkO+ARvNWJfXeXR1zxz7aHF4u4CyH6vQ==",
+      "dev": true,
+      "requires": {
+        "graceful-fs": "^4.1.11",
+        "micromatch": "^3.1.10",
+        "readable-stream": "^2.0.2"
+      },
+      "dependencies": {
+        "braces": {
+          "version": "2.3.2",
+          "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
+          "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
+          "dev": true,
+          "requires": {
+            "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"
+          },
+          "dependencies": {
+            "extend-shallow": {
+              "version": "2.0.1",
+              "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+              "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+              "dev": true,
+              "requires": {
+                "is-extendable": "^0.1.0"
+              }
             }
+          }
         },
-        "safer-buffer": {
-            "version": "2.1.2",
-            "resolved": "https://registry.npmjs.org/safer-buffer/-/safer-buffer-2.1.2.tgz",
-            "integrity": "sha512-YZo3K82SD7Riyi0E1EQPojLz7kpepnSQI9IyPbHHg1XXXevb5dJI7tpyN2ADxGcQbHG7vcyRHk0cbwqcQriUtg==",
-            "dev": true
-        },
-        "schema-utils": {
-            "version": "2.7.1",
-            "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-2.7.1.tgz",
-            "integrity": "sha512-SHiNtMOUGWBQJwzISiVYKu82GiV4QYGePp3odlY1tuKO7gPtphAT5R/py0fA6xtbgLL/RvtJZnU9b8s0F1q0Xg==",
-            "dev": true,
-            "requires": {
-                "@types/json-schema": "^7.0.5",
-                "ajv": "^6.12.4",
-                "ajv-keywords": "^3.5.2"
+        "fill-range": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
+          "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
+          "dev": true,
+          "requires": {
+            "extend-shallow": "^2.0.1",
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1",
+            "to-regex-range": "^2.1.0"
+          },
+          "dependencies": {
+            "extend-shallow": {
+              "version": "2.0.1",
+              "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+              "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+              "dev": true,
+              "requires": {
+                "is-extendable": "^0.1.0"
+              }
             }
+          }
         },
-        "seedrandom": {
-            "version": "3.0.5",
-            "resolved": "https://registry.npmjs.org/seedrandom/-/seedrandom-3.0.5.tgz",
-            "integrity": "sha512-8OwmbklUNzwezjGInmZ+2clQmExQPvomqjL7LFqOYqtmuxRgQYqOD3mHaU+MvZn5FLUeVxVfQjwLZW/n/JFuqg=="
-        },
-        "select-hose": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/select-hose/-/select-hose-2.0.0.tgz",
-            "integrity": "sha1-Yl2GWPhlr0Psliv8N2o3NZpJlMo=",
-            "dev": true
-        },
-        "selfsigned": {
-            "version": "1.10.8",
-            "resolved": "https://registry.npmjs.org/selfsigned/-/selfsigned-1.10.8.tgz",
-            "integrity": "sha512-2P4PtieJeEwVgTU9QEcwIRDQ/mXJLX8/+I3ur+Pg16nS8oNbrGxEso9NyYWy8NAmXiNl4dlAp5MwoNeCWzON4w==",
-            "dev": true,
-            "requires": {
-                "node-forge": "^0.10.0"
+        "is-number": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
+          "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
+          "dev": true,
+          "requires": {
+            "kind-of": "^3.0.2"
+          },
+          "dependencies": {
+            "kind-of": {
+              "version": "3.2.2",
+              "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+              "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+              "dev": true,
+              "requires": {
+                "is-buffer": "^1.1.5"
+              }
             }
+          }
         },
-        "semver": {
-            "version": "7.3.4",
-            "resolved": "https://registry.npmjs.org/semver/-/semver-7.3.4.tgz",
-            "integrity": "sha512-tCfb2WLjqFAtXn4KEdxIhalnRtoKFN7nAwj0B3ZXCbQloV2tq5eDbcTmT68JJD3nRJq24/XgxtQKFIpQdtvmVw==",
-            "dev": true,
-            "requires": {
-                "lru-cache": "^6.0.0"
-            }
+        "micromatch": {
+          "version": "3.1.10",
+          "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-3.1.10.tgz",
+          "integrity": "sha512-MWikgl9n9M3w+bpsY3He8L+w9eF9338xRl8IAO5viDizwSzziFEyUzo2xrrloB64ADbTf8uA8vRqqttDTOmccg==",
+          "dev": true,
+          "requires": {
+            "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"
+          }
         },
-        "send": {
-            "version": "0.17.1",
-            "resolved": "https://registry.npmjs.org/send/-/send-0.17.1.tgz",
-            "integrity": "sha512-BsVKsiGcQMFwT8UxypobUKyv7irCNRHk1T0G680vk88yf6LBByGcZJOTJCrTP2xVN6yI+XjPJcNuE3V4fT9sAg==",
-            "dev": true,
-            "requires": {
-                "debug": "2.6.9",
-                "depd": "~1.1.2",
-                "destroy": "~1.0.4",
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "etag": "~1.8.1",
-                "fresh": "0.5.2",
-                "http-errors": "~1.7.2",
-                "mime": "1.6.0",
-                "ms": "2.1.1",
-                "on-finished": "~2.3.0",
-                "range-parser": "~1.2.1",
-                "statuses": "~1.5.0"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    },
-                    "dependencies": {
-                        "ms": {
-                            "version": "2.0.0",
-                            "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                            "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                            "dev": true
-                        }
-                    }
-                },
-                "ms": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.1.tgz",
-                    "integrity": "sha512-tgp+dl5cGk28utYktBsrFqA7HKgrhgPsg6Z/EfhWI4gl1Hwq8B/GmY/0oXZ6nF8hDVesS/FpnYaD/kOWhYQvyg==",
-                    "dev": true
-                }
-            }
+        "to-regex-range": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
+          "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
+          "dev": true,
+          "requires": {
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1"
+          }
+        }
+      }
+    },
+    "rechoir": {
+      "version": "0.7.0",
+      "resolved": "https://registry.npmjs.org/rechoir/-/rechoir-0.7.0.tgz",
+      "integrity": "sha512-ADsDEH2bvbjltXEP+hTIAmeFekTFK0V2BTxMkok6qILyAJEXV0AFfoWcAq4yfll5VdIMd/RVXq0lR+wQi5ZU3Q==",
+      "dev": true,
+      "requires": {
+        "resolve": "^1.9.0"
+      }
+    },
+    "regenerate": {
+      "version": "1.4.2",
+      "resolved": "https://registry.npmjs.org/regenerate/-/regenerate-1.4.2.tgz",
+      "integrity": "sha512-zrceR/XhGYU/d/opr2EKO7aRHUeiBI8qjtfHqADTwZd6Szfy16la6kqD0MIUs5z5hx6AaKa+PixpPrR289+I0A==",
+      "dev": true
+    },
+    "regenerate-unicode-properties": {
+      "version": "8.2.0",
+      "resolved": "https://registry.npmjs.org/regenerate-unicode-properties/-/regenerate-unicode-properties-8.2.0.tgz",
+      "integrity": "sha512-F9DjY1vKLo/tPePDycuH3dn9H1OTPIkVD9Kz4LODu+F2C75mgjAJ7x/gwy6ZcSNRAAkhNlJSOHRe8k3p+K9WhA==",
+      "dev": true,
+      "requires": {
+        "regenerate": "^1.4.0"
+      }
+    },
+    "regenerator-runtime": {
+      "version": "0.13.7",
+      "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.13.7.tgz",
+      "integrity": "sha512-a54FxoJDIr27pgf7IgeQGxmqUNYrcV338lf/6gH456HZ/PhX+5BcwHXG9ajESmwe6WRO0tAzRUrRmNONWgkrew=="
+    },
+    "regenerator-transform": {
+      "version": "0.14.5",
+      "resolved": "https://registry.npmjs.org/regenerator-transform/-/regenerator-transform-0.14.5.tgz",
+      "integrity": "sha512-eOf6vka5IO151Jfsw2NO9WpGX58W6wWmefK3I1zEGr0lOD0u8rwPaNqQL1aRxUaxLeKO3ArNh3VYg1KbaD+FFw==",
+      "dev": true,
+      "requires": {
+        "@babel/runtime": "^7.8.4"
+      }
+    },
+    "regex-not": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/regex-not/-/regex-not-1.0.2.tgz",
+      "integrity": "sha512-J6SDjUgDxQj5NusnOtdFxDwN/+HWykR8GELwctJ7mdqhcyy1xEc4SRFHUXvxTp661YaVKAjfRLZ9cCqS6tn32A==",
+      "dev": true,
+      "requires": {
+        "extend-shallow": "^3.0.2",
+        "safe-regex": "^1.1.0"
+      }
+    },
+    "regexp.prototype.flags": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmjs.org/regexp.prototype.flags/-/regexp.prototype.flags-1.3.1.tgz",
+      "integrity": "sha512-JiBdRBq91WlY7uRJ0ds7R+dU02i6LKi8r3BuQhNXn+kmeLN+EfHhfjqMRis1zJxnlu88hq/4dx0P2OP3APRTOA==",
+      "requires": {
+        "call-bind": "^1.0.2",
+        "define-properties": "^1.1.3"
+      }
+    },
+    "regexpp": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/regexpp/-/regexpp-3.1.0.tgz",
+      "integrity": "sha512-ZOIzd8yVsQQA7j8GCSlPGXwg5PfmA1mrq0JP4nGhh54LaKN3xdai/vHUDu74pKwV8OxseMS65u2NImosQcSD0Q==",
+      "dev": true
+    },
+    "regexpu-core": {
+      "version": "4.7.1",
+      "resolved": "https://registry.npmjs.org/regexpu-core/-/regexpu-core-4.7.1.tgz",
+      "integrity": "sha512-ywH2VUraA44DZQuRKzARmw6S66mr48pQVva4LBeRhcOltJ6hExvWly5ZjFLYo67xbIxb6W1q4bAGtgfEl20zfQ==",
+      "dev": true,
+      "requires": {
+        "regenerate": "^1.4.0",
+        "regenerate-unicode-properties": "^8.2.0",
+        "regjsgen": "^0.5.1",
+        "regjsparser": "^0.6.4",
+        "unicode-match-property-ecmascript": "^1.0.4",
+        "unicode-match-property-value-ecmascript": "^1.2.0"
+      }
+    },
+    "regjsgen": {
+      "version": "0.5.2",
+      "resolved": "https://registry.npmjs.org/regjsgen/-/regjsgen-0.5.2.tgz",
+      "integrity": "sha512-OFFT3MfrH90xIW8OOSyUrk6QHD5E9JOTeGodiJeBS3J6IwlgzJMNE/1bZklWz5oTg+9dCMyEetclvCVXOPoN3A==",
+      "dev": true
+    },
+    "regjsparser": {
+      "version": "0.6.7",
+      "resolved": "https://registry.npmjs.org/regjsparser/-/regjsparser-0.6.7.tgz",
+      "integrity": "sha512-ib77G0uxsA2ovgiYbCVGx4Pv3PSttAx2vIwidqQzbL2U5S4Q+j00HdSAneSBuyVcMvEnTXMjiGgB+DlXozVhpQ==",
+      "dev": true,
+      "requires": {
+        "jsesc": "~0.5.0"
+      },
+      "dependencies": {
+        "jsesc": {
+          "version": "0.5.0",
+          "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-0.5.0.tgz",
+          "integrity": "sha1-597mbjXW/Bb3EP6R1c9p9w8IkR0=",
+          "dev": true
+        }
+      }
+    },
+    "remove-trailing-separator": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/remove-trailing-separator/-/remove-trailing-separator-1.1.0.tgz",
+      "integrity": "sha1-wkvOKig62tW8P1jg1IJJuSN52O8=",
+      "dev": true
+    },
+    "repeat-element": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmjs.org/repeat-element/-/repeat-element-1.1.3.tgz",
+      "integrity": "sha512-ahGq0ZnV5m5XtZLMb+vP76kcAM5nkLqk0lpqAuojSKGgQtn4eRi4ZZGm2olo2zKFH+sMsWaqOCW1dqAnOru72g==",
+      "dev": true
+    },
+    "repeat-string": {
+      "version": "1.6.1",
+      "resolved": "https://registry.npmjs.org/repeat-string/-/repeat-string-1.6.1.tgz",
+      "integrity": "sha1-jcrkcOHIirwtYA//Sndihtp15jc=",
+      "dev": true
+    },
+    "require-directory": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/require-directory/-/require-directory-2.1.1.tgz",
+      "integrity": "sha1-jGStX9MNqxyXbiNE/+f3kqam30I=",
+      "dev": true
+    },
+    "require-from-string": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/require-from-string/-/require-from-string-2.0.2.tgz",
+      "integrity": "sha512-Xf0nWe6RseziFMu+Ap9biiUbmplq6S9/p+7w7YXP/JBHhrUDDUhwa+vANyubuqfZWTveU//DYVGsDG7RKL/vEw==",
+      "dev": true
+    },
+    "require-main-filename": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/require-main-filename/-/require-main-filename-2.0.0.tgz",
+      "integrity": "sha512-NKN5kMDylKuldxYLSUfrbo5Tuzh4hd+2E8NPPX02mZtn1VuREQToYe/ZdlJy+J3uCpfaiGF05e7B8W0iXbQHmg==",
+      "dev": true
+    },
+    "requires-port": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/requires-port/-/requires-port-1.0.0.tgz",
+      "integrity": "sha1-kl0mAdOaxIXgkc8NpcbmlNw9yv8=",
+      "dev": true
+    },
+    "resolve": {
+      "version": "1.19.0",
+      "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.19.0.tgz",
+      "integrity": "sha512-rArEXAgsBG4UgRGcynxWIWKFvh/XZCcS8UJdHhwy91zwAvCZIbcs+vAbflgBnNjYMs/i/i+/Ux6IZhML1yPvxg==",
+      "requires": {
+        "is-core-module": "^2.1.0",
+        "path-parse": "^1.0.6"
+      }
+    },
+    "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,
+      "requires": {
+        "resolve-from": "^5.0.0"
+      }
+    },
+    "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
+    },
+    "resolve-url": {
+      "version": "0.2.1",
+      "resolved": "https://registry.npmjs.org/resolve-url/-/resolve-url-0.2.1.tgz",
+      "integrity": "sha1-LGN/53yJOv0qZj/iGqkIAGjiBSo=",
+      "dev": true
+    },
+    "resource-loader": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/resource-loader/-/resource-loader-3.0.1.tgz",
+      "integrity": "sha512-fBuCRbEHdLCI1eglzQhUv9Rrdcmqkydr1r6uHE2cYHvRBrcLXeSmbE/qI/urFt8rPr/IGxir3BUwM5kUK8XoyA==",
+      "requires": {
+        "mini-signals": "^1.2.0",
+        "parse-uri": "^1.0.0"
+      }
+    },
+    "restructure": {
+      "version": "0.5.4",
+      "resolved": "https://registry.npmjs.org/restructure/-/restructure-0.5.4.tgz",
+      "integrity": "sha1-9U591WNZD7NP1r9Vh2EJrsyyjeg=",
+      "requires": {
+        "browserify-optional": "^1.0.0"
+      }
+    },
+    "ret": {
+      "version": "0.1.15",
+      "resolved": "https://registry.npmjs.org/ret/-/ret-0.1.15.tgz",
+      "integrity": "sha512-TTlYpa+OL+vMMNG24xSlQGEJ3B/RzEfUlLct7b5G/ytav+wPrplCpVMFuwzXbkecJrb6IYo1iFb0S9v37754mg==",
+      "dev": true
+    },
+    "retry": {
+      "version": "0.12.0",
+      "resolved": "https://registry.npmjs.org/retry/-/retry-0.12.0.tgz",
+      "integrity": "sha1-G0KmJmoh8HQh0bC1S33BZ7AcATs=",
+      "dev": true
+    },
+    "reusify": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/reusify/-/reusify-1.0.4.tgz",
+      "integrity": "sha512-U9nH88a3fc/ekCF1l0/UP1IosiuIjyTh7hBvXVMHYgVcfGvt897Xguj2UOLDeI5BG2m7/uwyaLVT6fbtCwTyzw==",
+      "dev": true
+    },
+    "rimraf": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/rimraf/-/rimraf-3.0.2.tgz",
+      "integrity": "sha512-JZkJMZkAGFFPP2YqXZXPbMlMBgsxzE8ILs4lMIX/2o0L9UBw9O/Y3o6wFw/i9YLapcUJWwqbi3kdxIPdC62TIA==",
+      "dev": true,
+      "requires": {
+        "glob": "^7.1.3"
+      }
+    },
+    "run-parallel": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/run-parallel/-/run-parallel-1.2.0.tgz",
+      "integrity": "sha512-5l4VyZR86LZ/lDxZTR6jqL8AFE2S0IFLMP26AbjsLVADxHdhB/c0GUsH+y39UfCi3dzz8OlQuPmnaJOMoDHQBA==",
+      "dev": true,
+      "requires": {
+        "queue-microtask": "^1.2.2"
+      }
+    },
+    "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=="
+    },
+    "safe-regex": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/safe-regex/-/safe-regex-1.1.0.tgz",
+      "integrity": "sha1-QKNmnzsHfR6UPURinhV91IAjvy4=",
+      "dev": true,
+      "requires": {
+        "ret": "~0.1.10"
+      }
+    },
+    "safer-buffer": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/safer-buffer/-/safer-buffer-2.1.2.tgz",
+      "integrity": "sha512-YZo3K82SD7Riyi0E1EQPojLz7kpepnSQI9IyPbHHg1XXXevb5dJI7tpyN2ADxGcQbHG7vcyRHk0cbwqcQriUtg==",
+      "dev": true
+    },
+    "schema-utils": {
+      "version": "2.7.1",
+      "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-2.7.1.tgz",
+      "integrity": "sha512-SHiNtMOUGWBQJwzISiVYKu82GiV4QYGePp3odlY1tuKO7gPtphAT5R/py0fA6xtbgLL/RvtJZnU9b8s0F1q0Xg==",
+      "dev": true,
+      "requires": {
+        "@types/json-schema": "^7.0.5",
+        "ajv": "^6.12.4",
+        "ajv-keywords": "^3.5.2"
+      }
+    },
+    "scope-analyzer": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/scope-analyzer/-/scope-analyzer-2.1.1.tgz",
+      "integrity": "sha512-azEAihtQ9mEyZGhfgTJy3IbOWEzeOrYbg7NcYEshPKnKd+LZmC3TNd5dmDxbLBsTG/JVWmCp+vDJ03vJjeXMHg==",
+      "requires": {
+        "array-from": "^2.1.1",
+        "dash-ast": "^1.0.0",
+        "es6-map": "^0.1.5",
+        "es6-set": "^0.1.5",
+        "es6-symbol": "^3.1.1",
+        "estree-is-function": "^1.0.0",
+        "get-assigned-identifiers": "^1.1.0"
+      }
+    },
+    "seedrandom": {
+      "version": "3.0.5",
+      "resolved": "https://registry.npmjs.org/seedrandom/-/seedrandom-3.0.5.tgz",
+      "integrity": "sha512-8OwmbklUNzwezjGInmZ+2clQmExQPvomqjL7LFqOYqtmuxRgQYqOD3mHaU+MvZn5FLUeVxVfQjwLZW/n/JFuqg=="
+    },
+    "select-hose": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/select-hose/-/select-hose-2.0.0.tgz",
+      "integrity": "sha1-Yl2GWPhlr0Psliv8N2o3NZpJlMo=",
+      "dev": true
+    },
+    "selfsigned": {
+      "version": "1.10.8",
+      "resolved": "https://registry.npmjs.org/selfsigned/-/selfsigned-1.10.8.tgz",
+      "integrity": "sha512-2P4PtieJeEwVgTU9QEcwIRDQ/mXJLX8/+I3ur+Pg16nS8oNbrGxEso9NyYWy8NAmXiNl4dlAp5MwoNeCWzON4w==",
+      "dev": true,
+      "requires": {
+        "node-forge": "^0.10.0"
+      }
+    },
+    "semver": {
+      "version": "7.3.4",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-7.3.4.tgz",
+      "integrity": "sha512-tCfb2WLjqFAtXn4KEdxIhalnRtoKFN7nAwj0B3ZXCbQloV2tq5eDbcTmT68JJD3nRJq24/XgxtQKFIpQdtvmVw==",
+      "dev": true,
+      "requires": {
+        "lru-cache": "^6.0.0"
+      }
+    },
+    "send": {
+      "version": "0.17.1",
+      "resolved": "https://registry.npmjs.org/send/-/send-0.17.1.tgz",
+      "integrity": "sha512-BsVKsiGcQMFwT8UxypobUKyv7irCNRHk1T0G680vk88yf6LBByGcZJOTJCrTP2xVN6yI+XjPJcNuE3V4fT9sAg==",
+      "dev": true,
+      "requires": {
+        "debug": "2.6.9",
+        "depd": "~1.1.2",
+        "destroy": "~1.0.4",
+        "encodeurl": "~1.0.2",
+        "escape-html": "~1.0.3",
+        "etag": "~1.8.1",
+        "fresh": "0.5.2",
+        "http-errors": "~1.7.2",
+        "mime": "1.6.0",
+        "ms": "2.1.1",
+        "on-finished": "~2.3.0",
+        "range-parser": "~1.2.1",
+        "statuses": "~1.5.0"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          },
+          "dependencies": {
+            "ms": {
+              "version": "2.0.0",
+              "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+              "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+              "dev": true
+            }
+          }
         },
-        "serialize-javascript": {
-            "version": "5.0.1",
-            "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-5.0.1.tgz",
-            "integrity": "sha512-SaaNal9imEO737H2c05Og0/8LUXG7EnsZyMa8MzkmuHoELfT6txuj0cMqRj6zfPKnmQ1yasR4PCJc8x+M4JSPA==",
-            "dev": true,
-            "requires": {
-                "randombytes": "^2.1.0"
-            }
+        "ms": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.1.tgz",
+          "integrity": "sha512-tgp+dl5cGk28utYktBsrFqA7HKgrhgPsg6Z/EfhWI4gl1Hwq8B/GmY/0oXZ6nF8hDVesS/FpnYaD/kOWhYQvyg==",
+          "dev": true
+        }
+      }
+    },
+    "serialize-javascript": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-5.0.1.tgz",
+      "integrity": "sha512-SaaNal9imEO737H2c05Og0/8LUXG7EnsZyMa8MzkmuHoELfT6txuj0cMqRj6zfPKnmQ1yasR4PCJc8x+M4JSPA==",
+      "dev": true,
+      "requires": {
+        "randombytes": "^2.1.0"
+      }
+    },
+    "serve-index": {
+      "version": "1.9.1",
+      "resolved": "https://registry.npmjs.org/serve-index/-/serve-index-1.9.1.tgz",
+      "integrity": "sha1-03aNabHn2C5c4FD/9bRTvqEqkjk=",
+      "dev": true,
+      "requires": {
+        "accepts": "~1.3.4",
+        "batch": "0.6.1",
+        "debug": "2.6.9",
+        "escape-html": "~1.0.3",
+        "http-errors": "~1.6.2",
+        "mime-types": "~2.1.17",
+        "parseurl": "~1.3.2"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "serve-index": {
-            "version": "1.9.1",
-            "resolved": "https://registry.npmjs.org/serve-index/-/serve-index-1.9.1.tgz",
-            "integrity": "sha1-03aNabHn2C5c4FD/9bRTvqEqkjk=",
-            "dev": true,
-            "requires": {
-                "accepts": "~1.3.4",
-                "batch": "0.6.1",
-                "debug": "2.6.9",
-                "escape-html": "~1.0.3",
-                "http-errors": "~1.6.2",
-                "mime-types": "~2.1.17",
-                "parseurl": "~1.3.2"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    }
-                },
-                "http-errors": {
-                    "version": "1.6.3",
-                    "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.6.3.tgz",
-                    "integrity": "sha1-i1VoC7S+KDoLW/TqLjhYC+HZMg0=",
-                    "dev": true,
-                    "requires": {
-                        "depd": "~1.1.2",
-                        "inherits": "2.0.3",
-                        "setprototypeof": "1.1.0",
-                        "statuses": ">= 1.4.0 < 2"
-                    }
-                },
-                "inherits": {
-                    "version": "2.0.3",
-                    "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
-                    "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=",
-                    "dev": true
-                },
-                "ms": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                    "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                    "dev": true
-                },
-                "setprototypeof": {
-                    "version": "1.1.0",
-                    "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.0.tgz",
-                    "integrity": "sha512-BvE/TwpZX4FXExxOxZyRGQQv651MSwmWKZGqvmPcRIjDqWub67kTKuIMx43cZZrS/cBBzwBcNDWoFxt2XEFIpQ==",
-                    "dev": true
-                }
-            }
+        "http-errors": {
+          "version": "1.6.3",
+          "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.6.3.tgz",
+          "integrity": "sha1-i1VoC7S+KDoLW/TqLjhYC+HZMg0=",
+          "dev": true,
+          "requires": {
+            "depd": "~1.1.2",
+            "inherits": "2.0.3",
+            "setprototypeof": "1.1.0",
+            "statuses": ">= 1.4.0 < 2"
+          }
         },
-        "serve-static": {
-            "version": "1.14.1",
-            "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.14.1.tgz",
-            "integrity": "sha512-JMrvUwE54emCYWlTI+hGrGv5I8dEwmco/00EvkzIIsR7MqrHonbD9pO2MOfFnpFntl7ecpZs+3mW+XbQZu9QCg==",
-            "dev": true,
-            "requires": {
-                "encodeurl": "~1.0.2",
-                "escape-html": "~1.0.3",
-                "parseurl": "~1.3.3",
-                "send": "0.17.1"
-            }
+        "inherits": {
+          "version": "2.0.3",
+          "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
+          "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=",
+          "dev": true
         },
-        "set-blocking": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/set-blocking/-/set-blocking-2.0.0.tgz",
-            "integrity": "sha1-BF+XgtARrppoA93TgrJDkrPYkPc=",
-            "dev": true
-        },
-        "set-value": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/set-value/-/set-value-2.0.1.tgz",
-            "integrity": "sha512-JxHc1weCN68wRY0fhCoXpyK55m/XPHafOmK4UWD7m2CI14GMcFypt4w/0+NV5f/ZMby2F6S2wwA7fgynh9gWSw==",
-            "dev": true,
-            "requires": {
-                "extend-shallow": "^2.0.1",
-                "is-extendable": "^0.1.1",
-                "is-plain-object": "^2.0.3",
-                "split-string": "^3.0.1"
-            },
-            "dependencies": {
-                "extend-shallow": {
-                    "version": "2.0.1",
-                    "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                    "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                    "dev": true,
-                    "requires": {
-                        "is-extendable": "^0.1.0"
-                    }
-                }
-            }
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
         },
         "setprototypeof": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.1.tgz",
-            "integrity": "sha512-JvdAWfbXeIGaZ9cILp38HntZSFSo3mWg6xGcJJsd+d4aRMOqauag1C63dJfDw7OaMYwEbHMOxEZ1lqVRYP2OAw==",
-            "dev": true
-        },
-        "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,
-            "requires": {
-                "kind-of": "^6.0.2"
-            }
-        },
-        "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,
-            "requires": {
-                "shebang-regex": "^3.0.0"
-            }
-        },
-        "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
-        },
-        "signal-exit": {
-            "version": "3.0.3",
-            "resolved": "https://registry.npmjs.org/signal-exit/-/signal-exit-3.0.3.tgz",
-            "integrity": "sha512-VUJ49FC8U1OxwZLxIbTTrDvLnf/6TDgxZcK8wxR8zs13xpx7xbG60ndBlhNrFi2EMuFRoeDoJO7wthSLq42EjA==",
-            "dev": true
-        },
-        "slash": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/slash/-/slash-3.0.0.tgz",
-            "integrity": "sha512-g9Q1haeby36OSStwb4ntCGGGaKsaVSjQ68fBxoQcutl5fS1vuY18H3wSt3jFyFtrkx+Kz0V1G85A4MyAdDMi2Q==",
-            "dev": true
-        },
-        "slice-ansi": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/slice-ansi/-/slice-ansi-4.0.0.tgz",
-            "integrity": "sha512-qMCMfhY040cVHT43K9BFygqYbUPFZKHOg7K73mtTWJRb8pyP3fzf4Ixd5SzdEJQ6MRUg/WBnOLxghZtKKurENQ==",
-            "dev": true,
-            "requires": {
-                "ansi-styles": "^4.0.0",
-                "astral-regex": "^2.0.0",
-                "is-fullwidth-code-point": "^3.0.0"
-            }
-        },
-        "snapdragon": {
-            "version": "0.8.2",
-            "resolved": "https://registry.npmjs.org/snapdragon/-/snapdragon-0.8.2.tgz",
-            "integrity": "sha512-FtyOnWN/wCHTVXOMwvSv26d+ko5vWlIDD6zoUJ7LW8vh+ZBC8QdljveRP+crNrtBwioEUWy/4dMtbBjA4ioNlg==",
-            "dev": true,
-            "requires": {
-                "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"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "2.6.9",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
-                    "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "2.0.0"
-                    }
-                },
-                "define-property": {
-                    "version": "0.2.5",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-                    "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^0.1.0"
-                    }
-                },
-                "extend-shallow": {
-                    "version": "2.0.1",
-                    "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                    "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                    "dev": true,
-                    "requires": {
-                        "is-extendable": "^0.1.0"
-                    }
-                },
-                "ms": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
-                    "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
-                    "dev": true
-                },
-                "source-map": {
-                    "version": "0.5.7",
-                    "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
-                    "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
-                    "dev": true
-                }
-            }
-        },
-        "snapdragon-node": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/snapdragon-node/-/snapdragon-node-2.1.1.tgz",
-            "integrity": "sha512-O27l4xaMYt/RSQ5TR3vpWCAB5Kb/czIcqUFOM/C4fYcLnbZUc1PkjTAMjof2pBWaSTwOUd6qUHcFGVGj7aIwnw==",
-            "dev": true,
-            "requires": {
-                "define-property": "^1.0.0",
-                "isobject": "^3.0.0",
-                "snapdragon-util": "^3.0.1"
-            },
-            "dependencies": {
-                "define-property": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
-                    "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^1.0.0"
-                    }
-                },
-                "is-accessor-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-data-descriptor": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
-                    "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^6.0.0"
-                    }
-                },
-                "is-descriptor": {
-                    "version": "1.0.2",
-                    "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
-                    "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
-                    "dev": true,
-                    "requires": {
-                        "is-accessor-descriptor": "^1.0.0",
-                        "is-data-descriptor": "^1.0.0",
-                        "kind-of": "^6.0.2"
-                    }
-                }
-            }
-        },
-        "snapdragon-util": {
-            "version": "3.0.1",
-            "resolved": "https://registry.npmjs.org/snapdragon-util/-/snapdragon-util-3.0.1.tgz",
-            "integrity": "sha512-mbKkMdQKsjX4BAL4bRYTj21edOf8cN7XHdYUJEe+Zn99hVEYcMvKPct1IqNe7+AZPirn8BCDOQBHQZknqmKlZQ==",
-            "dev": true,
-            "requires": {
-                "kind-of": "^3.2.0"
-            },
-            "dependencies": {
-                "kind-of": {
-                    "version": "3.2.2",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                    "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                    "dev": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                }
-            }
+          "version": "1.1.0",
+          "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.0.tgz",
+          "integrity": "sha512-BvE/TwpZX4FXExxOxZyRGQQv651MSwmWKZGqvmPcRIjDqWub67kTKuIMx43cZZrS/cBBzwBcNDWoFxt2XEFIpQ==",
+          "dev": true
+        }
+      }
+    },
+    "serve-static": {
+      "version": "1.14.1",
+      "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.14.1.tgz",
+      "integrity": "sha512-JMrvUwE54emCYWlTI+hGrGv5I8dEwmco/00EvkzIIsR7MqrHonbD9pO2MOfFnpFntl7ecpZs+3mW+XbQZu9QCg==",
+      "dev": true,
+      "requires": {
+        "encodeurl": "~1.0.2",
+        "escape-html": "~1.0.3",
+        "parseurl": "~1.3.3",
+        "send": "0.17.1"
+      }
+    },
+    "set-blocking": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/set-blocking/-/set-blocking-2.0.0.tgz",
+      "integrity": "sha1-BF+XgtARrppoA93TgrJDkrPYkPc=",
+      "dev": true
+    },
+    "set-value": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/set-value/-/set-value-2.0.1.tgz",
+      "integrity": "sha512-JxHc1weCN68wRY0fhCoXpyK55m/XPHafOmK4UWD7m2CI14GMcFypt4w/0+NV5f/ZMby2F6S2wwA7fgynh9gWSw==",
+      "dev": true,
+      "requires": {
+        "extend-shallow": "^2.0.1",
+        "is-extendable": "^0.1.1",
+        "is-plain-object": "^2.0.3",
+        "split-string": "^3.0.1"
+      },
+      "dependencies": {
+        "extend-shallow": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+          "dev": true,
+          "requires": {
+            "is-extendable": "^0.1.0"
+          }
+        }
+      }
+    },
+    "setprototypeof": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.1.tgz",
+      "integrity": "sha512-JvdAWfbXeIGaZ9cILp38HntZSFSo3mWg6xGcJJsd+d4aRMOqauag1C63dJfDw7OaMYwEbHMOxEZ1lqVRYP2OAw==",
+      "dev": true
+    },
+    "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,
+      "requires": {
+        "kind-of": "^6.0.2"
+      }
+    },
+    "shallow-copy": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmjs.org/shallow-copy/-/shallow-copy-0.0.1.tgz",
+      "integrity": "sha1-QV9CcC1z2BAzApLMXuhurhoRoXA="
+    },
+    "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,
+      "requires": {
+        "shebang-regex": "^3.0.0"
+      }
+    },
+    "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
+    },
+    "side-channel": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/side-channel/-/side-channel-1.0.4.tgz",
+      "integrity": "sha512-q5XPytqFEIKHkGdiMIrY10mvLRvnQh42/+GoBlFW3b2LXLE2xxJpZFdm94we0BaoV3RwJyGqg5wS7epxTv0Zvw==",
+      "requires": {
+        "call-bind": "^1.0.0",
+        "get-intrinsic": "^1.0.2",
+        "object-inspect": "^1.9.0"
+      }
+    },
+    "signal-exit": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/signal-exit/-/signal-exit-3.0.3.tgz",
+      "integrity": "sha512-VUJ49FC8U1OxwZLxIbTTrDvLnf/6TDgxZcK8wxR8zs13xpx7xbG60ndBlhNrFi2EMuFRoeDoJO7wthSLq42EjA==",
+      "dev": true
+    },
+    "slash": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/slash/-/slash-3.0.0.tgz",
+      "integrity": "sha512-g9Q1haeby36OSStwb4ntCGGGaKsaVSjQ68fBxoQcutl5fS1vuY18H3wSt3jFyFtrkx+Kz0V1G85A4MyAdDMi2Q==",
+      "dev": true
+    },
+    "slice-ansi": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/slice-ansi/-/slice-ansi-4.0.0.tgz",
+      "integrity": "sha512-qMCMfhY040cVHT43K9BFygqYbUPFZKHOg7K73mtTWJRb8pyP3fzf4Ixd5SzdEJQ6MRUg/WBnOLxghZtKKurENQ==",
+      "dev": true,
+      "requires": {
+        "ansi-styles": "^4.0.0",
+        "astral-regex": "^2.0.0",
+        "is-fullwidth-code-point": "^3.0.0"
+      }
+    },
+    "snapdragon": {
+      "version": "0.8.2",
+      "resolved": "https://registry.npmjs.org/snapdragon/-/snapdragon-0.8.2.tgz",
+      "integrity": "sha512-FtyOnWN/wCHTVXOMwvSv26d+ko5vWlIDD6zoUJ7LW8vh+ZBC8QdljveRP+crNrtBwioEUWy/4dMtbBjA4ioNlg==",
+      "dev": true,
+      "requires": {
+        "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"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
         },
-        "sockjs": {
-            "version": "0.3.21",
-            "resolved": "https://registry.npmjs.org/sockjs/-/sockjs-0.3.21.tgz",
-            "integrity": "sha512-DhbPFGpxjc6Z3I+uX07Id5ZO2XwYsWOrYjaSeieES78cq+JaJvVe5q/m1uvjIQhXinhIeCFRH6JgXe+mvVMyXw==",
-            "dev": true,
-            "requires": {
-                "faye-websocket": "^0.11.3",
-                "uuid": "^3.4.0",
-                "websocket-driver": "^0.7.4"
-            }
+        "define-property": {
+          "version": "0.2.5",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
+          "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^0.1.0"
+          }
         },
-        "sockjs-client": {
-            "version": "1.5.0",
-            "resolved": "https://registry.npmjs.org/sockjs-client/-/sockjs-client-1.5.0.tgz",
-            "integrity": "sha512-8Dt3BDi4FYNrCFGTL/HtwVzkARrENdwOUf1ZoW/9p3M8lZdFT35jVdrHza+qgxuG9H3/shR4cuX/X9umUrjP8Q==",
-            "dev": true,
-            "requires": {
-                "debug": "^3.2.6",
-                "eventsource": "^1.0.7",
-                "faye-websocket": "^0.11.3",
-                "inherits": "^2.0.4",
-                "json3": "^3.3.3",
-                "url-parse": "^1.4.7"
-            },
-            "dependencies": {
-                "debug": {
-                    "version": "3.2.7",
-                    "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.7.tgz",
-                    "integrity": "sha512-CFjzYYAi4ThfiQvizrFQevTTXHtnCqWfe7x1AhgEscTz6ZbLbfoLRLPugTQyBth6f8ZERVUSyWHFD/7Wu4t1XQ==",
-                    "dev": true,
-                    "requires": {
-                        "ms": "^2.1.1"
-                    }
-                }
-            }
+        "extend-shallow": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+          "dev": true,
+          "requires": {
+            "is-extendable": "^0.1.0"
+          }
         },
-        "source-list-map": {
-            "version": "2.0.1",
-            "resolved": "https://registry.npmjs.org/source-list-map/-/source-list-map-2.0.1.tgz",
-            "integrity": "sha512-qnQ7gVMxGNxsiL4lEuJwe/To8UnK7fAnmbGEEH8RpLouuKbeEm0lhbQVFIrNSuB+G7tVrAlVsZgETT5nljf+Iw==",
-            "dev": true
+        "ms": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+          "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g=",
+          "dev": true
         },
         "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
-        },
-        "source-map-resolve": {
-            "version": "0.5.3",
-            "resolved": "https://registry.npmjs.org/source-map-resolve/-/source-map-resolve-0.5.3.tgz",
-            "integrity": "sha512-Htz+RnsXWk5+P2slx5Jh3Q66vhQj1Cllm0zvnaY98+NFx+Dv2CF/f5O/t8x+KaNdrdIAsruNzoh/KpialbqAnw==",
-            "dev": true,
-            "requires": {
-                "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": {
-            "version": "0.5.19",
-            "resolved": "https://registry.npmjs.org/source-map-support/-/source-map-support-0.5.19.tgz",
-            "integrity": "sha512-Wonm7zOCIJzBGQdB+thsPar0kYuCIzYvxZwlBa87yi/Mdjv7Tip2cyVbLj5o0cFPN4EVkuTwb3GDDyUx2DGnGw==",
-            "dev": true,
-            "requires": {
-                "buffer-from": "^1.0.0",
-                "source-map": "^0.6.0"
-            }
-        },
-        "source-map-url": {
-            "version": "0.4.1",
-            "resolved": "https://registry.npmjs.org/source-map-url/-/source-map-url-0.4.1.tgz",
-            "integrity": "sha512-cPiFOTLUKvJFIg4SKVScy4ilPPW6rFgMgfuZJPNoDuMs3nC1HbMUycBoJw77xFIp6z1UJQJOfx6C9GMH80DiTw==",
-            "dev": true
-        },
-        "spdy": {
-            "version": "4.0.2",
-            "resolved": "https://registry.npmjs.org/spdy/-/spdy-4.0.2.tgz",
-            "integrity": "sha512-r46gZQZQV+Kl9oItvl1JZZqJKGr+oEkB08A6BzkiR7593/7IbtuncXHd2YoYeTsG4157ZssMu9KYvUHLcjcDoA==",
-            "dev": true,
-            "requires": {
-                "debug": "^4.1.0",
-                "handle-thing": "^2.0.0",
-                "http-deceiver": "^1.2.7",
-                "select-hose": "^2.0.0",
-                "spdy-transport": "^3.0.0"
-            }
+          "version": "0.5.7",
+          "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz",
+          "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=",
+          "dev": true
+        }
+      }
+    },
+    "snapdragon-node": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/snapdragon-node/-/snapdragon-node-2.1.1.tgz",
+      "integrity": "sha512-O27l4xaMYt/RSQ5TR3vpWCAB5Kb/czIcqUFOM/C4fYcLnbZUc1PkjTAMjof2pBWaSTwOUd6qUHcFGVGj7aIwnw==",
+      "dev": true,
+      "requires": {
+        "define-property": "^1.0.0",
+        "isobject": "^3.0.0",
+        "snapdragon-util": "^3.0.1"
+      },
+      "dependencies": {
+        "define-property": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-1.0.0.tgz",
+          "integrity": "sha1-dp66rz9KY6rTr56NMEybvnm/sOY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^1.0.0"
+          }
         },
-        "spdy-transport": {
-            "version": "3.0.0",
-            "resolved": "https://registry.npmjs.org/spdy-transport/-/spdy-transport-3.0.0.tgz",
-            "integrity": "sha512-hsLVFE5SjA6TCisWeJXFKniGGOpBgMLmerfO2aCyCU5s7nJ/rpAepqmFifv/GCbSbueEeAJJnmSQ2rKC/g8Fcw==",
-            "dev": true,
-            "requires": {
-                "debug": "^4.1.0",
-                "detect-node": "^2.0.4",
-                "hpack.js": "^2.1.6",
-                "obuf": "^1.1.2",
-                "readable-stream": "^3.0.6",
-                "wbuf": "^1.7.3"
-            },
-            "dependencies": {
-                "readable-stream": {
-                    "version": "3.6.0",
-                    "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-3.6.0.tgz",
-                    "integrity": "sha512-BViHy7LKeTz4oNnkcLJ+lVSL6vpiFeX6/d3oSH8zCW7UxP2onchk+vTGB143xuFjHS3deTgkKoXXymXqymiIdA==",
-                    "dev": true,
-                    "requires": {
-                        "inherits": "^2.0.3",
-                        "string_decoder": "^1.1.1",
-                        "util-deprecate": "^1.0.1"
-                    }
-                }
-            }
+        "is-accessor-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-accessor-descriptor/-/is-accessor-descriptor-1.0.0.tgz",
+          "integrity": "sha512-m5hnHTkcVsPfqx3AKlyttIPb7J+XykHvJP2B9bZDjlhLIoEq4XoK64Vg7boZlVWYK6LUY94dYPEE7Lh0ZkZKcQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "split-string": {
-            "version": "3.1.0",
-            "resolved": "https://registry.npmjs.org/split-string/-/split-string-3.1.0.tgz",
-            "integrity": "sha512-NzNVhJDYpwceVVii8/Hu6DKfD2G+NrQHlS/V/qgv763EYudVwEcMQNxd2lh+0VrUByXN/oJkl5grOhYWvQUYiw==",
-            "dev": true,
-            "requires": {
-                "extend-shallow": "^3.0.0"
-            }
+        "is-data-descriptor": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/is-data-descriptor/-/is-data-descriptor-1.0.0.tgz",
+          "integrity": "sha512-jbRXy1FmtAoCjQkVmIVYwuuqDFUbaOeDjmed1tOGPrsMhtJA4rD9tkgA0F1qJ3gRFRXcHYVkdeaP50Q5rE/jLQ==",
+          "dev": true,
+          "requires": {
+            "kind-of": "^6.0.0"
+          }
         },
-        "sprintf-js": {
-            "version": "1.0.3",
-            "resolved": "https://registry.npmjs.org/sprintf-js/-/sprintf-js-1.0.3.tgz",
-            "integrity": "sha1-BOaSb2YolTVPPdAVIDYzuFcpfiw=",
-            "dev": true
-        },
-        "static-extend": {
-            "version": "0.1.2",
-            "resolved": "https://registry.npmjs.org/static-extend/-/static-extend-0.1.2.tgz",
-            "integrity": "sha1-YICcOcv/VTNyJv1eC1IPNB8ftcY=",
-            "dev": true,
-            "requires": {
-                "define-property": "^0.2.5",
-                "object-copy": "^0.1.0"
-            },
-            "dependencies": {
-                "define-property": {
-                    "version": "0.2.5",
-                    "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
-                    "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
-                    "dev": true,
-                    "requires": {
-                        "is-descriptor": "^0.1.0"
-                    }
-                }
-            }
+        "is-descriptor": {
+          "version": "1.0.2",
+          "resolved": "https://registry.npmjs.org/is-descriptor/-/is-descriptor-1.0.2.tgz",
+          "integrity": "sha512-2eis5WqQGV7peooDyLmNEPUrps9+SXX5c9pL3xEB+4e9HnGuDa7mB7kHxHw4CbqS9k1T2hOH3miL8n8WtiYVtg==",
+          "dev": true,
+          "requires": {
+            "is-accessor-descriptor": "^1.0.0",
+            "is-data-descriptor": "^1.0.0",
+            "kind-of": "^6.0.2"
+          }
+        }
+      }
+    },
+    "snapdragon-util": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/snapdragon-util/-/snapdragon-util-3.0.1.tgz",
+      "integrity": "sha512-mbKkMdQKsjX4BAL4bRYTj21edOf8cN7XHdYUJEe+Zn99hVEYcMvKPct1IqNe7+AZPirn8BCDOQBHQZknqmKlZQ==",
+      "dev": true,
+      "requires": {
+        "kind-of": "^3.2.0"
+      },
+      "dependencies": {
+        "kind-of": {
+          "version": "3.2.2",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+          "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+          "dev": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
+        }
+      }
+    },
+    "sockjs": {
+      "version": "0.3.21",
+      "resolved": "https://registry.npmjs.org/sockjs/-/sockjs-0.3.21.tgz",
+      "integrity": "sha512-DhbPFGpxjc6Z3I+uX07Id5ZO2XwYsWOrYjaSeieES78cq+JaJvVe5q/m1uvjIQhXinhIeCFRH6JgXe+mvVMyXw==",
+      "dev": true,
+      "requires": {
+        "faye-websocket": "^0.11.3",
+        "uuid": "^3.4.0",
+        "websocket-driver": "^0.7.4"
+      }
+    },
+    "sockjs-client": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmjs.org/sockjs-client/-/sockjs-client-1.5.0.tgz",
+      "integrity": "sha512-8Dt3BDi4FYNrCFGTL/HtwVzkARrENdwOUf1ZoW/9p3M8lZdFT35jVdrHza+qgxuG9H3/shR4cuX/X9umUrjP8Q==",
+      "dev": true,
+      "requires": {
+        "debug": "^3.2.6",
+        "eventsource": "^1.0.7",
+        "faye-websocket": "^0.11.3",
+        "inherits": "^2.0.4",
+        "json3": "^3.3.3",
+        "url-parse": "^1.4.7"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "3.2.7",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.7.tgz",
+          "integrity": "sha512-CFjzYYAi4ThfiQvizrFQevTTXHtnCqWfe7x1AhgEscTz6ZbLbfoLRLPugTQyBth6f8ZERVUSyWHFD/7Wu4t1XQ==",
+          "dev": true,
+          "requires": {
+            "ms": "^2.1.1"
+          }
+        }
+      }
+    },
+    "source-list-map": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/source-list-map/-/source-list-map-2.0.1.tgz",
+      "integrity": "sha512-qnQ7gVMxGNxsiL4lEuJwe/To8UnK7fAnmbGEEH8RpLouuKbeEm0lhbQVFIrNSuB+G7tVrAlVsZgETT5nljf+Iw==",
+      "dev": true
+    },
+    "source-map": {
+      "version": "0.6.1",
+      "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.6.1.tgz",
+      "integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g=="
+    },
+    "source-map-resolve": {
+      "version": "0.5.3",
+      "resolved": "https://registry.npmjs.org/source-map-resolve/-/source-map-resolve-0.5.3.tgz",
+      "integrity": "sha512-Htz+RnsXWk5+P2slx5Jh3Q66vhQj1Cllm0zvnaY98+NFx+Dv2CF/f5O/t8x+KaNdrdIAsruNzoh/KpialbqAnw==",
+      "dev": true,
+      "requires": {
+        "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": {
+      "version": "0.5.19",
+      "resolved": "https://registry.npmjs.org/source-map-support/-/source-map-support-0.5.19.tgz",
+      "integrity": "sha512-Wonm7zOCIJzBGQdB+thsPar0kYuCIzYvxZwlBa87yi/Mdjv7Tip2cyVbLj5o0cFPN4EVkuTwb3GDDyUx2DGnGw==",
+      "dev": true,
+      "requires": {
+        "buffer-from": "^1.0.0",
+        "source-map": "^0.6.0"
+      }
+    },
+    "source-map-url": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/source-map-url/-/source-map-url-0.4.1.tgz",
+      "integrity": "sha512-cPiFOTLUKvJFIg4SKVScy4ilPPW6rFgMgfuZJPNoDuMs3nC1HbMUycBoJw77xFIp6z1UJQJOfx6C9GMH80DiTw==",
+      "dev": true
+    },
+    "sourcemap-codec": {
+      "version": "1.4.8",
+      "resolved": "https://registry.npmjs.org/sourcemap-codec/-/sourcemap-codec-1.4.8.tgz",
+      "integrity": "sha512-9NykojV5Uih4lgo5So5dtw+f0JgJX30KCNI8gwhz2J9A15wD0Ml6tjHKwf6fTSa6fAdVBdZeNOs9eJ71qCk8vA=="
+    },
+    "spdy": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/spdy/-/spdy-4.0.2.tgz",
+      "integrity": "sha512-r46gZQZQV+Kl9oItvl1JZZqJKGr+oEkB08A6BzkiR7593/7IbtuncXHd2YoYeTsG4157ZssMu9KYvUHLcjcDoA==",
+      "dev": true,
+      "requires": {
+        "debug": "^4.1.0",
+        "handle-thing": "^2.0.0",
+        "http-deceiver": "^1.2.7",
+        "select-hose": "^2.0.0",
+        "spdy-transport": "^3.0.0"
+      }
+    },
+    "spdy-transport": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/spdy-transport/-/spdy-transport-3.0.0.tgz",
+      "integrity": "sha512-hsLVFE5SjA6TCisWeJXFKniGGOpBgMLmerfO2aCyCU5s7nJ/rpAepqmFifv/GCbSbueEeAJJnmSQ2rKC/g8Fcw==",
+      "dev": true,
+      "requires": {
+        "debug": "^4.1.0",
+        "detect-node": "^2.0.4",
+        "hpack.js": "^2.1.6",
+        "obuf": "^1.1.2",
+        "readable-stream": "^3.0.6",
+        "wbuf": "^1.7.3"
+      },
+      "dependencies": {
+        "readable-stream": {
+          "version": "3.6.0",
+          "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-3.6.0.tgz",
+          "integrity": "sha512-BViHy7LKeTz4oNnkcLJ+lVSL6vpiFeX6/d3oSH8zCW7UxP2onchk+vTGB143xuFjHS3deTgkKoXXymXqymiIdA==",
+          "dev": true,
+          "requires": {
+            "inherits": "^2.0.3",
+            "string_decoder": "^1.1.1",
+            "util-deprecate": "^1.0.1"
+          }
+        }
+      }
+    },
+    "split-string": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/split-string/-/split-string-3.1.0.tgz",
+      "integrity": "sha512-NzNVhJDYpwceVVii8/Hu6DKfD2G+NrQHlS/V/qgv763EYudVwEcMQNxd2lh+0VrUByXN/oJkl5grOhYWvQUYiw==",
+      "dev": true,
+      "requires": {
+        "extend-shallow": "^3.0.0"
+      }
+    },
+    "sprintf-js": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/sprintf-js/-/sprintf-js-1.0.3.tgz",
+      "integrity": "sha1-BOaSb2YolTVPPdAVIDYzuFcpfiw=",
+      "dev": true
+    },
+    "static-eval": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/static-eval/-/static-eval-2.1.0.tgz",
+      "integrity": "sha512-agtxZ/kWSsCkI5E4QifRwsaPs0P0JmZV6dkLz6ILYfFYQGn+5plctanRN+IC8dJRiFkyXHrwEE3W9Wmx67uDbw==",
+      "requires": {
+        "escodegen": "^1.11.1"
+      }
+    },
+    "static-extend": {
+      "version": "0.1.2",
+      "resolved": "https://registry.npmjs.org/static-extend/-/static-extend-0.1.2.tgz",
+      "integrity": "sha1-YICcOcv/VTNyJv1eC1IPNB8ftcY=",
+      "dev": true,
+      "requires": {
+        "define-property": "^0.2.5",
+        "object-copy": "^0.1.0"
+      },
+      "dependencies": {
+        "define-property": {
+          "version": "0.2.5",
+          "resolved": "https://registry.npmjs.org/define-property/-/define-property-0.2.5.tgz",
+          "integrity": "sha1-w1se+RjsPJkPmlvFe+BKrOxcgRY=",
+          "dev": true,
+          "requires": {
+            "is-descriptor": "^0.1.0"
+          }
+        }
+      }
+    },
+    "static-module": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/static-module/-/static-module-3.0.4.tgz",
+      "integrity": "sha512-gb0v0rrgpBkifXCa3yZXxqVmXDVE+ETXj6YlC/jt5VzOnGXR2C15+++eXuMDUYsePnbhf+lwW0pE1UXyOLtGCw==",
+      "requires": {
+        "acorn-node": "^1.3.0",
+        "concat-stream": "~1.6.0",
+        "convert-source-map": "^1.5.1",
+        "duplexer2": "~0.1.4",
+        "escodegen": "^1.11.1",
+        "has": "^1.0.1",
+        "magic-string": "0.25.1",
+        "merge-source-map": "1.0.4",
+        "object-inspect": "^1.6.0",
+        "readable-stream": "~2.3.3",
+        "scope-analyzer": "^2.0.1",
+        "shallow-copy": "~0.0.1",
+        "static-eval": "^2.0.5",
+        "through2": "~2.0.3"
+      }
+    },
+    "statuses": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmjs.org/statuses/-/statuses-1.5.0.tgz",
+      "integrity": "sha1-Fhx9rBd2Wf2YEfQ3cfqZOBR4Yow=",
+      "dev": true
+    },
+    "stream-browserify": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/stream-browserify/-/stream-browserify-3.0.0.tgz",
+      "integrity": "sha512-H73RAHsVBapbim0tU2JwwOiXUj+fikfiaoYAKHF3VJfA0pe2BCzkhAHBlLG6REzE+2WNZcxOXjK7lkso+9euLA==",
+      "requires": {
+        "inherits": "~2.0.4",
+        "readable-stream": "^3.5.0"
+      },
+      "dependencies": {
+        "readable-stream": {
+          "version": "3.6.0",
+          "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-3.6.0.tgz",
+          "integrity": "sha512-BViHy7LKeTz4oNnkcLJ+lVSL6vpiFeX6/d3oSH8zCW7UxP2onchk+vTGB143xuFjHS3deTgkKoXXymXqymiIdA==",
+          "requires": {
+            "inherits": "^2.0.3",
+            "string_decoder": "^1.1.1",
+            "util-deprecate": "^1.0.1"
+          }
+        }
+      }
+    },
+    "string-width": {
+      "version": "4.2.2",
+      "resolved": "https://registry.npmjs.org/string-width/-/string-width-4.2.2.tgz",
+      "integrity": "sha512-XBJbT3N4JhVumXE0eoLU9DCjcaF92KLNqTmFCnG1pf8duUxFGwtP6AD6nkjw9a3IdiRtL3E2w3JDiE/xi3vOeA==",
+      "dev": true,
+      "requires": {
+        "emoji-regex": "^8.0.0",
+        "is-fullwidth-code-point": "^3.0.0",
+        "strip-ansi": "^6.0.0"
+      }
+    },
+    "string.prototype.trimend": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/string.prototype.trimend/-/string.prototype.trimend-1.0.4.tgz",
+      "integrity": "sha512-y9xCjw1P23Awk8EvTpcyL2NIr1j7wJ39f+k6lvRnSMz+mz9CGz9NYPelDk42kOz6+ql8xjfK8oYzy3jAP5QU5A==",
+      "requires": {
+        "call-bind": "^1.0.2",
+        "define-properties": "^1.1.3"
+      }
+    },
+    "string.prototype.trimstart": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/string.prototype.trimstart/-/string.prototype.trimstart-1.0.4.tgz",
+      "integrity": "sha512-jh6e984OBfvxS50tdY2nRZnoC5/mLFKOREQfw8t5yytkoUsJRNxvI/E39qu1sD0OtWI3OC0XgKSmcWwziwYuZw==",
+      "requires": {
+        "call-bind": "^1.0.2",
+        "define-properties": "^1.1.3"
+      }
+    },
+    "string_decoder": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/string_decoder/-/string_decoder-1.1.1.tgz",
+      "integrity": "sha512-n/ShnvDi6FHbbVfviro+WojiFzv+s8MPMHBczVePfUpDJLwoLT0ht1l4YwBCbi8pJAveEEdnkHyPyTP/mzRfwg==",
+      "requires": {
+        "safe-buffer": "~5.1.0"
+      },
+      "dependencies": {
+        "safe-buffer": {
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
+          "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g=="
+        }
+      }
+    },
+    "strip-ansi": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-6.0.0.tgz",
+      "integrity": "sha512-AuvKTrTfQNYNIctbR1K/YGTR1756GycPsg7b9bdV9Duqur4gv6aKqHXah67Z8ImS7WEz5QVcOtlfW2rZEugt6w==",
+      "dev": true,
+      "requires": {
+        "ansi-regex": "^5.0.0"
+      }
+    },
+    "strip-eof": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/strip-eof/-/strip-eof-1.0.0.tgz",
+      "integrity": "sha1-u0P/VZim6wXYm1n80SnJgzE2Br8=",
+      "dev": true
+    },
+    "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
+    },
+    "strip-json-comments": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/strip-json-comments/-/strip-json-comments-3.1.1.tgz",
+      "integrity": "sha512-6fPc+R4ihwqP6N/aIv2f1gMH8lOVtWQHoqC4yK6oSDVVocumAsfCqjkXnqiYMhmMwS/mEHLp7Vehlt3ql6lEig==",
+      "dev": true
+    },
+    "supports-color": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-7.2.0.tgz",
+      "integrity": "sha512-qpCAvRl9stuOHveKsn7HncJRvv501qIacKzQlO/+Lwxc9+0q2wLyv4Dfvt80/DPn2pqOBsJdDiogXGR9+OvwRw==",
+      "dev": true,
+      "requires": {
+        "has-flag": "^4.0.0"
+      }
+    },
+    "table": {
+      "version": "6.0.7",
+      "resolved": "https://registry.npmjs.org/table/-/table-6.0.7.tgz",
+      "integrity": "sha512-rxZevLGTUzWna/qBLObOe16kB2RTnnbhciwgPbMMlazz1yZGVEgnZK762xyVdVznhqxrfCeBMmMkgOOaPwjH7g==",
+      "dev": true,
+      "requires": {
+        "ajv": "^7.0.2",
+        "lodash": "^4.17.20",
+        "slice-ansi": "^4.0.0",
+        "string-width": "^4.2.0"
+      },
+      "dependencies": {
+        "ajv": {
+          "version": "7.2.1",
+          "resolved": "https://registry.npmjs.org/ajv/-/ajv-7.2.1.tgz",
+          "integrity": "sha512-+nu0HDv7kNSOua9apAVc979qd932rrZeb3WOvoiD31A/p1mIE5/9bN2027pE2rOPYEdS3UHzsvof4hY+lM9/WQ==",
+          "dev": true,
+          "requires": {
+            "fast-deep-equal": "^3.1.1",
+            "json-schema-traverse": "^1.0.0",
+            "require-from-string": "^2.0.2",
+            "uri-js": "^4.2.2"
+          }
         },
-        "statuses": {
-            "version": "1.5.0",
-            "resolved": "https://registry.npmjs.org/statuses/-/statuses-1.5.0.tgz",
-            "integrity": "sha1-Fhx9rBd2Wf2YEfQ3cfqZOBR4Yow=",
-            "dev": true
-        },
-        "string_decoder": {
-            "version": "1.1.1",
-            "resolved": "https://registry.npmjs.org/string_decoder/-/string_decoder-1.1.1.tgz",
-            "integrity": "sha512-n/ShnvDi6FHbbVfviro+WojiFzv+s8MPMHBczVePfUpDJLwoLT0ht1l4YwBCbi8pJAveEEdnkHyPyTP/mzRfwg==",
-            "dev": true,
-            "requires": {
-                "safe-buffer": "~5.1.0"
-            },
-            "dependencies": {
-                "safe-buffer": {
-                    "version": "5.1.2",
-                    "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
-                    "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-                    "dev": true
-                }
-            }
+        "json-schema-traverse": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-1.0.0.tgz",
+          "integrity": "sha512-NM8/P9n3XjXhIZn1lLhkFaACTOURQXjWhV4BA/RnOv8xvgqtqpAX9IO4mRQxSx1Rlo4tqzeqb0sOlruaOy3dug==",
+          "dev": true
+        }
+      }
+    },
+    "tapable": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/tapable/-/tapable-2.2.0.tgz",
+      "integrity": "sha512-FBk4IesMV1rBxX2tfiK8RAmogtWn53puLOQlvO8XuwlgxcYbP4mVPS9Ph4aeamSyyVjOl24aYWAuc8U5kCVwMw==",
+      "dev": true
+    },
+    "terser": {
+      "version": "5.6.1",
+      "resolved": "https://registry.npmjs.org/terser/-/terser-5.6.1.tgz",
+      "integrity": "sha512-yv9YLFQQ+3ZqgWCUk+pvNJwgUTdlIxUk1WTN+RnaFJe2L7ipG2csPT0ra2XRm7Cs8cxN7QXmK1rFzEwYEQkzXw==",
+      "dev": true,
+      "requires": {
+        "commander": "^2.20.0",
+        "source-map": "~0.7.2",
+        "source-map-support": "~0.5.19"
+      },
+      "dependencies": {
+        "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
+        }
+      }
+    },
+    "terser-webpack-plugin": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmjs.org/terser-webpack-plugin/-/terser-webpack-plugin-5.1.1.tgz",
+      "integrity": "sha512-5XNNXZiR8YO6X6KhSGXfY0QrGrCRlSwAEjIIrlRQR4W8nP69TaJUlh3bkuac6zzgspiGPfKEHcY295MMVExl5Q==",
+      "dev": true,
+      "requires": {
+        "jest-worker": "^26.6.2",
+        "p-limit": "^3.1.0",
+        "schema-utils": "^3.0.0",
+        "serialize-javascript": "^5.0.1",
+        "source-map": "^0.6.1",
+        "terser": "^5.5.1"
+      },
+      "dependencies": {
+        "p-limit": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/p-limit/-/p-limit-3.1.0.tgz",
+          "integrity": "sha512-TYOanM3wGwNGsZN2cVTYPArw454xnXj5qmWF1bEoAc4+cU/ol7GVh7odevjp1FNHduHc3KZMcFduxU5Xc6uJRQ==",
+          "dev": true,
+          "requires": {
+            "yocto-queue": "^0.1.0"
+          }
         },
-        "string-width": {
-            "version": "4.2.2",
-            "resolved": "https://registry.npmjs.org/string-width/-/string-width-4.2.2.tgz",
-            "integrity": "sha512-XBJbT3N4JhVumXE0eoLU9DCjcaF92KLNqTmFCnG1pf8duUxFGwtP6AD6nkjw9a3IdiRtL3E2w3JDiE/xi3vOeA==",
-            "dev": true,
-            "requires": {
-                "emoji-regex": "^8.0.0",
-                "is-fullwidth-code-point": "^3.0.0",
-                "strip-ansi": "^6.0.0"
+        "schema-utils": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.0.0.tgz",
+          "integrity": "sha512-6D82/xSzO094ajanoOSbe4YvXWMfn2A//8Y1+MUqFAJul5Bs+yn36xbK9OtNDcRVSBJ9jjeoXftM6CfztsjOAA==",
+          "dev": true,
+          "requires": {
+            "@types/json-schema": "^7.0.6",
+            "ajv": "^6.12.5",
+            "ajv-keywords": "^3.5.2"
+          }
+        }
+      }
+    },
+    "text-table": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmjs.org/text-table/-/text-table-0.2.0.tgz",
+      "integrity": "sha1-f17oI66AUgfACvLfSoTsP8+lcLQ=",
+      "dev": true
+    },
+    "through": {
+      "version": "2.3.8",
+      "resolved": "https://registry.npmjs.org/through/-/through-2.3.8.tgz",
+      "integrity": "sha1-DdTJ/6q8NXlgsbckEV1+Doai4fU="
+    },
+    "through2": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmjs.org/through2/-/through2-2.0.5.tgz",
+      "integrity": "sha512-/mrRod8xqpA+IHSLyGCQ2s8SPHiCDEeQJSep1jqLYeEUClOFG2Qsh+4FU6G9VeqpZnGW/Su8LQGc4YKni5rYSQ==",
+      "requires": {
+        "readable-stream": "~2.3.6",
+        "xtend": "~4.0.1"
+      }
+    },
+    "thunky": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/thunky/-/thunky-1.1.0.tgz",
+      "integrity": "sha512-eHY7nBftgThBqOyHGVN+l8gF0BucP09fMo0oO/Lb0w1OF80dJv+lDVpXG60WMQvkcxAkNybKsrEIE3ZtKGmPrA==",
+      "dev": true
+    },
+    "tiny-emitter": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/tiny-emitter/-/tiny-emitter-2.1.0.tgz",
+      "integrity": "sha512-NB6Dk1A9xgQPMoGqC5CVXn123gWyte215ONT5Pp5a0yt4nlEoO1ZWeCwpncaekPHXO60i47ihFnZPiRPjRMq4Q=="
+    },
+    "tiny-inflate": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/tiny-inflate/-/tiny-inflate-1.0.3.tgz",
+      "integrity": "sha512-pkY1fj1cKHb2seWDy0B16HeWyczlJA9/WW3u3c4z/NiWDsO3DOU5D7nhTLE9CF0yXv/QZFY7sEJmj24dK+Rrqw=="
+    },
+    "to-fast-properties": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/to-fast-properties/-/to-fast-properties-2.0.0.tgz",
+      "integrity": "sha1-3F5pjL0HkmW8c+A3doGk5Og/YW4=",
+      "dev": true
+    },
+    "to-object-path": {
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/to-object-path/-/to-object-path-0.3.0.tgz",
+      "integrity": "sha1-KXWIt7Dn4KwI4E5nL4XB9JmeF68=",
+      "dev": true,
+      "requires": {
+        "kind-of": "^3.0.2"
+      },
+      "dependencies": {
+        "kind-of": {
+          "version": "3.2.2",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+          "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+          "dev": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
+        }
+      }
+    },
+    "to-regex": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/to-regex/-/to-regex-3.0.2.tgz",
+      "integrity": "sha512-FWtleNAtZ/Ki2qtqej2CXTOayOH9bHDQF+Q48VpWyDXjbYxA4Yz8iDB31zXOBUlOHHKidDbqGVrTUvQMPmBGBw==",
+      "dev": true,
+      "requires": {
+        "define-property": "^2.0.2",
+        "extend-shallow": "^3.0.2",
+        "regex-not": "^1.0.2",
+        "safe-regex": "^1.1.0"
+      }
+    },
+    "to-regex-range": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz",
+      "integrity": "sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==",
+      "dev": true,
+      "requires": {
+        "is-number": "^7.0.0"
+      }
+    },
+    "toidentifier": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/toidentifier/-/toidentifier-1.0.0.tgz",
+      "integrity": "sha512-yaOH/Pk/VEhBWWTlhI+qXxDFXlejDGcQipMlyxda9nthulaxLZUNcUqFxokp0vcYnvteJln5FNQDRrxj3YcbVw==",
+      "dev": true
+    },
+    "tslib": {
+      "version": "1.14.1",
+      "resolved": "https://registry.npmjs.org/tslib/-/tslib-1.14.1.tgz",
+      "integrity": "sha512-Xni35NKzjgMrwevysHTCArtLDpPvye8zV/0E4EyYn43P7/7qvQwPh9BGkHewbMulVntbigmcT7rdX3BNo9wRJg==",
+      "dev": true
+    },
+    "tsutils": {
+      "version": "3.21.0",
+      "resolved": "https://registry.npmjs.org/tsutils/-/tsutils-3.21.0.tgz",
+      "integrity": "sha512-mHKK3iUXL+3UF6xL5k0PEhKRUBKPBCv/+RkEOpjRWxxx27KKRBmmA60A9pgOUvMi8GKhRMPEmjBRPzs2W7O1OA==",
+      "dev": true,
+      "requires": {
+        "tslib": "^1.8.1"
+      }
+    },
+    "type": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/type/-/type-1.2.0.tgz",
+      "integrity": "sha512-+5nt5AAniqsCnu2cEQQdpzCAh33kVx8n0VoFidKpB1dVVLAN/F+bgVOqOJqOnEnrhp222clB5p3vUlD+1QAnfg=="
+    },
+    "type-check": {
+      "version": "0.4.0",
+      "resolved": "https://registry.npmjs.org/type-check/-/type-check-0.4.0.tgz",
+      "integrity": "sha512-XleUoc9uwGXqjWwXaUTZAmzMcFZ5858QA2vvx1Ur5xIcixXIP+8LnFDgRplU30us6teqdlskFfu+ae4K79Ooew==",
+      "dev": true,
+      "requires": {
+        "prelude-ls": "^1.2.1"
+      }
+    },
+    "type-fest": {
+      "version": "0.8.1",
+      "resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.8.1.tgz",
+      "integrity": "sha512-4dbzIzqvjtgiM5rw1k5rEHtBANKmdudhGyBEajN01fEyhaAIhsoKNy6y7+IN93IfpFtwY9iqi7kD+xwKhQsNJA==",
+      "dev": true
+    },
+    "type-is": {
+      "version": "1.6.18",
+      "resolved": "https://registry.npmjs.org/type-is/-/type-is-1.6.18.tgz",
+      "integrity": "sha512-TkRKr9sUTxEH8MdfuCSP7VizJyzRNMjj2J2do2Jr3Kym598JVdEksuzPQCnlFPW4ky9Q+iA+ma9BGm06XQBy8g==",
+      "dev": true,
+      "requires": {
+        "media-typer": "0.3.0",
+        "mime-types": "~2.1.24"
+      }
+    },
+    "typed-function": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-2.0.0.tgz",
+      "integrity": "sha512-Hhy1Iwo/e4AtLZNK10ewVVcP2UEs408DS35ubP825w/YgSBK1KVLwALvvIG4yX75QJrxjCpcWkzkVRB0BwwYlA=="
+    },
+    "typedarray": {
+      "version": "0.0.6",
+      "resolved": "https://registry.npmjs.org/typedarray/-/typedarray-0.0.6.tgz",
+      "integrity": "sha1-hnrHTjhkGHsdPUfZlqeOxciDB3c="
+    },
+    "typescript": {
+      "version": "4.2.3",
+      "resolved": "https://registry.npmjs.org/typescript/-/typescript-4.2.3.tgz",
+      "integrity": "sha512-qOcYwxaByStAWrBf4x0fibwZvMRG+r4cQoTjbPtUlrWjBHbmCAww1i448U0GJ+3cNNEtebDteo/cHOR3xJ4wEw==",
+      "dev": true
+    },
+    "unbox-primitive": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/unbox-primitive/-/unbox-primitive-1.0.1.tgz",
+      "integrity": "sha512-tZU/3NqK3dA5gpE1KtyiJUrEB0lxnGkMFHptJ7q6ewdZ8s12QrODwNbhIJStmJkd1QDXa1NRA8aF2A1zk/Ypyw==",
+      "requires": {
+        "function-bind": "^1.1.1",
+        "has-bigints": "^1.0.1",
+        "has-symbols": "^1.0.2",
+        "which-boxed-primitive": "^1.0.2"
+      }
+    },
+    "unicode-canonical-property-names-ecmascript": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/unicode-canonical-property-names-ecmascript/-/unicode-canonical-property-names-ecmascript-1.0.4.tgz",
+      "integrity": "sha512-jDrNnXWHd4oHiTZnx/ZG7gtUTVp+gCcTTKr8L0HjlwphROEW3+Him+IpvC+xcJEFegapiMZyZe02CyuOnRmbnQ==",
+      "dev": true
+    },
+    "unicode-match-property-ecmascript": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/unicode-match-property-ecmascript/-/unicode-match-property-ecmascript-1.0.4.tgz",
+      "integrity": "sha512-L4Qoh15vTfntsn4P1zqnHulG0LdXgjSO035fEpdtp6YxXhMT51Q6vgM5lYdG/5X3MjS+k/Y9Xw4SFCY9IkR0rg==",
+      "dev": true,
+      "requires": {
+        "unicode-canonical-property-names-ecmascript": "^1.0.4",
+        "unicode-property-aliases-ecmascript": "^1.0.4"
+      }
+    },
+    "unicode-match-property-value-ecmascript": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/unicode-match-property-value-ecmascript/-/unicode-match-property-value-ecmascript-1.2.0.tgz",
+      "integrity": "sha512-wjuQHGQVofmSJv1uVISKLE5zO2rNGzM/KCYZch/QQvez7C1hUhBIuZ701fYXExuufJFMPhv2SyL8CyoIfMLbIQ==",
+      "dev": true
+    },
+    "unicode-properties": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmjs.org/unicode-properties/-/unicode-properties-1.3.1.tgz",
+      "integrity": "sha512-nIV3Tf3LcUEZttY/2g4ZJtGXhWwSkuLL+rCu0DIAMbjyVPj+8j5gNVz4T/sVbnQybIsd5SFGkPKg/756OY6jlA==",
+      "requires": {
+        "base64-js": "^1.3.0",
+        "unicode-trie": "^2.0.0"
+      },
+      "dependencies": {
+        "unicode-trie": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/unicode-trie/-/unicode-trie-2.0.0.tgz",
+          "integrity": "sha512-x7bc76x0bm4prf1VLg79uhAzKw8DVboClSN5VxJuQ+LKDOVEW9CdH+VY7SP+vX7xCYQqzzgQpFqz15zeLvAtZQ==",
+          "requires": {
+            "pako": "^0.2.5",
+            "tiny-inflate": "^1.0.0"
+          }
+        }
+      }
+    },
+    "unicode-property-aliases-ecmascript": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/unicode-property-aliases-ecmascript/-/unicode-property-aliases-ecmascript-1.1.0.tgz",
+      "integrity": "sha512-PqSoPh/pWetQ2phoj5RLiaqIk4kCNwoV3CI+LfGmWLKI3rE3kl1h59XpX2BjgDrmbxD9ARtQobPGU1SguCYuQg==",
+      "dev": true
+    },
+    "unicode-trie": {
+      "version": "0.3.1",
+      "resolved": "https://registry.npmjs.org/unicode-trie/-/unicode-trie-0.3.1.tgz",
+      "integrity": "sha1-1nHd3YkQGgi6w3tqUWEBBgIFIIU=",
+      "requires": {
+        "pako": "^0.2.5",
+        "tiny-inflate": "^1.0.0"
+      }
+    },
+    "union-value": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/union-value/-/union-value-1.0.1.tgz",
+      "integrity": "sha512-tJfXmxMeWYnczCVs7XAEvIV7ieppALdyepWMkHkwciRpZraG/xwT+s2JN8+pr1+8jCRf80FFzvr+MpQeeoF4Xg==",
+      "dev": true,
+      "requires": {
+        "arr-union": "^3.1.0",
+        "get-value": "^2.0.6",
+        "is-extendable": "^0.1.1",
+        "set-value": "^2.0.1"
+      }
+    },
+    "unpipe": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/unpipe/-/unpipe-1.0.0.tgz",
+      "integrity": "sha1-sr9O6FFKrmFltIF4KdIbLvSZBOw=",
+      "dev": true
+    },
+    "unset-value": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/unset-value/-/unset-value-1.0.0.tgz",
+      "integrity": "sha1-g3aHP30jNRef+x5vw6jtDfyKtVk=",
+      "dev": true,
+      "requires": {
+        "has-value": "^0.3.1",
+        "isobject": "^3.0.0"
+      },
+      "dependencies": {
+        "has-value": {
+          "version": "0.3.1",
+          "resolved": "https://registry.npmjs.org/has-value/-/has-value-0.3.1.tgz",
+          "integrity": "sha1-ex9YutpiyoJ+wKIHgCVlSEWZXh8=",
+          "dev": true,
+          "requires": {
+            "get-value": "^2.0.3",
+            "has-values": "^0.1.4",
+            "isobject": "^2.0.0"
+          },
+          "dependencies": {
+            "isobject": {
+              "version": "2.1.0",
+              "resolved": "https://registry.npmjs.org/isobject/-/isobject-2.1.0.tgz",
+              "integrity": "sha1-8GVWEJaj8dou9GJy+BXIQNh+DIk=",
+              "dev": true,
+              "requires": {
+                "isarray": "1.0.0"
+              }
             }
+          }
         },
-        "strip-ansi": {
-            "version": "6.0.0",
-            "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-6.0.0.tgz",
-            "integrity": "sha512-AuvKTrTfQNYNIctbR1K/YGTR1756GycPsg7b9bdV9Duqur4gv6aKqHXah67Z8ImS7WEz5QVcOtlfW2rZEugt6w==",
-            "dev": true,
-            "requires": {
-                "ansi-regex": "^5.0.0"
-            }
+        "has-values": {
+          "version": "0.1.4",
+          "resolved": "https://registry.npmjs.org/has-values/-/has-values-0.1.4.tgz",
+          "integrity": "sha1-bWHeldkd/Km5oCCJrThL/49it3E=",
+          "dev": true
+        }
+      }
+    },
+    "upath": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/upath/-/upath-1.2.0.tgz",
+      "integrity": "sha512-aZwGpamFO61g3OlfT7OQCHqhGnW43ieH9WZeP7QxN/G/jS4jfqUkZxoryvJgVPEcrl5NL/ggHsSmLMHuH64Lhg==",
+      "dev": true
+    },
+    "uri-js": {
+      "version": "4.4.1",
+      "resolved": "https://registry.npmjs.org/uri-js/-/uri-js-4.4.1.tgz",
+      "integrity": "sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==",
+      "dev": true,
+      "requires": {
+        "punycode": "^2.1.0"
+      }
+    },
+    "urix": {
+      "version": "0.1.0",
+      "resolved": "https://registry.npmjs.org/urix/-/urix-0.1.0.tgz",
+      "integrity": "sha1-2pN/emLiH+wf0Y1Js1wpNQZ6bHI=",
+      "dev": true
+    },
+    "url": {
+      "version": "0.11.0",
+      "resolved": "https://registry.npmjs.org/url/-/url-0.11.0.tgz",
+      "integrity": "sha1-ODjpfPxgUh63PFJajlW/3Z4uKPE=",
+      "requires": {
+        "punycode": "1.3.2",
+        "querystring": "0.2.0"
+      },
+      "dependencies": {
+        "punycode": {
+          "version": "1.3.2",
+          "resolved": "https://registry.npmjs.org/punycode/-/punycode-1.3.2.tgz",
+          "integrity": "sha1-llOgNvt8HuQjQvIyXM7v6jkmxI0="
+        }
+      }
+    },
+    "url-parse": {
+      "version": "1.5.1",
+      "resolved": "https://registry.npmjs.org/url-parse/-/url-parse-1.5.1.tgz",
+      "integrity": "sha512-HOfCOUJt7iSYzEx/UqgtwKRMC6EU91NFhsCHMv9oM03VJcVo2Qrp8T8kI9D7amFf1cu+/3CEhgb3rF9zL7k85Q==",
+      "dev": true,
+      "requires": {
+        "querystringify": "^2.1.1",
+        "requires-port": "^1.0.0"
+      }
+    },
+    "use": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/use/-/use-3.1.1.tgz",
+      "integrity": "sha512-cwESVXlO3url9YWlFW/TA9cshCEhtu7IKJ/p5soJ/gGpj7vbvFrAY/eIioQ6Dw23KjZhYgiIo8HOs1nQ2vr/oQ==",
+      "dev": true
+    },
+    "util": {
+      "version": "0.12.4",
+      "resolved": "https://registry.npmjs.org/util/-/util-0.12.4.tgz",
+      "integrity": "sha512-bxZ9qtSlGUWSOy9Qa9Xgk11kSslpuZwaxCg4sNIDj6FLucDab2JxnHwyNTCpHMtK1MjoQiWQ6DiUMZYbSrO+Sw==",
+      "requires": {
+        "inherits": "^2.0.3",
+        "is-arguments": "^1.0.4",
+        "is-generator-function": "^1.0.7",
+        "is-typed-array": "^1.1.3",
+        "safe-buffer": "^5.1.2",
+        "which-typed-array": "^1.1.2"
+      }
+    },
+    "util-deprecate": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/util-deprecate/-/util-deprecate-1.0.2.tgz",
+      "integrity": "sha1-RQ1Nyfpw3nMnYvvS1KKJgUGaDM8="
+    },
+    "utils-merge": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/utils-merge/-/utils-merge-1.0.1.tgz",
+      "integrity": "sha1-n5VxD1CiZ5R7LMwSR0HBAoQn5xM=",
+      "dev": true
+    },
+    "uuid": {
+      "version": "3.4.0",
+      "resolved": "https://registry.npmjs.org/uuid/-/uuid-3.4.0.tgz",
+      "integrity": "sha512-HjSDRw6gZE5JMggctHBcjVak08+KEVhSIiDzFnT9S9aegmp85S/bReBVTb4QTFaRNptJ9kuYaNhnbNEOkbKb/A==",
+      "dev": true
+    },
+    "v8-compile-cache": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/v8-compile-cache/-/v8-compile-cache-2.2.0.tgz",
+      "integrity": "sha512-gTpR5XQNKFwOd4clxfnhaqvfqMpqEwr4tOtCyz4MtYZX2JYhfr1JvBFKdS+7K/9rfpZR3VLX+YWBbKoxCgS43Q==",
+      "dev": true
+    },
+    "vary": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/vary/-/vary-1.1.2.tgz",
+      "integrity": "sha1-IpnwLG3tMNSllhsLn3RSShj2NPw=",
+      "dev": true
+    },
+    "vlq": {
+      "version": "0.2.3",
+      "resolved": "https://registry.npmjs.org/vlq/-/vlq-0.2.3.tgz",
+      "integrity": "sha512-DRibZL6DsNhIgYQ+wNdWDL2SL3bKPlVrRiBqV5yuMm++op8W4kGFtaQfCs4KEJn0wBZcHVHJ3eoywX8983k1ow=="
+    },
+    "watchpack": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.1.1.tgz",
+      "integrity": "sha512-Oo7LXCmc1eE1AjyuSBmtC3+Wy4HcV8PxWh2kP6fOl8yTlNS7r0K9l1ao2lrrUza7V39Y3D/BbJgY8VeSlc5JKw==",
+      "dev": true,
+      "requires": {
+        "glob-to-regexp": "^0.4.1",
+        "graceful-fs": "^4.1.2"
+      }
+    },
+    "wbuf": {
+      "version": "1.7.3",
+      "resolved": "https://registry.npmjs.org/wbuf/-/wbuf-1.7.3.tgz",
+      "integrity": "sha512-O84QOnr0icsbFGLS0O3bI5FswxzRr8/gHwWkDlQFskhSPryQXvrTMxjxGP4+iWYoauLoBvfDpkrOauZ+0iZpDA==",
+      "dev": true,
+      "requires": {
+        "minimalistic-assert": "^1.0.0"
+      }
+    },
+    "webpack": {
+      "version": "5.26.3",
+      "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.26.3.tgz",
+      "integrity": "sha512-z/F2lt2N1fZqaud1B4SzjL3OW03eULThbBXQ2OX4LSrZX4N9k1A5d0Rje3zS2g887DTWyAV0KGqEf64ois2dhg==",
+      "dev": true,
+      "requires": {
+        "@types/eslint-scope": "^3.7.0",
+        "@types/estree": "^0.0.46",
+        "@webassemblyjs/ast": "1.11.0",
+        "@webassemblyjs/wasm-edit": "1.11.0",
+        "@webassemblyjs/wasm-parser": "1.11.0",
+        "acorn": "^8.0.4",
+        "browserslist": "^4.14.5",
+        "chrome-trace-event": "^1.0.2",
+        "enhanced-resolve": "^5.7.0",
+        "es-module-lexer": "^0.4.0",
+        "eslint-scope": "^5.1.1",
+        "events": "^3.2.0",
+        "glob-to-regexp": "^0.4.1",
+        "graceful-fs": "^4.2.4",
+        "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.0.0",
+        "tapable": "^2.1.1",
+        "terser-webpack-plugin": "^5.1.1",
+        "watchpack": "^2.0.0",
+        "webpack-sources": "^2.1.1"
+      },
+      "dependencies": {
+        "schema-utils": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.0.0.tgz",
+          "integrity": "sha512-6D82/xSzO094ajanoOSbe4YvXWMfn2A//8Y1+MUqFAJul5Bs+yn36xbK9OtNDcRVSBJ9jjeoXftM6CfztsjOAA==",
+          "dev": true,
+          "requires": {
+            "@types/json-schema": "^7.0.6",
+            "ajv": "^6.12.5",
+            "ajv-keywords": "^3.5.2"
+          }
+        }
+      }
+    },
+    "webpack-cli": {
+      "version": "4.5.0",
+      "resolved": "https://registry.npmjs.org/webpack-cli/-/webpack-cli-4.5.0.tgz",
+      "integrity": "sha512-wXg/ef6Ibstl2f50mnkcHblRPN/P9J4Nlod5Hg9HGFgSeF8rsqDGHJeVe4aR26q9l62TUJi6vmvC2Qz96YJw1Q==",
+      "dev": true,
+      "requires": {
+        "@discoveryjs/json-ext": "^0.5.0",
+        "@webpack-cli/configtest": "^1.0.1",
+        "@webpack-cli/info": "^1.2.2",
+        "@webpack-cli/serve": "^1.3.0",
+        "colorette": "^1.2.1",
+        "commander": "^7.0.0",
+        "enquirer": "^2.3.6",
+        "execa": "^5.0.0",
+        "fastest-levenshtein": "^1.0.12",
+        "import-local": "^3.0.2",
+        "interpret": "^2.2.0",
+        "rechoir": "^0.7.0",
+        "v8-compile-cache": "^2.2.0",
+        "webpack-merge": "^5.7.3"
+      },
+      "dependencies": {
+        "commander": {
+          "version": "7.1.0",
+          "resolved": "https://registry.npmjs.org/commander/-/commander-7.1.0.tgz",
+          "integrity": "sha512-pRxBna3MJe6HKnBGsDyMv8ETbptw3axEdYHoqNh7gu5oDcew8fs0xnivZGm06Ogk8zGAJ9VX+OPEr2GXEQK4dg==",
+          "dev": true
+        }
+      }
+    },
+    "webpack-dev-middleware": {
+      "version": "3.7.3",
+      "resolved": "https://registry.npmjs.org/webpack-dev-middleware/-/webpack-dev-middleware-3.7.3.tgz",
+      "integrity": "sha512-djelc/zGiz9nZj/U7PTBi2ViorGJXEWo/3ltkPbDyxCXhhEXkW0ce99falaok4TPj+AsxLiXJR0EBOb0zh9fKQ==",
+      "dev": true,
+      "requires": {
+        "memory-fs": "^0.4.1",
+        "mime": "^2.4.4",
+        "mkdirp": "^0.5.1",
+        "range-parser": "^1.2.1",
+        "webpack-log": "^2.0.0"
+      },
+      "dependencies": {
+        "mime": {
+          "version": "2.5.2",
+          "resolved": "https://registry.npmjs.org/mime/-/mime-2.5.2.tgz",
+          "integrity": "sha512-tqkh47FzKeCPD2PUiPB6pkbMzsCasjxAfC62/Wap5qrUWcb+sFasXUC5I3gYM5iBM8v/Qpn4UK0x+j0iHyFPDg==",
+          "dev": true
+        }
+      }
+    },
+    "webpack-dev-server": {
+      "version": "3.11.2",
+      "resolved": "https://registry.npmjs.org/webpack-dev-server/-/webpack-dev-server-3.11.2.tgz",
+      "integrity": "sha512-A80BkuHRQfCiNtGBS1EMf2ChTUs0x+B3wGDFmOeT4rmJOHhHTCH2naNxIHhmkr0/UillP4U3yeIyv1pNp+QDLQ==",
+      "dev": true,
+      "requires": {
+        "ansi-html": "0.0.7",
+        "bonjour": "^3.5.0",
+        "chokidar": "^2.1.8",
+        "compression": "^1.7.4",
+        "connect-history-api-fallback": "^1.6.0",
+        "debug": "^4.1.1",
+        "del": "^4.1.1",
+        "express": "^4.17.1",
+        "html-entities": "^1.3.1",
+        "http-proxy-middleware": "0.19.1",
+        "import-local": "^2.0.0",
+        "internal-ip": "^4.3.0",
+        "ip": "^1.1.5",
+        "is-absolute-url": "^3.0.3",
+        "killable": "^1.0.1",
+        "loglevel": "^1.6.8",
+        "opn": "^5.5.0",
+        "p-retry": "^3.0.1",
+        "portfinder": "^1.0.26",
+        "schema-utils": "^1.0.0",
+        "selfsigned": "^1.10.8",
+        "semver": "^6.3.0",
+        "serve-index": "^1.9.1",
+        "sockjs": "^0.3.21",
+        "sockjs-client": "^1.5.0",
+        "spdy": "^4.0.2",
+        "strip-ansi": "^3.0.1",
+        "supports-color": "^6.1.0",
+        "url": "^0.11.0",
+        "webpack-dev-middleware": "^3.7.2",
+        "webpack-log": "^2.0.0",
+        "ws": "^6.2.1",
+        "yargs": "^13.3.2"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-2.1.1.tgz",
+          "integrity": "sha1-w7M6te42DYbg5ijwRorn7yfWVN8=",
+          "dev": true
         },
-        "strip-eof": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/strip-eof/-/strip-eof-1.0.0.tgz",
-            "integrity": "sha1-u0P/VZim6wXYm1n80SnJgzE2Br8=",
-            "dev": true
+        "braces": {
+          "version": "2.3.2",
+          "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
+          "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
+          "dev": true,
+          "requires": {
+            "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"
+          }
         },
-        "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
+        "chokidar": {
+          "version": "2.1.8",
+          "resolved": "https://registry.npmjs.org/chokidar/-/chokidar-2.1.8.tgz",
+          "integrity": "sha512-ZmZUazfOzf0Nve7duiCKD23PFSCs4JPoYyccjUFF3aQkQadqBhfzhjkwBH2mNOG9cTBwhamM37EIsIkZw3nRgg==",
+          "dev": true,
+          "requires": {
+            "anymatch": "^2.0.0",
+            "async-each": "^1.0.1",
+            "braces": "^2.3.2",
+            "fsevents": "^1.2.7",
+            "glob-parent": "^3.1.0",
+            "inherits": "^2.0.3",
+            "is-binary-path": "^1.0.0",
+            "is-glob": "^4.0.0",
+            "normalize-path": "^3.0.0",
+            "path-is-absolute": "^1.0.0",
+            "readdirp": "^2.2.1",
+            "upath": "^1.1.1"
+          }
         },
-        "strip-json-comments": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/strip-json-comments/-/strip-json-comments-3.1.1.tgz",
-            "integrity": "sha512-6fPc+R4ihwqP6N/aIv2f1gMH8lOVtWQHoqC4yK6oSDVVocumAsfCqjkXnqiYMhmMwS/mEHLp7Vehlt3ql6lEig==",
-            "dev": true
+        "extend-shallow": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
+          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+          "dev": true,
+          "requires": {
+            "is-extendable": "^0.1.0"
+          }
         },
-        "supports-color": {
-            "version": "7.2.0",
-            "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-7.2.0.tgz",
-            "integrity": "sha512-qpCAvRl9stuOHveKsn7HncJRvv501qIacKzQlO/+Lwxc9+0q2wLyv4Dfvt80/DPn2pqOBsJdDiogXGR9+OvwRw==",
-            "dev": true,
-            "requires": {
-                "has-flag": "^4.0.0"
-            }
+        "fill-range": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
+          "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
+          "dev": true,
+          "requires": {
+            "extend-shallow": "^2.0.1",
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1",
+            "to-regex-range": "^2.1.0"
+          }
         },
-        "table": {
-            "version": "6.0.7",
-            "resolved": "https://registry.npmjs.org/table/-/table-6.0.7.tgz",
-            "integrity": "sha512-rxZevLGTUzWna/qBLObOe16kB2RTnnbhciwgPbMMlazz1yZGVEgnZK762xyVdVznhqxrfCeBMmMkgOOaPwjH7g==",
-            "dev": true,
-            "requires": {
-                "ajv": "^7.0.2",
-                "lodash": "^4.17.20",
-                "slice-ansi": "^4.0.0",
-                "string-width": "^4.2.0"
-            },
-            "dependencies": {
-                "ajv": {
-                    "version": "7.2.1",
-                    "resolved": "https://registry.npmjs.org/ajv/-/ajv-7.2.1.tgz",
-                    "integrity": "sha512-+nu0HDv7kNSOua9apAVc979qd932rrZeb3WOvoiD31A/p1mIE5/9bN2027pE2rOPYEdS3UHzsvof4hY+lM9/WQ==",
-                    "dev": true,
-                    "requires": {
-                        "fast-deep-equal": "^3.1.1",
-                        "json-schema-traverse": "^1.0.0",
-                        "require-from-string": "^2.0.2",
-                        "uri-js": "^4.2.2"
-                    }
-                },
-                "json-schema-traverse": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-1.0.0.tgz",
-                    "integrity": "sha512-NM8/P9n3XjXhIZn1lLhkFaACTOURQXjWhV4BA/RnOv8xvgqtqpAX9IO4mRQxSx1Rlo4tqzeqb0sOlruaOy3dug==",
-                    "dev": true
-                }
-            }
+        "find-up": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/find-up/-/find-up-3.0.0.tgz",
+          "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
+          "dev": true,
+          "requires": {
+            "locate-path": "^3.0.0"
+          }
         },
-        "tapable": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/tapable/-/tapable-2.2.0.tgz",
-            "integrity": "sha512-FBk4IesMV1rBxX2tfiK8RAmogtWn53puLOQlvO8XuwlgxcYbP4mVPS9Ph4aeamSyyVjOl24aYWAuc8U5kCVwMw==",
-            "dev": true
-        },
-        "terser": {
-            "version": "5.6.1",
-            "resolved": "https://registry.npmjs.org/terser/-/terser-5.6.1.tgz",
-            "integrity": "sha512-yv9YLFQQ+3ZqgWCUk+pvNJwgUTdlIxUk1WTN+RnaFJe2L7ipG2csPT0ra2XRm7Cs8cxN7QXmK1rFzEwYEQkzXw==",
-            "dev": true,
-            "requires": {
-                "commander": "^2.20.0",
-                "source-map": "~0.7.2",
-                "source-map-support": "~0.5.19"
-            },
-            "dependencies": {
-                "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
-                }
-            }
+        "fsevents": {
+          "version": "1.2.13",
+          "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-1.2.13.tgz",
+          "integrity": "sha512-oWb1Z6mkHIskLzEJ/XWX0srkpkTQ7vaopMQkyaEIoq0fmtFVxOthb8cCxeT+p3ynTdkk/RZwbgG4brR5BeWECw==",
+          "dev": true,
+          "optional": true,
+          "requires": {
+            "bindings": "^1.5.0",
+            "nan": "^2.12.1"
+          }
         },
-        "terser-webpack-plugin": {
-            "version": "5.1.1",
-            "resolved": "https://registry.npmjs.org/terser-webpack-plugin/-/terser-webpack-plugin-5.1.1.tgz",
-            "integrity": "sha512-5XNNXZiR8YO6X6KhSGXfY0QrGrCRlSwAEjIIrlRQR4W8nP69TaJUlh3bkuac6zzgspiGPfKEHcY295MMVExl5Q==",
-            "dev": true,
-            "requires": {
-                "jest-worker": "^26.6.2",
-                "p-limit": "^3.1.0",
-                "schema-utils": "^3.0.0",
-                "serialize-javascript": "^5.0.1",
-                "source-map": "^0.6.1",
-                "terser": "^5.5.1"
-            },
-            "dependencies": {
-                "p-limit": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/p-limit/-/p-limit-3.1.0.tgz",
-                    "integrity": "sha512-TYOanM3wGwNGsZN2cVTYPArw454xnXj5qmWF1bEoAc4+cU/ol7GVh7odevjp1FNHduHc3KZMcFduxU5Xc6uJRQ==",
-                    "dev": true,
-                    "requires": {
-                        "yocto-queue": "^0.1.0"
-                    }
-                },
-                "schema-utils": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.0.0.tgz",
-                    "integrity": "sha512-6D82/xSzO094ajanoOSbe4YvXWMfn2A//8Y1+MUqFAJul5Bs+yn36xbK9OtNDcRVSBJ9jjeoXftM6CfztsjOAA==",
-                    "dev": true,
-                    "requires": {
-                        "@types/json-schema": "^7.0.6",
-                        "ajv": "^6.12.5",
-                        "ajv-keywords": "^3.5.2"
-                    }
-                }
+        "glob-parent": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-3.1.0.tgz",
+          "integrity": "sha1-nmr2KZ2NO9K9QEMIMr0RPfkGxa4=",
+          "dev": true,
+          "requires": {
+            "is-glob": "^3.1.0",
+            "path-dirname": "^1.0.0"
+          },
+          "dependencies": {
+            "is-glob": {
+              "version": "3.1.0",
+              "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-3.1.0.tgz",
+              "integrity": "sha1-e6WuJCF4BKxwcHuWkiVnSGzD6Eo=",
+              "dev": true,
+              "requires": {
+                "is-extglob": "^2.1.0"
+              }
             }
+          }
         },
-        "text-table": {
-            "version": "0.2.0",
-            "resolved": "https://registry.npmjs.org/text-table/-/text-table-0.2.0.tgz",
-            "integrity": "sha1-f17oI66AUgfACvLfSoTsP8+lcLQ=",
-            "dev": true
-        },
-        "thunky": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/thunky/-/thunky-1.1.0.tgz",
-            "integrity": "sha512-eHY7nBftgThBqOyHGVN+l8gF0BucP09fMo0oO/Lb0w1OF80dJv+lDVpXG60WMQvkcxAkNybKsrEIE3ZtKGmPrA==",
-            "dev": true
-        },
-        "tiny-emitter": {
-            "version": "2.1.0",
-            "resolved": "https://registry.npmjs.org/tiny-emitter/-/tiny-emitter-2.1.0.tgz",
-            "integrity": "sha512-NB6Dk1A9xgQPMoGqC5CVXn123gWyte215ONT5Pp5a0yt4nlEoO1ZWeCwpncaekPHXO60i47ihFnZPiRPjRMq4Q=="
+        "has-flag": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-3.0.0.tgz",
+          "integrity": "sha1-tdRU3CGZriJWmfNGfloH87lVuv0=",
+          "dev": true
         },
-        "to-fast-properties": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/to-fast-properties/-/to-fast-properties-2.0.0.tgz",
-            "integrity": "sha1-3F5pjL0HkmW8c+A3doGk5Og/YW4=",
-            "dev": true
-        },
-        "to-object-path": {
-            "version": "0.3.0",
-            "resolved": "https://registry.npmjs.org/to-object-path/-/to-object-path-0.3.0.tgz",
-            "integrity": "sha1-KXWIt7Dn4KwI4E5nL4XB9JmeF68=",
-            "dev": true,
-            "requires": {
-                "kind-of": "^3.0.2"
-            },
-            "dependencies": {
-                "kind-of": {
-                    "version": "3.2.2",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                    "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                    "dev": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                }
-            }
+        "import-local": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/import-local/-/import-local-2.0.0.tgz",
+          "integrity": "sha512-b6s04m3O+s3CGSbqDIyP4R6aAwAeYlVq9+WUWep6iHa8ETRf9yei1U48C5MmfJmV9AiLYYBKPMq/W+/WRpQmCQ==",
+          "dev": true,
+          "requires": {
+            "pkg-dir": "^3.0.0",
+            "resolve-cwd": "^2.0.0"
+          }
         },
-        "to-regex": {
-            "version": "3.0.2",
-            "resolved": "https://registry.npmjs.org/to-regex/-/to-regex-3.0.2.tgz",
-            "integrity": "sha512-FWtleNAtZ/Ki2qtqej2CXTOayOH9bHDQF+Q48VpWyDXjbYxA4Yz8iDB31zXOBUlOHHKidDbqGVrTUvQMPmBGBw==",
-            "dev": true,
-            "requires": {
-                "define-property": "^2.0.2",
-                "extend-shallow": "^3.0.2",
-                "regex-not": "^1.0.2",
-                "safe-regex": "^1.1.0"
-            }
+        "is-number": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
+          "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
+          "dev": true,
+          "requires": {
+            "kind-of": "^3.0.2"
+          }
         },
-        "to-regex-range": {
-            "version": "5.0.1",
-            "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz",
-            "integrity": "sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==",
-            "dev": true,
-            "requires": {
-                "is-number": "^7.0.0"
-            }
+        "kind-of": {
+          "version": "3.2.2",
+          "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
+          "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
+          "dev": true,
+          "requires": {
+            "is-buffer": "^1.1.5"
+          }
         },
-        "toidentifier": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/toidentifier/-/toidentifier-1.0.0.tgz",
-            "integrity": "sha512-yaOH/Pk/VEhBWWTlhI+qXxDFXlejDGcQipMlyxda9nthulaxLZUNcUqFxokp0vcYnvteJln5FNQDRrxj3YcbVw==",
-            "dev": true
-        },
-        "tslib": {
-            "version": "1.14.1",
-            "resolved": "https://registry.npmjs.org/tslib/-/tslib-1.14.1.tgz",
-            "integrity": "sha512-Xni35NKzjgMrwevysHTCArtLDpPvye8zV/0E4EyYn43P7/7qvQwPh9BGkHewbMulVntbigmcT7rdX3BNo9wRJg==",
-            "dev": true
-        },
-        "tsutils": {
-            "version": "3.21.0",
-            "resolved": "https://registry.npmjs.org/tsutils/-/tsutils-3.21.0.tgz",
-            "integrity": "sha512-mHKK3iUXL+3UF6xL5k0PEhKRUBKPBCv/+RkEOpjRWxxx27KKRBmmA60A9pgOUvMi8GKhRMPEmjBRPzs2W7O1OA==",
-            "dev": true,
-            "requires": {
-                "tslib": "^1.8.1"
-            }
+        "locate-path": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-3.0.0.tgz",
+          "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
+          "dev": true,
+          "requires": {
+            "p-locate": "^3.0.0",
+            "path-exists": "^3.0.0"
+          }
         },
-        "type-check": {
-            "version": "0.4.0",
-            "resolved": "https://registry.npmjs.org/type-check/-/type-check-0.4.0.tgz",
-            "integrity": "sha512-XleUoc9uwGXqjWwXaUTZAmzMcFZ5858QA2vvx1Ur5xIcixXIP+8LnFDgRplU30us6teqdlskFfu+ae4K79Ooew==",
-            "dev": true,
-            "requires": {
-                "prelude-ls": "^1.2.1"
-            }
+        "p-locate": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-3.0.0.tgz",
+          "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
+          "dev": true,
+          "requires": {
+            "p-limit": "^2.0.0"
+          }
         },
-        "type-fest": {
-            "version": "0.8.1",
-            "resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.8.1.tgz",
-            "integrity": "sha512-4dbzIzqvjtgiM5rw1k5rEHtBANKmdudhGyBEajN01fEyhaAIhsoKNy6y7+IN93IfpFtwY9iqi7kD+xwKhQsNJA==",
-            "dev": true
-        },
-        "type-is": {
-            "version": "1.6.18",
-            "resolved": "https://registry.npmjs.org/type-is/-/type-is-1.6.18.tgz",
-            "integrity": "sha512-TkRKr9sUTxEH8MdfuCSP7VizJyzRNMjj2J2do2Jr3Kym598JVdEksuzPQCnlFPW4ky9Q+iA+ma9BGm06XQBy8g==",
-            "dev": true,
-            "requires": {
-                "media-typer": "0.3.0",
-                "mime-types": "~2.1.24"
-            }
+        "path-exists": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-3.0.0.tgz",
+          "integrity": "sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=",
+          "dev": true
         },
-        "typed-function": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-2.0.0.tgz",
-            "integrity": "sha512-Hhy1Iwo/e4AtLZNK10ewVVcP2UEs408DS35ubP825w/YgSBK1KVLwALvvIG4yX75QJrxjCpcWkzkVRB0BwwYlA=="
-        },
-        "typescript": {
-            "version": "4.2.3",
-            "resolved": "https://registry.npmjs.org/typescript/-/typescript-4.2.3.tgz",
-            "integrity": "sha512-qOcYwxaByStAWrBf4x0fibwZvMRG+r4cQoTjbPtUlrWjBHbmCAww1i448U0GJ+3cNNEtebDteo/cHOR3xJ4wEw==",
-            "dev": true
-        },
-        "unicode-canonical-property-names-ecmascript": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/unicode-canonical-property-names-ecmascript/-/unicode-canonical-property-names-ecmascript-1.0.4.tgz",
-            "integrity": "sha512-jDrNnXWHd4oHiTZnx/ZG7gtUTVp+gCcTTKr8L0HjlwphROEW3+Him+IpvC+xcJEFegapiMZyZe02CyuOnRmbnQ==",
-            "dev": true
-        },
-        "unicode-match-property-ecmascript": {
-            "version": "1.0.4",
-            "resolved": "https://registry.npmjs.org/unicode-match-property-ecmascript/-/unicode-match-property-ecmascript-1.0.4.tgz",
-            "integrity": "sha512-L4Qoh15vTfntsn4P1zqnHulG0LdXgjSO035fEpdtp6YxXhMT51Q6vgM5lYdG/5X3MjS+k/Y9Xw4SFCY9IkR0rg==",
-            "dev": true,
-            "requires": {
-                "unicode-canonical-property-names-ecmascript": "^1.0.4",
-                "unicode-property-aliases-ecmascript": "^1.0.4"
-            }
+        "pkg-dir": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/pkg-dir/-/pkg-dir-3.0.0.tgz",
+          "integrity": "sha512-/E57AYkoeQ25qkxMj5PBOVgF8Kiu/h7cYS30Z5+R7WaiCCBfLq58ZI/dSeaEKb9WVJV5n/03QwrN3IeWIFllvw==",
+          "dev": true,
+          "requires": {
+            "find-up": "^3.0.0"
+          }
         },
-        "unicode-match-property-value-ecmascript": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/unicode-match-property-value-ecmascript/-/unicode-match-property-value-ecmascript-1.2.0.tgz",
-            "integrity": "sha512-wjuQHGQVofmSJv1uVISKLE5zO2rNGzM/KCYZch/QQvez7C1hUhBIuZ701fYXExuufJFMPhv2SyL8CyoIfMLbIQ==",
-            "dev": true
-        },
-        "unicode-property-aliases-ecmascript": {
-            "version": "1.1.0",
-            "resolved": "https://registry.npmjs.org/unicode-property-aliases-ecmascript/-/unicode-property-aliases-ecmascript-1.1.0.tgz",
-            "integrity": "sha512-PqSoPh/pWetQ2phoj5RLiaqIk4kCNwoV3CI+LfGmWLKI3rE3kl1h59XpX2BjgDrmbxD9ARtQobPGU1SguCYuQg==",
-            "dev": true
-        },
-        "union-value": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/union-value/-/union-value-1.0.1.tgz",
-            "integrity": "sha512-tJfXmxMeWYnczCVs7XAEvIV7ieppALdyepWMkHkwciRpZraG/xwT+s2JN8+pr1+8jCRf80FFzvr+MpQeeoF4Xg==",
-            "dev": true,
-            "requires": {
-                "arr-union": "^3.1.0",
-                "get-value": "^2.0.6",
-                "is-extendable": "^0.1.1",
-                "set-value": "^2.0.1"
-            }
+        "resolve-cwd": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/resolve-cwd/-/resolve-cwd-2.0.0.tgz",
+          "integrity": "sha1-AKn3OHVW4nA46uIyyqNypqWbZlo=",
+          "dev": true,
+          "requires": {
+            "resolve-from": "^3.0.0"
+          }
         },
-        "unpipe": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/unpipe/-/unpipe-1.0.0.tgz",
-            "integrity": "sha1-sr9O6FFKrmFltIF4KdIbLvSZBOw=",
-            "dev": true
-        },
-        "unset-value": {
-            "version": "1.0.0",
-            "resolved": "https://registry.npmjs.org/unset-value/-/unset-value-1.0.0.tgz",
-            "integrity": "sha1-g3aHP30jNRef+x5vw6jtDfyKtVk=",
-            "dev": true,
-            "requires": {
-                "has-value": "^0.3.1",
-                "isobject": "^3.0.0"
-            },
-            "dependencies": {
-                "has-value": {
-                    "version": "0.3.1",
-                    "resolved": "https://registry.npmjs.org/has-value/-/has-value-0.3.1.tgz",
-                    "integrity": "sha1-ex9YutpiyoJ+wKIHgCVlSEWZXh8=",
-                    "dev": true,
-                    "requires": {
-                        "get-value": "^2.0.3",
-                        "has-values": "^0.1.4",
-                        "isobject": "^2.0.0"
-                    },
-                    "dependencies": {
-                        "isobject": {
-                            "version": "2.1.0",
-                            "resolved": "https://registry.npmjs.org/isobject/-/isobject-2.1.0.tgz",
-                            "integrity": "sha1-8GVWEJaj8dou9GJy+BXIQNh+DIk=",
-                            "dev": true,
-                            "requires": {
-                                "isarray": "1.0.0"
-                            }
-                        }
-                    }
-                },
-                "has-values": {
-                    "version": "0.1.4",
-                    "resolved": "https://registry.npmjs.org/has-values/-/has-values-0.1.4.tgz",
-                    "integrity": "sha1-bWHeldkd/Km5oCCJrThL/49it3E=",
-                    "dev": true
-                }
-            }
+        "resolve-from": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/resolve-from/-/resolve-from-3.0.0.tgz",
+          "integrity": "sha1-six699nWiBvItuZTM17rywoYh0g=",
+          "dev": true
         },
-        "upath": {
-            "version": "1.2.0",
-            "resolved": "https://registry.npmjs.org/upath/-/upath-1.2.0.tgz",
-            "integrity": "sha512-aZwGpamFO61g3OlfT7OQCHqhGnW43ieH9WZeP7QxN/G/jS4jfqUkZxoryvJgVPEcrl5NL/ggHsSmLMHuH64Lhg==",
-            "dev": true
-        },
-        "uri-js": {
-            "version": "4.4.1",
-            "resolved": "https://registry.npmjs.org/uri-js/-/uri-js-4.4.1.tgz",
-            "integrity": "sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==",
-            "dev": true,
-            "requires": {
-                "punycode": "^2.1.0"
-            }
+        "schema-utils": {
+          "version": "1.0.0",
+          "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-1.0.0.tgz",
+          "integrity": "sha512-i27Mic4KovM/lnGsy8whRCHhc7VicJajAjTrYg11K9zfZXnYIt4k5F+kZkwjnrhKzLic/HLU4j11mjsz2G/75g==",
+          "dev": true,
+          "requires": {
+            "ajv": "^6.1.0",
+            "ajv-errors": "^1.0.0",
+            "ajv-keywords": "^3.1.0"
+          }
         },
-        "urix": {
-            "version": "0.1.0",
-            "resolved": "https://registry.npmjs.org/urix/-/urix-0.1.0.tgz",
-            "integrity": "sha1-2pN/emLiH+wf0Y1Js1wpNQZ6bHI=",
-            "dev": true
-        },
-        "url": {
-            "version": "0.11.0",
-            "resolved": "https://registry.npmjs.org/url/-/url-0.11.0.tgz",
-            "integrity": "sha1-ODjpfPxgUh63PFJajlW/3Z4uKPE=",
-            "dev": true,
-            "requires": {
-                "punycode": "1.3.2",
-                "querystring": "0.2.0"
-            },
-            "dependencies": {
-                "punycode": {
-                    "version": "1.3.2",
-                    "resolved": "https://registry.npmjs.org/punycode/-/punycode-1.3.2.tgz",
-                    "integrity": "sha1-llOgNvt8HuQjQvIyXM7v6jkmxI0=",
-                    "dev": true
-                }
-            }
+        "semver": {
+          "version": "6.3.0",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
+          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "dev": true
         },
-        "url-parse": {
-            "version": "1.5.1",
-            "resolved": "https://registry.npmjs.org/url-parse/-/url-parse-1.5.1.tgz",
-            "integrity": "sha512-HOfCOUJt7iSYzEx/UqgtwKRMC6EU91NFhsCHMv9oM03VJcVo2Qrp8T8kI9D7amFf1cu+/3CEhgb3rF9zL7k85Q==",
-            "dev": true,
-            "requires": {
-                "querystringify": "^2.1.1",
-                "requires-port": "^1.0.0"
-            }
+        "strip-ansi": {
+          "version": "3.0.1",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-3.0.1.tgz",
+          "integrity": "sha1-ajhfuIU9lS1f8F0Oiq+UJ43GPc8=",
+          "dev": true,
+          "requires": {
+            "ansi-regex": "^2.0.0"
+          }
         },
-        "use": {
-            "version": "3.1.1",
-            "resolved": "https://registry.npmjs.org/use/-/use-3.1.1.tgz",
-            "integrity": "sha512-cwESVXlO3url9YWlFW/TA9cshCEhtu7IKJ/p5soJ/gGpj7vbvFrAY/eIioQ6Dw23KjZhYgiIo8HOs1nQ2vr/oQ==",
-            "dev": true
-        },
-        "util-deprecate": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/util-deprecate/-/util-deprecate-1.0.2.tgz",
-            "integrity": "sha1-RQ1Nyfpw3nMnYvvS1KKJgUGaDM8=",
-            "dev": true
-        },
-        "utils-merge": {
-            "version": "1.0.1",
-            "resolved": "https://registry.npmjs.org/utils-merge/-/utils-merge-1.0.1.tgz",
-            "integrity": "sha1-n5VxD1CiZ5R7LMwSR0HBAoQn5xM=",
-            "dev": true
-        },
-        "uuid": {
-            "version": "3.4.0",
-            "resolved": "https://registry.npmjs.org/uuid/-/uuid-3.4.0.tgz",
-            "integrity": "sha512-HjSDRw6gZE5JMggctHBcjVak08+KEVhSIiDzFnT9S9aegmp85S/bReBVTb4QTFaRNptJ9kuYaNhnbNEOkbKb/A==",
-            "dev": true
-        },
-        "v8-compile-cache": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/v8-compile-cache/-/v8-compile-cache-2.2.0.tgz",
-            "integrity": "sha512-gTpR5XQNKFwOd4clxfnhaqvfqMpqEwr4tOtCyz4MtYZX2JYhfr1JvBFKdS+7K/9rfpZR3VLX+YWBbKoxCgS43Q==",
-            "dev": true
-        },
-        "vary": {
-            "version": "1.1.2",
-            "resolved": "https://registry.npmjs.org/vary/-/vary-1.1.2.tgz",
-            "integrity": "sha1-IpnwLG3tMNSllhsLn3RSShj2NPw=",
-            "dev": true
-        },
-        "watchpack": {
-            "version": "2.1.1",
-            "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.1.1.tgz",
-            "integrity": "sha512-Oo7LXCmc1eE1AjyuSBmtC3+Wy4HcV8PxWh2kP6fOl8yTlNS7r0K9l1ao2lrrUza7V39Y3D/BbJgY8VeSlc5JKw==",
-            "dev": true,
-            "requires": {
-                "glob-to-regexp": "^0.4.1",
-                "graceful-fs": "^4.1.2"
-            }
+        "supports-color": {
+          "version": "6.1.0",
+          "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-6.1.0.tgz",
+          "integrity": "sha512-qe1jfm1Mg7Nq/NSh6XE24gPXROEVsWHxC1LIx//XNlD9iw7YZQGjZNjYN7xGaEG6iKdA8EtNFW6R0gjnVXp+wQ==",
+          "dev": true,
+          "requires": {
+            "has-flag": "^3.0.0"
+          }
         },
-        "wbuf": {
-            "version": "1.7.3",
-            "resolved": "https://registry.npmjs.org/wbuf/-/wbuf-1.7.3.tgz",
-            "integrity": "sha512-O84QOnr0icsbFGLS0O3bI5FswxzRr8/gHwWkDlQFskhSPryQXvrTMxjxGP4+iWYoauLoBvfDpkrOauZ+0iZpDA==",
-            "dev": true,
-            "requires": {
-                "minimalistic-assert": "^1.0.0"
-            }
+        "to-regex-range": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
+          "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
+          "dev": true,
+          "requires": {
+            "is-number": "^3.0.0",
+            "repeat-string": "^1.6.1"
+          }
+        }
+      }
+    },
+    "webpack-log": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/webpack-log/-/webpack-log-2.0.0.tgz",
+      "integrity": "sha512-cX8G2vR/85UYG59FgkoMamwHUIkSSlV3bBMRsbxVXVUk2j6NleCKjQ/WE9eYg9WY4w25O9w8wKP4rzNZFmUcUg==",
+      "dev": true,
+      "requires": {
+        "ansi-colors": "^3.0.0",
+        "uuid": "^3.3.2"
+      },
+      "dependencies": {
+        "ansi-colors": {
+          "version": "3.2.4",
+          "resolved": "https://registry.npmjs.org/ansi-colors/-/ansi-colors-3.2.4.tgz",
+          "integrity": "sha512-hHUXGagefjN2iRrID63xckIvotOXOojhQKWIPUZ4mNUZ9nLZW+7FMNoE1lOkEhNWYsx/7ysGIuJYCiMAA9FnrA==",
+          "dev": true
+        }
+      }
+    },
+    "webpack-merge": {
+      "version": "5.7.3",
+      "resolved": "https://registry.npmjs.org/webpack-merge/-/webpack-merge-5.7.3.tgz",
+      "integrity": "sha512-6/JUQv0ELQ1igjGDzHkXbVDRxkfA57Zw7PfiupdLFJYrgFqY5ZP8xxbpp2lU3EPwYx89ht5Z/aDkD40hFCm5AA==",
+      "dev": true,
+      "requires": {
+        "clone-deep": "^4.0.1",
+        "wildcard": "^2.0.0"
+      }
+    },
+    "webpack-sources": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/webpack-sources/-/webpack-sources-2.2.0.tgz",
+      "integrity": "sha512-bQsA24JLwcnWGArOKUxYKhX3Mz/nK1Xf6hxullKERyktjNMC4x8koOeaDNTA2fEJ09BdWLbM/iTW0ithREUP0w==",
+      "dev": true,
+      "requires": {
+        "source-list-map": "^2.0.1",
+        "source-map": "^0.6.1"
+      }
+    },
+    "websocket-driver": {
+      "version": "0.7.4",
+      "resolved": "https://registry.npmjs.org/websocket-driver/-/websocket-driver-0.7.4.tgz",
+      "integrity": "sha512-b17KeDIQVjvb0ssuSDF2cYXSg2iztliJ4B9WdsuB6J952qCPKmnVq4DyW5motImXHDC1cBT/1UezrJVsKw5zjg==",
+      "dev": true,
+      "requires": {
+        "http-parser-js": ">=0.5.1",
+        "safe-buffer": ">=5.1.0",
+        "websocket-extensions": ">=0.1.1"
+      }
+    },
+    "websocket-extensions": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/websocket-extensions/-/websocket-extensions-0.1.4.tgz",
+      "integrity": "sha512-OqedPIGOfsDlo31UNwYbCFMSaO9m9G/0faIHj5/dZFDMFqPTcx6UwqyOy3COEaEOg/9VsGIpdqn62W5KhoKSpg==",
+      "dev": true
+    },
+    "which": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/which/-/which-2.0.2.tgz",
+      "integrity": "sha512-BLI3Tl1TW3Pvl70l3yq3Y64i+awpwXqsGBYWkkqMtnbXgrMD+yj7rhW0kuEDxzJaYXGjEW5ogapKNMEKNMjibA==",
+      "dev": true,
+      "requires": {
+        "isexe": "^2.0.0"
+      }
+    },
+    "which-boxed-primitive": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/which-boxed-primitive/-/which-boxed-primitive-1.0.2.tgz",
+      "integrity": "sha512-bwZdv0AKLpplFY2KZRX6TvyuN7ojjr7lwkg6ml0roIy9YeuSr7JS372qlNW18UQYzgYK9ziGcerWqZOmEn9VNg==",
+      "requires": {
+        "is-bigint": "^1.0.1",
+        "is-boolean-object": "^1.1.0",
+        "is-number-object": "^1.0.4",
+        "is-string": "^1.0.5",
+        "is-symbol": "^1.0.3"
+      }
+    },
+    "which-module": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/which-module/-/which-module-2.0.0.tgz",
+      "integrity": "sha1-2e8H3Od7mQK4o6j6SzHD4/fm6Ho=",
+      "dev": true
+    },
+    "which-typed-array": {
+      "version": "1.1.6",
+      "resolved": "https://registry.npmjs.org/which-typed-array/-/which-typed-array-1.1.6.tgz",
+      "integrity": "sha512-DdY984dGD5sQ7Tf+x1CkXzdg85b9uEel6nr4UkFg1LoE9OXv3uRuZhe5CoWdawhGACeFpEZXH8fFLQnDhbpm/Q==",
+      "requires": {
+        "available-typed-arrays": "^1.0.4",
+        "call-bind": "^1.0.2",
+        "es-abstract": "^1.18.5",
+        "foreach": "^2.0.5",
+        "has-tostringtag": "^1.0.0",
+        "is-typed-array": "^1.1.6"
+      }
+    },
+    "wildcard": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/wildcard/-/wildcard-2.0.0.tgz",
+      "integrity": "sha512-JcKqAHLPxcdb9KM49dufGXn2x3ssnfjbcaQdLlfZsL9rH9wgDQjUtDxbo8NE0F6SFvydeu1VhZe7hZuHsB2/pw==",
+      "dev": true
+    },
+    "word-wrap": {
+      "version": "1.2.3",
+      "resolved": "https://registry.npmjs.org/word-wrap/-/word-wrap-1.2.3.tgz",
+      "integrity": "sha512-Hz/mrNwitNRh/HUAtM/VT/5VH+ygD6DV7mYKZAtHOrbs8U7lvPS6xf7EJKMF0uW1KJCl0H701g3ZGus+muE5vQ=="
+    },
+    "wrap-ansi": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmjs.org/wrap-ansi/-/wrap-ansi-5.1.0.tgz",
+      "integrity": "sha512-QC1/iN/2/RPVJ5jYK8BGttj5z83LmSKmvbvrXPNCLZSEb32KKVDJDl/MOt2N01qU2H/FkzEa9PKto1BqDjtd7Q==",
+      "dev": true,
+      "requires": {
+        "ansi-styles": "^3.2.0",
+        "string-width": "^3.0.0",
+        "strip-ansi": "^5.0.0"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
+          "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
+          "dev": true
         },
-        "webpack": {
-            "version": "5.26.3",
-            "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.26.3.tgz",
-            "integrity": "sha512-z/F2lt2N1fZqaud1B4SzjL3OW03eULThbBXQ2OX4LSrZX4N9k1A5d0Rje3zS2g887DTWyAV0KGqEf64ois2dhg==",
-            "dev": true,
-            "requires": {
-                "@types/eslint-scope": "^3.7.0",
-                "@types/estree": "^0.0.46",
-                "@webassemblyjs/ast": "1.11.0",
-                "@webassemblyjs/wasm-edit": "1.11.0",
-                "@webassemblyjs/wasm-parser": "1.11.0",
-                "acorn": "^8.0.4",
-                "browserslist": "^4.14.5",
-                "chrome-trace-event": "^1.0.2",
-                "enhanced-resolve": "^5.7.0",
-                "es-module-lexer": "^0.4.0",
-                "eslint-scope": "^5.1.1",
-                "events": "^3.2.0",
-                "glob-to-regexp": "^0.4.1",
-                "graceful-fs": "^4.2.4",
-                "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.0.0",
-                "tapable": "^2.1.1",
-                "terser-webpack-plugin": "^5.1.1",
-                "watchpack": "^2.0.0",
-                "webpack-sources": "^2.1.1"
-            },
-            "dependencies": {
-                "schema-utils": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.0.0.tgz",
-                    "integrity": "sha512-6D82/xSzO094ajanoOSbe4YvXWMfn2A//8Y1+MUqFAJul5Bs+yn36xbK9OtNDcRVSBJ9jjeoXftM6CfztsjOAA==",
-                    "dev": true,
-                    "requires": {
-                        "@types/json-schema": "^7.0.6",
-                        "ajv": "^6.12.5",
-                        "ajv-keywords": "^3.5.2"
-                    }
-                }
-            }
+        "ansi-styles": {
+          "version": "3.2.1",
+          "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz",
+          "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
+          "dev": true,
+          "requires": {
+            "color-convert": "^1.9.0"
+          }
         },
-        "webpack-cli": {
-            "version": "4.5.0",
-            "resolved": "https://registry.npmjs.org/webpack-cli/-/webpack-cli-4.5.0.tgz",
-            "integrity": "sha512-wXg/ef6Ibstl2f50mnkcHblRPN/P9J4Nlod5Hg9HGFgSeF8rsqDGHJeVe4aR26q9l62TUJi6vmvC2Qz96YJw1Q==",
-            "dev": true,
-            "requires": {
-                "@discoveryjs/json-ext": "^0.5.0",
-                "@webpack-cli/configtest": "^1.0.1",
-                "@webpack-cli/info": "^1.2.2",
-                "@webpack-cli/serve": "^1.3.0",
-                "colorette": "^1.2.1",
-                "commander": "^7.0.0",
-                "enquirer": "^2.3.6",
-                "execa": "^5.0.0",
-                "fastest-levenshtein": "^1.0.12",
-                "import-local": "^3.0.2",
-                "interpret": "^2.2.0",
-                "rechoir": "^0.7.0",
-                "v8-compile-cache": "^2.2.0",
-                "webpack-merge": "^5.7.3"
-            },
-            "dependencies": {
-                "commander": {
-                    "version": "7.1.0",
-                    "resolved": "https://registry.npmjs.org/commander/-/commander-7.1.0.tgz",
-                    "integrity": "sha512-pRxBna3MJe6HKnBGsDyMv8ETbptw3axEdYHoqNh7gu5oDcew8fs0xnivZGm06Ogk8zGAJ9VX+OPEr2GXEQK4dg==",
-                    "dev": true
-                }
-            }
+        "color-convert": {
+          "version": "1.9.3",
+          "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz",
+          "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
+          "dev": true,
+          "requires": {
+            "color-name": "1.1.3"
+          }
         },
-        "webpack-dev-middleware": {
-            "version": "3.7.3",
-            "resolved": "https://registry.npmjs.org/webpack-dev-middleware/-/webpack-dev-middleware-3.7.3.tgz",
-            "integrity": "sha512-djelc/zGiz9nZj/U7PTBi2ViorGJXEWo/3ltkPbDyxCXhhEXkW0ce99falaok4TPj+AsxLiXJR0EBOb0zh9fKQ==",
-            "dev": true,
-            "requires": {
-                "memory-fs": "^0.4.1",
-                "mime": "^2.4.4",
-                "mkdirp": "^0.5.1",
-                "range-parser": "^1.2.1",
-                "webpack-log": "^2.0.0"
-            },
-            "dependencies": {
-                "mime": {
-                    "version": "2.5.2",
-                    "resolved": "https://registry.npmjs.org/mime/-/mime-2.5.2.tgz",
-                    "integrity": "sha512-tqkh47FzKeCPD2PUiPB6pkbMzsCasjxAfC62/Wap5qrUWcb+sFasXUC5I3gYM5iBM8v/Qpn4UK0x+j0iHyFPDg==",
-                    "dev": true
-                }
-            }
+        "color-name": {
+          "version": "1.1.3",
+          "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz",
+          "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=",
+          "dev": true
         },
-        "webpack-dev-server": {
-            "version": "3.11.2",
-            "resolved": "https://registry.npmjs.org/webpack-dev-server/-/webpack-dev-server-3.11.2.tgz",
-            "integrity": "sha512-A80BkuHRQfCiNtGBS1EMf2ChTUs0x+B3wGDFmOeT4rmJOHhHTCH2naNxIHhmkr0/UillP4U3yeIyv1pNp+QDLQ==",
-            "dev": true,
-            "requires": {
-                "ansi-html": "0.0.7",
-                "bonjour": "^3.5.0",
-                "chokidar": "^2.1.8",
-                "compression": "^1.7.4",
-                "connect-history-api-fallback": "^1.6.0",
-                "debug": "^4.1.1",
-                "del": "^4.1.1",
-                "express": "^4.17.1",
-                "html-entities": "^1.3.1",
-                "http-proxy-middleware": "0.19.1",
-                "import-local": "^2.0.0",
-                "internal-ip": "^4.3.0",
-                "ip": "^1.1.5",
-                "is-absolute-url": "^3.0.3",
-                "killable": "^1.0.1",
-                "loglevel": "^1.6.8",
-                "opn": "^5.5.0",
-                "p-retry": "^3.0.1",
-                "portfinder": "^1.0.26",
-                "schema-utils": "^1.0.0",
-                "selfsigned": "^1.10.8",
-                "semver": "^6.3.0",
-                "serve-index": "^1.9.1",
-                "sockjs": "^0.3.21",
-                "sockjs-client": "^1.5.0",
-                "spdy": "^4.0.2",
-                "strip-ansi": "^3.0.1",
-                "supports-color": "^6.1.0",
-                "url": "^0.11.0",
-                "webpack-dev-middleware": "^3.7.2",
-                "webpack-log": "^2.0.0",
-                "ws": "^6.2.1",
-                "yargs": "^13.3.2"
-            },
-            "dependencies": {
-                "ansi-regex": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-2.1.1.tgz",
-                    "integrity": "sha1-w7M6te42DYbg5ijwRorn7yfWVN8=",
-                    "dev": true
-                },
-                "braces": {
-                    "version": "2.3.2",
-                    "resolved": "https://registry.npmjs.org/braces/-/braces-2.3.2.tgz",
-                    "integrity": "sha512-aNdbnj9P8PjdXU4ybaWLK2IF3jc/EoDYbC7AazW6to3TRsfXxscC9UXOB5iDiEQrkyIbWp2SLQda4+QAa7nc3w==",
-                    "dev": true,
-                    "requires": {
-                        "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"
-                    }
-                },
-                "chokidar": {
-                    "version": "2.1.8",
-                    "resolved": "https://registry.npmjs.org/chokidar/-/chokidar-2.1.8.tgz",
-                    "integrity": "sha512-ZmZUazfOzf0Nve7duiCKD23PFSCs4JPoYyccjUFF3aQkQadqBhfzhjkwBH2mNOG9cTBwhamM37EIsIkZw3nRgg==",
-                    "dev": true,
-                    "requires": {
-                        "anymatch": "^2.0.0",
-                        "async-each": "^1.0.1",
-                        "braces": "^2.3.2",
-                        "fsevents": "^1.2.7",
-                        "glob-parent": "^3.1.0",
-                        "inherits": "^2.0.3",
-                        "is-binary-path": "^1.0.0",
-                        "is-glob": "^4.0.0",
-                        "normalize-path": "^3.0.0",
-                        "path-is-absolute": "^1.0.0",
-                        "readdirp": "^2.2.1",
-                        "upath": "^1.1.1"
-                    }
-                },
-                "extend-shallow": {
-                    "version": "2.0.1",
-                    "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-                    "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-                    "dev": true,
-                    "requires": {
-                        "is-extendable": "^0.1.0"
-                    }
-                },
-                "fill-range": {
-                    "version": "4.0.0",
-                    "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-4.0.0.tgz",
-                    "integrity": "sha1-1USBHUKPmOsGpj3EAtJAPDKMOPc=",
-                    "dev": true,
-                    "requires": {
-                        "extend-shallow": "^2.0.1",
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1",
-                        "to-regex-range": "^2.1.0"
-                    }
-                },
-                "find-up": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/find-up/-/find-up-3.0.0.tgz",
-                    "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
-                    "dev": true,
-                    "requires": {
-                        "locate-path": "^3.0.0"
-                    }
-                },
-                "fsevents": {
-                    "version": "1.2.13",
-                    "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-1.2.13.tgz",
-                    "integrity": "sha512-oWb1Z6mkHIskLzEJ/XWX0srkpkTQ7vaopMQkyaEIoq0fmtFVxOthb8cCxeT+p3ynTdkk/RZwbgG4brR5BeWECw==",
-                    "dev": true,
-                    "optional": true,
-                    "requires": {
-                        "bindings": "^1.5.0",
-                        "nan": "^2.12.1"
-                    }
-                },
-                "glob-parent": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-3.1.0.tgz",
-                    "integrity": "sha1-nmr2KZ2NO9K9QEMIMr0RPfkGxa4=",
-                    "dev": true,
-                    "requires": {
-                        "is-glob": "^3.1.0",
-                        "path-dirname": "^1.0.0"
-                    },
-                    "dependencies": {
-                        "is-glob": {
-                            "version": "3.1.0",
-                            "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-3.1.0.tgz",
-                            "integrity": "sha1-e6WuJCF4BKxwcHuWkiVnSGzD6Eo=",
-                            "dev": true,
-                            "requires": {
-                                "is-extglob": "^2.1.0"
-                            }
-                        }
-                    }
-                },
-                "has-flag": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-3.0.0.tgz",
-                    "integrity": "sha1-tdRU3CGZriJWmfNGfloH87lVuv0=",
-                    "dev": true
-                },
-                "import-local": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/import-local/-/import-local-2.0.0.tgz",
-                    "integrity": "sha512-b6s04m3O+s3CGSbqDIyP4R6aAwAeYlVq9+WUWep6iHa8ETRf9yei1U48C5MmfJmV9AiLYYBKPMq/W+/WRpQmCQ==",
-                    "dev": true,
-                    "requires": {
-                        "pkg-dir": "^3.0.0",
-                        "resolve-cwd": "^2.0.0"
-                    }
-                },
-                "is-number": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/is-number/-/is-number-3.0.0.tgz",
-                    "integrity": "sha1-JP1iAaR4LPUFYcgQJ2r8fRLXEZU=",
-                    "dev": true,
-                    "requires": {
-                        "kind-of": "^3.0.2"
-                    }
-                },
-                "kind-of": {
-                    "version": "3.2.2",
-                    "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-3.2.2.tgz",
-                    "integrity": "sha1-MeohpzS6ubuw8yRm2JOupR5KPGQ=",
-                    "dev": true,
-                    "requires": {
-                        "is-buffer": "^1.1.5"
-                    }
-                },
-                "locate-path": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-3.0.0.tgz",
-                    "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
-                    "dev": true,
-                    "requires": {
-                        "p-locate": "^3.0.0",
-                        "path-exists": "^3.0.0"
-                    }
-                },
-                "p-locate": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-3.0.0.tgz",
-                    "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
-                    "dev": true,
-                    "requires": {
-                        "p-limit": "^2.0.0"
-                    }
-                },
-                "path-exists": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-3.0.0.tgz",
-                    "integrity": "sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=",
-                    "dev": true
-                },
-                "pkg-dir": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/pkg-dir/-/pkg-dir-3.0.0.tgz",
-                    "integrity": "sha512-/E57AYkoeQ25qkxMj5PBOVgF8Kiu/h7cYS30Z5+R7WaiCCBfLq58ZI/dSeaEKb9WVJV5n/03QwrN3IeWIFllvw==",
-                    "dev": true,
-                    "requires": {
-                        "find-up": "^3.0.0"
-                    }
-                },
-                "resolve-cwd": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/resolve-cwd/-/resolve-cwd-2.0.0.tgz",
-                    "integrity": "sha1-AKn3OHVW4nA46uIyyqNypqWbZlo=",
-                    "dev": true,
-                    "requires": {
-                        "resolve-from": "^3.0.0"
-                    }
-                },
-                "resolve-from": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/resolve-from/-/resolve-from-3.0.0.tgz",
-                    "integrity": "sha1-six699nWiBvItuZTM17rywoYh0g=",
-                    "dev": true
-                },
-                "schema-utils": {
-                    "version": "1.0.0",
-                    "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-1.0.0.tgz",
-                    "integrity": "sha512-i27Mic4KovM/lnGsy8whRCHhc7VicJajAjTrYg11K9zfZXnYIt4k5F+kZkwjnrhKzLic/HLU4j11mjsz2G/75g==",
-                    "dev": true,
-                    "requires": {
-                        "ajv": "^6.1.0",
-                        "ajv-errors": "^1.0.0",
-                        "ajv-keywords": "^3.1.0"
-                    }
-                },
-                "semver": {
-                    "version": "6.3.0",
-                    "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-                    "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
-                    "dev": true
-                },
-                "strip-ansi": {
-                    "version": "3.0.1",
-                    "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-3.0.1.tgz",
-                    "integrity": "sha1-ajhfuIU9lS1f8F0Oiq+UJ43GPc8=",
-                    "dev": true,
-                    "requires": {
-                        "ansi-regex": "^2.0.0"
-                    }
-                },
-                "supports-color": {
-                    "version": "6.1.0",
-                    "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-6.1.0.tgz",
-                    "integrity": "sha512-qe1jfm1Mg7Nq/NSh6XE24gPXROEVsWHxC1LIx//XNlD9iw7YZQGjZNjYN7xGaEG6iKdA8EtNFW6R0gjnVXp+wQ==",
-                    "dev": true,
-                    "requires": {
-                        "has-flag": "^3.0.0"
-                    }
-                },
-                "to-regex-range": {
-                    "version": "2.1.1",
-                    "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-2.1.1.tgz",
-                    "integrity": "sha1-fIDBe53+vlmeJzZ+DU3VWQFB2zg=",
-                    "dev": true,
-                    "requires": {
-                        "is-number": "^3.0.0",
-                        "repeat-string": "^1.6.1"
-                    }
-                }
-            }
+        "emoji-regex": {
+          "version": "7.0.3",
+          "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
+          "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
+          "dev": true
         },
-        "webpack-log": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/webpack-log/-/webpack-log-2.0.0.tgz",
-            "integrity": "sha512-cX8G2vR/85UYG59FgkoMamwHUIkSSlV3bBMRsbxVXVUk2j6NleCKjQ/WE9eYg9WY4w25O9w8wKP4rzNZFmUcUg==",
-            "dev": true,
-            "requires": {
-                "ansi-colors": "^3.0.0",
-                "uuid": "^3.3.2"
-            },
-            "dependencies": {
-                "ansi-colors": {
-                    "version": "3.2.4",
-                    "resolved": "https://registry.npmjs.org/ansi-colors/-/ansi-colors-3.2.4.tgz",
-                    "integrity": "sha512-hHUXGagefjN2iRrID63xckIvotOXOojhQKWIPUZ4mNUZ9nLZW+7FMNoE1lOkEhNWYsx/7ysGIuJYCiMAA9FnrA==",
-                    "dev": true
-                }
-            }
+        "is-fullwidth-code-point": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
+          "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
+          "dev": true
         },
-        "webpack-merge": {
-            "version": "5.7.3",
-            "resolved": "https://registry.npmjs.org/webpack-merge/-/webpack-merge-5.7.3.tgz",
-            "integrity": "sha512-6/JUQv0ELQ1igjGDzHkXbVDRxkfA57Zw7PfiupdLFJYrgFqY5ZP8xxbpp2lU3EPwYx89ht5Z/aDkD40hFCm5AA==",
-            "dev": true,
-            "requires": {
-                "clone-deep": "^4.0.1",
-                "wildcard": "^2.0.0"
-            }
+        "string-width": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
+          "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
+          "dev": true,
+          "requires": {
+            "emoji-regex": "^7.0.1",
+            "is-fullwidth-code-point": "^2.0.0",
+            "strip-ansi": "^5.1.0"
+          }
         },
-        "webpack-sources": {
-            "version": "2.2.0",
-            "resolved": "https://registry.npmjs.org/webpack-sources/-/webpack-sources-2.2.0.tgz",
-            "integrity": "sha512-bQsA24JLwcnWGArOKUxYKhX3Mz/nK1Xf6hxullKERyktjNMC4x8koOeaDNTA2fEJ09BdWLbM/iTW0ithREUP0w==",
-            "dev": true,
-            "requires": {
-                "source-list-map": "^2.0.1",
-                "source-map": "^0.6.1"
-            }
+        "strip-ansi": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
+          "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
+          "dev": true,
+          "requires": {
+            "ansi-regex": "^4.1.0"
+          }
+        }
+      }
+    },
+    "wrappy": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/wrappy/-/wrappy-1.0.2.tgz",
+      "integrity": "sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=",
+      "dev": true
+    },
+    "ws": {
+      "version": "6.2.2",
+      "resolved": "https://registry.npmjs.org/ws/-/ws-6.2.2.tgz",
+      "integrity": "sha512-zmhltoSR8u1cnDsD43TX59mzoMZsLKqUweyYBAIvTngR3shc0W6aOZylZmq/7hqyVxPdi+5Ud2QInblgyE72fw==",
+      "dev": true,
+      "requires": {
+        "async-limiter": "~1.0.0"
+      }
+    },
+    "xtend": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/xtend/-/xtend-4.0.2.tgz",
+      "integrity": "sha512-LKYU1iAXJXUgAXn9URjiu+MWhyUXHsvfp7mcuYm9dSUKK0/CjtrUwFAxD82/mCWbtLsGjFIad0wIsod4zrTAEQ=="
+    },
+    "y18n": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/y18n/-/y18n-4.0.1.tgz",
+      "integrity": "sha512-wNcy4NvjMYL8gogWWYAO7ZFWFfHcbdbE57tZO8e4cbpj8tfUcwrwqSl3ad8HxpYWCdXcJUCeKKZS62Av1affwQ==",
+      "dev": true
+    },
+    "yallist": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/yallist/-/yallist-4.0.0.tgz",
+      "integrity": "sha512-3wdGidZyq5PB084XLES5TpOSRA3wjXAlIWMhum2kRcv/41Sn2emQ0dycQW4uZXLejwKvg6EsvbdlVL+FYEct7A==",
+      "dev": true
+    },
+    "yargs": {
+      "version": "13.3.2",
+      "resolved": "https://registry.npmjs.org/yargs/-/yargs-13.3.2.tgz",
+      "integrity": "sha512-AX3Zw5iPruN5ie6xGRIDgqkT+ZhnRlZMLMHAs8tg7nRruy2Nb+i5o9bwghAogtM08q1dpr2LVoS8KSTMYpWXUw==",
+      "dev": true,
+      "requires": {
+        "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"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
+          "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
+          "dev": true
         },
-        "websocket-driver": {
-            "version": "0.7.4",
-            "resolved": "https://registry.npmjs.org/websocket-driver/-/websocket-driver-0.7.4.tgz",
-            "integrity": "sha512-b17KeDIQVjvb0ssuSDF2cYXSg2iztliJ4B9WdsuB6J952qCPKmnVq4DyW5motImXHDC1cBT/1UezrJVsKw5zjg==",
-            "dev": true,
-            "requires": {
-                "http-parser-js": ">=0.5.1",
-                "safe-buffer": ">=5.1.0",
-                "websocket-extensions": ">=0.1.1"
-            }
+        "emoji-regex": {
+          "version": "7.0.3",
+          "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
+          "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
+          "dev": true
         },
-        "websocket-extensions": {
-            "version": "0.1.4",
-            "resolved": "https://registry.npmjs.org/websocket-extensions/-/websocket-extensions-0.1.4.tgz",
-            "integrity": "sha512-OqedPIGOfsDlo31UNwYbCFMSaO9m9G/0faIHj5/dZFDMFqPTcx6UwqyOy3COEaEOg/9VsGIpdqn62W5KhoKSpg==",
-            "dev": true
+        "find-up": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/find-up/-/find-up-3.0.0.tgz",
+          "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
+          "dev": true,
+          "requires": {
+            "locate-path": "^3.0.0"
+          }
         },
-        "which": {
-            "version": "2.0.2",
-            "resolved": "https://registry.npmjs.org/which/-/which-2.0.2.tgz",
-            "integrity": "sha512-BLI3Tl1TW3Pvl70l3yq3Y64i+awpwXqsGBYWkkqMtnbXgrMD+yj7rhW0kuEDxzJaYXGjEW5ogapKNMEKNMjibA==",
-            "dev": true,
-            "requires": {
-                "isexe": "^2.0.0"
-            }
+        "is-fullwidth-code-point": {
+          "version": "2.0.0",
+          "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
+          "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
+          "dev": true
         },
-        "which-module": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/which-module/-/which-module-2.0.0.tgz",
-            "integrity": "sha1-2e8H3Od7mQK4o6j6SzHD4/fm6Ho=",
-            "dev": true
-        },
-        "wildcard": {
-            "version": "2.0.0",
-            "resolved": "https://registry.npmjs.org/wildcard/-/wildcard-2.0.0.tgz",
-            "integrity": "sha512-JcKqAHLPxcdb9KM49dufGXn2x3ssnfjbcaQdLlfZsL9rH9wgDQjUtDxbo8NE0F6SFvydeu1VhZe7hZuHsB2/pw==",
-            "dev": true
-        },
-        "word-wrap": {
-            "version": "1.2.3",
-            "resolved": "https://registry.npmjs.org/word-wrap/-/word-wrap-1.2.3.tgz",
-            "integrity": "sha512-Hz/mrNwitNRh/HUAtM/VT/5VH+ygD6DV7mYKZAtHOrbs8U7lvPS6xf7EJKMF0uW1KJCl0H701g3ZGus+muE5vQ==",
-            "dev": true
-        },
-        "wrap-ansi": {
-            "version": "5.1.0",
-            "resolved": "https://registry.npmjs.org/wrap-ansi/-/wrap-ansi-5.1.0.tgz",
-            "integrity": "sha512-QC1/iN/2/RPVJ5jYK8BGttj5z83LmSKmvbvrXPNCLZSEb32KKVDJDl/MOt2N01qU2H/FkzEa9PKto1BqDjtd7Q==",
-            "dev": true,
-            "requires": {
-                "ansi-styles": "^3.2.0",
-                "string-width": "^3.0.0",
-                "strip-ansi": "^5.0.0"
-            },
-            "dependencies": {
-                "ansi-regex": {
-                    "version": "4.1.0",
-                    "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
-                    "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
-                    "dev": true
-                },
-                "ansi-styles": {
-                    "version": "3.2.1",
-                    "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz",
-                    "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
-                    "dev": true,
-                    "requires": {
-                        "color-convert": "^1.9.0"
-                    }
-                },
-                "color-convert": {
-                    "version": "1.9.3",
-                    "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz",
-                    "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
-                    "dev": true,
-                    "requires": {
-                        "color-name": "1.1.3"
-                    }
-                },
-                "color-name": {
-                    "version": "1.1.3",
-                    "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz",
-                    "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=",
-                    "dev": true
-                },
-                "emoji-regex": {
-                    "version": "7.0.3",
-                    "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
-                    "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
-                    "dev": true
-                },
-                "is-fullwidth-code-point": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
-                    "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
-                    "dev": true
-                },
-                "string-width": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
-                    "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
-                    "dev": true,
-                    "requires": {
-                        "emoji-regex": "^7.0.1",
-                        "is-fullwidth-code-point": "^2.0.0",
-                        "strip-ansi": "^5.1.0"
-                    }
-                },
-                "strip-ansi": {
-                    "version": "5.2.0",
-                    "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
-                    "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
-                    "dev": true,
-                    "requires": {
-                        "ansi-regex": "^4.1.0"
-                    }
-                }
-            }
+        "locate-path": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-3.0.0.tgz",
+          "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
+          "dev": true,
+          "requires": {
+            "p-locate": "^3.0.0",
+            "path-exists": "^3.0.0"
+          }
         },
-        "wrappy": {
-            "version": "1.0.2",
-            "resolved": "https://registry.npmjs.org/wrappy/-/wrappy-1.0.2.tgz",
-            "integrity": "sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=",
-            "dev": true
-        },
-        "ws": {
-            "version": "6.2.2",
-            "resolved": "https://registry.npmjs.org/ws/-/ws-6.2.2.tgz",
-            "integrity": "sha512-zmhltoSR8u1cnDsD43TX59mzoMZsLKqUweyYBAIvTngR3shc0W6aOZylZmq/7hqyVxPdi+5Ud2QInblgyE72fw==",
-            "dev": true,
-            "requires": {
-                "async-limiter": "~1.0.0"
-            }
+        "p-locate": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-3.0.0.tgz",
+          "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
+          "dev": true,
+          "requires": {
+            "p-limit": "^2.0.0"
+          }
         },
-        "y18n": {
-            "version": "4.0.1",
-            "resolved": "https://registry.npmjs.org/y18n/-/y18n-4.0.1.tgz",
-            "integrity": "sha512-wNcy4NvjMYL8gogWWYAO7ZFWFfHcbdbE57tZO8e4cbpj8tfUcwrwqSl3ad8HxpYWCdXcJUCeKKZS62Av1affwQ==",
-            "dev": true
-        },
-        "yallist": {
-            "version": "4.0.0",
-            "resolved": "https://registry.npmjs.org/yallist/-/yallist-4.0.0.tgz",
-            "integrity": "sha512-3wdGidZyq5PB084XLES5TpOSRA3wjXAlIWMhum2kRcv/41Sn2emQ0dycQW4uZXLejwKvg6EsvbdlVL+FYEct7A==",
-            "dev": true
-        },
-        "yargs": {
-            "version": "13.3.2",
-            "resolved": "https://registry.npmjs.org/yargs/-/yargs-13.3.2.tgz",
-            "integrity": "sha512-AX3Zw5iPruN5ie6xGRIDgqkT+ZhnRlZMLMHAs8tg7nRruy2Nb+i5o9bwghAogtM08q1dpr2LVoS8KSTMYpWXUw==",
-            "dev": true,
-            "requires": {
-                "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"
-            },
-            "dependencies": {
-                "ansi-regex": {
-                    "version": "4.1.0",
-                    "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
-                    "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==",
-                    "dev": true
-                },
-                "emoji-regex": {
-                    "version": "7.0.3",
-                    "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
-                    "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==",
-                    "dev": true
-                },
-                "find-up": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/find-up/-/find-up-3.0.0.tgz",
-                    "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
-                    "dev": true,
-                    "requires": {
-                        "locate-path": "^3.0.0"
-                    }
-                },
-                "is-fullwidth-code-point": {
-                    "version": "2.0.0",
-                    "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
-                    "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=",
-                    "dev": true
-                },
-                "locate-path": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-3.0.0.tgz",
-                    "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
-                    "dev": true,
-                    "requires": {
-                        "p-locate": "^3.0.0",
-                        "path-exists": "^3.0.0"
-                    }
-                },
-                "p-locate": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-3.0.0.tgz",
-                    "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
-                    "dev": true,
-                    "requires": {
-                        "p-limit": "^2.0.0"
-                    }
-                },
-                "path-exists": {
-                    "version": "3.0.0",
-                    "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-3.0.0.tgz",
-                    "integrity": "sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=",
-                    "dev": true
-                },
-                "string-width": {
-                    "version": "3.1.0",
-                    "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
-                    "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
-                    "dev": true,
-                    "requires": {
-                        "emoji-regex": "^7.0.1",
-                        "is-fullwidth-code-point": "^2.0.0",
-                        "strip-ansi": "^5.1.0"
-                    }
-                },
-                "strip-ansi": {
-                    "version": "5.2.0",
-                    "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
-                    "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
-                    "dev": true,
-                    "requires": {
-                        "ansi-regex": "^4.1.0"
-                    }
-                }
-            }
+        "path-exists": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-3.0.0.tgz",
+          "integrity": "sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=",
+          "dev": true
         },
-        "yargs-parser": {
-            "version": "13.1.2",
-            "resolved": "https://registry.npmjs.org/yargs-parser/-/yargs-parser-13.1.2.tgz",
-            "integrity": "sha512-3lbsNRf/j+A4QuSZfDRA7HRSfWrzO0YjqTJd5kjAq37Zep1CEgaYmrH9Q3GwPiB9cHyd1Y1UwggGhJGoxipbzg==",
-            "dev": true,
-            "requires": {
-                "camelcase": "^5.0.0",
-                "decamelize": "^1.2.0"
-            }
+        "string-width": {
+          "version": "3.1.0",
+          "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
+          "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
+          "dev": true,
+          "requires": {
+            "emoji-regex": "^7.0.1",
+            "is-fullwidth-code-point": "^2.0.0",
+            "strip-ansi": "^5.1.0"
+          }
         },
-        "yocto-queue": {
-            "version": "0.1.0",
-            "resolved": "https://registry.npmjs.org/yocto-queue/-/yocto-queue-0.1.0.tgz",
-            "integrity": "sha512-rVksvsnNCdJ/ohGc6xgPwyN8eheCxsiLM8mxuE/t/mOVqJewPuO1miLpTHQiRgTKCLexL4MeAFVagts7HmNZ2Q==",
-            "dev": true
+        "strip-ansi": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
+          "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
+          "dev": true,
+          "requires": {
+            "ansi-regex": "^4.1.0"
+          }
         }
+      }
+    },
+    "yargs-parser": {
+      "version": "13.1.2",
+      "resolved": "https://registry.npmjs.org/yargs-parser/-/yargs-parser-13.1.2.tgz",
+      "integrity": "sha512-3lbsNRf/j+A4QuSZfDRA7HRSfWrzO0YjqTJd5kjAq37Zep1CEgaYmrH9Q3GwPiB9cHyd1Y1UwggGhJGoxipbzg==",
+      "dev": true,
+      "requires": {
+        "camelcase": "^5.0.0",
+        "decamelize": "^1.2.0"
+      }
+    },
+    "yocto-queue": {
+      "version": "0.1.0",
+      "resolved": "https://registry.npmjs.org/yocto-queue/-/yocto-queue-0.1.0.tgz",
+      "integrity": "sha512-rVksvsnNCdJ/ohGc6xgPwyN8eheCxsiLM8mxuE/t/mOVqJewPuO1miLpTHQiRgTKCLexL4MeAFVagts7HmNZ2Q==",
+      "dev": true
     }
+  }
 }
diff --git a/package.json b/package.json
index f2f35f98..44b0eb98 100644
--- a/package.json
+++ b/package.json
@@ -21,6 +21,7 @@
         "start": "npm run serve",
         "clean": "rimraf dist",
         "type-check": "tsc --noEmit",
+        "lint": "eslint src",
         "build-dev": "npm run clean && webpack --mode=development",
         "watch": "npm run clean && webpack --watch --mode=development",
         "serve": "npm run clean && webpack serve --mode=development",
@@ -32,11 +33,13 @@
         "@babel/plugin-transform-runtime": "^7.13.10",
         "@babel/preset-env": "^7.13.10",
         "@babel/preset-typescript": "^7.13.0",
+        "@types/blob-stream": "^0.1.30",
         "@types/dagre": "^0.7.44",
         "@types/jquery": "^3.5.5",
         "@typescript-eslint/eslint-plugin": "^4.18.0",
         "@typescript-eslint/parser": "^4.18.0",
         "babel-loader": "^8.2.2",
+        "babel-plugin-transform-class-properties": "^6.24.1",
         "eslint": "^7.22.0",
         "rimraf": "^3.0.2",
         "typescript": "^4.2.3",
@@ -47,8 +50,15 @@
     "dependencies": {
         "@babel/runtime": "^7.13.10",
         "@types/mathjs": "^6.0.11",
+        "blob-stream": "^0.1.3",
+        "buffer": "^6.0.3",
+        "canvas2pdf": "^1.0.7",
         "dagre": "^0.8.5",
         "jquery": "^3.6.0",
-        "mathjs": "^9.3.0"
+        "mathjs": "^9.3.0",
+        "pixi.js": "^6.0.2",
+        "process": "^0.11.10",
+        "stream-browserify": "^3.0.0",
+        "util": "^0.12.4"
     }
 }
diff --git a/sdfv.css b/sdfv.css
index 7bb90f55..a4ac622e 100644
--- a/sdfv.css
+++ b/sdfv.css
@@ -23,7 +23,7 @@ body {
   width: 1024px;
   height: 768px;
   border: 1px solid;
-  overflow: auto;
+  overflow: hidden;
 }
 
 @keyframes animateright{
@@ -299,7 +299,8 @@ pre.code code {
   border-color: rgba(255, 0, 0, 1);
 }
 
-.sdfg_canvas {
+
+#contents {
   --node-background-color: #ffffff;
   --node-foreground-color: #000000;
   --state-background-color: #deebf7;
@@ -309,10 +310,16 @@ pre.code code {
   --connector-unscoped-color: #f0fdff;
   --nested-sdfg-background-color: #ffffff;
   --nested-sdfg-foreground-color: #000000;
+  --minimap-outline-color: #000000;
+  --minimap-focus-color: #352300;
+  --minimap-focus-fill: #35230011;
+  --selection-rect-color: #352300;
+  --selection-rect-fill: #35230011;
+  --loading-spinner-color: #000000;
   --color-default: black;
   --color-hovered: green;
   --color-highlighted: orange;
   --color-selected: red;
   --color-selected-hovered: salmon;
   --color-selected-highlighted: darkorange;
-}
\ No newline at end of file
+}
diff --git a/sdfv.html b/sdfv.html
index 50b54208..01dcbf94 100644
--- a/sdfv.html
+++ b/sdfv.html
@@ -43,7 +43,7 @@ <h3 id="sidebar-header">Nothing selected</h3>
         <form>
             <input id="search" type="text" placeholder="Search in graph elements">
             <input type="button" id="search-btn" value="Search">
-            <input type="checkbox" id="search-case"> Case Sensitive
+            <input type="checkbox" id="search-case"><label for="search-case">Case sensitive</label>
         </form>
     </div>
     <div id="contents"></div>
diff --git a/src/layouting/bench/bench.ts b/src/layouting/bench/bench.ts
new file mode 100644
index 00000000..c465f499
--- /dev/null
+++ b/src/layouting/bench/bench.ts
@@ -0,0 +1,60 @@
+import DagreLayouter from '../layouter/dagreLayouter';
+import LayoutAnalysis from './layoutAnalysis';
+import Layouter from '../layouter/layouter';
+import PerformanceAnalysis from './performanceAnalysis';
+import RenderGraph from '../renderGraph/renderGraph';
+import Serializer from '../util/serializer';
+
+export default class Bench {
+    public static GRAPHS_SMALL = ['gemm_opt', 'jacobi', 'placement', 'symm', 'syrk', 'trisolv', 'trmm', 'wrong'];
+    public static GRAPHS_MEDIUM = ['bert2', 'encbwd', 'unreadable', 'VA-gpu']
+    public static GRAPHS_LARGE = ['bert', 'lulesh-with-maps', 'rgf_dense'];
+    public static GRAPHS_ALL = ['bert', 'bert2', 'encbwd', 'gemm_opt', 'jacobi', 'lulesh-with-maps', 'placement', 'rgf_dense', 'symm', 'syrk', 'trisolv', 'trmm', 'unreadable', 'VA-gpu', 'wrong'];
+    public static GRAPHS_POLYBENCH = ['npbench/polybench/adi', 'npbench/polybench/atax', 'npbench/polybench/bicg', 'npbench/polybench/cholesky', 'npbench/polybench/correlation', 'npbench/polybench/covariance', 'npbench/polybench/deriche', 'npbench/polybench/doitgen', 'npbench/polybench/durbin', 'npbench/polybench/fdtd_2d', 'npbench/polybench/floyd_warshall', 'npbench/polybench/gemm', 'npbench/polybench/gemver', 'npbench/polybench/gesummv', 'npbench/polybench/gramschmidt', 'npbench/polybench/heat_3d', 'npbench/polybench/jacobi_1d', 'npbench/polybench/jacobi_2d', 'npbench/polybench/k2mm', 'npbench/polybench/k3mm', 'npbench/polybench/lu', 'npbench/polybench/ludcmp', 'npbench/polybench/mvt', 'npbench/polybench/nussinov', 'npbench/polybench/seidel_2d', 'npbench/polybench/symm', 'npbench/polybench/syr2k', 'npbench/polybench/syrk', 'npbench/polybench/trisolv', 'npbench/polybench/trmm'];
+    public static GRAPHS_NPBENCH = ['npbench/pythran/arc_distance', 'npbench/weather_stencils/vadv', 'npbench/azimint_hist', 'npbench/azimint_naive', 'npbench/cavity_flow', 'npbench/channel_flow', 'npbench/compute', 'npbench/go_fast', 'npbench/mandelbrot1', 'npbench/nbody', 'npbench/scattering_self_energies', 'npbench/stockham_fft'];
+
+    public static LAYOUTERS = [new DagreLayouter()];
+
+    public static validate(loadFunction: (name: string) => Promise<RenderGraph>, layouter: Layouter, graphs: Array<string> = Bench.GRAPHS_ALL) {
+        const promises = graphs.map(name => {
+            return loadFunction(name).then((renderGraph: RenderGraph) => {
+                const layoutGraph = layouter.layout(renderGraph);
+                const layoutAnalysis = new LayoutAnalysis(layoutGraph, layouter.getOptionsForAnalysis());
+                if (!layoutAnalysis.validate()) {
+                    throw new Error('Layouter returned invalid layout for graph "' + name + '".');
+                }
+            });
+        });
+        return Promise.all(promises);
+    }
+
+    public static cost(loadFunction: (name: string) => Promise<RenderGraph>, layouter: Layouter, graphs: Array<string> = Bench.GRAPHS_ALL) {
+        const promises = graphs.map(name => {
+            return loadFunction(name).then((renderGraph: RenderGraph) => {
+                const layoutGraph = layouter.layout(renderGraph);
+                const layoutAnalysis = new LayoutAnalysis(layoutGraph, layouter.getOptionsForAnalysis());
+                return layoutAnalysis.cost();
+            });
+        });
+        return Serializer.serializePromises(promises);
+    }
+
+    public static crossings(loadFunction: (name: string) => Promise<RenderGraph>, layouter: Layouter, graphs: Array<string> = Bench.GRAPHS_ALL) {
+        const promises = graphs.map(name => {
+            return loadFunction(name).then((renderGraph: RenderGraph) => {
+                const layoutGraph = layouter.layout(renderGraph);
+                const layoutAnalysis = new LayoutAnalysis(layoutGraph, layouter.getOptionsForAnalysis());
+                return layoutAnalysis.segmentCrossings();
+            });
+        });
+        return Serializer.serializePromises(promises);
+    }
+
+    public static performance(loadFunction: (name: string) => Promise<RenderGraph>, layouter: Layouter, graphs: Array<string> = Bench.GRAPHS_ALL) {
+        const promises = graphs.map(name => {
+            const performanceAnalysis = new PerformanceAnalysis(layouter);
+            return performanceAnalysis.measure(name);
+        });
+        return Serializer.serializePromises(promises);
+    }
+}
diff --git a/src/layouting/bench/layoutAnalysis.ts b/src/layouting/bench/layoutAnalysis.ts
new file mode 100644
index 00000000..d731f96e
--- /dev/null
+++ b/src/layouting/bench/layoutAnalysis.ts
@@ -0,0 +1,302 @@
+import * as _ from 'lodash';
+import LayoutConnector from '../layoutGraph/layoutConnector';
+import LayoutEdge from '../layoutGraph/layoutEdge';
+import LayoutGraph from '../layoutGraph/layoutGraph';
+import LayoutNode from '../layoutGraph/layoutNode';
+import Segment from '../geometry/segment';
+
+export default class LayoutAnalysis {
+    private readonly _layoutGraph: LayoutGraph;
+    private readonly _options: any;
+    private readonly _nodes: Array<LayoutNode>;
+    private readonly _edges: Array<LayoutEdge>;
+    private readonly _segments: Array<Segment>;
+    private readonly _uniqueSegments: Array<Segment>;
+    private readonly _nodeParents: Map<LayoutNode, Set<LayoutNode>>;
+    private readonly _edgeParents: Map<LayoutEdge, Set<LayoutNode>>;
+
+
+    constructor(layout: LayoutGraph, options: any = {}) {
+        this._layoutGraph = layout;
+        this._options = _.defaults(options, {
+            targetEdgeLength: 50,
+            weightBends: 0.2,
+            weightCrossings: 1,
+            weightLengths: 0.1,
+        });
+        this._nodes = this._layoutGraph.allNodes();
+        this._edges = this._layoutGraph.allEdges();
+        this._segments = _.flatMap(this._edges, (edge: LayoutEdge) => edge.segments());
+        this._uniqueSegments = _.map(_.uniqBy(_.map(this._segments, segment => [segment, segment.start.x + '_' + segment.start.y + '_' + segment.end.x + '_' + segment.end.x]), '1'), '0');
+
+        // precalculate all parents for nodes and edges
+        this._nodeParents = new Map();
+        _.forEach(this._nodes, (node: LayoutNode) => {
+            const parents: Set<LayoutNode> = new Set();
+            _.forEach(node.parents(), (parent: LayoutNode) => {
+                parents.add(parent);
+            });
+            this._nodeParents.set(node, parents);
+        });
+        this._edgeParents = new Map();
+        _.forEach(this._edges, (edge: LayoutEdge) => {
+            const parents: Set<LayoutNode> = new Set();
+            _.forEach(edge.parents(), (parent: LayoutNode) => {
+                parents.add(parent);
+            });
+            this._edgeParents.set(edge, parents);
+        });
+    }
+
+    /**
+     * Returns the total number of pairwise segment crossings in the graph.
+     */
+    segmentCrossings(): number {
+        return this._getAllCrossingSegments().length;
+    }
+
+    /**
+     * Returns the cost for segment crossings in the graph.
+     * For every pairwise crossing, the cost is between 1 and 2 depending on the crossing angle.
+     * Orthogonal crossings have a cost of 1, almost parallel segments a cost very close to 2.
+     */
+    segmentCrossingsWithAngles(): number {
+        let cost = 0;
+        _.forEach(this._getAllCrossingSegments(), ([segI, segJ]) => {
+            const angle = segI.vector().acuteAngleTo(segJ.vector());
+            const angleCost = (Math.cos(2 * angle) + 1) / 2;
+            cost += 1 + angleCost;
+        });
+        return cost;
+    }
+
+    edgeLengths(): number {
+        let cost = 0;
+        _.forEach(this._edges, (edge: LayoutEdge) => {
+            const edgeLength = _.sum(_.map(edge.segments(), segment => segment.length()));
+            const factor = edgeLength / this._options['targetEdgeLength'];
+            cost += Math.max(factor, 1 / factor);
+        });
+        return cost;
+    }
+
+    checkUpwardFlow(): boolean {
+        let hasUpwardFlow = false;
+        _.forEach(this._edges, (edge: LayoutEdge) => {
+            if (hasUpwardFlow) {
+                return; // break not possible in forEach
+            }
+            if (!edge.graph.mayHaveCycles && edge.points[0].y > _.last(edge.points).y) {
+                console.log('edge goes upwards', edge);
+                hasUpwardFlow = true;
+            }
+        });
+        return !hasUpwardFlow;
+    }
+
+    checkNodeOverlaps(): boolean {
+        for (let i = 0; i < this._nodes.length; ++i) {
+            const nodeA = this._nodes[i];
+            for (let j = i + 1; j < this._nodes.length; ++j) {
+                const nodeB = this._nodes[j];
+                if (nodeA.boundingBox().intersects(nodeB.boundingBox()) && !this._nodesRelated(nodeA, nodeB)) {
+                    console.log('two nodes overlap', nodeA, nodeB);
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+
+    checkEdgeOverlaps(): boolean {
+        for (let i = 0; i < this._edges.length; ++i) {
+            const edge = this._edges[i];
+            for (let j = 0; j < this._nodes.length; ++j) {
+                const node = this._nodes[j];
+                if (this._edgeIntersectsNode(edge, node) && !this._edgeParents.get(edge).has(node)) {
+                    console.log('node overlaps edge', node, edge);
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+
+    checkNodeContainment(): boolean {
+        for (let i = 0; i < this._nodes.length; ++i) {
+            const node = this._nodes[i];
+            let contained = true;
+            this._nodeParents.get(node).forEach((parent: LayoutNode) => {
+                contained = contained && node.boundingBox().containedIn(parent.boundingBox());
+            });
+            if (!contained) {
+                console.log('node not contained in parent', node, node.boundingBox(), _.map(Array.from(this._nodeParents.get(node)), (parent: LayoutNode) => parent.boundingBox()));
+                return false;
+            }
+        }
+        return true;
+    }
+
+    checkEdgeContainment(): boolean {
+        for (let i = 0; i < this._edges.length; ++i) {
+            const edge = this._edges[i];
+            let contained = true;
+            this._edgeParents.get(edge).forEach((parent: LayoutNode) => {
+                contained = contained && edge.boundingBox().containedIn(parent.boundingBox());
+            });
+            if (!contained) {
+                console.log('edge not contained in parent', edge);
+                return false;
+            }
+        }
+        return true;
+    }
+
+    checkMapAlignment(): boolean {
+        // gather all graphs
+        const graphs = [];
+        const addSubGraphs = (graph: LayoutGraph) => {
+            graphs.push(graph);
+            _.forEach(graph.nodes(), (node: LayoutNode) => {
+                if (node.childGraph !== null) {
+                    addSubGraphs(node.childGraph);
+                }
+            });
+        };
+        addSubGraphs(this._layoutGraph);
+
+        let aligned = true;
+        _.forEach(graphs, (graph: LayoutGraph) => {
+            if (!aligned) {
+                return; // break not possible in forEach
+            }
+            if (graph.entryNode !== null && graph.exitNode !== null) {
+                if (graph.entryNode.x !== graph.exitNode.x || graph.entryNode.width !== graph.exitNode.width) {
+                    console.log('entry and exit node not aligned', graph.entryNode, graph.exitNode);
+                    aligned = false;
+                }
+            }
+        });
+        return aligned;
+    }
+
+    checkConnectorAlignment(): boolean {
+        let aligned = true;
+        _.forEach(this._nodes, (node: LayoutNode) => {
+            if (!aligned) {
+                return; // break not possible in forEach
+            }
+            _.forEach(node.inConnectors, (inConnector: LayoutConnector) => {
+                if (!aligned) {
+                    return; // break not possible in forEach
+                }
+                if (inConnector.isScoped) {
+                    const outConnector = node.connector('OUT', 'OUT_' + inConnector.name.substr(3));
+                    if (inConnector.x !== outConnector.x) {
+                        console.log('IN connector and OUT connector not aligned', inConnector, outConnector);
+                        aligned = false;
+                    }
+                }
+            });
+        });
+        return aligned;
+    }
+
+    validate(): boolean {
+        return (
+            this.checkUpwardFlow() &&
+            this.checkNodeOverlaps() &&
+            this.checkEdgeOverlaps() &&
+            this.checkNodeContainment() &&
+            this.checkEdgeContainment() &&
+            this.checkMapAlignment() &&
+            this.checkConnectorAlignment()
+        );
+    }
+
+    bends(): number {
+        return this._segments.length - this._edges.length;
+    }
+
+    cost(breakdown = false): number {
+        const crossings = this.segmentCrossingsWithAngles();
+        const bends = this.bends();
+        const lengths = this.edgeLengths();
+        const weightedCrossings = this._options.weightCrossings * crossings;
+        const weightedBends = this._options.weightBends * bends;
+        const weightedLengths = this._options.weightLengths * lengths;
+        if (breakdown) {
+            console.log('Crossings: ' + this._options.weightCrossings + ' * ' + crossings.toFixed(2) + ' = ' + weightedCrossings.toFixed(2));
+            console.log('Bends: ' + this._options.weightBends + ' * ' + bends.toFixed(2) + ' = ' + weightedBends.toFixed(2));
+            console.log('Lengths: ' + this._options.weightLengths + ' * ' + lengths.toFixed(2) + ' = ' + weightedLengths.toFixed(2));
+        }
+        return weightedCrossings + weightedBends + weightedLengths;
+    }
+
+    private _edgeIntersectsNode(edge: LayoutEdge, node: LayoutNode): boolean {
+        const nodeBox = node.boundingBox();
+        if (!edge.boundingBox().intersects(nodeBox)) {
+            return false;
+        }
+        let intersects = false;
+        _.forEach(edge.segments(), (segment: Segment) => {
+            intersects = intersects || segment.intersectsBox(nodeBox);
+        });
+        return intersects;
+    }
+
+    private _nodesRelated(nodeA: LayoutNode, nodeB: LayoutNode): boolean {
+        return this._nodeParents.get(nodeA).has(nodeB) || this._nodeParents.get(nodeB).has(nodeA);
+    }
+
+    private _printCrossings(): void {
+        _.map(_.sortBy(_.map(this._getAllCrossingSegments(), ([segI, segJ]: [Segment, Segment]) => {
+            const point = segI.intersection(segJ);
+            return {
+                pointx: point.x,
+                pointy: point.y,
+                segi: segI,
+                segj: segJ,
+            };
+        }), ['pointy', 'pointx']), data => console.log('(' + data.pointx.toFixed(0) + ' / ' + data.pointy.toFixed(0) + ')', data.segi.toString(), data.segj.toString()));
+    }
+
+    private _getAllCrossingSegments(): Array<[Segment, Segment]> {
+        const overlaps = {};
+        _.forEach(['x', 'y'], axis => {
+            overlaps[axis] = new Array(this._segments.length);
+            for (let i = 0; i < this._uniqueSegments.length; ++i) {
+                overlaps[axis][i] = [];
+            }
+            const endpoints = [];
+            for (let i = 0; i < this._uniqueSegments.length; ++i) {
+                endpoints.push([this._uniqueSegments[i].start[axis], i, this._uniqueSegments[i].start[axis] <= this._uniqueSegments[i].end[axis]]);
+                endpoints.push([this._uniqueSegments[i].end[axis], i, this._uniqueSegments[i].start[axis] > this._uniqueSegments[i].end[axis]]);
+            }
+            const openSegments = new Set();
+            _.forEach(_.sortBy(endpoints, '0'), ([coord, segId, isFirst]) => {
+                if (isFirst) {
+                    openSegments.forEach((openSegId: number) => {
+                        const min = Math.min(openSegId, segId);
+                        const max = Math.max(openSegId, segId);
+                        overlaps[axis][min].push(max);
+                    });
+                    openSegments.add(segId);
+                } else {
+                    openSegments.delete(segId);
+                }
+            });
+        });
+        const intersections = [];
+        for (let i = 0; i < this._uniqueSegments.length; ++i) {
+            const segI = this._uniqueSegments[i];
+            _.forEach(_.intersection(overlaps['y'][i], overlaps['x'][i]), (j: number) => {
+                const segJ = this._uniqueSegments[j];
+                if (segI.intersects(segJ)) {
+                    intersections.push([segI, segJ]);
+                }
+            });
+        }
+        return intersections;
+    }
+}
\ No newline at end of file
diff --git a/src/layouting/bench/performanceAnalysis.ts b/src/layouting/bench/performanceAnalysis.ts
new file mode 100644
index 00000000..119090cb
--- /dev/null
+++ b/src/layouting/bench/performanceAnalysis.ts
@@ -0,0 +1,33 @@
+import * as _ from 'lodash';
+import Layouter from '../layouter/layouter';
+import Loader from '../parse/loader';
+
+export default class PerformanceAnalysis {
+    private _layouter: Layouter = null;
+
+    constructor(layouter: Layouter) {
+        this._layouter = layouter;
+    }
+
+    // adapted from https://gist.github.com/venning/b6593f965773985f923f
+    sd(numbers: Array<number>): number {
+        const mean = _.mean(numbers);
+        return Math.sqrt(_.sum(_.map(numbers, (i) => Math.pow((i - mean), 2))) / numbers.length);
+    }
+
+    measure(name: string, runs = 10): Promise<string> {
+        return Loader.load(name).then(graph => {
+            const times = [];
+            for (let run = 0; run < runs; ++run) {
+                const start = Date.now();
+                this._layouter.layout(graph);
+                const end = Date.now();
+                times.push(end - start);
+                if (_.sum(times) < 1000) {
+                    runs++;
+                }
+            }
+            return _.sortBy(times)[Math.floor(runs / 2)] + ' (' + '±' + this.sd(times).toFixed(0) + ')';
+        });
+    }
+}
\ No newline at end of file
diff --git a/src/layouting/geometry/box.ts b/src/layouting/geometry/box.ts
new file mode 100644
index 00000000..165339fd
--- /dev/null
+++ b/src/layouting/geometry/box.ts
@@ -0,0 +1,84 @@
+import { EPSILON } from '../../utils/constants';
+import Size from './size';
+import Vector from './vector';
+
+export default class Box {
+    public x: number;
+    public y: number;
+    public width: number;
+    public height: number;
+
+    constructor(x = 0, y = 0, width = 0, height = 0, centerCoords = false) {
+        this.x = x;
+        this.y = y;
+        this.width = width;
+        this.height = height;
+        if (centerCoords) {
+            this.x -= width / 2;
+            this.y -= height / 2;
+        }
+    }
+
+    topLeft(): Vector {
+        return new Vector(this.x, this.y);
+    }
+
+    topRight(): Vector {
+        return new Vector(this.x + this.width, this.y);
+    }
+
+    center(): Vector {
+        return new Vector(this.x + this.width / 2, this.y + this.height / 2);
+    }
+
+    topCenter(): Vector {
+        return new Vector(this.x + this.width / 2, this.y);
+    }
+
+    bottomLeft(): Vector {
+        return new Vector(this.x, this.y + this.height);
+    }
+
+    bottomRight(): Vector {
+        return new Vector(this.x + this.width, this.y + this.height);
+    }
+
+    bottomCenter(): Vector {
+        return new Vector(this.x + this.width / 2, this.y + this.height);
+    }
+
+    left(): number {
+        return this.x;
+    }
+
+    right(): number {
+        return this.x + this.width;
+    }
+
+    size(): Size {
+        return {
+            width: this.width,
+            height: this.height,
+        };
+    }
+
+    centerIn(surroundingBox: Box): Box {
+        this.x += (surroundingBox.width - this.width) / 2;
+        this.y += (surroundingBox.height - this.height) / 2;
+        return this;
+    }
+
+    intersects(otherBox: Box): boolean {
+        return (this.x + EPSILON < otherBox.x + otherBox.width)
+            && (this.x + this.width > otherBox.x + EPSILON)
+            && (this.y + EPSILON < otherBox.y + otherBox.height)
+            && (this.y + this.height > otherBox.y + EPSILON);
+    }
+
+    containedIn(otherBox: Box): boolean {
+        return (this.x + EPSILON >= otherBox.x)
+            && (this.y + EPSILON >= otherBox.y)
+            && (this.x + this.width <= otherBox.x + otherBox.width + EPSILON)
+            && (this.y + this.height <= otherBox.y + otherBox.height + EPSILON);
+    }
+}
diff --git a/src/layouting/geometry/segment.ts b/src/layouting/geometry/segment.ts
new file mode 100644
index 00000000..2a79bcfc
--- /dev/null
+++ b/src/layouting/geometry/segment.ts
@@ -0,0 +1,72 @@
+import * as _ from 'lodash';
+import Box from './box';
+import Vector from './vector';
+
+export default class Segment {
+    readonly start: Vector;
+    readonly end: Vector;
+
+    constructor(start: Vector, end: Vector) {
+        this.start = start;
+        this.end = end;
+    }
+
+    toString(): string {
+        return (this.start.toString() + ' -> ' + this.end.toString());
+    }
+
+    orientation(point: Vector): number {
+        return Math.sign((this.end.y - this.start.y) * (point.x - this.end.x) - (this.end.x - this.start.x) * (point.y - this.end.y));
+    }
+
+    intersects(other: Segment): boolean {
+        if (_.isEqual(this.start, other.start) || _.isEqual(this.end, other.end)) {
+            return false;
+        }
+        if (!this.boundingBox().intersects(other.boundingBox())) {
+            return false;
+        }
+        return (this.orientation(other.start) !== this.orientation(other.end) && other.orientation(this.start) !== other.orientation(this.end));
+    }
+
+    intersection(other: Segment): Vector {
+        const thisVecInv = this.vector().invert();
+        const otherVecInv = other.vector().invert();
+        const t = ((this.start.x - other.start.x) * otherVecInv.y - (this.start.y - other.start.y) * otherVecInv.x) /
+            (thisVecInv.x * otherVecInv.y - thisVecInv.y * otherVecInv.x);
+        return this.start.clone().add(this.vector().multiplyScalar(t));
+    }
+
+    intersectsBox(box: Box): boolean {
+        if (!this.boundingBox().intersects(box)) {
+            return false;
+        }
+        const topLeftSide = this.orientation(box.topLeft());
+        const topRightSide = this.orientation(box.topRight());
+        const bottomLeftSide = this.orientation(box.bottomLeft());
+        const bottomRightSide = this.orientation(box.bottomRight());
+        const sameSide = (topLeftSide === topRightSide
+            && topRightSide === bottomRightSide
+            && bottomRightSide === bottomLeftSide);
+        return !sameSide;
+    }
+
+    boundingBox(): Box {
+        const minX = Math.min(this.start.x, this.end.x);
+        const maxX = Math.max(this.start.x, this.end.x);
+        const minY = Math.min(this.start.y, this.end.y);
+        const maxY = Math.max(this.start.y, this.end.y);
+        return new Box(minX, minY, maxX - minX, maxY - minY);
+    }
+
+    vector(): Vector {
+        return new Vector(
+            this.end.x - this.start.x,
+            this.end.y - this.start.y,
+        );
+    }
+
+    length(): number {
+        return this.vector().length();
+    }
+}
diff --git a/src/layouting/geometry/size.ts b/src/layouting/geometry/size.ts
new file mode 100644
index 00000000..902d5c66
--- /dev/null
+++ b/src/layouting/geometry/size.ts
@@ -0,0 +1,4 @@
+export default interface Size {
+    width: number;
+    height: number;
+}
diff --git a/src/layouting/geometry/vector.ts b/src/layouting/geometry/vector.ts
new file mode 100644
index 00000000..2e30aa8a
--- /dev/null
+++ b/src/layouting/geometry/vector.ts
@@ -0,0 +1,90 @@
+/**
+ * Inspired by THREE.js: https://github.com/mrdoob/three.js/
+ */
+
+export default class Vector {
+    public x: number;
+    public y: number;
+
+    constructor(x = 0, y = 0) {
+        this.x = x;
+        this.y = y;
+    }
+
+    toString(precision = 0): string {
+        return '(' + this.x.toFixed(precision) + ' / ' + this.y.toFixed(precision) + ')';
+    }
+
+    clone(): Vector {
+        return new Vector(this.x, this.y);
+    }
+
+    length(): number {
+        return Math.sqrt(this.x * this.x + this.y * this.y);
+    }
+
+    angle(): number {
+        return (Math.atan2(this.y, this.x) + 2 * Math.PI) % (2 * Math.PI);
+    }
+
+    normalize(): Vector {
+        const length = this.length();
+        this.x /= length;
+        this.y /= length;
+        return this;
+    }
+
+    setX(x: number): Vector {
+        return this.multiplyScalar(x / this.x);
+    }
+
+    setY(y: number): Vector {
+        return this.multiplyScalar(y / this.y);
+    }
+
+    angleTo(otherVector: Vector): number {
+        return otherVector.angle() - this.angle();
+    }
+
+    absoluteAngleTo(otherVector: Vector): number {
+        return Math.abs(this.angleTo(otherVector));
+    }
+
+    acuteAngleTo(otherVector: Vector): number {
+        const absAngle = this.absoluteAngleTo(otherVector);
+        return Math.min(absAngle, Math.PI - absAngle);
+    }
+
+    multiplyScalar(scalar: number): Vector {
+        this.x *= scalar;
+        this.y *= scalar;
+        return this;
+    }
+
+    invert(): Vector {
+        return this.multiplyScalar(-1);
+    }
+
+    rotateAround(center: Vector, angle: number): Vector {
+        this.sub(center);
+        const sin = Math.sin(angle);
+        const cos = Math.cos(angle);
+        const x = this.x * cos - this.y * sin;
+        this.y = this.x * sin + this.y * cos;
+        this.x = x;
+        this.add(center);
+        return this;
+    }
+
+    add(otherVector: Vector): Vector {
+        this.x += otherVector.x;
+        this.y += otherVector.y;
+        return this;
+    }
+
+    sub(otherVector: Vector): Vector {
+        this.x -= otherVector.x;
+        this.y -= otherVector.y;
+        return this;
+    }
+}
diff --git a/src/layouting/graph/component.ts b/src/layouting/graph/component.ts
new file mode 100644
index 00000000..76b493c2
--- /dev/null
+++ b/src/layouting/graph/component.ts
@@ -0,0 +1,98 @@
+import { DEBUG } from '../../utils/constants';
+import * as _ from 'lodash';
+import Assert from '../util/assert';
+import Edge from './edge';
+import Graph from './graph';
+import Node from './node';
+
+export default class Component<NodeT extends Node<any, any>, EdgeT extends Edge<any, any>> {
+    protected _nodeIds: Array<number> = [];
+    protected _nodes: Array<NodeT> = [];
+    protected _edgeIds: Array<number> = [];
+    protected _graph: Graph<NodeT, EdgeT>;
+
+    private _maxId: number = null;
+
+    constructor(graph: Graph<NodeT, EdgeT>) {
+        this._graph = graph;
+    }
+
+    public addNode(id: number): void {
+        this._nodeIds.push(id);
+        this._nodes.push(this._graph.node(id));
+    }
+
+    public addEdge(id: number): void {
+        this._edgeIds.push(id);
+    }
+
+    public node(id: number): NodeT {
+        return this._graph.node(id);
+    }
+
+    public nodes(): Array<NodeT> {
+        return _.clone(this._nodes);
+    }
+
+    public edges(): Array<EdgeT> {
+        const edges = [];
+        _.forEach(this._edgeIds, id => {
+            edges.push(this._graph.edge(id));
+        });
+        return edges;
+    }
+
+    public induceEdges(): void {
+        this._nodeIds = _.sortBy(this._nodeIds);
+        _.forEach(this.nodes(), node => {
+            _.forEach(this.outEdges(node.id), outEdge => {
+                if (_.sortedIndexOf(this._nodeIds, outEdge.dst) !== -1) {
+                    this._edgeIds.push(outEdge.id);
+                }
+            });
+        });
+    }
+
+    public outEdges(id: number): Array<EdgeT> {
+        return this._graph.outEdges(id);
+    }
+
+    public toposort(): Array<NodeT> {
+        const sortedNodes = [];
+        const predecessors = _.fill(new Array(this.maxId() + 1), 0);
+        _.forEach(this.edges(), edge => {
+            predecessors[edge.dst]++;
+        });
+        const queue = [];
+        let queuePointer = 0;
+        _.forEach(this._nodeIds, (nodeId: number) => {
+            if (predecessors[nodeId] === 0) {
+                queue.push(nodeId);
+            }
+        });
+        while (queuePointer < queue.length) {
+            const nodeId = queue[queuePointer++];
+            sortedNodes.push(this._graph.node(nodeId));
+            _.forEach(this.outEdges(nodeId), (edge: EdgeT) => {
+                predecessors[edge.dst]--;
+                if (predecessors[edge.dst] === 0) {
+                    queue.push(edge.dst);
+                }
+            });
+        }
+        if (DEBUG) {
+            Assert.assert(this._nodeIds.length === sortedNodes.length, 'toposort does not return all nodes');
+        }
+        return sortedNodes;
+    }
+
+    public maxId(): number {
+        if (this._maxId === null) {
+            this._maxId = 0;
+            _.forEach(this._nodeIds, (nodeId: number) => {
+                this._maxId = Math.max(this._maxId, nodeId);
+            });
+        }
+        return this._maxId;
+    }
+}
diff --git a/src/layouting/graph/edge.ts b/src/layouting/graph/edge.ts
new file mode 100644
index 00000000..009a45d9
--- /dev/null
+++ b/src/layouting/graph/edge.ts
@@ -0,0 +1,31 @@
+import Graph from './graph';
+import Node from './node';
+
+export default class Edge<GraphT extends Graph<any, any>, NodeT extends Node<any, any>> {
+    public id: number;
+    public graph: GraphT;
+    public src: number;
+    public dst: number;
+    public weight = 1;
+    public isInverted = false;
+
+    constructor(src: number, dst: number, weight = 1) {
+        this.src = src;
+        this.dst = dst;
+        this.weight = weight;
+    }
+
+    toString(): string {
+        return this.graph.node(this.src).label() + ' ---(' + this.weight + ')---> ' + this.graph.node(this.dst).label();
+    }
+
+    parents(): Array<NodeT> {
+        const parents = [];
+        let graph = this.graph;
+        while (graph.parentNode !== null) {
+            parents.push(graph.parentNode);
+            graph = graph.parentNode.graph;
+        }
+        return parents;
+    }
+}
\ No newline at end of file
diff --git a/src/layouting/graph/graph.ts b/src/layouting/graph/graph.ts
new file mode 100644
index 00000000..12c369aa
--- /dev/null
+++ b/src/layouting/graph/graph.ts
@@ -0,0 +1,480 @@
+import * as _ from 'lodash';
+import Component from './component';
+import Edge from './edge';
+import Node from './node';
+
+export default class Graph<NodeT extends Node<any, any>, EdgeT extends Edge<any, any>> {
+    public parentNode: NodeT = null;
+
+    protected _nodes: Array<NodeT>;
+    protected _nodeIds: Array<number>;
+    protected _nodesDense: Array<NodeT>;
+    protected _edges: Array<EdgeT>;
+    protected _edgeIds: Array<number>;
+    protected _edgesDense: Array<EdgeT>;
+    protected _outEdges: Array<Array<number>>;
+    protected _inEdges: Array<Array<number>>;
+
+    private _nodesDenseOutdated: boolean;
+    private _edgesDenseOutdated: boolean;
+
+    public constructor() {
+        this._init();
+    }
+
+    clone(): Graph<NodeT, EdgeT> {
+        const clone = this.cloneEmpty();
+        _.forEach(this.nodes(), node => {
+            clone.addNode(_.clone(node), node.id);
+        });
+        _.forEach(this.edges(), edge => {
+            clone.addEdge(_.clone(edge), edge.id);
+        });
+        return clone;
+    }
+
+    cloneEmpty(): Graph<NodeT, EdgeT> {
+        const clone = _.clone(this);
+        clone._init();
+        return clone;
+    }
+
+    addNode(node: NodeT, id: number = null): number {
+        this._updateNodesDense();
+        if (id === null) {
+            id = this._nodes.length;
+        }
+        node.id = id;
+        node.graph = this;
+
+        this._nodes[id] = node;
+        this._nodeIds.push(id);
+        this._nodesDense.push(node);
+        if (this._outEdges[id] === undefined) {
+            this._outEdges[id] = [];
+            this._inEdges[id] = [];
+        }
+        return id;
+    }
+
+    /**
+     * Assumption: Both end nodes of the edge have been added before.
+     */
+    addEdge(edge: EdgeT, id: number = null): number {
+        this._updateEdgesDense();
+        if (id === null) {
+            id = this._edges.length;
+        }
+        edge.id = id;
+        edge.graph = this;
+        this._edges[id] = edge;
+        this._edgeIds.push(id);
+        this._edgesDense.push(edge);
+        this._outEdges[edge.src].push(id);
+        this._inEdges[edge.dst].push(id);
+        return id;
+    }
+
+    invertEdge(edgeId: number): void {
+        const edge = this._edges[edgeId];
+        _.pull(this._outEdges[edge.src], edgeId);
+        _.pull(this._inEdges[edge.dst], edgeId);
+        const tmpSrc = edge.src;
+        edge.src = edge.dst;
+        edge.dst = tmpSrc;
+        this._outEdges[edge.src].push(edgeId);
+        this._inEdges[edge.dst].push(edgeId);
+        edge.isInverted = true;
+    }
+
+    redirectEdge(edgeId: number, newSrc: number, newDst: number): void {
+        const edge = this._edges[edgeId];
+        if (newSrc !== edge.src) {
+            _.pull(this._outEdges[edge.src], edgeId);
+            this._outEdges[newSrc].push(edgeId);
+            edge.src = newSrc;
+        }
+        if (newDst !== edge.dst) {
+            _.pull(this._inEdges[edge.dst], edgeId);
+            this._inEdges[newDst].push(edgeId);
+            edge.dst = newDst;
+        }
+    }
+
+    node(id: number): NodeT {
+        return this._nodes[id];
+    }
+
+    edge(id: number): EdgeT {
+        return this._edges[id];
+    }
+
+    hasEdge(srcId: number, dstId: number): boolean {
+        const numOutEdges = this._outEdges[srcId].length;
+        for (let i = 0; i < numOutEdges; ++i) {
+            if (this._edges[this._outEdges[srcId][i]].dst === dstId) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    edgeBetween(srcId: number, dstId: number): EdgeT {
+        const numOutEdges = this._outEdges[srcId].length;
+        for (let i = 0; i < numOutEdges; ++i) {
+            if (this._edges[this._outEdges[srcId][i]].dst === dstId) {
+                return this._edges[this._outEdges[srcId][i]];
+            }
+        }
+        return undefined;
+    }
+
+    edgesBetween(srcId: number, dstId: number): Array<EdgeT> {
+        return _.filter(this.edges(), edge => edge.src === srcId && edge.dst === dstId);
+    }
+
+    removeNode(id: number): void {
+        this._nodes[id] = undefined;
+        this._nodesDenseOutdated = true;
+    }
+
+    removeEdge(id: number): void {
+        const edge = this.edge(id);
+        _.pull(this._outEdges[edge.src], id);
+        _.pull(this._inEdges[edge.dst], id);
+        this._edges[id] = undefined;
+        this._edgesDenseOutdated = true;
+    }
+
+    numNodes(): number {
+        this._updateNodesDense();
+        return this._nodesDense.length;
+    }
+
+    nodes(): Array<NodeT> {
+        this._updateNodesDense();
+        return this._nodesDense;
+    }
+
+    maxId(): number {
+        return this._nodes.length - 1;
+    }
+
+    numEdges(): number {
+        this._updateEdgesDense();
+        return this._edgesDense.length;
+    }
+
+    edges(): Array<EdgeT> {
+        this._updateEdgesDense();
+        return this._edgesDense;
+    }
+
+    allGraphs(): Array<Graph<NodeT, EdgeT>> {
+        const allGraphs = [this];
+
+        const addSubgraphs = (graph: this) => {
+            _.forEach(graph.nodes(), (node: NodeT) => {
+                if (node.childGraph !== null) {
+                    allGraphs.push(node.childGraph);
+                    addSubgraphs(node.childGraph);
+                }
+            });
+        };
+        addSubgraphs(this);
+
+        return allGraphs;
+    }
+
+    allNodes(): Array<NodeT> {
+        const allNodes = [];
+        _.forEach(this.allGraphs(), (subgraph: Graph<NodeT, EdgeT>) => {
+            _.forEach(subgraph.nodes(), (node: NodeT) => {
+                allNodes.push(node);
+            });
+        });
+        return allNodes;
+    }
+
+    allEdges(): Array<EdgeT> {
+        const allEdges = [];
+        _.forEach(this.allGraphs(), (subgraph: Graph<NodeT, EdgeT>) => {
+            _.forEach(subgraph.edges(), (edge: EdgeT) => {
+                allEdges.push(edge);
+            });
+        });
+        return allEdges;
+    }
+
+    numInEdges(id: number): number {
+        return this._inEdges[id].length;
+    }
+
+    inEdges(id: number): Array<EdgeT> {
+        return _.map(this._inEdges[id], edgeId => this.edge(edgeId));
+    }
+
+    numOutEdges(id: number): number {
+        return this._outEdges[id].length;
+    }
+
+    outEdges(id: number): Array<EdgeT> {
+        return _.map(this._outEdges[id], edgeId => this.edge(edgeId));
+    }
+
+    incidentEdges(id: number): Array<EdgeT> {
+        return _.uniq(_.concat(this.inEdges(id), this.outEdges(id)));
+    }
+
+    inNeighbors(id: number): Array<NodeT> {
+        return _.map(this.inEdges(id), inEdge => this._nodes[inEdge.src]);
+    }
+
+    outNeighbors(id: number): Array<NodeT> {
+        return _.map(this.outEdges(id), outEdge => this._nodes[outEdge.dst]);
+    }
+
+    neighbors(id: number): Array<NodeT> {
+        return _.uniq(_.concat(this.inNeighbors(id), this.outNeighbors(id)));
+    }
+
+    clear(): void {
+        this._init();
+    }
+
+    hasCycle(): boolean {
+        return (this.toposort().length < this.nodes().length);
+    }
+
+    removeCycles(): Array<EdgeT> {
+        const invertedEdges = [];
+        const remainingNodes = new Set();
+        const predecessors = new Array(this._nodes.length);
+        const queue = [];
+        let queuePointer = 0;
+        _.forEach(this.nodes(), (node: NodeT) => {
+            const numInEdges = this.inEdges(node.id).length;
+            predecessors[node.id] = numInEdges;
+            if (numInEdges === 0) {
+                queue.push(node);
+            } else {
+                remainingNodes.add(node.id);
+            }
+        });
+        while (remainingNodes.size > 0) {
+            // toposort
+            while (queuePointer < queue.length) {
+                const node = queue[queuePointer++];
+                remainingNodes.delete(node.id);
+                _.forEach(this.outEdges(node.id), (edge: EdgeT) => {
+                    predecessors[edge.dst]--;
+                    if (predecessors[edge.dst] === 0) {
+                        queue.push(this.node(edge.dst));
+                    }
+                });
+            }
+
+            // no nodes without in-edges => either finished or halting before cycle
+
+            if (remainingNodes.size > 0) {
+                const nextNodeId = remainingNodes.values().next().value;
+                const nextNode = this.node(nextNodeId); // first remaining node
+                _.forEach(this.inEdges(nextNode.id), (inEdge: EdgeT) => {
+                    if (remainingNodes.has(inEdge.src)) {
+                        predecessors[inEdge.src]++;
+                        this.invertEdge(inEdge.id);
+                        invertedEdges.push(this._edges[inEdge.id]);
+                    }
+                });
+                remainingNodes.delete(nextNode.id);
+                queue.push(nextNode);
+            }
+        }
+
+        return invertedEdges;
+    }
+
+    public bfs(startId: number = null, ignoreDirections = false): Array<NodeT> {
+        const nodes = this.nodes();
+        if (nodes.length === 0) {
+            return [];
+        }
+
+        const sortedNodes = [];
+        const visited = _.fill(new Array(this.maxId() + 1), false);
+        const queue = [];
+        let queuePointer = 0;
+        if (startId === null) {
+            queue.push(nodes[0]);
+            visited[nodes[0].id] = true;
+        } else {
+            queue.push(this.node(startId));
+            visited[startId] = true;
+        }
+        while (queuePointer < queue.length) {
+            const node = queue[queuePointer++];
+            sortedNodes.push(node);
+            _.forEach(this.outEdges(node.id), (outEdge: EdgeT) => {
+                if (!visited[outEdge.dst]) {
+                    queue.push(this.node(outEdge.dst));
+                    visited[outEdge.dst] = true;
+                }
+            });
+            if (ignoreDirections) {
+                _.forEach(this.inEdges(node.id), (inEdge: EdgeT) => {
+                    if (!visited[inEdge.src]) {
+                        queue.push(this.node(inEdge.src));
+                        visited[inEdge.src] = true;
+                    }
+                });
+            }
+        }
+        return sortedNodes;
+    }
+
+    toposort(): Array<NodeT> {
+        const sortedNodes = [];
+        const predecessors = new Array(this._nodes.length);
+        const queue = [];
+        let queuePointer = 0;
+        _.forEach(this._nodes, (node: NodeT) => {
+            if (node === undefined) {
+                return; // skip deleted nodes
+            }
+            const numInEdges = this.inEdges(node.id).length;
+            predecessors[node.id] = numInEdges;
+            if (numInEdges === 0) {
+                queue.push(node);
+            }
+        });
+        while (queuePointer < queue.length) {
+            const node = queue[queuePointer++];
+            sortedNodes.push(node);
+            _.forEach(this.outEdges(node.id), (edge: EdgeT) => {
+                predecessors[edge.dst]--;
+                if (predecessors[edge.dst] === 0) {
+                    queue.push(this.node(edge.dst));
+                }
+            });
+        }
+        return sortedNodes;
+    }
+
+    sources(): Array<NodeT> {
+        return _.filter(this.nodes(), (node: NodeT) => {
+            return (this.inEdges(node.id).length === 0);
+        });
+    }
+
+    sinks(): Array<NodeT> {
+        return _.filter(this.nodes(), (node: NodeT) => {
+            return (this.outEdges(node.id).length === 0);
+        });
+    }
+
+    components(): Array<Component<NodeT, EdgeT>> {
+        const nodes = this.nodes();
+        if (nodes.length === 0) {
+            return [];
+        }
+        const componentNumbers = _.fill(new Array(this._nodes.length), null);
+        let currentNumber = 0;
+        _.forEach(nodes, (node: NodeT) => {
+            if (componentNumbers[node.id] !== null) {
+                return;
+            }
+            componentNumbers[node.id] = currentNumber;
+            const queue = [node];
+            let queuePointer = 0;
+            while (queuePointer < queue.length) {
+                const node = queue[queuePointer++];
+                _.forEach(this.outEdges(node.id), (edge: EdgeT) => {
+                    if (componentNumbers[edge.dst] === null) {
+                        componentNumbers[edge.dst] = currentNumber;
+                        queue.push(this.node(edge.dst));
+                    }
+                });
+                _.forEach(this.inEdges(node.id), (edge: EdgeT) => {
+                    if (componentNumbers[edge.src] === null) {
+                        componentNumbers[edge.src] = currentNumber;
+                        queue.push(this.node(edge.src));
+                    }
+                });
+            }
+            currentNumber++;
+        });
+
+        const components: Array<Component<NodeT, EdgeT>> = [];
+        // create components
+        for (let i = 0; i < currentNumber; ++i) {
+            components.push(new Component(this));
+        }
+        // add nodes
+        _.forEach(nodes, (node: NodeT) => {
+            const componentId = componentNumbers[node.id];
+            components[componentId].addNode(node.id);
+        });
+        // add edges
+        _.forEach(nodes, (node: NodeT) => {
+            _.forEach(this.outEdges(node.id), (edge: EdgeT) => {
+                const componentId = componentNumbers[node.id];
+                components[componentId].addEdge(edge.id);
+            });
+        });
+
+        return components;
+    }
+
+    toString(): string {
+        const subgraphToObj = (subgraph: Graph<NodeT, EdgeT>) => {
+            const obj = {
+                nodes: {},
+                edges: [],
+            };
+            _.forEach(subgraph.nodes(), (node: NodeT) => {
+                obj.nodes[node.id] = {
+                    label: node.label(),
+                    child: node.childGraph !== null ? subgraphToObj(node.childGraph) : null
+                };
+            });
+            _.forEach(subgraph.edges(), (edge: EdgeT) => {
+                obj.edges.push({src: edge.src, dst: edge.dst, weight: edge.weight});
+            });
+            return obj;
+        };
+        return JSON.stringify(subgraphToObj(this));
+    }
+
+    storeLocal(): void {
+        if (typeof window !== 'undefined') {
+            window.localStorage.setItem('storedGraph', this.toString());
+        }
+    }
+
+    private _init(): void {
+        this._nodes = [];
+        this._nodeIds = [];
+        this._nodesDense = [];
+        this._edges = [];
+        this._edgeIds = [];
+        this._edgesDense = [];
+        this._outEdges = [];
+        this._inEdges = [];
+        this._nodesDenseOutdated = false;
+        this._edgesDenseOutdated = false;
+    }
+
+    private _updateNodesDense(): void {
+        if (this._nodesDenseOutdated) {
+            this._nodesDense = _.compact(this._nodes);
+            this._nodesDenseOutdated = false;
+        }
+    }
+
+    private _updateEdgesDense(): void {
+        if (this._edgesDenseOutdated) {
+            this._edgesDense = _.compact(this._edges);
+            this._edgesDenseOutdated = false;
+        }
+    }
+}
diff --git a/src/layouting/graph/node.ts b/src/layouting/graph/node.ts
new file mode 100644
index 00000000..5f1a6191
--- /dev/null
+++ b/src/layouting/graph/node.ts
@@ -0,0 +1,39 @@
+import Graph from './graph';
+import Edge from './edge';
+
+export default class Node<GraphT extends Graph<any, any>, EdgeT extends Edge<any, any>> {
+    public id: number;
+    public graph: GraphT;
+    public childGraph: GraphT | null = null;
+    public readonly data: any;
+
+    private _label = '';
+
+    constructor(label = '', data: any = null) {
+        this._label = label;
+        this.data = data;
+    }
+
+    public label(): string {
+        return this._label;
+    }
+
+    public setLabel(label = ''): void {
+        this._label = label;
+    }
+
+    setChildGraph(childGraph: GraphT): void {
+        childGraph.parentNode = this;
+        this.childGraph = childGraph;
+    }
+
+    parents(): Array<this> {
+        const parents = [];
+        let graph = this.graph;
+        while (graph.parentNode !== null) {
+            parents.push(graph.parentNode);
+            graph = graph.parentNode.graph;
+        }
+        return parents;
+    }
+}
diff --git a/src/layouting/layoutGraph/layoutBundle.ts b/src/layouting/layoutGraph/layoutBundle.ts
new file mode 100644
index 00000000..e5806850
--- /dev/null
+++ b/src/layouting/layoutGraph/layoutBundle.ts
@@ -0,0 +1,17 @@
+import LayoutEdge from './layoutEdge';
+import Vector from '../geometry/vector';
+
+export default class LayoutBundle {
+    public connectors: Array<string> = [];
+    public edges: Array<LayoutEdge> = [];
+    public x;
+    public y;
+
+    addConnector(name: string): void {
+        this.connectors.push(name);
+    }
+
+    position(): Vector {
+        return new Vector(this.x, this.y);
+    }
+}
diff --git a/src/layouting/layoutGraph/layoutConnector.ts b/src/layouting/layoutGraph/layoutConnector.ts
new file mode 100644
index 00000000..005d1acc
--- /dev/null
+++ b/src/layouting/layoutGraph/layoutConnector.ts
@@ -0,0 +1,72 @@
+import { CONNECTOR_SIZE } from '../../utils/constants';
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import LayoutNode from './layoutNode';
+import Size from '../geometry/size';
+import Vector from '../geometry/vector';
+
+export default class LayoutConnector {
+    public readonly node: LayoutNode;
+    public readonly type: 'IN' | 'OUT';
+    public readonly name: string;
+
+    public isScoped = false;
+    public counterpart: LayoutConnector = null;
+
+    // position is relative to node
+    public x: number = null;
+    public y: number = null;
+    public readonly width: number = 0;
+    public readonly height: number = 0;
+    public readonly isTemporary: boolean;
+
+    constructor(node: LayoutNode, type: 'IN' | 'OUT', name: string, temporary: boolean) {
+        this.node = node;
+        this.type = type;
+        this.name = name;
+        if (!temporary) {
+            this.width = CONNECTOR_SIZE;
+            this.height = CONNECTOR_SIZE;
+        }
+        this.isTemporary = temporary;
+        if (name === null) {
+            return;
+        }
+        const counterpartType = (type === 'IN' ? 'OUT' : 'IN');
+        if (name.startsWith(type + '_')) {
+            const matchingConnectorIndex = _.map(node[counterpartType.toLowerCase() + 'Connectors'], 'name').indexOf(counterpartType + '_' + name.substr(type.length + 1));
+            if (matchingConnectorIndex > -1) {
+                this.isScoped = true;
+                this.counterpart = node[counterpartType.toLowerCase() + 'Connectors'][matchingConnectorIndex];
+                this.counterpart.isScoped = true;
+                this.counterpart.counterpart = this;
+                this.node.hasScopedConnectors = true;
+            }
+        }
+    }
+
+    position(): Vector {
+        return new Vector(this.x, this.y);
+    }
+
+    size(): Size {
+        return {
+            width: this.width,
+            height: this.height,
+        };
+    }
+
+    boundingBox(): Box {
+        return new Box(this.x, this.y, this.width, this.height);
+    }
+
+    setPosition(x: number, y: number): void {
+        this.x = x;
+        this.y = y;
+    }
+
+    translate(x: number, y: number): void {
+        this.x += x;
+        this.y += y;
+    }
+}
diff --git a/src/layouting/layoutGraph/layoutEdge.ts b/src/layouting/layoutGraph/layoutEdge.ts
new file mode 100644
index 00000000..43d441ba
--- /dev/null
+++ b/src/layouting/layoutGraph/layoutEdge.ts
@@ -0,0 +1,84 @@
+import { EPSILON } from '../../utils/constants';
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import Edge from '../graph/edge';
+import LayoutBundle from './layoutBundle';
+import LayoutGraph from './layoutGraph';
+import LayoutNode from './layoutNode';
+import Segment from '../geometry/segment';
+import Size from '../geometry/size';
+import Vector from '../geometry/vector';
+
+export default class LayoutEdge extends Edge<LayoutGraph, LayoutNode> {
+    public readonly labelSize: Size = null;
+
+    public srcConnector: string;
+    public dstConnector: string;
+    public points: Array<Vector> = [];
+    public labelX: number = null;
+    public labelY: number = null;
+    public srcBundle: LayoutBundle = null;
+    public dstBundle: LayoutBundle = null;
+    public isReplica = false;
+
+    constructor(src: number, dst: number, srcConnector: string = null, dstConnector: string = null, labelSize: Size = null) {
+        super(src, dst);
+        this.srcConnector = srcConnector;
+        this.dstConnector = dstConnector;
+        this.labelSize = labelSize;
+    }
+
+    translate(x: number, y: number): void {
+        _.forEach(this.points, (point) => {
+            point.x += x;
+            point.y += y;
+        });
+        if (this.labelX) {
+            this.labelX += x;
+            this.labelY += y;
+        }
+    }
+
+    boundingBox(): Box {
+        let minX = Number.POSITIVE_INFINITY;
+        let maxX = Number.NEGATIVE_INFINITY;
+        let minY = Number.POSITIVE_INFINITY;
+        let maxY = Number.NEGATIVE_INFINITY;
+        _.forEach(this.points, (point: Vector) => {
+            minX = Math.min(minX, point.x);
+            maxX = Math.max(maxX, point.x);
+            minY = Math.min(minY, point.y);
+            maxY = Math.max(maxY, point.y);
+        });
+        return new Box(minX, minY, maxX - minX, maxY - minY);
+    }
+
+    rawSegments(): Array<Segment> {
+        const segments = [];
+        for (let i = 1; i < this.points.length; ++i) {
+            segments.push(new Segment(_.clone(this.points[i - 1]), _.clone(this.points[i])));
+        }
+        return segments;
+    }
+
+    segments(): Array<Segment> {
+        const segments = [];
+        let start = _.clone(this.points[0]);
+        let end = _.clone(this.points[1]);
+        for (let i = 2; i < this.points.length; ++i) {
+            const deltaXPrev = end.x - start.x;
+            const deltaYPrev = end.y - start.y;
+            const deltaXNext = this.points[i].x - end.x;
+            const deltaYNext = this.points[i].y - end.y;
+            if (Math.abs(deltaXPrev * deltaYNext - deltaXNext * deltaYPrev) < EPSILON) {
+                end = _.clone(this.points[i]);
+            } else {
+                segments.push(new Segment(start, end));
+                start = _.clone(end);
+                end = _.clone(this.points[i]);
+            }
+        }
+        segments.push(new Segment(start, end));
+        return segments;
+    }
+}
diff --git a/src/layouting/layoutGraph/layoutGraph.ts b/src/layouting/layoutGraph/layoutGraph.ts
new file mode 100644
index 00000000..706dea6f
--- /dev/null
+++ b/src/layouting/layoutGraph/layoutGraph.ts
@@ -0,0 +1,144 @@
+import { CONNECTOR_SIZE } from '../../utils/constants';
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import Graph from '../graph/graph';
+import LayoutEdge from './layoutEdge';
+import LayoutNode from './layoutNode';
+import LevelGraph from '../levelGraph/levelGraph';
+import LevelNode from '../levelGraph/levelNode';
+
+export default class LayoutGraph extends Graph<LayoutNode, LayoutEdge> {
+    public readonly mayHaveCycles: boolean;
+
+    public entryNode: LayoutNode = null;
+    public exitNode: LayoutNode = null;
+
+    public minRank = 0;
+    public numRanks = 1;
+
+    private _levelGraph: LevelGraph = null;
+    private _maxNodesPerRank: number = null;
+
+    constructor(mayHaveCycles = false) {
+        super();
+        this.mayHaveCycles = mayHaveCycles;
+    }
+
+    allGraphs(): Array<LayoutGraph> {
+        const allGraphs = [<LayoutGraph>this];
+        const addSubgraphs = (graph: LayoutGraph) => {
+            _.forEach(graph.nodes(), (node: LayoutNode) => {
+                if (node.childGraph !== null) {
+                    allGraphs.push(node.childGraph);
+                    addSubgraphs(node.childGraph);
+                }
+                _.forEach(node.childGraphs, (childGraph: LayoutGraph) => {
+                    allGraphs.push(childGraph);
+                    addSubgraphs(childGraph);
+                });
+            });
+        };
+        addSubgraphs(this);
+        return allGraphs;
+    }
+
+    translateElements(x: number, y: number) {
+        _.forEach(this.nodes(), (node: LayoutNode) => {
+            node.translate(x, y);
+        });
+        _.forEach(this.edges(), (edge: LayoutEdge) => {
+            edge.translate(x, y);
+        });
+    }
+
+    boundingBox(includeEdges = true): Box {
+        const nodes = this.nodes();
+        if (nodes.length === 0) {
+            return new Box(0, 0, 0, 0);
+        }
+        let minX = Number.POSITIVE_INFINITY;
+        let maxX = Number.NEGATIVE_INFINITY;
+        let minY = Number.POSITIVE_INFINITY;
+        let maxY = Number.NEGATIVE_INFINITY;
+        _.forEach(nodes, (node: LayoutNode) => {
+            const box = node.boundingBox();
+            if (_.some(node.inConnectors, connector => !connector.isTemporary)) {
+                box.y -= CONNECTOR_SIZE / 2;
+            }
+            if (_.some(node.outConnectors, connector => !connector.isTemporary)) {
+                box.height += CONNECTOR_SIZE / 2;
+            }
+            minX = Math.min(minX, box.x);
+            maxX = Math.max(maxX, box.x + box.width);
+            minY = Math.min(minY, box.y);
+            maxY = Math.max(maxY, box.y + box.height);
+        });
+        if (includeEdges) {
+            _.forEach(this.edges(), (edge: LayoutEdge) => {
+                const box = edge.boundingBox();
+                minX = Math.min(minX, box.x);
+                maxX = Math.max(maxX, box.x + box.width);
+                minY = Math.min(minY, box.y);
+                maxY = Math.max(maxY, box.y + box.height);
+            });
+        }
+        return new Box(minX, minY, maxX - minX, maxY - minY);
+    }
+
+    public globalRanks(): Array<Array<LayoutNode>> {
+        const nodesPerRank = new Array(this.numRanks);
+        for (let r = 0; r < this.numRanks; ++r) {
+            nodesPerRank[r] = [];
+        }
+        _.forEach(this.allNodes(), (node: LayoutNode) => {
+            nodesPerRank[node.rank].push(node);
+        });
+        return nodesPerRank;
+    }
+
+    public offsetRank(offset: number): void {
+        this.minRank += offset;
+        _.forEach(this.nodes(), node => {
+            node.offsetRank(offset);
+        });
+    }
+
+    public maxNodesPerRank(): number {
+        if (this._maxNodesPerRank === null) {
+            let max = 0;
+            _.forEach(this.levelGraph().ranks(), (rank: Array<LevelNode>) => {
+                let num = 0;
+                _.forEach(rank, (levelNode: LevelNode) => {
+                    if (levelNode.layoutNode.isScopeNode) {
+                        num += levelNode.layoutNode.childGraphs[0].maxNodesPerRank();
+                    } else {
+                        num++;
+                    }
+                });
+                max = Math.max(max, num);
+            });
+            this._maxNodesPerRank = max;
+        }
+        return this._maxNodesPerRank;
+    }
+
+    public levelGraph(): LevelGraph {
+        const addSubgraph = (subgraph: LayoutGraph) => {
+            _.forEach(subgraph.nodes(), (node: LayoutNode) => {
+                this._levelGraph.addLayoutNode(node);
+            });
+            _.forEach(this.edges(), (edge: LayoutEdge) => {
+                this._levelGraph.addLayoutEdge(edge);
+            });
+        };
+        if (this._levelGraph === null) {
+            this._levelGraph = new LevelGraph();
+            addSubgraph(this);
+        }
+        return this._levelGraph;
+    }
+
+    public setLevelGraph(levelGraph: LevelGraph) {
+        this._levelGraph = levelGraph;
+    }
+}
diff --git a/src/layouting/layoutGraph/layoutNode.ts b/src/layouting/layoutGraph/layoutNode.ts
new file mode 100644
index 00000000..a18519eb
--- /dev/null
+++ b/src/layouting/layoutGraph/layoutNode.ts
@@ -0,0 +1,189 @@
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import LayoutBundle from './layoutBundle';
+import LayoutConnector from './layoutConnector';
+import LayoutEdge from './layoutEdge';
+import LayoutGraph from './layoutGraph';
+import LevelNode from '../levelGraph/levelNode';
+import Node from '../graph/node';
+import Size from '../geometry/size';
+import Vector from '../geometry/vector';
+
+export default class LayoutNode extends Node<LayoutGraph, LayoutEdge> {
+    public inConnectors: Array<LayoutConnector> = [];
+    public outConnectors: Array<LayoutConnector> = [];
+    public inConnectorBundles: Array<LayoutBundle> = [];
+    public outConnectorBundles: Array<LayoutBundle> = [];
+
+    public x = 0;
+    public y = 0;
+    public width = 0;
+    public height = 0;
+
+    public selfLoop: LayoutEdge = null;
+
+    public isAccessNode = false;
+    public isScopeNode = false;
+    public hasScopedConnectors = false;
+    public rank: number = null; // global rank (level) of the node
+    public rankSpan = 1;
+    public index = 0; // index of the node, when indexes is set, it should eventually be the max index
+
+    public levelNodes: Array<LevelNode> = [];
+
+    public readonly childGraphs: Array<LayoutGraph> = [];
+
+    public readonly padding: number;
+    public readonly isVirtual: boolean;
+    public readonly isBundle: boolean;
+
+    private readonly _inConnectors: Map<string, LayoutConnector> = new Map();
+    private readonly _outConnectors: Map<string, LayoutConnector> = new Map();
+
+    constructor(size: Size = null, padding = 0, isVirtual = false, isBundle = false) {
+        super();
+        if (size !== null) {
+            this.width = size.width;
+            this.height = size.height;
+        }
+        this.padding = padding;
+        this.isVirtual = isVirtual;
+        this.isBundle = isBundle;
+        if (isVirtual || isBundle) {
+            this.addConnector('IN', null);
+            this.addConnector('OUT', null);
+        }
+    }
+
+    connectors() {
+        return _.concat(this.inConnectors, this.outConnectors);
+    }
+
+    connector(type: 'IN' | 'OUT', name: string): LayoutConnector {
+        if (type === 'IN') {
+            return this._inConnectors.get(name);
+        } else {
+            return this._outConnectors.get(name);
+        }
+    }
+
+    addConnector(type: 'IN' | 'OUT', name: string, temporary = false): void {
+        const connector = new LayoutConnector(this, type, name, temporary);
+        if (type === 'IN') {
+            this._inConnectors.set(name, connector);
+            this.inConnectors.push(connector);
+        } else {
+            this._outConnectors.set(name, connector);
+            this.outConnectors.push(connector);
+        }
+    }
+
+    removeConnector(type: 'IN' | 'OUT', name: string): void {
+        if (type === 'IN') {
+            const connector = this._inConnectors.get(name);
+            this._inConnectors.delete(name);
+            _.pull(this.inConnectors, connector);
+        } else {
+            const connector = this._outConnectors.get(name);
+            this._outConnectors.delete(name);
+            _.pull(this.outConnectors, connector);
+        }
+    }
+
+    translate(x: number, y: number): void {
+        this.x += x;
+        this.y += y;
+        _.forEach(this.childGraphs, (childGraph: LayoutGraph) => {
+            childGraph.translateElements(x, y);
+        });
+        _.forEach(this.inConnectors, (connector: LayoutConnector) => {
+            connector.translate(x, y);
+        });
+        _.forEach(this.outConnectors, (connector: LayoutConnector) => {
+            connector.translate(x, y);
+        });
+        _.forEach(this.inConnectorBundles, (inBundle: LayoutBundle) => {
+            inBundle.x += x;
+            inBundle.y += y;
+        });
+        _.forEach(this.outConnectorBundles, (outBundle: LayoutBundle) => {
+            outBundle.x += x;
+            outBundle.y += y;
+        });
+    }
+
+    translateWithoutChildren(x: number, y: number): void {
+        this.x += x;
+        this.y += y;
+        _.forEach(this.inConnectors, (connector: LayoutConnector) => {
+            connector.translate(x, y);
+        });
+        _.forEach(this.outConnectors, (connector: LayoutConnector) => {
+            connector.translate(x, y);
+        });
+    }
+
+    setPosition(position: Vector): void {
+        this.x = position.x;
+        this.y = position.y;
+    }
+
+    updatePosition(position: Vector): void {
+        const prevX = this.x;
+        const prevY = this.y;
+        const offsetX = position.x - prevX;
+        const offsetY = position.y - prevY;
+        this.x = position.x;
+        this.y = position.y;
+        _.forEach(this.childGraphs, (childGraph: LayoutGraph) => {
+            childGraph.translateElements(offsetX, offsetY);
+        });
+    }
+
+    setSize(size: Size): void {
+        this.width = size.width;
+        this.height = size.height;
+    }
+
+    updateSize(size: Size): void {
+        this.width = Math.max(this.width, size.width);
+        this.height = Math.max(this.height, size.height);
+    }
+
+    setWidth(width: number): void {
+        this.width = width;
+    }
+
+    position(): Vector {
+        return (new Vector(this.x, this.y));
+    }
+
+    size(): Size {
+        return {
+            width: this.width,
+            height: this.height,
+        };
+    }
+
+    boundingBox(): Box {
+        return new Box(this.x, this.y, this.width, this.height);
+    }
+
+    offsetRank(offset: number): void {
+        this.rank += offset;
+        if (offset !== 0) {
+            _.forEach(this.childGraphs, (childGraph: LayoutGraph) => {
+                childGraph.offsetRank(offset);
+            });
+            _.forEach(this.levelNodes, (levelNode: LevelNode, r: number) => {
+                levelNode.rank = this.rank + r;
+            });
+        }
+    }
+
+    updateRank(newRank: number): void {
+        if (this.rank !== newRank) {
+            this.offsetRank(newRank - this.rank);
+        }
+    }
+}
diff --git a/src/layouting/layoutLib.ts b/src/layouting/layoutLib.ts
new file mode 100644
index 00000000..bcc6dceb
--- /dev/null
+++ b/src/layouting/layoutLib.ts
@@ -0,0 +1,8 @@
+export { default as Bench } from './bench/bench';
+export { default as Loader } from './parse/loader';
+export { default as Parser } from './parse/parser';
+export { default as RenderGraph } from './renderGraph/renderGraph';
+export { default as DagreLayouter } from './layouter/dagreLayouter';
+export { default as MagneticSpringLayouter } from './layouter/magneticSpringLayouter';
+export { default as SugiyamaLayouter } from './layouter/sugiyamaLayouter';
+export { default as Serializer } from './util/serializer';
diff --git a/src/layouting/layouter/dagreLayouter.ts b/src/layouting/layouter/dagreLayouter.ts
new file mode 100644
index 00000000..cb924600
--- /dev/null
+++ b/src/layouting/layouter/dagreLayouter.ts
@@ -0,0 +1,80 @@
+import * as _ from 'lodash';
+import dagre from 'dagre';
+import Box from '../geometry/box';
+import LayoutEdge from '../layoutGraph/layoutEdge';
+import LayoutGraph from '../layoutGraph/layoutGraph';
+import LayoutNode from '../layoutGraph/layoutNode';
+import RecursiveLayouter from './recursiveLayouter';
+
+export default class DagreLayouter extends RecursiveLayouter {
+    public static EDGE_LABEL_OFFSET = 3;
+
+    layoutSizedGraph(graph: LayoutGraph): void {
+        // create dagre graph
+        const dagreGraph = new dagre.graphlib.Graph({ multigraph: true });
+        dagreGraph.setGraph(this.graphOptions());
+        dagreGraph.setDefaultEdgeLabel(() => {
+            return {};
+        });
+
+        _.forEach(graph.nodes(), (node: LayoutNode) => {
+            dagreGraph.setNode(node.id, node.size());
+        });
+
+        const generalEdgeOptions: any = {};
+        if (this._options['withLabels']) {
+            generalEdgeOptions.labelpos = 'c';
+            generalEdgeOptions.labeloffset = DagreLayouter.EDGE_LABEL_OFFSET;
+        }
+        _.forEach(graph.edges(), (edge: LayoutEdge) => {
+            const edgeOptions = _.assign({}, generalEdgeOptions);
+            if (this._options['withLabels']) {
+                _.assign(edgeOptions, edge.labelSize);
+            }
+            dagreGraph.setEdge(edge.src, edge.dst, edgeOptions, edge.id);
+        });
+
+        // call dagre layouter
+        dagre.layout(dagreGraph, { debugTiming: false });
+
+        // store layout information in layout graph
+        _.forEach(graph.nodes(), (node: LayoutNode) => {
+            const dagreNode = dagreGraph.node(node.id);
+            const box = new Box(dagreNode.x, dagreNode.y, dagreNode.width, dagreNode.height, true);
+            node.updatePosition(box.topLeft());
+        });
+        _.forEach(graph.edges(), (edge: LayoutEdge) => {
+            const dagreEdge = dagreGraph.edge(edge.src, edge.dst, edge.id);
+
+            edge.points = _.cloneDeep(dagreEdge.points);
+            if (this._options['withLabels']) {
+                const labelSize = edge.labelSize;
+                if (labelSize) {
+                    edge.labelX = dagreEdge.x - labelSize.width / 2 + DagreLayouter.EDGE_LABEL_OFFSET;
+                    edge.labelY = dagreEdge.y - labelSize.height / 2;
+                }
+            }
+
+            // move edges without connectors to an invisible connector in the center of the node
+            if (!graph.mayHaveCycles) {
+                if (edge.srcConnector === null) {
+                    edge.points[0] = edge.graph.node(edge.src).boundingBox().bottomCenter();
+                }
+                if (edge.dstConnector === null) {
+                    edge.points[edge.points.length - 1] = edge.graph.node(edge.dst).boundingBox().topCenter();
+                }
+            }
+        });
+    }
+
+    graphOptions(): object {
+        const options = {
+            ranksep: this._options.targetEdgeLength,
+            nodesep: this._options.targetEdgeLength,
+        };
+        if (this._options['withLabels']) {
+            options['edgesep'] = 30;
+        }
+        return options;
+    }
+}
diff --git a/src/layouting/layouter/layouter.ts b/src/layouting/layouter/layouter.ts
new file mode 100644
index 00000000..8268eecb
--- /dev/null
+++ b/src/layouting/layouter/layouter.ts
@@ -0,0 +1,454 @@
+import { CONNECTOR_SIZE, CONNECTOR_SPACING, DEBUG } from '../../utils/constants';
+import * as _ from 'lodash';
+import * as seedrandom from 'seedrandom';
+import Assert from '../util/assert';
+import Component from '../graph/component';
+import LayoutBundle from '../layoutGraph/layoutBundle';
+import LayoutConnector from '../layoutGraph/layoutConnector';
+import LayoutEdge from '../layoutGraph/layoutEdge';
+import LayoutGraph from '../layoutGraph/layoutGraph';
+import LayoutNode from '../layoutGraph/layoutNode';
+import RenderConnector from '../renderGraph/renderConnector';
+import RenderEdge from '../renderGraph/renderEdge';
+import RenderGraph from '../renderGraph/renderGraph';
+import RenderNode from '../renderGraph/renderNode';
+
+export default abstract class Layouter {
+    protected _options: any;
+
+    constructor(options: object = {}) {
+        this._options = _.defaults(options, {
+            targetEdgeLength: 50,
+            withLabels: false,
+            bundle: false,
+            optimizeAngles: false,
+            shuffles: 0,
+            shuffleGlobal: false,
+            weightBends: 0.2,
+            weightCrossings: 1,
+            weightLengths: 0.1,
+            preorderConnectors: false,
+        });
+    }
+
+    public getOptionsForAnalysis(): object {
+        return _.pick(this._options, [
+            'targetEdgeLength',
+            'weightBends',
+            'weightCrossings',
+            'weightLengths',
+        ]);
+    }
+
+    public layout(renderGraph: RenderGraph): LayoutGraph {
+        const layoutGraph = this.createLayoutGraph(renderGraph);
+
+        this._createComponents(layoutGraph);
+
+        if (this._options['bundle']) {
+            this._createBundles(layoutGraph);
+        }
+
+        const tmpRandom = Math.random;
+        seedrandom('I am the seed string.', { global: true });
+        this.doLayout(layoutGraph);
+        Math.random = tmpRandom;
+
+        this._copyLayoutInfo(layoutGraph, renderGraph);
+        if (DEBUG) {
+            Assert.assertAll(renderGraph.allEdges(), (edge: RenderEdge) => edge.points.length > 0, 'edge has no points assigned');
+        }
+
+        return layoutGraph;
+    }
+
+    protected abstract doLayout(graph: LayoutGraph): void;
+
+
+    /**
+     * Places the scoped connectors in the middle and the unscoped evenly on both sides.
+     */
+    protected _placeConnectorsCenter(graph: LayoutGraph): void {
+        _.forEach(graph.allNodes(), (node: LayoutNode) => {
+            const inConnectorsScoped = _.filter(node.inConnectors, connector => connector.isScoped);
+            const inConnectorsUnscoped = _.filter(node.inConnectors, connector => !connector.isScoped);
+            const outConnectorsScoped = _.filter(node.outConnectors, connector => connector.isScoped);
+            const outConnectorsUnscoped = _.filter(node.outConnectors, connector => !connector.isScoped);
+
+            const hasMoreInThanOut = inConnectorsUnscoped.length > outConnectorsUnscoped.length ? 1 : 0;
+            const hasMoreOutThanIn = outConnectorsUnscoped.length > inConnectorsUnscoped.length ? 1 : 0;
+
+            const arrangedInConnectors = [];
+            const arrangedOutConnectors = [];
+            for (let i = 0; i < inConnectorsUnscoped.length; ++i) {
+                const isLeft = i < (inConnectorsUnscoped.length - hasMoreInThanOut) / 2;
+                arrangedInConnectors[i + (isLeft ? 0 : inConnectorsScoped.length)] = inConnectorsUnscoped[i];
+            }
+            let offset = Math.ceil((inConnectorsUnscoped.length - hasMoreInThanOut) / 2);
+            for (let i = 0; i < inConnectorsScoped.length; ++i) {
+                arrangedInConnectors[i + offset] = inConnectorsScoped[i];
+            }
+            for (let i = 0; i < outConnectorsUnscoped.length; ++i) {
+                const isLeft = i < (outConnectorsUnscoped.length - hasMoreOutThanIn) / 2;
+                arrangedOutConnectors[i + (isLeft ? 0 : outConnectorsScoped.length)] = outConnectorsUnscoped[i];
+            }
+            offset = Math.ceil((outConnectorsUnscoped.length - hasMoreOutThanIn) / 2);
+            for (let i = 0; i < outConnectorsScoped.length; ++i) {
+                arrangedOutConnectors[i + offset] = outConnectorsScoped[i];
+            }
+
+            const connectorDifference = node.inConnectors.length - node.outConnectors.length;
+            if (node.inConnectors.length > 0) {
+                let inConnectorsWidth = node.inConnectors.length * CONNECTOR_SIZE + (node.inConnectors.length - 1) * CONNECTOR_SPACING;
+                if (connectorDifference % 2 === -1 && inConnectorsScoped.length > 0) {
+                    inConnectorsWidth += CONNECTOR_SIZE + CONNECTOR_SPACING;
+                }
+                const firstX = node.x + (node.width - inConnectorsWidth) / 2;
+                const y = node.y - CONNECTOR_SIZE / 2;
+                _.forEach(arrangedInConnectors, (connector: LayoutConnector, i) => {
+                    connector.setPosition(firstX + (CONNECTOR_SIZE + CONNECTOR_SPACING) * i, y);
+                });
+            }
+            if (node.outConnectors.length > 0) {
+                let outConnectorsWidth = node.outConnectors.length * CONNECTOR_SIZE + (node.outConnectors.length - 1) * CONNECTOR_SPACING;
+                if (connectorDifference % 2 === 1 && inConnectorsScoped.length > 0) {
+                    outConnectorsWidth += CONNECTOR_SIZE + CONNECTOR_SPACING;
+                }
+                const firstX = node.x + (node.width - outConnectorsWidth) / 2;
+                const y = node.y + node.height - CONNECTOR_SIZE / 2;
+                _.forEach(arrangedOutConnectors, (connector, i) => {
+                    connector.setPosition(firstX + (CONNECTOR_SIZE + CONNECTOR_SPACING) * i, y);
+                });
+            }
+        });
+    }
+
+    protected _matchEdgesToConnectors(layoutGraph: LayoutGraph): void {
+        _.forEach(layoutGraph.allEdges(), (edge: LayoutEdge) => {
+            if (edge.srcConnector !== null) {
+                const srcNode = <LayoutNode>edge.graph.node(edge.src);
+                let srcConnector = srcNode.connector('OUT', edge.srcConnector);
+                if (srcConnector === undefined && srcNode.childGraphs.length > 0) {
+                    const childGraph = srcNode.childGraphs[0];
+                    if (childGraph.exitNode !== null) {
+                        srcConnector = childGraph.exitNode.connector('OUT', edge.srcConnector);
+                    }
+                }
+                if (srcConnector === undefined) {
+                    return;
+                }
+                edge.points[0] = srcConnector.boundingBox().bottomCenter();
+            }
+            if (edge.dstConnector !== null) {
+                const dstNode = <LayoutNode>edge.graph.node(edge.dst);
+                let dstConnector = dstNode.connector('IN', edge.dstConnector);
+                if (dstConnector === undefined && dstNode.childGraphs.length > 0) {
+                    const childGraph = <LayoutGraph>dstNode.childGraphs[0];
+                    if (childGraph.entryNode !== null) {
+                        dstConnector = childGraph.entryNode.connector('IN', edge.dstConnector);
+                    }
+                }
+                if (dstConnector === undefined) {
+                    return;
+                }
+                edge.points[edge.points.length - 1] = dstConnector.boundingBox().topCenter();
+            }
+        });
+    }
+
+    private createLayoutGraph(renderGraph: RenderGraph): LayoutGraph {
+        const transformSubgraph = (renderGraph: RenderGraph): LayoutGraph => {
+            let mayHaveCycles = false;
+            if (renderGraph.parentNode === null || renderGraph.parentNode.type() === 'NestedSDFG') {
+                mayHaveCycles = true;
+            }
+            const layoutGraph = new LayoutGraph(mayHaveCycles);
+
+            // add nodes and create groups for scopes (maps etc.)
+            const createLayoutNode = (node: RenderNode) => {
+                const layoutNode = new LayoutNode(node.size(), node.childPadding);
+                if (node.type() === 'AccessNode') {
+                    layoutNode.isAccessNode = true;
+                }
+                _.forEach(node.inConnectors, (connector: RenderConnector) => {
+                    layoutNode.addConnector('IN', connector.name);
+                });
+                _.forEach(node.outConnectors, (connector: RenderConnector) => {
+                    layoutNode.addConnector('OUT', connector.name);
+                });
+                node.layoutNode = layoutNode;
+                layoutNode.setLabel(node.label()); // for debugging
+                return layoutNode;
+            };
+
+            // create layout nodes for scope entries and scopes around them
+            const layoutChildren = new Map();
+            _.forEach(renderGraph.nodes(), (node: RenderNode) => {
+                if (node.type().endsWith('Entry')) {
+                    // check if corresponding exit node exists
+                    let exitExists = false;
+                    _.forEach(renderGraph.nodes(), (node2: RenderNode) => {
+                        if (node2.type().endsWith('Exit') && node2.scopeEntry === node.id) {
+                            exitExists = true;
+                        }
+                    });
+                    if (!exitExists) {
+                        return;
+                    }
+
+                    const entryNode = createLayoutNode(node);
+                    const scopeNode = new LayoutNode();
+                    const scopeGraph = new LayoutGraph();
+                    scopeNode.setChildGraph(scopeGraph);
+                    scopeGraph.addNode(entryNode);
+                    node.layoutGraph = scopeGraph;
+                    node.layoutNode = entryNode;
+                    scopeGraph.entryNode = entryNode;
+                    scopeNode.isScopeNode = true;
+                    layoutChildren.set(scopeNode, []);
+                    scopeNode.setLabel('Map with entry ' + entryNode.label()); // for debugging
+                }
+            });
+
+            // create unscoped layout nodes and assign children (other than the entry) to the scope node
+            _.forEach(renderGraph.nodes(), (node: RenderNode) => {
+                if (node.scopeEntry === null) {
+                    if (node.layoutNode) {
+                        layoutGraph.addNode(node.layoutGraph.parentNode);
+                    } else {
+                        layoutGraph.addNode(createLayoutNode(node));
+                        node.layoutGraph = layoutGraph;
+                    }
+                } else {
+                    layoutChildren.get((renderGraph.node(node.scopeEntry)).layoutGraph.parentNode).push(node);
+                }
+            });
+
+            // recursively add scope children
+            const addScopeChildren = (layoutGraph: LayoutGraph) => {
+                _.forEach(layoutGraph.nodes(), (node: LayoutNode) => {
+                    if (layoutChildren.has(node)) {
+                        _.forEach(layoutChildren.get(node), (renderNode: RenderNode) => {
+                            if (renderNode.layoutNode) {
+                                // renderNode is an entry node
+                                node.childGraph.addNode(renderNode.layoutGraph.parentNode);
+                            } else {
+                                const layoutNode = createLayoutNode(renderNode);
+                                node.childGraph.addNode(layoutNode);
+                                renderNode.layoutGraph = node.childGraph;
+                                if (renderNode.type().endsWith('Exit')) {
+                                    node.childGraph.exitNode = layoutNode;
+                                }
+                            }
+                        });
+                    }
+                    if (node.childGraph !== null) {
+                        addScopeChildren(node.childGraph);
+                    }
+                });
+            };
+            addScopeChildren(layoutGraph);
+
+            // add edges
+            _.forEach(renderGraph.edges(), (edge: RenderEdge) => {
+                const srcNode = renderGraph.node(edge.src);
+                const dstNode = renderGraph.node(edge.dst);
+                let srcLayoutNode = srcNode.layoutNode;
+                let dstLayoutNode = dstNode.layoutNode;
+                if (srcNode.layoutGraph !== dstNode.layoutGraph) {
+                    if (dstNode.layoutGraph.entryNode === dstLayoutNode) {
+                        dstLayoutNode = dstNode.layoutGraph.parentNode;
+                    }
+                    if (srcNode.layoutGraph.exitNode === srcLayoutNode) {
+                        srcLayoutNode = srcNode.layoutGraph.parentNode;
+                    }
+                }
+                if (DEBUG) {
+                    Assert.assert(srcLayoutNode.graph === dstLayoutNode.graph, 'edge between different graphs', edge);
+                }
+                // add implicit connectors (with name null)
+                if (edge.src !== edge.dst) {
+                    if (srcNode.layoutNode.connector('OUT', edge.srcConnector) === undefined) {
+                        srcNode.layoutNode.addConnector('OUT', edge.srcConnector, true);
+                    }
+                    if (dstNode.layoutNode.connector('IN', edge.dstConnector) === undefined) {
+                        dstNode.layoutNode.addConnector('IN', edge.dstConnector, true);
+                    }
+                }
+                edge.layoutEdge = new LayoutEdge(srcLayoutNode.id, dstLayoutNode.id, edge.srcConnector, edge.dstConnector, edge.labelSize);
+                srcLayoutNode.graph.addEdge(edge.layoutEdge);
+            });
+
+            // recursively transform subgraph
+            _.forEach(renderGraph.nodes(), (node: RenderNode) => {
+                if (node.childGraph !== null) {
+                    node.layoutNode.setChildGraph(transformSubgraph(node.childGraph));
+                }
+            });
+            renderGraph.layoutGraph = layoutGraph;
+            return layoutGraph;
+        };
+        return transformSubgraph(renderGraph);
+    }
+
+    private _createComponents(graph: LayoutGraph): void {
+        _.forEach(graph.allNodes(), (node: LayoutNode) => {
+            if (node.childGraph !== null) {
+                if (node.isScopeNode || node.childGraph.mayHaveCycles) {
+                    node.childGraphs.push(node.childGraph);
+                } else {
+                    // only nodes of type NestedSDFG may have more than one component as child graph
+                    _.forEach(node.childGraph.components(), (component: Component<LayoutNode, LayoutEdge>) => {
+                        const childGraph = new LayoutGraph();
+                        _.forEach(component.nodes(), (node: LayoutNode) => {
+                            childGraph.addNode(node, node.id);
+                        });
+                        _.forEach(component.edges(), (edge: LayoutEdge) => {
+                            childGraph.addEdge(edge, edge.id);
+                        });
+                        node.childGraphs.push(childGraph);
+                        childGraph.parentNode = node;
+                    });
+                    if (node.childGraphs.length === 0) {
+                        node.childGraphs.push(node.childGraph);
+                    }
+                }
+                node.childGraph = null; // property childGraph should not be used after this point
+            }
+        });
+    }
+
+    private printLayout(graph: LayoutGraph, level = 0) {
+        _.forEach(graph.nodes(), (node: LayoutNode) => {
+            console.log('  '.repeat(level) + node.label());
+            _.forEach(node.childGraphs, (childGraph: LayoutGraph) => {
+                this.printLayout(childGraph, level + 1);
+            });
+        });
+    }
+
+    private _createBundles(layoutGraph: LayoutGraph): void {
+        _.forEach(layoutGraph.allGraphs(), (graph: LayoutGraph) => {
+            const bundles = new Map();
+            _.forEach(graph.edges(), (edge: LayoutEdge) => {
+                if ((edge.srcConnector !== null || edge.dstConnector !== null) && (edge.srcConnector === null || edge.dstConnector === null)) {
+                    const key = edge.src + '_' + edge.dst;
+                    const connectorName = edge.srcConnector || edge.dstConnector;
+                    let bundle;
+                    if (!bundles.has(key)) {
+                        bundle = new LayoutBundle();
+                        bundles.set(key, bundle);
+                        if (connectorName === edge.srcConnector) {
+                            let srcNode = graph.node(edge.src);
+                            if (srcNode.isScopeNode) {
+                                srcNode = srcNode.childGraphs[0].exitNode;
+                            }
+                            srcNode.outConnectorBundles.push(bundle);
+                        } else {
+                            let dstNode = graph.node(edge.dst);
+                            if (dstNode.isScopeNode) {
+                                dstNode = dstNode.childGraphs[0].entryNode;
+                            }
+                            dstNode.inConnectorBundles.push(bundle);
+                        }
+                    } else {
+                        bundle = bundles.get(key);
+                    }
+                    bundle.connectors.push(connectorName);
+                    if (edge.srcConnector !== null) {
+                        edge.srcBundle = bundle;
+                    } else {
+                        edge.dstBundle = bundle;
+                    }
+                }
+            });
+        });
+        // as soon as a node has some bundle, all edges have to be assigned a bundle
+        // otherwise edges with and without bundles may create clutter and unwanted crossings
+        _.forEach(layoutGraph.allNodes(), (node: LayoutNode) => {
+            const addBundles = (bundles, connectors, edgeMethod, connectorProp, bundleProp, entryExit) => {
+                if (node[bundles].length > 0) {
+                    let graph = node.graph;
+                    let id = node.id;
+                    if (graph[entryExit] === node) {
+                        graph = node.graph.parentNode.graph;
+                        id = node.graph.parentNode.id;
+                    }
+                    if (_.some(node[bundles], bundle => bundle.connectors.length > 1)) {
+                        const remainingConnectors = new Set();
+                        _.forEach(node[connectors], (connector: LayoutConnector) => {
+                            remainingConnectors.add(connector.name);
+                        });
+                        _.forEach(node[bundles], (bundle: LayoutBundle) => {
+                            _.forEach(bundle.connectors, (name: string) => {
+                                remainingConnectors.delete(name);
+                            });
+                        });
+                        remainingConnectors.forEach((name: string) => {
+                            const bundle = new LayoutBundle();
+                            bundle.addConnector(name);
+                            node[bundles].push(bundle);
+                            _.forEach(graph[edgeMethod](id), (edge: LayoutEdge) => {
+                                if (edge[connectorProp] === name) {
+                                    edge[bundleProp] = bundle;
+                                }
+                            });
+                        });
+                    } else {
+                        node[bundles] = [];
+                        _.forEach(graph[edgeMethod](id), (edge: LayoutEdge) => {
+                            edge[bundleProp] = null;
+                        });
+                    }
+                }
+            };
+            addBundles('inConnectorBundles', 'inConnectors', 'inEdges', 'dstConnector', 'dstBundle', 'entryNode');
+            addBundles('outConnectorBundles', 'outConnectors', 'outEdges', 'srcConnector', 'srcBundle', 'exitNode');
+        });
+        // mark all but one edges in a bundle as replica
+        const bundles = new Set();
+        _.forEach(layoutGraph.allEdges(), (edge: LayoutEdge) => {
+            if (edge.srcBundle !== null || edge.dstBundle !== null) {
+                const bundle = edge.srcBundle || edge.dstBundle;
+                if (bundles.has(bundle)) {
+                    edge.isReplica = true;
+                } else {
+                    bundles.add(bundle);
+                }
+                bundle.edges.push(edge);
+            }
+        });
+    }
+
+    private _copyLayoutInfo(layoutGraph: LayoutGraph, renderGraph: RenderGraph) {
+        _.forEach(renderGraph.allNodes(), (node: RenderNode) => {
+            _.assign(node, node.layoutNode.boundingBox());
+            _.forEach(_.concat(node.inConnectors), (connector: RenderConnector) => {
+                _.assign(connector, node.layoutNode.connector('IN', connector.name).boundingBox());
+            });
+            _.forEach(_.concat(node.outConnectors), (connector: RenderConnector) => {
+                _.assign(connector, node.layoutNode.connector('OUT', connector.name).boundingBox());
+            });
+
+            delete node.layoutGraph;
+            delete node.layoutNode;
+        });
+        _.forEach(renderGraph.allEdges(), (edge: RenderEdge) => {
+            _.assign(edge, _.pick(edge.layoutEdge, ['points']));
+            // duplicate bundle points to make curved edges go through them
+            if (edge.layoutEdge.srcBundle !== null) {
+                edge.points.splice(1, 0, edge.points[1].clone());
+            }
+            if (edge.layoutEdge.dstBundle !== null) {
+                edge.points.splice(edge.points.length - 2, 0, edge.points[edge.points.length - 2].clone());
+            }
+            edge.updateBoundingBox();
+            delete edge.layoutEdge;
+        });
+        _.forEach(renderGraph.allGraphs(), (graph: RenderGraph) => {
+            delete graph.layoutGraph;
+        });
+    }
+
+
+}
diff --git a/src/layouting/layouter/magneticSpringLayouter.ts b/src/layouting/layouter/magneticSpringLayouter.ts
new file mode 100644
index 00000000..4d171ae9
--- /dev/null
+++ b/src/layouting/layouter/magneticSpringLayouter.ts
@@ -0,0 +1,118 @@
+import * as _ from 'lodash';
+import LayoutEdge from '../layoutGraph/layoutEdge';
+import LayoutGraph from '../layoutGraph/layoutGraph';
+import LayoutNode from '../layoutGraph/layoutNode';
+import RecursiveLayouter from './recursiveLayouter';
+import Vector from '../geometry/vector';
+
+export default class MagneticSpringLayouter extends RecursiveLayouter {
+    public static NUM_ITERATIONS = 100;
+    public static STEP_SIZE = 0.1;
+    public static SPRING_WEIGHT = 1;
+    public static REPULSIVE_WEIGHT = 1;
+    public static MAGNETIC_WEIGHT = 1;
+
+    layoutSizedGraph(graph: LayoutGraph) {
+        switch (graph.nodes().length) {
+            case 1:
+                // just one node => place it anywhere
+                graph.nodes()[0].setPosition(new Vector());
+                break;
+
+            case 2:
+                // two nodes => place them above each other
+                const topIndex = Math.round(Math.random());
+                const topNode = graph.nodes()[topIndex];
+                const bottomNode = graph.nodes()[1 - topIndex];
+                topNode.setPosition(new Vector(-topNode.width / 2, -topNode.height / 2));
+                bottomNode.setPosition(new Vector(-bottomNode.width / 2, topNode.height / 2 + this._options.targetEdgeLength));
+                break;
+
+            default:
+                // more nodes => place them on a circle
+                const sToC = 2 / 3 * Math.PI / Math.sqrt(3);
+                let circumference = graph.nodes().length * this._options.targetEdgeLength;
+                const nodeDiagonals = [];
+                _.forEach(graph.nodes(), (node) => {
+                    nodeDiagonals[node.id] = Math.sqrt(node.width * node.width + node.height * node.height);
+                    circumference += nodeDiagonals[node.id];
+                });
+                circumference *= sToC;
+                const diameter = circumference / Math.PI;
+                const radius = diameter / 2;
+                let angle = 0;
+                const shuffledNodes = _.shuffle(graph.nodes());
+                _.forEach(shuffledNodes, (node, i) => {
+                    const center = new Vector(radius * Math.sin(angle), radius * Math.cos(angle));
+                    const topLeft = new Vector(center.x - node.width / 2, center.y - node.height / 2);
+                    node.setPosition(topLeft);
+                    if (i < graph.nodes().length - 1) {
+                        angle += 2 * Math.asin((this._options.targetEdgeLength + nodeDiagonals[node.id] / 2 + nodeDiagonals[shuffledNodes[i + 1].id] / 2) / diameter);
+                    }
+                });
+        }
+
+        // precompute set of neighbors and non-neighbors
+        const neighbors = [];
+        const nonNeighbors = [];
+        _.forEach(graph.nodes(), (nodeA) => {
+            neighbors[nodeA.id] = new Set();
+            nonNeighbors[nodeA.id] = new Set();
+            _.forEach(graph.outEdges(nodeA.id), (edge) => {
+                const dst = edge.dst;
+                if (dst !== nodeA.id) {
+                    neighbors[nodeA.id].add(dst);
+                }
+            });
+            _.forEach(graph.inEdges(nodeA.id), (edge) => {
+                const src = edge.src;
+                if (src !== nodeA.id) {
+                    neighbors[nodeA.id].add(src);
+                }
+            });
+            _.forEach(graph.nodes(), (nodeB) => {
+                if (nodeA.id !== nodeB.id && !neighbors[nodeA.id].has(nodeB.id)) {
+                    nonNeighbors[nodeA.id].add(nodeB.id);
+                }
+            });
+        });
+
+        function distanceVector(srcNode: LayoutNode, dstNode: LayoutNode) {
+            const srcPoint = new Vector(srcNode.x + srcNode.width / 2, srcNode.y + srcNode.height);
+            const dstPoint = new Vector(dstNode.x + dstNode.width / 2, dstNode.y);
+            return dstPoint.sub(srcPoint);
+        }
+
+
+        for (let iteration = 0; iteration < MagneticSpringLayouter.NUM_ITERATIONS; ++iteration) {
+            _.forEach(graph.nodes(), (node: LayoutNode) => {
+                const springForce = new Vector();
+                const repulsiveForce = new Vector();
+                neighbors[node.id].forEach(neighbor => {
+                    const distanceVec = distanceVector(node, <LayoutNode>graph.node(neighbor));
+                    const strength = Math.log(distanceVec.length() / this._options.targetEdgeLength);
+                    springForce.add(distanceVec.normalize().multiplyScalar(strength));
+                });
+                nonNeighbors[node.id].forEach(nonNeighbor => {
+                    const distanceVec = distanceVector(node, <LayoutNode>graph.node(nonNeighbor));
+                    const length = distanceVec.length();
+                    const strength = 1 / (length * length);
+                    repulsiveForce.add(distanceVec.normalize().multiplyScalar(strength));
+                });
+                const force = springForce.multiplyScalar(MagneticSpringLayouter.SPRING_WEIGHT);
+                force.add(repulsiveForce.multiplyScalar(MagneticSpringLayouter.REPULSIVE_WEIGHT));
+                const offset = force.multiplyScalar(MagneticSpringLayouter.STEP_SIZE);
+                node.translate(offset.x, offset.y);
+            });
+        }
+
+        // place edges
+        _.forEach(graph.edges(), (edge: LayoutEdge) => {
+            const srcNode = <LayoutNode>graph.node(edge.src);
+            const srcPoint = new Vector(srcNode.x + srcNode.width / 2, srcNode.y + srcNode.height);
+            const dstNode = <LayoutNode>graph.node(edge.dst);
+            const dstPoint = new Vector(dstNode.x + dstNode.width / 2, dstNode.y);
+            edge.points = [srcPoint, dstPoint];
+        });
+    }
+}
\ No newline at end of file
diff --git a/src/layouting/layouter/recursiveLayouter.ts b/src/layouting/layouter/recursiveLayouter.ts
new file mode 100644
index 00000000..8a702447
--- /dev/null
+++ b/src/layouting/layouter/recursiveLayouter.ts
@@ -0,0 +1,53 @@
+import * as _ from 'lodash';
+import Layouter from './layouter';
+import LayoutNode from '../layoutGraph/layoutNode';
+import LayoutGraph from '../layoutGraph/layoutGraph';
+
+export default abstract class RecursiveLayouter extends Layouter {
+    doLayout(graph: LayoutGraph, withLabels = false) {
+        this.setNodeSizes(graph, withLabels);
+        this.layoutSizedGraph(graph, withLabels);
+        this._placeConnectorsCenter(graph);
+        this._matchEdgesToConnectors(graph);
+    }
+
+    setNodeSizes(graph: LayoutGraph, withLabels = false) {
+        _.forEach(graph.nodes(), (node: LayoutNode) => {
+            let x = 0;
+            _.forEach(node.childGraphs, (childGraph: LayoutGraph) => {
+                let childGraphBox = {
+                    width: 0,
+                    height: 0,
+                    x: 0,
+                    y: 0,
+                };
+                if (childGraph.nodes().length > 0) {
+                    this.doLayout(childGraph, withLabels);
+                    childGraphBox = childGraph.boundingBox();
+                    // child graph's contents can have negative coordinates
+                    childGraph.translateElements(node.padding - childGraphBox.x, node.padding - childGraphBox.y);
+
+                    // make entry and exit nodes match parent width
+                    if (childGraph.entryNode !== null) {
+                        const childNodeBox = childGraph.entryNode.boundingBox();
+                        childGraph.entryNode.setWidth(childGraphBox.width);
+                        childGraph.entryNode.translate(-childNodeBox.x, 0);
+                    }
+                    if (childGraph.exitNode !== null) {
+                        const childNodeBox = childGraph.exitNode.boundingBox();
+                        childGraph.exitNode.setWidth(childGraphBox.width);
+                        childGraph.exitNode.translate(-childNodeBox.x, 0);
+                    }
+                }
+                childGraph.translateElements(x, 0);
+                x += childGraphBox.width + this._options['targetEdgeLength'];
+                node.updateSize({
+                    width: x - this._options['targetEdgeLength'] + 2 * node.padding,
+                    height: Math.max(node.height, childGraphBox.height + 2 * node.padding),
+                });
+            });
+        });
+    }
+
+    abstract layoutSizedGraph(graph: LayoutGraph, withLabels: boolean);
+}
diff --git a/src/layouting/layouter/sugiyamaLayouter.ts b/src/layouting/layouter/sugiyamaLayouter.ts
new file mode 100644
index 00000000..895f8129
--- /dev/null
+++ b/src/layouting/layouter/sugiyamaLayouter.ts
@@ -0,0 +1,1596 @@
+import { CONNECTOR_SIZE, CONNECTOR_SPACING, DEBUG } from '../../utils/constants';
+import * as _ from 'lodash';
+import Assert from '../util/assert';
+import Box from '../geometry/box';
+import Edge from '../graph/edge';
+import Graph from '../graph/graph';
+import Layouter from './layouter';
+import LayoutBundle from '../layoutGraph/layoutBundle';
+import LayoutConnector from '../layoutGraph/layoutConnector';
+import LayoutEdge from '../layoutGraph/layoutEdge';
+import LayoutGraph from '../layoutGraph/layoutGraph';
+import LayoutNode from '../layoutGraph/layoutNode';
+import LevelGraph from '../levelGraph/levelGraph';
+import LevelNode from '../levelGraph/levelNode';
+import Node from '../graph/node';
+import OrderGraph from '../order/orderGraph';
+import OrderGroup from '../order/orderGroup';
+import OrderNode from '../order/orderNode';
+import OrderRank from '../order/orderRank';
+import RankGraph from '../rank/rankGraph';
+import RankNode from '../rank/rankNode';
+import Segment from '../geometry/segment';
+import Shuffle from '../util/shuffle';
+import Timer from '../util/timer';
+import Vector from '../geometry/vector';
+
+export default class SugiyamaLayouter extends Layouter {
+    protected doLayout(graph: LayoutGraph): void {
+        if (graph.numNodes() === 0) {
+            return;
+        }
+        Timer.start(['doLayout']);
+
+        // STEP 1: REMOVE CYCLES
+        Timer.start(['doLayout', 'removeCycles']);
+        this._removeCycles(graph);
+        Timer.stop(['doLayout', 'removeCycles']);
+
+        // STEP 2: ASSIGN RANKS
+        Timer.start(['doLayout', 'assignRanks']);
+        this._assignRanks(graph);
+        Timer.stop(['doLayout', 'assignRanks']);
+
+        // STEP 3: ADD VIRTUAL NODES
+        Timer.start(['doLayout', 'addVirtualNodes']);
+        this._addVirtualNodes(graph);
+        Timer.stop(['doLayout', 'addVirtualNodes']);
+
+        // STEP 4: ASSIGN COORDINATES
+        Timer.start(['doLayout', 'orderRanks']);
+        this._orderRanks(graph);
+        Timer.stop(['doLayout', 'orderRanks']);
+
+        // STEP 5: ASSIGN COORDINATES
+        const segmentsPerRank = [];
+        const crossingsPerRank = [];
+
+        Timer.start(['doLayout', 'assignCoordinates']);
+        this._assignCoordinates(graph, segmentsPerRank, crossingsPerRank);
+        Timer.stop(['doLayout', 'assignCoordinates']);
+
+        // STEP 6 (OPTIONAL): OPTIMIZE ANGLES
+        if (this._options['optimizeAngles']) {
+            this._optimizeAngles(graph, segmentsPerRank, crossingsPerRank);
+        }
+
+        // STEP 7: RESTORE CYCLES
+        Timer.start(['doLayout', 'restoreCycles']);
+        this._restoreCycles(graph);
+        Timer.stop(['doLayout', 'restoreCycles']);
+
+        Timer.stop(['doLayout']);
+    }
+
+    private _removeCycles(graph: LayoutGraph): void {
+        _.forEach(graph.allGraphs(), (subgraph: LayoutGraph) => {
+            if (subgraph.mayHaveCycles) {
+                // remove self-loops
+                _.forEach(subgraph.edges(), (edge: LayoutEdge) => {
+                    if (edge.src === edge.dst) {
+                        subgraph.node(edge.src).selfLoop = edge;
+                        subgraph.removeEdge(edge.id);
+                    }
+                });
+
+                // remove normal cycles
+                const invertedEdges = subgraph.removeCycles();
+                _.forEach(invertedEdges, (edge: LayoutEdge) => {
+                    const newSrc = subgraph.node(edge.src);
+                    const newDst = subgraph.node(edge.dst);
+                    newSrc.addConnector('OUT', 'bottomIn', true);
+                    newDst.addConnector('IN', 'topOut', true);
+                    edge.srcConnector = 'bottomIn';
+                    edge.dstConnector = 'topOut';
+                    if (!_.some(subgraph.outEdges(newDst.id), edge => edge.srcConnector === null)) {
+                        newDst.removeConnector('OUT', null);
+                    }
+                    if (!_.some(subgraph.inEdges(newSrc.id), edge => edge.dstConnector === null)) {
+                        newSrc.removeConnector('IN', null);
+                    }
+                });
+            }
+        });
+    }
+
+    private _assignRanks(graph: LayoutGraph): void {
+        const assignRanksForSubgraph = (subgraph: LayoutGraph) => {
+            if (subgraph.numNodes() === 0) {
+                return; // do nothing for empty subgraphs
+            }
+
+            // first determine the rank span of all nodes
+            _.forEach(subgraph.nodes(), (node: LayoutNode) => {
+                _.forEach(node.childGraphs, (childGraph: LayoutGraph) => {
+                    assignRanksForSubgraph(childGraph);
+                });
+            });
+
+            const rankGraph = new RankGraph();
+            _.forEach(subgraph.nodes(), node => {
+                rankGraph.addNode(new RankNode(node.label()), node.id);
+            });
+            _.forEach(subgraph.edges(), edge => {
+                rankGraph.addEdge(new Edge(edge.src, edge.dst, subgraph.node(edge.src).rankSpan));
+            });
+            rankGraph.rank();
+
+            _.forEach(subgraph.nodes(), node => {
+                node.rank = rankGraph.node(node.id).rank;
+                subgraph.numRanks = Math.max(subgraph.numRanks, node.rank + node.rankSpan);
+            });
+
+            if (subgraph.parentNode !== null) {
+                subgraph.parentNode.rankSpan = Math.max(subgraph.parentNode.rankSpan, subgraph.numRanks);
+            }
+        };
+        assignRanksForSubgraph(graph);
+
+        // transform ranking from local to global
+        const makeRanksAbsolute = (subgraph: LayoutGraph, offset: number) => {
+            subgraph.minRank = offset;
+            _.forEach(subgraph.nodes(), (node: LayoutNode) => {
+                _.forEach(node.childGraphs, (childGraph: LayoutGraph) => {
+                    makeRanksAbsolute(childGraph, offset + node.rank);
+                });
+                node.rank += offset;
+                subgraph.numRanks = Math.max(subgraph.numRanks, node.rank + node.rankSpan - subgraph.minRank);
+            });
+        };
+        makeRanksAbsolute(graph, 0);
+    }
+
+    private _addVirtualNodes(graph: LayoutGraph, addToLevelGraph = false): void {
+        // place intermediate nodes between long edges
+        _.forEach(graph.allEdges(), (edge: LayoutEdge) => {
+            if (edge.isReplica) {
+                return;
+            }
+            const srcNode = edge.graph.node(edge.src);
+            const dstNode = edge.graph.node(edge.dst);
+            if (srcNode.rank + srcNode.rankSpan < dstNode.rank) {
+                let tmpSrcId = srcNode.id;
+                let tmpDstId;
+                const dstConnector = edge.dstConnector;
+                let bundle = ((edge.srcBundle !== null) && (edge.srcBundle.edges.length > 1));
+                for (let tmpDstRank = srcNode.rank + srcNode.rankSpan; tmpDstRank < dstNode.rank; ++tmpDstRank) {
+                    const newNode = new LayoutNode({ width: 0, height: 0 }, 0, !bundle, bundle);
+                    bundle = ((edge.dstBundle !== null) && (edge.dstBundle.edges.length > 1) && (tmpDstRank === dstNode.rank - 2));
+                    newNode.rank = tmpDstRank;
+                    newNode.setLabel('virtual node on edge from ' + srcNode.label() + ' to ' + dstNode.label());
+                    tmpDstId = edge.graph.addNode(newNode, null);
+                    if (addToLevelGraph) {
+                        const levelNode = newNode.graph.levelGraph().addLayoutNode(newNode);
+                        levelNode.position = _.last(srcNode.levelNodes).position;
+                    }
+                    if (tmpDstRank === srcNode.rank + srcNode.rankSpan) {
+                        // original edge is redirected from source to first virtual node
+                        edge.graph.redirectEdge(edge.id, edge.src, tmpDstId);
+                        edge.dstConnector = null;
+                        // add bundle edges
+                        if (edge.srcBundle !== null && edge.srcBundle.edges.length > 1) {
+                            _.forEach(edge.srcBundle.edges, (bundleEdge: LayoutEdge) => {
+                                if (bundleEdge.isReplica) {
+                                    bundleEdge.graph.redirectEdge(bundleEdge.id, bundleEdge.src, tmpDstId);
+                                }
+                            });
+                        }
+                        if (addToLevelGraph) {
+                            const levelEdge = edge.graph.levelGraph().edgeBetween(_.last(srcNode.levelNodes).id, _.first(dstNode.levelNodes).id);
+                            if (levelEdge !== undefined) {
+                                levelEdge.graph.removeEdge(levelEdge.id);
+                            }
+                            edge.graph.levelGraph().addLayoutEdge(edge);
+                        }
+                    } else {
+                        const tmpEdge = new LayoutEdge(tmpSrcId, tmpDstId);
+                        if (!bundle) {
+                            tmpEdge.weight = Number.POSITIVE_INFINITY;
+                        }
+                        tmpEdge.isInverted = edge.isInverted;
+                        edge.graph.addEdge(tmpEdge, null);
+                        if (addToLevelGraph) {
+                            edge.graph.levelGraph().addLayoutEdge(tmpEdge);
+                        }
+                    }
+                    tmpSrcId = tmpDstId;
+                }
+                // last virtual edge has the original dstConnector
+                const tmpEdge = new LayoutEdge(tmpSrcId, dstNode.id, null, dstConnector);
+                tmpEdge.isInverted = edge.isInverted;
+                edge.graph.addEdge(tmpEdge, null);
+                if (addToLevelGraph) {
+                    edge.graph.levelGraph().addLayoutEdge(tmpEdge);
+                }
+                // add bundle edges
+                if ((edge.dstBundle !== null) && (edge.dstBundle.edges.length > 1)) {
+                    _.forEach(edge.dstBundle.edges, (bundleEdge: LayoutEdge) => {
+                        if (bundleEdge.isReplica) {
+                            bundleEdge.graph.redirectEdge(bundleEdge.id, tmpSrcId, bundleEdge.dst);
+                        }
+                    });
+                }
+            }
+        });
+    }
+
+    private _updateLevelNodeRanks(graph: LayoutGraph): void {
+        _.forEach(graph.allNodes(), (layoutNode: LayoutNode) => {
+            _.forEach(layoutNode.levelNodes, (levelNode: LevelNode, r: number) => {
+                levelNode.rank = layoutNode.rank + r;
+            });
+        });
+    }
+
+    private _countCrossings(graph: LayoutGraph): number {
+        const orderGraph = this._createConnectorGraph(graph, true);
+        return orderGraph.order({
+            resolveConflicts: false,
+            doNothing: true
+        });
+    }
+
+    private _createConnectorGraph(graph: LayoutGraph, isPreorder: boolean, shuffleNodes = false, shuffleConnectors = false): OrderGraph {
+        const orderGraph = new OrderGraph;
+        const orderRank = [];
+        for (let r = 0; r < graph.numRanks; ++r) {
+            orderRank[r] = new OrderRank(r);
+            orderGraph.addRank(orderRank[r]);
+        }
+
+        const connectorMap = new Map();
+        const levelNodeMap = new Map();
+
+        // add nodes
+        const addConnectorsForSubgraph = (subgraph: LayoutGraph, indizes: Array<number> = null) => {
+            _.forEach(subgraph.levelGraph().ranks(), (rank: Array<LevelNode>, r) => {
+                let index = (indizes === null ? 0 : indizes[r]);
+                if (shuffleNodes) {
+                    rank = Shuffle.shuffle(rank);
+                }
+                _.forEach(rank, (levelNode: LevelNode) => {
+                    levelNode.position = index;
+                    const node = levelNode.layoutNode;
+                    if (levelNode.isLast) {
+                        let childIndizes = null;
+                        if (node.isScopeNode) {
+                            childIndizes = _.map(node.levelNodes, 'position');
+                        }
+                        _.forEach(node.childGraphs, (childGraph: LayoutGraph) => {
+                            addConnectorsForSubgraph(childGraph, childIndizes);
+                        });
+                    }
+                    if (node.isScopeNode) {
+                        index += node.childGraphs[0].maxNodesPerRank();
+                        return; // do not add connectors for scope nodes
+                    }
+                    let connectorGroup;
+                    const shuffleHierarchy = [null];
+                    _.forEachRight(node.parents(), parent => {
+                        shuffleHierarchy.push(parent);
+                    });
+                    if (isPreorder || levelNode.isFirst) {
+                        connectorGroup = new OrderGroup(levelNode, node.label());
+                        connectorGroup.shuffleHierarchy = shuffleHierarchy;
+                        orderRank[levelNode.rank].addGroup(connectorGroup);
+                        connectorGroup.position = index;
+                        if (levelNode.isFirst) {
+                            // add input connectors
+                            let connectors = node.inConnectors;
+                            if (shuffleConnectors) {
+                                connectors = Shuffle.shuffle(connectors);
+                            }
+                            _.forEach(connectors, (connector: LayoutConnector) => {
+                                const connectorNode = new OrderNode(connector, false, connector.name);
+                                connectorGroup.addNode(connectorNode);
+                                connectorMap.set(connector, connectorNode.id);
+                                if (connector.isScoped) {
+                                    connectorMap.set(connector.counterpart, connectorNode.id);
+                                }
+                            });
+                        }
+                    }
+                    if (isPreorder || levelNode.isLast) {
+                        if (!isPreorder && !node.hasScopedConnectors) {
+                            connectorGroup = new OrderGroup(levelNode, node.label());
+                            connectorGroup.shuffleHierarchy = shuffleHierarchy;
+                            orderRank[levelNode.rank].addGroup(connectorGroup);
+                            connectorGroup.position = index;
+                        }
+                        if (levelNode.isLast) {
+                            // add output connectors
+                            let connectors = node.outConnectors;
+                            if (shuffleConnectors) {
+                                connectors = Shuffle.shuffle(connectors);
+                            }
+                            _.forEach(connectors, (connector: LayoutConnector) => {
+                                if (!connector.isScoped) {
+                                    const connectorNode = new OrderNode(connector, false, connector.name);
+                                    connectorGroup.addNode(connectorNode);
+                                    connectorMap.set(connector, connectorNode.id);
+                                }
+                            });
+                        }
+                    }
+                    if (isPreorder && node.rankSpan > 1) {
+                        const orderNode = new OrderNode(null, !levelNode.isFirst && !levelNode.isLast, node.label());
+                        connectorGroup.addNode(orderNode);
+                        levelNodeMap.set(levelNode, orderNode);
+                    }
+                    index++;
+                });
+                subgraph.levelGraph().invalidateRankOrder();
+            });
+        };
+        addConnectorsForSubgraph(graph);
+
+        // add edges
+        _.forEach(graph.allEdges(), (edge: LayoutEdge) => {
+            let srcNode = edge.graph.node(edge.src);
+            if (srcNode.isScopeNode) {
+                srcNode = srcNode.childGraphs[0].exitNode;
+            }
+            let dstNode = edge.graph.node(edge.dst);
+            if (dstNode.isScopeNode) {
+                dstNode = dstNode.childGraphs[0].entryNode;
+            }
+            if (DEBUG) {
+                Assert.assert(dstNode.rank > srcNode.rank, 'edge not between neighboring ranks', edge, srcNode, dstNode);
+            }
+            let srcOrderNodeId = connectorMap.get(srcNode.connector('OUT', edge.srcConnector));
+            if (srcOrderNodeId === undefined) {
+                srcOrderNodeId = connectorMap.get(srcNode.connector('OUT', 'bottomIn'));
+            }
+            let dstOrderNodeId = connectorMap.get(dstNode.connector('IN', edge.dstConnector));
+            if (dstOrderNodeId === undefined) {
+                dstOrderNodeId = connectorMap.get(srcNode.connector('IN', 'topOut'));
+            }
+            orderGraph.addEdge(new Edge(srcOrderNodeId, dstOrderNodeId, 1));
+        });
+
+        if (isPreorder) {
+            // add intranode edges
+            _.forEach(graph.allNodes(), (node: LayoutNode) => {
+                if (!node.isScopeNode && node.rankSpan > 1) {
+                    for (let r = 0; r < node.levelNodes.length - 1; ++r) {
+                        const srcNode = node.levelNodes[r];
+                        const dstNode = node.levelNodes[r + 1];
+                        const srcOrderNode = levelNodeMap.get(srcNode);
+                        const dstOrderNode = levelNodeMap.get(dstNode);
+                        orderGraph.addEdge(new Edge(srcOrderNode.id, dstOrderNode.id, 1));
+                    }
+                }
+            });
+        }
+
+        return orderGraph;
+    }
+
+    private _orderRanks(graph: LayoutGraph): void {
+
+        const doOrder = (graph: LayoutGraph, shuffle = false): void => {
+            Timer.start(['doLayout', 'orderRanks', 'doOrder']);
+            /**
+             * STEP 1: ORDER NODES BASED ON CONNECTORS (OPTIONAL)
+             * In this step, scope insides and outsides are handled in the same order graph.
+             * If there are nested scopes, they are flattened.
+             */
+            if (this._options['preorderConnectors']) {
+                // order
+                const connectorOrderGraph = this._createConnectorGraph(graph, true, shuffle);
+                connectorOrderGraph.order({
+                    orderGroups: true,
+                    resolveConflicts: false,
+                    shuffles: this._options['shuffleGlobal'] ? 0 : this._options['shuffles']
+                });
+
+                // copy order information from order graph to layout graph
+                _.forEach(connectorOrderGraph.groups(), (orderGroup: OrderGroup) => {
+                    const levelNode = orderGroup.reference;
+                    if (levelNode !== null) {
+                        levelNode.position = orderGroup.position;
+                        let tmpNode = levelNode;
+                        while (tmpNode.layoutNode.graph.entryNode !== null) {
+                            tmpNode = tmpNode.layoutNode.graph.parentNode.levelNodes[levelNode.rank - levelNode.layoutNode.rank];
+                            tmpNode.position = levelNode.position;
+                        }
+                    }
+                });
+            }
+
+            /**
+             * STEP 2: ORDER NODES (OPTIONAL) & RESOLVE CONFLICTS
+             * This is done strictly hierarchically.
+             * Child graphs are represented as a chain over multiple ranks in their parent.
+             */
+
+            const nodeMap: Map<number, number> = new Map(); // map from level node to corresponding order node
+
+            // child graphs are visited before their parents (guaranteed by forEachRight)
+            _.forEachRight(graph.allGraphs(), (subgraph: LayoutGraph) => {
+                this._addVirtualNodes(subgraph, true);
+
+                const levelGraph = subgraph.levelGraph();
+
+                // init graph and ranks
+                const orderGraph = new OrderGraph();
+                const orderGroups = new Array(subgraph.numRanks);
+                for (let r = subgraph.minRank; r < subgraph.minRank + subgraph.numRanks; ++r) {
+                    const orderRank = new OrderRank(r);
+                    orderGraph.addRank(orderRank);
+                    orderGroups[r] = new OrderGroup(null);
+                    orderRank.addGroup(orderGroups[r]);
+                }
+
+                // add nodes
+                const levelNodes = _.clone(levelGraph.nodes());
+                if (shuffle && !this._options['preorderConnectors']) {
+                    Shuffle.shuffle(levelNodes);
+                }
+                _.forEach(levelNodes, (levelNode: LevelNode) => {
+                    const orderNode = new OrderNode(levelNode, levelNode.layoutNode.isVirtual || levelNode.layoutNode.isBundle, levelNode.label());
+                    orderGroups[levelNode.rank].addNode(orderNode, levelNode.id);
+                    nodeMap.set(levelNode.id, orderNode.id);
+                    orderNode.position = levelNode.position; // has no effect when option preorderConnectors is false
+                });
+
+                // add edges
+                // for each pair of nodes, sum up the weights of edges in-between
+                _.forEach(levelGraph.edges(), (edge: Edge<any, any>) => {
+                    const existingEdge = orderGraph.edgeBetween(edge.src, edge.dst);
+                    if (existingEdge === undefined) {
+                        orderGraph.addEdge(new Edge(edge.src, edge.dst, edge.weight));
+                    } else {
+                        existingEdge.weight += edge.weight;
+                    }
+                });
+
+                if (DEBUG) {
+                    Assert.assertAll(orderGraph.edges(), edge => {
+                        const srcNode = edge.graph.node(edge.src);
+                        const dstNode = edge.graph.node(edge.dst);
+                        return (srcNode.group.rank.rank + 1 === dstNode.group.rank.rank);
+                    }, 'order graph edge not between neighboring ranks');
+                }
+
+                // do order
+                orderGraph.order({
+                    countInitial: this._options['preorderConnectors'],
+                    shuffles: this._options['shuffleGlobal'] ? 0 : (this._options['preorderConnectors'] ? 0 : this._options['shuffles']),
+                });
+
+                // copy node order into layout graph
+                const newOrderNodes: Set<OrderNode> = new Set();
+
+                _.forEach(orderGraph.nodes(), (orderNode: OrderNode) => {
+                    let levelNode: LevelNode = orderNode.reference;
+                    if (levelNode === null) {
+                        // virtual node was created by orderGraph.order() => add this node to layout graph
+                        const newLayoutNode = new LayoutNode({ width: 0, height: 0 }, 0, true);
+                        newLayoutNode.setLabel(orderNode.label());
+                        newLayoutNode.rank = orderNode.rank;
+                        subgraph.addNode(newLayoutNode, null);
+                        newOrderNodes.add(orderNode);
+                        levelNode = levelGraph.addLayoutNode(newLayoutNode);
+                        orderNode.reference = levelNode;
+                    } else {
+                        if (levelNode.isFirst) {
+                            levelNode.layoutNode.updateRank(orderNode.rank);//levelNode.layoutNode.rank + orderNode.rank - orderNode.initialRank;
+                        }
+                    }
+                    subgraph.numRanks = Math.max(subgraph.numRanks, levelNode.rank - subgraph.minRank + 1);
+                    levelNode.position = orderNode.position;
+                });
+
+                let tmpSubgraph = subgraph;
+                while (tmpSubgraph.parentNode !== null) {
+                    const parent = tmpSubgraph.parentNode;
+                    const prevRankSpan = parent.rankSpan;
+                    const newRankSpan = Math.max(prevRankSpan, tmpSubgraph.numRanks);
+                    const diff = newRankSpan - prevRankSpan;
+                    if (diff !== 0) {
+                        const levelGraph = parent.graph.levelGraph();
+                        parent.rankSpan = newRankSpan;
+
+                        /**
+                         * UPDATE LEVEL NODES REPRESENTATION IN PARENT
+                         */
+                        const positions = _.map(parent.levelNodes, 'position');
+                        positions.length = newRankSpan;
+                        _.fill(positions, positions[prevRankSpan - 1], prevRankSpan);
+                        const lastLevelNode = _.last(parent.levelNodes);
+                        // add new nodes
+                        const newNodes = [];
+                        for (let r = 0; r < diff; ++r) {
+                            const newNode = new LevelNode(parent, lastLevelNode.rank + r);
+                            levelGraph.addNode(newNode);
+                            newNodes.push(newNode);
+                        }
+                        parent.levelNodes.length--;
+                        Array.prototype.push.apply(parent.levelNodes, newNodes);
+                        parent.levelNodes.push(lastLevelNode);
+                        lastLevelNode.rank += diff;
+                        // redirect last edge
+                        const lastEdge = levelGraph.inEdges(lastLevelNode.id)[0];
+                        levelGraph.redirectEdge(lastEdge.id, _.last(newNodes).id, lastLevelNode.id);
+                        // update positions
+                        _.forEach(parent.levelNodes, (levelNode: LevelNode, r: number) => {
+                            levelNode.position = positions[r];
+                        });
+                        // add edges between new nodes
+                        for (let r = prevRankSpan - 2; r < newRankSpan - 2; ++r) {
+                            levelGraph.addEdge(new Edge(parent.levelNodes[r].id, parent.levelNodes[r + 1].id, Number.POSITIVE_INFINITY));
+                        }
+                        /////////////////////////////////////////////////////
+
+                        _.forEach(parent.graph.bfs(parent.id), (node: LayoutNode) => {
+                            if (node !== parent) {
+                                node.offsetRank(diff);
+                            }
+                            node.graph.numRanks = Math.max(node.graph.numRanks, node.rank + node.rankSpan - node.graph.minRank);
+                        });
+                    }
+                    tmpSubgraph = parent.graph;
+                }
+
+                // find for all new nodes the dominating and dominated non-new node
+                const visited = _.fill(new Array(orderGraph.maxId() + 1), false);
+                const newNodesPerEdge: Map<string, Array<LevelNode>> = new Map();
+                newOrderNodes.forEach((orderNode: OrderNode) => {
+                    if (visited[orderNode.id]) {
+                        return; // start and end node already set
+                    }
+                    let tmpOrderNode = orderNode;
+                    const nodes = [orderNode.reference];
+                    while (newOrderNodes.has(tmpOrderNode) && orderGraph.inEdges(tmpOrderNode.id).length > 0) {
+                        tmpOrderNode = orderGraph.node(orderGraph.inEdges(tmpOrderNode.id)[0].src);
+                        if (newOrderNodes.has(tmpOrderNode)) {
+                            nodes.push(tmpOrderNode.reference);
+                            visited[orderNode.id] = true;
+                        }
+                    }
+                    const startNode = tmpOrderNode;
+                    _.reverse(nodes);
+                    tmpOrderNode = orderNode;
+                    while (newOrderNodes.has(tmpOrderNode) && orderGraph.outEdges(tmpOrderNode.id).length > 0) {
+                        tmpOrderNode = orderGraph.node(orderGraph.outEdges(tmpOrderNode.id)[0].dst);
+                        if (newOrderNodes.has(tmpOrderNode)) {
+                            nodes.push(tmpOrderNode.reference);
+                            visited[orderNode.id] = true;
+                        }
+                    }
+                    const endNode = tmpOrderNode;
+                    const key = startNode.id + '_' + endNode.id;
+                    newNodesPerEdge.set(key, nodes);
+                });
+
+                levelGraph.invalidateRankOrder();
+                const ranks = levelGraph.ranks();
+
+                // remove from layout graph edges that were removed in order graph
+                _.forEach(levelGraph.edges(), levelEdge => {
+                    const orderSrcNodeId = nodeMap.get(levelEdge.src);
+                    const orderDstNodeId = nodeMap.get(levelEdge.dst);
+                    if (orderGraph.edgeBetween(orderSrcNodeId, orderDstNodeId) === undefined) {
+                        levelGraph.removeEdge(levelEdge.id);
+                        const srcLayoutNode = levelGraph.node(levelEdge.src).layoutNode;
+                        const dstLayoutNode = levelGraph.node(levelEdge.dst).layoutNode;
+                        const key = orderSrcNodeId + '_' + orderDstNodeId;
+                        _.forEach(subgraph.edgesBetween(srcLayoutNode.id, dstLayoutNode.id), (layoutEdge: LayoutEdge, e) => {
+                            if (layoutEdge.isReplica) {
+                                return;
+                            }
+                            let newNodes = _.clone(newNodesPerEdge.get(key));
+                            const dstConnector = layoutEdge.dstConnector;
+                            if (e > 0) {
+                                const clonedNewNodes = [];
+                                // create a copy of all new nodes because each edge needs its own virtual nodes
+                                _.forEach(newNodes, (levelNode: LevelNode) => {
+                                    // virtual node was created by orderGraph.order() => add this node to layout graph
+                                    const newLayoutNode = new LayoutNode({ width: 0, height: 0 }, 0, true);
+                                    newLayoutNode.setLabel(levelNode.label());
+                                    newLayoutNode.rank = levelNode.layoutNode.rank;
+                                    subgraph.addNode(newLayoutNode, null);
+                                    const newLevelNode = levelGraph.addLayoutNode(newLayoutNode);
+                                    const rank = ranks[newLayoutNode.rank - subgraph.minRank];
+                                    for (let pos = levelNode.position; pos < rank.length; ++pos) {
+                                        rank[pos].position++;
+                                    }
+                                    rank.splice(levelNode.position - 1, 0, newLevelNode);
+                                    newLevelNode.position = levelNode.position - 1;
+                                    clonedNewNodes.push(newLevelNode);
+                                });
+                                newNodes = clonedNewNodes;
+                            }
+                            newNodes.push(orderGraph.node(orderDstNodeId).reference);
+                            subgraph.removeEdge(layoutEdge.id);
+                            layoutEdge.dst = newNodes[0].layoutNode.id;
+                            layoutEdge.dstConnector = null;
+                            subgraph.addEdge(layoutEdge, layoutEdge.id);
+                            levelGraph.addLayoutEdge(layoutEdge);
+                            for (let n = 1; n < newNodes.length; ++n) {
+                                const tmpSrcLayoutNodeId = newNodes[n - 1].layoutNode.id;
+                                const tmpDstLayoutNodeId = newNodes[n].layoutNode.id;
+                                const tmpDstConnector = ((n === newNodes.length - 1) ? dstConnector : null);
+                                const newLayoutEdge = new LayoutEdge(tmpSrcLayoutNodeId, tmpDstLayoutNodeId, null, tmpDstConnector);
+                                subgraph.addEdge(newLayoutEdge, null);
+                                levelGraph.addLayoutEdge(newLayoutEdge);
+                            }
+                        });
+                    }
+                });
+
+                levelGraph.invalidateRankOrder();
+            });
+
+            this._updateLevelNodeRanks(graph);
+
+            /**
+             * STEP 3: ORDER CONNECTORS
+             */
+
+            // order connectors
+            const connectorOrderGraph = this._createConnectorGraph(graph, false, false, shuffle && !this._options['preorderConnectors']);
+            connectorOrderGraph.order({
+                resolveConflicts: false,
+                shuffles: this._options['shuffleGlobal'] ? 0 : this._options['shuffles']
+            });
+
+            // copy order information from order graph to layout graph
+            _.forEach(connectorOrderGraph.groups(), (orderGroup: OrderGroup) => {
+                const levelNode = orderGroup.reference;
+                if (levelNode !== null) {
+                    const layoutNode = levelNode.layoutNode;
+                    const connectors = { 'IN': [], 'OUT': [] };
+                    _.forEach(orderGroup.orderedNodes(), (orderNode: OrderNode) => {
+                        if (orderNode.reference !== null) {
+                            const connector = orderNode.reference;
+                            connectors[connector.type].push(connector);
+                            if (connector.isScoped) {
+                                connectors['OUT'].push(connector.counterpart);
+                            }
+                        }
+                    });
+                    if (connectors['IN'].length > 0 || connectors['OUT'].length > 0) {
+                        if (connectors['IN'].length > 0 && layoutNode.inConnectorBundles.length > 0) {
+                            this._bundleConnectors(connectors['IN'], connectors['OUT'], layoutNode.inConnectorBundles);
+                        }
+                        if (connectors['OUT'].length > 0 && layoutNode.outConnectorBundles.length > 0) {
+                            this._bundleConnectors(connectors['OUT'], connectors['IN'], layoutNode.outConnectorBundles);
+                        }
+                        if (connectors['IN'].length > 0) {
+                            layoutNode.inConnectors = connectors['IN'];
+                        }
+                        if (connectors['OUT'].length > 0) {
+                            layoutNode.outConnectors = connectors['OUT'];
+                        }
+                    }
+                }
+            });
+            Timer.stop(['doLayout', 'orderRanks', 'doOrder']);
+        };
+
+        if (!this._options['shuffleGlobal']) {
+            doOrder(graph);
+        } else {
+            Timer.start(['doLayout', 'orderRanks', 'cloneGraph']);
+            const graphCopy = _.cloneDeep(graph);
+            Timer.stop(['doLayout', 'orderRanks', 'cloneGraph']);
+            doOrder(graphCopy);
+            let minCrossings = this._countCrossings(graphCopy);
+            let bestGraphCopy = graphCopy;
+            for (let i = 0; i < this._options['shuffles']; ++i) {
+                if (minCrossings === 0) {
+                    break;
+                }
+                Timer.start(['doLayout', 'orderRanks', 'cloneGraph']);
+                const graphCopy = _.cloneDeep(graph);
+                Timer.stop(['doLayout', 'orderRanks', 'cloneGraph']);
+                doOrder(graphCopy, true);
+                const numCrossings = this._countCrossings(graphCopy);
+                if (numCrossings < minCrossings) {
+                    minCrossings = numCrossings;
+                    bestGraphCopy = graphCopy;
+                }
+            }
+
+            const copySubgraph = (from: LayoutGraph, to: LayoutGraph) => {
+                to.minRank = from.minRank;
+                to.numRanks = from.numRanks;
+                _.forEach(from.levelGraph().nodes(), (levelNode: LevelNode) => {
+                    const toNode = to.node(levelNode.layoutNode.id);
+                    if (toNode !== undefined) {
+                        levelNode.layoutNode = toNode;
+                    }
+                });
+                to.setLevelGraph(from.levelGraph());
+                const remainingNodes = new Set();
+                const remainingEdges = new Set();
+                _.forEach(to.nodes(), node => {
+                    remainingNodes.add(node);
+                });
+                _.forEach(to.edges(), edge => {
+                    remainingEdges.add(edge);
+                });
+                _.forEach(from.nodes(), (fromNode: LayoutNode) => {
+                    const toNode = to.node(fromNode.id);
+                    if (toNode === undefined) {
+                        to.addNode(fromNode, fromNode.id);
+                    } else {
+                        remainingNodes.delete(toNode);
+                        _.forEach(fromNode.childGraphs, (childGraph: LayoutGraph, i) => {
+                            copySubgraph(childGraph, toNode.childGraphs[i]);
+                        });
+                        toNode.inConnectors = [];
+                        _.forEach(fromNode.inConnectors, (inConnector: LayoutConnector) => {
+                            toNode.inConnectors.push(toNode.connector('IN', inConnector.name));
+                        });
+                        toNode.outConnectors = [];
+                        _.forEach(fromNode.outConnectors, (outConnector: LayoutConnector) => {
+                            toNode.outConnectors.push(toNode.connector('OUT', outConnector.name));
+                        });
+                        toNode.rank = fromNode.rank;
+                        toNode.levelNodes = fromNode.levelNodes;
+                    }
+                });
+                _.forEach(from.edges(), (fromEdge: LayoutEdge) => {
+                    const toEdge = to.edge(fromEdge.id);
+                    if (toEdge === undefined) {
+                        to.addEdge(fromEdge, fromEdge.id);
+                    } else {
+                        remainingEdges.delete(toEdge);
+                        to.redirectEdge(toEdge.id, fromEdge.src, fromEdge.dst);
+                        toEdge.srcConnector = fromEdge.srcConnector;
+                        toEdge.dstConnector = fromEdge.dstConnector;
+                    }
+                });
+                remainingNodes.forEach((node: LayoutNode) => {
+                    to.removeNode(node.id);
+                });
+                remainingEdges.forEach((edge: LayoutEdge) => {
+                    to.removeEdge(edge.id);
+                });
+            };
+            Timer.start(['doLayout', 'orderRanks', 'copyBack']);
+            copySubgraph(bestGraphCopy, graph);
+            Timer.stop(['doLayout', 'orderRanks', 'copyBack']);
+        }
+    }
+
+    private _bundleConnectors(connectors: Array<LayoutConnector>, counterPartConnectors: Array<LayoutConnector>, bundles: Array<LayoutBundle>): void {
+        // order bundles by the mean of their connectors positions
+        // within a bundle, the connectors do not change their relative position
+        const connectorByName = new Map();
+        const indexByConnector = new Map();
+        _.forEach(connectors, (connector: LayoutConnector, pos: number) => {
+            connectorByName.set(connector.name, connector);
+            indexByConnector.set(connector.name, pos);
+        });
+        const bundleMeans = [];
+        _.forEach(bundles, (bundle: LayoutBundle) => {
+            bundle.connectors = _.sortBy(bundle.connectors, (name: string) => indexByConnector.get(name));
+            bundleMeans.push([bundle, _.mean(_.map(bundle.connectors, (name: string) => indexByConnector.get(name)))]);
+        });
+        connectors.length = 0;
+        _.forEach(_.sortBy(bundleMeans, '1'), ([bundle, mean]) => {
+            _.forEach(bundle.connectors, (name: string) => {
+                const connector = connectorByName.get(name);
+                connectors.push(connector);
+            });
+        });
+
+        // reflect unbroken sequences of scoped connectors on other side
+        const scopeGroups = [];
+        let group = [];
+        _.forEach(connectors, (connector: LayoutConnector, pos: number) => {
+            if (connector.isScoped) {
+                group.push(connector);
+            }
+            if ((pos === connectors.length - 1) || !connectors[pos + 1].isScoped) {
+                scopeGroups.push(group);
+                group = [];
+            }
+        });
+        const counterMeans = [];
+        let scopeCount = 0;
+        let scopeSum = 0;
+        let scopeGroupPointer = 0;
+        _.forEach(counterPartConnectors, (connector: LayoutConnector, pos: number) => {
+            if (connector.isScoped) {
+                scopeSum += pos;
+                if (++scopeCount === scopeGroups[scopeGroupPointer].length) {
+                    counterMeans.push([_.map(scopeGroups[scopeGroupPointer++], 'counterpart'), pos / scopeCount]);
+                    scopeCount = 0;
+                    scopeSum = 0;
+                }
+            } else {
+                counterMeans.push([[connector], pos]);
+            }
+        });
+        counterPartConnectors.length = 0;
+        _.forEach(_.sortBy(counterMeans, '1'), ([connectors, mean]) => {
+            _.forEach(connectors, (connector: LayoutConnector) => {
+                counterPartConnectors.push(connector);
+            });
+        });
+    }
+
+    /**
+     * Assigns coordinates to the nodes, the connectors and the edges.
+     * @param graph
+     * @param segmentsPerRank
+     * @param crossingsPerRank
+     * @private
+     */
+    private _assignCoordinates(graph: LayoutGraph, segmentsPerRank: Array<Array<Segment>>, crossingsPerRank: Array<Array<[Segment, Segment]>>): void {
+        // assign y
+        const rankTops = _.fill(new Array(graph.numRanks + 1), Number.POSITIVE_INFINITY);
+        const rankBottoms = _.fill(new Array(graph.numRanks), Number.NEGATIVE_INFINITY);
+
+        const globalRanks = graph.globalRanks();
+
+        rankTops[0] = 0;
+        for (let r = 0; r < globalRanks.length; ++r) {
+            crossingsPerRank[r] = [];
+            segmentsPerRank[r] = [];
+            let maxBottom = 0;
+            _.forEach(globalRanks[r], (node: LayoutNode) => {
+                node.y = rankTops[r];
+                _.forEach(node.parents(), (parent: LayoutNode) => {
+                    if (parent.rank === node.rank) {
+                        node.y += parent.padding;
+                    }
+                });
+                node.updateSize({ width: 2 * node.padding, height: 2 * node.padding });
+                let height = node.height;
+                if (_.some(node.inConnectors, connector => !connector.isTemporary)) {
+                    node.y += CONNECTOR_SIZE / 2;
+                }
+                if (_.some(node.outConnectors, connector => !connector.isTemporary)) {
+                    height += CONNECTOR_SIZE / 2;
+                }
+                _.forEach(node.parents(), (parent: LayoutNode) => {
+                    if (parent.rank + parent.rankSpan - 1 === node.rank) {
+                        height += parent.padding;
+                        if (_.some(parent.outConnectors, connector => !connector.isTemporary)) {
+                            height += CONNECTOR_SIZE / 2;
+                        }
+                    }
+                });
+                maxBottom = Math.max(maxBottom, node.y + height);
+            });
+            rankBottoms[r] = maxBottom;
+            rankTops[r + 1] = maxBottom + this._options['targetEdgeLength'];
+        }
+
+        // assign x and set size; assign edge and connector coordinates
+        const placeSubgraph = (subgraph: LayoutGraph, offset: number): void => {
+            Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph']);
+
+            // place all subgraphs in order to know their size
+            _.forEach(subgraph.nodes(), (node: LayoutNode) => {
+                let childOffset = 0;
+                _.forEach(node.childGraphs, (childGraph: LayoutGraph) => {
+                    if (childGraph.numNodes() > 0) {
+                        placeSubgraph(childGraph, childOffset);
+                        childOffset += childGraph.boundingBox().width + this._options['targetEdgeLength'];
+                    }
+                });
+            });
+
+            // assign x
+            this._assignX(subgraph, offset + (subgraph.parentNode !== null ? subgraph.parentNode.padding : 0));
+
+            // place self-loops
+            _.forEach(subgraph.nodes(), (node: LayoutNode) => {
+                if (node.selfLoop !== null) {
+                    node.selfLoop.points = [
+                        new Vector(node.x + node.width + node.padding - this._options['targetEdgeLength'], node.y + node.height - 10),
+                        new Vector(node.x + node.width + node.padding, node.y + node.height - 10),
+                        new Vector(node.x + node.width + node.padding, node.y + 10),
+                        new Vector(node.x + node.width + node.padding - this._options['targetEdgeLength'], node.y + 10),
+                    ];
+                }
+            });
+
+            // set parent bounding box on last component
+            const parent = subgraph.parentNode;
+            if (parent !== null && subgraph === _.last(parent.childGraphs)) {
+                let width = 0;
+                let height = 0;
+                let boundingBox;
+                _.forEach(parent.childGraphs, (childGraph: LayoutGraph) => {
+                    boundingBox = childGraph.boundingBox(false);
+                    if (_.some(parent.outConnectors, connector => !connector.isTemporary)) {
+                        boundingBox.height -= CONNECTOR_SIZE / 2;
+                    }
+                    width += boundingBox.width + this._options['targetEdgeLength'];
+                    height = Math.max(height, boundingBox.height);
+                });
+                width += 2 * parent.padding - this._options['targetEdgeLength'];
+                if (parent.selfLoop !== null) {
+                    width += this._options['targetEdgeLength'];
+                }
+                height += 2 * subgraph.parentNode.padding;
+                parent.updateSize({ width: width, height: height });
+                if (parent.isScopeNode) {
+                    const left = boundingBox.x;
+                    subgraph.entryNode.setWidth(boundingBox.width);
+                    subgraph.entryNode.setPosition(new Vector(left, subgraph.entryNode.y));
+                    subgraph.exitNode.setWidth(boundingBox.width);
+                    subgraph.exitNode.setPosition(new Vector(left, subgraph.exitNode.y));
+                }
+            }
+
+            Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeConnectors']);
+            // place connectors
+            _.forEach(subgraph.nodes(), (node: LayoutNode) => {
+                this._placeConnectors(node, rankTops, rankBottoms);
+            });
+            Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeConnectors']);
+
+            /**
+             * PLACE EDGES
+             * (self-loops handled above)
+             */
+
+            const getInPoint = (node: LayoutNode, edge: LayoutEdge): Vector => {
+                node = (node.isScopeNode ? node.childGraphs[0].entryNode : node);
+                const dstConnector = node.connector('IN', edge.dstConnector);
+                return dstConnector.boundingBox().topCenter();
+            };
+
+            const getInProxyPoint = (node: LayoutNode, inPoint: Vector): Vector => {
+                const proxyPoint = inPoint.clone();
+                proxyPoint.y = rankTops[node.rank];
+                return proxyPoint;
+            };
+
+            const getOutPoint = (node: LayoutNode, edge: LayoutEdge): Vector => {
+                node = (node.isScopeNode ? node.childGraphs[0].exitNode : node);
+                const srcConnector = node.connector('OUT', edge.srcConnector);
+                return srcConnector.boundingBox().bottomCenter();
+            };
+
+            const getOutProxyPoint = (node: LayoutNode, outPoint: Vector): Vector => {
+                const proxyPoint = outPoint.clone();
+                proxyPoint.y = rankBottoms[node.rank + node.rankSpan - 1];
+                return proxyPoint;
+            };
+
+            Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeEdges']);
+            // mark nodes that do not need proxies
+            Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeEdges', 'markNoProxies']);
+            const noInProxyNodes = new Set();
+            const noOutProxyNodes = new Set();
+            _.forEach(subgraph.levelGraph().ranks(), (rank: Array<LevelNode>) => {
+                _.forEach(rank, (levelNode: LevelNode, pos: number) => {
+                    const node = levelNode.layoutNode;
+
+                    let leftBoundary = Number.NEGATIVE_INFINITY;
+                    if (pos > 0) {
+                        leftBoundary = rank[pos - 1].layoutNode.boundingBox().right();
+                    }
+                    let rightBoundary = Number.POSITIVE_INFINITY;
+                    if (pos < rank.length - 1) {
+                        rightBoundary = rank[pos + 1].layoutNode.boundingBox().left();
+                    }
+
+                    if (!node.isVirtual && node.graph.numInEdges(node.id) > 0 && node.inConnectorBundles.length === 0) {
+                        let minPos = Number.POSITIVE_INFINITY;
+                        let maxPos = Number.NEGATIVE_INFINITY;
+                        _.forEach(node.graph.inEdges(node.id), (edge: LayoutEdge) => {
+                            const dstPoint = getInPoint(node, edge);
+                            const dstProxyPoint = getInProxyPoint(node, dstPoint);
+                            if (_.isEqual(dstPoint, dstProxyPoint)) {
+                                return;
+                            }
+                            const srcPoint = getOutPoint(node.graph.node(edge.src), edge);
+                            const intersection = dstPoint.clone().sub(dstPoint.clone().sub(srcPoint).setY(dstPoint.y - dstProxyPoint.y));
+                            minPos = Math.min(minPos, intersection.x);
+                            maxPos = Math.max(maxPos, intersection.x);
+                        });
+                        if (minPos > leftBoundary && maxPos < rightBoundary) {
+                            noInProxyNodes.add(node);
+                        }
+                    }
+                    if (!node.isVirtual && node.graph.outEdges(node.id).length > 0 && node.outConnectorBundles.length === 0) {
+                        let minPos = Number.POSITIVE_INFINITY;
+                        let maxPos = Number.NEGATIVE_INFINITY;
+                        _.forEach(node.graph.outEdges(node.id), (edge: LayoutEdge) => {
+                            const srcPoint = getOutPoint(node, edge);
+                            const srcProxyPoint = getOutProxyPoint(node, srcPoint);
+                            if (_.isEqual(srcPoint, srcProxyPoint)) {
+                                return;
+                            }
+                            const dstPoint = getInPoint(node.graph.node(edge.dst), edge);
+                            const intersection = srcPoint.clone().add(dstPoint.clone().sub(srcPoint).setY(srcProxyPoint.y - srcPoint.y));
+                            minPos = Math.min(minPos, intersection.x);
+                            maxPos = Math.max(maxPos, intersection.x);
+                        });
+                        if (minPos > leftBoundary && maxPos < rightBoundary) {
+                            noOutProxyNodes.add(node);
+                        }
+                    }
+                });
+            });
+            Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeEdges', 'markNoProxies']);
+
+            _.forEach(subgraph.edges(), (edge: LayoutEdge) => {
+                if (edge.isReplica) {
+                    return; // replica edges are added with their primary
+                }
+                let startNode = subgraph.node(edge.src);
+                if (startNode.isVirtual) {
+                    return; // do not assign points to this edge
+                }
+                if (startNode.isScopeNode) {
+                    startNode = startNode.childGraphs[0].exitNode;
+                }
+
+                const startPoint = getOutPoint(startNode, edge);
+                const startProxyPoint = (edge.srcBundle !== null ? edge.srcBundle.position() : getOutProxyPoint(startNode, startPoint));
+                edge.points = [startPoint];
+                if (!_.isEqual(startPoint, startProxyPoint) && !noOutProxyNodes.has(startNode)) {
+                    edge.points.push(startProxyPoint);
+                }
+
+                let nextNode = subgraph.node(edge.dst);
+                let tmpEdge = null;
+                while (nextNode.isVirtual || nextNode.isBundle) {
+                    const nextPoint = getInPoint(nextNode, edge);
+                    const nextInProxyPoint = getInProxyPoint(nextNode, nextPoint);
+                    const nextOutProxyPoint = getOutProxyPoint(nextNode, nextPoint);
+                    if (!_.isEqual(nextInProxyPoint, nextPoint)) {
+                        edge.points.push(nextInProxyPoint);
+                    }
+                    edge.points.push(nextPoint);
+                    if (!_.isEqual(nextOutProxyPoint, nextPoint)) {
+                        edge.points.push(nextOutProxyPoint);
+                    }
+                    tmpEdge = subgraph.outEdges(nextNode.id)[0];
+                    nextNode = subgraph.node(tmpEdge.dst);
+                }
+                let endNode = nextNode;
+                if (endNode.isScopeNode) {
+                    endNode = endNode.childGraphs[0].entryNode;
+                }
+                if (tmpEdge !== null) {
+                    edge.dstConnector = tmpEdge.dstConnector;
+                }
+                const endPoint = getInPoint(endNode, edge);
+                const endProxyPoint = (edge.dstBundle !== null ? edge.dstBundle.position() : getInProxyPoint(endNode, endPoint));
+                if (!_.isEqual(endProxyPoint, endPoint) && !noInProxyNodes.has(endNode)) {
+                    edge.points.push(endProxyPoint);
+                }
+
+                edge.points.push(endPoint);
+
+                // redirect edge from start to end
+                if (tmpEdge !== null) {
+                    edge.graph.removeEdge(edge.id);
+                    edge.dst = tmpEdge.dst;
+                    edge.graph.addEdge(edge, edge.id);
+                }
+
+                // place replicas
+                if (edge.srcBundle !== null) {
+                    _.forEach(edge.srcBundle.edges, (bundleEdge: LayoutEdge) => {
+                        if (bundleEdge.isReplica) {
+                            bundleEdge.points = _.cloneDeep(edge.points);
+                            bundleEdge.points[0] = getOutPoint(startNode, bundleEdge);
+                        }
+                    });
+                }
+                if (edge.dstBundle !== null) {
+                    _.forEach(edge.dstBundle.edges, (bundleEdge: LayoutEdge) => {
+                        if (bundleEdge.isReplica) {
+                            bundleEdge.points = _.cloneDeep(edge.points);
+                            bundleEdge.points[bundleEdge.points.length - 1] = getInPoint(endNode, bundleEdge);
+                        }
+                    });
+                }
+            });
+
+            _.forEach(_.clone(subgraph.nodes()), (node: LayoutNode) => {
+                // remove virtual nodes and edges
+                Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeEdges', 'removeVirtual']);
+                if (node.isVirtual) {
+                    _.forEach(subgraph.inEdges(node.id), (inEdge) => {
+                        subgraph.removeEdge(inEdge.id);
+                    });
+                    _.forEach(subgraph.outEdges(node.id), (outEdge) => {
+                        subgraph.removeEdge(outEdge.id);
+                    });
+                    subgraph.removeNode(node.id);
+                }
+                Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeEdges', 'removeVirtual']);
+
+                // place self-loops visually outside their state
+                if (node.selfLoop !== null) {
+                    node.setWidth(node.width - this._options['targetEdgeLength']);
+                }
+            });
+            Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'placeEdges']);
+
+            // mark crossings for later angle optimization
+            if (this._options['optimizeAngles']) {
+                this._markCrossings(subgraph, segmentsPerRank, crossingsPerRank, rankTops, rankBottoms);
+            }
+
+            Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph']);
+        };
+
+        placeSubgraph(graph, 0);
+    }
+
+    private _assignX(subgraph: LayoutGraph, offset = 0) {
+        Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX']);
+        Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX', 'cloneGraphs']);
+        const alignGraphs: Array<LevelGraph> = [
+            <LevelGraph>subgraph.levelGraph().clone(),
+            <LevelGraph>subgraph.levelGraph().clone(),
+            <LevelGraph>subgraph.levelGraph().clone(),
+            <LevelGraph>subgraph.levelGraph().clone(),
+        ];
+        Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX', 'cloneGraphs']);
+
+        this._alignMedian(alignGraphs[0], 'UP', 'LEFT');
+        this._alignMedian(alignGraphs[1], 'UP', 'RIGHT');
+        this._alignMedian(alignGraphs[2], 'DOWN', 'LEFT');
+        this._alignMedian(alignGraphs[3], 'DOWN', 'RIGHT');
+
+        // align left-most and right-most nodes
+        Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX', 'merge']);
+        let minMaxX = Number.POSITIVE_INFINITY;
+        _.forEach(alignGraphs, (alignGraph: LevelGraph) => {
+            minMaxX = Math.min(minMaxX, alignGraph.maxX());
+        });
+        _.forEach([1, 3], (i: number) => {
+            const alignGraph = alignGraphs[i];
+            const maxX = alignGraph.maxX();
+            if (maxX === minMaxX) {
+                return; // no need to adjust this graph
+            }
+            const diff = minMaxX - maxX;
+            _.forEach(alignGraph.nodes(), (node: LevelNode) => {
+                node.x += diff;
+            });
+        });
+
+        let minX = Number.POSITIVE_INFINITY;
+        _.forEach(subgraph.levelGraph().nodes(), (node: LevelNode) => {
+            const xs = _.sortBy(_.map(alignGraphs, alignGraph => alignGraph.node(node.id).x));
+            let x = (xs[1] + xs[2]) / 2;
+            //x = alignGraphs[0].node(node.id).x; // uncomment to see 1 of the 4 merged layouts
+            x -= node.layoutNode.width / 2;
+            minX = Math.min(minX, x);
+            node.layoutNode.updatePosition(new Vector(offset + x, node.layoutNode.y));
+        });
+        const diff = 0 - minX;
+        _.forEach(subgraph.nodes(), (node: LayoutNode) => {
+            node.translate(diff, 0);
+        });
+        Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX', 'merge']);
+
+        Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX']);
+    }
+
+    private _alignMedian(levelGraph: LevelGraph, neighbors: 'UP' | 'DOWN', preference: 'LEFT' | 'RIGHT'): void {
+        Timer.start(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX', 'alignMedian']);
+        const ranks = levelGraph.ranks();
+        const firstRank = (neighbors === 'UP' ? 1 : (ranks.length - 2));
+        const lastRank = (neighbors === 'UP' ? (ranks.length - 1) : 0);
+        const verticalDir = (neighbors === 'UP' ? 1 : -1);
+        const neighborOutMethod = (neighbors === 'UP' ? 'outEdges' : 'inEdges');
+        const neighborInMethod = (neighbors === 'UP' ? 'inEdges' : 'outEdges');
+        const neighborEdgeInAttr = (neighbors === 'UP' ? 'dst' : 'src');
+
+        const blockPerNode = new Array(levelGraph.maxId() + 1);
+        const nodesPerBlock = new Array(levelGraph.maxId() + 1);
+        const blockWidths = new Array(levelGraph.maxId() + 1);
+        const blockGraph = new RankGraph();
+        const auxBlockGraph = new Graph();
+
+        const r = firstRank - verticalDir;
+        let blockId = 0;
+        for (let n = 0; n < ranks[r].length; ++n) {
+            blockGraph.addNode(new RankNode(blockId.toString()));
+            auxBlockGraph.addNode(new Node(blockId.toString()), blockId);
+            blockPerNode[ranks[r][n].id] = blockId;
+            nodesPerBlock[blockId] = [ranks[r][n].id];
+            blockWidths[blockId] = ranks[r][n].layoutNode.width;
+            blockId++;
+        }
+        for (let n = 1; n < ranks[r].length; ++n) {
+            const edgeLength = (ranks[r][n - 1].layoutNode.width + ranks[r][n].width) / 2 + this._options['targetEdgeLength'];
+            blockGraph.addEdge(new Edge(blockPerNode[ranks[r][n - 1].id], blockPerNode[ranks[r][n].id], edgeLength));
+        }
+        for (let r = firstRank; r - verticalDir !== lastRank; r += verticalDir) {
+            // create sorted list of neighbors
+            const neighbors: Array<Array<number>> = new Array(ranks[r].length);
+            const neighborsUsable: Array<Array<boolean>> = new Array(ranks[r].length);
+            _.forEach(ranks[r], (node: LevelNode, n) => {
+                neighbors[n] = [];
+                neighborsUsable[n] = [];
+            });
+            _.forEach(ranks[r - verticalDir], (neighbor: LevelNode, n) => {
+                _.forEach(levelGraph[neighborOutMethod](neighbor.id), (edge: Edge<any, any>) => {
+                    const node = levelGraph.node(edge[neighborEdgeInAttr]);
+                    neighbors[node.position].push(n);
+                });
+            });
+
+            // mark segments that cross a heavy segment as non-usable
+
+            let heavyLeft = -1;
+            let n = 0;
+            for (let tmpN = 0; tmpN < ranks[r].length; ++tmpN) {
+                if (tmpN === ranks[r].length - 1 || _.filter(levelGraph[neighborInMethod](ranks[r][tmpN].id), edge => edge.weight === Number.POSITIVE_INFINITY).length > 0) {
+                    let heavyRight = ranks[r - verticalDir].length + 1;
+                    if (_.filter(levelGraph[neighborInMethod](ranks[r][tmpN].id), edge => edge.weight === Number.POSITIVE_INFINITY).length > 0) {
+                        heavyRight = neighbors[tmpN][0];
+                    }
+                    while (n <= tmpN) {
+                        _.forEach(neighbors[n], (neighborPos: number, neighborIndex: number) => {
+                            neighborsUsable[n][neighborIndex] = neighborPos >= heavyLeft && neighborPos <= heavyRight;
+                        });
+                        n++;
+                    }
+                    heavyLeft = heavyRight;
+                }
+            }
+
+            let maxNeighborTaken = (preference === 'LEFT' ? Number.NEGATIVE_INFINITY : Number.POSITIVE_INFINITY);
+            const compare = (preference === 'LEFT' ? ((a, b) => a < b) : ((a, b) => a > b));
+            const nMin = (preference === 'LEFT' ? 0 : ranks[r].length - 1);
+            const nMax = (preference === 'LEFT' ? ranks[r].length - 1 : 0);
+            const horizontalDir = (preference === 'LEFT' ? 1 : -1);
+            for (let n = nMin; n - horizontalDir !== nMax; n += horizontalDir) {
+                let neighbor = null;
+                if (neighbors[n].length > 0) {
+                    const leftMedian = Math.floor((neighbors[n].length - 1) / 2);
+                    const rightMedian = Math.floor((neighbors[n].length) / 2);
+                    const tryOrder = (preference === 'LEFT' ? [leftMedian, rightMedian] : [rightMedian, leftMedian]);
+                    _.forEach(tryOrder, (neighborIndex: number) => {
+                        if (neighbor !== null) {
+                            return; // already found
+                        }
+                        if (neighborsUsable[n][neighborIndex] && compare(maxNeighborTaken, neighbors[n][neighborIndex])) {
+                            neighbor = ranks[r - verticalDir][neighbors[n][neighborIndex]];
+                            maxNeighborTaken = neighbors[n][neighborIndex];
+                        }
+                    });
+                }
+                if (neighbor === null) {
+                    blockGraph.addNode(new RankNode(blockId.toString()));
+                    auxBlockGraph.addNode(new Node(blockId.toString()), blockId);
+                    blockPerNode[ranks[r][n].id] = blockId;
+                    nodesPerBlock[blockId] = [ranks[r][n].id];
+                    blockWidths[blockId] = ranks[r][n].layoutNode.width;
+                    blockId++;
+                } else {
+                    const blockId = blockPerNode[neighbor.id];
+                    blockPerNode[ranks[r][n].id] = blockId;
+                    nodesPerBlock[blockId].push(ranks[r][n].id);
+                    blockWidths[blockId] = Math.max(blockWidths[blockId], ranks[r][n].layoutNode.width);
+                }
+            }
+            for (let n = 1; n < ranks[r].length; ++n) {
+                const edgeLength = (ranks[r][n - 1].layoutNode.width + ranks[r][n].layoutNode.width) / 2 + this._options['targetEdgeLength'];
+                blockGraph.addEdge(new Edge(blockPerNode[ranks[r][n - 1].id], blockPerNode[ranks[r][n].id], edgeLength));
+            }
+        }
+
+        // compact
+        blockGraph.rank();
+        _.forEach(levelGraph.nodes(), (node: LevelNode) => {
+            node.x = blockGraph.node(blockPerNode[node.id]).rank;
+        });
+
+        // move blocks that are only connected on the right side as far right as possible
+        _.forEach(levelGraph.edges(), edge => {
+            if (blockPerNode[edge.src] !== blockPerNode[edge.dst]) {
+                auxBlockGraph.addEdge(new Edge(blockPerNode[edge.src], blockPerNode[edge.dst]));
+            }
+        });
+        _.forEach(auxBlockGraph.nodes(), block => {
+            const blockId = block.id;
+            const nodeX = levelGraph.node(nodesPerBlock[blockId][0]).x + blockWidths[blockId] / 2;
+            let hasLeftEdge = false;
+            let hasRightEdge = false;
+            _.forEach(auxBlockGraph.neighbors(blockId), neighbor => {
+                const neighborX = levelGraph.node(nodesPerBlock[neighbor.id][0]).x - blockWidths[neighbor.id] / 2;
+                if (nodeX < neighborX) {
+                    hasRightEdge = true;
+                } else {
+                    hasLeftEdge = true;
+                }
+            });
+            if (hasRightEdge && !hasLeftEdge) {
+                // figure how much the block can be moved
+                let minRightEdgeLength = Number.POSITIVE_INFINITY;
+                _.forEach(blockGraph.outEdges(blockId), outEdge => {
+                    const neighborX = levelGraph.node(nodesPerBlock[outEdge.dst][0]).x - blockWidths[outEdge.dst] / 2;
+                    minRightEdgeLength = Math.min(minRightEdgeLength, neighborX - nodeX);
+                });
+                // move it
+                if (minRightEdgeLength > this._options['targetEdgeLength']) {
+                    const offset = minRightEdgeLength - this._options['targetEdgeLength'];
+                    _.forEach(nodesPerBlock[blockId], nodeId => {
+                        levelGraph.node(nodeId).x += offset;
+                    });
+                }
+            }
+        });
+        Timer.stop(['doLayout', 'assignCoordinates', 'placeSubgraph', 'assignX', 'alignMedian']);
+    }
+
+    private _restoreCycles(graph: LayoutGraph): void {
+        _.forEach(graph.allEdges(), (edge: LayoutEdge) => {
+            if (edge.isInverted) {
+                edge.graph.invertEdge(edge.id);
+                edge.points = _.reverse(edge.points);
+                edge.isInverted = false;
+            }
+        });
+    }
+
+    private _placeConnectors(node: LayoutNode, rankTops: Array<number>, rankBottoms: Array<number>): void {
+        if (node.inConnectors.length === 0 && node.outConnectors.length === 0) {
+            return; // no connectors
+        }
+        let tmpInConnectors = [];
+        let tmpOutConnectors = [];
+        const SPACE = CONNECTOR_SPACING;
+        const SIZE = CONNECTOR_SIZE;
+        const inY = node.y - SIZE / 2;
+        const outY = node.y + node.height - SIZE / 2;
+        let inPointer = 0;
+        let outPointer = 0;
+        let x = node.x;
+
+        const placeTmpConnectors = (x, tmpInConnectors: Array<LayoutConnector>, tmpOutConnectors: Array<LayoutConnector>) => {
+            const length = Math.max(tmpInConnectors.length, tmpOutConnectors.length) * (SIZE + SPACE) - SPACE;
+            let inSpace = SPACE;
+            let inOffset = 0;
+            if (tmpInConnectors.length < tmpOutConnectors.length) {
+                inSpace = (length - (tmpInConnectors.length * SIZE)) / (tmpInConnectors.length + 1);
+                inOffset = inSpace;
+            }
+            let outSpace = SPACE;
+            let outOffset = 0;
+            if (tmpOutConnectors.length < tmpInConnectors.length) {
+                outSpace = (length - (tmpOutConnectors.length * SIZE)) / (tmpOutConnectors.length + 1);
+                outOffset = outSpace;
+            }
+            _.forEach(tmpInConnectors, (connector, i) => {
+                connector.x = x + inOffset + i * (inSpace + SIZE);
+                connector.y = inY;
+            });
+            _.forEach(tmpOutConnectors, (connector, i) => {
+                connector.x = x + outOffset + i * (outSpace + SIZE);
+                connector.y = outY;
+            });
+            return x + length + SPACE;
+        };
+
+        while (inPointer < node.inConnectors.length || outPointer < node.outConnectors.length) {
+            if (inPointer === node.inConnectors.length) {
+                tmpOutConnectors.push(node.outConnectors[outPointer++]);
+            } else if (outPointer === node.outConnectors.length) {
+                tmpInConnectors.push(node.inConnectors[inPointer++]);
+            } else {
+                let scoped = false;
+                if (node.inConnectors[inPointer].isScoped) {
+                    scoped = true;
+                    while (!node.outConnectors[outPointer].isScoped) {
+                        tmpOutConnectors.push(node.outConnectors[outPointer++]);
+                    }
+                } else if (node.outConnectors[outPointer].isScoped) {
+                    scoped = true;
+                    while (!node.inConnectors[inPointer].isScoped) {
+                        tmpInConnectors.push(node.inConnectors[inPointer++]);
+                    }
+                } else {
+                    tmpInConnectors.push(node.inConnectors[inPointer++]);
+                    tmpOutConnectors.push(node.outConnectors[outPointer++]);
+                }
+                if (scoped) {
+                    x = placeTmpConnectors(x, tmpInConnectors, tmpOutConnectors);
+                    const scopedConnectorIn = node.inConnectors[inPointer++];
+                    scopedConnectorIn.x = x;
+                    scopedConnectorIn.y = inY;
+                    const scopedConnectorOut = node.outConnectors[outPointer++];
+                    scopedConnectorOut.x = x;
+                    scopedConnectorOut.y = outY;
+                    x += SIZE + SPACE;
+                    tmpInConnectors = [];
+                    tmpOutConnectors = [];
+                }
+            }
+        }
+        placeTmpConnectors(x, tmpInConnectors, tmpOutConnectors);
+        const auxBox = new Box(
+            node.x,
+            node.y,
+            Math.max(node.inConnectors.length, node.outConnectors.length) * (SPACE + SIZE) - SPACE,
+            SIZE
+        ).centerIn(node.boundingBox());
+        _.forEach(node.connectors(), (connector: LayoutConnector) => {
+            connector.translate(auxBox.x - node.x + (connector.isTemporary ? SPACE / 2 : 0), connector.isTemporary ? SPACE / 2 : 0);
+        });
+
+        // place bundles
+        _.forEach(node.inConnectorBundles, (inBundle: LayoutBundle) => {
+            const top = rankTops[node.rank];
+            inBundle.y = Math.min(top, node.y - CONNECTOR_SIZE / 2 - this._options['targetEdgeLength'] / 3);
+            inBundle.x = _.mean(_.map(inBundle.connectors, (name: string) => node.connector('IN', name).x)) + SIZE / 2;
+        });
+        _.forEach(node.outConnectorBundles, (outBundle: LayoutBundle) => {
+            const bottom = rankBottoms[node.rank + node.rankSpan - 1];
+            outBundle.y = Math.max(bottom, node.y + node.height + CONNECTOR_SIZE / 2 + this._options['targetEdgeLength'] / 3);
+            outBundle.x = _.mean(_.map(outBundle.connectors, (name: string) => node.connector('OUT', name).x)) + SIZE / 2;
+        });
+    }
+
+    private _markCrossings(subgraph: LayoutGraph, segmentsPerRank: Array<Array<Segment>>,
+        crossingsPerRank: Array<Array<[Segment, Segment]>>, rankTops: Array<number>,
+        rankBottoms: Array<number>): void {
+        const endpointsPerRank = new Array(rankTops.length);
+        for (let r = 1; r < rankTops.length; ++r) {
+            endpointsPerRank[r] = [];
+        }
+        _.forEach(subgraph.edges(), (edge: LayoutEdge) => {
+            _.forEach(edge.rawSegments(), (segment: Segment) => {
+                const startRank = _.sortedIndex(rankBottoms, segment.start.y);
+                if ((startRank < rankTops.length - 1) && (segment.end.y >= rankTops[startRank + 1])) {
+                    const start = segment.start.clone();
+                    if (segment.start.y < rankBottoms[startRank]) {
+                        start.add(segment.vector().setY(rankBottoms[startRank] - segment.start.y));
+                    }
+                    let end = segment.end.clone();
+                    if (segment.end.y > rankTops[startRank + 1]) {
+                        end = start.clone().add(segment.vector().setY(this._options['targetEdgeLength']));
+                    }
+                    segment = new Segment(start, end);
+                    endpointsPerRank[startRank + 1].push([segment.start, segment]);
+                    endpointsPerRank[startRank + 1].push([segment.end, segment]);
+                    segmentsPerRank[startRank + 1].push(segment);
+                }
+            });
+        });
+        for (let r = 1; r < rankTops.length; ++r) {
+            const pointsSorted = _.sortBy(endpointsPerRank[r], ([point, segment]) => point.x); // sort by x
+
+            const openSegments: Set<Segment> = new Set();
+            _.forEach(pointsSorted, ([point, segment]) => {
+                if (openSegments.has(segment)) {
+                    openSegments.delete(segment);
+                } else {
+                    openSegments.forEach((otherSegment) => {
+                        if ((segment.start.x !== otherSegment.start.x) &&
+                            (segment.end.x !== otherSegment.end.x)) {
+                            crossingsPerRank[r].push([segment, otherSegment]);
+                        }
+                    });
+                    openSegments.add(segment);
+                }
+            });
+        }
+    }
+
+    private _optimizeAngles(layoutGraph: LayoutGraph, segmentsPerRank: Array<Array<Segment>>,
+        crossingsPerRank: Array<Array<[Segment, Segment]>>): void {
+        const forces = [];
+        _.forEach(crossingsPerRank, (crossings, r) => {
+            let maxForce = Number.NEGATIVE_INFINITY;
+            let maxY = Number.NEGATIVE_INFINITY;
+            const deltaXs = [];
+            _.forEach(crossings, ([segmentA, segmentB]) => {
+                const vectorA = segmentA.vector();
+                const vectorB = segmentB.vector();
+                if (vectorA.x === 0 || vectorB.x === 0 || Math.sign(vectorA.x) !== -Math.sign(vectorB.x)) {
+                    return; // only consider "head-on" crossings -> <-
+                }
+                const y1y2 = vectorA.y * vectorB.y;
+                const x1x2 = vectorA.x * vectorB.x;
+                const b = vectorA.y + vectorB.y;
+                const force = (-b + Math.sqrt(b * b - 4 * (y1y2 + x1x2))) / 2;
+                const t = (segmentA.start.x - segmentB.start.x) / (vectorB.x - vectorA.x);
+                const intersectionY = segmentA.start.y + t * vectorA.y;
+                maxForce = Math.max(maxForce, force);
+                maxY = Math.max(maxY, intersectionY);
+                deltaXs.push([Math.abs(vectorA.x), Math.abs(vectorB.x)]);
+            });
+            if (maxForce > 0) {
+                const allDeltaXsSquared = [];
+                _.forEach(segmentsPerRank[r], (segment: Segment) => {
+                    const vector = segment.vector();
+                    allDeltaXsSquared.push(vector.x * vector.x);
+                });
+                // golden-section search; adapted from https://en.wikipedia.org/wiki/Golden-section_search
+                const goldenRatio = (Math.sqrt(5) + 1) / 2;
+                let a = this._options['targetEdgeLength'];
+                let b = this._options['targetEdgeLength'] + maxForce;
+                const f = (deltaY) => {
+                    let cost = 0;
+                    _.forEach(deltaXs, ([deltaXA, deltaXB]) => {
+                        const angle = Math.atan(deltaY / deltaXA) + Math.atan(deltaY / deltaXB);
+                        cost += this._options['weightCrossings'] * (Math.cos(2 * angle) + 1) / 2;
+                    });
+                    const deltaYSquared = deltaY * deltaY;
+                    _.forEach(allDeltaXsSquared, deltaXSquared => {
+                        cost += this._options['weightLengths'] * Math.sqrt(deltaYSquared + deltaXSquared) / this._options['targetEdgeLength'];
+                    });
+                    return cost;
+                };
+                let c = b - (b - a) / goldenRatio;
+                let d = a + (b - a) / goldenRatio;
+                while (Math.abs(b - a) > 1e-5) {
+                    if (f(c) < f(d)) {
+                        b = d;
+                    } else {
+                        a = c;
+                    }
+                    // recompute c and d to counter loss of precision
+                    c = b - (b - a) / goldenRatio;
+                    d = a + (b - a) / goldenRatio;
+                }
+                forces.push([maxY, (b + a) / 2 - this._options['targetEdgeLength']]);
+            }
+        });
+
+        const sortedForces = _.sortBy(forces, ([intersectionY, force]) => intersectionY);
+        if (DEBUG) {
+            Assert.assertEqual(sortedForces, forces, 'forces are not sorted');
+        }
+
+        const points = [];
+        const oldTops = new Map();
+        _.forEach(layoutGraph.allNodes(), (node: LayoutNode) => {
+            points.push([node.y, 'NODE', node, 'TOP']);
+            points.push([node.y + node.height, 'NODE', node, 'BOTTOM']);
+            oldTops.set(node, node.y);
+        });
+        _.forEach(layoutGraph.allEdges(), (edge: LayoutEdge) => {
+            _.forEach(edge.points, (point: Vector, i: number) => {
+                points.push([point.y, 'EDGE', edge, i]);
+            });
+        });
+        const pointsSorted = _.sortBy(points, '0'); // sort by y
+        let forcePointer = 0;
+        let totalForce = 0;
+        _.forEach(pointsSorted, ([pointY, type, object, position]) => {
+            while (forcePointer < sortedForces.length && sortedForces[forcePointer][0] < pointY) {
+                totalForce += sortedForces[forcePointer][1];
+                forcePointer++;
+            }
+            if (type === 'NODE') {
+                if (position === 'TOP') {
+                    object.translateWithoutChildren(0, totalForce);
+                } else { // "BOTTOM"
+                    const oldHeight = object.height;
+                    // new_height = old_height + totalForce + old_top - new_top
+                    object.height += totalForce + oldTops.get(object) - object.y;
+                    const heightDiff = object.height - oldHeight;
+                    _.forEach(object.outConnectors, (connector: LayoutConnector) => {
+                        connector.y += heightDiff;
+                    });
+                }
+            } else { // "EDGE"
+                object.points[position].y += totalForce;
+            }
+        });
+    }
+}
diff --git a/src/layouting/levelGraph/levelGraph.ts b/src/layouting/levelGraph/levelGraph.ts
new file mode 100644
index 00000000..8d1bfe0b
--- /dev/null
+++ b/src/layouting/levelGraph/levelGraph.ts
@@ -0,0 +1,92 @@
+import * as _ from 'lodash';
+import Edge from '../graph/edge';
+import Graph from '../graph/graph';
+import LayoutEdge from '../layoutGraph/layoutEdge';
+import LayoutNode from '../layoutGraph/layoutNode';
+import LevelNode from './levelNode';
+
+export default class LevelGraph extends Graph<LevelNode, Edge<any, any>> {
+    private _ranks: Array<Array<LevelNode>> = null;
+    private _minRank: number = Number.POSITIVE_INFINITY;
+    private _maxRank: number = Number.NEGATIVE_INFINITY;
+    private _firstNodeMap: Array<number> = [];
+    private _lastNodeMap: Array<number> = [];
+
+    constructor() {
+        super();
+    }
+
+    public addLayoutNode(layoutNode: LayoutNode): LevelNode {
+        let levelNode = new LevelNode(layoutNode, layoutNode.rank, true);
+        let src = this.addNode(levelNode);
+        this._firstNodeMap[layoutNode.id] = levelNode.id;
+        const levelNodes = [levelNode];
+        for (let r = layoutNode.rank + 1; r < layoutNode.rank + layoutNode.rankSpan; ++r) {
+            this._maxRank = Math.max(this._maxRank, r);
+            levelNode = new LevelNode(layoutNode, r);
+            levelNodes.push(levelNode);
+            const dst = this.addNode(levelNode);
+            this.addEdge(new Edge(src, dst, Number.POSITIVE_INFINITY));
+            src = dst;
+        }
+        levelNode.isLast = true;
+        this._lastNodeMap[layoutNode.id] = levelNode.id;
+        layoutNode.levelNodes = levelNodes;
+        return levelNode;
+    }
+
+    public addLayoutEdge(layoutEdge: LayoutEdge): void {
+        const src = this._lastNodeMap[layoutEdge.src];
+        const dst = this._firstNodeMap[layoutEdge.dst];
+        const existingEdge = this.edgeBetween(src, dst);
+        if (existingEdge === undefined) {
+            this.addEdge(new Edge(src, dst, layoutEdge.weight));
+        } else {
+            existingEdge.weight += layoutEdge.weight;
+        }
+    }
+
+    public ranks(): Array<Array<LevelNode>> {
+        this._minRank = Number.POSITIVE_INFINITY;
+        this._maxRank = Number.NEGATIVE_INFINITY;
+        _.forEach(this.nodes(), (node: LevelNode) => {
+            this._minRank = Math.min(this._minRank, node.rank);
+            this._maxRank = Math.max(this._maxRank, node.rank);
+        });
+        const minRank = this._minRank;
+        const maxRank = this._maxRank;
+        let numRanks = maxRank - minRank + 1;
+        if (maxRank === Number.NEGATIVE_INFINITY) {
+            numRanks = 0;
+        }
+        this._ranks = new Array(numRanks);
+        const unsortedRanks = new Array(numRanks);
+        for (let r = 0; r < numRanks; ++r) {
+            unsortedRanks[r] = [];
+        }
+        _.forEach(this.nodes(), (node: LevelNode) => {
+            unsortedRanks[node.rank - minRank].push(node);
+        });
+        _.forEach(unsortedRanks, (rank: Array<LevelNode>, r: number) => {
+            this._ranks[r] = _.sortBy(rank, (node: LevelNode) => {
+                return node.position;
+            });
+            for (let pos = 0; pos < this._ranks[r].length; ++pos) {
+                this._ranks[r][pos].position = pos;
+            }
+        });
+        return this._ranks;
+    }
+
+    public invalidateRankOrder(): void {
+        this._ranks = null;
+    }
+
+    public maxX(): number {
+        let maxX = Number.NEGATIVE_INFINITY;
+        _.forEach(this.nodes(), (node: LevelNode) => {
+            maxX = Math.max(maxX, node.x);
+        });
+        return maxX;
+    }
+}
diff --git a/src/layouting/levelGraph/levelNode.ts b/src/layouting/levelGraph/levelNode.ts
new file mode 100644
index 00000000..2b056784
--- /dev/null
+++ b/src/layouting/levelGraph/levelNode.ts
@@ -0,0 +1,23 @@
+import Edge from '../graph/edge';
+import LayoutNode from '../layoutGraph/layoutNode';
+import LevelGraph from './levelGraph';
+import Node from '../graph/node';
+
+export default class LevelNode extends Node<LevelGraph, Edge<any, any>> {
+    public rank: number = null;
+    public position: number = null;
+    public width: number = null;
+    public x: number = null;
+
+    public layoutNode: LayoutNode;
+    public isFirst: boolean;
+    public isLast: boolean;
+
+    constructor(layoutNode: LayoutNode, rank: number, isFirst = false) {
+        super(layoutNode.label());
+        this.layoutNode = layoutNode;
+        this.rank = rank;
+        this.width = layoutNode.width;
+        this.isFirst = isFirst;
+    }
+}
diff --git a/src/layouting/order/crossCount.ts b/src/layouting/order/crossCount.ts
new file mode 100644
index 00000000..64a61835
--- /dev/null
+++ b/src/layouting/order/crossCount.ts
@@ -0,0 +1,161 @@
+import {GPU} from 'gpu.js';
+import * as _ from 'lodash';
+
+export class CrossCount {
+    static pipeline = null;
+
+    static buildGraph(n: number, density = 0.1) {
+        const edges = [];
+        for (let i = 0; i < n; ++i) {
+            for (let j = 0; j < n; ++j) {
+                if (Math.random() < density) {
+                    edges.push([i, j]);
+                }
+            }
+        }
+        return edges;
+    }
+
+    static countEfficient(numNorth: number, numSouth: number, edges: Array<[number, number]>): number {
+        // build south sequence
+        const southSequence = _.map(_.sortBy(edges, edge => edge[0] * numSouth + edge[1]), edge => edge[1]);
+
+        // build the accumulator tree
+        let firstIndex = 1;
+        while (firstIndex < numSouth) {
+            firstIndex *= 2; // number of tree nodes
+        }
+        const treeSize = 2 * firstIndex - 1;
+        firstIndex -= 1; // index of leftmost leaf
+        const tree = _.fill(new Array(treeSize), 0);
+
+        // count the crossings
+        let count = 0;
+        _.forEach(southSequence, (i: number) => {
+            let index = i + firstIndex;
+            tree[index]++;
+            while (index > 0) {
+                if (index % 2) {
+                    count += tree[index + 1];
+                }
+                index = Math.floor((index - 1) / 2);
+                tree[index]++;
+            }
+        });
+        return count;
+    }
+
+    static initGpu(): void {
+        const gpu = new GPU();
+
+        CrossCount.pipeline = [
+
+            // left shift
+            gpu.createKernel(function (adjacencyMatrix) {
+                return ((this.thread.x === this.output.x - 1) ? 0 : adjacencyMatrix[this.thread.y][this.thread.x + 1]);
+            }, {
+                dynamicArguments: true,
+                dynamicOutput: true,
+                pipeline: true,
+            }),
+
+            // take row-wise cumulative sum
+            gpu.createKernel(function (leftShifted, i: number) {
+                const numCols = this.output.x;
+                let sum = leftShifted[this.thread.y][this.thread.x];
+                if (this.thread.x + i < numCols) {
+                    sum += leftShifted[this.thread.y][this.thread.x + i];
+                }
+                return sum;
+            }, {
+                dynamicArguments: true,
+                dynamicOutput: true,
+                pipeline: true,
+                immutable: true,
+            }),
+
+            // down shift
+            gpu.createKernel(function (rowSum) {
+                return ((this.thread.y === 0) ? 0 : rowSum[this.thread.y - 1][this.thread.x]);
+            }, {
+                dynamicArguments: true,
+                dynamicOutput: true,
+                pipeline: true,
+            }),
+
+            // take column-wise cumulative sum
+            gpu.createKernel(function (downShifted, i: number) {
+                let sum = downShifted[this.thread.y][this.thread.x];
+                if (this.thread.y - i >= 0) {
+                    sum += downShifted[this.thread.y - i][this.thread.x];
+                }
+                return sum;
+            }, {
+                dynamicArguments: true,
+                dynamicOutput: true,
+                pipeline: true,
+                immutable: true,
+            }),
+
+            // hadamard product (adjacency matrix acts as a mask)
+            gpu.createKernel(function (columnSums, adjacencyMatrix) {
+                return columnSums[this.thread.y][this.thread.x] * adjacencyMatrix[this.thread.y][this.thread.x];
+            }, {
+                dynamicArguments: true,
+                dynamicOutput: true,
+                pipeline: true,
+            }),
+
+            // row-wise sum
+            gpu.createKernel(function (matrix, numCols) {
+                let sum = 0;
+                for (let j = 0; j < numCols; ++j) {
+                    sum += matrix[this.thread.x][j];
+                }
+                return sum;
+            }, {
+                dynamicArguments: true,
+                dynamicOutput: true
+            }),
+        ];
+    }
+
+    static countGpu(numNorth: number, numSouth: number, edges: Array<[number, number]>): number {
+        if (CrossCount.pipeline === null) {
+            throw new Error('Must call initGpu() before calling countGpu().');
+        }
+
+        const adjacencyMatrixSize = [numSouth, numNorth];
+        //const height = Math.log2(Math.max(numNorth, numSouth) - 1) + 1;
+        CrossCount.pipeline[0].setOutput(adjacencyMatrixSize);
+        CrossCount.pipeline[1].setOutput(adjacencyMatrixSize);
+        CrossCount.pipeline[2].setOutput(adjacencyMatrixSize);
+        CrossCount.pipeline[3].setOutput(adjacencyMatrixSize);
+        CrossCount.pipeline[4].setOutput(adjacencyMatrixSize);
+        CrossCount.pipeline[5].setOutput([numNorth]);
+
+        // build matrix
+        const adjacencyMatrix = [];
+        for (let i = 0; i < numNorth; ++i) {
+            adjacencyMatrix.push(new Uint8Array(numSouth));
+        }
+        _.forEach(edges, edge => {
+            adjacencyMatrix[edge[0]][edge[1]] = 1;
+        });
+
+        // execute pipeline
+        let leftShifted = CrossCount.pipeline[0](adjacencyMatrix);
+        for (let i = 1; i < numSouth; i <<= 1) {
+            leftShifted = CrossCount.pipeline[1](leftShifted, i);
+        }
+        let downShifted = CrossCount.pipeline[2](leftShifted);
+        leftShifted.delete();
+        for (let i = 1; i < numNorth; i <<= 1) {
+            downShifted = CrossCount.pipeline[3](downShifted, i);
+        }
+        const product = CrossCount.pipeline[4](downShifted, adjacencyMatrix);
+        downShifted.delete();
+        const sums = CrossCount.pipeline[5](product, numSouth);
+        return _.sum(sums);
+    }
+}
diff --git a/src/layouting/order/orderGraph.ts b/src/layouting/order/orderGraph.ts
new file mode 100644
index 00000000..e832c9c8
--- /dev/null
+++ b/src/layouting/order/orderGraph.ts
@@ -0,0 +1,1416 @@
+import { DEBUG } from '../../utils/constants';
+import * as _ from 'lodash';
+import Assert from '../util/assert';
+import Component from '../graph/component';
+import Edge from '../graph/edge';
+import Graph from '../graph/graph';
+import OrderGroup from './orderGroup';
+import OrderNode from './orderNode';
+import OrderRank from './orderRank';
+import Timer from '../util/timer';
+import Shuffle from '../util/shuffle';
+
+export default class OrderGraph {
+    private _rankGraph: Graph<OrderRank, Edge<any, any>>;
+    private _groupGraph: Graph<OrderGroup, Edge<any, any>>;
+    private _nodeGraph: Graph<OrderNode, Edge<any, any>>;
+
+    private _groupEdgesAdded = false;
+
+    constructor() {
+        this._rankGraph = new Graph<OrderRank, Edge<any, any>>();
+        this._groupGraph = new Graph<OrderGroup, Edge<any, any>>();
+        this._nodeGraph = new Graph<OrderNode, Edge<any, any>>();
+    }
+
+    toString(): string {
+        const obj = {
+            nodes: {},
+            edges: [],
+        };
+        _.forEach(_.sortBy(this.groups(), 'position'), (group: OrderGroup) => {
+            obj.nodes[group.id] = {
+                label: group.label(),
+                child: {
+                    nodes: {},
+                    edges: [],
+                },
+            };
+            _.forEach(group.orderedNodes(), (node: OrderNode) => {
+                obj.nodes[group.id].child.nodes[node.id] = {
+                    label: node.label(),
+                    child: null
+                };
+            });
+        });
+        _.forEach(this.groupEdges(), (edge: Edge<any, any>) => {
+            obj.edges.push({ src: edge.src, dst: edge.dst, weight: edge.weight });
+        });
+        return JSON.stringify(obj);
+    }
+
+    public addRank(rank: OrderRank, id: number = null): number {
+        rank.orderGraph = this;
+        return this._rankGraph.addNode(rank, id);
+    }
+
+    public addGroup(group: OrderGroup, id: number = null): number {
+        return this._groupGraph.addNode(group, id);
+    }
+
+    public addNode(node: OrderNode, id: number = null): number {
+        return this._nodeGraph.addNode(node, id);
+    }
+
+    public removeNode(id: number): void {
+        this._nodeGraph.removeNode(id);
+    }
+
+    public addEdge(edge: Edge<any, any>, id: number = null): number {
+        return this._nodeGraph.addEdge(edge, id);
+    }
+
+    public removeEdge(id: number): void {
+        this._nodeGraph.removeEdge(id);
+    }
+
+    private _addGroupEdges(): void {
+        if (!this._groupEdgesAdded) {
+            this._groupEdgesAdded = true;
+            _.forEach(this._nodeGraph.edges(), (edge: Edge<any, any>) => {
+                const srcGroupId = this._nodeGraph.node(edge.src).group.id;
+                const dstGroupId = this._nodeGraph.node(edge.dst).group.id;
+                const groupEdge = this._groupGraph.edgeBetween(srcGroupId, dstGroupId);
+                if (groupEdge === undefined) {
+                    this._groupGraph.addEdge(new Edge(srcGroupId, dstGroupId, edge.weight));
+                } else {
+                    groupEdge.weight += edge.weight;
+                }
+            });
+        }
+    }
+
+    private _addRankEdges(): void {
+        _.forEach(this._groupGraph.edges(), (edge: Edge<any, any>) => {
+            const srcRankId = this._groupGraph.node(edge.src).rank.id;
+            const dstRankId = this._groupGraph.node(edge.dst).rank.id;
+            if (!this._rankGraph.hasEdge(srcRankId, dstRankId)) {
+                this._rankGraph.addEdge(new Edge(srcRankId, dstRankId));
+            }
+        });
+    }
+
+    public node(id: number): OrderNode {
+        return this._nodeGraph.node(id);
+    }
+
+    public group(id: number): OrderGroup {
+        return this._groupGraph.node(id);
+    }
+
+    public nodes(): Array<OrderNode> {
+        return this._nodeGraph.nodes();
+    }
+
+    public groups(): Array<OrderGroup> {
+        return this._groupGraph.nodes();
+    }
+
+    public ranks(): Array<OrderRank> {
+        return this._rankGraph.toposort();
+    }
+
+    public edges(): Array<Edge<any, any>> {
+        return this._nodeGraph.edges();
+    }
+
+    public inEdges(id: number): Array<Edge<any, any>> {
+        return this._nodeGraph.inEdges(id);
+    }
+
+    public outEdges(id: number): Array<Edge<any, any>> {
+        return this._nodeGraph.outEdges(id);
+    }
+
+    public inNeighbors(id: number): Array<OrderNode> {
+        return this._nodeGraph.inNeighbors(id);
+    }
+
+    public outNeighbors(id: number): Array<OrderNode> {
+        return this._nodeGraph.outNeighbors(id);
+    }
+
+    public incidentEdges(id: number): Array<Edge<any, any>> {
+        return this._nodeGraph.incidentEdges(id);
+    }
+
+    public edgeBetween(srcId: number, dstId: number): Edge<any, any> {
+        return this._nodeGraph.edgeBetween(srcId, dstId);
+    }
+
+    public maxId(): number {
+        return this._nodeGraph.maxId();
+    }
+
+    public groupEdges(): Array<Edge<any, any>> {
+        this._addGroupEdges();
+        return this._groupGraph.edges();
+    }
+
+    public order(options: object = {}): number {
+        Timer.start(['doLayout', 'orderRanks', 'doOrder', 'order']);
+        options = _.defaults(options, {
+            debug: false,
+            doNothing: false,
+            orderGroups: false,
+            countInitial: false,
+            resolveConflicts: true,
+            resolveY: 'normal',
+            shuffles: 0,
+        });
+        const doOrder = (graph: OrderGraph): number => {
+            Timer.start(['doLayout', 'orderRanks', 'doOrder', 'order', 'doOrder']);
+            let minRank = Number.POSITIVE_INFINITY;
+            const ranks = graph._rankGraph.toposort();
+            const groupOffsetsN = []; // number of nodes in groups left of this group per rank (at start)
+            const groupOffsetsPos = []; // number of nodes in groups left of this group per rank (reflecting current order)
+            const groupOrder = []; // current order of groups on this level (e. g. 2, 0, 1)
+            const groupPositions = [];// inverse of groupOrder (e. g. 1, 2, 0)
+            const order = []; // current order of nodes on this level (e. g. 2, 0, 1)
+            const positions = []; // inverse of order (e. g. 1, 2, 0)
+            const neighborsDown = [];
+            const weightsDown = [];
+            const neighborsUp = [];
+            const weightsUp = [];
+            let crossings = []; // number of crossings above each rank
+
+            const nodesPerRank = [];
+
+            // set neighbors
+            _.forEach(ranks, (rank: OrderRank, r: number) => {
+                minRank = Math.min(minRank, rank.rank);
+                groupOrder[r] = new Array(rank.groups.length);
+                groupPositions[r] = new Array(rank.groups.length);
+                groupOffsetsN[r] = [];
+                groupOffsetsPos[r] = [];
+                order[r] = [];
+                positions[r] = [];
+                neighborsDown[r] = [];
+                weightsDown[r] = [];
+                neighborsUp[r] = [];
+                weightsUp[r] = [];
+                crossings[r] = Number.POSITIVE_INFINITY;
+                nodesPerRank[r] = [];
+
+                let offset = 0;
+                _.forEach(rank.groups, (group: OrderGroup) => {
+                    groupOffsetsN[r][group.index] = offset;
+                    offset += group.nodes.length;
+                });
+            });
+            _.forEach(ranks, (rank: OrderRank, r: number) => {
+                let offset = 0;
+                _.forEach(rank.orderedGroups(), (group: OrderGroup, groupPos: number) => {
+                    groupOffsetsPos[r][group.index] = offset;
+                    offset += group.nodes.length;
+                    groupOrder[r][groupPos] = group.index;
+                    groupPositions[r][group.index] = groupPos;
+                    _.forEach(group.orderedNodes(), (node: OrderNode, posInGroup: number) => {
+                        node.rank = r;
+                        const n = groupOffsetsN[r][group.index] + node.index;
+                        const pos = groupOffsetsPos[r][group.index] + posInGroup;
+                        order[r][pos] = n;
+                        positions[r][n] = pos;
+                        neighborsDown[r][n] = [];
+                        weightsDown[r][n] = [];
+                        neighborsUp[r][n] = [];
+                        weightsUp[r][n] = [];
+                        _.forEach(graph._nodeGraph.outEdges(node.id), (edge: Edge<any, any>) => {
+                            neighborsDown[r][n].push(graph.node(edge.dst).index + groupOffsetsN[r + 1][graph.node(edge.dst).group.index]);
+                            weightsDown[r][n].push(edge.weight);
+                        });
+                        _.forEach(graph._nodeGraph.inEdges(node.id), (edge: Edge<any, any>) => {
+                            neighborsUp[r][n].push(graph.node(edge.src).index + groupOffsetsN[r - 1][graph.node(edge.src).group.index]);
+                            weightsUp[r][n].push(edge.weight);
+                        });
+                    });
+                });
+
+
+                _.forEach(rank.groups, group => {
+                    _.forEach(group.nodes, node => {
+                        nodesPerRank[r].push(node);
+                    });
+                });
+
+                if (DEBUG) {
+                    assertOrderAndPositionCoherence();
+                }
+            });
+
+            crossings[0] = 0;
+
+            const countCrossings = (testOrder: Array<number>, r: number, direction: 'UP' | 'DOWN', preventConflicts = false) => {
+                if (preventConflicts) {
+                    const originalOrder = _.clone(order[r]);
+                    order[r] = _.clone(testOrder);
+                    _.forEach(order[r], (n, pos) => {
+                        positions[r][n] = pos;
+                    });
+                    let hasConflict = false;
+                    if (r > 0) {
+                        hasConflict = hasConflict || (getConflict('HEAVYHEAVY', r) !== null) || (getConflict('HEAVYLIGHT', r) !== null);
+                    }
+                    if (r < ranks.length - 1) {
+                        hasConflict = hasConflict || (getConflict('HEAVYHEAVY', r + 1) !== null) || (getConflict('HEAVYLIGHT', r + 1) !== null);
+                    }
+                    order[r] = _.clone(originalOrder);
+                    _.forEach(order[r], (n, pos) => {
+                        positions[r][n] = pos;
+                    });
+                    if (hasConflict) {
+                        return Number.POSITIVE_INFINITY;
+                    }
+                }
+                const edges = [];
+                const neighbors = (direction === 'UP' ? neighborsUp : neighborsDown);
+                const weights = (direction === 'UP' ? weightsUp : weightsDown);
+                const neighborRank = (direction === 'UP' ? (r - 1) : (r + 1));
+
+                for (let pos = 0; pos < testOrder.length; ++pos) {
+                    for (let neighbor = 0; neighbor < neighbors[r][testOrder[pos]].length; ++neighbor) {
+                        let weight = weights[r][testOrder[pos]][neighbor];
+                        if (weight === Number.POSITIVE_INFINITY) {
+                            weight = 1;
+                        }
+                        edges.push([
+                            pos,
+                            positions[neighborRank][neighbors[r][testOrder[pos]][neighbor]],
+                            weight,
+                        ]);
+                    }
+                }
+                return this._countCrossings(testOrder.length, order[neighborRank].length, edges);
+            };
+
+            /**
+             * Sweeps the ranks up and down and reorders the nodes according to the barycenter heuristic
+             * @param shuffle
+             * @param shuffleNodes
+             * @param startRank
+             * @param preventConflicts
+             */
+            const reorder = (shuffle = false, shuffleNodes = false, startRank = 0, preventConflicts = false) => {
+                Timer.start(['doLayout', 'orderRanks', 'doOrder', 'order', 'doOrder', 'reorder']);
+                if (shuffle) {
+                    _.forEach(ranks, (rank: OrderRank, r: number) => {
+                        if (options['orderGroups']) {
+                            const maxLevel = _.maxBy(rank.groups, group => group.shuffleHierarchy.length).shuffleHierarchy.length - 1;
+                            let deepOrder = _.clone(groupOrder[r]);
+                            for (let level = maxLevel; level >= 0; --level) {
+                                const nextDeepOrder = [];
+                                let prevParent = undefined;
+                                let sameParentSequence = [];
+                                _.forEach(deepOrder, (gs: any) => {
+                                    let g = gs;
+                                    while (Array.isArray(g)) {
+                                        g = g[0];
+                                    }
+                                    const parent = ranks[r].groups[g].shuffleHierarchy[level];
+                                    if (parent === undefined) {
+                                        nextDeepOrder.push(gs);
+                                        return;
+                                    }
+                                    if (parent === prevParent) {
+                                        sameParentSequence.push(gs);
+                                    } else {
+                                        if (prevParent !== undefined) {
+                                            nextDeepOrder.push(Shuffle.shuffle(sameParentSequence));
+                                        }
+                                        sameParentSequence = [gs];
+                                    }
+                                    prevParent = parent;
+                                });
+                                nextDeepOrder.push(Shuffle.shuffle(sameParentSequence));
+                                deepOrder = _.clone(nextDeepOrder);
+                            }
+                            groupOrder[r] = _.flattenDeep(deepOrder);
+                            this._setGroupPositionAndOffset(groupOrder[r], groupPositions[r], groupOffsetsPos[r], ranks[r]);
+                            order[r] = [];
+                            _.forEach(groupOrder[r], (g: number) => {
+                                let ns = _.range(rank.groups[g].nodes.length);
+                                if (shuffleNodes) {
+                                    ns = Shuffle.shuffle(ns);
+                                }
+                                _.forEach(ns, nInGroup => {
+                                    order[r].push(groupOffsetsN[r][g] + nInGroup);
+                                });
+                            });
+                            _.forEach(order[r], (n, pos) => {
+                                positions[r][n] = pos;
+                            });
+                        } else {
+                            _.forEach(rank.groups, (group: OrderGroup, g: number) => {
+                                const groupOrder = Shuffle.shuffle(_.slice(order[r], groupOffsetsPos[r][g], groupOffsetsPos[r][g] + group.nodes.length));
+                                _.forEach(groupOrder, (n, pos) => {
+                                    order[r][groupOffsetsPos[r][g] + pos] = n;
+                                    positions[r][n] = groupOffsetsPos[r][g] + pos;
+                                });
+                            });
+                        }
+                    });
+                }
+
+                if (DEBUG) {
+                    // commented out: assert that nodes that belong to the same subgraph are contiguous
+                    _.forEach(ranks, (rank, r) => {
+                        for (let g1 = 0; g1 < rank.groups.length; ++g1) {
+                            for (let g2 = g1 + 1; g2 < rank.groups.length; ++g2) {
+                                for (let level = 1; level <= Math.min(rank.groups[g1].shuffleHierarchy.length, rank.groups[g1].shuffleHierarchy.length); ++level) {
+                                    if (_.isEqual(_.slice(rank.groups[g1].shuffleHierarchy, 0, level), _.slice(rank.groups[g2].shuffleHierarchy, 0, level))) {
+                                        for (let pos = Math.min(groupPositions[r][g1], groupPositions[r][g2]) + 1; pos < Math.max(groupPositions[r][g1], groupPositions[r][g2]); ++pos) {
+                                            Assert.assertEqual(_.slice(rank.groups[g1].shuffleHierarchy, 0, level), _.slice(rank.groups[groupOrder[r][pos]].shuffleHierarchy, 0, level), 'bad order ' + pos);
+                                        }
+                                    }
+                                }
+                            }
+                        }
+                    });
+                }
+
+                let downward = true;
+                let improveCounter = (!options['doNothing'] && (ranks.length > 1)) ? 2 : 0; // if only one rank, nothing to order
+                while (improveCounter > 0) {
+                    improveCounter--;
+                    if (options['debug']) {
+                        console.log('TOTAL CROSSINGS', _.sum(crossings));
+                    }
+                    const firstRank = downward ? startRank + 1 : ranks.length - 2;
+                    const lastRank = downward ? ranks.length - 1 : startRank;
+                    const direction = downward ? 1 : -1;
+                    const neighborsNorth = downward ? neighborsUp : neighborsDown;
+                    const weightsNorth = downward ? weightsUp : weightsDown;
+                    const crossingOffsetNorth = downward ? 0 : 1;
+                    const crossingOffsetSouth = downward ? 1 : 0;
+                    const northDirection = downward ? 'UP' : 'DOWN';
+                    const southDirection = downward ? 'DOWN' : 'UP';
+                    if (options['debug']) {
+                        console.log(downward ? 'DOWN' : 'UP');
+                    }
+                    for (let r = firstRank; r - direction !== lastRank; r += direction) {
+                        if (DEBUG) {
+                            assertOrderAndPositionCoherence(r);
+                        }
+                        if (options['debug']) {
+                            console.log('rank', r);
+                        }
+
+                        const northRank = r - direction;
+
+                        if (crossings[r + crossingOffsetNorth] === 0) {
+                            // no need to reorder
+                            if (options['debug']) {
+                                console.log('skip because already 0');
+                            }
+                            continue;
+                        }
+
+                        const tryNewOrder = (newOrder) => {
+                            // count crossings with new order
+                            const prevCrossingsNorth = crossings[r + crossingOffsetNorth];
+                            const newCrossingsNorth = countCrossings(newOrder, r, northDirection, preventConflicts);
+
+                            let newCrossingsSouth = 0;
+                            let prevCrossingsSouth = 0;
+                            if (r !== lastRank) {
+                                prevCrossingsSouth = crossings[r + crossingOffsetSouth];
+                                newCrossingsSouth = countCrossings(newOrder, r, southDirection, preventConflicts);
+                            }
+                            const fewerCrossingsNorth = newCrossingsNorth < prevCrossingsNorth;
+                            const fewerOrEqualCrossingsTotal = (newCrossingsNorth + newCrossingsSouth <= prevCrossingsNorth + prevCrossingsSouth);
+                            if (fewerCrossingsNorth && fewerOrEqualCrossingsTotal) {
+                                if (options['debug']) {
+                                    console.log('fewer crossings north', prevCrossingsNorth, '->', newCrossingsNorth, 'south: ', prevCrossingsSouth, '->', newCrossingsSouth);
+                                }
+                                crossings[r + crossingOffsetNorth] = newCrossingsNorth;
+                                if (r !== lastRank) {
+                                    crossings[r + crossingOffsetSouth] = newCrossingsSouth;
+                                }
+                                order[r] = _.cloneDeep(newOrder);
+                                _.forEach(order[r], (n: number, pos: number) => {
+                                    positions[r][n] = pos;
+                                });
+                                const fewerCrossingsTotal = (newCrossingsNorth + newCrossingsSouth < prevCrossingsNorth + prevCrossingsSouth);
+                                return (1 + (fewerCrossingsTotal ? 1 : 0));
+                            } else {
+                                if (options['debug']) {
+                                    console.log('not fewer crossings north', prevCrossingsNorth, '->', newCrossingsNorth, 'south: ', prevCrossingsSouth, '->', newCrossingsSouth);
+                                }
+                                return 0;
+                            }
+                        };
+
+                        let hasChanged = true;
+                        while (hasChanged) {
+                            hasChanged = false;
+                            const newNodeOrder = new Array(order[r].length);
+                            const groupMeans = [];
+                            _.forEach(ranks[r].groups, (group: OrderGroup, g: number) => {
+                                // calculate mean position of neighbors
+                                let nodeMeans = [];
+                                let groupSum = 0;
+                                let groupNum = 0;
+                                for (let pos = groupOffsetsPos[r][g]; pos < groupOffsetsPos[r][g] + group.nodes.length; ++pos) {
+                                    const n = order[r][pos];
+                                    let sum = 0;
+                                    let num = 0;
+                                    for (let neighbor = 0; neighbor < neighborsNorth[r][n].length; ++neighbor) {
+                                        let weight = weightsNorth[r][n][neighbor];
+                                        if (weight === Number.POSITIVE_INFINITY) {
+                                            weight = 1;
+                                        }
+                                        const neighborPos = positions[northRank][neighborsNorth[r][n][neighbor]];
+                                        sum += weight * neighborPos;
+                                        num += weight;
+                                    }
+                                    if (neighborsNorth[r][n].length > 0) {
+                                        nodeMeans.push([n, sum / num]);
+                                    } else {
+                                        nodeMeans.push([n, pos]);
+                                    }
+                                    groupSum += sum;
+                                    groupNum += num;
+                                }
+
+                                // sort by the means
+                                nodeMeans = _.sortBy(nodeMeans, pair => pair[1]);
+
+                                for (let posInGroup = 0; posInGroup < group.nodes.length; ++posInGroup) {
+                                    newNodeOrder[groupOffsetsPos[r][g] + posInGroup] = nodeMeans[posInGroup][0];
+                                }
+
+                                if (groupNum > 0) {
+                                    groupMeans.push([g, groupSum / groupNum]);
+                                } else {
+                                    groupMeans.push([g, groupPositions[r][g]]);
+                                }
+                            });
+
+                            // first reorder groups
+                            if (options['orderGroups']) {
+                                const newGroupOrder = _.map(_.sortBy(groupMeans, '1'), '0');
+                                _.forEach(this._getPartialOrders(newGroupOrder, groupOrder[r], groupPositions[r], options['debug']), tmpGroupOrder => {
+                                    // transform new group order to node order
+                                    const tmpOrder = [];
+                                    _.forEach(tmpGroupOrder, g => {
+                                        for (let posInGroup = 0; posInGroup < ranks[r].groups[g].nodes.length; ++posInGroup) {
+                                            tmpOrder.push(order[r][groupOffsetsPos[r][g] + posInGroup]);
+                                        }
+                                    });
+
+                                    const result = tryNewOrder(tmpOrder);
+                                    if (result > 0) {
+                                        hasChanged = true;
+                                        // store new group order
+                                        groupOrder[r] = tmpGroupOrder;
+                                        this._setGroupPositionAndOffset(groupOrder[r], groupPositions[r], groupOffsetsPos[r], ranks[r]);
+                                    }
+                                    if (result === 2) {
+                                        improveCounter = 2;
+                                    }
+                                });
+                            }
+
+                            if (!hasChanged) {
+                                // then reorder nodes
+                                _.forEach(this._getPartialOrders(newNodeOrder, order[r], positions[r]), tmpOrder => {
+                                    const result = tryNewOrder(tmpOrder);
+                                    if (result > 0) {
+                                        hasChanged = true;
+                                    }
+                                    if (result === 2) {
+                                        improveCounter = 2;
+                                    }
+                                });
+                            }
+                        }
+                        if (DEBUG) {
+                            assertOrderAndPositionCoherence(r);
+                        }
+                    }
+                    downward = !downward;
+                }
+
+                for (let r = 1; r < ranks.length; ++r) {
+                    crossings[r] = countCrossings(order[r], r, 'UP');
+                }
+
+                Timer.stop(['doLayout', 'orderRanks', 'doOrder', 'order', 'doOrder', 'reorder']);
+            };
+
+            const assertNeighborCoherence = (r: number = null) => {
+                if (r === null) {
+                    _.forEach(_.range(ranks.length), r => assertNeighborCoherence(r));
+                    return;
+                }
+                _.forEach(neighborsDown[r], (neighborsPerNode, n) => {
+                    Assert.assertAll(neighborsPerNode, neighbor => neighborsUp[r + 1][neighbor].indexOf(n) !== -1, 'neighbor in rank ' + (r + 1) + ' is missing upNeighbor');
+                });
+                _.forEach(neighborsUp[r], (neighborsPerNode, n) => {
+                    Assert.assertAll(neighborsPerNode, neighbor => neighborsDown[r - 1][neighbor].indexOf(n) !== -1, 'neighbor in rank ' + (r - 1) + 'is missing downNeighbor');
+                });
+            };
+
+            const assertOrderAndPositionCoherence = (r: number = null) => {
+                if (r === null) {
+                    _.forEach(_.range(ranks.length), r => assertOrderAndPositionCoherence(r));
+                    return;
+                }
+                Assert.assertEqual(_.sortBy(order[r]), _.range(0, order[r].length), 'order in rank ' + r + ' not contiguous');
+                Assert.assertEqual(_.sortBy(positions[r]), _.range(0, order[r].length), 'positions in rank ' + r + ' not contiguous');
+                Assert.assertNone(positions[r], (pos, p) => order[r][pos] !== p, 'positions and orders do not match');
+                Assert.assertNone(order[r], (ord, o) => positions[r][ord] !== o, 'positions and orders do not match');
+            };
+
+            const assertEdgesBetweenNeighboringRanks = () => {
+                Assert.assertAll(this.edges(), edge => {
+                    return this.node(edge.src).rank + 1 === this.node(edge.dst).rank;
+                }, 'edge not between neighboring ranks');
+            };
+
+            const getConflict = (type: 'HEAVYHEAVY' | 'HEAVYLIGHT', r: number, skipIfZero = false) => {
+                if (skipIfZero && crossings[r] === 0) {
+                    // there is no conflict in this rank
+                    return null;
+                }
+                const segmentStarts = [];
+                const segmentEnds = [];
+                for (let n = 0; n < Math.max(order[r - 1].length); ++n) {
+                    segmentStarts[n] = [];
+                }
+                for (let n = 0; n < Math.max(order[r].length); ++n) {
+                    segmentEnds[n] = [];
+                }
+                for (let n = 0; n < order[r].length; ++n) {
+                    const posSouth = positions[r][n];
+                    for (let neighbor = 0; neighbor < neighborsUp[r][n].length; ++neighbor) {
+                        const posNorth = positions[r - 1][neighborsUp[r][n][neighbor]];
+                        const heavy = (weightsUp[r][n][neighbor] === Number.POSITIVE_INFINITY);
+                        if (type === 'HEAVYHEAVY' && !heavy) {
+                            continue;
+                        }
+                        const intranode = (heavy && !ranks[r].groups[0].nodes[n].isVirtual);
+                        if (type === 'HEAVYLIGHT' && heavy && !intranode) {
+                            continue;
+                        }
+                        const segment = [posNorth, posSouth, heavy];
+                        segmentStarts[posNorth].push(segment);
+                        segmentEnds[posSouth].push(segment);
+                    }
+                }
+                const openSegments: Set<[number, number, boolean]> = new Set();
+                for (let n = 0; n < Math.max(order[r].length, order[r - 1].length); ++n) {
+                    _.forEach(segmentStarts[n], (segment: [number, number, boolean]) => {
+                        const [posNorth, posSouth] = segment;
+                        if (posNorth >= posSouth) {
+                            openSegments.delete(segment);
+                        }
+                    });
+                    _.forEach(segmentEnds[n], (segment: [number, number, boolean]) => {
+                        const [posNorth, posSouth] = segment;
+                        if (posNorth < posSouth) { // equality handled in loop above
+                            openSegments.delete(segment);
+                        }
+                    });
+                    const newSegments = [];
+                    _.forEach(segmentStarts[n], (segment: [number, number, boolean]) => {
+                        const [posNorth, posSouth] = segment;
+                        if (posNorth <= posSouth) {
+                            newSegments.push(segment);
+                        }
+                    });
+                    _.forEach(segmentEnds[n], (segment: [number, number, boolean]) => {
+                        const [posNorth, posSouth] = segment;
+                        if (posNorth > posSouth) { // equality handled in loop above
+                            newSegments.push(segment);
+                        }
+                    });
+                    for (const newSegment of newSegments) {
+                        const [posNorth, posSouth, heavy] = newSegment;
+                        const newDir = Math.sign(posSouth - posNorth);
+                        for (const openSegment of openSegments) {
+                            const [openPosNorth, openPosSouth, openHeavy] = openSegment;
+                            // dir is
+                            const openDir = Math.sign(openPosSouth - openPosNorth);
+                            if ((newDir !== openDir) || (newDir === 1 && posSouth < openPosSouth) || (posNorth < openPosNorth)) {
+                                // segments have different direction or new segment is more vertical
+                                if (openHeavy) {
+                                    return [r, openPosNorth, openPosSouth, posNorth, posSouth];
+                                } else if (heavy) {
+                                    return [r, posNorth, posSouth, openPosNorth, openPosSouth];
+                                }
+                            }
+                        }
+                        if (newDir !== 0) {
+                            openSegments.add(newSegment);
+                        }
+                    }
+                }
+                return null;
+            };
+
+            let step = 0;
+
+            const storeLocal = () => {
+                if (typeof window === 'undefined') {
+                    return;
+                }
+                step++;
+                if (step === 1) {
+                    const obj = [];
+                    window.localStorage.setItem('orderGraph', JSON.stringify(obj));
+                }
+                const obj = JSON.parse(window.localStorage.getItem('orderGraph'));
+                _.forEach(ranks, (rank: OrderRank, r: number) => {
+                    _.forEach(rank.groups, (group: OrderGroup, g: number) => {
+                        _.forEach(group.nodes, (node: OrderNode, n: number) => {
+                            node.position = positions[r][groupOffsetsN[r][g] + n];
+                        });
+                        group.orderNodes();
+                        group.position = groupPositions[r][g];
+                    });
+                    rank.orderGroups();
+                });
+                const stepObj = { ranks: [], edges: [] };
+                _.forEach(ranks, (rank: OrderRank) => {
+                    const rankObj = [];
+                    _.forEach(rank.orderedGroups(), (group: OrderGroup) => {
+                        const groupObj = { label: group.label(), nodes: [] };
+                        _.forEach(group.orderedNodes(), (node: OrderNode) => {
+                            groupObj.nodes.push({ id: node.id, label: node.label(), isVirtual: node.isVirtual });
+                        });
+                        rankObj.push(groupObj);
+                    });
+                    stepObj.ranks.push(rankObj);
+                });
+                _.forEach(graph.edges(), edge => {
+                    stepObj.edges.push({
+                        src: edge.src,
+                        dst: edge.dst,
+                        weight: edge.weight === Number.POSITIVE_INFINITY ? 'INFINITY' : edge.weight
+                    });
+                });
+                obj.push(stepObj);
+                window.localStorage.setItem('orderGraph', JSON.stringify(obj));
+            };
+
+            /**
+             * Tries to resolve illegal crossings, i. e. crossings of edges with infinite weight.
+             */
+            const resolveConflicts = () => {
+                if (DEBUG) {
+                    Assert.assertAll(_.range(ranks.length), r => groupOrder[r].length === 1, 'conflict resolution with more than one group per rank');
+                }
+                Timer.start(['doLayout', 'orderRanks', 'doOrder', 'order', 'doOrder', 'resolve']);
+                const resolveConflict = (conflict) => {
+                    const [r, crossedNorthPos, crossedSouthPos, crossingNorthPos, crossingSouthPos] = conflict;
+
+                    const crossedNorthN = order[r - 1][crossedNorthPos];
+                    const crossedNorthNode = ranks[r - 1].groups[0].nodes[crossedNorthN];
+                    const crossedSouthN = order[r][crossedSouthPos];
+                    const crossedSouthNode = ranks[r].groups[0].nodes[crossedSouthN];
+                    const crossingNorthN = order[r - 1][crossingNorthPos];
+                    const crossingNorthNode = ranks[r - 1].groups[0].nodes[crossingNorthN];
+                    const crossingSouthN = order[r][crossingSouthPos];
+                    const crossingSouthNode = ranks[r].groups[0].nodes[crossingSouthN];
+                    const crossingEdge = graph.edgeBetween(crossingNorthNode.id, crossingSouthNode.id);
+
+                    const resolveHeavyHeavy = () => {
+                        if (options['debug']) {
+                            console.log('resolveHeavyHeavy');
+                        }
+                        const tmpOrderA = _.cloneDeep(order[r]);
+                        _.pull(tmpOrderA, crossingSouthN);
+                        tmpOrderA.splice(crossedSouthPos, 0, crossingSouthN);
+                        const tmpOrderB = _.cloneDeep(order[r]);
+                        _.pull(tmpOrderB, crossedSouthN);
+                        tmpOrderB.splice(crossingSouthPos, 0, crossedSouthN);
+                        let crossingsA = countCrossings(tmpOrderA, r, 'UP');
+                        let crossingsB = countCrossings(tmpOrderB, r, 'UP');
+                        if (r < ranks.length - 1) {
+                            crossingsA += countCrossings(tmpOrderA, r, 'DOWN');
+                            crossingsB += countCrossings(tmpOrderB, r, 'DOWN');
+                        }
+                        if (crossingsA < crossingsB) {
+                            order[r] = tmpOrderA;
+                        } else {
+                            order[r] = tmpOrderB;
+                        }
+                        // update positions
+                        _.forEach(order[r], (n, pos) => {
+                            positions[r][n] = pos;
+                        });
+                        // update number of crossings
+                        for (let tmpR = r; tmpR <= Math.min(r + 1, ranks.length - 1); ++tmpR) {
+                            crossings[tmpR] = countCrossings(order[tmpR], tmpR, 'UP');
+                        }
+                    };
+
+                    const resolveY = () => {
+                        if (options['debug']) {
+                            console.log('resolveY');
+                        }
+                        const addEdge = (srcNode: OrderNode, dstNode: OrderNode, weight: number) => {
+                            if (srcNode.isVirtual && dstNode.isVirtual) {
+                                weight = Number.POSITIVE_INFINITY;
+                            }
+                            const newEdge = new Edge(srcNode.id, dstNode.id, weight);
+                            const newEdgeId = this.addEdge(newEdge);
+                            graph.addEdge(newEdge, newEdgeId);
+                        };
+
+                        const removeEdge = (srcNode: OrderNode, dstNode: OrderNode) => {
+                            const edge = graph.edgeBetween(srcNode.id, dstNode.id);
+                            graph.removeEdge(edge.id);
+                            this.removeEdge(edge.id);
+                        };
+
+                        const addNode = (r: number, pos: number, node: OrderNode) => {
+                            const nextN = order[r].length;
+                            for (let tmpPos = order[r].length; tmpPos >= pos + 1; --tmpPos) {
+                                order[r][tmpPos] = order[r][tmpPos - 1];
+                            }
+                            order[r][pos] = nextN;
+                            ranks[r].groups[0].addNode(node, node.id);
+                            node.rank = r;
+                            node.index = nextN;
+                            // update positions
+                            _.forEach(order[r], (n, pos) => {
+                                positions[r][n] = pos;
+                            });
+
+                            return nextN;
+                        };
+
+                        const removeNode = (node: OrderNode, permanent = false) => {
+                            const r = node.rank;
+                            const n = node.index;
+                            const pos = positions[r][n];
+
+                            // adjust n's
+                            for (let tmpN = n + 1; tmpN < order[r].length; ++tmpN) {
+                                order[r][positions[r][tmpN]]--;
+                            }
+                            ranks[r].groups[0].removeNode(node);
+
+                            // adjust positions
+                            for (let tmpPos = pos + 1; tmpPos < order[r].length; ++tmpPos) {
+                                order[r][tmpPos - 1] = order[r][tmpPos];
+                            }
+
+                            order[r].length = order[r].length - 1;
+                            positions[r].length = order[r].length;
+
+                            // update positions
+                            _.forEach(order[r], (n, pos) => {
+                                positions[r][n] = pos;
+                            });
+
+                            if (permanent) {
+                                graph.removeNode(node.id);
+                                this.removeNode(node.id);
+                            }
+                        };
+
+                        // mark nodes that must not be moved
+                        const nonMoving = new Set();
+                        const intranodePathEnds = new Set();
+                        const sinks = new Set();
+                        _.forEach(ranks[r - 1].groups[0].nodes, (node: OrderNode) => {
+                            let isOnIntranodePath = !node.isVirtual && _.some(graph.incidentEdges(node.id), edge => edge.weight === Number.POSITIVE_INFINITY);
+                            _.forEach(graph.incidentEdges(node.id), edge => {
+                                if (edge.weight === Number.POSITIVE_INFINITY) {
+                                    isOnIntranodePath = !node.isVirtual;
+                                }
+                            });
+                            if (isOnIntranodePath) {
+                                nonMoving.add(node);
+                                let tmpNode = node;
+                                while (graph.outEdges(tmpNode.id).length > 0 && graph.outEdges(tmpNode.id)[0].weight === Number.POSITIVE_INFINITY) {
+                                    tmpNode = graph.node(graph.outEdges(tmpNode.id)[0].dst);
+                                    nonMoving.add(tmpNode);
+                                }
+                                intranodePathEnds.add(tmpNode);
+                            } else if (graph.outEdges(node.id).length === 0) {
+                                // sink on rank r - 1
+                                nonMoving.add(node);
+                                sinks.add(node);
+                            }
+                        });
+
+                        // create new rank if necessary
+                        if (_.filter(_.last(ranks).groups[0].nodes, node => !nonMoving.has(node)).length > 0) {
+                            const newR = ranks.length;
+                            const newRank = new OrderRank(ranks[ranks.length - 1].rank + 1);
+                            this.addRank(newRank);
+                            const newGroup = new OrderGroup(null);
+                            newRank.addGroup(newGroup);
+                            const newRankComponent = new OrderRank(ranks[ranks.length - 1].rank + 1);
+                            graph.addRank(newRankComponent);
+                            ranks.push(newRankComponent);
+                            newRankComponent.addGroup(newGroup);
+                            this._groupGraph.addEdge(new Edge(ranks[newR - 1].groups[0].id, ranks[newR].groups[0].id));
+                            this._rankGraph.addEdge(new Edge(ranks[newR - 1].id, ranks[newR].id));
+                            newRankComponent.order = [0];
+                            groupOrder[newR] = [0];
+                            groupPositions[newR] = [0];
+                            groupOffsetsPos[newR] = [0];
+                            groupOffsetsN[newR] = [0];
+                            order[newR] = [];
+                            positions[newR] = [];
+                            crossings[newR] = 0;
+                        }
+
+                        // move nodes down and create virtual nodes
+                        for (let tmpR = ranks.length - 1; tmpR >= r; --tmpR) {
+                            const northNodes = _.map(order[tmpR - 1], n => ranks[tmpR - 1].groups[0].nodes[n]);
+                            _.forEach(northNodes, (node: OrderNode) => {
+                                if (!nonMoving.has(node)) {
+                                    const pos = positions[tmpR - 1][node.index];
+                                    removeNode(node);
+                                    addNode(tmpR, order[tmpR].length, node);
+                                    if (tmpR === r) {
+                                        // create a virtual node for each in edge and route edge through new node
+                                        const sortedEdges = _.sortBy(graph.inEdges(node.id), edge => positions[r - 2][graph.node(edge.src).index]);
+                                        _.forEachRight(sortedEdges, inEdge => {
+                                            const newNode = new OrderNode(null, true, node.label() + '\'');
+                                            this.addNode(newNode);
+                                            addNode(r - 1, pos, newNode);
+                                            const srcNode = graph.node(inEdge.src);
+                                            removeEdge(srcNode, node);
+                                            addEdge(srcNode, newNode, inEdge.weight);
+                                            addEdge(newNode, node, inEdge.weight);
+                                        });
+                                    }
+                                } else {
+                                    if (intranodePathEnds.has(node)) {
+                                        if (DEBUG) {
+                                            Assert.assertAll(graph.outEdges(node.id), edge => graph.node(edge.dst).rank === tmpR + 1, 'edge below intranode path end not spanning two ranks');
+                                        }
+                                        // create a virtual node for each out edge and route edge through new node
+                                        // sort edges to prevent crossings between them
+                                        const sortedEdges = _.sortBy(graph.outEdges(node.id), edge => positions[tmpR + 1][graph.node(edge.dst).index]);
+                                        _.forEach(sortedEdges, outEdge => {
+                                            const newNode = new OrderNode(null, true, node.label() + '\'');
+                                            this.addNode(newNode);
+                                            addNode(tmpR, order[tmpR].length, newNode);
+                                            const dstNode = graph.node(outEdge.dst);
+                                            removeEdge(node, dstNode);
+                                            addEdge(node, newNode, outEdge.weight);
+                                            addEdge(newNode, dstNode, outEdge.weight);
+                                        });
+                                    } else if (!sinks.has(node)) {
+                                        // there is a an internode segment between upper and this rank
+                                        // => change order within this rank
+                                        const lowerNode = graph.outNeighbors(node.id)[0];
+                                        removeNode(lowerNode);
+                                        addNode(tmpR, order[tmpR].length, lowerNode);
+                                    }
+                                }
+                            });
+                        }
+
+                        if (options['debug']) {
+                            storeLocal();
+                        }
+
+                        // recreate neighbors data structure
+                        for (let tmpR = 0; tmpR < ranks.length; ++tmpR) {
+                            neighborsDown[tmpR] = [];
+                            weightsDown[tmpR] = [];
+                            neighborsUp[tmpR] = [];
+                            weightsUp[tmpR] = [];
+                            _.forEach(ranks[tmpR].groups[0].nodes, (node: OrderNode, n: number) => {
+                                neighborsDown[tmpR][n] = [];
+                                weightsDown[tmpR][n] = [];
+                                neighborsUp[tmpR][n] = [];
+                                weightsUp[tmpR][n] = [];
+                            });
+                        }
+                        _.forEach(graph.edges(), edge => {
+                            const srcNode = graph.node(edge.src);
+                            const dstNode = graph.node(edge.dst);
+                            neighborsDown[srcNode.rank][srcNode.index].push(dstNode.index);
+                            weightsDown[srcNode.rank][srcNode.index].push(edge.weight);
+                            neighborsUp[dstNode.rank][dstNode.index].push(srcNode.index);
+                            weightsUp[dstNode.rank][dstNode.index].push(edge.weight);
+                        });
+
+                        for (let tmpR = 1; tmpR < ranks.length; ++tmpR) {
+                            crossings[tmpR] = countCrossings(order[tmpR], tmpR, 'UP');
+                        }
+                        if (DEBUG) {
+                            Assert.assertAll(_.range(r + 1), r => getConflict('HEAVYHEAVY', r, true) === null, 'heavy-heavy conflict after y resolution');
+                        }
+                    };
+
+                    const checkXResolution = (side: 'LEFT' | 'RIGHT') => {
+                        const nodesPerRank = new Array(ranks.length);
+                        const minHeavyNodePerRank: Array<number> = new Array(ranks.length);
+                        const maxOtherNodePerRank: Array<number> = new Array(ranks.length);
+                        let conflict = false;
+                        for (let r = 0; r < ranks.length; ++r) {
+                            nodesPerRank[r] = new Map();
+                            minHeavyNodePerRank[r] = (side === 'RIGHT' ? Number.POSITIVE_INFINITY : Number.NEGATIVE_INFINITY);
+                            maxOtherNodePerRank[r] = (side === 'RIGHT' ? Number.NEGATIVE_INFINITY : Number.POSITIVE_INFINITY);
+                        }
+                        const queue: Array<[OrderNode, string]> = [];
+                        let minRank = r - 1;
+                        const maxRank = r;
+                        const moveDir = (side === 'LEFT' ? 1 : -1);
+                        const minFun = (side === 'RIGHT' ? Math.min : Math.max);
+                        const maxFun = (side === 'RIGHT' ? Math.max : Math.min);
+                        const geFun = (side === 'RIGHT' ? ((a, b) => a >= b) : ((a, b) => a <= b));
+                        const addNodeToGroup = (r: number, node: OrderNode, group: string) => {
+                            nodesPerRank[r].set(node, group);
+                            queue.push([node, group]);
+                            const addIntermediate = () => {
+                                if (geFun(maxOtherNodePerRank[r], minHeavyNodePerRank[r])) {
+                                    const intermediate = [];
+                                    for (let pos = maxOtherNodePerRank[r]; pos !== minHeavyNodePerRank[r]; pos += moveDir) {
+                                        const node = ranks[r].groups[0].nodes[order[r][pos]];
+                                        if (!nodesPerRank[r].has(node)) {
+                                            intermediate.push([node, 'YELLOW']);
+                                        } else if (node.rank === minRank) {
+                                            intermediate.push([node, nodesPerRank[r].get(node)]); // check boundaries again
+                                        }
+                                    }
+                                    _.forEach(intermediate, ([node, group]) => {
+                                        addNodeToGroup(r, node, group);
+                                    });
+                                }
+                            };
+                            if (group === 'RED') {
+                                const prev = maxOtherNodePerRank[r];
+                                maxOtherNodePerRank[r] = maxFun(maxOtherNodePerRank[r], positions[r][node.index]);
+                                if (maxOtherNodePerRank[r] !== prev && minHeavyNodePerRank[r] !== Number.POSITIVE_INFINITY && minHeavyNodePerRank[r] !== Number.NEGATIVE_INFINITY) {
+                                    addIntermediate();
+                                }
+                            } else {
+                                // potentially heavy
+                                const prev = minHeavyNodePerRank[r];
+                                minHeavyNodePerRank[r] = minFun(minHeavyNodePerRank[r], positions[r][node.index]);
+                                if (minHeavyNodePerRank[r] !== prev && maxOtherNodePerRank[r] !== Number.POSITIVE_INFINITY && maxOtherNodePerRank[r] !== Number.NEGATIVE_INFINITY) {
+                                    addIntermediate();
+                                }
+                            }
+                        };
+                        addNodeToGroup(r - 1, crossedNorthNode, 'GREEN');
+                        addNodeToGroup(r, crossedSouthNode, 'GREEN');
+                        addNodeToGroup(r - 1, crossingNorthNode, 'RED');
+                        addNodeToGroup(r, crossingSouthNode, 'RED');
+
+                        let queuePointer = 0;
+                        while (queuePointer < queue.length && !conflict) {
+                            const [node, group] = queue[queuePointer++];
+                            if (nodesPerRank[node.rank].get(node) !== group) {
+                                continue; // group has changed in the meantime
+                            }
+                            const addNeighbors = (neighborMethod: 'inEdges' | 'outEdges', neighborProperty: 'src' | 'dst', rankOffset: 1 | -1) => {
+                                _.forEach(graph[neighborMethod](node.id), edge => {
+                                    if (edge === crossingEdge) {
+                                        return;
+                                    }
+                                    const neighborRank = node.rank + rankOffset;
+                                    const neighbor = graph.node(edge[neighborProperty]);
+                                    if (!nodesPerRank[neighborRank].has(neighbor)) {
+                                        // add neighbor to same group as this node
+                                        addNodeToGroup(neighborRank, neighbor, group);
+                                    } else {
+                                        // check for conflict or group change
+                                        const neighborGroup = nodesPerRank[neighborRank].get(neighbor);
+                                        if (neighborGroup !== group) {
+                                            if (neighborGroup === 'YELLOW') {
+                                                addNodeToGroup(neighborRank, neighbor, group);
+                                            } else if (group === 'YELLOW') {
+                                                addNodeToGroup(node.rank, node, neighborGroup);
+                                            } else {
+                                                // one is "GREEN" and the other is "RED"
+                                                conflict = true;
+                                            }
+                                        }
+                                    }
+                                });
+                            };
+                            if (node.rank > minRank) {
+                                addNeighbors('inEdges', 'src', -1);
+                            }
+                            if (node.rank === minRank && geFun(positions[node.rank][node.index], minHeavyNodePerRank[node.rank])) {
+                                let foundNewMinRank = false;
+                                _.forEach(graph.inEdges(node.id), inEdge => {
+                                    if (inEdge.weight === Number.POSITIVE_INFINITY) {
+                                        foundNewMinRank = true;
+                                    }
+                                });
+                                if (foundNewMinRank) {
+                                    minRank--;
+                                    nodesPerRank[node.rank].forEach((group, borderNode) => {
+                                        queue.push([borderNode, group]);
+                                    });
+                                }
+                            }
+                            if (node.rank < maxRank) {
+                                addNeighbors('outEdges', 'dst', 1);
+                            }
+                        }
+                        if (conflict) {
+                            return null;
+                        }
+                        // group nodes
+                        const nodesPerRankGrouped = [];
+                        _.forEach(nodesPerRank, (nodes, r) => {
+                            nodesPerRankGrouped[r] = {
+                                'GREEN': new Set(),
+                                'MOVING': new Set(),
+                            };
+                            minHeavyNodePerRank[r] = (side === 'RIGHT' ? Number.POSITIVE_INFINITY : Number.NEGATIVE_INFINITY);
+                            nodes.forEach((group, node) => {
+                                if (group !== 'RED') {
+                                    // "GREEN" or "YELLOW"
+                                    // because we want to move as few nodes as possible, we count the "YELLOW" nodes to the "GREEN" nodes
+                                    nodesPerRankGrouped[r]['GREEN'].add(node);
+                                    minHeavyNodePerRank[r] = minFun(minHeavyNodePerRank[r], positions[r][node.index]);
+                                }
+                            });
+                            nodes.forEach((group, node) => {
+                                if (group === 'RED' && geFun(positions[r][node.index], minHeavyNodePerRank[node.rank])) {
+                                    nodesPerRankGrouped[r]['MOVING'].add(node);
+                                }
+                            });
+                        });
+                        return nodesPerRankGrouped;
+                    };
+
+                    const resolveX = (side: 'LEFT' | 'RIGHT', nodesPerRank) => {
+                        if (options['debug']) {
+                            console.log('resolveX', side, nodesPerRank);
+                        }
+                        let minChangedRank = Number.POSITIVE_INFINITY;
+                        let maxChangedRank = Number.NEGATIVE_INFINITY;
+                        _.forEach(nodesPerRank, (rank, r: number) => {
+                            if (rank['MOVING'].size === 0 || rank['GREEN'].size === 0) {
+                                return;
+                            }
+                            const heavy: Array<OrderNode> = _.sortBy(Array.from(rank['GREEN']), node => positions[r][node.index]);
+                            const moving: Array<OrderNode> = _.sortBy(Array.from(rank['MOVING']), node => positions[r][node.index]);
+                            const newOrder = [];
+                            _.forEach(order[r], n => {
+                                const node = ranks[r].groups[0].nodes[n];
+                                if (rank['MOVING'].has(node)) {
+                                    return; // do nothing
+                                }
+                                if (side === 'RIGHT' && n === heavy[0].index) {
+                                    _.forEach(moving, movingNode => {
+                                        newOrder.push(movingNode.index);
+                                    });
+                                }
+                                newOrder.push(n);
+                                if (side === 'LEFT' && n === _.last(heavy).index) {
+                                    _.forEach(moving, movingNode => {
+                                        newOrder.push(movingNode.index);
+                                    });
+                                }
+                            });
+                            order[r] = newOrder;
+                            _.forEach(order[r], (n, pos) => {
+                                positions[r][n] = pos;
+                            });
+                            minChangedRank = Math.min(minChangedRank, r);
+                            maxChangedRank = Math.max(maxChangedRank, r + 1);
+                        });
+                        for (let r = minChangedRank; r <= Math.min(maxChangedRank, ranks.length - 1); ++r) {
+                            crossings[r] = countCrossings(order[r], r, 'UP');
+                        }
+
+                        if (options['debug']) {
+                            storeLocal();
+                        }
+                        if (DEBUG) {
+                            Assert.assertAll(_.range(r + 1), r => getConflict('HEAVYHEAVY', r, true) === null, 'heavy-heavy conflict after x resolution');
+                        }
+                    };
+
+                    if (crossingEdge.weight === Number.POSITIVE_INFINITY) {
+                        resolveHeavyHeavy();
+                    } else {
+                        const leftResolution = checkXResolution('LEFT');
+                        const rightResolution = checkXResolution('RIGHT');
+                        if (leftResolution === null) {
+                            if (rightResolution === null) {
+                                resolveY();
+                            } else {
+                                resolveX('RIGHT', rightResolution);
+                            }
+                        } else {
+                            if (rightResolution === null) {
+                                resolveX('LEFT', leftResolution);
+                            } else {
+                                const numNodesLeft = _.sum(_.map(leftResolution, rank => rank['MOVING'].size));
+                                const numNodesRight = _.sum(_.map(rightResolution, rank => rank['MOVING'].size));
+                                if (numNodesLeft < numNodesRight) {
+                                    resolveX('LEFT', leftResolution);
+                                } else {
+                                    resolveX('RIGHT', rightResolution);
+                                }
+                            }
+                        }
+                    }
+                };
+
+                if (options['debug']) {
+                    storeLocal();
+                }
+
+                for (let r = 1; r < ranks.length; ++r) {
+                    crossings[r] = countCrossings(order[r], r, 'UP');
+                }
+                for (let r = 1; r < ranks.length; ++r) {
+                    while (getConflict('HEAVYHEAVY', r, true) !== null) {
+                        const conflict = getConflict('HEAVYHEAVY', r);
+                        resolveConflict(conflict);
+                        if (options['debug']) {
+                            storeLocal();
+                        }
+                    }
+                    while (getConflict('HEAVYLIGHT', r, true) !== null) {
+                        const conflict = getConflict('HEAVYLIGHT', r);
+                        resolveConflict(conflict);
+                        if (options['debug']) {
+                            storeLocal();
+                        }
+                    }
+                }
+                if (DEBUG) {
+                    Assert.assertAll(_.range(1, ranks.length), r => getConflict('HEAVYHEAVY', r) === null, 'heavy-heavy conflict after y resolution');
+                }
+
+                Timer.stop(['doLayout', 'orderRanks', 'doOrder', 'order', 'doOrder', 'resolve']);
+            };
+
+            if (options['debug']) {
+                storeLocal();
+            }
+
+            if (options['countInitial']) {
+                for (let r = 1; r < ranks.length; ++r) {
+                    crossings[r] = countCrossings(order[r], r, 'UP');
+                }
+            }
+            if (options['shuffles'] === 0) {
+                reorder();
+            } else {
+                const originalOrder = _.cloneDeep(order);
+                const originalGroupOrder = _.cloneDeep(groupOrder);
+                const originalCrossings = _.cloneDeep(crossings);
+                reorder();
+                let numCrossings = _.sum(crossings);
+                let minCrossings = numCrossings;
+                let bestOrder = _.cloneDeep(order);
+                let bestGroupOrder = _.cloneDeep(groupOrder);
+                for (let i = 0; i < options['shuffles']; ++i) {
+                    if (minCrossings === 0) {
+                        break;
+                    }
+                    _.forEach(ranks, (rank: OrderRank, r: number) => {
+                        _.forEach(originalOrder[r], (n: number, pos: number) => {
+                            order[r][pos] = n;
+                            positions[r][n] = pos;
+                        });
+                        groupOrder[r] = _.clone(originalGroupOrder[r]);
+                        this._setGroupPositionAndOffset(groupOrder[r], groupPositions[r], groupOffsetsPos[r], rank);
+                    });
+                    crossings = _.cloneDeep(originalCrossings);
+                    reorder(true, true);
+                    numCrossings = _.sum(crossings);
+                    if (numCrossings < minCrossings) {
+                        minCrossings = numCrossings;
+                        bestOrder = _.cloneDeep(order);
+                        bestGroupOrder = _.cloneDeep(groupOrder);
+                    }
+                }
+                for (let r = 0; r < ranks.length; ++r) {
+                    _.forEach(bestOrder[r], (g, pos) => {
+                        order[r][pos] = g;
+                        positions[r][g] = pos;
+                    });
+                    _.forEach(bestGroupOrder[r], (g, pos) => {
+                        groupOrder[r][pos] = g;
+                        groupPositions[r][g] = pos;
+                    });
+                }
+            }
+
+            if (options['resolveConflicts']) {
+                resolveConflicts();
+                reorder(false, false, 0, true);
+            }
+
+            // transform component ranks to absolute ranks
+            if (minRank > 0 && minRank < Number.POSITIVE_INFINITY) {
+                _.forEach(graph.nodes(), (node: OrderNode) => {
+                    node.rank += minRank;
+                });
+            }
+
+            // store new positions
+            _.forEach(ranks, (rank: OrderRank, r: number) => {
+                _.forEach(rank.groups, (group: OrderGroup, g: number) => {
+                    group.position = groupPositions[r][g];
+                    _.forEach(group.nodes, (node: OrderNode) => {
+                        node.position = positions[r][groupOffsetsN[r][g] + node.index];
+                    });
+                    group.orderNodes();
+                });
+                rank.orderGroups();
+            });
+
+            const numCrossings = _.sum(crossings);
+
+            Timer.stop(['doLayout', 'orderRanks', 'doOrder', 'order', 'doOrder']);
+
+            return numCrossings;
+        };
+
+        this._addGroupEdges();
+
+        let numCrossings = 0;
+        const groupComponents = this._groupGraph.components();
+        _.forEach(groupComponents, (groupGraphComponent: Component<OrderGroup, Edge<any, any>>) => {
+            const componentGraph = new OrderGraph();
+            const ranks: Array<OrderRank> = [];
+            _.forEach(groupGraphComponent.nodes(), (group: OrderGroup) => {
+                if (ranks[group.rank.id] === undefined) {
+                    ranks[group.rank.id] = new OrderRank(group.rank.rank);
+                    componentGraph.addRank(ranks[group.rank.id]);
+                }
+                ranks[group.rank.id].addGroup(group, group.id);
+                const groupNodes = group.nodes;
+                group.nodes = [];
+                _.forEach(groupNodes, (node: OrderNode) => {
+                    group.addNode(node, node.id);
+                });
+            });
+
+            _.forEach(componentGraph.nodes(), (newNode: OrderNode) => {
+                _.forEach(this.outEdges(newNode.id), (edge: Edge<any, any>) => {
+                    componentGraph.addEdge(edge, edge.id);
+                });
+            });
+
+            if (componentGraph._nodeGraph.numEdges() < 2) {
+                // with 0 or one edges, there is nothing to reorder
+                return;
+            }
+
+            componentGraph._addGroupEdges();
+            componentGraph._addRankEdges();
+
+            numCrossings += doOrder(componentGraph);
+        });
+        Timer.stop(['doLayout', 'orderRanks', 'doOrder', 'order']);
+
+        return numCrossings;
+    }
+
+    /**
+     * Adapted from Barth, W., Jünger, M., & Mutzel, P. (2002, August). Simple and efficient bilayer cross counting.
+     * In International Symposium on Graph Drawing (pp. 130-141). Springer, Berlin, Heidelberg.
+     * @param numNorth
+     * @param numSouth
+     * @param edges
+     * @private
+     */
+    private _countCrossings(numNorth: number, numSouth: number, edges: Array<[number, number, number]>): number {
+        // build south sequence
+        const sortedEdges = _.sortBy(edges, edge => edge[0] * numSouth + edge[1]);
+        const southSequence = _.map(sortedEdges, edge => edge[1]);
+        const weights = _.map(sortedEdges, edge => edge[2]);
+
+        // build the accumulator tree
+        let firstIndex = 1;
+        while (firstIndex < numSouth) {
+            firstIndex *= 2; // number of tree nodes
+        }
+        const treeSize = 2 * firstIndex - 1;
+        firstIndex -= 1; // index of leftmost leaf
+        const tree = _.fill(new Array(treeSize), 0);
+
+        // compute the total weight of the crossings
+        let crossWeight = 0;
+        _.forEach(southSequence, (south: number, i: number) => {
+            let index = south + firstIndex;
+            tree[index] += weights[i];
+            let weightSum = 0;
+            while (index > 0) {
+                if (index % 2) {
+                    weightSum += tree[index + 1];
+                }
+                index = Math.floor((index - 1) / 2);
+                tree[index] += weights[i];
+            }
+            crossWeight += weights[i] * weightSum;
+        });
+        return crossWeight;
+    }
+
+    private _getPartialOrders(newOrder: Array<number>, order: Array<number>, positions: Array<number>, debug = false): Array<Array<number>> {
+        const changes = [];
+        const permutation = new Array(newOrder.length);
+        _.forEach(newOrder, (index, pos) => {
+            permutation[pos] = positions[index];
+        });
+        let seqStart = null;
+        let seqEnd = -1;
+        for (let pos = 0; pos < permutation.length; ++pos) {
+            if (permutation[pos] > pos) {
+                if (seqStart === null) {
+                    seqStart = pos;
+                    seqEnd = permutation[pos];
+                } else {
+                    if (seqEnd < pos) {
+                        changes.push([seqStart, pos - 1]);
+                        seqStart = pos;
+                        seqEnd = permutation[pos];
+                    } else {
+                        seqEnd = Math.max(seqEnd, permutation[pos]);
+                    }
+                }
+            }
+            if (permutation[pos] === pos && seqStart !== null && seqEnd < pos) {
+                changes.push([seqStart, pos - 1]);
+                seqStart = null;
+            }
+        }
+        if (seqStart !== null) {
+            changes.push([seqStart, permutation.length - 1]);
+        }
+        const tmpOrders = [];
+        _.forEach(changes, change => {
+            tmpOrders.push(_.concat(
+                _.slice(order, 0, change[0]),
+                _.slice(newOrder, change[0], change[1] + 1),
+                _.slice(order, change[1] + 1)
+            ));
+        });
+        return tmpOrders;
+    }
+
+    private _setGroupPositionAndOffset(groupOrder: Array<number>, groupPositions: Array<number>, groupOffsetsPos: Array<number>, rank: OrderRank): void {
+        let offset = 0;
+        _.forEach(groupOrder, (g: number, pos: number) => {
+            groupPositions[g] = pos;
+            groupOffsetsPos[g] = offset;
+            offset += rank.groups[g].nodes.length;
+        });
+    }
+}
diff --git a/src/layouting/order/orderGroup.ts b/src/layouting/order/orderGroup.ts
new file mode 100644
index 00000000..a134b369
--- /dev/null
+++ b/src/layouting/order/orderGroup.ts
@@ -0,0 +1,56 @@
+import * as _ from 'lodash';
+import Edge from '../graph/edge';
+import Graph from '../graph/graph';
+import Node from '../graph/node';
+import OrderNode from './orderNode';
+import OrderRank from './orderRank';
+
+export default class OrderGroup extends Node<Graph<any, any>, Edge<any, any>> {
+    public readonly reference: any;
+    public shuffleHierarchy: Array<any> = null;
+    public nodes: Array<OrderNode> = [];
+
+    public order: Array<number> = [];
+    public position = 0;
+    public rank: OrderRank;
+    public index = 0; // the index within the rank, used as an id, other than position this does not change
+
+    constructor(reference: any, label: string = null) {
+        super(label);
+        this.reference = reference;
+    }
+
+    addNode(node: OrderNode, id: number = null): number {
+        const nextIndex = this.nodes.length;
+        this.nodes.push(node);
+        node.group = this;
+        node.index = nextIndex;
+        node.rank = this.rank.rank;
+        return this.rank.orderGraph.addNode(node, id);
+    }
+
+    removeNode(node: OrderNode): void {
+        this.rank.orderGraph.removeNode(node.id);
+        for (let i = node.index + 1; i < this.nodes.length; ++i) {
+            this.nodes[i].index--;
+        }
+        _.pull(this.nodes, node);
+    }
+
+    orderNodes(): void {
+        this.order = _.map(_.sortBy(_.map(this.nodes, (node: OrderNode, n: number) => {
+            return {n: n, pos: node.position};
+        }), 'pos'), 'n');
+    }
+
+    orderedNodes(): Array<OrderNode> {
+        const nodes = [];
+        if (this.order.length !== this.nodes.length) {
+            this.orderNodes();
+        }
+        _.forEach(this.order, (pos: number) => {
+            nodes.push(this.nodes[pos]);
+        });
+        return nodes;
+    }
+}
diff --git a/src/layouting/order/orderNode.ts b/src/layouting/order/orderNode.ts
new file mode 100644
index 00000000..827993a0
--- /dev/null
+++ b/src/layouting/order/orderNode.ts
@@ -0,0 +1,18 @@
+import Node from '../graph/node';
+import OrderGroup from './orderGroup';
+
+export default class OrderNode extends Node<any, any>
+{
+    public reference: any;
+    public group: OrderGroup;
+    public position = 0;
+    public index = 0; // the index within the group, used as an id, changes only when another node is removed
+    public rank = 0;
+    public readonly isVirtual: boolean;
+
+    constructor(reference: any, isVirtual: boolean, label = '') {
+        super(label);
+        this.reference = reference;
+        this.isVirtual = isVirtual;
+    }
+}
diff --git a/src/layouting/order/orderRank.ts b/src/layouting/order/orderRank.ts
new file mode 100644
index 00000000..bcd5a2e8
--- /dev/null
+++ b/src/layouting/order/orderRank.ts
@@ -0,0 +1,43 @@
+import * as _ from 'lodash';
+import Node from '../graph/node';
+import OrderGraph from './orderGraph';
+import OrderGroup from './orderGroup';
+
+export default class OrderRank extends Node<any, any>
+{
+    public readonly groups: Array<OrderGroup> = [];
+
+    public order: Array<number> = [];
+    public orderGraph: OrderGraph;
+    public rank: number;
+
+    constructor(rank: number = null) {
+        super();
+        this.rank = rank;
+    }
+
+    orderGroups(): void {
+        this.order = _.map(_.sortBy(_.map(this.groups, (group: OrderGroup, n: number) => {
+            return {n: n, pos: group.position};
+        }), 'pos'), 'n');
+    }
+
+    orderedGroups(): Array<OrderGroup> {
+        const groups = [];
+        if (this.order.length !== this.groups.length) {
+            this.orderGroups();
+        }
+        _.forEach(this.order, pos => {
+            groups.push(this.groups[pos]);
+        });
+        return groups;
+    }
+
+    addGroup(group: OrderGroup, id: number = null): number {
+        const nextIndex = this.groups.length;
+        this.groups.push(group);
+        group.index = nextIndex;
+        group.rank = this;
+        return this.orderGraph.addGroup(group, id);
+    }
+}
diff --git a/src/layouting/parse/loader.ts b/src/layouting/parse/loader.ts
new file mode 100644
index 00000000..8a84937d
--- /dev/null
+++ b/src/layouting/parse/loader.ts
@@ -0,0 +1,10 @@
+import Parser from './parser';
+import RenderGraph from '../renderGraph/renderGraph';
+
+export default class Loader {
+    static load(name): Promise<RenderGraph> {
+        return fetch('./graphs/' + name + '.json')
+            .then(response => response.json())
+            .then(json => Parser.parse(json));
+    }
+}
diff --git a/src/layouting/parse/parser.ts b/src/layouting/parse/parser.ts
new file mode 100644
index 00000000..931724e9
--- /dev/null
+++ b/src/layouting/parse/parser.ts
@@ -0,0 +1,82 @@
+import * as _ from 'lodash';
+import AccessNode from '../renderGraph/accessNode';
+import InterstateEdge from '../renderGraph/interstateEdge';
+import LibraryNode from '../renderGraph/libraryNode';
+import MapEntry from '../renderGraph/mapEntry';
+import MapExit from '../renderGraph/mapExit';
+import Memlet from '../renderGraph/memlet';
+import NestedSdfg from '../renderGraph/nestedSdfg';
+import RenderGraph from '../renderGraph/renderGraph';
+import SdfgState from '../renderGraph/sdfgState';
+import Tasklet from '../renderGraph/tasklet';
+import RenderNode from '../renderGraph/renderNode';
+
+export default class Parser {
+    static parse(json): RenderGraph {
+        const graph = new RenderGraph();
+        _.forEach(json.nodes, (jsonNode) => {
+            this.addNode(graph, jsonNode);
+        });
+        _.forEach(json.edges, (jsonEdge) => {
+            const edge = new (this.classForType(jsonEdge.attributes.data.type))(parseInt(jsonEdge.src), parseInt(jsonEdge.dst), jsonEdge.src_connector, jsonEdge.dst_connector, jsonEdge.attributes.data.attributes);
+            graph.addEdge(edge);
+        });
+        return graph;
+    }
+
+    static addNode(graph: RenderGraph, jsonNode): void {
+        const node = new (this.classForType(jsonNode.type))(jsonNode.type, jsonNode.label);
+
+        // set child graph
+        if (jsonNode.type === 'NestedSDFG') {
+            node.setChildGraph(this.parse(jsonNode.attributes.sdfg));
+        }
+        if (jsonNode.type === 'SDFGState') {
+            node.setChildGraph(this.parse(jsonNode));
+        }
+
+        // set connectors
+        let inConnectors = [];
+        if (jsonNode.attributes.in_connectors) {
+            if (Array.isArray(jsonNode.attributes.in_connectors)) {
+                inConnectors = jsonNode.attributes.in_connectors;
+            } else {
+                inConnectors = Object.keys(jsonNode.attributes.in_connectors);
+            }
+        }
+        let outConnectors = [];
+        if (jsonNode.attributes.out_connectors) {
+            if (Array.isArray(jsonNode.attributes.out_connectors)) {
+                outConnectors = jsonNode.attributes.out_connectors;
+            } else {
+                outConnectors = Object.keys(jsonNode.attributes.out_connectors);
+            }
+        }
+
+        node.setConnectors(inConnectors, outConnectors);
+
+        // set scope entry and exit
+        node.scopeEntry = jsonNode.scope_entry ? parseInt(jsonNode.scope_entry) : null;
+        node.scopeExit = jsonNode.scope_exit ? parseInt(jsonNode.scope_exit) : null;
+
+        graph.addNode(node, jsonNode.id);
+    }
+
+    static classForType(type: string): any {
+        const types = {
+            'AccessNode': AccessNode,
+            'LibraryNode': LibraryNode,
+            'MapEntry': MapEntry,
+            'MapExit': MapExit,
+            'NestedSDFG': NestedSdfg,
+            'SDFGState': SdfgState,
+            'Tasklet': Tasklet,
+            'Memlet': Memlet,
+            'InterstateEdge': InterstateEdge,
+        };
+        if (!types.hasOwnProperty(type)) {
+            throw new Error('Unknown node or edge type: ' + type);
+        }
+        return types[type];
+    }
+}
diff --git a/src/layouting/rank/rankGraph.ts b/src/layouting/rank/rankGraph.ts
new file mode 100644
index 00000000..87e6a5fc
--- /dev/null
+++ b/src/layouting/rank/rankGraph.ts
@@ -0,0 +1,139 @@
+import { DEBUG } from '../../utils/constants';
+import * as _ from 'lodash';
+import Assert from '../util/assert';
+import Component from '../graph/component';
+import Edge from '../graph/edge';
+import Graph from '../graph/graph';
+import RankNode from './rankNode';
+
+export default class RankGraph extends Graph<RankNode, Edge<any, any>> {
+    rank(): void {
+        if (DEBUG) {
+            Assert.assert(this.components().length === 1, 'rank graph has more than one component');
+            Assert.assert(!this.hasCycle(), 'rank graph has cycle');
+        }
+
+        // do toposort and allocate each node with one of its ancestor sources
+        const rankPerNode: Array<Map<number, number>> = new Array(this.maxId() + 1);
+        for (let n = 0; n < rankPerNode.length; ++n) {
+            rankPerNode[n] = new Map();
+        }
+        const sources = this.sources();
+        let s = 0;
+        let source = sources[0];
+        const unrankedNeighbors = new Set();
+        while (s < sources.length) {
+            let minDiff = (s === 0 ? 0 : Number.POSITIVE_INFINITY);
+
+            const sourceComponent = new Component(this);
+
+            // bfs starting at source
+            const visited = _.fill(new Array(this.maxId() + 1), false);
+            const wasRankedBefore = _.fill(new Array(this.maxId() + 1), false);
+            const queue = [];
+            let queuePointer = 0;
+            queue.push(source);
+            visited[source.id] = true;
+            while (queuePointer < queue.length) {
+                const node = queue[queuePointer++];
+                sourceComponent.addNode(node.id);
+                if (node.rank === null) {
+                    _.forEach(this.outEdges(node.id), outEdge => {
+                        if (!visited[outEdge.dst]) {
+                            queue.push(this.node(outEdge.dst));
+                            visited[outEdge.dst] = true;
+                        }
+                    });
+                } else {
+                    wasRankedBefore[node.id] = true;
+                }
+            }
+
+            if (DEBUG) {
+                Assert.assertImplies(s > 0, _.some(sourceComponent.nodes(), node => node.rank !== null), 'no common sink');
+            }
+
+            sourceComponent.induceEdges();
+
+            const rankPerNode = _.fill(new Array(this.maxId() + 1), 0);
+            _.forEach(sourceComponent.toposort(), (node: RankNode) => {
+                if (node.rank !== null) {
+                    minDiff = Math.min(minDiff, node.rank - rankPerNode[node.id]);
+                } else {
+                    node.rank = rankPerNode[node.id];
+                    _.forEach(this.outEdges(node.id), outEdge => {
+                        const nextRank = node.rank + outEdge.weight;
+                        if (outEdge.weight === Infinity) {
+                            throw new Error('INFINITE WQEIGHT');
+                        }
+                        rankPerNode[outEdge.dst] = Math.max(rankPerNode[outEdge.dst], nextRank);
+                    });
+                }
+            });
+
+            if (DEBUG) {
+                Assert.assert(minDiff !== Number.POSITIVE_INFINITY, 'minDiff is infinity', sourceComponent);
+            }
+
+            _.forEach(sourceComponent.nodes(), (node: RankNode) => {
+                if (!wasRankedBefore[node.id]) {
+                    node.rank += minDiff;
+                }
+            });
+
+            s++;
+            if (s < sources.length) {
+                // update unranked neighbors
+                _.forEach(sourceComponent.nodes(), (node: RankNode) => {
+                    unrankedNeighbors.delete(node);
+                    _.forEach(this.inEdges(node.id), inEdge => {
+                        const neighbor = this.node(inEdge.src);
+                        if (neighbor.rank === null) {
+                            unrankedNeighbors.add(neighbor);
+                        }
+                    });
+                });
+                // bfs from an arbitrary unranked neighbor upwards to find "connected" source
+                const queue = [];
+                let queuePointer = 0;
+                const visited = _.fill(new Array(this.maxId() + 1), false);
+                const upwardSource = unrankedNeighbors.keys().next().value; // first unranked neighbor
+                visited[upwardSource.id] = true;
+                queue.push(upwardSource);
+                while (queuePointer < queue.length) {
+                    const node = queue[queuePointer++];
+                    const inEdges = this.inEdges(node.id);
+                    if (inEdges.length === 0) {
+                        source = node;
+                        break;
+                    } else {
+                        _.forEach(inEdges, inEdge => {
+                            if (!visited[inEdge.src]) {
+                                queue.push(this.node(inEdge.src));
+                                visited[inEdge.src] = true;
+                            }
+                        });
+                    }
+                }
+            }
+            if (DEBUG) {
+                Assert.assertImplies(s < sources.length, source.rank === null, 'no new source found');
+            }
+        }
+
+        let minRank = Number.POSITIVE_INFINITY;
+        _.forEach(this.nodes(), (node: RankNode) => {
+            if (node.rank === Number.POSITIVE_INFINITY) {
+                throw new Error('I AM DUMB');
+            }
+            if (DEBUG) {
+                Assert.assertNumber(node.rank, 'rank is not a valid number');
+            }
+            minRank = Math.min(minRank, node.rank);
+        });
+        const difference = 0 - minRank;
+        _.forEach(this.nodes(), (node) => {
+            node.rank += difference;
+        });
+    }
+}
diff --git a/src/layouting/rank/rankNode.ts b/src/layouting/rank/rankNode.ts
new file mode 100644
index 00000000..60ff7b3c
--- /dev/null
+++ b/src/layouting/rank/rankNode.ts
@@ -0,0 +1,7 @@
+import Edge from '../graph/edge';
+import Node from '../graph/node';
+import RankGraph from './rankGraph';
+
+export default class RankNode extends Node<RankGraph, Edge<any, any>> {
+    public rank: number = null;
+}
diff --git a/src/layouting/renderGraph/accessNode.ts b/src/layouting/renderGraph/accessNode.ts
new file mode 100644
index 00000000..894d9863
--- /dev/null
+++ b/src/layouting/renderGraph/accessNode.ts
@@ -0,0 +1,5 @@
+import RenderNode from './renderNode';
+
+export default class AccessNode extends RenderNode {
+    // empty
+}
diff --git a/src/layouting/renderGraph/entryNode.ts b/src/layouting/renderGraph/entryNode.ts
new file mode 100644
index 00000000..06184392
--- /dev/null
+++ b/src/layouting/renderGraph/entryNode.ts
@@ -0,0 +1,5 @@
+import ScopeNode from './scopeNode';
+
+export default class EntryNode extends ScopeNode {
+    // empty
+}
diff --git a/src/layouting/renderGraph/exitNode.ts b/src/layouting/renderGraph/exitNode.ts
new file mode 100644
index 00000000..061dc2a7
--- /dev/null
+++ b/src/layouting/renderGraph/exitNode.ts
@@ -0,0 +1,5 @@
+import ScopeNode from './scopeNode';
+
+export default class ExitNode extends ScopeNode {
+    // public
+}
diff --git a/src/layouting/renderGraph/genericContainerNode.ts b/src/layouting/renderGraph/genericContainerNode.ts
new file mode 100644
index 00000000..f7d40b9a
--- /dev/null
+++ b/src/layouting/renderGraph/genericContainerNode.ts
@@ -0,0 +1,5 @@
+import RenderNode from './renderNode';
+
+export default class GenericContainerNode extends RenderNode {
+    public readonly childPadding: number = 30;
+}
diff --git a/src/layouting/renderGraph/genericNode.ts b/src/layouting/renderGraph/genericNode.ts
new file mode 100644
index 00000000..0b6c1356
--- /dev/null
+++ b/src/layouting/renderGraph/genericNode.ts
@@ -0,0 +1,5 @@
+import RenderNode from './renderNode';
+
+export default class GenericNode extends RenderNode {
+    // empty
+}
diff --git a/src/layouting/renderGraph/interstateEdge.ts b/src/layouting/renderGraph/interstateEdge.ts
new file mode 100644
index 00000000..88814022
--- /dev/null
+++ b/src/layouting/renderGraph/interstateEdge.ts
@@ -0,0 +1,7 @@
+import RenderEdge from './renderEdge';
+
+export default class InterstateEdge extends RenderEdge {
+    label(): string {
+        return this.attributes.label || '';
+    }
+}
diff --git a/src/layouting/renderGraph/libraryNode.ts b/src/layouting/renderGraph/libraryNode.ts
new file mode 100644
index 00000000..e0718a80
--- /dev/null
+++ b/src/layouting/renderGraph/libraryNode.ts
@@ -0,0 +1,5 @@
+import RenderNode from './renderNode';
+
+export default class LibraryNode extends RenderNode {
+    // empty
+}
diff --git a/src/layouting/renderGraph/mapEntry.ts b/src/layouting/renderGraph/mapEntry.ts
new file mode 100644
index 00000000..efc9e37d
--- /dev/null
+++ b/src/layouting/renderGraph/mapEntry.ts
@@ -0,0 +1,5 @@
+import EntryNode from './entryNode';
+
+export default class MapEntry extends EntryNode {
+    // empty
+}
diff --git a/src/layouting/renderGraph/mapExit.ts b/src/layouting/renderGraph/mapExit.ts
new file mode 100644
index 00000000..650b051a
--- /dev/null
+++ b/src/layouting/renderGraph/mapExit.ts
@@ -0,0 +1,5 @@
+import ExitNode from './exitNode';
+
+export default class MapExit extends ExitNode {
+    // empty
+}
diff --git a/src/layouting/renderGraph/memlet.ts b/src/layouting/renderGraph/memlet.ts
new file mode 100644
index 00000000..a19ecc31
--- /dev/null
+++ b/src/layouting/renderGraph/memlet.ts
@@ -0,0 +1,20 @@
+import RenderEdge from './renderEdge';
+
+export default class Memlet extends RenderEdge {
+    label(): string {
+        if (!this.attributes.subset) {
+            return '';
+        }
+        let label = this.attributes.data || '';
+        const subset = this.sdfgPropertyToString(this.attributes.subset);
+        label += (subset.length <= 3 ? subset : '[...]');
+        if (this.attributes.other_subset) {
+            const otherSubset = this.sdfgPropertyToString(this.attributes.other_subset);
+            label += ' -> ' + (otherSubset.length <= 3 ? otherSubset : '[...]');
+        }
+        if (this.attributes.wcr) {
+            label += '\n' + 'CR: ' + this.sdfgPropertyToString(this.attributes.wcr);
+        }
+        return label;
+    }
+}
diff --git a/src/layouting/renderGraph/nestedSdfg.ts b/src/layouting/renderGraph/nestedSdfg.ts
new file mode 100644
index 00000000..c36afe68
--- /dev/null
+++ b/src/layouting/renderGraph/nestedSdfg.ts
@@ -0,0 +1,5 @@
+import RenderNode from './renderNode';
+
+export default class NestedSdfg extends RenderNode {
+    public childPadding = 20;
+}
diff --git a/src/layouting/renderGraph/renderConnector.ts b/src/layouting/renderGraph/renderConnector.ts
new file mode 100644
index 00000000..db7a0c94
--- /dev/null
+++ b/src/layouting/renderGraph/renderConnector.ts
@@ -0,0 +1,19 @@
+import { CONNECTOR_SIZE } from '../../utils/constants';
+import RenderNode from './renderNode';
+
+export default class RenderConnector {
+    public name: string;
+    public node: RenderNode;
+
+    public x: number;
+    public y: number;
+    public width: number;
+    public height: number;
+
+    constructor(name: string, node: RenderNode) {
+        this.name = name;
+        this.node = node;
+        this.width = CONNECTOR_SIZE;
+        this.height = CONNECTOR_SIZE;
+    }
+}
diff --git a/src/layouting/renderGraph/renderEdge.ts b/src/layouting/renderGraph/renderEdge.ts
new file mode 100644
index 00000000..0ae4097e
--- /dev/null
+++ b/src/layouting/renderGraph/renderEdge.ts
@@ -0,0 +1,131 @@
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import Edge from '../graph/edge';
+import LayoutEdge from '../layoutGraph/layoutEdge';
+import RenderGraph from './renderGraph';
+import RenderNode from './renderNode';
+import Size from '../geometry/size';
+import Vector from '../geometry/vector';
+
+export default abstract class RenderEdge extends Edge<RenderGraph, RenderNode> {
+    public labelFontSize = 10;
+
+    public srcConnector: string = null;
+    public dstConnector: string = null;
+    public attributes: any = {};
+
+    public x: number = null;
+    public y: number = null;
+    public width: number = null;
+    public height: number = null;
+
+    public labelSize: Size = null;
+    public labelX: number = null;
+    public labelY: number = null;
+
+    public points: Array<Vector> = [];
+
+    public layoutEdge: LayoutEdge = null;
+
+    constructor(src: number, dst: number, srcConnector: string = null, dstConnector: string = null, attributes: any = {}) {
+        super(src, dst);
+        this.srcConnector = srcConnector || null;
+        this.dstConnector = dstConnector || null;
+        this.attributes = attributes;
+    }
+
+    abstract label(): string;
+
+    protected sdfgPropertyToString(property: any): string {
+        if (property === null) {
+            return '';
+        }
+        if (typeof property === 'boolean') {
+            return property ? 'True' : 'False';
+        } else if (property.type === 'Indices' || property.type === 'subsets.Indices') {
+            const indices = property.indices;
+            let preview = '[';
+            for (const index of indices) {
+                preview += this.sdfgPropertyToString(index) + ', ';
+            }
+            return preview.slice(0, -2) + ']';
+        } else if (property.type === 'Range' || property.type === 'subsets.Range') {
+            const ranges = property.ranges;
+
+            // Generate string from range
+            let preview = '[';
+            for (const range of ranges) {
+                preview += this.sdfgRangeToString(range) + ', ';
+            }
+            return preview.slice(0, -2) + ']';
+        } else if (property.language !== undefined) {
+            // Code
+            if (property.string_data !== '' && property.string_data !== undefined && property.string_data !== null) {
+                return '<pre class="code"><code>' + property.string_data.trim() +
+                    '</code></pre><div class="clearfix"></div>';
+            }
+            return '';
+        } else if (property.approx !== undefined && property.main !== undefined) {
+            // SymExpr
+            return property.main;
+        } else if (property.constructor == Object) {
+            // General dictionary
+            return '<pre class="code"><code>' + JSON.stringify(property, undefined, 4) +
+                '</code></pre><div class="clearfix"></div>';
+        } else if (property.constructor == Array) {
+            // General array
+            let result = '[ ';
+            let first = true;
+            for (const subprop of property) {
+                if (!first)
+                    result += ', ';
+                result += this.sdfgPropertyToString(subprop);
+                first = false;
+            }
+            return result + ' ]';
+        } else {
+            return property;
+        }
+    }
+
+    protected sdfgRangeToString(range) {
+        let preview = '';
+        if (range.start == range.end && range.step == 1 && range.tile == 1) {
+            preview += this.sdfgPropertyToString(range.start);
+        } else {
+            const endp1 = this.sdfgPropertyToString(range.end) + ' + 1';
+            // Try to simplify using math.js
+            preview += this.sdfgPropertyToString(range.start) + ':' + endp1;
+
+            if (range.step != 1) {
+                preview += ':' + this.sdfgPropertyToString(range.step);
+                if (range.tile != 1)
+                    preview += ':' + this.sdfgPropertyToString(range.tile);
+            } else if (range.tile != 1) {
+                preview += '::' + this.sdfgPropertyToString(range.tile);
+            }
+        }
+        return preview;
+    }
+
+    updateBoundingBox(): void {
+        let minX = Number.POSITIVE_INFINITY;
+        let maxX = Number.NEGATIVE_INFINITY;
+        let minY = Number.POSITIVE_INFINITY;
+        let maxY = Number.NEGATIVE_INFINITY;
+        _.forEach(this.points, (point: Vector) => {
+            minX = Math.min(minX, point.x);
+            maxX = Math.max(maxX, point.x);
+            minY = Math.min(minY, point.y);
+            maxY = Math.max(maxY, point.y);
+        });
+        this.x = minX;
+        this.y = minY;
+        this.width = maxX - minX;
+        this.height = maxY - minY;
+    }
+
+    boundingBox(): Box {
+        return new Box(this.x, this.y, this.width, this.height);
+    }
+}
diff --git a/src/layouting/renderGraph/renderGraph.ts b/src/layouting/renderGraph/renderGraph.ts
new file mode 100644
index 00000000..3980fa01
--- /dev/null
+++ b/src/layouting/renderGraph/renderGraph.ts
@@ -0,0 +1,43 @@
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import Graph from '../graph/graph';
+import RenderEdge from './renderEdge';
+import RenderNode from './renderNode';
+
+export default class RenderGraph extends Graph<RenderNode, RenderEdge> {
+    public layoutGraph = null;
+
+    boundingBox(): Box {
+        let minX = Number.POSITIVE_INFINITY;
+        let maxX = Number.NEGATIVE_INFINITY;
+        let minY = Number.POSITIVE_INFINITY;
+        let maxY = Number.NEGATIVE_INFINITY;
+        _.forEach(this.nodes(), (node: RenderNode) => {
+            const box = node.boundingBox();
+            minX = Math.min(minX, box.x);
+            maxX = Math.max(maxX, box.x + box.width);
+            minY = Math.min(minY, box.y);
+            maxY = Math.max(maxY, box.y + box.height);
+        });
+        _.forEach(this.edges(), (edge: RenderEdge) => {
+            const box = edge.boundingBox();
+            minX = Math.min(minX, box.x);
+            maxX = Math.max(maxX, box.x + box.width);
+            minY = Math.min(minY, box.y);
+            maxY = Math.max(maxY, box.y + box.height);
+        });
+        return new Box(minX, minY, maxX - minX, maxY - minY);
+    }
+
+    numNodes(): number {
+        return this.allNodes().length;
+    }
+
+    numEdges(): number {
+        return this.allEdges().length;
+    }
+
+    numConnectors(): number {
+        return _.sum(_.map(this.allNodes(), node => node.inConnectors.length + node.outConnectors.length));
+    }
+}
diff --git a/src/layouting/renderGraph/renderNode.ts b/src/layouting/renderGraph/renderNode.ts
new file mode 100644
index 00000000..fd2ef0f6
--- /dev/null
+++ b/src/layouting/renderGraph/renderNode.ts
@@ -0,0 +1,82 @@
+import { CONNECTOR_SIZE, CONNECTOR_SPACING } from '../../utils/constants';
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import LayoutGraph from '../layoutGraph/layoutGraph';
+import LayoutNode from '../layoutGraph/layoutNode';
+import Node from '../graph/node';
+import RenderConnector from './renderConnector';
+import RenderEdge from './renderEdge';
+import RenderGraph from './renderGraph';
+import Size from '../geometry/size';
+
+export default abstract class RenderNode extends Node<RenderGraph, RenderEdge> {
+    public readonly childPadding: number = 0;
+    public readonly labelPaddingX: number = 10;
+    public readonly labelPaddingY: number = 10;
+    public readonly labelFontSize: number = 12;
+    public readonly connectorPadding: number = 10;
+
+    public id: number = null;
+    public graph: RenderGraph = null;
+    public inConnectors: Array<RenderConnector> = [];
+    public outConnectors: Array<RenderConnector> = [];
+    public scopeEntry: number = null;
+
+    public layoutGraph: LayoutGraph = null;
+    public layoutNode: LayoutNode = null;
+
+    public x: number = null;
+    public y: number = null;
+    public width = 0;
+    public height = 0;
+
+    public color: number;
+
+    protected _type: string = null;
+
+    constructor(type: string, label = '', color = 0x000000) {
+        super(label);
+        this._type = type;
+        this.color = color;
+    }
+
+    type(): string {
+        return this._type;
+    }
+
+    updateSize(minimumSize: Size): void {
+        this.width = Math.max(this.width, minimumSize.width);
+        this.height = Math.max(this.height, minimumSize.height);
+    }
+
+    setConnectors(inConnectors: Array<string>, outConnectors: Array<string>): void {
+        _.forEach(inConnectors, (name: string) => {
+            this.inConnectors.push(new RenderConnector(name.toString(), this));
+        });
+        _.forEach(outConnectors, (name: string) => {
+            this.outConnectors.push(new RenderConnector(name.toString(), this));
+        });
+
+        // update width
+        this.width = Math.max(this.width, this.connectorsWidth());
+    }
+
+    size(): Size {
+        return {
+            width: this.width,
+            height: this.height,
+        };
+    }
+
+    boundingBox(): Box {
+        return new Box(this.x, this.y, this.width, this.height);
+    }
+
+    /**
+     * Calculates the width to fit both the in-connectors and out-connectors including some padding.
+     */
+    connectorsWidth(): number {
+        const numConnectors = Math.max(this.inConnectors.length, this.outConnectors.length);
+        return numConnectors * (CONNECTOR_SIZE + CONNECTOR_SPACING) - CONNECTOR_SPACING + 2 * this.connectorPadding;
+    }
+}
diff --git a/src/layouting/renderGraph/scopeNode.ts b/src/layouting/renderGraph/scopeNode.ts
new file mode 100644
index 00000000..4cd6bfb3
--- /dev/null
+++ b/src/layouting/renderGraph/scopeNode.ts
@@ -0,0 +1,6 @@
+import RenderNode from './renderNode';
+
+export default abstract class ScopeNode extends RenderNode {
+    public labelPaddingX = 30;
+    public connectorPadding = 40;
+}
diff --git a/src/layouting/renderGraph/sdfgState.ts b/src/layouting/renderGraph/sdfgState.ts
new file mode 100644
index 00000000..0778a8a3
--- /dev/null
+++ b/src/layouting/renderGraph/sdfgState.ts
@@ -0,0 +1,7 @@
+import RenderNode from './renderNode';
+
+export default class SdfgState extends RenderNode {
+    public childPadding = 30;
+    public labelPaddingX = 5;
+    public labelPaddingY = 5;
+}
diff --git a/src/layouting/renderGraph/tasklet.ts b/src/layouting/renderGraph/tasklet.ts
new file mode 100644
index 00000000..e82e21f4
--- /dev/null
+++ b/src/layouting/renderGraph/tasklet.ts
@@ -0,0 +1,5 @@
+import RenderNode from './renderNode';
+
+export default class Tasklet extends RenderNode {
+    public connectorPadding = 17;
+}
diff --git a/src/layouting/renderLib.js b/src/layouting/renderLib.js
new file mode 100644
index 00000000..3fbebd64
--- /dev/null
+++ b/src/layouting/renderLib.js
@@ -0,0 +1,7 @@
+module.exports = {
+    layouter: {
+        DagreLayouter: require('./layouter/dagreLayouter').default,
+        SugiyamaLayouter: require('./layouter/sugiyamaLayouter').default,
+        MagneticSpringLayouter: require('./layouter/magneticSpringLayouter').default,
+    },
+};
diff --git a/src/layouting/renderer/color.ts b/src/layouting/renderer/color.ts
new file mode 100644
index 00000000..30187c8c
--- /dev/null
+++ b/src/layouting/renderer/color.ts
@@ -0,0 +1,25 @@
+export default class Color {
+    public static WHITE = new Color(255, 255, 255);
+    public static BLACK = new Color(0, 0, 0);
+    public static TRANSPARENT = new Color(0, 0, 0, 0);
+
+    public red: number;
+    public green: number;
+    public blue: number;
+    public alpha = 1;
+
+    constructor(red: number, green: number, blue: number, alpha = 1) {
+        this.red = red;
+        this.green = green;
+        this.blue = blue;
+        this.alpha = alpha;
+    }
+
+    hex(): number {
+        return 65536 * this.red + 256 * this.green + this.blue;
+    }
+
+    fade(alpha: number): Color {
+        return new Color(this.red, this.green, this.blue, alpha);
+    }
+}
diff --git a/src/layouting/renderer/renderer.ts b/src/layouting/renderer/renderer.ts
new file mode 100644
index 00000000..5b8171fd
--- /dev/null
+++ b/src/layouting/renderer/renderer.ts
@@ -0,0 +1,420 @@
+import {Container, Graphics} from 'pixi.js';
+import {Viewport} from 'pixi-viewport';
+import * as _ from 'lodash';
+import * as PIXI from 'pixi.js';
+import AccessNode from '../renderGraph/accessNode';
+import Box from '../geometry/box';
+import Color from './color';
+import DagreLayouter from '../layouter/dagreLayouter';
+import DownwardTrapezoid from '../shapes/downwardTrapezoid';
+import EdgeShape from '../shapes/edgeShape';
+import Ellipse from '../shapes/ellipse';
+import FoldedCornerRectangle from '../shapes/foldedCornerRectangle';
+import GenericContainerNode from '../renderGraph/genericContainerNode';
+import GenericNode from '../renderGraph/genericNode';
+import Layouter from '../layouter/layouter';
+import Loader from '../parse/loader';
+import LayoutAnalysis from '../bench/layoutAnalysis';
+import Memlet from '../renderGraph/memlet';
+import Octagon from '../shapes/octagon';
+import Rectangle from '../shapes/rectangle';
+import RenderEdge from '../renderGraph/renderEdge';
+import RenderGraph from '../renderGraph/renderGraph';
+import RenderNode from '../renderGraph/renderNode';
+import RenderConnector from '../renderGraph/renderConnector';
+import Shape from '../shapes/shape';
+import Size from '../geometry/size';
+import Tasklet from '../renderGraph/tasklet';
+import Text from '../shapes/text';
+import Timer from '../util/timer';
+import UpwardTrapezoid from '../shapes/upwardTrapezoid';
+import Vector from '../geometry/vector';
+
+export default class Renderer {
+    private readonly _app;
+    private readonly _viewport;
+    private readonly _container;
+
+    constructor(domContainer, coordinateContainer = null) {
+        this._app = new PIXI.Application({
+            width: domContainer.clientWidth,
+            height: domContainer.clientHeight,
+            antialias: true,
+        });
+        this._app.renderer.backgroundColor = 0xFFFFFF;
+        domContainer.appendChild(this._app.view);
+
+        this._viewport = new Viewport({
+            screenWidth: domContainer.clientWidth,
+            screenHeight: domContainer.clientHeight,
+            worldWidth: domContainer.clientWidth,
+            worldHeight: domContainer.clientHeight,
+            interaction: this._app.renderer.plugins.interaction, // the interaction module is important for wheel to work properly when renderer.view is placed or scaled
+        });
+        this._app.stage.addChild(this._viewport);
+
+        this._container = new Container();
+        this._viewport.addChild(this._container);
+
+        const showCoordinates = (title, point) => {
+            coordinateContainer.innerHTML = title + ': ' + point.x.toFixed(0) + ' / ' + point.y.toFixed(0);
+        };
+
+        if (coordinateContainer !== null) {
+            this._viewport.interactive = true;
+            this._viewport.on('mousemove', _.throttle((e) => {
+                const mousePos = e.data.getLocalPosition(this._viewport);
+                showCoordinates('mouse', mousePos);
+            }, 10));
+
+            showCoordinates('center', this._viewport.center);
+        }
+
+        this._viewport.drag().pinch().wheel().decelerate();
+
+        document.addEventListener('keydown', (e) => {
+            if (e.ctrlKey && e.key === 's') {
+                e.preventDefault();
+                this.savePng('screenshot.png');
+            }
+        });
+    }
+
+    show(layouter: Layouter, name: string): void {
+        Loader.load(name).then((graph: RenderGraph) => {
+            // set node sizes
+            _.forEach(graph.allNodes(), (node: RenderNode) => {
+                node.updateSize(this._labelSize(node));
+            });
+            // set edge label sizes
+            _.forEach(graph.allEdges(), (edge: RenderEdge) => {
+                edge.labelSize = this._edgeLabelSize(edge);
+            });
+
+            const layout = layouter.layout(graph);
+
+            const layoutAnalysis = new LayoutAnalysis(layout);
+            if (layoutAnalysis.validate()) {
+                console.log('Layout satisfies constraints.');
+            } else {
+                console.log('Layout violates constraints.');
+            }
+            console.log('Weighted cost: ' + layoutAnalysis.cost(true).toFixed(0));
+            /*const performanceAnalysis = new PerformanceAnalysis(layouter);
+            performanceAnalysis.measure(name, 1).then(time => {
+                console.log(time + " ms");
+            });*/
+
+            // center and fit the graph in the viewport
+            const box = graph.boundingBox();
+            //console.log("Total size: " + box.width.toFixed(0) + "x" + box.height.toFixed(0));
+            //console.log("Segment crossings: " + layoutAnalysis.segmentCrossings());
+
+            //Timer.printTimes();
+
+            this.render(graph);
+        });
+    }
+
+    drawSimpleGraph(nodes: Array<[number, number, number?]>,
+        heavyEdges: Array<[[number, number], [number, number], number?]>,
+        lightEdges: Array<[[number, number], [number, number], number?]>,
+        dashedLines: Array<[number, number, number]> = []): void {
+        const GRID = 40;
+        const NODE = 12;
+        _.forEach(dashedLines, (line: [number, number, number]) => {
+            const y = GRID * line[0];
+            const x0 = GRID * line[1];
+            const x1 = GRID * line[2];
+            for (let x = x0; x < x1; x += 3) {
+                const circle = new PIXI.Graphics();
+                circle.beginFill(0x999999);
+                circle.drawCircle(x, y, 1);
+                circle.endFill();
+                this._container.addChild(circle);
+            }
+        });
+        _.forEach(heavyEdges, (edge: [[number, number], [number, number], number?]) => {
+            const line = new PIXI.Graphics();
+            line.lineStyle(3, edge[2] || 0);
+            line.moveTo(GRID * edge[0][0], GRID * edge[0][1]);
+            line.lineTo(GRID * edge[1][0], GRID * edge[1][1]);
+            this._container.addChild(line);
+        });
+        _.forEach(lightEdges, (edge: [[number, number], [number, number], number?]) => {
+            const line = new PIXI.Graphics();
+            line.lineStyle(1, edge[2] || 0);
+            line.moveTo(GRID * edge[0][0], GRID * edge[0][1]);
+            line.lineTo(GRID * edge[1][0], GRID * edge[1][1]);
+            this._container.addChild(line);
+        });
+        _.forEach(nodes, (node: [number, number, number?]) => {
+            const circle = new PIXI.Graphics();
+            circle.beginFill(node[2] || 0);
+            circle.drawCircle(GRID * node[0], GRID * node[1], NODE / 2);
+            circle.endFill();
+            this._container.addChild(circle);
+        });
+    }
+
+    /**
+     * Adapted from https://www.html5gamedevs.com/topic/31190-saving-pixi-content-to-image/.
+     */
+    savePng(fileName): void {
+        this._app.renderer.extract.canvas(this._viewport.children[0]).toBlob((b) => {
+            const a = document.createElement('a');
+            document.body.append(a);
+            a.download = fileName;
+            a.href = URL.createObjectURL(b);
+            a.click();
+            a.remove();
+        }, 'image/png');
+    }
+
+    renderLive(): void {
+        let prevStoredGraph = null;
+        const layouter = new DagreLayouter();
+
+        const addSubgraph = (parent, obj) => {
+            _.forEach(obj.nodes, (nodeObj, id) => {
+                if (nodeObj.child !== null) {
+                    const node = new GenericContainerNode('GenericContainerNode');
+                    node.setLabel(nodeObj.label || '');
+                    node.updateSize(this._labelSize(node));
+                    parent.addNode(node, id);
+                    const childGraph = new RenderGraph();
+                    node.setChildGraph(childGraph);
+                    addSubgraph(node.childGraph, nodeObj.child);
+                } else {
+                    const node = new GenericNode('GenericNode');
+                    node.setLabel(nodeObj.label || '');
+                    node.updateSize(this._labelSize(node));
+                    parent.addNode(node, id);
+                }
+            });
+            _.forEach(obj.edges, edgeObj => {
+                parent.addEdge(new Memlet(edgeObj.src, edgeObj.dst));
+            });
+        };
+
+        const doRender = () => {
+            const storedGraph = window.localStorage.getItem('storedGraph');
+            if (storedGraph !== prevStoredGraph && storedGraph !== null) {
+                prevStoredGraph = storedGraph;
+                const renderGraph = new RenderGraph();
+                addSubgraph(renderGraph, JSON.parse(storedGraph));
+                layouter.layout(renderGraph);
+                this.render(renderGraph);
+            }
+            setTimeout(doRender, 3000);
+        };
+        doRender();
+    }
+
+    renderOrderGraph(step = 0, resetView = false): void {
+        const renderGraph = new RenderGraph();
+        let y = 0;
+        const stepObj = JSON.parse(window.localStorage.getItem('orderGraph'))[step];
+        console.log(stepObj);
+        const nodeMap = new Map();
+        const groupsPerRank = [];
+        const widths = [];
+        _.forEach(stepObj.ranks, rank => {
+            const rankY = y;
+            let x = 0;
+            const groups = [];
+            _.forEach(rank, group => {
+                y = rankY;
+                const groupNode = new GenericContainerNode('GenericContainerNode', group.label || '');
+                const groupGraph = new RenderGraph();
+                groupNode.setChildGraph(groupGraph);
+                groupNode.x = x;
+                groupNode.y = y;
+                x += groupNode.childPadding;
+                y += groupNode.childPadding;
+                let groupHeight = 0;
+                _.forEach(group.nodes, (nodeObj: any) => {
+                    const node = new GenericNode('GenericNode', nodeObj.label.toString() || '', nodeObj.isVirtual ? 0xCCCCCC : 0x000000); // might use nodeObj.id.toString() instead of nodeObj.label
+                    groupGraph.addNode(node, parseInt(nodeObj.id));
+                    nodeMap.set(node.id, node);
+                    node.x = x;
+                    node.y = y;
+                    const size = this._labelSize(node);
+                    node.width = size.width;
+                    node.height = size.height;
+                    x += node.width + 30;
+                    groupHeight = Math.max(groupHeight, node.height);
+                });
+                x -= 30;
+                x += groupNode.childPadding;
+                y += groupHeight + groupNode.childPadding;
+                groupNode.width = x - groupNode.x;
+                groupNode.height = y - groupNode.y;
+                x += 50;
+                renderGraph.addNode(groupNode);
+                groups.push(groupNode);
+            });
+            x -= 50;
+            widths.push(x);
+            y += 50;
+            groupsPerRank.push(groups);
+        });
+        const maxWidth = _.max(widths);
+        _.forEach(widths, (width: number, r: number) => {
+            const offset = (maxWidth - width) / 2;
+            _.forEach(groupsPerRank[r], (group: RenderNode) => {
+                group.x += offset;
+                _.forEach(group.childGraph.nodes(), (node: RenderNode) => {
+                    node.x += offset;
+                });
+            });
+        });
+        this.render(renderGraph, resetView ? 'auto' : null);
+        _.forEach(stepObj.edges, (edgeObj: any) => {
+            const srcNode = nodeMap.get(edgeObj.src);
+            if (srcNode === undefined) {
+                console.log(edgeObj.src);
+            }
+            const srcPos = srcNode.boundingBox().bottomCenter();
+            const dstNode = nodeMap.get(edgeObj.dst);
+            const dstPos = dstNode.boundingBox().topCenter();
+            const line = new Graphics();
+            const weight = (edgeObj.weight === 'INFINITY' ? Number.POSITIVE_INFINITY : parseInt(edgeObj.weight));
+            line.lineStyle(Math.min(weight, 4));
+            line.moveTo(srcPos.x, srcPos.y);
+            line.lineTo(dstPos.x, dstPos.y);
+            this._container.addChild(line);
+        });
+    }
+
+    /**
+     * Shows a graph in the designated container.
+     * @param graph Graph with layout information for all nodes and edges (x, y, width, height).
+     * @param view = {centerX: number, centerY: number, zoom: number}
+     */
+    render(graph: RenderGraph, view: any = 'auto'): void {
+        this._container.removeChildren();
+
+        if (view !== null) {
+            if (view === 'auto') {
+                const box = graph.boundingBox();
+                this._viewport.moveCenter((box.width - this._viewport.width) / 2, (box.height - this._viewport.width) / 2);
+                this._viewport.setZoom(Math.min(1, this._viewport.worldWidth / box.width, this._viewport.worldHeight / box.height), true);
+            } else {
+                this._viewport.moveCenter(view.centerX, view.centerY);
+                this._viewport.setZoom(view.zoom, true);
+            }
+        }
+
+        const shapes = this._getShapesForGraph(graph);
+        _.forEach(shapes, (shape: Shape) => {
+            shape.render(this._container);
+        });
+    }
+
+    private _labelSize(node: RenderNode): Size {
+        const textBox = (new Text(0, 0, node.label(), node.labelFontSize)).boundingBox();
+        return {
+            width: textBox.width + 2 * node.labelPaddingX,
+            height: textBox.height + 2 * node.labelPaddingY,
+        };
+    }
+
+    private _edgeLabelSize(edge: RenderEdge): Size {
+        return (new Text(0, 0, edge.label(), edge.labelFontSize)).boundingBox().size();
+    }
+
+    /**
+     * Adds an offset to center the label within the node (if necessary).
+     */
+    private _labelPosition(node: RenderNode): Vector {
+        const labelSize = this._labelSize(node);
+        const labelBox = new Box(
+            node.x + node.labelPaddingX,
+            node.y + node.labelPaddingY,
+            labelSize.width,
+            labelSize.height,
+        );
+        return labelBox.centerIn(node.boundingBox()).topLeft();
+    }
+
+    private _getShapesForGraph(graph: RenderGraph): Array<Shape> {
+        const shapes = [];
+        _.forEach(graph.nodes(), (node: RenderNode) => {
+            _.forEach(this._getShapesForNode(node), shape => shapes.push(shape));
+        });
+        _.forEach(graph.edges(), (edge: RenderEdge) => {
+            _.forEach(this._getShapesForEdge(edge), shape => shapes.push(shape));
+        });
+        return shapes;
+    }
+
+    private _getShapesForNode(node: RenderNode): Array<Shape> {
+        const shapes = [];
+        switch (node.type()) {
+            case 'AccessNode':
+            case 'GenericNode':
+                shapes.push(new Ellipse(node, node.x, node.y, node.width, node.height, 0xFFFFFF, node.color || 0x000000));
+                shapes.push(new Text(this._labelPosition(node).x, this._labelPosition(node).y, node.label()));
+                break;
+            case 'LibraryNode':
+                shapes.push(new FoldedCornerRectangle(this, node.x, node.y, node.width, node.height));
+                shapes.push(new Text(this._labelPosition(node).x, this._labelPosition(node).y, node.label()));
+                break;
+            case 'NestedSDFG':
+                shapes.push(new Rectangle(node, node.x, node.y, node.width, node.height));
+                break;
+            case 'SDFGState':
+                const color = new Color(0xDE, 0xEB, 0xF7);
+                shapes.push(new Rectangle(node, node.x, node.y, node.width, node.height, color, color));
+                shapes.push(new Text(node.x + 5, node.y + 5, node.label()));
+                break;
+            case 'Tasklet':
+                shapes.push(new Octagon(node, node.x, node.y, node.width, node.height));
+                shapes.push(new Text(this._labelPosition(node).x, this._labelPosition(node).y, node.label()));
+                break;
+            case 'GenericContainerNode':
+                shapes.push(new Rectangle(node, node.x, node.y, node.width, node.height));
+                shapes.push(new Text(node.x + 5, node.y + 5, node.label()));
+                break;
+        }
+        if (node.type().endsWith('Entry')) {
+            shapes.push(new UpwardTrapezoid(node, node.x, node.y, node.width, node.height));
+            shapes.push(new Text(this._labelPosition(node).x, this._labelPosition(node).y, node.label()));
+        }
+        if (node.type().endsWith('Exit')) {
+            shapes.push(new DownwardTrapezoid(node, node.x, node.y, node.width, node.height));
+            shapes.push(new Text(this._labelPosition(node).x, this._labelPosition(node).y, node.label()));
+        }
+
+        // add child graph shapes
+        if (node.childGraph !== null) {
+            _.forEach(this._getShapesForGraph(node.childGraph), (shape: Shape) => {
+                shapes.push(shape);
+            });
+        }
+
+        // add connector shapes
+        _.forEach(node.inConnectors, (connector: RenderConnector) => {
+            shapes.push(new Ellipse(connector, connector.x, connector.y, connector.width, connector.height));
+        });
+        _.forEach(node.outConnectors, (connector: RenderConnector) => {
+            shapes.push(new Ellipse(connector, connector.x, connector.y, connector.width, connector.height));
+        });
+
+        return shapes;
+    }
+
+    private _getShapesForEdge(edge: RenderEdge): Array<Shape> {
+        const color = (edge instanceof Memlet ? Color.BLACK : new Color(0xBE, 0xCB, 0xD7));
+        const shapes: Array<Shape> = [new EdgeShape(edge, _.clone(edge.points), color)];
+        if (edge.labelX) {
+            const labelSize = this._edgeLabelSize(edge);
+            const labelBackground = new Rectangle(null, edge.labelX - 3, edge.labelY - 3, labelSize.width + 6, labelSize.height + 6, Color.WHITE.fade(0.8), Color.TRANSPARENT);
+            labelBackground.zIndex = 2;
+            shapes.push(labelBackground);
+            shapes.push(new Text(edge.labelX, edge.labelY, edge.label(), edge.labelFontSize, 0x666666));
+        }
+        return shapes;
+    }
+}
diff --git a/src/layouting/shapes/downwardTrapezoid.ts b/src/layouting/shapes/downwardTrapezoid.ts
new file mode 100644
index 00000000..09a785bb
--- /dev/null
+++ b/src/layouting/shapes/downwardTrapezoid.ts
@@ -0,0 +1,12 @@
+import Polygon from './polygon';
+
+export default class DownwardTrapezoid extends Polygon {
+    getPath(): Array<number> {
+        return [
+            this._x, this._y,
+            this._x + this._width, this._y,
+            this._x + this._width - this._height, this._y + this._height,
+            this._x + this._height, this._y + this._height,
+        ];
+    }
+}
diff --git a/src/layouting/shapes/edgeShape.ts b/src/layouting/shapes/edgeShape.ts
new file mode 100644
index 00000000..64fd762c
--- /dev/null
+++ b/src/layouting/shapes/edgeShape.ts
@@ -0,0 +1,79 @@
+import * as _ from 'lodash';
+import {Graphics} from 'pixi.js';
+import Box from '../geometry/box';
+import Color from '../renderer/color';
+import Vector from '../geometry/vector';
+import Shape from './shape';
+
+export default class EdgeShape extends Shape {
+    private _points: Array<Vector>;
+    private _color: Color;
+
+    constructor(reference: object, points: Array<Vector>, color: Color = new Color(0, 0, 0)) {
+        super(reference, 0, 0);
+        this._points = _.cloneDeep(points);
+        this._color = color;
+    }
+
+    boundingBox(): Box {
+        let minX = Number.POSITIVE_INFINITY;
+        let maxX = Number.NEGATIVE_INFINITY;
+        let minY = Number.POSITIVE_INFINITY;
+        let maxY = Number.NEGATIVE_INFINITY;
+        _.forEach(this._points, (point: Vector) => {
+            minX = Math.min(minX, point.x);
+            maxX = Math.max(maxX, point.x);
+            minY = Math.min(minY, point.y);
+            maxY = Math.max(maxY, point.y);
+        });
+        return new Box(minX, minY, maxX - minX, maxY - minY);
+    }
+
+    render(container: PIXI.Container): void {
+        const line = new Graphics();
+        line.lineStyle(1, this._color.hex(), this._color.alpha);
+        line.moveTo(_.head(this._points).x, _.head(this._points).y);
+        _.forEach(_.tail(this._points), (point: Vector) => {
+            line.lineTo(point.x, point.y);
+        });
+        // draw arrow head
+        const end = new Vector(_.last(this._points).x, _.last(this._points).y);
+        const dir = end.clone().sub(this._points[this._points.length - 2]);
+        const angle = dir.angle();
+        const point1 = (new Vector(end.x - 5, end.y + 3)).rotateAround(end, angle);
+        line.lineTo(point1.x, point1.y);
+        line.moveTo(end.x, end.y);
+        const point2 = (new Vector(end.x - 5, end.y - 3)).rotateAround(end, angle);
+        line.lineTo(point2.x, point2.y);
+        line.zIndex = -1;
+        container.addChild(line);
+    }
+
+    clone(): Shape {
+        const clone = <EdgeShape>super.clone();
+        clone.clear();
+        _.forEach(this._points, (point) => {
+            clone.addPoint(_.clone(point));
+        });
+        return clone;
+    }
+
+    clear(): void {
+        this._points = [];
+    }
+
+    addPoint(point: Vector): void {
+        this._points.push(_.clone(point));
+    }
+
+    points(): Array<Vector> {
+        return _.cloneDeep(this._points);
+    }
+
+    offset(x: number, y: number): void {
+        _.forEach(this._points, (point: Vector) => {
+            point.x += x;
+            point.y += y;
+        });
+    }
+}
diff --git a/src/layouting/shapes/ellipse.ts b/src/layouting/shapes/ellipse.ts
new file mode 100644
index 00000000..df3890dc
--- /dev/null
+++ b/src/layouting/shapes/ellipse.ts
@@ -0,0 +1,24 @@
+import * as PIXI from 'pixi.js';
+import SimpleShape from './simpleShape';
+
+export default class Ellipse extends SimpleShape {
+    private readonly _backgroundColor: number;
+    private readonly _borderColor: number;
+
+    constructor(reference: object, x: number, y: number, width: number, height: number, backgroundColor = 0xFFFFFF, borderColor = 0x000000) {
+        super(reference, x, y, width, height);
+        this._backgroundColor = backgroundColor;
+        this._borderColor = borderColor;
+    }
+
+    render(container: PIXI.Container): void {
+        const ellipse = new PIXI.Graphics();
+        ellipse.lineStyle(1, this._borderColor, 1);
+        ellipse.beginFill(this._backgroundColor);
+        const box = this.boundingBox();
+        const center = box.center();
+        ellipse.drawEllipse(center.x, center.y, this._width / 2, this._height / 2);
+        ellipse.endFill();
+        container.addChild(ellipse);
+    }
+}
diff --git a/src/layouting/shapes/foldedCornerRectangle.ts b/src/layouting/shapes/foldedCornerRectangle.ts
new file mode 100644
index 00000000..52c9ebf0
--- /dev/null
+++ b/src/layouting/shapes/foldedCornerRectangle.ts
@@ -0,0 +1,41 @@
+import * as PIXI from 'pixi.js';
+import SimpleShape from './simpleShape';
+
+export default class FoldedCornerRectangle extends SimpleShape {
+    private readonly _backgroundColor: number;
+    private readonly _borderColor: number;
+
+    constructor(reference: object, x: number, y: number, width: number, height: number, backgroundColor = 0xFFFFFF, borderColor = 0x000000) {
+        super(reference, x, y, width, height);
+        this._backgroundColor = backgroundColor;
+        this._borderColor = borderColor;
+    }
+
+    render(container: PIXI.Container): void {
+        const cornerLength = this._height / 6;
+
+        const rectangle = new PIXI.Graphics();
+        rectangle.lineStyle(1, this._borderColor, 1);
+        rectangle.beginFill(this._backgroundColor);
+        rectangle.drawPolygon([
+            this._x, this._y,
+            this._x, this._y + this._height,
+            this._x + this._width, this._y + this._height,
+            this._x + this._width, this._y + cornerLength,
+            this._x + this._width - cornerLength, this._y,
+        ]);
+        rectangle.endFill();
+        container.addChild(rectangle);
+
+        const triangle = new PIXI.Graphics();
+        triangle.lineStyle(1, this._borderColor, 1);
+        triangle.beginFill(this._backgroundColor);
+        triangle.drawPolygon([
+            this._x + this._width - cornerLength, this._y,
+            this._x + this._width - cornerLength, this._y + cornerLength,
+            this._x + this._width, this._y + cornerLength,
+        ]);
+        triangle.endFill();
+        container.addChild(triangle);
+    }
+}
diff --git a/src/layouting/shapes/octagon.ts b/src/layouting/shapes/octagon.ts
new file mode 100644
index 00000000..f7d5abc5
--- /dev/null
+++ b/src/layouting/shapes/octagon.ts
@@ -0,0 +1,17 @@
+import Polygon from './polygon';
+
+export default class Octagon extends Polygon {
+    getPath(): Array<number> {
+        const octSeg = this._height / 3.0;
+        return [
+            this._x, this._y + octSeg,
+            this._x + octSeg, this._y,
+            this._x + this._width - octSeg, this._y,
+            this._x + this._width, this._y + octSeg,
+            this._x + this._width, this._y + 2 * octSeg,
+            this._x + this._width - octSeg, this._y + this._height,
+            this._x + octSeg, this._y + this._height,
+            this._x, this._y + 2 * octSeg,
+        ];
+    }
+}
diff --git a/src/layouting/shapes/polygon.ts b/src/layouting/shapes/polygon.ts
new file mode 100644
index 00000000..6efc3f23
--- /dev/null
+++ b/src/layouting/shapes/polygon.ts
@@ -0,0 +1,24 @@
+import * as PIXI from 'pixi.js';
+import SimpleShape from './simpleShape';
+
+export default abstract class Polygon extends SimpleShape {
+    private readonly _backgroundColor: number;
+    private readonly _borderColor: number;
+
+    constructor(reference: object, x: number, y: number, width: number, height: number, backgroundColor = 0xFFFFFF, borderColor = 0x000000) {
+        super(reference, x, y, width, height);
+        this._backgroundColor = backgroundColor;
+        this._borderColor = borderColor;
+    }
+
+    abstract getPath(): Array<number>;
+
+    render(container: PIXI.Container): void {
+        const polygon = new PIXI.Graphics();
+        polygon.lineStyle(1, this._borderColor, 1);
+        polygon.beginFill(this._backgroundColor);
+        polygon.drawPolygon(this.getPath());
+        polygon.endFill();
+        container.addChild(polygon);
+    }
+}
diff --git a/src/layouting/shapes/rectangle.ts b/src/layouting/shapes/rectangle.ts
new file mode 100644
index 00000000..49e482b4
--- /dev/null
+++ b/src/layouting/shapes/rectangle.ts
@@ -0,0 +1,30 @@
+import {Container, Graphics} from 'pixi.js';
+import Color from '../renderer/color';
+import SimpleShape from './simpleShape';
+
+export default class Rectangle extends SimpleShape {
+    zIndex = null;
+
+    private readonly _backgroundColor: Color;
+    private readonly _borderColor: Color;
+
+    constructor(reference: object, x: number, y: number, width: number, height: number, backgroundColor = new Color(255, 255, 255), borderColor = new Color(0, 0, 0)) {
+        super(reference, x, y, width, height);
+        this._backgroundColor = backgroundColor;
+        this._borderColor = borderColor;
+    }
+
+    render(container: Container): void {
+        const rectangle = new Graphics();
+        rectangle.lineStyle(1, this._borderColor.hex(), this._borderColor.alpha);
+        rectangle.beginFill(this._backgroundColor.hex(), this._backgroundColor.alpha);
+        rectangle.drawRect(0, 0, this._width, this._height);
+        rectangle.endFill();
+        rectangle.x = this._x;
+        rectangle.y = this._y;
+        if (this.zIndex !== null) {
+            rectangle.zIndex = this.zIndex;
+        }
+        container.addChild(rectangle);
+    }
+}
\ No newline at end of file
diff --git a/src/layouting/shapes/shape.ts b/src/layouting/shapes/shape.ts
new file mode 100644
index 00000000..7147e48e
--- /dev/null
+++ b/src/layouting/shapes/shape.ts
@@ -0,0 +1,39 @@
+import * as _ from 'lodash';
+import Box from '../geometry/box';
+import Vector from '../geometry/vector';
+
+export default abstract class Shape {
+    public reference = null;
+
+    protected _x = 0;
+    protected _y = 0;
+
+    protected constructor(reference: object, x: number, y: number) {
+        this.reference = reference;
+        this._x = x;
+        this._y = y;
+    }
+
+    offset(x: number, y: number): void {
+        this._x += x;
+        this._y += y;
+    }
+
+    position(): Vector {
+        return new Vector(this._x, this._y);
+    }
+
+    clone(): Shape {
+        const clone = new (this.constructor as { new() })();
+        _.assign(clone, <Shape>this);
+        return clone;
+    }
+
+    intersects(otherShape: Shape) {
+        return this.boundingBox().intersects(otherShape.boundingBox());
+    }
+
+    abstract boundingBox(): Box;
+
+    abstract render(container: any): void;
+}
diff --git a/src/layouting/shapes/simpleShape.ts b/src/layouting/shapes/simpleShape.ts
new file mode 100644
index 00000000..fd33b977
--- /dev/null
+++ b/src/layouting/shapes/simpleShape.ts
@@ -0,0 +1,25 @@
+import Box from '../geometry/box';
+import EdgeShape from './edgeShape';
+import Shape from './shape';
+
+export default abstract class SimpleShape extends Shape {
+    protected _width: number;
+    protected _height: number;
+
+    protected constructor(reference: object, x: number, y: number, width: number, height: number) {
+        super(reference, x, y);
+        this._width = width;
+        this._height = height;
+    }
+
+    intersects(otherShape: Shape): boolean {
+        if (otherShape instanceof EdgeShape) {
+            return otherShape.intersects(this);
+        }
+        return super.intersects(otherShape);
+    }
+
+    boundingBox(): Box {
+        return new Box(this._x, this._y, this._width, this._height);
+    }
+}
diff --git a/src/layouting/shapes/text.ts b/src/layouting/shapes/text.ts
new file mode 100644
index 00000000..a4192488
--- /dev/null
+++ b/src/layouting/shapes/text.ts
@@ -0,0 +1,27 @@
+import * as PIXI from 'pixi.js';
+import Shape from './shape';
+import SimpleShape from './simpleShape';
+
+export default class Text extends SimpleShape {
+    private readonly _text;
+    private readonly _fontStyle;
+
+    constructor(x: number, y: number, text, fontSize = 12, color = 0x000000) {
+        const fontStyle = new PIXI.TextStyle({fontFamily: 'Arial', fontSize: fontSize, fill: color});
+        const metrics = PIXI.TextMetrics.measureText(text, fontStyle);
+        super(null, x, y, metrics.width, metrics.height);
+        this._text = text;
+        this._fontStyle = fontStyle;
+    }
+
+    render(group): void {
+        const pixiText = new PIXI.Text(this._text, this._fontStyle);
+        pixiText.x = this._x;
+        pixiText.y = this._y;
+        group.addChild(pixiText);
+    }
+
+    clone(): Shape {
+        return new Text(this._x, this._y, this._text, this._fontStyle.fontSize, this._fontStyle.fill);
+    }
+}
diff --git a/src/layouting/shapes/upwardTrapezoid.ts b/src/layouting/shapes/upwardTrapezoid.ts
new file mode 100644
index 00000000..3278bb77
--- /dev/null
+++ b/src/layouting/shapes/upwardTrapezoid.ts
@@ -0,0 +1,12 @@
+import Polygon from './polygon';
+
+export default class UpwardTrapezoid extends Polygon {
+    getPath(): Array<number> {
+        return [
+            this._x, this._y + this._height,
+            this._x + this._width, this._y + this._height,
+            this._x + this._width - this._height, this._y,
+            this._x + this._height, this._y,
+        ];
+    }
+}
diff --git a/src/layouting/tsconfig.json b/src/layouting/tsconfig.json
new file mode 100644
index 00000000..7244fd30
--- /dev/null
+++ b/src/layouting/tsconfig.json
@@ -0,0 +1,10 @@
+{
+    "extends": "../../tsconfig.json",
+    "compilerOptions": {
+        "strict": false,
+    },
+    "include": [
+        "./**/*"
+    ],
+    "exclude": []
+}
diff --git a/src/layouting/util/assert.ts b/src/layouting/util/assert.ts
new file mode 100644
index 00000000..d215f6a2
--- /dev/null
+++ b/src/layouting/util/assert.ts
@@ -0,0 +1,33 @@
+import * as _ from 'lodash';
+
+export default class Assert {
+    static assertNone(collection: Array<any>, predicate: (element: any, i: number) => boolean, message: string): void {
+        const matches = _.filter(collection, predicate);
+        Assert.assert(matches.length === 0, message, matches);
+    }
+
+    static assertAll(collection: Array<any>, predicate: (element: any, i: number) => boolean, message: string): void {
+        const matches = _.filter(collection, (el, i) => !predicate(el, i));
+        Assert.assert(matches.length === 0, message, matches);
+    }
+
+    static assertNumber(input: any, message: string): void {
+        const predicate = (typeof input === 'number' && !isNaN(input));
+        Assert.assert(predicate, message, input);
+    }
+
+    static assertImplies(premise: boolean, implication: boolean, message: string, ...objects: Array<any>): void {
+        Assert.assert(!premise || implication, message, ...objects);
+    }
+
+    static assertEqual(objectA: any, objectB: any, message: string): void {
+        Assert.assert(_.isEqual(objectA, objectB), message, objectA, objectB);
+    }
+
+    static assert(predicate: boolean, message: string, ...objects: Array<any>): void {
+        console.assert(predicate, message, ...objects);
+        if (!predicate) {
+            throw new Error('Assertion failed.');
+        }
+    }
+}
diff --git a/src/layouting/util/serializer.ts b/src/layouting/util/serializer.ts
new file mode 100644
index 00000000..3021c9a9
--- /dev/null
+++ b/src/layouting/util/serializer.ts
@@ -0,0 +1,32 @@
+export default class Serializer {
+    static repeatFunction(fun: any, times: number, wait = 0,
+        foldFun: (prev: any, current: typeof prev) => typeof prev = () => {},
+        foldNeutral: any = null): Promise<any> {
+        const createRun = (run, prev, resolve) => {
+            return new Promise(resolve => setTimeout(resolve, wait)).then(() => {
+                const current = fun(run);
+                const next = foldFun(prev, current);
+                if (run + 1 < times) {
+                    return createRun(run + 1, next, resolve);
+                }
+                return resolve(next);
+            });
+        };
+        return new Promise(resolve => createRun(0, foldNeutral, resolve));
+    }
+
+    static async serializePromises(promises: Array<Promise<any>>): Promise<Array<any>> {
+        const results = [];
+
+        function createPromise(promise: Promise<any>) {
+            return new Promise(resolve => {
+                promise.then((result) => resolve(result));
+            });
+        }
+
+        for (let p = 0; p < promises.length; ++p) {
+            results.push(await createPromise(promises[p]));
+        }
+        return results;
+    }
+}
diff --git a/src/layouting/util/shuffle.ts b/src/layouting/util/shuffle.ts
new file mode 100644
index 00000000..120f9139
--- /dev/null
+++ b/src/layouting/util/shuffle.ts
@@ -0,0 +1,26 @@
+/**
+ * Adapted from:
+ * Lodash <https://lodash.com/>
+ * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
+ * Released under MIT license <https://lodash.com/license>
+ * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
+ * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ */
+
+export default class Shuffle {
+    public static shuffle(array: Array<any>): Array<any> {
+        const baseRandom = (lower, upper) => {
+            return lower + Math.floor(Math.random() * (upper - lower + 1));
+        };
+        let index = -1;
+        const length = array.length;
+        const lastIndex = length - 1;
+        while (++index < length) {
+            const rand = baseRandom(index, lastIndex);
+            const value = array[rand];
+            array[rand] = array[index];
+            array[index] = value;
+        }
+        return array;
+    }
+}
diff --git a/src/layouting/util/timer.ts b/src/layouting/util/timer.ts
new file mode 100644
index 00000000..412e8e90
--- /dev/null
+++ b/src/layouting/util/timer.ts
@@ -0,0 +1,66 @@
+import * as _ from 'lodash';
+
+export default class Timer {
+    private static _timers: Map<string, Array<number>> = new Map();
+    private static _measurements: Map<string, Array<number>> = new Map();
+
+    public static start(path: Array<string>): void {
+        const id = path.join('|');
+        let timers = Timer._timers.get(id);
+        if (timers === undefined) {
+            timers = [];
+            Timer._timers.set(id, timers);
+        }
+        timers.push(Date.now());
+    }
+
+    public static stop(path: Array<string>): void {
+        const stopTime = Date.now();
+        const id = path.join('|');
+        const timers = Timer._timers.get(id);
+        const startTime = timers[timers.length - 1];
+        timers.length = timers.length - 1;
+        let measurements = Timer._measurements.get(id);
+        if (measurements === undefined) {
+            measurements = [];
+            Timer._measurements.set(id, measurements);
+        }
+        if (timers.length === 0) {
+            measurements.push(stopTime - startTime); // for recursive calls, only add outermost
+        }
+    }
+
+    public static printTimes(): void {
+        const timePerPath = {children: {}};
+        Timer._measurements.forEach((measurements, id) => {
+            const path = id.split('|');
+            let slot = timePerPath;
+            _.forEach(path, part => {
+                if (slot.children[part] === undefined) {
+                    slot.children[part] = {
+                        children: {},
+                    };
+                }
+                slot = slot.children[part];
+            });
+            slot['sum'] = _.sum(measurements);
+            slot['mean'] = _.mean(measurements);
+            slot['count'] = measurements.length;
+        });
+        const printTimes = (slot, name = '', level = 0, parentTime = 0) => {
+            if (level > 0) {
+                let timeString = (slot.sum > 1000 ? ((slot.sum / 1000).toFixed(1) + ' s') : (slot.sum + ' ms'));
+                if (level > 1) {
+                    timeString += '; ' + (100 * slot.sum / parentTime).toFixed(0) + '% of parent';
+                }
+                timeString += '; called ' + slot.count + ' times; average: ';
+                timeString += (slot.mean > 1000 ? ((slot.mean / 1000).toFixed(1) + ' s') : (slot.mean.toFixed(1) + ' ms'));
+                console.log(_.repeat('| ', level - 1) + name + ': ' + timeString);
+            }
+            for (const name in slot.children) {
+                printTimes(slot.children[name], name, level + 1, slot.sum);
+            }
+        };
+        printTimes(timePerPath);
+    }
+}
diff --git a/src/overlays/memory_volume_overlay.js b/src/overlays/memory_volume_overlay.js
index 4602fa73..4580f5d3 100644
--- a/src/overlays/memory_volume_overlay.js
+++ b/src/overlays/memory_volume_overlay.js
@@ -1,22 +1,28 @@
 import { NestedSDFG } from '../renderer/renderer_elements';
-import { GenericSdfgOverlay } from './generic_sdfg_overlay';
 import { mean, median } from 'mathjs';
-import { getTempColor } from '../renderer/renderer_elements';
 
 
-export class MemoryVolumeOverlay extends GenericSdfgOverlay {
+export class MemoryVolumeOverlay {
 
-    constructor(overlay_manager, renderer) {
-        super(
-            overlay_manager,
-            renderer
-        );
+    constructor(settings, graph) {
+        this.symbol_resolver = settings.symbol_resolver;
+        this.badness_scale_method = settings.badness_scale_method;
+        this.graph = graph;
+    }
 
-        this.refresh();
+    static computeOverlay(graph, symbolResolver, badnessScaleMethod = 'median') {
+        const mvo = new MemoryVolumeOverlay({
+            badness_scale_method: badnessScaleMethod,
+            symbol_resolver: symbolResolver,
+        }, graph);
+        mvo.refresh();
+        return {
+            badnessScaleCenter: mvo.badness_scale_center,
+        }
     }
 
     clear_cached_volume_values() {
-        this.renderer.for_all_elements(0, 0, 0, 0, (type, e, obj, isected) => {
+        [...this.graph.allNodes(), ...this.graph.allEdges()].forEach((obj) => {
             if (obj.data) {
                 if (obj.data.volume !== undefined)
                     obj.data.volume = undefined;
@@ -50,22 +56,18 @@ export class MemoryVolumeOverlay extends GenericSdfgOverlay {
 
     calculate_volume_graph(g, symbol_map, volume_values) {
         const that = this;
-        g.nodes().forEach(v => {
-            const state = g.node(v);
+        g.nodes().forEach(state => {
             const state_graph = state.data.graph;
             if (state_graph) {
-                state_graph.edges().forEach(e => {
-                    const edge = state_graph.edge(e);
-                    if (edge instanceof Edge)
-                        that.calculate_volume_edge(
-                            edge,
-                            symbol_map,
-                            volume_values
-                        );
+                state_graph.edges().forEach(edge => {
+                    that.calculate_volume_edge(
+                        edge,
+                        symbol_map,
+                        volume_values
+                    );
                 });
 
-                state_graph.nodes().forEach(v => {
-                    const node = state_graph.node(v);
+                state_graph.nodes().forEach(node => {
                     if (node instanceof NestedSDFG) {
                         const nested_symbols_map = {};
                         const mapping = node.data.node.attributes.symbol_mapping;
@@ -95,17 +97,15 @@ export class MemoryVolumeOverlay extends GenericSdfgOverlay {
         });
     }
 
-    recalculate_volume_values(graph) {
-        this.badness_scale_center = 5;
-
+    recalculate_volume_values() {
         const volume_values = [0];
         this.calculate_volume_graph(
-            graph,
+            this.graph,
             this.symbol_resolver.symbol_value_map,
             volume_values
         );
 
-        switch (this.overlay_manager.badness_scale_method) {
+        switch (this.badness_scale_method) {
             case 'mean':
                 this.badness_scale_center = mean(volume_values);
                 break;
@@ -118,85 +118,7 @@ export class MemoryVolumeOverlay extends GenericSdfgOverlay {
 
     refresh() {
         this.clear_cached_volume_values();
-        this.recalculate_volume_values(this.renderer.graph);
-
-        this.renderer.draw_async();
-    }
-
-    shade_edge(edge, ctx) {
-        const volume = edge.data.volume;
-        if (volume !== undefined) {
-            // Only draw positive volumes.
-            if (volume <= 0)
-                return;
-
-            let badness = (1 / (this.badness_scale_center * 2)) * volume;
-            if (badness < 0)
-                badness = 0;
-            if (badness > 1)
-                badness = 1;
-            const color = getTempColor(badness);
-
-            edge.shade(this.renderer, ctx, color);
-        }
-    }
-
-    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {
-        graph.nodes().forEach(v => {
-            const state = graph.node(v);
-
-            // If we're zoomed out enough that the contents aren't visible, we
-            // skip the state.
-            if (ctx.lod && (ppp >= STATE_LOD || state.width / ppp < STATE_LOD))
-                return;
-
-            // If the node's invisible, we skip it.
-            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,
-                visible_rect.w, visible_rect.h))
-                return;
-
-            const state_graph = state.data.graph;
-            if (state_graph && !state.data.state.attributes.is_collapsed) {
-                state_graph.nodes().forEach(v => {
-                    const node = state_graph.node(v);
-
-                    // Skip the node if it's not visible.
-                    if (ctx.lod && !node.intersect(visible_rect.x,
-                        visible_rect.y, visible_rect.w, visible_rect.h))
-                        return;
-
-                    // If we're zoomed out enough that the node's contents
-                    // aren't visible or the node is collapsed, we skip it.
-                    if (node.data.node.attributes.is_collapsed ||
-                        (ctx.lod && ppp >= NODE_LOD))
-                        return;
-
-                    if (node instanceof NestedSDFG)
-                        this.recursively_shade_sdfg(
-                            node.data.graph, ctx, ppp, visible_rect
-                        );
-                });
-
-                state_graph.edges().forEach(e => {
-                    const edge = state_graph.edge(e);
-
-                    if (ctx.lod && !edge.intersect(visible_rect.x,
-                        visible_rect.y, visible_rect.w, visible_rect.h))
-                        return;
-
-                    this.shade_edge(edge, ctx);
-                });
-            }
-        });
-    }
-
-    draw() {
-        this.recursively_shade_sdfg(
-            this.renderer.graph,
-            this.renderer.ctx,
-            this.renderer.canvas_manager.points_per_pixel(),
-            this.renderer.visible_rect
-        );
+        this.recalculate_volume_values();
     }
 
     on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {
diff --git a/src/overlays/runtime_micro_seconds_overlay.js b/src/overlays/runtime_micro_seconds_overlay.js
index a9c91d9f..09d089b7 100644
--- a/src/overlays/runtime_micro_seconds_overlay.js
+++ b/src/overlays/runtime_micro_seconds_overlay.js
@@ -1,24 +1,35 @@
 import { MapExit, NestedSDFG, SDFGNode, State } from '../renderer/renderer_elements';
-import { GenericSdfgOverlay } from './generic_sdfg_overlay';
 import { mean, median } from 'mathjs';
 import { getTempColor } from '../renderer/renderer_elements';
 
+const criterium = 'mean';
 
-export class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {
+export class RuntimeMicroSecondsOverlay {
 
-    constructor(overlay_manager, renderer) {
-        super(
-            overlay_manager,
-            renderer
-        );
+    constructor(settings, runtime_map) {
+        this.badness_scale_method = settings.badness_scale_method;
+        this.symbol_resolver = settings.symbol_resolver;
+        this.runtime_map = runtime_map
+    }
 
-        this.criterium = 'mean';
-        this.runtime_map = {};
+    static computeOverlay(runtimeMap, symbolResolver, badnessScaleMethod = 'median') {
+        const rmso = new RuntimeMicroSecondsOverlay({
+            badness_scale_method: badnessScaleMethod,
+            symbol_resolver: symbolResolver,
+        }, runtimeMap);
+        rmso.refresh();
+        return {
+            runtimeMap,
+            badnessScaleCenter: rmso.badness_scale_center,
+        }
+    }
 
-        this.badness_scale_center = 0;
+    static getNodeTemperature(overlayDetails, node) {
+        const rt_summary = overlayDetails.runtimeMap[RuntimeMicroSecondsOverlay.get_element_uuid(node)];
+        return rt_summary === undefined ? undefined : 0.5 * rt_summary[criterium] / overlayDetails.badnessScaleCenter;
     }
 
-    get_element_uuid(element) {
+    static get_element_uuid(element) {
         const undefined_val = -1;
         if (element instanceof State) {
             return (
@@ -61,17 +72,15 @@ export class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {
     }
 
     refresh() {
-        this.badness_scale_center = 5;
-
         const micros_values = [0];
 
         for (const key of Object.keys(this.runtime_map)) {
             // Make sure the overall SDFG's runtime isn't included in this.
             if (key !== '0/-1/-1/-1')
-                micros_values.push(this.runtime_map[key][this.criterium]);
+                micros_values.push(this.runtime_map[key][criterium]);
         }
 
-        switch (this.overlay_manager.badness_scale_method) {
+        switch (this.badness_scale_method) {
             case 'mean':
                 this.badness_scale_center = mean(micros_values);
                 break;
@@ -80,8 +89,6 @@ export class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {
                 this.badness_scale_center = median(micros_values);
                 break;
         }
-
-        this.renderer.draw_async();
     }
 
     pretty_print_micros(micros) {
@@ -102,8 +109,8 @@ export class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {
         return value.toString() + ' ' + unit;
     }
 
-    shade_node(node, ctx) {
-        const rt_summary = this.runtime_map[this.get_element_uuid(node)];
+    shade_node(node) {
+        const rt_summary = this.runtime_map[RuntimeMicroSecondsOverlay.get_element_uuid(node)];
 
         if (rt_summary === undefined)
             return;
@@ -131,7 +138,7 @@ export class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {
         }
 
         // Calculate the 'badness' color.
-        const micros = rt_summary[this.criterium];
+        const micros = rt_summary[criterium];
         let badness = (1 / (this.badness_scale_center * 2)) * micros;
         if (badness < 0)
             badness = 0;
@@ -142,59 +149,4 @@ export class RuntimeMicroSecondsOverlay extends GenericSdfgOverlay {
         node.shade(this.renderer, ctx, color);
     }
 
-    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {
-        // First go over visible states, skipping invisible ones. We only draw
-        // something if the state is collapsed or we're zoomed out far enough.
-        // In that case, we draw the measured runtime for the entire state.
-        // If it's expanded or zoomed in close enough, we traverse inside.
-        graph.nodes().forEach(v => {
-            const state = graph.node(v);
-
-            // If the node's invisible, we skip it.
-            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,
-                visible_rect.w, visible_rect.h))
-                return;
-
-            if ((ctx.lod && (ppp >= STATE_LOD ||
-                state.width / ppp <= STATE_LOD)) ||
-                state.data.state.attributes.is_collapsed) {
-                this.shade_node(state, ctx);
-            } else {
-                const state_graph = state.data.graph;
-                if (state_graph) {
-                    state_graph.nodes().forEach(v => {
-                        const node = state_graph.node(v);
-
-                        // Skip the node if it's not visible.
-                        if (ctx.lod && !node.intersect(visible_rect.x,
-                            visible_rect.y, visible_rect.w, visible_rect.h))
-                            return;
-
-                        if (node.data.node.attributes.is_collapsed ||
-                            (ctx.lod && ppp >= NODE_LOD)) {
-                            this.shade_node(node, ctx);
-                        } else {
-                            if (node instanceof NestedSDFG) {
-                                this.recursively_shade_sdfg(
-                                    node.data.graph, ctx, ppp, visible_rect
-                                );
-                            } else {
-                                this.shade_node(node, ctx);
-                            }
-                        }
-                    });
-                }
-            }
-        });
-    }
-
-    draw() {
-        this.recursively_shade_sdfg(
-            this.renderer.graph,
-            this.renderer.ctx,
-            this.renderer.canvas_manager.points_per_pixel(),
-            this.renderer.visible_rect
-        );
-    }
-
 }
diff --git a/src/overlays/static_flops_overlay.js b/src/overlays/static_flops_overlay.js
index 6f01446f..67fb81f1 100644
--- a/src/overlays/static_flops_overlay.js
+++ b/src/overlays/static_flops_overlay.js
@@ -94,13 +94,11 @@ export class StaticFlopsOverlay extends GenericSdfgOverlay {
 
     calculate_flops_graph(g, symbol_map, flops_values) {
         const that = this;
-        g.nodes().forEach(v => {
-            const state = g.node(v);
+        g.nodes().forEach(state => {
             that.calculate_flops_node(state, symbol_map, flops_values);
             const state_graph = state.data.graph;
             if (state_graph) {
-                state_graph.nodes().forEach(v => {
-                    const node = state_graph.node(v);
+                state_graph.nodes().forEach(node => {
                     if (node instanceof NestedSDFG) {
                         const nested_symbols_map = {};
                         const mapping = node.data.node.attributes.symbol_mapping;
@@ -173,135 +171,4 @@ export class StaticFlopsOverlay extends GenericSdfgOverlay {
 
         this.renderer.draw_async();
     }
-
-    shade_node(node, ctx) {
-        const flops = node.data.flops;
-        const flops_string = node.data.flops_string;
-
-        if (flops_string !== undefined && this.renderer.mousepos &&
-            node.intersect(this.renderer.mousepos.x, this.renderer.mousepos.y)) {
-            // Show the computed FLOPS value if applicable.
-            if (isNaN(flops_string) && flops !== undefined)
-                this.renderer.tooltip = () => {
-                    this.renderer.tooltip_container.innerText = (
-                        'FLOPS: ' + flops_string + ' (' + flops + ')'
-                    );
-                };
-
-            else
-                this.renderer.tooltip = () => {
-                    this.renderer.tooltip_container.innerText = (
-                        'FLOPS: ' + flops_string
-                    );
-                };
-        }
-
-        if (flops === undefined) {
-            // If the FLOPS can't be calculated, but there's an entry for this
-            // node's FLOPS, that means that there's an unresolved symbol. Shade
-            // the node grey to indicate that.
-            if (flops_string !== undefined) {
-                node.shade(this.renderer, ctx, 'gray');
-                return;
-            } else {
-                return;
-            }
-        }
-
-        // Only draw positive FLOPS.
-        if (flops <= 0)
-            return;
-
-        // Calculate the 'badness' color.
-        let badness = (1 / (this.badness_scale_center * 2)) * flops;
-        if (badness < 0)
-            badness = 0;
-        if (badness > 1)
-            badness = 1;
-        const color = getTempColor(badness);
-
-        node.shade(this.renderer, ctx, color);
-    }
-
-    recursively_shade_sdfg(graph, ctx, ppp, visible_rect) {
-        // First go over visible states, skipping invisible ones. We only draw
-        // something if the state is collapsed or we're zoomed out far enough.
-        // In that case, we draw the FLOPS calculated for the entire state.
-        // If it's expanded or zoomed in close enough, we traverse inside.
-        graph.nodes().forEach(v => {
-            const state = graph.node(v);
-
-            // If the node's invisible, we skip it.
-            if (ctx.lod && !state.intersect(visible_rect.x, visible_rect.y,
-                visible_rect.w, visible_rect.h))
-                return;
-
-            if ((ctx.lod && (ppp >= STATE_LOD ||
-                state.width / ppp <= STATE_LOD)) ||
-                state.data.state.attributes.is_collapsed) {
-                this.shade_node(state, ctx);
-            } else {
-                const state_graph = state.data.graph;
-                if (state_graph) {
-                    state_graph.nodes().forEach(v => {
-                        const node = state_graph.node(v);
-
-                        // Skip the node if it's not visible.
-                        if (ctx.lod && !node.intersect(visible_rect.x,
-                            visible_rect.y, visible_rect.w, visible_rect.h))
-                            return;
-
-                        if (node.data.node.attributes.is_collapsed ||
-                            (ctx.lod && ppp >= NODE_LOD)) {
-                            this.shade_node(node, ctx);
-                        } else {
-                            if (node instanceof NestedSDFG) {
-                                this.recursively_shade_sdfg(
-                                    node.data.graph, ctx, ppp, visible_rect
-                                );
-                            } else {
-                                this.shade_node(node, ctx);
-                            }
-                        }
-                    });
-                }
-            }
-        });
-    }
-
-    draw() {
-        this.recursively_shade_sdfg(
-            this.renderer.graph,
-            this.renderer.ctx,
-            this.renderer.canvas_manager.points_per_pixel(),
-            this.renderer.visible_rect
-        );
-    }
-
-    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {
-        if (type === 'click' && !ends_drag) {
-            if (foreground_elem !== undefined && foreground_elem !== null &&
-                !(foreground_elem instanceof Edge)) {
-                if (foreground_elem.data.flops === undefined) {
-                    const flops_string = this.flops_map[this.get_element_uuid(foreground_elem)];
-                    if (flops_string) {
-                        const that = this;
-                        this.symbol_resolver.parse_symbol_expression(
-                            flops_string,
-                            that.symbol_resolver.symbol_value_map,
-                            true,
-                            () => {
-                                that.clear_cached_flops_values();
-                                that.recalculate_flops_values(
-                                    that.renderer.graph
-                                );
-                            }
-                        );
-                    }
-                }
-            }
-        }
-        return false;
-    }
-
 }
diff --git a/src/renderer/canvas_manager.js b/src/renderer/canvas_manager.js
deleted file mode 100644
index a0739229..00000000
--- a/src/renderer/canvas_manager.js
+++ /dev/null
@@ -1,734 +0,0 @@
-// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
-
-import { intersectRect } from 'dagre/lib/util';
-import { Edge } from "./renderer_elements";
-import { lerpMatrix } from '../utils/lerp_matrix';
-import { updateEdgeBoundingBox } from '../utils/bounding_box';
-import {
-    get_positioning_info,
-    initialize_positioning_info,
-} from "../utils/sdfg/sdfg_utils";
-
-const animation_duration = 1000;
-const animation_function = t => 1 - Math.pow(1 - t, 3);  // cubic ease out
-
-let _canvas_manager_counter = 0;
-
-export class CanvasManager {
-    // Manages translation and scaling of canvas rendering
-
-    static counter() {
-        return _canvas_manager_counter++;
-    }
-
-    constructor(ctx, renderer, canvas) {
-        this.ctx = ctx;
-        this.ctx.lod = true;
-        this.canvas = canvas;
-        this.anim_id = null;
-        this.prev_time = null;
-        this.drawables = [];
-        this.renderer = renderer;
-        this.indices = [];
-
-        this.animation_start = null;
-        this.animation_end = null;
-        this.animation_target = null;
-        /**
-         * Takes a number [0, 1] and returns a transformation matrix
-         */
-        this.animation = null;
-
-        this.request_scale = false;
-        this.scalef = 1.0;
-
-        this._destroying = false;
-
-        this.scale_origin = { x: 0, y: 0 };
-
-        this.contention = 0;
-
-        this._svg = document.createElementNS("http://www.w3.org/2000/svg", 'svg');
-
-        this.user_transform = this._svg.createSVGMatrix();
-
-        this.addCtxTransformTracking();
-    }
-
-    stopAnimation() {
-        this.animation_start = null;
-        this.animation_end = null;
-        this.animation = null;
-        this.animation_target = null;
-    }
-
-    alreadyAnimatingTo(new_transform) {
-        if (this.animation_target) {
-            let result = true;
-            result &= this.animation_target.a == new_transform.a;
-            result &= this.animation_target.b == new_transform.b;
-            result &= this.animation_target.c == new_transform.c;
-            result &= this.animation_target.d == new_transform.d;
-            result &= this.animation_target.e == new_transform.e;
-            result &= this.animation_target.f == new_transform.f;
-            return result;
-        } else
-            return false;
-    }
-
-    animateTo(new_transform) {
-        // If was already animating to the same target, jump to it directly
-        if (this.alreadyAnimatingTo(new_transform)) {
-            this.stopAnimation();
-            this.user_transform = new_transform;
-            return;
-        }
-
-        this.stopAnimation();
-        this.animation = lerpMatrix(this.user_transform, new_transform);
-        this.animation_target = new_transform;
-    }
-
-    svgPoint(x, y) {
-        const pt = this._svg.createSVGPoint();
-        pt.x = x; pt.y = y;
-        return pt;
-    }
-
-    applyUserTransform() {
-        const ut = this.user_transform;
-        this.ctx.setTransform(ut.a, ut.b, ut.c, ut.d, ut.e, ut.f);
-    }
-
-    get translation() {
-        return { x: this.user_transform.e, y: this.user_transform.f };
-    }
-
-    addCtxTransformTracking() {
-        /* This function is a hack to provide the non-standardized functionality
-        of getting the current transform from a RenderingContext.
-        When (if) this is standardized, the standard should be used instead.
-        This is made for "easy" transforms and does not support saving/restoring
-        */
-
-        const svg = document.createElementNS("http://www.w3.org/2000/svg", 'svg');
-        this.ctx._custom_transform_matrix = svg.createSVGMatrix();
-        // Save/Restore is not supported.
-
-        const checker = () => {
-            console.assert(!isNaN(this.ctx._custom_transform_matrix.f));
-        };
-        const _ctx = this.ctx;
-        const scale_func = _ctx.scale;
-        _ctx.scale = function (sx, sy) {
-            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.scaleNonUniform(sx, sy);
-            checker();
-            return scale_func.call(_ctx, sx, sy);
-        };
-        const translate_func = _ctx.translate;
-        _ctx.translate = function (sx, sy) {
-            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.translate(sx, sy);
-            checker();
-            return translate_func.call(_ctx, sx, sy);
-        };
-        const rotate_func = _ctx.rotate;
-        _ctx.rotate = function (r) {
-            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.rotate(r * 180.0 / Math.PI);
-            checker();
-            return rotate_func.call(_ctx, r);
-        };
-        const transform_func = _ctx.scale;
-        _ctx.transform = function (a, b, c, d, e, f) {
-            const m2 = svg.createSVGMatrix();
-            m2.a = a; m2.b = b; m2.c = c; m2.d = d; m2.e = e; m2.f = f;
-            _ctx._custom_transform_matrix = _ctx._custom_transform_matrix.multiply(m2);
-            checker();
-            return transform_func.call(_ctx, a, b, c, d, e, f);
-        };
-
-        const setTransform_func = _ctx.setTransform;
-        _ctx.setTransform = function (a, b, c, d, e, f) {
-            _ctx._custom_transform_matrix.a = a;
-            _ctx._custom_transform_matrix.b = b;
-            _ctx._custom_transform_matrix.c = c;
-            _ctx._custom_transform_matrix.d = d;
-            _ctx._custom_transform_matrix.e = e;
-            _ctx._custom_transform_matrix.f = f;
-            checker();
-            return setTransform_func.call(_ctx, a, b, c, d, e, f);
-        };
-
-        _ctx.custom_inverseTransformMultiply = function (x, y) {
-            const pt = svg.createSVGPoint();
-            pt.x = x; pt.y = y;
-            checker();
-            return pt.matrixTransform(_ctx._custom_transform_matrix.inverse());
-        }
-    }
-
-    destroy() {
-        this._destroying = true;
-        this.clearDrawables();
-    }
-
-    addDrawable(obj) {
-        this.drawables.push(obj);
-        this.indices.push({ "c": CanvasManager.counter(), "d": obj });
-    }
-
-    removeDrawable(drawable) {
-        this.drawables = this.drawables.filter(x => x != drawable);
-    }
-
-    clearDrawables() {
-        for (const x of this.drawables) {
-            x.destroy();
-        }
-        this.drawables = [];
-        this.indices = [];
-    }
-
-    isBlank() {
-        const ctx = this.canvas.getContext('2d');
-        const topleft = ctx.getImageData(0, 0, 1, 1).data;
-        if (topleft[0] != 0 || topleft[1] != 0 || topleft[2] != 0 || topleft[3] != 255)
-            return false;
-
-        const pixelBuffer = new Uint32Array(
-            ctx.getImageData(0, 0, this.canvas.width, this.canvas.height).data.buffer
-        );
-
-        return !pixelBuffer.some(color => color !== 0xff000000);
-    }
-
-    scale(diff, x = 0, y = 0) {
-        this.stopAnimation();
-        if (this.request_scale || this.contention > 0) {
-            return;
-        }
-        this.contention++;
-        this.request_scale = true;
-        if (this.isBlank()) {
-            this.renderer.bgcolor = 'black';
-            this.renderer.zoom_to_view(null, false);
-            diff = 0.01;
-        }
-
-        this.scale_origin.x = x;
-        this.scale_origin.y = y;
-
-        const sv = diff;
-        const pt = this.svgPoint(this.scale_origin.x, this.scale_origin.y).matrixTransform(this.user_transform.inverse());
-        this.user_transform = this.user_transform.translate(pt.x, pt.y);
-        this.user_transform = this.user_transform.scale(sv, sv, 1, 0, 0, 0);
-        this.scalef *= sv;
-        this.user_transform = this.user_transform.translate(-pt.x, -pt.y);
-
-        this.contention--;
-    }
-
-    // Sets the view to the square around the input rectangle
-    set_view(rect, animate = false) {
-        const canvas_w = this.canvas.width;
-        const canvas_h = this.canvas.height;
-        if (canvas_w == 0 || canvas_h == 0)
-            return;
-
-        let scale = 1, tx = 0, ty = 0;
-        if (rect.width > rect.height) {
-            scale = canvas_w / rect.width;
-            tx = -rect.x;
-            ty = -rect.y - (rect.height / 2) + (canvas_h / scale / 2);
-
-            // Now other dimension does not fit, scale it as well
-            if (rect.height * scale > canvas_h) {
-                scale = canvas_h / rect.height;
-                tx = -rect.x - (rect.width / 2) + (canvas_w / scale / 2);
-                ty = -rect.y;
-            }
-        } else {
-            scale = canvas_h / rect.height;
-            tx = -rect.x - (rect.width / 2) + (canvas_w / scale / 2);
-            ty = -rect.y;
-
-            // Now other dimension does not fit, scale it as well
-            if (rect.width * scale > canvas_w) {
-                scale = canvas_w / rect.width;
-                tx = -rect.x;
-                ty = -rect.y - (rect.height / 2) + (canvas_h / scale / 2);
-            }
-        }
-
-        // Uniform scaling
-        const new_transform = this._svg.createSVGMatrix().scale(scale, scale, 1, 0, 0, 0).translate(tx, ty);
-
-        if (animate && this.prev_time !== null) {
-            this.animateTo(new_transform);
-        } else {
-            this.stopAnimation();
-            this.user_transform = new_transform;
-        }
-
-        this.scale_origin = { x: 0, y: 0 };
-        this.scalef = 1.0;
-    }
-
-    translate(x, y) {
-        this.stopAnimation();
-        this.user_transform = this.user_transform.translate(x / this.user_transform.a, y / this.user_transform.d);
-    }
-
-    /**
-     * Move/translate an element in the graph by a change in x and y.
-     * @param {*} el                Element to move
-     * @param {*} old_mousepos      Old mouse position in canvas coordinates
-     * @param {*} new_mousepos      New mouse position in canvas coordinates
-     * @param {*} entire_graph      Reference to the entire graph
-     * @param {*} sdfg_list         List of SDFGs and nested SDFGs
-     * @param {*} state_parent_list List of parent elements to SDFG states
-     * // TODO: update doc comment with parameters
-     */
-    translate_element(
-        el, old_mousepos, new_mousepos, entire_graph, sdfg_list,
-        state_parent_list, drag_start, update_position_info = true,
-        move_entire_edge = false, edge_dpoints = undefined
-    ) {
-        this.stopAnimation();
-
-        // Edges connected to the moving element
-        let out_edges = [];
-        let in_edges = [];
-
-        // Find the parent graph in the list of available SDFGs
-        let parent_graph = sdfg_list[el.sdfg.sdfg_list_id];
-        let parent_element = null;
-
-        if (entire_graph !== parent_graph && (el.data.state || el.data.type == 'InterstateEdge')) {
-            // If the parent graph and the entire SDFG shown are not the same,
-            // we're currently in a nested SDFG. If we're also moving a state,
-            // this means that its parent element is found in the list of
-            // parents to states (state_parent_list)
-            parent_element = state_parent_list[el.sdfg.sdfg_list_id];
-        } else if (el.parent_id !== null && parent_graph) {
-            // If the parent_id isn't null and there is a parent graph, we can
-            // look up the parent node via the element's parent_id
-            parent_element = parent_graph.node(el.parent_id);
-            // If our parent element is a state, we want the state's graph
-            if (parent_element.data.state)
-                parent_graph = parent_element.data.graph;
-        }
-
-        if (parent_graph && !(el instanceof Edge)) {
-            // Find all the edges connected to the moving node
-            parent_graph.outEdges(el.id).forEach(edge_id => {
-                out_edges.push(parent_graph.edge(edge_id));
-            });
-            parent_graph.inEdges(el.id).forEach(edge_id => {
-                in_edges.push(parent_graph.edge(edge_id));
-            });
-        }
-
-        // Compute theoretical initial displacement/movement
-        let dx = new_mousepos.x - old_mousepos.x;
-        let dy = new_mousepos.y - old_mousepos.y;
-
-        // If edge, find closest point to drag start position
-        let pt = -1;
-        if (el instanceof Edge) {
-            if (move_entire_edge) {
-                pt = -2;
-            } else if (edge_dpoints && edge_dpoints.length > 0) {
-                pt = -3;
-            } else if (drag_start) {
-                // Find closest point to old mouse position
-                if (drag_start.edge_point === undefined) {
-                    let dist = null;
-                    el.points.forEach((p, i) => {
-                        // Only allow dragging if the memlet has more than two
-                        // points
-                        if (i == 0 || i == el.points.length - 1)
-                            return;
-                        let ddx = p.x - drag_start.cx;
-                        let ddy = p.y - drag_start.cy;
-                        let curdist = ddx*ddx + ddy*ddy;
-                        if (dist === null || curdist < dist) {
-                            dist = curdist;
-                            pt = i;
-                        }
-                    });
-                    drag_start.edge_point = pt;
-                } else {
-                    pt = drag_start.edge_point;
-                }
-            }
-        }
-
-        if (parent_element) {
-            // Calculate the box to bind the element to. This is given by
-            // the parent element, i.e. the element where out to-be-moved
-            // element is contained within
-            const parent_left_border =
-                (parent_element.x - (parent_element.width / 2));
-            const parent_right_border =
-                parent_left_border + parent_element.width;
-            const parent_top_border =
-                (parent_element.y - (parent_element.height / 2));
-            const parent_bottom_border =
-                parent_top_border + parent_element.height;
-
-            let el_h_margin = el.height / 2;
-            let el_w_margin = el.width / 2;
-            if (el instanceof Edge) {
-                el_h_margin = el_w_margin = 0;
-            }
-            const min_x = parent_left_border + el_w_margin;
-            const min_y = parent_top_border + el_h_margin;
-            const max_x = parent_right_border - el_w_margin;
-            const max_y = parent_bottom_border - el_h_margin;
-
-            // Make sure we don't move our element outside its parent's
-            // bounding box. If either the element or the mouse pointer are
-            // outside the parent, we clamp movement in that direction
-            if (el instanceof Edge) {
-                if (pt > 0) {
-                    let target_x = el.points[pt].x + dx;
-                    let target_y = el.points[pt].y + dy;
-                    if (target_x <= min_x ||
-                        new_mousepos.x <= parent_left_border) {
-                        dx = min_x - el.points[pt].x;
-                    } else if (target_x >= max_x ||
-                        new_mousepos.x >= parent_right_border) {
-                        dx = max_x - el.points[pt].x;
-                    }
-                    if (target_y <= min_y ||
-                        new_mousepos.y <= parent_top_border) {
-                        dy = min_y - el.points[pt].y;
-                    } else if (target_y >= max_y ||
-                        new_mousepos.y >= parent_bottom_border) {
-                        dy = max_y - el.points[pt].y;
-                    }
-                }
-            } else {
-                let target_x = el.x + dx;
-                let target_y = el.y + dy;
-                if (target_x <= min_x ||
-                    new_mousepos.x <= parent_left_border) {
-                    dx = min_x - el.x;
-                } else if (target_x >= max_x ||
-                    new_mousepos.x >= parent_right_border) {
-                    dx = max_x - el.x;
-                }
-                if (target_y <= min_y ||
-                    new_mousepos.y <= parent_top_border) {
-                    dy = min_y - el.y;
-                } else if (target_y >= max_y ||
-                    new_mousepos.y >= parent_bottom_border) {
-                    dy = max_y - el.y;
-                }
-            }
-        }
-
-        if (el instanceof Edge) {
-            let position;
-            if (update_position_info) {
-                position = get_positioning_info(el);
-
-                if (!position)
-                    position = initialize_positioning_info(el);
-            }
-            if (pt > 0) {
-                // Move point
-                el.points[pt].x += dx;
-                el.points[pt].y += dy;
-
-                // Move edge bounding box
-                updateEdgeBoundingBox(el);
-
-                if (update_position_info) {
-                    if (!position.points) {
-                        position.points = Array(el.points.length);
-                        for (let i = 0; i < el.points.length; i++) {
-                            position.points[i] = {dx: 0, dy: 0};
-                        }
-                    }
-
-                    position.points[pt].dx += dx;
-                    position.points[pt].dy += dy;
-                }
-            } else if (pt == -2) {
-                // Don't update first and last point (the connectors)
-                for (let i = 1; i < el.points.length - 1; i++) {
-                    el.points[i].x += dx;
-                    el.points[i].y += dy;
-                }
-
-                if (update_position_info) {
-                    for (let i = 1; i < el.points.length - 1; i++) {
-                        position.points[i].dx += dx;
-                        position.points[i].dy += dy;
-                    }
-                }
-            } else if (pt == -3) {
-                for (let i = 1; i < el.points.length - 1; i++) {
-                    el.points[i].x += edge_dpoints[i].dx;
-                    el.points[i].y += edge_dpoints[i].dy;
-                }
-            }
-            // The rest of the method doesn't apply to Edges
-            return;
-        }
-
-        // Move a node together with its connectors if it has any
-        function move_node_and_connectors(node) {
-            node.x += dx;
-            node.y += dy;
-            if (node.data.node && node.data.node.type === 'NestedSDFG')
-                translate_recursive(node.data.graph);
-            if (node.in_connectors)
-                node.in_connectors.forEach(c => {
-                    c.x += dx;
-                    c.y += dy;
-                });
-            if (node.out_connectors)
-                node.out_connectors.forEach(c => {
-                    c.x += dx;
-                    c.y += dy;
-                });
-        }
-
-        // Allow recursive translation of nested SDFGs
-        function translate_recursive(ng) {
-            ng.nodes().forEach(state_id => {
-                const state = ng.node(state_id);
-                state.x += dx;
-                state.y += dy;
-                const g = state.data.graph;
-                if (g) {
-                    g.nodes().forEach(node_id => {
-                        const node = g.node(node_id);
-                        move_node_and_connectors(node);
-                    });
-
-                    g.edges().forEach(edge_id => {
-                        const edge = g.edge(edge_id);
-                        edge.x += dx;
-                        edge.y += dy;
-                        edge.points.forEach(point => {
-                            point.x += dx;
-                            point.y += dy;
-                        });
-                        updateEdgeBoundingBox(edge);
-                    });
-                }
-            });
-            ng.edges().forEach(edge_id => {
-                const edge = ng.edge(edge_id);
-                edge.x += dx;
-                edge.y += dy;
-                edge.points.forEach(point => {
-                    point.x += dx;
-                    point.y += dy;
-                });
-                updateEdgeBoundingBox(edge);
-            });
-        }
-
-        // Move the node
-        move_node_and_connectors(el);
-
-        // Store movement information in element (for relayouting)
-        if (update_position_info) {
-            let position = get_positioning_info(el);
-            if (!position)
-                position = initialize_positioning_info(el);
-
-            position.dx += dx;
-            position.dy += dy;
-
-            // Store movement information if EntryNode for other nodes of the same scope
-            if (el instanceof EntryNode && el.data.node.attributes.is_collapsed) {
-                if (!position.scope_dx) {
-                    position.scope_dx = 0;
-                    position.scope_dy = 0;
-                }
-
-                position.scope_dx += dx;
-                position.scope_dy += dy;
-            }
-        }
-        
-        if (el.data.state && !el.data.state.attributes.is_collapsed) {
-            // We're moving a state, move all its contained elements
-            const graph = el.data.graph;
-            graph.nodes().forEach(node_id => {
-                const node = graph.node(node_id);
-                move_node_and_connectors(node);
-            });
-
-            // Drag all the edges along
-            graph.edges().forEach(edge_id => {
-                const edge = graph.edge(edge_id);
-                edge.x += dx;
-                edge.y += dy;
-                edge.points.forEach(point => {
-                    point.x += dx;
-                    point.y += dy;
-                });
-                updateEdgeBoundingBox(edge);
-            });
-        }
-
-        // Move the connected edges along with the element
-        out_edges.forEach(edge => {
-            const n = edge.points.length - 1;
-            let moved = false;
-            if (edge.src_connector !== null) {
-                for (let i = 0; i < el.out_connectors.length; i++) {
-                    if (el.out_connectors[i].data.name === edge.src_connector) {
-                        edge.points[0] = intersectRect(el.out_connectors[i], edge.points[1]);
-                        moved = true;
-                        break;
-                    }
-                }
-            }
-            if (!moved) {
-                edge.points[0].x += dx;
-                edge.points[0].y += dy;
-            }
-            // Also update destination point of edge
-            if (edge.dst_connector !== null) {
-                let e = parent_element?.data?.state?.edges[edge.id];
-                let dst_el = parent_graph.node(e?.dst);
-                if (dst_el) {
-                    for (let i = 0; i < dst_el.in_connectors.length; i++) {
-                        let dst_name = dst_el.in_connectors[i].data.name;
-                        if (dst_name === edge.dst_connector) {
-                            edge.points[n] = intersectRect(
-                                dst_el.in_connectors[i], edge.points[n - 1]
-                            );
-                            break;
-                        }
-                    }
-                }
-            }
-            updateEdgeBoundingBox(edge);
-        });
-        in_edges.forEach(edge => {
-            const n = edge.points.length - 1;
-            let moved = false;
-            if (edge.dst_connector !== null) {
-                for (let i = 0; i < el.in_connectors.length; i++) {
-                    if (el.in_connectors[i].data.name === edge.dst_connector) {
-                        edge.points[n] = intersectRect(
-                            el.in_connectors[i], edge.points[n-1]
-                        );
-                        moved = true;
-                        break;
-                    }
-                }
-            }
-            if (!moved) {
-                edge.points[n].x += dx;
-                edge.points[n].y += dy;
-            }
-            // Also update source point of edge
-            if (edge.src_connector !== null) {
-                let e = parent_element?.data?.state?.edges[edge.id];
-                let src_el = parent_graph.node(e?.src);
-                if (src_el) {
-                    for (let i = 0; i < src_el.out_connectors.length; i++) {
-                        let out_name = src_el.out_connectors[i].data.name;
-                        if (out_name === edge.src_connector) {
-                            edge.points[0] = intersectRect(
-                                src_el.out_connectors[i], edge.points[1]
-                            );
-                            break;
-                        }
-                    }
-                }
-            }
-            updateEdgeBoundingBox(edge);
-        });
-    }
-
-    mapPixelToCoordsX(xpos) {
-        return this.svgPoint(xpos, 0).matrixTransform(this.user_transform.inverse()).x;
-    }
-
-    mapPixelToCoordsY(ypos) {
-        return this.svgPoint(0, ypos).matrixTransform(this.user_transform.inverse()).y;
-    }
-
-    noJitter(x) {
-        x = parseFloat(x.toFixed(3));
-        x = Math.round(x * 100) / 100;
-        return x;
-    }
-
-    points_per_pixel() {
-        // Since we are using uniform scaling, (bottom-top)/height and
-        // (right-left)/width should be equivalent
-        const left = this.mapPixelToCoordsX(0);
-        const right = this.mapPixelToCoordsX(this.canvas.width);
-        return (right - left) / this.canvas.width;
-    }
-
-    animation_step(now) {
-        if (this.animation === null) {
-            return;
-        }
-
-        if (this.animation_start === null) {
-            this.animation_start = now;
-            this.animation_end = now + animation_duration;
-        }
-
-        if (now >= this.animation_end) {
-            this.user_transform = this.animation(1);
-            this.stopAnimation();
-            return;
-        }
-
-        const start = this.animation_start;
-        const end = this.animation_end;
-        this.user_transform = this.animation(animation_function((now - start) / (end - start)));
-    }
-
-    draw_now(now) {
-        if (this._destroying)
-            return;
-
-        let dt = now - this.prev_time;
-        if (!this.prev_time)
-            dt = null;
-        this.prev_time = now;
-
-        if (this.contention > 0) return;
-        this.contention += 1;
-        const ctx = this.ctx;
-
-        // Clear with default transform
-        ctx.save();
-        ctx.setTransform(1, 0, 0, 1, 0, 0);
-        ctx.clearRect(0, 0, ctx.canvas.width, ctx.canvas.height);
-        ctx.fillStyle = this.renderer.bgcolor;
-        ctx.fillRect(0, 0, ctx.canvas.width, ctx.canvas.height);
-        ctx.restore();
-
-        this.animation_step(now);
-
-        this.applyUserTransform();
-        if (this.request_scale)
-            this.request_scale = this.contention !== 1;
-
-        this.renderer.draw(dt);
-        this.contention -= 1;
-
-        if (this.animation_end !== null && now < this.animation_end)
-            this.draw_async();
-    }
-
-    draw_async() {
-        this.anim_id = window.requestAnimationFrame((now) => this.draw_now(now));
-    }
-}
diff --git a/src/renderer/pixi/layouting/README.md b/src/renderer/pixi/layouting/README.md
new file mode 100644
index 00000000..be7d46a5
--- /dev/null
+++ b/src/renderer/pixi/layouting/README.md
@@ -0,0 +1 @@
+This folder contains layouters that can be passed into the Pixi renderer. ComplexLayouter is used as a wrapper for layouters in src/layouting (which use a different interface).
diff --git a/src/renderer/pixi/layouting/layout.ts b/src/renderer/pixi/layouting/layout.ts
new file mode 100644
index 00000000..2be8fe80
--- /dev/null
+++ b/src/renderer/pixi/layouting/layout.ts
@@ -0,0 +1,90 @@
+import { RenderGraph } from '../../../layouting/layoutLib';
+import { SDFGData } from '../../../utils/sdfg/types';
+import { SDFGElement } from '../../renderer_elements';
+
+export type CompleteLayout = Readonly<{
+    /**
+     * List of all layout elements.
+     */
+    elements: readonly LayoutElement[],
+    /**
+     * Reference to an optional SDFG graph.
+     */
+    graph?: RenderGraph | undefined,
+}>;
+
+export type LayoutElement = StateLayoutElement | NodeLayoutElement | EdgeLayoutElement | ConnectorLayoutElement;
+
+
+
+type BaseLayoutElement = {
+    type: string,
+    zIndex: number,
+    tooltip?: {
+        html: string,
+        style: 'normal' | 'interstate' | 'connector',
+    } | undefined,
+    sdfgData?: any | undefined,
+    renderData?: SDFGElement | undefined,
+    highlightingGroup?: unknown,
+};
+
+type BoxedLayoutElement = BaseLayoutElement & {
+    /**
+     * x coordinate of the left side
+     */
+    x: number,
+    /**
+     * y coordinate of the top side
+     */
+    y: number,
+    width: number,
+    height: number,
+};
+
+export type StateLayoutElement = BoxedLayoutElement & {
+    type: 'state',
+    caption: string,
+    isCollapsed: boolean,
+};
+
+export type NodeLayoutElement = BoxedLayoutElement & {
+    type: 'node',
+    caption: string,
+    farCaption?: string | undefined,
+    stroke: 'normal' | 'bold' | 'double',
+    shape: 'ellipse' | 'octagon' | 'upperHexagon' | 'lowerHexagon' | 'hexagon' | 'triangle' | 'rectangle',
+    backgroundTemperature?: number | undefined,
+}
+
+export type ConnectorLayoutElement = BaseLayoutElement & {
+    type: 'connector',
+    /**
+     * x coordinate of the center
+     */
+    x: number,
+    /**
+     * y coordinate of the center
+     */
+    y: number,
+    radius: number,
+    scopedColor: boolean,
+}
+
+type EdgePoint = [number, number];
+
+export type EdgeLayoutElement = BaseLayoutElement & {
+    type: 'edge',
+    /**
+     * First element is the start, last element is the destination. There can be more optional control points
+     * inbetween, which will be used to draw a piecewise interpolated quadratic or cubic Bezier
+     */
+    points: [EdgePoint, EdgePoint, ...EdgePoint[]],
+    lineStyle: 'solid' | 'dotted',
+    interstateColor: boolean,
+    shadeTemperature?: number | undefined,
+}
+
+export type SDFGLayouter = {
+    (sdfg: SDFGData): CompleteLayout
+};
diff --git a/src/renderer/pixi/layouting/layouters/complex_layouter/complex_layouter.ts b/src/renderer/pixi/layouting/layouters/complex_layouter/complex_layouter.ts
new file mode 100644
index 00000000..d512c154
--- /dev/null
+++ b/src/renderer/pixi/layouting/layouters/complex_layouter/complex_layouter.ts
@@ -0,0 +1,281 @@
+import { SDFGData } from '../../../../../utils/sdfg/types';
+import { CompleteLayout, LayoutElement } from '../../layout';
+import { RenderLayouter } from '../layouter';
+import LLayouter from '../../../../../layouting/layouter/layouter';
+import { getSDFGGraph } from './utils';
+import { RenderGraph } from '../../../../../layouting/layoutLib';
+import { AccessNode, NestedSDFG, Reduce, ScopeNode, SDFGNode, State } from '../../../../renderer_elements';
+import { check_and_redirect_edge as checkAndRedirectEdge } from '../../../../../utils/sdfg/sdfg_utils';
+import { calculateBoundingBox, calculateEdgeBoundingBox } from '../../../../../utils/bounding_box';
+import { RendererSettings } from '../../../pixi_renderer';
+import { SymbolResolver } from '../../../../../utils/symbol_resolver';
+import { MemoryVolumeOverlay } from '../../../../../overlays/memory_volume_overlay';
+import { RuntimeMicroSecondsOverlay } from '../../../../../overlays/runtime_micro_seconds_overlay';
+// eslint-disable-next-line camelcase
+import { sdfg_property_to_string } from '../../../../../utils/sdfg/display';
+import RenderEdge from '../../../../../layouting/renderGraph/renderEdge';
+import { htmlSanitize } from '../../../../../utils/sanitization';
+import { memlet_tree_complete } from '../../../../../utils/sdfg/traversal';
+
+/**
+ * Acts as a bridge to the layouter interface in src/layouting.
+ */
+export class ComplexLayouter implements RenderLayouter {
+    constructor(private layouter: LLayouter) { }
+
+    layout(sdfg: SDFGData, settings: RendererSettings, symbolResolver: SymbolResolver): CompleteLayout {
+        const sdfgList = {};
+        const stateParentList = {};
+        const relayoutedGraph = relayoutSDFG(this.layouter, sdfg, sdfgList, stateParentList, settings.omitAccessNodes);
+        const mvoDetails = !settings.memoryVolumeOverlay ? null : MemoryVolumeOverlay.computeOverlay(relayoutedGraph, symbolResolver);
+        const rmsoDetails = !settings.runtimeMap ? null : RuntimeMicroSecondsOverlay.computeOverlay(settings.runtimeMap, symbolResolver);
+        const memletTree = memlet_tree_complete(sdfg);
+        const treeIdByEdge = new Map(
+            memletTree.flatMap((tree, i) => [...tree].map(edge => [edge.attributes.data, i]))
+        );
+
+        const els: LayoutElement[] = [];
+
+        function appendGraph(graph: RenderGraph, depth: number) {
+            graph.nodes().forEach(node => {
+                if (node instanceof State) {
+                    const el = {
+                        type: 'state',
+                        zIndex: depth,
+                        caption: node.label(),
+                        x: node.x,
+                        y: node.y,
+                        width: node.width,
+                        height: node.height,
+                        isCollapsed: node.data.state.attributes.is_collapsed,
+                        sdfgData: node.data.state,
+                        renderData: node,
+                    } as const;
+                    (node as any).layoutElement = el;
+                    els.push(el);
+                } else if (node instanceof SDFGNode) {
+                    const nodeName = node.constructor.name;
+                    const isCollapsed = node.data.node.attributes.is_collapsed;
+                    const label = node instanceof ScopeNode ? node.close_label(settings)
+                        : node instanceof NestedSDFG && isCollapsed ? node.data.node.attributes.label
+                            : node.label();
+                    const farLabel =
+                        node instanceof ScopeNode ? node.far_label(settings) :
+                            node instanceof Reduce ? label.substring(4, label.indexOf(',')) :
+                                undefined;
+                    const el = {
+                        type: 'node',
+                        zIndex: depth,
+                        caption: nodeName === 'NestedSDFG' && !isCollapsed ? '' : label,
+                        farCaption: farLabel,
+                        x: node.x,
+                        y: node.y,
+                        width: node.width,
+                        height: node.height,
+                        shape: nodeName.includes('Entry') ? (isCollapsed ? 'hexagon' : 'upperHexagon')
+                            : nodeName.includes('Exit') ? 'lowerHexagon'
+                                : nodeName === 'Tasklet' || (nodeName === 'NestedSDFG' && isCollapsed) ? 'octagon'
+                                    : nodeName === 'AccessNode' ? 'ellipse'
+                                        : nodeName === 'Reduce' ? 'triangle'
+                                            : 'rectangle',
+                        stroke: node.getStrokeStyle(),
+                        backgroundTemperature: rmsoDetails ? RuntimeMicroSecondsOverlay.getNodeTemperature(rmsoDetails, node) : undefined,
+                        sdfgData: node.data.node,
+                        renderData: node,
+                        ...node instanceof AccessNode ? {
+                            highlightingGroup: JSON.stringify(['AccessNode', node.sdfg.sdfg_list_id, label]),
+                        } : {},
+                    } as const;
+                    (node as any).layoutElement = el;
+                    els.push(el);
+                } else {
+                    console.error('Unknown node type!', node);
+                }
+
+                for (const connector of [...node.inConnectors, ...node.outConnectors]) {
+                    if (connector.width !== connector.height) throw new Error('Connectors must be circles!');
+
+                    const rad = connector.width / 2;
+                    const el = {
+                        type: 'connector',
+                        zIndex: depth,
+                        x: connector.x + rad,
+                        y: connector.y + rad,
+                        radius: rad,
+                        scopedColor: connector.name.startsWith('IN_') || connector.name.startsWith('OUT_'),
+                        tooltip: {
+                            html: htmlSanitize`${connector.name}`,
+                            style: 'connector',
+                        },
+                        sdfgData: (connector as any).data,
+                    } as const;
+                    (connector as any).layoutElement = el;
+                    els.push(el);
+                }
+
+                if (node.childGraph) appendGraph(node.childGraph, depth + 1);
+            });
+
+            graph.edges().forEach(edge => {
+                const edg = edge as any;
+                const parentId = edg.parent_id;
+                const isInterstate = parentId === null || parentId === undefined;
+
+                // Edge tooltip
+
+
+                const el = {
+                    type: 'edge',
+                    zIndex: depth,
+                    points: edge.points.map(p => [p.x, p.y]) as any,
+                    lineStyle: 'solid',
+                    interstateColor: isInterstate,
+                    shadeTemperature: mvoDetails && edg.data.volume > 0
+                        ? 0.5 * edg.data.volume / mvoDetails.badnessScaleCenter
+                        : undefined,
+                    tooltip: getEdgeTooltip(edge, settings),
+                    sdfgData: edg.data,
+                    renderData: edg,
+                    ...treeIdByEdge.has(edg.data) ? {
+                        highlightingGroup: JSON.stringify(['Edge', edg.sdfg.sdfg_list_id, treeIdByEdge.get(edg.data)]),
+                    } : {},
+                } as const;
+                edg.layoutElement = el;
+                els.push(el);
+            });
+        }
+        appendGraph(relayoutedGraph, 0);
+
+        return {
+            elements: els,
+            graph: relayoutedGraph,
+        };
+    }
+}
+
+function relayoutSDFG(layouter: LLayouter, sdfg: SDFGData, sdfgList: unknown, stateParentList: unknown, omitAccessNodes: boolean): RenderGraph {
+    const g = getSDFGGraph(sdfg, sdfgList, stateParentList, omitAccessNodes);
+
+    layouter.layout(g);
+
+    function postlayoutSDFG(g: RenderGraph, sdfg: SDFGData) {
+        sdfg.nodes.forEach((sdfgState) => {
+            const stateNode = g.node(sdfgState.id);
+            if (stateNode.childGraph === null) {
+                // ignore collapsed states
+                return;
+            }
+            sdfgState.nodes?.forEach((node, id) => {
+                const gnode = stateNode.childGraph?.node(id);
+                if (!gnode || !gnode.childGraph || (omitAccessNodes && gnode instanceof AccessNode)) {
+                    // ignore nodes that should not be drawn
+                    return;
+                }
+
+                // recursively process nested sdfgs
+                if (node.type === 'NestedSDFG' && !node.attributes.is_collapsed) {
+                    postlayoutSDFG(gnode.childGraph, node.attributes.sdfg);
+                }
+            });
+
+            sdfgState.edges?.forEach((edge, id) => {
+                edge = checkAndRedirectEdge(edge, (stateNode.childGraph as any).drawn_nodes, sdfgState);
+                if (!edge) return;
+                const gedge = stateNode?.childGraph?.edge(id);
+                if (!gedge || (omitAccessNodes && (gedge as any).data.attributes.shortcut === false)
+                    || (!omitAccessNodes && (gedge as any).data.attributes.shortcut)) {
+                    // if access nodes omitted, don't draw non-shortcut edges and vice versa
+                    return;
+                }
+
+                gedge.updateBoundingBox();
+            });
+        });
+
+        // Annotate the sdfg with its layout info
+        sdfg.nodes.forEach((state) => {
+            const gnode = g.node(state.id);
+            state.attributes.layout = {
+                x: gnode.x,
+                y: gnode.y,
+                width: gnode.width,
+                height: gnode.height,
+            };
+        });
+
+        g.edges().forEach((edge) => {
+            const gedge = edge;
+            const bb = calculateEdgeBoundingBox(gedge);
+
+            // Convert from top-left to center
+            gedge.x = bb.width / 2.0;
+            gedge.y = bb.height / 2.0;
+            gedge.width = bb.width;
+            gedge.height = bb.height;
+            edge.attributes.layout = {};
+            edge.attributes.layout.width = bb.width;
+            edge.attributes.layout.height = bb.height;
+            edge.attributes.layout.x = bb.width / 2.0;
+            edge.attributes.layout.y = bb.height / 2.0;
+            edge.attributes.layout.points = gedge.points;
+        });
+
+        const bb = calculateBoundingBox(g);
+        (g as any).width = bb.width;
+        (g as any).height = bb.height;
+
+        // Add SDFG to global store
+        sdfg[sdfg.sdfg_list_id] = g;
+    }
+
+    postlayoutSDFG(g, sdfg);
+
+    return g;
+}
+
+function getEdgeTooltip(edge: RenderEdge, settings: RendererSettings) {
+    const attr = edge.attributes();
+    if (attr.subset !== undefined) {
+        if (attr.subset === null) {  // Empty memlet
+            return undefined;
+        }
+        let contents = attr.data;
+        contents += sdfg_property_to_string(attr.subset, settings);
+
+        if (attr.other_subset)
+            contents += ' -> ' + sdfg_property_to_string(attr.other_subset, settings);
+
+        if (attr.wcr)
+            contents += '<br /><b>CR: ' + sdfg_property_to_string(attr.wcr, settings) + '</b>';
+
+        let numAccessesStr = '';
+        if (attr.volume)
+            numAccessesStr = sdfg_property_to_string(attr.volume, settings);
+        else
+            numAccessesStr = sdfg_property_to_string(attr.num_accesses, settings);
+
+        const numAccesses = Number(numAccessesStr);
+        if (attr.dynamic) {
+            if (numAccesses === 0 || numAccesses === -1)
+                numAccessesStr = '<b>Dynamic (unbounded)</b>';
+            else
+                numAccessesStr = '<b>Dynamic</b> (up to ' + numAccessesStr + ')';
+        } else if (numAccesses === -1) {
+            numAccessesStr = '<b>Dynamic (unbounded)</b>';
+        }
+
+        contents += '<br /><font style="font-size: 14px">Volume: ' + numAccessesStr + '</font>';
+        return {
+            html: contents,
+            style: 'normal',
+        } as const;
+    } else {  // Interstate edge
+        if (!edge.label())
+            return undefined;
+        return {
+            html: edge.label(),
+            style: 'interstate',
+        } as const;
+    }
+
+}
diff --git a/src/renderer/pixi/layouting/layouters/complex_layouter/utils.js b/src/renderer/pixi/layouting/layouters/complex_layouter/utils.js
new file mode 100644
index 00000000..664e4f24
--- /dev/null
+++ b/src/renderer/pixi/layouting/layouters/complex_layouter/utils.js
@@ -0,0 +1,271 @@
+/* eslint-disable */
+
+import { RenderGraph } from "../../../../../layouting/layoutLib";
+import { LINEHEIGHT, STATE_MARGIN } from "../../../../../utils/constants";
+import { deepCopy } from "../../../../../utils/utils";
+import { check_and_redirect_edge, find_exit_for_entry } from "../../../../../utils/sdfg/sdfg_utils";
+import { Connector, Edge, SDFGElements, State } from "../../../../renderer_elements";
+import { getTextMetrics } from "../../render_layout_element";
+
+export function getSDFGGraph(sdfg, sdfg_list, state_parent_list, omit_access_nodes) {
+    const g = new RenderGraph();
+
+    // layout each state to get its size
+    sdfg.nodes.forEach((state) => {
+        const stateinfo = {};
+
+        stateinfo.label = `${state.id}`;
+        let state_g = null;
+        stateinfo.width = getTextMetrics(stateinfo.label).width;
+        stateinfo.height = LINEHEIGHT;
+        if (!state.attributes.is_collapsed) {
+            state_g = get_state_graph(state, sdfg, sdfg_list,
+                state_parent_list, omit_access_nodes);
+        }
+        stateinfo.width += 2 * STATE_MARGIN;
+        stateinfo.height += 2 * STATE_MARGIN;
+        const state_obj = new State({
+            state: state,
+            layout: stateinfo,
+            graph: state_g
+        }, state.id, sdfg);
+        state_obj.childGraph = state_g;
+        g.addNode(state_obj, parseInt(state.id));
+    });
+
+    sdfg.edges.forEach((edge, id) => {
+        const edge_obj = new Edge(edge.attributes.data, id, sdfg);
+        edge_obj.src = parseInt(edge.src);
+        edge_obj.dst = parseInt(edge.dst);
+        edge_obj.srcConnector = null;
+        edge_obj.dstConnector = null;
+        g.addEdge(edge_obj, id);
+    });
+
+    return g;
+}
+
+function get_state_graph(sdfg_state, sdfg, sdfg_list, state_parent_list, omit_access_nodes) {
+    // layout the state as a render graph
+    const g = new RenderGraph();
+
+    // Add nodes to the graph. The first argument is the node id. The
+    // second is metadata about the node (label, width, height),
+    // which will be updated by dagre.layout (will add x,y).
+
+    // Process nodes hierarchically
+    let toplevel_nodes = sdfg_state.scope_dict[-1];
+    if (toplevel_nodes === undefined)
+        toplevel_nodes = Object.keys(sdfg_state.nodes);
+    g.drawn_nodes = new Set();
+    const hidden_nodes = new Map();
+
+    function layout_node(node) {
+        if (omit_access_nodes && node.type == 'AccessNode') {
+            // add access node to hidden nodes; source and destinations will be set later
+            hidden_nodes.set(node.id.toString(), { node: node, src: null, dsts: [] });
+            return;
+        }
+
+        let nested_g = null;
+        node.attributes.layout = {};
+
+        // Set connectors prior to computing node size
+        node.attributes.layout.in_connectors = node.attributes.in_connectors;
+        if ('is_collapsed' in node.attributes && node.attributes.is_collapsed && node.type !== 'NestedSDFG')
+            node.attributes.layout.out_connectors = find_exit_for_entry(sdfg_state.nodes, node).attributes.out_connectors;
+        else
+            node.attributes.layout.out_connectors = node.attributes.out_connectors;
+
+        const nodesize = calculateNodeSize(sdfg_state, node);
+        node.attributes.layout.width = nodesize.width;
+        node.attributes.layout.height = nodesize.height;
+        node.attributes.layout.label = node.label;
+
+        // Recursively add nested SDFGs
+        if (node.type === 'NestedSDFG' && !node.attributes.is_collapsed) {
+            nested_g = getSDFGGraph(node.attributes.sdfg, sdfg_list, state_parent_list, omit_access_nodes);
+        }
+
+        // Dynamically create node type
+        const obj = new SDFGElements[node.type]({ node: node, graph: nested_g }, node.id, sdfg, sdfg_state.id);
+
+        // If it's a nested SDFG, we need to record the node as all of its
+        // state's parent node
+        if (node.type === 'NestedSDFG')
+            state_parent_list[node.attributes.sdfg.sdfg_list_id] = obj;
+
+        // Add input connectors
+        let i = 0;
+        let conns;
+        if (Array.isArray(node.attributes.layout.in_connectors))
+            conns = node.attributes.layout.in_connectors;
+        else
+            conns = Object.keys(node.attributes.layout.in_connectors);
+        for (const cname of conns) {
+            const conn = new Connector({ name: cname }, i, sdfg, node.id);
+            obj.inConnectors.push(conn);
+            i += 1;
+        }
+
+        // Add output connectors -- if collapsed, uses exit node connectors
+        i = 0;
+        if (Array.isArray(node.attributes.layout.out_connectors))
+            conns = node.attributes.layout.out_connectors;
+        else
+            conns = Object.keys(node.attributes.layout.out_connectors);
+        for (const cname of conns) {
+            const conn = new Connector({ name: cname }, i, sdfg, node.id);
+            obj.outConnectors.push(conn);
+            i += 1;
+        }
+
+        g.addNode(obj, node.id);
+        g.drawn_nodes.add(node.id.toString());
+
+        // Recursively draw nodes
+        if (node.id in sdfg_state.scope_dict) {
+            if (node.attributes.is_collapsed)
+                return;
+            sdfg_state.scope_dict[node.id].forEach((nodeid) => {
+                const node = sdfg_state.nodes[nodeid];
+                layout_node(node);
+            });
+        }
+    }
+
+
+    toplevel_nodes.forEach((nodeid) => {
+        const node = sdfg_state.nodes[nodeid];
+        layout_node(node);
+    });
+
+    // add info to calculate shortcut edges
+    function add_edge_info_if_hidden(edge) {
+        const hidden_src = hidden_nodes.get(edge.src);
+        const hidden_dst = hidden_nodes.get(edge.dst);
+
+        if (hidden_src && hidden_dst) {
+            // if we have edges from an AccessNode to an AccessNode then just connect destinations
+            hidden_src.dsts = hidden_dst.dsts;
+            edge.attributes.data.attributes.shortcut = false;
+        } else if (hidden_src) {
+            // if edge starts at hidden node, then add it as destination
+            hidden_src.dsts.push(edge);
+            edge.attributes.data.attributes.shortcut = false;
+            return true;
+        } else if (hidden_dst) {
+            // if edge ends at hidden node, then add it as source
+            hidden_dst.src = edge;
+            edge.attributes.data.attributes.shortcut = false;
+            return true;
+        }
+
+        // if it is a shortcut edge, but we don't omit access nodes, then ignore this edge
+        if (!omit_access_nodes && edge.attributes.data.attributes.shortcut) return true;
+
+        return false;
+    }
+
+    sdfg_state.edges.forEach((edge, id) => {
+        if (add_edge_info_if_hidden(edge)) return;
+        edge = check_and_redirect_edge(edge, g.drawn_nodes, sdfg_state);
+        if (!edge) return;
+        const e = new Edge(edge.attributes.data, id, sdfg, sdfg_state.id);
+        edge.attributes.data.edge = e;
+        e.srcConnector = edge.src_connector || null;
+        e.dstConnector = edge.dst_connector || null;
+        e.src = parseInt(edge.src);
+        e.dst = parseInt(edge.dst);
+        g.addEdge(e, id);
+    });
+
+    hidden_nodes.forEach(hidden_node => {
+        if (hidden_node.src) {
+            hidden_node.dsts.forEach(e => {
+                // create shortcut edge with new destination
+                const tmp_edge = e.attributes.data.edge;
+                e.attributes.data.edge = null;
+                const shortcut_e = deepCopy(e);
+                e.attributes.data.edge = tmp_edge;
+                shortcut_e.src = hidden_node.src.src;
+                shortcut_e.src_connector = hidden_node.src.src_connector;
+                shortcut_e.dst_connector = e.dst_connector;
+                // attribute that only shortcut edges have; if it is explicitly false, then edge is ignored in omit access node mode
+                shortcut_e.attributes.data.attributes.shortcut = true;
+
+                // draw the redirected edge
+                const redirected_e = check_and_redirect_edge(shortcut_e, g.drawn_nodes, sdfg_state);
+                if (!redirected_e) return;
+
+                // abort if shortcut edge already exists
+                const edges = g.outEdges(redirected_e.src);
+                for (const oe of edges) {
+                    if (oe.w == e.dst && sdfg_state.edges[oe.name].dst_connector == e.dst_connector) {
+                        return;
+                    }
+                }
+
+                // add shortcut edge (redirection is not done in this list)
+                sdfg_state.edges.push(shortcut_e);
+
+                // add redirected shortcut edge to graph
+                const edge_id = sdfg_state.edges.length - 1;
+                const shortcut_edge = new Edge(deepCopy(redirected_e.attributes.data), edge_id, sdfg, sdfg_state.id);
+                shortcut_edge.srcConnector = redirected_e.src_connector || null;
+                shortcut_edge.dstConnector = redirected_e.dst_connector || null;
+                shortcut_edge.data.attributes.shortcut = true;
+
+                shortcut_edge.src = redirected_e.src;
+                shortcut_edge.dst = redirected_e.dst;
+
+                g.addEdge(shortcut_edge, edge_id);
+            });
+        }
+    });
+
+    return g;
+}
+
+
+function calculateNodeSize(sdfg_state, node) {
+    let labelsize = getTextMetrics(node.label).width;
+    let inconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.in_connectors).length - LINEHEIGHT;
+    let outconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.out_connectors).length - LINEHEIGHT;
+    let maxwidth = Math.max(labelsize, inconnsize, outconnsize);
+    let maxheight = 2 * LINEHEIGHT;
+    maxheight += 4 * LINEHEIGHT;
+
+    let size = { width: maxwidth, height: maxheight }
+
+    // add something to the size based on the shape of the node
+    if (node.type === "AccessNode") {
+        size.height -= 4 * LINEHEIGHT;
+        size.width += size.height;
+    }
+    else if (node.type.endsWith("Entry")) {
+        size.width += 2.0 * size.height;
+        size.height /= 1.75;
+    }
+    else if (node.type.endsWith("Exit")) {
+        size.width += 2.0 * size.height;
+        size.height /= 1.75;
+    }
+    else if (node.type === "Tasklet") {
+        size.width += 2.0 * (size.height / 3.0);
+        size.height /= 1.75;
+    }
+    else if (node.type === "LibraryNode") {
+        size.width += 2.0 * (size.height / 3.0);
+        size.height /= 1.75;
+    }
+    else if (node.type === "Reduce") {
+        size.height -= 4 * LINEHEIGHT;
+        size.width *= 2;
+        size.height = size.width / 3.0;
+    }
+    else {
+    }
+
+    return size;
+}
diff --git a/src/renderer/pixi/layouting/layouters/dummy_layouter.ts b/src/renderer/pixi/layouting/layouters/dummy_layouter.ts
new file mode 100644
index 00000000..72c09bf3
--- /dev/null
+++ b/src/renderer/pixi/layouting/layouters/dummy_layouter.ts
@@ -0,0 +1,58 @@
+import { SDFGData } from '../../../../utils/sdfg/types';
+import { CompleteLayout, LayoutElement } from '../layout';
+import { RenderLayouter } from './layouter';
+
+export class DummyLayouter implements RenderLayouter {
+    layout(sdfg: SDFGData): CompleteLayout {
+        const els: LayoutElement[] = [];
+        let nextEl = 0;
+
+        for (const state of sdfg.nodes) {
+            const scopeBegin = nextEl;
+            nextEl += 0.25;
+            for (const n of (state as any).nodes) {
+                els.push({
+                    type: 'node',
+                    zIndex: 1,
+                    caption: n.label,
+                    x: 500 * Math.random() + 20,
+                    y: nextEl++ * 50,
+                    width: 400,
+                    height: 40,
+                    shape: n.type.includes('Entry') ? 'upperHexagon'
+                        : n.type.includes('Exit') ? 'lowerHexagon'
+                            : n.type === 'AccessNode' ? 'ellipse' : 'octagon',
+                    stroke: 'normal',
+                });
+            }
+            // eslint-disable-next-line @typescript-eslint/no-unused-vars
+            for (const edge of (state as any).edges) {
+                const points = [[Math.random() * 1000, Math.random() * (nextEl - scopeBegin) * 50 + scopeBegin * 50], [Math.random() * 1000, Math.random() * (nextEl - scopeBegin) * 50 + scopeBegin * 50]];
+                for (let i = 0; i < Math.random() * 2; i++) {
+                    points.push([Math.random() * 1000, Math.random() * (nextEl - scopeBegin) * 50 + scopeBegin * 50]);
+                }
+                els.push({
+                    type: 'edge',
+                    zIndex: 2,
+                    points: points as any,
+                    lineStyle: Math.random() < 0.5 ? 'solid' : 'dotted',
+                    interstateColor: Math.random() < 0.5,
+                });
+            }
+            els.push({
+                type: 'state',
+                zIndex: 0,
+                x: 0,
+                width: 1000,
+                y: scopeBegin * 50,
+                height: (nextEl++ - scopeBegin) * 50,
+                caption: state.label,
+                isCollapsed: false,
+            });
+        }
+
+        return {
+            elements: els
+        };
+    }
+}
diff --git a/src/renderer/pixi/layouting/layouters/example_layouter.ts b/src/renderer/pixi/layouting/layouters/example_layouter.ts
new file mode 100644
index 00000000..037d775e
--- /dev/null
+++ b/src/renderer/pixi/layouting/layouters/example_layouter.ts
@@ -0,0 +1,154 @@
+import { SDFGData } from '../../../../utils/sdfg/types';
+import { RendererSettings } from '../../pixi_renderer';
+import { CompleteLayout } from '../layout';
+import { RenderLayouter } from './layouter';
+
+export class ExampleLayouter implements RenderLayouter {
+    layout(sdfg: SDFGData, settings: RendererSettings): CompleteLayout {
+        return {
+            elements: [
+                {
+                    type: 'node',
+                    zIndex: 1,
+                    x: 0,
+                    y: 0,
+                    width: 200,
+                    height: 40,
+                    caption: 'heyo',
+                    shape: 'octagon',
+                    stroke: 'normal',
+                    backgroundTemperature: settings.runtimeMap ? 0.2 : undefined,
+                },
+                {
+                    type: 'node',
+                    zIndex: 1,
+                    x: 0,
+                    y: 50,
+                    width: 200,
+                    height: 40,
+                    caption: 'hexaheyo',
+                    shape: 'upperHexagon',
+                    stroke: 'double',
+                    backgroundTemperature: settings.runtimeMap ? 0 : undefined,
+                },
+                {
+                    type: 'node',
+                    zIndex: 1,
+                    x: 0,
+                    y: 100,
+                    width: 200,
+                    height: 40,
+                    caption: 'hexalower',
+                    shape: 'lowerHexagon',
+                    stroke: 'normal',
+                },
+                {
+                    type: 'node',
+                    zIndex: 1,
+                    x: 0,
+                    y: 150,
+                    width: 200,
+                    height: 40,
+                    caption: 'ellipse (thick)',
+                    shape: 'ellipse',
+                    stroke: 'bold',
+                    backgroundTemperature: settings.runtimeMap ? 1.0 : undefined,
+                },
+                {
+                    type: 'state',
+                    zIndex: 0,
+                    x: -25,
+                    y: -50,
+                    width: 525,
+                    height: 550,
+                    caption: 'scopebig',
+                    isCollapsed: false,
+                },
+                {
+                    type: 'edge',
+                    zIndex: 1.2,
+                    points: [[0, 225], [200, 225]],
+                    lineStyle: 'solid',
+                    interstateColor: false,
+                },
+                {
+                    type: 'edge',
+                    zIndex: 1.2,
+                    points: [[0, 275], [100, 225], [200, 275]],
+                    lineStyle: 'solid',
+                    interstateColor: true,
+                    shadeTemperature: settings.memoryVolumeOverlay ? 0.45 : undefined,
+                    tooltip: {
+                        html: 'Interstate',
+                        style: 'interstate',
+                    },
+                },
+                {
+                    type: 'edge',
+                    zIndex: 1.2,
+                    points: [[0, 325], [67, 275], [133, 375], [200, 325]],
+                    lineStyle: 'dotted',
+                    interstateColor: false,
+                    shadeTemperature: settings.memoryVolumeOverlay ? 0.9 : undefined,
+                    tooltip: {
+                        html: 'This is an edge!',
+                        style: 'normal',
+                    },
+                },
+                {
+                    type: 'connector',
+                    zIndex: 1.1,
+                    x: 0,
+                    y: 225,
+                    radius: 5,
+                    scopedColor: false,
+                    tooltip: {
+                        html: 'Connector!',
+                        style: 'connector',
+                    },
+                },
+                {
+                    type: 'connector',
+                    zIndex: 1.1,
+                    x: 200,
+                    y: 225,
+                    radius: 5,
+                    scopedColor: false,
+                },
+                {
+                    type: 'connector',
+                    zIndex: 1.1,
+                    x: 0,
+                    y: 275,
+                    radius: 5,
+                    scopedColor: true,
+                },
+                {
+                    type: 'connector',
+                    zIndex: 1.1,
+                    x: 200,
+                    y: 275,
+                    radius: 5,
+                    scopedColor: true,
+                },
+                {
+                    type: 'connector',
+                    zIndex: 1.1,
+                    x: 0,
+                    y: 325,
+                    radius: 5,
+                    scopedColor: true,
+                },
+                {
+                    type: 'connector',
+                    zIndex: 1.1,
+                    x: 200,
+                    y: 325,
+                    radius: 5,
+                    scopedColor: false,
+                },
+            ],
+        };
+    }
+
+}
diff --git a/src/renderer/pixi/layouting/layouters/layouter.ts b/src/renderer/pixi/layouting/layouters/layouter.ts
new file mode 100644
index 00000000..6e758ef5
--- /dev/null
+++ b/src/renderer/pixi/layouting/layouters/layouter.ts
@@ -0,0 +1,8 @@
+import { SDFGData } from '../../../../utils/sdfg/types';
+import { SymbolResolver } from '../../../../utils/symbol_resolver';
+import { RendererSettings } from '../../pixi_renderer';
+import { CompleteLayout } from '../layout';
+
+export type RenderLayouter = {
+    layout(sdfg: SDFGData, settings: RendererSettings, symbolResolver: SymbolResolver): CompleteLayout,
+};
diff --git a/src/renderer/pixi/layouting/render_layout_element.ts b/src/renderer/pixi/layouting/render_layout_element.ts
new file mode 100644
index 00000000..31798b02
--- /dev/null
+++ b/src/renderer/pixi/layouting/render_layout_element.ts
@@ -0,0 +1,445 @@
+import { LayoutElement } from './layout';
+import * as PIXI from 'pixi.js';
+import { overlayColors, stringToColor } from '../../../utils/colors';
+import { getTemperatureRGBHex } from '../../../utils/colors';
+
+/**
+ * Display state for an object
+ */
+export type LayoutElementDisplayState = 'normal' | 'hover' | 'highlighted';
+
+/**
+ * The larger this constant, the larger the non-acute angle(s) of rendered polygons (1 = 135°)
+ */
+const POLYGON_DENT_SIZE = 1;
+
+/**
+ * The value added to the z index (order) of the rendered elements. All values should be in (0, 1)
+ */
+const Z_INCREMENTS = {
+    type: {
+        state: 0.1,
+        edgeShade: 0.15,
+        node: 0.2,
+        connector: 0.3,
+        edge: 0.4,
+    },
+
+    label: 0.0001,
+    selected: 0.001,
+    displayState: {
+        normal: 0,
+        highlighted: 0.002,
+        hover: 0.004,
+    },
+} as const;
+
+const ARROW_LENGTH = 15;
+const ARROW_WIDTH = 10;
+const COLLAPSED_STATE_PLUS_SIZE = 32;
+
+const getTextStyle = (scale = 1): Partial<PIXI.ITextStyle> => ({
+    fontSize: 14 * scale,
+    fontFamily: ['ui-monospace', 'monospace']
+});
+
+export function getTextMetrics(text: string): PIXI.TextMetrics {
+    if (typeof text !== 'string') {
+        console.error('Parameter not a string!', text);
+        throw new Error('Parameter not a string! ' + typeof text);
+    }
+    return PIXI.TextMetrics.measureText(text, new PIXI.TextStyle(getTextStyle()));
+}
+
+export type RenderedLayoutElement = {
+    layoutElement: LayoutElement,
+    always: PIXI.DisplayObject[],
+    far: PIXI.DisplayObject[],
+    near: PIXI.DisplayObject[],
+    hitbox: PIXI.Rectangle,
+};
+
+export function getAllDisplayObjects(rendered: RenderedLayoutElement): PIXI.DisplayObject[] {
+    return [...rendered.always, ...rendered.far, ...rendered.near];
+}
+
+export function renderLayoutElement(
+    el: LayoutElement,
+    style: CSSStyleDeclaration,
+    settings: {
+        displayState: LayoutElementDisplayState,
+        isSelected: boolean,
+        detailMode: 'detailed' | 'normal' | 'quick',
+    }
+): RenderedLayoutElement {
+    const createReturn = (arr: PIXI.DisplayObject[]) => ({
+        layoutElement: el,
+        always: arr,
+        far: [],
+        near: [],
+        hitbox: arr.map(obj => {
+            const bounds = obj.getLocalBounds();
+            bounds.x += obj.x;
+            bounds.y += obj.y;
+            return bounds;
+        }).reduce((a, b) => a.enlarge(b)),
+    });
+
+    const col = (s: string, alt: string) => stringToColor(style.getPropertyValue(s) || alt);
+    const textStyle = (s: string, alt: string, scale = 1) => ({ ...getTextStyle(scale), fill: col(s, alt)[0] });
+
+
+    const quickMode = {
+        detailed: false,
+        normal: false,
+        quick: true,
+    }[settings.detailMode];
+
+    const textResolution = {
+        detailed: 10,
+        normal: 2,
+        quick: 0.2,
+    }[settings.detailMode];
+
+    const zIncr = Z_INCREMENTS.displayState[settings.displayState]
+        + (settings.isSelected ? Z_INCREMENTS.selected : 0);
+
+    const specialDisplayColor = (!settings.isSelected ? {
+        normal: null,
+        hover: col('--color-hovered', 'green'),
+        highlighted: col('--color-highlighted', 'orange'),
+    } : {
+        normal: col('--color-selected', 'red'),
+        hover: col('--color-selected-hovered', 'salmon'),
+        highlighted: col('--color-selected-highlighted', 'darkorange'),
+    })[settings.displayState];
+
+
+    switch (el.type) {
+        case 'state': {
+            const gfx = new PIXI.Graphics();
+            gfx.zIndex = el.zIndex + Z_INCREMENTS.type.state + zIncr;
+            gfx.x = el.x;
+            gfx.y = el.y;
+            gfx.beginFill(...col('--state-background-color', '#ccf0ff'));
+            if (specialDisplayColor) gfx.lineStyle(1, ...specialDisplayColor);
+            gfx.drawRect(0, 0, el.width, el.height);
+
+            if (el.isCollapsed) {
+                gfx.lineStyle(2, ...col('--state-foreground-color', 'black'));
+                gfx.moveTo(el.width / 2, el.height / 2 - COLLAPSED_STATE_PLUS_SIZE / 2);
+                gfx.lineTo(el.width / 2, el.height / 2 + COLLAPSED_STATE_PLUS_SIZE / 2);
+                gfx.moveTo(el.width / 2 - COLLAPSED_STATE_PLUS_SIZE / 2, el.height / 2);
+                gfx.lineTo(el.width / 2 + COLLAPSED_STATE_PLUS_SIZE / 2, el.height / 2);
+            }
+
+            const text = new PIXI.Text(el.caption, textStyle('--state-foreground-color', 'black'));
+            text.resolution *= textResolution;
+            text.x = 2;
+            text.y = 2;
+            gfx.addChild(text);
+
+            return createReturn([gfx]);
+        }
+        case 'node': {
+            const gfx = new PIXI.Graphics();
+            gfx.zIndex = el.zIndex + Z_INCREMENTS.type.node;
+            gfx.x = el.x;
+            gfx.y = el.y;
+
+            let bgColor = col('--node-background-color', 'white');
+            if (el.backgroundTemperature !== undefined) {
+                bgColor = overlayColors(bgColor, [getTemperatureRGBHex(el.backgroundTemperature), 0.6]);
+            }
+
+            const strokeSize = {
+                normal: 1,
+                double: 1.5,
+                bold: 2.5,
+            }[el.stroke];
+            const toDraw = [
+                [0, 0, el.width, el.height, strokeSize] as const,
+                ...el.stroke !== 'double' ? []
+                    : [[2.5, 2.5, el.width - 5, el.height - 5, 1]] as const,
+            ];
+
+            for (const [x, y, w, h, stroke] of toDraw) {
+                const drawTranslatedPolygon = (...points: number[]) => {
+                    gfx.drawPolygon(
+                        points.map((p, i) => p + (i % 2 === 0 ? x : y)),
+                    );
+                };
+
+                gfx.beginFill(...bgColor);
+                gfx.lineStyle(stroke, ...specialDisplayColor ?? col('--node-foreground-color', 'black'));
+                switch (el.shape) {
+                    case 'ellipse': {
+                        const hw = w / 2;
+                        const hh = h / 2;
+                        gfx.drawEllipse(x + hw, y + hh, hw, hh);
+                        break;
+                    }
+                    case 'octagon': {
+                        const dent = Math.min(w / 2, POLYGON_DENT_SIZE * h / 2);
+                        drawTranslatedPolygon(
+                            dent, 0,
+                            0, h / 3,
+                            0, 2 * h / 3,
+                            dent, h,
+                            w - dent, h,
+                            w, 2 * h / 3,
+                            w, h / 3,
+                            w - dent, 0,
+                        );
+                        break;
+                    }
+                    case 'hexagon': {
+                        const dent = Math.min(w / 2, POLYGON_DENT_SIZE * h);
+                        drawTranslatedPolygon(
+                            dent, 0,
+                            0, h / 2,
+                            dent, h,
+                            w - dent, h,
+                            w, h / 2,
+                            w - dent, 0,
+                        );
+                        break;
+                    }
+                    case 'upperHexagon': {
+                        const dent = Math.min(w / 2, POLYGON_DENT_SIZE * h);
+                        drawTranslatedPolygon(
+                            dent, 0,
+                            w - dent, 0,
+                            w, h,
+                            0, h,
+                        );
+                        break;
+                    }
+                    case 'lowerHexagon': {
+                        const dent = Math.min(w / 2, POLYGON_DENT_SIZE * h);
+                        drawTranslatedPolygon(
+                            0, 0,
+                            w, 0,
+                            w - dent, h,
+                            dent, h,
+                        );
+                        break;
+                    }
+                    case 'triangle': {
+                        drawTranslatedPolygon(
+                            0, 0,
+                            w, 0,
+                            w / 2, h,
+                        );
+                        break;
+                    }
+                    case 'rectangle': {
+                        gfx.drawRect(
+                            x, y,
+                            w, h,
+                        );
+                        break;
+                    }
+                    default: {
+                        throw new Error(`Unknown shape ${el.shape}!`);
+                    }
+                }
+            }
+
+            const createText = ((distance: 'always' | 'near' | 'far') => {
+                if ((el.farCaption === undefined) !== (distance === 'always')) return [];
+
+                const textPosition = el.shape === 'triangle' ? 0.25 : 0.5;
+                const caption = distance === 'far' ? el.farCaption! : el.caption;
+                const fontSizeScale = distance === 'far' ? 1.8 : 1;
+
+                const text = new PIXI.Text(caption, textStyle('--node-foreground-color', 'black', fontSizeScale));
+                text.resolution *= textResolution;
+                text.zIndex = gfx.zIndex + Z_INCREMENTS.label;
+                text.x = el.x + el.width / 2 - text.width / 2;
+                text.y = el.y + el.height * textPosition - text.height / 2;
+                return [text];
+            });
+
+            const bounds = gfx.getLocalBounds();
+            bounds.x += gfx.x;
+            bounds.y += gfx.y;
+
+            return {
+                layoutElement: el,
+                always: [gfx, ...createText('always')],
+                near: createText('near'),
+                far: createText('far'),
+                hitbox: bounds,
+            };
+        }
+        case 'connector': {
+            const color = el.scopedColor ? col('--connector-scoped-color', 'white')
+                : col('--connector-unscoped-color', '#c1dfe690');
+
+            const gfx = new PIXI.Graphics();
+            gfx.zIndex = el.zIndex + Z_INCREMENTS.type.connector;
+            gfx.x = el.x;
+            gfx.y = el.y;
+            gfx.beginFill(...color);
+            gfx.lineStyle(1, ...specialDisplayColor ?? col('--node-foreground-color', 'black'));
+            gfx.drawCircle(0, 0, el.radius);
+            return createReturn([gfx]);
+        }
+        case 'edge': {
+            const ps = el.points;
+
+            const edgeColor = el.interstateColor ? col('--interstate-edge-color', '#86add9')
+                : col('--color-default', 'black');
+
+            // Define colors used to draw the arrow
+            const styles: [
+                extraWidth: number,
+                color: [rgbHex: number, alpha: number],
+                zIncr: number
+            ][] = [[
+                0,
+                specialDisplayColor ?? edgeColor,
+                Z_INCREMENTS.type.edge
+            ]];
+            if (el.shadeTemperature !== undefined) {
+                styles.push([
+                    6,
+                    [getTemperatureRGBHex(el.shadeTemperature), 0.6],
+                    Z_INCREMENTS.type.edgeShade
+                ]);
+            }
+
+            // Compute tangent at the end point
+            const lp = ps[ps.length - 1];
+            const slp = ps[ps.length - 2];
+            const tangent = [
+                lp[0] - slp[0],
+                lp[1] - slp[1],
+            ];
+
+            // Normalize tangent
+            const tl = Math.sqrt(tangent[0] ** 2 + tangent[1] ** 2);
+            tangent[0] /= tl;
+            tangent[1] /= tl;
+
+            // Normal is orthogonal to tangent
+            const normal = [
+                -tangent[1],
+                tangent[0],
+            ];
+
+            // Draw the arrow (and its shade)
+            const gfxs = styles.map(([extraWidth, color, zIncr]) => {
+                const gfx = new PIXI.Graphics();
+                gfx.zIndex = el.zIndex + zIncr;
+
+                const lineStyle = {
+                    color: color[0],
+                    alpha: color[1],
+                    cap: !quickMode && extraWidth > 0 ? PIXI.LINE_CAP.ROUND : PIXI.LINE_CAP.BUTT,
+                    join: !quickMode && extraWidth > 0 ? PIXI.LINE_JOIN.ROUND : PIXI.LINE_JOIN.MITER,
+                };
+
+                // Draw line
+                gfx.lineStyle({
+                    width: 1 + extraWidth,
+                    ...lineStyle,
+                });
+                if (ps.length < 2) {
+                    throw new Error('Need at least two points to draw an arrow!');
+                }
+                gfx.moveTo(...ps[0]);
+                switch (ps.length) {
+                    case 2: {
+                        gfx.lineTo(...ps[1]);
+                        break;
+                    }
+                    case 3: {
+                        gfx.quadraticCurveTo(...ps[1], ...ps[2]);
+                        break;
+                    }
+                    case 4: {
+                        gfx.bezierCurveTo(...ps[1], ...ps[2], ...ps[3]);
+                        break;
+                    }
+                    default: {
+                        let i;
+                        for (i = 1; i < ps.length - 2; i++) {
+                            const xm = (ps[i][0] + ps[i + 1][0]) / 2.0;
+                            const ym = (ps[i][1] + ps[i + 1][1]) / 2.0;
+                            gfx.quadraticCurveTo(...ps[i], xm, ym);
+                        }
+                        gfx.quadraticCurveTo(...ps[i], ...ps[i + 1]);
+                        break;
+                    }
+                }
+
+                // Draw triangle
+                const aw = ARROW_WIDTH;
+                const al = ARROW_LENGTH;
+                gfx.lineStyle({
+                    width: extraWidth,
+                    ...lineStyle,
+                });
+                gfx.beginFill(color[0]);
+                gfx.drawPolygon(
+                    ...lp,
+                    lp[0] - al * tangent[0] + aw / 2 * normal[0], lp[1] - al * tangent[1] + aw / 2 * normal[1],
+                    lp[0] - al * tangent[0] - aw / 2 * normal[0], lp[1] - al * tangent[1] - aw / 2 * normal[1],
+                );
+                gfx.endFill();
+
+                // Collision detection
+                const collisionDistance = ARROW_WIDTH;
+                let curvePoints: number[][] = [];
+                let curveLines: [[number, number], [number, number]][] = [];
+                let collisionBoundingBox = new PIXI.Rectangle(0, 0, 0, 0);
+                gfx.hitArea = {
+                    contains: (x, y) => {
+                        // before the first render, curvePoints is empty, so recompute it if that's the case
+                        if (curvePoints.flat().length === 0) {
+                            curvePoints = gfx.geometry.graphicsData.map(data => data.points);
+                            curveLines = curvePoints.flatMap(linePoints => {
+                                const res: [[number, number], [number, number]][] = [];
+                                for (let i = 0; i < linePoints.length - 3; i += 2) {
+                                    res.push([[linePoints[i], linePoints[i + 1]], [linePoints[i + 2], linePoints[i + 3]]]);
+                                }
+                                return res;
+                            });
+                            if (curvePoints.length > 0) {
+                                const allX = curvePoints.flat().filter((_, i) => i % 2 === 0);
+                                const allY = curvePoints.flat().filter((_, i) => i % 2 === 1);
+                                const minX = Math.min(...allX) - collisionDistance;
+                                const minY = Math.min(...allY) - collisionDistance;
+                                const maxX = Math.max(...allX) + collisionDistance;
+                                const maxY = Math.max(...allY) + collisionDistance;
+                                collisionBoundingBox = new PIXI.Rectangle(minX, minY, maxX - minX, maxY - minY);
+                            }
+                        }
+
+                        if (!collisionBoundingBox.contains(x, y)) {
+                            return false;
+                        }
+
+                        return curveLines.some(([p1, p2]) => {
+                            const sq = (x: number) => x * x;
+                            const distSq = (a: [number, number], b: [number, number]) => sq(a[0] - b[0]) + sq(a[1] - b[1]);
+
+                            const lineLength = distSq(p1, p2);
+                            const t = ((x - p1[0]) * (p2[0] - p1[0]) + (y - p1[1]) * (p2[1] - p1[1])) / lineLength;
+                            const tClamped = Math.max(0, Math.min(1, t));
+                            const distToLineSq = distSq([x, y], [p1[0] + tClamped * (p2[0] - p1[0]), p1[1] + tClamped * (p2[1] - p1[1])]);
+
+                            return distToLineSq <= sq(collisionDistance / 2);
+                        });
+                    },
+                };
+
+                return gfx;
+            });
+
+            return createReturn(gfxs);
+        }
+    }
+}
diff --git a/src/renderer/pixi/pixi_renderer.ts b/src/renderer/pixi/pixi_renderer.ts
new file mode 100644
index 00000000..8c23b2ca
--- /dev/null
+++ b/src/renderer/pixi/pixi_renderer.ts
@@ -0,0 +1,1398 @@
+// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
+
+import { SDFGData } from '../../utils/sdfg/types';
+import * as PIXI from 'pixi.js';
+import { CompleteLayout, EdgeLayoutElement, LayoutElement } from './layouting/layout';
+import { getAllDisplayObjects, LayoutElementDisplayState, RenderedLayoutElement, renderLayoutElement } from './layouting/render_layout_element';
+import { RenderLayouter } from './layouting/layouters/layouter';
+import { ExampleLayouter } from './layouting/layouters/example_layouter';
+import { DummyLayouter } from './layouting/layouters/dummy_layouter';
+import { ComplexLayouter } from './layouting/layouters/complex_layouter/complex_layouter';
+import SugiyamaLayouter from '../../layouting/layouter/sugiyamaLayouter';
+import LLayouter from '../../layouting/layouter/layouter';
+import DagreLayouter from '../../layouting/layouter/dagreLayouter';
+import MagneticSpringLayouter from '../../layouting/layouter/magneticSpringLayouter';
+import { stringToColor } from '../../utils/colors';
+import { createSpinner } from '../../utils/loading_spinner';
+import { createToolbar } from './toolbar';
+import { SymbolResolver } from '../../utils/symbol_resolver';
+import { arrayEquals, setEquals } from '../../utils/utils';
+import RenderGraph from '../../layouting/renderGraph/renderGraph';
+// eslint-disable-next-line camelcase
+import { traverse_sdfg } from '../../utils/sdfg/traversal';
+import { pixiObjectToPdf } from '../../utils/pdf';
+import { htmlSanitize } from '../../utils/sanitization';
+
+const DETAILED_MODE_MAX_ELEMENTS = 500;
+
+const ANIMATION_DURATION = 1000;
+const ANIMATION_FUNCTION = (t: number) => 1 - Math.pow(1 - t, 3);  // cubic ease out
+
+const FAR_ELEMENTS_SCALE_THRESHOLD = 0.6;
+
+export const DefaultLayouters = {
+    sugiyama: new ComplexLayouter(new SugiyamaLayouter({ shuffles: 0, shuffleGlobal: false, optimizeAngles: false, bundle: false })),
+    dagre: new ComplexLayouter(new DagreLayouter()),
+    dummy: new DummyLayouter(),
+    example: new ExampleLayouter(),
+    magneticSpring: new ComplexLayouter(new MagneticSpringLayouter()),
+};
+
+const mouseEventTypes = new Set([
+    'mousedown',
+    'mousemove',
+    'mouseup',
+    /*'touchstart',
+    'touchmove',
+    'touchend',*/
+    'wheel',
+    'click',
+    'dblclick',
+    'contextmenu',
+] as const);
+
+
+/**
+ * A renderer implementation using PixiJS.
+ */
+export class PixiRenderer {
+    /* # CONTAINER LAYOUT
+     * 
+     * The container layout is:
+     * 
+     * ```
+     * - `app.stage`
+     *   - `viewport` (scaled & positioned)
+     *     - `pixiContainer`
+     *       - `<...primary RenderedLayoutElements...>` (positioned)
+     *       - `<...transient RenderedLayoutElements...>` (positioned)
+     *   - `minimap.container` (positioned)
+     *     - `minimap.elements` (scaled)
+     *       - `minimap.focus` (positioned)
+     *       - `<...minimap RenderedLayoutElements...>` (positioned)
+     *     - `minimap.minimapOutline`
+     *     - `minimap.focusOutline` (positioned)
+     *   - `selectionRect`
+     * ```
+     * 
+     * Containers that aren't positioned have `x = y = 0`; containers that aren't
+     * scaled have `scale.x = scale.y = 1`. The implementation will break if you
+     * try to position/scale a container that is not marked as such (eg. by setting
+     * `pixiContainer.x/y`). However, you are free to add new containers as children
+     * of other containers.
+     * 
+     * There is a distinction between primary RenderedLayoutElements and transient
+     * RenderedLayoutElements. Given a layout element, there is exactly one primary
+     * RenderedLayoutElement for it. However, each layout element may have any number
+     * of transient RenderedLayoutElements (possibly zero).
+     * 
+     * Notably, while primary RenderedLayoutElements are created with the first render
+     * frame, transient RenderedLayoutElements can be created on-the-fly. This makes
+     * them useful for selection/hovering/highlighting (which is currently the only
+     * place where we create them); a vast majority of nodes in a large graph will
+     * never be hovered over.
+     * 
+-----------------------------------------------------------------------------------------
+     * # SDFG -> your screen
+     * 
+     * Below is a high-level overview of how PixiRenderer processes the SDFG input. In
+     * square brackets are variable names that may be used for objects of that type.
+     * 
+     * ```
+     * SDFG input [sdfg, sdfgData, ...]: Raw SDFG POJO parsed from the .sdfg file.
+     *     |
+     *     | relayoutSDFG using an LLayouter (from layouter_dir)
+     *     V
+     * RenderGraph [renderData, getRenderGraph, node, ...]: A graph with SDFGElement nodes
+     *                                                      and position/size information.
+     *     |
+     *     | ComplexLayouter
+     *     V
+     * LayoutElement[] [el, element, ...]: A flat strongly typed list with all objects and
+     *                                     how to render them.
+     *     |
+     *     | renderLayoutElement
+     *     V
+     * RenderedLayoutElement[] [rendered, ...]: Objects containing the actual PixiJS objects.
+     *     |
+     *     | PixiRenderer.prepareContainerForRender
+     *     V
+     * PIXI.DisplayObject [pixiContainer]: A container for all the PixiJS objects.
+     *     |                                            |
+     *     | PixiJS                                     | pixiObjectToPdf
+     *     V                                            V
+     * Whatever you see on the screen! :)            HTML5 Canvas [ctx, ...]
+     *                                                  |
+     *                                                  | canvas2pdf
+     *                                                  V
+     *                                               PDF file
+     * ```
+     */
+
+    private renderGraph: RenderGraph | undefined;
+
+    private readonly app: PIXI.Application;
+    private readonly symbolResolver: SymbolResolver;
+
+    private readonly viewport: PIXI.Container;
+    private pixiContainer: PIXI.Container | undefined;
+    private minimap: {
+        container: PIXI.Container,
+        elements: PIXI.Container,
+        focus: PIXI.Graphics,
+        focusOutline: PIXI.Graphics,
+        minimapOutline: PIXI.Graphics,
+        renderedElements: Map<LayoutElement, RenderedLayoutElement>,
+    } | undefined;
+    private selectionRect: PIXI.Graphics;
+
+    private dragDetails: DragDetails | null = null;
+    private nextClickIsDrag = false;
+
+    private selection: ElementSelection = createEmptyElementSelection();
+
+    private isAboutToRedraw: Promise<void> | false = false;
+    private isCurrentlyRelayouting: Promise<void> | false = false;
+
+    private shouldResize = false;
+    private renderCache = {
+        /** Local bounds of the container that contains all the elements */
+        containerBounds: null as PIXI.Rectangle | null,
+        /** Map containing all layout elements as keys, and the corresponding primary RLE as values */
+        layoutElements: new Map<LayoutElement, RenderedLayoutElement>(),
+        /** Contains all primary and transient display objects with the corresponding layout element */
+        pixiObjects: new Map<PIXI.DisplayObject, LayoutElement>(),
+        /** Contains all primary and transient RLEs */
+        allRendered: new Set<RenderedLayoutElement>(),
+        /** All layout elements grouped by their highlighting group (if they have one) */
+        highlightingGroups: new Map<unknown, Set<LayoutElement>>(),
+        /** The computed CSS style declaration of the renderer */
+        compStyle: undefined as any as CSSStyleDeclaration,
+    };
+
+    private viewportAnimation: {
+        startTime: number | 'now',
+        duration: number,
+        startViewport: [pos: StageCoordinates, scale: number],
+        targetViewport: [pos: StageCoordinates, scale: number],
+    } | null = null;
+
+    private destructors: (() => void)[] = [];
+    private settingsChangeListeners: ((settings: RendererSettings) => void)[] = [];
+
+    private settings: RendererSettings = {
+        inclusiveRanges: false,
+        memoryVolumeOverlay: false,
+        omitAccessNodes: false,
+        moveMode: 'pan',
+        runtimeMap: null,
+    };
+
+    private tooltipContainer: HTMLElement;
+    private interactionInfoContainer: HTMLElement;
+
+    /**
+     * Creates a new PixiJS renderer.
+     * 
+     *
+     * Note that this constructor does not accept raw renderers from src/layouting - instead, wrap those in a
+     * {@link ComplexLayouter} first.
+     * 
+     * @param container The HTML element to create the canvas in. Should be positioned (so either
+     * `position: relative` or `absolute`)
+     */
+    constructor(
+        private readonly sdfg: SDFGData,
+        private readonly container: HTMLElement,
+        private readonly mouseHandler: MouseEventHandler | null = null,
+        public readonly debugDraw = false,
+        private readonly layouter: RenderLayouter = DefaultLayouters.sugiyama,
+    ) {
+        if (layouter instanceof LLayouter) {
+            throw new Error('Layouter must be of type RenderLayouter (in src/renderer/pixi), not Layouter (in src/layouting)! Try wrapping the layouter in a ComplexLayouter');
+        }
+
+        // Initialize PixiJS
+        this.app = new PIXI.Application({
+            autoDensity: true,
+            resolution: window.devicePixelRatio,
+            resizeTo: this.container,
+            backgroundAlpha: 0,
+            autoStart: false,
+            sharedTicker: false,
+        });
+        this.viewport = new PIXI.Container();
+        this.app.stage.addChild(this.viewport);
+        this.selectionRect = new PIXI.Graphics();
+        this.app.stage.addChild(this.selectionRect);
+        container.appendChild(this.app.view);
+        container.appendChild(createToolbar(this));
+
+        // Create tooltip container
+        this.tooltipContainer = document.createElement('div');
+        this.tooltipContainer.className = 'sdfvtooltip';
+        this.container.appendChild(this.tooltipContainer);
+
+        // Create interaction info container
+        this.interactionInfoContainer = document.createElement('div');
+        Object.assign(this.interactionInfoContainer.style, {
+            position: 'absolute',
+            bottom: '.5rem',
+            left: '.5rem',
+            backgroundColor: 'rgba(0, 0, 0, 0.5)',
+            borderRadius: '5px',
+            padding: '.3rem',
+            display: 'none',
+            color: '#eeeeee',
+        });
+        this.container.appendChild(this.interactionInfoContainer);
+
+        // Create symbol resolver
+        this.symbolResolver = new SymbolResolver(sdfg);
+
+        // Register event handlers
+        this.registerHandlers();
+
+        // Start initial layout
+        (async () => {
+            await this.resetLayoutAsync();
+        })();
+    }
+
+    /**
+     * Redraws now, not waiting for the next animation frame. Use redrawAsync() instead
+     */
+    private redrawNow(timestamp: number): void {
+        if (this.isCurrentlyRelayouting) {
+            // Try redrawing next frame
+            this.redrawAsync();
+            return;
+        }
+
+        if (this.shouldResize) {
+            this.app.resize();
+        }
+
+        this.prepareViewportForRender(timestamp);
+        this.prepareContainerForRender();
+        this.prepareMinimapForRender();
+        this.app.render();
+    }
+
+    private prepareViewportForRender(timestamp: number): void {
+        if (this.viewportAnimation) {
+            const anim = this.viewportAnimation;
+            if (anim.startTime === 'now') {
+                anim.startTime = timestamp;
+            }
+            const complete = Math.min(1, (timestamp - anim.startTime) / anim.duration);
+            const r = ANIMATION_FUNCTION(complete);
+
+            // Calculate interpolated viewport
+            const as = anim.startViewport;
+            const at = anim.targetViewport;
+            this.viewport.x = as[0][0] * (1 - r) + at[0][0] * r;
+            this.viewport.y = as[0][1] * (1 - r) + at[0][1] * r;
+            this.viewport.scale.x = this.viewport.scale.y = as[1] * (1 - r) + at[1] * r;
+
+            if (complete >= 1) {
+                this.viewportAnimation = null;
+            } else {
+                this.redrawAsync();
+            }
+        }
+    }
+
+    private prepareContainerForRender() {
+        const toHide = new Set<PIXI.DisplayObject>();
+
+        // Update selected elements
+        if (this.selection.hasChanged) {
+            // Remove old selection objects
+            for (const rendered of this.selection.selectionPixiObjects) {
+                this.removeTransientRenderedLayoutElement(rendered);
+            }
+
+            // Show the Pixi objects that were hidden for the old selection
+            for (const rendered of this.selection.hiddenPixiObjects) {
+                getAllDisplayObjects(rendered).forEach(obj => obj.visible = true);
+            }
+
+            // Create a map containing all selected elements and their display attributes
+            const selectedElements = new Map<LayoutElement, {
+                isSelected: boolean,
+                displayState: LayoutElementDisplayState,
+            }>();
+            for (const el of [...this.selection.selected, ...this.selection.hovered, ...this.selection.highlighted]) {
+                selectedElements.set(el, {
+                    isSelected: false,
+                    displayState: 'normal',
+                });
+            }
+
+            // Set display attributes
+            this.selection.selected.forEach(el => selectedElements.get(el)!.isSelected = true);
+            this.selection.highlighted.forEach(el => selectedElements.get(el)!.displayState = 'highlighted');
+            this.selection.hovered.forEach(el => selectedElements.get(el)!.displayState = 'hover');
+
+            // Create new Pixi objects
+            const selectionPixiObjects = [];
+            for (const [el, attrs] of selectedElements.entries()) {
+                const rendered = renderLayoutElement(el, this.renderCache.compStyle, {
+                    ...attrs,
+                    detailMode: isDetailed(this.renderCache.layoutElements.size) ? 'detailed' : 'normal',
+                });
+                this.addTransientRenderedLayoutElement(rendered);
+                selectionPixiObjects.push(rendered);
+            }
+            this.pixiContainer?.sortChildren();
+
+            // Hide selected Pixi objects
+            const hiddenPixiObjects = [];
+            for (const el of selectedElements.keys()) {
+                const rendered = this.renderCache.layoutElements.get(el)!;
+                hiddenPixiObjects.push(rendered);
+                getAllDisplayObjects(rendered).forEach(obj => toHide.add(obj));
+            }
+
+            // Update selection variable
+            this.selection = {
+                ...this.selection,
+                hiddenPixiObjects,
+                selectionPixiObjects,
+                hasChanged: false,
+            };
+        }
+
+        // Redraw selection rectangle
+        if (this.dragDetails?.type === 'select') {
+            const computedStyle = this.renderCache.compStyle;
+            this.selectionRect.visible = true;
+            this.selectionRect.clear();
+            this.selectionRect.lineStyle(1, ...stringToColor(computedStyle.getPropertyValue('--selection-rect-color')));
+            this.selectionRect.beginFill(...stringToColor(computedStyle.getPropertyValue('--selection-rect-fill')));
+            this.selectionRect.drawRect(
+                ...this.dragDetails.dragStart,
+                this.dragDetails.lastTick[0] - this.dragDetails.dragStart[0],
+                this.dragDetails.lastTick[1] - this.dragDetails.dragStart[1],
+            );
+        } else {
+            this.selectionRect.visible = false;
+        }
+
+        // Update near/far elements
+        const isFar = this.viewport.scale.x < FAR_ELEMENTS_SCALE_THRESHOLD;
+        for (const rendered of this.renderCache.allRendered) {
+            for (const obj of rendered.near) {
+                if (toHide.has(obj)) continue;
+                obj.visible = !isFar;
+            }
+            for (const obj of rendered.far) {
+                if (toHide.has(obj)) continue;
+                obj.visible = isFar;
+            }
+        }
+
+        // Hide objects that should be hidden
+        toHide.forEach(l => l.visible = false);
+    }
+
+
+    private prepareMinimapForRender() {
+        const viewSize = this.getViewSize();
+        const containerBounds = this.getContainerBounds();
+
+        if (this.minimap) {
+            const { container, elements, focus, focusOutline, minimapOutline } = this.minimap;
+            const computedStyle = this.renderCache.compStyle;
+
+            // Draw focus
+            const unscaledFocusRect = [
+                -this.viewport.x / this.viewport.scale.x,  // leftX
+                -this.viewport.y / this.viewport.scale.y,  // topY
+                viewSize[0] / this.viewport.scale.x,       // width
+                viewSize[1] / this.viewport.scale.y,       // height
+            ] as const;
+            focus.clear();
+            focus.beginFill(...stringToColor(computedStyle.getPropertyValue('--minimap-focus-fill')));
+            focus.drawRect(...unscaledFocusRect);
+
+
+            // getLocalBounds() is slow, so we manually compute the coordinates
+            const elementsLocalBounds = [
+                Math.min(containerBounds.left, unscaledFocusRect[0]),  // leftX
+                Math.min(containerBounds.top, unscaledFocusRect[1]),  // topY
+                Math.max(containerBounds.right, unscaledFocusRect[0] + unscaledFocusRect[2]),   // rightX
+                Math.max(containerBounds.bottom, unscaledFocusRect[1] + unscaledFocusRect[3]),  // bottomY
+            ] as const;
+
+            // Rescale elements & focus (but not focus outline, which is in `container`, not `elements`)
+            if (this.dragDetails?.type !== 'minimap') {  // don't rescale if we're currently dragging the minimap
+                elements.scale.x = elements.scale.y = Math.min(
+                    0.25,
+                    0.15 * viewSize[0] / (elementsLocalBounds[2] - elementsLocalBounds[0]),
+                    viewSize[1] / (elementsLocalBounds[3] - elementsLocalBounds[1]),
+                );
+            }
+
+            // Draw focus outline (which we scale manually using the newly calculated scale to preserve stroke width)
+            const scaledFocusRect = [
+                unscaledFocusRect[0] * elements.scale.x,  // leftX
+                unscaledFocusRect[1] * elements.scale.y,  // topY
+                unscaledFocusRect[2] * elements.scale.x,  // width
+                unscaledFocusRect[3] * elements.scale.y,  // height
+            ] as const;
+            focusOutline.clear();
+            focusOutline.lineStyle(1, ...stringToColor(computedStyle.getPropertyValue('--minimap-focus-color')));
+            focusOutline.drawRect(...scaledFocusRect);
+
+            // getLocalBounds() is slow, so we manually compute the coordinates
+            const localBounds = [
+                elementsLocalBounds[0] * elements.scale.x,  // leftX
+                elementsLocalBounds[1] * elements.scale.y,  // topY
+                elementsLocalBounds[2] * elements.scale.x,  // rightX
+                elementsLocalBounds[3] * elements.scale.y,  // bottomY
+            ] as const;
+
+            // Reposition container
+            if (this.dragDetails?.type !== 'minimap') {  // don't reposition if we're currently dragging the minimap
+                container.x = viewSize[0] - localBounds[2];
+                container.y = -localBounds[1];
+                container.hitArea = new PIXI.Rectangle(localBounds[0], localBounds[1], localBounds[2] - localBounds[0], localBounds[3] - localBounds[1]);
+            }
+
+            // Draw minimap outline
+            minimapOutline.clear();
+            minimapOutline.lineStyle(1, ...stringToColor(computedStyle.getPropertyValue('--minimap-outline-color')));
+            minimapOutline.line.cap = PIXI.LINE_CAP.SQUARE;
+            minimapOutline.moveTo(localBounds[0], -container.y);
+            minimapOutline.lineTo(localBounds[0], localBounds[3]);
+            minimapOutline.lineTo(viewSize[1] + container.x, localBounds[3]);
+        }
+    }
+
+    /**
+     * Marks the scene as dirty, scheduling a redraw with the next animation frame. Returns a Promise that resolves
+     * after the redraw (but before the frame renders).
+     */
+    private async redrawAsync(): Promise<void> {
+        await (this.isAboutToRedraw ||= new Promise<void>(resolve => requestAnimationFrame((time) => {
+            this.isAboutToRedraw = false;
+            this.redrawNow(time);
+            resolve();
+        })));
+    }
+
+    private async resetLayoutNow(): Promise<void> {
+        const loadingSpinner = createSpinner();
+        this.container.appendChild(loadingSpinner.element);
+
+        try {
+            loadingSpinner.setCaption('Layouting…');
+            await skipFrame(); // Wait for the loading indicator to render
+            const timeStart = performance.now();
+            const layout = this.layouter.layout(this.sdfg, this.settings, this.symbolResolver);
+            this.renderGraph = layout.graph;
+            const layoutingTime = performance.now() - timeStart;
+
+            // If layouting was fast, don't waste time rendering the loading indicator (saves ~30ms on 60Hz screens)
+            const fasterThanFrames = layoutingTime <= 100;
+
+            loadingSpinner.setCaption('Initializing stage…');
+            if (!fasterThanFrames) await skipFrame();
+            this.resetStage(layout);
+
+            loadingSpinner.setCaption('Rendering…');
+            if (!fasterThanFrames) await skipFrame();
+            await this.redrawAsync();
+        } finally {
+            this.container.removeChild(loadingSpinner.element);
+        }
+    }
+
+    /**
+     * Initiate a complete relayout and reset the stage. This is a potentially very
+     * slow operation
+     */
+    private async resetLayoutAsync(): Promise<void> {
+        if (this.isCurrentlyRelayouting) {
+            // If we're currently relayouting, wait for it to finish and then start over
+            // as things might've changed between that function call and now
+            await this.isCurrentlyRelayouting;
+        }
+        if (this.isCurrentlyRelayouting) {
+            // If we're *still* relayouting, that means another layout request started
+            // since this function was called. Someone else is doing the work for us,
+            // so we can just wait for it to finish.
+            await this.isCurrentlyRelayouting;
+        } else {
+            this.isCurrentlyRelayouting = this.resetLayoutNow();
+            try {
+                await this.isCurrentlyRelayouting;
+            } finally {
+                this.isCurrentlyRelayouting = false;
+            }
+        }
+    }
+
+    private addTransientRenderedLayoutElement(
+        rendered: RenderedLayoutElement,
+        context: Pick<PixiRenderer['renderCache'],
+            | 'pixiObjects'
+            | 'allRendered'
+        > = this.renderCache,
+    ): void {
+        context.allRendered.add(rendered);
+        const objs = getAllDisplayObjects(rendered);
+        for (const obj of objs) {
+            obj.interactive = true;
+            context.pixiObjects.set(obj, rendered.layoutElement);
+        }
+        this.pixiContainer!.addChild(...objs);
+    }
+
+    private removeTransientRenderedLayoutElement(rendered: RenderedLayoutElement) {
+        this.renderCache.allRendered.delete(rendered);
+        const objs = getAllDisplayObjects(rendered);
+        this.pixiContainer!.removeChild(...objs);
+        for (const obj of objs) {
+            this.renderCache.pixiObjects.delete(obj);
+            obj.destroy(true);
+        }
+    }
+
+    private updateLayoutElementAndRerenderPrimary(
+        element: LayoutElement,
+        context: Pick<PixiRenderer['renderCache'],
+            | 'pixiObjects'
+            | 'allRendered'
+            | 'layoutElements'
+            | 'highlightingGroups'
+            | 'compStyle'
+        > = this.renderCache,
+        totalElements = context.layoutElements.size,
+    ) {
+        // Remove old element & invalidate selection
+        const oldRendered = context.layoutElements.get(element);
+        if (oldRendered) {
+            this.removeTransientRenderedLayoutElement(oldRendered);
+            this.selection = {
+                ...this.selection,
+                hasChanged: true,
+            };
+            if (this.minimap) {
+                const minimapRendereds = this.minimap.renderedElements.get(element)!;
+                const minimapObjs = [...minimapRendereds.always, ...minimapRendereds.near];
+                this.minimap.elements.removeChild(...minimapObjs);
+                minimapObjs.forEach(obj => obj.destroy(true));
+            }
+        }
+
+        // Add new element
+        const rendered = renderLayoutElement(
+            element,
+            context.compStyle,
+            PixiRenderer.getLayoutElementRenderingSettings(totalElements),
+        );
+        this.addTransientRenderedLayoutElement(rendered, context);
+        context.layoutElements.set(element, rendered);
+
+        // Register highlighting group
+        if (Reflect.has(element, 'highlightingGroup')) {
+            const hlGroup = element.highlightingGroup;
+            if (!context.highlightingGroups.has(hlGroup)) {
+                context.highlightingGroups.set(hlGroup, new Set<LayoutElement>());
+            }
+            context.highlightingGroups.get(hlGroup)!.add(element);
+        }
+
+        // Update minimap
+        if (this.minimap) {
+            const minimapRendered = renderLayoutElement(element, context.compStyle, {
+                displayState: 'normal',
+                isSelected: false,
+                detailMode: 'quick',
+            });
+            this.minimap!.elements.addChild(...minimapRendered.always, ...minimapRendered.near);
+            this.minimap!.renderedElements.set(element, minimapRendered);
+        }
+
+        // Redraw
+        this.renderCache.containerBounds = null;
+        this.redrawAsync();
+    }
+
+    private static getLayoutElementRenderingSettings(totalElements: number) {
+        return {
+            displayState: 'normal',
+            isSelected: false,
+            detailMode: isDetailed(totalElements) ? 'detailed' : 'normal',
+        } as const;
+    }
+
+
+    /**
+ * Resets the current stage, causing a complete re-render. Don't call this directly, instead call `resetLayoutAsync`
+ */
+    private resetStage(layout: CompleteLayout) {
+        const oldBounds = this.pixiContainer ? this.getContainerBounds() : null;
+
+        // Reset scene
+        if (this.pixiContainer) {
+            this.viewport.removeChild(this.pixiContainer);
+            this.pixiContainer.destroy(true);
+        }
+        if (this.minimap) {
+            this.app.stage.removeChild(this.minimap.container);
+            this.minimap.container.destroy(true);
+        }
+
+        // Reset selection
+        this.selection = createEmptyElementSelection();
+
+        // Set up Pixi Container
+        this.pixiContainer = new PIXI.Container();
+        this.viewport.addChild(this.pixiContainer);
+
+        // Set up Minimap
+        this.minimap = {
+            container: new PIXI.Container(),
+            elements: new PIXI.Container(),
+            focus: new PIXI.Graphics(),
+            focusOutline: new PIXI.Graphics(),
+            minimapOutline: new PIXI.Graphics(),
+            renderedElements: new Map<LayoutElement, RenderedLayoutElement>(),
+        };
+        this.minimap.container.alpha = 0.75;
+        this.minimap.container.interactive = true;
+        this.minimap.container.interactiveChildren = false;
+        this.minimap.container.addChild(this.minimap.elements);
+        this.minimap.container.addChild(this.minimap.focusOutline);
+        this.minimap.container.addChild(this.minimap.minimapOutline);
+        this.minimap.focus.zIndex = Number.MAX_SAFE_INTEGER;
+        this.app.stage.addChild(this.minimap.container);
+
+        // Add layout elements to container & minimap
+        const compStyle = window.getComputedStyle(this.app.view);
+        const layoutElements = new Map<LayoutElement, RenderedLayoutElement>();
+        const pixiObjects = new Map<PIXI.DisplayObject, LayoutElement>();
+        const allRendered = new Set<RenderedLayoutElement>();
+        const highlightingGroups = new Map<unknown, Set<LayoutElement>>();
+        for (const el of layout.elements) {
+            if (layoutElements.has(el)) throw new Error('Duplicate layout element! (Layout elements must be unique)');
+
+            this.updateLayoutElementAndRerenderPrimary(el, {
+                layoutElements,
+                pixiObjects,
+                allRendered,
+                highlightingGroups,
+                compStyle,
+            }, layout.elements.length);
+        }
+        this.minimap.elements.addChild(this.minimap.focus);
+        this.pixiContainer.sortChildren();
+        this.minimap.elements.sortChildren();
+
+        // Reposition viewport
+        const containerBounds = this.pixiContainer.getLocalBounds();
+        this.viewport.x += (oldBounds?.left ?? 0) - containerBounds.left;
+        this.viewport.y += (oldBounds?.top ?? 0) - containerBounds.top;
+
+        // Update render cache
+        this.renderCache = {
+            containerBounds,
+            layoutElements,
+            pixiObjects,
+            allRendered,
+            compStyle,
+            highlightingGroups
+        };
+    }
+
+    private getContainerBounds() {
+        return !this.pixiContainer ? new PIXI.Rectangle(0, 0, 1, 1)
+            : this.renderCache.containerBounds ??= this.pixiContainer.getLocalBounds();
+
+    }
+
+    private getViewSize(): StageCoordinates {
+        // TODO view.clientWidth is not optimal, are there edge cases where it fails?
+        // we should get DOM viewport coordinates instead and then translate them to local stage coordinates (akin to getMousePosition(...))
+        // view.width fails on retina displays
+        return [this.app.view.clientWidth, this.app.view.clientHeight];
+    }
+
+    /**
+     * Returns the mouse position local to the PixiJS stage.
+     */
+    private getMousePosition(event: MouseEvent | { clientX: number, clientY: number }): StageCoordinates {
+        const int: PIXI.InteractionManager = this.app.renderer.plugins.interaction;
+        const mousePos = new PIXI.Point();
+        int.mapPositionToPoint(mousePos, event.clientX, event.clientY);
+        return [mousePos.x, mousePos.y];
+    }
+
+    private getHitElement(event: MouseEvent): LayoutElement | undefined {
+        const pos = this.getMousePosition(event);
+
+        const int: PIXI.InteractionManager = this.app.renderer.plugins.interaction;
+        const hitObj = int.hitTest(new PIXI.Point(...pos));
+        const hitEl = hitObj && this.renderCache.pixiObjects.get(hitObj);
+
+        return hitEl ?? undefined;
+    }
+
+    private registerHandlers() {
+        // TODO: touch events
+
+        // === Resizing ===
+        const resizeObserver = new ResizeObserver(() => {
+            this.shouldResize = true;
+            this.redrawAsync();
+        });
+        this.destructors.push(() => resizeObserver.disconnect());  // prevent memory leaks
+        resizeObserver.observe(this.container);
+
+
+        // === Dragging ===
+        this.app.view.addEventListener('mousedown', (event) => {
+            this.nextClickIsDrag = false;
+            if (event.button !== 0 && event.button !== 1) return;
+            const dragStart = this.getMousePosition(event);
+            const dragDetails = {
+                dragStart,
+                lastTick: dragStart,
+            };
+            const int: PIXI.InteractionManager = this.app.renderer.plugins.interaction;
+            const isMinimapHit = this.minimap && int.hitTest(new PIXI.Point(...dragStart), this.minimap?.container);
+
+            const dragType = event.button === 1 ? 'pan'
+                : isMinimapHit ? 'minimap'
+                    : this.getSettings().moveMode;
+            switch (dragType) {
+                case 'minimap': {
+                    this.setMinimapFocus(dragStart);
+
+                    this.dragDetails = {
+                        type: 'minimap',
+                        ...dragDetails
+                    };
+                    break;
+                }
+                case 'pan': {
+                    this.dragDetails = {
+                        type: 'viewport',
+                        ...dragDetails
+                    };
+                    break;
+                }
+                case 'move': {
+                    const specialKeyPressed = event.shiftKey || event.ctrlKey || event.metaKey;
+                    const hitEl = this.getHitElement(event);
+                    if (!hitEl) return;
+                    const hitSelected = this.selection.selected.has(hitEl);
+                    const selected = [...this.selection.selected];
+                    const allSelectedForMove = specialKeyPressed
+                        ? (hitSelected ? selected.filter(el => el !== hitEl) : [...selected, hitEl])
+                        : (hitSelected ? [...selected] : [hitEl!]);
+                    const selectedForMove = allSelectedForMove.filter(el => ['state', 'node'].includes(el.type));
+
+                    if (selectedForMove.length === 0) {
+                        const sel = allSelectedForMove.filter(el => el.type === 'edge') as EdgeLayoutElement[];
+                        const controlPoints = sel.flatMap(
+                            edge => edge.points.map((_, i) => [edge, i] as const).slice(1, -1)
+                        );
+                        this.dragDetails = {
+                            type: 'move-edge-control-points',
+                            controlPoints,
+                            ...dragDetails
+                        };
+                    } else {
+                        // Find elements, their child elements, and nearby edges
+                        const elements = new Set<Exclude<LayoutElement, EdgeLayoutElement>>();
+                        const edgeBeginnings: Set<EdgeLayoutElement> = new Set();
+                        const edgeEnds: Set<EdgeLayoutElement> = new Set();
+                        const stack = selectedForMove.map(el => el.renderData).filter(d => d);
+                        while (stack.length > 0) {
+                            const renderNode = stack.pop()!;
+                            elements.add((renderNode as any).layoutElement);
+                            if (renderNode.childGraph) stack.push(...renderNode.childGraph.nodes());
+                            if (renderNode.inConnectors) stack.push(...renderNode.inConnectors);
+                            if (renderNode.outConnectors) stack.push(...renderNode.outConnectors);
+
+                            const graph: RenderGraph = (renderNode as any).graph;
+                            if (renderNode.id !== undefined && graph) {
+                                const inEdges = graph.inEdges(renderNode.id);
+                                const outEdges = graph.outEdges(renderNode.id);
+                                outEdges.map(edge => (edge as any).layoutElement).forEach(el => edgeBeginnings.add(el));
+                                inEdges.map(edge => (edge as any).layoutElement).forEach(el => edgeEnds.add(el));
+                            }
+                        }
+
+                        this.dragDetails = {
+                            type: 'move-objects',
+                            elements,
+                            edgeBeginnings,
+                            edgeEnds,
+                            ...dragDetails
+                        };
+                    }
+                    break;
+                }
+                case 'select': {
+                    this.dragDetails = {
+                        type: 'select',
+                        ...dragDetails
+                    };
+                    break;
+                }
+                default: {
+                    throw new Error(`Unknown drag type during mousedown! ${dragType}`);
+                }
+            }
+
+            event.preventDefault();
+            event.stopPropagation();
+        });
+
+        window.addEventListener('mousemove', (event) => {
+            this.nextClickIsDrag = true;
+            if (!this.dragDetails) return;
+
+            const thisTick = this.getMousePosition(event);
+            const lastTick = this.dragDetails.lastTick;
+            const diff = [thisTick[0] - lastTick[0], thisTick[1] - lastTick[1]] as const;
+
+            switch (this.dragDetails.type) {
+                case 'viewport': {
+                    this.transformViewport(diff);
+                    break;
+                }
+                case 'minimap': {
+                    this.setMinimapFocus(thisTick);
+                    break;
+                }
+                case 'move-objects': {
+                    const { elements, edgeBeginnings, edgeEnds } = this.dragDetails;
+
+                    // Move beginning edge control points
+                    for (const edge of edgeBeginnings) {
+                        for (let i = 0; i < edge.points.length; i++) {
+                            edge.points[i][0] += (1 - i / (edge.points.length - 1)) * diff[0] / this.viewport.scale.x;
+                            edge.points[i][1] += (1 - i / (edge.points.length - 1)) * diff[1] / this.viewport.scale.x;
+                        }
+                        this.updateLayoutElementAndRerenderPrimary(edge);
+                    }
+
+                    // Move ending edge control points
+                    for (const edge of edgeEnds) {
+                        for (let i = 0; i < edge.points.length; i++) {
+                            edge.points[i][0] += (i / (edge.points.length - 1)) * diff[0] / this.viewport.scale.x;
+                            edge.points[i][1] += (i / (edge.points.length - 1)) * diff[1] / this.viewport.scale.x;
+                        }
+                        this.updateLayoutElementAndRerenderPrimary(edge);
+                    }
+
+                    // Move non-edge elements
+                    for (const element of elements) {
+                        element.x += diff[0] / this.viewport.scale.x;
+                        element.y += diff[1] / this.viewport.scale.y;
+                        this.updateLayoutElementAndRerenderPrimary(element);
+                    }
+                    break;
+                }
+                case 'move-edge-control-points': {
+                    const { controlPoints } = this.dragDetails;
+                    for (const [edge, i] of controlPoints) {
+                        edge.points[i][0] += diff[0] / this.viewport.scale.x;
+                        edge.points[i][1] += diff[1] / this.viewport.scale.x;
+                        this.updateLayoutElementAndRerenderPrimary(edge);
+                    }
+                    break;
+                }
+                case 'select': {
+                    this.redrawAsync();
+                    break;
+                }
+                default: {
+                    throw new Error(`Unknown drag type during mousemove! ${(this.dragDetails as any).type}`);
+                }
+            }
+
+            this.dragDetails.lastTick = thisTick;
+        });
+
+        window.addEventListener('mouseup', (event) => {
+            switch (this.dragDetails?.type) {
+                case 'minimap': {
+                    // Minimap doesn't scale while mouse is held, so redraw one more time
+                    this.redrawAsync();
+                    break;
+                }
+                case 'select': {
+                    const x1 = this.dragDetails.dragStart[0];
+                    const y1 = this.dragDetails.dragStart[1];
+                    const x2 = this.dragDetails.lastTick[0];
+                    const y2 = this.dragDetails.lastTick[1];
+                    const rect = new PIXI.Rectangle(
+                        Math.min(x1, x2),
+                        Math.min(y1, y2),
+                        Math.abs(x1 - x2),
+                        Math.abs(y1 - y2),
+                    );
+
+                    const selection = new Set<LayoutElement>();
+                    for (const [element, rendered] of this.renderCache.layoutElements) {
+                        const hb = rendered.hitbox.clone();
+                        hb.x = (hb.x) * this.viewport.scale.x + this.viewport.x;
+                        hb.y = (hb.y) * this.viewport.scale.y + this.viewport.y;
+                        hb.width *= this.viewport.scale.x;
+                        hb.height *= this.viewport.scale.y;
+                        if (
+                            hb.left >= rect.left
+                            && hb.top >= rect.top
+                            && hb.right <= rect.right
+                            && hb.bottom <= rect.bottom
+                        ) {
+                            selection.add(element);
+                        }
+                    }
+
+                    if (event.shiftKey) {
+                        this.setSelected([...this.selection.selected, ...selection]);
+                    } else if (event.ctrlKey || event.metaKey) {
+                        this.setSelected([...this.selection.selected].filter(el => !selection.has(el)));
+                    } else {
+                        this.setSelected(selection);
+                    }
+
+                    this.redrawAsync();
+                    break;
+                }
+                default: {
+                    // Do nothing!
+                    break;
+                }
+            }
+            this.dragDetails = null;
+        });
+
+
+        // === Zooming ===
+        // We need to handle wheel events occuring in the canvas, and also events occuring outside the canvas while
+        // the mouse is dragging
+        const handleWheel = (event: WheelEvent) => {
+            const sc = 0.999 ** event.deltaY;
+            this.transformViewport([0, 0], sc, this.getMousePosition(event));
+            event.preventDefault();
+            event.stopPropagation();
+        };
+        this.app.view.addEventListener('wheel', handleWheel);
+        window.addEventListener('wheel', (e) => this.dragDetails && handleWheel(e));
+
+        // === Set tooltip position ===
+        this.app.view.addEventListener('mousemove', (event) => {
+            if (this.dragDetails) return;
+
+            const br = this.app.view.getBoundingClientRect();
+
+            this.tooltipContainer.style.top = (event.clientY - br.y) + 'px';
+            this.tooltipContainer.style.left = (event.clientX - br.x + 20) + 'px';
+        });
+
+        // === Hovering ===
+        const setHovered = (elements: LayoutElement[]) => {
+            const withTooltip = elements.filter(el => el.tooltip);
+            switch (withTooltip.length) {
+                case 0: {
+                    this.tooltipContainer.style.display = 'none';
+                    break;
+                }
+                case 1: {
+                    const el = withTooltip[0];
+                    this.tooltipContainer.className = 'sdfvtooltip';
+                    this.tooltipContainer.style.display = 'block';
+                    this.tooltipContainer.innerHTML = el.tooltip!.html;
+                    this.tooltipContainer.classList.add(...{
+                        normal: [],
+                        interstate: ['sdfvtooltip--interstate-edge'],
+                        connector: ['sdfvtooltip--connector'],
+                    }[el.tooltip!.style]);
+                    break;
+                }
+                default: {
+                    this.tooltipContainer.className = 'sdfvtooltip';
+                    this.tooltipContainer.style.display = 'block';
+                    this.tooltipContainer.innerText = '[Multiple tooltips]';
+                    break;
+                }
+            }
+
+            if (!arrayEquals(elements, [...this.selection.hovered])) {
+                const highlighted = new Set(elements
+                    .filter(el => Reflect.has(el, 'highlightingGroup'))
+                    .map(el => el.highlightingGroup)
+                    .flatMap(g => [...this.renderCache.highlightingGroups.get(g)!]));
+
+                this.selection = {
+                    ...this.selection,
+                    highlighted,
+                    hovered: new Set(elements),
+                    hasChanged: true,
+                };
+                this.redrawAsync();
+            }
+        };
+
+        this.app.view.addEventListener('mousemove', (event) => {
+            if (this.dragDetails) return;
+
+            const hitEl = this.getHitElement(event);
+            setHovered(hitEl ? [hitEl] : []);
+        });
+
+        this.app.view.addEventListener('mouseleave', () => {
+            if (this.dragDetails) return;
+
+            setHovered([]);
+        });
+
+        // === Selection ===
+        this.app.view.addEventListener('click', (event) => {
+            if (this.nextClickIsDrag) return;
+
+            const hitEl = this.getHitElement(event);
+            if (!event.shiftKey && !event.ctrlKey && !event.metaKey) {
+                this.setSelected(hitEl ? [hitEl] : []);
+            } else if (hitEl) {
+                const selected = this.selection.selected;
+                this.setSelected(
+                    selected.has(hitEl) ? [...selected].filter(el => el !== hitEl) : [...selected, hitEl]
+                );
+            }
+        });
+
+        // === Toggle collapse & expand ===
+        this.app.view.addEventListener('dblclick', (event) => {
+            if (this.nextClickIsDrag) return;
+
+            const hitEl = this.getHitElement(event);
+            if (hitEl) this.toggleCollapsed(hitEl);
+        });
+
+
+        // === External mouse events ===
+        for (const type of mouseEventTypes) {
+            this.app.view.addEventListener(type, (event) => {
+                if (!this.mouseHandler) return;
+
+                const mousePosition = this.getMousePosition(event);
+                this.mouseHandler(
+                    type,
+                    event,
+                    { x: mousePosition[0], y: mousePosition[1] },
+                    this,
+                    [...this.selection.selected].map(el => el.renderData).filter(x => x !== undefined),
+                    this.nextClickIsDrag,
+                );
+                if (this.nextClickIsDrag) return;
+            });
+        }
+
+    }
+
+    private setMinimapFocus(posCenter: StageCoordinates) {
+        const viewSize = this.getViewSize();
+
+        if (!this.minimap) return;
+        const mapFocusCoords = [  // in local coordinates
+            (posCenter[0] - this.minimap.container.x) / this.minimap.elements.scale.x,
+            (posCenter[1] - this.minimap.container.y) / this.minimap.elements.scale.y,
+        ];
+        const topLeft = [
+            -(mapFocusCoords[0] * this.viewport.scale.x - viewSize[0] / 2),
+            -(mapFocusCoords[1] * this.viewport.scale.y - viewSize[1] / 2),
+        ] as const;
+        this.setViewport(topLeft);
+    }
+
+    private transformViewport(pos: StageCoordinates, zoom = 1, zoomCenter: StageCoordinates | null = null, duration: number | null = null) {
+        if (zoom !== 1 && zoomCenter) {
+            pos = [
+                pos[0] + zoomCenter[0] - (zoomCenter[0] - this.viewport.x) * zoom,
+                pos[1] + zoomCenter[1] - (zoomCenter[1] - this.viewport.y) * zoom,
+            ];
+        } else {
+            pos = [this.viewport.x + pos[0], this.viewport.y + pos[1]];
+        }
+        this.setViewport(pos, this.viewport.scale.x * zoom, duration);
+    }
+
+    private setViewport(pos: StageCoordinates | null, scale: number | null = null, duration: number | null = null) {
+        if (duration === null) {
+            // manually set if duration is not given so properties are immediately readable (before the next rerender)
+            if (pos) [this.viewport.x, this.viewport.y] = pos;
+            if (scale !== null) this.viewport.scale.x = this.viewport.scale.y = scale;
+        } else {
+            this.viewportAnimation = {
+                startTime: 'now',
+                duration,
+                startViewport: [[this.viewport.x, this.viewport.y], this.viewport.scale.x],
+                targetViewport: [pos ?? [this.viewport.x, this.viewport.y], scale ?? this.viewport.scale.x],
+            };
+        }
+        this.redrawAsync();
+    }
+
+    private setViewportRect(rect: PIXI.Rectangle, duration: number | null) {
+        const viewSize = this.getViewSize();
+        const scale = Math.min(viewSize[0] / rect.width, viewSize[1] / rect.height);
+        const posX = rect.x * scale + (rect.width * scale - viewSize[0]) / 2;
+        const posY = rect.y * scale + (rect.height * scale - viewSize[1]) / 2;
+        this.setViewport(
+            [-posX, -posY],
+            scale,
+            duration,
+        );
+    }
+
+    destroy(): void {
+        this.app.destroy(true, true);
+        this.destructors.forEach(d => d());
+    }
+
+    getSettings(): RendererSettings {
+        return {
+            ...this.settings,
+        };
+    }
+
+    updateSettings(settings: Partial<RendererSettings>): void {
+        this.settings = {
+            ...this.settings,
+            ...settings,
+        };
+
+        // Check whether the updated settings require a full relayout
+        const noRelayout = new Set<keyof RendererSettings>(['moveMode']);
+        if (Object.keys(settings).every((k: any) => noRelayout.has(k))) {
+            this.redrawAsync();
+        } else {
+            this.relayout();
+        }
+
+        // Update interaction info container
+        const interactionText = {
+            pan: '',
+            move: htmlSanitize`Middle Mouse: Pan view`,
+            select: htmlSanitize`
+                Shift: Add to selection<br>
+                Ctrl/Cmd: Remove from selection<br>
+                Middle Mouse: Pan view
+            `,
+        }[this.settings.moveMode];
+        this.interactionInfoContainer.innerHTML = interactionText;
+        this.interactionInfoContainer.style.display = interactionText ? 'block' : 'none';
+
+        this.settingsChangeListeners.forEach(listener => listener(this.getSettings()));
+    }
+
+    onSettingsChange(func: (settings: RendererSettings) => void): void {
+        this.settingsChangeListeners.push(func);
+    }
+
+    async relayout(): Promise<void> {
+        await this.resetLayoutAsync();
+    }
+
+    /**
+* Call this function whenever CSS styles have updated to make the renderer refresh all elements.
+*/
+    notifyStyleUpdate(): void {
+        this.relayout();
+    }
+
+    zoomToView(elements: LayoutElement[] | 'all' = 'all', duration: number = ANIMATION_DURATION): void {
+        if (elements === 'all') {
+            this.setViewportRect(this.getContainerBounds(), duration);
+        } else {
+            const containers = elements.map(el => this.renderCache.layoutElements.get(el)!);
+            const bounds = containers.flatMap(conts => getAllDisplayObjects(conts).map(cont => {
+                const localBounds = cont.getLocalBounds();
+                return new PIXI.Rectangle(
+                    localBounds.x + cont.x,
+                    localBounds.y + cont.y,
+                    localBounds.width,
+                    localBounds.height,
+                );
+            }));
+            const rect = bounds.reduce((rect, bound) => rect.enlarge(bound));
+            this.setViewportRect(rect, duration);
+        }
+    }
+
+    saveAsPNG(): void {
+        const container = this.pixiContainer;
+        const canvas: HTMLCanvasElement = this.app.renderer.plugins.extract.canvas(container);
+        canvas.toBlob((blob) => {
+            const a = document.createElement('a');
+            a.download = 'dace-export.png';
+            a.href = URL.createObjectURL(blob);
+            a.click();
+        }, 'image/png');
+    }
+
+    saveAsPDF(entireContainer = false): void {
+        const container = entireContainer ? this.pixiContainer : this.viewport;
+        const size = entireContainer ? null : this.getViewSize();
+        if (!container) throw new Error('Layouting has not finished yet!');
+
+        (async () => {
+            const blob = await pixiObjectToPdf(container, size);
+            const a = document.createElement('a');
+            a.download = 'dace-export.pdf';
+            a.href = URL.createObjectURL(blob);
+            a.click();
+        })();
+    }
+
+    toggleCollapsed(element: LayoutElement): void {
+        const sdfgElem = element.sdfgData;
+        if (!sdfgElem) return;
+
+        // TODO: If an exit node, find the corresponding entry node
+
+        const attrs = element.sdfgData?.attributes;
+        if (attrs && 'is_collapsed' in attrs) {
+            // eslint-disable-next-line camelcase
+            attrs.is_collapsed = !attrs.is_collapsed;
+            this.relayout();
+        }
+    }
+
+    expandAll(): void {
+        traverse_sdfg(this.sdfg, (type: string, _: any, obj: any) => {
+            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit')) {
+                // eslint-disable-next-line camelcase
+                obj.attributes.is_collapsed = false;
+            }
+        });
+        this.relayout();
+    }
+
+    collapseAll(): void {
+        traverse_sdfg(this.sdfg, (type: string, _: any, obj: any) => {
+            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit')) {
+                // eslint-disable-next-line camelcase
+                obj.attributes.is_collapsed = true;
+            }
+        });
+        this.relayout();
+    }
+
+    getSDFG(): SDFGData {
+        return this.sdfg;
+    }
+
+    getRenderGraph(): RenderGraph | undefined {
+        return this.renderGraph;
+    }
+
+    setHighlighted(elements: Iterable<LayoutElement>): void {
+        const set = new Set([...elements]);
+        if (!setEquals(set, this.selection.highlighted)) {
+            this.selection = {
+                ...this.selection,
+                highlighted: set,
+                hasChanged: true,
+            };
+            this.redrawAsync();
+        }
+    }
+
+    setSelected(elements: Iterable<LayoutElement>): void {
+        const set = new Set([...elements]);
+        if (!setEquals(set, this.selection.selected)) {
+            this.selection = {
+                ...this.selection,
+                selected: set,
+                hasChanged: true,
+            };
+            this.redrawAsync();
+        }
+    }
+
+}
+
+export type RendererSettings = {
+    inclusiveRanges: boolean,
+    memoryVolumeOverlay: boolean,
+    omitAccessNodes: boolean,
+    moveMode: 'move' | 'pan' | 'select',
+    runtimeMap: Record<string, any[]> | null,
+};
+
+type ElementSelection = {
+    selected: ReadonlySet<LayoutElement>,
+    hovered: ReadonlySet<LayoutElement>,
+    highlighted: ReadonlySet<LayoutElement>,
+    selectionPixiObjects: readonly RenderedLayoutElement[],
+    hiddenPixiObjects: readonly RenderedLayoutElement[],
+    hasChanged: boolean,
+}
+
+function createEmptyElementSelection(): ElementSelection {
+    return {
+        selected: new Set(),
+        hovered: new Set(),
+        highlighted: new Set(),
+        selectionPixiObjects: [],
+        hiddenPixiObjects: [],
+        hasChanged: false,
+    };
+}
+
+/**
+ * X and Y coordinates local to `app.stage`
+ */
+type StageCoordinates = readonly [stageX: number, stageY: number];
+
+type DragDetails = {
+    dragStart: StageCoordinates,
+    lastTick: StageCoordinates,
+} & ({
+    type: 'viewport' | 'minimap' | 'select',
+} | {
+    type: 'move-objects',
+    elements: ReadonlySet<Exclude<LayoutElement, EdgeLayoutElement>>,
+    edgeBeginnings: ReadonlySet<EdgeLayoutElement>,
+    edgeEnds: ReadonlySet<EdgeLayoutElement>,
+} | {
+    type: 'move-edge-control-points',
+    controlPoints: readonly (readonly [EdgeLayoutElement, number])[],
+});
+
+type MouseEventHandler = (
+    evtype: typeof mouseEventTypes extends Set<infer T> ? T : never,
+    event: MouseEvent,
+    mousepos: { x: number, y: number },
+    renderer: PixiRenderer,
+    selectedElements: unknown,
+    endsDrag: boolean,
+) => void;
+
+/**
+ * Returns a Promise that resolves after a new frame was painted.
+ * 
+ * This is useful if you want to wait for things to render before continuing, eg. with a large computation.
+ */
+async function skipFrame(): Promise<void> {
+    // Skip forward to the moment just before the next frame
+    await new Promise(resolve => requestAnimationFrame(resolve));
+    // Skip the frame
+    await new Promise(resolve => setTimeout(resolve, 0));
+}
+
+function isDetailed(elementCount: number): boolean {
+    return elementCount <= DETAILED_MODE_MAX_ELEMENTS;
+}
diff --git a/src/renderer/pixi/toolbar.ts b/src/renderer/pixi/toolbar.ts
new file mode 100644
index 00000000..4c27d048
--- /dev/null
+++ b/src/renderer/pixi/toolbar.ts
@@ -0,0 +1,198 @@
+import { ContextMenu } from '../../utils/context_menu';
+import { htmlSanitize } from '../../utils/sanitization';
+import { PixiRenderer } from './pixi_renderer';
+
+const vscode = (globalThis as any).vscode as undefined | Record<any, any>;
+
+export function createToolbar(renderer: PixiRenderer): HTMLElement {
+    // Create toolbar element
+    const toolbar = document.createElement('div');
+    toolbar.style.position = 'absolute';
+    toolbar.style.top = toolbar.style.left = '10px';
+
+    // Menu
+    let menu: ContextMenu | null = null;
+    let overlaysMenu: ContextMenu | null = null;
+    toolbar.appendChild(createButton({
+        title: 'Menu',
+        materialIcon: 'menu',
+        onClick: (button) => {
+            if (menu?.visible()) {
+                menu.destroy();
+                return;
+            }
+
+            menu = new ContextMenu();
+            const rect = button.getBoundingClientRect();
+            menu.addOption('Save all as PNG', () => renderer.saveAsPNG());
+            menu.addOption('Save view as PDF', () => renderer.saveAsPDF());
+            menu.addOption('Save all as PDF', () => renderer.saveAsPDF(true));
+            menu.addCheckableOption('Inclusive ranges', renderer.getSettings().inclusiveRanges, (_, checked) => { renderer.updateSettings({ inclusiveRanges: checked }); });
+            if (!vscode)
+                menu.addOption(
+                    'Overlays',
+                    () => {
+                        if (overlaysMenu && overlaysMenu.visible()) {
+                            overlaysMenu.destroy();
+                            return;
+                        }
+                        const rect = menu?._cmenu_elem?.getBoundingClientRect();
+                        overlaysMenu = new ContextMenu();
+                        overlaysMenu.addCheckableOption(
+                            'Memory volume analysis',
+                            renderer.getSettings().memoryVolumeOverlay,
+                            (_, checked) => {
+                                renderer.updateSettings({ memoryVolumeOverlay: checked });
+                                if (vscode)
+                                    (globalThis as any).refresh_analysis_pane();
+                            }
+                        );
+                        overlaysMenu.show(rect?.left ?? 10, rect?.top ?? 10);
+                    }
+                );
+            menu.addCheckableOption('Hide Access Nodes', renderer.getSettings().omitAccessNodes, (_, checked) => { renderer.updateSettings({ omitAccessNodes: checked }); });
+            menu.show(rect.left, rect.bottom);
+        },
+    }));
+
+    // Zoom to fit
+    toolbar.appendChild(createButton({
+        title: 'Zoom to fit SDFG',
+        materialIcon: 'filter_center_focus',
+        onClick: () => renderer.zoomToView(),
+    }));
+
+    // Collapse all
+    toolbar.appendChild(createButton({
+        title: 'Collapse all elements',
+        materialIcon: 'unfold_less',
+        onClick: () => renderer.collapseAll(),
+    }));
+
+    // Expand all
+    toolbar.appendChild(createButton({
+        title: 'Expand all elements',
+        materialIcon: 'unfold_more',
+        onClick: () => renderer.expandAll(),
+    }));
+
+    // Object moving mode
+    const movingMode = createToggleButton({
+        states: {
+            true: {
+                title: 'Exit object moving mode',
+                materialIcon: 'done',
+                onClick: () => renderer.updateSettings({ moveMode: 'pan' }),
+            },
+            false: {
+                title: 'Enter object moving mode',
+                materialIcon: 'open_with',
+                onClick: () => renderer.updateSettings({ moveMode: 'move' }),
+            }
+        },
+        getState: () => `${renderer.getSettings().moveMode === 'move'}`,
+    });
+    toolbar.appendChild(movingMode.button);
+    renderer.onSettingsChange(() => movingMode.updateState());
+
+    // Box selection mode
+    const boxSelection = createToggleButton({
+        states: {
+            true: {
+                title: 'Exit box select mode',
+                materialIcon: 'done',
+                onClick: () => renderer.updateSettings({ moveMode: 'pan' }),
+            },
+            false: {
+                title: 'Enter box select mode',
+                materialIcon: 'border_style',
+                onClick: () => renderer.updateSettings({ moveMode: 'select' }),
+            }
+        },
+        getState: () => `${renderer.getSettings().moveMode === 'select'}`,
+    });
+    toolbar.appendChild(boxSelection.button);
+    renderer.onSettingsChange(() => boxSelection.updateState());
+
+    /*
+    // Exit previewing mode
+    if (vscode) {
+        const exit_preview_btn = document.createElement('button');
+        exit_preview_btn.id = 'exit-preview-button';
+        exit_preview_btn.className = 'button hidden';
+        exit_preview_btn.innerHTML = '<i class="material-icons">close</i>';
+        exit_preview_btn.style = 'padding-bottom: 0px; user-select: none';
+        exit_preview_btn.onclick = () => {
+            exit_preview_btn.className = 'button hidden';
+            window.viewing_history_state = false;
+            if (vscode) {
+                vscode.postMessage({
+                    type: 'sdfv.get_current_sdfg',
+                    prevent_refreshes: true,
+                });
+                vscode.postMessage({
+                    type: 'transformation_history.refresh',
+                    reset_active: true,
+                });
+            }
+        };
+        exit_preview_btn.title = 'Exit preview';
+        this.toolbar.appendChild(exit_preview_btn);
+    }*/
+
+    return toolbar;
+
+}
+
+/**
+ * Creates a button with multiple states. When the state changes, call the `updateState` method. `updateState` is called
+ * automatically after a button click.
+ */
+function createToggleButton<S extends string | number | symbol>(details: {
+    states: Record<S, {
+        title: string,
+        materialIcon: string,
+        onClick: (button: HTMLElement) => void,
+    }>,
+    getState: () => S,
+}): { button: HTMLElement, updateState: () => void } {
+    const button = document.createElement('button');
+    button.className = 'button';
+    button.style.paddingBottom = '0px';
+    button.style.userSelect = 'none';
+    let onClickFunc = () => undefined as void;
+    button.onclick = () => onClickFunc();
+    const updateState = () => {
+        const state = details.getState();
+        const stateObj = details.states[state];
+        if (!stateObj) {
+            throw new Error(`Unknown state: ${state}`);
+        }
+        button.title = details.states[state].title;
+        button.innerHTML = htmlSanitize`<i class="material-icons">${details.states[state].materialIcon}</i>`;
+        onClickFunc = () => {
+            details.states[state].onClick(button);
+            updateState();
+        };
+    };
+    updateState();
+    return {
+        button,
+        updateState,
+    };
+}
+
+function createButton(details: {
+    title: string,
+    materialIcon: string,
+    onClick: (button: HTMLElement) => void,
+}): HTMLElement {
+    const button = document.createElement('button');
+    button.className = 'button';
+    button.innerHTML = htmlSanitize`<i class="material-icons">${details.materialIcon}</i>`;
+    button.style.paddingBottom = '0px';
+    button.style.userSelect = 'none';
+    button.onclick = () => details.onClick(button);
+    button.title = details.title;
+    return button;
+}
diff --git a/src/renderer/renderer.js b/src/renderer/renderer.js
deleted file mode 100755
index 456ea581..00000000
--- a/src/renderer/renderer.js
+++ /dev/null
@@ -1,2429 +0,0 @@
-// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
-
-import dagre from 'dagre';
-import { intersectRect } from 'dagre/lib/util';
-import {
-    find_exit_for_entry,
-    get_positioning_info,
-    delete_positioning_info,
-    get_uuid_graph_element,
-    find_graph_element_by_uuid,
-} from '../utils/sdfg/sdfg_utils';
-import { deepCopy } from '../utils/utils.ts';
-import { traverse_sdfg_scopes } from '../utils/sdfg/traversal';
-import { ContextMenu } from '../utils/context_menu';
-import {
-    Connector,
-    Edge,
-    offset_state,
-    SDFGElements,
-    draw_sdfg,
-    offset_sdfg,
-    NestedSDFG,
-} from './renderer_elements';
-import { check_and_redirect_edge } from '../utils/sdfg/sdfg_utils';
-import { memlet_tree_complete } from '../utils/sdfg/traversal';
-import { CanvasManager } from './canvas_manager';
-import {
-    boundingBox,
-    calculateBoundingBox,
-    calculateEdgeBoundingBox,
-} from '../utils/bounding_box';
-import { OverlayManager } from '../overlay_manager';
-import { fill_info } from '../sdfv';
-import { MemoryVolumeOverlay } from '../overlays/memory_volume_overlay';
-
-function check_valid_add_position(type, foreground_elem, lib, mousepos) {
-    switch (type) {
-        case 'SDFGState':
-            return (foreground_elem instanceof NestedSDFG ||
-                    foreground_elem === null);
-        case 'Edge':
-            return (foreground_elem instanceof SDFGNode ||
-                    foreground_elem instanceof State);
-        case 'LibraryNode':
-            return (foreground_elem instanceof State && lib);
-        default:
-            return foreground_elem instanceof State;
-    }
-}
-
-export class SDFGRenderer {
-    constructor(sdfg, container, on_mouse_event = null, user_transform = null,
-                debug_draw = false, background = null, mode_buttons = null) {
-        // DIODE/SDFV-related fields
-        this.sdfg = sdfg;
-        this.sdfg_list = {};
-        this.state_parent_list = {}; // List of all state's parent elements
-
-        // Rendering-related fields
-        this.container = container;
-        this.ctx = null;
-        this.canvas = null;
-        this.last_visible_elements = null;
-        this.last_hovered_elements = null;
-        this.last_clicked_elements = null;
-        this.last_dragged_element = null;
-        this.tooltip = null;
-        this.tooltip_container = null;
-
-        // Toolbar-related fields
-        this.menu = null;
-        this.toolbar = null;
-        this.panmode_btn = null;
-        this.movemode_btn = null;
-        this.selectmode_btn = null;
-        this.addmode_btns = null;
-        this.add_type = null;
-        this.add_mode_lib = null;
-        this.addmode_divs = null;
-        this.mode_selected_bg_color = "#CCCCCC";
-        this.mouse_follow_svgs = null;
-        this.mouse_follow_element = null;
-
-        // Memlet-Tree related fields
-        this.all_memlet_trees_sdfg = [];
-
-        // View options
-        this.inclusive_ranges = false;
-        this.omit_access_nodes = false;
-
-        // Mouse-related fields
-        this.mouse_mode = 'pan'; // Mouse mode - pan, move, select
-        this.box_select_rect = null;
-        this.mousepos = null; // Last position of the mouse pointer (in canvas coordinates)
-        this.realmousepos = null; // Last position of the mouse pointer (in pixel coordinates)
-        this.dragging = false;
-        this.drag_start = null; // Null if the mouse/touch is not activated
-        this.drag_second_start = null; // Null if two touch points are not activated
-        this.external_mouse_handler = on_mouse_event;
-        this.ctrl_key_selection = false;
-        this.shift_key_movement = false;
-        this.add_uuid = null;
-        this.add_position = null;
-        this.add_edge_start = null;
-
-        // Selection related fields
-        this.selected_elements = [];
-
-        // Overlay fields
-        try {
-            this.overlay_manager = new OverlayManager(this);
-        } catch (ex) {
-            this.overlay_manager = null;
-        }
-
-        this.in_vscode = false;
-        try {
-            vscode;
-            if (vscode)
-                this.in_vscode = true;
-        } catch (ex) { }
-
-        // Draw debug aids.
-        this.debug_draw = debug_draw;
-
-        this.init_elements(user_transform, background, mode_buttons);
-
-        this.relayout();
-
-        this.all_memlet_trees_sdfg = memlet_tree_complete(this.sdfg);
-
-        this.update_fast_memlet_lookup();
-    }
-
-    destroy() {
-        try {
-            if (this.menu)
-                this.menu.destroy();
-            this.canvas_manager.destroy();
-            this.container.removeChild(this.canvas);
-            this.container.removeChild(this.toolbar);
-            this.container.removeChild(this.tooltip_container);
-        } catch (ex) {
-            // Do nothing
-        }
-    }
-
-    view_settings() {
-        return { inclusive_ranges: this.inclusive_ranges };
-    }
-
-    // Updates buttons based on cursor mode
-    update_toggle_buttons() {
-        // First clear out of all modes, then jump in to the correct mode.
-        this.canvas.style.cursor = 'default';
-        this.interaction_info_box.style.display = 'none';
-        this.interaction_info_text.innerHTML = '';
-
-        this.panmode_btn.style = 'padding-bottom: 0px; user-select: none';
-        this.movemode_btn.style = 'padding-bottom: 0px; user-select: none';
-        this.selectmode_btn.style = 'padding-bottom: 0px; user-select: none';
-
-        this.mouse_follow_element.innerHTML = null;
-
-        for (let add_btn of this.addmode_btns) {
-            if (add_btn.getAttribute('type') == this.add_type) {
-                add_btn.style = 'user-select: none; background: ' +
-                    this.mode_selected_bg_color;
-                this.mouse_follow_element.innerHTML =
-                    this.mouse_follow_svgs[this.add_type];
-            } else {
-                add_btn.style = 'user-select: none;';
-            }
-        }
-
-        switch (this.mouse_mode) {
-            case 'move':
-                this.movemode_btn.style = 'padding-bottom: 0px; ' +
-                    'user-select: none; ' +
-                    'background: ' + this.mode_selected_bg_color;
-                this.interaction_info_box.style.display = 'block';
-                this.interaction_info_text.innerHTML =
-                    'Middle Mouse: Pan view<br>' +
-                    'Right Click: Reset position';
-                break;
-            case 'select':
-                this.selectmode_btn.style = 'padding-bottom: 0px; ' +
-                    'user-select: none; ' +
-                    'background: ' + this.mode_selected_bg_color;
-                this.interaction_info_box.style.display = 'block';
-                this.canvas.style.cursor = 'crosshair';
-                if (this.ctrl_key_selection) {
-                    this.interaction_info_text.innerHTML =
-                        'Middle Mouse: Pan view';
-                } else {
-                    this.interaction_info_text.innerHTML =
-                        'Shift: Add to selection<br>' +
-                        'Ctrl: Remove from selection<br>' +
-                        'Middle Mouse: Pan view';
-                }
-                break;
-            case 'add':
-                this.interaction_info_box.style.display = 'block';
-                if (this.add_type === 'Edge') {
-                    if (this.add_edge_start)
-                        this.interaction_info_text.innerHTML =
-                            'Left Click: Select second element (to)<br>' +
-                            'Middle Mouse: Pan view<br>' +
-                            'Right Click / Esc: Abort';
-                    else
-                        this.interaction_info_text.innerHTML =
-                            'Left Click: Select first element (from)<br>' +
-                            'Middle Mouse: Pan view<br>' +
-                            'Right Click / Esc: Abort';
-                } else {
-                    this.interaction_info_text.innerHTML =
-                        'Left Click: Place element<br>' +
-                        'Ctrl + Left Click: Place and stay in Add Mode<br>' +
-                        'Middle Mouse: Pan view<br>' +
-                        'Right Click / Esc: Abort';
-                }
-                break;
-            case 'pan':
-            default:
-                this.panmode_btn.style = 'padding-bottom: 0px; ' +
-                    'user-select: none; ' +
-                    'background: ' + this.mode_selected_bg_color;
-                break;
-        }
-    }
-
-    // Initializes the DOM
-    init_elements(user_transform, background, mode_buttons) {
-
-        this.canvas = document.createElement('canvas');
-        this.canvas.classList.add('sdfg_canvas')
-        if (background)
-            this.canvas.style.backgroundColor = background;
-        else
-            this.canvas.style.backgroundColor = 'inherit';
-        this.container.append(this.canvas);
-
-        if (this.debug_draw) {
-            this.dbg_info_box = document.createElement('div');
-            this.dbg_info_box.style.position = 'absolute';
-            this.dbg_info_box.style.bottom = '.5rem';
-            this.dbg_info_box.style.right = '.5rem';
-            this.dbg_info_box.style.backgroundColor = 'black';
-            this.dbg_info_box.style.padding = '.3rem';
-            this.dbg_mouse_coords = document.createElement('span');
-            this.dbg_mouse_coords.style.color = 'white';
-            this.dbg_mouse_coords.style.fontSize = '1rem';
-            this.dbg_mouse_coords.innerText = 'x: N/A / y: N/A';
-            this.dbg_info_box.appendChild(this.dbg_mouse_coords);
-            this.container.appendChild(this.dbg_info_box);
-        }
-
-        // Add an info box for interaction hints to the bottom left of the
-        // canvas.
-        this.interaction_info_box = document.createElement('div');
-        this.interaction_info_box.style.position = 'absolute';
-        this.interaction_info_box.style.bottom = '.5rem',
-        this.interaction_info_box.style.left = '.5rem',
-        this.interaction_info_box.style.backgroundColor = 'rgba(0, 0, 0, 0.5)';
-        this.interaction_info_box.style.borderRadius = '5px';
-        this.interaction_info_box.style.padding = '.3rem';
-        this.interaction_info_box.style.display = 'none';
-        this.interaction_info_text = document.createElement('span');
-        this.interaction_info_text.style.color = '#eeeeee';
-        this.interaction_info_text.innerHTML = '';
-        this.interaction_info_box.appendChild(this.interaction_info_text);
-        this.container.appendChild(this.interaction_info_box);
-
-        // Add buttons
-        this.toolbar = document.createElement('div');
-        this.toolbar.style = 'position:absolute; top:10px; left: 10px;';
-        let d;
-
-        // Menu bar
-        try {
-            ContextMenu;
-            d = document.createElement('button');
-            d.className = 'button';
-            d.innerHTML = '<i class="material-icons">menu</i>';
-            d.style = 'padding-bottom: 0px; user-select: none';
-            let that = this;
-            d.onclick = function () {
-                if (that.menu && that.menu.visible()) {
-                    that.menu.destroy();
-                    return;
-                }
-                let rect = this.getBoundingClientRect();
-                let cmenu = new ContextMenu();
-                cmenu.addOption("Save view as PNG", x => that.save_as_png());
-                if (that.has_pdf()) {
-                    cmenu.addOption("Save view as PDF", x => that.save_as_pdf());
-                    cmenu.addOption("Save all as PDF", x => that.save_as_pdf(true));
-                }
-                cmenu.addCheckableOption("Inclusive ranges", that.inclusive_ranges, (x, checked) => { that.inclusive_ranges = checked; });
-                cmenu.addCheckableOption("Adaptive content hiding", that.ctx.lod, (x, checked) => { that.ctx.lod = checked; });
-                if (!this.in_vscode)
-                    cmenu.addOption(
-                        'Overlays',
-                        () => {
-                            if (that.overlays_menu && that.overlays_menu.visible()) {
-                                that.overlays_menu.destroy();
-                                return;
-                            }
-                            let rect = cmenu._cmenu_elem.getBoundingClientRect();
-                            let overlays_cmenu = new ContextMenu();
-                            overlays_cmenu.addCheckableOption(
-                                'Memory volume analysis',
-                                that.overlay_manager.is_overlay_active(
-                                    MemoryVolumeOverlay
-                                ),
-                                (x, checked) => {
-                                    if (checked)
-                                        that.overlay_manager.register_overlay(
-                                            MemoryVolumeOverlay
-                                        );
-                                    else
-                                        that.overlay_manager.deregister_overlay(
-                                            MemoryVolumeOverlay
-                                        );
-                                    that.draw_async();
-                                    if (this.in_vscode)
-                                        refresh_analysis_pane();
-                                }
-                            );
-                            that.overlays_menu = overlays_cmenu;
-                            that.overlays_menu.show(rect.left, rect.top);
-                        }
-                    );
-                cmenu.addCheckableOption("Hide Access Nodes", that.omit_access_nodes, (_, checked) => {
-                    that.omit_access_nodes = checked;
-                    that.relayout();
-                    that.draw_async();
-                });
-                cmenu.addOption("Reset positions", () => that.reset_positions());
-                that.menu = cmenu;
-                that.menu.show(rect.left, rect.bottom);
-            };
-            d.title = 'Menu';
-            this.toolbar.appendChild(d);
-        } catch (ex) { }
-
-        // Zoom to fit
-        d = document.createElement('button');
-        d.className = 'button';
-        d.innerHTML = '<i class="material-icons">filter_center_focus</i>';
-        d.style = 'padding-bottom: 0px; user-select: none';
-        d.onclick = () => this.zoom_to_view();
-        d.title = 'Zoom to fit SDFG';
-        this.toolbar.appendChild(d);
-
-        // Collapse all
-        d = document.createElement('button');
-        d.className = 'button';
-        d.innerHTML = '<i class="material-icons">unfold_less</i>';
-        d.style = 'padding-bottom: 0px; user-select: none';
-        d.onclick = () => this.collapse_all();
-        d.title = 'Collapse all elements';
-        this.toolbar.appendChild(d);
-
-        // Expand all
-        d = document.createElement('button');
-        d.className = 'button';
-        d.innerHTML = '<i class="material-icons">unfold_more</i>';
-        d.style = 'padding-bottom: 0px; user-select: none';
-        d.onclick = () => this.expand_all();
-        d.title = 'Expand all elements';
-        this.toolbar.appendChild(d);
-
-        if (mode_buttons) {
-            // If we get the "external" mode buttons we are in vscode and do
-            // not need to create them.
-            this.panmode_btn = mode_buttons.pan;
-            this.movemode_btn = mode_buttons.move;
-            this.selectmode_btn = mode_buttons.select;
-            this.addmode_btns = mode_buttons.add_btns;
-            for (let add_btn of this.addmode_btns) {
-                if (add_btn.getAttribute('type') === 'LibraryNode') {
-                    add_btn.onclick = () => {
-                        this.show_select_library_node_dialog(() => {
-                            this.mouse_mode = 'add';
-                            this.add_type = 'LibraryNode';
-                            this.add_edge_start = null;
-                            this.update_toggle_buttons()
-                        });
-                    };
-                } else {
-                    add_btn.onclick = () => {
-                        if (!daemon_connected) {
-                            this.show_no_daemon_dialog();
-                        } else {
-                            this.mouse_mode = 'add';
-                            this.add_type = add_btn.getAttribute('type');
-                            this.add_mode_lib = null;
-                            this.add_edge_start = null;
-                            this.update_toggle_buttons();
-                        }
-                    };
-                }
-            }
-            this.mode_selected_bg_color = '#22A4FE';
-        } else {
-            // Mode buttons are empty in standalone SDFV
-            this.addmode_btns = [];
-
-            // Create pan mode button
-            let pan_mode_btn = document.createElement('button');
-            pan_mode_btn.className = 'button';
-            pan_mode_btn.innerHTML = '<i class="material-icons">pan_tool</i>';
-            pan_mode_btn.style = 'padding-bottom: 0px; user-select: none; background: ' + this.mode_selected_bg_color;
-            pan_mode_btn.title = 'Pan mode';
-            this.panmode_btn = pan_mode_btn;
-            this.toolbar.appendChild(pan_mode_btn);
-
-            // Create move mode button
-            let move_mode_btn = document.createElement('button');
-            move_mode_btn.className = 'button';
-            move_mode_btn.innerHTML = '<i class="material-icons">open_with</i>';
-            move_mode_btn.style = 'padding-bottom: 0px; user-select: none';
-            move_mode_btn.title = 'Object moving mode';
-            this.movemode_btn = move_mode_btn;
-            this.toolbar.appendChild(move_mode_btn);
-
-            // Create select mode button
-            let box_select_btn = document.createElement('button');
-            box_select_btn.className = 'button';
-            box_select_btn.innerHTML = '<i class="material-icons">border_style</i>';
-            box_select_btn.style = 'padding-bottom: 0px; user-select: none';
-            box_select_btn.title = 'Select mode';
-            this.selectmode_btn = box_select_btn;
-            this.toolbar.appendChild(box_select_btn);
-        }
-
-        // Enter pan mode
-        this.panmode_btn.onclick = () => {
-            this.mouse_mode = 'pan';
-            this.add_type = null;
-            this.add_mode_lib = null;
-            this.add_edge_start = null;
-            this.update_toggle_buttons();
-        };
-
-        // Enter object moving mode
-        this.movemode_btn.onclick = (_, shift_click) => {
-            // shift_click is false if shift key has been released and
-            // undefined if it has been a normal mouse click
-            if (this.shift_key_movement && shift_click === false)
-                this.mouse_mode = 'pan';
-            else
-                this.mouse_mode = 'move';
-            this.add_type = null;
-            this.add_mode_lib = null;
-            this.add_edge_start = null;
-            this.shift_key_movement = shift_click;
-            this.update_toggle_buttons();
-        };
-
-        // Enter box selection mode
-        this.selectmode_btn.onclick = (_, ctrl_click) => {
-            // ctrl_click is false if ctrl key has been released and
-            // undefined if it has been a normal mouse click
-            if (this.ctrl_key_selection && ctrl_click === false)
-                this.mouse_mode = 'pan';
-            else
-                this.mouse_mode = 'select';
-            this.add_type = null;
-            this.add_mode_lib = null;
-            this.add_edge_start = null;
-            this.ctrl_key_selection = ctrl_click;
-            this.update_toggle_buttons();
-        };
-
-        // React to ctrl and shift key presses
-        document.addEventListener('keydown', (e) => this.on_key_event(e));
-        document.addEventListener('keyup', (e) => this.on_key_event(e));
-
-        // Exit previewing mode
-        if (this.in_vscode) {
-            let exit_preview_btn = document.createElement('button');
-            exit_preview_btn.id = 'exit-preview-button';
-            exit_preview_btn.className = 'button hidden';
-            exit_preview_btn.innerHTML = '<i class="material-icons">close</i>';
-            exit_preview_btn.style = 'padding-bottom: 0px; user-select: none';
-            exit_preview_btn.onclick = () => {
-                exit_preview_btn.className = 'button hidden';
-                window.viewing_history_state = false;
-                if (vscode) {
-                    vscode.postMessage({
-                        type: 'sdfv.get_current_sdfg',
-                        prevent_refreshes: true,
-                    });
-                    vscode.postMessage({
-                        type: 'transformation_history.refresh',
-                        reset_active: true,
-                    });
-                }
-            };
-            exit_preview_btn.title = 'Exit preview';
-            this.toolbar.appendChild(exit_preview_btn);
-        }
-
-        this.container.append(this.toolbar);
-        // End of buttons
-
-        // Tooltip HTML container
-        this.tooltip_container = document.createElement('div');
-        this.tooltip_container.innerHTML = '';
-        this.tooltip_container.className = 'sdfvtooltip';
-        this.tooltip_container.onmouseover = () => this.tooltip_container.style.display = "none";
-        this.container.appendChild(this.tooltip_container);
-
-        // HTML container for error popovers with invalid SDFGs
-        this.error_popover_container = document.createElement('div');
-        this.error_popover_container.innerHTML = '';
-        this.error_popover_container.className = 'invalid_popup';
-        this.error_popover_text = document.createElement('div');
-        let error_popover_dismiss = document.createElement('button');
-        let that = this;
-        error_popover_dismiss.onclick = () => {
-            that.sdfg.error = undefined;
-            that.error_popover_text.innerText = '';
-            that.error_popover_container.style.display = 'none';
-        };
-        error_popover_dismiss.style.float = 'right';
-        error_popover_dismiss.style.cursor = 'pointer';
-        error_popover_dismiss.style.color = 'white';
-        error_popover_dismiss.innerHTML = '<i class="material-icons">close</i>';
-        this.error_popover_container.appendChild(error_popover_dismiss);
-        this.error_popover_container.appendChild(this.error_popover_text);
-        this.container.appendChild(this.error_popover_container);
-
-        this.ctx = this.canvas.getContext("2d");
-
-        // Translation/scaling management
-        this.canvas_manager = new CanvasManager(this.ctx, this, this.canvas);
-        if (user_transform !== null)
-            this.canvas_manager.user_transform = user_transform;
-
-        // Resize event for container
-        let observer = new MutationObserver((mutations) => { this.onresize(); this.draw_async(); });
-        observer.observe(this.container, { attributes: true });
-
-        // Set inherited properties
-        if (background)
-            this.bgcolor = background;
-        else
-            this.bgcolor = window.getComputedStyle(this.canvas).backgroundColor;
-
-        // Create the initial SDFG layout
-        this.relayout();
-
-        // Set mouse event handlers
-        this.set_mouse_handlers();
-
-        // Set initial zoom, if not already set
-        if (user_transform === null)
-            this.zoom_to_view();
-
-        let svgs = {};
-        svgs['Map'] =
-            `<svg width="8rem" height="2rem" viewBox="0 0 800 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <line x1="10" x2="190" y1="190" y2="10"/>
-                <line x1="190" x2="600" y1="10" y2="10"/>
-                <line x1="600" x2="790" y1="10" y2="190"/>
-                <line x1="790" x2="10" y1="190" y2="190"/>
-            </svg>`;
-        svgs['Consume'] =
-            `<svg width="8rem" height="2rem" viewBox="0 0 800 200" stroke="black" stroke-width="10" stroke-dasharray="60,25" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <line x1="10"x2="190" y1="190" y2="10"/>
-                <line x1="190" x2="600" y1="10" y2="10"/>
-                <line x1="600" x2="790" y1="10" y2="190"/>
-                <line x1="790" x2="10" y1="190" y2="190"/>
-            </svg>`;
-        svgs['Tasklet'] =
-            `<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <line x1="10" x2="70" y1="130" y2="190"/>
-                <line x1="70" x2="330" y1="190" y2="190"/>
-                <line x1="330" x2="390" y1="190" y2="130"/>
-                <line x1="390" x2="390" y1="130" y2="70"/>
-                <line x1="390" x2="330" y1="70" y2="10"/>
-                <line x1="330" x2="70" y1="10" y2="10"/>
-                <line x1="70" x2="10" y1="10" y2="70"/>
-                <line x1="10" x2="10" y1="70" y2="130"/>
-            </svg>`;
-        svgs['NestedSDFG'] =
-            `<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <line x1="40" x2="80" y1="120" y2="160"/>
-                <line x1="80" x2="320" y1="160" y2="160"/>
-                <line x1="320" x2="360" y1="160" y2="120"/>
-                <line x1="360" x2="360" y1="120" y2="80"/>
-                <line x1="360" x2="320" y1="80" y2="40"/>
-                <line x1="320" x2="80" y1="40" y2="40"/>
-                <line x1="80" x2="40" y1="40" y2="80"/>
-                <line x1="40" x2="40" y1="80" y2="120"/>
-                
-                <line x1="10" x2="70" y1="130" y2="190"/>
-                <line x1="70" x2="330" y1="190" y2="190"/>
-                <line x1="330" x2="390" y1="190" y2="130"/>
-                <line x1="390" x2="390" y1="130" y2="70"/>
-                <line x1="390" x2="330" y1="70" y2="10"/>
-                <line x1="330" x2="70" y1="10" y2="10"/>
-                <line x1="70" x2="10" y1="10" y2="70"/>
-                <line x1="10" x2="10" y1="70" y2="130"/>
-            </svg>`;
-        svgs['LibraryNode'] =
-            `<svg width="2.6rem" height="1.3rem" viewBox="0 0 400 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                        <line x1="10" x2="10" y1="10" y2="190"/>
-                        <line x1="10" x2="390" y1="190" y2="190"/>
-                        <line x1="390" x2="390" y1="190" y2="55"/>
-                        <line x1="390" x2="345" y1="55" y2="10"/>
-                        <line x1="345" x2="10" y1="10" y2="10"/>
-                        <line x1="345" x2="345" y1="10" y2="55"/>
-                        <line x1="345" x2="390" y1="55" y2="55"/>
-            </svg>`;
-        svgs['AccessNode'] =
-            `<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <circle cx="100" cy="100" r="90" fill="none"/>
-            </svg>`;
-        svgs['Stream'] =
-            `<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <circle cx="100" cy="100" r="90" fill="none" stroke-dasharray="60,25"/>
-            </svg>`;
-        svgs['SDFGState'] = 
-            `<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="black" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <rect x="20" y="20" width="160" height="160" style="fill:#deebf7;" />
-            </svg>`;
-        svgs['Connector'] =
-            `<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <circle cx="100" cy="100" r="40" fill="none"/>
-            </svg>`;
-        svgs['Edge'] =
-            `<svg width="1.3rem" height="1.3rem" viewBox="0 0 200 200" stroke="white" stroke-width="10" version="1.1" xmlns="http://www.w3.org/2000/svg">
-                <defs>
-                    <marker id="arrowhead" markerWidth="10" markerHeight="7"  refX="0" refY="3.5" orient="auto">
-                        <polygon points="0 0, 10 3.5, 0 7" />
-                    </marker>
-                </defs>
-                <line x1="20" y1="20" x2="180" y2="180" marker-end="url(#arrowhead)" />
-            </svg>`;
-
-        let el = document.createElement('div');
-        el.style = 'position: absolute; top: 0px; left: 0px; user-select: none; pointer-events: none;'
-        
-        this.container.appendChild(el);
-        
-        this.mouse_follow_element = el;
-        this.mouse_follow_svgs = svgs;
-
-        this.update_toggle_buttons();
-
-        // Queue first render
-        this.draw_async();
-    }
-
-    draw_async() {
-        this.canvas_manager.draw_async();
-    }
-
-    // --------------------------------------------------------------
-    // These functions are only implemented in the context of VSCode.
-
-    send_new_sdfg_to_vscode() {}
-
-    add_node_to_graph() {}
-
-    remove_graph_nodes() {}
-
-    update_new_element() {}
-
-    show_no_daemon_dialog() {}
-
-    show_select_library_node_dialog() {}
-
-    // END VSCode specific functions.
-    // --------------------------------------------------------------
-
-    set_sdfg(new_sdfg) {
-        this.sdfg = new_sdfg;
-
-        this.relayout();
-        this.draw_async();
-    
-        // Update info box
-        if (this.selected_elements.length == 1) {
-            let uuid = get_uuid_graph_element(this.selected_elements[0]);
-            fill_info(find_graph_element_by_uuid(this.graph, uuid).element);
-        }
-    }
-
-    // Set mouse events (e.g., click, drag, zoom)
-    set_mouse_handlers() {
-        let canvas = this.canvas;
-        let br = () => canvas.getBoundingClientRect();
-
-        let comp_x = event => this.canvas_manager.mapPixelToCoordsX(event.clientX - br().left);
-        let comp_y = event => this.canvas_manager.mapPixelToCoordsY(event.clientY - br().top);
-
-        // Mouse handler event types
-        for (let evtype of ['mousedown', 'mousemove', 'mouseup', 'touchstart', 'touchmove', 'touchend',
-            'wheel', 'click', 'dblclick', 'contextmenu']) {
-            canvas.addEventListener(evtype, x => {
-                let cancelled = this.on_mouse_event(x, comp_x, comp_y, evtype);
-                if (cancelled)
-                    return;
-                if (!this.in_vscode) {
-                    x.stopPropagation();
-                    x.preventDefault();
-                }
-            });
-        }
-    }
-
-    onresize() {
-        // Set canvas size
-        this.canvas.style.width = '99%';
-        this.canvas.style.height = '99%';
-        this.canvas.width = this.canvas.offsetWidth;
-        this.canvas.height = this.canvas.offsetHeight;
-    }
-
-    // Update memlet tree collection for faster lookup
-    update_fast_memlet_lookup() {
-        this.all_memlet_trees = [];
-        for (let tree of this.all_memlet_trees_sdfg) {
-            let s = new Set();
-            for (let edge of tree) {
-                s.add(edge.attributes.data.edge);
-            }
-            this.all_memlet_trees.push(s);
-        }
-    }
-
-    // Re-layout graph and nested graphs
-    relayout() {
-        this.sdfg_list = {};
-        this.graph = relayout_sdfg(this.ctx, this.sdfg, this.sdfg_list,
-            this.state_parent_list, this.omit_access_nodes);
-        this.onresize();
-
-        this.update_fast_memlet_lookup();
-
-        // Move the elements based on its positioning information
-        this.translate_moved_elements();
-
-        // Make sure all visible overlays get recalculated if there are any.
-        if (this.overlay_manager !== null)
-            this.overlay_manager.refresh();
-
-        // If we're in a VSCode context, we also want to refresh the outline.
-        try {
-            if (vscode)
-                outline(this, this.graph);
-        } catch (ex) { }
-
-        return this.graph;
-    }
-
-    translate_moved_elements() {
-        traverse_sdfg_scopes(this.graph, (node, graph) => {
-            let scope_dx = 0;
-            let scope_dy = 0;
-
-            function add_scope_movement(n) {
-                if (n.data.node.scope_entry) {
-                    let scope_entry_node = graph.node(n.data.node.scope_entry);
-                    let sp = get_positioning_info(scope_entry_node);
-                    if (sp && Number.isFinite(sp.scope_dx) &&
-                        Number.isFinite(sp.scope_dy)) {
-                        scope_dx += sp.scope_dx;
-                        scope_dy += sp.scope_dy;
-                    }
-                    if (scope_entry_node) {
-                        add_scope_movement(scope_entry_node);
-                    }
-                }
-            }
-
-            // Only add scope movement for nodes (and not states)
-            if (node instanceof Node)
-                add_scope_movement(node);
-
-            let dx = scope_dx;
-            let dy = scope_dy;
-
-            let position = get_positioning_info(node);
-            if (position) {
-                dx += position.dx;
-                dy += position.dy;
-            }
-
-            if (dx || dy) {
-                // Move the element
-                this.canvas_manager.translate_element(
-                    node, { x: node.x, y: node.y },
-                    { x: node.x + dx, y: node.y + dy }, this.graph,
-                    this.sdfg_list, this.state_parent_list, undefined, false
-                );
-            }
-
-            graph.inEdges(node.id).forEach(_ => {});
-
-            // Move edges (outgoing only)
-            graph.inEdges(node.id)?.forEach(e_id => {
-                let edge = graph.edge(e_id);
-                let edge_pos = get_positioning_info(edge);
-
-                let final_pos_d;
-                // If edges are moved within a given scope, update the point movements
-                if (scope_dx || scope_dy) {
-                    final_pos_d = [];
-                    final_pos_d.push({ dx: 0, dy: 0 }); // never move first (and last) point manually
-                    for (let i = 1; i < edge.points.length - 1; i++) {
-                        final_pos_d.push({ dx: scope_dx, dy: scope_dy });
-                        if (edge_pos?.points) {
-                            final_pos_d[i].dx += edge_pos.points[i].dx;
-                            final_pos_d[i].dx += edge_pos.points[i].dy;
-                        }
-                    }
-                    final_pos_d.push({ dx: 0, dy: 0 }); // never move last (and first) point manually
-                } else if (edge_pos?.points) {
-                    final_pos_d = edge_pos.points;
-                }
-                if (final_pos_d) {
-                    // Move the element
-                    this.canvas_manager.translate_element(edge, { x: 0, y: 0 },
-                        { x: 0, y: 0 }, this.graph, this.sdfg_list,
-                        this.state_parent_list, undefined, false, false, final_pos_d);
-                }
-            });
-            return true;
-        });
-    }
-
-    // Change translation and scale such that the chosen elements
-    // (or entire graph if null) is in view
-    zoom_to_view(elements = null, animate = true) {
-        if (!elements || elements.length == 0)
-            elements = this.graph.nodes().map(x => this.graph.node(x));
-
-        let bb = boundingBox(elements);
-        this.canvas_manager.set_view(bb, animate);
-
-        this.draw_async();
-    }
-
-    collapse_all() {
-        this.for_all_sdfg_elements((otype, odict, obj) => {
-            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit'))
-                obj.attributes.is_collapsed = true;
-        });
-
-        this.send_new_sdfg_to_vscode();
-
-        this.relayout();
-        this.draw_async();
-    }
-
-    expand_all() {
-        this.for_all_sdfg_elements((otype, odict, obj) => {
-            if ('is_collapsed' in obj.attributes && !obj.type.endsWith('Exit'))
-                obj.attributes.is_collapsed = false;
-        });
-
-        this.send_new_sdfg_to_vscode();
-
-        this.relayout();
-        this.draw_async();
-    }
-
-    reset_positions() {
-        this.for_all_sdfg_elements((otype, odict, obj) => {
-            delete_positioning_info(obj);
-        });
-
-        this.send_new_sdfg_to_vscode();
-
-        this.relayout();
-        this.draw_async();
-    }
-
-    // Save functions
-    save(filename, contents) {
-        var link = document.createElement('a');
-        link.setAttribute('download', filename);
-        link.href = contents;
-        document.body.appendChild(link);
-
-        // wait for the link to be added to the document
-        window.requestAnimationFrame(function () {
-            var event = new MouseEvent('click');
-            link.dispatchEvent(event);
-            document.body.removeChild(link);
-        });
-    }
-
-    save_as_png() {
-        this.save('sdfg.png', this.canvas.toDataURL('image/png'));
-    }
-
-    has_pdf() {
-        try {
-            blobStream;
-            canvas2pdf.PdfContext;
-            return true;
-        } catch (e) {
-            return false;
-        }
-    }
-
-    save_as_pdf(save_all = false) {
-        let stream = blobStream();
-
-        // Compute document size
-        let curx = this.canvas_manager.mapPixelToCoordsX(0);
-        let cury = this.canvas_manager.mapPixelToCoordsY(0);
-        let size;
-        if (save_all) {
-            // Get size of entire graph
-            let elements = this.graph.nodes().map(x => this.graph.node(x));
-            let bb = boundingBox(elements);
-            size = [bb.width, bb.height];
-        } else {
-            // Get size of current view
-            let endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);
-            let endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);
-            let curw = endx - curx, curh = endy - cury;
-            size = [curw, curh];
-        }
-        //
-
-        let ctx = new canvas2pdf.PdfContext(stream, {
-            size: size
-        });
-        let oldctx = this.ctx;
-        this.ctx = ctx;
-        this.ctx.lod = !save_all;
-        this.ctx.pdf = true;
-        // Center on saved region
-        if (!save_all)
-            this.ctx.translate(-curx, -cury);
-
-        this.draw_async();
-
-        ctx.stream.on('finish', () => {
-            this.save('sdfg.pdf', ctx.stream.toBlobURL('application/pdf'));
-            this.ctx = oldctx;
-            this.draw_async();
-        });
-    }
-
-    // Draw a debug grid on the canvas to indicate coordinates.
-    debug_draw_grid(curx, cury, endx, endy, grid_width = 100) {
-        const lim_x_min = Math.floor(curx / grid_width) * grid_width;
-        const lim_x_max = Math.ceil(endx / grid_width) * grid_width;
-        const lim_y_min = Math.floor(cury / grid_width) * grid_width;
-        const lim_y_max = Math.ceil(endy / grid_width) * grid_width;
-        for (var i = lim_x_min; i <= lim_x_max; i += grid_width) {
-            this.ctx.moveTo(i, lim_y_min);
-            this.ctx.lineTo(i, lim_y_max);
-        }
-        for (var i = lim_y_min; i <= lim_y_max; i += grid_width) {
-            this.ctx.moveTo(lim_x_min, i);
-            this.ctx.lineTo(lim_x_max, i);
-        }
-        this.ctx.strokeStyle = 'yellow';
-        this.ctx.stroke();
-
-        // Draw the zero-point.
-        this.ctx.beginPath();
-        this.ctx.arc(0, 0, 10, 0, 2 * Math.PI, false);
-        this.ctx.fillStyle = 'red';
-        this.ctx.fill();
-        this.ctx.strokeStyle = 'red';
-        this.ctx.stroke();
-    }
-
-    // Render SDFG
-    draw(dt) {
-        const ctx = this.ctx;
-        const g = this.graph;
-        const curx = this.canvas_manager.mapPixelToCoordsX(0);
-        const cury = this.canvas_manager.mapPixelToCoordsY(0);
-        const endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);
-        const endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);
-        const curw = endx - curx, curh = endy - cury;
-
-        this.visible_rect = { x: curx, y: cury, w: curw, h: curh };
-
-        this.on_pre_draw();
-
-        draw_sdfg(this, ctx, g, this.mousepos, this.debug_draw);
-
-        if (this.box_select_rect) {
-            this.ctx.beginPath();
-            const old_line_width = this.ctx.lineWidth;
-            this.ctx.lineWidth = this.canvas_manager.points_per_pixel();
-            this.ctx.strokeStyle = 'grey';
-            this.ctx.rect(this.box_select_rect.x_start, this.box_select_rect.y_start,
-                this.box_select_rect.x_end - this.box_select_rect.x_start,
-                this.box_select_rect.y_end - this.box_select_rect.y_start);
-            this.ctx.stroke();
-            this.ctx.lineWidth = old_line_width;
-        }
-
-        if (this.debug_draw) {
-            this.debug_draw_grid(curx, cury, endx, endy, 100);
-            if (this.mousepos) {
-                this.dbg_mouse_coords.innerText = 'x: ' + Math.floor(this.mousepos.x) +
-                    ' / y: ' + Math.floor(this.mousepos.y);
-            } else {
-                this.dbg_mouse_coords.innerText = 'x: N/A / y: N/A';
-            }
-        }
-
-        this.on_post_draw();
-    }
-
-    on_pre_draw() { }
-
-    on_post_draw() {
-        if (this.overlay_manager !== null)
-            this.overlay_manager.draw();
-
-        try {
-            this.ctx.end();
-        } catch (ex) {
-            // TODO make sure no error is thrown instead of catching and silently ignoring it?
-        }
-
-        if (this.tooltip) {
-            const br = this.canvas.getBoundingClientRect();
-            const pos = {
-                x: this.realmousepos.x - br.x,
-                y: this.realmousepos.y - br.y
-            };
-
-            // Clear style and contents
-            this.tooltip_container.style = '';
-            this.tooltip_container.innerHTML = '';
-            this.tooltip_container.style.display = 'block';
-
-            // Invoke custom container
-            this.tooltip(this.tooltip_container);
-
-            // Make visible near mouse pointer
-            this.tooltip_container.style.top = pos.y + 'px';
-            this.tooltip_container.style.left = (pos.x + 20) + 'px';
-        } else {
-            this.tooltip_container.style.display = 'none';
-        }
-
-        if (this.sdfg.error) {
-            const error = this.sdfg.error;
-
-            let type = '';
-            let state_id = -1;
-            let el_id = -1;
-            if (error.isedge_id !== undefined) {
-                type = 'isedge';
-                el_id = error.isedge_id;
-            } else if (error.state_id !== undefined) {
-                state_id = error.state_id;
-                if (error.node_id !== undefined) {
-                    type = 'node';
-                    el_id = error.node_id;
-                } else if (error.edge_id !== undefined) {
-                    type = 'edge';
-                    el_id = error.edge_id;
-                } else {
-                    type = 'state';
-                }
-            } else {
-                return;
-            }
-            const offending_element = find_graph_element(
-                this.graph, type, error.sdfg_id, state_id, el_id
-            );
-            if (offending_element) {
-                this.zoom_to_view([offending_element]);
-                this.error_popover_container.style.display = 'block';
-                this.error_popover_container.style.bottom = '5%';
-                this.error_popover_container.style.left = '5%';
-                this.error_popover_text.innerText = error.message;
-            }
-        } else {
-            this.error_popover_container.style.display = 'none';
-        }
-    }
-
-    visible_elements() {
-        const curx = this.canvas_manager.mapPixelToCoordsX(0);
-        const cury = this.canvas_manager.mapPixelToCoordsY(0);
-        const endx = this.canvas_manager.mapPixelToCoordsX(this.canvas.width);
-        const endy = this.canvas_manager.mapPixelToCoordsY(this.canvas.height);
-        const curw = endx - curx;
-        const curh = endy - cury;
-        const elements = [];
-        this.do_for_intersected_elements(curx, cury, curw, curh, (type, e, obj) => {
-            const state_id = e.state ? Number(e.state) : -1;
-            let el_type = 'other';
-            if (type === 'nodes')
-                el_type = 'node';
-            else if (type === 'states')
-                el_type = 'state';
-            else if (type === 'edges')
-                el_type = 'edge';
-            else if (type === 'isedges')
-                el_type = 'isedge';
-            else if (type === 'connectors')
-                el_type = 'connector';
-            elements.push({
-                type: el_type,
-                sdfg_id: Number(e.sdfg_id),
-                state_id: state_id,
-                id: Number(e.id),
-            });
-        });
-        return elements;
-    }
-
-    // Returns a dictionary of SDFG elements in a given rectangle. Used for
-    // selection, rendering, localized transformations, etc.
-    // The output is a dictionary of lists of dictionaries. The top-level keys are:
-    // states, nodes, connectors, edges, isedges (interstate edges). For example:
-    // {'states': [{sdfg: sdfg_name, state: 1}, ...], nodes: [sdfg: sdfg_name, state: 1, node: 5],
-    //              edges: [], isedges: [], connectors: []}
-    elements_in_rect(x, y, w, h) {
-        const elements = {
-            states: [], nodes: [], connectors: [],
-            edges: [], isedges: []
-        };
-        this.do_for_intersected_elements(x, y, w, h, (type, e, obj) => {
-            e.obj = obj;
-            elements[type].push(e);
-        });
-        return elements;
-    }
-
-    do_for_intersected_elements(x, y, w, h, func) {
-        // Traverse nested SDFGs recursively
-        function traverse_recursive(g, sdfg_name, sdfg_id) {
-            g.nodes().forEach(state_id => {
-                const state = g.node(state_id);
-                if (!state) return;
-
-                if (state.intersect(x, y, w, h)) {
-                    // States
-                    func('states', { sdfg: sdfg_name, sdfg_id: sdfg_id, id: state_id }, state);
-
-                    if (state.data.state.attributes.is_collapsed)
-                        return;
-
-                    const ng = state.data.graph;
-                    if (!ng)
-                        return;
-                    ng.nodes().forEach(node_id => {
-                        const node = ng.node(node_id);
-                        if (node.intersect(x, y, w, h)) {
-                            // Selected nodes
-                            func('nodes', { sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, id: node_id }, node);
-
-                            // If nested SDFG, traverse recursively
-                            if (node.data.node.type === "NestedSDFG")
-                                traverse_recursive(node.data.graph,
-                                    node.data.node.attributes.sdfg.attributes.name,
-                                    node.data.node.attributes.sdfg.sdfg_list_id);
-                        }
-                        // Connectors
-                        node.in_connectors.forEach((c, i) => {
-                            if (c.intersect(x, y, w, h))
-                                func('connectors', {
-                                    sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, node: node_id,
-                                    connector: i, conntype: "in"
-                                }, c);
-                        });
-                        node.out_connectors.forEach((c, i) => {
-                            if (c.intersect(x, y, w, h))
-                                func('connectors', {
-                                    sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, node: node_id,
-                                    connector: i, conntype: "out"
-                                }, c);
-                        });
-                    });
-
-                    // Selected edges
-                    ng.edges().forEach(edge_id => {
-                        const edge = ng.edge(edge_id);
-                        if (edge.intersect(x, y, w, h)) {
-                            func('edges', { sdfg: sdfg_name, sdfg_id: sdfg_id, state: state_id, id: edge.id }, edge);
-                        }
-                    });
-                }
-            });
-
-            // Selected inter-state edges
-            g.edges().forEach(isedge_id => {
-                const isedge = g.edge(isedge_id);
-                if (isedge.intersect(x, y, w, h)) {
-                    func('isedges', { sdfg: sdfg_name, sdfg_id: sdfg_id, id: isedge.id }, isedge);
-                }
-            });
-        }
-
-        // Start with top-level SDFG
-        traverse_recursive(this.graph, this.sdfg.attributes.name,
-            this.sdfg.sdfg_list_id);
-    }
-
-    for_all_sdfg_elements(func) {
-        // Traverse nested SDFGs recursively
-        function traverse_recursive(sdfg) {
-            sdfg.nodes.forEach((state, state_id) => {
-                // States
-                func('states', { sdfg: sdfg, id: state_id }, state);
-
-                state.nodes.forEach((node, node_id) => {
-                    // Nodes
-                    func('nodes', { sdfg: sdfg, state: state_id, id: node_id }, node);
-
-                    // If nested SDFG, traverse recursively
-                    if (node.type === "NestedSDFG")
-                        traverse_recursive(node.attributes.sdfg);
-                });
-
-                // Edges
-                state.edges.forEach((edge, edge_id) => {
-                    func('edges', { sdfg: sdfg, state: state_id, id: edge_id }, edge);
-                });
-            });
-
-            // Selected inter-state edges
-            sdfg.edges.forEach((isedge, isedge_id) => {
-                func('isedges', { sdfg: sdfg, id: isedge_id }, isedge);
-            });
-        }
-
-        // Start with top-level SDFG
-        traverse_recursive(this.sdfg);
-    }
-
-    for_all_elements(x, y, w, h, func) {
-        // Traverse nested SDFGs recursively
-        function traverse_recursive(g, sdfg_name) {
-            g.nodes().forEach(state_id => {
-                const state = g.node(state_id);
-                if (!state) return;
-
-                // States
-                func('states', { sdfg: sdfg_name, id: state_id, graph: g }, state, state.intersect(x, y, w, h));
-
-                if (state.data.state.attributes.is_collapsed)
-                    return;
-
-                const ng = state.data.graph;
-                if (!ng)
-                    return;
-                ng.nodes().forEach(node_id => {
-                    const node = ng.node(node_id);
-                    // Selected nodes
-                    func('nodes', { sdfg: sdfg_name, state: state_id, id: node_id, graph: ng }, node, node.intersect(x, y, w, h));
-
-                    // If nested SDFG, traverse recursively
-                    if (node.data.node.type === "NestedSDFG")
-                        traverse_recursive(node.data.graph, node.data.node.attributes.sdfg.attributes.name);
-
-                    // Connectors
-                    node.in_connectors.forEach((c, i) => {
-                        func('connectors', {
-                            sdfg: sdfg_name, state: state_id, node: node_id,
-                            connector: i, conntype: "in", graph: ng
-                        }, c, c.intersect(x, y, w, h));
-                    });
-                    node.out_connectors.forEach((c, i) => {
-                        func('connectors', {
-                            sdfg: sdfg_name, state: state_id, node: node_id,
-                            connector: i, conntype: "out", graph: ng
-                        }, c, c.intersect(x, y, w, h));
-                    });
-                });
-
-                // Selected edges
-                ng.edges().forEach(edge_id => {
-                    const edge = ng.edge(edge_id);
-                    func('edges', { sdfg: sdfg_name, state: state_id, id: edge.id, graph: ng }, edge, edge.intersect(x, y, w, h));
-                });
-            });
-
-            // Selected inter-state edges
-            g.edges().forEach(isedge_id => {
-                const isedge = g.edge(isedge_id);
-                func('isedges', { sdfg: sdfg_name, id: isedge.id, graph: g }, isedge, isedge.intersect(x, y, w, h));
-            });
-        }
-
-        // Start with top-level SDFG
-        traverse_recursive(this.graph, this.sdfg.attributes.name);
-    }
-
-    get_nested_memlet_tree(edge) {
-        for (const tree of this.all_memlet_trees)
-            if (tree.has(edge))
-                return tree;
-        return [];
-    }
-
-    find_elements_under_cursor(mouse_pos_x, mouse_pos_y) {
-        // Find all elements under the cursor.
-        const elements = this.elements_in_rect(mouse_pos_x, mouse_pos_y, 0, 0);
-        const clicked_states = elements.states;
-        const clicked_nodes = elements.nodes;
-        const clicked_edges = elements.edges;
-        const clicked_interstate_edges = elements.isedges;
-        const clicked_connectors = elements.connectors;
-        const total_elements =
-            clicked_states.length + clicked_nodes.length +
-            clicked_edges.length + clicked_interstate_edges.length +
-            clicked_connectors.length;
-        let foreground_elem = null, foreground_surface = -1;
-
-        // Find the top-most element under the mouse cursor (i.e. the one with
-        // the smallest dimensions).
-        const categories = [
-            clicked_states,
-            clicked_interstate_edges,
-            clicked_nodes,
-            clicked_edges
-        ];
-        for (const category of categories) {
-            for (let i = 0; i < category.length; i++) {
-                const s = category[i].obj.width * category[i].obj.height;
-                if (foreground_surface < 0 || s < foreground_surface) {
-                    foreground_surface = s;
-                    foreground_elem = category[i].obj;
-                }
-            }
-        }
-
-        return {
-            total_elements,
-            elements,
-            foreground_elem,
-        };
-    }
-
-    on_key_event(event) {
-        // Prevent handling of the event if the event is designed for something
-        // other than the body, like an input element.
-        if (event.target !== document.body)
-            return;
-
-        if (this.ctrl_key_selection && !event.ctrlKey)
-            this.selectmode_btn.onclick(event, false);
-
-        if (this.shift_key_movement && !event.shiftKey)
-            this.movemode_btn.onclick(event, false);
-
-        if (this.mouse_mode !== 'pan') {
-            if (event.key === 'Escape' && !event.ctrlKey && !event.shiftKey)
-                this.panmode_btn.onclick();
-            return;
-        } else if (event.key === 'Escape') {
-            if (this.selected_elements.length > 0) {
-                this.selected_elements.forEach(el => {
-                    el.selected = false;
-                });
-                this.selected_elements = [];
-                this.draw_async();
-            }
-        } else if (event.key === 'Delete' && event.type === 'keyup') {
-            if (this.selected_elements.length > 0)
-                this.remove_graph_nodes(this.selected_elements);
-            this.selected_elements = [];
-        }
-
-        if (event.ctrlKey && !event.shiftKey)
-            this.selectmode_btn.onclick(event, true);
-
-        if (event.shiftKey && !event.ctrlKey)
-            this.movemode_btn.onclick(event, true);
-
-        return true;
-    }
-
-    on_mouse_event(event, comp_x_func, comp_y_func, evtype = "other") {
-        if (this.ctrl_key_selection || this.shift_key_movement)
-            this.on_key_event(event);
-
-        let dirty = false; // Whether to redraw at the end
-        // Whether the set of visible or selected elements changed
-        let element_focus_changed = false;
-        // Whether the current multi-selection changed
-        let multi_selection_changed = false;
-
-        if (evtype === "mousedown" || evtype === "touchstart") {
-            this.drag_start = event;
-        } else if (evtype === "mouseup") {
-            this.drag_start = null;
-            this.last_dragged_element = null;
-        } else if (evtype === "touchend") {
-            if (event.touches.length == 0)
-                this.drag_start = null;
-            else
-                this.drag_start = event;
-        } else if (evtype === "mousemove") {
-            // Calculate the change in mouse position in canvas coordinates
-            const old_mousepos = this.mousepos;
-            this.mousepos = { x: comp_x_func(event), y: comp_y_func(event) };
-            this.realmousepos = { x: event.clientX, y: event.clientY };
-
-            // Only accept the primary mouse button as dragging source
-            if (this.drag_start && event.buttons & 1) {
-                this.dragging = true;
-
-                if (this.mouse_mode === 'move') {
-                    if (this.last_dragged_element) {
-                        this.canvas.style.cursor = 'grabbing';
-                        this.drag_start.cx = comp_x_func(this.drag_start);
-                        this.drag_start.cy = comp_y_func(this.drag_start);
-                        let elements_to_move = [this.last_dragged_element];
-                        if (this.selected_elements.includes(
-                                this.last_dragged_element
-                            ) && this.selected_elements.length > 1) {
-                            elements_to_move = this.selected_elements.filter(
-                                el => {
-                                    // Do not move connectors (individually)
-                                    if (el instanceof Connector)
-                                        return false;
-                                    let list_id = el.sdfg.sdfg_list_id;
-
-                                    // Do not move element individually if it is
-                                    // moved together with a nested SDFG
-                                    let nested_sdfg_parent =
-                                        this.state_parent_list[list_id];
-                                    if (nested_sdfg_parent &&
-                                        this.selected_elements.includes(
-                                            nested_sdfg_parent
-                                        ))
-                                        return false;
-
-                                    // Do not move element individually if it is
-                                    // moved together with its parent state
-                                    let state_parent =
-                                        this.sdfg_list[list_id].node(
-                                            el.parent_id
-                                        );
-                                    if (state_parent &&
-                                        this.selected_elements.includes(
-                                            state_parent
-                                        ))
-                                        return false;
-
-                                    // Otherwise move individually
-                                    return true;
-                                }
-                            );
-                        }
-
-                        let move_entire_edge = elements_to_move.length > 1;
-                        for (let el of elements_to_move) {
-                            this.canvas_manager.translate_element(
-                                el,
-                                old_mousepos, this.mousepos,
-                                this.graph, this.sdfg_list,
-                                this.state_parent_list,
-                                this.drag_start,
-                                true,
-                                move_entire_edge
-                            );
-                        }
-
-                        dirty = true;
-                        this.draw_async();
-                        return false;
-                    } else {
-                        const mouse_elements = this.find_elements_under_cursor(
-                            this.mousepos.x, this.mousepos.y
-                        );
-                        if (mouse_elements.foreground_elem) {
-                            this.last_dragged_element =
-                                mouse_elements.foreground_elem;
-                            this.canvas.style.cursor = 'grabbing';
-                            return false;
-                        }
-                        return true;
-                    }
-                } else if (this.mouse_mode === 'select') {
-                    this.box_select_rect = {
-                        x_start: comp_x_func(this.drag_start),
-                        y_start: comp_y_func(this.drag_start),
-                        x_end: this.mousepos.x,
-                        y_end: this.mousepos.y,
-                    };
-
-                    // Mark for redraw
-                    dirty = true;
-                } else {
-                    this.canvas_manager.translate(event.movementX,
-                        event.movementY);
-
-                    // Mark for redraw
-                    dirty = true;
-                }
-            } else if (this.drag_start && event.buttons & 4) {
-                // Pan the view with the middle mouse button
-                this.dragging = true;
-                this.canvas_manager.translate(event.movementX, event.movementY);
-                dirty = true;
-                element_focus_changed = true;
-            } else {
-                this.drag_start = null;
-                this.last_dragged_element = null;
-                if (event.buttons & 1 || event.buttons & 4)
-                    return true; // Don't stop propagation
-            }
-        } else if (evtype === "touchmove") {
-            if (this.drag_start.touches.length != event.touches.length) {
-                // Different number of touches, ignore and reset drag_start
-                this.drag_start = event;
-            } else if (event.touches.length == 1) { // Move/drag
-                this.canvas_manager.translate(event.touches[0].clientX - this.drag_start.touches[0].clientX,
-                    event.touches[0].clientY - this.drag_start.touches[0].clientY);
-                this.drag_start = event;
-
-                // Mark for redraw
-                dirty = true;
-                this.draw_async();
-                return false;
-            } else if (event.touches.length == 2) {
-                // Find relative distance between two touches before and after.
-                // Then, center and zoom to their midpoint.
-                const touch1 = this.drag_start.touches[0];
-                const touch2 = this.drag_start.touches[1];
-                let x1 = touch1.clientX, x2 = touch2.clientX;
-                let y1 = touch1.clientY, y2 = touch2.clientY;
-                const oldCenter = [(x1 + x2) / 2.0, (y1 + y2) / 2.0];
-                const initialDistance = Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);
-                x1 = event.touches[0].clientX; x2 = event.touches[1].clientX;
-                y1 = event.touches[0].clientY; y2 = event.touches[1].clientY;
-                const currentDistance = Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);
-                const newCenter = [(x1 + x2) / 2.0, (y1 + y2) / 2.0];
-
-                // First, translate according to movement of center point
-                this.canvas_manager.translate(newCenter[0] - oldCenter[0],
-                    newCenter[1] - oldCenter[1]);
-                // Then scale
-                this.canvas_manager.scale(currentDistance / initialDistance,
-                    newCenter[0], newCenter[1]);
-
-                this.drag_start = event;
-
-                // Mark for redraw
-                dirty = true;
-                this.draw_async();
-                return false;
-            }
-        } else if (evtype === "wheel") {
-            // Get physical x,y coordinates (rather than canvas coordinates)
-            const br = this.canvas.getBoundingClientRect();
-            const x = event.clientX - br.x;
-            const y = event.clientY - br.y;
-            this.canvas_manager.scale(event.deltaY > 0 ? 0.9 : 1.1, x, y);
-            dirty = true;
-            element_focus_changed = true;
-        }
-        // End of mouse-move/touch-based events
-
-        if (!this.mousepos)
-            return true;
-
-        // Find elements under cursor
-        const elements_under_cursor = this.find_elements_under_cursor(
-            this.mousepos.x, this.mousepos.y
-        );
-        const elements = elements_under_cursor.elements;
-        const total_elements = elements_under_cursor.total_elements;
-        const foreground_elem = elements_under_cursor.foreground_elem;
-
-        if (this.mouse_mode == 'add') {
-            let el = this.mouse_follow_element;
-            if (check_valid_add_position(
-                this.add_type, foreground_elem, this.add_mode_lib, this.mousepos
-            ))
-                el.firstElementChild.setAttribute('stroke', 'green');
-            else
-                el.firstElementChild.setAttribute('stroke', 'red');
-
-            el.style.left =
-                (event.layerX - el.firstElementChild.clientWidth / 2) + 'px';
-            el.style.top =
-                (event.layerY - el.firstElementChild.clientHeight / 2) + 'px';
-        }
-
-        // Change mouse cursor accordingly
-        if (this.mouse_mode === 'select') {
-            this.canvas.style.cursor = 'crosshair';
-        } else if (total_elements > 0) {
-            if (this.mouse_mode === 'move' && this.drag_start) {
-                this.canvas.style.cursor = 'grabbing';
-            } else if (this.mouse_mode === 'move') {
-                this.canvas.style.cursor = 'grab';
-            } else {
-                // Hovering over an element while not in any specific mode.
-                if ((foreground_elem.data.state &&
-                     foreground_elem.data.state.attributes.is_collapsed) ||
-                    (foreground_elem.data.node &&
-                     foreground_elem.data.node.attributes.is_collapsed)) {
-                    // This is a collapsed node or state, show with the cursor
-                    // shape that this can be expanded.
-                    this.canvas.style.cursor = 'alias';
-                } else {
-                    this.canvas.style.cursor = 'pointer';
-                }
-            }
-        } else {
-            this.canvas.style.cursor = 'auto';
-        }
-
-        this.tooltip = null;
-        this.last_hovered_elements = elements;
-
-        // De-highlight all elements.
-        this.for_all_elements(this.mousepos.x, this.mousepos.y, 0, 0, (type, e, obj, intersected) => {
-            obj.hovered = false;
-            obj.highlighted = false;
-        });
-        // Mark hovered and highlighted elements.
-        this.for_all_elements(this.mousepos.x, this.mousepos.y, 0, 0, (type, e, obj, intersected) => {
-            // Highlight all edges of the memlet tree
-            if (intersected && obj instanceof Edge && obj.parent_id != null) {
-                const tree = this.get_nested_memlet_tree(obj);
-                tree.forEach(te => {
-                    if (te != obj && te !== undefined) {
-                        te.highlighted = true;
-                    }
-                });
-            }
-
-            // Highlight all access nodes with the same name in the same nested sdfg
-            if (intersected && obj instanceof AccessNode) {
-                traverse_sdfg_scopes(this.sdfg_list[obj.sdfg.sdfg_list_id], (node) => {
-                    // If node is a state, then visit sub-scope
-                    if (node instanceof State) {
-                        return true;
-                    }
-                    if (node instanceof AccessNode && node.data.node.label === obj.data.node.label) {
-                        node.highlighted = true;
-                    }
-                    // No need to visit sub-scope
-                    return false;
-                });
-            }
-
-            // Highlight all access nodes with the same name as the hovered connector in the nested sdfg
-            if (intersected && obj instanceof Connector) {
-                const nested_graph = e.graph.node(obj.parent_id).data.graph;
-                if (nested_graph) {
-                    traverse_sdfg_scopes(nested_graph, (node) => {
-                        // If node is a state, then visit sub-scope
-                        if (node instanceof State) {
-                            return true;
-                        }
-                        if (node instanceof AccessNode && node.data.node.label === obj.label()) {
-                            node.highlighted = true;
-                        }
-                        // No need to visit sub-scope
-                        return false;
-                    });
-                }
-            }
-
-            if (intersected)
-                obj.hovered = true;
-        });
-
-        // If adding an edge, mark/highlight the first/from element, if it has
-        // already been selected.
-        if (this.mouse_mode === 'add' && this.add_type === 'Edge' &&
-            this.add_edge_start) {
-            this.add_edge_start.highlighted = true;
-        }
-
-        if (evtype === "mousemove") {
-            // TODO: Draw only if elements have changed
-            dirty = true;
-        }
-
-        if (evtype === "dblclick") {
-            const sdfg = (foreground_elem ? foreground_elem.sdfg : null);
-            let sdfg_elem = null;
-            if (foreground_elem instanceof State)
-                sdfg_elem = foreground_elem.data.state;
-            else if (foreground_elem instanceof SDFGNode) {
-                sdfg_elem = foreground_elem.data.node;
-
-                // If a scope exit node, use entry instead
-                if (sdfg_elem.type.endsWith("Exit"))
-                    sdfg_elem = sdfg.nodes[foreground_elem.parent_id].nodes[sdfg_elem.scope_entry];
-            } else
-                sdfg_elem = null;
-
-            // Toggle collapsed state
-            if (sdfg_elem && 'is_collapsed' in sdfg_elem.attributes) {
-                sdfg_elem.attributes.is_collapsed = !sdfg_elem.attributes.is_collapsed;
-
-                this.send_new_sdfg_to_vscode();
-
-                // Re-layout SDFG
-                this.relayout();
-                dirty = true;
-                element_focus_changed = true;
-            }
-        }
-
-        let ends_drag = false;
-        if (evtype === 'click') {
-            if (this.dragging) {
-                // This click ends a drag.
-                this.dragging = false;
-                ends_drag = true;
-
-                element_focus_changed = true;
-
-                if (this.box_select_rect) {
-                    let elements_in_selection = [];
-                    let start_x = Math.min(this.box_select_rect.x_start,
-                        this.box_select_rect.x_end);
-                    let end_x = Math.max(this.box_select_rect.x_start,
-                        this.box_select_rect.x_end);
-                    let start_y = Math.min(this.box_select_rect.y_start,
-                        this.box_select_rect.y_end);
-                    let end_y = Math.max(this.box_select_rect.y_start,
-                        this.box_select_rect.y_end);
-                    let w = end_x - start_x;
-                    let h = end_y - start_y;
-                    this.do_for_intersected_elements(start_x, start_y, w, h,
-                        (type, e, obj) => {
-                            if (obj.contained_in(start_x, start_y, w, h))
-                                elements_in_selection.push(obj);
-                        });
-                    if (event.shiftKey && !this.ctrl_key_selection) {
-                        elements_in_selection.forEach((el) => {
-                            if (!this.selected_elements.includes(el))
-                                this.selected_elements.push(el);
-                        });
-                    } else if (event.ctrlKey && !this.ctrl_key_selection) {
-                        elements_in_selection.forEach((el) => {
-                            if (this.selected_elements.includes(el)) {
-                                this.selected_elements =
-                                    this.selected_elements.filter((val) => {
-                                        val.selected = false;
-                                        return val !== el;
-                                    });
-                            }
-                        });
-                    } else {
-                        this.selected_elements.forEach((el) => {
-                            el.selected = false;
-                        });
-                        this.selected_elements = elements_in_selection;
-                    }
-                    this.box_select_rect = null;
-                    dirty = true;
-                    element_focus_changed = true;
-                    multi_selection_changed = true;
-                }
-
-                if (this.mouse_mode === 'move')
-                    this.send_new_sdfg_to_vscode();
-            } else {
-                if (this.mouse_mode === 'add') {
-                    if (check_valid_add_position(
-                        this.add_type, foreground_elem, this.add_mode_lib,
-                        this.mousepos
-                    )) {
-                        if (this.add_type === 'Edge') {
-                            if (this.add_edge_start) {
-                                let start = this.add_edge_start;
-                                this.add_edge_start = undefined;
-                                this.add_node_to_graph(
-                                    this.add_type,
-                                    get_uuid_graph_element(foreground_elem),
-                                    get_uuid_graph_element(start)
-                                );
-                            } else {
-                                this.add_edge_start = foreground_elem;
-                                this.update_toggle_buttons();
-                            }
-                        } else if (this.add_type === 'LibraryNode') {
-                            this.add_position = this.mousepos;
-
-                            this.add_node_to_graph(
-                                this.add_type + '|' + this.add_mode_lib,
-                                get_uuid_graph_element(foreground_elem)
-                            );
-                        } else {
-                            this.add_position = this.mousepos;
-
-                            this.add_node_to_graph(
-                                this.add_type,
-                                get_uuid_graph_element(foreground_elem)
-                            );
-                        }
-
-                        if (!event.ctrlKey && !(this.add_type === 'Edge' &&
-                                                this.add_edge_start)) {
-                            // Cancel add mode.
-                            this.panmode_btn.onclick();
-                        }
-                    }
-                }
-
-                if (foreground_elem) {
-                    if (event.ctrlKey) {
-                        // Ctrl + click on an object, add it, or remove it from
-                        // the selection if it was previously in it.
-                        if (this.selected_elements.includes(foreground_elem)) {
-                            foreground_elem.selected = false;
-                            this.selected_elements =
-                                this.selected_elements.filter((el) => {
-                                    return el !== foreground_elem;
-                                });
-                        } else {
-                            this.selected_elements.push(foreground_elem);
-                        }
-
-                        // Indicate that the multi-selection changed.
-                        multi_selection_changed = true;
-                    } else if (event.shiftKey) {
-                        // TODO: Implement shift-clicks for path selection.
-                    } else {
-                        // Clicked an element, select it and nothing else.
-
-                        // If there was a multi-selection prior to this,
-                        // indicate that it changed.
-                        if (this.selected_elements.length > 1)
-                            multi_selection_changed = true;
-
-                        this.selected_elements.forEach((el) => {
-                            el.selected = false;
-                        });
-                        this.selected_elements = [foreground_elem];
-                    }
-                } else {
-                    // Clicked nothing, clear the selection.
-
-                    // If there was a multi-selection prior to this, indicate
-                    // that it changed.
-                    if (this.selected_elements.length > 1)
-                        multi_selection_changed = true;
-
-                    this.selected_elements.forEach((el) => {
-                        el.selected = false;
-                    });
-                    this.selected_elements = [];
-                }
-                dirty = true;
-                element_focus_changed = true;
-            }
-        }
-        this.selected_elements.forEach((el) => {
-            el.selected = true;
-        });
-
-        if (evtype === "contextmenu") {
-            if (this.mouse_mode == 'move') {
-                let elements_to_reset = [foreground_elem];
-                if (this.selected_elements.includes(foreground_elem))
-                    elements_to_reset = this.selected_elements;
-
-                let element_moved = false;
-                let relayout_necessary = false;
-                for (let el of elements_to_reset) {
-                    let position = get_positioning_info(el);
-                    if (el && !(el instanceof Connector) && position) {
-                        // Reset the position of the element (if it has been
-                        // manually moved)
-                        if (el instanceof Edge) {
-                            if (!position.points)
-                                continue;
-
-                            // Create inverted points to move it back
-                            let new_points = new Array(el.points.length);
-                            for (let j = 1; j < el.points.length - 1; j++) {
-                                new_points[j] = {
-                                    dx: - position.points[j].dx,
-                                    dy: - position.points[j].dy
-                                };
-                                // Reset the point movement
-                                position.points[j].dx = 0;
-                                position.points[j].dy = 0;
-                            }
-
-                            // Move it to original position
-                            this.canvas_manager.translate_element(
-                                el, { x: 0, y: 0 }, { x: 0, y: 0 }, this.graph,
-                                this.sdfg_list, this.state_parent_list,
-                                undefined, false, false, new_points
-                            );
-
-                            element_moved = true;
-                        } else {
-                            let new_x, new_y;
-                            if (!position.dx && !position.dy)
-                                continue;
-
-                            // Calculate original position with the relative
-                            // movement
-                            new_x = el.x - position.dx;
-                            new_y = el.y - position.dy;
-
-                            position.dx = 0;
-                            position.dy = 0;
-
-                            // Move it to original position
-                            this.canvas_manager.translate_element(
-                                el, { x: el.x, y: el.y },
-                                { x: new_x, y: new_y }, this.graph,
-                                this.sdfg_list, this.state_parent_list,
-                                undefined, false, false, undefined
-                            );
-
-                            element_moved = true;
-                        }
-
-                        if (el instanceof EntryNode) {
-                            // Also update scope position
-                            position.scope_dx = 0;
-                            position.scope_dy = 0;
-
-                            if (!el.data.node.attributes.is_collapsed)
-                                relayout_necessary = true;
-                        }
-                    }
-                }
-
-                if (relayout_necessary)
-                    this.relayout();
-
-                this.draw_async();
-
-                if (element_moved)
-                    this.send_new_sdfg_to_vscode();
-
-            } else if (this.mouse_mode == 'add') {
-                // Cancel add mode
-                this.panmode_btn.onclick();
-            }
-        }
-
-        let mouse_x = comp_x_func(event);
-        let mouse_y = comp_y_func(event);
-        if (this.external_mouse_handler)
-            dirty |= this.external_mouse_handler(evtype, event, { x: mouse_x, y: mouse_y }, elements,
-                this, this.selected_elements, ends_drag);
-
-        if (this.overlay_manager !== null) {
-            dirty |= this.overlay_manager.on_mouse_event(
-                evtype,
-                event,
-                { x: mouse_x, y: mouse_y },
-                elements,
-                foreground_elem,
-                ends_drag
-            );
-        }
-
-        if (dirty) {
-            this.draw_async();
-        }
-
-        if (element_focus_changed) {
-            // If a listener in VSCode is present, update it about the new
-            // viewport and tell it to re-sort the shown transformations.
-            try {
-                if (vscode)
-                    vscode_handle_event(
-                        'on_renderer_selection_changed',
-                        {
-                            multi_selection_changed: multi_selection_changed,
-                        }
-                    );
-            } catch (ex) {
-                // Do nothing
-            }
-        }
-
-        return false;
-    }
-}
-
-
-function calculateNodeSize(sdfg_state, node, ctx) {
-    const labelsize = ctx.measureText(node.label).width;
-    const inconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.in_connectors).length - LINEHEIGHT;
-    const outconnsize = 2 * LINEHEIGHT * Object.keys(node.attributes.layout.out_connectors).length - LINEHEIGHT;
-    const maxwidth = Math.max(labelsize, inconnsize, outconnsize);
-    let maxheight = 2 * LINEHEIGHT;
-    maxheight += 4 * LINEHEIGHT;
-
-    const size = { width: maxwidth, height: maxheight }
-
-    // add something to the size based on the shape of the node
-    if (node.type === "AccessNode") {
-        size.height -= 4 * LINEHEIGHT;
-        size.width += size.height;
-    }
-    else if (node.type.endsWith("Entry")) {
-        size.width += 2.0 * size.height;
-        size.height /= 1.75;
-    }
-    else if (node.type.endsWith("Exit")) {
-        size.width += 2.0 * size.height;
-        size.height /= 1.75;
-    }
-    else if (node.type === "Tasklet") {
-        size.width += 2.0 * (size.height / 3.0);
-        size.height /= 1.75;
-    }
-    else if (node.type === "LibraryNode") {
-        size.width += 2.0 * (size.height / 3.0);
-        size.height /= 1.75;
-    }
-    else if (node.type === "Reduce") {
-        size.height -= 4 * LINEHEIGHT;
-        size.width *= 2;
-        size.height = size.width / 3.0;
-    }
-    else {
-    }
-
-    return size;
-}
-
-// Layout SDFG elements (states, nodes, scopes, nested SDFGs)
-function relayout_sdfg(ctx, sdfg, sdfg_list, state_parent_list, omit_access_nodes) {
-    const STATE_MARGIN = 4 * LINEHEIGHT;
-
-    // Layout the SDFG as a dagre graph
-    const g = new dagre.graphlib.Graph();
-    g.setGraph({});
-    g.setDefaultEdgeLabel((u, v) => { return {}; });
-
-    // layout each state to get its size
-    sdfg.nodes.forEach((state) => {
-        let stateinfo = {};
-
-        stateinfo.label = state.id;
-        let state_g = null;
-        if (state.attributes.is_collapsed) {
-            stateinfo.width = ctx.measureText(stateinfo.label).width;
-            stateinfo.height = LINEHEIGHT;
-        }
-        else {
-            state_g = relayout_state(ctx, state, sdfg, sdfg_list,
-                state_parent_list, omit_access_nodes);
-            stateinfo = calculateBoundingBox(state_g);
-        }
-        stateinfo.width += 2 * STATE_MARGIN;
-        stateinfo.height += 2 * STATE_MARGIN;
-        g.setNode(state.id, new State({
-            state: state,
-            layout: stateinfo,
-            graph: state_g
-        }, state.id, sdfg));
-    });
-
-    sdfg.edges.forEach((edge, id) => {
-        g.setEdge(edge.src, edge.dst, new Edge(edge.attributes.data, id, sdfg));
-    });
-
-    dagre.layout(g);
-
-    // Annotate the sdfg with its layout info
-    sdfg.nodes.forEach((state) => {
-        const gnode = g.node(state.id);
-        state.attributes.layout = {};
-        state.attributes.layout.x = gnode.x;
-        state.attributes.layout.y = gnode.y;
-        state.attributes.layout.width = gnode.width;
-        state.attributes.layout.height = gnode.height;
-    });
-
-    sdfg.edges.forEach((edge) => {
-        const gedge = g.edge(edge.src, edge.dst);
-        const bb = calculateEdgeBoundingBox(gedge);
-        // Convert from top-left to center
-        bb.x += bb.width / 2.0;
-        bb.y += bb.height / 2.0;
-
-        gedge.x = bb.x;
-        gedge.y = bb.y;
-        gedge.width = bb.width;
-        gedge.height = bb.height;
-        edge.attributes.layout = {};
-        edge.attributes.layout.width = bb.width;
-        edge.attributes.layout.height = bb.height;
-        edge.attributes.layout.x = bb.x;
-        edge.attributes.layout.y = bb.y;
-        edge.attributes.layout.points = gedge.points;
-    });
-
-    // Offset node and edge locations to be in state margins
-    sdfg.nodes.forEach((s, sid) => {
-        if (s.attributes.is_collapsed)
-            return;
-
-        const state = g.node(sid);
-        const topleft = state.topleft();
-        offset_state(s, state, {
-            x: topleft.x + STATE_MARGIN,
-            y: topleft.y + STATE_MARGIN
-        });
-    });
-
-    const bb = calculateBoundingBox(g);
-    g.width = bb.width;
-    g.height = bb.height;
-
-    // Add SDFG to global store
-    sdfg_list[sdfg.sdfg_list_id] = g;
-
-    return g;
-}
-
-function relayout_state(ctx, sdfg_state, sdfg, sdfg_list, state_parent_list, omit_access_nodes) {
-    // layout the state as a dagre graph
-    const g = new dagre.graphlib.Graph({ multigraph: true });
-
-    // Set layout options and a simpler algorithm for large graphs
-    const layout_options = { ranksep: 30 };
-    if (sdfg_state.nodes.length >= 1000)
-        layout_options.ranker = 'longest-path';
-
-    g.setGraph(layout_options);
-
-
-    // Set an object for the graph label
-    g.setDefaultEdgeLabel((u, v) => { return {}; });
-
-    // Add nodes to the graph. The first argument is the node id. The
-    // second is metadata about the node (label, width, height),
-    // which will be updated by dagre.layout (will add x,y).
-
-    // Process nodes hierarchically
-    let toplevel_nodes = sdfg_state.scope_dict[-1];
-    if (toplevel_nodes === undefined)
-        toplevel_nodes = Object.keys(sdfg_state.nodes);
-    const drawn_nodes = new Set();
-    const hidden_nodes = new Map();
-
-    function layout_node(node) {
-        if (omit_access_nodes && node.type == "AccessNode") {
-            // add access node to hidden nodes; source and destinations will be set later
-            hidden_nodes.set(node.id.toString(), { node: node, src: null, dsts: [] });
-            return;
-        }
-
-        let nested_g = null;
-        node.attributes.layout = {};
-
-        // Set connectors prior to computing node size
-        node.attributes.layout.in_connectors = node.attributes.in_connectors;
-        if ('is_collapsed' in node.attributes && node.attributes.is_collapsed && node.type !== "NestedSDFG")
-            node.attributes.layout.out_connectors = find_exit_for_entry(sdfg_state.nodes, node).attributes.out_connectors;
-        else
-            node.attributes.layout.out_connectors = node.attributes.out_connectors;
-
-        const nodesize = calculateNodeSize(sdfg_state, node, ctx);
-        node.attributes.layout.width = nodesize.width;
-        node.attributes.layout.height = nodesize.height;
-        node.attributes.layout.label = node.label;
-
-        // Recursively lay out nested SDFGs
-        if (node.type === "NestedSDFG") {
-            nested_g = relayout_sdfg(ctx, node.attributes.sdfg, sdfg_list, state_parent_list, omit_access_nodes);
-            const sdfginfo = calculateBoundingBox(nested_g);
-            node.attributes.layout.width = sdfginfo.width + 2 * LINEHEIGHT;
-            node.attributes.layout.height = sdfginfo.height + 2 * LINEHEIGHT;
-        }
-
-        // Dynamically create node type
-        const obj = new SDFGElements[node.type]({ node: node, graph: nested_g }, node.id, sdfg, sdfg_state.id);
-
-        // If it's a nested SDFG, we need to record the node as all of its
-        // state's parent node
-        if (node.type === 'NestedSDFG')
-            state_parent_list[node.attributes.sdfg.sdfg_list_id] = obj;
-
-        // Add input connectors
-        let i = 0;
-        let conns;
-        if (Array.isArray(node.attributes.layout.in_connectors))
-            conns = node.attributes.layout.in_connectors;
-        else
-            conns = Object.keys(node.attributes.layout.in_connectors);
-        for (const cname of conns) {
-            const conn = new Connector({ name: cname }, i, sdfg, node.id);
-            obj.in_connectors.push(conn);
-            i += 1;
-        }
-
-        // Add output connectors -- if collapsed, uses exit node connectors
-        i = 0;
-        if (Array.isArray(node.attributes.layout.out_connectors))
-            conns = node.attributes.layout.out_connectors;
-        else
-            conns = Object.keys(node.attributes.layout.out_connectors);
-        for (const cname of conns) {
-            const conn = new Connector({ name: cname }, i, sdfg, node.id);
-            obj.out_connectors.push(conn);
-            i += 1;
-        }
-
-        g.setNode(node.id, obj);
-        drawn_nodes.add(node.id.toString());
-
-        // Recursively draw nodes
-        if (node.id in sdfg_state.scope_dict) {
-            if (node.attributes.is_collapsed)
-                return;
-            sdfg_state.scope_dict[node.id].forEach((nodeid) => {
-                const node = sdfg_state.nodes[nodeid];
-                layout_node(node);
-            });
-        }
-    }
-
-
-    toplevel_nodes.forEach((nodeid) => {
-        const node = sdfg_state.nodes[nodeid];
-        layout_node(node);
-    });
-
-    // add info to calculate shortcut edges
-    function add_edge_info_if_hidden(edge) {
-        const hidden_src = hidden_nodes.get(edge.src);
-        const hidden_dst = hidden_nodes.get(edge.dst);
-
-        if (hidden_src && hidden_dst) {
-            // if we have edges from an AccessNode to an AccessNode then just connect destinations
-            hidden_src.dsts = hidden_dst.dsts;
-            edge.attributes.data.attributes.shortcut = false;
-        } else if (hidden_src) {
-            // if edge starts at hidden node, then add it as destination
-            hidden_src.dsts.push(edge);
-            edge.attributes.data.attributes.shortcut = false;
-            return true;
-        } else if (hidden_dst) {
-            // if edge ends at hidden node, then add it as source
-            hidden_dst.src = edge;
-            edge.attributes.data.attributes.shortcut = false;
-            return true;
-        }
-
-        // if it is a shortcut edge, but we don't omit access nodes, then ignore this edge
-        if (!omit_access_nodes && edge.attributes.data.attributes.shortcut) return true;
-
-        return false;
-    }
-
-    sdfg_state.edges.forEach((edge, id) => {
-        if (add_edge_info_if_hidden(edge)) return;
-        edge = check_and_redirect_edge(edge, drawn_nodes, sdfg_state);
-        if (!edge) return;
-        const e = new Edge(edge.attributes.data, id, sdfg, sdfg_state.id);
-        edge.attributes.data.edge = e;
-        e.src_connector = edge.src_connector;
-        e.dst_connector = edge.dst_connector;
-        g.setEdge(edge.src, edge.dst, e, id);
-    });
-
-    hidden_nodes.forEach(hidden_node => {
-        if (hidden_node.src) {
-            hidden_node.dsts.forEach(e => {
-                // create shortcut edge with new destination
-                const tmp_edge = e.attributes.data.edge;
-                e.attributes.data.edge = null;
-                const shortcut_e = deepCopy(e);
-                e.attributes.data.edge = tmp_edge;
-                shortcut_e.src = hidden_node.src.src;
-                shortcut_e.src_connector = hidden_node.src.src_connector;
-                shortcut_e.dst_connector = e.dst_connector;
-                // attribute that only shortcut edges have; if it is explicitly false, then edge is ignored in omit access node mode
-                shortcut_e.attributes.data.attributes.shortcut = true;
-
-                // draw the redirected edge
-                const redirected_e = check_and_redirect_edge(shortcut_e, drawn_nodes, sdfg_state);
-                if (!redirected_e) return;
-
-                // abort if shortcut edge already exists
-                const edges = g.outEdges(redirected_e.src);
-                for (const oe of edges) {
-                    if (oe.w == e.dst && sdfg_state.edges[oe.name].dst_connector == e.dst_connector) {
-                        return;
-                    }
-                }
-
-                // add shortcut edge (redirection is not done in this list)
-                sdfg_state.edges.push(shortcut_e);
-
-                // add redirected shortcut edge to graph
-                const edge_id = sdfg_state.edges.length - 1;
-                const shortcut_edge = new Edge(deepCopy(redirected_e.attributes.data), edge_id, sdfg, sdfg_state.id);
-                shortcut_edge.src_connector = redirected_e.src_connector;
-                shortcut_edge.dst_connector = redirected_e.dst_connector;
-                shortcut_edge.data.attributes.shortcut = true;
-
-                g.setEdge(redirected_e.src, redirected_e.dst, shortcut_edge, edge_id);
-            });
-        }
-    });
-
-    dagre.layout(g);
-
-
-    // Layout connectors and nested SDFGs
-    sdfg_state.nodes.forEach((node, id) => {
-        const gnode = g.node(id);
-        if (!gnode || (omit_access_nodes && gnode instanceof AccessNode)) {
-            // ignore nodes that should not be drawn
-            return;
-        }
-        const topleft = gnode.topleft();
-
-        // Offset nested SDFG
-        if (node.type === "NestedSDFG") {
-
-            offset_sdfg(node.attributes.sdfg, gnode.data.graph, {
-                x: topleft.x + LINEHEIGHT,
-                y: topleft.y + LINEHEIGHT
-            });
-        }
-        // Connector management 
-        const SPACING = LINEHEIGHT;
-        const iconn_length = (LINEHEIGHT + SPACING) * Object.keys(node.attributes.layout.in_connectors).length - SPACING;
-        const oconn_length = (LINEHEIGHT + SPACING) * Object.keys(node.attributes.layout.out_connectors).length - SPACING;
-        let iconn_x = gnode.x - iconn_length / 2.0 + LINEHEIGHT / 2.0;
-        let oconn_x = gnode.x - oconn_length / 2.0 + LINEHEIGHT / 2.0;
-
-        for (const c of gnode.in_connectors) {
-            c.width = LINEHEIGHT;
-            c.height = LINEHEIGHT;
-            c.x = iconn_x;
-            iconn_x += LINEHEIGHT + SPACING;
-            c.y = topleft.y;
-        }
-        for (const c of gnode.out_connectors) {
-            c.width = LINEHEIGHT;
-            c.height = LINEHEIGHT;
-            c.x = oconn_x;
-            oconn_x += LINEHEIGHT + SPACING;
-            c.y = topleft.y + gnode.height;
-        }
-    });
-
-    sdfg_state.edges.forEach((edge, id) => {
-        edge = check_and_redirect_edge(edge, drawn_nodes, sdfg_state);
-        if (!edge) return;
-        const gedge = g.edge(edge.src, edge.dst, id);
-        if (!gedge || (omit_access_nodes && gedge.data.attributes.shortcut === false
-            || !omit_access_nodes && gedge.data.attributes.shortcut)) {
-            // if access nodes omitted, don't draw non-shortcut edges and vice versa
-            return;
-        }
-
-        // Reposition first and last points according to connectors
-        let src_conn = null, dst_conn = null;
-        if (edge.src_connector) {
-            const src_node = g.node(edge.src);
-            let cindex = -1;
-            for (let i = 0; i < src_node.out_connectors.length; i++) {
-                if (src_node.out_connectors[i].data.name == edge.src_connector) {
-                    cindex = i;
-                    break;
-                }
-            }
-            if (cindex >= 0) {
-                gedge.points[0].x = src_node.out_connectors[cindex].x;
-                gedge.points[0].y = src_node.out_connectors[cindex].y;
-                src_conn = src_node.out_connectors[cindex];
-            }
-        }
-        if (edge.dst_connector) {
-            const dst_node = g.node(edge.dst);
-            let cindex = -1;
-            for (let i = 0; i < dst_node.in_connectors.length; i++) {
-                if (dst_node.in_connectors[i].data.name == edge.dst_connector) {
-                    cindex = i;
-                    break;
-                }
-            }
-            if (cindex >= 0) {
-                gedge.points[gedge.points.length - 1].x = dst_node.in_connectors[cindex].x;
-                gedge.points[gedge.points.length - 1].y = dst_node.in_connectors[cindex].y;
-                dst_conn = dst_node.in_connectors[cindex];
-            }
-        }
-
-        const n = gedge.points.length - 1;
-        if (src_conn !== null)
-            gedge.points[0] = intersectRect(src_conn, gedge.points[n]);
-        if (dst_conn !== null)
-            gedge.points[n] = intersectRect(dst_conn, gedge.points[0]);
-
-        if (gedge.points.length == 3 && gedge.points[0].x == gedge.points[n].x)
-            gedge.points = [gedge.points[0], gedge.points[n]];
-
-        const bb = calculateEdgeBoundingBox(gedge);
-        // Convert from top-left to center
-        bb.x += bb.width / 2.0;
-        bb.y += bb.height / 2.0;
-
-        edge.width = bb.width;
-        edge.height = bb.height;
-        edge.x = bb.x;
-        edge.y = bb.y;
-        gedge.width = bb.width;
-        gedge.height = bb.height;
-        gedge.x = bb.x;
-        gedge.y = bb.y;
-    });
-
-    return g;
-}
-
diff --git a/src/renderer/renderer_elements.js b/src/renderer/renderer_elements.js
index b290339f..c1636896 100644
--- a/src/renderer/renderer_elements.js
+++ b/src/renderer/renderer_elements.js
@@ -1,24 +1,39 @@
 // Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
 
-import { sdfg_range_elem_to_string } from '../utils/sdfg/display';
-import { sdfg_property_to_string } from "../utils/sdfg/display";
+import { sdfg_range_elem_to_string, sdfg_property_to_string } from '../utils/sdfg/display';
 import { check_and_redirect_edge } from "../utils/sdfg/sdfg_utils";
+import { LINEHEIGHT } from '../utils/constants';
+import { calculateEdgeBoundingBox } from "../utils/bounding_box"
 
 export class SDFGElement {
+    connectorPadding = 10;
+
     // Parent ID is the state ID, if relevant
     constructor(elem, elem_id, sdfg, parent_id = null) {
         this.data = elem;
         this.id = elem_id;
         this.parent_id = parent_id;
         this.sdfg = sdfg;
-        this.in_connectors = [];
-        this.out_connectors = [];
+        this.inConnectors = [];
+        this.outConnectors = [];
 
         // Indicate special drawing conditions based on interactions.
         this.selected = false;
         this.highlighted = false;
         this.hovered = false;
 
+        this.childGraph = elem.graph || null;
+        if (this.childGraph !== null) {
+            this.childGraph.parentNode = this;
+        }
+
+        this.scopeEntry = null;
+        this.scopeExit = null;
+        if (elem.node) {
+            this.scopeEntry = elem.node.scope_entry ? parseInt(elem.node.scope_entry) : null;
+            this.scopeExit = elem.node.scope_exit ? parseInt(elem.node.scope_exit) : null;
+        }
+
         this.set_layout();
     }
 
@@ -28,24 +43,6 @@ export class SDFGElement {
         this.height = this.data.layout.height;
     }
 
-    draw(renderer, ctx, mousepos) { }
-
-    shade(renderer, ctx, color, alpha = '0.6') { }
-
-    debug_draw(renderer, ctx) {
-        if (renderer.debug_draw) {
-            // Print the center and bounding box in debug mode.
-            ctx.beginPath();
-            ctx.arc(this.x, this.y, 1, 0, 2 * Math.PI, false);
-            ctx.fillStyle = 'red';
-            ctx.fill();
-            ctx.strokeStyle = 'red';
-            ctx.stroke();
-            ctx.strokeRect(this.x - (this.width / 2.0), this.y - (this.height / 2.0),
-                this.width, this.height);
-        }
-    }
-
     attributes() {
         return this.data.attributes;
     }
@@ -62,32 +59,10 @@ export class SDFGElement {
         return this.label();
     }
 
-    // Produces HTML for a hover-tooltip
-    tooltip(container) {
-        container.className = 'sdfvtooltip';
-    }
-
     topleft() {
         return { x: this.x - this.width / 2, y: this.y - this.height / 2 };
     }
 
-    strokeStyle(renderer = undefined) {
-        if (this.selected) {
-            if (this.hovered)
-                return this.getCssProperty(renderer, '--color-selected-hovered');
-            else if (this.highlighted)
-                return this.getCssProperty(renderer, '--color-selected-highlighted');
-            else
-                return this.getCssProperty(renderer, '--color-selected');
-        } else {
-            if (this.hovered)
-                return this.getCssProperty(renderer, '--color-hovered');
-            else if (this.highlighted)
-                return this.getCssProperty(renderer, '--color-highlighted');
-        }
-        return this.getCssProperty(renderer, '--color-default');
-    }
-
     // General bounding-box intersection function. Returns true iff point or rectangle intersect element.
     intersect(x, y, w = 0, h = 0) {
         if (w == 0 || h == 0) {  // Point-element intersection
@@ -112,10 +87,10 @@ export class SDFGElement {
         const box_start_y = y;
         const box_end_y = y + h;
 
-        const el_start_x = this.x - (this.width / 2.0);
-        const el_end_x = this.x + (this.width / 2.0);
-        const el_start_y = this.y - (this.height / 2.0);
-        const el_end_y = this.y + (this.height / 2.0);
+        var el_start_x = this.x;
+        var el_end_x = this.x + this.width;
+        var el_start_y = this.y;
+        var el_end_y = this.y + this.height ;
 
         return box_start_x <= el_start_x &&
             box_end_x >= el_end_x &&
@@ -123,122 +98,65 @@ export class SDFGElement {
             box_end_y >= el_end_y;
     }
 
-    getCssProperty(renderer, propertyName) {
-        return window.getComputedStyle(renderer.canvas).getPropertyValue(propertyName).trim();
-    }
-}
-
-// SDFG as an element (to support properties)
-export class SDFG extends SDFGElement {
-    constructor(sdfg) {
-        super(sdfg, -1, sdfg);
+    size() {
+        return {
+            width: this.width,
+            height: this.height,
+        };
     }
 
-    set_layout() {
+    setPosition(position) {
+        const prevX = this.x || 0;
+        const prevY = this.y || 0;
+        const offsetX = position.x - prevX;
+        const offsetY = position.y - prevY;
+        this.x = position.x;
+        this.y = position.y;
+        if (this.childGraph !== null) {
+            this.childGraph.offsetChildren(offsetX, offsetY);
+        }
     }
 
-    label() {
-        return this.data.attributes.name;
+    setSize(size) {
+        this.width = size.width;
+        this.height = size.height;
     }
-}
 
-export class State extends SDFGElement {
-    draw(renderer, ctx, mousepos) {
-        const topleft = this.topleft();
-        const visible_rect = renderer.visible_rect;
-        let clamped = {
-            x: Math.max(topleft.x, visible_rect.x),
-            y: Math.max(topleft.y, visible_rect.y),
-            x2: Math.min(topleft.x + this.width,
-                visible_rect.x + visible_rect.w),
-            y2: Math.min(topleft.y + this.height,
-                visible_rect.y + visible_rect.h)
-        };
-        clamped.w = clamped.x2 - clamped.x;
-        clamped.h = clamped.y2 - clamped.y;
-        if (!ctx.lod)
-            clamped = {
-                x: topleft.x, y: topleft.y,
-                w: this.width, h: this.height
-            };
-
-        ctx.fillStyle = this.getCssProperty(renderer, '--state-background-color');
-        ctx.fillRect(clamped.x, clamped.y, clamped.w, clamped.h);
-        ctx.fillStyle = this.getCssProperty(renderer, '--state-foreground-color');
-
-        if (visible_rect.x <= topleft.x && visible_rect.y <= topleft.y + LINEHEIGHT)
-            ctx.fillText(this.label(), topleft.x, topleft.y + LINEHEIGHT);
-
-        // If this state is selected or hovered
-        if ((this.selected || this.highlighted || this.hovered) &&
-            (clamped.x === topleft.x ||
-                clamped.y === topleft.y ||
-                clamped.x2 === topleft.x + this.width ||
-                clamped.y2 === topleft.y + this.height)) {
-            ctx.strokeStyle = this.strokeStyle(renderer);
-            ctx.strokeRect(clamped.x, clamped.y, clamped.w, clamped.h);
+    boundingBox() {
+        return {
+            x: this.x,
+            y: this.y,
+            width: this.width,
+            height: this.height,
         }
+    }
 
-        // If collapsed, draw a "+" sign in the middle
-        if (this.data.state.attributes.is_collapsed) {
-            ctx.beginPath();
-            ctx.moveTo(this.x, this.y - LINEHEIGHT);
-            ctx.lineTo(this.x, this.y + LINEHEIGHT);
-            ctx.stroke();
-            ctx.beginPath();
-            ctx.moveTo(this.x - LINEHEIGHT, this.y);
-            ctx.lineTo(this.x + LINEHEIGHT, this.y);
-            ctx.stroke();
+    offset(x, y) {
+        this.x += x;
+        this.y += y;
+        if (this.childGraph !== null) {
+            this.childGraph.offsetChildren(x, y);
         }
-
-        ctx.strokeStyle = "black";
     }
+}
 
-    simple_draw(renderer, ctx, mousepos) {
-        // Fast drawing function for small states
-        const topleft = this.topleft();
-
-        ctx.fillStyle = this.getCssProperty(renderer, '--state-background-color');
-        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);
-        ctx.fillStyle = this.getCssProperty(renderer, '--state-text-color');
-
-        if (mousepos && this.intersect(mousepos.x, mousepos.y))
-            renderer.tooltip = (c) => this.tooltip(c);
-        // Draw state name in center without contents (does not look good)
-        /*
-        let FONTSIZE = Math.min(renderer.canvas_manager.points_per_pixel() * 16, 100);
-        let label = this.label();
-
-        let oldfont = ctx.font;
-        ctx.font = FONTSIZE + "px Arial";
-
-        let textmetrics = ctx.measureText(label);
-        ctx.fillText(label, this.x - textmetrics.width / 2.0, this.y - this.height / 6.0 + FONTSIZE / 2.0);
+// SDFG as an element (to support properties)
+export class SDFG extends SDFGElement {
+    childPadding = 4 * LINEHEIGHT;
 
-        ctx.font = oldfont;
-        */
+    constructor(sdfg) {
+        super(sdfg, -1, sdfg);
     }
 
-    shade(renderer, ctx, color, alpha = '0.6') {
-        // Save the current style properties.
-        const orig_fill_style = ctx.fillStyle;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.fillStyle = color;
-
-        const topleft = this.topleft();
-        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);
-
-        // Restore the previous style properties.
-        ctx.fillStyle = orig_fill_style;
-        ctx.globalAlpha = orig_alpha;
+    set_layout() {
     }
 
-    tooltip(container) {
-        container.innerText = 'State: ' + this.label();
+    label() {
+        return this.data.attributes.name;
     }
+}
 
+export class State extends SDFGElement {
     attributes() {
         return this.data.state.attributes;
     }
@@ -253,39 +171,13 @@ export class State extends SDFGElement {
 }
 
 export class SDFGNode extends SDFGElement {
-    draw(renderer, ctx, mousepos, fgstyle = '--node-foreground-color', bgstyle = '--node-background-color') {
-        const topleft = this.topleft();
-        ctx.fillStyle = this.getCssProperty(renderer, bgstyle);
-        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);
-        ctx.strokeStyle = this.strokeStyle(renderer);
-        ctx.strokeRect(topleft.x, topleft.y, this.width, this.height);
-        ctx.fillStyle = this.getCssProperty(renderer, fgstyle);
-        const textw = ctx.measureText(this.label()).width;
-        ctx.fillText(this.label(), this.x - textw / 2, this.y + LINEHEIGHT / 4);
-    }
-
-    simple_draw(renderer, ctx, mousepos) {
-        // Fast drawing function for small nodes
-        const topleft = this.topleft();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');
-        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');
-    }
-
-    shade(renderer, ctx, color, alpha = '0.6') {
-        // Save the current style properties.
-        const orig_fill_style = ctx.fillStyle;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.fillStyle = color;
-
-        const topleft = this.topleft();
-        ctx.fillRect(topleft.x, topleft.y, this.width, this.height);
-
-        // Restore the previous style properties.
-        ctx.fillStyle = orig_fill_style;
-        ctx.globalAlpha = orig_alpha;
+    /**
+     * What stroke style to use for this node.
+     * 
+     * @returns {'normal' | 'bold' | 'double'}
+     */
+    getStrokeStyle() {
+        return 'normal';
     }
 
     label() {
@@ -307,137 +199,6 @@ export class SDFGNode extends SDFGElement {
 }
 
 export class Edge extends SDFGElement {
-
-    create_arrow_line(ctx) {
-        ctx.beginPath();
-        ctx.moveTo(this.points[0].x, this.points[0].y);
-        if (this.points.length === 2) {
-            // Straight line can be drawn
-            ctx.lineTo(this.points[1].x, this.points[1].y);
-        } else {
-            let i;
-            for (i = 1; i < this.points.length - 2; i++) {
-                const xm = (this.points[i].x + this.points[i + 1].x) / 2.0;
-                const ym = (this.points[i].y + this.points[i + 1].y) / 2.0;
-                ctx.quadraticCurveTo(this.points[i].x, this.points[i].y, xm, ym);
-            }
-            ctx.quadraticCurveTo(this.points[i].x, this.points[i].y,
-                this.points[i + 1].x, this.points[i + 1].y);
-        }
-    }
-
-    draw(renderer, ctx, mousepos) {
-        const edge = this;
-
-        this.create_arrow_line(ctx);
-
-        let style = this.strokeStyle(renderer);
-        if (this.hovered)
-            renderer.tooltip = (c) => this.tooltip(c, renderer);
-        if (this.parent_id == null && style === this.getCssProperty(renderer, '--color-default')) {  // Interstate edge
-            style = this.getCssProperty(renderer, '--interstate-edge-color');
-        }
-        ctx.fillStyle = ctx.strokeStyle = style;
-
-        // CR edges have dashed lines
-        if (this.parent_id != null && this.data.attributes.wcr != null)
-            ctx.setLineDash([2, 2]);
-        else
-            ctx.setLineDash([1, 0]);
-
-        ctx.stroke();
-
-        ctx.setLineDash([1, 0]);
-
-        if (edge.points.length < 2)
-            return;
-
-
-        // Show anchor points for moving
-        if (this.selected && renderer.mouse_mode === 'move') {
-            let i;
-            for (i = 1; i < this.points.length - 1; i++)
-                ctx.strokeRect(this.points[i].x - 5, this.points[i].y - 5, 8, 8);
-        }
-
-        drawArrow(ctx, edge.points[edge.points.length - 2], edge.points[edge.points.length - 1], 3);
-    }
-
-    shade(renderer, ctx, color, alpha = '0.6') {
-        this.create_arrow_line(ctx);
-
-        // Save current style properties.
-        const orig_stroke_style = ctx.strokeStyle;
-        const orig_fill_style = ctx.fillStyle;
-        const orig_line_cap = ctx.lineCap;
-        const orig_line_width = ctx.lineWidth;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.lineWidth = orig_line_width + 1;
-        ctx.fillStyle = color;
-        ctx.strokeStyle = color;
-        ctx.lineCap = 'round';
-
-        ctx.stroke();
-
-        if (this.points.length < 2)
-            return;
-        drawArrow(ctx, this.points[this.points.length - 2],
-            this.points[this.points.length - 1], 3, 0, 2);
-
-        // Restore previous stroke style, width, and opacity.
-        ctx.strokeStyle = orig_stroke_style;
-        ctx.fillStyle = orig_fill_style;
-        ctx.lineCap = orig_line_cap;
-        ctx.lineWidth = orig_line_width;
-        ctx.globalAlpha = orig_alpha;
-    }
-
-    tooltip(container, renderer) {
-        super.tooltip(container);
-        const dsettings = renderer.view_settings();
-        const attr = this.attributes();
-        // Memlet
-        if (attr.subset !== undefined) {
-            if (attr.subset === null) {  // Empty memlet
-                container.style.display = 'none';
-                return;
-            }
-            let contents = attr.data;
-            contents += sdfg_property_to_string(attr.subset, dsettings);
-
-            if (attr.other_subset)
-                contents += ' -> ' + sdfg_property_to_string(attr.other_subset, dsettings);
-
-            if (attr.wcr)
-                contents += '<br /><b>CR: ' + sdfg_property_to_string(attr.wcr, dsettings) + '</b>';
-
-            let num_accesses = null;
-            if (attr.volume)
-                num_accesses = sdfg_property_to_string(attr.volume, dsettings);
-            else
-                num_accesses = sdfg_property_to_string(attr.num_accesses, dsettings);
-
-            if (attr.dynamic) {
-                if (num_accesses == 0 || num_accesses == -1)
-                    num_accesses = "<b>Dynamic (unbounded)</b>";
-                else
-                    num_accesses = "<b>Dynamic</b> (up to " + num_accesses + ")";
-            } else if (num_accesses == -1) {
-                num_accesses = "<b>Dynamic (unbounded)</b>";
-            }
-
-            contents += '<br /><font style="font-size: 14px">Volume: ' + num_accesses + '</font>';
-            container.innerHTML = contents;
-        } else {  // Interstate edge
-            container.classList.add('sdfvtooltip--interstate-edge');
-            container.innerText = this.label();
-            if (!this.label())
-                container.style.display = 'none';
-        }
-    }
-
     set_layout() {
         // NOTE: Setting this.width/height will disrupt dagre in self-edges
     }
@@ -449,6 +210,10 @@ export class Edge extends SDFGElement {
         return super.label();
     }
 
+    labelSize() {
+
+    }
+
     intersect(x, y, w = 0, h = 0) {
         // First, check bounding box
         if (!super.intersect(x, y, w, h))
@@ -465,46 +230,35 @@ export class Edge extends SDFGElement {
         }
         return true;
     }
-}
 
-export class Connector extends SDFGElement {
-    draw(renderer, ctx, mousepos) {
-        const scope_connector = (this.data.name.startsWith("IN_") || this.data.name.startsWith("OUT_"));
-        const topleft = this.topleft();
-        ctx.beginPath();
-        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);
-        ctx.closePath();
-        ctx.strokeStyle = this.strokeStyle(renderer);
-        let fillColor;
-        if (scope_connector) {
-            let cname = this.data.name;
-            if (cname.startsWith("IN_"))
-                cname = cname.substring(3);
-            else
-                cname = cname.substring(4);
+    boundingBox() {
+        return calculateEdgeBoundingBox(this);
+    }
 
-            ctx.lineWidth = 0.4;
-            ctx.stroke();
-            ctx.lineWidth = 1.0;
-            fillColor = this.getCssProperty(renderer, '--connector-scoped-color');
-        } else {
-            ctx.stroke();
-            fillColor = this.getCssProperty(renderer, '--connector-unscoped-color');
-        }
-        if (ctx.pdf) // PDFs do not support transparent fill colors
-            fillColor = fillColor.substr(0, 7);
-        ctx.fillStyle = fillColor;
-
-        if (ctx.pdf) { // PDFs do not support stroke and fill on the same object
-            ctx.beginPath();
-            drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);
-            ctx.closePath();
-        }
-        ctx.fill();
-        if (this.strokeStyle(renderer) !== this.getCssProperty(renderer, '--color-default'))
-            renderer.tooltip = (c) => this.tooltip(c);
+    updateBoundingBox() {
+        let bb = calculateEdgeBoundingBox(this);
+        this.x = bb.x;
+        this.y = bb.y;
+        this.width = bb.width;
+        this.height = bb.height;
     }
 
+    offset(x, y) {
+        this.points.forEach(point => {
+            point.x += x;
+            point.y += y;
+        });
+        this.updateBoundingBox();
+    }
+}
+
+export class Connector extends SDFGElement {
+    constructor(elem, elem_id, sdfg, parent_id = null) {
+        super(elem, elem_id, sdfg, parent_id);
+        this.name = elem.name;
+        this.width = LINEHEIGHT;
+        this.height = LINEHEIGHT;
+    }
     attributes() {
         return {};
     }
@@ -512,152 +266,30 @@ export class Connector extends SDFGElement {
     set_layout() { }
 
     label() { return this.data.name; }
-
-    tooltip(container) {
-        super.tooltip(container);
-        container.classList.add('sdfvtooltip--connector');
-        container.innerText = this.label();
-    }
 }
 
 export class AccessNode extends SDFGNode {
-    draw(renderer, ctx, mousepos) {
-        const topleft = this.topleft();
-        ctx.beginPath();
-        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);
-        ctx.closePath();
-        ctx.strokeStyle = this.strokeStyle(renderer);
-
+    getStrokeStyle() {
         const nodedesc = this.sdfg.attributes._arrays[this.data.node.attributes.data];
-        // Streams have dashed edges
-        if (nodedesc && nodedesc.type === "Stream") {
-            ctx.setLineDash([5, 3]);
-        } else {
-            ctx.setLineDash([1, 0]);
-        }
-
-        // Non-transient (external) data is thicker
-        if (nodedesc && nodedesc.attributes.transient === false) {
-            ctx.lineWidth = 3.0;
-        } else {
-            ctx.lineWidth = 1.0;
-        }
-        ctx.stroke();
-        ctx.lineWidth = 1.0;
-        ctx.setLineDash([1, 0]);
-
-        // Views are colored like connectors
-        if (nodedesc && nodedesc.type === "View") {
-            ctx.fillStyle = this.getCssProperty(renderer, '--connector-unscoped-color');
-        } else {
-            ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');
-        }
-
-        if (ctx.pdf) { // PDFs do not support stroke and fill on the same object
-            ctx.beginPath();
-            drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);
-            ctx.closePath();
-        }
-        ctx.fill();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');
-        const textmetrics = ctx.measureText(this.label());
-        ctx.fillText(this.label(), this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 4.0);
-    }
-
-    shade(renderer, ctx, color, alpha = '0.6') {
-        // Save the current style properties.
-        const orig_fill_style = ctx.fillStyle;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.fillStyle = color;
-
-        const topleft = this.topleft();
-        ctx.beginPath();
-        drawEllipse(ctx, topleft.x, topleft.y, this.width, this.height);
-        ctx.closePath();
-        ctx.fill();
-
-        // Restore the previous style properties.
-        ctx.fillStyle = orig_fill_style;
-        ctx.globalAlpha = orig_alpha;
+        return nodedesc && nodedesc.attributes.transient === false ? 'bold' : 'normal';
     }
 
 }
 
 export class ScopeNode extends SDFGNode {
-    draw(renderer, ctx, mousepos) {
-        let draw_shape;
-        if (this.data.node.attributes.is_collapsed) {
-            draw_shape = () => drawHexagon(ctx, this.x, this.y, this.width, this.height);
-        } else {
-            draw_shape = () => drawTrapezoid(ctx, this.topleft(), this, this.scopeend());
-        }
-        ctx.strokeStyle = this.strokeStyle(renderer);
-
-        // Consume scopes have dashed edges
-        if (this.data.node.type.startsWith("Consume"))
-            ctx.setLineDash([5, 3]);
-        else
-            ctx.setLineDash([1, 0]);
-
-        draw_shape();
-        ctx.stroke();
-        ctx.setLineDash([1, 0]);
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');
-        if (ctx.pdf) // PDFs do not support stroke and fill on the same object
-            draw_shape();
-        ctx.fill();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');
-
-        const far_label = this.far_label();
-        drawAdaptiveText(ctx, renderer, far_label,
-            this.close_label(renderer), this.x, this.y,
-            this.width, this.height,
-            SCOPE_LOD);
-    }
-
-    shade(renderer, ctx, color, alpha = '0.6') {
-        // Save the current style properties.
-        const orig_fill_style = ctx.fillStyle;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.fillStyle = color;
-
-        if (this.data.node.attributes.is_collapsed)
-            drawHexagon(ctx, this.x, this.y, this.width, this.height);
-        else
-            drawTrapezoid(ctx, this.topleft(), this, this.scopeend());
-        ctx.fill();
+    childPadding = LINEHEIGHT;
 
-        // Restore the previous style properties.
-        ctx.fillStyle = orig_fill_style;
-        ctx.globalAlpha = orig_alpha;
+    far_label(settings) {
+        const closeLabel = this.close_label(settings);
+        return closeLabel.substring(closeLabel.indexOf('['));
     }
 
-    far_label() {
-        let result = this.attributes().label;
-        if (this.scopeend()) {  // Get label from scope entry
-            const entry = this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];
-            if (entry !== undefined)
-                result = entry.attributes.label;
-            else {
-                result = this.data.node.label;
-                const ind = result.indexOf('[');
-                if (ind > 0)
-                    result = result.substring(0, ind);
-            }
-        }
-        return result;
-    }
-
-    close_label(renderer) {
-        if (!renderer.inclusive_ranges)
+    close_label(settings) {
+        if (!settings.inclusiveRanges)
             return this.label();
 
-        let result = this.far_label();
         let attrs = this.attributes();
+        let result = attrs.label;
         if (this.scopeend()) {
             const entry = this.sdfg.nodes[this.parent_id].nodes[this.data.node.scope_entry];
             if (entry !== undefined)
@@ -672,7 +304,7 @@ export class ScopeNode extends SDFGNode {
         } else {
             for (let i = 0; i < attrs.params.length; ++i) {
                 result += attrs.params[i] + '=';
-                result += sdfg_range_elem_to_string(attrs.range.ranges[i], renderer.view_settings()) + ', ';
+                result += sdfg_range_elem_to_string(attrs.range.ranges[i], settings) + ', ';
             }
             result = result.substring(0, result.length - 2); // Remove trailing comma
         }
@@ -688,181 +320,22 @@ export class ExitNode extends ScopeNode {
     scopeend() { return true; }
 }
 
-export class MapEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([1, 0]); } }
-export class MapExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([1, 0]); } }
-export class ConsumeEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([5, 3]); } }
-export class ConsumeExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([5, 3]); } }
-export class PipelineEntry extends EntryNode { stroketype(ctx) { ctx.setLineDash([10, 3]); } }
-export class PipelineExit extends ExitNode { stroketype(ctx) { ctx.setLineDash([10, 3]); } }
-
-export class Tasklet extends SDFGNode {
-    draw(renderer, ctx, mousepos) {
-        const topleft = this.topleft();
-        drawOctagon(ctx, topleft, this.width, this.height);
-        ctx.strokeStyle = this.strokeStyle(renderer);
-        ctx.stroke();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');
-        if (ctx.pdf) // PDFs do not support stroke and fill on the same object
-            drawOctagon(ctx, topleft, this.width, this.height);
-        ctx.fill();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');
-
-        const ppp = renderer.canvas_manager.points_per_pixel();
-        if (!ctx.lod || ppp < TASKLET_LOD) {
-            // If we are close to the tasklet, show its contents
-            const code = this.attributes().code.string_data;
-            const lines = code.split('\n');
-            let maxline = 0, maxline_len = 0;
-            for (let i = 0; i < lines.length; i++) {
-                if (lines[i].length > maxline_len) {
-                    maxline = i;
-                    maxline_len = lines[i].length;
-                }
-            }
-            const oldfont = ctx.font;
-            ctx.font = "10px courier new";
-            const textmetrics = ctx.measureText(lines[maxline]);
-
-            // Fit font size to 80% height and width of tasklet
-            const height = lines.length * LINEHEIGHT * 1.05;
-            const width = textmetrics.width;
-            const TASKLET_WRATIO = 0.9, TASKLET_HRATIO = 0.5;
-            const hr = height / (this.height * TASKLET_HRATIO);
-            const wr = width / (this.width * TASKLET_WRATIO);
-            const FONTSIZE = Math.min(10 / hr, 10 / wr);
-            const text_yoffset = FONTSIZE / 4;
-
-            ctx.font = FONTSIZE + "px courier new";
-            // Set the start offset such that the middle row of the text is in this.y
-            const y = this.y + text_yoffset - ((lines.length - 1) / 2) * FONTSIZE * 1.05;
-            for (let i = 0; i < lines.length; i++)
-                ctx.fillText(lines[i], this.x - (this.width * TASKLET_WRATIO) / 2.0,
-                    y + i * FONTSIZE * 1.05);
-
-            ctx.font = oldfont;
-            return;
-        }
-
-        const textmetrics = ctx.measureText(this.label());
-        ctx.fillText(this.label(), this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 2.0);
-    }
-
-    shade(renderer, ctx, color, alpha = '0.6') {
-        // Save the current style properties.
-        const orig_fill_style = ctx.fillStyle;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.fillStyle = color;
-
-        drawOctagon(ctx, this.topleft(), this.width, this.height);
-        ctx.fill();
-
-        // Restore the previous style properties.
-        ctx.fillStyle = orig_fill_style;
-        ctx.globalAlpha = orig_alpha;
-    }
-
-}
-
-export class Reduce extends SDFGNode {
-    draw(renderer, ctx, mousepos) {
-        const topleft = this.topleft();
-        const draw_shape = () => {
-            ctx.beginPath();
-            ctx.moveTo(topleft.x, topleft.y);
-            ctx.lineTo(topleft.x + this.width / 2, topleft.y + this.height);
-            ctx.lineTo(topleft.x + this.width, topleft.y);
-            ctx.lineTo(topleft.x, topleft.y);
-            ctx.closePath();
-        };
-        ctx.strokeStyle = this.strokeStyle(renderer);
-        draw_shape();
-        ctx.stroke();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');
-        if (ctx.pdf) // PDFs do not support stroke and fill on the same object
-            draw_shape();
-        ctx.fill();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');
-
-        const far_label = this.label().substring(4, this.label().indexOf(','));
-        drawAdaptiveText(ctx, renderer, far_label,
-            this.label(), this.x, this.y - this.height * 0.2,
-            this.width, this.height,
-            SCOPE_LOD);
-    }
+export class MapEntry extends EntryNode {}
+export class MapExit extends ExitNode {}
+export class ConsumeEntry extends EntryNode {}
+export class ConsumeExit extends ExitNode {}
+export class PipelineEntry extends EntryNode {}
+export class PipelineExit extends ExitNode {}
 
-    shade(renderer, ctx, color, alpha = '0.6') {
-        // Save the current style properties.
-        const orig_fill_style = ctx.fillStyle;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.fillStyle = color;
-
-        const topleft = this.topleft();
-        ctx.beginPath();
-        ctx.moveTo(topleft.x, topleft.y);
-        ctx.lineTo(topleft.x + this.width / 2, topleft.y + this.height);
-        ctx.lineTo(topleft.x + this.width, topleft.y);
-        ctx.lineTo(topleft.x, topleft.y);
-        ctx.closePath();
-        ctx.fill();
-
-        // Restore the previous style properties.
-        ctx.fillStyle = orig_fill_style;
-        ctx.globalAlpha = orig_alpha;
-    }
+export class Tasklet extends SDFGNode {}
 
-}
+export class Reduce extends SDFGNode {}
 
 export class NestedSDFG extends SDFGNode {
-    draw(renderer, ctx, mousepos) {
-        if (this.data.node.attributes.is_collapsed) {
-            const topleft = this.topleft();
-            drawOctagon(ctx, topleft, this.width, this.height);
-            ctx.strokeStyle = this.strokeStyle(renderer);
-            ctx.stroke();
-            drawOctagon(ctx, { x: topleft.x + 2.5, y: topleft.y + 2.5 }, this.width - 5, this.height - 5);
-            ctx.strokeStyle = this.strokeStyle(renderer);
-            ctx.stroke();
-            ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');
-            if (ctx.pdf) // PDFs do not support stroke and fill on the same object
-                drawOctagon(ctx, { x: topleft.x + 2.5, y: topleft.y + 2.5 }, this.width - 5, this.height - 5);
-            ctx.fill();
-            ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');
-            const label = this.data.node.attributes.label;
-            const textmetrics = ctx.measureText(label);
-            ctx.fillText(label, this.x - textmetrics.width / 2.0, this.y + LINEHEIGHT / 4.0);
-            return;
-        }
-
-        // Draw square around nested SDFG
-        super.draw(renderer, ctx, mousepos, '--nested-sdfg-foreground-color',
-            '--nested-sdfg-background-color');
+    childPadding = LINEHEIGHT;
 
-        // Draw nested graph
-        draw_sdfg(renderer, ctx, this.data.graph, mousepos);
-    }
-
-    shade(renderer, ctx, color, alpha = '0.6') {
-        if (this.data.node.attributes.is_collapsed) {
-            // Save the current style properties.
-            const orig_fill_style = ctx.fillStyle;
-            const orig_alpha = ctx.globalAlpha;
-
-            ctx.globalAlpha = alpha;
-            ctx.fillStyle = color;
-
-            drawOctagon(ctx, this.topleft(), this.width, this.height);
-            ctx.fill();
-
-            // Restore the previous style properties.
-            ctx.fillStyle = orig_fill_style;
-            ctx.globalAlpha = orig_alpha;
-        } else {
-            super.shade(renderer, ctx, color, alpha);
-        }
+    getStrokeStyle() {
+        return this.data.node.attributes.is_collapsed ? 'double' : 'normal';
     }
 
     set_layout() {
@@ -890,131 +363,7 @@ export class NestedSDFG extends SDFGNode {
     label() { return ""; }
 }
 
-export class LibraryNode extends SDFGNode {
-    _path(ctx) {
-        const hexseg = this.height / 6.0;
-        const topleft = this.topleft();
-        ctx.beginPath();
-        ctx.moveTo(topleft.x, topleft.y);
-        ctx.lineTo(topleft.x + this.width - hexseg, topleft.y);
-        ctx.lineTo(topleft.x + this.width, topleft.y + hexseg);
-        ctx.lineTo(topleft.x + this.width, topleft.y + this.height);
-        ctx.lineTo(topleft.x, topleft.y + this.height);
-        ctx.closePath();
-    }
-
-    _path2(ctx) {
-        const hexseg = this.height / 6.0;
-        const topleft = this.topleft();
-        ctx.beginPath();
-        ctx.moveTo(topleft.x + this.width - hexseg, topleft.y);
-        ctx.lineTo(topleft.x + this.width - hexseg, topleft.y + hexseg);
-        ctx.lineTo(topleft.x + this.width, topleft.y + hexseg);
-    }
-
-    draw(renderer, ctx, mousepos) {
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-background-color');
-        this._path(ctx);
-        ctx.fill();
-        ctx.strokeStyle = this.strokeStyle(renderer);
-        this._path(ctx);
-        ctx.stroke();
-        this._path2(ctx);
-        ctx.stroke();
-        ctx.fillStyle = this.getCssProperty(renderer, '--node-foreground-color');
-        const textw = ctx.measureText(this.label()).width;
-        ctx.fillText(this.label(), this.x - textw / 2, this.y + LINEHEIGHT / 4);
-    }
-
-    shade(renderer, ctx, color, alpha = '0.6') {
-        // Save the current style properties.
-        const orig_fill_style = ctx.fillStyle;
-        const orig_alpha = ctx.globalAlpha;
-
-        ctx.globalAlpha = alpha;
-        ctx.fillStyle = color;
-
-        this._path(ctx);
-        ctx.fill();
-
-        // Restore the previous style properties.
-        ctx.fillStyle = orig_fill_style;
-        ctx.globalAlpha = orig_alpha;
-    }
-
-}
-
-//////////////////////////////////////////////////////
-
-// Draw an entire SDFG
-export function draw_sdfg(renderer, ctx, sdfg_dagre, mousepos) {
-    const ppp = renderer.canvas_manager.points_per_pixel();
-
-    // Render state machine
-    const g = sdfg_dagre;
-    if (!ctx.lod || ppp < EDGE_LOD)
-        g.edges().forEach(e => {
-            const edge = g.edge(e);
-            edge.draw(renderer, ctx, mousepos);
-            edge.debug_draw(renderer, ctx);
-        });
-
-
-    const visible_rect = renderer.visible_rect;
-
-    // Render each visible state's contents
-    g.nodes().forEach(v => {
-        const node = g.node(v);
-
-        if (ctx.lod && (ppp >= STATE_LOD || node.width / ppp < STATE_LOD)) {
-            node.simple_draw(renderer, ctx, mousepos);
-            node.debug_draw(renderer, ctx);
-            return;
-        }
-        // Skip invisible states
-        if (ctx.lod && !node.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))
-            return;
-
-        node.draw(renderer, ctx, mousepos);
-        node.debug_draw(renderer, ctx);
-
-        const ng = node.data.graph;
-
-        if (!node.data.state.attributes.is_collapsed && ng) {
-            ng.nodes().forEach(v => {
-                const n = ng.node(v);
-
-                if (ctx.lod && !n.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))
-                    return;
-                if (ctx.lod && ppp >= NODE_LOD) {
-                    n.simple_draw(renderer, ctx, mousepos);
-                    n.debug_draw(renderer, ctx);
-                    return;
-                }
-
-                n.draw(renderer, ctx, mousepos);
-                n.debug_draw(renderer, ctx);
-                n.in_connectors.forEach(c => {
-                    c.draw(renderer, ctx, mousepos);
-                    c.debug_draw(renderer, ctx);
-                });
-                n.out_connectors.forEach(c => {
-                    c.draw(renderer, ctx, mousepos);
-                    c.debug_draw(renderer, ctx);
-                });
-            });
-            if (ctx.lod && ppp >= EDGE_LOD)
-                return;
-            ng.edges().forEach(e => {
-                const edge = ng.edge(e);
-                if (ctx.lod && !edge.intersect(visible_rect.x, visible_rect.y, visible_rect.w, visible_rect.h))
-                    return;
-                edge.draw(renderer, ctx, mousepos);
-                edge.debug_draw(renderer, ctx);
-            });
-        }
-    });
-}
+export class LibraryNode extends SDFGNode {}
 
 // Translate an SDFG by a given offset
 export function offset_sdfg(sdfg, sdfg_graph, offset) {
@@ -1047,11 +396,11 @@ export function offset_state(state, state_graph, offset) {
 
         node.x += offset.x;
         node.y += offset.y;
-        node.in_connectors.forEach(c => {
+        node.inConnectors.forEach(c => {
             c.x += offset.x;
             c.y += offset.y;
         });
-        node.out_connectors.forEach(c => {
+        node.outConnectors.forEach(c => {
             c.x += offset.x;
             c.y += offset.y;
         });
@@ -1073,120 +422,6 @@ export function offset_state(state, state_graph, offset) {
     });
 }
 
-
-///////////////////////////////////////////////////////
-
-export function drawAdaptiveText(ctx, renderer, far_text, close_text,
-    x, y, w, h, ppp_thres, max_font_size = 50,
-    font_multiplier = 16) {
-    const ppp = renderer.canvas_manager.points_per_pixel();
-    let label = close_text;
-    let FONTSIZE = Math.min(ppp * font_multiplier, max_font_size);
-    let yoffset = LINEHEIGHT / 2.0;
-    const oldfont = ctx.font;
-    if (ctx.lod && ppp >= ppp_thres) { // Far text
-        ctx.font = FONTSIZE + "px sans-serif";
-        label = far_text;
-        yoffset = FONTSIZE / 2.0 - h / 6.0;
-    }
-
-    const textmetrics = ctx.measureText(label);
-    let tw = textmetrics.width;
-    if (ctx.lod && ppp >= ppp_thres && tw > w) {
-        FONTSIZE = FONTSIZE / (tw / w);
-        ctx.font = FONTSIZE + "px sans-serif";
-        yoffset = FONTSIZE / 2.0 - h / 6.0;
-        tw = w;
-    }
-
-    ctx.fillText(label, x - tw / 2.0, y + yoffset);
-
-    if (ctx.lod && ppp >= ppp_thres)
-        ctx.font = oldfont;
-}
-
-export function drawHexagon(ctx, x, y, w, h, offset) {
-    const topleft = { x: x - w / 2.0, y: y - h / 2.0 };
-    const hexseg = h / 3.0;
-    ctx.beginPath();
-    ctx.moveTo(topleft.x, y);
-    ctx.lineTo(topleft.x + hexseg, topleft.y);
-    ctx.lineTo(topleft.x + w - hexseg, topleft.y);
-    ctx.lineTo(topleft.x + w, y);
-    ctx.lineTo(topleft.x + w - hexseg, topleft.y + h);
-    ctx.lineTo(topleft.x + hexseg, topleft.y + h);
-    ctx.lineTo(topleft.x, y);
-    ctx.closePath();
-}
-
-export function drawOctagon(ctx, topleft, width, height) {
-    const octseg = height / 3.0;
-    ctx.beginPath();
-    ctx.moveTo(topleft.x, topleft.y + octseg);
-    ctx.lineTo(topleft.x + octseg, topleft.y);
-    ctx.lineTo(topleft.x + width - octseg, topleft.y);
-    ctx.lineTo(topleft.x + width, topleft.y + octseg);
-    ctx.lineTo(topleft.x + width, topleft.y + 2 * octseg);
-    ctx.lineTo(topleft.x + width - octseg, topleft.y + height);
-    ctx.lineTo(topleft.x + octseg, topleft.y + height);
-    ctx.lineTo(topleft.x, topleft.y + 2 * octseg);
-    ctx.lineTo(topleft.x, topleft.y + 1 * octseg);
-    ctx.closePath();
-}
-
-// Adapted from https://stackoverflow.com/a/2173084/6489142
-export function drawEllipse(ctx, x, y, w, h) {
-    const kappa = .5522848,
-        ox = (w / 2) * kappa, // control point offset horizontal
-        oy = (h / 2) * kappa, // control point offset vertical
-        xe = x + w,           // x-end
-        ye = y + h,           // y-end
-        xm = x + w / 2,       // x-middle
-        ym = y + h / 2;       // y-middle
-
-    ctx.moveTo(x, ym);
-    ctx.bezierCurveTo(x, ym - oy, xm - ox, y, xm, y);
-    ctx.bezierCurveTo(xm + ox, y, xe, ym - oy, xe, ym);
-    ctx.bezierCurveTo(xe, ym + oy, xm + ox, ye, xm, ye);
-    ctx.bezierCurveTo(xm - ox, ye, x, ym + oy, x, ym);
-}
-
-export function drawArrow(ctx, p1, p2, size, offset = 0, padding = 0) {
-    ctx.save();
-    // Rotate the context to point along the path
-    const dx = p2.x - p1.x;
-    const dy = p2.y - p1.y;
-    ctx.translate(p2.x, p2.y);
-    ctx.rotate(Math.atan2(dy, dx));
-
-    // arrowhead
-    ctx.beginPath();
-    ctx.moveTo(0 + padding + offset, 0);
-    ctx.lineTo(((-2 * size) - padding) - offset, -(size + padding));
-    ctx.lineTo(((-2 * size) - padding) - offset, (size + padding));
-    ctx.closePath();
-    ctx.fill();
-    ctx.restore();
-}
-
-export function drawTrapezoid(ctx, topleft, node, inverted = false) {
-    ctx.beginPath();
-    if (inverted) {
-        ctx.moveTo(topleft.x, topleft.y);
-        ctx.lineTo(topleft.x + node.width, topleft.y);
-        ctx.lineTo(topleft.x + node.width - node.height, topleft.y + node.height);
-        ctx.lineTo(topleft.x + node.height, topleft.y + node.height);
-        ctx.lineTo(topleft.x, topleft.y);
-    } else {
-        ctx.moveTo(topleft.x, topleft.y + node.height);
-        ctx.lineTo(topleft.x + node.width, topleft.y + node.height);
-        ctx.lineTo(topleft.x + node.width - node.height, topleft.y);
-        ctx.lineTo(topleft.x + node.height, topleft.y);
-        ctx.lineTo(topleft.x, topleft.y + node.height);
-    }
-    ctx.closePath();
-}
-
 // Returns the distance from point p to line defined by two points (line1, line2)
 export function ptLineDistance(p, line1, line2) {
     const dx = (line2.x - line1.x);
@@ -1214,6 +449,3 @@ export const SDFGElements = {
     SDFGElement, SDFG, State, SDFGNode, Edge, Connector, AccessNode, ScopeNode, EntryNode, ExitNode, MapEntry, MapExit,
     ConsumeEntry, ConsumeExit, Tasklet, Reduce, PipelineEntry, PipelineExit, NestedSDFG, LibraryNode
 };
-
-// TODO remove this global variable assignment once DIODE is removed/no longer relies on it
-Object.assign(globalThis, SDFGElements);
diff --git a/src/sdfv.js b/src/sdfv.js
index ada17dd3..c4bdf1aa 100644
--- a/src/sdfv.js
+++ b/src/sdfv.js
@@ -2,11 +2,10 @@
 
 import { parse_sdfg, stringify_sdfg } from "./utils/sdfg/json_serializer";
 import { mean, median } from 'mathjs';
-import { SDFGRenderer } from './renderer/renderer';
 import { GenericSdfgOverlay } from "./overlays/generic_sdfg_overlay";
 import { SDFVUIHandlers } from "./sdfv_ui_handlers";
 import { htmlSanitize } from "./utils/sanitization";
-import { SDFGElements } from "./renderer/renderer_elements";
+import { SDFG, SDFGElements } from "./renderer/renderer_elements";
 import { assignIfNotExists } from "./utils/utils"
 import {
     sdfg_property_to_string,
@@ -22,9 +21,10 @@ import { traverse_sdfg_scopes } from "./utils/sdfg/traversal";
 import { RuntimeMicroSecondsOverlay } from "./overlays/runtime_micro_seconds_overlay";
 import { MemoryVolumeOverlay } from "./overlays/memory_volume_overlay";
 import { StaticFlopsOverlay } from "./overlays/static_flops_overlay";
+import { PixiRenderer, DefaultLayouters } from "./renderer/pixi/pixi_renderer";
+import _ from "lodash";
 const { $ } = globalThis;
 
-let fr;
 let file = null;
 let instrumentation_file = null;
 
@@ -35,7 +35,7 @@ let instrumentation_file = null;
 export const globals = assignIfNotExists(
     /** @type {{}} */ (globalThis),
     {
-        daceRenderer: null,
+        daceRenderer: /** @type {PixiRenderer | null} */ (null),
         daceUIHandlers: SDFVUIHandlers,
         daceInitSDFV: init_sdfv,
         daceParseSDFG: parse_sdfg,
@@ -48,7 +48,7 @@ export const globals = assignIfNotExists(
         daceTraverseSDFGScopes: traverse_sdfg_scopes,
         daceSDFGTypeclassToString: sdfg_typeclass_to_string,
         daceStringToSDFGTypeclass: string_to_sdfg_typeclass,
-        daceSDFGRenderer: SDFGRenderer,
+        dacePixiRenderer: PixiRenderer,
         daceSDFGElements: SDFGElements,
         daceGenericSDFGOverlay: GenericSdfgOverlay,
         daceMemoryVolumeOverlay: MemoryVolumeOverlay,
@@ -58,7 +58,9 @@ export const globals = assignIfNotExists(
     }
 );
 
-
+let lastSDFG = null;
+let user_transform = null;
+let debug_draw = null;
 
 if (document.currentScript.hasAttribute('data-sdfg-json')) {
     init_sdfv(parse_sdfg(document.currentScript.getAttribute('data-sdfg-json')));
@@ -71,7 +73,10 @@ if (document.currentScript.hasAttribute('data-sdfg-json')) {
 }
 
 
-function init_sdfv(sdfg, user_transform = null, debug_draw = false) {
+function init_sdfv(sdfg, user_transform_val = null, debug_draw_val = false) {
+    user_transform = user_transform_val;
+    debug_draw = debug_draw_val;
+
     $('#sdfg-file-input').change((e) => {
         if (e.target.files.length < 1)
             return;
@@ -80,7 +85,7 @@ function init_sdfv(sdfg, user_transform = null, debug_draw = false) {
     });
     $('#menuclose').click(() => close_menu());
     $('#reload').click(() => {
-        reload_file();
+        reload_file() || refresh();
     });
     $('#instrumentation-report-file-input').change((e) => {
         if (e.target.files.length < 1)
@@ -90,14 +95,10 @@ function init_sdfv(sdfg, user_transform = null, debug_draw = false) {
     });
     $('#outline').click(() => {
         if (globals.daceRenderer)
-            setTimeout(() => outline(globals.daceRenderer, globals.daceRenderer.graph), 1);
+            setTimeout(() => outline(globals.daceRenderer, globals.daceRenderer.getRenderGraph()), 1);
     });
     $('#search-btn').click(() => {
-        if (globals.daceRenderer)
-            setTimeout(() => {
-                find_in_graph(globals.daceRenderer, globals.daceRenderer.graph, $('#search').val(),
-                    $('#search-case')[0].checked);
-            }, 1);
+        start_find_in_graph();
     });
     $('#search').on('keydown', (e) => {
         if (e.key == 'Enter' || e.which == 13) {
@@ -106,67 +107,61 @@ function init_sdfv(sdfg, user_transform = null, debug_draw = false) {
         }
     });
 
-    let mode_buttons = null;
-    let pan_btn = document.getElementById("pan-btn");
-    let move_btn = document.getElementById("move-btn");
-    let select_btn = document.getElementById("select-btn");
-    let add_btns = [];
-    add_btns.push(document.getElementById('elem_map'));
-    add_btns.push(document.getElementById('elem_consume'));
-    add_btns.push(document.getElementById('elem_tasklet'));
-    add_btns.push(document.getElementById('elem_nested_sdfg'));
-    add_btns.push(document.getElementById('elem_access_node'));
-    add_btns.push(document.getElementById('elem_stream'));
-    add_btns.push(document.getElementById('elem_state'));
-    if (pan_btn)
-        mode_buttons = {
-            pan: pan_btn,
-            move: move_btn,
-            select: select_btn,
-            add_btns: add_btns,
-        };
-
-    if (sdfg !== null)
-        globals.daceRenderer = new SDFGRenderer(
-            sdfg, document.getElementById('contents'), mouse_event,
-            user_transform, debug_draw, null, mode_buttons
-        );
+    if (sdfg !== null) refresh(sdfg);
 }
 
 function start_find_in_graph() {
     if (globals.daceRenderer)
         setTimeout(() => {
             find_in_graph(
-                globals.daceRenderer, globals.daceRenderer.graph,
+                globals.daceRenderer, globals.daceRenderer.getRenderGraph(),
                 $('#search').val(), $('#search-case')[0].checked
             );
-        }, 1);
+        }, 1);  
+}
+
+function refresh(sdfg = null) {
+    if (globals.daceRenderer)
+        globals.daceRenderer.destroy();
+    if (!sdfg) {
+        if (!lastSDFG) throw new Error('No SDFG supplied!');
+        else sdfg = lastSDFG;
+    }
+
+    globals.daceRenderer = new PixiRenderer(
+        _.cloneDeep(sdfg),
+        document.getElementById('contents'),
+        mouse_event,
+        debug_draw,
+        DefaultLayouters.sugiyama,
+    );
+    lastSDFG = sdfg;
 }
 
 function reload_file() {
     if (!file)
-        return;
-    fr = new FileReader();
-    fr.onload = file_read_complete;
+        return false;
+    const fr = new FileReader();
+    fr.onload = () => file_read_complete(fr);
     fr.readAsText(file);
+    return true;
 }
 
-function file_read_complete() {
+function file_read_complete(fr) {
     const sdfg = parse_sdfg(fr.result);
-    globals.daceRenderer?.destroy();
-    globals.daceRenderer = new SDFGRenderer(sdfg, document.getElementById('contents'), mouse_event);
+    refresh(sdfg);
     close_menu();
 }
 
 function load_instrumentation_report() {
     if (!instrumentation_file)
         return;
-    fr = new FileReader();
-    fr.onload = load_instrumentation_report_callback;
+    const fr = new FileReader();
+    fr.onload = () => load_instrumentation_report_callback(fr);
     fr.readAsText(instrumentation_file);
 }
 
-function load_instrumentation_report_callback() {
+function load_instrumentation_report_callback(fr) {
     instrumentation_report_read_complete(JSON.parse(fr.result));
 }
 
@@ -226,24 +221,9 @@ function instrumentation_report_read_complete(report) {
             runtime_map[key] = runtime_summary;
         }
 
-        const renderer = globals.daceRenderer;
-
-        if (renderer.overlay_manager) {
-            if (!renderer.overlay_manager.is_overlay_active(
-                RuntimeMicroSecondsOverlay
-            )) {
-                renderer.overlay_manager.register_overlay(
-                    RuntimeMicroSecondsOverlay
-                );
-            }
-            const ol = renderer.overlay_manager.get_overlay(
-                RuntimeMicroSecondsOverlay
-            );
-            if (ol) {
-                ol.runtime_map = runtime_map;
-                ol.refresh();
-            }
-        }
+        globals.daceRenderer.updateSettings({
+            runtimeMap: runtime_map,
+        });
     }
 }
 
@@ -281,8 +261,7 @@ function load_sdfg_from_url(url) {
 }
 
 function find_recursive(graph, query, results, case_sensitive) {
-    for (const nodeid of graph.nodes()) {
-        const node = graph.node(nodeid);
+    for (const node of graph.nodes()) {
         let label = node.label();
         if (!case_sensitive)
             label = label.toLowerCase();
@@ -292,8 +271,7 @@ function find_recursive(graph, query, results, case_sensitive) {
         if (node.data.graph)
             find_recursive(node.data.graph, query, results, case_sensitive);
     }
-    for (const edgeid of graph.edges()) {
-        const edge = graph.edge(edgeid);
+    for (const edge of graph.edges()) {
         let label = edge.label();
         if (label !== undefined) {
             if (!case_sensitive)
@@ -314,7 +292,7 @@ function find_in_graph(renderer, sdfg, query, case_sensitive=false) {
 
     // Zoom to bounding box of all results first
     if (results.length > 0)
-        renderer.zoom_to_view(results);
+        globals.daceRenderer.zoomToView(results.map(x => x.layoutElement));
 
     // Show clickable results in sidebar
     const sidebar = sidebar_get_contents();
@@ -323,18 +301,12 @@ function find_in_graph(renderer, sdfg, query, case_sensitive=false) {
         const d = document.createElement('div');
         d.className = 'context_menu_option';
         d.innerHTML = htmlSanitize`${result.type()} ${result.label()}`;
-        d.onclick = () => { renderer.zoom_to_view([result]) };
+        d.onclick = () => { globals.daceRenderer.zoomToView([result.layoutElement]) };
         d.onmouseenter = () => {
-            if (!result.highlighted) {
-                result.highlighted = true;
-                renderer.draw_async();
-            }
+            globals.daceRenderer.setHighlighted([result.layoutElement]);
         };
         d.onmouseleave = () => {
-            if (result.highlighted) {
-                result.highlighted = false;
-                renderer.draw_async();
-            }
+            globals.daceRenderer.setHighlighted([]);
         };
         sidebar.appendChild(d);
     }
@@ -344,8 +316,7 @@ function find_in_graph(renderer, sdfg, query, case_sensitive=false) {
 
 function recursive_find_graph(graph, sdfg_id) {
     let found = undefined;
-    graph.nodes().forEach(n_id => {
-        const n = graph.node(n_id);
+    graph.nodes().forEach(n => {
         if (n && n.sdfg.sdfg_list_id === sdfg_id) {
             found = graph;
             return found;
@@ -359,36 +330,15 @@ function recursive_find_graph(graph, sdfg_id) {
 }
 
 function find_state(graph, state_id) {
-    let state = undefined;
-    graph.nodes().forEach(s_id => {
-        if (Number(s_id) === state_id) {
-            state = graph.node(s_id);
-            return state;
-        }
-    });
-    return state;
+    return graph.node(state_id);
 }
 
 function find_node(state, node_id) {
-    let node = undefined;
-    state.data.graph.nodes().forEach(n_id => {
-        if (Number(n_id) === node_id) {
-            node = state.data.graph.node(n_id);
-            return node;
-        }
-    });
-    return node;
+    state.data.graph.node(node_id);
 }
 
 function find_edge(state, edge_id) {
-    let edge = undefined;
-    state.data.graph.edges().forEach(e_id => {
-        if (Number(e_id.name) === edge_id) {
-            edge = state.data.graph.edge(e_id);
-            return edge;
-        }
-    });
-    return edge;
+    state.data.graph.edge(edge_id);
 }
 
 function find_graph_element(graph, type, sdfg_id, state_id = -1, el_id = -1) {
@@ -424,18 +374,16 @@ function find_graph_element(graph, type, sdfg_id, state_id = -1, el_id = -1) {
     return undefined;
 }
 
-function mouse_event(evtype, event, mousepos, elements, renderer,
-    selected_elements, ends_drag) {
+function mouse_event(evtype, event, mousepos, renderer, selected_elements, ends_drag) {
     if ((evtype === 'click' && !ends_drag) || evtype === 'dblclick') {
-        if (renderer.menu)
-            renderer.menu.destroy();
         let element;
-        if (selected_elements.length === 0)
-            element = new SDFG(renderer.sdfg);
-        else if (selected_elements.length === 1)
+        if (selected_elements.length === 0) {
+            element = new SDFG(globals.daceRenderer.getSDFG());
+        } else if (selected_elements.length === 1) {
             element = selected_elements[0];
-        else
+        } else {
             element = null;
+        }
 
         if (element !== null) {
             sidebar_set_title(element.type() + " " + element.label());
@@ -469,8 +417,8 @@ function close_menu() {
     return globals.daceUIHandlers.on_close_menu();
 }
 
-function outline(renderer, sdfg) {
-    return globals.daceUIHandlers.on_outline(renderer, sdfg);
+function outline(renderer, renderGraph) {
+    return globals.daceUIHandlers.on_outline(renderer, renderGraph);
 }
 
 export function fill_info(elem) {
diff --git a/src/sdfv_ui_handlers.js b/src/sdfv_ui_handlers.js
index f781072f..56eac45d 100644
--- a/src/sdfv_ui_handlers.js
+++ b/src/sdfv_ui_handlers.js
@@ -3,7 +3,7 @@
 import { sdfg_property_to_string } from "./utils/sdfg/display";
 import { traverse_sdfg_scopes } from "./utils/sdfg/traversal";
 import { htmlSanitize } from "./utils/sanitization";
-import { globals } from "./sdfv";
+import { AccessNode, Edge } from "./renderer/renderer_elements";
 
 export const SDFVUIHandlers = {
     on_init_menu,
@@ -37,31 +37,27 @@ function on_fill_info(elem) {
         html += "<h4>Connectors: " + sdfg_edge.src_connector + " &rarr; " +
             sdfg_edge.dst_connector + "</h4>";
     }
-    html += "<hr />";
+    html += htmlSanitize`<hr />`;
 
-    for (let attr of Object.entries(elem.attributes())) {
+    for (const attr of Object.entries(elem.attributes())) {
         if (attr[0] === "layout" || attr[0] === "sdfg" ||
             attr[0] === "_arrays" || attr[0].startsWith("_meta_") ||
             attr[0] == "position")
             continue;
-        html += "<b>" + attr[0] + "</b>:&nbsp;&nbsp;";
-        html += sdfg_property_to_string(
-            attr[1], globals.daceRenderer.view_settings()
-        ) + "</p>";
+        html += htmlSanitize`<p><b>${attr[0]}</b>:&nbsp;&nbsp;`;
+        html += htmlSanitize`${sdfg_property_to_string(attr[1], globalThis.daceRenderer.getSettings())}</p>`;
     }
 
     // If access node, add array information too
     if (elem instanceof AccessNode) {
-        let sdfg_array = elem.sdfg.attributes._arrays[elem.attributes().data];
-        html += "<br /><h4>" + sdfg_array.type + " properties:</h4>";
-        for (let attr of Object.entries(sdfg_array.attributes)) {
+        const sdfg_array = elem.sdfg.attributes._arrays[elem.attributes().data];
+        html += htmlSanitize`<br /><h4>${sdfg_array.type} properties:</h4>`;
+        for (const attr of Object.entries(sdfg_array.attributes)) {
             if (attr[0] === "layout" || attr[0] === "sdfg" ||
                 attr[0].startsWith("_meta_"))
                 continue;
-            html += "<b>" + attr[0] + "</b>:&nbsp;&nbsp;";
-            html += sdfg_property_to_string(
-                attr[1], globals.daceRenderer.view_settings()
-            ) + "</p>";
+            html += htmlSanitize`<p><b>${attr[0]}</b>:&nbsp;&nbsp;`;
+            html += htmlSanitize`${sdfg_property_to_string(attr[1], globalThis.daceRenderer.getSettings())}</p>`;
         }
     }
 
@@ -69,6 +65,12 @@ function on_fill_info(elem) {
 }
 
 function on_outline(renderer, sdfg) {
+    if (!sdfg) {
+        // will occur when we use ExampleLayouter or other renderers that don't create a render graph
+        alert(`This layouter does not support this feature!`);
+        return;
+    }
+
     on_sidebar_set_title('SDFG Outline');
 
     const sidebar = sidebar_get_contents();
@@ -77,8 +79,8 @@ function on_outline(renderer, sdfg) {
     // Entire SDFG
     const d = document.createElement('div');
     d.className = 'context_menu_option';
-    d.innerHTML = htmlSanitize`<i class="material-icons" style="font-size: inherit">filter_center_focus</i> SDFG ${renderer.sdfg.attributes.name}`;
-    d.onclick = () => renderer.zoom_to_view();
+    d.innerHTML = htmlSanitize`<i class="material-icons" style="font-size: inherit">filter_center_focus</i> SDFG ${renderer.getSDFG().attributes.name}`;
+    d.onclick = () => renderer.zoomToView();
     sidebar.appendChild(d);
 
     const stack = [sidebar];
@@ -118,7 +120,7 @@ function on_outline(renderer, sdfg) {
                 }
             }
 
-            renderer.zoom_to_view(nodes_to_display);
+            renderer.zoomToView(nodes_to_display.map(x => x.layoutElement));
 
             // Ensure that the innermost div is the one that handles the event
             if (!e) e = window.event;
diff --git a/src/utils/bounding_box.js b/src/utils/bounding_box.js
index 9e7bc9b5..191bdc16 100644
--- a/src/utils/bounding_box.js
+++ b/src/utils/bounding_box.js
@@ -7,10 +7,10 @@ export function calculateBoundingBox(g) {
     bb.height = 0;
 
     g.nodes().forEach((v) => {
-        const x = g.node(v).x + g.node(v).width / 2.0;
-        const y = g.node(v).y + g.node(v).height / 2.0;
-        if (x > bb.width) bb.width = x;
-        if (y > bb.height) bb.height = y;
+        const x = v.x + v.width / 2.0;
+        const y = v.y + v.height / 2.0;
+        bb.width = Math.max(x, bb.width);
+        bb.height = Math.max(y, bb.height);
     });
 
     return bb;
diff --git a/src/utils/colors.ts b/src/utils/colors.ts
new file mode 100644
index 00000000..2a812e21
--- /dev/null
+++ b/src/utils/colors.ts
@@ -0,0 +1,79 @@
+// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
+
+import * as PIXI from 'pixi.js';
+
+export function stringToColor(s: string): [rgbHex: number, alpha: number] {
+    s = s.trim();
+
+    if (s === 'transparent')
+        return [0, 0];
+    if (s.startsWith('#') && s.length >= 8) {
+        return [
+            stringToColor(s.substring(0, s.length - 2))[0],
+            parseInt(s.substring(s.length - 2), 16) / 255
+        ];
+    }
+
+    const res = PIXI.utils.string2hex(s);
+    if (res !== res) { // NaN
+        throw new Error(`Unknown color: ${s}. Not all CSS colors are supported; please use hex colors`);
+    }
+    return [res, 1];
+}
+
+export function colorToString(rgbHex: number, alpha: number): string {
+    return `rgba(${[...PIXI.utils.hex2rgb(rgbHex)].map(x => 255 * x).join(', ')}, ${alpha})`;
+}
+
+/**
+ * Returns a temperature color from green (0) over yellow (0.5) to red (1). Any values outside this range will be clamped.
+ */
+export function getTemperatureRGBHex(temperature: number): number {
+    temperature = Math.min(1, Math.max(0, temperature));
+
+    return PIXI.utils.rgb2hex([
+        Math.min(1, temperature * 2),
+        Math.min(1, (1 - temperature) * 2),
+        0,
+    ]);
+}
+
+/**
+ * Returns the color that results from overlaying all the given colors in order. This is not useful if all colors are
+ * fully opaque.
+ * 
+ * For example, overlaying `rgba(255, 255, 0, 1)` (fully opaque yellow) with `rgba(255, 0, 0, 0.5)` (semi-opaque red)
+ * will return orange.
+ */
+export function overlayColors(...colors: [rgbHex: number, alpha: number][]): [rgbHex: number, alpha: number] {
+    if (colors.length === 0) {
+        return [0, 0];
+    } else if (colors.length === 1) {
+        return colors[0];
+    } else {
+        /*
+         * If the first color is fully opaque, we can use the opacity formula `(1-alpha)*baseC + alpha*newC`. If it's
+         * not, we have to find a color `resC` such that for every fully opaque color `baseC`,
+         * `overlayColors(baseC, ...colors)` equals `overlayColors(baseC, resC)`.
+         * 
+         * ```ts
+         * overlayColorChannels([baseC, 1], [c1, a1], [c2, a2])
+         * = (1-a2)*overlayColorChannels([baseC, 1], [c1, a1]) + a2*c2
+         * = (1-a2)*((1-a1)*baseC + a1*c1) + a2*c2
+         * = (1-a2)*(1-a1)*baseC + (1-a2)*a1*c1 + a2*c2
+         * = (1-(a1+a2-a1*a2))*baseC + (1-a2)*a1*c1 + a2*c2
+         * = (1-(a1+a2-a1*a2))*baseC + (a1+a2-a1*a2)*((a1-a1*a2)*c1 + a2*c2)/(a1+a2-a1*a2))
+         * = overlayColorChannels([baseC, 1], [((a1-a1*a2)*c1 + a2*c2)/(a1+a2-a1*a2), a1+a2-a1*a2])
+         * ```
+         */
+        const color1 = [...PIXI.utils.hex2rgb(colors[0][0])];
+        const color2 = [...PIXI.utils.hex2rgb(colors[1][0])];
+        const alpha1 = colors[0][1];
+        const alpha2 = colors[1][1];
+
+        const newAlpha = alpha1 + alpha2 - alpha1 * alpha2;
+        const resC = color1.map((c1, i) => ((newAlpha - alpha2) * c1 + alpha2 * color2[i]) / newAlpha);
+
+        return overlayColors([PIXI.utils.rgb2hex(resC), newAlpha], ...colors.slice(2));
+    }
+}
diff --git a/src/utils/constants.ts b/src/utils/constants.ts
new file mode 100644
index 00000000..e694c43d
--- /dev/null
+++ b/src/utils/constants.ts
@@ -0,0 +1,6 @@
+export const CONNECTOR_SIZE = 10;
+export const CONNECTOR_SPACING = 10;
+export const EPSILON = 1e-10;
+export const DEBUG = false;
+export const LINEHEIGHT = 10;
+export const STATE_MARGIN = 4 * LINEHEIGHT;
diff --git a/src/utils/context_menu.js b/src/utils/context_menu.js
index d1e5ebcb..d713785b 100644
--- a/src/utils/context_menu.js
+++ b/src/utils/context_menu.js
@@ -46,6 +46,11 @@ export class ContextMenu {
         });
     }
 
+    /**
+     * @param {string} name
+     * @param {boolean} checked
+     * @param {(MouseEvent, boolean) => void} onselect
+     */
     addCheckableOption(name, checked, onselect, onhover = null) {
         this._options.push({
             name: name,
@@ -98,9 +103,9 @@ export class ContextMenu {
                     markelem.classList = x.checked ? 'checkmark_checked' : 'checkmark';
                     elem.appendChild(markelem);
                     elem.innerHTML += htmlSanitize`${x.name}`;
-                    elem.addEventListener('click', elem => {
+                    elem.addEventListener('click', event => {
                         x.checked = !x.checked;
-                        x.func(elem, x.checked);
+                        x.func(event, x.checked);
                     });
                 } else {
                     elem.innerText = x.name;
diff --git a/src/utils/loading_spinner.ts b/src/utils/loading_spinner.ts
new file mode 100644
index 00000000..67ed98a9
--- /dev/null
+++ b/src/utils/loading_spinner.ts
@@ -0,0 +1,86 @@
+/**
+ * Loading indicator courtesy of loading.io/css - licensed CC0
+ */
+function ellipsisSpinnerHTML() {
+    const className = `dace-loading-ellipsis-${Math.random() * 1_000_000 | 1}`;
+    return `
+        <div class="${className}-parent" style="position: absolute; top: 0; bottom: 0; left: 0; right: 0; display: flex; flex-direction: column; justify-content: center; align-items: center;">
+            <style>
+                .${className}-parent > * {
+                    position: relative;
+                    animation: ${className}-fadein 0.1s 0.25s forwards;
+                    opacity: 0%;
+                }
+                .${className} {
+                    width: 80px;
+                    height: 80px;
+                }
+                .${className} div {
+                    position: absolute;
+                    top: 33px;
+                    width: 13px;
+                    height: 13px;
+                    border-radius: 50%;
+                    background: var(--loading-spinner-color, #000000);
+                    animation-timing-function: cubic-bezier(0, 1, 1, 0);
+                }
+                .${className} div:nth-of-type(1) {
+                    left: 8px;
+                    animation: ${className}-anim1 0.6s infinite;
+                }
+                .${className} div:nth-of-type(2) {
+                    left: 8px;
+                    animation: ${className}-anim2 0.6s infinite;
+                }
+                .${className} div:nth-of-type(3) {
+                    left: 32px;
+                    animation: ${className}-anim2 0.6s infinite;
+                }
+                .${className} div:nth-of-type(4) {
+                    left: 56px;
+                    animation: ${className}-anim3 0.6s infinite;
+                }
+                @keyframes ${className}-anim1 {
+                    0% { transform: scale(0); }
+                    100% { transform: scale(1); }
+                }
+                @keyframes ${className}-anim3 {
+                    0% { transform: scale(1); }
+                    100% { transform: scale(0); }
+                }
+                @keyframes ${className}-anim2 {
+                    0% { transform: translate(0, 0); }
+                    100% { transform: translate(24px, 0); }
+                }
+                @keyframes ${className}-fadein {
+                    0% { opacity: 0; }
+                    100% { opacity: 1; }
+                }
+            </style>
+            <div class="${className}">
+                <div></div>
+                <div></div>
+                <div></div>
+                <div></div>
+            </div>
+        </div>
+    `;
+}
+
+export function createSpinner(caption = ''): {
+    element: ChildNode,
+    setCaption: (s: string) => void,
+} {
+    const template = document.createElement('template');
+    template.innerHTML = ellipsisSpinnerHTML().trim();
+
+    const cap = document.createElement('div');
+    cap.innerText = caption;
+    cap.style.whiteSpace = 'nowrap';
+    template.content.firstChild?.appendChild(cap);
+
+    return {
+        element: template.content.firstChild!,
+        setCaption: (s) => cap.innerText = s,
+    };
+}
diff --git a/src/utils/pdf.ts b/src/utils/pdf.ts
new file mode 100644
index 00000000..0a0e9c97
--- /dev/null
+++ b/src/utils/pdf.ts
@@ -0,0 +1,142 @@
+// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
+
+import * as PIXI from 'pixi.js';
+// @ts-ignore canvas2pdf has no type definitions
+import canvas2pdf from 'canvas2pdf';
+import blobStream from 'blob-stream';
+import { colorToString } from './colors';
+
+export async function pixiObjectToPdf(displayObject: PIXI.DisplayObject, size: readonly [number, number] | null): Promise<Blob> {
+    return await new Promise(resolve => {
+        const ctx = new canvas2pdf.PdfContext(blobStream(), {
+            size: size ?? [displayObject.getLocalBounds().width, displayObject.getLocalBounds().height],
+        });
+
+        drawPixiObject(displayObject, ctx);
+
+        ctx.stream.on('finish', () => {
+            const blob = ctx.stream.toBlob('application/pdf');
+            resolve(blob);
+        });
+        ctx.end();
+    });
+}
+
+function drawPixiObject(obj: PIXI.DisplayObject, ctx: CanvasRenderingContext2D) {
+    if (!obj.visible) return;
+
+    ctx.save();
+
+    ctx.translate(obj.x, obj.y);
+    ctx.scale(obj.scale.x, obj.scale.y);
+
+
+    switch (Object.getPrototypeOf(obj)) {
+        case PIXI.Container.prototype: {
+            // nothing to do here!
+            break;
+        }
+        case PIXI.Graphics.prototype: {
+            const gfx = obj as PIXI.Graphics;
+            for (const gfxData of gfx.geometry.graphicsData) {
+                ctx.save();
+
+                ctx.fillStyle = colorToString(gfxData.fillStyle.color, gfxData.fillStyle.alpha);
+                ctx.strokeStyle = colorToString(gfxData.lineStyle.color, gfxData.lineStyle.alpha);
+                ctx.lineWidth = gfxData.lineStyle.width;
+                ctx.lineCap = gfxData.lineStyle.cap;
+                ctx.lineJoin = gfxData.lineStyle.join;
+
+                for (const action of ['fill', 'stroke'] as const) {
+                    if (action === 'fill' && !gfxData.fillStyle.visible) continue;
+                    if (action === 'stroke' && !gfxData.lineStyle.visible) continue;
+
+                    switch (gfxData.shape.type) {
+                        case PIXI.SHAPES.RECT: {
+                            ctx[`${action}Rect` as const](
+                                gfxData.shape.x,
+                                gfxData.shape.y,
+                                gfxData.shape.width,
+                                gfxData.shape.height,
+                            );
+                            break;
+                        }
+                        case PIXI.SHAPES.POLY: {
+                            ctx.beginPath();
+                            ctx.moveTo(gfxData.shape.points[0], gfxData.shape.points[1]);
+                            for (let i = 2; i < gfxData.shape.points.length; i += 2) {
+                                ctx.lineTo(gfxData.shape.points[i], gfxData.shape.points[i + 1]);
+                            }
+                            if (gfxData.shape.closeStroke) ctx.closePath();
+                            ctx[action]();
+                            break;
+                        }
+                        case PIXI.SHAPES.CIRC: {
+                            ctx.beginPath();
+                            ctx.arc(gfxData.shape.x, gfxData.shape.y, gfxData.shape.radius, 0, 2 * Math.PI);
+                            ctx[action]();
+                            break;
+                        }
+                        case PIXI.SHAPES.ELIP: {
+                            const x = gfxData.shape.x;
+                            const y = gfxData.shape.y;
+                            const rx = gfxData.shape.width;
+                            const ry = gfxData.shape.height;
+
+                            ctx.beginPath();
+
+                            // The PDF library doesn't have ellipse support, so be smart about it
+                            ctx.save();
+                            ctx.translate(x - rx, y - ry);
+                            ctx.scale(rx, ry);
+                            ctx.arc(1, 1, 1, 0, 2 * Math.PI);
+                            ctx.restore();
+
+                            ctx[action]();
+                            break;
+                        }
+                        default: {
+                            console.error('Unsupported graphics data shape type!', gfxData, gfx);
+                            throw new Error(`Unsupported graphics data shape type! ${gfxData.shape.type}`);
+                        }
+                    }
+                }
+
+                ctx.restore();
+            }
+
+            break;
+        }
+        case PIXI.Text.prototype: {
+            const text = obj as PIXI.Text;
+
+            let fontSize = text.style.fontSize ?? 26;
+            if (typeof fontSize === 'number') fontSize = fontSize + 'px';
+
+            const fillStyle = text.style.fill ?? 'black';
+            if (typeof fillStyle === 'number' || Array.isArray(fillStyle)) throw new Error('Unsupported fillStyle value!');
+
+            // PDF font availability is very limited, so we always use Courier and re-center the text
+            ctx.font = `${fontSize} Courier`;
+            const extraX = (ctx.measureText(text.text).width - text.width) / 2;
+            ctx.fillStyle = fillStyle;
+            // set baseline to top as a work-around to roughly get Pixi's text alignment
+            ctx.textBaseline = 'top';
+            ctx.fillText(text.text, extraX, 0);
+
+            break;
+        }
+        default: {
+            console.error('Unsupported Pixi object type for PDF conversion!', obj);
+            throw new Error(`Unsupported Pixi object type for PDF conversion! ${obj.constructor.name}`);
+        }
+    }
+
+    if (obj instanceof PIXI.Container) {
+        [...obj.children].sort((a, b) => a.zIndex - b.zIndex).forEach(child => {
+            drawPixiObject(child, ctx);
+        });
+    }
+
+    ctx.restore();
+}
diff --git a/src/utils/sanitization.ts b/src/utils/sanitization.ts
index 1546acbd..f82b1f4c 100644
--- a/src/utils/sanitization.ts
+++ b/src/utils/sanitization.ts
@@ -6,7 +6,7 @@ export function escapeHTML(s: string): string {
         ['<', '&lt;'],
         ['>', '&gt;'],
         ['"', '&quot;'],
-        ["'", '&#039;'],
+        ['\'', '&#039;'],
     ]);
 
     return `${s}`.replace(/[&<>"']/g, m => escapeCharacters.get(m)!);
diff --git a/src/utils/sdfg/display.js b/src/utils/sdfg/display.js
index c5b77945..f4adade0 100644
--- a/src/utils/sdfg/display.js
+++ b/src/utils/sdfg/display.js
@@ -7,7 +7,7 @@ export function sdfg_range_elem_to_string(range, settings = null) {
     if (range.start == range.end && range.step == 1 && range.tile == 1)
         preview += sdfg_property_to_string(range.start, settings);
     else {
-        if (settings && settings.inclusive_ranges) {
+        if (settings && settings.inclusiveRanges) {
             preview += sdfg_property_to_string(range.start, settings) + '..' +
                 sdfg_property_to_string(range.end, settings);
         } else {
diff --git a/src/utils/sdfg/sdfg_utils.js b/src/utils/sdfg/sdfg_utils.js
index 68767ecd..7e531d44 100644
--- a/src/utils/sdfg/sdfg_utils.js
+++ b/src/utils/sdfg/sdfg_utils.js
@@ -1,8 +1,6 @@
 // Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
 
-import { SDFGElements } from "../../renderer/renderer_elements";
-
-const { NestedSDFG } = SDFGElements;
+import { NestedSDFG } from "../../renderer/renderer_elements";
 
 export function recursively_find_graph(graph, graph_id, ns_node = undefined) {
     if (graph.node(0).sdfg.sdfg_list_id === graph_id) {
diff --git a/src/utils/sdfg/traversal.js b/src/utils/sdfg/traversal.js
index 2f85d26e..36f4cf60 100644
--- a/src/utils/sdfg/traversal.js
+++ b/src/utils/sdfg/traversal.js
@@ -1,5 +1,32 @@
 // Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
 
+export function traverse_sdfg(sdfg, func) {
+    sdfg.nodes.forEach((state, state_id) => {
+        // States
+        func('states', { sdfg: sdfg, id: state_id }, state);
+
+        state.nodes.forEach((node, node_id) => {
+            // Nodes
+            func('nodes', { sdfg: sdfg, state: state_id, id: node_id }, node);
+
+            // If nested SDFG, traverse recursively
+            if (node.type === "NestedSDFG" && !node.attributes.is_collapsed)
+                traverse_sdfg(node.attributes.sdfg, func);
+        });
+
+        // Edges
+        state.edges.forEach((edge, edge_id) => {
+            func('edges', { sdfg: sdfg, state: state_id, id: edge_id }, edge);
+        });
+    });
+
+    // Selected inter-state edges
+    sdfg.edges.forEach((isedge, isedge_id) => {
+        func('isedges', { sdfg: sdfg, id: isedge_id }, isedge);
+    });
+}
+
+
 /**
  * Receives a callback that accepts (node, parent graph) and returns a value.
  * This function is invoked recursively per scope (including scope nodes), unless the return
@@ -44,7 +71,7 @@
             processed_nodes.add(node.id.toString());
         }
     }
-    scopes_recursive(sdfg, sdfg.nodes());
+    scopes_recursive(sdfg, new Array(sdfg.numNodes()).fill(0).map((_, i) => i));
 }
 
 
diff --git a/src/utils/sdfg/types.ts b/src/utils/sdfg/types.ts
new file mode 100644
index 00000000..24eead12
--- /dev/null
+++ b/src/utils/sdfg/types.ts
@@ -0,0 +1,37 @@
+export type SDFGData = {
+    type: 'SDFG',
+    nodes: SDFGNode[],
+    // eslint-disable-next-line camelcase
+    sdfg_list_id: number,
+    [K: number]: any
+};
+
+export type SDFGNode = SDFGBaseNode<string>;
+
+type SDFGBaseNode<T extends string> = {
+    type: T,
+    label: string,
+    attributes: SDFGAttributes,
+    nodes?: SDFGNode[] | undefined,
+    edges?: any[] | undefined,
+    id: number,
+};
+
+export type SDFGAttributes = {
+    label: string,
+    // eslint-disable-next-line camelcase
+    is_collapsed?: boolean | undefined,
+    sdfg: SDFGData,
+    layout?: {
+        x: number,
+        y: number,
+        width: number,
+        height: number,
+    }
+}
+
+export type SDFGStateNode = SDFGBaseNode<'SDFGStateNode'> & {
+    attributes: any,
+    nodes: SDFGNode[],
+    edges: any[],
+};
diff --git a/src/overlay_manager.js b/src/utils/symbol_resolver.js
similarity index 66%
rename from src/overlay_manager.js
rename to src/utils/symbol_resolver.js
index a984dd07..ceac986b 100644
--- a/src/overlay_manager.js
+++ b/src/utils/symbol_resolver.js
@@ -1,32 +1,25 @@
-// Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
-
-import { createElement } from "./utils/utils";
-import { GenericSdfgOverlay } from './overlays/generic_sdfg_overlay';
-import { RuntimeMicroSecondsOverlay } from './overlays/runtime_micro_seconds_overlay';
-import { StaticFlopsOverlay } from './overlays/static_flops_overlay';
-import { MemoryVolumeOverlay } from './overlays/memory_volume_overlay';
+import { createElement } from "./utils";
 import { parse } from 'mathjs';
-import { htmlSanitize } from "./utils/sanitization";
+import { htmlSanitize } from "./sanitization";
 
-class SymbolResolver {
+export class SymbolResolver {
 
-    constructor(renderer) {
-        this.renderer = renderer;
-        this.sdfg = this.renderer.sdfg;
+    constructor(sdfg) {
+        this.sdfg = sdfg;
         this.vscode = typeof vscode !== 'undefined' && vscode;
 
         // Initialize the symbol mapping to the graph's symbol table.
-        this.symbol_value_map = {};
-        Object.keys(this.sdfg.attributes.symbols).forEach((s) => {
-            if (this.sdfg.attributes.constants_prop !== undefined &&
-                Object.keys(this.sdfg.attributes.constants_prop).includes(s) &&
-                this.sdfg.attributes.constants_prop[s][0]['type'] === 'Scalar')
-                this.symbol_value_map[s] = this.sdfg.attributes.constants_prop[
-                    s
-                ][1];
-            else
-                this.symbol_value_map[s] = undefined;
-        });
+        this.symbol_value_map = Object.create(null);
+        if (this.sdfg.attributes.symbols) {  // some files generated by previous versions don't have a symbols attribute, in that case skip this step
+            Object.keys(this.sdfg.attributes.symbols).forEach((s) => {
+                if (this.sdfg.attributes.constants_prop !== undefined &&
+                    Object.keys(this.sdfg.attributes.constants_prop).includes(s) &&
+                    this.sdfg.attributes.constants_prop[s][0]['type'] === 'Scalar')
+                    this.symbol_value_map[s] = this.sdfg.attributes.constants_prop[s][1];
+                else
+                    this.symbol_value_map[s] = undefined;
+            });
+        }
         this.symbols_to_define = [];
 
         this.init_overlay_popup_dialogue();
@@ -51,12 +44,12 @@ class SymbolResolver {
                 this.prompt_define_symbol(mapping, callback);
             } else {
                 try {
-                    const evaluated =
-                        expression_tree.evaluate(mapping);
+                    const evaluated = expression_tree.evaluate(mapping);
                     if (evaluated !== undefined &&
                         !isNaN(evaluated) &&
                         Number.isInteger(+evaluated))
                         result = +evaluated;
+
                     else
                         result = undefined;
                 } catch (e) {
@@ -151,7 +144,7 @@ class SymbolResolver {
             ['sdfv_modal_content'], content_box);
         this.popup_dialogue._input = createElement('input', 'symbol_input',
             ['sdfv_modal_input_text'], this.popup_dialogue._content);
-        
+
         function set_val() {
             if (popup_dialogue._map && popup_dialogue._symbol) {
                 let val = popup_dialogue._input.value;
@@ -198,94 +191,4 @@ class SymbolResolver {
             popup_dialogue._hide();
         });
     }
-
-}
-
-export class OverlayManager {
-
-    constructor(renderer) {
-        this.renderer = renderer;
-
-        this.badness_scale_method = 'median';
-
-        this.overlays = [];
-
-        this.symbol_resolver = new SymbolResolver(this.renderer);
-    }
-
-    register_overlay(type) {
-        switch (type) {
-            case MemoryVolumeOverlay:
-            case StaticFlopsOverlay:
-            case RuntimeMicroSecondsOverlay:
-                this.overlays.push(
-                    new type(this, this.renderer)
-                );
-                break;
-            default:
-                // Object overlay
-                this.overlays.push(type);
-                break;
-        }
-        this.renderer.draw_async();
-    }
-
-    deregister_overlay(type) {
-        this.overlays = this.overlays.filter(overlay => {
-            return !(overlay instanceof type);
-        });
-
-        this.renderer.draw_async();
-    }
-
-    is_overlay_active(type) {
-        return this.overlays.filter(overlay => {
-            return overlay instanceof type;
-        }).length > 0;
-    }
-
-    get_overlay(type) {
-        let overlay = undefined;
-        this.overlays.forEach(ol => {
-            if (ol instanceof type) {
-                overlay = ol;
-                return;
-            }
-        });
-        return overlay;
-    }
-
-    symbol_value_changed(symbol, value) {
-        this.symbol_resolver.symbol_value_changed(symbol, value);
-        this.overlays.forEach(overlay => {
-            overlay.refresh();
-        });
-    }
-
-    update_badness_scale_method(method) {
-        this.badness_scale_method = method;
-        this.overlays.forEach(overlay => {
-            overlay.refresh();
-        });
-    }
-
-    draw() {
-        this.overlays.forEach(overlay => {
-            overlay.draw();
-        });
-    }
-
-    refresh() {
-        this.overlays.forEach(overlay => {
-            overlay.refresh();
-        });
-    }
-
-    on_mouse_event(type, ev, mousepos, elements, foreground_elem, ends_drag) {
-        this.overlays.forEach(overlay => {
-            overlay.on_mouse_event(type, ev, mousepos, elements,
-                foreground_elem, ends_drag);
-        });
-    }
-
 }
diff --git a/src/utils/utils.ts b/src/utils/utils.ts
index 3b120447..fd9e0df3 100644
--- a/src/utils/utils.ts
+++ b/src/utils/utils.ts
@@ -4,6 +4,14 @@ export function equals<T>(a: T, b: T): boolean {
     return JSON.stringify(a) === JSON.stringify(b);
 }
 
+export function arrayEquals(a: readonly unknown[], b: readonly unknown[]): boolean {
+    return a.length === b.length && a.every((e, i) => e === b[i]);
+}
+
+export function setEquals(a: ReadonlySet<unknown>, b: ReadonlySet<unknown>): boolean {
+    return a.size === b.size && [...a].every(e => b.has(e));
+}
+
 
 export function deepCopy<T>(obj: T): T {
     if (typeof obj !== 'object' || obj === null) return obj;
@@ -36,9 +44,9 @@ export function createElement<K extends keyof HTMLElementTagNameMap>(
     if (id !== '')
         element.id = id;
     if (classList !== [])
-        classList.forEach(class_name => {
-            if (!element.classList.contains(class_name))
-                element.classList.add(class_name);
+        classList.forEach(className => {
+            if (!element.classList.contains(className))
+                element.classList.add(className);
         });
     if (parent)
         parent.appendChild(element);
diff --git a/webpack.config.js b/webpack.config.js
index 958d4748..c9094417 100644
--- a/webpack.config.js
+++ b/webpack.config.js
@@ -1,10 +1,10 @@
 // This file uses CommonJS require instead of ES6 imports because it is not transpiled
 const path = require('path');
+const webpack = require('webpack');
 
 module.exports = {
     entry: {
         sdfv: './src/sdfv.js',
-        main: './src/main.js',
     },
     module: {
         rules: [
@@ -17,7 +17,16 @@ module.exports = {
     },
     resolve: {
         extensions: ['.ts', '.js'],
+        fallback: {
+            stream: require.resolve("stream-browserify/"),
+            util: require.resolve("util/"),
+        },
     },
+    plugins: [
+        new webpack.ProvidePlugin({
+            process: 'process/browser'
+        }),
+    ],
     devtool: 'source-map',
     devServer: {
         publicPath: '/dist/',